From b5b61a218818d1b4b96a6dd8251e8a133a737be3 Mon Sep 17 00:00:00 2001
From: Nemesis direct author <nemesis@users.noreply.github.com>
Date: Mon, 19 Oct 2026 04:51:13 -0500
Subject: [PATCH] Fog: add 120 frontier public-result nodes
 (nemesis-frontier-arxiv-b-20261018-r1)

---
 .../fog-of-knowledge/data/atlas-display.json  |     2 +-
 .../data/atlas-navigation.json                |   878 +-
 .../fog-of-knowledge/data/evidence-index.json |   124 +-
 ...b640406394484358c1c81d06a7f9cfff1917d.json |    15 +
 ...9c608294cb12017ad3a786775a89e026cdf37.json |    15 +
 ...acf5027dd408e3e83c5d6277c704525b47616.json |    15 +
 ...fdcff9630bd1d8bbaf06b78478b130c62070c.json |    15 +
 ...db592ef066784d14b98ac58649fdf78d70b73.json |    15 +
 ...29af558a1e4b6915b8685495aa511ed5e76fa.json |    15 +
 ...b4d714bd1099c6668446b296ad64d8aa30313.json |    15 +
 ...c80e57a4216926b70df4a9acb29242f8db306.json |    15 +
 ...4d883eb484f4edbbd0f00de52f7d401aea072.json |    15 +
 ...3518bf1f494b81decce86614cd14d72558a23.json |    15 +
 ...216a9871820fd47c42c21d0ce6a9c5b9c0f9e.json |    15 +
 ...622ff1979175cd5897a49782fba7d181d2024.json |    15 +
 ...36f61b4971716a426afbce94894af3029bc6e.json |    15 +
 ...caf5e0e89b48fef17e6dfd1df013f81804df0.json |    15 +
 ...a48c2c7cb113d64cc4527ccf9373a05fe2300.json |    15 +
 ...0c981b9870bc6590bfd0df2da53c007f208be.json |    15 +
 ...2f658f86583c599568e5d70448d8989897725.json |    15 +
 ...f8df9d4ae4b4d5692f12f4b6d6aa787508f89.json |    15 +
 ...8ecb9e0f452f780bd04061da3e6252af05571.json |    15 +
 ...1a2761333b8554a89d150529e38b3acbbfdd6.json |    15 +
 ...05bead3ad09a48326c8b6643b1a1b6b608927.json |    15 +
 ...eb2f6a491eedba5bbbffae0ac953b21a84d2b.json |    15 +
 ...a468471a40db8372ad00a36a8ec82ac6a5391.json |    15 +
 ...e75040ee631942baa9036303fc161b695f139.json |    15 +
 ...c30d92ce80c3ff70d67c5f1487cd234c42a5f.json |    15 +
 ...aebd2579c49777c749a6b4c81ce2d2d0f33d3.json |    15 +
 ...2ecc5cb405cdc36ae53a76ca518ad96185590.json |    15 +
 ...19daee701918e94406754aa2a41d1729bd437.json |    15 +
 ...8eeba287f7eb84b14e376956ff36316e9bd82.json |    15 +
 ...18f3af33637a80d72e1eda7562915c3f55c28.json |    15 +
 ...237246303f0c6ab1bf630111aabbf80946629.json |    15 +
 ...2e5ee8e4e77d3eaa824ceea2f996aa38e39c2.json |    15 +
 ...ae496537f4827f6b260df8be27d4f92ecbd03.json |    15 +
 ...dfc7532db1c975b0c40e0dbb45ee200fb8a7a.json |    15 +
 ...248b2e708b706d1ddad08cc8dfd0abec9f5b3.json |    15 +
 ...cea26ae5f710bd444846e96e266bdb1426301.json |    15 +
 ...136faf9446272f232eaae8421f21cca04c757.json |    15 +
 ...6cec12efd0151758f60257372b8262390032a.json |    15 +
 ...0c44d58300edc5853896cc13918a3de91b9ec.json |    15 +
 ...91910ee72719e80ad4ec151252825e723b7d3.json |    15 +
 ...29c0557b89df17734b90d64b99c41d53daab6.json |    15 +
 ...098583e56c1afd24a5819229ca5f090ac80f1.json |    15 +
 ...db0f648d40482c5c21f18cce92dd9335a3cc0.json |    15 +
 ...fd7cc1904bc4461acab7b9c721a78051f3f80.json |    15 +
 ...2b93cd129cbce5d4400e5731ecd5828fbf59b.json |    15 +
 ...7c2d2af1b6c8be0b022aa841e7d05f2692180.json |    15 +
 ...16dc722422ab1d919bb39f519d43d545923a3.json |    15 +
 ...fd53a185de37a006459dc399d8291fd663aec.json |    15 +
 ...dbad63b2afebfe8d982d2bc4985532ca50736.json |    15 +
 ...843a9485b787e9c51ed308a5acc328415f6e9.json |    15 +
 ...ace31cc65841b308356fef514402b4170a21e.json |    15 +
 ...c26c14c083753284bbc415cb32afa1dc9bfad.json |    15 +
 ...3cbaacd837a1fcb121e93aa2aee1999c69106.json |    15 +
 ...81d233c6970f14f845ce870c1ccec40478e12.json |    15 +
 ...f323ac6f7f241297b06e9e32eef2ae2cab441.json |    15 +
 ...61f7682044a7162042c793b5847585153ba3f.json |    15 +
 ...2da8998a25dd04512ec58415a05fff45d2ec8.json |    15 +
 ...b038398e96e12f080c5271574d5bfa574843c.json |    15 +
 ...3222665c5f4c95d430f7a3b61fd4139043e6f.json |    15 +
 ...16c5450455d15dbb6206e01b0f96ca0d18666.json |    15 +
 ...4848aa9ba3ac9a1945b06480265e574877950.json |    15 +
 ...10a8d42a1ffa33863a835416f546366db2b99.json |    15 +
 ...b3c8e0f0796980a2a089b760e506d435eac3f.json |    15 +
 ...813495e471dcfa3d046234d31c3fd53a0113f.json |    15 +
 ...f9fcfdb9129225fcd2e7ff087e7dd990ea799.json |    15 +
 ...fbff858af1e9a69fe2efa8cdcf9e493960be7.json |    15 +
 ...bf85bf97876bfd3d29177236c5364702249d2.json |    15 +
 ...b32c42ab2ff7b76d8f3e71f2886090fd2a814.json |    15 +
 ...d2da376cb75f3d58416e4f73d6e9533d91b67.json |    15 +
 ...6e9040c0d0d42dd45c51ab293e971ced01e40.json |    15 +
 ...995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e.json |    15 +
 ...ba32aa22fdd2a538f46f230436fa0b8150274.json |    15 +
 ...46629779108464df9f8b859b2629d22a92f43.json |    15 +
 ...040a5a927991bb16810e7b1ab942b0108f257.json |    15 +
 ...a4f36da91193b7937bb6a1f7a7a750e1eb2ba.json |    15 +
 ...91900067ed184dde122242134a55c6fa1ab82.json |    15 +
 ...3be9f5703103e3a680ca112e82d3ca32a58ac.json |    15 +
 ...e89d20839be9e1a0154b4123b72adebe58077.json |    15 +
 ...243bb688d60cde0f095f6c4eef242603e3e9c.json |    15 +
 ...c7dab11c516d0aec44fdfeda3b7801d0b85ca.json |    15 +
 ...1b9df4f6d04059d80b02216eb38cdbd762492.json |    15 +
 ...aeba855ac3dd606f1a6127834cf1471a99056.json |    15 +
 ...16b39526cadcf2645c5ed25e35e0fb17102b1.json |    15 +
 ...b26a207f68247ab40bfbb244b9f4a71967590.json |    15 +
 ...373eae34a771bbf3f86214db4c33991470fda.json |    15 +
 ...d2b3e9d2cbb6bbaa2026791401736f2df0892.json |    15 +
 ...4278cba2695c2bcea5df8f05249894bf49ef3.json |    15 +
 ...cbb962475c141092034c13b7a3cb46dfe155e.json |    15 +
 ...a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da.json |    15 +
 ...5230a09b72f6df1b8a2928c21e9bd0fe6dcab.json |    15 +
 ...9dc535c2e049646ac235532a72807955141ba.json |    15 +
 ...ff3524399c0e18f1fa758f23f4f5885535ff2.json |    15 +
 ...52e91229a56aa1f3b90ffeab7008b6c2463af.json |    15 +
 ...36bd909d10943221ea60aba114a15cec7d661.json |    15 +
 ...2dd07bcc7d384914f8c1f8b1be5bb8885c28c.json |    15 +
 ...1900a15781e084bae3e497e34b645352f768f.json |    15 +
 ...80d7323c768e0b56b6432b75750a911f5e4e6.json |    15 +
 ...27cbfb751efa62ba89ba091e18f8cc85b9c7a.json |    15 +
 ...1afaaad82d85b850a991cf498733ec9f27cae.json |    15 +
 ...45db2a59ac79322712878fd5e4551ecbe93fe.json |    15 +
 ...8fbde0069f10f36b70b62160abdc41c05dcf2.json |    15 +
 ...7722b05d5624dc81bac143cf3b774430ffaff.json |    15 +
 ...3aa1a61df64abf1ca013805f821de6c3032a1.json |    15 +
 ...4a1b584c3a0951b9bddc1e696979f31d62540.json |    15 +
 ...a589643518888ec360f7590a339dc4b95e37e.json |    15 +
 ...545375d86d5ffa87956ae8d96219d9ce02ba5.json |    15 +
 ...6a266e5f0ab51d53315f75a3274798415204c.json |    15 +
 ...0acaa0b727316d5aa4f5d2e2b137bc1fe393d.json |    15 +
 ...22f1804fac3fd61cf7dbeef5bb65b79c803b8.json |    15 +
 ...592f4bd2ad88960bb0438bec382ffcd96bc3a.json |    15 +
 ...489d051cbe319ed1f7ccd33f58bc1f43deda7.json |    15 +
 ...2a0513f0fdc217836824d73c07155591e8f65.json |    15 +
 ...4a5c3a90b853fa57d37cd6f0e7325de4cf1f8.json |    15 +
 ...116de6bc66d9ccffa805b5daa2453cc59b93d.json |    15 +
 ...680bc5009aa88c95b95cbb1cb1e5239dc3bcf.json |    15 +
 ...9044e24098584294a99cb55e0d580ee93122c.json |    15 +
 ...d58c61fe250764eeba5d529f8773f9fc69d95.json |    15 +
 ...28d5479a5038d3410d175b3d60c443fb2415e.json |    15 +
 ...383a7060311d4841445bdb64409e0f988a162.json |    15 +
 ...3cedffc6390727920114d3cd71d44eb7a7409.json |    15 +
 ...77cd25b89d8dd346853b9de1fb7fdd7dad3268.bin |    58 +
 ...258aa0e8ddde104ab1b338f721310239b8cb6e.bin |    51 +
 ...f52a2dfb080788a6f743467aae4efc11a8ac59.bin |    46 +
 ...0856f3cc61de9e1e67670661e0b77fc21a36ed.bin |    46 +
 ...3231b3bc479106eb01dd3b8be4333dbef179ff.bin |    57 +
 ...4582d9309bcfea913d78adabf7f3d656a8b71b.bin |    44 +
 ...9ae39c6ccfac75b13739c3e88dd6ca9062c0f1.bin |    47 +
 ...322406f635024a3e83d30b46f532568876e8d0.bin |    60 +
 ...300e287ee02597ea7bf92d1a9e63fc05c9eb9b.bin |    48 +
 ...0f38b5702ac18b7e380a7233ddaae4bbcabf14.bin |    46 +
 ...e163760878148cee62fef9b5fca63a5ad408ee.bin |    43 +
 ...ec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.bin |    50 +
 ...0bd616a90c1651a444531cf4a292f7cde82aee.bin |    67 +
 ...47545b5904c3d847ae986132578eb9ef321316.bin |    46 +
 ...e1316407fd72f0b63c2e0fb8bf005148204989.bin |    44 +
 ...582d35af778d46a872dec902bb8787d29de34a.bin |    58 +
 ...8e1991317fb7dcf206399e678df49f0a547f44.bin |    56 +
 ...d001fbbd75a9a62e09ff9fcc883d962a01437d.bin |   367 +
 ...265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.bin |    47 +
 ...bcd09dd6ebd085290f52f7fea17aac0479a20d.bin |    38 +
 ...ea2c7611c4496066b701d2b7c116dbaea470cc.bin |    40 +
 ...7b1f0e4880f38bd83463ad4452f2b522aa12aa.bin |    41 +
 ...5b8d1d11ec2134b25275e6e76bffc5d4b36008.bin |    62 +
 ...177c767b4387f6af42cfc2e1eef937af26fe31.bin |    50 +
 ...bf924a3c98c12c32aa18504d6828f119cd5524.bin |    57 +
 ...6a621b8a4e1317df857e2b2a43d0c095662c77.bin |    51 +
 ...7f923fae735b83e4f2d948c1ebc786a8d99496.bin |    52 +
 ...29629d0733adb31d068743d88242fadd61698f.bin |    55 +
 ...7b434a69fa219e38050ec0e86595c272569776.bin |    56 +
 ...397a2870b0cd78a515140f8636afef287c2efc.bin |    50 +
 ...f99304130fde20c4ef0985b73f65c0a7f64ce5.bin |    63 +
 ...42d1788bafd9edceb7a853220350e0f51edb8d.bin |    47 +
 ...987271f49fad2afb665cfc69349cff0dccb9d1.bin |    47 +
 ...469fe37195a8cabffaccac7db21d3899328a4d.bin |    55 +
 ...dfaaffcc2205f9df432d7fdde61de540e0c0d4.bin |    43 +
 ...f908ebbb3b7213bfeed41b88877bacd69fd259.bin |    46 +
 ...0c8910f2c2fc09091fd8fb93b3c442b72d6c09.bin |    49 +
 ...fc7acf01451a0b0bfe51fcdd803fb8e8816d6c.bin |    44 +
 ...5ef4b5b31f3ea083845f214b01393b731ce029.bin |    61 +
 ...b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.bin |    56 +
 ...882b682718c71c3943f92c161db2dfaa64df03.bin |    44 +
 ...ed329cd50001268a3444507b7ce6ab6947f1fe.bin |    46 +
 ...7ef5b1ba27f16536fbcb88bcff85913c14758f.bin |    53 +
 ...33166c2ca4aae8bf3f3f7a065279f75679819d.bin |    44 +
 ...e3536f2d2b821c57268bc0d14cf376cf48cf61.bin |    48 +
 ...d7f31eee5a889ba1cd7e983a70f9c907e4d098.bin |    45 +
 ...7fabd0eb69d8dc7d1ed618b7b4f1114438db87.bin |    41 +
 ...62f4b8789a227c7d8a385080ba49ffb5e4ba45.bin |    59 +
 ...b0b1870f235056eb644c3e95813967bfd0fc58.bin |    41 +
 ...a5a48b2b4406e36634b850d88f9d03c76037cc.bin |    41 +
 ...ffc19759db0f5d39b8c244795a66921fe21b94.bin |    60 +
 ...8fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.bin |    71 +
 ...65c4873a399915dc1b6b6ee6225279b945b029.bin |    53 +
 ...683ffedde988fe337856e7af84acfc879a33d9.bin |    60 +
 ...65577a9155b51d7a0a064d8f40e50ae8d81f61.bin |    56 +
 ...26207bad35ae8c9d8feac05811a57b3d99152e.bin |    56 +
 ...ab90179a82c7358a2900af45d231fb8a503408.bin |    47 +
 ...36e2fdf6391672be1a2ba3cf2b55f7ead13123.bin |    44 +
 ...f96df2e6a8c1fc843479cee1a454d7caf8bcc3.bin |    53 +
 ...d1ac40469022eb472ab91d821c97c234f221f8.bin |    41 +
 ...93301bc2169a4e94965d2da42da184af0cc757.bin |    47 +
 ...7fbbdd5c0d590ad8d63a2669d85c56e68da7b8.bin |    58 +
 ...d130ef96bab865eb3212938931e2898b9e0d9d.bin |    56 +
 ...d7f7b1375c7fbc3be31c71d10eeba3c418c026.bin |    56 +
 ...57d9ec4c4bc51515c51e441f7846fcf3fecc4f.bin |    54 +
 ...b0e717049a01bfa8698672698bdbd6a40c133c.bin |    60 +
 ...4c1d84519e57615b303709cb5624e18a94e896.bin |    64 +
 ...3ecf4d9e0ab03b597766732cbda770fb3f684d.bin |    52 +
 ...2b309eea5741fcc20a5b2b0e85ae75a7077e5c.bin |    47 +
 ...d5548645fad1bf1c4bd54d63d1b13886398cc7.bin |    49 +
 ...b1509e97d3c101fc25ffef8ad4a32517ebac8c.bin |    54 +
 ...7241368a264fd996281acc44c90a6019882ed2.bin |    48 +
 ...22c4b912dd00951a4555985e08dbfedfd976a1.bin |    61 +
 ...cc29da477163a339df1ff7f258087aacdd830e.bin |    43 +
 ...d300540473e042081bd13eeb576c1c6fdfa8d6.bin |    53 +
 ...96aa7bea916468b1d6b1000618f51b246b46f5.bin |    47 +
 ...835df9dd68834e39597debdee2c6f4be488586.bin |    51 +
 ...deae9b7a6629325149991ce4d2984a4b20fe67.bin |    57 +
 ...c143be2d6decf393f610d6b48c1600cb5526cb.bin |    46 +
 ...5d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.bin |    46 +
 ...acac8b7130ef4548f7fc584466bd1b72147952.bin |    55 +
 ...2ac00c7a364178687852e8ea61268d41ab6b48.bin |    64 +
 ...1873d81742b6c129958b3bc8842a16e7f25249.bin |    39 +
 ...0cef1d20f23a869d82dadd839c7b127eb90cd8.bin |    50 +
 ...6b4263bb6ef10cf383a0ef6f8887f577962121.bin |    56 +
 ...ed26a9aed576723517a67724cd2af11c4cdf55.bin |    44 +
 ...118853afb8b8b23173cbcd2158119b4086b95d.bin |    54 +
 ...8289a85b35cbbaeed73ca9649353116709ab0f.bin |    51 +
 ...fa253d7dd27324393a9f81c62ad862ef49e8af.bin |    42 +
 ...7b5676f26e8e11e7459a6470064f1d8a5b1bde.bin |    47 +
 ...7ebbdaa1ee5a58d65b8e4b964a459279b64c65.bin |    44 +
 ...2d6982c880b4c2020a27f0807bd9b8d91b0ca8.bin |    55 +
 ...48d84010cdc07e16d1eca153c32856cc6358b5.bin |    51 +
 ...cdf845aa7846507b7a436e41b2f3113b8a4d37.bin |    55 +
 ...419f4b68a09dadfdf5eae7bbd36b027a4e80fb.bin |    60 +
 ...b1f9568f29c970b67335f261062dc8d9cbec61.bin |    44 +
 ...1acd55493bf00ccbf4adf713adfd341466a4f3.bin |    67 +
 ...c5012f32d6ca7f26ab4b1312186994311cba63.bin |    58 +
 ...89915aba816c8736063b3bf8ae506c4e2e4d84.bin |    51 +
 ...66824a358c3676f93262f7f0a25cf5957a26ed.bin |    51 +
 ...587754cdea5843b5f2bd3a85fa2bb3c8f6edab.bin |    56 +
 ...fac4e9368fffc0bc45e80be84df06b95e9a16f.bin |    43 +
 ...4a90b6f613da6b7e408d662da950a27be47d0f.bin |    41 +
 ...68b90032962ab48b6db0ca340f0811bc6c4b19.bin |    47 +
 ...18d6481a5f3fb092c548f295bc861874d08718.bin |    39 +
 ...90d572af662b6eaf5caa5252a09b77bcabe353.bin |    51 +
 ...bbe00c77fff4e770b07b78d54e9a065aed147a.bin |    50 +
 ...384e06bd78ae55f313f99e0c62dc98c9436a25.bin |    95 +
 ...b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.bin |    50 +
 ...9e196e44fc8c09e94d555adcbc0bf90c3d8779.bin |    48 +
 ...a0ca6643b6cb46b90550f218abd1d5a70997af.bin |    53 +
 ...5ba06c5773442add1f87f2eadb38fe9bff5192.bin |    52 +
 ...6c84970a4216e0836b7eabc05c338c2f73ecc0.bin |    46 +
 ...329a000d029b7a12c1b84dbfd649e161e7fa42.bin |    51 +
 ...9673a879af4f17cd70b175f3960b3050aa0b4c.bin |    42 +
 ...38ac5d9a930d87f73014bb3eed514f93d505aa.bin |    46 +
 ...59e6014e1ce825fc96ec5228125110a69b0173.bin |    44 +
 ...a456bed673130b695e3e46e896d3ac4a84346e.bin |    50 +
 ...3fef3069c9cd281e2bcfb611847abfa9da92ff.bin |    44 +
 ...ccf4d39b05d773a88ccd32d69cd544a51cfa68.bin |    55 +
 ...77cd25b89d8dd346853b9de1fb7fdd7dad3268.txt |    58 +
 ...258aa0e8ddde104ab1b338f721310239b8cb6e.txt |    51 +
 ...f52a2dfb080788a6f743467aae4efc11a8ac59.txt |    46 +
 ...0856f3cc61de9e1e67670661e0b77fc21a36ed.txt |    46 +
 ...3231b3bc479106eb01dd3b8be4333dbef179ff.txt |    57 +
 ...4582d9309bcfea913d78adabf7f3d656a8b71b.txt |    44 +
 ...9ae39c6ccfac75b13739c3e88dd6ca9062c0f1.txt |    47 +
 ...322406f635024a3e83d30b46f532568876e8d0.txt |    60 +
 ...300e287ee02597ea7bf92d1a9e63fc05c9eb9b.txt |    48 +
 ...0f38b5702ac18b7e380a7233ddaae4bbcabf14.txt |    46 +
 ...e163760878148cee62fef9b5fca63a5ad408ee.txt |    43 +
 ...ec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.txt |    50 +
 ...0bd616a90c1651a444531cf4a292f7cde82aee.txt |    67 +
 ...47545b5904c3d847ae986132578eb9ef321316.txt |    46 +
 ...e1316407fd72f0b63c2e0fb8bf005148204989.txt |    44 +
 ...582d35af778d46a872dec902bb8787d29de34a.txt |    58 +
 ...8e1991317fb7dcf206399e678df49f0a547f44.txt |    56 +
 ...d001fbbd75a9a62e09ff9fcc883d962a01437d.txt |   367 +
 ...265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.txt |    47 +
 ...bcd09dd6ebd085290f52f7fea17aac0479a20d.txt |    38 +
 ...ea2c7611c4496066b701d2b7c116dbaea470cc.txt |    40 +
 ...7b1f0e4880f38bd83463ad4452f2b522aa12aa.txt |    41 +
 ...5b8d1d11ec2134b25275e6e76bffc5d4b36008.txt |    62 +
 ...177c767b4387f6af42cfc2e1eef937af26fe31.txt |    50 +
 ...bf924a3c98c12c32aa18504d6828f119cd5524.txt |    57 +
 ...6a621b8a4e1317df857e2b2a43d0c095662c77.txt |    51 +
 ...7f923fae735b83e4f2d948c1ebc786a8d99496.txt |    52 +
 ...29629d0733adb31d068743d88242fadd61698f.txt |    55 +
 ...7b434a69fa219e38050ec0e86595c272569776.txt |    56 +
 ...397a2870b0cd78a515140f8636afef287c2efc.txt |    50 +
 ...f99304130fde20c4ef0985b73f65c0a7f64ce5.txt |    63 +
 ...42d1788bafd9edceb7a853220350e0f51edb8d.txt |    47 +
 ...987271f49fad2afb665cfc69349cff0dccb9d1.txt |    47 +
 ...469fe37195a8cabffaccac7db21d3899328a4d.txt |    55 +
 ...dfaaffcc2205f9df432d7fdde61de540e0c0d4.txt |    43 +
 ...f908ebbb3b7213bfeed41b88877bacd69fd259.txt |    46 +
 ...0c8910f2c2fc09091fd8fb93b3c442b72d6c09.txt |    49 +
 ...fc7acf01451a0b0bfe51fcdd803fb8e8816d6c.txt |    44 +
 ...5ef4b5b31f3ea083845f214b01393b731ce029.txt |    61 +
 ...b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.txt |    56 +
 ...882b682718c71c3943f92c161db2dfaa64df03.txt |    44 +
 ...ed329cd50001268a3444507b7ce6ab6947f1fe.txt |    46 +
 ...7ef5b1ba27f16536fbcb88bcff85913c14758f.txt |    53 +
 ...33166c2ca4aae8bf3f3f7a065279f75679819d.txt |    44 +
 ...e3536f2d2b821c57268bc0d14cf376cf48cf61.txt |    48 +
 ...d7f31eee5a889ba1cd7e983a70f9c907e4d098.txt |    45 +
 ...7fabd0eb69d8dc7d1ed618b7b4f1114438db87.txt |    41 +
 ...62f4b8789a227c7d8a385080ba49ffb5e4ba45.txt |    59 +
 ...b0b1870f235056eb644c3e95813967bfd0fc58.txt |    41 +
 ...a5a48b2b4406e36634b850d88f9d03c76037cc.txt |    41 +
 ...ffc19759db0f5d39b8c244795a66921fe21b94.txt |    60 +
 ...8fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.txt |    71 +
 ...65c4873a399915dc1b6b6ee6225279b945b029.txt |    53 +
 ...683ffedde988fe337856e7af84acfc879a33d9.txt |    60 +
 ...65577a9155b51d7a0a064d8f40e50ae8d81f61.txt |    56 +
 ...26207bad35ae8c9d8feac05811a57b3d99152e.txt |    56 +
 ...ab90179a82c7358a2900af45d231fb8a503408.txt |    47 +
 ...36e2fdf6391672be1a2ba3cf2b55f7ead13123.txt |    44 +
 ...f96df2e6a8c1fc843479cee1a454d7caf8bcc3.txt |    53 +
 ...d1ac40469022eb472ab91d821c97c234f221f8.txt |    41 +
 ...93301bc2169a4e94965d2da42da184af0cc757.txt |    47 +
 ...7fbbdd5c0d590ad8d63a2669d85c56e68da7b8.txt |    58 +
 ...d130ef96bab865eb3212938931e2898b9e0d9d.txt |    56 +
 ...d7f7b1375c7fbc3be31c71d10eeba3c418c026.txt |    56 +
 ...57d9ec4c4bc51515c51e441f7846fcf3fecc4f.txt |    54 +
 ...b0e717049a01bfa8698672698bdbd6a40c133c.txt |    60 +
 ...4c1d84519e57615b303709cb5624e18a94e896.txt |    64 +
 ...3ecf4d9e0ab03b597766732cbda770fb3f684d.txt |    52 +
 ...2b309eea5741fcc20a5b2b0e85ae75a7077e5c.txt |    47 +
 ...d5548645fad1bf1c4bd54d63d1b13886398cc7.txt |    49 +
 ...b1509e97d3c101fc25ffef8ad4a32517ebac8c.txt |    54 +
 ...7241368a264fd996281acc44c90a6019882ed2.txt |    48 +
 ...22c4b912dd00951a4555985e08dbfedfd976a1.txt |    61 +
 ...cc29da477163a339df1ff7f258087aacdd830e.txt |    43 +
 ...d300540473e042081bd13eeb576c1c6fdfa8d6.txt |    53 +
 ...96aa7bea916468b1d6b1000618f51b246b46f5.txt |    47 +
 ...835df9dd68834e39597debdee2c6f4be488586.txt |    51 +
 ...deae9b7a6629325149991ce4d2984a4b20fe67.txt |    57 +
 ...c143be2d6decf393f610d6b48c1600cb5526cb.txt |    46 +
 ...5d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.txt |    46 +
 ...acac8b7130ef4548f7fc584466bd1b72147952.txt |    55 +
 ...2ac00c7a364178687852e8ea61268d41ab6b48.txt |    64 +
 ...1873d81742b6c129958b3bc8842a16e7f25249.txt |    39 +
 ...0cef1d20f23a869d82dadd839c7b127eb90cd8.txt |    50 +
 ...6b4263bb6ef10cf383a0ef6f8887f577962121.txt |    56 +
 ...ed26a9aed576723517a67724cd2af11c4cdf55.txt |    44 +
 ...118853afb8b8b23173cbcd2158119b4086b95d.txt |    54 +
 ...8289a85b35cbbaeed73ca9649353116709ab0f.txt |    51 +
 ...fa253d7dd27324393a9f81c62ad862ef49e8af.txt |    42 +
 ...7b5676f26e8e11e7459a6470064f1d8a5b1bde.txt |    47 +
 ...7ebbdaa1ee5a58d65b8e4b964a459279b64c65.txt |    44 +
 ...2d6982c880b4c2020a27f0807bd9b8d91b0ca8.txt |    55 +
 ...48d84010cdc07e16d1eca153c32856cc6358b5.txt |    51 +
 ...cdf845aa7846507b7a436e41b2f3113b8a4d37.txt |    55 +
 ...419f4b68a09dadfdf5eae7bbd36b027a4e80fb.txt |    60 +
 ...b1f9568f29c970b67335f261062dc8d9cbec61.txt |    44 +
 ...1acd55493bf00ccbf4adf713adfd341466a4f3.txt |    67 +
 ...c5012f32d6ca7f26ab4b1312186994311cba63.txt |    58 +
 ...89915aba816c8736063b3bf8ae506c4e2e4d84.txt |    51 +
 ...66824a358c3676f93262f7f0a25cf5957a26ed.txt |    51 +
 ...587754cdea5843b5f2bd3a85fa2bb3c8f6edab.txt |    56 +
 ...fac4e9368fffc0bc45e80be84df06b95e9a16f.txt |    43 +
 ...4a90b6f613da6b7e408d662da950a27be47d0f.txt |    41 +
 ...68b90032962ab48b6db0ca340f0811bc6c4b19.txt |    47 +
 ...18d6481a5f3fb092c548f295bc861874d08718.txt |    39 +
 ...90d572af662b6eaf5caa5252a09b77bcabe353.txt |    51 +
 ...bbe00c77fff4e770b07b78d54e9a065aed147a.txt |    50 +
 ...384e06bd78ae55f313f99e0c62dc98c9436a25.txt |    95 +
 ...b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.txt |    50 +
 ...9e196e44fc8c09e94d555adcbc0bf90c3d8779.txt |    48 +
 ...a0ca6643b6cb46b90550f218abd1d5a70997af.txt |    53 +
 ...5ba06c5773442add1f87f2eadb38fe9bff5192.txt |    52 +
 ...6c84970a4216e0836b7eabc05c338c2f73ecc0.txt |    46 +
 ...329a000d029b7a12c1b84dbfd649e161e7fa42.txt |    51 +
 ...9673a879af4f17cd70b175f3960b3050aa0b4c.txt |    42 +
 ...38ac5d9a930d87f73014bb3eed514f93d505aa.txt |    46 +
 ...59e6014e1ce825fc96ec5228125110a69b0173.txt |    44 +
 ...a456bed673130b695e3e46e896d3ac4a84346e.txt |    50 +
 ...3fef3069c9cd281e2bcfb611847abfa9da92ff.txt |    44 +
 ...ccf4d39b05d773a88ccd32d69cd544a51cfa68.txt |    55 +
 research/fog-of-knowledge/data/knowledge.json | 49621 ++++++++++++----
 ...f55ac90fb925128c2e9a458b1411a89b61355.json |  4326 ++
 .../fog-of-knowledge/nemesis/applied.jsonl    |     1 +
 .../assertions.jsonl                          |   240 +
 .../edges.jsonl                               |   118 +
 .../identities.jsonl                          |     0
 .../manifest.json                             |    25 +
 .../nodes.jsonl                               |   120 +
 .../reviews.jsonl                             |     0
 .../sources.jsonl                             |   120 +
 .../taxonomy.jsonl                            |     2 +
 374 files changed, 58064 insertions(+), 12187 deletions(-)
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162.json
 create mode 100644 research/fog-of-knowledge/data/evidence/captures/fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409.json
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/raw/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.bin
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.txt
 create mode 100644 research/fog-of-knowledge/data/evidence/snapshots/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.txt
 create mode 100644 research/fog-of-knowledge/nemesis/adjudications/064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355.json
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/assertions.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/edges.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/identities.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/manifest.json
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/nodes.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/reviews.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/sources.jsonl
 create mode 100644 research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/taxonomy.jsonl

diff --git a/research/fog-of-knowledge/data/atlas-display.json b/research/fog-of-knowledge/data/atlas-display.json
index ab86ea758..01953c78b 100644
--- a/research/fog-of-knowledge/data/atlas-display.json
+++ b/research/fog-of-knowledge/data/atlas-display.json
@@ -1 +1 @@
-{"domains":[{"id":"roots","label":"Foundational human knowledge"},{"id":"formal","label":"Mathematics & formal systems"},{"id":"physical","label":"Physical sciences"},{"id":"earth","label":"Earth & environment"},{"id":"life","label":"Life sciences"},{"id":"health","label":"Medicine & health"},{"id":"social","label":"Human & social sciences"},{"id":"humanities","label":"Humanities & culture"},{"id":"engineering","label":"Engineering & technology"},{"id":"information","label":"Information & cognitive sciences"}],"edges":[{"dependency":"soft","source":"root.material","target":"practice.toolmaking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.toolmaking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.safe-danger","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.time-cycle","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.place","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.living-dead","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.kin-social","target":"practice.oral-tradition","type":"enabled"},{"dependency":"soft","source":"root.quantity","target":"concept.counting","type":"enabled"},{"dependency":"soft","source":"concept.counting","target":"field.geometry","type":"enabled"},{"dependency":"soft","source":"practice.oral-tradition","target":"practice.writing","type":"enabled"},{"dependency":"soft","source":"root.time-cycle","target":"field.astronomy","type":"enabled"},{"dependency":"soft","source":"root.place","target":"field.navigation","type":"enabled"},{"dependency":"soft","source":"field.astronomy","target":"field.navigation","type":"supports"},{"dependency":"soft","source":"root.time-cycle","target":"practice.agriculture","type":"enabled"},{"dependency":"soft","source":"practice.tracking","target":"practice.agriculture","type":"derived_from"},{"dependency":"soft","source":"concept.counting","target":"field.algebra","type":"enabled"},{"dependency":"soft","source":"field.geometry","target":"field.optics","type":"enabled"},{"dependency":"soft","source":"field.navigation","target":"field.cartography","type":"enabled"},{"dependency":"soft","source":"practice.writing","target":"field.logic","type":"enabled"},{"dependency":"soft","source":"field.philosophy","target":"field.logic","type":"related"},{"dependency":"soft","source":"field.logic","target":"method.scientific","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.physics","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.chemistry","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.geology","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.biology","type":"enabled"},{"dependency":"soft","source":"field.geometry","target":"field.physics","type":"enabled"},{"dependency":"soft","source":"field.algebra","target":"field.physics","type":"enabled"},{"dependency":"hard","source":"claim.phlogiston","target":"concept.phlogiston-program","type":"depends_on"},{"dependency":"hard","source":"claim.miasma","target":"practice.miasma-control","type":"depends_on"},{"dependency":"soft","source":"field.biology","target":"claim.evolution","type":"enabled"},{"dependency":"soft","source":"claim.evolution","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.biology","target":"field.ecology","type":"derived_from"},{"dependency":"soft","source":"field.biology","target":"field.microbiology","type":"derived_from"},{"dependency":"soft","source":"field.microbiology","target":"claim.germ-theory","type":"supports"},{"dependency":"soft","source":"claim.germ-theory","target":"claim.miasma","type":"supersedes"},{"dependency":"soft","source":"field.chemistry","target":"field.thermodynamics","type":"enabled"},{"dependency":"soft","source":"field.physics","target":"field.electromagnetism","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.psychology","type":"enabled"},{"dependency":"soft","source":"field.statistics","target":"field.sociology","type":"enabled"},{"dependency":"soft","source":"field.physics","target":"claim.relativity","type":"derived_from"},{"dependency":"soft","source":"field.physics","target":"claim.quantum","type":"derived_from"},{"dependency":"soft","source":"claim.relativity","target":"field.cosmology","type":"enabled"},{"dependency":"soft","source":"field.astronomy","target":"field.cosmology","type":"derived_from"},{"dependency":"soft","source":"field.genetics","target":"field.molecular-biology","type":"enabled"},{"dependency":"soft","source":"field.biology","target":"field.molecular-biology","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.epidemiology","type":"enabled"},{"dependency":"soft","source":"claim.germ-theory","target":"field.epidemiology","type":"enabled"},{"dependency":"soft","source":"field.logic","target":"field.computer-science","type":"enabled"},{"dependency":"soft","source":"field.statistics","target":"field.ai","type":"enabled"},{"dependency":"soft","source":"field.computer-science","target":"field.ai","type":"derived_from"},{"dependency":"soft","source":"field.psychology","target":"field.cognitive-science","type":"derived_from"},{"dependency":"soft","source":"field.neuroscience","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"question.quantum-gravity","type":"enabled"},{"dependency":"soft","source":"claim.relativity","target":"question.quantum-gravity","type":"enabled"},{"dependency":"soft","source":"field.cosmology","target":"question.dark-matter","type":"derived_from"},{"dependency":"soft","source":"field.cosmology","target":"question.dark-energy","type":"derived_from"},{"dependency":"soft","source":"field.molecular-biology","target":"question.origin-life","type":"enabled"},{"dependency":"soft","source":"field.neuroscience","target":"question.consciousness","type":"enabled"},{"dependency":"soft","source":"field.cognitive-science","target":"question.consciousness","type":"enabled"},{"dependency":"soft","source":"field.molecular-biology","target":"question.aging","type":"enabled"},{"dependency":"soft","source":"field.climatology","target":"question.predict-climate","type":"derived_from"},{"dependency":"soft","source":"field.ai","target":"question.general-ai","type":"derived_from"},{"dependency":"soft","source":"field.logic","target":"question.math-foundations","type":"derived_from"},{"dependency":"soft","source":"field.sociology","target":"question.social-prediction","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.chemistry","target":"field.molecular-biology","type":"related"},{"dependency":"soft","source":"field.physics","target":"field.engineering","type":"related"},{"dependency":"soft","source":"field.computer-science","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"field.ai","target":"field.systems-biology","type":"related"},{"dependency":"soft","source":"field.ecology","target":"field.climatology","type":"related"},{"dependency":"soft","source":"field.anthropology","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"field.psychology","target":"field.neuroscience","type":"related"},{"dependency":"soft","source":"field.information-theory","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.physics","target":"smoke.automate-merge","type":"related"},{"source":"physical.dark-energy","target":"physical.cosmic-acceleration","type":"related"},{"dependency":"hard","source":"physical.lambda-cdm","target":"physical.cosmological-constant-de","type":"depends_on"},{"source":"physical.wcdm","target":"physical.lambda-cdm","type":"refines"},{"source":"physical.w0wa-cdm","target":"physical.wcdm","type":"refines"},{"source":"physical.evolving-dark-energy","target":"physical.w0wa-cdm","type":"related"},{"source":"physical.desi-dr2-bao","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.desi-dr2-bao","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.desi-dr2-lya-fullshape","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.desi-dr2-lya-fullshape","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.desi-dr2-bao","target":"physical.bao","type":"derived_from"},{"source":"physical.standard-model-particle-physics","target":"field.physics","type":"derived_from"},{"source":"physical.gravitational-wave-interferometry","target":"field.physics","type":"related"},{"source":"physical.gw150914","target":"physical.gravitational-wave-interferometry","type":"derived_from"},{"source":"physical.gw150914","target":"claim.relativity","type":"supports"},{"source":"physical.si-defining-constants","target":"physical.precision-metrology","type":"related"},{"source":"physical.codata-fundamental-constants","target":"physical.precision-metrology","type":"supports"},{"source":"physical.dark-energy","target":"field.cosmology","type":"related"},{"source":"physical.lambda-cdm","target":"field.cosmology","type":"related"},{"source":"physical.bao","target":"field.cosmology","type":"related"},{"source":"physical.des-y6-dark-energy","target":"physical.wcdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.dark-energy","type":"supports"},{"source":"physical.general-relativity","target":"field.physics","type":"related"},{"source":"physical.gravitational-wave-interferometry","target":"physical.general-relativity","type":"tests"},{"source":"physical.gw150914","target":"physical.general-relativity","type":"supports"},{"source":"physical.gw250114","target":"physical.general-relativity","type":"tests"},{"source":"physical.gwtc5-cosmology-gr","target":"physical.general-relativity","type":"tests"},{"source":"physical.gwtc5-cosmology-gr","target":"field.cosmology","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.classical-mechanics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.newtonian-mechanics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.lagrangian-mechanics","type":"related"},{"dependency":"soft","source":"physical.lagrangian-mechanics","target":"physical.hamiltonian-mechanics","type":"related"},{"dependency":"soft","source":"physical.hamiltonian-mechanics","target":"physical.phase-space","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.chaos-theory","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.continuum-mechanics","type":"related"},{"dependency":"soft","source":"physical.continuum-mechanics","target":"physical.fluid-dynamics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.classical-wave-theory","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.special-relativity","type":"related"},{"dependency":"soft","source":"physical.special-relativity","target":"physical.lorentz-transformations","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.equivalence-principle","type":"related"},{"dependency":"soft","source":"physical.special-relativity","target":"physical.spacetime","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.black-holes","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.schwarzschild-solution","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.kerr-solution","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-lensing","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-time-dilation","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-waves","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.thermodynamic-entropy","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.first-law-thermodynamics","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.second-law-thermodynamics","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.statistical-mechanics","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.boltzmann-distribution","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.partition-function","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.fluctuation-dissipation","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.phase-transitions","type":"related"},{"dependency":"soft","source":"physical.phase-transitions","target":"physical.renormalization-group","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.condensed-matter-physics","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.superconductivity","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.superfluidity","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.bose-einstein-condensate","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.band-theory","type":"related"},{"dependency":"soft","source":"physical.band-theory","target":"physical.semiconductor-physics","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.quantum-hall-effect","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.topological-phases","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.phonons","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.density-functional-theory","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.atomic-physics","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.molecular-physics","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.spectroscopy","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.laser-physics","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.photoelectric-effect","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.compton-scattering","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.quantum-entanglement","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.uncertainty-principle","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.schrodinger-equation","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.quantum-field-theory","type":"related"},{"dependency":"soft","source":"physical.quantum-field-theory","target":"physical.gauge-symmetry","type":"related"},{"dependency":"soft","source":"physical.quantum-field-theory","target":"physical.quantum-electrodynamics","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.quantum-chromodynamics","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.electroweak-theory","type":"related"},{"dependency":"soft","source":"physical.electroweak-theory","target":"physical.spontaneous-symmetry-breaking","type":"related"},{"dependency":"soft","source":"physical.electroweak-theory","target":"physical.higgs-mechanism","type":"related"},{"dependency":"soft","source":"physical.higgs-mechanism","target":"physical.higgs-boson","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.quarks","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.leptons","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.gluons","type":"related"},{"dependency":"soft","source":"physical.leptons","target":"physical.neutrino-oscillation","type":"related"},{"dependency":"soft","source":"physical.quarks","target":"physical.ckm-matrix","type":"related"},{"dependency":"soft","source":"physical.ckm-matrix","target":"physical.cp-violation","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.proton","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.neutron","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.nuclear-physics","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-shell-model","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.radioactive-decay","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-fission","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-fusion","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.plasma-physics","type":"related"},{"dependency":"soft","source":"physical.plasma-physics","target":"physical.magnetohydrodynamics","type":"related"},{"dependency":"soft","source":"field.astronomy","target":"physical.astrophysics","type":"related"},{"dependency":"soft","source":"physical.astrophysics","target":"physical.stellar-evolution","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.hertzsprung-russell-diagram","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.white-dwarfs","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.neutron-stars","type":"related"},{"dependency":"soft","source":"physical.neutron-stars","target":"physical.pulsars","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.supernovae","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.accretion-disks","type":"related"},{"dependency":"soft","source":"physical.accretion-disks","target":"physical.active-galactic-nuclei","type":"related"},{"dependency":"soft","source":"field.astronomy","target":"physical.exoplanet-transit-method","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.cosmic-microwave-background","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.inflationary-cosmology","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.big-bang-nucleosynthesis","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.hubble-lemaitre-law","type":"related"},{"dependency":"soft","source":"physical.gravitational-wave-interferometry","target":"physical.gw-standard-sirens","type":"related"},{"dependency":"soft","source":"physical.gravitational-lensing","target":"physical.strong-gravitational-lensing","type":"related"},{"dependency":"soft","source":"physical.gravitational-lensing","target":"physical.weak-gravitational-lensing","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.large-scale-structure","type":"related"},{"dependency":"soft","source":"physical.large-scale-structure","target":"physical.baryon-acoustic-oscillations","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.dark-matter-cosmology","type":"related"},{"source":"physical.quantum-mechanics","target":"field.physics","type":"related"},{"source":"physical.quantum-field-theory","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.standard-model-particle-physics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.higgs-field","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.higgs-boson","target":"physical.higgs-field","type":"supports"},{"source":"physical.electroweak-theory","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quantum-electrodynamics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quantum-chromodynamics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quarks","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.leptons","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.neutrinos","target":"physical.leptons","type":"related"},{"source":"physical.gauge-bosons","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.gluon","target":"physical.quantum-chromodynamics","type":"related"},{"source":"physical.photon","target":"physical.quantum-electrodynamics","type":"related"},{"source":"physical.w-z-bosons","target":"physical.electroweak-theory","type":"related"},{"source":"physical.top-quark","target":"physical.quarks","type":"related"},{"source":"physical.large-hadron-collider","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.atlas-detector","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.cms-detector","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.higgs-discovery-2012","target":"physical.higgs-boson","type":"supports"},{"source":"physical.spacetime","target":"physical.general-relativity","type":"related"},{"source":"physical.gravitational-waves","target":"physical.general-relativity","type":"derived_from"},{"source":"physical.black-holes","target":"physical.general-relativity","type":"related"},{"source":"physical.neutron-stars","target":"field.astronomy","type":"related"},{"source":"physical.binary-black-holes","target":"physical.black-holes","type":"related"},{"source":"physical.binary-neutron-stars","target":"physical.neutron-stars","type":"related"},{"source":"physical.ligo","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.virgo","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.kagra","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.gw150914","target":"physical.ligo","type":"derived_from"},{"source":"physical.gw170817","target":"physical.gravitational-waves","type":"supports"},{"source":"physical.strong-field-gr-tests","target":"physical.general-relativity","type":"tests"},{"source":"field.cosmology","target":"field.astronomy","type":"related"},{"source":"physical.cosmic-expansion","target":"field.cosmology","type":"related"},{"source":"physical.big-bang","target":"physical.cosmic-expansion","type":"related"},{"source":"physical.cosmic-microwave-background","target":"physical.big-bang","type":"supports"},{"source":"physical.cosmic-inflation","target":"physical.big-bang","type":"refines"},{"source":"physical.dark-matter","target":"field.cosmology","type":"related"},{"source":"physical.lambda-cdm","target":"physical.dark-matter","type":"depends_on"},{"source":"physical.gravitational-lensing","target":"physical.dark-matter","type":"tests"},{"source":"physical.large-scale-structure","target":"physical.dark-matter","type":"related"},{"source":"physical.galaxy-clusters","target":"physical.dark-matter","type":"related"},{"source":"physical.primordial-nucleosynthesis","target":"physical.big-bang","type":"supports"},{"source":"physical.desi","target":"physical.desi-dr2-bao","type":"enabled"},{"source":"physical.desi-dr2-bao","target":"physical.desi","type":"derived_from"},{"source":"physical.roman-space-telescope","target":"physical.dark-energy","type":"related"},{"source":"physical.quantum-information-science","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.quantum-entanglement","target":"physical.quantum-mechanics","type":"derived_from"},{"source":"physical.quantum-superposition","target":"physical.quantum-mechanics","type":"derived_from"},{"source":"physical.quantum-computing","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.qubit","target":"physical.quantum-computing","type":"related"},{"source":"physical.trapped-ion-quantum-computing","target":"physical.quantum-computing","type":"refines"},{"source":"physical.quantum-sensing","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.quantum-networking","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.atomic-clocks","target":"physical.spectroscopy","type":"related"},{"source":"physical.optical-clocks","target":"physical.atomic-clocks","type":"refines"},{"source":"physical.spectroscopy","target":"field.optics","type":"related"},{"source":"physical.optical-frequency-combs","target":"physical.spectroscopy","type":"enabled"},{"source":"physical.ultracold-atoms","target":"physical.quantum-mechanics","type":"related"},{"source":"physical.quantum-many-body-physics","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.quantum-simulation","target":"physical.quantum-many-body-physics","type":"depends_on"},{"source":"physical.si-system","target":"field.physics","type":"related"},{"source":"physical.si-defining-constants","target":"physical.si-system","type":"supports"},{"source":"physical.speed-of-light-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.planck-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.elementary-charge","target":"physical.si-defining-constants","type":"related"},{"source":"physical.boltzmann-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.avogadro-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.cesium-hyperfine-frequency","target":"physical.si-defining-constants","type":"related"},{"source":"physical.luminous-efficacy-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.codata-fundamental-constants","target":"physical.si-defining-constants","type":"supports"},{"source":"field.thermodynamics","target":"field.physics","type":"related"},{"source":"physical.chemistry-webbook","target":"field.chemistry","type":"related"},{"source":"physical.refprop","target":"field.thermodynamics","type":"related"},{"source":"physical.janaf-thermochemical-tables","target":"field.thermodynamics","type":"related"},{"source":"physical.mass-spectral-library","target":"physical.spectroscopy","type":"related"},{"source":"physical.xps-database","target":"physical.spectroscopy","type":"related"},{"source":"physical.thermochemical-data","target":"field.chemistry","type":"related"},{"source":"physical.thermophysical-properties","target":"field.thermodynamics","type":"related"},{"source":"physical.superconductivity","target":"physical.quantum-mechanics","type":"related"},{"source":"physical.spectroscopic-reference-data","target":"physical.spectroscopy","type":"supports"},{"source":"field.quantum-gravity","target":"concept.quantum-nature-of-gravity","type":"related"},{"source":"concept.quantum-nature-of-gravity","target":"concept.gravity-mediated-entanglement","type":"related"},{"source":"method.bmv-entanglement-witness","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"method.mass-superposition-probe","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"concept.quantum-mediator-principle","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"concept.spin-correlation-readout","target":"method.bmv-entanglement-witness","type":"enabled"},{"source":"concept.gravitational-phase-evolution","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"evidence.bmv-proposal-2017","target":"method.bmv-entanglement-witness","type":"supports"},{"source":"theory.classical-gravity-qft-entanglement","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"evidence.classical-gravity-entanglement-2025","target":"theory.classical-gravity-qft-entanglement","type":"supports"},{"source":"concept.entanglement-scaling-discriminator","target":"theory.classical-gravity-qft-entanglement","type":"tests"},{"source":"concept.quantum-information-gravity-test","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"method.single-graviton-quantum-sensing","target":"concept.single-graviton-signature","type":"tests"},{"source":"concept.single-graviton-signature","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"field.loop-quantum-gravity","target":"field.quantum-gravity","type":"related"},{"source":"concept.spin-network","target":"field.loop-quantum-gravity","type":"related"},{"source":"concept.discrete-quantum-geometry","target":"concept.spin-network","type":"derived_from"},{"source":"concept.area-operator","target":"concept.discrete-quantum-geometry","type":"supports"},{"source":"concept.volume-operator","target":"concept.discrete-quantum-geometry","type":"supports"},{"source":"method.connection-representation","target":"field.loop-quantum-gravity","type":"enabled"},{"source":"concept.hamiltonian-constraint","target":"field.loop-quantum-gravity","type":"related"},{"source":"theory.ads-cft","target":"field.quantum-gravity","type":"related"},{"source":"concept.holographic-duality","target":"theory.ads-cft","type":"derived_from"},{"source":"concept.large-n-limit","target":"theory.ads-cft","type":"related"},{"source":"theory.asymptotic-safety","target":"field.quantum-gravity","type":"related"},{"source":"method.functional-rg-gravity","target":"theory.asymptotic-safety","type":"enabled"},{"source":"concept.running-newton-constant","target":"method.functional-rg-gravity","type":"derived_from"},{"source":"theory.causal-dynamical-triangulations","target":"field.quantum-gravity","type":"related"},{"source":"method.sum-over-geometries","target":"theory.causal-dynamical-triangulations","type":"enabled"},{"source":"concept.emergent-four-dimensionality","target":"theory.causal-dynamical-triangulations","type":"supports"},{"source":"theory.causal-set","target":"field.quantum-gravity","type":"related"},{"source":"concept.local-finiteness","target":"theory.causal-set","type":"related"},{"source":"concept.causal-partial-order","target":"theory.causal-set","type":"related"},{"source":"concept.minimal-observable-length","target":"field.quantum-gravity","type":"related"},{"source":"theory.generalized-uncertainty-relation","target":"concept.minimal-observable-length","type":"supports"},{"source":"method.minimal-length-hilbert-space","target":"theory.generalized-uncertainty-relation","type":"enabled"},{"source":"concept.lorentz-invariance-violation","target":"field.quantum-gravity","type":"related"},{"source":"method.gamma-ray-burst-dispersion-test","target":"concept.lorentz-invariance-violation","type":"tests"},{"source":"instrument.fermi-lat","target":"method.gamma-ray-burst-dispersion-test","type":"enabled"},{"source":"dataset.grb090510","target":"method.gamma-ray-burst-dispersion-test","type":"enabled"},{"source":"evidence.qg-liv-constraint-2013","target":"concept.lorentz-invariance-violation","type":"tests"},{"source":"field.dark-matter","target":"theory.wimp-dark-matter","type":"related"},{"source":"method.direct-detection","target":"theory.wimp-dark-matter","type":"tests"},{"source":"instrument.xenonnt","target":"method.direct-detection","type":"enabled"},{"source":"dataset.xenonnt-3p1-tonne-year","target":"instrument.xenonnt","type":"derived_from"},{"source":"concept.nuclear-recoil-signal","target":"method.direct-detection","type":"related"},{"source":"concept.spin-independent-cross-section","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.xenonnt-null-2025","target":"theory.wimp-dark-matter","type":"tests"},{"source":"evidence.xenonnt-null-2025","target":"concept.spin-independent-cross-section","type":"refines"},{"source":"instrument.lux-zeplin","target":"method.direct-detection","type":"enabled"},{"source":"dataset.lz-4p2-tonne-year","target":"instrument.lux-zeplin","type":"derived_from"},{"source":"concept.spin-dependent-cross-section","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.lz-null-2024","target":"theory.wimp-dark-matter","type":"tests"},{"source":"evidence.lz-null-2024","target":"concept.spin-dependent-cross-section","type":"refines"},{"source":"concept.wimp-parameter-space","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.lz-null-2024","target":"concept.wimp-parameter-space","type":"refines"},{"source":"evidence.xenonnt-null-2025","target":"concept.wimp-parameter-space","type":"refines"},{"source":"evidence.lz-high-energy-event-2026","target":"theory.wimp-dark-matter","type":"tests"},{"source":"concept.look-elsewhere-corrected-significance","target":"evidence.lz-high-energy-event-2026","type":"refines"},{"source":"theory.cosmic-ray-boosted-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.crdm-direct-search","target":"theory.cosmic-ray-boosted-dark-matter","type":"tests"},{"source":"concept.sub-gev-dark-matter","target":"theory.cosmic-ray-boosted-dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"theory.cosmic-ray-boosted-dark-matter","type":"tests"},{"source":"concept.crdm-nucleon-cross-section","target":"theory.cosmic-ray-boosted-dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"concept.crdm-nucleon-cross-section","type":"refines"},{"source":"theory.axion-dark-matter","target":"field.dark-matter","type":"related"},{"source":"instrument.admx","target":"theory.axion-dark-matter","type":"tests"},{"source":"method.axion-haloscope","target":"instrument.admx","type":"enabled"},{"source":"dataset.admx-run1b","target":"instrument.admx","type":"derived_from"},{"source":"theory.dfsz-axion","target":"theory.axion-dark-matter","type":"related"},{"source":"concept.axion-photon-conversion","target":"method.axion-haloscope","type":"enabled"},{"source":"evidence.admx-dfsz-exclusion","target":"theory.dfsz-axion","type":"tests"},{"source":"theory.primordial-black-hole-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.microlensing-dark-matter","target":"theory.primordial-black-hole-dark-matter","type":"tests"},{"source":"dataset.ogle-five-year-events","target":"method.microlensing-dark-matter","type":"enabled"},{"source":"concept.earth-mass-pbh","target":"theory.primordial-black-hole-dark-matter","type":"related"},{"source":"evidence.ogle-pbh-constraint","target":"concept.earth-mass-pbh","type":"tests"},{"source":"theory.fuzzy-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.lyman-alpha-forest-constraint","target":"theory.fuzzy-dark-matter","type":"tests"},{"source":"dataset.xq100-hires-mike","target":"method.lyman-alpha-forest-constraint","type":"enabled"},{"source":"concept.fuzzy-dm-mass","target":"theory.fuzzy-dark-matter","type":"related"},{"source":"evidence.fuzzy-dm-lyman-alpha-limit","target":"concept.fuzzy-dm-mass","type":"refines"},{"source":"theory.self-interacting-dark-matter","target":"field.dark-matter","type":"related"},{"source":"concept.finite-range-dark-force","target":"theory.self-interacting-dark-matter","type":"related"},{"source":"event.bullet-cluster","target":"theory.self-interacting-dark-matter","type":"tests"},{"source":"method.cluster-offset-constraint","target":"event.bullet-cluster","type":"enabled"},{"source":"concept.dark-matter-self-interaction-cross-section","target":"theory.self-interacting-dark-matter","type":"related"},{"source":"method.cluster-offset-constraint","target":"concept.dark-matter-self-interaction-cross-section","type":"refines"},{"source":"concept.dark-matter-candidate-space","target":"field.dark-matter","type":"related"},{"source":"concept.null-result-constraint","target":"evidence.xenonnt-null-2025","type":"derived_from"},{"source":"concept.null-result-constraint","target":"evidence.lz-null-2024","type":"derived_from"},{"source":"concept.complementary-dark-matter-searches","target":"concept.dark-matter-candidate-space","type":"related"},{"source":"concept.quantum-nature-of-gravity","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"concept.entanglement-scaling-discriminator","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"concept.spin-network","target":"field.loop-quantum-gravity","type":"enabled"},{"source":"concept.large-n-limit","target":"theory.ads-cft","type":"enabled"},{"source":"concept.local-finiteness","target":"theory.causal-set","type":"enabled"},{"source":"concept.causal-partial-order","target":"theory.causal-set","type":"enabled"},{"source":"evidence.lz-null-2024","target":"concept.spin-independent-cross-section","type":"refines"},{"source":"instrument.lux-zeplin","target":"method.crdm-direct-search","type":"enabled"},{"source":"concept.dfsz-axion","target":"theory.axion-dark-matter","type":"related"},{"source":"evidence.admx-dfsz-exclusion","target":"concept.dfsz-axion","type":"tests"},{"source":"evidence.admx-dfsz-exclusion","target":"theory.axion-dark-matter","type":"refines"},{"source":"concept.ultrashort-microlensing-events","target":"dataset.ogle-five-year-events","type":"derived_from"},{"source":"evidence.fuzzy-dm-lyman-alpha-limit","target":"field.dark-matter","type":"related"},{"source":"evidence.ogle-pbh-constraint","target":"field.dark-matter","type":"related"},{"source":"evidence.admx-dfsz-exclusion","target":"field.dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"field.dark-matter","type":"related"},{"source":"physical.ybco-grain-boundary-orientation-1988","sources":[{"id":"source.dimos-ibm-abstract","url":"https://research.ibm.com/publications/orientation-dependence-of-grain-boundary-critical-currents-in-yba2cu3o7-bicrystals"},{"id":"source.goyal-rabits-1996","url":"https://api.crossref.org/works/10.1063/1.117489"}],"summary":"The measured orientation dependence in YBCO bicrystals supports the importance of biaxial texture addressed by Goyal’s textured-substrate method. This is support for the design rationale, not a replication of tape performance or proof of a direct historical derivation.","target":"engineering.biaxially-textured-ybco-tapes-1996","type":"supports"},{"source":"engineering.tfmc-nint-stack-in-plate","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The TFMC’s implemented NINT winding-pack technology enabled the reported high-field magnet test in that apparatus; this relationship does not assert that every NINT magnet reaches 20.1 T.","target":"physical.tfmc-20-1t-demonstration","type":"enabled"},{"source":"engineering.tfmc-demountable-nanohm-joints","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The internal demountable pancake-to-pancake joints provided low-resistance current transfer between modules of the implemented TFMC stack-in-plate assembly.","target":"engineering.tfmc-nint-stack-in-plate","type":"enabled"},{"source":"physical.tfmc-open-circuit-quench-damage","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The intentional 31.5 kA open-circuit quench tested passive self-protection in the fusion-scale NINT TFMC and produced localized thermal damage in this non-optimized design.","target":"engineering.tfmc-nint-stack-in-plate","type":"tests"},{"source":"physical.tfmc-20-1t-demonstration","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The reported 20.1 T TFMC demonstration supports representative-scale magnet readiness for the authors’ high-field REBCO fusion pathway. This is component-level support; it does not establish plasma gain or net electricity generation.","target":"physical.high-field-rebco-fusion-pathway","type":"supports"},{"source":"engineering.ybco-y2o3-high-field-wire-2021","sources":[{"id":"source.molodyk-mit-paper","url":"https://eng.s-innovations.ru/upload/iblock/4c4/4c4a3119a03bbb5b8113924ad1324714.pdf"},{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"Molodyk’s tested high-field industrial YBCO wire supports materials feasibility for high-field REBCO fusion-magnet designs: the TFMC program specifically cites industrial tape performance and volume as enabling large-scale magnets. No supplier-lot identity for every TFMC tape is inferred.","target":"physical.high-field-rebco-fusion-pathway","type":"supports"},{"source":"claim.frontier.pmid-42853148","sources":[{"id":"source.frontier.pmid-42853148","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42853148%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42853148 names Opportunistic Infections: \"Each presented with early-onset combined immunodeficiency characterized by hypo- or agammaglobulinemia and marked susceptibility to opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42842684","sources":[{"id":"source.frontier.pmid-42842684","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42842684%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42842684 names meiotic drive: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","target":"concept.go.go0110134","type":"related"},{"source":"claim.frontier.pmid-42829444","sources":[{"id":"source.frontier.pmid-42829444","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42829444%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42829444 names immune response: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42827305","sources":[{"id":"source.frontier.pmid-42827305","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827305%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827305 names circadian rhythm: \"The Clock (Clk) gene encodes a core transcriptional regulator of circadian rhythms and contains a polymorphic polyglutamine (polyQ) tract whose evolutionary significance remains unclear.\"","target":"concept.go.go0007623","type":"related"},{"source":"claim.frontier.pmid-42826334","sources":[{"id":"source.frontier.pmid-42826334","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42826334%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42826334 names Risk Factors: \"This study investigates the role of cytochrome P450 2C19 (CYP2C19) gene polymorphisms and dyslipidaemic metabolism in ischemic cerebrovascular disease among Mongolian patients, analyzing their interaction with conventional risk factors.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42821620","sources":[{"id":"source.frontier.pmid-42821620","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821620%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821620 names Cross-sectional study: \"Between 2022 and 2024, this cross-sectional study was done in rural and periurban villages of the Ngounié and Moyen-Ogooué provinces of Gabon.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42821607","sources":[{"id":"source.frontier.pmid-42821607","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821607%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821607 names Systems Theory: \"By uncovering scaling behaviors through the integration of complex systems theory and blockchain data analytics, this work provides a principled framework for understanding the underlying mechanisms of decentralized financial systems.\"","target":"concept.mesh.d013598","type":"related"},{"source":"claim.frontier.pmid-42821558","sources":[{"id":"source.frontier.pmid-42821558","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821558%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821558 names Risk Factors: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42809586","sources":[{"id":"source.frontier.pmid-42809586","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42809586%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42809586 names Proteomics: \"Here we investigated whether ASD-associated gut microbiota could exhibit altered inflammatory molecular outputs by integrating chemistry-driven profiling of fecal lipopolysaccharides (LPS), functional bacterial proteomics, and neuroimmune cellular assays.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42806681","sources":[{"id":"source.frontier.pmid-42806681","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806681%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42806681 names Respiratory Tract Infections: \"This study assessed the impact of CMV-associated lower respiratory tract infections (LRTIs), diagnosed by polymerase chain reaction (PCR) testing of bronchoalveolar lavage fluid (BALF), focusing on coinfections and clinical outcomes.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42806242","sources":[{"id":"source.frontier.pmid-42806242","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806242%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42806242 names Genomics: \"Here, we combine scRNAseq with evolutionary genomics to understand whether certain cell types exhibit faster evolutionary divergence (using their characteristic genes) than other types of cells (using intestine, head kidney, liver and gill tissues from an emerging model organism, the threespine stickleback).\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42755230","sources":[{"id":"source.frontier.pmid-42755230","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755230%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755230 names Genomics: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42814760","sources":[{"id":"source.frontier.pmid-42814760","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814760%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42814760 names Gastroenterology: \"A draft pathway was developed by the study team comprising gastroenterology and infectious disease specialists, followed by an iterative end user-centered design approach.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42814704","sources":[{"id":"source.frontier.pmid-42814704","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814704%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42814704 names Cross-sectional study: \"This large cross-sectional study (556,474 patients) provides detailed age- and sex-specific prevalence estimates of OSA-associated stroke-risk comorbidities.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42811346","sources":[{"id":"source.frontier.pmid-42811346","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811346%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42811346 names Rheumatology: \"A retrospective cohort study included consecutive patients diagnosed with SpA and PsA in 2012-2016 at a single rheumatology center.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42811130","sources":[{"id":"source.frontier.pmid-42811130","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811130%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42811130 names Genomics: \"This study advances the understanding of regulatory evolution following WGD and offers an open resource supporting vertebrate comparative genomics and research applications in salmonid aquaculture and conservation.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42760912","sources":[{"id":"source.frontier.pmid-42760912","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760912%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760912 names Pharmaceutical Research: \"Bee products are rich sources of bioactive flavonoids with potential applications in nutraceutical and pharmaceutical research.\"","target":"concept.mesh.d000071220","type":"related"},{"source":"claim.frontier.pmid-42799489","sources":[{"id":"source.frontier.pmid-42799489","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799489%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799489 names Latent Infection: \"This case illustrates that CTB can manifest as phenotypically diverse and disseminated disease in preterm IVF twins following reactivation of maternal latent infection.\"","target":"concept.mesh.d000085343","type":"related"},{"source":"claim.frontier.pmid-42791331","sources":[{"id":"source.frontier.pmid-42791331","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791331%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42791331 names Risk Factors: \"Children with bilateral HL have a higher proportion of pre-/perinatal risk factors (e.g., hypoxia, artificial ventilation) than children with unilateral HL.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42789524","sources":[{"id":"source.frontier.pmid-42789524","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789524%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42789524 names Emotional Exhaustion: \"Participants described chronic financial hardship, emotional exhaustion, social stigma toward disability, and limited formal and informal support systems as important influences on maternal QoL.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.pmid-42789505","sources":[{"id":"source.frontier.pmid-42789505","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789505%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42789505 names signal transduction: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42784649","sources":[{"id":"source.frontier.pmid-42784649","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784649%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784649 names Consumer Behavior: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42784570","sources":[{"id":"source.frontier.pmid-42784570","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784570%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784570 names Cross-sectional study: \"A cross-sectional study was conducted with 414 randomly selected students using a self-administered questionnaire.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42778666","sources":[{"id":"source.frontier.pmid-42778666","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778666%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778666 names horizontal gene transfer: \"Despite this complex evolutionary history, phylogenetic analyses place core PCWDE functionalities at the base of the Phytophaga (weevils, leaf beetles, and longhorn beetles) and reveal subsequent horizontal gene transfer (HGT) events from various donors during early Phytophaga diversification.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42778332","sources":[{"id":"source.frontier.pmid-42778332","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778332%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778332 names Rheumatology: \"For each patient, yearly Systemic Lupus International Collaborating Clinics/American College of Rheumatology Damage Index (SDI) worsening occasions and average proportion of follow-up spent in LLDAS-5 and LLDAS-7.5 were derived.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42777016","sources":[{"id":"source.frontier.pmid-42777016","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42777016%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42777016 names Cognitive bias: \"Our framework bridges neuroscience, psychology, and collective behavior, enabling empirically testable hypotheses about how cognitive biases propagate from individual cognition to social outcomes in complex environments.\"","target":"concept.wikipedia.cognitive-bias","type":"related"},{"source":"claim.frontier.pmid-42773366","sources":[{"id":"source.frontier.pmid-42773366","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42773366%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42773366 names Quality of Life: \"ADHD symptoms are frequently reported in parents of children with ADHD, however, their prevalence and association with children's mental health and quality of life (QoL) remain poorly understood.\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42794852","sources":[{"id":"source.frontier.pmid-42794852","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794852%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794852 names cellular senescence: \"Rather than resulting from a single pathological event, brain aging involves coordinated changes across multiple biological processes, including neuroinflammation, proteostasis impairment, mitochondrial dysfunction, neurotransmission deficit, cellular senescence, gut microbiota dysbiosis, extracellular vesicle dysregulation, nutrient-sensing disturbances, and metabolic drift.\"","target":"concept.go.go0090398","type":"related"},{"source":"claim.frontier.pmid-42792502","sources":[{"id":"source.frontier.pmid-42792502","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792502%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792502 names Psychological Well-Being: \"Participants were 408 students at a Turkish state university (71.1% women; mean age 21.76 years, SD = 4.20) who completed the Life Goals Scale, distinguishing career, relationship, and body-related goals, together with measures of psychological well-being, psychological distress, cognitive flexibility, physical activity, and nutritional risk.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42766660","sources":[{"id":"source.frontier.pmid-42766660","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766660%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766660 names Ground truth: \"A high-fidelity biventricular electromechanical model of a murine heart was developed using a high-resolution myocardial fiber field obtained via mesoscopic optical imaging, which serves as a reference ground truth.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42766622","sources":[{"id":"source.frontier.pmid-42766622","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766622%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766622 names Consumer Behavior: \"However, many studies overlook contextual factors that directly influence secondhand purchase and mediate the impact of psychological factors on consumer behavior.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42766584","sources":[{"id":"source.frontier.pmid-42766584","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766584%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766584 names Cognitive bias: \"Metacognitive Training for psychosis is an evidence-based psychological intervention targeting cognitive biases associated with psychotic symptoms, but evidence regarding sex-specific treatment effects remain limited.\"","target":"concept.wikipedia.cognitive-bias","type":"related"},{"source":"claim.frontier.pmid-42766546","sources":[{"id":"source.frontier.pmid-42766546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766546 names Evidence-based practice: \"Multi-professional medication reviews (MPMRs) are structured, collaborative processes designed to optimize medication management and promote evidence-based practice.\"","target":"concept.wikipedia.evidence-based-practice","type":"related"},{"source":"claim.frontier.pmid-42764320","sources":[{"id":"source.frontier.pmid-42764320","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764320%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764320 names Neurosurgery: \"Medical record data of patients with confirmed diagnosis of central neurocytoma who underwent surgical resection at Department of Neurosurgery of \"Ospedale del Mare\" in Naples - Italy, between January and December 2022, were retrospectively reviewed.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42796055","sources":[{"id":"source.frontier.pmid-42796055","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796055%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796055 names Cardiology: \"PubMed/MEDLINE was searched through 12 August 2026 using domain-based search blocks, supplemented by EULAR, GRAPPA, and European Society of Cardiology guidance and citation tracking.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42762163","sources":[{"id":"source.frontier.pmid-42762163","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42762163%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42762163 names horizontal gene transfer: \"Edges represent co-occurrence-based ecological proximity rather than direct physical contacts or confirmed horizontal gene transfer events.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42827649","sources":[{"id":"source.frontier.pmid-42827649","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827649%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827649 names Differential effects: \"This study aimed to examine the differential effects of static and dynamic prompts in stroke patients and healthy controls.\"","target":"concept.wikipedia.differential-effects","type":"related"},{"source":"claim.frontier.pmid-42827524","sources":[{"id":"source.frontier.pmid-42827524","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827524%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827524 names Resource Allocation: \"This study examined whether individuals use these principles strategically to manage impressions, signaling warmth or competence in resource allocation.\"","target":"concept.mesh.d040841","type":"related"},{"source":"claim.frontier.pmid-42797642","sources":[{"id":"source.frontier.pmid-42797642","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42797642%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42797642 names Vaccine-Preventable Diseases: \"In this scenario, evaluating the immune status against core vaccine-preventable diseases becomes of primary importance to ensure adequate protection in such clinically fragile patients.\"","target":"concept.mesh.d000079263","type":"related"},{"source":"claim.frontier.pmid-42788599","sources":[{"id":"source.frontier.pmid-42788599","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42788599%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42788599 names Central Nervous System Infections: \"Nocardia asiatica is a rare opportunistic pathogen typically associated with pulmonary and central nervous system infections; however, musculoskeletal infections are uncommon.\"","target":"concept.mesh.d002494","type":"related"},{"source":"claim.frontier.pmid-42763478","sources":[{"id":"source.frontier.pmid-42763478","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763478%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763478 names Psychological Well-Being: \"Such memories suggest how psychological well-being during health crises and beyond may be jointly co-constructed by technology and society.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42761607","sources":[{"id":"source.frontier.pmid-42761607","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761607%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761607 names Latent Infection: \"In resource-limited settings, the absence of routine TB screening and restricted timely access to renal biopsy often lead to empirical immunosuppression, which may worsen outcomes by reactivating latent infections.\"","target":"concept.mesh.d000085343","type":"related"},{"source":"claim.frontier.pmid-42760564","sources":[{"id":"source.frontier.pmid-42760564","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760564%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760564 names Neurology: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42758776","sources":[{"id":"source.frontier.pmid-42758776","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758776%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42758776 names Analytic hierarchy: \"A mixed-methods framework is employed, combining literature and secondary data with expert interviews, the Analytic Hierarchy Process (AHP), a multinomial Logit model of freight mode choice, and a SWOT analysis.\"","target":"concept.planetmath.analytichierarchy","type":"related"},{"source":"claim.frontier.pmid-42758734","sources":[{"id":"source.frontier.pmid-42758734","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758734%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42758734 names Age Distribution: \"We analyzed five key characteristics: i) inter-category distribution of citation intents, ii) average number of citation intents per article, iii) age distribution of citation intents, iv) similarity of the age distributions of citation intent, and v) predictability of the number of citation intents.\"","target":"concept.mesh.d017677","type":"related"},{"source":"claim.frontier.pmid-42824361","sources":[{"id":"source.frontier.pmid-42824361","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824361%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824361 names Risk Factors: \"Log-transformed HRV measures were analyzed using multivariable linear regression adjusted for demographic characteristics, vascular and metabolic risk factors, smoking status, and renal function.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42824182","sources":[{"id":"source.frontier.pmid-42824182","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824182%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824182 names Research program: \"The synthesis is based on harmonized outcome measures derived from three prospective 4-week intervention studies conducted within a single research program.\"","target":"concept.wikipedia.research-program","type":"related"},{"source":"claim.frontier.pmid-42824079","sources":[{"id":"source.frontier.pmid-42824079","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824079%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824079 names Psychology, Social: \"This study evaluates the importance of raising public legal awareness in regulating deviant behavior from the perspective of social psychology, using legal socialization theory and planned behavior theory as conceptual frameworks.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.pmid-42823984","sources":[{"id":"source.frontier.pmid-42823984","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823984%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42823984 names Work-Life Balance: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","target":"concept.mesh.d000072358","type":"related"},{"source":"claim.frontier.pmid-42813109","sources":[{"id":"source.frontier.pmid-42813109","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42813109%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42813109 names Social Sciences: \"The longstanding dominance of values rooted in Western, Educated, Industrialized, Rich, and Democratic (WEIRD) societies has increasingly come under scrutiny across the social sciences.\"","target":"field.mesh.d012942","type":"related"},{"source":"claim.frontier.pmid-42796013","sources":[{"id":"source.frontier.pmid-42796013","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796013%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796013 names Rheumatology: \": This retrospective, multicenter, observational cohort study reviewed the medical records of 80 adults with moderate-to-severe SLE who had received at least 6 doses (≥20 weeks) of intravenous anifrolumab 300 mg every 4 weeks as part of routine clinical care at 13 Egyptian tertiary rheumatology centers; medical record review and data extraction were performed between May and July 2026.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42757005","sources":[{"id":"source.frontier.pmid-42757005","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757005%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42757005 names Pathology, Surgical: \"After nondiagnostic radiographic evaluation, esophagogastroduodenoscopy, colonoscopy, and push enteroscopy, anterograde double-balloon enteroscopy revealed an actively bleeding ulcerated midjejunal mass, later measuring 6 cm on surgical pathology, with pathology confirming the diagnosis of metastatic melanoma.\"","target":"field.mesh.d010340","type":"related"},{"source":"claim.frontier.pmid-42752632","sources":[{"id":"source.frontier.pmid-42752632","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42752632%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42752632 names Quality of Life: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42795965","sources":[{"id":"source.frontier.pmid-42795965","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795965%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795965 names Ophthalmology: \"We retrospectively analyzed 17 patients with cytologically confirmed PVRL evaluated at two ophthalmology centers in Bucharest, Romania (2018-2023).\"","target":"ology.ophthalmology","type":"related"},{"source":"claim.frontier.pmid-42795646","sources":[{"id":"source.frontier.pmid-42795646","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795646%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795646 names horizontal gene transfer: \"Correlation analyses revealed associations among TRGs, microbial taxa, and treatment conditions but did not establish direct host-gene relationships or horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42794677","sources":[{"id":"source.frontier.pmid-42794677","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794677%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794677 names Risk Factors: \"Overweight and obesity, frequently accompanied by hyperinsulinemia, are established risk factors for female infertility.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42750388","sources":[{"id":"source.frontier.pmid-42750388","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42750388%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42750388 names Pathology, Molecular: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42749366","sources":[{"id":"source.frontier.pmid-42749366","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749366%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42749366 names Sample Size: \"Results will inform design and sample size of a confirmatory randomised controlled trial to assess effectiveness of the intervention.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42748195","sources":[{"id":"source.frontier.pmid-42748195","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748195%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748195 names Sample Size: \"Overall methodological quality was generally characterized by moderate methodological concerns, most commonly related to limited control of confounding variables, incomplete reporting of measurement validity, and small sample sizes.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42748135","sources":[{"id":"source.frontier.pmid-42748135","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748135%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748135 names Proteomics: \"This study provides a comprehensive framework for integrating transcriptomics and proteomics data and identifies potential gene products that might significantly impact the ability of diverse bacterial pathogens to adapt to hostile infection environments.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42748115","sources":[{"id":"source.frontier.pmid-42748115","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748115%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748115 names Family Structure: \"There is considerable evidence showing that children growing up in two-parent intact families are more academically successful than children from other family structures.\"","target":"concept.mesh.d000092822","type":"related"},{"source":"claim.frontier.pmid-42748081","sources":[{"id":"source.frontier.pmid-42748081","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748081%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748081 names Qualitative Research: \"Reporting adhered to the Consolidated Criteria for Reporting Qualitative Research (COREQ).\"","target":"concept.mesh.d036301","type":"related"},{"source":"claim.frontier.pmid-42748079","sources":[{"id":"source.frontier.pmid-42748079","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748079%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748079 names Sample Size: \"No significant differences emerged between the two third-person views, possibly due to sample size or dancer background.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42812171","sources":[{"id":"source.frontier.pmid-42812171","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42812171%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42812171 names Serology: \"This case highlights the ultrasonographic \"cerebral gyrus sign\" as a potential imaging clue for breast CE and emphasizes that hydatid disease should be considered in patients from endemic regions presenting with complex breast masses, even with negative serology.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42795945","sources":[{"id":"source.frontier.pmid-42795945","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795945%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795945 names Respiratory Tract Infections: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42768386","sources":[{"id":"source.frontier.pmid-42768386","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768386%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768386 names horizontal gene transfer: \"Shared ARGs between commensal and pathogenic bacteria provided clues to horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42760901","sources":[{"id":"source.frontier.pmid-42760901","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760901%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760901 names Cross-sectional study: \"A cross-sectional study was conducted among 150 MSM and TGW (75 PrEP users and 75 non-users) recruited from two HIV prevention clinics in Chiang Mai, Thailand Depressive symptoms were assessed using the Patient Health Questionnaire-9 (PHQ-9), and suicidal ideation/risk was assessed using the Columbia-Suicide Severity Rating Scale (C-SSRS).\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42746596","sources":[{"id":"source.frontier.pmid-42746596","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746596%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746596 names Genomics: \"Overall, this review provides an integrated conceptual and evidence-based perspective summarizing proposed relationships between genome architecture and phytochemical diversity and outlines future priorities for functional genomics, precision breeding, metabolic engineering, and sustainable utilization of MAPs.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42743377","sources":[{"id":"source.frontier.pmid-42743377","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743377%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743377 names Further research is needed: \"Further research is needed to examine which study characteristics researchers consider most important when assessing a manuscript's quality in peer review.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42743310","sources":[{"id":"source.frontier.pmid-42743310","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743310%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743310 names Grounded Theory: \"This research employs Grounded Theory, a data-driven approach that generates explanations or theories from the data.\"","target":"concept.mesh.d066296","type":"related"},{"source":"claim.frontier.pmid-42743306","sources":[{"id":"source.frontier.pmid-42743306","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743306%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743306 names immune response: \"This convergence in viral immune evasion strategies provides valuable insights into the development of broad-spectrum antiviral therapies and offers new opportunities for enhancing immune responses in therapeutic contexts.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42743204","sources":[{"id":"source.frontier.pmid-42743204","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743204%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743204 names Cross-sectional study: \"This retrospective cross-sectional study quantified labial and lingual alveolar bone thickness and examined whether signed IA-PAMD indicated apical root position within the symphysis.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42743162","sources":[{"id":"source.frontier.pmid-42743162","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743162%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743162 names Ground truth: \"The microscopic images of these stains serve as a ground truth for different machine learning models, which can subsequently learn to detect necrosis from the brightfield image, i.e., without the need for staining.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42743158","sources":[{"id":"source.frontier.pmid-42743158","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743158%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743158 names Quality of Life: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42403695","sources":[{"id":"source.frontier.pmid-42403695","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42403695%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42403695 names Empirical evidence: \"It seeks to provide empirical evidence on how cognitive, social, and spiritual factors interact in shaping Muslim consumers' purchasing behavior.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42807220","sources":[{"id":"source.frontier.pmid-42807220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42807220 names Opportunistic Infections: \"Patients with systemic lupus erythematosus (SLE) receiving long-term glucocorticoids and immunosuppressants are at markedly increased risk of opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42807094","sources":[{"id":"source.frontier.pmid-42807094","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807094%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42807094 names Rheumatology: \"A cross-sectional study of 704 adult patients receiving care at the specialized Rheumatology Outpatient Clinic of the Hannover Medical School was conducted.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42795904","sources":[{"id":"source.frontier.pmid-42795904","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795904%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795904 names immune response: \"Collectively, our findings provide a system-level framework describing the associations between dysbiosis-relevant host pathways, CRC-related regulatory networks, and immune responses.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42768354","sources":[{"id":"source.frontier.pmid-42768354","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768354%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768354 names Psychopathology: \"Suicidality among rural women in Bihar cannot be understood solely as an outcome of individual psychopathology.\"","target":"ology.psychopathology","type":"related"},{"source":"claim.frontier.pmid-42746605","sources":[{"id":"source.frontier.pmid-42746605","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746605%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746605 names Respiratory Tract Infections: \"This study compared antibiotic review practices and prescribing patterns among hospitalised patients with respiratory tract infections before and during the pandemic.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42736559","sources":[{"id":"source.frontier.pmid-42736559","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42736559%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42736559 names Obstetrics: \"This qualitative interview study included 20 individuals with a medically documented diagnosis of adenomyosis recruited across three German-speaking countries as well as five specialists in obstetrics and gynecology practicing in Germany.\"","target":"field.mesh.d009774","type":"related"},{"source":"claim.frontier.pmid-42796834","sources":[{"id":"source.frontier.pmid-42796834","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796834%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796834 names seed germination: \"This narrative review synthesizes current insights into nanomaterial uptake pathways, translocation dynamics, and intracellular trafficking from seed germination to reproductive maturity.\"","target":"concept.go.go0009845","type":"related"},{"source":"claim.frontier.pmid-42794013","sources":[{"id":"source.frontier.pmid-42794013","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794013%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794013 names Consumer Behavior: \"This systematic literature review synthesizes research at the intersection of consumer behavior, technological innovation, and food waste.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42731744","sources":[{"id":"source.frontier.pmid-42731744","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42731744%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42731744 names Social Behavior: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","target":"concept.mesh.d012919","type":"related"},{"source":"claim.frontier.pmid-42799291","sources":[{"id":"source.frontier.pmid-42799291","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799291%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799291 names Public Health: \"This phenomenon is attributed to the rarity of pathogens, the lack of recommended antifungal agents, or unrecognized intrinsic drug resistance, which poses a serious threat to clinical management and public health.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42798677","sources":[{"id":"source.frontier.pmid-42798677","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798677%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798677 names Psychological Well-Being: \"Against the backdrop of growing public concern regarding mental health, examining the relationship between arts participation and individual psychological well-being is important for understanding the potential health-related value of sociocultural activities.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42798644","sources":[{"id":"source.frontier.pmid-42798644","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798644%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798644 names Respiratory Tract Infections: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42798637","sources":[{"id":"source.frontier.pmid-42798637","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798637%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798637 names Sample Size: \"However, given the limited sample size and short follow-up of this study, large prospective studies are warranted to confirm these observations.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42798632","sources":[{"id":"source.frontier.pmid-42798632","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798632%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798632 names Sample Size: \"Evidence from this initial population indicated that YWKS therapy was correlated with the treatment-associated modulation of 119 of the 352 identified metabolic markers, while 54 remained in a state of imbalance, suggesting that therapeutic coverage was only partially achieved in this restricted sample size.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42784269","sources":[{"id":"source.frontier.pmid-42784269","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784269%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784269 names Radiology, Interventional: \"Interventional radiology (IR) has reshaped contemporary management strategies for selected gynecological and obstetric disorders by introducing minimally invasive, organ-sparing therapeutic alternatives to conventional surgical approaches.\"","target":"field.mesh.d015642","type":"related"},{"source":"claim.frontier.pmid-42730235","sources":[{"id":"source.frontier.pmid-42730235","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42730235%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42730235 names Genomics: \"Responses to emerging pest challenges can benefit from insights generated by population genomics techniques, opening up new avenues for research and supporting efforts to quickly tailor management strategies for novel pests.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42729983","sources":[{"id":"source.frontier.pmid-42729983","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729983%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729983 names immune response: \"Temperature-associated markers mapped to loci associated with immune response, lipid metabolism and transmembrane protein genes.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42726890","sources":[{"id":"source.frontier.pmid-42726890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42726890 names Genomics: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42726368","sources":[{"id":"source.frontier.pmid-42726368","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726368%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42726368 names Taxonomy: \"This review critically summarizes evidence linking the Mediterranean diet, gut microbiome, microbial metabolites, and cardiovascular disease risk, with emphasis on the shift from microbial taxonomy to functional pathways, multiomic integration, and translation to precision nutrition.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42793476","sources":[{"id":"source.frontier.pmid-42793476","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42793476%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42793476 names Psycho-Oncology: \"These findings support prospective, multicenter evaluation of integrated psycho-oncology and nutrition-rehabilitation care pathways after upper GI cancer surgery and should not be interpreted as demonstrating a causal treatment effect.\"","target":"field.mesh.d000073320","type":"related"},{"source":"claim.frontier.pmid-42725296","sources":[{"id":"source.frontier.pmid-42725296","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725296%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42725296 names Genomics: \"Additionally, a population genomics analysis was conducted using 7706 high-quality SNPs to assess the genomic structure of captive populations.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42721209","sources":[{"id":"source.frontier.pmid-42721209","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721209%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721209 names Coping Skills: \"Participants completed the Mindful Attention Awareness Scale (MAAS), the Athletic Coping Skills Inventory-28 (ACSI-28), and the Sport Mental Toughness Questionnaire (SMTQ).\"","target":"concept.mesh.d000097813","type":"related"},{"source":"claim.frontier.pmid-42721180","sources":[{"id":"source.frontier.pmid-42721180","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721180%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721180 names Genomics: \"Additionally, we highlight key aspects of the bacterium's genomics, phylogenetics, and physiological interactions with its tsetse host, including influences on host gene expression reproductive physiology, and vector competence.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42721148","sources":[{"id":"source.frontier.pmid-42721148","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721148%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721148 names Psychological Well-Being: \"These findings suggest that the overall configuration of caregivers may be relevant to depression among people with cognitive impairment and highlight the importance of considering care network composition when assessing their psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42721140","sources":[{"id":"source.frontier.pmid-42721140","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721140%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721140 names Psychology, Social: \"The current study aimed to explore the role of religiosity and the social psychology concept of collective narcissism in political behaviour.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.pmid-42721128","sources":[{"id":"source.frontier.pmid-42721128","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721128%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721128 names Private Sector: \"We conducted five qualitative workshops, with 58 participants from academia, government, public and third sectors, and the private sector.\"","target":"concept.mesh.d017149","type":"related"},{"source":"claim.frontier.pmid-42792412","sources":[{"id":"source.frontier.pmid-42792412","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792412%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792412 names Adaptation, Psychological: \"The IS demonstrated satisfactory psychometric properties for assessing individual differences in insensitivity and may facilitate further research on its role in psychological adaptation and mental health among university students.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.pmid-42780961","sources":[{"id":"source.frontier.pmid-42780961","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780961%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42780961 names Mental Disorders: \"Therapist-guided internet-delivered cognitive behavioural therapy (guided iCBT) is an effective treatment for common mental disorders and has the potential to improve access to care.\"","target":"concept.mesh.d001523","type":"related"},{"source":"claim.frontier.pmid-42780909","sources":[{"id":"source.frontier.pmid-42780909","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780909%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42780909 names Public Health: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42795560","sources":[{"id":"source.frontier.pmid-42795560","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795560%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795560 names Global Health: \"Tuberculosis (TB) remains a major global health burden, and diabetes mellitus increases the risk of active TB.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42775227","sources":[{"id":"source.frontier.pmid-42775227","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42775227%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42775227 names Psychological Well-Being: \"This integrative narrative review synthesizes current evidence on smartphone use among adolescents, focusing on three primary domains: psychological well-being, cognitive functioning and learning, and emerging policy responses such as school cellphone bans.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42732108","sources":[{"id":"source.frontier.pmid-42732108","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732108%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42732108 names Critical thinking: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","target":"concept.wikipedia.critical-thinking","type":"related"},{"source":"claim.frontier.pmid-42709861","sources":[{"id":"source.frontier.pmid-42709861","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709861%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709861 names immune response: \"We set out to investigate the potential effects of bile acid sequestration on mucosal immune responses and to evaluate how enteric microbial pathogens colonize the small intestine of mice in vivo.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42709851","sources":[{"id":"source.frontier.pmid-42709851","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709851%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709851 names Biomedical Research: \"Furthermore, the feature-selection and integration workflow provides a framework for analysing complex multimodal datasets in future biomedical research.\"","target":"concept.mesh.d035843","type":"related"},{"source":"claim.frontier.pmid-42792025","sources":[{"id":"source.frontier.pmid-42792025","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792025%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792025 names Genomics: \"These studies were complemented with comparative genomics using the complete genome sequences of selected strains.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42769220","sources":[{"id":"source.frontier.pmid-42769220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42769220 names Cross-sectional study: \"This retrospective cross-sectional study included 173 participants who underwent inspiratory thin-section chest CT and post-bronchodilator pulmonary function testing between January 2023 and March 2025.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42769130","sources":[{"id":"source.frontier.pmid-42769130","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769130%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42769130 names Sexual Behavior: \"University prevention and counseling initiatives may benefit from integrating loneliness reduction, emotion-regulation skills, social connectedness, and the non-stigmatizing assessment of problematic sexual behaviors.\"","target":"concept.mesh.d012725","type":"related"},{"source":"claim.frontier.pmid-42739931","sources":[{"id":"source.frontier.pmid-42739931","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739931%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739931 names Endocrinology: \": A retrospective observational study enrolling patients with sporadic NETs was conducted at Federico II University of Naples, Endocrinology Unit, ENETS Center of Excellence.\"","target":"ology.endocrinology","type":"related"},{"source":"claim.frontier.pmid-42739910","sources":[{"id":"source.frontier.pmid-42739910","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739910%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739910 names Cardiovascular Diseases: \"Despite advances in diagnostics, prevention, and therapy, heart failure (HF) remains the leading cause of death among cardiovascular diseases.\"","target":"concept.mesh.d002318","type":"related"},{"source":"claim.frontier.pmid-42738411","sources":[{"id":"source.frontier.pmid-42738411","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42738411%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42738411 names Radiology: \"This retrospective single-center cohort study included 200 consecutive women with histologically confirmed LACC treated with definitive chemoradiation at the Institute of Oncology and Radiology of Serbia.\"","target":"ology.radiology","type":"related"},{"source":"claim.frontier.pmid-42737031","sources":[{"id":"source.frontier.pmid-42737031","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737031%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737031 names Recidivism: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","target":"concept.mesh.d000075665","type":"related"},{"source":"claim.frontier.pmid-42783218","sources":[{"id":"source.frontier.pmid-42783218","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42783218%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42783218 names Gastroenterology: \": This cross-sectional observational study included 80 patients with Crohn's disease or ulcerative colitis receiving maintenance infliximab or adalimumab therapy at a tertiary Gastroenterology Center in Iraq.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42831226","sources":[{"id":"source.frontier.pmid-42831226","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831226%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42831226 names Persistent Infection: \"This case underscores the complexity of distinguishing checkpoint inhibitor-associated HLH from persistent infection.\"","target":"concept.mesh.d000088562","type":"related"},{"source":"claim.frontier.pmid-42831114","sources":[{"id":"source.frontier.pmid-42831114","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831114%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42831114 names Internal Medicine: \"A 64-year-old man with a history of alcohol use disorder was admitted to Internal Medicine with a diagnosis of ischemic stroke in the left middle cerebral artery territory, with new-onset seizures at admission and a self-limited episode of hyperactive delirium.\"","target":"field.mesh.d007388","type":"related"},{"source":"claim.frontier.pmid-42761220","sources":[{"id":"source.frontier.pmid-42761220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761220 names Adaptation, Psychological: \"As an important negative emotional response in intelligent technology contexts, AI anxiety may be closely associated with university students' academic motivation and psychological adaptation.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.pmid-42761051","sources":[{"id":"source.frontier.pmid-42761051","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761051%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761051 names Global Health: \"Heatstroke is an emerging global health concern, particularly among the elderly.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42761040","sources":[{"id":"source.frontier.pmid-42761040","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761040%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761040 names Taxonomy: \"Ecological analyses were performed to assess the effects of host taxonomy and environment on virome composition.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42739854","sources":[{"id":"source.frontier.pmid-42739854","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739854%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739854 names Global Health: \"Inflammatory bowel diseases (IBDs) are an increasingly important global health problem, yet Central Asia remains underrepresented in international IBD data.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42698113","sources":[{"id":"source.frontier.pmid-42698113","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698113%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42698113 names Neurology: \"Our findings highlight the need for individualized, multidisciplinary management and clear, structured transition pathways from paediatric to adult neurology services.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42830983","sources":[{"id":"source.frontier.pmid-42830983","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42830983%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42830983 names Serology: \"However, positive viral serology or viremia may lead to diagnostic anchoring and delay the identification of underlying malignant disorders.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42757226","sources":[{"id":"source.frontier.pmid-42757226","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757226%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42757226 names Further research is needed: \"While the results underscore the potential value of integrating lifestyle medicine into clinical care, particularly by targeting sleep and substance use, further research is needed to elucidate the causal mechanisms underlying the interplay between BPD and multimorbidity.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42756514","sources":[{"id":"source.frontier.pmid-42756514","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42756514%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42756514 names Global Health: \"We conducted a retrospective cohort study using TriNetX, a global health research network comprising clinical data from real-world settings.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42755864","sources":[{"id":"source.frontier.pmid-42755864","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755864%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755864 names immune response: \"Immune responses were heterogeneous and depended on the experimental context.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42755797","sources":[{"id":"source.frontier.pmid-42755797","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755797%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755797 names Cross-sectional study: \"A cross-sectional study was conducted in 925 asymptomatic adults aged ≥18 years undergoing routine cardiovascular health evaluations.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42755627","sources":[{"id":"source.frontier.pmid-42755627","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755627%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755627 names Pathology, Molecular: \"Under the American College of Medical Genetics and Genomics (ACMG) and the Association for Molecular Pathology (AMP) framework, it was classified as pathogenic on the basis of PVS1 and PS2.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42755626","sources":[{"id":"source.frontier.pmid-42755626","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755626%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755626 names Control Groups: \"Clinical indications for cranial MRI and PFO-related examinations in both groups included headache/migraine, dizziness, cryptogenic stroke/TIA, and other neurological symptoms, with distributions balanced between the PFO and control groups through the matching process.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42796692","sources":[{"id":"source.frontier.pmid-42796692","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796692%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796692 names Cardiology: \"The 2023 European Society of Cardiology Guidelines now formally endorse POAT for selected patients fulfilling strict criteria.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42688919","sources":[{"id":"source.frontier.pmid-42688919","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688919%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42688919 names Serology: \"was positive in blood despite negative IgG serology and isolated IgM positivity, raising concern for potentially misleading serological findings.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42688865","sources":[{"id":"source.frontier.pmid-42688865","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688865%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42688865 names Serology: \"In addition, pre-ASCT celiac serology and HLA-DQ2/DQ8 typing were unavailable.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42687189","sources":[{"id":"source.frontier.pmid-42687189","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687189%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42687189 names Neurology: \"This retrospective cohort study included pwALS meeting the Gold Coast criteria who were treated at the Department of Neurology of the Medical University of Vienna between January 2009 and July 2023.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42685061","sources":[{"id":"source.frontier.pmid-42685061","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42685061%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42685061 names Lung Diseases: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","target":"concept.mesh.d008171","type":"related"},{"source":"claim.frontier.pmid-42825005","sources":[{"id":"source.frontier.pmid-42825005","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42825005%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42825005 names Serology: \"serology prompted readmission, and TAVI was ultimately deferred after the diagnosis was confirmed.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42823403","sources":[{"id":"source.frontier.pmid-42823403","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823403%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42823403 names Risk Factors: \"This study examines the incidence, risk factors, and trends of esophageal cancer by histological and anatomical subtypes, with stratification by sex and age across different countries, using GLOBOCAN 2022 estimates, Cancer Incidence in Five Continents data, and country-level socioeconomic, lifestyle, and metabolic risk-factor indicators.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42818964","sources":[{"id":"source.frontier.pmid-42818964","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42818964%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42818964 names Nephrology: \"Cross sectional retrospective study conducted at nephrology department of National Institute of Child Health from January 2016 to December 2020.\"","target":"ology.nephrology","type":"related"},{"source":"claim.frontier.pmid-42803191","sources":[{"id":"source.frontier.pmid-42803191","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42803191%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42803191 names Genomics: \"Therefore, most eukaryotic genome assemblies in public databases lack gene annotations reducing their value for evolutionary and functional genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42802368","sources":[{"id":"source.frontier.pmid-42802368","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42802368%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42802368 names Family Structure: \"Multivariable logistic regression models with robust standard errors were estimated, adjusting for socio-economic position, family structure, parental mental health, parenting behaviour difficulties, child health, childcare hours, labour status, survey year and non-linear child age effects.\"","target":"concept.mesh.d000092822","type":"related"},{"source":"claim.frontier.pmid-42798137","sources":[{"id":"source.frontier.pmid-42798137","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798137%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798137 names Genomics: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42798110","sources":[{"id":"source.frontier.pmid-42798110","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798110%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798110 names Colorectal Surgery: \"The rate of easy intraoperative identification during laparoscopic colorectal surgery was 88.7% (103/116).\"","target":"field.mesh.d003107","type":"related"},{"source":"claim.frontier.pmid-42782937","sources":[{"id":"source.frontier.pmid-42782937","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42782937%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42782937 names Sample Size: \"However, the extremely small sample size precludes establishing clinical superiority over standard collagen membranes or spontaneous healing.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42776569","sources":[{"id":"source.frontier.pmid-42776569","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42776569%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42776569 names cell death: \"We quantified infected-cell frequency, intracellular bacterial burden dynamics, cell death and host transcriptome by RNA-seq.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42768698","sources":[{"id":"source.frontier.pmid-42768698","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768698%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768698 names Genomics: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42760703","sources":[{"id":"source.frontier.pmid-42760703","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760703%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760703 names Marital Status: \"As a result, the multivariate test of significance demonstrates that parents' marital status, monthly income, and the presence or absence of intimate friends all have a significant influence on student substance abuse and depression.\"","target":"concept.mesh.d017533","type":"related"},{"source":"claim.frontier.pmid-42746056","sources":[{"id":"source.frontier.pmid-42746056","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746056%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746056 names Serology: \"The diagnosis was based mainly on the clinical course and electrophysiological findings, supported by serology and CSF analysis.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42745765","sources":[{"id":"source.frontier.pmid-42745765","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42745765%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42745765 names Cross-sectional study: \"This cross-sectional study evaluated fecal samples from 51 reproductive-age, non-menopausal women living in Puerto Rico, including 41 with PMOS, diagnosed following the Rotterdam criteria, and 10 healthy controls.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42742452","sources":[{"id":"source.frontier.pmid-42742452","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42742452%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42742452 names Histology: \"I seeds intraperitoneally in mice and assessed colonic damage via histology, TUNEL staining, cytokine assays, and tight‑junction protein measurements.\"","target":"ology.histology","type":"related"},{"source":"claim.frontier.pmid-42737913","sources":[{"id":"source.frontier.pmid-42737913","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737913%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737913 names Genomics: \"In this study, we used comparative genomics methods to systematically analyze the evolutionary characteristics of glucose metabolism-related genes in the Chinese longsnout catfish, focusing on gene family evolution, patterns of expansion and contraction, and selective pressures.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42709467","sources":[{"id":"source.frontier.pmid-42709467","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709467%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709467 names Rheumatology: \"Evidence from dedicated rheumatology cohorts on the clinical spectrum, severity, treatment, and outcomes of rheumatic irAEs (rh-irAEs) remains limited.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42708953","sources":[{"id":"source.frontier.pmid-42708953","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42708953%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42708953 names cellular homeostasis: \"Cellular homeostasis was preserved through H+ replenishment via multiple energy-converting complexes and K+ influx to maintain cation-proton balance.\"","target":"concept.go.go0019725","type":"related"},{"source":"claim.frontier.pmid-42706664","sources":[{"id":"source.frontier.pmid-42706664","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42706664%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42706664 names Psychological Well-Being: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42687444","sources":[{"id":"source.frontier.pmid-42687444","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687444%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42687444 names Psychological Well-Being: \"This exploratory, cross-sectional study examined associations among psychological well-being, engagement in leisure activities associated with cognitive reserve, and cognitive performance in older community dwellers (older adults living independently) in Spain.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42670810","sources":[{"id":"source.frontier.pmid-42670810","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42670810%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42670810 names Control Groups: \"However, these results should be interpreted cautiously because systemic insulin resistance markers were not significantly improved, and additional control groups are required to clarify ANA-12-specific and vehicle-related effects.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42663084","sources":[{"id":"source.frontier.pmid-42663084","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42663084%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42663084 names organ growth: \"Here, we investigate the geographic variation in reproductive organ growth in the self-fertilising species Arabidopsis thaliana, where the loss of pollinator dependence is predicted to favour reduced floral investment through resource reallocation.\"","target":"concept.go.go0035265","type":"related"},{"source":"claim.frontier.pmid-42657789","sources":[{"id":"source.frontier.pmid-42657789","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657789%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42657789 names protein quality control: \"Furthermore, this nuclear compensatory response extends to systems governing mitochondrial homeostasis, including protein quality control and RNA degradation and stabilization.\"","target":"concept.go.go0006515","type":"related"},{"source":"claim.frontier.pmid-42657744","sources":[{"id":"source.frontier.pmid-42657744","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657744%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42657744 names horizontal gene transfer: \"Horizontal gene transfer (HGT) can accelerate plant adaptation, but the evolutionary fate of newly acquired nuclear genes is often unclear.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42530440","sources":[{"id":"source.frontier.pmid-42530440","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42530440%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42530440 names Genomics: \"Collectively, these 'omics datasets will facilitate: (i) comparative genomics studies of endosymbiont evolution, (ii) evolve-and-resequence experiments, (iii) genome-scale metabolic modeling studies, and (iv) identification of targets for genetic modification experiments and biotechnological applications.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42522920","sources":[{"id":"source.frontier.pmid-42522920","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42522920%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42522920 names metabolic process: \"Comparative genomic analyses further identified 680 species-specific orthogroups enriched in hormone signaling, metabolic processes, and stress-responsive pathways, among which several LIK1-like genes may contribute to environmental adaptation.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42379141","sources":[{"id":"source.frontier.pmid-42379141","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42379141%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42379141 names Social Behavior: \"Since depression and other psychiatric disorders often lead to impairments in social behavior (e.g., social avoidance), the present study examined the effects of psilocin on social avoidance behavior in mice subjected to chronic social defeat stress (CSDS), a widely used model that closely models human psychosocial stress.\"","target":"concept.mesh.d012919","type":"related"},{"source":"claim.frontier.pmid-42372111","sources":[{"id":"source.frontier.pmid-42372111","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42372111%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42372111 names Genomics: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42231562","sources":[{"id":"source.frontier.pmid-42231562","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42231562%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42231562 names Restless Legs Syndrome: \"The purpose of the THRIVE study is to evaluate the outcomes of patients receiving tonic motor activation (TOMAC) for treatment of refractory restless legs syndrome (RLS) in real-world clinical practice.\"","target":"concept.mesh.d012148","type":"related"},{"source":"claim.frontier.pmid-42824002","sources":[{"id":"source.frontier.pmid-42824002","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824002%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824002 names Urinary Tract Infections: \"In immunocompromised patients, including kidney transplant recipients receiving immunosuppressive therapy, urinary retention may predispose patients to secondary urinary tract infections such as pyelonephritis.\"","target":"concept.mesh.d014552","type":"related"},{"source":"claim.frontier.pmid-42820092","sources":[{"id":"source.frontier.pmid-42820092","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42820092%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42820092 names Pediatrics: \"Background Do-not-resuscitate (DNR) orders in pediatrics are frequently analyzed as static outcomes, although they emerge through a longitudinal process shaped by evolving illness trajectories and repeated clinical encounters.\"","target":"field.mesh.d010372","type":"related"},{"source":"claim.frontier.pmid-42741165","sources":[{"id":"source.frontier.pmid-42741165","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741165%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42741165 names signal transduction: \"In contrast, the gut microbiota in the NJT group was associated with such functions as cell recognition, signal transduction, and immune response.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42729934","sources":[{"id":"source.frontier.pmid-42729934","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729934%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729934 names Cardiology: \"This was a retrospective population-based cohort study of patients diagnosed with CCS at cardiology clinics in Uppsala Region, Sweden, between 2012 and 2020.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42674467","sources":[{"id":"source.frontier.pmid-42674467","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42674467%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42674467 names Public Health: \"Stroke is the main public health problem in Brazil.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42672060","sources":[{"id":"source.frontier.pmid-42672060","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42672060%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42672060 names Cross-sectional study: \"A cross-sectional study was performed with 436 undergraduate medical and non-medical students from eight districts of Bangladesh from September 2023 to July 2025 to encompass diversity throughout academic cycles and guarantee wider geographic representation, using an online structured questionnaire.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42796271","sources":[{"id":"source.frontier.pmid-42796271","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796271%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796271 names Cardio-Oncology: \": A targeted narrative search of PubMed/MEDLINE, Google Scholar, ClinicalTrials.gov, regulatory product information, and oncology/cardio-oncology guidance was performed and updated on 24 August 2026.\"","target":"field.mesh.d000097562","type":"related"},{"source":"claim.frontier.pmid-42791987","sources":[{"id":"source.frontier.pmid-42791987","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791987%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42791987 names Cardiology: \"The distribution across the medical units was 51.9% infectious disease (n = 467), 19.8% geriatric ward (n = 178), 18.5% cardiology (n = 166), and 9.8% other wards (n = 88).\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42668719","sources":[{"id":"source.frontier.pmid-42668719","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42668719%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42668719 names Serology: \"serology became negative.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42792321","sources":[{"id":"source.frontier.pmid-42792321","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792321%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792321 names Consumer Behavior: \"Employees increasingly experience blurred boundaries between work and private life, yet little is known about how workplace experiences influence consumer behavior beyond the workplace.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42781606","sources":[{"id":"source.frontier.pmid-42781606","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781606%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781606 names Psychological Well-Being: \"Academic procrastination undermines students' academic performance and psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42729546","sources":[{"id":"source.frontier.pmid-42729546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729546 names Sample Size: \"However, interpretation is limited by small sample sizes, methodological heterogeneity, short follow-up periods, and insufficient characterization of the investigational products.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42729309","sources":[{"id":"source.frontier.pmid-42729309","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729309%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729309 names Psychological Well-Being: \"Effective crime prevention communication is a cornerstone of urban public health and psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42665853","sources":[{"id":"source.frontier.pmid-42665853","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42665853%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42665853 names Neurology: \"We retrospectively identified all adult patients with status epilepticus (SE) admitted to the Department of Neurology, University Hospital Marburg, Germany, between 2011 and 2023.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42664264","sources":[{"id":"source.frontier.pmid-42664264","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42664264%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42664264 names horizontal gene transfer: \"Bacterial genomes are remarkably dynamic, shaped by horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42661611","sources":[{"id":"source.frontier.pmid-42661611","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661611%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661611 names Palliative Medicine: \"The survey was also distributed to 4500 members of the American Academy of Hospice and Palliative Medicine.\"","target":"field.mesh.d065126","type":"related"},{"source":"claim.frontier.pmid-42724033","sources":[{"id":"source.frontier.pmid-42724033","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42724033%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42724033 names Consumer Behavior: \"In this context, consumer behavior plays a key role, as food choices are shaped not only by economic factors but also by social and psychological dimensions, including identity.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42684341","sources":[{"id":"source.frontier.pmid-42684341","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42684341%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42684341 names Empirical evidence: \"However, empirical evidence on the impact of zone 0 regarding procedural skill acquisition and retention remains limited.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42661048","sources":[{"id":"source.frontier.pmid-42661048","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661048%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661048 names horizontal gene transfer: \"Aeromonas spp. are critical aquatic pathogens affecting global aquaculture and human health, yet their taxonomy is frequently confounded by persistent horizontal gene transfer and high recombination rates.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42658813","sources":[{"id":"source.frontier.pmid-42658813","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42658813%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42658813 names Further research is needed: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42799507","sources":[{"id":"source.frontier.pmid-42799507","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799507%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799507 names Emergency Medicine: \"Reducing diagnostic delays will require educating clinicians who may encounter patients suffering from CH, including those in primary care, emergency medicine, pain management, neurology, otolaryngology, and dentistry.\"","target":"field.mesh.d004635","type":"related"},{"source":"claim.frontier.pmid-42786167","sources":[{"id":"source.frontier.pmid-42786167","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42786167%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42786167 names Risk Factors: \"Our study positions the retinal age gap as a biologically relevant and sex-specific phenotype associated with multiple aging-related diseases and outcomes beyond conventional risk factors, including chronological age.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42719160","sources":[{"id":"source.frontier.pmid-42719160","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719160%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719160 names Psychological Well-Being: \"College students face significant challenges in their physical and psychological well-being, potentially affecting their perception of social status.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42719051","sources":[{"id":"source.frontier.pmid-42719051","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719051%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719051 names immune response: \"Finally, stress response and persistence mechanisms enable subpopulations of parasites to enter dormant, persister-like states characterized by reduced metabolic activity and slowed proliferation, thereby evading both host immune responses and chemotherapeutic agents.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42719040","sources":[{"id":"source.frontier.pmid-42719040","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719040%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719040 names Psychological Well-Being: \"In conclusion, the implementation of psychological training programs is essential to improve referees' distress tolerance and emotional coping strategies, optimizing both their performance and psychological well-being in the professional domain.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42718586","sources":[{"id":"source.frontier.pmid-42718586","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42718586%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42718586 names Sample Size: \"These should be interpreted as exploratory given the sample size and group imbalance.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42739550","sources":[{"id":"source.frontier.pmid-42739550","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739550%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739550 names Neurosurgery: \"We performed a retrospective single-institution cohort study of 85 patients younger than 18 years with histologically confirmed medulloblastoma who underwent surgical treatment at the Neurosurgery Unit of Bagdasar-Arseni Emergency Hospital.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42737509","sources":[{"id":"source.frontier.pmid-42737509","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737509%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737509 names tissue remodeling: \"Diabetes mellitus and periodontitis are bidirectionally associated chronic disorders linked through metabolic dysregulation, host inflammation, microbial dysbiosis, and impaired tissue remodeling.\"","target":"concept.go.go0048771","type":"related"},{"source":"claim.frontier.pmid-42737499","sources":[{"id":"source.frontier.pmid-42737499","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737499%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737499 names cell adhesion: \"RNA sequencing revealed substantial transcriptional reprogramming following SsEV treatment, with enrichment analyses indicating the suppression of pathways associated with cell adhesion, extracellular matrix remodeling, lipid metabolism, and particularly Notch signaling.\"","target":"concept.go.go0007155","type":"related"},{"source":"claim.frontier.pmid-42713496","sources":[{"id":"source.frontier.pmid-42713496","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42713496%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42713496 names Precision Medicine: \"This review outlines the fundamental theories, clinical characteristics, diagnostic modalities, therapeutic strategies, and future research directions concerning HTG-AP, with a particular emphasis on recent advancements in molecular biology, precision medicine, and therapeutic technologies.\"","target":"field.mesh.d057285","type":"related"},{"source":"claim.frontier.pmid-42712360","sources":[{"id":"source.frontier.pmid-42712360","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42712360%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42712360 names Obstetrics: \"This prospective observational cohort study was conducted in the Department of Obstetrics and Gynecology at GSVM Medical College, Kanpur, India, between 2023 and 2024.\"","target":"field.mesh.d009774","type":"related"},{"source":"claim.frontier.pmid-42637891","sources":[{"id":"source.frontier.pmid-42637891","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637891%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42637891 names Pathology, Molecular: \"Recent advances in molecular pathology have significantly improved risk stratification in rhabdomyosarcoma, particularly through the identification of FOXO1 fusion status as a key prognostic marker.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42816488","sources":[{"id":"source.frontier.pmid-42816488","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42816488%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42816488 names cell death: \"-dependent cell death, a hallmark of the hypersensitive response.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42781598","sources":[{"id":"source.frontier.pmid-42781598","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781598%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781598 names Gastroenterology: \"Nephrology and gastroenterology were consulted.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42781208","sources":[{"id":"source.frontier.pmid-42781208","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781208%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781208 names Public Health: \"With epidemic TSA (ETSA) events predicted to increase in frequency and severity as climate change progresses, it is more crucial than ever to identify those children most at risk so that appropriate public health education, parent and family education, and conservative management can be initiated.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42737882","sources":[{"id":"source.frontier.pmid-42737882","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737882%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737882 names immune response: \"The major histocompatibility complex (MHC) represents a critical genetic locus that orchestrates adaptive immune responses through antigen presentation and T cell activation, characterized by exceptional polymorphism and species-specific diversity.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42707529","sources":[{"id":"source.frontier.pmid-42707529","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707529%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42707529 names Emotional Exhaustion: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.pmid-42707216","sources":[{"id":"source.frontier.pmid-42707216","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707216%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42707216 names Ophthalmology: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","target":"ology.ophthalmology","type":"related"},{"source":"claim.frontier.pmid-42637977","sources":[{"id":"source.frontier.pmid-42637977","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637977%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42637977 names Ground truth: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42636257","sources":[{"id":"source.frontier.pmid-42636257","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42636257%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42636257 names Genomics: \"Here, using comparative genomics, we analyzed gene lengths in the bacterial domain and revealed a non-neutral distribution of gene lengths across leading and lagging strands.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42635434","sources":[{"id":"source.frontier.pmid-42635434","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42635434%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42635434 names horizontal gene transfer: \"Since prophages are mobile genetic elements that can move between bacteria, they are also an important vehicle for horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42634019","sources":[{"id":"source.frontier.pmid-42634019","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42634019%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42634019 names Microbiology: \"These results underscore the strong potential of this model to enhance MALDI-TOF-based classification frameworks in clinical microbiology and biodefense applications.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42794146","sources":[{"id":"source.frontier.pmid-42794146","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794146%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794146 names Bone Diseases, Infectious: \"Osteomyelitis is a rare but increasingly recognized manifestation, particularly in children, and may closely mimic malignant or other infectious bone diseases.\"","target":"concept.mesh.d001850","type":"related"},{"source":"claim.frontier.pmid-42737450","sources":[{"id":"source.frontier.pmid-42737450","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737450%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737450 names Lung Diseases: \"Progressive pulmonary fibrosis (PPF) comprises interstitial lung diseases characterized by progressive fibrosis and lung function decline.\"","target":"concept.mesh.d008171","type":"related"},{"source":"claim.frontier.pmid-42778576","sources":[{"id":"source.frontier.pmid-42778576","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778576%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778576 names Research program: \"Here we integrate multi-year Fitbit activity data from the All of Us Research Program with clinical biomarker-derived PhenoAge from 2,222 participants (8,447 person-years).\"","target":"concept.wikipedia.research-program","type":"related"},{"source":"claim.frontier.pmid-42728936","sources":[{"id":"source.frontier.pmid-42728936","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728936%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728936 names Empirical evidence: \"Our study provides new empirical evidence of how land management shapes biodiversity and informs strategies for enhancing soil health and ecosystem potential resilience.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42764930","sources":[{"id":"source.frontier.pmid-42764930","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764930%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764930 names Rheumatology: \"The patient fulfilled the 2019 European Alliance of Associations for Rheumatology/American College of Rheumatology (EULAR/ACR) classification criteria for SLE.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42698454","sources":[{"id":"source.frontier.pmid-42698454","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698454%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42698454 names Marital Status: \"Fully adjusted models controlled for age, sex, grade, residence, family economic status, parental marital status, dormitory relationship, classmate relationship, academic pressure, and physical activity frequency.\"","target":"concept.mesh.d017533","type":"related"},{"source":"claim.frontier.pmid-42653506","sources":[{"id":"source.frontier.pmid-42653506","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42653506%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42653506 names cell cycle: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42627947","sources":[{"id":"source.frontier.pmid-42627947","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627947%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627947 names Integrative Medicine: \"In addition, we will exploratorily assess whether this intervention further impacts decisions regarding the initiation or use of other complementary and integrative medicine (CIM) therapies within the first 3 months following surgery.\"","target":"field.mesh.d055048","type":"related"},{"source":"claim.frontier.pmid-42627158","sources":[{"id":"source.frontier.pmid-42627158","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627158%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627158 names Proteomics: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42764822","sources":[{"id":"source.frontier.pmid-42764822","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764822%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764822 names Public Health: \"Zoonotic sporotrichosis caused by Sporothrix brasiliensis has emerged as a major public health problem in Brazil, with a growing burden of cutaneous sequelae.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42763617","sources":[{"id":"source.frontier.pmid-42763617","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763617%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763617 names Central Nervous System Infections: \"is a rare zoonotic pathogen that only occasionally causes invasive central nervous system infections in humans.\"","target":"concept.mesh.d002494","type":"related"},{"source":"claim.frontier.pmid-42694918","sources":[{"id":"source.frontier.pmid-42694918","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694918%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42694918 names Social Sciences: \"Grounded in reflexive engagement with RAP-Proches - a participatory action research project examining violence in the context of mental illness and family caregiving in Québec, Canada -, and drawing on peer-reviewed literature across psychiatry, psychology, public health, and social sciences, we seek to transform mental health research and services by proposing a reconceptualization of violence in mental health using Johan Galtung's framework of personal, structural, and cultural violence.\"","target":"field.mesh.d012942","type":"related"},{"source":"claim.frontier.pmid-42694103","sources":[{"id":"source.frontier.pmid-42694103","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694103%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42694103 names Empirical evidence: \"As digital learning environments increasingly incorporate artificial intelligence, empirical evidence regarding the educational effectiveness of AI-powered digital avatars remains limited and methodologically heterogeneous.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42689273","sources":[{"id":"source.frontier.pmid-42689273","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689273%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42689273 names Control Groups: \"Unsupervised principal component analysis (PCA) revealed minimal biological variation between the CBD-treated and control groups.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42627223","sources":[{"id":"source.frontier.pmid-42627223","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627223%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627223 names Sociology, Medical: \"Adopting a socioecological and structural epistemic approach, this viewpoint synthesizes empirical findings from communication psychology, medical sociology, and digital infodemiology, and the MEDF is explicitly positioned relative to established health communication frameworks, including the i-frame and s-frame distinction (individual-level vs system-level intervention targets) and socioecological infodemic models, with each construct's novelty defined in relation to adjacent concepts in prior literature.\"","target":"field.mesh.d012962","type":"related"},{"source":"claim.frontier.pmid-42626349","sources":[{"id":"source.frontier.pmid-42626349","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42626349%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42626349 names Neurology: \"Although neurology and cardiac rhythm improved with high-dose methylprednisolone and pacemaker insertion, the patient developed hepatitis and acute kidney injury (AKI) during steroid tapering, which resolved with re-escalation.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42344430","sources":[{"id":"source.frontier.pmid-42344430","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42344430%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42344430 names Open science: \"Discourses of 'Open Science' have been criticised for privileging the quantitative and positivist methodologies of science, technology, engineering and mathematics (STEM) research at the expense of qualitative, interpretive, critical-theoretical, practice-based, and other forms of research more common in the arts, humanities and social sciences (AHSS).\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42761991","sources":[{"id":"source.frontier.pmid-42761991","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761991%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761991 names Serology: \"immunoglobulin M (IgM) serology, and leptospirosis was diagnosed using modified Faine's criteria.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42749735","sources":[{"id":"source.frontier.pmid-42749735","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749735%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42749735 names Risk Factors: \"In the brain, lipid droplets in glial cells, including astrocytes, have been implicated in Alzheimer's disease, but how genetic risk factors influence their composition and turnover remains poorly understood.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42728923","sources":[{"id":"source.frontier.pmid-42728923","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728923%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728923 names Cross-sectional study: \"Because this cross-sectional study used teacher-reported measures, the findings indicate associations rather than causal effects.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42689122","sources":[{"id":"source.frontier.pmid-42689122","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689122%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42689122 names Public Health: \"These findings underscore the critical need to develop resilient cancer care systems that can maintain essential services during future public health crises.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42654288","sources":[{"id":"source.frontier.pmid-42654288","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42654288%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42654288 names Health Status: \"Higher life satisfaction was associated with greater Mediterranean lifestyle adherence, better subjective sleep quality, higher social participation, higher education, marital or cohabiting status, and better self-reported health status (β ≈ 0.06-0.18).\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.pmid-42651394","sources":[{"id":"source.frontier.pmid-42651394","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651394%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42651394 names Psychological Well-Being: \": Positive psychological constructs such as psychological well-being, resilience, subjective vitality, and mental toughness are fundamental to students' emotional adjustment and overall development.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42646326","sources":[{"id":"source.frontier.pmid-42646326","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42646326%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42646326 names Histology: \"Body weight was monitored in both dams and offspring, and liver histology was assessed by hematoxylin and eosin staining.\"","target":"ology.histology","type":"related"},{"source":"claim.frontier.pmid-42616741","sources":[{"id":"source.frontier.pmid-42616741","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616741%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42616741 names Harm Reduction: \"While grounded in the context of Aotearoa New Zealand, this study offers insights for adapting and implementing alcohol harm reduction interventions in diverse settings, particularly those seeking to integrate decolonising and anti-racist principles.\"","target":"concept.mesh.d040261","type":"related"},{"source":"claim.frontier.pmid-42616230","sources":[{"id":"source.frontier.pmid-42616230","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616230%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42616230 names Neurosurgery: \"Prior antibiotic use (53%), intravascular catheterization (31%), and neurosurgery (22%) were common risk factors.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42682491","sources":[{"id":"source.frontier.pmid-42682491","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42682491%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42682491 names Rheumatology: \"Diagnostic classification followed the Peripheral Nerve Society 2010 criteria and the 2022 American College of Rheumatology/European Alliance of Associations for Rheumatology classification criteria for systemic vasculitides.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42650730","sources":[{"id":"source.frontier.pmid-42650730","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42650730%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42650730 names Molecular Epidemiology: \"Our findings suggest that a history of COVID-19 was associated with the risk factor profile, recurrence rate and the molecular epidemiology of CDI, rather than with a more severe clinical course or worse prognosis.\"","target":"field.mesh.d017720","type":"related"},{"source":"claim.frontier.pmid-42612575","sources":[{"id":"source.frontier.pmid-42612575","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42612575%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42612575 names Cardiovascular Diseases: \"These data suggest that clinically actionable individualized treatment selection is feasible in PAH with relevance to other complex cardiovascular diseases.\"","target":"concept.mesh.d002318","type":"related"},{"source":"claim.frontier.pmid-42611865","sources":[{"id":"source.frontier.pmid-42611865","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42611865%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42611865 names Sample Size: \"However, as our sample size was small, these findings must be considered with caution and should not be interpreted as predictive.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42751534","sources":[{"id":"source.frontier.pmid-42751534","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42751534%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42751534 names Opportunistic Infections: \"Nodal KS without cutaneous involvement is an uncommon and potentially underrecognized presentation that may mimic HIV-associated lymphoma, disseminated opportunistic infections, and HHV-8-associated multicentric Castleman disease.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42676491","sources":[{"id":"source.frontier.pmid-42676491","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42676491%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42676491 names Cross-sectional study: \"This registry-based cross-sectional study analyzed phase III/IV immunotherapy RCTs from ClinicalTrials.gov.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42652751","sources":[{"id":"source.frontier.pmid-42652751","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652751%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652751 names Dermatology: \"For each domain, the review outlines brief, commonly used screening instruments that may be feasible in routine dermatology.\"","target":"ology.dermatology","type":"related"},{"source":"claim.frontier.pmid-42609599","sources":[{"id":"source.frontier.pmid-42609599","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42609599%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42609599 names Dermatology: \"Following intensive multidisciplinary intervention involving vascular surgery, nephrology, and dermatology, the progression of the disease was successfully halted.\"","target":"ology.dermatology","type":"related"},{"source":"claim.frontier.pmid-42746465","sources":[{"id":"source.frontier.pmid-42746465","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746465%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746465 names Urinary Tract Infections: \"Associated risk factors and comorbidities included diabetes mellitus, chronic kidney disease, intravenous drug use, and preceding urinary tract infections.\"","target":"concept.mesh.d014552","type":"related"},{"source":"claim.frontier.pmid-42746333","sources":[{"id":"source.frontier.pmid-42746333","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746333%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746333 names Gynecology: \"The final diagnosis was uterine adenosarcoma with sarcomatous overgrowth, International Federation of Gynecology and Obstetrics stage IC.\"","target":"ology.gynecology","type":"related"},{"source":"claim.frontier.pmid-42741475","sources":[{"id":"source.frontier.pmid-42741475","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741475%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42741475 names Thoracic Surgery: \"Early recognition, alongside continued exclusion of infection, may reduce diagnostic delay and the need for extensive thoracic surgery.\"","target":"field.mesh.d013903","type":"related"},{"source":"claim.frontier.pmid-42728996","sources":[{"id":"source.frontier.pmid-42728996","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728996%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728996 names Qualitative Research: \"This study adopts a qualitative research design based on the analysis of secondary data, including official ASEAN documents, academic literature, and case studies.\"","target":"concept.mesh.d036301","type":"related"},{"source":"claim.frontier.pmid-42666182","sources":[{"id":"source.frontier.pmid-42666182","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42666182%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42666182 names Cardiology: \"Follow-up TEE showed persistent moderate mitral regurgitation without the previously observed abnormal echogenic lesion, and the patient was discharged in improved condition with oral antibiotics and arranged cardiology follow-up.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42599952","sources":[{"id":"source.frontier.pmid-42599952","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599952%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599952 names Risk Factors: \"A clear understanding of local Shigella epidemiology and risk factors is essential for guiding control strategies and vaccine introduction.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42599899","sources":[{"id":"source.frontier.pmid-42599899","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599899%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599899 names Research Design: \"The study employed a quantitative, non-experimental, cross-sectional research design to examine those factors.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42599850","sources":[{"id":"source.frontier.pmid-42599850","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599850%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599850 names Open science: \"The protocol has been preregistered on the Open Science Framework (OSF Registries, available at: https://doi.org/10.17605/OSF.IO/92FPE).\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42732322","sources":[{"id":"source.frontier.pmid-42732322","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732322%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42732322 names Thoracic Surgery: \"Chest wall NF is rare and typically occurs following thoracic surgery or penetrating trauma.\"","target":"field.mesh.d013903","type":"related"},{"source":"claim.frontier.pmid-42661822","sources":[{"id":"source.frontier.pmid-42661822","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661822%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661822 names Endocrinology: \"Multidisciplinary collaboration among trauma, vascular, endocrinology, and radiology teams is crucial for optimal management of such complex cases.\"","target":"ology.endocrinology","type":"related"},{"source":"claim.frontier.pmid-42661658","sources":[{"id":"source.frontier.pmid-42661658","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661658%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661658 names immune response: \"Transcriptomic analysis showed broad changes in immune-related programs, particularly those associated with antigen presentation, adaptive immune responses, pro-inflammatory signaling, chemokine and cytokine activity, and mucosal immune regulation.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42652200","sources":[{"id":"source.frontier.pmid-42652200","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652200%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652200 names Nuclear Medicine: \"Candidacy was determined by consensus of two nuclear medicine physicians using VISION-like criteria.\"","target":"field.mesh.d009683","type":"related"},{"source":"claim.frontier.pmid-42595314","sources":[{"id":"source.frontier.pmid-42595314","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42595314%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42595314 names Psychiatry: \"We retrospectively analyzed medical records of 29 patients diagnosed with FND at the Somatic Disorders Outpatient Unit (SOMA) of the Institute of Psychiatry of Hospital das Clínicas, Universidade de São Paulo (IPq-HCFMUSP).\"","target":"field.mesh.d011570","type":"related"},{"source":"claim.frontier.pmid-42594273","sources":[{"id":"source.frontier.pmid-42594273","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42594273%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42594273 names Sample Size: \"The target sample size was 375 participants, with 95 participants in the control group and 140 participants in each of the initial intervention groups, which will allow the study to detect changes of 0.35 SD (approximately 30 minutes per day) in sedentary time and 0.41 SD (approximately 4 points) in HEI score between the control and intervention groups (combined).\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42763558","sources":[{"id":"source.frontier.pmid-42763558","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763558%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763558 names Focal Infection: \"Clinical syndromes were categorized into 4 mutually exclusive categories, namely bloodstream infection, central nervous system infection, pregnancy-associated infection, and other focal infections.\"","target":"concept.mesh.d005490","type":"related"},{"source":"claim.frontier.pmid-42733890","sources":[{"id":"source.frontier.pmid-42733890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42733890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42733890 names Otolaryngology: \"pneumonia prophylaxis and multidisciplinary rheumatology, otolaryngology, pulmonology, and nephrology follow-up.\"","target":"field.mesh.d010036","type":"related"},{"source":"claim.frontier.pmid-42656672","sources":[{"id":"source.frontier.pmid-42656672","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656672%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656672 names Respiratory Tract Infections: \"Mucolytic agents are widely used in respiratory diseases such as chronic obstructive pulmonary disease (COPD), asthma, and upper respiratory tract infections (URTIs).\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42656481","sources":[{"id":"source.frontier.pmid-42656481","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656481%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656481 names Psychiatry: \"This case suggests that, at the interface between psychiatry and somatic medicine, diagnostic overshadowing, anchoring bias, and fragmented care may jointly contribute to delayed recognition of systemic amyloidosis, particularly cardiac amyloidosis.\"","target":"field.mesh.d011570","type":"related"},{"source":"claim.frontier.pmid-42656460","sources":[{"id":"source.frontier.pmid-42656460","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656460%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656460 names cell motility: \"induced a strong pro-inflammatory epithelial response associated with IL-17, TNF, and NF-κB signaling, extracellular matrix remodeling, and increased cell motility.\"","target":"concept.go.go0048870","type":"related"},{"source":"claim.frontier.pmid-42585261","sources":[{"id":"source.frontier.pmid-42585261","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585261%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42585261 names Genomics: \"The software is open-source, cross-platform, and freely available at https://pypi.org/project/revolutionhtl/, providing a robust solution for large-scale evolutionary analyses in comparative genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42585188","sources":[{"id":"source.frontier.pmid-42585188","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585188%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42585188 names immune response: \"In terms of immune responses, no significant difference was found in IEL subsets at day 7 between litter groups.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42584423","sources":[{"id":"source.frontier.pmid-42584423","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42584423%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42584423 names Proteomics: \"We critically appraise four common pitfalls-overinterpreting correlation as causation, relegating proteomics to corroborating transcriptomics, incomplete microbiome-host integration lacking environmental context, and systematic neglect of metabolic fluxomics-and show how exposomics and fluxomics add necessary causal and dynamic dimensions.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42725211","sources":[{"id":"source.frontier.pmid-42725211","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725211%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42725211 names Cardiology: \"As the patient remained neurologically intact, a multidisciplinary team involving microbiology, radiology, cardiology, and spinal surgery agreed on conservative management with prolonged intravenous flucloxacillin.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42649901","sources":[{"id":"source.frontier.pmid-42649901","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42649901%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42649901 names Precision Medicine: \"Recent advances in molecular profiling have revealed actionable therapeutic targets and created new opportunities for precision medicine.\"","target":"field.mesh.d057285","type":"related"},{"source":"claim.frontier.pmid-42644024","sources":[{"id":"source.frontier.pmid-42644024","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42644024%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42644024 names Opportunistic Infections: \"While autoimmunity is the leading cause of PAP in adults, the majority of pediatric cases occur secondary to immunodeficiency and opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42578673","sources":[{"id":"source.frontier.pmid-42578673","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578673%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42578673 names cytokine production: \"cytokine production.\"","target":"concept.go.go0001816","type":"related"},{"source":"claim.frontier.pmid-42578670","sources":[{"id":"source.frontier.pmid-42578670","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578670%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42578670 names Control Groups: \"We generated 350 non-redundant high-quality metagenome-assembled genomes (MAGs) by binning and conducted comparisons between the depression and control groups.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42651890","sources":[{"id":"source.frontier.pmid-42651890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42651890 names cell growth: \"Pathways related to cell growth and motility were more abundant in the GP group, while the GC was enriched in amino acid metabolism and membrane-associated processes.\"","target":"concept.go.go0016049","type":"related"},{"source":"claim.frontier.pmid-42639105","sources":[{"id":"source.frontier.pmid-42639105","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42639105%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42639105 names immune response: \"The diversification of membrane lipids has shaped key membrane functions, including signaling, membrane protein regulation, and immune responses, and may also have driven organismal evolution.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42638898","sources":[{"id":"source.frontier.pmid-42638898","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42638898%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42638898 names immune response: \"Recent studies highlight a complex interaction between the gut microbiome and host mitochondrial dynamics in the modulation of immune responses as well as susceptibility to infectious and inflammatory pathologies.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42577546","sources":[{"id":"source.frontier.pmid-42577546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42577546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42577546 names immune response: \"Immune responses varied across clusters, with distinct gene and cytokine expression patterns.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42728921","sources":[{"id":"source.frontier.pmid-42728921","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728921%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728921 names Empirical evidence: \"Furthermore, the present study adds new contexts to the previous ones by adding workplace contexts and adds empirical evidence within the context of the UAE.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42630507","sources":[{"id":"source.frontier.pmid-42630507","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42630507%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42630507 names immune system development: \"The gut microbiota plays a critical role in immune system development.\"","target":"concept.go.go0002520","type":"related"},{"source":"claim.frontier.pmid-42571083","sources":[{"id":"source.frontier.pmid-42571083","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42571083%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42571083 names cell cycle: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42566407","sources":[{"id":"source.frontier.pmid-42566407","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42566407%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42566407 names Cross-sectional study: \"This cross-sectional study analysed digitized dental casts from 60 males and 60 females.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42588195","sources":[{"id":"source.frontier.pmid-42588195","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42588195%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42588195 names Causal inference: \"Because of the uncontrolled study design, causal inferences regarding treatment effects cannot be made, and these findings should be considered hypothesis-generating.\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42560943","sources":[{"id":"source.frontier.pmid-42560943","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560943%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560943 names Research Design: \"A quantitative research design was adopted using a structured 5-point Likert scale survey questionnaire was completed by 480 Gen Z customers of consumer electronics retailers in Sri Lanka.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42560043","sources":[{"id":"source.frontier.pmid-42560043","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560043%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560043 names Proteomics: \", and used differential proteomics to identify functions upregulated specifically when bacteria are grown on maize roots.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42569382","sources":[{"id":"source.frontier.pmid-42569382","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42569382%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42569382 names Cross-sectional study: \"In this cross-sectional study, the top 100 videos for each Chinese search term ('passive smoking' and 'secondhand smoking') were retrieved from Bilibili and Douyin on 10 June 2026.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42554464","sources":[{"id":"source.frontier.pmid-42554464","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42554464%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42554464 names Proteomics: \"Quantitative proteomics indicated that the fitness burden extends beyond flagellar components, with protein-abundance changes across metabolism, stress responses, and signaling.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42528383","sources":[{"id":"source.frontier.pmid-42528383","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42528383%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42528383 names horizontal gene transfer: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42589669","sources":[{"id":"source.frontier.pmid-42589669","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42589669%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42589669 names developmental process: \"BRI1-EMS-SUPPRESSOR 1 (BES1)/BRASSINAZOLE-RESISTANT 1 (BZR1) transcription factors serve as core regulators of brassinosteroid (BR) signal in seed plants, where they control diverse developmental processes, including cell elongation, vascular development, and environmental responses; however, their evolutionary trajectory and functional diversification in early-diverging land plants remain poorly characterized.\"","target":"concept.go.go0032502","type":"related"},{"source":"claim.frontier.pmid-42590131","sources":[{"id":"source.frontier.pmid-42590131","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42590131%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42590131 names Sample Size: \"Further prospective studies with larger sample sizes are warranted.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42545021","sources":[{"id":"source.frontier.pmid-42545021","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42545021%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42545021 names Microbiology: \"This review incorporates flower ecology, microbiology, and pollination biology, and points out how flowers act as microbial gateways between the aboveground and belowground parts of plants, and how flowers remain underappreciated for their role in systemic interaction between plants and microbes.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42549006","sources":[{"id":"source.frontier.pmid-42549006","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42549006%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42549006 names immune response: \"This bacteria-fungi-phage consortium synergistically modulates host immune responses, fostering chronic inflammation and tissue destruction.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42606346","sources":[{"id":"source.frontier.pmid-42606346","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42606346%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42606346 names cell cycle: \"Genes associated with phenotypic differentiation along the urbanization gradient were part of many different pathways including signal transmission, cell cycle and DNA repair.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42560857","sources":[{"id":"source.frontier.pmid-42560857","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560857%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560857 names Risk Factors: \"To assess the long-term effects of teleprehabilitation on modifiable risk factors and quality of life up to 1 year following elective cardiac surgery.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42550924","sources":[{"id":"source.frontier.pmid-42550924","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42550924%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42550924 names reproductive process: \"Methionine synthases (MetEs) are essential for plant metabolism and are highly expressed during reproductive processes.\"","target":"concept.go.go0022414","type":"related"},{"source":"claim.frontier.pmid-42520407","sources":[{"id":"source.frontier.pmid-42520407","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42520407%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42520407 names Cell biology: \"Here, we have sequenced a contiguous genome of Spirogyra pratensis, the eponymous representative of Spirogyrales and a classical model system for evolutionary cell biology in the green lineage.\"","target":"ology.cell-biology","type":"related"},{"source":"claim.frontier.pmid-42489250","sources":[{"id":"source.frontier.pmid-42489250","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489250%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42489250 names cell death: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42470282","sources":[{"id":"source.frontier.pmid-42470282","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42470282%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42470282 names developmental process: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","target":"concept.go.go0032502","type":"related"},{"source":"claim.frontier.pmid-42538349","sources":[{"id":"source.frontier.pmid-42538349","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42538349%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42538349 names Causal inference: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42536671","sources":[{"id":"source.frontier.pmid-42536671","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42536671%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42536671 names Causal inference: \"NLCD uses these techniques to extend the statistical tests in an existing linear causal discovery method called the Causal Inference Test (CIT).\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42597521","sources":[{"id":"source.frontier.pmid-42597521","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42597521%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42597521 names Research Design: \"We used an implementation research design with a mixed methods approach.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42531275","sources":[{"id":"source.frontier.pmid-42531275","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531275%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531275 names Further research is needed: \"Given the exploratory nature of this single-center study, further research is needed to assess the transferability of these findings to other maternity care settings in Lebanon.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42531267","sources":[{"id":"source.frontier.pmid-42531267","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531267%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531267 names Risk Factors: \"We aimed to estimate the prevalence and investigate patterns of multimorbidity in a rural population in India and examine their associations with four common behavioural risk factors (BRFs): daily drinking, tobacco consumption, physical inactivity, and poor sleep.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42531261","sources":[{"id":"source.frontier.pmid-42531261","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531261%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531261 names Cross-sectional study: \"We conducted a mixed-methods retrospective cross-sectional study at Neno District Hospital and Lisungwi Community Hospital.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42531248","sources":[{"id":"source.frontier.pmid-42531248","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531248%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531248 names Cross-sectional study: \"This cross-sectional study used pooled 2023-2024 National Health Interview Survey Adult Sample data.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42531221","sources":[{"id":"source.frontier.pmid-42531221","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531221%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531221 names Risk Factors: \"This study aimed to assess the prevalence and specific risk factors for suicidal ideation (SI) in PWUO, as well as their use of and barriers to accessing mental health services.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42533345","sources":[{"id":"source.frontier.pmid-42533345","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42533345%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42533345 names metabolic process: \"Root transcriptome profiling identified extensive differential expression associated with microbial perception, signaling, defense, and metabolic processes.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42652430","sources":[{"id":"source.frontier.pmid-42652430","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652430%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652430 names immune response: \"proliferation), correlating with enhanced plant immune responses.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42507643","sources":[{"id":"source.frontier.pmid-42507643","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42507643%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42507643 names Ground truth: \"Using ClinVar variant classifications as ground truth, AlphaMissense, EVE, and ESM1b were the highest scoring unsupervised in silico missense predictors for IDR variants.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42565205","sources":[{"id":"source.frontier.pmid-42565205","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42565205%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42565205 names Sample Size: \"Given the moderate sample size and lack of adjustment for key confounders, the findings should be considered exploratory and require confirmation in larger, well-controlled studies.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42497150","sources":[{"id":"source.frontier.pmid-42497150","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42497150%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42497150 names Cross-sectional study: \"In a cross-sectional study design, we collected data from YWLHIV attending antiretroviral therapy (ART) clinics in northern Uganda between November 2022 and April 2023.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42723771","sources":[{"id":"source.frontier.pmid-42723771","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42723771%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42723771 names Open science: \"The criteria were examined to assess their alignment with the four core commitments of the Agreement and the inclusion of Open Science principles.\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42493198","sources":[{"id":"source.frontier.pmid-42493198","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42493198%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42493198 names Control Groups: \"We used ordinal regression to compare the lifestyle index in the intervention and control groups at the 3-year follow-up, with adjustments for baseline levels of lifestyle index, age, sex and education.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42489485","sources":[{"id":"source.frontier.pmid-42489485","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489485%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42489485 names Proteomics: \"Together, these findings reveal that ruminococcal cellulosomes are far more prevalent and diverse than previously appreciated and demonstrate the power of structural proteomics to uncover deeply divergent functional systems in the gut microbiome.IMPORTANCEPlant cell wall polysaccharides are a major dietary carbon source, yet their degradation relies on rare, highly specialized microbial enzyme assemblies known as cellulosomes, which have long been considered uncommon in the human gut.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42485395","sources":[{"id":"source.frontier.pmid-42485395","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485395%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42485395 names Risk Factors: \"Risk factors were surveyed, and BLLs were tested with LeadCare II analyzers.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42485283","sources":[{"id":"source.frontier.pmid-42485283","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485283%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42485283 names Cross-sectional study: \"A cross-sectional study was conducted with 544 consecutively recruited these hypertensive patients from two tertiary hospitals in China between July 15 and November 15, 2024.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42484337","sources":[{"id":"source.frontier.pmid-42484337","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42484337%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42484337 names Microbiology: \"This work contributes to the field of applied microbiology by expanding the understanding of how environmentally adapted bacteria can serve as biological alternatives to chemical inputs in agroecosystems.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42553384","sources":[{"id":"source.frontier.pmid-42553384","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553384%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42553384 names Genomics: \"using an integrated framework combining structural modeling, comparative genomics, and transcriptomic datasets spanning multiple developmental stages.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42553105","sources":[{"id":"source.frontier.pmid-42553105","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553105%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42553105 names Control Groups: \"Age-matched control groups included ten young wild type (WT) mice (9 males and 1 female) and fourteen aged WT mice (7 males and 7 females).\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42480918","sources":[{"id":"source.frontier.pmid-42480918","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42480918%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42480918 names transcytosis: \"In study 2, expression of genes associated with SIgA synthesis and transcytosis was evaluated in salivary glands, reticulum, rumen, and small intestine of mature cows.\"","target":"concept.go.go0045056","type":"related"},{"source":"claim.frontier.pmid-42467705","sources":[{"id":"source.frontier.pmid-42467705","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42467705%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42467705 names Cross-sectional study: \"A community-based cross-sectional study was conducted among a weighted sample of 140,054 young women in SSA using recent demographic and health survey data.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42534899","sources":[{"id":"source.frontier.pmid-42534899","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42534899%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42534899 names metabolic process: \"Genome-inferred functional analyses revealed that the predominant metabolic processes included the biosynthesis of nucleic acids, amino acids, organic anions, and vitamins.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42462719","sources":[{"id":"source.frontier.pmid-42462719","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42462719%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42462719 names horizontal gene transfer: \"These transitions were likely marked by extensive horizontal gene transfer and gene loss, with mobile genetic elements such as plasmids and prophages playing key roles in genomic diversification.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42461951","sources":[{"id":"source.frontier.pmid-42461951","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42461951%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42461951 names cell death: \"Within the NRC (NLR Required for Cell Death) network in Asterids, sensor NLRs detect pathogen presence but require NRC helpers for signaling and to confer immunity.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42529330","sources":[{"id":"source.frontier.pmid-42529330","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42529330%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42529330 names Proteomics: \"Conjunctival swabs and tear samples were collected for 16S rRNA gene sequencing (V3-V4 region) and label-free quantitative proteomics, respectively.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42458577","sources":[{"id":"source.frontier.pmid-42458577","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42458577%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42458577 names Genomics: \"This study aimed to systematically investigate the evolutionary dynamics of TEs in sika deer genome and to elucidate their potential regulatory functions in the development of antler by integrating comparative and functional genomics approaches.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42455014","sources":[{"id":"source.frontier.pmid-42455014","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42455014%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42455014 names horizontal gene transfer: \"operon was distributed via horizontal gene transfer, likely providing cell adaptation to diverse environmental niches through regulation of processes beyond color acclimation.IMPORTANCEThe ability to accurately sense and integrate multiple environmental cues is fundamental to bacterial behavior and survival.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42454934","sources":[{"id":"source.frontier.pmid-42454934","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42454934%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42454934 names Microbiology: \"Quantifying the abundance and activity of bacteria within populations and communities is fundamental to systems microbiology and microbiome research.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42491728","sources":[{"id":"source.frontier.pmid-42491728","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42491728%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42491728 names Genomics: \"To elucidate the strain diversity of the targeted community, we isolated strains from ES CRC patient faecal samples and employed comparative genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42516974","sources":[{"id":"source.frontier.pmid-42516974","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42516974%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42516974 names Mycology: \"Although forensic mycology has primarily focused on microscale Ascomycota and successional patterns, this review emphasizes the underexplored potential of macroscopic Basidiomycota as biomarkers in decomposition ecology.\"","target":"ology.mycology","type":"related"},{"source":"claim.frontier.pmid-42441853","sources":[{"id":"source.frontier.pmid-42441853","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42441853%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42441853 names horizontal gene transfer: \"Novel genes arise through multiple mechanisms, including gene duplication, gene fusion, and horizontal gene transfer (HGT).\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42439519","sources":[{"id":"source.frontier.pmid-42439519","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42439519%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42439519 names Genomics: \"To enable functional genomics in this organism, we developed an inducible genome-engineering platform that leverages its endogenous Type II-A CRISPR-Cas9 system.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42429610","sources":[{"id":"source.frontier.pmid-42429610","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42429610%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42429610 names mucus layer: \"Although dietary and host-derived nutrient availability play a key role in shaping microbial ecology and interaction patterns, the dynamics of these interactions within the mucus layer remain poorly understood.\"","target":"concept.go.go0070701","type":"related"},{"source":"claim.frontier.pmid-42514673","sources":[{"id":"source.frontier.pmid-42514673","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42514673%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42514673 names signal transduction: \"Integrated transcriptome, metabolome, and microbiome analysis showed that the gut microbiota and host transcriptomic changes may participate in systemic metabolic regulation by modulating amino acid metabolism, lipid signal transduction, nucleotide metabolism, and vitamin B6-related metabolic pathways.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42515727","sources":[{"id":"source.frontier.pmid-42515727","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42515727%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42515727 names immune response: \"Growing evidence supports a relevant contributory role for the gut microbiota as both a mediator and a modulator of NSAID-induced toxicity, affecting epithelial barrier function, oxidative stress, immune responses, and bile acid metabolism.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42405792","sources":[{"id":"source.frontier.pmid-42405792","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42405792%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42405792 names Taxonomy: \"taxonomy, reveals the distribution and evolutionary history of flagellar and type III secretion systems (T3SS), and identifies two distinct Hrp2/Hrc2-class T3SS types within the genus.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42510569","sources":[{"id":"source.frontier.pmid-42510569","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42510569%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42510569 names Taxonomy: \"taxonomy and phylogeny, genomic and karyotypic evolution, reproductive and life history strategies, abiotic stress responses, ecosystem functions, and bioresource potential within a cross-scale framework.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.arxiv-2610-02106","sources":[{"id":"source.frontier.arxiv-2610-02106","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.02106&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.02106 names Differential equation: \"We give sufficient conditions ensuring that, at every fixed positive time, the scalar backward component of a Markovian forward-backward stochastic differential equation with multidimensional forward process admits a density with respect to Lebesgue measure.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2609-39519","sources":[{"id":"source.frontier.arxiv-2609-39519","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39519&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.39519 names Nonlinear Dynamics: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","target":"field.mesh.d017711","type":"related"},{"source":"claim.frontier.arxiv-2609-21904","sources":[{"id":"source.frontier.arxiv-2609-21904","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21904&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21904 names Differential equation: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2609-19386","sources":[{"id":"source.frontier.arxiv-2609-19386","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19386&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.19386 names Machine Learning Algorithms: \"Finally, we provide flexible and efficient statistical inference methods for the bounds on ATT, which can leverage modern machine learning algorithms for estimation.\"","target":"concept.mesh.d000098435","type":"related"},{"source":"claim.frontier.arxiv-2609-13345","sources":[{"id":"source.frontier.arxiv-2609-13345","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.13345&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.13345 names Machine Learning: \"Probabilistic forecasting is central to decision-making under uncertainty, yet its methodological landscape has become increasingly fragmented across temporal and spatiotemporal forecasting, statistical modeling, machine learning, and deep generative modeling.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2609-05100","sources":[{"id":"source.frontier.arxiv-2609-05100","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05100&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.05100 names Order ideal: \"We identify the lattice of buffering structures with the lattice of order ideals of the block poset of the combinatorial canonical form of the associated layered mixed matrix.\"","target":"concept.planetmath.orderideal","type":"related"},{"source":"claim.frontier.arxiv-2608-19170","sources":[{"id":"source.frontier.arxiv-2608-19170","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19170&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.19170 names Differential equation: \"This article introduces a numerical optimal control framework for minmax constrained density control for a class of noisy linear parabolic partial differential equations (PDEs), in particular the noisy heat equation.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2608-14134","sources":[{"id":"source.frontier.arxiv-2608-14134","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.14134&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.14134 names Quantum computing: \"The authors present a rigorous empirical evaluation of three distinct optimization paradigms for institutional factor portfolio construction: an entropy-based photonic quantum annealer (Dirac-3, Quantum Computing Inc.), a commercial mixed-integer programming solver (Gurobi), and a model-free deep reinforcement learning agent (SAC).\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2608-06711","sources":[{"id":"source.frontier.arxiv-2608-06711","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.06711&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.06711 names Quantum computing: \"This paper aims to contextualize the requirements for Quantum Computing (QC) algorithms to achieve a quantum advantage in solving the alternating current power flow (ACPF) problem, with a focus on runtime complexity.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2608-04208","sources":[{"id":"source.frontier.arxiv-2608-04208","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04208&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.04208 names Machine Learning: \"Methods: We applied causal forests, a non-parametric causal machine learning method, to 802,935 trip records from the 2017 and 2022 waves of the National Household Travel Survey.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-03832","sources":[{"id":"source.frontier.arxiv-2608-03832","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03832&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.03832 names Dimensionality Reduction: \"Dimensionality reduction and effect estimation are central tasks in the analysis of high-dimensional data such as in genomics.\"","target":"concept.mesh.d000098405","type":"related"},{"source":"claim.frontier.arxiv-2608-03192","sources":[{"id":"source.frontier.arxiv-2608-03192","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03192&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.03192 names Machine Learning: \"We gathered 100486 racing laps for the years 2021-2025 using the FastF1 API, built a compound-specific physics correction for Dirty Air to account for fuel and tyre wear, and evaluated the change introduced by the 2022 regulation using both OLS regression with clustered standard errors and Causal Forest Double/Debiased Machine Learning.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-02799","sources":[{"id":"source.frontier.arxiv-2608-02799","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02799&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02799 names Differential equation: \"Score-based diffusion models are typically formulated using continuous-time stochastic differential equations and measure-theoretic stochastic calculus.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2608-00708","sources":[{"id":"source.frontier.arxiv-2608-00708","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00708&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00708 names Canonical projection: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","target":"concept.planetmath.canonicalprojection","type":"related"},{"source":"claim.frontier.arxiv-2608-00649","sources":[{"id":"source.frontier.arxiv-2608-00649","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00649&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00649 names Machine Learning: \"Optimal transport potentials are fundamental objects in statistics, economics, and machine learning: their gradients generate optimal transport maps, while the potentials themselves act as location-dependent dual prices and sensitivity variables.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-00445","sources":[{"id":"source.frontier.arxiv-2608-00445","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00445&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00445 names Inner product: \"We show that the limiting scalings of the largest squared inner product undergo a discontinuous phase transition in the Watson model, whereas no analogous phenomenon occurs in the FvML model.\"","target":"concept.planetmath.innerproduct","type":"related"},{"source":"claim.frontier.arxiv-2607-29270","sources":[{"id":"source.frontier.arxiv-2607-29270","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29270&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29270 names Zero divisor: \"This representation gives a direct definition of the Moore--Penrose inverse and clarifies the treatment of nonzero zero divisors.\"","target":"concept.planetmath.zerodivisor","type":"related"},{"source":"claim.frontier.arxiv-2607-29131","sources":[{"id":"source.frontier.arxiv-2607-29131","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29131&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29131 names Cosmic microwave background: \"We further confront the model with recent H$α$ observations of dwarf galaxies, together with constraints from the cosmic microwave background, diffuse gamma rays, direct detection and collider searches.\"","target":"physical.cosmic-microwave-background","type":"related"},{"source":"claim.frontier.arxiv-2607-29123","sources":[{"id":"source.frontier.arxiv-2607-29123","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29123&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29123 names Quantum computing: \"Silicon-based donor flip-flop qubits offer a promising path toward scalable, fault-tolerant quantum computing by combining the long coherence times of nuclear spins with fast, fully electrical control and long-range dipole-dipole coupling between qubits.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-29073","sources":[{"id":"source.frontier.arxiv-2607-29073","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29073&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29073 names Quantum mechanics: \"Classically, using fewer than $n$ distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as $\\big\\lceil \\sqrt{n}\\big\\rceil$ levels per particle [\\href{https://doi.org/10.1103/yhyv-xnwq}{PRL {\\bf 135}, 260603 (2025)}].\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28919","sources":[{"id":"source.frontier.arxiv-2607-28919","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28919&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28919 names Magnetohydrodynamics: \"We present 32 general relativistic radiation magnetohydrodynamics simulations of super-Eddington magnetically arrested disks onto stellar-mass black holes, varying mass ($M_{\\rm BH}= 5, 15, 30\\,M_{\\odot}$), spin ($a=0,0.9$), and accretion rate ($\\dot{M}_{\\rm acc} \\approx 1-2000\\,\\dot{M}_{\\rm Edd}$).\"","target":"physical.magnetohydrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-28080","sources":[{"id":"source.frontier.arxiv-2607-28080","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28080&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28080 names Machine Learning: \"EOMR is compared to the most complete set of state-of-the-art tools from the Artificial Intelligence (AI) and Machine Learning (ML) that is available to the author, on the very challenging problems from chaotic and fluid dynamics: (i) on predicting the Lorenz-96 systems dynamics in strongly- and very-strongly chaotic regimes (with forcing parameter being $F=8$ and $F=12$, respectively); and, (ii) on a data from the Hasegawa-Wakatani model on the edge of the tokamak plasma.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-25783","sources":[{"id":"source.frontier.arxiv-2607-25783","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25783&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25783 names Quantum simulation: \"Molecular tweezer arrays offer great prospects for quantum simulation, sensing, and computing, and would benefit from methods that enhance loading efficiency.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-11988","sources":[{"id":"source.frontier.arxiv-2607-11988","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.11988&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.11988 names Newtonian mechanics: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","target":"physical.newtonian-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28893","sources":[{"id":"source.frontier.arxiv-2607-28893","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28893&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28893 names Euclidean space: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-28883","sources":[{"id":"source.frontier.arxiv-2607-28883","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28883&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28883 names Axion haloscope: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","target":"method.axion-haloscope","type":"related"},{"source":"claim.frontier.arxiv-2607-28746","sources":[{"id":"source.frontier.arxiv-2607-28746","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28746&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28746 names Quantum mechanics: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28739","sources":[{"id":"source.frontier.arxiv-2607-28739","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28739&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28739 names Dark energy: \"Methods: Volunteers visually inspected colour images of late-type galaxies from the Dark Energy Camera Legacy Survey, from a sample of 49,703 galaxies selected within $4 \\times R_{500}$ of clusters and groups, restricted to galaxies brighter than 19th magnitude in the g and r bands, and with a minimum half-light radius of 2 arcseconds, to aid classification.\"","target":"physical.dark-energy","type":"related"},{"source":"claim.frontier.arxiv-2607-28738","sources":[{"id":"source.frontier.arxiv-2607-28738","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28738&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28738 names General relativity: \"Traversable wormholes are among the most striking hypothetical solutions of general relativity, but every such geometry requires matter that violates the averaged null energy condition (ANEC).\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-28736","sources":[{"id":"source.frontier.arxiv-2607-28736","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28736&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28736 names White dwarfs: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","target":"physical.white-dwarfs","type":"related"},{"source":"claim.frontier.arxiv-2607-28717","sources":[{"id":"source.frontier.arxiv-2607-28717","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28717&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28717 names Astrophysics: \"Using Modules for Experiments in Stellar Astrophysics (MESA) models, we simulate an engulfed planet inspiraling into an AGB star, and allow the planet to accrete mass via Bondi-Hoyle-Lyttleton accretion.\"","target":"physical.astrophysics","type":"related"},{"source":"claim.frontier.arxiv-2607-28714","sources":[{"id":"source.frontier.arxiv-2607-28714","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28714&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28714 names Accretion disks: \"The obtained results highlight the crucial role of X-ray polarimetric data to unveil the geometry of the extended scattering environment surrounding the accretion disks, advancing our understanding of neutron star low-mass X-ray binaries.\"","target":"physical.accretion-disks","type":"related"},{"source":"claim.frontier.arxiv-2607-28690","sources":[{"id":"source.frontier.arxiv-2607-28690","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28690&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28690 names Thermodynamic entropy: \"The resulting Euler--Lagrange equation exhibits a structural correspondence with semiclassical generalized entropy functionals, while maintaining a purely geometric interpretation distinct from thermodynamic entropy in the sense of Perelman's $W$-functional.\"","target":"physical.thermodynamic-entropy","type":"related"},{"source":"claim.frontier.arxiv-2607-28604","sources":[{"id":"source.frontier.arxiv-2607-28604","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28604&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28604 names Fuzzy dark matter: \"In this work, we present a physics-informed generative U-Net framework for fuzzy dark matter (FDM) that addresses two complementary tasks: (i) the evolution of cosmological fields from initial conditions to an arbitrary cosmological scale factor and (ii) the super-resolution of FDM simulations at a specified cosmological scale factor.\"","target":"theory.fuzzy-dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-28597","sources":[{"id":"source.frontier.arxiv-2607-28597","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28597&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28597 names Positive element: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","target":"concept.planetmath.positiveelement","type":"related"},{"source":"claim.frontier.arxiv-2607-28533","sources":[{"id":"source.frontier.arxiv-2607-28533","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28533&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28533 names Ultracold atoms: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","target":"physical.ultracold-atoms","type":"related"},{"source":"claim.frontier.arxiv-2607-28524","sources":[{"id":"source.frontier.arxiv-2607-28524","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28524&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28524 names Quantum simulation: \"Quantum simulations of Dirac fermions with exact chiral symmetry are thus nearly free: applying the overlap Hamiltonian costs only a factor logarithmic in $ε_e$ more than the Wilson-Dirac Hamiltonian.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-28504","sources":[{"id":"source.frontier.arxiv-2607-28504","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28504&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28504 names Quantum computing: \"Fault-tolerant quantum computing requires system-level coordination of logical primitives.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-28491","sources":[{"id":"source.frontier.arxiv-2607-28491","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28491&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28491 names Density functional theory: \"Using density functional theory and Wannier functions, we study the symmetry-protected topology of bulk RG, drumhead surface state (DSS) of semi-infinite RG surface, and the IQG condition for thick RG slabs.\"","target":"physical.density-functional-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-28479","sources":[{"id":"source.frontier.arxiv-2607-28479","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28479&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28479 names Quantum computing: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-28471","sources":[{"id":"source.frontier.arxiv-2607-28471","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28471&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28471 names Renormalization group: \"We present a self-contained numerical study of the one-dimensional transverse-field Ising model (TFIM), tracing its ground-state entanglement structure from exact diagonalization at small system size (L=8,14,20) through density-matrix renormalization group (DMRG) calculations up to L=100.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-28441","sources":[{"id":"source.frontier.arxiv-2607-28441","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28441&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28441 names Density functional theory: \"To understand the origin of this behavior, density functional theory (DFT) calculations were performed.\"","target":"physical.density-functional-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-28438","sources":[{"id":"source.frontier.arxiv-2607-28438","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28438&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28438 names Binary neutron stars: \"We estimate the number of multi-messenger detections from binary neutron stars (BNS) with the Einstein Telescope (ET) and Cosmic Explorer (CE), and project the resulting constraints on the equation of state (EOS), BNS mass distribution, and cosmology via joint hierarchical Bayesian inference.\"","target":"physical.binary-neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-28345","sources":[{"id":"source.frontier.arxiv-2607-28345","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28345&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28345 names Algebraic geometry: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","target":"concept.planetmath.algebraicgeometry","type":"related"},{"source":"claim.frontier.arxiv-2607-28173","sources":[{"id":"source.frontier.arxiv-2607-28173","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28173&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28173 names Thermodynamics: \"Finally, we prove that the quenched pressure is convex in λ, so thermodynamics cannot select an interior mixture: λis therefore a learning hyperparameter.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-28168","sources":[{"id":"source.frontier.arxiv-2607-28168","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28168&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28168 names Invariant subspace: \"Mathematical proofs guarantee immunity to invariant subspaces and structural dilation, validated by extensive numerical evaluations across diverse topologies.\"","target":"concept.planetmath.invariantsubspace","type":"related"},{"source":"claim.frontier.arxiv-2607-28161","sources":[{"id":"source.frontier.arxiv-2607-28161","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28161&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28161 names Data Analysis: \"We introduce \\emph{Topological Causal Data Analysis} (TCDA), a framework separating the observation space, causal-model class, topological representation, and causal query.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-28140","sources":[{"id":"source.frontier.arxiv-2607-28140","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28140&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28140 names Large-scale structure: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-28095","sources":[{"id":"source.frontier.arxiv-2607-28095","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28095&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28095 names Dark matter: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-28021","sources":[{"id":"source.frontier.arxiv-2607-28021","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28021&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28021 names Data Analysis: \"By examining the relationship between the support function of convex geometry and the Euler Characteristic Transform (ECT) of topological data analysis, we develop new tools and suggest variations on some common ECT pipelines.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-27985","sources":[{"id":"source.frontier.arxiv-2607-27985","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27985&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27985 names Thermodynamics: \"Recent advances in quantum information and quantum thermodynamics have reshaped the understanding of energy storage at the microscopic scale, paving the way toward protocols for storing and transferring energy in quantum devices.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27957","sources":[{"id":"source.frontier.arxiv-2607-27957","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27957&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27957 names Quantum entanglement: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-27874","sources":[{"id":"source.frontier.arxiv-2607-27874","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27874&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27874 names Phase transitions: \"We investigate the hydrodynamics of expanding bubbles in first-order phase transitions with non-conformal thermodynamics.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-27860","sources":[{"id":"source.frontier.arxiv-2607-27860","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27860&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27860 names Active galactic nuclei: \"The Baldwin effect --- the inverse correlation between the equivalent width of emission lines and the continuum luminosity in active galactic nuclei (AGNs) --- has been known for nearly five decades, yet its physical origin remains poorly understood.\"","target":"physical.active-galactic-nuclei","type":"related"},{"source":"claim.frontier.arxiv-2607-27805","sources":[{"id":"source.frontier.arxiv-2607-27805","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27805&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27805 names Chaos theory: \"In this work, we apply the tools of nonlinear dynamics and chaos theory to LLMs.\"","target":"physical.chaos-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-27799","sources":[{"id":"source.frontier.arxiv-2607-27799","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27799&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27799 names Invariant subspace: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","target":"concept.planetmath.invariantsubspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27707","sources":[{"id":"source.frontier.arxiv-2607-27707","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27707&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27707 names Thermodynamics: \"We investigate the horizon structure, constrained thermodynamics, and geodesic properties of an effective Kerr-like black hole in a non-commutative background.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27646","sources":[{"id":"source.frontier.arxiv-2607-27646","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27646&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27646 names Isomorphism: \"Every such isometry extends uniquely to a complex-linear isometric order isomorphism, for which we obtain a coordinate representation.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-27629","sources":[{"id":"source.frontier.arxiv-2607-27629","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27629&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27629 names Incidence structure: \"We characterize when the incidence structure underlying Wolff's hairbrush argument persists.\"","target":"concept.planetmath.incidencestructure","type":"related"},{"source":"claim.frontier.arxiv-2607-27582","sources":[{"id":"source.frontier.arxiv-2607-27582","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27582&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27582 names Abelian group: \"This disproves a conjecture of Bergelson and McCutcheon (c. 2000), which predicted that for any countably infinite abelian groups $H$ and $G$, every polynomial map $p:H\\to G$ with $p(0_H)=0_G$ is good for nice recurrence.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-21030","sources":[{"id":"source.frontier.arxiv-2607-21030","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21030&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21030 names Quantum entanglement: \"This construction provides a concrete realization of how complex bulk geometry may emerge from timelike entanglement, extending the familiar idea that spacetime geometry is encoded in quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-19220","sources":[{"id":"source.frontier.arxiv-2607-19220","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19220&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19220 names Neutron stars: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","target":"physical.neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-12710","sources":[{"id":"source.frontier.arxiv-2607-12710","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12710&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.12710 names Quantum entanglement: \"Heating usually destroys quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-10561","sources":[{"id":"source.frontier.arxiv-2607-10561","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.10561&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.10561 names Quantum mechanics: \"We develop a microscopic quantum membrane paradigm from the matrix quantum mechanics of black holes [1].\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-03479","sources":[{"id":"source.frontier.arxiv-2607-03479","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.03479&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.03479 names Graph theory: \"The connections between graph theory, and more generally association schemes, and coding theory were established by Delsarte for the Hamming metric and rank-metric codes.\"","target":"concept.planetmath.graphtheory","type":"related"},{"source":"claim.frontier.arxiv-2607-27515","sources":[{"id":"source.frontier.arxiv-2607-27515","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27515&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27515 names Dark matter: \"We present an analytical study of minimal mass-varying dark matter models, in which a single scalar field controls the dark matter mass, focusing on their utility in simultaneously addressing multiple cosmological tensions.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27514","sources":[{"id":"source.frontier.arxiv-2607-27514","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27514&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27514 names Euclidean space: \"In this paper, we study the sample complexity of the empirical plug-in estimator for the $2$-Gromov-Wasserstein distance $D_2$ between compactly supported probability measures on Euclidean spaces.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27502","sources":[{"id":"source.frontier.arxiv-2607-27502","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27502&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27502 names Renormalization group: \"Plotting $dN/dT$ against the simultaneously measured occupation $N$ reveals an asymmetric lineshape with its peak shifted to $N>1/2$---a hallmark of Kondo screening---that weakens with increasing temperature and is qualitatively reproduced by numerical renormalization group (NRG) calculations, with a small but persistent offset to lower occupation relative to the theory.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-27403","sources":[{"id":"source.frontier.arxiv-2607-27403","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27403&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27403 names Data Analysis: \"Incomplete compositional data analysis faces a fundamental limitation: likelihood-based methods for compositional models generally require fully observed compositions, making it difficult to accommodate missing or censored proportions directly on the simplex.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-27391","sources":[{"id":"source.frontier.arxiv-2607-27391","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27391&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27391 names Stellar evolution: \"We investigate the impact of uncertainties in binary stellar evolution on the formation efficiency and cosmological merger rate of BNS systems.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-27388","sources":[{"id":"source.frontier.arxiv-2607-27388","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27388&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27388 names Thermodynamics: \"Together, these results establish a bits-per-area principle linking black-hole thermodynamics, information geometry, and quantum information in the HBAR framework.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27362","sources":[{"id":"source.frontier.arxiv-2607-27362","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27362&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27362 names Lorentz transformations: \"We illustrate this mechanism with a space-time-modulated wire medium, described through Lorentz transformations and quasi-static homogenization.\"","target":"physical.lorentz-transformations","type":"related"},{"source":"claim.frontier.arxiv-2607-27344","sources":[{"id":"source.frontier.arxiv-2607-27344","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27344&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27344 names Loop quantum gravity: \"We review the unimodular version of loop quantum cosmology and comment on possible connections to full (unimodular) loop quantum gravity.\"","target":"field.loop-quantum-gravity","type":"related"},{"source":"claim.frontier.arxiv-2607-27334","sources":[{"id":"source.frontier.arxiv-2607-27334","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27334&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27334 names Higgs boson: \"We present next-to-next-to-leading order (NNLO) QCD predictions for Higgs boson pair production in association with a weak gauge boson, $pp \\to Vhh$ with $V=W^\\pm,Z$, in effective field theory descriptions of new physics.\"","target":"physical.higgs-boson","type":"related"},{"source":"claim.frontier.arxiv-2607-27329","sources":[{"id":"source.frontier.arxiv-2607-27329","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27329&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27329 names Black holes: \"Quasars are luminous objects that provide insights into the physics and evolution of supermassive black holes (SMBHs) and their accretion flows, galaxy evolution, and even cosmology.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-27326","sources":[{"id":"source.frontier.arxiv-2607-27326","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27326&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27326 names Dark matter: \"Dwarf galaxies provide excellent targets to search for signals of dark matter annihilation or decay.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27312","sources":[{"id":"source.frontier.arxiv-2607-27312","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27312&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27312 names Dark matter: \"Dark matter that self interacts through long-range forces exhibits coherent, collective effects that are absent in short-range interactions.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27299","sources":[{"id":"source.frontier.arxiv-2607-27299","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27299&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27299 names Thermodynamics: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27181","sources":[{"id":"source.frontier.arxiv-2607-27181","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27181&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27181 names Quantum information science: \"Demonstrating a practical quantum advantage remains a central goal in quantum information science.\"","target":"physical.quantum-information-science","type":"related"},{"source":"claim.frontier.arxiv-2607-27158","sources":[{"id":"source.frontier.arxiv-2607-27158","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27158&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27158 names Black holes: \"The interactions of walls and monopoles leads to novel processes such as the absorption of monopoles on walls, production of monopoles when domain walls annihilate, collapse of walls with magnetic charge that can, with gravity taken into account, produce magnetically charged black holes, and production of a stochastic gravitational wave background from biased domain walls.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-27129","sources":[{"id":"source.frontier.arxiv-2607-27129","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27129&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27129 names General relativity: \"In general relativity, the motion of a test mass around a rotating black hole is described by Kerr geodesics.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-27105","sources":[{"id":"source.frontier.arxiv-2607-27105","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27105&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27105 names Machine Learning Algorithms: \"The algorithm maintains its high performance in this general setting, demonstrating its versatility, robustness across varying seizure morphologies, and potential to complement machine learning algorithms.\"","target":"concept.mesh.d000098435","type":"related"},{"source":"claim.frontier.arxiv-2607-27098","sources":[{"id":"source.frontier.arxiv-2607-27098","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27098&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27098 names Metric space: \"This paper investigates the relationship between coding theory and extremal combinatorics by representing codes in general metric spaces as independent sets in proximity graphs.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27062","sources":[{"id":"source.frontier.arxiv-2607-27062","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27062&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27062 names Machine Learning: \"Physics-informed machine learning incorporates physical principles --often expressed via differential operators-- into data-driven models.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-27038","sources":[{"id":"source.frontier.arxiv-2607-27038","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27038&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27038 names Differential operator: \"We prove that for every complex reflection group $G$ and every $n \\geq 2$ the ring of invariant differential operators $A_n(\\mathbb{K})^G$ has irreducible non-holonomic modules of Gelfand-Kirillov dimension $2n-1$, and we exhibit such modules explicitly.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-27037","sources":[{"id":"source.frontier.arxiv-2607-27037","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27037&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27037 names Linear algebra: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","target":"concept.planetmath.linearalgebra","type":"related"},{"source":"claim.frontier.arxiv-2607-26966","sources":[{"id":"source.frontier.arxiv-2607-26966","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26966&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26966 names Stellar evolution: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-26932","sources":[{"id":"source.frontier.arxiv-2607-26932","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26932&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26932 names Large-scale structure: \"Photometric surveys offer a powerful way to map the large-scale structure of the Universe, but their redshift errors complicate the identification of cosmic voids, challenging studies of their environmental effect on galaxy properties.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-26890","sources":[{"id":"source.frontier.arxiv-2607-26890","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26890&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26890 names Vector field: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-26800","sources":[{"id":"source.frontier.arxiv-2607-26800","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26800&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26800 names Neutron stars: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","target":"physical.neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-26782","sources":[{"id":"source.frontier.arxiv-2607-26782","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26782&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26782 names Differential equation: \"The approach developed in this paper should be useful for solving other nonlinear partial differential equations involving similar difficulties.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-26677","sources":[{"id":"source.frontier.arxiv-2607-26677","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26677&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26677 names Isomorphism: \"Given an isomorphism between the fundamental groups of two compact hyperbolic manifolds of dimension at least three, we consider the associated equivariant harmonic lift.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-26653","sources":[{"id":"source.frontier.arxiv-2607-26653","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26653&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26653 names Differential operator: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-26508","sources":[{"id":"source.frontier.arxiv-2607-26508","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26508&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26508 names Data Analysis: \"Quantifying the association between a real-valued variable and a categorical variable is a fundamental task in data analysis.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-26484","sources":[{"id":"source.frontier.arxiv-2607-26484","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26484&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26484 names Open set: \"A d-spectral space is a compact, d-sober bitopological space such that both open set lattices are coherent frames, where d-sobriety is the bitopological notion of sobriety due to Jung and Moshier.\"","target":"concept.planetmath.openset","type":"related"},{"source":"claim.frontier.arxiv-2607-26433","sources":[{"id":"source.frontier.arxiv-2607-26433","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26433&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26433 names Distribution function: \"In contrast to quantum Fokker--Planck equations with prescribed diffusion and friction coefficients, the macroscopic quantities are nonlinear functionals of the distribution function.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-26408","sources":[{"id":"source.frontier.arxiv-2607-26408","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26408&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26408 names Quantum field theory: \"We investigate the creation of electron-positron pairs by two spatiotemporally inhomogeneous electric fields with a relative phase, employing computational quantum field theory.\"","target":"physical.quantum-field-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-26378","sources":[{"id":"source.frontier.arxiv-2607-26378","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26378&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26378 names Absolute value: \"Every essential edge has strictly larger coefficient, in absolute value, than every non-essential edge in the harmonic representative, and the absolute values of the coefficients of all essential edges are equal.\"","target":"concept.planetmath.absolutevalue","type":"related"},{"source":"claim.frontier.arxiv-2607-26374","sources":[{"id":"source.frontier.arxiv-2607-26374","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26374&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26374 names General relativity: \"In this work we solve the coupled Einstein-Dirac-Maxwell (EDM) system for static spherically symmetric configurations of two fermions in a singlet spinor state within the $3+1$ formalism of general relativity.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-26289","sources":[{"id":"source.frontier.arxiv-2607-26289","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26289&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26289 names Statistical mechanics: \"Dipolar magnetic skyrmions can assemble into chains with alternating helicity that act as one-dimensional polymers, yet their statistical mechanics violates the universal harmonic scaling observed in actin, DNA, and microtubules.\"","target":"physical.statistical-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-26281","sources":[{"id":"source.frontier.arxiv-2607-26281","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26281&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26281 names Differential equation: \"We ask the question of which such representation takes up the least amount of memory, measured as number of real values needed to store the truncated log-signature, subject to the constraint of it being able to approximate solutions to linear controlled differential equations (CDEs) $\\mathrm{d} Y = AY \\mathrm{d} X$ with $|A| \\leq r$ at accuracy at least $\\varepsilon$.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-26205","sources":[{"id":"source.frontier.arxiv-2607-26205","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26205&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26205 names Accretion disks: \"Accretion disks around massive black holes (MBHs) in galactic nuclei can contain significant mass, in which case their non-spherical potentials exert significant torques on single and binary stars orbiting the MBHs.\"","target":"physical.accretion-disks","type":"related"},{"source":"claim.frontier.arxiv-2607-26193","sources":[{"id":"source.frontier.arxiv-2607-26193","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26193&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26193 names Cosmic expansion: \"Furthermore, this approach robustly constrains the cosmic expansion history throughout the post-reionization era of the Universe and, unlike conventional standard sirens, simultaneously probes the large scale distribution of matter perturbations, achieving relative uncertainties of approximately 1.3% on the total matter density $Ω_\\mathrm{m}$ and 1.6% on the late-time clustering amplitude $σ_8$.\"","target":"physical.cosmic-expansion","type":"related"},{"source":"claim.frontier.arxiv-2607-26180","sources":[{"id":"source.frontier.arxiv-2607-26180","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26180&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26180 names Baryon acoustic oscillations: \"These oscillations could in principle bias distance measurements derived from Baryon Acoustic Oscillations (BAO), a key science driver of post-reionization 21 cm intensity mapping.\"","target":"physical.bao","type":"related"},{"source":"claim.frontier.arxiv-2607-26177","sources":[{"id":"source.frontier.arxiv-2607-26177","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26177&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26177 names Black holes: \"The active black holes uncovered by JWST in the early Universe are highly abundant and seemingly overmassive with respect to local scaling relations, challenging standard models of black hole formation and growth.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-26151","sources":[{"id":"source.frontier.arxiv-2607-26151","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26151&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26151 names Phase transitions: \"We study quantum phase transitions of Mott insulators between spin-glass and featureless paramagnetic phases.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-26147","sources":[{"id":"source.frontier.arxiv-2607-26147","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26147&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26147 names Stellar evolution: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-26141","sources":[{"id":"source.frontier.arxiv-2607-26141","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26141&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26141 names Electromagnetism: \"We study electromagnetic wave propagation in metric--affine geometries, where torsion and non-metricity may be present and the coupling between electromagnetism and spacetime is no longer unique.\"","target":"field.electromagnetism","type":"related"},{"source":"claim.frontier.arxiv-2607-26103","sources":[{"id":"source.frontier.arxiv-2607-26103","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26103&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26103 names General relativity: \"A static configuration consisting of a rigid spherical shell enclosing a degenerate Schwarzschild Klinkhamer wormhole is investigated in general relativity.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-26030","sources":[{"id":"source.frontier.arxiv-2607-26030","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26030&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26030 names Phase transitions: \"The interplay between ionic and electronic subsystems dictates the behavior of structural phase transitions in polar dielectrics, a coupling mediated by soft optical phonon modes.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25977","sources":[{"id":"source.frontier.arxiv-2607-25977","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25977&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25977 names Kripke semantics: \"We connect modal set theory with Boolean-valued models by developing an \\emph{internal} Kripke semantics for modal formulas whose atomic propositions are set-theoretic sentences.\"","target":"concept.planetmath.kripkesemantics","type":"related"},{"source":"claim.frontier.arxiv-2607-25960","sources":[{"id":"source.frontier.arxiv-2607-25960","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25960&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25960 names Isomorphism: \"The proofs rely on a systematic application of the integral Hamiltonian Floer theory package developed by the first and fourth author, a Künneth isomorphism in equivariant Floer homology, and new quantitative analysis of quantum power maps, which is of independent interest.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-25950","sources":[{"id":"source.frontier.arxiv-2607-25950","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25950&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25950 names Differential equation: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-25910","sources":[{"id":"source.frontier.arxiv-2607-25910","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25910&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25910 names Composite number: \"A nonnegative integer $n$ is $d$-translated unit sensitive when appending $d$ zeros to the right of the number and changing the unit digit to any possible unit digit (so long as the resulting number is not $n$) results in a composite number.\"","target":"concept.planetmath.compositenumber","type":"related"},{"source":"claim.frontier.arxiv-2607-25865","sources":[{"id":"source.frontier.arxiv-2607-25865","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25865&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25865 names Quantum computing: \"Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-25772","sources":[{"id":"source.frontier.arxiv-2607-25772","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25772&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25772 names Homology: \"On a side note, using Legendrian surgery and the ruling invariant, we show that the total symplectic homology of Stein fillings of $(\\mathbb{T}^3, ξ_1)$ is non-zero.\"","target":"concept.planetmath.homology","type":"related"},{"source":"claim.frontier.arxiv-2607-25743","sources":[{"id":"source.frontier.arxiv-2607-25743","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25743&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25743 names Thermodynamics: \"Using non-equilibrium thermodynamics, we develop a theoretical framework that identifies the physicochemical conditions controlling whether vacuoles form and how big vacuoles can become.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25706","sources":[{"id":"source.frontier.arxiv-2607-25706","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25706&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25706 names Monoidal category: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","target":"concept.planetmath.monoidalcategory","type":"related"},{"source":"claim.frontier.arxiv-2607-25678","sources":[{"id":"source.frontier.arxiv-2607-25678","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25678&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25678 names Thermodynamics: \"Controlling heat flow in small quantum systems is a central goal of quantum thermodynamics and nanoscale transport.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25644","sources":[{"id":"source.frontier.arxiv-2607-25644","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25644&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25644 names Vector field: \"As applications, we prove uniqueness of the tangent space at infinity for Kähler-Ricci shrinkers with bounded scalar curvature and Euclidean volume growth whose soliton vector field generates an $S^1$-action, and for all four-dimensional Ricci shrinkers with bounded scalar curvature.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25625","sources":[{"id":"source.frontier.arxiv-2607-25625","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25625&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25625 names Renormalization group: \"Infinite-system density-matrix renormalization group simulations built on these masses reproduce the master formula.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-25621","sources":[{"id":"source.frontier.arxiv-2607-25621","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25621&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25621 names Vector field: \"We extend the celebrated result of Alberti, stating that Borel vector fields coincide with gradients of $C^1$-functions outside of a set of arbitrary small measure.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25610","sources":[{"id":"source.frontier.arxiv-2607-25610","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25610&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25610 names Vector field: \"We consider the classical analytic linearization problem for vector fields on the torus $\\mathbb{T}^d$ close to a constant vector field $ω$.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25559","sources":[{"id":"source.frontier.arxiv-2607-25559","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25559&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25559 names Phase transitions: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25473","sources":[{"id":"source.frontier.arxiv-2607-25473","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25473&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25473 names Partition function: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","target":"physical.partition-function","type":"related"},{"source":"claim.frontier.arxiv-2607-25460","sources":[{"id":"source.frontier.arxiv-2607-25460","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25460&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25460 names Transfinite recursion: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","target":"theory.planetmath.transfiniterecursion","type":"related"},{"source":"claim.frontier.arxiv-2607-25394","sources":[{"id":"source.frontier.arxiv-2607-25394","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25394&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25394 names Phase transitions: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25341","sources":[{"id":"source.frontier.arxiv-2607-25341","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25341&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25341 names Quantum electrodynamics: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","target":"physical.quantum-electrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25252","sources":[{"id":"source.frontier.arxiv-2607-25252","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25252&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25252 names Differentiable function: \"The objective mapping of the problem involves finitely many functions, with each one being the sum of a continuously differentiable function and a convex function that is proper and closed.\"","target":"concept.planetmath.differentiablefunction","type":"related"},{"source":"claim.frontier.arxiv-2607-25226","sources":[{"id":"source.frontier.arxiv-2607-25226","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25226&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25226 names Quantum electrodynamics: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","target":"physical.quantum-electrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-21883","sources":[{"id":"source.frontier.arxiv-2607-21883","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21883&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21883 names Differential equation: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-18525","sources":[{"id":"source.frontier.arxiv-2607-18525","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18525&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18525 names Metric space: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-13775","sources":[{"id":"source.frontier.arxiv-2607-13775","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13775&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.13775 names Wave equation: \"The Dirac current provides the fundamental energy identity, while quantitative spacetime estimates are obtained from the wave equation arising from the squared Dirac operator.\"","target":"concept.planetmath.waveequation","type":"related"},{"source":"claim.frontier.arxiv-2607-05687","sources":[{"id":"source.frontier.arxiv-2607-05687","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05687&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.05687 names Vector field: \"Exploiting the underlying geometric structure, we reformulate the problem as an infinite-dimensional control-affine system in Fourier variables and analyze the Lie algebra generated by the controlled vector fields.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-05485","sources":[{"id":"source.frontier.arxiv-2607-05485","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05485&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.05485 names Quantum field theory: \"In this paper we will examine if nonlocal quantum field theory will suffer from the fermion doubling pathology.\"","target":"physical.quantum-field-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-24988","sources":[{"id":"source.frontier.arxiv-2607-24988","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24988&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24988 names Quantum mechanics: \"Observables in quantum mechanics are generally complementary, that is, they reveal mutually incompatible pieces of information about a given system.\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-24938","sources":[{"id":"source.frontier.arxiv-2607-24938","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24938&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24938 names Black holes: \"These findings highlight that environmental effects can seriously impact tidal signatures, while still permitting, under suitable conditions, the distinguishability of horizonless compact objects from black holes in gravitational-wave observations.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-24933","sources":[{"id":"source.frontier.arxiv-2607-24933","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24933&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24933 names Sub-GeV dark matter: \"Using numerical calculations of the 1D structure factor, we also obtain quantitative validation of using an incoherent approximation to compute sub-GeV dark matter scattering in realistic 3D crystals.\"","target":"concept.sub-gev-dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24918","sources":[{"id":"source.frontier.arxiv-2607-24918","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24918&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24918 names Neutrino oscillation: \"Incorporating the long-range potential into supernova neutrino oscillations, we simulate the corresponding signal in the Deep Underground Neutrino Experiment (DUNE) using a realistic detector response of its 40 kt Liquid Argon Time Projection Chamber.\"","target":"physical.neutrino-oscillation","type":"related"},{"source":"claim.frontier.arxiv-2607-24705","sources":[{"id":"source.frontier.arxiv-2607-24705","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24705&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24705 names Distribution function: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-24682","sources":[{"id":"source.frontier.arxiv-2607-24682","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24682&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24682 names Quantum entanglement: \"Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-24654","sources":[{"id":"source.frontier.arxiv-2607-24654","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24654&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24654 names General relativity: \"In addition, we derive an explicit analytical expression in commutative General Relativity for the residual radial velocity generated by the Weber--Wheeler pulse at large radial distances in the perturbative regime.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-24641","sources":[{"id":"source.frontier.arxiv-2607-24641","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24641&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24641 names Machine Learning: \"This work furthers the recent interest in adapting machine learning methods to the study of multivariate extremes.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-24605","sources":[{"id":"source.frontier.arxiv-2607-24605","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24605&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24605 names Cosmic microwave background: \"Cosmic microwave background (CMB) experiments use simulations of instrumental systematic effects to ensure high-fidelity measurements of cosmological parameters.\"","target":"physical.cosmic-microwave-background","type":"related"},{"source":"claim.frontier.arxiv-2607-24584","sources":[{"id":"source.frontier.arxiv-2607-24584","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24584&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24584 names Dark matter: \"In this work we present the first constraint on invisible solar-neutrino decay using coherent elastic neutrino-nucleus scattering, recently observed in dark matter direct detection experiments.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24544","sources":[{"id":"source.frontier.arxiv-2607-24544","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24544&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24544 names Large-scale structure: \"The Halpha and IR morphologies generally trace the same large-scale structures, although most of the IR arcs lie slightly closer to the star and appear broader than their optical counterparts.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-24524","sources":[{"id":"source.frontier.arxiv-2607-24524","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24524&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24524 names Dark matter: \"Light dark matter (DM) is a compelling scenario for the observed relic abundance, with accelerator-based searches as a powerful discovery strategy.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24489","sources":[{"id":"source.frontier.arxiv-2607-24489","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24489&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24489 names Absolute value: \"The key technique is to locate the zeros of the integrands explicitly, which allows removal of the absolute value and reduces the problem to evaluating limits of telescoping trigonometric sums via asymptotic analysis.\"","target":"concept.planetmath.absolutevalue","type":"related"},{"source":"claim.frontier.arxiv-2607-24446","sources":[{"id":"source.frontier.arxiv-2607-24446","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24446&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24446 names Dark matter: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24433","sources":[{"id":"source.frontier.arxiv-2607-24433","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24433&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24433 names Propositional logic: \"The simply typed λ-calculus is a model of computation where typed terms correspond to proofs of intuitionistic propositional logic (IPL) via the Curry-Howard correspondence.\"","target":"concept.planetmath.propositionallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-24254","sources":[{"id":"source.frontier.arxiv-2607-24254","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24254&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24254 names Black holes: \"Finally, we introduce a compact, 3-parameter thermodynamic state-space diagnostic that tracks the continuous evolution of regular black holes from classical thermal evaporation to cold remnant lock, offering a quantitative framework for quantum-gravity phenomenology.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-24252","sources":[{"id":"source.frontier.arxiv-2607-24252","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24252&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24252 names Renormalization group: \"In the present work, we perform a field-theoretic renormalization group (RG) analysis of the dynamics of two non-reciprocally coupled $n$-vector order parameters possessing a $U(n)$ symmetry, generalizing previous results to order parameters with multiple components, a feature that has been shown to generate novel non-equilibrium critical behavior in certain non-reciprocal systems.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-24244","sources":[{"id":"source.frontier.arxiv-2607-24244","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24244&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24244 names Quantum computing: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-24240","sources":[{"id":"source.frontier.arxiv-2607-24240","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24240&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24240 names Atomic clocks: \"Ultimately, such compact, stable, and frequency-tunable visible light sources are key for integrated optical atomic clocks and underwater lidar application.\"","target":"physical.atomic-clocks","type":"related"},{"source":"claim.frontier.arxiv-2607-24239","sources":[{"id":"source.frontier.arxiv-2607-24239","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24239&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24239 names Quantum simulation: \"Cold polar molecules offer fascinating prospects for ultracold chemistry and quantum physics, including new platforms for quantum simulation or computation.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-24212","sources":[{"id":"source.frontier.arxiv-2607-24212","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24212&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24212 names Isomorphism: \"We exploit this connection to establish an isomorphism that underpins probabilistic tape diagrams, a graphical formalism for bimonoidal (also known as rig) categories, and we demonstrate its effectiveness by providing a complete axiomatisation of probabilistic Boolean circuits.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-24144","sources":[{"id":"source.frontier.arxiv-2607-24144","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24144&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24144 names Dark matter: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24123","sources":[{"id":"source.frontier.arxiv-2607-24123","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24123&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24123 names Real number: \"We determine the optimal constants in inequalities comparing the differences of the quadratic, arithmetic, and harmonic means of $n$ nonnegative real numbers.\"","target":"concept.planetmath.realnumber","type":"related"},{"source":"claim.frontier.arxiv-2607-24091","sources":[{"id":"source.frontier.arxiv-2607-24091","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24091&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24091 names Gravitational lensing: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","target":"physical.gravitational-lensing","type":"related"},{"source":"claim.frontier.arxiv-2607-24078","sources":[{"id":"source.frontier.arxiv-2607-24078","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24078&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24078 names Thermodynamics: \"The theoretical foundation of combining external nonequilibrium thermodynamics, the nonequilibrium statistical operator method, and stochastic first passage time thermodynamics are explored.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-23978","sources":[{"id":"source.frontier.arxiv-2607-23978","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23978&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23978 names Quantum sensing: \"Our results provide an experimental route to non-Hermitian observable readout and clarify its operational meaning in quantum sensing.\"","target":"physical.quantum-sensing","type":"related"},{"source":"claim.frontier.arxiv-2607-23956","sources":[{"id":"source.frontier.arxiv-2607-23956","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23956&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23956 names Phase transitions: \"The dynamics are analyzed within the biorthogonal framework using the concept of dynamical quantum phase transitions (DQPTs).\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-12128","sources":[{"id":"source.frontier.arxiv-2607-12128","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12128&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.12128 names Quantum computing: \"This paper investigates foundational quantum computing protocols from the intuitive perspective of categorical tensor-graph semantics within the category \\textbf{FHilb}.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-26084","sources":[{"id":"source.frontier.arxiv-2607-26084","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26084&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26084 names Big Bang nucleosynthesis: \"We consider three combinations of datasets: (i) late-time (LT) observations including PantheonPlus Type Ia supernovae, $H(z)$ measurements, and growth-rate measurements $fσ_8$; (ii) LT combined with DESI DR2 BAO and Big Bang nucleosynthesis (BBN); and (iii) LT combined with DESI DR2 BAO and CMB distance priors.\"","target":"physical.big-bang-nucleosynthesis","type":"related"},{"source":"claim.frontier.arxiv-2607-23859","sources":[{"id":"source.frontier.arxiv-2607-23859","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23859&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23859 names Isomorphism: \"We give a direct differential-geometric proof of a result of Crainic on the cohomology of pullbacks of Lie algebroids under surjective submersions: If the fibers are connected and have vanishing cohomology through degree $n$, pullback with coefficients in any representation is an isomorphism through degree $n$ and is injective in degree $n+1$.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-23814","sources":[{"id":"source.frontier.arxiv-2607-23814","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23814&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23814 names Differential equation: \"Tensor-train (TT) representations have emerged as an effective framework for mitigating the curse of dimensionality in the numerical solution of high-dimensional tensor differential equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-23798","sources":[{"id":"source.frontier.arxiv-2607-23798","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23798&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23798 names Modal logic: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-23596","sources":[{"id":"source.frontier.arxiv-2607-23596","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23596&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23596 names Euclidean space: \"As networks consist of vertices and edges that do not naturally reside in Euclidean space, the direct application of conventional statistical methodologies, such as the computation of means and covariances, principal component analysis, and hypothesis testing, to samples of networks is not straightforward.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-23430","sources":[{"id":"source.frontier.arxiv-2607-23430","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23430&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23430 names Axiom of choice: \"Along the way we obtain results particular to this algebraic setting: an embedding lacking an evident adjoint in de Paiva's general construction acquires a definable one here; a single Dialectica tensor validates contraction in the intuitionistic construction D yet refutes it in the classical variant G; and, over ZF, the poset reflection PD(Set) collapses onto the four-element algebra PD(2) exactly when the Axiom of Choice holds.\"","target":"concept.planetmath.axiomofchoice","type":"related"},{"source":"claim.frontier.arxiv-2607-23428","sources":[{"id":"source.frontier.arxiv-2607-23428","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23428&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23428 names Vector field: \"Let $h$ be the second fundamental form, let $\\mathbf{H}$ be the mean curvature vector field, and set $\\tilde h=h-\\mathbf{H}g$ and $\\tilde S=|\\tilde h|^2=|h|^2-2H^2$, where $H=|\\mathbf{H}|$ and $g$ is the induced Riemannian metric on the surface $M$.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-23236","sources":[{"id":"source.frontier.arxiv-2607-23236","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23236&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23236 names Federated Learning: \"Federated learning has achieved considerable success for predictive modelling, yet federated descriptive analytics remains largely unexplored.\"","target":"concept.mesh.d000098407","type":"related"},{"source":"claim.frontier.arxiv-2607-23212","sources":[{"id":"source.frontier.arxiv-2607-23212","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23212&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23212 names Bilinear form: \"The analysis is based on a cross-space Lipschitz condition for the nonlinear operator, which accommodates the nonsmooth, gradient-dependent nonlinearities of these flame-propagation models, and on continuity moduli quantifying the parameter dependence of the bilinear form and of the nonlinearity.\"","target":"concept.planetmath.bilinearform","type":"related"},{"source":"claim.frontier.arxiv-2607-23192","sources":[{"id":"source.frontier.arxiv-2607-23192","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23192&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23192 names Differential equation: \"The proposed framework provides a natural generalization of Vector Diffusion Maps to differential forms of arbitrary degree and establishes a practical foundation for the numerical approximation of geometric partial differential equations directly from point cloud data.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22985","sources":[{"id":"source.frontier.arxiv-2607-22985","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22985&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22985 names Large Language Models: \"Conformalized selection has been widely applied to select high-quality candidates from large datasets with rigorous uncertainty quantification, such as reliable labeling, drug discovery, and the alignment of large language models.\"","target":"concept.mesh.d000098342","type":"related"},{"source":"claim.frontier.arxiv-2607-22958","sources":[{"id":"source.frontier.arxiv-2607-22958","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22958&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22958 names Linear functional: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","target":"concept.planetmath.linearfunctional","type":"related"},{"source":"claim.frontier.arxiv-2607-22920","sources":[{"id":"source.frontier.arxiv-2607-22920","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22920&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22920 names Limit point: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","target":"concept.planetmath.limitpoint","type":"related"},{"source":"claim.frontier.arxiv-2607-22892","sources":[{"id":"source.frontier.arxiv-2607-22892","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22892&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22892 names Convex function: \"Given a strongly convex function $u$, equip $R^d$ with a Riemannian metric given by the Hessian $\\nabla^2 u$.\"","target":"concept.planetmath.convexfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-22443","sources":[{"id":"source.frontier.arxiv-2607-22443","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22443&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22443 names Data Analysis: \"Data analysis agents are becoming increasingly common tools for applied and scientific research.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-22333","sources":[{"id":"source.frontier.arxiv-2607-22333","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22333&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22333 names Differential equation: \"Our main results are model-independent in the sense that no determinantal or Pfaffian structure, prescribed interaction potential, or explicit labelled stochastic differential equation is required.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22284","sources":[{"id":"source.frontier.arxiv-2607-22284","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22284&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22284 names Isomorphism: \"This paper is the first in a series devoted to the classification of automorphisms and isomorphisms of twisted Chevalley groups over commutative rings.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-22196","sources":[{"id":"source.frontier.arxiv-2607-22196","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22196&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22196 names Axiom of choice: \"We study finiteness classes arising from Ramsey-theoretic principles in set theory without the Axiom of Choice.\"","target":"concept.planetmath.axiomofchoice","type":"related"},{"source":"claim.frontier.arxiv-2607-22156","sources":[{"id":"source.frontier.arxiv-2607-22156","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22156&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22156 names Abelian group: \"Let $Λ$ be a finitely generated abelian group and $Γ=\\mathbb Z^{*d}$, we study the Cayley graph of the wreath product $G=Λ\\wrΓ$ with natural set of generators and their inverse $S$.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-22018","sources":[{"id":"source.frontier.arxiv-2607-22018","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22018&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22018 names Homeomorphism: \"As a consequence, we generate a new topology, termed rough topology, as well as rough homeomorphism.\"","target":"concept.planetmath.homeomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-21892","sources":[{"id":"source.frontier.arxiv-2607-21892","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21892&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21892 names Abelian group: \"The notion of the factorial extends to abelian groups under the group operation and any permutation of the elements of the group.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-16724","sources":[{"id":"source.frontier.arxiv-2607-16724","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16724&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.16724 names Multiplication operator: \"Fourier transfer gives exact Sobolev, Schatten-class, compactness, and trace-class thresholds for sandwiched Wick multiplication operators on $\\mathbb{T}^{D}$, together with sharp Fourier--Galerkin rates and approximation-number decay.\"","target":"concept.planetmath.multiplicationoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-06237","sources":[{"id":"source.frontier.arxiv-2607-06237","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.06237&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.06237 names Differential equation: \"Inverse problems governed by partial differential equations are difficult when observations are sparse and the unknown coefficient field contains both large- and small-scale structures.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22751","sources":[{"id":"source.frontier.arxiv-2607-22751","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22751&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22751 names Differential operator: \"We study a family of symmetric orthogonal polynomials on the unit triangle associated with the weight \\[ w_{α,γ,κ}(x,y) = (xy)^α(1-x-y)^γ|x-y|^{2κ+1}, \\quad α,γ,κ>-1,\\quad α+κ>-\\frac32. \\] We construct the corresponding monic symmetric orthogonal basis on the simplex chamber and prove that its elements are eigenfunctions of a formally self-adjoint second-order differential operator \\(\\mathcal D_1^{α,γ,κ}\\).\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-21474","sources":[{"id":"source.frontier.arxiv-2607-21474","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21474&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21474 names Metric space: \"Fat minors are the metric analog of graph minors that are tailored to the analysis of metric (edge-weighted) graphs and, more generally, metric spaces having a suitable notion of shortest paths.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-21320","sources":[{"id":"source.frontier.arxiv-2607-21320","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21320&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21320 names Conditional logic: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","target":"concept.wikipedia.conditional-logic","type":"related"},{"source":"claim.frontier.arxiv-2607-21191","sources":[{"id":"source.frontier.arxiv-2607-21191","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21191&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21191 names Set theory: \"Event-B is a formal method rooted in predicate logic and set theory.\"","target":"concept.planetmath.settheory","type":"related"},{"source":"claim.frontier.arxiv-2607-21167","sources":[{"id":"source.frontier.arxiv-2607-21167","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21167&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21167 names Operator norm: \"Applying this result, we will show that the Frechet differentiability and the Gateaux differentiability of the norm of bounded linear operators on $\\ell_p$ spaces coincide, extending a known theorem regarding the operator norm on Hilbert spaces.\"","target":"concept.planetmath.operatornorm","type":"related"},{"source":"claim.frontier.arxiv-2607-21112","sources":[{"id":"source.frontier.arxiv-2607-21112","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21112&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21112 names Differential equation: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-20049","sources":[{"id":"source.frontier.arxiv-2607-20049","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20049&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20049 names Jacobian matrix: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","target":"concept.planetmath.jacobianmatrix","type":"related"},{"source":"claim.frontier.arxiv-2607-20677","sources":[{"id":"source.frontier.arxiv-2607-20677","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20677&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20677 names Metric space: \"We develop tools for the analysis and implementation of explicit first-order methods for minimizing functions in uniformly convex metric spaces.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-20407","sources":[{"id":"source.frontier.arxiv-2607-20407","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20407&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20407 names Abelian group: \"Consequently, for every uncountable discrete abelian group $G$, the nuclear algebra $C^*(G)$ has the local lifting property (LLP) but fails the LP.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-20164","sources":[{"id":"source.frontier.arxiv-2607-20164","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20164&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20164 names Limit point: \"We also identify the full set of subsequential limit points at the LIL scale.\"","target":"concept.planetmath.limitpoint","type":"related"},{"source":"claim.frontier.arxiv-2607-20161","sources":[{"id":"source.frontier.arxiv-2607-20161","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20161&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20161 names Vector bundle: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","target":"concept.planetmath.vectorbundle","type":"related"},{"source":"claim.frontier.arxiv-2607-20098","sources":[{"id":"source.frontier.arxiv-2607-20098","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20098&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20098 names Distribution function: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-20063","sources":[{"id":"source.frontier.arxiv-2607-20063","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20063&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20063 names Metric space: \"We then study monotone sequences with a uniform upper bound on the spatial diameter, obtaining uniform convergence of the null distances, as well as convergence of the associated timed metric spaces in the future developed Gromov-Hausdorff sense.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-19946","sources":[{"id":"source.frontier.arxiv-2607-19946","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19946&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19946 names Euclidean space: \"In this note we construct colorings of Euclidean space $\\mathbb{R}^n$ with finitely many colors such that any two points at unit distance have different colors and, in addition, each color class is dense in $\\mathbb{R}^n$.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-19654","sources":[{"id":"source.frontier.arxiv-2607-19654","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19654&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19654 names Homology: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","target":"concept.planetmath.homology","type":"related"},{"source":"claim.frontier.arxiv-2607-13855","sources":[{"id":"source.frontier.arxiv-2607-13855","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13855&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.13855 names Propositional logic: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","target":"concept.planetmath.propositionallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-19285","sources":[{"id":"source.frontier.arxiv-2607-19285","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19285&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19285 names Vector field: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-19272","sources":[{"id":"source.frontier.arxiv-2607-19272","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19272&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19272 names Differential operator: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-19233","sources":[{"id":"source.frontier.arxiv-2607-19233","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19233&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19233 names Vector field: \"The proof hinges on the study of vorticities defined in terms of a time-dependent foliation by almost parallel surfaces and of divergence-free vector fields tangent to these surfaces.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-19188","sources":[{"id":"source.frontier.arxiv-2607-19188","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19188&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19188 names Differential operator: \"In order to handle the mixed deterministic-stochastic structure of the equation and the degeneracy of the differential operator, we propose a semi-implicit Milstein finite difference scheme for the numerical solution.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-19080","sources":[{"id":"source.frontier.arxiv-2607-19080","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19080&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19080 names Distribution function: \"For fixed $z\\in\\operatorname{int}(Ω_μ)$, it remains bounded when $\\mathbf{F}_P(x_0)$ stays away from $z$, where $\\mathbf{F}_P=\\mathbf{Q}_P^{-1}$ is the transport-based distribution function, but diverges as $x_0\\to\\mathbf{Q}_P(z)$, equivalently as $\\mathbf{F}_P(x_0)\\to z$.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-18942","sources":[{"id":"source.frontier.arxiv-2607-18942","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18942&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18942 names Linearly ordered: \"A tree is called bounded when each of its paths (i.e. maximal linearly ordered subsets) contains a greatest element.\"","target":"concept.planetmath.linearlyordered","type":"related"},{"source":"claim.frontier.arxiv-2607-18781","sources":[{"id":"source.frontier.arxiv-2607-18781","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18781&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18781 names Directional derivative: \"This paper presents a comprehensive analysis of directional derivatives and error bounds for the merit function $θ(x)=\\sup_{a\\in A}\\bigl(-Δ_C(F(x)-F(a))\\bigr)$ associated with the vector optimization problem $\\operatorname{Min}_C\\{F(x):x\\in A\\}$, where $Δ_C$ is the oriented distance function.\"","target":"concept.planetmath.directionalderivative","type":"related"},{"source":"claim.frontier.arxiv-2607-15029","sources":[{"id":"source.frontier.arxiv-2607-15029","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15029&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15029 names Modal logic: \"Model checking is the automated verification of properties (specified in some modal logic) in labeled transition systems (LTSs); it is an essential tool in ensuring software systems function as intended.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-16747","sources":[{"id":"source.frontier.arxiv-2607-16747","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16747&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.16747 names Set theory: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","target":"concept.planetmath.settheory","type":"related"},{"source":"claim.frontier.arxiv-2607-15958","sources":[{"id":"source.frontier.arxiv-2607-15958","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15958&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15958 names Model theory: \"We extend the proof-theoretic treatment of uniform bound extraction from normed structures axiomatized in positive bounded logic [Advances in Mathematics, 290:503-551, 2016] (as developed for the model theory of Banach spaces) to the more general setting of abstract metric structures, including discrete structures viewed as classical first-order models.\"","target":"concept.planetmath.modeltheory","type":"related"},{"source":"claim.frontier.arxiv-2607-15664","sources":[{"id":"source.frontier.arxiv-2607-15664","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15664&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15664 names Logical connective: \"This extension of the notion of interpreting logical connectives in a matrix allows for the correct determination of the truth of formulas in the language with conjunction and implication.\"","target":"concept.planetmath.logicalconnective","type":"related"},{"source":"claim.frontier.arxiv-2604-22459","sources":[{"id":"source.frontier.arxiv-2604-22459","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2604.22459&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2604.22459 names Modal logic: \"We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.doi-10-1111-ecot-70052","sources":[{"id":"source.frontier.doi-10-1111-ecot-70052","url":"https://api.crossref.org/works/10.1111/ecot.70052"}],"summary":"The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70333","sources":[{"id":"source.frontier.doi-10-1002-qj-70333","url":"https://api.crossref.org/works/10.1002/qj.70333"}],"summary":"The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pwat-0000557","sources":[{"id":"source.frontier.doi-10-1371-journal-pwat-0000557","url":"https://api.crossref.org/works/10.1371/journal.pwat.0000557"}],"summary":"The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"","target":"concept.usgs.30","type":"related"},{"source":"claim.frontier.doi-10-1111-medu-70340","sources":[{"id":"source.frontier.doi-10-1111-medu-70340","url":"https://api.crossref.org/works/10.1111/medu.70340"}],"summary":"The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"","target":"concept.mesh.d000091682","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124622","sources":[{"id":"source.frontier.doi-10-1029-2026gl124622","url":"https://api.crossref.org/works/10.1029/2026gl124622"}],"summary":"The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-15351-2373-8456-1235","sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1235","url":"https://api.crossref.org/works/10.15351/2373-8456.1235"}],"summary":"The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-15351-2373-8456-1216","sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1216","url":"https://api.crossref.org/works/10.15351/2373-8456.1216"}],"summary":"The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl125301","sources":[{"id":"source.frontier.doi-10-1029-2026gl125301","url":"https://api.crossref.org/works/10.1029/2026gl125301"}],"summary":"The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","target":"field.usgs.1678","type":"related"},{"source":"claim.frontier.doi-10-21425-fob-19-142560","sources":[{"id":"source.frontier.doi-10-21425-fob-19-142560","url":"https://api.crossref.org/works/10.21425/fob.19.142560"}],"summary":"The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001044","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001044","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001044"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"","target":"concept.usgs.1312","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000886","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000886","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000886"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1075-consl-25020-lia","sources":[{"id":"source.frontier.doi-10-1075-consl-25020-lia","url":"https://api.crossref.org/works/10.1075/consl.25020.lia"}],"summary":"The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"","target":"field.aat.300054256","type":"related"},{"source":"claim.frontier.doi-10-2166-hydro-2026-040","sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-040","url":"https://api.crossref.org/works/10.2166/hydro.2026.040"}],"summary":"The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-lol2-70186","sources":[{"id":"source.frontier.doi-10-1002-lol2-70186","url":"https://api.crossref.org/works/10.1002/lol2.70186"}],"summary":"The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124411","sources":[{"id":"source.frontier.doi-10-1029-2026gl124411","url":"https://api.crossref.org/works/10.1029/2026gl124411"}],"summary":"The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70629","sources":[{"id":"source.frontier.doi-10-1002-joc-70629","url":"https://api.crossref.org/works/10.1002/joc.70629"}],"summary":"The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9566-70277","sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70277","url":"https://api.crossref.org/works/10.1111/1467-9566.70277"}],"summary":"The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1002-jpln-70129","sources":[{"id":"source.frontier.doi-10-1002-jpln-70129","url":"https://api.crossref.org/works/10.1002/jpln.70129"}],"summary":"The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70613","sources":[{"id":"source.frontier.doi-10-1002-joc-70613","url":"https://api.crossref.org/works/10.1002/joc.70613"}],"summary":"The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70605","sources":[{"id":"source.frontier.doi-10-1002-joc-70605","url":"https://api.crossref.org/works/10.1002/joc.70605"}],"summary":"The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-3176-arch-2026-2-03","sources":[{"id":"source.frontier.doi-10-3176-arch-2026-2-03","url":"https://api.crossref.org/works/10.3176/arch.2026.2.03"}],"summary":"The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","target":"concept.aat.300019278","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-580","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-580","url":"https://api.crossref.org/works/10.2166/wcc.2026.580"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"","target":"concept.usgs.27","type":"related"},{"source":"claim.frontier.doi-10-1002-ijop-70275","sources":[{"id":"source.frontier.doi-10-1002-ijop-70275","url":"https://api.crossref.org/works/10.1002/ijop.70275"}],"summary":"The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.doi-10-3897-popecon-10-e186220","sources":[{"id":"source.frontier.doi-10-3897-popecon-10-e186220","url":"https://api.crossref.org/works/10.3897/popecon.10.e186220"}],"summary":"The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-507","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-507","url":"https://api.crossref.org/works/10.2166/wcc.2026.507"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","target":"concept.usgs.27","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e183393","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e183393","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e183393"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"","target":"concept.mesh.d017149","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026785","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026785","url":"https://api.crossref.org/works/10.38159/ehass.2026785"}],"summary":"The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"","target":"field.aat.300054240","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124090","sources":[{"id":"source.frontier.doi-10-1029-2026gl124090","url":"https://api.crossref.org/works/10.1029/2026gl124090"}],"summary":"The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-pei3-70207","sources":[{"id":"source.frontier.doi-10-1002-pei3-70207","url":"https://api.crossref.org/works/10.1002/pei3.70207"}],"summary":"The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-fea2-70077","sources":[{"id":"source.frontier.doi-10-1002-fea2-70077","url":"https://api.crossref.org/works/10.1002/fea2.70077"}],"summary":"The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"","target":"field.anthropology","type":"related"},{"source":"claim.frontier.doi-10-1002-eet-70146","sources":[{"id":"source.frontier.doi-10-1002-eet-70146","url":"https://api.crossref.org/works/10.1002/eet.70146"}],"summary":"The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-eco-70279","sources":[{"id":"source.frontier.doi-10-1002-eco-70279","url":"https://api.crossref.org/works/10.1002/eco.70279"}],"summary":"The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"","target":"ology.hydrology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124233","sources":[{"id":"source.frontier.doi-10-1029-2026gl124233","url":"https://api.crossref.org/works/10.1029/2026gl124233"}],"summary":"The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gc013127","sources":[{"id":"source.frontier.doi-10-1029-2026gc013127","url":"https://api.crossref.org/works/10.1029/2026gc013127"}],"summary":"The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"","target":"concept.usgs.727","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70320","sources":[{"id":"source.frontier.doi-10-1002-qj-70320","url":"https://api.crossref.org/works/10.1002/qj.70320"}],"summary":"The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","sources":[{"id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","url":"https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"}],"summary":"The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-38159-erats-20261281","sources":[{"id":"source.frontier.doi-10-38159-erats-20261281","url":"https://api.crossref.org/works/10.38159/erats.20261281"}],"summary":"The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"","target":"concept.aat.300060368","type":"related"},{"source":"claim.frontier.doi-10-1002-eco-70277","sources":[{"id":"source.frontier.doi-10-1002-eco-70277","url":"https://api.crossref.org/works/10.1002/eco.70277"}],"summary":"The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1002-iroh-70046","sources":[{"id":"source.frontier.doi-10-1002-iroh-70046","url":"https://api.crossref.org/works/10.1002/iroh.70046"}],"summary":"The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-38159-erats-20261284","sources":[{"id":"source.frontier.doi-10-38159-erats-20261284","url":"https://api.crossref.org/works/10.38159/erats.20261284"}],"summary":"The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","target":"concept.aat.300069306","type":"related"},{"source":"claim.frontier.doi-10-1111-ruso-70070","sources":[{"id":"source.frontier.doi-10-1111-ruso-70070","url":"https://api.crossref.org/works/10.1111/ruso.70070"}],"summary":"The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-200681","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-200681","url":"https://api.crossref.org/works/10.3897/nhcm.3.200681"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001005","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001005","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001005"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-moth-70148","sources":[{"id":"source.frontier.doi-10-1111-moth-70148","url":"https://api.crossref.org/works/10.1111/moth.70148"}],"summary":"The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","target":"field.mesh.d008678","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-20267724","sources":[{"id":"source.frontier.doi-10-38159-ehass-20267724","url":"https://api.crossref.org/works/10.38159/ehass.20267724"}],"summary":"The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"","target":"field.aat.300054288","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124881","sources":[{"id":"source.frontier.doi-10-1029-2026gl124881","url":"https://api.crossref.org/works/10.1029/2026gl124881"}],"summary":"The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jh001578","sources":[{"id":"source.frontier.doi-10-1029-2026jh001578","url":"https://api.crossref.org/works/10.1029/2026jh001578"}],"summary":"The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","target":"ology.seismology","type":"related"},{"source":"claim.frontier.doi-10-1002-gdj3-70104","sources":[{"id":"source.frontier.doi-10-1002-gdj3-70104","url":"https://api.crossref.org/works/10.1002/gdj3.70104"}],"summary":"The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"","target":"ology.meteorology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122610","sources":[{"id":"source.frontier.doi-10-1029-2026gl122610","url":"https://api.crossref.org/works/10.1029/2026gl122610"}],"summary":"The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70308","sources":[{"id":"source.frontier.doi-10-1002-qj-70308","url":"https://api.crossref.org/works/10.1002/qj.70308"}],"summary":"The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-55730-1300-0632-4281","sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4281","url":"https://api.crossref.org/works/10.55730/1300-0632.4281"}],"summary":"The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-55730-1300-0632-4275","sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4275","url":"https://api.crossref.org/works/10.55730/1300-0632.4275"}],"summary":"The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-1002-eet-70139","sources":[{"id":"source.frontier.doi-10-1002-eet-70139","url":"https://api.crossref.org/works/10.1002/eet.70139"}],"summary":"The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-jclp-70212","sources":[{"id":"source.frontier.doi-10-1002-jclp-70212","url":"https://api.crossref.org/works/10.1002/jclp.70212"}],"summary":"The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"","target":"ology.psychopathology","type":"related"},{"source":"claim.frontier.doi-10-12944-cwe-21-2-3","sources":[{"id":"source.frontier.doi-10-12944-cwe-21-2-3","url":"https://api.crossref.org/works/10.12944/cwe.21.2.3"}],"summary":"The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-bse-71470","sources":[{"id":"source.frontier.doi-10-1002-bse-71470","url":"https://api.crossref.org/works/10.1002/bse.71470"}],"summary":"The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000986","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000986","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000986"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-1752-1688-70151","sources":[{"id":"source.frontier.doi-10-1111-1752-1688-70151","url":"https://api.crossref.org/works/10.1111/1752-1688.70151"}],"summary":"The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-jade-70048","sources":[{"id":"source.frontier.doi-10-1111-jade-70048","url":"https://api.crossref.org/works/10.1111/jade.70048"}],"summary":"The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"","target":"concept.aat.300054181","type":"related"},{"source":"claim.frontier.doi-10-1111-lcrp-70059","sources":[{"id":"source.frontier.doi-10-1111-lcrp-70059","url":"https://api.crossref.org/works/10.1111/lcrp.70059"}],"summary":"The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"","target":"concept.mesh.d000075665","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-77938","sources":[{"id":"source.frontier.doi-10-1002-adfm-77938","url":"https://api.crossref.org/works/10.1002/adfm.77938"}],"summary":"The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"","target":"field.mesh.d000076227","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e185197","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e185197","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e185197"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"","target":"concept.mesh.d000070586","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl125327","sources":[{"id":"source.frontier.doi-10-1029-2026gl125327","url":"https://api.crossref.org/works/10.1029/2026gl125327"}],"summary":"The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"","target":"concept.usgs.1298","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70302","sources":[{"id":"source.frontier.doi-10-1002-qj-70302","url":"https://api.crossref.org/works/10.1002/qj.70302"}],"summary":"The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000930","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000930","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000930"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1098-rsnr-2026-0030","sources":[{"id":"source.frontier.doi-10-1098-rsnr-2026-0030","url":"https://api.crossref.org/works/10.1098/rsnr.2026.0030"}],"summary":"The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"","target":"concept.aat.300016617","type":"related"},{"source":"claim.frontier.doi-10-1002-cli2-70062","sources":[{"id":"source.frontier.doi-10-1002-cli2-70062","url":"https://api.crossref.org/works/10.1002/cli2.70062"}],"summary":"The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","sources":[{"id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","url":"https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"}],"summary":"The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70852","sources":[{"id":"source.frontier.doi-10-1111-ejed-70852","url":"https://api.crossref.org/works/10.1111/ejed.70852"}],"summary":"The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70845","sources":[{"id":"source.frontier.doi-10-1111-ejed-70845","url":"https://api.crossref.org/works/10.1111/ejed.70845"}],"summary":"The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001039","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001039","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001039"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-nup-70114","sources":[{"id":"source.frontier.doi-10-1111-nup-70114","url":"https://api.crossref.org/works/10.1111/nup.70114"}],"summary":"The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"","target":"field.aat.300054297","type":"related"},{"source":"claim.frontier.doi-10-1111-ejss-70414","sources":[{"id":"source.frontier.doi-10-1111-ejss-70414","url":"https://api.crossref.org/works/10.1111/ejss.70414"}],"summary":"The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","target":"concept.usgs.1731","type":"related"},{"source":"claim.frontier.doi-10-1029-2026wr044293","sources":[{"id":"source.frontier.doi-10-1029-2026wr044293","url":"https://api.crossref.org/works/10.1029/2026wr044293"}],"summary":"The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp-70399","sources":[{"id":"source.frontier.doi-10-1002-esp-70399","url":"https://api.crossref.org/works/10.1002/esp.70399"}],"summary":"The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-jqs-70108","sources":[{"id":"source.frontier.doi-10-1002-jqs-70108","url":"https://api.crossref.org/works/10.1002/jqs.70108"}],"summary":"The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"","target":"ology.sedimentology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jd046723","sources":[{"id":"source.frontier.doi-10-1029-2026jd046723","url":"https://api.crossref.org/works/10.1029/2026jd046723"}],"summary":"The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-msd2-70089","sources":[{"id":"source.frontier.doi-10-1002-msd2-70089","url":"https://api.crossref.org/works/10.1002/msd2.70089"}],"summary":"The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"","target":"concept.eia.electric-energy","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70342","sources":[{"id":"source.frontier.doi-10-1111-ijal-70342","url":"https://api.crossref.org/works/10.1111/ijal.70342"}],"summary":"The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"","target":"field.aat.300054263","type":"related"},{"source":"claim.frontier.doi-10-1002-cli2-70059","sources":[{"id":"source.frontier.doi-10-1002-cli2-70059","url":"https://api.crossref.org/works/10.1002/cli2.70059"}],"summary":"The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124727","sources":[{"id":"source.frontier.doi-10-1029-2026gl124727","url":"https://api.crossref.org/works/10.1029/2026gl124727"}],"summary":"The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000877","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000877","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000877"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-jmg-70054","sources":[{"id":"source.frontier.doi-10-1111-jmg-70054","url":"https://api.crossref.org/works/10.1111/jmg.70054"}],"summary":"The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"","target":"concept.usgs.1145","type":"related"},{"source":"claim.frontier.doi-10-1111-moth-70134","sources":[{"id":"source.frontier.doi-10-1111-moth-70134","url":"https://api.crossref.org/works/10.1111/moth.70134"}],"summary":"The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"","target":"concept.mesh.d006808","type":"related"},{"source":"claim.frontier.doi-10-1111-gwat-70098","sources":[{"id":"source.frontier.doi-10-1111-gwat-70098","url":"https://api.crossref.org/works/10.1111/gwat.70098"}],"summary":"The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-2166-wp-2026-018","sources":[{"id":"source.frontier.doi-10-2166-wp-2026-018","url":"https://api.crossref.org/works/10.2166/wp.2026.018"}],"summary":"The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1098-rsta-2025-0107","sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0107","url":"https://api.crossref.org/works/10.1098/rsta.2025.0107"}],"summary":"The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","target":"field.aat.300389758","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000931","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000931","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000931"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122646","sources":[{"id":"source.frontier.doi-10-1029-2026gl122646","url":"https://api.crossref.org/works/10.1029/2026gl122646"}],"summary":"The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70058","sources":[{"id":"source.frontier.doi-10-1002-ppp-70058","url":"https://api.crossref.org/works/10.1002/ppp.70058"}],"summary":"The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1002-jpln-70107","sources":[{"id":"source.frontier.doi-10-1002-jpln-70107","url":"https://api.crossref.org/works/10.1002/jpln.70107"}],"summary":"The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"","target":"ology.mineralogy","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-187529","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-187529","url":"https://api.crossref.org/works/10.3897/nhcm.3.187529"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026775","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026775","url":"https://api.crossref.org/works/10.38159/ehass.2026775"}],"summary":"The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"","target":"field.aat.300054255","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026774","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026774","url":"https://api.crossref.org/works/10.38159/ehass.2026774"}],"summary":"The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"","target":"concept.aat.300262706","type":"related"},{"source":"claim.frontier.doi-10-1002-hec-70140","sources":[{"id":"source.frontier.doi-10-1002-hec-70140","url":"https://api.crossref.org/works/10.1002/hec.70140"}],"summary":"The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.doi-10-1002-tox-70177","sources":[{"id":"source.frontier.doi-10-1002-tox-70177","url":"https://api.crossref.org/works/10.1002/tox.70177"}],"summary":"The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","target":"concept.usgs.435","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-77585","sources":[{"id":"source.frontier.doi-10-1002-adfm-77585","url":"https://api.crossref.org/works/10.1002/adfm.77585"}],"summary":"The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"","target":"field.mesh.d044085","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9566-70245","sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70245","url":"https://api.crossref.org/works/10.1111/1467-9566.70245"}],"summary":"The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70337","sources":[{"id":"source.frontier.doi-10-1111-ijal-70337","url":"https://api.crossref.org/works/10.1111/ijal.70337"}],"summary":"The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"","target":"field.aat.300054255","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl123821","sources":[{"id":"source.frontier.doi-10-1029-2026gl123821","url":"https://api.crossref.org/works/10.1029/2026gl123821"}],"summary":"The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"","target":"concept.usgs.2028","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70252","sources":[{"id":"source.frontier.doi-10-1002-qj-70252","url":"https://api.crossref.org/works/10.1002/qj.70252"}],"summary":"The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70540","sources":[{"id":"source.frontier.doi-10-1002-joc-70540","url":"https://api.crossref.org/works/10.1002/joc.70540"}],"summary":"The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-1111-eje-70266","sources":[{"id":"source.frontier.doi-10-1111-eje-70266","url":"https://api.crossref.org/works/10.1111/eje.70266"}],"summary":"The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1111-ecpo-70064","sources":[{"id":"source.frontier.doi-10-1111-ecpo-70064","url":"https://api.crossref.org/works/10.1111/ecpo.70064"}],"summary":"The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1111-beer-70139","sources":[{"id":"source.frontier.doi-10-1111-beer-70139","url":"https://api.crossref.org/works/10.1111/beer.70139"}],"summary":"The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"","target":"concept.mesh.d012941","type":"related"},{"source":"claim.frontier.doi-10-1098-rsta-2025-0029","sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0029","url":"https://api.crossref.org/works/10.1098/rsta.2025.0029"}],"summary":"The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"","target":"field.aat.300054297","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124661","sources":[{"id":"source.frontier.doi-10-1029-2026gl124661","url":"https://api.crossref.org/works/10.1029/2026gl124661"}],"summary":"The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jc023581","sources":[{"id":"source.frontier.doi-10-1029-2025jc023581","url":"https://api.crossref.org/works/10.1029/2025jc023581"}],"summary":"The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jb032632","sources":[{"id":"source.frontier.doi-10-1029-2025jb032632","url":"https://api.crossref.org/works/10.1029/2025jb032632"}],"summary":"The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","target":"field.navigation","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70526","sources":[{"id":"source.frontier.doi-10-1002-joc-70526","url":"https://api.crossref.org/works/10.1002/joc.70526"}],"summary":"The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1111-saje-70032","sources":[{"id":"source.frontier.doi-10-1111-saje-70032","url":"https://api.crossref.org/works/10.1111/saje.70032"}],"summary":"The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124111","sources":[{"id":"source.frontier.doi-10-1029-2026gl124111","url":"https://api.crossref.org/works/10.1029/2026gl124111"}],"summary":"The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70772","sources":[{"id":"source.frontier.doi-10-1111-ejed-70772","url":"https://api.crossref.org/works/10.1111/ejed.70772"}],"summary":"The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"","target":"concept.mesh.d000097822","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122539","sources":[{"id":"source.frontier.doi-10-1029-2026gl122539","url":"https://api.crossref.org/works/10.1029/2026gl122539"}],"summary":"The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70310","sources":[{"id":"source.frontier.doi-10-1111-ijal-70310","url":"https://api.crossref.org/works/10.1111/ijal.70310"}],"summary":"The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"","target":"field.aat.300054264","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-76901","sources":[{"id":"source.frontier.doi-10-1002-adfm-76901","url":"https://api.crossref.org/works/10.1002/adfm.76901"}],"summary":"The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"","target":"concept.mesh.d001698","type":"related"},{"source":"claim.frontier.doi-10-1002-nzm2-70056","sources":[{"id":"source.frontier.doi-10-1002-nzm2-70056","url":"https://api.crossref.org/works/10.1002/nzm2.70056"}],"summary":"The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","target":"concept.usgs.1731","type":"related"},{"source":"claim.frontier.doi-10-1144-jgs2026-026","sources":[{"id":"source.frontier.doi-10-1144-jgs2026-026","url":"https://api.crossref.org/works/10.1144/jgs2026-026"}],"summary":"The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70766","sources":[{"id":"source.frontier.doi-10-1111-ejed-70766","url":"https://api.crossref.org/works/10.1111/ejed.70766"}],"summary":"The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1002-sce-70090","sources":[{"id":"source.frontier.doi-10-1002-sce-70090","url":"https://api.crossref.org/works/10.1002/sce.70090"}],"summary":"The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"","target":"concept.mesh.d000080562","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70053","sources":[{"id":"source.frontier.doi-10-1002-ppp-70053","url":"https://api.crossref.org/works/10.1002/ppp.70053"}],"summary":"The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-ese3-70603","sources":[{"id":"source.frontier.doi-10-1002-ese3-70603","url":"https://api.crossref.org/works/10.1002/ese3.70603"}],"summary":"The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"","target":"concept.eia.coal-mine","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd046190","sources":[{"id":"source.frontier.doi-10-1029-2025jd046190","url":"https://api.crossref.org/works/10.1029/2025jd046190"}],"summary":"The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"","target":"concept.usgs.65","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121323","sources":[{"id":"source.frontier.doi-10-1029-2025gl121323","url":"https://api.crossref.org/works/10.1029/2025gl121323"}],"summary":"The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"","target":"concept.usgs.93","type":"related"},{"source":"claim.frontier.doi-10-1002-ijfe-70259","sources":[{"id":"source.frontier.doi-10-1002-ijfe-70259","url":"https://api.crossref.org/works/10.1002/ijfe.70259"}],"summary":"The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000696","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000696","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000696"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1111-aphw-70185","sources":[{"id":"source.frontier.doi-10-1111-aphw-70185","url":"https://api.crossref.org/works/10.1111/aphw.70185"}],"summary":"The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"","target":"concept.mesh.d000091682","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jh001250","sources":[{"id":"source.frontier.doi-10-1029-2026jh001250","url":"https://api.crossref.org/works/10.1029/2026jh001250"}],"summary":"The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122518","sources":[{"id":"source.frontier.doi-10-1029-2026gl122518","url":"https://api.crossref.org/works/10.1029/2026gl122518"}],"summary":"The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e172739","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e172739","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e172739"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1111-jmg-70045","sources":[{"id":"source.frontier.doi-10-1111-jmg-70045","url":"https://api.crossref.org/works/10.1111/jmg.70045"}],"summary":"The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"","target":"ology.geochronology","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70049","sources":[{"id":"source.frontier.doi-10-1002-ppp-70049","url":"https://api.crossref.org/works/10.1002/ppp.70049"}],"summary":"The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"","target":"concept.usgs.1199","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e162074","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e162074","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e162074"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70289","sources":[{"id":"source.frontier.doi-10-1111-ijal-70289","url":"https://api.crossref.org/works/10.1111/ijal.70289"}],"summary":"The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"","target":"concept.aat.300262706","type":"related"},{"source":"claim.frontier.doi-10-2166-wpt-2026-383","sources":[{"id":"source.frontier.doi-10-2166-wpt-2026-383","url":"https://api.crossref.org/works/10.2166/wpt.2026.383"}],"summary":"The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-359","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-359","url":"https://api.crossref.org/works/10.2166/wcc.2026.359"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"","target":"ology.hydrology","type":"related"},{"source":"claim.frontier.doi-10-66630-sc-2026-0009","sources":[{"id":"source.frontier.doi-10-66630-sc-2026-0009","url":"https://api.crossref.org/works/10.66630/sc.2026.0009"}],"summary":"The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-59588-2961-3094-1247","sources":[{"id":"source.frontier.doi-10-59588-2961-3094-1247","url":"https://api.crossref.org/works/10.59588/2961-3094.1247"}],"summary":"The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"","target":"field.aat.300054245","type":"related"},{"source":"claim.frontier.doi-10-28918-jei-v11i1-2606","sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2606","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2606"}],"summary":"The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"","target":"field.aat.300054254","type":"related"},{"source":"claim.frontier.doi-10-28918-jei-v11i1-2601","sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2601","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2601"}],"summary":"The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"","target":"concept.mesh.d012941","type":"related"},{"source":"claim.frontier.doi-10-1029-2025wr041875","sources":[{"id":"source.frontier.doi-10-1029-2025wr041875","url":"https://api.crossref.org/works/10.1029/2025wr041875"}],"summary":"The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-006","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-006","url":"https://api.crossref.org/works/10.2166/wcc.2026.006"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jb033060","sources":[{"id":"source.frontier.doi-10-1029-2025jb033060","url":"https://api.crossref.org/works/10.1029/2025jb033060"}],"summary":"The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2025ea004610","sources":[{"id":"source.frontier.doi-10-1029-2025ea004610","url":"https://api.crossref.org/works/10.1029/2025ea004610"}],"summary":"The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"","target":"field.usgs.68","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122157","sources":[{"id":"source.frontier.doi-10-1029-2026gl122157","url":"https://api.crossref.org/works/10.1029/2026gl122157"}],"summary":"The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp4-70096","sources":[{"id":"source.frontier.doi-10-1002-esp4-70096","url":"https://api.crossref.org/works/10.1002/esp4.70096"}],"summary":"The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"","target":"field.navigation","type":"related"},{"source":"claim.frontier.doi-10-1111-bioe-70124","sources":[{"id":"source.frontier.doi-10-1111-bioe-70124","url":"https://api.crossref.org/works/10.1111/bioe.70124"}],"summary":"The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"","target":"field.mesh.d026690","type":"related"},{"source":"claim.frontier.doi-10-1002-adom-71396","sources":[{"id":"source.frontier.doi-10-1002-adom-71396","url":"https://api.crossref.org/works/10.1002/adom.71396"}],"summary":"The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","target":"field.mesh.d044085","type":"related"},{"source":"claim.frontier.doi-10-1002-ese3-70586","sources":[{"id":"source.frontier.doi-10-1002-ese3-70586","url":"https://api.crossref.org/works/10.1002/ese3.70586"}],"summary":"The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"","target":"concept.eia.air-collector","type":"related"},{"source":"claim.frontier.doi-10-1144-jgs2026-039","sources":[{"id":"source.frontier.doi-10-1144-jgs2026-039","url":"https://api.crossref.org/works/10.1144/jgs2026-039"}],"summary":"The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","target":"ology.stratigraphy","type":"related"},{"source":"claim.frontier.doi-10-1002-hec-70120","sources":[{"id":"source.frontier.doi-10-1002-hec-70120","url":"https://api.crossref.org/works/10.1002/hec.70120"}],"summary":"The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"","target":"concept.mesh.d057185","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9477-70049","sources":[{"id":"source.frontier.doi-10-1111-1467-9477-70049","url":"https://api.crossref.org/works/10.1111/1467-9477.70049"}],"summary":"The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1111-faam-70045","sources":[{"id":"source.frontier.doi-10-1111-faam-70045","url":"https://api.crossref.org/works/10.1111/faam.70045"}],"summary":"The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-58491-2735-4202-3413","sources":[{"id":"source.frontier.doi-10-58491-2735-4202-3413","url":"https://api.crossref.org/works/10.58491/2735-4202.3413"}],"summary":"The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"","target":"concept.eia.leading-edge","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121378","sources":[{"id":"source.frontier.doi-10-1029-2025gl121378","url":"https://api.crossref.org/works/10.1029/2025gl121378"}],"summary":"The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-56403-nejesh-v5i2-421","sources":[{"id":"source.frontier.doi-10-56403-nejesh-v5i2-421","url":"https://api.crossref.org/works/10.56403/nejesh.v5i2.421"}],"summary":"The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","target":"field.aat.300054280","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl123355","sources":[{"id":"source.frontier.doi-10-1029-2026gl123355","url":"https://api.crossref.org/works/10.1029/2026gl123355"}],"summary":"The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"","target":"concept.usgs.677","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121171","sources":[{"id":"source.frontier.doi-10-1029-2025gl121171","url":"https://api.crossref.org/works/10.1029/2025gl121171"}],"summary":"The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"","target":"concept.usgs.2277","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd044617","sources":[{"id":"source.frontier.doi-10-1029-2025jd044617","url":"https://api.crossref.org/works/10.1029/2025jd044617"}],"summary":"The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","sources":[{"id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","url":"https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"}],"summary":"The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"","target":"field.mesh.d049691","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd045718","sources":[{"id":"source.frontier.doi-10-1029-2025jd045718","url":"https://api.crossref.org/works/10.1029/2025jd045718"}],"summary":"The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122664","sources":[{"id":"source.frontier.doi-10-1029-2026gl122664","url":"https://api.crossref.org/works/10.1029/2026gl122664"}],"summary":"The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"","target":"field.usgs.1678","type":"related"},{"source":"claim.frontier.doi-10-1111-ojoa-70022","sources":[{"id":"source.frontier.doi-10-1111-ojoa-70022","url":"https://api.crossref.org/works/10.1111/ojoa.70022"}],"summary":"The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"","target":"concept.aat.300016586","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd045965","sources":[{"id":"source.frontier.doi-10-1029-2025jd045965","url":"https://api.crossref.org/works/10.1029/2025jd045965"}],"summary":"The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-1111-jssr-70066","sources":[{"id":"source.frontier.doi-10-1111-jssr-70066","url":"https://api.crossref.org/works/10.1111/jssr.70066"}],"summary":"The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"","target":"concept.mesh.d033303","type":"related"},{"source":"claim.frontier.doi-10-1029-2025wr042846","sources":[{"id":"source.frontier.doi-10-1029-2025wr042846","url":"https://api.crossref.org/works/10.1029/2025wr042846"}],"summary":"The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"","target":"concept.usgs.1298","type":"related"},{"source":"claim.frontier.doi-10-3897-jbgs-e185535","sources":[{"id":"source.frontier.doi-10-3897-jbgs-e185535","url":"https://api.crossref.org/works/10.3897/jbgs.e185535"}],"summary":"The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp4-70082","sources":[{"id":"source.frontier.doi-10-1002-esp4-70082","url":"https://api.crossref.org/works/10.1002/esp4.70082"}],"summary":"The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"","target":"ology.stratigraphy","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-184711","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-184711","url":"https://api.crossref.org/works/10.3897/nhcm.3.184711"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gc012776","sources":[{"id":"source.frontier.doi-10-1029-2025gc012776","url":"https://api.crossref.org/works/10.1029/2025gc012776"}],"summary":"The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"","target":"concept.usgs.562","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70436","sources":[{"id":"source.frontier.doi-10-1002-joc-70436","url":"https://api.crossref.org/works/10.1002/joc.70436"}],"summary":"The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-2166-hydro-2026-191","sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-191","url":"https://api.crossref.org/works/10.2166/hydro.2026.191"}],"summary":"The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1111-ojoa-70020","sources":[{"id":"source.frontier.doi-10-1111-ojoa-70020","url":"https://api.crossref.org/works/10.1111/ojoa.70020"}],"summary":"The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"","target":"concept.aat.300019275","type":"related"},{"source":"claim.frontier.doi-10-1111-phpr-70116","sources":[{"id":"source.frontier.doi-10-1111-phpr-70116","url":"https://api.crossref.org/works/10.1111/phpr.70116"}],"summary":"The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"","target":"field.aat.300054245","type":"related"}],"eras":[{"id":"origins","label":"Deep prehistory"},{"id":"agrarian","label":"Agrarian & literate worlds"},{"id":"classical","label":"Classical → medieval"},{"id":"early-modern","label":"Early modern"},{"id":"industrial-modern","label":"Industrial modernity"},{"id":"twentieth","label":"20th century"},{"id":"frontier","label":"Current frontier"},{"id":"undated","label":"Chronology unresolved"}],"identities":[],"input_sha256":"631d0458131a160f4836c5f75839359e71f3de41a84b4092bee0d1f472c918fc","meta":{"completeness":"seed-not-exhaustive","created":"2026-10-04","description":"Living temporal dependency graph of human knowledge. Seed graph designed for continuous expansion and provenance review.","runtime_ology_registry":"data/ologies.tsv","title":"Fog of Knowledge","version":"0.1.0"},"node_support":{"claim.andrology.asrm-infertility-supplement-evidence-gap":[{"id":"assert.claim.andrology.asrm-infertility-supplement-evidence-gap","scope":{"assumptions":"The assessment concerns improving male fertility outcomes with the supplements described.","population":"Men attempting conception who are offered vitamins, antioxidants or nutritional supplement formulations.","quantifiers":null,"time":"Evidence assessment in the retained guideline; no claim about subsequent trials.","uncertainty":"Absence of clear reliable supportive evidence is not proof that every supplement is ineffective or harmful.","units":null},"statement":"The AUA/ASRM guideline reports that clear, reliable evidence is lacking for supplements offered to men attempting conception and describes their value for improving fertility outcomes as questionable.","support":[{"end":18413,"quote":"There are no clear, reliable data to support use of the variety of supplements (vitamins, antioxidants, nutritional supplement formulations) that have been offered to men attempting conception. Current data suggest that they are likely not harmful, but they are of questionable value in improving fertility outcomes.","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":18097}],"target_id":"claim.andrology.asrm-infertility-supplement-evidence-gap","target_kind":"node","target_sha256":"8a123b65983fb333d2a4370c9da90a1f85cf682718c0c34bab8c7cc840a4c582"}],"claim.andrology.asrm-male-infertility-etiology-knowledge-gap":[{"id":"assert.claim.andrology.asrm-male-infertility-etiology-knowledge-gap","scope":{"assumptions":"Historical statement of the authors' research assessment, not a claim that no causes were known or that the same gap remains unchanged today.","population":"The causes of male infertility, including genetic explanations, as discussed by the guideline authors.","quantifiers":null,"time":"At the time of the retained guideline's assessment.","uncertainty":"The source gives a qualitative assessment, not a quantified fraction of unexplained cases.","units":null},"statement":"In its future-directions discussion, the AUA/ASRM guideline states that the causes of male infertility, including their genetic basis, had been only superficially explained at the time of the guideline.","support":[{"end":27958,"quote":"The causes of male infertility, including their genetic basis, have only been superficially explained at this time.","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":27843}],"target_id":"claim.andrology.asrm-male-infertility-etiology-knowledge-gap","target_kind":"node","target_sha256":"be86ef8d870fcaff5c2fa9d600c6799dcfa4b01c6aaed0e60b5fdd99af274dbc"}],"claim.andrology.asrm-microtese-noa-recommendation":[{"id":"assert.claim.andrology.asrm-microtese-noa-recommendation","scope":{"assumptions":"Procedure selection within the AUA/ASRM male-infertility guideline.","population":"Men with non-obstructive azoospermia undergoing sperm retrieval.","quantifiers":null,"time":null,"uncertainty":"Moderate recommendation; Evidence Level Grade C. This is not a guarantee of successful sperm retrieval.","units":null},"statement":"The AUA/ASRM guideline recommends microdissection testicular sperm extraction for men with non-obstructive azoospermia undergoing sperm retrieval, assigning a moderate recommendation with Grade C evidence.","support":[{"end":8379,"quote":"For men with NOA undergoing sperm retrieval, microdissection testicular sperm extraction (TESE) should be performed. (Moderate Recommendation; Evidence Level: Grade C)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":8212}],"target_id":"claim.andrology.asrm-microtese-noa-recommendation","target_kind":"node","target_sha256":"ec966d998639f7977fa5e70ed9f19061d5279e972cc77aa2047b3f3bd407bfed"}],"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment":[{"id":"assert.claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","scope":{"assumptions":"Multiple specimens are preferred when possible, not represented as universally feasible or necessary.","population":"Men facing gonadotoxic therapy or other cancer treatment that may affect fertility.","quantifiers":"Multiple specimens when possible.","time":"Before commencement of the relevant treatment.","uncertainty":"Expert Opinion classification; no guaranteed future fertility outcome is asserted.","units":null},"statement":"The AUA/ASRM guideline advises clinicians to encourage sperm banking, preferably multiple specimens when possible, before gonadotoxic therapy or other cancer treatment that may affect male fertility; it classifies this as expert opinion.","support":[{"end":19983,"quote":"Clinicians should encourage men to bank sperm, preferably multiple specimens when possible, prior to commencement of gonadotoxic therapy or other cancer treatment that may affect fertility in men. (Expert Opinion)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":19770}],"target_id":"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","target_kind":"node","target_sha256":"21c95d8b25e789e5bf27d3a7dd77cc641e47bbe46bde04abf3876a37e4ae174b"}],"claim.andrology.asrm-testosterone-monotherapy-fertility":[{"id":"assert.claim.andrology.asrm-testosterone-monotherapy-fertility","scope":{"assumptions":"Refers specifically to testosterone monotherapy, not every possible treatment for low testosterone.","population":"Males interested in current or future fertility.","quantifiers":null,"time":"Current or future reproductive intentions as specified by the guideline.","uncertainty":"Classified as a Clinical Principle by the guideline, not as a quantified randomized treatment effect.","units":null},"statement":"The AUA/ASRM guideline states that testosterone monotherapy should not be prescribed to a male interested in current or future fertility, identifying this recommendation as a clinical principle.","support":[{"end":13244,"quote":"For the male interested in current or future fertility, testosterone monotherapy should not be prescribed. (Clinical Principle)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":13117}],"target_id":"claim.andrology.asrm-testosterone-monotherapy-fertility","target_kind":"node","target_sha256":"9846285040ea78b2f9d402ef7bfc7b4d2aa4a82224640b3773a3fb6c539a9924"}],"claim.andrology.asrm-varicocelectomy-indications":[{"id":"assert.claim.andrology.asrm-varicocelectomy-indications","scope":{"assumptions":"A guideline recommendation for consideration of surgery under the stated selection criteria.","population":"Men attempting to conceive with palpable varicoceles, infertility and abnormal semen parameters, excluding azoospermic men.","quantifiers":null,"time":null,"uncertainty":"Moderate recommendation; Evidence Level Grade B. Does not guarantee improved fertility or apply to nonpalpable varicoceles or azoospermic men.","units":null},"statement":"The AUA/ASRM guideline recommends considering surgical varicocelectomy for men attempting conception who have palpable varicoceles, infertility and abnormal semen parameters, except azoospermic men; it labels this a moderate recommendation supported by Grade B evidence.","support":[{"end":5530,"quote":"Surgical varicocelectomy should be considered in men attempting to conceive, who have palpable varicocele(s), infertility, and abnormal semen parameters, except for azoospermic men.(Moderate Recommendation; Evidence Level: Grade B)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":5299}],"target_id":"claim.andrology.asrm-varicocelectomy-indications","target_kind":"node","target_sha256":"3fe991a8c06ef4c6af13ab8bc98c0f6193de986e5079339dbd8eab59c6cae708"}],"claim.andrology.endocrine-hypogonadism-diagnostic-criteria":[{"id":"assert.claim.andrology.endocrine-hypogonadism-diagnostic-criteria","scope":{"assumptions":"The diagnosis requires both the stated clinical findings and the stated biochemical findings under the guideline.","population":"Men evaluated for testosterone deficiency and hypogonadism.","quantifiers":"Symptoms and signs together with unequivocally and consistently low serum testosterone.","time":null,"uncertainty":"This is a guideline criterion, not evidence that one symptom or one low measurement is independently sufficient.","units":null},"statement":"The Endocrine Society guideline recommends diagnosing hypogonadism only in men with compatible symptoms and signs and unequivocally and consistently low serum testosterone concentrations.","support":[{"end":4570,"quote":"Recommends making a diagnosis of hypogonadism  only in men with symptoms and signs consistent with testosterone (T) deficiency  and unequivocally and consistently low serum T concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":4380}],"target_id":"claim.andrology.endocrine-hypogonadism-diagnostic-criteria","target_kind":"node","target_sha256":"502087b75d7643ba67d1efa8f06f11412076e2a2de20374423ffcc66a1c4dca6"}],"claim.andrology.endocrine-no-routine-population-screening":[{"id":"assert.claim.andrology.endocrine-no-routine-population-screening","scope":{"assumptions":"The restriction concerns routine population screening, not all testing for suspected hypogonadism.","population":"Men in the general population, as distinguished from patients undergoing clinically indicated evaluation.","quantifiers":"Routine screening of the general male population.","time":null,"uncertainty":"This is the cited guideline's recommendation and does not establish that diagnostic testing is inappropriate for symptomatic patients.","units":null},"statement":"The Endocrine Society guideline recommends against routine screening of men in the general population for hypogonadism.","support":[{"end":5535,"quote":"We recommend against routine screening of men in the general population for hypogonadism.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":5446}],"target_id":"claim.andrology.endocrine-no-routine-population-screening","target_kind":"node","target_sha256":"ddceddceb1ba12c07c072791474541258f9fcc6149708b902ff368e0b7d875e1"}],"claim.andrology.endocrine-primary-secondary-hypogonadism":[{"id":"assert.claim.andrology.endocrine-primary-secondary-hypogonadism","scope":{"assumptions":"Distinguishes primary testicular dysfunction from secondary pituitary-hypothalamic dysfunction using the specified serum hormones.","population":"Men with hypogonadism undergoing evaluation of its origin.","quantifiers":null,"time":null,"uncertainty":"The recommendation concerns diagnostic differentiation; it does not state that those measurements alone determine every underlying etiology.","units":null},"statement":"For men with hypogonadism, the Endocrine Society guideline recommends measuring serum luteinizing hormone and follicle-stimulating hormone concentrations to distinguish primary testicular from secondary pituitary-hypothalamic hypogonadism.","support":[{"end":5776,"quote":"In men who have hypogonadism, we recommend distinguishing between primary (testicular) and secondary (pituitary–hypothalamic) hypogonadism by measuring serum luteinizing hormone and follicle stimulating hormone concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":5550}],"target_id":"claim.andrology.endocrine-primary-secondary-hypogonadism","target_kind":"node","target_sha256":"ee5fe2eba1eab5629b25a5d6f981cc689ef04ffaa30eb8a2aa48083ff881d211"}],"claim.andrology.endocrine-repeat-morning-testosterone":[{"id":"assert.claim.andrology.endocrine-repeat-morning-testosterone","scope":{"assumptions":"Refers to diagnostic confirmation, not routine hormone monitoring of the general population.","population":"Men undergoing diagnostic confirmation of hypogonadism.","quantifiers":"Repeat the morning fasting total testosterone measurement.","time":"Morning fasting measurement, repeated for confirmation.","uncertainty":"A recommended diagnostic procedure, not a guarantee that a repeated value establishes the diagnosis in isolation.","units":null},"statement":"The Endocrine Society guideline recommends confirming hypogonadism by repeating measurement of morning fasting total testosterone concentrations.","support":[{"end":4856,"quote":"Recommend confirming the diagnosis by  repeating the measurement of morning fasting total T concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":4749}],"target_id":"claim.andrology.endocrine-repeat-morning-testosterone","target_kind":"node","target_sha256":"8ea9bf3ad0354b8c86ce2806a3f30d8d759964c434bdf4b6c412eeba310b6433"}],"claim.andrology.who-semen-analysis-clinical-research-uses":[{"id":"assert.claim.andrology.who-semen-analysis-clinical-research-uses","scope":{"assumptions":"The source says semen analysis may be useful, not that it independently determines fertility in every individual.","population":"Clinical and research examination of human semen in the contexts described by WHO.","quantifiers":null,"time":"During and following male fertility regulation and other interventions, where monitoring is undertaken.","uncertainty":"Utility is presented as a possible application rather than a guaranteed diagnostic or predictive result.","units":null},"statement":"The WHO semen manual states that semen analysis may be useful for investigating male fertility status and monitoring spermatogenesis during and following male fertility regulation and other interventions, in clinical and research settings.","support":[{"end":3248,"quote":"Semen analysis may be useful in both clinical and research settings, for investigating male fertility status as well as monitoring spermatogenesis during and following male fertility regulation and other interventions.","source_id":"src.andrology.who-semen-manual-2021","source_sha256":"88f0e5e804e7f8d22ec0fdb7591fb7dec46b22f6ad384c149268983bf7f9f348","start":3030}],"target_id":"claim.andrology.who-semen-analysis-clinical-research-uses","target_kind":"node","target_sha256":"155240297e3a5d810bfb100276975d74bab817021cfe4f8ea622a14b0c299cfa"}],"claim.andrology.who-semen-manual-procedures":[{"id":"assert.claim.andrology.who-semen-manual-procedures","scope":{"assumptions":"Description of the WHO sixth-edition manual, not an independently measured clinical outcome.","population":"Human semen examined or processed in laboratory settings.","quantifiers":null,"time":null,"uncertainty":"The captured publication page establishes the manual's stated scope, not the validation of every individual protocol.","units":null},"statement":"The WHO sixth-edition semen manual describes procedures and methods for laboratory examination and processing of human semen.","support":[{"end":2938,"quote":"The sixth edition of the WHO Manual for the Laboratory Examination and Processing of Human Semen is a reference document for procedures and methods for the laboratory examination and processing of human semen, which are intended to maintain and sustain","source_id":"src.andrology.who-semen-manual-2021","source_sha256":"88f0e5e804e7f8d22ec0fdb7591fb7dec46b22f6ad384c149268983bf7f9f348","start":2686}],"target_id":"claim.andrology.who-semen-manual-procedures","target_kind":"node","target_sha256":"bb570fb99049b35c0ab8e480659b90201a2b4800bfefbaec080490e3cb5eb1df"}],"claim.anytime.choe-ramdas-adjust-then-combine":[{"id":"assert.claim.anytime.choe-ramdas-adjust-then-combine","scope":{"assumptions":"Use suitable adjusters for the same null","population":"E-processes across filtrations","quantifiers":"Logarithmic cost","time":"Preprint revised 2026","uncertainty":"No numerical cost constants in abstract","units":"e-processes"},"statement":"Choe and Ramdas report an adjust-then-combine procedure lifting e-processes across filtrations, with a logarithmic validity-recovery cost.","support":[{"end":1380,"quote":"We establish that a class of functions called adjusters can lift arbitrary e-processes across filtrations. The result yields a generally applicable \"adjust-then-combine\" procedure","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":1201},{"end":1910,"quote":"Second, when we coarsen the filtration to construct an e-process, there is a logarithmic cost to recovering validity in the original filtration.","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":1766}],"target_id":"claim.anytime.choe-ramdas-adjust-then-combine","target_kind":"node","target_sha256":"90f595158b943c426cfce125a50e9af269626792ba25d1d7b6df6c7660dd8f0c"}],"claim.anytime.choe-ramdas-coarse-fine-incompatibility":[{"id":"assert.claim.anytime.choe-ramdas-coarse-fine-incompatibility","scope":{"assumptions":"Distinct information filtrations","population":"E-processes for the same null","quantifiers":"Coarse-to-fine invalidity","time":"Preprint revised 2026","uncertainty":"No proof details in abstract","units":"e-processes"},"statement":"Choe and Ramdas report that e-process validity in a coarser filtration does not automatically hold in a finer filtration, preventing unadjusted averaging across them.","support":[{"end":1074,"quote":"Although e-processes in the same filtration can be combined effortlessly (by averaging), e-processes in different filtrations cannot because their validity in a coarser filtration does not translate to a finer filtration.","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":853}],"target_id":"claim.anytime.choe-ramdas-coarse-fine-incompatibility","target_kind":"node","target_sha256":"c4b27edcb8fd7bc16536bb6e7f66c2e57bcc3f0da2db4e3f7f40bce99f2c0e2e"}],"claim.anytime.confidence-sequences-uniform-coverage":[{"id":"assert.claim.anytime.confidence-sequences-uniform-coverage","scope":{"assumptions":"Guarantees require the authors' stated conditions","population":"Nonparametric sequential settings","quantifiers":"Time-uniform","time":"Unbounded time horizon","uncertainty":"Coverage level not given in abstract","units":"confidence intervals"},"statement":"Howard et al. report constructing shrinking confidence sequences with time-uniform, nonasymptotic coverage under nonparametric conditions.","support":[{"end":885,"quote":"A confidence sequence is a sequence of confidence intervals that is uniformly valid over an unbounded time horizon. Our work develops confidence sequences whose widths go to zero, with nonasymptotic coverage guarantees under nonparametric conditions.","source_id":"src.anytime.howard-confidence-sequences-2021","source_sha256":"a3a7fe7f13d5fee97834657a3157582a1ccd466ea2a006f725ecfaa866f4de70","start":635}],"target_id":"claim.anytime.confidence-sequences-uniform-coverage","target_kind":"node","target_sha256":"68ca37e18f082737b556793e432eeab98dd6ba9b86ba952317ab39b7a78c3d67"}],"claim.anytime.dwork-adaptive-holdout-validation":[{"id":"assert.claim.anytime.dwork-adaptive-holdout-validation","scope":{"assumptions":"Guarantee applies to specified algorithm","population":"Adaptive holdout analyses","quantifiers":"Many adaptively chosen hypotheses","time":"2015 manuscript","uncertainty":"No parameters provided in abstract","units":"validation accuracy"},"statement":"Dwork et al. report that adaptive holdout reuse risks overfitting and propose an algorithm to validate many adaptively chosen hypotheses while avoiding that overfitting.","support":[{"end":1733,"quote":"Reusing a holdout set adaptively multiple times can easily lead to overfitting to the holdout set itself. We give an algorithm that enables the validation of a large number of adaptively chosen hypotheses, while provably avoiding overfitting.","source_id":"src.anytime.dwork-adaptive-generalization-2015","source_sha256":"1ca96eefcac22e1d18e02f4cab3bf73533e9061fe95cf3c15884d0b396cee0c1","start":1491}],"target_id":"claim.anytime.dwork-adaptive-holdout-validation","target_kind":"node","target_sha256":"b9a4f4b788ce62902a2d852f5bff9d4bce8496d5e9fa5f56c092e6f265f7d136"}],"claim.anytime.lee-lasso-postselection-conditioning":[{"id":"assert.claim.anytime.lee-lasso-postselection-conditioning","scope":{"assumptions":"Condition on selection event","population":"Lasso model selection","quantifiers":"Selected coefficients","time":"2016 publication","uncertainty":"Model requirements omitted from abstract","units":"confidence intervals"},"statement":"Lee et al. report selection-conditional inference for lasso-selected coefficients, including confidence intervals and tests.","support":[{"end":1030,"quote":"At the core of our framework is a result that characterizes the distribution of a post-selection estimator conditioned on the selection event. We specialize the approach to model selection by the lasso to form valid confidence intervals for the selected coefficients and test whether all relevant variables have been included in the model.","source_id":"src.anytime.lee-post-selection-2016","source_sha256":"d02318cea41f7bc410b7be95e8925005873e69ff757d81a3c7a29760581d56d9","start":691}],"target_id":"claim.anytime.lee-lasso-postselection-conditioning","target_kind":"node","target_sha256":"c02d1818fe6d0af2be4cdb645f5dfe9c30b866ee513d9669f565c1d004ffb8fe"}],"claim.anytime.ramdas-admissible-martingale-necessity":[{"id":"assert.claim.anytime.ramdas-admissible-martingale-necessity","scope":{"assumptions":"Specific definition of admissibility","population":"Anytime-valid sequential procedures","quantifiers":"All admissible in authors' framework","time":"Preprint revised 2022","uncertainty":"Proof not captured in abstract","units":"martingales"},"statement":"Ramdas et al. report that all admissible confidence sequences, p-processes and e-processes rely on nonnegative martingales under their formal admissibility definition.","support":[{"end":1305,"quote":"Our central contribution is to show that nonnegative martingales are also universal","source_id":"src.anytime.ramdas-admissible-2022","source_sha256":"059c9e0694a6689b085f6290fff48ed5004d0fb30caa7c0c14f77b1f7744876a","start":1222},{"end":1504,"quote":"we show that all admissible constructions of confidence sequences, p-processes, or e-processes must necessarily utilize nonnegative martingales.","source_id":"src.anytime.ramdas-admissible-2022","source_sha256":"059c9e0694a6689b085f6290fff48ed5004d0fb30caa7c0c14f77b1f7744876a","start":1360}],"target_id":"claim.anytime.ramdas-admissible-martingale-necessity","target_kind":"node","target_sha256":"d914813e55f79b2bf9b53bd577d283b6b564a87e9f6ef852333dca5f550784fa"}],"claim.anytime.vovk-wang-averaging-evalues":[{"id":"assert.claim.anytime.vovk-wang-averaging-evalues","scope":{"assumptions":"Inputs must be valid e-values for the same null","population":"Tests of a common null hypothesis","quantifiers":"Arithmetic averaging","time":"2021 publication","uncertainty":"Dependence and construction details not in abstract","units":"e-values"},"statement":"Vovk and Wang report that multiple e-values for one hypothesis can be merged by averaging them.","support":[{"end":1089,"quote":"We demonstrate that e-values are often mathematically more tractable; in particular, in multiple testing of a single hypothesis, e-values can be merged simply by averaging them. This allows us to develop efficient procedures using e-values for testing multiple hypotheses.","source_id":"src.anytime.vovk-wang-e-calibration-2021","source_sha256":"879e46bc1ebfd4150e21283c1255bf3d0a5593c5a2ffe73a33349ba9ba0ecf0d","start":817}],"target_id":"claim.anytime.vovk-wang-averaging-evalues","target_kind":"node","target_sha256":"dbe39d2a0723ed43752401ee1d344963195f3360b406c40ba5149094de058dce"}],"claim.anytime.waudbysmith-bounded-means-betting":[{"id":"assert.claim.anytime.waudbysmith-bounded-means-betting","scope":{"assumptions":"Composite nonnegative martingale construction","population":"Bounded observations","quantifiers":"With and without replacement","time":"Preprint revised 2022","uncertainty":"Exact validity conditions not given in abstract","units":"bounded mean"},"statement":"Waudby-Smith and Ramdas report martingale-based confidence intervals and time-uniform sequences for bounded means, including sampling without replacement and adaptation to unknown variance.","support":[{"end":748,"quote":"This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations.","source_id":"src.anytime.waudbysmith-betting-means-2023","source_sha256":"78cf6be8614989ddaff9f65b49d547885c19dff3101dfff5a841a4dc2e280f6a","start":578},{"end":1212,"quote":"At its heart, it is based on a class of composite nonnegative martingales, with strong connections to testing by betting and the method of mixtures. We show how to extend these ideas to sampling without replacement, another heavily studied problem. In all cases, our bounds are adaptive to the unknown variance","source_id":"src.anytime.waudbysmith-betting-means-2023","source_sha256":"78cf6be8614989ddaff9f65b49d547885c19dff3101dfff5a841a4dc2e280f6a","start":902}],"target_id":"claim.anytime.waudbysmith-bounded-means-betting","target_kind":"node","target_sha256":"ef6a6872a68401634ed0b146bb3e1b28c668d7f5c8feddba67931dc42159580b"}],"claim.anytime.xu-ramdas-elond-arbitrary-dependence":[{"id":"assert.claim.anytime.xu-ramdas-elond-arbitrary-dependence","scope":{"assumptions":"Requires procedure-compatible valid e-values","population":"Sequential hypothesis tests","quantifiers":"Arbitrary dependence","time":"2024 publication","uncertainty":"No quantitative FDR threshold in abstract","units":"FDR"},"statement":"Xu and Ramdas report e-LOND control of online false discovery rate under arbitrary, possibly unknown, dependence.","support":[{"end":1095,"quote":"Our algorithm, e-LOND, provides FDR control under arbitrary, possibly unknown, dependence.","source_id":"src.anytime.xu-ramdas-elond-2024","source_sha256":"724c751d6e68fc207fcd973b8a3a286a276eced35ceed65213972cf1900b42b5","start":1005}],"target_id":"claim.anytime.xu-ramdas-elond-arbitrary-dependence","target_kind":"node","target_sha256":"675742d5169d7f9a2f4f71db47ffacf9df5a791a68c5c96e52e3597753d0284d"}],"claim.assyriology.cdli-p000005-metadata":[{"id":"assertion.assyriology.cdli-p000005-metadata","scope":{"assumptions":"Cataloguing and provenience metadata assigned by CDLI","population":"CDLI artifact P000005 / VAT 15153","quantifiers":"One excavated clay tablet","time":"Uruk IV period attribution, ca. 3350–3200 BC; not an exact writing date","uncertainty":"Language listed as undetermined; period is an attribution rather than a secure year of manufacture","units":"BC"},"statement":"CDLI catalogs P000005 (museum number VAT 15153) as a clay lexical tablet from Uruk (modern Warka), assigned to Uruk IV (ca. 3350–3200 BC), held in the Vorderasiatisches Museum, Berlin, with language undetermined.","support":[{"end":724,"quote":"Lexical tablet excavated in Uruk (mod. Warka), dated to the Uruk IV (ca. 3350-3200 BC) period and now kept in Vorderasiatisches Museum, Berlin, Germany","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":573},{"end":1187,"quote":"Museum Number\nVAT 15153\nPeriod\nUruk IV (ca. 3350-3200 BC)\nProvenience\nUruk (mod. Warka)\nArtifact Type\nTablet\nMaterial(s)\nClay\nGenre / Subgenre(s)\nLexical\n(Archaic Lu2 A (witness))\nLanguage(s)\nUndetermined","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":983}],"target_id":"claim.assyriology.cdli-p000005-metadata","target_kind":"node","target_sha256":"986b3e906be93423451d495874d1e3dbf608c8616eb113e492263d8b557eec44"}],"claim.assyriology.cdli-p000005-transliteration":[{"id":"assertion.assyriology.cdli-p000005-transliteration","scope":{"assumptions":"Modern scholarly transliteration and CDLI editorial composite assignment","population":"Obverse column 1 of the single artifact P000005 and its CDLI composite witness record","quantifiers":"Three transcribed column-one entries; one composite witness relation","time":"Tablet attributed to Uruk IV (ca. 3350–3200 BC)","uncertainty":"The # and ? signs reflect editorial readings; remainder of column is broken; witness status does not imply textual copying direction","units":null},"statement":"CDLI transcribes P000005 obverse column 1 as 1(N01) with ESZDA#, KAB, and DI@t?, marks the remainder broken, and lists the tablet as a witness to the Archaic Lu2 A composite P464118.","support":[{"end":1415,"quote":"column 1\n1. 1(N01) , ESZDA#\n2. 1(N01) , KAB\n3. 1(N01) , DI@t?\nrest broken","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":1342},{"end":2118,"quote":"This artifact is a witness to the following composite(s):\nComposite\nComposite Number\nScore\nCDLI Lexical 000002 (Archaic Lu2 A) composite (P464118)","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":1972}],"target_id":"claim.assyriology.cdli-p000005-transliteration","target_kind":"node","target_sha256":"3b137d0d13083e353544f750730f9f30091a768be24017978f4555fecc799403"}],"claim.assyriology.etcsl-huwawa-versions":[{"id":"assertion.assyriology.etcsl-huwawa-versions","scope":{"assumptions":"Version labels, numbers and resource availability as listed by the ETCSL editors","population":"Two composition-version entries in the ETCSL catalogue","quantifiers":"Two version-specific catalogue entries","time":null,"uncertainty":"Neither relative chronology nor copying/manuscript descent is established by the index","units":null},"statement":"ETCSL catalogs Gilgameš and Ḫuwawa as separate Version A (1.8.1.5) and Version B (1.8.1.5.1) entries, each offering transliteration and translation; those entries alone establish no copying direction or relative date.","support":[{"end":2761,"quote":"1.8.1.5.1 Gilgameš and Ḫuwawa (Version B):\ntransliteration\n|\ntranslation","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":2689},{"end":2832,"quote":"1.8.1.5 Gilgameš and Ḫuwawa (Version A):\ntransliteration\n|\ntranslation","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":2762}],"target_id":"claim.assyriology.etcsl-huwawa-versions","target_kind":"node","target_sha256":"cc6f37d4bb964a47ff93ccebfcdd6677434c7a20979f32bb7558fc1f6db0d382"}],"claim.assyriology.etcsl-ur-iii-ob-catalogues":[{"id":"assertion.assyriology.etcsl-ur-iii-ob-catalogues","scope":{"assumptions":"The index provides catalogue names and the presence of transliterations, not full historical reconstruction","population":"Three separate catalogue listings N1, N2 and B1 within the ETCSL index","quantifiers":"Three separate catalogue entries with differing period/provenience descriptions","time":"Ur III and Old Babylonian labels assigned in the index; no individual absolute manuscript dates established here","uncertainty":"B1 provenience is explicitly possible; no genealogical or copying relationship is claimed","units":null},"statement":"ETCSL separately lists an Ur III catalogue from Nibru (N1), an Old Babylonian catalogue from Nibru (N2), and an Old Babylonian catalogue possibly from Zimbir (B1); these listings do not themselves establish a transmission path among the catalogues.","support":[{"end":175,"quote":"0.1.1 Ur III catalogue from Nibru (N1):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":120},{"end":281,"quote":"0.2.01 OB catalogue from Nibru (N2):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":229},{"end":608,"quote":"0.2.07 OB catalogue possibly from Zimbir (B1):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":546}],"target_id":"claim.assyriology.etcsl-ur-iii-ob-catalogues","target_kind":"node","target_sha256":"be35d758996510c002fa8e18434a2b5eca9b0c9020447b815f53b7365922cad2"}],"claim.assyriology.rinap015-hezekiah-jerusalem":[{"id":"assertion.assyriology.rinap015-hezekiah-jerusalem","scope":{"assumptions":"English edition and restored/translated first-person royal narration","population":"Hezekiah-in-Jerusalem passage in royal inscription Sennacherib 015, column iv","quantifiers":"One attributed confinement claim","time":"Inscription catalogued written ca. 704–681 BC; not necessarily the campaign date","uncertainty":"Royal self-report may be partisan and alone does not verify military consequences independently","units":"BC"},"statement":"In RINAP Sennacherib 015, the first-person royal narrator claims to have confined Hezekiah in Jerusalem like a bird in a cage; this records an inscriptional claim rather than independent proof of the campaign outcome.","support":[{"end":21765,"quote":"(iv 18)\nAs\nfor\nhim\n(\nHezekiah\n)\n,\nI\nconfined\nhim\ninside\nthe\ncity\nJerusalem\n,\nhis\nroyal\ncity\n,\nlike\na\nbird\nin\na\ncage\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":21648},{"end":431,"quote":"Details\nprism\nNeo-Assyrian\nWritten ca. 704-681\nKuyunjik (Nineveh)\nRoyal Inscription\nSennacherib","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":336}],"target_id":"claim.assyriology.rinap015-hezekiah-jerusalem","target_kind":"node","target_sha256":"a7337e588edc6766dbf9f3019ecd334af4cacb6a8d22760f1df167533c206978"}],"claim.assyriology.rinap015-nineveh-orchards-canal":[{"id":"assertion.assyriology.rinap015-nineveh-orchards-canal","scope":{"assumptions":"English translation of the inscription; editorial restorations retained and original pānu unit unconverted","population":"Orchard-expansion and canal passage of royal inscription Sennacherib 015, column viii","quantifiers":"Plots of two pānu each, without verified total number of plots","time":"Inscription catalogued written ca. 704–681 BC; reported works undated within this excerpt","uncertainty":"Royal construction report is not independently verified; cutting action and portions of the route are reconstructed","units":"pānu (ancient unit, no modern conversion asserted)"},"statement":"In column viii of RINAP Sennacherib 015, the royal narrator reports dividing upstream meadowland into plots of two pānu for Nineveh’s citizens and cutting a canal from near Kisiri toward Nineveh’s plain; parts of the canal construction and route appear in brackets as editorial restorations.","support":[{"end":54914,"quote":"(viii 8'b)\nFor\nthe\nexpansion\nof\norchards\n,\nI\nsubdivided\nthe\nmeadowland\nupstream\nof\nthe\ncity\ninto\nplots\nof\ntwo\npānu\neach\nfor\nthe\ncitizens\nof\nNineveh\nand\nI\nhanded\n(\nthem\n)\nover\nto\nthem\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":54730},{"end":55127,"quote":"To\nmake\n(\nthose\n)\n[\nplan\n]\nted\nareas\nluxuriant\n,\n(\nviii\n15´\n)\n[\nI\ncut\nwith\n]\niron\n[\npi\n]\ncks\n[\na\n]\ncanal\n[\nstraight\nthrough\n]\nmountain\nand\nvalley\n,\nfrom\nthe\nborder\nof\nthe\ncity\nKisiri\n[\nto\nthe\n]\nplain\nof\nNineveh\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":54915}],"target_id":"claim.assyriology.rinap015-nineveh-orchards-canal","target_kind":"node","target_sha256":"743e464a348baa05ded73e0dcf33a5a15cc86492c6751fbe24733a97ac965c48"}],"claim.assyriology.rinap015-tebilti-river":[{"id":"assertion.assyriology.rinap015-tebilti-river","scope":{"assumptions":"Editorial translation of royal first-person narration, including bracketed reconstructed words","population":"Tebilti River construction passage of royal inscription Sennacherib 015, column vi","quantifiers":"One river-management assertion","time":"Inscription catalogued written ca. 704–681 BC; construction date not directly established","uncertainty":"The text is a royal claim and restoration-dependent; no independent archaeological demonstration","units":null},"statement":"In column vi of RINAP Sennacherib 015, the royal narrator reports changing the Tebilti River’s course, repairing erosion damage, and directing its outflow, with several portions of the translation editorially restored.","support":[{"end":35830,"quote":"(vi 1)\n[\nI\ntore\ndown\n]\nthat\nsmall\npalace\nin\nits\nentirety\n,\n[\nthen\n]\nI\nchan\n[\nged\n]\nthe\ncourse\nof\nthe\nTebilti\nRiver\n,\nrepaired\n(\nthe\neffects\nof\n)\nthe\nerosion\n,\nand\ndirected\n[\nits\n]\nout\n[\nflow\n]\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":35636}],"target_id":"claim.assyriology.rinap015-tebilti-river","target_kind":"node","target_sha256":"ae4384aeeaadf45fab0b5e1f95601b737567cea99a47e0866a45d9e5a4fa9065"}],"claim.assyriology.saa001-metadata":[{"id":"assertion.assyriology.saa001-metadata","scope":{"assumptions":"Oracc/SAAo editorial catalogue identifiers, archive provenance and recipient restoration","population":"SAA 01 001 / P224485 administrative-letter record","quantifiers":"One letter, with catalogue cross-identifiers","time":"Reign attribution Sargon II (721–705 BC); catalogue says Dated: no","uncertainty":"Archive is find context rather than composition place; final signs of recipient name are restored; no specific date established","units":"BC"},"statement":"SAAo catalogs SAA 01 001 (CDLI P224485; primary publication NL 039) as a Neo-Assyrian clay administrative letter from the Northwest Palace archive at Nimrud, attributed to Sargon II’s reign (721–705 BC) but explicitly undated, with sender the king and addressee Aššur-šarru-u[ṣur].","support":[{"end":1105,"quote":"SAA 01 001\nCDLI\nP224485\nCollection no.: IM 064156\nExcavation no.: ND 02759\nPrimary publication(s): NL 039","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1000},{"end":1480,"quote":"Provenience: Nimrud (Kalhu) (Pleiades ID:\n894019\n)\nArchive: 006 - Northwest Palace, Room ZT 4\nLanguage: Akkadian (Neo-Assyrian)\nGenre: Administrative Letter\nObject type: tablet\nMaterial: clay\nScript: Neo-Assyrian\nDate\nPeriod: Neo-Assyrian\nReign: Sargon II (721–705 BC)\nDated: no\nSender Information\nSender: the king\nLocation: Royal Court\nRecipient: Aššur-šarru-u[ṣur]","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1114}],"target_id":"claim.assyriology.saa001-metadata","target_kind":"node","target_sha256":"0f7257d029e2dd4b090935bf529895ca28a3748a165727e015a40c987e90b3d8"}],"claim.assyriology.saa001-midas-messenger":[{"id":"assertion.assyriology.saa001-midas-messenger","scope":{"assumptions":"SAAo English editorial translation with bracketed restoration of [of]","population":"Reported communication quoted in SAA 01 001 and ensuing royal response","quantifiers":"14 men of Que reported","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Messenger report nested within quoted earlier letter and alliance characterized by royal narrator; not externally corroborated here","units":"men"},"statement":"In SAA 01 001 the royal writer quotes an earlier report that a messenger [of] Midas brought 14 men of Que previously sent by Urik to Urarṭu and declares that the Phrygian became an ally; these are reported statements in the letter, not independent verification of either event.","support":[{"end":2297,"quote":"(3)\nAs\nto\nwhat\nyou\nwrote\nto\nme\n: \"\nA\nmessenger\n[\nof\n]\nMidas\nthe\nPhrygian\nhas\ncome\nto\nme\n,\nbringing\nme\n14\nmen\nof\nQue\nwhom\nUrik\nhad\nsent\nto\nUrarṭu\nas\nan\nembassy\n\"\n—\nthis\nis\nextremely\ngood\n!\nMy\ngods\nAššur\n,\nŠamaš\n,\nBel\nand\nNabû\nhave\nnow\ntaken\naction\n,\nand\nwithout\na\nbattle\n[\nor\nany\n]\nthing\n,\nthe\nPhrygian\nhas\ngiven\nus\nhis\nword\nand\nbecome\nour\nally\n!","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1952}],"target_id":"claim.assyriology.saa001-midas-messenger","target_kind":"node","target_sha256":"98a2d458afc9a40dc5034b47848276abc6300568b4bd624255373560f76fb802"}],"claim.assyriology.saa001-phrygian-contact":[{"id":"assertion.assyriology.saa001-phrygian-contact","scope":{"assumptions":"Translated direct command in the letter, framed after an earlier quoted communication","population":"Royal instructions to addressee in SAA 01 001","quantifiers":"One instruction passage","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Subsequent action and correspondence are not documented by this extract","units":null},"statement":"SAA 01 001 directs its recipient not to withdraw a messenger from the Phrygian, to write amicably, and to monitor news about him; the instruction does not establish that the recipient complied.","support":[{"end":3189,"quote":"I\nam\nnow\nwriting\nto\n(\ntell\n)\nyou\nthat\nyou\nshould\nnot\ncut\noff\nyour\nmessenger\nfrom\nthe\nPhrygian's\npresence\n.\nWrite\nto\nhim\nin\nfriendly\nterms\nand\nconstantly\nlisten\nto\nnews\nabout\nhim\n,\nuntil\nI\nhave\nmore\ntime\n.","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":2985}],"target_id":"claim.assyriology.saa001-phrygian-contact","target_kind":"node","target_sha256":"a6c6a7fd32972df68b464a81a97f7140dfd0c89cd37c2505babf6dbbc5ebc4ac"}],"claim.assyriology.saa001-tabal-strategy":[{"id":"assertion.assyriology.saa001-tabal-strategy","scope":{"assumptions":"SAAo edited translation of a royal directive, with ellipsis preceding the proposed strategy","population":"Proposed political strategy against the kings of Tabal in SAA 01 001","quantifiers":"Two proposed directions of pressure","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Not proof of Phrygian participation, military implementation or conquest","units":null},"statement":"In SAA 01 001 the royal writer proposes that the recipient pressure the kings of Tabal from one side while the Phrygian does so from the other; the source includes an ellipsis and does not confirm that the plan occurred.","support":[{"end":7780,"quote":"now\nthat\nthe\nPhrygian\nhas\nmade\npeace\nwith\nus\nand\n...,\nwhat\ncan\nall\nthe\nkings\nof\nTabal\ndo\nhenceforth\n?\nYou\nwill\npress\nthem\nfrom\nthis\nside\nand\nthe\nPhrygian\nfrom\nthat\nside\nso\nthat\n(\nin\nno\ntime\n)\nyou\nwill\nsnap\nyour\nbelt\non\nthem\n.","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":7555}],"target_id":"claim.assyriology.saa001-tabal-strategy","target_kind":"node","target_sha256":"915e8d093a5d5c2a07078fab9e7faa65a078b29b11d53d066c5d03b09e11ae35"}],"claim.astrometeorology.aratus-crescent-horn-signs":[{"id":"assertion.claim.astrometeorology.aratus-crescent-horn-signs","scope":{"assumptions":"Third and fourth nights, horn shapes, colors, and orientations","population":"Weather omens in the Moon's early waxing crescent","quantifiers":"Third/fourth night; qualitative weather categories","time":null,"uncertainty":"Textual forecast tradition, without modern evidence of predictive reliability","units":null},"statement":"In Phaenomena, Aratus presents the shape and color of the Moon's horns on the third and fourth nights as signs for calm, wind, rain and storms, including directional winds linked to horn orientation.","support":[{"end":47085,"quote":"If she is slender and\n        clear about the third day, she heralds calm: if slender and very ruddy, wind; but if thick and with blunted\n        horns she show but a feeble light on the third and fourth night, her beams are blunted by the South wind or\n        imminent rain. If on the third night neither horn nod forward or lean backward, if vertical they curve their\n        tips on either side, winds from the West will follow that night. But if still with vertical crescent she bring\n        the fourth day too, she gives warning of gathering storm. If her upper horn nod forward, expect thou the North\n        wind, but if it lean backward, the South.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":46427}],"target_id":"claim.astrometeorology.aratus-crescent-horn-signs","target_kind":"node","target_sha256":"5201958fcc68f1691a4a877462a36e08ba405aac6ea94a069baf4c9aa8c0e9a2"}],"claim.astrometeorology.aratus-manger-ass-stars":[{"id":"assertion.claim.astrometeorology.aratus-manger-ass-stars","scope":{"assumptions":"Visibility under a clear sky and asymmetric dimming of the two stars","population":"The Manger and flanking Asses as described by Aratus","quantifiers":"Two flanking stars; directional qualitative forecast","time":null,"uncertainty":"Apparent star changes are treated as weather omens, without evidence here of forecast accuracy","units":null},"statement":"Aratus states that a darkening or vanishing Manger in Cancer signals rain or storms, and that relative dimming of the northern or southern Ass star can indicate a southerly or northerly wind.","support":[{"end":53166,"quote":"On a sudden, when all the sky is clear, the Manger wholly disappears,\n        while the stars that go on either side seem nearer drawn to one another: not slight then is the storm with which\n        the fields are deluged. If the Manger darken and both stars remain unaltered, they herald rain. But if the Ass\n        to the North of the Manger shine feebly through a faint mist, while the Southern Ass is gleaming bright, expect\n        wind from the South: but if in turn the Southern Ass is cloudy and the Northern bright, watch for the North\n        wind.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":52607}],"target_id":"claim.astrometeorology.aratus-manger-ass-stars","target_kind":"node","target_sha256":"d5ee5e74123c84d120fc7ea321bab25bf94b6db8a3fe149b0de56b905efaf201"}],"claim.astrometeorology.aratus-seabird-wind-signs":[{"id":"assertion.claim.astrometeorology.aratus-seabird-wind-signs","scope":{"assumptions":"Herons, storm petrels, wild ducks and gulls in the described conditions","population":"Behavioral wind and gale signs in Phaenomena","quantifiers":"Several named bird types; qualitative gale forecasts","time":null,"uncertainty":"Ancient observational attribution; no controlled predictive test","units":null},"statement":"Aratus describes a heron flying landward from the sea with cries, storm petrels turning toward winds, and ducks or gulls beating wings on shore as signs preceding gales.","support":[{"end":53712,"quote":"[913] When, too, the heron in disordered flight comes landward from he sea with many a scream, he is precursor\n        of the gale at sea. Anon, too, the stormy petrels when the flit in calm, move in companies to face the coming\n        winds. Oft before a gale the wild ducks or sea-wheeling gulls beat their wings on the shore, or a cloud is\n        lengthwise resting on the mountain peaks.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":53319}],"target_id":"claim.astrometeorology.aratus-seabird-wind-signs","target_kind":"node","target_sha256":"324865472dbdacd26630bc3e6bd7673cd0e539e1a1a9405e64c873b841547ecf"}],"claim.astrometeorology.ptolemy-fixed-star-appearances":[{"id":"assertion.claim.astrometeorology.ptolemy-fixed-star-appearances","scope":{"assumptions":"Bright fixed stars rising or setting with respect to the Sun","population":"Daily weather changes described by Ptolemy","quantifiers":"Daily intensifications; no quantitative validation","time":null,"uncertainty":"Historical causal attribution only; no demonstrated physical mechanism","units":null},"statement":"In Tetrabiblos II.12, Ptolemy attributes day-by-day intensification of weather qualities chiefly to appearances of bright fixed stars at their morning or evening rising or setting relative to the Sun.","support":[{"end":10766,"quote":"The day by day intensifications of these particular qualities are brought about\np99\nchiefly when the more brilliant and powerful of the fixed stars make appearances, matutine or vespertine, at rising or setting, with respect to the sun.","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":10530}],"target_id":"claim.astrometeorology.ptolemy-fixed-star-appearances","target_kind":"node","target_sha256":"3cd05f8bed278f583105c4cc82c06b0a978d9e636c30dd9a6a1a7823cc9902d8"}],"claim.astrometeorology.ptolemy-lunar-halo-omens":[{"id":"assertion.claim.astrometeorology.ptolemy-lunar-halo-omens","scope":{"assumptions":"Single clear fading halo versus multiple, colored or broken halos","population":"Lunar halo appearances in Ptolemy's weather-sign discussion","quantifiers":"One halo versus two or three; no quantified predictive performance","time":null,"uncertainty":"Author-attributed omen interpretations; no demonstrated diagnostic accuracy","units":null},"statement":"In Tetrabiblos II.13, Ptolemy treats a single clear fading lunar halo as a fair-weather sign and multiple or differently colored and shaped lunar halos as signs of storms or winds.","support":[{"end":13599,"quote":"We must also observe the halos around the moon. For if there is one, and this is clear, and gradually fading, it signifies fair weather; if there are two or three, storms; if they are yellowish, and broken, as it were, storms accompanied by heavy winds;","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":13346}],"target_id":"claim.astrometeorology.ptolemy-lunar-halo-omens","target_kind":"node","target_sha256":"82d97c26daa80df7e694912230fbd3901950c5ad8256535ac677af545b49182e"}],"claim.astrometeorology.ptolemy-seasonal-syzygies":[{"id":"assertion.claim.astrometeorology.ptolemy-seasonal-syzygies","scope":{"assumptions":"Four equinoctial and solstitial starting points; new and full moons preceding them","population":"Seasonal forecasts in Ptolemy's proposed procedure","quantifiers":"Four seasons; no measured predictive accuracy","time":null,"uncertainty":"Historical weather-forecasting proposal, not a tested prediction law","units":null},"statement":"In Tetrabiblos II.10, Ptolemy proposes using new- and full-moon syzygies preceding the four equinoctial and solstitial starting points to conjecture seasonal conditions for spring, summer, autumn and winter.","support":[{"end":3079,"quote":"It seems more proper and natural to me, however, to employ the four starting-points for investigations which deal with the year, observing the syzygies\np199\nof the sun and moon at new and full moon which most nearly precede them, and among these in particular the conjunctions at which eclipses take place, so that from the starting-point in Aries we may conjecture what the spring will be like,\np93\nfrom that in Cancer the summer, from that in Libra the autumn, and from that in Capricorn the winter.","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":2578}],"target_id":"claim.astrometeorology.ptolemy-seasonal-syzygies","target_kind":"node","target_sha256":"3274aeeb00424d501723425d82df7380fcf322e8b4b5150a5e051d816b6c594e"}],"claim.astrometeorology.theophrastus-ant-eggs-rain-signs":[{"id":"assertion.claim.astrometeorology.theophrastus-ant-eggs-rain-signs","scope":{"assumptions":"Movement up from a hollow place versus downward","population":"Ants' egg transport as an attributed sign of weather","quantifiers":"Two movement directions; qualitative rain/fair outcome","time":null,"uncertainty":"Historical forecast claim without verified prediction accuracy","units":null},"statement":"Theophrastus treats ants moving their eggs from hollow anthills to higher ground as a sign of rain and moving them down as a sign of fair weather.","support":[{"end":11783,"quote":"It is a sign of rain if ants⁠\n38\nin a hollow place carry their eggs up from the ant-hill to the high ground, a sign of fair weather if they carry them down.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":11627}],"target_id":"claim.astrometeorology.theophrastus-ant-eggs-rain-signs","target_kind":"node","target_sha256":"8fdc59b5f519a8842fe42f4938dda39ffbeb95dd8a9cba602fae0791f30b9e7b"}],"claim.astrometeorology.theophrastus-local-cloud-conditions":[{"id":"assertion.claim.astrometeorology.theophrastus-local-cloud-conditions","scope":{"assumptions":"Mountains, valleys, coastal terrain, wind shifts, locally informed observation","population":"Local weather signs in mountain-and-valley regions","quantifiers":"Region-specific, with no universal forecast probability","time":null,"uncertainty":"Textual description and recommendation without a controlled prediction study","units":null},"statement":"Theophrastus says mountainous and coastal terrain affects cloud movements when winds change and advises attending to local conditions and knowledgeable local observers when interpreting weather signs.","support":[{"end":2387,"quote":"Of the remaining signs some belong specially to all such lands as contain high mountains and valleys, specially where such mountains extend down to the sea: for, when the winds begin to blow, the clouds are thrown against such places, and, when the winds\np393\nchange, the clouds also change⁠\n2\nand take a contrary direction, and, as they become laden with moisture, they settle down in the hollows because of their weight. Wherefore good heed must be taken to the local conditions of the region in which one is placed. It is indeed always possible to find such an observer, and the signs learnt from such persons are the most trustworthy.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":1749}],"target_id":"claim.astrometeorology.theophrastus-local-cloud-conditions","target_kind":"node","target_sha256":"360723eecc58227d554a16f123662a13d085c6ee6af72724819a1b69e2c67641"}],"claim.astrometeorology.theophrastus-red-sky-three-days":[{"id":"assertion.claim.astrometeorology.theophrastus-red-sky-three-days","scope":{"assumptions":"Reddish dawn versus red sky at sunset","population":"Dawn and sunset color observations in the described weather lore","quantifiers":"Within three days or earlier; comparative certainty only","time":null,"uncertainty":"Claimed forecast interval and comparative certainty are textual, not empirically established probabilities","units":null},"statement":"Theophrastus describes a reddish sky before sunrise as a rain sign for the same day or within three days, and a red sunset sky as a similar but less certain sign.","support":[{"end":5755,"quote":"Now the signs of rain appear to be as follows: most unmistakable is that which occurs at dawn, when the sky has a reddish appearance before sunrise; for this usually indicates rain within three days, if not on that very day. Other signs point the same way: thus a red sky at sunset indicates rain within three days, if not before, though less certainly than a red sky at dawn.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":5379}],"target_id":"claim.astrometeorology.theophrastus-red-sky-three-days","target_kind":"node","target_sha256":"f128f53d17826c5e21145dabded9332aeffcb93aa7cf959098d781d29062715f"}],"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","scope":{"assumptions":"Exploration is a level or score affecting spatial movement and social attraction, not itself defined as the probability of exploring; scrounging probability governs tactic selection.","population":"Simulated agents in a spatial producer-scrounger foraging game","quantifiers":"Both traits continuous and evolvable; no fixed producer/scrounger or fast/slow types were imposed initially.","time":"2012 publication; tactics alternated within foraging rounds and genetic traits evolved across rounds","uncertainty":"Computational model rather than direct animal observation; outcomes depend on implemented spatial and selection assumptions.","units":"Dimensionless exploration level and scrounging probability, each on [0,1]"},"statement":"Kurvers and colleagues modeled group foraging with a spatially explicit genetic algorithm whose simulated agents could alternate between producing and scrounging; the exploration level and the probability of scrounging were distinct, evolving continuous traits each ranging from 0 to 1.","support":[{"end":10342,"quote":"Here we incorporated travel times for scroungers and allowed individuals to play a mixed strategy by alternating between producer and scrounger within rounds. Importantly, we did not start with\na priori\ndifferences between individuals by introducing fast and slow explorers in the model, or by assigning fixed foraging strategies (either producing, or scrounging) to individuals. Both the level of exploration and the scrounging probability were on a continuous scale (0–1) and were allowed to evolve (i.e., not fixed).","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":9823},{"end":16773,"quote":"An individual’s strategy was encoded in a 2-locus real-valued chromosome, with locus 1 coding for the probability of scrounging P\nS_I\nand locus 2 coding for the value of exploration E\nI\n. Both loci ranged from 0 to 1","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":16557}],"target_id":"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","target_kind":"node","target_sha256":"6abdf737c508fa9692ac553efe3014439cacbe876ee48bff759fe619132af983"}],"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","scope":{"assumptions":"Intra-run convergence is distinct from variation across different simulation environments.","population":"Populations of simulated agents within individual evolutionary runs under a fixed environmental parameter combination","quantifiers":"Within a given run, rather than all runs or populations universally.","time":"2012 simulation runs","uncertainty":"No observed within-run stable coexistence under modeled conditions does not preclude it in real animals or different models.","units":"Qualitative evolutionary outcome for simulated exploration level"},"statement":"In the Kurvers evolutionary simulations, populations within a given environmental run approached one exploration optimum rather than retaining a stable coexistence of distinct explorer personality types.","support":[{"end":29270,"quote":"Within each run populations evolved towards monomorphism where a single optimal level of exploration characterized all the individuals in the population (\nText S2\n). We found thus no evidence for a stable co-existence of different (personality) types within one population submitted to a given assortment of environmental conditions.","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":28937}],"target_id":"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","target_kind":"node","target_sha256":"4389c51309b84e330fdadc65e43d60472ae672090b7a84b80b81a58611c6477e"}],"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","scope":{"assumptions":"Effect conditional on richness for scrounging; exploration denotes evolved movement tendency, not a probability of exploring.","population":"Spatial genetic-algorithm producer-scrounger simulations with varying food-patch density and richness","quantifiers":"Density effect on scrounging only for low/intermediate richness, not high richness.","time":"2012 model runs; evolved outcomes averaged over the last 10 rounds","uncertainty":"Model-specific result; no estimated universal response for natural animals.","units":"Qualitative direction of simulated evolved exploration levels and scrounging probabilities"},"statement":"In the Kurvers producer-scrounger simulations, increasing food-patch density favored higher exploration; it also reduced scrounging at low or intermediate patch richness, but this reduction disappeared at high patch richness.","support":[{"end":21030,"quote":"An increase in patch density led to an increase in exploration and a reduction in scrounging, but the latter only under conditions of low/intermediate patch richness. An increase in patch richness resulted in increased scrounging, but there was no effect on exploration levels.","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":20753}],"target_id":"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","target_kind":"node","target_sha256":"74e32b32118c87e4a614e73b731853302619130192b18b1baea84feb73f0697b"}],"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","scope":{"assumptions":"Patch richness refers to the number of food items per patch rather than patch density; fast/slow explorers refer to trait values.","population":"Spatial genetic-algorithm simulated foragers, across modeled exploration levels","quantifiers":"Richness effect on scrounging at both fast and slow exploration values; no observed effect on exploration.","time":"2012 simulation outcomes","uncertainty":"Null richness effect on exploration pertains to investigated simulation settings, not all ecological environments.","units":"Qualitative evolved scrounging probability and exploration level"},"statement":"In the Kurvers producer-scrounger simulations, richer food patches increased evolved scrounging propensities among both fast and slow explorers, while patch richness showed no effect on evolved exploration.","support":[{"end":20600,"quote":"An increase in patch richness resulted in an increased scrounging, both for fast and slow explorers individuals (\nFig. 1\n). There was, however, no effect of patch richness on exploration (","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":20412}],"target_id":"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","target_kind":"node","target_sha256":"bd361ddee9de13b411f98f9fbf6bb1a73f010beef2f1b43421710faaf94a9547"}],"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","scope":{"assumptions":"Conditional modeled association; adult helpers older than two years and juveniles were excluded from age-versus-experience analysis due to confounding.","population":"Wild meerkat scorpion feeds by eligible subadult (6–12 months) and adult-yearling (1–2 years) helpers","quantifiers":"Older eligible helpers versus younger; prior pup-care experience nonsignificant after age adjustment.","time":"Field observations reported in 2008","uncertainty":"Failure to detect an experience association does not prove absence of an effect; age and prior experience covary.","units":"Qualitative provisioning propensity and statistical significance"},"statement":"In Thornton’s meerkat scorpion-provisioning analysis, older eligible helpers were more likely to give pups intact scorpions, whereas prior experience with earlier foraging litters showed no statistically significant association after controlling for helper age.","support":[{"end":19534,"quote":"The older helpers were more likely to provision pups with intact scorpions (\nfigure 2\n), and there was a non-significant trend for the probability of provisioning dead scorpions to decline with helper age (\ntable 1\n).","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":19317},{"end":19716,"quote":"However, controlling for helper age and other significant variables, I found no evidence that experienced helpers provisioned scorpions in a different way to inexperienced helpers (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":19535}],"target_id":"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","target_kind":"node","target_sha256":"e059557e4f795d4b2a07383c1b25491c5c19b12cae1788ce58cd5cfda884ccd1"}],"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","scope":{"assumptions":"Linear mixed-model associations adjusted for prey, pup and group covariates; the proximity measure is a second helper within 2 m, not overall group size.","population":"6,148 wild meerkat pup feeding observations in the monitoring-time study","quantifiers":"Declines with increasing litter size and rainfall and if another helper is present within 2 m.","time":"Field observations reported in 2008; rainfall totaled over the preceding 30 days","uncertainty":"Observational effects do not identify causal mechanisms for rainfall or helper proximity.","units":"Log monitoring duration based on seconds; rainfall in millimeters over preceding 30 days"},"statement":"In Thornton’s meerkat feeding observations, pup monitoring duration decreased with larger litter size, higher recent rainfall, and the presence of another helper within two metres.","support":[{"end":23178,"quote":"Finally, monitoring time declined with increasing litter size and rainfall, and when another helper was present within 2 m (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":23054}],"target_id":"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","target_kind":"node","target_sha256":"65db8da3b86351801a507acf66897334ce5a3e57ce13b216211a2382d73ad222"}],"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","scope":{"assumptions":"Monitoring included attention to pups handling prey and time retrieving escaped prey; log-duration mixed model.","population":"6,148 observed feeds by wild meerkat helpers to pups; varied prey types","quantifiers":"Prey mobility and size increase duration; increasing pup age decreases duration.","time":"Field observations reported in 2008","uncertainty":"Observational correlations; no demonstrated experimental effect on learning or survival.","units":"Monitoring duration measured in seconds, modeled on a log scale; qualitative directions"},"statement":"For 6,148 observed meerkat pup feeds, helpers spent longer monitoring pups when provisioned prey was moving or larger and spent less time monitoring as pups grew older.","support":[{"end":22848,"quote":"The duration of monitoring following pup feeds was also affected by prey, pup, helper and group characteristics, as well as by recent rainfall. Monitoring duration was greater if the prey item was moving and larger in size and declined as pups grew older (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":22592}],"target_id":"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","target_kind":"node","target_sha256":"9df9098beccdf1603feae93190baf9fdb96f3bd37ce9d20a125f8f7518002ee5"}],"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","scope":{"assumptions":"Binomial generalized linear mixed-model associations of age with prey-state provisioning.","population":"Scorpion-feeding events in wild meerkats, among the 1,070-feed prey-state analysis","quantifiers":"Age-related association conditional on other statistically significant terms.","time":"Field observations reported in 2008","uncertainty":"Not randomized pup-age assignment or proof that provisioning caused learning.","units":"Qualitative direction of scorpion-provisioning probabilities"},"statement":"In Thornton’s wild meerkat scorpion-feeding analysis, older pups were less likely to receive dead or disabled scorpions and more likely to receive intact scorpions, adjusting for significant modeled covariates.","support":[{"end":19184,"quote":"The probability that a scorpion would be fed dead or disabled declined with pup age, while the probability that the item would be fed intact increased, controlling for other significant terms in the model (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":18978}],"target_id":"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","target_kind":"node","target_sha256":"d62a4213cf5f558a975a1da8dd233a3f92a221c0565d97ef8ce323df44e4fd7f"}],"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","scope":{"assumptions":"Scorpion-only feed-state analysis is distinct from the larger prey-monitoring analysis.","population":"Observed wild meerkat helpers and pups; two differently scoped and potentially overlapping sets of feeding events","quantifiers":"1,070/347/339/137/15 provisioning-state; 6,148/300/244/65/13 monitoring-time.","time":"2003–2006 field observations reported in 2008","uncertainty":"Observational samples; repeated events from the same animals and groups; not independent experimental subjects.","units":"Counts of feeds, helpers, pups, litters, and groups"},"statement":"Thornton analyzed 1,070 scorpion feeds by 347 meerkat helpers to 339 pups from 137 litters in 15 groups for prey-provisioning state, and recorded monitoring times for 6,148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","support":[{"end":17171,"quote":"Final analyses were conducted on 1070 feeds by 347 helpers to 339 pups from 137 litters in 15 groups.","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":17070},{"end":17617,"quote":"In total, I collected accurate monitoring times for 6148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":17498}],"target_id":"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","target_kind":"node","target_sha256":"cad982db4e8ca33fc018e53115c092a5b5efc92119539888108dff7bbeb5ede6"}],"claim.bose-2017-gravitational-entanglement-proposal-reported":[{"id":"assertion.bose-2017-gravitational-entanglement-proposal-reported-v2","scope":{"assumptions":"The proposed arrangement relies on gravitationally induced phase evolution between the test masses, with sufficient separation to keep Casimir-Polder forces at bay. Detectable entanglement is a prediction within the proposed setup, not a reported measurement.","population":"Two micron-size test masses in adjacent matter-wave interferometers, as described in the proposal by Bose and collaborators.","quantifiers":"The prediction is limited to the two-mass interferometric arrangement described in the paper. No universal assertion about all gravitational interactions or all proposed gravity tests is made.","time":"The paper was submitted on 19 July 2017. This date identifies the proposal's publication history and does not establish the date of an experimental observation or its current frontier standing.","uncertainty":"The retained source presents a theoretical proposal and predicted test outcome. It does not report that the experiment was performed, that the entanglement was observed, or that gravity's quantum nature was experimentally established. Status reported attributes the proposal to its authors; era undated leaves atlas chronology unresolved; frontier false makes no claim about current research leadership.","units":null},"statement":"Bose and collaborators proposed a test in which gravitationally induced phase evolution between two micron-size test masses in adjacent matter-wave interferometers could produce detectable entanglement, with the masses separated sufficiently to keep Casimir-Polder forces at bay.","support":[{"end":310,"quote":"Authors:\nSougato Bose","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":289},{"end":233,"quote":"[Submitted on 19 Jul 2017]","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":207},{"end":1121,"quote":"Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":991},{"end":1409,"quote":"We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":1122}],"target_id":"claim.bose-2017-gravitational-entanglement-proposal-reported","target_kind":"node","target_sha256":"565135eeb68def2242b5651da7e41fb899a4aed9246439f5fd25c0fcfd8ead96"}],"claim.category-theory.batanin-ainfinity-tensor":[{"id":"assertion.claim.category-theory.batanin-ainfinity-tensor","scope":{"assumptions":"The construction given within the authors’ framework","population":"A-infinity algebras in the cited higher-operad paper","quantifiers":"A tensor product construction, without a uniqueness claim","time":null,"uncertainty":"The retained abstract does not spell out the construction or identify all its technical conditions","units":null},"statement":"Batanin, Cisinski, and Weber state that their paper gives a construction of a tensor product of A-infinity algebras.","support":[{"end":1383,"quote":"give the construction of a tensor product of A-infinity algebras.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":1318}],"target_id":"claim.category-theory.batanin-ainfinity-tensor","target_kind":"node","target_sha256":"ae93e7bc889aa21de69a4c2eac51d71610319c5b31c66085528678ccc9e5bc3a"}],"claim.category-theory.batanin-ekmann-hilton-braided-2cats":[{"id":"assertion.claim.category-theory.batanin-ekmann-hilton-braided-2cats","scope":{"assumptions":"The authors’ described applications of the higher-operad framework","population":"Braided monoidal 2-categories in the authors’ proposed framework","quantifiers":"One reported result","time":null,"uncertainty":"The retained abstract does not specify the theorem statement or proof hypotheses; spelling follows the source","units":null},"statement":"Batanin, Cisinski, and Weber report obtaining an “Ekmann-Hilton” result for braided monoidal 2-categories as an application of their higher-operad framework.","support":[{"end":1312,"quote":"we obtain an \"Ekmann-Hilton\" result for braided monoidal 2-categories","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":1243}],"target_id":"claim.category-theory.batanin-ekmann-hilton-braided-2cats","target_kind":"node","target_sha256":"81a4065fa127cb374fb98c90139fa990623718b83525b57eaaf9d21d1b2d5faa"}],"claim.category-theory.batanin-gray-crans-inclusion":[{"id":"assertion.claim.category-theory.batanin-gray-crans-inclusion","scope":{"assumptions":"Within the authors’ higher-operad framework","population":"The resulting globular-operad-based theory described in the cited paper","quantifiers":"Both named tensor products","time":null,"uncertainty":"The abstract does not establish the constructions’ generality outside the specified settings","units":null},"statement":"Batanin, Cisinski, and Weber state that their resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product of Gray categories.","support":[{"end":957,"quote":"The resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product [12] of Gray categories.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":834}],"target_id":"claim.category-theory.batanin-gray-crans-inclusion","target_kind":"node","target_sha256":"93bfe0bf804ad121fe916d02ef68bc482363ff7b6d189b78bd2761a00866b6ca"}],"claim.category-theory.batanin-gray-generalization-open-problem":[{"id":"assertion.claim.category-theory.batanin-gray-generalization-open-problem","scope":{"assumptions":"Historical characterization by the paper’s authors","population":"Systematic constructions of higher-dimensional analogues of the Gray tensor product","quantifiers":"One of the open problems, without an exclusivity claim","time":"2009 source submission","uncertainty":"Open-problem characterization is historical; the retained abstract cannot establish whether it remains open in 2026","units":null},"statement":"Batanin, Cisinski, and Weber describe the systematic construction of higher-dimensional analogues of the Gray tensor product as an open problem in higher category theory in their 2009-submitted paper.","support":[{"end":730,"quote":"One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":585}],"target_id":"claim.category-theory.batanin-gray-generalization-open-problem","target_kind":"node","target_sha256":"b1232209e0be63852f023c3305b64872f604461ad129430773e3a9ca338ce611"}],"claim.category-theory.fong-spivak-seven-applied-sketches":[{"id":"assertion.claim.category-theory.fong-spivak-seven-applied-sketches","scope":{"assumptions":"The examples and structures are presented as lists of examples, without one-to-one correspondence","population":"Pedagogical examples and categorical structures in the cited book","quantifiers":"Seven sketches; the named examples are nonexhaustive","time":null,"uncertainty":"The captured abstract does not identify the precise pairing within each sketch or prove an application result","units":null},"statement":"Fong and Spivak describe seven instructional sketches pairing examples including databases, electric circuits, and dynamical systems with categorical structures including adjoint functors, enriched categories, and toposes.","support":[{"end":1053,"quote":"The tour takes place over seven sketches, each pairing an evocative application, such as databases, electric circuits, or dynamical systems, with the exploration of a categorical structure, such as adjoint functors, enriched categories, or toposes.","source_id":"src.category-theory.fong-spivak-seven-sketches","source_sha256":"8ce9f9ccad18f3513d2ae63ad4efc86d2cd17d210a7798344b297d837a9a8ea5","start":805}],"target_id":"claim.category-theory.fong-spivak-seven-applied-sketches","target_kind":"node","target_sha256":"3d422fcb5024a78677c6305db976f01be3b47c9af78713c7c3a5ed96e698869c"}],"claim.category-theory.leinster-universal-properties-approaches":[{"id":"assertion.claim.category-theory.leinster-universal-properties-approaches","scope":{"assumptions":"An author-authored summary of textbook organization, not a full proof of equivalence","population":"Presentation of universal properties in the cited introductory textbook","quantifiers":"Three approaches are explicitly listed","time":null,"uncertainty":"The retained abstract states the chapter organization, not formal hypotheses or proofs","units":null},"statement":"Leinster describes his introductory category theory textbook as presenting universal properties through adjoint functors, representable functors, and limits, with a final chapter tying the three approaches together.","support":[{"end":912,"quote":"After a chapter introducing the basic definitions, separate chapters present three ways of expressing universal properties: via adjoint functors, representable functors, and limits. A final chapter ties the three together.","source_id":"src.category-theory.leinster-basic-category-theory","source_sha256":"34ff236e04c05a46e91fa7f3dfe8702e9ffb5b6870dd99678aaa4ceff2d8387f","start":690}],"target_id":"claim.category-theory.leinster-universal-properties-approaches","target_kind":"node","target_sha256":"a3ce43474cd0794d338fec295b52c08842ed9c3304d97ef819eda6d635c79124"}],"claim.category-theory.spivak-programming-types-bridge":[{"id":"assertion.claim.category-theory.spivak-programming-types-bridge","scope":{"assumptions":"Spivak’s proposed categorical connection","population":"Database schemas and category of types for a functional programming language","quantifiers":"A database and a functional programming language","time":null,"uncertainty":"The source does not name a specific programming language or demonstrate deployment","units":null},"statement":"Spivak describes connecting a database to a functional programming language by introducing a functorial connection between the database schema and the language’s category of types.","support":[{"end":1105,"quote":"We also show how to connect a database and a functional programming language by introducing a functorial connection between the schema and the category of types for that language.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":926}],"target_id":"claim.category-theory.spivak-programming-types-bridge","target_kind":"node","target_sha256":"c1cc62aa92339d076dc86d3311001fd56b44b1f05266b42bdd497e544a89fa8b"}],"claim.category-theory.spivak-query-expressiveness":[{"id":"assertion.claim.category-theory.spivak-query-expressiveness","scope":{"assumptions":"The author’s definition and properties of the three data-migration functors","population":"Conjunctive and disjunctive queries as discussed in the categorical database proposal","quantifiers":"The two specified query classes","time":null,"uncertainty":"No performance, SQL coverage, completeness beyond stated query classes, or widespread deployment is claimed","units":null},"statement":"Spivak states that his three data-migration functors can be used in place of conjunctive and disjunctive queries within the paper’s database framework.","support":[{"end":925,"quote":"and can be used in place of conjunctive and disjunctive queries.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":861}],"target_id":"claim.category-theory.spivak-query-expressiveness","target_kind":"node","target_sha256":"15cb1839a0fe960157275ad27883c0bdfa23af027088d0b7b11d87cae2a64104"}],"claim.category-theory.spivak-relational-operations":[{"id":"assertion.claim.category-theory.spivak-relational-operations","scope":{"assumptions":"The three functors introduced for schema morphisms","population":"Relational operations across tables in the categorical database framework","quantifiers":"Across all tables simultaneously as claimed by the author","time":null,"uncertainty":"The abstract reports expressive functionality, not performance or implementation results","units":null},"statement":"Spivak reports that the three data-migration functors parameterize projections, unions, and joins across all tables simultaneously in the categorical database formulation.","support":[{"end":860,"quote":"These functors parameterize projections, unions, and joins over all tables simultaneously","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":771}],"target_id":"claim.category-theory.spivak-relational-operations","target_kind":"node","target_sha256":"376979e14df2fa605a8931e6965073ac2a00ec61fb7cc6aabdd5c5081b93373b"}],"claim.category-theory.spivak-schema-category-instance-functor":[{"id":"assertion.claim.category-theory.spivak-schema-category-instance-functor","scope":{"assumptions":"The paper-specific categorical database formalism","population":"Schemas and instances in Spivak’s proposed categorical database language","quantifiers":"A database schema; an instance","time":null,"uncertainty":"No assertion that every deployed database has this representation or that it is unique","units":null},"statement":"Spivak proposes a database definition language in which a database schema is a small category and an instance is a set-valued functor on that schema.","support":[{"end":622,"quote":"In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":441}],"target_id":"claim.category-theory.spivak-schema-category-instance-functor","target_kind":"node","target_sha256":"4239e41d4c4802393c76c421b48f54ece3d48fddf1a45d6685409799dc9f4e6e"}],"claim.category-theory.spivak-three-migration-functors":[{"id":"assertion.claim.category-theory.spivak-three-migration-functors","scope":{"assumptions":"Database schema morphisms in the author’s categorical formulation","population":"Schema morphisms and database instances in the proposed model","quantifiers":"Three distinct functors are reported","time":null,"uncertainty":"The abstract does not specify the full formal conditions or constructions","units":null},"statement":"Within Spivak’s category-and-functor database model, morphisms of schemas induce three data-migration functors that translate instances between schemas in canonical ways.","support":[{"end":770,"quote":"We show that morphisms of schemas induce three \"data migration functors\", which translate instances from one schema to the other in canonical ways.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":623}],"target_id":"claim.category-theory.spivak-three-migration-functors","target_kind":"node","target_sha256":"75166568be2ede07e77336abc066abdeb21a82d08605a3453e6008cbc3de3ece"}],"claim.citation.alce-eli5":[{"id":"assert.citation.alce-eli5","scope":{"assumptions":"Applies to the paper’s tested systems and citation-support metric","population":"Models evaluated on the ELI5 dataset within ALCE","quantifiers":"50% of evaluated cases for even the best models","time":null,"uncertainty":null,"units":"percent"},"statement":"Gao et al. (2023) report that even the best models in their ELI5 evaluation lacked complete citation support 50% of the time.","support":[{"end":2929,"quote":"on the ELI5 dataset, even the best models lack complete citation support 50% of the time.","source_id":"src.citation.alce-gao-2023","source_sha256":"07b919b26ad93d2ab9a5162c0d5d15407e68d3ef3d3ed2c519a4012e0d6c1045","start":2840}],"target_id":"claim.citation.alce-eli5","target_kind":"node","target_sha256":"f98424e34c70bc31782ccb251ff475ee0ed2066043f7df373c49bd020bc232dc"}],"claim.citation.alce-metrics":[{"id":"assert.citation.alce-metrics","scope":{"assumptions":"Authors report correlation without a numerical coefficient in the retained abstract","population":"ALCE question-answering and citation evaluations","quantifiers":"three evaluation dimensions","time":null,"uncertainty":null,"units":null},"statement":"Gao et al. (2023) report that ALCE uses automatic metrics for fluency, correctness, and citation quality and that these metrics correlate strongly with human judgments.","support":[{"end":2687,"quote":"We develop automatic metrics along three dimensions—fluency, correctness, and citation quality—and demonstrate their strong correlation with human judgements.","source_id":"src.citation.alce-gao-2023","source_sha256":"07b919b26ad93d2ab9a5162c0d5d15407e68d3ef3d3ed2c519a4012e0d6c1045","start":2529}],"target_id":"claim.citation.alce-metrics","target_kind":"node","target_sha256":"ed55e1663a77a54545548ef0f1350e35af11245e6bf60e589e1a655b1ad5c82e"}],"claim.citation.claimbench-limits":[{"id":"assert.citation.claimbench-limits","scope":{"assumptions":"Limited to study tasks, prompts and tested models","population":"Six LLMs and over 300 claim-evidence pairs across research domains","quantifiers":"more than 300 pairs","time":null,"uncertainty":null,"units":"claim-evidence pairs"},"statement":"Javaji et al. (2025) report substantial limitations in processing scientific claim-evidence relationships when evaluating six LLMs on more than 300 claim-evidence pairs across multiple research domains.","support":[{"end":2733,"quote":"We systematically compare three approaches which are inspired by divide and conquer approaches, across six diverse LLMs, highlighting model-specific strengths and weaknesses in scientific comprehension.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":2531},{"end":2916,"quote":"Through evaluation involving over 300 claim-evidence pairs across multiple research domains, we reveal significant limitations in LLMs’ ability to process complex scientific content.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":2734}],"target_id":"claim.citation.claimbench-limits","target_kind":"node","target_sha256":"f13fd9c7b1f652b47e98db925631ea7492171be344af88503262ea67d213d3e8"}],"claim.citation.claimbench-prompting":[{"id":"assert.citation.claimbench-prompting","scope":{"assumptions":"Comparison under the tested prompting procedures","population":"Models and claim-evidence tasks in CLAIM-BENCH","quantifiers":"improvement and higher computational cost","time":null,"uncertainty":null,"units":null},"statement":"Javaji et al. (2025) report that three-pass and one-by-one prompting improve LLM claim-to-evidence linking in their evaluations, with increased computational cost.","support":[{"end":3330,"quote":"Furthermore, strategically designed three-pass and one-by-one prompting approaches significantly improve LLMs’ abilities to accurately link dispersed evidence with claims, although this comes at increased computational cost.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":3106}],"target_id":"claim.citation.claimbench-prompting","target_kind":"node","target_sha256":"ed14f1c891684b2619fb3fc7e6e0214114c9918c2919ddd6c63b6460b704458c"}],"claim.citation.contextcite-method":[{"id":"assert.citation.contextcite-method","scope":{"assumptions":"Method introduced in the paper; the retained abstract does not establish complete causal identification of internal mechanisms","population":"Generated statements and supplied context in the authors’ attribution setting","quantifiers":"method proposal","time":null,"uncertainty":null,"units":null},"statement":"Cohen-Wang et al. (2024) introduce ContextCite as a scalable method for attributing generated statements to supplied context, designed to operate on top of existing language models.","support":[{"end":849,"quote":"We then present ContextCite, a simple and scalable method for context attribution that can be applied on top of any existing language model.","source_id":"src.citation.contextcite-cohenwang-2024","source_sha256":"c339c49a83f1d7c7174f5d97837b52ef8f72a4d73902aa19684bbaed69d75daa","start":709}],"target_id":"claim.citation.contextcite-method","target_kind":"node","target_sha256":"5844a3b3e89dd054764412cb4177f49760586619b3007084b4a1dbe5e5ad6097"}],"claim.citation.contextdpo-gain":[{"id":"assert.citation.contextdpo-gain","scope":{"assumptions":"Baseline, scoring metric, and study conditions determine percentage improvements; detailed settings not present in retained abstract","population":"Popular open-source language models tested by the authors","quantifiers":"reported 35% to 280% improvement","time":null,"uncertainty":null,"units":"percent"},"statement":"Bi et al. (2025) report Context-DPO context-faithfulness improvements of 35% to 280% on popular open-source models in their experiments.","support":[{"end":2868,"quote":"Extensive experiments demonstrate that our Context-DPO significantly improves context-faithfulness, achieving 35% to 280% improvements on popular open-source models.","source_id":"src.citation.contextdpo-bi-2025","source_sha256":"051b06a5dbe9f9062c7fd899aa12579ae79ffc120a99aff77c942ff6d88e46db","start":2703}],"target_id":"claim.citation.contextdpo-gain","target_kind":"node","target_sha256":"b074d97eb1ee2ffb9d2fc80b2d1b8f3213903a6da76d49a09f1a09dc17efeab8"}],"claim.citation.contextprior-task":[{"id":"assert.citation.contextprior-task","scope":{"assumptions":"Proposed evaluation task; assessing internal knowledge does not prove direct observation of model knowledge use","population":"Context-Prior Augmented Citation Generation task","quantifiers":"five metrics over three aspects","time":null,"uncertainty":null,"units":"evaluation metrics"},"statement":"Shen et al. (2025) introduce a citation-generation task considering external context and internal model knowledge, evaluated with five metrics addressing helpfulness, citation faithfulness, and trustworthiness.","support":[{"end":2531,"quote":"requiring models to generate citations considering both external and internal knowledge while providing trustworthy references, with 5 evaluation metrics focusing on 3 aspects: answer helpfulness, citation faithfulness, and trustworthiness.","source_id":"src.citation.contextprior-shen-2025","source_sha256":"518eea16b8d667108d9155c586c27e7e5273e036541aec3f8efada0c4c0275d1","start":2291}],"target_id":"claim.citation.contextprior-task","target_kind":"node","target_sha256":"a9a27333a4b986dbd19ea8cb3310acdf93593169be1051182ed4720b7b10d941"}],"claim.citation.counterfactual-eval":[{"id":"assert.citation.counterfactual-eval","scope":{"assumptions":"Authors’ methodological argument, without quantitative validation in the retained abstract","population":"Autoregressive language models in the authors’ proposed evaluation","quantifiers":"methodological limitation and proposal","time":null,"uncertainty":null,"units":null},"statement":"Kamahi et al. (2024) argue that removing or corrupting input tokens creates out-of-distribution inputs for autoregressive language models and propose fluent in-distribution counterfactuals for evaluating attribution methods.","support":[{"end":2523,"quote":"Most faithfulness evaluation techniques corrupt or remove input tokens deemed important by a particular attribution (feature importance) method and observe the resulting change in the model’s output.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2324},{"end":2672,"quote":"However, for autoregressive language models, this approach creates out-of-distribution inputs due to their next-token prediction training objective.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2524},{"end":2950,"quote":"Our technique generates fluent, in-distribution counterfactuals, making the evaluation protocol more reliable.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2840}],"target_id":"claim.citation.counterfactual-eval","target_kind":"node","target_sha256":"914805d4391d74c29e2270e404380cb3f28cba70db97045f3241462d199c53a9"}],"claim.citation.faithfulrag-conflict":[{"id":"assert.citation.faithfulrag-conflict","scope":{"assumptions":"Proposed algorithmic strategy; retained abstract does not establish external replication","population":"Retrieval-augmented language-model generation with knowledge conflict","quantifiers":"framework proposal","time":null,"uncertainty":null,"units":null},"statement":"Zhang et al. (2025) propose FaithfulRAG, which identifies fact-level conflicts between retrieved context and model knowledge and uses a self-thinking process before generating responses.","support":[{"end":2430,"quote":"This issue is particularly severe in cases of knowledge conflict, where the retrieved context conflicts with the model’s parametric knowledge.","source_id":"src.citation.faithfulrag-zhang-2025","source_sha256":"d7d4f77a15d7e0991cdfafbe0a6309e4aa0002d2f20759d8f3445add7d836ad2","start":2288},{"end":3210,"quote":"Specifically, FaithfulRAG identifies conflicting knowledge at the fact level and designs a self-thinking process, allowing LLMs to reason about and integrate conflicting facts before generating responses.","source_id":"src.citation.faithfulrag-zhang-2025","source_sha256":"d7d4f77a15d7e0991cdfafbe0a6309e4aa0002d2f20759d8f3445add7d836ad2","start":3006}],"target_id":"claim.citation.faithfulrag-conflict","target_kind":"node","target_sha256":"c0620bfef9a19464205f39e808cd75cad88094d46c83ba409f8b521ac3ae86ef"}],"claim.citation.finegrained-labels":[{"id":"assert.citation.finegrained-labels","scope":{"assumptions":"Three-category support classification defined by study design","population":"Generated-text citations evaluated in the comparative framework","quantifiers":"three categories","time":null,"uncertainty":null,"units":"categorical support level"},"statement":"Zhang et al. (2024) propose evaluating citation faithfulness metrics against three support levels: full, partial, and no support.","support":[{"end":2792,"quote":"we propose a comparative evaluation framework that assesses the metric effectiveness in distinguishing citations between three-category support levels: full, partial, and no support.","source_id":"src.citation.finegrained-zhang-2024","source_sha256":"4d91c9fea74783c28975ba4813982935621849edd327470c88ca8630c2a82611","start":2610}],"target_id":"claim.citation.finegrained-labels","target_kind":"node","target_sha256":"f86f5255392cc3aaab09ef6e778f95162acdd8b0d28ffc4a8a96f343f6a860da"}],"claim.citation.finegrained-metrics":[{"id":"assert.citation.finegrained-metrics","scope":{"assumptions":"Limited to the evaluations performed in this paper","population":"Metrics and evaluations in the authors’ comparative framework","quantifiers":"no single metric consistently excels","time":null,"uncertainty":null,"units":null},"statement":"Zhang et al. (2024) report that no single citation-faithfulness metric consistently performs best across their fine-grained evaluations.","support":[{"end":3110,"quote":"Our results show no single metric consistently excels across all evaluations, revealing the complexity of assessing fine-grained support.","source_id":"src.citation.finegrained-zhang-2024","source_sha256":"4d91c9fea74783c28975ba4813982935621849edd327470c88ca8630c2a82611","start":2973}],"target_id":"claim.citation.finegrained-metrics","target_kind":"node","target_sha256":"99655de7004ffbcfbacfe29cdc7e1ded36fde4041df592e1ed5dd4ea88d38647"}],"claim.citation.mirage-attribution":[{"id":"assert.citation.mirage-attribution","scope":{"assumptions":"Saliency-based attribution is a method, not proof of complete causal dependence","population":"Retrieval-augmented question-answering systems in the authors’ method","quantifiers":"method proposal","time":null,"uncertainty":null,"units":null},"statement":"Qi et al. (2024) describe MIRAGE as identifying context-sensitive answer tokens and attributing them to retrieved documents using saliency methods.","support":[{"end":2712,"quote":"MIRAGE detects context-sensitive answer tokens and pairs them with retrieved documents contributing to their prediction via saliency methods.","source_id":"src.citation.mirage-qi-2024","source_sha256":"05445789343607d347d73895c439110f5208cb44c6e904f71e4d0695e0765d71","start":2571}],"target_id":"claim.citation.mirage-attribution","target_kind":"node","target_sha256":"801b5f5fa8889b30f4c19e4fb0ed282ac36e5ce18e18b5076808688ec14aa1ea"}],"claim.des-y6-weak-evolving-dark-energy-preference-reported":[{"id":"assert.claim.des-y6-weak-evolving-dark-energy-preference-reported.v1","scope":{"assumptions":"The analysis assumes a time-dependent dark-energy equation of state and uses the probe combinations and omission tests described by the DES Collaboration.","population":"The dark-energy probe combinations analyzed in the full six-year Dark Energy Survey study described by the retained source.","quantifiers":"Restricted to the analyzed probe combinations in the retained source; the reported deviation significance spans 2.3 to 3.2 sigma across the stated leave-one-probe-out tests.","time":"The retained source reports the full six-year Dark Energy Survey analysis; atlas chronology is left unresolved under era=undated.","uncertainty":"The collaboration explicitly describes the result as a weak preference; the represented claim does not assert discovery of evolving dark energy or falsification of a cosmological constant.","units":"sigma significance"},"statement":"The DES Collaboration reported that its analyzed probe combinations supported a weak preference for evolving dark energy, with the significance of deviation from a cosmological constant ranging from 2.3 to 3.2 sigma when individual probes were left out.","support":[{"end":4499,"quote":"We systematically investigate the impact of leaving out each one of the probes and find that the significance of the deviation from a cosmological constant ranges from 2.3 to 3.2$\\sigma$, with best-fit parameters consistently in the region $w_0 >-1$ and $w_a <0$.","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":4236},{"end":4783,"quote":"These results support the weak preference for evolving dark energy reported by several recent cosmological analyses.","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":4667},{"end":5103,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":5041}],"target_id":"claim.des-y6-weak-evolving-dark-energy-preference-reported","target_kind":"node","target_sha256":"a0427585bb444d1f3c2eb4d59d00020ceedca3c4b9dc07c428e988a653cf0c95"}],"claim.desi-dr2-bao-consistency-reported":[{"id":"assert.claim.desi-dr2-bao-consistency-reported-v4","scope":{"assumptions":"Consistency and matching are attributed only to the DESI Collaboration's stated comparisons in the retained source; the supernova comparison is limited to the same redshift range.","population":"DESI DR2 BAO results and their reported comparisons with DESI DR1, SDSS, and recent supernova compilations over the same redshift range.","quantifiers":"Restricted to the reported DESI DR2 comparisons with DESI DR1 and SDSS and to the stated supernova distance-redshift relationship over the same redshift range.","time":"The reported DESI DR2 BAO measurements are based on three years of operation. Atlas chronological placement remains unresolved under era=undated.","uncertainty":"This source-attributed comparison does not assert agreement among all cosmological datasets, establish a unique cosmological model, resolve the nature of dark energy, or claim current-frontier standing.","units":null},"statement":"The retained DESI DR2 source reports that its BAO results are consistent with DESI DR1 and SDSS, and that their distance-redshift relationship matches recent supernova compilations over the same redshift range.","support":[{"end":3594,"quote":"We present baryon acoustic oscillation (BAO) measurements from more than 14 million galaxies and quasars drawn from the Dark Energy Spectroscopic Instrument (DESI) Data Release 2 (DR2), based on three years of operation.","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3374},{"end":3923,"quote":"The DR2 BAO results are consistent with DESI DR1 and SDSS, and their distance-redshift relationship matches those from recent compilations of supernovae (SNe) over the same redshift range.","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3735},{"end":5524,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":5462}],"target_id":"claim.desi-dr2-bao-consistency-reported","target_kind":"node","target_sha256":"92676e2c79966b53dde93157e4ec4cfc396dc0a2e302132081dabf0558879292"}],"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported":[{"id":"assert.claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported.v1","scope":{"assumptions":"The statement is conditional on the DESI DR2 BAO cosmological analysis and its comparison with CMB-determined parameters described by the collaboration.","population":"The DESI DR2 baryon acoustic oscillation measurements and the cosmological parameter comparison described in the retained source.","quantifiers":"Restricted to the reported DESI DR2 BAO results and the stated 2.3-sigma BAO-CMB parameter tension.","time":"The retained source reports DESI DR2 results based on three years of operation; atlas chronology is left unresolved under era=undated.","uncertainty":"The source characterizes the tension as mild and does not establish that flat LambdaCDM is falsified or that a dynamical-dark-energy interpretation is uniquely correct.","units":"sigma significance"},"statement":"DESI reported that its DR2 BAO results were well described by a flat LambdaCDM model while the parameters preferred by BAO were in mild 2.3-sigma tension with those determined from the CMB.","support":[{"end":4236,"quote":"The results are well described by a flat $\\Lambda$CDM model, but the parameters preferred by BAO are in mild, $2.3\\sigma$ tension with those determined from the cosmic microwave background (CMB), although the DESI results are consistent with the acoustic angular scale $\\theta_*$ that is well-measured by Planck.","source_id":"src.physical.desi-dr2-dark-energy-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3924},{"end":5524,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.physical.desi-dr2-dark-energy-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":5462}],"target_id":"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported","target_kind":"node","target_sha256":"fd2026dbb9e169a007f8e03adb7be01d402116a38b3f8f37bfbbbae4f4b44a18"}],"claim.experimental-method.nist-balanced-blocks":[{"id":"assertion.experimental-method.nist-balanced-blocks","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST definition of blocking","quantifiers":"Equal counts at nuisance-factor levels","time":null,"uncertainty":"Applies to its balanced design description.","units":null},"statement":"NIST defines a blocking factor by equal occurrence of each primary-factor level at each nuisance-factor level.","support":[{"end":1661,"quote":"A nuisance factor is used as a blocking factor if every level of\nthe primary factor occurs the same number of times with each level of\nthe nuisance factor","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1507}],"target_id":"claim.experimental-method.nist-balanced-blocks","target_kind":"node","target_sha256":"939df796b5484febfad96017716733236b22cecd4a4a177b397dcd93d8e110f9"}],"claim.experimental-method.nist-controlled-blocking":[{"id":"assertion.experimental-method.nist-controlled-blocking","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST randomized block design","quantifiers":"Within each block","time":null,"uncertainty":"Applicable to controllable nuisance factors.","units":null},"statement":"NIST describes blocking as holding nuisance factors constant inside homogeneous blocks while varying the factor of interest.","support":[{"end":1258,"quote":"The basic concept\nis to create homogeneous blocks in which the nuisance factors are held\nconstant and the factor of interest is allowed to vary.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1114}],"target_id":"claim.experimental-method.nist-controlled-blocking","target_kind":"node","target_sha256":"48d5b635b456c89fbdb7564f416445bb25bec8828316779f749ac1c22bf96fc1"}],"claim.experimental-method.nist-randomization":[{"id":"assertion.experimental-method.nist-randomization","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST design guidance","quantifiers":"A few important factors; remaining factors","time":null,"uncertainty":"Recommendation, not a universal measured effect.","units":null},"statement":"NIST recommends blocking important nuisance variables and randomizing to reduce contamination by remaining nuisance variables.","support":[{"end":2113,"quote":"Blocking is used to remove the effects of a few of the most important\nnuisance variables.  Randomization is then used to reduce the\ncontaminating effects of the remaining nuisance variables.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1923}],"target_id":"claim.experimental-method.nist-randomization","target_kind":"node","target_sha256":"51acefcb18f12cc093e1fe46cac6b8caaa07e2ff3379450cf21747752ce45556"}],"claim.experimental-method.nist-wafer-example":[{"id":"assertion.experimental-method.nist-wafer-example","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST illustrative semiconductor experiment","quantifiers":"4 dosages; 3 furnace runs","time":null,"uncertainty":"Proposed allocation, not an observed result.","units":"wafers; furnace runs"},"statement":"NIST illustrates a hypothetical design putting four wafers with different dosages in each of three furnace runs.","support":[{"end":4525,"quote":"The blocked way to run this\nexperiment, assuming you can convince manufacturing to let you put four\nexperimental wafers in a furnace run, would be to put four wafers with\ndifferent dosages in each of three furnace runs.  The only randomization\nwould be choosing which of the three wafers with dosage 1 would go into\nfurnace run 1, and similarly for the wafers with dosages 2, 3 and 4.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":4141}],"target_id":"claim.experimental-method.nist-wafer-example","target_kind":"node","target_sha256":"4bbea5d1564649eb93865121c14c0d58dc1a7bce093902bcd1156652a62526de"}],"claim.experimental-method.nosek-all-results":[{"id":"assertion.experimental-method.nosek-all-results","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Research-program methodology discussion","quantifiers":"All planned outcomes","time":"2018","uncertainty":"No universal effect-size estimate.","units":null},"statement":"Nosek et al. argue that reporting all planned outcomes matters because preregistration alone cannot eliminate multiple-comparison and selective-reporting problems.","support":[{"end":32609,"quote":"Not only is it essential that the analysis plan be defined blind to the research outcomes, all outcomes of that analysis plan must be reported to avoid the problem of selective reporting.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":32422},{"end":33069,"quote":"Preregistration does not eliminate the challenge of multiple comparisons or selective reporting across studies, but it does make it possible to effectively correct for multiple comparisons with full reporting.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":32860}],"target_id":"claim.experimental-method.nosek-all-results","target_kind":"node","target_sha256":"280fa2c9423a3f04ced87f2196d7ec6522bb887ce9c77133b9f5bf595fd1a15a"}],"claim.experimental-method.nosek-decisiontree":[{"id":"assertion.experimental-method.nosek-decisiontree","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Hypothetical stopping-rule example","quantifiers":"Threshold <0.05","time":"2018","uncertainty":"Hypothetical risk, not observed misuse frequency.","units":"p-value"},"statement":"Nosek et al. warn that preregistered decision trees can still embed bias, such as stopping after achieving p < 0.05.","support":[{"end":25701,"quote":"However, it is possible to preregister biases into decision trees. For example, one could preregister testing a sequence of exclusion rules and stopping when one achieves\nP\n< 0.05. On the positive side, this misbehavior is highly detectable; on the negative side, it invalidates the diagnosticity of statistical inference. Preregistration does not eliminate the possibility of poor statistical practices, but it does make them detectable.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":25263}],"target_id":"claim.experimental-method.nosek-decisiontree","target_kind":"node","target_sha256":"de1eb72185bf2b64e2bd15564dc57b4e07398f052115c9278df575089815744b"}],"claim.experimental-method.nosek-forking":[{"id":"assertion.experimental-method.nosek-forking","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NHST postdiction in the 2018 article","quantifiers":"No prevalence estimate","time":"2018","uncertainty":"Methodological warning, not a measured prevalence.","units":null},"statement":"Nosek et al. warn that postdictive NHST analyses may yield p-values of unknown diagnosticity.","support":[{"end":15186,"quote":"This leaves the observed\nP\nvalues with unknown diagnosticity, rendering them uninterpretable. In other words, NHST cannot be used with confidence for postdiction.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":15024}],"target_id":"claim.experimental-method.nosek-forking","target_kind":"node","target_sha256":"428b80f917ac0ecff563095e7e5e22e72875455bc1acef4ffd92c41b90246d5e"}],"claim.experimental-method.nosek-holdout":[{"id":"assertion.experimental-method.nosek-holdout","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Proposed blinded holdout strategy","quantifiers":"Two data partitions","time":"2018","uncertainty":"Requires genuine holdout blinding.","units":null},"statement":"Nosek et al. describe splitting a dataset, sealing the holdout and preregistering exploration-derived predictions before unsealing it.","support":[{"end":35744,"quote":"In a process known as cross-validation, the dataset is split in two.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":35676},{"end":36067,"quote":"Sealing a dataset and preregistering the outcomes of the discovery process before unsealing converts postdictions from the initial dataset to predictions for the holdout dataset.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":35889}],"target_id":"claim.experimental-method.nosek-holdout","target_kind":"node","target_sha256":"57c01e6254ee5852e96aefbbee24dfbab8690d207cc3b970d97b09851c075750"}],"claim.experimental-method.nosek-preexisting":[{"id":"assertion.experimental-method.nosek-preexisting","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Preexisting datasets in the 2018 article","quantifiers":"Conditional on blinding","time":"2018","uncertainty":"Risk varies with knowledge of prior observations.","units":null},"statement":"Nosek et al. explain that tests of predictions using preexisting data depend on blinded analysis decisions, which face risks when data have already been observed.","support":[{"end":27103,"quote":"The extent to which testing predictions is possible on preexisting data depends on whether decisions about the analysis plan are blind to the data.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":26956},{"end":27473,"quote":"However, once the data have been observed, there are inevitable risks for blinding.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":27390}],"target_id":"claim.experimental-method.nosek-preexisting","target_kind":"node","target_sha256":"0736e5318e4fe920a4c02bc169d72bb499cc31d3fab260245a7e22b66c1deef8"}],"claim.experimental-method.nosek-prereg-evidence":[{"id":"assertion.experimental-method.nosek-prereg-evidence","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Authors' 2018 evidence assessment","quantifiers":"Evidence assessment as of 2018","time":"2018","uncertainty":"Time-bound; says nothing about later studies.","units":null},"statement":"Nosek et al. (2018) report theoretical and correlational support for preregistration but insufficient experimental evidence of a reproducibility advantage.","support":[{"end":18160,"quote":"We say “in principle” because the case for preregistration is theoretically strong as a matter of inductive inference and empirically bolstered by some correlational evidence. However, there is not yet sufficient experimental evidence establishing its superiority for reproducibility.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":17876}],"target_id":"claim.experimental-method.nosek-prereg-evidence","target_kind":"node","target_sha256":"e78745768c9278d8762845476c5c924dd24d6c3726694c02b103932ac3a241f1"}],"claim.experimental-method.nosek-preregistration":[{"id":"assertion.experimental-method.nosek-preregistration","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"2018 preregistration article","quantifiers":"Before observing outcomes","time":"2018","uncertainty":"Definition, not a measured outcome.","units":null},"statement":"Nosek et al. (2018) define analysis preregistration as committing to analytic steps without prior knowledge of outcomes.","support":[{"end":17102,"quote":"Preregistration of an analysis plan is committing to analytic steps without advance knowledge of the research outcomes.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":16983}],"target_id":"claim.experimental-method.nosek-preregistration","target_kind":"node","target_sha256":"bc563358a29c028dafcf2fcb8559994c62e0c1f5d0f43ce2a47aa98eb9d8db67"}],"claim.experimental-method.nosek-registered-reports":[{"id":"assertion.experimental-method.nosek-registered-reports","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Registered Reports editorial process in 2018","quantifiers":"Two review stages","time":"2018","uncertainty":"Described workflow, not universal journal policy.","units":null},"statement":"Nosek et al. describe Registered Reports as pre-outcome methodological peer review with in-principle acceptance, followed by review of execution and adherence.","support":[{"end":44123,"quote":"With Registered Reports, authors submit their research question and methodology to the journal for peer review before observing the outcomes of the research. If reviewers agree that the question is sufficiently important and the methodology to test it is of sufficiently high quality, then the paper is given in-principle acceptance.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":43790},{"end":44394,"quote":"At second-stage review, reviewers do not evaluate the perceived importance of the outcomes. Rather, they evaluate the quality of study execution and adherence to the preregistered plan.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":44209}],"target_id":"claim.experimental-method.nosek-registered-reports","target_kind":"node","target_sha256":"b81478338f5f842bcb612bc71e70912e909580e35472a3b70893c6a267f61229"}],"claim.fermi-gbm-detection-coverage":[{"id":"assertion.fermi-gbm-detection-coverage","scope":{"assumptions":"The instrument configuration and approximate annual detection rate are taken from NASA's description.","population":"Fermi Gamma-ray Burst Monitor instrumentation and its reported gamma-ray burst detections","quantifiers":"12 sodium iodide detectors and 2 bismuth germinate detectors","time":"Period represented by the NASA source; no explicit annual reference interval in the excerpt","uncertainty":"Approximately 240 detections per year; the passage does not establish a current 2026 operational rate.","units":"14 detectors; approximately 240 bursts/year; 8 keV to 40 MeV"},"statement":"NASA describes the Fermi Gamma-ray Burst Monitor as having 14 detectors covering the unobscured sky, detecting approximately 240 gamma-ray bursts per year across an energy range of 8 keV to 40 MeV.","support":[{"end":3476,"quote":"The Gamma-ray Burst Monitor (GBM) has 14 detectors (12 lower-energy sodium iodide crystal scintillators, 2 higher-energy bismuth germinate scintillators) that together cover the full unocculted sky and detect ~240 bursts per year with spectral coverage from 8 keV - 40 MeV.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":3203}],"target_id":"claim.fermi-gbm-detection-coverage","target_kind":"node","target_sha256":"c19349843671a7cf8e60fa0e8b193e5f9051d5dfd4b9a86616c4ddc266806fe0"}],"claim.frontier.arxiv-2604-22459":[{"id":"assertion.claim.frontier.arxiv-2604-22459","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2604.22459","quantifiers":"Only what the quoted sentence states","time":"2026-04-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2604.22459 \"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic\" (CC BY 4.0, submitted 2026-04-24) reports: \"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.\"","support":[{"end":2454,"quote":"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":2343},{"end":989,"quote":"<created>2026-04-24</created>","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":960},{"end":1635,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":1573}],"target_id":"claim.frontier.arxiv-2604-22459","target_kind":"node","target_sha256":"2902e92b6a0141b15413a099e2358d571f74da41017d125410afe02fc8feefd5"}],"claim.frontier.arxiv-2607-03479":[{"id":"assertion.claim.frontier.arxiv-2607-03479","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.03479","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.03479 \"The multilinear forms Cayley graph and the eigenvalue method for tensor codes\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.\"","support":[{"end":2905,"quote":"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":2723},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":1048},{"end":2025,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":1963}],"target_id":"claim.frontier.arxiv-2607-03479","target_kind":"node","target_sha256":"b0c03a5126d1b2c3feb93b2092dd4bcf890b25f87ecf045c0d97e20c9e6ab7b4"}],"claim.frontier.arxiv-2607-05485":[{"id":"assertion.claim.frontier.arxiv-2607-05485","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.05485","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.05485 \"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.\"","support":[{"end":2194,"quote":"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":2102},{"end":1088,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":1059},{"end":1967,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":1905}],"target_id":"claim.frontier.arxiv-2607-05485","target_kind":"node","target_sha256":"44b95790ed2e8f4eee9b599f1a63fdabff9040e3da919d49c6caa4f3c6e5fe3b"}],"claim.frontier.arxiv-2607-05687":[{"id":"assertion.claim.frontier.arxiv-2607-05687","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.05687","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.05687 \"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.\"","support":[{"end":2572,"quote":"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":2368},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":1008},{"end":1943,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":1881}],"target_id":"claim.frontier.arxiv-2607-05687","target_kind":"node","target_sha256":"c3bbe5126f3550eeaeabc47ca3b89fed690b213772890cc080fb807832eeb1fb"}],"claim.frontier.arxiv-2607-06237":[{"id":"assertion.claim.frontier.arxiv-2607-06237","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.06237","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.06237 \"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems\" (CC BY 4.0, submitted 2026-07-24) reports: \"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.\"","support":[{"end":3574,"quote":"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":3416},{"end":1033,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":1004},{"end":1829,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":1767}],"target_id":"claim.frontier.arxiv-2607-06237","target_kind":"node","target_sha256":"97e291662c0b134cbd315a1e93621558c10ba6a8c05fea30327497589417222e"}],"claim.frontier.arxiv-2607-10561":[{"id":"assertion.claim.frontier.arxiv-2607-10561","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.10561","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.10561 \"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.\"","support":[{"end":2187,"quote":"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1993},{"end":1140,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1111},{"end":1734,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1672}],"target_id":"claim.frontier.arxiv-2607-10561","target_kind":"node","target_sha256":"5974c639bde750e056090e12c0792f4f1ff0564f5eb34480df4a23bf7fc8998b"}],"claim.frontier.arxiv-2607-11988":[{"id":"assertion.claim.frontier.arxiv-2607-11988","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.11988","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.11988 \"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory\" (CC BY 4.0, submitted 2026-07-31) reports: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","support":[{"end":2073,"quote":"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1881},{"end":1173,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1144},{"end":1679,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1617}],"target_id":"claim.frontier.arxiv-2607-11988","target_kind":"node","target_sha256":"b30c08878e6d2f9dfbe1bb6d430a58f13d85ad84867f2534340f1b6ef1a99a09"}],"claim.frontier.arxiv-2607-12128":[{"id":"assertion.claim.frontier.arxiv-2607-12128","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.12128","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.12128 \"Categorical Tensor-Graph Semantics for Quantum Algorithms\" (CC BY 4.0, submitted 2026-07-27) reports: \"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.\"","support":[{"end":3031,"quote":"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":2932},{"end":1132,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":1103},{"end":2087,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":2025}],"target_id":"claim.frontier.arxiv-2607-12128","target_kind":"node","target_sha256":"760d4551719f2933a8791651dc8981172a51955a7cc76155fdb6df27403273a1"}],"claim.frontier.arxiv-2607-12710":[{"id":"assertion.claim.frontier.arxiv-2607-12710","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.12710","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.12710 \"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.\"","support":[{"end":1761,"quote":"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1606},{"end":1055,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1026},{"end":1536,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1474}],"target_id":"claim.frontier.arxiv-2607-12710","target_kind":"node","target_sha256":"95763969701fe9f39dc29ab62142d132b58ac56e963b03c2146c27deea5b9745"}],"claim.frontier.arxiv-2607-13775":[{"id":"assertion.claim.frontier.arxiv-2607-13775","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.13775","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.13775 \"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime\" (CC0 1.0, submitted 2026-07-28) reports: \"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.\"","support":[{"end":2694,"quote":"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":2502},{"end":1084,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":1055},{"end":1719,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":1651}],"target_id":"claim.frontier.arxiv-2607-13775","target_kind":"node","target_sha256":"0a7c2babd9cb8e6cf28aa15bbe63e55f41355b126932388466bc84dcb3877073"}],"claim.frontier.arxiv-2607-13855":[{"id":"assertion.claim.frontier.arxiv-2607-13855","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.13855","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.13855 \"Inferentialist Game Semantics (Extended Abstract)\" (CC BY 4.0, submitted 2026-07-22) reports: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","support":[{"end":2961,"quote":"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":2746},{"end":1033,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":1004},{"end":1780,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":1718}],"target_id":"claim.frontier.arxiv-2607-13855","target_kind":"node","target_sha256":"63bd9f7cb7fe0e014bdb927b6a643d6b39dff8de8cd7e9769a686bc4b95e64b4"}],"claim.frontier.arxiv-2607-15029":[{"id":"assertion.claim.frontier.arxiv-2607-15029","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15029","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15029 \"Towards realistic large random models of labeled transition systems and their 0-1 laws\" (CC BY 4.0, submitted 2026-07-21) reports: \"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).\"","support":[{"end":2622,"quote":"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":2398},{"end":1077,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":1048},{"end":1562,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":1500}],"target_id":"claim.frontier.arxiv-2607-15029","target_kind":"node","target_sha256":"d2a09d9bce87ded6cd9d6ef864df336eac85311751b2a3489aeb191d767ce429"}],"claim.frontier.arxiv-2607-15664":[{"id":"assertion.claim.frontier.arxiv-2607-15664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15664","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15664 \"Semantics for the minimal well-determined logic\" (CC0 1.0, submitted 2026-07-17) reports: \"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.\"","support":[{"end":2715,"quote":"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":2519},{"end":993,"quote":"<created>2026-07-17</created>","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":964},{"end":1573,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":1505}],"target_id":"claim.frontier.arxiv-2607-15664","target_kind":"node","target_sha256":"dd478979ad1495825c4c4005ae4d3fc4baad13746d78dd80909e4a208c27eb4b"}],"claim.frontier.arxiv-2607-15958":[{"id":"assertion.claim.frontier.arxiv-2607-15958","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15958","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15958 \"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle\" (CC BY 4.0, submitted 2026-07-17) reports: \"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.\"","support":[{"end":2552,"quote":"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":2314},{"end":993,"quote":"<created>2026-07-17</created>","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":964},{"end":1935,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":1873}],"target_id":"claim.frontier.arxiv-2607-15958","target_kind":"node","target_sha256":"99a8429220fc68f6f5c8c691060184437510c7b27fe78be042b3a41f86e2b9cb"}],"claim.frontier.arxiv-2607-16724":[{"id":"assertion.claim.frontier.arxiv-2607-16724","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.16724","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.16724 \"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers\" (CC BY 4.0, submitted 2026-07-24) reports: \"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.\"","support":[{"end":2953,"quote":"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":2770},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":964},{"end":1522,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":1460}],"target_id":"claim.frontier.arxiv-2607-16724","target_kind":"node","target_sha256":"5b0e117ec7b7d8613093df4524d8ec78b3eaa525dc35ef42f38483aec6233c8e"}],"claim.frontier.arxiv-2607-16747":[{"id":"assertion.claim.frontier.arxiv-2607-16747","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.16747","quantifiers":"Only what the quoted sentence states","time":"2026-07-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.16747 \"More on the Boolean Prime Ideal Theorem\" (CC BY 4.0, submitted 2026-07-18) reports: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","support":[{"end":1792,"quote":"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":1627},{"end":993,"quote":"<created>2026-07-18</created>","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":964},{"end":1604,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":1542}],"target_id":"claim.frontier.arxiv-2607-16747","target_kind":"node","target_sha256":"76c0c4f006004b63dd18d2532f3eeae251b7ead0eab61f56d845afc3bcb304e7"}],"claim.frontier.arxiv-2607-18525":[{"id":"assertion.claim.frontier.arxiv-2607-18525","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18525","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18525 \"Regular Ultrametric Skeletons\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","support":[{"end":2043,"quote":"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":1811},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":964},{"end":1514,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":1452}],"target_id":"claim.frontier.arxiv-2607-18525","target_kind":"node","target_sha256":"d10a1cbce5f15a9631ea81f36a44b790dced8a854ce2bc77cb7d719c3651cd19"}],"claim.frontier.arxiv-2607-18781":[{"id":"assertion.claim.frontier.arxiv-2607-18781","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18781","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18781 \"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization\" (CC BY 4.0, submitted 2026-07-21) reports: \"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.\"","support":[{"end":2657,"quote":"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":2455},{"end":993,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":964},{"end":1504,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":1442}],"target_id":"claim.frontier.arxiv-2607-18781","target_kind":"node","target_sha256":"6555d5385ffe3e08c74e69d4d9adc8305db5541b263e78df7f83f1cff7f96f13"}],"claim.frontier.arxiv-2607-18942":[{"id":"assertion.claim.frontier.arxiv-2607-18942","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18942","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18942 \"Bounded elementary extensions of trees with unbounded paths\" (CC BY 4.0, submitted 2026-07-21) reports: \"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.\"","support":[{"end":2313,"quote":"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":2175},{"end":1033,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":1004},{"end":1582,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":1520}],"target_id":"claim.frontier.arxiv-2607-18942","target_kind":"node","target_sha256":"2234a3e297d4ac9435ba3f211e832985a042719225bf03aa9d9371e53789a186"}],"claim.frontier.arxiv-2607-19080":[{"id":"assertion.claim.frontier.arxiv-2607-19080","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19080","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19080 \"The Influence Function of Transport-based Quantiles\" (CC BY 4.0, submitted 2026-07-21) reports: \"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.\"","support":[{"end":2571,"quote":"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":2304},{"end":1081,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":1052},{"end":1983,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":1921}],"target_id":"claim.frontier.arxiv-2607-19080","target_kind":"node","target_sha256":"cd9ae3ea6c2485d738685127c5340155d369ae077889af33aec1b527875d055d"}],"claim.frontier.arxiv-2607-19188":[{"id":"assertion.claim.frontier.arxiv-2607-19188","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19188","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19188 \"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques\" (CC BY 4.0, submitted 2026-07-21) reports: \"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.\"","support":[{"end":2514,"quote":"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":2273},{"end":1077,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":1048},{"end":1775,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":1713}],"target_id":"claim.frontier.arxiv-2607-19188","target_kind":"node","target_sha256":"3e47aff17c8ad4abb2928717e41554da3859e5bb7454302eed68ebd082c22143"}],"claim.frontier.arxiv-2607-19220":[{"id":"assertion.claim.frontier.arxiv-2607-19220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19220","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19220 \"Quarkyonic Stars with Strangeness\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","support":[{"end":3235,"quote":"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":2973},{"end":1140,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":1111},{"end":2415,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":2353}],"target_id":"claim.frontier.arxiv-2607-19220","target_kind":"node","target_sha256":"842fdf205e0d891e44a403e4a27aa6a4787255be4fa30700cdd652348320c679"}],"claim.frontier.arxiv-2607-19233":[{"id":"assertion.claim.frontier.arxiv-2607-19233","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19233","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19233 \"Vortex-sheet desingularization for three-dimensional ideal fluids\" (CC BY 4.0, submitted 2026-07-21) reports: \"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.\"","support":[{"end":1920,"quote":"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":1815},{"end":993,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":964},{"end":1792,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":1730}],"target_id":"claim.frontier.arxiv-2607-19233","target_kind":"node","target_sha256":"4e92a4b625dc94bb33c85c028d394b917ba0e1b6f3c3454e7788370a18a420de"}],"claim.frontier.arxiv-2607-19272":[{"id":"assertion.claim.frontier.arxiv-2607-19272","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19272","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19272 \"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations\" (CC BY 4.0, submitted 2026-07-21) reports: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","support":[{"end":2213,"quote":"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":2039},{"end":1037,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":1008},{"end":1815,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":1753}],"target_id":"claim.frontier.arxiv-2607-19272","target_kind":"node","target_sha256":"c4503e90dca7d56af25048e8e725f9757a3b0b31cfe61d2b94738c4f725792ca"}],"claim.frontier.arxiv-2607-19285":[{"id":"assertion.claim.frontier.arxiv-2607-19285","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19285","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19285 \"Compactification of the fifth Painlevé foliation\" (CC0 1.0, submitted 2026-07-21) reports: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","support":[{"end":1824,"quote":"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1670},{"end":1040,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1011},{"end":1478,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1410}],"target_id":"claim.frontier.arxiv-2607-19285","target_kind":"node","target_sha256":"9fd730782670feb80201b45fc0bd5cf8b405d499af0d924b02074f970ceec403"}],"claim.frontier.arxiv-2607-19654":[{"id":"assertion.claim.frontier.arxiv-2607-19654","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19654","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19654 \"Derived representation schemes with arbitrary coefficients and associative smoothness\" (CC BY 4.0, submitted 2026-07-22) reports: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","support":[{"end":1946,"quote":"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1793},{"end":1125,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1096},{"end":1646,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1584}],"target_id":"claim.frontier.arxiv-2607-19654","target_kind":"node","target_sha256":"65e8359441c6583c82ae7dbb71d80427dfe53f01c289f37424e74d75520ed916"}],"claim.frontier.arxiv-2607-19946":[{"id":"assertion.claim.frontier.arxiv-2607-19946","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19946","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19946 \"The chromatic number of Euclidean space with dense color classes\" (CC BY 4.0, submitted 2026-07-22) reports: \"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.\"","support":[{"end":2159,"quote":"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":1986},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":964},{"end":1676,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":1614}],"target_id":"claim.frontier.arxiv-2607-19946","target_kind":"node","target_sha256":"8e7e6ebeddf6a929ed8dfc3f8c254a33878b0a2560077756181ea3e4203ea524"}],"claim.frontier.arxiv-2607-20049":[{"id":"assertion.claim.frontier.arxiv-2607-20049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20049","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20049 \"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots\" (CC BY 4.0, submitted 2026-07-23) reports: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","support":[{"end":2074,"quote":"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1913},{"end":1081,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1052},{"end":1720,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1658}],"target_id":"claim.frontier.arxiv-2607-20049","target_kind":"node","target_sha256":"397193d7fe7728ad2e4b2c92654aa47153d96a4ec1d0a9ed2dadfe6b30de0567"}],"claim.frontier.arxiv-2607-20063":[{"id":"assertion.claim.frontier.arxiv-2607-20063","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20063","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20063 \"Null distance on cosmological spacetimes and monotone convergence\" (CC BY 4.0, submitted 2026-07-22) reports: \"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.\"","support":[{"end":3072,"quote":"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":2793},{"end":1082,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":1053},{"end":1799,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":1737}],"target_id":"claim.frontier.arxiv-2607-20063","target_kind":"node","target_sha256":"2e9b374060183c4b50bfb7654f26144b958654955494fb2f1d538ffe59832272"}],"claim.frontier.arxiv-2607-20098":[{"id":"assertion.claim.frontier.arxiv-2607-20098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20098","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20098 \"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case\" (CC BY 4.0, submitted 2026-07-22) reports: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","support":[{"end":2396,"quote":"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":2174},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":964},{"end":1716,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":1654}],"target_id":"claim.frontier.arxiv-2607-20098","target_kind":"node","target_sha256":"95a2cedfa4bbef948da1e9bf7ecb53d192171b4f85d8db62a76a6c3c188cf7f2"}],"claim.frontier.arxiv-2607-20161":[{"id":"assertion.claim.frontier.arxiv-2607-20161","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20161","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20161 \"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","support":[{"end":2459,"quote":"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":2202},{"end":1037,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":1008},{"end":1776,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":1714}],"target_id":"claim.frontier.arxiv-2607-20161","target_kind":"node","target_sha256":"37243d0b45af27f371cd8245ac4a80162765a48b5bcb0043b8c826106cf99fbb"}],"claim.frontier.arxiv-2607-20164":[{"id":"assertion.claim.frontier.arxiv-2607-20164","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20164","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20164 \"Law of iterated logarithm for inner functions\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.\"","support":[{"end":2133,"quote":"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":2007},{"end":1081,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":1052},{"end":1779,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":1717}],"target_id":"claim.frontier.arxiv-2607-20164","target_kind":"node","target_sha256":"b3ea214f162911c11b50b0e7fefcbb0d835156b5ab25fb4ac8b61a245bf1c683"}],"claim.frontier.arxiv-2607-20407":[{"id":"assertion.claim.frontier.arxiv-2607-20407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20407","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20407 \"Uncountable Abelian Group C*-algebras Fail the Lifting Property\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.\"","support":[{"end":1691,"quote":"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":1551},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":964},{"end":1528,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":1466}],"target_id":"claim.frontier.arxiv-2607-20407","target_kind":"node","target_sha256":"7aab736c3ac77815c528df639644b2b030053ea6272aefa6f29feb86dbdb0684"}],"claim.frontier.arxiv-2607-20677":[{"id":"assertion.claim.frontier.arxiv-2607-20677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20677","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20677 \"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.\"","support":[{"end":2499,"quote":"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":2389},{"end":1037,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":1008},{"end":1966,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":1904}],"target_id":"claim.frontier.arxiv-2607-20677","target_kind":"node","target_sha256":"872f7f5041897e6a7164798829a30b9a8636066ce8c9b7a48fb4c960c944a406"}],"claim.frontier.arxiv-2607-21030":[{"id":"assertion.claim.frontier.arxiv-2607-21030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21030","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21030 \"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.\"","support":[{"end":2817,"quote":"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":2626},{"end":1040,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":1011},{"end":1617,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":1555}],"target_id":"claim.frontier.arxiv-2607-21030","target_kind":"node","target_sha256":"db7b0f685b5d642ab59ba8803ce0ab3ec989fe330a5d76651c868b7701842d39"}],"claim.frontier.arxiv-2607-21112":[{"id":"assertion.claim.frontier.arxiv-2607-21112","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21112","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21112 \"Exact ensemble controllability for neural differential equations via neural interpolation\" (CC BY 4.0, submitted 2026-07-23) reports: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","support":[{"end":2459,"quote":"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":2262},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":964},{"end":1496,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":1434}],"target_id":"claim.frontier.arxiv-2607-21112","target_kind":"node","target_sha256":"bb581fa14e3776f72cf3f47386c6ecf41404ef6e69f1e8ae464405a9a760ae07"}],"claim.frontier.arxiv-2607-21167":[{"id":"assertion.claim.frontier.arxiv-2607-21167","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21167","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21167 \"Differentiability of the operator norm on $\\ell_p$ spaces\" (CC BY 4.0, submitted 2026-07-23) reports: \"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.\"","support":[{"end":2078,"quote":"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":1878},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":964},{"end":1698,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":1636}],"target_id":"claim.frontier.arxiv-2607-21167","target_kind":"node","target_sha256":"a6448373cb227147b49a7dee1938f1e18c49cd6698bc317d3a33570558ccc02f"}],"claim.frontier.arxiv-2607-21191":[{"id":"assertion.claim.frontier.arxiv-2607-21191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21191","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21191 \"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB\" (CC BY 4.0, submitted 2026-07-23) reports: \"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.\"","support":[{"end":2408,"quote":"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":2265},{"end":1069,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":1040},{"end":2059,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":1997}],"target_id":"claim.frontier.arxiv-2607-21191","target_kind":"node","target_sha256":"f779c4aa6df40c68ba966415b2dbc3960be0fc8f23bb2a6200c1028da550ac86"}],"claim.frontier.arxiv-2607-21320":[{"id":"assertion.claim.frontier.arxiv-2607-21320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21320","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21320 \"Post Completeness in Conditional Logic\" (CC BY 4.0, submitted 2026-07-23) reports: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","support":[{"end":1925,"quote":"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson&#39;s embedding theorems.","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":1778},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":964},{"end":1556,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":1494}],"target_id":"claim.frontier.arxiv-2607-21320","target_kind":"node","target_sha256":"be5d3d11ab87db938fecda54dd4be67b03090dc1d58a717043e76a08ce3c56a9"}],"claim.frontier.arxiv-2607-21474":[{"id":"assertion.claim.frontier.arxiv-2607-21474","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21474","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21474 \"Fatness and Flatness\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.\"","support":[{"end":4007,"quote":"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":3835},{"end":1117,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":1088},{"end":2244,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":2182}],"target_id":"claim.frontier.arxiv-2607-21474","target_kind":"node","target_sha256":"57d9e8d22aa49efc4913e6df7737b066b45494ce975ca331cab2bcb7e2422d16"}],"claim.frontier.arxiv-2607-21883":[{"id":"assertion.claim.frontier.arxiv-2607-21883","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21883","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21883 \"Explicit bounds for Buchstab's function\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","support":[{"end":1803,"quote":"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":1638},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":964},{"end":1516,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":1454}],"target_id":"claim.frontier.arxiv-2607-21883","target_kind":"node","target_sha256":"093a307166ed4dc5eabc47df867fdc837a639de20b5f552065742ec3623bfd14"}],"claim.frontier.arxiv-2607-21892":[{"id":"assertion.claim.frontier.arxiv-2607-21892","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21892","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21892 \"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums\" (CC BY 4.0, submitted 2026-07-24) reports: \"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.\"","support":[{"end":2310,"quote":"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":2198},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":964},{"end":1676,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":1614}],"target_id":"claim.frontier.arxiv-2607-21892","target_kind":"node","target_sha256":"f8be03d3fc8b8a38a35cbf85fa9a157d7f4ae7984b12978b108d97048122e5a4"}],"claim.frontier.arxiv-2607-22018":[{"id":"assertion.claim.frontier.arxiv-2607-22018","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22018","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22018 \"Unlocking novel topological structures via rough families\" (CC BY 4.0, submitted 2026-07-24) reports: \"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.\"","support":[{"end":2313,"quote":"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":2196},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":964},{"end":1844,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":1782}],"target_id":"claim.frontier.arxiv-2607-22018","target_kind":"node","target_sha256":"50b90aa26728855b899f13050a3c2ce09c6a7a0c377e7a5f29787f4ee63fae7b"}],"claim.frontier.arxiv-2607-22156":[{"id":"assertion.claim.frontier.arxiv-2607-22156","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22156","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22156 \"A random matrix approach to lamplighter groups\" (CC BY 4.0, submitted 2026-07-24) reports: \"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.\"","support":[{"end":1876,"quote":"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1771},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1008},{"end":1566,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1504}],"target_id":"claim.frontier.arxiv-2607-22156","target_kind":"node","target_sha256":"40ee72500f24a292d917bf2b1bdbc4395ef98d6158c3b0d71356b249ad6303b2"}],"claim.frontier.arxiv-2607-22196":[{"id":"assertion.claim.frontier.arxiv-2607-22196","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22196","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22196 \"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations\" (CC BY 4.0, submitted 2026-07-24) reports: \"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.\"","support":[{"end":2618,"quote":"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":2324},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":964},{"end":1532,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":1470}],"target_id":"claim.frontier.arxiv-2607-22196","target_kind":"node","target_sha256":"cc8572aa88ba48f6685776522745c2e1311c6f8d9ff2caa7dea5b49bb316a163"}],"claim.frontier.arxiv-2607-22284":[{"id":"assertion.claim.frontier.arxiv-2607-22284","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22284","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22284 \"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings\" (CC BY 4.0, submitted 2026-07-24) reports: \"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.\"","support":[{"end":2055,"quote":"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":1877},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":964},{"end":1702,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":1640}],"target_id":"claim.frontier.arxiv-2607-22284","target_kind":"node","target_sha256":"5af1b40f4fae6bbc3d21defc33ddefc8c5b505b5cdd59fb06d5d8f31c38f2602"}],"claim.frontier.arxiv-2607-22333":[{"id":"assertion.claim.frontier.arxiv-2607-22333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22333","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22333 \"Collision and non-collision for diffusions on configuration space\" (CC BY 4.0, submitted 2026-07-24) reports: \"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.\"","support":[{"end":2613,"quote":"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":2419},{"end":1084,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":1055},{"end":1694,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":1632}],"target_id":"claim.frontier.arxiv-2607-22333","target_kind":"node","target_sha256":"990ada369a52479af0b5b9926dd4f5fa540e27397c8608b8f4a4a2feb7d7af70"}],"claim.frontier.arxiv-2607-22443":[{"id":"assertion.claim.frontier.arxiv-2607-22443","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22443","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22443 \"A Human-Augmenting Agentic Workflow for Observational Causal Inference\" (CC BY 4.0, submitted 2026-07-24) reports: \"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.\"","support":[{"end":3558,"quote":"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":3279},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":1008},{"end":2086,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":2024}],"target_id":"claim.frontier.arxiv-2607-22443","target_kind":"node","target_sha256":"8d38267c90e400886b6bbdf0d4e1dd68de8046ca411f3d9f5284c6acb2a879d2"}],"claim.frontier.arxiv-2607-22751":[{"id":"assertion.claim.frontier.arxiv-2607-22751","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22751","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22751 \"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.\"","support":[{"end":2447,"quote":"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":2318},{"end":1081,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":1052},{"end":1752,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":1690}],"target_id":"claim.frontier.arxiv-2607-22751","target_kind":"node","target_sha256":"a5af08d6019b2a0c9702c065e3a7a55d4be473c9aef38b6f6bad1e7f71317798"}],"claim.frontier.arxiv-2607-22892":[{"id":"assertion.claim.frontier.arxiv-2607-22892","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22892","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22892 \"Mirror Langevin diffusions: Convergence rates and Markov chain approximations\" (CC BY 4.0, submitted 2026-07-24) reports: \"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.\"","support":[{"end":3146,"quote":"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":2995},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":1008},{"end":1892,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":1830}],"target_id":"claim.frontier.arxiv-2607-22892","target_kind":"node","target_sha256":"0cd2b4d3f140663b7f1751ff5284508e5c04f7d16099019b2fb01324f2cd3a05"}],"claim.frontier.arxiv-2607-22920":[{"id":"assertion.claim.frontier.arxiv-2607-22920","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22920","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22920 \"Equidistribution of currents under Anosov group actions\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","support":[{"end":2669,"quote":"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":2319},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":964},{"end":1981,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":1919}],"target_id":"claim.frontier.arxiv-2607-22920","target_kind":"node","target_sha256":"d6ac4dd5d3977d9c2a82989dd7b6da9c80f22c7a3fa8f020ff1bfdd64f86df2c"}],"claim.frontier.arxiv-2607-22958":[{"id":"assertion.claim.frontier.arxiv-2607-22958","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22958","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22958 \"Quickest Detection with Rough Path Signatures\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","support":[{"end":2421,"quote":"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":2159},{"end":1165,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":1136},{"end":1770,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":1708}],"target_id":"claim.frontier.arxiv-2607-22958","target_kind":"node","target_sha256":"5e14917911579a9495795cee25826f0ac5a6d41074c56ee60119061c6262fa9f"}],"claim.frontier.arxiv-2607-22985":[{"id":"assertion.claim.frontier.arxiv-2607-22985","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22985","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22985 \"Robust Conformalized Selection with Noisy Responses\" (CC BY 4.0, submitted 2026-07-25) reports: \"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.\"","support":[{"end":2498,"quote":"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":2325},{"end":1077,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":1048},{"end":1812,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":1750}],"target_id":"claim.frontier.arxiv-2607-22985","target_kind":"node","target_sha256":"090d52e8fbff1e55c9d76f65753234830d0657687ce614190803966439244a4a"}],"claim.frontier.arxiv-2607-23192":[{"id":"assertion.claim.frontier.arxiv-2607-23192","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23192","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23192 \"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian\" (CC0 1.0, submitted 2026-07-25) reports: \"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.\"","support":[{"end":3007,"quote":"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":2795},{"end":1073,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":1044},{"end":1782,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":1714}],"target_id":"claim.frontier.arxiv-2607-23192","target_kind":"node","target_sha256":"e2af9f32003a8ccc7e08fc9da58df0185021906be2d654e6b9ab88582e7424ea"}],"claim.frontier.arxiv-2607-23212":[{"id":"assertion.claim.frontier.arxiv-2607-23212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23212","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23212 \"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations\" (CC BY 4.0, submitted 2026-07-25) reports: \"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.\"","support":[{"end":3100,"quote":"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":2803},{"end":1033,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":1004},{"end":1936,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":1874}],"target_id":"claim.frontier.arxiv-2607-23212","target_kind":"node","target_sha256":"6ce450af91b48a24e6dd70b20a2ba0b392e5cdb3e5740653d6a95353f2506126"}],"claim.frontier.arxiv-2607-23236":[{"id":"assertion.claim.frontier.arxiv-2607-23236","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23236","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23236 \"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos\" (CC BY 4.0, submitted 2026-07-25) reports: \"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.\"","support":[{"end":3232,"quote":"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":3064},{"end":1073,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":1044},{"end":1911,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":1849}],"target_id":"claim.frontier.arxiv-2607-23236","target_kind":"node","target_sha256":"c2a0ce43363d4f982d631fa47170e9088354dc236399e184974667565d561464"}],"claim.frontier.arxiv-2607-23428":[{"id":"assertion.claim.frontier.arxiv-2607-23428","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23428","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23428 \"Pinching rigidity of surfaces with parallel mean curvature vector in spheres\" (CC0 1.0, submitted 2026-07-26) reports: \"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.\"","support":[{"end":2466,"quote":"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":2323},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":964},{"end":1865,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":1797}],"target_id":"claim.frontier.arxiv-2607-23428","target_kind":"node","target_sha256":"76b9ed1b7b2aa5b8f371ae0bfc80788e542452d34eb794b3c5ab55d97a99adc9"}],"claim.frontier.arxiv-2607-23430":[{"id":"assertion.claim.frontier.arxiv-2607-23430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23430","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23430 \"Dialectica Categories over Heyting Algebras\" (CC BY 4.0, submitted 2026-07-26) reports: \"In the case of de Paiva's categorification of Gödel's Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.\"","support":[{"end":2493,"quote":"In the case of de Paiva&#39;s categorification of Gödel&#39;s Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":2240},{"end":1077,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":1048},{"end":2029,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":1967}],"target_id":"claim.frontier.arxiv-2607-23430","target_kind":"node","target_sha256":"a4d3312e62a879fa40c682f8b17d266c0278ca5ac16271c3c9febfde206e7bae"}],"claim.frontier.arxiv-2607-23596":[{"id":"assertion.claim.frontier.arxiv-2607-23596","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23596","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23596 \"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis\" (CC BY 4.0, submitted 2026-07-26) reports: \"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.\"","support":[{"end":3288,"quote":"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":3112},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":964},{"end":1767,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":1705}],"target_id":"claim.frontier.arxiv-2607-23596","target_kind":"node","target_sha256":"63c593c654e703a4fe6ffb1921345b4011fadf6f0a6c6264ce1164a30dd1cf72"}],"claim.frontier.arxiv-2607-23798":[{"id":"assertion.claim.frontier.arxiv-2607-23798","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23798","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23798 \"Interpolation via Generalized Splitting\" (CC BY 4.0, submitted 2026-07-26) reports: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","support":[{"end":2010,"quote":"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":1897},{"end":989,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":960},{"end":1403,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":1341}],"target_id":"claim.frontier.arxiv-2607-23798","target_kind":"node","target_sha256":"08a6715612c3a7599673bc39f044cb69dd5dec61223538e13f69448291a899f7"}],"claim.frontier.arxiv-2607-23814":[{"id":"assertion.claim.frontier.arxiv-2607-23814","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23814","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23814 \"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination\" (CC BY 4.0, submitted 2026-07-26) reports: \"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.\"","support":[{"end":3485,"quote":"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":3170},{"end":1033,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":1004},{"end":1675,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":1613}],"target_id":"claim.frontier.arxiv-2607-23814","target_kind":"node","target_sha256":"2b848862d57afdbdfb6de1ea9a77338f5b157a98d29fac98e2898b32fc66883c"}],"claim.frontier.arxiv-2607-23859":[{"id":"assertion.claim.frontier.arxiv-2607-23859","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23859","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23859 \"A note on the cohomology of pullback Lie algebroids\" (CC BY 4.0, submitted 2026-07-26) reports: \"We also prove the analogous result for holomorphic Lie algebroids.\"","support":[{"end":2130,"quote":"We also prove the analogous result for holomorphic Lie algebroids.","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":2064},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":964},{"end":1496,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":1434}],"target_id":"claim.frontier.arxiv-2607-23859","target_kind":"node","target_sha256":"4e1d96520931da3c707f6dd265e5fdae68831dfbff1a560f6983956446dadad1"}],"claim.frontier.arxiv-2607-23956":[{"id":"assertion.claim.frontier.arxiv-2607-23956","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23956","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23956 \"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.\"","support":[{"end":2429,"quote":"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":2264},{"end":1101,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":1072},{"end":2062,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":2000}],"target_id":"claim.frontier.arxiv-2607-23956","target_kind":"node","target_sha256":"4f5e6a89556e749d27057cececa33c7a68f1c3ba6e45020149c96aa7e01c83d0"}],"claim.frontier.arxiv-2607-23978":[{"id":"assertion.claim.frontier.arxiv-2607-23978","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23978","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23978 \"Non-Hermitian-enhanced quantum sensing in an optical interferometer\" (CC BY 4.0, submitted 2026-07-27) reports: \"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.\"","support":[{"end":2862,"quote":"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":2736},{"end":997,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":968},{"end":2075,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":2013}],"target_id":"claim.frontier.arxiv-2607-23978","target_kind":"node","target_sha256":"913e1797a9b9ee56c22246c9138570f2279784bff4d3177fc3da3538b9a384e1"}],"claim.frontier.arxiv-2607-24078":[{"id":"assertion.claim.frontier.arxiv-2607-24078","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24078","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24078 \"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations\" (CC BY 4.0, submitted 2026-07-27) reports: \"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.\"","support":[{"end":2046,"quote":"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1847},{"end":1062,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1033},{"end":1633,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1571}],"target_id":"claim.frontier.arxiv-2607-24078","target_kind":"node","target_sha256":"5181dc3ea0ad933a6ef8f339f9d952c52f01fd3899ff2e9c2c7325127b224daf"}],"claim.frontier.arxiv-2607-24091":[{"id":"assertion.claim.frontier.arxiv-2607-24091","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24091","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24091 \"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach\" (CC BY 4.0, submitted 2026-07-27) reports: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","support":[{"end":3055,"quote":"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":2661},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":965},{"end":1801,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":1739}],"target_id":"claim.frontier.arxiv-2607-24091","target_kind":"node","target_sha256":"3f4471f3e1a60025f3df7b4c95bd57f3ffd208b8079f24ef92525831eb51a32e"}],"claim.frontier.arxiv-2607-24123":[{"id":"assertion.claim.frontier.arxiv-2607-24123","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24123","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24123 \"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means\" (CC BY 4.0, submitted 2026-07-27) reports: \"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.\"","support":[{"end":2206,"quote":"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":2051},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":964},{"end":1869,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":1807}],"target_id":"claim.frontier.arxiv-2607-24123","target_kind":"node","target_sha256":"022cb14556d553b4157f3a59d1c8601b41ad3e3a65280734947c0ccbc3ce9bad"}],"claim.frontier.arxiv-2607-24144":[{"id":"assertion.claim.frontier.arxiv-2607-24144","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24144","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24144 \"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile\" (CC BY 4.0, submitted 2026-07-27) reports: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","support":[{"end":3589,"quote":"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":3349},{"end":1040,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":1011},{"end":2106,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":2044}],"target_id":"claim.frontier.arxiv-2607-24144","target_kind":"node","target_sha256":"2d5f7e94bd18579fab6fa029fbc5e84f7d4ab147089389ade3fbc51b5c9bb9b4"}],"claim.frontier.arxiv-2607-24212":[{"id":"assertion.claim.frontier.arxiv-2607-24212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24212","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24212 \"Convex Biproducts, Stochastic Matrices and Tape Diagrams\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.\"","support":[{"end":2207,"quote":"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1958},{"end":1033,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1004},{"end":1630,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1568}],"target_id":"claim.frontier.arxiv-2607-24212","target_kind":"node","target_sha256":"0c0fb650b1b7941e560f32f5fa00bada9a991c84244451051c7344e9d659f9b9"}],"claim.frontier.arxiv-2607-24239":[{"id":"assertion.claim.frontier.arxiv-2607-24239","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24239","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24239 \"Evolution of dipole-dipole dynamics in cold ammonia collisions\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.\"","support":[{"end":3181,"quote":"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":3007},{"end":1059,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":1030},{"end":2511,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":2449}],"target_id":"claim.frontier.arxiv-2607-24239","target_kind":"node","target_sha256":"606aec2d1684207bddcf378acf94dd0224bb2a1457194df8079dbf2edcdaf999"}],"claim.frontier.arxiv-2607-24240":[{"id":"assertion.claim.frontier.arxiv-2607-24240","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24240","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24240 \"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.\"","support":[{"end":2612,"quote":"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":2398},{"end":1003,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":974},{"end":2375,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":2313}],"target_id":"claim.frontier.arxiv-2607-24240","target_kind":"node","target_sha256":"9622ae46dd2443a282a363add20ef223ad49932c60819f97262adb9b6b8609be"}],"claim.frontier.arxiv-2607-24244":[{"id":"assertion.claim.frontier.arxiv-2607-24244","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24244","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24244 \"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance\" (CC BY 4.0, submitted 2026-07-27) reports: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","support":[{"end":4817,"quote":"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":4602},{"end":1006,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":977},{"end":2877,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":2815}],"target_id":"claim.frontier.arxiv-2607-24244","target_kind":"node","target_sha256":"dc7f07ef3ce421f3853aae01b16b99d19900496083512444e5e3a9bbfc1328ae"}],"claim.frontier.arxiv-2607-24252":[{"id":"assertion.claim.frontier.arxiv-2607-24252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24252","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24252 \"Non-Reciprocal yet Equilibrium Critical Dynamics\" (CC BY 4.0, submitted 2026-07-27) reports: \"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.\"","support":[{"end":2683,"quote":"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":2378},{"end":1007,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":978},{"end":1437,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":1375}],"target_id":"claim.frontier.arxiv-2607-24252","target_kind":"node","target_sha256":"717d8a292a7019c16c24bc1336a54b5b961af28c71caeed9965156dfa07416ba"}],"claim.frontier.arxiv-2607-24254":[{"id":"assertion.claim.frontier.arxiv-2607-24254","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24254","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24254 \"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes\" (CC BY 4.0, submitted 2026-07-27) reports: \"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.\"","support":[{"end":2196,"quote":"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":1976},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":965},{"end":1953,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":1891}],"target_id":"claim.frontier.arxiv-2607-24254","target_kind":"node","target_sha256":"4022b38137485e7d76ee932556907db703bb70d55ea1dc5a6cbf9c6bfd46f6d8"}],"claim.frontier.arxiv-2607-24433":[{"id":"assertion.claim.frontier.arxiv-2607-24433","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24433","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24433 \"Justification Logic of the Lambda Calculus\" (CC BY 4.0, submitted 2026-07-27) reports: \"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.\"","support":[{"end":2836,"quote":"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":2651},{"end":1033,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":1004},{"end":1609,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":1547}],"target_id":"claim.frontier.arxiv-2607-24433","target_kind":"node","target_sha256":"4c6e1367fda66138bc72d4636b4d57ecea219e63b427dfbab7e4a411e3bad34b"}],"claim.frontier.arxiv-2607-24446":[{"id":"assertion.claim.frontier.arxiv-2607-24446","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24446","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24446 \"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","support":[{"end":2364,"quote":"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":2153},{"end":995,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":966},{"end":1669,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":1607}],"target_id":"claim.frontier.arxiv-2607-24446","target_kind":"node","target_sha256":"b4be956edc655ac707660c3768d03b9ecdddd52920ca76cb8f72a248f9244023"}],"claim.frontier.arxiv-2607-24489":[{"id":"assertion.claim.frontier.arxiv-2607-24489","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24489","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24489 \"Asymptotic areas between powers of sine and cosine curves\" (CC BY 4.0, submitted 2026-07-27) reports: \"Motivated by Dombrowski and Dresden's work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.\"","support":[{"end":1960,"quote":"Motivated by Dombrowski and Dresden&#39;s work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":1703},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":964},{"end":1680,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":1618}],"target_id":"claim.frontier.arxiv-2607-24489","target_kind":"node","target_sha256":"cb31454a7a86673e55ed1a98b7647bf99ed3fceec478faf2f17941159ab77344"}],"claim.frontier.arxiv-2607-24524":[{"id":"assertion.claim.frontier.arxiv-2607-24524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24524","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24524 \"Light Dark Matter Discovery Potential and Model Selection at LDMX\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.\"","support":[{"end":2855,"quote":"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":2617},{"end":1041,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":1012},{"end":1991,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":1929}],"target_id":"claim.frontier.arxiv-2607-24524","target_kind":"node","target_sha256":"7a9f3d819e7d73023764b16051ffeb379676bb597df4f85878a6d0558f83a57c"}],"claim.frontier.arxiv-2607-24544":[{"id":"assertion.claim.frontier.arxiv-2607-24544","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24544","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24544 \"An Halpha survey of infrared bow-shocks around OB-type stars\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.\"","support":[{"end":3625,"quote":"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":3461},{"end":1000,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":971},{"end":2308,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":2246}],"target_id":"claim.frontier.arxiv-2607-24544","target_kind":"node","target_sha256":"165afb7399a0b5644e80f019d2360f3f720ae91ac7de70d62685140d10107a86"}],"claim.frontier.arxiv-2607-24584":[{"id":"assertion.claim.frontier.arxiv-2607-24584","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24584","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24584 \"Invisible decay of solar neutrinos at dark matter experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.\"","support":[{"end":3780,"quote":"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":3463},{"end":995,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":966},{"end":2431,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":2369}],"target_id":"claim.frontier.arxiv-2607-24584","target_kind":"node","target_sha256":"2ab2d0001f15966b647f989663421321b6a74f2d8cb2e3479c7b9396179c082b"}],"claim.frontier.arxiv-2607-24605":[{"id":"assertion.claim.frontier.arxiv-2607-24605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24605","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24605 \"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.\"","support":[{"end":3094,"quote":"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":2946},{"end":1000,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":971},{"end":2092,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":2030}],"target_id":"claim.frontier.arxiv-2607-24605","target_kind":"node","target_sha256":"65d08faea575b80470f8a1cf1a6cd8566383fc6e9f2550e039a4d2651a5ff11b"}],"claim.frontier.arxiv-2607-24641":[{"id":"assertion.claim.frontier.arxiv-2607-24641","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24641","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24641 \"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.\"","support":[{"end":2096,"quote":"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":1974},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":964},{"end":1588,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":1526}],"target_id":"claim.frontier.arxiv-2607-24641","target_kind":"node","target_sha256":"0e98badcf015147c067e71b3464d9ac0ea451836e577d33dd6502bd0d307d4d8"}],"claim.frontier.arxiv-2607-24654":[{"id":"assertion.claim.frontier.arxiv-2607-24654","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24654","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24654 \"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.\"","support":[{"end":2594,"quote":"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":2383},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":965},{"end":1946,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":1884}],"target_id":"claim.frontier.arxiv-2607-24654","target_kind":"node","target_sha256":"173ac730ebcea5d466ece80d2b8a8d46a5b0610ab6bae06cc4e72d3524fd278d"}],"claim.frontier.arxiv-2607-24682":[{"id":"assertion.claim.frontier.arxiv-2607-24682","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24682","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24682 \"CP-preserving channels\" (CC BY 4.0, submitted 2026-07-27) reports: \"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.\"","support":[{"end":2733,"quote":"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":2595},{"end":1088,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":1059},{"end":1883,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":1821}],"target_id":"claim.frontier.arxiv-2607-24682","target_kind":"node","target_sha256":"001dd3c1cb8c84f6a441ec3d5badbeaf970a3fa4c7faaf197133220192163eff"}],"claim.frontier.arxiv-2607-24705":[{"id":"assertion.claim.frontier.arxiv-2607-24705","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24705","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24705 \"Derangetropy Operators\" (CC BY 4.0, submitted 2026-07-27) reports: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","support":[{"end":2611,"quote":"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":2026},{"end":1260,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":1231},{"end":1856,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":1794}],"target_id":"claim.frontier.arxiv-2607-24705","target_kind":"node","target_sha256":"eabadab70c74b2c549388551ca7efdaa0141eca6a65b0fe39f82d09e417e5a28"}],"claim.frontier.arxiv-2607-24918":[{"id":"assertion.claim.frontier.arxiv-2607-24918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24918","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24918 \"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.\"","support":[{"end":2747,"quote":"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":2553},{"end":1046,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":1017},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":1864}],"target_id":"claim.frontier.arxiv-2607-24918","target_kind":"node","target_sha256":"b801bc9d35711b4b2d668e4e8840ab8319fe473c7d6d68e125fb47d5272b4a6b"}],"claim.frontier.arxiv-2607-24933":[{"id":"assertion.claim.frontier.arxiv-2607-24933","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24933","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24933 \"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.\"","support":[{"end":2465,"quote":"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":2313},{"end":1041,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":1012},{"end":1800,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":1738}],"target_id":"claim.frontier.arxiv-2607-24933","target_kind":"node","target_sha256":"df1cef78171694add6ba59acee1901479940e3d509cea9f5cde9fd9bb5f95957"}],"claim.frontier.arxiv-2607-24938":[{"id":"assertion.claim.frontier.arxiv-2607-24938","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24938","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24938 \"Tidal deformation of an accreting compact object\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.\"","support":[{"end":2976,"quote":"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":2761},{"end":1045,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":1016},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":1944}],"target_id":"claim.frontier.arxiv-2607-24938","target_kind":"node","target_sha256":"d7b6cb71ee37c333b036823b067c3521b4e555e7b0cbe533d0d0b36f240a880f"}],"claim.frontier.arxiv-2607-24988":[{"id":"assertion.claim.frontier.arxiv-2607-24988","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24988","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24988 \"Maximal complementarity in the n-qubit Pauli group\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.\"","support":[{"end":3278,"quote":"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":2851},{"end":1088,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":1059},{"end":2058,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":1996}],"target_id":"claim.frontier.arxiv-2607-24988","target_kind":"node","target_sha256":"3993ccb04243c747a7c18cf614f17fce2230fd29592c54db823ba75d0f2f050a"}],"claim.frontier.arxiv-2607-25226":[{"id":"assertion.claim.frontier.arxiv-2607-25226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25226","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25226 \"The quantum electrodynamics for dyons\" (CC0 1.0, submitted 2026-07-28) reports: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","support":[{"end":2553,"quote":"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960&#39;s seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":2194},{"end":1223,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":1194},{"end":2171,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":2103}],"target_id":"claim.frontier.arxiv-2607-25226","target_kind":"node","target_sha256":"5c8c5a658e6abd66b9457e9c7b1cb8686f36dd23847ad501ee147932a07c7375"}],"claim.frontier.arxiv-2607-25252":[{"id":"assertion.claim.frontier.arxiv-2607-25252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25252","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25252 \"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality\" (CC BY 4.0, submitted 2026-07-28) reports: \"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.\"","support":[{"end":2716,"quote":"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":2586},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":964},{"end":1937,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":1875}],"target_id":"claim.frontier.arxiv-2607-25252","target_kind":"node","target_sha256":"ed9158c78838791ce49937831f871b92cd11c26b6b14cc328953f99b71efa75c"}],"claim.frontier.arxiv-2607-25341":[{"id":"assertion.claim.frontier.arxiv-2607-25341","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25341","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25341 \"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","support":[{"end":2221,"quote":"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":1997},{"end":997,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":968},{"end":1819,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":1757}],"target_id":"claim.frontier.arxiv-2607-25341","target_kind":"node","target_sha256":"e75f29ae8e0581b135bd20dab6c4fde041215fbb0710d36548e691414da9f803"}],"claim.frontier.arxiv-2607-25394":[{"id":"assertion.claim.frontier.arxiv-2607-25394","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25394","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25394 \"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals\" (CC BY 4.0, submitted 2026-07-28) reports: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","support":[{"end":2982,"quote":"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":2835},{"end":1003,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":974},{"end":2525,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":2463}],"target_id":"claim.frontier.arxiv-2607-25394","target_kind":"node","target_sha256":"55bc54af6bfada63f7f5bf7c093b2cd9cdfa6bf1ac35365ada372ec417ba9df2"}],"claim.frontier.arxiv-2607-25460":[{"id":"assertion.claim.frontier.arxiv-2607-25460","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25460","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25460 \"Initial algebras from constructive ordinals\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","support":[{"end":1624,"quote":"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":1507},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":964},{"end":1484,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":1422}],"target_id":"claim.frontier.arxiv-2607-25460","target_kind":"node","target_sha256":"f3231f69f15069f1a46f005cd845d32727d566dae4bcf80011ca7444894c5697"}],"claim.frontier.arxiv-2607-25473":[{"id":"assertion.claim.frontier.arxiv-2607-25473","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25473","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25473 \"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","support":[{"end":2501,"quote":"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":2249},{"end":1041,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":1012},{"end":1985,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":1923}],"target_id":"claim.frontier.arxiv-2607-25473","target_kind":"node","target_sha256":"362fde8a10e8b2b8b11cd950644355ac82459e24fb39ebd3da794bf28a0994bb"}],"claim.frontier.arxiv-2607-25559":[{"id":"assertion.claim.frontier.arxiv-2607-25559","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25559","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25559 \"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","support":[{"end":2366,"quote":"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":2150},{"end":1002,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":973},{"end":1618,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":1556}],"target_id":"claim.frontier.arxiv-2607-25559","target_kind":"node","target_sha256":"05cd5ff7d4c006373726071257e42815e38a0ae16d3d6742a4f91234f5620d68"}],"claim.frontier.arxiv-2607-25610":[{"id":"assertion.claim.frontier.arxiv-2607-25610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25610","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25610 \"Brjuno condition through best approximations and the linearization problem\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.\"","support":[{"end":2876,"quote":"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":2675},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":964},{"end":2106,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":2044}],"target_id":"claim.frontier.arxiv-2607-25610","target_kind":"node","target_sha256":"8318e561089caa6aedc52f09964b5ae1b00ed5652ff13c7af9ca854b27d9043c"}],"claim.frontier.arxiv-2607-25621":[{"id":"assertion.claim.frontier.arxiv-2607-25621","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25621","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25621 \"A Lusin theorem for nonlocal gradients\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.\"","support":[{"end":1754,"quote":"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":1647},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":964},{"end":1459,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":1397}],"target_id":"claim.frontier.arxiv-2607-25621","target_kind":"node","target_sha256":"ea33721d8c024991054885657cc9f2d8aa02c81fdce9e9621cfa22eaf3f878da"}],"claim.frontier.arxiv-2607-25625":[{"id":"assertion.claim.frontier.arxiv-2607-25625","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25625","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25625 \"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain\" (CC BY 4.0, submitted 2026-07-28) reports: \"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.\"","support":[{"end":2263,"quote":"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":2081},{"end":1101,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":1072},{"end":1680,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":1618}],"target_id":"claim.frontier.arxiv-2607-25625","target_kind":"node","target_sha256":"1b926e5fb942e4378140656d622e107a9a50c46a26ef8ee33b2de89e0c40662e"}],"claim.frontier.arxiv-2607-25644":[{"id":"assertion.claim.frontier.arxiv-2607-25644","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25644","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25644 \"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers\" (CC0 1.0, submitted 2026-07-28) reports: \"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.\"","support":[{"end":2098,"quote":"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":1847},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":964},{"end":1675,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":1607}],"target_id":"claim.frontier.arxiv-2607-25644","target_kind":"node","target_sha256":"5835e20de1a2e098812d8ead892652a717b8531cf6727cd1a6d0b89d34bcdcbc"}],"claim.frontier.arxiv-2607-25678":[{"id":"assertion.claim.frontier.arxiv-2607-25678","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25678","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25678 \"Engineering a Quantum Thermal Diode with Floquet Driving\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.\"","support":[{"end":2312,"quote":"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":2126},{"end":997,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":968},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":1755}],"target_id":"claim.frontier.arxiv-2607-25678","target_kind":"node","target_sha256":"1eacad386c24081676b659a27ffbde000764af0a8f382b9bff7424d8edda5eb9"}],"claim.frontier.arxiv-2607-25706":[{"id":"assertion.claim.frontier.arxiv-2607-25706","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25706","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25706 \"Categories of tagged lenses\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","support":[{"end":1717,"quote":"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":1562},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":964},{"end":1392,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":1330}],"target_id":"claim.frontier.arxiv-2607-25706","target_kind":"node","target_sha256":"aeb44eecbdc9c280dbad29c49de3a9ced76f2ae9f58cc937330723a5bc28b62e"}],"claim.frontier.arxiv-2607-25743":[{"id":"assertion.claim.frontier.arxiv-2607-25743","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25743","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25743 \"Physical Mechanism of Vacuole Formation in Liquid Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.\"","support":[{"end":2893,"quote":"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":2775},{"end":1056,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":1027},{"end":2335,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":2273}],"target_id":"claim.frontier.arxiv-2607-25743","target_kind":"node","target_sha256":"4e21e15134dd7174ae7f60b2377a773e07c28603004812b6f724e478a9329c77"}],"claim.frontier.arxiv-2607-25772":[{"id":"assertion.claim.frontier.arxiv-2607-25772","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25772","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25772 \"Contact Surgery Numbers of the 3-torus\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.\"","support":[{"end":2078,"quote":"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1846},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1008},{"end":1751,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1689}],"target_id":"claim.frontier.arxiv-2607-25772","target_kind":"node","target_sha256":"9b210c4bf76475e0a92b50f18fc34bdf82e1288bab313d26dae0699e6c29b7d2"}],"claim.frontier.arxiv-2607-25783":[{"id":"assertion.claim.frontier.arxiv-2607-25783","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25783","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25783 \"Deterministic loading of molecular arrays by microwave-assisted collisions\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.\"","support":[{"end":2874,"quote":"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":2639},{"end":1165,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":1136},{"end":2275,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":2213}],"target_id":"claim.frontier.arxiv-2607-25783","target_kind":"node","target_sha256":"84171262a8572e9d1358fb160d29a7d0ac5cd71a0f28441864d63973b2aa92b1"}],"claim.frontier.arxiv-2607-25865":[{"id":"assertion.claim.frontier.arxiv-2607-25865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25865","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25865 \"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist\" (CC BY 4.0, submitted 2026-07-28) reports: \"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.\"","support":[{"end":4083,"quote":"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":3816},{"end":1077,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":1048},{"end":2638,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":2576}],"target_id":"claim.frontier.arxiv-2607-25865","target_kind":"node","target_sha256":"29445bc6c61c12a615ef2362cb94aa0e4dc3ea8d50e7d3e02f310f318848e614"}],"claim.frontier.arxiv-2607-25910":[{"id":"assertion.claim.frontier.arxiv-2607-25910","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25910","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25910 \"$d$-Translated Unit Sensitive Primes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.\"","support":[{"end":2009,"quote":"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":1880},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":964},{"end":1615,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":1553}],"target_id":"claim.frontier.arxiv-2607-25910","target_kind":"node","target_sha256":"1a05d43338bd8805f4b7ae139256b779743a9af225ad0ebbebda6cc52672c099"}],"claim.frontier.arxiv-2607-25950":[{"id":"assertion.claim.frontier.arxiv-2607-25950","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25950","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25950 \"Weak-form Extended Dynamic Mode Decomposition\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","support":[{"end":1922,"quote":"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":1740},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":964},{"end":1613,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":1551}],"target_id":"claim.frontier.arxiv-2607-25950","target_kind":"node","target_sha256":"d5736fdee0bd974ed95ec6d95eb80282e1d805b84f99c75026bddd3bc968432f"}],"claim.frontier.arxiv-2607-25960":[{"id":"assertion.claim.frontier.arxiv-2607-25960","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25960","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25960 \"Quantum Steenrod powers and Hamiltonian maps\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including: 1.\"","support":[{"end":2136,"quote":"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including:\n  1.","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":2014},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":1008},{"end":1991,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":1929}],"target_id":"claim.frontier.arxiv-2607-25960","target_kind":"node","target_sha256":"bfcfb846ed194b0812ca98a4e8e78c431e2b56cb9623419d0002bab3cefbd33b"}],"claim.frontier.arxiv-2607-25977":[{"id":"assertion.claim.frontier.arxiv-2607-25977","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25977","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25977 \"The Internal Modal Logic of Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.\"","support":[{"end":2870,"quote":"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":2609},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":964},{"end":1712,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":1650}],"target_id":"claim.frontier.arxiv-2607-25977","target_kind":"node","target_sha256":"359ca5637261d57dc3c0fc09c8a92896477f57fcbed5fc24533ca359cc0f1737"}],"claim.frontier.arxiv-2607-26030":[{"id":"assertion.claim.frontier.arxiv-2607-26030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26030","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26030 \"Soft-mode nonlinearities away from ferroelectric phase transition\" (CC BY 4.0, submitted 2026-07-28) reports: \"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.\"","support":[{"end":3534,"quote":"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":3391},{"end":1006,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":977},{"end":2200,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":2138}],"target_id":"claim.frontier.arxiv-2607-26030","target_kind":"node","target_sha256":"2c3e66ecd2967b0846f45cc0966978618a05d951b066e7529c89355a9f4d0ea2"}],"claim.frontier.arxiv-2607-26084":[{"id":"assertion.claim.frontier.arxiv-2607-26084","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26084","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26084 \"Observational Constraints on Emergent Fractional Fractal Cosmology\" (CC BY 4.0, submitted 2026-07-26) reports: \"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.\"","support":[{"end":3247,"quote":"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":3057},{"end":1045,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":1016},{"end":1978,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":1916}],"target_id":"claim.frontier.arxiv-2607-26084","target_kind":"node","target_sha256":"dcb5e7dbdd588371f1dcce560ce34afa6256578c92a8fde47f76a28ec12da943"}],"claim.frontier.arxiv-2607-26103":[{"id":"assertion.claim.frontier.arxiv-2607-26103","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26103","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26103 \"A rigid spherical shell enclosing a degenerate wormhole\" (CC BY 4.0, submitted 2026-07-28) reports: \"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.\"","support":[{"end":2161,"quote":"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":1916},{"end":994,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":965},{"end":1514,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":1452}],"target_id":"claim.frontier.arxiv-2607-26103","target_kind":"node","target_sha256":"90de20352ef72bcd8a80e84790fc5d00313a050bfb383f9625123ef8fc9be832"}],"claim.frontier.arxiv-2607-26141":[{"id":"assertion.claim.frontier.arxiv-2607-26141","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26141","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26141 \"Light propagation and intensity transport in metric-affine geometry\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.\"","support":[{"end":2958,"quote":"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":2705},{"end":994,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":965},{"end":1993,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":1931}],"target_id":"claim.frontier.arxiv-2607-26141","target_kind":"node","target_sha256":"1bf609d459086e5019058403f0fa2c7ccbff3342bbdc3fda559017392154a14e"}],"claim.frontier.arxiv-2607-26147":[{"id":"assertion.claim.frontier.arxiv-2607-26147","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26147","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26147 \"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity\" (CC BY 4.0, submitted 2026-07-28) reports: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","support":[{"end":3932,"quote":"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":3683},{"end":1051,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":1022},{"end":2989,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":2927}],"target_id":"claim.frontier.arxiv-2607-26147","target_kind":"node","target_sha256":"924d3389266211bcfcdc2ffb61911776052c435b93db64e1523ba37c55333701"}],"claim.frontier.arxiv-2607-26151":[{"id":"assertion.claim.frontier.arxiv-2607-26151","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26151","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26151 \"Quantum spin-glass criticality in disordered frustrated dimer magnets\" (CC BY 4.0, submitted 2026-07-28) reports: \"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.\"","support":[{"end":2931,"quote":"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":2661},{"end":1059,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":1030},{"end":1745,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":1683}],"target_id":"claim.frontier.arxiv-2607-26151","target_kind":"node","target_sha256":"e948e92998a2d9d3fb6e021897341667e3c1fe8bf844319bacb130329d9ca9be"}],"claim.frontier.arxiv-2607-26177":[{"id":"assertion.claim.frontier.arxiv-2607-26177","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26177","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26177 \"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.\"","support":[{"end":4839,"quote":"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":4632},{"end":1051,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":1022},{"end":3632,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":3570}],"target_id":"claim.frontier.arxiv-2607-26177","target_kind":"node","target_sha256":"f47246320b8c81db9a8043206a5d940e38ad2e4a004d7fe36ff264de73c77967"}],"claim.frontier.arxiv-2607-26180":[{"id":"assertion.claim.frontier.arxiv-2607-26180","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26180","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26180 \"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.\"","support":[{"end":2678,"quote":"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":2511},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":971},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":1755}],"target_id":"claim.frontier.arxiv-2607-26180","target_kind":"node","target_sha256":"d26b77ceaa71482af10b8efd851f32f2f448abae72f418b98859521a4f37be70"}],"claim.frontier.arxiv-2607-26193":[{"id":"assertion.claim.frontier.arxiv-2607-26193","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26193","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26193 \"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.\"","support":[{"end":3882,"quote":"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":3661},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":971},{"end":3068,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":3006}],"target_id":"claim.frontier.arxiv-2607-26193","target_kind":"node","target_sha256":"476f120a2a35bf2cd26a28ba50bb42b7b20ffd26a96a1e532da7ba81512f581c"}],"claim.frontier.arxiv-2607-26205":[{"id":"assertion.claim.frontier.arxiv-2607-26205","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26205","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26205 \"Binary disruptions driven by massive disks around massive black holes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.\"","support":[{"end":2294,"quote":"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":2137},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":971},{"end":1597,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":1535}],"target_id":"claim.frontier.arxiv-2607-26205","target_kind":"node","target_sha256":"82d273ad2dfad49236650fcbe59a6838921fd659d4bacc9a9cfa77eb96047910"}],"claim.frontier.arxiv-2607-26281":[{"id":"assertion.claim.frontier.arxiv-2607-26281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26281","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26281 \"Concise $(\\varepsilon,r)$-representations of a path\" (CC BY 4.0, submitted 2026-07-28) reports: \"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.\"","support":[{"end":3626,"quote":"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":3475},{"end":1077,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":1048},{"end":1894,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":1832}],"target_id":"claim.frontier.arxiv-2607-26281","target_kind":"node","target_sha256":"02c70e0d132daec18b3fa5d43016bbed6018e7e0dfeb17afeefea815105868c8"}],"claim.frontier.arxiv-2607-26287":[{"id":"assertion.claim.frontier.arxiv-2607-26287","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26287","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26287 \"Studying Competing Events with Federated Cumulative Incidence Curves\" (CC BY 4.0, submitted 2026-07-28) reports: \"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.\"","support":[{"end":4043,"quote":"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":3757},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":964},{"end":2510,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":2448}],"target_id":"claim.frontier.arxiv-2607-26287","target_kind":"node","target_sha256":"f99cae5b6df4877d4b4c78997da39c6862ba8bc6e71a587437a78ad34cdcb0ef"}],"claim.frontier.arxiv-2607-26289":[{"id":"assertion.claim.frontier.arxiv-2607-26289","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26289","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26289 \"Scale-dependent universality class crossover in magnetic skyrmion polymers\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.\"","support":[{"end":2841,"quote":"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":2620},{"end":1117,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":1088},{"end":1958,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":1896}],"target_id":"claim.frontier.arxiv-2607-26289","target_kind":"node","target_sha256":"ac487d0f9e3739a6670e0dec93b217421d3aa39a3e6f67b2695a0117ec5f70f3"}],"claim.frontier.arxiv-2607-26374":[{"id":"assertion.claim.frontier.arxiv-2607-26374","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26374","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26374 \"Charged Dirac stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.\"","support":[{"end":2145,"quote":"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":1839},{"end":994,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":965},{"end":1606,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":1544}],"target_id":"claim.frontier.arxiv-2607-26374","target_kind":"node","target_sha256":"c22ba501dbf04823a0c38b59063a13f9525ae937e1122dd16f5a33e99326c941"}],"claim.frontier.arxiv-2607-26378":[{"id":"assertion.claim.frontier.arxiv-2607-26378","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26378","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26378 \"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.\"","support":[{"end":2590,"quote":"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":2458},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":1008},{"end":1929,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":1867}],"target_id":"claim.frontier.arxiv-2607-26378","target_kind":"node","target_sha256":"f1e2160e0a1e26c0dec672071f9b6f775b74ba59c2fb657283dcb97d39091614"}],"claim.frontier.arxiv-2607-26408":[{"id":"assertion.claim.frontier.arxiv-2607-26408","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26408","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26408 \"Phase control of multi-photon electron-positron pair creation from vacuum\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.\"","support":[{"end":2511,"quote":"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":2386},{"end":1005,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":976},{"end":2185,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":2123}],"target_id":"claim.frontier.arxiv-2607-26408","target_kind":"node","target_sha256":"582d7524ba1ecb7b26deed804ab8be76dde50cb2133cb826e6276b45ee7f5fa3"}],"claim.frontier.arxiv-2607-26433":[{"id":"assertion.claim.frontier.arxiv-2607-26433","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26433","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26433 \"Nonlinear quantum Fokker-Planck equation near equilibrium\" (CC BY 4.0, submitted 2026-07-29) reports: \"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.\"","support":[{"end":2533,"quote":"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":2365},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":964},{"end":1771,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":1709}],"target_id":"claim.frontier.arxiv-2607-26433","target_kind":"node","target_sha256":"eac5ad605c4a1782fdcf6b826a51278cff8bc312ea3ff02a4e08e41cd79f6710"}],"claim.frontier.arxiv-2607-26484":[{"id":"assertion.claim.frontier.arxiv-2607-26484","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26484","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26484 \"d-Spectral Bitopological Spaces\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.\"","support":[{"end":2155,"quote":"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":1999},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":964},{"end":1633,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":1571}],"target_id":"claim.frontier.arxiv-2607-26484","target_kind":"node","target_sha256":"7dd662f7ac051247f248b9022e01f6cb646c4fec7b1cd8e7e1e4162b47fce86c"}],"claim.frontier.arxiv-2607-26508":[{"id":"assertion.claim.frontier.arxiv-2607-26508","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26508","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26508 \"An association measure for mixed-type variables\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the strong consistency and asymptotic normality of the estimator $ξ_n'$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ'$.\"","support":[{"end":3087,"quote":"We establish the strong consistency and asymptotic normality of the estimator $ξ_n&#39;$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ&#39;$.","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":2840},{"end":1081,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":1052},{"end":1994,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":1932}],"target_id":"claim.frontier.arxiv-2607-26508","target_kind":"node","target_sha256":"48e98026d88275a21e41d85600ec983462cfa4c09e85f269e9310758171e253e"}],"claim.frontier.arxiv-2607-26653":[{"id":"assertion.claim.frontier.arxiv-2607-26653","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26653","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26653 \"A new construction of the Riemannian deformation sequence\" (CC BY 4.0, submitted 2026-07-29) reports: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","support":[{"end":1771,"quote":"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":1605},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":964},{"end":1582,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":1520}],"target_id":"claim.frontier.arxiv-2607-26653","target_kind":"node","target_sha256":"9ba7fb7021241a8d77d23e81f1ce9df2636f800e69c2b59bc95b081308b64c2b"}],"claim.frontier.arxiv-2607-26677":[{"id":"assertion.claim.frontier.arxiv-2607-26677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26677","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26677 \"A Harmonic-Map Proof of Mostow Rigidity\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish a sharp pointwise gradient estimate for this lift.\"","support":[{"end":1658,"quote":"We establish a sharp pointwise gradient estimate for this lift.","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":1595},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":964},{"end":1401,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":1339}],"target_id":"claim.frontier.arxiv-2607-26677","target_kind":"node","target_sha256":"92e949e8b030b888f10861f5db2b483b3b21ef19a8ab3f52923b4330bc192646"}],"claim.frontier.arxiv-2607-26782":[{"id":"assertion.claim.frontier.arxiv-2607-26782","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26782","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26782 \"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws\" (CC BY 4.0, submitted 2026-07-29) reports: \"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.\"","support":[{"end":2958,"quote":"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":2723},{"end":1182,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":1153},{"end":2354,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":2292}],"target_id":"claim.frontier.arxiv-2607-26782","target_kind":"node","target_sha256":"0c49b780a1dba2ec9494effd505d23bcb3a5d765f8a18e4cc64509a44469f8ec"}],"claim.frontier.arxiv-2607-26800":[{"id":"assertion.claim.frontier.arxiv-2607-26800","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26800","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26800 \"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","support":[{"end":3583,"quote":"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":3294},{"end":996,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":967},{"end":1863,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":1801}],"target_id":"claim.frontier.arxiv-2607-26800","target_kind":"node","target_sha256":"35b77d96b17347b03d3cffb6daa067de3c3d29fcdbdb2abf79f559dd9f632529"}],"claim.frontier.arxiv-2607-26890":[{"id":"assertion.claim.frontier.arxiv-2607-26890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26890","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26890 \"The Lie algebra generated by gradient vector fields\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","support":[{"end":2095,"quote":"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1958},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1008},{"end":1832,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1770}],"target_id":"claim.frontier.arxiv-2607-26890","target_kind":"node","target_sha256":"dff606171154a0629ce6719f8723a751ab803ede3cdf401e85505d5182d479cb"}],"claim.frontier.arxiv-2607-26932":[{"id":"assertion.claim.frontier.arxiv-2607-26932","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26932","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26932 \"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.\"","support":[{"end":8776,"quote":"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":8565},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":971},{"end":6930,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":6868}],"target_id":"claim.frontier.arxiv-2607-26932","target_kind":"node","target_sha256":"e2cf96620895331163ab5d4a9b90bd6a93481698c365704ca44fd331d316b635"}],"claim.frontier.arxiv-2607-26966":[{"id":"assertion.claim.frontier.arxiv-2607-26966","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26966","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26966 \"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","support":[{"end":2974,"quote":"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":2749},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":971},{"end":1859,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":1797}],"target_id":"claim.frontier.arxiv-2607-26966","target_kind":"node","target_sha256":"8fa2d1c94261407c01c381a62df92b4d43bac53e18a282b9fd69630533abe02f"}],"claim.frontier.arxiv-2607-27037":[{"id":"assertion.claim.frontier.arxiv-2607-27037","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27037","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27037 \"SNT-Rank: Kronecker Products and Euclidean Distance Matrices\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","support":[{"end":2372,"quote":"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":2177},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":964},{"end":1649,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":1587}],"target_id":"claim.frontier.arxiv-2607-27037","target_kind":"node","target_sha256":"6420c97b07d59c2264181b8e83dca1e86a422c0ea62564a43b10c8e4e3710445"}],"claim.frontier.arxiv-2607-27038":[{"id":"assertion.claim.frontier.arxiv-2607-27038","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27038","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27038 \"Irreducible non-holonomic modules for rational Cherednik algebras\" (CC BY 4.0, submitted 2026-07-29) reports: \"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.\"","support":[{"end":2490,"quote":"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":2308},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":964},{"end":1641,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":1579}],"target_id":"claim.frontier.arxiv-2607-27038","target_kind":"node","target_sha256":"6e2d1aa11a59e9908345352dee0ddf120986d6e5ca8d106581a09b76dded1bee"}],"claim.frontier.arxiv-2607-27062":[{"id":"assertion.claim.frontier.arxiv-2607-27062","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27062","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27062 \"PIKS: Universal Physics-Informed Kernel Methods\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.\"","support":[{"end":2974,"quote":"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":2740},{"end":1033,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":1004},{"end":1932,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":1870}],"target_id":"claim.frontier.arxiv-2607-27062","target_kind":"node","target_sha256":"6278f9976da6f3f8f647c5ce42fac408e42f1ede3966d79f45576caff4a65d9d"}],"claim.frontier.arxiv-2607-27098":[{"id":"assertion.claim.frontier.arxiv-2607-27098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27098","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27098 \"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.\"","support":[{"end":2549,"quote":"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":2390},{"end":1077,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":1048},{"end":1845,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":1783}],"target_id":"claim.frontier.arxiv-2607-27098","target_kind":"node","target_sha256":"da9307a1886d8ae7b4f08f97cb24dd5ce447312a13fac68cb2154ed2b169aee1"}],"claim.frontier.arxiv-2607-27105":[{"id":"assertion.claim.frontier.arxiv-2607-27105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27105","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27105 \"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach\" (CC BY 4.0, submitted 2026-07-29) reports: \"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.\"","support":[{"end":3410,"quote":"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":3293},{"end":1033,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":1004},{"end":2439,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":2377}],"target_id":"claim.frontier.arxiv-2607-27105","target_kind":"node","target_sha256":"be3a7cf12fff0676290338287de39d11d13c575ef6bdfa15c1394cbe849b7f20"}],"claim.frontier.arxiv-2607-27129":[{"id":"assertion.claim.frontier.arxiv-2607-27129","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27129","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27129 \"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.\"","support":[{"end":2318,"quote":"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":2101},{"end":994,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":965},{"end":1540,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":1478}],"target_id":"claim.frontier.arxiv-2607-27129","target_kind":"node","target_sha256":"440565e08d9a497ae57138bcb8c12e75a0790ad4766d4944c1707ab4c75c9b04"}],"claim.frontier.arxiv-2607-27158":[{"id":"assertion.claim.frontier.arxiv-2607-27158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27158","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27158 \"Outcomes of Grand Unified Symmetry Breaking\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.\"","support":[{"end":2164,"quote":"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":2051},{"end":1092,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":1063},{"end":1939,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":1877}],"target_id":"claim.frontier.arxiv-2607-27158","target_kind":"node","target_sha256":"75e7deba3bc3a6ecd612838205d91ac2d9589b6d7db45099b6f3efc91c98bddf"}],"claim.frontier.arxiv-2607-27181":[{"id":"assertion.claim.frontier.arxiv-2607-27181","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27181","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27181 \"Reconfigurable Optical Platform for One-way Quantum Communication Complexity\" (CC BY 4.0, submitted 2026-07-29) reports: \"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.\"","support":[{"end":2924,"quote":"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":2645},{"end":997,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":968},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":1944}],"target_id":"claim.frontier.arxiv-2607-27181","target_kind":"node","target_sha256":"8e0835abded869ebf41e98ca2aa511ed845b5fa47e2623d6a60dd4440b95249e"}],"claim.frontier.arxiv-2607-27299":[{"id":"assertion.claim.frontier.arxiv-2607-27299","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27299","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27299 \"When trajectory-based bounds fail: information thermodynamics under noisy feedback\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","support":[{"end":3320,"quote":"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":3076},{"end":1064,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":1035},{"end":1910,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":1848}],"target_id":"claim.frontier.arxiv-2607-27299","target_kind":"node","target_sha256":"24c679f5e51642532e3c34cfcc402270d5618f11ec586febb149ddb3f0fd9d00"}],"claim.frontier.arxiv-2607-27312":[{"id":"assertion.claim.frontier.arxiv-2607-27312","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27312","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27312 \"Non-linear Evolution of Dark Plasma Subhalos\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.\"","support":[{"end":3125,"quote":"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":2925},{"end":1102,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":1073},{"end":2128,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":2066}],"target_id":"claim.frontier.arxiv-2607-27312","target_kind":"node","target_sha256":"b0400e6f53297467ba95aeb3c4ff4aadb4811e5074c68e6504b81889178055c9"}],"claim.frontier.arxiv-2607-27326":[{"id":"assertion.claim.frontier.arxiv-2607-27326","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27326","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27326 \"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints\" (CC BY 4.0, submitted 2026-07-29) reports: \"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.\"","support":[{"end":3886,"quote":"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":3676},{"end":1097,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":1068},{"end":2359,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":2297}],"target_id":"claim.frontier.arxiv-2607-27326","target_kind":"node","target_sha256":"86ff7a8db9f175b4cf7fb65526e81491910b2c2031b07549b7ac38f3b02b17e2"}],"claim.frontier.arxiv-2607-27329":[{"id":"assertion.claim.frontier.arxiv-2607-27329","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27329","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27329 \"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.\"","support":[{"end":6990,"quote":"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":6701},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":971},{"end":5265,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":5203}],"target_id":"claim.frontier.arxiv-2607-27329","target_kind":"node","target_sha256":"63bbd01ca720ae74f4bdfb8a6903d944d520601a62b56f420814b48847791b56"}],"claim.frontier.arxiv-2607-27334":[{"id":"assertion.claim.frontier.arxiv-2607-27334","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27334","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27334 \"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.\"","support":[{"end":2990,"quote":"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":2855},{"end":1041,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":1012},{"end":1884,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":1822}],"target_id":"claim.frontier.arxiv-2607-27334","target_kind":"node","target_sha256":"fb528015dbfb5bdbd39cc7873e68dafe5ef045a1d9ab2abca0a2631ea6ddcb83"}],"claim.frontier.arxiv-2607-27344":[{"id":"assertion.claim.frontier.arxiv-2607-27344","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27344","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27344 \"Inflation in unimodular loop quantum cosmology\" (CC BY 4.0, submitted 2026-07-29) reports: \"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.\"","support":[{"end":2598,"quote":"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":2416},{"end":1091,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":1062},{"end":1798,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":1736}],"target_id":"claim.frontier.arxiv-2607-27344","target_kind":"node","target_sha256":"1ea06e808f659bfac0bd8af60b86c45c0d7d4562afa9b62974d9c3ae7c06f279"}],"claim.frontier.arxiv-2607-27362":[{"id":"assertion.claim.frontier.arxiv-2607-27362","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27362","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27362 \"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.\"","support":[{"end":2502,"quote":"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":2347},{"end":1003,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":974},{"end":1952,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":1890}],"target_id":"claim.frontier.arxiv-2607-27362","target_kind":"node","target_sha256":"0c94f7d912a3661b0e5dbfb592d9096425cba8e17a9f838347d73dbff4601258"}],"claim.frontier.arxiv-2607-27388":[{"id":"assertion.claim.frontier.arxiv-2607-27388","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27388","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27388 \"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes\" (CC BY 4.0, submitted 2026-07-29) reports: \"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.\"","support":[{"end":2711,"quote":"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":2497},{"end":1088,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":1059},{"end":2231,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":2169}],"target_id":"claim.frontier.arxiv-2607-27388","target_kind":"node","target_sha256":"8f8bbfa9a400fd8eb7693cad28abb11d7e4488dd5ca990d6c87399c1ddb3f8f1"}],"claim.frontier.arxiv-2607-27391":[{"id":"assertion.claim.frontier.arxiv-2607-27391","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27391","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27391 \"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties\" (CC BY 4.0, submitted 2026-07-29) reports: \"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.\"","support":[{"end":2591,"quote":"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":2445},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":971},{"end":1686,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":1624}],"target_id":"claim.frontier.arxiv-2607-27391","target_kind":"node","target_sha256":"bcf74d97ead0b3ded34232e0d5cf2f40d00b63b4d7012a026b7d24768b8d7e1d"}],"claim.frontier.arxiv-2607-27403":[{"id":"assertion.claim.frontier.arxiv-2607-27403","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27403","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27403 \"Handling Missingness and Censoring in Dirichlet Mixture Models\" (CC BY 4.0, submitted 2026-07-29) reports: \"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.\"","support":[{"end":3401,"quote":"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":3165},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":1008},{"end":2001,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":1939}],"target_id":"claim.frontier.arxiv-2607-27403","target_kind":"node","target_sha256":"ceeafa4b16be9b23215943668b1107821fa91a708227844f9d72f94e4ef1ad45"}],"claim.frontier.arxiv-2607-27502":[{"id":"assertion.claim.frontier.arxiv-2607-27502","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27502","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27502 \"Entropic signatures of the single-impurity Kondo state\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.\"","support":[{"end":3462,"quote":"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":3163},{"end":1006,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":977},{"end":2955,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":2893}],"target_id":"claim.frontier.arxiv-2607-27502","target_kind":"node","target_sha256":"a1b99449982edd48eb934d991380c3595df61d6e3bdd92c4598878b26a0253e8"}],"claim.frontier.arxiv-2607-27514":[{"id":"assertion.claim.frontier.arxiv-2607-27514","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27514","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27514 \"Sample Complexity for the 2-Gromov-Wasserstein Distance\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.\"","support":[{"end":2646,"quote":"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":2403},{"end":1081,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":1052},{"end":1965,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":1903}],"target_id":"claim.frontier.arxiv-2607-27514","target_kind":"node","target_sha256":"8d665e87a1b16d123e36f7f5f42d4d2115c5234ad993a527b9f88071e799ed6b"}],"claim.frontier.arxiv-2607-27515":[{"id":"assertion.claim.frontier.arxiv-2607-27515","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27515","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27515 \"Unified dark sector approaches to cosmological tensions\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.\"","support":[{"end":2253,"quote":"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":1892},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":971},{"end":1645,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":1583}],"target_id":"claim.frontier.arxiv-2607-27515","target_kind":"node","target_sha256":"74f9ae17ec49bc8df87dcaf09a746f793d6439c0944a8fa464cc1fb8b2f4a8af"}],"claim.frontier.arxiv-2607-27582":[{"id":"assertion.claim.frontier.arxiv-2607-27582","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27582","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27582 \"Polynomial maps which are not good for nice recurrence and applications\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.\"","support":[{"end":2039,"quote":"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":1751},{"end":993,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":964},{"end":1573,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":1511}],"target_id":"claim.frontier.arxiv-2607-27582","target_kind":"node","target_sha256":"e8e68d6b0df12301db9661c2496713721b7628a4788dad9a65a41d879cbde2bf"}],"claim.frontier.arxiv-2607-27629":[{"id":"assertion.claim.frontier.arxiv-2607-27629","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27629","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27629 \"Curved Kakeya problems and the projective geometry of paths\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff's hairbrush argument, is equivalent to projective flatness of the associated spray.\"","support":[{"end":2872,"quote":"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff&#39;s hairbrush argument, is equivalent to projective flatness of the associated spray.","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":2686},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":1008},{"end":2154,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":2092}],"target_id":"claim.frontier.arxiv-2607-27629","target_kind":"node","target_sha256":"2e003ad7a246ef42aed817d476f4214b1c7a9333208a0378c35256229b0795b3"}],"claim.frontier.arxiv-2607-27646":[{"id":"assertion.claim.frontier.arxiv-2607-27646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27646","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27646 \"Metric Rigidity in Anchored Sobolev Spaces on Intervals\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.\"","support":[{"end":1943,"quote":"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":1811},{"end":993,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":964},{"end":1469,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":1401}],"target_id":"claim.frontier.arxiv-2607-27646","target_kind":"node","target_sha256":"851d653d95093b2eb660f58138b505c08f583d0ac9d00be9f5a67690c7fb9c47"}],"claim.frontier.arxiv-2607-27707":[{"id":"assertion.claim.frontier.arxiv-2607-27707","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27707","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27707 \"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.\"","support":[{"end":3207,"quote":"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":2998},{"end":994,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":965},{"end":2114,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":2052}],"target_id":"claim.frontier.arxiv-2607-27707","target_kind":"node","target_sha256":"eb9757e7f1d323afcd0564351b8547c5038397ac44f3f380bccfd73aa80e6e23"}],"claim.frontier.arxiv-2607-27799":[{"id":"assertion.claim.frontier.arxiv-2607-27799","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27799","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27799 \"When do Kernels Admit Characteristic Functions?\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","support":[{"end":2269,"quote":"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":2133},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":1008},{"end":1915,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":1853}],"target_id":"claim.frontier.arxiv-2607-27799","target_kind":"node","target_sha256":"40064e0c61635f96e3d80ea26f1a42036686ace1fee24202642cccf220c6d54c"}],"claim.frontier.arxiv-2607-27805":[{"id":"assertion.claim.frontier.arxiv-2607-27805","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27805","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27805 \"Chaos in reason: How chain-of-thought LLMs can look for an answer\" (CC BY 4.0, submitted 2026-07-30) reports: \"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.\"","support":[{"end":2447,"quote":"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":2115},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":1022},{"end":1861,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":1799}],"target_id":"claim.frontier.arxiv-2607-27805","target_kind":"node","target_sha256":"99615f83b8d6c1dd752bbb8878461ebb53fb60418ca622a598ee5d4628d14d72"}],"claim.frontier.arxiv-2607-27860":[{"id":"assertion.claim.frontier.arxiv-2607-27860","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27860","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27860 \"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings indicate that BLR gas density serves as the primary physical driver underlying the \"global\" Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.\"","support":[{"end":4507,"quote":"Our findings indicate that BLR gas density serves as the primary physical driver underlying the &#34;global&#34; Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":4252},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":971},{"end":3088,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":3026}],"target_id":"claim.frontier.arxiv-2607-27860","target_kind":"node","target_sha256":"02c8184a383eaf1e244fc3544fcccc432fb2b6e36c22a640df192d98754145aa"}],"claim.frontier.arxiv-2607-27874":[{"id":"assertion.claim.frontier.arxiv-2607-27874","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27874","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27874 \"Non-conformal obstructions to bubble expansion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We uncover a new set of hydrodynamic obstructions to bubble expansion.\"","support":[{"end":2426,"quote":"We uncover a new set of hydrodynamic obstructions to bubble expansion.","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":2356},{"end":1137,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":1108},{"end":1959,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":1897}],"target_id":"claim.frontier.arxiv-2607-27874","target_kind":"node","target_sha256":"b6a11b8fea91f0e0f83577b6fcdd5decbe0e0e1eb40eddbbf071b0a87c45c2b2"}],"claim.frontier.arxiv-2607-27957":[{"id":"assertion.claim.frontier.arxiv-2607-27957","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27957","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27957 \"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography\" (CC BY 4.0, submitted 2026-07-30) reports: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","support":[{"end":2046,"quote":"We establish an exponential communication advantage enabled by multipartite quantum entanglement.","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":1949},{"end":997,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":968},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":1864}],"target_id":"claim.frontier.arxiv-2607-27957","target_kind":"node","target_sha256":"5febb37ad9946baf5896ff0e908bdd269245f60035c411c3824934c85fb49482"}],"claim.frontier.arxiv-2607-27985":[{"id":"assertion.claim.frontier.arxiv-2607-27985","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27985","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27985 \"Bridging continuous control and Floquet driving for charging many-body spin chains\" (CC BY 4.0, submitted 2026-07-30) reports: \"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.\"","support":[{"end":3032,"quote":"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":2858},{"end":1156,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":1127},{"end":2217,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":2155}],"target_id":"claim.frontier.arxiv-2607-27985","target_kind":"node","target_sha256":"8caf76a0b6a6a11a0a96ca9e9987b5de7720cef317b8ccdb4f3b934cf85662d0"}],"claim.frontier.arxiv-2607-28021":[{"id":"assertion.claim.frontier.arxiv-2607-28021","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28021","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28021 \"The Euler Characteristic Transform from a Convex Geometric Perspective\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.\"","support":[{"end":2575,"quote":"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":2390},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":1048},{"end":1732,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":1670}],"target_id":"claim.frontier.arxiv-2607-28021","target_kind":"node","target_sha256":"f037b90b35960faea0dbbb35dd6808319438235370f7746d79ab40d1665c7fd8"}],"claim.frontier.arxiv-2607-28080":[{"id":"assertion.claim.frontier.arxiv-2607-28080","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28080","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28080 \"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems\" (CC BY 4.0, submitted 2026-07-31) reports: \"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.\"","support":[{"end":1990,"quote":"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1806},{"end":1073,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1044},{"end":1561,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1499}],"target_id":"claim.frontier.arxiv-2607-28080","target_kind":"node","target_sha256":"fffc6292f0311238ff6128844cd4406163e04ef943f623c4fb8ba517092c6809"}],"claim.frontier.arxiv-2607-28095":[{"id":"assertion.claim.frontier.arxiv-2607-28095","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28095","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28095 \"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951\" (CC BY 4.0, submitted 2026-07-30) reports: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","support":[{"end":1981,"quote":"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":1843},{"end":995,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":966},{"end":1820,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":1758}],"target_id":"claim.frontier.arxiv-2607-28095","target_kind":"node","target_sha256":"87d7d995e2f2af4bba03d46eee4c1738d7456de015fdf34551437075d1263dc6"}],"claim.frontier.arxiv-2607-28140":[{"id":"assertion.claim.frontier.arxiv-2607-28140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28140","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28140 \"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","support":[{"end":4572,"quote":"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":4441},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":1022},{"end":3114,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":3052}],"target_id":"claim.frontier.arxiv-2607-28140","target_kind":"node","target_sha256":"9c58e7d41ab764d46e3af5fb7dca619b1a7f41eba8ca6b47cbe1b603d4ecb9d3"}],"claim.frontier.arxiv-2607-28161":[{"id":"assertion.claim.frontier.arxiv-2607-28161","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28161","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28161 \"A Mathematical Framework for Topological Causal Data Analysis\" (CC BY 4.0, submitted 2026-07-30) reports: \"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.\"","support":[{"end":2826,"quote":"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":2676},{"end":1125,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":1096},{"end":1805,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":1743}],"target_id":"claim.frontier.arxiv-2607-28161","target_kind":"node","target_sha256":"9c254f11581d6100885bab74dac158d01cc3004076424298bb40e49a756b04b7"}],"claim.frontier.arxiv-2607-28168":[{"id":"assertion.claim.frontier.arxiv-2607-28168","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28168","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28168 \"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.\"","support":[{"end":2012,"quote":"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1867},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1048},{"end":1589,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1527}],"target_id":"claim.frontier.arxiv-2607-28168","target_kind":"node","target_sha256":"a658682e794029d130d306b92c23614394e69d4c5a6ac6580b45be5b96b09800"}],"claim.frontier.arxiv-2607-28173":[{"id":"assertion.claim.frontier.arxiv-2607-28173","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28173","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28173 \"Semi-supervised Hopfield model: Theoretical and Numerical results\" (CC BY 4.0, submitted 2026-07-30) reports: \"Using Guerra's interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.\"","support":[{"end":2980,"quote":"Using Guerra&#39;s interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":2727},{"end":1004,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":975},{"end":1754,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":1692}],"target_id":"claim.frontier.arxiv-2607-28173","target_kind":"node","target_sha256":"da66c71e614ef5dd61b18c706becbd35d43c64d8222317c66e91b693d3e552f6"}],"claim.frontier.arxiv-2607-28345":[{"id":"assertion.claim.frontier.arxiv-2607-28345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28345","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28345 \"The cycle C9 does not admit uniform mixing\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","support":[{"end":2070,"quote":"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1900},{"end":1041,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1012},{"end":1819,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1757}],"target_id":"claim.frontier.arxiv-2607-28345","target_kind":"node","target_sha256":"3e2cf53185038cf71d657facc6c40cc9487133becd0db16ad222c4f4c64d607e"}],"claim.frontier.arxiv-2607-28438":[{"id":"assertion.claim.frontier.arxiv-2607-28438","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28438","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28438 \"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology\" (CC BY 4.0, submitted 2026-07-30) reports: \"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.\"","support":[{"end":4675,"quote":"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":4412},{"end":1098,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":1069},{"end":2796,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":2734}],"target_id":"claim.frontier.arxiv-2607-28438","target_kind":"node","target_sha256":"b8ce99cbe0652fa472bc9589631fa7e62ccd5a3bfaee9965d65d479def0c6ad0"}],"claim.frontier.arxiv-2607-28441":[{"id":"assertion.claim.frontier.arxiv-2607-28441","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28441","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28441 \"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.\"","support":[{"end":3177,"quote":"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":3048},{"end":1063,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":1034},{"end":2908,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":2846}],"target_id":"claim.frontier.arxiv-2607-28441","target_kind":"node","target_sha256":"a2403589095fcde979f5ca253b69442352028595dedf3280448f96c69545f3af"}],"claim.frontier.arxiv-2607-28471":[{"id":"assertion.claim.frontier.arxiv-2607-28471","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28471","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28471 \"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model\" (CC BY 4.0, submitted 2026-07-30) reports: \"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.\"","support":[{"end":2174,"quote":"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":1858},{"end":1004,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":975},{"end":1545,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":1483}],"target_id":"claim.frontier.arxiv-2607-28471","target_kind":"node","target_sha256":"4d65add9d1a652622288cdbb251ed1d754d2ce5ddd939538c425fb2bf7684b25"}],"claim.frontier.arxiv-2607-28479":[{"id":"assertion.claim.frontier.arxiv-2607-28479","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28479","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28479 \"Mitigating quantum decoherence via global optimal control\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","support":[{"end":2588,"quote":"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":2353},{"end":1054,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":1025},{"end":2330,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":2262}],"target_id":"claim.frontier.arxiv-2607-28479","target_kind":"node","target_sha256":"be5180441008a7ade05fea1460a32e1f2cbbd0c81ed2ad46288e08540662d86a"}],"claim.frontier.arxiv-2607-28491":[{"id":"assertion.claim.frontier.arxiv-2607-28491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28491","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28491 \"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.\"","support":[{"end":2313,"quote":"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":2148},{"end":1006,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":977},{"end":1533,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":1471}],"target_id":"claim.frontier.arxiv-2607-28491","target_kind":"node","target_sha256":"26a76ce6d80a2aaa14d76e8725098c1c859296ce39ebfedb46d40ffa61a73805"}],"claim.frontier.arxiv-2607-28504":[{"id":"assertion.claim.frontier.arxiv-2607-28504","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28504","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28504 \"Spacetime Layout and Logical Compilation of Color Code\" (CC BY 4.0, submitted 2026-07-30) reports: \"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.\"","support":[{"end":1834,"quote":"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":1681},{"end":997,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":968},{"end":1567,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":1505}],"target_id":"claim.frontier.arxiv-2607-28504","target_kind":"node","target_sha256":"ff1ac951d9ed4aecfa94ee757facca1d01417019039b2c65ca31a6a1c009df6f"}],"claim.frontier.arxiv-2607-28524":[{"id":"assertion.claim.frontier.arxiv-2607-28524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28524","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28524 \"Exact chiral symmetry with quantum signal processing\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.\"","support":[{"end":2832,"quote":"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":2588},{"end":1091,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":1062},{"end":2087,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":2025}],"target_id":"claim.frontier.arxiv-2607-28524","target_kind":"node","target_sha256":"3b8ce9e72aa71a1e155f84e0d5c27aea4cbe0fe65f72e7baacdecfccab393ee0"}],"claim.frontier.arxiv-2607-28533":[{"id":"assertion.claim.frontier.arxiv-2607-28533","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28533","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28533 \"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","support":[{"end":2517,"quote":"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":2308},{"end":1062,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":1033},{"end":1870,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":1808}],"target_id":"claim.frontier.arxiv-2607-28533","target_kind":"node","target_sha256":"c1b1780ec5d82a44b14c1d005bacf5e739b0dcd7863ad0302d15b4ac571e8c1a"}],"claim.frontier.arxiv-2607-28597":[{"id":"assertion.claim.frontier.arxiv-2607-28597","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28597","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28597 \"Nonnuclear Bunce-Deddens algebras\" (CC BY 4.0, submitted 2026-07-30) reports: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","support":[{"end":2109,"quote":"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1908},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1008},{"end":1575,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1513}],"target_id":"claim.frontier.arxiv-2607-28597","target_kind":"node","target_sha256":"071654c5deecf1957f82740c3fc8eb53489f4f39c41d46441f521e2ef05b84ac"}],"claim.frontier.arxiv-2607-28604":[{"id":"assertion.claim.frontier.arxiv-2607-28604","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28604","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28604 \"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.\"","support":[{"end":2924,"quote":"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":2721},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":971},{"end":1882,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":1820}],"target_id":"claim.frontier.arxiv-2607-28604","target_kind":"node","target_sha256":"036ad19aae6d25034450ee483989f781c3c592f4abf7fdbdadbb5d106800cbf0"}],"claim.frontier.arxiv-2607-28690":[{"id":"assertion.claim.frontier.arxiv-2607-28690","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28690","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28690 \"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces\" (CC BY 4.0, submitted 2026-07-30) reports: \"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.\"","support":[{"end":3124,"quote":"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":2930},{"end":1003,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":974},{"end":1669,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":1607}],"target_id":"claim.frontier.arxiv-2607-28690","target_kind":"node","target_sha256":"9a658a83f4c23f5a8ffbab78661bdcd78e072d6650375bc9f096d3621a702f42"}],"claim.frontier.arxiv-2607-28714":[{"id":"assertion.claim.frontier.arxiv-2607-28714","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28714","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28714 \"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our analysis reveals significant variations in polarimetric properties tracking the dip.\"","support":[{"end":4899,"quote":"Our analysis reveals significant variations in polarimetric properties tracking the dip.","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":4811},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":971},{"end":4426,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":4364}],"target_id":"claim.frontier.arxiv-2607-28714","target_kind":"node","target_sha256":"d965eaa9d8f201577617ac8b5370674482bfc09144d278bd158d3869e08411ae"}],"claim.frontier.arxiv-2607-28717":[{"id":"assertion.claim.frontier.arxiv-2607-28717","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28717","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28717 \"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets\" (CC BY 4.0, submitted 2026-07-30) reports: \"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.\"","support":[{"end":3782,"quote":"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":3566},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":1022},{"end":2610,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":2548}],"target_id":"claim.frontier.arxiv-2607-28717","target_kind":"node","target_sha256":"77875b340d08e67e2a93fafc6745f094351d6383ad58c0048fc97df8639d5898"}],"claim.frontier.arxiv-2607-28736":[{"id":"assertion.claim.frontier.arxiv-2607-28736","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28736","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28736 \"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","support":[{"end":3244,"quote":"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":2961},{"end":1102,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":1073},{"end":2145,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":2083}],"target_id":"claim.frontier.arxiv-2607-28736","target_kind":"node","target_sha256":"3e792c3213e1d05553aafbb815c36d86bae6ccdf00c1099f3acd7db2a2b2e4f2"}],"claim.frontier.arxiv-2607-28738":[{"id":"assertion.claim.frontier.arxiv-2607-28738","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28738","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28738 \"Obstructions to Traversable Wormholes in Einstein-Dirac Theory\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.\"","support":[{"end":2265,"quote":"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":2074},{"end":994,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":965},{"end":1487,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":1425}],"target_id":"claim.frontier.arxiv-2607-28738","target_kind":"node","target_sha256":"98a901bd013b2ad114cb8a9c1c4e8c8fba8824aab7af2091fa749a87b3125440"}],"claim.frontier.arxiv-2607-28739":[{"id":"assertion.claim.frontier.arxiv-2607-28739","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28739","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28739 \"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.\"","support":[{"end":4908,"quote":"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":4724},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":971},{"end":3753,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":3691}],"target_id":"claim.frontier.arxiv-2607-28739","target_kind":"node","target_sha256":"5737a6f2e286968f45bf9100c8eb3dc7976c48e9714769595b8b8ce38d616947"}],"claim.frontier.arxiv-2607-28746":[{"id":"assertion.claim.frontier.arxiv-2607-28746","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28746","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28746 \"From Horizon Microstates to the Black Hole Membrane\" (CC BY 4.0, submitted 2026-07-30) reports: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","support":[{"end":1777,"quote":"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1687},{"end":1086,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1057},{"end":1574,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1512}],"target_id":"claim.frontier.arxiv-2607-28746","target_kind":"node","target_sha256":"c72613e586ac06150904fdbd28656eefda4042f35ce6e7e2819a54abe89214f0"}],"claim.frontier.arxiv-2607-28883":[{"id":"assertion.claim.frontier.arxiv-2607-28883","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28883","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28883 \"The VORTEX cavity for the RADES axion haloscope\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","support":[{"end":2741,"quote":"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":2502},{"end":1050,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":1021},{"end":2281,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":2219}],"target_id":"claim.frontier.arxiv-2607-28883","target_kind":"node","target_sha256":"b3a9405f110630017bdc76652d4bf11e6f52206a10455a4493e822e81c56ef67"}],"claim.frontier.arxiv-2607-28893":[{"id":"assertion.claim.frontier.arxiv-2607-28893","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28893","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28893 \"Piecewise isometry groups of Euclidean tessellations\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","support":[{"end":2471,"quote":"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":2229},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":1008},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":1755}],"target_id":"claim.frontier.arxiv-2607-28893","target_kind":"node","target_sha256":"1f1510aea931c42c6454768e3094d4f080ed1518a859e367a23bb02c05d8cde2"}],"claim.frontier.arxiv-2607-28919":[{"id":"assertion.claim.frontier.arxiv-2607-28919","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28919","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28919 \"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.\"","support":[{"end":3267,"quote":"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":3085},{"end":1000,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":971},{"end":2602,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":2540}],"target_id":"claim.frontier.arxiv-2607-28919","target_kind":"node","target_sha256":"934232ee2bd37831760d1e98eefc57334c939b3d559bfb049cbd80ae1cfaf74e"}],"claim.frontier.arxiv-2607-29073":[{"id":"assertion.claim.frontier.arxiv-2607-29073","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29073","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29073 \"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.\"","support":[{"end":3387,"quote":"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":3258},{"end":997,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":968},{"end":2744,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":2682}],"target_id":"claim.frontier.arxiv-2607-29073","target_kind":"node","target_sha256":"2e0132025e74994feddd75b265a5efa7c4017fbaf9a4b24a80f478ca0555d89e"}],"claim.frontier.arxiv-2607-29123":[{"id":"assertion.claim.frontier.arxiv-2607-29123","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29123","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29123 \"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control\" (CC BY 4.0, submitted 2026-07-31) reports: \"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.\"","support":[{"end":3741,"quote":"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":3500},{"end":997,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":968},{"end":2025,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":1963}],"target_id":"claim.frontier.arxiv-2607-29123","target_kind":"node","target_sha256":"c201d621d0f9dabbb785194f256a28c5d7101e102443cd84d1588b8c11083e61"}],"claim.frontier.arxiv-2607-29131":[{"id":"assertion.claim.frontier.arxiv-2607-29131","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29131","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29131 \"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.\"","support":[{"end":2648,"quote":"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":2354},{"end":995,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":966},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":1864}],"target_id":"claim.frontier.arxiv-2607-29131","target_kind":"node","target_sha256":"c51af67854ad770652cb436958636bd792a8d4bd6f4e406dcb1560d25f244f09"}],"claim.frontier.arxiv-2607-29270":[{"id":"assertion.claim.frontier.arxiv-2607-29270","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29270","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29270 \"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications\" (CC BY 4.0, submitted 2026-07-31) reports: \"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.\"","support":[{"end":2509,"quote":"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":2302},{"end":1033,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":1004},{"end":1832,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":1770}],"target_id":"claim.frontier.arxiv-2607-29270","target_kind":"node","target_sha256":"de55d26538b9e15457e9fac048cb6462afe4830569b59e1727bd9f2f44f7a245"}],"claim.frontier.arxiv-2608-00445":[{"id":"assertion.claim.frontier.arxiv-2608-00445","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00445","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00445 \"Exact detection threshold of the packing test\" (CC0 1.0, submitted 2026-08-01) reports: \"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.\"","support":[{"end":1717,"quote":"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1489},{"end":1037,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1008},{"end":1466,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1398}],"target_id":"claim.frontier.arxiv-2608-00445","target_kind":"node","target_sha256":"481a7fd6920ffabcc7faf6f183539f0bda56f89fd4aa3d6599701810bab52b61"}],"claim.frontier.arxiv-2608-00649":[{"id":"assertion.claim.frontier.arxiv-2608-00649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00649","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00649 \"Empirical optimal transport potentials: fast rates and a functional central limit theorem\" (CC BY 4.0, submitted 2026-08-01) reports: \"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.\"","support":[{"end":3285,"quote":"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":3134},{"end":1037,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":1008},{"end":1866,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":1804}],"target_id":"claim.frontier.arxiv-2608-00649","target_kind":"node","target_sha256":"2535ec7e2ffd1b35b99c60209f71aa59120843a074e5d3575b1ffec32b9de9d7"}],"claim.frontier.arxiv-2608-00708":[{"id":"assertion.claim.frontier.arxiv-2608-00708","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00708","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00708 \"Hypergraphs on Riemannian manifolds and their double homology\" (CC BY 4.0, submitted 2026-08-01) reports: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","support":[{"end":1960,"quote":"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":1653},{"end":993,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":964},{"end":1468,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":1406}],"target_id":"claim.frontier.arxiv-2608-00708","target_kind":"node","target_sha256":"9a0dfb1a95664707f405a250d5d558b76eb0a8080348d20156ff6be43c1af670"}],"claim.frontier.arxiv-2608-02799":[{"id":"assertion.claim.frontier.arxiv-2608-02799","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02799","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02799 \"A Hyperfinite Framework for Score-Based Generative Modeling\" (CC BY 4.0, submitted 2026-08-03) reports: \"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.\"","support":[{"end":2077,"quote":"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1885},{"end":1117,"quote":"<created>2026-08-03</created>","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1088},{"end":1576,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1514}],"target_id":"claim.frontier.arxiv-2608-02799","target_kind":"node","target_sha256":"5aa63fc180e758460bfa662f32349c6521faf4a27d5f4bff60cabbdfac96224b"}],"claim.frontier.arxiv-2608-03192":[{"id":"assertion.claim.frontier.arxiv-2608-03192","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.03192","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.03192 \"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations\" (CC BY 4.0, submitted 2026-08-04) reports: \"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.\"","support":[{"end":3254,"quote":"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":2984},{"end":1037,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":1008},{"end":1696,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":1634}],"target_id":"claim.frontier.arxiv-2608-03192","target_kind":"node","target_sha256":"f6af3e54909d02eb7630b17b080796c56618da1aa9b40a0ef3710565f6ae2b36"}],"claim.frontier.arxiv-2608-03832":[{"id":"assertion.claim.frontier.arxiv-2608-03832","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.03832","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.03832 \"Reduced-rank Generalized Bilinear Models\" (CC BY 4.0, submitted 2026-08-04) reports: \"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.\"","support":[{"end":2439,"quote":"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":2169},{"end":993,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":964},{"end":1564,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":1502}],"target_id":"claim.frontier.arxiv-2608-03832","target_kind":"node","target_sha256":"8fe09e9a705ce0eaf87c894445ab35be4ea345d0478a0c217a5351ff0e00f1da"}],"claim.frontier.arxiv-2608-04208":[{"id":"assertion.claim.frontier.arxiv-2608-04208","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.04208","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.04208 \"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests\" (CC BY 4.0, submitted 2026-08-04) reports: \"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.\"","support":[{"end":2355,"quote":"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":2183},{"end":1081,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":1052},{"end":2001,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":1939}],"target_id":"claim.frontier.arxiv-2608-04208","target_kind":"node","target_sha256":"94f452a8cc248d71a71db4ef1077d3dd5fafad26c267c23e74dc588d40ad2bcc"}],"claim.frontier.arxiv-2608-06711":[{"id":"assertion.claim.frontier.arxiv-2608-06711","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.06711","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.06711 \"Conditions for Quantum Advantage in AC Power Flow\" (CC BY 4.0, submitted 2026-08-07) reports: \"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.\"","support":[{"end":2370,"quote":"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":2223},{"end":1081,"quote":"<created>2026-08-07</created>","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":1052},{"end":1983,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":1921}],"target_id":"claim.frontier.arxiv-2608-06711","target_kind":"node","target_sha256":"5855fd3085a0f97cb9e0e3cfe61fcf30ffb4b2d391e11998233482ecd972a43e"}],"claim.frontier.arxiv-2608-14134":[{"id":"assertion.claim.frontier.arxiv-2608-14134","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.14134","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.14134 \"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization\" (CC BY 4.0, submitted 2026-08-14) reports: \"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.\"","support":[{"end":2713,"quote":"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":2441},{"end":1043,"quote":"<created>2026-08-14</created>","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":1014},{"end":1827,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":1765}],"target_id":"claim.frontier.arxiv-2608-14134","target_kind":"node","target_sha256":"6c01ab4e708a9863ca23be95fdbb6722a752a446a36140911af6137473faf259"}],"claim.frontier.arxiv-2608-19170":[{"id":"assertion.claim.frontier.arxiv-2608-19170","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.19170","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.19170 \"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective\" (CC BY 4.0, submitted 2026-08-19) reports: \"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.\"","support":[{"end":3400,"quote":"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":3101},{"end":1077,"quote":"<created>2026-08-19</created>","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":1048},{"end":2200,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":2138}],"target_id":"claim.frontier.arxiv-2608-19170","target_kind":"node","target_sha256":"d1533e2f019c87bea123cecd0ee7da01d73d5464e068e7f3c4298e7afe487dfc"}],"claim.frontier.arxiv-2609-05100":[{"id":"assertion.claim.frontier.arxiv-2609-05100","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.05100","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.05100 \"Layered mixed matrices and reaction networks\" (CC BY 4.0, submitted 2026-09-04) reports: \"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.\"","support":[{"end":2529,"quote":"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":2331},{"end":1083,"quote":"<created>2026-09-04</created>","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":1054},{"end":1873,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":1811}],"target_id":"claim.frontier.arxiv-2609-05100","target_kind":"node","target_sha256":"71ee9b4a59f1c039ae93fc00db3ea32311df2dc51848ca5cd569a3cc0e38ff78"}],"claim.frontier.arxiv-2609-13345":[{"id":"assertion.claim.frontier.arxiv-2609-13345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.13345","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.13345 \"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data\" (CC BY 4.0, submitted 2026-09-11) reports: \"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.\"","support":[{"end":3114,"quote":"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":2868},{"end":1121,"quote":"<created>2026-09-11</created>","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":1092},{"end":2079,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":2017}],"target_id":"claim.frontier.arxiv-2609-13345","target_kind":"node","target_sha256":"2f360f3f349b774217c6e767666d7e256196481350c13cc7be45090f586e1e45"}],"claim.frontier.arxiv-2609-19386":[{"id":"assertion.claim.frontier.arxiv-2609-19386","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.19386","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.19386 \"Omitted Variable Bias in Difference-in-Differences Designs\" (CC BY 4.0, submitted 2026-09-16) reports: \"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.\"","support":[{"end":2723,"quote":"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":2350},{"end":1037,"quote":"<created>2026-09-16</created>","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":1008},{"end":1988,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":1926}],"target_id":"claim.frontier.arxiv-2609-19386","target_kind":"node","target_sha256":"e8c1bc8de0395c581648b92fc418ee61dd2476fea6c1d366414d1d13515f6367"}],"claim.frontier.arxiv-2609-21904":[{"id":"assertion.claim.frontier.arxiv-2609-21904","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21904","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21904 \"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model\" (CC BY 4.0, submitted 2026-09-18) reports: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","support":[{"end":2577,"quote":"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":2431},{"end":1039,"quote":"<created>2026-09-18</created>","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":1010},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":1944}],"target_id":"claim.frontier.arxiv-2609-21904","target_kind":"node","target_sha256":"d9aab030a07e0df2f3ed41f7494771bb4ba6436ca61f59b3d5d0b7b28f36adc7"}],"claim.frontier.arxiv-2609-39519":[{"id":"assertion.claim.frontier.arxiv-2609-39519","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.39519","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.39519 \"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics\" (CC BY 4.0, submitted 2026-09-30) reports: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","support":[{"end":3271,"quote":"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":3050},{"end":1138,"quote":"<created>2026-09-30</created>","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":1109},{"end":1886,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":1824}],"target_id":"claim.frontier.arxiv-2609-39519","target_kind":"node","target_sha256":"f55d8e4e72aac5489d6b5ef9d6c06d79d2abb13401c031c683fb4555dff98f5e"}],"claim.frontier.arxiv-2610-02106":[{"id":"assertion.claim.frontier.arxiv-2610-02106","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.02106","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.02106 \"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness\" (CC BY 4.0, submitted 2026-10-01) reports: \"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.\"","support":[{"end":3217,"quote":"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":2994},{"end":1083,"quote":"<created>2026-10-01</created>","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":1054},{"end":1845,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":1783}],"target_id":"claim.frontier.arxiv-2610-02106","target_kind":"node","target_sha256":"e271fa12c40b66084c7d0f6cdf8958ffb3d0fb6b95c27047d7ad3b487a942bcb"}],"claim.frontier.doi-10-1002-adfm-76901":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-76901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.76901","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.76901 \"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions\" (CC BY 4.0, published 2026-07-17) reports: \"Here, we report a fully biocompatible natural polymer‐based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.\"","support":[{"end":2397,"quote":"Here, we report a fully biocompatible natural polymer\\u2010based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":2211},{"end":14732,"quote":"\"published\":{\"date-parts\":[[2026,7,17]]}","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":14692},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":386}],"target_id":"claim.frontier.doi-10-1002-adfm-76901","target_kind":"node","target_sha256":"cc0312da0fb70263d40c3873bef61fdc3b3f9bcd82ae3f3f468fbef900e0efa4"}],"claim.frontier.doi-10-1002-adfm-77585":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-77585","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.77585","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.77585 \"An Electrowetting Pump\" (CC BY 4.0, published 2026-08-07) reports: \"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.\"","support":[{"end":2436,"quote":"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":2311},{"end":9322,"quote":"\"published\":{\"date-parts\":[[2026,8,7]]}","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":9283},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":407}],"target_id":"claim.frontier.doi-10-1002-adfm-77585","target_kind":"node","target_sha256":"9ad0029131f34b9ceaa77f3a8f33ab62e9a216dad09469f2708c7bbe5db7f51b"}],"claim.frontier.doi-10-1002-adfm-77938":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-77938","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.77938","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.77938 \"Load Distributing Metamaterials Via Discrete Optimization\" (CC BY 4.0, published 2026-09-04) reports: \"We demonstrate both single‐objective optimization for a prescribed indenter position and a multi‐objective formulation that enforces robust performance across multiple loading locations.\"","support":[{"end":3243,"quote":"We demonstrate both single\\u2010objective optimization for a prescribed indenter position and a multi\\u2010objective formulation that enforces robust performance across multiple loading locations.","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":3047},{"end":10111,"quote":"\"published\":{\"date-parts\":[[2026,9,4]]}","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":10072},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":398}],"target_id":"claim.frontier.doi-10-1002-adfm-77938","target_kind":"node","target_sha256":"ecbe1c0119aa9beb49bb472fc414e94a9232147524a41f685b61df459d57f266"}],"claim.frontier.doi-10-1002-adom-71396":[{"id":"assertion.claim.frontier.doi-10-1002-adom-71396","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adom.71396","quantifiers":"Only what the quoted sentence states","time":"2026-06-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","support":[{"end":2133,"quote":"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics.","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":1885},{"end":8142,"quote":"\"published\":{\"date-parts\":[[2026,6,24]]}","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":8102},{"end":456,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":399}],"target_id":"claim.frontier.doi-10-1002-adom-71396","target_kind":"node","target_sha256":"7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea"}],"claim.frontier.doi-10-1002-bse-71470":[{"id":"assertion.claim.frontier.doi-10-1002-bse-71470","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/bse.71470","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/bse.71470 \"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector\" (CC BY 4.0, published 2026-09-09) reports: \"Based on 41 semi‐structured interviews with representatives of 22 logistics companies in the Osnabrück region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource‐rich firms are more adept due to human resource slack, allowing them to process and document climate‐related sensory experiences and undertake anticipatory exercises.\"","support":[{"end":2112,"quote":"Based on 41 semi\\u2010structured interviews with representatives of 22 logistics companies in the Osnabr\\u00fcck region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource\\u2010rich firms are more adept due to human resource slack, allowing them to process and document climate\\u2010related sensory experiences and undertake anticipatory exercises.","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":1714},{"end":18933,"quote":"\"published\":{\"date-parts\":[[2026,9,9]]}","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":18894},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":395}],"target_id":"claim.frontier.doi-10-1002-bse-71470","target_kind":"node","target_sha256":"99f8f40d2f518f635ee207ed4e3fba7f4588b9070378efd9f377833a5cf7daba"}],"claim.frontier.doi-10-1002-cli2-70059":[{"id":"assertion.claim.frontier.doi-10-1002-cli2-70059","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/cli2.70059","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/cli2.70059 \"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems\" (CC BY 4.0, published 2026-08-20) reports: \"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).\"","support":[{"end":2720,"quote":"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":2444},{"end":26978,"quote":"\"published\":{\"date-parts\":[[2026,8,20]]}","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":26938},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":408}],"target_id":"claim.frontier.doi-10-1002-cli2-70059","target_kind":"node","target_sha256":"e1b471abf38ce27c8149ecb1e4569ed4ca277c53e045fa673b318e0f628a27f9"}],"claim.frontier.doi-10-1002-cli2-70062":[{"id":"assertion.claim.frontier.doi-10-1002-cli2-70062","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/cli2.70062","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/cli2.70062 \"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin\" (CC BY 4.0, published 2026-09-02) reports: \"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.\"","support":[{"end":3378,"quote":"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":3249},{"end":24344,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":24305},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":407}],"target_id":"claim.frontier.doi-10-1002-cli2-70062","target_kind":"node","target_sha256":"97b20c7b152e3c3498f9307f9cd70cc4fc781535496db6ca824273d0640507d8"}],"claim.frontier.doi-10-1002-eco-70277":[{"id":"assertion.claim.frontier.doi-10-1002-eco-70277","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eco.70277","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eco.70277 \"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland\" (CC BY 4.0, published 2026-09-28) reports: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","support":[{"end":2697,"quote":"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post\\u2010treatment, relative to an untreated watershed, and (3) ET decreased by 90\\u2009mm in the post treatment year for the treated watershed.","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":2283},{"end":25166,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":25126},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":397}],"target_id":"claim.frontier.doi-10-1002-eco-70277","target_kind":"node","target_sha256":"932d496ffc8bba319734c20d8eb9e41e733da81a9ae1d43dec6405e09d5dbdc7"}],"claim.frontier.doi-10-1002-eco-70279":[{"id":"assertion.claim.frontier.doi-10-1002-eco-70279","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eco.70279","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eco.70279 \"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests\" (CC BY 4.0, published 2026-09-30) reports: \"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.\"","support":[{"end":2072,"quote":"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":1954},{"end":25944,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":25904},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":397}],"target_id":"claim.frontier.doi-10-1002-eco-70279","target_kind":"node","target_sha256":"23af879371e74778a932bdcf86a5fcdae9a05278f15e12a59bdad6a33129bc75"}],"claim.frontier.doi-10-1002-eet-70139":[{"id":"assertion.claim.frontier.doi-10-1002-eet-70139","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eet.70139","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eet.70139 \"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours\" (CC BY 4.0, published 2026-09-14) reports: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","support":[{"end":2639,"quote":"We show that assembly members were more concerned about climate change and were more likely to engage in climate\\u2010conscious consumption habits following CAUK than before the assembly.","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":2452},{"end":16767,"quote":"\"published\":{\"date-parts\":[[2026,9,14]]}","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":16727},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":396}],"target_id":"claim.frontier.doi-10-1002-eet-70139","target_kind":"node","target_sha256":"e42f5af90a591ea76fd929813fb2a101f6b708a61553844e4d425148719ef4e8"}],"claim.frontier.doi-10-1002-eet-70146":[{"id":"assertion.claim.frontier.doi-10-1002-eet-70146","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eet.70146","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eet.70146 \"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy\" (CC BY 4.0, published 2026-09-30) reports: \"This study examines how three survey‐derived governance role orientations—governmental, civic, and industry‐and‐media orientations—and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate‐related civic participation behavior.\"","support":[{"end":1575,"quote":"This study examines how three survey\\u2010derived governance role orientations\\u2014governmental, civic, and industry\\u2010and\\u2010media orientations\\u2014and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate\\u2010related civic participation behavior.","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":1231},{"end":7717,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":7677},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":385}],"target_id":"claim.frontier.doi-10-1002-eet-70146","target_kind":"node","target_sha256":"89ca0ddd58ec8af408cc3a57606875c8d864099fc124cd4e52120fa7daba6e69"}],"claim.frontier.doi-10-1002-ese3-70586":[{"id":"assertion.claim.frontier.doi-10-1002-ese3-70586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ese3.70586","quantifiers":"Only what the quoted sentence states","time":"2026-06-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"","support":[{"end":1699,"quote":"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":1553},{"end":9350,"quote":"\"published\":{\"date-parts\":[[2026,6,23]]}","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":9310},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":408}],"target_id":"claim.frontier.doi-10-1002-ese3-70586","target_kind":"node","target_sha256":"3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144"}],"claim.frontier.doi-10-1002-ese3-70603":[{"id":"assertion.claim.frontier.doi-10-1002-ese3-70603","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ese3.70603","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"","support":[{"end":2198,"quote":"The results indicate that under the conditions set in this study, the fault stick\\u2010slip reaches a critical state when the fault pillar support pressure peaks.","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":2036},{"end":13269,"quote":"\"published\":{\"date-parts\":[[2026,7,14]]}","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":13229},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":408}],"target_id":"claim.frontier.doi-10-1002-ese3-70603","target_kind":"node","target_sha256":"e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a"}],"claim.frontier.doi-10-1002-esp-70399":[{"id":"assertion.claim.frontier.doi-10-1002-esp-70399","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp.70399","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp.70399 \"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska\" (CC BY 4.0, published 2026-08-27) reports: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","support":[{"end":2204,"quote":"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co\\u2010seismic damage.","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":1932},{"end":17653,"quote":"\"published\":{\"date-parts\":[[2026,8,27]]}","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":17613},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":398}],"target_id":"claim.frontier.doi-10-1002-esp-70399","target_kind":"node","target_sha256":"d276aea75a93573515ec73a9f1bb8b483caa5dd00dae4490ab112c7a2edaee3f"}],"claim.frontier.doi-10-1002-esp4-70082":[{"id":"assertion.claim.frontier.doi-10-1002-esp4-70082","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp4.70082","quantifiers":"Only what the quoted sentence states","time":"2026-05-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"","support":[{"end":2543,"quote":"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface\\u2010to\\u2010borehole transfer functions consistent with 1D assumptions.","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":2168},{"end":10883,"quote":"\"published\":{\"date-parts\":[[2026,5,29]]}","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":10843},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":408}],"target_id":"claim.frontier.doi-10-1002-esp4-70082","target_kind":"node","target_sha256":"15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912"}],"claim.frontier.doi-10-1002-esp4-70096":[{"id":"assertion.claim.frontier.doi-10-1002-esp4-70096","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp4.70096","quantifiers":"Only what the quoted sentence states","time":"2026-06-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"","support":[{"end":2303,"quote":"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":2142},{"end":11088,"quote":"\"published\":{\"date-parts\":[[2026,6,25]]}","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":11048},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":408}],"target_id":"claim.frontier.doi-10-1002-esp4-70096","target_kind":"node","target_sha256":"5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2"}],"claim.frontier.doi-10-1002-fea2-70077":[{"id":"assertion.claim.frontier.doi-10-1002-fea2-70077","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/fea2.70077","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/fea2.70077 \"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women\" (CC BY 4.0, published 2026-09-30) reports: \"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.\"","support":[{"end":1614,"quote":"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":1409},{"end":12158,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":12118},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":385}],"target_id":"claim.frontier.doi-10-1002-fea2-70077","target_kind":"node","target_sha256":"00a3f58f94358f52d1e397868c353d4f68fc570c98987e0769690dc1bc93bf0d"}],"claim.frontier.doi-10-1002-gdj3-70104":[{"id":"assertion.claim.frontier.doi-10-1002-gdj3-70104","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/gdj3.70104","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/gdj3.70104 \"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China\" (CC BY 4.0, published 2026-09-21) reports: \"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1 h.\"","support":[{"end":2159,"quote":"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1\\u2009h.","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":2018},{"end":13314,"quote":"\"published\":{\"date-parts\":[[2026,9,21]]}","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":13274},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":398}],"target_id":"claim.frontier.doi-10-1002-gdj3-70104","target_kind":"node","target_sha256":"0ea9efcdb5d7f7cae91f70c5f75b9ea3cf67c1a8ef09518e933f4175c15a0973"}],"claim.frontier.doi-10-1002-hec-70120":[{"id":"assertion.claim.frontier.doi-10-1002-hec-70120","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/hec.70120","quantifiers":"Only what the quoted sentence states","time":"2026-06-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"","support":[{"end":1327,"quote":"Using 2009\\u20132019 Behavioral Risk Factor Surveillance System data and a two\\u2010way fixed\\u2010effects difference\\u2010in\\u2010differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":1073},{"end":14101,"quote":"\"published\":{\"date-parts\":[[2026,6,22]]}","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":14061},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":397}],"target_id":"claim.frontier.doi-10-1002-hec-70120","target_kind":"node","target_sha256":"06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715"}],"claim.frontier.doi-10-1002-hec-70140":[{"id":"assertion.claim.frontier.doi-10-1002-hec-70140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/hec.70140","quantifiers":"Only what the quoted sentence states","time":"2026-08-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/hec.70140 \"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery\" (CC BY 4.0, published 2026-08-08) reports: \"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.\"","support":[{"end":2344,"quote":"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":2126},{"end":12515,"quote":"\"published\":{\"date-parts\":[[2026,8,8]]}","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":12476},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":397}],"target_id":"claim.frontier.doi-10-1002-hec-70140","target_kind":"node","target_sha256":"362c8742b04f7b46ac64a409263ac52f8d2510ccab52e734c440a20b65d50781"}],"claim.frontier.doi-10-1002-ijfe-70259":[{"id":"assertion.claim.frontier.doi-10-1002-ijfe-70259","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ijfe.70259","quantifiers":"Only what the quoted sentence states","time":"2026-07-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"","support":[{"end":1540,"quote":"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":1065},{"end":13844,"quote":"\"published\":{\"date-parts\":[[2026,7,12]]}","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":13804},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":395}],"target_id":"claim.frontier.doi-10-1002-ijfe-70259","target_kind":"node","target_sha256":"4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9"}],"claim.frontier.doi-10-1002-ijop-70275":[{"id":"assertion.claim.frontier.doi-10-1002-ijop-70275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ijop.70275","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ijop.70275 \"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020\" (CC BY 4.0, published 2026-10-02) reports: \"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.\"","support":[{"end":1971,"quote":"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":1754},{"end":8166,"quote":"\"published\":{\"date-parts\":[[2026,10,2]]}","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":8126},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":397}],"target_id":"claim.frontier.doi-10-1002-ijop-70275","target_kind":"node","target_sha256":"8e9f43b3daab1bb74b6712f04d7c38700f3040e429d218368d71b9c931568a53"}],"claim.frontier.doi-10-1002-iroh-70046":[{"id":"assertion.claim.frontier.doi-10-1002-iroh-70046","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/iroh.70046","quantifiers":"Only what the quoted sentence states","time":"2026-09-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/iroh.70046 \"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir\" (CC BY 4.0, published 2026-09-27) reports: \"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.\"","support":[{"end":5241,"quote":"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":5126},{"end":19326,"quote":"\"published\":{\"date-parts\":[[2026,9,27]]}","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":19286},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":397}],"target_id":"claim.frontier.doi-10-1002-iroh-70046","target_kind":"node","target_sha256":"fb87d188bb97aa410ae1b72a1aded942e7039c590781b39f5497fc8be7f0d390"}],"claim.frontier.doi-10-1002-jclp-70212":[{"id":"assertion.claim.frontier.doi-10-1002-jclp-70212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jclp.70212","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jclp.70212 \"Distant and Distressed: Interpersonal Problems in Anxiety and Depression\" (CC BY 4.0, published 2026-09-12) reports: \"As predicted, a cold‐submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.\"","support":[{"end":2859,"quote":"As predicted, a cold\\u2010submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":2722},{"end":13003,"quote":"\"published\":{\"date-parts\":[[2026,9,12]]}","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":12963},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":396}],"target_id":"claim.frontier.doi-10-1002-jclp-70212","target_kind":"node","target_sha256":"47d977b3ddf6d692aaf1d2aa0d195cdd39520a1994076a85336d4daeffbec240"}],"claim.frontier.doi-10-1002-joc-70436":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70436","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70436","quantifiers":"Only what the quoted sentence states","time":"2026-05-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"","support":[{"end":2199,"quote":"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":2020},{"end":12801,"quote":"\"published\":{\"date-parts\":[[2026,5,26]]}","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":12761},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":409}],"target_id":"claim.frontier.doi-10-1002-joc-70436","target_kind":"node","target_sha256":"af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a"}],"claim.frontier.doi-10-1002-joc-70526":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70526","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70526","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70526 \"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI\" (CC BY 4.0, published 2026-07-28) reports: \"The results reveal a spatially heterogeneous and non‐stationary drought regime across Greece.\"","support":[{"end":1892,"quote":"The results reveal a spatially heterogeneous and non\\u2010stationary drought regime across Greece.","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":1794},{"end":11966,"quote":"\"published\":{\"date-parts\":[[2026,7,28]]}","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":11926},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":386}],"target_id":"claim.frontier.doi-10-1002-joc-70526","target_kind":"node","target_sha256":"386007d2450ca9b0bf6898dede90d1f16698fcae96c58a46c3935532f08764ce"}],"claim.frontier.doi-10-1002-joc-70540":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70540","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70540","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70540 \"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models\" (CC BY 4.0, published 2026-08-02) reports: \"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher‐resolution ensembles within the UKCP18 framework.\"","support":[{"end":3169,"quote":"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher\\u2010resolution ensembles within the UKCP18 framework.","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":2866},{"end":10138,"quote":"\"published\":{\"date-parts\":[[2026,8,2]]}","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":10099},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":384}],"target_id":"claim.frontier.doi-10-1002-joc-70540","target_kind":"node","target_sha256":"d876068aefa7381aa2f986142c22efcbafe2993bbbf4713b88261bc077c983d8"}],"claim.frontier.doi-10-1002-joc-70605":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70605","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70605 \"Climate Change Projections for Mexico in the 21st Century\" (CC BY 4.0, published 2026-10-06) reports: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","support":[{"end":3297,"quote":"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":3060},{"end":11273,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":11233},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70605","target_kind":"node","target_sha256":"f969e55d7c3e65b0676f9835895931ab3d6471800d5488f68cb1597f9fb7117b"}],"claim.frontier.doi-10-1002-joc-70613":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70613","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70613","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70613 \"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia\" (CC BY 4.0, published 2026-10-06) reports: \"These findings demonstrate that dynamical downscaling substantially reduces large‐scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.\"","support":[{"end":3508,"quote":"These findings demonstrate that dynamical downscaling substantially reduces large\\u2010scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":3264},{"end":31075,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":31035},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70613","target_kind":"node","target_sha256":"5ae2bb018f8d4930b105adbef2018ddeb2c471bb66c6a7454e3f0ae271790bab"}],"claim.frontier.doi-10-1002-joc-70629":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70629","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70629","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70629 \"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections\" (CC BY 4.0, published 2026-10-08) reports: \"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4 days/decade), suggesting greater irregularity in the regional precipitation regime.\"","support":[{"end":2875,"quote":"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4\\u2009days\\/decade), suggesting greater irregularity in the regional precipitation regime.","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":2670},{"end":19083,"quote":"\"published\":{\"date-parts\":[[2026,10,8]]}","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":19043},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70629","target_kind":"node","target_sha256":"07388bfa91d146b7ee6a7175ac28f177abcbe1486d17a5754798edda9c6f9c13"}],"claim.frontier.doi-10-1002-jpln-70107":[{"id":"assertion.claim.frontier.doi-10-1002-jpln-70107","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jpln.70107","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jpln.70107 \"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types\" (CC BY 4.0, published 2026-08-12) reports: \": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.\"","support":[{"end":3512,"quote":": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":3311},{"end":7483,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":7443},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":396}],"target_id":"claim.frontier.doi-10-1002-jpln-70107","target_kind":"node","target_sha256":"7caec28a5f79904fabf4c5acb9a7e00d8efc698de019e19b5f0672048665f6b1"}],"claim.frontier.doi-10-1002-jpln-70129":[{"id":"assertion.claim.frontier.doi-10-1002-jpln-70129","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jpln.70129","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jpln.70129 \"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps\" (CC BY 4.0, published 2026-10-06) reports: \"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate‐driven water stress.\"","support":[{"end":3677,"quote":"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate\\u2010driven water stress.","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":3557},{"end":14046,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":14006},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":385}],"target_id":"claim.frontier.doi-10-1002-jpln-70129","target_kind":"node","target_sha256":"3f5813936443ab3880eb08ee6845a959024d90004dd31b164dccb6450ad90ca1"}],"claim.frontier.doi-10-1002-jqs-70108":[{"id":"assertion.claim.frontier.doi-10-1002-jqs-70108","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jqs.70108","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jqs.70108 \"A talus rock glacier in Nantlle Valley, North Wales\" (CC BY 4.0, published 2026-08-26) reports: \"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small‐scale failure events.\"","support":[{"end":1840,"quote":"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small\\u2010scale failure events.","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":1670},{"end":22867,"quote":"\"published\":{\"date-parts\":[[2026,8,26]]}","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":22827},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":396}],"target_id":"claim.frontier.doi-10-1002-jqs-70108","target_kind":"node","target_sha256":"03f0b2421318c13287ed8b988e030e79730a9d2f7b6f57b7d4f7be42f609ec38"}],"claim.frontier.doi-10-1002-lol2-70186":[{"id":"assertion.claim.frontier.doi-10-1002-lol2-70186","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/lol2.70186","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/lol2.70186 \"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers\" (CC BY 4.0, published 2026-10-09) reports: \"We identify extensive subsurface sediment plumes from marine‐terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment‐core reconstructions.\"","support":[{"end":2131,"quote":"We identify extensive subsurface sediment plumes from marine\\u2010terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment\\u2010core reconstructions.","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":1924},{"end":8671,"quote":"\"published\":{\"date-parts\":[[2026,10,9]]}","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":8631},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":397}],"target_id":"claim.frontier.doi-10-1002-lol2-70186","target_kind":"node","target_sha256":"ed4a7c3ee5de681986a3ae5f899173ec642ef8662f832b596144e7ccf408e1e3"}],"claim.frontier.doi-10-1002-msd2-70089":[{"id":"assertion.claim.frontier.doi-10-1002-msd2-70089","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/msd2.70089","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/msd2.70089 \"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission\" (CC BY 4.0, published 2026-08-24) reports: \"The stability of the controlling system is proved by the Lyapunov stability theory.\"","support":[{"end":2699,"quote":"The stability of the controlling system is proved by the Lyapunov stability theory.","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":2616},{"end":14462,"quote":"\"published\":{\"date-parts\":[[2026,8,24]]}","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":14422},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":396}],"target_id":"claim.frontier.doi-10-1002-msd2-70089","target_kind":"node","target_sha256":"ff896932e901389d4c8cf6a95c5346b4586402514c2f4df84fa7968efe070f7f"}],"claim.frontier.doi-10-1002-nzm2-70056":[{"id":"assertion.claim.frontier.doi-10-1002-nzm2-70056","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/nzm2.70056","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/nzm2.70056 \"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand\" (CC BY 4.0, published 2026-07-16) reports: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","support":[{"end":1874,"quote":"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":1641},{"end":15282,"quote":"\"published\":{\"date-parts\":[[2026,7,16]]}","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":15242},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":397}],"target_id":"claim.frontier.doi-10-1002-nzm2-70056","target_kind":"node","target_sha256":"b2c84605c03023188bb6bfae04fbadd0d0f396b6a28e669be64f79cf6cc431bf"}],"claim.frontier.doi-10-1002-pei3-70207":[{"id":"assertion.claim.frontier.doi-10-1002-pei3-70207","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/pei3.70207","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/pei3.70207 \"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment\" (CC BY 4.0, published 2026-09-30) reports: \"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1°C rise in temperature was associated with a 10% reduction in major staple crop production.\"","support":[{"end":2405,"quote":"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1\\u00b0C rise in temperature was associated with a 10% reduction in major staple crop production.","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":2172},{"end":43482,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":43442},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":398}],"target_id":"claim.frontier.doi-10-1002-pei3-70207","target_kind":"node","target_sha256":"f6d7126485d10cb3fbc702ba0aba310b5fcc9fa3b8bfceef62d1ab470ecf9015"}],"claim.frontier.doi-10-1002-ppp-70049":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70049","quantifiers":"Only what the quoted sentence states","time":"2026-07-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"","support":[{"end":2897,"quote":"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium\\u2010range weather prediction ensembles are used to drive the model.","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":2697},{"end":17580,"quote":"\"published\":{\"date-parts\":[[2026,7,5]]}","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":17541},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70049","target_kind":"node","target_sha256":"7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9"}],"claim.frontier.doi-10-1002-ppp-70053":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70053","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70053","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"","support":[{"end":2255,"quote":"The results suggest that the 5\\u2009m tall dome\\u2010shaped palsa contains permafrost up to 20\\u2010m\\u2010thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower\\u2010relief areas on the palsa.","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":2025},{"end":11852,"quote":"\"published\":{\"date-parts\":[[2026,7,14]]}","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":11812},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70053","target_kind":"node","target_sha256":"20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5"}],"claim.frontier.doi-10-1002-ppp-70058":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70058","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70058","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70058 \"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape\" (CC BY 4.0, published 2026-08-12) reports: \"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.\"","support":[{"end":3719,"quote":"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":3440},{"end":14731,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":14691},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70058","target_kind":"node","target_sha256":"7d164c252922852307aecf82cdf3d51384bbd769b8656def08e486f5e3fa01f6"}],"claim.frontier.doi-10-1002-qj-70252":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70252","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70252 \"Using microwave imager observations to improve the ocean temperature in a coupled NWP system\" (CC BY 4.0, published 2026-08-02) reports: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","support":[{"end":2009,"quote":"It is shown that these skin temperature estimates improve the fit of the short\\u2010range forecast ocean temperature profiles to Array for Real\\u2010Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":1736},{"end":11765,"quote":"\"published\":{\"date-parts\":[[2026,8,2]]}","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":11726},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":384}],"target_id":"claim.frontier.doi-10-1002-qj-70252","target_kind":"node","target_sha256":"0d2ec90d7c004965336849e7dc4a9cca620c05fb97297819be281f3398bd44c3"}],"claim.frontier.doi-10-1002-qj-70302":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70302","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70302","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70302 \"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments\" (CC BY 4.0, published 2026-09-03) reports: \"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.\"","support":[{"end":3273,"quote":"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":3131},{"end":10119,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":10080},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":394}],"target_id":"claim.frontier.doi-10-1002-qj-70302","target_kind":"node","target_sha256":"a5daec029c63e95a1c3f0a85b4676dcac7ad1366bb714d865261bc3cc1af294c"}],"claim.frontier.doi-10-1002-qj-70308":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70308","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70308","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70308 \"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas\" (CC BY 4.0, published 2026-09-17) reports: \"In contrast, the WH‐WD and CH‐WD clusters are associated with upper‐level cyclonic anomalies characteristic of WDs, embedded within broader wave‐train‐like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)–subtropical jet (STJ)–WD pathways.\"","support":[{"end":2553,"quote":"In contrast, the WH\\u2010WD and CH\\u2010WD clusters are associated with upper\\u2010level cyclonic anomalies characteristic of WDs, embedded within broader wave\\u2010train\\u2010like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)\\u2013subtropical jet (STJ)\\u2013WD pathways.","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":2228},{"end":22106,"quote":"\"published\":{\"date-parts\":[[2026,9,17]]}","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":22066},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":386}],"target_id":"claim.frontier.doi-10-1002-qj-70308","target_kind":"node","target_sha256":"0fa42e72c19a4c09d0231d49d041f0b7ae1cd295ff1f5960b6fc6736461d54c2"}],"claim.frontier.doi-10-1002-qj-70320":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70320","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70320 \"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain\" (CC BY 4.0, published 2026-09-29) reports: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","support":[{"end":1825,"quote":"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":1679},{"end":9942,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":9902},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":385}],"target_id":"claim.frontier.doi-10-1002-qj-70320","target_kind":"node","target_sha256":"5f923eb3d0e3c0730ba2550114be65407656d8a42918dfb55a22e1d9b2ccf8eb"}],"claim.frontier.doi-10-1002-qj-70333":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70333","quantifiers":"Only what the quoted sentence states","time":"2026-10-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70333 \"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022\" (CC BY 4.0, published 2026-10-15) reports: \"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.\"","support":[{"end":2973,"quote":"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":2818},{"end":15280,"quote":"\"published\":{\"date-parts\":[[2026,10,15]]}","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":15239},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":387}],"target_id":"claim.frontier.doi-10-1002-qj-70333","target_kind":"node","target_sha256":"0d872817b56073a0487518b3bc1ce9d91303a7a2b95c379f932c4b829e96d01c"}],"claim.frontier.doi-10-1002-sce-70090":[{"id":"assertion.claim.frontier.doi-10-1002-sce-70090","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/sce.70090","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"","support":[{"end":2079,"quote":"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":1981},{"end":25346,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":25306},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":398}],"target_id":"claim.frontier.doi-10-1002-sce-70090","target_kind":"node","target_sha256":"7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc"}],"claim.frontier.doi-10-1002-tox-70177":[{"id":"assertion.claim.frontier.doi-10-1002-tox-70177","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/tox.70177","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/tox.70177 \"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa\" (CC BY 4.0, published 2026-08-07) reports: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","support":[{"end":3653,"quote":"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water\\u2010quality management, and underscore the need for continued monitoring to support effective water\\u2010resource management.","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":3409},{"end":16967,"quote":"\"published\":{\"date-parts\":[[2026,8,7]]}","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":16928},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":394}],"target_id":"claim.frontier.doi-10-1002-tox-70177","target_kind":"node","target_sha256":"91b5eba28359f7aee9e6a4a07e2f1450da71689334ace373f0ec6a8bf1de7e61"}],"claim.frontier.doi-10-1029-2025ea004610":[{"id":"assertion.claim.frontier.doi-10-1029-2025ea004610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025ea004610","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"","support":[{"end":1921,"quote":"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":1745},{"end":9952,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":9912},{"end":491,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":434}],"target_id":"claim.frontier.doi-10-1029-2025ea004610","target_kind":"node","target_sha256":"3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c"}],"claim.frontier.doi-10-1029-2025gc012776":[{"id":"assertion.claim.frontier.doi-10-1029-2025gc012776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gc012776","quantifiers":"Only what the quoted sentence states","time":"2026-05-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"","support":[{"end":1428,"quote":"We show the first results of sidescan\\u2010sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":1295},{"end":13083,"quote":"\"published\":{\"date-parts\":[[2026,5,28]]}","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":13043},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":424}],"target_id":"claim.frontier.doi-10-1029-2025gc012776","target_kind":"node","target_sha256":"be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96"}],"claim.frontier.doi-10-1029-2025gl121171":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121171","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121171","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"","support":[{"end":2602,"quote":"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top\\u2010down estimates of the terrestrial carbon sink.","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":2451},{"end":12705,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":12665},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121171","target_kind":"node","target_sha256":"34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89"}],"claim.frontier.doi-10-1029-2025gl121323":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121323","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121323","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"","support":[{"end":2230,"quote":"Here we report Fe concentrations and isotopic compositions from a Fe\\u2010Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":2082},{"end":15200,"quote":"\"published\":{\"date-parts\":[[2026,7,13]]}","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":15160},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121323","target_kind":"node","target_sha256":"e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7"}],"claim.frontier.doi-10-1029-2025gl121378":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121378","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121378","quantifiers":"Only what the quoted sentence states","time":"2026-06-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"","support":[{"end":2659,"quote":"These findings highlight the utility of dv\\/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater\\u2013vegetation interactions, and supporting ecohydrological research and water management in semi\\u2010arid snowmelt systems.","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":2343},{"end":13355,"quote":"\"published\":{\"date-parts\":[[2026,6,16]]}","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":13315},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121378","target_kind":"node","target_sha256":"f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385"}],"claim.frontier.doi-10-1029-2025jb032632":[{"id":"assertion.claim.frontier.doi-10-1029-2025jb032632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jb032632","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jb032632 \"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series\" (CC BY 4.0, published 2026-07-30) reports: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","support":[{"end":2532,"quote":"In a comparison with Global Navigation Satellite System\\u2010derived measurements of deformation, our approach dramatically outperforms a state\\u2010of\\u2010the\\u2010art correction method based on a weather model, reducing root\\u2010mean\\u2010square error by  (0.006\\u00a0m vs. 0.017\\u00a0m).","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":2240},{"end":10181,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":10141},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":435}],"target_id":"claim.frontier.doi-10-1029-2025jb032632","target_kind":"node","target_sha256":"9f96cf8c93c7db4cb362f8cde4c9b887b6f5cd22c7b9a7255263f2d6a9def062"}],"claim.frontier.doi-10-1029-2025jb033060":[{"id":"assertion.claim.frontier.doi-10-1029-2025jb033060","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jb033060","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","support":[{"end":2398,"quote":"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":2183},{"end":17528,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":17488},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":424}],"target_id":"claim.frontier.doi-10-1029-2025jb033060","target_kind":"node","target_sha256":"707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840"}],"claim.frontier.doi-10-1029-2025jc023581":[{"id":"assertion.claim.frontier.doi-10-1029-2025jc023581","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jc023581","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jc023581 \"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey\" (CC BY 4.0, published 2026-07-30) reports: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","support":[{"end":2059,"quote":"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":1920},{"end":18335,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":18295},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":426}],"target_id":"claim.frontier.doi-10-1029-2025jc023581","target_kind":"node","target_sha256":"297c72011a9be269947e359261441d96b665b9afac0cc13f4b710a1272afc2f5"}],"claim.frontier.doi-10-1029-2025jd044617":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd044617","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd044617","quantifiers":"Only what the quoted sentence states","time":"2026-06-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"","support":[{"end":1917,"quote":"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper\\u2010level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":1646},{"end":14772,"quote":"\"published\":{\"date-parts\":[[2026,6,10]]}","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":14732},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":426}],"target_id":"claim.frontier.doi-10-1029-2025jd044617","target_kind":"node","target_sha256":"0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9"}],"claim.frontier.doi-10-1029-2025jd045718":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd045718","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd045718","quantifiers":"Only what the quoted sentence states","time":"2026-06-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"","support":[{"end":2165,"quote":"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":1844},{"end":11142,"quote":"\"published\":{\"date-parts\":[[2026,6,6]]}","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":11103},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":425}],"target_id":"claim.frontier.doi-10-1029-2025jd045718","target_kind":"node","target_sha256":"36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7"}],"claim.frontier.doi-10-1029-2025jd045965":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd045965","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd045965","quantifiers":"Only what the quoted sentence states","time":"2026-06-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"","support":[{"end":3253,"quote":"These findings suggest that future dust transport to high\\u2010elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":3071},{"end":16788,"quote":"\"published\":{\"date-parts\":[[2026,6,2]]}","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":16749},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":425}],"target_id":"claim.frontier.doi-10-1029-2025jd045965","target_kind":"node","target_sha256":"a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7"}],"claim.frontier.doi-10-1029-2025jd046190":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd046190","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd046190","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"","support":[{"end":3449,"quote":"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution\\u2010dependent, and the plume rise model still fails to reproduce the highest observed plume heights.","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":3240},{"end":13259,"quote":"\"published\":{\"date-parts\":[[2026,7,13]]}","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":13219},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":436}],"target_id":"claim.frontier.doi-10-1029-2025jd046190","target_kind":"node","target_sha256":"e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8"}],"claim.frontier.doi-10-1029-2025wr041875":[{"id":"assertion.claim.frontier.doi-10-1029-2025wr041875","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025wr041875","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"","support":[{"end":2590,"quote":"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":2380},{"end":9034,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":8994},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":435}],"target_id":"claim.frontier.doi-10-1029-2025wr041875","target_kind":"node","target_sha256":"9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9"}],"claim.frontier.doi-10-1029-2025wr042846":[{"id":"assertion.claim.frontier.doi-10-1029-2025wr042846","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025wr042846","quantifiers":"Only what the quoted sentence states","time":"2026-05-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"","support":[{"end":2504,"quote":"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":2317},{"end":22905,"quote":"\"published\":{\"date-parts\":[[2026,5,30]]}","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":22865},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":425}],"target_id":"claim.frontier.doi-10-1029-2025wr042846","target_kind":"node","target_sha256":"cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86"}],"claim.frontier.doi-10-1029-2026gc013127":[{"id":"assertion.claim.frontier.doi-10-1029-2026gc013127","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gc013127","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gc013127 \"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana\" (CC BY 4.0, published 2026-09-29) reports: \"Together with regional Permian plume‐affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.\"","support":[{"end":3392,"quote":"Together with regional Permian plume\\u2010affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":3135},{"end":25404,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":25364},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gc013127","target_kind":"node","target_sha256":"df6bf646bb406fc1b577ed3edf05d6bea2c933a7385138811808492a8c675c3c"}],"claim.frontier.doi-10-1029-2026gl122157":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122157","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122157","quantifiers":"Only what the quoted sentence states","time":"2026-06-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"","support":[{"end":1992,"quote":"These observations indicate substantial coarse sediment retention within an active near\\u2010terminus subglacial channel, potentially weakening short\\u2010term correspondence between coarse subglacial transport and proglacial sediment export.","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":1750},{"end":9999,"quote":"\"published\":{\"date-parts\":[[2026,6,26]]}","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":9959},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl122157","target_kind":"node","target_sha256":"aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284"}],"claim.frontier.doi-10-1029-2026gl122518":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122518","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122518","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"","support":[{"end":2909,"quote":"These results indicate that half\\u2010space assumptions capture the first\\u2010order rupture characteristics but can introduce significant bias in detailed rupture processes.","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":2735},{"end":12044,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":12005},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl122518","target_kind":"node","target_sha256":"d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516"}],"claim.frontier.doi-10-1029-2026gl122539":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122539","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122539","quantifiers":"Only what the quoted sentence states","time":"2026-07-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122539 \"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics\" (CC BY 4.0, published 2026-07-18) reports: \"We demonstrate that repeated SWOT high‐rate acquisitions can accurately monitor changes in ice‐shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.\"","support":[{"end":1897,"quote":"We demonstrate that repeated SWOT high\\u2010rate acquisitions can accurately monitor changes in ice\\u2010shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":1586},{"end":17945,"quote":"\"published\":{\"date-parts\":[[2026,7,18]]}","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":17905},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl122539","target_kind":"node","target_sha256":"cfcba1e3e5b3628586a03c6d9ee36c942e9f5279c6880df3a59ceb7c3dce02b1"}],"claim.frontier.doi-10-1029-2026gl122610":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122610","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122610 \"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin\" (CC BY 4.0, published 2026-09-18) reports: \"These results show that SWOT WSE assimilation improves discharge estimates under real‐world constraints, supporting water management in data‐sparse and transboundary basins globally.\"","support":[{"end":2215,"quote":"These results show that SWOT WSE assimilation improves discharge estimates under real\\u2010world constraints, supporting water management in data\\u2010sparse and transboundary basins globally.","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":2023},{"end":12427,"quote":"\"published\":{\"date-parts\":[[2026,9,18]]}","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":12387},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl122610","target_kind":"node","target_sha256":"27aacbd05e369f29387cd7a2e4eea82b687c2a65ed4b89232758ab785d137863"}],"claim.frontier.doi-10-1029-2026gl122646":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122646","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122646 \"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land\" (CC BY 4.0, published 2026-08-12) reports: \"We analyze near‐coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot/humid extremes on land.\"","support":[{"end":1630,"quote":"We analyze near\\u2010coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat\\/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot\\/humid extremes on land.","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":1271},{"end":10945,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":10905},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl122646","target_kind":"node","target_sha256":"fadfbea70e81d9bc9708a79769da09a9a6afc6c1acf07dc54498420e51a2759f"}],"claim.frontier.doi-10-1029-2026gl122664":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122664","quantifiers":"Only what the quoted sentence states","time":"2026-06-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"","support":[{"end":2456,"quote":"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake\\u2010river science and water management.","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":2288},{"end":12140,"quote":"\"published\":{\"date-parts\":[[2026,6,4]]}","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":12101},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":435}],"target_id":"claim.frontier.doi-10-1029-2026gl122664","target_kind":"node","target_sha256":"f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af"}],"claim.frontier.doi-10-1029-2026gl123355":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl123355","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl123355","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"","support":[{"end":1831,"quote":"We report a rare quiet\\u2010time observation by NOAA\\u201018 spacecraft flying nearly along the electron isotropy boundary (IBe).","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":1702},{"end":10971,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":10931},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl123355","target_kind":"node","target_sha256":"88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34"}],"claim.frontier.doi-10-1029-2026gl123821":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl123821","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl123821","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl123821 \"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers\" (CC BY 4.0, published 2026-08-05) reports: \"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land‐surface processes.\"","support":[{"end":2317,"quote":"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land\\u2010surface processes.","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":2173},{"end":15666,"quote":"\"published\":{\"date-parts\":[[2026,8,5]]}","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":15627},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":424}],"target_id":"claim.frontier.doi-10-1029-2026gl123821","target_kind":"node","target_sha256":"7dbc92b200702547607024be1de7289f698d5298da3a9d788be3946ac22d3c7c"}],"claim.frontier.doi-10-1029-2026gl124090":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124090","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124090","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124090 \"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?\" (CC BY 4.0, published 2026-09-30) reports: \"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.\"","support":[{"end":2235,"quote":"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":2070},{"end":9931,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":9891},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124090","target_kind":"node","target_sha256":"ff8032e649311f9d6684fed35770e8d72d39748fdd2007c2a4447279d30f7694"}],"claim.frontier.doi-10-1029-2026gl124111":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124111","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124111","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124111 \"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation\" (CC BY 4.0, published 2026-07-23) reports: \"Using observational data sets and numerical experiments, we demonstrate that this IOD‐ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).\"","support":[{"end":3242,"quote":"Using observational data sets and numerical experiments, we demonstrate that this IOD\\u2010ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":3011},{"end":16538,"quote":"\"published\":{\"date-parts\":[[2026,7,23]]}","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":16498},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl124111","target_kind":"node","target_sha256":"2a1cb84b35a71dc359e79efc288b4dbeda7c9449cbc9b9cb1687eb81774bcf30"}],"claim.frontier.doi-10-1029-2026gl124233":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124233","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124233","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124233 \"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change\" (CC BY 4.0, published 2026-09-29) reports: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","support":[{"end":2259,"quote":"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":2024},{"end":11285,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":11245},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124233","target_kind":"node","target_sha256":"c990db21bb02ac6e1f64fbb7c329e9c84dd0175e1b37292bfaffe5bd873886dd"}],"claim.frontier.doi-10-1029-2026gl124411":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124411","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124411","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124411 \"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing\" (CC BY 4.0, published 2026-10-08) reports: \"The results showed that the too‐intense localized precipitation frequently produced in km‐scale models, known as “popcorn‐like” precipitation, weakens as resolution increases.\"","support":[{"end":2555,"quote":"The results showed that the too\\u2010intense localized precipitation frequently produced in km\\u2010scale models, known as \\u201cpopcorn\\u2010like\\u201d precipitation, weakens as resolution increases.","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":2355},{"end":12607,"quote":"\"published\":{\"date-parts\":[[2026,10,8]]}","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":12567},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124411","target_kind":"node","target_sha256":"4cd1070aee40475dd6d06e6ab0fadb7be7d587e75c98038196ec75776733f3e7"}],"claim.frontier.doi-10-1029-2026gl124622":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124622","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124622","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124622 \"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models\" (CC BY 4.0, published 2026-10-14) reports: \"These findings suggest that flood risk communication under climate warming should distinguish broad climate‐driven tendencies from uncertain local responses.\"","support":[{"end":3363,"quote":"These findings suggest that flood risk communication under climate warming should distinguish broad climate\\u2010driven tendencies from uncertain local responses.","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":3201},{"end":12366,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":12325},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":427}],"target_id":"claim.frontier.doi-10-1029-2026gl124622","target_kind":"node","target_sha256":"54435a5873a0dae64e7d1d0aebed146e0326f931218584537aa411be511d4864"}],"claim.frontier.doi-10-1029-2026gl124661":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124661","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124661","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124661 \"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?\" (CC BY 4.0, published 2026-07-30) reports: \"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full‐training‐data baseline model.\"","support":[{"end":1804,"quote":"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full\\u2010training\\u2010data baseline model.","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":1639},{"end":8650,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":8610},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl124661","target_kind":"node","target_sha256":"120d5021d1bf0c3ec0ee755ea9a89d44105671c38b4d7733c01a4e1bb93fc16f"}],"claim.frontier.doi-10-1029-2026gl124727":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124727","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124727","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124727 \"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change\" (CC BY 4.0, published 2026-08-19) reports: \"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.\"","support":[{"end":1525,"quote":"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":1374},{"end":13472,"quote":"\"published\":{\"date-parts\":[[2026,8,19]]}","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":13432},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl124727","target_kind":"node","target_sha256":"ccfb2a129ee24b3a6489612d9b84d81407c90375f31b065a6dee4a3e0227a471"}],"claim.frontier.doi-10-1029-2026gl124881":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124881","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124881","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124881 \"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland\" (CC BY 4.0, published 2026-09-23) reports: \"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice–bed interface without spatial interpolation.\"","support":[{"end":1846,"quote":"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice\\u2013bed interface without spatial interpolation.","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":1655},{"end":13178,"quote":"\"published\":{\"date-parts\":[[2026,9,23]]}","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":13138},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124881","target_kind":"node","target_sha256":"0e805f7ff2cf9b4e84fc48accb8792ba130588942398377add6a0f1421798a2d"}],"claim.frontier.doi-10-1029-2026gl125301":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl125301","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl125301","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl125301 \"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands\" (CC BY 4.0, published 2026-10-13) reports: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","support":[{"end":2777,"quote":"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":2549},{"end":12996,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":12955},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":427}],"target_id":"claim.frontier.doi-10-1029-2026gl125301","target_kind":"node","target_sha256":"d19887697cf45eb1d4573ba253ec980e43f5eed329f166e5b1327be08d2d11cb"}],"claim.frontier.doi-10-1029-2026gl125327":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl125327","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl125327","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl125327 \"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica\" (CC BY 4.0, published 2026-09-03) reports: \"Our results show that while a large disturbance event can increase solute inputs and shift the long‐term average dissolved ion concentrations, the overall stream discharge‐concentration relationship may remain chemostatic.\"","support":[{"end":2731,"quote":"Our results show that while a large disturbance event can increase solute inputs and shift the long\\u2010term average dissolved ion concentrations, the overall stream discharge\\u2010concentration relationship may remain chemostatic.","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":2499},{"end":9887,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":9848},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":424}],"target_id":"claim.frontier.doi-10-1029-2026gl125327","target_kind":"node","target_sha256":"f67886ee0901f383640fdc6af4bd815f1a88f81b0adfb7291f11b96fb8eb2b13"}],"claim.frontier.doi-10-1029-2026jd046723":[{"id":"assertion.claim.frontier.doi-10-1029-2026jd046723","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jd046723","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jd046723 \"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America\" (CC BY 4.0, published 2026-08-24) reports: \"H reached 0.43, and the 5 km simulation outperformed the previous 10 km run, highlighting the benefits of improved topographic representation.\"","support":[{"end":3383,"quote":"H reached 0.43, and the 5\\u00a0km simulation outperformed the previous 10\\u00a0km run, highlighting the benefits of improved topographic representation.","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":3231},{"end":16340,"quote":"\"published\":{\"date-parts\":[[2026,8,24]]}","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":16300},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":426}],"target_id":"claim.frontier.doi-10-1029-2026jd046723","target_kind":"node","target_sha256":"2aafd4fd3b0ca6a291ba91ec36a3cc652e3de78e1953febae44e5d2c5135d560"}],"claim.frontier.doi-10-1029-2026jh001250":[{"id":"assertion.claim.frontier.doi-10-1029-2026jh001250","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jh001250","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"","support":[{"end":2556,"quote":"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":2352},{"end":18202,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":18163},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":424}],"target_id":"claim.frontier.doi-10-1029-2026jh001250","target_kind":"node","target_sha256":"d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882"}],"claim.frontier.doi-10-1029-2026jh001578":[{"id":"assertion.claim.frontier.doi-10-1029-2026jh001578","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jh001578","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jh001578 \"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location\" (CC BY 4.0, published 2026-09-21) reports: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","support":[{"end":2913,"quote":"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data\\u2010driven approaches to rapid earthquake characterization.","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":2719},{"end":19188,"quote":"\"published\":{\"date-parts\":[[2026,9,21]]}","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":19148},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":424}],"target_id":"claim.frontier.doi-10-1029-2026jh001578","target_kind":"node","target_sha256":"6139790797c0d1ae8499bfc6f7b9bc51463294b1600010c991c30d6cdecc8204"}],"claim.frontier.doi-10-1029-2026wr044293":[{"id":"assertion.claim.frontier.doi-10-1029-2026wr044293","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026wr044293","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026wr044293 \"Morphological State Transitions and Sediment Transport Variability in Braided Rivers\" (CC BY 4.0, published 2026-08-29) reports: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","support":[{"end":1667,"quote":"Here we show that the temporal variability of sediment transport results from switching\\u00a0between a finite set of recurrent morphological configurations.","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":1511},{"end":10834,"quote":"\"published\":{\"date-parts\":[[2026,8,29]]}","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":10794},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":425}],"target_id":"claim.frontier.doi-10-1029-2026wr044293","target_kind":"node","target_sha256":"1e49be6aa2ba28ac291c0db268f9d900f4aeac4652b5dcf0eb6f819b84d3629a"}],"claim.frontier.doi-10-1075-consl-25020-lia":[{"id":"assertion.claim.frontier.doi-10-1075-consl-25020-lia","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1075/consl.25020.lia","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1075/consl.25020.lia \"When ‘John broke up Mary’ becomes acceptable\" (CC BY 4.0, published 2026-10-12) reports: \"These findings show that argument structure representations can be shaped by usage.\"","support":[{"end":2062,"quote":"These findings show that argument structure representations can be shaped by usage.","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":1979},{"end":9594,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":9553},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":423}],"target_id":"claim.frontier.doi-10-1075-consl-25020-lia","target_kind":"node","target_sha256":"cb466f2887c76ab0f65c645be4f04d8d5628017f8509b150fa17e138dd5c1e4d"}],"claim.frontier.doi-10-1098-rsnr-2026-0030":[{"id":"assertion.claim.frontier.doi-10-1098-rsnr-2026-0030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsnr.2026.0030","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsnr.2026.0030 \"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge\" (CC BY 4.0, published 2026-09-02) reports: \"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaquín in Mexico City.\"","support":[{"end":1401,"quote":"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaqu\\u00edn in Mexico City.","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":1180},{"end":5718,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":5679},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":395}],"target_id":"claim.frontier.doi-10-1098-rsnr-2026-0030","target_kind":"node","target_sha256":"2ff5646876dd7cf0504f4ee7aa5df12a5827f0108f5ed6bd8022022f0fde215d"}],"claim.frontier.doi-10-1098-rsta-2025-0029":[{"id":"assertion.claim.frontier.doi-10-1098-rsta-2025-0029","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsta.2025.0029","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsta.2025.0029 \"The many faces of rotating quantum turbulence\" (CC BY 4.0, published 2026-07-30) reports: \"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.\"","support":[{"end":1786,"quote":"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":1620},{"end":29574,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":29534},{"end":470,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":413}],"target_id":"claim.frontier.doi-10-1098-rsta-2025-0029","target_kind":"node","target_sha256":"af8ac57849b011cf7ad6e60ef5b4f7f43180db05f33d14383df76270acf25e10"}],"claim.frontier.doi-10-1098-rsta-2025-0107":[{"id":"assertion.claim.frontier.doi-10-1098-rsta-2025-0107","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsta.2025.0107","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsta.2025.0107 \"Merits of geometric algebra applied to cryptography and machine learning\" (CC BY 4.0, published 2026-08-13) reports: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","support":[{"end":1891,"quote":"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":1569},{"end":9149,"quote":"\"published\":{\"date-parts\":[[2026,8,13]]}","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":9109},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":423}],"target_id":"claim.frontier.doi-10-1098-rsta-2025-0107","target_kind":"node","target_sha256":"5ba11b8db55e335857acd07bc179ac0daf52cde3500ebe8524756b4dd5d7fcea"}],"claim.frontier.doi-10-1111-1467-9477-70049":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9477-70049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9477.70049","quantifiers":"Only what the quoted sentence states","time":"2026-06-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","support":[{"end":2414,"quote":"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":2081},{"end":9386,"quote":"\"published\":{\"date-parts\":[[2026,6,21]]}","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":9346},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":408}],"target_id":"claim.frontier.doi-10-1111-1467-9477-70049","target_kind":"node","target_sha256":"7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193"}],"claim.frontier.doi-10-1111-1467-9566-70245":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9566-70245","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9566.70245","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9566.70245 \"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal\" (CC BY 4.0, published 2026-08-06) reports: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","support":[{"end":2770,"quote":"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":2494},{"end":9623,"quote":"\"published\":{\"date-parts\":[[2026,8,6]]}","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":9584},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":396}],"target_id":"claim.frontier.doi-10-1111-1467-9566-70245","target_kind":"node","target_sha256":"c5cf402730750a47a7a770312509f9b93a556d2c14e47636d91809efc715bb7e"}],"claim.frontier.doi-10-1111-1467-9566-70277":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9566-70277","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9566.70277","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9566.70277 \"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception\" (CC BY 4.0, published 2026-10-06) reports: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","support":[{"end":2660,"quote":"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis\\/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de\\u2010animation or embrace legal ambiguity.","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":2196},{"end":10547,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":10507},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":398}],"target_id":"claim.frontier.doi-10-1111-1467-9566-70277","target_kind":"node","target_sha256":"8b84360c3005120ef6218b79707ddae1550335e913b7e5f1c386fce38285274a"}],"claim.frontier.doi-10-1111-1752-1688-70151":[{"id":"assertion.claim.frontier.doi-10-1111-1752-1688-70151","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1752-1688.70151","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1752-1688.70151 \"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil\" (CC BY 4.0, published 2026-09-07) reports: \"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.\"","support":[{"end":3272,"quote":"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":3134},{"end":12341,"quote":"\"published\":{\"date-parts\":[[2026,9,7]]}","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":12302},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":406}],"target_id":"claim.frontier.doi-10-1111-1752-1688-70151","target_kind":"node","target_sha256":"7813c951684e4468892f37bc30c7bcde11e8f6c335ae6ff6c22e74ee2ca96f9e"}],"claim.frontier.doi-10-1111-aphw-70185":[{"id":"assertion.claim.frontier.doi-10-1111-aphw-70185","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/aphw.70185","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"","support":[{"end":3045,"quote":"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":2859},{"end":14397,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":14358},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":396}],"target_id":"claim.frontier.doi-10-1111-aphw-70185","target_kind":"node","target_sha256":"ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a"}],"claim.frontier.doi-10-1111-beer-70139":[{"id":"assertion.claim.frontier.doi-10-1111-beer-70139","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/beer.70139","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/beer.70139 \"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees\" (CC BY 4.0, published 2026-07-30) reports: \"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.\"","support":[{"end":1541,"quote":"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":1353},{"end":18500,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":18460},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":387}],"target_id":"claim.frontier.doi-10-1111-beer-70139","target_kind":"node","target_sha256":"91fb84abd87d634139d456232d28bb71e3a86475bb7f25045429ddad58f58980"}],"claim.frontier.doi-10-1111-bioe-70124":[{"id":"assertion.claim.frontier.doi-10-1111-bioe-70124","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/bioe.70124","quantifiers":"Only what the quoted sentence states","time":"2026-06-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"","support":[{"end":1729,"quote":"By applying three prevailing theoretical\\u2010philosophical frameworks\\u2014the counterfactual, temporal, and non\\u2010comparative accounts of harm\\u2014to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":1404},{"end":9754,"quote":"\"published\":{\"date-parts\":[[2026,6,24]]}","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":9714},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":397}],"target_id":"claim.frontier.doi-10-1111-bioe-70124","target_kind":"node","target_sha256":"46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9"}],"claim.frontier.doi-10-1111-ecot-70052":[{"id":"assertion.claim.frontier.doi-10-1111-ecot-70052","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ecot.70052","quantifiers":"Only what the quoted sentence states","time":"2026-10-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ecot.70052 \"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition\" (CC BY 4.0, published 2026-10-15) reports: \"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.\"","support":[{"end":2182,"quote":"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":2002},{"end":11400,"quote":"\"published\":{\"date-parts\":[[2026,10,15]]}","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":11359},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":387}],"target_id":"claim.frontier.doi-10-1111-ecot-70052","target_kind":"node","target_sha256":"c899742980882616404009a6abec94408aca042dd1f705b2bc1e086745fd64fd"}],"claim.frontier.doi-10-1111-ecpo-70064":[{"id":"assertion.claim.frontier.doi-10-1111-ecpo-70064","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ecpo.70064","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ecpo.70064 \"Chinese Lending and Sovereign Debt Distress in Developing Countries\" (CC BY 4.0, published 2026-07-31) reports: \"Employing a within‐between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.\"","support":[{"end":1621,"quote":"Employing a within\\u2010between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":1432},{"end":23249,"quote":"\"published\":{\"date-parts\":[[2026,7,31]]}","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":23209},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":386}],"target_id":"claim.frontier.doi-10-1111-ecpo-70064","target_kind":"node","target_sha256":"5c628e321072d92bdddb037299368d574089a8d7b72ec2196ef5dd56a257863e"}],"claim.frontier.doi-10-1111-eje-70266":[{"id":"assertion.claim.frontier.doi-10-1111-eje-70266","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/eje.70266","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/eje.70266 \"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists\" (CC BY 4.0, published 2026-07-31) reports: \"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.\"","support":[{"end":2716,"quote":"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":2569},{"end":8653,"quote":"\"published\":{\"date-parts\":[[2026,7,31]]}","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":8613},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":386}],"target_id":"claim.frontier.doi-10-1111-eje-70266","target_kind":"node","target_sha256":"886110cc7d95f58e26c930ac1620956e8bbdb97b1d6e95fd32272d8079037f9e"}],"claim.frontier.doi-10-1111-ejed-70766":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70766","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70766","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"","support":[{"end":2788,"quote":"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":2563},{"end":15816,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":15776},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":409}],"target_id":"claim.frontier.doi-10-1111-ejed-70766","target_kind":"node","target_sha256":"a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76"}],"claim.frontier.doi-10-1111-ejed-70772":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70772","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70772","quantifiers":"Only what the quoted sentence states","time":"2026-07-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70772 \"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential\" (CC BY 4.0, published 2026-07-20) reports: \"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem‐solving.\"","support":[{"end":1323,"quote":"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem\\u2010solving.","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":1156},{"end":11925,"quote":"\"published\":{\"date-parts\":[[2026,7,20]]}","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":11885},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":408}],"target_id":"claim.frontier.doi-10-1111-ejed-70772","target_kind":"node","target_sha256":"d675549ea9aba2caed1ba6424bf137c7eb27b2f03345674048d66a4464686fea"}],"claim.frontier.doi-10-1111-ejed-70845":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70845","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70845","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70845 \"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments\" (CC BY 4.0, published 2026-09-01) reports: \"The findings demonstrated that character strengths were positively associated with all three outcomes.\"","support":[{"end":2688,"quote":"The findings demonstrated that character strengths were positively associated with all three outcomes.","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":2586},{"end":12300,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":12261},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":406}],"target_id":"claim.frontier.doi-10-1111-ejed-70845","target_kind":"node","target_sha256":"0459d52dae6202048453674e7539748a055598fb81529c684a178d4d2db99f99"}],"claim.frontier.doi-10-1111-ejed-70852":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70852","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70852","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70852 \"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts\" (CC BY 4.0, published 2026-09-01) reports: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","support":[{"end":1749,"quote":"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":1643},{"end":13256,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":13217},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":406}],"target_id":"claim.frontier.doi-10-1111-ejed-70852","target_kind":"node","target_sha256":"b3b4981ebf949347576690949e4efd1d5542f13e78b7c6e4065e519cc15b6b3d"}],"claim.frontier.doi-10-1111-ejss-70414":[{"id":"assertion.claim.frontier.doi-10-1111-ejss-70414","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejss.70414","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejss.70414 \"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices\" (CC BY 4.0, published 2026-08-31) reports: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","support":[{"end":4706,"quote":"These findings highlight that intensification, more than the organic\\u2010versus\\u2010conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil\\u2010conservation practices.","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":4335},{"end":18343,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":18303},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":398}],"target_id":"claim.frontier.doi-10-1111-ejss-70414","target_kind":"node","target_sha256":"8eef2c4640458267cf61bf03f9e388380f4ae6e0dd4347de4b3f94c80ab7de3f"}],"claim.frontier.doi-10-1111-faam-70045":[{"id":"assertion.claim.frontier.doi-10-1111-faam-70045","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/faam.70045","quantifiers":"Only what the quoted sentence states","time":"2026-06-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"","support":[{"end":2317,"quote":"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":2131},{"end":29187,"quote":"\"published\":{\"date-parts\":[[2026,6,20]]}","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":29147},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":386}],"target_id":"claim.frontier.doi-10-1111-faam-70045","target_kind":"node","target_sha256":"347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b"}],"claim.frontier.doi-10-1111-gwat-70098":[{"id":"assertion.claim.frontier.doi-10-1111-gwat-70098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/gwat.70098","quantifiers":"Only what the quoted sentence states","time":"2026-08-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/gwat.70098 \"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange\" (CC BY 4.0, published 2026-08-15) reports: \"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream–aquifer exchange and provide a physically based alternative for large‐scale integrated groundwater–surface water modeling.\"","support":[{"end":3449,"quote":"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream\\u2013aquifer exchange and provide a physically based alternative for large\\u2010scale integrated groundwater\\u2013surface water modeling.","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":3204},{"end":16755,"quote":"\"published\":{\"date-parts\":[[2026,8,15]]}","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":16715},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":408}],"target_id":"claim.frontier.doi-10-1111-gwat-70098","target_kind":"node","target_sha256":"e2ffb61f8a859e8fd1c96ac98ba01be951bdbd3b4599753effa3c1d768cc8997"}],"claim.frontier.doi-10-1111-ijal-70289":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70289","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70289","quantifiers":"Only what the quoted sentence states","time":"2026-07-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"","support":[{"end":1550,"quote":"The findings reveal a core tension in participant perceptions.","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":1488},{"end":9770,"quote":"\"published\":{\"date-parts\":[[2026,7,3]]}","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":9731},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":395}],"target_id":"claim.frontier.doi-10-1111-ijal-70289","target_kind":"node","target_sha256":"a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8"}],"claim.frontier.doi-10-1111-ijal-70310":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70310","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70310","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70310 \"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice\" (CC BY 4.0, published 2026-07-17) reports: \"The findings indicate that prompting instruction improves communication efficiency, particularly in higher‐complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human–chatbot interaction, alongside a modest, non‐significant advantage in task completion.\"","support":[{"end":1966,"quote":"The findings indicate that prompting instruction improves communication efficiency, particularly in higher\\u2010complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human\\u2013chatbot interaction, alongside a modest, non\\u2010significant advantage in task completion.","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":1644},{"end":8460,"quote":"\"published\":{\"date-parts\":[[2026,7,17]]}","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":8420},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":386}],"target_id":"claim.frontier.doi-10-1111-ijal-70310","target_kind":"node","target_sha256":"4ef02a5db4578cdf194c74cc9a04dfab974b3606687b0380cfac34f80e7617a0"}],"claim.frontier.doi-10-1111-ijal-70337":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70337","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70337","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70337 \"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts\" (CC BY 4.0, published 2026-08-05) reports: \"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.\"","support":[{"end":1978,"quote":"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":1512},{"end":9942,"quote":"\"published\":{\"date-parts\":[[2026,8,5]]}","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":9903},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":394}],"target_id":"claim.frontier.doi-10-1111-ijal-70337","target_kind":"node","target_sha256":"b9767987c6cf8eb732a1e22870bbd60b688b5ea2d37c1c2d4aaeb6a4e403ae27"}],"claim.frontier.doi-10-1111-ijal-70342":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70342","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70342","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70342 \"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses\" (CC BY 4.0, published 2026-08-21) reports: \"Analyses supported a process‐consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.\"","support":[{"end":2439,"quote":"Analyses supported a process\\u2010consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":2254},{"end":10461,"quote":"\"published\":{\"date-parts\":[[2026,8,21]]}","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":10421},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":395}],"target_id":"claim.frontier.doi-10-1111-ijal-70342","target_kind":"node","target_sha256":"5283976eb7325f6d975165df6ee495c112422ee0887368d701ca64f3c5add006"}],"claim.frontier.doi-10-1111-jade-70048":[{"id":"assertion.claim.frontier.doi-10-1111-jade-70048","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jade.70048","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jade.70048 \"A Visual Brainstorming Technique in Character Design: Braindrawing\" (CC BY 4.0, published 2026-09-05) reports: \"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.\"","support":[{"end":1715,"quote":"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":1550},{"end":8021,"quote":"\"published\":{\"date-parts\":[[2026,9,5]]}","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":7982},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":394}],"target_id":"claim.frontier.doi-10-1111-jade-70048","target_kind":"node","target_sha256":"709b81bab1516c34a8944c0aceacb59f4abf8b6aba2d6b5e258558ffa0709287"}],"claim.frontier.doi-10-1111-jmg-70045":[{"id":"assertion.claim.frontier.doi-10-1111-jmg-70045","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jmg.70045","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"","support":[{"end":2742,"quote":"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":2517},{"end":24441,"quote":"\"published\":{\"date-parts\":[[2026,7,7]]}","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":24402},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":397}],"target_id":"claim.frontier.doi-10-1111-jmg-70045","target_kind":"node","target_sha256":"0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658"}],"claim.frontier.doi-10-1111-jmg-70054":[{"id":"assertion.claim.frontier.doi-10-1111-jmg-70054","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jmg.70054","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jmg.70054 \"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression\" (CC BY 4.0, published 2026-08-18) reports: \"We demonstrate that machine learning can decipher complex multi‐elemental relationships in zircon REE data and can be used to classify zircon.\"","support":[{"end":3172,"quote":"We demonstrate that machine learning can decipher complex multi\\u2010elemental relationships in zircon REE data and can be used to classify zircon.","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":3025},{"end":12437,"quote":"\"published\":{\"date-parts\":[[2026,8,18]]}","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":12397},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":386}],"target_id":"claim.frontier.doi-10-1111-jmg-70054","target_kind":"node","target_sha256":"ab0ca5c7d8215f36b3f96d07add1bff628181ad03380f3da260c5990532d5b1a"}],"claim.frontier.doi-10-1111-jssr-70066":[{"id":"assertion.claim.frontier.doi-10-1111-jssr-70066","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jssr.70066","quantifiers":"Only what the quoted sentence states","time":"2026-05-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"","support":[{"end":1579,"quote":"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":1384},{"end":9167,"quote":"\"published\":{\"date-parts\":[[2026,5,30]]}","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":9127},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":408}],"target_id":"claim.frontier.doi-10-1111-jssr-70066","target_kind":"node","target_sha256":"fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f"}],"claim.frontier.doi-10-1111-lcrp-70059":[{"id":"assertion.claim.frontier.doi-10-1111-lcrp-70059","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/lcrp.70059","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/lcrp.70059 \"Prison victimization and post‐release outcomes: A systematic review\" (CC BY 4.0, published 2026-09-04) reports: \"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.\"","support":[{"end":3052,"quote":"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":2904},{"end":13862,"quote":"\"published\":{\"date-parts\":[[2026,9,4]]}","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":13823},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":394}],"target_id":"claim.frontier.doi-10-1111-lcrp-70059","target_kind":"node","target_sha256":"8a2d4bb62d0d43292879ca744d344b526c57050d5ea1c9fe4fade2b00167deda"}],"claim.frontier.doi-10-1111-medu-70340":[{"id":"assertion.claim.frontier.doi-10-1111-medu-70340","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/medu.70340","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/medu.70340 \"Health equity is the goal of medical education: Implications for assessment validity\" (CC BY 4.0, published 2026-10-14) reports: \"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.\"","support":[{"end":2691,"quote":"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":2464},{"end":13791,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":13750},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":387}],"target_id":"claim.frontier.doi-10-1111-medu-70340","target_kind":"node","target_sha256":"bb1ad60f76ca539f0eaddce73315fda163fc3cbd2a166cf3283d6f6ea6f0ff96"}],"claim.frontier.doi-10-1111-moth-70134":[{"id":"assertion.claim.frontier.doi-10-1111-moth-70134","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/moth.70134","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/moth.70134 \"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano\" (CC BY 4.0, published 2026-08-17) reports: \"This vision is shown to be ‘conjured’ up from what is identified as a distinctive, Black Atlantic way of reading Scripture.\"","support":[{"end":1820,"quote":"This vision is shown to be \\u2018conjured\\u2019 up from what is identified as a distinctive, Black Atlantic way of reading Scripture.","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":1687},{"end":4310,"quote":"\"published\":{\"date-parts\":[[2026,8,17]]}","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":4270},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":395}],"target_id":"claim.frontier.doi-10-1111-moth-70134","target_kind":"node","target_sha256":"e00e11ab51837f0489465957e0e78c86c32bfb903c7034ba5b478ce4610c693b"}],"claim.frontier.doi-10-1111-moth-70148":[{"id":"assertion.claim.frontier.doi-10-1111-moth-70148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/moth.70148","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/moth.70148 \"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion\" (CC BY 4.0, published 2026-09-24) reports: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","support":[{"end":1202,"quote":"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":1089},{"end":3891,"quote":"\"published\":{\"date-parts\":[[2026,9,24]]}","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":3851},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":384}],"target_id":"claim.frontier.doi-10-1111-moth-70148","target_kind":"node","target_sha256":"59a080cf2527877e5c33e0b5a87ee37803dbac66af884c55be3b875773bb2066"}],"claim.frontier.doi-10-1111-nup-70114":[{"id":"assertion.claim.frontier.doi-10-1111-nup-70114","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/nup.70114","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/nup.70114 \"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care\" (CC BY 4.0, published 2026-08-31) reports: \"The findings suggest that the morning bed‐bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.\"","support":[{"end":2680,"quote":"The findings suggest that the morning bed\\u2010bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":2391},{"end":13851,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":13811},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":408}],"target_id":"claim.frontier.doi-10-1111-nup-70114","target_kind":"node","target_sha256":"39e7e583ad91c899535afc9090d9e424881b8963e31f8aa53980c2f4542a5382"}],"claim.frontier.doi-10-1111-ojoa-70020":[{"id":"assertion.claim.frontier.doi-10-1111-ojoa-70020","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ojoa.70020","quantifiers":"Only what the quoted sentence states","time":"2026-05-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"","support":[{"end":1298,"quote":"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":1173},{"end":12542,"quote":"\"published\":{\"date-parts\":[[2026,5,6]]}","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":12503},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":396}],"target_id":"claim.frontier.doi-10-1111-ojoa-70020","target_kind":"node","target_sha256":"a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec"}],"claim.frontier.doi-10-1111-ojoa-70022":[{"id":"assertion.claim.frontier.doi-10-1111-ojoa-70022","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ojoa.70022","quantifiers":"Only what the quoted sentence states","time":"2026-06-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"","support":[{"end":1812,"quote":"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":1589},{"end":18425,"quote":"\"published\":{\"date-parts\":[[2026,6,3]]}","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":18386},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":396}],"target_id":"claim.frontier.doi-10-1111-ojoa-70022","target_kind":"node","target_sha256":"4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9"}],"claim.frontier.doi-10-1111-phpr-70116":[{"id":"assertion.claim.frontier.doi-10-1111-phpr-70116","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/phpr.70116","quantifiers":"Only what the quoted sentence states","time":"2026-05-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"","support":[{"end":1669,"quote":"This analysis shows how multiple functions come to be layered up through different grammatical forms.","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":1568},{"end":9549,"quote":"\"published\":{\"date-parts\":[[2026,5,3]]}","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":9510},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":396}],"target_id":"claim.frontier.doi-10-1111-phpr-70116","target_kind":"node","target_sha256":"1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442"}],"claim.frontier.doi-10-1111-ruso-70070":[{"id":"assertion.claim.frontier.doi-10-1111-ruso-70070","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ruso.70070","quantifiers":"Only what the quoted sentence states","time":"2026-09-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ruso.70070 \"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities\" (CC BY 4.0, published 2026-09-26) reports: \"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural–urban communities and whether gaps with big‐city metros are intensifying.\"","support":[{"end":2657,"quote":"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural\\u2013urban communities and whether gaps with big\\u2010city metros are intensifying.","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":2447},{"end":14589,"quote":"\"published\":{\"date-parts\":[[2026,9,26]]}","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":14549},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":397}],"target_id":"claim.frontier.doi-10-1111-ruso-70070","target_kind":"node","target_sha256":"746a1fc813452f4bc12e782e380e8cb1e83267ca7592751d3276202a85c343dd"}],"claim.frontier.doi-10-1111-saje-70032":[{"id":"assertion.claim.frontier.doi-10-1111-saje-70032","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/saje.70032","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/saje.70032 \"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?\" (CC BY 4.0, published 2026-07-26) reports: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","support":[{"end":1237,"quote":"We find that digitalisation has a nonlinear effect on corruption and on human development.","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":1147},{"end":12881,"quote":"\"published\":{\"date-parts\":[[2026,7,26]]}","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":12841},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":398}],"target_id":"claim.frontier.doi-10-1111-saje-70032","target_kind":"node","target_sha256":"14cd64b8681589ba4d64ef37712305269d9789c187279de679c9903d596ed6ba"}],"claim.frontier.doi-10-1144-jgs2026-026":[{"id":"assertion.claim.frontier.doi-10-1144-jgs2026-026","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1144/jgs2026-026","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1144/jgs2026-026 \"Origin of river terraces by isostatic unloading of the lithosphere\" (CC BY 4.0, published 2026-07-15) reports: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","support":[{"end":1466,"quote":"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":1141},{"end":16130,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":16090},{"end":479,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":422}],"target_id":"claim.frontier.doi-10-1144-jgs2026-026","target_kind":"node","target_sha256":"1eec10139d7c5d26a48547b08664aa1d560353ae3c24910f217caf8287ef4f06"}],"claim.frontier.doi-10-1144-jgs2026-039":[{"id":"assertion.claim.frontier.doi-10-1144-jgs2026-039","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1144/jgs2026-039","quantifiers":"Only what the quoted sentence states","time":"2026-06-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","support":[{"end":2167,"quote":"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":2040},{"end":53164,"quote":"\"published\":{\"date-parts\":[[2026,6,22]]}","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":53124},{"end":488,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":431}],"target_id":"claim.frontier.doi-10-1144-jgs2026-039","target_kind":"node","target_sha256":"a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714"}],"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974":[{"id":"assertion.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.11591/ijeecs.v43.i3.pp965-974","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.11591/ijeecs.v43.i3.pp965-974 \"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning\" (CC BY 4.0, published 2026-09-01) reports: \"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines—by 5.7% and 8.9%, respectively—while maintaining complete data privacy.\"","support":[{"end":2140,"quote":"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines\\u2014by 5.7% and 8.9%, respectively\\u2014while maintaining complete data privacy.","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":1929},{"end":4161,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":4122},{"end":511,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":454}],"target_id":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","target_kind":"node","target_sha256":"167968c5487a3a2d63809c9215eca013a58046b5c50a978e376a64e79cddbc11"}],"claim.frontier.doi-10-12944-cwe-21-2-3":[{"id":"assertion.claim.frontier.doi-10-12944-cwe-21-2-3","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.12944/cwe.21.2.3","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.12944/cwe.21.2.3 \"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss\" (CC BY 4.0, published 2026-09-10) reports: \"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.\"","support":[{"end":1886,"quote":"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":1709},{"end":16717,"quote":"\"published\":{\"date-parts\":[[2026,9,10]]}","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":16677},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":427}],"target_id":"claim.frontier.doi-10-12944-cwe-21-2-3","target_kind":"node","target_sha256":"946573dec97981d8f200d79bdffcda3a25c83c8d70b786bfa1e6081090c36178"}],"claim.frontier.doi-10-1371-journal-pclm-0000696":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000696","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000696","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"","support":[{"end":2007,"quote":"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":1779},{"end":20031,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":19992},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":423}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000696","target_kind":"node","target_sha256":"b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a"}],"claim.frontier.doi-10-1371-journal-pclm-0000877":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000877","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000877","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000877 \"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study\" (CC BY 4.0, published 2026-08-18) reports: \"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.\"","support":[{"end":3039,"quote":"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":2889},{"end":15200,"quote":"\"published\":{\"date-parts\":[[2026,8,18]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":15160},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000877","target_kind":"node","target_sha256":"26e943260c3bb22a338102bf11c4c229e76b1d019299973bff0eda218edaaa59"}],"claim.frontier.doi-10-1371-journal-pclm-0000886":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000886","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000886","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000886 \"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana\" (CC BY 4.0, published 2026-10-12) reports: \"The findings show that farmers’ education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.\"","support":[{"end":1420,"quote":"The findings show that farmers\\u2019 education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":1237},{"end":22428,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":22387},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000886","target_kind":"node","target_sha256":"c9838c9666550a04a54d9f52056b1f085e9469af4b418c7c39cfdcf3e95f80c2"}],"claim.frontier.doi-10-1371-journal-pclm-0000930":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000930","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000930","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000930 \"Countering climate misinformation with large language models: Evidence from ChatGPT\" (CC BY 4.0, published 2026-09-02) reports: \"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.\"","support":[{"end":1974,"quote":"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":1764},{"end":20080,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":20041},{"end":490,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":433}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000930","target_kind":"node","target_sha256":"4391670001d55393deb190b39b125c10a5d03a4c148885c1713016e1de39eed9"}],"claim.frontier.doi-10-1371-journal-pclm-0000931":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000931","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000931","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000931 \"Mapping climate-related forest risks: An index-based approach\" (CC BY 4.0, published 2026-08-12) reports: \"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.\"","support":[{"end":2625,"quote":"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":2394},{"end":26980,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":26940},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000931","target_kind":"node","target_sha256":"f074240df47721dc6bfbdc383c4ece688c9bd5dbf3a76847bc4e637d043b6408"}],"claim.frontier.doi-10-1371-journal-pclm-0000986":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000986","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000986","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000986 \"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins\" (CC BY 4.0, published 2026-09-08) reports: \"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.\"","support":[{"end":3138,"quote":"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":2826},{"end":17908,"quote":"\"published\":{\"date-parts\":[[2026,9,8]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":17869},{"end":490,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":433}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000986","target_kind":"node","target_sha256":"05cae79791020ebe011272a629f57fadd9175883f2f54963e1851e140c2fde7e"}],"claim.frontier.doi-10-1371-journal-pclm-0001005":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001005","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001005 \"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria\" (CC BY 4.0, published 2026-09-24) reports: \"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.\"","support":[{"end":1996,"quote":"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":1881},{"end":21607,"quote":"\"published\":{\"date-parts\":[[2026,9,24]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":21567},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":424}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001005","target_kind":"node","target_sha256":"22c95cb1e3ffd0ece2d730ec4a4bfd8b35f8d1250ef94abce79123983e19f32b"}],"claim.frontier.doi-10-1371-journal-pclm-0001039":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001039","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001039","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001039 \"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour\" (CC BY 4.0, published 2026-08-31) reports: \"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.\"","support":[{"end":2515,"quote":"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":2158},{"end":33762,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":33722},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001039","target_kind":"node","target_sha256":"1797f28da9e635c78885a5292ba375fd9b05fa57bec163eeb7ad582da96e5b7f"}],"claim.frontier.doi-10-1371-journal-pclm-0001044":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001044","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001044","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001044 \"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)\" (CC BY 4.0, published 2026-10-12) reports: \"We found a decadal warming trend of 0.29°C at both locations.\"","support":[{"end":2536,"quote":"We found a decadal warming trend of 0.29\\u00b0C at both locations.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":2470},{"end":25758,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":25717},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001044","target_kind":"node","target_sha256":"f020444798aafbba9657c13abf36e5e7c1c64342c3f6d77e5c0abff16072a051"}],"claim.frontier.doi-10-1371-journal-pwat-0000557":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pwat-0000557","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pwat.0000557","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pwat.0000557 \"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon\" (CC BY 4.0, published 2026-10-14) reports: \"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.\"","support":[{"end":2410,"quote":"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":2276},{"end":16153,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":16112},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pwat-0000557","target_kind":"node","target_sha256":"acfd84fb6f4873de8802a73f2217016c75d4c458af05a657ce165e0cbc4a3e69"}],"claim.frontier.doi-10-15351-2373-8456-1216":[{"id":"assertion.claim.frontier.doi-10-15351-2373-8456-1216","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.15351/2373-8456.1216","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.15351/2373-8456.1216 \"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review\" (CC BY 4.0, published 2026-10-13) reports: \"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.\"","support":[{"end":1759,"quote":"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":1646},{"end":4056,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":4015},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":420}],"target_id":"claim.frontier.doi-10-15351-2373-8456-1216","target_kind":"node","target_sha256":"40afce297647ad12205133127c3319b158fd1df3ee3886e812a0ea0efe63d9fa"}],"claim.frontier.doi-10-15351-2373-8456-1235":[{"id":"assertion.claim.frontier.doi-10-15351-2373-8456-1235","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.15351/2373-8456.1235","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.15351/2373-8456.1235 \"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh\" (CC BY 4.0, published 2026-10-13) reports: \"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh’s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.\"","support":[{"end":2246,"quote":"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh\\u2019s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":2002},{"end":3545,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":3504},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":420}],"target_id":"claim.frontier.doi-10-15351-2373-8456-1235","target_kind":"node","target_sha256":"8a4aee6e2d44b62fa0465aa821d46866d28889942e6aed85c22555321eacd664"}],"claim.frontier.doi-10-21425-fob-19-142560":[{"id":"assertion.claim.frontier.doi-10-21425-fob-19-142560","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.21425/fob.19.142560","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.21425/fob.19.142560 \"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas\" (CC BY 4.0, published 2026-10-12) reports: \"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.\"","support":[{"end":1716,"quote":"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":1472},{"end":28606,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":28565},{"end":458,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":401}],"target_id":"claim.frontier.doi-10-21425-fob-19-142560","target_kind":"node","target_sha256":"cf17d8f389e5875801d8f5cf2ce79502a98179aa447f0df28b5ed7b1e5ebf093"}],"claim.frontier.doi-10-2166-hydro-2026-040":[{"id":"assertion.claim.frontier.doi-10-2166-hydro-2026-040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/hydro.2026.040","quantifiers":"Only what the quoted sentence states","time":"2026-10-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/hydro.2026.040 \"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change\" (CC BY 4.0, published 2026-10-10) reports: \"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.\"","support":[{"end":2520,"quote":"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":2244},{"end":24596,"quote":"\"published\":{\"date-parts\":[[2026,10,10]]}","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":24555},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":396}],"target_id":"claim.frontier.doi-10-2166-hydro-2026-040","target_kind":"node","target_sha256":"b1d5eb93f830b9db9de13c37903d40a49fd2241fcc77b157811712804ad5c3ac"}],"claim.frontier.doi-10-2166-hydro-2026-191":[{"id":"assertion.claim.frontier.doi-10-2166-hydro-2026-191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/hydro.2026.191","quantifiers":"Only what the quoted sentence states","time":"2026-05-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"","support":[{"end":2504,"quote":"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":2414},{"end":30729,"quote":"\"published\":{\"date-parts\":[[2026,5,23]]}","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":30689},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":407}],"target_id":"claim.frontier.doi-10-2166-hydro-2026-191","target_kind":"node","target_sha256":"3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6"}],"claim.frontier.doi-10-2166-wcc-2026-006":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-006","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.006","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"","support":[{"end":2035,"quote":"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":1836},{"end":29361,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":29321},{"end":462,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":405}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-006","target_kind":"node","target_sha256":"8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9"}],"claim.frontier.doi-10-2166-wcc-2026-359":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-359","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.359","quantifiers":"Only what the quoted sentence states","time":"2026-07-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"","support":[{"end":3446,"quote":"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":3256},{"end":34196,"quote":"\"published\":{\"date-parts\":[[2026,7,1]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":34157},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":407}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-359","target_kind":"node","target_sha256":"22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe"}],"claim.frontier.doi-10-2166-wcc-2026-507":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.507","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.507 \"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices\" (CC BY 4.0, published 2026-10-01) reports: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","support":[{"end":1686,"quote":"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 \\u00b0C and an increase of 1.6 \\u00b0C over the study period (Sen\\u2019s slope: +0.036 \\u00b0C\\/year).","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":1476},{"end":18467,"quote":"\"published\":{\"date-parts\":[[2026,10,1]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":18427},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":394}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-507","target_kind":"node","target_sha256":"150fad11eb2e58a265d6665b1f952ef191f154aa3847e5e54c38454da52997cc"}],"claim.frontier.doi-10-2166-wcc-2026-580":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-580","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.580","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.580 \"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa\" (CC BY 4.0, published 2026-10-02) reports: \"El Niño seasons were associated with significantly greater concurrent stress (p&lt; 0.001).\"","support":[{"end":2135,"quote":"El Ni\\u00f1o seasons were associated with significantly greater concurrent stress (p&amp;lt; 0.001).","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":2035},{"end":22098,"quote":"\"published\":{\"date-parts\":[[2026,10,2]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":22058},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":394}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-580","target_kind":"node","target_sha256":"a2f38d5d973db76df05f11e9a92569f1f8c2a4aa4275eab073df4cfc645305b6"}],"claim.frontier.doi-10-2166-wp-2026-018":[{"id":"assertion.claim.frontier.doi-10-2166-wp-2026-018","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wp.2026.018","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wp.2026.018 \"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions\" (CC BY 4.0, published 2026-08-14) reports: \"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.\"","support":[{"end":4692,"quote":"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":4456},{"end":16492,"quote":"\"published\":{\"date-parts\":[[2026,8,14]]}","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":16452},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":407}],"target_id":"claim.frontier.doi-10-2166-wp-2026-018","target_kind":"node","target_sha256":"616e659f6173f6f9e1ee396a74524d5cda67304b01ed57a91f6c2cdf8cbfc3fa"}],"claim.frontier.doi-10-2166-wpt-2026-383":[{"id":"assertion.claim.frontier.doi-10-2166-wpt-2026-383","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wpt.2026.383","quantifiers":"Only what the quoted sentence states","time":"2026-07-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"","support":[{"end":1738,"quote":"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":1632},{"end":22204,"quote":"\"published\":{\"date-parts\":[[2026,7,1]]}","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":22165},{"end":474,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":417}],"target_id":"claim.frontier.doi-10-2166-wpt-2026-383","target_kind":"node","target_sha256":"704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614"}],"claim.frontier.doi-10-22378-he-2026-11-2-218-234":[{"id":"assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.22378/he.2026-11-2.218-234","quantifiers":"Only what the quoted sentence states","time":"2026-06-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"","support":[{"end":1761,"quote":"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":1613},{"end":15020,"quote":"\"published\":{\"date-parts\":[[2026,6,8]]}","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":14981},{"end":485,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":428}],"target_id":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","target_kind":"node","target_sha256":"6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6"}],"claim.frontier.doi-10-28918-jei-v11i1-2601":[{"id":"assertion.claim.frontier.doi-10-28918-jei-v11i1-2601","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.28918/jei.v11i1.2601","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"","support":[{"end":1945,"quote":"The findings reveal that integrating digital platforms into pesantren education significantly enhances students\\u2019 technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":1711},{"end":5846,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":5806},{"end":487,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":430}],"target_id":"claim.frontier.doi-10-28918-jei-v11i1-2601","target_kind":"node","target_sha256":"4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00"}],"claim.frontier.doi-10-28918-jei-v11i1-2606":[{"id":"assertion.claim.frontier.doi-10-28918-jei-v11i1-2606","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.28918/jei.v11i1.2606","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"","support":[{"end":1642,"quote":"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassu\\u1e6d, taw\\u0101zun, tas\\u0101mu\\u1e25, and i'tid\\u0101l.","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":1389},{"end":4410,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":4370},{"end":487,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":430}],"target_id":"claim.frontier.doi-10-28918-jei-v11i1-2606","target_kind":"node","target_sha256":"892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d"}],"claim.frontier.doi-10-3176-arch-2026-2-03":[{"id":"assertion.claim.frontier.doi-10-3176-arch-2026-2-03","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3176/arch.2026.2.03","quantifiers":"Only what the quoted sentence states","time":"2026-10-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3176/arch.2026.2.03 \"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)\" (CC BY 4.0, published 2026-10-05) reports: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","support":[{"end":1483,"quote":"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep\\/goats forming the basis of animal husbandry.","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":1323},{"end":37137,"quote":"\"published\":{\"date-parts\":[[2026,10,5]]}","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":37097},{"end":485,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":428}],"target_id":"claim.frontier.doi-10-3176-arch-2026-2-03","target_kind":"node","target_sha256":"2495efad9f9a77db5bf334eea5bd7e3697fddf6aee3e0bae571c91368a1a9e7c"}],"claim.frontier.doi-10-38159-ehass-20267724":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-20267724","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.20267724","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.20267724 \"Leveraging community partnership: The case of Meraka Cultural Village\" (CC BY 4.0, published 2026-09-23) reports: \"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.\"","support":[{"end":1675,"quote":"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":1423},{"end":32749,"quote":"\"published\":{\"date-parts\":[[2026,9,23]]}","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":32709},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":416}],"target_id":"claim.frontier.doi-10-38159-ehass-20267724","target_kind":"node","target_sha256":"413fb72410ec625ca9ca098fe999385c3c9624ba042c7845822e788da8fcb41d"}],"claim.frontier.doi-10-38159-ehass-2026774":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026774","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026774","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026774 \"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities\" (CC BY 4.0, published 2026-08-10) reports: \"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.\"","support":[{"end":1841,"quote":"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":1732},{"end":12938,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":12898},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":427}],"target_id":"claim.frontier.doi-10-38159-ehass-2026774","target_kind":"node","target_sha256":"d6f10658405d185f8e1681f66c1e1593e6be20e81f983de94605620f57a82977"}],"claim.frontier.doi-10-38159-ehass-2026775":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026775","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026775","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026775 \"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis\" (CC BY 4.0, published 2026-08-10) reports: \"The findings reveal that parodic proverbs perform multiple social and communicative functions.\"","support":[{"end":1398,"quote":"The findings reveal that parodic proverbs perform multiple social and communicative functions.","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":1304},{"end":8404,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":8364},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":427}],"target_id":"claim.frontier.doi-10-38159-ehass-2026775","target_kind":"node","target_sha256":"77d8fd44d1d49ddc371b70a5e78fd7f56fd6e50f44b0074910bab18bc99cf9eb"}],"claim.frontier.doi-10-38159-ehass-2026785":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026785","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026785","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026785 \"Does the listener care? Emotional resonance and connection in the age of algorithmic music\" (CC BY 4.0, published 2026-09-30) reports: \"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.\"","support":[{"end":2126,"quote":"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":1948},{"end":14182,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":14142},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":416}],"target_id":"claim.frontier.doi-10-38159-ehass-2026785","target_kind":"node","target_sha256":"aeb97dadafba774c077aa5a3d076f944d7fed8e7a8641eb17d04508753123883"}],"claim.frontier.doi-10-38159-erats-20261281":[{"id":"assertion.claim.frontier.doi-10-38159-erats-20261281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/erats.20261281","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/erats.20261281 \"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism\" (CC BY 4.0, published 2026-09-28) reports: \"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.\"","support":[{"end":1087,"quote":"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":974},{"end":16315,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":16275},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":416}],"target_id":"claim.frontier.doi-10-38159-erats-20261281","target_kind":"node","target_sha256":"a073a252ea3c9d4507d0d7f9530801416fe69b7dab0e22f6dafc4730cd13a867"}],"claim.frontier.doi-10-38159-erats-20261284":[{"id":"assertion.claim.frontier.doi-10-38159-erats-20261284","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/erats.20261284","quantifiers":"Only what the quoted sentence states","time":"2026-09-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/erats.20261284 \"The irony of law and faith in corruption\" (CC BY 4.0, published 2026-09-26) reports: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","support":[{"end":1118,"quote":"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":964},{"end":10815,"quote":"\"published\":{\"date-parts\":[[2026,9,26]]}","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":10775},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":416}],"target_id":"claim.frontier.doi-10-38159-erats-20261284","target_kind":"node","target_sha256":"15126bb3d4b80e72fb46ff22060bdca616c4bc847566be7945e5ab1c88619af3"}],"claim.frontier.doi-10-3897-brics-econ-7-e162074":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e162074","quantifiers":"Only what the quoted sentence states","time":"2026-07-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","support":[{"end":1322,"quote":"The results reveal a stable long-term equilibrium between investment in human development and economic growth.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":1212},{"end":9193,"quote":"\"published\":{\"date-parts\":[[2026,7,3]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":9154},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":409}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e162074","target_kind":"node","target_sha256":"b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb"}],"claim.frontier.doi-10-3897-brics-econ-7-e172739":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e172739","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"","support":[{"end":1101,"quote":"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":904},{"end":10446,"quote":"\"published\":{\"date-parts\":[[2026,7,7]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":10407},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":410}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e172739","target_kind":"node","target_sha256":"6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263"}],"claim.frontier.doi-10-3897-brics-econ-7-e183393":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e183393","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e183393","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e183393 \"Stock market reaction to fraud outbreaks in the Indian banking sector\" (CC BY 4.0, published 2026-09-30) reports: \"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.\"","support":[{"end":1625,"quote":"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":1492},{"end":6907,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":6867},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":410}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e183393","target_kind":"node","target_sha256":"458f34a98afbe1278fb0922f2f52872afd9354a4432e893b2bfd2c2c18a63cc1"}],"claim.frontier.doi-10-3897-brics-econ-7-e185197":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e185197","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e185197","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e185197 \"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia\" (CC BY 4.0, published 2026-09-03) reports: \"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.\"","support":[{"end":4231,"quote":"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":4069},{"end":22438,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":22399},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":420}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e185197","target_kind":"node","target_sha256":"97eab97ad1625a070380fca8217d3192b4737f1f7eb018a5e4a780691e00db9f"}],"claim.frontier.doi-10-3897-jbgs-e185535":[{"id":"assertion.claim.frontier.doi-10-3897-jbgs-e185535","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/jbgs.e185535","quantifiers":"Only what the quoted sentence states","time":"2026-05-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"","support":[{"end":1399,"quote":"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":1297},{"end":4325,"quote":"\"published\":{\"date-parts\":[[2026,5,29]]}","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":4285},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":398}],"target_id":"claim.frontier.doi-10-3897-jbgs-e185535","target_kind":"node","target_sha256":"84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f"}],"claim.frontier.doi-10-3897-nhcm-3-184711":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-184711","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.184711","quantifiers":"Only what the quoted sentence states","time":"2026-05-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"","support":[{"end":1837,"quote":"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":1658},{"end":41775,"quote":"\"published\":{\"date-parts\":[[2026,5,28]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":41735},{"end":457,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":400}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-184711","target_kind":"node","target_sha256":"94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2"}],"claim.frontier.doi-10-3897-nhcm-3-187529":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-187529","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.187529","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.187529 \"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish\" (CC BY 4.0, published 2026-08-10) reports: \"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.\"","support":[{"end":1912,"quote":"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":1738},{"end":11126,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":11086},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":409}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-187529","target_kind":"node","target_sha256":"f995881565f05db0b212c013e45536465d5c82362c442a2a37f9b5c553d65459"}],"claim.frontier.doi-10-3897-nhcm-3-200681":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-200681","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.200681","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.200681 \"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study\" (CC BY 4.0, published 2026-09-25) reports: \": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.\"","support":[{"end":2758,"quote":": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":2548},{"end":7756,"quote":"\"published\":{\"date-parts\":[[2026,9,25]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":7716},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":398}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-200681","target_kind":"node","target_sha256":"a4c954c03c3dc0424d87d0f8b842eff9fc895bef3f503ddb3beb01736694d49b"}],"claim.frontier.doi-10-3897-popecon-10-e186220":[{"id":"assertion.claim.frontier.doi-10-3897-popecon-10-e186220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/popecon.10.e186220","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/popecon.10.e186220 \"Well-Being Among Married Couples: The Role of Time Allocation\" (CC BY 4.0, published 2026-10-01) reports: \"The results demonstrate a robust and statistically significant relationship between wellbeing and the time‑allocation decisions made by individuals and their partners.\"","support":[{"end":1785,"quote":"The results demonstrate a robust and statistically significant relationship between wellbeing and the time\\u2011allocation decisions made by individuals and their partners.","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":1613},{"end":7229,"quote":"\"published\":{\"date-parts\":[[2026,10,1]]}","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":7189},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":410}],"target_id":"claim.frontier.doi-10-3897-popecon-10-e186220","target_kind":"node","target_sha256":"03dfad1db21ae9317989100b6d225ff2460bb5e9cb429523270d194fa91a7925"}],"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01":[{"id":"assertion.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.54929/2786-5738-2026-27-09-01","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.54929/2786-5738-2026-27-09-01 \"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries\" (CC BY 4.0, published 2026-09-28) reports: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","support":[{"end":1080,"quote":"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":892},{"end":11426,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":11386},{"end":542,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":485}],"target_id":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","target_kind":"node","target_sha256":"6e2955f97e76639fbd05e444881a97014480f5ef5a67398572dc2150383e1ee6"}],"claim.frontier.doi-10-55730-1300-0632-4275":[{"id":"assertion.claim.frontier.doi-10-55730-1300-0632-4275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.55730/1300-0632.4275","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.55730/1300-0632.4275 \"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference\" (CC BY 4.0, published 2026-09-16) reports: \"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.\"","support":[{"end":2004,"quote":"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":1756},{"end":13868,"quote":"\"published\":{\"date-parts\":[[2026,9,16]]}","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":13828},{"end":553,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":496}],"target_id":"claim.frontier.doi-10-55730-1300-0632-4275","target_kind":"node","target_sha256":"4a8892407dae357550fbfdbd86a9e01ae61c3705d15da7e7c42abd73cd2f0ad4"}],"claim.frontier.doi-10-55730-1300-0632-4281":[{"id":"assertion.claim.frontier.doi-10-55730-1300-0632-4281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.55730/1300-0632.4281","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.55730/1300-0632.4281 \"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity\" (CC BY 4.0, published 2026-09-16) reports: \"The findings highlight that sliding mode–based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.\"","support":[{"end":2297,"quote":"The findings highlight that sliding mode\\u2013based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":2131},{"end":14782,"quote":"\"published\":{\"date-parts\":[[2026,9,16]]}","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":14742},{"end":553,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":496}],"target_id":"claim.frontier.doi-10-55730-1300-0632-4281","target_kind":"node","target_sha256":"1021403cc9e13bde2e0326d54d3fe51e56aeae42a0ee408feaed5809172cc998"}],"claim.frontier.doi-10-56403-nejesh-v5i2-421":[{"id":"assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.56403/nejesh.v5i2.421","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","support":[{"end":1329,"quote":"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":1118},{"end":9536,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":9496},{"end":523,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":466}],"target_id":"claim.frontier.doi-10-56403-nejesh-v5i2-421","target_kind":"node","target_sha256":"5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2"}],"claim.frontier.doi-10-58491-2735-4202-3413":[{"id":"assertion.claim.frontier.doi-10-58491-2735-4202-3413","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.58491/2735-4202.3413","quantifiers":"Only what the quoted sentence states","time":"2026-06-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"","support":[{"end":1458,"quote":"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12\\u00b0 to nearly 28\\u00b0.","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":1306},{"end":3278,"quote":"\"published\":{\"date-parts\":[[2026,6,18]]}","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":3238},{"end":468,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":411}],"target_id":"claim.frontier.doi-10-58491-2735-4202-3413","target_kind":"node","target_sha256":"cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f"}],"claim.frontier.doi-10-59588-2961-3094-1247":[{"id":"assertion.claim.frontier.doi-10-59588-2961-3094-1247","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.59588/2961-3094.1247","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"","support":[{"end":2477,"quote":"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":2189},{"end":3911,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":3871},{"end":471,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":414}],"target_id":"claim.frontier.doi-10-59588-2961-3094-1247","target_kind":"node","target_sha256":"92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17"}],"claim.frontier.doi-10-66630-sc-2026-0009":[{"id":"assertion.claim.frontier.doi-10-66630-sc-2026-0009","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.66630/sc.2026.0009","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"","support":[{"end":1913,"quote":"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":1567},{"end":7134,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":7094},{"end":495,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":438}],"target_id":"claim.frontier.doi-10-66630-sc-2026-0009","target_kind":"node","target_sha256":"5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec"}],"claim.frontier.pmid-42231562":[{"id":"assertion.claim.frontier.pmid-42231562","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42231562","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42231562 \"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study\" (CC BY, first published 2026-09-01) reports: \"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.\"","support":[{"end":6144,"quote":"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":6027},{"end":8830,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":8795},{"end":8571,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":8554}],"target_id":"claim.frontier.pmid-42231562","target_kind":"node","target_sha256":"dfb98820f054aef0a581be722e6aa819d652a0608afdd1c6b56b0e1d868b673d"}],"claim.frontier.pmid-42344430":[{"id":"assertion.claim.frontier.pmid-42344430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42344430","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42344430 \"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'\" (CC BY, first published 2026-08-20) reports: \"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.\"","support":[{"end":3710,"quote":"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":3532},{"end":6266,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":6231},{"end":5972,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":5955}],"target_id":"claim.frontier.pmid-42344430","target_kind":"node","target_sha256":"d4e30da9d4e568746c806c1c0cd8a1a3b0b2232391bb0f59bc3ed510e58dc45e"}],"claim.frontier.pmid-42372111":[{"id":"assertion.claim.frontier.pmid-42372111","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42372111","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42372111 \"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication\" (CC BY, first published 2026-09-01) reports: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","support":[{"end":5255,"quote":"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":4985},{"end":7982,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":7947},{"end":7722,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":7705}],"target_id":"claim.frontier.pmid-42372111","target_kind":"node","target_sha256":"5cfce4cbd15ef7f5334e8847561926511b0bc03372741abdea05a754cd524803"}],"claim.frontier.pmid-42379141":[{"id":"assertion.claim.frontier.pmid-42379141","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42379141","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42379141 \"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress\" (CC BY, first published 2026-09-01) reports: \"Furthermore, we found that this effect is mediated by 5-HT2AR activation.\"","support":[{"end":4892,"quote":"Furthermore, we found that this effect is mediated by 5-HT2AR activation.","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":4819},{"end":10214,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":10179},{"end":10009,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":9992}],"target_id":"claim.frontier.pmid-42379141","target_kind":"node","target_sha256":"9fe475cf4cdf99f368eb98a9ec68e3b6a4a49ec612d54ce35b1d5faf8c7484c2"}],"claim.frontier.pmid-42403695":[{"id":"assertion.claim.frontier.pmid-42403695","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42403695","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42403695 \"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity\" (CC BY, first published 2026-09-15) reports: \"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.\"","support":[{"end":2840,"quote":"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":2691},{"end":6128,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":6093},{"end":5834,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":5817}],"target_id":"claim.frontier.pmid-42403695","target_kind":"node","target_sha256":"8bac6af4cb301399b6bb9e75582e23feba316e96150e69ec09fe87c8f1c6583f"}],"claim.frontier.pmid-42405792":[{"id":"assertion.claim.frontier.pmid-42405792","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42405792","quantifiers":"Only what the quoted sentence states","time":"2026-07-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42405792 \"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>\" (CC BY, first published 2026-07-06) reports: \"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.\"","support":[{"end":3360,"quote":"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":3202},{"end":8930,"quote":"\"firstPublicationDate\":\"2026-07-06\"","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":8895},{"end":8599,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":8582}],"target_id":"claim.frontier.pmid-42405792","target_kind":"node","target_sha256":"26dfb5f9b28e176b7f9f953936758231db308c009eac4317dede4ebb75e5d7ad"}],"claim.frontier.pmid-42429610":[{"id":"assertion.claim.frontier.pmid-42429610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42429610","quantifiers":"Only what the quoted sentence states","time":"2026-07-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42429610 \"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community\" (CC BY, first published 2026-07-10) reports: \"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.\"","support":[{"end":5955,"quote":"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":5835},{"end":10161,"quote":"\"firstPublicationDate\":\"2026-07-10\"","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":10126},{"end":9867,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":9850}],"target_id":"claim.frontier.pmid-42429610","target_kind":"node","target_sha256":"1c2a558aa8eec5d76532c2fd35a7ce07eb09867f8ad2f8d084bbc9994abd6cd4"}],"claim.frontier.pmid-42439519":[{"id":"assertion.claim.frontier.pmid-42439519","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42439519","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42439519 \"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>\" (CC BY, first published 2026-07-13) reports: \"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.\"","support":[{"end":4009,"quote":"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":3838},{"end":7478,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":7443},{"end":7232,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":7215}],"target_id":"claim.frontier.pmid-42439519","target_kind":"node","target_sha256":"5646759f3095e7a05bc4d4ae5d145022976c47e41d82e959a8f6fb0e8759dbd7"}],"claim.frontier.pmid-42441853":[{"id":"assertion.claim.frontier.pmid-42441853","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42441853","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42441853 \"Evolutionary innovation through fusion of sequences from across the tree of life\" (CC BY, first published 2026-07-13) reports: \"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.\"","support":[{"end":5403,"quote":"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":5235},{"end":9266,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":9231},{"end":8972,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":8955}],"target_id":"claim.frontier.pmid-42441853","target_kind":"node","target_sha256":"c78324b1a1297308bfad68bf3b547a402ff14666d47195b76d478cfa5fb2b781"}],"claim.frontier.pmid-42454934":[{"id":"assertion.claim.frontier.pmid-42454934","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42454934","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42454934 \"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes\" (CC BY, first published 2026-07-15) reports: \"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.\"","support":[{"end":3427,"quote":"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":3311},{"end":7774,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":7739},{"end":7470,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":7453}],"target_id":"claim.frontier.pmid-42454934","target_kind":"node","target_sha256":"c1f9483e91a352cb5947cd1976c85e225e2eff15ba2865c1d9ce4644329ba5cc"}],"claim.frontier.pmid-42455014":[{"id":"assertion.claim.frontier.pmid-42455014","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42455014","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42455014 \"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon\" (CC BY, first published 2026-07-15) reports: \"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.\"","support":[{"end":3813,"quote":"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":3630},{"end":8649,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":8614},{"end":8403,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":8386}],"target_id":"claim.frontier.pmid-42455014","target_kind":"node","target_sha256":"0f542c76252c04d709651f4e7be53b617de2504132c073645528844bac5306ce"}],"claim.frontier.pmid-42458577":[{"id":"assertion.claim.frontier.pmid-42458577","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42458577","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42458577 \"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development\" (CC BY, first published 2026-07-15) reports: \"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.\"","support":[{"end":5179,"quote":"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":4905},{"end":6655,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":6620},{"end":6361,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":6344}],"target_id":"claim.frontier.pmid-42458577","target_kind":"node","target_sha256":"33118cb48ffae62454c7f2ffd03e62763b56c219235964dd41da8941a124eed1"}],"claim.frontier.pmid-42461951":[{"id":"assertion.claim.frontier.pmid-42461951","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42461951","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42461951 \"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization\" (CC BY, first published 2026-07-16) reports: \"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.\"","support":[{"end":5365,"quote":"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":5271},{"end":9628,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":9593},{"end":9334,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":9317}],"target_id":"claim.frontier.pmid-42461951","target_kind":"node","target_sha256":"aae68c97d680b34d01f7860b88badb7f450425873d1db4a6fe84421787f99cff"}],"claim.frontier.pmid-42462719":[{"id":"assertion.claim.frontier.pmid-42462719","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42462719","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42462719 \"Evolutionary radiation of Polaromonas from mountain glaciers downstream\" (CC BY, first published 2026-07-16) reports: \"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.\"","support":[{"end":5049,"quote":"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":4683},{"end":7191,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":7156},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":6928}],"target_id":"claim.frontier.pmid-42462719","target_kind":"node","target_sha256":"e2a2eaff425bceb731a720e72b3f15ce7313309f783085f054af4ad2e03b642e"}],"claim.frontier.pmid-42467705":[{"id":"assertion.claim.frontier.pmid-42467705","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42467705","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42467705 \"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis\" (CC BY, first published 2026-07-17) reports: \"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.\"","support":[{"end":4400,"quote":"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":4222},{"end":7656,"quote":"\"firstPublicationDate\":\"2026-07-17\"","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":7621},{"end":7362,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":7345}],"target_id":"claim.frontier.pmid-42467705","target_kind":"node","target_sha256":"2e721cf18f5723e334ed6f400cb8e2b8c61295a2a356339e2cabbd23097ae817"}],"claim.frontier.pmid-42470282":[{"id":"assertion.claim.frontier.pmid-42470282","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42470282","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42470282 \"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues\" (CC BY, first published 2026-08-01) reports: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","support":[{"end":2087,"quote":"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":1908},{"end":5458,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":5423},{"end":5253,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":5236}],"target_id":"claim.frontier.pmid-42470282","target_kind":"node","target_sha256":"1aa0c6ba4f4f38c4d5e0b66cb7fded8f0fbcf353109c23e24cdccb9f83e377a8"}],"claim.frontier.pmid-42480918":[{"id":"assertion.claim.frontier.pmid-42480918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42480918","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42480918 \"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation\" (CC BY, first published 2026-07-21) reports: \"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.\"","support":[{"end":3683,"quote":"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":3430},{"end":6551,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":6516},{"end":6305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":6288}],"target_id":"claim.frontier.pmid-42480918","target_kind":"node","target_sha256":"de9700b211583145504ed65af3ded7732dfd5753930058cd96f0f5068269b264"}],"claim.frontier.pmid-42484337":[{"id":"assertion.claim.frontier.pmid-42484337","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42484337","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42484337 \"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert\" (CC BY, first published 2026-07-22) reports: \"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.\"","support":[{"end":4397,"quote":"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":4098},{"end":7753,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":7718},{"end":7446,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":7429}],"target_id":"claim.frontier.pmid-42484337","target_kind":"node","target_sha256":"6012b517cdae71b57bcc8ac919f1c6ff394ffaacbfe4e61ebad1b0924f3c45e5"}],"claim.frontier.pmid-42485283":[{"id":"assertion.claim.frontier.pmid-42485283","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42485283","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42485283 \"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis\" (CC BY, first published 2026-07-22) reports: \"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.\"","support":[{"end":4299,"quote":"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":4060},{"end":7447,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":7412},{"end":7153,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":7136}],"target_id":"claim.frontier.pmid-42485283","target_kind":"node","target_sha256":"9f29531dbaf7d96343bdbe3c5278746bf58aea7b7cdd6ed6b1c3ede746d08186"}],"claim.frontier.pmid-42485395":[{"id":"assertion.claim.frontier.pmid-42485395","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42485395","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42485395 \"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024\" (CC BY, first published 2026-07-22) reports: \"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).\"","support":[{"end":5519,"quote":"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":5365},{"end":7527,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":7492},{"end":7233,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":7216}],"target_id":"claim.frontier.pmid-42485395","target_kind":"node","target_sha256":"3bee0cfe709461068502d0c55cf85c6f7b1a5176e782a650b44f0321d4b24baa"}],"claim.frontier.pmid-42489250":[{"id":"assertion.claim.frontier.pmid-42489250","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42489250","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42489250 \"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex\" (CC BY, first published 2026-08-01) reports: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","support":[{"end":2364,"quote":"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":2241},{"end":6279,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":6244},{"end":6020,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":6003}],"target_id":"claim.frontier.pmid-42489250","target_kind":"node","target_sha256":"8bf23d5afb8e45de0826777410cc32fd6991b94810ea244324bc255d48a70eb4"}],"claim.frontier.pmid-42489485":[{"id":"assertion.claim.frontier.pmid-42489485","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42489485","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42489485 \"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts\" (CC BY, first published 2026-07-23) reports: \"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.\"","support":[{"end":5355,"quote":"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":5201},{"end":11795,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":11760},{"end":11488,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":11471}],"target_id":"claim.frontier.pmid-42489485","target_kind":"node","target_sha256":"300ccb01e288e6359dd8eba9db353ffe13e0a9c3c587b21730783f85a5e59cb1"}],"claim.frontier.pmid-42491728":[{"id":"assertion.claim.frontier.pmid-42491728","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42491728","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42491728 \"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis\" (CC BY, first published 2026-07-14) reports: \"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.\"","support":[{"end":4620,"quote":"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":4535},{"end":9040,"quote":"\"firstPublicationDate\":\"2026-07-14\"","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":9005},{"end":8720,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":8703}],"target_id":"claim.frontier.pmid-42491728","target_kind":"node","target_sha256":"196dd677805071426f6e8b0d2a07d270a8c79fc3bbecc0411d7d36ac703f8065"}],"claim.frontier.pmid-42493198":[{"id":"assertion.claim.frontier.pmid-42493198","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42493198","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42493198 \"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial\" (CC BY, first published 2026-07-23) reports: \"We found no interactions for age, sex or education.\"","support":[{"end":5641,"quote":"We found no interactions for age, sex or education.","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":5590},{"end":10340,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":10305},{"end":10046,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":10029}],"target_id":"claim.frontier.pmid-42493198","target_kind":"node","target_sha256":"62904dce12307788981b559f3f10a734e397b91e1673ba8385a1aa3a443ee41a"}],"claim.frontier.pmid-42497150":[{"id":"assertion.claim.frontier.pmid-42497150","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42497150","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42497150 \"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study\" (CC BY, first published 2026-07-24) reports: \"The data revealed a high fertility desire (88.9%) among the YWLHIV.\"","support":[{"end":4993,"quote":"The data revealed a high fertility desire (88.9%) among the YWLHIV.","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":4926},{"end":9029,"quote":"\"firstPublicationDate\":\"2026-07-24\"","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":8994},{"end":8735,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":8718}],"target_id":"claim.frontier.pmid-42497150","target_kind":"node","target_sha256":"20bb11e1da426b4d6898da06a3cc2c78df8546f1ff124c83d36f29a7fcc2daa8"}],"claim.frontier.pmid-42507643":[{"id":"assertion.claim.frontier.pmid-42507643","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42507643","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42507643 \"Enhancing missense variant classification in predicted intrinsically disordered regions\" (CC BY, first published 2026-07-27) reports: \"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.\"","support":[{"end":3452,"quote":"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":3267},{"end":5716,"quote":"\"firstPublicationDate\":\"2026-07-27\"","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":5681},{"end":5470,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":5453}],"target_id":"claim.frontier.pmid-42507643","target_kind":"node","target_sha256":"59a586e2b3cb6a51bac09936b70194a97248314decd5ab60cf47d303b38657d4"}],"claim.frontier.pmid-42510569":[{"id":"assertion.claim.frontier.pmid-42510569","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42510569","quantifiers":"Only what the quoted sentence states","time":"2026-07-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42510569 \"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function\" (CC BY, first published 2026-07-02) reports: \"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.\"","support":[{"end":4717,"quote":"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":4506},{"end":6321,"quote":"\"firstPublicationDate\":\"2026-07-02\"","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":6286},{"end":6027,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":6010}],"target_id":"claim.frontier.pmid-42510569","target_kind":"node","target_sha256":"41e36f51d2a00f087ee9a199b988cafe76523d1a2ed01b500536cdfd190e41ad"}],"claim.frontier.pmid-42514673":[{"id":"assertion.claim.frontier.pmid-42514673","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42514673","quantifiers":"Only what the quoted sentence states","time":"2026-07-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42514673 \"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract\" (CC BY, first published 2026-07-08) reports: \"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.\"","support":[{"end":6388,"quote":"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":6111},{"end":7972,"quote":"\"firstPublicationDate\":\"2026-07-08\"","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":7937},{"end":7679,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":7662}],"target_id":"claim.frontier.pmid-42514673","target_kind":"node","target_sha256":"0076237f950e79e40094d80194dc7065574c0ab0f4e015c5735ae598e4d51b75"}],"claim.frontier.pmid-42515727":[{"id":"assertion.claim.frontier.pmid-42515727","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42515727","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42515727 \"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies\" (CC BY, first published 2026-07-07) reports: \"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.\"","support":[{"end":5740,"quote":"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":5649},{"end":8886,"quote":"\"firstPublicationDate\":\"2026-07-07\"","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":8851},{"end":8592,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":8575}],"target_id":"claim.frontier.pmid-42515727","target_kind":"node","target_sha256":"27768081a9eed39e0dd63c27c6438a5f490a810814cb43e5175a100d769a9c77"}],"claim.frontier.pmid-42516974":[{"id":"assertion.claim.frontier.pmid-42516974","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42516974","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42516974 \"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition\" (CC BY, first published 2026-07-13) reports: \"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.\"","support":[{"end":6416,"quote":"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":6140},{"end":9599,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":9564},{"end":9305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":9288}],"target_id":"claim.frontier.pmid-42516974","target_kind":"node","target_sha256":"51dceb9962cd1db61d65a5d85f4632ad363d5eade9b8631b7192cc213d4f476b"}],"claim.frontier.pmid-42520407":[{"id":"assertion.claim.frontier.pmid-42520407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42520407","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42520407 \"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology\" (CC BY, first published 2026-08-01) reports: \"Our data highlight the activation of quiescence and homeostatic programs.\"","support":[{"end":13967,"quote":"Our data highlight the activation of quiescence and homeostatic programs.","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":13894},{"end":17866,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":17831},{"end":17587,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":17570}],"target_id":"claim.frontier.pmid-42520407","target_kind":"node","target_sha256":"3ff79ddbcadb12914b6bea2be70b56c078eb0f4f2850cf4a55cb05c61e76f405"}],"claim.frontier.pmid-42522920":[{"id":"assertion.claim.frontier.pmid-42522920","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42522920","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42522920 \"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families\" (CC BY, first published 2026-09-01) reports: \"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.\"","support":[{"end":4348,"quote":"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":4261},{"end":7203,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":7168},{"end":6998,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":6981}],"target_id":"claim.frontier.pmid-42522920","target_kind":"node","target_sha256":"3f0a0db8b06d2f0f8ca0225d378578b364e4acd31a8a8c2fab3397e6ad22bf02"}],"claim.frontier.pmid-42528383":[{"id":"assertion.claim.frontier.pmid-42528383","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42528383","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42528383 \"The mycobacterial selenocysteine machinery: presence and expression\" (CC BY, first published 2026-08-05) reports: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","support":[{"end":2952,"quote":"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":2794},{"end":7416,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":7381},{"end":7170,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":7153}],"target_id":"claim.frontier.pmid-42528383","target_kind":"node","target_sha256":"d0cb7054510c3596c76d05b7545bc4a3ea50269633ec61c76abc4ecd85a722f0"}],"claim.frontier.pmid-42529330":[{"id":"assertion.claim.frontier.pmid-42529330","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42529330","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42529330 \"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery\" (CC BY, first published 2026-07-15) reports: \"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.\"","support":[{"end":4168,"quote":"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":3942},{"end":8092,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":8057},{"end":7846,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":7829}],"target_id":"claim.frontier.pmid-42529330","target_kind":"node","target_sha256":"7068ee765e8640953d67241e39e05b36e5b722e1649c863afbe9e5223611296b"}],"claim.frontier.pmid-42530440":[{"id":"assertion.claim.frontier.pmid-42530440","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42530440","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42530440 \"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b\" (CC BY, first published 2026-09-01) reports: \"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.\"","support":[{"end":4715,"quote":"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":4590},{"end":7908,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":7873},{"end":7634,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":7617}],"target_id":"claim.frontier.pmid-42530440","target_kind":"node","target_sha256":"1443008e52b6f81c11ae9bf55d4c53d08253ebc6e8df449a514bfbd8189388d5"}],"claim.frontier.pmid-42531221":[{"id":"assertion.claim.frontier.pmid-42531221","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531221","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531221 \"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids\" (CC BY, first published 2026-07-30) reports: \"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.\"","support":[{"end":5818,"quote":"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":5629},{"end":10449,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":10414},{"end":10155,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":10138}],"target_id":"claim.frontier.pmid-42531221","target_kind":"node","target_sha256":"ad8da4c41c1bd9abd47d6062d21913647ed256423bea837dfd491d5f8638b41a"}],"claim.frontier.pmid-42531248":[{"id":"assertion.claim.frontier.pmid-42531248","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531248","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531248 \"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study\" (CC BY, first published 2026-07-30) reports: \"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.\"","support":[{"end":4671,"quote":"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":4453},{"end":7548,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":7513},{"end":7302,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":7285}],"target_id":"claim.frontier.pmid-42531248","target_kind":"node","target_sha256":"8960a1ac3b603353807a33706fc71559f25557f6fa6b0102070b07cbc7cbf7fd"}],"claim.frontier.pmid-42531261":[{"id":"assertion.claim.frontier.pmid-42531261","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531261","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531261 \"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi\" (CC BY, first published 2026-07-30) reports: \"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.\"","support":[{"end":6757,"quote":"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":6613},{"end":8330,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":8295},{"end":8036,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":8019}],"target_id":"claim.frontier.pmid-42531261","target_kind":"node","target_sha256":"944e48f7363613bc774c594e35e3689a7dfd203c230be3b27519de018d7022bf"}],"claim.frontier.pmid-42531267":[{"id":"assertion.claim.frontier.pmid-42531267","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531267","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531267 \"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)\" (CC BY, first published 2026-07-30) reports: \"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.\"","support":[{"end":8651,"quote":"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":8387},{"end":10518,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":10483},{"end":10272,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":10255}],"target_id":"claim.frontier.pmid-42531267","target_kind":"node","target_sha256":"899ecd6eb810440067b2be54697d357bf6ef72911496b6700a34abb74e0c321b"}],"claim.frontier.pmid-42531275":[{"id":"assertion.claim.frontier.pmid-42531275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531275","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531275 \"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting\" (CC BY, first published 2026-07-30) reports: \"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.\"","support":[{"end":3876,"quote":"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":3698},{"end":6563,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":6528},{"end":6317,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":6300}],"target_id":"claim.frontier.pmid-42531275","target_kind":"node","target_sha256":"811517c21c4998faab5183046f03141a231651751750925e22b150246aaa8cc8"}],"claim.frontier.pmid-42533345":[{"id":"assertion.claim.frontier.pmid-42533345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42533345","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42533345 \"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes\" (CC BY, first published 2026-07-29) reports: \"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.\"","support":[{"end":4665,"quote":"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":4456},{"end":7647,"quote":"\"firstPublicationDate\":\"2026-07-29\"","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":7612},{"end":7353,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":7336}],"target_id":"claim.frontier.pmid-42533345","target_kind":"node","target_sha256":"f2e247302a31e1db20b0d8ec80e6862c58a6d833f3ba2c66edb6acfb327fd8e7"}],"claim.frontier.pmid-42534899":[{"id":"assertion.claim.frontier.pmid-42534899","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42534899","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42534899 \"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments\" (CC BY, first published 2026-07-16) reports: \"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.\"","support":[{"end":6389,"quote":"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":6118},{"end":11881,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":11846},{"end":11574,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":11557}],"target_id":"claim.frontier.pmid-42534899","target_kind":"node","target_sha256":"20c4240b43d86593a9205e297aab1949a13dc7572bd0bfc5611c8ddcd46cfb57"}],"claim.frontier.pmid-42536671":[{"id":"assertion.claim.frontier.pmid-42536671","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42536671","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42536671 \"NLCD: A method to discover nonlinear causal relations among genes\" (CC BY, first published 2026-07-31) reports: \"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).\"","support":[{"end":3591,"quote":"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":3211},{"end":7109,"quote":"\"firstPublicationDate\":\"2026-07-31\"","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":7074},{"end":6809,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":6792}],"target_id":"claim.frontier.pmid-42536671","target_kind":"node","target_sha256":"6754ccb2b98a798f91af1a0f4a56ea248f06bf4ae800fbd01436b70d15f3286f"}],"claim.frontier.pmid-42538349":[{"id":"assertion.claim.frontier.pmid-42538349","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42538349","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42538349 \"Global trade responses to shark finning regulations\" (CC BY, first published 2026-07-31) reports: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","support":[{"end":5496,"quote":"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":5294},{"end":8366,"quote":"\"firstPublicationDate\":\"2026-07-31\"","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":8331},{"end":8072,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":8055}],"target_id":"claim.frontier.pmid-42538349","target_kind":"node","target_sha256":"e9b556054e60be6b1472ad2e7c1bf64d4d3f063f7d49b324b0f14b9e63714875"}],"claim.frontier.pmid-42545021":[{"id":"assertion.claim.frontier.pmid-42545021","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42545021","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42545021 \"Diversity and sources of floral microbial communities\" (CC BY, first published 2026-08-03) reports: \"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.\"","support":[{"end":3369,"quote":"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":3238},{"end":6600,"quote":"\"firstPublicationDate\":\"2026-08-03\"","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":6565},{"end":6354,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":6337}],"target_id":"claim.frontier.pmid-42545021","target_kind":"node","target_sha256":"acea25936281e7a3c041303942d514d80ed5adb9fdadf6d2dfe50492b8a13852"}],"claim.frontier.pmid-42549006":[{"id":"assertion.claim.frontier.pmid-42549006","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42549006","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42549006 \"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis\" (CC BY, first published 2026-08-02) reports: \"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.\"","support":[{"end":3350,"quote":"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":3249},{"end":5613,"quote":"\"firstPublicationDate\":\"2026-08-02\"","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":5578},{"end":5319,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":5302}],"target_id":"claim.frontier.pmid-42549006","target_kind":"node","target_sha256":"36ea6226c2d4515f61f474b5ec36e276758c69f0f4ba844363b83ed426fbb8f4"}],"claim.frontier.pmid-42550924":[{"id":"assertion.claim.frontier.pmid-42550924","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42550924","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42550924 \"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination\" (CC BY, first published 2026-08-01) reports: \"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.\"","support":[{"end":9306,"quote":"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":9091},{"end":14254,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":14219},{"end":13988,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":13971}],"target_id":"claim.frontier.pmid-42550924","target_kind":"node","target_sha256":"ab540160ab4b50f0743d4f89900efce44922d3249f5f9e8a6c279851e560cf1e"}],"claim.frontier.pmid-42553105":[{"id":"assertion.claim.frontier.pmid-42553105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42553105","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42553105 \"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease\" (CC BY, first published 2026-07-21) reports: \"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.\"","support":[{"end":5284,"quote":"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":5168},{"end":7004,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":6969},{"end":6710,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":6693}],"target_id":"claim.frontier.pmid-42553105","target_kind":"node","target_sha256":"65d15e29296eeb7ce3e664404ace976ff0e0ba4768ddf658a32667b3e4913572"}],"claim.frontier.pmid-42553384":[{"id":"assertion.claim.frontier.pmid-42553384","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42553384","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42553384 \"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins\" (CC BY, first published 2026-07-21) reports: \"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.\"","support":[{"end":5939,"quote":"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":5756},{"end":8335,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":8300},{"end":8011,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":7994}],"target_id":"claim.frontier.pmid-42553384","target_kind":"node","target_sha256":"e533fd993aac998fb80072f63ba6c3384456fb4437955e960dc9c4a14f69641c"}],"claim.frontier.pmid-42554464":[{"id":"assertion.claim.frontier.pmid-42554464","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42554464","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42554464 \"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>\" (CC BY, first published 2026-08-05) reports: \"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.\"","support":[{"end":5339,"quote":"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":5243},{"end":12007,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":11972},{"end":11713,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":11696}],"target_id":"claim.frontier.pmid-42554464","target_kind":"node","target_sha256":"c05377952db40addb5bafa58d64ed9be6294bf8937be1acfa015817983a8b69d"}],"claim.frontier.pmid-42560043":[{"id":"assertion.claim.frontier.pmid-42560043","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560043","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560043 \"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots\" (CC BY, first published 2026-08-06) reports: \"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.\"","support":[{"end":5564,"quote":"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":5127},{"end":9699,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":9664},{"end":9453,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":9436}],"target_id":"claim.frontier.pmid-42560043","target_kind":"node","target_sha256":"3253072cf4ece2ce0d2c527aeeaaaa026551690ced864d425542e4f9741ffde5"}],"claim.frontier.pmid-42560857":[{"id":"assertion.claim.frontier.pmid-42560857","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560857","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560857 \"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery\" (CC BY, first published 2026-08-01) reports: \"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.\"","support":[{"end":4738,"quote":"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":4547},{"end":8207,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":8172},{"end":7948,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":7931}],"target_id":"claim.frontier.pmid-42560857","target_kind":"node","target_sha256":"02668f00e5a5a5663bec0aa3a9d6c05a007739a115a01cfd69ec964b9a0ab5a5"}],"claim.frontier.pmid-42560943":[{"id":"assertion.claim.frontier.pmid-42560943","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560943","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560943 \"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model\" (CC BY, first published 2026-08-06) reports: \"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.\"","support":[{"end":4147,"quote":"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":3956},{"end":6896,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":6861},{"end":6602,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":6585}],"target_id":"claim.frontier.pmid-42560943","target_kind":"node","target_sha256":"a1b592b6208a5118318e2e6f63013da04a6374ba136aa81fc39bdafe3d3dd024"}],"claim.frontier.pmid-42565205":[{"id":"assertion.claim.frontier.pmid-42565205","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42565205","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42565205 \"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease\" (CC BY, first published 2026-07-24) reports: \"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.\"","support":[{"end":3128,"quote":"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":2982},{"end":6007,"quote":"\"firstPublicationDate\":\"2026-07-24\"","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":5972},{"end":5704,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":5687}],"target_id":"claim.frontier.pmid-42565205","target_kind":"node","target_sha256":"0908c254600dd40f6091684c6ff72ceaead68e48bf4829c6c1fbd0b6d43c2e08"}],"claim.frontier.pmid-42566407":[{"id":"assertion.claim.frontier.pmid-42566407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42566407","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42566407 \"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study\" (CC BY, first published 2026-08-07) reports: \"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.\"","support":[{"end":4706,"quote":"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":4513},{"end":6984,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":6949},{"end":6690,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":6673}],"target_id":"claim.frontier.pmid-42566407","target_kind":"node","target_sha256":"99123498b35f2a9280749c12332e2344cae4e9f49f0eee4c688538ed7fe91466"}],"claim.frontier.pmid-42569382":[{"id":"assertion.claim.frontier.pmid-42569382","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42569382","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42569382 \"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study\" (CC BY, first published 2026-08-05) reports: \"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.\"","support":[{"end":2000,"quote":"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":1871},{"end":5416,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":5381},{"end":5122,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":5105}],"target_id":"claim.frontier.pmid-42569382","target_kind":"node","target_sha256":"6acb811040b5dd609e3fae7ab0c5aefcd3b75a7dbe699e5550e32330d1ca12ea"}],"claim.frontier.pmid-42571083":[{"id":"assertion.claim.frontier.pmid-42571083","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42571083","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42571083 \"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations\" (CC BY, first published 2026-08-07) reports: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","support":[{"end":3733,"quote":"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":3543},{"end":5774,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":5739},{"end":5480,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":5463}],"target_id":"claim.frontier.pmid-42571083","target_kind":"node","target_sha256":"2da1179dc8b8ef02c3e1fbf900f666d546be46c2a97a0ce494363175e2a97312"}],"claim.frontier.pmid-42577546":[{"id":"assertion.claim.frontier.pmid-42577546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42577546","quantifiers":"Only what the quoted sentence states","time":"2026-08-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42577546 \"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection\" (CC BY, first published 2026-08-09) reports: \"Cluster C3 was associated with poor prognosis and reduced survival.\"","support":[{"end":4571,"quote":"Cluster C3 was associated with poor prognosis and reduced survival.","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":4504},{"end":6447,"quote":"\"firstPublicationDate\":\"2026-08-09\"","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":6412},{"end":6201,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":6184}],"target_id":"claim.frontier.pmid-42577546","target_kind":"node","target_sha256":"5ebbb5abe1355463d772f0405b34905164e3fbd9775283e5b1923b07dd145dc3"}],"claim.frontier.pmid-42578670":[{"id":"assertion.claim.frontier.pmid-42578670","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42578670","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42578670 \"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis\" (CC BY, first published 2026-08-11) reports: \"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.\"","support":[{"end":5953,"quote":"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":5816},{"end":8900,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":8865},{"end":8606,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":8589}],"target_id":"claim.frontier.pmid-42578670","target_kind":"node","target_sha256":"5e37cc476cb5de840031ff8258e84100dc78bfec9d076e96160d63b04154f7bf"}],"claim.frontier.pmid-42578673":[{"id":"assertion.claim.frontier.pmid-42578673","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42578673","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42578673 \"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use\" (CC BY, first published 2026-08-11) reports: \"A balanced microbiome is associated with favorable health outcomes.\"","support":[{"end":4873,"quote":"A balanced microbiome is associated with favorable health outcomes.","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":4806},{"end":11797,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":11762},{"end":11551,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":11534}],"target_id":"claim.frontier.pmid-42578673","target_kind":"node","target_sha256":"c3ef2dedf2f1a45a6e05f3db3f5e9081e5a721f2d8be7b7356f1335ca7e03943"}],"claim.frontier.pmid-42584423":[{"id":"assertion.claim.frontier.pmid-42584423","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42584423","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42584423 \"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation\" (CC BY, first published 2026-08-12) reports: \"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.\"","support":[{"end":3778,"quote":"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":3548},{"end":7855,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":7820},{"end":7549,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":7532}],"target_id":"claim.frontier.pmid-42584423","target_kind":"node","target_sha256":"350cae1bb8aa28e7452eba0710ffa6e9348d186d71d6888cbded95a5b9556afc"}],"claim.frontier.pmid-42585188":[{"id":"assertion.claim.frontier.pmid-42585188","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42585188","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42585188 \"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens\" (CC BY, first published 2026-08-12) reports: \"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.\"","support":[{"end":4375,"quote":"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":4204},{"end":6995,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":6960},{"end":6749,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":6732}],"target_id":"claim.frontier.pmid-42585188","target_kind":"node","target_sha256":"4d7db3f922426451e54612059212781743c2464464e07d631682da3c6feddffb"}],"claim.frontier.pmid-42585261":[{"id":"assertion.claim.frontier.pmid-42585261","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42585261","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42585261 \"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories\" (CC BY, first published 2026-08-12) reports: \"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.\"","support":[{"end":5965,"quote":"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":5703},{"end":8707,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":8672},{"end":8461,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":8444}],"target_id":"claim.frontier.pmid-42585261","target_kind":"node","target_sha256":"a883e42068f102d1226b789c87b5a33994ab479faf9fab92e3ff5a94aa8822af"}],"claim.frontier.pmid-42588195":[{"id":"assertion.claim.frontier.pmid-42588195","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42588195","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42588195 \"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study\" (CC BY, first published 2026-08-06) reports: \"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.\"","support":[{"end":6968,"quote":"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":6799},{"end":11457,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":11422},{"end":11163,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":11146}],"target_id":"claim.frontier.pmid-42588195","target_kind":"node","target_sha256":"1e38baecaf60b65444fdddd8229de925530d7bc8184f6192bfacf00af8968ff7"}],"claim.frontier.pmid-42589669":[{"id":"assertion.claim.frontier.pmid-42589669","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42589669","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42589669 \"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes\" (CC BY, first published 2026-08-04) reports: \"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.\"","support":[{"end":8208,"quote":"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":7991},{"end":12276,"quote":"\"firstPublicationDate\":\"2026-08-04\"","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":12241},{"end":12030,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":12013}],"target_id":"claim.frontier.pmid-42589669","target_kind":"node","target_sha256":"05b0aad2ca3982979bfcb4dce0ad76d2656a002c2d73cfe57a61172c389520d3"}],"claim.frontier.pmid-42590131":[{"id":"assertion.claim.frontier.pmid-42590131","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42590131","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42590131 \"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study\" (CC BY, first published 2026-08-03) reports: \": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.\"","support":[{"end":3754,"quote":": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":3566},{"end":7152,"quote":"\"firstPublicationDate\":\"2026-08-03\"","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":7117},{"end":6906,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":6889}],"target_id":"claim.frontier.pmid-42590131","target_kind":"node","target_sha256":"517c3bcbe17e0bab4b0534e559adae8852e3b83639c3e32fef0354469832b460"}],"claim.frontier.pmid-42594273":[{"id":"assertion.claim.frontier.pmid-42594273","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42594273","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42594273 \"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer\" (CC BY, first published 2026-08-13) reports: \"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.\"","support":[{"end":9971,"quote":"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":9744},{"end":14159,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":14124},{"end":13851,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":13834}],"target_id":"claim.frontier.pmid-42594273","target_kind":"node","target_sha256":"fe7b8228851eda23c73274d9be312e046718e68147345be7563cd941cf9e9f20"}],"claim.frontier.pmid-42595314":[{"id":"assertion.claim.frontier.pmid-42595314","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42595314","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42595314 \"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort\" (CC BY, first published 2026-08-13) reports: \"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.\"","support":[{"end":5321,"quote":"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":5138},{"end":7518,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":7483},{"end":7272,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":7255}],"target_id":"claim.frontier.pmid-42595314","target_kind":"node","target_sha256":"e178a7e5dd46cc45c6d65b0aaa93a72e4fbc765be4aa5bbce307e55884892ddc"}],"claim.frontier.pmid-42597521":[{"id":"assertion.claim.frontier.pmid-42597521","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42597521","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42597521 \"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study\" (CC BY, first published 2026-07-30) reports: \"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.\"","support":[{"end":5807,"quote":"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":5634},{"end":7221,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":7186},{"end":6927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":6910}],"target_id":"claim.frontier.pmid-42597521","target_kind":"node","target_sha256":"24ebcb0926ff33a57a282813c5be6dd0eee7bd46c3edfaaff6ea88fedc3a2630"}],"claim.frontier.pmid-42599850":[{"id":"assertion.claim.frontier.pmid-42599850","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599850","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599850 \"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol\" (CC BY, first published 2026-08-14) reports: \"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.\"","support":[{"end":2787,"quote":"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":2653},{"end":5455,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":5420},{"end":5161,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":5144}],"target_id":"claim.frontier.pmid-42599850","target_kind":"node","target_sha256":"1f6eb2daf212bee703fad68ab953ea314032a4efac63fa22a4a2250eb24cf295"}],"claim.frontier.pmid-42599899":[{"id":"assertion.claim.frontier.pmid-42599899","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599899","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599899 \"Determinants of instructional leadership: A survey of public secondary schools\" (CC BY, first published 2026-08-14) reports: \"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.\"","support":[{"end":3854,"quote":"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":3591},{"end":5991,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":5956},{"end":5697,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":5680}],"target_id":"claim.frontier.pmid-42599899","target_kind":"node","target_sha256":"82337163f99edff5fb1922b59d2c945fe31cc8782352cfbe882c4918e254b62f"}],"claim.frontier.pmid-42599952":[{"id":"assertion.claim.frontier.pmid-42599952","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599952","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599952 \"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study\" (CC BY, first published 2026-08-14) reports: \"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.\"","support":[{"end":6537,"quote":"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":6309},{"end":9822,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":9787},{"end":9528,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":9511}],"target_id":"claim.frontier.pmid-42599952","target_kind":"node","target_sha256":"cb30f6ed57a1902ea6566767fac0200d5650649909a328a13b74beacc4b19e18"}],"claim.frontier.pmid-42606346":[{"id":"assertion.claim.frontier.pmid-42606346","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42606346","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42606346 \"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect\" (CC BY, first published 2026-08-01) reports: \"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.\"","support":[{"end":2641,"quote":"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":2481},{"end":5930,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":5895},{"end":5670,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":5653}],"target_id":"claim.frontier.pmid-42606346","target_kind":"node","target_sha256":"0569d065533bcf7de4b62b4db6de60378efdb832ac468a17521aa9de886852a5"}],"claim.frontier.pmid-42609599":[{"id":"assertion.claim.frontier.pmid-42609599","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42609599","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42609599 \"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report\" (CC BY, first published 2026-08-17) reports: \"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.\"","support":[{"end":2335,"quote":"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":2122},{"end":4976,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":4941},{"end":4730,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":4713}],"target_id":"claim.frontier.pmid-42609599","target_kind":"node","target_sha256":"7a85472e093e5f1b7afda87925cb7ab106c97e2cdd4206f04e83b5a6dda1e688"}],"claim.frontier.pmid-42611865":[{"id":"assertion.claim.frontier.pmid-42611865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42611865","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42611865 \"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease\" (CC BY, first published 2026-08-18) reports: \"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.\"","support":[{"end":6260,"quote":"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":6033},{"end":9071,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":9036},{"end":8760,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":8743}],"target_id":"claim.frontier.pmid-42611865","target_kind":"node","target_sha256":"1d9d8df890c270e4de70293dcc7142c68a0b30ecc4ed7c0b7f4c9b5962f9c635"}],"claim.frontier.pmid-42612575":[{"id":"assertion.claim.frontier.pmid-42612575","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42612575","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42612575 \"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response\" (CC BY, first published 2026-08-18) reports: \"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.\"","support":[{"end":5100,"quote":"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":4899},{"end":6933,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":6898},{"end":6639,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":6622}],"target_id":"claim.frontier.pmid-42612575","target_kind":"node","target_sha256":"d16bedf1a7595f1569b9fdb5b6c644d2c880f75484d4823d216291864b1802bb"}],"claim.frontier.pmid-42616230":[{"id":"assertion.claim.frontier.pmid-42616230","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42616230","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42616230 \"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases\" (CC BY, first published 2026-08-19) reports: \"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.\"","support":[{"end":7836,"quote":"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":7602},{"end":11638,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":11603},{"end":11344,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":11327}],"target_id":"claim.frontier.pmid-42616230","target_kind":"node","target_sha256":"33ee3432f835163e782e5a50f867be17bfd7100ea4d52bf9de662249072628d8"}],"claim.frontier.pmid-42616741":[{"id":"assertion.claim.frontier.pmid-42616741","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42616741","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42616741 \"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff\" (CC BY, first published 2026-08-19) reports: \"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.\"","support":[{"end":5310,"quote":"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":5141},{"end":6842,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":6807},{"end":6548,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":6531}],"target_id":"claim.frontier.pmid-42616741","target_kind":"node","target_sha256":"0b4ff6023d3fb70d86afdab3057e8f7629dc9ea64fd846a8bc8880016f010e27"}],"claim.frontier.pmid-42626349":[{"id":"assertion.claim.frontier.pmid-42626349","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42626349","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42626349 \"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events\" (CC BY, first published 2026-08-20) reports: \"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.\"","support":[{"end":2145,"quote":"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":2009},{"end":4505,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":4470},{"end":4259,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":4242}],"target_id":"claim.frontier.pmid-42626349","target_kind":"node","target_sha256":"0fc4a61006fbd64ea1482496e77fc26f6810dabdc34516ae42c5af62a5337ec4"}],"claim.frontier.pmid-42627158":[{"id":"assertion.claim.frontier.pmid-42627158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627158","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627158 \"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium\" (CC BY, first published 2026-08-21) reports: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","support":[{"end":3139,"quote":"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":2916},{"end":7958,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":7923},{"end":7651,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":7634}],"target_id":"claim.frontier.pmid-42627158","target_kind":"node","target_sha256":"225d8c35f4192181e564eea76e1b59ddd5ca5aae5e57f7533842a429ff3fee41"}],"claim.frontier.pmid-42627223":[{"id":"assertion.claim.frontier.pmid-42627223","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627223","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627223 \"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint\" (CC BY, first published 2026-08-20) reports: \"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.\"","support":[{"end":4128,"quote":"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":3794},{"end":6597,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":6562},{"end":6303,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":6286}],"target_id":"claim.frontier.pmid-42627223","target_kind":"node","target_sha256":"b0067149bb8dd747a69cece365f9672bcfde4f7ecbdcbfc9cac1c23fee648ab0"}],"claim.frontier.pmid-42627947":[{"id":"assertion.claim.frontier.pmid-42627947","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627947","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627947 \"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial\" (CC BY, first published 2026-08-21) reports: \"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.\"","support":[{"end":4722,"quote":"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":4454},{"end":10595,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":10560},{"end":10295,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":10278}],"target_id":"claim.frontier.pmid-42627947","target_kind":"node","target_sha256":"41b31cd510c72a1618a94c2855b434fac56b67e60927f7f313dd60c85165dcd7"}],"claim.frontier.pmid-42630507":[{"id":"assertion.claim.frontier.pmid-42630507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42630507","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42630507 \"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming\" (CC BY, first published 2026-08-07) reports: \"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.\"","support":[{"end":4690,"quote":"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":4501},{"end":8132,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":8097},{"end":7825,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":7808}],"target_id":"claim.frontier.pmid-42630507","target_kind":"node","target_sha256":"457a71cb8b029ed2e824f8b954bfd5354742842b14eaf55c3805129b1388a1b1"}],"claim.frontier.pmid-42634019":[{"id":"assertion.claim.frontier.pmid-42634019","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42634019","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42634019 \"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence\" (CC BY, first published 2026-08-24) reports: \"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.\"","support":[{"end":4489,"quote":"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":4196},{"end":7833,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":7798},{"end":7587,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":7570}],"target_id":"claim.frontier.pmid-42634019","target_kind":"node","target_sha256":"57121252ee440d9fa9aa64ba91c593fe819e4c391abd60a23d078c66ca035850"}],"claim.frontier.pmid-42635434":[{"id":"assertion.claim.frontier.pmid-42635434","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42635434","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42635434 \"Species-specific prophage induction by ciprofloxacin in human gut metagenomes\" (CC BY, first published 2026-08-24) reports: \"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.\"","support":[{"end":3434,"quote":"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":3310},{"end":9011,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":8976},{"end":8765,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":8748}],"target_id":"claim.frontier.pmid-42635434","target_kind":"node","target_sha256":"55931dda8d50d6cefa8b7b6bd1b1b73ba372114022e89373887a1ad736fca159"}],"claim.frontier.pmid-42636257":[{"id":"assertion.claim.frontier.pmid-42636257","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42636257","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42636257 \"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria\" (CC BY, first published 2026-08-24) reports: \"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.\"","support":[{"end":4473,"quote":"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":4200},{"end":7995,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":7960},{"end":7749,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":7732}],"target_id":"claim.frontier.pmid-42636257","target_kind":"node","target_sha256":"ae9744c7b84f83f0a7bf1b4ec157b1c82eeae43c46c009d22ce2cb097315d939"}],"claim.frontier.pmid-42637891":[{"id":"assertion.claim.frontier.pmid-42637891","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42637891","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42637891 \"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches\" (CC BY, first published 2026-08-25) reports: \"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.\"","support":[{"end":4830,"quote":"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":4614},{"end":8013,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":7978},{"end":7719,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":7702}],"target_id":"claim.frontier.pmid-42637891","target_kind":"node","target_sha256":"568657959fe5e2e88254fa678437ebb4474a3d4df699b810d83124a3f5b5883c"}],"claim.frontier.pmid-42637977":[{"id":"assertion.claim.frontier.pmid-42637977","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42637977","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42637977 \"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering\" (CC BY, first published 2026-08-24) reports: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","support":[{"end":13154,"quote":"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":12923},{"end":17291,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":17256},{"end":16991,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":16974}],"target_id":"claim.frontier.pmid-42637977","target_kind":"node","target_sha256":"901beb3bd7563bb6b240e03bd25e888af4fb820d655c85643ef404097077c15c"}],"claim.frontier.pmid-42638898":[{"id":"assertion.claim.frontier.pmid-42638898","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42638898","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42638898 \"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation\" (CC BY, first published 2026-08-10) reports: \"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.\"","support":[{"end":4502,"quote":"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":4250},{"end":8963,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":8928},{"end":8669,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":8652}],"target_id":"claim.frontier.pmid-42638898","target_kind":"node","target_sha256":"593a2af4eb5be70cb655307b20fb11f5da3ce472b5c706b2e1a14de3f8d08541"}],"claim.frontier.pmid-42639105":[{"id":"assertion.claim.frontier.pmid-42639105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42639105","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42639105 \"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity\" (CC BY, first published 2026-08-10) reports: \"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.\"","support":[{"end":2716,"quote":"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":2564},{"end":5532,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":5497},{"end":5286,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":5269}],"target_id":"claim.frontier.pmid-42639105","target_kind":"node","target_sha256":"921a3d28987c792a964cf3eb577a3455e2c88f93f21bcc3c43025e65e7b4a4f2"}],"claim.frontier.pmid-42644024":[{"id":"assertion.claim.frontier.pmid-42644024","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42644024","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42644024 \"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.\"","support":[{"end":4382,"quote":"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":4267},{"end":7240,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":7205},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":6928}],"target_id":"claim.frontier.pmid-42644024","target_kind":"node","target_sha256":"b9a4af3ac9215e678bbe212c7e0ece8d0b3c7924d5bc05fe21c502ef9e756388"}],"claim.frontier.pmid-42646326":[{"id":"assertion.claim.frontier.pmid-42646326","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42646326","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42646326 \"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model\" (CC BY, first published 2026-08-19) reports: \"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.\"","support":[{"end":8367,"quote":"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":8155},{"end":12333,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":12298},{"end":12039,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":12022}],"target_id":"claim.frontier.pmid-42646326","target_kind":"node","target_sha256":"4fb37afae896dc3b463d320f5e72ed8d2b30addb451f6228b9f93d8c18baa127"}],"claim.frontier.pmid-42649901":[{"id":"assertion.claim.frontier.pmid-42649901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42649901","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42649901 \"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions\" (CC BY, first published 2026-08-11) reports: \"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.\"","support":[{"end":2190,"quote":"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":2007},{"end":6419,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":6384},{"end":6119,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":6102}],"target_id":"claim.frontier.pmid-42649901","target_kind":"node","target_sha256":"2a892878334761690a2c134f1ea0a2507f00dec7c78eee4e4c5ff2092dbc6f58"}],"claim.frontier.pmid-42650730":[{"id":"assertion.claim.frontier.pmid-42650730","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42650730","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42650730 \"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection\" (CC BY, first published 2026-08-18) reports: \"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.\"","support":[{"end":3225,"quote":"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":2987},{"end":6450,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":6415},{"end":6156,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":6139}],"target_id":"claim.frontier.pmid-42650730","target_kind":"node","target_sha256":"8f5335f25e0b4d13371c28956cb373a8c828ab78a577ef15de10a22ae32c95e6"}],"claim.frontier.pmid-42651394":[{"id":"assertion.claim.frontier.pmid-42651394","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42651394","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42651394 \"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide\" (CC BY, first published 2026-08-19) reports: \"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.\"","support":[{"end":5021,"quote":"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":4824},{"end":7379,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":7344},{"end":7085,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":7068}],"target_id":"claim.frontier.pmid-42651394","target_kind":"node","target_sha256":"08fb2a975f4b291d14d919fad513b00b2d2b8f8d638df82dea9fb43bf02321be"}],"claim.frontier.pmid-42651890":[{"id":"assertion.claim.frontier.pmid-42651890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42651890","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42651890 \"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats\" (CC BY, first published 2026-08-10) reports: \"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.\"","support":[{"end":5020,"quote":"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":4841},{"end":6541,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":6506},{"end":6240,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":6223}],"target_id":"claim.frontier.pmid-42651890","target_kind":"node","target_sha256":"7f0b6093ad9e615e071c92d156720af49b84912119ccf13aeff9bab79e4df31d"}],"claim.frontier.pmid-42652200":[{"id":"assertion.claim.frontier.pmid-42652200","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652200","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652200 \"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer\" (CC BY, first published 2026-08-13) reports: \"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).\"","support":[{"end":9568,"quote":"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":9404},{"end":11938,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":11903},{"end":11644,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":11627}],"target_id":"claim.frontier.pmid-42652200","target_kind":"node","target_sha256":"048f9436ec8c550431b4326ff662a795d38c01104348f26c1c28b04dc2cc36fb"}],"claim.frontier.pmid-42652430":[{"id":"assertion.claim.frontier.pmid-42652430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652430","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652430 \"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation\" (CC BY, first published 2026-07-27) reports: \"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.\"","support":[{"end":3742,"quote":"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":3616},{"end":5520,"quote":"\"firstPublicationDate\":\"2026-07-27\"","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":5485},{"end":5220,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":5203}],"target_id":"claim.frontier.pmid-42652430","target_kind":"node","target_sha256":"efc8707d1866a3f19137e739426ee40018fdc3a26110ddec131a514a2d050e31"}],"claim.frontier.pmid-42652751":[{"id":"assertion.claim.frontier.pmid-42652751","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652751","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652751 \"Psychological Factors to Consider in Treating Patients with Acne Vulgaris\" (CC BY, first published 2026-08-17) reports: \"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.\"","support":[{"end":4179,"quote":"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":3936},{"end":6674,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":6639},{"end":6380,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":6363}],"target_id":"claim.frontier.pmid-42652751","target_kind":"node","target_sha256":"68105e08e69cb479a842e5886ecd74c477e75e7aafc447e18bd22b5592865ec1"}],"claim.frontier.pmid-42653506":[{"id":"assertion.claim.frontier.pmid-42653506","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42653506","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42653506 \"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features\" (CC BY, first published 2026-08-21) reports: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","support":[{"end":5215,"quote":"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":5096},{"end":8175,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":8140},{"end":7929,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":7912}],"target_id":"claim.frontier.pmid-42653506","target_kind":"node","target_sha256":"0d30d6564668f354c7ea1b22ee2d50ed5cee914a15c309606e142b0be1699265"}],"claim.frontier.pmid-42654288":[{"id":"assertion.claim.frontier.pmid-42654288","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42654288","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42654288 \"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey\" (CC BY, first published 2026-08-19) reports: \"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.\"","support":[{"end":10815,"quote":"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":10672},{"end":17704,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":17669},{"end":17410,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":17393}],"target_id":"claim.frontier.pmid-42654288","target_kind":"node","target_sha256":"7ff5227c16060b7c1ccdff9e013d9f6d73480fe280c5e4e9b3e1a9fd6156f96e"}],"claim.frontier.pmid-42656460":[{"id":"assertion.claim.frontier.pmid-42656460","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656460","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656460 \"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming\" (CC BY, first published 2026-08-12) reports: \"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.\"","support":[{"end":5886,"quote":"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":5724},{"end":9132,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":9097},{"end":8838,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":8821}],"target_id":"claim.frontier.pmid-42656460","target_kind":"node","target_sha256":"7dd660048f53cbcdde7fb15e863bc2324b1b52a9b7feda7f7f58e6dab5a10a7d"}],"claim.frontier.pmid-42656481":[{"id":"assertion.claim.frontier.pmid-42656481","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656481","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656481 \"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis\" (CC BY, first published 2026-08-12) reports: \"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.\"","support":[{"end":2518,"quote":"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":2409},{"end":5136,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":5101},{"end":4890,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":4873}],"target_id":"claim.frontier.pmid-42656481","target_kind":"node","target_sha256":"fed81a774c6d3c318fb1a26db35b7e211499abafeb5008bd0f9768a1e2fc4c77"}],"claim.frontier.pmid-42656672":[{"id":"assertion.claim.frontier.pmid-42656672","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656672","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656672 \"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population\" (CC BY, first published 2026-08-12) reports: \"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.\"","support":[{"end":3592,"quote":"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":3448},{"end":5746,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":5711},{"end":5452,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":5435}],"target_id":"claim.frontier.pmid-42656672","target_kind":"node","target_sha256":"14ed024a54055c55f7fb1f1d6880c419c2c609f01da5890ec767ebd1082d2de2"}],"claim.frontier.pmid-42657744":[{"id":"assertion.claim.frontier.pmid-42657744","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42657744","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42657744 \"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species\" (CC BY, first published 2026-09-01) reports: \"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.\"","support":[{"end":5983,"quote":"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":5817},{"end":8285,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":8250},{"end":8005,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":7988}],"target_id":"claim.frontier.pmid-42657744","target_kind":"node","target_sha256":"1b8c1a42a83155083f78145565d8a21d5e74dcbc589938e3dcf39850a3d09682"}],"claim.frontier.pmid-42657789":[{"id":"assertion.claim.frontier.pmid-42657789","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42657789","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42657789 \"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies\" (CC BY, first published 2026-09-01) reports: \"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.\"","support":[{"end":3278,"quote":"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":3163},{"end":7298,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":7263},{"end":7093,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":7076}],"target_id":"claim.frontier.pmid-42657789","target_kind":"node","target_sha256":"0dd24f66f7a18fc8d0fd3d8e5f9d9034b9b3986ab9156227257c0c6d502fbe78"}],"claim.frontier.pmid-42658813":[{"id":"assertion.claim.frontier.pmid-42658813","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42658813","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42658813 \"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops\" (CC BY, first published 2026-08-27) reports: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","support":[{"end":4850,"quote":"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":4477},{"end":8296,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":8261},{"end":8002,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":7985}],"target_id":"claim.frontier.pmid-42658813","target_kind":"node","target_sha256":"f02df9d5d0ff05b917a3076d5bd387f3d89cd065fd816f82f2f0f7ccad539d14"}],"claim.frontier.pmid-42661048":[{"id":"assertion.claim.frontier.pmid-42661048","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661048","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661048 \"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST\" (CC BY, first published 2026-08-27) reports: \"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.\"","support":[{"end":3325,"quote":"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":3137},{"end":6567,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":6532},{"end":6273,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":6256}],"target_id":"claim.frontier.pmid-42661048","target_kind":"node","target_sha256":"b4af8327d236afffb71e6697a3b91dc3bca355ea8f23ae7db17e9905700e28b7"}],"claim.frontier.pmid-42661611":[{"id":"assertion.claim.frontier.pmid-42661611","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661611","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661611 \"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy\" (CC BY, first published 2026-08-28) reports: \"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.\"","support":[{"end":4905,"quote":"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":4696},{"end":6936,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":6901},{"end":6644,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":6627}],"target_id":"claim.frontier.pmid-42661611","target_kind":"node","target_sha256":"c63463543242712b381bb63da12efac889f4d94a3d5b3a651984ff0419cc6b64"}],"claim.frontier.pmid-42661658":[{"id":"assertion.claim.frontier.pmid-42661658","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661658","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661658 \"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa\" (CC BY, first published 2026-08-13) reports: \"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.\"","support":[{"end":3829,"quote":"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":3651},{"end":9994,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":9959},{"end":9748,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":9731}],"target_id":"claim.frontier.pmid-42661658","target_kind":"node","target_sha256":"5ee78e849b2d266b9fa943884e386dc62145df106e7a0eb8fdc6154bae2a22f4"}],"claim.frontier.pmid-42661822":[{"id":"assertion.claim.frontier.pmid-42661822","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661822","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661822 \"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome\" (CC BY, first published 2026-08-13) reports: \"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.\"","support":[{"end":3383,"quote":"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":3134},{"end":6891,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":6856},{"end":6597,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":6580}],"target_id":"claim.frontier.pmid-42661822","target_kind":"node","target_sha256":"5d0ca139f6dd118c3d0a58b890b2c32d27c4144e3236416d58989e47c81baa1d"}],"claim.frontier.pmid-42663084":[{"id":"assertion.claim.frontier.pmid-42663084","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42663084","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42663084 \"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution\" (CC BY, first published 2026-09-01) reports: \"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.\"","support":[{"end":5645,"quote":"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":5457},{"end":9068,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":9033},{"end":8815,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":8798}],"target_id":"claim.frontier.pmid-42663084","target_kind":"node","target_sha256":"62f3fb9572b78b5d7795f3351598f029f9044545c1db0eee94864db6f8c88729"}],"claim.frontier.pmid-42664264":[{"id":"assertion.claim.frontier.pmid-42664264","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42664264","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42664264 \"Ecological theory sheds light on plasmid diversity and dynamics\" (CC BY, first published 2026-08-28) reports: \"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.\"","support":[{"end":4028,"quote":"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":3827},{"end":6708,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":6673},{"end":6414,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":6397}],"target_id":"claim.frontier.pmid-42664264","target_kind":"node","target_sha256":"48bfcd759005b33d22421275300fd9aeea5ca2278f65af86ff36627ddd277e42"}],"claim.frontier.pmid-42665853":[{"id":"assertion.claim.frontier.pmid-42665853","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42665853","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42665853 \"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort\" (CC BY, first published 2026-08-28) reports: \"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.\"","support":[{"end":7803,"quote":"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":7645},{"end":9318,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":9283},{"end":9024,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":9007}],"target_id":"claim.frontier.pmid-42665853","target_kind":"node","target_sha256":"cdf661d9bd6df4705ca434e1b306cf4a5ae8fce204430c01e4f662a8eed97340"}],"claim.frontier.pmid-42666182":[{"id":"assertion.claim.frontier.pmid-42666182","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42666182","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42666182 \"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report\" (CC BY, first published 2026-08-14) reports: \"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.\"","support":[{"end":2160,"quote":"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":1993},{"end":5310,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":5275},{"end":5016,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":4999}],"target_id":"claim.frontier.pmid-42666182","target_kind":"node","target_sha256":"a5224f81d9d67cabbc1ef26c7f1854fa7ecec2eddf09c70cf6a70f0929600a8e"}],"claim.frontier.pmid-42668719":[{"id":"assertion.claim.frontier.pmid-42668719","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42668719","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42668719 \"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient\" (CC BY, first published 2026-08-29) reports: \"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.\"","support":[{"end":8007,"quote":"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":7888},{"end":10274,"quote":"\"firstPublicationDate\":\"2026-08-29\"","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":10239},{"end":9980,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":9963}],"target_id":"claim.frontier.pmid-42668719","target_kind":"node","target_sha256":"f5c06142a7cb8cc934fd4b8a2005811f8eca397d68fad77705753823a248c9a1"}],"claim.frontier.pmid-42670810":[{"id":"assertion.claim.frontier.pmid-42670810","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42670810","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42670810 \"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance\" (CC BY, first published 2026-09-01) reports: \"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.\"","support":[{"end":4483,"quote":"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":4213},{"end":8528,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":8493},{"end":8275,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":8258}],"target_id":"claim.frontier.pmid-42670810","target_kind":"node","target_sha256":"adfad24a21b074342dfbb6c5b0b6753e8bc54ca5606887da36370346fa94b925"}],"claim.frontier.pmid-42672060":[{"id":"assertion.claim.frontier.pmid-42672060","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42672060","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42672060 \"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh\" (CC BY, first published 2026-08-31) reports: \"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.\"","support":[{"end":7185,"quote":"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":6965},{"end":10664,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":10629},{"end":10370,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":10353}],"target_id":"claim.frontier.pmid-42672060","target_kind":"node","target_sha256":"f507a8df8037f00b666d2546737dfc30453c659dab33e8d2e0710349dee61539"}],"claim.frontier.pmid-42674467":[{"id":"assertion.claim.frontier.pmid-42674467","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42674467","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42674467 \"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil\" (CC BY, first published 2026-08-31) reports: \"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).\"","support":[{"end":6928,"quote":"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":6664},{"end":9856,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":9821},{"end":9610,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":9593}],"target_id":"claim.frontier.pmid-42674467","target_kind":"node","target_sha256":"5b0cdc877ed6777b592b424051085306c886f4722cfdc4e198444fc593eae40f"}],"claim.frontier.pmid-42676491":[{"id":"assertion.claim.frontier.pmid-42676491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42676491","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42676491 \"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis\" (CC BY, first published 2026-08-17) reports: \"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.\"","support":[{"end":5375,"quote":"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":5245},{"end":7655,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":7620},{"end":7409,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":7392}],"target_id":"claim.frontier.pmid-42676491","target_kind":"node","target_sha256":"0f84a3d65d990b9be0297bf2422d1bd17cc397783ff54042eb64fead9e1a50ff"}],"claim.frontier.pmid-42682491":[{"id":"assertion.claim.frontier.pmid-42682491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42682491","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42682491 \"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort\" (CC BY, first published 2026-08-18) reports: \"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.\"","support":[{"end":3950,"quote":"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":3854},{"end":6672,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":6637},{"end":6426,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":6409}],"target_id":"claim.frontier.pmid-42682491","target_kind":"node","target_sha256":"ea970fcb44afe2511d0f5f90efaf90d91995c36f7c1908a2f30da753ee1795d5"}],"claim.frontier.pmid-42684341":[{"id":"assertion.claim.frontier.pmid-42684341","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42684341","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42684341 \"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial\" (CC BY, first published 2026-08-27) reports: \"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.\"","support":[{"end":5250,"quote":"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":5031},{"end":8630,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":8595},{"end":8336,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":8319}],"target_id":"claim.frontier.pmid-42684341","target_kind":"node","target_sha256":"849a0970789a650cf0dfee957024e054f13be03a6b63a43eb8ddf51abd2138b5"}],"claim.frontier.pmid-42685061":[{"id":"assertion.claim.frontier.pmid-42685061","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42685061","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42685061 \"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study\" (CC BY, first published 2026-09-02) reports: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","support":[{"end":2922,"quote":"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":2817},{"end":8306,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":8271},{"end":8012,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":7995}],"target_id":"claim.frontier.pmid-42685061","target_kind":"node","target_sha256":"e26894e7946baf5d7e4352f40eac122475ff554eb416687fdc4856f546a7a099"}],"claim.frontier.pmid-42687189":[{"id":"assertion.claim.frontier.pmid-42687189","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42687189","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42687189 \"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis\" (CC BY, first published 2026-09-02) reports: \"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.\"","support":[{"end":10138,"quote":"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":9931},{"end":11475,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":11440},{"end":11229,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":11212}],"target_id":"claim.frontier.pmid-42687189","target_kind":"node","target_sha256":"b035f1d18b32ec1b52b8c8af12da8729ebf719f79ec8050925a2f911a374ed19"}],"claim.frontier.pmid-42687444":[{"id":"assertion.claim.frontier.pmid-42687444","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42687444","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42687444 \"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain\" (CC BY, first published 2026-09-01) reports: \"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.\"","support":[{"end":2904,"quote":"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":2751},{"end":8763,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":8728},{"end":8558,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":8541}],"target_id":"claim.frontier.pmid-42687444","target_kind":"node","target_sha256":"a171010845e74d19cddcd9bae1fc8b03b348bf9788fae0f7b0e8f0ffeba8e1e7"}],"claim.frontier.pmid-42688865":[{"id":"assertion.claim.frontier.pmid-42688865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42688865","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42688865 \"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review\" (CC BY, first published 2026-09-02) reports: \"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.\"","support":[{"end":2647,"quote":"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":2438},{"end":5348,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":5313},{"end":5054,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":5037}],"target_id":"claim.frontier.pmid-42688865","target_kind":"node","target_sha256":"006dee8315aa41a88939b189180a249875162b00eaacb39d8da5aee29070716e"}],"claim.frontier.pmid-42688919":[{"id":"assertion.claim.frontier.pmid-42688919","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42688919","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42688919 \"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report\" (CC BY, first published 2026-09-02) reports: \"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.\"","support":[{"end":3800,"quote":"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":3585},{"end":6340,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":6305},{"end":6094,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":6077}],"target_id":"claim.frontier.pmid-42688919","target_kind":"node","target_sha256":"5acd8d6fe7a7a64c1bfc507a3ff63f0cad3fd250e992aff7fc9b24b357687efd"}],"claim.frontier.pmid-42689122":[{"id":"assertion.claim.frontier.pmid-42689122","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42689122","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42689122 \"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes\" (CC BY, first published 2026-08-19) reports: \"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.\"","support":[{"end":5199,"quote":"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":5001},{"end":7221,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":7186},{"end":6927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":6910}],"target_id":"claim.frontier.pmid-42689122","target_kind":"node","target_sha256":"4727bb4433f4805220824c25037ddbf2d4dc5dd11ddbd6add5ed152d4f13811e"}],"claim.frontier.pmid-42689273":[{"id":"assertion.claim.frontier.pmid-42689273","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42689273","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42689273 \"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice\" (CC BY, first published 2026-08-20) reports: \"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.\"","support":[{"end":3465,"quote":"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":3333},{"end":5300,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":5265},{"end":5006,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":4989}],"target_id":"claim.frontier.pmid-42689273","target_kind":"node","target_sha256":"bc9ff6f4f9618108717cbae7564ebeffd1c879badade57800380496304b2c893"}],"claim.frontier.pmid-42694103":[{"id":"assertion.claim.frontier.pmid-42694103","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42694103","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42694103 \"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load\" (CC BY, first published 2026-08-20) reports: \"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.\"","support":[{"end":4332,"quote":"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":4120},{"end":5971,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":5936},{"end":5677,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":5660}],"target_id":"claim.frontier.pmid-42694103","target_kind":"node","target_sha256":"d2f79a00e357a47c5b360b2062cafda4173bbc638bc4af8bba90d7af8c6369d7"}],"claim.frontier.pmid-42694918":[{"id":"assertion.claim.frontier.pmid-42694918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42694918","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42694918 \"\"What about that violence?\" Transforming the discourse on violence in mental health research and services\" (CC BY, first published 2026-08-20) reports: \"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.\"","support":[{"end":5958,"quote":"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":5781},{"end":7371,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":7336},{"end":7077,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":7060}],"target_id":"claim.frontier.pmid-42694918","target_kind":"node","target_sha256":"290e7ce236e20b940cfbc559f2eb512693c3e8b1213f958ab7f284d58c185da4"}],"claim.frontier.pmid-42698113":[{"id":"assertion.claim.frontier.pmid-42698113","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42698113","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42698113 \"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre\" (CC BY, first published 2026-09-04) reports: \"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.\"","support":[{"end":6360,"quote":"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":6245},{"end":8063,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":8028},{"end":7769,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":7752}],"target_id":"claim.frontier.pmid-42698113","target_kind":"node","target_sha256":"02f6df8f91e5d72a3ecca6f8324026fac5abe1a8d08fceab26d16c84cfaaaeb7"}],"claim.frontier.pmid-42698454":[{"id":"assertion.claim.frontier.pmid-42698454","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42698454","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42698454 \"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem\" (CC BY, first published 2026-08-21) reports: \"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.\"","support":[{"end":2149,"quote":"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":1958},{"end":6173,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":6138},{"end":5879,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":5862}],"target_id":"claim.frontier.pmid-42698454","target_kind":"node","target_sha256":"08fec85e961070ed564996179acfa18762dbfa162922200d56af1cd8b70353ae"}],"claim.frontier.pmid-42706664":[{"id":"assertion.claim.frontier.pmid-42706664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42706664","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42706664 \"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness\" (CC BY, first published 2026-09-01) reports: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","support":[{"end":2427,"quote":"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":2185},{"end":5551,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":5516},{"end":5298,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":5281}],"target_id":"claim.frontier.pmid-42706664","target_kind":"node","target_sha256":"f92ec5360a7c795cf30b1d769911b48d1b79348f27525c8c59c7856ef8f12d86"}],"claim.frontier.pmid-42707216":[{"id":"assertion.claim.frontier.pmid-42707216","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42707216","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42707216 \"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases\" (CC BY, first published 2026-08-24) reports: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","support":[{"end":2394,"quote":"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":2306},{"end":4621,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":4586},{"end":4375,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":4358}],"target_id":"claim.frontier.pmid-42707216","target_kind":"node","target_sha256":"486daf4ba4d7e6c9bbc3df6ec7fdc89195e7fa33d6afee241a738430cf333020"}],"claim.frontier.pmid-42707529":[{"id":"assertion.claim.frontier.pmid-42707529","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42707529","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42707529 \"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case\" (CC BY, first published 2026-08-24) reports: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","support":[{"end":3392,"quote":"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":3054},{"end":5221,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":5186},{"end":4927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":4910}],"target_id":"claim.frontier.pmid-42707529","target_kind":"node","target_sha256":"ba7d2ace937dcd39df910f24b73ec174f630fe5eca203980a2013594dd28ec46"}],"claim.frontier.pmid-42708953":[{"id":"assertion.claim.frontier.pmid-42708953","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42708953","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42708953 \"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress\" (CC BY, first published 2026-09-01) reports: \"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.\"","support":[{"end":5849,"quote":"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":5623},{"end":7723,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":7688},{"end":7464,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":7447}],"target_id":"claim.frontier.pmid-42708953","target_kind":"node","target_sha256":"57199be867646b12d5242e0ede9f21998c57641c5cdf07252f1c80c3f285d4ca"}],"claim.frontier.pmid-42709467":[{"id":"assertion.claim.frontier.pmid-42709467","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709467","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709467 \"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort\" (CC BY, first published 2026-09-01) reports: \"Male sex was associated with treatment escalation.\"","support":[{"end":8194,"quote":"Male sex was associated with treatment escalation.","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":8144},{"end":9519,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":9484},{"end":9314,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":9297}],"target_id":"claim.frontier.pmid-42709467","target_kind":"node","target_sha256":"20ad9c86d35dbad1d37621d8719ed2def65a798c17011c8bb4c3a9156c76452d"}],"claim.frontier.pmid-42709851":[{"id":"assertion.claim.frontier.pmid-42709851","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709851","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709851 \"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study\" (CC BY, first published 2026-09-08) reports: \"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.\"","support":[{"end":8109,"quote":"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":7904},{"end":12158,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":12123},{"end":11864,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":11847}],"target_id":"claim.frontier.pmid-42709851","target_kind":"node","target_sha256":"395147dbc61b63f6803a9d0ec05ed2f3a6fe7350c840b28c184776b516a25428"}],"claim.frontier.pmid-42709861":[{"id":"assertion.claim.frontier.pmid-42709861","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709861","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709861 \"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection\" (CC BY, first published 2026-09-08) reports: \"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.\"","support":[{"end":5058,"quote":"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":4905},{"end":9082,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":9047},{"end":8788,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":8771}],"target_id":"claim.frontier.pmid-42709861","target_kind":"node","target_sha256":"7c41715491a008e83f6166c579107c6ace5075c6f1e5570dc9ecb535932f04ad"}],"claim.frontier.pmid-42712360":[{"id":"assertion.claim.frontier.pmid-42712360","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42712360","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42712360 \"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain\" (CC BY, first published 2026-08-25) reports: \"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.\"","support":[{"end":4643,"quote":"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":4302},{"end":8431,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":8396},{"end":8137,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":8120}],"target_id":"claim.frontier.pmid-42712360","target_kind":"node","target_sha256":"6d95de8e09af43295134585f16f1b6117c0297d8cda5a6592a7b7a5ddc2e8b8a"}],"claim.frontier.pmid-42713496":[{"id":"assertion.claim.frontier.pmid-42713496","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42713496","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42713496 \"Research advances in hypertriglyceridemia-induced acute pancreatitis\" (CC BY, first published 2026-08-25) reports: \"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.\"","support":[{"end":1760,"quote":"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":1526},{"end":4734,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":4699},{"end":4440,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":4423}],"target_id":"claim.frontier.pmid-42713496","target_kind":"node","target_sha256":"05c354c6074a2fe3a1fea06a7ad061429762b48c58056a98f0ffb45eafebf090"}],"claim.frontier.pmid-42718586":[{"id":"assertion.claim.frontier.pmid-42718586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42718586","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42718586 \"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma\" (CC BY, first published 2026-08-26) reports: \"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.\"","support":[{"end":4267,"quote":"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":4135},{"end":10170,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":10135},{"end":9876,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":9859}],"target_id":"claim.frontier.pmid-42718586","target_kind":"node","target_sha256":"8c1363d25511eaba65af410c3dc6313ecc8e816667f0eb7426f4dc7a62903803"}],"claim.frontier.pmid-42719040":[{"id":"assertion.claim.frontier.pmid-42719040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719040","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719040 \"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance\" (CC BY, first published 2026-08-26) reports: \"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.\"","support":[{"end":2751,"quote":"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":2575},{"end":4758,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":4723},{"end":4464,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":4447}],"target_id":"claim.frontier.pmid-42719040","target_kind":"node","target_sha256":"518bb8e53a17f714632258cd79bea8723b1167626ed26faaf1e90c440d4ae0a2"}],"claim.frontier.pmid-42719051":[{"id":"assertion.claim.frontier.pmid-42719051","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719051","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719051 \"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives\" (CC BY, first published 2026-08-26) reports: \"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.\"","support":[{"end":3549,"quote":"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":3400},{"end":5415,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":5380},{"end":5121,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":5104}],"target_id":"claim.frontier.pmid-42719051","target_kind":"node","target_sha256":"69399443261734a8ad78045d143caef31e83d3f6dde2d7d036da5fea3071bea5"}],"claim.frontier.pmid-42719160":[{"id":"assertion.claim.frontier.pmid-42719160","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719160","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719160 \"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students\" (CC BY, first published 2026-08-26) reports: \"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.\"","support":[{"end":3746,"quote":"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":3529},{"end":5186,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":5151},{"end":4892,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":4875}],"target_id":"claim.frontier.pmid-42719160","target_kind":"node","target_sha256":"b3cef8608b30adea0f8f5cb6a5fa45392ae356a1d7f529fa7a99b69c437a63bd"}],"claim.frontier.pmid-42721128":[{"id":"assertion.claim.frontier.pmid-42721128","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721128","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721128 \"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops\" (CC BY, first published 2026-09-10) reports: \"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.\"","support":[{"end":4920,"quote":"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":4696},{"end":6848,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":6813},{"end":6554,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":6537}],"target_id":"claim.frontier.pmid-42721128","target_kind":"node","target_sha256":"e5c16bd8ff13d31d0ef7b86b01bc6f1cd106fe481c245ec1cb52160859bdac84"}],"claim.frontier.pmid-42721140":[{"id":"assertion.claim.frontier.pmid-42721140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721140","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721140 \"Grey voters and populist voting. The role of religiosity and national collective narcissism\" (CC BY, first published 2026-09-10) reports: \"We also found religious faith to be a stronger predictor of populist voting than religious practice.\"","support":[{"end":2596,"quote":"We also found religious faith to be a stronger predictor of populist voting than religious practice.","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":2496},{"end":4532,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":4497},{"end":4238,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":4221}],"target_id":"claim.frontier.pmid-42721140","target_kind":"node","target_sha256":"c64549fd4b637a1e156df5eec0de50d44898af2e8eec74667d772c61a1efda52"}],"claim.frontier.pmid-42721148":[{"id":"assertion.claim.frontier.pmid-42721148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721148","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721148 \"Care network types and depression among people with cognitive impairment: A latent class analysis\" (CC BY, first published 2026-09-10) reports: \"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.\"","support":[{"end":3556,"quote":"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":3359},{"end":6505,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":6470},{"end":6211,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":6194}],"target_id":"claim.frontier.pmid-42721148","target_kind":"node","target_sha256":"b41ff092077845ff46a7a11d7817b3b237fa78daed3a76b90800670a2567b9fe"}],"claim.frontier.pmid-42721180":[{"id":"assertion.claim.frontier.pmid-42721180","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721180","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721180 \"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis\" (CC BY, first published 2026-09-10) reports: \"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.\"","support":[{"end":5025,"quote":"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":4718},{"end":8372,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":8337},{"end":8126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":8109}],"target_id":"claim.frontier.pmid-42721180","target_kind":"node","target_sha256":"e5b3cc471a1a78aa6a5b9570e0e6b4b087913b42ddcdb62221632d5f021b46c8"}],"claim.frontier.pmid-42721209":[{"id":"assertion.claim.frontier.pmid-42721209","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721209","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721209 \"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study\" (CC BY, first published 2026-09-10) reports: \"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.\"","support":[{"end":3155,"quote":"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":2933},{"end":5642,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":5607},{"end":5348,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":5331}],"target_id":"claim.frontier.pmid-42721209","target_kind":"node","target_sha256":"163389a73dda55a8db61fb0b59999e3cff8ea046b874764a72bf24baa178b3f7"}],"claim.frontier.pmid-42723771":[{"id":"assertion.claim.frontier.pmid-42723771","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42723771","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42723771 \"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment\" (CC BY, first published 2026-07-23) reports: \"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.\"","support":[{"end":4025,"quote":"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":3896},{"end":6007,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":5972},{"end":5713,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":5696}],"target_id":"claim.frontier.pmid-42723771","target_kind":"node","target_sha256":"d2ecbb765c3e7b74c62f93e9459a4ecd5336dc0f2b6f0a9ba571127b9117b174"}],"claim.frontier.pmid-42724033":[{"id":"assertion.claim.frontier.pmid-42724033","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42724033","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42724033 \"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance\" (CC BY, first published 2026-08-27) reports: \"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.\"","support":[{"end":3326,"quote":"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":3150},{"end":5372,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":5337},{"end":5126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":5109}],"target_id":"claim.frontier.pmid-42724033","target_kind":"node","target_sha256":"5c8ef1175657c521182b6337d373610665f8c0885c6527f44cbbdec1385a968a"}],"claim.frontier.pmid-42725211":[{"id":"assertion.claim.frontier.pmid-42725211","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42725211","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42725211 \"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.\"","support":[{"end":2065,"quote":"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":1920},{"end":4939,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":4904},{"end":4693,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":4676}],"target_id":"claim.frontier.pmid-42725211","target_kind":"node","target_sha256":"e68d39f3fcf654a202f4536e15750c093535f8948a7f1e39793f3629e8bc5a31"}],"claim.frontier.pmid-42725296":[{"id":"assertion.claim.frontier.pmid-42725296","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42725296","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42725296 \"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia\" (CC BY, first published 2026-09-10) reports: \"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.\"","support":[{"end":5113,"quote":"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":4992},{"end":7174,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":7139},{"end":6868,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":6851}],"target_id":"claim.frontier.pmid-42725296","target_kind":"node","target_sha256":"7c5d4a1f693b2590ff9b5614a3f60c17add4d0fa2d2f50d18fbf9217ab5d2904"}],"claim.frontier.pmid-42726368":[{"id":"assertion.claim.frontier.pmid-42726368","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42726368","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42726368 \"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk\" (CC BY, first published 2026-09-11) reports: \"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.\"","support":[{"end":7373,"quote":"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":7120},{"end":10562,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":10527},{"end":10268,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":10251}],"target_id":"claim.frontier.pmid-42726368","target_kind":"node","target_sha256":"ec8ca6c6eb23ee5d097a6bc758b0f26e8ba8d2d001d231d24284c97e97c15d79"}],"claim.frontier.pmid-42726890":[{"id":"assertion.claim.frontier.pmid-42726890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42726890","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42726890 \"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex\" (CC BY, first published 2026-09-11) reports: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","support":[{"end":3832,"quote":"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":3517},{"end":7087,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":7052},{"end":6841,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":6824}],"target_id":"claim.frontier.pmid-42726890","target_kind":"node","target_sha256":"2632e28ba45a92c1b8a5434f2fc17a6465e11c575897f556063357692429b4f5"}],"claim.frontier.pmid-42728921":[{"id":"assertion.claim.frontier.pmid-42728921","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728921","quantifiers":"Only what the quoted sentence states","time":"2026-08-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728921 \"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector\" (CC BY, first published 2026-08-08) reports: \"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.\"","support":[{"end":3616,"quote":"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":3266},{"end":6536,"quote":"\"firstPublicationDate\":\"2026-08-08\"","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":6501},{"end":6242,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":6225}],"target_id":"claim.frontier.pmid-42728921","target_kind":"node","target_sha256":"d7f203f06a31c0115e6f3165e458a203e2403a167e36a9435fc6935df6f08d95"}],"claim.frontier.pmid-42728923":[{"id":"assertion.claim.frontier.pmid-42728923","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728923","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728923 \"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education\" (CC BY, first published 2026-08-19) reports: \"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.\"","support":[{"end":3804,"quote":"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":3675},{"end":6540,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":6505},{"end":6246,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":6229}],"target_id":"claim.frontier.pmid-42728923","target_kind":"node","target_sha256":"1cdd7398d3f95c84e9e86260acf694013eacda74b5f73964f28680cef906ea93"}],"claim.frontier.pmid-42728936":[{"id":"assertion.claim.frontier.pmid-42728936","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728936","quantifiers":"Only what the quoted sentence states","time":"2026-08-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728936 \"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas\" (CC BY, first published 2026-08-22) reports: \"Our results reveal that fungal and bacterial communities responded differently to land-use management.\"","support":[{"end":5198,"quote":"Our results reveal that fungal and bacterial communities responded differently to land-use management.","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":5096},{"end":7495,"quote":"\"firstPublicationDate\":\"2026-08-22\"","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":7460},{"end":7201,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":7184}],"target_id":"claim.frontier.pmid-42728936","target_kind":"node","target_sha256":"271fb79224ea70486766d050272db423fed6de898988487f5d2f7d960b885d30"}],"claim.frontier.pmid-42728996":[{"id":"assertion.claim.frontier.pmid-42728996","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728996","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728996 \"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy\" (CC BY, first published 2026-08-14) reports: \"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.\"","support":[{"end":3215,"quote":"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":3046},{"end":5932,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":5897},{"end":5638,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":5621}],"target_id":"claim.frontier.pmid-42728996","target_kind":"node","target_sha256":"a40e80accc20afda4cc8c753638e2d9a42eed4fce5c561269d5a1c397e01a551"}],"claim.frontier.pmid-42729309":[{"id":"assertion.claim.frontier.pmid-42729309","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729309","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729309 \"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety\" (CC BY, first published 2026-08-28) reports: \"The results reveal a significant spatial divergence in information perception.\"","support":[{"end":2504,"quote":"The results reveal a significant spatial divergence in information perception.","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":2426},{"end":6499,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":6464},{"end":6253,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":6236}],"target_id":"claim.frontier.pmid-42729309","target_kind":"node","target_sha256":"91194a5b6d8b72739bc385e4d7193ff2921b8d460dfeb3cbad18b22d970659e2"}],"claim.frontier.pmid-42729546":[{"id":"assertion.claim.frontier.pmid-42729546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729546","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729546 \"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy\" (CC BY, first published 2026-08-28) reports: \"preparations or TQ was associated with improvements in clinical periodontal outcome measures.\"","support":[{"end":3640,"quote":"preparations or TQ was associated with improvements in clinical periodontal outcome measures.","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":3547},{"end":6055,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":6020},{"end":5761,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":5744}],"target_id":"claim.frontier.pmid-42729546","target_kind":"node","target_sha256":"3f42ceba417fc081f5bf51bb03a44971c3c99425892749c186102e831ffed6c1"}],"claim.frontier.pmid-42729934":[{"id":"assertion.claim.frontier.pmid-42729934","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729934","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729934 \"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome\" (CC BY, first published 2026-08-31) reports: \"These findings highlight the need for systematic strategies in primary care to improve management in CCS.\"","support":[{"end":5607,"quote":"These findings highlight the need for systematic strategies in primary care to improve management in CCS.","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":5502},{"end":8037,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":8002},{"end":7743,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":7726}],"target_id":"claim.frontier.pmid-42729934","target_kind":"node","target_sha256":"fb26700cbc121cf3f180fd287c328421d4397060ff2f1e848a15d911afb3f568"}],"claim.frontier.pmid-42729983":[{"id":"assertion.claim.frontier.pmid-42729983","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729983","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729983 \"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations\" (CC BY, first published 2026-09-11) reports: \"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.\"","support":[{"end":4779,"quote":"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":4609},{"end":6129,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":6094},{"end":5835,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":5818}],"target_id":"claim.frontier.pmid-42729983","target_kind":"node","target_sha256":"ae97ef5999a12b6d727054db7d2e76647d0b5ba067d87bbacc158eee17619648"}],"claim.frontier.pmid-42730235":[{"id":"assertion.claim.frontier.pmid-42730235","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42730235","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42730235 \"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex\" (CC BY, first published 2026-09-11) reports: \"Together, these results suggest a potential pest complex where previously only one species was in focus.\"","support":[{"end":4516,"quote":"Together, these results suggest a potential pest complex where previously only one species was in focus.","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":4412},{"end":6317,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":6282},{"end":6008,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":5991}],"target_id":"claim.frontier.pmid-42730235","target_kind":"node","target_sha256":"2669d15db9e207df115acde85eb7d0cc18084fa4431f7edbaa4bf6abc3faa23f"}],"claim.frontier.pmid-42731744":[{"id":"assertion.claim.frontier.pmid-42731744","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42731744","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42731744 \"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation\" (CC BY, first published 2026-09-12) reports: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","support":[{"end":2776,"quote":"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":2511},{"end":5032,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":4997},{"end":4786,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":4769}],"target_id":"claim.frontier.pmid-42731744","target_kind":"node","target_sha256":"04b118b89656c354c73d896cfb5f5ddce20f5eb56358d2ddf55a87e0413862bc"}],"claim.frontier.pmid-42732108":[{"id":"assertion.claim.frontier.pmid-42732108","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42732108","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42732108 \"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations\" (CC BY, first published 2026-09-08) reports: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","support":[{"end":5217,"quote":"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":5075},{"end":8403,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":8368},{"end":8109,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":8092}],"target_id":"claim.frontier.pmid-42732108","target_kind":"node","target_sha256":"468911e0f73238ab87c7f5c22e31d0268389c633c5b68e887f5859a1835e9e66"}],"claim.frontier.pmid-42732322":[{"id":"assertion.claim.frontier.pmid-42732322","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42732322","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42732322 \"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report\" (CC BY, first published 2026-08-13) reports: \"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.\"","support":[{"end":1889,"quote":"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":1709},{"end":4257,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":4222},{"end":3963,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":3946}],"target_id":"claim.frontier.pmid-42732322","target_kind":"node","target_sha256":"9c6b77c18d7204353320e081b532d15279fb67dfb1f0d53971469c2230ccdab8"}],"claim.frontier.pmid-42733890":[{"id":"assertion.claim.frontier.pmid-42733890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42733890","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42733890 \"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction\" (CC BY, first published 2026-08-12) reports: \"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.\"","support":[{"end":4165,"quote":"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":3883},{"end":6556,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":6521},{"end":6310,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":6293}],"target_id":"claim.frontier.pmid-42733890","target_kind":"node","target_sha256":"424cfad5b5b694a240aefa0432f76609b0c7e5cef676f920a0ea3bae9e849310"}],"claim.frontier.pmid-42736559":[{"id":"assertion.claim.frontier.pmid-42736559","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42736559","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42736559 \"Living with adenomyosis and involuntary childlessness: a qualitative interview study\" (CC BY, first published 2026-09-14) reports: \"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.\"","support":[{"end":4544,"quote":"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":4243},{"end":7150,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":7115},{"end":6856,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":6839}],"target_id":"claim.frontier.pmid-42736559","target_kind":"node","target_sha256":"347403499c53824b82dfe675d062734ed166a3fc5131a29af981bd30aa0c5447"}],"claim.frontier.pmid-42737031":[{"id":"assertion.claim.frontier.pmid-42737031","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737031","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737031 \"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study\" (CC BY, first published 2026-09-07) reports: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","support":[{"end":2760,"quote":"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":2518},{"end":6250,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":6215},{"end":5956,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":5939}],"target_id":"claim.frontier.pmid-42737031","target_kind":"node","target_sha256":"202296fde9fab99bf76e9441383a6780197c0ba1272aecc168e1171690f01ad7"}],"claim.frontier.pmid-42737450":[{"id":"assertion.claim.frontier.pmid-42737450","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737450","quantifiers":"Only what the quoted sentence states","time":"2026-08-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737450 \"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis\" (CC BY, first published 2026-08-23) reports: \"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.\"","support":[{"end":7876,"quote":"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":7731},{"end":12697,"quote":"\"firstPublicationDate\":\"2026-08-23\"","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":12662},{"end":12451,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":12434}],"target_id":"claim.frontier.pmid-42737450","target_kind":"node","target_sha256":"441bf231cac781e8999bec0166a3f518d226313437748a6d74028be61bf400e8"}],"claim.frontier.pmid-42737499":[{"id":"assertion.claim.frontier.pmid-42737499","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737499","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737499 \"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling\" (CC BY, first published 2026-08-25) reports: \"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.\"","support":[{"end":4669,"quote":"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":4400},{"end":8522,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":8487},{"end":8228,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":8211}],"target_id":"claim.frontier.pmid-42737499","target_kind":"node","target_sha256":"23aaf4a4bce6c940567e8e3ccc6552e2e0e5ff56fc490db73f4fb58d1f251bb1"}],"claim.frontier.pmid-42737509":[{"id":"assertion.claim.frontier.pmid-42737509","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737509","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737509 \"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities\" (CC BY, first published 2026-08-25) reports: \"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.\"","support":[{"end":2642,"quote":"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":2237},{"end":6438,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":6403},{"end":6192,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":6175}],"target_id":"claim.frontier.pmid-42737509","target_kind":"node","target_sha256":"18f998221fcbbe4aabc4af7beaab8153e28b28150853b6b6258c64bb7eee56cb"}],"claim.frontier.pmid-42737882":[{"id":"assertion.claim.frontier.pmid-42737882","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737882","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737882 \"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance\" (CC BY, first published 2026-08-24) reports: \"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.\"","support":[{"end":4006,"quote":"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":3790},{"end":6182,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":6147},{"end":5888,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":5871}],"target_id":"claim.frontier.pmid-42737882","target_kind":"node","target_sha256":"d9d6ace3ec4a03c76138b16d42191f528c22c27c8edf483cac59cb78d6885a0c"}],"claim.frontier.pmid-42737913":[{"id":"assertion.claim.frontier.pmid-42737913","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737913","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737913 \"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>\" (CC BY, first published 2026-09-01) reports: \"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.\"","support":[{"end":4753,"quote":"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":4640},{"end":7936,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":7901},{"end":7632,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":7615}],"target_id":"claim.frontier.pmid-42737913","target_kind":"node","target_sha256":"dfc14866ca846ea758fdc69d1812966a6ba8d2727682853c9f993dec8d302257"}],"claim.frontier.pmid-42738411":[{"id":"assertion.claim.frontier.pmid-42738411","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42738411","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42738411 \"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia\" (CC BY, first published 2026-09-07) reports: \"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.\"","support":[{"end":6957,"quote":"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":6773},{"end":9052,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":9017},{"end":8758,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":8741}],"target_id":"claim.frontier.pmid-42738411","target_kind":"node","target_sha256":"387a225d0bb767d7b51be3b905e476bf1ae40a95ccf45560498182f9ab3ed251"}],"claim.frontier.pmid-42739550":[{"id":"assertion.claim.frontier.pmid-42739550","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739550","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739550 \"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study\" (CC BY, first published 2026-08-25) reports: \"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.\"","support":[{"end":2165,"quote":"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":1861},{"end":5981,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":5946},{"end":5687,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":5670}],"target_id":"claim.frontier.pmid-42739550","target_kind":"node","target_sha256":"30a03b5a07b5b969bf6c056eb69ad10023ff2eb8a6ea9c32a9c5fb69fd463cf1"}],"claim.frontier.pmid-42739854":[{"id":"assertion.claim.frontier.pmid-42739854","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739854","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739854 \"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry\" (CC BY, first published 2026-09-04) reports: \"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).\"","support":[{"end":10146,"quote":"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":9766},{"end":12609,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":12574},{"end":12315,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":12298}],"target_id":"claim.frontier.pmid-42739854","target_kind":"node","target_sha256":"38b7d21cb54b90dba89d8ced19726c68a96e2c535ca1b451ae0327e5dc382640"}],"claim.frontier.pmid-42739910":[{"id":"assertion.claim.frontier.pmid-42739910","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739910","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739910 \"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support\" (CC BY, first published 2026-09-07) reports: \"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.\"","support":[{"end":4174,"quote":"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":4038},{"end":5765,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":5730},{"end":5519,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":5502}],"target_id":"claim.frontier.pmid-42739910","target_kind":"node","target_sha256":"b2fbbc86d21df1a0a65b13e31e644a277f82d45014544bc12ca6890162e50880"}],"claim.frontier.pmid-42739931":[{"id":"assertion.claim.frontier.pmid-42739931","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739931","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739931 \"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs\" (CC BY, first published 2026-09-07) reports: \": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.\"","support":[{"end":6085,"quote":": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":5974},{"end":8015,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":7980},{"end":7721,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":7704}],"target_id":"claim.frontier.pmid-42739931","target_kind":"node","target_sha256":"c1986d6fa7584e5ca717ce6c357002091dbbde0afb116408bffa2937712093df"}],"claim.frontier.pmid-42741165":[{"id":"assertion.claim.frontier.pmid-42741165","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42741165","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42741165 \"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China\" (CC BY, first published 2026-08-31) reports: \"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.\"","support":[{"end":3747,"quote":"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":3590},{"end":7260,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":7225},{"end":6959,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":6942}],"target_id":"claim.frontier.pmid-42741165","target_kind":"node","target_sha256":"5338485b9563fc0b4de27b267bfb07f9f06d7fe351053e385be8727eab4cb4d7"}],"claim.frontier.pmid-42741475":[{"id":"assertion.claim.frontier.pmid-42741475","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42741475","quantifiers":"Only what the quoted sentence states","time":"2026-08-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42741475 \"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung\" (CC BY, first published 2026-08-15) reports: \"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.\"","support":[{"end":2761,"quote":"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":2571},{"end":5409,"quote":"\"firstPublicationDate\":\"2026-08-15\"","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":5374},{"end":5115,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":5098}],"target_id":"claim.frontier.pmid-42741475","target_kind":"node","target_sha256":"d98fd40bf4e30075b95c818db370bff07f7721f8561fa6fcd9d9c06bb588ab1f"}],"claim.frontier.pmid-42742452":[{"id":"assertion.claim.frontier.pmid-42742452","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42742452","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42742452 \"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation\" (CC BY, first published 2026-09-01) reports: \"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.\"","support":[{"end":5426,"quote":"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":5271},{"end":9586,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":9551},{"end":9333,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":9316}],"target_id":"claim.frontier.pmid-42742452","target_kind":"node","target_sha256":"5075e8ec271873e69ad05ab00cd5c924b8351d49b455039a3bd0380b03a39803"}],"claim.frontier.pmid-42743158":[{"id":"assertion.claim.frontier.pmid-42743158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743158","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743158 \"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease\" (CC BY, first published 2026-09-15) reports: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","support":[{"end":2504,"quote":"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":2306},{"end":6950,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":6915},{"end":6704,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":6687}],"target_id":"claim.frontier.pmid-42743158","target_kind":"node","target_sha256":"3eb20fe224c1723d4b1bb81efe6fff663cdcdfb142f3ee3375173d512b54d56e"}],"claim.frontier.pmid-42743162":[{"id":"assertion.claim.frontier.pmid-42743162","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743162","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743162 \"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids\" (CC BY, first published 2026-09-15) reports: \"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.\"","support":[{"end":3089,"quote":"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":2935},{"end":6173,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":6138},{"end":5927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":5910}],"target_id":"claim.frontier.pmid-42743162","target_kind":"node","target_sha256":"cbc9d40947decc24bb57a4c1ff52c43e391499b78eb773f3985ff886c82c7c0a"}],"claim.frontier.pmid-42743204":[{"id":"assertion.claim.frontier.pmid-42743204","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743204","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743204 \"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study\" (CC BY, first published 2026-09-15) reports: \"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).\"","support":[{"end":3647,"quote":"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":3363},{"end":6713,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":6678},{"end":6419,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":6402}],"target_id":"claim.frontier.pmid-42743204","target_kind":"node","target_sha256":"bbdc5d42f634de433a85a1c81dee0971a3692471eeacdcadac5e4b54dce8e0e5"}],"claim.frontier.pmid-42743306":[{"id":"assertion.claim.frontier.pmid-42743306","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743306","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743306 \"Convergent evolution of viral nucleases targeting cyclic dinucleotides\" (CC BY, first published 2026-09-15) reports: \"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.\"","support":[{"end":2563,"quote":"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":2470},{"end":6009,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":5974},{"end":5763,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":5746}],"target_id":"claim.frontier.pmid-42743306","target_kind":"node","target_sha256":"cd365f72114d8f592e55b4f6f49b52a2c0db983562f3164a09b2aac95932199d"}],"claim.frontier.pmid-42743310":[{"id":"assertion.claim.frontier.pmid-42743310","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743310","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743310 \"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis\" (CC BY, first published 2026-09-15) reports: \"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.\"","support":[{"end":2524,"quote":"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":2393},{"end":5102,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":5067},{"end":4856,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":4839}],"target_id":"claim.frontier.pmid-42743310","target_kind":"node","target_sha256":"74487a0239bbba9fe27d0b2db8903f8313d73e47e2244277ec4799bbbadc6584"}],"claim.frontier.pmid-42743377":[{"id":"assertion.claim.frontier.pmid-42743377","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743377","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743377 \"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology\" (CC BY, first published 2026-09-15) reports: \"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.\"","support":[{"end":2413,"quote":"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":2160},{"end":5715,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":5680},{"end":5469,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":5452}],"target_id":"claim.frontier.pmid-42743377","target_kind":"node","target_sha256":"a722ec044a3fe9235551f5c479cc88304b9e598e10305bc0c1a5908ab9763891"}],"claim.frontier.pmid-42745765":[{"id":"assertion.claim.frontier.pmid-42745765","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42745765","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42745765 \"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome\" (CC BY, first published 2026-09-01) reports: \"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.\"","support":[{"end":5035,"quote":"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":4814},{"end":8240,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":8205},{"end":7946,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":7929}],"target_id":"claim.frontier.pmid-42745765","target_kind":"node","target_sha256":"33daa60aad1a28c80bfdabf539db7a725cf12101a4a77acf4abdaa041b596173"}],"claim.frontier.pmid-42746056":[{"id":"assertion.claim.frontier.pmid-42746056","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746056","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746056 \"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework\" (CC BY, first published 2026-09-01) reports: \"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.\"","support":[{"end":1887,"quote":"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":1785},{"end":7398,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":7363},{"end":7152,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":7135}],"target_id":"claim.frontier.pmid-42746056","target_kind":"node","target_sha256":"d46f43bb44e84651fca7f73dabb744143f38f0728fcfa10b32bebb200d336b48"}],"claim.frontier.pmid-42746333":[{"id":"assertion.claim.frontier.pmid-42746333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746333","quantifiers":"Only what the quoted sentence states","time":"2026-08-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746333 \"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp\" (CC BY, first published 2026-08-16) reports: \"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.\"","support":[{"end":2589,"quote":"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":2429},{"end":5497,"quote":"\"firstPublicationDate\":\"2026-08-16\"","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":5462},{"end":5251,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":5234}],"target_id":"claim.frontier.pmid-42746333","target_kind":"node","target_sha256":"e22f13bc2ae921e4c725f64dacaf8e4edad139d58fa1cf9c025debc408ac1364"}],"claim.frontier.pmid-42746465":[{"id":"assertion.claim.frontier.pmid-42746465","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746465","quantifiers":"Only what the quoted sentence states","time":"2026-08-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746465 \"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta\" (CC BY, first published 2026-08-16) reports: \"The condition was associated with prolonged hospital stay and substantial infectious complications.\"","support":[{"end":4748,"quote":"The condition was associated with prolonged hospital stay and substantial infectious complications.","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":4649},{"end":6165,"quote":"\"firstPublicationDate\":\"2026-08-16\"","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":6130},{"end":5919,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":5902}],"target_id":"claim.frontier.pmid-42746465","target_kind":"node","target_sha256":"91400bc09e629fa39797ef5ccb748f7cfc17b8cfe701e79d47b86255c193c5a4"}],"claim.frontier.pmid-42746596":[{"id":"assertion.claim.frontier.pmid-42746596","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746596","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746596 \"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity\" (CC BY, first published 2026-09-15) reports: \"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.\"","support":[{"end":5771,"quote":"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":5634},{"end":8119,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":8084},{"end":7873,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":7856}],"target_id":"claim.frontier.pmid-42746596","target_kind":"node","target_sha256":"eb938a4dc3ed050f2c07f43ca989184b0e82e8c7fbfe0ab6b0102f21aae2b64f"}],"claim.frontier.pmid-42746605":[{"id":"assertion.claim.frontier.pmid-42746605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746605","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746605 \"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study\" (CC BY, first published 2026-09-14) reports: \"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.\"","support":[{"end":4421,"quote":"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":4163},{"end":5870,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":5835},{"end":5624,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":5607}],"target_id":"claim.frontier.pmid-42746605","target_kind":"node","target_sha256":"040c4b60c09b29a47fa956491c8e118956bc2f5fbb227fd4bd87e8c0aaba104e"}],"claim.frontier.pmid-42748079":[{"id":"assertion.claim.frontier.pmid-42748079","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748079","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748079 \"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise\" (CC BY, first published 2026-09-16) reports: \"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.\"","support":[{"end":5996,"quote":"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":5849},{"end":8563,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":8528},{"end":8317,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":8300}],"target_id":"claim.frontier.pmid-42748079","target_kind":"node","target_sha256":"89eefd1c1808ecb98a0cfef871fcf3d658df6af7c5e1fb12d2a8ea191e72d4b0"}],"claim.frontier.pmid-42748081":[{"id":"assertion.claim.frontier.pmid-42748081","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748081","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748081 \"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement\" (CC BY, first published 2026-09-16) reports: \"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.\"","support":[{"end":6428,"quote":"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":6184},{"end":8699,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":8664},{"end":8453,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":8436}],"target_id":"claim.frontier.pmid-42748081","target_kind":"node","target_sha256":"457d1c5a25df90822be75bd1bdf38cd9c2f33ab0803991ff931e5fefae5a4412"}],"claim.frontier.pmid-42748115":[{"id":"assertion.claim.frontier.pmid-42748115","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748115","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748115 \"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement\" (CC BY, first published 2026-09-16) reports: \"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.\"","support":[{"end":3598,"quote":"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":3220},{"end":6508,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":6473},{"end":6214,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":6197}],"target_id":"claim.frontier.pmid-42748115","target_kind":"node","target_sha256":"5038977c58094a9e5309c0770b14ab182cd05ed694958818d655acc004f124a4"}],"claim.frontier.pmid-42748135":[{"id":"assertion.claim.frontier.pmid-42748135","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748135","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748135 \"Bacterial stress responses lower mRNA-protein level correlations\" (CC BY, first published 2026-09-16) reports: \"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.\"","support":[{"end":6294,"quote":"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":6075},{"end":9942,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":9907},{"end":9633,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":9616}],"target_id":"claim.frontier.pmid-42748135","target_kind":"node","target_sha256":"935a1004e7e1a2096d593da1f91cb417e280df3418d74ae84f22158f9593d066"}],"claim.frontier.pmid-42748195":[{"id":"assertion.claim.frontier.pmid-42748195","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748195","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748195 \"Mathematical skills in deaf and hard-of-hearing children: A systematic review\" (CC BY, first published 2026-09-16) reports: \"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.\"","support":[{"end":7752,"quote":"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":7602},{"end":10078,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":10043},{"end":9784,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":9767}],"target_id":"claim.frontier.pmid-42748195","target_kind":"node","target_sha256":"866798ce0479ae591edeb8a4260ef72d8fba8c607b6fdcf23b4866c705a93007"}],"claim.frontier.pmid-42749366":[{"id":"assertion.claim.frontier.pmid-42749366","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42749366","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42749366 \"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study\" (CC BY, first published 2026-09-16) reports: \"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.\"","support":[{"end":3184,"quote":"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":3013},{"end":7949,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":7914},{"end":7703,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":7686}],"target_id":"claim.frontier.pmid-42749366","target_kind":"node","target_sha256":"2e813060129967780b60aa35ae49eafa586ebb444db9eccce56f358622667749"}],"claim.frontier.pmid-42749735":[{"id":"assertion.claim.frontier.pmid-42749735","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42749735","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42749735 \"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics\" (CC BY, first published 2026-08-19) reports: \"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.\"","support":[{"end":8445,"quote":"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":8285},{"end":13646,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":13611},{"end":13348,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":13331}],"target_id":"claim.frontier.pmid-42749735","target_kind":"node","target_sha256":"56c2baa881b7ed05248aa8a6477553857b00011c99b4aa60b626c2ffa43b0944"}],"claim.frontier.pmid-42750388":[{"id":"assertion.claim.frontier.pmid-42750388","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42750388","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42750388 \"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation\" (CC BY, first published 2026-09-16) reports: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","support":[{"end":5809,"quote":"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":5724},{"end":7662,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":7627},{"end":7400,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":7383}],"target_id":"claim.frontier.pmid-42750388","target_kind":"node","target_sha256":"e1b4e63ca29469bae96bde993048eb3fb7c5a0ed0eb1dc549c011417e7472874"}],"claim.frontier.pmid-42751534":[{"id":"assertion.claim.frontier.pmid-42751534","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42751534","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42751534 \"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement\" (CC BY, first published 2026-08-17) reports: \"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.\"","support":[{"end":3569,"quote":"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":3306},{"end":7378,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":7343},{"end":7132,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":7115}],"target_id":"claim.frontier.pmid-42751534","target_kind":"node","target_sha256":"b4a4071e995732a2c6e7a8e45c77588f1b2221ef426338fe5e814db435fee077"}],"claim.frontier.pmid-42752632":[{"id":"assertion.claim.frontier.pmid-42752632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42752632","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42752632 \"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital\" (CC BY, first published 2026-09-17) reports: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","support":[{"end":3673,"quote":"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":3465},{"end":5844,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":5809},{"end":5598,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":5581}],"target_id":"claim.frontier.pmid-42752632","target_kind":"node","target_sha256":"c468a4fa1be69840ae2e74bb1803727c97a98540019301829a57585016bbc799"}],"claim.frontier.pmid-42755230":[{"id":"assertion.claim.frontier.pmid-42755230","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755230","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755230 \"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges\" (CC BY, first published 2026-10-01) reports: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","support":[{"end":5688,"quote":"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":5475},{"end":7904,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":7869},{"end":7652,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":7635}],"target_id":"claim.frontier.pmid-42755230","target_kind":"node","target_sha256":"0dbc015a2e0816b528be91d9659f4cac632715c43417044bfd84e6d6e4e37ef4"}],"claim.frontier.pmid-42755626":[{"id":"assertion.claim.frontier.pmid-42755626","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755626","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755626 \"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study\" (CC BY, first published 2026-09-03) reports: \"These findings suggest that PFO diameter may be associated with WMH severity in young adults.\"","support":[{"end":5352,"quote":"These findings suggest that PFO diameter may be associated with WMH severity in young adults.","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":5259},{"end":8143,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":8108},{"end":7897,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":7880}],"target_id":"claim.frontier.pmid-42755626","target_kind":"node","target_sha256":"07622133a415b1ff2b27b3fe91cb14b5838d8ff4f0704253f897c23cfd92b23e"}],"claim.frontier.pmid-42755627":[{"id":"assertion.claim.frontier.pmid-42755627","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755627","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755627 \"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.\"","support":[{"end":3387,"quote":"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":3273},{"end":6272,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":6237},{"end":6026,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":6009}],"target_id":"claim.frontier.pmid-42755627","target_kind":"node","target_sha256":"ecbb2c5285f7f44d92071887dd798984c2a01d389fdbcf4b4836ebad4a1fda90"}],"claim.frontier.pmid-42755797":[{"id":"assertion.claim.frontier.pmid-42755797","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755797","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755797 \"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults\" (CC BY, first published 2026-09-03) reports: \"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.\"","support":[{"end":6866,"quote":"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":6735},{"end":8529,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":8494},{"end":8235,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":8218}],"target_id":"claim.frontier.pmid-42755797","target_kind":"node","target_sha256":"3286ec053e09ba901b8d143d41589f760d422c7cad2654534a34472b822856d8"}],"claim.frontier.pmid-42755864":[{"id":"assertion.claim.frontier.pmid-42755864","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755864","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755864 \"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity\" (CC BY, first published 2026-09-03) reports: \", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.\"","support":[{"end":4893,"quote":", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":4703},{"end":9175,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":9140},{"end":8929,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":8912}],"target_id":"claim.frontier.pmid-42755864","target_kind":"node","target_sha256":"271f04940a0bbb2eee5eb8ae53750acc8889ced52c97d07c3a5bded3f5af93f7"}],"claim.frontier.pmid-42756514":[{"id":"assertion.claim.frontier.pmid-42756514","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42756514","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42756514 \"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform\" (CC BY, first published 2026-09-03) reports: \"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).\"","support":[{"end":5956,"quote":"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":5752},{"end":8606,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":8571},{"end":8312,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":8295}],"target_id":"claim.frontier.pmid-42756514","target_kind":"node","target_sha256":"386eb5ca3ff1018f10f7b7d927fe53b5756ffced962a2879d7983b339dce4d37"}],"claim.frontier.pmid-42757005":[{"id":"assertion.claim.frontier.pmid-42757005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42757005","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42757005 \"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge\" (CC BY, first published 2026-09-17) reports: \"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.\"","support":[{"end":3207,"quote":"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":2932},{"end":4909,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":4874},{"end":4615,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":4598}],"target_id":"claim.frontier.pmid-42757005","target_kind":"node","target_sha256":"6420cf6ebab955bc8bbe835c9aa9f7e5feceac3a6c8affe6ebf045b7cef075a5"}],"claim.frontier.pmid-42757226":[{"id":"assertion.claim.frontier.pmid-42757226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42757226","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42757226 \"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls\" (CC BY, first published 2026-09-03) reports: \"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.\"","support":[{"end":3448,"quote":"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":3233},{"end":5070,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":5035},{"end":4824,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":4807}],"target_id":"claim.frontier.pmid-42757226","target_kind":"node","target_sha256":"3e9e0fc8147c85cbf19a0791eff850be6a4c966a682e60ee8074039c1822e61d"}],"claim.frontier.pmid-42758734":[{"id":"assertion.claim.frontier.pmid-42758734","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42758734","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42758734 \"A data-driven comparative analysis on citation intents across scientific disciplines\" (CC BY, first published 2026-09-18) reports: \"We found out that there are significant differences in all five characteristics across different research disciplines.\"","support":[{"end":2662,"quote":"We found out that there are significant differences in all five characteristics across different research disciplines.","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":2544},{"end":5166,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":5131},{"end":4920,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":4903}],"target_id":"claim.frontier.pmid-42758734","target_kind":"node","target_sha256":"17e6995fd8d523b1bcdcd30237e68fca8fcad65bba113b6f1f6e0f3999f6c735"}],"claim.frontier.pmid-42758776":[{"id":"assertion.claim.frontier.pmid-42758776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42758776","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42758776 \"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province\" (CC BY, first published 2026-09-18) reports: \"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.\"","support":[{"end":2876,"quote":"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":2642},{"end":4902,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":4867},{"end":4608,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":4591}],"target_id":"claim.frontier.pmid-42758776","target_kind":"node","target_sha256":"a7768885d9efa8f9dd57f72f93f9796d3eeef21b45bbbc00af7aa6d4cb3fc552"}],"claim.frontier.pmid-42760564":[{"id":"assertion.claim.frontier.pmid-42760564","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760564","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760564 \"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report\" (CC BY, first published 2026-09-18) reports: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","support":[{"end":3364,"quote":"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":3125},{"end":7131,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":7096},{"end":6885,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":6868}],"target_id":"claim.frontier.pmid-42760564","target_kind":"node","target_sha256":"ad31cdb2703184b78a8fa5bc5d25bdfccf46638d1cb9c0b5b7f3c28f1596855e"}],"claim.frontier.pmid-42760703":[{"id":"assertion.claim.frontier.pmid-42760703","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760703","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760703 \"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression\" (CC BY, first published 2026-09-01) reports: \"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.\"","support":[{"end":2852,"quote":"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":2606},{"end":6338,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":6303},{"end":6133,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":6116}],"target_id":"claim.frontier.pmid-42760703","target_kind":"node","target_sha256":"638f73f7f8de6d59ab6561ebf38708bbc0b894456310927dcbd222c2a63bc4eb"}],"claim.frontier.pmid-42760901":[{"id":"assertion.claim.frontier.pmid-42760901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760901","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760901 \"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand\" (CC BY, first published 2026-09-15) reports: \"Experience of discrimination was associated with higher depression scores.\"","support":[{"end":4952,"quote":"Experience of discrimination was associated with higher depression scores.","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":4878},{"end":8162,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":8127},{"end":7916,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":7899}],"target_id":"claim.frontier.pmid-42760901","target_kind":"node","target_sha256":"6c02f7d3ee4443b9691cb07904a2d61668a75e0dad7ee69e87f1cf6933301e48"}],"claim.frontier.pmid-42760912":[{"id":"assertion.claim.frontier.pmid-42760912","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760912","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760912 \"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations\" (CC BY, first published 2026-09-28) reports: \"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.\"","support":[{"end":5117,"quote":"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":4943},{"end":9003,"quote":"\"firstPublicationDate\":\"2026-09-28\"","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":8968},{"end":8709,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":8692}],"target_id":"claim.frontier.pmid-42760912","target_kind":"node","target_sha256":"8a5c892a956df62b8e6c44aeb8a074180057efa8407d4f621ab8ddcf375497a8"}],"claim.frontier.pmid-42761040":[{"id":"assertion.claim.frontier.pmid-42761040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761040","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761040 \"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil\" (CC BY, first published 2026-09-04) reports: \"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.\"","support":[{"end":7011,"quote":"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":6726},{"end":9814,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":9779},{"end":9568,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":9551}],"target_id":"claim.frontier.pmid-42761040","target_kind":"node","target_sha256":"b3530e7a53fe39b427de4144bf4b67e6931449e0ff14cd390575abd40009e46c"}],"claim.frontier.pmid-42761051":[{"id":"assertion.claim.frontier.pmid-42761051","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761051","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761051 \"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims\" (CC BY, first published 2026-09-04) reports: \"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.\"","support":[{"end":8240,"quote":"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":8076},{"end":9615,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":9580},{"end":9369,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":9352}],"target_id":"claim.frontier.pmid-42761051","target_kind":"node","target_sha256":"9f9dc4b7bdcf6dcae5de4004da3a2b7a91ab8f12a5d907c429de2d4931cfa8d7"}],"claim.frontier.pmid-42761220":[{"id":"assertion.claim.frontier.pmid-42761220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761220","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761220 \"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender\" (CC BY, first published 2026-09-04) reports: \"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.\"","support":[{"end":3880,"quote":"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":3728},{"end":5444,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":5409},{"end":5150,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":5133}],"target_id":"claim.frontier.pmid-42761220","target_kind":"node","target_sha256":"6e2024e749da6c6e4b77c277145e5dd66430e224627a15a361f1b39b454aed6f"}],"claim.frontier.pmid-42761607":[{"id":"assertion.claim.frontier.pmid-42761607","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761607","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761607 \"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia\" (CC BY, first published 2026-09-18) reports: \"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).\"","support":[{"end":3342,"quote":"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":3181},{"end":6023,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":5988},{"end":5729,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":5712}],"target_id":"claim.frontier.pmid-42761607","target_kind":"node","target_sha256":"56aa32129e24f7fa2b9d31c252779ba94e606898b8c1d3782e5c8ed5d74ed03c"}],"claim.frontier.pmid-42761991":[{"id":"assertion.claim.frontier.pmid-42761991","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761991","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761991 \"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report\" (CC BY, first published 2026-08-19) reports: \"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.\"","support":[{"end":2009,"quote":"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":1805},{"end":3868,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":3833},{"end":3574,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":3557}],"target_id":"claim.frontier.pmid-42761991","target_kind":"node","target_sha256":"b5ba381d0ddde131b0b116845d17db2132b18b418b0e60c8765798eb552f4b2b"}],"claim.frontier.pmid-42762163":[{"id":"assertion.claim.frontier.pmid-42762163","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42762163","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42762163 \"A network dynamical simulation model for the study of antibiotic resistance in microbial communities\" (CC BY, first published 2026-09-19) reports: \"Our results show that network structure strongly modulates resistance dynamics.\"","support":[{"end":4063,"quote":"Our results show that network structure strongly modulates resistance dynamics.","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":3984},{"end":6990,"quote":"\"firstPublicationDate\":\"2026-09-19\"","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":6955},{"end":6744,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":6727}],"target_id":"claim.frontier.pmid-42762163","target_kind":"node","target_sha256":"bf122e39205e8ed720ff00f11f1c2bdd6892eef40238342d603c97384cb2c78b"}],"claim.frontier.pmid-42763478":[{"id":"assertion.claim.frontier.pmid-42763478","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763478","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763478 \"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic\" (CC BY, first published 2026-09-18) reports: \"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.\"","support":[{"end":3224,"quote":"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":3006},{"end":5947,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":5912},{"end":5701,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":5684}],"target_id":"claim.frontier.pmid-42763478","target_kind":"node","target_sha256":"e34e906d4589e4d32dbf416b8994404415b186c089b33b0972491e3a0dc83460"}],"claim.frontier.pmid-42763558":[{"id":"assertion.claim.frontier.pmid-42763558","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763558","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763558 \"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center\" (CC BY, first published 2026-08-12) reports: \"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.\"","support":[{"end":2652,"quote":"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":2454},{"end":5717,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":5682},{"end":5471,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":5454}],"target_id":"claim.frontier.pmid-42763558","target_kind":"node","target_sha256":"103d90f877557544724d2b786f53fed4bb52150edab7e99043f0567f4231f6f0"}],"claim.frontier.pmid-42763617":[{"id":"assertion.claim.frontier.pmid-42763617","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763617","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763617 \"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult\" (CC BY, first published 2026-08-20) reports: \"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.\"","support":[{"end":3939,"quote":"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":3788},{"end":6117,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":6082},{"end":5871,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":5854}],"target_id":"claim.frontier.pmid-42763617","target_kind":"node","target_sha256":"8ae276aee04a0cf19b288c259147ceb5d1b8063f1ca1cf5e66a9982e0281f1a1"}],"claim.frontier.pmid-42764320":[{"id":"assertion.claim.frontier.pmid-42764320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764320","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764320 \"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned\" (CC BY, first published 2026-09-21) reports: \"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.\"","support":[{"end":5048,"quote":"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":4946},{"end":8086,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":8051},{"end":7840,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":7823}],"target_id":"claim.frontier.pmid-42764320","target_kind":"node","target_sha256":"93172fc364f76e46d471963b2452f6a38c5b0a1f94ee996941822f9fcfa95b42"}],"claim.frontier.pmid-42764822":[{"id":"assertion.claim.frontier.pmid-42764822","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764822","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764822 \"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations\" (CC BY, first published 2026-08-20) reports: \"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.\"","support":[{"end":4128,"quote":"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":3850},{"end":5839,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":5804},{"end":5593,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":5576}],"target_id":"claim.frontier.pmid-42764822","target_kind":"node","target_sha256":"1eae1f6fa20db095a99e1757843da8fc07d2c192ba07470bd1d645a24419d253"}],"claim.frontier.pmid-42764930":[{"id":"assertion.claim.frontier.pmid-42764930","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764930","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764930 \"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit\" (CC BY, first published 2026-08-21) reports: \"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).\"","support":[{"end":2674,"quote":"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":2486},{"end":5275,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":5240},{"end":4981,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":4964}],"target_id":"claim.frontier.pmid-42764930","target_kind":"node","target_sha256":"48fbdfbe3bf2fac12f6ece1dec03d0d9f6ab5f3fe77337748d05c3539d21ee07"}],"claim.frontier.pmid-42766546":[{"id":"assertion.claim.frontier.pmid-42766546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766546","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766546 \"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry\" (CC BY, first published 2026-09-21) reports: \"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).\"","support":[{"end":4211,"quote":"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":4039},{"end":7649,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":7614},{"end":7355,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":7338}],"target_id":"claim.frontier.pmid-42766546","target_kind":"node","target_sha256":"5d07402b6b63bb0e231349506c711d55b2ba35d8ed905fe97166c748ed61e48b"}],"claim.frontier.pmid-42766584":[{"id":"assertion.claim.frontier.pmid-42766584","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766584","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766584 \"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database\" (CC BY, first published 2026-09-21) reports: \"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.\"","support":[{"end":5733,"quote":"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":5566},{"end":8744,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":8709},{"end":8498,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":8481}],"target_id":"claim.frontier.pmid-42766584","target_kind":"node","target_sha256":"94583cc13a882a87938504ab634be12e7e9f751dd0c3c4fe0a8f2a534f8022db"}],"claim.frontier.pmid-42766622":[{"id":"assertion.claim.frontier.pmid-42766622","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766622","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766622 \"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model\" (CC BY, first published 2026-09-21) reports: \"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.\"","support":[{"end":2566,"quote":"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":2401},{"end":5344,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":5309},{"end":5098,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":5081}],"target_id":"claim.frontier.pmid-42766622","target_kind":"node","target_sha256":"38bdf578700de9cd024bb18eab2e72c7c5e9e483393d8d7de8fb4579a84be20e"}],"claim.frontier.pmid-42766660":[{"id":"assertion.claim.frontier.pmid-42766660","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766660","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766660 \"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart\" (CC BY, first published 2026-09-21) reports: \"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.\"","support":[{"end":5089,"quote":"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":4853},{"end":8754,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":8719},{"end":8460,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":8443}],"target_id":"claim.frontier.pmid-42766660","target_kind":"node","target_sha256":"7d90c252de7f8e22fa9014d0c2eb537bcfb8037347db13f5e7215d789ca05e75"}],"claim.frontier.pmid-42768354":[{"id":"assertion.claim.frontier.pmid-42768354","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768354","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768354 \"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency\" (CC BY, first published 2026-09-14) reports: \"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.\"","support":[{"end":5995,"quote":"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":5725},{"end":8405,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":8370},{"end":8159,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":8142}],"target_id":"claim.frontier.pmid-42768354","target_kind":"node","target_sha256":"511131e0cfb5869df054e2636ac7dfaaef1f5ede64215b55379f62cb77b554fc"}],"claim.frontier.pmid-42768386":[{"id":"assertion.claim.frontier.pmid-42768386","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768386","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768386 \"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations\" (CC BY, first published 2026-09-15) reports: \"Our analysis revealed variation in the gut resistome across population groups and countries.\"","support":[{"end":2780,"quote":"Our analysis revealed variation in the gut resistome across population groups and countries.","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":2688},{"end":5343,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":5308},{"end":5097,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":5080}],"target_id":"claim.frontier.pmid-42768386","target_kind":"node","target_sha256":"2fc3942a3e408a656b3a6aed3adcf43ecb4d31bcb3cd80f6ccd9994ff6e556bd"}],"claim.frontier.pmid-42768698":[{"id":"assertion.claim.frontier.pmid-42768698","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768698","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768698 \"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish\" (CC BY, first published 2026-09-01) reports: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","support":[{"end":4145,"quote":"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":3932},{"end":6693,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":6658},{"end":6488,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":6471}],"target_id":"claim.frontier.pmid-42768698","target_kind":"node","target_sha256":"d16f815221a9f8f9955bc3064cb052814b4576afbef8ec09cf7e2d7259cde90b"}],"claim.frontier.pmid-42769130":[{"id":"assertion.claim.frontier.pmid-42769130","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42769130","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42769130 \"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis\" (CC BY, first published 2026-09-07) reports: \"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.\"","support":[{"end":4486,"quote":"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":4310},{"end":6319,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":6284},{"end":6073,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":6056}],"target_id":"claim.frontier.pmid-42769130","target_kind":"node","target_sha256":"560b996eb2c8d1c2d6925713fe4d93a89605ee3e95cee5fdffb114697c7cad8f"}],"claim.frontier.pmid-42769220":[{"id":"assertion.claim.frontier.pmid-42769220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42769220","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42769220 \"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD\" (CC BY, first published 2026-09-07) reports: \"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.\"","support":[{"end":7096,"quote":"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":6981},{"end":8869,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":8834},{"end":8623,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":8606}],"target_id":"claim.frontier.pmid-42769220","target_kind":"node","target_sha256":"8f786db61c9a61bc1b6494764fa3bb3e2b65649ece729dbce4efe50248d4171c"}],"claim.frontier.pmid-42773366":[{"id":"assertion.claim.frontier.pmid-42773366","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42773366","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42773366 \"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)\" (CC BY, first published 2026-09-23) reports: \"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).\"","support":[{"end":5727,"quote":"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":5623},{"end":9426,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":9391},{"end":9180,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":9163}],"target_id":"claim.frontier.pmid-42773366","target_kind":"node","target_sha256":"86297ab4334c2016726a388e55888e23cc24efbb35730f5f8d1b5dac42a16d16"}],"claim.frontier.pmid-42775227":[{"id":"assertion.claim.frontier.pmid-42775227","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42775227","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42775227 \"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions\" (CC BY, first published 2026-09-08) reports: \"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.\"","support":[{"end":2705,"quote":"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":2417},{"end":4974,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":4939},{"end":4728,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":4711}],"target_id":"claim.frontier.pmid-42775227","target_kind":"node","target_sha256":"875b55614ce3b1cc013df0876b1fdf2eb9ead0d6be2af2f5c3724fde3743c2a1"}],"claim.frontier.pmid-42776569":[{"id":"assertion.claim.frontier.pmid-42776569","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42776569","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42776569 \"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>\" (CC BY, first published 2026-09-01) reports: \"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.\"","support":[{"end":4122,"quote":"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":3959},{"end":7302,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":7267},{"end":7097,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":7080}],"target_id":"claim.frontier.pmid-42776569","target_kind":"node","target_sha256":"5e9bd15f7986cdf1d179e8236101e374642c017396cca740094f6836bc2fa97a"}],"claim.frontier.pmid-42777016":[{"id":"assertion.claim.frontier.pmid-42777016","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42777016","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42777016 \"Deterministic dynamics of distributional multi-agent reinforcement learning\" (CC BY, first published 2026-09-23) reports: \"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.\"","support":[{"end":3237,"quote":"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":3124},{"end":6137,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":6102},{"end":5891,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":5874}],"target_id":"claim.frontier.pmid-42777016","target_kind":"node","target_sha256":"18005dc6614749cedf971a21f41139ad28c6367fb2c3a6c1ebedcedccb99225e"}],"claim.frontier.pmid-42778332":[{"id":"assertion.claim.frontier.pmid-42778332","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778332","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778332 \"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual\" (CC BY, first published 2026-09-23) reports: \"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.\"","support":[{"end":4105,"quote":"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":3887},{"end":7195,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":7160},{"end":6949,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":6932}],"target_id":"claim.frontier.pmid-42778332","target_kind":"node","target_sha256":"7856b2d851f599958901ce42a11146477f7cee917537188f36b16eeb41a80e7e"}],"claim.frontier.pmid-42778576":[{"id":"assertion.claim.frontier.pmid-42778576","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778576","quantifiers":"Only what the quoted sentence states","time":"2026-08-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778576 \"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables\" (CC BY, first published 2026-08-22) reports: \"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.\"","support":[{"end":2176,"quote":"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":2003},{"end":5284,"quote":"\"firstPublicationDate\":\"2026-08-22\"","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":5249},{"end":4990,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":4973}],"target_id":"claim.frontier.pmid-42778576","target_kind":"node","target_sha256":"6d90a47fec2c97d443d6f6e22dfe11947613df8cb703f425b799f6f6957d4f0a"}],"claim.frontier.pmid-42778666":[{"id":"assertion.claim.frontier.pmid-42778666","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778666","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778666 \"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils\" (CC BY, first published 2026-09-23) reports: \"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.\"","support":[{"end":4745,"quote":"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":4604},{"end":7408,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":7373},{"end":7114,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":7097}],"target_id":"claim.frontier.pmid-42778666","target_kind":"node","target_sha256":"75b23dfb58f9613ccf2866bfed9e16f7cff1f68c45f63c1803cb89a52563f18b"}],"claim.frontier.pmid-42780909":[{"id":"assertion.claim.frontier.pmid-42780909","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42780909","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42780909 \"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes\" (CC BY, first published 2026-09-09) reports: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","support":[{"end":4951,"quote":"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":4660},{"end":7885,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":7850},{"end":7591,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":7574}],"target_id":"claim.frontier.pmid-42780909","target_kind":"node","target_sha256":"a922344b9decc15b2452871095e11c27995b8dfec6ab986dd1ef2eb3fcfcb32f"}],"claim.frontier.pmid-42780961":[{"id":"assertion.claim.frontier.pmid-42780961","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42780961","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42780961 \"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives\" (CC BY, first published 2026-09-09) reports: \"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.\"","support":[{"end":4684,"quote":"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":4474},{"end":6423,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":6388},{"end":6129,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":6112}],"target_id":"claim.frontier.pmid-42780961","target_kind":"node","target_sha256":"26cd411f87e038e94c33206749e7f8620e1d9c7a23a5a74d0ebbb5b6764a377e"}],"claim.frontier.pmid-42781208":[{"id":"assertion.claim.frontier.pmid-42781208","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781208","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781208 \"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients\" (CC BY, first published 2026-08-24) reports: \"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.\"","support":[{"end":2826,"quote":"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":2634},{"end":4570,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":4535},{"end":4324,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":4307}],"target_id":"claim.frontier.pmid-42781208","target_kind":"node","target_sha256":"7f9ca90b2d53ac3cf6549f56d9197c82bf11367d8fe5c996acb2c28bfdde4dfe"}],"claim.frontier.pmid-42781598":[{"id":"assertion.claim.frontier.pmid-42781598","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781598","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781598 \"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report\" (CC BY, first published 2026-08-24) reports: \"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.\"","support":[{"end":2730,"quote":"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":2576},{"end":6037,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":6002},{"end":5743,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":5726}],"target_id":"claim.frontier.pmid-42781598","target_kind":"node","target_sha256":"80f140584aee1955c692a949f7573e397ef512df6ec6952c15478e83f8884fd0"}],"claim.frontier.pmid-42781606":[{"id":"assertion.claim.frontier.pmid-42781606","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781606","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781606 \"From Distraction to Delay: Unpacking Academic Procrastination\" (CC BY, first published 2026-08-28) reports: \"These findings highlight the combined role of personal and cognitive factors in academic procrastination.\"","support":[{"end":3127,"quote":"These findings highlight the combined role of personal and cognitive factors in academic procrastination.","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":3022},{"end":4755,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":4720},{"end":4461,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":4444}],"target_id":"claim.frontier.pmid-42781606","target_kind":"node","target_sha256":"9645e4eff4e196a2374ab4c0da701b9af86a2c42069b38dbdba414f583d9928f"}],"claim.frontier.pmid-42782937":[{"id":"assertion.claim.frontier.pmid-42782937","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42782937","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42782937 \"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing\" (CC BY, first published 2026-09-01) reports: \"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.\"","support":[{"end":4840,"quote":"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":4662},{"end":6638,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":6603},{"end":6392,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":6375}],"target_id":"claim.frontier.pmid-42782937","target_kind":"node","target_sha256":"6c61e750208a558dd0f7f9ccc00c6c0dfe8bd2cf27aff7ca1d5cdb321fb063de"}],"claim.frontier.pmid-42783218":[{"id":"assertion.claim.frontier.pmid-42783218","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42783218","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42783218 \"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study\" (CC BY, first published 2026-09-05) reports: \": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.\"","support":[{"end":3322,"quote":": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":3168},{"end":4924,"quote":"\"firstPublicationDate\":\"2026-09-05\"","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":4889},{"end":4678,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":4661}],"target_id":"claim.frontier.pmid-42783218","target_kind":"node","target_sha256":"3e4ecf846702399e377cdd5f3fd3462784080c8f451c88096784b77876c2f34a"}],"claim.frontier.pmid-42784269":[{"id":"assertion.claim.frontier.pmid-42784269","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784269","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784269 \"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions\" (CC BY, first published 2026-09-11) reports: \"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.\"","support":[{"end":5903,"quote":"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":5618},{"end":10257,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":10222},{"end":10011,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":9994}],"target_id":"claim.frontier.pmid-42784269","target_kind":"node","target_sha256":"9e26b5208db041f9f2c4cb289141916557a2141813f10f25c3eec635f6718f52"}],"claim.frontier.pmid-42784570":[{"id":"assertion.claim.frontier.pmid-42784570","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784570","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784570 \"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia\" (CC BY, first published 2026-09-24) reports: \"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.\"","support":[{"end":3746,"quote":"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":3523},{"end":4970,"quote":"\"firstPublicationDate\":\"2026-09-24\"","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":4935},{"end":4724,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":4707}],"target_id":"claim.frontier.pmid-42784570","target_kind":"node","target_sha256":"f9bd7be52f579657c9af38ab494577931f5b0ecb89e7c026127a3982a1572b6b"}],"claim.frontier.pmid-42784649":[{"id":"assertion.claim.frontier.pmid-42784649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784649","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784649 \"Negative emotions concentrate while positive emotions diffuse in football fan rivalries\" (CC BY, first published 2026-09-24) reports: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","support":[{"end":2955,"quote":"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":2778},{"end":4560,"quote":"\"firstPublicationDate\":\"2026-09-24\"","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":4525},{"end":4314,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":4297}],"target_id":"claim.frontier.pmid-42784649","target_kind":"node","target_sha256":"bc3d8f87cca3c82b1784bc888c0ffd9d0fe2a411898b6c1324ebb5857f74dc72"}],"claim.frontier.pmid-42786167":[{"id":"assertion.claim.frontier.pmid-42786167","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42786167","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42786167 \"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures\" (CC BY, first published 2026-08-26) reports: \"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.\"","support":[{"end":8513,"quote":"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":8266},{"end":12121,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":12086},{"end":11811,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":11794}],"target_id":"claim.frontier.pmid-42786167","target_kind":"node","target_sha256":"8789568b14767e7b7247f1f35a858df0046d5cb492883ac41c5fb65f5c523902"}],"claim.frontier.pmid-42788599":[{"id":"assertion.claim.frontier.pmid-42788599","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42788599","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42788599 \"Septic arthritis caused by Nocardia asiatica: a case report and narrative review\" (CC BY, first published 2026-09-18) reports: \"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.\"","support":[{"end":1681,"quote":"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":1519},{"end":4920,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":4885},{"end":4674,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":4657}],"target_id":"claim.frontier.pmid-42788599","target_kind":"node","target_sha256":"3d4479c4e8ff5d0aefb6b7f2d01a16d5f70984729e70be52dfbfbe96dd355680"}],"claim.frontier.pmid-42789505":[{"id":"assertion.claim.frontier.pmid-42789505","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42789505","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42789505 \"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system\" (CC BY, first published 2026-09-25) reports: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","support":[{"end":4227,"quote":"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":4007},{"end":7052,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":7017},{"end":6806,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":6789}],"target_id":"claim.frontier.pmid-42789505","target_kind":"node","target_sha256":"15845e75aa7b54e679b79e1dcc8d74987c056a1cf81aee32a728f7bbb984a85e"}],"claim.frontier.pmid-42789524":[{"id":"assertion.claim.frontier.pmid-42789524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42789524","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42789524 \"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study\" (CC BY, first published 2026-09-25) reports: \"Problem-focused and emotion-focused coping strategies were associated with better QoL.\"","support":[{"end":2596,"quote":"Problem-focused and emotion-focused coping strategies were associated with better QoL.","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":2510},{"end":6434,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":6399},{"end":6188,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":6171}],"target_id":"claim.frontier.pmid-42789524","target_kind":"node","target_sha256":"52589004a59b47135df7d96875da52a16f7508df6507a39df8acd7d50f6d2728"}],"claim.frontier.pmid-42791331":[{"id":"assertion.claim.frontier.pmid-42791331","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42791331","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42791331 \"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort\" (CC BY, first published 2026-09-25) reports: \"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.\"","support":[{"end":4649,"quote":"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":4504},{"end":7092,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":7057},{"end":6846,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":6829}],"target_id":"claim.frontier.pmid-42791331","target_kind":"node","target_sha256":"3b2a5bc8bb9fc122d069d502853f8e9941271793aafb3c8631c3fc00448dbe14"}],"claim.frontier.pmid-42791987":[{"id":"assertion.claim.frontier.pmid-42791987","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42791987","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42791987 \"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients\" (CC BY, first published 2026-08-29) reports: \"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.\"","support":[{"end":3412,"quote":"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":3150},{"end":6130,"quote":"\"firstPublicationDate\":\"2026-08-29\"","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":6095},{"end":5836,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":5819}],"target_id":"claim.frontier.pmid-42791987","target_kind":"node","target_sha256":"1cc1334be3a0116a3573d9601fe1ed6ceba75b15d19fe127555eeb0d5d2413fd"}],"claim.frontier.pmid-42792025":[{"id":"assertion.claim.frontier.pmid-42792025","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792025","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792025 \"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens\" (CC BY, first published 2026-09-07) reports: \": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.\"","support":[{"end":8331,"quote":": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":8042},{"end":10201,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":10166},{"end":9907,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":9890}],"target_id":"claim.frontier.pmid-42792025","target_kind":"node","target_sha256":"44c12dc7e8e0501bce8efea810856c0019bcc8a4ab49931bc73ff883df0e8643"}],"claim.frontier.pmid-42792321":[{"id":"assertion.claim.frontier.pmid-42792321","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792321","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792321 \"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior\" (CC BY, first published 2026-08-28) reports: \"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.\"","support":[{"end":2898,"quote":"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":2579},{"end":5633,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":5598},{"end":5387,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":5370}],"target_id":"claim.frontier.pmid-42792321","target_kind":"node","target_sha256":"7d26809e0ef742234566bd7cca38f7ae113df27e21723fdaac340ec354aa85e7"}],"claim.frontier.pmid-42792412":[{"id":"assertion.claim.frontier.pmid-42792412","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792412","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792412 \"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students\" (CC BY, first published 2026-09-09) reports: \"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.\"","support":[{"end":4047,"quote":"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":3822},{"end":5722,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":5687},{"end":5476,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":5459}],"target_id":"claim.frontier.pmid-42792412","target_kind":"node","target_sha256":"1c8179c74b627ff1629ab2a0a74ce7255dd4bde215f5d7c49aa022d293db8cca"}],"claim.frontier.pmid-42792502":[{"id":"assertion.claim.frontier.pmid-42792502","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792502","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792502 \"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students\" (CC BY, first published 2026-09-21) reports: \"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).\"","support":[{"end":2350,"quote":"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":2151},{"end":4553,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":4518},{"end":4259,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":4242}],"target_id":"claim.frontier.pmid-42792502","target_kind":"node","target_sha256":"110dbb052f436b65e06b0ba3935796cf97fed682cefdcfc1c6d2c9070ab3f101"}],"claim.frontier.pmid-42793476":[{"id":"assertion.claim.frontier.pmid-42793476","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42793476","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42793476 \"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study\" (CC BY, first published 2026-09-10) reports: \"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.\"","support":[{"end":4054,"quote":"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":3729},{"end":5705,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":5670},{"end":5459,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":5442}],"target_id":"claim.frontier.pmid-42793476","target_kind":"node","target_sha256":"5b215f8f8a18ca204ce48a5f50b201d575868953e931a29243c403216e4839f3"}],"claim.frontier.pmid-42794013":[{"id":"assertion.claim.frontier.pmid-42794013","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794013","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794013 \"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review\" (CC BY, first published 2026-09-12) reports: \"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.\"","support":[{"end":4520,"quote":"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":4272},{"end":6188,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":6153},{"end":5942,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":5925}],"target_id":"claim.frontier.pmid-42794013","target_kind":"node","target_sha256":"80e3f4a07f7d28ca78b72bc4131f69916a8c511063cf7f5e54d7432e791d60b4"}],"claim.frontier.pmid-42794146":[{"id":"assertion.claim.frontier.pmid-42794146","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794146","quantifiers":"Only what the quoted sentence states","time":"2026-08-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794146 \"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor\" (CC BY, first published 2026-08-23) reports: \": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.\"","support":[{"end":4192,"quote":": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":3995},{"end":7205,"quote":"\"firstPublicationDate\":\"2026-08-23\"","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":7170},{"end":6959,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":6942}],"target_id":"claim.frontier.pmid-42794146","target_kind":"node","target_sha256":"321e8ea6feb2db1df6faff25168b8783ffa281779cc3a6a4e1571d29ad17e531"}],"claim.frontier.pmid-42794677":[{"id":"assertion.claim.frontier.pmid-42794677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794677","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794677 \"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling\" (CC BY, first published 2026-09-16) reports: \"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.\"","support":[{"end":4387,"quote":"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":4194},{"end":8682,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":8647},{"end":8388,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":8371}],"target_id":"claim.frontier.pmid-42794677","target_kind":"node","target_sha256":"80cf075f5a95d02eab8fdfee025710d00178e68b62852637b7475c822ad66708"}],"claim.frontier.pmid-42794852":[{"id":"assertion.claim.frontier.pmid-42794852","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794852","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794852 \"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology\" (CC BY, first published 2026-09-21) reports: \"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.\"","support":[{"end":2833,"quote":"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":2700},{"end":7239,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":7204},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":6928}],"target_id":"claim.frontier.pmid-42794852","target_kind":"node","target_sha256":"38e0ab7090717e65b5719f362dd279cee5f15d3e9fac27c8d4c424908730bbe6"}],"claim.frontier.pmid-42795560":[{"id":"assertion.claim.frontier.pmid-42795560","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795560","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795560 \"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study\" (CC BY, first published 2026-09-08) reports: \"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).\"","support":[{"end":6270,"quote":"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":6038},{"end":8137,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":8102},{"end":7843,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":7826}],"target_id":"claim.frontier.pmid-42795560","target_kind":"node","target_sha256":"d196f82f6d514cb255365c3832b905eee167485d0482f045a42929590cd39333"}],"claim.frontier.pmid-42795646":[{"id":"assertion.claim.frontier.pmid-42795646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795646","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795646 \"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes\" (CC BY, first published 2026-09-16) reports: \"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.\"","support":[{"end":3910,"quote":"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":3783},{"end":5559,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":5524},{"end":5313,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":5296}],"target_id":"claim.frontier.pmid-42795646","target_kind":"node","target_sha256":"97e66b6445d72b236dfcad0e483dba8b0f191aaa99546a9263dbc8211c51923d"}],"claim.frontier.pmid-42795904":[{"id":"assertion.claim.frontier.pmid-42795904","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795904","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795904 \"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer\" (CC BY, first published 2026-09-14) reports: \"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.\"","support":[{"end":4340,"quote":"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":4123},{"end":6398,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":6363},{"end":6076,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":6059}],"target_id":"claim.frontier.pmid-42795904","target_kind":"node","target_sha256":"160414011ac188e4a8db894a437906c57994d1b981f168c1448dd7f3ec9d71b7"}],"claim.frontier.pmid-42795945":[{"id":"assertion.claim.frontier.pmid-42795945","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795945","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795945 \"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study\" (CC BY, first published 2026-09-15) reports: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","support":[{"end":3699,"quote":": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":3487},{"end":7229,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":7194},{"end":6935,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":6918}],"target_id":"claim.frontier.pmid-42795945","target_kind":"node","target_sha256":"8d0392e293f252f02590dbacbb38fc3bc3637f823cc4912aa040cadbe2ddd648"}],"claim.frontier.pmid-42795965":[{"id":"assertion.claim.frontier.pmid-42795965","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795965","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795965 \"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study\" (CC BY, first published 2026-09-16) reports: \"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.\"","support":[{"end":7413,"quote":"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":7262},{"end":9098,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":9063},{"end":8804,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":8787}],"target_id":"claim.frontier.pmid-42795965","target_kind":"node","target_sha256":"413c17fe9b3b12a945a1debf5a06fce461669ffce31f9188fac163d56ca6ca77"}],"claim.frontier.pmid-42796013":[{"id":"assertion.claim.frontier.pmid-42796013","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796013","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796013 \"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study\" (CC BY, first published 2026-09-17) reports: \": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.\"","support":[{"end":9598,"quote":": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":9345},{"end":11011,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":10976},{"end":10717,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":10700}],"target_id":"claim.frontier.pmid-42796013","target_kind":"node","target_sha256":"0bd4d8704511cb91e011a8069f1527b8248256f9675a0fac217a30b0e8ddac4c"}],"claim.frontier.pmid-42796055":[{"id":"assertion.claim.frontier.pmid-42796055","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796055","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796055 \"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention\" (CC BY, first published 2026-09-19) reports: \"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.\"","support":[{"end":4807,"quote":"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":4603},{"end":8189,"quote":"\"firstPublicationDate\":\"2026-09-19\"","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":8154},{"end":7943,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":7926}],"target_id":"claim.frontier.pmid-42796055","target_kind":"node","target_sha256":"25baec8bc78d2ac1a188cad2d55d01c72f46a5bf1cc645bd6ad827f329157748"}],"claim.frontier.pmid-42796271":[{"id":"assertion.claim.frontier.pmid-42796271","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796271","quantifiers":"Only what the quoted sentence states","time":"2026-08-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796271 \"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review\" (CC BY, first published 2026-08-30) reports: \"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.\"","support":[{"end":4805,"quote":"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":4523},{"end":9439,"quote":"\"firstPublicationDate\":\"2026-08-30\"","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":9404},{"end":9145,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":9128}],"target_id":"claim.frontier.pmid-42796271","target_kind":"node","target_sha256":"57c45b4633893feee7845804f202e48e0a5d5bf1885abb4a7289ec13ead34842"}],"claim.frontier.pmid-42796692":[{"id":"assertion.claim.frontier.pmid-42796692","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796692","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796692 \"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines\" (CC BY, first published 2026-09-02) reports: \"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.\"","support":[{"end":1922,"quote":"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":1835},{"end":6798,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":6763},{"end":6504,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":6487}],"target_id":"claim.frontier.pmid-42796692","target_kind":"node","target_sha256":"b40c4f506b182b460b64d80fbb7257e61fb48b96f1ed7715999b0dd29f979a76"}],"claim.frontier.pmid-42796834":[{"id":"assertion.claim.frontier.pmid-42796834","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796834","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796834 \"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling\" (CC BY, first published 2026-09-12) reports: \"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.\"","support":[{"end":4228,"quote":"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":3948},{"end":6734,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":6699},{"end":6440,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":6423}],"target_id":"claim.frontier.pmid-42796834","target_kind":"node","target_sha256":"f1e61554a931f073853bc966422fa5fa076e0a91792e38275cf4dc2ae6acf98a"}],"claim.frontier.pmid-42797642":[{"id":"assertion.claim.frontier.pmid-42797642","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42797642","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42797642 \"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?\" (CC BY, first published 2026-09-18) reports: \": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.\"","support":[{"end":4652,"quote":": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":4237},{"end":6022,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":5987},{"end":5776,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":5759}],"target_id":"claim.frontier.pmid-42797642","target_kind":"node","target_sha256":"84d2079b4d9be7a3813d3aa992e844238b8841d7559827e3d4a028883dd61773"}],"claim.frontier.pmid-42798110":[{"id":"assertion.claim.frontier.pmid-42798110","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798110","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798110 \"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery\" (CC BY, first published 2026-09-01) reports: \"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.\"","support":[{"end":4058,"quote":"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":3960},{"end":6298,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":6263},{"end":6093,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":6076}],"target_id":"claim.frontier.pmid-42798110","target_kind":"node","target_sha256":"1ac6a92f2eec7f9d1f971e8de49a9aaecbd3177fe1dffaa19126455e9e7f37f8"}],"claim.frontier.pmid-42798137":[{"id":"assertion.claim.frontier.pmid-42798137","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798137","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798137 \"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest\" (CC BY, first published 2026-09-01) reports: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","support":[{"end":4392,"quote":"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":4098},{"end":7085,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":7050},{"end":6821,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":6804}],"target_id":"claim.frontier.pmid-42798137","target_kind":"node","target_sha256":"1cddafad339cf44d3b12f13c96eb892364883ac4586373f356f933a18ce6ad8a"}],"claim.frontier.pmid-42798632":[{"id":"assertion.claim.frontier.pmid-42798632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798632","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798632 \"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients\" (CC BY, first published 2026-09-11) reports: \"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.\"","support":[{"end":7699,"quote":"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":7538},{"end":9372,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":9337},{"end":9126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":9109}],"target_id":"claim.frontier.pmid-42798632","target_kind":"node","target_sha256":"f48d5b985c3a81e267e22f634fffccbb52a67f5f7750efa0c8ebc39f50c2800c"}],"claim.frontier.pmid-42798637":[{"id":"assertion.claim.frontier.pmid-42798637","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798637","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798637 \"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone\" (CC BY, first published 2026-09-11) reports: \"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.\"","support":[{"end":4830,"quote":"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":4586},{"end":8242,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":8207},{"end":7996,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":7979}],"target_id":"claim.frontier.pmid-42798637","target_kind":"node","target_sha256":"1ecf65ae30ff562b30d25821bc1f4b352f87d2eeb6e9ab4a9a6e4a47e0294d0c"}],"claim.frontier.pmid-42798644":[{"id":"assertion.claim.frontier.pmid-42798644","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798644","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798644 \"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review\" (CC BY, first published 2026-09-11) reports: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","support":[{"end":3371,"quote":"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":3193},{"end":4766,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":4731},{"end":4520,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":4503}],"target_id":"claim.frontier.pmid-42798644","target_kind":"node","target_sha256":"a881e2dd158a497c4ab73ab6dcf117f664e7e1f18b4591e357fb331aabfd6f74"}],"claim.frontier.pmid-42798677":[{"id":"assertion.claim.frontier.pmid-42798677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798677","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798677 \"Arts participation and mental health: evidence from the Chinese general social survey\" (CC BY, first published 2026-09-11) reports: \"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.\"","support":[{"end":2201,"quote":"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":1963},{"end":4173,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":4138},{"end":3927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":3910}],"target_id":"claim.frontier.pmid-42798677","target_kind":"node","target_sha256":"908bac5c74b417267ced6974f10a97f734bdec053b9da7aac7eaa7814bea6e28"}],"claim.frontier.pmid-42799291":[{"id":"assertion.claim.frontier.pmid-42799291","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799291","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799291 \"A review on clinical cases of rare mold infections and their antifungal treatment strategies\" (CC BY, first published 2026-09-11) reports: \"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.\"","support":[{"end":3650,"quote":"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":3471},{"end":6068,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":6033},{"end":5822,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":5805}],"target_id":"claim.frontier.pmid-42799291","target_kind":"node","target_sha256":"84dcf6802f43ecca9e650c3daa34679b74a4c59a19b8a21856e0d57a5889cc4b"}],"claim.frontier.pmid-42799489":[{"id":"assertion.claim.frontier.pmid-42799489","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799489","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799489 \"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review\" (CC BY, first published 2026-09-25) reports: \"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.\"","support":[{"end":4814,"quote":"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":4616},{"end":6366,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":6331},{"end":6120,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":6103}],"target_id":"claim.frontier.pmid-42799489","target_kind":"node","target_sha256":"a339627a20c8e4d51a6dd51da606e4646b7785107d49ffcc2f5010f93e391a15"}],"claim.frontier.pmid-42799507":[{"id":"assertion.claim.frontier.pmid-42799507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799507","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799507 \"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays\" (CC BY, first published 2026-08-26) reports: \"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.\"","support":[{"end":2054,"quote":"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":1759},{"end":4579,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":4544},{"end":4333,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":4316}],"target_id":"claim.frontier.pmid-42799507","target_kind":"node","target_sha256":"a675bc3908e986f4c1ddf3f6fb147ec0d7fa5312fdfd07b9dfc81f43e8ce6c04"}],"claim.frontier.pmid-42802368":[{"id":"assertion.claim.frontier.pmid-42802368","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42802368","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42802368 \"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany\" (CC BY, first published 2026-09-01) reports: \"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.\"","support":[{"end":4377,"quote":"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":4211},{"end":7909,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":7874},{"end":7656,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":7639}],"target_id":"claim.frontier.pmid-42802368","target_kind":"node","target_sha256":"55bd5e132de6231d972cbfec108822dc2424f8ff76a3a75ebba0aaa8c1c2b8bb"}],"claim.frontier.pmid-42803191":[{"id":"assertion.claim.frontier.pmid-42803191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42803191","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42803191 \"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly\" (CC BY, first published 2026-09-01) reports: \"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.\"","support":[{"end":5086,"quote":"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":4818},{"end":7905,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":7870},{"end":7632,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":7615}],"target_id":"claim.frontier.pmid-42803191","target_kind":"node","target_sha256":"87db77cb1e7e772a0ff96b90c6b12a858076503615359552c2aec4d487d13f2f"}],"claim.frontier.pmid-42806242":[{"id":"assertion.claim.frontier.pmid-42806242","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42806242","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42806242 \"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback\" (CC BY, first published 2026-10-01) reports: \"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.\"","support":[{"end":7331,"quote":"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":7136},{"end":10361,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":10326},{"end":10083,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":10066}],"target_id":"claim.frontier.pmid-42806242","target_kind":"node","target_sha256":"463a630e59c16c7d7a3366c3a43a17c1264e96bc188f5422a573e57c81d8a2ba"}],"claim.frontier.pmid-42806681":[{"id":"assertion.claim.frontier.pmid-42806681","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42806681","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42806681 \"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients\" (CC BY, first published 2026-10-01) reports: \"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].\"","support":[{"end":6635,"quote":"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":6379},{"end":10769,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":10734},{"end":10516,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":10499}],"target_id":"claim.frontier.pmid-42806681","target_kind":"node","target_sha256":"9a53b0df481173d0f84fc75acfa20739cd9f66f237d1903ffe408db633a10454"}],"claim.frontier.pmid-42807094":[{"id":"assertion.claim.frontier.pmid-42807094","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42807094","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42807094 \"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases\" (CC BY, first published 2026-09-14) reports: \"Our findings highlight an association between alcohol consumption and low BMD.\"","support":[{"end":4453,"quote":"Our findings highlight an association between alcohol consumption and low BMD.","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":4375},{"end":5991,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":5956},{"end":5745,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":5728}],"target_id":"claim.frontier.pmid-42807094","target_kind":"node","target_sha256":"d31c8c4608643d257a5e86a09802e4bb492e2a6d99084474fd3963512f9118a8"}],"claim.frontier.pmid-42807220":[{"id":"assertion.claim.frontier.pmid-42807220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42807220","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42807220 \"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review\" (CC BY, first published 2026-09-14) reports: \"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.\"","support":[{"end":5476,"quote":"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":5216},{"end":7664,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":7629},{"end":7418,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":7401}],"target_id":"claim.frontier.pmid-42807220","target_kind":"node","target_sha256":"9a1e4b00b5a750beffc068d085b34dd2170ee6ead925197bbeeb9697be44ef43"}],"claim.frontier.pmid-42809586":[{"id":"assertion.claim.frontier.pmid-42809586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42809586","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42809586 \"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling\" (CC BY, first published 2026-10-01) reports: \"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.\"","support":[{"end":6184,"quote":"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":5891},{"end":9793,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":9758},{"end":9540,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":9523}],"target_id":"claim.frontier.pmid-42809586","target_kind":"node","target_sha256":"3c2da6aec3fce0e022be79c4236a713e2d791b47c83c94615ba92776b5b00b8f"}],"claim.frontier.pmid-42811130":[{"id":"assertion.claim.frontier.pmid-42811130","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42811130","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42811130 \"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids\" (CC BY, first published 2026-09-29) reports: \"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.\"","support":[{"end":13170,"quote":"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":13000},{"end":16615,"quote":"\"firstPublicationDate\":\"2026-09-29\"","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":16580},{"end":16305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":16288}],"target_id":"claim.frontier.pmid-42811130","target_kind":"node","target_sha256":"680f9d4a94d692036b817d2f72aa608aad81231e71401fa26def512360b87790"}],"claim.frontier.pmid-42811346":[{"id":"assertion.claim.frontier.pmid-42811346","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42811346","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42811346 \"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis\" (CC BY, first published 2026-09-29) reports: \"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.\"","support":[{"end":4425,"quote":"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":4257},{"end":5969,"quote":"\"firstPublicationDate\":\"2026-09-29\"","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":5934},{"end":5723,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":5706}],"target_id":"claim.frontier.pmid-42811346","target_kind":"node","target_sha256":"ba745cae07f12fbc2b6364683176fa6fd70c2787ef9f7fba42f40ada8ddf4f4d"}],"claim.frontier.pmid-42812171":[{"id":"assertion.claim.frontier.pmid-42812171","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42812171","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42812171 \"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report\" (CC BY, first published 2026-09-15) reports: \"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.\"","support":[{"end":2281,"quote":"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":2199},{"end":4577,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":4542},{"end":4283,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":4266}],"target_id":"claim.frontier.pmid-42812171","target_kind":"node","target_sha256":"bfb26bb52e835a3c326b8beacbceea05f6d9580412a760f697e8989c3ba03d37"}],"claim.frontier.pmid-42813109":[{"id":"assertion.claim.frontier.pmid-42813109","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42813109","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42813109 \"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis\" (CC BY, first published 2026-09-17) reports: \"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.\"","support":[{"end":3182,"quote":"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":3016},{"end":5077,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":5042},{"end":4831,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":4814}],"target_id":"claim.frontier.pmid-42813109","target_kind":"node","target_sha256":"78bd27b5f7d76018b2933fb98dbf4e1f9fbb3d6f41a285b38466b7c71ff0b296"}],"claim.frontier.pmid-42814704":[{"id":"assertion.claim.frontier.pmid-42814704","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42814704","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42814704 \"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study\" (CC BY, first published 2026-09-30) reports: \"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.\"","support":[{"end":4610,"quote":"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":4398},{"end":7309,"quote":"\"firstPublicationDate\":\"2026-09-30\"","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":7274},{"end":7063,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":7046}],"target_id":"claim.frontier.pmid-42814704","target_kind":"node","target_sha256":"dc169ded9f5242d24ef811bad8e27a03386154712b6286d331fd25888d63d130"}],"claim.frontier.pmid-42814760":[{"id":"assertion.claim.frontier.pmid-42814760","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42814760","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42814760 \"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study\" (CC BY, first published 2026-09-30) reports: \"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.\"","support":[{"end":8247,"quote":"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":8101},{"end":10070,"quote":"\"firstPublicationDate\":\"2026-09-30\"","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":10035},{"end":9824,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":9807}],"target_id":"claim.frontier.pmid-42814760","target_kind":"node","target_sha256":"b1c16611b8a80eec2bfd14658c56533a80319b6d0f17cc657bc7df274853be3d"}],"claim.frontier.pmid-42816488":[{"id":"assertion.claim.frontier.pmid-42816488","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42816488","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42816488 \"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat\" (CC BY, first published 2026-08-24) reports: \"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.\"","support":[{"end":11724,"quote":"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":11517},{"end":16281,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":16246},{"end":16035,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":16018}],"target_id":"claim.frontier.pmid-42816488","target_kind":"node","target_sha256":"4a98dcc07b6694edae7a377c3c1f5a2b301429da094359b952a8f9ed783bf3e7"}],"claim.frontier.pmid-42818964":[{"id":"assertion.claim.frontier.pmid-42818964","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42818964","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42818964 \"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience\" (CC BY, first published 2026-09-01) reports: \"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.\"","support":[{"end":4173,"quote":"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":4044},{"end":5864,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":5829},{"end":5659,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":5642}],"target_id":"claim.frontier.pmid-42818964","target_kind":"node","target_sha256":"8a039963ae8ba30e88080de9557b87aa8f4388f2363d2f3f3af0b6c7e1a36f1a"}],"claim.frontier.pmid-42820092":[{"id":"assertion.claim.frontier.pmid-42820092","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42820092","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42820092 \"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study\" (CC BY, first published 2026-08-31) reports: \"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).\"","support":[{"end":3703,"quote":"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":3499},{"end":5898,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":5863},{"end":5652,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":5635}],"target_id":"claim.frontier.pmid-42820092","target_kind":"node","target_sha256":"d59eb9d8f8eb021b1e05f8c6ceb37b49e84cb6e388f21a784fd44ddccabebd5f"}],"claim.frontier.pmid-42821558":[{"id":"assertion.claim.frontier.pmid-42821558","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821558","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821558 \"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors\" (CC BY, first published 2026-10-01) reports: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","support":[{"end":4510,"quote":"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":4231},{"end":8243,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":8208},{"end":7997,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":7980}],"target_id":"claim.frontier.pmid-42821558","target_kind":"node","target_sha256":"ccbf61f4993814ff0a4ac9040bc452c51d5d2cde0bf8056d8efe1d1adbc9c000"}],"claim.frontier.pmid-42821607":[{"id":"assertion.claim.frontier.pmid-42821607","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821607","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821607 \"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network\" (CC BY, first published 2026-10-01) reports: \"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.\"","support":[{"end":3392,"quote":"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":3124},{"end":6578,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":6543},{"end":6332,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":6315}],"target_id":"claim.frontier.pmid-42821607","target_kind":"node","target_sha256":"a4bebba0bb0c78f7def8662af6eaef665217d4dd7495a88ba905f4ca62cb0378"}],"claim.frontier.pmid-42821620":[{"id":"assertion.claim.frontier.pmid-42821620","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821620","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821620 \"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2\" (CC BY, first published 2026-10-01) reports: \"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.\"","support":[{"end":8199,"quote":"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":8082},{"end":11239,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":11204},{"end":11025,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":11008}],"target_id":"claim.frontier.pmid-42821620","target_kind":"node","target_sha256":"c4ed9036362b9e66edf89cef088b1147e3a98e55e7fc7227447b474b7fba11ee"}],"claim.frontier.pmid-42823403":[{"id":"assertion.claim.frontier.pmid-42823403","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42823403","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42823403 \"Global incidence of esophageal cancer by histological and anatomical subtypes\" (CC BY, first published 2026-09-01) reports: \"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).\"","support":[{"end":6785,"quote":"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":6427},{"end":10154,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":10119},{"end":9908,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":9891}],"target_id":"claim.frontier.pmid-42823403","target_kind":"node","target_sha256":"d0c2a4755cccae151199a29b5ec43036e1e908c41cd9dfcfc7e297f489d8f5ce"}],"claim.frontier.pmid-42823984":[{"id":"assertion.claim.frontier.pmid-42823984","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42823984","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42823984 \"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment\" (CC BY, first published 2026-09-17) reports: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","support":[{"end":2554,"quote":"The findings indicate a strong negative association between perceived work-life balance and silent resignation.","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":2443},{"end":4679,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":4644},{"end":4433,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":4416}],"target_id":"claim.frontier.pmid-42823984","target_kind":"node","target_sha256":"cfebdc786afa9fbfffba11e6e95e54932541a1d03e17301cb4c46df816a5efab"}],"claim.frontier.pmid-42824002":[{"id":"assertion.claim.frontier.pmid-42824002","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824002","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824002 \"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock\" (CC BY, first published 2026-08-31) reports: \"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.\"","support":[{"end":2720,"quote":"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":2539},{"end":5069,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":5034},{"end":4823,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":4806}],"target_id":"claim.frontier.pmid-42824002","target_kind":"node","target_sha256":"75e01a36c4f1b515df659fba206cc6e469cd03aafba484a53ffa13868e1b05dc"}],"claim.frontier.pmid-42824079":[{"id":"assertion.claim.frontier.pmid-42824079","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824079","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824079 \"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education\" (CC BY, first published 2026-09-17) reports: \"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.\"","support":[{"end":3248,"quote":"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":3017},{"end":4605,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":4570},{"end":4359,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":4342}],"target_id":"claim.frontier.pmid-42824079","target_kind":"node","target_sha256":"c191258a393dfcbe8cbde53af35a0a235580ef424542b1c0ddbe0edb8896a892"}],"claim.frontier.pmid-42824182":[{"id":"assertion.claim.frontier.pmid-42824182","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824182","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824182 \"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence\" (CC BY, first published 2026-09-17) reports: \"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.\"","support":[{"end":3356,"quote":"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":3060},{"end":5191,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":5156},{"end":4945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":4928}],"target_id":"claim.frontier.pmid-42824182","target_kind":"node","target_sha256":"cf336adb252df80b6ebe1dd2ca3577780b6917a9f5d124de15bc973279bf0fa8"}],"claim.frontier.pmid-42824361":[{"id":"assertion.claim.frontier.pmid-42824361","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824361","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824361 \"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study\" (CC BY, first published 2026-09-17) reports: \"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.\"","support":[{"end":5491,"quote":"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":5382},{"end":8095,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":8060},{"end":7849,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":7832}],"target_id":"claim.frontier.pmid-42824361","target_kind":"node","target_sha256":"ad4dc3634f1db5baa9cdddc87eb981dcd9212e52f92672449b24e9a0d35ab735"}],"claim.frontier.pmid-42825005":[{"id":"assertion.claim.frontier.pmid-42825005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42825005","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42825005 \"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors\" (CC BY, first published 2026-09-01) reports: \"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).\"","support":[{"end":2437,"quote":"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":2274},{"end":5582,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":5547},{"end":5336,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":5319}],"target_id":"claim.frontier.pmid-42825005","target_kind":"node","target_sha256":"c24a0aaf6f5abf3ee3d1d7b5ed8b1c49126ac994d66286b5673a9ff45082249d"}],"claim.frontier.pmid-42826334":[{"id":"assertion.claim.frontier.pmid-42826334","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42826334","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42826334 \"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study\" (CC BY, first published 2026-10-01) reports: \"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.\"","support":[{"end":5419,"quote":"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":5213},{"end":8858,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":8823},{"end":8605,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":8588}],"target_id":"claim.frontier.pmid-42826334","target_kind":"node","target_sha256":"884a18b54be9a0e3646262c39d37390c59567995eb408e3bc2b2335ee668cbda"}],"claim.frontier.pmid-42827305":[{"id":"assertion.claim.frontier.pmid-42827305","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827305","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827305 \"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties\" (CC BY, first published 2026-10-01) reports: \"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.\"","support":[{"end":3075,"quote":"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":2735},{"end":7285,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":7250},{"end":7080,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":7063}],"target_id":"claim.frontier.pmid-42827305","target_kind":"node","target_sha256":"368911c2ccbfdbe4087c35c1320f42404ece848ddbad490693580c1bac95e3e2"}],"claim.frontier.pmid-42827524":[{"id":"assertion.claim.frontier.pmid-42827524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827524","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827524 \"Impression management in distributive justice: balancing fairness and social perception\" (CC BY, first published 2026-09-18) reports: \"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.\"","support":[{"end":2549,"quote":"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":2304},{"end":4397,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":4362},{"end":4103,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":4086}],"target_id":"claim.frontier.pmid-42827524","target_kind":"node","target_sha256":"e901e4d54d113b4a93e361f019e540f7fe8c9e64398668dbea8a3ea5a6a93a39"}],"claim.frontier.pmid-42827649":[{"id":"assertion.claim.frontier.pmid-42827649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827649","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827649 \"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke\" (CC BY, first published 2026-09-18) reports: \"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.\"","support":[{"end":4306,"quote":"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":3973},{"end":7744,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":7709},{"end":7498,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":7481}],"target_id":"claim.frontier.pmid-42827649","target_kind":"node","target_sha256":"80b28d2f8c10ee9bc6f5aa77219010a8d1b5158fc2bf5eaea021ff450842b977"}],"claim.frontier.pmid-42829444":[{"id":"assertion.claim.frontier.pmid-42829444","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42829444","quantifiers":"Only what the quoted sentence states","time":"2026-10-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42829444 \"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection\" (CC BY, first published 2026-10-04) reports: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","support":[{"end":6196,"quote":"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":5971},{"end":7756,"quote":"\"firstPublicationDate\":\"2026-10-04\"","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":7721},{"end":7459,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":7442}],"target_id":"claim.frontier.pmid-42829444","target_kind":"node","target_sha256":"1e43045d5f9ccd7f3921e0e5c217b1f67a79d04a25bd809540e66a61187c219f"}],"claim.frontier.pmid-42830983":[{"id":"assertion.claim.frontier.pmid-42830983","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42830983","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42830983 \"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.\"","support":[{"end":2282,"quote":"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":2171},{"end":4901,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":4866},{"end":4655,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":4638}],"target_id":"claim.frontier.pmid-42830983","target_kind":"node","target_sha256":"53aade5163e4e3bd96f2b21ec648a8b6d7e98c4352f6f457a1a473cbfcd00307"}],"claim.frontier.pmid-42831114":[{"id":"assertion.claim.frontier.pmid-42831114","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42831114","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42831114 \"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis\" (CC BY, first published 2026-09-04) reports: \"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.\"","support":[{"end":2150,"quote":"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":1963},{"end":5466,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":5431},{"end":5220,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":5203}],"target_id":"claim.frontier.pmid-42831114","target_kind":"node","target_sha256":"381ba5288b97beb539b9b17593902070585729316401bc9ea19e449a922578c5"}],"claim.frontier.pmid-42831226":[{"id":"assertion.claim.frontier.pmid-42831226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42831226","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42831226 \"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge\" (CC BY, first published 2026-09-04) reports: \"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.\"","support":[{"end":1890,"quote":"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":1689},{"end":4928,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":4893},{"end":4682,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":4665}],"target_id":"claim.frontier.pmid-42831226","target_kind":"node","target_sha256":"9992d079019e7c49707837a86610550735c28b39cad1542ec465f4ea861f3e46"}],"claim.frontier.pmid-42842684":[{"id":"assertion.claim.frontier.pmid-42842684","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42842684","quantifiers":"Only what the quoted sentence states","time":"2026-10-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42842684 \"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>\" (CC BY, first published 2026-10-07) reports: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","support":[{"end":5660,"quote":"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":5532},{"end":9208,"quote":"\"firstPublicationDate\":\"2026-10-07\"","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":9173},{"end":8962,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":8945}],"target_id":"claim.frontier.pmid-42842684","target_kind":"node","target_sha256":"7ea1fde213fffdcbe9c18161473c1dbe68bd0b17b0578b3129729f32db1cbbb8"}],"claim.frontier.pmid-42853148":[{"id":"assertion.claim.frontier.pmid-42853148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42853148","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42853148 \"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes\" (CC BY, first published 2026-10-09) reports: \"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.\"","support":[{"end":11099,"quote":"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":10983},{"end":13486,"quote":"\"firstPublicationDate\":\"2026-10-09\"","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":13451},{"end":13240,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":13223}],"target_id":"claim.frontier.pmid-42853148","target_kind":"node","target_sha256":"c049cf702e82cf69563e7e90f402a45a81de0424d21a86323b59b7dc8c843a99"}],"claim.geobiology.basalt-glass-biofilm-redox-stress-2018":[{"id":"assertion.claim.geobiology.basalt-glass-biofilm-redox-stress-2018","scope":{"assumptions":"Comparison of stressed Fe(II)-rich and unstressed Fe(III)-rich glass surfaces","population":"Synthetic basaltic glasses with contrasted residual-stress and Fe redox conditions in B. fungorum colonization experiments","quantifiers":"Dense coverage in the first tested glass condition; sparse in the contrasted glass condition","time":"Laboratory colonization assays, publication date 2018","uncertainty":"Joint contrast does not individually isolate stress or Fe oxidation state as sole cause","units":null},"statement":"The 2018 colonization assays reported dense biofilm on stressed Fe(II)-rich basalt glasses, versus sparse colonization on unstressed Fe(III)-rich glasses.","support":[{"end":5089,"quote":"In colonization experiments, basaltic glasses with residual stress and high Fe(II) content were intensely covered with a cellular biofilm. In contrast, glasses with high Fe(III) content and no residual stress were sparsely colonized.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4856}],"target_id":"claim.geobiology.basalt-glass-biofilm-redox-stress-2018","target_kind":"node","target_sha256":"deef783557453dbc0e1ec7939a2d06d475d3bd686fc920afa0bd6ba4ec51231d"}],"claim.geobiology.basalt-glass-stress-feii-release-2018":[{"id":"assertion.claim.geobiology.basalt-glass-stress-feii-release-2018","scope":{"assumptions":"Assays varied Fe redox state and glass residual stress","population":"Synthetic basaltic glasses of differing Fe oxidation states and residual stress exposed to B. fungorum in laboratory colonization assays","quantifiers":"Increase across tested residual stress and Fe(II) conditions","time":"Laboratory colonization assays, publication date 2018","uncertainty":"Reported correlation in tested glasses; factors are varied together in this summary and cannot be treated as separately isolated universal effects","units":null},"statement":"In biotic laboratory colonization assays using synthetic basaltic glasses, dissolved major-element concentrations increased with greater residual stress and Fe(II) content.","support":[{"end":4047,"quote":"Additionally, colonization experiments with synthetic basaltic glasses of different Fe redox states and residual stresses were performed to evaluate their influence on microbial activity and surface attachment of cells.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":3828},{"end":4476,"quote":"The concentration of dissolved major elements in solution in biotic colonization experiments with synthetic basaltic glasses increased with increasing residual stress and Fe(II) content.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4290}],"target_id":"claim.geobiology.basalt-glass-stress-feii-release-2018","target_kind":"node","target_sha256":"fdbdc29a0350c54ec40e4e9b8a1ad276bcc19f6c94565da7586c0af420e812f7"}],"claim.geobiology.basalt-nutrient-depletion-dissolution-2018":[{"id":"assertion.claim.geobiology.basalt-nutrient-depletion-dissolution-2018","scope":{"assumptions":"Batch incubation with added glucose, prescribed growth medium and abiotic comparisons","population":"HSDP2 Hawaiian drill-core basalt incubated with one species, B. fungorum, compared to abiotic controls","quantifiers":"Exceeded controls only when the rock sample assay was nutrient depleted","time":"Laboratory incubation assays, publication date 2018","uncertainty":"Assay-specific and conditioned on nutrient depletion; not a field-wide or seawater claim","units":null},"statement":"In laboratory incubations of HSDP2 drill-core basalt with Burkholderia fungorum, release of Fe and other major elements exceeded abiotic controls only for nutrient-depleted rock-sample assays.","support":[{"end":3568,"quote":"The interaction of a single bacterial species (\nBurkholderia fungorum\n) with basaltic rocks from the ICDP HSDP2 drill core and synthetic basaltic glasses was investigated in batch laboratory experiments","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":3366},{"end":4289,"quote":"In biotic incubation experiments bacterial growth was observed and the release of Fe and other major elements from drill core basaltic rocks to solution exceeded that of abiotic controls only when the rock sample assay was nutrient depleted.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4048}],"target_id":"claim.geobiology.basalt-nutrient-depletion-dissolution-2018","target_kind":"node","target_sha256":"224db821b7cc5d64c35e9059fd286e38b939cae2c9bc4568fc04e04c08b7a25e"}],"claim.geobiology.dresser-barite-hot-spring-pools-2017":[{"id":"assertion.claim.geobiology.dresser-barite-hot-spring-pools-2017","scope":{"assumptions":"Geometric and stratigraphic association with inferred surface sinter and collapsed sediments","population":"Some large barite masses associated with upper hydrothermal feeder veins in DFc1","quantifiers":"At least some, not all, masses","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Proposed reinterpretation of at least some masses; no claim applying to all barite occurrences","units":null},"statement":"The authors propose that at least some large Dresser barite masses at hydrothermal vein tips are mineralized remnants of terrestrial hot-spring pools and shallow hydrothermal plumbing.","support":[{"end":22924,"quote":"However, new observations suggest that at least some of these barite masses represent the mineralized remnants of terrestrial hot spring pools and associated shallow subsurface hydrothermal plumbing.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":22725},{"end":25063,"quote":"These barite masses occur at the uppermost tips of hydrothermal feeder veins along faults (that is, hydrothermal fluid conduits), and some are found immediately beneath overlying strata with known geyserite and siliceous sinter deposits.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":24826}],"target_id":"claim.geobiology.dresser-barite-hot-spring-pools-2017","target_kind":"node","target_sha256":"b4fb648194f2b22cb8b7be8d723db448ae1f3d53988bd38c276228ba558b0db6"}],"claim.geobiology.dresser-bubbles-eps-2017":[{"id":"assertion.claim.geobiology.dresser-bubbles-eps-2017","scope":{"assumptions":"Interpretation from microstructure and analogy to exopolymeric substance (EPS) in hot-spring mats","population":"Circular to sub-circular inclusions in Dresser columnar–botryoidal inferred geyserite at locality 16N","quantifiers":"Numerous structures of approximately 200 µm diameter","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Both bubble identity and EPS preservation are interpreted; source of gas unresolved","units":"µm"},"statement":"The authors interpret roughly 200 µm circular structures in Dresser geyserite as gas bubbles likely trapped in microbial EPS, while leaving thermal-fluid versus metabolic gas origin unresolved.","support":[{"end":26645,"quote":"Contained within these horizons are numerous circular to sub-circular structures, ∼200 μm in diameter, filled by microquartz and barite, but lined with fine-grained anatase and internal anatase crystal splays that fan inwards from the margins towards the centre of the structures","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":26366},{"end":29669,"quote":"Therefore, regardless of whether the Dresser bubbles were derived from degassing of thermal fluids or represent metabolic gas derivatives, preservation likely occurred almost immediately, through entrapment in microbial EPS.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":29445}],"target_id":"claim.geobiology.dresser-bubbles-eps-2017","target_kind":"node","target_sha256":"ca60c900f43a608899e7388634fd357488ac924ec8b3969dc3f478c5edc0027e"}],"claim.geobiology.dresser-geyserite-localities-2017":[{"id":"assertion.claim.geobiology.dresser-geyserite-localities-2017","scope":{"assumptions":"Geological, textural and mineralogical comparisons with modern hot-spring deposits","population":"Three sampled DFc1 localities in the Dresser Formation, Pilbara Craton","quantifiers":"Three localities separated by approximately 2 km","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Interpretation by paper authors, not independent confirmation of biological origin","units":"km"},"statement":"Djokic and colleagues interpret microlaminated siliceous rocks at three Dresser Formation DFc1 localities, approximately 2 km apart, as geyserite.","support":[{"end":10891,"quote":"Distinctive microlaminated siliceous rocks observed at three DFc1 localities, ∼2 km apart, are interpreted here as geyserite","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":10767}],"target_id":"claim.geobiology.dresser-geyserite-localities-2017","target_kind":"node","target_sha256":"0005aaa2bc8e30b96de41590ba1c0b00598b8199b49713cef017b261ec0568b9"}],"claim.geobiology.dresser-palisade-fabric-2017":[{"id":"assertion.claim.geobiology.dresser-palisade-fabric-2017","scope":{"assumptions":"Analogy between bedding-normal recrystallized quartz fabric and modern silicified microbial filament textures","population":"Selected thin laminae in the Dresser locality 1S sinter-terracette unit","quantifiers":"Some laminae; crystals described as 230 µm high","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Source offers a suggested biogenic analogy, not direct identification of original filaments","units":"µm"},"statement":"The authors suggest that bedding-normal quartz crystals in Dresser sinter terracettes are analogous to recrystallized microbial palisade fabric formed by silicified filaments.","support":[{"end":30699,"quote":"In addition, within the unit of sinter terracettes, some thin laminae display vertically aligned quartz crystals (230 μm high) that wrap around the curved hinge of the convex ridges","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":30518},{"end":31675,"quote":"Therefore, these vertically aligned quartz crystals are suggested as analogous to recrystallized microbial palisade fabric formed through silicification of microbial filaments oriented perpendicular to bedding surfaces on mid- to distal-apron hot spring terraces","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":31413}],"target_id":"claim.geobiology.dresser-palisade-fabric-2017","target_kind":"node","target_sha256":"3426db41fd66e527d6e1a36fb5ae9b0a95bbed66f97f3529abc30f4e24e2ccc5"}],"claim.geobiology.dresser-sinter-terracettes-2017":[{"id":"assertion.claim.geobiology.dresser-sinter-terracettes-2017","scope":{"assumptions":"Resemblance in primary porosity and microtextures to younger hot-spring terracettes","population":"Stratiform geyserite and overlying siliceous ridge unit at Dresser locality 1S","quantifiers":"3 cm thick unit; ridges approximately 1 cm across and under 2 cm high","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Analogue-based interpretation, not direct proof of microbial construction","units":"cm"},"statement":"At Dresser locality 1S, the authors interpret convex siliceous ridges above stratiform geyserite as resembling mid- to distal-apron hot-spring sinter terracettes.","support":[{"end":21631,"quote":"stratiform geyserite is overlain by a 3 cm thick unit composed of siliceous, millimetre-thin laminae that form ∼1 cm diameter, low-amplitude (<2 cm), asymmetrical convex ridges","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":21455},{"end":22075,"quote":"The convex laminae in cross-section resemble sinter terracettes (smaller-scale subsets within sinter terraces) from the mid- to distal-apron facies of hot springs, displaying the primary porosity and microtextures comparable with more recent, microbially derived examples","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":21804}],"target_id":"claim.geobiology.dresser-sinter-terracettes-2017","target_kind":"node","target_sha256":"b8750257f1a4694fbb9cac10e86050fea8d99ded01e0e031d638e7e40a6e7dd4"}],"claim.geobiology.dresser-stromatolites-locality-24s-2017":[{"id":"assertion.claim.geobiology.dresser-stromatolites-locality-24s-2017","scope":{"assumptions":"Interpretation of sediment onlap and internal stromatolitic textures","population":"Dresser locality 24S stromatolitic laminates interbedded with inferred geyserite rip-up clasts","quantifiers":"Site-specific occurrence","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Microbial origin is an interpretation described as consistent with, not uniquely proved by, the structures","units":null},"statement":"At Dresser locality 24S, geyserite rip-up clasts occur among domical and conical stromatolitic laminates; their internal laminae and sediment onlap are described as consistent with microbial origin.","support":[{"end":31905,"quote":"geyserite rip-up clasts found interbedded with elongate domical and conical stromatolitic laminates","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":31806},{"end":32285,"quote":"Onlapping by these tuffaceous sediments and the irregular internal laminae with faint palimpsest microfabrics within these stromatolites are consistent with a microbial origin","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":32110}],"target_id":"claim.geobiology.dresser-stromatolites-locality-24s-2017","target_kind":"node","target_sha256":"05290b3372396d9d687d87e8461d236e3ff3456193bae45e45a79fd6d270731b"}],"claim.geobiology.dresser-vesicle-organic-carbon-2018":[{"id":"assertion.claim.geobiology.dresser-vesicle-organic-carbon-2018","scope":{"assumptions":"Reported kerogen association in correlative microscopy observations","population":"Volcanic-glass microstructures in the sampled Dresser Formation thin sections","quantifiers":"Much of altered glass; some individual vesicles; multiple vesicles within some laminae","time":"approximately 3.48 Ga geological material","uncertainty":"Association does not establish biological origin of the vesicles or the carbon","units":null},"statement":"In the studied Dresser volcanic-glass microstructures, organic kerogenous material accompanies altered glass, with some vesicles lined or filled by carbon and organic-rich laminae enveloping multiple vesicles.","support":[{"end":4031,"quote":"Organic kerogenous material is associated with much of the altered volcanic glass; variable quantities of organic carbon line or fill the insides of some individual vesicles, while relatively large, tufted organic-rich laminae envelop multiple vesicles.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3778}],"target_id":"claim.geobiology.dresser-vesicle-organic-carbon-2018","target_kind":"node","target_sha256":"3d2b4f77b68ffb459f893cdd241f8f3ffe70b34b9c8fde0e96d7438d30ab2cc2"}],"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018":[{"id":"assertion.claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","scope":{"assumptions":"Correlative microscopy and comparisons of size distributions, wall ultrastructure and chemistry","population":"The microstructure suite examined in the sampled Dresser Formation material","quantifiers":"Studied suite, not all putative Archean microfossils","time":"approximately 3.48 Ga geological material","uncertainty":"Abiogenic interpretation of these samples only; does not reclassify other Archean structures","units":null},"statement":"A 2018 study interprets spheroidal-to-lenticular Dresser microstructures resembling Archean microfossils as silicified and pyritized vesicular volcanic glass based on size, wall ultrastructure and chemistry.","support":[{"end":3525,"quote":"Here, we describe a new suite of spheroidal to lenticular microstructures that morphologically resemble some previously reported Archean microfossils.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3375},{"end":3777,"quote":"Correlative microscopy shows that these objects have a size distribution, wall ultrastructure, and chemistry that are incompatible with a microfossil origin and instead are interpreted as pyritized and silicified fragments of vesicular volcanic glass.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3526}],"target_id":"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","target_kind":"node","target_sha256":"28c8e83e5287945fece64dc7714b530e77240468e4b81f3dbb3f2e83cfffd0c5"}],"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018":[{"id":"assertion.claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","scope":{"assumptions":"Extrapolation from alteration and morphology of studied volcanic-glass microstructures","population":"Hypothetical reworked or isolated microstructures of the same type as studied Dresser vesicular glass","quantifiers":"May prove problematic; nanoscale inspection conditional on such cases","time":null,"uncertainty":"Conditional methodological warning; no claim that all isolated candidate microfossils are abiotic","units":null},"statement":"The Dresser pseudo-fossil study cautions that isolated reworked silicified volcanic vesicles can adsorb carbon and become pyritized, complicating early-life identification; nanoscale wall analysis may be required to exclude biogenicity.","support":[{"end":4625,"quote":"However, reworked, isolated, and silicified microstructures of this type may prove particularly problematic in early or extraterrestrial life studies since they adsorb carbon onto their surfaces and are readily pyritized","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":4405},{"end":4811,"quote":"In those cases, nanoscale analysis of wall ultrastructure would be required to firmly exclude a biological origin.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":4697}],"target_id":"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","target_kind":"node","target_sha256":"ef9d3ac0f517d5b524a36335a7f95469264661620522290551eb365404841206"}],"claim.grace.cv-drought-depletion-2006-2010":[{"id":"assertion.grace.cv-drought-depletion-2006-2010","scope":{"assumptions":"GRACE groundwater residual estimates, not direct aquifer-only observations","limitations":"The comparison with modeled earlier drought periods is not temporally matched independent confirmation.","population":"California Central Valley","quantifiers":"6–8 km³/year and 24–34 km³ during specified drought interval","time":"April 2006–March 2010","uncertainty":"Reported depletion ranges","units":"km³/year; km³"},"statement":"Scanlon and colleagues report GRACE-derived Central Valley groundwater depletion of 6–8 km³ per year, totaling 24–34 km³, between April 2006 and March 2010.","support":[{"end":29796,"quote":"In the CV, GWS depletion during the late 2000s drought calculated from GRACE data (6–8 km\n3\n/y totaling 24–34 km\n3\nfrom April 2006 to March 2010)","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29651}],"target_id":"claim.grace.cv-drought-depletion-2006-2010","target_kind":"node","target_sha256":"d348afae71a445128df383490cdefe8a1926cec1235d65dcd93119d77dbe25e1"}],"claim.grace.cv-historical-depletion-2003":[{"id":"assertion.grace.cv-historical-depletion-2003","scope":{"assumptions":"Historical hydrologic model estimates","limitations":"Model-derived historical estimates, not direct satellite measurements.","population":"California Central Valley groundwater aquifer","quantifiers":"Approximately 140 km³ total","time":"1860s–2003, with separately modeled subperiods","uncertainty":null,"units":"km³"},"statement":"Scanlon and colleagues report an estimated 140 km³ of Central Valley groundwater depletion from the 1860s through 2003, comprising 60 km³ before 1961 and 80 km³ during 1962–2003, based on groundwater models.","support":[{"end":12736,"quote":"Likewise, in the CV, groundwater depletion was estimated to be ∼140 km\n3\nfrom models [60 km\n3\nfrom the 1860s to 1961 (\nFig. 1\nB\n) and 80 km\n3\nfrom 1962 to 2003]","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":12576}],"target_id":"claim.grace.cv-historical-depletion-2003","target_kind":"node","target_sha256":"dad083b2ec5593f5d47a3f2e39767c03472f930e43e26b41eec54243c96802b8"}],"claim.grace.cvhm2-simulation-period":[{"id":"assertion.grace.cvhm2-simulation-period","scope":{"assumptions":"MODFLOW-OWHM integrated hydrologic simulation","limitations":"Simulation and observational calibration do not automatically establish independent corroboration of GRACE groundwater estimates.","population":"California Central Valley","quantifiers":"USGS model description","time":"April 1961–September 2019","uncertainty":null,"units":"Monthly model timestep"},"statement":"USGS describes Central Valley Hydrologic Model version 2 as using MODFLOW-OWHM to simulate groundwater and surface-water flow, irrigation, land subsidence and associated processes monthly from April 1961 through September 2019.","support":[{"end":5124,"quote":"In addition, the model utilizes a specialized version of MODFLOW called the MODFLOW-One-Water Hydrologic Flow Model (MODFLOW-OWHM) to simulate groundwater and surface-water flow, irrigated agriculture, land subsidence, and other key processes in the Central Valley monthly for April 1961 through September 2019.","source_id":"src.grace.centralvalley.usgs-cvhm2-model-data","source_sha256":"f40769ef7b0af90919837f4aa4a44eac03fdcfa79cbd875f5f23da9005e03228","start":4813}],"target_id":"claim.grace.cvhm2-simulation-period","target_kind":"node","target_sha256":"0056de4ec02c740ae3329b5992bb86160bcd9ddd631cb0902982aa163fa3d4a6"}],"claim.grace.groundwater-residual-method":[{"id":"assertion.grace.groundwater-residual-method","scope":{"assumptions":"Snow storage, reservoir storage and soil-moisture estimates from additional monitoring or models","limitations":"GRACE does not independently measure groundwater alone; subtraction uncertainty remains.","population":"GRACE terrestrial water storage observations","quantifiers":"Regional groundwater residual method","time":null,"uncertainty":null,"units":null},"statement":"Scanlon and colleagues describe deriving groundwater storage changes from GRACE total water storage by subtracting snow, reservoir surface-water and modeled soil-moisture storage changes.","support":[{"end":29463,"quote":"GRACE measures changes in total water storage, which are used to estimate changes in groundwater storage (GWS) by subtracting changes in storage in snow (snow water equivalent) from the Snow Data Assimilation System, surface water from reservoir monitoring, and soil moisture derived from Global Land Data Assimilation System models","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29131}],"target_id":"claim.grace.groundwater-residual-method","target_kind":"node","target_sha256":"5c9615e937dabff40be4f47afa901a52068d0a83635764d8bef2b546b82b8eeb"}],"claim.grace.hp-bayesian-downscaling-2026":[{"id":"assertion.grace.hp-bayesian-downscaling-2026","scope":{"assumptions":"Bayesian hierarchical model jointly incorporating satellite, well and covariate data","limitations":"Joint data assimilation does not serve as an independent test of satellite-well agreement. Retained source is a preprint abstract.","population":"High Plains aquifer; GRACE and NGWMN observations","quantifiers":"Author-reported method and analysis interval","time":"2002–2022","uncertainty":"Numerical validation uncertainties not provided in retained abstract","units":null},"statement":"Pakrashi, Haran and Zuidema describe combining GRACE satellite measurements, groundwater-well observations and covariates using a Bayesian hierarchical framework to estimate High Plains groundwater variations over 2002–2022.","support":[{"end":1387,"quote":"In this paper, we develop a downscaling framework for the satellite data that integrates the two sources and covariates using a Bayesian hierarchical framework.","source_id":"src.grace.highplains.pakrashi-2026-downscaling","source_sha256":"e9b5eeb097be1a9421c53967e6d45e9fa00e715b95527fbe7f2c14a9cdfd03aa","start":1227},{"end":2018,"quote":"Our approach yields high-resolution estimates of groundwater variations across the HPA from 2002--2022.","source_id":"src.grace.highplains.pakrashi-2026-downscaling","source_sha256":"e9b5eeb097be1a9421c53967e6d45e9fa00e715b95527fbe7f2c14a9cdfd03aa","start":1915}],"target_id":"claim.grace.hp-bayesian-downscaling-2026","target_kind":"node","target_sha256":"a9d3e847b91e23520d5dcbe21adbf3ef79c7df1cab0540a168a1264a1443919b"}],"claim.grace.hp-historical-depletion-2007":[{"id":"assertion.grace.hp-historical-depletion-2007","scope":{"assumptions":"Well-derived groundwater storage conversion","limitations":"Different observation period from GRACE; does not independently establish satellite agreement.","population":"High Plains aquifer; 3,600 groundwater wells","quantifiers":"Approximately 330 km³; one reported regional estimate","time":"Predevelopment, approximately 1950s, to 2007","uncertainty":null,"units":"km³"},"statement":"Scanlon and colleagues report approximately 330 km³ of High Plains groundwater depletion from predevelopment in the 1950s through 2007, based on groundwater levels from 3,600 wells.","support":[{"end":12432,"quote":"Groundwater has been depleted by ∼330 km\n3\nin the HP aquifer on the basis of groundwater level data from 3,600 wells from predevelopment (∼1950s) to 2007","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":12279}],"target_id":"claim.grace.hp-historical-depletion-2007","target_kind":"node","target_sha256":"42143a8b4e3cc5d06c1bd1a579ee6b7d72503714c23639fdcf52d186d9fab1b6"}],"claim.grace.hp-satellite-well-correlation":[{"id":"assertion.grace.hp-satellite-well-correlation","scope":{"assumptions":"GRACE storage-component subtraction and conversion of well levels to groundwater storage","limitations":"Correlation is not full independent validation of storage trends or absolute depletion volumes; underlying cited comparisons require separate examination.","population":"High Plains aquifer; approximately 1,000 monitoring wells","quantifiers":"Reported r² range 0.7–0.8","time":null,"uncertainty":"Confidence interval not supplied in retained passage","units":"r², dimensionless"},"statement":"Scanlon and colleagues report r² values of 0.7–0.8 between GRACE-derived groundwater storage changes and estimates from monitoring approximately 1,000 High Plains wells.","support":[{"end":29637,"quote":"In the HP, estimated GWS changes from GRACE data are highly correlated with those from detailed groundwater level monitoring data (∼1,000 wells,\nr\n2\nfrom 0.7 to 0.8)","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29472}],"target_id":"claim.grace.hp-satellite-well-correlation","target_kind":"node","target_sha256":"0131fe7e707db0750bb27279fa9b8a86cfe9c0d551b3d43fe67ba6cb1446f9c0"}],"claim.grace.hp-usgs-recovery-2017-2019":[{"id":"assertion.grace.hp-usgs-recovery-2017-2019","scope":{"assumptions":"Area-weighted groundwater monitoring and recoverable-storage calculations","limitations":"Short-term net recovery does not erase longer-term depletion or establish recovery in every region.","population":"High Plains aquifer","quantifiers":"Aquifer-wide mean and net storage change","time":"2017–2019","uncertainty":null,"units":"feet; million acre-feet"},"statement":"McGuire and Strauch report a High Plains aquifer area-weighted average water-level rise of 0.1 foot and an estimated increase of 1.6 million acre-feet of recoverable groundwater storage during 2017–2019.","support":[{"end":45654,"quote":"The area-weighted, average water-level change for the aquifer for the 2017 to 2019\n                     period was a rise of 0.1 ft","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":45523},{"end":48630,"quote":"Recoverable water in storage from 2017 to 2019 rose 1.6 Macre-ft overall; changes","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":48549}],"target_id":"claim.grace.hp-usgs-recovery-2017-2019","target_kind":"node","target_sha256":"4d01a87326d1e62b8fd71a46dd5252e0ae1172c3b7594f5458e10bde0ac2c847"}],"claim.grace.hp-usgs-specific-yield":[{"id":"assertion.grace.hp-usgs-specific-yield","scope":{"assumptions":"Mapped specific-yield polygons and area-weighted aggregation","limitations":"Specific yield is a conversion factor; different spatial assignments affect inferred recoverable storage.","population":"Mapped High Plains aquifer, excluding areas of little or no saturated thickness","quantifiers":"15.1% aquifer mean; 8.1–18.5% range of state means","time":"Specific-yield values applied in the USGS storage calculations","uncertainty":null,"units":"percent"},"statement":"The USGS High Plains report gives an area-weighted mean specific yield of 15.1% for the aquifer excluding areas of little or no saturated thickness, with state means ranging from 8.1% in Wyoming to 18.5% in Oklahoma.","support":[{"end":37582,"quote":"The area-weighted, average specific yield of the aquifer, not including the areas\n                     of little or no saturated thickness, is 15.1 percent overall for the aquifer; area-weighted,\n                     average specific yield by State ranges from 8.1 percent in Wyoming to 18.5 percent\n                     in Oklahoma","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":37250}],"target_id":"claim.grace.hp-usgs-specific-yield","target_kind":"node","target_sha256":"022378bd52a7bac544f55cd35df9a67bb046e8f5144c7e197ae47325db8c37d0"}],"claim.grace.hp-usgs-storage-2019":[{"id":"assertion.grace.hp-usgs-storage-2019","scope":{"assumptions":"Recoverable storage calculated from water-level mapping and specific-yield assumptions","limitations":"Not a GRACE-only measurement; estimates depend on storage-conversion assumptions.","population":"High Plains aquifer","quantifiers":"Aquifer-wide estimates","time":"Predevelopment, about 1950, to 2019","uncertainty":null,"units":"billion and million acre-feet; percent"},"statement":"McGuire and Strauch estimate that the High Plains aquifer contained approximately 2.91 billion acre-feet of recoverable groundwater in 2019, representing a decline of 286.4 million acre-feet, about 10%, since predevelopment.","support":[{"end":53475,"quote":"Recoverable water in storage in 2019 was about 2.91 billion acre-feet overall, which\n                  was a decline of about 286.4 million acre-feet (Macre-ft) (about 10 percent) since\n                  predevelopment.","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":53256}],"target_id":"claim.grace.hp-usgs-storage-2019","target_kind":"node","target_sha256":"6374066c1f5a9475b5a27faff39d907e92b69860c0dfcb74106f3bc20f24ec86"}],"claim.grace.jpl-mascon-gridding-v02":[{"id":"assertion.grace.jpl-mascon-gridding-v02","scope":{"assumptions":"Mass-inversion solution mapped to a finer regular grid","limitations":"A 0.5-degree output grid does not imply independent 0.5-degree spatial resolving power.","population":"JPL GRACE/GRACE-FO RL06M v02 mascon product","quantifiers":"Product description","time":null,"uncertainty":null,"units":"4,551 mascons; degrees"},"statement":"NASA JPL describes its GRACE/GRACE-FO RL06M v02 solution as 4,551 relatively independent surface-mass estimates derived using an equal-area 3-degree mascon grid, subsequently mapped onto a 0.5-degree latitude-longitude grid.","support":[{"end":4092,"quote":"The complete Mascon solution consists of 4,551 relatively independent estimates of surface mass change that have been derived using an equal-area 3-degree grid of individual mascons. The final solutions are then mapped into 0.5-degree regular lat-lon grid.","source_id":"src.grace.jpl-rl06m-v02-documentation","source_sha256":"8c8ad24663bb581a757cf2a9d62ce7b7f9da2779670a6924c08e99a19e7b9110","start":3836}],"target_id":"claim.grace.jpl-mascon-gridding-v02","target_kind":"node","target_sha256":"5da684609303079de8b9439c55b5120256d0cd4a49b3af93ff999c2cb745adcf"}],"claim.grb090510-energy-dispersion-constraint":[{"id":"assertion.grb090510-energy-dispersion-constraint","scope":{"assumptions":"Interpretation of arrival timing as a constraint on energy-dependent photon propagation","population":"High- and low-energy gamma rays associated with GRB 090510","quantifiers":"Gamma rays from one specified burst","time":"GRB 090510 observation","uncertainty":"The NASA passage gives a qualitative strong constraint, without a numerical bound on a dispersion coefficient or accounting for emission-time uncertainty.","units":"Arrival separation less than 1 second; propagation distance approximately 7 billion light-years"},"statement":"NASA reports that GRB 090510 placed a strong constraint on variation of light speed with photon energy, with high- and low-energy gamma rays arriving within one second after traveling approximately seven billion light-years.","support":[{"end":3872,"quote":"GRB090510 placed a strong constraint on variation of the speed of light with energy. High- and low-energy gamma rays arrived within 1 second after traveling 7 billion light years.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":3693}],"target_id":"claim.grb090510-energy-dispersion-constraint","target_kind":"node","target_sha256":"f993fc3a086000e373020c6c06d5eabcb0d875b77ce7bf746fdefa995038be1d"}],"claim.grb090510-energy-separated-photon-arrivals":[{"id":"assertion.grb090510-energy-separated-photon-arrivals","scope":{"assumptions":"Photon propagation and arrival comparison as described by NASA","population":"Two photons detected from gamma-ray burst GRB 090510","quantifiers":"Two selected photons from one burst","time":"GRB 090510 observation; precise detection timestamp not established by the cited passage","uncertainty":"Near-simultaneous arrival is reported without an exact time difference in this supporting passage.","units":"Energy ratio approximately 1000000; propagation distance greater than 7.3 billion light-years"},"statement":"NASA reports that two photons from GRB 090510, differing in energy by a factor of one million, arrived at Fermi nearly simultaneously after traveling more than 7.3 billion light-years.","support":[{"end":3085,"quote":"Fermi-LAT was able to test this using photons from the bright GRB 090510. Two of the photons, one a million times more energetic than the other, traveled over 7.3 billion light-years before arriving at the telescope, arriving at nearly the same time, thus demonstrating that Lorentz invariance holds strong.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":2778}],"target_id":"claim.grb090510-energy-separated-photon-arrivals","target_kind":"node","target_sha256":"3802c1037d55f0e926d34b6231d55d7bc9fd35cb2694a2366107c1bb24051bc5"}],"claim.happy-code-flm-experimental-test":[{"id":"assertion.happy-code-flm-experimental-test","scope":{"assumptions":"The experimental confirmation is claimed within the implemented model, rather than for physical quantum gravity generally.","population":"A toy holographic duality implemented as the HaPPY quantum error-correcting code on a trapped-ion quantum computer","quantifiers":"One reported model implementation","time":null,"uncertainty":"Author-reported experimental result; independent replication and generalization are not established by the supplied excerpt.","units":null},"statement":"The authors report experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in a trapped-ion implementation of the HaPPY holographic code.","support":[{"end":1600,"quote":"Here, we implement a toy model of this duality called the HaPPY code, a quantum error-correcting code in the form of a tensor network with hyperbolic entanglement patterns, on a trapped-ion quantum computer. We present the first experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in this model - a key test of the holographic correspondence.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1240}],"target_id":"claim.happy-code-flm-experimental-test","target_kind":"node","target_sha256":"11b90856dd14784449fac4abbdc8732a2d42c792a229cc4fab1056621c498ebb"}],"claim.happy-code-magic-entropic-precursors":[{"id":"assertion.happy-code-magic-entropic-precursors","scope":{"assumptions":"Non-stabilizerness, also called magic, is introduced into the implemented code.","population":"The reported holographic-code experiment","quantifiers":"One reported experimental construction","time":null,"uncertainty":"Entropic precursors are reported; direct observation of emergent physical gravity is not established.","units":null},"statement":"The authors report observing entropic precursors expected of emergent gravity after introducing non-stabilizerness into their holographic-code model.","support":[{"end":1715,"quote":"We then enrich it with non-stabilizerness, or magic, and observe entropic precursors expected of emergent gravity.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1601}],"target_id":"claim.happy-code-magic-entropic-precursors","target_kind":"node","target_sha256":"ef2a063225a0b48bcf5fa4e6404864483dba1a0baeb1fce6e042643406cb7927"}],"claim.holographic-code-wormhole-entropic-behavior":[{"id":"assertion.holographic-code-wormhole-entropic-behavior","scope":{"assumptions":"The resemblance concerns entropic behavior within the code.","population":"A quantum-code construction studied in the reported experiment","quantifiers":"One reported code construction","time":null,"uncertainty":"The authors describe reminiscent entropic behavior, without establishing a physical wormhole.","units":null},"statement":"The authors report constructing and measuring a quantum code whose entropic behavior resembles that of a highly quantum wormhole.","support":[{"end":1836,"quote":"Finally, we present and measure a code construction whose entropic behavior is reminiscent of a highly quantum wormhole.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1716}],"target_id":"claim.holographic-code-wormhole-entropic-behavior","target_kind":"node","target_sha256":"3c1ded91ef4dac837481138304e57c8e2d710a30701b3123d53f571407b158e3"}],"claim.longcontext.babilong-20-reasoning-tasks":[{"id":"assertion.claim.longcontext.babilong-20-reasoning-tasks","scope":{"assumptions":"Scattered target facts across long natural text","population":"Synthetic reasoning tasks of the BABILong benchmark","quantifiers":"20 tasks; five named examples of reasoning types","time":"2024 reported benchmark","uncertainty":"Benchmark tasks are distinct from operational proof of general reasoning or exact context use","units":"Tasks"},"statement":"BABILong introduces 20 tasks involving fact chaining, induction, deduction, counting and lists or sets, designed to require reasoning over facts distributed through very long natural-language documents.","support":[{"end":1280,"quote":"To bridge this gap, we introduce the BABILong benchmark, designed to test language models' ability to reason across facts distributed in extremely long documents. BABILong includes a diverse set of 20 reasoning tasks, including fact chaining, simple induction, deduction, counting, and handling lists/sets.","source_id":"src.longcontext.kuratov-babilong-2024","source_sha256":"0b8a5b1e2518df6ba3e35331a7b446489ebef12b827f8194307288be3bf1fb3c","start":974}],"target_id":"claim.longcontext.babilong-20-reasoning-tasks","target_kind":"node","target_sha256":"ae081b3226992054572b39840b65bc091fb4453b1c48916d330037f99f394d5a"}],"claim.longcontext.helmet-niah-vs-downstream":[{"id":"assertion.claim.longcontext.helmet-niah-vs-downstream","scope":{"assumptions":"Comparative benchmark correlations and predictive value are empirical author reports","population":"59 long-context language models studied in HELMET","quantifiers":"59 models; two named findings","time":"2025 paper version","uncertainty":"Correlation magnitudes and individual model identities are not given in the selected excerpt","units":"Models; category correlations"},"statement":"In a study of 59 long-context models, the HELMET authors report that synthetic needle-in-a-haystack scores do not reliably predict downstream performance and that their different application-centered task categories have low correlations.","support":[{"end":2073,"quote":"Through a comprehensive study of 59 LCLMs, we find that (1) synthetic tasks like NIAH do not reliably predict downstream performance; (2) the diverse categories in HELMET exhibit distinct trends and low correlations with each other;","source_id":"src.longcontext.yen-helmet-2025","source_sha256":"046e3a0166c8f73f23321107b7f33bec803ea33bb2165d0d2ab9a254c6515dbe","start":1841}],"target_id":"claim.longcontext.helmet-niah-vs-downstream","target_kind":"node","target_sha256":"cfa26560724993d5618463510330d28adba5a3d2d7ab47bc8009b9f0857b497c"}],"claim.longcontext.infinitybench-over100k":[{"id":"assertion.claim.longcontext.infinitybench-over100k","scope":{"assumptions":"Source HTML text extraction omits math-styled name at two locations; benchmark identity comes from source title; report describes planned demands, not demonstrated impossibility of partial retrieval","population":"InfinityBench evaluated long-input benchmark tasks","quantifiers":"Average length >100K tokens","time":"2024 ACL publication","uncertainty":"The abstract does not list task counts or model scores; phrase first is author priority claim not independently established","units":"Tokens; averaged data length"},"statement":"The 2024 InfinityBench paper describes a benchmark with average data length above 100K tokens and a mix of synthetic and realistic English and Chinese tasks intended to require long-distance dependencies rather than retrieval of isolated passages.","support":[{"end":2552,"quote":"In this paper, we propose , the first LLM benchmark featuring an average data length surpassing 100K tokens.","source_id":"src.longcontext.zhang-infinitybench-2024","source_sha256":"492f728709e4dbb69a9b6f2b64965970b2a6650cc9cbf364d82d1293bd70ee18","start":2444},{"end":2830,"quote":"The tasks in are designed to require an understanding of long dependencies in contexts and make simply retrieving a limited number of passages from contexts not sufficient for these tasks.","source_id":"src.longcontext.zhang-infinitybench-2024","source_sha256":"492f728709e4dbb69a9b6f2b64965970b2a6650cc9cbf364d82d1293bd70ee18","start":2642}],"target_id":"claim.longcontext.infinitybench-over100k","target_kind":"node","target_sha256":"10b5938f17fbea91d77a6212bc0387414317d0ac05a6adf760da6cdc629401b2"}],"claim.longcontext.liu-relevant-position":[{"id":"assertion.claim.longcontext.liu-relevant-position","scope":{"assumptions":"Task-specific positional evaluation, not a universal behavior of all models","population":"Language models evaluated in the Lost in the Middle paper","quantifiers":"Two evaluated tasks; start/end versus middle","time":"Research reported in the 2023 arXiv revision","uncertainty":"Often, not always; no numerical effect size or current-model result established by the excerpt","units":"Relative task performance"},"statement":"Liu and colleagues report that models evaluated on multi-document question answering and key-value retrieval often performed best when relevant information occurred at the start or end of a long input, with marked degradation for middle positions.","support":[{"end":1088,"quote":"We analyze the performance of language models on two tasks that require identifying relevant information in their input contexts: multi-document question answering and key-value retrieval.","source_id":"src.longcontext.liu-lost-middle-2024","source_sha256":"9be1db75f75a4327cdfe474c1703ea26020c52f2e2c14c0b6175fde4a4370692","start":900},{"end":1579,"quote":"In particular, we observe that performance is often highest when relevant information occurs at the beginning or end of the input context, and significantly degrades when models must access relevant information in the middle of long contexts, even for explicitly long-context models.","source_id":"src.longcontext.liu-lost-middle-2024","source_sha256":"9be1db75f75a4327cdfe474c1703ea26020c52f2e2c14c0b6175fde4a4370692","start":1296}],"target_id":"claim.longcontext.liu-relevant-position","target_kind":"node","target_sha256":"60f7a0b3573a78915c1ff3cd05e8ea752707481997ffbf0fb658e175a789d3df"}],"claim.longcontext.longbench-original-design":[{"id":"assertion.claim.longcontext.longbench-original-design","scope":{"assumptions":"English and Chinese lengths use different units and should not be directly compared","population":"Datasets selected for original LongBench","quantifiers":"21 datasets; 6 categories; 6711 English words; 13386 Chinese characters","time":"2024 ACL publication","uncertainty":"Reported averages are not maximum supported context lengths and do not establish benchmark score reliability","units":"Datasets; task categories; words; characters"},"statement":"The original LongBench authors report 21 datasets in six task categories in English and Chinese, with average input lengths of 6,711 English words and 13,386 Chinese characters.","support":[{"end":2841,"quote":"LongBench comprises 21 datasets across 6 task categories in both English and Chinese, with an average length of 6,711 words (English) and 13,386 characters (Chinese).","source_id":"src.longcontext.bai-longbench-2024","source_sha256":"cfac7a68d6fabd15919c439b72608ffb3c6c86b5c3078503cb9f6a554731d18b","start":2675}],"target_id":"claim.longcontext.longbench-original-design","target_kind":"node","target_sha256":"53711a51b60b144c8a94511d19a3f93bf1bd42a07eefe5619c72cfca7782abfd"}],"claim.longcontext.longbench-v2-design":[{"id":"assertion.claim.longcontext.longbench-v2-design","scope":{"assumptions":"Context lengths are words, not model tokens; questions are multiple-choice","population":"LongBench v2 question set","quantifiers":"503 questions; 8k to 2M words; 6 categories","time":"2025 benchmark publication","uncertainty":"The abstract does not establish that every evaluated model processed the entire 2-million-word range","units":"Questions; context words; categories"},"statement":"The LongBench v2 authors describe 503 multiple-choice questions with source contexts from 8,000 to 2 million words spanning six categories, including multi-document questions and code-repository understanding.","support":[{"end":2522,"quote":"LongBench v2 consists of 503 challenging multiple-choice questions, with contexts ranging from 8k to 2M words, across six major task categories: single-document QA, multi-document QA, long in-context learning, long-dialogue history understanding, code repository understanding, and long structured data understanding.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2205}],"target_id":"claim.longcontext.longbench-v2-design","target_kind":"node","target_sha256":"b8a427f5b8e3d2bbdf7d66674d3e791a73c5ccbd5fe0f31d08a80920d4803304"}],"claim.longcontext.longbench-v2-score-comparison":[{"id":"assertion.claim.longcontext.longbench-v2-score-comparison","scope":{"assumptions":"Direct-answer model and reasoning-enabled o1-preview used distinct response settings; not evidence of universal superiority","population":"Human experts and evaluated models on the LongBench v2 multiple-choice test","quantifiers":"Experts 53.7%; direct-answer 50.1%; o1-preview 57.7%; 15-minute human limit","time":"2025 benchmark; expert limit 15 minutes","uncertainty":"Reported accuracies are task-specific; the human constraint and model reasoning procedures limit direct equivalence","units":"Accuracy percentages; minutes"},"statement":"The LongBench v2 authors report 53.7% human-expert accuracy with a 15-minute limit, 50.1% for the strongest directly answering model, and 57.7% for o1-preview using longer reasoning under their reported evaluation.","support":[{"end":2851,"quote":"We employ both automated and manual review processes to maintain high quality and difficulty, resulting in human experts achieving only 53.7% accuracy under a 15-minute time constraint.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2666},{"end":3094,"quote":"Our evaluation reveals that the best-performing model, when directly answers the questions, achieves only 50.1% accuracy. In contrast, the o1-preview model, which includes longer reasoning, achieves 57.7%, surpassing the human baseline by 4%.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2852}],"target_id":"claim.longcontext.longbench-v2-score-comparison","target_kind":"node","target_sha256":"65d06582bd666279770a9273afdddae57502fc67f3b467ef2378a37b1d203ca9"}],"claim.longcontext.longcite-citation-pipeline":[{"id":"assertion.claim.longcontext.longcite-citation-pipeline","scope":{"assumptions":"Sentence-level citation generation is not by itself verified attribution fidelity in every response","population":"LongCite source-described QA pipeline and its two trained models","quantifiers":"LongCite-45k; LongCite-8B; LongCite-9B","time":"2024 research manuscript","uncertainty":"Source describes its claimed result; no independent verification or current-model comparison inferred","units":"Training-set name; model names"},"statement":"The LongCite authors propose a Coarse-to-Fine pipeline producing long-context question-answer pairs with sentence-level citations and report using its LongCite-45k training data to train LongCite-8B and LongCite-9B.","support":[{"end":1905,"quote":"To this end, we propose CoF (Coarse to Fine), a novel pipeline that utilizes off-the-shelf LLMs to automatically generate long-context QA instances with precise sentence-level citations, and leverage this pipeline to construct LongCite-45k, a large-scale SFT dataset for LQAC. Finally, we train LongCite-8B and LongCite-9B using the LongCite-45k dataset, successfully enabling their generation of accurate responses and fine-grained sentence-level citations in a single output.","source_id":"src.longcontext.zhang-longcite-2024","source_sha256":"58e1b8678416aa174246e7797dd5e56b8d173a13892b431f6a54b485cf473b06","start":1428}],"target_id":"claim.longcontext.longcite-citation-pipeline","target_kind":"node","target_sha256":"e448452a911a9127733b7c57fc769b4e98e4d9884088988b9065a0205375fa90"}],"claim.longcontext.nolima-32k-degradation":[{"id":"assertion.claim.longcontext.nolima-32k-degradation","scope":{"assumptions":"Below 50% means relative to each model’s own short-context performance, not below 50 percentage points in absolute accuracy","population":"13 models selected for the NoLiMa benchmark; GPT-4o among evaluated models","quantifiers":"13 models; 11 below half baseline; GPT-4o 99.3% to 69.7%","time":"2025 evaluation; short context under 1K tokens compared with 32K tokens","uncertainty":"Result applies to tested model versions and NoLiMa tasks; no statement about all uses of GPT-4o","units":"Tokens; accuracy percentage; baseline ratio"},"statement":"In NoLiMa evaluations of 13 models claiming at least 128K-token support, 11 performed at under half their short-context baseline at 32K; the reported GPT-4o score dropped from 99.3% at short context to 69.7% at 32K.","support":[{"end":1288,"quote":"We evaluate 13 popular LLMs that claim to support contexts of at least 128K tokens.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":1205},{"end":1618,"quote":"At 32K, for instance, 11 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":1406}],"target_id":"claim.longcontext.nolima-32k-degradation","target_kind":"node","target_sha256":"b4efc7ad4a182ad14fc2a59fa4671f94e7b8734247a91d785f1892ffc131cc7f"}],"claim.longcontext.nolima-nonliteral-retrieval":[{"id":"assertion.claim.longcontext.nolima-nonliteral-retrieval","scope":{"assumptions":"Needles are designed with minimal question-passage lexical overlap","population":"Long-context language models evaluated by NoLiMa","quantifiers":"No universal performance quantifier","time":"2025 benchmark publication","uncertainty":"Minimal lexical overlap is a benchmark design property, not an assertion that lexical information is entirely absent","units":"Words and retrieval instances"},"statement":"The NoLiMa authors introduce a needle-retrieval benchmark in which questions and relevant text have minimal lexical overlap, requiring latent associations rather than straightforward literal matching to locate evidence.","support":[{"end":1204,"quote":"To address this, we introduce NoLiMa, a benchmark extending NIAH with a carefully designed needle set, where questions and needles have minimal lexical overlap, requiring models to infer latent associations to locate the needle within the haystack.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":956}],"target_id":"claim.longcontext.nolima-nonliteral-retrieval","target_kind":"node","target_sha256":"1cb653431a83dbe5c1a3a6c9c2bd57f80615f37234098f0e5be2decd945c4124"}],"claim.longcontext.ruler-32k-performance":[{"id":"assertion.claim.longcontext.ruler-32k-performance","scope":{"assumptions":"Satisfactory refers to the paper’s benchmark criterion, not an independently specified universal standard","population":"17 models assessed by RULER","quantifiers":"17 models; 32K tokens; approximately half","time":"2024 evaluation; 32K-token test length","uncertainty":"The excerpt does not give per-model scores, error bars or applicability to later models","units":"Models; tokens; fraction"},"statement":"In the RULER authors’ evaluation of 17 long-context models advertised for at least 32K tokens, almost all declined on RULER as input length grew, and the authors reported only about half maintained satisfactory performance at 32K, despite nearly perfect results on vanilla needle retrieval.","support":[{"end":1868,"quote":"We evaluate 17 long-context LMs with 13 representative tasks in RULER. Despite achieving nearly perfect accuracy in the vanilla NIAH test, almost all models exhibit large performance drops as the context length increases. While these models all claim context sizes of 32K tokens or greater, only half of them can maintain satisfactory performance at the length of 32K.","source_id":"src.longcontext.hsieh-ruler-2024","source_sha256":"2c01e359903ca57f0e4698e579eaf3790261ca503a34f8522ee8a55f7b955092","start":1500}],"target_id":"claim.longcontext.ruler-32k-performance","target_kind":"node","target_sha256":"5830bead6d5ffa2661398b1da12b4ae642347e1ce4cff5b0856be9d6b8d1f4d0"}],"claim.longcontext.ruler-task-design":[{"id":"assertion.claim.longcontext.ruler-task-design","scope":{"assumptions":"Synthetic tasks, configurable lengths and complexities","population":"17 long-context language models","quantifiers":"17 models; 13 representative tasks","time":"2024 RULER evaluation","uncertainty":"Benchmark design is not a guarantee of coverage of all real applications","units":"Models and tasks"},"statement":"The RULER paper describes a configurable synthetic long-context benchmark extending needle-in-a-haystack retrieval with different needle types and counts, plus multi-hop tracing and aggregation; it evaluates 17 language models on 13 representative tasks.","support":[{"end":1570,"quote":"RULER expands upon the vanilla NIAH test to encompass variations with diverse types and quantities of needles. Moreover, RULER introduces new task categories multi-hop tracing and aggregation to test behaviors beyond searching from context. We evaluate 17 long-context LMs with 13 representative tasks in RULER.","source_id":"src.longcontext.hsieh-ruler-2024","source_sha256":"2c01e359903ca57f0e4698e579eaf3790261ca503a34f8522ee8a55f7b955092","start":1259}],"target_id":"claim.longcontext.ruler-task-design","target_kind":"node","target_sha256":"87719f57f0b477616c5e026c2267271ff7ae343451eac80f2a50395c0f0211ee"}],"claim.ltee.cit-plus-cit-plus-plus-timing":[{"id":"assertion.ltee.cit-plus-cit-plus-plus-timing","scope":{"assumptions":"Historical timeline recounted by Leon et al. from earlier LTEE studies; distinction between rudimentary Cit+ and refined Cit++.","population":"One of twelve LTEE E. coli populations, Ara−3","quantifiers":"One population; two stages","time":"31,500 to 33,000 generations","uncertainty":"No assertion that the first cell carrying Cit+ was directly observed or that changes occurred in the other eleven populations.","units":"generations"},"statement":"Leon et al. (2018) describe emergence of citrate utilization in the Ara−3 LTEE population after 31,500 generations and descendants fully exploiting citrate by 33,000 generations.","support":[{"end":9280,"quote":"After 31,500 generations, a mutant in one of the LTEE populations, designated Ara\n−\n3, evolved the ability to utilize citrate as a carbon source. Descendants of this mutant that were able to fully exploit this additional carbon source evolved by 33,000 generations and dominated thereafter","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":8991}],"target_id":"claim.ltee.cit-plus-cit-plus-plus-timing","target_kind":"node","target_sha256":"c75d631b3a7e6c8eb10166bafa922b933d4136ecb0730f19c2b72f7d63eb00b3"}],"claim.ltee.citT-ancestor-1p0-fitness":[{"id":"assertion.ltee.citT-ancestor-1p0-fitness","scope":{"assumptions":"Knock-in mimic of evolved activation, not spontaneous appearance of the authentic tandem duplication in ancestor.","population":"Ancestral REL606 LTEE E. coli with P_rnk-citT chromosomal knock-in versus null cassette","quantifiers":"1.0% fitness advantage; one-tailed P=0.033; n=12","time":"Ancestral genetic background; assays reported 2018","uncertainty":"Effect near assay resolution; authors explicitly describe relatively weak support.","units":"relative fitness percent; P-value; observations n"},"statement":"Leon et al. (2018) measured a 1.0% fitness advantage for the engineered Cit+ activation in ancestral LTEE strain REL606, with weak statistical support (one-tailed P = 0.033; n = 12).","support":[{"end":21818,"quote":"We found a slight fitness benefit of 1.0% for the Cit\n+\nmutation (\nFig 1B\n). This effect size is near the limit for the smallest differences that can be distinguished in these types of competitive fitness assays, resulting in relatively weak support for the hypothesis that there was any fitness advantage at all for the REL606 variant with the P\nrnk\n-citT\nmodule relative to the one with the null module (one-tailed\nt\n-test,\nP\n= 0.033,\nn\n= 12).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":21373}],"target_id":"claim.ltee.citT-ancestor-1p0-fitness","target_kind":"node","target_sha256":"353c9cc143f2b3c0ea9514a2c53e23aacbb6d56dc62dbe3edccb8bc20d8b080e"}],"claim.ltee.citT-anti-potentiation-23clones":[{"id":"assertion.ltee.citT-anti-potentiation-23clones","scope":{"assumptions":"The 23 are sampled isolates, not all LTEE genotypes or all twelve populations.","population":"23 additional evolved pre-Cit+ LTEE Ara−3 clones assayed with citT activation and control cassettes","quantifiers":"11/23 strains disadvantage; 5 strains greater than 20% disadvantage","time":"Strains sampled at multiple pre-Cit+ generations; tests reported 2018","uncertainty":"Fitness reduction depends on genetic background; one-tailed bootstrap tests P<0.05 for reported comparisons.","units":"relative fitness percent; strains"},"statement":"Leon et al. (2018) reported that activating citT reduced competitive fitness in 11 of 23 tested evolved pre-Cit+ clones, including five with reductions greater than 20%.","support":[{"end":26917,"quote":"Unexpectedly, the Cit\n−\nvariant outcompeted the Cit\n+\nvariant for the 11 remaining strains of the 23 we tested (one-tailed bootstrap test,\nP\n< 0.05). The actualizing step needed for subsequently evolving full citrate utilization (Cit\n++\n) would have been effectively blocked if it occurred in these strain backgrounds; they are ‘anti-potentiated’. For five of these strains, activating\ncitT\nexpression was extremely detrimental, decreasing competitive fitness by >20% (one-tailed bootstrap test,\nP\n< 0.05).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":26411}],"target_id":"claim.ltee.citT-anti-potentiation-23clones","target_kind":"node","target_sha256":"d6892dc0661677149c776185c4ff7d8a9883f266122a85d67fd836a57fa7c941"}],"claim.ltee.citT-duplication-2p2-fitness":[{"id":"assertion.ltee.citT-duplication-2p2-fitness","scope":{"assumptions":"Competitive co-culture, controlled neutral arabinose-marker variants; duplication differs between compared strains.","population":"ZDB564 and its ZDB706 revertant in direct DM-medium competition","quantifiers":"2.2% advantage; two marker-direction variants","time":"Earliest Cit+ isolate ZDB564 from generation 31,500; tests reported in 2018","uncertainty":"The paper describes a small measured advantage for these strains, not a general advantage in all genetic backgrounds.","units":"relative fitness, percent"},"statement":"Leon et al. (2018) measured a 2.2% competitive fitness advantage associated with the citT-activating duplication by comparing early Cit+ isolate ZDB564 with its Cit− revertant ZDB706.","support":[{"end":18162,"quote":"When competing ZDB564 and ZDB706, we found a slight fitness advantage of 2.2% for the presence of the\ncitT\n-activating duplication in ZDB564","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":18022}],"target_id":"claim.ltee.citT-duplication-2p2-fitness","target_kind":"node","target_sha256":"b2635835c8e66b438b71de422d72a9cc226f12b13f5d2bc33867332a351beda2"}],"claim.ltee.citT-ecological-potentiation-test":[{"id":"assertion.ltee.citT-ecological-potentiation-test","scope":{"assumptions":"Cit+ and Cit− variants started equally and together formed about 1% of population mixture; comparison with direct variant competitions.","population":"Engineered Cit+ and Cit− variants of ZDB706 in a background of the full generation-31,000 Ara−3 LTEE population","quantifiers":"0.9% fitness advantage; ~1% initial fraction; P=0.053","time":"31,000-generation frozen population sample; 2018 tests","uncertainty":"The authors report marginal difference from pairwise competition (two-tailed P=0.053), not a definitive exclusion of all ecological effects.","units":"relative fitness percent; P-value; frequency percent"},"statement":"Leon et al. (2018) measured a 0.9% Cit+ fitness advantage when competing engineered ZDB706 variants at low frequency within the generation-31,000 LTEE population and reported no support for an ecological-potentiation advantage.","support":[{"end":23950,"quote":"The Cit\n+\nand Cit\n−\nvariants were mixed together equally and added such that they comprised ~1% of the cells in a mixture with the evolved population sample.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":23793},{"end":24267,"quote":"In this context, the Cit\n+\nstrain had a 0.9% fitness advantage over the Cit\n−\nstrain, which was less than and only marginally different from the result when the two strains were competed versus one another normally (two-tailed\nt\n-test,\nP\n= 0.053). Thus, we find no support for the ecological potentiation hypothesis.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":23951}],"target_id":"claim.ltee.citT-ecological-potentiation-test","target_kind":"node","target_sha256":"3a9067178ee05c55c823a19bf5d1c3b88223aac893671e1e4e272cfdaa983dbd"}],"claim.ltee.citT-phylo-negative-group":[{"id":"assertion.ltee.citT-phylo-negative-group","scope":{"assumptions":"Fitness effect pooled in a phylogenetically selected group; private mutations and uncertain changes on the ancestral line limit attribution.","population":"Phylogenetically grouped pre-Cit+ Ara−3 isolates ZDB425, ZDB458, and ZDB464","quantifiers":"Group estimate −5.4%, interval [−7.2%, −3.6%]","time":"Intermediate lineage samples, including generation 10,000 ZDB425 and generation 20,000 ZDB458","uncertainty":"Authors do not rule out additional changes in fitness effect during the 10,000–20,000-generation interval.","units":"relative fitness percent"},"statement":"Leon et al. (2018) estimated a −5.4% fitness effect (interval −7.2% to −3.6%) for citT activation in the intermediate pre-Cit+ lineage group represented by ZDB425, ZDB458 and ZDB464.","support":[{"end":33218,"quote":"It was deleterious to evolve Cit\n+\nin an earlier, intermediate set of isolates composed of ZDB425, ZDB458, and ZDB464 with an estimated fitness effect of –5.4% [–7.2%, –3.6%].","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":33043},{"end":33598,"quote":"ZDB425 at 10,000 generations and ZDB458 at 20,000 generations have only one and two ‘private’ mutations not shared with the main pre-Cit\n+\nlineage, respectively, though we cannot rule out that other changes in the impact of\ncitT\nactivation may have occurred on the main line of descent within this interval.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":33291}],"target_id":"claim.ltee.citT-phylo-negative-group","target_kind":"node","target_sha256":"2e0de14c025974dc0d55fa3a7939f747b486949d47e36a6d85437257e7e58d11"}],"claim.ltee.citT-phylo-positive-group":[{"id":"assertion.ltee.citT-phylo-positive-group","scope":{"assumptions":"Fitness impact of activating citT in a specified related group, not a whole-population estimate.","population":"Late pre-Cit+ Ara−3 lineage group including ZDB19, ZDB13, and the ZDB706 reference background","quantifiers":"Group estimate +2.4%, 95% interval [+1.4%, +3.4%]","time":"As early as 29,000 generations; assays reported in 2018","uncertainty":"Positive group estimate does not establish causal genetic variants or guarantee the evolutionary success of a Cit+ lineage.","units":"relative fitness percent"},"statement":"Leon et al. (2018) estimated a +2.4% fitness effect (95% interval +1.4% to +3.4%) in a later fully potentiated pre-Cit+ lineage group containing ZDB19 and ZDB13 from as early as 29,000 generations.","support":[{"end":32543,"quote":"Proceeding backward in the tree from the earliest known Cit\n+\nisolate (ZDB564), two earlier clones (ZDB19 and ZDB13) from as early as 29,000 generations are as fully potentiated as the key Cit\n−\nrevertant (ZDB706). The overall fitness effect of evolving Cit\n+\nin this group was +2.4% [+1.4%, +3.4%] (95% confidence interval).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":32218}],"target_id":"claim.ltee.citT-phylo-positive-group","target_kind":"node","target_sha256":"a0bb715b4c76e8d464540c79cfae21e55e1c2433be870e4a4bf6b0059c38d8d3"}],"claim.ltee.turner-citminus-50k-reinvasion":[{"id":"assertion.ltee.turner-citminus-50k-reinvasion","scope":{"assumptions":"Invasion refers to tested archived mixed culture and the added clone; low and high inoculation conditions were averaged.","population":"Generation-43,000 Cit− clone added to frozen generation-50,000 Cit+ whole-population sample under LTEE competition conditions","quantifiers":"3 × 10^5 cells/mL; about 10-fold lower; mean across two starting densities","time":"Seven-day invasion assay; 50,000-generation resident population","uncertainty":"Observed coexistence in short assay does not prove permanent ecological coexistence or identify the extinction cause.","units":"cells/mL; generations; days"},"statement":"Turner et al. (2015) observed that a generation-43,000 Cit− clone reinvaded the generation-50,000 Ara−3 population, reaching about 3 × 10^5 cells/mL, roughly an order of magnitude below final Cit− densities in the other treatments.","support":[{"end":28960,"quote":"When added to the 50,000-generation population—more than 6,000 generations after the extinction of the Cit\n−\nlineage—the 43,000-generation Cit\n−\nclone could still invade the Cit\n+\npopulation (\nFig 2A\n). However, the final Cit\n−\npopulation size was an order of magnitude lower (3 x 10\n5\ncells per mL, mean of high and low initial density treatments) than the final density of Cit\n−\ncells in any other treatment (\nFig 2B\n).","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":28539}],"target_id":"claim.ltee.turner-citminus-50k-reinvasion","target_kind":"node","target_sha256":"a51518604b1c1d62acdc0bd0c6cf28b47bde4a370db8ac880893bc7a5a503810"}],"claim.ltee.turner-citminus-detection-loss":[{"id":"assertion.ltee.turner-citminus-detection-loss","scope":{"assumptions":"PCR and colony phenotype assays applied to sampled material; disappearance inferred from detection limits.","population":"Frozen Ara−3 LTEE samples surveyed by genotype-specific PCR and phenotypic colony screens","quantifiers":"Presence through 43,500; absence detected from 44,000","time":"43,500 to 44,000 generations and later archived samples","uncertainty":"Absence of detectable signal is not a guarantee that no Cit− cell survived anywhere below assay sensitivity.","units":"generations"},"statement":"Turner et al. (2015) detected the Ara−3 Cit− genotype and phenotype through 43,500 LTEE generations but not in samples from 44,000 generations onward.","support":[{"end":24279,"quote":"The PCR assay for the presence of the Cit\n−\ngenotype produced clear bands of the expected size at all time points up to and including 43,500 generations (\nFig 1\n). At 44,000 generations and beyond, we did not observe any amplification. Phenotypic screens also indicated that the Cit\n−\nlineage went extinct between 43,500 and 44,000 generations. Cit\n−\ncells were detected through 43,500 generations in all cultures, but not at any later time point.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":23832}],"target_id":"claim.ltee.turner-citminus-detection-loss","target_kind":"node","target_sha256":"9400cb1dbe97035859bf6239b374430beb43158f010ebf5d559231f6dd7f8f63"}],"claim.ltee.turner-citminus-replay-survival":[{"id":"assertion.ltee.turner-citminus-replay-survival","scope":{"assumptions":"Standard LTEE conditions and genotype-specific PCR; frozen source populations may not reproduce any unrecorded environment perturbation.","population":"40 independently propagated Ara−3 replay cultures from frozen generation-43,500 and generation-40,000 populations; one additional from 43,000","quantifiers":"20+20 replays without Cit− loss; one 2,500-generation extension","time":"500 replay generations in each of 40 populations; 2,500 in one additional replay","uncertainty":"Zero extinctions in replays challenges repeatability under those conditions, not all hypothetical competitive-exclusion mechanisms.","units":"replicate populations; generations"},"statement":"Turner et al. (2015) found Cit− persistence in all 20 replay populations from generation 43,500 and all 20 from generation 40,000 after 500 generations, plus one generation-43,000 replay propagated for 2,500 generations.","support":[{"end":26428,"quote":"Twenty replicate populations founded from the 43,500-generation population sample evolved for 500 generations under the standard LTEE conditions. PCR assays showed that the Cit\n−\nclade persisted in all 20 cases through the end of the experiment. The Cit\n−\nlineage also persisted in all 20 control populations founded from the 40,000-generation population sample, and in the population founded from the 43,000-generation population sample that evolved for 2,500 generations.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":25955}],"target_id":"claim.ltee.turner-citminus-replay-survival","target_kind":"node","target_sha256":"80160e3db32a41ebff49b76f9fe131d5e3ce3ea32e760fade105957ac13ae0ee"}],"claim.ltee.turner-extinction-cause-unresolved":[{"id":"assertion.ltee.turner-extinction-cause-unresolved","scope":{"assumptions":"Reasoning combines failed replay repeatability, reinvasion, population-size argument, and hypothetical perturbation, not direct observation of a catastrophe.","population":"Ara−3 Cit− ecological lineage extinction between generation 43,500 and 44,000","quantifiers":"One lineage extinction; possible rare event","time":"Authors’ 2015 interpretation of extinction and replay results","uncertainty":"Environmental shock, soap residue, or water problem are hypotheses, not established mechanisms; complex alternatives discussed in paper are not proven impossible.","units":"generations"},"statement":"Turner et al. (2015) stated that the Ara−3 Cit− lineage extinction cause remained unknown, rejected their initial ongoing Cit+ adaptation explanation, and proposed an unidentified rare perturbation as a possible cause rather than an observed event.","support":[{"end":34095,"quote":"The cause of the Cit\n−\nlineage’s extinction remains unknown. We have rejected our initial hypothesis that on-going adaptation of the Cit\n+\nbacteria caused the extinction. A purely stochastic extinction of the Cit\n−\nlineage is also extremely unlikely.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":33845},{"end":35828,"quote":"We propose, therefore, that the cause of the Cit\n−\nextinction was a “random catastrophe”, that is, a large, rare event that reduced the size of the Ara–3 population as a whole or, at least, the Cit\n−\nlineage within it. We do not know the nature of this random catastrophe, but it could have been some unusual variation in laboratory conditions, such as soap residue in a flask or a problem with the deionized water used to make the culture medium.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":35381}],"target_id":"claim.ltee.turner-extinction-cause-unresolved","target_kind":"node","target_sha256":"a146e7f0095489bb39f2e424b14182f7a23f867d7786dd26615cb2739eb6e5e9"}],"claim.lz-4p2ty-background-consistency":[{"id":"assert.claim.lz-4p2ty-background-consistency.rev3","scope":{"assumptions":"The null-excess statement is conditional on the collaboration's analyzed data and expected-background model after removal of artificial signal-like events injected to mitigate analyzer bias.","population":"The data set analyzed in the specific LUX-ZEPLIN WIMP dark-matter search described by the retained source.","quantifiers":"The reported analysis used 4.2+-0.1 tonne-years from 280 live days, and the no-excess conclusion is restricted to the analyzed data relative to expected backgrounds.","time":"The reported analysis used a total exposure of 4.2+-0.1 tonne-years from 280 live days of LZ operation; atlas chronology remains unresolved under era=undated.","uncertainty":"This is a source-attributed null-excess result for the reported analysis. It does not establish that WIMPs do not exist, exclude all WIMP parameter space, resolve the nature of dark matter, or make any present-frontier claim.","units":"tonne-years and live days"},"statement":"In the LUX-ZEPLIN 4.2 tonne-year WIMP dark-matter search, the collaboration reported no evidence for an excess over expected backgrounds after removing artificial signal-like events injected to mitigate analyzer bias.","support":[{"end":446,"quote":"Title:\nDark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":346},{"end":4047,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new.","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":4482,"quote":"After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds.","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4321},{"end":4965,"quote":"Subjects:\nHigh Energy Physics - Experiment (hep-ex)","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4914}],"target_id":"claim.lz-4p2ty-background-consistency","target_kind":"node","target_sha256":"0a08f48825211834bb4adc7a6b7fd5f83137691e522a8bd807afee4d83c25ea9"}],"claim.lz-4p2ty-no-excess-reported":[{"id":"assertion.lz-4p2ty-no-excess-reported-v4","scope":{"assumptions":null,"population":"The analyzed data set in the LUX-ZEPLIN WIMP dark-matter search described by the retained source.","quantifiers":"Restricted to the reported 4.2 tonne-year LUX-ZEPLIN WIMP search and its reported comparison with expected backgrounds.","time":null,"uncertainty":"No evidence for an excess over expected backgrounds is represented only for this reported analysis; no broader conclusion about the existence or nature of dark matter is represented.","units":"tonne-years"},"statement":"In its 4.2 tonne-year WIMP dark-matter search, LUX-ZEPLIN reported no evidence for an excess over expected backgrounds after removal of artificial signal-like events injected to mitigate analyzer bias.","support":[{"end":446,"quote":"Title:\nDark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":346},{"end":3888,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber.","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":4482,"quote":"After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds.","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4321},{"end":4965,"quote":"Subjects:\nHigh Energy Physics - Experiment (hep-ex)","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4914}],"target_id":"claim.lz-4p2ty-no-excess-reported","target_kind":"node","target_sha256":"ebb141f1420b4b8326ff0c2e7a41baa590d57fd96aae4d00ee0f8a19c1e0e288"}],"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025":[{"id":"assertion.claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","scope":{"assumptions":"The two limits are conditional on alternative cosmological dark-energy parametrizations; not BAO-only data.","population":"DESI DR2 BAO and external CMB combination","quantifiers":"0.064 eV (ΛCDM) and 0.16 eV (w0wa)","time":"2025 DESI DR2 analysis","uncertainty":"Neither 95% upper limit is a direct mass observation or a universal model-independent upper bound.","units":"eV; 95% upper limit"},"statement":"The DESI DR2 analysis reported a 95% upper limit Σmν<0.064 eV for DESI BAO plus CMB under ΛCDM, versus Σmν<0.16 eV under a time-evolving w0wa dark-energy model using the same stated combination.","support":[{"end":5024,"quote":"From the combination of DESI and CMB we derive 95% upper limits on the sum of neutrino masses, finding $\\sum m_\\nu<0.064$ eV assuming $\\Lambda$CDM and $\\sum m_\\nu<0.16$ eV in the $w_0w_a$ model.","source_id":"src.neutrino.desi-dr2-bao-cosmology-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":4830}],"target_id":"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","target_kind":"node","target_sha256":"278cafce74ac3b1161f4904e8c6a8a3ac780d6751fd375d49dc59f957df9db87"}],"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025":[{"id":"assertion.claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","scope":{"assumptions":"Feldman-Cousins and Bayesian effective-parameter results are distinct statistical constructions; effective negative density is an analysis device, not physical negative neutrino mass.","population":"DESI DR2 BAO combined with external Planck and ACT CMB datasets as analyzed in this study","quantifiers":"Σmν<0.053 eV (95% Feldman-Cousins); 3σ effective-parameter tension","time":"2025 analysis","uncertainty":"Claimed tension depends on model assumptions, priors and treatment of boundaries; source itself mentions possible systematics and evolving dark energy.","units":"eV; confidence percentage; sigma"},"statement":"The DESI DR2 neutrino-constraints analysis reported a Feldman-Cousins 95% bound Σmν<0.053 eV after correcting for the zero-mass boundary, below the oscillation-inferred lower limit, and a separate effective-mass parametrization yielding 3σ tension under its analysis assumptions.","support":[{"end":3905,"quote":"However, we determine using frequentist and Bayesian methods that our constraints are in tension with the lower limits derived from neutrino oscillations. Correcting for the physical boundary at zero mass, we report a 95% Feldman-Cousins upper limit of $\\sum m_\\nu<0.053$ eV, breaching the lower limit from neutrino oscillations. Considering a more general Bayesian analysis with an effective cosmological neutrino mass parameter, $\\sum m_{\\nu,\\rm{eff}}$, that allows for negative energy densities and removes unsatisfactory prior weight effects, we derive constraints that are in $3\\sigma$ tension with the same oscillation limit.","source_id":"src.neutrino.desi-dr2-neutrino-constraints-2025","source_sha256":"ca6759d2fd6ba1b88e0bac9d225b3802a32560d0a588b646dcaf13ef7bac7730","start":3274}],"target_id":"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","target_kind":"node","target_sha256":"eb3d73244cf45a26fce9e6309aed9a101597515c05e54829d0a7e2c30abeea4c"}],"claim.neutrino.isocurvature-hierarchy-prior-2026":[{"id":"assertion.claim.neutrino.isocurvature-hierarchy-prior-2026","scope":{"assumptions":"The 0.052 eV bound is conditional on an unconstrained-from-below-by-oscillation mass prior; the 0.092 eV bound reflects a hierarchy-informed prior.","population":"Joint CMB-SPA, DESI DR2 BAO and DES Year 5 supernova analysis","quantifiers":"initial 95% limit 0.052 eV, oscillation floor 0.05878 eV, revised 95% upper limit 0.092 eV","time":"2026 paper, comparing alternative neutrino mass-sum priors","uncertainty":"The paper's prior analysis does not show that the mass sum is physically negative or establish neutrino hierarchy from cosmology.","units":"eV"},"statement":"The 2026 cosmological isocurvature analysis reported that its purely adiabatic ΛCDM upper limit of 0.052 eV lay below the oscillation-implied normal-ordering minimum of 0.05878 eV because of a statistical prior extending to zero, while a hierarchy-informed prior raised the reported upper limit to 0.092 eV.","support":[{"end":2330,"quote":"Notably, the adiabatic $\\Lambda$CDM limit of $0.052$ eV lies below the minimum sum required by the normal neutrino mass hierarchy ($0.05878$ eV), indicating that this bound is an artifact of the statistical prior extending to zero. Imposing a physically motivated hierarchy-informed prior raises the limit to $< 0.092$ eV. Our results demonstrate that current data show no evidence for NDI modes and that the inferred neutrino mass upper limit is robust against this extension, but a definitive, model-independent bound requires addressing prior dependencies and dark energy uncertainties.","source_id":"src.neutrino.desi-isocurvature-mass-priors-2026","source_sha256":"5bc1d8b96976d5da08b59bd5ede3eb1ab72eb9fab3580ffe32cfd19895e6a83c","start":1741}],"target_id":"claim.neutrino.isocurvature-hierarchy-prior-2026","target_kind":"node","target_sha256":"2126f75821160c4ff22509f2c3f884c9b002ac8767fb0eaf99b3876f5296b3ee"}],"claim.neutrino.isocurvature-mass-limits-2026":[{"id":"assertion.claim.neutrino.isocurvature-mass-limits-2026","scope":{"assumptions":"The comparison changes initial-condition assumptions within each dark-energy model; these are model/prior-dependent posterior limits.","population":"Joint Planck 2018, ACT DR6, SPT-3G CMB; DESI DR2 BAO; DES Year 5 supernovae","quantifiers":"ΛCDM <0.052 vs <0.057 eV; CPL <0.111 vs <0.115 eV","time":"2026 paper under two cosmological model assumptions","uncertainty":"The sub-oscillation-minimum ΛCDM bound can arise from a prior extending to zero and is not a model-independent exclusion of normal ordering.","units":"eV; 95% upper bound"},"statement":"A 2026 joint CMB, DESI DR2 and supernova analysis reported that allowing a neutrino-density isocurvature mode shifted its 95% neutrino mass-sum limits from 0.052 to 0.057 eV under ΛCDM and 0.111 to 0.115 eV under dynamical dark energy, without detecting the isocurvature mode.","support":[{"end":1538,"quote":"Within the $\\Lambda$CDM model, the 95\\% upper limit weakens only marginally from $\\sum m_\\nu < 0.052$ eV (purely adiabatic) to $< 0.057$ eV (including NDI), with the NDI amplitude consistent with zero. In the CPL dynamical dark energy model, the adiabatic limit is $< 0.111$ eV, shifting to $< 0.115$ eV with NDI, yet the isocurvature mode remains undetected.","source_id":"src.neutrino.desi-isocurvature-mass-priors-2026","source_sha256":"5bc1d8b96976d5da08b59bd5ede3eb1ab72eb9fab3580ffe32cfd19895e6a83c","start":1179}],"target_id":"claim.neutrino.isocurvature-mass-limits-2026","target_kind":"node","target_sha256":"cceccad5bb753cb83066e584534ba83ca1c9ad5dd7e7694ab5d59ff2a142aab9"}],"claim.neutrino.juno-accelerator-ordering-indication-2026":[{"id":"assertion.claim.neutrino.juno-accelerator-ordering-indication-2026","scope":{"assumptions":"Frequentist significance and Bayesian evidence reflect different inferential procedures and the cited combination; these are not reactor-only results.","population":"JUNO reactor data combined with external long-baseline accelerator constraints","quantifiers":"at least 2.1σ one-sided; Bayes factor 10.18","time":"September 2026 report","uncertainty":"An indication is not a definitive ordering determination; the Bayes factor depends on likelihood/prior choices not detailed in the retained abstract.","units":"sigma; dimensionless Bayes factor"},"statement":"The September 2026 JUNO collaboration reported that incorporating long-baseline accelerator constraints on Δm31² favored normal over inverted neutrino mass ordering with one-sided significance of at least 2.1σ across CP-violating phases and a Bayesian Bayes factor of 10.18.","support":[{"end":2020,"quote":"Incorporating constraints on $\\Delta m^2_{31}$ from long-baseline accelerator neutrino experiments into our analysis favored normal ordering over inverted ordering, with a one-sided significance of at least $2.1\\sigma$ across all possible CP-violating phases; a Bayesian analysis yielded a Bayes factor of 10.18 in favor of normal ordering.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":1680}],"target_id":"claim.neutrino.juno-accelerator-ordering-indication-2026","target_kind":"node","target_sha256":"8915cb012b86aecf3127df475d2ea4bf6f3e8a8686f1629762590880d525d6a2"}],"claim.neutrino.juno-data-splittings-2026":[{"id":"assertion.claim.neutrino.juno-data-splittings-2026","scope":{"assumptions":"The fitted atmospheric splitting is conditional on the chosen mass ordering and external Daya Bay constraint; the sample is not an independent determination of ordering.","population":"JUNO inverse-beta-decay candidate sample","quantifiers":"8,294 candidates; Δm31² = +2.509 (+0.027/-0.025) ×10^-3 eV² NO; -2.482 (+0.025/-0.026) ×10^-3 eV² IO","time":"207.2 live days, as reported in September 2026","uncertainty":"Oscillation-parameter fits and event counts do not establish the absolute neutrino mass or conclusive ordering.","units":"days; km; counts; eV^2"},"statement":"The September 2026 JUNO analysis reported 8,294 inverse-beta-decay candidates in 207.2 live days at an average 52.5 km reactor baseline and obtained different fitted atmospheric mass splittings under normal and inverted ordering using a Daya Bay constraint.","support":[{"end":1402,"quote":"The analysis is based on 207.2 live days of data, comprising 8,294 inverse beta-decay candidates collected at an average reactor baseline of 52.5 km. A world-leading precision of approximately 1% was achieved for the atmospheric neutrino mass splitting $\\Delta m^2_{31}$, with $\\Delta m^2_{31}=+2.509^{+0.027}_{-0.025}\\times10^{-3}\\,\\mathrm{eV}^2$ for normal ordering and $\\Delta m^2_{31}=-2.482^{+0.025}_{-0.026}\\times10^{-3}\\,\\mathrm{eV}^2$ for inverted ordering, using the Daya Bay constraint in the fit to resolve the correct physical minimum under each mass-ordering hypothesis.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":819}],"target_id":"claim.neutrino.juno-data-splittings-2026","target_kind":"node","target_sha256":"fab249e029cbb5a18ea61f64b6f76f8715b9a2258203274a2d265737a03598a9"}],"claim.neutrino.juno-solar-parameters-2026":[{"id":"assertion.claim.neutrino.juno-solar-parameters-2026","scope":{"assumptions":"Oscillation parameters are fitted within the model used by the collaboration; relative precision is as reported in the abstract.","population":"JUNO reactor-antineutrino oscillation measurement","quantifiers":"0.3036±0.0064; (7.388±0.078)×10^-5 eV²; relative 2.1% and 1.1%","time":"September 2026 report of 207.2-live-day analysis","uncertainty":"These are not absolute neutrino-mass estimates, and the reported uncertainties should not be recast as independently validated accuracy.","units":"dimensionless sin²θ12; eV²"},"statement":"The September 2026 JUNO analysis reported sin²θ12=0.3036±0.0064 and Δm21²=(7.388±0.078)×10^-5 eV², with stated relative precisions of 2.1% and 1.1%, respectively.","support":[{"end":1679,"quote":"We further improved the world's most precise measurements of the solar oscillation parameters, obtaining $\\sin^2\\theta_{12}=0.3036\\pm0.0064$ and $\\Delta m^2_{21}=(7.388\\pm0.078)\\times10^{-5}\\,\\mathrm{eV}^2$, corresponding to relative precisions of 2.1% and 1.1%, respectively.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":1403}],"target_id":"claim.neutrino.juno-solar-parameters-2026","target_kind":"node","target_sha256":"26e1f5c1b9ff9edbd39b25215c9587dbdad6ac755af6eb3a9571e03422f95952"}],"claim.neutrino.kamlandzen-half-life-2024":[{"id":"assertion.claim.neutrino.kamlandzen-half-life-2024","scope":{"assumptions":"The exposure is from KamLAND-Zen 800; the half-life limit uses a combination with the previous phase rather than just that exposure.","population":"KamLAND-Zen 800 xenon-136 data and preceding KamLAND-Zen phase","quantifiers":"745 kg enriched xenon; 2.1 tonne-years Xe-136; T1/2^0ν >3.8×10^26 yr (90% CL)","time":"Full dataset in arXiv report first submitted 2024, revised 2026","uncertainty":"A nondetection bounds the assumed decay channel; it does not demonstrate zero neutrino mass or Dirac nature.","units":"kg enriched Xe; tonne-years ^136Xe; years; 90% CL"},"statement":"The KamLAND-Zen full-dataset search with 745 kg enriched xenon and 2.1 tonne-years of xenon-136 exposure, combined with its previous phase, reported a 90%-confidence lower bound on the neutrinoless double-beta half-life of 3.8×10^26 years.","support":[{"end":2124,"quote":"We present a search for neutrinoless double-beta ($0\\nu\\beta\\beta$) decay of $^{136}$Xe using the full \\mbox{KamLAND-Zen 800} dataset with 745\\,kg of enriched xenon, corresponding to an exposure of $2.1$\\,ton\\,yr of $^{136}$Xe. This updated search benefits from a more than twofold increase in exposure, recovery of photo-sensor gain, and reduced background from muon-induced spallation of xenon. Combining with the search in the previous KamLAND-Zen phase, we obtain a lower limit for the $0\\nu\\beta\\beta$ decay half-life of $T_{1/2}^{0\\nu} > 3.8 \\times 10^{26}$\\,yr at 90\\% C.L., a factor of 1.7 improvement over the previous limit.","source_id":"src.neutrino.kamlandzen-complete-2024","source_sha256":"afccf49d3b787214c789322748f3268ed802b833d816cf5024b84de212c3c216","start":1490}],"target_id":"claim.neutrino.kamlandzen-half-life-2024","target_kind":"node","target_sha256":"aa6185d1206808ff8ea12d5c18212a6b1035a38715d96d3c06d00747261651b7"}],"claim.neutrino.kamlandzen-majorana-translation-2024":[{"id":"assertion.claim.neutrino.kamlandzen-majorana-translation-2024","scope":{"assumptions":"Translation assumes a neutrinoless-decay interpretation and chosen nuclear matrix elements; it is not direct kinematic neutrino-mass spectroscopy.","population":"KamLAND-Zen xenon-136 neutrinoless double-beta decay interpretation","quantifiers":"upper limits 28–122 meV","time":"Abstract of 2024 submission, as revised March 2026","uncertainty":"The mass range varies by nuclear modeling; nondetection does not establish whether neutrinos are Majorana or Dirac.","units":"meV; model-dependent inferred effective mass"},"statement":"The KamLAND-Zen full-dataset report translated its neutrinoless xenon-136 double-beta half-life constraint into effective Majorana neutrino-mass upper limits ranging from 28 to 122 meV using phenomenological nuclear matrix-element calculations.","support":[{"end":2285,"quote":"The corresponding upper limits on the effective Majorana neutrino mass are in the range 28--122\\,meV using phenomenological nuclear matrix element calculations.","source_id":"src.neutrino.kamlandzen-complete-2024","source_sha256":"afccf49d3b787214c789322748f3268ed802b833d816cf5024b84de212c3c216","start":2125}],"target_id":"claim.neutrino.kamlandzen-majorana-translation-2024","target_kind":"node","target_sha256":"1dccac696b4f8f3b94ae9b47c29117fae08ce569c670e008a2c2786f797fa975"}],"claim.neutrino.katrin-endpoint-bound-259d":[{"id":"assertion.claim.neutrino.katrin-endpoint-bound-259d","scope":{"assumptions":"A negative unconstrained best-fit squared-mass parameter is a statistical fit result, not a physical negative neutrino mass; effective kinematic mass differs from the cosmological sum.","population":"KATRIN tritium beta-decay endpoint spectrum","quantifiers":"best-fit mν²=-0.14 (+0.13/-0.15) eV²; mν<0.45 eV at 90% CL; 36 million electrons","time":"First five neutrino-mass campaigns totaling 259 measurement days; report submitted 2024 and published 2025","uncertainty":"No positive absolute-mass measurement follows from the upper limit; systematics/background modeled in analysis and not fully auditable from captured abstract.","units":"eV²; eV; electrons; days; confidence level"},"statement":"KATRIN reported a fitted squared effective electron-antineutrino mass of -0.14 (+0.13/-0.15) eV² from five tritium beta-decay campaigns and an effective-mass upper limit of 0.45 eV at 90% confidence using 259 measurement days and 36 million electrons.","support":[{"end":3472,"quote":"Based on the first five neutrino-mass measurement campaigns, we derive a best-fit value of $m_\\nu^{2} = {-0.14^{+0.13}_{-0.15}}~\\mathrm{eV^2}$, resulting in an upper limit of $m_\\nu < {0.45}~\\mathrm{eV}$ at 90 % confidence level. With six times the statistics of previous data sets, amounting to 36 million electrons collected in 259 measurement days, a substantial reduction of the background level and improved systematic uncertainties, this result tightens KATRIN's previous bound by a factor of almost two.","source_id":"src.neutrino.katrin-259days-mass-2024","source_sha256":"f919827559943755f4f6b64ef18f8a25c8195b2af99ed4c5aeb9ba6a68254c2e","start":2962}],"target_id":"claim.neutrino.katrin-endpoint-bound-259d","target_kind":"node","target_sha256":"b4b8f481e1beaf7bb29caedbb295795fe860e39ca45d8cb0c47a0b9628184e6b"}],"claim.neutrino.planck-bao-mass-sum-2018":[{"id":"assertion.claim.neutrino.planck-bao-mass-sum-2018","scope":{"assumptions":"Cosmological mass-sum inference assumes base ΛCDM and a specified CMB-plus-BAO data combination; upper limits are quoted at 95%.","population":"Cosmological Planck CMB constraints combined with BAO","quantifiers":"Σmν<0.12 eV","time":"Planck 2018 results, abstract of version revised August 2021","uncertainty":"Cannot be interpreted as a direct laboratory neutrino-mass measurement or model-independent limit.","units":"eV; 95% confidence"},"statement":"The Planck 2018 cosmological-parameter analysis reported Σmν<0.12 eV as a 95% upper limit when combined with baryon acoustic oscillation data in its base spatially flat ΛCDM framework.","support":[{"end":4720,"quote":"Combining with BAO we constrain the effective extra relativistic degrees of freedom to be $N_{\\rm eff} = 2.99\\pm 0.17$, and the neutrino mass is tightly constrained to $\\sum m_\\nu< 0.12$eV.","source_id":"src.neutrino.planck-2018-cosmological-parameters","source_sha256":"52f0d5028072a74112be4f3840fab6034f649af14651b3083e6839dfe07dfd0e","start":4531}],"target_id":"claim.neutrino.planck-bao-mass-sum-2018","target_kind":"node","target_sha256":"c67d8d80f235402a28fb7a6c96876af03a0afdc4fb1e76f7a360fcd7cb3a6745"}],"claim.neutrino.planck-prior-ordering-dependence-2019":[{"id":"assertion.claim.neutrino.planck-prior-ordering-dependence-2019","scope":{"assumptions":"Mass hierarchy scenarios impose different mass-sum prior distributions; this is reanalysis, not new independent Planck data.","population":"Cosmological reanalysis of Planck 2018 and specified BAO surveys","quantifiers":"<0.12 degenerate; <0.15 normal; <0.17 inverted eV","time":"2019 report using existing public data","uncertainty":"Values depend on chosen cosmological model and priors, not proof of a mass ordering or inconsistency.","units":"eV; 95% confidence"},"statement":"A Bayesian reanalysis using Planck 2018 CMB plus BOSS DR12, MGS and 6dFGS BAO data reported 95%-confidence neutrino mass-sum limits of 0.12 eV (degenerate masses), 0.15 eV (normal ordering) and 0.17 eV (inverted ordering), attributing their differences to mass-sum priors.","support":[{"end":1359,"quote":"In the minimal $\\Lambda\\textrm{CDM}+\\sum m_{\\nu}$ model with most recent CMB data from Planck 2018 TT,TE,EE, lowE, and lensing; and BAO data from BOSS DR12, MGS, and 6dFGS, we find that at 95\\% C.L. the bounds are: $\\sum m_{\\nu}<0.12$ eV (degenerate), $\\sum m_{\\nu}<0.15$ eV (normal), $\\sum m_{\\nu}<0.17$ eV (inverted). The bounds vary across the different mass orderings due to different priors on $\\sum m_{\\nu}$.","source_id":"src.neutrino.planck-ordering-prior-analysis-2019","source_sha256":"6c50f2ea8a5a92e78db686079a553dbd366d052faed49f0183c5a2056df92449","start":945}],"target_id":"claim.neutrino.planck-prior-ordering-dependence-2019","target_kind":"node","target_sha256":"c3f6f7fec9a7befd9f3d60e1e9fee2adeea1980018a4040140ae116d101397c4"}],"claim.shoes-cepheid-sn-h0-baseline":[{"id":"assert.claim.shoes-cepheid-sn-h0-baseline","scope":{"assumptions":null,"population":"The Cepheid-SN sample analyzed by SH0ES.","quantifiers":"H0=73.04+-1.04 km/s/Mpc","time":null,"uncertainty":"The reported value includes systematics.","units":"km/s/Mpc"},"statement":"The SH0ES analysis reports a baseline Cepheid-SN H0 result of 73.04+-1.04 km/s/Mpc, including systematics.","support":[{"end":2539,"quote":"Our baseline result from the Cepheid-SN sample is H0=73.04+-1.04 km/s/Mpc, which includes systematics and lies near the median of all analysis variants.","source_id":"src-shoes-2112.04510","source_sha256":"74fb661710b934e031f55ff43d685f91c3826fef58e86652e1c334a8fff21a05","start":2387}],"target_id":"claim.shoes-cepheid-sn-h0-baseline","target_kind":"node","target_sha256":"c9876c61085e679f684e7bf6a3e073e9f638f2b875249178fa2573995acf71db"}],"concept.aat.300015647":[{"id":"assertion.concept.aat.300015647","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"African (general, continental cultures) as defined in the captured Getty AAT record 300015647","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African (general, continental cultures) as: Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","support":[{"end":576,"quote":"Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","source_id":"getty-aat.300015647","source_sha256":"2ec3626deb0c99d77082899dd32d65179a7794bac9d263c245ac329ffd9d78ab","start":441}],"target_id":"concept.aat.300015647","target_kind":"node","target_sha256":"80348c5aa535e9c87905e27bd4e317bd7d680fb5766011d97c1c0e993531fe1d"}],"concept.aat.300015649":[{"id":"assertion.concept.aat.300015649","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric African as defined in the captured Getty AAT record 300015649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric African as: Cultures and styles from the prehistoric era in Africa.","support":[{"end":517,"quote":"Cultures and styles from the prehistoric era in Africa.","source_id":"getty-aat.300015649","source_sha256":"167f880872da01d82e1aec50ec8c27b37165fa74a7fddad0cb2734326738e109","start":462}],"target_id":"concept.aat.300015649","target_kind":"node","target_sha256":"18016638b151a4ac6690d262fc36d1536aecc2754798804bd96ee966df5cb3e6"}],"concept.aat.300015650":[{"id":"assertion.concept.aat.300015650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric North African periods as defined in the captured Getty AAT record 300015650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric North African periods as: Periods related to prehistoric North African cultures.","support":[{"end":512,"quote":"Periods related to prehistoric North African cultures.","source_id":"getty-aat.300015650","source_sha256":"69febc61a910ce488993349bf5553337728a4ebb4859ba10da3e5fb7f09998da","start":458}],"target_id":"concept.aat.300015650","target_kind":"node","target_sha256":"3add409f4cb3eb8832e74f5867118ec6b2eee73d4a3b0acb227423b0129a9338"}],"concept.aat.300015667":[{"id":"assertion.concept.aat.300015667","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric Sub-Saharan African periods as defined in the captured Getty AAT record 300015667","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric Sub-Saharan African periods as: Periods related to prehistoric Sub-Saharan African cultures.","support":[{"end":524,"quote":"Periods related to prehistoric Sub-Saharan African cultures.","source_id":"getty-aat.300015667","source_sha256":"9894ca9b4251a8165ddb3348ec6f8016ce50bc9dc83a9d5a50f50767281eea2f","start":464}],"target_id":"concept.aat.300015667","target_kind":"node","target_sha256":"f5089be5aa0242188e9e5347926a9f324e99d450c1cf98f0c7273a505256b1e0"}],"concept.aat.300015690":[{"id":"assertion.concept.aat.300015690","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient African as defined in the captured Getty AAT record 300015690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient African as: Cultures and styles of Africa in ancient times.","support":[{"end":505,"quote":"Cultures and styles of Africa in ancient times.","source_id":"getty-aat.300015690","source_sha256":"450ba8f4901cea095473a92a16eededad0ad75c82f30421a961e42118fdd51ec","start":458}],"target_id":"concept.aat.300015690","target_kind":"node","target_sha256":"34b18c7c0ad44edeab0449e27068a7a4b2ed2cbfa9b75fa58eadfb5049308593"}],"concept.aat.300015692":[{"id":"assertion.concept.aat.300015692","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Central African as defined in the captured Getty AAT record 300015692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Central African as: Cultures and styles of Central Africa in ancient times.","support":[{"end":499,"quote":"Cultures and styles of Central Africa in ancient times.","source_id":"getty-aat.300015692","source_sha256":"19d2efe684a8fd19195cbf47b2054ddb8f4904907d7dd95bb44773d0f2bd1eca","start":444}],"target_id":"concept.aat.300015692","target_kind":"node","target_sha256":"b5649976e1b850c692fbd7584d06b2c8344fb0fa30ddce89e1804dc6c4c866c4"}],"concept.aat.300015702":[{"id":"assertion.concept.aat.300015702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ancient East African as defined in the captured Getty AAT record 300015702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ancient East African as: Cultures and styles of East Africa in ancient times.","support":[{"end":493,"quote":"Cultures and styles of East Africa in ancient times.","source_id":"getty-aat.300015702","source_sha256":"6d8c0365ffedba1633b07023aa5c15dcb7b142beae80048de1da7cd27b512205","start":441}],"target_id":"concept.aat.300015702","target_kind":"node","target_sha256":"273ccacc9c68dd7625dd9827d6bfcbfe0964405feafa78a58ec6b7553df93cd4"}],"concept.aat.300015723":[{"id":"assertion.concept.aat.300015723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient North African as defined in the captured Getty AAT record 300015723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient North African as: Styles and cultures of North Africa in ancient times.","support":[{"end":495,"quote":"Styles and cultures of North Africa in ancient times.","source_id":"getty-aat.300015723","source_sha256":"ca6dd05e9ce0f964032f11decf6609ed85324a5c158ffa9ae927059cc3ef0963","start":442}],"target_id":"concept.aat.300015723","target_kind":"node","target_sha256":"21b5ac94b1c674eedbfbc2b5ec5f557903f38ed247bfe0052d973a30982b7fcd"}],"concept.aat.300015727":[{"id":"assertion.concept.aat.300015727","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Southern African as defined in the captured Getty AAT record 300015727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Southern African as: Cultures and styles of southern Africa in ancient times.","support":[{"end":501,"quote":"Cultures and styles of southern Africa in ancient times.","source_id":"getty-aat.300015727","source_sha256":"32bde60ae9570d284b677a11a1a8eb711bae9beb8186fdff397859d63c01c2a6","start":445}],"target_id":"concept.aat.300015727","target_kind":"node","target_sha256":"dd0fa76e5e458e80cbb7ac4a6a96dc5a100a3892955d012345d52cb99e602e61"}],"concept.aat.300015759":[{"id":"assertion.concept.aat.300015759","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient West African as defined in the captured Getty AAT record 300015759","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient West African as: Cultures and styles of West Africa in ancient times.","support":[{"end":493,"quote":"Cultures and styles of West Africa in ancient times.","source_id":"getty-aat.300015759","source_sha256":"17cb004c095bc5d9fabba004f726b6bb2dae5cb3acc99e2d1535e4e4c1aafbc3","start":441}],"target_id":"concept.aat.300015759","target_kind":"node","target_sha256":"be521c21cdcd3bf619b901015a81a09020555deafb314bfcbbb84337ce7e7257"}],"concept.aat.300016434":[{"id":"assertion.concept.aat.300016434","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eastern African as defined in the captured Getty AAT record 300016434","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eastern African as: Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","support":[{"end":663,"quote":"Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","source_id":"getty-aat.300016434","source_sha256":"899f41cf38927b17fcce05f830829e7a4b55e742bbd8bbd3d3aad6c311d9a795","start":466}],"target_id":"concept.aat.300016434","target_kind":"node","target_sha256":"3b24294a5a4824f94551022f255f33dbaccce9709c70162a6d7f49506055b7d0"}],"concept.aat.300016538":[{"id":"assertion.concept.aat.300016538","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Southern African as defined in the captured Getty AAT record 300016538","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Southern African as: Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","support":[{"end":789,"quote":"Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","source_id":"getty-aat.300016538","source_sha256":"d8db7e95a9d5f9ff4f117f43061e97529a00468508b003047be3d7c3881e1d1c","start":467}],"target_id":"concept.aat.300016538","target_kind":"node","target_sha256":"e07496f19e91f0a5dd7e0e95b16016876ed736cafe6826a61a1ce644d55cc744"}],"concept.aat.300016586":[{"id":"assertion.concept.aat.300016586","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"North African as defined in the captured Getty AAT record 300016586","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","support":[{"end":566,"quote":"Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","source_id":"getty-aat.300016586","source_sha256":"5ab820c8299adc4a4506352fa70c238ac6d44a55d6f4bfa1952b699f1f717e2c","start":464}],"target_id":"concept.aat.300016586","target_kind":"node","target_sha256":"788305d3906d48d5b290f6458b0f056bc24443cc26ccb0f5de797e82c493e316"}],"concept.aat.300016598":[{"id":"assertion.concept.aat.300016598","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pole Style as defined in the captured Getty AAT record 300016598","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pole Style as: Style of African sculpture, typically elongated, severe, and abstract-looking.","support":[{"end":518,"quote":"Style of African sculpture, typically elongated, severe, and abstract-looking.","source_id":"getty-aat.300016598","source_sha256":"0b330563bd1a488507e2efbd4010729f2fc2cc1613892d83b93e890add69d864","start":440}],"target_id":"concept.aat.300016598","target_kind":"node","target_sha256":"e5b439fdf81358e27adbfafdfc1e6a7ff4e91dad89c4218bb85ac37d9ed64bee"}],"concept.aat.300016600":[{"id":"assertion.concept.aat.300016600","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Round Style as defined in the captured Getty AAT record 300016600","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Round Style as: Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","support":[{"end":608,"quote":"Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","source_id":"getty-aat.300016600","source_sha256":"0d0561174ff464cd9a2f0686339a1eb866a1dda18ca1ad39785ddf9bfbff891f","start":441}],"target_id":"concept.aat.300016600","target_kind":"node","target_sha256":"714304b5319e25741c812c7ff6226e07174f543d151474f50a93e7490abae267"}],"concept.aat.300016617":[{"id":"assertion.concept.aat.300016617","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"The Americas as defined in the captured Getty AAT record 300016617","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.","support":[{"end":485,"quote":"Refers to a style region encompassing North, Central and South America.","source_id":"getty-aat.300016617","source_sha256":"9847538c442bcb1ce67afbd1a48cc3303857c93d3d5323033e62a537f6366f35","start":414}],"target_id":"concept.aat.300016617","target_kind":"node","target_sha256":"5b9da19f89fbf057710aedec341f339edaac7db56af3f5442da3cb826ec83449"}],"concept.aat.300017437":[{"id":"assertion.concept.aat.300017437","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Native American as defined in the captured Getty AAT record 300017437","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Native American as: Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis. For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","support":[{"end":964,"quote":"Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis.  For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","source_id":"getty-aat.300017437","source_sha256":"da456339c29f293ddf6d5188596921b17ce440c51cd9580fc99cb45e662963f9","start":431}],"target_id":"concept.aat.300017437","target_kind":"node","target_sha256":"261a8433990642becc387ff3b8d01b7fd1cf53a0d71fdc686a42ba8d898d5250"}],"concept.aat.300018115":[{"id":"assertion.concept.aat.300018115","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern American as defined in the captured Getty AAT record 300018115","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern American as: Styles, periods, cultures, and movements of America in modern times.","support":[{"end":500,"quote":"Styles, periods, cultures, and movements of  America in modern times.","source_id":"getty-aat.300018115","source_sha256":"6aa1dc8c75a40fca0329b7e7d77e2a22e73cc1c7a9cf01728d62fe7a5b087c99","start":431}],"target_id":"concept.aat.300018115","target_kind":"node","target_sha256":"37dc08f199df2d9f7ba00d80816f039a6e52929bf62ae355c18f71f48247a928"}],"concept.aat.300018279":[{"id":"assertion.concept.aat.300018279","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Asian as defined in the captured Getty AAT record 300018279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Asian as: Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","support":[{"end":705,"quote":"Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","source_id":"getty-aat.300018279","source_sha256":"ab232c54bc206c34be82fe89cf5508c138dc4b570eea2f5558c20c7ac9014528","start":407}],"target_id":"concept.aat.300018279","target_kind":"node","target_sha256":"21ba97ae4569df00f71f03e3280bdd0ef81ce4d4adf30fbc217f84d19eaaad6a"}],"concept.aat.300018704":[{"id":"assertion.concept.aat.300018704","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indonesian as defined in the captured Getty AAT record 300018704","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indonesian as: Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","support":[{"end":1320,"quote":"Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","source_id":"getty-aat.300018704","source_sha256":"b8595cca9cfc8b61bfd04db42f7a9902de6866ed84f9c655a111f8c3189ff36e","start":397}],"target_id":"concept.aat.300018704","target_kind":"node","target_sha256":"b4f222662568f35948ffb9f6b249b9ef78fc2470fd216ea626297ebbad281dee"}],"concept.aat.300018773":[{"id":"assertion.concept.aat.300018773","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"Siberian (culture or style) as defined in the captured Getty AAT record 300018773","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Siberian (culture or style) as: Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","support":[{"end":682,"quote":"Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","source_id":"getty-aat.300018773","source_sha256":"aba4b77ce9256425bd93c4eae183c7b63f900b62045055f854e5276f4bb1b283","start":436}],"target_id":"concept.aat.300018773","target_kind":"node","target_sha256":"454e88431e7695215c7807502545b53e7b996d0762580859cdd067e18e7ad63f"}],"concept.aat.300018775":[{"id":"assertion.concept.aat.300018775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Afanasievo as defined in the captured Getty AAT record 300018775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Afanasievo as: Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE. Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","support":[{"end":792,"quote":"Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE.  Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","source_id":"getty-aat.300018775","source_sha256":"85d97e4bd3dbda320d6faee11a9e6ee2d38dc2dae6bc228f1062b1b862d9190d","start":409}],"target_id":"concept.aat.300018775","target_kind":"node","target_sha256":"7d76dc3e473c1ed8c36a2c97f832b3be0667d3e46a0db27e76042fdc67a33a78"}],"concept.aat.300018777":[{"id":"assertion.concept.aat.300018777","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Okunev as defined in the captured Getty AAT record 300018777","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Okunev as: Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","support":[{"end":644,"quote":"Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","source_id":"getty-aat.300018777","source_sha256":"d873fdf63e5dcf1b21db7dbb8c8bb2731deeb4118fba0689286f6ccdd7aa7411","start":405}],"target_id":"concept.aat.300018777","target_kind":"node","target_sha256":"05070b44cbf72e4908aeef3fb404f3ae03993f423cccd9a9cf5cc052c8d74403"}],"concept.aat.300018778":[{"id":"assertion.concept.aat.300018778","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Andronovo as defined in the captured Getty AAT record 300018778","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Andronovo as: Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","support":[{"end":719,"quote":"Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","source_id":"getty-aat.300018778","source_sha256":"e3726d94b33565d32b058e7e36879a3c8330cae9088cbeae9a1d10d3b65d93ad","start":408}],"target_id":"concept.aat.300018778","target_kind":"node","target_sha256":"5c0df28d4a7eb49e7f8b7b369a7e0f9e252cd712b6070c15813f204bbeaf5ec7"}],"concept.aat.300018779":[{"id":"assertion.concept.aat.300018779","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Karasuk as defined in the captured Getty AAT record 300018779","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Karasuk as: Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","support":[{"end":732,"quote":"Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","source_id":"getty-aat.300018779","source_sha256":"593d79645a3b0635731e91353b5151026491014fbd37edf012a9d969da81c4d0","start":406}],"target_id":"concept.aat.300018779","target_kind":"node","target_sha256":"a1f0868c397448dfc080fd95df742151d70de1ed3d8c89728358dd5aa26741e5"}],"concept.aat.300018803":[{"id":"assertion.concept.aat.300018803","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Altai as defined in the captured Getty AAT record 300018803","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Altai as: Style and culture of the mountain range running along border shared by China and Mongolia.","support":[{"end":494,"quote":"Style and culture of the mountain range running along border shared by China and Mongolia.","source_id":"getty-aat.300018803","source_sha256":"d8d77dcfbcfe7195f9e6e8207da0f636dee3db37701e240e78a2bdc739d0ade4","start":404}],"target_id":"concept.aat.300018803","target_kind":"node","target_sha256":"5e865f19239fa6bef75d10bd6b530ad05d736041ed3a7fed199f8ee8d9382da6"}],"concept.aat.300019068":[{"id":"assertion.concept.aat.300019068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sri Lankan as defined in the captured Getty AAT record 300019068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sri Lankan as: Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","support":[{"end":667,"quote":"Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","source_id":"getty-aat.300019068","source_sha256":"920e59d2c8cdb75f8f90fd178abf4a02351fe55ddf946b3a8d500862c6942716","start":393}],"target_id":"concept.aat.300019068","target_kind":"node","target_sha256":"6421c11895835950b0bdedd5846f890b228addb62dfa71b687b1306401f3f702"}],"concept.aat.300019088":[{"id":"assertion.concept.aat.300019088","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burmese as defined in the captured Getty AAT record 300019088","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burmese as: Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","support":[{"end":766,"quote":"Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","source_id":"getty-aat.300019088","source_sha256":"a2824a109be5022ceb32d1b01299ab7c451a0d48b005942537cee66ea67e65b2","start":394}],"target_id":"concept.aat.300019088","target_kind":"node","target_sha256":"b7a61eb139f63d529961de4e73cdb71bfded04a1b5cc3ccc9fec9b674f988d21"}],"concept.aat.300019104":[{"id":"assertion.concept.aat.300019104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cambodian as defined in the captured Getty AAT record 300019104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cambodian as: Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","support":[{"end":764,"quote":"Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","source_id":"getty-aat.300019104","source_sha256":"7ab6b53b698a96c9e4cc73e9fbcb2007b6c054e2d4cb810cf3a122cc5f91c34f","start":396}],"target_id":"concept.aat.300019104","target_kind":"node","target_sha256":"ea84786f9598202d5d2b01796175114b32ae91cab3fbd3a5f87c14fd8682dad0"}],"concept.aat.300019255":[{"id":"assertion.concept.aat.300019255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Western World as defined in the captured Getty AAT record 300019255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Western World as: Refers to a style region encompassing the Mediterranean and the Occident.","support":[{"end":494,"quote":"Refers to a style region encompassing the Mediterranean and the Occident.","source_id":"getty-aat.300019255","source_sha256":"f17b7134905e97073c0eefb8fd01b1652e8b96b7c3de07d6261892429ca4fc2c","start":421}],"target_id":"concept.aat.300019255","target_kind":"node","target_sha256":"d39015f4985ea639a4fce4a6f46d267021040c2ff96af91a2655b0b6aa760605"}],"concept.aat.300019257":[{"id":"assertion.concept.aat.300019257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric as defined in the captured Getty AAT record 300019257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric as: Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","support":[{"end":630,"quote":"Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","source_id":"getty-aat.300019257","source_sha256":"b4618af89654884a5be327c89267fba40b271fc8a410abc9960c7a1ae90ca334","start":418}],"target_id":"concept.aat.300019257","target_kind":"node","target_sha256":"bfbf84883eca5565ddaa54c23eba12f2b771986664f0caa85025642794a766c5"}],"concept.aat.300019258":[{"id":"assertion.concept.aat.300019258","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Paleolithic as defined in the captured Getty AAT record 300019258","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Paleolithic as: Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves. Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","support":[{"end":954,"quote":"Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves.  Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","source_id":"getty-aat.300019258","source_sha256":"65b625c3c8690c2e016dfe675d2211455ffbb5f5d0cda2d9e07dd28f4f34f942","start":403}],"target_id":"concept.aat.300019258","target_kind":"node","target_sha256":"2e9414a1fb7c545f524812d6e0383160975dcdc5cfe8941d2a621f341f94ea64"}],"concept.aat.300019264":[{"id":"assertion.concept.aat.300019264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mesolithic as defined in the captured Getty AAT record 300019264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mesolithic as: Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","support":[{"end":1251,"quote":"Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","source_id":"getty-aat.300019264","source_sha256":"3ad1c696d6ca523999f23a2e55e113f9979b4c4ece36a76d1e2145772b63335d","start":402}],"target_id":"concept.aat.300019264","target_kind":"node","target_sha256":"bb9aa118a82c752d515df95e4551ae9e4867193dff171481736eba0ddacf447f"}],"concept.aat.300019267":[{"id":"assertion.concept.aat.300019267","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neolithic as defined in the captured Getty AAT record 300019267","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neolithic as: Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","support":[{"end":958,"quote":"Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","source_id":"getty-aat.300019267","source_sha256":"b6f5c9afc4b5e1587d9d87894a87419dcfc5152759c99122a4d9f8244c10e1e1","start":401}],"target_id":"concept.aat.300019267","target_kind":"node","target_sha256":"cb9b3cb007199b318bdea7fbedcac0d47fa678817a130d8939aa4a295eb5fa64"}],"concept.aat.300019273":[{"id":"assertion.concept.aat.300019273","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Chalcolithic as defined in the captured Getty AAT record 300019273","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Chalcolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","support":[{"end":1065,"quote":"Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","source_id":"getty-aat.300019273","source_sha256":"4407e6a125f19e0c680465fbce3ad38f07071c450671c0f91388cf02bcb88b3b","start":439}],"target_id":"concept.aat.300019273","target_kind":"node","target_sha256":"fc1665741ea944e833ffc6a23fa4d85c3a96642ab670b57b39273a36fc0ec6a9"}],"concept.aat.300019275":[{"id":"assertion.concept.aat.300019275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Bronze Age as defined in the captured Getty AAT record 300019275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","support":[{"end":1040,"quote":"Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons.  It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe.  There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","source_id":"getty-aat.300019275","source_sha256":"7bd5b1f9a9aef0029b37d0d6be705bf5eca26abb9d9a8fc93436ee93aaa95df7","start":435}],"target_id":"concept.aat.300019275","target_kind":"node","target_sha256":"749f7d35c5d27f9e0585710c847aecbbfeb7c4f3f1ef0f62398e7a01894d2e79"}],"concept.aat.300019276":[{"id":"assertion.concept.aat.300019276","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Bronze Age as defined in the captured Getty AAT record 300019276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Bronze Age as: Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","support":[{"end":937,"quote":"Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","source_id":"getty-aat.300019276","source_sha256":"83b3c510807642edf2d0d2717fc8fe0b13c9ee38d6f106074263a5decf343bd2","start":409}],"target_id":"concept.aat.300019276","target_kind":"node","target_sha256":"6b4a79ea0909a342d540f6d4a4280e88df077af48f97eeb6bf36f1d4543d833e"}],"concept.aat.300019277":[{"id":"assertion.concept.aat.300019277","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Bronze Age as defined in the captured Getty AAT record 300019277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Bronze Age as: Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","support":[{"end":809,"quote":"Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","source_id":"getty-aat.300019277","source_sha256":"cb338ba4bcb9074b765796b590edf2f1218b120e52a9fcc27554238aa869aa1c","start":410}],"target_id":"concept.aat.300019277","target_kind":"node","target_sha256":"89dd60b8757eedc2662683c6363d3bba61a8d997dd33ba00ea453fb711bbf61d"}],"concept.aat.300019278":[{"id":"assertion.concept.aat.300019278","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Bronze Age as defined in the captured Getty AAT record 300019278","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","support":[{"end":825,"quote":"Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","source_id":"getty-aat.300019278","source_sha256":"82afa15316ebf455f870f7119004b886717fe87acf6223b51a9a28a3ed8272fa","start":408}],"target_id":"concept.aat.300019278","target_kind":"node","target_sha256":"cfe9388dc5280e8e4cbf449f7cc54eab7012794aca13ef12137880f2c9096293"}],"concept.aat.300019279":[{"id":"assertion.concept.aat.300019279","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Iron Age as defined in the captured Getty AAT record 300019279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Iron Age as: Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements. It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","support":[{"end":1063,"quote":"Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836.  Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements.  It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","source_id":"getty-aat.300019279","source_sha256":"7bdec4edb2231203676846ee83849f4dfc339df9dbfbce910bab6376cb5de912","start":433}],"target_id":"concept.aat.300019279","target_kind":"node","target_sha256":"0bc353ee5f83c19fecb7df6c58d14ac8765b44dd2f115c3bc963252780cfd08e"}],"concept.aat.300019280":[{"id":"assertion.concept.aat.300019280","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protohistoric as defined in the captured Getty AAT record 300019280","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines protohistoric as: Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","support":[{"end":635,"quote":"Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","source_id":"getty-aat.300019280","source_sha256":"94bd2dc4aedd072a970b8ba5f1f3cb1a662e589a886994d2ba18f743569cd1ad","start":420}],"target_id":"concept.aat.300019280","target_kind":"node","target_sha256":"f5f34a441b39c12b43179948fa6301134c0ca58ef9b0648d372fa91c3f5979c3"}],"concept.aat.300020656":[{"id":"assertion.concept.aat.300020656","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"European as defined in the captured Getty AAT record 300020656","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines European as: Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","support":[{"end":662,"quote":"Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","source_id":"getty-aat.300020656","source_sha256":"e577f8791b759f0e97066f7fa4b5205c6fccaa24b38c4de965b8c0cbc3e68e8d","start":410}],"target_id":"concept.aat.300020656","target_kind":"node","target_sha256":"203e8d80c8892c543683a9048d6b82dd58a61fef4bf55a07cb8a681597364cea"}],"concept.aat.300021516":[{"id":"assertion.concept.aat.300021516","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Islamic World, The as defined in the captured Getty AAT record 300021516","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Islamic World, The as: Refers to a style region encompassing the regions where Islam is prevalent.","support":[{"end":495,"quote":"Refers to a style region encompassing the regions where Islam is prevalent.","source_id":"getty-aat.300021516","source_sha256":"8b9c114ca0527de5a476655257a328ba6f9624f0f8deb710380b701fa712f753","start":420}],"target_id":"concept.aat.300021516","target_kind":"node","target_sha256":"23768936c1ddc62fdb3c25f322738f3298b4f64286fae9fcd9557883fe1a55bf"}],"concept.aat.300021854":[{"id":"assertion.concept.aat.300021854","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic as defined in the captured Getty AAT record 300021854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic as: Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","support":[{"end":603,"quote":"Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","source_id":"getty-aat.300021854","source_sha256":"72a53a5b4b7766d25f22673f868a29f56aaa19a93c7315c1252c47bd1a835255","start":409}],"target_id":"concept.aat.300021854","target_kind":"node","target_sha256":"48b3f9287e6221ced013ddad42ce544c125ea7ecb063784d3f618b240e736bd2"}],"concept.aat.300021861":[{"id":"assertion.concept.aat.300021861","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Australian as defined in the captured Getty AAT record 300021861","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Australian as: Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","support":[{"end":656,"quote":"Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","source_id":"getty-aat.300021861","source_sha256":"35a31f72c3215e202ea1f93aeb1fbdd6f94fbf534b497c4e3b701e211266423c","start":421}],"target_id":"concept.aat.300021861","target_kind":"node","target_sha256":"62a9862b7186f059773dc00a1a19442df976cb584d3c8ffc29c5d4bf04a8921d"}],"concept.aat.300021867":[{"id":"assertion.concept.aat.300021867","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Melanesian as defined in the captured Getty AAT record 300021867","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Melanesian as: Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","support":[{"end":638,"quote":"Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","source_id":"getty-aat.300021867","source_sha256":"1a97d4c97de7a84d96916c7f153a03d2a4e8ac7c256ecd5484b62fc914894a8d","start":421}],"target_id":"concept.aat.300021867","target_kind":"node","target_sha256":"64a3565defef0e157bf156714c4ff5f2474e0ce5f06377a280778c0c23f7ca58"}],"concept.aat.300021944":[{"id":"assertion.concept.aat.300021944","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Polynesian as defined in the captured Getty AAT record 300021944","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Polynesian as: Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","support":[{"end":957,"quote":"Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","source_id":"getty-aat.300021944","source_sha256":"a8bd5d02a7b782b3458e33f13021329835c452c1fceac915140beaffb856df8c","start":421}],"target_id":"concept.aat.300021944","target_kind":"node","target_sha256":"90d41ae1f8aaebd09e221766dde4dc76e522586081ad0cf228c6e04e4227f660"}],"concept.aat.300022208":[{"id":"assertion.concept.aat.300022208","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Postmodern as defined in the captured Getty AAT record 300022208","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Postmodern as: Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","support":[{"end":1865,"quote":"Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","source_id":"getty-aat.300022208","source_sha256":"c562c803b5df56a666d68f999ca644c0e7d2b60afb1c0ffc77d64895d107ec19","start":460}],"target_id":"concept.aat.300022208","target_kind":"node","target_sha256":"5a6b1c613979bff3a2736efb085fb421abf1fb27f81a3d69497c37c529feae26"}],"concept.aat.300054140":[{"id":"assertion.concept.aat.300054140","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"performing arts (discipline) as defined in the captured Getty AAT record 300054140","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines performing arts (discipline) as: Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","support":[{"end":630,"quote":"Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","source_id":"getty-aat.300054140","source_sha256":"22181850b676388711e4e0c358d6ef943bf7a1bf2995d499171e6a7e98ec6e53","start":441}],"target_id":"concept.aat.300054140","target_kind":"node","target_sha256":"b5f31ed342620c214964ea83b2e1f54a1405fd6e292eec385b7ebc3ce1f187cb"}],"concept.aat.300054146":[{"id":"assertion.concept.aat.300054146","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"music (performing arts genre) as defined in the captured Getty AAT record 300054146","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music (performing arts genre) as: Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","support":[{"end":716,"quote":"Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","source_id":"getty-aat.300054146","source_sha256":"8f52b3cdc6872fdc932cd9b90d8077ca534bf09e5c9c0addc821f22685f06c10","start":467}],"target_id":"concept.aat.300054146","target_kind":"node","target_sha256":"86345d37dc813994a290cdd42baa3ad878f08aedc0851de9404717fb3e92ea01"}],"concept.aat.300054154":[{"id":"assertion.concept.aat.300054154","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"visual arts (discipline) as defined in the captured Getty AAT record 300054154","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines visual arts (discipline) as: Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","support":[{"end":722,"quote":"Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","source_id":"getty-aat.300054154","source_sha256":"6b8ef950980a6f9ee211d1fd435458423c45d70eccb971d2f20462356d14fc02","start":437}],"target_id":"concept.aat.300054154","target_kind":"node","target_sha256":"e5dbd3e4eba67839496d2b2c67a36b98674eef421155ad7a5314d97155288403"}],"concept.aat.300054156":[{"id":"assertion.concept.aat.300054156","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"architecture (discipline) as defined in the captured Getty AAT record 300054156","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architecture (discipline) as: The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations. For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","support":[{"end":753,"quote":"The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations.  For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","source_id":"getty-aat.300054156","source_sha256":"3130164c1916031a02a8e89cb685d4d6c0090d34c7d3a15fdba797407908b4a0","start":432}],"target_id":"concept.aat.300054156","target_kind":"node","target_sha256":"13f12ba2e43dec566cd879c50f4ac2a8295c6353a24b2711bb76c63191afe168"}],"concept.aat.300054159":[{"id":"assertion.concept.aat.300054159","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"naval architecture as defined in the captured Getty AAT record 300054159","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines naval architecture as: Art or science of designing and building ships and other waterborne craft.","support":[{"end":501,"quote":"Art or science of designing and building ships and other waterborne craft.","source_id":"getty-aat.300054159","source_sha256":"84e9c5006b2b13b25f7b7d74b00ddff86dcee107504fc1ff436b34a1737e7f03","start":427}],"target_id":"concept.aat.300054159","target_kind":"node","target_sha256":"1dfb6fdcca2acd926ab3aac4321b302446f69c13e61f085f5600666b4af21eba"}],"concept.aat.300054171":[{"id":"assertion.concept.aat.300054171","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"design (discipline) as defined in the captured Getty AAT record 300054171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines design (discipline) as: Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","support":[{"end":575,"quote":"Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","source_id":"getty-aat.300054171","source_sha256":"c76250c38c17f37eeb87cef16e0cae0af7f16ff1d02a3f351b0573075577f1e0","start":433}],"target_id":"concept.aat.300054171","target_kind":"node","target_sha256":"ee8a693c79ff8793d270974cc0949e7592a3175591980dfcdbc39d3e11991b0d"}],"concept.aat.300054181":[{"id":"assertion.concept.aat.300054181","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"graphic design as defined in the captured Getty AAT record 300054181","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","support":[{"end":732,"quote":"The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","source_id":"getty-aat.300054181","source_sha256":"759b697c8a8294e91d62b6c667a3a04b2e6178e93c2d7831f5336910a5dd7c33","start":417}],"target_id":"concept.aat.300054181","target_kind":"node","target_sha256":"6914920cbf19d4291c8b48a6978059f1f3955e3b9c1f890656f10a4a967a3bef"}],"concept.aat.300054183":[{"id":"assertion.concept.aat.300054183","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"industrial design as defined in the captured Getty AAT record 300054183","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines industrial design as: The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","support":[{"end":536,"quote":"The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","source_id":"getty-aat.300054183","source_sha256":"430024b8320a603eb7f8e0f106e0f4855bd45ef35ca8cb4d04102390f2f3156e","start":420}],"target_id":"concept.aat.300054183","target_kind":"node","target_sha256":"1d5a590b3d3600c9dbdcb7037020a6aba82abb3dbfae2c8a5b1f4df30b0708d5"}],"concept.aat.300054184":[{"id":"assertion.concept.aat.300054184","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"interior design as defined in the captured Getty AAT record 300054184","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines interior design as: Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","support":[{"end":1036,"quote":"Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","source_id":"getty-aat.300054184","source_sha256":"ca4720fe0751662f84360d4c01fee409be632fc3f4ee470e8af7ea4d730afc34","start":418}],"target_id":"concept.aat.300054184","target_kind":"node","target_sha256":"f9a943d873069ca8997f8a5aa5bb51226e0f112686d951f50db76098dc3fe32d"}],"concept.aat.300054232":[{"id":"assertion.concept.aat.300054232","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"arts-related disciplines as defined in the captured Getty AAT record 300054232","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arts-related disciplines as: Branches of learning devoted to the arts.","support":[{"end":465,"quote":"Branches of learning devoted to the arts.","source_id":"getty-aat.300054232","source_sha256":"62206abba6a80791c9aa0e1ca0c9783f3761d219250f2146a942183246da1163","start":424}],"target_id":"concept.aat.300054232","target_kind":"node","target_sha256":"81f9a40a8bc525b8ca461c87dffd3edcad0eeb9737a63beacfb6de87e09157bd"}],"concept.aat.300054236":[{"id":"assertion.concept.aat.300054236","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art therapy as defined in the captured Getty AAT record 300054236","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art therapy as: Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","support":[{"end":710,"quote":"Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","source_id":"getty-aat.300054236","source_sha256":"150b469b086a6a60c3cfdf8bb60f0c62e4bb9c0ff5adc82c1d6349cffe6a8d52","start":425}],"target_id":"concept.aat.300054236","target_kind":"node","target_sha256":"cc9b94b6e70fa023e8e625b695fe273e8d4560f8d00f4d4c06c0539a6eae96db"}],"concept.aat.300054269":[{"id":"assertion.concept.aat.300054269","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"syntax as defined in the captured Getty AAT record 300054269","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines syntax as: That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","support":[{"end":597,"quote":"That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","source_id":"getty-aat.300054269","source_sha256":"0ee25c3be069b7661846725ee526575f2767d38b891db45cd76d420a3fd0bc9e","start":409}],"target_id":"concept.aat.300054269","target_kind":"node","target_sha256":"a5e2dc011164a5f120cefaac4a572cfec60e5f8d51d9ea939725cd3f219497a5"}],"concept.aat.300054272":[{"id":"assertion.concept.aat.300054272","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"toponymy as defined in the captured Getty AAT record 300054272","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines toponymy as: Etymological study of the place-names of a region or language.","support":[{"end":470,"quote":"Etymological study of the place-names of a region or language.","source_id":"getty-aat.300054272","source_sha256":"b162efd0cad53a1a05247d23db3ba73349608157f1799ac91d2854c7d355868d","start":408}],"target_id":"concept.aat.300054272","target_kind":"node","target_sha256":"56cd2829bf52169de2ae0acbff801d40d6e21e0b312e4d156a01b645b0f77594"}],"concept.aat.300054274":[{"id":"assertion.concept.aat.300054274","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"comparative literature as defined in the captured Getty AAT record 300054274","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines comparative literature as: The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two literatures.","support":[{"end":609,"quote":"The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two  literatures.","source_id":"getty-aat.300054274","source_sha256":"9859334c59ad470462293a3cfdc2e68e0ab763c07eb450a2919a6f193003cbb9","start":408}],"target_id":"concept.aat.300054274","target_kind":"node","target_sha256":"68281aabd365af543ff9dc9304faeac2d911cc635590d83331d9ac720f645696"}],"concept.aat.300054299":[{"id":"assertion.concept.aat.300054299","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<religion and related disciplines> as defined in the captured Getty AAT record 300054299","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <religion and related disciplines> as: The discipline of religion and closely related disciplines.","support":[{"end":483,"quote":"The discipline of religion and closely related disciplines.","source_id":"getty-aat.300054299","source_sha256":"edfd4e5a8de4a30c69f608e7f6b30c676b846d102094f320f7553d547e74d2cb","start":424}],"target_id":"concept.aat.300054299","target_kind":"node","target_sha256":"5e025370f89df592158faf4308212bd1b79d405de9704c4d0d48b25251dd81bd"}],"concept.aat.300054300":[{"id":"assertion.concept.aat.300054300","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"religion (discipline) as defined in the captured Getty AAT record 300054300","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religion (discipline) as: Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","support":[{"end":544,"quote":"Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","source_id":"getty-aat.300054300","source_sha256":"d292170a9c59b95b6c7a6f2d6966ff55602fe4512ee1608709557b0258504d62","start":425}],"target_id":"concept.aat.300054300","target_kind":"node","target_sha256":"2f1c78d28493d67dcd41a79b9057989d159b0e429734d822642fa2a048a916f1"}],"concept.aat.300054302":[{"id":"assertion.concept.aat.300054302","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"comparative religion as defined in the captured Getty AAT record 300054302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines comparative religion as: Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","support":[{"end":914,"quote":"Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","source_id":"getty-aat.300054302","source_sha256":"c88154f11683615a6ded09714d2195dc61b2572035b0526c8fdc3d0b6dee871e","start":435}],"target_id":"concept.aat.300054302","target_kind":"node","target_sha256":"e749c6f2402284307e5df362385b4abb1e1d2d4758e72e7064406bc7ab154789"}],"concept.aat.300054303":[{"id":"assertion.concept.aat.300054303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophy of religion as defined in the captured Getty AAT record 300054303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophy of religion as: The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","support":[{"end":623,"quote":"The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","source_id":"getty-aat.300054303","source_sha256":"351aa7e94930bf1b69e4effe559357eacd232034515bf572bdad969cd86dfb31","start":437}],"target_id":"concept.aat.300054303","target_kind":"node","target_sha256":"49214031ddd2cf1336f0ef2503c9c1eb37e8a80c8a46f357167e164fc4da14f6"}],"concept.aat.300054304":[{"id":"assertion.concept.aat.300054304","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"psychology of religion as defined in the captured Getty AAT record 300054304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines psychology of religion as: Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","support":[{"end":577,"quote":"Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","source_id":"getty-aat.300054304","source_sha256":"5f7711f837f22bc21eb343b3cda96aad1babd6a91b08fa8f87153ac4268702e8","start":437}],"target_id":"concept.aat.300054304","target_kind":"node","target_sha256":"2240af14f16dea0338835011175e6fe36a6863ede10ef83b7cb3fd17bec7b576"}],"concept.aat.300054305":[{"id":"assertion.concept.aat.300054305","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sociology of religion as defined in the captured Getty AAT record 300054305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sociology of religion as: Study of religion using the sociological method of approach.","support":[{"end":496,"quote":"Study of religion using the sociological method of approach.","source_id":"getty-aat.300054305","source_sha256":"bd6c6326ec25c7b7857247f4b376f94825e31ed0cd082a830cf77b820d551ee8","start":436}],"target_id":"concept.aat.300054305","target_kind":"node","target_sha256":"a3536982b8c47d50be78be0c0cbb20b57f25368f441615971f6de4242f5a342e"}],"concept.aat.300054306":[{"id":"assertion.concept.aat.300054306","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religion-related disciplines as defined in the captured Getty AAT record 300054306","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religion-related disciplines as: Branches of learning devoted to religion.","support":[{"end":473,"quote":"Branches of learning devoted to religion.","source_id":"getty-aat.300054306","source_sha256":"22afde011e7ba258fce550711c6ee6cb091d8bcbce144ae998de8745bc03ab1b","start":432}],"target_id":"concept.aat.300054306","target_kind":"node","target_sha256":"f8a0e252047047464379bb011595e0f0837a68884f63f9d42b40fa1fa7576ac8"}],"concept.aat.300054672":[{"id":"assertion.concept.aat.300054672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museum administration as defined in the captured Getty AAT record 300054672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museum administration as: The study and practice of the administration of museums.","support":[{"end":456,"quote":"The study and practice of the administration of museums.","source_id":"getty-aat.300054672","source_sha256":"24fbb6c3a1b2d5f9a283afd7d3fdee34df2a90606b8e82c026485006bbe731c2","start":400}],"target_id":"concept.aat.300054672","target_kind":"node","target_sha256":"aed82efa38c90e4a0f84b41aa3a4b928cab4e42426641f9a76203cec6d77e208"}],"concept.aat.300055126":[{"id":"assertion.concept.aat.300055126","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"Associated Concepts as defined in the captured Getty AAT record 300055126","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Associated Concepts as: The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","support":[{"end":1184,"quote":"The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","source_id":"getty-aat.300055126","source_sha256":"c84931c6af9ce5b52587cc7c6361627b42e3c393317e85c7f465a3bdd6aee3e4","start":364}],"target_id":"concept.aat.300055126","target_kind":"node","target_sha256":"2cdcfc3203302300f3ea61aa35f26a0ac7e6b2b6c34b128d2268e47921b1b9c0"}],"concept.aat.300055156":[{"id":"assertion.concept.aat.300055156","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"empathy as defined in the captured Getty AAT record 300055156","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines empathy as: The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","support":[{"end":518,"quote":"The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","source_id":"getty-aat.300055156","source_sha256":"94f9778c7339e5dad271b48d3ae1a35eea7eb44ecbc5fb636817bd2ae7f448de","start":411}],"target_id":"concept.aat.300055156","target_kind":"node","target_sha256":"a74515d1db185dc2e6841cbe37746a76fb66f4f37919718b6ea9e96494175e6a"}],"concept.aat.300055826":[{"id":"assertion.concept.aat.300055826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mimesis as defined in the captured Getty AAT record 300055826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines mimesis as: Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","support":[{"end":508,"quote":"Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","source_id":"getty-aat.300055826","source_sha256":"78817aa0ea56d3eda46e5462beb177e309647b55909a9a2daed8d52ce95f9bfc","start":411}],"target_id":"concept.aat.300055826","target_kind":"node","target_sha256":"3d5bde483c123143992df4fa5702fcfb683cf368d34ae77d9670fe65613a32e4"}],"concept.aat.300055829":[{"id":"assertion.concept.aat.300055829","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Picturesque, the as defined in the captured Getty AAT record 300055829","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Picturesque, the as: Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","support":[{"end":774,"quote":"Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","source_id":"getty-aat.300055829","source_sha256":"9cbc360770154a3456868184d95c216ec9cb435bfa3831a8fd661f8bc3960467","start":420}],"target_id":"concept.aat.300055829","target_kind":"node","target_sha256":"2677a12b09d3b314a954d0e7616ec9c029e5eba7ef57aa63cd33a1758a0dbc2f"}],"concept.aat.300055837":[{"id":"assertion.concept.aat.300055837","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sublime, the as defined in the captured Getty AAT record 300055837","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sublime, the as: The conception or expression of awe-inspiring grandeur in a work of art.","support":[{"end":488,"quote":"The conception or expression of awe-inspiring grandeur in a work of art.","source_id":"getty-aat.300055837","source_sha256":"00520609536328669107fe08cdb0866f2d7c0d0caad6ab21224e69fa8ab8d345","start":416}],"target_id":"concept.aat.300055837","target_kind":"node","target_sha256":"4444bab1e82ab96371052d10b6ffa78ffc21c16b45db5c199ef9beec8a9c1db2"}],"concept.aat.300055845":[{"id":"assertion.concept.aat.300055845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ugliness as defined in the captured Getty AAT record 300055845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ugliness as: That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","support":[{"end":602,"quote":"That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","source_id":"getty-aat.300055845","source_sha256":"386e94963c0ea949f1096f1eb699be217b8791b64988af04f613b2da6a9d627b","start":412}],"target_id":"concept.aat.300055845","target_kind":"node","target_sha256":"19360cfb801d2942192c07fba00214ad639e4f0b34949238ce2cd3d2c56995da"}],"concept.aat.300055938":[{"id":"assertion.concept.aat.300055938","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophical concepts as defined in the captured Getty AAT record 300055938","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophical concepts as: Concepts related to knowledge, learning, and scholarship.","support":[{"end":439,"quote":"Concepts related to knowledge, learning, and scholarship.","source_id":"getty-aat.300055938","source_sha256":"952c76077fdd368972c603d530a9cbb4498e29d6d5d509444cb5cf9e0a1ecfb6","start":382}],"target_id":"concept.aat.300055938","target_kind":"node","target_sha256":"06aa6d2368d1e345a3f97d4ac9c5ce196571d92ae91a8ae3ee8941dac8bc011f"}],"concept.aat.300055939":[{"id":"assertion.concept.aat.300055939","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"ethics (philosophical concept) as defined in the captured Getty AAT record 300055939","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ethics (philosophical concept) as: System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","support":[{"end":723,"quote":"System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","source_id":"getty-aat.300055939","source_sha256":"ad3cc5efeeda438a497e3005f6b282040cb4a75af313b5083442f3faa4c779b1","start":414}],"target_id":"concept.aat.300055939","target_kind":"node","target_sha256":"e625ecd51ba32dafd7af421efcb6836cbc80d509793ec139c6332b68c69cb490"}],"concept.aat.300055945":[{"id":"assertion.concept.aat.300055945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metaphysical concepts as defined in the captured Getty AAT record 300055945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines metaphysical concepts as: Philosophical concepts that deal with the nature of reality.","support":[{"end":465,"quote":"Philosophical concepts that deal with the nature of reality.","source_id":"getty-aat.300055945","source_sha256":"d3b9a1e3676c13d8a146d18f1db45ad022db5eb830a733e115e5918af722a86f","start":405}],"target_id":"concept.aat.300055945","target_kind":"node","target_sha256":"9746b31f3d243c164be1f933d2e00e981206da8bd40fe78e5a73e594a48ca715"}],"concept.aat.300055946":[{"id":"assertion.concept.aat.300055946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dialectic as defined in the captured Getty AAT record 300055946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dialectic as: Originally in ancient Greece, a form of logical argumentation proceeding by question and answer. In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","support":[{"end":764,"quote":"Originally in ancient Greece, a form of logical argumentation proceeding by question and answer.  In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","source_id":"getty-aat.300055946","source_sha256":"076b25c310b23730c084f6940c3cc7c286623e40ee3d4c5ac469d3ec5e11ed5f","start":416}],"target_id":"concept.aat.300055946","target_kind":"node","target_sha256":"b3987d900ec9c4ecc7071e2f3a32ee614ab3cd764a798ff565d5dbc54de9ec41"}],"concept.aat.300055947":[{"id":"assertion.concept.aat.300055947","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"supernatural as defined in the captured Getty AAT record 300055947","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines supernatural as: Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","support":[{"end":648,"quote":"Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","source_id":"getty-aat.300055947","source_sha256":"bb20b25f557b2e88fc963bf17adaf70e7d0f5dc3770c4fe8e4ad72583f5b6b99","start":419}],"target_id":"concept.aat.300055947","target_kind":"node","target_sha256":"d09154f61a258a6cc8ee7b84f16d9fdfeb1f9d84318677248a45f7c80d8bc279"}],"concept.aat.300055956":[{"id":"assertion.concept.aat.300055956","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropomorphism as defined in the captured Getty AAT record 300055956","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropomorphism as: Interpretation of what is not human in terms of human characteristics.","support":[{"end":511,"quote":"Interpretation of what is not human in terms of human characteristics.","source_id":"getty-aat.300055956","source_sha256":"ae17710e6f761de1a3fe15de1bf376a413c5058d7922fec2d11ebf07185f3ac1","start":441}],"target_id":"concept.aat.300055956","target_kind":"node","target_sha256":"701667994cba467406c290e836ae160e32b012d58b49b976a77e83490aac0de1"}],"concept.aat.300055957":[{"id":"assertion.concept.aat.300055957","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Aristotelianism as defined in the captured Getty AAT record 300055957","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Aristotelianism as: Philosophy incorporating essential features of the thinking of Aristotle.","support":[{"end":513,"quote":"Philosophy incorporating essential features of the thinking of Aristotle.","source_id":"getty-aat.300055957","source_sha256":"b0185208f85eca1719cd2ee26107c9c738e5f371386cb4bab0a83009bfc7356a","start":440}],"target_id":"concept.aat.300055957","target_kind":"node","target_sha256":"9eb42aa6a801aa0725a11a34237e0de6c6c62a987960e15a73a37c4cbf4ac21d"}],"concept.aat.300055959":[{"id":"assertion.concept.aat.300055959","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"determinism as defined in the captured Getty AAT record 300055959","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines determinism as: Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","support":[{"end":971,"quote":"Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","source_id":"getty-aat.300055959","source_sha256":"7de5dbe73cd69a74d78e7774d3a1c8dd646e5e3f61472345563f5e0964adef01","start":436}],"target_id":"concept.aat.300055959","target_kind":"node","target_sha256":"c108af14c9dd155d678f0cf3ddfb3c4aed4c7dcff5a91dd9d7a6286df2d0f088"}],"concept.aat.300055963":[{"id":"assertion.concept.aat.300055963","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gnosticism as defined in the captured Getty AAT record 300055963","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gnosticism as: Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","support":[{"end":973,"quote":"Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","source_id":"getty-aat.300055963","source_sha256":"415d4dd5dd9220f696211fbfa9a8934a905c6e55a6bd8adddf5427a7f7178d6a","start":416}],"target_id":"concept.aat.300055963","target_kind":"node","target_sha256":"2cbf1088da3001b267ff09bff85ba2f00976eb1210924111c4922508a9769ebc"}],"concept.aat.300055966":[{"id":"assertion.concept.aat.300055966","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"individualism as defined in the captured Getty AAT record 300055966","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines individualism as: The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","support":[{"end":566,"quote":"The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","source_id":"getty-aat.300055966","source_sha256":"e8444a872dceefb37b5166a5818eabd0ca604972d7b8f2a7645520332bc1b011","start":438}],"target_id":"concept.aat.300055966","target_kind":"node","target_sha256":"fa453afe5b42ef7b4d1c0b2541ce6fd6e6ee71a8f6f7f70f615394160cbea82d"}],"concept.aat.300055969":[{"id":"assertion.concept.aat.300055969","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Platonism as defined in the captured Getty AAT record 300055969","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Platonism as: Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","support":[{"end":793,"quote":"Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","source_id":"getty-aat.300055969","source_sha256":"f6c9a33ad535aba1661543a416a7bbf02fad543271067e39647a712aa48bac73","start":434}],"target_id":"concept.aat.300055969","target_kind":"node","target_sha256":"7d2ccdb0acbf757b640be83a8e723ece79ce4984107538ad7af16abbed042247"}],"concept.aat.300055970":[{"id":"assertion.concept.aat.300055970","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neo-Platonism as defined in the captured Getty AAT record 300055970","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neo-Platonism as: Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","support":[{"end":1051,"quote":"Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","source_id":"getty-aat.300055970","source_sha256":"6685d57314ea721c4fd6f7f548027bb321c71ba7311657a5e3cb0ba8518ed4c8","start":429}],"target_id":"concept.aat.300055970","target_kind":"node","target_sha256":"5fd9226c475c17a50fa4094a07037b88ec97f21b47ac7771491fb4eeda45d905"}],"concept.aat.300055971":[{"id":"assertion.concept.aat.300055971","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"positivism as defined in the captured Getty AAT record 300055971","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines positivism as: The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","support":[{"end":614,"quote":"The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","source_id":"getty-aat.300055971","source_sha256":"a3ce6478679acf847f735e7db72cb2235fac182f32376bba66bb41e7df033dce","start":435}],"target_id":"concept.aat.300055971","target_kind":"node","target_sha256":"fca709044a64b1c810b92b7fcb52be40f64c0d3f6c1af52a24ec1ec25cd25611"}],"concept.aat.300055972":[{"id":"assertion.concept.aat.300055972","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pragmatism as defined in the captured Getty AAT record 300055972","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pragmatism as: Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","support":[{"end":874,"quote":"Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","source_id":"getty-aat.300055972","source_sha256":"85fca034f58d9444e504c2c8e7d05af71581ed5a4f9ca92dd415e744a58a5df7","start":435}],"target_id":"concept.aat.300055972","target_kind":"node","target_sha256":"bca858223d00a1b088d30d79d7c90bccce9855c36b96a534f1746f70c209f5b4"}],"concept.aat.300055974":[{"id":"assertion.concept.aat.300055974","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"scholasticism as defined in the captured Getty AAT record 300055974","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines scholasticism as: The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","support":[{"end":896,"quote":"The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","source_id":"getty-aat.300055974","source_sha256":"9b1a8203eb5e90339eed434372bfa345998eb6c06065aa89ca7e54ad8bc8e9b6","start":438}],"target_id":"concept.aat.300055974","target_kind":"node","target_sha256":"3c9529e3c50c708c9980ff3736a2149e6c623b8d13f2159b0bd9c2f9e616b399"}],"concept.aat.300055977":[{"id":"assertion.concept.aat.300055977","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stoicism as defined in the captured Getty AAT record 300055977","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines stoicism as: A philosophical movement that flourished in Greek and Roman antiquity. Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","support":[{"end":838,"quote":"A philosophical movement that flourished in Greek and Roman antiquity.  Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","source_id":"getty-aat.300055977","source_sha256":"6fe691164a06459e09279db6ae983958d5cf7df7d1adbf1197d4140d2c44287f","start":433}],"target_id":"concept.aat.300055977","target_kind":"node","target_sha256":"875ce36a4077d016a172cd45dd1823338fe5c7c549e2de40ec48e7c20ea41149"}],"concept.aat.300055978":[{"id":"assertion.concept.aat.300055978","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transcendentalism as defined in the captured Getty AAT record 300055978","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines transcendentalism as: A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","support":[{"end":941,"quote":"A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","source_id":"getty-aat.300055978","source_sha256":"08cf54bbc377ac55a1b07872e68b8a9f11bdc8a5e7ea9f40942ed21d381891ef","start":442}],"target_id":"concept.aat.300055978","target_kind":"node","target_sha256":"83c960efdba3142c0887bb8240f6f134dea78d241b6aeb18e678e2f63cd4c93b"}],"concept.aat.300055979":[{"id":"assertion.concept.aat.300055979","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"utilitarianism as defined in the captured Getty AAT record 300055979","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines utilitarianism as: Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","support":[{"end":585,"quote":"Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","source_id":"getty-aat.300055979","source_sha256":"080b66a58a7b2793fbeccb8e135bd44f39a3a9f171c41ee92b3113ce96cf7411","start":439}],"target_id":"concept.aat.300055979","target_kind":"node","target_sha256":"27b8ad5cef48adf4b04647c740cf5562ae80cec26c98f58f59da980736e374b3"}],"concept.aat.300055980":[{"id":"assertion.concept.aat.300055980","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<religions and religious concepts> as defined in the captured Getty AAT record 300055980","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <religions and religious concepts> as: Religions and concepts related to religions.","support":[{"end":441,"quote":"Religions and concepts related to religions.","source_id":"getty-aat.300055980","source_sha256":"dbc083a1c116051884da57421c75bf22c7b0ef3ff7cdd6b66fb8671673c4e179","start":397}],"target_id":"concept.aat.300055980","target_kind":"node","target_sha256":"dac6d8a665eca444f451f8759583f1ba3708bb3cf8f5c308287a262d28a08785"}],"concept.aat.300055982":[{"id":"assertion.concept.aat.300055982","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"faith as defined in the captured Getty AAT record 300055982","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines faith as: Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","support":[{"end":525,"quote":"Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","source_id":"getty-aat.300055982","source_sha256":"d6300107b01f71a672b213dadf24776a75b9fa4896e326b4a80474964bc6c3e7","start":409}],"target_id":"concept.aat.300055982","target_kind":"node","target_sha256":"3821dab07ec78a15c92a6cc1b513a42d3891b7687532347ac80ed62167d86e39"}],"concept.aat.300055983":[{"id":"assertion.concept.aat.300055983","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"liturgy as defined in the captured Getty AAT record 300055983","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines liturgy as: Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","support":[{"end":718,"quote":"Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","source_id":"getty-aat.300055983","source_sha256":"07a518025b8e5ac125e6a8416b2ecfa395f278e3bba89ad0f93e37aed0a4ccfc","start":400}],"target_id":"concept.aat.300055983","target_kind":"node","target_sha256":"02fdfa5c755851bbe093736ac407dcf752375a41f233f46f14f4df190d8f7cf6"}],"concept.aat.300055988":[{"id":"assertion.concept.aat.300055988","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Adoptionism as defined in the captured Getty AAT record 300055988","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Adoptionism as: Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","support":[{"end":521,"quote":"Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","source_id":"getty-aat.300055988","source_sha256":"ea81d1750f36647920edf724b2e7fad6d06559c66adb00512bfe2071dc68e3a8","start":417}],"target_id":"concept.aat.300055988","target_kind":"node","target_sha256":"b427aa621a594f0a6587c8f57ee8c6c02339bae2d2f25797ebce6cf5ae29114a"}],"concept.aat.300055989":[{"id":"assertion.concept.aat.300055989","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"agnosticism as defined in the captured Getty AAT record 300055989","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines agnosticism as: Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","support":[{"end":576,"quote":"Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","source_id":"getty-aat.300055989","source_sha256":"ca0c8970de8ba41bad279e8e182193bad1162ba3016552d9b40b9d98056b2298","start":417}],"target_id":"concept.aat.300055989","target_kind":"node","target_sha256":"6e673d07f62a620d21869c0b75a30ad290e0d0b02d08edcf77904c4372323e1c"}],"concept.aat.300055990":[{"id":"assertion.concept.aat.300055990","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"atheism as defined in the captured Getty AAT record 300055990","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines atheism as: Doctrine that there is neither God nor any other deity.","support":[{"end":468,"quote":"Doctrine that there is neither God nor any other deity.","source_id":"getty-aat.300055990","source_sha256":"2311062180555f8ddc6896dbb9f6898e47b2de1b61fe24cb7a490e0adb1c1dee","start":413}],"target_id":"concept.aat.300055990","target_kind":"node","target_sha256":"26128684c84f5ec877317ac21a343fc351f98dfd544bdf9614396431879307c7"}],"concept.aat.300055991":[{"id":"assertion.concept.aat.300055991","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monasticism as defined in the captured Getty AAT record 300055991","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monasticism as: A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","support":[{"end":1247,"quote":"A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","source_id":"getty-aat.300055991","source_sha256":"1158aad52deb37cfd08a681f742aa2d3f030b5294c3c01e528118cb90ce3d649","start":427}],"target_id":"concept.aat.300055991","target_kind":"node","target_sha256":"6d21a3689cccc77ac1d3ff6de71533db66f72da2306ac89460645c77e0569871"}],"concept.aat.300055992":[{"id":"assertion.concept.aat.300055992","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monotheism as defined in the captured Getty AAT record 300055992","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monotheism as: The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","support":[{"end":839,"quote":"The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","source_id":"getty-aat.300055992","source_sha256":"8c944215e1cbda38cf26bea8a730dbce663d9801c3be12d06f13032b6b69cf92","start":416}],"target_id":"concept.aat.300055992","target_kind":"node","target_sha256":"7c4a2244f07c7f03150ffbd28fd91fd6ba749e86e96d0f023bd83174710703fc"}],"concept.aat.300055993":[{"id":"assertion.concept.aat.300055993","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paganism as defined in the captured Getty AAT record 300055993","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paganism as: Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","support":[{"end":693,"quote":"Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","source_id":"getty-aat.300055993","source_sha256":"1ec6b97505c505cd31e3ed179fad893fcef4bf8cc898aa835d2fde85f8667151","start":414}],"target_id":"concept.aat.300055993","target_kind":"node","target_sha256":"174981c140c12f4fb2fc67ea3c013eaee81dc9878a0f530b893f1f0cf99d741b"}],"concept.aat.300055995":[{"id":"assertion.concept.aat.300055995","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pantheism as defined in the captured Getty AAT record 300055995","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pantheism as: Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","support":[{"end":648,"quote":"Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","source_id":"getty-aat.300055995","source_sha256":"f575a4729578aaad3506b366427a5d17fc672f03b173b37b61ad1d1cf8931d94","start":415}],"target_id":"concept.aat.300055995","target_kind":"node","target_sha256":"596b234d3a5627e396daeb461c28c95d0fb7998c9b4123cfded00233eabd3b8e"}],"concept.aat.300055996":[{"id":"assertion.concept.aat.300055996","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pietism as defined in the captured Getty AAT record 300055996","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pietism as: A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","support":[{"end":749,"quote":"A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","source_id":"getty-aat.300055996","source_sha256":"26739972eace93125497babf8140e9ad2f3e18d5860af7700fb0452a9d4ce7a9","start":413}],"target_id":"concept.aat.300055996","target_kind":"node","target_sha256":"d4d0c13fa5b935a6f0e63b7e8d205f6c4ef06d432606f29d4e5f1ac4ec9a77ff"}],"concept.aat.300055997":[{"id":"assertion.concept.aat.300055997","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"polytheism as defined in the captured Getty AAT record 300055997","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines polytheism as: The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","support":[{"end":595,"quote":"The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","source_id":"getty-aat.300055997","source_sha256":"ddb4e545deac29e8860dc2ac3434faff4aea37880fb5037b39d2bdb7ef398e2c","start":416}],"target_id":"concept.aat.300055997","target_kind":"node","target_sha256":"b21ac6c05641ee6ae1b6762b94237ac2caeb639e49d22d2ab3221b0930636780"}],"concept.aat.300055998":[{"id":"assertion.concept.aat.300055998","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"quietism as defined in the captured Getty AAT record 300055998","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines quietism as: Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","support":[{"end":768,"quote":"Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","source_id":"getty-aat.300055998","source_sha256":"27efea7e9c97b518d69f5030967bdb0ffbd2cca061cdfeb3d40d87fbe3c153f6","start":414}],"target_id":"concept.aat.300055998","target_kind":"node","target_sha256":"ba464d7c62da2a56938f66cd146d629c45a013840f5faa5261d257ead63bec78"}],"concept.aat.300055999":[{"id":"assertion.concept.aat.300055999","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"shamanism as defined in the captured Getty AAT record 300055999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines shamanism as: Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","support":[{"end":839,"quote":"Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","source_id":"getty-aat.300055999","source_sha256":"8df7fe96a7ffd957b4555c4d237b8afc7a49a7eb5184de96729c72843fe83295","start":415}],"target_id":"concept.aat.300055999","target_kind":"node","target_sha256":"ee7bf6240a3486fad4748ba33a71ed732e59383d1a5506ccea0fa2d124540906"}],"concept.aat.300056000":[{"id":"assertion.concept.aat.300056000","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theosophy as defined in the captured Getty AAT record 300056000","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theosophy as: Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","support":[{"end":589,"quote":"Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","source_id":"getty-aat.300056000","source_sha256":"cfdbad698001ece520479bc2d61ae2023ad37bb8543eb7a8f42305f24042c4ef","start":415}],"target_id":"concept.aat.300056000","target_kind":"node","target_sha256":"257e3115bb567cf093a4d99f96cc9abc56215941da816ad186d9f70eb0cbb4c7"}],"concept.aat.300056002":[{"id":"assertion.concept.aat.300056002","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"totemism as defined in the captured Getty AAT record 300056002","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines totemism as: Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","support":[{"end":648,"quote":"Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","source_id":"getty-aat.300056002","source_sha256":"290e315f2457083a245350cc350f3199b1ff2f50e2270bd41eae851f41df1723","start":414}],"target_id":"concept.aat.300056002","target_kind":"node","target_sha256":"ce8dbcc9b3894070c19c38928733c18e7bb4810dedb2f3768009d0ced509dbd4"}],"concept.aat.300056003":[{"id":"assertion.concept.aat.300056003","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"salvation as defined in the captured Getty AAT record 300056003","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines salvation as: The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","support":[{"end":780,"quote":"The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","source_id":"getty-aat.300056003","source_sha256":"1d3c1351ca12852518d4c37d058d3a80ec7d98a2a0ed9c50136a6199a091291d","start":413}],"target_id":"concept.aat.300056003","target_kind":"node","target_sha256":"8a58d954138f3594a6ae93fe67abb7644d00983ec1a6564fb62bd81b44673a5f"}],"concept.aat.300056004":[{"id":"assertion.concept.aat.300056004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theophany as defined in the captured Getty AAT record 300056004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theophany as: The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","support":[{"end":506,"quote":"The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","source_id":"getty-aat.300056004","source_sha256":"5db648ce07ac681b763766d85ae8e12e79b247bca97724a407cef7bf3ae94708","start":413}],"target_id":"concept.aat.300056004","target_kind":"node","target_sha256":"a690e5293ba36a4654aaa07c1f79f8cc7a55c6e42f0be7a3311b95729011c7ed"}],"concept.aat.300056005":[{"id":"assertion.concept.aat.300056005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"worship as defined in the captured Getty AAT record 300056005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines worship as: The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","support":[{"end":570,"quote":"The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","source_id":"getty-aat.300056005","source_sha256":"dd51555ba731cf7697172c547c0c4e08623dbb72910c872b6e90661eb596165d","start":423}],"target_id":"concept.aat.300056005","target_kind":"node","target_sha256":"e5a7ff3bf57114c9e49588b565e8a27e185d260df2948241481b4d0ed0c928ee"}],"concept.aat.300056180":[{"id":"assertion.concept.aat.300056180","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"grandeur as defined in the captured Getty AAT record 300056180","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines grandeur as: The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","support":[{"end":511,"quote":"The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","source_id":"getty-aat.300056180","source_sha256":"8ae12e18760daa5ca9cfa28ac0c510db3b9eef01295e8d1387eb3df541bb49e3","start":412}],"target_id":"concept.aat.300056180","target_kind":"node","target_sha256":"7673f7aec1423bb2e0d0904fffd6abd7b059c53b4976159988c26208dbeb518f"}],"concept.aat.300056183":[{"id":"assertion.concept.aat.300056183","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"significant form as defined in the captured Getty AAT record 300056183","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines significant form as: Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","support":[{"end":553,"quote":"Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","source_id":"getty-aat.300056183","source_sha256":"cd985b656b4bfe3c9745d18e5eaad178bc1061df38245cf5f98c75b8fcdf484c","start":420}],"target_id":"concept.aat.300056183","target_kind":"node","target_sha256":"8095df1d71c941dbf04a45be420eb361a29a6b7383280eef82f8822b28d87b03"}],"concept.aat.300056261":[{"id":"assertion.concept.aat.300056261","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dualism as defined in the captured Getty AAT record 300056261","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dualism as: Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","support":[{"end":549,"quote":"Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","source_id":"getty-aat.300056261","source_sha256":"5e169da60851e8f8e376f9159f32de7baa39d9d4687d3c3af336bb0354233dd9","start":432}],"target_id":"concept.aat.300056261","target_kind":"node","target_sha256":"f04cd397af0dca4fca30acc43e3fd62b263eff3f4281a69f07e1a4f874783c60"}],"concept.aat.300060368":[{"id":"assertion.concept.aat.300060368","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"syncretism as defined in the captured Getty AAT record 300060368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","support":[{"end":525,"quote":"Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","source_id":"getty-aat.300060368","source_sha256":"3456e3e702ab2fc8812eee67e58054f845bc7d6ce846616a47c3da297a1e7fae","start":435}],"target_id":"concept.aat.300060368","target_kind":"node","target_sha256":"d88fc0c92b2731cef268f13c141bae80074ac803c25ba4e58a7ba4864c9d7ed6"}],"concept.aat.300065709":[{"id":"assertion.concept.aat.300065709","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stigmatization as defined in the captured Getty AAT record 300065709","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines stigmatization as: The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","support":[{"end":640,"quote":"The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","source_id":"getty-aat.300065709","source_sha256":"2c3c95256a32cf1a1f80da3d553af543d9a1509924455429aa77b32c9471cbcf","start":428}],"target_id":"concept.aat.300065709","target_kind":"node","target_sha256":"73c1aea6f9c4d44cd30d2ca04a3a2e12525b405207817fbaaba3467c9d67d62a"}],"concept.aat.300065758":[{"id":"assertion.concept.aat.300065758","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Minimal as defined in the captured Getty AAT record 300065758","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Minimal as: A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","support":[{"end":1201,"quote":"A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","source_id":"getty-aat.300065758","source_sha256":"853114fcf852df339228c5216a0bdf0dbaf30ce46908056a7f664a547e7eb02b","start":457}],"target_id":"concept.aat.300065758","target_kind":"node","target_sha256":"47dc51a4a432805b1fe7571bcb576cdfea25dbade2510b492c39908dc708f06a"}],"concept.aat.300066049":[{"id":"assertion.concept.aat.300066049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immaculate conception as defined in the captured Getty AAT record 300066049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines immaculate conception as: The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","support":[{"end":736,"quote":"The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","source_id":"getty-aat.300066049","source_sha256":"4f7b6626727d5b27c131ea67e93720128e557c40000b23a3c89e9e04489996ec","start":435}],"target_id":"concept.aat.300066049","target_kind":"node","target_sha256":"ea8255508b075a0d9dd08456354d7ce286c0fcfebde71780b44474a1af579125"}],"concept.aat.300067974":[{"id":"assertion.concept.aat.300067974","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"millenarianism as defined in the captured Getty AAT record 300067974","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines millenarianism as: Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","support":[{"end":1076,"quote":"Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","source_id":"getty-aat.300067974","source_sha256":"668c91d4513fb6ee53c8acde2874ab7624459ad410588bbe25f5dbc31b0a0627","start":420}],"target_id":"concept.aat.300067974","target_kind":"node","target_sha256":"fad4955e26cb1148ee7a548472b65e384c339a81087d6c17b6972f2be7453c76"}],"concept.aat.300068765":[{"id":"assertion.concept.aat.300068765","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"truth as defined in the captured Getty AAT record 300068765","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines truth as: A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","support":[{"end":509,"quote":"A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","source_id":"getty-aat.300068765","source_sha256":"e7a74ce2420b4ec9c1ce89f0cd24c05cb6a98a358400077033073da13729fac1","start":389}],"target_id":"concept.aat.300068765","target_kind":"node","target_sha256":"09e358bb1f4380778d4da503e5bc35a324824536a465725f07e28716c193aea2"}],"concept.aat.300069306":[{"id":"assertion.concept.aat.300069306","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ideal, the as defined in the captured Getty AAT record 300069306","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","support":[{"end":987,"quote":"The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","source_id":"getty-aat.300069306","source_sha256":"30ef8a6969a32a4a1a23055ee251111d7121692ece8db25c3099f8865e94c1f8","start":414}],"target_id":"concept.aat.300069306","target_kind":"node","target_sha256":"2ad509faabd3f60681fb4ca84f3201f790c67bf074de70666b2376e05a51650d"}],"concept.aat.300069390":[{"id":"assertion.concept.aat.300069390","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"participatory design as defined in the captured Getty AAT record 300069390","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines participatory design as: Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","support":[{"end":544,"quote":"Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","source_id":"getty-aat.300069390","source_sha256":"9737c84854f3457cb09f741f57418e186f426d9c9afce91da417659c34155aa2","start":423}],"target_id":"concept.aat.300069390","target_kind":"node","target_sha256":"d0285a4c7f6120a8ccffdbfe53ffb943a3cb683be0e549cc58151d6d5f6b8b4b"}],"concept.aat.300070431":[{"id":"assertion.concept.aat.300070431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nihilism as defined in the captured Getty AAT record 300070431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nihilism as: Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","support":[{"end":529,"quote":"Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","source_id":"getty-aat.300070431","source_sha256":"bda57d9c53941f893f0917361962a9d5948611a4ff490b8ab3db6625599c5ace","start":433}],"target_id":"concept.aat.300070431","target_kind":"node","target_sha256":"604b3edce178cd14206f8e75418a81b470c424d4f1862af7301218a2cc98d8e6"}],"concept.aat.300070544":[{"id":"assertion.concept.aat.300070544","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nominalism as defined in the captured Getty AAT record 300070544","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nominalism as: Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","support":[{"end":648,"quote":"Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","source_id":"getty-aat.300070544","source_sha256":"7b3fe3d6c5f878df999b8bd08aca26d77399f1402b37a691d7a21c5deef22858","start":435}],"target_id":"concept.aat.300070544","target_kind":"node","target_sha256":"896cd1fae35c2d385a6c1045358cf3d9ffb1a44d9e0c193f2bca64d19839040f"}],"concept.aat.300072604":[{"id":"assertion.concept.aat.300072604","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"animism as defined in the captured Getty AAT record 300072604","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines animism as: Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","support":[{"end":720,"quote":"Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","source_id":"getty-aat.300072604","source_sha256":"8ff9252b204ada66643c1ec090c0e100e9cd8f858a274d77f211173a84be6cc4","start":413}],"target_id":"concept.aat.300072604","target_kind":"node","target_sha256":"b5c3ac8fe8e36f7aa3d2ffd0c85b1756ec81ebeb5ed41d8a4ef450d928d472a5"}],"concept.aat.300073437":[{"id":"assertion.concept.aat.300073437","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reincarnation as defined in the captured Getty AAT record 300073437","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines reincarnation as: The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","support":[{"end":713,"quote":"The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","source_id":"getty-aat.300073437","source_sha256":"bf0f902bdbdce5e7678e82df2db15a4ffe8e4bb8f30e0def797f1e6ee42bd7dc","start":417}],"target_id":"concept.aat.300073437","target_kind":"node","target_sha256":"553120b8ba6893e06ac65c6b797ce5dec04b985f3b756185465f39eeb59973e0"}],"concept.aat.300080819":[{"id":"assertion.concept.aat.300080819","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Latin American as defined in the captured Getty AAT record 300080819","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Latin American as: In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","support":[{"end":745,"quote":"In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","source_id":"getty-aat.300080819","source_sha256":"572df0112d0c68532f5df017a4c9a0c4dc2ccbebc165948da58023faee65ff96","start":430}],"target_id":"concept.aat.300080819","target_kind":"node","target_sha256":"c790ac8e6d8339628781195cb2052155eae959ad150b7edcfe9379dc0263fb65"}],"concept.aat.300106711":[{"id":"assertion.concept.aat.300106711","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ancient as defined in the captured Getty AAT record 300106711","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ancient as: In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","support":[{"end":699,"quote":"In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","source_id":"getty-aat.300106711","source_sha256":"0f511be0d8601bdfdeb0f947e3c6ae20b62fe1e3287bb9bc23737b5881343510","start":414}],"target_id":"concept.aat.300106711","target_kind":"node","target_sha256":"7ec2e782f2796e5b6425110cfc36d2dbcb8374c597a80f3ba43cb1d69a0a9b04"}],"concept.aat.300106723":[{"id":"assertion.concept.aat.300106723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"three-age system as defined in the captured Getty AAT record 300106723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines three-age system as: Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","support":[{"end":517,"quote":"Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","source_id":"getty-aat.300106723","source_sha256":"bd4dade8db4d9e7381cefb183d2475531555269d9c91a256ed0f17bfd5827830","start":423}],"target_id":"concept.aat.300106723","target_kind":"node","target_sha256":"56e151c0b62117f93181146ca56f5a90fa9778822437e02ff6c14fdd4493d9a7"}],"concept.aat.300106724":[{"id":"assertion.concept.aat.300106724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Stone Age as defined in the captured Getty AAT record 300106724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Stone Age as: Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","support":[{"end":1012,"quote":"Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","source_id":"getty-aat.300106724","source_sha256":"6f5ecb90af2016e3220f9ddb9b827b9dc4ca2fd890ddfe17ad88bcde65c0eb64","start":434}],"target_id":"concept.aat.300106724","target_kind":"node","target_sha256":"b54063e9a9b5aafa7e16a9113604abebdcbc29c44ff26be914b971b0f2eae020"}],"concept.aat.300106738":[{"id":"assertion.concept.aat.300106738","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Iron Age as defined in the captured Getty AAT record 300106738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Iron Age as: Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","support":[{"end":622,"quote":"Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","source_id":"getty-aat.300106738","source_sha256":"36ff78ba56c22a5e5d63482e81a02282e6dada83320f73f87417995fd37808f2","start":405}],"target_id":"concept.aat.300106738","target_kind":"node","target_sha256":"e8c5cf95dbd6bc38369d3e6f0ad86c33a7394f7ff60e66eadce79f28bdb5bfd4"}],"concept.aat.300106739":[{"id":"assertion.concept.aat.300106739","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Iron Age as defined in the captured Getty AAT record 300106739","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Iron Age as: Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","support":[{"end":528,"quote":"Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","source_id":"getty-aat.300106739","source_sha256":"b487d6d0347f8364b8147183587e2fe7cab7b4ed749bf7ddce0472e1e8469131","start":406}],"target_id":"concept.aat.300106739","target_kind":"node","target_sha256":"2d741d5f2ac0a7bb2defcbf38205cf2b433d76ac08380995e4a49b1e68d81f64"}],"concept.aat.300106745":[{"id":"assertion.concept.aat.300106745","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Iron Age as defined in the captured Getty AAT record 300106745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Iron Age as: Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","support":[{"end":545,"quote":"Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","source_id":"getty-aat.300106745","source_sha256":"7ccc46712d2078099e929785a2e95c16094a6267d59ce331afd5567e81a2058c","start":404}],"target_id":"concept.aat.300106745","target_kind":"node","target_sha256":"35ee47971d9bc75a7f22c09e26d3ce7d7f81564e38bd76dfde7ffbb76e4d2820"}],"concept.aat.300106747":[{"id":"assertion.concept.aat.300106747","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transitional periods Stone Age to Bronze Age as defined in the captured Getty AAT record 300106747","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines transitional periods Stone Age to Bronze Age as: Transitional periods related to Stone Age to Bronze Age cultures.","support":[{"end":534,"quote":"Transitional periods related to Stone Age to Bronze Age cultures.","source_id":"getty-aat.300106747","source_sha256":"18f9c308d3a1e5d369e02f737ec0041fc37b451792d5dec259e6078494a2c819","start":469}],"target_id":"concept.aat.300106747","target_kind":"node","target_sha256":"123762a21e42138926142d565f3bf314ccf7ea993baa5e2dbf805e7efc783629"}],"concept.aat.300106757":[{"id":"assertion.concept.aat.300106757","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eneolithic as defined in the captured Getty AAT record 300106757","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eneolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","support":[{"end":1012,"quote":"Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","source_id":"getty-aat.300106757","source_sha256":"6f1a8ca7e5c1924db92b81c6e2a3aaa92abb5df4aa06e7c67150faa4685a4d74","start":437}],"target_id":"concept.aat.300106757","target_kind":"node","target_sha256":"4eead10379e703efbe4aeaf004a73d978dad77861fee15cf8e702ce1d7ea3c96"}],"concept.aat.300106759":[{"id":"assertion.concept.aat.300106759","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Final Neolithic as defined in the captured Getty AAT record 300106759","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Final Neolithic as: Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","support":[{"end":701,"quote":"Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","source_id":"getty-aat.300106759","source_sha256":"67584712b9848a5c9ea4c98a357a71c90fc4bd658691c6851c2357ea59e30d51","start":442}],"target_id":"concept.aat.300106759","target_kind":"node","target_sha256":"1c2a17353bb956a0b14b5292dc938572a9ec90e434000ba10b952989f24c1066"}],"concept.aat.300107946":[{"id":"assertion.concept.aat.300107946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"American regions as defined in the captured Getty AAT record 300107946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines American regions as: Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","support":[{"end":574,"quote":"Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","source_id":"getty-aat.300107946","source_sha256":"4e50934309a52095f34c78a273339286620dc8343ca04ed5e20e95cc7d225aa2","start":432}],"target_id":"concept.aat.300107946","target_kind":"node","target_sha256":"d14a34924e858de197e456ac58e9b97e221a04c9227d993a0b2107a2b3d2938e"}],"concept.aat.300108565":[{"id":"assertion.concept.aat.300108565","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Colonial African as defined in the captured Getty AAT record 300108565","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Colonial African as: Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","support":[{"end":551,"quote":"Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","source_id":"getty-aat.300108565","source_sha256":"d0f4a44d1e6d4d2ee25e4c26c77092448a8033796515ab179c9504bc447d830b","start":459}],"target_id":"concept.aat.300108565","target_kind":"node","target_sha256":"5c5def0fbb0794e592de47ec50014c3c95e163e59494326da19e9d02c02a6042"}],"concept.aat.300108572":[{"id":"assertion.concept.aat.300108572","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"African sculpture styles as defined in the captured Getty AAT record 300108572","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African sculpture styles as: Sculpture styles belonging to African cultures.","support":[{"end":514,"quote":"Sculpture styles belonging to African cultures.","source_id":"getty-aat.300108572","source_sha256":"b0e82c7abe1294a51f6cef9aedbfa7378465cff6c88666e4366b829d808d0e85","start":467}],"target_id":"concept.aat.300108572","target_kind":"node","target_sha256":"0b49e343d88f2d705e5c6876cb9eea260a4ed37ed91a130e4ac9524d1a49015d"}],"concept.aat.300111149":[{"id":"assertion.concept.aat.300111149","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"European regions as defined in the captured Getty AAT record 300111149","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines European regions as: Used to describe styles of the regions of Europe.","support":[{"end":477,"quote":"Used to describe styles of the regions of Europe.","source_id":"getty-aat.300111149","source_sha256":"5b735d50197cffa3fe8c38ac31d6e57f5b75ada68f632ac8774a7f085cf31960","start":428}],"target_id":"concept.aat.300111149","target_kind":"node","target_sha256":"ff503c8c6b97c758d6f2d8c5d6db26f3b4b01ce5b1be4b587032f82ecd3f9a5b"}],"concept.aat.300111241":[{"id":"assertion.concept.aat.300111241","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Saracenic as defined in the captured Getty AAT record 300111241","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Saracenic as: Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","support":[{"end":941,"quote":"Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","source_id":"getty-aat.300111241","source_sha256":"b9f730d3803b08618e38f69e891996dd77d34a5768f41f65ae64b4208b103de3","start":431}],"target_id":"concept.aat.300111241","target_kind":"node","target_sha256":"5d5f26f3209cd0165f47a87eae70f64993bf8020a4430fc9bcfc881b668a0d46"}],"concept.aat.300113090":[{"id":"assertion.concept.aat.300113090","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tashtyk as defined in the captured Getty AAT record 300113090","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tashtyk as: Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","support":[{"end":704,"quote":"Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","source_id":"getty-aat.300113090","source_sha256":"5e725c70521cdd803ff22db943fea5ab47ab3d623cc22c967786459c4380ce3f","start":406}],"target_id":"concept.aat.300113090","target_kind":"node","target_sha256":"a0225d9c5ef1f8756bf8e8098c729889e7268cfa10942cc55c8497d058ec2013"}],"concept.aat.300116922":[{"id":"assertion.concept.aat.300116922","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Siberian Arctic Native styles as defined in the captured Getty AAT record 300116922","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Siberian Arctic Native styles as: Styles belonging to Siberian Arctic Native cultures.","support":[{"end":480,"quote":"Styles belonging to Siberian Arctic Native cultures.","source_id":"getty-aat.300116922","source_sha256":"1d0942d4a55e7730e98a8ff7b997f6036a5b62431c72cd5ebd361cf0a252ac18","start":428}],"target_id":"concept.aat.300116922","target_kind":"node","target_sha256":"b7f895af5856a8ff69f83ed5baed5ff3fd7371c3edd020ceec6817f8e2f60479"}],"concept.aat.300120146":[{"id":"assertion.concept.aat.300120146","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Southeast Asian as defined in the captured Getty AAT record 300120146","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Southeast Asian as: Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","support":[{"end":1373,"quote":"Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","source_id":"getty-aat.300120146","source_sha256":"3f4f67222cd32f43e70c83bb80a2b99272fa9d3aceeb495f0e2ec4392a72ebbe","start":424}],"target_id":"concept.aat.300120146","target_kind":"node","target_sha256":"077218ea263025eac4a49c460c5e6c33b7bf0b83262b43e96e07a560ea4edc0e"}],"concept.aat.300124083":[{"id":"assertion.concept.aat.300124083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"aesthetic concepts as defined in the captured Getty AAT record 300124083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines aesthetic concepts as: Concepts related to perception of what is ideal or beautiful.","support":[{"end":463,"quote":"Concepts related to perception of what is ideal or beautiful.","source_id":"getty-aat.300124083","source_sha256":"97a560d2f41f9e5dfcf6b433182eed4b29645866c347c64dfa85c363c85fb592","start":402}],"target_id":"concept.aat.300124083","target_kind":"node","target_sha256":"55018e1e5156787218fcc5b459ccee2b035df2737cc0c7f6eccf64be403788d0"}],"concept.aat.300137365":[{"id":"assertion.concept.aat.300137365","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<linguistics and related disciplines> as defined in the captured Getty AAT record 300137365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <linguistics and related disciplines> as: The discipline of linguistics and other disciplines related to it.","support":[{"end":493,"quote":"The discipline of linguistics and other disciplines related to it.","source_id":"getty-aat.300137365","source_sha256":"23d0150270bbb9e3b911eb293eb7253d3c9231fd4a3911a3dfb2cdb3b6f1ee47","start":427}],"target_id":"concept.aat.300137365","target_kind":"node","target_sha256":"c57936ccc8b49116aacb82ebd7303429bd31760ce10b0cc30f5763b14713c13b"}],"concept.aat.300137410":[{"id":"assertion.concept.aat.300137410","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"linguistics-related disciplines as defined in the captured Getty AAT record 300137410","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines linguistics-related disciplines as: Branches of learning and professions related to linguistics.","support":[{"end":498,"quote":"Branches of learning and professions related to linguistics.","source_id":"getty-aat.300137410","source_sha256":"2d83bba4e32241d33683dcf9bc5b41652139fe0dc3cf32e11abd34c3d6cad581","start":438}],"target_id":"concept.aat.300137410","target_kind":"node","target_sha256":"d0d7867c57acfed167338cbf172bed07cf687fc8a76742f1633cb9c47bdd2266"}],"concept.aat.300138708":[{"id":"assertion.concept.aat.300138708","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fashion design as defined in the captured Getty AAT record 300138708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fashion design as: Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\" For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","support":[{"end":888,"quote":"Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\"  For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","source_id":"getty-aat.300138708","source_sha256":"f468a104b04f4bec878832d16b7fc72e4af5d8c62a905a327a499a303053eee7","start":417}],"target_id":"concept.aat.300138708","target_kind":"node","target_sha256":"983114e62660ddc2bbeca904130c6f6574c6bd185e39a9f690925d5ddce59c29"}],"concept.aat.300143325":[{"id":"assertion.concept.aat.300143325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hasidism as defined in the captured Getty AAT record 300143325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hasidism as: Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","support":[{"end":924,"quote":"Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","source_id":"getty-aat.300143325","source_sha256":"777cb2d6aeb4335176596338f1e0f5c53ac4eadd1da5dc8d37c2713c59060e40","start":414}],"target_id":"concept.aat.300143325","target_kind":"node","target_sha256":"8ddf1001e0dc63313a614df58ac125ac25875a00ab3a45c1693cf0082ecc8cd4"}],"concept.aat.300145966":[{"id":"assertion.concept.aat.300145966","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious concepts as defined in the captured Getty AAT record 300145966","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious concepts as: Ideas and notions that are fundamentally religious.","support":[{"end":465,"quote":"Ideas and notions that are fundamentally religious.","source_id":"getty-aat.300145966","source_sha256":"d5bbe2d5b49f996528ee9304304745121798acc54febccbd37bac27148ae1f32","start":414}],"target_id":"concept.aat.300145966","target_kind":"node","target_sha256":"5fdb9966a7c09c7b3c8496332091167a5d81ee26dfe5ac12d7f601b25bae6fd5"}],"concept.aat.300145975":[{"id":"assertion.concept.aat.300145975","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"doctrinal concepts as defined in the captured Getty AAT record 300145975","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines doctrinal concepts as: Religious concepts related to doctrine.","support":[{"end":473,"quote":"Religious concepts related to doctrine.","source_id":"getty-aat.300145975","source_sha256":"31cc365e10e0a9916eb418423352397e2885e680c9ee0101905536b55f24dc06","start":434}],"target_id":"concept.aat.300145975","target_kind":"node","target_sha256":"a72a21b251e248ca17d10d794c893aefbb3f7d477b62073b3e58d904361cd527"}],"concept.aat.300157724":[{"id":"assertion.concept.aat.300157724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropology of religion as defined in the captured Getty AAT record 300157724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropology of religion as: Study of religion using the methods and theories of anthropology.","support":[{"end":504,"quote":"Study of religion using the methods and theories of anthropology.","source_id":"getty-aat.300157724","source_sha256":"5548693da01cf801f975201fc9b377d1932f7d863452990be505c7f9095b0977","start":439}],"target_id":"concept.aat.300157724","target_kind":"node","target_sha256":"58d79a8aafbc7bfe64f73de26c74387bc5223b839dd7a540ae76e147f3d62c8d"}],"concept.aat.300161596":[{"id":"assertion.concept.aat.300161596","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"interior decoration as defined in the captured Getty AAT record 300161596","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines interior decoration as: The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","support":[{"end":589,"quote":"The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","source_id":"getty-aat.300161596","source_sha256":"947eabc9d1be35fb88368adde67383f93acbc495b3da3f7b91ac02f846a60318","start":422}],"target_id":"concept.aat.300161596","target_kind":"node","target_sha256":"6759c8c824d76d0f4d50e1f87257e56bb40de0ad6b38a549e5fb7bb0873a5718"}],"concept.aat.300163423":[{"id":"assertion.concept.aat.300163423","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"costume design as defined in the captured Getty AAT record 300163423","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines costume design as: Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","support":[{"end":706,"quote":"Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","source_id":"getty-aat.300163423","source_sha256":"bc24b930f6be1174201d943bfe2e83efdd6ce9ec2a584b88730b12f6f6419de2","start":417}],"target_id":"concept.aat.300163423","target_kind":"node","target_sha256":"c424b800f576ba82c78cf82769e2e6ceaff7b8ad8b7cfbfe96dd43baca201b3b"}],"concept.aat.300175240":[{"id":"assertion.concept.aat.300175240","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"arts (broad discipline) as defined in the captured Getty AAT record 300175240","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arts (broad discipline) as: Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","support":[{"end":609,"quote":"Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","source_id":"getty-aat.300175240","source_sha256":"e245d1fca4085c89df0796d071d556974e2fa1a52f0b73213edb232b653f25a0","start":423}],"target_id":"concept.aat.300175240","target_kind":"node","target_sha256":"82da19bf5706cb2de4890c591154b4391646e217565f25acc21675a756720897"}],"concept.aat.300178907":[{"id":"assertion.concept.aat.300178907","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"holism as defined in the captured Getty AAT record 300178907","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines holism as: Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","support":[{"end":558,"quote":"Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","source_id":"getty-aat.300178907","source_sha256":"955d9ee97e3d6e5bb55d589f5a69a51aa763702feb8d5dcc8b51c11e04f7b2f1","start":431}],"target_id":"concept.aat.300178907","target_kind":"node","target_sha256":"16d724d5c18d001a95b5a379766261bac2316a1034a8f26daedaa82e12dcbdea"}],"concept.aat.300179281":[{"id":"assertion.concept.aat.300179281","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"imperfection as defined in the captured Getty AAT record 300179281","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines imperfection as: The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","support":[{"end":523,"quote":"The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","source_id":"getty-aat.300179281","source_sha256":"a904c27b3992008a4851bcc619c2db40ef7aff777161a8f7fd328e61cead8013","start":416}],"target_id":"concept.aat.300179281","target_kind":"node","target_sha256":"572bdbb0242b9ce052ce9a12e56241d6644b3fef078b29fe0286ffc2324a015b"}],"concept.aat.300179426":[{"id":"assertion.concept.aat.300179426","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perfection as defined in the captured Getty AAT record 300179426","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines perfection as: The state, quality, or condition of being accurate, complete, without defect and/or delightful.","support":[{"end":509,"quote":"The state, quality, or condition of being accurate, complete, without defect and/or delightful.","source_id":"getty-aat.300179426","source_sha256":"85ae6b60a549c47e0e1cf108d78008bdbdc5ceeb938e66ebb4b2636cf90d77af","start":414}],"target_id":"concept.aat.300179426","target_kind":"node","target_sha256":"de3bca75262334ee57d893f859bf88918bb8c1d5c6b6b8a48f1eae6dbf62b167"}],"concept.aat.300179462":[{"id":"assertion.concept.aat.300179462","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"quality as defined in the captured Getty AAT record 300179462","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines quality as: Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","support":[{"end":687,"quote":"Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","source_id":"getty-aat.300179462","source_sha256":"82a62700d54d9d8c5a39169c16373536d47fa842b1c7f8613ee617e289293cd3","start":411}],"target_id":"concept.aat.300179462","target_kind":"node","target_sha256":"0f05efbb59a652a0418631f524649670f5d6315068ba295d42de95dcde126c03"}],"concept.aat.300185658":[{"id":"assertion.concept.aat.300185658","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"heaven as defined in the captured Getty AAT record 300185658","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines heaven as: Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","support":[{"end":554,"quote":"Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","source_id":"getty-aat.300185658","source_sha256":"1b4ab74ae4db13d9cc92804989124d452ee36dd137a566c567f2292f9babe952","start":410}],"target_id":"concept.aat.300185658","target_kind":"node","target_sha256":"58cf1acc869d69d68722354e3ee66e52b5bc7e752452d8aee85aa8e297103598"}],"concept.aat.300189645":[{"id":"assertion.concept.aat.300189645","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"urban design as defined in the captured Getty AAT record 300189645","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines urban design as: The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","support":[{"end":877,"quote":"The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","source_id":"getty-aat.300189645","source_sha256":"2465d7cdceef459d52d02cbeb0b9ac378a2e7c991484cbf5677ae40ad1c185f4","start":421}],"target_id":"concept.aat.300189645","target_kind":"node","target_sha256":"57e5ce50e38a241ab755ef2868ef4ed8713375299718c9177f637375e24512ea"}],"concept.aat.300190210":[{"id":"assertion.concept.aat.300190210","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"globalism as defined in the captured Getty AAT record 300190210","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines globalism as: The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","support":[{"end":805,"quote":"The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","source_id":"getty-aat.300190210","source_sha256":"1b19e1275f8fc00b22e0c91a3211c8e9423afaa9642261db163cc950f0823280","start":434}],"target_id":"concept.aat.300190210","target_kind":"node","target_sha256":"41a0fe156d06db655eda57c08893020f21b0afff242fe7a9ae623d65ee79ee43"}],"concept.aat.300193867":[{"id":"assertion.concept.aat.300193867","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"West Asian as defined in the captured Getty AAT record 300193867","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines West Asian as: Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","support":[{"end":610,"quote":"Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","source_id":"getty-aat.300193867","source_sha256":"6c1ee6808380ed270b97f2268c230cc73dd1cc3f45c05e78fd9adcf8d255a933","start":419}],"target_id":"concept.aat.300193867","target_kind":"node","target_sha256":"6eac77ac1f5bd29299ba29776d58424c5b22afe6a348408ff3c007bf0b6ae0aa"}],"concept.aat.300201023":[{"id":"assertion.concept.aat.300201023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myths as defined in the captured Getty AAT record 300201023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines myths as: Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","support":[{"end":725,"quote":"Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","source_id":"getty-aat.300201023","source_sha256":"f9b7d0ee410654d04288dafcd11c4354f84231e403abf5247bf0b429766f9222","start":422}],"target_id":"concept.aat.300201023","target_kind":"node","target_sha256":"58629b040017f7a2c41ab266245f014b53cd932de0edd90e004d82e88f2a909c"}],"concept.aat.300233660":[{"id":"assertion.concept.aat.300233660","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pluralism as defined in the captured Getty AAT record 300233660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pluralism as: Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","support":[{"end":776,"quote":"Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","source_id":"getty-aat.300233660","source_sha256":"2df60a4df68c61170fa82eb4537a8d326e17518a7f2fd99397ac9a54a2aca789","start":434}],"target_id":"concept.aat.300233660","target_kind":"node","target_sha256":"8a5522c812c519ada7dc8f888eabcf09c835120393158a929c7fd7f1a57e24b7"}],"concept.aat.300237780":[{"id":"assertion.concept.aat.300237780","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"image quality as defined in the captured Getty AAT record 300237780","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines image quality as: Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","support":[{"end":553,"quote":"Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","source_id":"getty-aat.300237780","source_sha256":"63311253de0669c5c1c2c8fb82c88065d486752851399cc6e4ee7598a9a29712","start":406}],"target_id":"concept.aat.300237780","target_kind":"node","target_sha256":"626c45bbffb063d3a73b29249defe326dcb61e1081d678f089df576f615fedcb"}],"concept.aat.300240013":[{"id":"assertion.concept.aat.300240013","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hmong as defined in the captured Getty AAT record 300240013","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hmong as: Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","support":[{"end":1325,"quote":"Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","source_id":"getty-aat.300240013","source_sha256":"295e9b4a37ab49f62308b5cd7927a486fa0f193360f561a5c5a4710131fcb5c6","start":392}],"target_id":"concept.aat.300240013","target_kind":"node","target_sha256":"94558c9dfdb61190e34d85ba96f86a59772339664adcf54c73976e46ae80fb44"}],"concept.aat.300244546":[{"id":"assertion.concept.aat.300244546","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"West Turkestani as defined in the captured Getty AAT record 300244546","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines West Turkestani as: Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","support":[{"end":564,"quote":"Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","source_id":"getty-aat.300244546","source_sha256":"5c288f0f85403a2a9c10a2259306bf2fe25398e703a98805f0c621322240e95b","start":400}],"target_id":"concept.aat.300244546","target_kind":"node","target_sha256":"849244f7aabd1cbe42153a77ab598870a20ca5ae13dc8740c7bfe6a85a790423"}],"concept.aat.300245255":[{"id":"assertion.concept.aat.300245255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Moroccan as defined in the captured Getty AAT record 300245255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Moroccan as: Style and culture of the nation of Morocco or its historical counterparts.","support":[{"end":521,"quote":"Style and culture of the nation of Morocco or its historical counterparts.","source_id":"getty-aat.300245255","source_sha256":"86dac1b4a1ffe7305db63aee0b6a7a123122ea2734f998405d6a87a2a9060821","start":447}],"target_id":"concept.aat.300245255","target_kind":"node","target_sha256":"4c9741ba6d59f2640339f0f3661aa58c0a49221d319dbf1636dd1b2430e0f3b2"}],"concept.aat.300247349":[{"id":"assertion.concept.aat.300247349","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chaos as defined in the captured Getty AAT record 300247349","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines chaos as: The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","support":[{"end":679,"quote":"The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","source_id":"getty-aat.300247349","source_sha256":"31f96e368f9595b3d60da8fdf7d5c257b78910d657c7f3b4f5d1acfd019424ed","start":412}],"target_id":"concept.aat.300247349","target_kind":"node","target_sha256":"53176e769542a93e2adcfa03308bfafbc2a04b6165dd517e9c51e56cbbfb2c53"}],"concept.aat.300257052":[{"id":"assertion.concept.aat.300257052","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"identity as defined in the captured Getty AAT record 300257052","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines identity as: Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","support":[{"end":572,"quote":"Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","source_id":"getty-aat.300257052","source_sha256":"c1d424f832cd2400c143459e77d685e0a1c16c0d3db8d85b1d73cbfa03027b38","start":415}],"target_id":"concept.aat.300257052","target_kind":"node","target_sha256":"6a8355d7860f3b5fd277f6a8d1d3ef2c6186a214cb4a2f116dd238d9970206e8"}],"concept.aat.300260338":[{"id":"assertion.concept.aat.300260338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paper engineering as defined in the captured Getty AAT record 300260338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paper engineering as: Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","support":[{"end":585,"quote":"Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","source_id":"getty-aat.300260338","source_sha256":"77eada6aa59aa97b29d28535eae3fc307abfa17f2ee8d8dd5600f0fb326d3d3f","start":420}],"target_id":"concept.aat.300260338","target_kind":"node","target_sha256":"f5b049131eac3abe5f29a52ea90eb0d3fa7346f9575c684f245f250bf6bec9d0"}],"concept.aat.300262583":[{"id":"assertion.concept.aat.300262583","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Senegalese as defined in the captured Getty AAT record 300262583","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Senegalese as: Style and culture of the people of Senegal.","support":[{"end":492,"quote":"Style and culture of the people of Senegal.","source_id":"getty-aat.300262583","source_sha256":"c677480f334556ba7c6bbad158ca4f60c6a83ff394cade9f75472e79047ed299","start":449}],"target_id":"concept.aat.300262583","target_kind":"node","target_sha256":"5b1ebeda01a4589cd7498bbb40d51b2a7b341997ddd401b1ea006af7cdda087f"}],"concept.aat.300262588":[{"id":"assertion.concept.aat.300262588","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern African as defined in the captured Getty AAT record 300262588","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern African as: Styles and cultures belonging to modern Africa, generally from the 19th century and later.","support":[{"end":547,"quote":"Styles and cultures belonging to modern Africa, generally from the 19th century and later.","source_id":"getty-aat.300262588","source_sha256":"8dc1f13f8dc063df3c7cc3d4861f3e6aa867e3554efa004f539d1f04d52d6259","start":457}],"target_id":"concept.aat.300262588","target_kind":"node","target_sha256":"2f0e56ef0bcb9072773f86331501665ee726501ea29a20a0bf00567fc84dc668"}],"concept.aat.300262589":[{"id":"assertion.concept.aat.300262589","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern East African as defined in the captured Getty AAT record 300262589","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern East African as: Styles and culture belonging to modern East Africa.","support":[{"end":490,"quote":"Styles and culture belonging to modern East Africa.","source_id":"getty-aat.300262589","source_sha256":"0321801ccb42b48bcd4af9adad9ca96e221501997f484cc827db557f08474181","start":439}],"target_id":"concept.aat.300262589","target_kind":"node","target_sha256":"2300257bdf1852e626a0185c5930f5d9970620f3eb9509c3247db45749fd1eaf"}],"concept.aat.300262631":[{"id":"assertion.concept.aat.300262631","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rwandese as defined in the captured Getty AAT record 300262631","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rwandese as: The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","support":[{"end":588,"quote":"The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","source_id":"getty-aat.300262631","source_sha256":"cfc47cf938a57b6aa44fc8e40dbfcece83463f002c43ccd73da71a0ab0c6db48","start":447}],"target_id":"concept.aat.300262631","target_kind":"node","target_sha256":"bad5a2d75a140e38080c99f564f5794c1e9915c447cf3362644605a78e60aace"}],"concept.aat.300262632":[{"id":"assertion.concept.aat.300262632","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Seychellois as defined in the captured Getty AAT record 300262632","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Seychellois as: Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","support":[{"end":574,"quote":"Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","source_id":"getty-aat.300262632","source_sha256":"12bb68c13cd154f76a185c59dcec99246c16c3d800fac7400ee3959f14df23bb","start":450}],"target_id":"concept.aat.300262632","target_kind":"node","target_sha256":"30714c6728f9000354721273c941a870b193055c1bb39f859535f1467d0eed9e"}],"concept.aat.300262633":[{"id":"assertion.concept.aat.300262633","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sierra Leonean as defined in the captured Getty AAT record 300262633","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sierra Leonean as: Style and culture of the nation of Sierra Leone.","support":[{"end":501,"quote":"Style and culture of the nation of Sierra Leone.","source_id":"getty-aat.300262633","source_sha256":"fb1b304e89c4e60b037e7fb56d64f4af32816468fdf513a81928a0594c6422c5","start":453}],"target_id":"concept.aat.300262633","target_kind":"node","target_sha256":"d3c3c0ec438261235d5f23863c81ea11e57d19cb3feadec2c0043b85bd885db6"}],"concept.aat.300262634":[{"id":"assertion.concept.aat.300262634","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sao Tomean as defined in the captured Getty AAT record 300262634","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sao Tomean as: Style and culture of the nation of São Tomé and Príncipe.","support":[{"end":506,"quote":"Style and culture of the nation of São Tomé and Príncipe.","source_id":"getty-aat.300262634","source_sha256":"9bf1760ddda28f5c4c2e4fe080fae61bf973854cbf727212c85561ea788ff222","start":449}],"target_id":"concept.aat.300262634","target_kind":"node","target_sha256":"1a19afb08c4b95aefe4acdce18d33b05c3d4024722d868e6f5b8af2e5c91184c"}],"concept.aat.300262638":[{"id":"assertion.concept.aat.300262638","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Djiboutian as defined in the captured Getty AAT record 300262638","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Djiboutian as: Style and culture of the nation of Dijbouti.","support":[{"end":493,"quote":"Style and culture of the nation of Dijbouti.","source_id":"getty-aat.300262638","source_sha256":"976c28c3d730b068b8f424aee6c481d64565b6e888f6a9dac163f629acf90c6d","start":449}],"target_id":"concept.aat.300262638","target_kind":"node","target_sha256":"ec87bb40fae62845a59c2e997def234fca75712f690a3a506c79238a1d07e32e"}],"concept.aat.300262640":[{"id":"assertion.concept.aat.300262640","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Libyan as defined in the captured Getty AAT record 300262640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Libyan as: Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","support":[{"end":564,"quote":"Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","source_id":"getty-aat.300262640","source_sha256":"348fa62410544f6188a765099ed3c91b7d629e6101739fe66e8ef0c5318165bd","start":445}],"target_id":"concept.aat.300262640","target_kind":"node","target_sha256":"726d2c571a8f7e8a02bffd6e651e57463d3f38a6d2d3f1c2081d2612a24fbf63"}],"concept.aat.300262641":[{"id":"assertion.concept.aat.300262641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Malawian as defined in the captured Getty AAT record 300262641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Malawian as: Style and culture of people of the nation of Malawi.","support":[{"end":499,"quote":"Style and culture of people of the nation of Malawi.","source_id":"getty-aat.300262641","source_sha256":"99f48b037e1af82783e248d10c0083a58caed40482e98e2512f1174d5fe1f9ca","start":447}],"target_id":"concept.aat.300262641","target_kind":"node","target_sha256":"5927406cf851b160ab76a0775d46142b9d2bec5e704265513a3917835d7fa361"}],"concept.aat.300262644":[{"id":"assertion.concept.aat.300262644","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Equatorial Guinean as defined in the captured Getty AAT record 300262644","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Equatorial Guinean as: Style and culture of the people of Equatorial Guinea.","support":[{"end":510,"quote":"Style and culture of the people of Equatorial Guinea.","source_id":"getty-aat.300262644","source_sha256":"60e9394a6c2df67354213ee4ea34b32a597f5687f8ddd6e7f5a0406770fabf55","start":457}],"target_id":"concept.aat.300262644","target_kind":"node","target_sha256":"4de66723396ab49e3fd8f4a89429ba2fca87814e2d6f53b63869bb4548e6a72b"}],"concept.aat.300262645":[{"id":"assertion.concept.aat.300262645","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eritrean as defined in the captured Getty AAT record 300262645","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eritrean as: Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","support":[{"end":574,"quote":"Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","source_id":"getty-aat.300262645","source_sha256":"bde3ec475a88f8d077073c42c4b39792b1fa7848962376269a314a0be43cc95a","start":447}],"target_id":"concept.aat.300262645","target_kind":"node","target_sha256":"9372e5ff2276ea3533afdd8a6c8f34387388cb271c945461148484678b6be966"}],"concept.aat.300262648":[{"id":"assertion.concept.aat.300262648","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gabonese as defined in the captured Getty AAT record 300262648","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gabonese as: Style and culture of the inhabitants of the nation of Gabon.","support":[{"end":507,"quote":"Style and culture of the inhabitants of the nation of Gabon.","source_id":"getty-aat.300262648","source_sha256":"4f8b242e2e73308ab3f9774b334ad62eb42d71f7e697d2d8b561caa23e73b719","start":447}],"target_id":"concept.aat.300262648","target_kind":"node","target_sha256":"978e2b71cf6e4fdc9b772847bd85ed62a6b83d4a4e65872a101c43768bc34e6e"}],"concept.aat.300262649":[{"id":"assertion.concept.aat.300262649","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gambian as defined in the captured Getty AAT record 300262649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gambian as: Style and culture of inhabitants of the nation of Gambia.","support":[{"end":503,"quote":"Style and culture of inhabitants of the nation of Gambia.","source_id":"getty-aat.300262649","source_sha256":"05699f71d4a1a6dae7f1484b4a7026a4677efcc8b58f21a19096b79b0cd0f28b","start":446}],"target_id":"concept.aat.300262649","target_kind":"node","target_sha256":"e1e468c94fe5a992d948369eae8154211f4213bc6b5af1dc19f16b151b5ab37b"}],"concept.aat.300262650":[{"id":"assertion.concept.aat.300262650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Guinean as defined in the captured Getty AAT record 300262650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Guinean as: Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","support":[{"end":690,"quote":"Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","source_id":"getty-aat.300262650","source_sha256":"a9c558397e56b90203fe4203d79418c48e98d1df07d36513592da5f18bc33466","start":446}],"target_id":"concept.aat.300262650","target_kind":"node","target_sha256":"ef11008d65020f937996e1accd05a5afbb474eb71ae2e7698472c66ea7eb7ce5"}],"concept.aat.300262651":[{"id":"assertion.concept.aat.300262651","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ghanaian as defined in the captured Getty AAT record 300262651","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ghanaian as: Style and culture of the people of the nation of Ghana.","support":[{"end":502,"quote":"Style and culture of the people of the nation of Ghana.","source_id":"getty-aat.300262651","source_sha256":"687684c3e09bf5fb190ead175300f54ede816000b94930b43f2047a3b7529079","start":447}],"target_id":"concept.aat.300262651","target_kind":"node","target_sha256":"245642367be35e4743cfb2eb19d7ba4352947b37ecb842fe4219bfebafdbc8c9"}],"concept.aat.300262652":[{"id":"assertion.concept.aat.300262652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Guinea-Bissauan as defined in the captured Getty AAT record 300262652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Guinea-Bissauan as: Style and culture of the people from Guinea-Bissau.","support":[{"end":505,"quote":"Style and culture of the people from Guinea-Bissau.","source_id":"getty-aat.300262652","source_sha256":"084ea275807876b0b082024e632bb2fb9d3a28c867a3e2074ff8b509e23d1dcd","start":454}],"target_id":"concept.aat.300262652","target_kind":"node","target_sha256":"8c55a4ca44067fb4d485498ebb83797827c1ebb67cc08b0d96ca274b710c00c9"}],"concept.aat.300262653":[{"id":"assertion.concept.aat.300262653","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ivorian as defined in the captured Getty AAT record 300262653","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ivorian as: Style and culture of the Ivory Coast.","support":[{"end":483,"quote":"Style and culture of the Ivory Coast.","source_id":"getty-aat.300262653","source_sha256":"fb4310284ce14f66702dc7a37497c7b31fef61ffdd247c2707ab4abc4ad14aea","start":446}],"target_id":"concept.aat.300262653","target_kind":"node","target_sha256":"453185514d394c29435abceec57260f84e2d615ae3c8efae6f95729a40b6b795"}],"concept.aat.300262654":[{"id":"assertion.concept.aat.300262654","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kenyan as defined in the captured Getty AAT record 300262654","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kenyan as: Style and culture of Kenya.","support":[{"end":472,"quote":"Style and culture of Kenya.","source_id":"getty-aat.300262654","source_sha256":"eef2dcfd9df94d7c2260554f815be9ee1bdae1f5ffb6c6eca4453457495c2ba2","start":445}],"target_id":"concept.aat.300262654","target_kind":"node","target_sha256":"bb2bb64b459e86afc72d80b419c1fc9e53dd2efc1baa793dfb9f6db638bfc8a5"}],"concept.aat.300262655":[{"id":"assertion.concept.aat.300262655","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Lesotho as defined in the captured Getty AAT record 300262655","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Lesotho as: Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","support":[{"end":527,"quote":"Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","source_id":"getty-aat.300262655","source_sha256":"c757a81dc56f86bf5e75c1aee50e76d2e364d1a78f86922fb678cba934269e46","start":446}],"target_id":"concept.aat.300262655","target_kind":"node","target_sha256":"b76ce663e9a1a544cb538a9932c46ec956f9c713b6f7dcebec1d7958b6db3d98"}],"concept.aat.300262698":[{"id":"assertion.concept.aat.300262698","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sudanese as defined in the captured Getty AAT record 300262698","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sudanese as: Style and culture of the people of the Sudan.","support":[{"end":492,"quote":"Style and culture of the people of the Sudan.","source_id":"getty-aat.300262698","source_sha256":"1fa50ad044cd472c979f4eddc5b725e121ee22b2bd82b68bcdbb08f66e1bb5ee","start":447}],"target_id":"concept.aat.300262698","target_kind":"node","target_sha256":"c051e0d8a910cf289f7e0a18a9f6120a93f097c9d029e93396769fc962308010"}],"concept.aat.300262699":[{"id":"assertion.concept.aat.300262699","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Algerian as defined in the captured Getty AAT record 300262699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Algerian as: Style and culture of the people of Algeria or Algiers, in northern Africa.","support":[{"end":521,"quote":"Style and culture of the people of Algeria or Algiers, in northern Africa.","source_id":"getty-aat.300262699","source_sha256":"3b674427153cbfba79e8479f310ac8c8318848335c8dd2c2afa355a7ee239e04","start":447}],"target_id":"concept.aat.300262699","target_kind":"node","target_sha256":"3bb9d7c1ba1555471d35180858ba66ef0a1cc6e8340424f6f4b1032d0a89c925"}],"concept.aat.300262700":[{"id":"assertion.concept.aat.300262700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Angolan as defined in the captured Getty AAT record 300262700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Angolan as: Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","support":[{"end":554,"quote":"Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","source_id":"getty-aat.300262700","source_sha256":"ca5d7aac00e2fc82268fe984dd30b914902b128fbd9fe5db5e010691bd5f6f2e","start":446}],"target_id":"concept.aat.300262700","target_kind":"node","target_sha256":"4a69dd2c53bb91d58bcaac4d879417068a4ee8bf778c3dbe7f6136acfc6fdaf1"}],"concept.aat.300262701":[{"id":"assertion.concept.aat.300262701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cape Verdean as defined in the captured Getty AAT record 300262701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cape Verdean as: Style and culture of the people of Cape Verde.","support":[{"end":497,"quote":"Style and culture of the people of Cape Verde.","source_id":"getty-aat.300262701","source_sha256":"4e7fae3a1e8831a95499520aa9428e8f230839e742d7747899465a0d302c451b","start":451}],"target_id":"concept.aat.300262701","target_kind":"node","target_sha256":"38c12be9c57c430a0598486ea74410f927c744beb6eb1188311697758c6f6ee3"}],"concept.aat.300262702":[{"id":"assertion.concept.aat.300262702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burkina Faso as defined in the captured Getty AAT record 300262702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burkina Faso as: Style and culture of the people of Burkina Faso.","support":[{"end":499,"quote":"Style and culture of the people of Burkina Faso.","source_id":"getty-aat.300262702","source_sha256":"46911c3105ec1ff70774deb8b23e4d4e4d6c861707f52890bb0bc6fc7b8970ff","start":451}],"target_id":"concept.aat.300262702","target_kind":"node","target_sha256":"5117c4b28d3663ff162efe24a0cfd7a2a98870d7d17858cb839642517abe221f"}],"concept.aat.300262703":[{"id":"assertion.concept.aat.300262703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burundi as defined in the captured Getty AAT record 300262703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burundi as: Style and culture of the people of Burundi.","support":[{"end":489,"quote":"Style and culture of the people of Burundi.","source_id":"getty-aat.300262703","source_sha256":"ac745da7f0f58234287ac6efa06508500a630273a13d96eaad37bf2acf67c373","start":446}],"target_id":"concept.aat.300262703","target_kind":"node","target_sha256":"97d7f28576812036170f4b0c51f708657d340068283dd3f708a00700c31a3e3b"}],"concept.aat.300262705":[{"id":"assertion.concept.aat.300262705","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Somalian as defined in the captured Getty AAT record 300262705","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Somalian as: General national designation of the nation of Somalia, the Somali Democratic Republic.","support":[{"end":533,"quote":"General national designation of the nation of Somalia, the Somali Democratic Republic.","source_id":"getty-aat.300262705","source_sha256":"9fcef4e9606d084b6f40421bebde05ae8c99b33ea54c52389d1b3f4a1caa1e24","start":447}],"target_id":"concept.aat.300262705","target_kind":"node","target_sha256":"001c2d6a49168a4ef083a4ee906091b4c9d06f09f960fe575bc432a75a8b46e6"}],"concept.aat.300262706":[{"id":"assertion.concept.aat.300262706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"South African as defined in the captured Getty AAT record 300262706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.","support":[{"end":500,"quote":"Style and culture of the people of South Africa.","source_id":"getty-aat.300262706","source_sha256":"786431750b7db042f63cdeb33b85395e3b1fec5ee1e7aa4734e8f6677e0c3b86","start":452}],"target_id":"concept.aat.300262706","target_kind":"node","target_sha256":"d95ebbc4e5d415404630d8211aa362cff5ddca3dd1438ca26f0391356ce82b39"}],"concept.aat.300262707":[{"id":"assertion.concept.aat.300262707","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tanzanian as defined in the captured Getty AAT record 300262707","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tanzanian as: Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","support":[{"end":577,"quote":"Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","source_id":"getty-aat.300262707","source_sha256":"261b0fa509b4f4c4dc23a76046a49e7ddd5870cef68acc06e2ffc7e00c6aae49","start":448}],"target_id":"concept.aat.300262707","target_kind":"node","target_sha256":"54540565850268f4cf476a58c7ccbafa5e4038fd3eddcebd7356bd1e3083991c"}],"concept.aat.300262708":[{"id":"assertion.concept.aat.300262708","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Chadian as defined in the captured Getty AAT record 300262708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Chadian as: Style or culture of the nation of Chad.","support":[{"end":485,"quote":"Style or culture of the nation of Chad.","source_id":"getty-aat.300262708","source_sha256":"e61329e6d443e48b592aae748c8c11c91730809f3e488be2af907b76b36edcfa","start":446}],"target_id":"concept.aat.300262708","target_kind":"node","target_sha256":"f65a7e243bc0dbe7708cd536cd9ce947e9b008b9af7317cfb7c038254d81636b"}],"concept.aat.300262709":[{"id":"assertion.concept.aat.300262709","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Togolese as defined in the captured Getty AAT record 300262709","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Togolese as: Nationality, style, or culture of the West African state of Togo (formerly Togoland).","support":[{"end":532,"quote":"Nationality, style, or culture of the West African state of Togo (formerly Togoland).","source_id":"getty-aat.300262709","source_sha256":"69da49e81b94000dfa294f027b168e04c2f9771c3f2102bbd9d458ba8a02448d","start":447}],"target_id":"concept.aat.300262709","target_kind":"node","target_sha256":"4330a020b6deb5ef3a610ec9cfeea958d8b790de2dea2cf1d3d76510a36509af"}],"concept.aat.300262723":[{"id":"assertion.concept.aat.300262723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mauritian as defined in the captured Getty AAT record 300262723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mauritian as: The style and culture of the island of Mauritius in the Indian Ocean.","support":[{"end":517,"quote":"The style and culture of the island of Mauritius in the Indian Ocean.","source_id":"getty-aat.300262723","source_sha256":"0711fc782bf0cf3264a2840c5b86458d90ff6fe8d849894e6f9ab5a10e98a655","start":448}],"target_id":"concept.aat.300262723","target_kind":"node","target_sha256":"8b4666d27a041c0aad0d765ed9c9844130bd37aaefb489981df2c4194c2a43c0"}],"concept.aat.300262724":[{"id":"assertion.concept.aat.300262724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mahoran as defined in the captured Getty AAT record 300262724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mahoran as: Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","support":[{"end":545,"quote":"Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","source_id":"getty-aat.300262724","source_sha256":"28eaa7b498b9086bb7bd45a7e75278d27a4840a6f6fbd921dd41b164a8582893","start":446}],"target_id":"concept.aat.300262724","target_kind":"node","target_sha256":"9e2596d9b5b43105ae6d1c228b936ac0fd44da2729fc13bf5312dde5043030bd"}],"concept.aat.300262725":[{"id":"assertion.concept.aat.300262725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mozambican as defined in the captured Getty AAT record 300262725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mozambican as: Style and culture of the nation of Mozambique.","support":[{"end":495,"quote":"Style and culture of the nation of Mozambique.","source_id":"getty-aat.300262725","source_sha256":"5e1a5e197f3edd8c29de2cc75f29b88ba630b645cb9c08fdcc9879f1d9207819","start":449}],"target_id":"concept.aat.300262725","target_kind":"node","target_sha256":"8aa1d35ec62d5d1ed3402db1254ebe62a6ef98fc8042e9c83ee9bb0f0e7f0f54"}],"concept.aat.300262726":[{"id":"assertion.concept.aat.300262726","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Namibian as defined in the captured Getty AAT record 300262726","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Namibian as: Style and culture of the people of the nation of Namibia or of the Namib desert.","support":[{"end":527,"quote":"Style and culture of the people of the nation of Namibia or of the Namib desert.","source_id":"getty-aat.300262726","source_sha256":"7917615d42b7d149e950a3f9a21d8e420ba73579f2c674db65745cda90d9afbc","start":447}],"target_id":"concept.aat.300262726","target_kind":"node","target_sha256":"c489bd395321f79db72298b815b0b68ca37c5f8e3e37631ef0b121009d599870"}],"concept.aat.300262992":[{"id":"assertion.concept.aat.300262992","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cameroonian as defined in the captured Getty AAT record 300262992","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cameroonian as: Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","support":[{"end":547,"quote":"Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","source_id":"getty-aat.300262992","source_sha256":"6ac7110018964953116855cbd7d55bb44e7566611c57f615c9ae74233fdfa039","start":450}],"target_id":"concept.aat.300262992","target_kind":"node","target_sha256":"c809a259bd56593219f13d359992e0d2d93436a1d3b14ab5c6790ad86b1ede2b"}],"concept.aat.300262993":[{"id":"assertion.concept.aat.300262993","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Beninese as defined in the captured Getty AAT record 300262993","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Beninese as: Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","support":[{"end":615,"quote":"Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","source_id":"getty-aat.300262993","source_sha256":"5709849bcb7810d240ca329c4b6118e89921ce3e9c8cf2d6c971fa83660307bd","start":447}],"target_id":"concept.aat.300262993","target_kind":"node","target_sha256":"c8c101ecedde26557dc7f23427214da6138333ccd8da42972ade3ba30e1a7ddd"}],"concept.aat.300263186":[{"id":"assertion.concept.aat.300263186","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biblical as defined in the captured Getty AAT record 300263186","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines biblical as: Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","support":[{"end":532,"quote":"Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","source_id":"getty-aat.300263186","source_sha256":"d83a3ee774bd1f0cb1bcdac87967c90972f4a4b6a2b14d4361fd335eadfcb19e","start":424}],"target_id":"concept.aat.300263186","target_kind":"node","target_sha256":"a6018fd4242f4712ec9d3687b9a30bd5425c139b3c5a11411c9a7f2f8955d9d6"}],"concept.aat.300263250":[{"id":"assertion.concept.aat.300263250","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"grammar (discipline) as defined in the captured Getty AAT record 300263250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines grammar (discipline) as: The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","support":[{"end":570,"quote":"The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","source_id":"getty-aat.300263250","source_sha256":"380459c5ded74bd614c131652b90604ac3679fca0b79fcead59d2dc406e76976","start":414}],"target_id":"concept.aat.300263250","target_kind":"node","target_sha256":"de1a18159dfb12650fc6a91a70eeca2f4008b306f8cfce32e337ab2ba298b2b3"}],"concept.aat.300263699":[{"id":"assertion.concept.aat.300263699","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ugandan as defined in the captured Getty AAT record 300263699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ugandan as: The style and culture of the central African State, Uganda.","support":[{"end":505,"quote":"The style and culture of the central African State, Uganda.","source_id":"getty-aat.300263699","source_sha256":"165a35ec34e70ea3c8af6ea7488d5f673fdee043edb9d59c8608b2e77a474ad5","start":446}],"target_id":"concept.aat.300263699","target_kind":"node","target_sha256":"eaca1c095b248303cd389b230e626443e09481df254b8081f00ac6dd7d064229"}],"concept.aat.300263700":[{"id":"assertion.concept.aat.300263700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Zambian as defined in the captured Getty AAT record 300263700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Zambian as: The style and culture of the south central African country, Zambia (formerly Northern Rhodesia).","support":[{"end":543,"quote":"The style and culture of  the south central African country, Zambia (formerly Northern Rhodesia).","source_id":"getty-aat.300263700","source_sha256":"3a5fa764ba7df57910351abe8c079bcb5f5845b8a56737cd9c2f1e48f6bea268","start":446}],"target_id":"concept.aat.300263700","target_kind":"node","target_sha256":"f11a711469682f8c0a436d71ccf638aeab4d215042de719dc042b2c64efb2e29"}],"concept.aat.300263701":[{"id":"assertion.concept.aat.300263701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Zimbabwean as defined in the captured Getty AAT record 300263701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Zimbabwean as: The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","support":[{"end":529,"quote":"The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","source_id":"getty-aat.300263701","source_sha256":"e21a8a7b4e0e635dbfcf30c6808a60adf2fdd06d777c8d5875cdb279af90875c","start":449}],"target_id":"concept.aat.300263701","target_kind":"node","target_sha256":"bba8931712ffcc6182d218e12505ce7452540942345f25f91cdb3c51c109df2f"}],"concept.aat.300264088":[{"id":"assertion.concept.aat.300264088","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Styles and Periods Facet as defined in the captured Getty AAT record 300264088","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Styles and Periods Facet as: Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","support":[{"end":595,"quote":"Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","source_id":"getty-aat.300264088","source_sha256":"e38e624ed93ac33f5e8e016d0b51ae0968baf05eb9d8aa59bb77a91d23de42e0","start":343}],"target_id":"concept.aat.300264088","target_kind":"node","target_sha256":"c5e6921a816238bcc9b9277542eda3e1bae8c8284543661c1afd6e93a666a446"}],"concept.aat.300264303":[{"id":"assertion.concept.aat.300264303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"absolution as defined in the captured Getty AAT record 300264303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines absolution as: A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","support":[{"end":689,"quote":"A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","source_id":"getty-aat.300264303","source_sha256":"3e80640ab4572672d6efd14e911c967eb7f1a6e349347b777cd482ab044affcb","start":414}],"target_id":"concept.aat.300264303","target_kind":"node","target_sha256":"e09fc24b87d5eebde826ec103a717522097dbb857c59a2207792d79aefbdd685"}],"concept.aat.300264304":[{"id":"assertion.concept.aat.300264304","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"afterlife as defined in the captured Getty AAT record 300264304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines afterlife as: The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","support":[{"end":554,"quote":"The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","source_id":"getty-aat.300264304","source_sha256":"d71a85f77b7b893d76ff80dde284b273c7df3273baef4f79a7e16a0519446e5b","start":413}],"target_id":"concept.aat.300264304","target_kind":"node","target_sha256":"1ddf32c57128eacf22baaabd07ebeaed6fd66d83217efda2a1558a0f56b2ca0c"}],"concept.aat.300264305":[{"id":"assertion.concept.aat.300264305","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ahimsa as defined in the captured Getty AAT record 300264305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ahimsa as: Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","support":[{"end":848,"quote":"Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","source_id":"getty-aat.300264305","source_sha256":"f16053a553cb81912fe1f57a878145ca51cb11e19fc7d4972c535e88f0aa2983","start":415}],"target_id":"concept.aat.300264305","target_kind":"node","target_sha256":"675999eea9d67662adea5801dfd6eefc515a6ef5b7d9d9aa5b90af8167262525"}],"concept.aat.300264310":[{"id":"assertion.concept.aat.300264310","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dreaming, the as defined in the captured Getty AAT record 300264310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dreaming, the as: A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","support":[{"end":1253,"quote":"A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","source_id":"getty-aat.300264310","source_sha256":"09b8add09f9e3b3fb0c972ab7ff4fdb8c1f7a9fd128fc791fd7d24ff3c287dad","start":429}],"target_id":"concept.aat.300264310","target_kind":"node","target_sha256":"d0ddda2fbfdb9c3534a53d317bc99d80d472562ba538a97effc2da03c9f43f5c"}],"concept.aat.300264321":[{"id":"assertion.concept.aat.300264321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ascension as defined in the captured Getty AAT record 300264321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ascension as: The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","support":[{"end":648,"quote":"The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","source_id":"getty-aat.300264321","source_sha256":"b94b70c7dac782ad11c56c508b8344e35eda6c9bfc1fcf9cccd59253a131f985","start":413}],"target_id":"concept.aat.300264321","target_kind":"node","target_sha256":"569cc6adbb5b83ccf8fce6b704b6f8d5f6cc6bf62ed65263d2c71d895ca02ebe"}],"concept.aat.300264322":[{"id":"assertion.concept.aat.300264322","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"asceticism as defined in the captured Getty AAT record 300264322","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines asceticism as: Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","support":[{"end":769,"quote":"Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","source_id":"getty-aat.300264322","source_sha256":"faa39e376092f13edcecdaa817b61212afe0478f4539f7d790c43c0887dc7ae4","start":416}],"target_id":"concept.aat.300264322","target_kind":"node","target_sha256":"f98b17c9b9805fd03c9bd8059edadaeb52111d4746acbfd439adb49ce883a4d0"}],"concept.aat.300264335":[{"id":"assertion.concept.aat.300264335","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"auspicia as defined in the captured Getty AAT record 300264335","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines auspicia as: In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","support":[{"end":829,"quote":"In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","source_id":"getty-aat.300264335","source_sha256":"6802ddb7b20e2a1d6e39501d91cae67deb7f91c2da3cbda9ced7ca7ddf027a50","start":424}],"target_id":"concept.aat.300264335","target_kind":"node","target_sha256":"9ef186cee039b50da618bbc6133edc64b9cd8a27f0f5b8ad8a56434ad3d325a6"}],"concept.aat.300264336":[{"id":"assertion.concept.aat.300264336","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"avatara as defined in the captured Getty AAT record 300264336","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines avatara as: Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","support":[{"end":1208,"quote":"Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","source_id":"getty-aat.300264336","source_sha256":"85cb68c776ee98e526637546556147c7056201dce9f8b565fef5c7e79907a76b","start":417}],"target_id":"concept.aat.300264336","target_kind":"node","target_sha256":"34e9201fd8568fd3b3ad4386d005662310d177f561d2a3a64f44b4bace7d210d"}],"concept.aat.300264338":[{"id":"assertion.concept.aat.300264338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bardo as defined in the captured Getty AAT record 300264338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bardo as: In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","support":[{"end":588,"quote":"In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","source_id":"getty-aat.300264338","source_sha256":"8868e36ba4c2d4477ba9895bcb93ac1d73428b965d22a704e906b590c115ae46","start":418}],"target_id":"concept.aat.300264338","target_kind":"node","target_sha256":"80bea22c121f99d6cce25c349ce3cfe96b7d6301c3f4fc92660e69de002f78c9"}],"concept.aat.300264356":[{"id":"assertion.concept.aat.300264356","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bhakti as defined in the captured Getty AAT record 300264356","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bhakti as: In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","support":[{"end":819,"quote":"In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","source_id":"getty-aat.300264356","source_sha256":"41ce946dc5f33f6cd40bead70de789b01cdf1b307cbe027e98a65e7461c2af60","start":416}],"target_id":"concept.aat.300264356","target_kind":"node","target_sha256":"3d234517812a7dae78bbdbb86f91460fadd84eebc7cebf9c3bd4dde830988ba8"}],"concept.aat.300264359":[{"id":"assertion.concept.aat.300264359","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"blasphemy as defined in the captured Getty AAT record 300264359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines blasphemy as: An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","support":[{"end":573,"quote":"An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","source_id":"getty-aat.300264359","source_sha256":"7a15369977b6cbf5f7057906aa215e29c1c5446abfa92f2785fa680a9f842435","start":425}],"target_id":"concept.aat.300264359","target_kind":"node","target_sha256":"57ff3bd805d783c3cff96bc07b6f2a32461e3520543dbe8eef726e720fdc0d9f"}],"concept.aat.300264365":[{"id":"assertion.concept.aat.300264365","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"samsara as defined in the captured Getty AAT record 300264365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines samsara as: The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","support":[{"end":742,"quote":"The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","source_id":"getty-aat.300264365","source_sha256":"8d6f430d549a16a4e4733e93d860c1db700a70e3afb8dc8ed28aa511e5fab796","start":417}],"target_id":"concept.aat.300264365","target_kind":"node","target_sha256":"8271f6c94c3f3e13761567d09704edc0ed7cb37208a81fc7b79a9979fc55e9a1"}],"concept.aat.300264368":[{"id":"assertion.concept.aat.300264368","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Augustinianism as defined in the captured Getty AAT record 300264368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Augustinianism as: Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern. Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","support":[{"end":1442,"quote":"Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern.  Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","source_id":"getty-aat.300264368","source_sha256":"48814d04ce837a0087aea9840882f4a1c435fa964bc8c814cf7a7ab1e20da618","start":439}],"target_id":"concept.aat.300264368","target_kind":"node","target_sha256":"e148a5cf1f4c050451b5761972c67bb5c2975933f6285fe5fc12c78aee0fdbdb"}],"concept.aat.300264384":[{"id":"assertion.concept.aat.300264384","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dharma as defined in the captured Getty AAT record 300264384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dharma as: Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","support":[{"end":1694,"quote":"Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","source_id":"getty-aat.300264384","source_sha256":"898cc404827f16def3b35513416518cc282783497df3ecaa8bddace19256f2f5","start":419}],"target_id":"concept.aat.300264384","target_kind":"node","target_sha256":"297cf6df9e31ffcedecfe9713ba2aed06271759481c59b5d3991b34aadc84c62"}],"concept.aat.300264385":[{"id":"assertion.concept.aat.300264385","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"moksha as defined in the captured Getty AAT record 300264385","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines moksha as: In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","support":[{"end":1045,"quote":"In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","source_id":"getty-aat.300264385","source_sha256":"5446d7d2f0b41d8e0f448b2015549472eaf2f94a9fec5726e220b013691be834","start":416}],"target_id":"concept.aat.300264385","target_kind":"node","target_sha256":"eea96fc09d2438d15f5fc6570fe31fa52414004738ac2f60a2e0fc2c26008805"}],"concept.aat.300264386":[{"id":"assertion.concept.aat.300264386","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"trimurti as defined in the captured Getty AAT record 300264386","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines trimurti as: Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","support":[{"end":876,"quote":"Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","source_id":"getty-aat.300264386","source_sha256":"a9cf9905fbff5e264bc45df1934368ddfc8a91c73da86de286d8d9afe8918fb1","start":418}],"target_id":"concept.aat.300264386","target_kind":"node","target_sha256":"5d100725274e4515db344e23ac2ea5a79d51b9c0cc0d7bf15673f0d9bc92900c"}],"concept.aat.300264429":[{"id":"assertion.concept.aat.300264429","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pre-Islamic as defined in the captured Getty AAT record 300264429","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pre-Islamic as: Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","support":[{"end":945,"quote":"Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","source_id":"getty-aat.300264429","source_sha256":"165e4f6951cd2723247997f7bda8cab599d19f2e0ffe308e12aaee5b44e8d212","start":433}],"target_id":"concept.aat.300264429","target_kind":"node","target_sha256":"a555aa1ae439725d1877672b63e1b62c61a2626b92f3b0f8be64dcb471493757"}],"concept.aat.300264475":[{"id":"assertion.concept.aat.300264475","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"group identity as defined in the captured Getty AAT record 300264475","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines group identity as: An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","support":[{"end":672,"quote":"An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","source_id":"getty-aat.300264475","source_sha256":"8578ed6972de1a162ec59e768a80698b7175a31067a94f8bfa797c9cdcbc66f1","start":411}],"target_id":"concept.aat.300264475","target_kind":"node","target_sha256":"0323ab616702f03fac8e5f47ababf279c56dff537d0c139fb74431e86ff127ca"}],"concept.aat.300264482":[{"id":"assertion.concept.aat.300264482","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"consubstantiation as defined in the captured Getty AAT record 300264482","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines consubstantiation as: The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","support":[{"end":844,"quote":"The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","source_id":"getty-aat.300264482","source_sha256":"8fd09846f42928e197561ade5eb2b07999a60fa03883f3fe3314195330d2587e","start":431}],"target_id":"concept.aat.300264482","target_kind":"node","target_sha256":"200b5e3940d2fb1d8c5083eda6bf5cb0a83ace1dea9180c8b3a7acfb760da932"}],"concept.aat.300264486":[{"id":"assertion.concept.aat.300264486","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nirvana as defined in the captured Getty AAT record 300264486","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nirvana as: Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","support":[{"end":896,"quote":"Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","source_id":"getty-aat.300264486","source_sha256":"cb535e328f32596db5e407db8987584eb9faf84c8bfb3e1b49400d359801ce74","start":420}],"target_id":"concept.aat.300264486","target_kind":"node","target_sha256":"9021e02199367e8ed41996e386b7353417b13ee2d190ec34243db611377d25c2"}],"concept.aat.300264504":[{"id":"assertion.concept.aat.300264504","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Deism as defined in the captured Getty AAT record 300264504","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Deism as: Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","support":[{"end":1505,"quote":"Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","source_id":"getty-aat.300264504","source_sha256":"33f5d068be5c8ab900d999de09f8f127ecc75105aa9535f79209e1e5df60957d","start":411}],"target_id":"concept.aat.300264504","target_kind":"node","target_sha256":"164a68bc6bb834bb579cb36ec4a749df63cb785a7b4a3c3ec55d5e01d9a7aa23"}],"concept.aat.300264527":[{"id":"assertion.concept.aat.300264527","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hindu doctrinal concepts as defined in the captured Getty AAT record 300264527","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hindu doctrinal concepts as: Concepts related to the doctrine of Hinduism.","support":[{"end":473,"quote":"Concepts related to the doctrine of Hinduism.","source_id":"getty-aat.300264527","source_sha256":"e6e33765190936454b973c717396079fa1a80866b42f15ffe100ad9f05ff52ec","start":428}],"target_id":"concept.aat.300264527","target_kind":"node","target_sha256":"57e5ba8ed1258353dad648144b36645315c813c9c9b6c1bb214066fdb8ddfe05"}],"concept.aat.300264528":[{"id":"assertion.concept.aat.300264528","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Christian doctrinal concepts as defined in the captured Getty AAT record 300264528","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Christian doctrinal concepts as: Concepts related to the doctrine of Christianity.","support":[{"end":481,"quote":"Concepts related to the doctrine of Christianity.","source_id":"getty-aat.300264528","source_sha256":"56c658e41e7e69780dcb10051f4608b96a3e493723c9372776a7dc595a1bfdfb","start":432}],"target_id":"concept.aat.300264528","target_kind":"node","target_sha256":"e31864bc073a0e8b485227304406140a557c85b62468aac7917e61495275826b"}],"concept.aat.300264529":[{"id":"assertion.concept.aat.300264529","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Buddhist doctrinal concepts as defined in the captured Getty AAT record 300264529","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Buddhist doctrinal concepts as: Concepts related to the doctrine of Buddhism.","support":[{"end":476,"quote":"Concepts related to the doctrine of Buddhism.","source_id":"getty-aat.300264529","source_sha256":"e624ca41d672af1d04f6bca111a0e9a51861db8c728907e8ac6fcb49db190025","start":431}],"target_id":"concept.aat.300264529","target_kind":"node","target_sha256":"59ec2c3feecf698cde1f328b9b6c0797e3aff669cb059a09597160681461105c"}],"concept.aat.300264530":[{"id":"assertion.concept.aat.300264530","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Jain doctrinal concepts as defined in the captured Getty AAT record 300264530","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Jain doctrinal concepts as: Concepts related to the doctrine of Jainism.","support":[{"end":471,"quote":"Concepts related to the doctrine of Jainism.","source_id":"getty-aat.300264530","source_sha256":"529921c024964451ccf61b6d4569bc94f64509f9122a5bd41c57d66d8c944110","start":427}],"target_id":"concept.aat.300264530","target_kind":"node","target_sha256":"b1affde1802285a648b6a45ac1e7f9ae430eae28dd992600867e58232d11e2d9"}],"concept.aat.300264773":[{"id":"assertion.concept.aat.300264773","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic sculpture styles as defined in the captured Getty AAT record 300264773","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic sculpture styles as: Sculpture styles belonging to Oceanic cultures.","support":[{"end":482,"quote":"Sculpture styles belonging to Oceanic cultures.","source_id":"getty-aat.300264773","source_sha256":"3b57b6f38560e60f3b89c7985722628cfa2effab418dc73b7156e4ced72ad5c4","start":435}],"target_id":"concept.aat.300264773","target_kind":"node","target_sha256":"b7446309314d9a4d4308534782463a6183fcba933e1410a2957b36767156fd56"}],"concept.aat.300264775":[{"id":"assertion.concept.aat.300264775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic ceramic styles as defined in the captured Getty AAT record 300264775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic ceramic styles as: Ceramic styles belonging to Oceanic cultures.","support":[{"end":478,"quote":"Ceramic styles belonging to Oceanic cultures.","source_id":"getty-aat.300264775","source_sha256":"1c98bda7503aa9840ba9df049f3ae6862f446723dfa5bf0da7f0f98d9ed835c8","start":433}],"target_id":"concept.aat.300264775","target_kind":"node","target_sha256":"34fe8b187b3d2927c633b2499dbba9df1ebd0fbacbc90970cca4da7be3722819"}],"concept.aat.300264906":[{"id":"assertion.concept.aat.300264906","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Malian as defined in the captured Getty AAT record 300264906","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Malian as: Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","support":[{"end":586,"quote":"Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","source_id":"getty-aat.300264906","source_sha256":"524843ee626c7a4df242de8d10ce03333008045fc0ab345b677a04b79881c80f","start":445}],"target_id":"concept.aat.300264906","target_kind":"node","target_sha256":"099f65e67b57efaa3b6ffa5cddca6883230134ebccc4c834407c20694b7d71af"}],"concept.aat.300265479":[{"id":"assertion.concept.aat.300265479","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rasquachismo as defined in the captured Getty AAT record 300265479","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rasquachismo as: Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","support":[{"end":640,"quote":"Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","source_id":"getty-aat.300265479","source_sha256":"dda669ac376bfc2ee5db9d808b385c9fe087f22b336cbcd28755aa7a56b4c242","start":437}],"target_id":"concept.aat.300265479","target_kind":"node","target_sha256":"0fd3e8eea228d908537fe1c2589e78ebf9a338a2833bd4cd1ad75c0fb065b2ce"}],"concept.aat.300265781":[{"id":"assertion.concept.aat.300265781","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"presence as defined in the captured Getty AAT record 300265781","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines presence as: Concept regarding the condition of being present in front of, or in the same place with a person or thing.","support":[{"end":521,"quote":"Concept regarding the condition of being present in front of, or in the same place with a person or thing.","source_id":"getty-aat.300265781","source_sha256":"a6c4c0b1a09d9f769c6b2a5f992af7fa33b7f12a959e8d8315d7dbca6e344d34","start":415}],"target_id":"concept.aat.300265781","target_kind":"node","target_sha256":"44534d6da55e5b141009c3e8874b290bf941c5827093ed4a54f931c090684ab6"}],"concept.aat.300265797":[{"id":"assertion.concept.aat.300265797","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"divine light as defined in the captured Getty AAT record 300265797","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines divine light as: Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","support":[{"end":664,"quote":"Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","source_id":"getty-aat.300265797","source_sha256":"bad12821be1eaa8e5e7996e1f4cdb82dbf8d1b527b48aa9a770d28bb04232902","start":416}],"target_id":"concept.aat.300265797","target_kind":"node","target_sha256":"a2a5fe24cc1d87eaba0e47e1b92466d2f830eea8ef943e6b043cea7ff9220063"}],"concept.aat.300266052":[{"id":"assertion.concept.aat.300266052","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musique concrète as defined in the captured Getty AAT record 300266052","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musique concrète as: Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","support":[{"end":1288,"quote":"Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","source_id":"getty-aat.300266052","source_sha256":"7f5dcade8d0854b76dc74c5adbebd4b10bac448247f156d006022da3dbbedc18","start":429}],"target_id":"concept.aat.300266052","target_kind":"node","target_sha256":"842af417b0aa8129242300adb77c1c5d7058e8092b6e1400cc3f8ac53a00e7fa"}],"concept.aat.300266054":[{"id":"assertion.concept.aat.300266054","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"serial music as defined in the captured Getty AAT record 300266054","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines serial music as: A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","support":[{"end":575,"quote":"A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","source_id":"getty-aat.300266054","source_sha256":"3c9cfc1aaf7d42b18c893952d4db00dc11d91f2dc400b229d594a36d6ab16e26","start":437}],"target_id":"concept.aat.300266054","target_kind":"node","target_sha256":"98a040ba8d2114f03023e2dd4180a5d0fc45d58624938fb1e9e96b3fb695e74b"}],"concept.aat.300266055":[{"id":"assertion.concept.aat.300266055","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"twelve-tone music as defined in the captured Getty AAT record 300266055","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines twelve-tone music as: A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","support":[{"end":683,"quote":"A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","source_id":"getty-aat.300266055","source_sha256":"b299f359d7ede0f1276629bd20db80e169d51f8276a4430ac7bcefffa9fe3f8d","start":426}],"target_id":"concept.aat.300266055","target_kind":"node","target_sha256":"0d6d82343a74b2db142df25f2e3848cdc0ec6daaaa6f15e35e23355ef247df5f"}],"concept.aat.300266058":[{"id":"assertion.concept.aat.300266058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Monothelitism as defined in the captured Getty AAT record 300266058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Monothelitism as: Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","support":[{"end":843,"quote":"Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","source_id":"getty-aat.300266058","source_sha256":"8afe90f9bbec732978a10f4fbfcf969188e979d60b56b01c24ccf59aa3a46502","start":419}],"target_id":"concept.aat.300266058","target_kind":"node","target_sha256":"29b9e835e4d5c733c9559606653df275615c13e19078ce649e2a0195d242fb82"}],"concept.aat.300266367":[{"id":"assertion.concept.aat.300266367","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"jazz as defined in the captured Getty AAT record 300266367","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines jazz as: Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","support":[{"end":910,"quote":"Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","source_id":"getty-aat.300266367","source_sha256":"bf623b9cb6620e456c85da4ed30eb525b1f68e7168b806c870c410ddf59ce29c","start":429}],"target_id":"concept.aat.300266367","target_kind":"node","target_sha256":"f9f7e6a816a63de537e9767d8b52a9b5bd5c6e6bbaf177c7e33d0adde3f58e52"}],"concept.aat.300266399":[{"id":"assertion.concept.aat.300266399","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neo-Symbolist as defined in the captured Getty AAT record 300266399","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neo-Symbolist as: Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","support":[{"end":660,"quote":"Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","source_id":"getty-aat.300266399","source_sha256":"2bc50c7f097d9515e181fd4ab0ed0f2ee4659d98c97811445dcc826733814adb","start":423}],"target_id":"concept.aat.300266399","target_kind":"node","target_sha256":"93a647f75c4053e4186fe51529d12d6420ff7f5c5db16b6ffae349307b97d6cf"}],"concept.aat.300266481":[{"id":"assertion.concept.aat.300266481","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Eastern as defined in the captured Getty AAT record 300266481","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Eastern as: Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","support":[{"end":619,"quote":"Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","source_id":"getty-aat.300266481","source_sha256":"8f09279f3a7169ec48a3b6c20707a05e78621046fc1298390fa1a896d4b1c31d","start":416}],"target_id":"concept.aat.300266481","target_kind":"node","target_sha256":"52646567b34e37ab6e3cd00369a5da8135006af5bc4d159f43d3920b6fc975da"}],"concept.aat.300266490":[{"id":"assertion.concept.aat.300266490","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hip-hop as defined in the captured Getty AAT record 300266490","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hip-hop as: Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","support":[{"end":842,"quote":"Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","source_id":"getty-aat.300266490","source_sha256":"ba5df72f97bf8367fc745341207af1999b401e1c9344cf75f4ca4e34339d9c9f","start":457}],"target_id":"concept.aat.300266490","target_kind":"node","target_sha256":"cc6ff499406e862267e5ca759af263c68da3f2e666b592b9040210dbf608f7ee"}],"concept.aat.300266573":[{"id":"assertion.concept.aat.300266573","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"electronic music as defined in the captured Getty AAT record 300266573","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines electronic music as: Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","support":[{"end":952,"quote":"Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","source_id":"getty-aat.300266573","source_sha256":"80de8db46a1329e02b4ed7784321bd516d5c6b414995e0b7dadcc07df0f67871","start":441}],"target_id":"concept.aat.300266573","target_kind":"node","target_sha256":"0f747f8b04e6fbec1fccfacc6a1f8aece238f942ffc25c58c1de81f41df9637d"}],"concept.aat.300266744":[{"id":"assertion.concept.aat.300266744","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"space age as defined in the captured Getty AAT record 300266744","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines space age as: Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","support":[{"end":939,"quote":"Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","source_id":"getty-aat.300266744","source_sha256":"8fefe373bd83ef539297d9c60352e4ec1c3fe6b2bcd9c2ddcdf4beba40b767a9","start":459}],"target_id":"concept.aat.300266744","target_kind":"node","target_sha256":"e9dba79b76b1b2932f71c30952ad09527197cf50def6644e55eb9984cf1aef3c"}],"concept.aat.300266783":[{"id":"assertion.concept.aat.300266783","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granular synthesis as defined in the captured Getty AAT record 300266783","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines granular synthesis as: A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","support":[{"end":609,"quote":"A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","source_id":"getty-aat.300266783","source_sha256":"7c256e30b356b12d4eb7cb5a428e71d935b7bd0d5448f71c832b9fd8c81882aa","start":431}],"target_id":"concept.aat.300266783","target_kind":"node","target_sha256":"13a48d8e8a059199e8c1759fa73b98e5ccf5ccf81cea294e8f14851b6551a13e"}],"concept.aat.300266840":[{"id":"assertion.concept.aat.300266840","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pakistani as defined in the captured Getty AAT record 300266840","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pakistani as: Refers to the style and culture of modern Pakistan.","support":[{"end":443,"quote":"Refers to the style and culture of modern Pakistan.","source_id":"getty-aat.300266840","source_sha256":"e4933bf2a88cd163c8edd37d825264cbe8814cb4a6497ca5e217b9310272674b","start":392}],"target_id":"concept.aat.300266840","target_kind":"node","target_sha256":"42c25e368b48de3ee8bcbcc8825c0c060594d47451bcd61a57089b47b002e83c"}],"concept.aat.300310095":[{"id":"assertion.concept.aat.300310095","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"satori as defined in the captured Getty AAT record 300310095","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines satori as: In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","support":[{"end":573,"quote":"In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","source_id":"getty-aat.300310095","source_sha256":"ffe1bba9651aff8fabf7ef285cf6bc710e9260992e32ae8c0e7c535ceb46cb2b","start":419}],"target_id":"concept.aat.300310095","target_kind":"node","target_sha256":"3ebb1d2677fe74533025e6e1b8cab253300a3b39e0d256724238467a33429543"}],"concept.aat.300310539":[{"id":"assertion.concept.aat.300310539","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"shabby chic as defined in the captured Getty AAT record 300310539","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines shabby chic as: A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","support":[{"end":821,"quote":"A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","source_id":"getty-aat.300310539","source_sha256":"3733459ac5139ca1cab8ebe67f86d46f9c6202736f6897482d738b11c8f2c42b","start":411}],"target_id":"concept.aat.300310539","target_kind":"node","target_sha256":"28e0197e7e3ce3463068da9dfcfd7298bbcb7c74acf33737ad9eed5b2441f16f"}],"concept.aat.300310544":[{"id":"assertion.concept.aat.300310544","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"period style as defined in the captured Getty AAT record 300310544","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines period style as: Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","support":[{"end":726,"quote":"Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","source_id":"getty-aat.300310544","source_sha256":"a59820604aa2adacce011a149170ae0d6d5d3fc6a10f7be99c8096570ff19792","start":412}],"target_id":"concept.aat.300310544","target_kind":"node","target_sha256":"0420d0676012e663fa562f4af36b3210671edd49264afeda7473652ab95fe4ae"}],"concept.aat.300310716":[{"id":"assertion.concept.aat.300310716","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mappō as defined in the captured Getty AAT record 300310716","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines mappō as: The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","support":[{"end":983,"quote":"The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","source_id":"getty-aat.300310716","source_sha256":"93690df5a5b8bbb6672483292cc172506923f022ceed35ed0fb514e2eadf9d42","start":418}],"target_id":"concept.aat.300310716","target_kind":"node","target_sha256":"0522b8794034c686e2fe1a01e0033c97081dbc46ad7b6b3215653d1aca654556"}],"concept.aat.300310717":[{"id":"assertion.concept.aat.300310717","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"wabi as defined in the captured Getty AAT record 300310717","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines wabi as: An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","support":[{"end":1031,"quote":"An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","source_id":"getty-aat.300310717","source_sha256":"614e6b73543e1c0af5d167cd1ae5c39d091b56483ac1133df871e5304ec92566","start":408}],"target_id":"concept.aat.300310717","target_kind":"node","target_sha256":"0710e9d9d0bbaf0f7ebdafc407d6f67cc294fdb2402f8e48c028fc8451387e16"}],"concept.aat.300310718":[{"id":"assertion.concept.aat.300310718","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sabi as defined in the captured Getty AAT record 300310718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sabi as: Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","support":[{"end":695,"quote":"Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","source_id":"getty-aat.300310718","source_sha256":"a8fb7b2ae44dbc9e1f2eddaf34cbaa98adef2b16598526e43214881bfc3be435","start":408}],"target_id":"concept.aat.300310718","target_kind":"node","target_sha256":"085deb3ec5f43f48f3a87fe10d4f8ddcd39cc491fec9eda83987b4020f69b35b"}],"concept.aat.300310748":[{"id":"assertion.concept.aat.300310748","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monolatry as defined in the captured Getty AAT record 300310748","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monolatry as: The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","support":[{"end":619,"quote":"The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","source_id":"getty-aat.300310748","source_sha256":"1e480a189e47f5b4f1e74d4bfb04b872304a3a7fabb27d481452300aeebd54b9","start":415}],"target_id":"concept.aat.300310748","target_kind":"node","target_sha256":"487f5e5a0f7aae2ed207ce214b523f4a006cd8c1d31f9e31a7fd74148b4c50dc"}],"concept.aat.300311925":[{"id":"assertion.concept.aat.300311925","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plastic arts as defined in the captured Getty AAT record 300311925","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines plastic arts as: In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","support":[{"end":721,"quote":"In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","source_id":"getty-aat.300311925","source_sha256":"14bccafb3c9b172da80f2cc024f879f6cfd53a409abcba83235ed02d95dbfb2d","start":419}],"target_id":"concept.aat.300311925","target_kind":"node","target_sha256":"010cca991d4aa4d50287408e83fe49a6a1de7bcdcd792b74f8271d04c936ec47"}],"concept.aat.300312134":[{"id":"assertion.concept.aat.300312134","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Abyssinian as defined in the captured Getty AAT record 300312134","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Abyssinian as: Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","support":[{"end":739,"quote":"Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","source_id":"getty-aat.300312134","source_sha256":"d61f2a6df4b2bbd4e110a7a81632f668a0f8520c2152d9452201967839e55910","start":449}],"target_id":"concept.aat.300312134","target_kind":"node","target_sha256":"46d5286d5939841547f1cd6d3456e39bafd1a8761bfc5703312c859b4c9a6a91"}],"concept.aat.300312275":[{"id":"assertion.concept.aat.300312275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"old-fashioned as defined in the captured Getty AAT record 300312275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines old-fashioned as: A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","support":[{"end":1004,"quote":"A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","source_id":"getty-aat.300312275","source_sha256":"e3239e56deaf8d8601cae77f13f12129b62d64d0f97225758d26518cf5658ee1","start":413}],"target_id":"concept.aat.300312275","target_kind":"node","target_sha256":"f2827a53161f1b6f3be51a685170166c2e5d764dc429e85efebcd95d038eda05"}],"concept.aat.300312347":[{"id":"assertion.concept.aat.300312347","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophy of art as defined in the captured Getty AAT record 300312347","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophy of art as: The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","support":[{"end":575,"quote":"The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","source_id":"getty-aat.300312347","source_sha256":"fc0a7bd4af14f8302825dcc2c7841be0f016d50438e5eb4d205447c4180a80bb","start":397}],"target_id":"concept.aat.300312347","target_kind":"node","target_sha256":"8cfd3452ba16d8126eae32cfabe9fe6e5f0eb4bf0e0a19ecec6395ca083a4219"}],"concept.aat.300343751":[{"id":"assertion.concept.aat.300343751","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"automotive design as defined in the captured Getty AAT record 300343751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines automotive design as: Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","support":[{"end":628,"quote":"Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","source_id":"getty-aat.300343751","source_sha256":"bde39df25c799ffeb22cb87b4528a8837f1ba45a2aa069c976db53984315cf2b","start":420}],"target_id":"concept.aat.300343751","target_kind":"node","target_sha256":"fe5396315b58ee01928c1851f13ee0af7cec5c78a22bd99e0c4a96d3c15a907a"}],"concept.aat.300375152":[{"id":"assertion.concept.aat.300375152","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Maure as defined in the captured Getty AAT record 300375152","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Maure as: Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","support":[{"end":741,"quote":"Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","source_id":"getty-aat.300375152","source_sha256":"4a8465e3f73906407e0e4eef261cb945d88ec0fb724c0c76009a302557383dac","start":444}],"target_id":"concept.aat.300375152","target_kind":"node","target_sha256":"0c307b9a93b5a232555340297a616e730dbdae2fb9c64feb1af674bef2965072"}],"concept.aat.300375660":[{"id":"assertion.concept.aat.300375660","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Web design as defined in the captured Getty AAT record 300375660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Web design as: Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","support":[{"end":525,"quote":"Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","source_id":"getty-aat.300375660","source_sha256":"751968e2f5d68c5161dbde93a7b06eaea37dc1dc579d061bdac88b9d1fbe9dd8","start":413}],"target_id":"concept.aat.300375660","target_kind":"node","target_sha256":"79b3f35e2e36892571157c66adaeaf1b7051b7ec3d186e1c40922728a39b29a3"}],"concept.aat.300379068":[{"id":"assertion.concept.aat.300379068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vengeance as defined in the captured Getty AAT record 300379068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vengeance as: The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","support":[{"end":501,"quote":"The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","source_id":"getty-aat.300379068","source_sha256":"817916bba374cb1f679e361b596d0c746d71bb3debcbc4c6ca788d82fdc80790","start":393}],"target_id":"concept.aat.300379068","target_kind":"node","target_sha256":"1906acf44f6bec5accdc1ad67d75c6293f4b0e536a2e5ecce02ea1dc478eb456"}],"concept.aat.300379085":[{"id":"assertion.concept.aat.300379085","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"redemption as defined in the captured Getty AAT record 300379085","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines redemption as: Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","support":[{"end":613,"quote":"Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","source_id":"getty-aat.300379085","source_sha256":"a2c86e4f47c9a94d5b63459c4ec3f8a35f896b6efe112d5d2ff54e383182bcb8","start":414}],"target_id":"concept.aat.300379085","target_kind":"node","target_sha256":"1f51b1505a3d436ea3b01f04323ebfbd5a805e80d28d16b1b9d3271055e890d4"}],"concept.aat.300379123":[{"id":"assertion.concept.aat.300379123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"betrayal as defined in the captured Getty AAT record 300379123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines betrayal as: Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","support":[{"end":606,"quote":"Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","source_id":"getty-aat.300379123","source_sha256":"b60c4d4f2f36126d909c95723df93021324fcd80f3899b26b96d4aa0a1e9988a","start":392}],"target_id":"concept.aat.300379123","target_kind":"node","target_sha256":"3d176267619ff1102fe0c195ce70998c66739b14e0030f8ee24ef4e365c80f95"}],"concept.aat.300379137":[{"id":"assertion.concept.aat.300379137","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"heresy as defined in the captured Getty AAT record 300379137","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines heresy as: Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","support":[{"end":575,"quote":"Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","source_id":"getty-aat.300379137","source_sha256":"eb57e472596a7dbb7005f911077c7f9afde9c6b5c16da027c097ed50d55787de","start":422}],"target_id":"concept.aat.300379137","target_kind":"node","target_sha256":"8c7dd816d62e454fca80f0661b6544a0d27d40aaa045d6dbfcd324cd5c52de4f"}],"concept.aat.300379723":[{"id":"assertion.concept.aat.300379723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hope as defined in the captured Getty AAT record 300379723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hope as: The expectation of something desired.","support":[{"end":425,"quote":"The expectation of something desired.","source_id":"getty-aat.300379723","source_sha256":"5f8e82f965bc61bf48d2eb037aab7097342b8b44441bafd568d8a47321743b6b","start":388}],"target_id":"concept.aat.300379723","target_kind":"node","target_sha256":"aa63ddadfac0d0e6bb95e0a47301406b9c908e850c517e1c180c2da3fe92e7d6"}],"concept.aat.300379822":[{"id":"assertion.concept.aat.300379822","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"purgatory as defined in the captured Getty AAT record 300379822","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines purgatory as: State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","support":[{"end":738,"quote":"State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as  a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","source_id":"getty-aat.300379822","source_sha256":"e1d7a67bfcb6982531c99b69ef4ffaf13a4e93a74a894e43bc86678dd376bbcc","start":413}],"target_id":"concept.aat.300379822","target_kind":"node","target_sha256":"696b16beec7446744270ae325daae438a498b2ee56df05e446e94f421a70142d"}],"concept.aat.300379854":[{"id":"assertion.concept.aat.300379854","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient European as defined in the captured Getty AAT record 300379854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient European as: Styles, periods, and cultures of ancient Europe.","support":[{"end":476,"quote":"Styles, periods, and cultures of ancient Europe.","source_id":"getty-aat.300379854","source_sha256":"4d8093235ee19edbadb077fabffd622e51dbf0e5176beca14696a37060b8550a","start":428}],"target_id":"concept.aat.300379854","target_kind":"node","target_sha256":"d7c00409000f76c1b20f60d9ba9516620b0fef262c6247e20081b69d238920e3"}],"concept.aat.300380145":[{"id":"assertion.concept.aat.300380145","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cultism as defined in the captured Getty AAT record 300380145","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cultism as: Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","support":[{"end":594,"quote":"Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","source_id":"getty-aat.300380145","source_sha256":"38d24790c03bba5950998aa5788fab9225afae7512f31e084bea035e7adb93b9","start":423}],"target_id":"concept.aat.300380145","target_kind":"node","target_sha256":"794e9a7a8596647e80c43581f2ef8b02f02ac64906b2dac4a6e5d4679218e3ef"}],"concept.aat.300380150":[{"id":"assertion.concept.aat.300380150","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"wisdom as defined in the captured Getty AAT record 300380150","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines wisdom as: Accumulated learning and soundness of judgment in the choice of means and ends.","support":[{"end":470,"quote":"Accumulated  learning and soundness of judgment in the choice of means and ends.","source_id":"getty-aat.300380150","source_sha256":"e1d368310a3a29a153927627de17e4390b35c274ff25e55aaa00b747b13e37fc","start":390}],"target_id":"concept.aat.300380150","target_kind":"node","target_sha256":"88cb89620b19422e38f9a724372a0484c1ca8a83ba8807fedbacab0fc7e1120e"}],"concept.aat.300385955":[{"id":"assertion.concept.aat.300385955","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Antarctic as defined in the captured Getty AAT record 300385955","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Antarctic as: Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","support":[{"end":675,"quote":"Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","source_id":"getty-aat.300385955","source_sha256":"f8caae5716bab77a306898b2d6ce989863906f0b892f598dfdc708427d11154c","start":411}],"target_id":"concept.aat.300385955","target_kind":"node","target_sha256":"64b9550969ec232bcd4bd4d4d91a9fadebc047799239c5ddf1962b645b06b936"}],"concept.aat.300385968":[{"id":"assertion.concept.aat.300385968","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Bangladeshi as defined in the captured Getty AAT record 300385968","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Bangladeshi as: The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","support":[{"end":503,"quote":"The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","source_id":"getty-aat.300385968","source_sha256":"3c6d6c111b26a60daeaee5e42e463aa310d63dda65d7aa7c4ccf29df081b83c9","start":394}],"target_id":"concept.aat.300385968","target_kind":"node","target_sha256":"a1d40265ce14d9c0495400a74db25c5fe31d0e7cd736bdcb3b0d49d03b6f8d8c"}],"concept.aat.300386039":[{"id":"assertion.concept.aat.300386039","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bhūmi as defined in the captured Getty AAT record 300386039","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bhūmi as: The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","support":[{"end":509,"quote":"The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","source_id":"getty-aat.300386039","source_sha256":"f8b727324dbf15e311e89337abee6774b71e7251717ff5de1c88ee38d4902ba5","start":418}],"target_id":"concept.aat.300386039","target_kind":"node","target_sha256":"3c2b309af551dc48153e85450572d0b75c2fb6e3b831bcbe4f4434bdab6bfa64"}],"concept.aat.300386130":[{"id":"assertion.concept.aat.300386130","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hellenic as defined in the captured Getty AAT record 300386130","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hellenic as: The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","support":[{"end":582,"quote":"The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","source_id":"getty-aat.300386130","source_sha256":"1868d0ab8f59c425e7cae885e5933af1d793691bf4505cd8aecd861c707e4f07","start":420}],"target_id":"concept.aat.300386130","target_kind":"node","target_sha256":"d473efce51e10f6536bb815e460fcf1df366d46b1f60f2a1bd6bfede2235703e"}],"concept.aat.300386138":[{"id":"assertion.concept.aat.300386138","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hispanic as defined in the captured Getty AAT record 300386138","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hispanic as: Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","support":[{"end":621,"quote":"Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","source_id":"getty-aat.300386138","source_sha256":"e3f6333991fc609c7cb96f3b97791ade652993bb739599d9a6d776de73c2801c","start":424}],"target_id":"concept.aat.300386138","target_kind":"node","target_sha256":"9219f56aa301f1e59634ebad0af1be71e06ae9668f05d2b0035d1d6effae8d5a"}],"concept.aat.300386148":[{"id":"assertion.concept.aat.300386148","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indochinese as defined in the captured Getty AAT record 300386148","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indochinese as: Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","support":[{"end":560,"quote":"Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","source_id":"getty-aat.300386148","source_sha256":"7caf85fe10c29b502ef1d790fcca03ee20593b939475139a324f2d3944f68dfb","start":398}],"target_id":"concept.aat.300386148","target_kind":"node","target_sha256":"1700c3b5d4711d7441adbb049c9c9a26733417d5d99e699ede6c070ee08ab753"}],"concept.aat.300386510":[{"id":"assertion.concept.aat.300386510","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Reunionese as defined in the captured Getty AAT record 300386510","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Reunionese as: Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","support":[{"end":550,"quote":"Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","source_id":"getty-aat.300386510","source_sha256":"d1b737a2e69f891601ecb678d86c231b8ad5dcb4e9dd6c16c889f2acf7e7d505","start":449}],"target_id":"concept.aat.300386510","target_kind":"node","target_sha256":"7168d6514a9d2de09a7e3520b2cb1bf354e75e5749ac2482ccb2f740d0530c32"}],"concept.aat.300386512":[{"id":"assertion.concept.aat.300386512","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rhodesian as defined in the captured Getty AAT record 300386512","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rhodesian as: Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","support":[{"end":583,"quote":"Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","source_id":"getty-aat.300386512","source_sha256":"5b2f48f28ee1926deb4b7bc97c896ddaa1fceee72a98c1106a86126b9735ea80","start":448}],"target_id":"concept.aat.300386512","target_kind":"node","target_sha256":"c24e43369ab88d2864d27c474630e74b9248a718d68511e2447b35ce0da94df2"}],"concept.aat.300386517":[{"id":"assertion.concept.aat.300386517","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rwandan as defined in the captured Getty AAT record 300386517","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rwandan as: Nationality, style, and culture of Rwanda, in central-eastern Africa.","support":[{"end":515,"quote":"Nationality, style, and culture of Rwanda, in central-eastern Africa.","source_id":"getty-aat.300386517","source_sha256":"a74e99cbaebfeadcd35380c39df6ad7bfe1eb35265c9772ea72de67b6e08e441","start":446}],"target_id":"concept.aat.300386517","target_kind":"node","target_sha256":"5c1f573139539cb525aecb67e9e1a61b2d7d4bcd2706acc7ec64f8ba0d444b95"}],"concept.aat.300386542":[{"id":"assertion.concept.aat.300386542","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Taiwanese as defined in the captured Getty AAT record 300386542","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Taiwanese as: Nationality, styles, or culture of Taiwan, East Asia.","support":[{"end":444,"quote":"Nationality, styles, or culture of Taiwan, East Asia.","source_id":"getty-aat.300386542","source_sha256":"5ce1e81399f30933e74ba91c16fb7b977088a5299d69db7359a993193d23963e","start":391}],"target_id":"concept.aat.300386542","target_kind":"node","target_sha256":"1243b51c128efc10ee6010f5c8db9b2585cff717ad6087f874d2e0a5ef1f7902"}],"concept.aat.300386953":[{"id":"assertion.concept.aat.300386953","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tungus as defined in the captured Getty AAT record 300386953","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tungus as: Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","support":[{"end":594,"quote":"Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","source_id":"getty-aat.300386953","source_sha256":"19d27660bcea6cd22fc4009442ad2e28f1b9c869300847357c180511b759f3e8","start":405}],"target_id":"concept.aat.300386953","target_kind":"node","target_sha256":"1765ac0511608633929e949955541f38229f4cc978dc8d5177b0e61763956523"}],"concept.aat.300387114":[{"id":"assertion.concept.aat.300387114","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient American as defined in the captured Getty AAT record 300387114","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient American as: General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","support":[{"end":614,"quote":"General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","source_id":"getty-aat.300387114","source_sha256":"ccb2c8af97f35934f301c053da86903273e91801923befd9421b62ecd36a2445","start":432}],"target_id":"concept.aat.300387114","target_kind":"node","target_sha256":"afac1b539b92aee3c49bc058ae5fa5de3b676be884ed2ef1e8e748f4f9965633"}],"concept.aat.300387734":[{"id":"assertion.concept.aat.300387734","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Turkestani as defined in the captured Getty AAT record 300387734","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Turkestani as: Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","support":[{"end":500,"quote":"Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","source_id":"getty-aat.300387734","source_sha256":"220506778ec25bbea46b793f453c64076a35fa0b050b9ebde82b4e06abf7c1e5","start":395}],"target_id":"concept.aat.300387734","target_kind":"node","target_sha256":"bad2cfef4b60c84e094acfdb462e20c285b6347c2c36d6385552e57255d52084"}],"concept.aat.300387753":[{"id":"assertion.concept.aat.300387753","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Netherlandish as defined in the captured Getty AAT record 300387753","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Netherlandish as: The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","support":[{"end":543,"quote":"The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","source_id":"getty-aat.300387753","source_sha256":"fe194e444af0e271be1a86b686b9adff98a8abc1a1f0b7f3a1c166d33ffe9e4a","start":431}],"target_id":"concept.aat.300387753","target_kind":"node","target_sha256":"b6026231b47e1418516987781c5eafa24ae064d966cea27781a22916c680a970"}],"concept.aat.300389795":[{"id":"assertion.concept.aat.300389795","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"photography (discipline) as defined in the captured Getty AAT record 300389795","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines photography (discipline) as: The dedicated practice of making photographs as an applied art.","support":[{"end":501,"quote":"The dedicated practice of making photographs as an applied art.","source_id":"getty-aat.300389795","source_sha256":"1db74d87eb9dd43d1361972aee7cd63dfaa27aa833d8d52b742235369a845fdc","start":438}],"target_id":"concept.aat.300389795","target_kind":"node","target_sha256":"e3b8c10d31cb85338b7622f66e55b38cb8c7aafbcb1c1f6ae5f9d875e79cf75d"}],"concept.aat.300391196":[{"id":"assertion.concept.aat.300391196","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"arhats as defined in the captured Getty AAT record 300391196","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arhats as: Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","support":[{"end":662,"quote":"Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","source_id":"getty-aat.300391196","source_sha256":"b3a6406c2fe0212720da3cec180353a483f4998def5b98c39b4de42b3563c7a3","start":445}],"target_id":"concept.aat.300391196","target_kind":"node","target_sha256":"3a3bf7c0833bce22073cbd2bbb7dcdfadac24fed0b7dd1d173b07fa9ac79d83e"}],"concept.aat.300391250":[{"id":"assertion.concept.aat.300391250","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"geologic time scale as defined in the captured Getty AAT record 300391250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines geologic time scale as: An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","support":[{"end":570,"quote":"An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","source_id":"getty-aat.300391250","source_sha256":"1a1075f1d96b75e417aad840f7d72ff57ec1b0d63601c329ae5aa774d0643d09","start":426}],"target_id":"concept.aat.300391250","target_kind":"node","target_sha256":"228f342b64a6bcacb546f95341e0c14ed3103f88da71900694872e2e841ddf3c"}],"concept.aat.300391392":[{"id":"assertion.concept.aat.300391392","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pre-colonial as defined in the captured Getty AAT record 300391392","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pre-colonial as: General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","support":[{"end":606,"quote":"General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","source_id":"getty-aat.300391392","source_sha256":"566db63c72a2163cc0b163063edd110e65e326736b86e85fae51df5d3cff9ed4","start":412}],"target_id":"concept.aat.300391392","target_kind":"node","target_sha256":"43a9ec247427fabdeb7d501fdda03da31400c81a98a34aa84e464e410929bb35"}],"concept.aat.300391434":[{"id":"assertion.concept.aat.300391434","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Asian as defined in the captured Getty AAT record 300391434","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Asian as: Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","support":[{"end":592,"quote":"Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","source_id":"getty-aat.300391434","source_sha256":"452b2e8f301e904f85291fbf2aa309f37440810d364bfcca3592ca2649626bbe","start":422}],"target_id":"concept.aat.300391434","target_kind":"node","target_sha256":"455d331e457d8f91a657b86d7d9b8681e65c775e102720ae577df653a8473d24"}],"concept.aat.300391475":[{"id":"assertion.concept.aat.300391475","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Archean as defined in the captured Getty AAT record 300391475","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Archean as: On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","support":[{"end":669,"quote":"On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","source_id":"getty-aat.300391475","source_sha256":"e6c19085e6b212bccd3c6bef1706c27f3189d5b1d2ccc46fbf9fd5a1bafba88e","start":404}],"target_id":"concept.aat.300391475","target_kind":"node","target_sha256":"8659ae85db860cd0a4a65d97aa9745cdefbfc9476298295636b07fa8e6b57b64"}],"concept.aat.300391479":[{"id":"assertion.concept.aat.300391479","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dian jing as defined in the captured Getty AAT record 300391479","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dian jing as: Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","support":[{"end":800,"quote":"Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","source_id":"getty-aat.300391479","source_sha256":"a4b1780964c93628a11162b12bb9dee5214031be839febaba698679b1abe86cd","start":413}],"target_id":"concept.aat.300391479","target_kind":"node","target_sha256":"b940d8f45abf18475705bc773359c2f13e6935e09fdb8b9ad623fb1b40630e6f"}],"concept.aat.300391505":[{"id":"assertion.concept.aat.300391505","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neozoic as defined in the captured Getty AAT record 300391505","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neozoic as: An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","support":[{"end":500,"quote":"An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","source_id":"getty-aat.300391505","source_sha256":"c3378283008cc5b38f341c4ce7143b168c46d7715db2e41af200426ab2a8df32","start":404}],"target_id":"concept.aat.300391505","target_kind":"node","target_sha256":"9b79f1b2e60d7f330e09142bae45c62ff46b38419da7408453f3416d81b50d4d"}],"concept.aat.300393171":[{"id":"assertion.concept.aat.300393171","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"computer music as defined in the captured Getty AAT record 300393171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines computer music as: Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","support":[{"end":620,"quote":"Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","source_id":"getty-aat.300393171","source_sha256":"4b690c53cd7eb3e129970a89c5c39f3c783346da913b2ca188dd20f1838ac8a0","start":427}],"target_id":"concept.aat.300393171","target_kind":"node","target_sha256":"3864805317db79953155ff3e135944ece7920dcc2f645c25b3c31715b325f78e"}],"concept.aat.300395490":[{"id":"assertion.concept.aat.300395490","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Holy Roman Imperial as defined in the captured Getty AAT record 300395490","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Holy Roman Imperial as: The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","support":[{"end":610,"quote":"The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","source_id":"getty-aat.300395490","source_sha256":"cdeffd078c2b7cd190ebf9e0d074bf8e9277547b7f3c0a137ed403eff12f8ead","start":431}],"target_id":"concept.aat.300395490","target_kind":"node","target_sha256":"c01c4d1fd18ff585b830a83147d52b99cccab1d99db0eb2acd5a3ef9a7e59934"}],"concept.aat.300403938":[{"id":"assertion.concept.aat.300403938","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hutsul as defined in the captured Getty AAT record 300403938","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hutsul as: Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","support":[{"end":527,"quote":"Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","source_id":"getty-aat.300403938","source_sha256":"0eab2bafdd0a150934c9710ffa0a15c7809ed489f0a5b643699d6a58fb1d0858","start":418}],"target_id":"concept.aat.300403938","target_kind":"node","target_sha256":"d175caca91fbbed85e4b6cac5ce2444206cc72149f5a3f1058d882874b2ecdb8"}],"concept.aat.300403945":[{"id":"assertion.concept.aat.300403945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eolithic as defined in the captured Getty AAT record 300403945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eolithic as: The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","support":[{"end":545,"quote":"The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","source_id":"getty-aat.300403945","source_sha256":"ee7c07ddd598f5f458daa7ee0acf2a8925de80f7484bc9b9e4f8a98d8c4e9334","start":400}],"target_id":"concept.aat.300403945","target_kind":"node","target_sha256":"9c8b75ca1125d9efc0883ef1a768a8d0f14abb06c9af324b9bfa713d7a899d47"}],"concept.aat.300403979":[{"id":"assertion.concept.aat.300403979","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dramaturgy as defined in the captured Getty AAT record 300403979","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dramaturgy as: Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","support":[{"end":874,"quote":"Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","source_id":"getty-aat.300403979","source_sha256":"34ba2b8c03decc23f4c23f17beae99542bc3bd75bd9b1d87653e789678c83c28","start":410}],"target_id":"concept.aat.300403979","target_kind":"node","target_sha256":"8138ab377b7bdac145322d589b3c3f20381d2d419bfd5e9fde9a30f45bba5e1f"}],"concept.aat.300404618":[{"id":"assertion.concept.aat.300404618","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pure land as defined in the captured Getty AAT record 300404618","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pure land as: In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","support":[{"end":603,"quote":"In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","source_id":"getty-aat.300404618","source_sha256":"c7de65d3b42eba583debd1bf6624f7bf4099fe5687eb3070e2e62e9292e06f98","start":422}],"target_id":"concept.aat.300404618","target_kind":"node","target_sha256":"1befbbedf105af42e0ecbe930a4ce094c8ffeb0b64fb29d7d599eba90dbfeff5"}],"concept.aat.300404619":[{"id":"assertion.concept.aat.300404619","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"buddha field as defined in the captured Getty AAT record 300404619","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines buddha field as: In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","support":[{"end":584,"quote":"In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","source_id":"getty-aat.300404619","source_sha256":"44594aea6546b7a287bb5c27da5776791cbfa6e28a3919e659af9280948221a3","start":425}],"target_id":"concept.aat.300404619","target_kind":"node","target_sha256":"80c31346c9c5f8a26c3473ddd53336dab445a33fb629df67618cfc00384596db"}],"concept.aat.300404625":[{"id":"assertion.concept.aat.300404625","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"absurdism as defined in the captured Getty AAT record 300404625","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines absurdism as: A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","support":[{"end":590,"quote":"A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","source_id":"getty-aat.300404625","source_sha256":"e19f52dd8a6d06a7cf010d00f8cdd6f6feb51655994af97ee7b8d43efe5f8cbe","start":434}],"target_id":"concept.aat.300404625","target_kind":"node","target_sha256":"aef88e0658689ecc400cebccef10fae13b6e0887cc9b54118c991e28beef7dd5"}],"concept.aat.300404702":[{"id":"assertion.concept.aat.300404702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"karma as defined in the captured Getty AAT record 300404702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines karma as: The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","support":[{"end":789,"quote":"The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","source_id":"getty-aat.300404702","source_sha256":"5a373b991baa6b2d6666138f431bb157597ab3906345f43396977f3fb95f2d68","start":418}],"target_id":"concept.aat.300404702","target_kind":"node","target_sha256":"de8faefdf41cffdbf084161585d53ec2ba4a65d1f1521f130d278d76406e6326"}],"concept.aat.300404706":[{"id":"assertion.concept.aat.300404706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"parinirvāṇa as defined in the captured Getty AAT record 300404706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines parinirvāṇa as: In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","support":[{"end":647,"quote":"In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","source_id":"getty-aat.300404706","source_sha256":"6a8edb222eccdc2c22f6d8cb86974060001ec930afbe73a2b5691e4ffca2ff84","start":413}],"target_id":"concept.aat.300404706","target_kind":"node","target_sha256":"4b3c8e961039858891d134c0a16b3411730d6367ccf1d45566391176cf083dd7"}],"concept.aat.300404712":[{"id":"assertion.concept.aat.300404712","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"uṣṇīsạ as defined in the captured Getty AAT record 300404712","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines uṣṇīsạ as: Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","support":[{"end":562,"quote":"Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","source_id":"getty-aat.300404712","source_sha256":"4e49f37956dcaf3f64797b400aab020223cfe6b57193b010d190ce2942462863","start":445}],"target_id":"concept.aat.300404712","target_kind":"node","target_sha256":"7b6341f645c31c22799454a3949db164f7437d798f4316233b85b236a11e9d4e"}],"concept.aat.300404756":[{"id":"assertion.concept.aat.300404756","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"gates of hell as defined in the captured Getty AAT record 300404756","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines gates of hell as: Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","support":[{"end":670,"quote":"Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","source_id":"getty-aat.300404756","source_sha256":"72900a108df267d70fb99a9934c2d725b8595a5023b19086123467e193500356","start":417}],"target_id":"concept.aat.300404756","target_kind":"node","target_sha256":"1bf2a33e04e0faa1b0bd29318743a08ece13132afdca49efee7885e8c6f49917"}],"concept.aat.300404787":[{"id":"assertion.concept.aat.300404787","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indic as defined in the captured Getty AAT record 300404787","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indic as: Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","support":[{"end":816,"quote":"Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","source_id":"getty-aat.300404787","source_sha256":"9a1badd5f0eaf64f406f52563b8b6cf1d4e75085476e76c03a73c9cffc7c93c0","start":388}],"target_id":"concept.aat.300404787","target_kind":"node","target_sha256":"d0bf6e414bd750156bb5d53ad63f0d70b5623348190bd6755cff9fe39866e629"}],"concept.aat.300404836":[{"id":"assertion.concept.aat.300404836","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Archaeological Style as defined in the captured Getty AAT record 300404836","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Archaeological Style as: Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","support":[{"end":628,"quote":"Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","source_id":"getty-aat.300404836","source_sha256":"b3eb2b3c8080879671e30f3cad164f65156fa1545d91edb4532e953650705430","start":427}],"target_id":"concept.aat.300404836","target_kind":"node","target_sha256":"1629aee8b4ee815b6795a1dc4457ddbc1ca184339f7171831998e137550ab073"}],"concept.aat.300410257":[{"id":"assertion.concept.aat.300410257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kachin as defined in the captured Getty AAT record 300410257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kachin as: Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","support":[{"end":573,"quote":"Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","source_id":"getty-aat.300410257","source_sha256":"baad02e2f7f3e48a1d68758abc3a2e1c9fb40929592f3d4f9b55e0ada1c114b7","start":393}],"target_id":"concept.aat.300410257","target_kind":"node","target_sha256":"365c07341851f63376520ce8d095587f1df5ddb507c5d6403d9500355b9627fc"}],"concept.aat.300410285":[{"id":"assertion.concept.aat.300410285","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"evil as defined in the captured Getty AAT record 300410285","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines evil as: The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","support":[{"end":500,"quote":"The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","source_id":"getty-aat.300410285","source_sha256":"615f97eb3215f0578eb3550d5db86d7937750feb725d85b2041ab1ee4a4be3d2","start":388}],"target_id":"concept.aat.300410285","target_kind":"node","target_sha256":"3b7668c47599c6c8db6da48ec5a17481a71470b22f6f4ac06b79c8c8b73482de"}],"concept.aat.300410287":[{"id":"assertion.concept.aat.300410287","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fortitude as defined in the captured Getty AAT record 300410287","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fortitude as: Moral strength or courage, unyielding courage, endurance of pain or adversity.","support":[{"end":471,"quote":"Moral strength or courage, unyielding courage, endurance of pain or adversity.","source_id":"getty-aat.300410287","source_sha256":"71b74deb613acd2bdb8febe488a826d22cd4b9790fe0f5216f4e1de50099bfd2","start":393}],"target_id":"concept.aat.300410287","target_kind":"node","target_sha256":"57ee48254bc4c709d02247e593e59478ab46d749455c8308c1869ca8ea4ef5fd"}],"concept.aat.300410316":[{"id":"assertion.concept.aat.300410316","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fortune as defined in the captured Getty AAT record 300410316","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fortune as: Chance or luck, when regarded as a cause of events and changes in human affairs.","support":[{"end":471,"quote":"Chance or luck, when regarded as a cause of events and changes in human affairs.","source_id":"getty-aat.300410316","source_sha256":"043b473f50e1ba9b49b9829669e1b7489e57d3af0273fdbb6fefedea4e4cb67f","start":391}],"target_id":"concept.aat.300410316","target_kind":"node","target_sha256":"a46c6ee759ce2522010c68c05da5e4dcbb676732dcf0e404302951d57377be7d"}],"concept.aat.300412040":[{"id":"assertion.concept.aat.300412040","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cosmos as defined in the captured Getty AAT record 300412040","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cosmos as: An ordered and harmonious system that comprises the world or universe.","support":[{"end":460,"quote":"An ordered and harmonious system that comprises the world or universe.","source_id":"getty-aat.300412040","source_sha256":"75a4c4ac137ec76d65500c92485044bcb9460257ba2f76d93557ce0792b60e88","start":390}],"target_id":"concept.aat.300412040","target_kind":"node","target_sha256":"4e31a1f70428e6d7bd13120059b261e965b8278cfa0fee128e307ff1bd137da7"}],"concept.aat.300412041":[{"id":"assertion.concept.aat.300412041","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"world as defined in the captured Getty AAT record 300412041","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines world as: The state or realm of existence, particularly of the physical.","support":[{"end":451,"quote":"The state or realm of existence, particularly of the physical.","source_id":"getty-aat.300412041","source_sha256":"60bc900b2060c57640b972108e5dbfcc3797856879d58ada20e9d97128faf2f5","start":389}],"target_id":"concept.aat.300412041","target_kind":"node","target_sha256":"5249f36d0e638ea062d9e34c3457c8866702dbb2ea2842acc30f57ab1539c69d"}],"concept.aat.300412084":[{"id":"assertion.concept.aat.300412084","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"eternity as defined in the captured Getty AAT record 300412084","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines eternity as: Infinite time, which has neither beginning nor end.","support":[{"end":463,"quote":"Infinite time, which has neither beginning nor end.","source_id":"getty-aat.300412084","source_sha256":"ae0881fe1e29dc430c786438597daa77fad299255d4f0d0537ab63108f44a430","start":412}],"target_id":"concept.aat.300412084","target_kind":"node","target_sha256":"c460821715f9c3e1ec127dd64111c8c6d1267df81eae5cacb0632885e04000a6"}],"concept.aat.300412108":[{"id":"assertion.concept.aat.300412108","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rabbinical as defined in the captured Getty AAT record 300412108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rabbinical as: Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","support":[{"end":515,"quote":"Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","source_id":"getty-aat.300412108","source_sha256":"a211ff4cfb9a8070918f869156bdbb6e006842bcb18851f9aab5d701392553ea","start":426}],"target_id":"concept.aat.300412108","target_kind":"node","target_sha256":"cbb10a90b301760480982646b9e7f16727599cb838cae0193c060edf2fe7a51a"}],"concept.aat.300412116":[{"id":"assertion.concept.aat.300412116","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prudence as defined in the captured Getty AAT record 300412116","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prudence as: Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","support":[{"end":553,"quote":"Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","source_id":"getty-aat.300412116","source_sha256":"a9e864ab126c76f436037d066b26593025c15724669d2d6bd149fb83de24bbcc","start":392}],"target_id":"concept.aat.300412116","target_kind":"node","target_sha256":"f797f4c2769ed46d9993dacfa0e27c97f24962b7a66b6da6571a957c1a4a9e91"}],"concept.aat.300412128":[{"id":"assertion.concept.aat.300412128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"inventiveness as defined in the captured Getty AAT record 300412128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines inventiveness as: The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","support":[{"end":520,"quote":"The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","source_id":"getty-aat.300412128","source_sha256":"6bc52fbbec2822341b15e8b09ebd55f0d480f8a59a8a35ce2afbb07302e6b944","start":397}],"target_id":"concept.aat.300412128","target_kind":"node","target_sha256":"12361457f0c44b05662b67d2cf75385f43d70ff019919d45da18ce4f8522a959"}],"concept.aat.300412140":[{"id":"assertion.concept.aat.300412140","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"good luck as defined in the captured Getty AAT record 300412140","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines good luck as: A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","support":[{"end":594,"quote":"A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","source_id":"getty-aat.300412140","source_sha256":"b5f75b6427c55d85b596e9c9ece9a2bdbd5dea4372168298cba17dbf515eaa9d","start":402}],"target_id":"concept.aat.300412140","target_kind":"node","target_sha256":"496b4f0cd54fdf45b9486fbd21cf6eafe631177f505d14ff009232e804f9bfe9"}],"concept.aat.300412141":[{"id":"assertion.concept.aat.300412141","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bad luck as defined in the captured Getty AAT record 300412141","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bad luck as: A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","support":[{"end":532,"quote":"A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","source_id":"getty-aat.300412141","source_sha256":"9fc393ce26b22335b52bf2c17f3743e274bef80c946d1a75a934b64ba2d8730b","start":401}],"target_id":"concept.aat.300412141","target_kind":"node","target_sha256":"f475c3174f1563909691b81cdd1af5c71e568b8254cae76ed2376276b8f207ee"}],"concept.aat.300417271":[{"id":"assertion.concept.aat.300417271","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"divine judgment as defined in the captured Getty AAT record 300417271","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines divine judgment as: Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","support":[{"end":596,"quote":"Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","source_id":"getty-aat.300417271","source_sha256":"50bfcc22e12b6e7ae1f741ceb18b57411554613cdf1cc0a1d96699342da1278c","start":431}],"target_id":"concept.aat.300417271","target_kind":"node","target_sha256":"b0cd141b08677fa72f1d58e1e7860ea99b24b856cd94286ce4c1c81df6386190"}],"concept.aat.300417325":[{"id":"assertion.concept.aat.300417325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"survival as defined in the captured Getty AAT record 300417325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines survival as: The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","support":[{"end":686,"quote":"The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","source_id":"getty-aat.300417325","source_sha256":"8f49da7a5265e895d63c51dd67272d35096ba98db4c44a211655e7c781d67e52","start":392}],"target_id":"concept.aat.300417325","target_kind":"node","target_sha256":"17c54dbfbd792d292c658ebc805c356abe5611a7c953d0a7bfa4cbb2f60f17cc"}],"concept.aat.300417426":[{"id":"assertion.concept.aat.300417426","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"morality as defined in the captured Getty AAT record 300417426","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines morality as: Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","support":[{"end":594,"quote":"Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","source_id":"getty-aat.300417426","source_sha256":"dbc777f2f6ded998169b8ba9b1b089177c6fe928f4e12c140cdc25a43bfbafa3","start":392}],"target_id":"concept.aat.300417426","target_kind":"node","target_sha256":"c344f2d693f28eb725fb8a0de66e39405cf69f154a5cf6cbdddb490767240bf4"}],"concept.aat.300417578":[{"id":"assertion.concept.aat.300417578","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theater arts as defined in the captured Getty AAT record 300417578","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theater arts as: Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","support":[{"end":636,"quote":"Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","source_id":"getty-aat.300417578","source_sha256":"f1dc8599aa2cb75a65dea8bbf8ae60b7a7adcab32a390ec785712c321abd9971","start":423}],"target_id":"concept.aat.300417578","target_kind":"node","target_sha256":"e923c97cc9f72c01e89b4b5b33bcc478a6ab552f667372e9f72f396c9001ce2d"}],"concept.aat.300417580":[{"id":"assertion.concept.aat.300417580","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vocal arts as defined in the captured Getty AAT record 300417580","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vocal arts as: Discipline involving the study of singing and other vocal expressions, including performance.","support":[{"end":509,"quote":"Discipline involving the study of singing and other vocal expressions, including performance.","source_id":"getty-aat.300417580","source_sha256":"09425fa609609ba2eecd48c09fecc1fa749255275f798711a084c2525234b474","start":416}],"target_id":"concept.aat.300417580","target_kind":"node","target_sha256":"f5c3dae04dee37f17ac4a4c19305274b4faee89b316a482e649c94c5ea5370a0"}],"concept.aat.300417581":[{"id":"assertion.concept.aat.300417581","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"dance (discipline) as defined in the captured Getty AAT record 300417581","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dance (discipline) as: Discipline involving the study of dancing and movement, including performance.","support":[{"end":507,"quote":"Discipline involving the study of dancing and movement, including performance.","source_id":"getty-aat.300417581","source_sha256":"8ab27d8f5dd9592e3a95c6c39669cfb3631acfceb7cbc9dd57a4f4efef1b1498","start":429}],"target_id":"concept.aat.300417581","target_kind":"node","target_sha256":"110b0c39e148b83790551898056a4a0d22511a858e9e6fce654c9a17bd4a6d5a"}],"concept.aat.300417584":[{"id":"assertion.concept.aat.300417584","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"music (discipline) as defined in the captured Getty AAT record 300417584","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music (discipline) as: The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","support":[{"end":679,"quote":"The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","source_id":"getty-aat.300417584","source_sha256":"ff9beda6f7e0fee3f5c8989efc7b28bb843367fce4e97646c15c62f363954b9a","start":429}],"target_id":"concept.aat.300417584","target_kind":"node","target_sha256":"20b9d4db89931113f4a10f3b9d717dc25c19150ee4ae7158e08d41cfba830528"}],"concept.aat.300417616":[{"id":"assertion.concept.aat.300417616","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musical theater as defined in the captured Getty AAT record 300417616","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musical theater as: Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","support":[{"end":528,"quote":"Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","source_id":"getty-aat.300417616","source_sha256":"2c01b13fb2ab6ac12eab6df21087489d2fad3d51cba3f90419eda881949715a5","start":440}],"target_id":"concept.aat.300417616","target_kind":"node","target_sha256":"c4d238b66b68d94feec6f9ba74ca7902f3412a12a3b14cbd4315473e463bb6fd"}],"concept.aat.300417661":[{"id":"assertion.concept.aat.300417661","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"garden design as defined in the captured Getty AAT record 300417661","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines garden design as: Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","support":[{"end":954,"quote":"Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","source_id":"getty-aat.300417661","source_sha256":"74e6d973f74986fb5dbac1214dfb5d3573cf95177a00b1e5e64b482b8e58d728","start":416}],"target_id":"concept.aat.300417661","target_kind":"node","target_sha256":"7f6cd074cb7c3a6194770dbcb9a078658d902b4e4eb1c25abc25523ad460ee5e"}],"concept.aat.300417674":[{"id":"assertion.concept.aat.300417674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"African diaspora as defined in the captured Getty AAT record 300417674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African diaspora as: Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","support":[{"end":682,"quote":"Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","source_id":"getty-aat.300417674","source_sha256":"ae5807558900b73264315e6d50b22b99b430a63f7161cfd0f42fdc581e13a2c6","start":459}],"target_id":"concept.aat.300417674","target_kind":"node","target_sha256":"89c6d5238ac73991ed6eb49afa668ddde0b5f5355a73f9b939989946ca8ccf16"}],"concept.aat.300417961":[{"id":"assertion.concept.aat.300417961","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rhythm and blues as defined in the captured Getty AAT record 300417961","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rhythm and blues as: Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","support":[{"end":726,"quote":"Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","source_id":"getty-aat.300417961","source_sha256":"a69b5dc82648c771bb8d6fb0cc765c4fa18ac305c3e21a5a88c2c044303099b9","start":441}],"target_id":"concept.aat.300417961","target_kind":"node","target_sha256":"ad9b8c32063334833f4e2932b62525023664aa63a340c58033563cdde4761e06"}],"concept.aat.300435123":[{"id":"assertion.concept.aat.300435123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"jewelry design as defined in the captured Getty AAT record 300435123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines jewelry design as: Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","support":[{"end":527,"quote":"Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","source_id":"getty-aat.300435123","source_sha256":"ead2459a00550f4576e799021b6ddaa9f0aac71150ffab857caa5b7a813cb924","start":417}],"target_id":"concept.aat.300435123","target_kind":"node","target_sha256":"656794096063c1f204b259000d1397d64098cdc5ebff7b88e6cbf73c05d18470"}],"concept.aat.300435128":[{"id":"assertion.concept.aat.300435128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"set design as defined in the captured Getty AAT record 300435128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines set design as: The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","support":[{"end":578,"quote":"The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","source_id":"getty-aat.300435128","source_sha256":"552ff88a62b350b5d689a7af110b6e7b6a9a0d7c4f0378a9a5491fd233c66a69","start":413}],"target_id":"concept.aat.300435128","target_kind":"node","target_sha256":"4ed76e7cf03346da7b3286b3985e842ce8269ee115fd2e29db938f1da8b3b5de"}],"concept.aat.300435227":[{"id":"assertion.concept.aat.300435227","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"furniture design as defined in the captured Getty AAT record 300435227","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines furniture design as: Practice and discipline of designing furniture.","support":[{"end":466,"quote":"Practice and discipline of designing furniture.","source_id":"getty-aat.300435227","source_sha256":"276191996744979c79e57d8b058dd1c9282f67650d218ac9b72165bb7cc35ac4","start":419}],"target_id":"concept.aat.300435227","target_kind":"node","target_sha256":"77712d6b04d0e0a29504d9bafa082fefc71d108e001724898e745ff9f6e869c2"}],"concept.aat.300435243":[{"id":"assertion.concept.aat.300435243","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"textile design as defined in the captured Getty AAT record 300435243","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines textile design as: Practice and discipline of designing textiles.","support":[{"end":463,"quote":"Practice and discipline of designing textiles.","source_id":"getty-aat.300435243","source_sha256":"637adcefaab307bc2e6921405ddc159168c1c843a638dfcdf1d5a823edcc7d4d","start":417}],"target_id":"concept.aat.300435243","target_kind":"node","target_sha256":"5519c7cfaa9aea485135bc9249882fdce34d7445e71ff83e6063eb7761e95a8d"}],"concept.aat.300435308":[{"id":"assertion.concept.aat.300435308","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fate as defined in the captured Getty AAT record 300435308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fate as: The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","support":[{"end":582,"quote":"The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","source_id":"getty-aat.300435308","source_sha256":"4503ae982470ebb6171a6e86f754486e2bb0c1063063f144792b8f053a3a2948","start":388}],"target_id":"concept.aat.300435308","target_kind":"node","target_sha256":"7a492275c73555e56b5455d195666c44ad241e948bdbcdf04540ff8f2a2b2100"}],"concept.aat.300435319":[{"id":"assertion.concept.aat.300435319","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"apotheosis as defined in the captured Getty AAT record 300435319","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines apotheosis as: Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","support":[{"end":516,"quote":"Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","source_id":"getty-aat.300435319","source_sha256":"10489e57bf26e782765db026b662ca819b5eac7ed247b8948fb1b511d001e0b9","start":414}],"target_id":"concept.aat.300435319","target_kind":"node","target_sha256":"0a6f4d2a96157b16806e8fe83dc68df8e17b528e38c3e4539d9f977679fc52c5"}],"concept.aat.300438472":[{"id":"assertion.concept.aat.300438472","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hózhó as defined in the captured Getty AAT record 300438472","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hózhó as: Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","support":[{"end":959,"quote":"Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","source_id":"getty-aat.300438472","source_sha256":"22f2371706dcba97cdff68dd438c551fde9caf06fcc4e66b3377cbc66d454a21","start":389}],"target_id":"concept.aat.300438472","target_kind":"node","target_sha256":"282910b12bf36fdde94bb98c06be70cd3616ed102d881b8659f90222cb8222e8"}],"concept.aat.300438552":[{"id":"assertion.concept.aat.300438552","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dhyana as defined in the captured Getty AAT record 300438552","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dhyana as: In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","support":[{"end":516,"quote":"In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","source_id":"getty-aat.300438552","source_sha256":"daa30f1084b151c8e691316184a4bb505e3291f093427336aedbe4042c7cc390","start":419}],"target_id":"concept.aat.300438552","target_kind":"node","target_sha256":"e57f344f668468ffa073bbad70c45bc66f992a2517e0cdec5fac129066e044d4"}],"concept.aat.300438813":[{"id":"assertion.concept.aat.300438813","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Australasian as defined in the captured Getty AAT record 300438813","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Australasian as: The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","support":[{"end":531,"quote":"The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","source_id":"getty-aat.300438813","source_sha256":"d5d0d536fc68f5a034ff8e3da9e7d13723f0d1a4b2f46bfda7022538a237e558","start":423}],"target_id":"concept.aat.300438813","target_kind":"node","target_sha256":"c599d8d80c4f6e189e2d664937efe95f526738faa69e6f943352ba3cd709d9fb"}],"concept.aat.300443463":[{"id":"assertion.concept.aat.300443463","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Glacial as defined in the captured Getty AAT record 300443463","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Glacial as: Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","support":[{"end":588,"quote":"Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","source_id":"getty-aat.300443463","source_sha256":"8637b1861f9db3ee12c95d730588fa2a6c677f6d9ac2cf45543d14ca8be2e46e","start":419}],"target_id":"concept.aat.300443463","target_kind":"node","target_sha256":"b3b52a1540b455b81b479657a37f0abe388fc318e1c01f9a92a53e81e0f03e9b"}],"concept.aat.300444301":[{"id":"assertion.concept.aat.300444301","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Global as defined in the captured Getty AAT record 300444301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Global as: Styles, periods, and cultures that cross boundaries of multiple nations and regions.","support":[{"end":492,"quote":"Styles, periods, and cultures that cross boundaries of multiple nations and regions.","source_id":"getty-aat.300444301","source_sha256":"8f0cf2ba82b57023cf7ca5bbc99262cfeb9a43deeb510e8b2e91cad02c2c0f93","start":408}],"target_id":"concept.aat.300444301","target_kind":"node","target_sha256":"6ebceab7f47beb22a04b2b527ac19f66ab8ad62fa43bd727a33bcc79923d07e0"}],"concept.aat.300444302":[{"id":"assertion.concept.aat.300444302","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dutch Colonial Revival as defined in the captured Getty AAT record 300444302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dutch Colonial Revival as: Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","support":[{"end":553,"quote":"Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","source_id":"getty-aat.300444302","source_sha256":"90547b913b508ae23db70b888a76f7460a6d24372b0fbe4541e67a539aea4688","start":432}],"target_id":"concept.aat.300444302","target_kind":"node","target_sha256":"ad75db3e78dd8c9923948e5cc29097c6d4f60f9d69da9f9b52817fea2440f18c"}],"concept.aat.300444311":[{"id":"assertion.concept.aat.300444311","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plantation house style as defined in the captured Getty AAT record 300444311","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines plantation house style as: Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","support":[{"end":702,"quote":"Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","source_id":"getty-aat.300444311","source_sha256":"821f8cb10ee26274f28d1b441e44ba4556cccc3364b5719034abce46fed22450","start":422}],"target_id":"concept.aat.300444311","target_kind":"node","target_sha256":"16bebe3f35ffbebc362112770c102d4c6377f76c53c88126984448945b60757a"}],"concept.aat.300444313":[{"id":"assertion.concept.aat.300444313","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Modernism as defined in the captured Getty AAT record 300444313","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Modernism as: General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","support":[{"end":539,"quote":"General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","source_id":"getty-aat.300444313","source_sha256":"5888953a7276b929e37ca436d524b97b7e3d6960c9a5746256a9a30aa1ded499","start":424}],"target_id":"concept.aat.300444313","target_kind":"node","target_sha256":"f951be946366b7b0862011ab34b51c9d27dfc7cc42c46cfb843ec18cb652cf52"}],"concept.aat.300444321":[{"id":"assertion.concept.aat.300444321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Post-1945 as defined in the captured Getty AAT record 300444321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Post-1945 as: General term for styles and periods from post-1945.","support":[{"end":510,"quote":"General term for styles and periods from post-1945.","source_id":"getty-aat.300444321","source_sha256":"efa3db868ec0e3c94ce10891f2b5e64431f00e1af12395093e5f7465363834a4","start":459}],"target_id":"concept.aat.300444321","target_kind":"node","target_sha256":"e02d9b55e79e16154dff9be0d1bdd14026ae731de5e2c1a51fb0c1c68de4b32c"}],"concept.aat.300444342":[{"id":"assertion.concept.aat.300444342","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"amalgam style as defined in the captured Getty AAT record 300444342","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines amalgam style as: Style that combines recognizable elements of two or more defined styles.","support":[{"end":492,"quote":"Style that combines recognizable elements of two or more defined styles.","source_id":"getty-aat.300444342","source_sha256":"0a0d8aa5bfe9897a2acf2f49faa1e73cb0b8af0b502536b639480c10c1e5bf0a","start":420}],"target_id":"concept.aat.300444342","target_kind":"node","target_sha256":"68009c470cdfc94e0a3404625f955c73265dbc6ea67bba73ab11cacf1080a4ff"}],"concept.aat.300444345":[{"id":"assertion.concept.aat.300444345","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ranch style as defined in the captured Getty AAT record 300444345","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ranch style as: Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","support":[{"end":543,"quote":"Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","source_id":"getty-aat.300444345","source_sha256":"fa9bb6ed631f1e06ea851de00b52b63d65d4854ae8790904673c2c16253280cc","start":411}],"target_id":"concept.aat.300444345","target_kind":"node","target_sha256":"a29b25720d0cca993fa2a57dc290be95d87859b5ad93ed6bce0bb0320917d033"}],"concept.aat.300444354":[{"id":"assertion.concept.aat.300444354","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bungalow style as defined in the captured Getty AAT record 300444354","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bungalow style as: Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","support":[{"end":619,"quote":"Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","source_id":"getty-aat.300444354","source_sha256":"fbbfbc34e0ced558a7833669cabb992b6107a19cce1a01c7ebef3ab401b9ce07","start":414}],"target_id":"concept.aat.300444354","target_kind":"node","target_sha256":"a5e47d081319b83d2f25b905781dd2a8549a8af189664da5465eb02747d44e6f"}],"concept.aat.300444901":[{"id":"assertion.concept.aat.300444901","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"military style as defined in the captured Getty AAT record 300444901","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines military style as: Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","support":[{"end":522,"quote":"Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","source_id":"getty-aat.300444901","source_sha256":"f29dac6c21738992be787315831b52b5f592590a9569d447af2d3eca1e8a6726","start":414}],"target_id":"concept.aat.300444901","target_kind":"node","target_sha256":"c7ea9e19195beb1f77a0d3c6d2eac55d1a8ce0c75dedeb614fe342bd488f8f17"}],"concept.aat.300444994":[{"id":"assertion.concept.aat.300444994","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kingdom of Jerusalem as defined in the captured Getty AAT record 300444994","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kingdom of Jerusalem as: Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","support":[{"end":558,"quote":"Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","source_id":"getty-aat.300444994","source_sha256":"b28b79a942dc4477fdcf7469bc9737afc59f967a198115afb9744fd736e1a140","start":438}],"target_id":"concept.aat.300444994","target_kind":"node","target_sha256":"c15e227b4e0dc0e2564bf823f64de352c202ff3bf527b881b293adc9faabb75f"}],"concept.aat.300444999":[{"id":"assertion.concept.aat.300444999","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Post-Colonial as defined in the captured Getty AAT record 300444999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Post-Colonial as: Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","support":[{"end":705,"quote":"Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","source_id":"getty-aat.300444999","source_sha256":"a6cd0d9ff95ce568f1faeafc29174f87b868d28115f43e31ec6295622a5a7973","start":420}],"target_id":"concept.aat.300444999","target_kind":"node","target_sha256":"e6477dcdf30c015881bd38018637f8bc67843b40cc5237e81e04d489d5d5f5be"}],"concept.aat.300446915":[{"id":"assertion.concept.aat.300446915","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cāraṇa as defined in the captured Getty AAT record 300446915","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cāraṇa as: In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","support":[{"end":547,"quote":"In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","source_id":"getty-aat.300446915","source_sha256":"aeda69b19a0ea442d3359047e43353b51e23bf7b21671dbef12f0d1f7a1c7550","start":415}],"target_id":"concept.aat.300446915","target_kind":"node","target_sha256":"85b5ce587edc4940f78d15c053c0281e4f6a28dfa6113a9f23366adb2af47ee5"}],"concept.aat.300447138":[{"id":"assertion.concept.aat.300447138","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vāstuvidyā as defined in the captured Getty AAT record 300447138","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vāstuvidyā as: In Indian architecture, a science of building, architecture.","support":[{"end":479,"quote":"In Indian architecture, a science of building, architecture.","source_id":"getty-aat.300447138","source_sha256":"5c73544aa22faed0ed885ba28753fc5535fd3c60704b3bc498d8c1ea997620b8","start":419}],"target_id":"concept.aat.300447138","target_kind":"node","target_sha256":"1135f1bf4b50eeec37cf834fa7221be3c0d9db22b49eb8acdd7aaed113f52b51"}],"concept.aat.300447407":[{"id":"assertion.concept.aat.300447407","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pañcadēvōpāsanā as defined in the captured Getty AAT record 300447407","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pañcadēvōpāsanā as: Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","support":[{"end":493,"quote":"Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","source_id":"getty-aat.300447407","source_sha256":"364f4a2e47bf1a81b72c7127377cbe00ed774edc0a5aa4308c7d68eaafaff830","start":425}],"target_id":"concept.aat.300447407","target_kind":"node","target_sha256":"ecab22180ed262b930e96839d7cbd69501404947b91e9db1c69c17aa01c6dab3"}],"concept.aat.300449137":[{"id":"assertion.concept.aat.300449137","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ignorance as defined in the captured Getty AAT record 300449137","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ignorance as: The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","support":[{"end":495,"quote":"The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","source_id":"getty-aat.300449137","source_sha256":"1976b2354f24f593123c844b44bf12128757edf92d4a739b46143b8f5433228b","start":393}],"target_id":"concept.aat.300449137","target_kind":"node","target_sha256":"1076476b58f838ddd59c9df2d873ce30e1dff989f48187f7d8305d26b5e32f51"}],"concept.aat.300451043":[{"id":"assertion.concept.aat.300451043","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"private devotion as defined in the captured Getty AAT record 300451043","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines private devotion as: The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","support":[{"end":617,"quote":"The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","source_id":"getty-aat.300451043","source_sha256":"0a8f73efe1a313190079bac0659de794dd03032c3507a1e05342c32b527907d3","start":432}],"target_id":"concept.aat.300451043","target_kind":"node","target_sha256":"cba2078a4e1b2295761210cbb0585a0b86c778f7283b44bd4695ee41dd82c57c"}],"concept.aat.300451359":[{"id":"assertion.concept.aat.300451359","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immortality as defined in the captured Getty AAT record 300451359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines immortality as: In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","support":[{"end":613,"quote":"In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","source_id":"getty-aat.300451359","source_sha256":"b219db849815bc11600077407e745e63ac9a7993d4cb313b8efd05d400a7bc15","start":395}],"target_id":"concept.aat.300451359","target_kind":"node","target_sha256":"1736ae8453cc04577f80676b1740574b479bf2729819b8735557eadded137eb8"}],"concept.aat.300451673":[{"id":"assertion.concept.aat.300451673","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Noh as defined in the captured Getty AAT record 300451673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Noh as: Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","support":[{"end":799,"quote":"Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","source_id":"getty-aat.300451673","source_sha256":"9337f1dc556d122d34e5dd0e2cdef4f344ec697dff2a824f13f886afcfb9fdf7","start":415}],"target_id":"concept.aat.300451673","target_kind":"node","target_sha256":"e8ead6f91a6c6bb3114dc9c76abae89a12808962a892b1830508c0b7bdd97fd0"}],"concept.aat.300457703":[{"id":"assertion.concept.aat.300457703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ibero-American as defined in the captured Getty AAT record 300457703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ibero-American as: It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","support":[{"end":860,"quote":"It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","source_id":"getty-aat.300457703","source_sha256":"cac7d0e8b2e86348c087f860c9675526039b8001df80c6800c47cdf92748f73f","start":430}],"target_id":"concept.aat.300457703","target_kind":"node","target_sha256":"bffefe36de812816d3ddadf30e371a588c9c2cec1068ddac569337b633351cff"}],"concept.aat.300457715":[{"id":"assertion.concept.aat.300457715","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pan-American as defined in the captured Getty AAT record 300457715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pan-American as: Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","support":[{"end":968,"quote":"Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","source_id":"getty-aat.300457715","source_sha256":"09d1a4b3e25c6461432b8806c35fb421bbbc23d66d4e373812f1734f2f9c588b","start":428}],"target_id":"concept.aat.300457715","target_kind":"node","target_sha256":"cff9547c543ec3f1428b5420c04ec47a887994072666163999d635d8a0611083"}],"concept.aat.300457738":[{"id":"assertion.concept.aat.300457738","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hispanic-American as defined in the captured Getty AAT record 300457738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hispanic-American as: Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","support":[{"end":756,"quote":"Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","source_id":"getty-aat.300457738","source_sha256":"b83965cae9c61c5b1d45f31892b98094f90a924f9031bc0ae79464cedf6b7074","start":433}],"target_id":"concept.aat.300457738","target_kind":"node","target_sha256":"d6a23cb50411b3cc54eb1011fd33ac49c6523287dbc7aa711238241fea3ed0be"}],"concept.aat.300457792":[{"id":"assertion.concept.aat.300457792","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"communication design as defined in the captured Getty AAT record 300457792","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines communication design as: Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","support":[{"end":1041,"quote":"Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","source_id":"getty-aat.300457792","source_sha256":"73d29522e7f29af4647489ce0859413599d1f9bf3285cb1d01124a2f801edcbb","start":423}],"target_id":"concept.aat.300457792","target_kind":"node","target_sha256":"0395a1230b28f783c1acdde128e3214651cf6e49ad4d3f1c688f69f992ab17c9"}],"concept.aat.300457805":[{"id":"assertion.concept.aat.300457805","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hagiolatry as defined in the captured Getty AAT record 300457805","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hagiolatry as: The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","support":[{"end":556,"quote":"The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","source_id":"getty-aat.300457805","source_sha256":"8e0a6d7f62544058eec5ee238c96c8b3bed9169f888359372216de08ebae8e48","start":403}],"target_id":"concept.aat.300457805","target_kind":"node","target_sha256":"deb390d0c2e72e4c9d54e0f74cdf477bc430bdd768715ece4afbef59dd58871b"}],"concept.aat.300458684":[{"id":"assertion.concept.aat.300458684","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mazahuahcan as defined in the captured Getty AAT record 300458684","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mazahuahcan as: Refers to the conception of the west.","support":[{"end":452,"quote":"Refers to the conception of the west.","source_id":"getty-aat.300458684","source_sha256":"14d08f8d9f1b33fed1070ab24363889cab36e7da2f785a32efb063ce3edb0582","start":415}],"target_id":"concept.aat.300458684","target_kind":"node","target_sha256":"13be6a8744497a853a6b8b598d46e0ddf287df93adea9f300eb55ce9180a0ff8"}],"concept.aat.300458696":[{"id":"assertion.concept.aat.300458696","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mictlampan as defined in the captured Getty AAT record 300458696","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mictlampan as: Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","support":[{"end":540,"quote":"Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","source_id":"getty-aat.300458696","source_sha256":"52d647f6f0e40142dc85362e0546798843f7101793d2d5a9a40fe53bc26d27b7","start":414}],"target_id":"concept.aat.300458696","target_kind":"node","target_sha256":"aec2821a0d1096941a7074dd59007ec0bfd2bbb11fa3ed4c500f0fa276d3f85d"}],"concept.aat.300458697":[{"id":"assertion.concept.aat.300458697","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tlalocan as defined in the captured Getty AAT record 300458697","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tlalocan as: In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","support":[{"end":502,"quote":"In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","source_id":"getty-aat.300458697","source_sha256":"6306d7f5f66c8befa8d8a05349ba1a839454989dde98a2a8c909767861007185","start":412}],"target_id":"concept.aat.300458697","target_kind":"node","target_sha256":"55459bfe3dc1014ffebbe8bac03102e6394efd0df53f1faa487ed62bfcce36cb"}],"concept.aat.300458718":[{"id":"assertion.concept.aat.300458718","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cihuatlampan as defined in the captured Getty AAT record 300458718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cihuatlampan as: Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","support":[{"end":548,"quote":"Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","source_id":"getty-aat.300458718","source_sha256":"db9eb4440ad21933e4c3d36c5f6060e9964a093ccf620050b22a9380246eadf3","start":416}],"target_id":"concept.aat.300458718","target_kind":"node","target_sha256":"ed572187b6a316cf9aa33f13241b651ce670b89f8a350bc5644f9f53da1fe72e"}],"concept.aat.300458936":[{"id":"assertion.concept.aat.300458936","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Jarai as defined in the captured Getty AAT record 300458936","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Jarai as: The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","support":[{"end":1140,"quote":"The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","source_id":"getty-aat.300458936","source_sha256":"dd66ebf07d457951e3dd43cae580aea930ac27f01c0f73b27ad343d9c075af7d","start":392}],"target_id":"concept.aat.300458936","target_kind":"node","target_sha256":"22315d88b9b25d558e27779ffc1d66defdd1d5f095b0d93c9eda444c1bd94bc1"}],"concept.aat.300458937":[{"id":"assertion.concept.aat.300458937","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Brao as defined in the captured Getty AAT record 300458937","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Brao as: The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","support":[{"end":1209,"quote":"The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","source_id":"getty-aat.300458937","source_sha256":"320b0bed4ea653a560828d896b53a5edd926d726d35a534914a3184674bacc14","start":391}],"target_id":"concept.aat.300458937","target_kind":"node","target_sha256":"70a83fb9ab5e5a2db0f004a88b3f67c1a79008fda6b57c3bb6ad67de064ba974"}],"concept.aat.300458939":[{"id":"assertion.concept.aat.300458939","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dayak as defined in the captured Getty AAT record 300458939","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dayak as: The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","support":[{"end":996,"quote":"The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","source_id":"getty-aat.300458939","source_sha256":"fedf68f785a3433fa21e3f4dd5ac68536a61970e674b63e81991246b2ed3872d","start":392}],"target_id":"concept.aat.300458939","target_kind":"node","target_sha256":"6370ac3c40205a633dee7fa2cffa040d401b3e0a6c881db5c65147fb646631a9"}],"concept.aat.300458945":[{"id":"assertion.concept.aat.300458945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Akha as defined in the captured Getty AAT record 300458945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Akha as: The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","support":[{"end":903,"quote":"The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","source_id":"getty-aat.300458945","source_sha256":"ac258b394002b11bf5c737b84c2dc20973d84fe9ba71040a33c743279900fca7","start":391}],"target_id":"concept.aat.300458945","target_kind":"node","target_sha256":"274c0479e30c6bfd89acf501c96fe5bbf8454a932449a0a0ef2c739dd24eb568"}],"concept.aat.300458946":[{"id":"assertion.concept.aat.300458946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Batak as defined in the captured Getty AAT record 300458946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Batak as: The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","support":[{"end":1052,"quote":"The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","source_id":"getty-aat.300458946","source_sha256":"1a64efcb05bdb9d2c1b9096a26d9b36afc5c14560ab6326b3b20cdd5143ac209","start":392}],"target_id":"concept.aat.300458946","target_kind":"node","target_sha256":"ff9420adede23212d5fc6a210df3382393b499cb1f181aa285399c0a98208a90"}],"concept.aat.300458960":[{"id":"assertion.concept.aat.300458960","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Assamese as defined in the captured Getty AAT record 300458960","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Assamese as: The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","support":[{"end":1088,"quote":"The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","source_id":"getty-aat.300458960","source_sha256":"d1abff4470f1187ced11a3e2a5591963d11ee50d52774b3b5e688a6840f21017","start":391}],"target_id":"concept.aat.300458960","target_kind":"node","target_sha256":"d5b3eb1aac5ea88d5af8c1c20fa31154d1e7ae34abcbd21a2cf99fc995b5b688"}],"concept.aat.300458962":[{"id":"assertion.concept.aat.300458962","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Magars as defined in the captured Getty AAT record 300458962","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Magars as: The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","support":[{"end":1108,"quote":"The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","source_id":"getty-aat.300458962","source_sha256":"b43da8e6e1d71f3e10ae2af58adbf3c5be3843985fa2fa5268f247eac014eb67","start":389}],"target_id":"concept.aat.300458962","target_kind":"node","target_sha256":"2a24f5e05fdbd7e21890593a39980ff52d1fbd31bd6adbb5ba69e0092d45e62e"}],"concept.axion-photon-conversion":[{"id":"assertion.complete.concept.axion-photon-conversion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX paper describes inverse Primakoff conversion: a static magnetic field provides a channel for an axion to convert into a photon, whose resulting power can be resonantly enhanced in a microwave cavity. This is the proposed detection mechanism, not an observed axion signal.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"concept.axion-photon-conversion","target_kind":"node","target_sha256":"e0414c7563fb747f702b8baa8d2527e3a9073332be91eedde8a23dbb7ef068de"}],"concept.complementary-dark-matter-searches":[{"id":"assertion.complete.concept.complementary-dark-matter-searches","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ and ADMX analyses test different proposed dark-matter signals: WIMP-induced xenon nuclear recoils and axion signals in a strong-field microwave cavity, respectively. Their exclusions apply under their separate stated assumptions.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.complementary-dark-matter-searches","target_kind":"node","target_sha256":"e3a4b756f2f92afa434e9f2270d0f4a56f2081ccd75d3e28010d0a69e849e949"}],"concept.crdm-nucleon-cross-section":[{"id":"assertion.complete.concept.crdm-nucleon-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Interaction parameter constrained for boosted dark matter.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"concept.crdm-nucleon-cross-section","target_kind":"node","target_sha256":"358e11de13545b8fa87a43beec34aacb25ee076e80681e3cd54df261238aad2d"}],"concept.dark-matter-candidate-space":[{"id":"assertion.complete.concept.dark-matter-candidate-space","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited analyses investigate different proposed dark-matter candidates: WIMPs in LZ nuclear-recoil searches, axions in ADMX, primordial black holes in OGLE microlensing, ultralight bosons in Lyman-alpha data, and self-interacting models in cluster studies. This is a comparison of those cited targets, not a complete list of possibilities.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744},{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782},{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"concept.dark-matter-candidate-space","target_kind":"node","target_sha256":"25b756bc25a0fd4fd62e2732f528da21fa90b21204ad2a8af54e1c1cbca3b98f"}],"concept.dark-matter-self-interaction-cross-section":[{"id":"assertion.complete.concept.dark-matter-self-interaction-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In the Tulin–Yu review, the dark-matter scattering cross section, often expressed per unit particle mass, is a parameter constrained conditionally by astrophysical observations, including merging clusters. The relevant bounds depend on interaction and velocity assumptions.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":27165,"quote":"where\nm\nm\nis the DM particle mass, while\nσ\n,\nv\nrel\n\\sigma,v_{\\rm rel}\nare the cross section and relative velocity, respectively, for scattering. Within the central region of a typical dwarf galaxy, we have\nρ\ndm\n∼\n0.1\n​\nM\n⊙\n/\npc\n3\n\\rho_{\\rm dm}\\sim 0.1\\;{\\rm\\,M}_{\\odot}/{\\rm pc}^{3}\nand\nv\nrel\n∼\n50\n​\nkm\n/\ns\nv_{\\rm rel}\\sim 50\\;{\\rm km/s}\n[\n96\n]\n. Therefore, the cross section per unit mass must be at least\nσ\n/\nm\n∼\n1\n​\ncm\n2\n/\ng\n≈\n2\n×\n10\n−\n24\n​\ncm\n2\n/\nGeV\n\\sigma/m\\sim 1\\;{\\rm cm^{2}/g}\\approx 2\\times 10^{-24}\\;{\\rm cm^{2}/GeV}\n(2)\nto have an effect on the halo, corresponding to at least one scattering per particle over 10 Gyr galactic timescales. For\nσ\n/\nm\n∼\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\sim 1\\;{\\rm cm^{2}/g}\n, the mean free path of DM particles is larger than the core radii (Knudsen number larger than unity) and heat conduction is effective in the inner halo. Provided\nσ\n/\nm\n\\sigma/m\nis not dramatically larger than this value,\nR\nscat\nR_{\\rm scat}\nis negligible during the early Universe when structure forms.\n4\n4\n4\nAlthough self-interactions may be active in the\nvery\nearly Universe, long before matter-radiation equality, they rapidly fall out of equilibrium due to the Hubble dilution and redshifting of DM particles.\nTherefore SIDM retains the success of large-scale structure formation from\nΛ\n\\Lambda\nCDM, affecting structure at late times and only on small scales in the dense inner regions of halos.\nCored density profiles lead to shallower rotation curves for dwarf and LSB spiral galaxies at small radii, in accord with observations, while cores in satellite galaxies ameliorate the too-big-to-fail problem by reducing the predicted stellar line-of-sight velocity dispersion for the largest subhalos. If\nσ\n/\nm\n\\sigma/m\nis fixed as in Eq. (\n2\n), the effect of self-interactions on the halo scales approximately in a self-similar fashion, and larger halos, such as those for massive elliptical galaxies and clusters, may be impacted by self-interactions at proportionally larger radii.\nIn principle, self-interactions can also affect substructure, reducing the subhalo mass function to solve the missing satellites problem. SIDM subhalos are prone to tidal disruption, being less concentrated than their CDM counterparts, as well as evaporation due to ram pressure stripping from the host halo\n[\n92\n]\n. However, this mechanism requires a too-large cross section that is excluded for reasons we discuss in §\nIII\n.\nThe effect of self-interactions on DM halos has been borne out through N-body simulations. Soon after Spergel & Steinhardt’s proposal, a first wave of SIDM simulations was performed\n[\n97\n,\n98\n,\n99\n,\n100\n,\n101\n,\n102\n,\n103\n]\n. In conjunction with these simulations, a number of constraints on SIDM emerged, the most stringent of which were strong lensing measurements of the ellipticity and central density of cluster MS2137-23\n[\n104\n,\n105\n]\n. These studies limited the cross section to be below\n0.1\n​\ncm\n2\n/\ng\n0.1\\;{\\rm cm^{2}/g}\n, which excludes self-interactions at a level to explain small scale issues in galaxies. The Bullet Cluster provides additional evidence for the collisionless nature of DM, requiring\nσ\n/\nm\n≲\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\lesssim 1\\;{\\rm cm^{2}/g}\n[\n106\n]\n. Although ad hoc velocity dependencies were put forth to evade these constraints\n[\n101\n,\n107\n,\n108\n,\n103\n]\n, SIDM largely fell into disfavor in light of these difficulties.\nMore recently, new N-body simulations for SIDM, with dramatically higher resolution and halo statistics, have revived DM self-interactions\n[\n109\n,\n94\n,\n95\n,\n110\n,\n111\n,\n112\n,\n113\n,\n114\n]\n. Many of the constraints from larger scales are much weaker than previously thought\n[\n94\n,\n95\n]\n. In particular, constraints based on ellipticity have been overestimated: self-interactions do not erase triaxiality as effectively as previously supposed, and moreover, an observed ellipticity has contributions along the line-of-sight from regions outside the core where the halo remains triaxial\n[\n95\n]\n. The conclusion is that\nσ\n/\nm\n∼\n0.5\n−\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\sim 0.5-1\\;{\\rm cm^{2}/g}\ncan solve the core-cusp and TBTF issues on small scales, while remaining approximately consistent with other astrophysical constraints on larger scales\n[\n94\n,\n95\n,\n110\n,\n111\n]\n. However, more recent studies based on stacked merging clusters\n[\n115\n]\nand stellar kinematics within cluster cores\n[\n116\n]\nsuggest some tension with these values. Viable SIDM models are preferred to have a scattering cross section with a mild velocity-dependence from dwarf to cluster scales. We discuss these issues in further detail in §\nIII\n.\nOn the theory side, a new semi-analytical SIDM halo model has been developed based on the Jeans equation\n[\n117\n,\n116\n,\n118\n]\n. It can reproduce the simulation results for SIDM profiles within 10–20% while being much cheaper computationally. Discussed in §\nIV\n, this approach provides insight for understanding the baryonic influence on SIDM halo properties\n[\n117\n]\n, testing SIDM models from dwarf to cluster scales\n[\n116\n]\n, and addressing the diversity in rotation curves\n[\n118\n]\n.\nFurthermore, there has been important progress in particle physics models for SIDM. Both numerical and analytical methods have been developed to accurately calculate the cross section for SIDM models involving the Yukawa\n[\n119\n,\n120\n,\n121\n]\nor atomic interactions\n[\n122\n,\n123\n]\n. These studies make it possible to map astrophysical constraints on\nσ\n/\nm\n\\sigma/m\nto the particle model parameters, such as the DM and mediator masses and coupling constant. In addition, an effective theory approach has been proposed in parametrizing SIDM models with a set of variables that are directly correlated with astrophysical observations\n[\n124\n,\n125\n]\n.\nPositive observations\nσ\n/\nm\n\\sigma/m\nv\nrel\nv_{\\rm rel}\nObservation\nRefs.\nCores in spiral galaxies\n≳\n1\n​\ncm\n2\n/\ng\n\\gtrsim 1\\;{\\rm cm^{2}/g}\n30\n−\n200\n​\nkm\n/\ns\n30-200\\;{\\rm km/s}\nRotation curves\n[\n102\n,\n116\n]\n(dwarf/LSB galaxies)\nToo-big-to-fail problem\nMilky Way\n≳\n0.6\n​\ncm\n2\n/\ng\n\\gtrsim 0.6\\;{\\rm cm^{2}/g}\n50\n​\nkm\n/\ns\n50\\;{\\rm km/s}\nStellar dispersion\n[\n110\n]\nLocal Group\n≳\n0.5\n​\ncm\n2\n/\ng\n\\gtrsim 0.5\\;{\\rm cm^{2}/g}\n50\n​\nkm\n/\ns\n50\\;{\\rm km/s}\nStellar dispersion\n[\n111\n]\nCores in clusters\n∼\n0.1\n​\ncm\n2\n/\ng\n\\sim 0.1\\;{\\rm cm^{2}/g}\n1500\n​\nkm\n/\ns\n1500\\;{\\rm km/s}\nStellar dispersion, lensing\n[\n116\n,\n126\n]\nAbell 3827 subhalo merger\n∼\n1.5\n​\ncm\n2\n/\ng\n\\sim 1.5\\;{\\rm cm^{2}/g}\n1500\n​\nkm\n/\ns\n1500\\;{\\rm km/s}\nDM-galaxy offset\n[\n127\n]\nAbell 520 cluster merger\n∼\n1\n​\ncm\n2\n/\ng\n\\sim 1\\;{\\rm cm^{2}/g}\n2000\n−\n3000\n​\nkm\n/\ns\n2000-3000\\;{\\rm km/s}\nDM-galaxy offset\n[\n128\n,\n129\n,\n130\n]\nConstraints\nHalo shapes/ellipticity\n≲\n1\n​\ncm\n2\n/\ng\n\\lesssim 1\\;{\\rm cm^{2}/g}\n1300\n​\nkm\n/\ns\n1300\\;{\\rm km/s}\nCluster lensing surveys\n[\n95\n]\nSubstructure mergers\n≲\n2\n​\ncm\n2\n/\ng\n\\lesssim 2\\;{\\rm cm^{2}/g}\n∼\n500\n−\n4000\n​\nkm\n/\ns\n\\sim 500-4000\\;{\\rm km/s}\nDM-galaxy offset\n[\n115\n,\n131\n]\nMerging clusters\n≲\nfew\n​\ncm\n2\n/\ng\n\\lesssim{\\rm few}\\;{\\rm cm^{2}/g}\n2000\n−\n4000\n​\nkm\n/\ns\n2000-4000\\;{\\rm km/s}\nPost-merger halo survival\nTable\n2\n(Scattering depth\nτ\n<\n1\n\\tau<1\n)\nBullet Cluster\n≲\n0.7\n​\ncm\n2\n/\ng\n\\lesssim 0.7\\;{\\rm cm^{2}/g}\n4000\n​\nkm\n/\ns\n4000\\;{\\rm km/s}\nMass-to-light ratio\n[\n106\n]\nTable 1:\nSummary of positive observations and constraints on self-interaction cross section per DM mass. Italicized observations are based on\nsingle individual systems\n, while the rest are derived from sets of multiple systems. Limits quoted, which assume constant\nσ\n/\nm\n\\sigma/m\n, may be interpreted as a function of collisional velocity\nv\nrel\nv_{\\rm rel}\nprovided\nσ\n/\nm\n\\sigma/m\nis not steeply velocity-dependent. References noted here are limited to those containing quoted self-interaction cross section values. Further references, including original studies of observations, are cited in the corresponding sections below.\n","source_id":"completion-source.ad17fd11e99deb1b05e1","source_sha256":"8bdce0ad6d58c30f930151a1a29a4f1e4ea52cdae80414d203093f36970ac9e3","start":19388}],"target_id":"concept.dark-matter-self-interaction-cross-section","target_kind":"node","target_sha256":"0093730b620a9fcdc2a38b8d0702f4a7dba05e8cd900c10243344ce61b48d2de"}],"concept.dfsz-axion":[{"id":"assertion.complete.concept.dfsz-axion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX Run 1B paper describes the DFSZ model as an axion-experiment benchmark characterized by axion-photon coupling. This existing record is retained separately pending an explicit identity review of the other DFSZ record.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"concept.dfsz-axion","target_kind":"node","target_sha256":"b6ae971fcce91ef508f3ebbd7798ed702a000bf07656ef2ef5ccdf4cd1c6f6a2"}],"concept.earth-mass-pbh":[{"id":"assertion.complete.concept.earth-mass-pbh","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited analysis finds that an Earth-mass primordial-black-hole population could reproduce six ultrashort OGLE events if its dark-matter fraction is at the percent level. It presents this as a conditional interpretation alongside free-floating planets.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"concept.earth-mass-pbh","target_kind":"node","target_sha256":"952f449a1a814830b26675f266c731a0cd3f2e1d82388846d79e060a8b882422"}],"concept.eia.adjustable-speed-drives":[{"id":"assertion.concept.eia.adjustable-speed-drives","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Adjustable speed drives as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Adjustable speed drives as: Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","support":[{"end":5792,"quote":"Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":5584}],"target_id":"concept.eia.adjustable-speed-drives","target_kind":"node","target_sha256":"8f63d0d3e046116bfad6c0ce0e965230072c75680ae4bd458fcd6f3653a603f0"}],"concept.eia.adjusted-electricity":[{"id":"assertion.concept.eia.adjusted-electricity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Adjusted electricity as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Adjusted electricity as: A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","support":[{"end":6184,"quote":"A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":5815}],"target_id":"concept.eia.adjusted-electricity","target_kind":"node","target_sha256":"42be97b46b764745bd6bd24156e96155c93b1b51c2e056470f514985fa23e623"}],"concept.eia.aftermarket-converted-vehicle":[{"id":"assertion.concept.eia.aftermarket-converted-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Aftermarket converted vehicle as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Aftermarket converted vehicle as: A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","support":[{"end":8506,"quote":"A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":8357}],"target_id":"concept.eia.aftermarket-converted-vehicle","target_kind":"node","target_sha256":"ef374afb2cb2880366db71b78a7f0e2cd0731e80a335c9bce21763dffa31c158"}],"concept.eia.agglomerating-character":[{"id":"assertion.concept.eia.agglomerating-character","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Agglomerating character as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Agglomerating character as: Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","support":[{"end":9190,"quote":"Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":8799}],"target_id":"concept.eia.agglomerating-character","target_kind":"node","target_sha256":"d04d75d520053302823c79211a1e152719133108ea7ac4ee8f074789ca69919f"}],"concept.eia.air-cleaner":[{"id":"assertion.concept.eia.air-cleaner","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air cleaner as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air cleaner as: A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","support":[{"end":10572,"quote":"A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10357}],"target_id":"concept.eia.air-cleaner","target_kind":"node","target_sha256":"1ed901ccd125e1c5bf7dcbac18e9b3ff6bf4b601a2d5553b195e4947297df7e8"}],"concept.eia.air-collector":[{"id":"assertion.concept.eia.air-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air collector as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","support":[{"end":10705,"quote":"A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10588}],"target_id":"concept.eia.air-collector","target_kind":"node","target_sha256":"817845d511f42b134040663ef85508313a7ffa48b56621db7b93387298616abc"}],"concept.eia.air-conditioning":[{"id":"assertion.concept.eia.air-conditioning","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air conditioning as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air conditioning as: Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","support":[{"end":10980,"quote":"Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10724}],"target_id":"concept.eia.air-conditioning","target_kind":"node","target_sha256":"414486e683d216bc875e98a0f24e28781d228fdfdfb243df46b5cf9d083c1171"}],"concept.eia.air-pollution-abatement-equipment":[{"id":"assertion.concept.eia.air-pollution-abatement-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air pollution abatement equipment as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air pollution abatement equipment as: Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","support":[{"end":12204,"quote":"Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":11814}],"target_id":"concept.eia.air-pollution-abatement-equipment","target_kind":"node","target_sha256":"ce13025d190ad8f37f3078ef92efb558025c0de41245aac4985a7baee24a1063"}],"concept.eia.alkylation":[{"id":"assertion.concept.eia.alkylation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alkylation as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alkylation as: A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","support":[{"end":13059,"quote":"A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":12673}],"target_id":"concept.eia.alkylation","target_kind":"node","target_sha256":"f9b92e13acca56fd1955202f3f20664f0da7745493b2edd2e35719d001326726"}],"concept.eia.alternating-current-ac":[{"id":"assertion.concept.eia.alternating-current-ac","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alternating current (AC) as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alternating current (AC) as: An electric current that reverses its direction at regularly recurring intervals.","support":[{"end":13608,"quote":"An electric current that reverses its direction at regularly recurring intervals.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":13527}],"target_id":"concept.eia.alternating-current-ac","target_kind":"node","target_sha256":"68c2e95740fa0cdffc75046fc9df780beccd9e666b73d97f4785b476ad801788"}],"concept.eia.alternative-fuel-vehicle-afv":[{"id":"assertion.concept.eia.alternative-fuel-vehicle-afv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alternative fuel vehicle (AFV) as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alternative fuel vehicle (AFV) as: A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","support":[{"end":14891,"quote":"A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":14561}],"target_id":"concept.eia.alternative-fuel-vehicle-afv","target_kind":"node","target_sha256":"19efcffc4b32ccd94b4e8c86fc4187a2b629ee1145ef6eb3d4120f5896fea3ba"}],"concept.eia.amorphous-silicon":[{"id":"assertion.concept.eia.amorphous-silicon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Amorphous silicon as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Amorphous silicon as: An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","support":[{"end":16948,"quote":"An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":16664}],"target_id":"concept.eia.amorphous-silicon","target_kind":"node","target_sha256":"5668cef9e13207e5bc960c4f6796dbc39ab5db6c9e157211a6136ce0a415e80a"}],"concept.eia.ampere":[{"id":"assertion.concept.eia.ampere","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ampere as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ampere as: The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","support":[{"end":17815,"quote":"The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":17700}],"target_id":"concept.eia.ampere","target_kind":"node","target_sha256":"785cacdb24e6a8e90972edaec4f2d35efe389a74063628f4798009fe75a5cafc"}],"concept.eia.apparent-power":[{"id":"assertion.concept.eia.apparent-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Apparent power as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Apparent power as: The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power. It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA). See","support":[{"end":22321,"quote":"The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power.  It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA).  See","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":22093}],"target_id":"concept.eia.apparent-power","target_kind":"node","target_sha256":"bba2ece9e67483a95bf5ac92b2d6e1aead5c9545da1d614239b90f26c5986211"}],"concept.eia.appliance":[{"id":"assertion.concept.eia.appliance","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Appliance as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Appliance as: A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","support":[{"end":22943,"quote":"A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":22371}],"target_id":"concept.eia.appliance","target_kind":"node","target_sha256":"7854daec1e7724dbcb078ac2d43bf2323c74cb5c2b6a06b11c6060c1ec6e0dcb"}],"concept.eia.asphalt":[{"id":"assertion.concept.eia.asphalt","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Asphalt as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Asphalt as: A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","support":[{"end":25798,"quote":"A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":25346}],"target_id":"concept.eia.asphalt","target_kind":"node","target_sha256":"d42a2b9bb80f072fdd11e56383ceb617cee9e913836f1361e78f9ad8ddcc01e8"}],"concept.eia.atmospheric-crude-oil-distillation":[{"id":"assertion.concept.eia.atmospheric-crude-oil-distillation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Atmospheric crude oil distillation as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Atmospheric crude oil distillation as: The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","support":[{"end":28131,"quote":"The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":27859}],"target_id":"concept.eia.atmospheric-crude-oil-distillation","target_kind":"node","target_sha256":"40e598f8dc7ee817d8d19abc1c57ce5c27ae776baf1ca57cac242eefec78eeff"}],"concept.eia.auger-mine":[{"id":"assertion.concept.eia.auger-mine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Auger mine as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Auger mine as: A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","support":[{"end":28316,"quote":"A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28144}],"target_id":"concept.eia.auger-mine","target_kind":"node","target_sha256":"fff5d26d567a8d981701ec39a2175acf614c3b1d7b3e89f9d6db02d5e686bbc4"}],"concept.eia.automatic-set-back-or-clock-thermostat":[{"id":"assertion.concept.eia.automatic-set-back-or-clock-thermostat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Automatic set-back or clock thermostat as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Automatic set-back or clock thermostat as: A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","support":[{"end":28614,"quote":"A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28508}],"target_id":"concept.eia.automatic-set-back-or-clock-thermostat","target_kind":"node","target_sha256":"920e0d61a461ee3e64bfe9fe2ce1fe0eab10b1987a741dffdfdb4fd2d2d093e5"}],"concept.eia.auxiliary-generator":[{"id":"assertion.concept.eia.auxiliary-generator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Auxiliary generator as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Auxiliary generator as: A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","support":[{"end":29378,"quote":"A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28995}],"target_id":"concept.eia.auxiliary-generator","target_kind":"node","target_sha256":"165bb42636646c31ca270861051a708982d04b8816d5e797a22552b69aca6b38"}],"concept.eia.azimuth-angle":[{"id":"assertion.concept.eia.azimuth-angle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Azimuth angle as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Azimuth angle as: The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","support":[{"end":33674,"quote":"The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":33543}],"target_id":"concept.eia.azimuth-angle","target_kind":"node","target_sha256":"31700191a4111d22cc6563aa719fe75a597bb6770872488fd98456f96bdfa7b4"}],"concept.eia.backup-fuel":[{"id":"assertion.concept.eia.backup-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Backup fuel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Backup fuel as: In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","support":[{"end":813,"quote":"In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":632}],"target_id":"concept.eia.backup-fuel","target_kind":"node","target_sha256":"e068b43e2df6ca0cf0e5770aa02bf1f320b32ad43ccacf70cbaf9c3fb12bb60b"}],"concept.eia.backup-power":[{"id":"assertion.concept.eia.backup-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Backup power as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Backup power as: Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","support":[{"end":1109,"quote":"Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":999}],"target_id":"concept.eia.backup-power","target_kind":"node","target_sha256":"1be79488e2aeef87684af918b1c3e84a39f63eef249a57244aa9a91dc243b337"}],"concept.eia.barrel":[{"id":"assertion.concept.eia.barrel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrel as: A unit of volume equal to 42 U.S. gallons.","support":[{"end":2126,"quote":"A unit of volume equal to 42 U.S. gallons.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":2084}],"target_id":"concept.eia.barrel","target_kind":"node","target_sha256":"13b68653a19fdc7d8c3a225b3ac22e5ca07fd41b4e279105f37cfcd40619ddc1"}],"concept.eia.barrels-per-calendar-day":[{"id":"assertion.concept.eia.barrels-per-calendar-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrels per calendar day as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrels per calendar day as: The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","support":[{"end":2423,"quote":"The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":2153}],"target_id":"concept.eia.barrels-per-calendar-day","target_kind":"node","target_sha256":"c9657c1de407b79b21df8ab0d958cece3ffbd605c31a66c3e4def1a128b5fd69"}],"concept.eia.barrels-per-stream-day":[{"id":"assertion.concept.eia.barrels-per-stream-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrels per stream day as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrels per stream day as: The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","support":[{"end":3518,"quote":"The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":3304}],"target_id":"concept.eia.barrels-per-stream-day","target_kind":"node","target_sha256":"ab431ea243c3862a04630d2cae29ad6ace051a0fe2f9661213ae7b8fe4f53491"}],"concept.eia.base-load-capacity":[{"id":"assertion.concept.eia.base-load-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Base load capacity as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Base load capacity as: The generating equipment normally operated to serve loads on an around-the-clock basis.","support":[{"end":4173,"quote":"The generating equipment normally operated to serve loads on an around-the-clock basis.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":4086}],"target_id":"concept.eia.base-load-capacity","target_kind":"node","target_sha256":"e8b6f9a9a52f3ed687092b88cae42ff5cb90adc4ad54e6bd4b20a6670c69435e"}],"concept.eia.baseboard-heater":[{"id":"assertion.concept.eia.baseboard-heater","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Baseboard heater as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Baseboard heater as: As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","support":[{"end":5507,"quote":"As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":5184}],"target_id":"concept.eia.baseboard-heater","target_kind":"node","target_sha256":"8b678ff74c244e3b2ce7b4a018568025c06996363f6daf23875718c9bc820ef8"}],"concept.eia.battery-electric-vehicle-bev":[{"id":"assertion.concept.eia.battery-electric-vehicle-bev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Battery electric vehicle (BEV) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Battery electric vehicle (BEV) as: An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","support":[{"end":5793,"quote":"An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":5540}],"target_id":"concept.eia.battery-electric-vehicle-bev","target_kind":"node","target_sha256":"47b5bbe1d2abb43c8ef2da46047149d953f46253bfa58bfaf96001741a0ac641"}],"concept.eia.bi-fuel-vehicle":[{"id":"assertion.concept.eia.bi-fuel-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bi-fuel vehicle as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bi-fuel vehicle as: A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","support":[{"end":6354,"quote":"A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":6226}],"target_id":"concept.eia.bi-fuel-vehicle","target_kind":"node","target_sha256":"da2af34a3b167bb0740e915865fea2befab7b07ee1ba7166ffdd9721d7ad3d7c"}],"concept.eia.bituminous-coal":[{"id":"assertion.concept.eia.bituminous-coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bituminous coal as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bituminous coal as: A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","support":[{"end":10493,"quote":"A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":9791}],"target_id":"concept.eia.bituminous-coal","target_kind":"node","target_sha256":"5ea58059930612e6166e17918154677f87d25f043d97926c229e77a553067f06"}],"concept.eia.black-liquor":[{"id":"assertion.concept.eia.black-liquor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Black liquor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Black liquor as: A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","support":[{"end":10854,"quote":"A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":10508}],"target_id":"concept.eia.black-liquor","target_kind":"node","target_sha256":"8a699399a151008867c306a8eb0dec33348ec7f2d2a38a8d72b89778b9bcd366"}],"concept.eia.blast-furnace":[{"id":"assertion.concept.eia.blast-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blast furnace as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blast furnace as: A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","support":[{"end":11126,"quote":"A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11048}],"target_id":"concept.eia.blast-furnace","target_kind":"node","target_sha256":"1b9162148ca5931c53371b382f6ca76231a12c25d9d378a02794dfb5616e56eb"}],"concept.eia.blast-furnace-gas":[{"id":"assertion.concept.eia.blast-furnace-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blast-furnace gas as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blast-furnace gas as: The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","support":[{"end":11309,"quote":"The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11146}],"target_id":"concept.eia.blast-furnace-gas","target_kind":"node","target_sha256":"201fb03308423e213026e485934fc6e380017e01f19466d498fcf7c793ff39c4"}],"concept.eia.blending-plant":[{"id":"assertion.concept.eia.blending-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blending plant as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blending plant as: A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","support":[{"end":11559,"quote":"A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11388}],"target_id":"concept.eia.blending-plant","target_kind":"node","target_sha256":"a520f7cae6c4b3ea82b62fda589afcdf7257ed7675c5c17d0b3b02d17aad9c79"}],"concept.eia.boiler":[{"id":"assertion.concept.eia.boiler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiler as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiler as: A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","support":[{"end":12230,"quote":"A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11895}],"target_id":"concept.eia.boiler","target_kind":"node","target_sha256":"5ee0fa2a03e71269a1e088870b52cdcc7d4fdec601e0469215b4e2b1e7e3aab0"}],"concept.eia.boiler-fuel":[{"id":"assertion.concept.eia.boiler-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiler fuel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiler fuel as: An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","support":[{"end":12432,"quote":"An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":12244}],"target_id":"concept.eia.boiler-fuel","target_kind":"node","target_sha256":"ecf114011fb08728b72b240f09719c0ae236d26620cfa33ec4c3d55aa1cebc5f"}],"concept.eia.boiling-water-reactor-bwr":[{"id":"assertion.concept.eia.boiling-water-reactor-bwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiling-water reactor (BWR) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiling-water reactor (BWR) as: A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","support":[{"end":12628,"quote":"A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":12462}],"target_id":"concept.eia.boiling-water-reactor-bwr","target_kind":"node","target_sha256":"4744a5d07b65c0c27d945d90ddfbc2bb07c8b2493eaf7e5e9df828b5930e42f8"}],"concept.eia.bottled-gas-lpg-or-propane":[{"id":"assertion.concept.eia.bottled-gas-lpg-or-propane","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottled gas, LPG, or propane as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottled gas, LPG, or propane as: Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","support":[{"end":14028,"quote":"Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":13823}],"target_id":"concept.eia.bottled-gas-lpg-or-propane","target_kind":"node","target_sha256":"08df0b337c4aa4300e286170612631bb49629989b274a8b04c0b7f9707937742"}],"concept.eia.bottom-ash":[{"id":"assertion.concept.eia.bottom-ash","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottom ash as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottom ash as: Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","support":[{"end":14150,"quote":"Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":14041}],"target_id":"concept.eia.bottom-ash","target_kind":"node","target_sha256":"f1f1eceaecea1c89193dd9c2244a47e43eaba07fe4330f96b8127fcb4d4c1e43"}],"concept.eia.bottoming-cycle":[{"id":"assertion.concept.eia.bottoming-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottoming cycle as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottoming cycle as: A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","support":[{"end":14556,"quote":"A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":14411}],"target_id":"concept.eia.bottoming-cycle","target_kind":"node","target_sha256":"8503e55812109600e95d52d9c55083595a0744a85583187565a6e9efd85e77b7"}],"concept.eia.breeder-reactor":[{"id":"assertion.concept.eia.breeder-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Breeder reactor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Breeder reactor as: A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","support":[{"end":15424,"quote":"A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15171}],"target_id":"concept.eia.breeder-reactor","target_kind":"node","target_sha256":"3db82c9593774a25d463b3e950855d8656e6cabcf3e743718df3a855809e044d"}],"concept.eia.british-thermal-unit":[{"id":"assertion.concept.eia.british-thermal-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"British thermal unit as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines British thermal unit as: The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","support":[{"end":15849,"quote":"The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15647}],"target_id":"concept.eia.british-thermal-unit","target_kind":"node","target_sha256":"18cafbebc80f00fc78c7c0cdb732b4478f09f97452d9ddeab92245824c905221"}],"concept.eia.btu-conversion-factor":[{"id":"assertion.concept.eia.btu-conversion-factor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Btu conversion factor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Btu conversion factor as: A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","support":[{"end":16214,"quote":"A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15925}],"target_id":"concept.eia.btu-conversion-factor","target_kind":"node","target_sha256":"c0a7662825d0af320bd0171b4bea7efde4826e54deeab03e0a898612eb0ea15f"}],"concept.eia.built-in-electric-units":[{"id":"assertion.concept.eia.built-in-electric-units","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Built-in electric units as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Built-in electric units as: An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","support":[{"end":18544,"quote":"An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":18247}],"target_id":"concept.eia.built-in-electric-units","target_kind":"node","target_sha256":"994e64f85baadec948324ba77cdef5036a932efaea5ad4f3a7bfd4b204e8e71c"}],"concept.eia.bulk-station":[{"id":"assertion.concept.eia.bulk-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bulk station as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bulk station as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","support":[{"end":19159,"quote":"A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":18952}],"target_id":"concept.eia.bulk-station","target_kind":"node","target_sha256":"0a03c9a43d16e0f88b2a3a7aadc6cd15e7d4925a95d925c56865b9351d3f8168"}],"concept.eia.bulk-terminal":[{"id":"assertion.concept.eia.bulk-terminal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bulk terminal as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bulk terminal as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","support":[{"end":19388,"quote":"A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":19175}],"target_id":"concept.eia.bulk-terminal","target_kind":"node","target_sha256":"f243e4fd060e6b79e46e17e5643eed171cae382c23cf3a33ccfb3bb6cdbb603d"}],"concept.eia.bundled-utility-service-electric":[{"id":"assertion.concept.eia.bundled-utility-service-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bundled utility service (electric) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bundled utility service (electric) as: A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","support":[{"end":19572,"quote":"A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":19425}],"target_id":"concept.eia.bundled-utility-service-electric","target_kind":"node","target_sha256":"d29e682dbcdd71c3cd344f46b35ae447421a5c50bc5f0535d241e7a1b448a09b"}],"concept.eia.burnup":[{"id":"assertion.concept.eia.burnup","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Burnup as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Burnup as: Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","support":[{"end":20473,"quote":"Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":20292}],"target_id":"concept.eia.burnup","target_kind":"node","target_sha256":"98372bfc8825c1aa8d4364d72626b198c5036a97ab60db02399b3b47eba24b5e"}],"concept.eia.bus":[{"id":"assertion.concept.eia.bus","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bus as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bus as: An electrical conductor that serves as a common connection for two or more electrical circuits.","support":[{"end":20574,"quote":"An electrical conductor that serves as a common connection for two or more electrical circuits.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":20479}],"target_id":"concept.eia.bus","target_kind":"node","target_sha256":"d05c36241292ed27eb10969f2d44f05439539e5ade1922b0caf4de3e4f1bfc93"}],"concept.eia.calcination":[{"id":"assertion.concept.eia.calcination","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Calcination as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Calcination as: A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","support":[{"end":933,"quote":"A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":753}],"target_id":"concept.eia.calcination","target_kind":"node","target_sha256":"c75f4514d8ad94ea169328fc69afad7305ce53e7c337853c2ca031b1a00b38af"}],"concept.eia.calcium-sulfite":[{"id":"assertion.concept.eia.calcium-sulfite","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Calcium sulfite as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Calcium sulfite as: A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","support":[{"end":1204,"quote":"A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":1093}],"target_id":"concept.eia.calcium-sulfite","target_kind":"node","target_sha256":"34179d6e2962a4e274e1a00cb17f43e42f3e937b510d1d3af38cdf899ea75a01"}],"concept.eia.canadian-deuterium-uranium-reactor-candu":[{"id":"assertion.concept.eia.canadian-deuterium-uranium-reactor-candu","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Canadian deuterium uranium reactor (CANDU) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Canadian deuterium uranium reactor (CANDU) as: Uses heavy water or deuterium oxide (D","support":[{"end":1287,"quote":"Uses heavy water or deuterium oxide (D","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":1249}],"target_id":"concept.eia.canadian-deuterium-uranium-reactor-candu","target_kind":"node","target_sha256":"bba71bbecf5fbe5f425f77346b5b45c0001ed7afb5ee2ab9dcdf5e3bd1a464f1"}],"concept.eia.capacity-purchased":[{"id":"assertion.concept.eia.capacity-purchased","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Capacity (purchased) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Capacity (purchased) as: The amount of energy and capacity available for purchase from outside the system.","support":[{"end":2572,"quote":"The amount of energy and capacity available for purchase from outside the system.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":2491}],"target_id":"concept.eia.capacity-purchased","target_kind":"node","target_sha256":"cf446be0544f1fc54cefac7ee7a99583bf6e5ce0f21aedc2c140e9ebc6a1d224"}],"concept.eia.carbon-intensity":[{"id":"assertion.concept.eia.carbon-intensity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Carbon intensity as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Carbon intensity as: The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","support":[{"end":6467,"quote":"The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":6028}],"target_id":"concept.eia.carbon-intensity","target_kind":"node","target_sha256":"92da29dbd252699af45178a6404a40d71cdeb1fd4135702ab527a025d93e8620"}],"concept.eia.carburetor":[{"id":"assertion.concept.eia.carburetor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Carburetor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Carburetor as: A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","support":[{"end":7670,"quote":"A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":7349}],"target_id":"concept.eia.carburetor","target_kind":"node","target_sha256":"183cb614c368300e563138706da32b6216330f571f27eb5e9749b48532957c55"}],"concept.eia.casinghead-gas-or-oil-well-gas":[{"id":"assertion.concept.eia.casinghead-gas-or-oil-well-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Casinghead gas (or oil well gas) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Casinghead gas (or oil well gas) as: Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","support":[{"end":8356,"quote":"Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8243}],"target_id":"concept.eia.casinghead-gas-or-oil-well-gas","target_kind":"node","target_sha256":"3cbc9d6d7a6e1d20d50058d22e4a1ef3c0d2b792daf15c43e04d5cfd89dbb1f2"}],"concept.eia.cast-silicon":[{"id":"assertion.concept.eia.cast-silicon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cast silicon as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cast silicon as: Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","support":[{"end":8917,"quote":"Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8371}],"target_id":"concept.eia.cast-silicon","target_kind":"node","target_sha256":"4cf3acef21130592c68c30996427f3ea0763e6f13da0fa864a01b3758f6f3e7b"}],"concept.eia.catalytic-converter":[{"id":"assertion.concept.eia.catalytic-converter","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic converter as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic converter as: A device containing a catalyst for converting automobile exhaust into mostly harmless products.","support":[{"end":9080,"quote":"A device containing a catalyst for converting automobile exhaust into mostly harmless products.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8985}],"target_id":"concept.eia.catalytic-converter","target_kind":"node","target_sha256":"868fc6a7297d16f05fd23d3d72d8dac4d917f8d1e6a30e08a4e1a224f8c25c34"}],"concept.eia.catalytic-cracking":[{"id":"assertion.concept.eia.catalytic-cracking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic cracking as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","support":[{"end":9443,"quote":"The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":9101}],"target_id":"concept.eia.catalytic-cracking","target_kind":"node","target_sha256":"05c25ff34d26419468db982bd76fabf03421663adadb0d1e0f3b226c2ba36005"}],"concept.eia.catalytic-hydrotreating":[{"id":"assertion.concept.eia.catalytic-hydrotreating","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic hydrotreating as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic hydrotreating as: A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","support":[{"end":10458,"quote":"A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":9875}],"target_id":"concept.eia.catalytic-hydrotreating","target_kind":"node","target_sha256":"310510f48f5090cef19552276a35c13ff206daf7e33c68bbfb2dd6a81b5ccaa8"}],"concept.eia.cells-to-oem-non-pv":[{"id":"assertion.concept.eia.cells-to-oem-non-pv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cells to OEM (non-PV) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cells to OEM (non-PV) as: Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","support":[{"end":11511,"quote":"Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":11393}],"target_id":"concept.eia.cells-to-oem-non-pv","target_kind":"node","target_sha256":"d6772f00c562378c2497a3295860032e4bdece2bf1edd836a1a58c69f05b56b2"}],"concept.eia.central-chiller":[{"id":"assertion.concept.eia.central-chiller","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central chiller as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central chiller as: Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","support":[{"end":15205,"quote":"Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":14695}],"target_id":"concept.eia.central-chiller","target_kind":"node","target_sha256":"afc52d45e2d32c26a23176579fedb745a289e5f3fcfdeff4cba8c8a8570ae193"}],"concept.eia.central-cooling":[{"id":"assertion.concept.eia.central-cooling","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central cooling as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central cooling as: Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","support":[{"end":15387,"quote":"Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15223}],"target_id":"concept.eia.central-cooling","target_kind":"node","target_sha256":"bdb9f1709e790ac3bc8386ca3144f937e6ea935cc504cfcb8c255ef85641b650"}],"concept.eia.central-physical-plant":[{"id":"assertion.concept.eia.central-physical-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central physical plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central physical plant as: A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","support":[{"end":15844,"quote":"A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15412}],"target_id":"concept.eia.central-physical-plant","target_kind":"node","target_sha256":"d3112041abbf3c65ce7391ab1fc1d9ad54801ec7b300cbdf8536b471fe94c45a"}],"concept.eia.central-warm-air-furnace":[{"id":"assertion.concept.eia.central-warm-air-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central warm air furnace as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central warm air furnace as: A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","support":[{"end":16461,"quote":"A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15871}],"target_id":"concept.eia.central-warm-air-furnace","target_kind":"node","target_sha256":"55d6968e861bfe1bb337cb868aff3eaf900ab436a7621e8055cd5282411b7fb6"}],"concept.eia.centralized-water-heating-system":[{"id":"assertion.concept.eia.centralized-water-heating-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Centralized water heating system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Centralized water heating system as: Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","support":[{"end":16743,"quote":"Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":16496}],"target_id":"concept.eia.centralized-water-heating-system","target_kind":"node","target_sha256":"94e3af785e6a5f6beb67607a3d4f3091c76a7ec520eecad587c44c5e4b96fccf"}],"concept.eia.chemical-separation":[{"id":"assertion.concept.eia.chemical-separation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Chemical separation as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Chemical separation as: A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","support":[{"end":18858,"quote":"A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":18639}],"target_id":"concept.eia.chemical-separation","target_kind":"node","target_sha256":"11a73e80a30eae9c05177efa100a30dfee0788487c22317c9a2f398bf5d7fafb"}],"concept.eia.christmas-tree":[{"id":"assertion.concept.eia.christmas-tree","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Christmas tree as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Christmas tree as: The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","support":[{"end":19206,"quote":"The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":19094}],"target_id":"concept.eia.christmas-tree","target_kind":"node","target_sha256":"b24094adee8ba76fa1442193bd91efa371629ff7702d9bc9256122b8ca012e4f"}],"concept.eia.circuit-mile":[{"id":"assertion.concept.eia.circuit-mile","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Circuit-mile as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Circuit-mile as: The total length in miles of separate circuits regardless of the number of conductors used per circuit.","support":[{"end":20238,"quote":"The total length in miles of separate circuits regardless of the number of conductors used per circuit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":20135}],"target_id":"concept.eia.circuit-mile","target_kind":"node","target_sha256":"199e61ea48546ca8bd4466e8294c76d71d393d9b939c1e7537c177829e9bdcb0"}],"concept.eia.clinker":[{"id":"assertion.concept.eia.clinker","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Clinker as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Clinker as: Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","support":[{"end":21687,"quote":"Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":21474}],"target_id":"concept.eia.clinker","target_kind":"node","target_sha256":"84f232c0b1d61d9cd01a17d9de2f6b002f3d08fd8c0e7be50028bfd3a69c5934"}],"concept.eia.coal":[{"id":"assertion.concept.eia.coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal as: A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","support":[{"end":22766,"quote":"A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":22417}],"target_id":"concept.eia.coal","target_kind":"node","target_sha256":"155ef5c9b7d48cabfb827d3e4d6359013631a05ed2ffc839b853ca9b1275b2cc"}],"concept.eia.coal-blending":[{"id":"assertion.concept.eia.coal-blending","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal Blending as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal Blending as: The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","support":[{"end":25225,"quote":"The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":25085}],"target_id":"concept.eia.coal-blending","target_kind":"node","target_sha256":"59a9c71494e5116e4e8dfff8082fbb8f34dee7ce1811a013002749af668aa6d2"}],"concept.eia.coal-briquets":[{"id":"assertion.concept.eia.coal-briquets","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal briquets as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal briquets as: Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","support":[{"end":25669,"quote":"Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":25241}],"target_id":"concept.eia.coal-briquets","target_kind":"node","target_sha256":"c56df13e2401887addbac84d8c6fa1fd586c83066ac32c7e348c3d5dadff02c9"}],"concept.eia.coal-gasification":[{"id":"assertion.concept.eia.coal-gasification","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal gasification as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal gasification as: The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","support":[{"end":28847,"quote":"The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":28517}],"target_id":"concept.eia.coal-gasification","target_kind":"node","target_sha256":"0076192bc059fc964b737b880e1a0afbdf09028a2d0ef596bc0ad0a659a83c2c"}],"concept.eia.coal-liquefaction":[{"id":"assertion.concept.eia.coal-liquefaction","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal liquefaction as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal liquefaction as: A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","support":[{"end":31110,"quote":"A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":30991}],"target_id":"concept.eia.coal-liquefaction","target_kind":"node","target_sha256":"eb55eb960004a633aea53885871756072ebcd0e5489d154b3d68adf6027d2ce7"}],"concept.eia.coal-mine":[{"id":"assertion.concept.eia.coal-mine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal mine as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","support":[{"end":31416,"quote":"An industrial operation for extracting coal from the ground.  Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":31122}],"target_id":"concept.eia.coal-mine","target_kind":"node","target_sha256":"1fcaea0f0c0088b124048648011af72b1e98895549783d88278a356c6d15cab8"}],"concept.eia.coal-synfuel":[{"id":"assertion.concept.eia.coal-synfuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal synfuel as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal synfuel as: Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","support":[{"end":37728,"quote":"Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":37525}],"target_id":"concept.eia.coal-synfuel","target_kind":"node","target_sha256":"8f8e7a38a8f683f4cb7b32aa74abe6075fd6fe2d064f0f5b5e3a87ed481f6bbc"}],"concept.eia.coalbed-methane-well-gas":[{"id":"assertion.concept.eia.coalbed-methane-well-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coalbed Methane Well Gas as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coalbed Methane Well Gas as: Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","support":[{"end":42889,"quote":"Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":42734}],"target_id":"concept.eia.coalbed-methane-well-gas","target_kind":"node","target_sha256":"14e774573b1f79ebde676bd1621d1d6d98702570fa5b06bcc1d2a222da0ad119"}],"concept.eia.cofiring":[{"id":"assertion.concept.eia.cofiring","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cofiring as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cofiring as: The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","support":[{"end":43310,"quote":"The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":43217}],"target_id":"concept.eia.cofiring","target_kind":"node","target_sha256":"ab2adbd81e38e679c40ebb6050c4bca09281246e13aadce3af853812fc4c098f"}],"concept.eia.cogeneration-system":[{"id":"assertion.concept.eia.cogeneration-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cogeneration system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cogeneration system as: A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","support":[{"end":43609,"quote":"A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":43478}],"target_id":"concept.eia.cogeneration-system","target_kind":"node","target_sha256":"990ac22ea5e2d78bf615990902b0070fbefff7b50e2696fdeaad44931a1ff470"}],"concept.eia.coke-battery":[{"id":"assertion.concept.eia.coke-battery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke Battery as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke Battery as: A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","support":[{"end":45258,"quote":"A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":45169}],"target_id":"concept.eia.coke-battery","target_kind":"node","target_sha256":"6ca328477c66b07e8413481b7ccec267cca4bb1efa21ce4240a540a10c9c3640"}],"concept.eia.coke-coal":[{"id":"assertion.concept.eia.coke-coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke (coal) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke (coal) as: A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","support":[{"end":44860,"quote":"A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":44414}],"target_id":"concept.eia.coke-coal","target_kind":"node","target_sha256":"2c3fa61e749cc93e4b9de07df09ffdb0ecfc6a4dab58e787eda699b548f79949"}],"concept.eia.coke-oven":[{"id":"assertion.concept.eia.coke-oven","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke Oven as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke Oven as: A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar. The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke. Coke is primarily used in steel production. There are two types of coke ovens: (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles. During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","support":[{"end":46479,"quote":"A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar.  The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke.  Coke is primarily used in steel production.  There are two types of coke ovens:  (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles.  During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":45645}],"target_id":"concept.eia.coke-oven","target_kind":"node","target_sha256":"585ab97ff8a970941ff210d2d6f74b89b859638233d4c356a9f354f6a17892ff"}],"concept.eia.combined-cycle":[{"id":"assertion.concept.eia.combined-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined cycle as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined cycle as: An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","support":[{"end":48447,"quote":"An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":48068}],"target_id":"concept.eia.combined-cycle","target_kind":"node","target_sha256":"3c390b65dd196e100b03a868af5771b83df1146b078c609fe6065e09d707a815"}],"concept.eia.combined-cycle-unit":[{"id":"assertion.concept.eia.combined-cycle-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined cycle unit as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined cycle unit as: An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","support":[{"end":48688,"quote":"An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":48469}],"target_id":"concept.eia.combined-cycle-unit","target_kind":"node","target_sha256":"78a499eb253e349c9d68326a6899bba2cb9395c65ee514d3a95b54190a4aba44"}],"concept.eia.combined-heat-and-power-chp-plant":[{"id":"assertion.concept.eia.combined-heat-and-power-chp-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined-heat-and-power (CHP) plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined-heat-and-power (CHP) plant as: A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","support":[{"end":50187,"quote":"A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49750}],"target_id":"concept.eia.combined-heat-and-power-chp-plant","target_kind":"node","target_sha256":"bb17846adb013b7f84a3e738c26ddb72e89a333ea38710d92e70a79862bbf198"}],"concept.eia.combined-hydroelectric-plant":[{"id":"assertion.concept.eia.combined-hydroelectric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined hydroelectric plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined hydroelectric plant as: A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","support":[{"end":49562,"quote":"A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49461}],"target_id":"concept.eia.combined-hydroelectric-plant","target_kind":"node","target_sha256":"a5743f869523f74b165a36f8b5e0d87b3be958b791497f56b417c992f52b4cba"}],"concept.eia.combined-pumped-storage-plant":[{"id":"assertion.concept.eia.combined-pumped-storage-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined pumped-storage plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined pumped-storage plant as: A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","support":[{"end":49712,"quote":"A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49594}],"target_id":"concept.eia.combined-pumped-storage-plant","target_kind":"node","target_sha256":"9043711c2a894163ec92b01be8540a6e32ffcbebe6845339596e0e2381907402"}],"concept.eia.combustion-chamber":[{"id":"assertion.concept.eia.combustion-chamber","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combustion chamber as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combustion chamber as: An enclosed vessel in which chemical oxidation of fuel occurs.","support":[{"end":50350,"quote":"An enclosed vessel in which chemical oxidation of fuel occurs.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50288}],"target_id":"concept.eia.combustion-chamber","target_kind":"node","target_sha256":"f73756054d4831bc869a16f3bc4fc64545d54e59757f2160264708bb82caae75"}],"concept.eia.commercial-facility":[{"id":"assertion.concept.eia.commercial-facility","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Commercial facility as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Commercial facility as: An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","support":[{"end":50964,"quote":"An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50723}],"target_id":"concept.eia.commercial-facility","target_kind":"node","target_sha256":"10c55754d79be15af39858700a959192361eac1e3b259bcb430c96e2127369ad"}],"concept.eia.commercial-operation-nuclear":[{"id":"assertion.concept.eia.commercial-operation-nuclear","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Commercial operation (nuclear) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Commercial operation (nuclear) as: The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","support":[{"end":51318,"quote":"The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50997}],"target_id":"concept.eia.commercial-operation-nuclear","target_kind":"node","target_sha256":"8b71ea3f4d9f6909645682d8165a9438ffe08776c39e13ab4846b922e38b923a"}],"concept.eia.completion-oil-gas-production":[{"id":"assertion.concept.eia.completion-oil-gas-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Completion (oil/gas production) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Completion (oil/gas production) as: The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","support":[{"end":56506,"quote":"The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":56067}],"target_id":"concept.eia.completion-oil-gas-production","target_kind":"node","target_sha256":"2387b1e23b0b3261592c6122c89867d24267d88a78e65a03420a31c0334223b1"}],"concept.eia.compressor-station":[{"id":"assertion.concept.eia.compressor-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Compressor station as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Compressor station as: Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","support":[{"end":57460,"quote":"Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57314}],"target_id":"concept.eia.compressor-station","target_kind":"node","target_sha256":"6124e72d70e435f3a7979dfc731dbb5ad5fbd9299fc3b6849b718f4bdb71c34f"}],"concept.eia.concentrating-solar-power-or-solar-thermal-power-system":[{"id":"assertion.concept.eia.concentrating-solar-power-or-solar-thermal-power-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Concentrating solar power or solar thermal power system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Concentrating solar power or solar thermal power system as: A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","support":[{"end":57696,"quote":"A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57518}],"target_id":"concept.eia.concentrating-solar-power-or-solar-thermal-power-system","target_kind":"node","target_sha256":"24a458639df93731f27d81ad957a0b598ff39bda10af86c5edd49280aca4df7d"}],"concept.eia.concentrator":[{"id":"assertion.concept.eia.concentrator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Concentrator as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Concentrator as: A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","support":[{"end":58113,"quote":"A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57926}],"target_id":"concept.eia.concentrator","target_kind":"node","target_sha256":"9d54b7aa0a73e745e1a9f99efa3789ccd1113ee0231c7a88a3d2786e86e9e96b"}],"concept.eia.condenser-cooling-water":[{"id":"assertion.concept.eia.condenser-cooling-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Condenser cooling water as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Condenser cooling water as: A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","support":[{"end":59195,"quote":"A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":58876}],"target_id":"concept.eia.condenser-cooling-water","target_kind":"node","target_sha256":"2cbbe7ff2453c83bbc9e54b4edb69cbb3606dfe12665f8479db9807f7547da02"}],"concept.eia.conductor":[{"id":"assertion.concept.eia.conductor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conductor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conductor as: Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","support":[{"end":59528,"quote":"Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":59363}],"target_id":"concept.eia.conductor","target_kind":"node","target_sha256":"8edb1464ca2c439ee43251c108c29e40bec73e03cf0ba2e6097929e22c5ee7ca"}],"concept.eia.construction-pipeline-of-a-nuclear-reactor":[{"id":"assertion.concept.eia.construction-pipeline-of-a-nuclear-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Construction pipeline (of a nuclear reactor) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Construction pipeline (of a nuclear reactor) as: The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","support":[{"end":63398,"quote":"The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":62993}],"target_id":"concept.eia.construction-pipeline-of-a-nuclear-reactor","target_kind":"node","target_sha256":"8bfbb588a42a5e0e283b7f0cb1a42bd16987ce333c8f666306b101cb527f18d4"}],"concept.eia.construction-work-in-progress-cwip":[{"id":"assertion.concept.eia.construction-work-in-progress-cwip","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Construction work in progress (CWIP) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Construction work in progress (CWIP) as: The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","support":[{"end":63606,"quote":"The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":63437}],"target_id":"concept.eia.construction-work-in-progress-cwip","target_kind":"node","target_sha256":"b12891c1ca3569376f7024f778e81044b4010ada523e71832ac99f514a7c5b80"}],"concept.eia.continuous-mining":[{"id":"assertion.concept.eia.continuous-mining","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Continuous mining as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Continuous mining as: A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","support":[{"end":65686,"quote":"A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":65530}],"target_id":"concept.eia.continuous-mining","target_kind":"node","target_sha256":"c556658ee9aee9bf2bcc24b0ac6efbbf3a6b666ce75a909872b23545b4bff224"}],"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob":[{"id":"assertion.concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional blendstock for oxygenate blending (CBOB) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional blendstock for oxygenate blending (CBOB) as: Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","support":[{"end":67785,"quote":"Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":67664}],"target_id":"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","target_kind":"node","target_sha256":"a2879ce9f59bea528771cc9cf8d666112753dd9cb8207af6f85c084b99a19cf8"}],"concept.eia.conventional-fuel-ethanol":[{"id":"assertion.concept.eia.conventional-fuel-ethanol","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional fuel ethanol as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional fuel ethanol as: Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","support":[{"end":67933,"quote":"Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":67813}],"target_id":"concept.eia.conventional-fuel-ethanol","target_kind":"node","target_sha256":"d6e3ef75c40c370aea721b271df7bfab1178c25bfc7016947a2ec82786e3a4e3"}],"concept.eia.conventional-gasoline":[{"id":"assertion.concept.eia.conventional-gasoline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional gasoline as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional gasoline as: Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","support":[{"end":68426,"quote":"Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68214}],"target_id":"concept.eia.conventional-gasoline","target_kind":"node","target_sha256":"7ab7828320f84b741010fe4ca48b655a371c6315b8c40d56c30a7fa6f4a4b1ab"}],"concept.eia.conventional-hydroelectric-plant":[{"id":"assertion.concept.eia.conventional-hydroelectric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional hydroelectric plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional hydroelectric plant as: A plant in which all of the power is produced from natural streamflow as regulated by available storage.","support":[{"end":68565,"quote":"A plant in which all of the power is produced from natural streamflow as regulated by available storage.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68461}],"target_id":"concept.eia.conventional-hydroelectric-plant","target_kind":"node","target_sha256":"3e4fd2fa8e0b497474415eb6d1423f3419915f116303c6cf10f1e3cdf54a1ea4"}],"concept.eia.conventional-mill-uranium":[{"id":"assertion.concept.eia.conventional-mill-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional mill (uranium) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional mill (uranium) as: A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","support":[{"end":68843,"quote":"A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68595}],"target_id":"concept.eia.conventional-mill-uranium","target_kind":"node","target_sha256":"24a2086edac2accad7f3098044148655e74f8561c97797be379d08b038ce2eaa"}],"concept.eia.conventional-oil-and-natural-gas-production":[{"id":"assertion.concept.eia.conventional-oil-and-natural-gas-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional oil and natural gas production as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional oil and natural gas production as: Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","support":[{"end":69329,"quote":"Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69130}],"target_id":"concept.eia.conventional-oil-and-natural-gas-production","target_kind":"node","target_sha256":"bd42f7ff3d869be75a95a82ee3ed028522eaba7093298c6255798fb24d020b12"}],"concept.eia.conversion-factor":[{"id":"assertion.concept.eia.conversion-factor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conversion factor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conversion factor as: A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons). (See","support":[{"end":69608,"quote":"A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons).  (See","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69442}],"target_id":"concept.eia.conversion-factor","target_kind":"node","target_sha256":"1c44638b9a39ff42eb372024b8ddc5cf290d3a3ca55fa2ba110757075c8bed78"}],"concept.eia.converted-alternative-fuel-vehicle":[{"id":"assertion.concept.eia.converted-alternative-fuel-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Converted (alternative-fuel) vehicle as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Converted (alternative-fuel) vehicle as: A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","support":[{"end":69969,"quote":"A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69808}],"target_id":"concept.eia.converted-alternative-fuel-vehicle","target_kind":"node","target_sha256":"1cfee0a8da7bddba23433a68147e272ff541d7edbb8c2fdd221dc48583dfdd4d"}],"concept.eia.cooling-system":[{"id":"assertion.concept.eia.cooling-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cooling system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cooling system as: An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","support":[{"end":71132,"quote":"An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":70990}],"target_id":"concept.eia.cooling-system","target_kind":"node","target_sha256":"bf8b7011c871b4563060381cac24507048fa657e42e7cb786b9a99dabdb2a311"}],"concept.eia.crude-oil-input":[{"id":"assertion.concept.eia.crude-oil-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil input as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil input as: The total crude oil put into processing units at refineries.","support":[{"end":79677,"quote":"The total crude oil put into processing units at refineries.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":79617}],"target_id":"concept.eia.crude-oil-input","target_kind":"node","target_sha256":"9c01882767ad583a85a4d8ebf869c31e5ee5a093c157de9f1fe77b070014af4f"}],"concept.eia.crude-oil-qualities":[{"id":"assertion.concept.eia.crude-oil-qualities","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil qualities as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil qualities as: Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","support":[{"end":81738,"quote":"Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":81599}],"target_id":"concept.eia.crude-oil-qualities","target_kind":"node","target_sha256":"25ad6b4650725091905c5768aad1c142fe991ba303fab2f21954cea87d376134"}],"concept.eia.crude-oil-refinery-input":[{"id":"assertion.concept.eia.crude-oil-refinery-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil refinery input as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil refinery input as: The total crude oil put into processing units at refineries.","support":[{"end":81825,"quote":"The total crude oil put into processing units at refineries.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":81765}],"target_id":"concept.eia.crude-oil-refinery-input","target_kind":"node","target_sha256":"8a9cfd21b2ebab05f507feb5ee91ab92b08a81f25781a334a7c108cb6a6ca289"}],"concept.eia.current-electric":[{"id":"assertion.concept.eia.current-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Current (electric) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Current (electric) as: A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","support":[{"end":83989,"quote":"A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":83866}],"target_id":"concept.eia.current-electric","target_kind":"node","target_sha256":"afe580b24ccfe14f4920caefee00749255517d5158598b14c4ad080b4a8a6e63"}],"concept.eia.cycle-reactor-history":[{"id":"assertion.concept.eia.cycle-reactor-history","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cycle/reactor history as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cycle/reactor history as: A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","support":[{"end":86648,"quote":"A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":86504}],"target_id":"concept.eia.cycle-reactor-history","target_kind":"node","target_sha256":"c7541297964b1a088aaff1c7012da62e7ffa6d2f6e102b96b0b1a839197130a2"}],"concept.eia.daylighting-controls":[{"id":"assertion.concept.eia.daylighting-controls","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Daylighting controls as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Daylighting controls as: A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","support":[{"end":1424,"quote":"A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":1232}],"target_id":"concept.eia.daylighting-controls","target_kind":"node","target_sha256":"8fb46c59a6bfa970290a6eaeb7ec644ed54016fc94b36ed7b443721c855aec10"}],"concept.eia.decontamination":[{"id":"assertion.concept.eia.decontamination","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Decontamination as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Decontamination as: Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","support":[{"end":1927,"quote":"Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":1832}],"target_id":"concept.eia.decontamination","target_kind":"node","target_sha256":"577ec7b89aed6c37e11c63253f3eb2d9c834944c60d435411ffdbd33f4f3ab32"}],"concept.eia.dedicated-vehicle":[{"id":"assertion.concept.eia.dedicated-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dedicated vehicle as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dedicated vehicle as: A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","support":[{"end":3086,"quote":"A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":2884}],"target_id":"concept.eia.dedicated-vehicle","target_kind":"node","target_sha256":"006c85a1704186d4724cda60a4c95c9055eca271b86f710f8337e7194b963a55"}],"concept.eia.deepest-total-depth":[{"id":"assertion.concept.eia.deepest-total-depth","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Deepest total depth as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Deepest total depth as: The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","support":[{"end":3419,"quote":"The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":3108}],"target_id":"concept.eia.deepest-total-depth","target_kind":"node","target_sha256":"d340bb007b7536dfa762d3f2e27a3d806718e96da9be884fc9f47ea5c6de0dba"}],"concept.eia.degasification-system":[{"id":"assertion.concept.eia.degasification-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Degasification system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Degasification system as: The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","support":[{"end":4381,"quote":"The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":4130}],"target_id":"concept.eia.degasification-system","target_kind":"node","target_sha256":"56b9b72b48260772958737252edede5c3cef115492ebdbe0135a87f4a7791e4a"}],"concept.eia.delayed-coking":[{"id":"assertion.concept.eia.delayed-coking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Delayed coking as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Delayed coking as: A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","support":[{"end":5057,"quote":"A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":4664}],"target_id":"concept.eia.delayed-coking","target_kind":"node","target_sha256":"e6dd26c04bf7f16533ad7e79d2bad403f29806befab207f48af79d1a6d5cfb63"}],"concept.eia.deliveries-electric":[{"id":"assertion.concept.eia.deliveries-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Deliveries (electric) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Deliveries (electric) as: Energy generated by one system and delivered to another system through one or more transmission lines.","support":[{"end":6604,"quote":"Energy generated by one system and delivered to another system through one or more transmission lines.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":6502}],"target_id":"concept.eia.deliveries-electric","target_kind":"node","target_sha256":"577577c288f57651a1ca304cfaaae16f0e68d12f16fcdc81839ed0f57d6df5a0"}],"concept.eia.denaturant":[{"id":"assertion.concept.eia.denaturant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Denaturant as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Denaturant as: Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption. Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant. See","support":[{"end":11763,"quote":"Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption.  Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant.  See","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":11493}],"target_id":"concept.eia.denaturant","target_kind":"node","target_sha256":"e1893a27f4c718a16a2d58baa9d7b895760ab72cd2f68d636b555188c4cfd537"}],"concept.eia.denatured":[{"id":"assertion.concept.eia.denatured","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Denatured as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Denatured as: Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","support":[{"end":12107,"quote":"Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":11827}],"target_id":"concept.eia.denatured","target_kind":"node","target_sha256":"2f1f7b86b5e4b4907612e8b58d4bd1a98f88e0783a9ef8485440bffbe7d3d7cc"}],"concept.eia.dependable-capacity":[{"id":"assertion.concept.eia.dependable-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dependable capacity as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dependable capacity as: The load-carrying ability of a station or system under adverse conditions for a specified period of time.","support":[{"end":12511,"quote":"The load-carrying ability of a station or system under adverse conditions for a specified period of time.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":12406}],"target_id":"concept.eia.dependable-capacity","target_kind":"node","target_sha256":"fba210c6cbd96952ca5e055cb3c1b2bdb31f38f7c69bb6c719fa51fdc29458b9"}],"concept.eia.depleted-storage-field":[{"id":"assertion.concept.eia.depleted-storage-field","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Depleted storage field as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Depleted storage field as: A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","support":[{"end":12799,"quote":"A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":12689}],"target_id":"concept.eia.depleted-storage-field","target_kind":"node","target_sha256":"ac20710849e90ce4a825f69efd47791687e64eaaf4e5946a64f0810b10ad65ad"}],"concept.eia.depth-of-deepest-production":[{"id":"assertion.concept.eia.depth-of-deepest-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Depth of deepest production as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Depth of deepest production as: The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","support":[{"end":15628,"quote":"The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":15417}],"target_id":"concept.eia.depth-of-deepest-production","target_kind":"node","target_sha256":"c233f99061daececa0c34c9a9e07d8942afd5c84fac67ba2f664a7380a919da9"}],"concept.eia.design-electrical-rating-capacity-net":[{"id":"assertion.concept.eia.design-electrical-rating-capacity-net","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Design electrical rating (capacity) net as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Design electrical rating (capacity) net as: The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","support":[{"end":16447,"quote":"The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":16334}],"target_id":"concept.eia.design-electrical-rating-capacity-net","target_kind":"node","target_sha256":"58a67c8f17d5ad3e0da337c2871c12df90e5c8fc8d8ba572032772b774fbbec8"}],"concept.eia.design-head":[{"id":"assertion.concept.eia.design-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Design head as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Design head as: The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","support":[{"end":16709,"quote":"The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":16461}],"target_id":"concept.eia.design-head","target_kind":"node","target_sha256":"2d9a8c674faf2618e3625d871b7e906bb9fa444d45d7c03ba64a4ab32dee0898"}],"concept.eia.development-well":[{"id":"assertion.concept.eia.development-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Development well as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Development well as: A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","support":[{"end":19013,"quote":"A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":18870}],"target_id":"concept.eia.development-well","target_kind":"node","target_sha256":"03b14ab04f8531ea18316de284bb592f9f93c5217904a98788239759622d9417"}],"concept.eia.diesel-electric-plant":[{"id":"assertion.concept.eia.diesel-electric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel-electric plant as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel-electric plant as: A generating station that uses diesel engines to drive its electric generators.","support":[{"end":19917,"quote":"A generating station that uses diesel engines to drive its electric generators.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19838}],"target_id":"concept.eia.diesel-electric-plant","target_kind":"node","target_sha256":"ef9dfa68ff90a46d527453edbf8fc7c4844ea333de34d1ab891f13db6a2b9043"}],"concept.eia.diesel-fuel":[{"id":"assertion.concept.eia.diesel-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel fuel as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel fuel as: A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","support":[{"end":19256,"quote":"A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19027}],"target_id":"concept.eia.diesel-fuel","target_kind":"node","target_sha256":"fd042d0e1c693913a30dea3838621cf402c52e6f3d815fc4879a1449f49f8c2d"}],"concept.eia.diesel-fuel-system":[{"id":"assertion.concept.eia.diesel-fuel-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel fuel system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel fuel system as: Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","support":[{"end":19814,"quote":"Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19277}],"target_id":"concept.eia.diesel-fuel-system","target_kind":"node","target_sha256":"d069ff3b3bfade25240523e26274537a221b7c599a892456a4999b72bcfa827e"}],"concept.eia.diffusive-transport":[{"id":"assertion.concept.eia.diffusive-transport","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diffusive transport as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diffusive transport as: The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","support":[{"end":20066,"quote":"The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19939}],"target_id":"concept.eia.diffusive-transport","target_kind":"node","target_sha256":"5098c7703cef6c08f6b863b00d8f2284426c3eca166c45e35e31b00121845fe6"}],"concept.eia.direct-electricity-load-control":[{"id":"assertion.concept.eia.direct-electricity-load-control","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Direct electricity load control as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Direct electricity load control as: The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","support":[{"end":21455,"quote":"The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":21190}],"target_id":"concept.eia.direct-electricity-load-control","target_kind":"node","target_sha256":"a9e521ce5b33c9b16226f2145582639f853c49ee3aa3c99af4909d5552ae9075"}],"concept.eia.direct-load-control":[{"id":"assertion.concept.eia.direct-load-control","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Direct load control as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Direct load control as: This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","support":[{"end":22111,"quote":"This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":21822}],"target_id":"concept.eia.direct-load-control","target_kind":"node","target_sha256":"bdc9260fea63c70fb56a3a3a690e5983da109fb2813a7e1d259b73959905657d"}],"concept.eia.directional-deviated-well":[{"id":"assertion.concept.eia.directional-deviated-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Directional (deviated) well as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Directional (deviated) well as: A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","support":[{"end":24287,"quote":"A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":24140}],"target_id":"concept.eia.directional-deviated-well","target_kind":"node","target_sha256":"5854bdf0cb5bc7016056886b4bff3b9317b97a7dad4d941e4d8450c3a9111f70"}],"concept.eia.discharged-fuel":[{"id":"assertion.concept.eia.discharged-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Discharged fuel as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Discharged fuel as: Irradiated fuel removed from a nuclear reactor during refueling. Also see","support":[{"end":24378,"quote":"Irradiated fuel removed from a nuclear reactor during refueling. Also see","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":24305}],"target_id":"concept.eia.discharged-fuel","target_kind":"node","target_sha256":"dfb1c4fc60939f074c679596711c21be4589bec29f91b532d10b746494a998a2"}],"concept.eia.distillate-fuel-oil":[{"id":"assertion.concept.eia.distillate-fuel-oil","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distillate fuel oil as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distillate fuel oil as: A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","support":[{"end":26288,"quote":"A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":25787}],"target_id":"concept.eia.distillate-fuel-oil","target_kind":"node","target_sha256":"9eec1eb933b4cb42fdcff424d270d03d188d1d9c223900d3c64b73f4abb892b2"}],"concept.eia.distillation-unit-atmospheric":[{"id":"assertion.concept.eia.distillation-unit-atmospheric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distillation unit (atmospheric) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distillation unit (atmospheric) as: The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","support":[{"end":29097,"quote":"The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":28525}],"target_id":"concept.eia.distillation-unit-atmospheric","target_kind":"node","target_sha256":"80d22028913c817f4cf27a0d788576d62bae19b0ca55ab15333f45cabc335eae"}],"concept.eia.distributed-generator":[{"id":"assertion.concept.eia.distributed-generator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distributed generator as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distributed generator as: A generator that is located close to the particular load that it is intended to serve. General, but non-exclusive, characteristics of these generators include: an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","support":[{"end":29418,"quote":"A generator that is located close to the particular load that it is intended to serve.  General, but non-exclusive, characteristics of these generators include:  an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":29121}],"target_id":"concept.eia.distributed-generator","target_kind":"node","target_sha256":"2f145b960644235f38930e5dcca6b7119aed2eb6608bed9ba79ea55495b57f4e"}],"concept.eia.distributed-point-of-use-water-heating-system":[{"id":"assertion.concept.eia.distributed-point-of-use-water-heating-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distributed/point-of-use water-heating system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distributed/point-of-use water-heating system as: A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","support":[{"end":29791,"quote":"A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":29466}],"target_id":"concept.eia.distributed-point-of-use-water-heating-system","target_kind":"node","target_sha256":"a78baf07a6a64b2bc236ae0db9eb7ae978012dc622bb8d34339dbf927b29f5a6"}],"concept.eia.distribution-system":[{"id":"assertion.concept.eia.distribution-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distribution system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distribution system as: The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","support":[{"end":30415,"quote":"The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":30283}],"target_id":"concept.eia.distribution-system","target_kind":"node","target_sha256":"6c19b03e55fec31d38e3da5d81a162d870efe469c083b54c0256e9ffab81ff5d"}],"concept.eia.district-chilled-water":[{"id":"assertion.concept.eia.district-chilled-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District chilled water as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District chilled water as: Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","support":[{"end":31028,"quote":"Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":30665}],"target_id":"concept.eia.district-chilled-water","target_kind":"node","target_sha256":"d4c5d67e4c574ee7473cd92eb236959a86c5937cbfc7b042994ca99a4b7786e7"}],"concept.eia.district-energy":[{"id":"assertion.concept.eia.district-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District energy as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District energy as: Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","support":[{"end":31411,"quote":"Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":31046}],"target_id":"concept.eia.district-energy","target_kind":"node","target_sha256":"47018d8fec36dccec4e157f9daf1ed5c73d540a043fb3dea3bb97ea04d673a7c"}],"concept.eia.district-heat":[{"id":"assertion.concept.eia.district-heat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District heat as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District heat as: Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","support":[{"end":31779,"quote":"Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":31427}],"target_id":"concept.eia.district-heat","target_kind":"node","target_sha256":"98e40d641b141dc069f744339a8c227c9c791ab279d4dcb7d695c20253d9f4f3"}],"concept.eia.double-circuit-line":[{"id":"assertion.concept.eia.double-circuit-line","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Double circuit line as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Double circuit line as: A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","support":[{"end":34545,"quote":"A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":34398}],"target_id":"concept.eia.double-circuit-line","target_kind":"node","target_sha256":"73a9a35e8e8f6975ecc70eb240cba35067ce408932f2a1bb0efa520aedd3dafd"}],"concept.eia.dry-bottom-boiler":[{"id":"assertion.concept.eia.dry-bottom-boiler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dry bottom boiler as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dry bottom boiler as: No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","support":[{"end":37208,"quote":"No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":36916}],"target_id":"concept.eia.dry-bottom-boiler","target_kind":"node","target_sha256":"afad8f75dd5ad4d5816e4d480a9ecf412fad94672a1746b67b0e845844506907"}],"concept.eia.dry-hole":[{"id":"assertion.concept.eia.dry-hole","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dry hole as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dry hole as: An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","support":[{"end":37416,"quote":"An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":37250}],"target_id":"concept.eia.dry-hole","target_kind":"node","target_sha256":"2610b895cf7da92d3073c53d2ab030216744cd21bc5d8cbea5458da1471b1e94"}],"concept.eia.dual-fired-unit":[{"id":"assertion.concept.eia.dual-fired-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual-fired unit as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual-fired unit as: A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","support":[{"end":40042,"quote":"A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39816}],"target_id":"concept.eia.dual-fired-unit","target_kind":"node","target_sha256":"1616b694e37abf0cc58222b5667cb49b36a335a7389d8fd089568d2f6ce32fc3"}],"concept.eia.dual-fuel-vehicle-1":[{"id":"assertion.concept.eia.dual-fuel-vehicle-1","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual fuel vehicle (1) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (1) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","support":[{"end":39416,"quote":"A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39188}],"target_id":"concept.eia.dual-fuel-vehicle-1","target_kind":"node","target_sha256":"c5b4a789ab4f9dcda3e520762014fe8c168a52d61313358420dc42f0975240f8"}],"concept.eia.dual-fuel-vehicle-2":[{"id":"assertion.concept.eia.dual-fuel-vehicle-2","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual fuel vehicle (2) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (2) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","support":[{"end":39798,"quote":"A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39440}],"target_id":"concept.eia.dual-fuel-vehicle-2","target_kind":"node","target_sha256":"88ec665e538ef6d46dfd944b381290b2d6a43bf02d8940456448383492894ef2"}],"concept.eia.dump-energy":[{"id":"assertion.concept.eia.dump-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dump energy as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dump energy as: Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","support":[{"end":40220,"quote":"Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":40056}],"target_id":"concept.eia.dump-energy","target_kind":"node","target_sha256":"24556c8d2b177ee87fd5bb3c146fe2579c01dbd16b7f18713b01ad0fbcc10cef"}],"concept.eia.electric-energy":[{"id":"assertion.concept.eia.electric-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric energy as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","support":[{"end":2301,"quote":"The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":2178}],"target_id":"concept.eia.electric-energy","target_kind":"node","target_sha256":"5066fdb13b383ce99884d20cea17e3b6f126e71e1a809676732c742d57a835b2"}],"concept.eia.electric-plant-physical":[{"id":"assertion.concept.eia.electric-plant-physical","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric plant (physical) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric plant (physical) as: A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","support":[{"end":4618,"quote":"A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":4457}],"target_id":"concept.eia.electric-plant-physical","target_kind":"node","target_sha256":"847a37abbb73109ce76e9c6bebb4ab8e39d9a8a43f8a78cfe77ac8d317f57a34"}],"concept.eia.electric-power-plant":[{"id":"assertion.concept.eia.electric-power-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric power plant as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric power plant as: A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","support":[{"end":6115,"quote":"A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":5955}],"target_id":"concept.eia.electric-power-plant","target_kind":"node","target_sha256":"78fb2ffe662c3358891945c1174e27fbc8767fc8f0e7d78e50df0b0993eb1647"}],"concept.eia.electric-pump-for-well-water":[{"id":"assertion.concept.eia.electric-pump-for-well-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric pump for well water as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric pump for well water as: This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","support":[{"end":7145,"quote":"This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":6942}],"target_id":"concept.eia.electric-pump-for-well-water","target_kind":"node","target_sha256":"6304e1e9883b03fd57288c74a661e4efffd733e2f90b1a2ed6f63ef0c5c78321"}],"concept.eia.electric-system-loss":[{"id":"assertion.concept.eia.electric-system-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric system loss as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric system loss as: Total energy loss from all causes for an electric utility.","support":[{"end":7616,"quote":"Total energy loss from all causes for an electric utility.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":7558}],"target_id":"concept.eia.electric-system-loss","target_kind":"node","target_sha256":"f1561e47506bcc722465d26969c9f34f1400b81d9a72fe5ff68f75b1d4824c07"}],"concept.eia.electric-system-reliability":[{"id":"assertion.concept.eia.electric-system-reliability","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric system reliability as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric system reliability as: The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","support":[{"end":8351,"quote":"The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":7646}],"target_id":"concept.eia.electric-system-reliability","target_kind":"node","target_sha256":"685d33f4c150a9a3672ccbadd27b077840037bfe8b31b84c32d6812f833ca2c3"}],"concept.eia.electric-vehicle-ev":[{"id":"assertion.concept.eia.electric-vehicle-ev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric vehicle (EV) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric vehicle (EV) as: A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","support":[{"end":10547,"quote":"A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10174}],"target_id":"concept.eia.electric-vehicle-ev","target_kind":"node","target_sha256":"410bd2528fc2ab09b9042b0a8945aad7ab0035d00e7d59b72fe8db88c16b0f32"}],"concept.eia.electric-zone":[{"id":"assertion.concept.eia.electric-zone","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric zone as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric zone as: A portion of the grid controlled by the independent system operator.","support":[{"end":10631,"quote":"A portion of the grid controlled by the independent system operator.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10563}],"target_id":"concept.eia.electric-zone","target_kind":"node","target_sha256":"6ca3f8edd8e20bc6c43c1d989d6c2e93dc44f566b2bcb29a8f167fa4505645b4"}],"concept.eia.electrical-system-energy-losses":[{"id":"assertion.concept.eia.electrical-system-energy-losses","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electrical system energy losses as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electrical system energy losses as: The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","support":[{"end":10797,"quote":"The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10665}],"target_id":"concept.eia.electrical-system-energy-losses","target_kind":"node","target_sha256":"b0094f0d610ea7ff6a9d17e568d185c245bb9db589cb671d0368dde853df3c10"}],"concept.eia.electricity-generation":[{"id":"assertion.concept.eia.electricity-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electricity generation as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electricity generation as: The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","support":[{"end":11932,"quote":"The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":11746}],"target_id":"concept.eia.electricity-generation","target_kind":"node","target_sha256":"cafa06c47a033230297024e00ff500ac3bea87263dcd89036915a82f721e6442"}],"concept.eia.electricity-only-plant":[{"id":"assertion.concept.eia.electricity-only-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electricity-only plant as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electricity-only plant as: A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","support":[{"end":13023,"quote":"A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":12932}],"target_id":"concept.eia.electricity-only-plant","target_kind":"node","target_sha256":"69acdf5f48f69c0c374d47a860da20fa25fbd5e9c2617fe6b18142f30f474d9f"}],"concept.eia.elution":[{"id":"assertion.concept.eia.elution","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Elution as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Elution as: The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","support":[{"end":13522,"quote":"The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":13398}],"target_id":"concept.eia.elution","target_kind":"node","target_sha256":"b95cc1d6b34c2f49c63bc9db2d2851c5e888901c2d9aa644ec8992258f547932"}],"concept.eia.emissions-coefficient":[{"id":"assertion.concept.eia.emissions-coefficient","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Emissions coefficient as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Emissions coefficient as: A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","support":[{"end":14346,"quote":"A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":14157}],"target_id":"concept.eia.emissions-coefficient","target_kind":"node","target_sha256":"b4a07b23eb49aab721796219f2480c29550b8510718a99eb99e94ba67bb94ff2"}],"concept.eia.energy-consumption":[{"id":"assertion.concept.eia.energy-consumption","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy consumption as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","support":[{"end":17489,"quote":"The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":17388}],"target_id":"concept.eia.energy-consumption","target_kind":"node","target_sha256":"827a3353edcebd277d319675584eb9ba48b95c5b97e5000b8971b274bacb9edb"}],"concept.eia.energy-deliveries":[{"id":"assertion.concept.eia.energy-deliveries","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy deliveries as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy deliveries as: Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","support":[{"end":17628,"quote":"Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":17509}],"target_id":"concept.eia.energy-deliveries","target_kind":"node","target_sha256":"522a04103818791f86296bcbba5158567e0f869fb8d0302c195c0318192afa21"}],"concept.eia.energy-management-and-control-system-emcs":[{"id":"assertion.concept.eia.energy-management-and-control-system-emcs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy management and control system(EMCS) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy management and control system(EMCS) as: An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","support":[{"end":22745,"quote":"An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":22394}],"target_id":"concept.eia.energy-management-and-control-system-emcs","target_kind":"node","target_sha256":"2c796b54b4be1bb8b897da6575837772a6da07ae9df88baf6198dca76047b53a"}],"concept.eia.engine-size":[{"id":"assertion.concept.eia.engine-size","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Engine size as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Engine size as: The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","support":[{"end":26723,"quote":"The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":26419}],"target_id":"concept.eia.engine-size","target_kind":"node","target_sha256":"e203ecf910962fd02ee7e2de051d20088fe187559f54635c1f4facd2c587ff65"}],"concept.eia.enrichment-tails-assay":[{"id":"assertion.concept.eia.enrichment-tails-assay","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Enrichment tails assay as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Enrichment tails assay as: A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","support":[{"end":27874,"quote":"A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":27162}],"target_id":"concept.eia.enrichment-tails-assay","target_kind":"node","target_sha256":"db51942b1b23b1568d1b4a77f1dbfd17ab8fa0b8fb98de35f47ceda1495a535a"}],"concept.eia.environmental-restoration":[{"id":"assertion.concept.eia.environmental-restoration","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Environmental restoration as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Environmental restoration as: Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","support":[{"end":29082,"quote":"Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":28771}],"target_id":"concept.eia.environmental-restoration","target_kind":"node","target_sha256":"3e0739ecc10f08689b7ed975c9d5233b69407e50b830a88d8a83acdba5048d67"}],"concept.eia.epa-certification":[{"id":"assertion.concept.eia.epa-certification","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"EPA certification as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines EPA certification as: A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","support":[{"end":29640,"quote":"A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":29472}],"target_id":"concept.eia.epa-certification","target_kind":"node","target_sha256":"cb121e7a9fcfb0ef2473cf99877b1455c88dd697d06f7ad8a9538e5499b5e489"}],"concept.eia.equilibrium-cycle":[{"id":"assertion.concept.eia.equilibrium-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Equilibrium cycle as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Equilibrium cycle as: An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","support":[{"end":30072,"quote":"An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":29871}],"target_id":"concept.eia.equilibrium-cycle","target_kind":"node","target_sha256":"9a7c64ab2c2b9ed86134152a1f05c2fe555795e3696631da1d6e35e95d880221"}],"concept.eia.evacuated-tube-collector":[{"id":"assertion.concept.eia.evacuated-tube-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Evacuated-tube collector as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Evacuated-tube collector as: A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","support":[{"end":33606,"quote":"A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":33449}],"target_id":"concept.eia.evacuated-tube-collector","target_kind":"node","target_sha256":"7c1ca6dca982f9aeebf4e093c555ceea0f301d96117d519f23f940feb81f0781"}],"concept.eia.evaporative-cooler-swamp-cooler":[{"id":"assertion.concept.eia.evaporative-cooler-swamp-cooler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Evaporative cooler (swamp cooler) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Evaporative cooler (swamp cooler) as: An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","support":[{"end":33989,"quote":"An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":33841}],"target_id":"concept.eia.evaporative-cooler-swamp-cooler","target_kind":"node","target_sha256":"03340675eeae67f77901b6ddd2085fa892f244d50dc1fbcd1b71212552e828f6"}],"concept.eia.exploratory-well":[{"id":"assertion.concept.eia.exploratory-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Exploratory well as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Exploratory well as: A hole drilled a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","support":[{"end":37471,"quote":"A hole drilled\t\t  a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":37197}],"target_id":"concept.eia.exploratory-well","target_kind":"node","target_sha256":"ec8e898df77b95be7071a9316cf1235dda26675b218d6afa6f5d306f0d4c89f2"}],"concept.eia.extraction-loss":[{"id":"assertion.concept.eia.extraction-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Extraction loss as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Extraction loss as: The extraction of gas plant liquids constituents such as","support":[{"end":38574,"quote":"The extraction of gas plant liquids constituents such as","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":38518}],"target_id":"concept.eia.extraction-loss","target_kind":"node","target_sha256":"c89aee8a30b1c7b8cb3e6624de7842ecded8c52afbe50f6c32da3908fe1f2c63"}],"concept.eia.fast-breeder-reactor-fbr":[{"id":"assertion.concept.eia.fast-breeder-reactor-fbr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fast breeder reactor (FBR) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fast breeder reactor (FBR) as: A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","support":[{"end":4260,"quote":"A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":3919}],"target_id":"concept.eia.fast-breeder-reactor-fbr","target_kind":"node","target_sha256":"e7502b6a2faa3679972945e59ab71d0838dadf3213dfb64e0c308af8cb5cf50a"}],"concept.eia.fission":[{"id":"assertion.concept.eia.fission","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fission as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fission as: The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","support":[{"end":14228,"quote":"The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":14011}],"target_id":"concept.eia.fission","target_kind":"node","target_sha256":"dd75d37bee40e1b3039096c97b4222f0c68f5808598a1096e4cb4d71e695efe3"}],"concept.eia.fixed-carbon":[{"id":"assertion.concept.eia.fixed-carbon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fixed carbon as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fixed carbon as: The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","support":[{"end":15178,"quote":"The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":14885}],"target_id":"concept.eia.fixed-carbon","target_kind":"node","target_sha256":"439e8f86e8f7076f4f4bd21a17c0d08a742add6a52d37798a1055052f33e2785"}],"concept.eia.flat-plate-pumped":[{"id":"assertion.concept.eia.flat-plate-pumped","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flat plate pumped as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flat plate pumped as: A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium predominant use is in water-heating applications.","support":[{"end":17282,"quote":"A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium\t\t predominant use is in water-heating applications.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":17035}],"target_id":"concept.eia.flat-plate-pumped","target_kind":"node","target_sha256":"cb674112d1594256d1a573cd9d84a3732cb08d068e245acb7608a97137473fd0"}],"concept.eia.floating-storage-regasification-unit-fsru":[{"id":"assertion.concept.eia.floating-storage-regasification-unit-fsru","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Floating Storage Regasification Unit (FSRU) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Floating Storage Regasification Unit (FSRU) as: A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","support":[{"end":18665,"quote":"A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":18453}],"target_id":"concept.eia.floating-storage-regasification-unit-fsru","target_kind":"node","target_sha256":"7d916525b67c793c128ac1bfb482f59f300b507a129298b3d902d55e88d96479"}],"concept.eia.floor-wall-or-pipeless-furnace":[{"id":"assertion.concept.eia.floor-wall-or-pipeless-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Floor, wall, or pipeless furnace as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Floor, wall, or pipeless furnace as: Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","support":[{"end":20018,"quote":"Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":19375}],"target_id":"concept.eia.floor-wall-or-pipeless-furnace","target_kind":"node","target_sha256":"900bd4063177e4834d4fb980240e98ba00da1a6cbd309c917f024e6863bdfcb7"}],"concept.eia.flue-gas-desulfurization":[{"id":"assertion.concept.eia.flue-gas-desulfurization","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue gas desulfurization as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue gas desulfurization as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","support":[{"end":20555,"quote":"Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20354}],"target_id":"concept.eia.flue-gas-desulfurization","target_kind":"node","target_sha256":"e4fed45639feaad620e42013857f1e9f088466313097c13afd8fb397521ed443"}],"concept.eia.flue-gas-desulfurization-unit-scrubber":[{"id":"assertion.concept.eia.flue-gas-desulfurization-unit-scrubber","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue-gas desulfurization unit (scrubber) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue-gas desulfurization unit (scrubber) as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","support":[{"end":20772,"quote":"Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20598}],"target_id":"concept.eia.flue-gas-desulfurization-unit-scrubber","target_kind":"node","target_sha256":"be6cc9d48440358aaa0da625875d61375c91f6ab745a5f9d9cb8ce8fa29b8800"}],"concept.eia.flue-gas-particulate-collector":[{"id":"assertion.concept.eia.flue-gas-particulate-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue-gas particulate collector as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue-gas particulate collector as: Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","support":[{"end":21058,"quote":"Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20805}],"target_id":"concept.eia.flue-gas-particulate-collector","target_kind":"node","target_sha256":"30dc0091737c38c4c7b416d6d3ad286a4cef9ad59c3de278afe390befe3f3f47"}],"concept.eia.fluid-catalytic-cracking":[{"id":"assertion.concept.eia.fluid-catalytic-cracking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fluid catalytic cracking as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fluid catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","support":[{"end":21427,"quote":"The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":21085}],"target_id":"concept.eia.fluid-catalytic-cracking","target_kind":"node","target_sha256":"8eb98ff598bda593f9b0050fc69bc605e31c7f18cdc62e4a2ce90bc1c37978b1"}],"concept.eia.fluid-coking":[{"id":"assertion.concept.eia.fluid-coking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fluid coking as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fluid coking as: A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","support":[{"end":21607,"quote":"A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":21442}],"target_id":"concept.eia.fluid-coking","target_kind":"node","target_sha256":"e1417d3c322c8c0a96318e9f799c7b74f366031f2e85d438cc0c9b5af7fd4349"}],"concept.eia.fly-ash":[{"id":"assertion.concept.eia.fly-ash","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fly ash as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fly ash as: Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","support":[{"end":23760,"quote":"Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":23530}],"target_id":"concept.eia.fly-ash","target_kind":"node","target_sha256":"c823ea23ab3427cc47b34d97b27f3dbf14a628b1a2494d9660d48fd110c23225"}],"concept.eia.forced-outage":[{"id":"assertion.concept.eia.forced-outage","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Forced outage as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Forced outage as: The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","support":[{"end":24718,"quote":"The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":24520}],"target_id":"concept.eia.forced-outage","target_kind":"node","target_sha256":"78f43ce0a0528d1e708d891172bf50e64540280ef476f91cfa744ae418e15281"}],"concept.eia.fossil-fuel-plant":[{"id":"assertion.concept.eia.fossil-fuel-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fossil fuel plant as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fossil fuel plant as: A plant using coal, petroleum, or gas as its source of energy.","support":[{"end":29545,"quote":"A plant using coal, petroleum, or gas as its source of energy.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29483}],"target_id":"concept.eia.fossil-fuel-plant","target_kind":"node","target_sha256":"14361a318071406ff8748f0d21fd339f900b2e6b9c44d6e973c52bc874ccc67a"}],"concept.eia.fossil-fuel-steam-electric-power-plant":[{"id":"assertion.concept.eia.fossil-fuel-steam-electric-power-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fossil fuel steam-electric power plant as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fossil fuel steam-electric power plant as: An electricity generation plant in which the","support":[{"end":29630,"quote":"An electricity generation plant in which the","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29586}],"target_id":"concept.eia.fossil-fuel-steam-electric-power-plant","target_kind":"node","target_sha256":"fdd8556fed944296a3a1f2eefd600da1a936f02f174f1a0046b4c5aa855b1374"}],"concept.eia.foundry-coke":[{"id":"assertion.concept.eia.foundry-coke","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Foundry coke as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Foundry coke as: This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","support":[{"end":30118,"quote":"This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29837}],"target_id":"concept.eia.foundry-coke","target_kind":"node","target_sha256":"2d45adaaed46b597f6c96ca9e3baf6151aa334c60517c662a663ec008e3f1c1c"}],"concept.eia.fractionation":[{"id":"assertion.concept.eia.fractionation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fractionation as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fractionation as: The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","support":[{"end":30327,"quote":"The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":30164}],"target_id":"concept.eia.fractionation","target_kind":"node","target_sha256":"0cf8a4e7bdcd59819d9d19638fb0e81f68d67fc0e894a71efc9fdd3cda56b58e"}],"concept.eia.fresh-feed-input":[{"id":"assertion.concept.eia.fresh-feed-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fresh feed input as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fresh feed input as: Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","support":[{"end":31935,"quote":"Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":31692}],"target_id":"concept.eia.fresh-feed-input","target_kind":"node","target_sha256":"714664e4c9075571e2d190fbfa0b93a6a2f0da5a151a079335b80ecee207e03b"}],"concept.eia.fresh-feeds":[{"id":"assertion.concept.eia.fresh-feeds","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fresh feeds as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fresh feeds as: Crude oil or petroleum distillates that are being fed to processing units for the first time.","support":[{"end":32386,"quote":"Crude oil or petroleum distillates that are being fed to processing units for the first time.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":32293}],"target_id":"concept.eia.fresh-feeds","target_kind":"node","target_sha256":"4d1a301a701667003ddec408868a849f337b9c4999acca2b30302ed66aef062f"}],"concept.eia.fuel-cell":[{"id":"assertion.concept.eia.fuel-cell","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel cell as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel cell as: A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","support":[{"end":32767,"quote":"A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":32664}],"target_id":"concept.eia.fuel-cell","target_kind":"node","target_sha256":"c04bf2ed026e174d8c13afb5e6937f6f04c3a6f2f170f4336949e100fc55b0c1"}],"concept.eia.fuel-cell-electric-vehicle-fcev":[{"id":"assertion.concept.eia.fuel-cell-electric-vehicle-fcev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel cell electric vehicle (FCEV) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel cell electric vehicle (FCEV) as: An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","support":[{"end":33274,"quote":"An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":33117}],"target_id":"concept.eia.fuel-cell-electric-vehicle-fcev","target_kind":"node","target_sha256":"8932515bbd383fb1d979ebe408a2652d6bfc48ca2a40a662d87396865e663246"}],"concept.eia.fuel-injection":[{"id":"assertion.concept.eia.fuel-injection","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel injection as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel injection as: A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","support":[{"end":35896,"quote":"A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":35341}],"target_id":"concept.eia.fuel-injection","target_kind":"node","target_sha256":"ac2cdc1907235af954f862afa25d47636958a7f3e450513e534c5f98c4876ca8"}],"concept.eia.fuels-solvent-deasphalting":[{"id":"assertion.concept.eia.fuels-solvent-deasphalting","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuels solvent deasphalting as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuels solvent deasphalting as: A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","support":[{"end":38259,"quote":"A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38084}],"target_id":"concept.eia.fuels-solvent-deasphalting","target_kind":"node","target_sha256":"7b9d274020fa714ae768f3ab0ead3ed82ff4b00dbad8c19fa5aaa7751ebe9669"}],"concept.eia.fugitive-emissions":[{"id":"assertion.concept.eia.fugitive-emissions","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fugitive emissions as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fugitive emissions as: Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","support":[{"end":38377,"quote":"Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38280}],"target_id":"concept.eia.fugitive-emissions","target_kind":"node","target_sha256":"97271d9cd3d63c5442d07bc3fbe8745961cca414dad804a7f2a8d38d44448ba8"}],"concept.eia.full-power-day":[{"id":"assertion.concept.eia.full-power-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Full power day as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Full power day as: The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","support":[{"end":38702,"quote":"The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38511}],"target_id":"concept.eia.full-power-day","target_kind":"node","target_sha256":"7f624c7868f9fe35378207b4dc4d5f2fb7543b042e0ed830ed4cae90cc4dba14"}],"concept.eia.full-power-operation":[{"id":"assertion.concept.eia.full-power-operation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Full power operation as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Full power operation as: Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","support":[{"end":38835,"quote":"Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38725}],"target_id":"concept.eia.full-power-operation","target_kind":"node","target_sha256":"5855351be8b6089821baa55c3fe78d7b5d924323cfc08f32f3368610ea879684"}],"concept.eia.furnace":[{"id":"assertion.concept.eia.furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Furnace as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Furnace as: The part of a boiler or warm-air space-heating plant in which combustion takes place.","support":[{"end":39315,"quote":"The part of a boiler or warm-air space-heating plant in which combustion takes place.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":39230}],"target_id":"concept.eia.furnace","target_kind":"node","target_sha256":"6d61b041ab1936f0dfca8a3ae7548993c7bebb5c82041bc345652c7b75e934f2"}],"concept.eia.gas-cooled-fast-breeder-reactor-gcfb":[{"id":"assertion.concept.eia.gas-cooled-fast-breeder-reactor-gcfb","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas cooled fast breeder reactor (GCFB) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas cooled fast breeder reactor (GCFB) as: A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","support":[{"end":1015,"quote":"A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":936}],"target_id":"concept.eia.gas-cooled-fast-breeder-reactor-gcfb","target_kind":"node","target_sha256":"f78d43379ae96a1ef118f0e8aea78534ab7c0ebbf77c37e6aac262dace21a713"}],"concept.eia.gas-to-liquids-gtl":[{"id":"assertion.concept.eia.gas-to-liquids-gtl","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas to liquids (GTL) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas to liquids (GTL) as: A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","support":[{"end":1983,"quote":"A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":1836}],"target_id":"concept.eia.gas-to-liquids-gtl","target_kind":"node","target_sha256":"bf2751eb28a7b99b9ef74ef98ee23ef2623a014c783fa16e7f4265523dcc089b"}],"concept.eia.gas-turbine-plant":[{"id":"assertion.concept.eia.gas-turbine-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas turbine plant as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas turbine plant as: A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","support":[{"end":2329,"quote":"A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2003}],"target_id":"concept.eia.gas-turbine-plant","target_kind":"node","target_sha256":"97cf8aefcdea64e7b62a1f2241cb5458b82f1042ba14ad9c27bde9eb98ad8d66"}],"concept.eia.gas-well":[{"id":"assertion.concept.eia.gas-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas well as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas well as: A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","support":[{"end":2495,"quote":"A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2340}],"target_id":"concept.eia.gas-well","target_kind":"node","target_sha256":"2393d601b89802f11fe7222844c99c8f5b5fffeff5bdabd3e9fd477123491f5a"}],"concept.eia.gas-well-productivity":[{"id":"assertion.concept.eia.gas-well-productivity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas well productivity as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas well productivity as: Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","support":[{"end":2710,"quote":"Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2519}],"target_id":"concept.eia.gas-well-productivity","target_kind":"node","target_sha256":"edc9de49fde6efe04eab2cfed53fee178c32a050ac3f59803982ccb588d0936e"}],"concept.eia.gasohol":[{"id":"assertion.concept.eia.gasohol","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasohol as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasohol as: A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","support":[{"end":3086,"quote":"A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2916}],"target_id":"concept.eia.gasohol","target_kind":"node","target_sha256":"f247280ab1f873697ef78d7479be4d4d52dde001272418b15fd0be34ed26d7ea"}],"concept.eia.gasoline-blending-components":[{"id":"assertion.concept.eia.gasoline-blending-components","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasoline blending components as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasoline blending components as: Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","support":[{"end":3500,"quote":"Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":3256}],"target_id":"concept.eia.gasoline-blending-components","target_kind":"node","target_sha256":"ab079472f6d35de03ea7d3bf55f0bb7b8fa986231b80eec1a4bb85c453abff4a"}],"concept.eia.gasoline-motor-leaded":[{"id":"assertion.concept.eia.gasoline-motor-leaded","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasoline motor, (leaded) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasoline motor, (leaded) as: Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","support":[{"end":4937,"quote":"Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":4556}],"target_id":"concept.eia.gasoline-motor-leaded","target_kind":"node","target_sha256":"fcc4abb300fa0af3b088b2fe2742cc6f88a648bd411723afe4d05c739f36fd53"}],"concept.eia.gate-station":[{"id":"assertion.concept.eia.gate-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gate station as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gate station as: Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","support":[{"end":5485,"quote":"Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":5296}],"target_id":"concept.eia.gate-station","target_kind":"node","target_sha256":"ae8e99d53f3e8ca35a27dd230761a7a17d4a5426d5827c65f9f0747d1138d34c"}],"concept.eia.generating-station":[{"id":"assertion.concept.eia.generating-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generating station as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generating station as: A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","support":[{"end":6311,"quote":"A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6164}],"target_id":"concept.eia.generating-station","target_kind":"node","target_sha256":"376f6f5836196a981e27fad282f726f88605cd9b46e7b64f447a201fd6c96a4f"}],"concept.eia.generating-unit":[{"id":"assertion.concept.eia.generating-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generating unit as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generating unit as: Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","support":[{"end":6488,"quote":"Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6329}],"target_id":"concept.eia.generating-unit","target_kind":"node","target_sha256":"3ffa96a9231de80fbbe26df08d88673c1935b73f83858ac07e13ac1815fa6948"}],"concept.eia.generator-capacity":[{"id":"assertion.concept.eia.generator-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generator capacity as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generator capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","support":[{"end":7008,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6865}],"target_id":"concept.eia.generator-capacity","target_kind":"node","target_sha256":"fa99ab963d3e12059edac68c274f3f66d58a3486da15ceb48d426c69f5a6b522"}],"concept.eia.generator-nameplate-capacity-installed":[{"id":"assertion.concept.eia.generator-nameplate-capacity-installed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generator nameplate capacity (installed) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generator nameplate capacity (installed) as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","support":[{"end":7364,"quote":"The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":7051}],"target_id":"concept.eia.generator-nameplate-capacity-installed","target_kind":"node","target_sha256":"1bab87182ff21e042c42e1ab79a5933b437f344b6e2c5ce2376b96e5868e2607"}],"concept.eia.geologic-sequestration":[{"id":"assertion.concept.eia.geologic-sequestration","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Geologic sequestration as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Geologic sequestration as: A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","support":[{"end":8403,"quote":"A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":8188}],"target_id":"concept.eia.geologic-sequestration","target_kind":"node","target_sha256":"3397e86d1e9756ef39c98a0336068f7dbea6bd97e7cfd2f59118c1720f9a5bfb"}],"concept.eia.geothermal-plant":[{"id":"assertion.concept.eia.geothermal-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Geothermal plant as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Geothermal plant as: A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","support":[{"end":9373,"quote":"A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":9190}],"target_id":"concept.eia.geothermal-plant","target_kind":"node","target_sha256":"04db16c49b5118e7316616df0ac8a019a8bbffc864cc78fe934273989c990387"}],"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month":[{"id":"assertion.concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross additions to construction work in progress for the month as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross additions to construction work in progress for the month as: This amount should include the monthly gross additions for an electric plant in the process of construction.","support":[{"end":12741,"quote":"This amount should include the monthly gross additions for an electric plant in the process of construction.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":12633}],"target_id":"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","target_kind":"node","target_sha256":"6e3c5aec4631b8aa44b119946d31a7f8dec092288b6f21fb2e7f1ae4080370be"}],"concept.eia.gross-gas-withdrawal":[{"id":"assertion.concept.eia.gross-gas-withdrawal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross gas withdrawal as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross gas withdrawal as: The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","support":[{"end":14475,"quote":"The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":14358}],"target_id":"concept.eia.gross-gas-withdrawal","target_kind":"node","target_sha256":"d50e4a98a2565d64b83ef3adf4342171067b3d6509ce3e442ab1ea51b5f664dd"}],"concept.eia.gross-inputs":[{"id":"assertion.concept.eia.gross-inputs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross inputs as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross inputs as: The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","support":[{"end":15408,"quote":"The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":15296}],"target_id":"concept.eia.gross-inputs","target_kind":"node","target_sha256":"e64b76c8b86a68fc0a9997af92c39716846a6094966972b1437f494d24ca505a"}],"concept.eia.gross-vehicle-weight-rating-gvwr":[{"id":"assertion.concept.eia.gross-vehicle-weight-rating-gvwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross vehicle weight rating (GVWR) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross vehicle weight rating (GVWR) as: Vehicle weight plus carrying capacity.","support":[{"end":15828,"quote":"Vehicle weight plus carrying capacity.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":15790}],"target_id":"concept.eia.gross-vehicle-weight-rating-gvwr","target_kind":"node","target_sha256":"de148f9b990a6360c13155812112cb4e0d5acda683aaadd13f6a03e3a88e6378"}],"concept.eia.heat-content":[{"id":"assertion.concept.eia.heat-content","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat content as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat content as: The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam). The amount of heat energy is commonly expressed in British thermal units (Btu). Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process). The Energy Information Administration typically uses gross heat content values.","support":[{"end":2778,"quote":"The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam).  The amount of heat energy is commonly expressed in British thermal units (Btu).  Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process).  The Energy Information Administration typically uses gross heat content values.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":1998}],"target_id":"concept.eia.heat-content","target_kind":"node","target_sha256":"30daf1012205eb40ae6685f38992c5190cdb160e07bb9d5fb511bdd392654c32"}],"concept.eia.heat-pump":[{"id":"assertion.concept.eia.heat-pump","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump as: Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","support":[{"end":3151,"quote":"Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":2790}],"target_id":"concept.eia.heat-pump","target_kind":"node","target_sha256":"a910a57fb1ea3cbc5245ce849064a8e4b27ed8e80157416459c6ac8902d81fa9"}],"concept.eia.heat-pump-air-source":[{"id":"assertion.concept.eia.heat-pump-air-source","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump (air source) as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump (air source) as: An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","support":[{"end":3638,"quote":"An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":3176}],"target_id":"concept.eia.heat-pump-air-source","target_kind":"node","target_sha256":"3708442d3ee7e5fa077f3c67afd3599005af46df1a366bbd41e07aa1e52bd017"}],"concept.eia.heat-pump-geothermal":[{"id":"assertion.concept.eia.heat-pump-geothermal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump (geothermal) as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump (geothermal) as: A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","support":[{"end":4059,"quote":"A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":3663}],"target_id":"concept.eia.heat-pump-geothermal","target_kind":"node","target_sha256":"da90ba3476630b5a70408cf88cbb2a216842c5985455c61b2e3eb08b1aa6a139"}],"concept.eia.heating-value":[{"id":"assertion.concept.eia.heating-value","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heating value as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heating value as: Heating value: A measure of the energy content of the physical unit of any combustible fuel. For a fuller discussion of","support":[{"end":7572,"quote":"Heating value: A measure of the energy content of the physical unit of any combustible fuel.  For a fuller discussion of","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":7452}],"target_id":"concept.eia.heating-value","target_kind":"node","target_sha256":"37cd7f564678a1c37b0910a4e04372e32acdfe2abf3f715406aaefa7d2bba11d"}],"concept.eia.heavy-water-moderated-reactor":[{"id":"assertion.concept.eia.heavy-water-moderated-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heavy-water-moderated reactor as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heavy-water-moderated reactor as: A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","support":[{"end":8935,"quote":"A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":8769}],"target_id":"concept.eia.heavy-water-moderated-reactor","target_kind":"node","target_sha256":"0df40245b2c899c279b6cb2ef9d7594132d1bd6e5bb540f5e8e87562a298d887"}],"concept.eia.heliostat":[{"id":"assertion.concept.eia.heliostat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heliostat as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heliostat as: A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","support":[{"end":9507,"quote":"A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":9248}],"target_id":"concept.eia.heliostat","target_kind":"node","target_sha256":"25bc35c97b1d9da04bdbce27af17bdd48bc8f4c84a791b2b6f050a354208e6e3"}],"concept.eia.high-efficiency-ballast":[{"id":"assertion.concept.eia.high-efficiency-ballast","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"High efficiency ballast as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines High efficiency ballast as: A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","support":[{"end":10201,"quote":"A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":9784}],"target_id":"concept.eia.high-efficiency-ballast","target_kind":"node","target_sha256":"1b36eaa94a540191b3cd2870fcb5a2358fc4524b1e0ddc87c1dac8eaf008f8bf"}],"concept.eia.high-temperature-collector":[{"id":"assertion.concept.eia.high-temperature-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"High-temperature collector as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines High-temperature collector as: A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","support":[{"end":10979,"quote":"A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":10880}],"target_id":"concept.eia.high-temperature-collector","target_kind":"node","target_sha256":"7a2322a5b8988db87f9a93d983664e762af17fdadcb4e3c20ab617e75efb8c02"}],"concept.eia.horizontal-axis-wind-turbine":[{"id":"assertion.concept.eia.horizontal-axis-wind-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Horizontal axis wind turbine as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Horizontal axis wind turbine as: The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","support":[{"end":12058,"quote":"The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":11960}],"target_id":"concept.eia.horizontal-axis-wind-turbine","target_kind":"node","target_sha256":"8c0ce301e4cc99dfa9da0f28b4ceba5565890e446bad8ad25e93b35e88c8fe55"}],"concept.eia.horsepower":[{"id":"assertion.concept.eia.horsepower","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Horsepower as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Horsepower as: A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","support":[{"end":12404,"quote":"A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":12298}],"target_id":"concept.eia.horsepower","target_kind":"node","target_sha256":"5753286082cd2c36ad1f78c0d9b3324df09071bc0e86dd327ebd5ac4221151f1"}],"concept.eia.hours-under-load":[{"id":"assertion.concept.eia.hours-under-load","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hours under load as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hours under load as: The hours the boiler is operating to drive the generator producing electricity.","support":[{"end":13339,"quote":"The hours the boiler is operating to drive the generator producing electricity.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":13260}],"target_id":"concept.eia.hours-under-load","target_kind":"node","target_sha256":"df95ad192af05807c77f16b79aa9576f83eed8bf9be46e62db7d4aa1c87bef2b"}],"concept.eia.htgr":[{"id":"assertion.concept.eia.htgr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HTGR as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HTGR as: High Temperature Gas-cooled Reactor","support":[{"end":14549,"quote":"High Temperature Gas-cooled Reactor","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14514}],"target_id":"concept.eia.htgr","target_kind":"node","target_sha256":"17095501a2bb5797562ee0b10c80a4d84417c9428e4cd450696dac0fb0c89597"}],"concept.eia.hub-height":[{"id":"assertion.concept.eia.hub-height","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hub height as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hub height as: In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","support":[{"end":14655,"quote":"In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14562}],"target_id":"concept.eia.hub-height","target_kind":"node","target_sha256":"995a0f1cfbf437b9d617470ec8cdfc714f7a84220b87ae0aecf9d47093ce1dc3"}],"concept.eia.humidifier":[{"id":"assertion.concept.eia.humidifier","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Humidifier as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Humidifier as: A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","support":[{"end":14819,"quote":"A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14668}],"target_id":"concept.eia.humidifier","target_kind":"node","target_sha256":"bcba181b7dc9141d769dfe3880e535e50c90a626c83eb0add57249cc75560822"}],"concept.eia.hvac":[{"id":"assertion.concept.eia.hvac","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HVAC as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HVAC as: An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","support":[{"end":15140,"quote":"An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":15010}],"target_id":"concept.eia.hvac","target_kind":"node","target_sha256":"b334c182f1bc7cbe900989762736f4ddea05d02ef882c6974c3c62edfbf9d261"}],"concept.eia.hvac-conservation-feature":[{"id":"assertion.concept.eia.hvac-conservation-feature","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HVAC conservation feature as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HVAC conservation feature as: A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","support":[{"end":15287,"quote":"A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":15168}],"target_id":"concept.eia.hvac-conservation-feature","target_kind":"node","target_sha256":"402ece4cabb07a1b4cb88a4189eba96a0da361fd84324be08da3a83f1706c9f9"}],"concept.eia.hybrid-transmission-line":[{"id":"assertion.concept.eia.hybrid-transmission-line","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hybrid transmission line as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hybrid transmission line as: A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","support":[{"end":16171,"quote":"A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16035}],"target_id":"concept.eia.hybrid-transmission-line","target_kind":"node","target_sha256":"a8fec158218c20fc6d0d23758d5261b18cd499eb90247152eed0492540d49b92"}],"concept.eia.hydraulic-fracturing":[{"id":"assertion.concept.eia.hydraulic-fracturing","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hydraulic fracturing as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hydraulic fracturing as: A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open. Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used. The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used. Hydraulic fracturing is common in low-permeability formations.","support":[{"end":16881,"quote":"A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open.  Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used.  The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used.  Hydraulic fracturing is common in low-permeability formations.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16194}],"target_id":"concept.eia.hydraulic-fracturing","target_kind":"node","target_sha256":"6979c44cb49f3b37a83a689e42cb780adccc4f9c2214b2c929f6a1d0fd85199c"}],"concept.eia.hydraulic-head":[{"id":"assertion.concept.eia.hydraulic-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hydraulic head as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hydraulic head as: The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","support":[{"end":17072,"quote":"The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16898}],"target_id":"concept.eia.hydraulic-head","target_kind":"node","target_sha256":"f12968bf619393080ee8ed6be92348c367d422425f058570fb52670e5be9736b"}],"concept.eia.improved-recovery":[{"id":"assertion.concept.eia.improved-recovery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Improved recovery as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Improved recovery as: Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","support":[{"end":3133,"quote":"Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":2981}],"target_id":"concept.eia.improved-recovery","target_kind":"node","target_sha256":"357bb412abbfeb189649ad35375134d00134a210a7115ea15b1b50c55de66362"}],"concept.eia.incandescent-lamp":[{"id":"assertion.concept.eia.incandescent-lamp","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Incandescent lamp as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Incandescent lamp as: A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","support":[{"end":4815,"quote":"A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":4345}],"target_id":"concept.eia.incandescent-lamp","target_kind":"node","target_sha256":"a1acb78d6478d64ffda1229c38e0f0ab8e5dc447adbcd2a28563faee252d7edf"}],"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs":[{"id":"assertion.concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Incandescent light bulbs, including regular or energy-efficient light bulbs as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Incandescent light bulbs, including regular or energy-efficient light bulbs as: An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","support":[{"end":5974,"quote":"An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles\t\t bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":4893}],"target_id":"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","target_kind":"node","target_sha256":"ee6ddaf4fee6676e65f006813857a78419ebe2acd7dbdc8ff64a20b0b61e7bea"}],"concept.eia.independent-system-operator-iso":[{"id":"assertion.concept.eia.independent-system-operator-iso","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Independent system operator (ISO) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Independent system operator (ISO) as: An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","support":[{"end":7965,"quote":"An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":7782}],"target_id":"concept.eia.independent-system-operator-iso","target_kind":"node","target_sha256":"54c248abf77e0718ed44a7cf03ebc26520f187a60d14681f1abbb5a9fd942409"}],"concept.eia.initial-operation":[{"id":"assertion.concept.eia.initial-operation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Initial operation as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Initial operation as: First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","support":[{"end":13325,"quote":"First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":13152}],"target_id":"concept.eia.initial-operation","target_kind":"node","target_sha256":"12b408e7f393ed5c60d0c1875a718365c1d48beba1d1744be3c672d6027e77ba"}],"concept.eia.insulator":[{"id":"assertion.concept.eia.insulator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Insulator as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Insulator as: A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","support":[{"end":15931,"quote":"A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":15652}],"target_id":"concept.eia.insulator","target_kind":"node","target_sha256":"298c403918d50fd74069b931a70254c7ceb9640af99a88bbf835b85d527b84a7"}],"concept.eia.integral-collector-storage-ics":[{"id":"assertion.concept.eia.integral-collector-storage-ics","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integral collector storage (ICS) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integral collector storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","support":[{"end":16483,"quote":"A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16380}],"target_id":"concept.eia.integral-collector-storage-ics","target_kind":"node","target_sha256":"39a5b00ffb3cd71c3b3be1375ab95ea97531874d8ccf7e800dbb24acac79a564"}],"concept.eia.integrated-demand":[{"id":"assertion.concept.eia.integrated-demand","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integrated demand as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integrated demand as: The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","support":[{"end":16676,"quote":"The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16503}],"target_id":"concept.eia.integrated-demand","target_kind":"node","target_sha256":"0910eb411c212d97735430fb077265102e3af9590ae7c21a02b69201ac5d7ca9"}],"concept.eia.integrated-gasification-combined-cycle-technology":[{"id":"assertion.concept.eia.integrated-gasification-combined-cycle-technology","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integrated gasification-combined cycle technology as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integrated gasification-combined cycle technology as: Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","support":[{"end":17130,"quote":"Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16728}],"target_id":"concept.eia.integrated-gasification-combined-cycle-technology","target_kind":"node","target_sha256":"01b07815dc57beee1e39a9314eaeb3a946e1dd0268468d1a9928fc8159e9f38f"}],"concept.eia.interconnected-system":[{"id":"assertion.concept.eia.interconnected-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interconnected system as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interconnected system as: A system consisting of two or more individual power systems normally operating with connecting tie lines.","support":[{"end":18837,"quote":"A system consisting of two or more individual power systems normally operating with connecting tie lines.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":18732}],"target_id":"concept.eia.interconnected-system","target_kind":"node","target_sha256":"1a38e0f11f30672b81d35da2c007a1dea536239f2e64e71bf36d98646c59e35a"}],"concept.eia.intermediate-grade-gasoline":[{"id":"assertion.concept.eia.intermediate-grade-gasoline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermediate grade gasoline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermediate grade gasoline as: A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","support":[{"end":20682,"quote":"A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20473}],"target_id":"concept.eia.intermediate-grade-gasoline","target_kind":"node","target_sha256":"2d3ee16d8bb01fb3e986fb03e77c3e67a47a3986cce77f9c9de99f3f2c41c598"}],"concept.eia.intermediate-load-electric-system":[{"id":"assertion.concept.eia.intermediate-load-electric-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermediate load (electric system) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermediate load (electric system) as: The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","support":[{"end":20885,"quote":"The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20720}],"target_id":"concept.eia.intermediate-load-electric-system","target_kind":"node","target_sha256":"a58559722554662f0d39292864d726d2dbbbf0ed37f9e69a256b30d5e6552630"}],"concept.eia.intermittent-electric-generator-or-intermittent-resource":[{"id":"assertion.concept.eia.intermittent-electric-generator-or-intermittent-resource","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermittent electric generator or intermittent resource as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermittent electric generator or intermittent resource as: An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","support":[{"end":21324,"quote":"An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20944}],"target_id":"concept.eia.intermittent-electric-generator-or-intermittent-resource","target_kind":"node","target_sha256":"23cecca50b30cd379661690fdcd7fe59a77ccc83d1bb3ee3de71b800b9ac2abf"}],"concept.eia.internal-collector-storage-ics":[{"id":"assertion.concept.eia.internal-collector-storage-ics","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal Collector Storage (ICS) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal Collector Storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","support":[{"end":21453,"quote":"A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21359}],"target_id":"concept.eia.internal-collector-storage-ics","target_kind":"node","target_sha256":"022d8f136e66b1dd29d672a7c1ea951aced836795a3bedcaa0bc103bc3a8fc92"}],"concept.eia.internal-combustion-engine-ice":[{"id":"assertion.concept.eia.internal-combustion-engine-ice","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal combustion engine (ICE) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal combustion engine (ICE) as: Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","support":[{"end":21625,"quote":"Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21488}],"target_id":"concept.eia.internal-combustion-engine-ice","target_kind":"node","target_sha256":"532d131b37ac9c80537ad1b21e2f88858e6eb899cdd7987ed0a342c8eb36eb3c"}],"concept.eia.internal-combustion-plant":[{"id":"assertion.concept.eia.internal-combustion-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal combustion plant as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal combustion plant as: A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","support":[{"end":22073,"quote":"A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21653}],"target_id":"concept.eia.internal-combustion-plant","target_kind":"node","target_sha256":"7dbfa90173501c55ffc210de77182cac5da8efa89326434cf97b163da99b5989"}],"concept.eia.interruptible-load":[{"id":"assertion.concept.eia.interruptible-load","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interruptible load as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interruptible load as: This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","support":[{"end":22749,"quote":"This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":22361}],"target_id":"concept.eia.interruptible-load","target_kind":"node","target_sha256":"aa6b05642cb8dff11811643768f7148e7193aa4032d4dff092a5455564d2ec33"}],"concept.eia.interstate-pipeline":[{"id":"assertion.concept.eia.interstate-pipeline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interstate pipeline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interstate pipeline as: Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","support":[{"end":24000,"quote":"Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":23850}],"target_id":"concept.eia.interstate-pipeline","target_kind":"node","target_sha256":"5ba30ee3436758d96c4c6b7320882d734300344d4bbba343b164bd8968f1fe98"}],"concept.eia.intrastate-pipeline":[{"id":"assertion.concept.eia.intrastate-pipeline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intrastate pipeline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intrastate pipeline as: Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","support":[{"end":25272,"quote":"Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":24968}],"target_id":"concept.eia.intrastate-pipeline","target_kind":"node","target_sha256":"431d8d5284955174e284c10404a7a71f4badf512eb9d5cbf4e413a838d2a67b0"}],"concept.eia.ion-exchange":[{"id":"assertion.concept.eia.ion-exchange","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ion exchange as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ion exchange as: Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","support":[{"end":26463,"quote":"Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":26195}],"target_id":"concept.eia.ion-exchange","target_kind":"node","target_sha256":"13c433551e8a0c83aeea8fc9e7c73ff517099e4651b75be2c76089b332175647"}],"concept.eia.irradiated-nuclear-fuel":[{"id":"assertion.concept.eia.irradiated-nuclear-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Irradiated nuclear fuel as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Irradiated nuclear fuel as: Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","support":[{"end":27043,"quote":"Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":26956}],"target_id":"concept.eia.irradiated-nuclear-fuel","target_kind":"node","target_sha256":"1a125d5cf06cb317c9d08f0d79e496b8c54597565553792db1494e29d5a6b718"}],"concept.eia.isomerization":[{"id":"assertion.concept.eia.isomerization","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Isomerization as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Isomerization as: A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","support":[{"end":27949,"quote":"A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":27754}],"target_id":"concept.eia.isomerization","target_kind":"node","target_sha256":"2a9856581662062e6422cc575d4fdc0930821e5839371f9093e277b50d881118"}],"concept.eia.isopach":[{"id":"assertion.concept.eia.isopach","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Isopach as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Isopach as: A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","support":[{"end":28203,"quote":"A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":28105}],"target_id":"concept.eia.isopach","target_kind":"node","target_sha256":"cfe47036cf512e4da77f1612062a849d13f74e190aedea2180651f8bdd4082f1"}],"concept.eia.jacket":[{"id":"assertion.concept.eia.jacket","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Jacket as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Jacket as: The enclosure on a water heater, furnace, or boiler.","support":[{"end":545,"quote":"The enclosure on a water heater, furnace, or boiler.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":493}],"target_id":"concept.eia.jacket","target_kind":"node","target_sha256":"8bc871b33194c7697a5f8761f06c2bb89a9f85ca72a8d32267244f533634fe84"}],"concept.eia.joint-use-facility":[{"id":"assertion.concept.eia.joint-use-facility","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Joint-use facility as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Joint-use facility as: A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","support":[{"end":1170,"quote":"A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":1048}],"target_id":"concept.eia.joint-use-facility","target_kind":"node","target_sha256":"bbad8d8b5e5091d45439dd4027a3f43aa7c7576d750fcdfaeef6662f7873fe1c"}],"concept.eia.joule-j":[{"id":"assertion.concept.eia.joule-j","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Joule (J) as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Joule (J) as: The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","support":[{"end":1422,"quote":"The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":1182}],"target_id":"concept.eia.joule-j","target_kind":"node","target_sha256":"f9c0bfb804ef389585507e653db5d68d307170623152d5c7bf50c7259a30fcfc"}],"concept.eia.kaplan-turbine":[{"id":"assertion.concept.eia.kaplan-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kaplan turbine as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kaplan turbine as: A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","support":[{"end":653,"quote":"A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":501}],"target_id":"concept.eia.kaplan-turbine","target_kind":"node","target_sha256":"bc89024e8c840ab878ac4e8544f6b46d4604fa6a2d82274c548b78d0a858d04b"}],"concept.eia.kerogen":[{"id":"assertion.concept.eia.kerogen","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kerogen as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kerogen as: Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents. Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments. Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","support":[{"end":968,"quote":"Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents.  Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments.  Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":663}],"target_id":"concept.eia.kerogen","target_kind":"node","target_sha256":"687052d996f495366d4ca712f657c0d4815eebdb9a1697d426c2e01c9e1fcecf"}],"concept.eia.kerosene":[{"id":"assertion.concept.eia.kerosene","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kerosene as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kerosene as: A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","support":[{"end":1599,"quote":"A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":979}],"target_id":"concept.eia.kerosene","target_kind":"node","target_sha256":"035d05283b274ddcb861337531159a80f9d794ecfe11ec1c6d1fdc232754489a"}],"concept.eia.kilovolt-ampere-kva":[{"id":"assertion.concept.eia.kilovolt-ampere-kva","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kilovolt-Ampere (kVa) as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kilovolt-Ampere (kVa) as: A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","support":[{"end":2487,"quote":"A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":2357}],"target_id":"concept.eia.kilovolt-ampere-kva","target_kind":"node","target_sha256":"718aca2ab07d6224e360abd17f810887cc55c27b3463a1bafd3d89999049ba60"}],"concept.eia.kilowatthour-kwh":[{"id":"assertion.concept.eia.kilowatthour-kwh","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kilowatthour (kWh) as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kilowatthour (kWh) as: A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","support":[{"end":2772,"quote":"A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":2609}],"target_id":"concept.eia.kilowatthour-kwh","target_kind":"node","target_sha256":"8e5c528fc655abfb8bdf621c79e3b79e2e606ae3b8d22ec9aa31fcf6e035b043"}],"concept.eia.landfill-gas":[{"id":"assertion.concept.eia.landfill-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Landfill gas as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Landfill gas as: Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content). The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","support":[{"end":1754,"quote":"Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content).  The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":1197}],"target_id":"concept.eia.landfill-gas","target_kind":"node","target_sha256":"f785c572b764fc771ac0b952d57bc991f073766805db7515847fe40f7e96f9ae"}],"concept.eia.large-scale-solar":[{"id":"assertion.concept.eia.large-scale-solar","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Large-scale solar as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Large-scale solar as: Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","support":[{"end":2188,"quote":"Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":2087}],"target_id":"concept.eia.large-scale-solar","target_kind":"node","target_sha256":"c769003cff89aade881911c946bafcaf8ffd6cd1d7db353041f6eee982a6da0f"}],"concept.eia.lead-acid-battery":[{"id":"assertion.concept.eia.lead-acid-battery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lead acid battery as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lead acid battery as: An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","support":[{"end":2650,"quote":"An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":2540}],"target_id":"concept.eia.lead-acid-battery","target_kind":"node","target_sha256":"68d68f0c502449e4829d752096ee7f35bb04052390a90f613a7dd73e772b9a3b"}],"concept.eia.leading-edge":[{"id":"assertion.concept.eia.leading-edge","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Leading edge as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","support":[{"end":3300,"quote":"In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":3171}],"target_id":"concept.eia.leading-edge","target_kind":"node","target_sha256":"1045576217fdaaf48a99b0bc463b3d91ade2433b59f0419423c17a2d2eda6ddf"}],"concept.eia.life-extension":[{"id":"assertion.concept.eia.life-extension","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Life extension as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Life extension as: Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","support":[{"end":6740,"quote":"Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":6473}],"target_id":"concept.eia.life-extension","target_kind":"node","target_sha256":"fd92050348a116f0eb30427916043e29154bbe252f9ae5104c071b02eb5c2c70"}],"concept.eia.lift":[{"id":"assertion.concept.eia.lift","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lift as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lift as: The force that pulls a wind turbine blade, as opposed to drag.","support":[{"end":6809,"quote":"The force that pulls a wind turbine blade, as opposed to drag.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":6747}],"target_id":"concept.eia.lift","target_kind":"node","target_sha256":"9aced2e254acd091a5968a809791b7afe7a44b9f071fe0bc0163e66327d2480e"}],"concept.eia.light-water-reactor-lwr":[{"id":"assertion.concept.eia.light-water-reactor-lwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Light water reactor (LWR) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Light water reactor (LWR) as: A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","support":[{"end":7996,"quote":"A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":7885}],"target_id":"concept.eia.light-water-reactor-lwr","target_kind":"node","target_sha256":"727cf87452bdf645346822483276ad516027ad513d4920e0c4193414013b4558"}],"concept.eia.lighting-conservation-feature":[{"id":"assertion.concept.eia.lighting-conservation-feature","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lighting conservation feature as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lighting conservation feature as: A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","support":[{"end":8244,"quote":"A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":8141}],"target_id":"concept.eia.lighting-conservation-feature","target_kind":"node","target_sha256":"de4ed6fd18b2144d668f8a756cc1769608fa0ee914b4bf311a54934511ccfe91"}],"concept.eia.lighting-equipment":[{"id":"assertion.concept.eia.lighting-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lighting equipment as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lighting equipment as: These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","support":[{"end":8983,"quote":"These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":8788}],"target_id":"concept.eia.lighting-equipment","target_kind":"node","target_sha256":"a9d3272e82e5ac820d9e9511458dec582448469739ddc8842856d2d7788a3da0"}],"concept.eia.liquid-collector":[{"id":"assertion.concept.eia.liquid-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Liquid collector as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Liquid collector as: A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","support":[{"end":11457,"quote":"A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":11317}],"target_id":"concept.eia.liquid-collector","target_kind":"node","target_sha256":"f7a54aee7c45bd76a55e6c2ec4a6ca5976dc90a5d321d5c7d84041dafa54db80"}],"concept.eia.liquid-metal-fast-breeder-reactor":[{"id":"assertion.concept.eia.liquid-metal-fast-breeder-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Liquid metal fast breeder reactor as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Liquid metal fast breeder reactor as: A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","support":[{"end":11905,"quote":"A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":11809}],"target_id":"concept.eia.liquid-metal-fast-breeder-reactor","target_kind":"node","target_sha256":"45dee7a6ec00ddcbb4fad1ec99252429cbd354cfc1e38bba3eea424b08a7ff9c"}],"concept.eia.load-loss-3-hours":[{"id":"assertion.concept.eia.load-loss-3-hours","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load loss (3 hours) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load loss (3 hours) as: Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","support":[{"end":13994,"quote":"Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":13741}],"target_id":"concept.eia.load-loss-3-hours","target_kind":"node","target_sha256":"01f841f4e38f84707034095b00bde32bec50347fa9f9c10115c9c4b1938bd553"}],"concept.eia.load-management-technique":[{"id":"assertion.concept.eia.load-management-technique","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load management technique as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load management technique as: Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","support":[{"end":14297,"quote":"Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":14022}],"target_id":"concept.eia.load-management-technique","target_kind":"node","target_sha256":"11e26154161a81b2596b651d63006b5549279383e7644ccfe2bf94761e559a03"}],"concept.eia.load-on-equipment":[{"id":"assertion.concept.eia.load-on-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load on equipment as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load on equipment as: One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","support":[{"end":14578,"quote":"One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":14317}],"target_id":"concept.eia.load-on-equipment","target_kind":"node","target_sha256":"e2ff11d698e1a8ba914f5a85456e84578bb4ca3522f2e7bbcbc860574ea6f9c9"}],"concept.eia.longwall-mining":[{"id":"assertion.concept.eia.longwall-mining","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Longwall mining as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Longwall mining as: An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","support":[{"end":18504,"quote":"An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":17607}],"target_id":"concept.eia.longwall-mining","target_kind":"node","target_sha256":"991599ec46629e6ee38712312588476ae07d9834027755cdfdfd9d73e195f9d7"}],"concept.eia.low-power-testing":[{"id":"assertion.concept.eia.low-power-testing","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Low power testing as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Low power testing as: The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","support":[{"end":20622,"quote":"The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":20385}],"target_id":"concept.eia.low-power-testing","target_kind":"node","target_sha256":"7ee6cf7afb7499dcad37532de819ddbff337f8ea635e06e8219b32bd5dbfc256"}],"concept.eia.lubricants":[{"id":"assertion.concept.eia.lubricants","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lubricants as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lubricants as: Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","support":[{"end":22090,"quote":"Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":21707}],"target_id":"concept.eia.lubricants","target_kind":"node","target_sha256":"33fe6219803df1abb3f84438824fc07bc76096089252feae96b341b1bc61ecb9"}],"concept.eia.lumens-watt-lpw":[{"id":"assertion.concept.eia.lumens-watt-lpw","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lumens/Watt (lpw) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lumens/Watt (lpw) as: A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","support":[{"end":22585,"quote":"A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":22427}],"target_id":"concept.eia.lumens-watt-lpw","target_kind":"node","target_sha256":"370a46e95d43b19477904a12bce00d0319030ce06d4ed1dd8fbcfeca887b7cb4"}],"concept.eia.machine-drive-motors":[{"id":"assertion.concept.eia.machine-drive-motors","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Machine drive (motors) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Machine drive (motors) as: The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","support":[{"end":875,"quote":"The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":521}],"target_id":"concept.eia.machine-drive-motors","target_kind":"node","target_sha256":"5ca6076c432a85564600aaa2ce9d637069edbd24b3fec7e8050252751005ff05"}],"concept.eia.main-heating-fuel":[{"id":"assertion.concept.eia.main-heating-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Main heating fuel as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Main heating fuel as: The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","support":[{"end":2261,"quote":"The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":1710}],"target_id":"concept.eia.main-heating-fuel","target_kind":"node","target_sha256":"87213b090c8b32e1c85ea27b09e51bff4fd2d5cfdcb986310bc36c95ee045165"}],"concept.eia.mains":[{"id":"assertion.concept.eia.mains","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mains as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mains as: A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","support":[{"end":2416,"quote":"A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":2269}],"target_id":"concept.eia.mains","target_kind":"node","target_sha256":"a31496a534082d164f5a882664440e2784d9f667b3ceb0d675ea37f1ed7dddbb"}],"concept.eia.manufactured-gas":[{"id":"assertion.concept.eia.manufactured-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Manufactured gas as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Manufactured gas as: A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","support":[{"end":6765,"quote":"A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":6459}],"target_id":"concept.eia.manufactured-gas","target_kind":"node","target_sha256":"06caa710f62ed3aa7e7a7680d661e0e6eb490b6418b63c2e518820e60ccd6b9b"}],"concept.eia.marketed-production":[{"id":"assertion.concept.eia.marketed-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Marketed production as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Marketed production as: Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","support":[{"end":10261,"quote":"Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":10033}],"target_id":"concept.eia.marketed-production","target_kind":"node","target_sha256":"1badfe013217f4bab0e6d5d5b75a2452c72f299f72bccfdaf9ac5ecb9d731f58"}],"concept.eia.maximum-dependable-capacity-net":[{"id":"assertion.concept.eia.maximum-dependable-capacity-net","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Maximum dependable capacity, net as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Maximum dependable capacity, net as: The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","support":[{"end":11777,"quote":"The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":11609}],"target_id":"concept.eia.maximum-dependable-capacity-net","target_kind":"node","target_sha256":"9de9f3de961048a017f2fb3eb03462df8a6035e5b38182b8508bf7375841bd8a"}],"concept.eia.maximum-generator-nameplate-capacity":[{"id":"assertion.concept.eia.maximum-generator-nameplate-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Maximum generator nameplate capacity as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Maximum generator nameplate capacity as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","support":[{"end":12398,"quote":"The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":12242}],"target_id":"concept.eia.maximum-generator-nameplate-capacity","target_kind":"node","target_sha256":"8d06d83639c64da43e4901fce9abbf634c385592391e9b1d9b2a8a8a4f48a90c"}],"concept.eia.mean-power-output-of-a-wind-turbine":[{"id":"assertion.concept.eia.mean-power-output-of-a-wind-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mean power output (of a wind turbine) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mean power output (of a wind turbine) as: The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","support":[{"end":13302,"quote":"The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":13173}],"target_id":"concept.eia.mean-power-output-of-a-wind-turbine","target_kind":"node","target_sha256":"5ea5824635e4d92960116ab0e106d57e7c89af7a18159ead5e23d438892b2560"}],"concept.eia.medium-temperature-collector":[{"id":"assertion.concept.eia.medium-temperature-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Medium-temperature collector as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Medium-temperature collector as: A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","support":[{"end":16483,"quote":"A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":16075}],"target_id":"concept.eia.medium-temperature-collector","target_kind":"node","target_sha256":"40aca8eaa8fc61254a925e129b73b8c68d8b579949cf1efc9c3f5f7426e43a33"}],"concept.eia.microgroove":[{"id":"assertion.concept.eia.microgroove","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Microgroove as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Microgroove as: A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","support":[{"end":23090,"quote":"A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":22981}],"target_id":"concept.eia.microgroove","target_kind":"node","target_sha256":"b43796853508c9716130790b62eb55fe77b773d7a726d8f8aa21a6052665c269"}],"concept.eia.micrometer-or-micron":[{"id":"assertion.concept.eia.micrometer-or-micron","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Micrometer (or Micron) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Micrometer (or Micron) as: One-millionth of a meter. It can also be expressed as 10-6 meter.","support":[{"end":23180,"quote":"One-millionth of a meter. It can also be expressed as 10-6 meter.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":23115}],"target_id":"concept.eia.micrometer-or-micron","target_kind":"node","target_sha256":"8541c161a03ca0895327389280ae5c7027f534c33a46491083058ec95c4a5f05"}],"concept.eia.mill-feed":[{"id":"assertion.concept.eia.mill-feed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mill feed as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mill feed as: Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","support":[{"end":24956,"quote":"Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":24878}],"target_id":"concept.eia.mill-feed","target_kind":"node","target_sha256":"90ba0561dd603ca1d26b5be55fe93b0311322c7ebf4be75a3659ef485a0e0fbf"}],"concept.eia.milling-of-uranium":[{"id":"assertion.concept.eia.milling-of-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Milling of uranium as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Milling of uranium as: The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","support":[{"end":25420,"quote":"The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":25250}],"target_id":"concept.eia.milling-of-uranium","target_kind":"node","target_sha256":"818c21039d3d61043ed562839ecff147e4113c5c18f9eebb0d4ce6f5a2f56dfe"}],"concept.eia.mineral-matter-free-basis":[{"id":"assertion.concept.eia.mineral-matter-free-basis","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mineral-matter-free basis as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mineral-matter-free basis as: Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","support":[{"end":27624,"quote":"Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":27061}],"target_id":"concept.eia.mineral-matter-free-basis","target_kind":"node","target_sha256":"aada16f2be0245d174a6925c2fe11691af830dbe49cf4e4aa67203058e932ada"}],"concept.eia.minority-carrier":[{"id":"assertion.concept.eia.minority-carrier","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Minority carrier as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Minority carrier as: A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","support":[{"end":28418,"quote":"A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":28175}],"target_id":"concept.eia.minority-carrier","target_kind":"node","target_sha256":"0ed5b475deadb569c460677cb1cf73d5899f79d754b2630fd36d2e49ecf8ee44"}],"concept.eia.moderator":[{"id":"assertion.concept.eia.moderator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Moderator as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Moderator as: A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","support":[{"end":29753,"quote":"A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":29586}],"target_id":"concept.eia.moderator","target_kind":"node","target_sha256":"fbeef39f4c1703aa4fb1fd034fa7a83e83a4945cbc252fb52f9de12146f2c374"}],"concept.eia.motor-gasoline-blending":[{"id":"assertion.concept.eia.motor-gasoline-blending","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor gasoline blending as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor gasoline blending as: Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","support":[{"end":32878,"quote":"Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":32441}],"target_id":"concept.eia.motor-gasoline-blending","target_kind":"node","target_sha256":"2db3704197d0b9cc12d546059dd3c8cf624e8d6f83997489de0a11df60b290bb"}],"concept.eia.motor-gasoline-finished":[{"id":"assertion.concept.eia.motor-gasoline-finished","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor gasoline (finished) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor gasoline (finished) as: A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","support":[{"end":32415,"quote":"A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":31642}],"target_id":"concept.eia.motor-gasoline-finished","target_kind":"node","target_sha256":"2dd7cc74f2dad903087021ffa43bc24772cf7818a10d8df1474903bf277973d0"}],"concept.eia.motor-speed":[{"id":"assertion.concept.eia.motor-speed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor speed as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor speed as: The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","support":[{"end":33478,"quote":"The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":33373}],"target_id":"concept.eia.motor-speed","target_kind":"node","target_sha256":"92085871fcad3e6979c39ebac75bb8fbf714c6ed3c292c2b84f3d5f1044df1a0"}],"concept.eia.name-plate":[{"id":"assertion.concept.eia.name-plate","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Name plate as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Name plate as: A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","support":[{"end":1067,"quote":"A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":871}],"target_id":"concept.eia.name-plate","target_kind":"node","target_sha256":"a5f103a0929dbe7dc1ea8971d9f277570f144506015bd7d07b8d7781b307ef18"}],"concept.eia.naphtha-type-jet-fuel":[{"id":"assertion.concept.eia.naphtha-type-jet-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Naphtha-type jet fuel as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Naphtha-type jet fuel as: A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","support":[{"end":1900,"quote":"A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":1400}],"target_id":"concept.eia.naphtha-type-jet-fuel","target_kind":"node","target_sha256":"c2391f6f5c947de22a4147208ea9ec2e29cff69804da6875ec153a9458703adc"}],"concept.eia.naphthas":[{"id":"assertion.concept.eia.naphthas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Naphthas as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Naphthas as: Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","support":[{"end":2179,"quote":"Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":1936}],"target_id":"concept.eia.naphthas","target_kind":"node","target_sha256":"3e1280be793b534127ea2ccef21e41065488e31790457a397dc8a33c901c4e8f"}],"concept.eia.native-gas":[{"id":"assertion.concept.eia.native-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Native gas as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Native gas as: Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","support":[{"end":4364,"quote":"Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":4229}],"target_id":"concept.eia.native-gas","target_kind":"node","target_sha256":"c81740f9d9bca031b9b21e4e128d29f2b93809c8cf7eae315472dcd055112584"}],"concept.eia.natural-gas-marketed-production":[{"id":"assertion.concept.eia.natural-gas-marketed-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas marketed production as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas marketed production as: Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","support":[{"end":6306,"quote":"Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":6102}],"target_id":"concept.eia.natural-gas-marketed-production","target_kind":"node","target_sha256":"7411cb246b5dc925887c6bd95eca031012c189a6a089b1e12217d17d6ad000b0"}],"concept.eia.natural-gas-plant-liquids-ngpl":[{"id":"assertion.concept.eia.natural-gas-plant-liquids-ngpl","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas plant liquids (NGPL) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) as: Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","support":[{"end":7116,"quote":"Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":6965}],"target_id":"concept.eia.natural-gas-plant-liquids-ngpl","target_kind":"node","target_sha256":"bef9198e33833f7a95ba0aebf150297d327d4d55081ae92a8810aa1e5eef0883"}],"concept.eia.natural-gas-plant-liquids-ngpl-production":[{"id":"assertion.concept.eia.natural-gas-plant-liquids-ngpl-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas plant liquids (NGPL) production as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) production as: The extraction of gas plant liquids constituents such as","support":[{"end":7557,"quote":"The extraction of gas plant liquids constituents such as","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":7501}],"target_id":"concept.eia.natural-gas-plant-liquids-ngpl-production","target_kind":"node","target_sha256":"000bc548caed2b06ffa8b45133cd09ffc2c49df7451808a56c0abd27b00015dc"}],"concept.eia.natural-reservoir-pressure":[{"id":"assertion.concept.eia.natural-reservoir-pressure","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural reservoir pressure as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural reservoir pressure as: The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","support":[{"end":10378,"quote":"The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":9943}],"target_id":"concept.eia.natural-reservoir-pressure","target_kind":"node","target_sha256":"826f37d726de52011d23f27c545f319c4db8210793e64857d8b8fb7cfd1e2ce2"}],"concept.eia.natural-streamflow":[{"id":"assertion.concept.eia.natural-streamflow","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural streamflow as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural streamflow as: The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","support":[{"end":10595,"quote":"The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":10399}],"target_id":"concept.eia.natural-streamflow","target_kind":"node","target_sha256":"20f3c748accf28b406f86b5395b7413567eae1db4865333239877e9991d8cf21"}],"concept.eia.net-cell-shipments":[{"id":"assertion.concept.eia.net-cell-shipments","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net cell shipments as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net cell shipments as: Represents the difference between cell shipments and cell purchases.","support":[{"end":11500,"quote":"Represents the difference between cell shipments and cell purchases.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":11432}],"target_id":"concept.eia.net-cell-shipments","target_kind":"node","target_sha256":"1d8c1b981c3fcc6ad0452ce8390c8e9ebe01e4d6da4f90ab96207748bd2cb963"}],"concept.eia.net-energy-for-load-electric":[{"id":"assertion.concept.eia.net-energy-for-load-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net energy for load (electric) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net energy for load (electric) as: Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","support":[{"end":11972,"quote":"Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":11686}],"target_id":"concept.eia.net-energy-for-load-electric","target_kind":"node","target_sha256":"daf2088aa3cb7dc137c828aee6c90fca30277b927cd09292c9b6cf9a977ea4a1"}],"concept.eia.net-energy-for-system":[{"id":"assertion.concept.eia.net-energy-for-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net energy for system as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net energy for system as: The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","support":[{"end":12138,"quote":"The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12012}],"target_id":"concept.eia.net-energy-for-system","target_kind":"node","target_sha256":"49fec075cb615a2d59a5a0254aa3f392ce2aa342c73bf03b33bef00178a3a4bc"}],"concept.eia.net-generation":[{"id":"assertion.concept.eia.net-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net generation as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net generation as: The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","support":[{"end":12436,"quote":"The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12155}],"target_id":"concept.eia.net-generation","target_kind":"node","target_sha256":"fad882e57074e2be22c263e63bf1f92764a67896aa3ed80ef2ed1c99f648a773"}],"concept.eia.net-head":[{"id":"assertion.concept.eia.net-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net head as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net head as: The gross head minus all hydraulic losses except those chargeable to the turbine.","support":[{"end":12528,"quote":"The gross head minus all hydraulic losses except those chargeable to the turbine.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12447}],"target_id":"concept.eia.net-head","target_kind":"node","target_sha256":"52453b54135b52180cdc8075c7f0e899e00bb0fca230c6cc11f0d12c70265620"}],"concept.eia.net-module-shipments":[{"id":"assertion.concept.eia.net-module-shipments","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net module shipments as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net module shipments as: Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","support":[{"end":13750,"quote":"Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":13600}],"target_id":"concept.eia.net-module-shipments","target_kind":"node","target_sha256":"b457612113af19499cfa3e3714bb14d66f76f4104613645c9dfd3d2e8ae14752"}],"concept.eia.net-photovoltaic-module-shipment":[{"id":"assertion.concept.eia.net-photovoltaic-module-shipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net photovoltaic module shipment as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net photovoltaic module shipment as: The difference between photovoltaic module shipments and photovoltaic module purchases.","support":[{"end":13943,"quote":"The difference between photovoltaic module shipments and photovoltaic module purchases.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":13856}],"target_id":"concept.eia.net-photovoltaic-module-shipment","target_kind":"node","target_sha256":"69a336d54443045dae627030e2b4480d73264629ce097de7e576287c2d767061"}],"concept.eia.net-summer-capacity":[{"id":"assertion.concept.eia.net-summer-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net summer capacity as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net summer capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.) This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","support":[{"end":14898,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.)  This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":14570}],"target_id":"concept.eia.net-summer-capacity","target_kind":"node","target_sha256":"ab2ba461c45ca37591293468d23d9ab2d3ccff84e5e120e6e65f75f74da97237"}],"concept.eia.net-winter-capacity":[{"id":"assertion.concept.eia.net-winter-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net winter capacity as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net winter capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28). This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","support":[{"end":15251,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28).  This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":14920}],"target_id":"concept.eia.net-winter-capacity","target_kind":"node","target_sha256":"220f328353ac31950cbc82fe013f050527c8c27b8737378bd33f842a2aebe92c"}],"concept.eia.no-6-residual-fuel-oil":[{"id":"assertion.concept.eia.no-6-residual-fuel-oil","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"No. 6 Residual fuel oil as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines No. 6 Residual fuel oil as: Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes. See","support":[{"end":19896,"quote":"Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes.  See","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":19749}],"target_id":"concept.eia.no-6-residual-fuel-oil","target_kind":"node","target_sha256":"77f3c0cd6827fea654acdf47eb7d92bfe2920c6e448695572e614aaf5822c6ad"}],"concept.eia.noload-loss":[{"id":"assertion.concept.eia.noload-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Noload loss as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Noload loss as: Power and energy lost by an electric system when not operating under demand.","support":[{"end":20651,"quote":"Power and energy lost by an electric system when not operating under demand.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":20575}],"target_id":"concept.eia.noload-loss","target_kind":"node","target_sha256":"45cc1acfa15f49bc694ee3dab369faf3a137b056052c99540c671fb360203b26"}],"concept.eia.nonconventional-plant-uranium":[{"id":"assertion.concept.eia.nonconventional-plant-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonconventional plant (uranium) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonconventional plant (uranium) as: A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","support":[{"end":23553,"quote":"A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23252}],"target_id":"concept.eia.nonconventional-plant-uranium","target_kind":"node","target_sha256":"3af45404d9ef9abe91af270a8024f3ce507b9cb7805f512d172a72f732fce2f1"}],"concept.eia.nondedicated-vehicle":[{"id":"assertion.concept.eia.nondedicated-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nondedicated vehicle as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nondedicated vehicle as: A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","support":[{"end":23673,"quote":"A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23576}],"target_id":"concept.eia.nondedicated-vehicle","target_kind":"node","target_sha256":"23ae9b00147559afdb983ed31caff53c773a0eccde3272149165b939cccab4aa"}],"concept.eia.nonfuel-components":[{"id":"assertion.concept.eia.nonfuel-components","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonfuel components as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonfuel components as: Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","support":[{"end":24109,"quote":"Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23827}],"target_id":"concept.eia.nonfuel-components","target_kind":"node","target_sha256":"554942efba53f34c532d31d010e8bfd6cadad2cab192473d930f5fe8ee84ec68"}],"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv":[{"id":"assertion.concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonroad alternative fuel vehicle (nonroad AFV) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonroad alternative fuel vehicle (nonroad AFV) as: An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","support":[{"end":26281,"quote":"An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":25823}],"target_id":"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","target_kind":"node","target_sha256":"52714b598ca1b7fee54cd0e295880bf98db87bcf17607ed54df356b5c8ed7d24"}],"concept.eia.north-american-electric-reliability-corporation-nerc":[{"id":"assertion.concept.eia.north-american-electric-reliability-corporation-nerc","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"North American Electric Reliability Corporation (NERC) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines North American Electric Reliability Corporation (NERC) as: A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","support":[{"end":27995,"quote":"A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":27554}],"target_id":"concept.eia.north-american-electric-reliability-corporation-nerc","target_kind":"node","target_sha256":"d999780a014889df5676cee1d659b315b77a1578d749e152a2550082098bd288"}],"concept.eia.nuclear-electric-power-nuclear-power":[{"id":"assertion.concept.eia.nuclear-electric-power-nuclear-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear electric power (nuclear power) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear electric power (nuclear power) as: Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","support":[{"end":28566,"quote":"Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28456}],"target_id":"concept.eia.nuclear-electric-power-nuclear-power","target_kind":"node","target_sha256":"8c70c435bd826440be78f0d0c03b557841f2586394c2ac1b950d16e922742d8f"}],"concept.eia.nuclear-fuel":[{"id":"assertion.concept.eia.nuclear-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear fuel as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear fuel as: Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","support":[{"end":28798,"quote":"Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28581}],"target_id":"concept.eia.nuclear-fuel","target_kind":"node","target_sha256":"71e1bbc067d231e88e71a7d5b491e3210668a6aae3ca71452558413797fe3a0a"}],"concept.eia.nuclear-reactor":[{"id":"assertion.concept.eia.nuclear-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear reactor as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear reactor as: An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","support":[{"end":29248,"quote":"An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28816}],"target_id":"concept.eia.nuclear-reactor","target_kind":"node","target_sha256":"bee1805d8b20f27215922399f1230dbb41dfda0cc5a734dafb59b8ad15973efa"}],"concept.eia.number-of-mining-operations":[{"id":"assertion.concept.eia.number-of-mining-operations","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Number of mining operations as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Number of mining operations as: The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","support":[{"end":30140,"quote":"The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":29648}],"target_id":"concept.eia.number-of-mining-operations","target_kind":"node","target_sha256":"e69dd15466fcde5c5c47234e28c30c8b981573d04ae867f8d4d1f1b7466539dd"}],"concept.eia.ocean-thermal-energy-conversion-otec":[{"id":"assertion.concept.eia.ocean-thermal-energy-conversion-otec","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ocean thermal energy conversion (OTEC) as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ocean thermal energy conversion (OTEC) as: The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","support":[{"end":1206,"quote":"The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":881}],"target_id":"concept.eia.ocean-thermal-energy-conversion-otec","target_kind":"node","target_sha256":"779541445a5f9726eb3eba489c7ce12f501c5e1cea391f92d72ccf9cf408fd0a"}],"concept.eia.octane":[{"id":"assertion.concept.eia.octane","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Octane as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Octane as: A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","support":[{"end":1371,"quote":"A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1250}],"target_id":"concept.eia.octane","target_kind":"node","target_sha256":"acd94bfbed9ae22485b8c4cbc24cc69160ce800ea096ff0fdf0fe814c91be611"}],"concept.eia.octane-rating":[{"id":"assertion.concept.eia.octane-rating","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Octane rating as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Octane rating as: A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","support":[{"end":1804,"quote":"A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1387}],"target_id":"concept.eia.octane-rating","target_kind":"node","target_sha256":"554a863f5a75de86e4308d2fe16fa4403b513f69c2f7b8973b4d53cd01e0570b"}],"concept.eia.off-hours-equipment-reduction":[{"id":"assertion.concept.eia.off-hours-equipment-reduction","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off-hours equipment reduction as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off-hours equipment reduction as: A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","support":[{"end":2917,"quote":"A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":2705}],"target_id":"concept.eia.off-hours-equipment-reduction","target_kind":"node","target_sha256":"170de890c80885e9a32c023a23ca52156fc0896e833d4d94adf5129f18462383"}],"concept.eia.off-peak":[{"id":"assertion.concept.eia.off-peak","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off peak as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off peak as: Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","support":[{"end":2101,"quote":"Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1927}],"target_id":"concept.eia.off-peak","target_kind":"node","target_sha256":"6c7cbaf781ecca87fd7a97b8a8a72fc1402dd7cdb9d064ae00d58316d0bb6043"}],"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation":[{"id":"assertion.concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off-site produced energy for heat, power, and electricity generation as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off-site produced energy for heat, power, and electricity generation as: This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","support":[{"end":3208,"quote":"This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":2988}],"target_id":"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","target_kind":"node","target_sha256":"ccef3fbac0d48b61d42dac7298e1b29739b52e1aa53ee16e37671068828816c8"}],"concept.eia.ohm":[{"id":"assertion.concept.eia.ohm","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ohm as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ohm as: A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","support":[{"end":4573,"quote":"A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":4408}],"target_id":"concept.eia.ohm","target_kind":"node","target_sha256":"14dc996387bed245a011dd4b66a44db15d662d40bcfeb01b060aefc16b9d6c82"}],"concept.eia.oil-well":[{"id":"assertion.concept.eia.oil-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Oil well as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Oil well as: A well completed for the production of crude oil from at least one oil zone or reservoir.","support":[{"end":6450,"quote":"A well completed for the production of crude oil from at least one oil zone or reservoir.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":6361}],"target_id":"concept.eia.oil-well","target_kind":"node","target_sha256":"52db08d313e6bc6c000cd8d1f8b70f7eda72e0c98960003bf2f4494f4c0f9482"}],"concept.eia.oil-well-casing-head-gas":[{"id":"assertion.concept.eia.oil-well-casing-head-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Oil well (casing head) gas as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Oil well (casing head) gas as: Associated and dissolved gas produced along with crude oil from oil completions.","support":[{"end":6559,"quote":"Associated and dissolved gas produced along with crude oil from oil completions.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":6479}],"target_id":"concept.eia.oil-well-casing-head-gas","target_kind":"node","target_sha256":"6e1d9f6062582e9f2122c6502680606909d9d9082b4f6dfacf324802bd6fda40"}],"concept.finite-range-dark-force":[{"id":"assertion.complete.concept.finite-range-dark-force","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Intermediate-range self-interaction between dark-matter particles.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"concept.finite-range-dark-force","target_kind":"node","target_sha256":"615e5353cd7bb2e26096ddfb002e8b9c8c4ad2bb4a1142fcf26d53b3ffeb987e"}],"concept.fuzzy-dm-mass":[{"id":"assertion.complete.concept.fuzzy-dm-mass","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited Lyman-alpha analysis constrains the particle mass of extremely light bosonic dark-matter models, with lower limits that depend on assumptions about the intergalactic medium's thermal history.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"concept.fuzzy-dm-mass","target_kind":"node","target_sha256":"72935ccc56ccf234d5327abd8713baefc9f1b9536757613a296fb7992cf870df"}],"concept.go.go0000128":[{"id":"assertion.concept.go.go0000128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"flocculation as defined in the captured Gene Ontology term GO:0000128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines flocculation as: The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","support":[{"end":239,"quote":"The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","source_id":"quickgo.go_0000128","source_sha256":"133831b7d8cd4fae016821dd728adc8687bc3dd1ba072266e42ff87699e11f9e","start":111}],"target_id":"concept.go.go0000128","target_kind":"node","target_sha256":"91db7f279ea73ba0ad2e8f9e5b4ff37de7a501c6b5c186742a33606aef26c18f"}],"concept.go.go0000752":[{"id":"assertion.concept.go.go0000752","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"agglutination involved in conjugation with cellular fusion as defined in the captured Gene Ontology term GO:0000752","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines agglutination involved in conjugation with cellular fusion as: The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","support":[{"end":392,"quote":"The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","source_id":"quickgo.go_0000752","source_sha256":"fbfad18084bb49acd2198182d236061960de05db427a8a8ea574880d31d55c91","start":157}],"target_id":"concept.go.go0000752","target_kind":"node","target_sha256":"4baa410b2b0d043eae1df21352dd2aad4a331ec37936450e4447de77d69ecb09"}],"concept.go.go0000785":[{"id":"assertion.concept.go.go0000785","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chromatin as defined in the captured Gene Ontology term GO:0000785","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chromatin as: The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","support":[{"end":204,"quote":"The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","source_id":"quickgo.go_0000785","source_sha256":"3323470904d6724bcf8a14ebcc109592708836cd0d7340c6258724b18e43651d","start":108}],"target_id":"concept.go.go0000785","target_kind":"node","target_sha256":"423c19d1f79d61a0ee8b4240dad23aa40d8642165bcbe10fa8e89aca932e445f"}],"concept.go.go0000920":[{"id":"assertion.concept.go.go0000920","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"septum digestion after cytokinesis as defined in the captured Gene Ontology term GO:0000920","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines septum digestion after cytokinesis as: The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","support":[{"end":286,"quote":"The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","source_id":"quickgo.go_0000920","source_sha256":"c5dff0ead6c521764be1c028788cfc608bdc3ba76e317141eba4a43ddd21a0fa","start":133}],"target_id":"concept.go.go0000920","target_kind":"node","target_sha256":"22246ca0c72d910aac3d48f29002f9ac4a87f496f379463ae654a178f164e5d7"}],"concept.go.go0001400":[{"id":"assertion.concept.go.go0001400","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mating projection base as defined in the captured Gene Ontology term GO:0001400","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating projection base as: The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","support":[{"end":237,"quote":"The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","source_id":"quickgo.go_0001400","source_sha256":"7bfdf865c6e055bd089fcdcfeeeaf071d857c19f5cd8b09473a1df274a2b6905","start":121}],"target_id":"concept.go.go0001400","target_kind":"node","target_sha256":"069db0c222d2b37fa7b9562d159bdf7a5fb51df87668c8f5584d85ef6c36c70d"}],"concept.go.go0001503":[{"id":"assertion.concept.go.go0001503","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ossification as defined in the captured Gene Ontology term GO:0001503","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ossification as: The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","support":[{"end":239,"quote":"The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","source_id":"quickgo.go_0001503","source_sha256":"88151678dae21158303aa07252c3078a61db63a7f7bfacf7ba294242b8bac6b3","start":111}],"target_id":"concept.go.go0001503","target_kind":"node","target_sha256":"05dc5cebb47b3207b39fc641b9391ff81535fc8675e88bd66d0a43df3f52c392"}],"concept.go.go0001650":[{"id":"assertion.concept.go.go0001650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fibrillar center as defined in the captured Gene Ontology term GO:0001650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fibrillar center as: A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","support":[{"end":367,"quote":"A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","source_id":"quickgo.go_0001650","source_sha256":"023f5bde3b0c4cf590e6914ed0ac4d7b7ebfe849d8edd94b9a476b6eba6a6e10","start":115}],"target_id":"concept.go.go0001650","target_kind":"node","target_sha256":"bfaccad00cfe4dd146b6ad38b57b81b55cd3c9ce14d2893bda8cebceb9e93252"}],"concept.go.go0001651":[{"id":"assertion.concept.go.go0001651","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dense fibrillar component as defined in the captured Gene Ontology term GO:0001651","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense fibrillar component as: A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","support":[{"end":250,"quote":"A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","source_id":"quickgo.go_0001651","source_sha256":"4269b3d3ff6f781e3733ab91b8a6975ddfda7338aa0923cda829322b3f17ebfd","start":124}],"target_id":"concept.go.go0001651","target_kind":"node","target_sha256":"3725eeaba33e988cfbfd5fdee83c1ac9f1c9c89e91aa3cd85529315648de1481"}],"concept.go.go0001652":[{"id":"assertion.concept.go.go0001652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granular component as defined in the captured Gene Ontology term GO:0001652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines granular component as: A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","support":[{"end":235,"quote":"A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","source_id":"quickgo.go_0001652","source_sha256":"ebade7eab3e5a304590c8651a5254c63deb7217402c4395ef49c6dd89ed09073","start":117}],"target_id":"concept.go.go0001652","target_kind":"node","target_sha256":"61582e7ad34e7c154e796cadb2bae156028e047bd7cf9696b940035a706c9e0d"}],"concept.go.go0001750":[{"id":"assertion.concept.go.go0001750","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor outer segment as defined in the captured Gene Ontology term GO:0001750","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor outer segment as: The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","support":[{"end":251,"quote":"The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","source_id":"quickgo.go_0001750","source_sha256":"e7857a98cf7afc637573c39f55f84a97c64ad2ce8bc4f5ade9019dc79a3944b9","start":126}],"target_id":"concept.go.go0001750","target_kind":"node","target_sha256":"f843024a0ebb2e48fe1597aafc43cb0085be613d1c8cd1a8fbbabc5e599a651c"}],"concept.go.go0001763":[{"id":"assertion.concept.go.go0001763","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"morphogenesis of a branching structure as defined in the captured Gene Ontology term GO:0001763","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines morphogenesis of a branching structure as: The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","support":[{"end":388,"quote":"The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","source_id":"quickgo.go_0001763","source_sha256":"4dd3e26ed7f3fb3de0b24699fb091bf0285eb36f2cb317ab687f33d07eb05bc0","start":137}],"target_id":"concept.go.go0001763","target_kind":"node","target_sha256":"cb9754620c2580762370bf1d7ae29c492757c7e231c2ef63af4bb4d465cea835"}],"concept.go.go0001772":[{"id":"assertion.concept.go.go0001772","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immunological synapse as defined in the captured Gene Ontology term GO:0001772","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological synapse as: An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","support":[{"end":618,"quote":"An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","source_id":"quickgo.go_0001772","source_sha256":"78f77ad5cc8f1ea1baf603246abd38d921605f4782cace5f9c3a0446ea6a1a97","start":120}],"target_id":"concept.go.go0001772","target_kind":"node","target_sha256":"de23431e8291ef36da26d1da6605bdfdda8ee848a9aa3ce6f131e78d178b3d30"}],"concept.go.go0001775":[{"id":"assertion.concept.go.go0001775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell activation as defined in the captured Gene Ontology term GO:0001775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell activation as: A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","support":[{"end":288,"quote":"A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","source_id":"quickgo.go_0001775","source_sha256":"45b9b77cbfaa684e854e5cc920ce91bb82a8187a4e3dbb50b7ebf226ba5c0c5d","start":114}],"target_id":"concept.go.go0001775","target_kind":"node","target_sha256":"be3c5e78d685736933c823870393f75466a601f749282702b45d59e54f2552dc"}],"concept.go.go0001776":[{"id":"assertion.concept.go.go0001776","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte homeostasis as defined in the captured Gene Ontology term GO:0001776","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte homeostasis as: The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","support":[{"end":368,"quote":"The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","source_id":"quickgo.go_0001776","source_sha256":"4857f76462593e533728efcb882534e3ae7c6210a08434634cc1629cc0e5bebb","start":120}],"target_id":"concept.go.go0001776","target_kind":"node","target_sha256":"c9ac8db1197229f6f36bbb81bd2d6b2173c4476200654814ac3e7e84d70ff1b8"}],"concept.go.go0001816":[{"id":"assertion.concept.go.go0001816","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytokine production as defined in the captured Gene Ontology term GO:0001816","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytokine production as: The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":281,"quote":"The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0001816","source_sha256":"a2fec123a21d81fb16c8a880281c263583b91e86d191a905273d781a1267dbf8","start":118}],"target_id":"concept.go.go0001816","target_kind":"node","target_sha256":"c39950d769598e76876272aa28b749d788074ce936e52eecec235ba64311f4ff"}],"concept.go.go0001891":[{"id":"assertion.concept.go.go0001891","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phagocytic cup as defined in the captured Gene Ontology term GO:0001891","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines phagocytic cup as: An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","support":[{"end":267,"quote":"An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","source_id":"quickgo.go_0001891","source_sha256":"be6f4be79946f1f892c390d21b135d3ee273887279be37394d8eef719e9d476b","start":113}],"target_id":"concept.go.go0001891","target_kind":"node","target_sha256":"2be1756e620f87f5ffbe7429bf15dd25e3feabc0c490c08e49c411de8fb40f54"}],"concept.go.go0001906":[{"id":"assertion.concept.go.go0001906","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell killing as defined in the captured Gene Ontology term GO:0001906","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell killing as: Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","support":[{"end":421,"quote":"Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","source_id":"quickgo.go_0001906","source_sha256":"a9c4157bb8e02a81ca3ba22a8150234c6e4d63578d8e9f6f6fa5876b06f48a5c","start":111}],"target_id":"concept.go.go0001906","target_kind":"node","target_sha256":"059526c4ca333952608076a7aa5334cb0d43e152135256176eac8472bd3974b7"}],"concept.go.go0001917":[{"id":"assertion.concept.go.go0001917","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor inner segment as defined in the captured Gene Ontology term GO:0001917","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor inner segment as: The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","support":[{"end":308,"quote":"The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","source_id":"quickgo.go_0001917","source_sha256":"3d0fd703a785ddde53f3d0746342cbd0fff9a4e7e16ca6113f14d4545c05d37f","start":126}],"target_id":"concept.go.go0001917","target_kind":"node","target_sha256":"6a30bfc5c43509ee2f5e204d20d7562705df4f47e8a48d74c71a0eb2ace47107"}],"concept.go.go0002200":[{"id":"assertion.concept.go.go0002200","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"somatic diversification of immune receptors as defined in the captured Gene Ontology term GO:0002200","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines somatic diversification of immune receptors as: The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","support":[{"end":277,"quote":"The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","source_id":"quickgo.go_0002200","source_sha256":"caa0a4ea00df074c831c4c9f4420e26e9d7e58471f5e71c66e448459b277afb6","start":142}],"target_id":"concept.go.go0002200","target_kind":"node","target_sha256":"6cf7b927fcad092c7f9bc5b85de5a00902de4051c96eab155a80a664a3cb8aa8"}],"concept.go.go0002252":[{"id":"assertion.concept.go.go0002252","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune effector process as defined in the captured Gene Ontology term GO:0002252","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune effector process as: Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","support":[{"end":264,"quote":"Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","source_id":"quickgo.go_0002252","source_sha256":"0ed0b3e6161ce29b143403894bd347fa82aec82ac7fcad1c19772e45d9277020","start":122}],"target_id":"concept.go.go0002252","target_kind":"node","target_sha256":"6931aeb0b31a2e397de5b78e24f8f3d786f310662542c607802cad199dfa4102"}],"concept.go.go0002253":[{"id":"assertion.concept.go.go0002253","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"activation of immune response as defined in the captured Gene Ontology term GO:0002253","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines activation of immune response as: Any process that initiates an immune response.","support":[{"end":174,"quote":"Any process that initiates an immune response.","source_id":"quickgo.go_0002253","source_sha256":"96651db579a723eb33c663789fe80a1a1d45d5a3e94d53f8c25b2b67c7d89f00","start":128}],"target_id":"concept.go.go0002253","target_kind":"node","target_sha256":"a18c076c66532e6dbf2cd58284ff8367636450748f59b3f3ce230ae3ea3d0f1e"}],"concept.go.go0002262":[{"id":"assertion.concept.go.go0002262","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myeloid cell homeostasis as defined in the captured Gene Ontology term GO:0002262","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myeloid cell homeostasis as: The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","support":[{"end":340,"quote":"The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","source_id":"quickgo.go_0002262","source_sha256":"ebfc5516c2e27e059c24c7960bbcce80a8dcf8bb68898087709ec6b35c7e5203","start":123}],"target_id":"concept.go.go0002262","target_kind":"node","target_sha256":"969489fcf0492836c55f9749cc48156d89f3bfa6577ca936c45b48e437392ac2"}],"concept.go.go0002339":[{"id":"assertion.concept.go.go0002339","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"B cell selection as defined in the captured Gene Ontology term GO:0002339","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines B cell selection as: The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","support":[{"end":263,"quote":"The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","source_id":"quickgo.go_0002339","source_sha256":"93c1172cf54d69c2d788746914f5597de46feaff2a0739344e08f0dbba465847","start":115}],"target_id":"concept.go.go0002339","target_kind":"node","target_sha256":"c6b146465a623cb25760a02712165943e14e8c6be6f42c41143068820e2144b7"}],"concept.go.go0002376":[{"id":"assertion.concept.go.go0002376","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune system process as defined in the captured Gene Ontology term GO:0002376","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system process as: Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","support":[{"end":285,"quote":"Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","source_id":"quickgo.go_0002376","source_sha256":"b61888bc91aea1d3c452427cad9a1f026706796a6fb665bdca5e31f1f827e0de","start":120}],"target_id":"concept.go.go0002376","target_kind":"node","target_sha256":"d87fe0923bd9079fefe464b4221527e2afe8e31be2476fa7181b4a4481e19194"}],"concept.go.go0002404":[{"id":"assertion.concept.go.go0002404","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"antigen sampling in mucosal-associated lymphoid tissue as defined in the captured Gene Ontology term GO:0002404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen sampling in mucosal-associated lymphoid tissue as: The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","support":[{"end":284,"quote":"The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","source_id":"quickgo.go_0002404","source_sha256":"41dcda14ccacbf5cf652a54bd9e55897c8c9a7480158d0593b0dccbc12391a76","start":153}],"target_id":"concept.go.go0002404","target_kind":"node","target_sha256":"a324048649163e04e799524cf0b9aa53b8240d2ee18299fe5d868e80d274ed9c"}],"concept.go.go0002440":[{"id":"assertion.concept.go.go0002440","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"production of molecular mediator of immune response as defined in the captured Gene Ontology term GO:0002440","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator of immune response as: The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":295,"quote":"The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0002440","source_sha256":"4e5dc358afc8e2d7d9ca92743e95936f18bb00687a698982a14cfa31d17b299a","start":150}],"target_id":"concept.go.go0002440","target_kind":"node","target_sha256":"9f02fa5df331a1836de265ec829653628e5216414afd44652d5b5d84bf3cc07a"}],"concept.go.go0002507":[{"id":"assertion.concept.go.go0002507","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tolerance induction as defined in the captured Gene Ontology term GO:0002507","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tolerance induction as: A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","support":[{"end":369,"quote":"A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","source_id":"quickgo.go_0002507","source_sha256":"975334330913935447fe8ac791bcc56c8c8adeac54be33a8059ebe87ee30d6ea","start":118}],"target_id":"concept.go.go0002507","target_kind":"node","target_sha256":"3ecbb5d5ad56d197822156b26fce07804e3fb619a6c3eecd0336d6c323fd1bf6"}],"concept.go.go0002520":[{"id":"assertion.concept.go.go0002520","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune system development as defined in the captured Gene Ontology term GO:0002520","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system development as: The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","support":[{"end":507,"quote":"The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","source_id":"quickgo.go_0002520","source_sha256":"6a1797d8dd55730315ba548df939e66eefbc361dcfefddcbc8b68d37824f8c59","start":124}],"target_id":"concept.go.go0002520","target_kind":"node","target_sha256":"8a246772cad1ba5b71189f4ef27e359c81510e3d4df0d69a85afffaf60b699fd"}],"concept.go.go0002532":[{"id":"assertion.concept.go.go0002532","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"production of molecular mediator involved in inflammatory response as defined in the captured Gene Ontology term GO:0002532","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator involved in inflammatory response as: The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":351,"quote":"The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0002532","source_sha256":"9ca39ac49372ec0da4804fdbff317bfef9e0a6531ff5310190d5e7c43b2dd161","start":165}],"target_id":"concept.go.go0002532","target_kind":"node","target_sha256":"16c38ce8c1b349d9e6faf7b8075077e9d6e0344f69e8a96c686f3fffa1bf250e"}],"concept.go.go0003006":[{"id":"assertion.concept.go.go0003006","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental process involved in reproduction as defined in the captured Gene Ontology term GO:0003006","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process involved in reproduction as: A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","support":[{"end":320,"quote":"A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","source_id":"quickgo.go_0003006","source_sha256":"915e429e719890a103ac9c04cdce740c4e3df1b599e6f6899c34ab45c57dc808","start":145}],"target_id":"concept.go.go0003006","target_kind":"node","target_sha256":"f6c137f0ee554f1e8f9d01634594af6ed6c49681dd63ce23c4a23641bb48ad9b"}],"concept.go.go0003008":[{"id":"assertion.concept.go.go0003008","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"system process as defined in the captured Gene Ontology term GO:0003008","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines system process as: A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","support":[{"end":355,"quote":"A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","source_id":"quickgo.go_0003008","source_sha256":"f61081792fc4229c13c71ce9513da7618f734476706c63109b1aa6bf2e0d4e79","start":113}],"target_id":"concept.go.go0003008","target_kind":"node","target_sha256":"3c6b9833a8b8ee6da23161bd9459494bcc7c0ccab444800190a80f8792619297"}],"concept.go.go0005576":[{"id":"assertion.concept.go.go0005576","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extracellular region as defined in the captured Gene Ontology term GO:0005576","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular region as: The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","support":[{"end":381,"quote":"The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","source_id":"quickgo.go_0005576","source_sha256":"1a5bc80b1690033f9e769eac2dfa341411ff3c983c7e3b3121e68923bf5e1173","start":119}],"target_id":"concept.go.go0005576","target_kind":"node","target_sha256":"74a05cf05864e4ca125b790e44a01cba09435ae49bd37577da639d4a5cfbdcb0"}],"concept.go.go0005630":[{"id":"assertion.concept.go.go0005630","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dityrosine layer of spore wall as defined in the captured Gene Ontology term GO:0005630","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dityrosine layer of spore wall as: The outermost layer of the spore wall, as described in Saccharomyces.","support":[{"end":198,"quote":"The outermost layer of the spore wall, as described in Saccharomyces.","source_id":"quickgo.go_0005630","source_sha256":"73f37b2c9f4e8caae28ff2eba0e5895f662e51be6c122a57ca0f376cacf298f1","start":129}],"target_id":"concept.go.go0005630","target_kind":"node","target_sha256":"72b43eb17964c55e8fbed9f189a5d7154b653b4d86a588c83989e2ceaf49c45e"}],"concept.go.go0005631":[{"id":"assertion.concept.go.go0005631","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chitosan layer of spore wall as defined in the captured Gene Ontology term GO:0005631","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chitosan layer of spore wall as: The second outermost layer of the spore wall, as described in Saccharomyces.","support":[{"end":203,"quote":"The second outermost layer of the spore wall, as described in Saccharomyces.","source_id":"quickgo.go_0005631","source_sha256":"742f8a446cecd184ddde0cc46a96b2921c8844a61b19d17220f918f00fbfd73e","start":127}],"target_id":"concept.go.go0005631","target_kind":"node","target_sha256":"d92c308df788774804516ba24ae460662445ce701091346d96cea2ad1fd3e359"}],"concept.go.go0005652":[{"id":"assertion.concept.go.go0005652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nuclear lamina as defined in the captured Gene Ontology term GO:0005652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear lamina as: The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","support":[{"end":616,"quote":"The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","source_id":"quickgo.go_0005652","source_sha256":"a248198282d8b57e2f32a6aa521373f7a68a0b4ebdeb8b502352718c2f9caa06","start":113}],"target_id":"concept.go.go0005652","target_kind":"node","target_sha256":"e173783cbe7cb4050c109e69fd7155e50d8dcfababb5e87dbae8775ae06bdec1"}],"concept.go.go0005654":[{"id":"assertion.concept.go.go0005654","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nucleoplasm as defined in the captured Gene Ontology term GO:0005654","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasm as: That part of the nuclear content other than the chromosomes or the nucleolus.","support":[{"end":187,"quote":"That part of the nuclear content other than the chromosomes or the nucleolus.","source_id":"quickgo.go_0005654","source_sha256":"1c79b7b646130368e28482eb70e8a44e70bbd59312e47d12c64bc1dea098ea96","start":110}],"target_id":"concept.go.go0005654","target_kind":"node","target_sha256":"44b850892af1961e78f2018fcc330ab111a057348a6d31c351415c13a25943e0"}],"concept.go.go0005825":[{"id":"assertion.concept.go.go0005825","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"half bridge of spindle pole body as defined in the captured Gene Ontology term GO:0005825","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines half bridge of spindle pole body as: Structure adjacent to the plaques of the spindle pole body.","support":[{"end":190,"quote":"Structure adjacent to the plaques of the spindle pole body.","source_id":"quickgo.go_0005825","source_sha256":"030b2d54f76c8faa514067bf97645c96dca2b726cb68ceb8d73ea90229a92caf","start":131}],"target_id":"concept.go.go0005825","target_kind":"node","target_sha256":"7412b26df3454aba112d2e8cc01000d35dd579827734c97043f0a0afaa096f6c"}],"concept.go.go0005829":[{"id":"assertion.concept.go.go0005829","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytosol as defined in the captured Gene Ontology term GO:0005829","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosol as: The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","support":[{"end":240,"quote":"The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","source_id":"quickgo.go_0005829","source_sha256":"a1826f9605f4082b76143c0a6f7d92e3e743c498bda07e56e04d9db0bf2aef5c","start":106}],"target_id":"concept.go.go0005829","target_kind":"node","target_sha256":"9233d1545b9c77548faec0d37d291fc0ef7d84191fcf6380f78ff86fe0687de2"}],"concept.go.go0006276":[{"id":"assertion.concept.go.go0006276","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasmid maintenance as defined in the captured Gene Ontology term GO:0006276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasmid maintenance as: The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","support":[{"end":279,"quote":"The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","source_id":"quickgo.go_0006276","source_sha256":"e33daf065ad720a74d44377bbe00509380d3d3dc749987b12b0ce86f16a8653a","start":118}],"target_id":"concept.go.go0006276","target_kind":"node","target_sha256":"e0b9787b7d1c962003014fc187170982d1ac348a4361c18efb3cd8b6f61fdc96"}],"concept.go.go0006457":[{"id":"assertion.concept.go.go0006457","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein folding as defined in the captured Gene Ontology term GO:0006457","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein folding as: The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","support":[{"end":271,"quote":"The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","source_id":"quickgo.go_0006457","source_sha256":"deb133d5183ee042e3da3553bdc59d07ebc4f29d3c8f1aa41e74001e14335811","start":114}],"target_id":"concept.go.go0006457","target_kind":"node","target_sha256":"0e1ab1fe22951f2c7b27e902208961dbeee4b43511de910ba954646ec82d8942"}],"concept.go.go0006515":[{"id":"assertion.concept.go.go0006515","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein quality control as defined in the captured Gene Ontology term GO:0006515","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein quality control as: The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","support":[{"end":385,"quote":"The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","source_id":"quickgo.go_0006515","source_sha256":"1eb6d9113147d9f7c0af499f408cfb15dece9fd5d55148618b1710d36bf93781","start":122}],"target_id":"concept.go.go0006515","target_kind":"node","target_sha256":"59f75392b2321204ca75574fbdcb2c20a9a5f28a36b6c686949a2ba1062fb6ec"}],"concept.go.go0006955":[{"id":"assertion.concept.go.go0006955","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune response as defined in the captured Gene Ontology term GO:0006955","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune response as: Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","support":[{"end":240,"quote":"Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","source_id":"quickgo.go_0006955","source_sha256":"9471658faa59d6d352a73660f12af97d315286fb1fa4416046c19105f62466f1","start":114}],"target_id":"concept.go.go0006955","target_kind":"node","target_sha256":"659e325aef18dd829f1c7eb4d37297fd1c11d081b6a3bf5cdfd02015068447b5"}],"concept.go.go0007017":[{"id":"assertion.concept.go.go0007017","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microtubule-based process as defined in the captured Gene Ontology term GO:0007017","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule-based process as: Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","support":[{"end":287,"quote":"Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","source_id":"quickgo.go_0007017","source_sha256":"efba1cfaf785cc5740950a940979931d7a1da929d46b2fa0d1d8f481f588a5fc","start":124}],"target_id":"concept.go.go0007017","target_kind":"node","target_sha256":"6535fe210df6aa6fb5a10d86266b2dea4e37ddce8194a0b2452571df52de6056"}],"concept.go.go0007049":[{"id":"assertion.concept.go.go0007049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle as defined in the captured Gene Ontology term GO:0007049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle as: The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","support":[{"end":505,"quote":"The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","source_id":"quickgo.go_0007049","source_sha256":"8b8e871b3da14205b3b4e173f419ebf955756e7a6babdf2f960f37208aa4a798","start":109}],"target_id":"concept.go.go0007049","target_kind":"node","target_sha256":"84b57f0594f0840ba0aa45c21f4ba4b8f13d5bade1c906ab77bcc2bb9d2f23b0"}],"concept.go.go0007117":[{"id":"assertion.concept.go.go0007117","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"budding cell bud growth as defined in the captured Gene Ontology term GO:0007117","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines budding cell bud growth as: The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","support":[{"end":320,"quote":"The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","source_id":"quickgo.go_0007117","source_sha256":"cf43c9cb0e7d99173233610bf3980d4a4843dabad34c984a449ed23c3449035a","start":122}],"target_id":"concept.go.go0007117","target_kind":"node","target_sha256":"d69f9c91d193bc9459fb423d3a48abd9f2522db4b913a55611dd75f39d746585"}],"concept.go.go0007154":[{"id":"assertion.concept.go.go0007154","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell communication as defined in the captured Gene Ontology term GO:0007154","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell communication as: Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","support":[{"end":387,"quote":"Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","source_id":"quickgo.go_0007154","source_sha256":"a6538c8bb6e7242c43cf738b306743681f9e7445e34ba86c23bf61784ae13ff5","start":117}],"target_id":"concept.go.go0007154","target_kind":"node","target_sha256":"d4ce6e59a8b4a4d882b77dcd958ebc378b7cac29801dcc8771e1183f538e864c"}],"concept.go.go0007155":[{"id":"assertion.concept.go.go0007155","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell adhesion as defined in the captured Gene Ontology term GO:0007155","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion as: The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","support":[{"end":253,"quote":"The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","source_id":"quickgo.go_0007155","source_sha256":"31ee4cac91af2e2e80ee53a8a6a288c9433ff83e865d4a9c9267e043fc0a343c","start":112}],"target_id":"concept.go.go0007155","target_kind":"node","target_sha256":"403155940783e98ceea6bf9e53b149ec428bcff441fca794da2546dc09153baa"}],"concept.go.go0007165":[{"id":"assertion.concept.go.go0007165","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"signal transduction as defined in the captured Gene Ontology term GO:0007165","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines signal transduction as: The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","support":[{"end":885,"quote":"The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","source_id":"quickgo.go_0007165","source_sha256":"dac929861fbd68dc33b198d4d4ad5db35c0762fc70e366a0b081dd3abafbd596","start":118}],"target_id":"concept.go.go0007165","target_kind":"node","target_sha256":"a8c46d3e39b5b71bb61a679f7b6732925f5ecf9ba23f2ffe1576083fe66f204e"}],"concept.go.go0007272":[{"id":"assertion.concept.go.go0007272","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ensheathment of neurons as defined in the captured Gene Ontology term GO:0007272","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ensheathment of neurons as: The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","support":[{"end":296,"quote":"The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","source_id":"quickgo.go_0007272","source_sha256":"e957c9ae7478f77ba2ba82628eca1de8a149c85631bc2b1a8765b40c4db02c55","start":122}],"target_id":"concept.go.go0007272","target_kind":"node","target_sha256":"ce901b8500b3b43cd4364893bed5beccdd9bae4f3a4f552134990c838dd67cd8"}],"concept.go.go0007275":[{"id":"assertion.concept.go.go0007275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism development as defined in the captured Gene Ontology term GO:0007275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism development as: The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","support":[{"end":363,"quote":"The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","source_id":"quickgo.go_0007275","source_sha256":"d48f7800ade299d58ac277ccc9d2bf34438c6e9474592dfd442c331bf675a9fe","start":133}],"target_id":"concept.go.go0007275","target_kind":"node","target_sha256":"e8b78c94125726754c123a3b80af0e28c96f7eb3c2df37e70c026b0000afe8c9"}],"concept.go.go0007340":[{"id":"assertion.concept.go.go0007340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acrosome reaction as defined in the captured Gene Ontology term GO:0007340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acrosome reaction as: The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","support":[{"end":428,"quote":"The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","source_id":"quickgo.go_0007340","source_sha256":"9935cea7223098c44191a4dc44bff3dd5340df8e93b1b6a6fa834e8dfb494cde","start":116}],"target_id":"concept.go.go0007340","target_kind":"node","target_sha256":"4c8cf3231cf8d5dc2545fffda08acf07c41d4db40a1f96225fc6c1e0018ab71d"}],"concept.go.go0007389":[{"id":"assertion.concept.go.go0007389","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pattern specification process as defined in the captured Gene Ontology term GO:0007389","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pattern specification process as: Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","support":[{"end":299,"quote":"Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","source_id":"quickgo.go_0007389","source_sha256":"63fb7cd5a8ca46808ba372c95d5ccf3ec57e81d412d13a9c56e8900b36d9f4d9","start":128}],"target_id":"concept.go.go0007389","target_kind":"node","target_sha256":"032c016b52e8e9984e4ca4222c9a7f37fab23c622b23443eaa4d71f252fa68e8"}],"concept.go.go0007566":[{"id":"assertion.concept.go.go0007566","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"embryo implantation as defined in the captured Gene Ontology term GO:0007566","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines embryo implantation as: Attachment of the blastocyst to the uterine lining.","support":[{"end":169,"quote":"Attachment of the blastocyst to the uterine lining.","source_id":"quickgo.go_0007566","source_sha256":"55cd9055141539cd1fdcae8cef590b51d3cb69aec70b2a2c625515351ab7b792","start":118}],"target_id":"concept.go.go0007566","target_kind":"node","target_sha256":"62e19a181cf7a00428e3bd5ff09c97790050573546d1dd0ad211ad90ae0ef31a"}],"concept.go.go0007586":[{"id":"assertion.concept.go.go0007586","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"digestion as defined in the captured Gene Ontology term GO:0007586","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines digestion as: The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","support":[{"end":316,"quote":"The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","source_id":"quickgo.go_0007586","source_sha256":"d9ff5fec1a6cb1d789df4d4548888fa897298354ef9eb6ddc77b10bc75dc25d2","start":108}],"target_id":"concept.go.go0007586","target_kind":"node","target_sha256":"f1446564cce7ed902a16cc4e935a2f95c433b0024d5263502b3e70aba46467aa"}],"concept.go.go0007623":[{"id":"assertion.concept.go.go0007623","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"circadian rhythm as defined in the captured Gene Ontology term GO:0007623","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines circadian rhythm as: Any biological process in an organism that recurs with a regularity of approximately 24 hours.","support":[{"end":209,"quote":"Any biological process in an organism that recurs with a regularity of approximately 24 hours.","source_id":"quickgo.go_0007623","source_sha256":"8f4e5cd2a10550079c41ebe9d577c897c6d32190d0b796b4848baea7be237172","start":115}],"target_id":"concept.go.go0007623","target_kind":"node","target_sha256":"9bea45ba5338fed25ba94caa1472ea04052bb52cf23eeb9943c7631fd2d778a9"}],"concept.go.go0007624":[{"id":"assertion.concept.go.go0007624","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ultradian rhythm as defined in the captured Gene Ontology term GO:0007624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ultradian rhythm as: The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","support":[{"end":227,"quote":"The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","source_id":"quickgo.go_0007624","source_sha256":"8593049eac461738f7cfb60e776c95367013ecd5ac01a6bbf9d98555f84ef7d6","start":115}],"target_id":"concept.go.go0007624","target_kind":"node","target_sha256":"38f3608986071aed7f4640d53028e90794e6f2719b7c314adbd333a894fb9f53"}],"concept.go.go0008037":[{"id":"assertion.concept.go.go0008037","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell recognition as defined in the captured Gene Ontology term GO:0008037","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell recognition as: The process in which a cell in an organism interprets its surroundings.","support":[{"end":186,"quote":"The process in which a cell in an organism interprets its surroundings.","source_id":"quickgo.go_0008037","source_sha256":"98f81e6bc07d8bc46557a8e12a7c3715601b936a9317ff6ac076ff44c3355729","start":115}],"target_id":"concept.go.go0008037","target_kind":"node","target_sha256":"0a67653f7c6abf5e5bc679855bf6f75f4f5415f57e5ab445984032097feab409"}],"concept.go.go0008152":[{"id":"assertion.concept.go.go0008152","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metabolic process as defined in the captured Gene Ontology term GO:0008152","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines metabolic process as: A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","support":[{"end":498,"quote":"A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well  macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","source_id":"quickgo.go_0008152","source_sha256":"c573fc911e654d958aca908731dfc89e2d990dbd2866cfba3c4d4ac907acc8d9","start":116}],"target_id":"concept.go.go0008152","target_kind":"node","target_sha256":"ccfaf5aa79abdb1a66d29552d86df29219d285bd89a1eb775e166fd2326f052d"}],"concept.go.go0008219":[{"id":"assertion.concept.go.go0008219","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell death as defined in the captured Gene Ontology term GO:0008219","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell death as: Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","support":[{"end":786,"quote":"Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","source_id":"quickgo.go_0008219","source_sha256":"654739e23b44a6ac847da4419b23d8cf6e73a5f553f787b2e32fd02d299ab835","start":109}],"target_id":"concept.go.go0008219","target_kind":"node","target_sha256":"73815e1476759ca9f421adde1791fde42f02202efb46015f961769de33f4c820"}],"concept.go.go0008283":[{"id":"assertion.concept.go.go0008283","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell population proliferation as defined in the captured Gene Ontology term GO:0008283","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell population proliferation as: The multiplication or reproduction of cells, resulting in the expansion of a cell population.","support":[{"end":221,"quote":"The multiplication or reproduction of cells, resulting in the expansion of a cell population.","source_id":"quickgo.go_0008283","source_sha256":"99d52aaeaf8812f470059b0ad98a0f2e57051c73d937a6b46ab29b91e5c716a9","start":128}],"target_id":"concept.go.go0008283","target_kind":"node","target_sha256":"825ace3f623f24ce56aaa6eca77461526beff3e18170edd9dd5abbb3ac2d9c4f"}],"concept.go.go0008340":[{"id":"assertion.concept.go.go0008340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"determination of adult lifespan as defined in the captured Gene Ontology term GO:0008340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines determination of adult lifespan as: The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","support":[{"end":220,"quote":"The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","source_id":"quickgo.go_0008340","source_sha256":"7853ad1069ca9544e2aa2e52516d0ad6405ecc51794d267e0c356deae68fd066","start":130}],"target_id":"concept.go.go0008340","target_kind":"node","target_sha256":"07e883c8669e2d6c370e9a8585bf22d5eaafc1eea96428a606be0b181c10b95a"}],"concept.go.go0009292":[{"id":"assertion.concept.go.go0009292","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"horizontal gene transfer as defined in the captured Gene Ontology term GO:0009292","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines horizontal gene transfer as: The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","support":[{"end":259,"quote":"The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","source_id":"quickgo.go_0009292","source_sha256":"2bdc02348b358cc502b9e5e6d1250116f3ad52c16dc00dec7f7f8e222ca7c134","start":123}],"target_id":"concept.go.go0009292","target_kind":"node","target_sha256":"3748dbb12c8e5b8a4f87de65f8389a6d495165c0f40267bcecc4c4c678e64a17"}],"concept.go.go0009407":[{"id":"assertion.concept.go.go0009407","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"toxin catabolic process as defined in the captured Gene Ontology term GO:0009407","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines toxin catabolic process as: The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","support":[{"end":360,"quote":"The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","source_id":"quickgo.go_0009407","source_sha256":"58c964b721ea86627c9cb4dcd073376d909060ccb728e6444f079857fad69df1","start":122}],"target_id":"concept.go.go0009407","target_kind":"node","target_sha256":"a57592cbd80fd1b05bbc29755b328019af4b85c030792fd48e10d937713eb633"}],"concept.go.go0009420":[{"id":"assertion.concept.go.go0009420","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum filament as defined in the captured Gene Ontology term GO:0009420","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament as: The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","support":[{"end":247,"quote":"The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","source_id":"quickgo.go_0009420","source_sha256":"6129cab9f1deef8ad1b4da6adeca7a66e37eb3a5c41c9504e185a8bcec1e80a7","start":132}],"target_id":"concept.go.go0009420","target_kind":"node","target_sha256":"3af42b93fc2fe2836f58527a3637ef52dd161ff96691d34ec0b05004d6f1b488"}],"concept.go.go0009421":[{"id":"assertion.concept.go.go0009421","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum filament cap as defined in the captured Gene Ontology term GO:0009421","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament cap as: The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","support":[{"end":223,"quote":"The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","source_id":"quickgo.go_0009421","source_sha256":"5acf6a3dee878ab40207a1a5b6f03b5e603dd919fac38629253a62663afe6837","start":136}],"target_id":"concept.go.go0009421","target_kind":"node","target_sha256":"480b28b8c091ee2278862ae9295b32d3c28799161b5362849a9bfe63465beda2"}],"concept.go.go0009422":[{"id":"assertion.concept.go.go0009422","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum hook-filament junction as defined in the captured Gene Ontology term GO:0009422","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook-filament junction as: The region of the bacterial-type flagellum where the hook and filament meet.","support":[{"end":222,"quote":"The region of the bacterial-type flagellum where the hook and filament meet.","source_id":"quickgo.go_0009422","source_sha256":"5c3f6601cdb52383381475d8ce358dd1a78eb131f9f4ebef4c4e3e22c1d7ff9b","start":146}],"target_id":"concept.go.go0009422","target_kind":"node","target_sha256":"b8289911a1a86080b1f5d0a3d7b958896fefe6b69ae12b4ab699969ebe1c5d1f"}],"concept.go.go0009424":[{"id":"assertion.concept.go.go0009424","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum hook as defined in the captured Gene Ontology term GO:0009424","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook as: The portion of the bacterial-type flagellum that connects the filament to the basal body.","support":[{"end":217,"quote":"The portion of the bacterial-type flagellum that connects the filament to the basal body.","source_id":"quickgo.go_0009424","source_sha256":"c02dc500674b4169f3248825fcfec4b5c404871023b01c20ab023d876f7896da","start":128}],"target_id":"concept.go.go0009424","target_kind":"node","target_sha256":"0800e8e3ec203182888cf26707e3fc4c3d0a5267b1b3b82c135eefd7420f7185"}],"concept.go.go0009431":[{"id":"assertion.concept.go.go0009431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum basal body, MS ring as defined in the captured Gene Ontology term GO:0009431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, MS ring as: One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","support":[{"end":282,"quote":"One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","source_id":"quickgo.go_0009431","source_sha256":"e37ef4fce4fa4e2350dc3f75aed84573b0a255645631469b932ede1c6fd00794","start":143}],"target_id":"concept.go.go0009431","target_kind":"node","target_sha256":"a6e5cafa29d3c7d10b3a6ef459dd1791701cf5e59a227ad1be620761629ac6f6"}],"concept.go.go0009433":[{"id":"assertion.concept.go.go0009433","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum basal body, C ring as defined in the captured Gene Ontology term GO:0009433","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, C ring as: Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","support":[{"end":436,"quote":"Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","source_id":"quickgo.go_0009433","source_sha256":"5f75fcc2454f210682a3a8ef797079fd5c841b70f79fcff8460f10619df82ee4","start":142}],"target_id":"concept.go.go0009433","target_kind":"node","target_sha256":"fdde6fd99ff3a62f5c93e54eb30e25ad9cbb83f281227d1f711083eee6765d1e"}],"concept.go.go0009541":[{"id":"assertion.concept.go.go0009541","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"etioplast prolamellar body as defined in the captured Gene Ontology term GO:0009541","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines etioplast prolamellar body as: A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","support":[{"end":542,"quote":"A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","source_id":"quickgo.go_0009541","source_sha256":"1886a026d618bb9dac4783e6bf86d7fce7772ad80f201c4717a698c3f124ecbc","start":125}],"target_id":"concept.go.go0009541","target_kind":"node","target_sha256":"416d417f96b7a19c9065bbd98247e204d24352b630d96d5c6bdadb3ae6ef7207"}],"concept.go.go0009542":[{"id":"assertion.concept.go.go0009542","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granum as defined in the captured Gene Ontology term GO:0009542","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines granum as: Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","support":[{"end":288,"quote":"Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","source_id":"quickgo.go_0009542","source_sha256":"8d8c19b428f21c46e1d87a0c9ab209d5b7851ef8ae204a092240497510022d13","start":105}],"target_id":"concept.go.go0009542","target_kind":"node","target_sha256":"cd03d4d1217af28fb1f5d7bcbf4f9071adaeeaefce4de273f83b0013a9cbcb68"}],"concept.go.go0009561":[{"id":"assertion.concept.go.go0009561","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"megagametogenesis as defined in the captured Gene Ontology term GO:0009561","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines megagametogenesis as: The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","support":[{"end":907,"quote":"The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","source_id":"quickgo.go_0009561","source_sha256":"0788fcb0ac46e3282190997440e819a1675a981278defe80fd566f08641a8b32","start":116}],"target_id":"concept.go.go0009561","target_kind":"node","target_sha256":"acc6194909375c8783895b519ab47d2d153139417492e0323fe53389277fd925"}],"concept.go.go0009566":[{"id":"assertion.concept.go.go0009566","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fertilization as defined in the captured Gene Ontology term GO:0009566","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fertilization as: The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","support":[{"end":295,"quote":"The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","source_id":"quickgo.go_0009566","source_sha256":"31d4b89d19b4da59ca48467753d45c056646687b41bfb416a930ac75a5fab453","start":112}],"target_id":"concept.go.go0009566","target_kind":"node","target_sha256":"0bd1393572c324706d54ff5abf001e4cdacf8091c1b19395924a4945357467eb"}],"concept.go.go0009574":[{"id":"assertion.concept.go.go0009574","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"preprophase band as defined in the captured Gene Ontology term GO:0009574","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines preprophase band as: A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","support":[{"end":543,"quote":"A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","source_id":"quickgo.go_0009574","source_sha256":"7add76bf9b33d554bd7f1bf8ae611f35653ed042e0f69cf71c2ebb71b506c5c4","start":115}],"target_id":"concept.go.go0009574","target_kind":"node","target_sha256":"8a40d2d5af70718b7a5f3ed4221a60088c210404256bd1f833333efd6b55e315"}],"concept.go.go0009653":[{"id":"assertion.concept.go.go0009653","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure morphogenesis as defined in the captured Gene Ontology term GO:0009653","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure morphogenesis as: The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","support":[{"end":252,"quote":"The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","source_id":"quickgo.go_0009653","source_sha256":"c85860ce1fd28acfac44cab6b090fd7b0d90ff78216f5a4c3bfa4a6ace521dd7","start":133}],"target_id":"concept.go.go0009653","target_kind":"node","target_sha256":"098c124d47a0d9e20428679fa8bb14892aea6b623da052a947b72798eff21119"}],"concept.go.go0009791":[{"id":"assertion.concept.go.go0009791","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"post-embryonic development as defined in the captured Gene Ontology term GO:0009791","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines post-embryonic development as: The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","support":[{"end":302,"quote":"The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","source_id":"quickgo.go_0009791","source_sha256":"f38972e2e334873ccc1108d16838b2467d7f9288e9d2ec973c43da130e4b2473","start":125}],"target_id":"concept.go.go0009791","target_kind":"node","target_sha256":"38195893d388ab1f6107a7340065ba50e9f95fd0c3be9ca2b39e3058c25d1b04"}],"concept.go.go0009838":[{"id":"assertion.concept.go.go0009838","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"abscission as defined in the captured Gene Ontology term GO:0009838","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines abscission as: The controlled shedding of a body part.","support":[{"end":148,"quote":"The controlled shedding of a body part.","source_id":"quickgo.go_0009838","source_sha256":"d53d33258f36e097af90743a9039c68040537ec6fcfccadcd2a3215a51d83289","start":109}],"target_id":"concept.go.go0009838","target_kind":"node","target_sha256":"ecccd4f0db0d891c3d04c06c7684e4851d8b9f7b5d2e6e7efb4dc24fa3b52e3d"}],"concept.go.go0009845":[{"id":"assertion.concept.go.go0009845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"seed germination as defined in the captured Gene Ontology term GO:0009845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed germination as: The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","support":[{"end":280,"quote":"The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","source_id":"quickgo.go_0009845","source_sha256":"35698f1020596189a3aeed5799766e08bde35de4953d065dbc96218a5d9136eb","start":115}],"target_id":"concept.go.go0009845","target_kind":"node","target_sha256":"29506a00f712f10fc3a1b44e371f2981ce9fbc79ca9d9694743ab521086fb2f1"}],"concept.go.go0009846":[{"id":"assertion.concept.go.go0009846","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen germination as defined in the captured Gene Ontology term GO:0009846","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen germination as: The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","support":[{"end":311,"quote":"The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","source_id":"quickgo.go_0009846","source_sha256":"8183e88573c437d97c95c4d12a6a6521c4f55e332ae3711e06171c4cf0f3620f","start":117}],"target_id":"concept.go.go0009846","target_kind":"node","target_sha256":"f0d56d79cf7f231945228b4b68d07e85f51d89bfb331f7471d878aa744b8f671"}],"concept.go.go0009865":[{"id":"assertion.concept.go.go0009865","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen tube adhesion as defined in the captured Gene Ontology term GO:0009865","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube adhesion as: The process in which the pollen tube adheres to cells of the stigma and style.","support":[{"end":197,"quote":"The process in which the pollen tube adheres to cells of the stigma and style.","source_id":"quickgo.go_0009865","source_sha256":"c1ba567c6de60ce563a44d77390f2c1593263bb48b2312bd93a8fce71f64c972","start":119}],"target_id":"concept.go.go0009865","target_kind":"node","target_sha256":"7dd8f6d9820eec68605bdfaa6a45fcffbc1ac300423d7600f892c46fc255d569"}],"concept.go.go0009987":[{"id":"assertion.concept.go.go0009987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular process as defined in the captured Gene Ontology term GO:0009987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process as: Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","support":[{"end":317,"quote":"Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","source_id":"quickgo.go_0009987","source_sha256":"035db34413527c31f9b4ddcfe3da88349b511356abd9b0ac3f5b85ee8beb8b68","start":115}],"target_id":"concept.go.go0009987","target_kind":"node","target_sha256":"620bdea69b7bd959dfcdb1940f6db24bd965a4592f3c3d0bd0c47247dab6b01b"}],"concept.go.go0010014":[{"id":"assertion.concept.go.go0010014","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem initiation as defined in the captured Gene Ontology term GO:0010014","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem initiation as: Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","support":[{"end":374,"quote":"Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","source_id":"quickgo.go_0010014","source_sha256":"223d244fea99b4f8997328f86dacdf6c5ae732551d774cfe415feeebafe6f37c","start":118}],"target_id":"concept.go.go0010014","target_kind":"node","target_sha256":"14c3a222201006db6e8fae980bb8ea64f589fb120e86e99fbf6cb118efb49f41"}],"concept.go.go0010022":[{"id":"assertion.concept.go.go0010022","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem determinacy as defined in the captured Gene Ontology term GO:0010022","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem determinacy as: The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","support":[{"end":255,"quote":"The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","source_id":"quickgo.go_0010022","source_sha256":"1c8f4e5b593becf0cc00b42fb4716099d4a4181eacce53a3900d38d58a907e58","start":119}],"target_id":"concept.go.go0010022","target_kind":"node","target_sha256":"0e31512058c4e99296ae58317486068b67dda94c3877e86fc508ea0f71243e60"}],"concept.go.go0010073":[{"id":"assertion.concept.go.go0010073","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem maintenance as defined in the captured Gene Ontology term GO:0010073","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem maintenance as: Any process involved in maintaining the identity, size and shape of a meristem.","support":[{"end":198,"quote":"Any process involved in maintaining the identity, size and shape of a meristem.","source_id":"quickgo.go_0010073","source_sha256":"246d9920878c2297f19813a50a44e5b907e3e9be4dcfbdb08a71e480b73a8b44","start":119}],"target_id":"concept.go.go0010073","target_kind":"node","target_sha256":"2a4ea396171bb078a4242b4a8ede2dc8750b0ce5579a16dbe3ff7bf46a73a7eb"}],"concept.go.go0010118":[{"id":"assertion.concept.go.go0010118","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stomatal movement as defined in the captured Gene Ontology term GO:0010118","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines stomatal movement as: The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","support":[{"end":306,"quote":"The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","source_id":"quickgo.go_0010118","source_sha256":"e684666238c2d0578d0b470b5ab3690a5ae438c7224549e022f67d7788f50c5d","start":116}],"target_id":"concept.go.go0010118","target_kind":"node","target_sha256":"0acbaaa680fd25d9e1532dd5064811914368be3aea41a53006be2be1afb0fc0d"}],"concept.go.go0010127":[{"id":"assertion.concept.go.go0010127","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mycothiol-dependent detoxification as defined in the captured Gene Ontology term GO:0010127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mycothiol-dependent detoxification as: The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","support":[{"end":317,"quote":"The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","source_id":"quickgo.go_0010127","source_sha256":"774cfe8611d0a65f2bc1089bf58143ab1a8e824b7506d66954ed8b360e4feb59","start":133}],"target_id":"concept.go.go0010127","target_kind":"node","target_sha256":"8712dd099a0bce2bd7151be897559c266bceb66b3dfbb2c67e043bb52d39813a"}],"concept.go.go0010162":[{"id":"assertion.concept.go.go0010162","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"seed dormancy process as defined in the captured Gene Ontology term GO:0010162","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","support":[{"end":510,"quote":"A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","source_id":"quickgo.go_0010162","source_sha256":"ca39e5096ccf7a26da74089ca1f2defff2032dff92fe149bfa3ad5d957822e65","start":120}],"target_id":"concept.go.go0010162","target_kind":"node","target_sha256":"0a892c294bc7fa715ff3031e49b7a549dd582957d4301cc9480f6fa050335a75"}],"concept.go.go0010483":[{"id":"assertion.concept.go.go0010483","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen tube reception as defined in the captured Gene Ontology term GO:0010483","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube reception as: An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","support":[{"end":361,"quote":"An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","source_id":"quickgo.go_0010483","source_sha256":"c983ea09648ddd7bd11710b4f3f9358071526be5e26f91e75fb3b8f96e8ad23c","start":120}],"target_id":"concept.go.go0010483","target_kind":"node","target_sha256":"8d56dbb1fba4760f55385b312fb5ee80de2e726b4fa8454c68ba7512fd83cd45"}],"concept.go.go0012505":[{"id":"assertion.concept.go.go0012505","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"endomembrane system as defined in the captured Gene Ontology term GO:0012505","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines endomembrane system as: A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","support":[{"end":428,"quote":"A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","source_id":"quickgo.go_0012505","source_sha256":"d98c87d0ab4ad805143a5ad65c76e660c2cbcfac521469ed8e0d6dc13d308ab4","start":118}],"target_id":"concept.go.go0012505","target_kind":"node","target_sha256":"d9d93581d42c215240a0682b9147fc8ef05352f05a79002e6ada455f70e1224c"}],"concept.go.go0014705":[{"id":"assertion.concept.go.go0014705","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"C zone as defined in the captured Gene Ontology term GO:0014705","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines C zone as: A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","support":[{"end":270,"quote":"A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","source_id":"quickgo.go_0014705","source_sha256":"a7abb9f2a722b2259c69dc759529c9fe087dbea5fe455daec4b56a38d92d99f2","start":105}],"target_id":"concept.go.go0014705","target_kind":"node","target_sha256":"1340b4c9ce035deaf72caa952acf96a6fde4d17f84d27a5f07f8c86d09850ec7"}],"concept.go.go0014801":[{"id":"assertion.concept.go.go0014801","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"longitudinal sarcoplasmic reticulum as defined in the captured Gene Ontology term GO:0014801","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines longitudinal sarcoplasmic reticulum as: The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","support":[{"end":248,"quote":"The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","source_id":"quickgo.go_0014801","source_sha256":"334991fc68beab2a40f49985265b46d06fd06dd000f46b7e246a4d771bbf304b","start":134}],"target_id":"concept.go.go0014801","target_kind":"node","target_sha256":"e0138f7e7c251a64214dff46fff773cd2d7713cbb35916052cb2804e571f5d3c"}],"concept.go.go0016032":[{"id":"assertion.concept.go.go0016032","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral process as defined in the captured Gene Ontology term GO:0016032","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral process as: A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","support":[{"end":473,"quote":"A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","source_id":"quickgo.go_0016032","source_sha256":"effd102888e9fceff7fbbeb8889d6529f2a4ac20e068b1060fb2304373e1e270","start":112}],"target_id":"concept.go.go0016032","target_kind":"node","target_sha256":"65e2e84a3f3d9efc7503414cc0d135035ea63dd6d0feb5e9a0f9077996112c49"}],"concept.go.go0016037":[{"id":"assertion.concept.go.go0016037","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"light absorption as defined in the captured Gene Ontology term GO:0016037","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines light absorption as: The reception of a photon by a cell.","support":[{"end":151,"quote":"The reception of a photon by a cell.","source_id":"quickgo.go_0016037","source_sha256":"efe9903b25d9e22c3ace3f4c653443a841fa435dac77f7607efcd5ae76a5d013","start":115}],"target_id":"concept.go.go0016037","target_kind":"node","target_sha256":"86fa5c8b689787cab8d32a48e838a307c22c829af32715170c5cf4917380f6e2"}],"concept.go.go0016049":[{"id":"assertion.concept.go.go0016049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell growth as defined in the captured Gene Ontology term GO:0016049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell growth as: The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","support":[{"end":262,"quote":"The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","source_id":"quickgo.go_0016049","source_sha256":"7105897a34c204fce30ddf94b3906f9cb68405b454b75f7a7b5c9529ac723e2d","start":110}],"target_id":"concept.go.go0016049","target_kind":"node","target_sha256":"deeaf96f26bc5b62d35bf59671bc5f567966aa188ac6e518534c6d3f5e30f374"}],"concept.go.go0016192":[{"id":"assertion.concept.go.go0016192","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vesicle-mediated transport as defined in the captured Gene Ontology term GO:0016192","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines vesicle-mediated transport as: A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","support":[{"end":508,"quote":"A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","source_id":"quickgo.go_0016192","source_sha256":"9c63708b412f5011ed66af3a3b828b135e731165d99655989a7d765d9cad93e5","start":125}],"target_id":"concept.go.go0016192","target_kind":"node","target_sha256":"30e607221c0f08d6f05f77bbc3c6cc6b713ac4a40459afe297801179c6d7b331"}],"concept.go.go0016203":[{"id":"assertion.concept.go.go0016203","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"muscle attachment as defined in the captured Gene Ontology term GO:0016203","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle attachment as: The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","support":[{"end":220,"quote":"The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","source_id":"quickgo.go_0016203","source_sha256":"2197297cf9a34c82fdd12281365b7bd94f05b83395f670c145916f27bc56ed6e","start":116}],"target_id":"concept.go.go0016203","target_kind":"node","target_sha256":"e5580c7da25f4439342d5e19e9baad545921e8c1cd7f88dcd221d3afc6ef56e1"}],"concept.go.go0016328":[{"id":"assertion.concept.go.go0016328","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lateral plasma membrane as defined in the captured Gene Ontology term GO:0016328","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral plasma membrane as: The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","support":[{"end":307,"quote":"The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","source_id":"quickgo.go_0016328","source_sha256":"934b3f1d81a289cd6252de6d185c99ca65110ee00cece71d8b94ca78e843788f","start":122}],"target_id":"concept.go.go0016328","target_kind":"node","target_sha256":"bc52317993a079e0d9f1f5935f96b9101213f94abe6d3d30736f4591ebd2c335"}],"concept.go.go0019013":[{"id":"assertion.concept.go.go0019013","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral nucleocapsid as defined in the captured Gene Ontology term GO:0019013","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral nucleocapsid as: The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","support":[{"end":219,"quote":"The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","source_id":"quickgo.go_0019013","source_sha256":"d3614e55a444b568b29a7e376368f97dd7f0c3a890734bb2c2c0827b41cd014c","start":117}],"target_id":"concept.go.go0019013","target_kind":"node","target_sha256":"81e78e626eb6175d0a9c5566f1adc3ad4b85c0a415c3a44bf9b5bf5b12e71aea"}],"concept.go.go0019028":[{"id":"assertion.concept.go.go0019028","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid as defined in the captured Gene Ontology term GO:0019028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid as: The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","support":[{"end":260,"quote":"The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","source_id":"quickgo.go_0019028","source_sha256":"50dc1e906b6737a321f926c21df5145dff2791327c341cc0e5c7f045a6af239f","start":111}],"target_id":"concept.go.go0019028","target_kind":"node","target_sha256":"fdf63366de1d6ca4536577be3cabf6f1d318071eab9bd4f9a4d0e4a4748b4d35"}],"concept.go.go0019033":[{"id":"assertion.concept.go.go0019033","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tegument as defined in the captured Gene Ontology term GO:0019033","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tegument as: A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","support":[{"end":233,"quote":"A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","source_id":"quickgo.go_0019033","source_sha256":"7abf201fb1d23a690b03875b8bdffd0266ff745e7625233b1d1c2574f10eba00","start":113}],"target_id":"concept.go.go0019033","target_kind":"node","target_sha256":"bf7accadb7a2da670fe572a51c32f7980bc4418c813787264d8ec19c020155df"}],"concept.go.go0019042":[{"id":"assertion.concept.go.go0019042","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral latency as defined in the captured Gene Ontology term GO:0019042","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral latency as: The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","support":[{"end":301,"quote":"The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","source_id":"quickgo.go_0019042","source_sha256":"4cfbd3210223fed94c982cb09ba22856734c924c32466476e9a7cdbb50b5b755","start":112}],"target_id":"concept.go.go0019042","target_kind":"node","target_sha256":"9e4afb5b9796ab01b42c5d748fe7d6f64a70c4030fac355d20d42b846b884c4d"}],"concept.go.go0019045":[{"id":"assertion.concept.go.go0019045","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"latent virus replication as defined in the captured Gene Ontology term GO:0019045","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines latent virus replication as: Any process required for latent viral replication in a cell.","support":[{"end":183,"quote":"Any process required for latent viral replication in a cell.","source_id":"quickgo.go_0019045","source_sha256":"f8cf43cdc0a4efa2fd7bcea0edf5f405c24b5c8b9220669559b573a86055e3f7","start":123}],"target_id":"concept.go.go0019045","target_kind":"node","target_sha256":"adcd19831e1e56818585ead1d222887086e869fd957ba7c9be13eaa7227732c5"}],"concept.go.go0019046":[{"id":"assertion.concept.go.go0019046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"release from viral latency as defined in the captured Gene Ontology term GO:0019046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines release from viral latency as: The process by which a virus begins to replicate following a latency replication decision (switch).","support":[{"end":224,"quote":"The process by which a virus begins to replicate following a latency replication decision (switch).","source_id":"quickgo.go_0019046","source_sha256":"55f7977af8cfab47d190bc10a177dbd7d698cc4f42a9d34fc11d9bcb573ce768","start":125}],"target_id":"concept.go.go0019046","target_kind":"node","target_sha256":"f7702d37997951c4dc50ce5958c5680eb9f265dc6774842e2e82cd20c04ca33c"}],"concept.go.go0019058":[{"id":"assertion.concept.go.go0019058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral life cycle as defined in the captured Gene Ontology term GO:0019058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral life cycle as: A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","support":[{"end":395,"quote":"A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","source_id":"quickgo.go_0019058","source_sha256":"d892b000e03d16fb6868f1560a176e05e86a49ebe0beda77f866efd3c27d1e12","start":115}],"target_id":"concept.go.go0019058","target_kind":"node","target_sha256":"2384688d79d70bf950cca77a54fca0867a4157a2274b7fdd76825d048959c327"}],"concept.go.go0019061":[{"id":"assertion.concept.go.go0019061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"uncoating of virus as defined in the captured Gene Ontology term GO:0019061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines uncoating of virus as: The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","support":[{"end":237,"quote":"The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","source_id":"quickgo.go_0019061","source_sha256":"e8430a39caa3256c14418c2fb474c54e1172b2eac938d1b535e9c6520b7f0393","start":117}],"target_id":"concept.go.go0019061","target_kind":"node","target_sha256":"a455efc0fc37bc951f15e5b6ec70a4ea98d15974c938ec08d964e0e120161663"}],"concept.go.go0019068":[{"id":"assertion.concept.go.go0019068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion assembly as defined in the captured Gene Ontology term GO:0019068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion assembly as: A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","support":[{"end":327,"quote":"A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","source_id":"quickgo.go_0019068","source_sha256":"d26f2ce549676a29bedabc4024f17ef6d1d48c45a67dcad8fe6b0b65742cb8c9","start":114}],"target_id":"concept.go.go0019068","target_kind":"node","target_sha256":"edf5b61610b3e65af0471c22a97704e659487c7cc9071ba847c370930625cb1a"}],"concept.go.go0019069":[{"id":"assertion.concept.go.go0019069","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid assembly as defined in the captured Gene Ontology term GO:0019069","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid assembly as: The assembly of a virus capsid from its protein subunits.","support":[{"end":177,"quote":"The assembly of a virus capsid from its protein subunits.","source_id":"quickgo.go_0019069","source_sha256":"016099cf3f0a53ecb05f22bfb62d24342206e7b72a9a598a7387ede39beb9080","start":120}],"target_id":"concept.go.go0019069","target_kind":"node","target_sha256":"edbaf52757b2384fb5fd13943c830bebe865356ea6046ca4bfba52cd91a27f71"}],"concept.go.go0019070":[{"id":"assertion.concept.go.go0019070","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome maturation as defined in the captured Gene Ontology term GO:0019070","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome maturation as: The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","support":[{"end":400,"quote":"The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","source_id":"quickgo.go_0019070","source_sha256":"c4e881c98455515618604994b330bb5c5097c7d2a1e1bbec9221596faa542595","start":122}],"target_id":"concept.go.go0019070","target_kind":"node","target_sha256":"191d246ea7cbb1c96b3692d4d7d59f967e62883793ee4123acd373f41123888e"}],"concept.go.go0019072":[{"id":"assertion.concept.go.go0019072","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome packaging as defined in the captured Gene Ontology term GO:0019072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome packaging as: The encapsulation of the viral genome within the capsid.","support":[{"end":177,"quote":"The encapsulation of the viral genome within the capsid.","source_id":"quickgo.go_0019072","source_sha256":"3808a81a8401db27b4b65c2be7c5128b0bedcf39e579b265d5deb74b9278c306","start":121}],"target_id":"concept.go.go0019072","target_kind":"node","target_sha256":"c14ec73b6fa2a5137d7554ac1d38191a5887439403fd6d1433857b36f5948921"}],"concept.go.go0019075":[{"id":"assertion.concept.go.go0019075","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus maturation as defined in the captured Gene Ontology term GO:0019075","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus maturation as: The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","support":[{"end":391,"quote":"The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","source_id":"quickgo.go_0019075","source_sha256":"507997dee60af01bf1f4ebd0fa42b6d1a5d5e4a2d203dbe430fd269c490a0eef","start":115}],"target_id":"concept.go.go0019075","target_kind":"node","target_sha256":"cb454f09fccfb46a1db6d3a2c7d76953a6426bdf1d6960edf08a0d4608bf8f8f"}],"concept.go.go0019076":[{"id":"assertion.concept.go.go0019076","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral release from host cell as defined in the captured Gene Ontology term GO:0019076","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral release from host cell as: The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","support":[{"end":265,"quote":"The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","source_id":"quickgo.go_0019076","source_sha256":"641c29272176a2494f25fc3b3028c323ca8ff73baed189076ade1341a40947e3","start":127}],"target_id":"concept.go.go0019076","target_kind":"node","target_sha256":"99dbfa78f05e1296ed659053993163543ebca2677dbdb29ffbc438393b8951e0"}],"concept.go.go0019079":[{"id":"assertion.concept.go.go0019079","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome replication as defined in the captured Gene Ontology term GO:0019079","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome replication as: Any process involved directly in viral genome replication, including viral nucleotide metabolism.","support":[{"end":220,"quote":"Any process involved directly in viral genome replication, including viral nucleotide metabolism.","source_id":"quickgo.go_0019079","source_sha256":"af510cd89fbc4e92263fba2ab11df31c85bfff394a1e575b0d51480d43be1f91","start":123}],"target_id":"concept.go.go0019079","target_kind":"node","target_sha256":"ac4dafdbd9425374349773df79f358549b08006c3bbed26609f1769416613114"}],"concept.go.go0019080":[{"id":"assertion.concept.go.go0019080","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral gene expression as defined in the captured Gene Ontology term GO:0019080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral gene expression as: A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","support":[{"end":324,"quote":"A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","source_id":"quickgo.go_0019080","source_sha256":"52b8be163f6ff0044943fee540446d220afbf9f376dee7104687ed13ed6fb46e","start":120}],"target_id":"concept.go.go0019080","target_kind":"node","target_sha256":"5d1a222d059f954dde84f46f4c240d636c4f5d6dc8b67af7f0011d0813ce93d7"}],"concept.go.go0019081":[{"id":"assertion.concept.go.go0019081","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translation as defined in the captured Gene Ontology term GO:0019081","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translation as: A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","support":[{"end":214,"quote":"A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","source_id":"quickgo.go_0019081","source_sha256":"4cc78af9a397ab86250078cab59a810fb7ed65115c27f48f91264c6382fee86a","start":116}],"target_id":"concept.go.go0019081","target_kind":"node","target_sha256":"c31d7bcc131cdbf5592723f5c391c4faff6e9a7f91ca4a300c4140ac412e40c2"}],"concept.go.go0019082":[{"id":"assertion.concept.go.go0019082","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral protein processing as defined in the captured Gene Ontology term GO:0019082","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral protein processing as: Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","support":[{"end":229,"quote":"Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","source_id":"quickgo.go_0019082","source_sha256":"997ff6bd45b9d0a587daad0380c3248b4d0312f7ab1fe30f0c0176d5febd29e3","start":123}],"target_id":"concept.go.go0019082","target_kind":"node","target_sha256":"6cb0d8fcf2b232fc01a98a7a295dc2ad261ca2b3a886c7e5561b430c8bbf6b15"}],"concept.go.go0019083":[{"id":"assertion.concept.go.go0019083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral transcription as defined in the captured Gene Ontology term GO:0019083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral transcription as: The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","support":[{"end":218,"quote":"The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","source_id":"quickgo.go_0019083","source_sha256":"9ed357e09982299dc8759246e7719a1cb6ca07f07a6d752260c496a5adc56065","start":118}],"target_id":"concept.go.go0019083","target_kind":"node","target_sha256":"a468d7ed8e0b542f0ab19600cc9826458bba7da7f1057500d8fc036573affb74"}],"concept.go.go0019725":[{"id":"assertion.concept.go.go0019725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular homeostasis as defined in the captured Gene Ontology term GO:0019725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the cell.","support":[{"end":212,"quote":"Any process involved in the maintenance of an internal steady state at the level of the cell.","source_id":"quickgo.go_0019725","source_sha256":"d10833e3804ae62740f4e8b9c2f2839a355849a313da6c36f0efccbe023d75eb","start":119}],"target_id":"concept.go.go0019725","target_kind":"node","target_sha256":"af82b1e86fb8777c3d8b6537af7358abe9f1e52fa6efaa1960f5e41955c52d69"}],"concept.go.go0019827":[{"id":"assertion.concept.go.go0019827","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stem cell population maintenance as defined in the captured Gene Ontology term GO:0019827","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines stem cell population maintenance as: The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","support":[{"end":556,"quote":"The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","source_id":"quickgo.go_0019827","source_sha256":"14ab0d65bc3d6627ea276c06b5775be4a48e55ce8b7ea428c0118e0f2e56fbf4","start":131}],"target_id":"concept.go.go0019827","target_kind":"node","target_sha256":"99276079742a18a6824d49ff48ec5d3c43e9cbfdfe4e388c9f5da1ddeac7d57c"}],"concept.go.go0019835":[{"id":"assertion.concept.go.go0019835","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytolysis as defined in the captured Gene Ontology term GO:0019835","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytolysis as: The rupture of cell membranes and the loss of cytoplasm.","support":[{"end":164,"quote":"The rupture of cell membranes and the loss of cytoplasm.","source_id":"quickgo.go_0019835","source_sha256":"faf9a1f0049a29297e501b24d9e04b4a9984471e1ac1f4ba4eba650838e9252d","start":108}],"target_id":"concept.go.go0019835","target_kind":"node","target_sha256":"a193025dd30aedc43f176f09cdee9431fb555d1e37b8bad5e1983dd1a1087d3e"}],"concept.go.go0019882":[{"id":"assertion.concept.go.go0019882","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"antigen processing and presentation as defined in the captured Gene Ontology term GO:0019882","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen processing and presentation as: The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","support":[{"end":282,"quote":"The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","source_id":"quickgo.go_0019882","source_sha256":"e24268811bd730ba335253ee50dead701600a2198a0c4eb67018372c9c497c54","start":134}],"target_id":"concept.go.go0019882","target_kind":"node","target_sha256":"e4f06722f4844a26fed10799aaef077ce82123abf8eab672c561f891c36f3482"}],"concept.go.go0019953":[{"id":"assertion.concept.go.go0019953","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sexual reproduction as defined in the captured Gene Ontology term GO:0019953","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sexual reproduction as: A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","support":[{"end":404,"quote":"A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","source_id":"quickgo.go_0019953","source_sha256":"baaf1094d7542eac2fe373530fc3b9f103b91d33ab09cfa52317dd1ea655a909","start":118}],"target_id":"concept.go.go0019953","target_kind":"node","target_sha256":"08171f321e25c4e2349a668cf863adac1da00b55a36f99f99475ef8646980e17"}],"concept.go.go0019954":[{"id":"assertion.concept.go.go0019954","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"asexual reproduction as defined in the captured Gene Ontology term GO:0019954","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines asexual reproduction as: A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","support":[{"end":276,"quote":"A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","source_id":"quickgo.go_0019954","source_sha256":"9f080490bb4ff5c467c4b0667fe65dd9cfe4b1d28841b5c94f4ee8e0e81a1345","start":119}],"target_id":"concept.go.go0019954","target_kind":"node","target_sha256":"148423e1d2b0aa1de2903a49873d8c9272b5f052dac62dda9f638f4979454d84"}],"concept.go.go0020023":[{"id":"assertion.concept.go.go0020023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"kinetoplast as defined in the captured Gene Ontology term GO:0020023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines kinetoplast as: A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","support":[{"end":281,"quote":"A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","source_id":"quickgo.go_0020023","source_sha256":"e3658484c8a1cdd28f6d7d7cf3b0bba8ef56dccc68a54a9a6490bf73326c1f12","start":110}],"target_id":"concept.go.go0020023","target_kind":"node","target_sha256":"6bd116cd068d7a4f261d0aad873b8fe157607073dbfad469e1d00078a4c59cdb"}],"concept.go.go0020038":[{"id":"assertion.concept.go.go0020038","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"subpellicular network as defined in the captured Gene Ontology term GO:0020038","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines subpellicular network as: A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","support":[{"end":269,"quote":"A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","source_id":"quickgo.go_0020038","source_sha256":"46a3af899b1092e0c11d5c2a3c21e0a3f8eb5c76e6d821ec5133d0abbf72036f","start":120}],"target_id":"concept.go.go0020038","target_kind":"node","target_sha256":"6243454a693f3ae79fc949ccc6a1472c4418b9680b7025fb74f6d379fa47ce52"}],"concept.go.go0021700":[{"id":"assertion.concept.go.go0021700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental maturation as defined in the captured Gene Ontology term GO:0021700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental maturation as: A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","support":[{"end":303,"quote":"A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","source_id":"quickgo.go_0021700","source_sha256":"11b2881394056638aaed8b5fafc641aa88c8a3af2e6590b9ad7f43bff15c9a6a","start":123}],"target_id":"concept.go.go0021700","target_kind":"node","target_sha256":"7c1f87a8873e82233b09c11941a36d493821d2b5edfe2d8ab97b6676d9f6ad84"}],"concept.go.go0022004":[{"id":"assertion.concept.go.go0022004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"midbrain-hindbrain boundary maturation during brain development as defined in the captured Gene Ontology term GO:0022004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during brain development as: A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","support":[{"end":611,"quote":"A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","source_id":"quickgo.go_0022004","source_sha256":"32fd16851789fbde9ab7926c03526a4b054f55fbfa6aa5e5d997842946eb0892","start":162}],"target_id":"concept.go.go0022004","target_kind":"node","target_sha256":"f6640e124b79d326334b8ad933cfedf1ad80bbea965a677d0f48a9e0e24d2512"}],"concept.go.go0022005":[{"id":"assertion.concept.go.go0022005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"midbrain-hindbrain boundary maturation during neural plate development as defined in the captured Gene Ontology term GO:0022005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during neural plate development as: A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","support":[{"end":619,"quote":"A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","source_id":"quickgo.go_0022005","source_sha256":"c62a6ec281c305be0b8d92cd8987bea3d3632d21c35c74ae4370da32f3c0ba5d","start":169}],"target_id":"concept.go.go0022005","target_kind":"node","target_sha256":"c4a2db3b4316ca3905df46e5edc4f34ab4aed3e58a51b5c9c11b0c6570b8abf4"}],"concept.go.go0022402":[{"id":"assertion.concept.go.go0022402","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle process as defined in the captured Gene Ontology term GO:0022402","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle process as: The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","support":[{"end":230,"quote":"The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","source_id":"quickgo.go_0022402","source_sha256":"16af245d3b83164fc2799db60ffbebba50761fb3073ff76d3f71ec697f78e80a","start":117}],"target_id":"concept.go.go0022402","target_kind":"node","target_sha256":"57b839215f13993b600c2879c93467d9209f986fc839234a19d1ae2941abc93a"}],"concept.go.go0022403":[{"id":"assertion.concept.go.go0022403","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle phase as defined in the captured Gene Ontology term GO:0022403","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle phase as: One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","support":[{"end":286,"quote":"One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","source_id":"quickgo.go_0022403","source_sha256":"3533721a51cfebb45adff4b46172e55069d43240f1be4c7e9c7b59d0f112c472","start":115}],"target_id":"concept.go.go0022403","target_kind":"node","target_sha256":"4d3f55d555f230020b28adbf6154e7ccae84358c314524e0dfefa79a6f0c6db2"}],"concept.go.go0022404":[{"id":"assertion.concept.go.go0022404","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"molting cycle process as defined in the captured Gene Ontology term GO:0022404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle process as: A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","support":[{"end":270,"quote":"A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","source_id":"quickgo.go_0022404","source_sha256":"595300bed6828a8785fc2bfdfa5ac939118874dda7ea977601d2a40fa4ea81ed","start":120}],"target_id":"concept.go.go0022404","target_kind":"node","target_sha256":"dbd572b3e9efda9bb91c7e9637fc90ae48aa4d5c494830d023827fb7718f8182"}],"concept.go.go0022406":[{"id":"assertion.concept.go.go0022406","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"membrane docking as defined in the captured Gene Ontology term GO:0022406","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane docking as: The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","support":[{"end":266,"quote":"The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","source_id":"quickgo.go_0022406","source_sha256":"4050a7152961cbb7116b5ecd6c83e19bc0ef3e83fbd69ed9d5521900709dc2aa","start":115}],"target_id":"concept.go.go0022406","target_kind":"node","target_sha256":"bc15d770f965ebc29e8fa29746f22b0ab07b8988e9db0bf6a396c1bad36a1d31"}],"concept.go.go0022412":[{"id":"assertion.concept.go.go0022412","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular process involved in reproduction in multicellular organism as defined in the captured Gene Ontology term GO:0022412","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process involved in reproduction in multicellular organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","support":[{"end":284,"quote":"A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","source_id":"quickgo.go_0022412","source_sha256":"3f9cf7d4b47a8a6614e6f391365ad545c6b48747dd0233836a3eef2efee53658","start":166}],"target_id":"concept.go.go0022412","target_kind":"node","target_sha256":"d4b5f85f9d12ab24857c9c0c525102ab3042c1a7a9c0f1b7f935f9af801c5739"}],"concept.go.go0022413":[{"id":"assertion.concept.go.go0022413","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive process in single-celled organism as defined in the captured Gene Ontology term GO:0022413","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process in single-celled organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","support":[{"end":263,"quote":"A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","source_id":"quickgo.go_0022413","source_sha256":"0879aac3c6529291a39d47609315d02d826e5f1fd664739702a1b5f5c79e9399","start":145}],"target_id":"concept.go.go0022413","target_kind":"node","target_sha256":"e02c32c0bcf8e07448733fcaabd0cacd1334b588010a5f468effdfc6bdefc2c7"}],"concept.go.go0022414":[{"id":"assertion.concept.go.go0022414","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive process as defined in the captured Gene Ontology term GO:0022414","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process as: A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","support":[{"end":332,"quote":"A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","source_id":"quickgo.go_0022414","source_sha256":"8354396a535d60d65598d8a148c5b9281d990b3092f8a2b2e37c0131daab21d9","start":119}],"target_id":"concept.go.go0022414","target_kind":"node","target_sha256":"8edc2b002cec7d67d437f16489d07765547010914f8de53e1d1403e4745f5896"}],"concept.go.go0022601":[{"id":"assertion.concept.go.go0022601","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"menstrual cycle phase as defined in the captured Gene Ontology term GO:0022601","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines menstrual cycle phase as: The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","support":[{"end":380,"quote":"The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","source_id":"quickgo.go_0022601","source_sha256":"736080f609cb67033512c9c66d3f1a31beb92c59051def06c31a448834e71ca3","start":120}],"target_id":"concept.go.go0022601","target_kind":"node","target_sha256":"55d4b454240ec0de34cc1e6809c01f0fddd2f6adf7395384f59872c9f55abc58"}],"concept.go.go0022602":[{"id":"assertion.concept.go.go0022602","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ovulation cycle process as defined in the captured Gene Ontology term GO:0022602","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle process as: A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","support":[{"end":290,"quote":"A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","source_id":"quickgo.go_0022602","source_sha256":"89d43a82bbb51502a90114935fb0fe60a4bc76caa6d00b00644d23f47b11e834","start":122}],"target_id":"concept.go.go0022602","target_kind":"node","target_sha256":"0d73391b63a37dee0d4a904c3ea666060e5a2fa77b7d76c96dd6c6e340af2033"}],"concept.go.go0022608":[{"id":"assertion.concept.go.go0022608","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism adhesion as defined in the captured Gene Ontology term GO:0022608","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism adhesion as: The attachment of a multicellular organism to a substrate or other organism.","support":[{"end":206,"quote":"The attachment of a multicellular organism to a substrate or other organism.","source_id":"quickgo.go_0022608","source_sha256":"b37c50a642526730a35ba865c7bd06f484b5206b48b72d69d6fa0bdcacc5ee3b","start":130}],"target_id":"concept.go.go0022608","target_kind":"node","target_sha256":"d22ced37f0234b47a4e7dfddd0e0dc8c0e860f3e959801f08ed060e263a79a5f"}],"concept.go.go0022611":[{"id":"assertion.concept.go.go0022611","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dormancy process as defined in the captured Gene Ontology term GO:0022611","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dormancy process as: A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","support":[{"end":317,"quote":"A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","source_id":"quickgo.go_0022611","source_sha256":"638c677e0072dc1505a08bfe7e1910f5abf04583343f72e336294c0db692060e","start":115}],"target_id":"concept.go.go0022611","target_kind":"node","target_sha256":"706bb5851cabd99768f4e302e1319efc041f2b83491875a5fce00707c40acfe9"}],"concept.go.go0030017":[{"id":"assertion.concept.go.go0030017","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sarcomere as defined in the captured Gene Ontology term GO:0030017","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sarcomere as: The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","support":[{"end":250,"quote":"The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","source_id":"quickgo.go_0030017","source_sha256":"2a4288a49f408185eaddb81635df029f5e2f909ccb7c967bb027ce9bef29763e","start":108}],"target_id":"concept.go.go0030017","target_kind":"node","target_sha256":"a1f4c23bdc698cb77d1023fca5903863ba93a6dc5cabe7d97c8b181be2c70be0"}],"concept.go.go0030029":[{"id":"assertion.concept.go.go0030029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin filament-based process as defined in the captured Gene Ontology term GO:0030029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament-based process as: Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","support":[{"end":287,"quote":"Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","source_id":"quickgo.go_0030029","source_sha256":"a64648f83e5ea21c56e17a02ce26c0c5b89fe364c9b30594e978acd51a4745c7","start":127}],"target_id":"concept.go.go0030029","target_kind":"node","target_sha256":"e80eabbcf09afc27e4581c6469db73e43751e14a906b80ab376dbfb50390a8cd"}],"concept.go.go0030061":[{"id":"assertion.concept.go.go0030061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial crista as defined in the captured Gene Ontology term GO:0030061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial crista as: Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","support":[{"end":517,"quote":"Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","source_id":"quickgo.go_0030061","source_sha256":"15ad0cb2118814529b672212d7cf29b8f333e24f8420eb7d077e283d5a309918","start":119}],"target_id":"concept.go.go0030061","target_kind":"node","target_sha256":"5c89e7551ed6af855766e8180196d231586b5c25554f68ceb12b36ee4b962007"}],"concept.go.go0030315":[{"id":"assertion.concept.go.go0030315","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"T-tubule as defined in the captured Gene Ontology term GO:0030315","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines T-tubule as: Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","support":[{"end":301,"quote":"Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","source_id":"quickgo.go_0030315","source_sha256":"652acd5316ca10721add1aff5170d22e5e583c38018f687ddd37665c0e80545f","start":107}],"target_id":"concept.go.go0030315","target_kind":"node","target_sha256":"79cb71432d7bb632bd0cab79cc906c2a386950a1f0f5fcd3bf3249dc7e03e3e1"}],"concept.go.go0030427":[{"id":"assertion.concept.go.go0030427","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"site of polarized growth as defined in the captured Gene Ontology term GO:0030427","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines site of polarized growth as: Any part of a cell where non-isotropic growth takes place.","support":[{"end":181,"quote":"Any part of a cell where non-isotropic growth takes place.","source_id":"quickgo.go_0030427","source_sha256":"159b5413b79f7c85f45c69316e7a3cf6283e3c3ed345fe0f1df14af2d21a789a","start":123}],"target_id":"concept.go.go0030427","target_kind":"node","target_sha256":"60a834c9b0689c4d25d3dbe8f806948c773b7f70d7cafaccd8bc8b80c5346949"}],"concept.go.go0030431":[{"id":"assertion.concept.go.go0030431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sleep as defined in the captured Gene Ontology term GO:0030431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sleep as: Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","support":[{"end":393,"quote":"Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","source_id":"quickgo.go_0030431","source_sha256":"860d17fdcb7d8cad48db5eb8ae2b017254e1d88c794402f0577fffac36a399a6","start":104}],"target_id":"concept.go.go0030431","target_kind":"node","target_sha256":"4fc83f5108856132994e6a677f23664b5bdba094df803a097908b99e04ecdeb0"}],"concept.go.go0030447":[{"id":"assertion.concept.go.go0030447","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"filamentous growth as defined in the captured Gene Ontology term GO:0030447","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines filamentous growth as: The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","support":[{"end":263,"quote":"The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","source_id":"quickgo.go_0030447","source_sha256":"88a93aaa5f0606e21b5cdb141c95e7312c48ed320fd89b5fba94e1c8f61ebc0d","start":117}],"target_id":"concept.go.go0030447","target_kind":"node","target_sha256":"c02a6a0ebc9d5c96e313547f4b1270b3e8157e57a36cde0e04bbea67ed432cbb"}],"concept.go.go0030583":[{"id":"assertion.concept.go.go0030583","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myxococcal fruiting body development as defined in the captured Gene Ontology term GO:0030583","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myxococcal fruiting body development as: The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","support":[{"end":425,"quote":"The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","source_id":"quickgo.go_0030583","source_sha256":"8570f11b4ca28b746e308118d80ea57a2c070a55da95b3375ca7cfea7fbe3a39","start":135}],"target_id":"concept.go.go0030583","target_kind":"node","target_sha256":"b80f83d5b1e7f772f6158f685ea53491b982651c339fea978a759eb01dc262c1"}],"concept.go.go0030588":[{"id":"assertion.concept.go.go0030588","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pseudocleavage as defined in the captured Gene Ontology term GO:0030588","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pseudocleavage as: Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","support":[{"end":245,"quote":"Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","source_id":"quickgo.go_0030588","source_sha256":"d97e3b5b52ecf4280f05989ce1b516728784503056b62eac89d729e483bcac6e","start":113}],"target_id":"concept.go.go0030588","target_kind":"node","target_sha256":"61ef16a7d58a5702009fb005fd9599b3443aaf4e0997e7fd811bc266922ea70d"}],"concept.go.go0031128":[{"id":"assertion.concept.go.go0031128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental induction as defined in the captured Gene Ontology term GO:0031128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental induction as: A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","support":[{"end":300,"quote":"A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","source_id":"quickgo.go_0031128","source_sha256":"e4ce3efcdb04a922b600f652a059be51bc52b1b030a91a05d6394cbfc6ef0249","start":122}],"target_id":"concept.go.go0031128","target_kind":"node","target_sha256":"1e519fdbb7634dc9d82557c8aef35be983c28941f436b084b3c3dd1ec3af4143"}],"concept.go.go0031256":[{"id":"assertion.concept.go.go0031256","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leading edge membrane as defined in the captured Gene Ontology term GO:0031256","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leading edge membrane as: The portion of the plasma membrane surrounding the leading edge of a motile cell.","support":[{"end":201,"quote":"The portion of the plasma membrane surrounding the leading edge of a motile cell.","source_id":"quickgo.go_0031256","source_sha256":"b69fd9c88d1cacd44f684addc73f1a4edc001e5dab233663b5d36fdc09ef1423","start":120}],"target_id":"concept.go.go0031256","target_kind":"node","target_sha256":"b82dc8948fd8ddae4a6642c44ed22dd6a85029e7ba2d263f194656dd980051e8"}],"concept.go.go0031257":[{"id":"assertion.concept.go.go0031257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell trailing edge membrane as defined in the captured Gene Ontology term GO:0031257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell trailing edge membrane as: The portion of the plasma membrane surrounding the trailing edge of a motile cell.","support":[{"end":208,"quote":"The portion of the plasma membrane surrounding the trailing edge of a motile cell.","source_id":"quickgo.go_0031257","source_sha256":"1330ad13f8ab2863e71e106ded8de9ebf7b116dd2ef09adfee7a41e2ea848ef0","start":126}],"target_id":"concept.go.go0031257","target_kind":"node","target_sha256":"3a34a0d3151adc4db6d6526ff66085a05df08ff618db1cd4a5805c27150b2493"}],"concept.go.go0031294":[{"id":"assertion.concept.go.go0031294","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lymphocyte costimulation as defined in the captured Gene Ontology term GO:0031294","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lymphocyte costimulation as: The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","support":[{"end":321,"quote":"The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","source_id":"quickgo.go_0031294","source_sha256":"2eca28d986921c353935df8450d9a26d2ff5ac4ec1c81ab3c500364c7aa105f4","start":123}],"target_id":"concept.go.go0031294","target_kind":"node","target_sha256":"369e3a15f6dd60f85e0ae8f879c51f4f999471c90bf0a42837ab76e6e8197cf4"}],"concept.go.go0031424":[{"id":"assertion.concept.go.go0031424","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"keratinization as defined in the captured Gene Ontology term GO:0031424","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines keratinization as: The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","support":[{"end":317,"quote":"The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","source_id":"quickgo.go_0031424","source_sha256":"5b157d1ba7796738a39d094bdeb956c92158eef384487b7c29849c292a55df4d","start":113}],"target_id":"concept.go.go0031424","target_kind":"node","target_sha256":"891718b0766e499269f067f235efa41a8190f15fe869d82151e7f9e20ec199fb"}],"concept.go.go0031430":[{"id":"assertion.concept.go.go0031430","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"M band as defined in the captured Gene Ontology term GO:0031430","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines M band as: The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","support":[{"end":294,"quote":"The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","source_id":"quickgo.go_0031430","source_sha256":"732f566be73d9f083ba26ed43072e76f9be435702c3bcc22a2813ee963146650","start":105}],"target_id":"concept.go.go0031430","target_kind":"node","target_sha256":"0f095915024051ffe3b0c121fbfd75d2b5b633d7dc8d3d0206e4e529cc8a2e1e"}],"concept.go.go0031672":[{"id":"assertion.concept.go.go0031672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"A band as defined in the captured Gene Ontology term GO:0031672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines A band as: The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","support":[{"end":270,"quote":"The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","source_id":"quickgo.go_0031672","source_sha256":"458138e9571dc395cab34ff2353023f82423f19f71fb66940bda276cedb432bb","start":105}],"target_id":"concept.go.go0031672","target_kind":"node","target_sha256":"71947d29ade2da4c4a4dc63d2c33fbb3d6dc1154b615150d57096796e6551166"}],"concept.go.go0031673":[{"id":"assertion.concept.go.go0031673","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"H zone as defined in the captured Gene Ontology term GO:0031673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines H zone as: A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","support":[{"end":324,"quote":"A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","source_id":"quickgo.go_0031673","source_sha256":"0ffafc0dd2a54b79b757ae056488d5b928e8374c0b7b5465a69e7ced67e486e6","start":105}],"target_id":"concept.go.go0031673","target_kind":"node","target_sha256":"9ce00fc599c7012c67b0630d229b566e49ec142f549871874bcae894515d5983"}],"concept.go.go0031674":[{"id":"assertion.concept.go.go0031674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"I band as defined in the captured Gene Ontology term GO:0031674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines I band as: A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","support":[{"end":397,"quote":"A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","source_id":"quickgo.go_0031674","source_sha256":"32d0849a814f4781ff68eceee29397ea0c0de61aa3c05f4cca88ea3e0347e9b9","start":105}],"target_id":"concept.go.go0031674","target_kind":"node","target_sha256":"61983f9fedec27d7210ad62b50571b23213ece99385fdf049a3388921d0dbabf"}],"concept.go.go0031987":[{"id":"assertion.concept.go.go0031987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"locomotion involved in locomotory behavior as defined in the captured Gene Ontology term GO:0031987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion involved in locomotory behavior as: Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","support":[{"end":302,"quote":"Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","source_id":"quickgo.go_0031987","source_sha256":"4162d006845f1efbe89f520f1e25d57d3543cd3676f3f40b650ac6ff21ab15f4","start":141}],"target_id":"concept.go.go0031987","target_kind":"node","target_sha256":"77159784f65862929809e97db17924144180419257551fbcaadfe0140004641f"}],"concept.go.go0032153":[{"id":"assertion.concept.go.go0032153","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell division site as defined in the captured Gene Ontology term GO:0032153","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division site as: The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","support":[{"end":577,"quote":"The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","source_id":"quickgo.go_0032153","source_sha256":"85450ebf677ec6d27b418081908a092fcaf21246c104dfa20e9f9cb0386e90f5","start":117}],"target_id":"concept.go.go0032153","target_kind":"node","target_sha256":"e04f2de446b7463b98f04d580f5bf16cb6b60a8d27dc37b10d6165c8580f6771"}],"concept.go.go0032178":[{"id":"assertion.concept.go.go0032178","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"medial membrane band as defined in the captured Gene Ontology term GO:0032178","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines medial membrane band as: A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","support":[{"end":299,"quote":"A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","source_id":"quickgo.go_0032178","source_sha256":"f69fcef35a64df1f1e7e67abff1a8b0b49d91fa69e6aa0ce0e2d0354484b9aec","start":119}],"target_id":"concept.go.go0032178","target_kind":"node","target_sha256":"ca4d67cda06373c3b73961f7f978f9c6cce2adb4adcf16c6d45c8776960dce16"}],"concept.go.go0032179":[{"id":"assertion.concept.go.go0032179","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"germ tube as defined in the captured Gene Ontology term GO:0032179","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines germ tube as: The slender tubular outgrowth first produced by most spores in germination.","support":[{"end":183,"quote":"The slender tubular outgrowth first produced by most spores in germination.","source_id":"quickgo.go_0032179","source_sha256":"af05fad39a13e71ccd36af87736bc49d2bed0757ec9f608547b2a15ad56c2532","start":108}],"target_id":"concept.go.go0032179","target_kind":"node","target_sha256":"81ccb15c60923e3cda51118ea511aa7a71e369ad0926b9d1f5d9332e2eda7c5d"}],"concept.go.go0032501":[{"id":"assertion.concept.go.go0032501","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal process as defined in the captured Gene Ontology term GO:0032501","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal process as: Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","support":[{"end":233,"quote":"Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","source_id":"quickgo.go_0032501","source_sha256":"d065a406966e25e5a52eac43462bf605ef36b25f7a8d6a93f66b745248a29677","start":131}],"target_id":"concept.go.go0032501","target_kind":"node","target_sha256":"f70ea5ea5b9f76efc479f6a7ab5f1554acdb25c0e2d77dba63a4d89680069e1a"}],"concept.go.go0032502":[{"id":"assertion.concept.go.go0032502","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental process as defined in the captured Gene Ontology term GO:0032502","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process as: A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","support":[{"end":370,"quote":"A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","source_id":"quickgo.go_0032502","source_sha256":"1b82569be25d3908d975524cf196a64796d1c0de16008ad48fc705ca64c62b78","start":120}],"target_id":"concept.go.go0032502","target_kind":"node","target_sha256":"448ac521034021004c2fa7b1863eb3664c4e848e0889239be681399b592fdf85"}],"concept.go.go0032898":[{"id":"assertion.concept.go.go0032898","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"neurotrophin production as defined in the captured Gene Ontology term GO:0032898","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines neurotrophin production as: The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","support":[{"end":407,"quote":"The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","source_id":"quickgo.go_0032898","source_sha256":"fefe3aae5b64d0d7f5d70ee86e198349cc3cfc1cdab08bdddc7bc7039e2d6d90","start":122}],"target_id":"concept.go.go0032898","target_kind":"node","target_sha256":"dfd9407e3385084c3538c561af4b412a3d9d7b5c2626114c2dbe1edc9b68499b"}],"concept.go.go0032991":[{"id":"assertion.concept.go.go0032991","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein-containing complex as defined in the captured Gene Ontology term GO:0032991","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein-containing complex as: A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","support":[{"end":318,"quote":"A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","source_id":"quickgo.go_0032991","source_sha256":"9b847228d0ab1b6ed860d8732ce2db86df19147057b4bb63a04fdc6dc344667d","start":125}],"target_id":"concept.go.go0032991","target_kind":"node","target_sha256":"33f543452b99fdd4051f3944d76bbfcdbf943fd170e51d010b6a013f2b3ba1e6"}],"concept.go.go0033036":[{"id":"assertion.concept.go.go0033036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"macromolecule localization as defined in the captured Gene Ontology term GO:0033036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines macromolecule localization as: Any process in which a macromolecule is transported to, or maintained in, a specific location.","support":[{"end":219,"quote":"Any process in which a macromolecule is transported to, or maintained in, a specific location.","source_id":"quickgo.go_0033036","source_sha256":"0c562833c65fd1d8786e6a6d8f82b6feb9ec870c7c324d797084f95d5b6b6d31","start":125}],"target_id":"concept.go.go0033036","target_kind":"node","target_sha256":"ad3712a66fecc2c6359a7427c492e7caa1cde6071df46fe099c72d30538f7cd0"}],"concept.go.go0033058":[{"id":"assertion.concept.go.go0033058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"directional locomotion as defined in the captured Gene Ontology term GO:0033058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines directional locomotion as: Self-propelled movement of a cell or organism from one location to another along an axis.","support":[{"end":210,"quote":"Self-propelled movement of a cell or organism from one location to another along an axis.","source_id":"quickgo.go_0033058","source_sha256":"2ac810d0dfb2eaae3bb3e9ffd35f8d6ed9e4ed7dc9fbeec3cb7b8aa9f195b9c2","start":121}],"target_id":"concept.go.go0033058","target_kind":"node","target_sha256":"d0b6dd7cff7a99124748d219c98724728eec6e990cc218b4981ff3bdd9bfa80e"}],"concept.go.go0033059":[{"id":"assertion.concept.go.go0033059","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular pigmentation as defined in the captured Gene Ontology term GO:0033059","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular pigmentation as: The deposition or aggregation of coloring matter in a cell.","support":[{"end":179,"quote":"The deposition or aggregation of coloring matter in a cell.","source_id":"quickgo.go_0033059","source_sha256":"7b49565f53fa2f48e9d3d625047a047bb33b954cbaa0796ff55f66ae9f87d8b1","start":120}],"target_id":"concept.go.go0033059","target_kind":"node","target_sha256":"041ef11a8337a54a1621dd132fc604b39bc5ae04eb273fc8d5d83e09b136304d"}],"concept.go.go0033060":[{"id":"assertion.concept.go.go0033060","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ocellus pigmentation as defined in the captured Gene Ontology term GO:0033060","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ocellus pigmentation as: The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","support":[{"end":231,"quote":"The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","source_id":"quickgo.go_0033060","source_sha256":"b74e9df6cce4299218eb853b83dfbe9647b10c6f5dfaaf12d99cefd1ecd83355","start":119}],"target_id":"concept.go.go0033060","target_kind":"node","target_sha256":"18bb1fb0e12894dbf88f955f56f5be22049f25c63ecc2145b33f75bfaa0ea60b"}],"concept.go.go0033774":[{"id":"assertion.concept.go.go0033774","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"basal labyrinth as defined in the captured Gene Ontology term GO:0033774","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines basal labyrinth as: A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","support":[{"end":271,"quote":"A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","source_id":"quickgo.go_0033774","source_sha256":"83c9ae02c9b38739d40b7cf41ca13941f1c689fbbf6b8e908b91fda8d0275b4d","start":114}],"target_id":"concept.go.go0033774","target_kind":"node","target_sha256":"8a2bfe50102fca88fd933371711c106c92de98a5b837a905b29ebd004fcdb097"}],"concept.go.go0034337":[{"id":"assertion.concept.go.go0034337","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"RNA folding as defined in the captured Gene Ontology term GO:0034337","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines RNA folding as: The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","support":[{"end":241,"quote":"The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","source_id":"quickgo.go_0034337","source_sha256":"1796163907838c57cde9143c1856bb37dab52af4b69cd132b7fdda66e33890d7","start":110}],"target_id":"concept.go.go0034337","target_kind":"node","target_sha256":"489d0490000be96970ac7105ada547784c19dcabb9295134c726d0f19e421cfd"}],"concept.go.go0034381":[{"id":"assertion.concept.go.go0034381","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasma lipoprotein particle clearance as defined in the captured Gene Ontology term GO:0034381","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle clearance as: The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","support":[{"end":275,"quote":"The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","source_id":"quickgo.go_0034381","source_sha256":"64aa7c738387332c2a43d17563829e4b663e5b9c1b710579d8027a0f05748d23","start":136}],"target_id":"concept.go.go0034381","target_kind":"node","target_sha256":"01d42178c58cb7c91aa33c21b0bf010a818ec5f836667d8384e8a5cc14019399"}],"concept.go.go0035073":[{"id":"assertion.concept.go.go0035073","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pupariation as defined in the captured Gene Ontology term GO:0035073","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupariation as: The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","support":[{"end":317,"quote":"The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","source_id":"quickgo.go_0035073","source_sha256":"39a577398194ec2b779b4bd407327909af72a223c530f604262128e772d97b29","start":110}],"target_id":"concept.go.go0035073","target_kind":"node","target_sha256":"cb20741a9b7cd8e0cd8a9b621a675258dbbdd68ad23cec3936cb9865f232845f"}],"concept.go.go0035074":[{"id":"assertion.concept.go.go0035074","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pupation as defined in the captured Gene Ontology term GO:0035074","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupation as: The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","support":[{"end":297,"quote":"The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","source_id":"quickgo.go_0035074","source_sha256":"8db26ddc996f0cbf64b763a710db3ab9054d20b540ca8e54c835bbd2068126fd","start":107}],"target_id":"concept.go.go0035074","target_kind":"node","target_sha256":"dd96e51d338a1e9701c77555fbe8305c32d2074dccb0b65f49ee5490962447ff"}],"concept.go.go0035172":[{"id":"assertion.concept.go.go0035172","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hemocyte proliferation as defined in the captured Gene Ontology term GO:0035172","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte proliferation as: The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","support":[{"end":442,"quote":"The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","source_id":"quickgo.go_0035172","source_sha256":"3afd6fbc8f3ef3de20a0b97d7765902b469c3094a97073a180a06136b61a7c8b","start":121}],"target_id":"concept.go.go0035172","target_kind":"node","target_sha256":"27f0e555ec94a4753b2deff96a0d2a778112455b0efe766dc7b6c3b8ec5139df"}],"concept.go.go0035212":[{"id":"assertion.concept.go.go0035212","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell competition in a multicellular organism as defined in the captured Gene Ontology term GO:0035212","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell competition in a multicellular organism as: Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","support":[{"end":309,"quote":"Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","source_id":"quickgo.go_0035212","source_sha256":"ffa7b1c96808e4ce233855bdb88f9202f4aac1cb7f279b9f966d2eb157607b05","start":143}],"target_id":"concept.go.go0035212","target_kind":"node","target_sha256":"b04c3502bb7ff6b34d8b418d61455960330032a0908c972bc17d6de2d5e6fa50"}],"concept.go.go0035264":[{"id":"assertion.concept.go.go0035264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism growth as defined in the captured Gene Ontology term GO:0035264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism growth as: The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","support":[{"end":220,"quote":"The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","source_id":"quickgo.go_0035264","source_sha256":"577b8a260cb3945067a0536785635682d91e8db77f145a7387c994b0167c4e21","start":128}],"target_id":"concept.go.go0035264","target_kind":"node","target_sha256":"23bf0ffefb058906358f770c4377a896326f735e0d3c2ccd3040414a8a534a2b"}],"concept.go.go0035265":[{"id":"assertion.concept.go.go0035265","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organ growth as defined in the captured Gene Ontology term GO:0035265","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organ growth as: The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","support":[{"end":330,"quote":"The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","source_id":"quickgo.go_0035265","source_sha256":"bd3063e7b69eb90fbb86df388cbfe457145a7956a938f71492de8cfd7efa12ae","start":111}],"target_id":"concept.go.go0035265","target_kind":"node","target_sha256":"010ee688918c48dfacf7fb59a7f8cbe94c73994c2a95e00c2b88f37bd8ff8787"}],"concept.go.go0035314":[{"id":"assertion.concept.go.go0035314","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"scab formation as defined in the captured Gene Ontology term GO:0035314","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines scab formation as: Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","support":[{"end":308,"quote":"Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","source_id":"quickgo.go_0035314","source_sha256":"ce9e9455164d885be3d556ce298cac5aa630ea7ef8958daf71c0f5df8ff363c0","start":113}],"target_id":"concept.go.go0035314","target_kind":"node","target_sha256":"cbf30eecf448c59813c49531f703f62005ea0f42f8c49a3f169668f3267f9195"}],"concept.go.go0035686":[{"id":"assertion.concept.go.go0035686","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm fibrous sheath as defined in the captured Gene Ontology term GO:0035686","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm fibrous sheath as: A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","support":[{"end":493,"quote":"A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","source_id":"quickgo.go_0035686","source_sha256":"965563cf1f68c7c910cf7767b4e8e78cbd2ba57da41b4108661f8be803da9538","start":119}],"target_id":"concept.go.go0035686","target_kind":"node","target_sha256":"47a0270a7eda624a8a805685ab1e1f50876011ce7824fd2dcaaad4b1b29e3b16"}],"concept.go.go0035732":[{"id":"assertion.concept.go.go0035732","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nitric oxide storage as defined in the captured Gene Ontology term GO:0035732","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nitric oxide storage as: The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","support":[{"end":356,"quote":"The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","source_id":"quickgo.go_0035732","source_sha256":"97aa9116c4c7ece8d6dd0312656d542fef5fd05b3a9907b48294398116d7e7ba","start":119}],"target_id":"concept.go.go0035732","target_kind":"node","target_sha256":"94a05f9b9bea52623257b914e32bdb953bca3bf7f4a4a5cf24764ec43ad6c0fd"}],"concept.go.go0035749":[{"id":"assertion.concept.go.go0035749","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myelin sheath adaxonal region as defined in the captured Gene Ontology term GO:0035749","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myelin sheath adaxonal region as: The region of the myelin sheath nearest to the axon.","support":[{"end":180,"quote":"The region of the myelin sheath nearest to the axon.","source_id":"quickgo.go_0035749","source_sha256":"d54885ab719c47613ba88ef31e71810f9926267e1cd10e7dadba4b63d10a1a41","start":128}],"target_id":"concept.go.go0035749","target_kind":"node","target_sha256":"1d49434cd5d49ffc10e405dd6d6b0a83a7489ad950f2dc916569a0f7d9d45085"}],"concept.go.go0035821":[{"id":"assertion.concept.go.go0035821","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modulation of process of another organism as defined in the captured Gene Ontology term GO:0035821","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines modulation of process of another organism as: A process in which an organism effects a change in a biological process in another organism.","support":[{"end":232,"quote":"A process in which an organism effects a change in a biological process in another organism.","source_id":"quickgo.go_0035821","source_sha256":"e3895bf1645221847999fa04b6125df7d45f37e8074095f90822a5fc934fefc6","start":140}],"target_id":"concept.go.go0035821","target_kind":"node","target_sha256":"7fc6d5c596592d5a65cf93bf680d803487de215f2f56f6b92568cc143be21c09"}],"concept.go.go0035889":[{"id":"assertion.concept.go.go0035889","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"otolith tethering as defined in the captured Gene Ontology term GO:0035889","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines otolith tethering as: The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","support":[{"end":205,"quote":"The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","source_id":"quickgo.go_0035889","source_sha256":"0a5ede1d25dbd58bac7ba80f3e027b210064a00d763fc288026d1e183cbb20c2","start":116}],"target_id":"concept.go.go0035889","target_kind":"node","target_sha256":"d6a8dd695f00a22547d579bdb946a11b93d431050e2d46160b31f0a56f95898e"}],"concept.go.go0036166":[{"id":"assertion.concept.go.go0036166","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phenotypic switching as defined in the captured Gene Ontology term GO:0036166","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines phenotypic switching as: A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","support":[{"end":618,"quote":"A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","source_id":"quickgo.go_0036166","source_sha256":"cdec9a058453c2a44af29b5e921893cbf842903a6d97147eaa6929833524a4b0","start":119}],"target_id":"concept.go.go0036166","target_kind":"node","target_sha256":"6c205657f9b6535582a35cbc6ada09df821b750c9c918ef0e951d64c61df9328"}],"concept.go.go0036268":[{"id":"assertion.concept.go.go0036268","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"swimming as defined in the captured Gene Ontology term GO:0036268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines swimming as: Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","support":[{"end":228,"quote":"Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","source_id":"quickgo.go_0036268","source_sha256":"5d50739c894aafbd1165e9acd7dbe7674292ec0ad4faf391ac955ddcc5d09405","start":107}],"target_id":"concept.go.go0036268","target_kind":"node","target_sha256":"8a56c687da97ec67dbdc41212642959fb4d37e7d21c91bdf602a9acdcb08fd76"}],"concept.go.go0036338":[{"id":"assertion.concept.go.go0036338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral membrane as defined in the captured Gene Ontology term GO:0036338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral membrane as: The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","support":[{"end":201,"quote":"The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","source_id":"quickgo.go_0036338","source_sha256":"6f344dd1965195bbeac7898a0f870427835182f2c1c88cfe758db7e7271d84a9","start":113}],"target_id":"concept.go.go0036338","target_kind":"node","target_sha256":"966ce8e7c44b0cca531b4f372333b2c693d4e34cbd58b1a213e1ff49e5ae1404"}],"concept.go.go0039624":[{"id":"assertion.concept.go.go0039624","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral outer capsid as defined in the captured Gene Ontology term GO:0039624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral outer capsid as: The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","support":[{"end":248,"quote":"The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","source_id":"quickgo.go_0039624","source_sha256":"4bc31e384d55441147aa0dbbda04a0afefe15d97a0cb8de5b1fab1ed5de8b443","start":117}],"target_id":"concept.go.go0039624","target_kind":"node","target_sha256":"bf3396fa2298ece26f7838ed6b9190a1392bb0863353e4836bec134ebba879de"}],"concept.go.go0039625":[{"id":"assertion.concept.go.go0039625","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral inner capsid as defined in the captured Gene Ontology term GO:0039625","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral inner capsid as: The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","support":[{"end":248,"quote":"The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","source_id":"quickgo.go_0039625","source_sha256":"7877813dea8bdcc48e620650f426452fa5034e19329e8f56295f788d24f5594c","start":117}],"target_id":"concept.go.go0039625","target_kind":"node","target_sha256":"7f3d01d72128033d84c803e702546bff803d2a4b17a61d24e04aee5e9c3c501b"}],"concept.go.go0039626":[{"id":"assertion.concept.go.go0039626","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral intermediate capsid as defined in the captured Gene Ontology term GO:0039626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral intermediate capsid as: The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","support":[{"end":242,"quote":"The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","source_id":"quickgo.go_0039626","source_sha256":"42c8334ea6889d846e504969e03b7a34ed0a7f6005172d2050baf9d1d106d3f2","start":124}],"target_id":"concept.go.go0039626","target_kind":"node","target_sha256":"13f1c87bf2f6f4236f94e7bb92efba67a30d86768c4eee2118be487dcc240fee"}],"concept.go.go0039642":[{"id":"assertion.concept.go.go0039642","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion nucleoid as defined in the captured Gene Ontology term GO:0039642","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion nucleoid as: The region of a virion in which the nucleic acid is confined.","support":[{"end":175,"quote":"The region of a virion in which the nucleic acid is confined.","source_id":"quickgo.go_0039642","source_sha256":"1aad3b2db8f859b4c09aaf6989952310f1166f50e3915a8a7a8e7858a6770812","start":114}],"target_id":"concept.go.go0039642","target_kind":"node","target_sha256":"aacf5e73f29553a964dbb3e3f591d277d0870c169b202aba8afb79e0abb0b667"}],"concept.go.go0039663":[{"id":"assertion.concept.go.go0039663","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"membrane fusion involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039663","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane fusion involved in viral entry into host cell as: Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","support":[{"end":313,"quote":"Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","source_id":"quickgo.go_0039663","source_sha256":"de0128a75a380babb7b2a0c60a9ae2c6c456c1b2dcac08b109fef1ba925db9d9","start":153}],"target_id":"concept.go.go0039663","target_kind":"node","target_sha256":"279758f4f09b3e8db459402d42535b6465bb7b9335c5cf3343c5396a440562ec"}],"concept.go.go0039664":[{"id":"assertion.concept.go.go0039664","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysis of host organelle involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039664","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysis of host organelle involved in viral entry into host cell as: The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","support":[{"end":439,"quote":"The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","source_id":"quickgo.go_0039664","source_sha256":"51ce6ce3e960e1823b252799dd757f8408f3a76f609751393436fb0912b2478d","start":161}],"target_id":"concept.go.go0039664","target_kind":"node","target_sha256":"fde59d81b83db7c7dbaa2ad57a85974239ec3e3ce549198f0e99dc91e00ede8e"}],"concept.go.go0039665":[{"id":"assertion.concept.go.go0039665","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"permeabilization of host organelle membrane involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039665","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines permeabilization of host organelle membrane involved in viral entry into host cell as: Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","support":[{"end":440,"quote":"Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","source_id":"quickgo.go_0039665","source_sha256":"c256b424581b0d1ae55c4483423ea43e4154e3f100fde7f08ecc78343974fa15","start":181}],"target_id":"concept.go.go0039665","target_kind":"node","target_sha256":"3f54f40a3cb7d31b4e6b9658406dd8b6925e24e14a76b11d5df6967c31179423"}],"concept.go.go0039674":[{"id":"assertion.concept.go.go0039674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"exit of virus from host cell nucleus as defined in the captured Gene Ontology term GO:0039674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines exit of virus from host cell nucleus as: The directed movement of the viral genome or a viral particle out of the host cell nucleus.","support":[{"end":226,"quote":"The directed movement of the viral genome or a viral particle out of the host cell nucleus.","source_id":"quickgo.go_0039674","source_sha256":"e6af6e197afe070b2fed5bf1ce60f60cb8630cc02a7304b940f178398c3cd226","start":135}],"target_id":"concept.go.go0039674","target_kind":"node","target_sha256":"5c8feee36fd8c997d495b9f3298eadc14f4939410b9c5dae83a82cbe0f569262"}],"concept.go.go0039678":[{"id":"assertion.concept.go.go0039678","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"symbiont genome ejection through host cell envelope as defined in the captured Gene Ontology term GO:0039678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines symbiont genome ejection through host cell envelope as: Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","support":[{"end":490,"quote":"Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","source_id":"quickgo.go_0039678","source_sha256":"a8c1840fde778631683e7088b85beed9198bc84e153ecf566635343d01ffb1e9","start":150}],"target_id":"concept.go.go0039678","target_kind":"node","target_sha256":"a63ee2f5d0f32ccf2d5bb23653b5f304b633f7eb742cc29d99bd14bb39e2d983"}],"concept.go.go0039700":[{"id":"assertion.concept.go.go0039700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fusion of viral membrane with host outer nuclear membrane as defined in the captured Gene Ontology term GO:0039700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fusion of viral membrane with host outer nuclear membrane as: Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","support":[{"end":481,"quote":"Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","source_id":"quickgo.go_0039700","source_sha256":"02231b93f2edc2066f4ef7111a01d5fed019b9b64ee8592c1541a7fdc20f3062","start":156}],"target_id":"concept.go.go0039700","target_kind":"node","target_sha256":"56eb958b0d9ba9276e2b2c23f782fc5eb4828a4e23246b938361fa0cdbf055e2"}],"concept.go.go0040007":[{"id":"assertion.concept.go.go0040007","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"growth as defined in the captured Gene Ontology term GO:0040007","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines growth as: The increase in size or mass of an entire organism, a part of an organism or a cell.","support":[{"end":189,"quote":"The increase in size or mass of an entire organism, a part of an organism or a cell.","source_id":"quickgo.go_0040007","source_sha256":"1055bdec88503c4ff1d346e54248db8f181802335e9eaf84d0359c1c74b0b2bd","start":105}],"target_id":"concept.go.go0040007","target_kind":"node","target_sha256":"f5d5878c85cca8e6c084de373628040ac1558cc4779bf5d707b2c9722b41bcb5"}],"concept.go.go0040011":[{"id":"assertion.concept.go.go0040011","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"locomotion as defined in the captured Gene Ontology term GO:0040011","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion as: Self-propelled movement of a cell or organism from one location to another.","support":[{"end":184,"quote":"Self-propelled movement of a cell or organism from one location to another.","source_id":"quickgo.go_0040011","source_sha256":"38956be9dd63fd7788ab95b180e9e67c91902d7aaab86983fc4613a8be21f328","start":109}],"target_id":"concept.go.go0040011","target_kind":"node","target_sha256":"865fb16e30e5c1e3b188ad7d5111580ee04b71af30eb1b40262eb17d242729e7"}],"concept.go.go0042303":[{"id":"assertion.concept.go.go0042303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"molting cycle as defined in the captured Gene Ontology term GO:0042303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle as: The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","support":[{"end":220,"quote":"The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","source_id":"quickgo.go_0042303","source_sha256":"11d44d145ed23d0adb48bd3406b6370e381de1ba78af1e6c988c29f9706db54c","start":112}],"target_id":"concept.go.go0042303","target_kind":"node","target_sha256":"fe49adee98abe00547990cc622a6ec40a9389b03adec9b7e7594468329a6f8a6"}],"concept.go.go0042330":[{"id":"assertion.concept.go.go0042330","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"taxis as defined in the captured Gene Ontology term GO:0042330","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines taxis as: The directed movement of a motile cell or organism in response to an external stimulus.","support":[{"end":191,"quote":"The directed movement of a motile cell or organism in response to an external stimulus.","source_id":"quickgo.go_0042330","source_sha256":"4b1088eee93e56ec8fcf48ac49dd1a0ecf398f3aecfb52f1a623a0993c10897e","start":104}],"target_id":"concept.go.go0042330","target_kind":"node","target_sha256":"668ea301529c08e41c7d2d5e908e3d393f07d7606e3be62a84570e1595709147"}],"concept.go.go0042386":[{"id":"assertion.concept.go.go0042386","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hemocyte differentiation as defined in the captured Gene Ontology term GO:0042386","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte differentiation as: The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","support":[{"end":448,"quote":"The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","source_id":"quickgo.go_0042386","source_sha256":"516fbe6e1c7bed42f3c49c41c096cebd82a9ea04337bf3b3cc1be632f05d9926","start":123}],"target_id":"concept.go.go0042386","target_kind":"node","target_sha256":"82c1a8661e8cef7bca3e4ad57b9d66c50aadf3cb21500b05cac78c6b15b49d9c"}],"concept.go.go0042592":[{"id":"assertion.concept.go.go0042592","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"homeostatic process as defined in the captured Gene Ontology term GO:0042592","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines homeostatic process as: Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","support":[{"end":312,"quote":"Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","source_id":"quickgo.go_0042592","source_sha256":"81938e703ef7d857e1679838084f76bdba8aeca5a0b78c85f7638716e81eb176","start":118}],"target_id":"concept.go.go0042592","target_kind":"node","target_sha256":"761921a1a0ca01ce374794b74618aca6c93234ca7adcd78ef02b4204450241fd"}],"concept.go.go0042628":[{"id":"assertion.concept.go.go0042628","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mating plug formation as defined in the captured Gene Ontology term GO:0042628","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating plug formation as: The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","support":[{"end":316,"quote":"The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","source_id":"quickgo.go_0042628","source_sha256":"24bfa0857613736a9ee83cebbf0953ab6a285f336cbc3e3bad5766552ff71db3","start":120}],"target_id":"concept.go.go0042628","target_kind":"node","target_sha256":"c2f43c3c084d81349df2dedbd74fbc13a47ba379cc3b2e32c686281125ecf6ce"}],"concept.go.go0042641":[{"id":"assertion.concept.go.go0042641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actomyosin as defined in the captured Gene Ontology term GO:0042641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actomyosin as: Any complex of actin, myosin, and accessory proteins.","support":[{"end":162,"quote":"Any complex of actin, myosin, and accessory proteins.","source_id":"quickgo.go_0042641","source_sha256":"d41bd1882b78b09d940488e3730f264a5ac09e27decca48c534cf666ca440eae","start":109}],"target_id":"concept.go.go0042641","target_kind":"node","target_sha256":"f0282089ce2124226aec4ee727987b268909086ef2bf1ea2afad63f14d7e3b9d"}],"concept.go.go0042698":[{"id":"assertion.concept.go.go0042698","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ovulation cycle as defined in the captured Gene Ontology term GO:0042698","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle as: The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","support":[{"end":268,"quote":"The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","source_id":"quickgo.go_0042698","source_sha256":"25b53c5691597dc11bd24957e21e66b13c71d247d2a8351cb94742d36a074e4d","start":114}],"target_id":"concept.go.go0042698","target_kind":"node","target_sha256":"7a53c0572b5a630ff014ee555ddadf8ba70721c648f610c776226606a2522da0"}],"concept.go.go0042763":[{"id":"assertion.concept.go.go0042763","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intracellular immature spore as defined in the captured Gene Ontology term GO:0042763","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intracellular immature spore as: A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","support":[{"end":413,"quote":"A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","source_id":"quickgo.go_0042763","source_sha256":"1a79fd31182fd54a3baddbdb3b8d593b2fc92ce753892e8424eb9e0a9c2ca879","start":127}],"target_id":"concept.go.go0042763","target_kind":"node","target_sha256":"2ae06f84aec6f53b8c3419b3f788ba59d14a907f4fed0d5f4961a8ecede11d21"}],"concept.go.go0042995":[{"id":"assertion.concept.go.go0042995","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell projection as defined in the captured Gene Ontology term GO:0042995","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell projection as: A prolongation or process extending from a cell, e.g. a flagellum or axon.","support":[{"end":188,"quote":"A prolongation or process extending from a cell, e.g. a flagellum or axon.","source_id":"quickgo.go_0042995","source_sha256":"6007707cff42a4620b0e14e1a772ea03df3469f1131417aa598da565a9f2737a","start":114}],"target_id":"concept.go.go0042995","target_kind":"node","target_sha256":"18e763f69c58fb0469529a1ae0f74c93b0b40c03137df0dcc482809a0117cda6"}],"concept.go.go0043036":[{"id":"assertion.concept.go.go0043036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"starch grain as defined in the captured Gene Ontology term GO:0043036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines starch grain as: Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","support":[{"end":351,"quote":"Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","source_id":"quickgo.go_0043036","source_sha256":"15ffb96ce564a574f2d220f5ea65e0557d9fcdcfa63ff3e4297b6cd795636097","start":111}],"target_id":"concept.go.go0043036","target_kind":"node","target_sha256":"cc895bf69a12496e713bf46cbb94172cce4446c26215960dc8bc977355685fc7"}],"concept.go.go0043083":[{"id":"assertion.concept.go.go0043083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptic cleft as defined in the captured Gene Ontology term GO:0043083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic cleft as: The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","support":[{"end":227,"quote":"The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","source_id":"quickgo.go_0043083","source_sha256":"2928e7ddd8916fde65223b3a4b9d56eef234b4e505000566306ac55150cf6831","start":113}],"target_id":"concept.go.go0043083","target_kind":"node","target_sha256":"4f650fff9afcf63edd166e036a6898656b4957dc719be30c020fdc94ab492491"}],"concept.go.go0043203":[{"id":"assertion.concept.go.go0043203","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axon hillock as defined in the captured Gene Ontology term GO:0043203","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines axon hillock as: Portion of the neuronal cell soma from which the axon originates.","support":[{"end":176,"quote":"Portion of the neuronal cell soma from which the axon originates.","source_id":"quickgo.go_0043203","source_sha256":"1dc4ef7a59cb88c61f0bd13b344ec3ae26f2dfcc9f98885404ad75ebaa7d7e69","start":111}],"target_id":"concept.go.go0043203","target_kind":"node","target_sha256":"078be83c5042948c9c412c6449abeb5665efd53ee962427297ff7bcdf8c0297c"}],"concept.go.go0043204":[{"id":"assertion.concept.go.go0043204","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perikaryon as defined in the captured Gene Ontology term GO:0043204","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines perikaryon as: The portion of the cell soma (neuronal cell body) that excludes the nucleus.","support":[{"end":185,"quote":"The portion of the cell soma (neuronal cell body) that excludes the nucleus.","source_id":"quickgo.go_0043204","source_sha256":"12c0b03702eb49aede39f3c55fa81ecada03f0ec75697b0774f3f3823a9cf08e","start":109}],"target_id":"concept.go.go0043204","target_kind":"node","target_sha256":"7ded4d606013441722736c74adc314efc8f5d2bbf581af0cd7d7d78b9d68587d"}],"concept.go.go0043220":[{"id":"assertion.concept.go.go0043220","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Schmidt-Lanterman incisure as defined in the captured Gene Ontology term GO:0043220","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines Schmidt-Lanterman incisure as: Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","support":[{"end":492,"quote":"Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","source_id":"quickgo.go_0043220","source_sha256":"65a50dda4a0a1058397544c5ac35d72c8912c61493afd796c02d22fca174e32b","start":125}],"target_id":"concept.go.go0043220","target_kind":"node","target_sha256":"ca73bb45b8fd64c77ded21311e6791e25298fe9ff075692421bb943d0d84f5d7"}],"concept.go.go0043226":[{"id":"assertion.concept.go.go0043226","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle as defined in the captured Gene Ontology term GO:0043226","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle as: Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","support":[{"end":364,"quote":"Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","source_id":"quickgo.go_0043226","source_sha256":"f3f37dba9b46174c75e79e32a721837308a534695ef9e2cb5e931b907f0f58d4","start":108}],"target_id":"concept.go.go0043226","target_kind":"node","target_sha256":"cb52a01c6fe71b810e424c44ebdea3ec6cdfcbe5d26136a604ad98788beca873"}],"concept.go.go0043335":[{"id":"assertion.concept.go.go0043335","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein unfolding as defined in the captured Gene Ontology term GO:0043335","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein unfolding as: The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","support":[{"end":288,"quote":"The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","source_id":"quickgo.go_0043335","source_sha256":"00b5c9f05041f503de4e9481b85d0296c767e50f1637d379eafbf91c4819e321","start":116}],"target_id":"concept.go.go0043335","target_kind":"node","target_sha256":"e669129f738eaf546f54f854cad7fb477af90203c8bfed77b4a245185c8ce389"}],"concept.go.go0043473":[{"id":"assertion.concept.go.go0043473","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigmentation as defined in the captured Gene Ontology term GO:0043473","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigmentation as: The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","support":[{"end":234,"quote":"The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","source_id":"quickgo.go_0043473","source_sha256":"1f4612bc319f483b330523bc797d9fe0964aa73d4ea4b5cd14eff47416bda396","start":111}],"target_id":"concept.go.go0043473","target_kind":"node","target_sha256":"3b214cf55db83309729c8b34f9a7b94245ff1ec4ac61ca55546970f1918b52be"}],"concept.go.go0043476":[{"id":"assertion.concept.go.go0043476","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigment accumulation as defined in the captured Gene Ontology term GO:0043476","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation as: The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","support":[{"end":259,"quote":"The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","source_id":"quickgo.go_0043476","source_sha256":"dbfb37142115ad4e8d083c9992fd0ae07e30423900973add141c5bccaeef0de8","start":119}],"target_id":"concept.go.go0043476","target_kind":"node","target_sha256":"1f6289f9f60f7be9b7fd0ddf11c5d1897107be9cd6985f9f2fc9ed14740b8d43"}],"concept.go.go0043480":[{"id":"assertion.concept.go.go0043480","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigment accumulation in tissues as defined in the captured Gene Ontology term GO:0043480","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation in tissues as: The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","support":[{"end":249,"quote":"The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","source_id":"quickgo.go_0043480","source_sha256":"278fa6c933d6b69398c0ce88664580b1e0d4923cb5c103a5b68557e7f1633bdd","start":130}],"target_id":"concept.go.go0043480","target_kind":"node","target_sha256":"cd5ab3f97a4b9a346cce25eba0d6e34acff71cad6a4fbd3a85cb0e97ef04efeb"}],"concept.go.go0043500":[{"id":"assertion.concept.go.go0043500","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"muscle adaptation as defined in the captured Gene Ontology term GO:0043500","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle adaptation as: A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","support":[{"end":564,"quote":"A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","source_id":"quickgo.go_0043500","source_sha256":"ea79e28950beb597058b0924231d7d30cbf8cde134cefb4c13c109bbfa5109ab","start":116}],"target_id":"concept.go.go0043500","target_kind":"node","target_sha256":"5e4010b2bb086c45722b802e49870121b1fafbe8b3388de654a3fd693c79f52f"}],"concept.go.go0043670":[{"id":"assertion.concept.go.go0043670","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"foot layer as defined in the captured Gene Ontology term GO:0043670","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines foot layer as: The inner layer of the ectexine.","support":[{"end":141,"quote":"The inner layer of the ectexine.","source_id":"quickgo.go_0043670","source_sha256":"2e790bfea57c7c37e4d5e5050073789fa2d343559bbfe0a0df5843c88216aabe","start":109}],"target_id":"concept.go.go0043670","target_kind":"node","target_sha256":"27307ebdd764d6f2b5cf187d4a532f3bb78f94c57692fcc38bc8fe75f60a77f4"}],"concept.go.go0043671":[{"id":"assertion.concept.go.go0043671","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"endexine as defined in the captured Gene Ontology term GO:0043671","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines endexine as: The inner part of the exine, which stains.","support":[{"end":149,"quote":"The inner part of the exine, which stains.","source_id":"quickgo.go_0043671","source_sha256":"18314252e84ed863dd771ba397d998f2f6b1e6ac90b52fc8ef8d4749a185809e","start":107}],"target_id":"concept.go.go0043671","target_kind":"node","target_sha256":"37732160400ea3b92d5c39741c95c28f6b08e387540983e96d4818cf26940d24"}],"concept.go.go0043672":[{"id":"assertion.concept.go.go0043672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nexine as defined in the captured Gene Ontology term GO:0043672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nexine as: The inner, non-sculptured part of the exine which lies below the sexine.","support":[{"end":177,"quote":"The inner, non-sculptured part of the exine which lies below the sexine.","source_id":"quickgo.go_0043672","source_sha256":"91f9d3a4d7c228d52ba1d293bc582779e4d2cd174729b121005c82d7a5f6b031","start":105}],"target_id":"concept.go.go0043672","target_kind":"node","target_sha256":"2e9ecc920bc29722d7aa48ceb59bac564dc481c67e06df03deb85071a86f5b68"}],"concept.go.go0043696":[{"id":"assertion.concept.go.go0043696","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dedifferentiation as defined in the captured Gene Ontology term GO:0043696","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dedifferentiation as: The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","support":[{"end":434,"quote":"The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","source_id":"quickgo.go_0043696","source_sha256":"6946c65c8dca514211621043e7b07461bf67a311e1e44628390cb2f41dc9368e","start":116}],"target_id":"concept.go.go0043696","target_kind":"node","target_sha256":"9e26bfde981b72f5ef6c833231a6b71e8a90c40719d919851abaa4c653bbb0e1"}],"concept.go.go0043934":[{"id":"assertion.concept.go.go0043934","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sporulation as defined in the captured Gene Ontology term GO:0043934","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sporulation as: The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","support":[{"end":397,"quote":"The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","source_id":"quickgo.go_0043934","source_sha256":"6049fd624413746c6a83bb6c4427d714f39bfd700fab9a69be744a70ea92a5de","start":110}],"target_id":"concept.go.go0043934","target_kind":"node","target_sha256":"f6f9357cb4d33958d60b0f4f912a1f4072f21859894cb5954965f790056329c7"}],"concept.go.go0044010":[{"id":"assertion.concept.go.go0044010","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"single-species biofilm formation as defined in the captured Gene Ontology term GO:0044010","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-species biofilm formation as: A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","support":[{"end":434,"quote":"A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","source_id":"quickgo.go_0044010","source_sha256":"51abedd86391931e84b4ecf80ae8dfd7372df2b2281fc25c0d5997009f5fe849","start":131}],"target_id":"concept.go.go0044010","target_kind":"node","target_sha256":"f7b9a2a372466c7a887e6b2fa950db595ec91327d531357a60e792041edef870"}],"concept.go.go0044111":[{"id":"assertion.concept.go.go0044111","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"formation of structure involved in a symbiotic process as defined in the captured Gene Ontology term GO:0044111","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines formation of structure involved in a symbiotic process as: The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","support":[{"end":290,"quote":"The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","source_id":"quickgo.go_0044111","source_sha256":"56ae00f9ab947177e342d0da4dfc40d697d2c9981f2feceefbe04f8bc4301303","start":153}],"target_id":"concept.go.go0044111","target_kind":"node","target_sha256":"bdd5eaf7d3cce5a7b6189094e90df27f9ca8a086f0c495589b0d7be81c732a90"}],"concept.go.go0044232":[{"id":"assertion.concept.go.go0044232","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle membrane contact site as defined in the captured Gene Ontology term GO:0044232","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle membrane contact site as: A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","support":[{"end":546,"quote":"A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","source_id":"quickgo.go_0044232","source_sha256":"0e65f2024b10f01303127b34153c7eb296d97a94eca73564d837bd3b1b97cded","start":130}],"target_id":"concept.go.go0044232","target_kind":"node","target_sha256":"ac8a06b9f9c124f8f78ecd0fbbf57fad5407ae39f1884b0cb292d8de46e9e3cb"}],"concept.go.go0044403":[{"id":"assertion.concept.go.go0044403","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in symbiotic interaction as defined in the captured Gene Ontology term GO:0044403","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in symbiotic interaction as: A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","support":[{"end":1149,"quote":"A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","source_id":"quickgo.go_0044403","source_sha256":"8fe4290ea8152974eac457ebddb17762fca1342e5bd4a6243de2b13812aa85ba","start":151}],"target_id":"concept.go.go0044403","target_kind":"node","target_sha256":"33ea22d24249ad4ae648daf4060dac665509aebb4c0f61dc2e90a35708bc5a8b"}],"concept.go.go0044419":[{"id":"assertion.concept.go.go0044419","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in interspecies interaction between organisms as defined in the captured Gene Ontology term GO:0044419","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in interspecies interaction between organisms as: Any process evolved to enable an interaction with an organism of a different species.","support":[{"end":257,"quote":"Any process evolved to enable an interaction with an organism of a different species.","source_id":"quickgo.go_0044419","source_sha256":"caaa7131c55b1b92707c39250f60feefaaba158d94dfc9add6eac3f9dc1eaccb","start":172}],"target_id":"concept.go.go0044419","target_kind":"node","target_sha256":"a087d29129d0d203fb631bb040431cea520fecfb83c2aa86dd39a9ec00f6c0f4"}],"concept.go.go0044423":[{"id":"assertion.concept.go.go0044423","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion component as defined in the captured Gene Ontology term GO:0044423","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion component as: Any constituent part of a virion, a complete fully infectious extracellular virus particle.","support":[{"end":206,"quote":"Any constituent part of a virion, a complete fully infectious extracellular virus particle.","source_id":"quickgo.go_0044423","source_sha256":"fccd05e9c8f4dc9d2004cff636cc638d253f7fe7725c521ed7cbc9fa8a03b53b","start":115}],"target_id":"concept.go.go0044423","target_kind":"node","target_sha256":"e940147924a5700450e7109982783591b2f92820b5012365b11016cefa04aad2"}],"concept.go.go0044703":[{"id":"assertion.concept.go.go0044703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multi-organism reproductive process as defined in the captured Gene Ontology term GO:0044703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-organism reproductive process as: A biological process that directly contributes to the process of producing new individuals, involving another organism.","support":[{"end":253,"quote":"A biological process that directly contributes to the process of producing new individuals, involving another organism.","source_id":"quickgo.go_0044703","source_sha256":"bab436f05098a96c49ff4879f016accff8aa32aec283b1976599e7b043bf313b","start":134}],"target_id":"concept.go.go0044703","target_kind":"node","target_sha256":"ff5fd1bf35e48eed952d6248b699a01e52efb162560b6ff08cef2e72d95a0157"}],"concept.go.go0044706":[{"id":"assertion.concept.go.go0044706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multi-multicellular organism process as defined in the captured Gene Ontology term GO:0044706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-multicellular organism process as: A multicellular organism process which involves another multicellular organism of the same or different species.","support":[{"end":247,"quote":"A multicellular organism process which involves another multicellular organism of the same or different species.","source_id":"quickgo.go_0044706","source_sha256":"985ed1585563c317059450944bad63ac86cf3f6d901d48a6a8647c73550e3259","start":135}],"target_id":"concept.go.go0044706","target_kind":"node","target_sha256":"0dc87f780bd87220306fa752e0bf28293fc593654a33a610142b3481ab632985"}],"concept.go.go0044826":[{"id":"assertion.concept.go.go0044826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome integration into host DNA as defined in the captured Gene Ontology term GO:0044826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome integration into host DNA as: The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","support":[{"end":426,"quote":"The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","source_id":"quickgo.go_0044826","source_sha256":"61a28e0e468721b2357d9b3a6ee715a36d88bc90361c0793913dd1b6d2b6d768","start":137}],"target_id":"concept.go.go0044826","target_kind":"node","target_sha256":"902e467b2583af5626a376caba74ab19be67713f716f69d9bdea8bdee2d02621"}],"concept.go.go0044848":[{"id":"assertion.concept.go.go0044848","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological phase as defined in the captured Gene Ontology term GO:0044848","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological phase as: A distinct period or stage in a biological process or cycle.","support":[{"end":175,"quote":"A distinct period or stage in a biological process or cycle.","source_id":"quickgo.go_0044848","source_sha256":"e99b0f41df15604031dd95bdf676d95c72ebaeb31f0ed6b9c3bae024dae3e7a2","start":115}],"target_id":"concept.go.go0044848","target_kind":"node","target_sha256":"2db11b8ead808983900d6677d44103d1df5121a7c82a6ba87724d874a2e00e74"}],"concept.go.go0044851":[{"id":"assertion.concept.go.go0044851","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hair cycle phase as defined in the captured Gene Ontology term GO:0044851","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hair cycle phase as: The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","support":[{"end":411,"quote":"The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","source_id":"quickgo.go_0044851","source_sha256":"0900721e388e48ca7365a0ebd51d981bf3641e097b8d2db44e19b4a92366d229","start":115}],"target_id":"concept.go.go0044851","target_kind":"node","target_sha256":"9bb53836da524b8db0128018e427678e453fbbedb210c6d7408f05ba6e63f33d"}],"concept.go.go0045056":[{"id":"assertion.concept.go.go0045056","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transcytosis as defined in the captured Gene Ontology term GO:0045056","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transcytosis as: The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","support":[{"end":239,"quote":"The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","source_id":"quickgo.go_0045056","source_sha256":"349c64eeefc59a0b2a2ecab1c3f45e220b231f35cb052168c61f39ab980d2020","start":111}],"target_id":"concept.go.go0045056","target_kind":"node","target_sha256":"d3e519e0ec7a470b8549a5f5e6aafbe3f5639a3f8d0838e98c535828d4dba82f"}],"concept.go.go0045058":[{"id":"assertion.concept.go.go0045058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"T cell selection as defined in the captured Gene Ontology term GO:0045058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines T cell selection as: The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","support":[{"end":290,"quote":"The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","source_id":"quickgo.go_0045058","source_sha256":"8a86da2ab9312e0208da072acef43d99b99171b4ac78f7f92bad3329212bb8a9","start":115}],"target_id":"concept.go.go0045058","target_kind":"node","target_sha256":"6af61b40c105cd813df225c05b48035a5dd4508f9bbc0274a043f05bef7f9df5"}],"concept.go.go0045103":[{"id":"assertion.concept.go.go0045103","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intermediate filament-based process as defined in the captured Gene Ontology term GO:0045103","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intermediate filament-based process as: Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","support":[{"end":317,"quote":"Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","source_id":"quickgo.go_0045103","source_sha256":"62019d810d4cd532025e4977dc52d090c577c03d758e2597898e8e54d294f79e","start":134}],"target_id":"concept.go.go0045103","target_kind":"node","target_sha256":"227d9cf41c7cc6fa20c14d86fa225570d71fd367834ff9a75a471fc9cc669397"}],"concept.go.go0045171":[{"id":"assertion.concept.go.go0045171","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intercellular bridge as defined in the captured Gene Ontology term GO:0045171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intercellular bridge as: A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","support":[{"end":452,"quote":"A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","source_id":"quickgo.go_0045171","source_sha256":"4314e57de486ac71fed9304d4504e713abfff2b1834271cb3b14ba1ffc7bddf6","start":119}],"target_id":"concept.go.go0045171","target_kind":"node","target_sha256":"b98645f196c68ee911e291aad61b114ac95c9de4cc915d834163c3f86d03b889"}],"concept.go.go0045321":[{"id":"assertion.concept.go.go0045321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte activation as defined in the captured Gene Ontology term GO:0045321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte activation as: A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","support":[{"end":271,"quote":"A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","source_id":"quickgo.go_0045321","source_sha256":"059b55b75ee8d1c760538996a7adef73254da5dc79a4385e373bf1bff2988b03","start":119}],"target_id":"concept.go.go0045321","target_kind":"node","target_sha256":"003109cd97ae2e4217a56aa9383c25de1f7fe8d0d51669c5ae964347b4a60067"}],"concept.go.go0045494":[{"id":"assertion.concept.go.go0045494","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor cell maintenance as defined in the captured Gene Ontology term GO:0045494","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor cell maintenance as: Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","support":[{"end":242,"quote":"Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","source_id":"quickgo.go_0045494","source_sha256":"4b22d298ae411cf4fc8449c04268d6442801bba0a1b1b5982cd5c9a375308540","start":129}],"target_id":"concept.go.go0045494","target_kind":"node","target_sha256":"78393e3148741e41b4d90a34ef1e101af20017648f0fdca2c02d73f495382624"}],"concept.go.go0046727":[{"id":"assertion.concept.go.go0046727","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"capsomere as defined in the captured Gene Ontology term GO:0046727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines capsomere as: Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","support":[{"end":203,"quote":"Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","source_id":"quickgo.go_0046727","source_sha256":"2d334c684e7d03a0571bb1ebb0e7f60b256098edad023a25e239d6551f27f5b0","start":108}],"target_id":"concept.go.go0046727","target_kind":"node","target_sha256":"044680338dfde052a7cb36560725d3069210f4731df50d03a755794b86d4e7db"}],"concept.go.go0046729":[{"id":"assertion.concept.go.go0046729","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral procapsid as defined in the captured Gene Ontology term GO:0046729","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral procapsid as: A stable empty viral capsid produced during the assembly of viruses.","support":[{"end":182,"quote":"A stable empty viral capsid produced during the assembly of viruses.","source_id":"quickgo.go_0046729","source_sha256":"71e580733df434d61eb73afcf00d9e7544ac9e971e0733337cccd7527c1f0a0e","start":114}],"target_id":"concept.go.go0046729","target_kind":"node","target_sha256":"af91d57b959848a11d0ffa8cbda1b1d2fad13398d71ec472473a2dcd68a53b60"}],"concept.go.go0046745":[{"id":"assertion.concept.go.go0046745","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid secondary envelopment as defined in the captured Gene Ontology term GO:0046745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid secondary envelopment as: The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","support":[{"end":252,"quote":"The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","source_id":"quickgo.go_0046745","source_sha256":"5984ccdd4d17615a4ac57c1690c03d208f77695219d82dc4597f35a5e6c8c76e","start":133}],"target_id":"concept.go.go0046745","target_kind":"node","target_sha256":"9dc931c0f523cc8c570d788e142c6e128fab38138384aec49f77b2474a1ab496"}],"concept.go.go0046755":[{"id":"assertion.concept.go.go0046755","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral budding as defined in the captured Gene Ontology term GO:0046755","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral budding as: A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","support":[{"end":595,"quote":"A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","source_id":"quickgo.go_0046755","source_sha256":"91ea57770672eae1450a916976ad3132ce9acd3aff6b2a342d706154b243ea44","start":112}],"target_id":"concept.go.go0046755","target_kind":"node","target_sha256":"99ad2942616258efdead28fc24ba4e2a6b31716e5ff61bd842d3d0c74536a7a3"}],"concept.go.go0046784":[{"id":"assertion.concept.go.go0046784","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral mRNA export from host cell nucleus as defined in the captured Gene Ontology term GO:0046784","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral mRNA export from host cell nucleus as: The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","support":[{"end":241,"quote":"The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","source_id":"quickgo.go_0046784","source_sha256":"47c106c59edb42af81464fb41a3904fa51a2f01f31b715cbd3d26ecfb28f91f2","start":139}],"target_id":"concept.go.go0046784","target_kind":"node","target_sha256":"c2eb945c1f7ed83c5e8bd501686dc3d7bca294a92c16005befc3712d14e69b07"}],"concept.go.go0046786":[{"id":"assertion.concept.go.go0046786","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral replication complex formation and maintenance as defined in the captured Gene Ontology term GO:0046786","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral replication complex formation and maintenance as: The process of organizing and assembling viral replication proteins in preparation for viral replication.","support":[{"end":255,"quote":"The process of organizing and assembling viral replication proteins in preparation for viral replication.","source_id":"quickgo.go_0046786","source_sha256":"e632bbdd9c27eb8da14f90e6e2230d561d75ef929214f0e7da67a5ba1cb0b42a","start":150}],"target_id":"concept.go.go0046786","target_kind":"node","target_sha256":"47359025dd3b584274c5487e36ffe83ec42ef19573583c49101c578765abd419"}],"concept.go.go0046794":[{"id":"assertion.concept.go.go0046794","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transport of virus as defined in the captured Gene Ontology term GO:0046794","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transport of virus as: The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","support":[{"end":207,"quote":"The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","source_id":"quickgo.go_0046794","source_sha256":"d2f27561a33597dd82c8d646f73957d8b7c7df92c80731c37c65a65bdd093cc9","start":117}],"target_id":"concept.go.go0046794","target_kind":"node","target_sha256":"aadb31d8404610dc37567021a87ee334ef48dc9713a325af89729e7e7ff35f3b"}],"concept.go.go0046807":[{"id":"assertion.concept.go.go0046807","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral scaffold assembly and maintenance as defined in the captured Gene Ontology term GO:0046807","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral scaffold assembly and maintenance as: The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","support":[{"end":234,"quote":"The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","source_id":"quickgo.go_0046807","source_sha256":"743e88d4685e0a9efe093adf34a280740cfd9b032f1edf6c01e3a862d2199c3b","start":138}],"target_id":"concept.go.go0046807","target_kind":"node","target_sha256":"1b77a29415ea29b9b5a3b09d7f199fc2bf641e81fec14e681a3c5ef09d6a6078"}],"concept.go.go0046818":[{"id":"assertion.concept.go.go0046818","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dense nuclear body as defined in the captured Gene Ontology term GO:0046818","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense nuclear body as: A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","support":[{"end":295,"quote":"A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","source_id":"quickgo.go_0046818","source_sha256":"23e1b2d0ec304fbc4ac1e7926e7c996eb66713a9df74449d1fa8bc371148055f","start":117}],"target_id":"concept.go.go0046818","target_kind":"node","target_sha256":"8eacd71403f0abb6c1aebbdab20783881de0f12f487b803a751a0098f30aa52c"}],"concept.go.go0048046":[{"id":"assertion.concept.go.go0048046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"apoplast as defined in the captured Gene Ontology term GO:0048046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines apoplast as: The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","support":[{"end":502,"quote":"The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","source_id":"quickgo.go_0048046","source_sha256":"8e0c5caf8efd6fe637b0c75dbaea4482698d8b80db5ed824c2951742279000cf","start":107}],"target_id":"concept.go.go0048046","target_kind":"node","target_sha256":"c5a4afa597b9b95f9f5bc21e359d8454876a1c27e3e19e5aec24dc63caec16c7"}],"concept.go.go0048066":[{"id":"assertion.concept.go.go0048066","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental pigmentation as defined in the captured Gene Ontology term GO:0048066","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental pigmentation as: The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","support":[{"end":232,"quote":"The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","source_id":"quickgo.go_0048066","source_sha256":"ea2a06c6f70324e1ffd15ad92d39de2f087d221546a2e67ad9bac6e68a139196","start":125}],"target_id":"concept.go.go0048066","target_kind":"node","target_sha256":"f48526c4e466d4e26d0ed0771dc0305e02795d42dad2d61c279f22c28ea8b534"}],"concept.go.go0048471":[{"id":"assertion.concept.go.go0048471","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perinuclear region of cytoplasm as defined in the captured Gene Ontology term GO:0048471","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines perinuclear region of cytoplasm as: Cytoplasm situated near, or occurring around, the nucleus.","support":[{"end":188,"quote":"Cytoplasm situated near, or occurring around, the nucleus.","source_id":"quickgo.go_0048471","source_sha256":"fe4aab30375c0b84df8fb92ac42d0b569d8cb3031e01733cc15acfde3c3906c4","start":130}],"target_id":"concept.go.go0048471","target_kind":"node","target_sha256":"8082df25b5daa1c9d3c8a0c16b8f29e443412cf3ba4f0562a834edb904ddfd5f"}],"concept.go.go0048489":[{"id":"assertion.concept.go.go0048489","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptic vesicle transport as defined in the captured Gene Ontology term GO:0048489","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic vesicle transport as: The directed movement of synaptic vesicles.","support":[{"end":168,"quote":"The directed movement of synaptic vesicles.","source_id":"quickgo.go_0048489","source_sha256":"2b3ba9b1a7b0abe430f7882b867ac5e34e18b3bd3a8da31452a26cc053ff4734","start":125}],"target_id":"concept.go.go0048489","target_kind":"node","target_sha256":"094bf982fa8914313620501410c76282249a7f20efa04ba3c0cb5b9561bf1806"}],"concept.go.go0048511":[{"id":"assertion.concept.go.go0048511","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rhythmic process as defined in the captured Gene Ontology term GO:0048511","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines rhythmic process as: Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","support":[{"end":215,"quote":"Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","source_id":"quickgo.go_0048511","source_sha256":"da6b8872db87126c73b7237f2fff971754b59819b535b60e0cc3d52f7e4c792a","start":115}],"target_id":"concept.go.go0048511","target_kind":"node","target_sha256":"fb8cf81ca1b45ec85337b34ea0676fe853bd3f4d8c60e6bafbe5e2f630b4abb0"}],"concept.go.go0048532":[{"id":"assertion.concept.go.go0048532","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure arrangement as defined in the captured Gene Ontology term GO:0048532","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure arrangement as: The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":401,"quote":"The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048532","source_sha256":"50e9a88096661593bb0ef698e0642b3b5bebc56cfee567849765fe5894000aa5","start":131}],"target_id":"concept.go.go0048532","target_kind":"node","target_sha256":"754811886f23889b0797f5515b235da4d1a723a22ae673d88c35e03ca565e2a1"}],"concept.go.go0048589":[{"id":"assertion.concept.go.go0048589","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental growth as defined in the captured Gene Ontology term GO:0048589","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental growth as: The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","support":[{"end":339,"quote":"The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","source_id":"quickgo.go_0048589","source_sha256":"4b77bda5106353dfa3e162ece62d8ebdf9814cbb8855658b85702bfbd7a26d94","start":119}],"target_id":"concept.go.go0048589","target_kind":"node","target_sha256":"f9fd953146dffedf36d02134afdb542f640b918e67518243c5689414cb0050ea"}],"concept.go.go0048609":[{"id":"assertion.concept.go.go0048609","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal reproductive process as defined in the captured Gene Ontology term GO:0048609","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal reproductive process as: The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","support":[{"end":343,"quote":"The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","source_id":"quickgo.go_0048609","source_sha256":"0e33c1e15ee32189774c078deeb9d9e82660a2d3d9cab68432250fcc61c37d41","start":144}],"target_id":"concept.go.go0048609","target_kind":"node","target_sha256":"78d1a812af5a31063d071b416e2cba2e08e6a9e804045a48f6305f7123f1fcb1"}],"concept.go.go0048646":[{"id":"assertion.concept.go.go0048646","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure formation involved in morphogenesis as defined in the captured Gene Ontology term GO:0048646","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure formation involved in morphogenesis as: The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":638,"quote":"The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048646","source_sha256":"fe1a7d3ae98284d3302d2407e0fbc2d82e1e0a476b01105afb020df2bb91e5aa","start":155}],"target_id":"concept.go.go0048646","target_kind":"node","target_sha256":"015ebe4b30d46b31bac8d596f358b43fea2234328597cb77564de330aaacbe26"}],"concept.go.go0048647":[{"id":"assertion.concept.go.go0048647","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"polyphenic determination as defined in the captured Gene Ontology term GO:0048647","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines polyphenic determination as: The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","support":[{"end":346,"quote":"The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","source_id":"quickgo.go_0048647","source_sha256":"2ddaef8210c1f1e8edb3e490cb15b8b19f55036bce4e7150c91ac90cd55d969a","start":123}],"target_id":"concept.go.go0048647","target_kind":"node","target_sha256":"28ab932c056dfadb62c0e329dbdf1dd7d050c99f7a5d7df64bc46a13bad64adc"}],"concept.go.go0048771":[{"id":"assertion.concept.go.go0048771","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tissue remodeling as defined in the captured Gene Ontology term GO:0048771","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue remodeling as: The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","support":[{"end":345,"quote":"The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","source_id":"quickgo.go_0048771","source_sha256":"6306d3f7c52887b646291b6db9eefc23a6dec622d9014eb431018f64da228c3b","start":116}],"target_id":"concept.go.go0048771","target_kind":"node","target_sha256":"b2a21f72a115d61f10bfc5e1c0af89c5828986cf0400b3a6f49e88a2ec5eab76"}],"concept.go.go0048856":[{"id":"assertion.concept.go.go0048856","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure development as defined in the captured Gene Ontology term GO:0048856","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure development as: The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":630,"quote":"The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048856","source_sha256":"351e5ac4b7d63ca322502ff1c1fcbd5d95ee2d0c4d0dc2461ee3c2624ede5754","start":131}],"target_id":"concept.go.go0048856","target_kind":"node","target_sha256":"1ff418e70a78ff2da50a2247a2440fbd9bfc4b6f067edd945fc386c6b0908a9e"}],"concept.go.go0048869":[{"id":"assertion.concept.go.go0048869","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular developmental process as defined in the captured Gene Ontology term GO:0048869","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular developmental process as: A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","support":[{"end":259,"quote":"A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","source_id":"quickgo.go_0048869","source_sha256":"c25beaf02b4c0134dcb19d0439d5c8f5885f18909d7a3f21fdcd78d22ca0b459","start":129}],"target_id":"concept.go.go0048869","target_kind":"node","target_sha256":"d0291577c3b589c97a21f686a6c8ee5e200a73dd2fd1a17d62c6fa011b02e693"}],"concept.go.go0048870":[{"id":"assertion.concept.go.go0048870","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell motility as defined in the captured Gene Ontology term GO:0048870","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell motility as: Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","support":[{"end":253,"quote":"Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","source_id":"quickgo.go_0048870","source_sha256":"cd480c211a9d10763d93c57a8a4efc33026527e7b10e1bcbdec5e5e85e22abb6","start":112}],"target_id":"concept.go.go0048870","target_kind":"node","target_sha256":"5fd0d3fbff4e47519d3a8851b7cc77c91143c72bfdf1233bc0f891ca03c3cad3"}],"concept.go.go0048871":[{"id":"assertion.concept.go.go0048871","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal-level homeostasis as defined in the captured Gene Ontology term GO:0048871","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","support":[{"end":252,"quote":"Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","source_id":"quickgo.go_0048871","source_sha256":"b14ca830aaf89b1286ff06d28c492ada566fb076b61b2ad28563b8baacbe52c1","start":141}],"target_id":"concept.go.go0048871","target_kind":"node","target_sha256":"4d14c1a42b8e9367ade24b54481c3e56d098b729cf841b95ff55d058ae068090"}],"concept.go.go0048878":[{"id":"assertion.concept.go.go0048878","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chemical homeostasis as defined in the captured Gene Ontology term GO:0048878","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chemical homeostasis as: Any biological process involved in the maintenance of an internal steady state of a chemical.","support":[{"end":212,"quote":"Any biological process involved in the maintenance of an internal steady state of a chemical.","source_id":"quickgo.go_0048878","source_sha256":"41b84c168e4ef635f12f6ed6933e4488ea14fcc9921188d35cbfa443026876f3","start":119}],"target_id":"concept.go.go0048878","target_kind":"node","target_sha256":"5d3b6068451fea7c6c0f4d9fe2605d307f2851abdedff049c617e4bc57dd66db"}],"concept.go.go0050817":[{"id":"assertion.concept.go.go0050817","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"coagulation as defined in the captured Gene Ontology term GO:0050817","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines coagulation as: The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","support":[{"end":203,"quote":"The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","source_id":"quickgo.go_0050817","source_sha256":"f415cc80c390dd54f46b58e4b20b6af903645bf8a59de3b5cc03e67e27c99681","start":110}],"target_id":"concept.go.go0050817","target_kind":"node","target_sha256":"75150b3618fba1e91396725b62b92e853d29407b5211698e7f51d73f83bde4c6"}],"concept.go.go0050879":[{"id":"assertion.concept.go.go0050879","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal movement as defined in the captured Gene Ontology term GO:0050879","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal movement as: Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","support":[{"end":270,"quote":"Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","source_id":"quickgo.go_0050879","source_sha256":"24bcd2079c5b1858e6781c271f3182e286edcecc6cca7547ceceb89d31759887","start":132}],"target_id":"concept.go.go0050879","target_kind":"node","target_sha256":"324cf3d36ea99d69f17710c6b0b12218cf7f655f8c30e37e9d6f42e46926361c"}],"concept.go.go0050900":[{"id":"assertion.concept.go.go0050900","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte migration as defined in the captured Gene Ontology term GO:0050900","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte migration as: The movement of a leukocyte within or between different tissues and organs of the body.","support":[{"end":205,"quote":"The movement of a leukocyte within or between different tissues and organs of the body.","source_id":"quickgo.go_0050900","source_sha256":"4d215ce417fd9f27169c775ae8fcb0b3ec1f071dc7f4e7498035bec1c9205921","start":118}],"target_id":"concept.go.go0050900","target_kind":"node","target_sha256":"f9c790a01e43751e39d33ace7a545d88f99281562b942aee8725ea2a84be99f2"}],"concept.go.go0051179":[{"id":"assertion.concept.go.go0051179","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"localization as defined in the captured Gene Ontology term GO:0051179","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization as: Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","support":[{"end":378,"quote":"Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","source_id":"quickgo.go_0051179","source_sha256":"6b4088f726c151c21a046fe14a74a453d624aa42c95ee179d9f587197aec8c13","start":111}],"target_id":"concept.go.go0051179","target_kind":"node","target_sha256":"52239215dfa725c763d1c6278b4bb1551092664b9065b3215a537dd6fdc97b92"}],"concept.go.go0051301":[{"id":"assertion.concept.go.go0051301","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell division as defined in the captured Gene Ontology term GO:0051301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division as: The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","support":[{"end":334,"quote":"The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","source_id":"quickgo.go_0051301","source_sha256":"50a454a0aa35155dd4a33f2cfe4aefb4888e0ca8a9573b86e80708ac7d055039","start":112}],"target_id":"concept.go.go0051301","target_kind":"node","target_sha256":"875afeb195578358d97d157d0f84e999058dead738816346b1567fb5108647c9"}],"concept.go.go0051321":[{"id":"assertion.concept.go.go0051321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic cell cycle as defined in the captured Gene Ontology term GO:0051321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle as: Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","support":[{"end":323,"quote":"Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","source_id":"quickgo.go_0051321","source_sha256":"71cb5dcea8612577eec3ba94377457263bdfc26a52367ba9b0ff2e08e6ae3143","start":117}],"target_id":"concept.go.go0051321","target_kind":"node","target_sha256":"f380fed8bb1fe5f59252f7c8035be1a942c06fa3dd924ba7dadb1c4c0524aba3"}],"concept.go.go0051410":[{"id":"assertion.concept.go.go0051410","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of nitrogen compound as defined in the captured Gene Ontology term GO:0051410","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of nitrogen compound as: Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","support":[{"end":317,"quote":"Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","source_id":"quickgo.go_0051410","source_sha256":"583f859b293ffd3b75062d38ddf4f051e086b26172122d113d3fc135a81fc9ce","start":134}],"target_id":"concept.go.go0051410","target_kind":"node","target_sha256":"9c311a2b6433a08ca95c8b1aca84b48b7682c6f2f2a10426130431bfae80a9cb"}],"concept.go.go0051606":[{"id":"assertion.concept.go.go0051606","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detection of stimulus as defined in the captured Gene Ontology term GO:0051606","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detection of stimulus as: The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","support":[{"end":233,"quote":"The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","source_id":"quickgo.go_0051606","source_sha256":"9b9722de9b50522102dc2fe420ce406ea76a662412de526dc63cf93e6322e33d","start":120}],"target_id":"concept.go.go0051606","target_kind":"node","target_sha256":"a40677522536ea14063ba38c2e2a05acb2f65efcf16f49d76bc7c93e6193b4f2"}],"concept.go.go0051640":[{"id":"assertion.concept.go.go0051640","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle localization as defined in the captured Gene Ontology term GO:0051640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle localization as: Any process in which an organelle is transported to, and/or maintained in, a specific location.","support":[{"end":216,"quote":"Any process in which an organelle is transported to, and/or maintained in, a specific location.","source_id":"quickgo.go_0051640","source_sha256":"e8a8ab49f58a0c42728fd06634178ce58e949ceffa2d4b611af7cd963ff0572f","start":121}],"target_id":"concept.go.go0051640","target_kind":"node","target_sha256":"af29fff2d57cbc901302906dbda89b906a7bb6a2b26347ba15e9b0293f6eea15"}],"concept.go.go0051641":[{"id":"assertion.concept.go.go0051641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular localization as defined in the captured Gene Ontology term GO:0051641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular localization as: A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","support":[{"end":390,"quote":"A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","source_id":"quickgo.go_0051641","source_sha256":"8a535b4adfb2383b8c1cac934675bff8047f566dfc1d59eba83c6364e9b5fa5b","start":120}],"target_id":"concept.go.go0051641","target_kind":"node","target_sha256":"d3fb8c91239bf69b88337016ebe574c3363becdfc170f0352adafc73f18f4a81"}],"concept.go.go0051674":[{"id":"assertion.concept.go.go0051674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"localization of cell as defined in the captured Gene Ontology term GO:0051674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization of cell as: Any process in which a cell is transported to, and/or maintained in, a specific location.","support":[{"end":208,"quote":"Any process in which a cell is transported to, and/or maintained in, a specific location.","source_id":"quickgo.go_0051674","source_sha256":"7a482bd94b9ba8f820001913f316a6546a0ddf2a00c221190d6a665ed9f9ac49","start":119}],"target_id":"concept.go.go0051674","target_kind":"node","target_sha256":"f9458c45f2ea18ebd69bf2053131ee4ae72b344a769cd34a654d809c002e6763"}],"concept.go.go0051703":[{"id":"assertion.concept.go.go0051703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in intraspecies interaction between organisms as defined in the captured Gene Ontology term GO:0051703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in intraspecies interaction between organisms as: Any process in which an organism has an effect on an organism of the same species.","support":[{"end":254,"quote":"Any process in which an organism has an effect on an organism of the same species.","source_id":"quickgo.go_0051703","source_sha256":"9c8ff04287872c87d0b91fef2ad5e541cffb600237032355ddf10973ff6e2ae7","start":172}],"target_id":"concept.go.go0051703","target_kind":"node","target_sha256":"4dd800e9801162f2d94c940ca5650d6c8f48eff9fbd5fda54891b60b3ba71b29"}],"concept.go.go0055036":[{"id":"assertion.concept.go.go0055036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion membrane as defined in the captured Gene Ontology term GO:0055036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion membrane as: The lipid bilayer surrounding a virion.","support":[{"end":153,"quote":"The lipid bilayer surrounding a virion.","source_id":"quickgo.go_0055036","source_sha256":"aef4e57f5e7b057ddf231647e2d4c4d68a383114bf82f4d9e8741dd691cf8e50","start":114}],"target_id":"concept.go.go0055036","target_kind":"node","target_sha256":"640f84ae520c1a7160f388bb35faf1062259e71b71f1b02e95e8bef06f07162e"}],"concept.go.go0055046":[{"id":"assertion.concept.go.go0055046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microgametogenesis as defined in the captured Gene Ontology term GO:0055046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microgametogenesis as: The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","support":[{"end":263,"quote":"The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","source_id":"quickgo.go_0055046","source_sha256":"d277c1d36a4b5f9c76a77c5da5438c34f375f42be0f11c3ad5b00c57323138cd","start":117}],"target_id":"concept.go.go0055046","target_kind":"node","target_sha256":"013812919ee455dca392fc16ead59da4619597bbc173dec2ddc59fc274422473"}],"concept.go.go0055085":[{"id":"assertion.concept.go.go0055085","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transmembrane transport as defined in the captured Gene Ontology term GO:0055085","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transmembrane transport as: The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","support":[{"end":232,"quote":"The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","source_id":"quickgo.go_0055085","source_sha256":"b6374482e2d6ff11edbd661d2a90eb2255fd80de1fae380e376a65dd31b6d990","start":122}],"target_id":"concept.go.go0055085","target_kind":"node","target_sha256":"b41968d2ddefbf9192bdd181e447c9bff438c851adbfdccc68a93faf9039cfa2"}],"concept.go.go0055127":[{"id":"assertion.concept.go.go0055127","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vibrational conductance of sound to the inner ear as defined in the captured Gene Ontology term GO:0055127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines vibrational conductance of sound to the inner ear as: The transmission of vibrations via ossicles to the inner ear.","support":[{"end":209,"quote":"The transmission of vibrations via ossicles to the inner ear.","source_id":"quickgo.go_0055127","source_sha256":"a57d60c35d1f7dd1d9268a2b06302ea46c55a24398163c9aeca379d85b893e53","start":148}],"target_id":"concept.go.go0055127","target_kind":"node","target_sha256":"c0a7fd4c33717195ea39f105ddaa69d775e7e4e4111246e3be92c803f86298ae"}],"concept.go.go0060033":[{"id":"assertion.concept.go.go0060033","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure regression as defined in the captured Gene Ontology term GO:0060033","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure regression as: The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","support":[{"end":238,"quote":"The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","source_id":"quickgo.go_0060033","source_sha256":"f35b2812bd6da03429658a390c2306a6416c3665ae1dec02e339b367248cfc03","start":130}],"target_id":"concept.go.go0060033","target_kind":"node","target_sha256":"f505a891b0268f2e2129c4496b0afb6d9fca617e2a617e63ca8c7285a9520c78"}],"concept.go.go0060104":[{"id":"assertion.concept.go.go0060104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"surface coat of collagen and cuticulin-based cuticle extracellular matrix as defined in the captured Gene Ontology term GO:0060104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines surface coat of collagen and cuticulin-based cuticle extracellular matrix as: An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","support":[{"end":657,"quote":"An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","source_id":"quickgo.go_0060104","source_sha256":"9f066cab9270818418d00b8cdfe0af13ff69083c9f48683ca8eee04fc43d831f","start":172}],"target_id":"concept.go.go0060104","target_kind":"node","target_sha256":"19557d78d01b88cfa1b02161b3cbac0d8dc9d26ec87f7b466a877684668d06e2"}],"concept.go.go0060105":[{"id":"assertion.concept.go.go0060105","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"epicuticle of collagen and cuticulin-based cuticle extracellular matrix as defined in the captured Gene Ontology term GO:0060105","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines epicuticle of collagen and cuticulin-based cuticle extracellular matrix as: A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","support":[{"end":329,"quote":"A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","source_id":"quickgo.go_0060105","source_sha256":"096b968c14cf9108dd548c6ca012d582cc10588f7ce6772d860432c85382a9fe","start":170}],"target_id":"concept.go.go0060105","target_kind":"node","target_sha256":"04da904f206093d2773a9dc81505760c83f825ed3754811f9b4a6f50d451259a"}],"concept.go.go0060108":[{"id":"assertion.concept.go.go0060108","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"annular furrow extracellular matrix as defined in the captured Gene Ontology term GO:0060108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines annular furrow extracellular matrix as: The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","support":[{"end":534,"quote":"The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","source_id":"quickgo.go_0060108","source_sha256":"aa6f5ab2c02279341471c9707d0e0085329048c7f97eeb0a9c537e459fb7177e","start":134}],"target_id":"concept.go.go0060108","target_kind":"node","target_sha256":"34d86a7821e7992d35cd9eacf7d569072088008d433c114864f631f0d89433d3"}],"concept.go.go0060206":[{"id":"assertion.concept.go.go0060206","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"estrous cycle phase as defined in the captured Gene Ontology term GO:0060206","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines estrous cycle phase as: The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","support":[{"end":378,"quote":"The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","source_id":"quickgo.go_0060206","source_sha256":"70875862099b2efdaa6ce4688f4f238846c228ea242c569938f4fcfd2a386e64","start":118}],"target_id":"concept.go.go0060206","target_kind":"node","target_sha256":"7a0e8a04d0bc01c596766282e142b5d181ad8a130dd4b74d5e513f51f2a895a5"}],"concept.go.go0060352":[{"id":"assertion.concept.go.go0060352","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell adhesion molecule production as defined in the captured Gene Ontology term GO:0060352","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion molecule production as: The appearance of a cell adhesion molecule due to biosynthesis or secretion.","support":[{"end":208,"quote":"The appearance of a cell adhesion molecule due to biosynthesis or secretion.","source_id":"quickgo.go_0060352","source_sha256":"2c52110a924988a20adfd090e1d9e34718f75d71f82e7b0655270f145b1f180b","start":132}],"target_id":"concept.go.go0060352","target_kind":"node","target_sha256":"bfb30b9cadec19dc1a057070a575d422af582a58ff8891d372d06592eb08c088"}],"concept.go.go0060361":[{"id":"assertion.concept.go.go0060361","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"flight as defined in the captured Gene Ontology term GO:0060361","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines flight as: Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","support":[{"end":231,"quote":"Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","source_id":"quickgo.go_0060361","source_sha256":"d4378df7f3d7e381bf525f25d5cecdcbd04013e40e7463cd01a272f2b34251cc","start":105}],"target_id":"concept.go.go0060361","target_kind":"node","target_sha256":"22b4144e97309f543ff82be668b7602563463311d2cd0f4a1927879a6fe8c396"}],"concept.go.go0060384":[{"id":"assertion.concept.go.go0060384","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"innervation as defined in the captured Gene Ontology term GO:0060384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines innervation as: The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","support":[{"end":215,"quote":"The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","source_id":"quickgo.go_0060384","source_sha256":"309a955abb15fadc910d4b2b3ab9e1b20aded50ac461dbb9aca7a8517141c709","start":110}],"target_id":"concept.go.go0060384","target_kind":"node","target_sha256":"38e8e1a3c380720cd9aef5999eda28c5ed9db28a686c5eb945acdcdbab1dc646"}],"concept.go.go0061687":[{"id":"assertion.concept.go.go0061687","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of inorganic compound as defined in the captured Gene Ontology term GO:0061687","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of inorganic compound as: Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","support":[{"end":363,"quote":"Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","source_id":"quickgo.go_0061687","source_sha256":"6ecaa276b580db17b53298710e22b8db565aefef52be5d74c507c410ca2a0b87","start":135}],"target_id":"concept.go.go0061687","target_kind":"node","target_sha256":"e168c68bccf103598ee1f8be7c513fa8ce1e2a442e15e5b80ccfa894530866b9"}],"concept.go.go0061822":[{"id":"assertion.concept.go.go0061822","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary cap as defined in the captured Gene Ontology term GO:0061822","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary cap as: An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","support":[{"end":627,"quote":"An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","source_id":"quickgo.go_0061822","source_sha256":"71561981bf7a55a7795f81848a6a676bdf1f46714917a95b9921c27e577b10f2","start":110}],"target_id":"concept.go.go0061822","target_kind":"node","target_sha256":"3ff0809f3bfb8168aa7a14c90c05c63d5422e93c65d7babbd217dcaae5ee2256"}],"concept.go.go0061823":[{"id":"assertion.concept.go.go0061823","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ring centriole as defined in the captured Gene Ontology term GO:0061823","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ring centriole as: A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","support":[{"end":367,"quote":"A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","source_id":"quickgo.go_0061823","source_sha256":"a4794b37ef15885eaea81499d053842a5112aa2dd217102cfc5203cf466e34ae","start":113}],"target_id":"concept.go.go0061823","target_kind":"node","target_sha256":"70ed66f468311b704abd5e62ef80bb36d125ad45b074131708bc00bbc406373a"}],"concept.go.go0061834":[{"id":"assertion.concept.go.go0061834","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin filament branch point as defined in the captured Gene Ontology term GO:0061834","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament branch point as: The part of an actin filament where the structure forks.","support":[{"end":182,"quote":"The part of an actin filament where the structure forks.","source_id":"quickgo.go_0061834","source_sha256":"acc6a71dfe2403b36c2dde564d938341807d48ec5403e8dd4e532cb6f7641f2a","start":126}],"target_id":"concept.go.go0061834","target_kind":"node","target_sha256":"abd65a7b23101f23d610a6e0007854534558ea737983ef98531ebb8cc4ada114"}],"concept.go.go0061835":[{"id":"assertion.concept.go.go0061835","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral surface of cell as defined in the captured Gene Ontology term GO:0061835","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral surface of cell as: The surface of a migrating cell that is in contact with the substratum or cell layer.","support":[{"end":207,"quote":"The surface of a migrating cell that is in contact with the substratum or cell layer.","source_id":"quickgo.go_0061835","source_sha256":"10c908c0b7c9dcc713c614ae0f0dbb4e5842a8a8c4806ce017f0234bc13153f3","start":122}],"target_id":"concept.go.go0061835","target_kind":"node","target_sha256":"4b3ed585f3924c77e23b18fd5fa95265d195a6def0853d888c6ce96bdaf6adf0"}],"concept.go.go0061842":[{"id":"assertion.concept.go.go0061842","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microtubule organizing center localization as defined in the captured Gene Ontology term GO:0061842","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule organizing center localization as: Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","support":[{"end":273,"quote":"Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","source_id":"quickgo.go_0061842","source_sha256":"6faa50860b9dd17794d7f485ed55600c97e8d8769c2654e8d4fd307f42aa2446","start":141}],"target_id":"concept.go.go0061842","target_kind":"node","target_sha256":"8fcdab61460c48d24f6ad624f3d7a0d8944cb560c4ef4e704791ec8a5d4ebce1"}],"concept.go.go0061845":[{"id":"assertion.concept.go.go0061845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"neuron projection branch point as defined in the captured Gene Ontology term GO:0061845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines neuron projection branch point as: The location where a secondary projection arises from a neuron projection.","support":[{"end":203,"quote":"The location where a secondary projection arises from a neuron projection.","source_id":"quickgo.go_0061845","source_sha256":"cba09f4ef0bcca9264982c4ba9ab03c5aa09f97f295a9b9d6b9abafbd9b339b4","start":129}],"target_id":"concept.go.go0061845","target_kind":"node","target_sha256":"7b5f0cb632c7d25faf7eebf3821296205054d08f19efdfdec1d3026f18f8252a"}],"concept.go.go0061919":[{"id":"assertion.concept.go.go0061919","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"process utilizing autophagic mechanism as defined in the captured Gene Ontology term GO:0061919","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines process utilizing autophagic mechanism as: A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","support":[{"end":534,"quote":"A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","source_id":"quickgo.go_0061919","source_sha256":"ab7bb5de104beb3aca78e3c729c37a5e7b25c50223da1409970f90bc6d58c037","start":137}],"target_id":"concept.go.go0061919","target_kind":"node","target_sha256":"bfa8b54308da4219874f0283a7b4de4484fdc8d47fe0e3d1b75f66e56df2263e"}],"concept.go.go0061948":[{"id":"assertion.concept.go.go0061948","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"premature acrosome loss as defined in the captured Gene Ontology term GO:0061948","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines premature acrosome loss as: The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","support":[{"end":402,"quote":"The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","source_id":"quickgo.go_0061948","source_sha256":"c389fd9694b6bcd359b7d6357bcc1b66004dcdc62907bf78bb5b771aba7dd74a","start":122}],"target_id":"concept.go.go0061948","target_kind":"node","target_sha256":"7761d28ea038548a275bcaee9e8412344114b098f29c1fad298da3adf833f0fd"}],"concept.go.go0065007":[{"id":"assertion.concept.go.go0065007","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological regulation as defined in the captured Gene Ontology term GO:0065007","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological regulation as: Any process that modulates a measurable attribute of any biological process, quality or function.","support":[{"end":217,"quote":"Any process that modulates a measurable attribute of any biological process, quality or function.","source_id":"quickgo.go_0065007","source_sha256":"2ef6bd104993da5ff5f0fb549bf36f84aa64c82fcba51268e2bb813d36770e67","start":120}],"target_id":"concept.go.go0065007","target_kind":"node","target_sha256":"ce369192884061a3efd44fd353c7fd9513f6315c6e024660977500c7ff6f92e1"}],"concept.go.go0070057":[{"id":"assertion.concept.go.go0070057","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prospore membrane spindle pole body attachment site as defined in the captured Gene Ontology term GO:0070057","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines prospore membrane spindle pole body attachment site as: The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","support":[{"end":325,"quote":"The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","source_id":"quickgo.go_0070057","source_sha256":"3444a532248997cd2b1c8319053674ee598909ccbe9d9423bd555259a81d4432","start":150}],"target_id":"concept.go.go0070057","target_kind":"node","target_sha256":"3d72164c64414c469f883f0f7e19f813cd6b0875919cd0a1247681014fcb10b6"}],"concept.go.go0070701":[{"id":"assertion.concept.go.go0070701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mucus layer as defined in the captured Gene Ontology term GO:0070701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mucus layer as: An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","support":[{"end":498,"quote":"An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","source_id":"quickgo.go_0070701","source_sha256":"74a76a9714d0f63c263215fe0bd90a5aaf9e997c7dec60bb4974e953cef68624","start":110}],"target_id":"concept.go.go0070701","target_kind":"node","target_sha256":"0e03666325115b8db0f525e8ddfe99422d745c42c635b5a1ba739a83515c2330"}],"concept.go.go0071554":[{"id":"assertion.concept.go.go0071554","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell wall organization or biogenesis as defined in the captured Gene Ontology term GO:0071554","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell wall organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","support":[{"end":283,"quote":"A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","source_id":"quickgo.go_0071554","source_sha256":"6eefc70a1f08136fe8d0f713917dda55b2c93fa099cff760b6256ab1bb0732a8","start":135}],"target_id":"concept.go.go0071554","target_kind":"node","target_sha256":"58c95905e9adcab28967a8bde46d96d43e785d0bf11fd07dd74bdc635aca2562"}],"concept.go.go0071684":[{"id":"assertion.concept.go.go0071684","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organism emergence from protective structure as defined in the captured Gene Ontology term GO:0071684","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organism emergence from protective structure as: The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","support":[{"end":266,"quote":"The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","source_id":"quickgo.go_0071684","source_sha256":"534ae6fa43678ba1a9538a7fd15d09edee3cac4361cdbd6eaa65b0825b424a58","start":143}],"target_id":"concept.go.go0071684","target_kind":"node","target_sha256":"7992138c6029b5383cf867133531d79460896411f026f4a5bc6d599d67ab09c1"}],"concept.go.go0071722":[{"id":"assertion.concept.go.go0071722","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of arsenic-containing substance as defined in the captured Gene Ontology term GO:0071722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of arsenic-containing substance as: Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","support":[{"end":449,"quote":"Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","source_id":"quickgo.go_0071722","source_sha256":"c133897cf80ad2cd1d7cf1dd75e45e43264d5acaa1a2b2853a12b0b55eb8bb73","start":145}],"target_id":"concept.go.go0071722","target_kind":"node","target_sha256":"0c0634d4e6764b4fcb3ed95efcd478db7846b415f16dfdb9df146c2e36b155d1"}],"concept.go.go0071808":[{"id":"assertion.concept.go.go0071808","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"satellite fibril as defined in the captured Gene Ontology term GO:0071808","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines satellite fibril as: An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","support":[{"end":315,"quote":"An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","source_id":"quickgo.go_0071808","source_sha256":"8f4bf0fcad17d903364cae23b20dd1e9e9f14011a0d63f535f47fad8e37c60c3","start":115}],"target_id":"concept.go.go0071808","target_kind":"node","target_sha256":"dc083f96097d4dae93d4617afe9fd88bad2b5d0e99a2372a4d6252ef70966869"}],"concept.go.go0071827":[{"id":"assertion.concept.go.go0071827","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasma lipoprotein particle organization as defined in the captured Gene Ontology term GO:0071827","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle organization as: A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","support":[{"end":495,"quote":"A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","source_id":"quickgo.go_0071827","source_sha256":"5be3a9ea94d8ea47f55d939a53bdad95c05ac93ffbe539f5077571207aff3f8a","start":139}],"target_id":"concept.go.go0071827","target_kind":"node","target_sha256":"cd4a9fea54f9954326c8e7d0bab207dabb7a99e04908cf8f9a7fdd6468588726"}],"concept.go.go0071840":[{"id":"assertion.concept.go.go0071840","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular component organization or biogenesis as defined in the captured Gene Ontology term GO:0071840","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular component organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","support":[{"end":301,"quote":"A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","source_id":"quickgo.go_0071840","source_sha256":"5342172ffbd0eb6279adaf8860aeb61ea8b797360906a8096b56796dc746a866","start":144}],"target_id":"concept.go.go0071840","target_kind":"node","target_sha256":"008d145b7b3f0e12f09689d7018971f8b94a60186236d736e070fb911b6cbda8"}],"concept.go.go0071965":[{"id":"assertion.concept.go.go0071965","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal locomotion as defined in the captured Gene Ontology term GO:0071965","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal locomotion as: Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","support":[{"end":260,"quote":"Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","source_id":"quickgo.go_0071965","source_sha256":"d4d428e4173e4dda47d52526391bd57d0d02386f41eb47c4452a9a51d0ac30ba","start":134}],"target_id":"concept.go.go0071965","target_kind":"node","target_sha256":"3f705bfe1342b0bb96c2b439023a20c5866a6f68e6999b149d39c07d09d864f7"}],"concept.go.go0072324":[{"id":"assertion.concept.go.go0072324","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ascus epiplasm as defined in the captured Gene Ontology term GO:0072324","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ascus epiplasm as: Ascus cytoplasm that is not packaged into ascospores.","support":[{"end":166,"quote":"Ascus cytoplasm that is not packaged into ascospores.","source_id":"quickgo.go_0072324","source_sha256":"9d7fa4c158f23ade2c19aa94dd9be51f1419dbcbf040b70db19929c5e3ca1d8f","start":113}],"target_id":"concept.go.go0072324","target_kind":"node","target_sha256":"908df9ed83aa2cf92a2c9d1a753d748b254178edabb618caa9e4c242f2bbbd29"}],"concept.go.go0072690":[{"id":"assertion.concept.go.go0072690","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"single-celled organism vegetative growth phase as defined in the captured Gene Ontology term GO:0072690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-celled organism vegetative growth phase as: A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","support":[{"end":267,"quote":"A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","source_id":"quickgo.go_0072690","source_sha256":"a973f3e684991de38ab9d9f81ce42fb50b30ce5ae25d2a88c829c13c73b8e11e","start":145}],"target_id":"concept.go.go0072690","target_kind":"node","target_sha256":"a64d272ddf27b72279eb76548b6622105a8e8ec21822a08fbf3daa0c19000dae"}],"concept.go.go0075325":[{"id":"assertion.concept.go.go0075325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spore dispersal as defined in the captured Gene Ontology term GO:0075325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore dispersal as: Any process in which an organism disseminates its spores.","support":[{"end":171,"quote":"Any process in which an organism disseminates its spores.","source_id":"quickgo.go_0075325","source_sha256":"d38956556ca58bcb5dcf6a2cdb635275218a633bb0edfde7326e8235783486df","start":114}],"target_id":"concept.go.go0075325","target_kind":"node","target_sha256":"90e248b60937556a6122e6a53b48904fa72f787c31d284b8543a04faee51ef29"}],"concept.go.go0075522":[{"id":"assertion.concept.go.go0075522","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"IRES-dependent viral translational initiation as defined in the captured Gene Ontology term GO:0075522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines IRES-dependent viral translational initiation as: Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","support":[{"end":414,"quote":"Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","source_id":"quickgo.go_0075522","source_sha256":"83e7daf5ae46d8741bfde8bed95f444721eeb5ccb5b416d0fc0fa764a22a3889","start":144}],"target_id":"concept.go.go0075522","target_kind":"node","target_sha256":"a8f48c3b99b55b0ad2e93712fc2290dc8dae909aea630b96e3f4a74db98d1239"}],"concept.go.go0075523":[{"id":"assertion.concept.go.go0075523","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translational frameshifting as defined in the captured Gene Ontology term GO:0075523","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational frameshifting as: A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","support":[{"end":405,"quote":"A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","source_id":"quickgo.go_0075523","source_sha256":"0a1e6f15717f7a15d46279ccb000d2a1145d01660e8ced7486fc50e0bb92ef21","start":132}],"target_id":"concept.go.go0075523","target_kind":"node","target_sha256":"0d6b7ffc95dab7d3bf8b6e9106f97d1a37c09754435a54e10b9f8cc5c682b772"}],"concept.go.go0075524":[{"id":"assertion.concept.go.go0075524","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ribosomal skipping as defined in the captured Gene Ontology term GO:0075524","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ribosomal skipping as: A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","support":[{"end":356,"quote":"A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","source_id":"quickgo.go_0075524","source_sha256":"501658c57f7feebe519107e99fe7be519f65d2f38d31e846790d20b49782274c","start":117}],"target_id":"concept.go.go0075524","target_kind":"node","target_sha256":"2266eb080665dfaef9c19b78ac2395c75837145cccd49921b8cc52d54150b623"}],"concept.go.go0075525":[{"id":"assertion.concept.go.go0075525","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translational termination-reinitiation as defined in the captured Gene Ontology term GO:0075525","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational termination-reinitiation as: A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","support":[{"end":504,"quote":"A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","source_id":"quickgo.go_0075525","source_sha256":"72ae4983c013c1eaf763610a4ea82ea4f2b3f2b5335ca4b2695ebf7b99f0360d","start":143}],"target_id":"concept.go.go0075525","target_kind":"node","target_sha256":"6c0b7ebf03c5d6f93ac7d4997d9a881b44eb34289759c2bb833396c638fda09e"}],"concept.go.go0075526":[{"id":"assertion.concept.go.go0075526","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cap snatching as defined in the captured Gene Ontology term GO:0075526","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cap snatching as: A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","support":[{"end":475,"quote":"A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","source_id":"quickgo.go_0075526","source_sha256":"578a015ae9912cf2e8dfc71630be438c1a8664b850349eac3cbcccd7932b8b39","start":112}],"target_id":"concept.go.go0075526","target_kind":"node","target_sha256":"fb89d95e812e985f6902d3e19cebf598483115f460341eb8e016ff29617a7c99"}],"concept.go.go0075527":[{"id":"assertion.concept.go.go0075527","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral RNA editing as defined in the captured Gene Ontology term GO:0075527","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral RNA editing as: The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","support":[{"end":439,"quote":"The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","source_id":"quickgo.go_0075527","source_sha256":"fba36201986594931512163cef56a28332c807d40df781b5e4affdbec5c0c062","start":116}],"target_id":"concept.go.go0075527","target_kind":"node","target_sha256":"d3bbe4e84333804229a0b1520e1a63bad81523a69bc48071c2637c2b67264fb9"}],"concept.go.go0080189":[{"id":"assertion.concept.go.go0080189","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"primary growth as defined in the captured Gene Ontology term GO:0080189","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines primary growth as: Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","support":[{"end":228,"quote":"Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","source_id":"quickgo.go_0080189","source_sha256":"c0518728da1287d05df178461a04edccf4945fa075c9220257ccaa12ed96334c","start":113}],"target_id":"concept.go.go0080189","target_kind":"node","target_sha256":"5e6acf7f0890d5b2d42075e05477994573f76f4c061e4ff1bdc8703ba1eaf237"}],"concept.go.go0080190":[{"id":"assertion.concept.go.go0080190","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lateral growth as defined in the captured Gene Ontology term GO:0080190","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral growth as: Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","support":[{"end":197,"quote":"Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","source_id":"quickgo.go_0080190","source_sha256":"c71ea12ec9dd23c38299f66a86a07d24b3dd54c03f775b12ae54ec336d19d646","start":113}],"target_id":"concept.go.go0080190","target_kind":"node","target_sha256":"fd5aa744eadec5c5a620edce0561329ee9449df82d2a1c04e424577e232addac"}],"concept.go.go0085036":[{"id":"assertion.concept.go.go0085036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extrahaustorial matrix as defined in the captured Gene Ontology term GO:0085036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extrahaustorial matrix as: The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","support":[{"end":213,"quote":"The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","source_id":"quickgo.go_0085036","source_sha256":"111a5cf532ca16d6d033c0e02cd55a988b07faec78db73b5fdabef0828c06898","start":121}],"target_id":"concept.go.go0085036","target_kind":"node","target_sha256":"c1816f7a3d57e923981c2e1f3770ebbc1259ec76f5d89faf550c64fdbdcdc8ea"}],"concept.go.go0090123":[{"id":"assertion.concept.go.go0090123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysosomal glycocalyx as defined in the captured Gene Ontology term GO:0090123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal glycocalyx as: The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","support":[{"end":277,"quote":"The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","source_id":"quickgo.go_0090123","source_sha256":"26418e4d688999acd574b2f4b15a6278f51da0b6928db3f6eda0a264ea51f8cc","start":119}],"target_id":"concept.go.go0090123","target_kind":"node","target_sha256":"aff94bce67afee4cacdb17abbcbe06b60b0bde4a4f3e9b0490075213239cde63"}],"concept.go.go0090130":[{"id":"assertion.concept.go.go0090130","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tissue migration as defined in the captured Gene Ontology term GO:0090130","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue migration as: The process in which the population of cells that make up a tissue undergo directed movement.","support":[{"end":208,"quote":"The process in which the population of cells that make up a tissue undergo directed movement.","source_id":"quickgo.go_0090130","source_sha256":"932e9c64c4fbe643ec0efa6c120fc6571baa34b2514c9c86096b866df2cf5f29","start":115}],"target_id":"concept.go.go0090130","target_kind":"node","target_sha256":"54901d0269449155d5be8dba15fb9f531a980b86b1ca967b0c2c73893b277003"}],"concept.go.go0090398":[{"id":"assertion.concept.go.go0090398","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular senescence as defined in the captured Gene Ontology term GO:0090398","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular senescence as: A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","support":[{"end":269,"quote":"A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","source_id":"quickgo.go_0090398","source_sha256":"36579ec872f4feba012ce5a47e8b3f47a0d17b9850b4e5febbd67cc14b1ce881","start":118}],"target_id":"concept.go.go0090398","target_kind":"node","target_sha256":"caf31c1dc7eb21301095ff88807eb31fbb9ac644a55a77a23eb11ddcb5f743cb"}],"concept.go.go0090405":[{"id":"assertion.concept.go.go0090405","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"unicellular trichome branch as defined in the captured Gene Ontology term GO:0090405","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines unicellular trichome branch as: A cell projection part that is a branch of a unicellular trichome.","support":[{"end":192,"quote":"A cell projection part that is a branch of a unicellular trichome.","source_id":"quickgo.go_0090405","source_sha256":"f040ff4d8c6b10c29f1c81fabd6f74aa2fa720ca2b2fdba25f83d3bb4dc0a346","start":126}],"target_id":"concept.go.go0090405","target_kind":"node","target_sha256":"a1f6757122cbaf9f772ac0de6d20baf234ff77e1f5fd70000460899295ff21dc"}],"concept.go.go0090635":[{"id":"assertion.concept.go.go0090635","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extracellular core region of desmosome as defined in the captured Gene Ontology term GO:0090635","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular core region of desmosome as: The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","support":[{"end":306,"quote":"The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","source_id":"quickgo.go_0090635","source_sha256":"f5a078372421af65038ab8c8e1eea0f2a1fa4af9d5bf1349863edc0b8bebc138","start":137}],"target_id":"concept.go.go0090635","target_kind":"node","target_sha256":"dbdeee4ecbfc1ee4fbdc49e6e0d288092a6b7fe530625666101a4c7f029cfb1d"}],"concept.go.go0090637":[{"id":"assertion.concept.go.go0090637","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"inner dense plaque of desmosome as defined in the captured Gene Ontology term GO:0090637","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines inner dense plaque of desmosome as: The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","support":[{"end":315,"quote":"The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","source_id":"quickgo.go_0090637","source_sha256":"ce770f5460a6ab75d42171aa28157432b4e7e17233e9b186eb294aee0f225e81","start":130}],"target_id":"concept.go.go0090637","target_kind":"node","target_sha256":"b110647704fe09b9c8ce8390affd1d8089257299f32a6690b3a080e68f807756"}],"concept.go.go0090644":[{"id":"assertion.concept.go.go0090644","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"age-related resistance as defined in the captured Gene Ontology term GO:0090644","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines age-related resistance as: An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","support":[{"end":492,"quote":"An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","source_id":"quickgo.go_0090644","source_sha256":"6bb061bf2246b55fed92a4cab3f31c6249de0f46735c327b3a60d05e2daf7a16","start":121}],"target_id":"concept.go.go0090644","target_kind":"node","target_sha256":"543836228987099fa63c20a2849a2980ead40b8033587858d32b1f3618652e56"}],"concept.go.go0090658":[{"id":"assertion.concept.go.go0090658","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cone matrix sheath as defined in the captured Gene Ontology term GO:0090658","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cone matrix sheath as: A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","support":[{"end":293,"quote":"A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","source_id":"quickgo.go_0090658","source_sha256":"d9e345ae12e72b0653e0f95da0d857099893a29b00a19e1b0a02c6948a90c3d6","start":117}],"target_id":"concept.go.go0090658","target_kind":"node","target_sha256":"bd26de2c019b443017446ad3edb2f2b0ff6bf20ffc04fc31ed4fd6c5fa8c0135"}],"concept.go.go0090692":[{"id":"assertion.concept.go.go0090692","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial membrane scission site as defined in the captured Gene Ontology term GO:0090692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial membrane scission site as: The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","support":[{"end":308,"quote":"The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","source_id":"quickgo.go_0090692","source_sha256":"0fd90ad8aaebf0986505eb0409d5d5700719f64678d3484b357f20bcf27425ad","start":135}],"target_id":"concept.go.go0090692","target_kind":"node","target_sha256":"e56833c0aecd0ea3d375a71d7e1688889415577fda8e43f66412fdae75c5fb44"}],"concept.go.go0090693":[{"id":"assertion.concept.go.go0090693","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plant organ senescence as defined in the captured Gene Ontology term GO:0090693","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plant organ senescence as: A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","support":[{"end":322,"quote":"A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","source_id":"quickgo.go_0090693","source_sha256":"b2356d1374d953754f57e871407a6e252acc392685864e471d65053928de5dc1","start":121}],"target_id":"concept.go.go0090693","target_kind":"node","target_sha256":"734f39135d33a4746f316165d6b70ccaa9d3a4b934d1fdccaf4965c21314a61f"}],"concept.go.go0090713":[{"id":"assertion.concept.go.go0090713","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immunological memory process as defined in the captured Gene Ontology term GO:0090713","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological memory process as: Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","support":[{"end":289,"quote":"Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","source_id":"quickgo.go_0090713","source_sha256":"81d91f431ce3a7158395852f25020c375958e42e044429d59c60bac7be5f0724","start":127}],"target_id":"concept.go.go0090713","target_kind":"node","target_sha256":"150a12d8dec121ff2f8a320ee1ede4f54c6d7005a519f07c4ddadda7bff5e1bd"}],"concept.go.go0090724":[{"id":"assertion.concept.go.go0090724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"central region of growth cone as defined in the captured Gene Ontology term GO:0090724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines central region of growth cone as: The center of the migrating motile tip of a growing nerve cell axon or dendrite.","support":[{"end":208,"quote":"The center of the migrating motile tip of a growing nerve cell axon or dendrite.","source_id":"quickgo.go_0090724","source_sha256":"8098f8eb3e8ed32f81f8f47c7156d883d79f0ce127bd576cfd760d92af51e16b","start":128}],"target_id":"concept.go.go0090724","target_kind":"node","target_sha256":"d672181f35b2963e5597ea56e60015492c28f668535fdd358e5e547b34ada794"}],"concept.go.go0090725":[{"id":"assertion.concept.go.go0090725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"peripheral region of growth cone as defined in the captured Gene Ontology term GO:0090725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines peripheral region of growth cone as: The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","support":[{"end":236,"quote":"The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","source_id":"quickgo.go_0090725","source_sha256":"7bb2e0406aec755ec8a511ce980483ba63ecdfb51a815f50118d10f70552b7c9","start":131}],"target_id":"concept.go.go0090725","target_kind":"node","target_sha256":"9cec034883deb334dcca73a6b4a9077e83f1025bf1770199268f908e1d312b7d"}],"concept.go.go0090726":[{"id":"assertion.concept.go.go0090726","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cortical dynamic polarity patch as defined in the captured Gene Ontology term GO:0090726","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cortical dynamic polarity patch as: A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","support":[{"end":450,"quote":"A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","source_id":"quickgo.go_0090726","source_sha256":"d6f78c3e2eaf55b9d45f7b87f0e03febb90ae9d75fe35474f59c6722e83cf960","start":130}],"target_id":"concept.go.go0090726","target_kind":"node","target_sha256":"10ab64cf417219694fde26aaae8fb65641fbacba4ffb193b65ed34779312ec7b"}],"concept.go.go0097002":[{"id":"assertion.concept.go.go0097002","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial inner boundary membrane as defined in the captured Gene Ontology term GO:0097002","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial inner boundary membrane as: The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","support":[{"end":289,"quote":"The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","source_id":"quickgo.go_0097002","source_sha256":"61778db4b20e109c49591752e2843e94f964873c77b25bc9e7c3b0e6222e22d3","start":136}],"target_id":"concept.go.go0097002","target_kind":"node","target_sha256":"17df13b61b1ba40cac637d3aea5fd8c3969aaf04d66dd94c84298c04d320049d"}],"concept.go.go0097047":[{"id":"assertion.concept.go.go0097047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"DNA replication termination region as defined in the captured Gene Ontology term GO:0097047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines DNA replication termination region as: A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","support":[{"end":255,"quote":"A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","source_id":"quickgo.go_0097047","source_sha256":"9aaf8e98432e0a7d3b58e9b3c3af56c3b110da88b8fe841d9ed2dc48ec3bf34e","start":133}],"target_id":"concept.go.go0097047","target_kind":"node","target_sha256":"654c0c3f638fc1c2e692b0789dac17823aff5c354cc828af6da2995b60bb1f51"}],"concept.go.go0097120":[{"id":"assertion.concept.go.go0097120","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"receptor localization to synapse as defined in the captured Gene Ontology term GO:0097120","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines receptor localization to synapse as: Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","support":[{"end":314,"quote":"Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","source_id":"quickgo.go_0097120","source_sha256":"fbf617e4aa923deb95fe44eedbc7670d537c4de2441641d53d1f13131a9a7e7b","start":131}],"target_id":"concept.go.go0097120","target_kind":"node","target_sha256":"20a49cac01105eec7a357a00011f680a7c0912b1b9e79c47256aa4e93ab3f9eb"}],"concept.go.go0097194":[{"id":"assertion.concept.go.go0097194","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"execution phase of apoptosis as defined in the captured Gene Ontology term GO:0097194","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of apoptosis as: A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","support":[{"end":643,"quote":"A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","source_id":"quickgo.go_0097194","source_sha256":"60e1dcce7ef95e7ba6230625e3119c231f572579c588f283afcea4c4b14a0f1f","start":127}],"target_id":"concept.go.go0097194","target_kind":"node","target_sha256":"a4baa00f38d3eda148b9ccb25deb96e043be7c0f21e3e2ea2bb689b7024e76b9"}],"concept.go.go0097207":[{"id":"assertion.concept.go.go0097207","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bud dormancy process as defined in the captured Gene Ontology term GO:0097207","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bud dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","support":[{"end":504,"quote":"A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","source_id":"quickgo.go_0097207","source_sha256":"54a63c4994d103a3488a4e29c56851182a0aca3e66aef65a166b9b4c654dfe94","start":119}],"target_id":"concept.go.go0097207","target_kind":"node","target_sha256":"d1b2b92db62d78ff65247f3453bad7fbfd3d335b88117504084d32a77467e217"}],"concept.go.go0097242":[{"id":"assertion.concept.go.go0097242","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"amyloid-beta clearance as defined in the captured Gene Ontology term GO:0097242","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines amyloid-beta clearance as: The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","support":[{"end":246,"quote":"The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","source_id":"quickgo.go_0097242","source_sha256":"92dca002843929618f2f3039034d944505b1ad9a3831514051a32fc811bf91fd","start":121}],"target_id":"concept.go.go0097242","target_kind":"node","target_sha256":"53c51f9dda9c275ac27709ff7ef880ef435d32f4149e6095fa36bb1f45730aa3"}],"concept.go.go0097528":[{"id":"assertion.concept.go.go0097528","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"execution phase of necroptosis as defined in the captured Gene Ontology term GO:0097528","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of necroptosis as: A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","support":[{"end":671,"quote":"A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","source_id":"quickgo.go_0097528","source_sha256":"e877a485212308e5cb5437af22140a8a5e61ec5044cffb1aeaf01f586cc00562","start":129}],"target_id":"concept.go.go0097528","target_kind":"node","target_sha256":"69756edd5704f082f3e58160105a55e61a19e0d46c9b37eb9021816525dca0c7"}],"concept.go.go0097562":[{"id":"assertion.concept.go.go0097562","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"left lateral basal body pair as defined in the captured Gene Ontology term GO:0097562","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines left lateral basal body pair as: Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","support":[{"end":329,"quote":"Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","source_id":"quickgo.go_0097562","source_sha256":"5df605beef2115f946ab7de6f13deb4af6645a5e74648fbd0ece1b2a47b92dd8","start":127}],"target_id":"concept.go.go0097562","target_kind":"node","target_sha256":"c952b23b203dd2d43c39b82a2e0bf7a559bb0e04e902f71876a937d2f065e461"}],"concept.go.go0097593":[{"id":"assertion.concept.go.go0097593","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc microtubule array as defined in the captured Gene Ontology term GO:0097593","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc microtubule array as: A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","support":[{"end":396,"quote":"A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","source_id":"quickgo.go_0097593","source_sha256":"9e6423264e99d7803a0f38b4006e402f9f801835712fcea1d39653d496b1f5cd","start":129}],"target_id":"concept.go.go0097593","target_kind":"node","target_sha256":"a2abcc4edb7f8f67384afe30d6327bebebfd44aa4499217ad738d6d885d13b35"}],"concept.go.go0097594":[{"id":"assertion.concept.go.go0097594","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc dorsal microribbon as defined in the captured Gene Ontology term GO:0097594","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc dorsal microribbon as: Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","support":[{"end":559,"quote":"Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","source_id":"quickgo.go_0097594","source_sha256":"491987ac02d40ddf2e5ae4b996e506800a5c2af5717c5ae32a0941963e44db87","start":130}],"target_id":"concept.go.go0097594","target_kind":"node","target_sha256":"8cf0acc677160317deb7f7b13a79a884d461c91829bc2e4d8b89f7c2da0afb12"}],"concept.go.go0097595":[{"id":"assertion.concept.go.go0097595","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc crossbridge as defined in the captured Gene Ontology term GO:0097595","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc crossbridge as: Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","support":[{"end":291,"quote":"Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","source_id":"quickgo.go_0097595","source_sha256":"6fb3d47ed852309fc393769fb73e79a6f102785e36b1964d00226dd173b10f71","start":123}],"target_id":"concept.go.go0097595","target_kind":"node","target_sha256":"c480278079bd039374ee9cb39edb517d3576dbf815d195346ce36b2b0f7fad83"}],"concept.go.go0097596":[{"id":"assertion.concept.go.go0097596","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc supernumerary microtubule array as defined in the captured Gene Ontology term GO:0097596","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc supernumerary microtubule array as: A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","support":[{"end":303,"quote":"A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","source_id":"quickgo.go_0097596","source_sha256":"671f868ac579dc22dceaf16849f8840f6c955324fa2eaacd74234f441557f1a9","start":143}],"target_id":"concept.go.go0097596","target_kind":"node","target_sha256":"6957234a32c6c1e8a416733619a7e8d64a1244435c3cdc504b0c3eb9f4d7c032"}],"concept.go.go0097614":[{"id":"assertion.concept.go.go0097614","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dinoflagellate hypocone as defined in the captured Gene Ontology term GO:0097614","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate hypocone as: The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","support":[{"end":293,"quote":"The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","source_id":"quickgo.go_0097614","source_sha256":"e77f35c34b886e5febadc78a4c8a661f7cd381b499b5df2874f851bf0849e2df","start":122}],"target_id":"concept.go.go0097614","target_kind":"node","target_sha256":"85e4922c2600e2346cce5f9392dbefc27364362786a6686974ef38a7b1c3a0fe"}],"concept.go.go0097683":[{"id":"assertion.concept.go.go0097683","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dinoflagellate apex as defined in the captured Gene Ontology term GO:0097683","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate apex as: The anterior most point of a dinoflagellate epicone.","support":[{"end":170,"quote":"The anterior most point of a dinoflagellate epicone.","source_id":"quickgo.go_0097683","source_sha256":"4eec81dc89e4581fdcccc1c1385040d7fcd1d8c975da39d94ebb3bc7109a2b57","start":118}],"target_id":"concept.go.go0097683","target_kind":"node","target_sha256":"8dfbb88a77d0fd74a1b10a4f31d559a6a57599ae0e478801f0fd24dac696436e"}],"concept.go.go0097722":[{"id":"assertion.concept.go.go0097722","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm motility as defined in the captured Gene Ontology term GO:0097722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm motility as: Any process involved in the controlled movement of a sperm cell.","support":[{"end":177,"quote":"Any process involved in the controlled movement of a sperm cell.","source_id":"quickgo.go_0097722","source_sha256":"ced5a3c24f182cf9df97c3296b8a275c938b4b0cd1c0c549a7ba0344afaa5e0b","start":113}],"target_id":"concept.go.go0097722","target_kind":"node","target_sha256":"725ca8f6546fffd188e04eed5a4f5835e3191dcf85f4a48441d2bef3bb92544a"}],"concept.go.go0097737":[{"id":"assertion.concept.go.go0097737","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acquisition of mycelium reproductive competence as defined in the captured Gene Ontology term GO:0097737","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of mycelium reproductive competence as: A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","support":[{"end":327,"quote":"A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","source_id":"quickgo.go_0097737","source_sha256":"79a2c7249fd67a7a169e08f08a79928cfbfa07b7d87576c86b4d2aee453e4aa8","start":146}],"target_id":"concept.go.go0097737","target_kind":"node","target_sha256":"9094eebd35c30e05052fed459aa5f24fe38ca8d2a745536596cc6999b9688ecc"}],"concept.go.go0097751":[{"id":"assertion.concept.go.go0097751","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spore-bearing structure formation as defined in the captured Gene Ontology term GO:0097751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore-bearing structure formation as: The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","support":[{"end":263,"quote":"The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","source_id":"quickgo.go_0097751","source_sha256":"8c3db0fa62473394ba7d92d4fdd549b642c34e0e59819945ff27de31387589fb","start":132}],"target_id":"concept.go.go0097751","target_kind":"node","target_sha256":"d418741ee6622cdee222d9ad86801b688ad4eb8efec270d1923f4e5662c3b527"}],"concept.go.go0098003":[{"id":"assertion.concept.go.go0098003","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tail assembly as defined in the captured Gene Ontology term GO:0098003","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tail assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail.","support":[{"end":212,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus tail.","source_id":"quickgo.go_0098003","source_sha256":"27f725be9432af172a39d69cc2bdc1ceeb534ccb71972c435e3b9f81657848f5","start":118}],"target_id":"concept.go.go0098003","target_kind":"node","target_sha256":"070d2b10e8b2e2c991f20c616bac29424a11ef8ef5dc257e0119f7e3dbcd139c"}],"concept.go.go0098004":[{"id":"assertion.concept.go.go0098004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail fiber assembly as defined in the captured Gene Ontology term GO:0098004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail fiber assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","support":[{"end":224,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","source_id":"quickgo.go_0098004","source_sha256":"3a135a8980cc4973fcd33c4215477eed80f913b2389bf51ecddb14600092e247","start":124}],"target_id":"concept.go.go0098004","target_kind":"node","target_sha256":"c0246a7593e25ce8e0dededd9764a6a6a6b6f9102f52af1e68ee9cf207ff8e09"}],"concept.go.go0098005":[{"id":"assertion.concept.go.go0098005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral head-tail joining as defined in the captured Gene Ontology term GO:0098005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral head-tail joining as: Process by which virus heads and tails are attached to each other.","support":[{"end":188,"quote":"Process by which virus heads and tails are attached to each other.","source_id":"quickgo.go_0098005","source_sha256":"b7ce7f1991b1e12580161b50027324a86da95d7f20c2b8cb303fea7651063374","start":122}],"target_id":"concept.go.go0098005","target_kind":"node","target_sha256":"591391719f5bd98cfad55e6569baf424f8cc3a51cd8c01e19f20b6341eb77ead"}],"concept.go.go0098015":[{"id":"assertion.concept.go.go0098015","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail as defined in the captured Gene Ontology term GO:0098015","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail as: Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","support":[{"end":236,"quote":"Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","source_id":"quickgo.go_0098015","source_sha256":"0b68654ffa5e881c3719587152e39ff4b9f3382d437464d3eb9c3b7d7084c808","start":109}],"target_id":"concept.go.go0098015","target_kind":"node","target_sha256":"09317d5357cf566355158fbf1f8b3ca387fd7584cb5b83254fa6eb7254bcb831"}],"concept.go.go0098021":[{"id":"assertion.concept.go.go0098021","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid, decoration as defined in the captured Gene Ontology term GO:0098021","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, decoration as: Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","support":[{"end":274,"quote":"Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","source_id":"quickgo.go_0098021","source_sha256":"649927c2f608192eff8f492c2e4b052671d4233f9751274d2611a1d582de5b6c","start":123}],"target_id":"concept.go.go0098021","target_kind":"node","target_sha256":"98ff17cf5bdce7ff0a796e5624f4c918e2aba88842479d1686f130b6b831ebf6"}],"concept.go.go0098023":[{"id":"assertion.concept.go.go0098023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, tip as defined in the captured Gene Ontology term GO:0098023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tip as: The basal end of the virus tail, which is used by the virus to attach to the host cell.","support":[{"end":201,"quote":"The basal end of the virus tail, which is used by the virus to attach to the host cell.","source_id":"quickgo.go_0098023","source_sha256":"787598e89112e9990392c4550b4a092a0b476bfef50494b955d9de42c88b155d","start":114}],"target_id":"concept.go.go0098023","target_kind":"node","target_sha256":"5fbccd6467169fd970ab477cf8b3c60109dd474524ee24db955d5c29729cdbbf"}],"concept.go.go0098024":[{"id":"assertion.concept.go.go0098024","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, fiber as defined in the captured Gene Ontology term GO:0098024","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, fiber as: The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","support":[{"end":205,"quote":"The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","source_id":"quickgo.go_0098024","source_sha256":"6a440cfee0c1b6dbec64ff155829415867c7747b7e392691a11324dbfc0285a7","start":116}],"target_id":"concept.go.go0098024","target_kind":"node","target_sha256":"c42a86a785142ecf6a2e0b3900b23fd259a32562bbff6326654066b774f5417d"}],"concept.go.go0098025":[{"id":"assertion.concept.go.go0098025","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, baseplate as defined in the captured Gene Ontology term GO:0098025","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, baseplate as: Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","support":[{"end":236,"quote":"Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","source_id":"quickgo.go_0098025","source_sha256":"9e81e37f9b5c2dc9fe2516292b11112ab002726a12c32fb556df53b44c5e9572","start":120}],"target_id":"concept.go.go0098025","target_kind":"node","target_sha256":"c800978f8ea97997a18dade35b1fc76d12bb11ab671452162af18bba42e66b9e"}],"concept.go.go0098026":[{"id":"assertion.concept.go.go0098026","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, tube as defined in the captured Gene Ontology term GO:0098026","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tube as: The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","support":[{"end":238,"quote":"The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","source_id":"quickgo.go_0098026","source_sha256":"2df12f7543899ab593c148ed704c4554201994f2af774a8414b9c88d2ba0ba9e","start":115}],"target_id":"concept.go.go0098026","target_kind":"node","target_sha256":"f504f4899798acd66d0c17d6fe91515647abfd8a70fe7a11a898a7f2e4c9f472"}],"concept.go.go0098027":[{"id":"assertion.concept.go.go0098027","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, sheath as defined in the captured Gene Ontology term GO:0098027","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, sheath as: The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","support":[{"end":254,"quote":"The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","source_id":"quickgo.go_0098027","source_sha256":"8f875ea45b26d6c4d522d74b992d3ab8c0564ea9e911fc075b4835f2024cb381","start":117}],"target_id":"concept.go.go0098027","target_kind":"node","target_sha256":"02d0f8654e333694754ba207cca5851cd4949526bf2f534e2d1de07d5e3dd701"}],"concept.go.go0098028":[{"id":"assertion.concept.go.go0098028","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, shaft as defined in the captured Gene Ontology term GO:0098028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, shaft as: The tube of the non-contractile tails of some viruses.","support":[{"end":170,"quote":"The tube of the non-contractile tails of some viruses.","source_id":"quickgo.go_0098028","source_sha256":"26cff83aa940b3aa40b4eabfa043e844a496f7b3a5079af8f02288e7fe86a309","start":116}],"target_id":"concept.go.go0098028","target_kind":"node","target_sha256":"5c2a3bacb570d8cddc6f6b7441ce0cf8f642efca59475a423569f4378be3aa65"}],"concept.go.go0098029":[{"id":"assertion.concept.go.go0098029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, spike as defined in the captured Gene Ontology term GO:0098029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, spike as: A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","support":[{"end":231,"quote":"A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","source_id":"quickgo.go_0098029","source_sha256":"9f9459c3e5df4bb0a0f9e20e701bc6e8807a6da4cacb0920e46708fac8c6ff59","start":130}],"target_id":"concept.go.go0098029","target_kind":"node","target_sha256":"2f719400e0234524e194c86eee8db7f037e960e901e678e5c73e341542af57bc"}],"concept.go.go0098030":[{"id":"assertion.concept.go.go0098030","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, neck as defined in the captured Gene Ontology term GO:0098030","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, neck as: A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","support":[{"end":250,"quote":"A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","source_id":"quickgo.go_0098030","source_sha256":"49803f3ca15c7a162cb1dd8e97524e2d14a6ce08d63b44367aef1ac6d87d5ae8","start":129}],"target_id":"concept.go.go0098030","target_kind":"node","target_sha256":"6b4a08c3e5a8f3cf5b65324a160d38f138d595fa946d70abd03f2213ce2cbfa9"}],"concept.go.go0098031":[{"id":"assertion.concept.go.go0098031","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, collar as defined in the captured Gene Ontology term GO:0098031","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, collar as: A small disk located at the base of some icosahedral virus capsids.","support":[{"end":198,"quote":"A small disk located at the base of some icosahedral virus capsids.","source_id":"quickgo.go_0098031","source_sha256":"97ed9bbf5a897e0e64dd9cf8311022b9ce7d266647521d9c61f3fbe63fc6e45e","start":131}],"target_id":"concept.go.go0098031","target_kind":"node","target_sha256":"4c0292a3088219bc854237c47d4dfc95c92dd922fdb7620f1112f84cd9f05a9f"}],"concept.go.go0098045":[{"id":"assertion.concept.go.go0098045","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus baseplate assembly as defined in the captured Gene Ontology term GO:0098045","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus baseplate assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","support":[{"end":222,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","source_id":"quickgo.go_0098045","source_sha256":"0e921c37d190e4cd6583cd38acc937a4b98d2dc595d2372ec04cbb5a6d9cb75d","start":123}],"target_id":"concept.go.go0098045","target_kind":"node","target_sha256":"288e8848e48d087e5572da72fc5ab67b0e713eea103325a85c4a924ffb4d2032"}],"concept.go.go0098061":[{"id":"assertion.concept.go.go0098061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid, internal space as defined in the captured Gene Ontology term GO:0098061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, internal space as: The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","support":[{"end":247,"quote":"The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","source_id":"quickgo.go_0098061","source_sha256":"9778a8a1dfafc5e26ea75d622a9df6fedb289f496381bc0fe56039c3866f78dd","start":127}],"target_id":"concept.go.go0098061","target_kind":"node","target_sha256":"440f48d8ba772a0d69c0859962c52058e64668f254fec7f68054e97cbc3e1e32"}],"concept.go.go0098669":[{"id":"assertion.concept.go.go0098669","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"superinfection exclusion as defined in the captured Gene Ontology term GO:0098669","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines superinfection exclusion as: The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","support":[{"end":350,"quote":"The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","source_id":"quickgo.go_0098669","source_sha256":"69ea5ccfc982103f3521e19e9ac6d9a4e77e557f9e007d665fac18b4a8c568fe","start":123}],"target_id":"concept.go.go0098669","target_kind":"node","target_sha256":"a3c85f8c85f5791324d9d7702d912855a7a926fcb0e041cfe199494e95444b04"}],"concept.go.go0098677":[{"id":"assertion.concept.go.go0098677","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion maturation as defined in the captured Gene Ontology term GO:0098677","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion maturation as: Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","support":[{"end":372,"quote":"Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","source_id":"quickgo.go_0098677","source_sha256":"fba7a5341084fbbfe08ea93c1632a4628956d57326366f24c4601266a741a006","start":116}],"target_id":"concept.go.go0098677","target_kind":"node","target_sha256":"f21994f877467414112b637620faed19f0b8926da5b7bd0b383046a64ddafd0b"}],"concept.go.go0098678":[{"id":"assertion.concept.go.go0098678","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tropism switching as defined in the captured Gene Ontology term GO:0098678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tropism switching as: A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","support":[{"end":312,"quote":"A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","source_id":"quickgo.go_0098678","source_sha256":"9a75035b2cb814b5eb59dc5b5a751c976f0fbea0b5b41c356a82cb7de78717af","start":122}],"target_id":"concept.go.go0098678","target_kind":"node","target_sha256":"b27281e125b5d3a2b81dd2633d27d8b875e63de9818e86827f170f0b340fb05a"}],"concept.go.go0098689":[{"id":"assertion.concept.go.go0098689","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"latency-replication decision as defined in the captured Gene Ontology term GO:0098689","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines latency-replication decision as: The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","support":[{"end":444,"quote":"The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","source_id":"quickgo.go_0098689","source_sha256":"2b4b9a2a227682029eb919ee0ec6ff780ec47f660adc3bdc648e29d77b51d4da","start":127}],"target_id":"concept.go.go0098689","target_kind":"node","target_sha256":"4d5d225c99a9870fe2567b05603c4133cd20e7e49b1ecc096ae60b0dc964c238"}],"concept.go.go0098743":[{"id":"assertion.concept.go.go0098743","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell aggregation as defined in the captured Gene Ontology term GO:0098743","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell aggregation as: The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","support":[{"end":357,"quote":"The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","source_id":"quickgo.go_0098743","source_sha256":"8142d8fddca5ccaebabf8747479ed4830c9d5cdac9e97aadce4d41f3195b2f3e","start":115}],"target_id":"concept.go.go0098743","target_kind":"node","target_sha256":"daa3bee154f3b7f8fedbad917dfcef08262100d76f43b2a0251d4452b122ec49"}],"concept.go.go0098754":[{"id":"assertion.concept.go.go0098754","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification as defined in the captured Gene Ontology term GO:0098754","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification as: Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","support":[{"end":348,"quote":"Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","source_id":"quickgo.go_0098754","source_sha256":"96bc3c6602ebcb0b8d37232ec2126fa6a204a671c33ce914894d5fe49eeaee35","start":113}],"target_id":"concept.go.go0098754","target_kind":"node","target_sha256":"3f5c71bb72d4c646e5b0f77a163aecb86c44aac9bc34d04069ff095da19ddad8"}],"concept.go.go0098843":[{"id":"assertion.concept.go.go0098843","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"postsynaptic endocytic zone as defined in the captured Gene Ontology term GO:0098843","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines postsynaptic endocytic zone as: A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","support":[{"end":291,"quote":"A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","source_id":"quickgo.go_0098843","source_sha256":"b439c5f1c132dc642ca0525aa3dc6a99c1b006d3e69d6f83ece79c9e1bb1dbc4","start":126}],"target_id":"concept.go.go0098843","target_kind":"node","target_sha256":"0291d9b2968a272ce53221b3f81327bc0eac55b1a0316478ad7235a9fd799004"}],"concept.go.go0098862":[{"id":"assertion.concept.go.go0098862","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cluster of actin-based cell projections as defined in the captured Gene Ontology term GO:0098862","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cluster of actin-based cell projections as: A cell part consisting of multiple, closely packed actin-based cell projections.","support":[{"end":218,"quote":"A cell part consisting of multiple, closely packed actin-based cell projections.","source_id":"quickgo.go_0098862","source_sha256":"a782165171d7f546a55d7779a5661ec268b5e15d8ac0c4565d5a9844e1e89061","start":138}],"target_id":"concept.go.go0098862","target_kind":"node","target_sha256":"726b9b475b8e73f1512c6a4fb9016d2934cd39a85d4e6eb278a21be9c66fa697"}],"concept.go.go0099009":[{"id":"assertion.concept.go.go0099009","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome circularization as defined in the captured Gene Ontology term GO:0099009","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome circularization as: The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","support":[{"end":578,"quote":"The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","source_id":"quickgo.go_0099009","source_sha256":"f186b0867d82c71d8c2b0eeaaef778c48a04b35e2b2d8448c56ae2d40ba0451e","start":127}],"target_id":"concept.go.go0099009","target_kind":"node","target_sha256":"50be01caeeda6cd43f88c4ea242982fe20647c644f80bd11c537074967747198"}],"concept.go.go0099079":[{"id":"assertion.concept.go.go0099079","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin body as defined in the captured Gene Ontology term GO:0099079","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin body as: An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","support":[{"end":436,"quote":"An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","source_id":"quickgo.go_0099079","source_sha256":"673ebccf05bb91629e74afe69a0e22628e61399aeffcd7b21cea355c0316fe11","start":109}],"target_id":"concept.go.go0099079","target_kind":"node","target_sha256":"c831f6ded84ded5d45357d33970c6e3170d99bf03f944f2ae91b3fccd98d03b7"}],"concept.go.go0099086":[{"id":"assertion.concept.go.go0099086","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptonemal structure as defined in the captured Gene Ontology term GO:0099086","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptonemal structure as: A proteinaceous scaffold found between homologous chromosomes during meiosis.","support":[{"end":198,"quote":"A proteinaceous scaffold found between homologous chromosomes during meiosis.","source_id":"quickgo.go_0099086","source_sha256":"c246967bcada69d0fede2ee886732832f5048128fef524b59e01262b9bf56a0a","start":121}],"target_id":"concept.go.go0099086","target_kind":"node","target_sha256":"6e33c37edebdb093a6463c5b309fc8d4b6049965c126404ac9bf785348a7275f"}],"concept.go.go0099120":[{"id":"assertion.concept.go.go0099120","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"socially cooperative development as defined in the captured Gene Ontology term GO:0099120","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines socially cooperative development as: The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","support":[{"end":521,"quote":"The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","source_id":"quickgo.go_0099120","source_sha256":"dd176739be797108a9c03baa00c05d427adf6fc0de55af2fc7994474c35c1936","start":131}],"target_id":"concept.go.go0099120","target_kind":"node","target_sha256":"a6de8a2d73b1c592dfeaa9429935115bda08b80a61e9e02205a0adc5a57ec216"}],"concept.go.go0099522":[{"id":"assertion.concept.go.go0099522","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytosolic region as defined in the captured Gene Ontology term GO:0099522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosolic region as: Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","support":[{"end":215,"quote":"Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","source_id":"quickgo.go_0099522","source_sha256":"4974a16f48dea7d9b7a7a2b3df58e13f3a8f46e158168b940a35928fae969631","start":115}],"target_id":"concept.go.go0099522","target_kind":"node","target_sha256":"0918d030c040f3746aba0a2552935dfc115bf4d0f11e648492ca5d5798f5ff2d"}],"concept.go.go0106125":[{"id":"assertion.concept.go.go0106125","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reservosome matrix as defined in the captured Gene Ontology term GO:0106125","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome matrix as: A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","support":[{"end":209,"quote":"A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","source_id":"quickgo.go_0106125","source_sha256":"366fd42ee08df9064317b284b5ea46bd8ca73e1b0499f6eb6ca5ebc4371533e3","start":117}],"target_id":"concept.go.go0106125","target_kind":"node","target_sha256":"529eb224bf87b0cc322a4f7afcff141650326b4054f1fff827a2dc1ba966001c"}],"concept.go.go0106126":[{"id":"assertion.concept.go.go0106126","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reservosome membrane as defined in the captured Gene Ontology term GO:0106126","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome membrane as: The lipid bilayer surrounding a reservosome.","support":[{"end":163,"quote":"The lipid bilayer surrounding a reservosome.","source_id":"quickgo.go_0106126","source_sha256":"d3d6bcee6e1cdabfafaf7e797f0bf7d8dddba6ed4eba913825c172ddc60cce19","start":119}],"target_id":"concept.go.go0106126","target_kind":"node","target_sha256":"f3e636c56e3708155dfe72e6d6f694a5a32f9dad268c5976fa02f3574c6b80df"}],"concept.go.go0110134":[{"id":"assertion.concept.go.go0110134","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic drive as defined in the captured Gene Ontology term GO:0110134","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic drive as: A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","support":[{"end":512,"quote":"A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","source_id":"quickgo.go_0110134","source_sha256":"622def39608aded07521a3d2f278e538fd708ff3d73b9052e09635b289e75049","start":112}],"target_id":"concept.go.go0110134","target_kind":"node","target_sha256":"fd279fc0be0327fbdfcdb8a89ff4b8c03b3af6407bf4296cf582c63af5a6f312"}],"concept.go.go0110165":[{"id":"assertion.concept.go.go0110165","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular anatomical structure as defined in the captured Gene Ontology term GO:0110165","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular anatomical structure as: A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","support":[{"end":411,"quote":"A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","source_id":"quickgo.go_0110165","source_sha256":"2c54ec8478a9b47a70c11fcf7894db8a48ff25cbff8c6890d27aad42c4adbd19","start":128}],"target_id":"concept.go.go0110165","target_kind":"node","target_sha256":"26d98a6361683b1945d6de306fea679b98c661b3de3c44b04b21a2cf3d189b00"}],"concept.go.go0120082":[{"id":"assertion.concept.go.go0120082","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"smooth endoplasmic reticulum cisterna as defined in the captured Gene Ontology term GO:0120082","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines smooth endoplasmic reticulum cisterna as: A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","support":[{"end":258,"quote":"A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","source_id":"quickgo.go_0120082","source_sha256":"0b1c15f3753422acd3f31ebcf9c9c18bcaa8e2a17fe2931ee9858ec757bc1db0","start":136}],"target_id":"concept.go.go0120082","target_kind":"node","target_sha256":"0575a6eb80ae5234e58c0345547841ff8d8fe2fe6ab8b29629d85a1e799f9ea3"}],"concept.go.go0120102":[{"id":"assertion.concept.go.go0120102","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum secretion apparatus as defined in the captured Gene Ontology term GO:0120102","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum secretion apparatus as: A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","support":[{"end":566,"quote":"A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","source_id":"quickgo.go_0120102","source_sha256":"5f1f1bb1eb27003c98aaf249d55f0039b3dbe7923c201209cb6711878a753cf5","start":143}],"target_id":"concept.go.go0120102","target_kind":"node","target_sha256":"7edbdb18c75fdfbd08cc075686236feae935c86a419035e30d19db2983d0b61c"}],"concept.go.go0120104":[{"id":"assertion.concept.go.go0120104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic actomyosin contractile ring, proximal layer as defined in the captured Gene Ontology term GO:0120104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic actomyosin contractile ring, proximal layer as: The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","support":[{"end":267,"quote":"The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","source_id":"quickgo.go_0120104","source_sha256":"d9ac41bf215e32d99677ef91a4bcfde554c81af2efae17c6aa3633035e72fd7a","start":150}],"target_id":"concept.go.go0120104","target_kind":"node","target_sha256":"39b44c24efee1f9612f3a75364e18c3afd5d7e32939d907b1f9ae99b9d384b69"}],"concept.go.go0120135":[{"id":"assertion.concept.go.go0120135","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"distal portion of axoneme as defined in the captured Gene Ontology term GO:0120135","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal portion of axoneme as: The portion of the axoneme that is close to the tip of the cilium.","support":[{"end":190,"quote":"The portion of the axoneme that is close to the tip of the cilium.","source_id":"quickgo.go_0120135","source_sha256":"2539189376d3cd08aeaea1f1192fb6e124a3d21792a6a2a7ce1257f5fb3a1215","start":124}],"target_id":"concept.go.go0120135","target_kind":"node","target_sha256":"6a6af5a426cbe9f004f0d64559d43fc6d10239741fa423d2547b290fbfd5dd5a"}],"concept.go.go0120212":[{"id":"assertion.concept.go.go0120212","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm head-tail coupling apparatus as defined in the captured Gene Ontology term GO:0120212","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm head-tail coupling apparatus as: A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","support":[{"end":293,"quote":"A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","source_id":"quickgo.go_0120212","source_sha256":"aa1e6c3235028fa698d4595a9d1e3ddcf6725aefb0670ab1d6993aa60949c643","start":133}],"target_id":"concept.go.go0120212","target_kind":"node","target_sha256":"c254d18e014a71fd5f0efe4ad4a5bfe046930f9f621ddd09183c64130381ff71"}],"concept.go.go0120312":[{"id":"assertion.concept.go.go0120312","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary basal body segregation as defined in the captured Gene Ontology term GO:0120312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary basal body segregation as: The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","support":[{"end":430,"quote":"The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","source_id":"quickgo.go_0120312","source_sha256":"df84e12742f0d132a8021c9d8dfc820ed1af9162f3de8a87efebc4f5ad90b054","start":129}],"target_id":"concept.go.go0120312","target_kind":"node","target_sha256":"a9fcdc2c512a3f03b6a27baf0cb666a855250d900e417422d9c315fdb624a71f"}],"concept.go.go0120318":[{"id":"assertion.concept.go.go0120318","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"olfactory sociosexual communication as defined in the captured Gene Ontology term GO:0120318","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines olfactory sociosexual communication as: The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","support":[{"end":419,"quote":"The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","source_id":"quickgo.go_0120318","source_sha256":"c38729445b1d24c0b802fcd0410e03fbb56d14c307a33704e0d9d981b04a4e3b","start":134}],"target_id":"concept.go.go0120318","target_kind":"node","target_sha256":"288127ca68f1ac7294d4dbdc89dd737f4a94fa2403827379e06693634f041265"}],"concept.go.go0120321":[{"id":"assertion.concept.go.go0120321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nuclear envelope adjacent to nuclear pore complex as defined in the captured Gene Ontology term GO:0120321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear envelope adjacent to nuclear pore complex as: The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","support":[{"end":237,"quote":"The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","source_id":"quickgo.go_0120321","source_sha256":"165fd2302031b9324ea97312753415c041d5bb1c4144cd557640b94aae8535b0","start":148}],"target_id":"concept.go.go0120321","target_kind":"node","target_sha256":"06eaa0257d3e0f3eaf4bd92322b11b9877d840c9c55dd9e943eec1e485e94505"}],"concept.go.go0140029":[{"id":"assertion.concept.go.go0140029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"exocytic process as defined in the captured Gene Ontology term GO:0140029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines exocytic process as: The cellular processes that contribute to exocytosis.","support":[{"end":168,"quote":"The cellular processes that contribute to exocytosis.","source_id":"quickgo.go_0140029","source_sha256":"00a10a720271f5214b0e5ed9b5b37317e44cdce3f3aff320559a687ec19db089","start":115}],"target_id":"concept.go.go0140029","target_kind":"node","target_sha256":"22b20342e750704c7be48f19f8c9d2f33ce196acf8d733cbf08628a45e77f86a"}],"concept.go.go0140106":[{"id":"assertion.concept.go.go0140106","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hematophagy as defined in the captured Gene Ontology term GO:0140106","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hematophagy as: A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","support":[{"end":481,"quote":"A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","source_id":"quickgo.go_0140106","source_sha256":"2ae0936dde03a6c679ee824186575764fe4392f666d0ce3e4df26a8ccd90a7d5","start":110}],"target_id":"concept.go.go0140106","target_kind":"node","target_sha256":"aee0585cddb59177f8c7e70d156d31e7a2f090c92bebbf5cb6d4d9afc6744c7d"}],"concept.go.go0140253":[{"id":"assertion.concept.go.go0140253","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell-cell fusion as defined in the captured Gene Ontology term GO:0140253","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell-cell fusion as: A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","support":[{"end":358,"quote":"A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","source_id":"quickgo.go_0140253","source_sha256":"0e754320bfc9b0f8432b11315925054a0a01ff8190c73eefc73719263bb0e867","start":115}],"target_id":"concept.go.go0140253","target_kind":"node","target_sha256":"0b65ef76f328432519800aafc4f3f74c2fc487a5e342e592973c1336d2ae6a9a"}],"concept.go.go0140352":[{"id":"assertion.concept.go.go0140352","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"export from cell as defined in the captured Gene Ontology term GO:0140352","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines export from cell as: The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","support":[{"end":273,"quote":"The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","source_id":"quickgo.go_0140352","source_sha256":"115eb6b28adc6d33ec24cd50337b5976291f1cbb5b5045962f1a131c0f8804d7","start":115}],"target_id":"concept.go.go0140352","target_kind":"node","target_sha256":"a4c2e441d457253410170f4f87186c71ca4366ab1a3056535f459638137679f0"}],"concept.go.go0140511":[{"id":"assertion.concept.go.go0140511","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic nuclear bridge stalk as defined in the captured Gene Ontology term GO:0140511","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge stalk as: Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","support":[{"end":312,"quote":"Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","source_id":"quickgo.go_0140511","source_sha256":"3b9016c7879ef6ec80e2082924025591e7d0089dd1c074e97573ab629e45dee2","start":127}],"target_id":"concept.go.go0140511","target_kind":"node","target_sha256":"1d25a34e2c50da518485cd02e09f5f116ef597190c5bb5d498d7275c7b1e7ab7"}],"concept.go.go0140547":[{"id":"assertion.concept.go.go0140547","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acquisition of seed longevity as defined in the captured Gene Ontology term GO:0140547","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of seed longevity as: The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","support":[{"end":494,"quote":"The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","source_id":"quickgo.go_0140547","source_sha256":"15c6ba2b80ecdb30a4a3b6cb1017a79144735ec4d958ce18886150de8ed1c28c","start":128}],"target_id":"concept.go.go0140547","target_kind":"node","target_sha256":"94e36c78119ef2004cbb137a5fd3ef58bd435bde789757ef2afd847a28b53f41"}],"concept.go.go0140599":[{"id":"assertion.concept.go.go0140599","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic nuclear bridge midzone membrane domain as defined in the captured Gene Ontology term GO:0140599","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge midzone membrane domain as: A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","support":[{"end":293,"quote":"A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","source_id":"quickgo.go_0140599","source_sha256":"b0cd43c4de9602f62238ca72601619e39d3ffcb9fd2116be6dfb46d552e10a06","start":145}],"target_id":"concept.go.go0140599","target_kind":"node","target_sha256":"382b7e00c90b37d64fb2e73a0415c6c8e2aae5595c74493cc41aee37c946b823"}],"concept.go.go0140725":[{"id":"assertion.concept.go.go0140725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of free heme as defined in the captured Gene Ontology term GO:0140725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of free heme as: Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","support":[{"end":319,"quote":"Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","source_id":"quickgo.go_0140725","source_sha256":"58269d185f9ed24b95d0a7fee5eae8f7e7d55a5477b4559fb027e5ba8a472769","start":126}],"target_id":"concept.go.go0140725","target_kind":"node","target_sha256":"8c8c4f8fb70c2f6a5adde16a5063834af966228a9ea43a08bf422cc27aa49818"}],"concept.go.go0140729":[{"id":"assertion.concept.go.go0140729","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of endogenously produced metabolite as defined in the captured Gene Ontology term GO:0140729","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of endogenously produced metabolite as: A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","support":[{"end":387,"quote":"A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","source_id":"quickgo.go_0140729","source_sha256":"dd3504cc30eb33a4fa357b80a377d28b6b3f0f4cbef442f3121c37aad9c9f52c","start":149}],"target_id":"concept.go.go0140729","target_kind":"node","target_sha256":"ad0e88aba8f35d1c77ecd8e82b9d4c71ba7ed659f6206d316449df6515f29f6d"}],"concept.go.go0140755":[{"id":"assertion.concept.go.go0140755","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reorganization of host cellular membranes to establish sites of replication as defined in the captured Gene Ontology term GO:0140755","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reorganization of host cellular membranes to establish sites of replication as: A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","support":[{"end":377,"quote":"A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","source_id":"quickgo.go_0140755","source_sha256":"1200f2763e9219793667502c65220b6d9e81977c7a30206ec5f5236dad610c56","start":174}],"target_id":"concept.go.go0140755","target_kind":"node","target_sha256":"a0cb1b19bb04f232b294642e93e796fc85a7cd389a8601fad5b3a42957ba0be3"}],"concept.go.go0140918":[{"id":"assertion.concept.go.go0140918","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"centrosomal core as defined in the captured Gene Ontology term GO:0140918","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines centrosomal core as: The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","support":[{"end":345,"quote":"The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","source_id":"quickgo.go_0140918","source_sha256":"3383c60a1e25c882eb71bf6a90f0bd74f2ee9b652b066a33d4983d159fa9c4f7","start":115}],"target_id":"concept.go.go0140918","target_kind":"node","target_sha256":"a3401c576c339f6bd96ee0ae9b8c23e48a4a8af600a238ec613be9690c742cac"}],"concept.go.go0141060":[{"id":"assertion.concept.go.go0141060","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"disruption of anatomical structure in another organism as defined in the captured Gene Ontology term GO:0141060","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines disruption of anatomical structure in another organism as: The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","support":[{"end":276,"quote":"The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","source_id":"quickgo.go_0141060","source_sha256":"77cfd7be56a2625d89501884471ecffc65f49c003f63420935ae5d541416a0e5","start":153}],"target_id":"concept.go.go0141060","target_kind":"node","target_sha256":"4181202d8070eb2fab7d22ce983b216bc3ddac6523a369d7edf4a8234d669b47"}],"concept.go.go0150034":[{"id":"assertion.concept.go.go0150034","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"distal axon as defined in the captured Gene Ontology term GO:0150034","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal axon as: That part of an axon close to and including the growth cone or the axon terminus.","support":[{"end":191,"quote":"That part of an axon close to and including the growth cone or the axon terminus.","source_id":"quickgo.go_0150034","source_sha256":"ee166d4fa6500f772b17cf542ccbcbc4f0cb8997ba3664fc0b2b7e9803827502","start":110}],"target_id":"concept.go.go0150034","target_kind":"node","target_sha256":"1abd67c7971f7767bdc96bfcf8022ac7eb8f1b9babc6579fa1723d2552661f5c"}],"concept.go.go0160266":[{"id":"assertion.concept.go.go0160266","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anestrus phase as defined in the captured Gene Ontology term GO:0160266","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anestrus phase as: A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","support":[{"end":410,"quote":"A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","source_id":"quickgo.go_0160266","source_sha256":"a92d2fce9d45b6ce243cb7519a9dae14676f8e6c838078d55a9977e6bf08b61c","start":113}],"target_id":"concept.go.go0160266","target_kind":"node","target_sha256":"bb1e97d0ab32f0ec568c027667310182511637a462d64d9e2393379000afc0a6"}],"concept.go.go0170047":[{"id":"assertion.concept.go.go0170047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus-like capsid as defined in the captured Gene Ontology term GO:0170047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus-like capsid as: A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","support":[{"end":512,"quote":"A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","source_id":"quickgo.go_0170047","source_sha256":"9ebd6be3dd11597c08af85f51b9c4c5a92b3a0320e28be08000de9058908f3c5","start":116}],"target_id":"concept.go.go0170047","target_kind":"node","target_sha256":"3e1058325dc891b4367d106a25a0ec2ead66d08a792c525cfe12319c8634cab8"}],"concept.go.go0170062":[{"id":"assertion.concept.go.go0170062","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nutrient storage as defined in the captured Gene Ontology term GO:0170062","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nutrient storage as: The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","support":[{"end":386,"quote":"The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","source_id":"quickgo.go_0170062","source_sha256":"6bc73afefd616853e3625b42de2aef0aa8e870f12a4fe0c125351e42d4b670b5","start":115}],"target_id":"concept.go.go0170062","target_kind":"node","target_sha256":"4a6fbcd3fe9995cb77d1fc7c3ead1f1a0daee6b0d744cc2922efb02b8e5ed355"}],"concept.go.go1903046":[{"id":"assertion.concept.go.go1903046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic cell cycle process as defined in the captured Gene Ontology term GO:1903046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle process as: A process that is part of the meiotic cell cycle.","support":[{"end":174,"quote":"A process that is part of the meiotic cell cycle.","source_id":"quickgo.go_1903046","source_sha256":"4d6d8beced2221204d88af7d8eb28cd05d20cd26988e0b59553b9eb46b7236eb","start":125}],"target_id":"concept.go.go1903046","target_kind":"node","target_sha256":"785237e6f8436c5ed2e4231e298e39280f2ab6669b0451c16987077bfe6bf2cc"}],"concept.go.go1990047":[{"id":"assertion.concept.go.go1990047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spindle matrix as defined in the captured Gene Ontology term GO:1990047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spindle matrix as: A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","support":[{"end":271,"quote":"A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","source_id":"quickgo.go_1990047","source_sha256":"bda166eb21e2f8b312a47d0b2a0458ce006a62aefbbd427c566c30f80732a827","start":113}],"target_id":"concept.go.go1990047","target_kind":"node","target_sha256":"96088c4b2b11b59687ef880e28667eeaeb84aab033d64f2dc0d40e03dbef1f95"}],"concept.go.go1990110":[{"id":"assertion.concept.go.go1990110","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"callus formation as defined in the captured Gene Ontology term GO:1990110","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines callus formation as: The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","support":[{"end":390,"quote":"The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","source_id":"quickgo.go_1990110","source_sha256":"0dbfcc4988efcda7a5427bebaf376348658b86eab56265abb0f5d5bd8aeb6797","start":115}],"target_id":"concept.go.go1990110","target_kind":"node","target_sha256":"3afd53a3b9a9847bcab263a6af6904746dfb65ab33ffc8422b97bb627b081464"}],"concept.go.go1990277":[{"id":"assertion.concept.go.go1990277","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"parasexual reproduction with cellular fusion as defined in the captured Gene Ontology term GO:1990277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines parasexual reproduction with cellular fusion as: A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","support":[{"end":263,"quote":"A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","source_id":"quickgo.go_1990277","source_sha256":"ef7be952e751a68bc6d969000ce513b228550d6e68637c5a534e1153b04b91a7","start":143}],"target_id":"concept.go.go1990277","target_kind":"node","target_sha256":"ff89d69ae0d685b25a0e42f7fd38d2633f940d4e429cbe0d7cf65228a3697bb1"}],"concept.go.go1990636":[{"id":"assertion.concept.go.go1990636","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive senescence as defined in the captured Gene Ontology term GO:1990636","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive senescence as: A life cycle stage during which the reproductive capacity and fitness of an organism declines.","support":[{"end":216,"quote":"A life cycle stage during which the reproductive capacity and fitness of an organism declines.","source_id":"quickgo.go_1990636","source_sha256":"b056bfc4ad8fa0afa95f82c48be2a16b75084a9061dbec503d45cf3d0078166b","start":122}],"target_id":"concept.go.go1990636","target_kind":"node","target_sha256":"b9c782afc825f9034e907b6202aac42bd0781cb677e9d3c16e6c332767b5f35a"}],"concept.go.go1990717":[{"id":"assertion.concept.go.go1990717","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axonemal central bridge as defined in the captured Gene Ontology term GO:1990717","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines axonemal central bridge as: Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","support":[{"end":265,"quote":"Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","source_id":"quickgo.go_1990717","source_sha256":"37aefa0b3b11e120f924fa26f2b57fc50ccf001ebd91b49acbaa0b20da936409","start":122}],"target_id":"concept.go.go1990717","target_kind":"node","target_sha256":"cfe9376916ce8f3bf2558dcc83d4e49733a030d823ac61d6214e1a5bb314fceb"}],"concept.go.go1990748":[{"id":"assertion.concept.go.go1990748","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular detoxification as defined in the captured Gene Ontology term GO:1990748","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular detoxification as: Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","support":[{"end":391,"quote":"Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","source_id":"quickgo.go_1990748","source_sha256":"44f76fa4f23992b7a4d7325247d6c09ba05ade83591dc160b097ef33616e2c43","start":122}],"target_id":"concept.go.go1990748","target_kind":"node","target_sha256":"47a1633f06ddd774bbc27cf4f7032856d7547c90a6424930b823c6bd2b933a74"}],"concept.go.go1990826":[{"id":"assertion.concept.go.go1990826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nucleoplasmic periphery of the nuclear pore complex as defined in the captured Gene Ontology term GO:1990826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasmic periphery of the nuclear pore complex as: Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","support":[{"end":231,"quote":"Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","source_id":"quickgo.go_1990826","source_sha256":"868c5c562d7e48fdb580a2d10afdbbcfa743abcb8dd985a0fb59a7aeb29250b1","start":150}],"target_id":"concept.go.go1990826","target_kind":"node","target_sha256":"0950e75ff7fcbb7289bc1a5248f3ef1d1953313c2439592322caa8fc50849cc0"}],"concept.go.go1990836":[{"id":"assertion.concept.go.go1990836","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysosomal matrix as defined in the captured Gene Ontology term GO:1990836","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal matrix as: A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","support":[{"end":241,"quote":"A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","source_id":"quickgo.go_1990836","source_sha256":"b312282ddeb2314c1c4d11cf1c289869ebd7890787a7fd86312d8f1656ebd62b","start":115}],"target_id":"concept.go.go1990836","target_kind":"node","target_sha256":"6edf791e19d7897303a8d86e370a5ac740bd3acc1edde2919a29768d4cd782e4"}],"concept.go.go1990900":[{"id":"assertion.concept.go.go1990900","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary pocket collar as defined in the captured Gene Ontology term GO:1990900","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary pocket collar as: A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","support":[{"end":355,"quote":"A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","source_id":"quickgo.go_1990900","source_sha256":"e2089cf1abebe84e67a9179048d9f990f3a36daca3d885c10e46a8bc99b7d58b","start":120}],"target_id":"concept.go.go1990900","target_kind":"node","target_sha256":"8500a7bd1f12528161c9dd571ebf012839b3b1311c941923192ae7ddd56e97e4"}],"concept.go.go7770056":[{"id":"assertion.concept.go.go7770056","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal-level extracellular fluid acidification as defined in the captured Gene Ontology term GO:7770056","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level extracellular fluid acidification as: Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","support":[{"end":309,"quote":"Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","source_id":"quickgo.go_7770056","source_sha256":"77fee1c44c6a979e4bcf0e1506b1c878fd619f1450c66689aa702af5aed80fe0","start":163}],"target_id":"concept.go.go7770056","target_kind":"node","target_sha256":"53ba6bb85030c1cb7ed41b1800475eaf45752d6b5c2ae9ad4eb16bad5a94e242"}],"concept.go.go7770129":[{"id":"assertion.concept.go.go7770129","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spermatid residual body as defined in the captured Gene Ontology term GO:7770129","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spermatid residual body as: A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","support":[{"end":667,"quote":"A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","source_id":"quickgo.go_7770129","source_sha256":"090dbefcee1ee05c0b5de49ed683f3b6ba5f7ec0dbdeaa2b4ca92c9a7427cda6","start":122}],"target_id":"concept.go.go7770129","target_kind":"node","target_sha256":"b0f774502e2dbda094c94755365e64299b50dad1d6b3ae4d6405fc11dc2096dd"}],"concept.gravitational-phase-evolution":[{"id":"assertion.complete.concept.gravitational-phase-evolution","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gravity-induced relative phase can entangle masses.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.gravitational-phase-evolution","target_kind":"node","target_sha256":"74b1155e3f51de1f3b694c96d2148c86cf6a84cca2e4aad39f3dd8df4231bb63"}],"concept.gravity-mediated-entanglement":[{"id":"assertion.complete.concept.gravity-mediated-entanglement","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Entanglement generated through gravity.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.gravity-mediated-entanglement","target_kind":"node","target_sha256":"c7619569bc3ed8998e4ca852b8fd952301075ed6d88d526af262cb9e4ed6ec28"}],"concept.holographic-duality":[{"id":"assertion.complete.concept.holographic-duality","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In the cited AdS/CFT proposal, particular M/string-theory compactifications on Anti-de Sitter spacetimes are conjectured to be dual to conformal field theories. This record describes that proposal, without asserting a universal duality.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"concept.holographic-duality","target_kind":"node","target_sha256":"ccf70373f970b2b0ce0a0e2ddc32e663a103009e8be1f58d5fcc2fb8dc819711"}],"concept.large-n-limit":[{"id":"assertion.complete.concept.large-n-limit","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In Maldacena's construction, the large-N limit of certain conformal field theories contains a sector describing supergravity on products of Anti-de Sitter spaces and compact manifolds.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"concept.large-n-limit","target_kind":"node","target_sha256":"7663dc53b3fcd4d06e25225a51fc7aeb27ce4642fcc1e6796bb2442634519188"}],"concept.lorentz-invariance-violation":[{"id":"assertion.complete.concept.lorentz-invariance-violation","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Energy-dependent photon propagation in some QG models.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"concept.lorentz-invariance-violation","target_kind":"node","target_sha256":"0a8d6e2c38f233396acddcd933151b609577107463803d970f7433e50e987513"}],"concept.mesh.d000024":[{"id":"assertion.concept.mesh.d000024","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Abortion, Illegal as described in the captured NLM MeSH descriptor D000024","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Abortion, Illegal as: Illegal termination of pregnancy.","support":[{"end":520,"quote":"Illegal termination of pregnancy.","source_id":"nlm-mesh.d000024","source_sha256":"a8ff40325ab8839a7c6a14d95f0bedebe6dfda09daeb91f2a907f21253b58e07","start":487}],"target_id":"concept.mesh.d000024","target_kind":"node","target_sha256":"aeb4f12de6fbe2ed3ce0f7e0a95ccf47a33eaceb78094fc8d45da9fda0b5f001"}],"concept.mesh.d000057":[{"id":"assertion.concept.mesh.d000057","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Accident Proneness as described in the captured NLM MeSH descriptor D000057","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Accident Proneness as: Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","support":[{"end":468,"quote":"Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","source_id":"nlm-mesh.d000057","source_sha256":"308034b533e8349f9cd59c33dc359175cef60b5f0941d989e5f42338600576c1","start":352}],"target_id":"concept.mesh.d000057","target_kind":"node","target_sha256":"4d2122a35fd96a278c40dbae0f14c2b5b0d1ea3069e6bd3aa3e46225600f3274"}],"concept.mesh.d000066479":[{"id":"assertion.concept.mesh.d000066479","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Criminal Behavior as described in the captured NLM MeSH descriptor D000066479","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Criminal Behavior as: Conduct leading to commission of unlawful acts.","support":[{"end":403,"quote":"Conduct leading to commission of unlawful acts.","source_id":"nlm-mesh.d000066479","source_sha256":"91143c2606644581af22414104b6ddfb16716bf7c07559e73716a387b38ffe31","start":356}],"target_id":"concept.mesh.d000066479","target_kind":"node","target_sha256":"4f890c56118f7f3c44c66b1fb9b4b7ce47f64694c1d723e46bbb7384ad7c30f5"}],"concept.mesh.d000066498":[{"id":"assertion.concept.mesh.d000066498","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotional Adjustment as described in the captured NLM MeSH descriptor D000066498","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotional Adjustment as: Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","support":[{"end":487,"quote":"Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","source_id":"nlm-mesh.d000066498","source_sha256":"1c1eaacf86e27a0845f7b8d11c5b83d20287b19ce62efabd0949abe6c428defa","start":382}],"target_id":"concept.mesh.d000066498","target_kind":"node","target_sha256":"32a00ff15d7e9c87cb62beb0076acc6fc98b3c65bf5671b79580eec7c73d57ce"}],"concept.mesh.d000066768":[{"id":"assertion.concept.mesh.d000066768","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Rehabilitation Research as described in the captured NLM MeSH descriptor D000066768","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Rehabilitation Research as: Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of REHABILITATION .","support":[{"end":512,"quote":"Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of\nREHABILITATION\n.","source_id":"nlm-mesh.d000066768","source_sha256":"04401a4af5cc028a5170b8d7c6d5aed0f8e2f95b96f9dae46f638df1438cadd7","start":376}],"target_id":"concept.mesh.d000066768","target_kind":"node","target_sha256":"c6a6c0e462f6c4f5ad11d6026622e82a8e24cac246bb2b9b29f7ca396501feb1"}],"concept.mesh.d000067448":[{"id":"assertion.concept.mesh.d000067448","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Defamation as described in the captured NLM MeSH descriptor D000067448","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Defamation as: Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","support":[{"end":497,"quote":"Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","source_id":"nlm-mesh.d000067448","source_sha256":"46fc3778b86c2317904915b4354cdfe304946fac10c192cb24462eb72ef09fad","start":366}],"target_id":"concept.mesh.d000067448","target_kind":"node","target_sha256":"bd51c7c15163b0e3bbdc6f60fff80948bb7cac6df53d4d29f9289fa2e3c3151a"}],"concept.mesh.d000067495":[{"id":"assertion.concept.mesh.d000067495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Healthcare Failure Mode and Effect Analysis as described in the captured NLM MeSH descriptor D000067495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Healthcare Failure Mode and Effect Analysis as: Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","support":[{"end":638,"quote":"Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","source_id":"nlm-mesh.d000067495","source_sha256":"b1e8a4fffa311b0cfd2be2c4294597d6c10cc28d2ebc25799c739f0982268681","start":528}],"target_id":"concept.mesh.d000067495","target_kind":"node","target_sha256":"ba588913e05b0230d69c90b8de0972715b2d9bb9ccf8820bf93a219705cbb4f9"}],"concept.mesh.d000067496":[{"id":"assertion.concept.mesh.d000067496","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spirit Possession as described in the captured NLM MeSH descriptor D000067496","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spirit Possession as: The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","support":[{"end":627,"quote":"The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","source_id":"nlm-mesh.d000067496","source_sha256":"945685dbb5cf3da98ccc6c8d3481f7927f71dc564f5a7b371ce665abdb878f12","start":360}],"target_id":"concept.mesh.d000067496","target_kind":"node","target_sha256":"48c9df29210e45b807ca552f62ca28086e9a9305f9e4077840256837f9b4f9e2"}],"concept.mesh.d000067551":[{"id":"assertion.concept.mesh.d000067551","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Diplomacy as described in the captured NLM MeSH descriptor D000067551","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Diplomacy as: The art and practice of conducting negotiations between people, nations or other parties such as organizations.","support":[{"end":491,"quote":"The art and practice of conducting negotiations between people, nations or other parties such as organizations.","source_id":"nlm-mesh.d000067551","source_sha256":"ae70d0136783a0b0b8cf0b4cf7c72908cd7c582c45c018aab32b65ba00f92355","start":380}],"target_id":"concept.mesh.d000067551","target_kind":"node","target_sha256":"48fa9474009cb5f88838e61d28143b7bd0a45bc23cd4508ae6c3152744dca3ce"}],"concept.mesh.d000067656":[{"id":"assertion.concept.mesh.d000067656","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optimism as described in the captured NLM MeSH descriptor D000067656","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optimism as: Mental attitude that interprets life events as generally being positive.","support":[{"end":410,"quote":"Mental attitude that interprets life events as generally being positive.","source_id":"nlm-mesh.d000067656","source_sha256":"f6679c211c6575ac7a731f3b0e384d26389b1e22edec1380bca9afe74e1b31fc","start":338}],"target_id":"concept.mesh.d000067656","target_kind":"node","target_sha256":"31f24323c50b7838d3bb7653de1bf3ea35e38f57bcf00046b531d43af9201d9d"}],"concept.mesh.d000067657":[{"id":"assertion.concept.mesh.d000067657","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pessimism as described in the captured NLM MeSH descriptor D000067657","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pessimism as: Mental attitude that interprets life events as generally being negative.","support":[{"end":412,"quote":"Mental attitude that interprets life events as generally being negative.","source_id":"nlm-mesh.d000067657","source_sha256":"7b43497ef1329394babf1d62b5c64e073b810c7d21a325c724ba4649816743ba","start":340}],"target_id":"concept.mesh.d000067657","target_kind":"node","target_sha256":"a6f084bd1417edde8ee8ec9bfb474ee3854b6df988947589b642283d2c1625a0"}],"concept.mesh.d000067896":[{"id":"assertion.concept.mesh.d000067896","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Industrial Development as described in the captured NLM MeSH descriptor D000067896","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Industrial Development as: Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and COMMERCE .","support":[{"end":518,"quote":"Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and\nCOMMERCE\n.","source_id":"nlm-mesh.d000067896","source_sha256":"0d84b5e003a0f75f3eda0317bfb59769113388deb8124cc7431728c82501e0f6","start":382}],"target_id":"concept.mesh.d000067896","target_kind":"node","target_sha256":"5712cc7cf5dbb8ff31da6f29d079595448864d26ef05341276bfdd385df0607d"}],"concept.mesh.d000068616":[{"id":"assertion.concept.mesh.d000068616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Professionalism as described in the captured NLM MeSH descriptor D000068616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Professionalism as: The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","support":[{"end":486,"quote":"The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","source_id":"nlm-mesh.d000068616","source_sha256":"41fc6567c33bb58d274ce0fb976303db847a280ef953fc5d5dc54843b236fbf6","start":380}],"target_id":"concept.mesh.d000068616","target_kind":"node","target_sha256":"028035ed9651313e4216263e83f592430e0764815d22076986e5acf157a3fef8"}],"concept.mesh.d000069457":[{"id":"assertion.concept.mesh.d000069457","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Forecast as described in the captured NLM MeSH descriptor D000069457","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Forecast as: Estimates of projected population.","support":[{"end":406,"quote":"Estimates of projected population.","source_id":"nlm-mesh.d000069457","source_sha256":"0d00b13e3f066be53058e3a30394d3117aa33917f1fb84e975cf966bba60b6df","start":372}],"target_id":"concept.mesh.d000069457","target_kind":"node","target_sha256":"5bb4001c5035d0bb5f89729ee4f0f89a85f7a9d2f814d5f74cb5d55cfdbacd63"}],"concept.mesh.d000069550":[{"id":"assertion.concept.mesh.d000069550","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Machine Learning as described in the captured NLM MeSH descriptor D000069550","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Machine Learning as: A type of ARTIFICIAL INTELLIGENCE that enable COMPUTERS to independently initiate and execute LEARNING when exposed to new data.","support":[{"end":506,"quote":"A type of\nARTIFICIAL INTELLIGENCE\nthat enable\nCOMPUTERS\nto independently initiate and execute\nLEARNING\nwhen exposed to new data.","source_id":"nlm-mesh.d000069550","source_sha256":"ca81e9be6c809ff656c0163cc73e6d10e8e59e70c5eec0dab00dbdc3e424c0bb","start":378}],"target_id":"concept.mesh.d000069550","target_kind":"node","target_sha256":"c122d68ded3ca88dcc92bf64b65a141d8980deb38cc50fbfd5a9e82b2f26489d"}],"concept.mesh.d000069553":[{"id":"assertion.concept.mesh.d000069553","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Supervised Machine Learning as described in the captured NLM MeSH descriptor D000069553","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Supervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","support":[{"end":559,"quote":"A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","source_id":"nlm-mesh.d000069553","source_sha256":"5442609462d2df10fd330eaafc9cec3a8b483adb123031d28090369f95f9db3d","start":408}],"target_id":"concept.mesh.d000069553","target_kind":"node","target_sha256":"990546062150b9754b770f2410279a31fba11f646d8912a5eed46d42bd5a3f2d"}],"concept.mesh.d000069558":[{"id":"assertion.concept.mesh.d000069558","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Unsupervised Machine Learning as described in the captured NLM MeSH descriptor D000069558","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Unsupervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","support":[{"end":565,"quote":"A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","source_id":"nlm-mesh.d000069558","source_sha256":"17ade356c88b51b6643cae19dba254b6cdcc602ee033e5ae77cb6c3cda454db7","start":412}],"target_id":"concept.mesh.d000069558","target_kind":"node","target_sha256":"a54332789d05195d578d46b3ea0ced4b45add6118d3c18b4a6e822986d077222"}],"concept.mesh.d000069578":[{"id":"assertion.concept.mesh.d000069578","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Waterborne Diseases as described in the captured NLM MeSH descriptor D000069578","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Waterborne Diseases as: Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","support":[{"end":576,"quote":"Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","source_id":"nlm-mesh.d000069578","source_sha256":"f846193fd148e10111428b2876061c6bc20fb44c5aeb3f387064a5b6c716b203","start":356}],"target_id":"concept.mesh.d000069578","target_kind":"node","target_sha256":"be4cc9e448391f53e8563505c88740c9c1776b778e7d036b4cf81a8e394699f7"}],"concept.mesh.d000070100":[{"id":"assertion.concept.mesh.d000070100","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Informal Sector as described in the captured NLM MeSH descriptor D000070100","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Informal Sector as: A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations; skills acquired outside of the formal sector; and unregulated markets.","support":[{"end":565,"quote":"A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations;  skills acquired outside of the formal sector; and unregulated markets.","source_id":"nlm-mesh.d000070100","source_sha256":"4fc3bd2a6a85627e1abf588720b3ff2d4f7c45dcdbb0b2239d41f7f9c0b76ff5","start":352}],"target_id":"concept.mesh.d000070100","target_kind":"node","target_sha256":"6f0c1eccd66f569a8b867a55385dddfe243168054daded9f27e64e0dcd34bc6e"}],"concept.mesh.d000070337":[{"id":"assertion.concept.mesh.d000070337","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Expropriation as described in the captured NLM MeSH descriptor D000070337","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Expropriation as: Taking of goods, property, or right of use by GOVERNMENT or others.","support":[{"end":415,"quote":"Taking of goods, property, or right of use by\nGOVERNMENT\nor others.","source_id":"nlm-mesh.d000070337","source_sha256":"f0d894c4258648baea1ece05a1d931ec6cec9c4e59ddabdfe58280dc56e11a6d","start":348}],"target_id":"concept.mesh.d000070337","target_kind":"node","target_sha256":"9392164576b7a88a238382f20d89f1b4f8fce651f227fccba2928c69174f10e6"}],"concept.mesh.d000070586":[{"id":"assertion.concept.mesh.d000070586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fiscal Policy as described in the captured NLM MeSH descriptor D000070586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.","support":[{"end":413,"quote":"Use of government spending and taxation to influence the economy.","source_id":"nlm-mesh.d000070586","source_sha256":"8b0a8b8d3847b4b8599fb1930dbc7221e390200c858d68d3e6b7a1cf9339634e","start":348}],"target_id":"concept.mesh.d000070586","target_kind":"node","target_sha256":"450a9c7d3639a009407bc54857bfd6b2d178ca2788be854f73a1252af40a57e2"}],"concept.mesh.d000070838":[{"id":"assertion.concept.mesh.d000070838","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmacy Research as described in the captured NLM MeSH descriptor D000070838","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmacy Research as: RESEARCH activity focused on PHARMACY .","support":[{"end":608,"quote":"RESEARCH\nactivity focused on\nPHARMACY\n.","source_id":"nlm-mesh.d000070838","source_sha256":"3ebda2521dfc48a4b6f009b61a832b71e74b37d6fcc5a1493e297fd493978418","start":569}],"target_id":"concept.mesh.d000070838","target_kind":"node","target_sha256":"50b8b2f15bc6c29c0d763a1024f67431bed3c3df1bf9cb60a5079c68d37fbf3b"}],"concept.mesh.d000071220":[{"id":"assertion.concept.mesh.d000071220","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmaceutical Research as described in the captured NLM MeSH descriptor D000071220","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmaceutical Research as: RESEARCH activity focused on pharmaceutical products and services.","support":[{"end":647,"quote":"RESEARCH\nactivity focused on pharmaceutical products and services.","source_id":"nlm-mesh.d000071220","source_sha256":"f4828817f0ff71637f12ec9018a2c03331484a59d319c9111340844cd5eaceb4","start":581}],"target_id":"concept.mesh.d000071220","target_kind":"node","target_sha256":"a7652272aebcea9a048cc65da4a1bbf18691e7bc391839990919b2500b61c644"}],"concept.mesh.d000072358":[{"id":"assertion.concept.mesh.d000072358","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Work-Life Balance as described in the captured NLM MeSH descriptor D000072358","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Work-Life Balance as: Complex ongoing balance between a person's working life and private life.","support":[{"end":461,"quote":"Complex ongoing balance between a person's working life and private life.","source_id":"nlm-mesh.d000072358","source_sha256":"4b08e88ecf231aa6bcf28a920ce0675ceb777c4f6a673f51bfff005aefaff4bf","start":388}],"target_id":"concept.mesh.d000072358","target_kind":"node","target_sha256":"dfd6ab990dfe113931654fc4265f1fc3dcbed1f0ae3fee1053d6c63c65a7d20d"}],"concept.mesh.d000072577":[{"id":"assertion.concept.mesh.d000072577","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Status as described in the captured NLM MeSH descriptor D000072577","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Status as: A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","support":[{"end":501,"quote":"A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","source_id":"nlm-mesh.d000072577","source_sha256":"c729b4794a4d78088ff5475d811d308135a9d4d743a451e8a6a501d1f525f414","start":370}],"target_id":"concept.mesh.d000072577","target_kind":"node","target_sha256":"f334669d44e96ba331c1f49f266ded65d8044ce38cfb63d7760692eaccb106dc"}],"concept.mesh.d000072698":[{"id":"assertion.concept.mesh.d000072698","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Apartheid as described in the captured NLM MeSH descriptor D000072698","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Apartheid as: A former political system in SOUTH AFRICA which enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","support":[{"end":563,"quote":"A former political system in\nSOUTH AFRICA\nwhich enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","source_id":"nlm-mesh.d000072698","source_sha256":"8d2b87243c023caff883c8bdde37f1502698f03449d8098b8803ce52db21db53","start":364}],"target_id":"concept.mesh.d000072698","target_kind":"node","target_sha256":"26ca10b8892e4ade2149213da4390666c1bc3ea7cb9e38dd4da2cf1b8a10121f"}],"concept.mesh.d000073276":[{"id":"assertion.concept.mesh.d000073276","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Spatial Interaction as described in the captured NLM MeSH descriptor D000073276","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Spatial Interaction as: Estimates of the flow of people, material or information between locations in geographic space.","support":[{"end":475,"quote":"Estimates of the flow of people, material or information between locations in geographic space.","source_id":"nlm-mesh.d000073276","source_sha256":"c86c479e1fc37541c051521a49dfb70b120c48688fedb5d28f8859bf66d48c25","start":380}],"target_id":"concept.mesh.d000073276","target_kind":"node","target_sha256":"4ee96523eed8a780a55e5cd944c90269a655f525663e8cf6cb9a1bc4f7e1b61b"}],"concept.mesh.d000073456":[{"id":"assertion.concept.mesh.d000073456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multitasking Behavior as described in the captured NLM MeSH descriptor D000073456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multitasking Behavior as: Simultaneous task performance, or switching between tasks in a concentrated period of time.","support":[{"end":455,"quote":"Simultaneous task performance, or switching between tasks in a concentrated period of time.","source_id":"nlm-mesh.d000073456","source_sha256":"7cf667f64ea8f8273826347167a308fbec2293ed6f84e7d77da03eeb90a1e387","start":364}],"target_id":"concept.mesh.d000073456","target_kind":"node","target_sha256":"1b04c073ecbb3f6daa764ea827a8e01247153c57aa4615c12a7f56e98dfe0796"}],"concept.mesh.d000073597":[{"id":"assertion.concept.mesh.d000073597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stakeholder Participation as described in the captured NLM MeSH descriptor D000073597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stakeholder Participation as: A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","support":[{"end":545,"quote":"A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","source_id":"nlm-mesh.d000073597","source_sha256":"ed40f2e52cad4bae69992418e35caac13caaa22eeee9da9981cf3bba2cad41ac","start":380}],"target_id":"concept.mesh.d000073597","target_kind":"node","target_sha256":"d2553dbc57a0f0fe8b24bcad91c67ae8dbdc57ee51e223f084b18840360b23f6"}],"concept.mesh.d000073624":[{"id":"assertion.concept.mesh.d000073624","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Symbolic Interactionism as described in the captured NLM MeSH descriptor D000073624","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Symbolic Interactionism as: Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","support":[{"end":591,"quote":"Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","source_id":"nlm-mesh.d000073624","source_sha256":"1a1cbf2775d0be08b33ccf364181f64dc83a8a9c08ff3f49b03a22eddacddb96","start":384}],"target_id":"concept.mesh.d000073624","target_kind":"node","target_sha256":"f917af2610a4898f229984e4d525c9758ed3b96fe9654e3c72ecea35346faf85"}],"concept.mesh.d000073931":[{"id":"assertion.concept.mesh.d000073931","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adverse Outcome Pathways as described in the captured NLM MeSH descriptor D000073931","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adverse Outcome Pathways as: Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","support":[{"end":619,"quote":"Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","source_id":"nlm-mesh.d000073931","source_sha256":"145f5a18b6a3747a9394593f2657727f3c4b1d76fd9e3631524262f50e36c7f7","start":442}],"target_id":"concept.mesh.d000073931","target_kind":"node","target_sha256":"c3804e58cc39ea955a51ca7f3315e2dd6b34d6a6f69a40f803fd31a59ad2b97a"}],"concept.mesh.d000074439":[{"id":"assertion.concept.mesh.d000074439","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Political Activism as described in the captured NLM MeSH descriptor D000074439","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Political Activism as: Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","support":[{"end":489,"quote":"Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","source_id":"nlm-mesh.d000074439","source_sha256":"ff5a5d0f91403c7be9a1bc98c3e4b233d6e7514289655a1a5086d31ddc91925f","start":358}],"target_id":"concept.mesh.d000074439","target_kind":"node","target_sha256":"1e182a7f7e8a4a0b5927b3a1be6a23a7179f1d96d9e8c39d8dcb239237bc79fd"}],"concept.mesh.d000074440":[{"id":"assertion.concept.mesh.d000074440","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fascism as described in the captured NLM MeSH descriptor D000074440","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fascism as: Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","support":[{"end":707,"quote":"Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","source_id":"nlm-mesh.d000074440","source_sha256":"c8931b3bff40658e2fc1835afacef49f1969b8b3fc76c4b88d913129c2fa5f34","start":336}],"target_id":"concept.mesh.d000074440","target_kind":"node","target_sha256":"827267a8e544ddc8437f1b5f2af0c43a786ef913db09d9a7a107239ebf165bfd"}],"concept.mesh.d000074609":[{"id":"assertion.concept.mesh.d000074609","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Marijuana Use as described in the captured NLM MeSH descriptor D000074609","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Marijuana Use as: Medicinal or recreational utilization of MARIJUANA .","support":[{"end":412,"quote":"Medicinal or recreational utilization of\nMARIJUANA\n.","source_id":"nlm-mesh.d000074609","source_sha256":"5559364ff3643a4b9e6b5f10af376d29f168be31cc095a7f0f41fc41437dfa8a","start":360}],"target_id":"concept.mesh.d000074609","target_kind":"node","target_sha256":"9b9062e430b57eecd183010744013daeb1dbfc3612b3d1237bc203ecf7bd1abb"}],"concept.mesh.d000075066":[{"id":"assertion.concept.mesh.d000075066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Body Packing as described in the captured NLM MeSH descriptor D000075066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Body Packing as: Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of DRUG SMUGGLING or to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","support":[{"end":583,"quote":"Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of\nDRUG SMUGGLING\nor to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","source_id":"nlm-mesh.d000075066","source_sha256":"d1753218ca05e494f2e9f6c0f190821585e8ac3d34c4b1168d08dcac94d5089b","start":370}],"target_id":"concept.mesh.d000075066","target_kind":"node","target_sha256":"adc3c92787aaa3221125b74c76f24f3e08b1d53ba923f07b377ccdb540070bad"}],"concept.mesh.d000075082":[{"id":"assertion.concept.mesh.d000075082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Proof of Concept Study as described in the captured NLM MeSH descriptor D000075082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Proof of Concept Study as: An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","support":[{"end":564,"quote":"An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","source_id":"nlm-mesh.d000075082","source_sha256":"47e01926d91cc3417d811958d08ecdc4c7bed4bb25f9f4293299bdf629ec5664","start":370}],"target_id":"concept.mesh.d000075082","target_kind":"node","target_sha256":"b68adccd5ca10c0b37ddc5f6166e25eb99215c285f31a2b8a23d582365ec0683"}],"concept.mesh.d000075665":[{"id":"assertion.concept.mesh.d000075665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Recidivism as described in the captured NLM MeSH descriptor D000075665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Recidivism as: Repeated criminal behavior.","support":[{"end":389,"quote":"Repeated criminal behavior.","source_id":"nlm-mesh.d000075665","source_sha256":"6d21367113eee162ccf3a143f3faf2d8114e35bd43f35307245741226ed04c2d","start":362}],"target_id":"concept.mesh.d000075665","target_kind":"node","target_sha256":"004a8660ead21cb198abe20050b50de28ff0cfcb823da437c4a59658b1d9d0c3"}],"concept.mesh.d000075682":[{"id":"assertion.concept.mesh.d000075682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Procrastination as described in the captured NLM MeSH descriptor D000075682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Procrastination as: The deferment of actions or tasks to a later time, or to infinity.","support":[{"end":430,"quote":"The deferment of actions or tasks to a later time, or to infinity.","source_id":"nlm-mesh.d000075682","source_sha256":"f9827994a16912c4f793a4d3d08aa53a90e95a4935925fef0619a37892846710","start":364}],"target_id":"concept.mesh.d000075682","target_kind":"node","target_sha256":"5b0c219d92179fcb98b1460667b8443846abe081e9a1fb4d990d2ea03cc4288c"}],"concept.mesh.d000075762":[{"id":"assertion.concept.mesh.d000075762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Interdisciplinary Research as described in the captured NLM MeSH descriptor D000075762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Interdisciplinary Research as: Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","support":[{"end":536,"quote":"Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","source_id":"nlm-mesh.d000075762","source_sha256":"3121ef2015b2f08aaa8468f9367d7b1d2c4d3b2613a8794eac5178bedd4919d4","start":378}],"target_id":"concept.mesh.d000075762","target_kind":"node","target_sha256":"2f233af0cf135ad71ffc92a9ee4f9d4c65f11c63be3d8f952708c5a3a1ca007e"}],"concept.mesh.d000075862":[{"id":"assertion.concept.mesh.d000075862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science in the Arts as described in the captured NLM MeSH descriptor D000075862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science in the Arts as: Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","support":[{"end":550,"quote":"Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","source_id":"nlm-mesh.d000075862","source_sha256":"15c9f173fdf2cc80d02bc203b295f2932e060cd06d45ac58fccc92d1d16f97e2","start":441}],"target_id":"concept.mesh.d000075862","target_kind":"node","target_sha256":"03132e36748a31642379040e46103a69ea0647c628fb4521340d7eec05d06c7f"}],"concept.mesh.d000077272":[{"id":"assertion.concept.mesh.d000077272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Latent Class Analysis as described in the captured NLM MeSH descriptor D000077272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Latent Class Analysis as: A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","support":[{"end":839,"quote":"A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","source_id":"nlm-mesh.d000077272","source_sha256":"35192b1b5489cedce26bc9120c26e759916c27683ba7bd44c3a1d8e5914a3380","start":448}],"target_id":"concept.mesh.d000077272","target_kind":"node","target_sha256":"9ee80a43f34451a2419c159f1db3a8c2d5dbf63929032a4dded7c26af750ba25"}],"concept.mesh.d000077321":[{"id":"assertion.concept.mesh.d000077321","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Deep Learning as described in the captured NLM MeSH descriptor D000077321","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Deep Learning as: Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific ALGORITHMS , to build and train neural network models.","support":[{"end":647,"quote":"Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific\nALGORITHMS\n, to build and train neural network models.","source_id":"nlm-mesh.d000077321","source_sha256":"1671be23b74507737684056aa20b6554de9fb254fe2998140b6e4fd5d0ff4f44","start":416}],"target_id":"concept.mesh.d000077321","target_kind":"node","target_sha256":"757d3ac392c907d94c5d983b6cfceaa9ad474bf2cf1b07e4a54d569423f69944"}],"concept.mesh.d000077406":[{"id":"assertion.concept.mesh.d000077406","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Pharmacy as described in the captured NLM MeSH descriptor D000077406","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Pharmacy as: Study of the origins and development of the field of PHARMACY .","support":[{"end":423,"quote":"Study of the origins and development of the field of\nPHARMACY\n.","source_id":"nlm-mesh.d000077406","source_sha256":"6711684cd4c89a38797321e1706393bc66dde81f3920548c6f3b555db4af8a37","start":360}],"target_id":"concept.mesh.d000077406","target_kind":"node","target_sha256":"88ea81d7fe7db3edf9eb395fd59991db55e543f745a2400cae0f201042e6d617"}],"concept.mesh.d000078002":[{"id":"assertion.concept.mesh.d000078002","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Posttraumatic Growth, Psychological as described in the captured NLM MeSH descriptor D000078002","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Posttraumatic Growth, Psychological as: Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","support":[{"end":502,"quote":"Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","source_id":"nlm-mesh.d000078002","source_sha256":"04f95544488cf38f4a0cda80fe9ced200d977410da079c9dfcfaf4e1dd9374b1","start":400}],"target_id":"concept.mesh.d000078002","target_kind":"node","target_sha256":"5c4fe0c11aecf64dda252e558690f4be82117f5e36ac4510d0fba5fbeef38256"}],"concept.mesh.d000078331":[{"id":"assertion.concept.mesh.d000078331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Correlation of Data as described in the captured NLM MeSH descriptor D000078331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Correlation of Data as: Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","support":[{"end":555,"quote":"Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","source_id":"nlm-mesh.d000078331","source_sha256":"1662237e853d52f2ec8f374efd9a2f2228be4263e1a4956b6a6bfe348df5efd8","start":364}],"target_id":"concept.mesh.d000078331","target_kind":"node","target_sha256":"e0bf0a763f3b691061ed11b4ecd8719a9f698e0e4a51c100d68514b0f6d81b73"}],"concept.mesh.d000078332":[{"id":"assertion.concept.mesh.d000078332","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Data Analysis as described in the captured NLM MeSH descriptor D000078332","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Data Analysis as: Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","support":[{"end":519,"quote":"Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","source_id":"nlm-mesh.d000078332","source_sha256":"ef27978313ce68b4f2d4a076a2819c6484b523245f505acc9e574f3e511252bd","start":348}],"target_id":"concept.mesh.d000078332","target_kind":"node","target_sha256":"472a62527b65dd0cb2580f2b5724f4191a446b7e93cff0a4aae4922fd45790f1"}],"concept.mesh.d000078382":[{"id":"assertion.concept.mesh.d000078382","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disgust as described in the captured NLM MeSH descriptor D000078382","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disgust as: A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","support":[{"end":426,"quote":"A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","source_id":"nlm-mesh.d000078382","source_sha256":"b60ba126eaa375518524bb9489bcc76abdf2fa5479edca3c0b9c2cda9e0dc73a","start":336}],"target_id":"concept.mesh.d000078382","target_kind":"node","target_sha256":"06512cfe386bd36905e6d242ae98f5236a528b9cbc28435cd36c6df89e0e0a73"}],"concept.mesh.d000078625":[{"id":"assertion.concept.mesh.d000078625","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Euthanasia, Involuntary as described in the captured NLM MeSH descriptor D000078625","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Euthanasia, Involuntary as: The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially PERSONS WITH DISABILITIES , without INFORMED CONSENT , despite the MENTAL COMPETENCY of the person to give consent.","support":[{"end":691,"quote":"The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially\nPERSONS WITH DISABILITIES\n, without\nINFORMED CONSENT\n, despite the\nMENTAL COMPETENCY\nof the person to give consent.","source_id":"nlm-mesh.d000078625","source_sha256":"cd44514f6d9cf5766d1d006814e96aee6135280be9dbdac6ea86844a3d46cb0f","start":453}],"target_id":"concept.mesh.d000078625","target_kind":"node","target_sha256":"f7bcce344cbae1a4729879f84d6a6e4292df38f2e28828b0b051275e51850179"}],"concept.mesh.d000078682":[{"id":"assertion.concept.mesh.d000078682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respect as described in the captured NLM MeSH descriptor D000078682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respect as: A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","support":[{"end":503,"quote":"A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","source_id":"nlm-mesh.d000078682","source_sha256":"8442c305a3c34b152ac44b155a02a99b370f17e02e68b00bc128b2fe2269e871","start":336}],"target_id":"concept.mesh.d000078682","target_kind":"node","target_sha256":"82169399bd57b6c47367f3841ed43f4a03c6a7988eb19f8ed143274136d37883"}],"concept.mesh.d000079263":[{"id":"assertion.concept.mesh.d000079263","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vaccine-Preventable Diseases as described in the captured NLM MeSH descriptor D000079263","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vaccine-Preventable Diseases as: Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","support":[{"end":511,"quote":"Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","source_id":"nlm-mesh.d000079263","source_sha256":"8bddbd23e5f8616e79bcbd4622a5ec40bd2e78f39569ba853a82d14c522f7875","start":374}],"target_id":"concept.mesh.d000079263","target_kind":"node","target_sha256":"5483d34546f170ba39ade9b61ee9e8dcfd7658f21b96e8f35c5f8d2bed75a83d"}],"concept.mesh.d000079426":[{"id":"assertion.concept.mesh.d000079426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vector Borne Diseases as described in the captured NLM MeSH descriptor D000079426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vector Borne Diseases as: Infectious diseases transmitted by DISEASE VECTORS .","support":[{"end":464,"quote":"Infectious diseases transmitted by\nDISEASE VECTORS\n.","source_id":"nlm-mesh.d000079426","source_sha256":"f7d0a91005929408c4017aae9e6bd3ba715de331f1c370e01f5429f1f4c2134f","start":412}],"target_id":"concept.mesh.d000079426","target_kind":"node","target_sha256":"6739befb8c62707c0053e6e5c851472daef6d735b0e34bb9aa5bbe1cc77dd37b"}],"concept.mesh.d000080105":[{"id":"assertion.concept.mesh.d000080105","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Relational Autonomy as described in the captured NLM MeSH descriptor D000080105","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Relational Autonomy as: The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","support":[{"end":700,"quote":"The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","source_id":"nlm-mesh.d000080105","source_sha256":"e388b09653a3c41a6d5c83f4c1c53f75a1adfaaf5e22c2b95c0982d73fbf0f72","start":396}],"target_id":"concept.mesh.d000080105","target_kind":"node","target_sha256":"e18102081029fd35ddd78c41252a043d325c18b81156abe16eae45255ebeae25"}],"concept.mesh.d000080562":[{"id":"assertion.concept.mesh.d000080562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Universal Design as described in the captured NLM MeSH descriptor D000080562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","support":[{"end":539,"quote":"The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","source_id":"nlm-mesh.d000080562","source_sha256":"cf163b4d84d907e1a882241d6f438df42ab4e192abe103174c78100a6c0a0668","start":386}],"target_id":"concept.mesh.d000080562","target_kind":"node","target_sha256":"f066b5076c89ddfd2be673469178fc3ae56dad0c7a6862e25cfa729319cf639e"}],"concept.mesh.d000081762":[{"id":"assertion.concept.mesh.d000081762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human-Animal Interaction as described in the captured NLM MeSH descriptor D000081762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human-Animal Interaction as: Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","support":[{"end":660,"quote":"Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","source_id":"nlm-mesh.d000081762","source_sha256":"48a0b25bbc7e361a9f30e6c44f29a5d236218d544c1aea5bae6d7852c1cd4626","start":370}],"target_id":"concept.mesh.d000081762","target_kind":"node","target_sha256":"76c5f7152c5c9a0f4bfd53d774a402d486018111f0317dd109dca2078a6ab55e"}],"concept.mesh.d000082742":[{"id":"assertion.concept.mesh.d000082742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Heart Disease Risk Factors as described in the captured NLM MeSH descriptor D000082742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Heart Disease Risk Factors as: Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with HEART DISEASES .","support":[{"end":670,"quote":"Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with\nHEART DISEASES\n.","source_id":"nlm-mesh.d000082742","source_sha256":"6e40ef5646399630da87ad391d3a0f43f25822b61693278ed6cb1ae6c38cc6bc","start":502}],"target_id":"concept.mesh.d000082742","target_kind":"node","target_sha256":"d5464ebda6c98377bfad024cdf08b5d0cf3e8b8672ac85f3986e968d965711dd"}],"concept.mesh.d000083202":[{"id":"assertion.concept.mesh.d000083202","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiometabolic Risk Factors as described in the captured NLM MeSH descriptor D000083202","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiometabolic Risk Factors as: A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence, is known to be associated with CARDIOVASCULAR DISEASES and TYPE 2 DIABETES MELLITUS .","support":[{"end":782,"quote":"A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence,  is known to be associated with\nCARDIOVASCULAR DISEASES\nand\nTYPE 2 DIABETES MELLITUS\n.","source_id":"nlm-mesh.d000083202","source_sha256":"418b077d024fd2c00d765b15de843cee6d4a12d3ba999c6bb0a9c698c7065360","start":526}],"target_id":"concept.mesh.d000083202","target_kind":"node","target_sha256":"ba3cf83554e735f4fc71b75e4accd48c8e43bb617fa45916f15cab191a76fbc1"}],"concept.mesh.d000083623":[{"id":"assertion.concept.mesh.d000083623","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychosocial Functioning as described in the captured NLM MeSH descriptor D000083623","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychosocial Functioning as: Level of and variations in social and emotional activity or behaviors.","support":[{"end":480,"quote":"Level of and variations in social and emotional activity or behaviors.","source_id":"nlm-mesh.d000083623","source_sha256":"3895891430e71f42c27269e6d220bb818e9f188caff048b8c33f6a9bd4ad03a0","start":410}],"target_id":"concept.mesh.d000083623","target_kind":"node","target_sha256":"7a1fb6a642b5e7dd8502d8ec70acd17f20a28513b8a1b2dbfd322654b3ca71bc"}],"concept.mesh.d000084783":[{"id":"assertion.concept.mesh.d000084783","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Recreational Drug Use as described in the captured NLM MeSH descriptor D000084783","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Recreational Drug Use as: Occasional or habitual non-prescribed, not health-related use of substances.","support":[{"end":440,"quote":"Occasional or habitual non-prescribed, not health-related use of substances.","source_id":"nlm-mesh.d000084783","source_sha256":"0aaf8acf6e217765ed04680f18e6f182c4fa81b36ba56332626cabca787d03bb","start":364}],"target_id":"concept.mesh.d000084783","target_kind":"node","target_sha256":"d04a36a624f18c95c7a853558f632aefd8563db47b9de03964a169b22cff4867"}],"concept.mesh.d000085343":[{"id":"assertion.concept.mesh.d000085343","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Latent Infection as described in the captured NLM MeSH descriptor D000085343","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Latent Infection as: Delayed infection of the host by a dormant or inactive pathogen.","support":[{"end":414,"quote":"Delayed infection of the host by a dormant or inactive pathogen.","source_id":"nlm-mesh.d000085343","source_sha256":"54952f646b68d33a3ff4f4e777773423bf333fca2fbbce22305d562910030039","start":350}],"target_id":"concept.mesh.d000085343","target_kind":"node","target_sha256":"8cf27a9625d9a86c78dc2d436350f8f2f574eb7892ee5cd2a0e3143892b16a53"}],"concept.mesh.d000086825":[{"id":"assertion.concept.mesh.d000086825","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"User-Centered Design as described in the captured NLM MeSH descriptor D000086825","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes User-Centered Design as: Design process using input from users regarding systems, devices, or software.","support":[{"end":472,"quote":"Design process using input from users regarding systems, devices, or software.","source_id":"nlm-mesh.d000086825","source_sha256":"b465341abce0ba88bb5eab649f99e1dee98cd39c359002643cb97f82b597271a","start":394}],"target_id":"concept.mesh.d000086825","target_kind":"node","target_sha256":"7f1b134f314df95d64104889c2be766e2fe59146fe25765c4ed44a2905a0e74a"}],"concept.mesh.d000087366":[{"id":"assertion.concept.mesh.d000087366","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Information Avoidance as described in the captured NLM MeSH descriptor D000087366","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Information Avoidance as: Choosing to not obtain knowledge even if having the information could be to one's benefit.","support":[{"end":454,"quote":"Choosing to not obtain knowledge even if having the information could be to one's benefit.","source_id":"nlm-mesh.d000087366","source_sha256":"0bbec95857d183abc799e7f98852379817584774ee4e5cc1f27405abc5be8d0b","start":364}],"target_id":"concept.mesh.d000087366","target_kind":"node","target_sha256":"ece342678a16363f67c3663ee05dd1cc4260fb24a0ecb100ca394e9246595e12"}],"concept.mesh.d000087983":[{"id":"assertion.concept.mesh.d000087983","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sound Recordings as described in the captured NLM MeSH descriptor D000087983","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sound Recordings as: The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","support":[{"end":527,"quote":"The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","source_id":"nlm-mesh.d000087983","source_sha256":"8024d45db4851ad9151266896183928b2b33e526b3c186d75d6fd2d85d94243b","start":398}],"target_id":"concept.mesh.d000087983","target_kind":"node","target_sha256":"84f1c312d4f1ed8be48489c284431cf997992030b1563f0edf076d8e9ce30e56"}],"concept.mesh.d000088562":[{"id":"assertion.concept.mesh.d000088562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Persistent Infection as described in the captured NLM MeSH descriptor D000088562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Persistent Infection as: Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections. LATENT INFECTIONS are infections in which manifestation of clinical symptoms appear later.","support":[{"end":829,"quote":"Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections.\nLATENT INFECTIONS\nare infections in which manifestation of clinical symptoms appear later.","source_id":"nlm-mesh.d000088562","source_sha256":"7c56e918f68e2994a4bf2ee04c4cb7c75202730fbb590754f2a58f15971f2902","start":420}],"target_id":"concept.mesh.d000088562","target_kind":"node","target_sha256":"634fc612070273af04a439e4796e9b8f00bc7d94412a91e0888b4acf172d3568"}],"concept.mesh.d000088724":[{"id":"assertion.concept.mesh.d000088724","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environmentalism as described in the captured NLM MeSH descriptor D000088724","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environmentalism as: Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","support":[{"end":535,"quote":"Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","source_id":"nlm-mesh.d000088724","source_sha256":"b92fdff2be1560d044e881163cba176a6f21052df8addbda26df87b2d58d5da3","start":366}],"target_id":"concept.mesh.d000088724","target_kind":"node","target_sha256":"3bebb3e72dd1febde4d71ca16bbee96d53bce7373f8633e3511a5f662c6baf0e"}],"concept.mesh.d000089682":[{"id":"assertion.concept.mesh.d000089682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cellular Automata as described in the captured NLM MeSH descriptor D000089682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cellular Automata as: Space-oriented dynamic modeling ALGORITHMS acting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","support":[{"end":642,"quote":"Space-oriented dynamic modeling\nALGORITHMS\nacting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","source_id":"nlm-mesh.d000089682","source_sha256":"8b97317450cfebde73e036b3f16e3456696feea58ee4466c3a7cf494b1256dac","start":388}],"target_id":"concept.mesh.d000089682","target_kind":"node","target_sha256":"0f08f9228bd17a160ac80a83c651febc9ed6b6039311ac5a1a6ffaa1c85c1a41"}],"concept.mesh.d000090042":[{"id":"assertion.concept.mesh.d000090042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sentiment Analysis as described in the captured NLM MeSH descriptor D000090042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sentiment Analysis as: A data mining technique in which subjective information such as sentiments, OPINIONS , and attitudes are extracted and analyzed from data.","support":[{"end":564,"quote":"A data mining technique in which subjective information such as sentiments,\nOPINIONS\n, and attitudes are extracted and analyzed from data.","source_id":"nlm-mesh.d000090042","source_sha256":"a2acb551458728c12c4854de52b6d6bc6bb00762342a491bcafde7248c480dbd","start":426}],"target_id":"concept.mesh.d000090042","target_kind":"node","target_sha256":"d07406236f82b283dfd087431a2f3804398a24c02efa6c9a6be56422f5922c01"}],"concept.mesh.d000090082":[{"id":"assertion.concept.mesh.d000090082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Climate Models as described in the captured NLM MeSH descriptor D000090082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Climate Models as: Computer representations that simulate or predict the behavior or activity of WEATHER systems, processes, or phenomena.","support":[{"end":481,"quote":"Computer representations that simulate or predict the behavior or activity of\nWEATHER\nsystems, processes, or phenomena.","source_id":"nlm-mesh.d000090082","source_sha256":"49cbac78e2b022b875e94a9fe4bf2cc9de0cb6ef203e9dace94c8fd4ff58f979","start":362}],"target_id":"concept.mesh.d000090082","target_kind":"node","target_sha256":"da99c9fcd6050fcb74080de14e63e6b5ee1eaf9188f586a934b6e07186478fe7"}],"concept.mesh.d000090862":[{"id":"assertion.concept.mesh.d000090862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuroinflammatory Diseases as described in the captured NLM MeSH descriptor D000090862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuroinflammatory Diseases as: Diseases characterized by inflammation of the nervous tissue.","support":[{"end":499,"quote":"Diseases characterized by inflammation of the nervous tissue.","source_id":"nlm-mesh.d000090862","source_sha256":"46e25aff163cfb1fb3f194a8ae74e8d626d76b2fd24a6841b94e8c84674d5e7c","start":438}],"target_id":"concept.mesh.d000090862","target_kind":"node","target_sha256":"4e3b580d71e24c8f562a38f4cb713f6383e0ee0d3406afb5d6ddca1f8b56b20d"}],"concept.mesh.d000091383":[{"id":"assertion.concept.mesh.d000091383","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environmental Justice as described in the captured NLM MeSH descriptor D000091383","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environmental Justice as: The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","support":[{"end":792,"quote":"The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","source_id":"nlm-mesh.d000091383","source_sha256":"21f1503b0fc37b8aa87a516004e0f3c4ce668c0c3846be3b745db85227b8e892","start":494}],"target_id":"concept.mesh.d000091383","target_kind":"node","target_sha256":"7aa9a2f15debf2ba882a1fa6754b6c7414082e6317280540c05714efc38d80e7"}],"concept.mesh.d000091682":[{"id":"assertion.concept.mesh.d000091682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Inequities as described in the captured NLM MeSH descriptor D000091682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","support":[{"end":815,"quote":"Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","source_id":"nlm-mesh.d000091682","source_sha256":"583521896dad86a2dd2adf54ed256cb9aef6998a7e29e831bf6243246dc06e6e","start":433}],"target_id":"concept.mesh.d000091682","target_kind":"node","target_sha256":"dda00a165f1adbd303a3ce69ec9d9928cbc3956082ee9898c918f49972b70ad2"}],"concept.mesh.d000091702":[{"id":"assertion.concept.mesh.d000091702","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intersectional Framework as described in the captured NLM MeSH descriptor D000091702","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intersectional Framework as: Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","support":[{"end":651,"quote":"Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","source_id":"nlm-mesh.d000091702","source_sha256":"f4591b9f293108dd8c820ab21e7cdf104d4a9f0eed346e0ad89410d9c25f76dd","start":493}],"target_id":"concept.mesh.d000091702","target_kind":"node","target_sha256":"ab85922314a476c7fefea900aff560cc775d334d4063fd4a1e5366cae1073676"}],"concept.mesh.d000092003":[{"id":"assertion.concept.mesh.d000092003","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Artificial Life as described in the captured NLM MeSH descriptor D000092003","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Artificial Life as: Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","support":[{"end":614,"quote":"Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","source_id":"nlm-mesh.d000092003","source_sha256":"324f347010caaecfe73da683a3ac4131c8abcd5cf009e04b9bcbfd75333a7849","start":376}],"target_id":"concept.mesh.d000092003","target_kind":"node","target_sha256":"bb7ce7208103139be4f363c2a6b34a054f691c93962473e322eba013fce5d093"}],"concept.mesh.d000092822":[{"id":"assertion.concept.mesh.d000092822","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Structure as described in the captured NLM MeSH descriptor D000092822","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Structure as: Structural nature of relationships among members of a household typically in reference to a MINOR residing in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","support":[{"end":801,"quote":"Structural nature of relationships among members of a household typically in reference to a\nMINOR\nresiding in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","source_id":"nlm-mesh.d000092822","source_sha256":"be375a21a95222cdc95dd239c1d36e5876869e9ba7d188b1907c26322caddc8f","start":474}],"target_id":"concept.mesh.d000092822","target_kind":"node","target_sha256":"555d3242df9d8dedeafaece7571ca827bf7fa7bca90ccb04d40053ce14915092"}],"concept.mesh.d000092862":[{"id":"assertion.concept.mesh.d000092862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychological Well-Being as described in the captured NLM MeSH descriptor D000092862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychological Well-Being as: Condition of existence, or state of awareness, in which psychological needs are satisfied","support":[{"end":523,"quote":"Condition of existence, or state of awareness, in which psychological needs are satisfied","source_id":"nlm-mesh.d000092862","source_sha256":"c00d8f90ef1958b42094c9f09ce94e7c34a5d5060eb39afd43cad2e9924ea394","start":434}],"target_id":"concept.mesh.d000092862","target_kind":"node","target_sha256":"5778fc31856c6dd99619c853d61ead6c860165104bb1b2ecb88ec8cf9da4dfed"}],"concept.mesh.d000093742":[{"id":"assertion.concept.mesh.d000093742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Breakthrough Infections as described in the captured NLM MeSH descriptor D000093742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Breakthrough Infections as: Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","support":[{"end":506,"quote":"Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","source_id":"nlm-mesh.d000093742","source_sha256":"8bc1d9d33d104075338e511e2e8d6ddb56c6ce84132662819c3d31b6cb2ecc7b","start":380}],"target_id":"concept.mesh.d000093742","target_kind":"node","target_sha256":"da59e84d10bc80dc0608ce9d978167b9601d4d7e2b0466e713db929300d00336"}],"concept.mesh.d000094408":[{"id":"assertion.concept.mesh.d000094408","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Obesity Paradox as described in the captured NLM MeSH descriptor D000094408","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Obesity Paradox as: An observation that high BODY MASS INDEX is sometimes associated with lower CARDIOVASCULAR DISEASE mortality in certain population, e.g., ELDERLY .","support":[{"end":647,"quote":"An observation that high\nBODY MASS INDEX\nis sometimes associated with lower\nCARDIOVASCULAR DISEASE\nmortality in certain population, e.g.,\nELDERLY\n.","source_id":"nlm-mesh.d000094408","source_sha256":"7b675693736c8927b6cf9b49131180369f0f78a3f4150831d09b7530604d8227","start":500}],"target_id":"concept.mesh.d000094408","target_kind":"node","target_sha256":"64ae903fdf98d88150aec737d2701d51e82bf45ad5431540c857b6b3308d3381"}],"concept.mesh.d000094505":[{"id":"assertion.concept.mesh.d000094505","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence Gaps as described in the captured NLM MeSH descriptor D000094505","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence Gaps as: Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","support":[{"end":654,"quote":"Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","source_id":"nlm-mesh.d000094505","source_sha256":"1c8a38511819f92f57ed6fcbb11e638f41749fe31f2fe5d83a87dcd9f48c348c","start":454}],"target_id":"concept.mesh.d000094505","target_kind":"node","target_sha256":"7d6848e2970198856cb51531096e46d4ccbd53aa46e41b3816be325d74427ae2"}],"concept.mesh.d000095026":[{"id":"assertion.concept.mesh.d000095026","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Antiracism as described in the captured NLM MeSH descriptor D000095026","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Antiracism as: Beliefs, actions or intentions, and policies that oppose RACISM or discrimination based on RACE .","support":[{"end":520,"quote":"Beliefs, actions or intentions, and policies that oppose\nRACISM\nor discrimination  based on\nRACE\n.","source_id":"nlm-mesh.d000095026","source_sha256":"b59de366181e7927655d127afeec59542552a6b43d1d2055200e1c772e03e619","start":422}],"target_id":"concept.mesh.d000095026","target_kind":"node","target_sha256":"60026cfa9f8369773841a533cc80eb84f554db990c6deff304266ebce775cb2d"}],"concept.mesh.d000096264":[{"id":"assertion.concept.mesh.d000096264","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Voting as described in the captured NLM MeSH descriptor D000096264","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Voting as: Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","support":[{"end":499,"quote":"Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","source_id":"nlm-mesh.d000096264","source_sha256":"bf9c311921fc2f8b064ac7eb8b267507ae6d2c27725b6e6e683fb2122cae61b9","start":334}],"target_id":"concept.mesh.d000096264","target_kind":"node","target_sha256":"ebc0922d82eeda477fcc7d1a2d1d037847f75ee5e2ef6f93a5b61c46a4591a56"}],"concept.mesh.d000096442":[{"id":"assertion.concept.mesh.d000096442","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Risk Score as described in the captured NLM MeSH descriptor D000096442","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Risk Score as: Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","support":[{"end":745,"quote":"Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","source_id":"nlm-mesh.d000096442","source_sha256":"434e124cbf3e56b14740c2e04d0b48ffa03009870d71059058727a0b5031fcf9","start":478}],"target_id":"concept.mesh.d000096442","target_kind":"node","target_sha256":"9a846225b80e80cfb5238cf8590a258139446d3c6ed7c38f37603cf9d4ed82fd"}],"concept.mesh.d000097785":[{"id":"assertion.concept.mesh.d000097785","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Imaging as described in the captured NLM MeSH descriptor D000097785","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Imaging as: The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes FORENSIC MEDICINE platforms such as X-RAYS ; CT XRAY; and MRI.","support":[{"end":553,"quote":"The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes\nFORENSIC MEDICINE\nplatforms such as\nX-RAYS\n; CT XRAY; and MRI.","source_id":"nlm-mesh.d000097785","source_sha256":"dc9ca48d1a8544b4328b0587b6fcdc2076acae2bd4a0b55820483a9c215a6146","start":374}],"target_id":"concept.mesh.d000097785","target_kind":"node","target_sha256":"9e5c976a50c17fa8e3a03d896dacb74748dbd3d04724a1d2da7a347d36c9aadf"}],"concept.mesh.d000097812":[{"id":"assertion.concept.mesh.d000097812","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychological Growth as described in the captured NLM MeSH descriptor D000097812","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychological Growth as: A process of actively learning and adapting to new ways to function following a challenging life crisis.","support":[{"end":466,"quote":"A process of actively learning and adapting to new ways to function following a challenging life crisis.","source_id":"nlm-mesh.d000097812","source_sha256":"0388a903b541434c7e84f548ada4340f072fef5f2124f6fca4e556479fc5add9","start":362}],"target_id":"concept.mesh.d000097812","target_kind":"node","target_sha256":"26d264da0ac06d5d1fc4cc8a6e94d511d0d3100df49124e82497d52472d578cb"}],"concept.mesh.d000097813":[{"id":"assertion.concept.mesh.d000097813","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Coping Skills as described in the captured NLM MeSH descriptor D000097813","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Coping Skills as: Various techniques for actively managing a stressful event or situation.","support":[{"end":436,"quote":"Various techniques for actively managing a stressful event or situation.","source_id":"nlm-mesh.d000097813","source_sha256":"f0aa0059f76df44b670744d7d6c97929978667af0c4d4c6bb10281044a8d451d","start":364}],"target_id":"concept.mesh.d000097813","target_kind":"node","target_sha256":"95a04f3fa0fbc37a39379f60800f4db967d5abfafbab51cd86113ac09a4f8bfd"}],"concept.mesh.d000097815":[{"id":"assertion.concept.mesh.d000097815","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotional Exhaustion as described in the captured NLM MeSH descriptor D000097815","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.","support":[{"end":470,"quote":"A state of feeling emotionally overextended and drained.","source_id":"nlm-mesh.d000097815","source_sha256":"791254849ca04936978d9b48d22a9bf862330041f6b226cedcf8a64d83e5cc2f","start":414}],"target_id":"concept.mesh.d000097815","target_kind":"node","target_sha256":"c92ff66c66e105dc3c5c7668486f7b19788e0ec72c51cf8657d82e332cb694f6"}],"concept.mesh.d000097822":[{"id":"assertion.concept.mesh.d000097822","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Media Exposure as described in the captured NLM MeSH descriptor D000097822","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","support":[{"end":473,"quote":"The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","source_id":"nlm-mesh.d000097822","source_sha256":"91de9cf0c597fdbed9c8addffea32a413c83b7ebd83c5a0734310ab08d711c9f","start":386}],"target_id":"concept.mesh.d000097822","target_kind":"node","target_sha256":"fd4de71dc1461890c9e20d95a123d9b1f2f5af4f87fc6048192039f0e8239150"}],"concept.mesh.d000097824":[{"id":"assertion.concept.mesh.d000097824","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Neglect as described in the captured NLM MeSH descriptor D000097824","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Neglect as: Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is PROFESSIONAL NEGLIGENCE .","support":[{"end":594,"quote":"Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is\nPROFESSIONAL NEGLIGENCE\n.","source_id":"nlm-mesh.d000097824","source_sha256":"49cbb4aca801dc6b52e22d6bfe7c0ab978a7828157594a68baea81fbe3a48d0b","start":376}],"target_id":"concept.mesh.d000097824","target_kind":"node","target_sha256":"343a08723f9f046c2346752110c14eebcff2274f6bcbf4364b1730f8cc7f86f1"}],"concept.mesh.d000098342":[{"id":"assertion.concept.mesh.d000098342","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Large Language Models as described in the captured NLM MeSH descriptor D000098342","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Large Language Models as: Computational designs that apply DEEP LEARNING methods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","support":[{"end":609,"quote":"Computational designs that apply\nDEEP LEARNING\nmethods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","source_id":"nlm-mesh.d000098342","source_sha256":"bc7d8623d55afa278846de105d5a4f2aed2b4221096d4b9f53e58d293e81a0ca","start":460}],"target_id":"concept.mesh.d000098342","target_kind":"node","target_sha256":"75f754bd7168ffe404ace937bef3b5ff324f02c006151e95f226e95196afee7d"}],"concept.mesh.d000098402":[{"id":"assertion.concept.mesh.d000098402","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autonomous Robots as described in the captured NLM MeSH descriptor D000098402","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autonomous Robots as: Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","support":[{"end":685,"quote":"Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","source_id":"nlm-mesh.d000098402","source_sha256":"46b33d383e9b6879fde153195cbff72547b69994415323140023c08dccce142d","start":408}],"target_id":"concept.mesh.d000098402","target_kind":"node","target_sha256":"19cfe218eef56774f096566fb2aad9331231f53a928ee5c5ec3b71a8eccbb990"}],"concept.mesh.d000098403":[{"id":"assertion.concept.mesh.d000098403","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intelligent Systems as described in the captured NLM MeSH descriptor D000098403","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intelligent Systems as: Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","support":[{"end":499,"quote":"Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","source_id":"nlm-mesh.d000098403","source_sha256":"75cd3ff61d2b5df304dcd4bb6992036e9cc2335053b5bca9dd2dab380768e9fa","start":384}],"target_id":"concept.mesh.d000098403","target_kind":"node","target_sha256":"3dda01a4e59a370c78938ad29b119ed9078acf7284aa42ca437fed439d7a7016"}],"concept.mesh.d000098404":[{"id":"assertion.concept.mesh.d000098404","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Boosting Machine Learning Algorithms as described in the captured NLM MeSH descriptor D000098404","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Boosting Machine Learning Algorithms as: A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","support":[{"end":700,"quote":"A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","source_id":"nlm-mesh.d000098404","source_sha256":"1a77d1cde666b44e6fdd2f3214f640b88895b1821826d95c4d35721080f2c4a3","start":462}],"target_id":"concept.mesh.d000098404","target_kind":"node","target_sha256":"b32ab7f751b812d8c2336d47d097f651a2418cb9f2747686bd8a9123e142c101"}],"concept.mesh.d000098405":[{"id":"assertion.concept.mesh.d000098405","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Dimensionality Reduction as described in the captured NLM MeSH descriptor D000098405","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Dimensionality Reduction as: A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","support":[{"end":639,"quote":"A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","source_id":"nlm-mesh.d000098405","source_sha256":"19fe5183e0c60a42d8e34771f58895b5221d3fc9c3ee0d349c300aeb82cf950a","start":446}],"target_id":"concept.mesh.d000098405","target_kind":"node","target_sha256":"c8c7e8ce812df4a6e21fcf9d4479dafac0abe2921d91182d8c329dbd9b789d61"}],"concept.mesh.d000098406":[{"id":"assertion.concept.mesh.d000098406","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ensemble Learning as described in the captured NLM MeSH descriptor D000098406","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ensemble Learning as: A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","support":[{"end":601,"quote":"A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","source_id":"nlm-mesh.d000098406","source_sha256":"96463cae87220a8d434f9f18a6fe2139a758702b700497d6892e70cc3e5a8b40","start":388}],"target_id":"concept.mesh.d000098406","target_kind":"node","target_sha256":"cfcdc288146ee552459cb62e0f31e71157187d3addfb124a995ae2136c11a8d2"}],"concept.mesh.d000098407":[{"id":"assertion.concept.mesh.d000098407","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Federated Learning as described in the captured NLM MeSH descriptor D000098407","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Federated Learning as: A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","support":[{"end":682,"quote":"A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","source_id":"nlm-mesh.d000098407","source_sha256":"19f4f8988adad6c1e6a39c18dbfef832f5edc789b63e7d97e9c4ad6b9e861f15","start":390}],"target_id":"concept.mesh.d000098407","target_kind":"node","target_sha256":"a4cfb0eda637f231640b04cc6ada0a8932e1620a7625efbbb62988ec6edafd2a"}],"concept.mesh.d000098408":[{"id":"assertion.concept.mesh.d000098408","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reinforcement Machine Learning as described in the captured NLM MeSH descriptor D000098408","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reinforcement Machine Learning as: A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","support":[{"end":616,"quote":"A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","source_id":"nlm-mesh.d000098408","source_sha256":"a02d4b29799593aa51eb848bf2f17734fa257d6e73c204bbbb4ac58167fc7b07","start":414}],"target_id":"concept.mesh.d000098408","target_kind":"node","target_sha256":"4c38b05b4a48342a4df8bae49450fbf9d2c6f8d4733cfe2cdb6b21b182168fd8"}],"concept.mesh.d000098409":[{"id":"assertion.concept.mesh.d000098409","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Representation Machine Learning as described in the captured NLM MeSH descriptor D000098409","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Representation Machine Learning as: A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","support":[{"end":708,"quote":"A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","source_id":"nlm-mesh.d000098409","source_sha256":"747eaf3f0ca8ba244adb335f20c888e7c05f093a73ba869097730b423aae998b","start":416}],"target_id":"concept.mesh.d000098409","target_kind":"node","target_sha256":"eed086f1435b940cc449a914e764707d806b73e35a91db1fd505b37a63c2b261"}],"concept.mesh.d000098410":[{"id":"assertion.concept.mesh.d000098410","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Transfer Machine Learning as described in the captured NLM MeSH descriptor D000098410","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Transfer Machine Learning as: Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","support":[{"end":649,"quote":"Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","source_id":"nlm-mesh.d000098410","source_sha256":"e30c2f4ba6c759a77b795fdf071b6b282d0b29a3fb09ba0ec66d67b704c5b440","start":467}],"target_id":"concept.mesh.d000098410","target_kind":"node","target_sha256":"77809fd04ec9161ce4f8bebf1027af99506876013ba70c9db68c7f62a75dcc3d"}],"concept.mesh.d000098411":[{"id":"assertion.concept.mesh.d000098411","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prediction Methods, Machine as described in the captured NLM MeSH descriptor D000098411","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prediction Methods, Machine as: Methods of making prediction about a new measurement based on calculations of previous data.","support":[{"end":492,"quote":"Methods of making prediction about a new measurement based on calculations of previous data.","source_id":"nlm-mesh.d000098411","source_sha256":"b5ec69ef3e38561fdcfde845a520aa287372c1dd1c33c55aed6ef478320ceef7","start":400}],"target_id":"concept.mesh.d000098411","target_kind":"node","target_sha256":"66a35e6371bb8a6703bc157aba4e8c9c8caf79e21a6be97c8ec80d34cf56463d"}],"concept.mesh.d000098412":[{"id":"assertion.concept.mesh.d000098412","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Predictive Learning Models as described in the captured NLM MeSH descriptor D000098412","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Predictive Learning Models as: Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","support":[{"end":559,"quote":"Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","source_id":"nlm-mesh.d000098412","source_sha256":"be93db02526e2e4e5294a6d7381c851a0ebf13af7a3d5464b9e116cf09bcc97b","start":422}],"target_id":"concept.mesh.d000098412","target_kind":"node","target_sha256":"45abe7478838083f2bdb5d8a7a0585af2bc750199942cfe4fbf4eb7b4bc698c0"}],"concept.mesh.d000098413":[{"id":"assertion.concept.mesh.d000098413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Particle Swarm Optimization as described in the captured NLM MeSH descriptor D000098413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Particle Swarm Optimization as: A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","support":[{"end":673,"quote":"A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","source_id":"nlm-mesh.d000098413","source_sha256":"e25369c3b65a387e5c5a2ec10a082454176475d48f76c098bdffa686012716d7","start":428}],"target_id":"concept.mesh.d000098413","target_kind":"node","target_sha256":"d31cc2baf198345f95bd9aeb9233bf331b8c7f1ef1ca5c72c945101aea05c633"}],"concept.mesh.d000098414":[{"id":"assertion.concept.mesh.d000098414","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pattern Analysis, Machine as described in the captured NLM MeSH descriptor D000098414","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pattern Analysis, Machine as: The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","support":[{"end":642,"quote":"The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","source_id":"nlm-mesh.d000098414","source_sha256":"44c1c1cc35b9fb1fb6dfc31bffb5566eab250c9f44dcb1104fe0ad1482e033d0","start":471}],"target_id":"concept.mesh.d000098414","target_kind":"node","target_sha256":"e20390a106e6636ac5cb631315bc7259c668f13a7254403f0bebdb634022acd7"}],"concept.mesh.d000098426":[{"id":"assertion.concept.mesh.d000098426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adaptive Algorithms as described in the captured NLM MeSH descriptor D000098426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adaptive Algorithms as: Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","support":[{"end":533,"quote":"Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","source_id":"nlm-mesh.d000098426","source_sha256":"c0637bd5a7f5e3a8a3fa4e85f840f942d757fb22ffbe97959c5983f7d2434535","start":400}],"target_id":"concept.mesh.d000098426","target_kind":"node","target_sha256":"2de8ffa27a7fce12c4d9600c545c1e36a2fea8aa957d5338bd74fce3934b100e"}],"concept.mesh.d000098427":[{"id":"assertion.concept.mesh.d000098427","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Generative Adversarial Networks as described in the captured NLM MeSH descriptor D000098427","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Generative Adversarial Networks as: An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","support":[{"end":755,"quote":"An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","source_id":"nlm-mesh.d000098427","source_sha256":"92f0e5e385504d687948284784750d03ec262254d9db7486b6101a869d32d6d6","start":460}],"target_id":"concept.mesh.d000098427","target_kind":"node","target_sha256":"3148df724c4d6ec508775e285205538a34f534afdbb934acb7b5251aa28c8eb2"}],"concept.mesh.d000098428":[{"id":"assertion.concept.mesh.d000098428","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Backtracking Algorithms as described in the captured NLM MeSH descriptor D000098428","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Backtracking Algorithms as: A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","support":[{"end":560,"quote":"A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","source_id":"nlm-mesh.d000098428","source_sha256":"76aa605cc92d8d830a03c89025edcf2ed2d4db5d7436e7f7ebae8ae9af95fd7a","start":384}],"target_id":"concept.mesh.d000098428","target_kind":"node","target_sha256":"096cfca1ec8cdb6b88f33449fac8991b3ae1a245543aea84f72ec90e0cbd370c"}],"concept.mesh.d000098429":[{"id":"assertion.concept.mesh.d000098429","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Classification Algorithms as described in the captured NLM MeSH descriptor D000098429","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Classification Algorithms as: A class of algorithms that predicts into which category an observation belongs based on training data.","support":[{"end":498,"quote":"A class of algorithms that predicts into which category an observation belongs based on training data.","source_id":"nlm-mesh.d000098429","source_sha256":"828e22dd496fc50a5c6a0bb3b6e852835b3f368e6cc3424f427e088c0b336c68","start":396}],"target_id":"concept.mesh.d000098429","target_kind":"node","target_sha256":"51d7299e15098e69ec41085987b0b114104a61bb89f7d3d1e995f946cd078b86"}],"concept.mesh.d000098430":[{"id":"assertion.concept.mesh.d000098430","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Clustering Algorithms as described in the captured NLM MeSH descriptor D000098430","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Clustering Algorithms as: Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","support":[{"end":575,"quote":"Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","source_id":"nlm-mesh.d000098430","source_sha256":"901eff5fbbc775dae9e86a09564d18dd393d1bd906e35e874b3548454d7b23db","start":380}],"target_id":"concept.mesh.d000098430","target_kind":"node","target_sha256":"12f2dcca0b7a4076e91de09e31a32ecb5665da5586a6d2bee2f01e214b005c17"}],"concept.mesh.d000098431":[{"id":"assertion.concept.mesh.d000098431","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Compression Algorithms as described in the captured NLM MeSH descriptor D000098431","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Compression Algorithms as: A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","support":[{"end":533,"quote":"A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","source_id":"nlm-mesh.d000098431","source_sha256":"35f0eba00b61795902ceb06b686340b6dfe8a5dd0dc8ee71ba315ad9f933c62f","start":382}],"target_id":"concept.mesh.d000098431","target_kind":"node","target_sha256":"4722238f324dc338faf20bbcbbf88903fa68cd77b02d54f983fe3153106c9808"}],"concept.mesh.d000098432":[{"id":"assertion.concept.mesh.d000098432","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Detection Algorithms as described in the captured NLM MeSH descriptor D000098432","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Detection Algorithms as: Algorithms designed to find or localize the objects in images and assign the objects (affordances).","support":[{"end":477,"quote":"Algorithms designed to find or localize the objects in images and assign the objects (affordances).","source_id":"nlm-mesh.d000098432","source_sha256":"164750652f47ffc8594f27df73c2ca1210fb02f5daf73cbba10b7a369004a93d","start":378}],"target_id":"concept.mesh.d000098432","target_kind":"node","target_sha256":"419a77ccd6fa19d769cc8347ca471e12f5c180892bc604407734c507dd0700fa"}],"concept.mesh.d000098434":[{"id":"assertion.concept.mesh.d000098434","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Algorithms as described in the captured NLM MeSH descriptor D000098434","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Algorithms as: Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by NATURAL SELECTION . They are commonly used to generate solutions for optimization problems.","support":[{"end":635,"quote":"Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by\nNATURAL SELECTION\n. They are commonly used to generate solutions for optimization problems.","source_id":"nlm-mesh.d000098434","source_sha256":"38371f35c328927188955b1b8656298ef5a6da88e280e4cc35b00a8be4cd72d7","start":374}],"target_id":"concept.mesh.d000098434","target_kind":"node","target_sha256":"a5c07f628c48b0e17a59b2bda50d85699db8ed1e7be42275725c84ffb3ad55bc"}],"concept.mesh.d000098435":[{"id":"assertion.concept.mesh.d000098435","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Machine Learning Algorithms as described in the captured NLM MeSH descriptor D000098435","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Machine Learning Algorithms as: A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","support":[{"end":536,"quote":"A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","source_id":"nlm-mesh.d000098435","source_sha256":"6c62c82d3623c8a6a77796358ba3323f1fa38d5c14ee758de795ee93ce6b54a6","start":392}],"target_id":"concept.mesh.d000098435","target_kind":"node","target_sha256":"8d0f95c932517fc17f5938a3b0528c1547b130029c298cba75b80cfa38c783a7"}],"concept.mesh.d000098436":[{"id":"assertion.concept.mesh.d000098436","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Parallel Algorithms as described in the captured NLM MeSH descriptor D000098436","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Parallel Algorithms as: Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","support":[{"end":544,"quote":"Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","source_id":"nlm-mesh.d000098436","source_sha256":"7a86baffee0eb8c3ee4830df2fa51e2ef7ef191ec2059b085f7802524fe096bd","start":376}],"target_id":"concept.mesh.d000098436","target_kind":"node","target_sha256":"75c30470c5378bdad4027c0ea48afd73de79b9124490ba18ecf046bd0ac3651f"}],"concept.mesh.d000098437":[{"id":"assertion.concept.mesh.d000098437","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prediction Algorithms as described in the captured NLM MeSH descriptor D000098437","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prediction Algorithms as: A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","support":[{"end":541,"quote":"A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","source_id":"nlm-mesh.d000098437","source_sha256":"f5069c6f6ea328a189a91fc39107e81465e30fae82ddb2558d46ff2057619375","start":380}],"target_id":"concept.mesh.d000098437","target_kind":"node","target_sha256":"fa6a0e9a8700eeb91d6bfa757ec2af3f3d4ac9d872624ea550f326b56c1e171b"}],"concept.mesh.d000098446":[{"id":"assertion.concept.mesh.d000098446","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autoencoder as described in the captured NLM MeSH descriptor D000098446","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autoencoder as: An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images, DIMENSIONALITY REDUCTION and feature extraction.","support":[{"end":808,"quote":"An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images,\nDIMENSIONALITY REDUCTION\nand feature extraction.","source_id":"nlm-mesh.d000098446","source_sha256":"cf3921986197bc2080caf2a33d829a6220c344ba1ffb5cb9cfd85c4366cce3f7","start":508}],"target_id":"concept.mesh.d000098446","target_kind":"node","target_sha256":"ebcd77b385f650bbbee0b9c5d480bd627ffd53f5049915b2ceddb98d7b000345"}],"concept.mesh.d000098451":[{"id":"assertion.concept.mesh.d000098451","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multiple-Instance Learning Algorithms as described in the captured NLM MeSH descriptor D000098451","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multiple-Instance Learning Algorithms as: Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","support":[{"end":626,"quote":"Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","source_id":"nlm-mesh.d000098451","source_sha256":"1c3c091bf01982c45c11ba7bc4e61dddb393565ad0e8e56064ba3bd9a3887a34","start":480}],"target_id":"concept.mesh.d000098451","target_kind":"node","target_sha256":"c97bbc074560bbfec5bf1341a89b8b7ed7036c6d80966fcd5883bf60309b4ed9"}],"concept.mesh.d000098463":[{"id":"assertion.concept.mesh.d000098463","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Dilemmas as described in the captured NLM MeSH descriptor D000098463","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Dilemmas as: Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","support":[{"end":629,"quote":"Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","source_id":"nlm-mesh.d000098463","source_sha256":"b658de09ab51712d2a3e1262c83970ed81a7f5b29f410795f287bd3cb8e5a762","start":370}],"target_id":"concept.mesh.d000098463","target_kind":"node","target_sha256":"cb1634305e7700a35e9c0352356aa173185e2ae100ceb6a5d4b58b2759c5cdf5"}],"concept.mesh.d000099056":[{"id":"assertion.concept.mesh.d000099056","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Outcome Expectations as described in the captured NLM MeSH descriptor D000099056","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Outcome Expectations as: Believed or anticipated consequences of a person’s behavior.","support":[{"end":418,"quote":"Believed or anticipated consequences of a person’s behavior.","source_id":"nlm-mesh.d000099056","source_sha256":"014fd24836c415e0e99b5001626d16a4c4f91f688177fe1bfb5c7ea09ee2176c","start":358}],"target_id":"concept.mesh.d000099056","target_kind":"node","target_sha256":"8ba5e104eb99a0682260fc46b61788f2f8291fcb15ca9769984fe56ead2a5c9d"}],"concept.mesh.d000099075":[{"id":"assertion.concept.mesh.d000099075","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Politicization as described in the captured NLM MeSH descriptor D000099075","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Politicization as: Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","support":[{"end":537,"quote":"Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","source_id":"nlm-mesh.d000099075","source_sha256":"0132c19e2f6e2296dad162189f3f3e76a9f511141af36b63849d845042c7003d","start":350}],"target_id":"concept.mesh.d000099075","target_kind":"node","target_sha256":"b33c1fa318e4c1ea5508017c26c0abd8ae02756a6cdfbacabc1a74b9c399e344"}],"concept.mesh.d000184":[{"id":"assertion.concept.mesh.d000184","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Acting Out as described in the captured NLM MeSH descriptor D000184","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Acting Out as: Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","support":[{"end":443,"quote":"Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","source_id":"nlm-mesh.d000184","source_sha256":"801e695a43d73458df27317ee60ae64c5c434251287eb1635dc28cbc13e5df33","start":336}],"target_id":"concept.mesh.d000184","target_kind":"node","target_sha256":"d68b0b212e7c9128c0aa3486be4e59fb47915b17e25b13c7d438e015211119c9"}],"concept.mesh.d000223":[{"id":"assertion.concept.mesh.d000223","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adaptation, Psychological as described in the captured NLM MeSH descriptor D000223","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","support":[{"end":561,"quote":"A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","source_id":"nlm-mesh.d000223","source_sha256":"b1912950b3e990e295a6a913bdd1ee8778fc934e0c3c4c143ec5cffde529fe90","start":388}],"target_id":"concept.mesh.d000223","target_kind":"node","target_sha256":"d2099a44211886c6cd26f62c176ad92fa1b06d813eaf18bca702c7f01611274b"}],"concept.mesh.d000294":[{"id":"assertion.concept.mesh.d000294","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Behavior as described in the captured NLM MeSH descriptor D000294","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Behavior as: Any observable response or action of an adolescent.","support":[{"end":443,"quote":"Any observable response or action of an adolescent.","source_id":"nlm-mesh.d000294","source_sha256":"ae0e238ff79ab3da3ac74df40aa4579184bd7f40245246eedb0f3f9b37b5d3f1","start":392}],"target_id":"concept.mesh.d000294","target_kind":"node","target_sha256":"677e092e3ad6ea132b1014de3b06ca4332d245b770cf8d618451544527a5d4ee"}],"concept.mesh.d000339":[{"id":"assertion.concept.mesh.d000339","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Affect as described in the captured NLM MeSH descriptor D000339","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Affect as: The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","support":[{"end":558,"quote":"The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","source_id":"nlm-mesh.d000339","source_sha256":"991b1be4d0eca443e9f8026e59495f00802c17a16fe34cd46e0f34768940ae04","start":328}],"target_id":"concept.mesh.d000339","target_kind":"node","target_sha256":"98eae7742d214a6863f62537196bd25a28787906b0f6a30a62a43c02475d4803"}],"concept.mesh.d000422":[{"id":"assertion.concept.mesh.d000422","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Alchemy as described in the captured NLM MeSH descriptor D000422","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Alchemy as: Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","support":[{"end":487,"quote":"Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","source_id":"nlm-mesh.d000422","source_sha256":"f9d737dea83e8f9524fe62129604b1deb7e1b06022b20ffa60e70c2e150bb88e","start":351}],"target_id":"concept.mesh.d000422","target_kind":"node","target_sha256":"f8154957312a4358391b7ad131372b556dee1e3c213d081a94dccf7777ee87e5"}],"concept.mesh.d000716":[{"id":"assertion.concept.mesh.d000716","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anatomy, Artistic as described in the captured NLM MeSH descriptor D000716","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anatomy, Artistic as: The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","support":[{"end":625,"quote":"The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","source_id":"nlm-mesh.d000716","source_sha256":"05a3c484fccc637d6747510b9b44ecf87903ede338e1c52ef2e8704afe60f2d1","start":511}],"target_id":"concept.mesh.d000716","target_kind":"node","target_sha256":"ae590a8ed9dfe2d4f9695cb7de41129976fe8152ece63706c6b3052f68c46992"}],"concept.mesh.d000785":[{"id":"assertion.concept.mesh.d000785","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Aneurysm, Infected as described in the captured NLM MeSH descriptor D000785","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Aneurysm, Infected as: Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","support":[{"end":740,"quote":"Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","source_id":"nlm-mesh.d000785","source_sha256":"969637c6643084273c2e8c559a1732ae732ed03f5decf7dd0a158a42f42ad9b9","start":610}],"target_id":"concept.mesh.d000785","target_kind":"node","target_sha256":"37ab5b11f38a2316a86754026681be38418d86bc921319eee4c57ddc03cdca70"}],"concept.mesh.d000786":[{"id":"assertion.concept.mesh.d000786","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anger as described in the captured NLM MeSH descriptor D000786","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anger as: A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","support":[{"end":450,"quote":"A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","source_id":"nlm-mesh.d000786","source_sha256":"007d6ce4d256ae3391763e97733599a08b57625bea7f863c7d6b2023f5c1843c","start":352}],"target_id":"concept.mesh.d000786","target_kind":"node","target_sha256":"cd1248e3e2069d2ac7b174426ca112550d7d5db79cbf1a9b85656306e2a76edf"}],"concept.mesh.d000887":[{"id":"assertion.concept.mesh.d000887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anthroposophy as described in the captured NLM MeSH descriptor D000887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anthroposophy as: Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","support":[{"end":563,"quote":"Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","source_id":"nlm-mesh.d000887","source_sha256":"95bbd4e99da52692432551255ceadaa4f54ace924107434182da7d838ce0e5eb","start":354}],"target_id":"concept.mesh.d000887","target_kind":"node","target_sha256":"df80fdf594422a58aa35b028557ef43d17247f2fbfef9e8ffece315d088bd89f"}],"concept.mesh.d001007":[{"id":"assertion.concept.mesh.d001007","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anxiety as described in the captured NLM MeSH descriptor D001007","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anxiety as: Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with ANXIETY DISORDERS .","support":[{"end":533,"quote":"Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with\nANXIETY DISORDERS\n.","source_id":"nlm-mesh.d001007","source_sha256":"44a2f5cf78d999db2fee45857138e2f4b8a9e4605fef702e55d0d2b923958e9f","start":420}],"target_id":"concept.mesh.d001007","target_kind":"node","target_sha256":"aa29b37330aacc368a2a0f6c1075a4819e1a61f171d6a28261442ae8ed31397d"}],"concept.mesh.d001170":[{"id":"assertion.concept.mesh.d001170","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Arthritis, Infectious as described in the captured NLM MeSH descriptor D001170","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Arthritis, Infectious as: Arthritis caused by BACTERIA ; RICKETTSIA ; MYCOPLASMA ; VIRUSES ; FUNGI ; or PARASITES .","support":[{"end":525,"quote":"Arthritis caused by\nBACTERIA\n;\nRICKETTSIA\n;\nMYCOPLASMA\n;\nVIRUSES\n;\nFUNGI\n; or\nPARASITES\n.","source_id":"nlm-mesh.d001170","source_sha256":"1c23bca3cef58b7ace919411c4665f3a8edac577d969e1083c88227ff123e68d","start":436}],"target_id":"concept.mesh.d001170","target_kind":"node","target_sha256":"1586ae3fcbee9192b6818d083e1fa2ef7b121c70a1b023896b2029e0222eafb3"}],"concept.mesh.d001290":[{"id":"assertion.concept.mesh.d001290","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude as described in the captured NLM MeSH descriptor D001290","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude as: An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","support":[{"end":571,"quote":"An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","source_id":"nlm-mesh.d001290","source_sha256":"c03d05183621a9a54d5a8fd2be44a1c6bb039558f1ffeb8337c986f93a8ec6bc","start":328}],"target_id":"concept.mesh.d001290","target_kind":"node","target_sha256":"9737b1c3e656f5f496153185b64a7c71130da892f57615d7993cbc924d32266d"}],"concept.mesh.d001291":[{"id":"assertion.concept.mesh.d001291","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude of Health Personnel as described in the captured NLM MeSH descriptor D001291","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude of Health Personnel as: Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","support":[{"end":487,"quote":"Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","source_id":"nlm-mesh.d001291","source_sha256":"07c7e19b5b69b43fc569dee21b304add2d3d01661c391cf9403cdbc94c2db3a0","start":384}],"target_id":"concept.mesh.d001291","target_kind":"node","target_sha256":"78f3ca557a4375fb76298fa3277ac7355d9794de88ce0b4495a37357c8b69ee1"}],"concept.mesh.d001292":[{"id":"assertion.concept.mesh.d001292","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Computers as described in the captured NLM MeSH descriptor D001292","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Computers as: The attitude and behavior associated with an individual using the computer.","support":[{"end":462,"quote":"The attitude and behavior associated with an individual using the computer.","source_id":"nlm-mesh.d001292","source_sha256":"f5c2855ac7147417646aeb0c199f4de576b806ff3d0b9e25f9d4857a96294902","start":387}],"target_id":"concept.mesh.d001292","target_kind":"node","target_sha256":"193f3c0e589e6a11e228b5fb222b3f42ae97f00ef18072bbbd990fbd184a2682"}],"concept.mesh.d001293":[{"id":"assertion.concept.mesh.d001293","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Death as described in the captured NLM MeSH descriptor D001293","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Death as: Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","support":[{"end":496,"quote":"Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","source_id":"nlm-mesh.d001293","source_sha256":"6f89d3982ac8152fd5e8d05f8b1dddd65d14ed1c4dab75f7d4ff388f6de69f60","start":362}],"target_id":"concept.mesh.d001293","target_kind":"node","target_sha256":"9b16d1210cd4ab7e5c4f68271d4db0436acbe15794ed454ea6e4eb46ac1fda87"}],"concept.mesh.d001294":[{"id":"assertion.concept.mesh.d001294","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Health as described in the captured NLM MeSH descriptor D001294","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Health as: Public attitudes toward health, disease, and the medical care system.","support":[{"end":473,"quote":"Public attitudes toward health, disease, and the medical care system.","source_id":"nlm-mesh.d001294","source_sha256":"2e84140dccbeadeb0a2970c406387001568cce7e66c4aed4a59e9f7da184b0b2","start":404}],"target_id":"concept.mesh.d001294","target_kind":"node","target_sha256":"f441f2b50f36ab17da1c96ada6f71eec0331f58f7681d51b9bd4986cdc5d70ec"}],"concept.mesh.d001296":[{"id":"assertion.concept.mesh.d001296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Audiovisual Aids as described in the captured NLM MeSH descriptor D001296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Audiovisual Aids as: Auditory and visual instructional materials.","support":[{"end":464,"quote":"Auditory and visual instructional materials.","source_id":"nlm-mesh.d001296","source_sha256":"ec68bbb3a0e3ce563f145520435fa71e39bff7c622ec9d0ee5e5911b5378df79","start":420}],"target_id":"concept.mesh.d001296","target_kind":"node","target_sha256":"0ff8e06f84bb62102f20fe157eb28bdc2037124400b4a58fbee7b7f53e8d7179"}],"concept.mesh.d001331":[{"id":"assertion.concept.mesh.d001331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Automation as described in the captured NLM MeSH descriptor D001331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Automation as: Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","support":[{"end":737,"quote":"Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","source_id":"nlm-mesh.d001331","source_sha256":"647e78575aa356fde5f319196f1b622d230200aee70e2c59320a6fba8d20bbe0","start":526}],"target_id":"concept.mesh.d001331","target_kind":"node","target_sha256":"ab367afeb94a96e355b973e69ec2b996b55565eded4815247b906c48447f421c"}],"concept.mesh.d001342":[{"id":"assertion.concept.mesh.d001342","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autonomic Nervous System Diseases as described in the captured NLM MeSH descriptor D001342","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autonomic Nervous System Diseases as: Diseases of the AUTONOMIC NERVOUS SYSTEM , including sympathetic, parasympathetic, and enteric nervous systems.","support":[{"end":489,"quote":"Diseases of the\nAUTONOMIC NERVOUS SYSTEM\n, including sympathetic, parasympathetic, and enteric nervous systems.","source_id":"nlm-mesh.d001342","source_sha256":"409fb9e934ac042d302d43dbce0a7a4ba599312bceb4bec075ba5768a167d5b3","start":378}],"target_id":"concept.mesh.d001342","target_kind":"node","target_sha256":"c062328773f2a266b172b97707bb102eb1d6bafbec69e1d78934bc523541cf38"}],"concept.mesh.d001423":[{"id":"assertion.concept.mesh.d001423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bacterial Infections and Mycoses as described in the captured NLM MeSH descriptor D001423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bacterial Infections and Mycoses as: Infections caused by bacteria and fungi, general, specified, or unspecified.","support":[{"end":526,"quote":"Infections caused by bacteria and fungi, general, specified, or unspecified.","source_id":"nlm-mesh.d001423","source_sha256":"d075f7199a94cfcff2a3a5bd6b9361b9411c2ca81b5e90be95292fbd2a624d9c","start":450}],"target_id":"concept.mesh.d001423","target_kind":"node","target_sha256":"5fd0d62f40e28fc065d9ea84a7e6e47b2732ce541c05b0e40daf3352272cefa7"}],"concept.mesh.d001499":[{"id":"assertion.concept.mesh.d001499","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bayes Theorem as described in the captured NLM MeSH descriptor D001499","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bayes Theorem as: A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","support":[{"end":925,"quote":"A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","source_id":"nlm-mesh.d001499","source_sha256":"52aabdf87b3885fe25324b19a87ad9401df1f66bde631a9565a0a06c7bff3b2d","start":425}],"target_id":"concept.mesh.d001499","target_kind":"node","target_sha256":"1f5142987d7fa7a670bb560736f15d353dfedc862683bfa3f11a0f76606ee604"}],"concept.mesh.d001504":[{"id":"assertion.concept.mesh.d001504","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beauty as described in the captured NLM MeSH descriptor D001504","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beauty as: Characteristics or attributes of persons or things which elicit pleasurable feelings.","support":[{"end":437,"quote":"Characteristics or attributes of persons or things which elicit pleasurable feelings.","source_id":"nlm-mesh.d001504","source_sha256":"9619fbb4571d2cbff669e762ea2cab619a7fb04a21e167d1ea3bd76a960751dd","start":352}],"target_id":"concept.mesh.d001504","target_kind":"node","target_sha256":"e20d739efe4af6b4a65465f30cf109f6fb7d68ebcda3dbb55b4dcefb34e19c4d"}],"concept.mesh.d001519":[{"id":"assertion.concept.mesh.d001519","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior as described in the captured NLM MeSH descriptor D001519","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior as: The observable response of a man or animal to a situation.","support":[{"end":486,"quote":"The observable response of a man or animal to a situation.","source_id":"nlm-mesh.d001519","source_sha256":"544fb0f573467216cef709527a053bc77a5dccf5aefdb7f6025bedac2762a54a","start":428}],"target_id":"concept.mesh.d001519","target_kind":"node","target_sha256":"887ae33110b5c9c9de59c0948530af348dc211219cb64c4cf6b7d5cdf3129ca4"}],"concept.mesh.d001520":[{"id":"assertion.concept.mesh.d001520","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior and Behavior Mechanisms as described in the captured NLM MeSH descriptor D001520","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior and Behavior Mechanisms as: The observable response made to a situation and the unconscious processes underlying it.","support":[{"end":534,"quote":"The observable response made to a situation and the unconscious processes underlying it.","source_id":"nlm-mesh.d001520","source_sha256":"e0576f1ccd90651d5a77d510de066266fb02a5b8949ae2c8b6d4f11987b4e803","start":446}],"target_id":"concept.mesh.d001520","target_kind":"node","target_sha256":"30a082b23122a38c2ed9045613f5642d6111fabe1891096130f762828640fa39"}],"concept.mesh.d001522":[{"id":"assertion.concept.mesh.d001522","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior, Animal as described in the captured NLM MeSH descriptor D001522","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior, Animal as: The observable response an animal makes to any situation.","support":[{"end":405,"quote":"The observable response an animal makes to any situation.","source_id":"nlm-mesh.d001522","source_sha256":"0656670da4122498130fe710e59ba78fd298a2701db45b43d6b7fee92584bd79","start":348}],"target_id":"concept.mesh.d001522","target_kind":"node","target_sha256":"0bd3044817ec69dab1b752b035463ddb8ae0c52ad64709dfbba660cba14b66e3"}],"concept.mesh.d001523":[{"id":"assertion.concept.mesh.d001523","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mental Disorders as described in the captured NLM MeSH descriptor D001523","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mental Disorders as: Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","support":[{"end":548,"quote":"Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","source_id":"nlm-mesh.d001523","source_sha256":"14284364e15f31787965dc2d09571dfe5777319b374993c3f4d101efb057b675","start":340}],"target_id":"concept.mesh.d001523","target_kind":"node","target_sha256":"3ab4582ea0549f0619f8bb2ec9d3647b897b8471b8485aec2cf16df5f0cf4be9"}],"concept.mesh.d001526":[{"id":"assertion.concept.mesh.d001526","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Symptoms as described in the captured NLM MeSH descriptor D001526","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Symptoms as: Observable manifestations of impaired psychological functioning.","support":[{"end":500,"quote":"Observable manifestations of impaired psychological functioning.","source_id":"nlm-mesh.d001526","source_sha256":"648255fab4f81dc4366ff2abaca5cc3ed8429d105e7988cec78b8958ce3ebc7d","start":436}],"target_id":"concept.mesh.d001526","target_kind":"node","target_sha256":"a995d1c5c8403c739deed2a3d93b1fcc99079fea0d4f079caf7d82c3b09d4a4a"}],"concept.mesh.d001601":[{"id":"assertion.concept.mesh.d001601","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bereavement as described in the captured NLM MeSH descriptor D001601","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bereavement as: Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","support":[{"end":473,"quote":"Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","source_id":"nlm-mesh.d001601","source_sha256":"f182fba35d7fb3d8dd0d4784cf73224309f68b49b7bb9aeb4d12646623d5d2f3","start":364}],"target_id":"concept.mesh.d001601","target_kind":"node","target_sha256":"c8d3616f33fd7eecda31ee14a0806bd593427bf6de721ffce67ab514513ac911"}],"concept.mesh.d001633":[{"id":"assertion.concept.mesh.d001633","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bible as described in the captured NLM MeSH descriptor D001633","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bible as: The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","support":[{"end":613,"quote":"The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","source_id":"nlm-mesh.d001633","source_sha256":"c367097da4131a74e650f4c2d69c07a049ddb4200f82badcfba5709d8605d30b","start":490}],"target_id":"concept.mesh.d001633","target_kind":"node","target_sha256":"5290cafc17727e4e5879fc506bcf39fa8c03c69c059475b3d120873ab336fa8a"}],"concept.mesh.d001698":[{"id":"assertion.concept.mesh.d001698","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Engineering as described in the captured NLM MeSH descriptor D001698","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.","support":[{"end":470,"quote":"Application of principles and practices of engineering science to biomedical research and health care.","source_id":"nlm-mesh.d001698","source_sha256":"b79db4463bd9192894ad85b3f37c816de172b7d70dc8e021962dcc1e4f64dccf","start":368}],"target_id":"concept.mesh.d001698","target_kind":"node","target_sha256":"55085ebf11bd7fc16b31e58b00b27ed0cf00dbb9c0f1ba7fd80a5ff89ee50182"}],"concept.mesh.d001721":[{"id":"assertion.concept.mesh.d001721","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Birth Intervals as described in the captured NLM MeSH descriptor D001721","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Birth Intervals as: The lengths of intervals between births to women in the population.","support":[{"end":506,"quote":"The lengths of intervals between births to women in the population.","source_id":"nlm-mesh.d001721","source_sha256":"cdca6e1e49f49f931506fcbdc3bc609a0b8a25ccaf5b8879c5f05cbd795c07fd","start":439}],"target_id":"concept.mesh.d001721","target_kind":"node","target_sha256":"e9ebb9b92308aa832da476927e4fc5242ea199855f2b20c8907dc3867234324e"}],"concept.mesh.d001722":[{"id":"assertion.concept.mesh.d001722","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Birth Order as described in the captured NLM MeSH descriptor D001722","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Birth Order as: The sequence in which children are born into the family.","support":[{"end":468,"quote":"The sequence in which children are born into the family.","source_id":"nlm-mesh.d001722","source_sha256":"14082088dcdf3dc7beffa0135a9956c006102d542fbb0310ea65bd738b3acac9","start":412}],"target_id":"concept.mesh.d001722","target_kind":"node","target_sha256":"3af86b33dad8c4bba59090c3c9a82a644147fe40149f5009b5085ed73f6e827a"}],"concept.mesh.d001850":[{"id":"assertion.concept.mesh.d001850","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bone Diseases, Infectious as described in the captured NLM MeSH descriptor D001850","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bone Diseases, Infectious as: Bone diseases caused by pathogenic microorganisms.","support":[{"end":539,"quote":"Bone diseases caused by pathogenic microorganisms.","source_id":"nlm-mesh.d001850","source_sha256":"8e4af238b2783d60d139c310d58dcc3a1912716d5f4b12be1e00cf52a7ea900e","start":489}],"target_id":"concept.mesh.d001850","target_kind":"node","target_sha256":"e1f8f5ab65186ffda4487de6e9fcc4cff27224d4eb42672312459d11f7bf1d1d"}],"concept.mesh.d001878":[{"id":"assertion.concept.mesh.d001878","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Books, Illustrated as described in the captured NLM MeSH descriptor D001878","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Books, Illustrated as: Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","support":[{"end":813,"quote":"Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","source_id":"nlm-mesh.d001878","source_sha256":"59ec76233d2f9aa27163694b37318ce7ac1374f1de874117ac1a8b6dea90dcdd","start":533}],"target_id":"concept.mesh.d001878","target_kind":"node","target_sha256":"feb9fee2084cca0876671478756e6a6009999669b8720be278599a50c2ab2c66"}],"concept.mesh.d001887":[{"id":"assertion.concept.mesh.d001887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Boredom as described in the captured NLM MeSH descriptor D001887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Boredom as: A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","support":[{"end":462,"quote":"A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","source_id":"nlm-mesh.d001887","source_sha256":"33ddce1190efda10b901b657e4c4a8b8c1026c946c47fe43a45e742157e59b43","start":330}],"target_id":"concept.mesh.d001887","target_kind":"node","target_sha256":"5519a915edd194e948ccdd6fbe87b50f90f3981d29b1cb799f88fe6eed7e2ba0"}],"concept.mesh.d001982":[{"id":"assertion.concept.mesh.d001982","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bronchial Diseases as described in the captured NLM MeSH descriptor D001982","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bronchial Diseases as: Diseases involving the BRONCHI .","support":[{"end":425,"quote":"Diseases involving the\nBRONCHI\n.","source_id":"nlm-mesh.d001982","source_sha256":"63065524d6b5e9e76b7ab8ea943a19f67cad46c46bdcfa3c543ec5cf148f1c4f","start":393}],"target_id":"concept.mesh.d001982","target_kind":"node","target_sha256":"19b28cba22bb246cf9366c46c40bb3236a0a20c257a81776718e673fdbae8110"}],"concept.mesh.d002016":[{"id":"assertion.concept.mesh.d002016","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Buddhism as described in the captured NLM MeSH descriptor D002016","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Buddhism as: The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","support":[{"end":566,"quote":"The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","source_id":"nlm-mesh.d002016","source_sha256":"8724d2ddec952752e95946b1cb39d8bd33729ce7a06a83a570275d09504257d9","start":373}],"target_id":"concept.mesh.d002016","target_kind":"node","target_sha256":"c4ecb3286a83e5940660149d38f34e49f8201f30d431cefac3c87a56a4366522"}],"concept.mesh.d002318":[{"id":"assertion.concept.mesh.d002318","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Diseases as described in the captured NLM MeSH descriptor D002318","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Diseases as: Pathological conditions involving the CARDIOVASCULAR SYSTEM including the HEART ; the BLOOD VESSELS ; or the PERICARDIUM .","support":[{"end":513,"quote":"Pathological conditions involving the\nCARDIOVASCULAR SYSTEM\nincluding the\nHEART\n; the\nBLOOD VESSELS\n; or the\nPERICARDIUM\n.","source_id":"nlm-mesh.d002318","source_sha256":"7ecc7ed239acc6cf854a7bbf545ec974cceefa1f35803b374694a5c59176568b","start":391}],"target_id":"concept.mesh.d002318","target_kind":"node","target_sha256":"35cf2b36cabc1c3a7c0e987dfa397e4cd21dafba8a1f1da735d21f78a969a0c8"}],"concept.mesh.d002410":[{"id":"assertion.concept.mesh.d002410","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catholicism as described in the captured NLM MeSH descriptor D002410","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catholicism as: The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","support":[{"end":774,"quote":"The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","source_id":"nlm-mesh.d002410","source_sha256":"a290383b07edd1b2d92b6394506353c56c92a090431e292a372a7e95a5ddca64","start":383}],"target_id":"concept.mesh.d002410","target_kind":"node","target_sha256":"0cea2f509c9486a4e268eac663921410396b3d75bcb2759a07e3326202d770fe"}],"concept.mesh.d002493":[{"id":"assertion.concept.mesh.d002493","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Central Nervous System Diseases as described in the captured NLM MeSH descriptor D002493","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Central Nervous System Diseases as: Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","support":[{"end":563,"quote":"Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","source_id":"nlm-mesh.d002493","source_sha256":"9c5c7b8eaff8ad49e96335c0f08fae1a61565208b081cb02b58656c9f0cc91b9","start":426}],"target_id":"concept.mesh.d002493","target_kind":"node","target_sha256":"877cd8781d75a83bd1bfb71e921bbf2db54e02cad69c7540280ff85813a21896"}],"concept.mesh.d002494":[{"id":"assertion.concept.mesh.d002494","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Central Nervous System Infections as described in the captured NLM MeSH descriptor D002494","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Central Nervous System Infections as: Pathogenic infections of the brain, spinal cord, and meninges. DNA VIRUS INFECTIONS ; RNA VIRUS INFECTIONS ; BACTERIAL INFECTIONS ; MYCOPLASMA INFECTIONS ; SPIROCHAETALES INFECTIONS ; fungal infections; PROTOZOAN INFECTIONS ; HELMINTHIASIS ; and PRION DISEASES may involve the central nervous system as a primary or secondary process.","support":[{"end":833,"quote":"Pathogenic infections of the brain, spinal cord, and meninges.\nDNA VIRUS INFECTIONS\n;\nRNA VIRUS INFECTIONS\n;\nBACTERIAL INFECTIONS\n;\nMYCOPLASMA INFECTIONS\n;\nSPIROCHAETALES INFECTIONS\n; fungal infections;\nPROTOZOAN INFECTIONS\n;\nHELMINTHIASIS\n; and\nPRION DISEASES\nmay involve the central nervous system as a primary or secondary process.","source_id":"nlm-mesh.d002494","source_sha256":"7e949be890be708ad49412db0fbc9756e68a125835a86e66f472d59f3302e0ca","start":499}],"target_id":"concept.mesh.d002494","target_kind":"node","target_sha256":"78b58377a6910c4c726c58d32f5e9859b8bb3d833cad8d07e95a4ba273017890"}],"concept.mesh.d002616":[{"id":"assertion.concept.mesh.d002616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chemical Engineering as described in the captured NLM MeSH descriptor D002616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chemical Engineering as: Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","support":[{"end":503,"quote":"Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","source_id":"nlm-mesh.d002616","source_sha256":"837adb7b8b71c9aedc69bde943b92b7506df6307be269381512461137938acc6","start":356}],"target_id":"concept.mesh.d002616","target_kind":"node","target_sha256":"6bc9bc5e8a90b141d0e8ed7ebf4c874fd45cfc0a4abc16cb9f207f369f3b6ca3"}],"concept.mesh.d002652":[{"id":"assertion.concept.mesh.d002652","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Behavior as described in the captured NLM MeSH descriptor D002652","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Behavior as: Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months, INFANT BEHAVIOR is available.","support":[{"end":586,"quote":"Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months,\nINFANT BEHAVIOR\nis available.","source_id":"nlm-mesh.d002652","source_sha256":"3c6214f3f91a3dc43bf73c51d66ccf7389d22314ae9d7a480602c30e78b773e6","start":423}],"target_id":"concept.mesh.d002652","target_kind":"node","target_sha256":"96624e6ce86a3366c58e7f5dd21428fa55d10f6efc1c175739d5d6ebe95274a3"}],"concept.mesh.d002668":[{"id":"assertion.concept.mesh.d002668","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Rearing as described in the captured NLM MeSH descriptor D002668","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Rearing as: The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from PARENTING in that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","support":[{"end":1013,"quote":"The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from\nPARENTING\nin that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","source_id":"nlm-mesh.d002668","source_sha256":"64a4682c63da89f868e36924b592f7ac87295dfaf99812d24ff202128d77129c","start":547}],"target_id":"concept.mesh.d002668","target_kind":"node","target_sha256":"629f4d0ce0539c6924b99a95c35bfc0857fa6368e6e4284a820b99a8ef7106f3"}],"concept.mesh.d002835":[{"id":"assertion.concept.mesh.d002835","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Christianity as described in the captured NLM MeSH descriptor D002835","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Christianity as: The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","support":[{"end":693,"quote":"The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","source_id":"nlm-mesh.d002835","source_sha256":"e4af20e63d0ec8574492179f93565fa70f1abbab0c499dd04bc0c6d701a29a03","start":377}],"target_id":"concept.mesh.d002835","target_kind":"node","target_sha256":"6216dbdef975a2628261904a15d5baa6be12bc3ed0b458dde3673778d2a2bbea"}],"concept.mesh.d002925":[{"id":"assertion.concept.mesh.d002925","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ciliary Motility Disorders as described in the captured NLM MeSH descriptor D002925","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ciliary Motility Disorders as: Conditions caused by abnormal CILIA movement in the body, usually causing KARTAGENER SYNDROME , chronic respiratory disorders, chronic SINUSITIS , and chronic OTITIS . Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme DYNEIN arms.","support":[{"end":708,"quote":"Conditions caused by abnormal\nCILIA\nmovement in the body, usually causing\nKARTAGENER SYNDROME\n, chronic respiratory disorders, chronic\nSINUSITIS\n, and chronic\nOTITIS\n. Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme\nDYNEIN\narms.","source_id":"nlm-mesh.d002925","source_sha256":"dddbb15948c8c55caa3b7fb24a22c64c728fbf9d83853bb0ddffc3b176fff289","start":408}],"target_id":"concept.mesh.d002925","target_kind":"node","target_sha256":"85dc4abfb956c9091b9f9da80145a90032e19d0e2e5ae063ac53d94a44e6aa30"}],"concept.mesh.d002959":[{"id":"assertion.concept.mesh.d002959","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Civil Defense as described in the captured NLM MeSH descriptor D002959","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Civil Defense as: Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","support":[{"end":480,"quote":"Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","source_id":"nlm-mesh.d002959","source_sha256":"542c664b18b99971e932f499dc330d0de559dd29bebc1740b021a0ed1d204ea0","start":342}],"target_id":"concept.mesh.d002959","target_kind":"node","target_sha256":"bc234dbb99fcd0950aff0af48d5df5a879ad93d485eeb7c4acbc5adf024b689e"}],"concept.mesh.d003141":[{"id":"assertion.concept.mesh.d003141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communicable Diseases as described in the captured NLM MeSH descriptor D003141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communicable Diseases as: An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","support":[{"end":700,"quote":"An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","source_id":"nlm-mesh.d003141","source_sha256":"76a508571cfc08932ca3a3ce423061ecc35bcd871e89c0ae7f4a05b18dbfbe6c","start":429}],"target_id":"concept.mesh.d003141","target_kind":"node","target_sha256":"954326a39c26ce502d70f5216a1a336d120597be1b23e352e9f3df359a3ff82b"}],"concept.mesh.d003142":[{"id":"assertion.concept.mesh.d003142","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communication as described in the captured NLM MeSH descriptor D003142","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communication as: The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","support":[{"end":540,"quote":"The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","source_id":"nlm-mesh.d003142","source_sha256":"f6373041d39b8c566d938645b0a4908f7007ca9cbe8dde4df595880d1b5102d4","start":449}],"target_id":"concept.mesh.d003142","target_kind":"node","target_sha256":"5772c6d8171986138b6d880d93685d29b234aab161029928676bf9f794b12868"}],"concept.mesh.d003148":[{"id":"assertion.concept.mesh.d003148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communism as described in the captured NLM MeSH descriptor D003148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communism as: A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","support":[{"end":545,"quote":"A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","source_id":"nlm-mesh.d003148","source_sha256":"10c4c924408afcd5868d69bfe47faf70c4f785af3e557cd6cafe69b83d1f12f0","start":371}],"target_id":"concept.mesh.d003148","target_kind":"node","target_sha256":"af17c40a9397e31a4afbc5eb02064e49be02fbdcb7a9ed2b5a0c1752a1cc3208"}],"concept.mesh.d003242":[{"id":"assertion.concept.mesh.d003242","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Conscience as described in the captured NLM MeSH descriptor D003242","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Conscience as: The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","support":[{"end":477,"quote":"The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","source_id":"nlm-mesh.d003242","source_sha256":"0fdcf80f208b18bab58b04a3ea73f6baff414a3f76cc57a6c32863ebc1dcc5ae","start":356}],"target_id":"concept.mesh.d003242","target_kind":"node","target_sha256":"3998ea277987748d49d486463705fecd555f80d5dcd19e83e2278a4dfe4b4a53"}],"concept.mesh.d003258":[{"id":"assertion.concept.mesh.d003258","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Consumer Behavior as described in the captured NLM MeSH descriptor D003258","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Consumer Behavior as: Behavior associated with the procurement of goods, services, or experiences.","support":[{"end":426,"quote":"Behavior associated with the procurement of goods, services, or experiences.","source_id":"nlm-mesh.d003258","source_sha256":"e0027f1349b8a6b9fb702cd05eb0af57df79e5cdf2b437d6c2a171c0f7c80300","start":350}],"target_id":"concept.mesh.d003258","target_kind":"node","target_sha256":"52b775db3db9bf9d2eb503f58a5395a5af4e69399dac11edce0bcc3dcdbf26f7"}],"concept.mesh.d003389":[{"id":"assertion.concept.mesh.d003389","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cranial Nerve Diseases as described in the captured NLM MeSH descriptor D003389","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cranial Nerve Diseases as: Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","support":[{"end":619,"quote":"Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","source_id":"nlm-mesh.d003389","source_sha256":"ecf622bb39a90934fd3523f40fc42a9679bf70867523df4d4833a550c15d077b","start":408}],"target_id":"concept.mesh.d003389","target_kind":"node","target_sha256":"64374b8a7a039a9c069815a3ede5b60f4293f3b892ba4470f7a284728bd5d7d9"}],"concept.mesh.d003415":[{"id":"assertion.concept.mesh.d003415","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Crime as described in the captured NLM MeSH descriptor D003415","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Crime as: A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","support":[{"end":670,"quote":"A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","source_id":"nlm-mesh.d003415","source_sha256":"d27780cd2fa0236579f290aeea67bbd1654dfd681f106407c082d67c2cd884cf","start":379}],"target_id":"concept.mesh.d003415","target_kind":"node","target_sha256":"711fa8f693a3923f7fb208354ebc81503e2c9555e2a4741bb41739accfe0c211"}],"concept.mesh.d003428":[{"id":"assertion.concept.mesh.d003428","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cross Infection as described in the captured NLM MeSH descriptor D003428","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cross Infection as: Any infection which a patient contracts in a health-care institution.","support":[{"end":584,"quote":"Any infection which a patient contracts in a health-care institution.","source_id":"nlm-mesh.d003428","source_sha256":"86a984d77d89418fa96f3a9aca2002869678c237134ff69ce5bed4ff1d19c3cc","start":515}],"target_id":"concept.mesh.d003428","target_kind":"node","target_sha256":"95241079e6230b10c62ae007962b27ae6ba567e3a664c3f876ba07e1d21fd06a"}],"concept.mesh.d003560":[{"id":"assertion.concept.mesh.d003560","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cysts as described in the captured NLM MeSH descriptor D003560","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cysts as: Any fluid-filled closed cavity or sac that is lined by an EPITHELIUM . Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","support":[{"end":740,"quote":"Any fluid-filled closed cavity or sac that is lined by an\nEPITHELIUM\n. Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","source_id":"nlm-mesh.d003560","source_sha256":"6c8bacd985142003079d509b110662dc65249659a57fec41eb5b590fd06bef4b","start":597}],"target_id":"concept.mesh.d003560","target_kind":"node","target_sha256":"4c70fbe7d3b2fa3bef04585cc9427f4467893dfa5da430151e7d15c0a8d8ba6b"}],"concept.mesh.d003617":[{"id":"assertion.concept.mesh.d003617","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Dangerous Behavior as described in the captured NLM MeSH descriptor D003617","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Dangerous Behavior as: Actions which have a high risk of being harmful or injurious to oneself or others.","support":[{"end":472,"quote":"Actions which have a high risk of being harmful or injurious to oneself or others.","source_id":"nlm-mesh.d003617","source_sha256":"018b39e80dab5bf7fec26836dce398fcb3aaf01d3b9fd762318db11087c8a0f1","start":390}],"target_id":"concept.mesh.d003617","target_kind":"node","target_sha256":"51f6b4362d2da41e7c533b6aca796a430687e0011fe71852612376c3c80a8814"}],"concept.mesh.d003674":[{"id":"assertion.concept.mesh.d003674","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Defense Mechanisms as described in the captured NLM MeSH descriptor D003674","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Defense Mechanisms as: Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","support":[{"end":588,"quote":"Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","source_id":"nlm-mesh.d003674","source_sha256":"b03086833c1e403872108acee7c1627724beb1e29aec21a1dbf3c6c6149a5874","start":348}],"target_id":"concept.mesh.d003674","target_kind":"node","target_sha256":"506ded95e3b939714351ad57ebf3f14fbdf4e11188c7d599032d1434fe7e8cca"}],"concept.mesh.d003709":[{"id":"assertion.concept.mesh.d003709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Democracy as described in the captured NLM MeSH descriptor D003709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Democracy as: A system of government in which there is free and equal participation by the people in the political decision-making process.","support":[{"end":459,"quote":"A system of government in which there is free and equal participation by the people in the political decision-making process.","source_id":"nlm-mesh.d003709","source_sha256":"a35ceea3c2147f8a63e1f532f501f43e8b33fd80fdb3e60b7f4b9efc9d679c5b","start":334}],"target_id":"concept.mesh.d003709","target_kind":"node","target_sha256":"e639f8f19777f7d80c4c98b18380c503561f4bed750dc1cacd248a6fe77cc02f"}],"concept.mesh.d003711":[{"id":"assertion.concept.mesh.d003711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Demyelinating Diseases as described in the captured NLM MeSH descriptor D003711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Demyelinating Diseases as: Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","support":[{"end":456,"quote":"Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","source_id":"nlm-mesh.d003711","source_sha256":"2c0621b58ee88bd2ffd6a44dbdc174065fb98ac0e487ee9581017f0ba36e4d24","start":356}],"target_id":"concept.mesh.d003711","target_kind":"node","target_sha256":"59f1d30c4114df15c0b6f5892003328b1c9cbcae047c1e3298d0d04e118bf2b4"}],"concept.mesh.d003717":[{"id":"assertion.concept.mesh.d003717","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Denial, Psychological as described in the captured NLM MeSH descriptor D003717","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Denial, Psychological as: Refusal to admit the truth or reality of a situation or experience.","support":[{"end":425,"quote":"Refusal to admit the truth or reality of a situation or experience.","source_id":"nlm-mesh.d003717","source_sha256":"60483197c1c535651376589e7c5cbd85cdae100d8195c8cfda0da3eb7a5457e1","start":358}],"target_id":"concept.mesh.d003717","target_kind":"node","target_sha256":"041428ecfec50d66731891c8f5032c923972851f1691d660b71dc677b0801378"}],"concept.mesh.d003863":[{"id":"assertion.concept.mesh.d003863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Depression as described in the captured NLM MeSH descriptor D003863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Depression as: Depressive states usually of moderate intensity in contrast with MAJOR DEPRESSIVE DISORDER present in neurotic and psychotic disorders.","support":[{"end":754,"quote":"Depressive states usually of moderate intensity in contrast with\nMAJOR DEPRESSIVE DISORDER\npresent in neurotic and psychotic disorders.","source_id":"nlm-mesh.d003863","source_sha256":"30d388d994482e457a204dcda800b954fa367912ad8d4f9359f95cc8db2b3f49","start":619}],"target_id":"concept.mesh.d003863","target_kind":"node","target_sha256":"28c1df9377ea709db8f98dd5a7aef83429359657b9d29674cec5fba3dc36c2fd"}],"concept.mesh.d003906":[{"id":"assertion.concept.mesh.d003906","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Developing Countries as described in the captured NLM MeSH descriptor D003906","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","support":[{"end":754,"quote":"Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","source_id":"nlm-mesh.d003906","source_sha256":"f13a2cbd72d582e179f05fff4e73713a10caf209fa6d7b5888319488cab31919","start":458}],"target_id":"concept.mesh.d003906","target_kind":"node","target_sha256":"260b1dbcda3b82ac2bc4f066e9f4362243467cf7b0e0d9124486891febbc81dd"}],"concept.mesh.d004066":[{"id":"assertion.concept.mesh.d004066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Digestive System Diseases as described in the captured NLM MeSH descriptor D004066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Digestive System Diseases as: Diseases in any part of the GASTROINTESTINAL TRACT or the accessory organs ( LIVER ; BILIARY TRACT ; PANCREAS ).","support":[{"end":675,"quote":"Diseases in any part of the\nGASTROINTESTINAL TRACT\nor the accessory organs (\nLIVER\n;\nBILIARY TRACT\n;\nPANCREAS\n).","source_id":"nlm-mesh.d004066","source_sha256":"a102ead7a519ef18a744b4f56ba67642e1b57748c476fd35c7e0789d1e2602ea","start":563}],"target_id":"concept.mesh.d004066","target_kind":"node","target_sha256":"0b63151fafd37a3a6bf110bb0453baabb1c666c740d1da03811eed593fc97995"}],"concept.mesh.d004208":[{"id":"assertion.concept.mesh.d004208","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Displacement, Psychological as described in the captured NLM MeSH descriptor D004208","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Displacement, Psychological as: The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","support":[{"end":524,"quote":"The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","source_id":"nlm-mesh.d004208","source_sha256":"5a8962260b48161fa8522fe9b5e7a2f74065fe9ec39a7c99a27bdac5ad733628","start":370}],"target_id":"concept.mesh.d004208","target_kind":"node","target_sha256":"6cfc7b1741009e0d5ead24da583d5fe0f74a6db857dbf8c08d9b5bb270566f1c"}],"concept.mesh.d004311":[{"id":"assertion.concept.mesh.d004311","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Double-Blind Method as described in the captured NLM MeSH descriptor D004311","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Double-Blind Method as: A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","support":[{"end":770,"quote":"A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","source_id":"nlm-mesh.d004311","source_sha256":"a9ad6cc2c0d0d5aec77a38a7011dc86ff780af1680b3472626470b070fbec1c2","start":615}],"target_id":"concept.mesh.d004311","target_kind":"node","target_sha256":"356cf4d0bc5a44cf41a8a8c16f96f5ffda7592e786fedfad25cbb58e009f6c7e"}],"concept.mesh.d004324":[{"id":"assertion.concept.mesh.d004324","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drama as described in the captured NLM MeSH descriptor D004324","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drama as: A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":690,"quote":"A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d004324","source_sha256":"bc88d24d4456813b5b08aaa023efabfbbfe4e64c1e8a29126828ba33ea767d67","start":449}],"target_id":"concept.mesh.d004324","target_kind":"node","target_sha256":"150e3321d9b47b34d99a4ab762b6b7ff2915114a6e488c5f66bac682c4d4b606"}],"concept.mesh.d004327":[{"id":"assertion.concept.mesh.d004327","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drinking Behavior as described in the captured NLM MeSH descriptor D004327","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drinking Behavior as: Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","support":[{"end":632,"quote":"Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","source_id":"nlm-mesh.d004327","source_sha256":"c7ed0f0fafb43f33b04323973e93eb58fd2766347810fa23f4c7d3b98f76425e","start":464}],"target_id":"concept.mesh.d004327","target_kind":"node","target_sha256":"b12e2c166a74d960a3ad7927e938fb092468bc7344592dd4020c8ca0aa67927c"}],"concept.mesh.d004644":[{"id":"assertion.concept.mesh.d004644","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotions as described in the captured NLM MeSH descriptor D004644","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotions as: Those affective states which can be experienced and have arousing and motivational properties.","support":[{"end":448,"quote":"Those affective states which can be experienced and have arousing and motivational properties.","source_id":"nlm-mesh.d004644","source_sha256":"1a3e4945f2c0d64f7355ec35b1d0c5a20e8fe5f7770d0cc1de8cd4368d3f0d66","start":354}],"target_id":"concept.mesh.d004644","target_kind":"node","target_sha256":"8f52358a6120d4f8103595f4c11468093a969f989cb5f84fb1d9331823cfdcce"}],"concept.mesh.d004700":[{"id":"assertion.concept.mesh.d004700","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Endocrine System Diseases as described in the captured NLM MeSH descriptor D004700","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Endocrine System Diseases as: Pathological processes of the ENDOCRINE GLANDS , and diseases resulting from abnormal level of available HORMONES .","support":[{"end":590,"quote":"Pathological processes of the\nENDOCRINE GLANDS\n, and diseases resulting from abnormal level of available\nHORMONES\n.","source_id":"nlm-mesh.d004700","source_sha256":"9e82732719fb06ecd3d0c6edbcd8b4c658ba9e9e722285bb0feee0baafa3b19a","start":475}],"target_id":"concept.mesh.d004700","target_kind":"node","target_sha256":"1abcf8c7fb14eed1776deaa3fad2c67f091874a9cf412a86a0b486d3c3f83f4e"}],"concept.mesh.d004738":[{"id":"assertion.concept.mesh.d004738","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Engineering as described in the captured NLM MeSH descriptor D004738","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Engineering as: The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","support":[{"end":432,"quote":"The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","source_id":"nlm-mesh.d004738","source_sha256":"1db0201164722ca34fbfcca6e6da8987ed61734bf5a21ec67c6c1302ac7ed99a","start":334}],"target_id":"concept.mesh.d004738","target_kind":"node","target_sha256":"f7997f85548f6a9b89d1347c7bb2b6d3e543f1b8fb92e8ae9f0abeb6b2c4bb22"}],"concept.mesh.d004779":[{"id":"assertion.concept.mesh.d004779","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environment Design as described in the captured NLM MeSH descriptor D004779","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environment Design as: The structuring of the environment to permit or promote specific patterns of behavior.","support":[{"end":462,"quote":"The structuring of the environment to permit or promote specific patterns of behavior.","source_id":"nlm-mesh.d004779","source_sha256":"a0eddb1639a34e9f63b47be7f4252baed1733bf966ee1283e763330fb17ddeae","start":376}],"target_id":"concept.mesh.d004779","target_kind":"node","target_sha256":"d937ddd6f64bb67e515b3d98362443c74bea7534f61b8b2083c131032b10e546"}],"concept.mesh.d004924":[{"id":"assertion.concept.mesh.d004924","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Escape Reaction as described in the captured NLM MeSH descriptor D004924","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Escape Reaction as: Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","support":[{"end":583,"quote":"Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","source_id":"nlm-mesh.d004924","source_sha256":"5388749d5e09211d24ef440122b6cdecfd1e6d6b511f33c25f53cbd0fc34bb5f","start":460}],"target_id":"concept.mesh.d004924","target_kind":"node","target_sha256":"d0b89303b2bd66053c06a703de4b55b50d088804b334209ac54698deb0b4977a"}],"concept.mesh.d005086":[{"id":"assertion.concept.mesh.d005086","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Existentialism as described in the captured NLM MeSH descriptor D005086","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Existentialism as: Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","support":[{"end":792,"quote":"Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","source_id":"nlm-mesh.d005086","source_sha256":"3f239e52de9e3071a821ebf2a82896e345fd8e3b2184f7fd3aa37ff8d33586d3","start":356}],"target_id":"concept.mesh.d005086","target_kind":"node","target_sha256":"57bbbbc248562937357b643fbea1b2f24f140ae00fb583ef918c7fc94870aaf8"}],"concept.mesh.d005106":[{"id":"assertion.concept.mesh.d005106","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Exploratory Behavior as described in the captured NLM MeSH descriptor D005106","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Exploratory Behavior as: The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","support":[{"end":527,"quote":"The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","source_id":"nlm-mesh.d005106","source_sha256":"2887ab4c887eae2c07d3169fa6635ccca484505353608da18e132dca10c030b4","start":394}],"target_id":"concept.mesh.d005106","target_kind":"node","target_sha256":"9bfd81544f8fec776fe8bbd3c28c6bf5053f8c177631fd5f45f83146353eeb9b"}],"concept.mesh.d005201":[{"id":"assertion.concept.mesh.d005201","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fantasy as described in the captured NLM MeSH descriptor D005201","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fantasy as: An imagined sequence of events or mental images, e.g., daydreams.","support":[{"end":415,"quote":"An imagined sequence of events or mental images, e.g., daydreams.","source_id":"nlm-mesh.d005201","source_sha256":"f3544b72b39c6e62eba3e9f87574299270d2eba27f4eea3d67749e32eb74de42","start":350}],"target_id":"concept.mesh.d005201","target_kind":"node","target_sha256":"21c00a4443a9739d1d497bec2f331bf0b41c5b8939520c93202802b4817b19fc"}],"concept.mesh.d005247":[{"id":"assertion.concept.mesh.d005247","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feeding Behavior as described in the captured NLM MeSH descriptor D005247","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feeding Behavior as: Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","support":[{"end":773,"quote":"Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","source_id":"nlm-mesh.d005247","source_sha256":"e2bce8a047b89d57fab4a04931f308e730977c601855e01feeace1fa5c0d21b4","start":640}],"target_id":"concept.mesh.d005247","target_kind":"node","target_sha256":"1305c8a7ffcc67a3ef9205b412b89266cb43228a97ea7c7d29c7eb31730dd8af"}],"concept.mesh.d005490":[{"id":"assertion.concept.mesh.d005490","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Focal Infection as described in the captured NLM MeSH descriptor D005490","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Focal Infection as: An infection at a specific location that may spread to another region of the body.","support":[{"end":532,"quote":"An infection at a specific location that may spread to another region of the body.","source_id":"nlm-mesh.d005490","source_sha256":"b47be12109914a5a7e1028e662d77c88b66c9538e6a00be7645ec8154bffa133","start":450}],"target_id":"concept.mesh.d005490","target_kind":"node","target_sha256":"57b5c610d2665c09c2ddce6af32e3c6d8e3aa66b5c065417e4bb42a31156247d"}],"concept.mesh.d005495":[{"id":"assertion.concept.mesh.d005495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Folklore as described in the captured NLM MeSH descriptor D005495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Folklore as: The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","support":[{"end":465,"quote":"The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","source_id":"nlm-mesh.d005495","source_sha256":"c5d07c9d061ebb7c599db41ccd89e5658517323f7c522afcd5df52b118fe9f51","start":352}],"target_id":"concept.mesh.d005495","target_kind":"node","target_sha256":"c9f3df1a276a80ba6059dbdce16c1a7c5db6936842673344e300dd073af841af"}],"concept.mesh.d005544":[{"id":"assertion.concept.mesh.d005544","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forecasting as described in the captured NLM MeSH descriptor D005544","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forecasting as: The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","support":[{"end":694,"quote":"The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","source_id":"nlm-mesh.d005544","source_sha256":"ed66672bfe690c2b4020763c8fb37c1735c599c5032cf36b396483d5e4a50686","start":486}],"target_id":"concept.mesh.d005544","target_kind":"node","target_sha256":"f6b02387f71b34173299dac4f60b5be505a8944bbd22a6a6022464aae298bda2"}],"concept.mesh.d005553":[{"id":"assertion.concept.mesh.d005553","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Dentistry as described in the captured NLM MeSH descriptor D005553","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Dentistry as: The application of dental knowledge to questions of law.","support":[{"end":556,"quote":"The application of dental knowledge to questions of law.","source_id":"nlm-mesh.d005553","source_sha256":"8f5c28d560310e230940c71ceaba042ad4f3e758fb42cb9e6a8fdccf06f6e04f","start":500}],"target_id":"concept.mesh.d005553","target_kind":"node","target_sha256":"f6348359abba6f596f96de24d1d5502af281cbb88cf09f0085deda86d6fe65ce"}],"concept.mesh.d005607":[{"id":"assertion.concept.mesh.d005607","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fraud as described in the captured NLM MeSH descriptor D005607","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fraud as: Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","support":[{"end":564,"quote":"Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","source_id":"nlm-mesh.d005607","source_sha256":"9d3a504bc9fa63b8d5fa9766ea957a69212da25d59f37fd55af704ebb2426958","start":464}],"target_id":"concept.mesh.d005607","target_kind":"node","target_sha256":"1c1b7f253fa50f98c969b743e611b6853cf4b774cafa1f729f63b07b1e98be94"}],"concept.mesh.d005789":[{"id":"assertion.concept.mesh.d005789","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genealogy and Heraldry as described in the captured NLM MeSH descriptor D005789","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genealogy and Heraldry as: Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","support":[{"end":551,"quote":"Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","source_id":"nlm-mesh.d005789","source_sha256":"a10c98f50e3518301e452b4b480a3b225dabac3cce4dfd44e95f9473f795ebc0","start":422}],"target_id":"concept.mesh.d005789","target_kind":"node","target_sha256":"eafacef7545a54ab1571411deecf0b61331fc429986a1f66317a05629de3d9b5"}],"concept.mesh.d005891":[{"id":"assertion.concept.mesh.d005891","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Gingivitis as described in the captured NLM MeSH descriptor D005891","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Gingivitis as: Inflammation of gum tissue ( GINGIVA ) without loss of connective tissue.","support":[{"end":425,"quote":"Inflammation of gum tissue (\nGINGIVA\n) without loss of connective tissue.","source_id":"nlm-mesh.d005891","source_sha256":"275e734aab2b8fdf03815ecc999215af383136687223d0dbc67b7520685529dd","start":352}],"target_id":"concept.mesh.d005891","target_kind":"node","target_sha256":"38e6cf100d485d92e31df8045f83be7ae9be8fc78909aab8693f48a31b07bbb6"}],"concept.mesh.d006076":[{"id":"assertion.concept.mesh.d006076","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government as described in the captured NLM MeSH descriptor D006076","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government as: The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","support":[{"end":521,"quote":"The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","source_id":"nlm-mesh.d006076","source_sha256":"6cd9de2cb4e90d2fd431bb985141dd4f3acf4ec464eec72a85bf5f4067c0a869","start":380}],"target_id":"concept.mesh.d006076","target_kind":"node","target_sha256":"9e4f1f19a82bc41945d1af6baad45b9efe2baf2ff04fdce54bb670a56d2612be"}],"concept.mesh.d006077":[{"id":"assertion.concept.mesh.d006077","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government Agencies as described in the captured NLM MeSH descriptor D006077","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government Agencies as: Administrative units of government responsible for policy making and management of governmental activities.","support":[{"end":570,"quote":"Administrative units of government responsible for policy making and management of governmental activities.","source_id":"nlm-mesh.d006077","source_sha256":"ae57ed06ebfc7ad9b2f86e483aa560a6a8799c05be42a47e4d532cc50122253e","start":463}],"target_id":"concept.mesh.d006077","target_kind":"node","target_sha256":"89192da8431d0f5b1d2439d1bc6cff371c6ecadc17dd2005435678d06fb25ec4"}],"concept.mesh.d006078":[{"id":"assertion.concept.mesh.d006078","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government Programs as described in the captured NLM MeSH descriptor D006078","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government Programs as: Programs and activities sponsored or administered by local, state, or national governments.","support":[{"end":558,"quote":"Programs and activities sponsored or administered by local, state, or national governments.","source_id":"nlm-mesh.d006078","source_sha256":"94c73e658bbebae8788c054fefd2eb33b8d59a28e728b115244ea0df128889e1","start":467}],"target_id":"concept.mesh.d006078","target_kind":"node","target_sha256":"13fa748b29e0abb16d58af98a2f83e9d30230ac7130bd0ea79131bafcd0813eb"}],"concept.mesh.d006184":[{"id":"assertion.concept.mesh.d006184","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Habits as described in the captured NLM MeSH descriptor D006184","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Habits as: Acquired or learned responses which are regularly manifested.","support":[{"end":536,"quote":"Acquired or learned responses which are regularly manifested.","source_id":"nlm-mesh.d006184","source_sha256":"d7d7ae2c60449de331faf7e4efa93751d75e12d04aa74125a577e841f2d17828","start":475}],"target_id":"concept.mesh.d006184","target_kind":"node","target_sha256":"a17b387b0b1e9fd892178e967914a3c1aa87b5064c3fc52c7b48bc1787d1e121"}],"concept.mesh.d006222":[{"id":"assertion.concept.mesh.d006222","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hamartoma as described in the captured NLM MeSH descriptor D006222","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hamartoma as: A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","support":[{"end":544,"quote":"A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","source_id":"nlm-mesh.d006222","source_sha256":"80295cc5bf6c31589903f32302dbf46ac8e0b53a14b0af546da2b7f6bbe0d203","start":405}],"target_id":"concept.mesh.d006222","target_kind":"node","target_sha256":"b3e5473af1d7943037a936160b5ef6aa5160001dc26b66d4a2984066199d181c"}],"concept.mesh.d006302":[{"id":"assertion.concept.mesh.d006302","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Services Research as described in the captured NLM MeSH descriptor D006302","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Services Research as: The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","support":[{"end":794,"quote":"The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","source_id":"nlm-mesh.d006302","source_sha256":"7ed2b7661cb614af8e3c662663c378ae92713182408bd6798b74e61bc3113d60","start":392}],"target_id":"concept.mesh.d006302","target_kind":"node","target_sha256":"59622b1e9f0fef50adbb440f874d5f97259a020645e77a214aa0fe21f18e39c6"}],"concept.mesh.d006304":[{"id":"assertion.concept.mesh.d006304","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Status as described in the captured NLM MeSH descriptor D006304","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","support":[{"end":507,"quote":"The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","source_id":"nlm-mesh.d006304","source_sha256":"8b83df928e2399496d2aef3b441acc58862722544ec937c7b3403f31dc552fe3","start":374}],"target_id":"concept.mesh.d006304","target_kind":"node","target_sha256":"8d9deac234c0d56553429433673cfc34ab76e5c99edec907bf177e5fed7175d3"}],"concept.mesh.d006331":[{"id":"assertion.concept.mesh.d006331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Heart Diseases as described in the captured NLM MeSH descriptor D006331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Heart Diseases as: Pathological conditions involving the HEART including its structural and functional abnormalities.","support":[{"end":438,"quote":"Pathological conditions involving the\nHEART\nincluding its structural and functional abnormalities.","source_id":"nlm-mesh.d006331","source_sha256":"81cffe3a2a7f19f9a26003bd90dda2ca6b30324f6fdca08638965d09a6bb662c","start":340}],"target_id":"concept.mesh.d006331","target_kind":"node","target_sha256":"43b71e25caf2d899a142bd1ce2bd7f663b94ba007c068ab1969f53cea37b4cd3"}],"concept.mesh.d006380":[{"id":"assertion.concept.mesh.d006380","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Helplessness, Learned as described in the captured NLM MeSH descriptor D006380","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Helplessness, Learned as: Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","support":[{"end":827,"quote":"Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","source_id":"nlm-mesh.d006380","source_sha256":"eaed75f11eecf0f64244b10c652cfc93a6f9edf66abdfced85cf9f7d9a86a5d6","start":374}],"target_id":"concept.mesh.d006380","target_kind":"node","target_sha256":"f9b961ebad6e249da1b17042375b7fe234861af9bb7914c7aa90a4e310765b8f"}],"concept.mesh.d006425":[{"id":"assertion.concept.mesh.d006425","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hemic and Lymphatic Diseases as described in the captured NLM MeSH descriptor D006425","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hemic and Lymphatic Diseases as: Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g., ERYTHROCYTE AGGREGATION, INTRAVASCULAR ) and chemical components (e.g., BLOOD PROTEIN DISORDERS ); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","support":[{"end":764,"quote":"Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g.,\nERYTHROCYTE AGGREGATION, INTRAVASCULAR\n) and chemical components (e.g.,\nBLOOD PROTEIN DISORDERS\n); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","source_id":"nlm-mesh.d006425","source_sha256":"ce31f048f2a1e0ba43f8cadce90f2f1b3e09826184d3caaffba1781d921068f5","start":438}],"target_id":"concept.mesh.d006425","target_kind":"node","target_sha256":"b3ed3da8900118426f1ef4cab15eced42ecac5ff44f8288d9c53d6118a8136e2"}],"concept.mesh.d006520":[{"id":"assertion.concept.mesh.d006520","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hepatitis, Animal as described in the captured NLM MeSH descriptor D006520","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hepatitis, Animal as: INFLAMMATION of the LIVER in non-human animals.","support":[{"end":755,"quote":"INFLAMMATION\nof the\nLIVER\nin non-human animals.","source_id":"nlm-mesh.d006520","source_sha256":"bd4e034db8ad656a05928e406bacce571e22bbaf8feaad4e90350c501fc21503","start":708}],"target_id":"concept.mesh.d006520","target_kind":"node","target_sha256":"820d7280f0da2c71a460890e162b9eeea47ebe6e9d35765d5c00275d005b5283"}],"concept.mesh.d006665":[{"id":"assertion.concept.mesh.d006665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Dentistry as described in the captured NLM MeSH descriptor D006665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Dentistry as: Study of past events and development in the field of DENTISTRY .","support":[{"end":526,"quote":"Study of past events and development in the field of\nDENTISTRY\n.","source_id":"nlm-mesh.d006665","source_sha256":"9383aa3e5f7384d5a40e75154f4921def7b29c4ec3e36848d2f37e76d2ca503e","start":462}],"target_id":"concept.mesh.d006665","target_kind":"node","target_sha256":"b8a609da6d22ba750955602d49c8de3cde130e76c8cc110ba5890886030df40d"}],"concept.mesh.d006676":[{"id":"assertion.concept.mesh.d006676","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Nursing as described in the captured NLM MeSH descriptor D006676","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Nursing as: Study of past events and development in the field of Nursing.","support":[{"end":517,"quote":"Study of past events and development in the field of Nursing.","source_id":"nlm-mesh.d006676","source_sha256":"8206b5587b80824d325d9551271156642f32985345a7c4de126ef26d75402eba","start":456}],"target_id":"concept.mesh.d006676","target_kind":"node","target_sha256":"253b8a95e0d34c2cc92f52fbf4e3eed1650e1a8fbeebe29713ac51266b3f5094"}],"concept.mesh.d006694":[{"id":"assertion.concept.mesh.d006694","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Holistic Health as described in the captured NLM MeSH descriptor D006694","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Holistic Health as: Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","support":[{"end":578,"quote":"Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","source_id":"nlm-mesh.d006694","source_sha256":"75731c80471f548c2e128b7825dfe3969e02214e9565938fea8f87aca3893b5f","start":445}],"target_id":"concept.mesh.d006694","target_kind":"node","target_sha256":"b457e2c3227f3c586d52a82af49ac68365cd167ba88a8b1657fe30b24ef2112a"}],"concept.mesh.d006708":[{"id":"assertion.concept.mesh.d006708","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Homicide as described in the captured NLM MeSH descriptor D006708","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Homicide as: The killing of one person by another.","support":[{"end":389,"quote":"The killing of one person by another.","source_id":"nlm-mesh.d006708","source_sha256":"567a210540373efdff1f0b8bd1f4d6bf07decab9e0bb0236cdc49ba4b9451335","start":352}],"target_id":"concept.mesh.d006708","target_kind":"node","target_sha256":"c385d4f91271d3b1d0736f618d67efcae581ea3d42808d872ddc7cb058bf7757"}],"concept.mesh.d006803":[{"id":"assertion.concept.mesh.d006803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Development as described in the captured NLM MeSH descriptor D006803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","support":[{"end":487,"quote":"Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","source_id":"nlm-mesh.d006803","source_sha256":"504440dbd5ae7f6c0367d11cf791ae0cad5d8738692397ba4b01a339ffd79d91","start":358}],"target_id":"concept.mesh.d006803","target_kind":"node","target_sha256":"b7f8f9a519750126dd8fecc4585e694f7238e72a710480b0aab6454caa5421f1"}],"concept.mesh.d006805":[{"id":"assertion.concept.mesh.d006805","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Experimentation as described in the captured NLM MeSH descriptor D006805","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Experimentation as: The use of humans as investigational subjects.","support":[{"end":629,"quote":"The use of humans as investigational subjects.","source_id":"nlm-mesh.d006805","source_sha256":"68a148cae6999294f9b8321532f5a364fd65a7ba000f781e9e323707aa22c2c6","start":583}],"target_id":"concept.mesh.d006805","target_kind":"node","target_sha256":"2d22f2854873e7805b47afa253c4659c697a246c1adfe73ece18edfe257411c4"}],"concept.mesh.d006808":[{"id":"assertion.concept.mesh.d006808","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humanism as described in the captured NLM MeSH descriptor D006808","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","support":[{"end":503,"quote":"An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","source_id":"nlm-mesh.d006808","source_sha256":"39a29c5af7ec4e9b18d34cc9a3c5cbc3e3355fc7c0115772f1557b1bc59721f1","start":352}],"target_id":"concept.mesh.d006808","target_kind":"node","target_sha256":"f204673a68c274f12e1c2f1d3d2a388dbbead2d14cfe5d99be2fe5ec3f3bf1fd"}],"concept.mesh.d006809":[{"id":"assertion.concept.mesh.d006809","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humanities as described in the captured NLM MeSH descriptor D006809","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humanities as: Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","support":[{"end":507,"quote":"Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","source_id":"nlm-mesh.d006809","source_sha256":"02303a53c628a48ef2a871e3907014588494760810dd68d43086c1b4e11bded9","start":328}],"target_id":"concept.mesh.d006809","target_kind":"node","target_sha256":"80f5880a2052bc47c428d6ad98657a4aa071eb0486285f7039c63b2f7d16c2d9"}],"concept.mesh.d007062":[{"id":"assertion.concept.mesh.d007062","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Identification, Psychological as described in the captured NLM MeSH descriptor D007062","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Identification, Psychological as: A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","support":[{"end":661,"quote":"A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","source_id":"nlm-mesh.d007062","source_sha256":"4b79983c699d946e848ac83ff92e24b5369a4a7f9d7e8064a0304e5b9bc6658d","start":390}],"target_id":"concept.mesh.d007062","target_kind":"node","target_sha256":"57508d135d5290e59d696c2fa709dd168fb01a081cb2991a38f2e8b4fd6f507c"}],"concept.mesh.d007100":[{"id":"assertion.concept.mesh.d007100","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Imitative Behavior as described in the captured NLM MeSH descriptor D007100","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Imitative Behavior as: The mimicking of the behavior of one individual by another.","support":[{"end":437,"quote":"The mimicking of the behavior of one individual by another.","source_id":"nlm-mesh.d007100","source_sha256":"c0158db6f86b92ed053a028fb147827d77654c073a5ee9627316a3e578458d39","start":378}],"target_id":"concept.mesh.d007100","target_kind":"node","target_sha256":"9c0824216af1e2247b23d5e57592ed47a7bc2f87fa394651c7f8a6b018c75ea7"}],"concept.mesh.d007154":[{"id":"assertion.concept.mesh.d007154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immune System Diseases as described in the captured NLM MeSH descriptor D007154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immune System Diseases as: Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","support":[{"end":507,"quote":"Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","source_id":"nlm-mesh.d007154","source_sha256":"17a73af538219010e9fe75c643eb080ab7f2033a401d2e7043f7e798e2da2fbf","start":404}],"target_id":"concept.mesh.d007154","target_kind":"node","target_sha256":"1452ac5884bc4922a29825a31e6b576991a7fbca8163eaf0369af48a45aa1359"}],"concept.mesh.d007175":[{"id":"assertion.concept.mesh.d007175","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Impulsive Behavior as described in the captured NLM MeSH descriptor D007175","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Impulsive Behavior as: An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","support":[{"end":461,"quote":"An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","source_id":"nlm-mesh.d007175","source_sha256":"70a242392e9e220902b3194dfa8e9243f8deba50da1d2144fabbbdf45d7dd0b4","start":352}],"target_id":"concept.mesh.d007175","target_kind":"node","target_sha256":"7614e1aa0c82d853a3da2370362ea87ce756b16523dd2c36546a9c04e9c908e2"}],"concept.mesh.d007239":[{"id":"assertion.concept.mesh.d007239","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Infections as described in the captured NLM MeSH descriptor D007239","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Infections as: Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","support":[{"end":548,"quote":"Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","source_id":"nlm-mesh.d007239","source_sha256":"a95e76ebdec17a887a796768a0bc7b6c6ef46a7f17f815e26fc74f440e021ff1","start":417}],"target_id":"concept.mesh.d007239","target_kind":"node","target_sha256":"404287bbb20407ce8761d898f2ae32361b1fc8d882157f0152958fc951acc29b"}],"concept.mesh.d007266":[{"id":"assertion.concept.mesh.d007266","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Inhibition, Psychological as described in the captured NLM MeSH descriptor D007266","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Inhibition, Psychological as: The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","support":[{"end":622,"quote":"The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","source_id":"nlm-mesh.d007266","source_sha256":"dc0fa92cb3cad944056dbb7ec28ecd8d7a19ed6a3c0aa271710470d3e813793d","start":424}],"target_id":"concept.mesh.d007266","target_kind":"node","target_sha256":"0bb914d9b622ba1ef8bb500b7b8f2408ab14427f391c9830922009304baca0ba"}],"concept.mesh.d007391":[{"id":"assertion.concept.mesh.d007391","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"International Cooperation as described in the captured NLM MeSH descriptor D007391","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes International Cooperation as: The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","support":[{"end":635,"quote":"The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","source_id":"nlm-mesh.d007391","source_sha256":"924f625e66585ed9871615c483f1b9202ca7122085edf2a7e69344d18899b36e","start":514}],"target_id":"concept.mesh.d007391","target_kind":"node","target_sha256":"2d1a096c9502afd9a18d05718c991070fbff36829a0fcea5d98c344ebe4504ce"}],"concept.mesh.d007514":[{"id":"assertion.concept.mesh.d007514","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Islam as described in the captured NLM MeSH descriptor D007514","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Islam as: A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","support":[{"end":462,"quote":"A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","source_id":"nlm-mesh.d007514","source_sha256":"3e9e23992347a96c1bbd5ff717f1c3242531249d7644c8b0d0e6215845694dcc","start":378}],"target_id":"concept.mesh.d007514","target_kind":"node","target_sha256":"e4fdef3ea84af9360bbfb7e191a8240cf1a961001588236f531c4c6d93927693"}],"concept.mesh.d007599":[{"id":"assertion.concept.mesh.d007599","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Judaism as described in the captured NLM MeSH descriptor D007599","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Judaism as: The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","support":[{"end":502,"quote":"The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","source_id":"nlm-mesh.d007599","source_sha256":"4230870030e7c05e21eb25c62c73b812490670399ce6d93b3bceb6743cccd1f8","start":408}],"target_id":"concept.mesh.d007599","target_kind":"node","target_sha256":"ddb14d282c4bd3197645fe9b0f607f6cf9cff7ffd6986824fc68863ed669f444"}],"concept.mesh.d007757":[{"id":"assertion.concept.mesh.d007757","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laboratory Infection as described in the captured NLM MeSH descriptor D007757","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laboratory Infection as: Accidentally acquired infection in laboratory workers.","support":[{"end":528,"quote":"Accidentally acquired infection in laboratory workers.","source_id":"nlm-mesh.d007757","source_sha256":"99bd9301eb6c4de3b191a00f09be71ff6737d4424c108d47b9794f9fdfed43bf","start":474}],"target_id":"concept.mesh.d007757","target_kind":"node","target_sha256":"8525b320f5f5da683ec99a3c88bf2e19a16e0cc10993a743bf0bd4ad0cea6e95"}],"concept.mesh.d007818":[{"id":"assertion.concept.mesh.d007818","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laryngeal Diseases as described in the captured NLM MeSH descriptor D007818","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laryngeal Diseases as: Pathological processes involving any part of the LARYNX which coordinates many functions such as voice production, breathing, swallowing, and coughing.","support":[{"end":552,"quote":"Pathological processes involving any part of the\nLARYNX\nwhich coordinates many functions such as voice production, breathing, swallowing, and coughing.","source_id":"nlm-mesh.d007818","source_sha256":"05194e351732ef20f18cfe204d6c47be9c84ec245e055acf3546250d4f176581","start":401}],"target_id":"concept.mesh.d007818","target_kind":"node","target_sha256":"e08ca59d9fb7dc788513085c0ea8577b111eb77729e56788c164a71e7e3624fb"}],"concept.mesh.d008119":[{"id":"assertion.concept.mesh.d008119","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Lobbying as described in the captured NLM MeSH descriptor D008119","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Lobbying as: A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","support":[{"end":505,"quote":"A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","source_id":"nlm-mesh.d008119","source_sha256":"196a4e8a3768700d2dc017c2a9a55329fb627ee40d30ae8e765a8e1a41a076f7","start":332}],"target_id":"concept.mesh.d008119","target_kind":"node","target_sha256":"7ca92a3f560aeaeff4f49ccda1643614c8b54d6107e0b4ad02272f533ec9b1e2"}],"concept.mesh.d008171":[{"id":"assertion.concept.mesh.d008171","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Lung Diseases as described in the captured NLM MeSH descriptor D008171","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Lung Diseases as: Pathological processes involving any part of the LUNG .","support":[{"end":504,"quote":"Pathological processes involving any part of the\nLUNG\n.","source_id":"nlm-mesh.d008171","source_sha256":"d6f5a4a73edbfe2ce38f3798ab4fd621435aa8275a44bd8a5072a45b61313ded","start":449}],"target_id":"concept.mesh.d008171","target_kind":"node","target_sha256":"76496654e1a762420659d424f3474bc6e29e05d4a992729d9252e0d1180ebfbf"}],"concept.mesh.d008328":[{"id":"assertion.concept.mesh.d008328","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Man-Machine Systems as described in the captured NLM MeSH descriptor D008328","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Man-Machine Systems as: A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","support":[{"end":577,"quote":"A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","source_id":"nlm-mesh.d008328","source_sha256":"6073012aaf066cefea4a731e3ee7041ee1426726a6f1633b3d90a18804025c95","start":455}],"target_id":"concept.mesh.d008328","target_kind":"node","target_sha256":"474952400016d35f3b21e31f920b25e065f3707d6187295cc246024e9f3f12cb"}],"concept.mesh.d008488":[{"id":"assertion.concept.mesh.d008488","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Illustration as described in the captured NLM MeSH descriptor D008488","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Illustration as: The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","support":[{"end":836,"quote":"The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","source_id":"nlm-mesh.d008488","source_sha256":"57d4e42d6d401c785604463e71536eab32324a979d07f54b505359bbc2da3244","start":611}],"target_id":"concept.mesh.d008488","target_kind":"node","target_sha256":"acde97a0f3d5da05eb6891913d52d89a7635a944ce7e41afc5e75025ffb2167b"}],"concept.mesh.d008512":[{"id":"assertion.concept.mesh.d008512","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine in the Arts as described in the captured NLM MeSH descriptor D008512","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine in the Arts as: Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","support":[{"end":540,"quote":"Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","source_id":"nlm-mesh.d008512","source_sha256":"fce9174a651a5b44a41970d1d259dbeeb260db5aecc20ddd0f486cb46f054927","start":434}],"target_id":"concept.mesh.d008512","target_kind":"node","target_sha256":"8529855dbe0c705c58a779eaff10ac4f848e2df0181ecc9edfb10d26f70e3adc"}],"concept.mesh.d008904":[{"id":"assertion.concept.mesh.d008904","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Miniaturization as described in the captured NLM MeSH descriptor D008904","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Miniaturization as: The design or construction of objects greatly reduced in scale.","support":[{"end":409,"quote":"The design or construction of objects greatly reduced in scale.","source_id":"nlm-mesh.d008904","source_sha256":"ed26463c876eac6f5e826b95f7f1bbdd4d245e2b87dfa06737da324af12557e1","start":346}],"target_id":"concept.mesh.d008904","target_kind":"node","target_sha256":"edc06d7cee3959d2b89653825bf597915b07129f20c00ca56657960f757c2b9e"}],"concept.mesh.d008921":[{"id":"assertion.concept.mesh.d008921","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religious Missions as described in the captured NLM MeSH descriptor D008921","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religious Missions as: Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","support":[{"end":625,"quote":"Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","source_id":"nlm-mesh.d008921","source_sha256":"1d160f20f3844f0e495682c57827d1f399289f0f1ad581242e848d3d21e00af8","start":432}],"target_id":"concept.mesh.d008921","target_kind":"node","target_sha256":"59b34d9b4a0789ac635237bdf082dd10bf288bc13bca9ecfdd7767c30a0f781d"}],"concept.mesh.d008953":[{"id":"assertion.concept.mesh.d008953","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Anatomic as described in the captured NLM MeSH descriptor D008953","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Anatomic as: Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","support":[{"end":543,"quote":"Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","source_id":"nlm-mesh.d008953","source_sha256":"ff0e65f7430a6c7be42b60cdeb0da1b0ab7d52b722ccc57f09b2919f87fffed5","start":388}],"target_id":"concept.mesh.d008953","target_kind":"node","target_sha256":"ae0b6b47c1a68f949e858b9254d9a196e77f8497e8bfec8d177b13e71dd6dfb5"}],"concept.mesh.d008961":[{"id":"assertion.concept.mesh.d008961","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Structural as described in the captured NLM MeSH descriptor D008961","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Structural as: A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":541,"quote":"A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d008961","source_sha256":"418670802ea23de50feab6a042e0162325645da0dd5cb9f9df63e18b2b6ab78a","start":384}],"target_id":"concept.mesh.d008961","target_kind":"node","target_sha256":"f9f532cdb9dcf34b348fa17e60ce0bf287de28a8695b20144a33c4d0e6aba2f4"}],"concept.mesh.d009014":[{"id":"assertion.concept.mesh.d009014","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Morals as described in the captured NLM MeSH descriptor D009014","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Morals as: Standards of conduct that distinguish right from wrong.","support":[{"end":395,"quote":"Standards of conduct that distinguish right from wrong.","source_id":"nlm-mesh.d009014","source_sha256":"a67120d82a9013f0ce9ff46307f3a0e843e7e6ecc7f4ddf3301070de4eb76b11","start":340}],"target_id":"concept.mesh.d009014","target_kind":"node","target_sha256":"0cc086bb377776132bb27e11702fed741464ab352376fe28932911fa6999dc00"}],"concept.mesh.d009040":[{"id":"assertion.concept.mesh.d009040","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motion Pictures as described in the captured NLM MeSH descriptor D009040","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motion Pictures as: The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","support":[{"end":640,"quote":"The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","source_id":"nlm-mesh.d009040","source_sha256":"1983fc30e4c7092693d8be0bdc5782e8fc32d08e17be146c544b495bfc972c9c","start":533}],"target_id":"concept.mesh.d009040","target_kind":"node","target_sha256":"79866710adc45f7dcf080b6ba41f517cd519c41b4694b3930998196e410594d1"}],"concept.mesh.d009042":[{"id":"assertion.concept.mesh.d009042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motivation as described in the captured NLM MeSH descriptor D009042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motivation as: Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","support":[{"end":550,"quote":"Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","source_id":"nlm-mesh.d009042","source_sha256":"13d3262333474c160cc63f5f68567e66f10d28f4397f80446fa95e82908367f3","start":378}],"target_id":"concept.mesh.d009042","target_kind":"node","target_sha256":"942a0427a91ee9a7b3776cb4ca409be0de7f8dc0ccd8432f2779200dd16308ab"}],"concept.mesh.d009043":[{"id":"assertion.concept.mesh.d009043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motor Activity as described in the captured NLM MeSH descriptor D009043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motor Activity as: Body movements of a human or an animal as a behavioral phenomenon.","support":[{"end":537,"quote":"Body movements of a human or an animal as a behavioral phenomenon.","source_id":"nlm-mesh.d009043","source_sha256":"8264c913846f846785c6d2a9b7b34c176233777c2501b78bbbf3e091c14b997a","start":471}],"target_id":"concept.mesh.d009043","target_kind":"node","target_sha256":"766348eb42732db692525cafa08b6cc443321d4b2699dfc86ec432c0b7315116"}],"concept.mesh.d009111":[{"id":"assertion.concept.mesh.d009111","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Local Government as described in the captured NLM MeSH descriptor D009111","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Local Government as: Smallest political subdivisions within a country at which general governmental functions are carried-out.","support":[{"end":498,"quote":"Smallest political subdivisions within a country at which general governmental functions are carried-out.","source_id":"nlm-mesh.d009111","source_sha256":"71de485a305dfd4f1fb560039e934c9267e0cafc65d388fd4951134e7de36781","start":393}],"target_id":"concept.mesh.d009111","target_kind":"node","target_sha256":"8f66eda2327bc4c99926016384a4909c74696813bd78506fb67aa8bb010eb6f8"}],"concept.mesh.d009140":[{"id":"assertion.concept.mesh.d009140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Musculoskeletal Diseases as described in the captured NLM MeSH descriptor D009140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Musculoskeletal Diseases as: Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","support":[{"end":565,"quote":"Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","source_id":"nlm-mesh.d009140","source_sha256":"5c42512926737aff00a3bac718983c347866572b762db6b9e47bb8e3a4eef389","start":431}],"target_id":"concept.mesh.d009140","target_kind":"node","target_sha256":"c6a934fd24eec4deb9ca9a46e14a6359434e5d568484d8c7b07d2e78c4b85d8e"}],"concept.mesh.d009228":[{"id":"assertion.concept.mesh.d009228","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mysticism as described in the captured NLM MeSH descriptor D009228","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mysticism as: A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","support":[{"end":499,"quote":"A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","source_id":"nlm-mesh.d009228","source_sha256":"c8b631a5d28012577cc8b6f91c8080d8fe55187977901dcc16f1e2d216eed2bc","start":379}],"target_id":"concept.mesh.d009228","target_kind":"node","target_sha256":"5167356609d00889a0b6de62688e4ec750c07a72d2319f6458b89f9061b24539"}],"concept.mesh.d009369":[{"id":"assertion.concept.mesh.d009369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms as described in the captured NLM MeSH descriptor D009369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms as: New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","support":[{"end":653,"quote":"New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","source_id":"nlm-mesh.d009369","source_sha256":"9398564d5b89bde06ccde32a3abd9b98340504d46c003e294068b1ec2dd6faa2","start":486}],"target_id":"concept.mesh.d009369","target_kind":"node","target_sha256":"d50dc5f2d1f8bc4ab6f203c23c5119aa9ede709b94575a8cafafa89759a705c7"}],"concept.mesh.d009370":[{"id":"assertion.concept.mesh.d009370","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms by Histologic Type as described in the captured NLM MeSH descriptor D009370","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms by Histologic Type as: A collective term for the various histological types of NEOPLASMS . It is more likely to be used by searchers than by indexers and catalogers.","support":[{"end":584,"quote":"A collective term for the various histological types of\nNEOPLASMS\n. It is more likely to be used by searchers than by indexers and catalogers.","source_id":"nlm-mesh.d009370","source_sha256":"e6d22cff1ab11cd51b2f7ef99d74281c7201d048e722a366efc37b25f90cb9d5","start":442}],"target_id":"concept.mesh.d009370","target_kind":"node","target_sha256":"edc1c89375c2d3304f7caa4559017ce69853b7a6beb98455357a7f02f96169fe"}],"concept.mesh.d009371":[{"id":"assertion.concept.mesh.d009371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms by Site as described in the captured NLM MeSH descriptor D009371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms by Site as: A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as BRAIN NEOPLASMS ; DUODENAL NEOPLASMS ; LIVER NEOPLASMS ; etc.","support":[{"end":574,"quote":"A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as\nBRAIN NEOPLASMS\n;\nDUODENAL NEOPLASMS\n;\nLIVER NEOPLASMS\n; etc.","source_id":"nlm-mesh.d009371","source_sha256":"d8ed9a73f5a64d553402bdea5a78fe6e1cb9105346440d71cea0fb33f2e95b84","start":420}],"target_id":"concept.mesh.d009371","target_kind":"node","target_sha256":"2b9c3366a2379bdd95e8050ca06accfd34308d526fed47479cdac95f653c2e45"}],"concept.mesh.d009374":[{"id":"assertion.concept.mesh.d009374","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Experimental as described in the captured NLM MeSH descriptor D009374","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Experimental as: Experimentally induced new abnormal growth of TISSUES in animals to provide models for studying human neoplasms.","support":[{"end":665,"quote":"Experimentally induced new abnormal growth of\nTISSUES\nin animals to provide models for studying human neoplasms.","source_id":"nlm-mesh.d009374","source_sha256":"1bee40eee8386dd1a48a3ed4b6d37564817b718d0b2e068c23031a76458272e8","start":553}],"target_id":"concept.mesh.d009374","target_kind":"node","target_sha256":"9fb4081ae2a84457a872d34bd09ef855fbe42d900b3f83762e0aa1bfbc45b9d5"}],"concept.mesh.d009376":[{"id":"assertion.concept.mesh.d009376","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Hormone-Dependent as described in the captured NLM MeSH descriptor D009376","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Hormone-Dependent as: Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","support":[{"end":707,"quote":"Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","source_id":"nlm-mesh.d009376","source_sha256":"2e9535ced22f8c658df59f1ef1e0bfaff90658a60c8cfa64fdd4456e1ac15d20","start":531}],"target_id":"concept.mesh.d009376","target_kind":"node","target_sha256":"ed3c504a350f320b0ba810958e214c9e712e7d6affedb8ed6a63b738c8abc25a"}],"concept.mesh.d009378":[{"id":"assertion.concept.mesh.d009378","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Multiple Primary as described in the captured NLM MeSH descriptor D009378","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Multiple Primary as: Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","support":[{"end":1107,"quote":"Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","source_id":"nlm-mesh.d009378","source_sha256":"9c39f088f12a738ac7eeb48e98b980941c19911876655d850f4a478007ba49ae","start":897}],"target_id":"concept.mesh.d009378","target_kind":"node","target_sha256":"946567394a4f79461913b102be00272a39e75c70c7b942986f146ebf36ff4111"}],"concept.mesh.d009381":[{"id":"assertion.concept.mesh.d009381","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Radiation-Induced as described in the captured NLM MeSH descriptor D009381","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Radiation-Induced as: Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","support":[{"end":589,"quote":"Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","source_id":"nlm-mesh.d009381","source_sha256":"e28a97bc122c81d8f266fa31e15f04e1ce9996b5ef5cee458d8273826cab80ba","start":496}],"target_id":"concept.mesh.d009381","target_kind":"node","target_sha256":"eaf1cd442d346c11352915385c8f6a63ecc95d822c012ac3edc89c23ba62bfb6"}],"concept.mesh.d009385":[{"id":"assertion.concept.mesh.d009385","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplastic Processes as described in the captured NLM MeSH descriptor D009385","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplastic Processes as: The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","support":[{"end":534,"quote":"The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","source_id":"nlm-mesh.d009385","source_sha256":"ea3ea9a117d3731127c3053c2b2325fef733247fa2bafa9b268450fc2d337929","start":416}],"target_id":"concept.mesh.d009385","target_kind":"node","target_sha256":"9df1e64f95abf473e60aeca3b3bb37b2205eaba7a0f7d5ee632d1e680a2a2b5b"}],"concept.mesh.d009386":[{"id":"assertion.concept.mesh.d009386","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplastic Syndromes, Hereditary as described in the captured NLM MeSH descriptor D009386","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplastic Syndromes, Hereditary as: The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","support":[{"end":1003,"quote":"The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","source_id":"nlm-mesh.d009386","source_sha256":"add0122ccd3ac653991490694bb288062cc861cb42d0253d3e6e9887d4ef96f3","start":496}],"target_id":"concept.mesh.d009386","target_kind":"node","target_sha256":"ff2387295a2eacd854f8e3d17d13544fc0cf9d9b4d2cd3ac1de6c067710ffd52"}],"concept.mesh.d009421":[{"id":"assertion.concept.mesh.d009421","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Malformations as described in the captured NLM MeSH descriptor D009421","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Malformations as: Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","support":[{"end":622,"quote":"Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","source_id":"nlm-mesh.d009421","source_sha256":"f04a5dc22bedd15f398924554a56cefaf1fce8f2e89757c2f06399f5c09a93be","start":503}],"target_id":"concept.mesh.d009421","target_kind":"node","target_sha256":"5ef044429aae913ed768a286406b00d90b2a51dec155e8a5c84cbe0ac25b7a65"}],"concept.mesh.d009422":[{"id":"assertion.concept.mesh.d009422","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Diseases as described in the captured NLM MeSH descriptor D009422","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Diseases as: Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","support":[{"end":866,"quote":"Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","source_id":"nlm-mesh.d009422","source_sha256":"2e327d46ab72bd2337953add6b4e94ff3e3d51255f743807bc66cda29dc3d077","start":651}],"target_id":"concept.mesh.d009422","target_kind":"node","target_sha256":"26c486b706da90e3057222e10cfa40008bda7c4298b5d6b9817092ccaa99593a"}],"concept.mesh.d009423":[{"id":"assertion.concept.mesh.d009423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Neoplasms as described in the captured NLM MeSH descriptor D009423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Neoplasms as: Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","support":[{"end":801,"quote":"Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","source_id":"nlm-mesh.d009423","source_sha256":"ed83a9e2110063a04549fb99c5c85b8026f5672c3a2a43dcaa8a6d4515cd2148","start":555}],"target_id":"concept.mesh.d009423","target_kind":"node","target_sha256":"f1d17d2379fd553415c955c5e88e5b4d82b4e94dbf34fa3bc0bccbe88dcacb79"}],"concept.mesh.d009461":[{"id":"assertion.concept.mesh.d009461","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurologic Manifestations as described in the captured NLM MeSH descriptor D009461","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurologic Manifestations as: Clinical signs and symptoms caused by nervous system injury or dysfunction.","support":[{"end":556,"quote":"Clinical signs and symptoms caused by nervous system injury or dysfunction.","source_id":"nlm-mesh.d009461","source_sha256":"f2fbdbb3f84b8e2ddac1439b1fce4fbbb5fc5f3d4fb9313472c21adfee0d83cc","start":481}],"target_id":"concept.mesh.d009461","target_kind":"node","target_sha256":"bf2b1d695e9b71bcb84a534efbe34c256d2de34e56f5b8305d4ed2cda6cde695"}],"concept.mesh.d009468":[{"id":"assertion.concept.mesh.d009468","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuromuscular Diseases as described in the captured NLM MeSH descriptor D009468","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuromuscular Diseases as: A general term encompassing lower MOTOR NEURON DISEASE ; PERIPHERAL NERVOUS SYSTEM DISEASES ; and certain MUSCULAR DISEASES . Manifestations include MUSCLE WEAKNESS ; FASCICULATION ; muscle ATROPHY ; SPASM ; MYOKYMIA ; MUSCLE HYPERTONIA , myalgias, and MUSCLE HYPOTONIA .","support":[{"end":750,"quote":"A general term encompassing lower\nMOTOR NEURON DISEASE\n;\nPERIPHERAL NERVOUS SYSTEM DISEASES\n; and certain\nMUSCULAR DISEASES\n. Manifestations include\nMUSCLE WEAKNESS\n;\nFASCICULATION\n; muscle\nATROPHY\n;\nSPASM\n;\nMYOKYMIA\n;\nMUSCLE HYPERTONIA\n, myalgias, and\nMUSCLE HYPOTONIA\n.","source_id":"nlm-mesh.d009468","source_sha256":"7aaccbcdc17267b35238e3a91ee835823a083ecc217be6fc406af5f7703afb3f","start":479}],"target_id":"concept.mesh.d009468","target_kind":"node","target_sha256":"1059998918e2d69a89dc80f530ed6d427face1348a60b37ad6341ee0c04d7d8e"}],"concept.mesh.d009668":[{"id":"assertion.concept.mesh.d009668","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nose Diseases as described in the captured NLM MeSH descriptor D009668","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nose Diseases as: Disorders of the nose, general or unspecified.","support":[{"end":435,"quote":"Disorders of the nose, general or unspecified.","source_id":"nlm-mesh.d009668","source_sha256":"b0a09724d9c1dd828fd139ad2cf5bb39ea0c1c8671fa588a9ba91f2cd5adb452","start":389}],"target_id":"concept.mesh.d009668","target_kind":"node","target_sha256":"be063b3a0b5d910ac1bdf5bffcbb2b70261b9d10e2946f9bedcf5f6c4ef15bde"}],"concept.mesh.d009752":[{"id":"assertion.concept.mesh.d009752","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nutritional Status as described in the captured NLM MeSH descriptor D009752","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nutritional Status as: State of the body in relation to the consumption and utilization of nutrients.","support":[{"end":518,"quote":"State of the body in relation to the consumption and utilization of nutrients.","source_id":"nlm-mesh.d009752","source_sha256":"4332c219ce767111e0b43dfb31bfc85368d1c4fc4496edcbfec4885ae76c1f0b","start":440}],"target_id":"concept.mesh.d009752","target_kind":"node","target_sha256":"7a34655a3a1372f6d1abe785f62d17bea2f25aca8a7766adefb2226af570e535"}],"concept.mesh.d009781":[{"id":"assertion.concept.mesh.d009781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Occultism as described in the captured NLM MeSH descriptor D009781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Occultism as: The belief in or study of practices and knowledge of magical, mystical, or supernatural powers. ALCHEMY , astrology, and many RELIGIOUS PHILOSOPHIES are based upon occult principles.","support":[{"end":512,"quote":"The belief in or study of practices and knowledge of magical, mystical, or supernatural powers.\nALCHEMY\n, astrology, and many\nRELIGIOUS PHILOSOPHIES\nare based upon occult principles.","source_id":"nlm-mesh.d009781","source_sha256":"c8f3bc46e36c8187fe1dc67c31e7c9948be1559a665c6e38191cfecccacf9ec6","start":330}],"target_id":"concept.mesh.d009781","target_kind":"node","target_sha256":"5f9e57fa7f15174382bf559b6bfc80114903440694bdab609583b299b23a8a2c"}],"concept.mesh.d009874":[{"id":"assertion.concept.mesh.d009874","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Operations Research as described in the captured NLM MeSH descriptor D009874","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Operations Research as: A group of techniques developed to apply scientific methods and tools to solve the problems of DECISION MAKING in complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting GOALS and makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","support":[{"end":736,"quote":"A group of techniques developed to apply scientific methods and tools to solve the problems of\nDECISION MAKING\nin complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting\nGOALS\nand makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","source_id":"nlm-mesh.d009874","source_sha256":"b119f0b88574b5991690f6d81d813e438e0fe03b0f560502bf710ce98937b2ea","start":370}],"target_id":"concept.mesh.d009874","target_kind":"node","target_sha256":"f4d77d79a44bf83df5022b7adbb0d9aeb87cbda7b569713f15382a49e20a73be"}],"concept.mesh.d009894":[{"id":"assertion.concept.mesh.d009894","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Opportunistic Infections as described in the captured NLM MeSH descriptor D009894","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Opportunistic Infections as: An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","support":[{"end":739,"quote":"An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","source_id":"nlm-mesh.d009894","source_sha256":"6c520fc1718a529d093a3ab627be3a818dd1ab53fcd2431296398f39f291b6a6","start":622}],"target_id":"concept.mesh.d009894","target_kind":"node","target_sha256":"9b9ed3d14037d1b5251c3eed28a04d456f1c5d943516302f68b644f256629515"}],"concept.mesh.d009949":[{"id":"assertion.concept.mesh.d009949","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orientation as described in the captured NLM MeSH descriptor D009949","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orientation as: Awareness of oneself in relation to time, place and person.","support":[{"end":435,"quote":"Awareness of oneself in relation to time, place and person.","source_id":"nlm-mesh.d009949","source_sha256":"11d39116fea91ce0aa29ec9500ca6f687e99bfeae2485ceb44a8913f30db3c45","start":376}],"target_id":"concept.mesh.d009949","target_kind":"node","target_sha256":"3e3655c5ddfd572ca01c20671f1fec044b854713627853c06c27e7b758b38c6f"}],"concept.mesh.d010257":[{"id":"assertion.concept.mesh.d010257","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Paraneoplastic Syndromes as described in the captured NLM MeSH descriptor D010257","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Paraneoplastic Syndromes as: In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","support":[{"end":532,"quote":"In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","source_id":"nlm-mesh.d010257","source_sha256":"f9676346366a5f3de2c4f5b65052394cfdebcc17cd459c162ce25188f5ed1583","start":360}],"target_id":"concept.mesh.d010257","target_kind":"node","target_sha256":"99d8cb904487ba0a2a9d23df4af61eb3f344e65df09ae441fbb108803f4ac0a4"}],"concept.mesh.d010272":[{"id":"assertion.concept.mesh.d010272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Parasitic Diseases as described in the captured NLM MeSH descriptor D010272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Parasitic Diseases as: Infections or infestations with PARASITES . They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","support":[{"end":672,"quote":"Infections or infestations with\nPARASITES\n. They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","source_id":"nlm-mesh.d010272","source_sha256":"91d2488c6b68444df182caafc02556575a7d768e00a50499851db6be0877f30d","start":510}],"target_id":"concept.mesh.d010272","target_kind":"node","target_sha256":"94096ded9ccfdac99d30a350eec6303d5cfcc3e66e23be175fc6e691c615aee9"}],"concept.mesh.d010467":[{"id":"assertion.concept.mesh.d010467","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perceptual Defense as described in the captured NLM MeSH descriptor D010467","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perceptual Defense as: Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","support":[{"end":560,"quote":"Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","source_id":"nlm-mesh.d010467","source_sha256":"8e2cf63332757a60871943157d373f9a3a4234451f77859ab8bd252d9f74a1a0","start":352}],"target_id":"concept.mesh.d010467","target_kind":"node","target_sha256":"e9087caeaa1ca5bb13d0c070efa423ed2ccae5c5a782cd4c23758a68314e0911"}],"concept.mesh.d010549":[{"id":"assertion.concept.mesh.d010549","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personal Satisfaction as described in the captured NLM MeSH descriptor D010549","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personal Satisfaction as: The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","support":[{"end":474,"quote":"The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","source_id":"nlm-mesh.d010549","source_sha256":"a95012f41c90c63e5ea0b1967098b4c970b9062dc59793123203072017880d78","start":358}],"target_id":"concept.mesh.d010549","target_kind":"node","target_sha256":"ecf46b47a83cbe2bd0057b999406f8682d90167f8f2ae10877fde95932078772"}],"concept.mesh.d010551":[{"id":"assertion.concept.mesh.d010551","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personality as described in the captured NLM MeSH descriptor D010551","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personality as: Behavior-response patterns that characterize the individual.","support":[{"end":394,"quote":"Behavior-response patterns that characterize the individual.","source_id":"nlm-mesh.d010551","source_sha256":"ac816bc3bcb6b607c2834e0c462bee047bec961ff94258bab2fc8c91433aa66d","start":334}],"target_id":"concept.mesh.d010551","target_kind":"node","target_sha256":"d7e56bbcf5d1c68a98e7b4950052e22b35e647bdbd0cd164f76333a5ccdf7bbd"}],"concept.mesh.d010995":[{"id":"assertion.concept.mesh.d010995","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pleural Diseases as described in the captured NLM MeSH descriptor D010995","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pleural Diseases as: Diseases involving the PLEURA .","support":[{"end":418,"quote":"Diseases involving the\nPLEURA\n.","source_id":"nlm-mesh.d010995","source_sha256":"a4c1f90952bf0aeba4340cab25641aff6b8ab453ccfaceb84058279bcc04f577","start":387}],"target_id":"concept.mesh.d010995","target_kind":"node","target_sha256":"99f4b463400b72bb93ba9935bfc5018effb4b7767287c0110e02c98a4520f741"}],"concept.mesh.d011049":[{"id":"assertion.concept.mesh.d011049","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Control Policies as described in the captured NLM MeSH descriptor D011049","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Control Policies as: Decisions for determining and guiding present and future objectives from among alternatives.","support":[{"end":622,"quote":"Decisions for determining and guiding present and future objectives from among alternatives.","source_id":"nlm-mesh.d011049","source_sha256":"b0d9cce0326e9aa5c4e008c3221ece3d9d8c87001772899522b6175ab0afa134","start":530}],"target_id":"concept.mesh.d011049","target_kind":"node","target_sha256":"d58b1c16e017ef40e2c765d356e2c53583c154a202ae2ccf745e11db1f909518"}],"concept.mesh.d011056":[{"id":"assertion.concept.mesh.d011056","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Political Systems as described in the captured NLM MeSH descriptor D011056","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Political Systems as: The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","support":[{"end":515,"quote":"The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","source_id":"nlm-mesh.d011056","source_sha256":"0431be76a4e48b1d1a247c9b199f654a58b4bdf3b01eee2b68d4fa961476c7cb","start":370}],"target_id":"concept.mesh.d011056","target_kind":"node","target_sha256":"493a71f8c83d25bf6ed276398846ff4239bd693587eb7bcb02732a4b872d4a42"}],"concept.mesh.d011155":[{"id":"assertion.concept.mesh.d011155","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Control as described in the captured NLM MeSH descriptor D011155","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Control as: Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","support":[{"end":622,"quote":"Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","source_id":"nlm-mesh.d011155","source_sha256":"2baddb04f01f8731810d70eaf0b21844f5b645d3e20f77246580fa3ca3d5bd56","start":512}],"target_id":"concept.mesh.d011155","target_kind":"node","target_sha256":"8a4bf11482e565b6e3519d648d7e4575556ee7c8d6f81f4eb34376a58068f2a7"}],"concept.mesh.d011158":[{"id":"assertion.concept.mesh.d011158","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Growth as described in the captured NLM MeSH descriptor D011158","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Growth as: Increase, over a specific period of time, in the number of individuals living in a country or region.","support":[{"end":527,"quote":"Increase, over a specific period of time, in the number of individuals living in a country or region.","source_id":"nlm-mesh.d011158","source_sha256":"7e0023f87f31e021c275da84106090dc449a0d7a01bb3bd0e1abe4004a5a9ce3","start":426}],"target_id":"concept.mesh.d011158","target_kind":"node","target_sha256":"27ed8c80327b9ac6372de3a2cfa8cabf4c6c5bc3c4813fe6ef23f3658f1ab836"}],"concept.mesh.d011177":[{"id":"assertion.concept.mesh.d011177","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Postal Service as described in the captured NLM MeSH descriptor D011177","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Postal Service as: The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","support":[{"end":490,"quote":"The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","source_id":"nlm-mesh.d011177","source_sha256":"4f81deee9f527bb6204ad5a323e46f48c2dceb19e3dac3a3c6772493d273a142","start":344}],"target_id":"concept.mesh.d011177","target_kind":"node","target_sha256":"8794d86da1b263a93394912d9383a5dc8decf8e43afbb600a448fb8706287857"}],"concept.mesh.d011230":[{"id":"assertion.concept.mesh.d011230","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precancerous Conditions as described in the captured NLM MeSH descriptor D011230","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precancerous Conditions as: Pathological conditions that tend eventually to become malignant.","support":[{"end":551,"quote":"Pathological conditions that tend eventually to become malignant.","source_id":"nlm-mesh.d011230","source_sha256":"eaf0575619a25497d53f2c474c54337c57e8612165b9ad28d3f05a0e2d091c94","start":486}],"target_id":"concept.mesh.d011230","target_kind":"node","target_sha256":"f8a6e3cdb752f0fcce27bc2d2523b97f3e71b43380c9195cac663a15b694c2fe"}],"concept.mesh.d011249":[{"id":"assertion.concept.mesh.d011249","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Cardiovascular as described in the captured NLM MeSH descriptor D011249","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Cardiovascular as: The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow FERTILIZATION and it may or may not have a deleterious effect on the pregnant woman or FETUS .","support":[{"end":779,"quote":"The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow\nFERTILIZATION\nand it may or may not have a deleterious effect on the pregnant woman or\nFETUS\n.","source_id":"nlm-mesh.d011249","source_sha256":"6c6bf720c6720c7ddfcdb71352eaeed2a3e7541e7e9a4b9ce2d545c936a92251","start":590}],"target_id":"concept.mesh.d011249","target_kind":"node","target_sha256":"4693a73bea129a7d0c28c80a55097ffc4542f89711f18aadf90fe86869ff7a33"}],"concept.mesh.d011251":[{"id":"assertion.concept.mesh.d011251","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Infectious as described in the captured NLM MeSH descriptor D011251","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Infectious as: The co-occurrence of pregnancy and an INFECTION . The infection may precede or follow FERTILIZATION .","support":[{"end":648,"quote":"The co-occurrence of pregnancy and an\nINFECTION\n. The infection may precede or follow\nFERTILIZATION\n.","source_id":"nlm-mesh.d011251","source_sha256":"0658865c769bf6a35365b86f84ac4e1968c735abb6fa241d62cdde59fca8c27a","start":547}],"target_id":"concept.mesh.d011251","target_kind":"node","target_sha256":"56ebaabdec1be792a34f107558598e7ee7cc3258412e247a1202b74fac7cd2e3"}],"concept.mesh.d011252":[{"id":"assertion.concept.mesh.d011252","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Neoplastic as described in the captured NLM MeSH descriptor D011252","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Neoplastic as: The co-occurrence of pregnancy and NEOPLASMS . The neoplastic disease may precede or follow FERTILIZATION .","support":[{"end":678,"quote":"The co-occurrence of pregnancy and\nNEOPLASMS\n. The neoplastic disease may precede or follow\nFERTILIZATION\n.","source_id":"nlm-mesh.d011252","source_sha256":"b532b275081ab79d924d20390d37ce3b1f36a91fb19c448c50c4730801abc23f","start":571}],"target_id":"concept.mesh.d011252","target_kind":"node","target_sha256":"396db8490abad4757cd68ee14c957e1451ea971c91115c2d6e30f891488d3aca"}],"concept.mesh.d011336":[{"id":"assertion.concept.mesh.d011336","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Probability as described in the captured NLM MeSH descriptor D011336","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Probability as: The study of chance processes or the relative frequency characterizing a chance process.","support":[{"end":707,"quote":"The study of chance processes or the relative frequency characterizing a chance process.","source_id":"nlm-mesh.d011336","source_sha256":"c68307e92bd84d0c45588b54a5a60513b2b9d906b233fe44239fbf32e4251224","start":619}],"target_id":"concept.mesh.d011336","target_kind":"node","target_sha256":"56a3d3161590e1e58ff83c23bc4559d98d66c3bfe9248988da77b9e4863f6e09"}],"concept.mesh.d011385":[{"id":"assertion.concept.mesh.d011385","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Projection as described in the captured NLM MeSH descriptor D011385","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Projection as: A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","support":[{"end":490,"quote":"A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","source_id":"nlm-mesh.d011385","source_sha256":"6a9869127d5888865d6f43190601d42f0a32415be3ea6753500e3fc351dab5ac","start":336}],"target_id":"concept.mesh.d011385","target_kind":"node","target_sha256":"649f0d83a761835179237f82f9975aee912c2de71e0d54af95e362d75f4b928b"}],"concept.mesh.d011786":[{"id":"assertion.concept.mesh.d011786","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality Control as described in the captured NLM MeSH descriptor D011786","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality Control as: A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","support":[{"end":582,"quote":"A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d011786","source_sha256":"50a1b06fc9164b86e74abf7666331b4d72f749d5af24d5557be135ed2232ff21","start":346}],"target_id":"concept.mesh.d011786","target_kind":"node","target_sha256":"f667658025ed8217b9b03dfca6bf6c345b98241a25a9b584cde6f6dbfdcef929"}],"concept.mesh.d011788":[{"id":"assertion.concept.mesh.d011788","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality of Life as described in the captured NLM MeSH descriptor D011788","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality of Life as: A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","support":[{"end":560,"quote":"A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","source_id":"nlm-mesh.d011788","source_sha256":"a3fe6fec06d7760e8d154b7ed62133ef016ee7e9fd9fa2df1202a853322cee2d","start":382}],"target_id":"concept.mesh.d011788","target_kind":"node","target_sha256":"2322437aa1f2abef821426cc12712bb29596e34a11e14e0a10fdb7cedc07c0aa"}],"concept.mesh.d011845":[{"id":"assertion.concept.mesh.d011845","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radio as described in the captured NLM MeSH descriptor D011845","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radio as: The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","support":[{"end":642,"quote":"The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","source_id":"nlm-mesh.d011845","source_sha256":"e7ea4815b1a540ea7cc4951a500dfa86bd97b4de141636ccc2f9311fb94b70de","start":398}],"target_id":"concept.mesh.d011845","target_kind":"node","target_sha256":"78c9051992a7c4c3ed2ff0ad69879fc2a06de223791508c8bbf736b673b6ba20"}],"concept.mesh.d011897":[{"id":"assertion.concept.mesh.d011897","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Random Allocation as described in the captured NLM MeSH descriptor D011897","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Random Allocation as: A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","support":[{"end":830,"quote":"A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","source_id":"nlm-mesh.d011897","source_sha256":"c6c193348e4af187f8947ec4b9a65681ae397616cd94b0dabcd20d96f218dbcc","start":575}],"target_id":"concept.mesh.d011897","target_kind":"node","target_sha256":"10c9193c093d47f983e16c1b85d81fa7a4d86265fe653d294e7146f1b56d4fef"}],"concept.mesh.d011908":[{"id":"assertion.concept.mesh.d011908","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Rationalization as described in the captured NLM MeSH descriptor D011908","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Rationalization as: A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","support":[{"end":575,"quote":"A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","source_id":"nlm-mesh.d011908","source_sha256":"0388249768828c95e09a5a6242e47f2ae82b8525bfb6b50d20618c3ac6fb2d94","start":367}],"target_id":"concept.mesh.d011908","target_kind":"node","target_sha256":"b2b9ed895ff6406a698e2bcaf9d8a7ebaab68c067bf48986cd240e7635d09b50"}],"concept.mesh.d012043":[{"id":"assertion.concept.mesh.d012043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Regression, Psychology as described in the captured NLM MeSH descriptor D012043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Regression, Psychology as: A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","support":[{"end":667,"quote":"A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","source_id":"nlm-mesh.d012043","source_sha256":"ad0dd4dc516739f0ece07b96f15c64ad157b2764851fca75cc65576f30e9e3e6","start":414}],"target_id":"concept.mesh.d012043","target_kind":"node","target_sha256":"20b688da6f6617ee11ea2ae2007e0aaaae90daa88aa575a3759a0a8f22af30d0"}],"concept.mesh.d012071":[{"id":"assertion.concept.mesh.d012071","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Sex as described in the captured NLM MeSH descriptor D012071","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Sex as: The interrelationship of religion and sexual practices and beliefs.","support":[{"end":415,"quote":"The interrelationship of religion and sexual practices and beliefs.","source_id":"nlm-mesh.d012071","source_sha256":"cc0b8ed4f22f47a8d983e288427ca38f044b1117600fec481d4d5158a8daaa84","start":348}],"target_id":"concept.mesh.d012071","target_kind":"node","target_sha256":"a92d60640f4d60e9a989df0c528ba8c79b106eea437bf4f5efc247a533125384"}],"concept.mesh.d012072":[{"id":"assertion.concept.mesh.d012072","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religious Philosophies as described in the captured NLM MeSH descriptor D012072","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religious Philosophies as: Sets of beliefs on the nature of the universe or Man.","support":[{"end":465,"quote":"Sets of beliefs on the nature of the universe or Man.","source_id":"nlm-mesh.d012072","source_sha256":"9e8bf0c582465331fa653d592aa8a83f446ab736058ff161311366dcdfc52d14","start":412}],"target_id":"concept.mesh.d012072","target_kind":"node","target_sha256":"952ec9c893ffde3c1500a82711fc276e01a28fd61a44786ade6341c3ff652e19"}],"concept.mesh.d012094":[{"id":"assertion.concept.mesh.d012094","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Repression, Psychology as described in the captured NLM MeSH descriptor D012094","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Repression, Psychology as: The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","support":[{"end":491,"quote":"The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","source_id":"nlm-mesh.d012094","source_sha256":"01a4164b631c9a16a24390d4ec8b87c872f56d6eca5bc8bbf88eff42967c08b5","start":360}],"target_id":"concept.mesh.d012094","target_kind":"node","target_sha256":"8e56d54f35ee4fa042dfac9ee2d2630e175eafd948dfb306a296ba247f208963"}],"concept.mesh.d012106":[{"id":"assertion.concept.mesh.d012106","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research as described in the captured NLM MeSH descriptor D012106","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research as: Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","support":[{"end":863,"quote":"Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","source_id":"nlm-mesh.d012106","source_sha256":"87531e3d8129c6943d37aec640b3009b5b9d73a6325944fd0cc52e99a9dff200","start":529}],"target_id":"concept.mesh.d012106","target_kind":"node","target_sha256":"6a26d41ef44440ea9b5ef853a3e263f5811c8803a783150adcef88b661fcc2ce"}],"concept.mesh.d012107":[{"id":"assertion.concept.mesh.d012107","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research Design as described in the captured NLM MeSH descriptor D012107","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research Design as: A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","support":[{"end":521,"quote":"A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","source_id":"nlm-mesh.d012107","source_sha256":"ae2fbb2c9c85a658b5574aed59bb8ef1a35c2cdafdd48c877b1802a7cbf3571b","start":362}],"target_id":"concept.mesh.d012107","target_kind":"node","target_sha256":"15386ed70d8931ca1f42d4c4ae2ecd09366d9cb4239f3bcda31dbd48700ce91b"}],"concept.mesh.d012120":[{"id":"assertion.concept.mesh.d012120","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiration Disorders as described in the captured NLM MeSH descriptor D012120","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiration Disorders as: Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","support":[{"end":519,"quote":"Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","source_id":"nlm-mesh.d012120","source_sha256":"5742ef200c565bd2c4f20678954b9aa2c866956bb7d1e7d9ff5ff8d1dd0f80db","start":406}],"target_id":"concept.mesh.d012120","target_kind":"node","target_sha256":"65007bdb7804c2b3e754afde7a6c33626c5d26c749b11040f9fef33876020b88"}],"concept.mesh.d012130":[{"id":"assertion.concept.mesh.d012130","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Hypersensitivity as described in the captured NLM MeSH descriptor D012130","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Hypersensitivity as: A form of hypersensitivity affecting the respiratory tract. It includes ASTHMA and RHINITIS, ALLERGIC, SEASONAL .","support":[{"end":530,"quote":"A form of hypersensitivity affecting the respiratory tract. It includes\nASTHMA\nand\nRHINITIS, ALLERGIC, SEASONAL\n.","source_id":"nlm-mesh.d012130","source_sha256":"ca158ee60a332f6f65b9d3a6cdea8285ee348ef14d5815d1a635636fa7213fe7","start":417}],"target_id":"concept.mesh.d012130","target_kind":"node","target_sha256":"16cbcbc5f736c7a1daefa2f4dd328dc8a65d8046b3096ae600c9369084cb8be6"}],"concept.mesh.d012140":[{"id":"assertion.concept.mesh.d012140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Tract Diseases as described in the captured NLM MeSH descriptor D012140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Tract Diseases as: Diseases involving the RESPIRATORY SYSTEM .","support":[{"end":455,"quote":"Diseases involving the\nRESPIRATORY SYSTEM\n.","source_id":"nlm-mesh.d012140","source_sha256":"306452ce0e219fb270dca8fcba029ed3bcde4894b2cc3eae486d8b4f00599f96","start":412}],"target_id":"concept.mesh.d012140","target_kind":"node","target_sha256":"7db77345d7b35219ea4f7be89bfaa76ee68e953260e0d7607f898e954ad15501"}],"concept.mesh.d012141":[{"id":"assertion.concept.mesh.d012141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Tract Infections as described in the captured NLM MeSH descriptor D012141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Tract Infections as: Invasion of the host RESPIRATORY SYSTEM by microorganisms, usually leading to pathological processes or diseases.","support":[{"end":526,"quote":"Invasion of the host\nRESPIRATORY SYSTEM\nby microorganisms, usually leading to pathological processes or diseases.","source_id":"nlm-mesh.d012141","source_sha256":"467426761ff0ab2a074d8ca4aad125728b0f1dc453c28399210718dfdeaa1553","start":413}],"target_id":"concept.mesh.d012141","target_kind":"node","target_sha256":"741964e4910242b46fde49e2569ee1cb25b43bcb804663f5256470cb7adba774"}],"concept.mesh.d012148":[{"id":"assertion.concept.mesh.d012148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Restless Legs Syndrome as described in the captured NLM MeSH descriptor D012148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Restless Legs Syndrome as: A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","support":[{"end":728,"quote":"A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","source_id":"nlm-mesh.d012148","source_sha256":"cd49686901132e6cf9d8e768dbf8c3e1d2c1a20ad133a74dd5895ad26616944a","start":562}],"target_id":"concept.mesh.d012148","target_kind":"node","target_sha256":"92255d41ffe6329e3a6ed53c57ba7756bf253a556e8198098eacddc8100e7ecf"}],"concept.mesh.d012306":[{"id":"assertion.concept.mesh.d012306","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk as described in the captured NLM MeSH descriptor D012306","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk as: The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","support":[{"end":609,"quote":"The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","source_id":"nlm-mesh.d012306","source_sha256":"9b0c786bf181b186ad65ea0e7a8d44a0450734d47f5e7dcebadf25e585e32c16","start":476}],"target_id":"concept.mesh.d012306","target_kind":"node","target_sha256":"fc868c20ab438e72a7c580125286bf0f08d0c51fe36481c4d697347703adddad"}],"concept.mesh.d012307":[{"id":"assertion.concept.mesh.d012307","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk Factors as described in the captured NLM MeSH descriptor D012307","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk Factors as: An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","support":[{"end":951,"quote":"An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","source_id":"nlm-mesh.d012307","source_sha256":"e986275878f10030f5534a292fcd9ed18a560ca3778a31e39575accbe1171bb4","start":714}],"target_id":"concept.mesh.d012307","target_kind":"node","target_sha256":"5a4c4cf67c952c3b3dd40b049d092c47190fc46051f3909da1fb74ec3b823ec9"}],"concept.mesh.d012309":[{"id":"assertion.concept.mesh.d012309","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk-Taking as described in the captured NLM MeSH descriptor D012309","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk-Taking as: Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","support":[{"end":622,"quote":"Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","source_id":"nlm-mesh.d012309","source_sha256":"0715a0b6cc5e2f182c4f2c4db3d0d17f092adca490aeb639adcff759ba9763f5","start":338}],"target_id":"concept.mesh.d012309","target_kind":"node","target_sha256":"b14575e33a0c3f5645880e858473d51985e182c62ab775df1d64efd5fdf3a707"}],"concept.mesh.d012498":[{"id":"assertion.concept.mesh.d012498","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sanitary Engineering as described in the captured NLM MeSH descriptor D012498","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sanitary Engineering as: A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","support":[{"end":585,"quote":"A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","source_id":"nlm-mesh.d012498","source_sha256":"a8749973d84e5e53f29b4bacae78e342127151ea31e74a081932b06aaabd101b","start":408}],"target_id":"concept.mesh.d012498","target_kind":"node","target_sha256":"e2b1ade3792009b530197acc24dcd09bafb7ae9075186f82baaa65af9f8dd7e8"}],"concept.mesh.d012653":[{"id":"assertion.concept.mesh.d012653","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Self Stimulation as described in the captured NLM MeSH descriptor D012653","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Self Stimulation as: The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","support":[{"end":671,"quote":"The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","source_id":"nlm-mesh.d012653","source_sha256":"1993c5d80d6163615e90e1127be3e82a62fdb1b64b7d13199331df359338abd8","start":386}],"target_id":"concept.mesh.d012653","target_kind":"node","target_sha256":"4274077a0e6838dbb885ee5a74e2c6db727fe87d206da1d46beadb3e6892b5ae"}],"concept.mesh.d012725":[{"id":"assertion.concept.mesh.d012725","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sexual Behavior as described in the captured NLM MeSH descriptor D012725","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sexual Behavior as: Sexual activities of humans.","support":[{"end":518,"quote":"Sexual activities of humans.","source_id":"nlm-mesh.d012725","source_sha256":"eebb803ce4c2bd7fa38702618b79a323399bdc1e54269deaf239d1c0e3f1375f","start":490}],"target_id":"concept.mesh.d012725","target_kind":"node","target_sha256":"4a50311b1a52a1c41efb6c451c6a98f268d4de91a7cc17a75c3779a492cc4cda"}],"concept.mesh.d012742":[{"id":"assertion.concept.mesh.d012742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Offenses as described in the captured NLM MeSH descriptor D012742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Offenses as: Any violation of established legal or moral codes in respect to sexual behavior.","support":[{"end":424,"quote":"Any violation of established legal or moral codes in respect to sexual behavior.","source_id":"nlm-mesh.d012742","source_sha256":"29b3962f09b3484ddef4795322caed474712df17a9a39c42ae6810757ec97cc9","start":344}],"target_id":"concept.mesh.d012742","target_kind":"node","target_sha256":"33829b147bee1dee48f08333883fb6b55823e34006c93f5d181c67bc54caae8c"}],"concept.mesh.d012744":[{"id":"assertion.concept.mesh.d012744","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Ratio as described in the captured NLM MeSH descriptor D012744","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Ratio as: The number of males per 100 females.","support":[{"end":422,"quote":"The number of males per 100 females.","source_id":"nlm-mesh.d012744","source_sha256":"71956c7f623cfa4f8a38b7382b02b22aa6495af3fa01b41ae8f9fbc649ae39d4","start":386}],"target_id":"concept.mesh.d012744","target_kind":"node","target_sha256":"7c77292d44ebfc5e577f74c333bc09482ed661b52bd46bcdca8ebfa484b11728"}],"concept.mesh.d012749":[{"id":"assertion.concept.mesh.d012749","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sexually Transmitted Diseases as described in the captured NLM MeSH descriptor D012749","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sexually Transmitted Diseases as: Diseases due to or propagated by sexual contact.","support":[{"end":514,"quote":"Diseases due to or propagated by sexual contact.","source_id":"nlm-mesh.d012749","source_sha256":"3c801aef9b2cf9ed99ce8b95afeb5e644e7888df57da3f7555b4d000f9b2ab01","start":466}],"target_id":"concept.mesh.d012749","target_kind":"node","target_sha256":"3258f6fd40217a1aefc684b3be93700b1e7fa30d1e8bef13e45840b3fcdfafe6"}],"concept.mesh.d012874":[{"id":"assertion.concept.mesh.d012874","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Skin Diseases, Infectious as described in the captured NLM MeSH descriptor D012874","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Skin Diseases, Infectious as: Skin diseases caused by bacteria, fungi, parasites, or viruses.","support":[{"end":579,"quote":"Skin diseases caused by bacteria, fungi, parasites, or viruses.","source_id":"nlm-mesh.d012874","source_sha256":"654a72e3ded7401d00b2298f498ab16755a02eb6789e8267b73272f2f62f8bef","start":516}],"target_id":"concept.mesh.d012874","target_kind":"node","target_sha256":"69e4f203de7a0c6b360e86a057a2405f7b08c07f6c2f88d7a42788c92e8944d8"}],"concept.mesh.d012893":[{"id":"assertion.concept.mesh.d012893","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sleep Wake Disorders as described in the captured NLM MeSH descriptor D012893","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sleep Wake Disorders as: Abnormal sleep-wake schedule or pattern associated with the CIRCADIAN RHYTHM which affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","support":[{"end":558,"quote":"Abnormal sleep-wake schedule or pattern associated with the\nCIRCADIAN RHYTHM\nwhich affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","source_id":"nlm-mesh.d012893","source_sha256":"adbc07672047c3c087280dd3ede229193de139d0c20509b1fb16662cb6d3d3a3","start":376}],"target_id":"concept.mesh.d012893","target_kind":"node","target_sha256":"89c6b7ca189f4b0f9b904e8de4d305072929966dd4095fe650820bb29c405fa5"}],"concept.mesh.d012907":[{"id":"assertion.concept.mesh.d012907","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Smoking as described in the captured NLM MeSH descriptor D012907","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Smoking as: Willful or deliberate act of inhaling and exhaling SMOKE from burning substances or agents held by hand.","support":[{"end":736,"quote":"Willful or deliberate act of inhaling and exhaling\nSMOKE\nfrom burning substances or agents held by hand.","source_id":"nlm-mesh.d012907","source_sha256":"16227790fd20b743f468c8818d1323f7824b776c2b751f33ea93f2625bfab89c","start":632}],"target_id":"concept.mesh.d012907","target_kind":"node","target_sha256":"117c304f3e13c071c0c5f27a7236d385911dca1dffbfce6541ff19d64a59a132"}],"concept.mesh.d012919":[{"id":"assertion.concept.mesh.d012919","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Behavior as described in the captured NLM MeSH descriptor D012919","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Behavior as: Any behavior caused by or affecting another individual or group usually of the same species.","support":[{"end":464,"quote":"Any behavior caused by or affecting another individual or group usually of the same species.","source_id":"nlm-mesh.d012919","source_sha256":"f44d8ecceaf6060a9e38611e05c177e65cfffa68588bc6c29c62ef51dd38770b","start":372}],"target_id":"concept.mesh.d012919","target_kind":"node","target_sha256":"04f14cc0b4af60c892ca0dcae90f980dd521cf2740a1f6e68e3e698fd1a3c06d"}],"concept.mesh.d012935":[{"id":"assertion.concept.mesh.d012935","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Justice as described in the captured NLM MeSH descriptor D012935","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Justice as: An interactive process whereby members of a community are concerned for the equality and rights of all.","support":[{"end":559,"quote":"An interactive process whereby members of a community are concerned for the equality and rights of all.","source_id":"nlm-mesh.d012935","source_sha256":"3e05ac82162b0ff33503093f08260bde855969ab9cae0bd4331976de8670c93f","start":456}],"target_id":"concept.mesh.d012935","target_kind":"node","target_sha256":"da464977d8c10600e1d61e2dc4faec3e549316aa23021dc4c4449ab45410c502"}],"concept.mesh.d012941":[{"id":"assertion.concept.mesh.d012941","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Responsibility as described in the captured NLM MeSH descriptor D012941","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","support":[{"end":474,"quote":"The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","source_id":"nlm-mesh.d012941","source_sha256":"ae1d9d88f3f74f99695ab60f1116643b0f27cbb58162e9c035ebd75abb9d9d27","start":378}],"target_id":"concept.mesh.d012941","target_kind":"node","target_sha256":"300e00ef20940beb66ce7b1180eac26154aea8dfa98c4413e7f3e8cb33ff6994"}],"concept.mesh.d012950":[{"id":"assertion.concept.mesh.d012950","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Socialism as described in the captured NLM MeSH descriptor D012950","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Socialism as: A system of government in which means of production and distribution of goods are controlled by the state.","support":[{"end":507,"quote":"A system of government in which means of production and distribution of goods are controlled by the state.","source_id":"nlm-mesh.d012950","source_sha256":"38bd51a7a319fc945a1879ff847ec02043a2000b93cd861f3de3f8d83a9db31d","start":401}],"target_id":"concept.mesh.d012950","target_kind":"node","target_sha256":"88068a2ce436388d7583827aebdb217c1c53c6384e8aab2347fb3199e6cf43ea"}],"concept.mesh.d013037":[{"id":"assertion.concept.mesh.d013037","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spatial Behavior as described in the captured NLM MeSH descriptor D013037","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spatial Behavior as: Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","support":[{"end":534,"quote":"Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","source_id":"nlm-mesh.d013037","source_sha256":"859767715118b17aabea5ab1f79e9ce9abc8e7584cf46c7e776af7cfa436451d","start":374}],"target_id":"concept.mesh.d013037","target_kind":"node","target_sha256":"bb1859c681492028575289108efa05ca358d6fa13eba6e4b7751037713d7c2cf"}],"concept.mesh.d013140":[{"id":"assertion.concept.mesh.d013140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spiritualism as described in the captured NLM MeSH descriptor D013140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spiritualism as: Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","support":[{"end":568,"quote":"Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","source_id":"nlm-mesh.d013140","source_sha256":"fd466929d4cdc15d45cc63d82565e7206a22fa3a26e06ae7f2bd8dc971eb00e1","start":443}],"target_id":"concept.mesh.d013140","target_kind":"node","target_sha256":"9a08fcb2f5c89dc56597e0889a55785886501ed91f2ad12a743330d94a63c702"}],"concept.mesh.d013219":[{"id":"assertion.concept.mesh.d013219","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"State Government as described in the captured NLM MeSH descriptor D013219","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes State Government as: The level of governmental organization and function below that of the national or country-wide government.","support":[{"end":535,"quote":"The level of governmental organization and function below that of the national or country-wide government.","source_id":"nlm-mesh.d013219","source_sha256":"3d8ecff40a219d2c58aaf62c253336b99aa35239a93ecdf6ffa1e54be3cce29c","start":429}],"target_id":"concept.mesh.d013219","target_kind":"node","target_sha256":"83a104e4f37277273509f8827a7436f8ae50b9c852e56f980be1a6b72cac4e67"}],"concept.mesh.d013239":[{"id":"assertion.concept.mesh.d013239","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereotyped Behavior as described in the captured NLM MeSH descriptor D013239","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereotyped Behavior as: Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","support":[{"end":509,"quote":"Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","source_id":"nlm-mesh.d013239","source_sha256":"57062c4db3736306642d22b0f13026912633ccb90a84207667a574d02cf92df3","start":382}],"target_id":"concept.mesh.d013239","target_kind":"node","target_sha256":"8fc8d885646c7351e833d9c2dfd28b50a47c3ee3429b633f11162def73ea953d"}],"concept.mesh.d013240":[{"id":"assertion.concept.mesh.d013240","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereotyping as described in the captured NLM MeSH descriptor D013240","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereotyping as: An oversimplified perception or conception especially of persons, social groups, etc.","support":[{"end":578,"quote":"An oversimplified perception or conception especially of persons, social groups, etc.","source_id":"nlm-mesh.d013240","source_sha256":"22d9cbcd70b6756c1b451baad510df1e76b5548c009303082c78e51e6af3b57c","start":493}],"target_id":"concept.mesh.d013240","target_kind":"node","target_sha256":"c56915b4be45f0dcb2e0330c34851fce8bc6d07886b1be164bf641dd39cbaf39"}],"concept.mesh.d013359":[{"id":"assertion.concept.mesh.d013359","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sublimation, Psychological as described in the captured NLM MeSH descriptor D013359","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sublimation, Psychological as: A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","support":[{"end":568,"quote":"A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","source_id":"nlm-mesh.d013359","source_sha256":"3ebe948a006e87cf9c824ef5eb0564604c15fd96f0cfa0f41b47802910725736","start":368}],"target_id":"concept.mesh.d013359","target_kind":"node","target_sha256":"ab8efca265f64dc5960e40b63a6cb861862e41a1db3cff017bc1d4cf8044adb4"}],"concept.mesh.d013391":[{"id":"assertion.concept.mesh.d013391","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sucking Behavior as described in the captured NLM MeSH descriptor D013391","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sucking Behavior as: Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","support":[{"end":581,"quote":"Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","source_id":"nlm-mesh.d013391","source_sha256":"ae77d15e6dd2a2adbd75c7b8e54612730b328bf7773b8cf56afab02fecac1eb8","start":374}],"target_id":"concept.mesh.d013391","target_kind":"node","target_sha256":"eef3d8e1a501a32d7e401aa42ae58aa1be203f1c49b8cb8d76ecc7c97edd69da"}],"concept.mesh.d013492":[{"id":"assertion.concept.mesh.d013492","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Suppuration as described in the captured NLM MeSH descriptor D013492","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Suppuration as: A pathologic process consisting in the formation of pus.","support":[{"end":458,"quote":"A pathologic process consisting in the formation of pus.","source_id":"nlm-mesh.d013492","source_sha256":"b68555c0f4caa9edbd78ab9722cccf95e4a5ed8910396afdee701b29ba714184","start":402}],"target_id":"concept.mesh.d013492","target_kind":"node","target_sha256":"bd3faa0b51d5c3c71ba7a9c76cc19fddd824a08f9a205dcc4922185e658e9aa7"}],"concept.mesh.d013561":[{"id":"assertion.concept.mesh.d013561","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Symbolism as described in the captured NLM MeSH descriptor D013561","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Symbolism as: A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","support":[{"end":797,"quote":"A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","source_id":"nlm-mesh.d013561","source_sha256":"d1beadf4d533cf5cc47929129a771be240e4c03e21f9f3778d87a44214caa4a0","start":586}],"target_id":"concept.mesh.d013561","target_kind":"node","target_sha256":"8af8e48c62cadaa0439aa82e3f7aa8a1dd62d1a1f9c97341f3aad1ac83338ca4"}],"concept.mesh.d013598":[{"id":"assertion.concept.mesh.d013598","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Systems Theory as described in the captured NLM MeSH descriptor D013598","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Systems Theory as: Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","support":[{"end":653,"quote":"Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","source_id":"nlm-mesh.d013598","source_sha256":"754408a694fb0c495ddb95071ebda725a5da8e8889c9815b758b081ea808cc04","start":344}],"target_id":"concept.mesh.d013598","target_kind":"node","target_sha256":"bd9f22824d7ca4467e0fca293dbdb88a2e4ef1d2ff9b0a15fcbdd40c88485583"}],"concept.mesh.d013637":[{"id":"assertion.concept.mesh.d013637","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tape Recording as described in the captured NLM MeSH descriptor D013637","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tape Recording as: Recording of information on magnetic or punched paper tape.","support":[{"end":461,"quote":"Recording of information on magnetic or punched paper tape.","source_id":"nlm-mesh.d013637","source_sha256":"c957986719f1c3db108ddf8c918b5c1885f4b6281dec3255edc3a3cdfe8e258f","start":402}],"target_id":"concept.mesh.d013637","target_kind":"node","target_sha256":"5fa94fa9b7c91012e144b5c413024315779b383eea991bb632a080fe1ca1cee9"}],"concept.mesh.d013690":[{"id":"assertion.concept.mesh.d013690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Television as described in the captured NLM MeSH descriptor D013690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Television as: The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","support":[{"end":833,"quote":"The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","source_id":"nlm-mesh.d013690","source_sha256":"6a646c69b59fcca6989f3d877d83051f482105634e111ae3c91b61aa2c3d8240","start":503}],"target_id":"concept.mesh.d013690","target_kind":"node","target_sha256":"c071746d463aecae617348f74d36cc0f7994179c9accece10455a1cab2823899"}],"concept.mesh.d013695":[{"id":"assertion.concept.mesh.d013695","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Temperance as described in the captured NLM MeSH descriptor D013695","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Temperance as: Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","support":[{"end":499,"quote":"Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","source_id":"nlm-mesh.d013695","source_sha256":"d90a25c21caec13e8d1b406a2f76da4ce8b03a15bdc9d63f41ae808d637bb4e3","start":380}],"target_id":"concept.mesh.d013695","target_kind":"node","target_sha256":"7cc29f4f90207693b1b535b978af528af7f13e97c72e62176f66ac84cf04fc6b"}],"concept.mesh.d013800":[{"id":"assertion.concept.mesh.d013800","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Theft as described in the captured NLM MeSH descriptor D013800","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Theft as: Unlawful act of taking property.","support":[{"end":382,"quote":"Unlawful act of taking property.","source_id":"nlm-mesh.d013800","source_sha256":"a9e333a7b18983a12524c2364fe588b0a31cee085fcaaa694c6fceeb6d3dfdde","start":350}],"target_id":"concept.mesh.d013800","target_kind":"node","target_sha256":"d4da3ee23221586b031c9e72b6723800f763c14bb42535a81a41fb7b143fc2fd"}],"concept.mesh.d014039":[{"id":"assertion.concept.mesh.d014039","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Toilet Training as described in the captured NLM MeSH descriptor D014039","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Toilet Training as: Conditioning to defecate and urinate in culturally acceptable places.","support":[{"end":415,"quote":"Conditioning to defecate and urinate in culturally acceptable places.","source_id":"nlm-mesh.d014039","source_sha256":"a2b6cb08cf8754bf7ad7a15a97ce4ab27b4b08110446e0adb4e4e7fef0be8bba","start":346}],"target_id":"concept.mesh.d014039","target_kind":"node","target_sha256":"9b54d8b2ca43f90a84271ff5c27686901b1319b20b98051d4515c457c75464ef"}],"concept.mesh.d014115":[{"id":"assertion.concept.mesh.d014115","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Toxemia as described in the captured NLM MeSH descriptor D014115","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Toxemia as: A condition produced by the presence of toxins or other harmful substances in the BLOOD .","support":[{"end":415,"quote":"A condition produced by the presence of toxins or other harmful substances in the\nBLOOD\n.","source_id":"nlm-mesh.d014115","source_sha256":"0e2af9719f1a7de35fd5dbf5e21a9a09d4c462413bb7857a9395fadd18143301","start":326}],"target_id":"concept.mesh.d014115","target_kind":"node","target_sha256":"46acad0d5246774dbea49f3db5aeea1542e5a4bee4ecb07e6f2d54d45174257d"}],"concept.mesh.d014552":[{"id":"assertion.concept.mesh.d014552","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Urinary Tract Infections as described in the captured NLM MeSH descriptor D014552","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Urinary Tract Infections as: Inflammatory responses of the epithelium of the URINARY TRACT to microbial invasions. They are often bacterial infections with associated BACTERIURIA and PYURIA .","support":[{"end":681,"quote":"Inflammatory responses of the epithelium of the\nURINARY TRACT\nto microbial invasions. They are often bacterial infections with associated\nBACTERIURIA\nand\nPYURIA\n.","source_id":"nlm-mesh.d014552","source_sha256":"9e148e61c9357e10c9a0ca530d529c67c9ebd50afec0fb566114f1a453c4f956","start":519}],"target_id":"concept.mesh.d014552","target_kind":"node","target_sha256":"9117b70277f3727358483a3e94c0985f9b3e3a36b714f0e62f0c4f969b105fe0"}],"concept.mesh.d014601":[{"id":"assertion.concept.mesh.d014601","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Utopias as described in the captured NLM MeSH descriptor D014601","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Utopias as: Ideal perfection especially in laws, government, and social conditions.","support":[{"end":401,"quote":"Ideal perfection especially in laws, government, and social conditions.","source_id":"nlm-mesh.d014601","source_sha256":"0eeb933cb27797f1e921a6fe6790525401c13a99e945132158097be0e5528d9d","start":330}],"target_id":"concept.mesh.d014601","target_kind":"node","target_sha256":"8841c3b20d0b8bdaee4631f480a4cd67d76b0d60e35b6dbf3ff12bc769b1e407"}],"concept.mesh.d014652":[{"id":"assertion.concept.mesh.d014652","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vascular Diseases as described in the captured NLM MeSH descriptor D014652","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vascular Diseases as: Pathological processes involving any of the BLOOD VESSELS in the cardiac or peripheral circulation. They include diseases of ARTERIES ; VEINS ; and rest of the vasculature system in the body.","support":[{"end":775,"quote":"Pathological processes involving any of the\nBLOOD VESSELS\nin the cardiac or peripheral circulation. They include diseases of\nARTERIES\n;\nVEINS\n; and rest of the vasculature system in the body.","source_id":"nlm-mesh.d014652","source_sha256":"4a62c6d1c5d0e1833582df2094e697e6e9d7c379fbb79b8b4c0a77842715417e","start":584}],"target_id":"concept.mesh.d014652","target_kind":"node","target_sha256":"7e7380224bdea1d85faf7a9931ef6d368e5f361c5707547f08769dd3555f9f41"}],"concept.mesh.d014742":[{"id":"assertion.concept.mesh.d014742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Videodisc Recording as described in the captured NLM MeSH descriptor D014742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Videodisc Recording as: The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","support":[{"end":674,"quote":"The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","source_id":"nlm-mesh.d014742","source_sha256":"aa045675bacf90dc2d7a1370bfd110d6130a4fe1d4c8c882a7da61d1c3debd21","start":560}],"target_id":"concept.mesh.d014742","target_kind":"node","target_sha256":"677273be8a141bd5d97d26c46ca5d5f7cec93b63ab5d5b1795ac1c22cc984345"}],"concept.mesh.d014743":[{"id":"assertion.concept.mesh.d014743","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Videotape Recording as described in the captured NLM MeSH descriptor D014743","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Videotape Recording as: Recording of visual and sometimes sound signals on magnetic tape.","support":[{"end":641,"quote":"Recording of visual and sometimes sound signals on magnetic tape.","source_id":"nlm-mesh.d014743","source_sha256":"fcd02b90f6bd5b0c2d02ef32aca34f4f938eea9cf511e8339cf8b7e9abd404df","start":576}],"target_id":"concept.mesh.d014743","target_kind":"node","target_sha256":"093b3600c5f149e4689dfcead07f656c751ff0d2363f5f29d09b88063c05ce44"}],"concept.mesh.d014754":[{"id":"assertion.concept.mesh.d014754","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Violence as described in the captured NLM MeSH descriptor D014754","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Violence as: Use of physical force causing or intent to cause harm, injury or abuse.","support":[{"end":423,"quote":"Use of physical force causing or intent to cause harm, injury or abuse.","source_id":"nlm-mesh.d014754","source_sha256":"1228cd0155018af3f10f1acbc1aa8b71450ed1568cf66329e2136de418e95312","start":352}],"target_id":"concept.mesh.d014754","target_kind":"node","target_sha256":"e912e095ecb171a1f256bcfea1b40a3f70fab382cceee783ed6ddd233f4ee6ff"}],"concept.mesh.d014777":[{"id":"assertion.concept.mesh.d014777","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Virus Diseases as described in the captured NLM MeSH descriptor D014777","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Virus Diseases as: A general term for diseases caused by viruses.","support":[{"end":423,"quote":"A general term for diseases caused by viruses.","source_id":"nlm-mesh.d014777","source_sha256":"0f1c4a43332695813bdab3a3a951ad0574e003784593e2391b5079c1333ea213","start":377}],"target_id":"concept.mesh.d014777","target_kind":"node","target_sha256":"20c89e4ad7fc8a95ad487756fb07c6aae7fe883782c7f9feaf29f0afc953ae3c"}],"concept.mesh.d014799":[{"id":"assertion.concept.mesh.d014799","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vitalism as described in the captured NLM MeSH descriptor D014799","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vitalism as: The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","support":[{"end":1107,"quote":"The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","source_id":"nlm-mesh.d014799","source_sha256":"6c8454abaaa9c100738ba516a5d319b4f814a2e9ee925fcf284fd3eb420b8c40","start":332}],"target_id":"concept.mesh.d014799","target_kind":"node","target_sha256":"5dc62037401ff179595af7aee70a4ab4e4b150fb2c9552ae66380204f9afac5c"}],"concept.mesh.d014858":[{"id":"assertion.concept.mesh.d014858","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"War Crimes as described in the captured NLM MeSH descriptor D014858","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes War Crimes as: Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","support":[{"end":491,"quote":"Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","source_id":"nlm-mesh.d014858","source_sha256":"04470bd2296cc1ab0aadc36667a3d1b6a6d6eee0a5febc77af5bdc0c08144c8c","start":364}],"target_id":"concept.mesh.d014858","target_kind":"node","target_sha256":"fdd09a1cffaa362f00c431c6e0b9a88abb7c5d02bdd43f0306301bcf7019571d"}],"concept.mesh.d014881":[{"id":"assertion.concept.mesh.d014881","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Water Supply as described in the captured NLM MeSH descriptor D014881","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Water Supply as: Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","support":[{"end":634,"quote":"Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","source_id":"nlm-mesh.d014881","source_sha256":"b4e59b65a306a1c916adf16d071806c7f444328dbffa09098685110ae7eaf61b","start":442}],"target_id":"concept.mesh.d014881","target_kind":"node","target_sha256":"c666989c1d6eec6bc85c0d70f7425825a4b35996ae24b6b8917766c654f343d3"}],"concept.mesh.d014946":[{"id":"assertion.concept.mesh.d014946","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wound Infection as described in the captured NLM MeSH descriptor D014946","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wound Infection as: Invasion of a wound by pathogenic microorganisms.","support":[{"end":442,"quote":"Invasion of a wound by pathogenic microorganisms.","source_id":"nlm-mesh.d014946","source_sha256":"3661c55ce0968675d7441f796d3bf75281669fca7e2378b631f8a06f93cd6ced","start":393}],"target_id":"concept.mesh.d014946","target_kind":"node","target_sha256":"0fdbe3d51603fdb8af33e6f1b44846529a03e515f3488fa1cbb51cafb961d067"}],"concept.mesh.d014947":[{"id":"assertion.concept.mesh.d014947","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wounds and Injuries as described in the captured NLM MeSH descriptor D014947","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wounds and Injuries as: Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","support":[{"end":575,"quote":"Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","source_id":"nlm-mesh.d014947","source_sha256":"3c807848e9b1082cc2f6ecb832a6f7f278e55cbddd9314d144f8ed5823cca4bd","start":439}],"target_id":"concept.mesh.d014947","target_kind":"node","target_sha256":"5d6a4d365cb4ad1104f8d366b5e94744be41aab935f6a64b5f19239bf2e19d76"}],"concept.mesh.d015013":[{"id":"assertion.concept.mesh.d015013","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Yoga as described in the captured NLM MeSH descriptor D015013","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Yoga as: A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","support":[{"end":808,"quote":"A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","source_id":"nlm-mesh.d015013","source_sha256":"0b7e88c7b49bb5e5feb9244db1a4904b3b283439edaf9924b9947e1875bc8ad5","start":417}],"target_id":"concept.mesh.d015013","target_kind":"node","target_sha256":"883799578468f2e951f1f07100d055a79dcd2eb1b26940c410320cc82cc14499"}],"concept.mesh.d015047":[{"id":"assertion.concept.mesh.d015047","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Zoonoses as described in the captured NLM MeSH descriptor D015047","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Zoonoses as: Diseases of non-human animals that may be transmitted to HUMANS or may be transmitted from humans to non-human animals.","support":[{"end":628,"quote":"Diseases of non-human animals that may be transmitted to\nHUMANS\nor may be transmitted from humans to non-human animals.","source_id":"nlm-mesh.d015047","source_sha256":"7ff0501e892d4125531a35facca9b86bf8b5dbb077e0e142dead0a09eda66322","start":509}],"target_id":"concept.mesh.d015047","target_kind":"node","target_sha256":"2531998e9acb53b24d8f18ec3a78923a9476d21c42d2e49da5b1c46b6848288f"}],"concept.mesh.d015233":[{"id":"assertion.concept.mesh.d015233","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Statistical as described in the captured NLM MeSH descriptor D015233","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Statistical as: Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","support":[{"end":691,"quote":"Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","source_id":"nlm-mesh.d015233","source_sha256":"7a4bb8d939a38432162df15e9954eea5824c6ed011e602e01b14087d40190d95","start":410}],"target_id":"concept.mesh.d015233","target_kind":"node","target_sha256":"293b658f6e2863d9a8bcea7abde27e5e049dc34a7d92ef10027e22340131e370"}],"concept.mesh.d015438":[{"id":"assertion.concept.mesh.d015438","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Behavior as described in the captured NLM MeSH descriptor D015438","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Behavior as: Combination of HEALTH KNOWLEDGE, ATTITUDES, PRACTICE which underlie actions taken by individuals regarding their health.","support":[{"end":466,"quote":"Combination of\nHEALTH KNOWLEDGE, ATTITUDES, PRACTICE\nwhich underlie actions taken by individuals regarding their health.","source_id":"nlm-mesh.d015438","source_sha256":"c1e6a829596005c482a2ddd8e6ec49a76138b4351cf206c54d1fa8203dd08f17","start":346}],"target_id":"concept.mesh.d015438","target_kind":"node","target_sha256":"2d460aecc026c67f9672863d221e408a5d6fe27d7d063dfb3f0f1d5fc92c0c5e"}],"concept.mesh.d015577":[{"id":"assertion.concept.mesh.d015577","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatric Assessment as described in the captured NLM MeSH descriptor D015577","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatric Assessment as: Evaluation of the level of physical, physiological, or mental functioning in the older population group.","support":[{"end":560,"quote":"Evaluation of the level of physical, physiological, or mental functioning in the older population group.","source_id":"nlm-mesh.d015577","source_sha256":"8b7937a2b358f49efdecf70241c464ab36d70ad0d61359da8898f41f0b515266","start":456}],"target_id":"concept.mesh.d015577","target_kind":"node","target_sha256":"4c08dadcc625eb8eeeae9fa1ba16e8ec88cd706e27e08fd180b480c420460565"}],"concept.mesh.d015619":[{"id":"assertion.concept.mesh.d015619","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory System Abnormalities as described in the captured NLM MeSH descriptor D015619","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory System Abnormalities as: Congenital structural abnormalities of the respiratory system.","support":[{"end":575,"quote":"Congenital structural abnormalities of the respiratory system.","source_id":"nlm-mesh.d015619","source_sha256":"5e5b5da4bf2848ac41618676b7df544f4c17adb2f30f59cba10c2329b44c3d21","start":513}],"target_id":"concept.mesh.d015619","target_kind":"node","target_sha256":"0805fa0c0c15fb96a81e4f40f988ece50174f40e33cca2822471ea981819d8fb"}],"concept.mesh.d015769":[{"id":"assertion.concept.mesh.d015769","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Granuloma, Respiratory Tract as described in the captured NLM MeSH descriptor D015769","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Granuloma, Respiratory Tract as: Granulomatous disorders affecting one or more sites in the respiratory tract.","support":[{"end":461,"quote":"Granulomatous disorders affecting one or more sites in the respiratory tract.","source_id":"nlm-mesh.d015769","source_sha256":"586502221a1a758f1eec429a90922414b52d56dab5808ee0f3f4f71bd779b153","start":384}],"target_id":"concept.mesh.d015769","target_kind":"node","target_sha256":"4add56160c11a7ae8ab063b9e6f54982daa82022fcc95c98ac861286376c28c1"}],"concept.mesh.d015817":[{"id":"assertion.concept.mesh.d015817","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eye Infections as described in the captured NLM MeSH descriptor D015817","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eye Infections as: Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","support":[{"end":596,"quote":"Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","source_id":"nlm-mesh.d015817","source_sha256":"4d3553d38f2e71a4c4f15bc4a8d963fef1bc143ad890fcfa5708486f7b50ea6c","start":394}],"target_id":"concept.mesh.d015817","target_kind":"node","target_sha256":"12655c6f46ef77d2cd4d533282cc6f56479767d3f2bd59a6625cab80e1ed8a80"}],"concept.mesh.d015984":[{"id":"assertion.concept.mesh.d015984","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Causality as described in the captured NLM MeSH descriptor D015984","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Causality as: The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","support":[{"end":899,"quote":"The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","source_id":"nlm-mesh.d015984","source_sha256":"051190e1af34bfd7ee7e95569b96899a8bd8ff58e104344efe87a49bce90a01e","start":522}],"target_id":"concept.mesh.d015984","target_kind":"node","target_sha256":"d95b9058e92a093419feda2a80ae5690dab1fe1a83c1d5b5e95358aac48b78cd"}],"concept.mesh.d015985":[{"id":"assertion.concept.mesh.d015985","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precipitating Factors as described in the captured NLM MeSH descriptor D015985","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precipitating Factors as: Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","support":[{"end":864,"quote":"Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","source_id":"nlm-mesh.d015985","source_sha256":"f0d6c58ec811e9aff8c9a08fc1c4f896e06217501ba2a256ef40871fa7be5e13","start":476}],"target_id":"concept.mesh.d015985","target_kind":"node","target_sha256":"4036b0fd9568fa520a38ce7ca625186f2783badeab636cff0cd6e8f85ea461af"}],"concept.mesh.d016013":[{"id":"assertion.concept.mesh.d016013","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Likelihood Functions as described in the captured NLM MeSH descriptor D016013","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Likelihood Functions as: Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","support":[{"end":793,"quote":"Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","source_id":"nlm-mesh.d016013","source_sha256":"dc819be1e885310bc038a2e72370af9d40917486c2252983bf886bc12b1efdbc","start":519}],"target_id":"concept.mesh.d016013","target_kind":"node","target_sha256":"72316acff270403f05b8135b2f72b14098abdcae7fe663aea38d85d22a4539be"}],"concept.mesh.d016014":[{"id":"assertion.concept.mesh.d016014","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Linear Models as described in the captured NLM MeSH descriptor D016014","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Linear Models as: Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","support":[{"end":690,"quote":"Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","source_id":"nlm-mesh.d016014","source_sha256":"dbb0ca6a4546f586a426e662ba421984c22f639a7086a3a5d5a82f910e6a2477","start":505}],"target_id":"concept.mesh.d016014","target_kind":"node","target_sha256":"4f9208447a5dfcfe47ccb4becab3b1d13af0561667d4a97a6b55abae7ed1ba30"}],"concept.mesh.d016015":[{"id":"assertion.concept.mesh.d016015","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Logistic Models as described in the captured NLM MeSH descriptor D016015","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Logistic Models as: Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","support":[{"end":955,"quote":"Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","source_id":"nlm-mesh.d016015","source_sha256":"0a915438f1d7defb0c756341c1ab4170af166b92e61f0bde89719488bcfd43f6","start":589}],"target_id":"concept.mesh.d016015","target_kind":"node","target_sha256":"513f5b651b87843de5e9e89b48db636642de8dc9992f5180a831d51554fcb264"}],"concept.mesh.d016249":[{"id":"assertion.concept.mesh.d016249","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optical Storage Devices as described in the captured NLM MeSH descriptor D016249","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optical Storage Devices as: A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","support":[{"end":669,"quote":"A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","source_id":"nlm-mesh.d016249","source_sha256":"81519b74f083c0330a9c2ec7b567df07a504e29539e558520c404e1e1bda20bc","start":422}],"target_id":"concept.mesh.d016249","target_kind":"node","target_sha256":"bb8300b8cf42db6954bd7c37422e412a5f46e5a944ffcb778720b1f50409b9ab"}],"concept.mesh.d016265":[{"id":"assertion.concept.mesh.d016265","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Conflict of Interest as described in the captured NLM MeSH descriptor D016265","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Conflict of Interest as: A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","support":[{"end":741,"quote":"A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","source_id":"nlm-mesh.d016265","source_sha256":"9a5c9620bb1103f8f4ab3164469dada2631ab3baab710f31daa1db717c5c32a1","start":376}],"target_id":"concept.mesh.d016265","target_kind":"node","target_sha256":"c9b5bed2420db18b59d7b3e8a98c601c2251818f99e19b363c80ffa233b1055c"}],"concept.mesh.d016459":[{"id":"assertion.concept.mesh.d016459","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prosthesis-Related Infections as described in the captured NLM MeSH descriptor D016459","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prosthesis-Related Infections as: Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","support":[{"end":759,"quote":"Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","source_id":"nlm-mesh.d016459","source_sha256":"83b5701defeb677b04195ff701845e699e59ed5fc6315ac28bcee7fc88f88931","start":569}],"target_id":"concept.mesh.d016459","target_kind":"node","target_sha256":"7a01d2423467b4b6d47a3ed3f15d873fbcb778beece5dd476d22d8bfd2f0f09c"}],"concept.mesh.d016609":[{"id":"assertion.concept.mesh.d016609","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Second Primary as described in the captured NLM MeSH descriptor D016609","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Second Primary as: Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","support":[{"end":1311,"quote":"Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","source_id":"nlm-mesh.d016609","source_sha256":"a492e0cd1c2f63f4756bf60b9c5b55575bfd09c6921a24668549babae66a720d","start":836}],"target_id":"concept.mesh.d016609","target_kind":"node","target_sha256":"55524ada603e213eb629fe419755f53a36fd83be75f63386be003aa6ccd999c5"}],"concept.mesh.d016709":[{"id":"assertion.concept.mesh.d016709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Yin-Yang as described in the captured NLM MeSH descriptor D016709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Yin-Yang as: In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","support":[{"end":1186,"quote":"In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","source_id":"nlm-mesh.d016709","source_sha256":"66713cd88924c4bc53e616294b8c54a54c07ca7e8f28c306c3e1c5a9d22a246b","start":488}],"target_id":"concept.mesh.d016709","target_kind":"node","target_sha256":"5dadf374c808165521961c0fb0c372329a85b6bbfa8ab3fd0881a62fd542a632"}],"concept.mesh.d016743":[{"id":"assertion.concept.mesh.d016743","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mental Competency as described in the captured NLM MeSH descriptor D016743","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mental Competency as: The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","support":[{"end":697,"quote":"The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","source_id":"nlm-mesh.d016743","source_sha256":"d81e2d972fc0380979449450a39387ee26fb1f0707433d4fb19d16035548e4d8","start":564}],"target_id":"concept.mesh.d016743","target_kind":"node","target_sha256":"2af7237dcda83f8ae4f0d25fc48041b749b8425677deca9cacf443db25a3b2cc"}],"concept.mesh.d017004":[{"id":"assertion.concept.mesh.d017004","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Codependency, Psychological as described in the captured NLM MeSH descriptor D017004","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Codependency, Psychological as: A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","support":[{"end":481,"quote":"A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","source_id":"nlm-mesh.d017004","source_sha256":"42bee99debc3107336e595d44e7143d0001421266595ceb1468eb96a348f7b1f","start":370}],"target_id":"concept.mesh.d017004","target_kind":"node","target_sha256":"db28cd87e220b6589ede0bba80a9b90b495367fb7d9acf82a3c485b73fa284a8"}],"concept.mesh.d017063":[{"id":"assertion.concept.mesh.d017063","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Outcome Assessment, Health Care as described in the captured NLM MeSH descriptor D017063","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Outcome Assessment, Health Care as: Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","support":[{"end":928,"quote":"Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","source_id":"nlm-mesh.d017063","source_sha256":"41fe37665eb9fb7aefbe8f8db306f305e60133ffc6c7384a17da66363b911f4c","start":633}],"target_id":"concept.mesh.d017063","target_kind":"node","target_sha256":"fdac575e3f3a9e0603e7771713665f66ccd7eadd02706e6eb9cb5ade590f2b29"}],"concept.mesh.d017143":[{"id":"assertion.concept.mesh.d017143","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fuzzy Logic as described in the captured NLM MeSH descriptor D017143","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fuzzy Logic as: Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","support":[{"end":738,"quote":"Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","source_id":"nlm-mesh.d017143","source_sha256":"bfcde8e143d3b5ec7b6c62624dc8c792ae1e4a63427ade614f3d6110f9b41529","start":374}],"target_id":"concept.mesh.d017143","target_kind":"node","target_sha256":"a947de38d1b4f80e2c8b63508eac729b7f90d9cd4891ce41468db7c903446086"}],"concept.mesh.d017149":[{"id":"assertion.concept.mesh.d017149","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Private Sector as described in the captured NLM MeSH descriptor D017149","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","support":[{"end":596,"quote":"That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","source_id":"nlm-mesh.d017149","source_sha256":"11d32d456149e495e6ab26b2c77d27025f776138761dcc1e21c9465e0fa2c25e","start":438}],"target_id":"concept.mesh.d017149","target_kind":"node","target_sha256":"07d3390cec527b9b5ac76ab7f8ac654c77510e727c1e442442faf1fe2fd5e608"}],"concept.mesh.d017150":[{"id":"assertion.concept.mesh.d017150","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Public Sector as described in the captured NLM MeSH descriptor D017150","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Public Sector as: The area of a nation's economy that is tax-supported and under government control.","support":[{"end":517,"quote":"The area of a nation's economy that is tax-supported and under government control.","source_id":"nlm-mesh.d017150","source_sha256":"8c888f9327fd0b128f9735dbb0795f21d454a0115aa24bca6e6018ade4045770","start":435}],"target_id":"concept.mesh.d017150","target_kind":"node","target_sha256":"bb674304c1f8a842c3cb37bb151f2102f5bd0f6563ab4c3ee43a4ccd9325f731"}],"concept.mesh.d017169":[{"id":"assertion.concept.mesh.d017169","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Post-Traumatic as described in the captured NLM MeSH descriptor D017169","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Post-Traumatic as: Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","support":[{"end":539,"quote":"Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","source_id":"nlm-mesh.d017169","source_sha256":"0d11e708529c853b2a555b4ad4c81a56d6cb472cccf979e7e05374a8a555b8f4","start":438}],"target_id":"concept.mesh.d017169","target_kind":"node","target_sha256":"dbf5002c7e9dc4f46e05e249dacdfa4db0c85ff08210faf1dfa421800332fb99"}],"concept.mesh.d017533":[{"id":"assertion.concept.mesh.d017533","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Marital Status as described in the captured NLM MeSH descriptor D017533","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Marital Status as: A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness ( SINGLE PERSON ), etc.","support":[{"end":716,"quote":"A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness (\nSINGLE PERSON\n), etc.","source_id":"nlm-mesh.d017533","source_sha256":"8a6a6372c1a3533308854e577fcee34ff2d4b7ff20b9164f86e8f363686e14e9","start":583}],"target_id":"concept.mesh.d017533","target_kind":"node","target_sha256":"b2a6276e929e7d815e8bf937ab4cc8bdbbec6754a2001ee9aaa936e87cce31e0"}],"concept.mesh.d017677":[{"id":"assertion.concept.mesh.d017677","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Age Distribution as described in the captured NLM MeSH descriptor D017677","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Age Distribution as: The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","support":[{"end":737,"quote":"The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","source_id":"nlm-mesh.d017677","source_sha256":"be66664dfad1833fed8eb0bbced9b488e9da423902b25a9ec953b69349578edb","start":452}],"target_id":"concept.mesh.d017677","target_kind":"node","target_sha256":"6570009549d9461cd987864a214a5a4e47a0ed0f8080d65bd9c6a1de97425634"}],"concept.mesh.d017678":[{"id":"assertion.concept.mesh.d017678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Distribution as described in the captured NLM MeSH descriptor D017678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Distribution as: The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","support":[{"end":739,"quote":"The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","source_id":"nlm-mesh.d017678","source_sha256":"b833b36b39893b05043a28e8021b09d2f9a5b601f922a26bf90c406a08a8797b","start":452}],"target_id":"concept.mesh.d017678","target_kind":"node","target_sha256":"b7621a05042e6387e72b606dc4d1762f0e33244955135c35e08a92a72b34849e"}],"concept.mesh.d017712":[{"id":"assertion.concept.mesh.d017712","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Peer Review, Research as described in the captured NLM MeSH descriptor D017712","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Peer Review, Research as: The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","support":[{"end":771,"quote":"The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","source_id":"nlm-mesh.d017712","source_sha256":"4e12c4ffe63c246f66fdc50ebf9651bd3a637d4d8ac24167e6236e372c629a8b","start":446}],"target_id":"concept.mesh.d017712","target_kind":"node","target_sha256":"948e590034d8291ffd23bfa1a9a5ade88fd88496ab1daa448cd35c895bdcb0a6"}],"concept.mesh.d017714":[{"id":"assertion.concept.mesh.d017714","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community-Acquired Infections as described in the captured NLM MeSH descriptor D017714","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community-Acquired Infections as: Any infection acquired in the community, that is, contrasted with those acquired in a health care facility ( CROSS INFECTION ). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","support":[{"end":869,"quote":"Any infection acquired in the community, that is, contrasted with those acquired in a health care facility (\nCROSS INFECTION\n). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","source_id":"nlm-mesh.d017714","source_sha256":"a8f68af21897015f69c858fe005103aa886be91b9be613f3729b075bcece825f","start":543}],"target_id":"concept.mesh.d017714","target_kind":"node","target_sha256":"a21d3e37f0a71a2f7a656924446de547f6a013adab2ed2c39e2d42ec14f89c58"}],"concept.mesh.d018376":[{"id":"assertion.concept.mesh.d018376","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Abnormalities as described in the captured NLM MeSH descriptor D018376","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Abnormalities as: Congenital, inherited, or acquired anomalies of the CARDIOVASCULAR SYSTEM , including the HEART and BLOOD VESSELS .","support":[{"end":630,"quote":"Congenital, inherited, or acquired anomalies of the\nCARDIOVASCULAR SYSTEM\n, including the\nHEART\nand\nBLOOD VESSELS\n.","source_id":"nlm-mesh.d018376","source_sha256":"5b2c511b206eddac6c37fbebea42fc7bfc18243e3f4b8106c3328bd0f456eda0","start":515}],"target_id":"concept.mesh.d018376","target_kind":"node","target_sha256":"e682198456d99d9ba94f49a765a8bfc2b16497c5a82e96ff2a60ea3e04a63ca0"}],"concept.mesh.d018401":[{"id":"assertion.concept.mesh.d018401","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sample Size as described in the captured NLM MeSH descriptor D018401","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sample Size as: The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","support":[{"end":802,"quote":"The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","source_id":"nlm-mesh.d018401","source_sha256":"04ac382c2a9d51766614ada8600a568e4f23a74d8e912c9accedac8aafdd6fb5","start":508}],"target_id":"concept.mesh.d018401","target_kind":"node","target_sha256":"f9be95644312ff9ee12fde528cc89caffe1e0903c4e9d4c3f7b6242691768c0b"}],"concept.mesh.d018461":[{"id":"assertion.concept.mesh.d018461","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Soft Tissue Infections as described in the captured NLM MeSH descriptor D018461","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Soft Tissue Infections as: Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","support":[{"end":972,"quote":"Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","source_id":"nlm-mesh.d018461","source_sha256":"d90a090e254af6558158529410c05e49e92c64c4230257f65d760db6ce6a8044","start":460}],"target_id":"concept.mesh.d018461","target_kind":"node","target_sha256":"cb9e6db40d0b50d10e5711d38b5b905aa5bb89857ed4bbce4521aa3c15081d8f"}],"concept.mesh.d018511":[{"id":"assertion.concept.mesh.d018511","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Systems Integration as described in the captured NLM MeSH descriptor D018511","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Systems Integration as: The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","support":[{"end":579,"quote":"The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","source_id":"nlm-mesh.d018511","source_sha256":"40fe7232079c9e97cf68eedc29ba4f8d9383a12a2f299945385dce076d43536f","start":366}],"target_id":"concept.mesh.d018511","target_kind":"node","target_sha256":"375f3fe2bbeec196e485bb37e864c3449871fd029eb0080bd207bd11ac8329f7"}],"concept.mesh.d018581":[{"id":"assertion.concept.mesh.d018581","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology Transfer as described in the captured NLM MeSH descriptor D018581","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology Transfer as: Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","support":[{"end":855,"quote":"Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","source_id":"nlm-mesh.d018581","source_sha256":"de5f4d14c251e0c391c6639c3b66609f242cad2b122f0e97ef3e044f2b2fbb37","start":370}],"target_id":"concept.mesh.d018581","target_kind":"node","target_sha256":"2ced3cd889e4ffafb1db8b23f077b6151a909f9017224f9066de9629ee59f60f"}],"concept.mesh.d018594":[{"id":"assertion.concept.mesh.d018594","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Body as described in the captured NLM MeSH descriptor D018594","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Body as: The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","support":[{"end":722,"quote":"The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d018594","source_sha256":"ef56a524a7584b113f328926656c8618a5419334a212266ef2d1cd8d26f5aba7","start":463}],"target_id":"concept.mesh.d018594","target_kind":"node","target_sha256":"84bd374ca9ab6a5bfc741c6ca88f8d26f593ad3f079655f60ddc35769e424c0d"}],"concept.mesh.d018595":[{"id":"assertion.concept.mesh.d018595","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Colonialism as described in the captured NLM MeSH descriptor D018595","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Colonialism as: The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","support":[{"end":801,"quote":"The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d018595","source_sha256":"6b8a7cfbf776e39961be5dba0b19337e522b24c0ea3489ff7a6a059665f536f2","start":380}],"target_id":"concept.mesh.d018595","target_kind":"node","target_sha256":"d3c0427540357b9df3107512cc6a5636b8d4e311a19244fe130048c330c84e3c"}],"concept.mesh.d018596":[{"id":"assertion.concept.mesh.d018596","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hinduism as described in the captured NLM MeSH descriptor D018596","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hinduism as: A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","support":[{"end":781,"quote":"A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","source_id":"nlm-mesh.d018596","source_sha256":"0f9f31bac3ff1cc382db4a06c629834c46ad7ff49ea51d000c48f74ee5dfe341","start":373}],"target_id":"concept.mesh.d018596","target_kind":"node","target_sha256":"042b25d39a3ffd46062cb7bb23a1d047e903bb5a139bd6ffa04a03a105b5811e"}],"concept.mesh.d018597":[{"id":"assertion.concept.mesh.d018597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Saints as described in the captured NLM MeSH descriptor D018597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Saints as: Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","support":[{"end":658,"quote":"Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","source_id":"nlm-mesh.d018597","source_sha256":"43bcc3daaf51d66e3870758e7fd61070bf658f328da4e3d52f536fff8039e813","start":468}],"target_id":"concept.mesh.d018597","target_kind":"node","target_sha256":"cf1edec667de4fc4be714641d08a6798dfc66ba6a37628b0ec8597986c4337bc"}],"concept.mesh.d018715":[{"id":"assertion.concept.mesh.d018715","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microscopy, Video as described in the captured NLM MeSH descriptor D018715","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microscopy, Video as: Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in TELEPATHOLOGY .","support":[{"end":637,"quote":"Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in\nTELEPATHOLOGY\n.","source_id":"nlm-mesh.d018715","source_sha256":"cb64ac71c08c22c21675bf0df911199fecbfd8a94a1892bbbe766f3eafcdece6","start":461}],"target_id":"concept.mesh.d018715","target_kind":"node","target_sha256":"8459f6062fbd80c3758de7fd1c054f8f9bb273015cbd5b162758191d76ae902e"}],"concept.mesh.d018805":[{"id":"assertion.concept.mesh.d018805","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sepsis as described in the captured NLM MeSH descriptor D018805","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sepsis as: Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by HYPOTENSION despite adequate fluid infusion, it is called SEPTIC SHOCK .","support":[{"end":736,"quote":"Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by\nHYPOTENSION\ndespite adequate fluid infusion, it is called\nSEPTIC SHOCK\n.","source_id":"nlm-mesh.d018805","source_sha256":"38618eee0cd694e4ece1e6627f891e2f570e7107b97859dd79219a1347324f09","start":433}],"target_id":"concept.mesh.d018805","target_kind":"node","target_sha256":"e59964344d7d671712a76d43b7786be9e8249b2d29d8e850ad3045ccd21cfa8b"}],"concept.mesh.d018939":[{"id":"assertion.concept.mesh.d018939","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Holistic Nursing as described in the captured NLM MeSH descriptor D018939","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Holistic Nursing as: A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","support":[{"end":731,"quote":"A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","source_id":"nlm-mesh.d018939","source_sha256":"37e1b5026cf6455dbcebee07a0e2c214b5379f0ea3fd1ec2150048e5aeb56500","start":384}],"target_id":"concept.mesh.d018939","target_kind":"node","target_sha256":"bcd1ccec3063f530d2b956c06443e3e33cc261ae7a9781515b3a1e4983a0da88"}],"concept.mesh.d019149":[{"id":"assertion.concept.mesh.d019149","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioreactors as described in the captured NLM MeSH descriptor D019149","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioreactors as: Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","support":[{"end":701,"quote":"Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","source_id":"nlm-mesh.d019149","source_sha256":"d754453309506c8db66dde858b3b212680ebd8da3bd6deab67ef078bfcfd3015","start":350}],"target_id":"concept.mesh.d019149","target_kind":"node","target_sha256":"690550c7c76ce47855adb68769c2848815632484e39052936b94779683982f25"}],"concept.mesh.d019212":[{"id":"assertion.concept.mesh.d019212","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multimedia as described in the captured NLM MeSH descriptor D019212","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multimedia as: Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","support":[{"end":675,"quote":"Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","source_id":"nlm-mesh.d019212","source_sha256":"55538be03ffb898c11a99ab9441f027a20766a8e0db744857ce49e40cac6b4a4","start":495}],"target_id":"concept.mesh.d019212","target_kind":"node","target_sha256":"7310a256d13dfca606fc1dd5d443e6c4558e4659d13fec37dadf19e575d49eb1"}],"concept.mesh.d019348":[{"id":"assertion.concept.mesh.d019348","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Empiricism as described in the captured NLM MeSH descriptor D019348","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Empiricism as: One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":1180,"quote":"One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019348","source_sha256":"772e3d46932c2a14cbe60d22363ae0d3fa406ed1670ee40f5d0855a808b713cb","start":340}],"target_id":"concept.mesh.d019348","target_kind":"node","target_sha256":"226baa128a6f07f0969b23abbebdd0926fe607322383cc0a3590144b16a5bc14"}],"concept.mesh.d019352":[{"id":"assertion.concept.mesh.d019352","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Censuses as described in the captured NLM MeSH descriptor D019352","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Censuses as: Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","support":[{"end":1108,"quote":"Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","source_id":"nlm-mesh.d019352","source_sha256":"9826f7f79961f655b6d6f577b933cb24964916081f158c3bf6258ac39bc8c3ac","start":420}],"target_id":"concept.mesh.d019352","target_kind":"node","target_sha256":"4ee3be37cddc798a42fdd64d187e20864135cede20523de1e5964d09b5ddf583"}],"concept.mesh.d019356":[{"id":"assertion.concept.mesh.d019356","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Grave Robbing as described in the captured NLM MeSH descriptor D019356","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Grave Robbing as: Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","support":[{"end":911,"quote":"Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","source_id":"nlm-mesh.d019356","source_sha256":"40f5635692116957eaacf79ace1334f5b1ec1dcf90a89b9cd940ec1ca2e9e8dd","start":433}],"target_id":"concept.mesh.d019356","target_kind":"node","target_sha256":"48dc9ef85b2818ac7bcf5f427d2ddd9894a6d51742d3735b0d9fa8a654883bb4"}],"concept.mesh.d019359":[{"id":"assertion.concept.mesh.d019359","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Knowledge as described in the captured NLM MeSH descriptor D019359","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Knowledge as: The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","support":[{"end":823,"quote":"The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","source_id":"nlm-mesh.d019359","source_sha256":"3b8b795f1b62cc759cbcd8723538c90b8ee3343d1c71fc1035b38fcd1b8beb3f","start":663}],"target_id":"concept.mesh.d019359","target_kind":"node","target_sha256":"85fa239229172448ad1853a569a365ca9315609824d5b5ec81e39a0bcc44eb20"}],"concept.mesh.d019364":[{"id":"assertion.concept.mesh.d019364","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humoralism as described in the captured NLM MeSH descriptor D019364","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humoralism as: An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","support":[{"end":515,"quote":"An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","source_id":"nlm-mesh.d019364","source_sha256":"0e33099787af675d0c39cb09e0220f22c464cfe474bec867309bd667ed3152f9","start":340}],"target_id":"concept.mesh.d019364","target_kind":"node","target_sha256":"fc64af52923f8b884e4ef3b4608f2ce6b815c19bbf814335ec80cc889aba1e80"}],"concept.mesh.d019365":[{"id":"assertion.concept.mesh.d019365","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metaphor as described in the captured NLM MeSH descriptor D019365","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metaphor as: The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","support":[{"end":796,"quote":"The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","source_id":"nlm-mesh.d019365","source_sha256":"c45bf11c549422bb8415d53040be916d47e91bada869f0627cffa4a41fee22d8","start":404}],"target_id":"concept.mesh.d019365","target_kind":"node","target_sha256":"4933922e8ec3c591a9b204ba60e4b5b1bbb17e48ce11728fde914b4a8a77e649"}],"concept.mesh.d019368":[{"id":"assertion.concept.mesh.d019368","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nature as described in the captured NLM MeSH descriptor D019368","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nature as: The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":758,"quote":"The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019368","source_sha256":"93844a2e3ec32dd176b5002c3c6f1cee83493ec50bc81476e22d92a052f5897a","start":529}],"target_id":"concept.mesh.d019368","target_kind":"node","target_sha256":"29fb2f4ad7ff6299334f4ca2aee8dc8b00f93afccf7629f29408d0964bc4d85e"}],"concept.mesh.d019369":[{"id":"assertion.concept.mesh.d019369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Life as described in the captured NLM MeSH descriptor D019369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Life as: The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":848,"quote":"The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019369","source_sha256":"f6a2da185a53cfa11214e925464f1dc0a629b5173ca0b795e0eda04b8f4ac4fe","start":324}],"target_id":"concept.mesh.d019369","target_kind":"node","target_sha256":"c53cef83b2c8804a5d4707611be6b61a5828c7d624623feaf4cd1da179d7f9ee"}],"concept.mesh.d019413":[{"id":"assertion.concept.mesh.d019413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Qi as described in the captured NLM MeSH descriptor D019413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Qi as: The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","support":[{"end":973,"quote":"The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","source_id":"nlm-mesh.d019413","source_sha256":"eb59e00517d3d38347aea00b116814657bc56818c96bb9ecee12d04a5aeb74a9","start":382}],"target_id":"concept.mesh.d019413","target_kind":"node","target_sha256":"f6a52efa3c5fbe571e5e5375c48230771019b0efb09c61eee75582a25797b7a4"}],"concept.mesh.d019456":[{"id":"assertion.concept.mesh.d019456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Transition as described in the captured NLM MeSH descriptor D019456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Transition as: Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","support":[{"end":1156,"quote":"Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","source_id":"nlm-mesh.d019456","source_sha256":"77b5e538a4f196a506fc6740b8113f26ea97d702770070474c8d9e43bf169471","start":478}],"target_id":"concept.mesh.d019456","target_kind":"node","target_sha256":"e5a7f7469f0d18788f334a0f2128d26cb6ce7cbd1d944a125c40a36316b109c7"}],"concept.mesh.d019513":[{"id":"assertion.concept.mesh.d019513","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feminism as described in the captured NLM MeSH descriptor D019513","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feminism as: The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","support":[{"end":543,"quote":"The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","source_id":"nlm-mesh.d019513","source_sha256":"d0bc7c1d9351499c04cd2a396ce245bd658fe20abe2b74f0efbe83bc1e9be2b7","start":364}],"target_id":"concept.mesh.d019513","target_kind":"node","target_sha256":"614ce4d87a6bb00903e99eb6cf5d153d7d589ebf1e9c468bd94d80f6d907b637"}],"concept.mesh.d019636":[{"id":"assertion.concept.mesh.d019636","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurodegenerative Diseases as described in the captured NLM MeSH descriptor D019636","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurodegenerative Diseases as: Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","support":[{"end":702,"quote":"Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","source_id":"nlm-mesh.d019636","source_sha256":"39286b297e5eb67a2d510e2184a2a2a016099c89def59816b272bac6668fac6d","start":486}],"target_id":"concept.mesh.d019636","target_kind":"node","target_sha256":"ad9c3ada71714eda34406ad42f2d83a8a6bb350502740e6d731a3991c61c642d"}],"concept.mesh.d019954":[{"id":"assertion.concept.mesh.d019954","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurobehavioral Manifestations as described in the captured NLM MeSH descriptor D019954","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurobehavioral Manifestations as: Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","support":[{"end":669,"quote":"Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","source_id":"nlm-mesh.d019954","source_sha256":"230fab51794b5d63a024e0a4b9ad64212550075f0ce429d5932e3f86075ca6dc","start":433}],"target_id":"concept.mesh.d019954","target_kind":"node","target_sha256":"3e939ea61442bc0e1ae0de2fc1e9b487cd37d58a570dd502bcae21174bd5f913"}],"concept.mesh.d020196":[{"id":"assertion.concept.mesh.d020196","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Trauma, Nervous System as described in the captured NLM MeSH descriptor D020196","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Trauma, Nervous System as: Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","support":[{"end":620,"quote":"Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","source_id":"nlm-mesh.d020196","source_sha256":"2db1895013b71852dc309bf2adda0d9a08da61e6220e45b7abe19456a6842855","start":446}],"target_id":"concept.mesh.d020196","target_kind":"node","target_sha256":"5cd0afe79f8a27a810f0c25c9cb99ebdf740d8a9a42d308fda39d94369e56570"}],"concept.mesh.d020258":[{"id":"assertion.concept.mesh.d020258","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurotoxicity Syndromes as described in the captured NLM MeSH descriptor D020258","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurotoxicity Syndromes as: Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","support":[{"end":581,"quote":"Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","source_id":"nlm-mesh.d020258","source_sha256":"d876b8094e385054b0032c131d6962039043f400af0a6234a1b400294f43574e","start":370}],"target_id":"concept.mesh.d020258","target_kind":"node","target_sha256":"e61bcbd75e435aafffe593f9d245a09ba3f72a7cdf995759f945281fe654000e"}],"concept.mesh.d020274":[{"id":"assertion.concept.mesh.d020274","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autoimmune Diseases of the Nervous System as described in the captured NLM MeSH descriptor D020274","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autoimmune Diseases of the Nervous System as: Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g., MULTIPLE SCLEROSIS ) or the peripheral nervous system (e.g., GUILLAIN-BARRE SYNDROME ).","support":[{"end":748,"quote":"Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g.,\nMULTIPLE SCLEROSIS\n) or the peripheral nervous system (e.g.,\nGUILLAIN-BARRE SYNDROME\n).","source_id":"nlm-mesh.d020274","source_sha256":"8b0bc605ea655d29cfd94a864702efa6c87e704688ef01f9cb31d263406863ea","start":406}],"target_id":"concept.mesh.d020274","target_kind":"node","target_sha256":"045baf4eac5943bb1390448c765fcfedf5315e41c6e52a9dcc43d24ed28a8c9a"}],"concept.mesh.d020650":[{"id":"assertion.concept.mesh.d020650","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Combinatorial Chemistry Techniques as described in the captured NLM MeSH descriptor D020650","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Combinatorial Chemistry Techniques as: A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","support":[{"end":565,"quote":"A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","source_id":"nlm-mesh.d020650","source_sha256":"711c4e8c5e22edfa2a39044601cc8a2fa393e5a2f6ba19aa3bd03db273db527e","start":404}],"target_id":"concept.mesh.d020650","target_kind":"node","target_sha256":"2fe0b330808be5b771e0542110ee77228b2f549a008c816f698f50df9083f652"}],"concept.mesh.d020752":[{"id":"assertion.concept.mesh.d020752","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurocutaneous Syndromes as described in the captured NLM MeSH descriptor D020752","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurocutaneous Syndromes as: A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","support":[{"end":660,"quote":"A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","source_id":"nlm-mesh.d020752","source_sha256":"48bb45bd74512d9bb70691055085308ada78fb9414b4bd6d64b0b3cc0ec970e0","start":522}],"target_id":"concept.mesh.d020752","target_kind":"node","target_sha256":"a3720b952c4c2f17bb062c4ccd7eb0fe10b32f579357752a68accb43fab1a6bf"}],"concept.mesh.d021081":[{"id":"assertion.concept.mesh.d021081","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chronobiology Disorders as described in the captured NLM MeSH descriptor D021081","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chronobiology Disorders as: Disruptions of the rhythmic cycle of bodily functions or activities.","support":[{"end":426,"quote":"Disruptions of the rhythmic cycle of bodily functions or activities.","source_id":"nlm-mesh.d021081","source_sha256":"8adc893f4b3f8c9f4d21deb26abcfdee0f9094de601b13ba28d49a853b4e05bc","start":358}],"target_id":"concept.mesh.d021081","target_kind":"node","target_sha256":"1fb4bccf2d5ef1d6ff0a5d89c0579bb7b59c0a2c40fd7bc29e9259eeb6fb4370"}],"concept.mesh.d024803":[{"id":"assertion.concept.mesh.d024803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Enhancement as described in the captured NLM MeSH descriptor D024803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Enhancement as: The use of technology-based interventions to improve functional capacities rather than to treat disease.","support":[{"end":480,"quote":"The use of technology-based interventions to improve functional capacities rather than to treat disease.","source_id":"nlm-mesh.d024803","source_sha256":"c8168416acf1bc833bbfaef01465293827ea4feb4037a86b29b45a97f0929af6","start":376}],"target_id":"concept.mesh.d024803","target_kind":"node","target_sha256":"a0154c928d196fcffb5f068066a5e0f10e1c5e396df981fa3e6078ebd4836e8e"}],"concept.mesh.d024861":[{"id":"assertion.concept.mesh.d024861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Enhancement as described in the captured NLM MeSH descriptor D024861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Enhancement as: The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","support":[{"end":564,"quote":"The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","source_id":"nlm-mesh.d024861","source_sha256":"0082884b277d0128a9809d07c005ad97917d3eb3ab8a152aa54cfa26f26e4064","start":454}],"target_id":"concept.mesh.d024861","target_kind":"node","target_sha256":"4e1282ab39ff25d620b24b035577dad05edeb2343032000c6aab706844cd73b4"}],"concept.mesh.d026684":[{"id":"assertion.concept.mesh.d026684","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personal Autonomy as described in the captured NLM MeSH descriptor D026684","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personal Autonomy as: Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","support":[{"end":588,"quote":"Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026684","source_sha256":"fde71ea5f860a2107cbe703fc2631bf5c8eda9ecf7dbd65eecf371a7dbdb31fa","start":430}],"target_id":"concept.mesh.d026684","target_kind":"node","target_sha256":"12f45d9f9dab0e49f2c6c897099d1685bb99fa289e8b781eed81567a1a6e4a7d"}],"concept.mesh.d026686":[{"id":"assertion.concept.mesh.d026686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beneficence as described in the captured NLM MeSH descriptor D026686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beneficence as: The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of BENEFICENCE requires producing net benefit over harm. (Bioethics Thesaurus)","support":[{"end":598,"quote":"The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of\nBENEFICENCE\nrequires producing net benefit over harm. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026686","source_sha256":"34b8fb4abf330dd9a0ef23867d71bc4f1318cd76fcc62ae714813cafee158609","start":366}],"target_id":"concept.mesh.d026686","target_kind":"node","target_sha256":"7d9a8261c6ffc4383f2769dbdbbbda0a8b1530d1790cd460aefa37f89f7ddb91"}],"concept.mesh.d026688":[{"id":"assertion.concept.mesh.d026688","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioethical Issues as described in the captured NLM MeSH descriptor D026688","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioethical Issues as: Clusters of topics that fall within the domain of BIOETHICS , the field of study concerned with value questions that arise in biomedicine and health care delivery.","support":[{"end":793,"quote":"Clusters of topics that fall within the domain of\nBIOETHICS\n, the field of study concerned with value questions that arise in biomedicine and health care delivery.","source_id":"nlm-mesh.d026688","source_sha256":"47bbd7acc5d4655f6aa7c7df44c30f831954052df63d07ad25fbac60ee90e492","start":630}],"target_id":"concept.mesh.d026688","target_kind":"node","target_sha256":"1400a89a8ab80fa643d133d7dcacaf6475a6ff33563385c9532672bf7c391361"}],"concept.mesh.d026689":[{"id":"assertion.concept.mesh.d026689","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Analysis as described in the captured NLM MeSH descriptor D026689","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Analysis as: The use of systematic methods of ethical examination, such as CASUISTRY or ETHICAL THEORY , in reasoning about moral problems.","support":[{"end":494,"quote":"The use of systematic methods of ethical examination, such as\nCASUISTRY\nor\nETHICAL THEORY\n, in reasoning about moral problems.","source_id":"nlm-mesh.d026689","source_sha256":"68aa1c16b6ea21514eb08a2c32ada3a92bbbf79ada578e2435368bf9d732f85f","start":368}],"target_id":"concept.mesh.d026689","target_kind":"node","target_sha256":"3d2dc8606402351f412648cc7b561e73ca52f595db5dbf834a10ed21cdedd6e8"}],"concept.mesh.d026712":[{"id":"assertion.concept.mesh.d026712","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Value of Life as described in the captured NLM MeSH descriptor D026712","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Value of Life as: The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","support":[{"end":512,"quote":"The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026712","source_sha256":"2cbf0e198ba735bfbef49897fb03338854e23d191d4e3baa8bb6ef3ea6dac920","start":437}],"target_id":"concept.mesh.d026712","target_kind":"node","target_sha256":"f87c6eeecd8373331a5c3de8cc3bc92938540c06e42e7a0e83757df1fb0d68eb"}],"concept.mesh.d026724":[{"id":"assertion.concept.mesh.d026724","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Review as described in the captured NLM MeSH descriptor D026724","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Review as: A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee ( CLINICAL ETHICS COMMITTEES or RESEARCH ETHICS COMMITTEES ), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist ( ETHICISTS ).","support":[{"end":721,"quote":"A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee (\nCLINICAL ETHICS COMMITTEES\nor\nRESEARCH ETHICS COMMITTEES\n), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist (\nETHICISTS\n).","source_id":"nlm-mesh.d026724","source_sha256":"930532554990107e04c0da2c8f2ced4b302f6dba636f61379806ea4fe03fa982","start":364}],"target_id":"concept.mesh.d026724","target_kind":"node","target_sha256":"0f417eb5021eb6f7c3e2edbbd4ec5f4ffa6ab90681445f759482c0807e4370d9"}],"concept.mesh.d028661":[{"id":"assertion.concept.mesh.d028661","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Complicity as described in the captured NLM MeSH descriptor D028661","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Complicity as: Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","support":[{"end":577,"quote":"Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","source_id":"nlm-mesh.d028661","source_sha256":"14354e1f6319fa78a2bf7b8de8dc7630181d6e461fd3b99148f1383e1f6dfe11","start":356}],"target_id":"concept.mesh.d028661","target_kind":"node","target_sha256":"6562c1bbff44a793ed0902dca3280fd2bddaf9c63c910e93591593104c52a8fd"}],"concept.mesh.d028663":[{"id":"assertion.concept.mesh.d028663","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Theory as described in the captured NLM MeSH descriptor D028663","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Theory as: A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","support":[{"end":602,"quote":"A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","source_id":"nlm-mesh.d028663","source_sha256":"cfd266c3c9a74bfb797ae10c828765be7b7accd8904e4df677802d4ad875204c","start":364}],"target_id":"concept.mesh.d028663","target_kind":"node","target_sha256":"457d576923e5414fdda292288a4b61c3f606c84440a13ebb176783383cf00d00"}],"concept.mesh.d028681":[{"id":"assertion.concept.mesh.d028681","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Obligations as described in the captured NLM MeSH descriptor D028681","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Obligations as: Duties that are based in ETHICS , rather than in law.","support":[{"end":431,"quote":"Duties that are based in\nETHICS\n, rather than in law.","source_id":"nlm-mesh.d028681","source_sha256":"1c9efff1ad8b2842fbc37e293945d1966c71b66d9e7f53a98511619275b60c00","start":378}],"target_id":"concept.mesh.d028681","target_kind":"node","target_sha256":"049e1c7876ab9eab4c89fa0b9de524e11d6738bea296bf8afee6e5f24e145f7c"}],"concept.mesh.d028683":[{"id":"assertion.concept.mesh.d028683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"National Socialism as described in the captured NLM MeSH descriptor D028683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes National Socialism as: The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","support":[{"end":708,"quote":"The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","source_id":"nlm-mesh.d028683","source_sha256":"e7066c54a9f107b45bc0e8515f5b247e5263ae82d2862048b9f8aceda15a36b6","start":376}],"target_id":"concept.mesh.d028683","target_kind":"node","target_sha256":"7f4c3c1ccdde25c5820629b4d810f149448a2bc9dfa1863122265d6c6f318050"}],"concept.mesh.d028722":[{"id":"assertion.concept.mesh.d028722","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Virtues as described in the captured NLM MeSH descriptor D028722","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Virtues as: Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","support":[{"end":499,"quote":"Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","source_id":"nlm-mesh.d028722","source_sha256":"1818fe2f99454fe1663d8feafec056a211aff607c56f10cfb1ce28a563f1e369","start":413}],"target_id":"concept.mesh.d028722","target_kind":"node","target_sha256":"1fd2a65482e0e4bff938e70257f12bc90e7222206870ca9b5555d6b780879770"}],"concept.mesh.d028723":[{"id":"assertion.concept.mesh.d028723","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personhood as described in the captured NLM MeSH descriptor D028723","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personhood as: The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","support":[{"end":727,"quote":"The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","source_id":"nlm-mesh.d028723","source_sha256":"b6f43f20dbb4d0b69d754b774928d2d97a440990de36109d4fdd36207c7fc4e2","start":401}],"target_id":"concept.mesh.d028723","target_kind":"node","target_sha256":"22c069ba94003de38a940dcc7adcc85b5771d9571e4ea41d7671fe3b54b0fbd9"}],"concept.mesh.d028781":[{"id":"assertion.concept.mesh.d028781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Relativism as described in the captured NLM MeSH descriptor D028781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Relativism as: The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","support":[{"end":578,"quote":"The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","source_id":"nlm-mesh.d028781","source_sha256":"7479553a5b84fe45c5e9302e06904765e2642468e21e8232d0e035e339736d83","start":372}],"target_id":"concept.mesh.d028781","target_kind":"node","target_sha256":"26937f88457f6619e82e5c5075434d657a445a5737dbf46a3781dac81ed542b4"}],"concept.mesh.d029181":[{"id":"assertion.concept.mesh.d029181","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spirituality as described in the captured NLM MeSH descriptor D029181","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spirituality as: Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","support":[{"end":569,"quote":"Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","source_id":"nlm-mesh.d029181","source_sha256":"f8704726c11d17cc20c55b2bb90304539ad1be9c192a3fba15192122f1fb4917","start":356}],"target_id":"concept.mesh.d029181","target_kind":"node","target_sha256":"86bed22eb2e4b2608b76a1692ea28aef433953afff1d6215315abc8017790160"}],"concept.mesh.d030141":[{"id":"assertion.concept.mesh.d030141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feedback, Psychological as described in the captured NLM MeSH descriptor D030141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feedback, Psychological as: A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","support":[{"end":611,"quote":"A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","source_id":"nlm-mesh.d030141","source_sha256":"f514264f8c05ba6236ca4209d821474d99419ae8e53d579b642d643fa6b21e1f","start":427}],"target_id":"concept.mesh.d030141","target_kind":"node","target_sha256":"4fabef827b73389bc279109269f39b1b9ccb39a4bde7d6fb7928ec6330cd6a03"}],"concept.mesh.d030861":[{"id":"assertion.concept.mesh.d030861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Capitalism as described in the captured NLM MeSH descriptor D030861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Capitalism as: A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":664,"quote":"A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d030861","source_sha256":"bc8e78c6a8d2486b02f0bcc981909f03d0688ba7f38a2445613fb07a5a609500","start":372}],"target_id":"concept.mesh.d030861","target_kind":"node","target_sha256":"4f87fd2ab2d41c9d66623e81feb6c61d157ff5b43831e565e22579f2c8821888"}],"concept.mesh.d031261":[{"id":"assertion.concept.mesh.d031261","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Poult Enteritis Mortality Syndrome as described in the captured NLM MeSH descriptor D031261","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Poult Enteritis Mortality Syndrome as: An acute, transmissible, infectious disease associated with high MORTALITY and MORBIDITY in young turkeys (poults). It is characterized by DIARRHEA ; ANOREXIA ; growth depression, and immune dysfunction. The cause is unknown but astroviruses ( AVASTROVIRUS ) and coronaviruses ( CORONAVIRUS, TURKEY ) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","support":[{"end":867,"quote":"An acute, transmissible, infectious disease associated with high\nMORTALITY\nand\nMORBIDITY\nin young turkeys (poults). It is characterized by\nDIARRHEA\n;\nANOREXIA\n; growth depression, and immune dysfunction. The cause is unknown but astroviruses (\nAVASTROVIRUS\n) and coronaviruses (\nCORONAVIRUS, TURKEY\n) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","source_id":"nlm-mesh.d031261","source_sha256":"71fa45054dddda22d1089e3b5c57f7e5c44967db683a1bb99b1ac3c6d4ef15c3","start":434}],"target_id":"concept.mesh.d031261","target_kind":"node","target_sha256":"1679be129bfbc2ad8dd90ef68ea875bc1902aa0a2a01de8f0ae56f7d23dff5e9"}],"concept.mesh.d032764":[{"id":"assertion.concept.mesh.d032764","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Casuistry as described in the captured NLM MeSH descriptor D032764","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Casuistry as: A method of ETHICAL ANALYSIS that emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","support":[{"end":766,"quote":"A method of\nETHICAL ANALYSIS\nthat emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","source_id":"nlm-mesh.d032764","source_sha256":"851e4d693c5c0f2d6ed52366b109861e1c7a688d1c4c0e52ede74e60c63f8a5b","start":470}],"target_id":"concept.mesh.d032764","target_kind":"node","target_sha256":"5b8f9206cee43d66a553e7c2b3b8563b6e3c5697cde631b346d8cffd3e207433"}],"concept.mesh.d032903":[{"id":"assertion.concept.mesh.d032903","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Confucianism as described in the captured NLM MeSH descriptor D032903","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Confucianism as: A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","support":[{"end":539,"quote":"A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","source_id":"nlm-mesh.d032903","source_sha256":"c16063ff0946eae36732154b587c3e1b72d0adeec813936d3f459b298b222346","start":344}],"target_id":"concept.mesh.d032903","target_kind":"node","target_sha256":"0ef3ad703a99154f13bab603835b0dac2f340ef8694276e4091543eeb2abc4a7"}],"concept.mesh.d033003":[{"id":"assertion.concept.mesh.d033003","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eastern Orthodoxy as described in the captured NLM MeSH descriptor D033003","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eastern Orthodoxy as: The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","support":[{"end":738,"quote":"The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","source_id":"nlm-mesh.d033003","source_sha256":"dd328af64bd01cc2e7290e1d895c2897a049b4d1335fb07c8806d44e2e02635d","start":391}],"target_id":"concept.mesh.d033003","target_kind":"node","target_sha256":"1d4f917682423aa69e8403bc9841c2182605b78af19f8e57b656a9302d5a035e"}],"concept.mesh.d033041":[{"id":"assertion.concept.mesh.d033041","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Embryo Research as described in the captured NLM MeSH descriptor D033041","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Embryo Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","support":[{"end":1006,"quote":"Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","source_id":"nlm-mesh.d033041","source_sha256":"80b5cf1857c906d8cfa0d0e394a76ee6cf1a70d21138ad849ee4a9a768cbed27","start":656}],"target_id":"concept.mesh.d033041","target_kind":"node","target_sha256":"902f306e2a408b63f71817b4e47de49f3ba3655caa45fd0168ef22ed890e6866"}],"concept.mesh.d033042":[{"id":"assertion.concept.mesh.d033042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fetal Research as described in the captured NLM MeSH descriptor D033042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fetal Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","support":[{"end":848,"quote":"Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","source_id":"nlm-mesh.d033042","source_sha256":"4df239fa54984e17b9152d3de3a77bea262c5bffdcc408efe5dd04ee8998570f","start":583}],"target_id":"concept.mesh.d033042","target_kind":"node","target_sha256":"2bf2f096f7230bef18d087a5714629b85bdf1e89d6dec4768bc67130f91f20d9"}],"concept.mesh.d033061":[{"id":"assertion.concept.mesh.d033061","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics Consultation as described in the captured NLM MeSH descriptor D033061","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics Consultation as: Services provided by an individual ethicist ( ETHICISTS ) or an ethics team or committee ( ETHICS COMMITTEES, CLINICAL ) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","support":[{"end":730,"quote":"Services provided by an individual ethicist (\nETHICISTS\n) or an ethics team or committee (\nETHICS COMMITTEES, CLINICAL\n) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","source_id":"nlm-mesh.d033061","source_sha256":"7712d942ad6b58dbc195b325e82906aa0f419f3051acf68199ee5c7aa5fde6b8","start":402}],"target_id":"concept.mesh.d033061","target_kind":"node","target_sha256":"be8bf5994eb9a610617c5e3b524d8bb2e43e9df0e38b384d9ce6addc7ad9845d"}],"concept.mesh.d033302":[{"id":"assertion.concept.mesh.d033302","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Postmodernism as described in the captured NLM MeSH descriptor D033302","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Postmodernism as: A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","support":[{"end":649,"quote":"A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","source_id":"nlm-mesh.d033302","source_sha256":"637a3c42153147857a1431a4d4647905ba7c74376393b609d4ff5860b992e0e0","start":342}],"target_id":"concept.mesh.d033302","target_kind":"node","target_sha256":"ecc8739cf52a89cb9fdb7e5cc3157370528cfb12caecee9315cd58b4eaf2e17e"}],"concept.mesh.d033303":[{"id":"assertion.concept.mesh.d033303","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Protestantism as described in the captured NLM MeSH descriptor D033303","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","support":[{"end":683,"quote":"The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","source_id":"nlm-mesh.d033303","source_sha256":"4ac7f6dee1b1b33f93ddd38809d3c1e7e5a519d73c1f02fa9c83faefcacf3a48","start":383}],"target_id":"concept.mesh.d033303","target_kind":"node","target_sha256":"a907391e30262814b883f9802c00e0a1bbef59a904f0fe57011a66cf4f78570b"}],"concept.mesh.d033421":[{"id":"assertion.concept.mesh.d033421","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beginning of Human Life as described in the captured NLM MeSH descriptor D033421","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beginning of Human Life as: The point at which religious ensoulment or PERSONHOOD is considered to begin.","support":[{"end":583,"quote":"The point at which religious ensoulment or\nPERSONHOOD\nis considered to begin.","source_id":"nlm-mesh.d033421","source_sha256":"27a3e3d33d623e35d301be9dd597af07d3d345213b7c241ad6aa2ff6ddfd1760","start":506}],"target_id":"concept.mesh.d033421","target_kind":"node","target_sha256":"b0069f7c9718d635e0b47c6b870018a71353b6b0f8f9ebffd123aee8db677fa4"}],"concept.mesh.d034161":[{"id":"assertion.concept.mesh.d034161","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pelvic Infection as described in the captured NLM MeSH descriptor D034161","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pelvic Infection as: Infection involving the tissues or organs in the PELVIS .","support":[{"end":401,"quote":"Infection involving the tissues or organs in the\nPELVIS\n.","source_id":"nlm-mesh.d034161","source_sha256":"345d721c853be7a307686d5f0dda4b6a25bfbcd0043146cab32d9b7b2b0960ef","start":344}],"target_id":"concept.mesh.d034161","target_kind":"node","target_sha256":"59af46e49691a87b124d35d153ee615939ed219c0fcb702d0ae219fb94167e74"}],"concept.mesh.d034682":[{"id":"assertion.concept.mesh.d034682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Church of Jesus Christ of Latter-day Saints as described in the captured NLM MeSH descriptor D034682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Church of Jesus Christ of Latter-day Saints as: A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":625,"quote":"A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d034682","source_sha256":"e0021447e8c18ffa6c5d389ac56c0be70cf3a675b593a5aa88def69914a3246d","start":442}],"target_id":"concept.mesh.d034682","target_kind":"node","target_sha256":"7943e8c377dd7e0ce7282a40da61a0ad6f2e6ad2fc5165c6c9bd379e31003d5f"}],"concept.mesh.d034723":[{"id":"assertion.concept.mesh.d034723","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Double Effect Principle as described in the captured NLM MeSH descriptor D034723","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Double Effect Principle as: Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","support":[{"end":983,"quote":"Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","source_id":"nlm-mesh.d034723","source_sha256":"d2a73efe3527ec161aed8d9f3136b546360178d0b67a4dc33307e8f63728106c","start":442}],"target_id":"concept.mesh.d034723","target_kind":"node","target_sha256":"2a5b438e3ad82e6e78a96d2a2fd871de3b7ba4e32fb1ac7251e50079e02bb7aa"}],"concept.mesh.d035061":[{"id":"assertion.concept.mesh.d035061","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Control Groups as described in the captured NLM MeSH descriptor D035061","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Control Groups as: Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","support":[{"end":688,"quote":"Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","source_id":"nlm-mesh.d035061","source_sha256":"d5f9c728b7433742ce2348704ab9b1102136a7297bc8093f215ea4c973990447","start":496}],"target_id":"concept.mesh.d035061","target_kind":"node","target_sha256":"a7a7011bd3a8c6dbc843e9d5ad60cd25166a97a4704a106e3b3c717f27bb1058"}],"concept.mesh.d035082":[{"id":"assertion.concept.mesh.d035082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Federal Government as described in the captured NLM MeSH descriptor D035082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Federal Government as: The level of governmental organization and function at the national or country-wide level.","support":[{"end":671,"quote":"The level of governmental organization and function at the national or country-wide level.","source_id":"nlm-mesh.d035082","source_sha256":"9fb7622abf6b3ef1cdfb2741ca470226a5edad88df24e44680f50307437c5328","start":581}],"target_id":"concept.mesh.d035082","target_kind":"node","target_sha256":"34cdbcb8bccef85db26636ccf8c6ba48e9aaf6463bb1d5feb759f1dd44c0febe"}],"concept.mesh.d035481":[{"id":"assertion.concept.mesh.d035481","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Retrospective Moral Judgment as described in the captured NLM MeSH descriptor D035481","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Retrospective Moral Judgment as: The application of current standards of morality to past actions, institutions, or persons.","support":[{"end":491,"quote":"The application of current standards of morality to past actions, institutions, or persons.","source_id":"nlm-mesh.d035481","source_sha256":"6b1e6ed429bef2c8feafd155a7072ee0af136e1ab44100a15ff10eb0d2dbb4d5","start":400}],"target_id":"concept.mesh.d035481","target_kind":"node","target_sha256":"3ab24f72c99e76246a40c0f2c053b7bde765aab8dea61ff8ff99d2e4ab6e7faf"}],"concept.mesh.d035501":[{"id":"assertion.concept.mesh.d035501","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Uncertainty as described in the captured NLM MeSH descriptor D035501","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Uncertainty as: The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","support":[{"end":528,"quote":"The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","source_id":"nlm-mesh.d035501","source_sha256":"8f21d54e679e684215a78034e13a7687693244940afa0128a5f3f2c9e506796c","start":426}],"target_id":"concept.mesh.d035501","target_kind":"node","target_sha256":"7165feb6cac475a2bfbae4b1f0b99b47bd4d9a32fe44a4e27e4f89e37c09c576"}],"concept.mesh.d035621":[{"id":"assertion.concept.mesh.d035621","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Secularism as described in the captured NLM MeSH descriptor D035621","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Secularism as: Indifference to, or rejection of, RELIGION or religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":475,"quote":"Indifference to, or rejection of,\nRELIGION\nor religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d035621","source_sha256":"2c2681b2e28ae6677a8641f8335b9a847da52852b3cac57fc36299af5ea460b0","start":348}],"target_id":"concept.mesh.d035621","target_kind":"node","target_sha256":"2842bf619835ad7f3d9f77deb73e85efd55dae3ea8d7d1db308b30733c727c31"}],"concept.mesh.d035761":[{"id":"assertion.concept.mesh.d035761","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wedge Argument as described in the captured NLM MeSH descriptor D035761","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wedge Argument as: An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","support":[{"end":568,"quote":"An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","source_id":"nlm-mesh.d035761","source_sha256":"8e50e02711130f52bc563a75e8b596dcf969cd2f0c87ac58a893adb466066f21","start":372}],"target_id":"concept.mesh.d035761","target_kind":"node","target_sha256":"3d2d672ec72dc4cc7c7a010583a85e4473738e925547d577885546acc1538b8c"}],"concept.mesh.d035841":[{"id":"assertion.concept.mesh.d035841","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Research as described in the captured NLM MeSH descriptor D035841","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Research as: Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","support":[{"end":758,"quote":"Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","source_id":"nlm-mesh.d035841","source_sha256":"830fab033b47f1496e63029516cf309d51854f7f89ce3006ec79a0c1ebed1dcb","start":530}],"target_id":"concept.mesh.d035841","target_kind":"node","target_sha256":"96911b507744886d40fbdafde4a6ec1b0ac1856d90f1e7c5ba84dd3e71b6518a"}],"concept.mesh.d035843":[{"id":"assertion.concept.mesh.d035843","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Research as described in the captured NLM MeSH descriptor D035843","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Research as: Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","support":[{"end":618,"quote":"Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","source_id":"nlm-mesh.d035843","source_sha256":"7b6ed351ccf66ccf1b44bcc8b34d0542a4b280a16504e833558a1f403de6a52e","start":507}],"target_id":"concept.mesh.d035843","target_kind":"node","target_sha256":"4ae1559d08aac800960c344eefdc376cd02128e535fdd3cf08f64f2cf735943a"}],"concept.mesh.d035863":[{"id":"assertion.concept.mesh.d035863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Development as described in the captured NLM MeSH descriptor D035863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Development as: The process by which individuals internalize standards of right and wrong conduct.","support":[{"end":468,"quote":"The process by which individuals internalize standards of right and wrong conduct.","source_id":"nlm-mesh.d035863","source_sha256":"fbacab836ea15256c637b3b41f3aad13afa93b41fe91f2710357cf10f9bb0ec7","start":386}],"target_id":"concept.mesh.d035863","target_kind":"node","target_sha256":"4a5f6be860838a1a193c14dad71fbd92184b9147d6af626fd20205a6266c7d30"}],"concept.mesh.d036262":[{"id":"assertion.concept.mesh.d036262","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Empirical Research as described in the captured NLM MeSH descriptor D036262","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Empirical Research as: The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","support":[{"end":527,"quote":"The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","source_id":"nlm-mesh.d036262","source_sha256":"915e1149322183f83a4adce604de8ad80cfd64ff2562ae867d29af70e4fa22a2","start":356}],"target_id":"concept.mesh.d036262","target_kind":"node","target_sha256":"87da95153ffa501bbfcb2517c59395ec70b56116fafeb404b32e43d1dbe11133"}],"concept.mesh.d036281":[{"id":"assertion.concept.mesh.d036281","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Research as described in the captured NLM MeSH descriptor D036281","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Research as: Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","support":[{"end":640,"quote":"Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","source_id":"nlm-mesh.d036281","source_sha256":"5b2b9475b3727768f877e624e8446ed5f7e94ebe1e86145f783e97cce98b1eee","start":525}],"target_id":"concept.mesh.d036281","target_kind":"node","target_sha256":"6b58e4d3693b097b4aca32b5ab5d7e25e833fc1d171ce1ea1f6f2f7bc368d9f2"}],"concept.mesh.d036301":[{"id":"assertion.concept.mesh.d036301","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Qualitative Research as described in the captured NLM MeSH descriptor D036301","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Qualitative Research as: Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","support":[{"end":722,"quote":"Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","source_id":"nlm-mesh.d036301","source_sha256":"7b421b197a76ace4a77f156201e9e3366ee250c7a8cefa01067eb8d4d0183508","start":441}],"target_id":"concept.mesh.d036301","target_kind":"node","target_sha256":"632bfc282b3437159b887707b7a8f5ba0d2630e16961bcad6850ed7f9a80bcf2"}],"concept.mesh.d038622":[{"id":"assertion.concept.mesh.d038622","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Internationality as described in the captured NLM MeSH descriptor D038622","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Internationality as: The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","support":[{"end":516,"quote":"The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d038622","source_sha256":"aa2f0bf2f996830d528cd44a89544512b9f95dba5a4f7c2f85e714f94fdf2a29","start":392}],"target_id":"concept.mesh.d038622","target_kind":"node","target_sha256":"3652563c8358aeec77b4d613b8de6c6b44d6c8db4c9df9c57e81b766c6a15d0b"}],"concept.mesh.d040242":[{"id":"assertion.concept.mesh.d040242","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk Reduction Behavior as described in the captured NLM MeSH descriptor D040242","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk Reduction Behavior as: Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","support":[{"end":454,"quote":"Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","source_id":"nlm-mesh.d040242","source_sha256":"fb0692f20c68e781c208effda343158f49a323a970ba11735db88ce5cbbd2b2a","start":362}],"target_id":"concept.mesh.d040242","target_kind":"node","target_sha256":"b5d925b64be31f10310795888bb0af9c7d5bab87bc77a1cd1a96f1e1ee16b4a9"}],"concept.mesh.d040261":[{"id":"assertion.concept.mesh.d040261","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Harm Reduction as described in the captured NLM MeSH descriptor D040261","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Harm Reduction as: The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","support":[{"end":569,"quote":"The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","source_id":"nlm-mesh.d040261","source_sha256":"bb72a391f392d764f284a77e4c9f3a190c51107ce6c7263633900530f19825a0","start":344}],"target_id":"concept.mesh.d040261","target_kind":"node","target_sha256":"d143d952b7e72543fbdecad86ce25619adcb1c115fe05641b5460d068957eb91"}],"concept.mesh.d040841":[{"id":"assertion.concept.mesh.d040841","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Resource Allocation as described in the captured NLM MeSH descriptor D040841","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Resource Allocation as: Societal or individual decisions about the equitable distribution of available resources.","support":[{"end":706,"quote":"Societal or individual decisions about the equitable distribution of available resources.","source_id":"nlm-mesh.d040841","source_sha256":"67b303e5a34cb41d3ed82f6a711d5ef8cd0e88039dfed3980f3336506270e84e","start":617}],"target_id":"concept.mesh.d040841","target_kind":"node","target_sha256":"6af284026f894b5053d7498c904651ccbb74b5513107833d70d90d0b664c5ef0"}],"concept.mesh.d043762":[{"id":"assertion.concept.mesh.d043762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Behavior as described in the captured NLM MeSH descriptor D043762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Behavior as: Human behavior or decision related to REPRODUCTION .","support":[{"end":505,"quote":"Human behavior or decision related to\nREPRODUCTION\n.","source_id":"nlm-mesh.d043762","source_sha256":"f41b15f222d5a42832f90cdd4c1b4b8619d41064c5ab22ca9994508dad52637d","start":453}],"target_id":"concept.mesh.d043762","target_kind":"node","target_sha256":"3fae4034da8841be5f43c0dea366f5f6fe576da3933129d99e737a849db4d4b4"}],"concept.mesh.d050997":[{"id":"assertion.concept.mesh.d050997","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nanomedicine as described in the captured NLM MeSH descriptor D050997","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nanomedicine as: The branch of medicine concerned with the application of NANOTECHNOLOGY to the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and NANOSTRUCTURES . (From Freitas Jr., Nanomedicine, vol 1, 1999).","support":[{"end":706,"quote":"The branch of medicine concerned with the application of\nNANOTECHNOLOGY\nto the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and\nNANOSTRUCTURES\n. (From Freitas Jr., Nanomedicine, vol 1, 1999).","source_id":"nlm-mesh.d050997","source_sha256":"6288ac23452940f959f42e46247ed94c56846784f390f47863fd4fac3d5b0b2d","start":380}],"target_id":"concept.mesh.d050997","target_kind":"node","target_sha256":"34fc18e11e7732ad8793604ea1be0e40336dbec8774ceb1c2e50d08cc2d04e44"}],"concept.mesh.d052156":[{"id":"assertion.concept.mesh.d052156","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"SELEX Aptamer Technique as described in the captured NLM MeSH descriptor D052156","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes SELEX Aptamer Technique as: A method of generating a large library of randomized nucleotides and selecting NUCLEOTIDE APTAMERS by iterative rounds of in vitro selection. A modified procedure substitutes AMINO ACIDS in place of NUCLEOTIDES to make PEPTIDE APTAMERS .","support":[{"end":627,"quote":"A method of generating a large library of randomized nucleotides and selecting\nNUCLEOTIDE APTAMERS\nby iterative rounds of in vitro selection. A modified procedure substitutes\nAMINO ACIDS\nin place of\nNUCLEOTIDES\nto make\nPEPTIDE APTAMERS\n.","source_id":"nlm-mesh.d052156","source_sha256":"e1c3629376c470492ab028f332d979e12678bde0a2aa0301e07e9b50a691a270","start":390}],"target_id":"concept.mesh.d052156","target_kind":"node","target_sha256":"4d09f04e0f5cf9b76e3314fe4bc0048d6a5f755356e33a9d635dce30c5a7f1b5"}],"concept.mesh.d053604":[{"id":"assertion.concept.mesh.d053604","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Nursing as described in the captured NLM MeSH descriptor D053604","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Nursing as: The application of NURSING knowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","support":[{"end":690,"quote":"The application of\nNURSING\nknowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","source_id":"nlm-mesh.d053604","source_sha256":"5205806f5b70726d2459b6962f778da3cb62162b3d51481b3e77e4e78bea99d1","start":368}],"target_id":"concept.mesh.d053604","target_kind":"node","target_sha256":"0cc2ebbf4814f0269f36e50fb00ff02797d2fef9cffb80552b0a41172673a723"}],"concept.mesh.d053821":[{"id":"assertion.concept.mesh.d053821","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Infections as described in the captured NLM MeSH descriptor D053821","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Infections as: Pathological conditions of the CARDIOVASCULAR SYSTEM caused by infections.","support":[{"end":444,"quote":"Pathological conditions of the\nCARDIOVASCULAR SYSTEM\ncaused by infections.","source_id":"nlm-mesh.d053821","source_sha256":"20e2d3f7ce5dda96708f0a8b2fde49889cfc9e7260dd05758e4c09e7d2958f62","start":370}],"target_id":"concept.mesh.d053821","target_kind":"node","target_sha256":"e6660be17683d306ad0185b7f895f563c1590b2be7744d759a2d825d9bde64d9"}],"concept.mesh.d054802":[{"id":"assertion.concept.mesh.d054802","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Imprinting as described in the captured NLM MeSH descriptor D054802","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Imprinting as: A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for MOLECULARLY IMPRINTED POLYMERS (MIPs) include separations, assays and biosensors, and catalysis.","support":[{"end":661,"quote":"A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for\nMOLECULARLY IMPRINTED POLYMERS\n(MIPs) include separations, assays and biosensors, and catalysis.","source_id":"nlm-mesh.d054802","source_sha256":"308a7e7145eb060fbc49645f499a32ef5cc5d6f00936c48a1e9ba34f74b78d2b","start":426}],"target_id":"concept.mesh.d054802","target_kind":"node","target_sha256":"f238c0d704a62f74ee67da19b7a707ad4f7503a419dbacb3f57237d26134bd39"}],"concept.mesh.d055499":[{"id":"assertion.concept.mesh.d055499","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catheter-Related Infections as described in the captured NLM MeSH descriptor D055499","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catheter-Related Infections as: Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","support":[{"end":630,"quote":"Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","source_id":"nlm-mesh.d055499","source_sha256":"74996f300e4255dac46227013887a48ef83626afe0251e08f4e869459f41b7dc","start":422}],"target_id":"concept.mesh.d055499","target_kind":"node","target_sha256":"92262db3c4525d034c7d42c3c45102030a50a7189dfd84232353dde02795b8a1"}],"concept.mesh.d055809":[{"id":"assertion.concept.mesh.d055809","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Illness Behavior as described in the captured NLM MeSH descriptor D055809","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Illness Behavior as: Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of APPETITE or LIBIDO ; disinterest in ACTIVITIES OF DAILY LIVING ; or withdrawal from social interaction.","support":[{"end":557,"quote":"Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of\nAPPETITE\nor\nLIBIDO\n; disinterest in\nACTIVITIES OF DAILY LIVING\n; or withdrawal from social interaction.","source_id":"nlm-mesh.d055809","source_sha256":"cce52566df70fd819984b9d30a2404668fe2881cbcc41024d200ee82d802f1f6","start":348}],"target_id":"concept.mesh.d055809","target_kind":"node","target_sha256":"96b82581f81e00e71028ee250ca98657e129abed3569964c3031d7a2d1a67422"}],"concept.mesh.d055812":[{"id":"assertion.concept.mesh.d055812","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community-Based Participatory Research as described in the captured NLM MeSH descriptor D055812","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community-Based Participatory Research as: Collaborative process of research involving researchers and community representatives.","support":[{"end":494,"quote":"Collaborative process of research involving researchers and community representatives.","source_id":"nlm-mesh.d055812","source_sha256":"1fde2dcd5f99decbbf986e11e5043774373c705a1052b4fd553b2db8c303e423","start":408}],"target_id":"concept.mesh.d055812","target_kind":"node","target_sha256":"23e1c4afd86ebdb70926a00e4841d685a98957808089dc0a62ce57176783057e"}],"concept.mesh.d055990":[{"id":"assertion.concept.mesh.d055990","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Therapeutic Misconception as described in the captured NLM MeSH descriptor D055990","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Therapeutic Misconception as: Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","support":[{"end":549,"quote":"Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","source_id":"nlm-mesh.d055990","source_sha256":"b2cecc7ecf504b37a2cb2e6f62f82505a8fdb092cb7c4fe77e3fb15c5dbedc7a","start":418}],"target_id":"concept.mesh.d055990","target_kind":"node","target_sha256":"d8f24aa5fa1f57412a103f3b046cb2073c9589bcb8fcff98313697a73b66ccb5"}],"concept.mesh.d056146":[{"id":"assertion.concept.mesh.d056146","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Corpse Dismemberment as described in the captured NLM MeSH descriptor D056146","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Corpse Dismemberment as: Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","support":[{"end":481,"quote":"Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","source_id":"nlm-mesh.d056146","source_sha256":"b5dc679bbc22a0065cc826ad646437a555e89d2b51957d1a3842c20c24b03775","start":392}],"target_id":"concept.mesh.d056146","target_kind":"node","target_sha256":"3d71f6007b95ffcceeadfbce974a8eef19198b218a493df904f2d862c067d396"}],"concept.mesh.d057005":[{"id":"assertion.concept.mesh.d057005","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioengineering as described in the captured NLM MeSH descriptor D057005","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioengineering as: The application of engineering principles and methods to living organisms or biological systems.","support":[{"end":440,"quote":"The application of engineering principles and methods to living organisms or biological systems.","source_id":"nlm-mesh.d057005","source_sha256":"9586fb5c76f0201a43428100f36d49e7b7acd223dc943b344eafa92c81980093","start":344}],"target_id":"concept.mesh.d057005","target_kind":"node","target_sha256":"16e29b6a272900b60c2db3a02d92214895e8dde53f485ce470a5ac591d4af514"}],"concept.mesh.d057170":[{"id":"assertion.concept.mesh.d057170","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Translational Research, Biomedical as described in the captured NLM MeSH descriptor D057170","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Translational Research, Biomedical as: The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","support":[{"end":911,"quote":"The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","source_id":"nlm-mesh.d057170","source_sha256":"7aee00095c41121fddeefa87199f1dfc1b4fd0126e7e7580d99c9697dc9e7b83","start":640}],"target_id":"concept.mesh.d057170","target_kind":"node","target_sha256":"ce2719b6c8cbc9a434a8512ef0e65dccfa151c5acf86655611c9f599c592f14c"}],"concept.mesh.d057172":[{"id":"assertion.concept.mesh.d057172","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Economic Recession as described in the captured NLM MeSH descriptor D057172","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Economic Recession as: Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","support":[{"end":666,"quote":"Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","source_id":"nlm-mesh.d057172","source_sha256":"d3ef7facb98ccac75cbf66a9d498ce02e1be650a5b8b6925fef0cd5af185bec5","start":352}],"target_id":"concept.mesh.d057172","target_kind":"node","target_sha256":"69d57199d0afd19fd88b642d0af328f0c12f5edd71fb3e33368827237dfc27cb"}],"concept.mesh.d057185":[{"id":"assertion.concept.mesh.d057185","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sedentary Behavior as described in the captured NLM MeSH descriptor D057185","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .","support":[{"end":490,"quote":"Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining\nPOSTURE\n.","source_id":"nlm-mesh.d057185","source_sha256":"42cec1fe2a9ceb2d945eb0172f29c6736205cb41efc376983cd9b97ce542bc30","start":368}],"target_id":"concept.mesh.d057185","target_kind":"node","target_sha256":"9ced8dd29a679e4a4436397a2e0cf2754375c6f9f344ace2a8ba75cd5e82c427"}],"concept.mesh.d057205":[{"id":"assertion.concept.mesh.d057205","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Automation, Laboratory as described in the captured NLM MeSH descriptor D057205","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Automation, Laboratory as: Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","support":[{"end":478,"quote":"Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","source_id":"nlm-mesh.d057205","source_sha256":"fdc951b67c4505f8a8a6ac3c388c323ad2e6347d734f80abada9c1bbcc5566bb","start":372}],"target_id":"concept.mesh.d057205","target_kind":"node","target_sha256":"c63924906acfd7f6a5c4318bf031794319ad70b135df06ae055c760e2ee339a2"}],"concept.mesh.d057212":[{"id":"assertion.concept.mesh.d057212","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Therapeutic Equipoise as described in the captured NLM MeSH descriptor D057212","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Therapeutic Equipoise as: Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","support":[{"end":574,"quote":"Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","source_id":"nlm-mesh.d057212","source_sha256":"4034f20b13a175f5d6a6f4d96bb1682e2b53c7285111be6858ff19cdd667a163","start":442}],"target_id":"concept.mesh.d057212","target_kind":"node","target_sha256":"63158da077b2e4ebc11e6450a90e29fba118107075ca4b81531db4c6448eff35"}],"concept.mesh.d057217":[{"id":"assertion.concept.mesh.d057217","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Economic Development as described in the captured NLM MeSH descriptor D057217","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","support":[{"end":476,"quote":"Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","source_id":"nlm-mesh.d057217","source_sha256":"9b6fb627a341835e2179776ea66113dffffffaa02cbbb20d0e04983765b58493","start":368}],"target_id":"concept.mesh.d057217","target_kind":"node","target_sha256":"62dd83afb192ec283277368a72f1faded4585ed8032a664704b1f9a78d266ee9"}],"concept.mesh.d057226":[{"id":"assertion.concept.mesh.d057226","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Information Seeking Behavior as described in the captured NLM MeSH descriptor D057226","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Information Seeking Behavior as: How information is gathered in personal, academic or work environments and the resources used.","support":[{"end":494,"quote":"How information is gathered in personal, academic or work environments and the resources used.","source_id":"nlm-mesh.d057226","source_sha256":"c7f6b948ff307b308d12ca1eb787b4a9ff7b0f1b4cb26c989816e056ee265fb3","start":400}],"target_id":"concept.mesh.d057226","target_kind":"node","target_sha256":"7c6001a87eae675b8ec224ce16eb13f643deb567ff689ef623556cdee10aa6fb"}],"concept.mesh.d057565":[{"id":"assertion.concept.mesh.d057565","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Apathy as described in the captured NLM MeSH descriptor D057565","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Apathy as: Lack of emotion or emotional expression; a disorder of motivation that persists over time.","support":[{"end":418,"quote":"Lack of emotion or emotional expression; a disorder of motivation that persists over time.","source_id":"nlm-mesh.d057565","source_sha256":"76442309a705faeb91c13771d0c337238c6d2547724501c689d8a2e08bcf154a","start":328}],"target_id":"concept.mesh.d057565","target_kind":"node","target_sha256":"474ab7a7337aa1ca17e6906ca23b044be7ae0bbcc3938e1570875e7f33717527"}],"concept.mesh.d057766":[{"id":"assertion.concept.mesh.d057766","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Policy as described in the captured NLM MeSH descriptor D057766","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Policy as: A course or method of action selected to guide and determine present and future decisions.","support":[{"end":422,"quote":"A course or method of action selected to guide and determine present and future decisions.","source_id":"nlm-mesh.d057766","source_sha256":"7ab457527ebc956ab3fe52ccbcde23e58b663b5091983ebcec8df7ae30814a7c","start":332}],"target_id":"concept.mesh.d057766","target_kind":"node","target_sha256":"429f951ffa1ffc86dcce4d83bd40e84b815eddf57f4b1d9ba61548da4da0b1b7"}],"concept.mesh.d057905":[{"id":"assertion.concept.mesh.d057905","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stem Cell Research as described in the captured NLM MeSH descriptor D057905","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stem Cell Research as: Experimentation on STEM CELLS and on the use of stem cells.","support":[{"end":756,"quote":"Experimentation on\nSTEM CELLS\nand on the use of stem cells.","source_id":"nlm-mesh.d057905","source_sha256":"30c3db80bfd4e10dcbc516dd673a7297ef8baef0e3a7857eee1927f9c8470948","start":697}],"target_id":"concept.mesh.d057905","target_kind":"node","target_sha256":"815b89d8a73f59d77bfed511519a3226def45c648a47aa9f0808dd25f03a37e6"}],"concept.mesh.d057930":[{"id":"assertion.concept.mesh.d057930","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Click Chemistry as described in the captured NLM MeSH descriptor D057930","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Click Chemistry as: Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with COMBINATORIAL CHEMISTRY TECHNIQUES , it is used for the synthesis of new compounds and combinatorial libraries.","support":[{"end":752,"quote":"Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with\nCOMBINATORIAL CHEMISTRY TECHNIQUES\n, it is used for the synthesis of new compounds and combinatorial libraries.","source_id":"nlm-mesh.d057930","source_sha256":"0bfc9c628743f6f309230e234effdde6b4089137c824c39c4aa574598db068cc","start":366}],"target_id":"concept.mesh.d057930","target_kind":"node","target_sha256":"ed3d3e525ffbb5fbd02e2bc15fb605bdc4b21dd6119ecfac5562315d7aea7a8a"}],"concept.mesh.d058011":[{"id":"assertion.concept.mesh.d058011","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multifactor Dimensionality Reduction as described in the captured NLM MeSH descriptor D058011","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multifactor Dimensionality Reduction as: A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","support":[{"end":645,"quote":"A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","source_id":"nlm-mesh.d058011","source_sha256":"624fab765d28ac4ae773a210a7718baa57eab54ad7c9fb584f65b06aae9bb834","start":528}],"target_id":"concept.mesh.d058011","target_kind":"node","target_sha256":"a82c4be910c6fef170b5234a8e2f63d2b125df3d6de8c5b418562d7ca6b1ab02"}],"concept.mesh.d058028":[{"id":"assertion.concept.mesh.d058028","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research Report as described in the captured NLM MeSH descriptor D058028","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research Report as: Detailed account or statement or formal record of data resulting from empirical inquiry.","support":[{"end":458,"quote":"Detailed account or statement or formal record of data resulting from empirical inquiry.","source_id":"nlm-mesh.d058028","source_sha256":"aa1663feb71cfa097bba910d98371bf959599434df8b0aaeba68aeb6787d87c1","start":370}],"target_id":"concept.mesh.d058028","target_kind":"node","target_sha256":"753648ae5ba0a08016c07061cb3707b7e86982d08dd8b72705c9b69f96f7e2ac"}],"concept.mesh.d058345":[{"id":"assertion.concept.mesh.d058345","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Asymptomatic Infections as described in the captured NLM MeSH descriptor D058345","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Asymptomatic Infections as: Infections that do not exhibit symptoms.","support":[{"end":418,"quote":"Infections that do not exhibit symptoms.","source_id":"nlm-mesh.d058345","source_sha256":"ce736e3b612873b9a0558deece81b7041823381c7c6070a3ceff098ae837b94a","start":378}],"target_id":"concept.mesh.d058345","target_kind":"node","target_sha256":"9d1d8063e69bc13e741cc938d07dfbbfda99efeb4cb19d9b09ea25f8dee7f432"}],"concept.mesh.d058433":[{"id":"assertion.concept.mesh.d058433","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Photobioreactors as described in the captured NLM MeSH descriptor D058433","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Photobioreactors as: Devices for generating biological products that use light as the energy source. They are used for controlled BIOMASS production such as growing cyanobacteria, mosses, or algae.","support":[{"end":544,"quote":"Devices for generating biological products that use light as the energy source. They are used for controlled\nBIOMASS\nproduction such as growing cyanobacteria, mosses, or algae.","source_id":"nlm-mesh.d058433","source_sha256":"3a0728642cfc7f765d43dc278c38426174bb8dd92e1f994edf28e9598fcb6394","start":368}],"target_id":"concept.mesh.d058433","target_kind":"node","target_sha256":"763327dd48a37fc2b1163976915acae0cf0bd5b9f69191789d8f91e855268687"}],"concept.mesh.d058443":[{"id":"assertion.concept.mesh.d058443","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catastrophization as described in the captured NLM MeSH descriptor D058443","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catastrophization as: Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","support":[{"end":518,"quote":"Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","source_id":"nlm-mesh.d058443","source_sha256":"3a8782bde7dcea59603eda5b8f02c34b85c1cc33f77f3a12c36856a9c75c1951","start":366}],"target_id":"concept.mesh.d058443","target_kind":"node","target_sha256":"686285577fe75bd8e9ddcbf18835f2fa29c62b61aa17ce9b9acee68d9937a767"}],"concept.mesh.d058634":[{"id":"assertion.concept.mesh.d058634","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Farming as described in the captured NLM MeSH descriptor D058634","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Farming as: The large scale production of pharmaceutically important and commercially valuable RECOMBINANT PROTEINS .","support":[{"end":459,"quote":"The large scale production of pharmaceutically important and commercially valuable\nRECOMBINANT PROTEINS\n.","source_id":"nlm-mesh.d058634","source_sha256":"aac5d8c31a45c31da3900250400ae7484534c60f78563a2d9be35bc53c521930","start":354}],"target_id":"concept.mesh.d058634","target_kind":"node","target_sha256":"fbf331d7986b2c8f377e61277dfe2a9b4956e44e908e63fc0f8bf8bfbab58566"}],"concept.mesh.d058996":[{"id":"assertion.concept.mesh.d058996","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality Improvement as described in the captured NLM MeSH descriptor D058996","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality Improvement as: The attainment or process of attaining a new level of performance or quality.","support":[{"end":443,"quote":"The attainment or process of attaining a new level of performance or quality.","source_id":"nlm-mesh.d058996","source_sha256":"57e40c804193ee3e05875ab1a9a7ffb7431f2f607bea9c78419d20d9a9faff87","start":366}],"target_id":"concept.mesh.d058996","target_kind":"node","target_sha256":"8c819a56dab2f6f880f10f9227d4bbcf034ba65c0ef5d25f3700601f4e340799"}],"concept.mesh.d058999":[{"id":"assertion.concept.mesh.d058999","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drug-Seeking Behavior as described in the captured NLM MeSH descriptor D058999","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drug-Seeking Behavior as: Activities performed to obtain licit or illicit substances.","support":[{"end":417,"quote":"Activities performed to obtain licit or illicit substances.","source_id":"nlm-mesh.d058999","source_sha256":"ab622ccf91f3e9027977ebdd49683ed1c574858b008538f8361f4584c2674f6e","start":358}],"target_id":"concept.mesh.d058999","target_kind":"node","target_sha256":"0b911d47107bd479771e754adbe023d01bc73f60442d3f2585976bb6cd51de36"}],"concept.mesh.d059021":[{"id":"assertion.concept.mesh.d059021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laboratory Proficiency Testing as described in the captured NLM MeSH descriptor D059021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laboratory Proficiency Testing as: Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","support":[{"end":617,"quote":"Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","source_id":"nlm-mesh.d059021","source_sha256":"50edae871bc4792e0b885fe9f11c01d8a2985e5aae06767892bbc47f76fcd072","start":396}],"target_id":"concept.mesh.d059021","target_kind":"node","target_sha256":"fa2c65275122de8eeaf137add8b490056f4900d9ad36e0412ecd2f2442cd9e5e"}],"concept.mesh.d059066":[{"id":"assertion.concept.mesh.d059066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Gross Domestic Product as described in the captured NLM MeSH descriptor D059066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Gross Domestic Product as: Value of all final goods and services produced in a country in one year.","support":[{"end":432,"quote":"Value of all final goods and services produced in a country in one year.","source_id":"nlm-mesh.d059066","source_sha256":"f177c166e2e218837f3490875b7cd0b1f55dc260e186965ba2e6254249a0b491","start":360}],"target_id":"concept.mesh.d059066","target_kind":"node","target_sha256":"40887628ca31654b8fda1561d76a5bf3881bff8357a4b755c6672e2822c2f135"}],"concept.mesh.d059413":[{"id":"assertion.concept.mesh.d059413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intraabdominal Infections as described in the captured NLM MeSH descriptor D059413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intraabdominal Infections as: Infection within the PERITONEAL CAVITY. A frequent cause is an ANASTOMOTIC LEAK following surgery.","support":[{"end":460,"quote":"Infection within the PERITONEAL CAVITY. A frequent cause is an\nANASTOMOTIC LEAK\nfollowing surgery.","source_id":"nlm-mesh.d059413","source_sha256":"c36195d41eb58adbc102086a127ae11b4d2faca68acbcbdfdf509ff569a97f5d","start":362}],"target_id":"concept.mesh.d059413","target_kind":"node","target_sha256":"f9bd5e378a5c77e4ac7137206aea26e14b14948e162b03cf7d77ec2f62c24fd4"}],"concept.mesh.d060085":[{"id":"assertion.concept.mesh.d060085","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Coinfection as described in the captured NLM MeSH descriptor D060085","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Coinfection as: Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","support":[{"end":579,"quote":"Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","source_id":"nlm-mesh.d060085","source_sha256":"e248efca59d043e58e790c52f3694fb818fa33896af64ec028faf46b8eba35f0","start":394}],"target_id":"concept.mesh.d060085","target_kind":"node","target_sha256":"b9ce43d78390e838a0841651671f34c62b96134f59b9a023e1574445a7a496af"}],"concept.mesh.d060326":[{"id":"assertion.concept.mesh.d060326","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chemistry Techniques, Synthetic as described in the captured NLM MeSH descriptor D060326","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chemistry Techniques, Synthetic as: Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","support":[{"end":547,"quote":"Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","source_id":"nlm-mesh.d060326","source_sha256":"611ffdfcc6dd513ccd58de28ff4693a956092bfd0be9103b2524178d94b4994d","start":390}],"target_id":"concept.mesh.d060326","target_kind":"node","target_sha256":"4b400aeea0a754609ef021c27d1d54336604312350d9a444edc6139754ff6a9b"}],"concept.mesh.d060327":[{"id":"assertion.concept.mesh.d060327","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Solid-Phase Synthesis Techniques as described in the captured NLM MeSH descriptor D060327","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Solid-Phase Synthesis Techniques as: Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","support":[{"end":862,"quote":"Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","source_id":"nlm-mesh.d060327","source_sha256":"e35efa241c1894a1573dcfa34584abcaa691c22398720d13ec2b01402d894115","start":400}],"target_id":"concept.mesh.d060327","target_kind":"node","target_sha256":"eda28f3072d16d4a9cc45d01f80aa14be801988c6ae68318848be95b13cdd3fc"}],"concept.mesh.d060388":[{"id":"assertion.concept.mesh.d060388","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Support Vector Machine as described in the captured NLM MeSH descriptor D060388","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Support Vector Machine as: SUPERVISED MACHINE LEARNING algorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","support":[{"end":837,"quote":"SUPERVISED MACHINE LEARNING\nalgorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","source_id":"nlm-mesh.d060388","source_sha256":"384a44a89012aeb36ab4907066c5a39eadad3a895ac9506898b427499e20b7fe","start":400}],"target_id":"concept.mesh.d060388","target_kind":"node","target_sha256":"c60743c0f94fa225b949134ea5de867e23e77813bfac9b3614216cc30ad76874"}],"concept.mesh.d060685":[{"id":"assertion.concept.mesh.d060685","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sense of Coherence as described in the captured NLM MeSH descriptor D060685","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sense of Coherence as: A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","support":[{"end":558,"quote":"A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","source_id":"nlm-mesh.d060685","source_sha256":"20b602a1a99de407036ea20e4c5e9ea359b5d5ea731838319e198967e4068ee1","start":372}],"target_id":"concept.mesh.d060685","target_kind":"node","target_sha256":"fd5c6917680e0b5465d4e670c8440e2d38e64d6dcd6fe11584395d8030c2e81f"}],"concept.mesh.d060737":[{"id":"assertion.concept.mesh.d060737","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Tract Infections as described in the captured NLM MeSH descriptor D060737","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Tract Infections as: Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","support":[{"end":571,"quote":"Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","source_id":"nlm-mesh.d060737","source_sha256":"0f9febb8583d0158969561554b941c172a8467bf84454eef5135e416cb807e90","start":438}],"target_id":"concept.mesh.d060737","target_kind":"node","target_sha256":"1433ca455ecb92b270094fe5f17b4b339a0fe1b8e83837c1248c403c0aa600f7"}],"concept.mesh.d060845":[{"id":"assertion.concept.mesh.d060845","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hoarding as described in the captured NLM MeSH descriptor D060845","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hoarding as: A persistent difficulty discarding or parting with possessions.","support":[{"end":443,"quote":"A persistent difficulty discarding or parting with possessions.","source_id":"nlm-mesh.d060845","source_sha256":"b6a1db8b02d024309fa877414618c7e1a46cdc63bed382f37ce9d38df5a44691","start":380}],"target_id":"concept.mesh.d060845","target_kind":"node","target_sha256":"dc7d09618db73fb6920cf39ad2ef15c1bc34c339e9d4749fc70be3a338213278"}],"concept.mesh.d060846":[{"id":"assertion.concept.mesh.d060846","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cell Engineering as described in the captured NLM MeSH descriptor D060846","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cell Engineering as: Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules ( METABOLIC ENGINEERING ), for generation of tissue structures and organs in vitro ( TISSUE ENGINEERING ), or for other BIOENGINEERING research objectives.","support":[{"end":659,"quote":"Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules (\nMETABOLIC ENGINEERING\n), for generation of tissue structures and organs in vitro (\nTISSUE ENGINEERING\n), or for other\nBIOENGINEERING\nresearch objectives.","source_id":"nlm-mesh.d060846","source_sha256":"1890961c09afac5a9dbcea681c808f745ccaf82dc0730d410efdc5775e198274","start":368}],"target_id":"concept.mesh.d060846","target_kind":"node","target_sha256":"f644344d6c20729aec0ab9e95faf235af30ac3a600ab86dfd957a20c6d0ce5bb"}],"concept.mesh.d060847":[{"id":"assertion.concept.mesh.d060847","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metabolic Engineering as described in the captured NLM MeSH descriptor D060847","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metabolic Engineering as: Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as BIOREACTORS .","support":[{"end":548,"quote":"Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as\nBIOREACTORS\n.","source_id":"nlm-mesh.d060847","source_sha256":"da7b7d55470f345c2a01e06fb3cb8f2d0e8c5f4f4fd284af7638810e6cf58869","start":402}],"target_id":"concept.mesh.d060847","target_kind":"node","target_sha256":"15c3ba29bb03b9c9def9a49f61aa515af763e4a4e0011158c93b2f69ee443bc2"}],"concept.mesh.d060986":[{"id":"assertion.concept.mesh.d060986","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Water Wells as described in the captured NLM MeSH descriptor D060986","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Water Wells as: Constructions built to access underground water.","support":[{"end":394,"quote":"Constructions built to access underground water.","source_id":"nlm-mesh.d060986","source_sha256":"eb48bb1b40a54ffde7d954d0a8c77733277708e5f2b11f9629b1718efe82744a","start":346}],"target_id":"concept.mesh.d060986","target_kind":"node","target_sha256":"45773a977f0eaaf574933999d591d95f2490d14caa428bcfa64efa6f2ed12531"}],"concept.mesh.d061148":[{"id":"assertion.concept.mesh.d061148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hygiene Hypothesis as described in the captured NLM MeSH descriptor D061148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hygiene Hypothesis as: The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and AUTOIMMUNE DISEASES .","support":[{"end":622,"quote":"The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and\nAUTOIMMUNE DISEASES\n.","source_id":"nlm-mesh.d061148","source_sha256":"ee5009f947681a341958560011ae533e174a55832f4a96069304fc0c9d06599f","start":356}],"target_id":"concept.mesh.d061148","target_kind":"node","target_sha256":"c9d2f1cfb48d4a7662a625342aa5bee76846f641ae7d538f2a5c6f3baa286a63"}],"concept.mesh.d061565":[{"id":"assertion.concept.mesh.d061565","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cycloaddition Reaction as described in the captured NLM MeSH descriptor D061565","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cycloaddition Reaction as: Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","support":[{"end":483,"quote":"Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","source_id":"nlm-mesh.d061565","source_sha256":"3939fcfeff1dcc9c9efde032b24853f3a7e024c040cebf42b49096bdea9b0148","start":380}],"target_id":"concept.mesh.d061565","target_kind":"node","target_sha256":"d2145f4e328f815508c6cf78209f1b1db8614d30744446d043a154f13678c291"}],"concept.mesh.d062028":[{"id":"assertion.concept.mesh.d062028","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioprinting as described in the captured NLM MeSH descriptor D062028","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioprinting as: A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as MICROCHIP ANALYTICAL DEVICES , cell microarrays, or three dimensional anatomical structures.","support":[{"end":592,"quote":"A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as\nMICROCHIP ANALYTICAL DEVICES\n, cell microarrays, or three dimensional anatomical structures.","source_id":"nlm-mesh.d062028","source_sha256":"261b4818872957d7f03826299e171eca370e2096cc72124033de62c565b30e18","start":350}],"target_id":"concept.mesh.d062028","target_kind":"node","target_sha256":"93cdf2b44a0685110002daa8d27d6eaf719bdfdde2e53cce58caf5917f942906"}],"concept.mesh.d062069":[{"id":"assertion.concept.mesh.d062069","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Inventions as described in the captured NLM MeSH descriptor D062069","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Inventions as: A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","support":[{"end":446,"quote":"A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","source_id":"nlm-mesh.d062069","source_sha256":"1f098e1380f8bfa6a115162cd5a3fbaeb2be23b53f08fdfe807b999fae117aab","start":336}],"target_id":"concept.mesh.d062069","target_kind":"node","target_sha256":"e090b68698c48be98b9c52f1d4d45d60d0b280070441af22d0384ae0a560c4ac"}],"concept.mesh.d063369":[{"id":"assertion.concept.mesh.d063369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Knowledge Discovery as described in the captured NLM MeSH descriptor D063369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Knowledge Discovery as: A process that searches for hidden and important connections among information or results.","support":[{"end":476,"quote":"A process that searches for hidden and important connections among information or results.","source_id":"nlm-mesh.d063369","source_sha256":"e20869b03a4365f66e076a8fab5ecd6a0e602deabc1bf89da31e62f4c5261df2","start":386}],"target_id":"concept.mesh.d063369","target_kind":"node","target_sha256":"0ee94f74c9a92f6fe8dccb77ebce8ce4b51e1bf8bb428dd71118ef23c832f297"}],"concept.mesh.d063426":[{"id":"assertion.concept.mesh.d063426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Migration as described in the captured NLM MeSH descriptor D063426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Migration as: Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","support":[{"end":589,"quote":"Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","source_id":"nlm-mesh.d063426","source_sha256":"e3bb99fd0e6504611b9cec9cde8125bf895d784fe91f35d8b18822652a416a8b","start":487}],"target_id":"concept.mesh.d063426","target_kind":"node","target_sha256":"d4490da199b72582f5486dc69b475b6b6e90cfa6bea8e42bf4442435d7f023dd"}],"concept.mesh.d063586":[{"id":"assertion.concept.mesh.d063586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Validity, Research as described in the captured NLM MeSH descriptor D063586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Validity, Research as: Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","support":[{"end":681,"quote":"Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","source_id":"nlm-mesh.d063586","source_sha256":"58ccb071ffdfcf795719c9a30725f9bdcb8a7e922167c8461ab77fb1f7bc76de","start":370}],"target_id":"concept.mesh.d063586","target_kind":"node","target_sha256":"a1cbfa5c158c036dae4e3d1350fe3a74d100ecf29c79aadba6ab057c7fa52761"}],"concept.mesh.d064226":[{"id":"assertion.concept.mesh.d064226","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prescription Drug Diversion as described in the captured NLM MeSH descriptor D064226","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prescription Drug Diversion as: The transfer of prescription drugs from legal to illegal distribution and marketing networks.","support":[{"end":487,"quote":"The transfer of prescription drugs from legal to illegal distribution and marketing networks.","source_id":"nlm-mesh.d064226","source_sha256":"883829aeae2d80ba1a0215ed4d183615e0cee49865f8a2b994029941a3b52360","start":394}],"target_id":"concept.mesh.d064226","target_kind":"node","target_sha256":"8dcaa4119b5c80f874b9e5bc9d84ff2cd085ea35db069add6c246c0bd617a50d"}],"concept.mesh.d064423":[{"id":"assertion.concept.mesh.d064423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drug Trafficking as described in the captured NLM MeSH descriptor D064423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drug Trafficking as: The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","support":[{"end":496,"quote":"The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","source_id":"nlm-mesh.d064423","source_sha256":"583e0b93838adcb6278ef3c8da429bb8c2905994a3728467cd4ead24e2104cd4","start":372}],"target_id":"concept.mesh.d064423","target_kind":"node","target_sha256":"f204928b333adcb096e909369d60071e80fa8ec0680bedb282def7c510a76eb5"}],"concept.mesh.d064424":[{"id":"assertion.concept.mesh.d064424","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tobacco Use as described in the captured NLM MeSH descriptor D064424","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tobacco Use as: Use of TOBACCO (Nicotiana tabacum L) and TOBACCO PRODUCTS .","support":[{"end":397,"quote":"Use of TOBACCO (Nicotiana tabacum L) and\nTOBACCO PRODUCTS\n.","source_id":"nlm-mesh.d064424","source_sha256":"b5322b7ba694c34aeb578ca055557ca3c84188d7594bd086b4d0def79a5888c4","start":338}],"target_id":"concept.mesh.d064424","target_kind":"node","target_sha256":"181562b18c1b879b5266511b106e68d24dc42ea60c3c3ccc4718f63c4e14a859"}],"concept.mesh.d064890":[{"id":"assertion.concept.mesh.d064890","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Determinants of Health as described in the captured NLM MeSH descriptor D064890","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Determinants of Health as: The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","support":[{"end":685,"quote":"The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","source_id":"nlm-mesh.d064890","source_sha256":"c62b8869ad2d927c371222d27c809f778da0ebb6c0830de2cad101057a480d9d","start":406}],"target_id":"concept.mesh.d064890","target_kind":"node","target_sha256":"47fc7ae65b7217c026c3abb154be5698ea1dbdc1ced9bcd6f0e5b8d08697db92"}],"concept.mesh.d065287":[{"id":"assertion.concept.mesh.d065287","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Robotic Surgical Procedures as described in the captured NLM MeSH descriptor D065287","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Robotic Surgical Procedures as: Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","support":[{"end":554,"quote":"Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","source_id":"nlm-mesh.d065287","source_sha256":"4ed57db9abd5ea896549d29cfc7ff078be4570a004da661905620af44669779b","start":390}],"target_id":"concept.mesh.d065287","target_kind":"node","target_sha256":"e3ab824793545262230281062f9b9acb7c1846cca6857fae283ae5d041228f0c"}],"concept.mesh.d065840":[{"id":"assertion.concept.mesh.d065840","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Protective Factors as described in the captured NLM MeSH descriptor D065840","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Protective Factors as: An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","support":[{"end":803,"quote":"An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","source_id":"nlm-mesh.d065840","source_sha256":"a0aece48dcca712330cf98953734c478aa2c10762ce115fe45dc068ef387b89e","start":530}],"target_id":"concept.mesh.d065840","target_kind":"node","target_sha256":"5d94bf8d0759034c3527e9032852419c2a1a7bd70c07774d94d540e309551595"}],"concept.mesh.d066279":[{"id":"assertion.concept.mesh.d066279","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Courage as described in the captured NLM MeSH descriptor D066279","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Courage as: State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","support":[{"end":431,"quote":"State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","source_id":"nlm-mesh.d066279","source_sha256":"69eaed1f42d6fe72449457b2063a01fc0e1d38287145230981703bbad56e12a3","start":330}],"target_id":"concept.mesh.d066279","target_kind":"node","target_sha256":"b428a5d01f58ffef1e1dd500c8af076df9bf38590143f9753b3a13b4ab655cae"}],"concept.mesh.d066288":[{"id":"assertion.concept.mesh.d066288","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Romanticism as described in the captured NLM MeSH descriptor D066288","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Romanticism as: The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","support":[{"end":562,"quote":"The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","source_id":"nlm-mesh.d066288","source_sha256":"e1f693005d19dd361e29e346eee1e2e5b3bd96a694c32a2fa5c7ed2756253806","start":334}],"target_id":"concept.mesh.d066288","target_kind":"node","target_sha256":"ed2486b1c1ee2652b086262a7e89c8b6dacc3bbaa9fc1580b9086e270fe04afa"}],"concept.mesh.d066296":[{"id":"assertion.concept.mesh.d066296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Grounded Theory as described in the captured NLM MeSH descriptor D066296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Grounded Theory as: The generation of theories from analysis of empirical data.","support":[{"end":413,"quote":"The generation of theories from analysis of empirical data.","source_id":"nlm-mesh.d066296","source_sha256":"762fe19cf00bb44ee67bca3293742c90edd9828ea67485e448e40809f9a87249","start":354}],"target_id":"concept.mesh.d066296","target_kind":"node","target_sha256":"ef9602057f97e83659531c1c90fe7c2af168d82bdcb5e8666019736bfdcbd4f9"}],"concept.mesh.d066330":[{"id":"assertion.concept.mesh.d066330","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Printing, Three-Dimensional as described in the captured NLM MeSH descriptor D066330","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Printing, Three-Dimensional as: Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","support":[{"end":576,"quote":"Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","source_id":"nlm-mesh.d066330","source_sha256":"2dfcd70d769eb1a037bf33765da81d6280f50e5792f990c0e2608fb5620f03b6","start":410}],"target_id":"concept.mesh.d066330","target_kind":"node","target_sha256":"1f5f20707b75bb39443d5cc1dd19ea3fbdc51bcdb728bfe44a8671b07ba94111"}],"concept.nist.absolute":[{"id":"assertion.concept.nist.absolute","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines absolute performance guarantee as: An approximation algorithm will return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","support":[{"end":210,"quote":"An\napproximation algorithm\nwill return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","source_id":"nist-dads.absolute","source_sha256":"c58462d56f7ee57ff0d385e769989a80620dc4ae18d6c57617a553fbe78e436d","start":87}],"target_id":"concept.nist.absolute","target_kind":"node","target_sha256":"b533b70c80f5847b612623fbe821f9e87303ddb34c8e40ec2f037d763281cd22"}],"concept.nist.abstractdatatype":[{"id":"assertion.concept.nist.abstractdatatype","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines abstract data type as: A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT.","support":[{"end":203,"quote":"A set of data values and associated operations that are precisely specified independent of any particular implementation.\nAlso known as\nADT.","source_id":"nist-dads.abstractdatatype","source_sha256":"960b51c9c3e01e940cc5262ffa7e4c1826f99b0d94e377b0ed88a78a13ee0ee0","start":63}],"target_id":"concept.nist.abstractdatatype","target_kind":"node","target_sha256":"2a542e714b616e5502a8360817f98f700cb43782eef570c3ca146e4483b9273d"}],"concept.nist.abtree":[{"id":"assertion.concept.nist.abtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines (a,b)-tree as: A search tree with the restrictions that all leaves are at the same depth and all internal nodes have between a and b children , where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root may have as few as 2 children.","support":[{"end":276,"quote":"A\nsearch tree\nwith the restrictions that all\nleaves\nare at the same\ndepth\nand all\ninternal nodes\nhave between a and b\nchildren\n, where a and b are integers such that  2 ≤ a ≤ (b+1)/2.   The\nroot\nmay have as few as 2 children.","source_id":"nist-dads.abtree","source_sha256":"c7e1a0b1bbd03846acb7d6dfb3623a4bb8ec61a0ca0b24504ba612f9d724a5df","start":51}],"target_id":"concept.nist.abtree","target_kind":"node","target_sha256":"210f56cab769d7919edac7ee502386f6c2a6f8162cdd2ef8c21ed5e7e088b44c"}],"concept.nist.acceptingstt":[{"id":"assertion.concept.nist.acceptingstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines accepting state as: If a finite state machine finishes an input string and is in an accepting state , the string is accepted or considered to be valid.","support":[{"end":188,"quote":"If a\nfinite state machine\nfinishes an input string and is in an accepting\nstate\n, the string is accepted or considered to be valid.","source_id":"nist-dads.acceptingstt","source_sha256":"4c493f187d5cc2ffffa03f8b8b734e7134a9f880fb153511093857ce641f3ca7","start":57}],"target_id":"concept.nist.acceptingstt","target_kind":"node","target_sha256":"708af0a9efb4bb5218a0204085e7bfd7ed5bef5e980e91670d9b95d35d8b989b"}],"concept.nist.activedatastruc":[{"id":"assertion.concept.nist.activedatastruc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines active data structure as: A data structure with an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure. Also known as functional data structure.","support":[{"end":281,"quote":"A\ndata structure\nwith an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure.\nAlso known as\nfunctional data structure.","source_id":"nist-dads.activedatastruc","source_sha256":"daa502751b752a06e5465359794e44a24f6fbc760f1875ec2d30f56b78980f7b","start":73}],"target_id":"concept.nist.activedatastruc","target_kind":"node","target_sha256":"8f06f5ae8c7d5d7b5d4d634fdb47dc66c37550c7f762465d510f5e3fea13240c"}],"concept.nist.acyclicgraph":[{"id":"assertion.concept.nist.acyclicgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines acyclic graph as: A graph with no path that starts and ends at the same vertex .","support":[{"end":115,"quote":"A\ngraph\nwith no\npath\nthat starts and ends at the same\nvertex\n.","source_id":"nist-dads.acyclicgraph","source_sha256":"a2b836ec3e806883c9c3bd75cc9b58cadfc1ec90a01e23862a933d3141c4c869","start":53}],"target_id":"concept.nist.acyclicgraph","target_kind":"node","target_sha256":"89ab8142fe45ad01d3e3bf4526611f886e072acf7a421efd6f0f5d3ea594d3f3"}],"concept.nist.adaptivesort":[{"id":"assertion.concept.nist.adaptivesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive sort as: A sorting algorithm that can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","support":[{"end":226,"quote":"A\nsorting algorithm\nthat can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","source_id":"nist-dads.adaptivesort","source_sha256":"b63b6ce0bf5fa2012320b132231a0769ee0cb681091d41b85379422f8385fd75","start":53}],"target_id":"concept.nist.adaptivesort","target_kind":"node","target_sha256":"d7e184ca268a95eb1e324c9cc815446064f9f0dd7c39d7c97819157840662474"}],"concept.nist.adaptkdtree":[{"id":"assertion.concept.nist.adaptkdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive k-d tree as: A tree for multidimensional points where successive levels may be split along different dimensions.","support":[{"end":164,"quote":"A\ntree\nfor multidimensional points where successive levels may be split along different dimensions.","source_id":"nist-dads.adaptkdtree","source_sha256":"ea1d115780aaf076c84a7215b94fcc3e54e308c969c7c4b6396d9ca05bae62a2","start":65}],"target_id":"concept.nist.adaptkdtree","target_kind":"node","target_sha256":"a42bded3f438f5e818c4659f20a78594cce845e6f10f86c9c42136e04c5c7de9"}],"concept.nist.adjacencylistrep":[{"id":"assertion.concept.nist.adjacencylistrep","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adjacency-list representation as: A representation of a directed graph with n vertices using an array of n lists of vertices. List i contains vertex j if there is an edge from vertex i to vertex j. A weighted graph may be represented with a list of vertex/weight pairs. An undirected graph may be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","support":[{"end":449,"quote":"A representation of a\ndirected graph\nwith n\nvertices\nusing an\narray\nof n\nlists\nof vertices.  List i contains vertex j if there is an\nedge\nfrom vertex i to vertex j.  A\nweighted graph\nmay be represented with a list of vertex/weight pairs.  An\nundirected graph\nmay be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","source_id":"nist-dads.adjacencylistrep","source_sha256":"004313f778e86d1590c7a75cf20ea3abf444231948307687cc68a93f13c32c47","start":89}],"target_id":"concept.nist.adjacencylistrep","target_kind":"node","target_sha256":"180b904afbecb0b44c7c9d459b8abb98e12bb83ae241b36f43544536c399b1a2"}],"concept.nist.adjacent":[{"id":"assertion.concept.nist.adjacent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adjacent as: Two vertices of a graph are adjacent if there is an edge between them. Two edges of a graph are adjacent if they connect the same vertex.","support":[{"end":181,"quote":"Two\nvertices\nof a\ngraph\nare adjacent if there is an\nedge\nbetween them.  Two\nedges\nof a graph are adjacent if they connect the same vertex.","source_id":"nist-dads.adjacent","source_sha256":"ce75b66ee12881f2cf1993603ef5aeb7ed39ba6595e34465f7ad9f1b43baf792","start":43}],"target_id":"concept.nist.adjacent","target_kind":"node","target_sha256":"9ef48e088bb22c1709c15ad0c32d7b640e789a15a4762d42a530ea44368ba594"}],"concept.nist.adversary":[{"id":"assertion.concept.nist.adversary","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adversary as: A theoretical agent that uses information about the past moves of an on-line algorithm to choose inputs that force the worst-case cost of the algorithm.","support":[{"end":197,"quote":"A theoretical agent that uses information about the past moves of an\non-line algorithm\nto choose inputs that force the\nworst-case cost\nof the algorithm.","source_id":"nist-dads.adversary","source_sha256":"31df449b8519ac4d5600eabcf3cb96d7c50760ce3b13fc5be1619a98ad42bc96","start":45}],"target_id":"concept.nist.adversary","target_kind":"node","target_sha256":"3135bc8b5e6cdf3c69d2ec692f0556cd3b797b0691bf0cc058243c73be424650"}],"concept.nist.algorithm":[{"id":"assertion.concept.nist.algorithm","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines algorithm as: A computable set of steps to achieve a desired result.","support":[{"end":99,"quote":"A computable set of steps to achieve a desired result.","source_id":"nist-dads.algorithm","source_sha256":"e6601ea9aeb187c5995724ea3805c998d6acbe21ad2ac76b812af396f2f72727","start":45}],"target_id":"concept.nist.algorithm","target_kind":"node","target_sha256":"4e4fcce64da262a0d9801f7c3b9426a60faa711f350a170413c0db14b92efc80"}],"concept.nist.allpairsshortestpath":[{"id":"assertion.concept.nist.allpairsshortestpath","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines all pairs shortest path as: Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph .","support":[{"end":189,"quote":"Find the weight (or length) of the\nshortest paths\nbetween all pairs of\nvertices\nin a\nweighted, directed graph\n.","source_id":"nist-dads.allpairsshortestpath","source_sha256":"d3af414d844118a52915b9ad3b83906bb70e59b49ed9cba73a0a874f49e1138a","start":78}],"target_id":"concept.nist.allpairsshortestpath","target_kind":"node","target_sha256":"c07b3c8d7d5848b939ff960c9aa794273edad39f7257b87caed66e305c743806"}],"concept.nist.allsimplepaths":[{"id":"assertion.concept.nist.allsimplepaths","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines all simple paths as: Find all simple paths from a starting vertex ( source ) to a destination vertex ( sink ) in a directed graph . In an undirected graph , find all simple paths between two vertices.","support":[{"end":244,"quote":"Find all\nsimple paths\nfrom a starting\nvertex\n(\nsource\n) to a destination vertex (\nsink\n) in a\ndirected graph\n.  In an\nundirected graph\n, find all simple paths between two vertices.","source_id":"nist-dads.allsimplepaths","source_sha256":"f17e34da07fa69cded3fce078057f3e1280936d4706bb2d52f622f35e23855ea","start":64}],"target_id":"concept.nist.allsimplepaths","target_kind":"node","target_sha256":"e10e0e01f8f331c83ef3c89ee442316506389d3059233ba069ffb8c302f32c4d"}],"concept.nist.alphabet":[{"id":"assertion.concept.nist.alphabet","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alphabet as: The set of all possible symbols in an application. For instance, input characters used by a finite state machine , letters making up strings in a language , or symbols in a pattern element . In some cases, an alphabet may be infinite.","support":[{"end":278,"quote":"The set of all possible symbols in an application.  For instance, input characters used by a\nfinite state machine\n, letters making up strings in a\nlanguage\n, or symbols in a\npattern element\n. In some cases, an alphabet may be infinite.","source_id":"nist-dads.alphabet","source_sha256":"46fb84897c911d25475b0b86d7613a3cc3d4a309b14f07fe2faf7606db394d26","start":43}],"target_id":"concept.nist.alphabet","target_kind":"node","target_sha256":"6ec9de81d261cd4ba2385138a8eaafe021d0cadbe36dfa75b16384425b11e261"}],"concept.nist.alternation":[{"id":"assertion.concept.nist.alternation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternation as: A model of computation proposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR. The definition of accepting computation is adjusted accordingly.","support":[{"end":237,"quote":"A\nmodel of computation\nproposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR.  The definition of accepting computation is adjusted accordingly.","source_id":"nist-dads.alternation","source_sha256":"ee444cc474348712d777f010fd927cf32b5d55feb5762e89ffc874eb972d10c4","start":49}],"target_id":"concept.nist.alternation","target_kind":"node","target_sha256":"a3b9d8ef97ebad57eb0f0d28838240d671103d35f8da500b88b2b6a27558f109"}],"concept.nist.alternatngtr":[{"id":"assertion.concept.nist.alternatngtr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternating Turing machine as: A nondeterministic Turing machine having universal states , from which the machine accepts only if all possible moves out of that state lead to acceptance.","support":[{"end":234,"quote":"A\nnondeterministic Turing machine\nhaving\nuniversal states\n, from which the machine accepts only if all possible moves out of that state lead to acceptance.","source_id":"nist-dads.alternatngtr","source_sha256":"d5a275ed02ac1a1ed26cb5a9f42b9bbff6caa2614fb10ba7c271b08a056f7ef2","start":79}],"target_id":"concept.nist.alternatngtr","target_kind":"node","target_sha256":"23bbea8916bc90d108bc5fc343d70fd5cbf15ee1d1555e281b0c3efee9627138"}],"concept.nist.alterntngpth":[{"id":"assertion.concept.nist.alterntngpth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternating path as: A path with alternating free and matched edges.","support":[{"end":106,"quote":"A\npath\nwith alternating\nfree\nand\nmatched\nedges.","source_id":"nist-dads.alterntngpth","source_sha256":"31a416d31aa1ca52796b9e99f3c0c3b5a98a5b143e4110ad70c3a9cadf83b2bc","start":59}],"target_id":"concept.nist.alterntngpth","target_kind":"node","target_sha256":"f1b3f0ec344e753b76ed5237de226cf0ec78ae4110e2ff1eb87006bc7c35347f"}],"concept.nist.amortizdcost":[{"id":"assertion.concept.nist.amortizdcost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines amortized cost as: The theoretical speed of a given set of operations. It is O(f(n)) when the execution time of the worst case of all sequences of n operations never exceeds O(n*f(n)).","support":[{"end":221,"quote":"The theoretical speed of a given set of operations.  It is\nO(f(n))\nwhen the execution time of the\nworst case\nof all sequences of\nn\noperations never exceeds O(n*f(n)).","source_id":"nist-dads.amortizdcost","source_sha256":"8c5802ed82227eecd5d3f0f6f7577c8d2e57d135f2152e517baf0838ebc57458","start":55}],"target_id":"concept.nist.amortizdcost","target_kind":"node","target_sha256":"b8c9283e1d31dd8b8b92219b63791ce8eae2698b91104ee8910a4548370065cd"}],"concept.nist.ancestor":[{"id":"assertion.concept.nist.ancestor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ancestor as: A parent of a node in a tree , the parent of the parent, etc.","support":[{"end":104,"quote":"A\nparent\nof a\nnode\nin a\ntree\n, the parent of the parent, etc.","source_id":"nist-dads.ancestor","source_sha256":"4a6497422ee3ebb8886cfa56f34502b2fcaaa7277e89f411d48a350e59d2e2ac","start":43}],"target_id":"concept.nist.ancestor","target_kind":"node","target_sha256":"ea0acf256ddd9c9977f42ddec662a2a620a3dfa3a8a3af00287fc8819175385d"}],"concept.nist.and":[{"id":"assertion.concept.nist.and","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines and as: Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","support":[{"end":97,"quote":"Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","source_id":"nist-dads.and","source_sha256":"bed8b060829f9f950b0299670aa43506b6f39011bcfddbe73cb659909d52e88c","start":33}],"target_id":"concept.nist.and","target_kind":"node","target_sha256":"646d9fe644a927d2b35a979f0a2fe87e898cf30d17f58ee254b502a03268d3a6"}],"concept.nist.ansi":[{"id":"assertion.concept.nist.ansi","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ANSI as: American National Standards Institute.","support":[{"end":73,"quote":"American National Standards Institute.","source_id":"nist-dads.ansi","source_sha256":"d1f429e2b64ef1df485ff3ee5dddb0b25d7f3de06af067db65607e5fffc37c16","start":35}],"target_id":"concept.nist.ansi","target_kind":"node","target_sha256":"9cd13698bf2b57317585a825ddb7767d3f1049238197bf24a5e1a4131e19bd46"}],"concept.nist.antichain":[{"id":"assertion.concept.nist.antichain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines antichain as: A subset of mutually incomparable elements in a poset .","support":[{"end":100,"quote":"A subset of mutually incomparable elements in a\nposet\n.","source_id":"nist-dads.antichain","source_sha256":"928977e5193bc608c21ea93e01ffb79aca419d70834f3058a95c73136cfabe4e","start":45}],"target_id":"concept.nist.antichain","target_kind":"node","target_sha256":"a3ffcdf4d18562929de16de21e80150af35229ee1c582acd87fbda3b02b9ab24"}],"concept.nist.antisymmetric":[{"id":"assertion.concept.nist.antisymmetric","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines antisymmetric as: A binary relation R for which a R b and b R a implies a = b.","support":[{"end":113,"quote":"A\nbinary relation\nR for which a R b and b R a implies a = b.","source_id":"nist-dads.antisymmetric","source_sha256":"54d9d41adb44556a698411b49eade36301ca3c9c0844bdbd298869c939ff7cd0","start":53}],"target_id":"concept.nist.antisymmetric","target_kind":"node","target_sha256":"70f13ec28fa99e38e4c4ae8d69b55d02603d2c24affc6177780554b736e888de"}],"concept.nist.arborescence":[{"id":"assertion.concept.nist.arborescence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines arborescence as: Informally, a directed tree .","support":[{"end":80,"quote":"Informally, a\ndirected\ntree\n.","source_id":"nist-dads.arborescence","source_sha256":"042ac18e97ce4951e30d80dd0138fbe7000bb810d0ab71ca606256e67c931bbf","start":51}],"target_id":"concept.nist.arborescence","target_kind":"node","target_sha256":"85e22d143b52a875619fba2abeed597f997f19e11ac102c179c7750262ffa75e"}],"concept.nist.array":[{"id":"assertion.concept.nist.array","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines array as: An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and get(i, A), where i is a numeric index, v is a value, and A is an array. The operations may be defined with axiomatic semantics as follows. new() returns an array get(i, set(i, v, A)) = v get(i, set(j, v, A)) = get(i, A) if i ≠ j Compare this with a dictionary using integers as keys. If the contents of a new array are set to some implicit initial value v i , we could add the following rule for get. get(i, new()) = v i Typically arrays have a fixed size and use either 0-based indexing or 1-based indexing . Fixed initial size and 0-based indexing may incorporated as follows. new(s) returns an array, which has a size s size(new(s)) = s size(set(i, v, A)) = size(A) get(i, set(i, v, A)) = v if 0 ≤ i < size(A) get(i, set(j, v, A)) = get(i, A) if i ≠ j One-based or other indexing may be defined similarly.","support":[{"end":1052,"quote":"An assemblage of items that are randomly accessible by integers, the index.\nFormal Definition:\nIgnoring size an array may be seen as an\nabstract data type\nwith the operations new(), set(i, v, A), and get(i, A),  where i is a numeric index, v is a value, and A is an array.  The operations may be defined with\naxiomatic semantics\nas follows.\nnew() returns an array\nget(i, set(i, v, A)) = v\nget(i, set(j, v, A)) = get(i, A) if i ≠ j\nCompare this with a\ndictionary\nusing integers as keys.\nIf the contents of a new array are set to some implicit initial value v\ni\n, we could add the following rule for get.\nget(i, new()) = v\ni\nTypically arrays have a fixed size and use either\n0-based indexing\nor\n1-based indexing\n.  Fixed initial size and 0-based indexing may incorporated as follows.\nnew(s) returns an array, which has a size s\nsize(new(s)) = s\nsize(set(i, v, A)) = size(A)\nget(i, set(i, v, A)) = v if 0 ≤ i < size(A)\nget(i, set(j, v, A)) = get(i, A) if i ≠ j\nOne-based or other indexing may be defined similarly.","source_id":"nist-dads.array","source_sha256":"69bfbed7c5701823671c2797166f8b2ca58d071f3602d59c8816b6d3bedf76c7","start":41}],"target_id":"concept.nist.array","target_kind":"node","target_sha256":"801c27b3ecf8878e563b195ce5cad0d80d0e0664b0651acc808cd232cc05353d"}],"concept.nist.arrayindex":[{"id":"assertion.concept.nist.arrayindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array index as: The location of an item in an array .","support":[{"end":86,"quote":"The location of an item in an\narray\n.","source_id":"nist-dads.arrayindex","source_sha256":"5268fbeb35d8237761632f281dcad8323e0a6b9a11db890d837b04c1c0cd35a8","start":49}],"target_id":"concept.nist.arrayindex","target_kind":"node","target_sha256":"314ae9d1022a86cdb2862ea60a9fae0a9a96222d6b366db5f6b7dd64271bfbb3"}],"concept.nist.arraysearch":[{"id":"assertion.concept.nist.arraysearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array search as: Find an element in an array . Various algorithms exist which require more or less structure in the array elements or implementation.","support":[{"end":189,"quote":"Find an element in an\narray\n.  Various algorithms exist which require more or less structure in the array elements or implementation.","source_id":"nist-dads.arraysearch","source_sha256":"c006ad182d4e5fc7ff5366bee728b220b84e4320a792197c1d21b91bd6762843","start":56}],"target_id":"concept.nist.arraysearch","target_kind":"node","target_sha256":"223487387d5adcf91c9e16b4e5c824fed764e733df0ded1187bed7c4e55c9950"}],"concept.nist.assignment":[{"id":"assertion.concept.nist.assignment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines assignment problem as: The problem of finding a maximum (or minimum) weight matching in a weighted , bipartite graph . Also known as marriage problem.","support":[{"end":195,"quote":"The problem of finding a maximum (or minimum) weight\nmatching\nin a\nweighted\n,\nbipartite graph\n.\nAlso known as\nmarriage problem.","source_id":"nist-dads.assignment","source_sha256":"ed93b8a09219cb7163ba0105cad8403b1c927c1e4318be1a694531982d2c35c6","start":68}],"target_id":"concept.nist.assignment","target_kind":"node","target_sha256":"b45f3872d0ce6f0855cd0f550e30e9cbe601886d3401401de02848ad214a146e"}],"concept.nist.assocarray":[{"id":"assertion.concept.nist.assocarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines associative array as: A collection of items that are randomly accessible by a key , often a string .","support":[{"end":143,"quote":"A collection of items that are randomly accessible by a\nkey\n, often a\nstring\n.","source_id":"nist-dads.assocarray","source_sha256":"bdc8fd0bd8b12ec0af9f792621081132a2a4d24ed48e3623dc5314ebfb376153","start":65}],"target_id":"concept.nist.assocarray","target_kind":"node","target_sha256":"ae29fa6293fa9ed9bb6578f465308f238da8092cfd2cbddb206e639b20cd530d"}],"concept.nist.associative":[{"id":"assertion.concept.nist.associative","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines associative as: A function where f(A, f(B, C)) = f(f(A, B), C).","support":[{"end":96,"quote":"A function where f(A, f(B, C)) = f(f(A, B), C).","source_id":"nist-dads.associative","source_sha256":"2382b2f945369327999e0ec28290f3d571a9f4134408d226755dab17b2b9a33a","start":49}],"target_id":"concept.nist.associative","target_kind":"node","target_sha256":"3663db5f4c01134c8c729b7ddea0b2538d3be4b1775d4f997bef9b87094c1c34"}],"concept.nist.asymptoticbound":[{"id":"assertion.concept.nist.asymptoticbound","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines asymptotic bound as: A curve representing the limit of a function. That is, the distance between a function and the curve tends to zero. The function may or may not intersect the bounding curve.","support":[{"end":234,"quote":"A curve representing the limit of a function.  That is, the distance between a function and the curve tends to zero.  The function may or may not intersect the bounding curve.","source_id":"nist-dads.asymptoticbound","source_sha256":"8ee29cf93ee35fd049c429bedced31c2f064106ef3b7f3fab74e363c81bb9650","start":59}],"target_id":"concept.nist.asymptoticbound","target_kind":"node","target_sha256":"7da18d59a724ce24c61c972fce26c708b535d013cc8c27ce68e0bc7b2420acc3"}],"concept.nist.asymptoticspacecomplexity":[{"id":"assertion.concept.nist.asymptoticspacecomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines asymptotic space complexity as: The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","support":[{"end":237,"quote":"The limiting behavior of the use of memory space of an\nalgorithm\nwhen the size of the problem goes to infinity.  This is usually denoted in\nbig-O notation\n.","source_id":"nist-dads.asymptoticspacecomplexity","source_sha256":"e23ccc597631a57b5e924517109fcd7ea6b5ba38a51d7bb004b28ccaa5ef0d92","start":81}],"target_id":"concept.nist.asymptoticspacecomplexity","target_kind":"node","target_sha256":"5b9613325cfd439bdddf8c6e8c0c558d14b7aa28756fb85b214dff48659f0266"}],"concept.nist.asymptotictimecomplexity":[{"id":"assertion.concept.nist.asymptotictimecomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines asymptotic time complexity as: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","support":[{"end":230,"quote":"The limiting behavior of the execution time of an\nalgorithm\nwhen the size of the problem goes to infinity.  This is usually denoted in\nbig-O notation\n.","source_id":"nist-dads.asymptotictimecomplexity","source_sha256":"8de4dc5e6cec52621c474b3aad78356545979a6f40eacec3d32737c990a14a53","start":79}],"target_id":"concept.nist.asymptotictimecomplexity","target_kind":"node","target_sha256":"5abd1c3dc057343f596ee58024ed16917f019f9d7f8ed948d45a090bcb94b3ee"}],"concept.nist.augmentngpth":[{"id":"assertion.concept.nist.augmentngpth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines augmenting path as: A path with alternating free and matched edges that begins and ends with free vertices . Used to augment (improve or increase) a matching or flow .","support":[{"end":204,"quote":"A\npath\nwith alternating\nfree\nand\nmatched\nedges that begins and ends with\nfree vertices\n. Used to augment (improve or increase) a\nmatching\nor\nflow\n.","source_id":"nist-dads.augmentngpth","source_sha256":"7d40b64394067e5d17f22ec536b4c1fef0a95d23b72ffe27d7d972d4554fdbb2","start":57}],"target_id":"concept.nist.augmentngpth","target_kind":"node","target_sha256":"371bfe3ba5f6891625e55f350b337a26ec6b67ef540a726dfd309edcad4f0c94"}],"concept.nist.averagecase":[{"id":"assertion.concept.nist.averagecase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines average case as: Having to do with the mathematical average of all cases.","support":[{"end":107,"quote":"Having to do with the mathematical average of all cases.","source_id":"nist-dads.averagecase","source_sha256":"35d001e9fed6608ee0f78aa76362fa9b03e57a8d367e65a6d086ff8085553dd1","start":51}],"target_id":"concept.nist.averagecase","target_kind":"node","target_sha256":"dbe70714203050ae53d4657031c9501318b2e6ae4a10a5ee105547c73ec01791"}],"concept.nist.averagecasecost":[{"id":"assertion.concept.nist.averagecasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines average-case cost as: The sum of costs of an algorithm over all possible inputs divided by the number of possible inputs.","support":[{"end":160,"quote":"The sum of costs of an\nalgorithm\nover all possible inputs divided by the number of possible inputs.","source_id":"nist-dads.averagecasecost","source_sha256":"88548372eac96dd201f601e98f56f734e3e82e3df84310788bd0faa80e4353ff","start":61}],"target_id":"concept.nist.averagecasecost","target_kind":"node","target_sha256":"1969f3953bdf29a557f7e3a6fd274e188d68c2cc13f408a6066eeeed62071e06"}],"concept.nist.avltree":[{"id":"assertion.concept.nist.avltree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines AVL tree as: A balanced binary search tree where the height of the two subtrees ( children ) of a node differs by at most one. Look-up, insertion, and deletion are O(log n) , where n is the number of nodes in the tree.","support":[{"end":252,"quote":"A\nbalanced\nbinary search tree\nwhere the\nheight\nof the two subtrees (\nchildren\n) of a node differs by at most one. Look-up, insertion, and deletion are\nO(log n)\n, where n is the number of\nnodes\nin the tree.","source_id":"nist-dads.avltree","source_sha256":"b0b99a1d255f125df958de2097b12a6f62b211da04bfd9101ebae53d39d831c4","start":47}],"target_id":"concept.nist.avltree","target_kind":"node","target_sha256":"9f4d936546dd37e5365b64acc568769c16bd1138512550ac2b031285916c30be"}],"concept.nist.axiomaticsemantics":[{"id":"assertion.concept.nist.axiomaticsemantics","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines axiomatic semantics as: Defining the behavior of an abstract data type with axioms.","support":[{"end":124,"quote":"Defining the behavior of an\nabstract data type\nwith axioms.","source_id":"nist-dads.axiomaticsemantics","source_sha256":"5081e223651984635ca8834f9eb4889a83b22dbbbcba9bb346f2990b233814ac","start":65}],"target_id":"concept.nist.axiomaticsemantics","target_kind":"node","target_sha256":"8e6d4bdd609985c762476880e02823e27af13247c356dc991e077eb07ada2a0d"}],"concept.nist.bag":[{"id":"assertion.concept.nist.bag","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bag as: An unordered collection of values that may have duplicates. Formal Definition: A bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with axiomatic semantics as follows. new() returns a bag numberIn(v, new()) = 0 numberIn(v, add(v, B)) = 1 + numberIn(v, B) numberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u remove(v, new()) = new() remove(v, add(v, B)) = B remove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u where B is a bag and u and v are elements. The predicate isEmpty(B) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, B)) = false Also known as multi-set.","support":[{"end":772,"quote":"An unordered collection of values that may have duplicates.\nFormal Definition:\nA bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with\naxiomatic semantics\nas follows.\nnew() returns a bag\nnumberIn(v, new()) = 0\nnumberIn(v, add(v, B)) = 1 + numberIn(v, B)\nnumberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u\nremove(v, new()) = new()\nremove(v, add(v, B)) = B\nremove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u\nwhere B is a bag and u and v are elements.\nThe\npredicate\nisEmpty(B) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(add(v, B)) = false\nAlso known as\nmulti-set.","source_id":"nist-dads.bag","source_sha256":"ee6444c90b834c612da8e343598ed1307cd42e360fb65bd701e968683108d442","start":37}],"target_id":"concept.nist.bag","target_kind":"node","target_sha256":"1b88a554da84531630b583b51b39dca3a92404638558b3805b7aafdfb826796c"}],"concept.nist.balance":[{"id":"assertion.concept.nist.balance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balance as: The (weight) balance of a tree is the number of leaves of the left subtree of a tree, denoted |T l |, divided by the total number of leaves of the tree. Formally, ρ(T) = |T l |/|T|. Also known as root balance.","support":[{"end":252,"quote":"The (weight) balance of a tree is the number of\nleaves\nof the left subtree of a tree, denoted |T\nl\n|, divided by the total number of leaves of the tree.  Formally, ρ(T)  = |T\nl\n|/|T|.\nAlso known as\nroot balance.","source_id":"nist-dads.balance","source_sha256":"7ee958ec370acabf981f3ddb996ce7ca93e343c8fa136c8a34db366ec3def35b","start":41}],"target_id":"concept.nist.balance","target_kind":"node","target_sha256":"faeb580626d02525a38644434c1259819b33f3036ee49969a97172d094f78b11"}],"concept.nist.balancedbist":[{"id":"assertion.concept.nist.balancedbist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced binary search tree as: A binary search tree that is balanced .","support":[{"end":124,"quote":"A\nbinary search tree\nthat is\nbalanced\n.","source_id":"nist-dads.balancedbist","source_sha256":"baa8f5753846b586cdf0d59a832ff3e23be9474ecde8514505de67482948c632","start":85}],"target_id":"concept.nist.balancedbist","target_kind":"node","target_sha256":"bdf8e38d433af8e0637e221d28d6b2136b0336c8ac1f797a1ba052126e647e40"}],"concept.nist.balancedbitr":[{"id":"assertion.concept.nist.balancedbitr","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines balanced binary tree as: A binary tree where no leaf is more than a certain amount farther from the root than any other. After inserting or deleting a node , the tree may rebalanced with rotations .","support":[{"end":245,"quote":"A\nbinary tree\nwhere no\nleaf\nis more than a certain amount farther from the\nroot\nthan any other.  After inserting or deleting a\nnode\n, the tree may rebalanced with\nrotations\n.","source_id":"nist-dads.balancedbitr","source_sha256":"1e790d8f01ee968fa5a14d3403616c6aca67537a5e39e5c89fe91cf4660f20a7","start":71}],"target_id":"concept.nist.balancedbitr","target_kind":"node","target_sha256":"ed4cfb0f56e304685494cead5d8b640f58fac118d8e4d870480380ac19f2e9d6"}],"concept.nist.balancedtree":[{"id":"assertion.concept.nist.balancedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced tree as: A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","support":[{"end":261,"quote":"A\ntree\nwhere no\nleaf\nis much farther away from the\nroot\nthan any other leaf.  Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","source_id":"nist-dads.balancedtree","source_sha256":"985a05da920669f899b2147e3d1ef926b4cb3b95a419f7b420c3e84532211ec0","start":57}],"target_id":"concept.nist.balancedtree","target_kind":"node","target_sha256":"7371773e310bf4e7b65a9f0aaa622dc2f57e31573e4dd2766e6e21ea25a9d7eb"}],"concept.nist.bangfile":[{"id":"assertion.concept.nist.bangfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BANG file as: A balanced and nested grid (BANG) file is a point access method that divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Cells may intersect, and points may be distributed between them.","support":[{"end":276,"quote":"A balanced and nested grid (BANG) file is a\npoint access method\nthat divides space into a nonperiodic grid.  Each spatial dimension is divided by a\nlinear hash\n.  Cells may intersect, and points may be distributed between them.","source_id":"nist-dads.bangfile","source_sha256":"49ba11675f98bb810ef9912738bc9968e8b6b5fe92d2b4e3ec61ab22dcc0fac5","start":49}],"target_id":"concept.nist.bangfile","target_kind":"node","target_sha256":"2f84a3839346cefcf8639056baf66b1c117d807d9ba78425483f92ea182f4946"}],"concept.nist.bbalphatree":[{"id":"assertion.concept.nist.bbalphatree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BB(α) tree as: A binary tree where the balance of every subtree, ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α. Also known as weight-balanced tree.","support":[{"end":179,"quote":"A\nbinary tree\nwhere the\nbalance\nof every subtree,  ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α.\nAlso known as\nweight-balanced tree.","source_id":"nist-dads.bbalphatree","source_sha256":"e7401f3b873f0c06fac0630b0442d2b884e3b0445ecb9afd0494cb5eb5526420","start":55}],"target_id":"concept.nist.bbalphatree","target_kind":"node","target_sha256":"32c9c9ee70e852667afa985955487dc82fbdb3c85cf600f3b3b9913f62e283a5"}],"concept.nist.bdd":[{"id":"assertion.concept.nist.bdd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BDD as: A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","support":[{"end":174,"quote":"A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","source_id":"nist-dads.bdd","source_sha256":"b665238c6741acb4e5832456bf5ded0c86a64dd78a67096e9f4dea87ea673454","start":37}],"target_id":"concept.nist.bdd","target_kind":"node","target_sha256":"028b3455240f4772f6f4a7b2a63302bcb898a5e5714dc4d263852e1f03d229db"}],"concept.nist.bdtree":[{"id":"assertion.concept.nist.bdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BD-tree as: A binary tree that organizes multidimensional points by splitting off regular subintervals.","support":[{"end":136,"quote":"A\nbinary tree\nthat organizes multidimensional points by splitting off regular subintervals.","source_id":"nist-dads.bdtree","source_sha256":"4c84db90751e4ec2816172cf99b31065e9f86390e773795cb3154becba92d975","start":45}],"target_id":"concept.nist.bdtree","target_kind":"node","target_sha256":"55511acf456f3276cf8ecea2182d21cf84fa6abfef7667799732c253661863ae"}],"concept.nist.bestcase":[{"id":"assertion.concept.nist.bestcase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best case as: (1) The situation or input for which an algorithm or data structure takes the least time or resources. (2) Having to do with this situation or input.","support":[{"end":194,"quote":"(1) The situation or input for which an\nalgorithm\nor\ndata structure\ntakes the least time or resources. (2) Having to do with this situation or input.","source_id":"nist-dads.bestcase","source_sha256":"047fc80e2d09389390657422c024410ff1005dbe71104db1152c2799048dd98f","start":45}],"target_id":"concept.nist.bestcase","target_kind":"node","target_sha256":"ed84138684035c9124ba0cb444603a97a8cbebb203c572074cbe70bfc5de50c8"}],"concept.nist.bestcasecost":[{"id":"assertion.concept.nist.bestcasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best-case cost as: The minimum cost to process an input sequence. Also known as optimal cost.","support":[{"end":129,"quote":"The minimum cost to process an input sequence.\nAlso known as\noptimal cost.","source_id":"nist-dads.bestcasecost","source_sha256":"72d7bab9376ec83e9753dbcc0ee09150d383686afc856db490d3b0a5d79322f5","start":55}],"target_id":"concept.nist.bestcasecost","target_kind":"node","target_sha256":"4d1c5aaf65676d659b78cd60363d5355c9c4c5e89be245d65fe5d118c82a7e5c"}],"concept.nist.biconnectedcomponent":[{"id":"assertion.concept.nist.biconnectedcomponent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines biconnected component as: A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex .","support":[{"end":208,"quote":"A maximal subset of\nedges\nof a\nconnected graph\nsuch that the corresponding induced subgraph cannot be disconnected by deleting any\nvertex\n.","source_id":"nist-dads.biconnectedcomponent","source_sha256":"96901f4f26cada3f33e993b61f466a5b568301c49f6474ac77955913e1a14582","start":69}],"target_id":"concept.nist.biconnectedcomponent","target_kind":"node","target_sha256":"01ca97ec420bf4d47581ca4d31c5a1d64f0b35e47c520193b91f423235becac0"}],"concept.nist.biconnectedgraph":[{"id":"assertion.concept.nist.biconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines biconnected graph as: A connected graph that is not broken into disconnected pieces by deleting any single vertex (and incident edges ).","support":[{"end":175,"quote":"A\nconnected graph\nthat is not broken into disconnected pieces by deleting any single\nvertex\n(and incident\nedges\n).","source_id":"nist-dads.biconnectedgraph","source_sha256":"4f06a085f901f9f6195656cf4855f13ab2d4b165f014eef65f9110f206b7c831","start":61}],"target_id":"concept.nist.biconnectedgraph","target_kind":"node","target_sha256":"8df09e15ce2e5be33a97f49e19736f99e1a4c0733f1966714d74770951c47be0"}],"concept.nist.bigonotation":[{"id":"assertion.concept.nist.bigonotation","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines big-O notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n). The notation is read, \"f of n is big oh of g of n\". Formal Definition: f(n) = O(g(n)) means there are positive constants c and k, such that 0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n. Also known as O, asymptotic upper bound.","support":[{"end":612,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n).     The notation is read, \"f of n is big oh of g of n\".\nFormal Definition:\nf(n) = O(g(n)) means there are positive constants c and k, such that  0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n.\nAlso known as\nO, asymptotic upper bound.","source_id":"nist-dads.bigonotation","source_sha256":"2f0cb01df3f8c0c2021fc4291f3f48e12509f010077d67528950f45332616ca8","start":55}],"target_id":"concept.nist.bigonotation","target_kind":"node","target_sha256":"4c80b72e53ccd9b921998435626df565e8a4fc332000100c7844d6fe8405d43f"}],"concept.nist.binaryfunc":[{"id":"assertion.concept.nist.binaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary function as: A function with two arguments.","support":[{"end":87,"quote":"A\nfunction\nwith two arguments.","source_id":"nist-dads.binaryfunc","source_sha256":"c2579d87ab9f72a2e2fcdbd2ac6cb8eb70f1c5990d72918a6c385fb5d4a6d4f6","start":57}],"target_id":"concept.nist.binaryfunc","target_kind":"node","target_sha256":"be5fe9ceb3f2d98a3ef34b1fef0a26cc9266e191bf73f0d1f9d31ad92fcd1e51"}],"concept.nist.binaryheap":[{"id":"assertion.concept.nist.binaryheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary heap as: A complete binary tree where every node has a key more extreme (greater or less) than or equal to the key of its parent .","support":[{"end":174,"quote":"A\ncomplete binary tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than or equal to the key of its\nparent\n.","source_id":"nist-dads.binaryheap","source_sha256":"861a125cb6a5836bf6afb24204c429ae50e15df1cc008248cafb6c44ac7f2a6e","start":53}],"target_id":"concept.nist.binaryheap","target_kind":"node","target_sha256":"2fe0fb78b89a00ff9b499fec7e5310ca014b97ef5785fc06614eaab3e1f95cce"}],"concept.nist.binarypriorityqueue":[{"id":"assertion.concept.nist.binarypriorityqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary priority queue as: A priority queue implemented with a binary tree having the following restrictions: The key of a node is greater than keys of its children , i.e., it has the heap property . If the right subtree is not empty, the left subtree is not empty. If there are both left and right children, the left child's key is greater than the right child's key.","support":[{"end":414,"quote":"A\npriority queue\nimplemented with a\nbinary tree\nhaving the following restrictions:\nThe\nkey\nof a\nnode\nis greater than keys of its\nchildren\n, i.e., it has the\nheap property\n.\nIf the right\nsubtree\nis not empty, the left subtree is not empty.\nIf there are both left and right children, the left child's key is greater than the right child's key.","source_id":"nist-dads.binarypriorityqueue","source_sha256":"2591e6795134e6a3a8978fa660a7ff4d84337266868539dd93b6f4c9380b07b7","start":73}],"target_id":"concept.nist.binarypriorityqueue","target_kind":"node","target_sha256":"dde087e659cd432e21d71ad84322e6982708bca19b4e3adf6a6e8f91498f9bb9"}],"concept.nist.binaryrelation":[{"id":"assertion.concept.nist.binaryrelation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary relation as: A relation between exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an edge to) for vertices of a graph .","support":[{"end":240,"quote":"A\nrelation\nbetween exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an\nedge\nto) for\nvertices\nof a\ngraph\n.","source_id":"nist-dads.binaryrelation","source_sha256":"f703dcf360db3a37493dff54544669c2c63829ffbdad1084c5ab6adf50c01010","start":57}],"target_id":"concept.nist.binaryrelation","target_kind":"node","target_sha256":"0f0ecb49e0b1acd21ed2328f3a7e1700804d923c2dc84389c63590f562ce1f44"}],"concept.nist.binarysearchtree":[{"id":"assertion.concept.nist.binarysearchtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary search tree as: A binary tree where every node's left subtree has keys less than the node's key, and every right subtree has keys greater than the node's key.","support":[{"end":209,"quote":"A\nbinary tree\nwhere every\nnode's\nleft\nsubtree\nhas\nkeys\nless than the node's key, and every right subtree has keys greater than the node's key.","source_id":"nist-dads.binarysearchtree","source_sha256":"aff36eb9abb3b83838628591edca1e88ac1ed5d045a8ffa5eb43668a165e41bb","start":67}],"target_id":"concept.nist.binarysearchtree","target_kind":"node","target_sha256":"8ab723b4841c3aac5f610266ba6842b0a8784c5c662189a3248ce01e392467f0"}],"concept.nist.binarytree":[{"id":"assertion.concept.nist.binarytree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary tree as: A tree with at most two children for each node . Formal Definition: A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree. Also known as dyadic tree.","support":[{"end":254,"quote":"A\ntree\nwith at most two\nchildren\nfor each\nnode\n.\nFormal Definition:\nA binary tree either\nis empty (no nodes), or\nhas a\nroot\nnode, a left binary tree, and a right binary tree.\nAlso known as\ndyadic tree.","source_id":"nist-dads.binarytree","source_sha256":"b31629abe43a911ab2d8aeb5603d384cfc29e0afd4dddf8c5709b1f2e9787237","start":53}],"target_id":"concept.nist.binarytree","target_kind":"node","target_sha256":"9e4580ff8cbc61844d22667e94167d1c54eb8118d53576da3b875ad190a977eb"}],"concept.nist.binomialheap":[{"id":"assertion.concept.nist.binomialheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binomial heap as: A heap made of a forest of binomial trees with the heap property numbered k=0, 1, 2, …, n, each containing either 0 or 2 k nodes . Each tree is formed by linking two of its predecessors, by joining one at the root of the other. The operations of insert a value, decrease a value, delete a value, and merge or join ( meld ) two queues take O(log n) time. The find minimum operation is a constant Θ(1) .","support":[{"end":460,"quote":"A\nheap\nmade of a\nforest\nof\nbinomial trees\nwith the\nheap property\nnumbered k=0, 1, 2, …, n, each containing either 0 or 2\nk\nnodes\n. Each tree is formed by linking two of its predecessors, by joining one at the\nroot\nof the other.  The operations of insert a value, decrease a value, delete a value, and merge or join (\nmeld\n) two queues take\nO(log n)\ntime.  The find minimum operation is a constant\nΘ(1)\n.","source_id":"nist-dads.binomialheap","source_sha256":"d1eb18ca83685f3da3fb02b85abd92956d6d7505e279c6caa577822782ce9a6d","start":57}],"target_id":"concept.nist.binomialheap","target_kind":"node","target_sha256":"aef24503937a90949e1b6c1a660ea0398d3e4024f7d44db95ed0ebffaa010a99"}],"concept.nist.binpacking":[{"id":"assertion.concept.nist.binpacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bin packing problem as: Determine how to put the most objects in the least number of fixed space bins. More formally, find a partition and assignment of a set of objects such that a constraint is satisfied or an objective function is minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","support":[{"end":447,"quote":"Determine how to put the most objects in the least number of fixed space bins.  More formally, find a\npartition\nand assignment of a\nset\nof objects such that a constraint is satisfied or an\nobjective function\nis minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","source_id":"nist-dads.binpacking","source_sha256":"4a8b6cd8cf99136f27526b2b895e1b5254bc07483e251044877ed5083bcf97fc","start":70}],"target_id":"concept.nist.binpacking","target_kind":"node","target_sha256":"5c841483c50be669ff6cd193b11dfafacd2acd048896649768cad76b80cf5b75"}],"concept.nist.bintree":[{"id":"assertion.concept.nist.bintree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bintree as: A regular decomposition k-d tree for region data.","support":[{"end":94,"quote":"A\nregular decomposition\nk-d tree\nfor region data.","source_id":"nist-dads.bintree","source_sha256":"e568a8a89c75f54496e5319a7f258daf2d0f98caffbbb1a9595ec8fe6c9dc4d8","start":45}],"target_id":"concept.nist.bintree","target_kind":"node","target_sha256":"b4cda3ed467172429f4c9c2768f68b2fab0f4a51a32a078a9b908ef6effa26de"}],"concept.nist.bipartgraph":[{"id":"assertion.concept.nist.bipartgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bipartite graph as: An undirected graph where vertices can be partition ed into two sets such that no edge connects vertices in the same set.","support":[{"end":178,"quote":"An\nundirected graph\nwhere\nvertices\ncan be\npartition\ned into two sets such that no\nedge\nconnects vertices in the same set.","source_id":"nist-dads.bipartgraph","source_sha256":"c6872cf89e019db12ba781d012202a6af0633da3c2c525da2b32ecc6b61d36b8","start":57}],"target_id":"concept.nist.bipartgraph","target_kind":"node","target_sha256":"a2687513aaab1289574e1925939c984e7d065786094843d7b1f53e59038764bb"}],"concept.nist.bipartmatch":[{"id":"assertion.concept.nist.bipartmatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bipartite matching as: (1) A perfect matching between vertices of a bipartite graph , that is, a subgraph that pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching. Also known as maximum bipartite matching.","support":[{"end":286,"quote":"(1) A\nperfect matching\nbetween\nvertices\nof a\nbipartite graph\n, that is, a\nsubgraph\nthat pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching.\nAlso known as\nmaximum bipartite matching.","source_id":"nist-dads.bipartmatch","source_sha256":"bb59f88f2a03dd447be6bb609adb0fd13b3b1fb64124a15c13576e467a068fca","start":63}],"target_id":"concept.nist.bipartmatch","target_kind":"node","target_sha256":"79d9670c169fa459c33c8e67b8a94950588b3e372cb8a4233509edc5bdd22424"}],"concept.nist.bitvector":[{"id":"assertion.concept.nist.bitvector","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bit vector as: An array of bits.","support":[{"end":68,"quote":"An\narray\nof bits.","source_id":"nist-dads.bitvector","source_sha256":"cd60ac92fae201761e8cbb4416a432891074029ee78c1263258da21170796b63","start":51}],"target_id":"concept.nist.bitvector","target_kind":"node","target_sha256":"969746c8763bd6689c9830f7b1a3bc2dfeb328665c5ad7152ae5f8b11b298648"}],"concept.nist.blindtrie":[{"id":"assertion.concept.nist.blindtrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blind trie as: A specialized Patricia tree whose internal nodes store only an integer, k, which is the length of the common prefix of the strings in the children . Equivalently, the strings first differ in the (k+1) st character.","support":[{"end":266,"quote":"A specialized\nPatricia tree\nwhose\ninternal nodes\nstore only an integer, k, which is the length of the common\nprefix\nof the strings in the\nchildren\n.  Equivalently, the strings first differ in the (k+1)\nst\ncharacter.","source_id":"nist-dads.blindtrie","source_sha256":"57f0216d701a9828d067de6bb1a40dbe0f64287f6747fd5ea0d6fff7ec81f6b7","start":51}],"target_id":"concept.nist.blindtrie","target_kind":"node","target_sha256":"c579e5c312604f468604ecd25b514ca7a46f3a87cb0a6c65f99d9a63c36ea6f3"}],"concept.nist.block":[{"id":"assertion.concept.nist.block","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines block as: (1) A number of items which are handled together for efficiency. (2) A sequence of don't care symbols.","support":[{"end":139,"quote":"(1) A number of items which are handled together for efficiency. (2) A sequence of\ndon't care\nsymbols.","source_id":"nist-dads.block","source_sha256":"2fa567ae9ecacc234dfdf3fe0bd434c71426d12f9d5afe581ecaa59f48ba0b45","start":37}],"target_id":"concept.nist.block","target_kind":"node","target_sha256":"89658d93ef56652ab8811749effe247bd096a91fede02f6c7efb29913675181d"}],"concept.nist.blockaddressingindex":[{"id":"assertion.concept.nist.blockaddressingindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines block addressing index as: An inverted index that includes the block , or general location, within texts, in addition to the text in which the word appears.","support":[{"end":204,"quote":"An\ninverted index\nthat includes the\nblock\n, or general location, within texts, in addition to the text in which the word appears.","source_id":"nist-dads.blockaddressingindex","source_sha256":"45116a86dc8f9cdb3f3276e77153db39b9aaa222011bec41243daff789dcc711","start":75}],"target_id":"concept.nist.blockaddressingindex","target_kind":"node","target_sha256":"bd8ea4303f60c50b47f5f52aca6c8fdf91da0ab69a7e34542fc4fe3beac20a50"}],"concept.nist.blockingflow":[{"id":"assertion.concept.nist.blockingflow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blocking flow as: A flow function in which any directed path from the source to the sink contains a saturated edge .","support":[{"end":151,"quote":"A\nflow function\nin which any directed\npath\nfrom the\nsource\nto the\nsink\ncontains a\nsaturated edge\n.","source_id":"nist-dads.blockingflow","source_sha256":"a07c80e302438080e9ebf105fefcc274b7506badec27d9ee04547bd6cfae86ea","start":53}],"target_id":"concept.nist.blockingflow","target_kind":"node","target_sha256":"b28e2260ee34fb74d2bd20d550c54b965a7d2c6317077ee0e371907e24a689fb"}],"concept.nist.bloomfilter":[{"id":"assertion.concept.nist.bloomfilter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bloom filter as: A data structure with a probabilistic algorithm to quickly test membership in a large set using multiple hash functions into a single array of bits.","support":[{"end":204,"quote":"A data structure with a\nprobabilistic algorithm\nto quickly test membership in a  large set using multiple\nhash functions\ninto a single\narray\nof bits.","source_id":"nist-dads.bloomfilter","source_sha256":"c130b821d3bdc58056c0f8f39e9e72b698d0c651e87c940513c2c4cb4cfccb01","start":55}],"target_id":"concept.nist.bloomfilter","target_kind":"node","target_sha256":"cb0d5e577e36b9b4058507c6c62752895817072707ef3f6ac50853d9cd2c1ea0"}],"concept.nist.blossom":[{"id":"assertion.concept.nist.blossom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blossom as: An odd length cycle which appears during a matching algorithm on general graphs .","support":[{"end":122,"quote":"An odd length\ncycle\nwhich appears during a\nmatching\nalgorithm on general\ngraphs\n.","source_id":"nist-dads.blossom","source_sha256":"b1a617ea6c002b69a38e4f1e2998c4c8e38b988f31926fe5a0db3d6ac708decb","start":41}],"target_id":"concept.nist.blossom","target_kind":"node","target_sha256":"cc1b472159ebbc59c29d1239baad05624a5ef3d66fab7b875946d35229d8a309"}],"concept.nist.boolean":[{"id":"assertion.concept.nist.boolean","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean as: (1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations and , or , and not . (2) In mathematics, entities from an algebra equivalent to intersection , union , and complement over subsets of a given set .","support":[{"end":311,"quote":"(1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations\nand\n,\nor\n, and\nnot\n. (2) In mathematics, entities from an algebra equivalent to\nintersection\n,\nunion\n, and\ncomplement\nover\nsubsets\nof a given\nset\n.","source_id":"nist-dads.boolean","source_sha256":"7dc11d682b023b875c6da02fdd98a2c9d78e340b13f2906d996e3d09b15f336e","start":41}],"target_id":"concept.nist.boolean","target_kind":"node","target_sha256":"1b3722d4c88e8346baf7ef62dd4629a0290de90513bc1a5db0bfb25bdcddda93"}],"concept.nist.booleanexpr":[{"id":"assertion.concept.nist.booleanexpr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean expression as: An expression consisting solely of boolean variables and values and boolean operations, such as and , or , not , implies , etc.","support":[{"end":190,"quote":"An expression consisting solely of boolean variables and values and boolean operations, such as\nand\n,\nor\n,\nnot\n,\nimplies\n, etc.","source_id":"nist-dads.booleanexpr","source_sha256":"fe01f5ad633fb1a4cd1385a90bac5d2abf1bcfb50e0eb0e20bfeef040bfafa1c","start":63}],"target_id":"concept.nist.booleanexpr","target_kind":"node","target_sha256":"f794a19fd36ec958c09320953d68843f970d6a21277a3226e836d72dcb1f07b7"}],"concept.nist.booleanfnctn":[{"id":"assertion.concept.nist.booleanfnctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean function as: A function whose range is {0, 1}. It can be understood to evaluate the truth or falsity of each element of its domain .","support":[{"end":179,"quote":"A\nfunction\nwhose\nrange\nis {0, 1}.  It can be understood to evaluate the truth or falsity of each element of its\ndomain\n.","source_id":"nist-dads.booleanfnctn","source_sha256":"02f35623edc3c1da8f3f82056d0b8a650431fc0ec1ace526a81e13b0d0bcbbed","start":59}],"target_id":"concept.nist.booleanfnctn","target_kind":"node","target_sha256":"779b57e1489ccab48bf1f912ff47ff734321e213d4f5a1473c283174bbd8cfc9"}],"concept.nist.border":[{"id":"assertion.concept.nist.border","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines border as: A string v which is both a prefix and a suffix of another string u. String v is the border of u if it is the longest proper border of u.","support":[{"end":176,"quote":"A\nstring\nv which is both a\nprefix\nand a\nsuffix\nof another string u.  String v is the border of u if it is the longest\nproper\nborder of u.","source_id":"nist-dads.border","source_sha256":"f8185c257ea5b51b8eb78b740c2e7ae97e9a805490e9ffaa215c5aeeb59b0ccc","start":39}],"target_id":"concept.nist.border","target_kind":"node","target_sha256":"d96dcdab84b9744a19a0e44b9843e2d39218bc025cd9727b60150c9acbc9da5a"}],"concept.nist.bottlenecktravelingsales":[{"id":"assertion.concept.nist.bottlenecktravelingsales","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bottleneck traveling salesman as: Find a tour where no edge is more costly than some (bottleneck) amount.","support":[{"end":161,"quote":"Find a\ntour\nwhere no edge is more costly than some (bottleneck) amount.","source_id":"nist-dads.bottlenecktravelingsales","source_sha256":"1c82c7efe51136a7b5cbe4b65a6293cf687fb6c67f13224e4dab3b3be6848a06","start":90}],"target_id":"concept.nist.bottlenecktravelingsales","target_kind":"node","target_sha256":"6cd1218e7bf9402901a355ab6ebb533902d2aa334e592cc9bdcab1681dbff217"}],"concept.nist.boundarybasd":[{"id":"assertion.concept.nist.boundarybasd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boundary-based representation as: A representation of a region that is based on its boundary.","support":[{"end":144,"quote":"A representation of a region that is based on its boundary.","source_id":"nist-dads.boundarybasd","source_sha256":"499485b972195785ac4bb96c60c32af3c37837f323d15157304403d575fbf938","start":85}],"target_id":"concept.nist.boundarybasd","target_kind":"node","target_sha256":"290374ce94f4452c1e5d405746e7ef467e6830cda167f24c19975ef68dbcc7a9"}],"concept.nist.boundedqueue":[{"id":"assertion.concept.nist.boundedqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bounded queue as: A queue limited to a fixed number of items.","support":[{"end":100,"quote":"A\nqueue\nlimited to a fixed number of items.","source_id":"nist-dads.boundedqueue","source_sha256":"f1eba58f364107d0ab154455034506f08428db78b88e3722c0188c9db576a498","start":57}],"target_id":"concept.nist.boundedqueue","target_kind":"node","target_sha256":"9afa1b7e1e984b17dbba5722c7c60a677050d24a0ac91cb308657a4d40baaedd"}],"concept.nist.boundedstack":[{"id":"assertion.concept.nist.boundedstack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bounded stack as: A stack limited to a fixed number of items.","support":[{"end":100,"quote":"A\nstack\nlimited to a fixed number of items.","source_id":"nist-dads.boundedstack","source_sha256":"61c51aafb62c9d6f395848504bb049452cba78b0ca593cb8fa3f4c08a50cb7c1","start":57}],"target_id":"concept.nist.boundedstack","target_kind":"node","target_sha256":"f6b9dac040e2f6dbfcca02f30ea7867efed8695b83ad6bd0505e8a3a50a8fb93"}],"concept.nist.bpp":[{"id":"assertion.concept.nist.bpp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \" B ounded error P robability in P olynomial\" time. Also known as bounded error probability in polynomial time.","support":[{"end":340,"quote":"The class of\nlanguages\nfor which a membership computation by a\nprobabilistic Turing machine\nhalts in\npolynomial time\nwith the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \"\nB\nounded error\nP\nrobability in\nP\nolynomial\" time.\nAlso known as\nbounded error probability in polynomial time.","source_id":"nist-dads.bpp","source_sha256":"d4820a888f524e660cdae179d7bbe772a8e7a6b10d189da580bae30ba60bf4a3","start":33}],"target_id":"concept.nist.bpp","target_kind":"node","target_sha256":"1bf3e9c0195017146345de5367351d4758fcb7fd806c54ac89d3950b2c0490ad"}],"concept.nist.bradfordslaw":[{"id":"assertion.concept.nist.bradfordslaw","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bradford's law as: Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals. The number of journals is 1:n:n².","support":[{"end":300,"quote":"Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals.  The number of journals is 1:n:n².","source_id":"nist-dads.bradfordslaw","source_sha256":"b1c28d638496ccd66219bf00960a4e65dabdf485df080cc3eefb5ecfa05a55e2","start":55}],"target_id":"concept.nist.bradfordslaw","target_kind":"node","target_sha256":"c9acba2c82e4eafcf1959b883108848b618d127358de3c884616d0a784cf2b3c"}],"concept.nist.bridge":[{"id":"assertion.concept.nist.bridge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bridge as: An edge of a connected graph whose removal would make the graph unconnected.","support":[{"end":115,"quote":"An\nedge\nof a\nconnected graph\nwhose removal would make the graph unconnected.","source_id":"nist-dads.bridge","source_sha256":"1abafd9ecfc12d01509b830164521c0193965f4f0da5b51f9edb2934099f69a8","start":39}],"target_id":"concept.nist.bridge","target_kind":"node","target_sha256":"1e106b11c5a5c2bfeff278873dfdcc965c5d54304b680b9e2b7c4d43a0200560"}],"concept.nist.bsptree":[{"id":"assertion.concept.nist.bsptree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BSP-tree as: A binary space partitioning (BSP) tree is a binary tree for multidimensional points where successive levels are split by arbitrary hyperplanes.","support":[{"end":190,"quote":"A binary space partitioning (BSP) tree is a\nbinary tree\nfor multidimensional points where successive levels are split by arbitrary hyperplanes.","source_id":"nist-dads.bsptree","source_sha256":"a79cb2f4cb1c2818ee37ed74b019088355f04af93c639d2ed69f868abbdb763c","start":47}],"target_id":"concept.nist.bsptree","target_kind":"node","target_sha256":"bc241947c679cca0d4c100478fb87b1a56bd3fe32b06f8ce0c69b0e4082d65f7"}],"concept.nist.bstartree":[{"id":"assertion.concept.nist.bstartree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines B*-tree as: A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.","support":[{"end":172,"quote":"A\nB-tree\nin which\nnodes\nare kept 2/3 full by redistributing\nkeys\nto fill two\nchild\nnodes, then splitting them into three nodes.","source_id":"nist-dads.bstartree","source_sha256":"c488d345d98ebecdc292098d47ddeecbdd5bcf8fefbcfcf265232f17b38dc7c2","start":45}],"target_id":"concept.nist.bstartree","target_kind":"node","target_sha256":"147a2be4c4423ca5705f506f29ff96ee59256065954d42642c592578984b422c"}],"concept.nist.btree":[{"id":"assertion.concept.nist.btree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines B-tree as: A balanced search tree in which every node has between ⌈ m/2⌉ and m children , where m>1 is a fixed integer. m is the order . The root may have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the height , and hence the number of accesses, can be kept small, say one or two, by picking a large m. Also known as balanced multiway tree.","support":[{"end":429,"quote":"A\nbalanced\nsearch tree\nin which every\nnode\nhas between ⌈ m/2⌉ and m\nchildren\n, where m>1 is a fixed integer.  m is the\norder\n.  The\nroot\nmay have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the\nheight\n, and hence the number of accesses, can be kept small, say one or two, by picking a large m.\nAlso known as\nbalanced multiway tree.","source_id":"nist-dads.btree","source_sha256":"825abd14ac32c0105c00455a70771c917ec7ef43e0f01bbcc06f1dc124ddea51","start":43}],"target_id":"concept.nist.btree","target_kind":"node","target_sha256":"ac048aba35b62115e962caa4e5f047c604e2d6234f34752af128cabe80b9d5de"}],"concept.nist.bucket":[{"id":"assertion.concept.nist.bucket","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucket as: An area of storage where items with a common property are stored. Typically tree data structures and sort algorithms use many buckets, one for each group of items. Usually buckets are kept on disk.","support":[{"end":237,"quote":"An area of storage where items with a common property are stored. Typically\ntree\ndata structures and\nsort\nalgorithms use many buckets, one for each group of items.  Usually buckets are kept on disk.","source_id":"nist-dads.bucket","source_sha256":"eaae708ef50cc14a37f91b98428546e77b165176a2f249c01c3d47c0f65210cc","start":39}],"target_id":"concept.nist.bucket","target_kind":"node","target_sha256":"9180f428f8d8ba70dc4d367660fc2cb23ec3b3af90f6592920d757e1a9c30133"}],"concept.nist.bucketmeth":[{"id":"assertion.concept.nist.bucketmeth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucketing method as: Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","support":[{"end":337,"quote":"Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","source_id":"nist-dads.bucketmeth","source_sha256":"6bcb8d871d72103db6def47829976bb374ae7c292b731d8249ed1b4cbeb49425","start":59}],"target_id":"concept.nist.bucketmeth","target_kind":"node","target_sha256":"ba4b856698193363293bd6451c1f599eaf53f13ab253bad16fcc46fdfcbb8c85"}],"concept.nist.buckettrie":[{"id":"assertion.concept.nist.buckettrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucket trie as: A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.","support":[{"end":170,"quote":"A variant of a\ntrie\nin which\nleaf\nnodes are\nbuckets\nwhich hold up to k strings.  Usually implies fixed sized buckets.","source_id":"nist-dads.buckettrie","source_sha256":"f96b4612236b5d3825afd6ca7f45c80c0c0a6dcfece358dd14cd8111c613c7b9","start":53}],"target_id":"concept.nist.buckettrie","target_kind":"node","target_sha256":"220a7c2beb2dad46cd7aef82b3550e190b57c41b489fcc1544c9819b11410297"}],"concept.nist.buddytree":[{"id":"assertion.concept.nist.buddytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines buddy tree as: A point access method which splits multidimensional space in different dimensions at each level. It also keeps a minimum bounding box of points accessible by each node.","support":[{"end":220,"quote":"A\npoint access method\nwhich splits multidimensional space in different dimensions at each level.  It also keeps a\nminimum bounding box\nof points accessible by each node.","source_id":"nist-dads.buddytree","source_sha256":"6b2bc30babd297dd9f656f06e79257cfcf25f73f8ecc50f595a32e925ff5e2db","start":51}],"target_id":"concept.nist.buddytree","target_kind":"node","target_sha256":"1cee6cb768c921ca57e645dc24e6c0fb2977d1649b61166780fecaff8b691ed7"}],"concept.nist.busybeaver":[{"id":"assertion.concept.nist.busybeaver","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines busy beaver as: (1) A Turing machine with a small number of states that halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps. (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","support":[{"end":370,"quote":"(1) A\nTuring machine\nwith a small number of\nstates\nthat halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps.  (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","source_id":"nist-dads.busybeaver","source_sha256":"d536a3b9393bdee35d5ef0e4c14318e469b74d94e9ccde57b8a4ac2db6553eb1","start":54}],"target_id":"concept.nist.busybeaver","target_kind":"node","target_sha256":"c890e3ce72ff9066a4970dcf389c8d6abb998adf7a39799f438454c4ff57da58"}],"concept.nist.bvtree":[{"id":"assertion.concept.nist.bvtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BV-tree as: A conceptual idea which generalizes B-trees to multiple dimensions. BV-trees are not balanced, and searching may require backtracking .","support":[{"end":181,"quote":"A conceptual idea which generalizes\nB-trees\nto multiple dimensions.  BV-trees are not balanced, and searching may require\nbacktracking\n.","source_id":"nist-dads.bvtree","source_sha256":"efc5192022c06c1c70d95c926f7a2d756eff2e33d519526e46ec1dd154bb0a04","start":45}],"target_id":"concept.nist.bvtree","target_kind":"node","target_sha256":"74c8bda5c0e0bf8f3c47ba0fcf330584e8da654203305b2bcf47c5e39e44bb5c"}],"concept.nist.byzantine":[{"id":"assertion.concept.nist.byzantine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Byzantine generals as: The problem of reaching a consensus among distributed units if some of them give misleading answers. To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making algorithm should the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","support":[{"end":583,"quote":"The problem of reaching a consensus among distributed units if some of them give misleading answers.  To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making\nalgorithm\nshould the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","source_id":"nist-dads.byzantine","source_sha256":"0b3b3708759a90cd2699641b08aed6c413f38636f6dbea8ec0edebe4d9e608d0","start":68}],"target_id":"concept.nist.byzantine","target_kind":"node","target_sha256":"237dd7620b8440136691f1e48a47bc78fe86340b71942f59cd58e3b6cfba67ab"}],"concept.nist.cactusstack":[{"id":"assertion.concept.nist.cactusstack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cactus stack as: A variant of stack in which one other cactus stack may be attached to the top. An attached stack is called a \"branch.\" When a branch becomes empty, it is removed. Pop is not allowed if there is a branch. A branch is only accessible through the original reference; it is not accessible through the stack. Formal Definition: The operations new to this variant of stack, branch(S, T) and notch(v), may be defined with axiomatic semantics as follows. top(branch(S, T)) = top(S) notch(new()) = false notch(push(v, S)) = false notch(branch(S, T)) = true Also known as saguaro stack.","support":[{"end":635,"quote":"A variant of\nstack\nin which one other cactus stack may be attached to the top.  An attached stack is called a \"branch.\"  When a branch becomes empty, it is removed.  Pop is not allowed if there is a branch.  A branch is only accessible through the original reference; it is not accessible through the stack.\nFormal Definition:\nThe operations new to this variant of stack, branch(S, T) and notch(v), may be defined with\naxiomatic semantics\nas follows.\ntop(branch(S, T)) = top(S)\nnotch(new()) = false\nnotch(push(v, S)) = false\nnotch(branch(S, T)) = true\nAlso known as\nsaguaro stack.","source_id":"nist-dads.cactusstack","source_sha256":"deb49227e54775fd0b4f539b1cb8506ab1302558f48aed1d40c78781d4d4b1f8","start":55}],"target_id":"concept.nist.cactusstack","target_kind":"node","target_sha256":"983ac8111e96099f473a46029bd54539ebc0c487e848c0eb0cceff57500dc045"}],"concept.nist.calcucommsys":[{"id":"assertion.concept.nist.calcucommsys","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Calculus of Communicating Systems as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. Commonly known as CCS.","support":[{"end":199,"quote":"Robin Milner's algebraic theory to formalize the notion of concurrent computation.  Commonly known as CCS.","source_id":"nist-dads.calcucommsys","source_sha256":"3912e027d5180addf468a94efc93455d3f765a02f06dfe3310a5f9d417c1c73f","start":93}],"target_id":"concept.nist.calcucommsys","target_kind":"node","target_sha256":"bedbb7ca96174c004bd2b0843db0a3795f49f53a0ff54ce426f94f0b4772e2a2"}],"concept.nist.calendarqueue":[{"id":"assertion.concept.nist.calendarqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines calendar queue as: A fast priority queue implementation having N buckets each with width w, or covering w time. An item with priority p more than current goes in bucket (p/w)%N. Choose N and w to have few items in each bucket. Keep items sorted within buckets. Double or halve N and change w if the number of items grows or shrinks a lot.","support":[{"end":383,"quote":"A fast\npriority queue\nimplementation having N buckets each with width w, or covering w time.  An item with priority p more than current goes in bucket (p/w)%N.   Choose N and w to have few items in each bucket.  Keep items sorted within buckets.  Double or halve N and change w if the number of items grows or shrinks a lot.","source_id":"nist-dads.calendarqueue","source_sha256":"8d6d675b12c8d0de8578e454a5eb4c35e90d4b6a2eb7694045234c05d8cd4af1","start":59}],"target_id":"concept.nist.calendarqueue","target_kind":"node","target_sha256":"4254c3ece2dbb11d5c6e61f18d3195e18f90172f2dd7f19eee85c4d4696d010e"}],"concept.nist.candidate":[{"id":"assertion.concept.nist.candidate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines candidate consistency testing as: The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","support":[{"end":206,"quote":"The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","source_id":"nist-dads.candidate","source_sha256":"39e251afbdc60492dc3f3ee4a4609ad64b924dc9d45aa109688497b2cf0fc7ad","start":85}],"target_id":"concept.nist.candidate","target_kind":"node","target_sha256":"2346ec33a32d1bb51849d66fdffc9ef70b615a91c132356434411e4ef60ad2ad"}],"concept.nist.candidateverification":[{"id":"assertion.concept.nist.candidateverification","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines candidate verification as: The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","support":[{"end":172,"quote":"The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","source_id":"nist-dads.candidateverification","source_sha256":"15134d726578335224d9de2ded92a80d6cfde70fb4e70abf8f4bc126e30cd73f","start":71}],"target_id":"concept.nist.candidateverification","target_kind":"node","target_sha256":"0ee8c2a72f78e6843e2e7518fd4755a052eab2051821a0eeecc67e7cdf1154b3"}],"concept.nist.canonical":[{"id":"assertion.concept.nist.canonical","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines canonical complexity class as: One of the classes defined by logarithmic , polynomial , and exponential bounds on time and space, for deterministic and nondeterministic machines. These classify most of the important computational problems.","support":[{"end":288,"quote":"One of the classes defined by\nlogarithmic\n,\npolynomial\n, and\nexponential\nbounds on time and space, for deterministic and nondeterministic machines.  These classify most of the important computational problems.","source_id":"nist-dads.canonical","source_sha256":"508132473ff660f6cd64990bb4b841c10e107e26aa5953fd0cf61817b81a4faa","start":79}],"target_id":"concept.nist.canonical","target_kind":"node","target_sha256":"f8b7a3b8060f659d20880636e792c20c63c8580f6818217410df72d6ff6a8155"}],"concept.nist.capacifacloc":[{"id":"assertion.concept.nist.capacifacloc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacitated facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance objective function and no supply supports too many demand points.","support":[{"end":317,"quote":"Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance\nobjective function\nand no supply supports too many demand points.","source_id":"nist-dads.capacifacloc","source_sha256":"cdaf9126fc5d73c3eb634970b7ae48cbc8677a7ee58b2490bf41903f65009611","start":90}],"target_id":"concept.nist.capacifacloc","target_kind":"node","target_sha256":"bcd82ace420a8adc608b66525178d94341fadf67d51c426c24d8cf063596f179"}],"concept.nist.capacity":[{"id":"assertion.concept.nist.capacity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacity as: The maximum flow that may be sent through an edge or a vertex .","support":[{"end":106,"quote":"The maximum flow that may be sent through an\nedge\nor a\nvertex\n.","source_id":"nist-dads.capacity","source_sha256":"0b7f339cf5b0363245bb13c7e703a749c90d4c8bd6fcf06241861b5efb129f7b","start":43}],"target_id":"concept.nist.capacity","target_kind":"node","target_sha256":"7fc79d355dd77d677e1197e1bb7b5fd458f9635891055a8f92ebd5565c780251"}],"concept.nist.capacitycstr":[{"id":"assertion.concept.nist.capacitycstr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacity constraint as: The property that the flow on every edge of a flow network is no more than the edge's capacity . More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","support":[{"end":261,"quote":"The property that the flow on every\nedge\nof a\nflow network\nis no more than the edge's\ncapacity\n.  More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","source_id":"nist-dads.capacitycstr","source_sha256":"75f6c4a14ee328cfeda28cc091a718b61bc181ea8130c64b61b0f11871777e68","start":65}],"target_id":"concept.nist.capacitycstr","target_kind":"node","target_sha256":"d5b19dc011d1e923f452120786c18319331a67f4617c8a6e47ab5a454acd1691"}],"concept.nist.ccs":[{"id":"assertion.concept.nist.ccs","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CCS as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. An acronym for Calculus of Communicating Systems.","support":[{"end":166,"quote":"Robin Milner's algebraic theory to formalize the notion of concurrent computation.  An acronym for Calculus of Communicating Systems.","source_id":"nist-dads.ccs","source_sha256":"9ffcf4bfffb0a97016ca02191da5b2a6b854d9adcec7c832d1ee0085e5be122e","start":33}],"target_id":"concept.nist.ccs","target_kind":"node","target_sha256":"9991f240c46f9b1db43e307af35636c4199d2940fcffee3081c5c90e6e189053"}],"concept.nist.cellprobemodel":[{"id":"assertion.concept.nist.cellprobemodel","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cell probe model as: A model of computation where the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size. All other computations are not counted and are considered to be free.","support":[{"end":290,"quote":"A\nmodel of computation\nwhere the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size.  All other computations are not counted and are considered to be free.","source_id":"nist-dads.cellprobemodel","source_sha256":"4d48b9bcea8bf416e71a8e9e5084c81c307526f0a94d25b2bfb00ff6f7ea85b1","start":59}],"target_id":"concept.nist.cellprobemodel","target_kind":"node","target_sha256":"ad194c892f2a841c1e5490a755e2be7fb323c916fe901103226e5c9e2c0622b0"}],"concept.nist.celltree":[{"id":"assertion.concept.nist.celltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cell tree as: A spatial access method where successive levels are split by arbitrary hyperplanes. Concave objects are decomposed into convex pieces. Each convex piece is indexed in every cell which it overlaps.","support":[{"end":247,"quote":"A\nspatial access method\nwhere successive levels are split by arbitrary hyperplanes.  Concave objects are decomposed into convex pieces.  Each convex piece is indexed in every cell which it overlaps.","source_id":"nist-dads.celltree","source_sha256":"d12cc300762883155ac35e85eeff0b76eedd82e2dfc4ee05a2b90e703f8cf459","start":49}],"target_id":"concept.nist.celltree","target_kind":"node","target_sha256":"0b99643c73fad40c89e459dfd484831176f3cacae0eab284ef3c1a6c746fdc88"}],"concept.nist.cellulartmtn":[{"id":"assertion.concept.nist.cellulartmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cellular automaton as: Usually a two-dimensional organization of simple finite state machines whose next state depends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","support":[{"end":371,"quote":"Usually a\ntwo-dimensional\norganization of simple\nfinite state machines\nwhose next\nstate\ndepends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","source_id":"nist-dads.cellulartmtn","source_sha256":"5d73333eb1ffc1855df81389715a88a518a8004b0e1716916e792ef1ae7ec340","start":63}],"target_id":"concept.nist.cellulartmtn","target_kind":"node","target_sha256":"4a5df3010a723579a8ad5e3541d5a136fb7a7e837360df26fba8546ad82922e6"}],"concept.nist.centroid":[{"id":"assertion.concept.nist.centroid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines centroid as: The center of gravity or center of mass of an object.","support":[{"end":96,"quote":"The center of gravity or center of mass of an object.","source_id":"nist-dads.centroid","source_sha256":"64eaf8395527b2ddfe7fd5d17261eee2a12cad4e2e702d1bd5d457c6b036e95b","start":43}],"target_id":"concept.nist.centroid","target_kind":"node","target_sha256":"71471e049fe994880bab14f577cf9840a138731f3b2fe699b73d42d3f9c7f84e"}],"concept.nist.certificate":[{"id":"assertion.concept.nist.certificate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines certificate as: (1) Extra information so the correctness of an answer to a decision problem can be quickly checked. (2) For any graph property P and graph G, a certificate for G is a graph G' such that G has property P if and only if G' has the property.","support":[{"end":288,"quote":"(1) Extra information so the correctness of an answer to a\ndecision problem\ncan be quickly checked.  (2) For any graph property\nP\nand\ngraph\nG, a certificate for G is a graph G' such that G has property\nP\nif and only if G' has the property.","source_id":"nist-dads.certificate","source_sha256":"5e0172b0cd754228b3e0a138be0929f501fbd709723f85ae81a32f1bfb6ae211","start":49}],"target_id":"concept.nist.certificate","target_kind":"node","target_sha256":"e01a82a6ab3f5ee68ef6e52cbad63c6751ef7cee8efe9b50ec3c6c82af7c0d01"}],"concept.nist.chain":[{"id":"assertion.concept.nist.chain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chain as: A set with a total order .","support":[{"end":63,"quote":"A\nset\nwith a\ntotal order\n.","source_id":"nist-dads.chain","source_sha256":"f582ca1d528f359ba336bc63fe31aec640639824211b158bf434e01918c88b2e","start":37}],"target_id":"concept.nist.chain","target_kind":"node","target_sha256":"c97ba85cc695ed2f0bcc9eca621c0289b3e4c25528746cc1510effe7247ce0f9"}],"concept.nist.chaining":[{"id":"assertion.concept.nist.chaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chaining as: A class of collision resolution schemes in which linked lists handle collisions in a hash table . The two main subclasses are separate chaining , where lists are outside the table, and coalesced chaining , where the lists are within the table.","support":[{"end":291,"quote":"A class of\ncollision resolution schemes\nin which\nlinked lists\nhandle\ncollisions\nin a\nhash table\n.  The two main subclasses are\nseparate chaining\n, where lists are outside the table, and\ncoalesced chaining\n, where the lists are within the table.","source_id":"nist-dads.chaining","source_sha256":"f3af18f63ae39895f3a1d527d1258a03d554bb16a2329814686a9b74b6dc1c11","start":47}],"target_id":"concept.nist.chaining","target_kind":"node","target_sha256":"faa02b3ccc7c52b5c26177658878af6687c9d82004b5b7f1336ce07abb325ffb"}],"concept.nist.child":[{"id":"assertion.concept.nist.child","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines child as: A node of a tree referred to by a parent node. See the figure at tree . Every node, except the root , is the child of some parent.","support":[{"end":169,"quote":"A\nnode\nof a\ntree\nreferred to by a\nparent\nnode.  See the figure at\ntree\n.  Every node, except the\nroot\n, is the child of some parent.","source_id":"nist-dads.child","source_sha256":"ac05717364862e672ef97a2871327a4d981d49fe0334b5db0c07b20bd076d2c0","start":37}],"target_id":"concept.nist.child","target_kind":"node","target_sha256":"552843be98abeeef5acae2d5bb6e1fe703d9f14c6570b359d445e6cdfd3dab1e"}],"concept.nist.chinesepostman":[{"id":"assertion.concept.nist.chinesepostman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Chinese postman problem as: Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete .","support":[{"end":248,"quote":"Find a minimum length closed\nwalk\nthat traverses each\nedge\nat least once.  Finding an optimal solution in a graph with both\ndirected\nand\nundirected\nedges is\nNP-complete\n.","source_id":"nist-dads.chinesepostman","source_sha256":"303ec4e3f7f2e13c84bac0b3ab726d82e47d6ccf46feef9cec8431ebf301f519","start":78}],"target_id":"concept.nist.chinesepostman","target_kind":"node","target_sha256":"a7c6b074c35c89c284acb3e3c2104f389261a023ecda73e5c2a4c60df9bc84de"}],"concept.nist.chromatcnmbr":[{"id":"assertion.concept.nist.chromatcnmbr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chromatic number as: The minimum number of colors needed to color the vertices of a graph such that no two adjacent vertices have the same color.","support":[{"end":183,"quote":"The minimum number of colors needed to color the\nvertices\nof a\ngraph\nsuch that no two\nadjacent\nvertices have the same color.","source_id":"nist-dads.chromatcnmbr","source_sha256":"1ac1c57df36b622f598be5d609ad67c0891bad207cd9b7bd66bb5f97cf79d252","start":59}],"target_id":"concept.nist.chromatcnmbr","target_kind":"node","target_sha256":"70528932e93ea90333b2e6b4be471e82520918c95d35bb0fd40e7644f18bf770"}],"concept.nist.chromaticndx":[{"id":"assertion.concept.nist.chromaticndx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chromatic index as: The minimum number of colors needed to color the edges of a graph .","support":[{"end":124,"quote":"The minimum number of colors needed to color the\nedges\nof a\ngraph\n.","source_id":"nist-dads.chromaticndx","source_sha256":"690db6ba3dd7dedfe8026718762a96541c8a50945f5e2a1267284949b27d38d6","start":57}],"target_id":"concept.nist.chromaticndx","target_kind":"node","target_sha256":"3bb1ca0ae85340000a590264be6a9de859f4f05057da30b951cfd811f32baebc"}],"concept.nist.circuit":[{"id":"assertion.concept.nist.circuit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines circuit as: (1) An acyclic network of inputs, logic gates, and outputs. Contrasted with a Turing machine , it has no memory. (2) A cycle in a graph .","support":[{"end":179,"quote":"(1) An\nacyclic\nnetwork of inputs, logic gates, and outputs.  Contrasted with a\nTuring machine\n, it has no memory. (2) A\ncycle\nin a\ngraph\n.","source_id":"nist-dads.circuit","source_sha256":"5c435c53d3a56f31be4b3817ab54da17dd16eadade7759f24984072f3bc54853","start":41}],"target_id":"concept.nist.circuit","target_kind":"node","target_sha256":"0ddfa76c70bcb138aa2a7f678ca0986cfe5c5b69c58e508b62319275d9b23ad1"}],"concept.nist.circuitcomplexity":[{"id":"assertion.concept.nist.circuitcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines circuit complexity as: The study of the size, depth, and other attributes of circuits that decide specified languages or compute specified functions.","support":[{"end":189,"quote":"The study of the size, depth, and other attributes of\ncircuits\nthat decide specified languages or compute specified functions.","source_id":"nist-dads.circuitcomplexity","source_sha256":"16d0d15d03af910536783ac928cecbbcb684a67caee217eb077f0d6cd012c19e","start":63}],"target_id":"concept.nist.circuitcomplexity","target_kind":"node","target_sha256":"0f3bef7a6ecdda9ab3ec5669c8e2d4ecf4b9a94fffb259cfb85c8fbc4767e108"}],"concept.nist.circularlist":[{"id":"assertion.concept.nist.circularlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines circular list as: A variant of a linked list in which the nominal tail is linked to the head . The entire list may be accessed starting at any item and following links until one comes to the starting item again.","support":[{"end":251,"quote":"A variant of a\nlinked list\nin which the nominal\ntail\nis linked to the\nhead\n.  The entire list may be accessed starting at any item and following\nlinks\nuntil one comes to the starting item again.","source_id":"nist-dads.circularlist","source_sha256":"d9f5652453b57017b967395e5d9a9e34d375c3ed4e8af8259a8faec985b3e5dc","start":57}],"target_id":"concept.nist.circularlist","target_kind":"node","target_sha256":"ce2082290b4545ecb392d7f99570adb09bff89f194ee6aa1a975125fd30fcdca"}],"concept.nist.circularqueue":[{"id":"assertion.concept.nist.circularqueue","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines circular queue as: An implementation of a bounded queue using an array .","support":[{"end":112,"quote":"An implementation of a\nbounded queue\nusing an\narray\n.","source_id":"nist-dads.circularqueue","source_sha256":"c0bebf3f9a0f6603640db84205affe91c7c172ed9b3ac83761d4a844e0da070f","start":59}],"target_id":"concept.nist.circularqueue","target_kind":"node","target_sha256":"9628fd89c74a8d53b74c0d89320505f3411e79d89148d6911575f8d6ba6e0341"}],"concept.nist.clique":[{"id":"assertion.concept.nist.clique","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clique as: A set of vertices in an undirected graph in which there is an edge between every pair of vertices. In other words, a subgraph that is complete .","support":[{"end":183,"quote":"A set of\nvertices\nin an\nundirected graph\nin which there is an\nedge\nbetween every pair of vertices. In other words, a subgraph that is\ncomplete\n.","source_id":"nist-dads.clique","source_sha256":"7a876f684b461b08129615bb3d515a5b4ee39d6e567631cffefa31c49b7bb6ca","start":39}],"target_id":"concept.nist.clique","target_kind":"node","target_sha256":"be070b7e9d198fe96abbe5d7c024cfc902da9aedd0c6002753506d74572ba498"}],"concept.nist.cliqueproblm":[{"id":"assertion.concept.nist.cliqueproblm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clique problem as: Find the largest clique in an undirected graph .","support":[{"end":108,"quote":"Find the largest\nclique\nin an\nundirected graph\n.","source_id":"nist-dads.cliqueproblm","source_sha256":"6972a06b8e22293e5034b4c4490e78b3dcd436a29d6639b4703ddd94d0e7bfef","start":60}],"target_id":"concept.nist.cliqueproblm","target_kind":"node","target_sha256":"94307fb02cca7b885d4056584daf2530074d2d4b4eda9b4eb011a79437f1eec2"}],"concept.nist.clustering":[{"id":"assertion.concept.nist.clustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clustering as: The tendency for entries in a hash table using open addressing to be stored together, even when the table has ample empty space to spread them out.","support":[{"end":194,"quote":"The tendency for entries in a\nhash table\nusing\nopen addressing\nto be stored together, even when the table has ample empty space to spread them out.","source_id":"nist-dads.clustering","source_sha256":"532d08a4b37f05159c83eb8698a4fcf77542401196b4a724204875419eea946c","start":47}],"target_id":"concept.nist.clustering","target_kind":"node","target_sha256":"f254318eb5277ade76f9d75a91e8b17505915825038b88b86ad14032b8c37c20"}],"concept.nist.clusteringfree":[{"id":"assertion.concept.nist.clusteringfree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clustering free as: When a collision resolution scheme spreads out entries in a hash table .","support":[{"end":129,"quote":"When a\ncollision resolution scheme\nspreads out entries in a\nhash table\n.","source_id":"nist-dads.clusteringfree","source_sha256":"f4f01ac56553d8573181aa9065a50a1b39e67ff8cfa055499cf91d7bd80fc8df","start":57}],"target_id":"concept.nist.clusteringfree","target_kind":"node","target_sha256":"8ec3722c471143e0f19f403038dccfcd5ada12c8d8364c5687a8a980eeacd932"}],"concept.nist.coalescedchaining":[{"id":"assertion.concept.nist.coalescedchaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coalesced chaining as: A scheme in which linked lists within the hash table handle collisions . An item that collides is put in the next empty place in the array and added to the end of a list embedded in the array items. Any open addressing method to compute possible new positions may be used to find the \"next\" empty place.","support":[{"end":372,"quote":"A scheme in which\nlinked lists\nwithin the\nhash table\nhandle\ncollisions\n.  An item that collides is put in the next empty place in the array and added to the end of a\nlist\nembedded in the array items.  Any\nopen addressing\nmethod to compute possible new positions may be used to find the \"next\" empty place.","source_id":"nist-dads.coalescedchaining","source_sha256":"ea29ba9f0b2f83e23b0965bbcaf7fc12f434c36fbe13d63f65a56880674177d6","start":67}],"target_id":"concept.nist.coalescedchaining","target_kind":"node","target_sha256":"4adaf961f33e28bf0bf0198573dfa93a1384c8818082ea49e2d2366ccf7ffbe1"}],"concept.nist.coarsening":[{"id":"assertion.concept.nist.coarsening","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coarsening as: To alter a problem, typically restricting it to a less complex feasible region or objective function , so that the resulting problem can be efficiently solved, usually by dynamic programming .","support":[{"end":239,"quote":"To alter a problem, typically restricting it to a less complex\nfeasible region\nor\nobjective function\n, so that the resulting problem can be efficiently solved, usually by\ndynamic programming\n.","source_id":"nist-dads.coarsening","source_sha256":"63146b4289497676b68eb41423c273821517cd2be71e383495cc565829d0f213","start":47}],"target_id":"concept.nist.coarsening","target_kind":"node","target_sha256":"84667eb159f197b3ba83fe61d2de689941f2f8b9d1a243d2f166b0d1dec9dc2d"}],"concept.nist.codeword":[{"id":"assertion.concept.nist.codeword","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines codeword as: Sequence of bits of a code corresponding to a symbol.","support":[{"end":96,"quote":"Sequence of bits of a code corresponding to a symbol.","source_id":"nist-dads.codeword","source_sha256":"0824d7609e4a64f1bff7df5dfe80b57ca316e447a69c96364b308f5249dff4c3","start":43}],"target_id":"concept.nist.codeword","target_kind":"node","target_sha256":"776397c1d6f99425acf80e16b8e094db16450ac74c9a60eeb95a6128b7fcc6ac"}],"concept.nist.codingtree":[{"id":"assertion.concept.nist.codingtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coding tree as: A full binary tree that represents a coding, such as produced by Huffman coding . Each leaf is an encoded symbol. The path from the root to a leaf is its codeword.","support":[{"end":218,"quote":"A\nfull binary tree\nthat represents a coding, such as produced by\nHuffman coding\n.  Each\nleaf\nis an encoded symbol.  The\npath\nfrom the\nroot\nto a leaf is its codeword.","source_id":"nist-dads.codingtree","source_sha256":"63b990b3b273e12a707d49f008ae90cc6db8813c4128e29212393d97b9679518","start":53}],"target_id":"concept.nist.codingtree","target_kind":"node","target_sha256":"8c8836d3fae0adbdf3cbe3a0f4013d2997d3aa5aa7d0153355b4252c847721c7"}],"concept.nist.collatzproblem":[{"id":"assertion.concept.nist.collatzproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Collatz problem as: Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","support":[{"end":213,"quote":"Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","source_id":"nist-dads.collatzproblem","source_sha256":"127e9fe114d16db16f1be0a54fc899e488e32f95332b54f6d65a740330796be9","start":62}],"target_id":"concept.nist.collatzproblem","target_kind":"node","target_sha256":"84bb242f691716b1f7f998afa6cc9d5d58c7a00c4efd24f25f6f1e5a896f9e68"}],"concept.nist.collision":[{"id":"assertion.concept.nist.collision","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collision as: When two or more items should be kept in the same location, especially in hash tables , that is, when two or more different keys hash to the same value.","support":[{"end":197,"quote":"When two or more items should be kept in the same location, especially in\nhash tables\n, that is, when two or more different\nkeys\nhash\nto the same value.","source_id":"nist-dads.collision","source_sha256":"e531f11fc8476f5ca49ffa81687e10c7129b7e1e7bf16d4cdc48e58e1db3bbba","start":45}],"target_id":"concept.nist.collision","target_kind":"node","target_sha256":"41eb97f2a909a8bc181ab42d76b68661e9e1cb20c918a4379d1df3bfd27e9d0a"}],"concept.nist.communseqpro":[{"id":"assertion.concept.nist.communseqpro","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Communicating Sequential Processes as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. Commonly known as CSP.","support":[{"end":203,"quote":"C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation.  Commonly known as CSP.","source_id":"nist-dads.communseqpro","source_sha256":"02a81461b5014b004138f32398a7b01fb1ad54ac17b0b5c10a704f7148d3b805","start":95}],"target_id":"concept.nist.communseqpro","target_kind":"node","target_sha256":"f3ba991707b94806b767101019a4ff9ba15c30d3eb3a9b22492f554cabdaaa63"}],"concept.nist.commutative":[{"id":"assertion.concept.nist.commutative","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines commutative as: A function where f(A, B) = f(B, A).","support":[{"end":84,"quote":"A function where f(A, B) = f(B, A).","source_id":"nist-dads.commutative","source_sha256":"caeb94b2dd8bbc1f632e0825ae2674dfaa6feb1c4294a0e6478e773c9e8c3fab","start":49}],"target_id":"concept.nist.commutative","target_kind":"node","target_sha256":"44c6f59d0cc0335f35917cb75d32ade7e36502afb98dbe25ccfbee8c605d32c7"}],"concept.nist.compactdatastruct":[{"id":"assertion.concept.nist.compactdatastruct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact data structure as: A data structure that needs far less space and allows efficient access without decompression.","support":[{"end":164,"quote":"A\ndata structure\nthat needs far less space and allows efficient access without decompression.","source_id":"nist-dads.compactdatastruct","source_sha256":"11170a432ff5e56adeb4c6a220ed790f2fef3e4cc2a5692f896c4b02c3a59b46","start":71}],"target_id":"concept.nist.compactdatastruct","target_kind":"node","target_sha256":"b6271a0c7949ae7bf03e6ab880a1295f3174fd29591642e6c789121d2f82a060"}],"concept.nist.compactdawg":[{"id":"assertion.concept.nist.compactdawg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact DAWG as: A directed acyclic word graph (DAWG) representing the suffixes of a given string in which each edge is labeled with the longest possible string. The strings along a path from the root to a node are the substring which the node represents.","support":[{"end":294,"quote":"A\ndirected acyclic\nword graph (DAWG) representing the\nsuffixes\nof a given\nstring\nin which each\nedge\nis labeled with the longest possible string.  The strings along a\npath\nfrom the\nroot\nto a\nnode\nare the\nsubstring\nwhich the\nnode\nrepresents.","source_id":"nist-dads.compactdawg","source_sha256":"66010fc268532b238db35c2acd953d16de58d6f6078154b232a8db20e6be839a","start":55}],"target_id":"concept.nist.compactdawg","target_kind":"node","target_sha256":"e4f65dffc7737a8d08761b79e2074ab6a1d6f02f2e11352e2d214a9c9aa75d75"}],"concept.nist.compacttrie":[{"id":"assertion.concept.nist.compacttrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact trie as: A trie in which nonbranching subtrees leading to leaf nodes are cut off.","support":[{"end":127,"quote":"A\ntrie\nin which nonbranching subtrees leading to\nleaf\nnodes are cut off.","source_id":"nist-dads.compacttrie","source_sha256":"34faf87d452a97d9ece6826639c4b3f8db64b456d842496e85b5f0599f24d25b","start":55}],"target_id":"concept.nist.compacttrie","target_kind":"node","target_sha256":"8efd91e1ac10b7bc2cc993232978885d011f3df6a5061ee8ccfc7e82d279f92e"}],"concept.nist.comparisnsrt":[{"id":"assertion.concept.nist.comparisnsrt","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines comparison sort as: Any sort algorithm using comparisons between keys , and nothing else about the keys, to arrange items in a predetermined order. An alternative is a restricted universe sort such as counting sort or bucket sort .","support":[{"end":269,"quote":"Any\nsort\nalgorithm using comparisons between\nkeys\n, and nothing else about the keys, to arrange items in a predetermined order.  An alternative is a\nrestricted universe sort\nsuch as\ncounting sort\nor\nbucket sort\n.","source_id":"nist-dads.comparisnsrt","source_sha256":"1ed3cfd1ae15f4f921467eda7306be0f937c3343abefc492f39e4e24c61671ad","start":57}],"target_id":"concept.nist.comparisnsrt","target_kind":"node","target_sha256":"0e3b900f46f8ef23a5b13ed8d7fad31e5622460b53423b2337b4f77576496a37"}],"concept.nist.competitiveanalysis":[{"id":"assertion.concept.nist.competitiveanalysis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines competitive analysis as: An analysis in which the performance of an on-line algorithm is compared to the best that could have been achieved if all the inputs had been known in advance.","support":[{"end":226,"quote":"An analysis in which the performance of an\non-line algorithm\nis compared to the best that could have been achieved if all the inputs had been known in advance.","source_id":"nist-dads.competitiveanalysis","source_sha256":"ae295873ad8fa34de41b22a3660a47806f9fc7039c0915b2f92c2f1bd4c2b3ad","start":67}],"target_id":"concept.nist.competitiveanalysis","target_kind":"node","target_sha256":"ae42fe584bc467256fa7668df335b34e6c23a75f641f776a59ad61a874cc6af4"}],"concept.nist.competitivrt":[{"id":"assertion.concept.nist.competitivrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines competitive ratio as: The worst case of the ratio between the cost incurred by an on-line algorithm and the best-case cost .","support":[{"end":163,"quote":"The\nworst case\nof the ratio between the cost incurred by an\non-line algorithm\nand the\nbest-case cost\n.","source_id":"nist-dads.competitivrt","source_sha256":"95dfc9d44cd160353deb97e795bac68ec4cf75163884536bff33944aeae78f2d","start":61}],"target_id":"concept.nist.competitivrt","target_kind":"node","target_sha256":"c9dda9cce19370c3b11f603097347a224eb233991b93417de5d249618136c139"}],"concept.nist.complement":[{"id":"assertion.concept.nist.complement","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complement as: (1) Of a boolean , 0 if 1, or 1 if 0. See not . (2) Of a set A, a set having all the members which are in the universe , but not in A.","support":[{"end":183,"quote":"(1) Of a\nboolean\n, 0 if 1, or 1 if 0.  See\nnot\n.  (2) Of a\nset\nA, a set having all the members which are in the\nuniverse\n, but not in A.","source_id":"nist-dads.complement","source_sha256":"38091fb54fefc5809581375527729aded5d6d50063495247dad903f6dcf6e639","start":47}],"target_id":"concept.nist.complement","target_kind":"node","target_sha256":"76550f030ec5b185561ec5ef22d77f5da1582e3f065c742d694eb1d890d3ef9b"}],"concept.nist.completebinarytree":[{"id":"assertion.concept.nist.completebinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complete binary tree as: A binary tree in which every level (depth), except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible.","support":[{"end":245,"quote":"A\nbinary tree\nin which every\nlevel\n(depth), except possibly the deepest, is completely filled.  At depth n, the\nheight\nof the tree, all\nnodes\nmust be as far left as possible.","source_id":"nist-dads.completebinarytree","source_sha256":"eddff42d46193570d031d16204c3922bc2d8b9eac95df9266195aaddbc6d3b74","start":71}],"target_id":"concept.nist.completebinarytree","target_kind":"node","target_sha256":"7c2e7a776b47aeaf0872ef808bbf767ec4ca8d24616cdcc9ad468f90763813a6"}],"concept.nist.completegraph":[{"id":"assertion.concept.nist.completegraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines complete graph as: An undirected graph with an edge between every pair of vertices .","support":[{"end":120,"quote":"An\nundirected graph\nwith an\nedge\nbetween every pair of\nvertices\n.","source_id":"nist-dads.completegraph","source_sha256":"598a2cc31e9af6e904ce41811644a5492c30483db2b8e13ab2ed535ac01bfa4d","start":55}],"target_id":"concept.nist.completegraph","target_kind":"node","target_sha256":"5374b9773559064b23e4443ccc8101d9a7e3056ee31c184193d3e5c5ea2011c0"}],"concept.nist.completetree":[{"id":"assertion.concept.nist.completetree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complete tree as: A tree in which every level , except possibly the deepest, is entirely filled. At depth n, the height of the tree, all nodes are as far left as possible.","support":[{"end":211,"quote":"A\ntree\nin which every\nlevel\n, except possibly the deepest, is entirely filled.  At\ndepth\nn, the\nheight\nof the tree, all\nnodes\nare as far left as possible.","source_id":"nist-dads.completetree","source_sha256":"b9e3308b3f72298b68a0324866571867729c865ff19c88b4270033084f21ceeb","start":57}],"target_id":"concept.nist.completetree","target_kind":"node","target_sha256":"b338be0e522f51c134bea02c2ae6e3b4ebef4dcfd4bf07caaf59b6f033054cc3"}],"concept.nist.complexity":[{"id":"assertion.concept.nist.complexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complexity as: The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an algorithm .","support":[{"end":185,"quote":"The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an\nalgorithm\n.","source_id":"nist-dads.complexity","source_sha256":"38a875a6bd9d82bfd3d38257939c3df23cccfcda951027a28b73a106ad7f1687","start":47}],"target_id":"concept.nist.complexity","target_kind":"node","target_sha256":"1d067b94f1e47053f252bc51b2da38848a938dfacb0a3cfce7a3a5081a42b3f5"}],"concept.nist.complexityclass":[{"id":"assertion.concept.nist.complexityclass","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complexity class as: Any of a set of computational problems with the same bounds ( Θ(n) ) on time and space, for deterministic and nondeterministic machines.","support":[{"end":195,"quote":"Any of a set of computational problems with the same bounds (\nΘ(n)\n) on time and space, for deterministic and nondeterministic machines.","source_id":"nist-dads.complexityclass","source_sha256":"f4c30ba8c5dfbf849dd95394473cfab1199926d139f6b877debe424643023d6d","start":59}],"target_id":"concept.nist.complexityclass","target_kind":"node","target_sha256":"3f186f3c06ed05119f3b81f0316279c4ed6194542ecf6956010539f1f1009e6d"}],"concept.nist.compoundalgorithm":[{"id":"assertion.concept.nist.compoundalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compound algorithm as: An algorithm in which one or more of the computable steps is a call to execute another algorithm.","support":[{"end":160,"quote":"An\nalgorithm\nin which one or more of the computable steps is a call to execute another algorithm.","source_id":"nist-dads.compoundalgorithm","source_sha256":"f990c636213b26381892beb6ed5da234ec583516217cfd6ab0a79d1d0c5cd41f","start":63}],"target_id":"concept.nist.compoundalgorithm","target_kind":"node","target_sha256":"08e22bbb1bde5d21af1b416ac2e71a00d838ac256b9c93c2cf7204d73cb01d61"}],"concept.nist.computable":[{"id":"assertion.concept.nist.computable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines computable as: A function that can be computed by an algorithm --- equivalently, by a Turing machine .","support":[{"end":134,"quote":"A\nfunction\nthat can be computed by an\nalgorithm\n--- equivalently, by a\nTuring machine\n.","source_id":"nist-dads.computable","source_sha256":"0007ea23e232d0447076e22ca306ca0d1c18779c9037bfbc921575f5dc787bd8","start":47}],"target_id":"concept.nist.computable","target_kind":"node","target_sha256":"ac683645fe9f73095de13d84e60afbda63f5a46dd83328ebd1067dfff4e18019"}],"concept.nist.concurrentdatastructure":[{"id":"assertion.concept.nist.concurrentdatastructure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent data structure as: A data structure designed to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","support":[{"end":220,"quote":"A\ndata structure\ndesigned to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","source_id":"nist-dads.concurrentdatastructure","source_sha256":"570da39670b5de2406eaa57ca098d76ebc739f877a98941c05a63a3f3be433bb","start":77}],"target_id":"concept.nist.concurrentdatastructure","target_kind":"node","target_sha256":"d8f82027583d4ac72b6a6e872d4bcca019b6553836cc23e6da02027beee5b209"}],"concept.nist.concurrentreadconwrt":[{"id":"assertion.concept.nist.concurrentreadconwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent read, concurrent write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location. Also known as CRCW.","support":[{"end":298,"quote":"A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location.\nAlso known as\nCRCW.","source_id":"nist-dads.concurrentreadconwrt","source_sha256":"fdecabdb67e64f846421cba075aaafbb5ea4f1dd77369351984e3cb54840e130","start":93}],"target_id":"concept.nist.concurrentreadconwrt","target_kind":"node","target_sha256":"ef25735c1370418eb4661745d951983ce5ba6d8651b5328ad255dce9e72f0838"}],"concept.nist.concurrentreadexcluwrt":[{"id":"assertion.concept.nist.concurrentreadexcluwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent read, exclusive write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time. Also known as CREW.","support":[{"end":291,"quote":"A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time.\nAlso known as\nCREW.","source_id":"nist-dads.concurrentreadexcluwrt","source_sha256":"0d671dca0c3836cc538a1e47224c54d48fcfe9adf70c8050e5590f5c292f2f3e","start":91}],"target_id":"concept.nist.concurrentreadexcluwrt","target_kind":"node","target_sha256":"bd449ff1fc0cd0d6b5b1072684da0b4ef4e28722ce0f6bf936365cd681a4437c"}],"concept.nist.concurrntflw":[{"id":"assertion.concept.nist.concurrntflw","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent flow as: A multi-commodity flow in which the same fraction of the demand of each commodity is satisfied.","support":[{"end":152,"quote":"A\nmulti-commodity flow\nin which the same fraction of the demand of each commodity is satisfied.","source_id":"nist-dads.concurrntflw","source_sha256":"335bd17302482580a7544d79caaefda5276fc3306165475d7feef1cfbfd0bb71","start":57}],"target_id":"concept.nist.concurrntflw","target_kind":"node","target_sha256":"8e7f0d36236a7b63556fa16a2a2502f7cb1c7dcfb05ede20d47336b3cc007e89"}],"concept.nist.confluentlypersistdata":[{"id":"assertion.concept.nist.confluentlypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines confluently persistent data structure as: A fully persistent data structure that allows meld or merge operations to combine two different versions.","support":[{"end":206,"quote":"A fully\npersistent data structure\nthat allows meld or merge operations to combine two different versions.","source_id":"nist-dads.confluentlypersistdata","source_sha256":"1112cdbbe68f3f0f4deec52eff1a3f4c480490fa13da94ef0846ae528213fbdf","start":101}],"target_id":"concept.nist.confluentlypersistdata","target_kind":"node","target_sha256":"421cfabe13317bd422eb34150fcf5217b9c870294e32dd737860ecf3374b78cc"}],"concept.nist.conjunction":[{"id":"assertion.concept.nist.conjunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines conjunction as: The boolean and function.","support":[{"end":74,"quote":"The boolean\nand\nfunction.","source_id":"nist-dads.conjunction","source_sha256":"7cca97bbb5f3ca023ec13715b2ce6ecfdbe1870d7c592380a85922609fa8d32f","start":49}],"target_id":"concept.nist.conjunction","target_kind":"node","target_sha256":"d8c451b4ea5b88c9dee4b5448f2c39ee4e431bd73b8656c29cc245f8627eff8e"}],"concept.nist.connectedcomponents":[{"id":"assertion.concept.nist.connectedcomponents","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines connected components as: The set of maximally connected components of an undirected graph .","support":[{"end":133,"quote":"The\nset\nof\nmaximally connected components\nof an\nundirected graph\n.","source_id":"nist-dads.connectedcomponents","source_sha256":"5f5f4a196cfcc4148ea9c35b657130e7057723228a205b1220725371dced113e","start":67}],"target_id":"concept.nist.connectedcomponents","target_kind":"node","target_sha256":"0a43ca0fdc2669611ff28844fd7f4f5525b7f0b0e6403780ffe66a8f58f6dc85"}],"concept.nist.connectedgraph":[{"id":"assertion.concept.nist.connectedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines connected graph as: An undirected graph that has a path between every pair of vertices .","support":[{"end":125,"quote":"An\nundirected graph\nthat has a\npath\nbetween every pair of\nvertices\n.","source_id":"nist-dads.connectedgraph","source_sha256":"8008f37fe8e1dc935f9ead1c9b10110769738ac29b22d83e8a62b3c031e068f3","start":57}],"target_id":"concept.nist.connectedgraph","target_kind":"node","target_sha256":"8e696504dae60645f54fcc2295239e41cb0734644f0db9bc32425d7c05c1fbc2"}],"concept.nist.constantfunc":[{"id":"assertion.concept.nist.constantfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines constant function as: A function that always gives the same value.","support":[{"end":105,"quote":"A\nfunction\nthat always gives the same value.","source_id":"nist-dads.constantfunc","source_sha256":"dbb3327308a09b033010090592c0f50793ac01783b65b25496216c45248bd330","start":61}],"target_id":"concept.nist.constantfunc","target_kind":"node","target_sha256":"2d84153b4150187e5f28ae09f7d74b88a0458a4f6c454de867c6f15e6164df99"}],"concept.nist.cookreductin":[{"id":"assertion.concept.nist.cookreductin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Cook reduction as: A reduction computed by a deterministic polynomial time oracle Turing machine .","support":[{"end":134,"quote":"A\nreduction\ncomputed by a deterministic\npolynomial time\noracle Turing machine\n.","source_id":"nist-dads.cookreductin","source_sha256":"126139087680f4faa7156a76c3147b54ad85e0e9fa3e200fffed6bd16abb3a9e","start":55}],"target_id":"concept.nist.cookreductin","target_kind":"node","target_sha256":"8d723160be9bfb4f17ad9a400724f3e3f448a2b1efcba4b12d66e08bd098b111"}],"concept.nist.cookstheorem":[{"id":"assertion.concept.nist.cookstheorem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Cook's theorem as: The language SAT of satisfiable Boolean formulas is NP-complete .","support":[{"end":120,"quote":"The language SAT of satisfiable Boolean formulas is\nNP-complete\n.","source_id":"nist-dads.cookstheorem","source_sha256":"17763d089619e80fafbb2a171dca6a71762e61ca7a455226da23bbd08446deb2","start":55}],"target_id":"concept.nist.cookstheorem","target_kind":"node","target_sha256":"baae8fcc934144f5cfeb3c86366fdf51ecafc9a6c2f3a621e5e327678e71b20c"}],"concept.nist.covering":[{"id":"assertion.concept.nist.covering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines covering as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","support":[{"end":171,"quote":"Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","source_id":"nist-dads.covering","source_sha256":"6b006c0284cbae373a73f47cd0da38ddd2d41c29c0ef39edf0f8dae85f57d863","start":43}],"target_id":"concept.nist.covering","target_kind":"node","target_sha256":"1dd5021d8536ec9416587893b0ab066e8627c2eca86f319c7e2a65729dfd7d0a"}],"concept.nist.criticalpath":[{"id":"assertion.concept.nist.criticalpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines critical path problem as: Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices .","support":[{"end":204,"quote":"Find the longest\npath\nfrom any\nsource\nto any\nsinks\nin a\ndirected acyclic graph\nwhich has weights, or numeric values, on\nvertices\n.","source_id":"nist-dads.criticalpath","source_sha256":"4eeea091b0b8a522d05c1290f0e4ca2a59625f7e7d17ad202b72f70342e8149f","start":74}],"target_id":"concept.nist.criticalpath","target_kind":"node","target_sha256":"23b33fbd68570d88292d3b3cde195b0f726c5df0cbc37e2235ad921d4d5c6a3d"}],"concept.nist.csp":[{"id":"assertion.concept.nist.csp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CSP as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. An acronym for Communicating Sequential Processes.","support":[{"end":169,"quote":"C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation.  An acronym for Communicating Sequential Processes.","source_id":"nist-dads.csp","source_sha256":"91ecf279b67a9981ea7f5413edd19040f7a80a2f918895b373e57016a0c5855c","start":33}],"target_id":"concept.nist.csp","target_kind":"node","target_sha256":"0a8223638e48b9493b1cdc0d1fd5ccc0dce8b676321df644d07cb84b2d8cda46"}],"concept.nist.ctl":[{"id":"assertion.concept.nist.ctl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CTL as: A propositional, branching-time temporal logic for which formulas can be checked in linear time. An acronym for Computation Tree Logic.","support":[{"end":170,"quote":"A propositional, branching-time temporal logic for which formulas can be checked in\nlinear\ntime.  An acronym for Computation  Tree Logic.","source_id":"nist-dads.ctl","source_sha256":"1f3d78ac33116197df2933c2f6a89bb5908080577796797c5dc46e0553a968ad","start":33}],"target_id":"concept.nist.ctl","target_kind":"node","target_sha256":"b31c03c96d617dbdd9dfbfe9093796bc1b737764df0d13bc6b443f73c8350919"}],"concept.nist.cuckoohashing":[{"id":"assertion.concept.nist.cuckoohashing","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines cuckoo hashing as: A dictionary implemented with two hash tables , T 1 and T 2 , and two different hash functions , h 1 and h 2 . Each key , k, is either in T 1 [h 1 (k)] or T 2 [h 2 (k)]. A new key , k, is stored in T 1 [h 1 (k)]. If that location is already occupied by another key, l, the other key is moved to T 2 [h 2 (l)]. Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed. For tables that are a bit less than half full and with carefully chosen universal hashing functions, performance is good. A key is deleted by removing it from a table.","support":[{"end":719,"quote":"A\ndictionary\nimplemented with two\nhash tables\n, T\n1\nand T\n2\n, and two different\nhash functions\n, h\n1\nand h\n2\n.  Each\nkey\n, k, is either in T\n1\n[h\n1\n(k)] or T\n2\n[h\n2\n(k)].  A new\nkey\n, k, is stored in T\n1\n[h\n1\n(k)].  If that location is already occupied by another key, l, the other key is moved to T\n2\n[h\n2\n(l)].  Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed.  For tables that are a bit less than half full and with carefully chosen\nuniversal hashing\nfunctions, performance is good.  A key is deleted by removing it from a table.","source_id":"nist-dads.cuckoohashing","source_sha256":"08250f3781e94dc4aa1928c1f02c950a6113fc8cfe40b19977715ff5373e2274","start":59}],"target_id":"concept.nist.cuckoohashing","target_kind":"node","target_sha256":"1a8af5c99954a3731595432a777342d789f21ea10d71f3374d9edaab42028de6"}],"concept.nist.cut":[{"id":"assertion.concept.nist.cut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cut as: A nonempty, proper subset of vertices of a graph .","support":[{"end":83,"quote":"A nonempty,\nproper subset\nof\nvertices\nof a\ngraph\n.","source_id":"nist-dads.cut","source_sha256":"729c8818f4719af73016240de31187e4ef84c23cf24eb30dc9e87262421cc0ec","start":33}],"target_id":"concept.nist.cut","target_kind":"node","target_sha256":"d549c214ed93771d2a596c44f31591d0456a172c2c45ae8cf08f80dae5f6807e"}],"concept.nist.cuttingplane":[{"id":"assertion.concept.nist.cuttingplane","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cutting plane as: A valid inequality for an integer polyhedron that separates the polyhedron from a given point outside it.","support":[{"end":158,"quote":"A valid inequality for an\ninteger polyhedron\nthat separates the polyhedron from a given point outside it.","source_id":"nist-dads.cuttingplane","source_sha256":"7e92349a62e89cbb07da5ea45c9de311d5412c9eb5aa9d3bcfc91900a4dd50de","start":53}],"target_id":"concept.nist.cuttingplane","target_kind":"node","target_sha256":"0edf69b6b1e3d825192cfc9539c8b9eb35e185e74c96902b0addd6273bb9a864"}],"concept.nist.cuttingstock":[{"id":"assertion.concept.nist.cuttingstock","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cutting stock problem as: Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem . It is NP-complete .","support":[{"end":255,"quote":"Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles.  This is a\ntwo-dimensional\nvariant of the\nbin packing problem\n.  It is\nNP-complete\n.","source_id":"nist-dads.cuttingstock","source_sha256":"afc4e9f5ca3b310efa895ffe10e72382e0eecb9b051c559d76bd8155326007e1","start":74}],"target_id":"concept.nist.cuttingstock","target_kind":"node","target_sha256":"c874e3115b8d37d5ceb84faf0507318d7751b96e3155e8d5155db3324a5556d0"}],"concept.nist.cutvertex":[{"id":"assertion.concept.nist.cutvertex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cut vertex as: A vertex whose deletion along with incident edges results in a graph with more components than the original graph. Also known as articulation point.","support":[{"end":195,"quote":"A\nvertex\nwhose deletion along with incident\nedges\nresults in a\ngraph\nwith more components than the original graph.\nAlso known as\narticulation point.","source_id":"nist-dads.cutvertex","source_sha256":"616b87f8dd30ecf0613f82f2b46385a38173c2ab1de96310a5781932596b534e","start":47}],"target_id":"concept.nist.cutvertex","target_kind":"node","target_sha256":"d445a9b8a0179d381cee1f6831470a7ecadc170a6e1500d9509450bb069a4635"}],"concept.nist.cycle":[{"id":"assertion.concept.nist.cycle","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines cycle as: A path that starts and ends at the same vertex and includes at least one edge .","support":[{"end":116,"quote":"A\npath\nthat starts and ends at the same\nvertex\nand includes at least one\nedge\n.","source_id":"nist-dads.cycle","source_sha256":"948e2444191ab96d7451252afd9bdd74e463c4c62e7881495396aadd19e5fe0a","start":37}],"target_id":"concept.nist.cycle","target_kind":"node","target_sha256":"bb7745b5cfd0ed66fbf4b358c481e1552a957b8ea2a9dccf9fbeefcfb5138574"}],"concept.nist.dadjacent":[{"id":"assertion.concept.nist.dadjacent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines D-adjacent as: An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","support":[{"end":156,"quote":"An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","source_id":"nist-dads.dadjacent","source_sha256":"c1860bfcf24ef9d607c9c8fccebf60e3a9c677a041dc843cfbb1081002b32e03","start":47}],"target_id":"concept.nist.dadjacent","target_kind":"node","target_sha256":"c9e0c906b3e0e43eb2c128d6c2f46a4da81a11b3c6c17cb36a4d18a0430e99ad"}],"concept.nist.datastructure":[{"id":"assertion.concept.nist.datastructure","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines data structure as: An organization of information, usually in memory, for better algorithm efficiency , such as queue , stack , linked list , heap , dictionary , and tree , or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree .","support":[{"end":371,"quote":"An organization of information, usually in memory, for better\nalgorithm\nefficiency\n, such as\nqueue\n,\nstack\n,\nlinked list\n,\nheap\n,\ndictionary\n, and\ntree\n, or conceptual unity, such as the name and address of a person.  It may include redundant information, such as length of the\nlist\nor number of\nnodes\nin a\nsubtree\n.","source_id":"nist-dads.datastructure","source_sha256":"a3179d5702ce2790bb2c0d52e5d4c32da237e36963373628c433177946e4e047","start":55}],"target_id":"concept.nist.datastructure","target_kind":"node","target_sha256":"ae053448ccb03f25a41664390e108d312f9f9f828afb892547c38bd27c117698"}],"concept.nist.decidablelanguage":[{"id":"assertion.concept.nist.decidablelanguage","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decidable language as: A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps --- equivalently, can be recognized by a Turing machine that halts for all inputs. Also known as recursive language, totally decidable language.","support":[{"end":323,"quote":"A language for which membership can be decided by an\nalgorithm\nthat halts on all inputs in a finite number of steps --- equivalently, can be recognized by a\nTuring machine\nthat halts for all inputs.\nAlso known as\nrecursive language, totally decidable language.","source_id":"nist-dads.decidablelanguage","source_sha256":"b6f672810917caa1f2846f04e08196557771ae1b86d31ce955222bf4cc82a642","start":63}],"target_id":"concept.nist.decidablelanguage","target_kind":"node","target_sha256":"4387332bd30cf64e697deebb6c5be55acec191f5d4dc89a2b141f6aee9b61331"}],"concept.nist.decidableproblem":[{"id":"assertion.concept.nist.decidableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decidable problem as: A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language . Also known as totally decidable problem, algorithmically solvable, recursively solvable.","support":[{"end":315,"quote":"A\ndecision problem\nthat can be solved by an\nalgorithm\nthat halts on all inputs in a finite number of steps.  The associated language is called a\ndecidable language\n.\nAlso known as\ntotally decidable problem, algorithmically solvable, recursively solvable.","source_id":"nist-dads.decidableproblem","source_sha256":"9baf40fbbbe0d37aefadbd54bd4c703cd9826059a616b606e483c323c70f0cf9","start":61}],"target_id":"concept.nist.decidableproblem","target_kind":"node","target_sha256":"c0e0c9be72899e0f3e608dcd0ed6420b52f10300053ffe0da26b984e3757308f"}],"concept.nist.decisionproblem":[{"id":"assertion.concept.nist.decisionproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decision problem as: A problem with a \"yes\" or \"no\" answer. Equivalently, a function whose range is two values, such as {0,1}.","support":[{"end":165,"quote":"A problem with a \"yes\" or \"no\" answer.  Equivalently, a\nfunction\nwhose\nrange\nis two values, such as {0,1}.","source_id":"nist-dads.decisionproblem","source_sha256":"655506206b7a607a03dbaa794796cd58c75af845dace17d2aee1521f4d8af820","start":59}],"target_id":"concept.nist.decisionproblem","target_kind":"node","target_sha256":"7bcff9336973c9b9703e98ef80759eeb1e9b553274b5ed0ef389793589ed2153"}],"concept.nist.decomposable":[{"id":"assertion.concept.nist.decomposable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decomposable searching problem as: A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem. More formally a problem with a query Q is decomposable given if there exists an efficiently computable associative and commutative binary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","support":[{"end":481,"quote":"A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem.  More formally a problem with a query Q is decomposable given if there exists an efficiently computable\nassociative\nand\ncommutative\nbinary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","source_id":"nist-dads.decomposable","source_sha256":"8d7dda6aaf6bb8796790de2c694bc2f723c94436a055cc53c182ceb15806a16c","start":87}],"target_id":"concept.nist.decomposable","target_kind":"node","target_sha256":"e36799cc643280780a4e82c12325bd12f8f0571d5baddcf911891cea82bc2a6c"}],"concept.nist.degree":[{"id":"assertion.concept.nist.degree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines degree as: (1) Of a vertex , the number of edges connected to it. (2) Of a graph , the maximum degree of any vertex. (3) Of a tree node , the number of child nodes it has.","support":[{"end":200,"quote":"(1) Of a\nvertex\n, the number of\nedges\nconnected to it.  (2) Of a\ngraph\n, the maximum degree of any vertex. (3) Of a\ntree\nnode\n, the number of\nchild\nnodes it has.","source_id":"nist-dads.degree","source_sha256":"531e01c842d9e01293a96d39425f434f04ab02b2392878f9f3d174f45e154559","start":39}],"target_id":"concept.nist.degree","target_kind":"node","target_sha256":"a3ee088cb10e1da94f2b584e957f54672351e7d046f799769cecdbc39e78596d"}],"concept.nist.densegraph":[{"id":"assertion.concept.nist.densegraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dense graph as: A graph in which the number of edges is close to the possible number of edges.","support":[{"end":127,"quote":"A\ngraph\nin which the number of\nedges\nis close to the possible number of edges.","source_id":"nist-dads.densegraph","source_sha256":"64363c9172417e09772ac202726e8ef6cf78636787695ea27c293fc2bf6c6d3e","start":49}],"target_id":"concept.nist.densegraph","target_kind":"node","target_sha256":"702d1449773121aded90ba0edc7bba15b10663fcbc7416ac0a73055423347d5a"}],"concept.nist.depoissonization":[{"id":"assertion.concept.nist.depoissonization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines depoissonization as: To interpret a solution to a poisson model in the original model after poissonization .","support":[{"end":146,"quote":"To interpret a solution to a poisson model in the original model after\npoissonization\n.","source_id":"nist-dads.depoissonization","source_sha256":"0e1f575e6951fff6f10ed86aa28665a585206ee814b4d3a344501b103319b2d3","start":59}],"target_id":"concept.nist.depoissonization","target_kind":"node","target_sha256":"7fbb3ea4da380395e7843859c2ffb6ad6b1606c0cccf3e6cc008ed44723789c3"}],"concept.nist.depth":[{"id":"assertion.concept.nist.depth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines depth as: Of a node , the distance from the node to the root of the tree . Formal Definition: The depth of the root is 0. The depth of a node is one plus the depth of its parent .","support":[{"end":207,"quote":"Of a\nnode\n, the distance from the node to the\nroot\nof the\ntree\n.\nFormal Definition:\nThe depth of the root is 0.  The depth of a node is one plus the depth of its\nparent\n.","source_id":"nist-dads.depth","source_sha256":"806771516d8fae5c20041644eb311e24d9932e66757fa18edebbae1f9f811213","start":37}],"target_id":"concept.nist.depth","target_kind":"node","target_sha256":"e6a3774d9a4c7b39d2fbbff44204e0e563789c4f1974bb451b42001e1e766be9"}],"concept.nist.deque":[{"id":"assertion.concept.nist.deque","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines deque as: A data structure in which items may be added to or deleted from the head or the tail . Also known as doubly-ended queue.","support":[{"end":161,"quote":"A data structure in which items may be added to or deleted from the\nhead\nor the\ntail\n.\nAlso known as\ndoubly-ended queue.","source_id":"nist-dads.deque","source_sha256":"e94eb13f3876119dd1aefc2e8fc55493dc8354933bbfcb5ba25b7d72c8aaaf79","start":41}],"target_id":"concept.nist.deque","target_kind":"node","target_sha256":"a453f20487455d066b485c73fdff0bfba82d2241974aceea76d53ffe7c4b9c6d"}],"concept.nist.descendant":[{"id":"assertion.concept.nist.descendant","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines descendant as: A child of a node in a tree , any of the children of the children, etc.","support":[{"end":118,"quote":"A\nchild\nof a\nnode\nin a\ntree\n, any of the children of the children, etc.","source_id":"nist-dads.descendant","source_sha256":"9302c6cf85e5fc5760d5cc8782a3c25823864e1b1e29ea5b2439bff94e3043e0","start":47}],"target_id":"concept.nist.descendant","target_kind":"node","target_sha256":"b09f57a595d7d86436b17d19ca5d091abbeb596d0529edcd1ae2b29736a5cbd5"}],"concept.nist.determfinitstatemach":[{"id":"assertion.concept.nist.determfinitstatemach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines deterministic finite state machine as: A finite state machine with at most one transition for each symbol and state . Also known as DFA, deterministic finite automaton.","support":[{"end":224,"quote":"A\nfinite state machine\nwith at most one transition for each symbol and\nstate\n.\nAlso known as\nDFA, deterministic finite automaton.","source_id":"nist-dads.determfinitstatemach","source_sha256":"d794b7c71a4370db1afa6e3dc59d24cd3bc3c8863da51faf92eea922eb316441","start":95}],"target_id":"concept.nist.determfinitstatemach","target_kind":"node","target_sha256":"2700c7e36d44e6c91cc1d363a02525290f93f533caa04eaca3d84ff2faa41724"}],"concept.nist.determfinittreeautom":[{"id":"assertion.concept.nist.determfinittreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic finite tree automaton as: A deterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as DFTA.","support":[{"end":418,"quote":"A\ndeterministic finite state machine\nthat accepts\nfinitary trees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The acceptance condition is modified accordingly.\nAlso known as\nDFTA.","source_id":"nist-dads.determfinittreeautom","source_sha256":"c4176ecc2e10ace22c7da47a6e5aa9c6c69596c087417893627e55c17eb6e56d","start":97}],"target_id":"concept.nist.determfinittreeautom","target_kind":"node","target_sha256":"2fd6fb427c19d3763b3d75cd89639fcb973857e05247da9baf4a324968783ea3"}],"concept.nist.deterministc":[{"id":"assertion.concept.nist.deterministc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic as: Permitting at most one next move at any step in a computation.","support":[{"end":115,"quote":"Permitting at most one next move at any step in a computation.","source_id":"nist-dads.deterministc","source_sha256":"68f08f081c249f951ec8a6cfbed17486bfd22eb41c32ade9109ec942113c2bea","start":53}],"target_id":"concept.nist.deterministc","target_kind":"node","target_sha256":"b850156fd2f144a2024d24660c463fecb16cff2bf8b56941ca313a6a7150155c"}],"concept.nist.determtreeautom":[{"id":"assertion.concept.nist.determtreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic tree automaton as: A deterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","support":[{"end":432,"quote":"A\ndeterministic finite state machine\nthat accepts infinite\ntrees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The expressive power of such automata varies depending on the acceptance conditions of the trees.","source_id":"nist-dads.determtreeautom","source_sha256":"0839fa356b372eb14ad8dd178b2790e7c701d87e2ae95222458783299a0a0155","start":83}],"target_id":"concept.nist.determtreeautom","target_kind":"node","target_sha256":"036c0e271d1e76d3d3465c2cf6874dfb7f92becb6dd3d769268af4f6dd459a88"}],"concept.nist.dfsforest":[{"id":"assertion.concept.nist.dfsforest","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines DFS forest as: A rooted forest formed by depth-first search .","support":[{"end":93,"quote":"A rooted\nforest\nformed by\ndepth-first search\n.","source_id":"nist-dads.dfsforest","source_sha256":"dda31b3bff97b400e370b502d95463824708f90e2b22792aff6ac05660563f87","start":47}],"target_id":"concept.nist.dfsforest","target_kind":"node","target_sha256":"8bc1ac64107305937766d5df78b81e69e67a9a91b79e88ea0b5a90fc3c71530f"}],"concept.nist.diagonaliztn":[{"id":"assertion.concept.nist.diagonaliztn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diagonalization as: A proof technique for showing that a given language does not belong to a given complexity class, used in many separation theorems .","support":[{"end":188,"quote":"A proof technique for showing that a given\nlanguage\ndoes not belong to a given\ncomplexity\nclass, used in many\nseparation theorems\n.","source_id":"nist-dads.diagonaliztn","source_sha256":"e292b46806510cd8d2cf50fb4de8c6eed42c5b9984dee0104276848eadb7d259","start":57}],"target_id":"concept.nist.diagonaliztn","target_kind":"node","target_sha256":"7339faa770118c495e162655032a50e667042437ffeab8d53eff8c0eb6ca420d"}],"concept.nist.diameter":[{"id":"assertion.concept.nist.diameter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diameter as: The maximum of the distances between all possible pairs of vertices of a graph .","support":[{"end":123,"quote":"The maximum of the distances between all possible pairs of\nvertices\nof a\ngraph\n.","source_id":"nist-dads.diameter","source_sha256":"8cde6ae2957f2ea4a34692ae6240af30b47bd2aa28158fa472f02ae7aa7a6910","start":43}],"target_id":"concept.nist.diameter","target_kind":"node","target_sha256":"283b425bd774d2d08da205a3c891adfebe561466b26ac571b993bece3c64f70a"}],"concept.nist.dichotomicsearch":[{"id":"assertion.concept.nist.dichotomicsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dichotomic search as: Search by selecting between two distinct alternatives (dichotomies) at each step.","support":[{"end":142,"quote":"Search by selecting between two distinct alternatives (dichotomies) at each step.","source_id":"nist-dads.dichotomicsearch","source_sha256":"1f0fb363311d15659520193588bc216cbc3dde4a4ea0a602dfe2d48a0ef124f1","start":61}],"target_id":"concept.nist.dichotomicsearch","target_kind":"node","target_sha256":"8df5ecf1c2a082aea6ca9f8b7dd671d560e950bc8b8b9eab9a126fffa5afd564"}],"concept.nist.dictionary":[{"id":"assertion.concept.nist.dictionary","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dictionary as: An abstract data type storing items, or values. A value is accessed by an associated key . Basic operations are new, insert, find and delete. Formal Definition: The operations new(), insert(k, v, D), and find(k, D) may be defined with axiomatic semantics as follows. new() returns a dictionary find(k, insert(k, v, D)) = v find(k, insert(j, v, D)) = find(k, D) if k ≠ j where k and j are keys, v is a value, and D is a dictionary. The modifier function delete(k, D) may be defined as follows. delete(k, new()) = new() delete(k, insert(k, v, D)) = delete(k, D) delete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j If we want find to be a total function , we could define find(k, new()) using a special value: fail . This only changes the return type of find. find(k, new()) = fail Also known as association list, map, property list.","support":[{"end":896,"quote":"An\nabstract data type\nstoring items, or values.  A value is accessed by an associated\nkey\n. Basic operations are new, insert, find and delete.\nFormal Definition:\nThe operations new(), insert(k, v, D), and find(k, D) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a dictionary\nfind(k, insert(k, v, D)) = v\nfind(k, insert(j, v, D)) = find(k, D) if k ≠ j\nwhere k and j are keys, v is a value, and D is a dictionary.\nThe modifier function delete(k, D) may be defined as follows.\ndelete(k, new()) = new()\ndelete(k, insert(k, v, D)) = delete(k, D)\ndelete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j\nIf we want find to be a\ntotal function\n, we could define  find(k, new()) using a special value:\nfail\n. This only changes the return type of find.\nfind(k, new()) =\nfail\nAlso known as\nassociation list, map, property list.","source_id":"nist-dads.dictionary","source_sha256":"cc3e036afdfd1c94475781009b160dcbcba0384f3c802633c29a212df630fe25","start":51}],"target_id":"concept.nist.dictionary","target_kind":"node","target_sha256":"5ce72105df0f2e925ca286011c0058b862760ad1be238eb22529a23725bffdf4"}],"concept.nist.difference":[{"id":"assertion.concept.nist.difference","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines difference as: The difference of set A minus set B is a set having all the members which are in A, but not in B.","support":[{"end":144,"quote":"The difference of\nset\nA minus set B is a set having all the members which are in A, but not in B.","source_id":"nist-dads.difference","source_sha256":"e2cc5602eab4858363242acdf797eaa93550b771c317d00ea2b6f1a10eb83ed9","start":47}],"target_id":"concept.nist.difference","target_kind":"node","target_sha256":"0b1405cb10a96d26881f72f3ce39829cca5ebdda7495275039c299183d8d5f6e"}],"concept.nist.digitalsearchtree":[{"id":"assertion.concept.nist.digitalsearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines digital search tree as: A trie which stores the strings in internal nodes , so there is no need for extra leaf nodes to store the strings.","support":[{"end":183,"quote":"A\ntrie\nwhich stores the\nstrings\nin\ninternal nodes\n, so there is no need for extra\nleaf\nnodes to store the strings.","source_id":"nist-dads.digitalsearchtree","source_sha256":"ebd58d05b3fac6c129593a6a3cb9ed8f092995a92a63e4a4ea8b01ab3f59d09e","start":69}],"target_id":"concept.nist.digitalsearchtree","target_kind":"node","target_sha256":"c2285ab66c2196eda5db972aa6a2a91853ac5e454927333c577cfa0881450b02"}],"concept.nist.digitaltree":[{"id":"assertion.concept.nist.digitaltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines digital tree as: A tree for storing strings in which nodes are organized by substrings common to two or more strings.","support":[{"end":155,"quote":"A\ntree\nfor storing\nstrings\nin which\nnodes\nare organized by\nsubstrings\ncommon to two or more strings.","source_id":"nist-dads.digitaltree","source_sha256":"c474c227e76c37b0f38b4017c51e4f2b0fe2d49a44eb76bfb4da2b0d6fcbd99b","start":55}],"target_id":"concept.nist.digitaltree","target_kind":"node","target_sha256":"cf6fca2734317921fc91bb62396e443a61280771d26dace312e4a7681735b124"}],"concept.nist.diningphilos":[{"id":"assertion.concept.nist.diningphilos","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dining philosophers as: Suppose a number of philosophers surround a dining table. Adjacent philosophers share one fork. They spend time thinking or trying to eat. A philosopher must have both the fork on the left and the fork on the right to eat. Clearly adjacent philosophers cannot eat at the same time. The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","support":[{"end":453,"quote":"Suppose a number of philosophers surround a dining table.   Adjacent philosophers share one fork.   They spend time thinking or trying to eat.   A philosopher must have both the fork on the left and the fork on the right to eat.  Clearly adjacent philosophers cannot eat at the same time.  The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","source_id":"nist-dads.diningphilos","source_sha256":"543ec714a8ba7d84459aa02c5526bd0df9be0ef37d83c36e66e10d36ce38d2ed","start":70}],"target_id":"concept.nist.diningphilos","target_kind":"node","target_sha256":"0101409871ae1741721ea1163a259e4b47f98f87b01397cf9772fe3075729b1a"}],"concept.nist.directacycgraph":[{"id":"assertion.concept.nist.directacycgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines directed acyclic graph as: A directed graph with no path that starts and ends at the same vertex . Also known as DAG, acyclic directed graph, oriented acyclic graph.","support":[{"end":209,"quote":"A\ndirected graph\nwith no\npath\nthat starts and ends at the same\nvertex\n.\nAlso known as\nDAG, acyclic directed graph, oriented acyclic graph.","source_id":"nist-dads.directacycgraph","source_sha256":"fc132b88085dcc4b7ffde81733ee2f56648fda146b73ef06a176e7ec25c800d4","start":71}],"target_id":"concept.nist.directacycgraph","target_kind":"node","target_sha256":"51de4a139ca897434a7f314e98d2f60921e1297037c885bcef2e608d98d08480"}],"concept.nist.directchaining":[{"id":"assertion.concept.nist.directchaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines direct chaining as: A collision resolution scheme in which the hash table is an array of links to lists . Each list holds all the items with the same hash value.","support":[{"end":202,"quote":"A\ncollision resolution scheme\nin which the\nhash table\nis an\narray\nof\nlinks\nto\nlists\n. Each list holds all the items with the same hash value.","source_id":"nist-dads.directchaining","source_sha256":"bd7e779c7eb47122405828eac9a0ca2adeee1d2c4d0916c5470ede3f482264c1","start":61}],"target_id":"concept.nist.directchaining","target_kind":"node","target_sha256":"49946b49cbeafca8560680f2d61afc0ee8697e10032abf402bb5f0550e8972ff"}],"concept.nist.directedacyclicwordgraph":[{"id":"assertion.concept.nist.directedacyclicwordgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines directed acyclic word graph as: (1) A directed acyclic graph representing the suffixes of a given string in which each edge is labeled with a character. The characters along a path from the root to a node are the substring which the node represents. (2) A finite state machine that recognizes a set of words. Also known as DAWG.","support":[{"end":382,"quote":"(1) A\ndirected acyclic graph\nrepresenting the\nsuffixes\nof a given\nstring\nin which each\nedge\nis labeled with a character.  The characters along a\npath\nfrom the\nroot\nto a\nnode\nare the\nsubstring\nwhich the\nnode\nrepresents. (2) A\nfinite state machine\nthat recognizes a set of words.\nAlso known as\nDAWG.","source_id":"nist-dads.directedacyclicwordgraph","source_sha256":"e1349b16c1fa6fa0b15cb0c186aa2dca13017fd19ecf2810b99eea3e568660e2","start":85}],"target_id":"concept.nist.directedacyclicwordgraph","target_kind":"node","target_sha256":"88879fbe9affb98e855ddca3213a9bb22ada211ea04ae2bcb58cc432e6690aab"}],"concept.nist.directedgraph":[{"id":"assertion.concept.nist.directedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines directed graph as: A graph whose edges are ordered pairs of vertices . That is, each edge can be followed from one vertex to another vertex. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}. Also known as digraph, oriented graph.","support":[{"end":474,"quote":"A\ngraph\nwhose\nedges\nare\nordered\npairs of\nvertices\n.  That is, each edge can be followed from one vertex to another vertex.\nFormal Definition:\nA graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}.  If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n, that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}.\nAlso known as\ndigraph, oriented graph.","source_id":"nist-dads.directedgraph","source_sha256":"9fd184fffc095c760fd303be8c17e9315069c49bd05d9afad9332da4e0f58a49","start":59}],"target_id":"concept.nist.directedgraph","target_kind":"node","target_sha256":"f36b6b923e3127bc56213d16f7dd6e0c83360983f760a762402352472c6edfe8"}],"concept.nist.discretintrv":[{"id":"assertion.concept.nist.discretintrv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines discrete interval encoding tree as: A binary search tree that stores consecutive values as intervals. Also known as diet.","support":[{"end":178,"quote":"A\nbinary search tree\nthat stores consecutive values as intervals.\nAlso known as\ndiet.","source_id":"nist-dads.discretintrv","source_sha256":"653e8031db1675dbe4367fe8be936d7515b8d002622cfe3c3426b7b1ee121d68","start":93}],"target_id":"concept.nist.discretintrv","target_kind":"node","target_sha256":"035b3aebdb7cc0ce97400a74e126cc59b58e60548d840d314375874d584f62ac"}],"concept.nist.discretpcntr":[{"id":"assertion.concept.nist.discretpcntr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines discrete p-center as: A facility location problem in which the supply points must be a subset of demand points.","support":[{"end":155,"quote":"A\nfacility location\nproblem in which the supply points must be a subset of demand points.","source_id":"nist-dads.discretpcntr","source_sha256":"45fb3571a34f062bc667d1c384b866e4b9bdff336909d3db71ca9fd6f5b1d736","start":66}],"target_id":"concept.nist.discretpcntr","target_kind":"node","target_sha256":"6fbe8b5ffd06b4c330e07ed01c6276e450c7d17482d75e663c4b8f04c9e853c8"}],"concept.nist.disjointset":[{"id":"assertion.concept.nist.disjointset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines disjoint set as: A set whose members do not overlap, are not duplicated, etc.","support":[{"end":111,"quote":"A\nset\nwhose members do not overlap, are not duplicated, etc.","source_id":"nist-dads.disjointset","source_sha256":"86100ba61008acfa598b4b1f6a23fb032a9a8e600589a08ce1adcd4a870157fd","start":51}],"target_id":"concept.nist.disjointset","target_kind":"node","target_sha256":"33de2d135495eb22b73113270b561135a5e8a867b1368508a1980267a9b74882"}],"concept.nist.disjunction":[{"id":"assertion.concept.nist.disjunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines disjunction as: The boolean or function.","support":[{"end":73,"quote":"The boolean\nor\nfunction.","source_id":"nist-dads.disjunction","source_sha256":"4573ddb99b52f75dba40d52f745698ca404905961de3187b7e991624ce807ca3","start":49}],"target_id":"concept.nist.disjunction","target_kind":"node","target_sha256":"1ccfb8d2082155f5c4fcd4e6e76c101db5c6149d7863416d6818460d8b86cb47"}],"concept.nist.distributionalcomplex":[{"id":"assertion.concept.nist.distributionalcomplex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distributional complexity as: The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs.","support":[{"end":211,"quote":"The expected running time of the best possible\ndeterministic algorithm\nover the worst possible probability distribution on the inputs.","source_id":"nist-dads.distributionalcomplex","source_sha256":"128133aa9b64b6879f663795860e7122bda4bfe1cd172b40e20c4636cf4464f8","start":77}],"target_id":"concept.nist.distributionalcomplex","target_kind":"node","target_sha256":"27af84fed758fc65a9b372d50ad6523cb185b0477c7006f49b5b47fe7ec0bb4e"}],"concept.nist.domain":[{"id":"assertion.concept.nist.domain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines domain as: (1) The inputs for which a function or relation is defined. For instance, 0 is not in the domain of reciprocal (1/x). (2) The possible values of a variable.","support":[{"end":196,"quote":"(1) The inputs for which a\nfunction\nor\nrelation\nis defined. For instance, 0 is not in the domain of reciprocal (1/x).  (2) The possible values of a variable.","source_id":"nist-dads.domain","source_sha256":"2a566c1c6fefcc53f5d34ba43cab6bed09153d747f2f0ff3cd9d9a8f7496475d","start":39}],"target_id":"concept.nist.domain","target_kind":"node","target_sha256":"47db7d4180c9bfe6c455010571e9db04f8ce65f505aa774fb2e02d6ae9152a0e"}],"concept.nist.dontcare":[{"id":"assertion.concept.nist.dontcare","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines don't care as: A special symbol which matches any other symbol of a given alphabet .","support":[{"end":116,"quote":"A special symbol which matches any other symbol of a given\nalphabet\n.","source_id":"nist-dads.dontcare","source_sha256":"5324fe0ed31fe1ec243f01f6f570bcb2d858f0a692cdb01d2a2567ed6ee475d3","start":47}],"target_id":"concept.nist.dontcare","target_kind":"node","target_sha256":"c5e482399be63d7d8ee0ed662b35a8f299924512dd06fae50ea77f55a397e64c"}],"concept.nist.doubleendpq":[{"id":"assertion.concept.nist.doubleendpq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines double-ended priority queue as: A priority queue which simultaneously keeps track of the maximum and minimum keys , and supports operations efficiently on either extreme (minimum or maximum).","support":[{"end":244,"quote":"A\npriority queue\nwhich simultaneously keeps track of the maximum and minimum\nkeys\n, and supports operations efficiently on either extreme (minimum or maximum).","source_id":"nist-dads.doubleendpq","source_sha256":"3a3b63acc1e0b0532c83bab7e5ae1ae52bfeb36b316d312e4d2f6d6da60df6f0","start":85}],"target_id":"concept.nist.doubleendpq","target_kind":"node","target_sha256":"2e70254bc3a21c7720cdbaf47667309c440ca4dcfc555b24892233899d4cacec"}],"concept.nist.doublylinkedlist":[{"id":"assertion.concept.nist.doublylinkedlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines doubly linked list as: A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time. Also known as two-way linked list, symmetrically linked list.","support":[{"end":336,"quote":"A variant of a\nlinked list\nin which each item has a\nlink\nto the previous item as well as the next.  This allows easily accessing list items backward as well as forward and deleting any item in constant time.\nAlso known as\ntwo-way linked list, symmetrically linked list.","source_id":"nist-dads.doublylinkedlist","source_sha256":"b822c310ebbfb3886d7194412cb1b8538ee9b226b3f88c6c1134efd9e409afee","start":67}],"target_id":"concept.nist.doublylinkedlist","target_kind":"node","target_sha256":"8383ec6eaf4db2a45946e5161f8e65085fe5e261535533da689f8dbd669c22fb"}],"concept.nist.dtree":[{"id":"assertion.concept.nist.dtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines D-tree as: (1) A BB(α) tree where the weights are the number of searches down that path. (2) A height-balanced binary tree that divides regions along their boundaries to serve as a spatial access method .","support":[{"end":238,"quote":"(1) A\nBB(α) tree\nwhere the weights are the number of searches down that path.   (2) A\nheight-balanced\nbinary tree\nthat divides regions along their boundaries to serve as a\nspatial access method\n.","source_id":"nist-dads.dtree","source_sha256":"08469b755ea5e231a2990e740c96a05c7bbbb7428a933e5411592ccd61c813a8","start":43}],"target_id":"concept.nist.dtree","target_kind":"node","target_sha256":"f5613beea15ac7c7b22a419516eb1b207de24ea0c027f256b322e162e9e96b7b"}],"concept.nist.dual":[{"id":"assertion.concept.nist.dual","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dual as: The dual of a planar graph , G, is a graph with a vertex for each region in G and an edge between vertices for each pair of adjacent regions. The new edge crosses the edge in G which is the boundary between the adjacent regions.","support":[{"end":264,"quote":"The dual of a\nplanar graph\n, G, is a\ngraph\nwith a\nvertex\nfor each region in G and an\nedge\nbetween vertices for each pair of adjacent regions.  The new edge crosses the edge in G which is the boundary between the adjacent regions.","source_id":"nist-dads.dual","source_sha256":"2381f4394c3fe51e8e8157dbfac8ac22b3c533959aba989d3d4ea0baa0aeae62","start":35}],"target_id":"concept.nist.dual","target_kind":"node","target_sha256":"0ae84528c2bb14bb27f80ee0c1a6494afb81b53715570c9075dd03408a3b0e2f"}],"concept.nist.dutchnationalflag":[{"id":"assertion.concept.nist.dutchnationalflag","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Dutch national flag as: Rearrange elements in an array into three groups: bottom, middle, and top. One algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom. The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes. At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top. If it belongs in the bottom, swap it with the element just above the bottom. If it is in the middle, leave it. Update the appropriate index. Complexity is Θ(n) moves and examinations.","support":[{"end":762,"quote":"Rearrange elements in an\narray\ninto three groups: bottom, middle, and top.\nOne algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom.  The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes.  At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top.  If it belongs in the bottom, swap it with the element just above the bottom.  If it is in the middle, leave it.  Update the appropriate index. Complexity is\nΘ(n)\nmoves and examinations.","source_id":"nist-dads.dutchnationalflag","source_sha256":"00786e98a5a6397d7ae8f70d4c416bf2cf95622fb0fa2d5f749901b7f7f62987","start":70}],"target_id":"concept.nist.dutchnationalflag","target_kind":"node","target_sha256":"99fbcbdf75230fde22b284edf8a6bb8628bec90a7f74430e68bc7005dcc820a4"}],"concept.nist.dynamic":[{"id":"assertion.concept.nist.dynamic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic as: When the problem domain may change, e.g., there may be insertions and deletions.","support":[{"end":121,"quote":"When the problem domain may change, e.g., there may be insertions and deletions.","source_id":"nist-dads.dynamic","source_sha256":"8d87072668c419d3085f7a0ce312f8d5ab0a7df6981403f652d857152ea4fff4","start":41}],"target_id":"concept.nist.dynamic","target_kind":"node","target_sha256":"5fb02831273237f48dea23e0c6ba4c0efb1ed65800bd8e458973bee02580637c"}],"concept.nist.dynamicarray":[{"id":"assertion.concept.nist.dynamicarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic array as: An array whose size may change over time. Items are not only added or removed, but memory used changes, too.","support":[{"end":166,"quote":"An\narray\nwhose size may change over time.  Items are not only added or removed, but memory used changes, too.","source_id":"nist-dads.dynamicarray","source_sha256":"bebbb1a329a6f65c42f2984a4d7867dfe48894ab08b4eb6b4986aae9d87041d4","start":57}],"target_id":"concept.nist.dynamicarray","target_kind":"node","target_sha256":"03d87d85a8fcdaea16d03f68b31a9fd5bf36f731818ef2c6923e4743655b8e7b"}],"concept.nist.dynamichashing":[{"id":"assertion.concept.nist.dynamichashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic hashing as: A hash table that grows to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.","support":[{"end":241,"quote":"A\nhash table\nthat grows to handle more items.  The associated\nhash function\nmust change as the table grows.  Some schemes may shrink the table to save space when items are deleted.","source_id":"nist-dads.dynamichashing","source_sha256":"058f18cf5257245a61720d02175044fce70eef8d5be7619f775891c92cc14bb0","start":61}],"target_id":"concept.nist.dynamichashing","target_kind":"node","target_sha256":"2daf9659c46c4aa9c22bebe8ae6c919d14a9ac2cd2243c6accebe99aaca3198e"}],"concept.nist.edge":[{"id":"assertion.concept.nist.edge","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines edge as: A connection between two vertices of a graph . In a weighted graph , each edge has an number, called a \"weight\". In a directed graph , an edge goes from one vertex, the source , to another, the target , and hence makes connection in only one direction. Also known as arc.","support":[{"end":308,"quote":"A connection between two\nvertices\nof a\ngraph\n.  In a\nweighted graph\n, each edge has an number, called a \"weight\".  In a\ndirected graph\n, an edge goes from one vertex, the\nsource\n, to another, the\ntarget\n, and hence makes connection in only one direction.\nAlso known as\narc.","source_id":"nist-dads.edge","source_sha256":"f95951d7c3b890f321e438c56f0e7761015ba4566acf54e355593e453c1baaea","start":35}],"target_id":"concept.nist.edge","target_kind":"node","target_sha256":"aef517818a44524e89c7cd7190b50c1cd94b946ae50ac7a423b23e88bd8a8b88"}],"concept.nist.edgecoloring":[{"id":"assertion.concept.nist.edgecoloring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge coloring as: An assignment of colors (or any distinct marks) to the edges of a graph . A coloring is a proper coloring if no two adjacent edges have the same color.","support":[{"end":205,"quote":"An assignment of colors (or any distinct marks) to the\nedges\nof a\ngraph\n.  A coloring is a\nproper coloring\nif no two\nadjacent\nedges have the same color.","source_id":"nist-dads.edgecoloring","source_sha256":"f61ed30aa5995e4fb226eb7003e0dbe6e856430e9e61095daa415b53159ffc4b","start":53}],"target_id":"concept.nist.edgecoloring","target_kind":"node","target_sha256":"f72f7484a1d9e99159c890d9e92e25094c20ad7aba3aa190d6e936c6b594c879"}],"concept.nist.edgeconnectivity":[{"id":"assertion.concept.nist.edgeconnectivity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge connectivity as: (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","support":[{"end":274,"quote":"(1) The smallest number of\nedges\nwhose deletion will cause a\nconnected graph\nto not be connected.  (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","source_id":"nist-dads.edgeconnectivity","source_sha256":"c2b77eda72fc496a56db9851f3a180b1776c257262c20946c19927b212ed4cfc","start":61}],"target_id":"concept.nist.edgeconnectivity","target_kind":"node","target_sha256":"d02a2f4f4f203f8a119fd73f41b9da9c863ef6bc9d9641a496896880ac1dfd09"}],"concept.nist.edgecrossing":[{"id":"assertion.concept.nist.edgecrossing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge crossing as: Two different edges cross in a graph drawing if their geometric representations intersect. The number of crossings in a graph drawing is the number of pairs of edges which cross.","support":[{"end":232,"quote":"Two different\nedges\ncross in a\ngraph drawing\nif their geometric representations intersect.  The number of crossings in a graph drawing is the number of pairs of edges which cross.","source_id":"nist-dads.edgecrossing","source_sha256":"9c05a16f9fecfb8372d5062f09a8fe5e92fcf374ed5f66a4e1a6274201d9ec2e","start":53}],"target_id":"concept.nist.edgecrossing","target_kind":"node","target_sha256":"274f8db0c33edaea7f40d36ac2c73d12f91ac4fc58429e27ca8b471cb31cf7c6"}],"concept.nist.editoperation":[{"id":"assertion.concept.nist.editoperation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edit operation as: On a string , the operation of deletion, insertion, or substitution performed on a single symbol. On a tree , the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a child , the insertion of a new node followed by the reassignment of some arcs departing from the parent of the new node, or the substitution of the label of one of the nodes with another label. Each edit operation may have an associated nonnegative real number representing its cost.","support":[{"end":563,"quote":"On a\nstring\n, the operation of deletion, insertion, or substitution performed on a single symbol.  On a\ntree\n, the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a\nchild\n, the insertion of a new node followed by the reassignment of some\narcs\ndeparting from the parent of the new node, or the substitution of the label of one of the nodes with another label.  Each edit operation may have an associated nonnegative real number representing its cost.","source_id":"nist-dads.editoperation","source_sha256":"ac0d77d8a88340de27dc664a7105205e6d869fd532719574510844f742b5202d","start":55}],"target_id":"concept.nist.editoperation","target_kind":"node","target_sha256":"f1217c2432a42329def056fc903c9ba5db86184455a7f1455679dda011caddbc"}],"concept.nist.editscript":[{"id":"assertion.concept.nist.editscript","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edit script as: A sequence of viable edit operations on a string or tree .","support":[{"end":107,"quote":"A sequence of viable\nedit operations\non a\nstring\nor\ntree\n.","source_id":"nist-dads.editscript","source_sha256":"d3114932ecab3b31e221492cc06caabd9cb8d3beb49a9dc3883e51bab4e46ca2","start":49}],"target_id":"concept.nist.editscript","target_kind":"node","target_sha256":"cb6459aec658a824ad23276a5c2c3ecf0c6c66b394c4e1653fd5619f5a7c7b4a"}],"concept.nist.efficiency":[{"id":"assertion.concept.nist.efficiency","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines efficiency as: The resources an algorithm used to find an answer. It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","support":[{"end":280,"quote":"The resources an\nalgorithm\nused to find an answer.  It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","source_id":"nist-dads.efficiency","source_sha256":"d918cc5c8a975068d058d72f14a6c96774c00aa1393a29e5bdf5efbec74f0dda","start":47}],"target_id":"concept.nist.efficiency","target_kind":"node","target_sha256":"3c0ccc22d7accc6a56fccd05d275e935234a75632a9becf2a234c791b45b2d4a"}],"concept.nist.eightqueens":[{"id":"assertion.concept.nist.eightqueens","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 8 queens as: Place eight chess queens on an 8 × 8 board such that no queen can attack another. Efficiently find all possible placements.","support":[{"end":172,"quote":"Place eight chess queens on an 8 × 8 board such that no queen can attack another.  Efficiently find all possible placements.","source_id":"nist-dads.eightqueens","source_sha256":"1e793ef6dab2eb08d9185c9ca703787d0a4e9a80aff1f5770ff24335c01c0372","start":48}],"target_id":"concept.nist.eightqueens","target_kind":"node","target_sha256":"42165a45c62af37bb4ee42982cf435740d307e33b1fa526d80b173206de7168b"}],"concept.nist.elasticbuckettrie":[{"id":"assertion.concept.nist.elasticbuckettrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines elastic-bucket trie as: A variant of a bucket trie in which each leaf node for n strings is a bucket allocated to hold exactly n strings.","support":[{"end":182,"quote":"A variant of a\nbucket trie\nin which each\nleaf\nnode for n strings is a\nbucket\nallocated to hold exactly n strings.","source_id":"nist-dads.elasticbuckettrie","source_sha256":"d8a05f683c598c398b84cceb0e0f7a07647e709dcb0be811e5615f734f2eaeed","start":69}],"target_id":"concept.nist.elasticbuckettrie","target_kind":"node","target_sha256":"e5fbf4b7383e03453fd0a3ead565902b9f6c1051036bee283ef39205fa71cf91"}],"concept.nist.elementnqnss":[{"id":"assertion.concept.nist.elementnqnss","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines element uniqueness as: The problem of determining if there are duplicates in a set of numbers.","support":[{"end":139,"quote":"The problem of determining if there are duplicates in a\nset\nof numbers.","source_id":"nist-dads.elementnqnss","source_sha256":"94b52523d33846c78eb1fe0ee5101079147f6464618d257ad25a8bed06de0713","start":68}],"target_id":"concept.nist.elementnqnss","target_kind":"node","target_sha256":"e69bbfb7c260636c2e2c9ab88e4c5ae1ed79457a5cc0da57aac77f851c40e84d"}],"concept.nist.endofstring":[{"id":"assertion.concept.nist.endofstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines end-of-string as: A special character indicating the end of a string .","support":[{"end":105,"quote":"A special character indicating the end of a\nstring\n.","source_id":"nist-dads.endofstring","source_sha256":"aa2927c0af1ae12b911e93f504c55878ec84266e62881758fdb5bf3c6290209e","start":53}],"target_id":"concept.nist.endofstring","target_kind":"node","target_sha256":"7c0447947bd7c01629d6f3566f71796f7e176a7ee61214af023fa51a8cf35a38"}],"concept.nist.euclidntrvls":[{"id":"assertion.concept.nist.euclidntrvls","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euclidean traveling salesman problem as: Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point.","support":[{"end":245,"quote":"Find a\npath\nof minimum\nEuclidean distance\nbetween points in a plane which includes each point exactly once and returns to its starting point.","source_id":"nist-dads.euclidntrvls","source_sha256":"77cd64cc6239689a9aa8442a73a9dea1c86e321e631ad6ffa1fc84bf0f7b3e15","start":104}],"target_id":"concept.nist.euclidntrvls","target_kind":"node","target_sha256":"53022f83e2b6a2681106af77beac2c9d7311364183c6c1bc0be6b2d2015d1596"}],"concept.nist.euclidsteinertree":[{"id":"assertion.concept.nist.euclidsteinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euclidean Steiner tree as: A tree of minimum Euclidean distance connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","support":[{"end":258,"quote":"A tree of minimum\nEuclidean distance\nconnecting a set of points, called\nterminals\n, in the plane.  This tree may include points other than the terminals, which are called\nSteiner points\n.","source_id":"nist-dads.euclidsteinertree","source_sha256":"d575bff4ea9a40bb44fa51d4da8565897bb3a34a28914dc992a558ff09ef1a59","start":71}],"target_id":"concept.nist.euclidsteinertree","target_kind":"node","target_sha256":"ad14545437700775caddd219057b9890db64d1ef67227f4b9447285d5482b974"}],"concept.nist.eulercycle":[{"id":"assertion.concept.nist.eulercycle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euler cycle as: A path through a graph which starts and ends at the same vertex and includes every edge exactly once. Also known as Eulerian path, Königsberg bridges problem.","support":[{"end":207,"quote":"A\npath\nthrough a\ngraph\nwhich starts and ends at the same\nvertex\nand includes every\nedge\nexactly once.\nAlso known as\nEulerian path, Königsberg bridges problem.","source_id":"nist-dads.eulercycle","source_sha256":"395559e6a6f506cc92d8c5713f9fcd53dabcfa0463b033220c9d94115028b237","start":49}],"target_id":"concept.nist.eulercycle","target_kind":"node","target_sha256":"d299816eedc5e17a85b1358080379d6244e01893586753c3d9b41d788a9c911e"}],"concept.nist.euleriangrph":[{"id":"assertion.concept.nist.euleriangrph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Eulerian graph as: A graph that has an Euler cycle .","support":[{"end":88,"quote":"A\ngraph\nthat has an\nEuler cycle\n.","source_id":"nist-dads.euleriangrph","source_sha256":"76e59d8d4838801a12578e5809d656261dca66d07acb160705ddb87b622ec684","start":55}],"target_id":"concept.nist.euleriangrph","target_kind":"node","target_sha256":"7dae918d9a121f75e618e0ed70e9668998bd6eb49b309f4fa92ac2b9291ea087"}],"concept.nist.eulersformula":[{"id":"assertion.concept.nist.eulersformula","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euler's formula as: For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","support":[{"end":185,"quote":"For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","source_id":"nist-dads.eulersformula","source_sha256":"a79b39b7e5b4092302d4af23f8dcb98a4d4caa47ed6cfcd073db2029f0b03117","start":57}],"target_id":"concept.nist.eulersformula","target_kind":"node","target_sha256":"2a7020cbe79d0becc1ddddb78635afc2a69e67cab351611110ed849ea6a191cf"}],"concept.nist.excell":[{"id":"assertion.concept.nist.excell","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines EXCELL as: A point access method using a dynamic multidimensional array .","support":[{"end":105,"quote":"A\npoint access method\nusing a dynamic multidimensional\narray\n.","source_id":"nist-dads.excell","source_sha256":"f3950d4c93f2d5d8caa09f6ecaca7aaf0cc7e981b349f46f833433ccc5f05b29","start":43}],"target_id":"concept.nist.excell","target_kind":"node","target_sha256":"fdea8d06a9791b41c1eb88a8a03b1382060749b8ecd4700bcab3a20902b1cae3"}],"concept.nist.exclusivereadconwrt":[{"id":"assertion.concept.nist.exclusivereadconwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines exclusive read, concurrent write as: A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location. Also known as ERCW.","support":[{"end":291,"quote":"A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location.\nAlso known as\nERCW.","source_id":"nist-dads.exclusivereadconwrt","source_sha256":"baca4651f8fee9ec07b02964a811c267b5d1aeacb55403f67ba579d052f032a6","start":91}],"target_id":"concept.nist.exclusivereadconwrt","target_kind":"node","target_sha256":"76e1d018d5c50f1f21800cbba4b51f7b4d2efb746431d4ebe973fe5075ee8cc4"}],"concept.nist.exclusivereadexcluwrt":[{"id":"assertion.concept.nist.exclusivereadexcluwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines exclusive read, exclusive write as: A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time. Also known as EREW.","support":[{"end":284,"quote":"A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time.\nAlso known as\nEREW.","source_id":"nist-dads.exclusivereadexcluwrt","source_sha256":"5b9c7f097234863bcb8631bdadc5752c4dd6fa0e9ed3d454b78a4cc87b1ae3f1","start":89}],"target_id":"concept.nist.exclusivereadexcluwrt","target_kind":"node","target_sha256":"a7c0043dd956187ce4090dddd8510494a678844a47917a2cecaa8f3969ba1f5b"}],"concept.nist.existentlstt":[{"id":"assertion.concept.nist.existentlstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines existential state as: A state in a nondeterministic Turing machine from which the machine accepts if any move leads to acceptance.","support":[{"end":169,"quote":"A state in a\nnondeterministic Turing machine\nfrom which the machine accepts if any move leads to acceptance.","source_id":"nist-dads.existentlstt","source_sha256":"b53c6e580548be35599e18aa72588980fe03d73ad0b0f161a521dbd1249cf753","start":61}],"target_id":"concept.nist.existentlstt","target_kind":"node","target_sha256":"f22688a6bcedd53b32490f5f3ad40ef2c0620c95cfb835ded13bc7cba0eb961a"}],"concept.nist.extendedbinarytree":[{"id":"assertion.concept.nist.extendedbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended binary tree as: A binary tree with special nodes replacing every null subtree. Every regular node has two children , and every special node has no children.","support":[{"end":212,"quote":"A\nbinary tree\nwith special\nnodes\nreplacing every\nnull\nsubtree.  Every regular node has two\nchildren\n, and every special node has no children.","source_id":"nist-dads.extendedbinarytree","source_sha256":"64476136bec4a084fc21927753b40c53a17cd9609adf7ede65ac9cf650611026","start":71}],"target_id":"concept.nist.extendedbinarytree","target_kind":"node","target_sha256":"7c4ab7ea353470ac5d88da03b965881164f894b21771aa764ded181b535bc6a1"}],"concept.nist.extendiblehashing":[{"id":"assertion.concept.nist.extendiblehashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extendible hashing as: A hash table in which the hash function is the last few bits of the key and the table refers to buckets . Table entries with the same final bits may use the same bucket. If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size. If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","support":[{"end":465,"quote":"A\nhash table\nin which the\nhash function\nis the last few bits of the\nkey\nand the table refers to\nbuckets\n.  Table entries with the same final bits may use the same bucket.  If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size.  If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","source_id":"nist-dads.extendiblehashing","source_sha256":"fc564903109bc91cd2946396e5d9c6f4c3018e3ebd4970f1186d22c08d001175","start":67}],"target_id":"concept.nist.extendiblehashing","target_kind":"node","target_sha256":"7c409b1e21e81a75f6ce5933735c190e02b44e373dfc447a8948589a864261b4"}],"concept.nist.extendkdtree":[{"id":"assertion.concept.nist.extendkdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended k-d tree as: A spatial access method where successive levels are split along different dimensions into nonoverlapping cells. Objects are indexed in all cells they intersect.","support":[{"end":226,"quote":"A\nspatial access method\nwhere successive levels are split along different dimensions into nonoverlapping cells.  Objects are indexed in all cells they intersect.","source_id":"nist-dads.extendkdtree","source_sha256":"3fdb98b348d6965f2bf4185aece53da22dfeaa519b46c3b50cc719fcb3f7e432","start":65}],"target_id":"concept.nist.extendkdtree","target_kind":"node","target_sha256":"b2a0c5203005d1efa585926cd54b691e4e8abf242735a71f5e31b560f775c701"}],"concept.nist.externalindx":[{"id":"assertion.concept.nist.externalindx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external index as: An auxiliary data structure added to a main data structure to improve operations, such as a search on a secondary key .","support":[{"end":178,"quote":"An auxiliary data structure added to a main data structure to improve operations, such as a\nsearch\non a secondary\nkey\n.","source_id":"nist-dads.externalindx","source_sha256":"efcc84a32a89e758ffc8e23bbc164a25d380f9a8552da3f424a1cdf634142bce","start":59}],"target_id":"concept.nist.externalindx","target_kind":"node","target_sha256":"9bc0e513f7b7d6f50f34c5f0fc5f5d5bcffd3dabda488d710fcb2918d299b4b7"}],"concept.nist.externalmemorydatastr":[{"id":"assertion.concept.nist.externalmemorydatastr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external memory data structure as: A data structure that is efficient even when accessing most of the data is very slow, such as, on a disk.","support":[{"end":196,"quote":"A\ndata structure\nthat is efficient even when accessing most of the data is very slow, such as, on a disk.","source_id":"nist-dads.externalmemorydatastr","source_sha256":"232858b56910135bf1fb67067090d6425fe1fce5d7d5659b1be0b537b494e1e2","start":91}],"target_id":"concept.nist.externalmemorydatastr","target_kind":"node","target_sha256":"e4622dbcd83d0003d2c11ed7424631a176179db9ee3b64102ae4d8cde3355887"}],"concept.nist.externalsort":[{"id":"assertion.concept.nist.externalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines external sort as: Any sort algorithm that uses external memory, such as tape or disk, during the sort. Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","support":[{"end":305,"quote":"Any\nsort\nalgorithm that uses external memory, such as tape or disk, during the sort.  Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","source_id":"nist-dads.externalsort","source_sha256":"55d6b1a58549e7ecb1dfd53d2e2fcf63ce1b79c2aaaee550e7d50a8e75fb1151","start":53}],"target_id":"concept.nist.externalsort","target_kind":"node","target_sha256":"47c07ed7388a1e975a85ec44f2c1727fc07d5fba781ccbd16b4159665ed7b870"}],"concept.nist.extremal":[{"id":"assertion.concept.nist.extremal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extremal as: Some of the entries of the auxiliary array used in a string matching algorithm. An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","support":[{"end":210,"quote":"Some of the entries of the auxiliary array used in a\nstring matching\nalgorithm.  An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","source_id":"nist-dads.extremal","source_sha256":"bb73171df50d96477035d4fc3d7db40295c4dfe79fe68b527e32fc781fecce82","start":43}],"target_id":"concept.nist.extremal","target_kind":"node","target_sha256":"83cd094b32e7ec91383ea94ac17697680ffce433d79f63ffe9b883494c0dde78"}],"concept.nist.extremepoint":[{"id":"assertion.concept.nist.extremepoint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extreme point as: A corner point of a polyhedron . More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","support":[{"end":194,"quote":"A corner point of a\npolyhedron\n.  More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","source_id":"nist-dads.extremepoint","source_sha256":"f7cc4cca486a18026a46bf72f92bc83ca057ce0275371ae52948e0f2e41a106b","start":53}],"target_id":"concept.nist.extremepoint","target_kind":"node","target_sha256":"63d7f3caa84beeeb3e927c634f91c41e6d84455ca59e482abc14de026dd5d202"}],"concept.nist.facilityloc":[{"id":"assertion.concept.nist.facilityloc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance objective function . The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","support":[{"end":431,"quote":"Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance\nobjective function\n. The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","source_id":"nist-dads.facilityloc","source_sha256":"2c73e9db783d4077cc4f9a1f456969be84328f318126416ca51801f946a8ed88","start":66}],"target_id":"concept.nist.facilityloc","target_kind":"node","target_sha256":"7f3354b8131d5d7cc31f36d6c6faf07da7dc0f7c02ab860e4f38d75059525092"}],"concept.nist.feasibleregn":[{"id":"assertion.concept.nist.feasibleregn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feasible region as: The set of all possible solutions of an optimization problem .","support":[{"end":119,"quote":"The\nset\nof all possible solutions of an\noptimization problem\n.","source_id":"nist-dads.feasibleregn","source_sha256":"68683b888fd16222249a1cf04927eea6b518540e8ced137a8bf18329eaf34e55","start":57}],"target_id":"concept.nist.feasibleregn","target_kind":"node","target_sha256":"61d87e2399d763fad0b7344eb7c47588e1fbd0de627b51dcd59abafb22090ba0"}],"concept.nist.feasiblesltn":[{"id":"assertion.concept.nist.feasiblesltn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feasible solution as: Any element of the feasible region of an optimization problem .","support":[{"end":124,"quote":"Any element of the\nfeasible region\nof an\noptimization problem\n.","source_id":"nist-dads.feasiblesltn","source_sha256":"0517af75c221b92805011fc7148b6f7cce34a6cf8c80863c1f39430d355f4a50","start":61}],"target_id":"concept.nist.feasiblesltn","target_kind":"node","target_sha256":"440d95d141cdeb966a45f44ff3e0a337a2597b4653e4c317ad419ae97258af9c"}],"concept.nist.feedbackedgeset":[{"id":"assertion.concept.nist.feedbackedgeset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feedback edge set as: The smallest set of edges whose deletion results in an acyclic graph .","support":[{"end":131,"quote":"The smallest\nset\nof\nedges\nwhose deletion results in an\nacyclic graph\n.","source_id":"nist-dads.feedbackedgeset","source_sha256":"67609d2b2a71f31d2a18f56750cfff90bd043376f82365bbcc77cfe2ca7ee58d","start":61}],"target_id":"concept.nist.feedbackedgeset","target_kind":"node","target_sha256":"fb8839153d35c530291fc5f79f8c5fbde973657e1f8a7593716a4ab1c1e5ea0a"}],"concept.nist.feedbackvertexset":[{"id":"assertion.concept.nist.feedbackvertexset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feedback vertex set as: The smallest set of vertices whose deletion results in an acyclic graph .","support":[{"end":138,"quote":"The smallest\nset\nof\nvertices\nwhose deletion results in an\nacyclic graph\n.","source_id":"nist-dads.feedbackvertexset","source_sha256":"071a146c91c3c74f683d8ebb014d0c54a6fffebfe961aafa9410ac57bbc9641a","start":65}],"target_id":"concept.nist.feedbackvertexset","target_kind":"node","target_sha256":"92837dc3b4d8725524fb08bcca58742080d687aa94b796bedee76210aa2f95ea"}],"concept.nist.fibonacciheap":[{"id":"assertion.concept.nist.fibonacciheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Fibonacci heap as: A heap made of a forest of trees . The amortized cost of the operations create, insert a value, decrease a value, find minimum, and merge or join ( meld ) two heaps, is a constant Θ(1) . The delete operation takes O(log n) .","support":[{"end":285,"quote":"A\nheap\nmade of a\nforest\nof\ntrees\n.  The\namortized cost\nof the operations create, insert a value, decrease a value, find minimum, and merge or join (\nmeld\n) two heaps, is a constant\nΘ(1)\n.  The delete operation takes\nO(log n)\n.","source_id":"nist-dads.fibonacciheap","source_sha256":"610beb2ac26b81c97a7cc813ce0215514ba162ce84ce0fa100763aaa009085af","start":59}],"target_id":"concept.nist.fibonacciheap","target_kind":"node","target_sha256":"541c02cb38ca5238d575555e55a7f60b89744428d367516d16aeed5e75ccd11e"}],"concept.nist.fibonaccitree":[{"id":"assertion.concept.nist.fibonaccitree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Fibonacci tree as: A variant of a binary tree where a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2. An order 0 Fibonacci tree has no nodes , and an order 1 tree has 1 node.","support":[{"end":255,"quote":"A variant of a\nbinary tree\nwhere a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2.  An order 0 Fibonacci tree has no\nnodes\n, and an order 1 tree has 1 node.","source_id":"nist-dads.fibonaccitree","source_sha256":"14c4da10b4c2cd742455d1902fb1db8decb570ce0729783ff010e0b0455f6734","start":59}],"target_id":"concept.nist.fibonaccitree","target_kind":"node","target_sha256":"40ff85dd6d16b9fff774545c31e9ce9bb59b87c0569ba97147c3bf5458512ce5"}],"concept.nist.finitarytree":[{"id":"assertion.concept.nist.finitarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines finitary tree as: A tree with a finite number of children at every node .","support":[{"end":112,"quote":"A\ntree\nwith a finite number of\nchildren\nat every\nnode\n.","source_id":"nist-dads.finitarytree","source_sha256":"f1862b2e470339d25d7d180bb828be8c51616951e38c768db1ae6a73a9ebad73","start":57}],"target_id":"concept.nist.finitarytree","target_kind":"node","target_sha256":"9acd529764ba81355f1e559ea193135010a0f223b4340922b17bc9edc27013bf"}],"concept.nist.finitestatemachine":[{"id":"assertion.concept.nist.finitestatemachine","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines finite state machine as: A model of computation consisting of a set of states , a start state , an input alphabet , and a transition function that maps input symbols and current states to a next state . Computation begins in the start state with an input string. It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions ( Mealy machine ) or states ( Moore machine ), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state ( nondeterministic finite state machine ), one or more states designated as accepting states ( recognizer ), etc. Also known as finite state automaton.","support":[{"end":800,"quote":"A\nmodel of computation\nconsisting of a set of\nstates\n, a\nstart state\n, an input\nalphabet\n, and a\ntransition function\nthat maps input symbols and current states to a\nnext state\n. Computation begins in the start state with an input string.  It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions (\nMealy machine\n) or states (\nMoore machine\n), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state (\nnondeterministic finite state machine\n), one or more states designated as\naccepting states\n(\nrecognizer\n), etc.\nAlso known as\nfinite state automaton.","source_id":"nist-dads.finitestatemachine","source_sha256":"d9bb803f66f7f32cf883d80607bf602162ac8b0b34fa93ccdc0cc66cf772b015","start":67}],"target_id":"concept.nist.finitestatemachine","target_kind":"node","target_sha256":"3c50e32f68a17914860ef20bbea67d9f220d152ae645c0cfecf1b230a87fdaad"}],"concept.nist.finitestatetransducer":[{"id":"assertion.concept.nist.finitestatetransducer","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines finite state transducer as: A finite state machine specifically with a read-only input and a write-only output. The input and output cannot be reread or changed.","support":[{"end":207,"quote":"A\nfinite state machine\nspecifically with a read-only input and a write-only output.  The input and output cannot be reread or changed.","source_id":"nist-dads.finitestatetransducer","source_sha256":"334341c777b605dc5e995c5e440cbde69a2e420504de6fe10f9548de894ac71d","start":73}],"target_id":"concept.nist.finitestatetransducer","target_kind":"node","target_sha256":"c0ee1eb5e90925b7c09e3723132a23e997c5b63e5418c09ddb13cf1142a86ad4"}],"concept.nist.firstinfrstt":[{"id":"assertion.concept.nist.firstinfrstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines first-in, first-out as: A policy that items are processed in order of arrival. A queue implements this.","support":[{"end":145,"quote":"A policy that items are processed in order of arrival.  A\nqueue\nimplements this.","source_id":"nist-dads.firstinfrstt","source_sha256":"51c64c582a19cdf3f12d72b90906b527cb9fed75da7cf5b0bef0fe6afc6195e2","start":65}],"target_id":"concept.nist.firstinfrstt","target_kind":"node","target_sha256":"79f8ba5ee2ab2959539c14e7ae59e9754cef73e640d4f9b91ea64358f82764f8"}],"concept.nist.fixedgrdmthd":[{"id":"assertion.concept.nist.fixedgrdmthd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fixed-grid method as: Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","support":[{"end":234,"quote":"Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","source_id":"nist-dads.fixedgrdmthd","source_sha256":"ca619315703e9d6b9c31188fc98cc9ed9fa1d47d6bb12971ab17d6710d738485","start":61}],"target_id":"concept.nist.fixedgrdmthd","target_kind":"node","target_sha256":"01cf7068e32ef3c94b669779fd04216da25725adf96d1c82e324abc466e0f6ea"}],"concept.nist.flow":[{"id":"assertion.concept.nist.flow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow as: A measure of the maximum weight along paths in a weighted, directed graph .","support":[{"end":110,"quote":"A measure of the maximum weight along\npaths\nin a\nweighted, directed graph\n.","source_id":"nist-dads.flow","source_sha256":"4fe4394cb88f0e9a27d595921395352f3231bfb870eec56607f0c78386069dfe","start":35}],"target_id":"concept.nist.flow","target_kind":"node","target_sha256":"843a207f8c1250fef33ff19ddb929a3cd4193d85e29160719af48c8616738bfd"}],"concept.nist.flowconsrvtn":[{"id":"assertion.concept.nist.flowconsrvtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow conservation as: The property that no vertex , except the source and sink , of a flow network creates or stores flow. More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","support":[{"end":252,"quote":"The property that no\nvertex\n, except the\nsource\nand\nsink\n, of a\nflow network\ncreates or stores flow.  More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","source_id":"nist-dads.flowconsrvtn","source_sha256":"ddcef55770c66947c806375302d04eef558d5841810f59561294cd33a4d5ccda","start":61}],"target_id":"concept.nist.flowconsrvtn","target_kind":"node","target_sha256":"99718c320c2bd6c80256c28744875ca4984a8dd245d1d6d58f0074669d76840b"}],"concept.nist.flowfunction":[{"id":"assertion.concept.nist.flowfunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow function as: An assignment of flow values to the edges of a flow network that satisfies flow conservation , skew symmetry , and capacity constraints . Also known as network flow.","support":[{"end":218,"quote":"An assignment of flow values to the\nedges\nof a\nflow network\nthat satisfies\nflow conservation\n,\nskew symmetry\n, and\ncapacity constraints\n.\nAlso known as\nnetwork flow.","source_id":"nist-dads.flowfunction","source_sha256":"ffc8e935bcc98b50a4d315d6b0ec5ecbe2ed54fd8ec3e77afe9209b03068ab51","start":53}],"target_id":"concept.nist.flowfunction","target_kind":"node","target_sha256":"97f3a284e2c56554de9bc2711e0d13cb8558581665ab85baa7524ac68b925366"}],"concept.nist.flownetwork":[{"id":"assertion.concept.nist.flownetwork","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow network as: A weighted , directed graph with two specially marked nodes, the source s and the sink t, and a capacity function that maps edges to positive real numbers, u: E |→ ℜ + .","support":[{"end":220,"quote":"A\nweighted\n,\ndirected graph\nwith two specially marked nodes, the\nsource\ns and the\nsink\nt, and a\ncapacity\nfunction that maps\nedges\nto positive real numbers, u: E |→ ℜ\n+\n.","source_id":"nist-dads.flownetwork","source_sha256":"852d2c9ed9ff83bde5f6188d9b9a099baedf4a92458cb75bc0b48fae40466118","start":51}],"target_id":"concept.nist.flownetwork","target_kind":"node","target_sha256":"c1e5b362960c72b3218aaa73aebd4b4c30942f86701d47173a11e029fbbd6f00"}],"concept.nist.forest":[{"id":"assertion.concept.nist.forest","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forest as: A collection of one or more trees . Formal Definition: An undirected , acyclic graph .","support":[{"end":125,"quote":"A collection of one or more\ntrees\n.\nFormal Definition:\nAn\nundirected\n,\nacyclic graph\n.","source_id":"nist-dads.forest","source_sha256":"99e804470cc60455d89a1cac7b86539ac6a5af0ce12403b5c873283fe28e19cc","start":39}],"target_id":"concept.nist.forest","target_kind":"node","target_sha256":"08a54c3a56473e5fa07e73a1c7dcf05bc15c0c2182c27ffba89cd81f6affefd5"}],"concept.nist.forestedit":[{"id":"assertion.concept.nist.forestedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forest editing problem as: The problem of finding an edit script of minimum cost which transforms a given forest into another given forest.","support":[{"end":183,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\nforest\ninto another given forest.","source_id":"nist-dads.forestedit","source_sha256":"147e36035bfae9b252b23e4519b9db42be4b5cd26975e66a0cdc112ad8925efd","start":71}],"target_id":"concept.nist.forestedit","target_kind":"node","target_sha256":"aea6421c984d298786660fc4866f74541ae0df7172a387e6058e8a00f2260282"}],"concept.nist.formalmethod":[{"id":"assertion.concept.nist.formalmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines formal methods as: A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","support":[{"end":226,"quote":"A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","source_id":"nist-dads.formalmethod","source_sha256":"9ed8eb1e3d3178b609a2e010088fc858e2ee0ff4873e824d0901a1931d60de02","start":55}],"target_id":"concept.nist.formalmethod","target_kind":"node","target_sha256":"2db5628be0a64d612019d37ca1721e0a905867491daf6741696ce72079363521"}],"concept.nist.formalverf":[{"id":"assertion.concept.nist.formalverf","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines formal verification as: Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments. This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","support":[{"end":377,"quote":"Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments.  This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","source_id":"nist-dads.formalverf","source_sha256":"daa467642913765b9a6f17242ac6e40aff2dbfe7b98efe79a25c2b4c8839b58d","start":65}],"target_id":"concept.nist.formalverf","target_kind":"node","target_sha256":"dc0296cd3809d19c9d0cff0091fb57670cfcfae53f1ab78d968f9cd7c3532d54"}],"concept.nist.forwardindex":[{"id":"assertion.concept.nist.forwardindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forward index as: An index into a set of texts . This is usually created as the first step to making an inverted index .","support":[{"end":160,"quote":"An index into a set of\ntexts\n.  This is usually created as the first step to making an\ninverted index\n.","source_id":"nist-dads.forwardindex","source_sha256":"b9575d58668ad1dd26381cac96b39b9b39ec417f102d5e064aac5bc4d267496d","start":57}],"target_id":"concept.nist.forwardindex","target_kind":"node","target_sha256":"5ea191fb6a137db4b73e7c505badd195896e032e621c9ece5775cc01c0d20b36"}],"concept.nist.fractional":[{"id":"assertion.concept.nist.fractional","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fractional solution as: Typically, a solution to a relaxation of an optimization problem .","support":[{"end":131,"quote":"Typically, a solution to a\nrelaxation\nof an\noptimization problem\n.","source_id":"nist-dads.fractional","source_sha256":"cfaf7dae83ce27f2456b74a7b4d5daf6b278cf3ccded4b1b29e4bf854a3cb56e","start":65}],"target_id":"concept.nist.fractional","target_kind":"node","target_sha256":"2c8885bd5ab671d89ed9aff1e9453b4f67c4a8e9ad6830a0f054ddc88f17387a"}],"concept.nist.fractionalknapsack":[{"id":"assertion.concept.nist.fractionalknapsack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fractional knapsack problem as: Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of materials, a greedy algorithm finds the optimum. Take as much as possible of the material that is most valuable per unit volume. If there is still room, take as much as possible of the next most valuable material. Continue until the knapsack is full. Also known as continuous knapsack problem.","support":[{"end":577,"quote":"Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume.  Since we may take pieces (fractions) of materials, a\ngreedy algorithm\nfinds the optimum.  Take as much as possible of the material that is most valuable per unit volume.  If there is still room, take as much as possible of the next most valuable material.  Continue until the knapsack is full.\nAlso known as\ncontinuous knapsack problem.","source_id":"nist-dads.fractionalknapsack","source_sha256":"96269774579da6ac03f14eab4da0641e39e0c4c7613268a15aa631654b17eb37","start":86}],"target_id":"concept.nist.fractionalknapsack","target_kind":"node","target_sha256":"c958626a00032d079bc63d7d2c0c95f16ce3434795b9b50057323707d3f424e2"}],"concept.nist.freeedge":[{"id":"assertion.concept.nist.freeedge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free edge as: An edge which is not in a matching .","support":[{"end":81,"quote":"An\nedge\nwhich is not in a\nmatching\n.","source_id":"nist-dads.freeedge","source_sha256":"0cbede7db018a342e372a66e034b7c45d26ae3f1eb15bcaee260149716746295","start":45}],"target_id":"concept.nist.freeedge","target_kind":"node","target_sha256":"10e55f808a782da21d7fb999d90c55c30bd4c86030a2f3c64679a15538f3363b"}],"concept.nist.freetree":[{"id":"assertion.concept.nist.freetree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free tree as: A connected , acyclic , undirected graph .","support":[{"end":87,"quote":"A\nconnected\n,\nacyclic\n,\nundirected graph\n.","source_id":"nist-dads.freetree","source_sha256":"482afc2713c584f6593bf008b89bb285fc6192d218bac9c0520fd8e5ff41253f","start":45}],"target_id":"concept.nist.freetree","target_kind":"node","target_sha256":"4ba15da575d54b331f7d0552d120eb98b2af39f5680280fc5b34f0129140f078"}],"concept.nist.freevertex":[{"id":"assertion.concept.nist.freevertex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free vertex as: A vertex not on a matched edge in a matching , or, one which has not been matched.","support":[{"end":131,"quote":"A\nvertex\nnot on a\nmatched edge\nin a\nmatching\n, or, one which has not been matched.","source_id":"nist-dads.freevertex","source_sha256":"0ab7fbb4fde8deac1d906d6d4064c1f6766e6a079342fbbf54fd0e91e386f012","start":49}],"target_id":"concept.nist.freevertex","target_kind":"node","target_sha256":"508ffa29013bd7450eacf3075cfb45f0d4a9350323d96b4077fb8677cef1d980"}],"concept.nist.fullbinarytree":[{"id":"assertion.concept.nist.fullbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines full binary tree as: A binary tree in which each node has exactly zero or two children . Also known as proper binary tree.","support":[{"end":164,"quote":"A\nbinary tree\nin which each\nnode\nhas exactly zero or two\nchildren\n.\nAlso known as\nproper binary tree.","source_id":"nist-dads.fullbinarytree","source_sha256":"59c736857d433098a0cbbc69b64c50939f4c7c56f7d8280dd89e6fba6e0f2421","start":63}],"target_id":"concept.nist.fullbinarytree","target_kind":"node","target_sha256":"a01917f77712798fbcf0f15ee6a7a1249604eb44d9d5584eb930762e672eb0b0"}],"concept.nist.fullinvertedindex":[{"id":"assertion.concept.nist.fullinvertedindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines full inverted index as: An inverted index that includes the exact location within texts, in addition to the text in which the word appears.","support":[{"end":184,"quote":"An\ninverted index\nthat includes the exact location within texts, in addition to the text in which the word appears.","source_id":"nist-dads.fullinvertedindex","source_sha256":"6be76eeea23db4958c9d3b721950a81f3ceaf818e801146ab171dd27c60073f4","start":69}],"target_id":"concept.nist.fullinvertedindex","target_kind":"node","target_sha256":"445cbe4afbdae47a6350e60421623341621b944b5c7bdf2f977ccc3421de581a"}],"concept.nist.fullydynamic":[{"id":"assertion.concept.nist.fullydynamic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully dynamic graph problem as: Problem where the update operations include unrestricted insertions and deletions of edges .","support":[{"end":173,"quote":"Problem where the update operations include unrestricted insertions and deletions of\nedges\n.","source_id":"nist-dads.fullydynamic","source_sha256":"6c1f24a69345ee6153f9c7d3b26b8161c2a7e30a8001b55f07186dbcfe1ef318","start":81}],"target_id":"concept.nist.fullydynamic","target_kind":"node","target_sha256":"0892c1d4021d6182a223efe7fbcd060bb9c15c52d94e309b642f8822778591d9"}],"concept.nist.fullypersistdata":[{"id":"assertion.concept.nist.fullypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully persistent data structure as: A persistent data structure that allows updates to all versions, previous and latest.","support":[{"end":174,"quote":"A\npersistent data structure\nthat allows updates to all versions, previous and latest.","source_id":"nist-dads.fullypersistdata","source_sha256":"a03b9b597f1ce78c55bcff98e4d36b7b2e8b997235c77a4abd6bc078be79e135","start":89}],"target_id":"concept.nist.fullypersistdata","target_kind":"node","target_sha256":"a64148e2a8171c6ad9ca0020210013ae605b8de526cbdd0a5d94a5c47337629d"}],"concept.nist.function":[{"id":"assertion.concept.nist.function","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines function as: (1) A computation which takes some arguments or inputs and yields an output. Any particular input yields the same output every time. More formally, a mapping from each element in the domain to an element in the range . (2) A subroutine which returns a value.","support":[{"end":304,"quote":"(1) A computation which takes some arguments or inputs and yields an output.  Any particular input yields the same output every time.  More formally, a mapping from each element in the\ndomain\nto an element in the\nrange\n.  (2) A subroutine which returns a value.","source_id":"nist-dads.function","source_sha256":"3e48512c2ab9dc97adf628c45a8566dc6be250c5f22de9c26239619e29fceda5","start":43}],"target_id":"concept.nist.function","target_kind":"node","target_sha256":"d1bd965537408d0851c169bc82257905dbf27611d67449e7eeb8c72f4d28e3e6"}],"concept.nist.gbdtree":[{"id":"assertion.concept.nist.gbdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines GBD-tree as: A generalized BD-tree , hence the name, which stores spatially extended objects as a hierarchy of minimum bounding boxes . It is a balanced multiway tree which serves as a spatial access method .","support":[{"end":244,"quote":"A generalized\nBD-tree\n, hence the name, which stores spatially extended objects as a hierarchy  of\nminimum bounding boxes\n.  It is a balanced multiway tree which serves as a\nspatial access method\n.","source_id":"nist-dads.gbdtree","source_sha256":"bd3dbf8aeb379ea7d5416a5779e7325e80c55d9fd0c3eb880a8eebfa9ccf93fe","start":47}],"target_id":"concept.nist.gbdtree","target_kind":"node","target_sha256":"14d886a9f5417806027b48a668344fd6346ebd50003c7eccec4ef4a936fddc5e"}],"concept.nist.geometricopt":[{"id":"assertion.concept.nist.geometricopt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines geometric optimization problem as: An optimization problem induced by a collection of geometric objects.","support":[{"end":156,"quote":"An\noptimization problem\ninduced by a collection of geometric objects.","source_id":"nist-dads.geometricopt","source_sha256":"dd94d9c5d5c1434efdb8f7a990df4baba9a6413752d3daf0fd89d8e952ad7259","start":87}],"target_id":"concept.nist.geometricopt","target_kind":"node","target_sha256":"0a206afddbdf8ff17b83ea22db586b8c4faa58a78fe46569e90c1c1aaa4a47b0"}],"concept.nist.globaloptimum":[{"id":"assertion.concept.nist.globaloptimum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines global optimum as: The best possible solution to a problem.","support":[{"end":95,"quote":"The best possible solution to a problem.","source_id":"nist-dads.globaloptimum","source_sha256":"a36ff5943cdfd2e913fcc876fcc559eb11d82c2261aa6f590f1a1761c4484e5c","start":55}],"target_id":"concept.nist.globaloptimum","target_kind":"node","target_sha256":"46402dfadf897aae42e64372676c5f00a53a98b6f0f623aa340cc0fb3d5f5452"}],"concept.nist.graph":[{"id":"assertion.concept.nist.graph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines graph as: A set of items connected by edges . Each item is called a vertex or node . Formally, a graph is a set of vertices and a binary relation between vertices, adjacency. Formal Definition: A graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is symmetric , or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow self-loops , adjacency is irreflexive .","support":[{"end":594,"quote":"A set of items connected by\nedges\n.  Each item is called a\nvertex\nor\nnode\n.  Formally, a graph is a\nset\nof vertices and a\nbinary relation\nbetween vertices, adjacency.\nFormal Definition:\nA graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is\nsymmetric\n, or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n.","source_id":"nist-dads.graph","source_sha256":"f8640c0a5038ec364d37f157c2059a307aaf0fa359dd306a30d76c791079b55d","start":41}],"target_id":"concept.nist.graph","target_kind":"node","target_sha256":"e7c7df91664ec6182e10ac82e673e0de066eafe14390b2009200816f40b99f6f"}],"concept.nist.graphconcen":[{"id":"assertion.concept.nist.graphconcen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph concentration as: Contracting a graph by removing a subset of the vertices .","support":[{"end":123,"quote":"Contracting a\ngraph\nby removing a subset of the\nvertices\n.","source_id":"nist-dads.graphconcen","source_sha256":"764560fbf6660a1518ffb93b6fdb17026dec7ac8835fb7ba3e3f4bcfd0bb50d6","start":65}],"target_id":"concept.nist.graphconcen","target_kind":"node","target_sha256":"c371305e70c88eca7d34da913177232d11f2010121c97ed5faa99accb2b9bf09"}],"concept.nist.graphdrawing":[{"id":"assertion.concept.nist.graphdrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph drawing as: The problem of representing a graph in a plane \"neatly,\" for instance with a minimum number of edge crossings .","support":[{"end":169,"quote":"The problem of representing a\ngraph\nin a plane \"neatly,\" for instance with a minimum number of\nedge crossings\n.","source_id":"nist-dads.graphdrawing","source_sha256":"70834f6f91394d32ebe5424e840d36a2c2dc09d4ef1b67ec1064d231f7ed69f4","start":58}],"target_id":"concept.nist.graphdrawing","target_kind":"node","target_sha256":"4d2c10145c26cdcf33c67107ee1f18c2a756ff3fc171c0056197ad9edd43bd28"}],"concept.nist.graphisomrph":[{"id":"assertion.concept.nist.graphisomrph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph isomorphism as: Determine if two graphs are isomorphic .","support":[{"end":106,"quote":"Determine if two\ngraphs\nare\nisomorphic\n.","source_id":"nist-dads.graphisomrph","source_sha256":"a783850cd266bbf061d7c275027724a7a61ef8ed9085ed140d26390b8bcc9e51","start":66}],"target_id":"concept.nist.graphisomrph","target_kind":"node","target_sha256":"6a1a2a95e7307183d3a8be59aa4a3cbfff0d34dfe914fda58c16c5ddf664998c"}],"concept.nist.graphpartition":[{"id":"assertion.concept.nist.graphpartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph partition as: Partition the vertices while keeping the cost of spanning edges low.","support":[{"end":130,"quote":"Partition\nthe\nvertices\nwhile keeping the cost of spanning\nedges\nlow.","source_id":"nist-dads.graphpartition","source_sha256":"3cfeac926bee4537091575a1843d5f94140df9c01c25320ebe38b515cb78ae5b","start":62}],"target_id":"concept.nist.graphpartition","target_kind":"node","target_sha256":"f9fbe260c8e525d426819822334cb27a0423b8389aacdf0f895805e1c52df7f8"}],"concept.nist.griddrawing":[{"id":"assertion.concept.nist.griddrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines grid drawing as: A graph drawing in which each vertex is represented by a point with integer coordinates.","support":[{"end":139,"quote":"A\ngraph drawing\nin which each\nvertex\nis represented by a point with integer coordinates.","source_id":"nist-dads.griddrawing","source_sha256":"ca1775f228c407ba35e361baba9dc1df0b49d6197669fbaae5305cfa8c03010d","start":51}],"target_id":"concept.nist.griddrawing","target_kind":"node","target_sha256":"7154c7d94d50f21c778f427e6f52ec0aac57c582df1eea3f4c5ac219b20fce01"}],"concept.nist.gridfile":[{"id":"assertion.concept.nist.gridfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines grid file as: A point access method which splits space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Small sets of points are referred to by one or more cells of the grid.","support":[{"end":240,"quote":"A\npoint access method\nwhich splits space into a nonperiodic grid.  Each spatial dimension is divided by a\nlinear hash\n.  Small sets of points are referred to by one or more cells of the grid.","source_id":"nist-dads.gridfile","source_sha256":"80bb48ecd9eca8eafa2dbcc12c2204ca93cc19317bd87a760380a51de7cb47de","start":49}],"target_id":"concept.nist.gridfile","target_kind":"node","target_sha256":"9ac8e6b5416e9b32fb41626cf3a8aa31b06df190003455ec829b352ef5e587c7"}],"concept.nist.haltingproblem":[{"id":"assertion.concept.nist.haltingproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines halting problem as: Is there an algorithm to determine whether any arbitrary program halts? Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although heuristic or partial solutions are possible.","support":[{"end":335,"quote":"Is there an\nalgorithm\nto determine whether any arbitrary program halts?  Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although\nheuristic\nor partial solutions are possible.","source_id":"nist-dads.haltingproblem","source_sha256":"8960aa888162b4a9428e3868ac8ffd0ad66eadce962ed62bab9b4dd76898b6f6","start":62}],"target_id":"concept.nist.haltingproblem","target_kind":"node","target_sha256":"0b4fa316e032a027d3df625cd4adc0d970e2f13718e07b505b82830f511c4164"}],"concept.nist.hamiltoniancycle":[{"id":"assertion.concept.nist.hamiltoniancycle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hamiltonian cycle as: A path through a graph that starts and ends at the same vertex and includes every other vertex exactly once. Also known as tour.","support":[{"end":189,"quote":"A\npath\nthrough a\ngraph\nthat starts and ends at the same\nvertex\nand includes every other vertex exactly once.\nAlso known as\ntour.","source_id":"nist-dads.hamiltoniancycle","source_sha256":"87631238cd86c40471ede50aadf8435fa8fd72bd0c3620d37d7395941d2679c9","start":61}],"target_id":"concept.nist.hamiltoniancycle","target_kind":"node","target_sha256":"b7b4a3040faea5ce8cc5153cbc914f4fdebaf8b4010b9fbadf8642d6454d34d7"}],"concept.nist.hamiltonianpath":[{"id":"assertion.concept.nist.hamiltonianpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hamiltonian path as: A simple path through a graph that includes every vertex in the graph.","support":[{"end":129,"quote":"A\nsimple path\nthrough a\ngraph\nthat includes every vertex in the graph.","source_id":"nist-dads.hamiltonianpath","source_sha256":"452f2fc95acb285ff925a92ac18e02f43733563a679d5e47b7a9391a43f5f3f8","start":59}],"target_id":"concept.nist.hamiltonianpath","target_kind":"node","target_sha256":"cec35f9f2af5981e2df939f04567a5ad6992d052f5ace165303c2d627a959e64"}],"concept.nist.hashbelt":[{"id":"assertion.concept.nist.hashbelt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hashbelt as: Use a short list or array of hash tables to implement a hash table with aging to expire items. To expire items, add a new table at the head of the list and drop the oldest table, along with its contents. To find an item, search all the tables.","support":[{"end":292,"quote":"Use a short\nlist\nor\narray\nof\nhash tables\nto implement a hash table with aging to expire items.  To expire items, add a new table at the\nhead\nof the list and drop the oldest table, along with its contents.  To find an item, search all the tables.","source_id":"nist-dads.hashbelt","source_sha256":"b1a9818c3ffec1fc875f15272280e5bf96969d00353844dd90f2c58059a08627","start":47}],"target_id":"concept.nist.hashbelt","target_kind":"node","target_sha256":"44d7e3bb6a38db7629675eb36ab0b098dcdfbbb158847c44b705760f753aa873"}],"concept.nist.hashheap":[{"id":"assertion.concept.nist.hashheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hash heap as: An efficient implementation of a priority queue . The linear hash function monotonically maps keys to buckets , and each bucket is a heap .","support":[{"end":189,"quote":"An efficient implementation of a\npriority queue\n.  The\nlinear hash\nfunction monotonically maps keys to\nbuckets\n, and each bucket is a\nheap\n.","source_id":"nist-dads.hashheap","source_sha256":"71cd9087e0bd5eabefccadd47ea0550b4f1b7cb2f9de4f57c0e00425a4420a69","start":49}],"target_id":"concept.nist.hashheap","target_kind":"node","target_sha256":"4a2fc1cd07fc7fbdaf0a2f0a41b13d9043e416090fef42a7b3fca08b6c2bb505"}],"concept.nist.hashtab":[{"id":"assertion.concept.nist.hashtab","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines hash table as: A dictionary in which keys are mapped to array positions by hash functions . Having the keys of more than one item map to the same position is called a collision . There are many collision resolution schemes , but they may be divided into open addressing , chaining , and keeping one special overflow area. Perfect hashing avoids collisions, but may be time-consuming to create. Also known as scatter storage.","support":[{"end":461,"quote":"A\ndictionary\nin which\nkeys\nare mapped to\narray\npositions by\nhash functions\n.  Having the\nkeys\nof more than one item map to the same position is called a\ncollision\n. There are many\ncollision resolution schemes\n, but they may be divided into\nopen addressing\n,\nchaining\n, and keeping one special overflow area.\nPerfect hashing\navoids collisions, but may be time-consuming to create.\nAlso known as\nscatter storage.","source_id":"nist-dads.hashtab","source_sha256":"6a3a65e426ae840cca0723d999fba31e3a24dabdb874a34e2f33a3412197dbd7","start":51}],"target_id":"concept.nist.hashtab","target_kind":"node","target_sha256":"1fc91d91a216db73b154a18a1ff2d1d8d8eeb0220b4d7c398a0a7801780bdecd"}],"concept.nist.hausdorffdst":[{"id":"assertion.concept.nist.hausdorffdst","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hausdorff distance as: A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max a∈ P min b∈ Q d(a,b), max a∈ Q min b∈ P d(a,b)} where d(·,·) is the distance metric, usually the Euclidean distance .","support":[{"end":284,"quote":"A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max\na∈ P\nmin\nb∈ Q\nd(a,b), max\na∈ Q\nmin\nb∈ P\nd(a,b)} where d(·,·) is the distance metric, usually the\nEuclidean distance\n.","source_id":"nist-dads.hausdorffdst","source_sha256":"ef12026c8fa115d7b4360832291cb29e84bc5b3c76a002b8f4fe534666dbfd0e","start":63}],"target_id":"concept.nist.hausdorffdst","target_kind":"node","target_sha256":"23d24ea961a817aa1c97e9daa22961363770cb9a0febb343e95e262eb445a217"}],"concept.nist.hbtree":[{"id":"assertion.concept.nist.hbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hB-tree as: A point access method which uses k-d trees to organize the space, but partitions as excluded intervals, like the BANG file . Searching is like in a k-d-B-tree .","support":[{"end":206,"quote":"A\npoint access method\nwhich uses\nk-d trees\nto organize the space, but partitions as excluded intervals, like the\nBANG file\n.  Searching is like in a\nk-d-B-tree\n.","source_id":"nist-dads.hbtree","source_sha256":"d19876a2b23782a66ce886161884be3206e64bf4848ee8d602a01de29a33b0d5","start":45}],"target_id":"concept.nist.hbtree","target_kind":"node","target_sha256":"50361ce73ad2366ff848a334f6916636ae30c0c607f64fcbad470f671168e5c9"}],"concept.nist.head":[{"id":"assertion.concept.nist.head","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines head as: The first item of a list .","support":[{"end":61,"quote":"The first item of a\nlist\n.","source_id":"nist-dads.head","source_sha256":"66bc07992ed31f8b3abc2696c2cdc366bf37e82bbf363ed193e0691e8f6c56cd","start":35}],"target_id":"concept.nist.head","target_kind":"node","target_sha256":"26e0db5a85920bed9d57751d94bf30bb6871e6e6a70c452772c42fae40fc037e"}],"concept.nist.heap":[{"id":"assertion.concept.nist.heap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines heap as: A complete tree where every node has a key more extreme (greater or less) than or equal to the key of its parent . Usually understood to be a binary heap .","support":[{"end":194,"quote":"A\ncomplete tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than or equal to the key of its\nparent\n. Usually understood to be a\nbinary heap\n.","source_id":"nist-dads.heap","source_sha256":"bd88f90f73f23ffcb2a38301fe9738ce58a84dd31f1dacb29438ccc62d953951","start":39}],"target_id":"concept.nist.heap","target_kind":"node","target_sha256":"64d24dd7801f67d76986e89499412bd1eec08cca9ad894ab800f1483afd4ceb6"}],"concept.nist.heapproperty":[{"id":"assertion.concept.nist.heapproperty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heap property as: Each node in a tree has a key which is more extreme (greater or less) than or equal to the key of its parent .","support":[{"end":163,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is more extreme (greater or less) than or equal to the key of its\nparent\n.","source_id":"nist-dads.heapproperty","source_sha256":"2b17e233642fa859356abf7ef364c6e389e549de2303b575fab44104e56d68c3","start":53}],"target_id":"concept.nist.heapproperty","target_kind":"node","target_sha256":"8b4e29ca54dd9b49f91de6aaa617615cdc93b7830fc884c8a367fbf1fb8099ee"}],"concept.nist.height":[{"id":"assertion.concept.nist.height","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height as: The maximum distance of any node from the root . If a tree has only one node (the root), the height is zero. The height of an empty tree is not defined.","support":[{"end":193,"quote":"The maximum distance of any\nnode\nfrom the\nroot\n. If a tree has only one node (the root), the height is zero.   The height of an empty tree is not defined.","source_id":"nist-dads.height","source_sha256":"c75850a5ebceaa3755e699fff0936c2612a1f6697a2290232d23438dc941387d","start":39}],"target_id":"concept.nist.height","target_kind":"node","target_sha256":"01a954a7a61391a11c8b342927923f553e9a233f57f8632a4e6ed77275315065"}],"concept.nist.heightbalancedbinsrchtree":[{"id":"assertion.concept.nist.heightbalancedbinsrchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height-balanced binary search tree as: A height-balanced tree which is also a binary search tree . It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree.","support":[{"end":268,"quote":"A\nheight-balanced tree\nwhich is also a\nbinary search tree\n. It supports membership, insert, and delete operations in time\nlogarithmic\nin the number of\nnodes\nin the tree.","source_id":"nist-dads.heightbalancedbinsrchtree","source_sha256":"318eecf4d1b6bc2cbf0d5038773e60d6a84018eb8c979780448709def2e0711e","start":99}],"target_id":"concept.nist.heightbalancedbinsrchtree","target_kind":"node","target_sha256":"36621ab927f88e28b553fb19036ae934514d6b785bbfef2a6a358762efcfabeb"}],"concept.nist.heightbalancedtree":[{"id":"assertion.concept.nist.heightbalancedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height-balanced tree as: A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced.","support":[{"end":207,"quote":"A tree whose\nsubtrees\ndiffer in\nheight\nby no more than one and the subtrees are height-balanced, too.  An empty tree is height-balanced.","source_id":"nist-dads.heightbalancedtree","source_sha256":"cf1c7dc85633c0b8609d6873742ad54d25944d4670c5e779b4873967563230c1","start":71}],"target_id":"concept.nist.heightbalancedtree","target_kind":"node","target_sha256":"91441616a9e0db9a5905ec7c742a8ea1b8923f7f8bf90e269c0f8e85fdeb98a7"}],"concept.nist.homeomorphic":[{"id":"assertion.concept.nist.homeomorphic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines homeomorphic as: Two graphs are homeomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges .","support":[{"end":160,"quote":"Two\ngraphs\nare homeomorphic if they can be made\nisomorphic\nby inserting new\nvertices\nof\ndegree\n2 into\nedges\n.","source_id":"nist-dads.homeomorphic","source_sha256":"83bb0591a12592193d6cdba97f1f0801d4cbf262e08c2cc15167c3d93c7405de","start":51}],"target_id":"concept.nist.homeomorphic","target_kind":"node","target_sha256":"1ac0a2fde679ea1b6b76792cd1b097bb2974cae607caddb0afc7351a87bc5566"}],"concept.nist.horizontalvismap":[{"id":"assertion.concept.nist.horizontalvismap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines horizontal visibility map as: A partition of the plane into regions by drawing a horizontal straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be horizontally visible from p.","support":[{"end":328,"quote":"A partition of the plane into regions by drawing a horizontal straight line through each\nvertex\np of a planar straight-line\ngraph\nuntil it intersects an\nedge\ne of the graph or extends to infinity.  The edge e is said to be horizontally visible from p.","source_id":"nist-dads.horizontalvismap","source_sha256":"d73e2cd208d5a341f04b09e8dbc232c7af5671a2f1d8b79e01d2760cd3df7f94","start":77}],"target_id":"concept.nist.horizontalvismap","target_kind":"node","target_sha256":"897fc3b43d924dabdbdffc417ea7209abd4310a8964db0cd30525e598c516f4b"}],"concept.nist.hybridalgorithm":[{"id":"assertion.concept.nist.hybridalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hybrid algorithm as: Any algorithm composed of simpler algorithms.","support":[{"end":104,"quote":"Any algorithm composed of simpler algorithms.","source_id":"nist-dads.hybridalgorithm","source_sha256":"50b7111621dcdb6818368378359e96cba3a20851ab0ca48ccb3d1c564a092370","start":59}],"target_id":"concept.nist.hybridalgorithm","target_kind":"node","target_sha256":"2149d20c12d911abab2f2811173fb33b17a3eecff33513c0272bbea9092f57f9"}],"concept.nist.hyperedge":[{"id":"assertion.concept.nist.hyperedge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hyperedge as: A connection between any number of vertices of a hypergraph . Formal Definition: A hyperedge is a set of vertices of a hypergraph.","support":[{"end":175,"quote":"A connection between any number of\nvertices\nof a\nhypergraph\n.\nFormal Definition:\nA hyperedge is a\nset\nof vertices of a hypergraph.","source_id":"nist-dads.hyperedge","source_sha256":"a2f70c7e140e555b748e0355cb56a72f2ec44bcd0f3720280d61f836e74f4b78","start":45}],"target_id":"concept.nist.hyperedge","target_kind":"node","target_sha256":"054608f23fff0da2a28cddf8d0c89f3b4af3d9caaa7554fefeeaaa15acaa10de"}],"concept.nist.implication":[{"id":"assertion.concept.nist.implication","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines implication as: The boolean implies function.","support":[{"end":78,"quote":"The boolean\nimplies\nfunction.","source_id":"nist-dads.implication","source_sha256":"0131ef5caee89fc51e9c4cb896c68a47982639330fc08e6a5503c28fb7e55558","start":49}],"target_id":"concept.nist.implication","target_kind":"node","target_sha256":"b7d6baf52469d686542c2956d890c340690c6cc02de14cc6e5436731f6a52ae6"}],"concept.nist.implies":[{"id":"assertion.concept.nist.implies","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines implies as: Implication: 0 → 0 = 1, 0 → 1 = 1, 1 → 0 = 0, 1 → 1 = 1.","support":[{"end":98,"quote":"Implication: 0 → 0 = 1, 0 → 1 = 1,  1 → 0 = 0, 1 → 1 = 1.","source_id":"nist-dads.implies","source_sha256":"da343c2e9d2e472a3ecfb67c4e66983e1c2b03080cd79d1147b3d006dd6f8fde","start":41}],"target_id":"concept.nist.implies","target_kind":"node","target_sha256":"fcc02af0b7e317bac7a0b839ccb58579aa13fd4cc0e978757f9abe2fac7188e0"}],"concept.nist.incompressbl":[{"id":"assertion.concept.nist.incompressbl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines incompressible string as: A string whose Kolmogorov complexity equals its length, so that it has no shorter encodings.","support":[{"end":161,"quote":"A\nstring\nwhose\nKolmogorov complexity\nequals its length, so that it has no shorter encodings.","source_id":"nist-dads.incompressbl","source_sha256":"3610cfe43bd93d28169f97d08e5d189742acf18947e6b2b15426e8233d8813b3","start":69}],"target_id":"concept.nist.incompressbl","target_kind":"node","target_sha256":"f2d293c75e74ddc83a7b5090e3ec42fed676299235c04e063d981b44398be0fa"}],"concept.nist.indegree":[{"id":"assertion.concept.nist.indegree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines in-degree as: The number of edges coming into a vertex in a directed graph .","support":[{"end":107,"quote":"The number of\nedges\ncoming into a\nvertex\nin a\ndirected graph\n.","source_id":"nist-dads.indegree","source_sha256":"6213b3b13345c9e70095c0d7ceefc4a67d7a6fcec5649d27ea499d4fdd5ed5f2","start":45}],"target_id":"concept.nist.indegree","target_kind":"node","target_sha256":"f0fef4277f3ca30d061c868c760818b4aa127acdc791a477ea11b77479783482"}],"concept.nist.independentset":[{"id":"assertion.concept.nist.independentset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them.","support":[{"end":152,"quote":"A set of\nvertices\nin a\ngraph\nsuch that for any pair of vertices, there is no\nedge\nbetween them.","source_id":"nist-dads.independentset","source_sha256":"d587d6b19cb682ff575cbb13626501598891fb0c1bfd1a8eda6dcef380fc0945","start":57}],"target_id":"concept.nist.independentset","target_kind":"node","target_sha256":"c0fa16db6bbb95ce2d55cfec00b46f3b00792cbdb9b2c20c316dba98fcedddd0"}],"concept.nist.indexfile":[{"id":"assertion.concept.nist.indexfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines index file as: A file which stores keys and an index into another file. The index file may have additional structure, e.g., be a B-tree .","support":[{"end":174,"quote":"A file which stores\nkeys\nand an index into another file.  The index file may have additional structure, e.g., be a\nB-tree\n.","source_id":"nist-dads.indexfile","source_sha256":"687f16570728444f79a0e37195ee1ac439f81d321118b7af27821d26090ba230","start":51}],"target_id":"concept.nist.indexfile","target_kind":"node","target_sha256":"09d56325e16e725a45769965a65bf0b608d51cf40f09dd238186877ccd78dccd"}],"concept.nist.information":[{"id":"assertion.concept.nist.information","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines information theoretic bound as: lower bounds on the execution of a computation based on the rate at which information can be accumulated.","support":[{"end":186,"quote":"lower bounds\non the execution of a computation based on the rate at which information can be accumulated.","source_id":"nist-dads.information","source_sha256":"ebdde44572bc6b7272d6fe7d6f175d37dc2c9ebb2ed9408937ff1d89fb4925cf","start":81}],"target_id":"concept.nist.information","target_kind":"node","target_sha256":"7d787f97d0693117b8116763d573b44b6d0eb5c5376455c298bfeac3d758ab6b"}],"concept.nist.integer":[{"id":"assertion.concept.nist.integer","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer polyhedron as: A polyhedron , all of whose extreme points are integer valued.","support":[{"end":125,"quote":"A\npolyhedron\n, all of whose\nextreme points\nare integer valued.","source_id":"nist-dads.integer","source_sha256":"c51b61e271028e2b1e72d9cfc99dfe06143f346f4e5aed6bd5058d0d7bd2a684","start":63}],"target_id":"concept.nist.integer","target_kind":"node","target_sha256":"00b9b9a073379f6e702c7d6248f274980d4b1bbda765824bb3b4dff09e67e1fd"}],"concept.nist.integerliner":[{"id":"assertion.concept.nist.integerliner","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer linear program as: A linear program with additional constraints that all of the variables must take on integer values. Solving such problems is NP-hard .","support":[{"end":206,"quote":"A\nlinear program\nwith additional constraints that all of the variables must take on integer values.  Solving such problems is\nNP-hard\n.","source_id":"nist-dads.integerliner","source_sha256":"9762357649d2a5de611cd375493a36f27e5a34a1a694191926818b351ee9f47d","start":71}],"target_id":"concept.nist.integerliner","target_kind":"node","target_sha256":"a6dd83e499e11b2014c1469c69cc1984d1431db7b727f0ad46451849ff43e651"}],"concept.nist.integermulti":[{"id":"assertion.concept.nist.integermulti","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer multi-commodity flow as: A multi-commodity flow in which the flow of each commodity through each edge must take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","support":[{"end":305,"quote":"A\nmulti-commodity flow\nin which the flow of each commodity through each\nedge\nmust take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","source_id":"nist-dads.integermulti","source_sha256":"ec2ec5ac599d43335170fafca6f5b8d1b31cd832cda866639f39e7c9971b46e3","start":83}],"target_id":"concept.nist.integermulti","target_kind":"node","target_sha256":"a556c276dbda2cf37f684a799658c4d523c574856cd8e9378c0c830c1e6d71b1"}],"concept.nist.interactvprf":[{"id":"assertion.concept.nist.interactvprf","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interactive proof system as: A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a string x in a given language , often with the goal of revealing no further details about this knowledge. The prover(s) and verifier are formally defined as probabilistic Turing machines with special \"interaction tapes\" for exchanging messages.","support":[{"end":490,"quote":"A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a\nstring\nx in a given\nlanguage\n, often with the goal of revealing no further details about this knowledge.  The prover(s) and verifier are formally defined as\nprobabilistic Turing machines\nwith special \"interaction tapes\" for exchanging messages.","source_id":"nist-dads.interactvprf","source_sha256":"2d07c67b893fdab5196f674ad3597e8df4ac9dc90db5df628efe314b179ae258","start":75}],"target_id":"concept.nist.interactvprf","target_kind":"node","target_sha256":"f6b4fdd64d82d8bf2b5b3192107e921fdfddca00f7d53da339a26cd719e4ade6"}],"concept.nist.interiorbasd":[{"id":"assertion.concept.nist.interiorbasd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interior-based representation as: A representation of a region that is based on its interior (i.e., the cells that compose it).","support":[{"end":178,"quote":"A representation of a region that is based on its interior (i.e., the cells that compose it).","source_id":"nist-dads.interiorbasd","source_sha256":"6fa92fd15a554a0ca69d3c6c94a5578ebd5c2d155e894f606e66a9306e341e05","start":85}],"target_id":"concept.nist.interiorbasd","target_kind":"node","target_sha256":"3fe1a22a0a515b4862b3e29160302e61a47cf6d04c22424121d4ebef986418f2"}],"concept.nist.internalnode":[{"id":"assertion.concept.nist.internalnode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines internal node as: A node of a tree that has one or more child nodes, equivalently, one that is not a leaf . Also known as nonterminal node.","support":[{"end":174,"quote":"A\nnode\nof a\ntree\nthat has one or more\nchild\nnodes, equivalently, one that is not a\nleaf\n.\nAlso known as\nnonterminal node.","source_id":"nist-dads.internalnode","source_sha256":"77f0e44aff1294485cf1cffe0c80bd5ce56d8ec302d4d10a343a651d6f1d10fe","start":53}],"target_id":"concept.nist.internalnode","target_kind":"node","target_sha256":"6e4d01b7c8f75c843334c4cfb008853c51bf73cc8a3ea480e1cf485cf568ce22"}],"concept.nist.internalsort":[{"id":"assertion.concept.nist.internalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines internal sort as: Any sort algorithm which uses exclusively main memory during the sort. This assumes high-speed random access to all memory.","support":[{"end":177,"quote":"Any\nsort\nalgorithm which uses exclusively main memory during the sort.  This assumes high-speed random access to all memory.","source_id":"nist-dads.internalsort","source_sha256":"48eebcc0960aef2fd48cdf9b24fd2897e6b3113f79c35ed16c777bc6af4a69b5","start":53}],"target_id":"concept.nist.internalsort","target_kind":"node","target_sha256":"2378efd757733eaf8225b3db8f83d933adb56a5eb394488df48d3386e5adb055"}],"concept.nist.intersection":[{"id":"assertion.concept.nist.intersection","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines intersection as: The intersection of two sets is a set having those members which are in both sets.","support":[{"end":133,"quote":"The intersection of two\nsets\nis a set having those members which are in both sets.","source_id":"nist-dads.intersection","source_sha256":"092bbd4fe8fb244c2f3f3ae5505936719b4b28a225f1e906b4dda2998c5453da","start":51}],"target_id":"concept.nist.intersection","target_kind":"node","target_sha256":"662bec65257a7c4d228ff07a441b42419dc471a1d23b940e9e3b2bde68176c0c"}],"concept.nist.intractable":[{"id":"assertion.concept.nist.intractable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines intractable as: A problem for which no algorithm can exist which computes all instances of it in polynomial time .","support":[{"end":147,"quote":"A problem for which no\nalgorithm\ncan exist which computes all instances of it in\npolynomial time\n.","source_id":"nist-dads.intractable","source_sha256":"5d05c6dcff3e8ca3c9e658abe3750d5da4ef94fc39f765795001f0b886980f27","start":49}],"target_id":"concept.nist.intractable","target_kind":"node","target_sha256":"91511c7429eaa81ac2c810c9e5d2a2c376b85fa11d720dc5f086258f4eae6d9b"}],"concept.nist.inversesuffixarray":[{"id":"assertion.concept.nist.inversesuffixarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverse suffix array as: For each position in a string , the inverse suffix array has its index in the string's suffix array . Formal Definition: Given a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","support":[{"end":292,"quote":"For each position in a\nstring\n, the inverse suffix\narray\nhas its index in the string's\nsuffix array\n.\nFormal Definition:\nGiven a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","source_id":"nist-dads.inversesuffixarray","source_sha256":"1f5ab927596211085192ff45931f6d1202108dd06fa0dca7b34024dfed809487","start":71}],"target_id":"concept.nist.inversesuffixarray","target_kind":"node","target_sha256":"0cb2cd68b6d3c70810423a61070eca4fef760071b0c44ebcccad5f3ea12eeb2c"}],"concept.nist.inversionlist":[{"id":"assertion.concept.nist.inversionlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inversion list as: A set of non-overlapping numeric ranges, stored in an array in increasing order. Items in odd indexes begin ranges, and items in even indexes are the first number after the ends. Use a form of binary search to determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set. If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","support":[{"end":492,"quote":"A set of non-overlapping numeric ranges, stored in an\narray\nin increasing order.  Items in odd indexes begin ranges, and items in even indexes are the first number after the ends.\nUse a form of\nbinary search\nto determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set.  If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","source_id":"nist-dads.inversionlist","source_sha256":"90eeb438de29784c600016e7176de8001b00ea84224e01c8dca6c67ec5353d2f","start":59}],"target_id":"concept.nist.inversionlist","target_kind":"node","target_sha256":"8059044f54bae3e87626bca2a148961a64b577aaa4e6f57fdcc041e9d0181eb7"}],"concept.nist.invertedfileindex":[{"id":"assertion.concept.nist.invertedfileindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverted file index as: An inverted index that only indicates the text in which a word appears, not where the word appears within the text.","support":[{"end":184,"quote":"An\ninverted index\nthat only indicates the text in which a word appears, not where the word appears within the text.","source_id":"nist-dads.invertedfileindex","source_sha256":"bf076b12a71d9c58e58e77d2d8cc3c6754410b20ae296aa3a6418367dbab406e","start":69}],"target_id":"concept.nist.invertedfileindex","target_kind":"node","target_sha256":"e167f232532b5e233588b25e929783f410c2125fa26f9e85db3146e03442dd8c"}],"concept.nist.invertedindex":[{"id":"assertion.concept.nist.invertedindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverted index as: An index into a set of texts of the words in the texts. The index is accessed by some search method. Each index entry gives the word and a list of texts, possibly with locations within the text, where the word occurs.","support":[{"end":278,"quote":"An index into a set of\ntexts\nof the words in the texts. The index is accessed by some\nsearch\nmethod. Each index entry gives the  word and a list of texts, possibly with locations  within the text, where the word occurs.","source_id":"nist-dads.invertedindex","source_sha256":"31afd704ce6ca2ab9438a36ae29a5aae2ab9797eaf44326d46caad1bd147603d","start":59}],"target_id":"concept.nist.invertedindex","target_kind":"node","target_sha256":"add14d8c23443731f623a1b33552e8e4c05405068e1d212d0766d21aedc04d1a"}],"concept.nist.invertiblebloomtable":[{"id":"assertion.concept.nist.invertiblebloomtable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines invertible Bloom lookup table as: Algorithms and an array of cells to store key/value pairs. Each cell has a count of how many pairs are mapped to the cell, the sum of the keys mapped to it, and the sum of the values mapped to it. Using k hash functions , each pair is mapped to T[h 1 (k)], T[h 2 (k)], ..., T[h k (k)]. Also known as IBLT.","support":[{"end":395,"quote":"Algorithms and an\narray\nof cells to store key/value pairs. Each cell has a\ncount\nof how many pairs are mapped to the cell, the\nsum\nof the keys mapped to it, and the\nsum\nof the values mapped to it.  Using k\nhash functions\n, each pair is mapped to T[h\n1\n(k)], T[h\n2\n(k)], ..., T[h\nk\n(k)].\nAlso known as\nIBLT.","source_id":"nist-dads.invertiblebloomtable","source_sha256":"4ad8d0d60d1f8524725bda8d60e5ea2777198fbd896a6fae39250ae70d06e5ea","start":89}],"target_id":"concept.nist.invertiblebloomtable","target_kind":"node","target_sha256":"211b9a3f897d968e68787c87450e5953b96acb3f501a51b3acaed72eef57943a"}],"concept.nist.irreflexive":[{"id":"assertion.concept.nist.irreflexive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines irreflexive as: A binary relation R for which there is no element a such that a R a.","support":[{"end":117,"quote":"A\nbinary relation\nR for which there is no element a such that a R a.","source_id":"nist-dads.irreflexive","source_sha256":"418007841f2ffa035280181b8bfe3389361eee70824a46f86330f9742db0e75c","start":49}],"target_id":"concept.nist.irreflexive","target_kind":"node","target_sha256":"5f9d04ee2c19e26429503addef6f8710d41eb01c4494a2127cad51473edb0afe"}],"concept.nist.isomorphic":[{"id":"assertion.concept.nist.isomorphic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines isomorphic as: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","support":[{"end":282,"quote":"Two\ngraphs\nare isomorphic if there  is a one-to-one correspondence between their\nvertices\nand there is an\nedge\nbetween two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","source_id":"nist-dads.isomorphic","source_sha256":"f3108939851e89497877471084ce06ec1c4f4f646c239c35797034325a035081","start":47}],"target_id":"concept.nist.isomorphic","target_kind":"node","target_sha256":"5af75bdb691ffbcf33aba60082b67a276eea41a5601299c18fc2b78a57781c1c"}],"concept.nist.jellyfish":[{"id":"assertion.concept.nist.jellyfish","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines jelly-fish as: A theoretical data structure for n items. It starts with a balanced binary search tree of about √(n) nodes. The leaf nodes lead to \"tentacles\" or linked lists , each of about √(n) nodes.","support":[{"end":241,"quote":"A theoretical data structure for n items. It starts with a\nbalanced binary search tree\nof about  √(n) nodes.   The\nleaf\nnodes lead to \"tentacles\" or\nlinked lists\n, each of about  √(n) nodes.","source_id":"nist-dads.jellyfish","source_sha256":"26d10bef7e1e6692bf57ceebad87595022ab02f35086136fc9fc8469e680d4ee","start":51}],"target_id":"concept.nist.jellyfish","target_kind":"node","target_sha256":"3bd995133c2c8e7ba4cf8d1251103a031d9597a7a2ecf39f8218597d16497731"}],"concept.nist.k2tree":[{"id":"assertion.concept.nist.k2tree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k²-tree as: A compact representation of a sparse directed graph . It requires 1 to 3 bits per edge. Many access functions, like successor(s), predecessor(s), and range (all links from a range of vertices to another range of vertices), have very efficient implementations.","support":[{"end":306,"quote":"A\ncompact\nrepresentation of a sparse\ndirected graph\n.  It requires 1 to 3\nbits\nper edge.  Many access functions, like successor(s), predecessor(s), and range (all links from a range of\nvertices\nto another range of vertices), have very efficient implementations.","source_id":"nist-dads.k2tree","source_sha256":"2901ab587c77c9c4085222ece8193cadfe5f75bbc8a17936e0d6bf3ad79156d0","start":45}],"target_id":"concept.nist.k2tree","target_kind":"node","target_sha256":"bf63c1755c026a3fd0c614ddb19a5189cd2d6b3e8c5a0fb66cafcb50d99fa433"}],"concept.nist.karpreductin":[{"id":"assertion.concept.nist.karpreductin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karp reduction as: A reduction given by a polynomial time computable transformation function.","support":[{"end":129,"quote":"A\nreduction\ngiven by a\npolynomial\ntime\ncomputable\ntransformation function.","source_id":"nist-dads.karpreductin","source_sha256":"437a5b62760959fbbac5130d0d420630ecbd4951a95ffae152250ca594c38c7f","start":55}],"target_id":"concept.nist.karpreductin","target_kind":"node","target_sha256":"42f5a880c7ce65ea04354d8cac31a8c115d5bdef85a761c19193853a8a622b3d"}],"concept.nist.karyheap":[{"id":"assertion.concept.nist.karyheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary heap as: A complete tree where every node has a key more extreme (greater or less) than the key of its parent . Each node has k or fewer children .","support":[{"end":190,"quote":"A\ncomplete tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than the key of its\nparent\n.  Each node has\nk\nor fewer\nchildren\n.","source_id":"nist-dads.karyheap","source_sha256":"5acc68a36c5b657cf9926f936e4424102ad5ebb026aa21877cdf27d8d54608c8","start":51}],"target_id":"concept.nist.karyheap","target_kind":"node","target_sha256":"0a9b6b468e62a709e4d8fefd6a334c5a1d5cc02b8f8bea52677395988627a21b"}],"concept.nist.karytree":[{"id":"assertion.concept.nist.karytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary tree as: A tree with no more than k children for each node . Also known as k-way tree.","support":[{"end":128,"quote":"A\ntree\nwith no more than\nk\nchildren\nfor each\nnode\n.\nAlso known as\nk-way tree.","source_id":"nist-dads.karytree","source_sha256":"2badcdefad6943df46f3e1d7205941a7f3a651f195a9071e059debcc7e266ba3","start":51}],"target_id":"concept.nist.karytree","target_kind":"node","target_sha256":"e5078a6e0940336f835276851f17ef9f411528bfd888354d0bc3faf615bd0574"}],"concept.nist.kcoloring":[{"id":"assertion.concept.nist.kcoloring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-coloring as: 1) The assignment of k colors (or any distinct marks) to the vertices of a graph . 2) The assignment of k colors to the edges of a graph . A coloring is a proper coloring if no two adjacent vertices or edges have the same color.","support":[{"end":275,"quote":"1) The assignment of\nk\ncolors (or any distinct marks) to the\nvertices\nof a\ngraph\n. 2) The assignment of\nk\ncolors to the\nedges\nof a\ngraph\n.\nA coloring is a\nproper coloring\nif no two\nadjacent\nvertices or edges have the same color.","source_id":"nist-dads.kcoloring","source_sha256":"1dd56a98a9589d69a25659dc87d7b05c14f04131d04e51a52d4d0131cf882db6","start":47}],"target_id":"concept.nist.kcoloring","target_kind":"node","target_sha256":"b3618b23713313be50ba62b376e0db429c44cd363ebb28a51d61d8462d8b360c"}],"concept.nist.kconnectedgraph":[{"id":"assertion.concept.nist.kconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-connected graph as: A connected graph such that deleting any k-1 vertices (and incident edges ) results in a graph that is still connected.","support":[{"end":180,"quote":"A\nconnected graph\nsuch that deleting any k-1\nvertices\n(and incident\nedges\n) results in a graph that is still connected.","source_id":"nist-dads.kconnectedgraph","source_sha256":"202e109e77d8b5e3c339df2711ce74915ed59c33fd1b57c663285220d8091e8d","start":61}],"target_id":"concept.nist.kconnectedgraph","target_kind":"node","target_sha256":"93c39dc170dc764abc581ae1ffec0be654aadba936edbee9fa607d95d8f747ce"}],"concept.nist.kdbtree":[{"id":"assertion.concept.nist.kdbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-d-B-tree as: A data structure which splits multidimensional spaces like an adaptive k-d tree , but balances the resulting tree like a B-tree .","support":[{"end":180,"quote":"A data structure which splits multidimensional spaces like an\nadaptive k-d tree\n, but balances the resulting tree like a\nB-tree\n.","source_id":"nist-dads.kdbtree","source_sha256":"a2428745d3482fa1221204d707693d03605aa7e1c1aee31b56b122395fa2eb76","start":51}],"target_id":"concept.nist.kdbtree","target_kind":"node","target_sha256":"86c5ae1836f9fb462f7f0031b781d585e577c4bc3ab71bcbcd1eefcbceb48474"}],"concept.nist.kdimensional":[{"id":"assertion.concept.nist.kdimensional","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-dimensional as: (1) Dealing with or restricted to a space where location can be completely described with exactly k orthogonal axes. (2) Dealing with a space of any number of dimensions.","support":[{"end":224,"quote":"(1) Dealing with or restricted to a space where location can be completely described with exactly\nk\northogonal axes.  (2) Dealing with a space of any number of dimensions.","source_id":"nist-dads.kdimensional","source_sha256":"ff41724b62c86c01067d255dba4c67e67b41b9bedcf228dab1015c763c36bf11","start":53}],"target_id":"concept.nist.kdimensional","target_kind":"node","target_sha256":"3623ec53a03551345d2e397456e1503ae7c41c324c89a5ebcd2637481bb092ef"}],"concept.nist.kdominant":[{"id":"assertion.concept.nist.kdominant","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines K-dominant match as: A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","support":[{"end":179,"quote":"A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","source_id":"nist-dads.kdominant","source_sha256":"e03e41166eae50188c9e91f40f2d3c1f187cd4de346aad777e06a684afc31394","start":59}],"target_id":"concept.nist.kdominant","target_kind":"node","target_sha256":"3347d9205c41203a9e89b314db24f6067e3151050debacf8c927c3f127ee9fba"}],"concept.nist.kdtree":[{"id":"assertion.concept.nist.kdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-d tree as: A multidimensional search tree for points in k dimensional space. Levels of the tree are split along successive dimensions at the points.","support":[{"end":185,"quote":"A multidimensional\nsearch tree\nfor points in k dimensional space.  Levels of the tree are split along successive dimensions at the points.","source_id":"nist-dads.kdtree","source_sha256":"ada3b981b8e57ddd9bb010e657fac2f862355fd201d78cba853ff0c3faed0cf4","start":47}],"target_id":"concept.nist.kdtree","target_kind":"node","target_sha256":"de9a36dc57d31fc94b9cd4a6fa18e70548f7fde73ab71c9c1b740b619019506b"}],"concept.nist.key":[{"id":"assertion.concept.nist.key","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines key as: The part of a group of data by which it is sorted, indexed, cross referenced, etc.","support":[{"end":115,"quote":"The part of a group of data by which it is sorted, indexed, cross referenced, etc.","source_id":"nist-dads.key","source_sha256":"a446b2814201c57c89e6fe10d6c8476ae89923d68d20e096056831b2ebe8107d","start":33}],"target_id":"concept.nist.key","target_kind":"node","target_sha256":"f798d783539eb985688e45abd48f60774ed73533d72c514a260016fadbcc9fa4"}],"concept.nist.knightstour":[{"id":"assertion.concept.nist.knightstour","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines knight's tour as: A series of moves of a chess knight that visits all squares on the board exactly once.","support":[{"end":144,"quote":"A series of moves of a chess knight that visits all squares on the board exactly once.","source_id":"nist-dads.knightstour","source_sha256":"83fc994e66fc93ec09db078888c645fd00ceff0344aa1378f870654bde685ca2","start":58}],"target_id":"concept.nist.knightstour","target_kind":"node","target_sha256":"5d325c9a9dfcf47ed141ab36e59cf275d35e8287efffc744c841a67a9c6e2f8f"}],"concept.nist.kolmogorov":[{"id":"assertion.concept.nist.kolmogorov","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Kolmogorov complexity as: The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine .","support":[{"end":277,"quote":"The minimum number of bits into which a\nstring\ncan be compressed without losing information.  This is defined with respect to a fixed, but universal decompression scheme, given by a\nuniversal Turing machine\n.","source_id":"nist-dads.kolmogorov","source_sha256":"5bf22ea54dda192517a786d0a180eb7c7f2eccb467cb38530b32f2ed57f73406","start":69}],"target_id":"concept.nist.kolmogorov","target_kind":"node","target_sha256":"5caaab7f6439e54eadfa3311041e7671d0760090e1e11998063658681a22141c"}],"concept.nist.kripkestruct":[{"id":"assertion.concept.nist.kripkestruct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Kripke structure as: A nondeterministic finite state machine whose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","support":[{"end":249,"quote":"A\nnondeterministic finite state machine\nwhose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","source_id":"nist-dads.kripkestruct","source_sha256":"ef65992a4fc5ca0053025f2d3e0432073dd4245cd50dca250d4992114ba21752","start":59}],"target_id":"concept.nist.kripkestruct","target_kind":"node","target_sha256":"f84c151a0d6699c3e86ae7a2b39e191a10b75c3a79491a0af3c2fc4cb2c1e6b5"}],"concept.nist.kwaymerge":[{"id":"assertion.concept.nist.kwaymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-way merge as: Combine k sorted data streams into a single sorted stream.","support":[{"end":107,"quote":"Combine\nk\nsorted data streams into a single sorted stream.","source_id":"nist-dads.kwaymerge","source_sha256":"eaedaaf3211de7d8228bd544e3850adb48375d87bdcc244f9896cfaf720f4cab","start":49}],"target_id":"concept.nist.kwaymerge","target_kind":"node","target_sha256":"bb6633f3b7df5010b08383c70e7cb670131839045c846942e687781fe64036c2"}],"concept.nist.labeledgraph":[{"id":"assertion.concept.nist.labeledgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines labeled graph as: A graph which has labels associated with each edge or each vertex .","support":[{"end":120,"quote":"A\ngraph\nwhich has labels associated with each\nedge\nor each\nvertex\n.","source_id":"nist-dads.labeledgraph","source_sha256":"90ced6154c2edeb17ee24d17cb773a41fa17c0dfb66b18930c8b67e612096230","start":53}],"target_id":"concept.nist.labeledgraph","target_kind":"node","target_sha256":"d02df349ed05c915dcf0fc9378071ad02257d12d1ab16461420a40089e4e9800"}],"concept.nist.language":[{"id":"assertion.concept.nist.language","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines language as: A set of strings over some fixed alphabet . A characterization of inputs which may or may not be solved by algorithms . Also known as formal language.","support":[{"end":194,"quote":"A set of strings over some fixed\nalphabet\n.  A characterization of inputs which may or may not be solved by\nalgorithms\n.\nAlso known as\nformal language.","source_id":"nist-dads.language","source_sha256":"bf01ffacc6e4ab42805439d355856778070785fbb689833228425da231fff32f","start":43}],"target_id":"concept.nist.language","target_kind":"node","target_sha256":"10e332299fbc45dbca580eae6c8024daf70d4a6f7d3cd1d06d96ef9932f7d78c"}],"concept.nist.lastfirstout":[{"id":"assertion.concept.nist.lastfirstout","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines last-in, first-out as: A policy that the most recently arrived item is processed first. A stack implements this.","support":[{"end":152,"quote":"A policy that the most recently arrived item is processed first. A\nstack\nimplements this.","source_id":"nist-dads.lastfirstout","source_sha256":"9f2bc3ba221c51c46168cdf323e8d4837f50039a787ef7fc0e0111b85034d536","start":63}],"target_id":"concept.nist.lastfirstout","target_kind":"node","target_sha256":"00a9cf3c428b59368bf81985d18959ea0811445d01250b62a54ade4b107cf7a0"}],"concept.nist.lattice":[{"id":"assertion.concept.nist.lattice","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lattice as: A point lattice generated by taking integer linear combinations of a set of basis vectors.","support":[{"end":131,"quote":"A point lattice generated by taking integer linear combinations of a set of basis vectors.","source_id":"nist-dads.lattice","source_sha256":"6009c2abf6fe3e186d7077dd6fc83dd79e4f4b16d8b99bacf6c53f7b99aacb21","start":41}],"target_id":"concept.nist.lattice","target_kind":"node","target_sha256":"2f25ef64000442d639f0bbeeeaa0dee062199488ac841c187824e978364d4c88"}],"concept.nist.lcs":[{"id":"assertion.concept.nist.lcs","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines LCS as: Either longest common subsequence or longest common substring .","support":[{"end":101,"quote":"Either\nlongest common subsequence\nor\nlongest common substring\n.","source_id":"nist-dads.lcs","source_sha256":"7cc885115d0bb173ee21910ba28c277767b366c87b02ddc63012eb5923151069","start":38}],"target_id":"concept.nist.lcs","target_kind":"node","target_sha256":"7634a85a47c6e479ae8bce0ef97eb4097ce81e3d2644b15997f554a9d83eee33"}],"concept.nist.leaf":[{"id":"assertion.concept.nist.leaf","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines leaf as: A node in a tree without any children . See the figure at tree . Also known as external node, terminal node.","support":[{"end":143,"quote":"A\nnode\nin a\ntree\nwithout any\nchildren\n. See the figure at\ntree\n.\nAlso known as\nexternal node, terminal node.","source_id":"nist-dads.leaf","source_sha256":"7074960a1f02dbbfc15da6304c262cfb74dfccada52497e88ae3bcc9023d0297","start":35}],"target_id":"concept.nist.leaf","target_kind":"node","target_sha256":"efc0a7cd4ff74bf482ecf396a358f6df84a6939dd39afffa63dd30f98f55b1f5"}],"concept.nist.leastcommonmultiple":[{"id":"assertion.concept.nist.leastcommonmultiple","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines least common multiple as: The least integer which is a multiple of given integers. For instance, LCM(6, 10) = 30. Also known as LCM.","support":[{"end":176,"quote":"The least integer which is a multiple of given integers.  For instance, LCM(6, 10) = 30.\nAlso known as\nLCM.","source_id":"nist-dads.leastcommonmultiple","source_sha256":"aec2185bd2727868ee7ccbf9886fb433fa7d2c0fc2cd3ef1aa410ab54b17f92e","start":69}],"target_id":"concept.nist.leastcommonmultiple","target_kind":"node","target_sha256":"1e048cb55705d01b8a90beac3aa1754019049ad6198b907af9f25965c228bb68"}],"concept.nist.leftisttree":[{"id":"assertion.concept.nist.leftisttree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines leftist tree as: A priority queue implemented with a variant of a binary tree . Every node has a count which is the distance to the nearest leaf . In addition to the heap property , leftist trees are kept so the right descendant of each node has the shorter distance to a leaf.","support":[{"end":317,"quote":"A\npriority queue\nimplemented with a variant of a\nbinary tree\n.  Every\nnode\nhas a count which is the distance to the nearest\nleaf\n.  In addition to the\nheap property\n, leftist trees are kept so the right\ndescendant\nof each node has the shorter distance to a leaf.","source_id":"nist-dads.leftisttree","source_sha256":"45bb2d286eafdf4578dc94c5445c0c112564fc7b5193f4568f82af8f64609ae0","start":55}],"target_id":"concept.nist.leftisttree","target_kind":"node","target_sha256":"64b891262b7798e5f7bc09a7d36be85e70d29182bc2e584fa6b547a51874b14f"}],"concept.nist.letteromega":[{"id":"assertion.concept.nist.letteromega","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines omega as: The Greek letter written as ω (see ω(n) ) or Ω (see Ω(n) ).","support":[{"end":97,"quote":"The Greek letter written as  ω (see\nω(n)\n) or Ω (see\nΩ(n)\n).","source_id":"nist-dads.letteromega","source_sha256":"e21ee7b65cacce68020a87e27fc598dbcc908408ffa082b5fcdd20c1b10f166f","start":37}],"target_id":"concept.nist.letteromega","target_kind":"node","target_sha256":"cce67be8c2d115ae7f8855a66474292075bf9c5526389815836360f375ed1242"}],"concept.nist.level":[{"id":"assertion.concept.nist.level","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines level as: (1) All the nodes of a tree with the same depth . (2) Of a node, the depth.","support":[{"end":112,"quote":"(1) All the\nnodes\nof a\ntree\nwith the same\ndepth\n. (2) Of a node, the depth.","source_id":"nist-dads.level","source_sha256":"a6109abe0dcc82c685be02ff92adcf0f40af5ab1cba8ffe96211dcf551b3de25","start":37}],"target_id":"concept.nist.level","target_kind":"node","target_sha256":"86e6cf15b4f7a1cf88756e63b4735b43ee0dde6c87b2adb797d278f10eb68f32"}],"concept.nist.levenshtein":[{"id":"assertion.concept.nist.levenshtein","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Levenshtein distance as: (1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n are the lengths of the strings. Also known as edit distance.","support":[{"end":328,"quote":"(1) The smallest number of insertions, deletions, and substitutions required to change one\nstring\nor\ntree\ninto another.  (2) A\nΘ(m × n)\nalgorithm to compute the distance between strings, where m and n are the lengths of the strings.\nAlso known as\nedit distance.","source_id":"nist-dads.levenshtein","source_sha256":"6d5d8bd9c4cb8b207ccf8d95277acf2ca6dea841d29306fee9eeedc18d6395fd","start":67}],"target_id":"concept.nist.levenshtein","target_kind":"node","target_sha256":"89f728eebd00a0784566f87432ceac4ee8f501ceb97e245231ef74daaf12d17f"}],"concept.nist.lexicgrphcl":[{"id":"assertion.concept.nist.lexicgrphcl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lexicographical order as: Alphabetical or \"dictionary\" order.","support":[{"end":104,"quote":"Alphabetical or \"dictionary\" order.","source_id":"nist-dads.lexicgrphcl","source_sha256":"52e6bb72d8f745c711dc7911bb149f74939679f429b10706b96d8021b5a1d730","start":69}],"target_id":"concept.nist.lexicgrphcl","target_kind":"node","target_sha256":"7420d588554a62bfe4137ec8a5b5a497f346bcabede9fdb3634529290e0f40b6"}],"concept.nist.linearprobng":[{"id":"assertion.concept.nist.linearprobng","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linear probing as: A hash table in which a collision is resolved by putting the item in the next empty place in the array following the occupied place. Even with a moderate load factor , primary clustering tends to slow retrieval.","support":[{"end":271,"quote":"A\nhash table\nin which a\ncollision\nis resolved by putting the item in the next empty place in the array following the occupied place.  Even with a moderate\nload factor\n,\nprimary clustering\ntends to slow retrieval.","source_id":"nist-dads.linearprobng","source_sha256":"2ec435398daf338b69f968eb8b119210c48f7c0d328b2fb76eaa6124f353ed07","start":59}],"target_id":"concept.nist.linearprobng","target_kind":"node","target_sha256":"44028a01d5b05de795208a16dc64c8fddd6ecc130a946e373b69aee3d48c9f18"}],"concept.nist.linearquadtr":[{"id":"assertion.concept.nist.linearquadtr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linear quadtree as: A quadtree implemented as a single array of nodes .","support":[{"end":112,"quote":"A\nquadtree\nimplemented as a single\narray\nof\nnodes\n.","source_id":"nist-dads.linearquadtr","source_sha256":"da83d731dad614bd397ae2646b5d18589281c02332e3b605bd6ae6f6d5feb3d7","start":61}],"target_id":"concept.nist.linearquadtr","target_kind":"node","target_sha256":"46305325a83714bb4abd59a87e52e2d5eda3ba366f806da577056c42f89f0e84"}],"concept.nist.link":[{"id":"assertion.concept.nist.link","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines link as: A reference, pointer, or access handle to another part of the data structure. Often, a memory address.","support":[{"end":138,"quote":"A reference, pointer, or access handle to another part of the data structure.  Often, a memory address.","source_id":"nist-dads.link","source_sha256":"e3724fcfb6cb1c6114b154a25a0233e127f0d5f9906687201ae9ac880084bbca","start":35}],"target_id":"concept.nist.link","target_kind":"node","target_sha256":"4f58faa45c74f076870d54c7fc63d375581ec6f14c9f94d8d0fbffc09627fa46"}],"concept.nist.linkeddatasignature":[{"id":"assertion.concept.nist.linkeddatasignature","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linked data signature as: A digital signature, and information to verify it, for linked data. Also known as LDS.","support":[{"end":159,"quote":"A digital signature, and information to verify it, for linked data.\nAlso known as\nLDS.","source_id":"nist-dads.linkeddatasignature","source_sha256":"6bd94d9ff4d97f4116c9ef9bab0d0dc0b3a691c528d7aef325cd61fd74f42360","start":73}],"target_id":"concept.nist.linkeddatasignature","target_kind":"node","target_sha256":"5cea20d069d712a55875f37fb3afe3f1398df9fd910cc4fbb5b204876430556d"}],"concept.nist.linkedlist":[{"id":"assertion.concept.nist.linkedlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linked list as: A list implemented by each item having a link to the next item. Also known as singly linked list.","support":[{"end":150,"quote":"A\nlist\nimplemented by each item having a\nlink\nto the next item.\nAlso known as\nsingly linked list.","source_id":"nist-dads.linkedlist","source_sha256":"cf7b38d6ca17d27f22512cd359264d81edbdb3f880f05aa07a77ea2d36cb6a0b","start":53}],"target_id":"concept.nist.linkedlist","target_kind":"node","target_sha256":"2976f86a878e63543d8af374d506d8ac6fb25d18ff1806f4990ae2a2a8183e13"}],"concept.nist.list":[{"id":"assertion.concept.nist.list","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines list as: A collection of items accessible one after another beginning at the head and ending at the tail .","support":[{"end":136,"quote":"A collection of items accessible one after another beginning at the\nhead\nand ending at the\ntail\n.","source_id":"nist-dads.list","source_sha256":"70b84a3c95f548c2bd50cd5c4a85f521ed3e7250bca55b97c1c070a2e040d3d5","start":39}],"target_id":"concept.nist.list","target_kind":"node","target_sha256":"7c6041a606b0a6ea1e6fe7db8e681b6f71e74955e018b787b12db0cdc6d8f1bb"}],"concept.nist.listcontrctn":[{"id":"assertion.concept.nist.listcontrctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines list contraction as: Contracting a list by removing some of the items.","support":[{"end":108,"quote":"Contracting a\nlist\nby removing some of the items.","source_id":"nist-dads.listcontrctn","source_sha256":"07d49b7ee76ce4fc173670f15d80e673a3a4167b3242b1236fbe9e8d52ae91af","start":59}],"target_id":"concept.nist.listcontrctn","target_kind":"node","target_sha256":"2424c25369ea33eaa8b5d2a454c127b229594573bc2c91ceeca4ae46a6910ab7"}],"concept.nist.littleonotation":[{"id":"assertion.concept.nist.littleonotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines little-o notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity. The notation is read, \"f of n is little oh of g of n\". Formal Definition: f(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","support":[{"end":576,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity.   The notation is read, \"f of n is little oh of g of n\".\nFormal Definition:\nf(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","source_id":"nist-dads.littleonotation","source_sha256":"fdcf70e91721abd5051c74fce5e1f42cb304288fc2b60bd72137af44a8b1d879","start":61}],"target_id":"concept.nist.littleonotation","target_kind":"node","target_sha256":"eec9f2885dd386ece24e02ff2fb005e603cad317539b0e7c5abf10676bc3b36c"}],"concept.nist.loadfactor":[{"id":"assertion.concept.nist.loadfactor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines load factor as: The number of elements in a hash table divided by the number of slots. Usually written α (alpha).","support":[{"end":147,"quote":"The number of elements in a\nhash table\ndivided by the number of slots.  Usually written α (alpha).","source_id":"nist-dads.loadfactor","source_sha256":"c5a7736071033de9895fc2f8f689aa98100c73ddc3646d4fc0e5c06b1ae46d5d","start":49}],"target_id":"concept.nist.loadfactor","target_kind":"node","target_sha256":"90b8faf7fb2f4d87f821fdeae0f35cc332d66bab88916fb4b3241242657a066b"}],"concept.nist.localalgnmnt":[{"id":"assertion.concept.nist.localalgnmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines local alignment as: The detection of local similarities among two or more strings .","support":[{"end":120,"quote":"The detection of local similarities among two or more\nstrings\n.","source_id":"nist-dads.localalgnmnt","source_sha256":"c3003823a321447fd88a7344e8bcc5c9372156ee68526991de21164d96a8cb46","start":57}],"target_id":"concept.nist.localalgnmnt","target_kind":"node","target_sha256":"5f98051ee6bff01df98952047bbd330fb90cbc41178de902094a3af8e070d87a"}],"concept.nist.localoptimum":[{"id":"assertion.concept.nist.localoptimum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines local optimum as: A solution to a problem that is better than all other solutions that are slightly different, but worse than the global optimum .","support":[{"end":181,"quote":"A solution to a problem that is better than all other solutions that are slightly different, but worse than the\nglobal optimum\n.","source_id":"nist-dads.localoptimum","source_sha256":"86db8a3c44ba48bad70604c6bd10bde0b2a6ff8a2e9161c626dc0ad26ee0e161","start":53}],"target_id":"concept.nist.localoptimum","target_kind":"node","target_sha256":"30dda942fd995b45d3234598b744244667156a3d839efa47349490e3c16ea7b8"}],"concept.nist.logarithmic":[{"id":"assertion.concept.nist.logarithmic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines logarithmic as: (1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n. More formally m(n) = O(log n) . (3) Sometimes imprecisely used to mean polylogarithmic .","support":[{"end":392,"quote":"(1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n.  More formally m(n) =\nO(log n)\n. (3) Sometimes imprecisely used to mean\npolylogarithmic\n.","source_id":"nist-dads.logarithmic","source_sha256":"f4ce71e471aa9fbd2bec25e06e17ad2d4d540b74187b95ed60ca78e778666b21","start":49}],"target_id":"concept.nist.logarithmic","target_kind":"node","target_sha256":"54616fac61cf77461623aca592689fc01f55e22b05314deb67b6a43f49b85d21"}],"concept.nist.longestcommonsubsequence":[{"id":"assertion.concept.nist.longestcommonsubsequence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines longest common subsequence as: The problem of finding a maximum length (or maximum weight) subsequence of two or more strings . Also known as heaviest common subsequence.","support":[{"end":223,"quote":"The problem of finding a maximum length (or maximum weight)\nsubsequence\nof two or more\nstrings\n.\nAlso known as\nheaviest common subsequence.","source_id":"nist-dads.longestcommonsubsequence","source_sha256":"677b30ace5cc76d2d192bf39c9516a70cd8a65e69c331e395be86e05f0f16307","start":84}],"target_id":"concept.nist.longestcommonsubsequence","target_kind":"node","target_sha256":"f4a5a91da3b3b7656444c25b77c43153d9534feb2f3cd26e06a934465838c88a"}],"concept.nist.longestcommonsubstring":[{"id":"assertion.concept.nist.longestcommonsubstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines longest common substring as: Find the longest substring of two or more strings .","support":[{"end":131,"quote":"Find the longest\nsubstring\nof two or more\nstrings\n.","source_id":"nist-dads.longestcommonsubstring","source_sha256":"faf782869ead7215af10cee077b48d88253509104fd59010a7a19ca20424641a","start":80}],"target_id":"concept.nist.longestcommonsubstring","target_kind":"node","target_sha256":"28dcbddbcf3eccfb314e4e597e55411762ac82d784e2c6baf845753a87a6eaba"}],"concept.nist.lowerbound":[{"id":"assertion.concept.nist.lowerbound","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lower bound as: A function or growth rate below which solving a problem is impossible.","support":[{"end":119,"quote":"A function or growth rate below which solving a problem is impossible.","source_id":"nist-dads.lowerbound","source_sha256":"cfe486fa13d5e1ecc63bf91ca0502afb0a97fef2d7eeecd3c4d174cafae8a679","start":49}],"target_id":"concept.nist.lowerbound","target_kind":"node","target_sha256":"f168542c1441d01e74bc3faa1a8537fe23829d6a7e907f6958bf9b8fd14667c0"}],"concept.nist.lowertriangularmatrix":[{"id":"assertion.concept.nist.lowertriangularmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lower triangular matrix as: A matrix that is only defined at (i,j) when i ≥ j.","support":[{"end":127,"quote":"A\nmatrix\nthat is only defined at (i,j) when i ≥ j.","source_id":"nist-dads.lowertriangularmatrix","source_sha256":"b67c65ccd4dd4018744127a78fbecc8b2ac89c02caa79f3c140ccc1f16dc6fdf","start":77}],"target_id":"concept.nist.lowertriangularmatrix","target_kind":"node","target_sha256":"06930a45b4a111397420c7704d09c736ca8b7617e50d0853e45914667ea9627d"}],"concept.nist.lowestcommon":[{"id":"assertion.concept.nist.lowestcommon","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lowest common ancestor as: The deepest node in a tree that is an ancestor of two given leaves .","support":[{"end":139,"quote":"The deepest\nnode\nin a\ntree\nthat is an\nancestor\nof two given\nleaves\n.","source_id":"nist-dads.lowestcommon","source_sha256":"f0674845ac44d75af4e9e2506773efcd86b287cd55e3f82ae9b0aeae596aa36f","start":71}],"target_id":"concept.nist.lowestcommon","target_kind":"node","target_sha256":"4577dc264d16c7d64ceb5e373bf835ff2dd2f3773cd5b49638236da54867e9c7"}],"concept.nist.lreduction":[{"id":"assertion.concept.nist.lreduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines l-reduction as: A Karp reduction that preserves approximation properties of optimization problems .","support":[{"end":132,"quote":"A\nKarp reduction\nthat preserves approximation properties of\noptimization problems\n.","source_id":"nist-dads.lreduction","source_sha256":"fa52e414822d70b6d06461a304fe50f5bda915e8cc6a6e552b2b04cbaf777ef4","start":49}],"target_id":"concept.nist.lreduction","target_kind":"node","target_sha256":"492be58adff04b28134ee156f1ba324511b3518d811965e0ad86fc6476880580"}],"concept.nist.manhattandistance":[{"id":"assertion.concept.nist.manhattandistance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Manhattan distance as: The distance between two points measured along axes at right angles. In a plane with p 1 at (x 1 , y 1 ) and p 2 at (x 2 , y 2 ), it is |x 1 - x 2 | + |y 1 - y 2 |.","support":[{"end":228,"quote":"The distance between two points measured along axes at right angles. In a plane with p\n1\nat (x\n1\n, y\n1\n) and p\n2\nat (x\n2\n, y\n2\n), it is  |x\n1\n- x\n2\n| + |y\n1\n- y\n2\n|.","source_id":"nist-dads.manhattandistance","source_sha256":"11e07fe97c16ef33ecf5f261d0f0c349d4b4da986c72dc76fb7f3c51752b1943","start":63}],"target_id":"concept.nist.manhattandistance","target_kind":"node","target_sha256":"51c4198cda073ae512ce74e6e7b49d0683206389fa56b78537e8ae79d6b8d819"}],"concept.nist.manyonerdctn":[{"id":"assertion.concept.nist.manyonerdctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines many-one reduction as: A reduction that maps an instance of one problem into an equivalent instance of another problem.","support":[{"end":159,"quote":"A reduction that maps an instance of one problem into an equivalent instance of another problem.","source_id":"nist-dads.manyonerdctn","source_sha256":"b265caf509b4bc63d57b6c0f17235076c328a9e3f890820c2cd6eb18bd3f623f","start":63}],"target_id":"concept.nist.manyonerdctn","target_kind":"node","target_sha256":"5a2c1a9168615a75e3c5ef97716c1dfd0c7d8b3be9fabd95fca50b4ac219b56d"}],"concept.nist.markovchain":[{"id":"assertion.concept.nist.markovchain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Markov chain as: A finite state machine with probabilities for each transition, that is, a probability that the next state is s j given that the current state is s i .","support":[{"end":205,"quote":"A\nfinite state machine\nwith probabilities for each transition, that is, a probability that the next state is s\nj\ngiven that the current state is s\ni\n.","source_id":"nist-dads.markovchain","source_sha256":"0d36af6004e8549c2526f7328fd5f8d44f8c23a0fdc41cacfe91e5d3dfb8f2e4","start":55}],"target_id":"concept.nist.markovchain","target_kind":"node","target_sha256":"a238b60eb9f214f03e302db30f185ccda19ca6abf6b49e4b7d5274db570f531e"}],"concept.nist.mastertheorm":[{"id":"assertion.concept.nist.mastertheorm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Master theorem as: A theorem giving a solution in asymptotic terms for recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","support":[{"end":236,"quote":"A theorem giving a solution in asymptotic terms for\nrecurrence relations\nof the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","source_id":"nist-dads.mastertheorm","source_sha256":"57ec0ea4df4b66f03a2142643fb14dd97e2c37eeadb97ed951975242dc46c544","start":55}],"target_id":"concept.nist.mastertheorm","target_kind":"node","target_sha256":"615906a6423bd5d8b564abcbff5740120952ff51e2de7d7b2f4bc3ed24bf7994"}],"concept.nist.matchededge":[{"id":"assertion.concept.nist.matchededge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matched edge as: An edge which is in a matching .","support":[{"end":83,"quote":"An\nedge\nwhich is in a\nmatching\n.","source_id":"nist-dads.matchededge","source_sha256":"5fd14e5b1cf66e06d0c9e2e04a4bee93d7946b7bfd8b50efa4a4842951460c9f","start":51}],"target_id":"concept.nist.matchededge","target_kind":"node","target_sha256":"c9d1643c5d1032ef1781c286a8ba31dad590ef0d78fafdd5f4d8b7b662c565c4"}],"concept.nist.matchedvertx":[{"id":"assertion.concept.nist.matchedvertx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matched vertex as: A vertex on an matched edge in a matching , or, one which has been matched.","support":[{"end":130,"quote":"A\nvertex\non an\nmatched edge\nin a\nmatching\n, or, one which has been matched.","source_id":"nist-dads.matchedvertx","source_sha256":"6edff5c24745493dec051e0bbd3aae222cb1f64947679be3bad9df543525b150","start":55}],"target_id":"concept.nist.matchedvertx","target_kind":"node","target_sha256":"0e15dbd48996fcc5a16f33fb3c5d5d65d6c4554305c2a8e4a9a6fc8618e699e1"}],"concept.nist.matching":[{"id":"assertion.concept.nist.matching","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matching as: (1) A subgraph in which every vertex has a degree at most one. In other words, no two edges share a common vertex. (2) The problem of finding such a subgraph.","support":[{"end":204,"quote":"(1) A\nsubgraph\nin which every\nvertex\nhas a\ndegree\nat most one.  In other words, no two\nedges\nshare a common vertex.   (2) The problem of finding such a subgraph.","source_id":"nist-dads.matching","source_sha256":"93023883c3810dc4f3efa4d8557434e15728b31d2cfc291afbff451a553c158f","start":43}],"target_id":"concept.nist.matching","target_kind":"node","target_sha256":"6c49c8c4e12fc6b5dea68912cc787f4c2a21080bff2640a54c1c4f883e9ad266"}],"concept.nist.matrix":[{"id":"assertion.concept.nist.matrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matrix as: A two-dimensional array. By convention, the first index is the row, and the second index is the column.","support":[{"end":147,"quote":"A two-dimensional array.  By convention, the first index is the row, and the second index is the column.","source_id":"nist-dads.matrix","source_sha256":"94d449f02adb8c93359ad0785d9eb0170640565017dbb1a348f39684a862e850","start":43}],"target_id":"concept.nist.matrix","target_kind":"node","target_sha256":"5b5e0fedaeb642e58d8f6d6de8f6effb0b6849fc0c26d3d3e830c7a5833f8adb"}],"concept.nist.matrxchnmltp":[{"id":"assertion.concept.nist.matrxchnmltp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matrix-chain multiplication problem as: Given a sequence of matrices such that any matrix may be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum number of arithmetic operations. One may use dynamic programming to find the best association.","support":[{"end":366,"quote":"Given a sequence of matrices such that any\nmatrix\nmay be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum  number of arithmetic operations.  One may use\ndynamic programming\nto find the best association.","source_id":"nist-dads.matrxchnmltp","source_sha256":"1700d06220f19ebb935abfe3e5e7b3599c394e3d6aa83fb3ca9212b6a0b6038e","start":102}],"target_id":"concept.nist.matrxchnmltp","target_kind":"node","target_sha256":"e235d907a8dd56ee9609bedf63f271ad50de31d995c74bfa87c8643e26fae189"}],"concept.nist.maxheapprop":[{"id":"assertion.concept.nist.maxheapprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines max-heap property as: Each node in a tree has a key which is less than or equal to the key of its parent .","support":[{"end":145,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is less than or equal to the key of its\nparent\n.","source_id":"nist-dads.maxheapprop","source_sha256":"ba0267a727d4578a3065940d079adb652e0b5698b824cc9db33c788c46c86a59","start":61}],"target_id":"concept.nist.maxheapprop","target_kind":"node","target_sha256":"02399bfc8d778549ce2cd5c5a5b85875c222be1084c153665fc873a03b853d6a"}],"concept.nist.maximalindependentset":[{"id":"assertion.concept.nist.maximalindependentset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximal independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them and such that no more vertices can be added and it still be an independent set .","support":[{"end":253,"quote":"A set of\nvertices\nin a\ngraph\nsuch that for any pair of vertices, there is no\nedge\nbetween them and such that no more vertices can be added and it still be an\nindependent set\n.","source_id":"nist-dads.maximalindependentset","source_sha256":"d7ab52d07122fc3e8997011c02214602a796769a0e9e427c54e7c7904f02d09d","start":78}],"target_id":"concept.nist.maximalindependentset","target_kind":"node","target_sha256":"3479004d3ab3adc9d8d47123e386a1c9799c5cfda8960eff3c54d1b5505ed2f3"}],"concept.nist.maximallyconnectedcomponent":[{"id":"assertion.concept.nist.maximallyconnectedcomponent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximally connected component as: A connected subgraph of a graph to which no vertex can be added and it still be connected. Formal Definition: Given a graph G=(V, E), a subgraph S=(V', E') is a maximally connected component if S is connected , and for all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","support":[{"end":389,"quote":"A\nconnected\nsubgraph\nof a\ngraph\nto which no\nvertex\ncan be added and it still be connected.\nFormal Definition:\nGiven a\ngraph\nG=(V, E), a\nsubgraph\nS=(V', E') is a maximally connected component if\nS is\nconnected\n, and\nfor all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","source_id":"nist-dads.maximallyconnectedcomponent","source_sha256":"dac44d4e6eaa8f01128c703020486af37b3b81005934e3f2d9a6888bf293af22","start":85}],"target_id":"concept.nist.maximallyconnectedcomponent","target_kind":"node","target_sha256":"cd416b26d10c296d7f614e9a06c38d472a241370ae894555bcab548aa760f664"}],"concept.nist.maximumflow":[{"id":"assertion.concept.nist.maximumflow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximum-flow problem as: The problem of finding the maximum flow between any two vertices of a directed graph . Also known as network flow problem.","support":[{"end":194,"quote":"The problem of finding the maximum\nflow\nbetween any two\nvertices\nof a\ndirected graph\n.\nAlso known as\nnetwork flow problem.","source_id":"nist-dads.maximumflow","source_sha256":"2900d8a91e1be09e837ae15b46c8d39b7a0f4657971596a46c8bd5152d63c924","start":72}],"target_id":"concept.nist.maximumflow","target_kind":"node","target_sha256":"8166b88335ddd7f2c3e58995b52a84f0e621179202d8d75b33bca857ed3cc291"}],"concept.nist.mealymachine":[{"id":"assertion.concept.nist.mealymachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Mealy machine as: A finite state machine which produces an output for each transition .","support":[{"end":122,"quote":"A\nfinite state machine\nwhich produces an output for each\ntransition\n.","source_id":"nist-dads.mealymachine","source_sha256":"589d62191e5338dcddbf1661bbeb2b83c81f931eebdb518265a27660ea3b447e","start":53}],"target_id":"concept.nist.mealymachine","target_kind":"node","target_sha256":"12b7d9d31ab01f4d6573bf03edd08ef4b80107fb210a811f67088a904f5f2984"}],"concept.nist.mean":[{"id":"assertion.concept.nist.mean","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mean as: The (arithmetic) mean of some values is the sum of all values divided by the number of values.","support":[{"end":129,"quote":"The (arithmetic) mean of some values is the sum of all values divided by the number of values.","source_id":"nist-dads.mean","source_sha256":"c1cb1b760150686ef7b123b039955cbcc08b6897be19edfe7399198c2e59ccdb","start":35}],"target_id":"concept.nist.mean","target_kind":"node","target_sha256":"c82c35ed003de2f46abd0d44947bbe661e4a6f57cf3015a2187f5687121b353b"}],"concept.nist.median":[{"id":"assertion.concept.nist.median","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines median as: The value that has an equal number of values greater and less than it. For an even number of values, it is the mean of the two middle values.","support":[{"end":181,"quote":"The value that has an equal number of values greater and less than it.  For an even number of values, it is the\nmean\nof the two middle values.","source_id":"nist-dads.median","source_sha256":"0f7f61b7b67d66e6bd29d78061ec81608ca381eb79c55c7c0fe1c166ef209e27","start":39}],"target_id":"concept.nist.median","target_kind":"node","target_sha256":"c58a5dd2e64776a07d3a8ace441dc6dd24e9eb382444f1a3b29acb2cc4678dab"}],"concept.nist.meld":[{"id":"assertion.concept.nist.meld","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines meld as: Joining several data structures with particular properties into one large data structure having those properties. For instance, some priority queue implementations support the operation of joining two priority queues into a larger one.","support":[{"end":271,"quote":"Joining several data structures with particular properties into one large data structure having those properties.  For instance, some\npriority queue\nimplementations support the operation of joining two priority queues into a larger one.","source_id":"nist-dads.meld","source_sha256":"9dbe966d1a887d88b423a57dba3500aafcab8e85bea38267901ed23996d6c8f2","start":35}],"target_id":"concept.nist.meld","target_kind":"node","target_sha256":"662082ac6a9073bbfa8fbb60aff444b363f2dd48801bc969192347217f0a79aa"}],"concept.nist.merkletree":[{"id":"assertion.concept.nist.merkletree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Merkle tree as: A tree (usually a binary tree ) in which each internal node has a hash of all the information in the leaf nodes under it. Specifically, each internal node has a hash of the information in its children . Each leaf has a hash of the block of information it represents. All leaf nodes are at the same depth . All nodes are as far left as possible. To add a block (leaf) to a full tree, a new root is created with the old root as its left child. Its right child is a degenerate tree (only left subtrees) all the way to the leaf level. Also known as hash tree.","support":[{"end":613,"quote":"A\ntree\n(usually a\nbinary tree\n) in which each\ninternal node\nhas a\nhash\nof all the information in the\nleaf\nnodes under it.  Specifically, each internal node has a hash of the information in its\nchildren\n.  Each leaf has a hash of the block of information it represents.  All leaf nodes are at the same\ndepth\n.  All nodes are as far left as possible.\nTo add a block (leaf) to a\nfull\ntree, a new\nroot\nis created with the old root as its left child.  Its right child is a degenerate tree (only left subtrees) all the way to the leaf level.\nAlso known as\nhash tree.","source_id":"nist-dads.merkletree","source_sha256":"ad38aed7d0ee957ae9818731e56e6058b517207dcb9264b924272bf44840f352","start":53}],"target_id":"concept.nist.merkletree","target_kind":"node","target_sha256":"fd59154dd8262d1fc4582b7ec0499e64436b06fc9de2999bbbc748946faf8909"}],"concept.nist.midrange":[{"id":"assertion.concept.nist.midrange","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines midrange as: The sum of the minimum and maximum values, divided by two.","support":[{"end":101,"quote":"The sum of the minimum and maximum values, divided by two.","source_id":"nist-dads.midrange","source_sha256":"597ff1b081f4bb89cc8c5a5d9365df3996ebd102d4b531934c64f976a8faa3f4","start":43}],"target_id":"concept.nist.midrange","target_kind":"node","target_sha256":"2ea0f6a9a811b29ab839ca38503959b4599c4511bcb87a6e4a2d7356a58f7a4a"}],"concept.nist.minheapprop":[{"id":"assertion.concept.nist.minheapprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines min-heap property as: Each node in a tree has a key which is greater than or equal to the key of its parent .","support":[{"end":148,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is greater than or equal to the key of its\nparent\n.","source_id":"nist-dads.minheapprop","source_sha256":"d9ca97445be1be81071530e45101e2c59095972c08a771c71e8d7fb927f47bc5","start":61}],"target_id":"concept.nist.minheapprop","target_kind":"node","target_sha256":"5aeb6eb9b3329c321bb2bf05eb0293ce5146ab95ba2ba52fbf7948d052a38e04"}],"concept.nist.minimumboundingbox":[{"id":"assertion.concept.nist.minimumboundingbox","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum bounding box as: The smallest rectangle completely enclosing a set of points. Also known as MBB.","support":[{"end":146,"quote":"The smallest rectangle completely enclosing a set of points.\nAlso known as\nMBB.","source_id":"nist-dads.minimumboundingbox","source_sha256":"5ee6c28ac50d2fc78c76b08ed8b4901a0c735f4579ff665c68b806d7849f2c2d","start":67}],"target_id":"concept.nist.minimumboundingbox","target_kind":"node","target_sha256":"25220426decadc1be42c227f20b4e8c6051f297dc85a6fb0c814b58e0af20f2e"}],"concept.nist.minimumcut":[{"id":"assertion.concept.nist.minimumcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum cut as: The smallest set of edges in an undirected graph which separate two distinct vertices . That is, every path between them includes some member of the set.","support":[{"end":203,"quote":"The smallest set of\nedges\nin an\nundirected graph\nwhich separate two distinct\nvertices\n.  That is, every\npath\nbetween them includes some member of the set.","source_id":"nist-dads.minimumcut","source_sha256":"930df7dd08dbf21a609af38820d1ecc89dba914261c74b99eda90e9f90ff8ac7","start":49}],"target_id":"concept.nist.minimumcut","target_kind":"node","target_sha256":"67fa67ea9d0f0c4e5faee22824a611c9ac86fb491f1a4743c741fee6b6665410"}],"concept.nist.minimumspanningtree":[{"id":"assertion.concept.nist.minimumspanningtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines minimum spanning tree as: A minimum-weight tree in a weighted graph which contains all of the graph's vertices . Also known as MST, shortest spanning tree, SST.","support":[{"end":203,"quote":"A minimum-weight\ntree\nin a\nweighted graph\nwhich contains all of the graph's\nvertices\n.\nAlso known as\nMST, shortest spanning tree, SST.","source_id":"nist-dads.minimumspanningtree","source_sha256":"d91d8ee99a445199c48a4e03089f3a439bc3d8d470c10206c1b8639c228e771e","start":69}],"target_id":"concept.nist.minimumspanningtree","target_kind":"node","target_sha256":"5e22d2a79504fc3b503386a811e893546724bc602661d992f192343cc52272c7"}],"concept.nist.minvertexcut":[{"id":"assertion.concept.nist.minvertexcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum vertex cut as: The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut .","support":[{"end":226,"quote":"The smallest set of\nvertices\nin an\nundirected graph\nwhich separate two distinct vertices.  That is, every\npath\nbetween them passes through some member of the\ncut\n.","source_id":"nist-dads.minvertexcut","source_sha256":"854d079e58a61c695acd8121dd4bfde85c4e3f1605461860c3f54c4a216afb98","start":63}],"target_id":"concept.nist.minvertexcut","target_kind":"node","target_sha256":"508077a0b8196e2201aae92618f9b4e830b6468c07ebb4eb6b8a7e0bd71d3067"}],"concept.nist.mixedinteger":[{"id":"assertion.concept.nist.mixedinteger","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mixed integer linear program as: A linear program with additional constraints that some of the variables must take on integer values. Solving such problems is NP-hard .","support":[{"end":219,"quote":"A\nlinear program\nwith additional constraints that some of the variables must take on integer values.  Solving such problems is\nNP-hard\n.","source_id":"nist-dads.mixedinteger","source_sha256":"207a430342947a0d89a2ca402bb52ddeef87aa954e89ec5ebd8f3e51dd862367","start":83}],"target_id":"concept.nist.mixedinteger","target_kind":"node","target_sha256":"736d6af842295ab1d0a8b1bf583bbbd26699c4c71e484ea2104b403962c41f38"}],"concept.nist.mode":[{"id":"assertion.concept.nist.mode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mode as: The value that occurs most often. If no value is repeated, there is no mode. If more than one value occurs with the same greatest frequency, each value is a mode.","support":[{"end":199,"quote":"The value that occurs most often.  If no value is repeated, there is no mode.  If more than one value occurs with the same greatest frequency, each value is a mode.","source_id":"nist-dads.mode","source_sha256":"099a09321579eac9db821cf69bd25afa45a453292aa1f3e0f0c25e986b46663d","start":35}],"target_id":"concept.nist.mode","target_kind":"node","target_sha256":"e8695009129c389202dd60c09df05c3c919ade86037f708151efbba7460565c5"}],"concept.nist.modelofcomputation":[{"id":"assertion.concept.nist.modelofcomputation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines model of computation as: A formal, abstract definition of a computer. Using a model one can more easily analyze the intrinsic execution time or memory space of an algorithm while ignoring many implementation issues. There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","support":[{"end":440,"quote":"A formal, abstract definition of a computer.  Using a model one can more easily analyze the intrinsic execution time or memory space of an\nalgorithm\nwhile ignoring many implementation issues.  There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","source_id":"nist-dads.modelofcomputation","source_sha256":"0bf6481096e485301c74891a5778e75d7ac5da71409ce5016ff5700147990cfb","start":67}],"target_id":"concept.nist.modelofcomputation","target_kind":"node","target_sha256":"0802c703a4e470e669736f1f08511f859c522a9a2a9554af86eeb105bc304617"}],"concept.nist.monotonicallydecreasing":[{"id":"assertion.concept.nist.monotonicallydecreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotonically decreasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≥ f(y).","support":[{"end":183,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x ≤ y implies f(x) ≥ f(y).","source_id":"nist-dads.monotonicallydecreasing","source_sha256":"41937cd96584c62e288e3fad7ab5e39a95a2faa4ff6afc1af7dbf0c126d92b01","start":75}],"target_id":"concept.nist.monotonicallydecreasing","target_kind":"node","target_sha256":"0e89b7dcb0e10ca9d4df5d0bd2ba254f7a22939650f18dabb60b55d3361ce293"}],"concept.nist.monotonicallyincreasing":[{"id":"assertion.concept.nist.monotonicallyincreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotonically increasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≤ f(y).","support":[{"end":183,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x ≤ y implies f(x) ≤ f(y).","source_id":"nist-dads.monotonicallyincreasing","source_sha256":"eb64e9378f3c6391d24b23fc1a325410cf526a95f8b657c9dc6fbf0952609182","start":75}],"target_id":"concept.nist.monotonicallyincreasing","target_kind":"node","target_sha256":"3a2d3d7d07dade5eda04b6778f27eec63487221d2ae59dc216761c2e968ed99f"}],"concept.nist.monotonprioq":[{"id":"assertion.concept.nist.monotonprioq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotone priority queue as: A priority queue in which a key being inserted is never higher in priority than a previously deleted node.","support":[{"end":183,"quote":"A\npriority queue\nin which a\nkey\nbeing inserted is never higher in priority than a previously deleted node.","source_id":"nist-dads.monotonprioq","source_sha256":"82aa02fb93ff8e9227d8193cd9bf0263229d440e40ac7b88ecef10c3679ca4d9","start":77}],"target_id":"concept.nist.monotonprioq","target_kind":"node","target_sha256":"f5bf07790dc19cfdd2f4f476c2319bd404b0f330e0d5f08523ed8950f95bf75e"}],"concept.nist.mooremachine":[{"id":"assertion.concept.nist.mooremachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Moore machine as: A finite state machine that produces an output for each state .","support":[{"end":116,"quote":"A\nfinite state machine\nthat produces an output for each\nstate\n.","source_id":"nist-dads.mooremachine","source_sha256":"562f32bcb2fda88ffef52d8bc2e7f63da1c6b1acfe5088010b723b2f0ead6fb3","start":53}],"target_id":"concept.nist.mooremachine","target_kind":"node","target_sha256":"eb6b35e7115e631e22d65a2d2c79209b78ddef140a71137d0ae694760403074d"}],"concept.nist.multicommdty":[{"id":"assertion.concept.nist.multicommdty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multi-commodity flow as: A maximum-flow problem involving multiple commodities, in which each commodity has an associated demand and source - sink pairs.","support":[{"end":195,"quote":"A\nmaximum-flow problem\ninvolving multiple commodities, in which each commodity has an associated demand and\nsource\n-\nsink\npairs.","source_id":"nist-dads.multicommdty","source_sha256":"ddb7a13c19f2cb4c8a3c2c548453e7b77390787a4f8c9879a990b9a34dc914c7","start":67}],"target_id":"concept.nist.multicommdty","target_kind":"node","target_sha256":"ac8b5020f311436779eeb39d6f47eb708fda3dbafba9e2e469c58b4af0348b87"}],"concept.nist.multigraph":[{"id":"assertion.concept.nist.multigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multigraph as: A graph whose edges are unordered pairs of vertices , and the same pair of vertices can be connected by multiple edges. Formal Definition: Same as graph, but E is a bag of edges, not a set .","support":[{"end":241,"quote":"A\ngraph\nwhose\nedges\nare unordered pairs of\nvertices\n, and the same pair of vertices can be connected by multiple edges.\nFormal Definition:\nSame as graph, but E is a\nbag\nof edges, not a\nset\n.","source_id":"nist-dads.multigraph","source_sha256":"0e552e6954dccaf248620968159a3bc0e4db0188704f250f13b117bdf633e744","start":51}],"target_id":"concept.nist.multigraph","target_kind":"node","target_sha256":"16fe5c0408c0a3b968d189f519e7b69f905e0f5750b2e775be240892d317b069"}],"concept.nist.multilaygrd":[{"id":"assertion.concept.nist.multilaygrd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multilayer grid file as: A spatial access method which is two or more simultaneous grid files . Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","support":[{"end":234,"quote":"A\nspatial access method\nwhich is two or more simultaneous\ngrid files\n.  Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","source_id":"nist-dads.multilaygrd","source_sha256":"04f603f6aa88587201c8fc578ac362a3d011ae469e1b5c681a842fcbb02745e7","start":71}],"target_id":"concept.nist.multilaygrd","target_kind":"node","target_sha256":"e0a36874d839bd4ddc06156f2b21d2628f2282488a4a955358e4708ec4f140c4"}],"concept.nist.multiprocssr":[{"id":"assertion.concept.nist.multiprocssr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiprocessor model as: A model of parallel computation based on a set of communicating sequential processors.","support":[{"end":153,"quote":"A\nmodel of parallel computation\nbased on a set of communicating sequential processors.","source_id":"nist-dads.multiprocssr","source_sha256":"9ec73b5bbfa3400462357b77c1e7c9ff7092f5e6f54b1c2f1e3a26811b593e9e","start":67}],"target_id":"concept.nist.multiprocssr","target_kind":"node","target_sha256":"80228e06313df0795e38087fc9a4f2f71005ced8c92ab9d946a9abd44646b400"}],"concept.nist.multisuffixtree":[{"id":"assertion.concept.nist.multisuffixtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multi suffix tree as: A suffix tree extended to multiple strings by concatenating the strings .","support":[{"end":138,"quote":"A\nsuffix tree\nextended to multiple\nstrings\nby concatenating the\nstrings\n.","source_id":"nist-dads.multisuffixtree","source_sha256":"0a4d4ed349cf432143a28dc4e9d8425e8409ed1663b4c30f5647c0fb2ee58306","start":65}],"target_id":"concept.nist.multisuffixtree","target_kind":"node","target_sha256":"de1402eb39d84a823c9c56d91b1149aa533890fb1feca4a3c1270c5aa6bf8eb1"}],"concept.nist.multiwaydecision":[{"id":"assertion.concept.nist.multiwaydecision","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway decision as: A decision which has more than two results. For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","support":[{"end":237,"quote":"A decision which has more than two results.  For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","source_id":"nist-dads.multiwaydecision","source_sha256":"e116d829809a5671a9e70068111a607c8764ed011d78abb9425fce5e639eb068","start":61}],"target_id":"concept.nist.multiwaydecision","target_kind":"node","target_sha256":"d598dbfac46fbf81d657e56d5413ca03ee0bd3f574eead92748036326099a41f"}],"concept.nist.multiwaymerge":[{"id":"assertion.concept.nist.multiwaymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway merge as: Combine more than two sorted data streams into a single sorted stream.","support":[{"end":125,"quote":"Combine more than two sorted data streams into a single sorted stream.","source_id":"nist-dads.multiwaymerge","source_sha256":"34f0db9713b3cbdf08d4a808ede9a6888ed13a1781062954444ea9ec67334d30","start":55}],"target_id":"concept.nist.multiwaymerge","target_kind":"node","target_sha256":"9e137cb3179f82e8cb5f37bb8af654115b8c8ea193f1d2b49d3289e6422c6c40"}],"concept.nist.multiwaytree":[{"id":"assertion.concept.nist.multiwaytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway tree as: A tree with any number of children for each node .","support":[{"end":107,"quote":"A\ntree\nwith any number of\nchildren\nfor each\nnode\n.","source_id":"nist-dads.multiwaytree","source_sha256":"bd22ba364e2fe8de4c49d3a31d7e978cb4d533ded1a28ff436dfd5961114eb5e","start":57}],"target_id":"concept.nist.multiwaytree","target_kind":"node","target_sha256":"ea7b32656ab66df2f16881d65ec4cee59e02e22628051371dab8588dfad0ec1d"}],"concept.nist.nand":[{"id":"assertion.concept.nist.nand","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nand as: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","support":[{"end":111,"quote":"Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","source_id":"nist-dads.nand","source_sha256":"bcbc573e662261847ba353c387f72d38f03a0b5e638ee9257167c4be2d3c8fd2","start":35}],"target_id":"concept.nist.nand","target_kind":"node","target_sha256":"67828dc527b5f17eb05aa5e0528cbc9fb25f2a59e51b1e9740b8b005e3198f78"}],"concept.nist.naryfunc":[{"id":"assertion.concept.nist.naryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines n-ary function as: (1) A function with exactly n arguments. (2) A function which takes any number of arguments, or a variable number of arguments.","support":[{"end":183,"quote":"(1) A\nfunction\nwith exactly n arguments.  (2) A function which takes any number of arguments, or a variable number of arguments.","source_id":"nist-dads.naryfunc","source_sha256":"cc3b9e50480c92de367de15b1807be49425a22d81c25f0472623f0054898aa48","start":55}],"target_id":"concept.nist.naryfunc","target_kind":"node","target_sha256":"d247ffce0e95b8265124a5c85ed977d899a0dafb374390c3df64cb81f5596136"}],"concept.nist.nearestneighbor":[{"id":"assertion.concept.nist.nearestneighbor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nearest neighbor as: Find the point (rectangle, line, etc.) that is closest to another point.","support":[{"end":136,"quote":"Find the point (rectangle, line, etc.) that is closest to another point.","source_id":"nist-dads.nearestneighbor","source_sha256":"a25ca8f52c9cb4fbcc72504663e5f51ef2b52989a6825fd269006eb040323fee","start":64}],"target_id":"concept.nist.nearestneighbor","target_kind":"node","target_sha256":"82e73bdd78346ee28fa6acd6e0cf96904c706e4df6a183e1bb79a9fe3878c563"}],"concept.nist.negation":[{"id":"assertion.concept.nist.negation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines negation as: The negation of 0 is 1; the negation of 1 is 0.","support":[{"end":90,"quote":"The negation of 0 is 1; the negation of 1 is 0.","source_id":"nist-dads.negation","source_sha256":"c0741462fc602bcf19c4b7aa9a39c2b055752edf815ed795438f18eaf870303b","start":43}],"target_id":"concept.nist.negation","target_kind":"node","target_sha256":"950cb4e2592faa9d0e923b6d465323354128b67ec9cba19692a8b856f84839ac"}],"concept.nist.nextstate":[{"id":"assertion.concept.nist.nextstate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines next state as: The state immediately following the current state, defined by the transition function of a finite state machine and the input.","support":[{"end":173,"quote":"The\nstate\nimmediately following the current state, defined by the\ntransition function\nof a\nfinite state machine\nand the input.","source_id":"nist-dads.nextstate","source_sha256":"15e4ac94bac1d1963fb0acd3395b54b414f33fddb94ad5b62eb16c7f1f76caef","start":47}],"target_id":"concept.nist.nextstate","target_kind":"node","target_sha256":"3da12d35439dd405674adebd03a4e00b0c8de7dae664104237328d8ef2e5611b"}],"concept.nist.nist":[{"id":"assertion.concept.nist.nist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NIST as: The United States National Institute of Standards and Technology.","support":[{"end":100,"quote":"The United States National Institute of Standards and Technology.","source_id":"nist-dads.nist","source_sha256":"1663faa72caaeefae6400b5dc13678399c336763f58c2100233df123673642bf","start":35}],"target_id":"concept.nist.nist","target_kind":"node","target_sha256":"359d06b1b22cc36eeb31d6ce01564ddda178e0b3cee2edbd7d18d159f77046b4"}],"concept.nist.node":[{"id":"assertion.concept.nist.node","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines node as: (1) A unit of reference in a data structure. Also called a vertex in graphs and trees . (2) A collection of information which must be kept at a single memory location.","support":[{"end":203,"quote":"(1) A unit of reference in a data structure.  Also called a\nvertex\nin\ngraphs\nand\ntrees\n. (2) A collection of information which must be kept at a single memory location.","source_id":"nist-dads.node","source_sha256":"2825d103eca8f407d2084c70e8719c2f221b5c1d4b15327ad44e536e789774e0","start":35}],"target_id":"concept.nist.node","target_kind":"node","target_sha256":"ae6359b70a3921527ebc3edb9b7c5122bb1e55af51e3ccdc2f23fe84ef294131"}],"concept.nist.nondetermfinitestatemach":[{"id":"assertion.concept.nist.nondetermfinitestatemach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines nondeterministic finite state machine as: A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states . The transition function also may map the null symbol (no input symbol needed) and states to next states. Also known as NFA, nondeterministic finite automaton.","support":[{"end":383,"quote":"A\nfinite state machine\nwhose\ntransition function\nmaps inputs symbols and\nstates\nto a (possibly empty) set of\nnext states\n.  The transition function also may map the null symbol (no input symbol needed) and states to next states.\nAlso known as\nNFA, nondeterministic finite automaton.","source_id":"nist-dads.nondetermfinitestatemach","source_sha256":"a1606792343304569699a32cf0df60f8467f1f49c59a225cc9183c7a77eceb8e","start":101}],"target_id":"concept.nist.nondetermfinitestatemach","target_kind":"node","target_sha256":"eb33469cf0d2ec0943a89d0d6faa61399d8750bdc7481258e30b62071ef6e784"}],"concept.nist.nondetermfinitetreeautom":[{"id":"assertion.concept.nist.nondetermfinitetreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic finite tree automaton as: A nondeterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as NFTA.","support":[{"end":427,"quote":"A\nnondeterministic finite state machine\nthat accepts\nfinitary trees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The acceptance condition is modified accordingly.\nAlso known as\nNFTA.","source_id":"nist-dads.nondetermfinitetreeautom","source_sha256":"0b04ed0e0cf208c4d43fe1478eeeea889178fbf110bf4a0c685cf6afa7fcb592","start":103}],"target_id":"concept.nist.nondetermfinitetreeautom","target_kind":"node","target_sha256":"70f7f193278e8a8b8f8b4f1a17fa7c4555bbe3a13787398f18bab8891854d93d"}],"concept.nist.nondeterministic":[{"id":"assertion.concept.nist.nondeterministic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic as: Permitting more than one choice of next move at some step in a computation.","support":[{"end":134,"quote":"Permitting more than one choice of next move at some step in a computation.","source_id":"nist-dads.nondeterministic","source_sha256":"03ab4d63aa97083da3cd6280b55435e9f97019f695f2bccc98b4cd245b47979c","start":59}],"target_id":"concept.nist.nondeterministic","target_kind":"node","target_sha256":"a777b8065e7d160a8ba846b13a9f5764abeabcf90dcdbca7624dea2143d3954a"}],"concept.nist.nondetermtreeautom":[{"id":"assertion.concept.nist.nondetermtreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic tree automaton as: A nondeterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","support":[{"end":441,"quote":"A\nnondeterministic finite state machine\nthat accepts infinite\ntrees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The expressive power of such automata varies depending on the acceptance conditions of the trees.","source_id":"nist-dads.nondetermtreeautom","source_sha256":"0712c223bae13dffe2316b1feec47b59bbcc5eb0b297822989cd2a603c353a24","start":89}],"target_id":"concept.nist.nondetermtreeautom","target_kind":"node","target_sha256":"42d4dc79c597e6be012bfeabb2ac14f24021898927c3b4eee1a47c9f3874700c"}],"concept.nist.nondetermturingmach":[{"id":"assertion.concept.nist.nondetermturingmach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines nondeterministic Turing machine as: A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance.","support":[{"end":277,"quote":"A\nTuring machine\nwhich has more than one\nnext state\nfor some combinations of contents of the current cell and current state.  An input is accepted if any move sequence leads to acceptance.","source_id":"nist-dads.nondetermturingmach","source_sha256":"a3d26e34c03a7a225aee5a253a9da8af4e3acb0547a6a91dfd520e10ecfc4d9a","start":89}],"target_id":"concept.nist.nondetermturingmach","target_kind":"node","target_sha256":"1884d4e9c000726ae43b2b507a12580115a7da9d37990e1fb91642c1ff154c17"}],"concept.nist.nor":[{"id":"assertion.concept.nist.nor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nor as: Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","support":[{"end":105,"quote":"Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","source_id":"nist-dads.nor","source_sha256":"71c8c1c64ba9f111bc4a44098c8af9d70556f7f1134d878f373750ae20470025","start":33}],"target_id":"concept.nist.nor","target_kind":"node","target_sha256":"52f0f08525a3fccbe24c98feaaf4bd9f6852c9999545d5899965ddd76fc333aa"}],"concept.nist.not":[{"id":"assertion.concept.nist.not","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines not as: Negation: NOT 0 = 1, NOT 1 = 0. Also known as complement .","support":[{"end":92,"quote":"Negation: NOT 0 = 1, NOT 1 = 0.  Also known as\ncomplement\n.","source_id":"nist-dads.not","source_sha256":"7fa34cb1b9b9a9305fd6c27981a7dc5422bacba215411542a698f0b8fdc38da8","start":33}],"target_id":"concept.nist.not","target_kind":"node","target_sha256":"74cb24cb7972b2dd9a1bb5bb23aea64df4991d926f11fdd35a0ba200796e7bed"}],"concept.nist.np":[{"id":"assertion.concept.nist.np","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP as: The complexity class of decision problems for which answers can be checked by an algorithm whose run time is polynomial in the size of the input. Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly. \"NP\" is the class that a N ondeterministic Turing machine accepts in P olynomial time. Also known as nondeterministic polynomial time.","support":[{"end":446,"quote":"The\ncomplexity class\nof\ndecision problems\nfor which answers can be checked by an algorithm whose run time is\npolynomial\nin the size of the input.  Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly.  \"NP\" is the class that a\nN\nondeterministic Turing machine\naccepts in\nP\nolynomial time.\nAlso known as\nnondeterministic polynomial time.","source_id":"nist-dads.np","source_sha256":"f4c82d1acbe3db745b5033af1481775d53292063dd8da54c5b9f60988393178d","start":31}],"target_id":"concept.nist.np","target_kind":"node","target_sha256":"c50bf62fb15aebd0a87d75f4628175f3cfa3218c83de58add4399eb615f26d04"}],"concept.nist.npcomplete":[{"id":"assertion.concept.nist.npcomplete","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines NP-complete as: The complexity class of decision problems for which answers can be checked for correctness, given a certificate , by an algorithm whose run time is polynomial in the size of the input (that is, it is NP ) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","support":[{"end":487,"quote":"The\ncomplexity class\nof\ndecision problems\nfor which answers can be checked for correctness, given a\ncertificate\n, by an algorithm whose run time is\npolynomial\nin the size of the input (that is, it is\nNP\n) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","source_id":"nist-dads.npcomplete","source_sha256":"01fc07f4179ca202dc10491849bd9cd969373c648ae7e5aa954e20d469667008","start":49}],"target_id":"concept.nist.npcomplete","target_kind":"node","target_sha256":"cfec4bd3bc5318ebb3cece6383fc98e9697d275eef6e3ff7f266f67ad2a01041"}],"concept.nist.npcompltlngg":[{"id":"assertion.concept.nist.npcompltlngg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP-complete language as: A language in NP such that every language in NP can be reduced to it in polynomial time .","support":[{"end":156,"quote":"A language in\nNP\nsuch that every language in NP can be reduced to it in\npolynomial time\n.","source_id":"nist-dads.npcompltlngg","source_sha256":"c4950cddc866411bdc487dbdf1058c93668b10f0bb103cfe70413f4763e5389a","start":67}],"target_id":"concept.nist.npcompltlngg","target_kind":"node","target_sha256":"d530f7380f9e4cf678d0f5da05fd39d3108ee27fc5bb8f8a6ddc059d7fb38d21"}],"concept.nist.nphard":[{"id":"assertion.concept.nist.nphard","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP-hard as: The complexity class of decision problems that are intrinsically harder than those that can be solved by a nondeterministic Turing machine in polynomial time . When a decision version of a combinatorial optimization problem is proved to belong to the class of NP-complete problems, then the optimization version is NP-hard.","support":[{"end":366,"quote":"The\ncomplexity class\nof\ndecision problems\nthat are intrinsically harder than those that can be solved by a\nnondeterministic Turing machine\nin\npolynomial time\n.  When a decision version of a combinatorial\noptimization problem\nis proved to belong to the class of\nNP-complete\nproblems,  then the optimization version is NP-hard.","source_id":"nist-dads.nphard","source_sha256":"43a9a98b981a6267ace3aef695f30d0733653be225d572eada6fade7d8590f0f","start":41}],"target_id":"concept.nist.nphard","target_kind":"node","target_sha256":"5ba05c07a83279ad5ec5dbf57f93ff011af62139e0fb591cbb9c1700cf6ce997"}],"concept.nist.nqueens":[{"id":"assertion.concept.nist.nqueens","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines n queens as: Place n chess queens on an n × n board such that no queen can attack another. Efficiently find all possible placements.","support":[{"end":168,"quote":"Place n chess queens on an n × n board such that no queen can attack another.  Efficiently find all possible placements.","source_id":"nist-dads.nqueens","source_sha256":"2c10986dc3a63dd82f3e5f2fb1a11ab41ba5f80729a3fd4c8580e9b883a96e58","start":48}],"target_id":"concept.nist.nqueens","target_kind":"node","target_sha256":"aeb6c8c07d9fcfa91117d212e39e2b059b2b8208b4847c56e9f91a9c051e260f"}],"concept.nist.nulltree":[{"id":"assertion.concept.nist.nulltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines null tree as: (1) A tree which is empty. (2) A tree whose leaf nodes all have a null value.","support":[{"end":123,"quote":"(1) A\ntree\nwhich is empty.  (2) A tree whose\nleaf\nnodes all have a null value.","source_id":"nist-dads.nulltree","source_sha256":"d9c18fd3b8134d817629d5362d7b903a702e0ce7b41f74bbe0a07f3ced9f5b78","start":45}],"target_id":"concept.nist.nulltree","target_kind":"node","target_sha256":"45aa62c56d64bf11c911f11cc2d4029cc7114d8ec59f0333ea8ab86256606e4e"}],"concept.nist.objective":[{"id":"assertion.concept.nist.objective","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines objective function as: A function associated with an optimization problem which determines how good a solution is, for instance, the total cost of edges in a solution to a traveling salesman problem.","support":[{"end":239,"quote":"A function associated with an\noptimization problem\nwhich determines how good a solution is, for instance, the total cost of\nedges\nin a solution to a\ntraveling salesman\nproblem.","source_id":"nist-dads.objective","source_sha256":"9b77da1e757754f00b0e55a3815b46f3902b878db8ce7424b3fb5ec3ed55057a","start":63}],"target_id":"concept.nist.objective","target_kind":"node","target_sha256":"73b03bc27b2d53f60bdcb562e12df8778f2d69d2808069872ac010c336aa3074"}],"concept.nist.obliviousalgorithm":[{"id":"assertion.concept.nist.obliviousalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oblivious algorithm as: An algorithm whose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","support":[{"end":194,"quote":"An\nalgorithm\nwhose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","source_id":"nist-dads.obliviousalgorithm","source_sha256":"557b37031e932cef3a63809b6d4c48255a1cb9a74bd43dff6dcf6abf2f3898cd","start":65}],"target_id":"concept.nist.obliviousalgorithm","target_kind":"node","target_sha256":"1bfb56729bdd3206f69ef6f1ffdc58c9ebc9ccfa4eee4458c147a8a1587acd13"}],"concept.nist.occurrence":[{"id":"assertion.concept.nist.occurrence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines occurrence as: A string v occurs in a string u if v is a substring of u.","support":[{"end":104,"quote":"A\nstring\nv occurs in a string u if v is a\nsubstring\nof u.","source_id":"nist-dads.occurrence","source_sha256":"7ab0bee379cecee1d871c1fdecf16105399cfd962d6474e6475ba3265390896f","start":47}],"target_id":"concept.nist.occurrence","target_kind":"node","target_sha256":"84639cb2a06e225208e65b4929d869d0d6dfbd3a8cb2b4f099c5d8c31e5795ee"}],"concept.nist.octree":[{"id":"assertion.concept.nist.octree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines octree as: A tree to index three dimensions. Each node has either eight children or no children.","support":[{"end":129,"quote":"A\ntree\nto index three dimensions.  Each node has either eight\nchildren\nor no children.","source_id":"nist-dads.octree","source_sha256":"bf3cabed4ead1f1472421ed5014062e7891ce57160fa48688d2fed4d8a88b25f","start":43}],"target_id":"concept.nist.octree","target_kind":"node","target_sha256":"ee100ebd6d8f1405cbfb550d9ce37b45fe9e1b2ee71104f14a62a39a04f7117c"}],"concept.nist.offline":[{"id":"assertion.concept.nist.offline","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines off-line algorithm as: An algorithm which is given the entire sequence of inputs in advance.","support":[{"end":132,"quote":"An algorithm which is given the entire sequence of inputs in advance.","source_id":"nist-dads.offline","source_sha256":"4bcdb6970442fe388bfcf3bd48b0cf01f0cc5d536b0acb21e1e7c22fa1dd8448","start":63}],"target_id":"concept.nist.offline","target_kind":"node","target_sha256":"2b6c823b4e096d8a8dc112bbb8b1e7fb135b0489c61e208599f52aa3cb48e695"}],"concept.nist.offset":[{"id":"assertion.concept.nist.offset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines offset as: The distance from the beginning of a string to the end of a segment in that string.","support":[{"end":122,"quote":"The distance from the beginning of a\nstring\nto the end of a\nsegment\nin that string.","source_id":"nist-dads.offset","source_sha256":"59c952ca2fcddeecc1725c66813180c38798e18f3e58b85d4e0e3eb1e15e4e7d","start":39}],"target_id":"concept.nist.offset","target_kind":"node","target_sha256":"a189666a284e9f726fa546055790f2a81af1169e9da5efe6f087f8932d5c98f3"}],"concept.nist.omega":[{"id":"assertion.concept.nist.omega","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ω as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity. Formal Definition: f(n) = ω (g(n)) means that for any positive constant c, there exists a constant k, such that 0 ≤ cg(n) < f(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","support":[{"end":516,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity.\nFormal Definition:\nf(n) = ω (g(n)) means that for any positive constant c,  there exists a constant k, such that  0 ≤ cg(n) < f(n) for all  n ≥ k. The value of k must not depend on n, but may depend on c.","source_id":"nist-dads.omega","source_sha256":"e3564ca1e5fe296c5e6b665769d8af13d4e44cc1ea41eae454028e9bd6efac0a","start":33}],"target_id":"concept.nist.omega","target_kind":"node","target_sha256":"994014b5d5abe19cdff4bccde2e205e385febcb346d517aacd63d19b00457b9f"}],"concept.nist.omicron":[{"id":"assertion.concept.nist.omicron","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines omicron as: The Greek letter written as \"o\" (see little-o notation ) or \"O\" (see big-O notation ).","support":[{"end":127,"quote":"The Greek letter written as \"o\" (see\nlittle-o notation\n) or \"O\" (see\nbig-O notation\n).","source_id":"nist-dads.omicron","source_sha256":"0a8d390353bc593beffa78081d1c80e38c19044eeb12c06797277a37dac6277d","start":41}],"target_id":"concept.nist.omicron","target_kind":"node","target_sha256":"282de7d3abf9bc27dea1f9416bcc35ab9b682d22358c0040ff1e197020542a8c"}],"concept.nist.onebasedindexing":[{"id":"assertion.concept.nist.onebasedindexing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 1-based indexing as: Indexing (an array ) beginning with 1.","support":[{"end":97,"quote":"Indexing (an\narray\n) beginning with 1.","source_id":"nist-dads.onebasedindexing","source_sha256":"0b7e4cc03faa6bd9e2625a4b0f0cd51bcc9e2d3a7a370f91f1e56afde22b5d64","start":59}],"target_id":"concept.nist.onebasedindexing","target_kind":"node","target_sha256":"ede727c7b4ff07e8bb3f08fafd9dac1ba3728471e2e542a76456647bbdadb268"}],"concept.nist.onedimensnal":[{"id":"assertion.concept.nist.onedimensnal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines one-dimensional as: Dealing with or restricted to a line. An organization where location can be completely described with exactly one axis.","support":[{"end":177,"quote":"Dealing with or restricted to a line.  An organization where location can be completely described with exactly one axis.","source_id":"nist-dads.onedimensnal","source_sha256":"3f1f07134aa801b85c9166345e494ed966f51fe3e6d310ad09020371433fa2cd","start":57}],"target_id":"concept.nist.onedimensnal","target_kind":"node","target_sha256":"e47f17b3e67f2833791888acd9d8f799aca97838a4daad64c2683261a57b2091"}],"concept.nist.online":[{"id":"assertion.concept.nist.online","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines on-line algorithm as: An algorithm that must process each input in turn, without detailed knowledge of future inputs.","support":[{"end":156,"quote":"An algorithm that must process each input in turn, without detailed knowledge of future inputs.","source_id":"nist-dads.online","source_sha256":"7c4b8905cf77499fe0e9c00d6e83b6c8a7bda475a36c53f8bb6a1c7fa6571e7f","start":61}],"target_id":"concept.nist.online","target_kind":"node","target_sha256":"96036ace2d1c0a1b99b30464ca0e26048cd17d8a0d89f86efa03197f775105ea"}],"concept.nist.optimal":[{"id":"assertion.concept.nist.optimal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal as: (1) A solution to an optimization problem which has the minimum (or maximum) value of the objective function . (2) The time, space, resource, etc. complexity of an algorithm which matches the best known lower bound of a problem.","support":[{"end":270,"quote":"(1) A solution to an\noptimization problem\nwhich has the minimum (or maximum) value of the\nobjective function\n.  (2) The time, space, resource, etc.\ncomplexity\nof an\nalgorithm\nwhich matches the best known\nlower bound\nof a problem.","source_id":"nist-dads.optimal","source_sha256":"53df69d59eb036b0cb8ab8121966a06d3bc602b48f03d9dd90a6390eac062e00","start":41}],"target_id":"concept.nist.optimal","target_kind":"node","target_sha256":"566d817dd282e965a035aa5ab269688dc54920b26b9ba33b932a74a4081fbb23"}],"concept.nist.optimalsoltn":[{"id":"assertion.concept.nist.optimalsoltn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal solution as: A solution to an optimization problem which minimizes (or maximizes) the objective function .","support":[{"end":152,"quote":"A solution to an\noptimization problem\nwhich minimizes (or maximizes) the\nobjective function\n.","source_id":"nist-dads.optimalsoltn","source_sha256":"850977c061bce97a561a4e3c86e06f22ca902bdbb2dea51075455517addfb625","start":59}],"target_id":"concept.nist.optimalsoltn","target_kind":"node","target_sha256":"3b2022e8705376fc96df5c811d6bb9bccf237307231d7c63afd8d453a32d8753"}],"concept.nist.optimalvalue":[{"id":"assertion.concept.nist.optimalvalue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal value as: The minimum (or maximum) value of the objective function over the feasible region of an optimization problem .","support":[{"end":163,"quote":"The minimum (or maximum) value of the\nobjective function\nover the\nfeasible region\nof an\noptimization problem\n.","source_id":"nist-dads.optimalvalue","source_sha256":"069b15d70eb21804fae79d98efa7cbd36caebc0fd076ee1566d0a4f80627050e","start":53}],"target_id":"concept.nist.optimalvalue","target_kind":"node","target_sha256":"8d87aca90907012a0b819003916686c68f17a3bc3c029c4e5e0b6953827df5e5"}],"concept.nist.optimization":[{"id":"assertion.concept.nist.optimization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimization problem as: A computational problem in which the object is to find the best of all possible solutions. More formally, find a solution in the feasible region which has the minimum (or maximum) value of the objective function .","support":[{"end":281,"quote":"A computational problem in which the object is to find the best of all possible solutions.  More formally, find a solution in the\nfeasible region\nwhich has the minimum (or maximum) value of the\nobjective function\n.","source_id":"nist-dads.optimization","source_sha256":"710ecf45d0b3ec367e675a75517f3961d39d91257506e9f8ea1ee5b6a76abf94","start":67}],"target_id":"concept.nist.optimization","target_kind":"node","target_sha256":"86cba4c2b70e42d47544bab9fc36f6ab2008bb5a1cf793ded2efe62012a35865"}],"concept.nist.optimtriangulation":[{"id":"assertion.concept.nist.optimtriangulation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal triangulation problem as: Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes O(n log n) time.","support":[{"end":215,"quote":"Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes\nO(n log n)\ntime.","source_id":"nist-dads.optimtriangulation","source_sha256":"4175a7dc51af3e461b072e7a34502ce386b2bfb3ac01c6c27cb2becf01620c7b","start":90}],"target_id":"concept.nist.optimtriangulation","target_kind":"node","target_sha256":"b553313367042e1c4e893504a78c152baee70379d2ed094950be62f387bad616"}],"concept.nist.or":[{"id":"assertion.concept.nist.or","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines or as: Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1. Also known as inclusive or.","support":[{"end":119,"quote":"Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1.\nAlso known as\ninclusive or.","source_id":"nist-dads.or","source_sha256":"9c397633ac04ca2112329c5b077b37d250f2a6b4cdc8917d78a703a607dfae4a","start":31}],"target_id":"concept.nist.or","target_kind":"node","target_sha256":"9788d194a3db47f13821e2e3b84ae464daa7c2493c735eaa84841f3337a1e6b5"}],"concept.nist.oracleset":[{"id":"assertion.concept.nist.oracleset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle set as: A predetermined set of tapes used by an oracle Turing machine to make decisions otherwise not feasibled.","support":[{"end":151,"quote":"A predetermined set of tapes used by an\noracle Turing machine\nto make decisions otherwise not feasibled.","source_id":"nist-dads.oracleset","source_sha256":"673d1153db17899b09cefeec0c4de839b3747e44d1899e95f1fa12cf8e56fea1","start":47}],"target_id":"concept.nist.oracleset","target_kind":"node","target_sha256":"a149b128c974fa5d08fcb3a6e0f328903f6041344362dba2298ae0e5886f19c2"}],"concept.nist.oracletape":[{"id":"assertion.concept.nist.oracletape","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle tape as: An extra tape used by an oracle Turing machine to make decisions otherwise not feasible.","support":[{"end":137,"quote":"An extra tape used by an\noracle Turing machine\nto make decisions otherwise not feasible.","source_id":"nist-dads.oracletape","source_sha256":"1cbd51c6b3f694cccfd274ffe3fd0f694caf7f28e688fee799ea411e6c7ffa3c","start":49}],"target_id":"concept.nist.oracletape","target_kind":"node","target_sha256":"8b65d2a31df7d4b684bc6bdeffaf3b2903394457c9007d2e8bb0d2640093ffe5"}],"concept.nist.oracletur":[{"id":"assertion.concept.nist.oracletur","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle Turing machine as: A Turing machine with an extra oracle tape and three extra states q ? , q y , q n . When the machine enters q ? , control goes to state q y if the oracle tape content is in the oracle set ; otherwise control goes to state q n .","support":[{"end":297,"quote":"A\nTuring machine\nwith an extra\noracle tape\nand three extra states q\n?\n, q\ny\n, q\nn\n.  When the machine enters q\n?\n, control goes to state q\ny\nif the oracle tape content is in the\noracle set\n; otherwise control goes to state q\nn\n.","source_id":"nist-dads.oracletur","source_sha256":"281e093a4b69249e0748fd6cce89c3da10b1565da6b26f4f51c4f757d0a48c82","start":69}],"target_id":"concept.nist.oracletur","target_kind":"node","target_sha256":"bf4e63b343185d9885e9432e29dd347e0ab18da9b36f395cceb1637fc4f09bc1"}],"concept.nist.order":[{"id":"assertion.concept.nist.order","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order as: (1) The height of a tree . (2) The number of children of the root of a binomial tree . (3) The maximum number of children of nodes in a B-tree . (4) The number of data streams, usually denoted ω, in a multiway merge .","support":[{"end":256,"quote":"(1) The\nheight\nof a\ntree\n.   (2) The number of\nchildren\nof the\nroot\nof a\nbinomial tree\n. (3) The maximum number of children of\nnodes\nin a\nB-tree\n. (4) The number of data streams, usually denoted ω, in a\nmultiway merge\n.","source_id":"nist-dads.order","source_sha256":"9124a99e5f73f10179f510ac91cf26808db1e2f7d6a16ae277d47ddf3a2f0ecd","start":37}],"target_id":"concept.nist.order","target_kind":"node","target_sha256":"f14ee74a14b4223699d97eda973c885ab22c742a298448124343999f80dc3079"}],"concept.nist.orderedarry":[{"id":"assertion.concept.nist.orderedarry","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered array as: An array whose items have some order. Usually, it means a sorted array , but may mean not fully ordered, for example, all values less than the median are in the first half.","support":[{"end":230,"quote":"An\narray\nwhose items have some order.  Usually, it means a\nsorted array\n, but may mean not fully ordered, for example, all values less than the\nmedian\nare in the first half.","source_id":"nist-dads.orderedarry","source_sha256":"98a4998d968d9c94ac2d82711322d1a3ef76eb21dfd7ccbfdcb8af43ea8d9bd6","start":57}],"target_id":"concept.nist.orderedarry","target_kind":"node","target_sha256":"a470e0a5d42a5422cde3736a0c0d54ce0db8f2fbbd4396821d0794ecd8d97bca"}],"concept.nist.orderedlinkedlist":[{"id":"assertion.concept.nist.orderedlinkedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered linked list as: A linked list whose items are kept in some order.","support":[{"end":118,"quote":"A\nlinked list\nwhose items are kept in some order.","source_id":"nist-dads.orderedlinkedlist","source_sha256":"7186333e471776dacda59238d3966aec024b2f5f8569789e7610c0deb8fa3b17","start":69}],"target_id":"concept.nist.orderedlinkedlist","target_kind":"node","target_sha256":"5bec7bb077f3f20b543407464234ce6b1276a2db33ba184704915e6592177fe5"}],"concept.nist.orderedtree":[{"id":"assertion.concept.nist.orderedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered tree as: A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.","support":[{"end":172,"quote":"A\ntree\nwhere the\nchildren\nof every\nnode\nare ordered, that is, there is a first child, second child, third child, etc.","source_id":"nist-dads.orderedtree","source_sha256":"1b204f1a7ae2d9083fc6607c7f60eb5ee4cc1b0656a7e6c809914956a3949928","start":55}],"target_id":"concept.nist.orderedtree","target_kind":"node","target_sha256":"e7b8a13ee3235d80ab6a21c316af5b63133f7376b80f2278c1dd46ab5a0dbf06"}],"concept.nist.orthogonaldrawing":[{"id":"assertion.concept.nist.orthogonaldrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonal drawing as: A graph drawing in which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","support":[{"end":183,"quote":"A\ngraph drawing\nin which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","source_id":"nist-dads.orthogonaldrawing","source_sha256":"109589b40988bec437ab3fb87bafadfd1326d17c56946d7f2164ab501a22ffe2","start":63}],"target_id":"concept.nist.orthogonaldrawing","target_kind":"node","target_sha256":"6eced1a6bf85b6468d788aa661b463a1d419b97fced3a1ad4c9c237eb829f617"}],"concept.nist.orthogonallists":[{"id":"assertion.concept.nist.orthogonallists","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonal lists as: Lists that share items, but are structurally independent.","support":[{"end":120,"quote":"Lists\nthat share items, but are structurally independent.","source_id":"nist-dads.orthogonallists","source_sha256":"90936cd45e0bf8aad4fc2fb73e73d1c5283e923a3ca0d6e00ef72b1d3610273a","start":63}],"target_id":"concept.nist.orthogonallists","target_kind":"node","target_sha256":"2fb23f55d420b2b8df7f18f8cc9fe043909f82e4255b5f373350917dd787a5b1"}],"concept.nist.orthogoncnvx":[{"id":"assertion.concept.nist.orthogoncnvx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonally convex rectilinear polygon as: A rectilinear polygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","support":[{"end":224,"quote":"A\nrectilinear\npolygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","source_id":"nist-dads.orthogoncnvx","source_sha256":"580d955d8c2f38cf93b6e8a1345c314c72e59cf28451fff6f567a99044c24921","start":105}],"target_id":"concept.nist.orthogoncnvx","target_kind":"node","target_sha256":"ed893c3bf8ea3be51b228f3d4129419187385d83a620e92cfd42af32be20274b"}],"concept.nist.outdegree":[{"id":"assertion.concept.nist.outdegree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines out-degree as: The number of edges going out of a vertex in a directed graph .","support":[{"end":110,"quote":"The number of\nedges\ngoing out of a\nvertex\nin a\ndirected graph\n.","source_id":"nist-dads.outdegree","source_sha256":"29b10f711533ed9f2fd0ff4eaae58ecbd6f2430fa9b416d6f8a5f294f6ad70e6","start":47}],"target_id":"concept.nist.outdegree","target_kind":"node","target_sha256":"579810debcefb92f3bf6ba96c7c0d12e7785fac22c356107b79364d07199cdd6"}],"concept.nist.p":[{"id":"assertion.concept.nist.p","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines P as: The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time .","support":[{"end":138,"quote":"The\ncomplexity class\nof languages that can be accepted by a deterministic\nTuring machine\nin\npolynomial time\n.","source_id":"nist-dads.p","source_sha256":"6fe00ca23395b54d8b3f936a474cdd122c9bcf4a784e4a9b0fd3bc858a05feec","start":29}],"target_id":"concept.nist.p","target_kind":"node","target_sha256":"5602ddadcc10e5e63119ba4b46f562033d4ca36a744776aa26b99b3bc5485793"}],"concept.nist.packing":[{"id":"assertion.concept.nist.packing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines packing as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","support":[{"end":162,"quote":"Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","source_id":"nist-dads.packing","source_sha256":"ccb2c5e99e6705a7db857b72ae9c0dc0f678112a678d6f71a781d3652fdc896b","start":41}],"target_id":"concept.nist.packing","target_kind":"node","target_sha256":"964c38a25b5fe459b09bd17974f082d98e2eccb2d37728f7a9ddcdf2b2ef4252"}],"concept.nist.paddingrgmnt":[{"id":"assertion.concept.nist.paddingrgmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines padding argument as: A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","support":[{"end":224,"quote":"A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","source_id":"nist-dads.paddingrgmnt","source_sha256":"7717fc75166f144549787f050e60dc21ce54750ac9b3a18b7298eb8856ceaeae","start":59}],"target_id":"concept.nist.paddingrgmnt","target_kind":"node","target_sha256":"e0bd837934e39e1c2c1bf785c4ddb2748fbbd8bb8be6b744fbe48fc8564eb69b"}],"concept.nist.pagoda":[{"id":"assertion.concept.nist.pagoda","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pagoda as: A priority queue implemented with a variant of a binary tree . The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child ) or rightmost (if it is a left child) descendant leaf . The basic operation is merge or meld , which maintains the heap property . An element is inserted by merging it as a singleton. The root is removed by merging its right and left children. Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","support":[{"end":596,"quote":"A\npriority queue\nimplemented with a variant of a\nbinary tree\n.  The\nroot\npoints to its children, as in a binary tree.  Every other\nnode\npoints back to its\nparent\nand down to its leftmost (if it is a right\nchild\n) or rightmost (if it is a left child)\ndescendant\nleaf\n.  The basic operation is merge or\nmeld\n, which maintains  the\nheap property\n.  An element is inserted by merging it as a singleton.  The\nroot\nis removed by merging its right and left children.  Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","source_id":"nist-dads.pagoda","source_sha256":"3cd82e5be6c92b2c80f99974a0534e2b5a43e94136fd1c8ff0976806a8758eff","start":43}],"target_id":"concept.nist.pagoda","target_kind":"node","target_sha256":"eafb0cac0f9741c185fee73383e44a4ffbb3a03d52c49bfcf45f8f81572ecf00"}],"concept.nist.parallel":[{"id":"assertion.concept.nist.parallel","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parallel computation thesis as: Sequential space is a polynomial of parallel time.","support":[{"end":131,"quote":"Sequential space is a\npolynomial\nof parallel time.","source_id":"nist-dads.parallel","source_sha256":"7ee636d93ace5a7f2fc7373b1012cedc316d35ed4ce87b2f4c84eb7058581ea6","start":81}],"target_id":"concept.nist.parallel","target_kind":"node","target_sha256":"339b9ecd5c3b87c1799c74a4f5d858bd9c2e21cffb9cfcd4b993afae587eb5c1"}],"concept.nist.parallelrandomaccessmachine":[{"id":"assertion.concept.nist.parallelrandomaccessmachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parallel random-access machine as: A shared memory model of computation , where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time. Also known as PRAM.","support":[{"end":279,"quote":"A\nshared memory\nmodel of computation\n, where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time.\nAlso known as\nPRAM.","source_id":"nist-dads.parallelrandomaccessmachine","source_sha256":"83d99410a75330434cb1c50841fab6d0be7c573decdaa439610afa8171aca63c","start":87}],"target_id":"concept.nist.parallelrandomaccessmachine","target_kind":"node","target_sha256":"6b8c221cd39336ec86e9e3362949da715b2672a90a3ba7c171aef614e33d3878"}],"concept.nist.parent":[{"id":"assertion.concept.nist.parent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parent as: Of a node : the tree node conceptually above or closer to the root than the node and which has a link to the node. See the figure at tree .","support":[{"end":179,"quote":"Of a\nnode\n: the\ntree\nnode conceptually above or closer to the\nroot\nthan the node and which has a\nlink\nto the node.  See the figure at\ntree\n.","source_id":"nist-dads.parent","source_sha256":"5d35086abcde029056d8c479c92138fefad6faad01cacdd665a4998808a41fae","start":39}],"target_id":"concept.nist.parent","target_kind":"node","target_sha256":"e32ef30ab0016cf23f42bf7cc2fb634c6a08e65458211f83096eca915c0e74bb"}],"concept.nist.partialfunct":[{"id":"assertion.concept.nist.partialfunct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial function as: A function which is not defined for some inputs of the right type, that is, for some of a domain . For instance, division is a partial function since division by 0 is undefined (on the Reals).","support":[{"end":252,"quote":"A\nfunction\nwhich is not defined for some inputs of the right type, that is, for some of a\ndomain\n.  For instance, division is a partial function since division by 0 is undefined (on the Reals).","source_id":"nist-dads.partialfunct","source_sha256":"fb13dd7540112d80e94fd24cebbbe75d5f0a5422460107833b3a0a512ad01197","start":59}],"target_id":"concept.nist.partialfunct","target_kind":"node","target_sha256":"dd6fb7a409c204de8e1ddacb18e71cfbc97c10cb8076689ada81dcfba33afdaf"}],"concept.nist.partiallydecidableprob":[{"id":"assertion.concept.nist.partiallydecidableprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially decidable problem as: One whose associated language is a recursively enumerable language . Equivalently, there exists an algorithm that halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","support":[{"end":351,"quote":"One whose associated\nlanguage\nis a\nrecursively enumerable language\n.  Equivalently, there exists an\nalgorithm\nthat halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","source_id":"nist-dads.partiallydecidableprob","source_sha256":"f149ae12ddc8558315735d53a542067c48f5ddc9fea1cab0dfa5d93a99774b95","start":81}],"target_id":"concept.nist.partiallydecidableprob","target_kind":"node","target_sha256":"0b800f1d0d8efcb42eac28347aa353c7d8749c0549d0afb341521a3d65e877d3"}],"concept.nist.partiallydynamicgraph":[{"id":"assertion.concept.nist.partiallydynamicgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially dynamic graph problem as: Problem where the update operations include either edge insertions (incremental) or deletions (decremental).","support":[{"end":197,"quote":"Problem where the update operations include either\nedge\ninsertions (incremental) or deletions (decremental).","source_id":"nist-dads.partiallydynamicgraph","source_sha256":"ec2e91d4bd1f1b4456af1fcacb1d72cc597c837d91c8a069f8661d92fd0d2072","start":89}],"target_id":"concept.nist.partiallydynamicgraph","target_kind":"node","target_sha256":"c1959c2074ba68b755b1aba3e6a400e9dce6ed6bd6413b8ef83669fa10525534"}],"concept.nist.partiallypersistdata":[{"id":"assertion.concept.nist.partiallypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially persistent data structure as: A persistent data structure that allows updates to the latest version only.","support":[{"end":172,"quote":"A\npersistent data structure\nthat allows updates to the latest version only.","source_id":"nist-dads.partiallypersistdata","source_sha256":"009078e421ae5932256c9a0fc91a5faf237070a432b49f71e76df3a677505108","start":97}],"target_id":"concept.nist.partiallypersistdata","target_kind":"node","target_sha256":"49b1caecb7cffdc1ce0de1a89e1a77eabfc0c7783ad4928a6e7ef9bd77bba644"}],"concept.nist.partialorder":[{"id":"assertion.concept.nist.partialorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial order as: An order defined for some, but not necessarily all, pairs of items. For instance, the sets {a, b} and {a, c, d} are subsets of {a, b, c, d}, but neither is a subset of the other. So \"subset of\" is a partial order on sets. Formal Definition: A partial order is a binary relation that is reflexive , transitive , and antisymmetric .","support":[{"end":386,"quote":"An order defined for some, but not necessarily all, pairs of items.  For instance, the\nsets\n{a, b} and {a, c, d} are\nsubsets\nof {a, b, c, d}, but neither is a subset of the other.  So  \"subset of\" is a partial order on sets.\nFormal Definition:\nA partial order is a\nbinary relation\nthat is\nreflexive\n,\ntransitive\n, and\nantisymmetric\n.","source_id":"nist-dads.partialorder","source_sha256":"1dcae29844b617795fa27021ddeb61fa705bb12269a5c71b818de1a772761f0c","start":53}],"target_id":"concept.nist.partialorder","target_kind":"node","target_sha256":"d4603fb7aa2b38ff3ba8a35432958485f12bf1c86592d0a92626939e1808c62f"}],"concept.nist.partialrcrsv":[{"id":"assertion.concept.nist.partialrcrsv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial recursive function as: A function computed by a Turing machine that need not halt for all inputs.","support":[{"end":153,"quote":"A\nfunction\ncomputed by a\nTuring machine\nthat need not halt for all inputs.","source_id":"nist-dads.partialrcrsv","source_sha256":"acaeebcd2f802f2235c1dbba5a6e720c706b33f566c218657447029a8ba5973d","start":79}],"target_id":"concept.nist.partialrcrsv","target_kind":"node","target_sha256":"e0a01c231ecd3833099c1f54cd0a3b8e66ffbcc1661db3f8a2415ebb4e5c546e"}],"concept.nist.passivedatastruc":[{"id":"assertion.concept.nist.passivedatastruc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines passive data structure as: A data structure that is only changed by external threads or processes, in contrast to an active data structure .","support":[{"end":188,"quote":"A\ndata structure\nthat is only changed by external threads or processes, in contrast to an\nactive data structure\n.","source_id":"nist-dads.passivedatastruc","source_sha256":"736de7201a9fbd1cba7fb10ebf48459c2e49728e147f6106c922301969d7fb18","start":75}],"target_id":"concept.nist.passivedatastruc","target_kind":"node","target_sha256":"2c2ffffe036aa5dc27b6879069c6353aca415039a09675059dd359307a719f68"}],"concept.nist.path":[{"id":"assertion.concept.nist.path","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines path as: A list of vertices of a graph where each vertex has an edge between it and the next vertex.","support":[{"end":126,"quote":"A list of\nvertices\nof a\ngraph\nwhere each vertex has an\nedge\nbetween it and the next vertex.","source_id":"nist-dads.path","source_sha256":"7e950b3c91dea7f3f28931c2b7be5f8984391458769fd8ddf1f509ee9b582abf","start":35}],"target_id":"concept.nist.path","target_kind":"node","target_sha256":"f947430f8897c7e3bddf1777f0f64b25aab78a2335dcdc8098703ca16425c864"}],"concept.nist.pathsystem":[{"id":"assertion.concept.nist.pathsystem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines path system problem as: For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","support":[{"end":300,"quote":"For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible\nvertex\nin S.  A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","source_id":"nist-dads.pathsystem","source_sha256":"7f8957cc78e0d683af4e36d08fb2c969f96e42d86393173083fbc5f011b03c56","start":70}],"target_id":"concept.nist.pathsystem","target_kind":"node","target_sha256":"56c91956d471f648a8895ea68dcd941a5bf5c8195344511fcf7943e423b5702e"}],"concept.nist.pattern":[{"id":"assertion.concept.nist.pattern","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pattern as: A finite number of strings that are searched for in texts .","support":[{"end":100,"quote":"A finite number of\nstrings\nthat are searched for in\ntexts\n.","source_id":"nist-dads.pattern","source_sha256":"fc6818a79ffaa951598ae9c335ae1348fb6b37ce3c98fdaa6e7b1a0446215408","start":41}],"target_id":"concept.nist.pattern","target_kind":"node","target_sha256":"ae8dd9a672632f421096b39216b1b50aeeea61f73e0e77835765e3086a66c5ed"}],"concept.nist.patternelmnt":[{"id":"assertion.concept.nist.patternelmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pattern element as: A positive (negative) pattern element is a \"partial wild card\" presented as a subset of the alphabet Σ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","support":[{"end":270,"quote":"A positive (negative)\npattern\nelement is a \"partial wild card\" presented as a subset of the\nalphabet\nΣ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","source_id":"nist-dads.patternelmnt","source_sha256":"a8ab5dca3f60971f2863b8f4cebd83d6836418d939449a3c9f219a24a4d188cb","start":57}],"target_id":"concept.nist.patternelmnt","target_kind":"node","target_sha256":"0aa7054b7bf165c48e1381694c8d81189d9820f9614f9b6430a721ab38579073"}],"concept.nist.perfectbinarytree":[{"id":"assertion.concept.nist.perfectbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect binary tree as: A binary tree with all leaf nodes at the same depth . All internal nodes have degree 2.","support":[{"end":152,"quote":"A\nbinary tree\nwith all\nleaf\nnodes\nat the same\ndepth\n. All\ninternal nodes\nhave\ndegree\n2.","source_id":"nist-dads.perfectbinarytree","source_sha256":"6e9e0bdfabad4e02def4bc2e0f8286b058c33af35a058b3c6754b7ba408ab366","start":65}],"target_id":"concept.nist.perfectbinarytree","target_kind":"node","target_sha256":"8158068f959f0c37b02ffd1c35d329fc89dd7d5082659e9e936b49a625bf3a38"}],"concept.nist.perfectmatch":[{"id":"assertion.concept.nist.perfectmatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect matching as: A matching , or subset of edges without common vertices , of a connected graph that touches all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex.","support":[{"end":250,"quote":"A\nmatching\n, or subset of\nedges\nwithout common\nvertices\n, of a\nconnected graph\nthat touches all vertices exactly once.  A graph with an odd number of vertices is allowed one unmatched vertex.","source_id":"nist-dads.perfectmatch","source_sha256":"d7547a9afcfba475888acf51eb0da431154249aed51d6bee50e13616fdd9d8be","start":59}],"target_id":"concept.nist.perfectmatch","target_kind":"node","target_sha256":"bc655873472316dd5ee2d2af728df3abe96555e510cea59eb892232138b57a94"}],"concept.nist.performance":[{"id":"assertion.concept.nist.performance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines performance guarantee as: An expression of the most the result of an approximation algorithm may depart from the optimal solution .","support":[{"end":174,"quote":"An expression of the most the result of an\napproximation algorithm\nmay depart from the\noptimal solution\n.","source_id":"nist-dads.performance","source_sha256":"d8d64964f67d4c56e44788fc65d0b32f51416beb1bdfa83d42d0c2e3f2e97213","start":69}],"target_id":"concept.nist.performance","target_kind":"node","target_sha256":"e85a9c43da295ca8c6b78f2dc0009d4ddab1782efcbe582ab34a9e280ab07473"}],"concept.nist.persistentdatastructure":[{"id":"assertion.concept.nist.persistentdatastructure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines persistent data structure as: A data structure that preserves its old versions, that is, previous versions may be queried in addition to the latest version.","support":[{"end":203,"quote":"A\ndata structure\nthat preserves its old versions, that is, previous versions may be queried in addition to the latest version.","source_id":"nist-dads.persistentdatastructure","source_sha256":"1b9c18b284dca0141ec1aa7e8faaac7c784dacb1f16aa76450928d1d064e4052","start":77}],"target_id":"concept.nist.persistentdatastructure","target_kind":"node","target_sha256":"c9a6064e748899ae3ab9af61ae63c737292c18e0be92abd784f01fd1e6fb4c69"}],"concept.nist.phoneticcoding":[{"id":"assertion.concept.nist.phoneticcoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines phonetic coding as: Code a string based on how it is pronounced.","support":[{"end":106,"quote":"Code a\nstring\nbased on how it is pronounced.","source_id":"nist-dads.phoneticcoding","source_sha256":"ad89a179edce6ee17dc5c513f6397d67d96cf7fc02869ed49d91e7cf4404d7de","start":62}],"target_id":"concept.nist.phoneticcoding","target_kind":"node","target_sha256":"149177096e8650cc0b3db158d3cae4035b64d2db78399bd48f0db3751e25d34a"}],"concept.nist.pile":[{"id":"assertion.concept.nist.pile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pile as: An ordered deque , that is, items may only be added to or removed from the head or the tail . An item is added to the head if it is smaller than the current head. An item is added to the tail if it is greater than the current tail. Items are never inserted into the middle, rather, an additional pile may be created.","support":[{"end":359,"quote":"An ordered\ndeque\n, that is, items may only be added  to or removed from the\nhead\nor the\ntail\n. An item is added to the\nhead\nif it is smaller than the current head.  An item is added to the\ntail\nif it is greater than the current tail.  Items are never inserted into the  middle, rather, an additional pile may be created.","source_id":"nist-dads.pile","source_sha256":"f41923a8486059a8963c1ac276b8c56c71c5b650d4ac72153957b3233109f8b9","start":39}],"target_id":"concept.nist.pile","target_kind":"node","target_sha256":"af4786f49932712c05481321baf77c8357a3d207c477b203e46591f4a53ddcf7"}],"concept.nist.planargraph":[{"id":"assertion.concept.nist.planargraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planar graph as: A graph that can be drawn in the plane with no crossing edges .","support":[{"end":115,"quote":"A\ngraph\nthat can be drawn in the plane with no  crossing\nedges\n.","source_id":"nist-dads.planargraph","source_sha256":"137d4bee51f34dd142dd22bdf87fac8cfa558a8ab1a654ca216e537740db69e8","start":51}],"target_id":"concept.nist.planargraph","target_kind":"node","target_sha256":"25e63ea49b83560fb30efbe544e0bef21a99a28fe61b1cafe3e161afdec460d1"}],"concept.nist.planarization":[{"id":"assertion.concept.nist.planarization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planarization as: The process of transforming a graph into a planar graph . More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing vertices ). In both cases, the aim of planarization is minimize the number of edge removals or replacements.","support":[{"end":404,"quote":"The process of transforming a\ngraph\ninto a\nplanar graph\n. More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing\nvertices\n).  In both cases, the aim of planarization is minimize the number of edge removals or replacements.","source_id":"nist-dads.planarization","source_sha256":"f373a7dded13a27ff27327645b0ee06e05ae2e4b624e18c3c16674975077f801","start":53}],"target_id":"concept.nist.planarization","target_kind":"node","target_sha256":"9a89f66d58bfbd640d42e0ded1bffd5181b78dd2c5cbf416496a664a285b3e5e"}],"concept.nist.planarstrght":[{"id":"assertion.concept.nist.planarstrght","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planar straight-line graph as: A graph that can be embedded in the plane without crossings in which every edge in the graph is a straight line segment. It is sometimes referred to as planar subdivision or map.","support":[{"end":258,"quote":"A\ngraph\nthat can be embedded in the plane without crossings in which every\nedge\nin the graph is a straight line segment.  It is sometimes referred to as planar subdivision or map.","source_id":"nist-dads.planarstrght","source_sha256":"df701645883841790d8ece083a2519377d9b32cbbe8ca4b199e6fc261dd9d3cb","start":79}],"target_id":"concept.nist.planarstrght","target_kind":"node","target_sha256":"1eab6f0797786de164263ede52b8db655c89e0b9355708e3f18ee6e925efc84d"}],"concept.nist.plophashing":[{"id":"assertion.concept.nist.plophashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines PLOP-hashing as: Piecewise linear order-preserving (PLOP) hashing is a spatial access method which splits space into a nonperiodic grid. Each spatial dimension is divided by nodes of a binary tree . Object are stored in the grid cell of their centroid .","support":[{"end":293,"quote":"Piecewise linear order-preserving (PLOP) hashing is a\nspatial access method\nwhich splits space into a nonperiodic grid.  Each spatial dimension is divided by nodes of a\nbinary tree\n.  Object are stored in the grid cell of their\ncentroid\n.","source_id":"nist-dads.plophashing","source_sha256":"a1bfa62bcc1d36c82f2c40cc2c1b1651db84994beb61ea4dda669b163cc5bc60","start":55}],"target_id":"concept.nist.plophashing","target_kind":"node","target_sha256":"a9e2d249f6fa11655e3421abaabdb8ee22873bdbd7cf9e0372fbf9cc8d7771a9"}],"concept.nist.pointaccessmethod":[{"id":"assertion.concept.nist.pointaccessmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines point access method as: A data structure and associated algorithms primarily to search for points defined in multidimensional space. Also known as PAM.","support":[{"end":192,"quote":"A data structure and associated algorithms primarily to search for points defined in multidimensional space.\nAlso known as\nPAM.","source_id":"nist-dads.pointaccessmethod","source_sha256":"1a58d1d7224f1883d53f53421cad2ba5d4627df34821df3efaf7d6b0454469fb","start":65}],"target_id":"concept.nist.pointaccessmethod","target_kind":"node","target_sha256":"79c07dad90032cdbd67b58ed1d50418a767ad9fe65b07e71c12a841ae1f5dfe1"}],"concept.nist.pointerjumping":[{"id":"assertion.concept.nist.pointerjumping","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pointer jumping as: In a linked structure, replacing a pointer with the pointer it points to. Used for various algorithms on lists and trees . Also known as recursive doubling, shortcutting.","support":[{"end":228,"quote":"In a linked structure, replacing a pointer with the pointer it points to.  Used for various algorithms on\nlists\nand\ntrees\n.\nAlso known as\nrecursive doubling, shortcutting.","source_id":"nist-dads.pointerjumping","source_sha256":"fbf033193f6f5a7309c868e01e0375a5ba7e6d29b92f0c9938a500f230be15c8","start":57}],"target_id":"concept.nist.pointerjumping","target_kind":"node","target_sha256":"0f94b1fd93da3cd86f1e274402b14bfe1c6b5b569bbe3e3257c803f5fdf26015"}],"concept.nist.pointermachn":[{"id":"assertion.concept.nist.pointermachn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pointer machine as: A model of computation whose memory consists of an unbounded collection of registers, or records, connected by pointers. Each register may contain an arbitrary amount of additional information. No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","support":[{"end":375,"quote":"A\nmodel of computation\nwhose memory consists of an unbounded collection of registers, or records, connected by pointers.  Each register may contain an arbitrary amount of additional information.  No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","source_id":"nist-dads.pointermachn","source_sha256":"045a20b62318624b43702f95aabe2f88bb9e9c30fbd4e3d03a5157f2575b4316","start":57}],"target_id":"concept.nist.pointermachn","target_kind":"node","target_sha256":"d31bdd214f818ab83c8a5b8b54238432530071fbed28e3de9cfc817317921cc0"}],"concept.nist.poissonizatn":[{"id":"assertion.concept.nist.poissonizatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines poissonization as: To replace a deterministic input by poisson process, changing the model into a poisson model. A solution to the poisson model must be interpreted in the original model.","support":[{"end":224,"quote":"To replace a deterministic input by poisson process, changing the model into a poisson model.  A solution to the poisson model must be interpreted in the original model.","source_id":"nist-dads.poissonizatn","source_sha256":"1f4bc28d35d6e93f985345768498fb6947d88d5657ebcefacd7f5474ffed489c","start":55}],"target_id":"concept.nist.poissonizatn","target_kind":"node","target_sha256":"aac024642a6ace573ed23eda4bd2ad935d219a90009977edcc1433ad15155c93"}],"concept.nist.polychotomy":[{"id":"assertion.concept.nist.polychotomy","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polychotomy as: Division into many distinct classifications.","support":[{"end":93,"quote":"Division into many distinct classifications.","source_id":"nist-dads.polychotomy","source_sha256":"723d91521f9686607f857d04ebe295b1ba43db6485b06eacbeeae15de9aa85cf","start":49}],"target_id":"concept.nist.polychotomy","target_kind":"node","target_sha256":"fe62e3bafe44557f673d02c63968d5458fb44f8db4a2194855649be1bb5e0f42"}],"concept.nist.polynomhier":[{"id":"assertion.concept.nist.polynomhier","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial hierarchy as: The classes of languages accepted by k- alternating Turing machines , over all k≥ 0 and with initial state existential or universal. The bottom level (k=0) is the class P . The next level (k=1) comprises NP and co- NP .","support":[{"end":288,"quote":"The classes of\nlanguages\naccepted by k-\nalternating Turing machines\n, over all k≥ 0 and with initial state existential or universal.  The bottom level (k=0) is the class\nP\n.  The next level (k=1) comprises\nNP\nand co-\nNP\n.","source_id":"nist-dads.polynomhier","source_sha256":"fbc519035cebfc7ee94dcbc2f44146ada9790cda89ad14a0bd38e968f4fb5bd2","start":67}],"target_id":"concept.nist.polynomhier","target_kind":"node","target_sha256":"96b477aa2f202d1790c01242c5140d9cfd4eda45d752455848a4592082eabef8"}],"concept.nist.polynomialtm":[{"id":"assertion.concept.nist.polynomialtm","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines polynomial time as: When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(n k ) where k is a constant.","support":[{"end":218,"quote":"When the execution time of a computation, m(n), is no more than a\npolynomial\nfunction of the problem size, n. More formally m(n) =\nO(n\nk\n)\nwhere k is a constant.","source_id":"nist-dads.polynomialtm","source_sha256":"f236641add6fcfd4e3b053381d4ca2fd83e7198e60381b9e24f7f6351b3808ff","start":57}],"target_id":"concept.nist.polynomialtm","target_kind":"node","target_sha256":"49f3cb88e7e8ea0850a02aaddbcceb26345bd1499c3c93a4ca1ffabb627b0bec"}],"concept.nist.polynomtredc":[{"id":"assertion.concept.nist.polynomtredc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial-time reduction as: A transformation of one problem into another which is computable in polynomial time .","support":[{"end":162,"quote":"A transformation of one problem into another which is\ncomputable\nin\npolynomial time\n.","source_id":"nist-dads.polynomtredc","source_sha256":"7d5ca3d983408b1aaf4430ea521e0f144c58f4b026cd7547fac114b4da5c1b22","start":77}],"target_id":"concept.nist.polynomtredc","target_kind":"node","target_sha256":"bfc6fcd6df5d23082b2ac562a8361d63db333ae61f58b8fb0f92d6f3f59b83cf"}],"concept.nist.polytope":[{"id":"assertion.concept.nist.polytope","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polytope as: A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides. A generalization of polyhedron.","support":[{"end":197,"quote":"A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides.  A generalization of polyhedron.","source_id":"nist-dads.polytope","source_sha256":"db3b1b58f0fd8046166bb2e1c267c3d7816884a61836a6d3a973eab751485f4b","start":43}],"target_id":"concept.nist.polytope","target_kind":"node","target_sha256":"671131596b5c18f0a226c7e834cbfab728f8974345fe702d88195f5bff82380b"}],"concept.nist.poset":[{"id":"assertion.concept.nist.poset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines poset as: A set the elements of which are subject to a partial order . Also known as partially ordered set.","support":[{"end":134,"quote":"A\nset\nthe elements of which are subject to a\npartial order\n.\nAlso known as\npartially ordered set.","source_id":"nist-dads.poset","source_sha256":"fd94e25679d3186af2b75293b5117cb917ad8cf46d6fed9f34814a1c014022d9","start":37}],"target_id":"concept.nist.poset","target_kind":"node","target_sha256":"a65693096527c7ee9443a63a6d88292ccf057e57cb7287e92a2535e9cbd1c742"}],"concept.nist.postscorrespondprob":[{"id":"assertion.concept.nist.postscorrespondprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Post's correspondence problem as: Given a set of pairs of strings , find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem . Also known as PCP.","support":[{"end":325,"quote":"Given a\nset\nof pairs of\nstrings\n, find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an\nundecidable problem\n.\nAlso known as\nPCP.","source_id":"nist-dads.postscorrespondprob","source_sha256":"5ab151bc6ec5298ddbe9395d19cc31d16ee9fb726cc56f27d86c07705725bc0b","start":90}],"target_id":"concept.nist.postscorrespondprob","target_kind":"node","target_sha256":"2225f67581498c5ef887a13951f4b466b901fcd9f87e39c11caa43cdb04fbf1d"}],"concept.nist.potentialfnc":[{"id":"assertion.concept.nist.potentialfnc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines potential function as: A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","support":[{"end":171,"quote":"A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","source_id":"nist-dads.potentialfnc","source_sha256":"d99ac7a0e5e6167e9056d228442b5103cccbc5c09117554fe50052bf4a2f422f","start":63}],"target_id":"concept.nist.potentialfnc","target_kind":"node","target_sha256":"0f864adc35467132e3c6f9d240edc12c8d641317da8ef6d1cb84757ff7656878"}],"concept.nist.predicate":[{"id":"assertion.concept.nist.predicate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines predicate as: A function that returns true or false. Conceptually it tests for a condition.","support":[{"end":123,"quote":"A\nfunction\nthat returns true or false.  Conceptually it tests for a condition.","source_id":"nist-dads.predicate","source_sha256":"4180543f7fe07f2bc859f2a06ef583e77a5a24a70eab99e9c1a21f6e9756329d","start":45}],"target_id":"concept.nist.predicate","target_kind":"node","target_sha256":"dc3c2500265197f55a15deb3cffbe76df46ccdf48df96c8b48d2e8e823239d36"}],"concept.nist.prefix":[{"id":"assertion.concept.nist.prefix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prefix as: The beginning characters of a string . More formally a string v∈Σ * is a prefix of a string u∈Σ * if u=vu' for some string u'∈Σ * .","support":[{"end":171,"quote":"The beginning characters of a\nstring\n.  More formally a string v∈Σ\n*\nis a prefix of a string u∈Σ\n*\nif u=vu' for some string u'∈Σ\n*\n.","source_id":"nist-dads.prefix","source_sha256":"353994db3398f0d18d29d70c1afc88b11f9fec092303a9db69439971e1fd3a66","start":39}],"target_id":"concept.nist.prefix","target_kind":"node","target_sha256":"2472a4990602aec96ba019a84773d9e63470997d1a908f11a7b8c903086d1953"}],"concept.nist.prefixcode":[{"id":"assertion.concept.nist.prefixcode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prefix code as: Set of words such that no word of the set is a prefix of another word in the set. A prefix code may be represented by a coding tree .","support":[{"end":183,"quote":"Set of words such that no word of the set is a\nprefix\nof another word in the set.  A prefix code may be represented by a\ncoding tree\n.","source_id":"nist-dads.prefixcode","source_sha256":"fe5fcb44378501e74df30761311bef6a4f0a5894dc7cd3249a9277020ecfc395","start":49}],"target_id":"concept.nist.prefixcode","target_kind":"node","target_sha256":"e0a0818fa14466abfe7e414eea7e188eed31fb44961a723310b565c0049b171f"}],"concept.nist.primaryclustering":[{"id":"assertion.concept.nist.primaryclustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primary clustering as: The tendency for some collision resolution schemes to create long runs of filled slots near the hash function position of keys .","support":[{"end":191,"quote":"The tendency for some\ncollision resolution schemes\nto create long runs of filled slots near the\nhash function\nposition of\nkeys\n.","source_id":"nist-dads.primaryclustering","source_sha256":"932b8a1ededf644f1a321db9dd1821ce584d7fe9c69c114222c89ce8504e5c74","start":63}],"target_id":"concept.nist.primaryclustering","target_kind":"node","target_sha256":"2415694e59844969ab020d5d3ba27efc8dbec9b4d7d5b5efbf768e8ea3d5f8b4"}],"concept.nist.primitivealgorithm":[{"id":"assertion.concept.nist.primitivealgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primitive algorithm as: An algorithm in which all the computable steps are basic operations.","support":[{"end":133,"quote":"An\nalgorithm\nin which all the computable steps are basic operations.","source_id":"nist-dads.primitivealgorithm","source_sha256":"beec33cccff47c100cf5714fc1a7ec7ae972d9e0177ff702bb0f6e6b87356c90","start":65}],"target_id":"concept.nist.primitivealgorithm","target_kind":"node","target_sha256":"5ae67eb29afd64b41c3c668fe82ad308077976d43138bf9bd36915488e474080"}],"concept.nist.primitiverecursive":[{"id":"assertion.concept.nist.primitiverecursive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primitive recursive as: A total function that can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","support":[{"end":190,"quote":"A\ntotal function\nthat can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","source_id":"nist-dads.primitiverecursive","source_sha256":"4f274e8c0c73b494fda2595c806795045f89c6a3d8fb9ea002dd401446c0846b","start":65}],"target_id":"concept.nist.primitiverecursive","target_kind":"node","target_sha256":"0cd292d01cc2479c11578e3e4ba15f44d8a787e2fb50d8e78d5b697d48a9af45"}],"concept.nist.principle":[{"id":"assertion.concept.nist.principle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines principle of optimality as: In some optimization problems , components of a globally optimal solution are themselves globally optimal.","support":[{"end":179,"quote":"In some\noptimization problems\n, components of a globally optimal solution are themselves globally optimal.","source_id":"nist-dads.principle","source_sha256":"fd77f37583e5f07cd0e6b40df7d758724677aafd1a4ce14f95d1f69f5691be8e","start":73}],"target_id":"concept.nist.principle","target_kind":"node","target_sha256":"daf25c2b43e92b6f37a7cefecd1da63a6444e4226e071e833ea096e9bacc7403"}],"concept.nist.priorityque":[{"id":"assertion.concept.nist.priorityque","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines priority queue as: An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues ( meld ), delete an arbitrary item, and increase the priority of a item (decrease-key). Formal Definition: The operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with axiomatic semantics as follows. new() returns a priority queue min(insert(v, new())) = v dm(insert(v, new())) = new() min(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then v else min(insert(w, PQ)) dm(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then insert(w, PQ) else insert(v, dm(insert(w, PQ))) where PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","support":[{"end":1016,"quote":"An\nabstract data type\nto efficiently support finding the item with the highest priority across a series of operations.  The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum).  Some implementations also efficiently support join two priority queues (\nmeld\n), delete an arbitrary item, and increase the priority of a item (decrease-key).\nFormal Definition:\nThe operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a priority queue\nmin(insert(v, new())) = v\ndm(insert(v, new())) = new()\nmin(insert(v, insert(w, PQ))) = if priority(v) < \tpriority(min(insert(w, PQ))) then v else  \tmin(insert(w, PQ))\ndm(insert(v, insert(w, PQ))) = if priority(v) < \tpriority(min(insert(w, PQ))) then insert(w, PQ) \telse insert(v, dm(insert(w, PQ)))\nwhere PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","source_id":"nist-dads.priorityque","source_sha256":"32105ba757774ba6e94aa5875b4f3309c371e43ed73b48214d52b2de1dbd3cec","start":59}],"target_id":"concept.nist.priorityque","target_kind":"node","target_sha256":"64dc7ff90f11da34d7b31f5764fad9941cd1f8ea5b8a509caecb58dc1f048fc5"}],"concept.nist.prisonersdilemma":[{"id":"assertion.concept.nist.prisonersdilemma","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prisoner's dilemma as: Two prisoners are questioned separately about a crime they committed. Each may give evidence against the other or may say nothing. If both say nothing, they get a minor reprimand and go free because of lack of evidence. If one gives evidence and the other says nothing, the first goes free and the second is severely punished. If both give evidence, both are severely punished. The overall (globally) best strategy is for both to say nothing. However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome. In general, a situation where local optimization leads to the worst possible outcome globally.","support":[{"end":767,"quote":"Two prisoners are questioned separately about a crime they committed.  Each may give evidence against the other or may say nothing.  If both say nothing, they get a minor reprimand and go free because of lack of evidence.  If one gives evidence and the other says nothing, the first goes free and the second is severely punished.  If both give evidence, both are severely punished.  The overall (globally) best strategy is for both to say nothing.  However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome.\nIn general, a situation where\nlocal optimization\nleads to the worst possible outcome globally.","source_id":"nist-dads.prisonersdilemma","source_sha256":"db4be664b2e56cf04fcdfdc25a5f592e482806eccad6bed75d0bb828cc3f3e25","start":68}],"target_id":"concept.nist.prisonersdilemma","target_kind":"node","target_sha256":"3ac90a6495c968f2b4c6dc940a950ef5a326b1f90c0f80636731799e6d05bb63"}],"concept.nist.probabilisticallycheckableproof":[{"id":"assertion.concept.nist.probabilisticallycheckableproof","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistically checkable proof as: An interactive proof system in which provers follow a fixed strategy, that is, one not affected by any messages from the verifier. The prover's strategy for a given instance x of a decision problem can be represented by a finite oracle language B x , which constitutes a proof of the correct answer for x.","support":[{"end":399,"quote":"An\ninteractive proof system\nin which provers follow a fixed strategy, that is, one not affected by any messages from the verifier.  The prover's strategy for a given instance x of a\ndecision problem\ncan be represented by a finite oracle language B\nx\n, which constitutes a proof of the correct answer for x.","source_id":"nist-dads.probabilisticallycheckableproof","source_sha256":"47146be5a4e006b62a438f38f940997acf07b7b3a541a6e1afee341f1941969c","start":93}],"target_id":"concept.nist.probabilisticallycheckableproof","target_kind":"node","target_sha256":"f385e7ad697601704c8115c25c09a9c1f718dfcd16b41bf8c93914ab26276bcf"}],"concept.nist.probablalgo":[{"id":"assertion.concept.nist.probablalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistic algorithm as: Any algorithm that works for all practical purposes but has a theoretical chance of being wrong.","support":[{"end":169,"quote":"Any\nalgorithm\nthat works for all practical purposes but has a theoretical chance of being wrong.","source_id":"nist-dads.probablalgo","source_sha256":"da194e5bf89401e3c58804bdb83b989990678a8ef05368d2ef6c2997d72b609b","start":73}],"target_id":"concept.nist.probablalgo","target_kind":"node","target_sha256":"7d30993a58650fb0ce5c823e998a4689ca37000806c4e4177037f17bdddc3192"}],"concept.nist.probablturng":[{"id":"assertion.concept.nist.probablturng","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistic Turing machine as: A Turing machine in which some transitions are random choices among finitely many alternatives.","support":[{"end":178,"quote":"A\nTuring machine\nin which some transitions are random choices among finitely many alternatives.","source_id":"nist-dads.probablturng","source_sha256":"6bac07546f16ff443aeb49d259157df5299fcaf9cf19702bc08ced4e28a2ba6b","start":83}],"target_id":"concept.nist.probablturng","target_kind":"node","target_sha256":"451f780596120ebfe4f34f388b0b4721e8cbc38fca47a17766b82efa5d3fa1a5"}],"concept.nist.probesequenc":[{"id":"assertion.concept.nist.probesequenc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probe sequence as: The list of locations which a method for open addressing produces as alternatives in case of a collision .","support":[{"end":161,"quote":"The list of locations which a method for\nopen addressing\nproduces as alternatives in case of a\ncollision\n.","source_id":"nist-dads.probesequenc","source_sha256":"f4740292eb436ca677a1678e6bc1dbf05284b6d2153adaa76ca301145287a427","start":55}],"target_id":"concept.nist.probesequenc","target_kind":"node","target_sha256":"bd0de7c77cd5180d819f035834255c224ef303ed33214dfe78543b4176f8a0a4"}],"concept.nist.procedure":[{"id":"assertion.concept.nist.procedure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines procedure as: A subroutine which does not return a value.","support":[{"end":88,"quote":"A subroutine which does not return a value.","source_id":"nist-dads.procedure","source_sha256":"efd46638cd0f05856c4a4f08dffb59de87d3adf879e07c9af51197f156fb14da","start":45}],"target_id":"concept.nist.procedure","target_kind":"node","target_sha256":"c5f316a1783858445fcab47c28abe7ea670315201572d47920be1d3c93189ed6"}],"concept.nist.processalgbr":[{"id":"assertion.concept.nist.processalgbr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines process algebra as: An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS .","support":[{"end":161,"quote":"An algebraic theory to formalize the notion of concurrent computation, best exemplified in\nCSP\nand\nCCS\n.","source_id":"nist-dads.processalgbr","source_sha256":"306419616a58ff3f5130ef5c871b1f3daa41122860ddb1352c009283c13a6528","start":57}],"target_id":"concept.nist.processalgbr","target_kind":"node","target_sha256":"f2a9855afde1278d1999becc8ad27256aa1b2a49ff85a7a582060ba04997582f"}],"concept.nist.proper":[{"id":"assertion.concept.nist.proper","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper as: (1) A subunit of a unit is not equal to the unit itself. For instance, a proper substring is not the whole string , a proper subset is not the whole set , a proper subgraph is not the whole graph , etc. (2) According to a rule, as in proper coloring .","support":[{"end":292,"quote":"(1) A subunit of a unit is not equal to the unit itself.  For instance, a proper\nsubstring\nis not the whole\nstring\n, a proper\nsubset\nis not the whole\nset\n, a proper\nsubgraph\nis not the whole\ngraph\n, etc.  (2) According to a rule, as in\nproper coloring\n.","source_id":"nist-dads.proper","source_sha256":"ef8f6b7c4591892b236f26848f81b1c9ff1d5f11465d09a3ccd78a2ed1c9a8b3","start":39}],"target_id":"concept.nist.proper","target_kind":"node","target_sha256":"163f9b6e255ff0318c77886481ee8083e1387aed594bdfd7eeab38e27c21b8f7"}],"concept.nist.propercolor":[{"id":"assertion.concept.nist.propercolor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper coloring as: A vertex coloring or edge coloring of a graph in which no two adjacent vertices or edges have the same color.","support":[{"end":166,"quote":"A\nvertex coloring\nor\nedge coloring\nof a graph in which no two\nadjacent\nvertices\nor\nedges\nhave the same color.","source_id":"nist-dads.propercolor","source_sha256":"037546304242a2789d3135c1e9c7c6e5942b14c9874875c0ab319f17a033f1c1","start":57}],"target_id":"concept.nist.propercolor","target_kind":"node","target_sha256":"874e36d360f15774e2eba2983f392d24e46e202f11e4cbaa7cc4b744a4d16683"}],"concept.nist.propersubset":[{"id":"assertion.concept.nist.propersubset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper subset as: A set S 2 is a proper subset of another set S 1 if every element in S 2 is in S 1 and S 1 has some elements which are not in S 2 .","support":[{"end":183,"quote":"A\nset\nS\n2\nis a proper subset of another set S\n1\nif every element in S\n2\nis in S\n1\nand S\n1\nhas some elements which are not in S\n2\n.","source_id":"nist-dads.propersubset","source_sha256":"dbfaacf3605b1ad2c0245ea2b1a4d9396458f2ea805502927fb361f26ff8bd3b","start":53}],"target_id":"concept.nist.propersubset","target_kind":"node","target_sha256":"cadd8007071d9d6a3673569726f45f0e8b3b98f5a3c61dda478ed4c87d51b2eb"}],"concept.nist.ptree":[{"id":"assertion.concept.nist.ptree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines P-tree as: (1) A spatial access method that defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel. Space is split by hierarchically nested polytopes (multidimensional boxes with nonrectangular sides). The R-tree is a special case that has no additional hyperplanes. (2) A spatial access method that splits space by hierarchically nested polytopes. The R-tree is a special case in which all polytopes are boxes.","support":[{"end":488,"quote":"(1) A\nspatial access method\nthat defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel.  Space is split by hierarchically nested\npolytopes\n(multidimensional boxes with nonrectangular sides).  The\nR-tree\nis a special case that has no additional hyperplanes. (2) A\nspatial access method\nthat splits space by hierarchically nested polytopes. The\nR-tree\nis a special case in which all polytopes are boxes.","source_id":"nist-dads.ptree","source_sha256":"8c88ab2f5d707d00c395c63edf12d976b71b92cc04d187dc4645826a60621436","start":43}],"target_id":"concept.nist.ptree","target_kind":"node","target_sha256":"b6198ba9cc165b4e3b7a47161c8694fd97584c0b0af21ce03e75853587cf55d9"}],"concept.nist.purelyfnctnl":[{"id":"assertion.concept.nist.purelyfnctnl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines purely functional language as: A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","support":[{"end":350,"quote":"A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","source_id":"nist-dads.purelyfnctnl","source_sha256":"d8ce4f6d6aae379c9d5917badb11b68467d6360f058bcbc7de943b79bfd156bc","start":79}],"target_id":"concept.nist.purelyfnctnl","target_kind":"node","target_sha256":"e21396b73c4cc783e6a67e812cd3a62b93757b0752c3870d81507c7e14b0de3c"}],"concept.nist.pushdownautm":[{"id":"assertion.concept.nist.pushdownautm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pushdown automaton as: A restricted Turing machine where the tape acts as a pushdown store (or stack , where only the latest element can be read), with an extra one-way read-only input tape. Also known as PDA.","support":[{"end":249,"quote":"A restricted\nTuring machine\nwhere the tape acts as a pushdown store (or\nstack\n, where only the latest element can be read), with an extra one-way read-only input tape.\nAlso known as\nPDA.","source_id":"nist-dads.pushdownautm","source_sha256":"26061d8fc2755aa3a3700f0298e80bcc2eb1f0e0caa6a77c9aa2343d84056f65","start":63}],"target_id":"concept.nist.pushdownautm","target_kind":"node","target_sha256":"19aff45822d54ec5dd63f22fc94970aad8808feedea9ec05f0fb61bd78c94fde"}],"concept.nist.quadtrie":[{"id":"assertion.concept.nist.quadtrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quad trie as: A tree in which each node is split according to some subset of the key , typically a character.","support":[{"end":144,"quote":"A\ntree\nin which each\nnode\nis split according to some subset of the\nkey\n, typically a character.","source_id":"nist-dads.quadtrie","source_sha256":"909279489e3e681c44f0a31445499923398d2610ca646ad6d8228aa7be891911","start":49}],"target_id":"concept.nist.quadtrie","target_kind":"node","target_sha256":"3493d9408dafb6e92c7fe48071d2217930c1de6a99ae15f5dde505a5fc057544"}],"concept.nist.quantumcomputation":[{"id":"assertion.concept.nist.quantumcomputation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quantum computation as: Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","support":[{"end":201,"quote":"Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","source_id":"nist-dads.quantumcomputation","source_sha256":"0cea7d93bc76fcf6c1a94d1c0ac443c15478924ad76cd67b77ca8efdfeab445a","start":65}],"target_id":"concept.nist.quantumcomputation","target_kind":"node","target_sha256":"b2bd8ce292fc5dfe8d8d695292533236e16c1f313a1d9571fbbcc206bd83b60f"}],"concept.nist.queue":[{"id":"assertion.concept.nist.queue","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines queue as: A collection of items in which only the earliest added item may be accessed. Basic operations are add (to the tail ) or enqueue and delete (from the head ) or dequeue. Delete returns the item removed. Also known as \"first-in, first-out\" or FIFO. Formal Definition: It is convenient to define delete or dequeue in terms of remove and a new operation, front. The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with axiomatic semantics as follows. new() returns a queue front(add(v, new())) = v remove(add(v, new())) = new() front(add(v, add(w, Q))) = front(add(w, Q)) remove(add(v, add(w, Q))) = add(v, remove(add(w, Q))) where Q is a queue and v and w are values. Also known as FIFO.","support":[{"end":749,"quote":"A collection of items in which only the earliest added item may be accessed.  Basic operations are add (to the\ntail\n) or enqueue and delete (from the\nhead\n) or dequeue.  Delete returns the item removed.  Also known as \"first-in, first-out\" or FIFO.\nFormal Definition:\nIt is convenient to define delete or dequeue in terms of remove and a new operation, front.   The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a queue\nfront(add(v, new())) = v\nremove(add(v, new())) = new()\nfront(add(v, add(w, Q))) = front(add(w, Q))\nremove(add(v, add(w, Q))) = add(v, remove(add(w, Q)))\nwhere Q is a queue and v and w are values.\nAlso known as\nFIFO.","source_id":"nist-dads.queue","source_sha256":"c4ff1a7da89f0695f7ed8662c7f96c7a99b7e2243007f26975a75cc80f608967","start":41}],"target_id":"concept.nist.queue","target_kind":"node","target_sha256":"d33ee304dccb53a8688acc1f9abff2df1c81193d60b3be5f64005d6aaa94246e"}],"concept.nist.raggedmatrix":[{"id":"assertion.concept.nist.raggedmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ragged matrix as: A matrix having irregular numbers of items in each row.","support":[{"end":112,"quote":"A\nmatrix\nhaving irregular numbers of items in each row.","source_id":"nist-dads.raggedmatrix","source_sha256":"c378a72523e25ebd276e2899c37267ca624c695e9e28ca7621b8928e62403a68","start":57}],"target_id":"concept.nist.raggedmatrix","target_kind":"node","target_sha256":"4e45859ec00caabcb8f73765211cd10991ff1bfb54904358bf0ad9f1d01a2d36"}],"concept.nist.randomaccess":[{"id":"assertion.concept.nist.randomaccess","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random access machine as: A model of computation whose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","support":[{"end":281,"quote":"A\nmodel of computation\nwhose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","source_id":"nist-dads.randomaccess","source_sha256":"299ed7dc0709ede682fb8232688b97ce58b56690d714d8c4447b6a13bd8a5a5d","start":69}],"target_id":"concept.nist.randomaccess","target_kind":"node","target_sha256":"667fa695a4a31091ea448b0d46315a766715dae85002d236334378465c868c6e"}],"concept.nist.randomizedalgo":[{"id":"assertion.concept.nist.randomizedalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized algorithm as: An algorithm that makes random (or pseudorandom) choices.","support":[{"end":124,"quote":"An\nalgorithm\nthat makes random (or pseudorandom) choices.","source_id":"nist-dads.randomizedalgo","source_sha256":"11c645eb3713fb700639f0be7992b50d6ea98f16915ac2c4a82dbacd70680dcd","start":67}],"target_id":"concept.nist.randomizedalgo","target_kind":"node","target_sha256":"a4c6c8cffb55a60e40adcc55902f85a1ac27dad614e39993fc73cee840ad6d5a"}],"concept.nist.randomizedbinarysearchtree":[{"id":"assertion.concept.nist.randomizedbinarysearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized binary search tree as: A binary search tree in which nodes have a randomly assigned priority. Updates keep priorities in heap order instead of keeping balance information and doing rebalance operations. Also known as cartesian tree, RBST.","support":[{"end":305,"quote":"A\nbinary search tree\nin which\nnodes\nhave a randomly assigned priority.  Updates keep priorities in\nheap\norder instead of keeping\nbalance\ninformation and doing\nrebalance\noperations.\nAlso known as\ncartesian tree, RBST.","source_id":"nist-dads.randomizedbinarysearchtree","source_sha256":"cf5a29c36329a29705a3fe39ccb954adac44ef2722e7dcda1754444b5c7e48e9","start":89}],"target_id":"concept.nist.randomizedbinarysearchtree","target_kind":"node","target_sha256":"601c1f9a74feb7264b315b4c9c5c4dd203c23a2d7dfa34339f5085d1afda1821"}],"concept.nist.randomizedcomplexity":[{"id":"assertion.concept.nist.randomizedcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized complexity as: The expected running time of the best possible randomized algorithm over the worst input.","support":[{"end":158,"quote":"The expected running time of the best possible\nrandomized algorithm\nover the worst input.","source_id":"nist-dads.randomizedcomplexity","source_sha256":"b430e9d69d4e55d3238b668325d13407e6091fd262c992be2ed9824c79e3fd81","start":69}],"target_id":"concept.nist.randomizedcomplexity","target_kind":"node","target_sha256":"597371392d8f5fa1af0a8b7ad9aeb9c0417a718a994fb15e638517d2c94fe206"}],"concept.nist.range":[{"id":"assertion.concept.nist.range","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines range as: The possible results of a function or relation . For instance, the range of cosine is [-1,+1].","support":[{"end":132,"quote":"The possible results of a\nfunction\nor\nrelation\n.  For instance, the range of cosine is [-1,+1].","source_id":"nist-dads.range","source_sha256":"6b91baf644a9a135100ab7024bb48531644b5c43e8a46d233a098c1c622a1278","start":37}],"target_id":"concept.nist.range","target_kind":"node","target_sha256":"4684d7b43db14e6c6833460b908ad34879a5fef78653256e617428ea95e7e431"}],"concept.nist.rank":[{"id":"assertion.concept.nist.rank","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rank as: For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","support":[{"end":142,"quote":"For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","source_id":"nist-dads.rank","source_sha256":"a29a967d5972b1a7611f6c6d9f90c2ac24f27c63ea3e008c1d1c71d2a3c46368","start":35}],"target_id":"concept.nist.rank","target_kind":"node","target_sha256":"bf31c4f30c539d1899b6b3777bbd73aece7b4bc9ee61cc182e4ce7923e868960"}],"concept.nist.reachable":[{"id":"assertion.concept.nist.reachable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reachable as: A vertex v is reachable from another vertex u if there is a path of any length from u to v. Also known as reachability.","support":[{"end":164,"quote":"A\nvertex\nv is reachable from another vertex u if there is a\npath\nof any length from u to v.\nAlso known as\nreachability.","source_id":"nist-dads.reachable","source_sha256":"8f71d5fd22d20adc260bfe73baa296c9578024e65f59686956141be43a8da2a4","start":45}],"target_id":"concept.nist.reachable","target_kind":"node","target_sha256":"d606a285d7a904825a1e49c7480a8ac72b9ece50d55b8945f94812483ab85ac1"}],"concept.nist.recognizer":[{"id":"assertion.concept.nist.recognizer","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recognizer as: A finite state machine with one or more states designated as accepting states . An input string is accepted if there is a path from the start state to an accepting state.","support":[{"end":218,"quote":"A\nfinite state machine\nwith one or more\nstates\ndesignated as\naccepting states\n.  An input string is\naccepted\nif there is a\npath\nfrom the\nstart state\nto an accepting state.","source_id":"nist-dads.recognizer","source_sha256":"830ce0720f5c2885f764fb4204808cb171d8d80357e954ba1d2582a77857523a","start":47}],"target_id":"concept.nist.recognizer","target_kind":"node","target_sha256":"55bde2eb8a8d7f202256541539dedf8af0fcd58306ec3f4f0048eb872c89fd09"}],"concept.nist.rectangmatrx":[{"id":"assertion.concept.nist.rectangmatrx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectangular matrix as: An n × m matrix , or, one whose size may not be the same in both dimensions.","support":[{"end":143,"quote":"An n × m\nmatrix\n, or, one whose size may not be the same in both dimensions.","source_id":"nist-dads.rectangmatrx","source_sha256":"e44e6b2b67492f4e319f20d6cdddeae73667f4d03dca0f03a464031ec4b1198e","start":67}],"target_id":"concept.nist.rectangmatrx","target_kind":"node","target_sha256":"e9a23fbe7522df0f5d5d1488c497ceb2d8be86aa9c1d56814a6b2d853627297a"}],"concept.nist.rectilinear":[{"id":"assertion.concept.nist.rectilinear","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectilinear as: Distance, paths, lines, etc. which are always parallel to axes at right angles. For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","support":[{"end":218,"quote":"Distance, paths, lines, etc. which are always parallel to axes at right angles.  For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","source_id":"nist-dads.rectilinear","source_sha256":"433f899586a7d269634c72fb5dff26958db284060180662c53d5cbde91a4a0af","start":49}],"target_id":"concept.nist.rectilinear","target_kind":"node","target_sha256":"a2249eedc16db122a5c308885267ed54f1800f25c8a2df1d13b9e305ed2b5ee3"}],"concept.nist.rectilinearsteinertree":[{"id":"assertion.concept.nist.rectilinearsteinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectilinear Steiner tree as: A minimum-length rectilinear tree connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","support":[{"end":259,"quote":"A minimum-length\nrectilinear\ntree connecting a set of points, called\nterminals\n, in the plane.  This tree may include points other than the terminals, which are called\nSteiner points\n.","source_id":"nist-dads.rectilinearsteinertree","source_sha256":"8c8b465ab0590f42ddf9746c5f5ab4163bb0f6d2e68ef3cf8621cf1bb2460b2c","start":75}],"target_id":"concept.nist.rectilinearsteinertree","target_kind":"node","target_sha256":"918521c1f4ee0597aea9eb4f890cfece69bb5f969af7a16f8657060d76d0c586"}],"concept.nist.recurrence":[{"id":"assertion.concept.nist.recurrence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recurrence relation as: The specification of a sequence of values in terms of earlier values in the sequence and base values. Also known as recurrence equations.","support":[{"end":202,"quote":"The specification of a sequence of values in terms of earlier values in the sequence and base values.\nAlso known as\nrecurrence equations.","source_id":"nist-dads.recurrence","source_sha256":"99c86473df9b6a6a12f20ad586f12f24e0be0d7e1b0b1bbd7cf92fa81070f856","start":65}],"target_id":"concept.nist.recurrence","target_kind":"node","target_sha256":"5d52e24abd56ca2c3af2655baa1059577cf1f3f7d272b5b9b13c0266dd1b3968"}],"concept.nist.recursiontree":[{"id":"assertion.concept.nist.recursiontree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursion tree as: A method to analyze the complexity of an algorithm by diagramming the recursive function calls. Formal Definition: A recursion tree T(p) of degree p is either (i) null or (ii) has p children which are recursion trees.","support":[{"end":272,"quote":"A method to analyze the\ncomplexity\nof an\nalgorithm\nby diagramming the\nrecursive\nfunction calls.\nFormal Definition:\nA recursion tree T(p) of degree p is either (i)\nnull\nor (ii) has p\nchildren\nwhich are recursion trees.","source_id":"nist-dads.recursiontree","source_sha256":"925a91b0e84e742f4339a3b32337b392e33c44e7041421eb334da6f0457514bc","start":55}],"target_id":"concept.nist.recursiontree","target_kind":"node","target_sha256":"b5e9a91c14c74db33f45fc6e326799f251ee0f01ba201d374009c21cb1fc484c"}],"concept.nist.recursiontrm":[{"id":"assertion.concept.nist.recursiontrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursion termination as: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.","support":[{"end":179,"quote":"The point when conditions are met and a\nrecursive\nalgorithm ceases calling itself and begins to return values.","source_id":"nist-dads.recursiontrm","source_sha256":"986c4af38a1a754fcacca9266783ec435185e28298c168d289572b0465ce423c","start":69}],"target_id":"concept.nist.recursiontrm","target_kind":"node","target_sha256":"3f70a3ff57dd0d294d9a1c3d4650de518cc999aaa8a7c39bb658af076a0f49cc"}],"concept.nist.recursive":[{"id":"assertion.concept.nist.recursive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursive as: (1) A data structure that is partially composed of other instances of the data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements. (2) An algorithm in which functions might call themselves. For instance, quicksort or heapify .","support":[{"end":363,"quote":"(1) A data structure that is partially composed of other instances of the data structure.  For instance, a\ntree\nis composed of smaller trees (\nsubtrees\n) and\nleaf\nnodes\n, and a\nlist\nmay  have other lists as elements.  (2) An\nalgorithm\nin which functions might call themselves.  For instance,\nquicksort\nor\nheapify\n.","source_id":"nist-dads.recursive","source_sha256":"76c9ad8661aecb1338e32b8ab23d9033a980b828a95689e85401885f6abd3dc4","start":49}],"target_id":"concept.nist.recursive","target_kind":"node","target_sha256":"cd30dfc0b697e5bac0d51c0d98e3a0798bcd9c8f90533ecd931fb7434c3262ec"}],"concept.nist.recursivelyenumerablelang":[{"id":"assertion.concept.nist.recursivelyenumerablelang","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursively enumerable language as: A language accepted by a Turing machine .","support":[{"end":130,"quote":"A\nlanguage\naccepted by a\nTuring machine\n.","source_id":"nist-dads.recursivelyenumerablelang","source_sha256":"386138f985b4489033ec603e6ffd501521199cf473b33ee62524eed1c97e178a","start":89}],"target_id":"concept.nist.recursivelyenumerablelang","target_kind":"node","target_sha256":"d86cb4eaa04699ba28869906299a582215a24c72b793d9fae0a4a9b193645797"}],"concept.nist.recursivstrc":[{"id":"assertion.concept.nist.recursivstrc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursive data structure as: A data structure that is partially composed of smaller or simpler instances of the same data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements.","support":[{"end":304,"quote":"A\ndata structure\nthat is partially composed of smaller or simpler instances of the same data structure.  For instance, a\ntree\nis composed of smaller trees (\nsubtrees\n) and\nleaf\nnodes\n, and a\nlist\nmay have other lists as elements.","source_id":"nist-dads.recursivstrc","source_sha256":"45212c7e35167642ea559954f09e42aa558885063f954d0e45278c7b6b6854d5","start":75}],"target_id":"concept.nist.recursivstrc","target_kind":"node","target_sha256":"52097c303b6a987627183d81b12478290fe5d352c1050cf4116b25f3c4729a1c"}],"concept.nist.redblack":[{"id":"assertion.concept.nist.redblack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines red-black tree as: A nearly-balanced tree that uses an extra bit per node to maintain balance. No leaf is more than twice as far from the root as any other. Formal Definition: A red-black tree with n internal nodes has height at most 2log 2 (n+1). Also known as symmetric binary B-tree.","support":[{"end":327,"quote":"A nearly-balanced\ntree\nthat uses an extra bit per\nnode\nto maintain balance.  No\nleaf\nis more than twice as far from the\nroot\nas any other.\nFormal Definition:\nA red-black tree with n internal nodes has\nheight\nat most 2log\n2\n(n+1).\nAlso known as\nsymmetric binary B-tree.","source_id":"nist-dads.redblack","source_sha256":"36e40a62493ff1322fcabc1792be92210904dfe3b3faf9728f8f525557cc0cf0","start":59}],"target_id":"concept.nist.redblack","target_kind":"node","target_sha256":"48447e0258618b4a8521d6507e8c1259ae4b1e941b3bfdb6a78a10b5b67ac92f"}],"concept.nist.reducedbasis":[{"id":"assertion.concept.nist.reducedbasis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reduced basis as: A basis for a lattice that is nearly orthogonal.","support":[{"end":101,"quote":"A basis for a\nlattice\nthat is nearly orthogonal.","source_id":"nist-dads.reducedbasis","source_sha256":"bc14a84e41e71b5004e5821ff1e3906516cfd26b8d3790f6a8f8af66f820f576","start":53}],"target_id":"concept.nist.reducedbasis","target_kind":"node","target_sha256":"97b41e19e71d8ec6f19efd400a31a881b030dbf9f12227bca496ee34461995b5"}],"concept.nist.reduction":[{"id":"assertion.concept.nist.reduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reduction as: A computable transformation of one problem into another.","support":[{"end":101,"quote":"A\ncomputable\ntransformation of one problem into another.","source_id":"nist-dads.reduction","source_sha256":"8dcfc31135321f140c57ca99e021db990e594c440cb906c4a2873a38181172e0","start":45}],"target_id":"concept.nist.reduction","target_kind":"node","target_sha256":"7c8ca8734b823278bca663231a0d1f4dc599dc05b9484febfa7d4129e2c2b8c5"}],"concept.nist.reflexive":[{"id":"assertion.concept.nist.reflexive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reflexive as: A binary relation R for which a R a for all a.","support":[{"end":91,"quote":"A\nbinary relation\nR for which a R a for all a.","source_id":"nist-dads.reflexive","source_sha256":"b8e49f3c942f55be8a2f1d069b0e4ac7b54382949f4decd215224ed3622b789c","start":45}],"target_id":"concept.nist.reflexive","target_kind":"node","target_sha256":"4d242fd719c5e2388a197bba85cf2cc31e39975152dc2eb5f0491ff306fe0fec"}],"concept.nist.regular":[{"id":"assertion.concept.nist.regular","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines regular decomposition as: A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","support":[{"end":244,"quote":"A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","source_id":"nist-dads.regular","source_sha256":"d482dcdaf862622e2ec6019e44c19c8dcdfc2540637cddd91d69bf156675ed0e","start":69}],"target_id":"concept.nist.regular","target_kind":"node","target_sha256":"2aa12528bc044dba9ffdbe7c9ca6f2fd7e25338b1ec6b2e81b9ae6b26b5cbe0c"}],"concept.nist.relation":[{"id":"assertion.concept.nist.relation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relation as: A computation which takes some inputs and yields an output. Any particular input may yield different outputs at different times. Formally, a mapping from each element in the domain to one or more elements in the range .","support":[{"end":263,"quote":"A computation which takes some inputs and yields an output.  Any particular input may yield different outputs at different times. Formally, a mapping from each element in the\ndomain\nto one or more elements in the\nrange\n.","source_id":"nist-dads.relation","source_sha256":"fb9076fca055b7101e7054e1028fd5adc7f7cb3a8baf7ecd122bf706e1fa321e","start":43}],"target_id":"concept.nist.relation","target_kind":"node","target_sha256":"a7ad7bb3c06c9485d162d0f2b4fd5aa657003ddebe97579efdfdaca051e5bb22"}],"concept.nist.relational":[{"id":"assertion.concept.nist.relational","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relational structure as: The counterpart in formal logic of a data structure or class instance in the object-oriented sense. Examples are strings , directed graphs , and undirected graphs . Sets of relational structures generalize the notion of languages as sets of strings.","support":[{"end":322,"quote":"The counterpart in formal logic of a data structure or class instance in the object-oriented sense.  Examples are\nstrings\n,\ndirected graphs\n, and\nundirected graphs\n.  Sets of relational structures generalize the notion of\nlanguages\nas\nsets\nof strings.","source_id":"nist-dads.relational","source_sha256":"16d0fcfabfa3df28d5142ba8eefffa1796bd79fc6c86a1aa5f7d9fefe515d1f0","start":71}],"target_id":"concept.nist.relational","target_kind":"node","target_sha256":"cf16fe5c3f449432f85840b276233a190d8d7f12d7337987c1b5cdc5d57b0b6f"}],"concept.nist.relativeperformguar":[{"id":"assertion.concept.nist.relativeperformguar","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relative performance guarantee as: The maximum ratio by which the result of a ρ-approximation algorithm may depart from the optimal solution . Also known as performance ratio.","support":[{"end":227,"quote":"The maximum ratio by which the result of a\nρ-approximation algorithm\nmay depart from the\noptimal solution\n.\nAlso known as\nperformance ratio.","source_id":"nist-dads.relativeperformguar","source_sha256":"2029a854a9e47fae694a9303649bce94123bcd7ff97457913bc749087ce75873","start":87}],"target_id":"concept.nist.relativeperformguar","target_kind":"node","target_sha256":"6f51dd801931399d99fa9b7ff0dc5ad19d8653f8fb202d5714f1014ba43d56d0"}],"concept.nist.relaxation":[{"id":"assertion.concept.nist.relaxation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relaxation as: An optimization problem with an enlarged feasible region (and extended objective function ) compared with an original optimization problem. Typically, the relaxation is considerably easier to solve than the original.","support":[{"end":264,"quote":"An\noptimization problem\nwith an enlarged\nfeasible region\n(and extended\nobjective function\n) compared with an original optimization problem.  Typically, the relaxation is considerably easier to solve than the original.","source_id":"nist-dads.relaxation","source_sha256":"eaf877f30c8827b4557060bc0d65815a7533f100cfa5853cb2df13e3e194ba06","start":47}],"target_id":"concept.nist.relaxation","target_kind":"node","target_sha256":"ddba2f287da9117ac2e10cf04659bf66c587b65ac4eff02221042ddae7b10c49"}],"concept.nist.relaxedbalance":[{"id":"assertion.concept.nist.relaxedbalance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relaxed balance as: When rebalancing a search tree is independent of updating the tree.","support":[{"end":124,"quote":"When\nrebalancing\na\nsearch tree\nis independent of updating the tree.","source_id":"nist-dads.relaxedbalance","source_sha256":"3f310ac6d7d3720bc6915e96ae5ab9e7eadb2026e414e60afd717f9795742660","start":57}],"target_id":"concept.nist.relaxedbalance","target_kind":"node","target_sha256":"3cf96513d3c0883fea03fd8b22cac937ae519271bc14340669244fdd00380531"}],"concept.nist.rescalable":[{"id":"assertion.concept.nist.rescalable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rescalable as: An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the objective function for the second instance is (element-wise) λ times the objective function of the first instance. For such problems, the best one can hope for is a relative performance guarantee , not an absolute performance guarantee .","support":[{"end":440,"quote":"An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the\nobjective function\nfor the second instance is (element-wise) λ times the objective function of the first instance.  For such problems, the best one can hope for is a\nrelative performance guarantee\n, not an\nabsolute performance guarantee\n.","source_id":"nist-dads.rescalable","source_sha256":"47817ff7e9799a87b7347525bf5c41dfe6d5c46e958c7a5946e7d17657e77d16","start":47}],"target_id":"concept.nist.rescalable","target_kind":"node","target_sha256":"ac57bba6382fe7690aa68f976728505d6fd4349b511c30ce6e563c48e81189c8"}],"concept.nist.restricted":[{"id":"assertion.concept.nist.restricted","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines restricted universe sort as: A sort algorithm that operates on the basis that the keys are members of a restricted set of values. They may not require comparisons of keys to perform the sorting.","support":[{"end":241,"quote":"A\nsort\nalgorithm that operates on the basis that the\nkeys\nare members of a restricted set of values.  They may not require comparisons of keys to perform the sorting.","source_id":"nist-dads.restricted","source_sha256":"7196892288b8aa163758c6e81086c07f85447cd0050e1044f63a1fddebb0295f","start":75}],"target_id":"concept.nist.restricted","target_kind":"node","target_sha256":"ddf945516510feca8afff6c6baa5f2dcb8a0c03389d1974b6db89a890ce88225"}],"concept.nist.rfile":[{"id":"assertion.concept.nist.rfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines R-file as: A spatial access method which divides space into a hierarchically of nested boxes. Objects are indexed in the lowest cell which completely contains them.","support":[{"end":197,"quote":"A\nspatial access method\nwhich divides space into a hierarchically of nested boxes.  Objects are indexed in the lowest cell which completely contains them.","source_id":"nist-dads.rfile","source_sha256":"8a682d10c6cf6e6e02672076df3763ba1b96bde6c465ca80cccdb3f151b7cf8e","start":43}],"target_id":"concept.nist.rfile","target_kind":"node","target_sha256":"1b22db05d3272c118be0acd27d618b006a318a36024b2321de1cad40cad41ec7"}],"concept.nist.ricesmethod":[{"id":"assertion.concept.nist.ricesmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Rice's method as: A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","support":[{"end":164,"quote":"A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","source_id":"nist-dads.ricesmethod","source_sha256":"fb0e1307e876ddc8706cecff149dff8581cb6db2458049fefcde053cd17d8658","start":53}],"target_id":"concept.nist.ricesmethod","target_kind":"node","target_sha256":"5a3e63b6ec7215d1b4151cd5bda4977834d697fbfe568885cc3fafb1d32e9df6"}],"concept.nist.rightthreadedtree":[{"id":"assertion.concept.nist.rightthreadedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines right-threaded tree as: A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.","support":[{"end":185,"quote":"A variant of a\nthreaded tree\nin which only the right thread, i.e.\nlink\nto the successor, of each\nnode\nis maintained.","source_id":"nist-dads.rightthreadedtree","source_sha256":"7a2bfa8fa6d382203ca61ef5e3e311956a4045b96d32ee4fff780fb5c26ddbea","start":69}],"target_id":"concept.nist.rightthreadedtree","target_kind":"node","target_sha256":"a958d8097117f79e4ed760cc7768a039df5576aaf5b49f88af6c5779b5000d2b"}],"concept.nist.root":[{"id":"assertion.concept.nist.root","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines root as: The distinguished initial or fundamental item of a tree . The only item which has no parent . See the figure at tree .","support":[{"end":153,"quote":"The distinguished initial or fundamental item of a\ntree\n. The only item which has no\nparent\n. See the figure at\ntree\n.","source_id":"nist-dads.root","source_sha256":"a84705ca8087450fb735197553f6aef29e069858984bd587e808e1769e60d488","start":35}],"target_id":"concept.nist.root","target_kind":"node","target_sha256":"71b5906ebef4ddba274d87ad6a0a04d3fe658e56eef3e59b0aa853b519c04df7"}],"concept.nist.rootedtree":[{"id":"assertion.concept.nist.rootedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rooted tree as: A tree in which one node is designated as the root . Also known as oriented tree.","support":[{"end":130,"quote":"A\ntree\nin which one\nnode\nis designated as the\nroot\n.\nAlso known as\noriented tree.","source_id":"nist-dads.rootedtree","source_sha256":"a713f12102614a67d04817b631487a91d46ece84758b833c2f285bad3b40ab06","start":49}],"target_id":"concept.nist.rootedtree","target_kind":"node","target_sha256":"a956d47bc57494212a3d5e826e0ac2aa144637a9cc3c90ba5ebbbce8eaf8bbd5"}],"concept.nist.rotation":[{"id":"assertion.concept.nist.rotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rotation as: To switch children and parents among two or three adjacent nodes to restore balance to a tree .","support":[{"end":138,"quote":"To switch\nchildren\nand\nparents\namong two or three adjacent\nnodes\nto restore\nbalance\nto a\ntree\n.","source_id":"nist-dads.rotation","source_sha256":"9159b7850298a8521811e9b9e8ef02c50d339d96e91f26b6d943cf15ee880995","start":43}],"target_id":"concept.nist.rotation","target_kind":"node","target_sha256":"5df4fdeb3ed36f2857b920c76884d5334ac481d39f84227ded789f248849d910"}],"concept.nist.rp":[{"id":"assertion.concept.nist.rp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines RP as: The class of languages for which membership can be determined in polynomial time by a probabilistic Turing machine with no false acceptances and less than half false rejections. \"RP\" means \" R andomized P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that accepts or rejects any string in polynomial time . If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2. Also known as randomized polynomial time.","support":[{"end":517,"quote":"The class of\nlanguages\nfor which membership can be determined in\npolynomial time\nby a\nprobabilistic Turing machine\nwith no false acceptances and less than half false rejections.  \"RP\" means \"\nR\nandomized\nP\nolynomial\" time.\nFormal Definition:\nFor a language, S, there exists a\nprobabilistic Turing machine\n, M, that\naccepts\nor rejects any string in\npolynomial time\n.  If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2.\nAlso known as\nrandomized polynomial time.","source_id":"nist-dads.rp","source_sha256":"f721c38b148967aabda43c1ed9389a8e0383d2424f9e776481fb8532c45a84e5","start":31}],"target_id":"concept.nist.rp","target_kind":"node","target_sha256":"33d8e2794a02c1a1564a1faef70bffdf59c9d68e9751929b529cc8040aa52ead"}],"concept.nist.rtree":[{"id":"assertion.concept.nist.rtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines R-tree as: (1) A spatial access method that splits space with hierarchically nested, and possibly overlapping, boxes. The tree is height-balanced. (2) A recursion tree .","support":[{"end":202,"quote":"(1) A\nspatial access method\nthat splits space with hierarchically nested, and possibly overlapping, boxes.  The tree is height-balanced. (2) A\nrecursion tree\n.","source_id":"nist-dads.rtree","source_sha256":"7c356c0cf7461ff71672460ee2621c5f6c9294241f465711117ab608a87891b2","start":43}],"target_id":"concept.nist.rtree","target_kind":"node","target_sha256":"3fb20cdd2267e61414231fcf499e6ca574bb46812b149f9f35adeb1b61421a9a"}],"concept.nist.runtime":[{"id":"assertion.concept.nist.runtime","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines run time as: (1) The amount of time needed to execute an algorithm . (2) The time when a compiled program is executing, versus compile time.","support":[{"end":170,"quote":"(1) The amount of time needed to execute an\nalgorithm\n. (2) The time when a compiled program is executing, versus compile time.","source_id":"nist-dads.runtime","source_sha256":"bc2127bd0d9d87d7cb06109bbabc9527685b19c70577d9c9f1bf45da56cfa4b9","start":43}],"target_id":"concept.nist.runtime","target_kind":"node","target_sha256":"8282982cea5bbb76cb56a5b3f5a2de4d5778529f282f7db9a7ff9a6339a385c7"}],"concept.nist.saturatededge":[{"id":"assertion.concept.nist.saturatededge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines saturated edge as: An edge in a flow network which has the maximum possible flow.","support":[{"end":117,"quote":"An\nedge\nin a\nflow network\nwhich has the maximum possible flow.","source_id":"nist-dads.saturatededge","source_sha256":"35a1286f06514dd754d14143487542fda0bd410a766fc82672993a3b2b2e28d8","start":55}],"target_id":"concept.nist.saturatededge","target_kind":"node","target_sha256":"62ca34c9bfb0ac2b02d5b36319f68391f7c434f464ca1b993f3f2f3fc2df36c6"}],"concept.nist.sbbtree":[{"id":"assertion.concept.nist.sbbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines SBB tree as: A symmetric binary B-tree. Now known as a red-black tree .","support":[{"end":106,"quote":"A symmetric binary B-tree.  Now known as a\nred-black tree\n.","source_id":"nist-dads.sbbtree","source_sha256":"020f5df94f5e27a2b03775c47c5963dc92321c541e06bb627526f1e1e592f935","start":47}],"target_id":"concept.nist.sbbtree","target_kind":"node","target_sha256":"1aaa65b74adcb5f328b0c8102389e796f30ed16d5ecfe541c1003b149071c909"}],"concept.nist.searchtree":[{"id":"assertion.concept.nist.searchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines search tree as: A tree where every subtree of a node has keys less than any other subtree of the node to its right. The keys in a node are conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","support":[{"end":309,"quote":"A\ntree\nwhere every\nsubtree\nof a\nnode\nhas\nkeys\nless than any other subtree of the node to its right.  The keys in a\nnode\nare conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","source_id":"nist-dads.searchtree","source_sha256":"9d64e84433f575fc36700b4e1ffbc5b42ef54dd08c09a4228f76e533e9f9a1ec","start":53}],"target_id":"concept.nist.searchtree","target_kind":"node","target_sha256":"414c0e8ae1991d095627e28e835a8f8ea64be81b25c1870adf425340990c50d1"}],"concept.nist.searchtrprop":[{"id":"assertion.concept.nist.searchtrprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines search tree property as: When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child.","support":[{"end":185,"quote":"When the key of every\nnode\nof a\nbinary tree\nis larger than the key of its left\nchild\nand smaller than its right child.","source_id":"nist-dads.searchtrprop","source_sha256":"3a74eb3d03c5292186abbe63ced6553b05cffcc014b32a29221d53b91ee6a900","start":67}],"target_id":"concept.nist.searchtrprop","target_kind":"node","target_sha256":"3b824410f5872678ef48eb379d452389d01fdee9af94506c612dc32fcb902c7e"}],"concept.nist.secondaryclustering":[{"id":"assertion.concept.nist.secondaryclustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines secondary clustering as: The tendency for some collision resolution schemes to create long run of filled slots away from a key hash position, e.g., along the probe sequence .","support":[{"end":216,"quote":"The tendency for some\ncollision resolution schemes\nto create long run of filled slots away from a\nkey\nhash\nposition, e.g., along the\nprobe sequence\n.","source_id":"nist-dads.secondaryclustering","source_sha256":"6b17786c58066fd11d05e8f333eaccd2a693ab597edcbfa5ac65d97f610e009e","start":67}],"target_id":"concept.nist.secondaryclustering","target_kind":"node","target_sha256":"22ea1def30f14030867d7ff8ac7fbab3642529567ef61ffb96a92f018890bb7f"}],"concept.nist.segment":[{"id":"assertion.concept.nist.segment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines segment as: (1) The substring of a pattern delimited by two don't cares or one don't care and beginning or end of the pattern. (2) A substring .","support":[{"end":174,"quote":"(1) The\nsubstring\nof a\npattern\ndelimited by two\ndon't cares\nor one don't care and beginning or end of the pattern.  (2) A\nsubstring\n.","source_id":"nist-dads.segment","source_sha256":"535908fd9c3e8f5da276dab093c2b967c69ef318b7094500e63ad463ecb10275","start":41}],"target_id":"concept.nist.segment","target_kind":"node","target_sha256":"69f2ead929ec24c447ee6bfc3ac59115a6f13c448b48295799d3fe1dff8525fd"}],"concept.nist.selectandpartition":[{"id":"assertion.concept.nist.selectandpartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines select and partition as: Given an array A of n elements and a positive integer k ≤ n, find the k th smallest element of A and partition the array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","support":[{"end":244,"quote":"Given an\narray\nA of n elements and a positive integer k ≤ n, find the k\nth\nsmallest element of A and\npartition\nthe array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","source_id":"nist-dads.selectandpartition","source_sha256":"4b43ed02e52fb6e0982e989c83e051a892fe7999434b2b02082be80c2d87c9cd","start":72}],"target_id":"concept.nist.selectandpartition","target_kind":"node","target_sha256":"0da7b5dc0a4848735cf2666565db00470beffbab54ab3da3c5625f415992203e"}],"concept.nist.selfloop":[{"id":"assertion.concept.nist.selfloop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines self-loop as: An edge of a graph which starts and ends at the same vertex .","support":[{"end":106,"quote":"An\nedge\nof a\ngraph\nwhich starts and ends at the same\nvertex\n.","source_id":"nist-dads.selfloop","source_sha256":"e0b6b96dd2061131cc588d9832f3b52bc1ecf78cc7dd2ec97e8e577f75ceeb3a","start":45}],"target_id":"concept.nist.selfloop","target_kind":"node","target_sha256":"6b1934a7280a61ca161208ae4b8ae689a73055a231cf9016cfb789995860db25"}],"concept.nist.selforganizinglist":[{"id":"assertion.concept.nist.selforganizinglist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines self-organizing list as: A list that reorders the elements based on some self-organizing heuristic [Wikipedia] to improve average access time.","support":[{"end":188,"quote":"A\nlist\nthat reorders the elements based on some\nself-organizing heuristic [Wikipedia]\nto improve average access time.","source_id":"nist-dads.selforganizinglist","source_sha256":"2d045ceee5ef18709c2e0055bc02d3eb167a84e28aeaffb38755975e9ab7dc53","start":71}],"target_id":"concept.nist.selforganizinglist","target_kind":"node","target_sha256":"70b53d84ec7ebe46f8b378653b4f050c97e0014b2f3636ba586c683794b6021e"}],"concept.nist.semidefinite":[{"id":"assertion.concept.nist.semidefinite","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines semidefinite programming as: A generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix.","support":[{"end":198,"quote":"A generalization of a\nlinear program\nin which any subset of the variables may be constrained to form a semidefinite matrix.","source_id":"nist-dads.semidefinite","source_sha256":"a5050e6dd63523882244b3d005e1fb044ac362364194db9dca1ae4a33ff6641b","start":75}],"target_id":"concept.nist.semidefinite","target_kind":"node","target_sha256":"08a64e5ee7635e45e94563812bd3dc1a7858948117fdcd34afe3e7eb1dc7b962"}],"concept.nist.separatechaining":[{"id":"assertion.concept.nist.separatechaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines separate chaining as: A scheme in which each position in the hash table has a list to handle collisions . Each position may be just a link to the list ( direct chaining ) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list. Also known as external chaining.","support":[{"end":394,"quote":"A scheme in which each position in the\nhash table\nhas a\nlist\nto handle\ncollisions\n.  Each position may be just a\nlink\nto the list (\ndirect chaining\n) or may be an item and a link, essentially, the\nhead\nof a list. In the latter, one item is in the table, and other colliding items are in the list.\nAlso known as\nexternal chaining.","source_id":"nist-dads.separatechaining","source_sha256":"56ca57d8896e3fdf64ff345c17771235bec7c3feebbf7d6e7c6c39d18a430251","start":65}],"target_id":"concept.nist.separatechaining","target_kind":"node","target_sha256":"e2be721cbcc02a468bb6cae6d1d66ead7d8b9725cae8542cc546b251254ac387"}],"concept.nist.separatnthrm":[{"id":"assertion.concept.nist.separatnthrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines separation theorem as: A theorem showing that two complexity classes are distinct. Most separation theorems have been proved by diagonalization .","support":[{"end":185,"quote":"A theorem showing that two\ncomplexity classes\nare distinct. Most separation theorems have been proved by\ndiagonalization\n.","source_id":"nist-dads.separatnthrm","source_sha256":"9615361196735796b1491e9301a20b27e2f4b5b02a513128db0cd000bace44c5","start":63}],"target_id":"concept.nist.separatnthrm","target_kind":"node","target_sha256":"fe6ad253628c979df29395677868732c24eac19b2bd034e368ada21ee791027c"}],"concept.nist.set":[{"id":"assertion.concept.nist.set","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines set as: An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a universe , (2) either each element is a member of the set or it is not, and (3) the elements are unordered. Formal Definition: As an abstract data type , a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with axiomatic semantics as follows. new() returns a set isIn(v, new()) = false isIn(v, add(v, S)) = true isIn(v, add(u, S)) = isIn(v , S) if v ≠ u remove(v, new()) = new() remove(v, add(v, S)) = remove(v, S) remove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u where S is a set and u and v are elements. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, S)) = false","support":[{"end":952,"quote":"An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a\nuniverse\n, (2) either each element is a\nmember\nof the set or it is not, and (3) the elements are unordered.\nFormal Definition:\nAs an\nabstract data type\n, a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with\naxiomatic semantics\nas follows.\nnew() returns a set\nisIn(v, new()) = false\nisIn(v, add(v, S)) = true\nisIn(v, add(u, S)) = isIn(v , S) if v ≠ u\nremove(v, new()) = new()\nremove(v, add(v, S)) = remove(v, S)\nremove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u\nwhere S is a set and u and v are elements.\nThe\npredicate\nisEmpty(S) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(add(v, S)) = false","source_id":"nist-dads.set","source_sha256":"1ca0df0af76538a11d49c4d26da2bbec44800022ca4f6f4dfac484195cb83bd7","start":37}],"target_id":"concept.nist.set","target_kind":"node","target_sha256":"8d2029237284ab2e1ae1d797df0da33b394ef97b672aed67087fb4a07307395c"}],"concept.nist.setpacking":[{"id":"assertion.concept.nist.setpacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines set packing as: An optimization problem to find the largest number of mutually disjoint subsets that cover a given set of sets .","support":[{"end":166,"quote":"An\noptimization problem\nto find\tthe largest number of mutually\ndisjoint\nsubsets\nthat cover a given set of\nsets\n.","source_id":"nist-dads.setpacking","source_sha256":"ec7f921a43a606eb04b8b4ebd66da519dc7d75dd317f4e0c850ce54310786168","start":54}],"target_id":"concept.nist.setpacking","target_kind":"node","target_sha256":"5905c1262420147cdbbac5242762c23c2d995e6dcc3551d553ae7daa087e75da"}],"concept.nist.shadowheap":[{"id":"assertion.concept.nist.shadowheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow heap as: A heap , implemented in an array , adjacent to an unordered table. The shadow is the table nodes and all their (recursive) parents , by array index, in the heap.","support":[{"end":215,"quote":"A\nheap\n, implemented in an\narray\n, adjacent to an unordered table.  The\nshadow\nis the table\nnodes\nand all their (recursive)\nparents\n, by array index, in the heap.","source_id":"nist-dads.shadowheap","source_sha256":"547ddac337837596f68ba2c4f9cb4db083fc2706b11f3cb815ed648e02f6cb53","start":53}],"target_id":"concept.nist.shadowheap","target_kind":"node","target_sha256":"f69f05a40a6be51ef8746987f5657014b333aff6f2595cc8643ef68fced07671"}],"concept.nist.sharedmemory":[{"id":"assertion.concept.nist.sharedmemory","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shared memory as: All processors have the same global image of (and access to) all of the memory.","support":[{"end":132,"quote":"All processors have the same global image of (and access to) all of the memory.","source_id":"nist-dads.sharedmemory","source_sha256":"d9d37832f42868bf17d7a571c3b6c47afe9075eddd0f7237e51b87405ff91f33","start":53}],"target_id":"concept.nist.sharedmemory","target_kind":"node","target_sha256":"70bf2afdf43dcc9adc6235e38d2d53b1cd9f0d497d98cfc970442ec8898de4d9"}],"concept.nist.shortestcommonsuperseq":[{"id":"assertion.concept.nist.shortestcommonsuperseq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shortest common supersequence as: Find the shortest string that contains two or more strings as subsequences .","support":[{"end":166,"quote":"Find the shortest string that contains two or more\nstrings\nas\nsubsequences\n.","source_id":"nist-dads.shortestcommonsuperseq","source_sha256":"06821437c618b2974599764eb50063e8c1a0506dd7c3c80237c843ab1ed9cfef","start":90}],"target_id":"concept.nist.shortestcommonsuperseq","target_kind":"node","target_sha256":"d7d8cc832c6e1b90c6fbd5cc99f9e5256f881d4acfcb8033fc641f2101f22572"}],"concept.nist.shortestcommonsuperstring":[{"id":"assertion.concept.nist.shortestcommonsuperstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shortest common superstring as: Find the shortest string that contains two or more strings as substrings .","support":[{"end":160,"quote":"Find the shortest string that contains two or more\nstrings\nas\nsubstrings\n.","source_id":"nist-dads.shortestcommonsuperstring","source_sha256":"05bef6362e095076280c15fabe8392e1e2529ed02458c5e8d229d9587c4499eb","start":86}],"target_id":"concept.nist.shortestcommonsuperstring","target_kind":"node","target_sha256":"612ecdccea36691bc14165d5b81898c2df211077490fa7928537383f4c5ef60c"}],"concept.nist.sibling":[{"id":"assertion.concept.nist.sibling","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sibling as: A node in a tree that has the same parent as another node is its sibling.","support":[{"end":114,"quote":"A\nnode\nin a\ntree\nthat has the same\nparent\nas another node is its sibling.","source_id":"nist-dads.sibling","source_sha256":"4a2ec5da16c135a75a92eaabcef92d478742e37fd6746765b878c429273e171c","start":41}],"target_id":"concept.nist.sibling","target_kind":"node","target_sha256":"03f16adbb1153d33e77e5f458f987f23f9dcfc897d16e6201c8d4d2075b01766"}],"concept.nist.signature":[{"id":"assertion.concept.nist.signature","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines signature as: The types or domains , and order, in some representations, of inputs to and outputs from a function .","support":[{"end":146,"quote":"The types or\ndomains\n, and order, in some representations, of inputs to and outputs from a\nfunction\n.","source_id":"nist-dads.signature","source_sha256":"0f15cb4d4d5b4620b2a8f595ccbf2990e2aca7dfc2ae7c0aceeb74df3137f592","start":45}],"target_id":"concept.nist.signature","target_kind":"node","target_sha256":"f9aa280cdef9b7f53a29f96a6e1f644c6ca91a2e1e428b07881931ecd97a5773"}],"concept.nist.sim":[{"id":"assertion.concept.nist.sim","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ∼ as: (1) Proportional to. (2) Asymptotically equal to. A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means lim x → ∞ f(x)/g(x) = 1.","support":[{"end":375,"quote":"(1) Proportional to.  (2) Asymptotically equal to.  A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means  lim\nx → ∞\nf(x)/g(x) = 1.","source_id":"nist-dads.sim","source_sha256":"23d7904e867e2563b3d9aa3708c3d8d9e654933a079df0a42474832519a0ee4a","start":31}],"target_id":"concept.nist.sim","target_kind":"node","target_sha256":"2c13f5f1ea15424708ce45cdb0531c451e9d8258e3f0a6a5c08943752b81a93a"}],"concept.nist.simplepath":[{"id":"assertion.concept.nist.simplepath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple path as: A path that repeats no vertex , except that the first and last may be the same vertex.","support":[{"end":135,"quote":"A\npath\nthat repeats no\nvertex\n, except that the first and last may be the same vertex.","source_id":"nist-dads.simplepath","source_sha256":"f9e9afbce15edabc77f58b0202789c730c440135c5fb3e2f46feb423ad4075bb","start":49}],"target_id":"concept.nist.simplepath","target_kind":"node","target_sha256":"4e178dca7b0c8d8bf494ac6ce15d819bc65d5f7821c2242e6b3e29011b782ff8"}],"concept.nist.simpleuniformhashing":[{"id":"assertion.concept.nist.simpleuniformhashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple uniform hashing as: The assumption or goal that items are equally likely to hash to any value.","support":[{"end":145,"quote":"The assumption or goal that items are equally likely to\nhash\nto any value.","source_id":"nist-dads.simpleuniformhashing","source_sha256":"80e0baba7a88db982a1968863e743ae781b1a6f0edb02c1f476084b9490e2c48","start":71}],"target_id":"concept.nist.simpleuniformhashing","target_kind":"node","target_sha256":"15e5a126a9132689a7e2192df3f2c164cf4a5bb391d6e4d81059279c3b782a6e"}],"concept.nist.simplex":[{"id":"assertion.concept.nist.simplex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simplex as: The simplest N-dimensional polytope . The generalization of a triangle (2D) or tetrahedron (3D).","support":[{"end":138,"quote":"The simplest N-dimensional\npolytope\n.  The generalization of a triangle (2D) or tetrahedron (3D).","source_id":"nist-dads.simplex","source_sha256":"b482cf22e58f364acf42717e268fc54876cf9fcfbe7f35b04085b77af7ffe05d","start":41}],"target_id":"concept.nist.simplex","target_kind":"node","target_sha256":"f0526900bcc0b35d2ef7e7f8236eddaa68c5783b11c6b2a1ae65868a83a1ba8f"}],"concept.nist.simulatnthrm":[{"id":"assertion.concept.nist.simulatnthrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simulation theorem as: One kind of computation can be simulated by another kind within stated complexity bounds. Most known containment or equality relationships between complexity classes were proved this way.","support":[{"end":251,"quote":"One kind of computation can be simulated by another kind within stated complexity bounds.  Most known containment or equality relationships between\ncomplexity classes\nwere proved this way.","source_id":"nist-dads.simulatnthrm","source_sha256":"da3b10b220ab35d2d4181084eca00530c2409b66122e50069598cc016bf53d7a","start":63}],"target_id":"concept.nist.simulatnthrm","target_kind":"node","target_sha256":"7ca4f8a7020696f4bb21ee7803ce720e79f513b2cf0cbd1e51c2bca217cc898a"}],"concept.nist.singledestshortestpath":[{"id":"assertion.concept.nist.singledestshortestpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single-destination shortest-path problem as: Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.","support":[{"end":215,"quote":"Find the shortest\npath\nfrom each\nvertex\nin a\nweighted, directed graph\nto a specific destination vertex.","source_id":"nist-dads.singledestshortestpath","source_sha256":"d09b9ee5da3480d32d6aa96da8a1f7849c843445687e6c36dfb6adf40bd39d62","start":112}],"target_id":"concept.nist.singledestshortestpath","target_kind":"node","target_sha256":"ffda4e12198deb5c26830129e5d84b316a94b5d6da7ce123c6f66491265a7fc5"}],"concept.nist.singleprogrm":[{"id":"assertion.concept.nist.singleprogrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single program multiple data as: The dominant style of parallel programming, where all processors use the same program, though each has its own data. Also known as SPMD.","support":[{"end":219,"quote":"The dominant style of parallel programming, where all processors use the same program, though each has its own data.\nAlso known as\nSPMD.","source_id":"nist-dads.singleprogrm","source_sha256":"43308eb5b047b5ad2d1100eceff8154df8b76c99cc4e9a9fe2f2363bc1cfc72e","start":83}],"target_id":"concept.nist.singleprogrm","target_kind":"node","target_sha256":"a356849fdab902f464cc137dcc48c2b2563a4a1db47fe17651af3f1ab184330e"}],"concept.nist.singlesourceshortestpath":[{"id":"assertion.concept.nist.singlesourceshortestpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single-source shortest-path problem as: Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph . Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.","support":[{"end":323,"quote":"Find the\nshortest paths\nfrom a specific\nsource\nvertex\nto every other vertex in a\nweighted, directed graph\n.\nDijkstra's algorithm\nsolves this if all weights are nonnegative.  The\nBellman-Ford algorithm\nhandles any weights.","source_id":"nist-dads.singlesourceshortestpath","source_sha256":"f37198b076cb61a7772e2bfacffc6e3910cc3a5d64979483afe8024647640ef3","start":102}],"target_id":"concept.nist.singlesourceshortestpath","target_kind":"node","target_sha256":"709f383cbbdfc982c1f17ac4aaee3d3611735412c5c8f546975e9eb45ca1058e"}],"concept.nist.singularity":[{"id":"assertion.concept.nist.singularity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines singularity analysis as: A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","support":[{"end":161,"quote":"A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","source_id":"nist-dads.singularity","source_sha256":"dfb949b54f126059a918e5f70d6091231a0696cb6e69a6c09c76cd09af4e6e59","start":67}],"target_id":"concept.nist.singularity","target_kind":"node","target_sha256":"2e8b5e14f136481531c17c3bb37f423505f6a8498f349f82cace2429b1202cba"}],"concept.nist.sink":[{"id":"assertion.concept.nist.sink","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sink as: A vertex of a directed graph with no outgoing edges . More formally, a vertex with with out-degree 0.","support":[{"end":137,"quote":"A\nvertex\nof a\ndirected graph\nwith no outgoing\nedges\n.  More formally, a vertex with with\nout-degree\n0.","source_id":"nist-dads.sink","source_sha256":"097a46075c74c879f195c138dab5300ca8aac52c3deb5fb2d6869940fd5f9eff","start":35}],"target_id":"concept.nist.sink","target_kind":"node","target_sha256":"897c354b7ec7a762780fd674e753834e8868b285167667f7637d00f38ec1674d"}],"concept.nist.skdtree":[{"id":"assertion.concept.nist.skdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skd-tree as: The spatial k-d tree is a spatial access method where successive levels are split along different dimensions. Objects are indexed by their centroid , and the minimum bounding box of objects in a node are stored in the node.","support":[{"end":271,"quote":"The spatial\nk-d tree\nis a\nspatial access method\nwhere successive levels are split along different dimensions.  Objects are indexed by their\ncentroid\n, and the\nminimum bounding box\nof objects in a node are stored in the node.","source_id":"nist-dads.skdtree","source_sha256":"796531a23b2494b193b38e38ce43b0f87cc9f5e6b7c77bb235e5f5f84168a83f","start":47}],"target_id":"concept.nist.skdtree","target_kind":"node","target_sha256":"ac5d1bcbae6e9a266c63fdb070f5e4e3a70334b7860e6e53d8307d5990154eec"}],"concept.nist.skewsymmetry":[{"id":"assertion.concept.nist.skewsymmetry","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skew symmetry as: The property that the flow is the same amount, but reversed direction, starting from either vertex of every edge of a flow network . More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","support":[{"end":278,"quote":"The property that the flow is the same amount, but reversed direction, starting from either\nvertex\nof every\nedge\nof a\nflow network\n.  More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","source_id":"nist-dads.skewsymmetry","source_sha256":"8aaac7c23c3a52d8fa4d7e94011a9dbdf7fde30a79e99f6e611673b1954088b6","start":53}],"target_id":"concept.nist.skewsymmetry","target_kind":"node","target_sha256":"67eaa3636b6c2625d1253b0c08359c580d3dd773b92e224d763e3a3d702b8e49"}],"concept.nist.skiplist":[{"id":"assertion.concept.nist.skiplist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skip list as: A randomized variant of an ordered linked list with additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels. With enough levels, searching is O(log n) .","support":[{"end":486,"quote":"A\nrandomized\nvariant of an\nordered linked list\nwith additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels.  With enough levels, searching is\nO(log n)\n.","source_id":"nist-dads.skiplist","source_sha256":"16c9af16a3efabe361660a07f8f98e6f02eedb78de3ff83154ccb26d180b252e","start":49}],"target_id":"concept.nist.skiplist","target_kind":"node","target_sha256":"8c6fc4ef9cd13336778c30d5173ee4e39c50a1a7896175b1ad9bdcd5b2f037f1"}],"concept.nist.solvable":[{"id":"assertion.concept.nist.solvable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines solvable as: A computational problem that can be solved by a Turing machine . The problem may have a nonbinary output.","support":[{"end":149,"quote":"A computational problem that can be solved by a\nTuring machine\n.  The problem may have a nonbinary output.","source_id":"nist-dads.solvable","source_sha256":"d9dfb04304c7de5591db131df96a14d1a794ac9725398d08da087ab464bd2e9a","start":43}],"target_id":"concept.nist.solvable","target_kind":"node","target_sha256":"73742125cd2ace46dcc82f63bfaa95d7a9af1adac7cb5925cf5569795927819b"}],"concept.nist.sortedarray":[{"id":"assertion.concept.nist.sortedarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sorted array as: An array whose items are kept sorted, often so searching is faster.","support":[{"end":122,"quote":"An\narray\nwhose items are kept sorted, often so searching is faster.","source_id":"nist-dads.sortedarray","source_sha256":"4041dfedb5bd694abea218604849e92133a2b47278bb1abc5937465c0ee11922","start":55}],"target_id":"concept.nist.sortedarray","target_kind":"node","target_sha256":"b9e3cf88ce167f5fa49289f8330f0ab134a0a9c2cc77721ce81b43e3dba36c39"}],"concept.nist.sortedlist":[{"id":"assertion.concept.nist.sortedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sorted list as: A list whose items are kept sorted.","support":[{"end":88,"quote":"A\nlist\nwhose items are kept sorted.","source_id":"nist-dads.sortedlist","source_sha256":"f7429d7e7782fadb544a6cbafdba50edbba865ce741905d438b793f1820474e4","start":53}],"target_id":"concept.nist.sortedlist","target_kind":"node","target_sha256":"464360f92195112101003ad2eae357aa6d1a41f61d4e7cf3581d4ee7a0cf7efb"}],"concept.nist.source":[{"id":"assertion.concept.nist.source","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines source as: (1) A vertex of a directed graph with no incoming edges . More formally, a vertex with in-degree 0. (2) The vertex from which an edge of a directed graph leaves.","support":[{"end":201,"quote":"(1) A\nvertex\nof a\ndirected graph\nwith no incoming\nedges\n.  More formally, a vertex with\nin-degree\n0. (2) The vertex from which an\nedge\nof a\ndirected graph\nleaves.","source_id":"nist-dads.source","source_sha256":"0554b9145427da1baa7d7bf2bb2a2e63766fa3a7fa27a41590f96e13baa28d9f","start":39}],"target_id":"concept.nist.source","target_kind":"node","target_sha256":"ede4667264ab51096347b7395e3c8e470e9c02787af9417cb46bb2fe17311402"}],"concept.nist.space":[{"id":"assertion.concept.nist.space","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines space-constructible function as: A function s(n) that gives the actual space used by some Turing machine on all inputs of length n.","support":[{"end":181,"quote":"A function s(n) that gives the actual space used by some\nTuring machine\non all inputs of length n.","source_id":"nist-dads.space","source_sha256":"8944a8a5837b3f307d93b60a924e802c3574d92444989eff4f98429b6a530ab5","start":83}],"target_id":"concept.nist.space","target_kind":"node","target_sha256":"b7818d19cb5542f62507812c4156a8a424790541e0429c9441a6c7076cb78520"}],"concept.nist.spanningtree":[{"id":"assertion.concept.nist.spanningtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines spanning tree as: A connected , acyclic subgraph containing all the vertices of a graph .","support":[{"end":124,"quote":"A\nconnected\n,\nacyclic\nsubgraph containing all the\nvertices\nof a\ngraph\n.","source_id":"nist-dads.spanningtree","source_sha256":"0bdeb1927e8a42264b30cb824c2e174143d46dbd07a067777838c65259ea0371","start":53}],"target_id":"concept.nist.spanningtree","target_kind":"node","target_sha256":"27270ee64e3f6dfeb2baf5f09a4db4b1022987c61cf68cc07298ad3ba220746e"}],"concept.nist.sparsegraph":[{"id":"assertion.concept.nist.sparsegraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparse graph as: A graph in which the number of edges is much less than the possible number of edges.","support":[{"end":135,"quote":"A\ngraph\nin which the number of\nedges\nis much less than the possible number of edges.","source_id":"nist-dads.sparsegraph","source_sha256":"04b4f7b92ec5c52cfc4dab20d416f87e40b3c614e282c27ce57c9f086418cd6a","start":51}],"target_id":"concept.nist.sparsegraph","target_kind":"node","target_sha256":"e699e566cecb2e07852557fe6816157471e00171ef7832b761c5934b69d2aa2e"}],"concept.nist.sparsematrix":[{"id":"assertion.concept.nist.sparsematrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparse matrix as: A matrix that has relatively few non-zero (or \"interesting\") entries. It may be represented in much less than n × m space.","support":[{"end":180,"quote":"A\nmatrix\nthat has relatively few non-zero (or \"interesting\") entries.  It may be represented in much less than n × m space.","source_id":"nist-dads.sparsematrix","source_sha256":"56f610d5e057389b629f3fb313434219e8487c14d2283d09bb7b5a12908a0ee6","start":57}],"target_id":"concept.nist.sparsematrix","target_kind":"node","target_sha256":"2690a722f77230e5d16e458d0c8fd3a3f8772c4f75ec4957504bf4d980e5c061"}],"concept.nist.sparsity":[{"id":"assertion.concept.nist.sparsity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparsity as: Instances of the longest common subsequence problem in which the number of matches is small compared to the product of the lengths of the input strings.","support":[{"end":195,"quote":"Instances of the\nlongest common subsequence\nproblem in which the number of matches is small compared to the product of the lengths of the input strings.","source_id":"nist-dads.sparsity","source_sha256":"d08f900b3c9763edf72b4733e7a5dde85333d9acb858f83968fcd5ce941b7403","start":43}],"target_id":"concept.nist.sparsity","target_kind":"node","target_sha256":"21065ac98215c9e7fe724dd01107ada2c7c2906dd9ea771787df5456fb509a3c"}],"concept.nist.spatialaccessmethod":[{"id":"assertion.concept.nist.spatialaccessmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines spatial access method as: A data structure to search for lines, polygons, etc. Also known as SAM.","support":[{"end":140,"quote":"A data structure to search for lines, polygons, etc.\nAlso known as\nSAM.","source_id":"nist-dads.spatialaccessmethod","source_sha256":"f0679665ab34efc4a3f691d316fedf4bcfcf9790f611264c37813b158b1edd72","start":69}],"target_id":"concept.nist.spatialaccessmethod","target_kind":"node","target_sha256":"955660d3cf887f67b8d40c91dc8c871b021b9ad6bb3c25c8f006e78fd4a48bd9"}],"concept.nist.splaytree":[{"id":"assertion.concept.nist.splaytree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines splay tree as: A binary search tree in which operations that access nodes restructure the tree.","support":[{"end":131,"quote":"A\nbinary search tree\nin which operations that access\nnodes\nrestructure the tree.","source_id":"nist-dads.splaytree","source_sha256":"be110a518b69e645163abcb439f65601c55b4bef9e094770e6ec383297f3168c","start":51}],"target_id":"concept.nist.splaytree","target_kind":"node","target_sha256":"cc07f0d2b4b3a4d5078a358b0ef319f93b8d6be998b5e103ca515b67d962d491"}],"concept.nist.squarematrix":[{"id":"assertion.concept.nist.squarematrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines square matrix as: A n × n matrix , i.e., one whose size is the same in both dimensions.","support":[{"end":126,"quote":"A n × n\nmatrix\n, i.e., one whose size is the same in both dimensions.","source_id":"nist-dads.squarematrix","source_sha256":"ccfd97be3175efd16100f1390e7000d2dfe7f9b1946806b250d17ae156ea20d4","start":57}],"target_id":"concept.nist.squarematrix","target_kind":"node","target_sha256":"914e5639efe237f4731dd28eda35908b7302e3eca86ba817cddc33e2e76c5bfe"}],"concept.nist.sstable":[{"id":"assertion.concept.nist.sstable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines SSTable as: An immutable dictionary stored on disk. Values are far larger than keys. Keys and values are in key-order in a \"data block\". Ordered keys are in an \"index block\", where each key has an offset into its location in the data block. Also known as sorted-string table.","support":[{"end":312,"quote":"An immutable\ndictionary\nstored on disk.  Values are far larger than keys.  Keys and values are in key-order in a \"data block\".   Ordered keys are in an \"index block\", where each key has an offset into its location in the data block.\nAlso known as\nsorted-string table.","source_id":"nist-dads.sstable","source_sha256":"b73e5fbe48929f2e36352c216033cf6353e5f3d1e0e71e9e443ccda630933069","start":45}],"target_id":"concept.nist.sstable","target_kind":"node","target_sha256":"2d71d14bac2bccd71c34e1f38ec36df7f5d26e293a3b7cd270e0ba8fcb82db27"}],"concept.nist.stable":[{"id":"assertion.concept.nist.stable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stable as: An algorithm where the relative order upon input of items with equal keys is always preserved in the output. Usually a sort algorithm.","support":[{"end":174,"quote":"An\nalgorithm\nwhere the relative order upon input of items with equal\nkeys\nis always preserved in the output.  Usually a\nsort\nalgorithm.","source_id":"nist-dads.stable","source_sha256":"c718d3f125767b815a8f0f53d244b9c852a30afcbab9a760a65dc73e183138eb","start":39}],"target_id":"concept.nist.stable","target_kind":"node","target_sha256":"f104491c7165d389bfead1fd3a80f81b7d877d332117bf1acddc9925fe3bbecf"}],"concept.nist.stack":[{"id":"assertion.concept.nist.stack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines stack as: A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO. Formal Definition: The operations new(), push(v, S), top(S), and popoff(S) may be defined with axiomatic semantics as follows. new() returns a stack popoff(push(v, S)) = S top(push(v, S)) = v where S is a stack and v is a value. The pop operation is a combination of top, to return the top value, and popoff, to remove the top value. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(push(v, S)) = false Also known as LIFO.","support":[{"end":765,"quote":"A collection of items in which only the most recently added item may be removed.  The latest added item is at the top.  Basic operations are push and pop.  Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO.\nFormal Definition:\nThe operations new(), push(v, S), top(S), and popoff(S) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a stack\npopoff(push(v, S)) = S\ntop(push(v, S)) = v\nwhere S is a stack and v is a value.  The pop operation is a combination of top, to return the top value, and popoff, to remove the top value.\nThe\npredicate\nisEmpty(S) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(push(v, S)) = false\nAlso known as\nLIFO.","source_id":"nist-dads.stack","source_sha256":"5920b06174b0e5bc4e641b5166f24b39eb344a94d29194f7865573065c0fded0","start":41}],"target_id":"concept.nist.stack","target_kind":"node","target_sha256":"d23906e478a86fd4851f6168069e5fa2b744bc55f6ce5673c746fc9e0fce21cd"}],"concept.nist.stacktree":[{"id":"assertion.concept.nist.stacktree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stack tree as: A binary tree where no node , except the root , has more than one non- leaf child .","support":[{"end":130,"quote":"A\nbinary tree\nwhere no\nnode\n, except the\nroot\n, has more than one non-\nleaf\nchild\n.","source_id":"nist-dads.stacktree","source_sha256":"c827a9c0bcac04656a9abce25632af6a28c2f61fcd5c7103b7c4954e862631ad","start":47}],"target_id":"concept.nist.stacktree","target_kind":"node","target_sha256":"85b9c905d03e12f369f9e83aac83c3b1768cd279e1d5631ea9f0015e05cf1ec6"}],"concept.nist.starshaped":[{"id":"assertion.concept.nist.starshaped","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines star-shaped polygon as: A polygon P in which there exists an interior point p such that all the boundary points of P are visible from p.","support":[{"end":177,"quote":"A polygon P in which there exists an interior point p such that all the boundary points of P are\nvisible\nfrom p.","source_id":"nist-dads.starshaped","source_sha256":"e06f4c7ae3a6d16e088b25551177bacfaa32e323a02f46a28f26649f1f1ff8aa","start":65}],"target_id":"concept.nist.starshaped","target_kind":"node","target_sha256":"b3d1fa9ada34c1a5266a8ef832a99a97aad82e573341155a9095943ce20451ac"}],"concept.nist.startstate":[{"id":"assertion.concept.nist.startstate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines start state as: An initial state or condition of a finite state machine or Turing machine . Informally, how the memory is initially set.","support":[{"end":170,"quote":"An initial\nstate\nor condition of a\nfinite state machine\nor\nTuring machine\n.  Informally, how the memory is initially set.","source_id":"nist-dads.startstate","source_sha256":"278c81cde024531a572bf3e5f4b1aecaee72d6954195aec69dcabedcc9bafd6b","start":49}],"target_id":"concept.nist.startstate","target_kind":"node","target_sha256":"3a3c7b29105badb41dc9283ef82a3baa217704f2965bc121461f1856e6415e7f"}],"concept.nist.state":[{"id":"assertion.concept.nist.state","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines state as: The condition of a finite state machine or Turing machine at a certain time. Informally, the content of memory.","support":[{"end":149,"quote":"The condition of a\nfinite state machine\nor\nTuring machine\nat a certain time.  Informally, the content of memory.","source_id":"nist-dads.state","source_sha256":"d609e6edafd98d484b24d1c811254a201380da5c964d8d09bd283ded982620d5","start":37}],"target_id":"concept.nist.state","target_kind":"node","target_sha256":"7b301963a0d69916a0e37328bea71f14b100a406f9261bac977e7e14b53aed73"}],"concept.nist.statemachine":[{"id":"assertion.concept.nist.statemachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines state machine as: A model of computation consisting of a (possibly infinite) set of states , a set of start states , an input alphabet , and a transition function which maps input symbols and current states to a next state . Usually understood to be a finite state machine .","support":[{"end":310,"quote":"A\nmodel of computation\nconsisting of a (possibly infinite) set of\nstates\n, a set of\nstart states\n, an input\nalphabet\n, and a\ntransition function\nwhich maps input symbols and current states to a\nnext state\n.  Usually understood to be a\nfinite state machine\n.","source_id":"nist-dads.statemachine","source_sha256":"b2488d1340f05d9791fb8f0d62ae2857adf07f1e8b7e4fb76717f775e4709021","start":53}],"target_id":"concept.nist.statemachine","target_kind":"node","target_sha256":"8ce759e42bc18267981f216f8329316f59479c09b357fdb78a5df49a15ee8b6b"}],"concept.nist.static":[{"id":"assertion.concept.nist.static","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines static as: When the problem domain does not change.","support":[{"end":79,"quote":"When the problem domain does not change.","source_id":"nist-dads.static","source_sha256":"e85da3b32a8d13f6cdeb2e20955926e410cf21117359cef7307a0b80bd410e28","start":39}],"target_id":"concept.nist.static","target_kind":"node","target_sha256":"a9f9ddf270d63fd8ea24e991db0d5dca65e3ddcdcd14609048e55ce2492bc6c7"}],"concept.nist.stcut":[{"id":"assertion.concept.nist.stcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines s-t cut as: A partitioning of the vertices of a flow network into S and T such that the source is in S and the sink is in T.","support":[{"end":153,"quote":"A partitioning of the\nvertices\nof a\nflow network\ninto S and T such that the\nsource\nis in S and the\nsink\nis in T.","source_id":"nist-dads.stcut","source_sha256":"5810d4caab8aa5081928b7b0d2f97651c992692b6a5e58aa62896ed6d1f56ef7","start":41}],"target_id":"concept.nist.stcut","target_kind":"node","target_sha256":"3598d5c6f3a32b5b2752fb4e8277f49a9cdfa4dc99b6a4c6660988f178ccdec3"}],"concept.nist.stdigraph":[{"id":"assertion.concept.nist.stdigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines st-digraph as: A directed acyclic graph with two specially marked nodes, the source s and the sink t.","support":[{"end":137,"quote":"A\ndirected acyclic graph\nwith two specially marked nodes, the\nsource\ns and the\nsink\nt.","source_id":"nist-dads.stdigraph","source_sha256":"8612a5150149d0dfccf0975f5851fa42222f5718b57de3d6f035658d78bbda14","start":51}],"target_id":"concept.nist.stdigraph","target_kind":"node","target_sha256":"5770c0dcee53ff4b799a3e54cab2416f22458dc8e7ce61bc7582e2d4f8962e6d"}],"concept.nist.steinerpoint":[{"id":"assertion.concept.nist.steinerpoint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner point as: (1) A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree . (2) A point with a particular geometric relation to a triangle.","support":[{"end":235,"quote":"(1) A point that is not part of the input set of points, for instance, a point computed to construct a\nSteiner tree\n.  (2) A point with a particular geometric relation to a triangle.","source_id":"nist-dads.steinerpoint","source_sha256":"1ce8f0db4b5073bd1e6626c3b9734f5dfc92969e6735fabbd8b3775bfb4e4d93","start":53}],"target_id":"concept.nist.steinerpoint","target_kind":"node","target_sha256":"75f9e23424ebb1b9407cf7c8e59d671c7622a5448ad6141ec0bc23e0e0fce5f2"}],"concept.nist.steinerratio":[{"id":"assertion.concept.nist.steinerratio","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner ratio as: For a given variant of the Steiner tree problem, the maximum possible ratio of the length of a minimum spanning tree of a set of terminals to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).","support":[{"end":288,"quote":"For a given variant of the\nSteiner tree\nproblem, the maximum possible ratio of the length of a\nminimum spanning tree\nof a set of\nterminals\nto the length of an optimal Steiner tree of the same set of terminals.  Usually written ρ (rho).","source_id":"nist-dads.steinerratio","source_sha256":"c15c1645fdd807ef43af411f290a4da7b5774f90c9af59cb9da0287ea2731bd1","start":53}],"target_id":"concept.nist.steinerratio","target_kind":"node","target_sha256":"89f84b4569327ca02e9079f9e3dc477a776e24c9c6650db83394a9df033fd5d1"}],"concept.nist.steinertree":[{"id":"assertion.concept.nist.steinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner tree as: A minimum-weight tree connecting a designated set of vertices , called terminals , in an undirected , weighted graph or points in a space. The tree may include non-terminals, which are called Steiner vertices or Steiner points .","support":[{"end":279,"quote":"A minimum-weight\ntree\nconnecting a designated set of\nvertices\n, called\nterminals\n, in an\nundirected\n,\nweighted graph\nor points in a space. The tree may include non-terminals, which are called\nSteiner vertices\nor\nSteiner points\n.","source_id":"nist-dads.steinertree","source_sha256":"b2a7562a159067ac4546c17640798740c621c66dc5b245aca22f51bb80980fbf","start":51}],"target_id":"concept.nist.steinertree","target_kind":"node","target_sha256":"5af539a864c09b450d41ef08c1422e1b50d9b1eb2081779fe87ce030545a91ab"}],"concept.nist.steinervertx":[{"id":"assertion.concept.nist.steinervertx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner vertex as: A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree .","support":[{"end":168,"quote":"A point that is not part of the input set of points, for instance, a point computed to construct a\nSteiner tree\n.","source_id":"nist-dads.steinervertx","source_sha256":"b55afc57ac8ee1d2a578bc483937e4007f771fd322b0b715feaaaa055c5acb7b","start":55}],"target_id":"concept.nist.steinervertx","target_kind":"node","target_sha256":"16da3757d150ab2cd1671e1569be827b2d1c6d308d5084342cf6d5916955e0ea"}],"concept.nist.straightline":[{"id":"assertion.concept.nist.straightline","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines straight-line drawing as: A graph drawing in which each edge is represented by a straight line segment.","support":[{"end":146,"quote":"A\ngraph drawing\nin which each edge is represented by a straight line segment.","source_id":"nist-dads.straightline","source_sha256":"a8d00a8ebd540918d5d822a14ec161806c1303b4fa63bad70a50eef5bdbe510f","start":69}],"target_id":"concept.nist.straightline","target_kind":"node","target_sha256":"ed6fb8bafa33b72f781a3f8a0e916945debbf6ff7936a108616f22aef9cc7f66"}],"concept.nist.strictlydecreasing":[{"id":"assertion.concept.nist.strictlydecreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly decreasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) > f(y).","support":[{"end":173,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x < y implies f(x) > f(y).","source_id":"nist-dads.strictlydecreasing","source_sha256":"93890673b8dc373127a1d21f6b8ab3b9a7e8c95af453ad480a4231a9f95e32be","start":65}],"target_id":"concept.nist.strictlydecreasing","target_kind":"node","target_sha256":"8d13c1401b2e40cd70e7e521a4bc581b11be50234f22a2206bfc8b1dc39bcdb0"}],"concept.nist.strictlyincreasing":[{"id":"assertion.concept.nist.strictlyincreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly increasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) < f(y).","support":[{"end":173,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x < y implies f(x) < f(y).","source_id":"nist-dads.strictlyincreasing","source_sha256":"269397b1edf1461b35fa0f2d9b59b2a305d17e19501b772e8933a83d95fcf3db","start":65}],"target_id":"concept.nist.strictlyincreasing","target_kind":"node","target_sha256":"cd5f0505f2d40d2a11983b30d4f6cf717645f6ec40d5cc92ccf72e6cfa91261e"}],"concept.nist.strictlylowertriangmat":[{"id":"assertion.concept.nist.strictlylowertriangmat","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly lower triangular matrix as: A matrix that is only defined at (i,j) when i > j.","support":[{"end":145,"quote":"A\nmatrix\nthat is only defined at (i,j) when i > j.","source_id":"nist-dads.strictlylowertriangmat","source_sha256":"64dc59acb4f0d2362f985ab6326e2c5fa6a0d31f47623ec057d1c4b9b4bcd69c","start":95}],"target_id":"concept.nist.strictlylowertriangmat","target_kind":"node","target_sha256":"e60a6f6e93e7a0ee7aa732569612154815ffcc28021ab162fdac0a866dfa7943"}],"concept.nist.strictlyuppertriangmat":[{"id":"assertion.concept.nist.strictlyuppertriangmat","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly upper triangular matrix as: A matrix that is only defined at (i,j) when i < j.","support":[{"end":145,"quote":"A\nmatrix\nthat is only defined at (i,j) when i < j.","source_id":"nist-dads.strictlyuppertriangmat","source_sha256":"3211a27a6d58312b7591b39d9982a04702f1cbf5b1659bc56275329896afb95e","start":95}],"target_id":"concept.nist.strictlyuppertriangmat","target_kind":"node","target_sha256":"89ea6ad747a688e6d3704ad62254b4b32461fd0bf7669abc2ad901aca53d41a4"}],"concept.nist.string":[{"id":"assertion.concept.nist.string","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string as: A list of characters, usually implemented as an array . Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","support":[{"end":237,"quote":"A list of characters, usually implemented as an\narray\n. Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","source_id":"nist-dads.string","source_sha256":"5e556b9ff9ac3bee2c23b14fe788a85adbafd5e1d7f75046de8c86d07bc0857b","start":43}],"target_id":"concept.nist.string","target_kind":"node","target_sha256":"7b294c9178c517122b3ae3f1a2234e47417571ac31a4215f93afb442679f58ca"}],"concept.nist.stringedit":[{"id":"assertion.concept.nist.stringedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string editing problem as: The problem of finding an edit script of minimum cost which transforms a given string into another given string.","support":[{"end":183,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\nstring\ninto another given string.","source_id":"nist-dads.stringedit","source_sha256":"51f9ed056f5e581f6d8e6557c043b339650322e74baee2731228a54231065140","start":71}],"target_id":"concept.nist.stringedit","target_kind":"node","target_sha256":"c79d5dec4788c2c261d39cc8f59aae28b2d09426a81f07e78cf1aeca7e56c901"}],"concept.nist.stringmatching":[{"id":"assertion.concept.nist.stringmatching","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines string matching as: The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching. Also known as exact string matching, string searching, text searching.","support":[{"end":291,"quote":"The problem of finding occurrence(s) of a\npattern\nstring  within another\nstring\nor body of text.  There are many different\nalgorithms\nfor efficient searching.\nAlso known as\nexact string matching, string searching, text searching.","source_id":"nist-dads.stringmatching","source_sha256":"6d351eda09fd804d45084a8f92a0957cd6240243a2021b68d0d35901b4c220a3","start":62}],"target_id":"concept.nist.stringmatching","target_kind":"node","target_sha256":"ab707c4ea9323037c26f424efd226b91b202935ab68ebf3d66c967772dd43472"}],"concept.nist.strippacking":[{"id":"assertion.concept.nist.strippacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strip packing as: Pack a set of rectangles into a strip of width 1 to minimize the height used. Rectangles may not overlap or be rotated. Without loss of generality, the height of rectangles is at most 1. This is NP-hard .","support":[{"end":265,"quote":"Pack a\nset\nof rectangles into a strip of width 1 to minimize the height used.  Rectangles may not overlap or be rotated.  Without loss of generality, the height of rectangles is at most 1.  This is\nNP-hard\n.","source_id":"nist-dads.strippacking","source_sha256":"a1a81d523390f58f3746bc0502ae49a83f1db4138a875d5f38e0e404b502f416","start":58}],"target_id":"concept.nist.strippacking","target_kind":"node","target_sha256":"3c6e23a1de1117a407b841f7d75c97ab098b1c0c3da74363e95a578324c86bd5"}],"concept.nist.stronglyconnectedcompo":[{"id":"assertion.concept.nist.stronglyconnectedcompo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly connected component as: A strongly connected subgraph , S, of a directed graph , D, such that no vertex of D can be added to S and it still be strongly connected. Informally, a maximal subgraph in which every vertex is reachable from every other vertex.","support":[{"end":313,"quote":"A\nstrongly connected\nsubgraph\n, S, of a\ndirected graph\n, D, such that no\nvertex\nof D can be added to S and it still be strongly connected.  Informally, a maximal subgraph in which every vertex is\nreachable\nfrom every other vertex.","source_id":"nist-dads.stronglyconnectedcompo","source_sha256":"49745b61e5ee1b19449df4aa05104bd1af252af18acd2dca428f9ad4efa46209","start":83}],"target_id":"concept.nist.stronglyconnectedcompo","target_kind":"node","target_sha256":"732f40175be7adb06234d38e2c6de1472b336e98fdbc488b6ea95852e49c8561"}],"concept.nist.stronglyconnectedgraph":[{"id":"assertion.concept.nist.stronglyconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly connected graph as: A directed graph that has a path from each vertex to every other vertex. Formal Definition: A directed graph D=(V, E) such that for all pairs of vertices u, v ∈ V, there is a path from u to v and from v to u.","support":[{"end":283,"quote":"A\ndirected graph\nthat has a\npath\nfrom each\nvertex\nto every other vertex.\nFormal Definition:\nA\ndirected graph\nD=(V, E) such that for all pairs of\nvertices\nu, v ∈ V, there is a\npath\nfrom u to v and from v to u.","source_id":"nist-dads.stronglyconnectedgraph","source_sha256":"7f3006c64712d50ea60aeaff887790b1d8cca79e219b5a7db1e0ac0aa5d0fa27","start":75}],"target_id":"concept.nist.stronglyconnectedgraph","target_kind":"node","target_sha256":"8e1b6c19d53e7514ac12e2577413aca8e6e147cf271f9f9781a139fa0c7f1946"}],"concept.nist.stronglynp":[{"id":"assertion.concept.nist.stronglynp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly NP-hard as: The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.","support":[{"end":218,"quote":"The\ncomplexity class\nof\ndecision problems\nwhich are still\nNP-hard\neven when all numbers in the input are bounded by some\npolynomial\nin the length of the input.","source_id":"nist-dads.stronglynp","source_sha256":"4bc63dee099414e3256c4628c636eb7498f82bca193ff51e25f7da723d109b2b","start":59}],"target_id":"concept.nist.stronglynp","target_kind":"node","target_sha256":"48ee90bd9ad758a26f9001d2ad6b4e845e3af0bb0377cd850690c21ca01a12f3"}],"concept.nist.subadditive":[{"id":"assertion.concept.nist.subadditive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subadditive ergodic theorem as: If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","support":[{"end":195,"quote":"If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","source_id":"nist-dads.subadditive","source_sha256":"8095cd830e2d756cc340dd933e0e591ac401d28e9ce66b2f584f12fa16374715","start":81}],"target_id":"concept.nist.subadditive","target_kind":"node","target_sha256":"29f5e734c1f4c8b0fcf8541b12a0cc2c1d1fbae1ba0cbc10f62c669eeca01748"}],"concept.nist.subgraph":[{"id":"assertion.concept.nist.subgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subgraph as: A graph whose vertices and edges are subsets of another graph . Formal Definition: A graph G'=(V', E') is a subgraph of another graph G=(V, E) iff V'⊆ V, and E'⊆ E ∧ ( (v 1 , v 2 )∈ E' → v 1 , v 2 ∈ V').","support":[{"end":251,"quote":"A\ngraph\nwhose\nvertices\nand\nedges\nare\nsubsets\nof another\ngraph\n.\nFormal Definition:\nA\ngraph\nG'=(V', E') is a subgraph of another graph  G=(V, E) iff\nV'⊆ V, and\nE'⊆ E ∧ ( (v\n1\n, v\n2\n)∈ E'     → v\n1\n, v\n2\n∈ V').","source_id":"nist-dads.subgraph","source_sha256":"915924bb5bff5567cbbae23ca786f860df4e80041afd58ae964d690e6e468e41","start":43}],"target_id":"concept.nist.subgraph","target_kind":"node","target_sha256":"58c807e58a5b15fe23426739fe6a628e20a80373fa3ed7f7ecf5bbf86f384baa"}],"concept.nist.subgraphiso":[{"id":"assertion.concept.nist.subgraphiso","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subgraph isomorphism as: Decide if there is a subgraph of one graph which is isomorphic to another graph.","support":[{"end":152,"quote":"Decide if there is a\nsubgraph\nof one\ngraph\nwhich is\nisomorphic\nto another graph.","source_id":"nist-dads.subgraphiso","source_sha256":"580a66a7a1c9e63e2a6e580f2c91c7867b98b486e7b95eb822bb1ddd5a44158e","start":72}],"target_id":"concept.nist.subgraphiso","target_kind":"node","target_sha256":"05c97a99d016d8b6b56b865b41f95065fc45f72e5ba784aa77fe6eeb83d3492f"}],"concept.nist.sublineartimealgo":[{"id":"assertion.concept.nist.sublineartimealgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sublinear time algorithm as: A algorithm whose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","support":[{"end":218,"quote":"A\nalgorithm\nwhose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","source_id":"nist-dads.sublineartimealgo","source_sha256":"fc5ae351bddbf749268787bda46e1c8be1ce04d67efc38666d87340fad781167","start":75}],"target_id":"concept.nist.sublineartimealgo","target_kind":"node","target_sha256":"5816f717b7fc5a9aae6686bcf7bc833bb24b8bed79b522328d505145d9f88bad"}],"concept.nist.subsequence":[{"id":"assertion.concept.nist.subsequence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subsequence as: Any string that can be obtained by deleting zero or more symbols from a given string.","support":[{"end":134,"quote":"Any\nstring\nthat can be obtained by deleting zero or more symbols from a given string.","source_id":"nist-dads.subsequence","source_sha256":"4343f545bb3f721ea83c26080af6886d608b3b4e344cc897d45685862debbd3a","start":49}],"target_id":"concept.nist.subsequence","target_kind":"node","target_sha256":"1a5ea767c2cd805943e6acae06195e0329e970b4463f58a6acba08ed246d944e"}],"concept.nist.subset":[{"id":"assertion.concept.nist.subset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subset as: A set S 1 is a subset of another set S 2 if every element in S 1 is in S 2 . S 2 may have exactly the same elements as S 1 . Formal Definition: S 1 ⊆ S 2 iff ∀ s, s ∈ S 1 → s ∈ S 2 .","support":[{"end":222,"quote":"A\nset\nS\n1\nis a subset of another set S\n2\nif every element in S\n1\nis in S\n2\n.  S\n2\nmay have exactly the same elements as S\n1\n.\nFormal Definition:\nS\n1\n⊆ S\n2\niff ∀ s, s ∈ S\n1\n→ s ∈ S\n2\n.","source_id":"nist-dads.subset","source_sha256":"373f891a081701de107908471de9da030457ff8d9f1188068a00706920e221c5","start":39}],"target_id":"concept.nist.subset","target_kind":"node","target_sha256":"6781ab4d2e55a66e78446aae400e683a9891c2692e84ae6dbb175db39003a502"}],"concept.nist.substring":[{"id":"assertion.concept.nist.substring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines substring as: A string v is a substring of a string u if u=u′ vu″ for some prefix u′ and suffix u″. Also known as factor.","support":[{"end":153,"quote":"A\nstring\nv is a substring of a string u if u=u′ vu″  for some\nprefix\nu′ and\nsuffix\nu″.\nAlso known as\nfactor.","source_id":"nist-dads.substring","source_sha256":"25d65dd9af96fc0b42a82add16755dcbf6e822207b644e65e42f33f23dd321a3","start":45}],"target_id":"concept.nist.substring","target_kind":"node","target_sha256":"16ceecf9c447cf00a72996260a61fbc201d6a23db93c6411a9b5faa4507dba32"}],"concept.nist.subtree":[{"id":"assertion.concept.nist.subtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subtree as: The tree which is a child of a node .","support":[{"end":78,"quote":"The\ntree\nwhich is a\nchild\nof a\nnode\n.","source_id":"nist-dads.subtree","source_sha256":"036626093720c969c0af84aab987dca727816c0409dfae02a8eebf5b16ccb06d","start":41}],"target_id":"concept.nist.subtree","target_kind":"node","target_sha256":"e07a97c79a5871c8f3e187c4de30b9ed67b684bc7505f9fb3316331fb609e50c"}],"concept.nist.suffix":[{"id":"assertion.concept.nist.suffix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines suffix as: The end characters of a string . More formally a string v is a suffix of a string u if u=u'v for some string u'.","support":[{"end":152,"quote":"The end characters of a\nstring\n.  More formally a string v is a suffix of a string u if u=u'v for some string u'.","source_id":"nist-dads.suffix","source_sha256":"e0ce77ae87708273da3294f459d66c8a7cb6569a6bed1b58071865af4cd7286b","start":39}],"target_id":"concept.nist.suffix","target_kind":"node","target_sha256":"7e0916ad9a33bc065fbb54339fc0f23ca7e004f5e1fa1cc0158f3052fb9956ba"}],"concept.nist.suffixarray":[{"id":"assertion.concept.nist.suffixarray","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines suffix array as: An array of all starting positions of suffixes of a string arranged in lexicographical order . This allows a binary search or fast substring search.","support":[{"end":203,"quote":"An\narray\nof all starting positions of\nsuffixes\nof a\nstring\narranged in\nlexicographical order\n. This allows a\nbinary search\nor fast substring search.","source_id":"nist-dads.suffixarray","source_sha256":"b910231752c35dcf7e023fdaea60ac0bc3c9eab79ac614577105e22d7add36e4","start":55}],"target_id":"concept.nist.suffixarray","target_kind":"node","target_sha256":"26b5b19b787decc5aaf2438c03ceecd8928c3ce081c4695f5e2fa8936631ec64"}],"concept.nist.suffixautmtn":[{"id":"assertion.concept.nist.suffixautmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines suffix automaton as: The smallest automaton accepting all suffixes of a string . The states form a directed acyclic word graph or DAWG.","support":[{"end":174,"quote":"The smallest\nautomaton\naccepting all\nsuffixes\nof a\nstring\n.  The states form a\ndirected acyclic word graph\nor DAWG.","source_id":"nist-dads.suffixautmtn","source_sha256":"b0656175cf425e959c55fe435b68921ac203aa9e3d5f25f32bf7141a25bd2956","start":59}],"target_id":"concept.nist.suffixautmtn","target_kind":"node","target_sha256":"7e2b04a13db3cdac36481e334325eb8cff7cab283ec80c8f84d7631b7bb324be"}],"concept.nist.suffixtree":[{"id":"assertion.concept.nist.suffixtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines suffix tree as: A compact representation of a trie corresponding to the suffixes of a given string where all nodes with one child are merged with their parents .","support":[{"end":198,"quote":"A compact representation of a\ntrie\ncorresponding to the\nsuffixes\nof a given\nstring\nwhere all\nnodes\nwith one\nchild\nare merged with their\nparents\n.","source_id":"nist-dads.suffixtree","source_sha256":"8d22807b787c41fa02742b1d5b9d4bc1dde5d02c9141e9b57d317db91c13ca16","start":53}],"target_id":"concept.nist.suffixtree","target_kind":"node","target_sha256":"db90f87ba29c5b3beb7c1f766560b0473f05c2ff1cb3b375cafe2b9d8f317b0f"}],"concept.nist.superimposedcode":[{"id":"assertion.concept.nist.superimposedcode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines superimposed code as: A set of bit vectors such that no vector is a subset of a bitwise or of a small number of others.","support":[{"end":158,"quote":"A set of bit vectors such that no vector is a subset of a bitwise\nor\nof a small number of others.","source_id":"nist-dads.superimposedcode","source_sha256":"d031d1dc262149d6ccc729a4c342f5e0b7daf1894d5b78c06d7512481a86e523","start":61}],"target_id":"concept.nist.superimposedcode","target_kind":"node","target_sha256":"16196eb3563fce0b78b143c2d997d28478c7161e4bd561655412997c54eba1fe"}],"concept.nist.superset":[{"id":"assertion.concept.nist.superset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines superset as: A set S 1 is a superset of another set S 2 if every element in S 2 is in S 1 . S 1 may have elements which are not in S 2 .","support":[{"end":167,"quote":"A\nset\nS\n1\nis a superset of another set S\n2\nif every element in S\n2\nis in S\n1\n.  S\n1\nmay have elements which are not in S\n2\n.","source_id":"nist-dads.superset","source_sha256":"1de5814676b33efb19c0d70d2575ca045f604f9c6ff5fc1fc483a3e079e5a1e1","start":43}],"target_id":"concept.nist.superset","target_kind":"node","target_sha256":"b52c3521dd8eddea47567028bd351732ef2da58d04d903f05d69ae92f138554d"}],"concept.nist.supersink":[{"id":"assertion.concept.nist.supersink","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines supersink as: A vertex of a directed graph which is reachable from all other vertices.","support":[{"end":117,"quote":"A\nvertex\nof a\ndirected graph\nwhich is\nreachable\nfrom all other vertices.","source_id":"nist-dads.supersink","source_sha256":"dc651b99fb2c3cb3f81143c5bffdf726fb3d507e4143a3e84d4afc6f31f5d57d","start":45}],"target_id":"concept.nist.supersink","target_kind":"node","target_sha256":"f6cb9a0be1787746c20a171d982bb3e5991b43489785b4ab9ddd5f29e65eaf2c"}],"concept.nist.supersource":[{"id":"assertion.concept.nist.supersource","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines supersource as: A vertex of a directed graph from which all other vertices are reachable .","support":[{"end":123,"quote":"A\nvertex\nof a\ndirected graph\nfrom which all other vertices are\nreachable\n.","source_id":"nist-dads.supersource","source_sha256":"8cf1eedd81819e1d653ce456863aa63be603e758b9a7e67ddecb2aac14fe906d","start":49}],"target_id":"concept.nist.supersource","target_kind":"node","target_sha256":"47c1a67de9957600afd57bcb8ef85c4462731068e63d2a169ed935c4a966d516"}],"concept.nist.symmetric":[{"id":"assertion.concept.nist.symmetric","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetric as: A binary relation R for which a R b implies b R a.","support":[{"end":95,"quote":"A\nbinary relation\nR for which a R b implies b R a.","source_id":"nist-dads.symmetric","source_sha256":"a1b3197a5cff6402bacc2072eddfdb76fe87b3f28a0659f7ffb4740b50d26e29","start":45}],"target_id":"concept.nist.symmetric","target_kind":"node","target_sha256":"98d561f2c18ab40b27e68ff8626d5b72764cc9f988ae0971d3a2a6418f374b61"}],"concept.nist.symmetricsetdiff":[{"id":"assertion.concept.nist.symmetricsetdiff","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetric set difference as: Members which are in either set , but not in both. That is, for sets A and B, it is (A - B) ∪ (B - A).","support":[{"end":178,"quote":"Members which are in either\nset\n, but not in both.  That is, for sets A and B, it is (A - B) ∪ (B - A).","source_id":"nist-dads.symmetricsetdiff","source_sha256":"97dabde245408a637f3304ef32578767d09f999d8346688bb378590b136033a8","start":75}],"target_id":"concept.nist.symmetricsetdiff","target_kind":"node","target_sha256":"a6819046644d5350ab17443230a33865b5dc1ed7cbad70a79b89e0dcd60e6ebb"}],"concept.nist.tail":[{"id":"assertion.concept.nist.tail","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tail as: (1) The last item of a list . (2) All but the first item of a list; the list following the head.","support":[{"end":131,"quote":"(1) The last item of a\nlist\n. (2) All but the first item of a list; the list following the head.","source_id":"nist-dads.tail","source_sha256":"ddb37d4056abeae715cae1a0288bcd250d436526db2cfce79af430eaa4e72bd1","start":35}],"target_id":"concept.nist.tail","target_kind":"node","target_sha256":"41785ce20a7d1e70a09ea3320e412996a283d854b2390dbed5e4ca1bc2bb44f4"}],"concept.nist.target":[{"id":"assertion.concept.nist.target","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines target as: The vertex which an edge of a directed graph enters.","support":[{"end":91,"quote":"The\nvertex\nwhich an\nedge\nof a\ndirected graph\nenters.","source_id":"nist-dads.target","source_sha256":"895f5dcaa98a071e10af7bbd04c09cbad51beb130c3849862b8824fda638d680","start":39}],"target_id":"concept.nist.target","target_kind":"node","target_sha256":"b422b474d515c303affaeee361af1a9ef4704e4b5f8101dc2f1e79add3014831"}],"concept.nist.temporllogic":[{"id":"assertion.concept.nist.temporllogic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines temporal logic as: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification .","support":[{"end":310,"quote":"A logic with a notion of time included.  The formulas can express facts about past, present, and future states.  The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in\nformal verification\n.","source_id":"nist-dads.temporllogic","source_sha256":"e5af4d08c3ef5a927a63073e9d85bcca7d832173586f0729d08974ea2ea1f1ca","start":55}],"target_id":"concept.nist.temporllogic","target_kind":"node","target_sha256":"7cb204c7c304fb9fad31456b844e7e02f27860853a6e7ab4d50d2ca8dae02ac7"}],"concept.nist.terminal":[{"id":"assertion.concept.nist.terminal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines terminal as: The set of points in a plane or vertices in a graph defining endpoints of a Steiner tree .","support":[{"end":133,"quote":"The set of points in a plane or\nvertices\nin a\ngraph\ndefining endpoints of a\nSteiner tree\n.","source_id":"nist-dads.terminal","source_sha256":"9f52b10b1c33ba21b405362b60049adce4bc85c0648560f294d3cd45d90d43a8","start":43}],"target_id":"concept.nist.terminal","target_kind":"node","target_sha256":"5aa3f145575eb91e3284dcdf22c6966f676eee78b4241a94da695425e484654c"}],"concept.nist.ternarysearchtree":[{"id":"assertion.concept.nist.ternarysearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ternary search tree as: A 3-way tree where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key. If the key is a multikey ( string , array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.) Also known as TST.","support":[{"end":427,"quote":"A 3-way\ntree\nwhere every\nnode's\nleft\nsubtree\nhas\nkeys\nless than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key.  If the key is a multikey (\nstring\n, array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.)\nAlso known as\nTST.","source_id":"nist-dads.ternarysearchtree","source_sha256":"94887bc4530c15b67cfb05547ac152d6442203f6c91035ae0e697219f1998b0d","start":69}],"target_id":"concept.nist.ternarysearchtree","target_kind":"node","target_sha256":"fad1ee672bda862704968d236af1853bf8c80d01fa2bcd165451e699bb178fb6"}],"concept.nist.text":[{"id":"assertion.concept.nist.text","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines text as: A list of characters, usually thought of as a list of words separated by spaces.","support":[{"end":115,"quote":"A list of characters, usually thought of as a list of words separated by spaces.","source_id":"nist-dads.text","source_sha256":"57fbc7c643ea2e3e30d29c8a61cd4113505e98f1cfc2cebf6eeae610ab5fca37","start":35}],"target_id":"concept.nist.text","target_kind":"node","target_sha256":"d06fbd4785d2259500021531007268ddde06eb68f66109baca0235217b44123b"}],"concept.nist.threadedtree":[{"id":"assertion.concept.nist.threadedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines threaded tree as: A binary search tree in which each node uses an otherwise-empty left child link to refer to the node's in-order predecessor and an empty right child link to refer to its in-order successor.","support":[{"end":246,"quote":"A\nbinary\nsearch tree\nin which each\nnode\nuses an otherwise-empty left\nchild\nlink\nto refer to the node's\nin-order\npredecessor and an empty right child link to refer to its in-order successor.","source_id":"nist-dads.threadedtree","source_sha256":"9c6787c6d1a6bc6386c9d67e49f047cd96bf598188d9a79a058b4b7ec7eeca9c","start":57}],"target_id":"concept.nist.threadedtree","target_kind":"node","target_sha256":"2a57e3771b5fa144a620fd16dae4f840d85900810ea13db9294dac1441537c55"}],"concept.nist.threedimnsnl":[{"id":"assertion.concept.nist.threedimnsnl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines three-dimensional as: Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","support":[{"end":180,"quote":"Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","source_id":"nist-dads.threedimnsnl","source_sha256":"f8f2d778095c45fbc4b69b838cd8e799ee14cc91069b9c2f420c1f6079028997","start":61}],"target_id":"concept.nist.threedimnsnl","target_kind":"node","target_sha256":"dfc8bb2f2e8b652c7818dde967e67c4243c7fd7b6424c9567b000bdf860ef3bb"}],"concept.nist.time":[{"id":"assertion.concept.nist.time","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines time-constructible function as: A function t(n) that gives the actual running time of some Turing machine on all inputs of length n.","support":[{"end":181,"quote":"A function t(n) that gives the actual running time of some\nTuring machine\non all inputs of length n.","source_id":"nist-dads.time","source_sha256":"da03b770c61b3b9b4c3938933a5d9ea69c9e2bdfed2d33e34100d1258de1bbd5","start":81}],"target_id":"concept.nist.time","target_kind":"node","target_sha256":"f428319d99f7f85c5e714367685949ca6171776e902e4e570f019425c5989075"}],"concept.nist.timespace":[{"id":"assertion.concept.nist.timespace","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines time/space complexity as: The maximum time or space required by a Turing machine on any input of length n.","support":[{"end":149,"quote":"The maximum time or space required by a\nTuring machine\non any input of length n.","source_id":"nist-dads.timespace","source_sha256":"42950eb01c07e4ee8e612c486a43b18a3e55ef17e46ca99c4be5582b6669e144","start":69}],"target_id":"concept.nist.timespace","target_kind":"node","target_sha256":"063a1d7b5e28a2fd538fc31a9d546f722c4ee7a3568eb99bcb917de004d6bcd3"}],"concept.nist.topologicalorder":[{"id":"assertion.concept.nist.topologicalorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines topological order as: A numbering of the vertices of a directed acyclic graph such that every edge from a vertex numbered i to a vertex numbered j satisfies i<j.","support":[{"end":200,"quote":"A numbering of the\nvertices\nof a\ndirected acyclic graph\nsuch that every\nedge\nfrom a vertex numbered i to a vertex numbered j satisfies i<j.","source_id":"nist-dads.topologicalorder","source_sha256":"fa7d29c3b35060795d634b54548a2192b2c0a9df0562b0bd6d227e3d4af99562","start":61}],"target_id":"concept.nist.topologicalorder","target_kind":"node","target_sha256":"df433210552913c37bb6da43185e257ba3c3647111d0713d3b3aad021bd14a62"}],"concept.nist.topologicalsort":[{"id":"assertion.concept.nist.topologicalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines topological sort as: To arrange items when some pairs of items have no comparison, that is, according to a partial order .","support":[{"end":160,"quote":"To arrange items when some pairs of items have no comparison, that is, according to a\npartial order\n.","source_id":"nist-dads.topologicalsort","source_sha256":"3459970d4754ed89977cc7b4cf41d4d2fd7cdcd617c1ca35af87362485c20b3d","start":59}],"target_id":"concept.nist.topologicalsort","target_kind":"node","target_sha256":"01bf6e3bfb8a68995532cc8a4f2e5e387832a73dd07b14047ff63bc14b00e594"}],"concept.nist.topologytree":[{"id":"assertion.concept.nist.topologytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines topology tree as: Tree that describes a balanced decomposition of another tree, according to its topology. More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at level l represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two children , representing the vertex clusters at level l-1 whose union gives the vertex cluster the node represents.","support":[{"end":529,"quote":"Tree that describes a balanced decomposition of another tree, according to its topology.  More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at\nlevel\nl represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two\nchildren\n, representing the vertex clusters at level l-1 whose\nunion\ngives the vertex cluster the node represents.","source_id":"nist-dads.topologytree","source_sha256":"13a1a35537fa5b53b2603d334d4b4f3e7a98203c030b08cf05564788ac969535","start":53}],"target_id":"concept.nist.topologytree","target_kind":"node","target_sha256":"7b2dbbe29430faa6b54775f33c2f00ec6e24ab3148a8831a1aadae0a859a71d5"}],"concept.nist.totalfunc":[{"id":"assertion.concept.nist.totalfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines total function as: A function which is defined for all inputs of the right type, that is, for all of a domain .","support":[{"end":147,"quote":"A\nfunction\nwhich is defined for all inputs of the right type, that is, for all of a\ndomain\n.","source_id":"nist-dads.totalfunc","source_sha256":"7e28ed8b019861cfe0f4747f4952336ce98eda89289294bbc77f23ae87a57e33","start":55}],"target_id":"concept.nist.totalfunc","target_kind":"node","target_sha256":"d12af238b8eae1e0d202422e3fb02285e77f5319666d1c8b32b71b9545b6085d"}],"concept.nist.totallyundecidableprob":[{"id":"assertion.concept.nist.totallyundecidableprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines totally undecidable problem as: A problem that cannot be solved by a Turing machine .","support":[{"end":134,"quote":"A problem that cannot be solved by a\nTuring machine\n.","source_id":"nist-dads.totallyundecidableprob","source_sha256":"a78f993de62f98cafee4e48c08c0f39dc0378ca1c2586ac1d1ed58be1b8f1a5d","start":81}],"target_id":"concept.nist.totallyundecidableprob","target_kind":"node","target_sha256":"1d9fdd7a1cdee277773692d0eb758cb576500a7166cb35197f01c27e66d38855"}],"concept.nist.totalorder":[{"id":"assertion.concept.nist.totalorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines total order as: An order defined for all pairs of items of a set. For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other. Formal Definition: A total order is a relation that is reflexive , transitive , antisymmetric , and total. Also known as linear order.","support":[{"end":383,"quote":"An order defined for all pairs of items of a set.  For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other.\nFormal Definition:\nA total order is a\nrelation\nthat is\nreflexive\n,\ntransitive\n,\nantisymmetric\n, and total.\nAlso known as\nlinear order.","source_id":"nist-dads.totalorder","source_sha256":"0c5abdfc7840151c68b5594ad4996d1464f6811188e645f54063b53d77f2bc55","start":49}],"target_id":"concept.nist.totalorder","target_kind":"node","target_sha256":"7db247b9d80e93ae5a8633cdfd4b9cf54f2d5a0a3ec114f9f4417f7fd683f501"}],"concept.nist.tractable":[{"id":"assertion.concept.nist.tractable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tractable as: A problem which has an algorithm which computes all instances of it in polynomial time .","support":[{"end":133,"quote":"A problem which has an\nalgorithm\nwhich computes all instances of it in\npolynomial time\n.","source_id":"nist-dads.tractable","source_sha256":"3ad1224500310cd66ff922fe436ba5a2432cc4e5a1b355008c76fc41824585d0","start":45}],"target_id":"concept.nist.tractable","target_kind":"node","target_sha256":"fe19eb57dedfd702540e2aea32e831ff02a0a12d8db0aac7dfcd7a87e129b9a6"}],"concept.nist.transition":[{"id":"assertion.concept.nist.transition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transition as: The change from one state to another in a finite state machine . Analogously, an edge in a directed graph . Also known as state transition, move.","support":[{"end":193,"quote":"The change from one\nstate\nto another in a\nfinite state machine\n.  Analogously, an\nedge\nin a\ndirected graph\n.\nAlso known as\nstate transition, move.","source_id":"nist-dads.transition","source_sha256":"1396ff5579ff22102b87e007950c0064fb7f16523ee9129d7b44b51cb58e0c09","start":47}],"target_id":"concept.nist.transition","target_kind":"node","target_sha256":"a55d8cb7432115695a89c1149406d75ba477bb4aa12222189892ea4073253f2b"}],"concept.nist.transitionfn":[{"id":"assertion.concept.nist.transitionfn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transition function as: A function of the current state and input giving the next state of a finite state machine or Turing machine .","support":[{"end":174,"quote":"A function of the current\nstate\nand input giving the\nnext state\nof a\nfinite state machine\nor\nTuring machine\n.","source_id":"nist-dads.transitionfn","source_sha256":"a4c8f66d88727b9244e75d198eb5933b172a2e401dfe376abf399927240fd002","start":65}],"target_id":"concept.nist.transitionfn","target_kind":"node","target_sha256":"7f18961e2a0fd815e4954efb85bc4f668d9f587de287e2524c87c7f79f2b7f6a"}],"concept.nist.transitive":[{"id":"assertion.concept.nist.transitive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transitive as: A binary relation R for which a R b and b R c implies a R c.","support":[{"end":107,"quote":"A\nbinary relation\nR for which a R b and b R c implies a R c.","source_id":"nist-dads.transitive","source_sha256":"393168db374cea0550cebcd90cdb49ae213018a0efec515c57e5cb2f78ac5640","start":47}],"target_id":"concept.nist.transitive","target_kind":"node","target_sha256":"d1ec4e7818c2825bc8cafc89ee5608508fb3c8e7a39ce99b6096feaac5895b71"}],"concept.nist.transitiveclosure":[{"id":"assertion.concept.nist.transitiveclosure","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines transitive closure as: An extension or superset of a binary relation such that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","support":[{"end":197,"quote":"An extension or superset of a\nbinary relation\nsuch that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","source_id":"nist-dads.transitiveclosure","source_sha256":"efc3bf543ef61bc215238e543ebeb6f2ab051627d163d193f5d5fb94e8c45fba","start":63}],"target_id":"concept.nist.transitiveclosure","target_kind":"node","target_sha256":"3333da8a77f2733ef1140cb1192799f59d9994f2cfc3043e6917a6aa1ca34735"}],"concept.nist.transitivereduction":[{"id":"assertion.concept.nist.transitivereduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transitive reduction as: The transitive reduction of a directed graph G is the directed graph G' with the smallest number of edges such that for every path between vertices in G, G' has a path between those vertices.","support":[{"end":258,"quote":"The transitive reduction of a\ndirected graph\nG is the directed graph G' with the smallest number of\nedges\nsuch that for every\npath\nbetween\nvertices\nin G, G' has a path between those vertices.","source_id":"nist-dads.transitivereduction","source_sha256":"5e7635ff32265ee10f660c4773e983cb27fc87ada8dbc4e401bdeaf0902f3d7a","start":67}],"target_id":"concept.nist.transitivereduction","target_kind":"node","target_sha256":"d2a43563130d4a952f82ca23296bec9c45af9321f8752db9007ab7348060cb0c"}],"concept.nist.travelingsalesman":[{"id":"assertion.concept.nist.travelingsalesman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines traveling salesman as: Find a path through a weighted graph that starts and ends at the same vertex , includes every other vertex exactly once, and minimizes the total cost of edges . Also known as TSP.","support":[{"end":247,"quote":"Find a\npath\nthrough a\nweighted graph\nthat starts and ends at the same\nvertex\n, includes every other vertex exactly once, and minimizes the total cost of\nedges\n.\nAlso known as\nTSP.","source_id":"nist-dads.travelingsalesman","source_sha256":"8a396942ed763dc3422e220a302a36ec64b9bbdc3188b3b68e8d0885c6d89217","start":68}],"target_id":"concept.nist.travelingsalesman","target_kind":"node","target_sha256":"aead32b40bbe3ea72f699fba37eaba198a261cf8451f64bbbfdd7450933a911a"}],"concept.nist.treap":[{"id":"assertion.concept.nist.treap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treap as: A binary search tree in which nodes have another key , called the priority. Operations also keep the nodes heap ordered with regard to the priority.","support":[{"end":190,"quote":"A\nbinary search tree\nin which\nnodes\nhave another\nkey\n, called the priority.  Operations also keep the nodes\nheap ordered\nwith regard to the priority.","source_id":"nist-dads.treap","source_sha256":"81208d00d688e70d26f8a6f5ca9d49d5ff80c6beffee4c333c2fe8ca303c9e53","start":41}],"target_id":"concept.nist.treap","target_kind":"node","target_sha256":"d650cdb05410141af5d15f6a48f197085a19789710853f7ad7a65c3f0b820ba6"}],"concept.nist.tree":[{"id":"assertion.concept.nist.tree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines tree as: (1) A data structure accessed beginning at the root node. Each node is either a leaf or an internal node . An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A connected , undirected , acyclic graph . It is rooted and ordered unless otherwise specified. Thanks to Joshua O'Madadhain ( [email protected] ) for the figure, 6 October 2005. Formal Definition: (1) A tree is either empty (no nodes), or a root and zero or more subtrees. The subtrees are ordered.","support":[{"end":718,"quote":"(1) A data structure accessed beginning at the\nroot\nnode.  Each\nnode\nis either a\nleaf\nor an\ninternal node\n.  An internal node has one or more\nchild\nnodes and is called the\nparent\nof its child nodes.  All children of the same node are\nsiblings\n. Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A\nconnected\n,\nundirected\n,\nacyclic graph\n.  It is\nrooted\nand\nordered\nunless otherwise specified.\nThanks to Joshua O'Madadhain (\n[email protected]\n) for the figure, 6 October 2005.\nFormal Definition:\n(1) A tree is either\nempty (no nodes), or\na root and zero or more subtrees.\nThe subtrees are ordered.","source_id":"nist-dads.tree","source_sha256":"351113c8d10916cb4c43fcb070c122a8828d73bd511765bd5edb0acaab990d0b","start":39}],"target_id":"concept.nist.tree","target_kind":"node","target_sha256":"41f35fad506f76e353579fd65463a8924fc4261c420423a2603ede649f9defc1"}],"concept.nist.treeautomaton":[{"id":"assertion.concept.nist.treeautomaton","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree automaton as: An extension of a finite state machine that operates on n-ary constructors. Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes n states and constructors. Tree automata may be top-down (starting from the root ) or bottom-up (starting from the leaves ), and deterministic or nondeterministic .","support":[{"end":406,"quote":"An extension of a\nfinite state machine\nthat operates on n-ary constructors.  Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes\nn\nstates and constructors.  Tree automata may be top-down (starting from the\nroot\n) or bottom-up (starting from the\nleaves\n), and\ndeterministic\nor\nnondeterministic\n.","source_id":"nist-dads.treeautomaton","source_sha256":"609ca5ae9516c8b5dddc811e4f0f2bf17a2ec18ce7183afb3e639730a5bbd139","start":55}],"target_id":"concept.nist.treeautomaton","target_kind":"node","target_sha256":"ee2e56e080ece989b07952dabc9fbf4d5cebcf5ce73b9a124f009c35164c58bf"}],"concept.nist.treecontrctn":[{"id":"assertion.concept.nist.treecontrctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree contraction as: Contracting a tree by removing some of the nodes.","support":[{"end":108,"quote":"Contracting a\ntree\nby removing some of the nodes.","source_id":"nist-dads.treecontrctn","source_sha256":"44aad98a54e92c0edafb8375b9fe934c28c5c55045ad08b4bc47ef758481747d","start":59}],"target_id":"concept.nist.treecontrctn","target_kind":"node","target_sha256":"03ca34dc72d6c2179fe78ee47626459541119e72c25d3e3a0c097005317fc23e"}],"concept.nist.treeedit":[{"id":"assertion.concept.nist.treeedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree editing problem as: The problem of finding an edit script of minimum cost which transforms a given tree into another given tree.","support":[{"end":175,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\ntree\ninto another given tree.","source_id":"nist-dads.treeedit","source_sha256":"6107c0ab4720bb0f499c2dd2f0b26bdf2e53c58d05cea3ce98c84cec410a0a79","start":67}],"target_id":"concept.nist.treeedit","target_kind":"node","target_sha256":"d9984f62f8bd6c22ae244a5cb98b3f7b26b711892e690bad0c5c18e392ea6ff2"}],"concept.nist.treetraversal":[{"id":"assertion.concept.nist.treetraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree traversal as: A technique for processing the nodes of a tree in some order.","support":[{"end":116,"quote":"A technique for processing the\nnodes\nof a\ntree\nin some order.","source_id":"nist-dads.treetraversal","source_sha256":"b39c669f7aab391c4dfcb5fa17a84da3b94c54db649ce8fcf4c1a8f50e49e035","start":55}],"target_id":"concept.nist.treetraversal","target_kind":"node","target_sha256":"4a89238b1345e4a99d99bb07a047e354f99f4d8bbf253a9000a52bea76b78637"}],"concept.nist.trianglnqlty":[{"id":"assertion.concept.nist.trianglnqlty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines triangle inequality as: The property that a complete weighted graph satisfies weight(u,v) ≤ weight(u,w) + weight(w,v) for all vertices u, v, w. Informally, the graph has no short cuts.","support":[{"end":227,"quote":"The property that a\ncomplete\nweighted graph\nsatisfies  weight(u,v) ≤  weight(u,w) + weight(w,v) for all\nvertices\nu, v, w. Informally, the graph has no short cuts.","source_id":"nist-dads.trianglnqlty","source_sha256":"1cd821017637a91132f9c48551d00e587dfa3a56716f0a75ef901e2bd212324c","start":65}],"target_id":"concept.nist.trianglnqlty","target_kind":"node","target_sha256":"7a14f6503b14ba8532963e9a1bd4a63a2bc83548b03bb50438a24455c79660fe"}],"concept.nist.triconnectedgraph":[{"id":"assertion.concept.nist.triconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines triconnected graph as: A connected graph such that deleting any two vertices (and incident edges ) results in a graph that is still connected.","support":[{"end":182,"quote":"A\nconnected graph\nsuch that deleting any two\nvertices\n(and incident\nedges\n) results in a graph that is still connected.","source_id":"nist-dads.triconnectedgraph","source_sha256":"e339448df1967338c88d9749253a814b8de00a5c40cd365ebf6394bb95beb161","start":63}],"target_id":"concept.nist.triconnectedgraph","target_kind":"node","target_sha256":"6ced114ea6a313f62e9ba9ab479f61d0c1ea64f6549793fee22a2153e50a4f17"}],"concept.nist.trie":[{"id":"assertion.concept.nist.trie","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines trie as: A tree for storing strings in which there is one node for every common prefix . The strings are stored in extra leaf nodes.","support":[{"end":163,"quote":"A\ntree\nfor storing\nstrings\nin which there is one\nnode\nfor every common\nprefix\n.  The strings are stored in extra\nleaf\nnodes.","source_id":"nist-dads.trie","source_sha256":"76381cb85d2cabd53dbdd57c719e90a66be4cd3034a38eb6ffdb58f439be7d03","start":39}],"target_id":"concept.nist.trie","target_kind":"node","target_sha256":"d7923bba0e5fd14cb295e3f549f8f1f019ad2e992f5d9fb1c2f0527491df6819"}],"concept.nist.trinaryfunc":[{"id":"assertion.concept.nist.trinaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines trinary function as: A function with three arguments.","support":[{"end":91,"quote":"A\nfunction\nwith three arguments.","source_id":"nist-dads.trinaryfunc","source_sha256":"108e50511755ab8ff00e6afac7330436ec61c3cdfc54e11118996a1990764713","start":59}],"target_id":"concept.nist.trinaryfunc","target_kind":"node","target_sha256":"49dc4225cd2c606924afb73c78be7818aca8d3a948568376622b1bc2cc22e09b"}],"concept.nist.turingmachine":[{"id":"assertion.concept.nist.turingmachine","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Turing machine as: A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic .","support":[{"end":376,"quote":"A\nmodel of computation\nconsisting of a\nfinite state machine\ncontroller, a read-write head, and an unbounded sequential tape. Depending on the current\nstate\nand symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is\ndeterministic\n.","source_id":"nist-dads.turingmachine","source_sha256":"8268532d26c9e29addd84fe0af76d68ff9c49d162ffe9cfd0ae8c25914b55089","start":55}],"target_id":"concept.nist.turingmachine","target_kind":"node","target_sha256":"c6d89bb3877febea8ab3d152f95af0bd688d43e68d01b7d4bdbd91f61699a806"}],"concept.nist.turingredctn":[{"id":"assertion.concept.nist.turingredctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Turing reduction as: A reduction computable by an oracle Turing machine that halts for all inputs.","support":[{"end":136,"quote":"A\nreduction\ncomputable\nby an\noracle Turing machine\nthat halts for all inputs.","source_id":"nist-dads.turingredctn","source_sha256":"3a24e9eb58f6bc9e1d75611956b0679a9cdbf2f0339f9e1ae4f46f5073432c97","start":59}],"target_id":"concept.nist.turingredctn","target_kind":"node","target_sha256":"ff8c3d641dafe13ff9e77dbac55c08e4318f56ea2294b9ac31920fcf536d0c93"}],"concept.nist.twingridfl":[{"id":"assertion.concept.nist.twingridfl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines twin grid file as: A point access method which is two simultaneous grid files . Points are shuffled between the primary and secondary file to minimize the total size.","support":[{"end":207,"quote":"A\npoint access method\nwhich is two simultaneous\ngrid files\n.  Points are shuffled between the primary and secondary file to minimize the total size.","source_id":"nist-dads.twingridfl","source_sha256":"ee12f94f947d0306c5fa822dff65fbeeaf8f3d7aa761f551995b7df46c390246","start":59}],"target_id":"concept.nist.twingridfl","target_kind":"node","target_sha256":"1723bd195de935e861d5c67d4388ecff8e2f89ca4b9cc2069819e444841458f4"}],"concept.nist.two34tree":[{"id":"assertion.concept.nist.two34tree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 2-3-4 tree as: A B-tree of order 4, that is, internal nodes have two, three, or four children .","support":[{"end":131,"quote":"A\nB-tree\nof order 4, that is,\ninternal nodes\nhave two, three, or four\nchildren\n.","source_id":"nist-dads.two34tree","source_sha256":"98871ff24cc78b5c5577d9a1958d5e50ea049d2461209cb809e99f4b01837ee3","start":51}],"target_id":"concept.nist.two34tree","target_kind":"node","target_sha256":"ab91365d0e6680e367a39eee40d1f322933d8c6c60678a9b5fd928ccd238e574"}],"concept.nist.two3tree":[{"id":"assertion.concept.nist.two3tree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines 2-3 tree as: A B-tree of order 3, that is, internal nodes have two or three children .","support":[{"end":120,"quote":"A\nB-tree\nof order 3, that is,\ninternal nodes\nhave two or three\nchildren\n.","source_id":"nist-dads.two3tree","source_sha256":"20c2a2600dcb3e0e953f457f8cf01f0bcc6b353f4f4a9fa7325820f19f8a9757","start":47}],"target_id":"concept.nist.two3tree","target_kind":"node","target_sha256":"414dbace7d1c3a5c96120fd2a7d0f314a6cd9a87a5c8e32ef4e35d1d4e0ef448"}],"concept.nist.twodimensnal":[{"id":"assertion.concept.nist.twodimensnal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-dimensional as: Dealing with or restricted to a plane. An organization where location can be completely described with exactly two orthogonal axes.","support":[{"end":189,"quote":"Dealing with or restricted to a plane.  An organization where location can be completely described with exactly two orthogonal axes.","source_id":"nist-dads.twodimensnal","source_sha256":"68e9ddb75abed0fd9deb55c2666fcccf25c34932e2ab3e47dd100a6eb2fd954c","start":57}],"target_id":"concept.nist.twodimensnal","target_kind":"node","target_sha256":"15f3bb2f7b42de7d8d5c6aec0cda82a32fd7cbe6186a69d1ea4929f5c2de39be"}],"concept.nist.twolevgrid":[{"id":"assertion.concept.nist.twolevgrid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-level grid file as: A point access method which is two levels of grid files . The first level addresses second level grid files.","support":[{"end":178,"quote":"A\npoint access method\nwhich is two levels of\ngrid files\n.  The first level addresses second level grid files.","source_id":"nist-dads.twolevgrid","source_sha256":"357c3d01afd73c3d9e0efad42925ebed1d4739f9f292db7a627b554f3b80c390","start":69}],"target_id":"concept.nist.twolevgrid","target_kind":"node","target_sha256":"a82c56827170f6c4169ffeed12fda051a6ab5942ea9681813199e0ca6cd78501"}],"concept.nist.ubtree":[{"id":"assertion.concept.nist.ubtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines UB-tree as: Refers to either universal B-tree or unlimited branching tree .","support":[{"end":108,"quote":"Refers to either\nuniversal B-tree\nor\nunlimited branching tree\n.","source_id":"nist-dads.ubtree","source_sha256":"986687126a6c05ff9ca07fd54b7128ae039d02a1012863635b4dab76f179ad92","start":45}],"target_id":"concept.nist.ubtree","target_kind":"node","target_sha256":"11aef5d7064c5d2ff4a4bfc641c57d13315bfbde8765b98c664c74a2fe3618b4"}],"concept.nist.unaryfunc":[{"id":"assertion.concept.nist.unaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unary function as: A function which takes one argument.","support":[{"end":91,"quote":"A\nfunction\nwhich takes one argument.","source_id":"nist-dads.unaryfunc","source_sha256":"73d62ff480a10d8ba80e3bf36575781608e20255225708c08ac4903739e3d754","start":55}],"target_id":"concept.nist.unaryfunc","target_kind":"node","target_sha256":"afa01a71a1a36b9ec4fbcde9592c7edb7d2f904a8277470726156de686abeec3"}],"concept.nist.uncomputablefunction":[{"id":"assertion.concept.nist.uncomputablefunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uncomputable function as: A function that cannot be computed by any algorithm --- equivalently, not by any Turing machine .","support":[{"end":166,"quote":"A function that cannot be computed by any\nalgorithm\n--- equivalently, not by any\nTuring machine\n.","source_id":"nist-dads.uncomputablefunction","source_sha256":"9e124e32ce316151e2f122710c842be31937b9767a3eda55f88155fe9d8ec735","start":69}],"target_id":"concept.nist.uncomputablefunction","target_kind":"node","target_sha256":"0ecfaad40546a2068a06109a30aa5d0245169f23b95e80da4b8960108585decd"}],"concept.nist.undecidablelanguage":[{"id":"assertion.concept.nist.undecidablelanguage","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undecidable language as: A language for which the membership cannot be decided by an algorithm --- equivalently, cannot be recognized by a Turing machine that halts for all inputs.","support":[{"end":222,"quote":"A language for which the membership cannot be decided by an\nalgorithm\n--- equivalently, cannot be recognized by a\nTuring machine\nthat halts for all inputs.","source_id":"nist-dads.undecidablelanguage","source_sha256":"e3b7bbbc85bb26164578fef7edec5fa53f52736f5e6b0580a943b26e9a9daead","start":67}],"target_id":"concept.nist.undecidablelanguage","target_kind":"node","target_sha256":"75f1b72ec157d1d91d70a84a0a6628c6ec07f3d171a920f318849617184eaf69"}],"concept.nist.undecidableproblem":[{"id":"assertion.concept.nist.undecidableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undecidable problem as: A problem that cannot be solved for all cases by any algorithm whatsoever---equivalently, whose associated language cannot be recognized by a Turing machine that halts for all inputs.","support":[{"end":248,"quote":"A problem that cannot be solved for all cases by any\nalgorithm\nwhatsoever---equivalently, whose associated\nlanguage\ncannot be recognized by a\nTuring machine\nthat halts for all inputs.","source_id":"nist-dads.undecidableproblem","source_sha256":"8f19753b49b93c88ed6eb25e47effcbc0ac8355530b021bbf03a87799177aa9b","start":65}],"target_id":"concept.nist.undecidableproblem","target_kind":"node","target_sha256":"956268b7b620d87eeaa1979f0cf070b4e4b7faff4bb524747b3288d84f91f933"}],"concept.nist.undirectedgraph":[{"id":"assertion.concept.nist.undirectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undirected graph as: A graph whose edges are unordered pairs of vertices . That is, each edge connects two vertices. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","support":[{"end":412,"quote":"A\ngraph\nwhose\nedges\nare\nunordered\npairs of\nvertices\n.  That is, each edge connects two vertices.\nFormal Definition:\nA graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n, that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","source_id":"nist-dads.undirectedgraph","source_sha256":"4f9093840fbcf3e8be35fbfec2fa7e3e672519627fc06e4051f01f6030741281","start":63}],"target_id":"concept.nist.undirectedgraph","target_kind":"node","target_sha256":"fa255409445a5e73b91167012493808b3b24f0940b741627e5244d46bec54494"}],"concept.nist.uniformcircuitcomplexity":[{"id":"assertion.concept.nist.uniformcircuitcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform circuit complexity as: The study of complexity classes defined by uniform circuit families .","support":[{"end":148,"quote":"The study of\ncomplexity classes\ndefined by\nuniform circuit families\n.","source_id":"nist-dads.uniformcircuitcomplexity","source_sha256":"18b2b2de6ad3a8cb2afc272c92c4b591890e9c8cbc539322cb8b0bedfc6c1221","start":79}],"target_id":"concept.nist.uniformcircuitcomplexity","target_kind":"node","target_sha256":"b004720b7627e284b0e5a89bc2fafed26c2e0d556863e24d0d00b0692e8c5d80"}],"concept.nist.uniformcircuitfamily":[{"id":"assertion.concept.nist.uniformcircuitfamily","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform circuit family as: A sequence of circuits , one for each input length n, that can be efficiently generated by a Turing machine .","support":[{"end":180,"quote":"A sequence of\ncircuits\n, one for each input length n, that can be efficiently generated by a\nTuring machine\n.","source_id":"nist-dads.uniformcircuitfamily","source_sha256":"b1c824db603ad3ca5a15f7d3b6d79f3d462611b45e16ecf43bd112477faa08cf","start":71}],"target_id":"concept.nist.uniformcircuitfamily","target_kind":"node","target_sha256":"dac89e25680565145614e9a35878f7648ce2badc5feb50e6ff26f45bd15a85eb"}],"concept.nist.uniformmatrx":[{"id":"assertion.concept.nist.uniformmatrx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform matrix as: A matrix having the same number of items in each row.","support":[{"end":112,"quote":"A\nmatrix\nhaving the same number of items in each row.","source_id":"nist-dads.uniformmatrx","source_sha256":"ac9c45c95f5aa4efbda27f2de799dca32baa181eb6f6198653823486ac7a17d4","start":59}],"target_id":"concept.nist.uniformmatrx","target_kind":"node","target_sha256":"5999c2d12b463f6b29f469e2ae3b03f566a674c4ae87fb6d76105d48e5adfca0"}],"concept.nist.union":[{"id":"assertion.concept.nist.union","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines union as: The union of two sets is a set having all members in either set.","support":[{"end":101,"quote":"The union of two\nsets\nis a set having all members in either set.","source_id":"nist-dads.union","source_sha256":"1898c159bf1c1476e50a82d92ceb656bc5f784574035e1eaa191536c9c419938","start":37}],"target_id":"concept.nist.union","target_kind":"node","target_sha256":"e5e8660b11c1ed1dc471205d6ad65174c55438ea822b8de7c23deb18b9a70c93"}],"concept.nist.universalhsh":[{"id":"assertion.concept.nist.universalhsh","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal hashing as: A scheme that chooses randomly from a set of hash functions .","support":[{"end":122,"quote":"A scheme that chooses randomly from a set of\nhash functions\n.","source_id":"nist-dads.universalhsh","source_sha256":"115f87d571c0f2da60e779fda3300205118d964180602db944786f25cc2b605e","start":61}],"target_id":"concept.nist.universalhsh","target_kind":"node","target_sha256":"20d63448ce4aab3a5bd197fb585fb7d83a1e0445316c7ccaf6a40e14c7956f4c"}],"concept.nist.universalstt":[{"id":"assertion.concept.nist.universalstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal state as: A state in an alternating Turing machine from which the machine accepts only if all possible moves lead to acceptance.","support":[{"end":175,"quote":"A\nstate\nin an\nalternating Turing machine\nfrom which the machine accepts only if all possible moves lead to acceptance.","source_id":"nist-dads.universalstt","source_sha256":"34295a02ae457e2d57932bb605511701370a8062519b9b9cb983ecdc9439ecb3","start":57}],"target_id":"concept.nist.universalstt","target_kind":"node","target_sha256":"ddbfdc9947fb2a075f989f06d6824f1a4e5bb103e5ffa2eaf6d388226726b1a2"}],"concept.nist.universaltur":[{"id":"assertion.concept.nist.universaltur","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal Turing machine as: A Turing machine that is capable of simulating any other Turing machine by encoding the latter.","support":[{"end":170,"quote":"A\nTuring machine\nthat is capable of simulating any other Turing machine by encoding the latter.","source_id":"nist-dads.universaltur","source_sha256":"caf7eac6e9e3828f2b2beb008a51979a0ed1588d07beda675a64b4598b391b68","start":75}],"target_id":"concept.nist.universaltur","target_kind":"node","target_sha256":"724ef010af147d3906b37b07036611b8766c83c7d1c478f8e7290a78fc46b745"}],"concept.nist.universe":[{"id":"assertion.concept.nist.universe","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universe as: All potential elements of a set .","support":[{"end":76,"quote":"All potential elements of a\nset\n.","source_id":"nist-dads.universe","source_sha256":"7c8501517a1c564500b8975b1e5383e64191d33ca9756f73bf948283d893864b","start":43}],"target_id":"concept.nist.universe","target_kind":"node","target_sha256":"a794d43807753ce3158143773430775d8a941155217d9c476ec1cd8c18283757"}],"concept.nist.unlimitedbranchingtree":[{"id":"assertion.concept.nist.unlimitedbranchingtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unlimited branching tree as: A forest of ordered trees used to contain ordered lists . The root of each tree is unique. An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element). Lists with common prefixes share nodes. The last node in common has one child for each list. This allows rapid searches for subset inclusion of sequences.","support":[{"end":447,"quote":"A\nforest\nof\nordered trees\nused to contain ordered\nlists\n.  The\nroot\nof each tree is unique.  An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element).  Lists with common\nprefixes\nshare nodes.  The last node in common has one\nchild\nfor each list. This allows rapid searches for\nsubset\ninclusion of sequences.","source_id":"nist-dads.unlimitedbranchingtree","source_sha256":"d6db14c8f251730428c86482ccf2607b94eda08776695fe107b703461158cb5b","start":79}],"target_id":"concept.nist.unlimitedbranchingtree","target_kind":"node","target_sha256":"b8c04fa293e3fb4bf15fab1f705a35e31966ef56c471c5248e39b8f139df2b96"}],"concept.nist.unsolvableproblem":[{"id":"assertion.concept.nist.unsolvableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unsolvable problem as: A computational problem that cannot be solved by a Turing machine . The associated function is called an uncomputable function .","support":[{"end":192,"quote":"A computational problem that cannot be solved by a\nTuring machine\n.  The associated function is called an\nuncomputable function\n.","source_id":"nist-dads.unsolvableproblem","source_sha256":"cce18e6a43b7f23830f0dce2a6105c64fa43ed99af9dc690bdef0d7342fb4658","start":63}],"target_id":"concept.nist.unsolvableproblem","target_kind":"node","target_sha256":"71771254a3051db5938c6c94eaf760e14c38535867d84f818bf47307e8c1acbf"}],"concept.nist.unsortedlist":[{"id":"assertion.concept.nist.unsortedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unsorted list as: A list whose order of items, if any, is not known.","support":[{"end":103,"quote":"A\nlist\nwhose order of items, if any, is not known.","source_id":"nist-dads.unsortedlist","source_sha256":"aeabf63de49483d9e626d945a6af534f2c3daebb4196785c1a77cb57d723a7d1","start":53}],"target_id":"concept.nist.unsortedlist","target_kind":"node","target_sha256":"5c48977f50f2a2a1da617db2ca702c0e5494d78eac16ba5f185eeede13063a58"}],"concept.nist.uppertriangularmatrix":[{"id":"assertion.concept.nist.uppertriangularmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines upper triangular matrix as: A matrix that is only defined at (i,j) when i ≤ j.","support":[{"end":127,"quote":"A\nmatrix\nthat is only defined at (i,j) when i ≤ j.","source_id":"nist-dads.uppertriangularmatrix","source_sha256":"c6bb618f83667613d92a3a4594ceb29e0b5dacc31232c2826495c508ee7a2d00","start":77}],"target_id":"concept.nist.uppertriangularmatrix","target_kind":"node","target_sha256":"a64a3fdc2e448165e2b6fc2ca082170749bb9eeecefef18b07532fc21dc82b30"}],"concept.nist.vanemdeboas":[{"id":"assertion.concept.nist.vanemdeboas","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines van Emde-Boas priority queue as: An efficient implementation of priority queues where insert, delete, get minimum, get maximum, etc. take O(log log N) time, where N is the total possible number of keys . Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a bit vector of size N (if N is small), or a special data structure : an array of priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","support":[{"end":576,"quote":"An efficient implementation of\npriority queues\nwhere insert, delete, get minimum, get maximum, etc. take\nO(log log N)\ntime, where N is the total possible number of\nkeys\n.  Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a\nbit vector\nof size N (if N is small), or a special\ndata structure\n: an\narray\nof priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","source_id":"nist-dads.vanemdeboas","source_sha256":"f1e411601ab99bfa11e7e406b87705196c6c68cea983526606adbc27257def98","start":87}],"target_id":"concept.nist.vanemdeboas","target_kind":"node","target_sha256":"43ec86e07d92ff02678e0e652cacf412b966db67e1e71f01b18f8ee6152ef020"}],"concept.nist.vehiclerouting":[{"id":"assertion.concept.nist.vehiclerouting","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vehicle routing problem as: Find an optimal route of one or more vehicles through a graph . Also known as VRP.","support":[{"end":160,"quote":"Find an\noptimal\nroute of one or more vehicles through a\ngraph\n.\nAlso known as\nVRP.","source_id":"nist-dads.vehiclerouting","source_sha256":"411e7f5d683ab9ab49b40709ccefef289290f803834e449c066cd17d0f189d23","start":78}],"target_id":"concept.nist.vehiclerouting","target_kind":"node","target_sha256":"48e55af93a5f5c9a7b3473485765f68a082de7caffa9d7b5ae19d986d635e83a"}],"concept.nist.venndiagram":[{"id":"assertion.concept.nist.venndiagram","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Venn diagram as: A visual depiction of membership in sets according to binary properties, using overlapping ovals to divide the plane into regions. Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","support":[{"end":457,"quote":"A visual depiction of membership in\nsets\naccording to binary properties, using overlapping ovals to divide the plane into regions.  Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","source_id":"nist-dads.venndiagram","source_sha256":"803a6b2e03d185e71c6eb123412059f7ffbcecd981192372f7d1f75c724213c5","start":51}],"target_id":"concept.nist.venndiagram","target_kind":"node","target_sha256":"fe0fa1bd51ee2a2a5e8cca53d6e3992827063ab4b67ce3e9280f5f591e6a4f50"}],"concept.nist.vertex":[{"id":"assertion.concept.nist.vertex","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines vertex as: An item in a graph . Sometimes referred to as a node .","support":[{"end":94,"quote":"An item in a\ngraph\n.  Sometimes referred to as a\nnode\n.","source_id":"nist-dads.vertex","source_sha256":"ccb68045cc292c76261e2588cca2340a6375c508f723e108cf291f4b772b707d","start":39}],"target_id":"concept.nist.vertex","target_kind":"node","target_sha256":"f73e74e3369fb8f09baf07b47bd888eddc0841e4b777ec170821ff58910312f4"}],"concept.nist.vertexcolor":[{"id":"assertion.concept.nist.vertexcolor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex coloring as: An assignment of colors (or any distinct marks) to the vertices of a graph . Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.","support":[{"end":223,"quote":"An assignment of colors (or any distinct marks) to the\nvertices\nof a\ngraph\n.  Strictly speaking, a coloring is\nproper\nif no two\nadjacent\nvertices have the same color.","source_id":"nist-dads.vertexcolor","source_sha256":"5d4167924d33971a2ce9502fc5eb5a5e40f1173cf891b41182436b95b1fa38dd","start":57}],"target_id":"concept.nist.vertexcolor","target_kind":"node","target_sha256":"2050fbd5534224077f4e7326c5ba69e0f6275c8f27f2d08824188a8276f02eec"}],"concept.nist.vertexconnectivity":[{"id":"assertion.concept.nist.vertexconnectivity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex connectivity as: (1) The smallest number of vertices whose deletion causes a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","support":[{"end":280,"quote":"(1) The smallest number of\nvertices\nwhose deletion causes a\nconnected graph\nto not be connected.  (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","source_id":"nist-dads.vertexconnectivity","source_sha256":"de69de8e2064236224701e3a1cae6fe1d06a9a9061e27bdc4b44e6d9bcf7411c","start":65}],"target_id":"concept.nist.vertexconnectivity","target_kind":"node","target_sha256":"4938290bc6b74212db0de262837d81a00cb7218b014d22ba8a2ebdba873c8241"}],"concept.nist.vertexcover":[{"id":"assertion.concept.nist.vertexcover","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex cover as: A set of vertices in an undirected graph where every edge connects at least one vertex. The vertex cover problem is to find a minimum size set and is NP-complete .","support":[{"end":220,"quote":"A set of\nvertices\nin an\nundirected graph\nwhere every\nedge\nconnects at least one vertex.  The vertex cover problem is to find a minimum size set and is\nNP-complete\n.","source_id":"nist-dads.vertexcover","source_sha256":"5082fe7cc28fad53aa868fb5f19bcdafc75700a47dd24c7f0db7062dcdf8d5a4","start":56}],"target_id":"concept.nist.vertexcover","target_kind":"node","target_sha256":"e42e2d057fe1e6ac43cfa2cd8933eb74dbd9928bba4c45934812c70f57cbe5b2"}],"concept.nist.vertical":[{"id":"assertion.concept.nist.vertical","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertical visibility map as: A partition of the plane into regions by drawing a vertical straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be vertically visible from p.","support":[{"end":320,"quote":"A partition of the plane into regions by drawing a vertical straight line through each\nvertex\np of a planar straight-line\ngraph\nuntil it intersects an\nedge\ne of the graph or extends to infinity.  The edge e is said to be vertically visible from p.","source_id":"nist-dads.vertical","source_sha256":"806e1dfdc1a3f31f7e35c7a8c0888df8504225e1bfe405373095512b26f379f2","start":73}],"target_id":"concept.nist.vertical","target_kind":"node","target_sha256":"c5ec7847f6c32ddba08cfedfe8589c258a43a9b6f1c8cabf6321fe6bb0127fcd"}],"concept.nist.visibilitymap":[{"id":"assertion.concept.nist.visibilitymap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines visibility map as: A planar subdivision that encodes the visibility information, that is, which points are mutually visible .","support":[{"end":161,"quote":"A planar subdivision that encodes the visibility information, that is, which points are mutually\nvisible\n.","source_id":"nist-dads.visibilitymap","source_sha256":"4df75a02892e4fe3de521f29e79cfa15e69b410e10dbad06662dcd8d18a8bb36","start":55}],"target_id":"concept.nist.visibilitymap","target_kind":"node","target_sha256":"b463216ee09b23428febba5d6a83cb5c6610aba7c7dc8349673486db1ddbafa8"}],"concept.nist.visible":[{"id":"assertion.concept.nist.visible","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines visible as: Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","support":[{"end":161,"quote":"Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","source_id":"nist-dads.visible","source_sha256":"f442372f24ae1efab7fa04659cae07bd13f554bb9bb2c067a8fb6d255bfb5951","start":41}],"target_id":"concept.nist.visible","target_kind":"node","target_sha256":"eac74b5c99da10f728de2dcde6b6facb356c523cbc58fb5ace5ee8e29f7b82da"}],"concept.nist.walk":[{"id":"assertion.concept.nist.walk","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines walk as: A path in which edges may be repeated.","support":[{"end":73,"quote":"A\npath\nin which\nedges\nmay be repeated.","source_id":"nist-dads.walk","source_sha256":"466e5a0022cf426ec41d83f929d6328bb297f59c3e05365d6a4b25ba1f297fad","start":35}],"target_id":"concept.nist.walk","target_kind":"node","target_sha256":"c5ef08f40605db763ea697e47c46d2f53a4674cfd08c9a21a2b58e318499e5c6"}],"concept.nist.weakheap":[{"id":"assertion.concept.nist.weakheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weak-heap as: A relaxed heap satisfying the following three conditions: (1) every key in the right subtree of a node is greater than the key stored in the node itself, (2) the root has no left child , and (3) leaves are only found on the last two levels of the tree.","support":[{"end":307,"quote":"A relaxed\nheap\nsatisfying the following three conditions: (1) every\nkey\nin the right subtree of a\nnode\nis greater      than the key stored in the node itself,  (2) the\nroot\nhas no left\nchild\n, and (3)\nleaves\nare only found on the last two\nlevels\nof the tree.","source_id":"nist-dads.weakheap","source_sha256":"3edbcc6dcbee8c6666f8c6b2f0957b6e4295062b79885d90416394ad5f6d3dee","start":49}],"target_id":"concept.nist.weakheap","target_kind":"node","target_sha256":"63f2d9df367f79f47b6135306a12a4924fdbe839f23179d4b8d975b9b6747d72"}],"concept.nist.weighteddigraph":[{"id":"assertion.concept.nist.weighteddigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weighted, directed graph as: A directed graph that has a weight, or numeric value, associated with each edge .","support":[{"end":156,"quote":"A\ndirected graph\nthat has a weight, or numeric value, associated with each\nedge\n.","source_id":"nist-dads.weighteddigraph","source_sha256":"ca711cf15484e11713bcbe0e877d3aa2032c5b73f3ac95958830821ef12c2917","start":75}],"target_id":"concept.nist.weighteddigraph","target_kind":"node","target_sha256":"9912d9a3164219ebeb2ee8e2f4e3b717ee9892284043efbdb4e0a96a040eb279"}],"concept.nist.weightedgraph":[{"id":"assertion.concept.nist.weightedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines weighted graph as: A graph having a weight, or number, associated with each edge . Some algorithms require all weights to be nonnegative, integral, positive, etc. Also known as edge-weighted graph.","support":[{"end":234,"quote":"A\ngraph\nhaving a weight, or number, associated with each\nedge\n.  Some algorithms require all weights to be nonnegative, integral, positive, etc.\nAlso known as\nedge-weighted graph.","source_id":"nist-dads.weightedgraph","source_sha256":"7ab149a777d9c9a5ab45a7462ff944eb47ec011d6f35e9b481e1aaec7db7064a","start":55}],"target_id":"concept.nist.weightedgraph","target_kind":"node","target_sha256":"1ab0db6ab8636712447cdc557b8aae95d8f124dd875b3985aab4307a74ff3ee3"}],"concept.nist.window":[{"id":"assertion.concept.nist.window","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines window as: substring of the text that is aligned with the pattern .","support":[{"end":95,"quote":"substring\nof the\ntext\nthat is aligned with the\npattern\n.","source_id":"nist-dads.window","source_sha256":"b8a12053855a784e65b98160b6bc7faf216149bb2399fdbd6bd1f4dc8fb7aa98","start":39}],"target_id":"concept.nist.window","target_kind":"node","target_sha256":"df5491448f28f511f27396ddd7d84e6423cbf4e4c2e24bd389088be2bcaf882c"}],"concept.nist.witness":[{"id":"assertion.concept.nist.witness","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines witness as: (1) a structure providing an easily verified bound on the optimal value of an optimization problem . Typically used in the analysis of an approximation algorithm to prove the performance guarantee . (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","support":[{"end":452,"quote":"(1) a structure providing an easily verified bound on the\noptimal value\nof an\noptimization problem\n.  Typically used in the analysis of an\napproximation algorithm\nto prove the\nperformance guarantee\n. (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","source_id":"nist-dads.witness","source_sha256":"ed062b1b19a9f92beee49f16cc9268f6fd05307148554cfb089ba46af2477c53","start":41}],"target_id":"concept.nist.witness","target_kind":"node","target_sha256":"5dcc9b3481e7be4945bb70bb5a9d34e4af1e19823598821a82c4791cad1042a8"}],"concept.nist.work":[{"id":"assertion.concept.nist.work","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work as: The total number of operations taken by a computation.","support":[{"end":89,"quote":"The total number of operations taken by a computation.","source_id":"nist-dads.work","source_sha256":"6d9de56ae424e6da2b8fd040b27eb6b3eafb49851231c8304d5e715b56f819db","start":35}],"target_id":"concept.nist.work","target_kind":"node","target_sha256":"f1d1e9cca0d1eb0ec4d488862d36ce73675904c9e815f295821602b2cd844985"}],"concept.nist.workdepthmdl":[{"id":"assertion.concept.nist.workdepthmdl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-depth model as: A model of parallel computation in which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","support":[{"end":211,"quote":"A\nmodel of parallel computation\nin which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","source_id":"nist-dads.workdepthmdl","source_sha256":"32600e077c1e37431859671e951f5401649a356e12c5ad3da082ecf0cdebc15b","start":59}],"target_id":"concept.nist.workdepthmdl","target_kind":"node","target_sha256":"ca6a4c014c606ab55479b5ac6c4dd85512c8b54256da5a3c57920396798d6832"}],"concept.nist.workefficint":[{"id":"assertion.concept.nist.workefficint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-efficient as: A parallel algorithm which asymptotically requires at most a constant factor more work than the best known sequential algorithm or the optimal work.","support":[{"end":203,"quote":"A parallel\nalgorithm\nwhich asymptotically requires at most a constant factor more\nwork\nthan the best known sequential algorithm or the\noptimal\nwork.","source_id":"nist-dads.workefficint","source_sha256":"e0c07c094387fafbdc0c00b10f5e2d45e7be80d518601911061feb68b5dd089f","start":55}],"target_id":"concept.nist.workefficint","target_kind":"node","target_sha256":"9d95f70cf86e5bfbd55ce8ecab522da396cf4a033fb9bec369186996ba53ac2d"}],"concept.nist.workpreserv":[{"id":"assertion.concept.nist.workpreserv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-preserving as: A translation of an algorithm from one model of computation to another in which the work is the same in both models, to within a constant factor.","support":[{"end":202,"quote":"A translation of an\nalgorithm\nfrom one\nmodel of computation\nto another in which the\nwork\nis the same in both models, to within a constant factor.","source_id":"nist-dads.workpreserv","source_sha256":"e897a90639b4f18e917d2b28bb05e4fe33e628c889da7d92e153183dad61ab93","start":57}],"target_id":"concept.nist.workpreserv","target_kind":"node","target_sha256":"ffd5b22f567bf4f08718b07e9165f2c1581d7cbcd03376be2b6b80e922b1d2e4"}],"concept.nist.worstcase":[{"id":"assertion.concept.nist.worstcase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst case as: (1) The situation or input that forces an algorithm or data structure to take the most time or resources. (2) Having to do with this situation or input.","support":[{"end":199,"quote":"(1) The situation or input that forces an\nalgorithm\nor\ndata structure\nto take the most time or resources. (2) Having to do with this situation or input.","source_id":"nist-dads.worstcase","source_sha256":"0878aa469483326267f2bf0709b75b40e0ecbb94022bb0fded7fccae885c998a","start":47}],"target_id":"concept.nist.worstcase","target_kind":"node","target_sha256":"6799fab7ee22ee07b65480749e594ba6f2ad258d12ff3928db14a383dfc336df"}],"concept.nist.worstcasecost":[{"id":"assertion.concept.nist.worstcasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case cost as: The highest possible use of resources of an algorithm , which occurs for the most pessimistic, or worst possible, input.","support":[{"end":177,"quote":"The highest possible use of resources of an\nalgorithm\n, which occurs for the most pessimistic, or worst possible, input.","source_id":"nist-dads.worstcasecost","source_sha256":"eb75b4afd382953bf80b4bdcb5757e26e2bcafcfe4275ec9a1c1018620fd4975","start":57}],"target_id":"concept.nist.worstcasecost","target_kind":"node","target_sha256":"bb4c2fd11695bd13e71255efe3dc3218f0a0f92108068054ddeddbfa4f8afd5a"}],"concept.nist.worstcaseexecutiontime":[{"id":"assertion.concept.nist.worstcaseexecutiontime","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case execution time as: The execution time of an algorithm in the worst case . Also known as WCET.","support":[{"end":151,"quote":"The execution time of an\nalgorithm\nin the\nworst case\n.\nAlso known as\nWCET.","source_id":"nist-dads.worstcaseexecutiontime","source_sha256":"337fe93f15547de28f309d866ffc9bc798673f79a55eb6f13a10746bc44f7a2d","start":77}],"target_id":"concept.nist.worstcaseexecutiontime","target_kind":"node","target_sha256":"a2c5c2ff318114609837c4c9da7c7fd3f3f04760c12d3cd33d59b595c3670176"}],"concept.nist.worstcaseminimumaccess":[{"id":"assertion.concept.nist.worstcaseminimumaccess","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case minimum access as: A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the worst case .","support":[{"end":197,"quote":"A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the\nworst case\n.","source_id":"nist-dads.worstcaseminimumaccess","source_sha256":"6565125455858c733024d96be5ac6b24ef9fcc0734647dd83e499497634694cd","start":77}],"target_id":"concept.nist.worstcaseminimumaccess","target_kind":"node","target_sha256":"83aac529f3be0425a2af55acad61361ef461c67b18af644637c14203b91c9c6b"}],"concept.nist.xor":[{"id":"assertion.concept.nist.xor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines xor as: \"Exclusive OR\" or \"not equal to\" function: 0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0. Also known as exclusive or.","support":[{"end":156,"quote":"\"Exclusive OR\" or \"not equal to\" function:  0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0.\nAlso known as\nexclusive or.","source_id":"nist-dads.xor","source_sha256":"be7013e771be17dc9c76beb32237894b8d3a1e7d978bbaefd3265038cd42ff96","start":33}],"target_id":"concept.nist.xor","target_kind":"node","target_sha256":"c5bbc076186ac340c4e2ec70a40f5badfe4fb16b1d49809127de5d9e00ff40cc"}],"concept.nist.zeroaryfunc":[{"id":"assertion.concept.nist.zeroaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 0-ary function as: A function that takes no arguments. Also known as nullary function.","support":[{"end":122,"quote":"A\nfunction\nthat takes no arguments.\nAlso known as\nnullary function.","source_id":"nist-dads.zeroaryfunc","source_sha256":"68a2936758ae36a87ec9d46b612c3e268198cae82f2db9e30dee7dade199b721","start":55}],"target_id":"concept.nist.zeroaryfunc","target_kind":"node","target_sha256":"b5eabc38bbc3575f51f6f5791c35c9b80beec80f048ba0853ba6225cc575bc79"}],"concept.nist.zerobasedindexing":[{"id":"assertion.concept.nist.zerobasedindexing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 0-based indexing as: Indexing (an array ) beginning with 0.","support":[{"end":97,"quote":"Indexing (an\narray\n) beginning with 0.","source_id":"nist-dads.zerobasedindexing","source_sha256":"e8718c0dbc0f9b5b720f30b22ae5f5caf74dc66a25ffb26d1d10c543714263eb","start":59}],"target_id":"concept.nist.zerobasedindexing","target_kind":"node","target_sha256":"45f52d3c0d555e80fef2ff7d705538bfe81e168ef3942a16e304c4f0c92f6174"}],"concept.nist.zipfian":[{"id":"assertion.concept.nist.zipfian","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zipfian distribution as: A distribution of probabilities of occurrence that follows Zipf's law . Also known as Yule distribution.","support":[{"end":171,"quote":"A distribution of probabilities of occurrence that follows\nZipf's law\n.\nAlso known as\nYule distribution.","source_id":"nist-dads.zipfian","source_sha256":"8c910cf37dbb429ef56871c53b7a5120b74eb6ce333ac64d7dbae88e19363044","start":67}],"target_id":"concept.nist.zipfian","target_kind":"node","target_sha256":"5bc6b612a4e92e49b16c75ed5d61f75ec64f01088993ed409f0f75aa4f54a544"}],"concept.nist.zipper":[{"id":"assertion.concept.nist.zipper","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines zipper as: A data structure equivalent to a binary tree that is \"opened\" so that some node is accessible. It consists of a pair: the current node, along with information to reconstruct the tree. Reconstruction information is called the path or context. A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path. A similar operation moves to the right child. A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","support":[{"end":640,"quote":"A data structure equivalent to a\nbinary tree\nthat is \"opened\" so that some\nnode\nis accessible.  It consists of a pair: the current node, along with information to reconstruct the tree.  Reconstruction information is called the path or context.  A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path.  A similar operation moves to the right child.  A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","source_id":"nist-dads.zipper","source_sha256":"476c0690ec2c658548ca35052c19429ad974c6136802937b78133882beed4414","start":43}],"target_id":"concept.nist.zipper","target_kind":"node","target_sha256":"1988e758ad6ccc9983c36184489626f8077e88be1c2e67de8e5d89e9dd344f2c"}],"concept.nist.zpp":[{"id":"assertion.concept.nist.zpp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ZPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \" Z ero error P robability in P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that halts in polynomial time . M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","support":[{"end":505,"quote":"The class of\nlanguages\nfor which a membership computation by a\nprobabilistic Turing machine\nhalts in\npolynomial time\nwith no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \"\nZ\nero error\nP\nrobability in\nP\nolynomial\" time.\nFormal Definition:\nFor a language, S, there exists a\nprobabilistic Turing machine\n, M, that halts in\npolynomial time\n.  M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","source_id":"nist-dads.zpp","source_sha256":"1eb4d48640b0c44e545883851bb7e7bae3b435f264ec55d07df1f3cc07df22f1","start":33}],"target_id":"concept.nist.zpp","target_kind":"node","target_sha256":"94ef8078bc45ed461ff9e85602ab472ace4a02f9a00b05759205374f46346eb9"}],"concept.null-result-constraint":[{"id":"assertion.complete.concept.null-result-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP search reports no excess above expected backgrounds and places conditional limits on WIMP-nucleon cross sections. A bounded exclusion is the outcome described here.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.null-result-constraint","target_kind":"node","target_sha256":"74c8f32c706d64e057bc6214dd5bbecba112958a691e2ea3d795bdb28e2361c8"}],"concept.planetmath.abeliangroup":[{"id":"assertion.concept.planetmath.abeliangroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Abelian group as stated in the captured PlanetMath entry abeliangroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20K99) states: Let ( G , * ) be a group. If for any a , b ∈ G we have a * b = b * a , we say that the group is abelian (or commutative ).","support":[{"end":150,"quote":"Let\n(\nG\n,\n*\n)\nbe a group. If for any\na\n,\nb\n∈\nG\nwe have\na\n*\nb\n=\nb\n*\na\n, we say that the group is\nabelian\n(or\ncommutative\n).","source_id":"planetmath.abeliangroup","source_sha256":"e84c1edb33261a2e634b196ad714e7709088e3a3b05a73c8e83616408766b223","start":28}],"target_id":"concept.planetmath.abeliangroup","target_kind":"node","target_sha256":"b62694a61804a23b522e5594d1fd47ee16588808fa2a7fa906d2da9af04108a4"}],"concept.planetmath.absolutevalue":[{"id":"assertion.concept.planetmath.absolutevalue","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Absolute value as stated in the captured PlanetMath entry absolutevalue","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13-00, 11A15) states: Let R be an ordered ring and let a ∈ R . The absolute value of a is defined to be the function | | : R → R given by | a | := { a if ⁢ a ≥ 0 , - a otherwise.","support":[{"end":186,"quote":"Let\nR\nbe an\nordered ring\nand let\na\n∈\nR\n. The\nabsolute value\nof\na\nis defined to be the\nfunction\n|\n|\n:\nR\n→\nR\ngiven by\n|\na\n|\n:=\n{\na\nif\n⁢\na\n≥\n0\n,\n-\na\notherwise.","source_id":"planetmath.absolutevalue","source_sha256":"22eac82afc6473814dc632829398291d096d5ff6eba482bff1b43ffcf7f98329","start":30}],"target_id":"concept.planetmath.absolutevalue","target_kind":"node","target_sha256":"fa6941c06255e9dff5c5418c910f8e0631960b847d9f4e0b06c9d37d59bc6ad0"}],"concept.planetmath.absolutevalueinavectorlattice":[{"id":"assertion.concept.planetmath.absolutevalueinavectorlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Absolute value in a vector lattice as stated in the captured PlanetMath entry absolutevalueinavectorlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A40, 06F20) states: Let V be a vector lattice over ℝ , and V + be its positive cone .","support":[{"end":135,"quote":"Let\nV\nbe a\nvector lattice\nover\nℝ\n, and\nV\n+\nbe its\npositive cone\n.","source_id":"planetmath.absolutevalueinavectorlattice","source_sha256":"dbd6a022fb3f74146a3390eaa2c25c8937aa85614e57395257ceaff10459c79b","start":70}],"target_id":"concept.planetmath.absolutevalueinavectorlattice","target_kind":"node","target_sha256":"0067ec16cbff2eab1f0129573cbee1dfcbde3e8008e0521a21c606f861719607"}],"concept.planetmath.ackermannfunction":[{"id":"assertion.concept.planetmath.ackermannfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ackermann function as stated in the captured PlanetMath entry ackermannfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D75) states: Ackermann’s function A ⁢ ( x , y ) is defined by the recurrence relations A ⁢ ( 0 , y ) = y + 1 A ⁢ ( x + 1 , 0 ) = A ⁢ ( x , 1 ) A ⁢ ( x + 1 , y + 1 ) = A ⁢ ( x , A ⁢ ( x + 1 , y ) ) Ackermann’s function is an example of a recursive function that is not primitive recursive , but is instead μ - recursive (that is, Turing-computable ).","support":[{"end":374,"quote":"Ackermann’s\nfunction\nA\n⁢\n(\nx\n,\ny\n)\nis defined by the\nrecurrence relations\nA\n⁢\n(\n0\n,\ny\n)\n=\ny\n+\n1\nA\n⁢\n(\nx\n+\n1\n,\n0\n)\n=\nA\n⁢\n(\nx\n,\n1\n)\nA\n⁢\n(\nx\n+\n1\n,\ny\n+\n1\n)\n=\nA\n⁢\n(\nx\n,\nA\n⁢\n(\nx\n+\n1\n,\ny\n)\n)\nAckermann’s function is an example of a\nrecursive function\nthat is not\nprimitive recursive\n, but is instead\nμ\n-\nrecursive\n(that is,\nTuring-computable\n).","source_id":"planetmath.ackermannfunction","source_sha256":"c19855f6ca02b81858bb3b9bc04bd2a3b3e05839168ff0dcf7e83f88165ed344","start":38}],"target_id":"concept.planetmath.ackermannfunction","target_kind":"node","target_sha256":"4f03852f8641397568def135923d6deb22a605e279a3c2d37e64ff57ab03eea0"}],"concept.planetmath.addition":[{"id":"assertion.concept.planetmath.addition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Addition as stated in the captured PlanetMath entry addition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11B25, 00A06, 00A05) states: Addition is a mathematical operation in which two or more numbers are added up.","support":[{"end":97,"quote":"Addition\nis a mathematical\noperation\nin which two or more numbers are added up.","source_id":"planetmath.addition","source_sha256":"e703184a966d6b782bee0f9279d909c909b14e2a6dd3317cd6860b1a3a56f0c3","start":18}],"target_id":"concept.planetmath.addition","target_kind":"node","target_sha256":"1b4eb07e1d50589fc31b5f183a7f9af5b46994dd83bc5eba9fd676a4d4b196ec"}],"concept.planetmath.additive":[{"id":"assertion.concept.planetmath.additive","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Additive as stated in the captured PlanetMath entry additive","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let ϕ be some positive-valued set function defined on an algebra of sets 𝒜 .","support":[{"end":94,"quote":"Let\nϕ\nbe some positive-valued\nset function\ndefined on an\nalgebra of sets\n𝒜\n.","source_id":"planetmath.additive","source_sha256":"85d802640c74ec79d3667c49899cfb659a025bd2bd8a15a5967e9db62d1940ea","start":18}],"target_id":"concept.planetmath.additive","target_kind":"node","target_sha256":"4024b40cb453e4a1dec12abcb2fac7dd49122f6724e8e6ec0496a94279480e93"}],"concept.planetmath.adjointendomorphism":[{"id":"assertion.concept.planetmath.adjointendomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Adjoint endomorphism as stated in the captured PlanetMath entry adjointendomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04, 15A63) states: Definition (the bilinear case). Let U be a finite-dimensional vector space over a field 𝕂 , and B : U × U → 𝕂 a symmetric , non-degenerate bilinear mapping , for example a real inner product .","support":[{"end":234,"quote":"Definition (the bilinear case).\nLet\nU\nbe a\nfinite-dimensional\nvector space\nover a field\n𝕂\n, and\nB\n:\nU\n×\nU\n→\n𝕂\na\nsymmetric\n,\nnon-degenerate\nbilinear mapping\n, for example\na real\ninner product\n.","source_id":"planetmath.adjointendomorphism","source_sha256":"cc6f074357b9f08a981ceb5b2cdf4f0d0ecea2a2fc5ed5f5ae5eb85da17b5715","start":42}],"target_id":"concept.planetmath.adjointendomorphism","target_kind":"node","target_sha256":"64c1f90fb5bf6b1f685fb874fbd3c85faf41ba36e62bf4254820fec0da8f3485"}],"concept.planetmath.algebraicgeometry":[{"id":"assertion.concept.planetmath.algebraicgeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Algebraic geometry as stated in the captured PlanetMath entry algebraicgeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 14-00) states: Introduction Algebraic geometry is the study of algebraic objects using geometrical tools.","support":[{"end":128,"quote":"Introduction\nAlgebraic geometry\nis the study of\nalgebraic\nobjects using geometrical tools.","source_id":"planetmath.algebraicgeometry","source_sha256":"bc628fa5e68d473b3df7a22847f4ceb1dc06d8c6408c61d346a3dc7b225ed86f","start":38}],"target_id":"concept.planetmath.algebraicgeometry","target_kind":"node","target_sha256":"dc71f8c4a3af149a66e5a46447eae6d8cabb741d25f4b2fd335c82c69a84b6dd"}],"concept.planetmath.algebraicsystem":[{"id":"assertion.concept.planetmath.algebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Algebraic system as stated in the captured PlanetMath entry algebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A05, 03E99, 08A62) states: An algebraic system , loosely speaking, is a set, together with some operations on the set.","support":[{"end":125,"quote":"An\nalgebraic system\n, loosely speaking, is a set, together with some\noperations\non the set.","source_id":"planetmath.algebraicsystem","source_sha256":"fb1c27cd75bdbee2a9ab4f391372e15749b078f2e79b06e0c30539a3320e9584","start":34}],"target_id":"concept.planetmath.algebraicsystem","target_kind":"node","target_sha256":"65dcf20c77cf49789d055f3e82457c01c1e65d6dd7a123330362086c458c5544"}],"concept.planetmath.alternatingform":[{"id":"assertion.concept.planetmath.alternatingform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Alternating form as stated in the captured PlanetMath entry alternatingform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A63) states: A bilinear form A on a vector space V (over a field k ) is called an alternating form if for all v ∈ V , A ⁢ ( v , v ) = 0 .","support":[{"end":158,"quote":"A\nbilinear form\nA\non a\nvector space\nV\n(over a field\nk\n) is called an\nalternating form\nif for all\nv\n∈\nV\n,\nA\n⁢\n(\nv\n,\nv\n)\n=\n0\n.","source_id":"planetmath.alternatingform","source_sha256":"1e7f36f89fc94d70a0cf54ae0690009606bb2d040a1939a26d96067f65134949","start":34}],"target_id":"concept.planetmath.alternatingform","target_kind":"node","target_sha256":"b989858864896382581054fdc3f743437151f5364dfaf6c41a0381f8499c8d8f"}],"concept.planetmath.alternativecharacterizationsofrecursivefunctions":[{"id":"assertion.concept.planetmath.alternativecharacterizationsofrecursivefunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Alternative characterizations of recursive functions as stated in the captured PlanetMath entry alternativecharacterizationsofrecursivefunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03D20) states: The class of recursive functions may be characterized by considerably weaker conditions than those given in the entry “recursive function ( http://planetmath.org/RecursiveFunction )” of this encyclopaedia.","support":[{"end":311,"quote":"The class of\nrecursive functions\nmay be characterized by considerably weaker conditions than those given in the entry “recursive function (\nhttp://planetmath.org/RecursiveFunction\n)” of this encyclopaedia.","source_id":"planetmath.alternativecharacterizationsofrecursivefunctions","source_sha256":"7ff075fdbaccebc58a128ecc9ee09b6cf133afc8beadd8b321d812635af554b9","start":106}],"target_id":"concept.planetmath.alternativecharacterizationsofrecursivefunctions","target_kind":"node","target_sha256":"5d53b64282632074aaaa1fd4ce7f5563b39160ac4c31fe20091090cc5181c520"}],"concept.planetmath.ampheck":[{"id":"assertion.concept.planetmath.ampheck","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ampheck as stated in the captured PlanetMath entry ampheck","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05, 03-03, 01A55) states: Ampheck , from the Greek α ⁢ μ ⁢ ϕ ⁢ η ⁢ κ ⁢ η ⁢ ς , double-edged , is a term coined by Charles Sanders Peirce for either one of the pair of logically dual operators , variously referred to as Peirce arrows , Sheffer strokes , or logical NAND and logical NNOR.","support":[{"end":276,"quote":"Ampheck\n, from the Greek\nα\n⁢\nμ\n⁢\nϕ\n⁢\nη\n⁢\nκ\n⁢\nη\n⁢\nς\n,\ndouble-edged\n, is a term coined by\nCharles Sanders Peirce\nfor either one of the pair of logically dual\noperators\n, variously referred to as\nPeirce arrows\n,\nSheffer strokes\n, or logical NAND and logical NNOR.","source_id":"planetmath.ampheck","source_sha256":"175c1227008208bc05882fd4c057e431cb99e6c010f5d3885d87bc6ce49fd732","start":16}],"target_id":"concept.planetmath.ampheck","target_kind":"node","target_sha256":"612cf6f2439ed235bc7389c3956c43dc275c454e3cfa53a6cb48860fa726f2ff"}],"concept.planetmath.amsmscclassificationofarticlesandconversiontables":[{"id":"assertion.concept.planetmath.amsmscclassificationofarticlesandconversiontables","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"AMS MSC classification of articles and conversion tables as stated in the captured PlanetMath entry amsmscclassificationofarticlesandconversiontables","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 00-02, 00-01) states: 1 Links to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website Because the AMS MSC classification list or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the complete Table of AMS MSC2010 classifications: http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf All MSC 2010 in one PDF : http://www.ams.org/mathscinet/msc/msc2010.html The AMS MSC website with its maths specialized Search Engine 1.1 Conversion Tables http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf CONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000 M ⁢ S ⁢ C ⁢ 2000 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s → M ⁢ S ⁢ C ⁢ 2010 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s ⁢ U ⁢ p ⁢ d ⁢ a ⁢ t ⁢ e .","support":[{"end":1002,"quote":"1\nLinks to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website\nBecause the AMS MSC\nclassification\nlist or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the\ncomplete\nTable of AMS MSC2010 classifications:\nhttp://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf\nAll MSC 2010 in one PDF :\nhttp://www.ams.org/mathscinet/msc/msc2010.html\nThe AMS MSC website with its maths specialized Search Engine\n1.1\nConversion Tables\nhttp://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf\nCONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000\nM\n⁢\nS\n⁢\nC\n⁢\n2000\n⁢\nC\n⁢\nl\n⁢\na\n⁢\ns\n⁢\ns\n⁢\ni\n⁢\nf\n⁢\ni\n⁢\nc\n⁢\na\n⁢\nt\n⁢\ni\n⁢\no\n⁢\nn\n⁢\nC\n⁢\no\n⁢\nd\n⁢\ne\n⁢\ns\n→\nM\n⁢\nS\n⁢\nC\n⁢\n2010\n⁢\nC\n⁢\nl\n⁢\na\n⁢\ns\n⁢\ns\n⁢\ni\n⁢\nf\n⁢\ni\n⁢\nc\n⁢\na\n⁢\nt\n⁢\ni\n⁢\no\n⁢\nn\n⁢\nC\n⁢\no\n⁢\nd\n⁢\ne\n⁢\ns\n⁢\nU\n⁢\np\n⁢\nd\n⁢\na\n⁢\nt\n⁢\ne\n.","source_id":"planetmath.amsmscclassificationofarticlesandconversiontables","source_sha256":"7ff100ad22010dbea257eb2035564da0888770a498cb1b8389fcf941b03040bc","start":114}],"target_id":"concept.planetmath.amsmscclassificationofarticlesandconversiontables","target_kind":"node","target_sha256":"cfb3b148364ae0c3d6db04a51c6755f58944300f983fd7ced37f97784a9a3372"}],"concept.planetmath.analytichierarchy":[{"id":"assertion.concept.planetmath.analytichierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Analytic hierarchy as stated in the captured PlanetMath entry analytichierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: The analytic hierarchy is a hierarchy of either (depending on context ) formulas or relations similar to the arithmetical hierarchy .","support":[{"end":171,"quote":"The\nanalytic hierarchy\nis a hierarchy of either (depending on\ncontext\n)\nformulas\nor\nrelations\nsimilar\nto the\narithmetical hierarchy\n.","source_id":"planetmath.analytichierarchy","source_sha256":"60c39fb7f2a8b126b2129750e018c84ade3c05dfec3ba066f320ea44e37a3886","start":38}],"target_id":"concept.planetmath.analytichierarchy","target_kind":"node","target_sha256":"0191f4e3c561133cbc249292d22121bf9de9b8e188d814963d196f6e8824035a"}],"concept.planetmath.analyticsandformallogicsinmetamathematics":[{"id":"assertion.concept.planetmath.analyticsandformallogicsinmetamathematics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Analytics and formal logics in meta-mathematics as stated in the captured PlanetMath entry analyticsandformallogicsinmetamathematics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 53B21, 03G30, 03G20, 03B22, 01A60, 18-00, 03G30, 46M15, 03B22, 03B50, 03B15) states: This is a topic on meta-theories , metalogic and metamathematics founded in formal logic .","support":[{"end":186,"quote":"This is a topic on\nmeta-theories\n,\nmetalogic\nand\nmetamathematics\nfounded in\nformal logic\n.","source_id":"planetmath.analyticsandformallogicsinmetamathematics","source_sha256":"3971ecfe9587915fa11506d5a560b78731948a3b402e5142b7d21a49312c43ec","start":96}],"target_id":"concept.planetmath.analyticsandformallogicsinmetamathematics","target_kind":"node","target_sha256":"84cb035b3b90c3dad153f150704bd97612c55f47f13d8fef167772c4e5484c99"}],"concept.planetmath.annihilator":[{"id":"assertion.concept.planetmath.annihilator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Annihilator as stated in the captured PlanetMath entry annihilator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D10) states: Let R be a ring, and suppose that M is a left R -module and N a right R -module.","support":[{"end":104,"quote":"Let\nR\nbe a ring, and suppose that\nM\nis a left\nR\n-module and\nN\na right\nR\n-module.","source_id":"planetmath.annihilator","source_sha256":"55b5aa18ae99776e02170cba6af19bd0214636317714e5dd2c2e8a9dee77676d","start":24}],"target_id":"concept.planetmath.annihilator","target_kind":"node","target_sha256":"0b3014c20c78e92e9be75e0f1672b18df4dc0a2af94b8a2dd573a72eec12eaca"}],"concept.planetmath.anoutlineofhilbertsprogramme":[{"id":"assertion.concept.planetmath.anoutlineofhilbertsprogramme","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"An outline of Hilbert’s programme as stated in the captured PlanetMath entry anoutlineofhilbertsprogramme","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: Contents: 1 Initial definitions. Formalism 2 The two senses of the term ”axiomatic” 3 Meaning is in the model 4 Finite and infinite models 5 Hilbert’s Ansatz 6 Finitist inference 7 The rules of induction and recursion 8 From meaning to logic 9 Negation and disjunction 10 The consistency problem 11 Metamathematics 12 Beyond Incompleteness 1 Initial definitions.","support":[{"end":430,"quote":"Contents:\n1\nInitial definitions. Formalism\n2\nThe two senses of the term ”axiomatic”\n3\nMeaning is in the model\n4\nFinite and infinite models\n5\nHilbert’s\nAnsatz\n6\nFinitist inference\n7\nThe rules of induction and recursion\n8\nFrom meaning to logic\n9\nNegation and disjunction\n10\nThe consistency problem\n11\nMetamathematics\n12\nBeyond Incompleteness\n1\nInitial definitions.","source_id":"planetmath.anoutlineofhilbertsprogramme","source_sha256":"4b4a2471b363e2156efb6e5d7c4aeef3d12a04ffdebf5bc8925b33949d90f150","start":68}],"target_id":"concept.planetmath.anoutlineofhilbertsprogramme","target_kind":"node","target_sha256":"424fcd8cf4bcdd5758772b20553dbcbf19b1414d906fc9ac769c17e8aadc1852"}],"concept.planetmath.antisymmetricmapping":[{"id":"assertion.concept.planetmath.antisymmetricmapping","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Antisymmetric mapping as stated in the captured PlanetMath entry antisymmetricmapping","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69, 15A63) states: Let U and V be a vector spaces over a field K . A bilinear mapping B : U × U → V is said to be antisymmetric if B ⁢ ( u , u ) = 0 (1) for all u ∈ U .","support":[{"end":193,"quote":"Let\nU\nand\nV\nbe a\nvector spaces\nover a field\nK\n. A bilinear mapping\nB\n:\nU\n×\nU\n→\nV\nis said to be\nantisymmetric\nif\nB\n⁢\n(\nu\n,\nu\n)\n=\n0\n(1)\nfor all\nu\n∈\nU\n.","source_id":"planetmath.antisymmetricmapping","source_sha256":"eb77a59e32f158a08651a70ef3790868194871b403904dfc9219b5233fe16c2f","start":44}],"target_id":"concept.planetmath.antisymmetricmapping","target_kind":"node","target_sha256":"e045534057d6c60ac3fe5710ca2521a96908242469298a212764c1dfc56391eb"}],"concept.planetmath.arithmetic":[{"id":"assertion.concept.planetmath.arithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arithmetic as stated in the captured PlanetMath entry arithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: Arithmetic is ” the science of numbers and operations on sets of numbers.","support":[{"end":95,"quote":"Arithmetic\nis ” the science of numbers and\noperations\non sets of numbers.","source_id":"planetmath.arithmetic","source_sha256":"a54060ae4f3635d01be6d37097ec8212403ca3a1e8b411ad3aede99476f6e45e","start":22}],"target_id":"concept.planetmath.arithmetic","target_kind":"node","target_sha256":"5e93e156b0ceb9c7214cb892410bce4b616a6164048711927eae189c77ca84eb"}],"concept.planetmath.arithmeticalhierarchy":[{"id":"assertion.concept.planetmath.arithmeticalhierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arithmetical hierarchy as stated in the captured PlanetMath entry arithmeticalhierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: The arithmetical hierarchy is a hierarchy of either (depending on the context ) formulas or relations .","support":[{"end":149,"quote":"The\narithmetical hierarchy\nis a hierarchy of either (depending on the\ncontext\n)\nformulas\nor\nrelations\n.","source_id":"planetmath.arithmeticalhierarchy","source_sha256":"d9220763dba214f609bd6f69893b9cdb72e82f55a7b30927e067d2fdabb5149e","start":46}],"target_id":"concept.planetmath.arithmeticalhierarchy","target_kind":"node","target_sha256":"ad2ce10b1f73c7db16e6157ef13cf50ec4f1491f193db0c21403a2393475f89e"}],"concept.planetmath.arrowsrelation":[{"id":"assertion.concept.planetmath.arrowsrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arrows relation as stated in the captured PlanetMath entry arrowsrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05A18, 03E05) states: Let [ X ] α = { Y ⊆ X ∣ | Y | = α } , that is, the set of subsets of X of size α .","support":[{"end":114,"quote":"Let\n[\nX\n]\nα\n=\n{\nY\n⊆\nX\n∣\n|\nY\n|\n=\nα\n}\n, that is, the set of subsets of\nX\nof size\nα\n.","source_id":"planetmath.arrowsrelation","source_sha256":"889ab321fe069991010a588fd90969d225bcbc2e16b6c7437cdc1ac0d2a17fa6","start":32}],"target_id":"concept.planetmath.arrowsrelation","target_kind":"node","target_sha256":"b006e52791d5444cc717d8c6cf9e3cc968edb7f1c8575b7cf242f48840bacfea"}],"concept.planetmath.ascendingorder":[{"id":"assertion.concept.planetmath.ascendingorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ascending order as stated in the captured PlanetMath entry ascendingorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in ascending order if each a i ≤ a i + 1 .","support":[{"end":165,"quote":"A\nsequence\nor arbitrary\nordered set\nor one-dimensional array of numbers,\na\n, is said to be in\nascending order\nif each\na\ni\n≤\na\ni\n+\n1\n.","source_id":"planetmath.ascendingorder","source_sha256":"3c1d5110e3f3f3af2ba1d39cab650cdcffd6fac431d1abbfd6ab2649b2f659a3","start":32}],"target_id":"concept.planetmath.ascendingorder","target_kind":"node","target_sha256":"45b7a66eb990b3ce9af25b76d333d85788a2197b9f3fe2977ee2478301daf44a"}],"concept.planetmath.atomicformula":[{"id":"assertion.concept.planetmath.atomicformula","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Atomic formula as stated in the captured PlanetMath entry atomicformula","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99, 03B10) states: Let Σ be a signature and T ⁢ ( Σ ) the set of terms over Σ .","support":[{"end":90,"quote":"Let\nΣ\nbe a\nsignature\nand\nT\n⁢\n(\nΣ\n)\nthe set of terms over\nΣ\n.","source_id":"planetmath.atomicformula","source_sha256":"f2b5166bdbd15f99d65dafea385d8be27fa11d40da7050490f8fd906a30b12b3","start":30}],"target_id":"concept.planetmath.atomicformula","target_kind":"node","target_sha256":"22129885ea6f903fdf2bef5a605b16e551e5a5a7810d895ed8695e1c443759d6"}],"concept.planetmath.automaton":[{"id":"assertion.concept.planetmath.automaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Automaton as stated in the captured PlanetMath entry automaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: An automaton is a semiautomaton with two types of special states: starting states, and final states.","support":[{"end":120,"quote":"An\nautomaton\nis a\nsemiautomaton\nwith two types of special states: starting states, and final states.","source_id":"planetmath.automaton","source_sha256":"384025f3a13b1f2f2956f6c82a35dd037a3074dbad9ed765ad351b19b64bc0cd","start":20}],"target_id":"concept.planetmath.automaton","target_kind":"node","target_sha256":"8209c3677978c75f0ae90f98316cd5b9a2cb8d4b811241d3dfd4e3b3b1d43d8c"}],"concept.planetmath.axiom":[{"id":"assertion.concept.planetmath.axiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom as stated in the captured PlanetMath entry axiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99, 03A05) states: In a nutshell, the logico-deductive method is a system of inference where conclusions (new knowledge) follow from premises (old knowledge) through the application of sound arguments ( syllogisms , rules of inference ).","support":[{"end":230,"quote":"In a nutshell, the logico-deductive method is a system of inference\nwhere\nconclusions\n(new knowledge) follow from\npremises\n(old knowledge)\nthrough the application of sound\narguments\n(\nsyllogisms\n,\nrules of\ninference\n).","source_id":"planetmath.axiom","source_sha256":"875b720e048df944707679ce52935c57164bfd758536a9774875bed87f3388ba","start":12}],"target_id":"concept.planetmath.axiom","target_kind":"node","target_sha256":"f1a7badf4b7a97e92e7b3a2844d88ae563d6499c1fb7a5d5c87fd17a59f3683c"}],"concept.planetmath.axiomatizableclass":[{"id":"assertion.concept.planetmath.axiomatizableclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiomatizable class as stated in the captured PlanetMath entry axiomatizableclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C52) states: Let L be a first order language and T a theory in L .","support":[{"end":93,"quote":"Let\nL\nbe a\nfirst order language\nand\nT\na theory in\nL\n.","source_id":"planetmath.axiomatizableclass","source_sha256":"02f6d9b9aa2d79deb67b84b36c7bbfaccb6dc26ca5e3365b7d1f3a663a47c374","start":40}],"target_id":"concept.planetmath.axiomatizableclass","target_kind":"node","target_sha256":"effc06ecbad54f31fde10201a07ffe10afb7b576baed30281bab3d99c5d714c8"}],"concept.planetmath.axiomofchoice":[{"id":"assertion.concept.planetmath.axiomofchoice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of choice as stated in the captured PlanetMath entry axiomofchoice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30, 03E25) states: The Zermelo-Fraenkel axioms for set theory are often accepted as a basis for an axiomatic set theory .","support":[{"end":134,"quote":"The\nZermelo-Fraenkel axioms\nfor\nset theory\nare often accepted as a basis for an\naxiomatic set theory\n.","source_id":"planetmath.axiomofchoice","source_sha256":"8dfc0fd905e3cd3cda8547aa16d73820c8bee059c326a1eff026efb3aa1f603c","start":32}],"target_id":"concept.planetmath.axiomofchoice","target_kind":"node","target_sha256":"222181aeefa3467f304bb4037a21691a5a3ec6020cc15a17d6d98bfeeee59bc7"}],"concept.planetmath.axiomofcountablechoice":[{"id":"assertion.concept.planetmath.axiomofcountablechoice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of countable choice as stated in the captured PlanetMath entry axiomofcountablechoice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E25) states: The Axiom of Countable Choice (CC) is a weak form of the Axiom of Choice ( http://planetmath.org/AxiomOfChoice ).","support":[{"end":165,"quote":"The\nAxiom of Countable Choice\n(CC) is a weak form of the\nAxiom of Choice\n(\nhttp://planetmath.org/AxiomOfChoice\n).","source_id":"planetmath.axiomofcountablechoice","source_sha256":"2008b805453e3ab6c6813cd39e3992d1e376ab684956af32cc24ed1577ff4fa9","start":52}],"target_id":"concept.planetmath.axiomofcountablechoice","target_kind":"node","target_sha256":"0096a789c6edad209b9c09c95bda42ea0d7b996840312352f24fa23a13d9064f"}],"concept.planetmath.axiomofextensionality":[{"id":"assertion.concept.planetmath.axiomofextensionality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of extensionality as stated in the captured PlanetMath entry axiomofextensionality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: If X and Y have the same elements , then X = Y . The Axiom of Extensionality is one of the axioms of Zermelo-Fraenkel set theory .","support":[{"end":178,"quote":"If\nX\nand\nY\nhave the same\nelements\n, then\nX\n=\nY\n.\nThe\nAxiom of Extensionality\nis one of the axioms of\nZermelo-Fraenkel set theory\n.","source_id":"planetmath.axiomofextensionality","source_sha256":"71b15f9b1956604ed970930602170f2e67363fd6576018a2579727b9f8b4a9da","start":48}],"target_id":"concept.planetmath.axiomofextensionality","target_kind":"node","target_sha256":"4615b46a15ec8e0fd31b909724d663d3a539dc943c9ad319f94212c46fcc4362"}],"concept.planetmath.axiomoffoundation":[{"id":"assertion.concept.planetmath.axiomoffoundation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of foundation as stated in the captured PlanetMath entry axiomoffoundation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99) states: The axiom of foundation (also called the axiom of regularity ) is an axiom of ZF set theory prohibiting circular sets and sets with infinite levels of containment.","support":[{"end":203,"quote":"The\naxiom of foundation\n(also called the\naxiom of regularity\n) is an axiom of ZF\nset theory\nprohibiting circular sets and sets with\ninfinite\nlevels of containment.","source_id":"planetmath.axiomoffoundation","source_sha256":"0a6d612d32c7f7eb967faab62529f61c5391d36be9f73ac23de59c24bcbd9f37","start":40}],"target_id":"concept.planetmath.axiomoffoundation","target_kind":"node","target_sha256":"bec861dce89077cd323ab5c25988abe63638df30d07df2fefda0229e7b6a237b"}],"concept.planetmath.axiomofinfinity":[{"id":"assertion.concept.planetmath.axiomofinfinity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of infinity as stated in the captured PlanetMath entry axiomofinfinity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: There exists an infinite set . The Axiom of Infinity is an axiom of Zermelo-Fraenkel set theory .","support":[{"end":133,"quote":"There exists an\ninfinite set\n.\nThe\nAxiom of Infinity\nis an axiom of\nZermelo-Fraenkel set theory\n.","source_id":"planetmath.axiomofinfinity","source_sha256":"cfabd608453598c91b074395b94eb5b066268fdf40a8280e3ee13cc445a6562d","start":36}],"target_id":"concept.planetmath.axiomofinfinity","target_kind":"node","target_sha256":"e4b38f3c70ea6f765a9462a6316d78486c3188bac4e9d66aceb6e3a92082044a"}],"concept.planetmath.axiomofpairing":[{"id":"assertion.concept.planetmath.axiomofpairing","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of pairing as stated in the captured PlanetMath entry axiomofpairing","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: For any a and b there exists a set { a , b } that contains exactly a and b .","support":[{"end":110,"quote":"For any\na\nand\nb\nthere exists a set\n{\na\n,\nb\n}\nthat contains exactly\na\nand\nb\n.","source_id":"planetmath.axiomofpairing","source_sha256":"2e8d92f284abd87d0b614a981748b5d9a3d487c8ff674e92514edc3bf48e04ab","start":34}],"target_id":"concept.planetmath.axiomofpairing","target_kind":"node","target_sha256":"47cf014c9ba081aeee90c2e12d7585ab514edb6cf6de8598e06999c1ddfb6df4"}],"concept.planetmath.axiomschemaofseparation":[{"id":"assertion.concept.planetmath.axiomschemaofseparation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom schema of separation as stated in the captured PlanetMath entry axiomschemaofseparation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: Let ϕ ⁢ ( u , p ) be a formula . For any X and p , there exists a set Y = { u ∈ X : ϕ ⁢ ( u , p ) } .","support":[{"end":155,"quote":"Let\nϕ\n⁢\n(\nu\n,\np\n)\nbe a\nformula\n. For any\nX\nand\np\n, there exists a set\nY\n=\n{\nu\n∈\nX\n:\nϕ\n⁢\n(\nu\n,\np\n)\n}\n.","source_id":"planetmath.axiomschemaofseparation","source_sha256":"414d8e3056b0dbf728f46118fa4bed949dc0426efa5bb0e7e8f7046d9a292be6","start":54}],"target_id":"concept.planetmath.axiomschemaofseparation","target_kind":"node","target_sha256":"a3c6ad62838b3e40e8399fe593599f050579ca9305f79846f02b6eca660f3465"}],"concept.planetmath.axiomsystemforfirstorderlogic":[{"id":"assertion.concept.planetmath.axiomsystemforfirstorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom system for first order logic as stated in the captured PlanetMath entry axiomsystemforfirstorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: Let FO ( Σ ) be a first order language over signature Σ .","support":[{"end":127,"quote":"Let FO\n(\nΣ\n)\nbe a\nfirst order language\nover\nsignature\nΣ\n.","source_id":"planetmath.axiomsystemforfirstorderlogic","source_sha256":"ada94687605a9ce0be7fb7d9125430d34c03c933dabdf1e093c46781b0ec4ea5","start":70}],"target_id":"concept.planetmath.axiomsystemforfirstorderlogic","target_kind":"node","target_sha256":"471dd8ecb6d802a213a76d25f6536dcd2f1913daabf8d25a30b0c58b0f75131a"}],"concept.planetmath.axiomsystemforpropositionallogic":[{"id":"assertion.concept.planetmath.axiomsystemforpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom system for propositional logic as stated in the captured PlanetMath entry axiomsystemforpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: The language of (classical) propositional logic PL c consists of a set of propositional letters or variables , the symbol ⟂ (for falsity), together with two symbols for logical connectives ¬ and → .","support":[{"end":272,"quote":"The\nlanguage\nof (classical)\npropositional logic\nPL\nc\nconsists of a set of propositional letters or\nvariables\n, the symbol\n⟂\n(for falsity), together with two symbols for\nlogical connectives\n¬\nand\n→\n.","source_id":"planetmath.axiomsystemforpropositionallogic","source_sha256":"88a04bffeeb81f8b1ecfe1d9224212e4409b11a4a263f83501df95e7f49136b0","start":74}],"target_id":"concept.planetmath.axiomsystemforpropositionallogic","target_kind":"node","target_sha256":"b86d84b9ad133dec2472942d418c04c62816f57b0cb787b84b93cf90a06a8cd9"}],"concept.planetmath.banachspace":[{"id":"assertion.concept.planetmath.banachspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Banach space as stated in the captured PlanetMath entry banachspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B99, 54E50) states: A Banach space ( X , ∥ ⋅ ∥ ) is a normed vector space such that X is complete under the metric induced by the norm ∥ ⋅ ∥ .","support":[{"end":148,"quote":"A\nBanach space\n(\nX\n,\n∥\n⋅\n∥\n)\nis a\nnormed vector space\nsuch that\nX\nis\ncomplete\nunder the metric\ninduced\nby the norm\n∥\n⋅\n∥\n.","source_id":"planetmath.banachspace","source_sha256":"3daa8da46a7920611816581bb0327f2cd860ee27f0ec6b9948ed46886f83b4a2","start":26}],"target_id":"concept.planetmath.banachspace","target_kind":"node","target_sha256":"8cb878a08b1254ce1cc1264e6a959ec95eb84de886f633f9eaf8fd258b37b1e8"}],"concept.planetmath.beyondformalismgodelsincompleteness":[{"id":"assertion.concept.planetmath.beyondformalismgodelsincompleteness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Beyond formalism: Gödel’s incompleteness as stated in the captured PlanetMath entry beyondformalismgodelsincompleteness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B10, 03A05, 03-01) states: Contents: 1 Overview 2 Arithmetic 3 From the number sequence to formal arithmetic 4 The formal theory Z 5 A model for Z 6 Gödel numbers 7 Expressing relations and representing functions in Z 8 Omega-consistency and metamathematical predicates 9 How to build Gödel’s undecidable statement 10 Gödel’s first theorem 11 The interpretation of the undecidable formula 12 Gödel’s second theorem 13 The interpretation of the second theorem 14 The concept of truth A Q & A 1 Overview In the literature on the foundations of mathematics the term ” formalism ” occurs with three different configurations .","support":[{"end":643,"quote":"Contents:\n1\nOverview\n2\nArithmetic\n3\nFrom the number sequence to formal arithmetic\n4\nThe formal theory\nZ\n5\nA model for\nZ\n6\nGödel numbers\n7\nExpressing relations and representing functions in\nZ\n8\nOmega-consistency and metamathematical predicates\n9\nHow to build Gödel’s undecidable statement\n10\nGödel’s first theorem\n11\nThe interpretation of the undecidable formula\n12\nGödel’s second theorem\n13\nThe interpretation of the second theorem\n14\nThe concept of truth\nA\nQ & A\n1\nOverview\nIn the literature on the\nfoundations of mathematics\nthe term ”\nformalism\n” occurs with three different\nconfigurations\n.","source_id":"planetmath.beyondformalismgodelsincompleteness","source_sha256":"164867353b1ccec350567ac68427a09f2abc17666650fd692067fba61755bfc8","start":49}],"target_id":"concept.planetmath.beyondformalismgodelsincompleteness","target_kind":"node","target_sha256":"ffbbd5a1cdae67ee8c4c3bf16ba3ef32a1307fe188f4123426e8b554f23fdf37"}],"concept.planetmath.biconditional":[{"id":"assertion.concept.planetmath.biconditional","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Biconditional as stated in the captured PlanetMath entry biconditional","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: 1 Biconditional A biconditional is a truth function that is true only in the case that both parameters are true or both are false.","support":[{"end":158,"quote":"1\nBiconditional\nA\nbiconditional\nis a\ntruth function\nthat is true only in the case that both\nparameters\nare true or both are false.","source_id":"planetmath.biconditional","source_sha256":"de9764540f4861e0e80d0d6e7dda3aa1b29cdea0e3c0e57e53e6fe77611d33db","start":28}],"target_id":"concept.planetmath.biconditional","target_kind":"node","target_sha256":"7adda158865296d157826c2d25d59716ef1aa8fcb1ddb824ebe83e813ab22901"}],"concept.planetmath.bicyclicsemigroup":[{"id":"assertion.concept.planetmath.bicyclicsemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bicyclic semigroup as stated in the captured PlanetMath entry bicyclicsemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99) states: The bicyclic semigroup 𝒞 ⁢ ( p , q ) is the monoid generated by { p , q } with the single relation p ⁢ q = 1 .","support":[{"end":148,"quote":"The\nbicyclic semigroup\n𝒞\n⁢\n(\np\n,\nq\n)\nis the\nmonoid generated by\n{\np\n,\nq\n}\nwith\nthe single\nrelation\np\n⁢\nq\n=\n1\n.","source_id":"planetmath.bicyclicsemigroup","source_sha256":"40c7f593ae4310762019249df8dcb56baf65a0afadaab8c5ad6c50ad91693256","start":38}],"target_id":"concept.planetmath.bicyclicsemigroup","target_kind":"node","target_sha256":"e06a5c4787a6ca206ce89e84793e5257dab2ec660d1e025267c7b60d86f56107"}],"concept.planetmath.bijection":[{"id":"assertion.concept.planetmath.bijection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bijection as stated in the captured PlanetMath entry bijection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 83-00, 81-00, 82-00) states: Let X and Y be sets. A function f : X → Y that is one-to-one and onto is called a bijection or bijective function from X to Y .","support":[{"end":147,"quote":"Let\nX\nand\nY\nbe sets. A\nfunction\nf\n:\nX\n→\nY\nthat is\none-to-one\nand onto is called a\nbijection\nor\nbijective function\nfrom\nX\nto\nY\n.","source_id":"planetmath.bijection","source_sha256":"ed11dd41ca70fafc911570064eaa6333876c9030a0ad91417f276b86be764751","start":20}],"target_id":"concept.planetmath.bijection","target_kind":"node","target_sha256":"239b3743a115e554a2783a36294e87ce8e0d9bab94b07d9a8b51a5c0a762a6f4"}],"concept.planetmath.bilinearform":[{"id":"assertion.concept.planetmath.bilinearform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bilinear form as stated in the captured PlanetMath entry bilinearform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 11E39, 15A63) states: Definition. Let U , V , W be vector spaces over a field K .","support":[{"end":87,"quote":"Definition.\nLet\nU\n,\nV\n,\nW\nbe\nvector spaces\nover a field\nK\n.","source_id":"planetmath.bilinearform","source_sha256":"ce0bedcdc690233f9bc6ca5d0852048d04c82520c1913f56fa21adb212eebeb3","start":28}],"target_id":"concept.planetmath.bilinearform","target_kind":"node","target_sha256":"adbb668b3e6cc12ee15fc2770fd1146dff30184a3341956950157b5cfabac0d4"}],"concept.planetmath.bilinearmap":[{"id":"assertion.concept.planetmath.bilinearmap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bilinear map as stated in the captured PlanetMath entry bilinearmap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13C99) states: Let R be a ring, and let M , N and P be modules over R .","support":[{"end":82,"quote":"Let\nR\nbe a ring, and let\nM\n,\nN\nand\nP\nbe modules over\nR\n.","source_id":"planetmath.bilinearmap","source_sha256":"aefa086264d5644977e453161de00aadc3c187b9ec028b3728ef3f8edf8d6064","start":26}],"target_id":"concept.planetmath.bilinearmap","target_kind":"node","target_sha256":"88eab811babbd11fa98a8f0fb137afc67f33382a50159981bc75f7e424e76f0e"}],"concept.planetmath.binaryoperation":[{"id":"assertion.concept.planetmath.binaryoperation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Binary operation as stated in the captured PlanetMath entry binaryoperation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A99) states: A binary operation on a set X is a function from the Cartesian product X × X to X .","support":[{"end":117,"quote":"A\nbinary operation\non a set\nX\nis a\nfunction\nfrom the\nCartesian product\nX\n×\nX\nto\nX\n.","source_id":"planetmath.binaryoperation","source_sha256":"b32a51a5380ea247453541c4209af0f4c8c7faa5d8bc64565e142cb4616626aa","start":34}],"target_id":"concept.planetmath.binaryoperation","target_kind":"node","target_sha256":"7757b170b1aaa0d87c753b0cbc4b64b44e4b5e0183289e78116de96a9cae80f4"}],"concept.planetmath.biops":[{"id":"assertion.concept.planetmath.biops","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Biops as stated in the captured PlanetMath entry biops","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A99) states: Let S be a set and n ∈ 𝐍 . Set 𝐍 n := { i ∈ 𝐍 | i < n } . If there exists a map ⋅ : 𝐍 n → ( S 2 → S ) : i ↦ ⋅ i where ⋅ i : S 2 → S : ( a , b ) ↦ a ⋅ i b is a binary operation , then I shall say that ( S , ⋅ ) is an n -biops .","support":[{"end":238,"quote":"Let\nS\nbe a set and\nn\n∈\n𝐍\n. Set\n𝐍\nn\n:=\n{\ni\n∈\n𝐍\n|\ni\n<\nn\n}\n. If there exists a map\n⋅\n:\n𝐍\nn\n→\n(\nS\n2\n→\nS\n)\n:\ni\n↦\n⋅\ni\nwhere\n⋅\ni\n:\nS\n2\n→\nS\n:\n(\na\n,\nb\n)\n↦\na\n⋅\ni\nb\nis a\nbinary operation\n, then I shall say that\n(\nS\n,\n⋅\n)\nis an\nn\n-biops\n.","source_id":"planetmath.biops","source_sha256":"5ba52c8a0c1dd7d83427092f1c752dd94cd08861ab7ceb94ac2a5851a01032e6","start":12}],"target_id":"concept.planetmath.biops","target_kind":"node","target_sha256":"df8de669d840735d60400d3d391db4a70dfa3a0a04f846ca816e28c8f94e6178"}],"concept.planetmath.bisimulation":[{"id":"assertion.concept.planetmath.bisimulation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bisimulation as stated in the captured PlanetMath entry bisimulation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B45, 68Q85, 68Q10) states: Given two labelled state transition systems (LTS) M = ( S 1 , Σ , → 1 ) , N = ( S 2 , Σ , → 2 ) , a binary relation ≈ ⊆ S 1 × S 2 is called a simulation if whenever p ≈ q and p → α 1 p ′ , then there is a q ′ such that p ′ ≈ q ′ and q → α 2 q ′ .","support":[{"end":272,"quote":"Given two\nlabelled state transition systems\n(LTS)\nM\n=\n(\nS\n1\n,\nΣ\n,\n→\n1\n)\n,\nN\n=\n(\nS\n2\n,\nΣ\n,\n→\n2\n)\n, a\nbinary relation\n≈\n⊆\nS\n1\n×\nS\n2\nis called a\nsimulation\nif whenever\np\n≈\nq\nand\np\n→\nα\n1\np\n′\n, then there is a\nq\n′\nsuch that\np\n′\n≈\nq\n′\nand\nq\n→\nα\n2\nq\n′\n.","source_id":"planetmath.bisimulation","source_sha256":"308275f5152e522cd5dc66cd242ecf43fc7b714edb2d14c92c85615865237592","start":26}],"target_id":"concept.planetmath.bisimulation","target_kind":"node","target_sha256":"693e10b39a3785dd7a78406897fea9d8ff9f8cef1c1657e2ea3abe0da4e8fb91"}],"concept.planetmath.booleanalgebrahomomorphism":[{"id":"assertion.concept.planetmath.booleanalgebrahomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean algebra homomorphism as stated in the captured PlanetMath entry booleanalgebrahomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Let A and B be Boolean algebras . A function f : A → B is called a Boolean algebra homomorphism , or homomorphism for short, if f is a { 0 , 1 } - lattice homomorphism ( http://planetmath.org/LatticeHomomorphism ) such that f respects ′ : f ⁢ ( a ′ ) = f ⁢ ( a ) ′ .","support":[{"end":324,"quote":"Let\nA\nand\nB\nbe\nBoolean algebras\n. A\nfunction\nf\n:\nA\n→\nB\nis called a\nBoolean algebra homomorphism\n, or\nhomomorphism\nfor short, if\nf\nis a\n{\n0\n,\n1\n}\n-\nlattice homomorphism\n(\nhttp://planetmath.org/LatticeHomomorphism\n) such that\nf\nrespects\n′\n:\nf\n⁢\n(\na\n′\n)\n=\nf\n⁢\n(\na\n)\n′\n.","source_id":"planetmath.booleanalgebrahomomorphism","source_sha256":"27ce5f7b9a18a5c4e8ad89cc76d5346e8baf004baee6bd2a5f75f49baec3db2c","start":58}],"target_id":"concept.planetmath.booleanalgebrahomomorphism","target_kind":"node","target_sha256":"97b43d2e21ea83e074acb6a45f9db1fd09ca8f37817508c70b0b49ee21e63b45"}],"concept.planetmath.booleandomain":[{"id":"assertion.concept.planetmath.booleandomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean domain as stated in the captured PlanetMath entry booleandomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68R01, 68Q01, 68P01, 03G05, 03C55, 03B05) states: \\PMlinkescapephrase generic \\PMlinkescapephrase Generic A Boolean domain 𝔹 is a generic 2-element set, say, 𝔹 = { 0 , 1 } , whose elements are interpreted as logical values, typically, 0 = false and 1 = true .","support":[{"end":239,"quote":"\\PMlinkescapephrase\ngeneric\n\\PMlinkescapephrase\nGeneric\nA\nBoolean domain\n𝔹\nis a generic 2-element set, say,\n𝔹\n=\n{\n0\n,\n1\n}\n, whose\nelements\nare interpreted as logical values, typically,\n0\n=\nfalse\nand\n1\n=\ntrue\n.","source_id":"planetmath.booleandomain","source_sha256":"ab4aabc051d5142b4e1ffaabe53fd4fe0d891ddf6dfe893c7491341c492ec2a4","start":30}],"target_id":"concept.planetmath.booleandomain","target_kind":"node","target_sha256":"f5d8bdea456251dc5e5ca77fffe07b85025a3068fafbc0841e89b81d199f54f6"}],"concept.planetmath.booleanideal":[{"id":"assertion.concept.planetmath.booleanideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean ideal as stated in the captured PlanetMath entry booleanideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G05, 03G10) states: Let A be a Boolean algebra and B a subset of A . The following are equivalent : 1.","support":[{"end":110,"quote":"Let\nA\nbe a\nBoolean algebra\nand\nB\na subset of\nA\n. The following are\nequivalent\n:\n1.","source_id":"planetmath.booleanideal","source_sha256":"25c6f11767aa5a61857de42ede4d6506fe09e1573f1a0135a9fe2c05f44605b2","start":28}],"target_id":"concept.planetmath.booleanideal","target_kind":"node","target_sha256":"d7ff2e830b16682b722d3ef909a89ac55fe094a1bd91b3a17d25b0deb8898883"}],"concept.planetmath.booleanlattice":[{"id":"assertion.concept.planetmath.booleanlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean lattice as stated in the captured PlanetMath entry booleanlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10, 06E20) states: In this entry, the notions of a Boolean lattice , a Boolean algebra , and a Boolean ring are defined, compared and contrasted.","support":[{"end":158,"quote":"In this entry, the notions of a\nBoolean lattice\n, a\nBoolean algebra\n, and a\nBoolean ring\nare defined, compared and contrasted.","source_id":"planetmath.booleanlattice","source_sha256":"60adc8943f5b27289e82baaa8613020d4c8bf86a61e6db6f73183041b64c67ef","start":32}],"target_id":"concept.planetmath.booleanlattice","target_kind":"node","target_sha256":"c47321c0d1ec082a335643bd612cb578934cd18d177332f9abb3756a1e90a18f"}],"concept.planetmath.booleanring":[{"id":"assertion.concept.planetmath.booleanring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean ring as stated in the captured PlanetMath entry booleanring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E99, 03G05) states: A Boolean ring is a ring R that has a multiplicative identity , and in which every element is idempotent , that is, x 2 = x ⁢ for all ⁢ x ∈ R .","support":[{"end":169,"quote":"A\nBoolean ring\nis a ring\nR\nthat has a\nmultiplicative identity\n,\nand in which every\nelement\nis\nidempotent\n, that is,\nx\n2\n=\nx\n⁢\nfor all\n⁢\nx\n∈\nR\n.","source_id":"planetmath.booleanring","source_sha256":"a56e95dee21f9ec1ec35dcea40e44e3e01aee42f0700214396d98cf2df4f7bd3","start":26}],"target_id":"concept.planetmath.booleanring","target_kind":"node","target_sha256":"8e042080ccdb19de53c98b6ac53f2b292555f86b9cd24995c4fefe05ba452f5b"}],"concept.planetmath.booleanvaluedfunction":[{"id":"assertion.concept.planetmath.booleanvaluedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean-valued function as stated in the captured PlanetMath entry booleanvaluedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q01, 68P01, 06E30, 03G05, 03C55, 03B05, 68R01) states: A Boolean-valued function is a function of type f : X → 𝔹 , where X is an arbitrary set and where 𝔹 is a Boolean domain .","support":[{"end":169,"quote":"A\nBoolean-valued function\nis a\nfunction\nof type\nf\n:\nX\n→\n𝔹\n, where\nX\nis an arbitrary set and where\n𝔹\nis a\nBoolean domain\n.","source_id":"planetmath.booleanvaluedfunction","source_sha256":"ca4c92bac2ec41ccc25bde41e6cd91bdc82d22dcabcdde0d44c797f54db9f9c6","start":48}],"target_id":"concept.planetmath.booleanvaluedfunction","target_kind":"node","target_sha256":"36e0d543b9c124a3843a1b1cc6689a2ac6f42b90026f98bc8c7c8a7ded5213a3"}],"concept.planetmath.borelspace":[{"id":"assertion.concept.planetmath.borelspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Borel space as stated in the captured PlanetMath entry borelspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60A10, 28C15, 28A12, 54H05, 28A05) states: Definition 0.1 . A Borel space ( X ; ℬ ⁢ ( X ) ) is defined as a set X , together with a Borel σ - algebra ( http://planetmath.org/SigmaAlgebra ) ℬ ⁢ ( X ) of subsets of X , called Borel sets .","support":[{"end":217,"quote":"Definition 0.1\n.\nA\nBorel space\n(\nX\n;\nℬ\n⁢\n(\nX\n)\n)\nis defined as a set\nX\n, together with\na Borel\nσ\n-\nalgebra\n(\nhttp://planetmath.org/SigmaAlgebra\n)\nℬ\n⁢\n(\nX\n)\nof subsets of\nX\n, called\nBorel sets\n.","source_id":"planetmath.borelspace","source_sha256":"b8fdc5fa50437834cf522bafb6d1faf834c5dd71182179003ab238f89525b586","start":24}],"target_id":"concept.planetmath.borelspace","target_kind":"node","target_sha256":"26e6ac96e6111f7ac7b8db49c389b061254ae8dd282252baf14fb8e55bc588f4"}],"concept.planetmath.boundedcomplete":[{"id":"assertion.concept.planetmath.boundedcomplete","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded complete as stated in the captured PlanetMath entry boundedcomplete","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A12, 06B23, 03G10) states: Let P be a poset. Recall that a subset S of P is called bounded from above if there is an element a ∈ P such that, for every s ∈ S , s ≤ a .","support":[{"end":174,"quote":"Let\nP\nbe a poset. Recall that a subset\nS\nof\nP\nis called\nbounded from above\nif there is an\nelement\na\n∈\nP\nsuch that, for every\ns\n∈\nS\n,\ns\n≤\na\n.","source_id":"planetmath.boundedcomplete","source_sha256":"bc460f87075e10562bc5964e335f7781930acd9fc93a0382204f60168c9fad5a","start":34}],"target_id":"concept.planetmath.boundedcomplete","target_kind":"node","target_sha256":"0c6121b7af5834a178eeae6717750bd9027d453f287b38156962f30f1a254c66"}],"concept.planetmath.boundedfunction":[{"id":"assertion.concept.planetmath.boundedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded function as stated in the captured PlanetMath entry boundedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46-00) states: Definition Suppose X is a nonempty set . Then a function f : X → ℂ is a if there exist a C < ∞ such that | f ⁢ ( x ) | < C for all x ∈ X .","support":[{"end":172,"quote":"Definition\nSuppose\nX\nis a\nnonempty set\n. Then a\nfunction\nf\n:\nX\n→\nℂ\nis a\nif there exist a\nC\n<\n∞\nsuch that\n|\nf\n⁢\n(\nx\n)\n|\n<\nC\nfor all\nx\n∈\nX\n.","source_id":"planetmath.boundedfunction","source_sha256":"52e5ea216f38fd6e5cb4fa83b4e0c78e2c519af88570c586a0228f7b71805b9c","start":34}],"target_id":"concept.planetmath.boundedfunction","target_kind":"node","target_sha256":"99d5cdf921c5ec3326a62c29356d744f168c785bee17255a4ad5472a904413ef"}],"concept.planetmath.boundedminimization":[{"id":"assertion.concept.planetmath.boundedminimization","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded minimization as stated in the captured PlanetMath entry boundedminimization","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: One useful way of generating more primitive recursive functions from existing ones is through what is known as bounded summation and bounded product .","support":[{"end":192,"quote":"One useful way of generating more\nprimitive recursive functions\nfrom existing ones is through what is known as\nbounded summation\nand\nbounded product\n.","source_id":"planetmath.boundedminimization","source_sha256":"088268ef63277d0a7f6f75692b6b902b80a6c63a490a32a5c718c69be5d0c4a1","start":42}],"target_id":"concept.planetmath.boundedminimization","target_kind":"node","target_sha256":"3b75cf303e014f055f0ac3c48ab06fb32f63b2b7312400657842f2aeed8c1624"}],"concept.planetmath.boxtopology":[{"id":"assertion.concept.planetmath.boxtopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Box topology as stated in the captured PlanetMath entry boxtopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let { ( X α , 𝒯 α ) } α ∈ A be a family of topological spaces .","support":[{"end":89,"quote":"Let\n{\n(\nX\nα\n,\n𝒯\nα\n)\n}\nα\n∈\nA\nbe a family of\ntopological spaces\n.","source_id":"planetmath.boxtopology","source_sha256":"b03ae923b09f91695ef6588076d5e9e4d2cc27c9ef7107ac7af7594615be44ba","start":26}],"target_id":"concept.planetmath.boxtopology","target_kind":"node","target_sha256":"a4f0c9eb4c83f1ab64ee0da30c107457f98850114ed19174633631e394b42abf"}],"concept.planetmath.buralifortiparadox":[{"id":"assertion.concept.planetmath.buralifortiparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Burali-Forti paradox as stated in the captured PlanetMath entry buralifortiparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: The Burali-Forti paradox demonstrates that the class of all ordinals is not a set.","support":[{"end":124,"quote":"The\nBurali-Forti\nparadox\ndemonstrates that the class of all\nordinals\nis not a set.","source_id":"planetmath.buralifortiparadox","source_sha256":"4e805d3b710d0a672206cbb848e30e26655ebcbe5a3d6102a14f9b6be4668d89","start":42}],"target_id":"concept.planetmath.buralifortiparadox","target_kind":"node","target_sha256":"d8041892725e4048c91fdcf804a81315632295e650b18198dfa744cc049999cd"}],"concept.planetmath.canonicalprojection":[{"id":"assertion.concept.planetmath.canonicalprojection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Canonical projection as stated in the captured PlanetMath entry canonicalprojection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20-00) states: Given a group G and a normal subgroup N ⊲ G there is an epimorphism π : G → G / N defined by sending an element g ∈ G to its coset g ⁢ N .","support":[{"end":180,"quote":"Given a group\nG\nand a\nnormal subgroup\nN\n⊲\nG\nthere is an\nepimorphism\nπ\n:\nG\n→\nG\n/\nN\ndefined by sending an element\ng\n∈\nG\nto its coset\ng\n⁢\nN\n.","source_id":"planetmath.canonicalprojection","source_sha256":"e2bf773f2efa85f6a619133f23cfea34f7ee552521d577e7c33cc248973b0fa4","start":42}],"target_id":"concept.planetmath.canonicalprojection","target_kind":"node","target_sha256":"fd22d9e5b4dbc5df81c5771c03f759dc0e42d0b37db6ef080b070f8e5f5b4577"}],"concept.planetmath.cantorsdiagonalargument":[{"id":"assertion.concept.planetmath.cantorsdiagonalargument","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cantor’s diagonal argument as stated in the captured PlanetMath entry cantorsdiagonalargument","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: One of the starting points in Cantor’s development of set theory was his discovery that there are different degrees of infinity .","support":[{"end":183,"quote":"One of the starting points in\nCantor’s development of\nset theory\nwas his discovery that there are\ndifferent degrees of\ninfinity\n.","source_id":"planetmath.cantorsdiagonalargument","source_sha256":"c6534ccb8719fa85e0c40e45e66587d77632a6aff528f55006e6ea01e0139fb3","start":54}],"target_id":"concept.planetmath.cantorsdiagonalargument","target_kind":"node","target_sha256":"7b1fac60bfc410bb27a7c7808bd4625574856b2bf9b2176c05f16d294a2186bc"}],"concept.planetmath.cardinalarithmetic":[{"id":"assertion.concept.planetmath.cardinalarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinal arithmetic as stated in the captured PlanetMath entry cardinalarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: Definitions Let κ and λ be cardinal numbers , and let A and B be disjoint sets such that | A | = κ and | B | = λ .","support":[{"end":154,"quote":"Definitions\nLet\nκ\nand\nλ\nbe\ncardinal numbers\n,\nand let\nA\nand\nB\nbe\ndisjoint sets\nsuch that\n|\nA\n|\n=\nκ\nand\n|\nB\n|\n=\nλ\n.","source_id":"planetmath.cardinalarithmetic","source_sha256":"9e950f373693471989ff3906e594287bd6fa790418eb8cdd166e5e9f049bf279","start":40}],"target_id":"concept.planetmath.cardinalarithmetic","target_kind":"node","target_sha256":"76820d6a8d23591f2e80df1557facbe16c565b70b39f0849b6a7198c0cc61540"}],"concept.planetmath.cardinality":[{"id":"assertion.concept.planetmath.cardinality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinality as stated in the captured PlanetMath entry cardinality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: Cardinality Cardinality is a notion of the size of a set which does not rely on numbers.","support":[{"end":112,"quote":"Cardinality\nCardinality\nis a notion of the size of a set which does not rely on numbers.","source_id":"planetmath.cardinality","source_sha256":"8d7ea7c5c5791b80e8c1f3fe0dac34fd4d4d9043530925de61a32b1e9d325474","start":24}],"target_id":"concept.planetmath.cardinality","target_kind":"node","target_sha256":"da846fd7cacbc3e8c9a5e3a5ac0bb81524977b86efc310986b9cc00c15a4dc3e"}],"concept.planetmath.cardinalnumber":[{"id":"assertion.concept.planetmath.cardinalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinal number as stated in the captured PlanetMath entry cardinalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A cardinal number is an ordinal number S with the property that S ≤ X for every ordinal number X which has the same cardinality as S .","support":[{"end":166,"quote":"A\ncardinal number\nis an\nordinal number\nS\nwith the\nproperty\nthat\nS\n≤\nX\nfor every ordinal number\nX\nwhich has the same\ncardinality\nas\nS\n.","source_id":"planetmath.cardinalnumber","source_sha256":"b55a9a5a3a8fe042dc0912671777c7012b98ce78eedf87862a4ae16ff6af6275","start":32}],"target_id":"concept.planetmath.cardinalnumber","target_kind":"node","target_sha256":"5a0653e6baa7a0de6697448095ebd12a08f010fb3ef686d2c17f1fbde11d46ef"}],"concept.planetmath.cartesianproduct":[{"id":"assertion.concept.planetmath.cartesianproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cartesian product as stated in the captured PlanetMath entry cartesianproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 81P10, 81P05) states: For any sets A and B , the Cartesian product A × B is the set consisting of all ordered pairs ( a , b ) where a ∈ A and b ∈ B .","support":[{"end":163,"quote":"For any sets\nA\nand\nB\n, the\nCartesian product\nA\n×\nB\nis the set consisting of all\nordered pairs\n(\na\n,\nb\n)\nwhere\na\n∈\nA\nand\nb\n∈\nB\n.","source_id":"planetmath.cartesianproduct","source_sha256":"c489bdabf08ec8c24847759557f945a40e35f908d975a853cf3ed39aa066006b","start":36}],"target_id":"concept.planetmath.cartesianproduct","target_kind":"node","target_sha256":"4ea0779c59859e2935ae1ebf316798796eec922220ab6c6c3a34fce5229afccb"}],"concept.planetmath.categoricalquantumlmlogicalgebras":[{"id":"assertion.concept.planetmath.categoricalquantumlmlogicalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Categorical quantum LM- logic algebras as stated in the captured PlanetMath entry categoricalquantumlmlogicalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U99, 55U40, 55U35, 55U30, 81T05, 18A40, 18A15, 18A05, 18A99) states: \\xyoption curve 0.1 Quantum LM-algebraic Logic 0.1.1 Fundamental concepts of space and time in quantum theory vs.","support":[{"end":191,"quote":"\\xyoption\ncurve\n0.1\nQuantum LM-algebraic Logic\n0.1.1\nFundamental concepts of space and time in quantum theory\nvs.","source_id":"planetmath.categoricalquantumlmlogicalgebras","source_sha256":"7f1b059b2fd0d5ff5b607c69dd50aceaf699622900cececd36ea551461062c73","start":78}],"target_id":"concept.planetmath.categoricalquantumlmlogicalgebras","target_kind":"node","target_sha256":"879f0c3510b4ff19a33584dd57369aa02e222e4cfe2bec47c349b53394c19a8a"}],"concept.planetmath.changeofbasis":[{"id":"assertion.concept.planetmath.changeofbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Change of basis as stated in the captured PlanetMath entry changeofbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Let V be a vector space . Given a basis A for V , each vector v ∈ V can be uniquely expressed in terms of the base elements v i ∈ A as follows: v = ∑ v i ∈ A r i ⁢ v i where the sum is taken over a finite number of elements in A .","support":[{"end":262,"quote":"Let\nV\nbe a\nvector space\n. Given a basis\nA\nfor\nV\n, each vector\nv\n∈\nV\ncan be uniquely expressed in terms of the base\nelements\nv\ni\n∈\nA\nas follows:\nv\n=\n∑\nv\ni\n∈\nA\nr\ni\n⁢\nv\ni\nwhere the sum is taken over a finite number of elements in\nA\n.","source_id":"planetmath.changeofbasis","source_sha256":"c8cac1bea9e913a7fb43290a087a025e1617f43ceb3a4eb7c887b44d60b7d5e3","start":32}],"target_id":"concept.planetmath.changeofbasis","target_kind":"node","target_sha256":"3f42a7e3f7562b69769b0341f9aff16561cccf4df319d718ed0a686b5d7a75f2"}],"concept.planetmath.characteristic":[{"id":"assertion.concept.planetmath.characteristic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic as stated in the captured PlanetMath entry characteristic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12E99) states: Let ( F , + , ⋅ ) be a field. The characteristic Char ⁡ ( F ) of F is commonly given by one of three equivalent definitions : • if there is some positive integer n for which the result of adding any element to itself n times yields 0 , then the characteristic of the field is the least such n .","support":[{"end":324,"quote":"Let\n(\nF\n,\n+\n,\n⋅\n)\nbe a field. The\ncharacteristic\nChar\n⁡\n(\nF\n)\nof\nF\nis commonly given by one of three\nequivalent\ndefinitions\n:\n•\nif there is some positive integer\nn\nfor which the result of adding any\nelement\nto itself\nn\ntimes yields\n0\n, then the characteristic of the field is the least such\nn\n.","source_id":"planetmath.characteristic","source_sha256":"458e4242035eeb4790aa0ca364aefa30c227fa036251a133645221ab62217ed7","start":30}],"target_id":"concept.planetmath.characteristic","target_kind":"node","target_sha256":"00752b432fbf742aee6804acaf0fae8e5e80e60b76c0de540299a39468dafbaf"}],"concept.planetmath.characteristicfunction":[{"id":"assertion.concept.planetmath.characteristicfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic function as stated in the captured PlanetMath entry characteristicfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 26-00, 26A09, 28-00) states: Definition Suppose A is a subset of a set X . Then the function χ A ⁢ ( x ) = { 1 , when ⁢ x ∈ A , 0 , when ⁢ x ∈ X ∖ A is the characteristic function for A .","support":[{"end":206,"quote":"Definition\nSuppose\nA\nis a subset of a set\nX\n. Then the\nfunction\nχ\nA\n⁢\n(\nx\n)\n=\n{\n1\n,\nwhen\n⁢\nx\n∈\nA\n,\n0\n,\nwhen\n⁢\nx\n∈\nX\n∖\nA\nis the\ncharacteristic function\nfor\nA\n.","source_id":"planetmath.characteristicfunction","source_sha256":"56a6d7c1fa127cb0ac8005fd98685a5fbf83bd5b9d70ede41345fd91e69ded71","start":48}],"target_id":"concept.planetmath.characteristicfunction","target_kind":"node","target_sha256":"2c1e76ab9278f59c31a0d6fcfc161923bf2a0627c18b80b9070e26ed5ff06a20"}],"concept.planetmath.characteristicsubgroup":[{"id":"assertion.concept.planetmath.characteristicsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic subgroup as stated in the captured PlanetMath entry characteristicsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: If ( G , * ) is a group, then H is a characteristic subgroup of G (written H ⁢ char ⁡ G ) if every automorphism of G maps H to itself.","support":[{"end":182,"quote":"If\n(\nG\n,\n*\n)\nis a group, then\nH\nis a\ncharacteristic subgroup\nof\nG\n(written\nH\n⁢\nchar\n⁡\nG\n) if every\nautomorphism\nof\nG\nmaps\nH\nto itself.","source_id":"planetmath.characteristicsubgroup","source_sha256":"69aaa5d08964087db08189bdec4c961ae7f20e273da34c51440f5c08b6bc8f26","start":48}],"target_id":"concept.planetmath.characteristicsubgroup","target_kind":"node","target_sha256":"d543a50f524b20f020a254390375e1e8ec192f4952ee70ecbb6de67d036d7312"}],"concept.planetmath.chomskyhierarchy":[{"id":"assertion.concept.planetmath.chomskyhierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chomsky hierarchy as stated in the captured PlanetMath entry chomskyhierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q15, 03D55) states: The Chomsky hierarchy or Chomsky-Schützenberger hierarchy is a way of classifying formal grammars into four types, with the lower numbered types being more general.","support":[{"end":200,"quote":"The\nChomsky hierarchy\nor\nChomsky-Schützenberger hierarchy\nis a way of classifying\nformal grammars\ninto four types, with the lower numbered types being more general.","source_id":"planetmath.chomskyhierarchy","source_sha256":"24419cbde30c1c34ce3210860ef0e6d3dcb7303431b0219fecfbae343ab09e26","start":36}],"target_id":"concept.planetmath.chomskyhierarchy","target_kind":"node","target_sha256":"5e2fc870c20ff4be2eef3f52e22f8b71282dd1549b134f494defc8dc2807449e"}],"concept.planetmath.churchinteger":[{"id":"assertion.concept.planetmath.churchinteger","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Church integer as stated in the captured PlanetMath entry churchinteger","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40, 68N18) states: A Church integer is a representation of integers as functions , invented by Alonzo Church.","support":[{"end":120,"quote":"A\nChurch integer\nis a representation of integers as\nfunctions\n, invented by Alonzo Church.","source_id":"planetmath.churchinteger","source_sha256":"9d0b9f89bdcaf9b05bf1f8d6d7901d14455b349cccdab48bed0e8e3e23cd52fe","start":30}],"target_id":"concept.planetmath.churchinteger","target_kind":"node","target_sha256":"0b7076faf0f37f4f09f4aca4ef8d0ff1dd736f573bccd1fff110ad892b823baf"}],"concept.planetmath.chuspace":[{"id":"assertion.concept.planetmath.chuspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chu space as stated in the captured PlanetMath entry chuspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G99) states: A Chu space over a set Σ is a triple ( 𝒜 , r , 𝒳 ) with r : 𝒜 × 𝒳 → Σ .","support":[{"end":91,"quote":"A\nChu space\nover a set\nΣ\nis a triple\n(\n𝒜\n,\nr\n,\n𝒳\n)\nwith\nr\n:\n𝒜\n×\n𝒳\n→\nΣ\n.","source_id":"planetmath.chuspace","source_sha256":"525ae9de6b5f01f5ae4b8e1cd23d57daa40b66ff8fa39a3ecb52a93fc88431be","start":20}],"target_id":"concept.planetmath.chuspace","target_kind":"node","target_sha256":"7f9bc8a8de1f597cb7398f889b32bb6dadce915a4d62150bc0949005296db5ba"}],"concept.planetmath.classesofordinalsandenumeratingfunctions":[{"id":"assertion.concept.planetmath.classesofordinalsandenumeratingfunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Classes of ordinals and enumerating functions as stated in the captured PlanetMath entry classesofordinalsandenumeratingfunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F15, 03E10) states: A class of ordinals is just a subclass of the class ( http://planetmath.org/Class ) 𝐎𝐧 of all ordinals.","support":[{"end":195,"quote":"A\nclass of\nordinals\nis just a\nsubclass\nof the class (\nhttp://planetmath.org/Class\n)\n𝐎𝐧\nof all ordinals.","source_id":"planetmath.classesofordinalsandenumeratingfunctions","source_sha256":"f1f703a0630a494433977986e85d8cb17918aced2cb73124a85e5a4ca1fe7021","start":92}],"target_id":"concept.planetmath.classesofordinalsandenumeratingfunctions","target_kind":"node","target_sha256":"cabcbad1de90a7cbba87da3ee6f8ce3a2a65be350292687e6b94d03a78ac74e9"}],"concept.planetmath.classicalringofquotients":[{"id":"assertion.concept.planetmath.classicalringofquotients","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Classical ring of quotients as stated in the captured PlanetMath entry classicalringofquotients","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16U20, 16S90) states: Let R be a ring. An element of R is called regular if it is not a right zero divisor or a left zero divisor in R .","support":[{"end":170,"quote":"Let\nR\nbe a ring. An element of\nR\nis called\nregular\nif it is not a\nright zero divisor\nor a left zero divisor in\nR\n.","source_id":"planetmath.classicalringofquotients","source_sha256":"feec425cae9ea210af2b6d40ef3600e8dfda80639406116baa2380e0f1e2ec5a","start":56}],"target_id":"concept.planetmath.classicalringofquotients","target_kind":"node","target_sha256":"da2ba43b5813e645d05f9abf50277fc1cd04f6abce9136f6c7b2fff047f5a97b"}],"concept.planetmath.closedset":[{"id":"assertion.concept.planetmath.closedset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closed set as stated in the captured PlanetMath entry closedset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: \\PMlinkescapephrase closed under Let ( X , τ ) be a topological space .","support":[{"end":93,"quote":"\\PMlinkescapephrase\nclosed under\nLet\n(\nX\n,\nτ\n)\nbe a\ntopological space\n.","source_id":"planetmath.closedset","source_sha256":"cf968923e831622c88ae4a0592f5e92f2dc3fa0364ee862d44a332f79900b3b7","start":22}],"target_id":"concept.planetmath.closedset","target_kind":"node","target_sha256":"ff2259fe00f63c18c708b657f2ce44962be6048b2753679bd3a14032d190689d"}],"concept.planetmath.closuremap":[{"id":"assertion.concept.planetmath.closuremap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closure map as stated in the captured PlanetMath entry closuremap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05, 06A15) states: Let P be a poset. A function c : P → P is called a closure map if • c is order preserving, • 1 P ≤ c , • c is idempotent : c ∘ c = c .","support":[{"end":158,"quote":"Let\nP\nbe a poset. A\nfunction\nc\n:\nP\n→\nP\nis called a\nclosure map\nif\n•\nc\nis order preserving,\n•\n1\nP\n≤\nc\n,\n•\nc\nis\nidempotent\n:\nc\n∘\nc\n=\nc\n.","source_id":"planetmath.closuremap","source_sha256":"dbe00f3f65b12d3349447ec735de665cfa287ef33e0c41252f46c307f5418155","start":24}],"target_id":"concept.planetmath.closuremap","target_kind":"node","target_sha256":"7e4190f63e7cb00cf1687114e92982913fa7441398f9fc3e27df5e2796a6326b"}],"concept.planetmath.closureofasubsetunderrelations":[{"id":"assertion.concept.planetmath.closureofasubsetunderrelations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closure of a subset under relations as stated in the captured PlanetMath entry closureofasubsetunderrelations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A02) states: Let A be a set and R be an n -ary relation on A , n ≥ 1 . A subset B of A is said to be closed under R , or R -closed , if, whenever b 1 , … , b n - 1 ∈ B , and ( b 1 , … , b n - 1 , b n ) ∈ R , then b n ∈ B .","support":[{"end":281,"quote":"Let\nA\nbe a set and\nR\nbe an\nn\n-ary relation on\nA\n,\nn\n≥\n1\n. A subset\nB\nof\nA\nis said to be\nclosed under\nR\n, or\nR\n-closed\n, if, whenever\nb\n1\n,\n…\n,\nb\nn\n-\n1\n∈\nB\n, and\n(\nb\n1\n,\n…\n,\nb\nn\n-\n1\n,\nb\nn\n)\n∈\nR\n, then\nb\nn\n∈\nB\n.","source_id":"planetmath.closureofasubsetunderrelations","source_sha256":"16a9081989f3e05e0f335bc3f075e2cb27aadafc85736ec8f24c24aee308b369","start":72}],"target_id":"concept.planetmath.closureofasubsetunderrelations","target_kind":"node","target_sha256":"351060cbb8d68250ce58277fcbf4d25c2ac4c78a079b68e7ea32e7a8aa3db67d"}],"concept.planetmath.club":[{"id":"assertion.concept.planetmath.club","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Club as stated in the captured PlanetMath entry club","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: If κ is a cardinal then a set C ⊆ κ is closed iff for any S ⊆ C and α < κ , sup ⁡ ( S ∩ α ) = α then α ∈ C .","support":[{"end":118,"quote":"If\nκ\nis a\ncardinal\nthen a set\nC\n⊆\nκ\nis\nclosed\niff for any\nS\n⊆\nC\nand\nα\n<\nκ\n,\nsup\n⁡\n(\nS\n∩\nα\n)\n=\nα\nthen\nα\n∈\nC\n.","source_id":"planetmath.club","source_sha256":"57fbe8add1dbe14d187c25336bc662c2779198e9fdb8dd8acea69d9c27a6ea3f","start":10}],"target_id":"concept.planetmath.club","target_kind":"node","target_sha256":"5f386cb7bd8297ec468d730ea35c8b13e9f9d8317b833f9029f753cd1f149f0d"}],"concept.planetmath.coefficientsofapolynomial":[{"id":"assertion.concept.planetmath.coefficientsofapolynomial","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coefficients of a polynomial as stated in the captured PlanetMath entry coefficientsofapolynomial","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A40) states: If p ⁢ ( x ) = ∑ i = 0 n a i ⁢ x i is a polynomial ( http://planetmath.org/BasicPolynomial ), then its coefficients are { a i } i = 0 n .","support":[{"end":195,"quote":"If\np\n⁢\n(\nx\n)\n=\n∑\ni\n=\n0\nn\na\ni\n⁢\nx\ni\nis a\npolynomial\n(\nhttp://planetmath.org/BasicPolynomial\n), then its\ncoefficients\nare\n{\na\ni\n}\ni\n=\n0\nn\n.","source_id":"planetmath.coefficientsofapolynomial","source_sha256":"54fb90620164dc9a8d312a1804195abc6579c3b85dd0b744d38023283d348ba9","start":58}],"target_id":"concept.planetmath.coefficientsofapolynomial","target_kind":"node","target_sha256":"ddaadc93f713ec8ee82ef9a5aa1c7cfddcd93cc4cad41bdd17db3204aa747b87"}],"concept.planetmath.cofinality":[{"id":"assertion.concept.planetmath.cofinality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cofinality as stated in the captured PlanetMath entry cofinality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E04) states: Definitions Let ( P , ≤ ) be a poset. A subset A ⊆ P is said to be cofinal in P if for every x ∈ P there is a y ∈ A such that x ≤ y .","support":[{"end":155,"quote":"Definitions\nLet\n(\nP\n,\n≤\n)\nbe a poset. A subset\nA\n⊆\nP\nis said to be\ncofinal\nin\nP\nif for every\nx\n∈\nP\nthere is a\ny\n∈\nA\nsuch that\nx\n≤\ny\n.","source_id":"planetmath.cofinality","source_sha256":"6eb597c3bb37097d7531ea136860667e88254c28669d4a513a6d6a5591cd89bc","start":22}],"target_id":"concept.planetmath.cofinality","target_kind":"node","target_sha256":"e92f014097ee578e97aadcfc74860a9cb6722c24efc5d8f09e250f6b60ebb75b"}],"concept.planetmath.combinatorylogic":[{"id":"assertion.concept.planetmath.combinatorylogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Combinatory logic as stated in the captured PlanetMath entry combinatorylogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40) states: Combinatory logic was invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","support":[{"end":150,"quote":"Combinatory logic\nwas invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","source_id":"planetmath.combinatorylogic","source_sha256":"35b54bd24f2317bcf69138f7411405a12c5bed1269d02874643b67b0090e4920","start":36}],"target_id":"concept.planetmath.combinatorylogic","target_kind":"node","target_sha256":"febdd9304e94a20d808afd170e9eccae1a73a35da9d17b670813ad0d320e1aac"}],"concept.planetmath.commutativelanguage":[{"id":"assertion.concept.planetmath.commutativelanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutative language as stated in the captured PlanetMath entry commutativelanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q70) states: Let Σ be an alphabet and u a word over Σ . Write u as a product of symbols in Σ : u = a 1 ⁢ ⋯ ⁢ a n where a i ∈ Σ .","support":[{"end":157,"quote":"Let\nΣ\nbe an\nalphabet\nand\nu\na word over\nΣ\n. Write\nu\nas a\nproduct\nof symbols in\nΣ\n:\nu\n=\na\n1\n⁢\n⋯\n⁢\na\nn\nwhere\na\ni\n∈\nΣ\n.","source_id":"planetmath.commutativelanguage","source_sha256":"0b683848ae09ffc8d424e9c124c02767c26fbfa985c3cf5267ce9e53f93fbb9d","start":42}],"target_id":"concept.planetmath.commutativelanguage","target_kind":"node","target_sha256":"ca4a5928bff1689bb475e7c7456168c4efc96c973e84c2e6ac4328d8857775d7"}],"concept.planetmath.commutativesemigroup":[{"id":"assertion.concept.planetmath.commutativesemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutative semigroup as stated in the captured PlanetMath entry commutativesemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M14) states: A semigroup S is commutative if the defining binary operation is commutative ( http://planetmath.org/Commutative ).","support":[{"end":159,"quote":"A\nsemigroup\nS\nis\ncommutative\nif the defining\nbinary operation\nis commutative (\nhttp://planetmath.org/Commutative\n).","source_id":"planetmath.commutativesemigroup","source_sha256":"7df3ab9d9f86594db43b95ead5cf609dacf23e3bc12607d29d8e721ede41a554","start":44}],"target_id":"concept.planetmath.commutativesemigroup","target_kind":"node","target_sha256":"a3342eab58a9006d36619d6d38cbeda28c36102e9de0a97f8385ad1eacacf92d"}],"concept.planetmath.commutativityrelationinanorthocomplementedlattice":[{"id":"assertion.concept.planetmath.commutativityrelationinanorthocomplementedlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutativity relation in an orthocomplemented lattice as stated in the captured PlanetMath entry commutativityrelationinanorthocomplementedlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06C15, 03G12) states: Let L be an orthocomplemented lattice with a , b ∈ L .","support":[{"end":164,"quote":"Let\nL\nbe an\northocomplemented lattice\nwith\na\n,\nb\n∈\nL\n.","source_id":"planetmath.commutativityrelationinanorthocomplementedlattice","source_sha256":"caebcc0900cf4e50f65f7644fddc3685fd49c3a376ca9ec3835b79578057312a","start":110}],"target_id":"concept.planetmath.commutativityrelationinanorthocomplementedlattice","target_kind":"node","target_sha256":"cf44ef545e74be2dff5d7ab46a6e5759c812f86aba1696e3d1f213669d3905c8"}],"concept.planetmath.compact":[{"id":"assertion.concept.planetmath.compact","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Compact as stated in the captured PlanetMath entry compact","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D30, 81-00, 83-00, 82-00, 46L05, 22A22) states: A topological space X is compact if, for every collection { U i } i ∈ I of open sets in X whose union is X , there exists a finite subcollection { U i j } j = 1 n whose union is also X .","support":[{"end":202,"quote":"A\ntopological space\nX\nis\ncompact\nif, for every\ncollection\n{\nU\ni\n}\ni\n∈\nI\nof\nopen sets\nin\nX\nwhose union is\nX\n, there exists a finite subcollection\n{\nU\ni\nj\n}\nj\n=\n1\nn\nwhose union is also\nX\n.","source_id":"planetmath.compact","source_sha256":"3976b3ab8e086334aba9eebcfa645be2e017b21c86f502b3f63c0e5a260b83b6","start":16}],"target_id":"concept.planetmath.compact","target_kind":"node","target_sha256":"bead44c5aa56281d2b3e22c758e6e12338007be6cc5b55efc6349c8fa2d65b1b"}],"concept.planetmath.compactness":[{"id":"assertion.concept.planetmath.compactness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Compactness as stated in the captured PlanetMath entry compactness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: A logic is said to be ( κ , λ ) -compact, if the following holds If Φ is a set of sentences of cardinality less than or equal to κ and all subsets of Φ of cardinality less than λ are consistent , then Φ is consistent.","support":[{"end":241,"quote":"A logic is said to be\n(\nκ\n,\nλ\n)\n-compact, if the following holds\nIf\nΦ\nis a set of\nsentences\nof\ncardinality\nless than or equal to\nκ\nand all subsets of\nΦ\nof cardinality less than\nλ\nare\nconsistent\n, then\nΦ\nis consistent.","source_id":"planetmath.compactness","source_sha256":"ed5ebb3e56768a4ce7e00c039ba9b1dfb64396bf8473cd5f76801e7d66e850d6","start":24}],"target_id":"concept.planetmath.compactness","target_kind":"node","target_sha256":"250dc5943cd5afd05ebf9bdd9440726996b86caf8f8cdfb7b6148af6d28ac2d4"}],"concept.planetmath.comparisonoffilters":[{"id":"assertion.concept.planetmath.comparisonoffilters","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Comparison of filters as stated in the captured PlanetMath entry comparisonoffilters","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99, 03E99) states: Let 𝔽 1 and 𝔽 2 be two filters on the same set. The following terminology is commonly used to describe the relation of 𝔽 1 to 𝔽 2 : 𝔽 2 is said to be finer than 𝔽 1 if 𝔽 1 ⊆ 𝔽 2 .","support":[{"end":223,"quote":"Let\n𝔽\n1\nand\n𝔽\n2\nbe two filters on the same set. The following terminology is commonly used to describe the relation of\n𝔽\n1\nto\n𝔽\n2\n:\n𝔽\n2\nis said to be\nfiner\nthan\n𝔽\n1\nif\n𝔽\n1\n⊆\n𝔽\n2\n.","source_id":"planetmath.comparisonoffilters","source_sha256":"3a894c0193e43f00b90dd87e125c4da0da9a33013486f702ba44bfda29ae5b72","start":44}],"target_id":"concept.planetmath.comparisonoffilters","target_kind":"node","target_sha256":"f09e3c75dc796432ab8877e9242b5f8c78ee295f9708f638f2c56e115a98f34a"}],"concept.planetmath.complementarysubspace":[{"id":"assertion.concept.planetmath.complementarysubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complementary subspace as stated in the captured PlanetMath entry complementarysubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Direct sum decomposition. Let U be a vector space , and V , W ⊂ U subspaces .","support":[{"end":123,"quote":"Direct sum decomposition.\nLet\nU\nbe a\nvector space\n, and\nV\n,\nW\n⊂\nU\nsubspaces\n.","source_id":"planetmath.complementarysubspace","source_sha256":"ec33e60a9a57ec00718866ee1cab6253b33f1c21b4bfcfbd481fa0e3e1b76b0e","start":46}],"target_id":"concept.planetmath.complementarysubspace","target_kind":"node","target_sha256":"4ee90af070833070fcd41f1a1f1acb3b38058f61e7c822029e0857562c14c317"}],"concept.planetmath.completelattice":[{"id":"assertion.concept.planetmath.completelattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complete lattice as stated in the captured PlanetMath entry completelattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B23, 03G10) states: Complete lattices A complete lattice is a poset P such that every subset of P has both a supremum and an infimum in P .","support":[{"end":153,"quote":"Complete lattices\nA\ncomplete lattice\nis a poset\nP\nsuch that every subset of\nP\nhas both a\nsupremum\nand an\ninfimum\nin\nP\n.","source_id":"planetmath.completelattice","source_sha256":"8ee368875cce0e9755697a3df24436475c82aca16c6a8dd46d2a75b1456ede78","start":34}],"target_id":"concept.planetmath.completelattice","target_kind":"node","target_sha256":"8f474b32f465b81aa78eb00bbc0fb83f68ceb054a95e4d6ef3cd8c62fa5352ad"}],"concept.planetmath.complexnumber":[{"id":"assertion.concept.planetmath.complexnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complex number as stated in the captured PlanetMath entry complexnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D99, 30-00, 32-00, 46L05, 18B40, 46M20, 17B37, 22A22, 81R50, 22D25) states: The ring of complex numbers ℂ is defined to be the quotient ring of the polynomial ring ℝ ⁢ [ X ] in one variable over the reals by the principal ideal ( X 2 + 1 ) .","support":[{"end":195,"quote":"The ring of\ncomplex numbers\nℂ\nis defined to be the\nquotient ring\nof the\npolynomial ring\nℝ\n⁢\n[\nX\n]\nin one\nvariable\nover the reals by the\nprincipal ideal\n(\nX\n2\n+\n1\n)\n.","source_id":"planetmath.complexnumber","source_sha256":"8085068cf57149c7d257dc8ac3ea9b934f7ac018b7c2c6b3768985e626b15544","start":30}],"target_id":"concept.planetmath.complexnumber","target_kind":"node","target_sha256":"4fa611dbd1b88009e4cd57dba4ac8d6c4fd64d544d9aa4a82915be5d9168734e"}],"concept.planetmath.compositenumber":[{"id":"assertion.concept.planetmath.compositenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Composite number as stated in the captured PlanetMath entry compositenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A41) states: A composite number is a positive integer which is not prime and not equal to 1.","support":[{"end":113,"quote":"A\ncomposite number\nis a\npositive integer\nwhich is not prime and not equal to 1.","source_id":"planetmath.compositenumber","source_sha256":"299840d9e2ccceea376d722c3a28e695c6d7837cb8aa0aa0d6bbbdea1fd69137","start":34}],"target_id":"concept.planetmath.compositenumber","target_kind":"node","target_sha256":"be3fa70170ac482dc367ff901d7e6fa2faa40270b3835c4ffae8ef02d7890f10"}],"concept.planetmath.comprehensionaxiom":[{"id":"assertion.concept.planetmath.comprehensionaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Comprehension axiom as stated in the captured PlanetMath entry comprehensionaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: The axiom of comprehension (CA) states that every formula defines a set.","support":[{"end":112,"quote":"The\naxiom of comprehension\n(CA) states that every\nformula\ndefines a set.","source_id":"planetmath.comprehensionaxiom","source_sha256":"744fdd769058c7943375b47326cb62dac308e407be2bfba32154e9e21cd46a20","start":40}],"target_id":"concept.planetmath.comprehensionaxiom","target_kind":"node","target_sha256":"81bedbf18ab91ab77b8188261e95d7791c7d64869f48d0907dd1db2b798b15ef"}],"concept.planetmath.computablenumber":[{"id":"assertion.concept.planetmath.computablenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Computable number as stated in the captured PlanetMath entry computablenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03D25, 68Q05) states: A real number r is called computable if there exists some terminating algorithm (or Turing machine ) that can approximate it to arbitrary precision.","support":[{"end":184,"quote":"A\nreal number\nr\nis called\ncomputable\nif there exists some\nterminating\nalgorithm\n(or\nTuring machine\n) that can approximate it to arbitrary precision.","source_id":"planetmath.computablenumber","source_sha256":"7e800fb2fcc72ac7d4b8c744289cce03d751ba456d6e37f7b8d9d4283aeb5778","start":36}],"target_id":"concept.planetmath.computablenumber","target_kind":"node","target_sha256":"f6c405aa253aa4262eaa85a11fcba50f695b6526808e5f73903de8772195dd6a"}],"concept.planetmath.conceptlattice":[{"id":"assertion.concept.planetmath.conceptlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Concept lattice as stated in the captured PlanetMath entry conceptlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q55, 68P99, 08A70, 06B23, 03B70, 06A15) states: Let G and M be sets whose elements we call objects and attributes respectively.","support":[{"end":111,"quote":"Let\nG\nand\nM\nbe sets whose\nelements\nwe call\nobjects\nand\nattributes\nrespectively.","source_id":"planetmath.conceptlattice","source_sha256":"98282c921141986923e059fc374bcad8e4d60fd06cc3151bb9cffc0d6be49007","start":32}],"target_id":"concept.planetmath.conceptlattice","target_kind":"node","target_sha256":"34869e9687fa81b92fb949d2217b9d77425d90c7971db75a7f460d7dd0a6fb60"}],"concept.planetmath.conceptsinabstractalgebra":[{"id":"assertion.concept.planetmath.conceptsinabstractalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Concepts in abstract algebra as stated in the captured PlanetMath entry conceptsinabstractalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55-00, 18-00, 16-00, 13-00, 20-00, 15-00) states: The aim of this entry is to present a list of the key operators used in abstract algebra .","support":[{"end":148,"quote":"The aim of this entry is to present a list of the key\noperators\nused in\nabstract algebra\n.","source_id":"planetmath.conceptsinabstractalgebra","source_sha256":"c1318e88443b9d187b0a3cb8ba67c65cc70e68189547a670cb202fe23804f69b","start":58}],"target_id":"concept.planetmath.conceptsinabstractalgebra","target_kind":"node","target_sha256":"c62700bce0350aa1be84de69d19740086ae9f77e64c34d911ffc7594f03da183"}],"concept.planetmath.congruence12":[{"id":"assertion.concept.planetmath.congruence12","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Congruence as stated in the captured PlanetMath entry congruence12","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , and 𝔄 a structure for Σ .","support":[{"end":76,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\na\nstructure\nfor\nΣ\n.","source_id":"planetmath.congruence12","source_sha256":"de88667ffb1f8385773e3fe4a015e235e24a6926671d3ca4a62c7d7fb4e828d4","start":22}],"target_id":"concept.planetmath.congruence12","target_kind":"node","target_sha256":"4982ceea115daedf7eafbeaac2ed99d2773eaaac99c24778fcbda0188cc55aaf"}],"concept.planetmath.congruenceonapartialalgebra":[{"id":"assertion.concept.planetmath.congruenceonapartialalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Congruence on a partial algebra as stated in the captured PlanetMath entry congruenceonapartialalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition There are two types of congruences on a partial algebra 𝑨 , both are special types of a certain equivalence relation on A : 1.","support":[{"end":201,"quote":"Definition\nThere are two types of\ncongruences\non a\npartial algebra\n𝑨\n, both are special types of a certain\nequivalence relation\non\nA\n:\n1.","source_id":"planetmath.congruenceonapartialalgebra","source_sha256":"d910b7e2608b6c6a9a7022c42f71e7b3d9e999445f0a315891d3e5b7fcdd1afb","start":64}],"target_id":"concept.planetmath.congruenceonapartialalgebra","target_kind":"node","target_sha256":"47bdbdb562929a724f0e2482e60957cde8467e53adedbf7d6cc0d153073c91eb"}],"concept.planetmath.connectedposet":[{"id":"assertion.concept.planetmath.connectedposet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Connected poset as stated in the captured PlanetMath entry connectedposet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A07) states: Let P be a poset. Write a ⟂ b if either a ≤ b or b ≤ a . In other words, a ⟂ b if a and b are comparable .","support":[{"end":138,"quote":"Let\nP\nbe a poset. Write\na\n⟂\nb\nif either\na\n≤\nb\nor\nb\n≤\na\n. In other words,\na\n⟂\nb\nif\na\nand\nb\nare\ncomparable\n.","source_id":"planetmath.connectedposet","source_sha256":"21efa1cba5556e635a859c2a25c7f948655f6b1f00e8bb7cc5857425cde33cd1","start":32}],"target_id":"concept.planetmath.connectedposet","target_kind":"node","target_sha256":"7086ef1e05c407bb40db112f5b521a02e93032f0730e4e876e7773317e3b436f"}],"concept.planetmath.connectedspace":[{"id":"assertion.concept.planetmath.connectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Connected space as stated in the captured PlanetMath entry connectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be connected if there is no pair of nonempty subsets U , V such that both U and V are open in X , U ∩ V = ∅ and U ∪ V = X .","support":[{"end":188,"quote":"A\ntopological space\nX\nis said to be\nconnected\nif there is no pair of nonempty subsets\nU\n,\nV\nsuch that both\nU\nand\nV\nare open in\nX\n,\nU\n∩\nV\n=\n∅\nand\nU\n∪\nV\n=\nX\n.","source_id":"planetmath.connectedspace","source_sha256":"cc0a0135beba9927eb9cfca7184c5158bb630988d7fcfbb8c04d4b7fab6bd9dc","start":32}],"target_id":"concept.planetmath.connectedspace","target_kind":"node","target_sha256":"032393cc9c45d55bcbdc533240843c464e68dc4444108ca134d794658f3c41ed"}],"concept.planetmath.consequenceoperator":[{"id":"assertion.concept.planetmath.consequenceoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Consequence operator as stated in the captured PlanetMath entry consequenceoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G25, 03G10, 03B22) states: 1 Definition Let L be a set. A consequence operator on L is a mapping 1 1 Here, “ 𝒫 ” denotes the power set and ℱ denotes the finite power set.","support":[{"end":185,"quote":"1\nDefinition\nLet\nL\nbe a set. A\nconsequence operator\non\nL\nis a\nmapping\n1\n1\nHere, “\n𝒫\n” denotes the\npower set\nand\nℱ\ndenotes the finite power set.","source_id":"planetmath.consequenceoperator","source_sha256":"58b5a301514089fd93de8feab888e3c5325b696a23a9c16dd207e76b399fa3ab","start":42}],"target_id":"concept.planetmath.consequenceoperator","target_kind":"node","target_sha256":"e161814851ee0fdb3b4c7e53a6859067188f2b738552ebb5ba647df64657097b"}],"concept.planetmath.constructingautomatafromregularlanguages":[{"id":"assertion.concept.planetmath.constructingautomatafromregularlanguages","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Constructing automata from regular languages as stated in the captured PlanetMath entry constructingautomatafromregularlanguages","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: In this entry, we describe how a certain equivalence relation on words gives rise to a deterministic automaton , and show that deterministic automata to a certain extent can be characterized by these equivalence relations.","support":[{"end":312,"quote":"In this entry, we describe how a certain\nequivalence relation\non words gives rise to a\ndeterministic automaton\n, and show that\ndeterministic\nautomata to a certain extent can be characterized by these equivalence relations.","source_id":"planetmath.constructingautomatafromregularlanguages","source_sha256":"f9bde3ce3b641201f383b98f1982fdc4678fe7bbe7d0686dc5f3748c5c5babca","start":90}],"target_id":"concept.planetmath.constructingautomatafromregularlanguages","target_kind":"node","target_sha256":"113c35effbd6376a5aa25fa7c46fbb2e13a03c770457a2697f00976885092b5e"}],"concept.planetmath.continuumhypothesis":[{"id":"assertion.concept.planetmath.continuumhypothesis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Continuum hypothesis as stated in the captured PlanetMath entry continuumhypothesis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E50) states: The continuum hypothesis that there is no cardinal number κ such that ℵ 0 < κ < 2 ℵ 0 .","support":[{"end":129,"quote":"The\ncontinuum hypothesis\nthat there is no\ncardinal number\nκ\nsuch that\nℵ\n0\n<\nκ\n<\n2\nℵ\n0\n.","source_id":"planetmath.continuumhypothesis","source_sha256":"599c6a7fc458001c973934e9cd8fa3d66dc76b0fb48d2f535d47a627c93fdb97","start":42}],"target_id":"concept.planetmath.continuumhypothesis","target_kind":"node","target_sha256":"75be771d2f2e1f0371074ce72e166199b00f4fd0974e04ba3086a4554caee9b7"}],"concept.planetmath.contradiction":[{"id":"assertion.concept.planetmath.contradiction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contradiction as stated in the captured PlanetMath entry contradiction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F07, 03B05) states: A contradiction occurs when the statements p and ¬ ⁢ p are shown to be true simultaneously.","support":[{"end":119,"quote":"A\ncontradiction\noccurs when the statements\np\nand\n¬\n⁢\np\nare shown to be true simultaneously.","source_id":"planetmath.contradiction","source_sha256":"2d584ef65df0f425eba04237b6a6a8fe8a1ce8b99d94d082ef7e7fa2420e7ef4","start":28}],"target_id":"concept.planetmath.contradiction","target_kind":"node","target_sha256":"c04d33fbde5c37fb3d0d7ebad350fc01b4d410ddbfb73c304b38ec6c5ff61cc8"}],"concept.planetmath.contradictorystatement":[{"id":"assertion.concept.planetmath.contradictorystatement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contradictory statement as stated in the captured PlanetMath entry contradictorystatement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A contradictory statement is a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","support":[{"end":195,"quote":"A\ncontradictory statement\nis a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","source_id":"planetmath.contradictorystatement","source_sha256":"e72474be721723b02c02a3fe2a12cd93ca05df18ec9e5f5eea350a272e2f0a28","start":48}],"target_id":"concept.planetmath.contradictorystatement","target_kind":"node","target_sha256":"52016939951dc12104cdcd80fd15b147e3315550761cd28fb43ee93423ef264b"}],"concept.planetmath.contrapositive":[{"id":"assertion.concept.planetmath.contrapositive","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contrapositive as stated in the captured PlanetMath entry contrapositive","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Given an implication of the form p ⟹ q (“p implies q”) the contrapositive of this implication is ¬ ⁢ q ⟹ ¬ ⁢ p (“not q implies not p”).","support":[{"end":165,"quote":"Given an\nimplication\nof the form\np\n⟹\nq\n(“p implies q”) the\ncontrapositive\nof this implication is\n¬\n⁢\nq\n⟹\n¬\n⁢\np\n(“not q implies not p”).","source_id":"planetmath.contrapositive","source_sha256":"b69c12e29194d27e3e39356b592a554ab1d68feba37b031c9fcc15c0896d2c4b","start":30}],"target_id":"concept.planetmath.contrapositive","target_kind":"node","target_sha256":"87e5edd08b8f485c27dfab80c89e2c4c16f7e1807350009b32e8efc101234d76"}],"concept.planetmath.convergentsequence":[{"id":"assertion.concept.planetmath.convergentsequence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Convergent sequence as stated in the captured PlanetMath entry convergentsequence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 40A05) states: A sequence x 0 , x 1 , x 2 , … in a metric space ( X , d ) is a convergent sequence if there exists a point x ∈ X such that, for every real number ϵ > 0 , there exists a natural number N such that d ⁢ ( x , x n ) < ϵ for all n > N .","support":[{"end":272,"quote":"A\nsequence\nx\n0\n,\nx\n1\n,\nx\n2\n,\n…\nin a\nmetric space\n(\nX\n,\nd\n)\nis a\nconvergent sequence\nif there exists a point\nx\n∈\nX\nsuch that, for every\nreal number\nϵ\n>\n0\n, there exists a\nnatural number\nN\nsuch that\nd\n⁢\n(\nx\n,\nx\nn\n)\n<\nϵ\nfor all\nn\n>\nN\n.","source_id":"planetmath.convergentsequence","source_sha256":"26df8d751083de7827a1f1ae0ccc0dbea13cf83b3dd69648c01469fadbc3eced","start":40}],"target_id":"concept.planetmath.convergentsequence","target_kind":"node","target_sha256":"3501086f6f1f116b590f7bb21dcb5f749dbfdf1e9a29d4fd9cf38896e09df68c"}],"concept.planetmath.convexfunction":[{"id":"assertion.concept.planetmath.convexfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Convex function as stated in the captured PlanetMath entry convexfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 52A41, 26A51, 26B25, 55Q05, 18G30, 18B40, 20J05, 20E07, 18-01, 20L05) states: Definition Suppose Ω is a convex set in a vector space over ℝ (or ℂ ), and suppose f is a function f : Ω → ℝ .","support":[{"end":142,"quote":"Definition\nSuppose\nΩ\nis a\nconvex set\nin a\nvector space\nover\nℝ\n(or\nℂ\n), and suppose\nf\nis a function\nf\n:\nΩ\n→\nℝ\n.","source_id":"planetmath.convexfunction","source_sha256":"db6640afeaf0616191db08d47c0c10a35d68efdb407c544afac4867ae3fb062b","start":32}],"target_id":"concept.planetmath.convexfunction","target_kind":"node","target_sha256":"050b715a57dda12264836d41f29f6e3a44e140a0c6ac0a55ee91da41828c96c4"}],"concept.planetmath.coordinatevector":[{"id":"assertion.concept.planetmath.coordinatevector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coordinate vector as stated in the captured PlanetMath entry coordinatevector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space of dimension n over a field K .","support":[{"end":91,"quote":"Let\nV\nbe a\nvector space\nof\ndimension\nn\nover a field\nK\n.","source_id":"planetmath.coordinatevector","source_sha256":"c48f63b8ca91c7faff457ac73e540659ebf640fc5f8dc34c0619804a718aef25","start":36}],"target_id":"concept.planetmath.coordinatevector","target_kind":"node","target_sha256":"6489b56cc87bda036889e83be0e43ea444106acf294d3a2ca5addaefae837c31"}],"concept.planetmath.coset":[{"id":"assertion.concept.planetmath.coset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coset as stated in the captured PlanetMath entry coset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Let H be a subgroup of a group G , and let a ∈ G . The left coset of a with respect to H in G is defined to be the set a ⁢ H := { a ⁢ h ∣ h ∈ H } .","support":[{"end":159,"quote":"Let\nH\nbe a\nsubgroup\nof a group\nG\n, and let\na\n∈\nG\n. The\nleft coset\nof\na\nwith respect to\nH\nin\nG\nis defined to be the set\na\n⁢\nH\n:=\n{\na\n⁢\nh\n∣\nh\n∈\nH\n}\n.","source_id":"planetmath.coset","source_sha256":"82e720e1813856271a29e5af8fe1ac350f937ac6ef1dbb07ce9803f60d555869","start":12}],"target_id":"concept.planetmath.coset","target_kind":"node","target_sha256":"1858629fbac86c4530198488090b1a2bfd100c0f699f51d4babd8fcf6fd09c6e"}],"concept.planetmath.countable":[{"id":"assertion.concept.planetmath.countable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Countable as stated in the captured PlanetMath entry countable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A set S is countable if there exists a bijection between S and some subset of ℕ .","support":[{"end":101,"quote":"A set\nS\nis\ncountable\nif there exists a\nbijection\nbetween\nS\nand some subset of\nℕ\n.","source_id":"planetmath.countable","source_sha256":"62f3ab16981bd55c39e814edccf0d9e46058f21d1048d36650a81569d2a07b88","start":20}],"target_id":"concept.planetmath.countable","target_kind":"node","target_sha256":"83648ff538b2920e5cf4ebe4cd0b5d9cf2ef88334ed7804abd08cb665e4484c5"}],"concept.planetmath.countablyinfinite":[{"id":"assertion.concept.planetmath.countablyinfinite","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Countably infinite as stated in the captured PlanetMath entry countablyinfinite","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A set S is countably infinite if there is a bijection between S and ℕ .","support":[{"end":109,"quote":"A set\nS\nis\ncountably infinite\nif there is a\nbijection\nbetween\nS\nand\nℕ\n.","source_id":"planetmath.countablyinfinite","source_sha256":"e18436909f6a21aac0ca32d3e36e75c148e689d68094552254dced5239a372a2","start":38}],"target_id":"concept.planetmath.countablyinfinite","target_kind":"node","target_sha256":"dd7b64c56e167eebcfb3c9f3fa7a9c45c4239465603f8388a909c2b0334ec71b"}],"concept.planetmath.cover":[{"id":"assertion.concept.planetmath.cover","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cover as stated in the captured PlanetMath entry cover","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Definition ( [ 1 ] , pp. 49) Let Y be a subset of a set X .","support":[{"end":71,"quote":"Definition\n(\n[\n1\n]\n, pp. 49)\nLet\nY\nbe a subset of a set\nX\n.","source_id":"planetmath.cover","source_sha256":"91d18d9a5daf2503499accc5409feb8248a13baf5e6dda64087065be061459e6","start":12}],"target_id":"concept.planetmath.cover","target_kind":"node","target_sha256":"edb11c8fcf8426ad615b13a31941553ff39722ed230a9e32c2dee60a7fbcc70c"}],"concept.planetmath.crossproduct":[{"id":"assertion.concept.planetmath.crossproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cross product as stated in the captured PlanetMath entry crossproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A90, 15A72) states: \\PMlinkescapephrase imaginary part \\PMlinkescapephrase real part \\PMlinkescapephrase spanned by The cross product (or vector product ) of two vectors in ℝ 3 is a vector http://planetmath.org/node/1285 orthogonal to the plane of the two vectors being crossed, whose magnitude is equal to the area of the parallelogram defined by the two vectors.","support":[{"end":372,"quote":"\\PMlinkescapephrase\nimaginary part\n\\PMlinkescapephrase\nreal part\n\\PMlinkescapephrase\nspanned by\nThe\ncross product\n(or\nvector product\n) of two vectors in\nℝ\n3\nis a vector\nhttp://planetmath.org/node/1285\northogonal\nto the plane of the two vectors being crossed, whose magnitude is equal to the area of the\nparallelogram\ndefined by the two vectors.","source_id":"planetmath.crossproduct","source_sha256":"aa99c8e0f48a9ff7fc49d597c014c5cb40381b7415d421e4b69d8f8f28a6c626","start":28}],"target_id":"concept.planetmath.crossproduct","target_kind":"node","target_sha256":"3783411da4d99a01338320351818d4a574c5f30c11aedb53006c9c8a032afe9f"}],"concept.planetmath.cumulativehierarchy":[{"id":"assertion.concept.planetmath.cumulativehierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cumulative hierarchy as stated in the captured PlanetMath entry cumulativehierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: The cumulative hierarchy of sets is defined by transfinite recursion as follows: we define V 0 = ∅ and for each ordinal α we define V α + 1 = 𝒫 ⁢ ( V α ) and for each limit ordinal δ we define V δ = ⋃ α ∈ δ V α .","support":[{"end":254,"quote":"The\ncumulative hierarchy\nof sets\nis defined by\ntransfinite recursion\nas follows:\nwe define\nV\n0\n=\n∅\nand for each\nordinal\nα\nwe define\nV\nα\n+\n1\n=\n𝒫\n⁢\n(\nV\nα\n)\nand for each\nlimit ordinal\nδ\nwe define\nV\nδ\n=\n⋃\nα\n∈\nδ\nV\nα\n.","source_id":"planetmath.cumulativehierarchy","source_sha256":"40989bea4569a9366a793d8ea26013cdef7d52fd35ebda882339f13813eb877d","start":42}],"target_id":"concept.planetmath.cumulativehierarchy","target_kind":"node","target_sha256":"92b9e4ace5a1315c90e94614f8674ed64460a9f10ad4660a0d4c3d2fdd47e1a8"}],"concept.planetmath.deduction":[{"id":"assertion.concept.planetmath.deduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deduction as stated in the captured PlanetMath entry deduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: Deductions are formalizations of proofs. Informally, they can be viewed as arriving at a conclusion from a set of assumptions, via applications of some prescribed rules in a finite number of steps.","support":[{"end":217,"quote":"Deductions\nare formalizations of proofs. Informally, they can be viewed as arriving at a\nconclusion\nfrom a set of assumptions, via applications of some prescribed rules in a finite number of steps.","source_id":"planetmath.deduction","source_sha256":"ee05442ac5a62a52c8450db3a4fca98af56371f3cf9b67442bd25575fa4e063c","start":20}],"target_id":"concept.planetmath.deduction","target_kind":"node","target_sha256":"9286fbc1372adb6e55420389f25e0d40484aa47f6bda4306a38d78ec48cccf8a"}],"concept.planetmath.deductivesystem":[{"id":"assertion.concept.planetmath.deductivesystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deductive system as stated in the captured PlanetMath entry deductivesystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03F03, 03B99, 03B22) states: Introduction A deductive system is a formal (mathematical) setup of reasoning.","support":[{"end":112,"quote":"Introduction\nA\ndeductive system\nis a formal (mathematical) setup of reasoning.","source_id":"planetmath.deductivesystem","source_sha256":"25d023529f08ac7fcb8f4306663cf5e6bc73d8aca8c1190f1efdb610eddbae82","start":34}],"target_id":"concept.planetmath.deductivesystem","target_kind":"node","target_sha256":"8ba4bd0da5de68d6e366cfb5d7f7df23b42a05592cbe22a61bbf459f2f1862c6"}],"concept.planetmath.definitionsintrigonometry":[{"id":"assertion.concept.planetmath.definitionsintrigonometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Definitions in trigonometry as stated in the captured PlanetMath entry definitionsintrigonometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A09) states: Informal definitions Given a triangle A ⁢ B ⁢ C with a signed angle x at A and a right angle at B , the ratios B ⁢ C A ⁢ C A ⁢ B A ⁢ C B ⁢ C A ⁢ B are dependent only on the angle x , and therefore define functions , denoted by sin ⁡ x cos ⁡ x tan ⁡ x respectively, where the names are short for sine, cosine and tangent .","support":[{"end":377,"quote":"Informal definitions\nGiven a\ntriangle\nA\n⁢\nB\n⁢\nC\nwith a signed angle\nx\nat\nA\nand a\nright angle\nat\nB\n, the ratios\nB\n⁢\nC\nA\n⁢\nC\nA\n⁢\nB\nA\n⁢\nC\nB\n⁢\nC\nA\n⁢\nB\nare dependent only on the angle\nx\n, and therefore define\nfunctions\n,\ndenoted by\nsin\n⁡\nx\ncos\n⁡\nx\ntan\n⁡\nx\nrespectively, where the names are short for\nsine, cosine\nand\ntangent\n.","source_id":"planetmath.definitionsintrigonometry","source_sha256":"e8ecedddf5a4b1134ff11e70680983180152316f6a79bd63f0de4063c87ace09","start":56}],"target_id":"concept.planetmath.definitionsintrigonometry","target_kind":"node","target_sha256":"1113d40d3b9865ff406cbd5a0759c36dcb0a924ded652f40db7202fa06553c1b"}],"concept.planetmath.derivativenotation":[{"id":"assertion.concept.planetmath.derivativenotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Derivative notation as stated in the captured PlanetMath entry derivativenotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 26-00) states: This is the list of known standard representations and their nuances.","support":[{"end":109,"quote":"This is the list of known\nstandard representations\nand their nuances.","source_id":"planetmath.derivativenotation","source_sha256":"7f47c8753fb68c84edeb2349dcb6cfa3c39f40f01186aa5a0a18bf9317a34774","start":40}],"target_id":"concept.planetmath.derivativenotation","target_kind":"node","target_sha256":"1ce81d0f933eae540f16af2f96c9be4de8f4ced31291e33ff8825ba00c6eaa3e"}],"concept.planetmath.derivedbooleanoperations":[{"id":"assertion.concept.planetmath.derivedbooleanoperations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Derived Boolean operations as stated in the captured PlanetMath entry derivedbooleanoperations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Recall that a Boolean algebra is an algebraic system A consisting of five operations : 1.","support":[{"end":143,"quote":"Recall that a\nBoolean algebra\nis an\nalgebraic system\nA\nconsisting of five\noperations\n:\n1.","source_id":"planetmath.derivedbooleanoperations","source_sha256":"7153a3e95d3130c66b1158e02361d4b3f0722acde0cdf95c763a973afcb8602e","start":54}],"target_id":"concept.planetmath.derivedbooleanoperations","target_kind":"node","target_sha256":"e54723578a1a5b51aa2748961f80858fcd97b33ea3a1ef48c5dba6a6e897656c"}],"concept.planetmath.descendingorder":[{"id":"assertion.concept.planetmath.descendingorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Descending order as stated in the captured PlanetMath entry descendingorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in descending order if each a i ≥ a i + 1 .","support":[{"end":168,"quote":"A\nsequence\nor arbitrary\nordered set\nor one-dimensional array of numbers,\na\n, is said to be in\ndescending order\nif each\na\ni\n≥\na\ni\n+\n1\n.","source_id":"planetmath.descendingorder","source_sha256":"609556da5ae7bb19816935310f30a6c75c0100bf4621f439a326c9151876c750","start":34}],"target_id":"concept.planetmath.descendingorder","target_kind":"node","target_sha256":"cc580a7fe86dd41521bf2d7584ce5ea87ccee2e73cbf1b8ccd304d739c3d41d5"}],"concept.planetmath.determinant":[{"id":"assertion.concept.planetmath.determinant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Determinant as stated in the captured PlanetMath entry determinant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A15) states: Overview The determinant is an algebraic operation that transforms a square matrix M into a scalar.","support":[{"end":123,"quote":"Overview\nThe\ndeterminant\nis an algebraic operation that transforms a\nsquare matrix\nM\ninto a scalar.","source_id":"planetmath.determinant","source_sha256":"6268719a09730e28447d3e4a5e37cf83547d707f59b8089f78cb6e340a45539f","start":24}],"target_id":"concept.planetmath.determinant","target_kind":"node","target_sha256":"c6e3353cf7f82b1462e1c76e9a266aaedf1ff196e2d02462aa29f7b5b88057ee"}],"concept.planetmath.differentiablefunction":[{"id":"assertion.concept.planetmath.differentiablefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differentiable function as stated in the captured PlanetMath entry differentiablefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A24, 57R35) states: Let f : V → W be a function , where V and W are Banach spaces .","support":[{"end":111,"quote":"Let\nf\n:\nV\n→\nW\nbe a\nfunction\n, where\nV\nand\nW\nare\nBanach spaces\n.","source_id":"planetmath.differentiablefunction","source_sha256":"e0fac66e87a460b27c20cf9c0f209277d0e4d88e7bf6cd4499616e0ab53e705f","start":48}],"target_id":"concept.planetmath.differentiablefunction","target_kind":"node","target_sha256":"db0d2b2fbe3d3761e899a7d33ce54e343c9937daa4745e814c503bda682bde55"}],"concept.planetmath.differentialequation":[{"id":"assertion.concept.planetmath.differentialequation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differential equation as stated in the captured PlanetMath entry differentialequation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 35-00, 34-00) states: A differential equation is an equation involving an unknown function of one or more variables, its derivatives and the variables.","support":[{"end":174,"quote":"A\ndifferential equation\nis an equation involving an unknown\nfunction\nof one or more variables, its\nderivatives\nand the\n variables.","source_id":"planetmath.differentialequation","source_sha256":"7b38d147ffd71672878ef28f00f3beba388a5cd51984dd09b57d0317785db9d2","start":44}],"target_id":"concept.planetmath.differentialequation","target_kind":"node","target_sha256":"7d2d1badeb1606f43949e257558e52d2eaa1c252f950e3eb939ce463a7b27b5d"}],"concept.planetmath.differentialoperator":[{"id":"assertion.concept.planetmath.differentialoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differential operator as stated in the captured PlanetMath entry differentialoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53-00, 35-00, 47E05, 47F05) states: Roughly speaking, a differential operator is a mapping , typically understood to be linear, that transforms a function into another function by means of partial derivatives and multiplication by other functions.","support":[{"end":255,"quote":"Roughly speaking, a\ndifferential operator\nis a\nmapping\n,\ntypically understood to be linear, that transforms a\nfunction\ninto\nanother function by means of\npartial derivatives\nand\nmultiplication\nby\nother functions.","source_id":"planetmath.differentialoperator","source_sha256":"c56969befd423e88640d0fc5dc0ce97481291b8a771098c14043d25f8cc266ad","start":44}],"target_id":"concept.planetmath.differentialoperator","target_kind":"node","target_sha256":"2f7576bb2af812e267cb8c0f230734cdb7e65f7f0b4c55bfd1fc5794b4c6358d"}],"concept.planetmath.dimension":[{"id":"assertion.concept.planetmath.dimension","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension as stated in the captured PlanetMath entry dimension","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 00-01, 15A03, 54F45) states: The word dimension in mathematics has many definitions, but all of them are trying to quantify our intuition that, for example, a sheet of paper has somehow one less dimension than a stack of papers.","support":[{"end":219,"quote":"The word\ndimension\nin mathematics has many definitions, but\nall of them are trying to quantify our intuition that, for\nexample, a sheet of paper has somehow one less dimension than a\nstack of papers.","source_id":"planetmath.dimension","source_sha256":"0315c16ffa6db3cf508500dcb43e5a59078102c1df53f224cd35b766c4e31f9c","start":20}],"target_id":"concept.planetmath.dimension","target_kind":"node","target_sha256":"72f64f0e9a42d9b4efe2b8a23215e65996b5f89fa51dc1338b7214b87da40da7"}],"concept.planetmath.dimensionofaposet":[{"id":"assertion.concept.planetmath.dimensionofaposet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension of a poset as stated in the captured PlanetMath entry dimensionofaposet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06, 06A07) states: Let P be a finite poset and ℛ be the family of all realizers of P .","support":[{"end":109,"quote":"Let\nP\nbe a finite poset and\nℛ\nbe the family of all\nrealizers\nof\nP\n.","source_id":"planetmath.dimensionofaposet","source_sha256":"5f4cdf00100229a0e4ad0214ad8be212b22a362ba996fdf2032f2e7cdb738334","start":42}],"target_id":"concept.planetmath.dimensionofaposet","target_kind":"node","target_sha256":"abaf4d5cf5aaca34be063ebe20959e7691f282bd65959136334c2569ae077119"}],"concept.planetmath.dimensionvectorspace":[{"id":"assertion.concept.planetmath.dimensionvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension (vector space) as stated in the captured PlanetMath entry dimensionvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space over a field K . We say that V is finite-dimensional if there exists a finite basis of V .","support":[{"end":164,"quote":"Let\nV\nbe a\nvector space\nover a field\nK\n. We say that\nV\nis\nfinite-dimensional\nif there exists a finite basis of\nV\n.","source_id":"planetmath.dimensionvectorspace","source_sha256":"6c1e3d7044526f332513244c178110c830a2169617e6a742bdf17e8cdaefdfed","start":50}],"target_id":"concept.planetmath.dimensionvectorspace","target_kind":"node","target_sha256":"5b2122a5acb422a92054bad90a4f719ca6a1723cb9bac149253745a90f1207a7"}],"concept.planetmath.directionalderivative":[{"id":"assertion.concept.planetmath.directionalderivative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Directional derivative as stated in the captured PlanetMath entry directionalderivative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B12, 26B10) states: Let U be an open set in ℝ n and f : U → ℂ is a differentiable function .","support":[{"end":118,"quote":"Let\nU\nbe an open set in\nℝ\nn\nand\nf\n:\nU\n→\nℂ\nis a\ndifferentiable\nfunction\n.","source_id":"planetmath.directionalderivative","source_sha256":"f3fd1edd1fdb5259a0875d87218a8e8577a4df64f0bc831a60fc2231904f182e","start":46}],"target_id":"concept.planetmath.directionalderivative","target_kind":"node","target_sha256":"a85b4423b65f2bcf40376e42994c0682782f9f0f5e53eaeae829fca28bf5412c"}],"concept.planetmath.directproductofpartialalgebras":[{"id":"assertion.concept.planetmath.directproductofpartialalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Direct product of partial algebras as stated in the captured PlanetMath entry directproductofpartialalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 08A62, 03E99) states: Let 𝑨 and 𝑩 be two partial algebraic systems of type τ .","support":[{"end":126,"quote":"Let\n𝑨\nand\n𝑩\nbe two\npartial algebraic systems\nof type\nτ\n.","source_id":"planetmath.directproductofpartialalgebras","source_sha256":"c96d79acd701cb81fa231206caf05c7c85a15945176cb2eef6a705debe6d5556","start":70}],"target_id":"concept.planetmath.directproductofpartialalgebras","target_kind":"node","target_sha256":"24af6023be520c1141c0483a60b9acf0fd8e0c5d7f887fd4663203a7247c2c7c"}],"concept.planetmath.discrete":[{"id":"assertion.concept.planetmath.discrete","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Discrete as stated in the captured PlanetMath entry discrete","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: This entry aims at highlighting the fact that all uses of the word discrete in mathematics are directly related to the core concept of discrete space : • A discrete set is a set that, endowed with the topology implied by the context, is a \\PMlinkescaptetext discrete space.","support":[{"end":291,"quote":"This entry aims at highlighting the fact that all uses of the word\ndiscrete\nin mathematics are directly related to the core concept of\ndiscrete space\n:\n•\nA\ndiscrete set\nis a set that, endowed with the\ntopology\nimplied by the context, is a\n\\PMlinkescaptetext\ndiscrete space.","source_id":"planetmath.discrete","source_sha256":"38f01bfc2a1f54ecd157da032df0434d43d4e6c9284589fcac9102913af91a2a","start":18}],"target_id":"concept.planetmath.discrete","target_kind":"node","target_sha256":"a19bbdcbcb8a4eff98346fdfcf51648b47be606b6be498fc6a52b4afeaf53896"}],"concept.planetmath.discretespace":[{"id":"assertion.concept.planetmath.discretespace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Discrete space as stated in the captured PlanetMath entry discretespace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: The discrete topology on a set X is the topology given by the power set of X .","support":[{"end":108,"quote":"The\ndiscrete topology\non a set\nX\nis the\ntopology\ngiven by\nthe\npower set\nof\nX\n.","source_id":"planetmath.discretespace","source_sha256":"7da720b0716ed6dc6260ea79f95bf1f83611c72f8722de0bf68ff96a39f732b0","start":30}],"target_id":"concept.planetmath.discretespace","target_kind":"node","target_sha256":"40aec15cd2a45d67cf9db28b4cb0d8a707239d13f5c80eef790a82d597f5807e"}],"concept.planetmath.disjointunion":[{"id":"assertion.concept.planetmath.disjointunion","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Disjoint union as stated in the captured PlanetMath entry disjointunion","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Disjoint union of two sets Let A and B be sets. Then their disjoint union is the union A ⁢ ∐ B := A ∪ ( B × { ⋆ } ) , where ⋆ is an object chosen so that A and B × { ⋆ } are disjoint .","support":[{"end":214,"quote":"Disjoint union of two sets\nLet\nA\nand\nB\nbe sets. Then their\ndisjoint union\nis the union\nA\n⁢\n∐\nB\n:=\nA\n∪\n(\nB\n×\n{\n⋆\n}\n)\n,\nwhere\n⋆\nis an object chosen so that\nA\nand\nB\n×\n{\n⋆\n}\nare\ndisjoint\n.","source_id":"planetmath.disjointunion","source_sha256":"7ff51b405f8a8f69366434eceedb12d23b1736b0963464c5e03908aa5ec6f556","start":30}],"target_id":"concept.planetmath.disjointunion","target_kind":"node","target_sha256":"1d19de78461b6fb0d33f681ff646d8114b78f5788a58772cbdf0842a3cac4492"}],"concept.planetmath.distanceinagraph":[{"id":"assertion.concept.planetmath.distanceinagraph","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distance (in a graph) as stated in the captured PlanetMath entry distanceinagraph","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C12) states: The distance d ⁢ ( x , y ) of two vertices x and y of a graph G is the length of the shortest path (or, equivalently, walk) from x to y .","support":[{"end":181,"quote":"The\ndistance\nd\n⁢\n(\nx\n,\ny\n)\nof two vertices\nx\nand\ny\nof a graph\nG\nis the length of the shortest path (or, equivalently, walk) from\nx\nto\ny\n.","source_id":"planetmath.distanceinagraph","source_sha256":"5623ea7c777a208864f03b7e093734054276be54ec1314f2dc82041119d3267f","start":44}],"target_id":"concept.planetmath.distanceinagraph","target_kind":"node","target_sha256":"d2f48c7074da983720440c9254204323a07c04d1030d25658b1fd1911e876fcf"}],"concept.planetmath.distributionfunction":[{"id":"assertion.concept.planetmath.distributionfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distribution function as stated in the captured PlanetMath entry distributionfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60E05) states: [this entry is currently being revised, so hold off on corrections until this line is removed] Let F : ℝ → ℝ .","support":[{"end":154,"quote":"[this entry is currently being revised, so hold off on corrections until\nthis line is removed]\nLet\nF\n:\nℝ\n→\nℝ\n.","source_id":"planetmath.distributionfunction","source_sha256":"b30413e389f37aa50335f7e81ea9685b03a912968db67db42ce2f3872abb54c7","start":44}],"target_id":"concept.planetmath.distributionfunction","target_kind":"node","target_sha256":"69f75760b9f202891f6857c0f5483373c8f08e6e8376b6577daf381ee7c00ef8"}],"concept.planetmath.distributivity":[{"id":"assertion.concept.planetmath.distributivity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distributivity as stated in the captured PlanetMath entry distributivity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06D99, 16-00, 13-00, 17-00) states: Given a set ( http://planetmath.org/Set ) S with two binary operations + : S × S → S and ⋅ : S × S → S , we say that ⋅ is right distributive over + if ( a + b ) ⋅ c = ( a ⋅ c ) + ( b ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S and left distributive over + if a ⋅ ( b + c ) = ( a ⋅ b ) + ( a ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S .","support":[{"end":346,"quote":"Given a set (\nhttp://planetmath.org/Set\n)\nS\nwith two\nbinary operations\n+\n:\nS\n×\nS\n→\nS\nand\n⋅\n:\nS\n×\nS\n→\nS\n, we say that\n⋅\nis\nright distributive\nover\n+\nif\n(\na\n+\nb\n)\n⋅\nc\n=\n(\na\n⋅\nc\n)\n+\n(\nb\n⋅\nc\n)\n⁢\nfor\n⁢\nall\n⁢\na\n,\nb\n,\nc\n∈\nS\nand\nleft distributive\nover\n+\nif\na\n⋅\n(\nb\n+\nc\n)\n=\n(\na\n⋅\nb\n)\n+\n(\na\n⋅\nc\n)\n⁢\nfor\n⁢\nall\n⁢\na\n,\nb\n,\nc\n∈\nS\n.","source_id":"planetmath.distributivity","source_sha256":"e8326f02ba5b45e932461b93d27778c584bbf39219f0c6157ad6c8c4964820c8","start":30}],"target_id":"concept.planetmath.distributivity","target_kind":"node","target_sha256":"e52ebf9a6c0c80f5d2eb7803bf91e68b5530e2349d9eb191242c2d4de01f270c"}],"concept.planetmath.division":[{"id":"assertion.concept.planetmath.division","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Division as stated in the captured PlanetMath entry division","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05, 12E99) states: Division is the operation which assigns to every two numbers (or more generally, elements of a field) a and b their quotient or ratio, provided that the latter, b , is distinct from zero.","support":[{"end":205,"quote":"Division\nis the\noperation\nwhich assigns to every two numbers (or more generally, elements of a field)\na\nand\nb\ntheir\nquotient\nor ratio, provided that the latter,\nb\n, is distinct from zero.","source_id":"planetmath.division","source_sha256":"38d3f7ec639f947b28c23bfa896047dadc91f2a24fc58dd1a5f8e8eca0684ae4","start":18}],"target_id":"concept.planetmath.division","target_kind":"node","target_sha256":"c76efcf75c7ba0082f0f8b1f4d0b89f0666aeac363685654e97a6701314332d4"}],"concept.planetmath.dotproduct":[{"id":"assertion.concept.planetmath.dotproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dot product as stated in the captured PlanetMath entry dotproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 83C05, 15A63, 14-02, 14-01) states: Let u = ( u 1 , u 2 , … , u n ) and v = ( v 1 , v 2 , … , v n ) two vectors on k n where k is a field (like ℝ or ℂ ).","support":[{"end":141,"quote":"Let\nu\n=\n(\nu\n1\n,\nu\n2\n,\n…\n,\nu\nn\n)\nand\nv\n=\n(\nv\n1\n,\nv\n2\n,\n…\n,\nv\nn\n)\ntwo vectors on\nk\nn\nwhere\nk\nis a field (like\nℝ\nor\nℂ\n).","source_id":"planetmath.dotproduct","source_sha256":"bbc793378686c83e92cd0b59a74742bd1e091ba85b39bac5f6384a7bdf44a108","start":24}],"target_id":"concept.planetmath.dotproduct","target_kind":"node","target_sha256":"a15f296ea042b359dd1a0b5804d283675a6745e7a08899201e0a6b767ec7ecfd"}],"concept.planetmath.dualhomomorphism":[{"id":"assertion.concept.planetmath.dualhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dual homomorphism as stated in the captured PlanetMath entry dualhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A72, 15A04) states: Definition. Let U , V be vector spaces over a field 𝕂 , and T : U → V be a homomorphism (a linear map ) between them.","support":[{"end":153,"quote":"Definition.\nLet\nU\n,\nV\nbe\nvector spaces\nover a field\n𝕂\n, and\nT\n:\nU\n→\nV\nbe a\nhomomorphism\n(a\nlinear map\n) between them.","source_id":"planetmath.dualhomomorphism","source_sha256":"962b62432e6129649473c5b8f77d707e882b9cbad1610897541caa7ad8bbd7d0","start":36}],"target_id":"concept.planetmath.dualhomomorphism","target_kind":"node","target_sha256":"534d6f97c90158290a5552e7bb2109781b1c580d3cfb674158e9a5615519e4fd"}],"concept.planetmath.dualspace":[{"id":"assertion.concept.planetmath.dualspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dual space as stated in the captured PlanetMath entry dualspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A99) states: Dual of a vector space ; dual bases Let V be a vector space over a field k .","support":[{"end":98,"quote":"Dual of a\nvector space\n; dual bases\nLet\nV\nbe a vector space over a field\nk\n.","source_id":"planetmath.dualspace","source_sha256":"538b0ad5f9617b178f08fcb6c17c1b904d3355b123a8b0d0c56cf9fc5390d8f2","start":22}],"target_id":"concept.planetmath.dualspace","target_kind":"node","target_sha256":"61d4c2b4e08779a58ef4f06ac9e67297f2cb53c8e0b498cedd6dac8bd331d50c"}],"concept.planetmath.egyptianfraction":[{"id":"assertion.concept.planetmath.egyptianfraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Egyptian fraction as stated in the captured PlanetMath entry egyptianfraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A35, 01A30, 01A20, 01A16) states: This narrative reports rational number as a/b rather than in the standard LaTeX fraction form.","support":[{"end":130,"quote":"This narrative reports\nrational number\nas a/b rather than in the standard LaTeX\nfraction\nform.","source_id":"planetmath.egyptianfraction","source_sha256":"ebe0aaba0b5a9edd84799c6037e9a00e543b00674e4d0d5dd279e3da967235f8","start":36}],"target_id":"concept.planetmath.egyptianfraction","target_kind":"node","target_sha256":"19d5410043ac5ec5a5cb64253c5bc374ae9534dfe44d28d25976b00bdb64a665"}],"concept.planetmath.elementaryembedding":[{"id":"assertion.concept.planetmath.elementaryembedding","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary embedding as stated in the captured PlanetMath entry elementaryembedding","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99) states: Let τ be a signature and 𝒜 and ℬ be two structures for τ such that f : 𝒜 → ℬ is an embedding .","support":[{"end":136,"quote":"Let\nτ\nbe a\nsignature\nand\n𝒜\nand\nℬ\nbe two\nstructures\nfor\nτ\nsuch that\nf\n:\n𝒜\n→\nℬ\nis an\nembedding\n.","source_id":"planetmath.elementaryembedding","source_sha256":"747f1daf72be77b5c6e91b642733e84d7b8fdb1c1af9ec763f244b675cf70794","start":42}],"target_id":"concept.planetmath.elementaryembedding","target_kind":"node","target_sha256":"6909d12aea8ea343212f7e5d3aa13b97e94f04f6cc4396247de3237ed763369a"}],"concept.planetmath.elementaryfunction":[{"id":"assertion.concept.planetmath.elementaryfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary function as stated in the captured PlanetMath entry elementaryfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A99) states: An elementary function is a real function (of one variable) that can be constructed by a finite number of elementary operations ( addition , subtraction , multiplication and division ) and compositions from constant functions , the identity function ( x ↦ x ), algebraic functions , exponential functions , logarithm functions , trigonometric functions and cyclometric functions .","support":[{"end":420,"quote":"An\nelementary function\nis a\nreal function\n(of one variable) that can be constructed by a finite number of elementary operations (\naddition\n,\nsubtraction\n,\nmultiplication\nand\ndivision\n) and\ncompositions\nfrom\nconstant functions\n, the\nidentity function\n(\nx\n↦\nx\n),\nalgebraic functions\n,\nexponential functions\n,\nlogarithm functions\n,\ntrigonometric functions\nand\ncyclometric functions\n.","source_id":"planetmath.elementaryfunction","source_sha256":"4e393cb1d9ae42f49c31c1dfe1e03a0380dfd69b7a0334b8255d86f869c77884","start":40}],"target_id":"concept.planetmath.elementaryfunction","target_kind":"node","target_sha256":"2127e24bf02042db6a6abbd9f1a76e4263f6bd3d7c02ec05cd8c2cb8a408f118"}],"concept.planetmath.elementaryrecursivefunction":[{"id":"assertion.concept.planetmath.elementaryrecursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary recursive function as stated in the captured PlanetMath entry elementaryrecursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: Informally, elementary recursive functions are functions that can be obtained from functions encountered in elementary schools: addition , multiplication , subtraction , and division , using basic operations such as substitutions and finite summation and product .","support":[{"end":324,"quote":"Informally,\nelementary recursive functions\nare\nfunctions\nthat can be obtained from functions encountered in elementary schools:\naddition\n,\nmultiplication\n,\nsubtraction\n, and\ndivision\n, using basic\noperations\nsuch as substitutions and finite\nsummation\nand\nproduct\n.","source_id":"planetmath.elementaryrecursivefunction","source_sha256":"a85f2633dfb92a9c67e832bb9aa3019d721ddbabf7dd87b99188f48e03b93670","start":60}],"target_id":"concept.planetmath.elementaryrecursivefunction","target_kind":"node","target_sha256":"cf3159d6ae138f33c78ac9e9b9b72c3d91e7365e001e33a49dacffe544639d5c"}],"concept.planetmath.emptyset":[{"id":"assertion.concept.planetmath.emptyset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Empty set as stated in the captured PlanetMath entry emptyset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 65H05, 65H10) states: An empty set is a set ∅ that contains no elements .","support":[{"end":71,"quote":"An\nempty set\nis a set\n∅\nthat contains no\nelements\n.","source_id":"planetmath.emptyset","source_sha256":"f63f3e9f7ce921da07ce93dab3c96e557f35d3b7be0d87cfd00b915280f61096","start":20}],"target_id":"concept.planetmath.emptyset","target_kind":"node","target_sha256":"a49918ec9876de51177a5a0fb6e277893ff04a9806a0774aa881f8cf7cde3ced"}],"concept.planetmath.endpoint":[{"id":"assertion.concept.planetmath.endpoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Endpoint as stated in the captured PlanetMath entry endpoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51-00, 03-00) states: An endpoint of a line segment L is a point that belongs to the boundary of L .","support":[{"end":96,"quote":"An\nendpoint\nof a\nline segment\nL\nis a point that belongs to the boundary of\nL\n.","source_id":"planetmath.endpoint","source_sha256":"402e3864852f9f11157ba03530216697ac6261516dc5fae0069e97c5428bfc8a","start":18}],"target_id":"concept.planetmath.endpoint","target_kind":"node","target_sha256":"b5309ea8148ad98a01ac78f9a25aed2fbf8bb57f599c3ba0c9f7353b253a1949"}],"concept.planetmath.equality":[{"id":"assertion.concept.planetmath.equality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equality as stated in the captured PlanetMath entry equality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 06-00) states: In any set S , the equality , denoted by “ = ”, is a binary relation which is reflexive , symmetric , transitive and antisymmetric, i.e.","support":[{"end":154,"quote":"In any set\nS\n, the\nequality\n, denoted by “\n=\n”, is a\nbinary relation\nwhich is\nreflexive\n,\nsymmetric\n,\ntransitive\nand antisymmetric, i.e.","source_id":"planetmath.equality","source_sha256":"af30c238db42464b6f0a84236772ce288a20847ce17b217dcd069f9a3d70c8eb","start":18}],"target_id":"concept.planetmath.equality","target_kind":"node","target_sha256":"8f8026b98eb6204373eb04d4e794a282126cd892063d867a07a68294c055d605"}],"concept.planetmath.equationalclass":[{"id":"assertion.concept.planetmath.equationalclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equational class as stated in the captured PlanetMath entry equationalclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08B99, 03C05) states: Let K be a class of algebraic systems of the same type.","support":[{"end":89,"quote":"Let\nK\nbe a class of\nalgebraic systems\nof the same type.","source_id":"planetmath.equationalclass","source_sha256":"fa23583bb878a26aad4a76446935fe1ab797e37c46d92abf33edacaba89f1f62","start":34}],"target_id":"concept.planetmath.equationalclass","target_kind":"node","target_sha256":"6e77cfbe0a803e562604fc1c4c260bce74001e9a1d536c693eff562968ef62bf"}],"concept.planetmath.equivalenceclass":[{"id":"assertion.concept.planetmath.equivalenceclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence class as stated in the captured PlanetMath entry equivalenceclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 93D05, 03B52, 93C42) states: Let S be a set with an equivalence relation ∼ . An equivalence class of S under ∼ is a subset T ⊂ S such that • If x ∈ T and y ∈ S , then x ∼ y if and only if y ∈ T • If S is nonempty, then T is nonempty For x ∈ S , the equivalence class containing x is often denoted by [ x ] , so that [ x ] := { y ∈ S ∣ x ∼ y } .","support":[{"end":351,"quote":"Let\nS\nbe a set with an\nequivalence relation\n∼\n. An\nequivalence class\nof\nS\nunder\n∼\nis a subset\nT\n⊂\nS\nsuch that\n•\nIf\nx\n∈\nT\nand\ny\n∈\nS\n, then\nx\n∼\ny\nif and only if\ny\n∈\nT\n•\nIf\nS\nis nonempty, then\nT\nis nonempty\nFor\nx\n∈\nS\n, the equivalence class containing\nx\nis often denoted by\n[\nx\n]\n, so that\n[\nx\n]\n:=\n{\ny\n∈\nS\n∣\nx\n∼\ny\n}\n.","source_id":"planetmath.equivalenceclass","source_sha256":"76da04375aac43d923d8252c4cd271aa7c5bb55caa49ba85346be9a26e0c697e","start":36}],"target_id":"concept.planetmath.equivalenceclass","target_kind":"node","target_sha256":"498dbf5c31dcd5c1ecc25fd97524ba5857228cc871aa248137da5169b67947a3"}],"concept.planetmath.equivalenceofforcingnotions":[{"id":"assertion.concept.planetmath.equivalenceofforcingnotions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence of forcing notions as stated in the captured PlanetMath entry equivalenceofforcingnotions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E35, 03E40) states: Let P and Q be two forcing notions such that given any generic subset G of P there is a generic subset H of Q with 𝔐 ⁢ [ G ] = 𝔐 ⁢ [ H ] and vice-versa.","support":[{"end":214,"quote":"Let\nP\nand\nQ\nbe two\nforcing\nnotions such that given any\ngeneric\nsubset\nG\nof\nP\nthere is a generic subset\nH\nof\nQ\nwith\n𝔐\n⁢\n[\nG\n]\n=\n𝔐\n⁢\n[\nH\n]\nand vice-versa.","source_id":"planetmath.equivalenceofforcingnotions","source_sha256":"28541c0b4cbf06c5ab816c4ae3a4879f59a6a21a71af6cd9c129fda5c6111172","start":62}],"target_id":"concept.planetmath.equivalenceofforcingnotions","target_kind":"node","target_sha256":"93ab0871d79fcdebbf87a37fdc34d2eeb66c746773a36049020ddb84ae824b3a"}],"concept.planetmath.equivalencerelation":[{"id":"assertion.concept.planetmath.equivalencerelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence relation as stated in the captured PlanetMath entry equivalencerelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06-00, 03D20) states: An equivalence relation ∼ on a set S is a relation that is: Reflexive .","support":[{"end":113,"quote":"An\nequivalence relation\n∼\non a set\nS\nis a\nrelation\nthat is:\nReflexive\n.","source_id":"planetmath.equivalencerelation","source_sha256":"a85f2966361ab066eb956976d7eec4e8dd3ea4e5403e2cad5879a6ff596a7f9f","start":42}],"target_id":"concept.planetmath.equivalencerelation","target_kind":"node","target_sha256":"ecd0bd9e7dd0146c245702bb2140f15e0b237a9b8364caad565a6326fcdd4d3d"}],"concept.planetmath.equivalentmachines":[{"id":"assertion.concept.planetmath.equivalentmachines","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalent machines as stated in the captured PlanetMath entry equivalentmachines","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Let M 1 = ( S 1 , Σ , Δ , σ 1 , λ 1 ) and M 2 = ( S 2 , Σ , Δ , σ 2 , λ 2 ) be two Mealy machines .","support":[{"end":139,"quote":"Let\nM\n1\n=\n(\nS\n1\n,\nΣ\n,\nΔ\n,\nσ\n1\n,\nλ\n1\n)\nand\nM\n2\n=\n(\nS\n2\n,\nΣ\n,\nΔ\n,\nσ\n2\n,\nλ\n2\n)\nbe two\nMealy machines\n.","source_id":"planetmath.equivalentmachines","source_sha256":"2815a84cc705544571084658be946d680ceea430c35205273efe522c8c0435e8","start":40}],"target_id":"concept.planetmath.equivalentmachines","target_kind":"node","target_sha256":"93351c5cfe0b12d36b60856a29e1a40d95bbb077d4b804c55a407a3c4fe30d7e"}],"concept.planetmath.euclideanfield":[{"id":"assertion.concept.planetmath.euclideanfield","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Euclidean field as stated in the captured PlanetMath entry euclideanfield","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D15) states: An ordered field F is Euclidean if every non-negative element a ( a ≥ 0 ) is a square in F (there exists b ∈ F such that b 2 = a ).","support":[{"end":163,"quote":"An\nordered field\nF\nis\nEuclidean\nif every non-negative element\na\n(\na\n≥\n0\n) is a square in\nF\n(there exists\nb\n∈\nF\nsuch that\nb\n2\n=\na\n).","source_id":"planetmath.euclideanfield","source_sha256":"03562a7d3d0cc3ae7fb9fcdca75c81b11566ca6e9cec87b312e1cb304350d316","start":32}],"target_id":"concept.planetmath.euclideanfield","target_kind":"node","target_sha256":"58501fa778c0c1bb5611da118702f07d5b6f1fde61a70ef6ab62ed0b16aefdf6"}],"concept.planetmath.euclideanspace":[{"id":"assertion.concept.planetmath.euclideanspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Euclidean space as stated in the captured PlanetMath entry euclideanspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03, 51M05) states: 1 Definition Euclidean n -space is a metric space ( E , d ) with the property that the group of isometries is transitive and is isomorphic to an n -dimensional Euclidean vector space .","support":[{"end":216,"quote":"1\nDefinition\nEuclidean\nn\n-space\nis a\nmetric space\n(\nE\n,\nd\n)\nwith the\nproperty\nthat the\ngroup of isometries\nis\ntransitive\nand is\nisomorphic\nto an\nn\n-dimensional\nEuclidean vector space\n.","source_id":"planetmath.euclideanspace","source_sha256":"966d29e4a1518e5374895473d22fc2e55f5f208833aeded96fc9129e4ce1e968","start":32}],"target_id":"concept.planetmath.euclideanspace","target_kind":"node","target_sha256":"721016d12b8c4a46aa6b7996d0c8a31ac4efb2f7d15cc28605b21bba12b494c2"}],"concept.planetmath.evennumber":[{"id":"assertion.concept.planetmath.evennumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Even number as stated in the captured PlanetMath entry evennumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11-00, 03-00) states: Definition Suppose k is an integer . If there exists an integer r such that k = 2 ⁢ r + 1 , then k is an odd number .","support":[{"end":141,"quote":"Definition\nSuppose\nk\nis an\ninteger\n.\nIf there exists an integer\nr\nsuch that\nk\n=\n2\n⁢\nr\n+\n1\n, then\nk\nis an\nodd number\n.","source_id":"planetmath.evennumber","source_sha256":"d477e373ad2c3909567f528ce7a4c293fc2aa89be1c6c3de918dd9d99077c4d8","start":24}],"target_id":"concept.planetmath.evennumber","target_kind":"node","target_sha256":"ecf5e190735b51bf3030c6d84f750af3c4ea6fb30949edcaa1a47c94071da3b2"}],"concept.planetmath.exclusiveor":[{"id":"assertion.concept.planetmath.exclusiveor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Exclusive or as stated in the captured PlanetMath entry exclusiveor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: The logical operator xor, short for “ exclusive or ”, is a binary operator that is true iff exactly one of its parameters is true, and thus corresponds to the normal use of “or” in English.","support":[{"end":215,"quote":"The logical operator xor, short for “\nexclusive or\n”, is a\nbinary operator\nthat is true iff exactly one of its\nparameters\nis true, and thus corresponds to the normal use of “or” in English.","source_id":"planetmath.exclusiveor","source_sha256":"0441d8a920d84b3531318d8d7bdc6e2beece8a2e2bcda625b6af9f3cac550d27","start":26}],"target_id":"concept.planetmath.exclusiveor","target_kind":"node","target_sha256":"79f999bc93c6160fd8e489293595dd541f3eea984f4b587f63166b449f82726a"}],"concept.planetmath.expression":[{"id":"assertion.concept.planetmath.expression","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Expression as stated in the captured PlanetMath entry expression","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: An expression is a symbol or of symbols used to denote a quantity or value.","support":[{"end":98,"quote":"An\nexpression\nis a symbol or  of symbols used to denote a quantity or value.","source_id":"planetmath.expression","source_sha256":"3baed8948760ea2522fc04ac0fc80d7c558b8b32f444d7f2e17c2b8f5d8a8744","start":22}],"target_id":"concept.planetmath.expression","target_kind":"node","target_sha256":"4f2c0b931790c96b7b43cb2d64301ff0db15ab92efdf45795f1ecdf64f88b45c"}],"concept.planetmath.extendedrealnumbers":[{"id":"assertion.concept.planetmath.extendedrealnumbers","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Extended real numbers as stated in the captured PlanetMath entry extendedrealnumbers","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 28-00, 12D99) states: The extended real numbers are the real numbers together with + ∞ (or simply ∞ ) and - ∞ .","support":[{"end":133,"quote":"The\nextended real numbers\nare the\nreal numbers\ntogether with\n+\n∞\n(or simply\n∞\n) and\n-\n∞\n.","source_id":"planetmath.extendedrealnumbers","source_sha256":"bfabb9a29830c238693cc7cf35514cc7a9be91eef96aa836c994f54b6ca27a6d","start":44}],"target_id":"concept.planetmath.extendedrealnumbers","target_kind":"node","target_sha256":"018ce5d1e15a542fe8ed4c51c25c734c93d640ff070c4b214c1e69884d5c6a4d"}],"concept.planetmath.extensionofafunction":[{"id":"assertion.concept.planetmath.extensionofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Extension of a function as stated in the captured PlanetMath entry extensionofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let f : X → Y be a function and A and B be sets such that X ⊆ A and Y ⊆ B .","support":[{"end":123,"quote":"Let\nf\n:\nX\n→\nY\nbe a\nfunction\nand\nA\nand\nB\nbe sets such that\nX\n⊆\nA\nand\nY\n⊆\nB\n.","source_id":"planetmath.extensionofafunction","source_sha256":"8aa2cc5525aa74fa816b67f8659d70dada127341c16d36d43e09b33b31bc208e","start":48}],"target_id":"concept.planetmath.extensionofafunction","target_kind":"node","target_sha256":"248fb96aa4a935b02d2cfa40a6c33be98c52ec02058f231e88d6e38d5beb3c14"}],"concept.planetmath.filterbasis":[{"id":"assertion.concept.planetmath.filterbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Filter basis as stated in the captured PlanetMath entry filterbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 54A99) states: A filter subbasis for a set S is a collection of subsets of S which has the finite intersection property .","support":[{"end":132,"quote":"A\nfilter subbasis\nfor a set\nS\nis a\ncollection\nof subsets of\nS\nwhich has the\nfinite intersection property\n.","source_id":"planetmath.filterbasis","source_sha256":"6a60fdda6393526525dd9b93e01c533c928075bab4153ffc867be3e39f9d6304","start":26}],"target_id":"concept.planetmath.filterbasis","target_kind":"node","target_sha256":"f046feeac14a3b19440193357ea4846df99ff1356f1e0e8135c1d95fef5da516"}],"concept.planetmath.finiteintersectionproperty":[{"id":"assertion.concept.planetmath.finiteintersectionproperty","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finite intersection property as stated in the captured PlanetMath entry finiteintersectionproperty","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D30) states: A collection 𝒜 = { A α } α ∈ I of subsets of a set X is said to have the finite intersection property , abbreviated f.i.p., if every finite subcollection { A 1 , A 2 , … , A n } of 𝒜 satisifes ⋂ i = 1 n A i ≠ ∅ .","support":[{"end":270,"quote":"A\ncollection\n𝒜\n=\n{\nA\nα\n}\nα\n∈\nI\nof subsets of a set\nX\nis said to have the\nfinite intersection property\n, abbreviated f.i.p., if every finite subcollection\n{\nA\n1\n,\nA\n2\n,\n…\n,\nA\nn\n}\nof\n𝒜\nsatisifes\n⋂\ni\n=\n1\nn\nA\ni\n≠\n∅\n.","source_id":"planetmath.finiteintersectionproperty","source_sha256":"df1201756f27c2e70bca33b42071f9643a7937b1ea805edff15c189d3bec20ce","start":58}],"target_id":"concept.planetmath.finiteintersectionproperty","target_kind":"node","target_sha256":"b5aeca550180645e402faf23aecadb25246526c41f613609747b95118bf9e6ae"}],"concept.planetmath.finitelygeneratedgroup":[{"id":"assertion.concept.planetmath.finitelygeneratedgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finitely generated group as stated in the captured PlanetMath entry finitelygeneratedgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: A finitely generated group is a group that has a finite generating set .","support":[{"end":122,"quote":"A\nfinitely generated group\nis a group that has a finite\ngenerating set\n.","source_id":"planetmath.finitelygeneratedgroup","source_sha256":"dca73394539d096cdfb801ddae743742729be99171c900705aa1ab83ec230071","start":50}],"target_id":"concept.planetmath.finitelygeneratedgroup","target_kind":"node","target_sha256":"332fe1c780bf8b2dc04118c50e8b4d8b38de9aea9b8b6d71e63eccd475611e50"}],"concept.planetmath.finitelygeneratedmodule":[{"id":"assertion.concept.planetmath.finitelygeneratedmodule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finitely generated module as stated in the captured PlanetMath entry finitelygeneratedmodule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D10) states: A module X over a ring R is said to be finitely generated if there is a finite subset Y of X such that Y spans X .","support":[{"end":166,"quote":"A module\nX\nover a ring\nR\nis said to be\nfinitely generated\nif there is a finite subset\nY\nof\nX\nsuch that\nY\nspans\nX\n.","source_id":"planetmath.finitelygeneratedmodule","source_sha256":"a7455dd591c69bb789d91d630acfbad481d56cffc8f6831b9fc6af8f2391ac41","start":52}],"target_id":"concept.planetmath.finitelygeneratedmodule","target_kind":"node","target_sha256":"62ee2a6bc0a70c8844612cf71bb92a0692dfb23e8e27fa6748ccc8f2779dc18e"}],"concept.planetmath.firstorderlanguage":[{"id":"assertion.concept.planetmath.firstorderlanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First order language as stated in the captured PlanetMath entry firstorderlanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let Σ be a signature . The first order language FO ⁡ ( Σ ) on Σ contains the following: 1.","support":[{"end":132,"quote":"Let\nΣ\nbe a\nsignature\n. The\nfirst order language\nFO\n⁡\n(\nΣ\n)\non\nΣ\ncontains the following:\n1.","source_id":"planetmath.firstorderlanguage","source_sha256":"fb15d0f0ac5eeaeb7f57bf3cc5e2e9af3f4404cd92288c9ac297912cb96227e5","start":42}],"target_id":"concept.planetmath.firstorderlanguage","target_kind":"node","target_sha256":"4cbccb7a5301ccdc25c4cf744799d84be133cd250f067c5e8f3c8192ecf12c35"}],"concept.planetmath.firstorderlogic":[{"id":"assertion.concept.planetmath.firstorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First order logic as stated in the captured PlanetMath entry firstorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: A logic is first order if it has exactly one type.","support":[{"end":86,"quote":"A logic is\nfirst order\nif it has exactly one type.","source_id":"planetmath.firstorderlogic","source_sha256":"e3ad498c6a49b7eb5aac7ca56e515b0166c822b91731ae5298c0b0d8a3eb4c54","start":36}],"target_id":"concept.planetmath.firstorderlogic","target_kind":"node","target_sha256":"de93a9be7a6285d4561ce7158a46f5a900137afc628c24860419a478088dcd41"}],"concept.planetmath.firstordertheory":[{"id":"assertion.concept.planetmath.firstordertheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First-order theory as stated in the captured PlanetMath entry firstordertheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In what follows, references to sentences and sets of sentences are all relative to some fixed first-order language L .","support":[{"end":156,"quote":"In what follows, references to\nsentences\nand sets of sentences are\nall relative to some fixed\nfirst-order language\nL\n.","source_id":"planetmath.firstordertheory","source_sha256":"d6898716a8213c993e1fcb0a85c67a42024ade8ec9f41718ac13edef1256938d","start":38}],"target_id":"concept.planetmath.firstordertheory","target_kind":"node","target_sha256":"bcdfb4b38a60e0d94d04d365236e9f63fd21897c7059c23e4a35335c15f8eab3"}],"concept.planetmath.fixedpointarithmetic":[{"id":"assertion.concept.planetmath.fixedpointarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fixed-point arithmetic as stated in the captured PlanetMath entry fixedpointarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A63) states: For computation or display in fixed-point arithmetic , each real number x has a variable number k > 0 of integer digits d k - 1 , … , d 0 (in order left to right from the most to the least significant digit) in base b but always l fractional digits to the right of the point.","support":[{"end":321,"quote":"For computation or display in\nfixed-point arithmetic\n, each\nreal number\nx\nhas a\nvariable\nnumber\nk\n>\n0\nof\ninteger\ndigits\nd\nk\n-\n1\n,\n…\n,\nd\n0\n(in order left to right from the most to the least significant digit) in base\nb\nbut always\nl\nfractional digits to the right of the point.","source_id":"planetmath.fixedpointarithmetic","source_sha256":"a86ef0d5114f9c699ac99b9ffebe6bdfd68861bdc18151d67e887e67dc0314f1","start":46}],"target_id":"concept.planetmath.fixedpointarithmetic","target_kind":"node","target_sha256":"630cbf3074f37cabb851931ca84679f88c8acd0817751a6144fc29a053fd7138"}],"concept.planetmath.fixedpointsofnormalfunctions":[{"id":"assertion.concept.planetmath.fixedpointsofnormalfunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fixed points of normal functions as stated in the captured PlanetMath entry fixedpointsofnormalfunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: If f : M → 𝐎𝐧 is a function from any set of ordinals to the class of ordinals then Fix ⁡ ( f ) = { x ∈ M ∣ f ⁢ ( x ) = x } is the set of fixed points of f .","support":[{"end":222,"quote":"If\nf\n:\nM\n→\n𝐎𝐧\nis a\nfunction\nfrom any set of\nordinals\nto the class of ordinals then\nFix\n⁡\n(\nf\n)\n=\n{\nx\n∈\nM\n∣\nf\n⁢\n(\nx\n)\n=\nx\n}\nis the set of\nfixed points\nof\nf\n.","source_id":"planetmath.fixedpointsofnormalfunctions","source_sha256":"47b73bfae01b15909d4508e523fc8e7a5bf9c3353d5c0b67ac07a4fa92c8d6c8","start":66}],"target_id":"concept.planetmath.fixedpointsofnormalfunctions","target_kind":"node","target_sha256":"fd33610726532689752444b927179070f468bc521bcd788e78f5b0e83e33b3e8"}],"concept.planetmath.fixtransformationaction":[{"id":"assertion.concept.planetmath.fixtransformationaction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fix (transformation action) as stated in the captured PlanetMath entry fixtransformationaction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","support":[{"end":115,"quote":"Let\nA\nbe a set, and\nT\n:\nA\n→\nA\na\ntransformation\nof that\nset.","source_id":"planetmath.fixtransformationaction","source_sha256":"d3cb2bdfb3013b0463b164b5c06959c441776c288287eb50fd9ea241626f7965","start":56}],"target_id":"concept.planetmath.fixtransformationaction","target_kind":"node","target_sha256":"6c886cfab169d9775f60c521554592580061ae2b635e6b1475dd8bab3b6fa062"}],"concept.planetmath.forcing":[{"id":"assertion.concept.planetmath.forcing","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Forcing as stated in the captured PlanetMath entry forcing","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E50, 03E35, 03E40) states: Forcing is the method used by Paul Cohen to prove the independence of the continuum hypothesis (CH).","support":[{"end":116,"quote":"Forcing\nis the method used by Paul Cohen to prove the independence of\nthe\ncontinuum hypothesis\n(CH).","source_id":"planetmath.forcing","source_sha256":"353ee6ad407003bddc1900353def0465ace3953bc68f2bb60ce71885d88126b8","start":16}],"target_id":"concept.planetmath.forcing","target_kind":"node","target_sha256":"c471d669e0508c067904c2c9a09795aa94c00b3be4986167fa7391491a9c3520"}],"concept.planetmath.formalgrammar":[{"id":"assertion.concept.planetmath.formalgrammar","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Formal grammar as stated in the captured PlanetMath entry formalgrammar","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 91F20, 68Q42, 68Q45, 03D05) states: Introduction A grammar , loosely speaking, is a set of rules that can be applied to words to generate sentences in a language .","support":[{"end":157,"quote":"Introduction\nA\ngrammar\n, loosely speaking, is a set of rules that can be applied to words to generate\nsentences\nin a\nlanguage\n.","source_id":"planetmath.formalgrammar","source_sha256":"567acce8c8c2db751f6838ad72336d49908d5faf948beeea78b20aa64df569a5","start":30}],"target_id":"concept.planetmath.formalgrammar","target_kind":"node","target_sha256":"7f9e5a4c277908b68f50e210ddd97adf765af162668d5c135123255b8c7b19df"}],"concept.planetmath.formalsystem":[{"id":"assertion.concept.planetmath.formalsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Formal system as stated in the captured PlanetMath entry formalsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B99) states: In mathematical logic, a formal system is a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","support":[{"end":165,"quote":"In mathematical logic, a\nformal system\nis a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","source_id":"planetmath.formalsystem","source_sha256":"e669654ecc1d2913232886b3609024c6912190a10fb14c6f434387130344395a","start":28}],"target_id":"concept.planetmath.formalsystem","target_kind":"node","target_sha256":"a89404e2e422d481822e2d1f2173aaed0b7458309782e2eeb0d5ae5a6120a296"}],"concept.planetmath.foundationsofmathematicsoverview":[{"id":"assertion.concept.planetmath.foundationsofmathematicsoverview","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Foundations of mathematics: overview as stated in the captured PlanetMath entry foundationsofmathematicsoverview","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05) states: The term ’ foundations of mathematics ’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","support":[{"end":244,"quote":"The term ’\nfoundations of mathematics\n’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","source_id":"planetmath.foundationsofmathematicsoverview","source_sha256":"54be6bc6974511fd7ca2fdbb9496c0c4fd101af6b44244debaa9af3aced1c3d1","start":74}],"target_id":"concept.planetmath.foundationsofmathematicsoverview","target_kind":"node","target_sha256":"0ee7645f846cf199f3b4e2919892002ba509ec94b068a58bee711cdb9a7c3113"}],"concept.planetmath.fraction":[{"id":"assertion.concept.planetmath.fraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fraction as stated in the captured PlanetMath entry fraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11-01) states: A fraction is a rational number expressed in the form n d or n / d , where n is designated the numerator and d the denominator .","support":[{"end":146,"quote":"A\nfraction\nis a\nrational number\nexpressed in the form\nn\nd\nor\nn\n/\nd\n, where\nn\nis designated the\nnumerator\nand\nd\nthe\ndenominator\n.","source_id":"planetmath.fraction","source_sha256":"aedeb38c7d47349becbcdfc4690c8d703253cec7370c694fb9b139a0c5a0acaf","start":18}],"target_id":"concept.planetmath.fraction","target_kind":"node","target_sha256":"b77fa4a02623029fd6ee0310bfc7efdd3f7aae70f47498e2bfdc8f127fa81925"}],"concept.planetmath.fractionalidealofcommutativering":[{"id":"assertion.concept.planetmath.fractionalidealofcommutativering","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fractional ideal of commutative ring as stated in the captured PlanetMath entry fractionalidealofcommutativering","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B30) states: Definition. Let R be a commutative ring having a regular element and let T be the total ring of fractions of R .","support":[{"end":186,"quote":"Definition.\nLet\nR\nbe a\ncommutative ring\nhaving a\nregular element\nand let\nT\nbe the\ntotal ring of fractions\nof\nR\n.","source_id":"planetmath.fractionalidealofcommutativering","source_sha256":"da94f25539c64564a7004b5277c8cab351772948cba139370823f9f84f11009c","start":74}],"target_id":"concept.planetmath.fractionalidealofcommutativering","target_kind":"node","target_sha256":"5ce7f45bc1134ce0a860b94af4cb5c101c994c4379120bf8609357b7aef89115"}],"concept.planetmath.framegroupoid":[{"id":"assertion.concept.planetmath.framegroupoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Frame groupoid as stated in the captured PlanetMath entry framegroupoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 18B40, 55U40) states: Definition 0.1 . Let 𝒢 be a groupoid , defined as usual by a category in which all morphisms are invertible , with the structure maps s , t : G 1 ⟶ G 0 , and u : G 0 ⟶ G 1 .","support":[{"end":203,"quote":"Definition 0.1\n.\nLet\n𝒢\nbe a\ngroupoid\n, defined as usual by a\ncategory\nin which all\nmorphisms\nare\ninvertible\n, with the\nstructure maps\ns\n,\nt\n:\nG\n1\n⟶\nG\n0\n, and\nu\n:\nG\n0\n⟶\nG\n1\n.","source_id":"planetmath.framegroupoid","source_sha256":"bcd32dc20dad1b2dd087020120e33557454559b015a82e81639cb8edcd2b3e9d","start":30}],"target_id":"concept.planetmath.framegroupoid","target_kind":"node","target_sha256":"cde6cd8a547d212d0ca5b440654e0b92fa9144f0df40296c949108842a96d8af"}],"concept.planetmath.freeandboundvariables":[{"id":"assertion.concept.planetmath.freeandboundvariables","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Free and bound variables as stated in the captured PlanetMath entry freeandboundvariables","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In the entry first-order language ( http://planetmath.org/TermsAndFormulas ), I have mentioned the use of variables without mentioning what variables really are.","support":[{"end":211,"quote":"In the entry\nfirst-order language\n(\nhttp://planetmath.org/TermsAndFormulas\n), I have mentioned the use of\nvariables\nwithout mentioning what variables really are.","source_id":"planetmath.freeandboundvariables","source_sha256":"6b208bdea2d2d3747dcbb29362a849843bbd451701ae5ce53419a24eaaa2a5d0","start":50}],"target_id":"concept.planetmath.freeandboundvariables","target_kind":"node","target_sha256":"777bd4c1af9dfa5fe6da22c4f0d014ae760be92bb17a7c62d4f076f1efc23b34"}],"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy":[{"id":"assertion.concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"From Hilbert’s tenth problem to Gödel’s trichotomy as stated in the captured PlanetMath entry fromhilbertstenthproblemtogodelstrichotomy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: From Hilbert’s tenth problem to Gödel’s trichotomy Contents: 1 Hilbert on the pursuit of knowledge 2 The two sources of mathematical knowledge 3 Hilbert’s epistemological optimism 4 Stricto sensu and conditional mathematics 5 The cumulative hierarchy 6 Diophantine equivalent of number theoretical statements 7 The incompleteness and consistency propositions 8 Sketch of a Gedankenexperiment 9 Gödel’s trichotomy 1 Hilbert on the pursuit of knowledge In the Summer of 1900 the Second International Congress of Mathematicians took place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","support":[{"end":768,"quote":"From Hilbert’s tenth problem to Gödel’s\ntrichotomy\nContents:\n1\nHilbert on the pursuit of knowledge\n2\nThe two sources of mathematical knowledge\n3\nHilbert’s epistemological optimism\n4\nStricto sensu\nand conditional mathematics\n5\nThe cumulative hierarchy\n6\nDiophantine equivalent of number theoretical statements\n7\nThe incompleteness and consistency propositions\n8\nSketch of a\nGedankenexperiment\n9\nGödel’s trichotomy\n1\nHilbert on the pursuit of knowledge\nIn the Summer of 1900 the\nSecond\nInternational Congress of Mathematicians\ntook place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","source_id":"planetmath.fromhilbertstenthproblemtogodelstrichotomy","source_sha256":"7f854e94132041bd5c6f4e329c77327ba4aa0167d818993b9911a34bad9039ae","start":102}],"target_id":"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","target_kind":"node","target_sha256":"43746c401a2c40270efae1c3021835a2edbba3e22af5c4b88c8629aafda85201"}],"concept.planetmath.functionalcompleteness":[{"id":"assertion.concept.planetmath.functionalcompleteness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Functional completeness as stated in the captured PlanetMath entry functionalcompleteness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Recall that in classical propositional logic , well-formed formulas (wffs) can be built up (recursively) from propositional variables via logical connectives .","support":[{"end":207,"quote":"Recall that in classical\npropositional logic\n,\nwell-formed formulas\n(wffs) can be built up (recursively) from\npropositional variables\nvia\nlogical connectives\n.","source_id":"planetmath.functionalcompleteness","source_sha256":"8f73f33fc7041b0710b241d1da8f9c87a891ce452b7f09c72be415840fc1c21c","start":48}],"target_id":"concept.planetmath.functionalcompleteness","target_kind":"node","target_sha256":"5676a92c09af1fdf3a35644ee1d5eb7edcf3d3d6c3305d3b78d7cc1affd98a31"}],"concept.planetmath.fuzzysubset":[{"id":"assertion.concept.planetmath.fuzzysubset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fuzzy subset as stated in the captured PlanetMath entry fuzzysubset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E72, 03G20) states: Fuzzy set theory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","support":[{"end":143,"quote":"Fuzzy set\ntheory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","source_id":"planetmath.fuzzysubset","source_sha256":"e9606435807e101a02cc2ee19b4f4ce77407d9cba935ae38a59df08a3e9dce18","start":26}],"target_id":"concept.planetmath.fuzzysubset","target_kind":"node","target_sha256":"fa2658bdceb4c6f060237031aac68b29f9726f0fc34a79d8f778e3c189086834"}],"concept.planetmath.gametheoreticalquantifier":[{"id":"assertion.concept.planetmath.gametheoreticalquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Game-theoretical quantifier as stated in the captured PlanetMath entry gametheoreticalquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: A Henkin or branching quantifier is a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","support":[{"end":225,"quote":"A\nHenkin\nor\nbranching\nquantifier\nis a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","source_id":"planetmath.gametheoreticalquantifier","source_sha256":"f273f5c751ad7eaf1ab282a41d0262ff103fe9db53e2490f0038875f7c610632","start":56}],"target_id":"concept.planetmath.gametheoreticalquantifier","target_kind":"node","target_sha256":"f1a29a3e5abdce057af39fdad8576a6b6b09076893c445d4fa046d778928dd93"}],"concept.planetmath.generalizedcartesianproduct":[{"id":"assertion.concept.planetmath.generalizedcartesianproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Generalized Cartesian product as stated in the captured PlanetMath entry generalizedcartesianproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Given any family of sets { A j } j ∈ J indexed by an index set J , the generalized Cartesian product ∏ j ∈ J A j is the set of all functions f : J → ⋃ j ∈ J A j such that f ⁢ ( j ) ∈ A j for all j ∈ J .","support":[{"end":262,"quote":"Given any family of sets\n{\nA\nj\n}\nj\n∈\nJ\nindexed by\nan\nindex set\nJ\n, the\ngeneralized Cartesian product\n∏\nj\n∈\nJ\nA\nj\nis the set of all\nfunctions\nf\n:\nJ\n→\n⋃\nj\n∈\nJ\nA\nj\nsuch that\nf\n⁢\n(\nj\n)\n∈\nA\nj\nfor all\nj\n∈\nJ\n.","source_id":"planetmath.generalizedcartesianproduct","source_sha256":"0b32aed9d1eea98d790e81d334536e385fb287950497febab68a5707de96dc17","start":60}],"target_id":"concept.planetmath.generalizedcartesianproduct","target_kind":"node","target_sha256":"3fd4f7b7ea700bf6c5223e1ea0c220d723ee604004829bcfb462dcc811c476ef"}],"concept.planetmath.generalizedquantifier":[{"id":"assertion.concept.planetmath.generalizedquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Generalized quantifier as stated in the captured PlanetMath entry generalizedquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C80, 03B15, 03B10) states: Generalized quantifiers are an abstract way of defining quantifiers .","support":[{"end":115,"quote":"Generalized quantifiers\nare an abstract way of defining\nquantifiers\n.","source_id":"planetmath.generalizedquantifier","source_sha256":"e59d3ed3215ffa7903b6359f3e25fbd934b6db66a076c4d7a87916bb1e2324a5","start":46}],"target_id":"concept.planetmath.generalizedquantifier","target_kind":"node","target_sha256":"f11aa1d4cc2f86c55dd6d27a8b499f1b7f14a040dd68128191fb23a9c1bee69a"}],"concept.planetmath.gentzensystem":[{"id":"assertion.concept.planetmath.gentzensystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Gentzen system as stated in the captured PlanetMath entry gentzensystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03F07, 03F03, 03B99, 03F05) states: Introduction A Gentzen system , attributed to the German logician Gerhard Gentzen, is a variant form of a deductive system .","support":[{"end":154,"quote":"Introduction\nA\nGentzen system\n, attributed to the German logician Gerhard Gentzen, is a variant form of a\ndeductive system\n.","source_id":"planetmath.gentzensystem","source_sha256":"ca1c25bea5e61216f2019f4e1a542089c634b90b7895a5619964be6b26b2f41b","start":30}],"target_id":"concept.planetmath.gentzensystem","target_kind":"node","target_sha256":"5f726b612fb7964385e5aaa2da369ba9562643bc30f6558c4df5ad62685dc320"}],"concept.planetmath.goldenratio":[{"id":"assertion.concept.planetmath.goldenratio","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Golden ratio as stated in the captured PlanetMath entry goldenratio","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 40A05, 11B39) states: The “ Golden Ratio ”, or ϕ , has the value 1.61803398874989484820 ⁢ … This number gets its rather illustrious name from the fact that the Greeks thought that a rectangle with ratio of side lengths equal to ϕ was the most pleasing to the eye, and much of classical Greek architecture is based on this premise .","support":[{"end":335,"quote":"The “\nGolden Ratio\n”, or\nϕ\n, has the value\n1.61803398874989484820\n⁢\n…\nThis number gets its rather illustrious name from the fact that the Greeks thought that a\nrectangle\nwith ratio of side lengths equal to\nϕ\nwas the most pleasing to the eye, and much of classical Greek architecture is based on this\npremise\n.","source_id":"planetmath.goldenratio","source_sha256":"bbae260e99b6e341ae7d7808d56abd02f9a196b29ef360f6fcfd68dbcfea5a67","start":26}],"target_id":"concept.planetmath.goldenratio","target_kind":"node","target_sha256":"9c5ea3db48d4b0c14134f7cdb44aa02585a2f9c741ee568c34f49219117593c3"}],"concept.planetmath.graphtheory":[{"id":"assertion.concept.planetmath.graphtheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Graph theory as stated in the captured PlanetMath entry graphtheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 81Q30, 18G30, 05C50, 55U10, 18-00, 05C25, 05C99) states: Graph theory is the branch of mathematics that concerns itself with graphs.","support":[{"end":101,"quote":"Graph theory\nis the branch of mathematics that concerns itself with graphs.","source_id":"planetmath.graphtheory","source_sha256":"a238ecdd3860bd0f92dc862f3a78b53b069f3339bcc59ce8b329f2ad5a7e7b9a","start":26}],"target_id":"concept.planetmath.graphtheory","target_kind":"node","target_sha256":"9139074c1e2a1bfe6dca19b48e14838ce0c8605dac72a91afdbf46cc184dde48"}],"concept.planetmath.groupaction":[{"id":"assertion.concept.planetmath.groupaction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group action as stated in the captured PlanetMath entry groupaction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16W22, 20M30) states: Let G be a group and let X be a set. A left group action is a function ⋅ : G × X ⟶ X such that: 1.","support":[{"end":124,"quote":"Let\nG\nbe a group and let\nX\nbe a set. A left\ngroup action\nis a\nfunction\n⋅\n:\nG\n×\nX\n⟶\nX\nsuch that:\n1.","source_id":"planetmath.groupaction","source_sha256":"f648b2428bf38344e45af8023bd5e4f4ecd06b721781057425b1e730ac94832a","start":26}],"target_id":"concept.planetmath.groupaction","target_kind":"node","target_sha256":"f54cd1a609c97533940eded13a32d7bed6ffe1916011fb8e69d9cf0792a4d92c"}],"concept.planetmath.groupcohomologytopologicaldefinition":[{"id":"assertion.concept.planetmath.groupcohomologytopologicaldefinition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group cohomology as stated in the captured PlanetMath entry groupcohomologytopologicaldefinition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N25) states: Let G be a topological group . Suppose some contractible space X admits a fixed point free action of G , so that the quotient map p : X → X / G is a fibre map .","support":[{"end":244,"quote":"Let\nG\nbe a\ntopological group\n. Suppose some contractible space\nX\nadmits a\nfixed point\nfree action\nof\nG\n, so that the\nquotient map\np\n:\nX\n→\nX\n/\nG\nis a\nfibre map\n.","source_id":"planetmath.groupcohomologytopologicaldefinition","source_sha256":"288f02c27c85d67b9cbb2d9a71fa92499cd6ab692e3e7ca9fe73f8d51f3fd55e","start":84}],"target_id":"concept.planetmath.groupcohomologytopologicaldefinition","target_kind":"node","target_sha256":"29c92286371fd90a259df12fba1c36750896bd754dd4e6baf9668347e5b24873"}],"concept.planetmath.grouphomomorphism":[{"id":"assertion.concept.planetmath.grouphomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group homomorphism as stated in the captured PlanetMath entry grouphomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Let ( G , ∗ ) and ( K , ⋆ ) be two groups. A group homomorphism is a function ϕ : G → K such that ϕ ⁢ ( s ∗ t ) = ϕ ⁢ ( s ) ⋆ ϕ ⁢ ( t ) for all s , t ∈ G .","support":[{"end":193,"quote":"Let\n(\nG\n,\n∗\n)\nand\n(\nK\n,\n⋆\n)\nbe two groups. A\ngroup homomorphism\nis a\nfunction\nϕ\n:\nG\n→\nK\nsuch that\nϕ\n⁢\n(\ns\n∗\nt\n)\n=\nϕ\n⁢\n(\ns\n)\n⋆\nϕ\n⁢\n(\nt\n)\nfor all\ns\n,\nt\n∈\nG\n.","source_id":"planetmath.grouphomomorphism","source_sha256":"c16b7c9435adce0d753087f14d4e456d87212c8eccec7478ba7e4069bf191e6b","start":38}],"target_id":"concept.planetmath.grouphomomorphism","target_kind":"node","target_sha256":"ac46af866594edc1b28cbe89b8f9898953631cd7eb858b2e3de496db9bfc1636"}],"concept.planetmath.groupoid":[{"id":"assertion.concept.planetmath.groupoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Groupoid as stated in the captured PlanetMath entry groupoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02) states: A groupoid G is a set together with a binary operation ⋅ : G × G ⟶ G .","support":[{"end":88,"quote":"A groupoid\nG\nis a set together with a\nbinary operation\n⋅\n:\nG\n×\nG\n⟶\nG\n.","source_id":"planetmath.groupoid","source_sha256":"d3335826a7785653a269813a5151119f2cefaf05692a1527322382135e3fd851","start":18}],"target_id":"concept.planetmath.groupoid","target_kind":"node","target_sha256":"34e129ce358ad8490f3b0cbf809050613ea0f3c62f1920def42c0ac87fd40263"}],"concept.planetmath.groupoidrepresentation":[{"id":"assertion.concept.planetmath.groupoidrepresentation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Groupoid representation as stated in the captured PlanetMath entry groupoidrepresentation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 55U40) states: Let q : E ⟶ M be a vector bundle , with E the total space , and M a smooth manifold.","support":[{"end":132,"quote":"Let\nq\n:\nE\n⟶\nM\nbe a\nvector bundle\n, with\nE\nthe\ntotal space\n, and\nM\na smooth manifold.","source_id":"planetmath.groupoidrepresentation","source_sha256":"8e8d8e1166d6ca6feb298dba27ae246f9589f95a58b5e6255256ed7db4a1e70f","start":48}],"target_id":"concept.planetmath.groupoidrepresentation","target_kind":"node","target_sha256":"45d3d8c63211b0236630b986e2c1c4c6daf5e6e301420c6cc99105ab89a1f948"}],"concept.planetmath.grouprepresentation":[{"id":"assertion.concept.planetmath.grouprepresentation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group representation as stated in the captured PlanetMath entry grouprepresentation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20C99) states: Let G be a group, and let V be a vector space . A representation of G in V is a group homomorphism ρ : G → GL ⁡ ( V ) from G to the general linear group GL ⁡ ( V ) of invertible linear transformations of V .","support":[{"end":249,"quote":"Let\nG\nbe a group, and let\nV\nbe a\nvector space\n. A\nrepresentation\nof\nG\nin\nV\nis a\ngroup homomorphism\nρ\n:\nG\n→\nGL\n⁡\n(\nV\n)\nfrom\nG\nto the\ngeneral linear group\nGL\n⁡\n(\nV\n)\nof\ninvertible linear transformations\nof\nV\n.","source_id":"planetmath.grouprepresentation","source_sha256":"efd4deb350686ab1b498f84ebba0ed9bc23a98b0e8bd535a57510af7b8b2cc1a","start":42}],"target_id":"concept.planetmath.grouprepresentation","target_kind":"node","target_sha256":"7f681a88d0c45945ae92c4699b0782ff8ed5e9c5f98b1df73f34c10439f6642b"}],"concept.planetmath.hartigsquantifier":[{"id":"assertion.concept.planetmath.hartigsquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Härtig’s quantifier as stated in the captured PlanetMath entry hartigsquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: Härtig’s quantifier is a quantifier which takes two variables and two formulas , written I ⁢ x ⁢ y ⁢ ϕ ⁢ ( x ) ⁢ ψ ⁢ ( y ) .","support":[{"end":164,"quote":"Härtig’s\nquantifier\nis a quantifier which takes two\nvariables\nand two\nformulas\n, written\nI\n⁢\nx\n⁢\ny\n⁢\nϕ\n⁢\n(\nx\n)\n⁢\nψ\n⁢\n(\ny\n)\n.","source_id":"planetmath.hartigsquantifier","source_sha256":"1682883e4724dede438204fa2a1f9616a4f3f8cdac3b708f2fe3de5925d2c709","start":40}],"target_id":"concept.planetmath.hartigsquantifier","target_kind":"node","target_sha256":"6134209f883c00620f5c5a7d353f3dfc48632fa76bab031b18ff4b856a921c15"}],"concept.planetmath.hausdorffspace":[{"id":"assertion.concept.planetmath.hausdorffspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff space as stated in the captured PlanetMath entry hausdorffspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: A topological space ( X , τ ) is said to be T 2 (or said to satisfy the T 2 axiom) if given distinct x , y ∈ X , there exist disjoint open sets U , V ∈ τ (that is, U ∩ V = ∅ ) such that x ∈ U and y ∈ V .","support":[{"end":235,"quote":"A\ntopological space\n(\nX\n,\nτ\n)\nis said to be\nT\n2\n(or said to\nsatisfy\nthe\nT\n2\naxiom) if given\ndistinct\nx\n,\ny\n∈\nX\n, there exist\ndisjoint\nopen sets\nU\n,\nV\n∈\nτ\n(that is,\nU\n∩\nV\n=\n∅\n)\nsuch that\nx\n∈\nU\nand\ny\n∈\nV\n.","source_id":"planetmath.hausdorffspace","source_sha256":"14022299a3f2a4b9a553acffd286cfe9ae824edd755df386245e91f52e5f0eb0","start":32}],"target_id":"concept.planetmath.hausdorffspace","target_kind":"node","target_sha256":"9ba1ff1abc6d9396cadc6307ba116b8f84fc8d754da144e56de780366d30b967"}],"concept.planetmath.hibehpapyrus":[{"id":"assertion.concept.planetmath.hibehpapyrus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hibeh Papyrus as stated in the captured PlanetMath entry hibehpapyrus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A20, 01A16, 01A15) states: The http://mathforum.org/kb/plaintext.jspa?messageID=5539288 Hibeh Papyrus was written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","support":[{"end":191,"quote":"The\nhttp://mathforum.org/kb/plaintext.jspa?messageID=5539288\nHibeh Papyrus\nwas written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","source_id":"planetmath.hibehpapyrus","source_sha256":"1be74e123e108320d5a470f87533099cb64399705a955c3bbd5e165494e46097","start":28}],"target_id":"concept.planetmath.hibehpapyrus","target_kind":"node","target_sha256":"56e0488a456dfb86c786b3993491def20f1af2d3a94938f38154df07d91aa8ff"}],"concept.planetmath.higherorderfunction":[{"id":"assertion.concept.planetmath.higherorderfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Higher-order function as stated in the captured PlanetMath entry higherorderfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q01) states: Any function that maps a function to anything or maps anything to a function is a higher-order function .","support":[{"end":149,"quote":"Any\nfunction\nthat maps a function to anything or maps anything to a function is a\nhigher-order function\n.","source_id":"planetmath.higherorderfunction","source_sha256":"cfa6f186c26ab0a163017a2fb7909daaaec48389f5dc03ceb57a9f9fc4d1b0bd","start":44}],"target_id":"concept.planetmath.higherorderfunction","target_kind":"node","target_sha256":"56f5d216d912dcb0f5232f5afe13c463c03fd36231b8336d6f403e1c8828e42d"}],"concept.planetmath.hilbertsystem":[{"id":"assertion.concept.planetmath.hilbertsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hilbert system as stated in the captured PlanetMath entry hilbertsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: A Hilbert system is a style (formulation) of deductive system that emphasizes the role played by the axioms in the system.","support":[{"end":152,"quote":"A\nHilbert system\nis a style (formulation) of\ndeductive system\nthat emphasizes the role played by the axioms in the system.","source_id":"planetmath.hilbertsystem","source_sha256":"38d3d28ba18de2eb213e200a6b8b08f4c7d85069b7675d573d83cd81a2502914","start":30}],"target_id":"concept.planetmath.hilbertsystem","target_kind":"node","target_sha256":"ec2bacfac25ef6db53db3ec16db2e495e80522bfd56a70faaf75ff923221f29c"}],"concept.planetmath.homeomorphism":[{"id":"assertion.concept.planetmath.homeomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homeomorphism as stated in the captured PlanetMath entry homeomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54C05) states: A homeomorphism f of topological spaces is a continuous , bijective map such that f - 1 is also continuous.","support":[{"end":135,"quote":"A\nhomeomorphism\nf\nof\ntopological spaces\nis a\ncontinuous\n,\nbijective\nmap such that\nf\n-\n1\nis also continuous.","source_id":"planetmath.homeomorphism","source_sha256":"022069f35dd6ff33f808e924ba9e618b54f132c346d90f8226eae42064c7fe8a","start":28}],"target_id":"concept.planetmath.homeomorphism","target_kind":"node","target_sha256":"a16f5b416a7f1c9e8feb5b5837b54bd3d78789f36ac5ba4e5e461e3b34a908a4"}],"concept.planetmath.homogeneous":[{"id":"assertion.concept.planetmath.homogeneous","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homogeneous as stated in the captured PlanetMath entry homogeneous","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C50) states: Let L be a first order language . Let M be an L - structure .","support":[{"end":85,"quote":"Let\nL\nbe a\nfirst order language\n. Let\nM\nbe an\nL\n-\nstructure\n.","source_id":"planetmath.homogeneous","source_sha256":"e27c99cd3012f99971913fbb7cdba74b469f7bada252785fbfd2ab0c145b1d69","start":24}],"target_id":"concept.planetmath.homogeneous","target_kind":"node","target_sha256":"38e1cb526c06844b99311093d5a333d00765f7ec42ec9babfa3b1b89ab1cc9d9"}],"concept.planetmath.homology":[{"id":"assertion.concept.planetmath.homology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homology as stated in the captured PlanetMath entry homology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N10) states: Homology is the general name for a number of functors from topological spaces to abelian groups (or more generally modules over a fixed ring).","support":[{"end":160,"quote":"Homology\nis the general name for a number of\nfunctors\nfrom\ntopological spaces\nto\nabelian groups\n(or more generally modules over a fixed ring).","source_id":"planetmath.homology","source_sha256":"fbbaa3a2d6c50d81d13f9f714f8795f0272ba38d80d4f5ca2dc160298aafa5fc","start":18}],"target_id":"concept.planetmath.homology","target_kind":"node","target_sha256":"b31585b60bf45f12ddd2a16dc51221e165e087979db7236dff72efe775e62c06"}],"concept.planetmath.homomorphismbetweenalgebraicsystems":[{"id":"assertion.concept.planetmath.homomorphismbetweenalgebraicsystems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism between algebraic systems as stated in the captured PlanetMath entry homomorphismbetweenalgebraicsystems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A05) states: Let ( A , O ) , ( B , O ) be two algebraic systems with operator set O .","support":[{"end":150,"quote":"Let\n(\nA\n,\nO\n)\n,\n(\nB\n,\nO\n)\nbe two\nalgebraic systems\nwith operator set\nO\n.","source_id":"planetmath.homomorphismbetweenalgebraicsystems","source_sha256":"62fcd318ada9c98b4957235694178ab283d7765ef856fc8bb91f5f06e43e93b0","start":78}],"target_id":"concept.planetmath.homomorphismbetweenalgebraicsystems","target_kind":"node","target_sha256":"0809653a28d4fac908d47b079c80a29298a5edb376dc1085fedfad49053fd035"}],"concept.planetmath.homomorphismbetweenpartialalgebras":[{"id":"assertion.concept.planetmath.homomorphismbetweenpartialalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism between partial algebras as stated in the captured PlanetMath entry homomorphismbetweenpartialalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition Like subalgebras of partial algebras , there are also three ways to define homomorphisms between partial algebras .","support":[{"end":202,"quote":"Definition\nLike\nsubalgebras of partial algebras\n, there are also three ways to define\nhomomorphisms between partial algebras\n.","source_id":"planetmath.homomorphismbetweenpartialalgebras","source_sha256":"7853e396ff3c78fb41d414ed2d5a4dfd53cff4da95676dbe1dfa78e0fd66ed62","start":76}],"target_id":"concept.planetmath.homomorphismbetweenpartialalgebras","target_kind":"node","target_sha256":"9ec960b2ce0dce68967ab00ffce6f036e6fe1c7f3b543f8203bf21482fabb14a"}],"concept.planetmath.homomorphismoflanguages":[{"id":"assertion.concept.planetmath.homomorphismoflanguages","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism of languages as stated in the captured PlanetMath entry homomorphismoflanguages","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45) states: Let Σ 1 and Σ 2 be two alphabets . A function h : Σ 1 * → Σ 2 * is called a homomorphism if it is a semigroup homomorphism from semigroups Σ 1 * to Σ 2 * .","support":[{"end":207,"quote":"Let\nΣ\n1\nand\nΣ\n2\nbe two\nalphabets\n. A\nfunction\nh\n:\nΣ\n1\n*\n→\nΣ\n2\n*\nis called a\nhomomorphism\nif it is a\nsemigroup homomorphism\nfrom\nsemigroups\nΣ\n1\n*\nto\nΣ\n2\n*\n.","source_id":"planetmath.homomorphismoflanguages","source_sha256":"c663db49300c40a3a2ec8264d9d12101a140ebe65d3bc03e87b43a7e73aa5751","start":52}],"target_id":"concept.planetmath.homomorphismoflanguages","target_kind":"node","target_sha256":"60473bab92f96d3596b44cf57bbb0d40a0919a8b99b6aff9cc754d8f86d83dfb"}],"concept.planetmath.hyperconnectedspace":[{"id":"assertion.concept.planetmath.hyperconnectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hyperconnected space as stated in the captured PlanetMath entry hyperconnectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be hyperconnected if no pair of nonempty open sets of X is disjoint (or, equivalently, if X is not the union of two proper closed sets ).","support":[{"end":212,"quote":"A\ntopological space\nX\nis said to be\nhyperconnected\nif no pair of nonempty\nopen sets\nof\nX\nis\ndisjoint\n(or, equivalently, if\nX\nis not the union of two proper\nclosed sets\n).","source_id":"planetmath.hyperconnectedspace","source_sha256":"a2997f7ba133294f79a067ae8ea1452156de174202b135d80c2166babf0538d0","start":42}],"target_id":"concept.planetmath.hyperconnectedspace","target_kind":"node","target_sha256":"c0cb3c0c939dac5e90929f18954a318bd285f2c51b404a0375716bf2b96c48ee"}],"concept.planetmath.hypergroup":[{"id":"assertion.concept.planetmath.hypergroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hypergroup as stated in the captured PlanetMath entry hypergroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N20) states: Hypergroups are generalizations of groups. Recall that a group is set with a binary operation on it satisfying a number of conditions.","support":[{"end":156,"quote":"Hypergroups\nare\ngeneralizations\nof groups. Recall that a group is set with a\nbinary operation\non it satisfying a number of conditions.","source_id":"planetmath.hypergroup","source_sha256":"fc9817b1f3655ed1b75b1decf0fde2cfa2e8f7ca344bc44c2d1c53bc3df902ff","start":22}],"target_id":"concept.planetmath.hypergroup","target_kind":"node","target_sha256":"7d6a60ef5425c45e53e42ff8b79ccec2352a015df8e3cc1eb16ea4c71a87f0ae"}],"concept.planetmath.hypostaticabstraction":[{"id":"assertion.concept.planetmath.hypostaticabstraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hypostatic abstraction as stated in the captured PlanetMath entry hypostaticabstraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B42, 03B30, 03B22, 03B15, 03A05, 00A30) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase contain \\PMlinkescapephrase Contain \\PMlinkescapephrase contains \\PMlinkescapephrase Contains \\PMlinkescapephrase occur \\PMlinkescapephrase occurs \\PMlinkescapephrase occur in \\PMlinkescapephrase occur ins \\PMlinkescapephrase occurs in \\PMlinkescapephrase occurs ins \\PMlinkescapephrase trace \\PMlinkescapephrase Trace \\PMlinkescapephrase variety \\PMlinkescapephrase Variety Hypostatic abstraction is a formal operation that takes an element of information, as expressed in a proposition X ⁢ is ⁡ Y , and conceives its information to consist in the relation between that subject and another subject, as expressed in the proposition X ⁢ has ⁡ Y ⁢ - ness .","support":[{"end":776,"quote":"\\PMlinkescapephrase\nadapted\n\\PMlinkescapephrase\nAdapted\n\\PMlinkescapephrase\ncontain\n\\PMlinkescapephrase\nContain\n\\PMlinkescapephrase\ncontains\n\\PMlinkescapephrase\nContains\n\\PMlinkescapephrase\noccur\n\\PMlinkescapephrase\noccurs\n\\PMlinkescapephrase\noccur in\n\\PMlinkescapephrase\noccur ins\n\\PMlinkescapephrase\noccurs in\n\\PMlinkescapephrase\noccurs ins\n\\PMlinkescapephrase\ntrace\n\\PMlinkescapephrase\nTrace\n\\PMlinkescapephrase\nvariety\n\\PMlinkescapephrase\nVariety\nHypostatic abstraction\nis a formal\noperation\nthat takes an element of information, as expressed in a\nproposition\nX\n⁢\nis\n⁡\nY\n,\nand conceives its information to consist in the\nrelation\nbetween that subject and another subject, as expressed in the proposition\nX\n⁢\nhas\n⁡\nY\n⁢\n-\nness\n.","source_id":"planetmath.hypostaticabstraction","source_sha256":"00c7fdb1f11b14fb1fa97d1033ec8cebd942bd459fb7fa3f791ddae1a5bcbbde","start":46}],"target_id":"concept.planetmath.hypostaticabstraction","target_kind":"node","target_sha256":"a4a90c266a1dc06550598d532f2f754228c5600f96b9a4927cc579ed21011ce3"}],"concept.planetmath.ideal1":[{"id":"assertion.concept.planetmath.ideal1","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ideal as stated in the captured PlanetMath entry ideal1","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M12, 20M10) states: Let S be a semigroup . An ideal of S is a non-empty subset of S which is closed under multiplication on either side by elements of S .","support":[{"end":146,"quote":"Let\nS\nbe a\nsemigroup\n. An\nideal\nof\nS\nis a non-empty subset of\nS\nwhich is\nclosed under\nmultiplication\non either side by elements of\nS\n.","source_id":"planetmath.ideal1","source_sha256":"af4f55ad8c1d8c11486e871233c91df5a4ba01c473b42b9b05afbdfd793dd899","start":12}],"target_id":"concept.planetmath.ideal1","target_kind":"node","target_sha256":"82dd111cb1e05cd051b87ed12586567e774ac192d6dd2a7bfe3c6bc08b572391"}],"concept.planetmath.idealgeneratedbyasubsetofaring":[{"id":"assertion.concept.planetmath.idealgeneratedbyasubsetofaring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ideal generated by a subset of a ring as stated in the captured PlanetMath entry idealgeneratedbyasubsetofaring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D25) states: Let X be a subset of a ring R . Let S = { I k } be the collection of all left ideals of R that contain X (note that the set is nonempty since X ⊂ R and R is an ideal in itself).","support":[{"end":253,"quote":"Let\nX\nbe a subset of a ring\nR\n. Let\nS\n=\n{\nI\nk\n}\nbe the collection of all\nleft ideals\nof\nR\nthat contain\nX\n(note that the set is nonempty since\nX\n⊂\nR\nand\nR\nis an ideal in itself).","source_id":"planetmath.idealgeneratedbyasubsetofaring","source_sha256":"bbf5ac272cc255226426c5cb44c719c27a0711446a5b43c6c4760f4776a4cbb6","start":76}],"target_id":"concept.planetmath.idealgeneratedbyasubsetofaring","target_kind":"node","target_sha256":"8219a116382d1419539df753f5ba9889054aea8aa3f957c6c7390df119809e51"}],"concept.planetmath.idempotency":[{"id":"assertion.concept.planetmath.idempotency","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Idempotency as stated in the captured PlanetMath entry idempotency","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02) states: If ( S , * ) is a magma, then an element x ∈ S is said to be idempotent if x * x = x .","support":[{"end":110,"quote":"If\n(\nS\n,\n*\n)\nis a magma, then an\nelement\nx\n∈\nS\nis said to be\nidempotent\nif\nx\n*\nx\n=\nx\n.","source_id":"planetmath.idempotency","source_sha256":"c3c56bdc0c0c110b6220edaccabd677ef803aff04f5b541b0c9852739340f778","start":24}],"target_id":"concept.planetmath.idempotency","target_kind":"node","target_sha256":"483ac74895bd9c25bfa3686360d037e9be76202d33485c17b3f2fb2f6df65fe5"}],"concept.planetmath.idempotent":[{"id":"assertion.concept.planetmath.idempotent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Idempotent as stated in the captured PlanetMath entry idempotent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16U99, 20M99) states: An element x of a ring is called an idempotent element , or simply an idempotent if x 2 = x .","support":[{"end":115,"quote":"An element\nx\nof a ring is called an\nidempotent element\n, or simply an\nidempotent\nif\nx\n2\n=\nx\n.","source_id":"planetmath.idempotent","source_sha256":"21c0f4d4edcc42abb2cd2847c84566448d519e98b53aa5e97a497c2b7bd634c9","start":22}],"target_id":"concept.planetmath.idempotent","target_kind":"node","target_sha256":"71a154e55b1f7e1f82db61e99a16b6044418c8d4e4fca6a97e71e9af52b70c1e"}],"concept.planetmath.identityelement":[{"id":"assertion.concept.planetmath.identityelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity element as stated in the captured PlanetMath entry identityelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05, 20N02, 20N05, 20M99) states: Let G be a groupoid , that is a set with a binary operation G × G → G , written muliplicatively so that ( x , y ) ↦ x ⁢ y .","support":[{"end":157,"quote":"Let\nG\nbe a\ngroupoid\n, that is a set with a\nbinary operation\nG\n×\nG\n→\nG\n, written muliplicatively so that\n(\nx\n,\ny\n)\n↦\nx\n⁢\ny\n.","source_id":"planetmath.identityelement","source_sha256":"ab56a5d40d40c46060ce449987221c6973c0bcdb6aa31dd9318d92799e9e9e39","start":34}],"target_id":"concept.planetmath.identityelement","target_kind":"node","target_sha256":"5f8aa9cfb3e91dee3043788eb0acf79e7a855716f055933e18e65ca6c373e0d9"}],"concept.planetmath.identityinaclass":[{"id":"assertion.concept.planetmath.identityinaclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity in a class as stated in the captured PlanetMath entry identityinaclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08B99) states: Let K be a class of algebraic systems of the same type.","support":[{"end":95,"quote":"Let\nK\nbe a class of\nalgebraic systems\nof the same type.","source_id":"planetmath.identityinaclass","source_sha256":"03a47112e4d86d4c5fb46d73baabea07f656f99fa49e872297a23cea9b93309e","start":40}],"target_id":"concept.planetmath.identityinaclass","target_kind":"node","target_sha256":"42402b3d99707f61a538eb65fd167b0962d394b0f87d49a037479252560910a6"}],"concept.planetmath.identitymap":[{"id":"assertion.concept.planetmath.identitymap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity map as stated in the captured PlanetMath entry identitymap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition If X is a set, then the identity map in X is the mapping that maps each element in X to itself.","support":[{"end":132,"quote":"Definition\nIf\nX\nis a set, then the\nidentity map\nin\nX\nis the mapping\nthat maps each element in\nX\nto itself.","source_id":"planetmath.identitymap","source_sha256":"4d2f9aa446f80223d89d65e919b9b64cdcb5250faa82a656c356b63a720c9573","start":26}],"target_id":"concept.planetmath.identitymap","target_kind":"node","target_sha256":"4cc0d4240ad33c1c259dfec6b1da1aadefb4a9f154097ce136dbb2cd1cdd30c4"}],"concept.planetmath.identitymatrix":[{"id":"assertion.concept.planetmath.identitymatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity matrix as stated in the captured PlanetMath entry identitymatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-01, 15A57) states: The n × n identity matrix I (or I n ) over a ring R (with an identity 1) is the square matrix with coefficients in R given by I = [ 1 0 ⋯ 0 0 1 ⋯ 0 0 0 ⋱ 0 0 0 ⋯ 1 ] , where the numeral “1” and “0” respectively represent the multiplicative and additive identities in R .","support":[{"end":302,"quote":"The\nn\n×\nn\nidentity matrix\nI\n(or\nI\nn\n) over a ring\nR\n(with an\nidentity\n1) is the\nsquare matrix\nwith coefficients in\nR\ngiven by\nI\n=\n[\n1\n0\n⋯\n0\n0\n1\n⋯\n0\n0\n0\n⋱\n0\n0\n0\n⋯\n1\n]\n,\nwhere the numeral “1” and “0” respectively represent the multiplicative and\nadditive identities\nin\nR\n.","source_id":"planetmath.identitymatrix","source_sha256":"466f889ae801b8afcf0f38d48b96c38cdeec7f7a4cb5412fab779bf20d65e862","start":32}],"target_id":"concept.planetmath.identitymatrix","target_kind":"node","target_sha256":"b2f189f3876dd83e906bc6ab776193bf367675c9382ff5df9e9194749d5ce6dc"}],"concept.planetmath.imaginaries":[{"id":"assertion.concept.planetmath.imaginaries","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Imaginaries as stated in the captured PlanetMath entry imaginaries","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C95, 03C68) states: Given an algebraic structure S to investigate, mathematicians consider substructures , restrictions of the structure , quotient structures and the like.","support":[{"end":176,"quote":"Given an\nalgebraic structure\nS\nto investigate, mathematicians consider\nsubstructures\n,\nrestrictions\nof the\nstructure\n,\nquotient structures\nand the like.","source_id":"planetmath.imaginaries","source_sha256":"8afcc87c77619d2c2b8c5650b12ae098270bc92ed529d20c0db0ff878698725d","start":24}],"target_id":"concept.planetmath.imaginaries","target_kind":"node","target_sha256":"0748fc801dda3777078568ccd7945f613db8b043bf2c6746d49d25f04f82e980"}],"concept.planetmath.inaccessiblecardinal":[{"id":"assertion.concept.planetmath.inaccessiblecardinal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inaccessible cardinal as stated in the captured PlanetMath entry inaccessiblecardinal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E55) states: A limit cardinal κ is a strong limit cardinal if for any λ < κ , 2 λ < κ .","support":[{"end":118,"quote":"A\nlimit cardinal\nκ\nis a\nstrong limit cardinal\nif for any\nλ\n<\nκ\n,\n2\nλ\n<\nκ\n.","source_id":"planetmath.inaccessiblecardinal","source_sha256":"9c0204de9842fe854e7de2f4c15cd328efbd8af6954fa300f850d3e3bcdaac24","start":44}],"target_id":"concept.planetmath.inaccessiblecardinal","target_kind":"node","target_sha256":"883ea9d1215ea2f58e6d1e50924cab68ff9e979d0c95f4cb93239d4919474864"}],"concept.planetmath.incidencegeometry":[{"id":"assertion.concept.planetmath.incidencegeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Incidence geometry as stated in the captured PlanetMath entry incidencegeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: Incidence geometry is essentially geometry based on the first postulate in Euclid’s The Elements .","support":[{"end":136,"quote":"Incidence geometry\nis essentially\ngeometry\nbased on the first\npostulate\nin Euclid’s\nThe\nElements\n.","source_id":"planetmath.incidencegeometry","source_sha256":"bd356ed5e9d77c3eebaa44f3bd426e7942738fa68db0079e5f39316811b9d4d2","start":38}],"target_id":"concept.planetmath.incidencegeometry","target_kind":"node","target_sha256":"fa7724ca4783cf399b32ac1c73f32a288712c748f682feaef713f6ba84f87097"}],"concept.planetmath.incidencestructure":[{"id":"assertion.concept.planetmath.incidencestructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Incidence structure as stated in the captured PlanetMath entry incidencestructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 62K10, 51E30, 51E05, 05B25, 05B07, 05B05) states: Definition . An incidence structure 𝒮 is a triple ( 𝒫 , ℬ , ℐ ) , where 1.","support":[{"end":114,"quote":"Definition\n. An\nincidence structure\n𝒮\nis a triple\n(\n𝒫\n,\nℬ\n,\nℐ\n)\n, where\n1.","source_id":"planetmath.incidencestructure","source_sha256":"a420de23c3d2783733ab54e58eae83caefd9df3f83c527c8daeea8384e643808","start":40}],"target_id":"concept.planetmath.incidencestructure","target_kind":"node","target_sha256":"09ea95f35f3c2494b4de4c0eef425425f8d1a1a064b1c3f7df1643d2d130e4a6"}],"concept.planetmath.inclusionmapping":[{"id":"assertion.concept.planetmath.inclusionmapping","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inclusion mapping as stated in the captured PlanetMath entry inclusionmapping","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let X be a subset of Y . Then the inclusion map from X to Y is the mapping ι : X → Y x ↦ x .","support":[{"end":139,"quote":"Definition\nLet\nX\nbe a subset of\nY\n. Then the\ninclusion map\nfrom\nX\nto\nY\nis the\nmapping\nι\n:\nX\n→\nY\nx\n↦\nx\n.","source_id":"planetmath.inclusionmapping","source_sha256":"fe5d3e440d8a30da8255d8960214b80f287b85ac35c1154329d0a22c67665e17","start":36}],"target_id":"concept.planetmath.inclusionmapping","target_kind":"node","target_sha256":"0866cd90a226f0bc14a2cf1b098dd2881b5d510ab2db67908a54e1d15c967a1e"}],"concept.planetmath.indexingset":[{"id":"assertion.concept.planetmath.indexingset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Indexing set as stated in the captured PlanetMath entry indexingset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Let Λ and S be sets such that there exists a surjection f : Λ → S .","support":[{"end":93,"quote":"Let\nΛ\nand\nS\nbe sets such that there exists a\nsurjection\nf\n:\nΛ\n→\nS\n.","source_id":"planetmath.indexingset","source_sha256":"9c89437ed3ef36a9eb7a9321fa418e7ab6b532ebcfcc251517a8add3150556b4","start":26}],"target_id":"concept.planetmath.indexingset","target_kind":"node","target_sha256":"d40ea100d2fc0e62e9738ae64e068c945cf43a78589be9b3f4022f7fd975ffdb"}],"concept.planetmath.indexset":[{"id":"assertion.concept.planetmath.indexset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Index set as stated in the captured PlanetMath entry indexset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D25) states: In computability theory, a set A ⊆ ω is called an index set if for all x , y , x ∈ A , φ x = φ y ⟹ y ∈ A .","support":[{"end":126,"quote":"In computability theory, a set\nA\n⊆\nω\nis called an\nindex set\nif for all\nx\n,\ny\n,\nx\n∈\nA\n,\nφ\nx\n=\nφ\ny\n⟹\ny\n∈\nA\n.","source_id":"planetmath.indexset","source_sha256":"1ad7cc85cbee3f6cdb0e097fb901865679a0d8dd5ed2e95883d304ec71fc06b5","start":20}],"target_id":"concept.planetmath.indexset","target_kind":"node","target_sha256":"5865b4fe7beda7faebe14504372f03a6fee3a236bbfbbfeb9e549ab3d04e6df0"}],"concept.planetmath.indiscretetopology":[{"id":"assertion.concept.planetmath.indiscretetopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Indiscrete topology as stated in the captured PlanetMath entry indiscretetopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: If X is a set and it is endowed with a topology defined by τ = { X , ∅ } then X is said to have the indiscrete topology .","support":[{"end":161,"quote":"If\nX\nis a set and it is endowed with a\ntopology\ndefined by\nτ\n=\n{\nX\n,\n∅\n}\nthen\nX\nis said to have the\nindiscrete topology\n.","source_id":"planetmath.indiscretetopology","source_sha256":"184ed137c35d14b7bb22775e1454130695f976b0ada6ac484a69b8684251ac00","start":40}],"target_id":"concept.planetmath.indiscretetopology","target_kind":"node","target_sha256":"0541d18bdd5a66edee372d24cf6ef94afbc2041c1e3b8a14a08571a9981387fb"}],"concept.planetmath.inductionaxiom":[{"id":"assertion.concept.planetmath.inductionaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Induction axiom as stated in the captured PlanetMath entry inductionaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: An induction axiom specifies that a theory includes induction , possibly restricted to specific formulas .","support":[{"end":138,"quote":"An\ninduction axiom\nspecifies that a theory includes\ninduction\n, possibly restricted to specific\nformulas\n.","source_id":"planetmath.inductionaxiom","source_sha256":"12758f5c9d2ffe1a61447b74fab92af75ec00ceea5574083db120d3668c2ffa5","start":32}],"target_id":"concept.planetmath.inductionaxiom","target_kind":"node","target_sha256":"1613431cc2e7624d653571dc8f4f84daef4059a1214d08ddeb00365035c2f797"}],"concept.planetmath.inductiveset":[{"id":"assertion.concept.planetmath.inductiveset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inductive set as stated in the captured PlanetMath entry inductiveset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 45D05) states: An inductive set is a set X with the property that, for every x ∈ X , the successor x ′ of x is also an element of X .","support":[{"end":146,"quote":"An\ninductive set\nis a set\nX\nwith the\nproperty\nthat, for every\nx\n∈\nX\n, the\nsuccessor\nx\n′\nof\nx\nis also an element of\nX\n.","source_id":"planetmath.inductiveset","source_sha256":"603735a139e8828b5cf2392fffd1bee5c57fcbe722b2c7ba2e8d826e03ecbb29","start":28}],"target_id":"concept.planetmath.inductiveset","target_kind":"node","target_sha256":"215f482102e13e20fd69e9f541ae7208724f5ed12783da9939396303c7fd6e8d"}],"concept.planetmath.inferencerule":[{"id":"assertion.concept.planetmath.inferencerule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inference rule as stated in the captured PlanetMath entry inferencerule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B35, 03B22, 03B05) states: In logic, an inference rule is a rule whereby one may correctly draw a conclusion from one or more premises .","support":[{"end":139,"quote":"In logic, an\ninference rule\nis a rule whereby one may correctly\ndraw a\nconclusion\nfrom one or more\npremises\n.","source_id":"planetmath.inferencerule","source_sha256":"e809e4bc925c1f6b9d5655a640102c0e36ddaf84bba7caf691327512469db76a","start":30}],"target_id":"concept.planetmath.inferencerule","target_kind":"node","target_sha256":"74cbcd43892e48d1fcbaf58d03fa31d0cfee9914aad43499eaece3fbb6c0a87b"}],"concept.planetmath.infinitesimal":[{"id":"assertion.concept.planetmath.infinitesimal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Infinitesimal as stated in the captured PlanetMath entry infinitesimal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03H05, 06F25, 03C64) states: Let R be a real closed field, for example the reals thought of as a structure in L , the language of ordered rings .","support":[{"end":144,"quote":"Let\nR\nbe a real closed field, for example the reals thought of as a\nstructure\nin\nL\n, the\nlanguage\nof\nordered rings\n.","source_id":"planetmath.infinitesimal","source_sha256":"d94fa689376b89a540361c80b9c75af869ff2a7646edd03d14ad2a9086c87b4e","start":28}],"target_id":"concept.planetmath.infinitesimal","target_kind":"node","target_sha256":"0cf30bc0ee92757c05ec4b3ed8ef15fd7f942a745283f5e3693cfdb838d0b907"}],"concept.planetmath.infixnotation":[{"id":"assertion.concept.planetmath.infixnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Infix notation as stated in the captured PlanetMath entry infixnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: Infix notation is how we usually read and write arithmetic expressions .","support":[{"end":102,"quote":"Infix notation\nis how we usually read and write\narithmetic\nexpressions\n.","source_id":"planetmath.infixnotation","source_sha256":"76e83418383a7e117cfe5a7785106ecee7000f8b737edd6f4fb23f3a4f0a7786","start":30}],"target_id":"concept.planetmath.infixnotation","target_kind":"node","target_sha256":"07d53c030f81aa463bb921ac5d15395751a5d6de182d3383368340432899b29e"}],"concept.planetmath.initialtopology":[{"id":"assertion.concept.planetmath.initialtopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Initial topology as stated in the captured PlanetMath entry initialtopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B99) states: Let X i , i ∈ I be any family of topological spaces .","support":[{"end":87,"quote":"Let\nX\ni\n,\ni\n∈\nI\nbe any family of\ntopological spaces\n.","source_id":"planetmath.initialtopology","source_sha256":"28d75d2c1f00ab0a76c319d1ef00cfcabe7c770839b898d382697ae4c648fb60","start":34}],"target_id":"concept.planetmath.initialtopology","target_kind":"node","target_sha256":"722b4ac0eff41b38e28869e832a7cd895b06090af49fc8686b5d0fd56f779acb"}],"concept.planetmath.injectivefunction":[{"id":"assertion.concept.planetmath.injectivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Injective function as stated in the captured PlanetMath entry injectivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 03E99) states: We say that a function f : A → B is injective or one-to-one if f ⁢ ( x ) = f ⁢ ( y ) implies x = y , or equivalently, whenever x ≠ y , then f ⁢ ( x ) ≠ f ⁢ ( y ) .","support":[{"end":201,"quote":"We say that a\nfunction\nf\n:\nA\n→\nB\nis\ninjective\nor\none-to-one\nif\nf\n⁢\n(\nx\n)\n=\nf\n⁢\n(\ny\n)\nimplies\nx\n=\ny\n, or equivalently, whenever\nx\n≠\ny\n, then\nf\n⁢\n(\nx\n)\n≠\nf\n⁢\n(\ny\n)\n.","source_id":"planetmath.injectivefunction","source_sha256":"eb38a972ea11446a0207ea3ed349761f5263cf67a5e3492b495f01b84703f671","start":38}],"target_id":"concept.planetmath.injectivefunction","target_kind":"node","target_sha256":"4e05d6584fca45ca16d2e11b1ad0d34dfef08d55347b6b689c54e5fd9651cf8d"}],"concept.planetmath.innerproduct":[{"id":"assertion.concept.planetmath.innerproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inner product as stated in the captured PlanetMath entry innerproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11E39, 15A63) states: An inner product on a vector space V over a field K (which must be either the field ℝ of real numbers or the field ℂ of complex numbers ) is a function ( , ) : V × V ⟶ K such that, for all k 1 , k 2 ∈ K and 𝐯 1 , 𝐯 2 , 𝐯 , 𝐰 ∈ V , the following properties hold: 1.","support":[{"end":292,"quote":"An\ninner product\non a\nvector space\nV\nover a field\nK\n(which must be either the field\nℝ\nof\nreal numbers\nor the field\nℂ\nof\ncomplex numbers\n) is a\nfunction\n(\n,\n)\n:\nV\n×\nV\n⟶\nK\nsuch that, for all\nk\n1\n,\nk\n2\n∈\nK\nand\n𝐯\n1\n,\n𝐯\n2\n,\n𝐯\n,\n𝐰\n∈\nV\n, the following properties hold:\n1.","source_id":"planetmath.innerproduct","source_sha256":"66ffa3ce4dab8a661a4a6944bed33a24a7200e8d9fdcee326eb3eed51b0c234b","start":28}],"target_id":"concept.planetmath.innerproduct","target_kind":"node","target_sha256":"b374527608ceaab409cda9dcd68948189c77929d8ef1b919aa377f0b052fe457"}],"concept.planetmath.innerproductspace":[{"id":"assertion.concept.planetmath.innerproductspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inner product space as stated in the captured PlanetMath entry innerproductspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46C99) states: An inner product space (or pre-Hilbert space ) is a vector space (over ℝ or ℂ ) with an inner product ⟨ ⋅ , ⋅ ⟩ .","support":[{"end":153,"quote":"An\ninner product space\n(or\npre-Hilbert space\n) is a\nvector space\n(over\nℝ\nor\nℂ\n)\nwith an\ninner product\n⟨\n⋅\n,\n⋅\n⟩\n.","source_id":"planetmath.innerproductspace","source_sha256":"cd06dedb0334361bd713ca7c7b4805923e8909457933abeceec256916ab03412","start":40}],"target_id":"concept.planetmath.innerproductspace","target_kind":"node","target_sha256":"67caa90761491b00ed47497bb9a4978fc1d63e7006decbbb8a28a440eea4402a"}],"concept.planetmath.integral":[{"id":"assertion.concept.planetmath.integral","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Integral as stated in the captured PlanetMath entry integral","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B21) states: Let B be a ring with a subring A . We will assume that A is contained in the center of B (in particular, A is commutative ).","support":[{"end":142,"quote":"Let\nB\nbe a ring with a subring\nA\n. We will assume that\nA\nis contained in the center of\nB\n(in particular,\nA\nis\ncommutative\n).","source_id":"planetmath.integral","source_sha256":"e8724618165d86c01e23c49107020acb50785cd7e3d40d344e9bdd549248ccc6","start":18}],"target_id":"concept.planetmath.integral","target_kind":"node","target_sha256":"f0a69a888ae2d1dca904a95290f2390d8ae5caf34c0ff1b904a9824468f02da6"}],"concept.planetmath.integraldomain":[{"id":"assertion.concept.planetmath.integraldomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Integral domain as stated in the captured PlanetMath entry integraldomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13G05) states: An integral domain , or domain , is a commutative cancellation ring with an identity element 1 ≠ 0 .","support":[{"end":132,"quote":"An\nintegral domain\n, or\ndomain\n, is a\ncommutative\ncancellation ring\nwith an\nidentity element\n1\n≠\n0\n.","source_id":"planetmath.integraldomain","source_sha256":"e35e5776872ad528c09356943d15e20555cd95d3ad06951614cea118fd7f0eeb","start":32}],"target_id":"concept.planetmath.integraldomain","target_kind":"node","target_sha256":"cfbeb1f9173995b319a5d32c5239b67ade8425789343f17b03e4234c885bd620"}],"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals":[{"id":"assertion.concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Interpretation of intuitionistic logic by means of functionals as stated in the captured PlanetMath entry interpretationofintuitionisticlogicbymeansoffunctionals","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05, 03B20) states: Abstract The entry reports on the analysis of the concept of constructivity and in particular Gödel’s own stricto sensu constructivity.","support":[{"end":261,"quote":"Abstract\nThe entry reports on the\nanalysis\nof the\nconcept\nof\nconstructivity\nand in particular Gödel’s own\nstricto sensu\nconstructivity.","source_id":"planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","source_sha256":"bc68c4f5d16bc50a9488ccd1c6a3fa36861e3b629043bfc5e014710e37280044","start":126}],"target_id":"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","target_kind":"node","target_sha256":"7c7b5a4568d5c5a20ae3be40372b9cc3f5592b270c13d2f2baff8f97b00aee0c"}],"concept.planetmath.interval":[{"id":"assertion.concept.planetmath.interval","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Interval as stated in the captured PlanetMath entry interval","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D99, 26-00, 54C30) states: Loosely speaking, an interval is a part of the real numbers that start at one number and stops at another number.","support":[{"end":131,"quote":"Loosely speaking, an\ninterval\nis a part of the\nreal numbers\nthat start at one number and stops at another number.","source_id":"planetmath.interval","source_sha256":"99b7170865ab7a28e4e1ae9bffabe00d73f55d5ae89b4cdc3cd3d06028a6fab7","start":18}],"target_id":"concept.planetmath.interval","target_kind":"node","target_sha256":"4bfb3a9097250cb2015e5f67157c7a8c23d8761713bd0a3f67008b3030608bce"}],"concept.planetmath.intuitionisticlogic":[{"id":"assertion.concept.planetmath.intuitionisticlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Intuitionistic logic as stated in the captured PlanetMath entry intuitionisticlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03B20, 03-01) states: Abstract The entry \" intuitionistic logic \" is a beginner’s introduction to the defining features of Brouwer’s (and his School) mathematical philosophy.","support":[{"end":194,"quote":"Abstract\nThe entry \"\nintuitionistic logic\n\" is a beginner’s\nintroduction\nto the defining features of Brouwer’s (and his School) mathematical philosophy.","source_id":"planetmath.intuitionisticlogic","source_sha256":"1e9250ccff6d704ab3f9afc2482f19d5dc279c3f0d2f38a6782d06500a7f37be","start":42}],"target_id":"concept.planetmath.intuitionisticlogic","target_kind":"node","target_sha256":"582ece403468e624abfe586ff43b5f4161e3a29d195d914ed14d2b5038587686"}],"concept.planetmath.invariant":[{"id":"assertion.concept.planetmath.invariant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invariant as stated in the captured PlanetMath entry invariant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","support":[{"end":79,"quote":"Let\nA\nbe a set, and\nT\n:\nA\n→\nA\na\ntransformation\nof that\nset.","source_id":"planetmath.invariant","source_sha256":"72e2a4f141a1a7371ba8cb22ff0b22798bd1e7428f6f5fda15d5f7e29940bbb8","start":20}],"target_id":"concept.planetmath.invariant","target_kind":"node","target_sha256":"40469522f65c5744327a1c92abb54cb80a35602ba5d88ba33cc909dd10fe79a8"}],"concept.planetmath.invariantsubspace":[{"id":"assertion.concept.planetmath.invariantsubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invariant subspace as stated in the captured PlanetMath entry invariantsubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Let T : V → V be a linear transformation of a vector space V .","support":[{"end":100,"quote":"Let\nT\n:\nV\n→\nV\nbe a\nlinear transformation\nof a\nvector space\nV\n.","source_id":"planetmath.invariantsubspace","source_sha256":"1ea9e9571b7abe74873bb110673e7f39d72b787a35a254104db031418f9c3f3f","start":38}],"target_id":"concept.planetmath.invariantsubspace","target_kind":"node","target_sha256":"6e970c83288e02d9f2366000f36209a5781291ab5e09040a49094544a733acaa"}],"concept.planetmath.inversefunction":[{"id":"assertion.concept.planetmath.inversefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse function as stated in the captured PlanetMath entry inversefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 03E20) states: Definition Suppose f : X → Y is a function between sets X and Y , and suppose f - 1 : Y → X is a mapping that satisfies f - 1 ∘ f = id X , f ∘ f - 1 = id Y , where id A denotes the identity function on the set A .","support":[{"end":247,"quote":"Definition\nSuppose\nf\n:\nX\n→\nY\nis a\nfunction\nbetween sets\nX\nand\nY\n,\nand suppose\nf\n-\n1\n:\nY\n→\nX\nis a\nmapping\nthat\nsatisfies\nf\n-\n1\n∘\nf\n=\nid\nX\n,\nf\n∘\nf\n-\n1\n=\nid\nY\n,\nwhere\nid\nA\ndenotes the\nidentity function\non the set\nA\n.","source_id":"planetmath.inversefunction","source_sha256":"974e792feba80e0c49438f06ce69e061b5cc00316810ae0f809b04dd0802e646","start":34}],"target_id":"concept.planetmath.inversefunction","target_kind":"node","target_sha256":"ecc0ee847dee819656d833d00249bab4fc80f78d6d7b667b6e32a16fe546c083"}],"concept.planetmath.inverseimage":[{"id":"assertion.concept.planetmath.inverseimage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse image as stated in the captured PlanetMath entry inverseimage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 46L05, 82-00, 83-00, 81-00) states: Let f : A ⟶ B be a function , and let U ⊂ B be a subset. The inverse image of U is the set f - 1 ⁢ ( U ) ⊂ A consisting of all elements a ∈ A such that f ⁢ ( a ) ∈ U .","support":[{"end":195,"quote":"Let\nf\n:\nA\n⟶\nB\nbe a\nfunction\n, and let\nU\n⊂\nB\nbe a subset. The\ninverse image\nof\nU\nis the set\nf\n-\n1\n⁢\n(\nU\n)\n⊂\nA\nconsisting of all\nelements\na\n∈\nA\nsuch that\nf\n⁢\n(\na\n)\n∈\nU\n.","source_id":"planetmath.inverseimage","source_sha256":"134f4e854d6519585d8fa18dc29c403a33f362f0a83a1ab67575a49c228e0fa9","start":28}],"target_id":"concept.planetmath.inverseimage","target_kind":"node","target_sha256":"834c230e1ca5176a0553a752abe3bbb3a48be16058d1e0be4b1adb0cefaf87d2"}],"concept.planetmath.inversenumber":[{"id":"assertion.concept.planetmath.inversenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse number as stated in the captured PlanetMath entry inversenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12E99, 00A05) states: The inverse number or reciprocal number of a non-zero real or complex number a may be denoted by a - 1 , and it the quotient 1 a (so, it is really the - 1 th power of a ).","support":[{"end":202,"quote":"The\ninverse number\nor\nreciprocal number\nof a non-zero real or\ncomplex number\na\nmay be denoted by\na\n-\n1\n, and it  the\nquotient\n1\na\n(so, it is really the\n-\n1\nth\npower of\na\n).","source_id":"planetmath.inversenumber","source_sha256":"3e1e54a526900f63ea86dfa1bc13a1b901e9f6b5c8881d151aa7d5614a5909c6","start":30}],"target_id":"concept.planetmath.inversenumber","target_kind":"node","target_sha256":"7da522b46d6ebc953679fe998c64d12d5cd573d1aefd6a52ac00e7dc022698d9"}],"concept.planetmath.inversestatement":[{"id":"assertion.concept.planetmath.inversestatement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse statement as stated in the captured PlanetMath entry inversestatement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Let a statement be of the form of an implication If p , then q i.e.","support":[{"end":103,"quote":"Let a statement be of the form of an\nimplication\nIf\np\n, then\nq\ni.e.","source_id":"planetmath.inversestatement","source_sha256":"a35773a244221240ab2e671d19d451b9a875d217f79e8f7a3a1dae530bd2b82c","start":36}],"target_id":"concept.planetmath.inversestatement","target_kind":"node","target_sha256":"186b10282b044a6a665784f16cac29efa9c25744fd0fa3bcd97a726fd8f66a59"}],"concept.planetmath.invertiblelineartransformation":[{"id":"assertion.concept.planetmath.invertiblelineartransformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invertible linear transformation as stated in the captured PlanetMath entry invertiblelineartransformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: An invertible linear transformation is a linear transformation T : V ⟶ W which is a bijection .","support":[{"end":161,"quote":"An\ninvertible linear transformation\nis a\nlinear transformation\nT\n:\nV\n⟶\nW\nwhich is a\nbijection\n.","source_id":"planetmath.invertiblelineartransformation","source_sha256":"2749fb0a788e12b0b192ee376be495b94fa7ff4af31ca73e27765dd94efcb920","start":66}],"target_id":"concept.planetmath.invertiblelineartransformation","target_kind":"node","target_sha256":"27cbde493ec6fdd5017f01d613be44675c5e0081e8215c9b163c6bfc7a092082"}],"concept.planetmath.involutoryring":[{"id":"assertion.concept.planetmath.involutoryring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Involutory ring as stated in the captured PlanetMath entry involutoryring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16W10) states: General Definition of a Ring with Involution Let R be a ring.","support":[{"end":93,"quote":"General Definition of a Ring with Involution\nLet\nR\nbe a ring.","source_id":"planetmath.involutoryring","source_sha256":"4afff2315469a4f39c30685600375cca265d2a045f6789170feb7d07a036bd12","start":32}],"target_id":"concept.planetmath.involutoryring","target_kind":"node","target_sha256":"25669c25a0ffec71cac45a6e3f8f2838dd75fe2064b816ef83ba6cfc72042eb7"}],"concept.planetmath.irrational":[{"id":"assertion.concept.planetmath.irrational","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Irrational as stated in the captured PlanetMath entry irrational","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11J82, 11J72) states: An irrational number is a real number which cannot be represented as a ratio of two integers .","support":[{"end":116,"quote":"An\nirrational number\nis a real number which cannot be represented as a ratio of two\nintegers\n.","source_id":"planetmath.irrational","source_sha256":"3b08fd47821beef039215bce5432270816df594ba6adcbe313637042579a5cda","start":22}],"target_id":"concept.planetmath.irrational","target_kind":"node","target_sha256":"9d4b889deb242a6c5088273cd78fbd96a49e93b5e2d99abea3397f3835391431"}],"concept.planetmath.isomorphicgroups":[{"id":"assertion.concept.planetmath.isomorphicgroups","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Isomorphic groups as stated in the captured PlanetMath entry isomorphicgroups","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Two groups ( X 1 , * 1 ) and ( X 2 , * 2 ) are said to be isomorphic if there is a group isomorphism ψ : X 1 → X 2 .","support":[{"end":152,"quote":"Two groups\n(\nX\n1\n,\n*\n1\n)\nand\n(\nX\n2\n,\n*\n2\n)\nare said to be\nisomorphic\nif there is a group isomorphism\nψ\n:\nX\n1\n→\nX\n2\n.","source_id":"planetmath.isomorphicgroups","source_sha256":"f860e4bc40e371af548f2e246d96b2f89a64145bb34532c2e7c4ba1433fc521c","start":36}],"target_id":"concept.planetmath.isomorphicgroups","target_kind":"node","target_sha256":"5d6c32e238ec78eb5a2f685096882b63d99c383318b1cf1d3197de33a3a618e9"}],"concept.planetmath.isomorphism":[{"id":"assertion.concept.planetmath.isomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Isomorphism as stated in the captured PlanetMath entry isomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05, 15A04, 13A99, 20A05, 18A05) states: A morphism f : A ⟶ B in a category is an isomorphism if there exists a morphism f - 1 : B ⟶ A which is its inverse .","support":[{"end":140,"quote":"A\nmorphism\nf\n:\nA\n⟶\nB\nin a\ncategory\nis an\nisomorphism\nif there exists a morphism\nf\n-\n1\n:\nB\n⟶\nA\nwhich is its\ninverse\n.","source_id":"planetmath.isomorphism","source_sha256":"9f2a083612dea64ecd4937944fda23b74680b0f54fa4e7957c26504326a319d8","start":24}],"target_id":"concept.planetmath.isomorphism","target_kind":"node","target_sha256":"046e704ba6bc6f001443bedc086715b446f6578e35799de4d7ba21c6ec58d47c"}],"concept.planetmath.iterator":[{"id":"assertion.concept.planetmath.iterator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Iterator as stated in the captured PlanetMath entry iterator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N15) states: An iterator is a variable that one by one takes on all the values (usually integers) in a given range.","support":[{"end":120,"quote":"An\niterator\nis a\nvariable\nthat one by one takes on all the values (usually integers) in a given range.","source_id":"planetmath.iterator","source_sha256":"03bf016da508db5a02068cbc2385cf5b5345681cda898858ade4f44cdaaf245d","start":18}],"target_id":"concept.planetmath.iterator","target_kind":"node","target_sha256":"78c828a1ab78b6b45be72e6623b72e968782ed1b4eccb4fa05a67c6bc3b6e4dd"}],"concept.planetmath.jacobianmatrix":[{"id":"assertion.concept.planetmath.jacobianmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Jacobian matrix as stated in the captured PlanetMath entry jacobianmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B10) states: The Jacobian matrix [ 𝐉 ⁢ f ⁢ ( 𝐚 ) ] of a function f : ℝ n → ℝ m at the point 𝐚 with respect to some choice of bases for ℝ n and ℝ m is the matrix of the linear map from ℝ n into ℝ m that generalizes the definition of the derivative of a function on ℝ .","support":[{"end":286,"quote":"The\nJacobian matrix\n[\n𝐉\n⁢\nf\n⁢\n(\n𝐚\n)\n]\nof a function\nf\n:\nℝ\nn\n→\nℝ\nm\nat the point\n𝐚\nwith respect to some choice of bases for\nℝ\nn\nand\nℝ\nm\nis the matrix of the\nlinear map\nfrom\nℝ\nn\ninto\nℝ\nm\nthat generalizes the definition of the\nderivative\nof a function on\nℝ\n.","source_id":"planetmath.jacobianmatrix","source_sha256":"5ad9f692277c977033d969db09658dc39b80d1509e82ac90cf34abe09652a9fa","start":32}],"target_id":"concept.planetmath.jacobianmatrix","target_kind":"node","target_sha256":"13e1ce509cc4228144316b465538e79f40cb7d5e7aa1b6e5e7a3750ade12163b"}],"concept.planetmath.jacobideterminant":[{"id":"assertion.concept.planetmath.jacobideterminant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Jacobi determinant as stated in the captured PlanetMath entry jacobideterminant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 62H05, 15-00) states: Let f = f ⁢ ( x ) = f ⁢ ( x 1 , … , x n ) be a function of n variables , and let u = u ⁢ ( x ) = ( u 1 ⁢ ( x ) , … , u n ⁢ ( x ) ) be a function of x , where inversely x can be expressed as a function of u , x = x ⁢ ( u ) = ( x 1 ⁢ ( u ) , … , x n ⁢ ( u ) ) The formula for a change of variable in an n -dimensional integral is then ∫ Ω f ⁢ ( x ) ⁢ d n ⁢ x = ∫ u ⁢ ( Ω ) f ⁢ ( x ⁢ ( u ) ) ⁢ | det ⁡ ( d ⁢ x / d ⁢ u ) | ⁢ d n ⁢ u Ω is an integration region, and one integrates over all x ∈ Ω , or equivalently, all u ∈ u ⁢ ( Ω ) .","support":[{"end":567,"quote":"Let\nf\n=\nf\n⁢\n(\nx\n)\n=\nf\n⁢\n(\nx\n1\n,\n…\n,\nx\nn\n)\nbe a function of\nn\nvariables\n, and let\nu\n=\nu\n⁢\n(\nx\n)\n=\n(\nu\n1\n⁢\n(\nx\n)\n,\n…\n,\nu\nn\n⁢\n(\nx\n)\n)\nbe a function of\nx\n, where inversely\nx\ncan be expressed as a function of\nu\n,\nx\n=\nx\n⁢\n(\nu\n)\n=\n(\nx\n1\n⁢\n(\nu\n)\n,\n…\n,\nx\nn\n⁢\n(\nu\n)\n)\nThe formula for a change of variable in an\nn\n-dimensional integral is then\n∫\nΩ\nf\n⁢\n(\nx\n)\n⁢\nd\nn\n⁢\nx\n=\n∫\nu\n⁢\n(\nΩ\n)\nf\n⁢\n(\nx\n⁢\n(\nu\n)\n)\n⁢\n|\ndet\n⁡\n(\nd\n⁢\nx\n/\nd\n⁢\nu\n)\n|\n⁢\nd\nn\n⁢\nu\nΩ\nis an integration region, and one\nintegrates\nover all\nx\n∈\nΩ\n, or equivalently, all\nu\n∈\nu\n⁢\n(\nΩ\n)\n.","source_id":"planetmath.jacobideterminant","source_sha256":"de31748f78b9d3b17b9f73eecafd762273c23034840bbe1c120b17f498dfde60","start":38}],"target_id":"concept.planetmath.jacobideterminant","target_kind":"node","target_sha256":"4a20e4117b0029683b9600d89f98544c3b20cecd067367aed408d2a49b368089"}],"concept.planetmath.kripkesemantics":[{"id":"assertion.concept.planetmath.kripkesemantics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Kripke semantics as stated in the captured PlanetMath entry kripkesemantics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B48, 03B20, 03B45) states: A Kripke frame (or simply a frame) ℱ is a pair ( W , R ) where W is a non-empty set whose elements are called worlds or possible worlds , R is a binary relation on W called the accessibility relation .","support":[{"end":235,"quote":"A\nKripke frame\n(or simply a frame)\nℱ\nis a pair\n(\nW\n,\nR\n)\nwhere\nW\nis a non-empty set whose\nelements\nare called\nworlds\nor\npossible worlds\n,\nR\nis a\nbinary relation\non\nW\ncalled the\naccessibility relation\n.","source_id":"planetmath.kripkesemantics","source_sha256":"68d564d99953b5b9084365c642cba66f394f7d923fae4add9c24a09e7d0fd674","start":34}],"target_id":"concept.planetmath.kripkesemantics","target_kind":"node","target_sha256":"55ba48a610023c0b09b8b3f8f464f8e22937a3a97aef15fd673e507bf495d049"}],"concept.planetmath.lambdacalculus":[{"id":"assertion.concept.planetmath.lambdacalculus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lambda calculus as stated in the captured PlanetMath entry lambdacalculus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40) states: Lambda calculus (often referred to as λ -calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with functions and the application of functions to their arguments .","support":[{"end":244,"quote":"Lambda calculus\n(often referred to as\nλ\n-calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with\nfunctions\nand the application of functions to their\narguments\n.","source_id":"planetmath.lambdacalculus","source_sha256":"c44b58c414b6fec162661fdc071ed54716a04fa48d35b7c5ca94471d13650206","start":32}],"target_id":"concept.planetmath.lambdacalculus","target_kind":"node","target_sha256":"e42ecbf71d986b4033bb362222a2c4271b0dc3ee15a34e8a2e66ce6ef8c234ba"}],"concept.planetmath.latticeideal":[{"id":"assertion.concept.planetmath.latticeideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lattice ideal as stated in the captured PlanetMath entry latticeideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B10) states: Let L be a lattice . An ideal I of L is a non-empty subset of L such that 1.","support":[{"end":104,"quote":"Let\nL\nbe a\nlattice\n. An\nideal\nI\nof\nL\nis a non-empty subset of\nL\nsuch that\n1.","source_id":"planetmath.latticeideal","source_sha256":"e6c29bff7c68037c22d92c2cba478e9a4efc6de1e39e1d183bbcc53433a49463","start":28}],"target_id":"concept.planetmath.latticeideal","target_kind":"node","target_sha256":"e0942dee927096f65e5341feaebbab61c1b467649bea63b3c6fd1c3a654de7b1"}],"concept.planetmath.lawoftrichotomy":[{"id":"assertion.concept.planetmath.lawoftrichotomy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Law of trichotomy as stated in the captured PlanetMath entry lawoftrichotomy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A05, 03E20) states: The law of trichotomy for a binary relation R on a set S is the property that • for all x , y ∈ S , exactly one of the following holds: x ⁢ R ⁢ y or y ⁢ R ⁢ x or x = y .","support":[{"end":205,"quote":"The\nlaw of trichotomy\nfor a\nbinary relation\nR\non a set\nS\nis the property that\n•\nfor all\nx\n,\ny\n∈\nS\n, exactly one of the following holds:\nx\n⁢\nR\n⁢\ny\nor\ny\n⁢\nR\n⁢\nx\nor\nx\n=\ny\n.","source_id":"planetmath.lawoftrichotomy","source_sha256":"07f6b1be902260cc391be5543c17ab21b23d9f8bfc7abd406ed23052c06f5bde","start":36}],"target_id":"concept.planetmath.lawoftrichotomy","target_kind":"node","target_sha256":"08349a20b5ac13d777699f1330dc6fb14a9c87a7d6288b555293ae1d36400cf8"}],"concept.planetmath.leftidentityandrightidentity":[{"id":"assertion.concept.planetmath.leftidentityandrightidentity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Left identity and right identity as stated in the captured PlanetMath entry leftidentityandrightidentity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let G be a groupoid . An element e ∈ G is called a left identity element if e ⁢ x = x for all x ∈ G .","support":[{"end":167,"quote":"Let\nG\nbe a\ngroupoid\n. An element\ne\n∈\nG\nis called a\nleft identity\nelement\nif\ne\n⁢\nx\n=\nx\nfor all\nx\n∈\nG\n.","source_id":"planetmath.leftidentityandrightidentity","source_sha256":"2d335aa777bfa3e6fa959d249ffb9cc38f39b1c1c829c9f4472dae5129c4fe32","start":66}],"target_id":"concept.planetmath.leftidentityandrightidentity","target_kind":"node","target_sha256":"b332141e577ccf421a9843c61b10f35b18d5bd44ce1bb4f03709c69d30394bb7"}],"concept.planetmath.lemma":[{"id":"assertion.concept.planetmath.lemma","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lemma as stated in the captured PlanetMath entry lemma","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: There is no technical distinction a lemma, a proposition , and a theorem .","support":[{"end":87,"quote":"There is no technical distinction  a lemma, a\nproposition\n, and a\ntheorem\n.","source_id":"planetmath.lemma","source_sha256":"631b405806e8d159531f72db4b2232e60a34330cba727d86406fa3d8e89729ae","start":12}],"target_id":"concept.planetmath.lemma","target_kind":"node","target_sha256":"383c02c1820448061706020587e5aef27b1166087ac56a878e02f76ba345d101"}],"concept.planetmath.lengthofastring":[{"id":"assertion.concept.planetmath.lengthofastring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Length of a string as stated in the captured PlanetMath entry lengthofastring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Suppose we have a string w on alphabet Σ . We can then represent the string as w = x 1 ⁢ x 2 ⁢ x 3 ⁢ ⋯ ⁢ x n - 1 ⁢ x n , where for all x i ( 1 ≤ i ≤ n ), x i ∈ Σ (this means that each x i must be a “letter” from the alphabet).","support":[{"end":264,"quote":"Suppose we have a string\nw\non\nalphabet\nΣ\n. We can then represent\nthe string as\nw\n=\nx\n1\n⁢\nx\n2\n⁢\nx\n3\n⁢\n⋯\n⁢\nx\nn\n-\n1\n⁢\nx\nn\n, where for all\nx\ni\n(\n1\n≤\ni\n≤\nn\n),\nx\ni\n∈\nΣ\n(this means that each\nx\ni\nmust\nbe a “letter” from the alphabet).","source_id":"planetmath.lengthofastring","source_sha256":"b6dd99b2cb818118e81291d8815210f6fe2ac510724d5a1ccfc4b454b5593915","start":38}],"target_id":"concept.planetmath.lengthofastring","target_kind":"node","target_sha256":"e2320a1a05b8ec3a4d851b71a3a1461b704146c1a5cd5b41f29b9724101a99e5"}],"concept.planetmath.liberabaci":[{"id":"assertion.concept.planetmath.liberabaci","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Liber Abaci as stated in the captured PlanetMath entry liberabaci","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A35) states: Abstract (2015 Update): The “ Liber Abaci ”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to unit fraction by seven distinctions in a subtraction context .","support":[{"end":198,"quote":"Abstract (2015 Update):\nThe “\nLiber Abaci\n”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to\nunit fraction\nby seven distinctions in a\nsubtraction\ncontext\n.","source_id":"planetmath.liberabaci","source_sha256":"b78e6292549e33b6069c0463d9a2add4dca30206460d1858624f9c3b2b1f6ad3","start":24}],"target_id":"concept.planetmath.liberabaci","target_kind":"node","target_sha256":"021e08a63796849223a3be044beaebf0d860b98acdcae12d628235f2d9676186"}],"concept.planetmath.limitpoint":[{"id":"assertion.concept.planetmath.limitpoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Limit point as stated in the captured PlanetMath entry limitpoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let X be a topological space , and let A ⊆ X . An element x ∈ X is said to be a limit point of A if every open set containing x also contains at least one point of A distinct from x .","support":[{"end":207,"quote":"Let\nX\nbe a\ntopological space\n, and let\nA\n⊆\nX\n. An element\nx\n∈\nX\nis said to be a\nlimit point\nof\nA\nif every\nopen set\ncontaining\nx\nalso contains at least one point of\nA\ndistinct from\nx\n.","source_id":"planetmath.limitpoint","source_sha256":"7a24ac1d0a96b4a87e37d561f926796bff20e57fb145b1151a101282120c3982","start":24}],"target_id":"concept.planetmath.limitpoint","target_kind":"node","target_sha256":"03f58e4d9831f3512f2fb9760f4f84138663d8cd766aa0dcad05d491395e84c9"}],"concept.planetmath.linearalgebra":[{"id":"assertion.concept.planetmath.linearalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear algebra as stated in the captured PlanetMath entry linearalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 15-00, 15-01) states: Linear algebra is the branch of mathematics devoted to the theory of linear structure .","support":[{"end":117,"quote":"Linear algebra\nis the branch of mathematics devoted to the theory of\nlinear\nstructure\n.","source_id":"planetmath.linearalgebra","source_sha256":"2b417257b29d83ce1c2cb3dd2537e7f81db7d6cdbc452d9d3c15b42477a7b589","start":30}],"target_id":"concept.planetmath.linearalgebra","target_kind":"node","target_sha256":"fd39545926d756b397aa26bda21c26df824c335fc543eda54188a3ce1d76798b"}],"concept.planetmath.linearfunctional":[{"id":"assertion.concept.planetmath.linearfunctional","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear functional as stated in the captured PlanetMath entry linearfunctional","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A99) states: Let V be a vector space over a field K . A linear functional (or linear form ) on V is a linear mapping ϕ : V → K , where K is thought of as a one-dimensional vector space over itself.","support":[{"end":220,"quote":"Let\nV\nbe a\nvector space\nover a field\nK\n.\nA\nlinear functional\n(or\nlinear form\n) on\nV\nis a\nlinear mapping\nϕ\n:\nV\n→\nK\n,\nwhere\nK\nis thought of as a one-dimensional vector space over itself.","source_id":"planetmath.linearfunctional","source_sha256":"7b4ff3bdc82f84d7bbc817e6d9094232df6cc199d9248024502a57e1f4e5d84a","start":36}],"target_id":"concept.planetmath.linearfunctional","target_kind":"node","target_sha256":"38e36953a296cd56e1fdcd4b8c23d2494ba6314a359bb4ca43f1085e79a99345"}],"concept.planetmath.linearisomorphism":[{"id":"assertion.concept.planetmath.linearisomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear isomorphism as stated in the captured PlanetMath entry linearisomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Definition 1 . Suppose V and W are vector spaces and L : V → W is a linear map .","support":[{"end":118,"quote":"Definition 1\n.\nSuppose\nV\nand\nW\nare\nvector spaces\nand\nL\n:\nV\n→\nW\nis a\nlinear map\n.","source_id":"planetmath.linearisomorphism","source_sha256":"88a37c0718f6804e0fb4e2454dfcc4ef47a23230d41de1b4db60ac69314698c8","start":38}],"target_id":"concept.planetmath.linearisomorphism","target_kind":"node","target_sha256":"39f7f601e4fa5b28e1300b1166d62f966fc375f9576b0816f0ceba271bf05b00"}],"concept.planetmath.linearlyordered":[{"id":"assertion.concept.planetmath.linearlyordered","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linearly ordered as stated in the captured PlanetMath entry linearlyordered","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: An ordering ≤ (or < ) of A is called linear or total if any two elements of A are comparable .","support":[{"end":128,"quote":"An\nordering\n≤\n(or\n<\n) of\nA\nis called\nlinear\nor\ntotal\nif any two elements of\nA\nare\ncomparable\n.","source_id":"planetmath.linearlyordered","source_sha256":"1f08ecb5d167d5c48911c79e142995dfb40f9b50f99516ceb4ee88c1d198fd9e","start":34}],"target_id":"concept.planetmath.linearlyordered","target_kind":"node","target_sha256":"6f2048862a67892f7ad51b3d798eec3e13210e9904aade1f14a72c6d5825b032"}],"concept.planetmath.lineartransformation":[{"id":"assertion.concept.planetmath.lineartransformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear transformation as stated in the captured PlanetMath entry lineartransformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Let V and W be vector spaces over the same field F .","support":[{"end":96,"quote":"Let\nV\nand\nW\nbe\nvector spaces\nover the same field\nF\n.","source_id":"planetmath.lineartransformation","source_sha256":"e18e429d0c30935e3ac36495c976b13c3644aa3bf061bbfed708b228ce3d079b","start":44}],"target_id":"concept.planetmath.lineartransformation","target_kind":"node","target_sha256":"0b932be285f17ab67977d295258e631c17fe784b6411126f387d8c86705edc99"}],"concept.planetmath.linesegment":[{"id":"assertion.concept.planetmath.linesegment","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Line segment as stated in the captured PlanetMath entry linesegment","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 51-00) states: Definition Suppose V is a vector space over ℝ or ℂ , and L is a subset of V .","support":[{"end":103,"quote":"Definition\nSuppose\nV\nis a vector space over\nℝ\nor\nℂ\n, and\nL\nis a subset of\nV\n.","source_id":"planetmath.linesegment","source_sha256":"6795de6c1ad583fafb80e76ca4d6cf4652550acc684e2ccbe2ca05d6946c4330","start":26}],"target_id":"concept.planetmath.linesegment","target_kind":"node","target_sha256":"4a2c98e82e0a8491463d1c957266d955aad4fed1f918773beed1d2c479959bfd"}],"concept.planetmath.listvector":[{"id":"assertion.concept.planetmath.listvector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"List vector as stated in the captured PlanetMath entry listvector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03, 15A90) states: Let 𝕂 be a field and n a positive natural number. We define 𝕂 n to be the set of all mappings from the index list ( 1 , 2 , … , n ) to 𝕂 .","support":[{"end":162,"quote":"Let\n𝕂\nbe a field and\nn\na positive natural number. We define\n𝕂\nn\nto be the set of all\nmappings\nfrom the index list\n(\n1\n,\n2\n,\n…\n,\nn\n)\nto\n𝕂\n.","source_id":"planetmath.listvector","source_sha256":"8816f2f871a6310af6064ce7d0daf23cfb5330f1d02e79a9823852f2abbc2943","start":24}],"target_id":"concept.planetmath.listvector","target_kind":"node","target_sha256":"6cebb2a21fc2b74b00cfebc01c892e302e7919818cd8f1e2ff7e474e5cb56d8a"}],"concept.planetmath.locallycompacthausdorffspaces":[{"id":"assertion.concept.planetmath.locallycompacthausdorffspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally compact Hausdorff spaces as stated in the captured PlanetMath entry locallycompacthausdorffspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U40, 55-00) states: 1 Locally compact Hausdorff spaces Definition 1.1 .","support":[{"end":117,"quote":"1\nLocally compact Hausdorff spaces\nDefinition 1.1\n.","source_id":"planetmath.locallycompacthausdorffspaces","source_sha256":"b091866cd428368302d910eb06baed0118bf231e1094550fdf536a08bd578e25","start":66}],"target_id":"concept.planetmath.locallycompacthausdorffspaces","target_kind":"node","target_sha256":"70e03b289ca94b47dd4ac513acd5b01ce68bd065361c9e9a24e344cbc81cc852"}],"concept.planetmath.locallyconvextopologicalvectorspace":[{"id":"assertion.concept.planetmath.locallyconvextopologicalvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally convex topological vector space as stated in the captured PlanetMath entry locallyconvextopologicalvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A03, 46-00) states: Definition Let V be a topological vector space over a subfield of the complex numbers (usually taken to be ℝ or ℂ ).","support":[{"end":196,"quote":"Definition\nLet\nV\nbe a\ntopological vector space\nover a\nsubfield\nof the\ncomplex numbers\n(usually taken to be\nℝ\nor\nℂ\n).","source_id":"planetmath.locallyconvextopologicalvectorspace","source_sha256":"b3021d616ec08b1eb4f245827be1f70afc981dd1e6d9ec8c04256509ef8a5919","start":80}],"target_id":"concept.planetmath.locallyconvextopologicalvectorspace","target_kind":"node","target_sha256":"90c3a4024143db08a903e16b41f22b171c2ef337618675029b5f53198b4b46d7"}],"concept.planetmath.locallyhomeomorphic":[{"id":"assertion.concept.planetmath.locallyhomeomorphic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally homeomorphic as stated in the captured PlanetMath entry locallyhomeomorphic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: Let X and Y be topological spaces . Then X is locally homeomorphic to Y , if for every x ∈ X there is a neighbourhood U ⊆ X of x and an http://planetmath.org/node/380 open set V ⊆ Y , such that U and V with their respective subspace topology are homeomorphic .","support":[{"end":302,"quote":"Let\nX\nand\nY\nbe\ntopological spaces\n. Then\nX\nis\nlocally\nhomeomorphic\nto\nY\n, if for every\nx\n∈\nX\nthere is a\nneighbourhood\nU\n⊆\nX\nof\nx\nand an\nhttp://planetmath.org/node/380\nopen set\nV\n⊆\nY\n, such that\nU\nand\nV\nwith their respective\nsubspace topology\nare\nhomeomorphic\n.","source_id":"planetmath.locallyhomeomorphic","source_sha256":"4a0c742db0c2e928e5ba5b8b0f7b5a8adaac448abc224f451473d2a33a37b567","start":42}],"target_id":"concept.planetmath.locallyhomeomorphic","target_kind":"node","target_sha256":"5325aca9d2e1537882e3c1757083890928bc0f962efaaf53ec6d0b923af39fcc"}],"concept.planetmath.logicalaxiom":[{"id":"assertion.concept.planetmath.logicalaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical axiom as stated in the captured PlanetMath entry logicalaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B22, 03B05) states: In a logical system , a logical axiom (sometimes called an axiom for short) is a logically valid (well-formed) formula used in a deductive system (particularly an axiom system ) to deduce other logically valid formulas.","support":[{"end":247,"quote":"In a\nlogical system\n, a\nlogical axiom\n(sometimes called an axiom for short) is a logically valid (well-formed)\nformula\nused in a\ndeductive system\n(particularly an\naxiom system\n) to deduce other logically valid formulas.","source_id":"planetmath.logicalaxiom","source_sha256":"0c20ccc08f48269af43fc3b76812eb24f7a9afb093de8a2abec8d00ead476afc","start":28}],"target_id":"concept.planetmath.logicalaxiom","target_kind":"node","target_sha256":"1f35b971558817f293d506a58d6e72284c5f9338a7602c692ea53242951b50cc"}],"concept.planetmath.logicalconnective":[{"id":"assertion.concept.planetmath.logicalconnective","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical connective as stated in the captured PlanetMath entry logicalconnective","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In propositional logic , the usual way of forming a well-formed formula out of existing ones is by attaching a designated symbol to the existing wffs.","support":[{"end":188,"quote":"In\npropositional logic\n, the usual way of forming a\nwell-formed formula\nout of existing ones is by attaching a designated symbol to the existing wffs.","source_id":"planetmath.logicalconnective","source_sha256":"b6e1d3285ca81aa748ce710b0e0dbac38a5ffb67e1f011e0efc440259ea7a6d1","start":38}],"target_id":"concept.planetmath.logicalconnective","target_kind":"node","target_sha256":"3ae1b1ee19f27ca4e4aa51b9cd0624ce93e8f5c252721686a7a014a7ef30734d"}],"concept.planetmath.logicallanguage":[{"id":"assertion.concept.planetmath.logicallanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical language as stated in the captured PlanetMath entry logicallanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: In its most general form, a logical language is a set of rules for constructing formulas for some logic, which can then be assigned truth values based on the rules of that logic.","support":[{"end":212,"quote":"In its most general form, a\nlogical language\nis a set of rules for constructing\nformulas\nfor some logic, which can then be assigned truth values based on the rules of that logic.","source_id":"planetmath.logicallanguage","source_sha256":"31472f804795eb9e6e6597b98617841a21e310efd40ec489a0fa28bb0135bf9d","start":34}],"target_id":"concept.planetmath.logicallanguage","target_kind":"node","target_sha256":"96490758e5bb19d2e9cab36a06996d4fa4f127328a39cb7ef74f44d65ccd92e6"}],"concept.planetmath.logicallyequivalent":[{"id":"assertion.concept.planetmath.logicallyequivalent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logically equivalent as stated in the captured PlanetMath entry logicallyequivalent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Two formulas A and B are said to be logically equivalent (typically shortened to equivalent ) when A is true if and only if B is true (that is, A implies B and B implies A ): ⊧ A ↔ B .","support":[{"end":226,"quote":"Two\nformulas\nA\nand\nB\nare said to be\nlogically equivalent\n(typically shortened to\nequivalent\n) when\nA\nis true if and only if\nB\nis true (that is,\nA\nimplies\nB\nand\nB\nimplies\nA\n):\n⊧\nA\n↔\nB\n.","source_id":"planetmath.logicallyequivalent","source_sha256":"a0750dd4793f66d880a31faa88dc3beed45b1d1c9c8d46706f2b82e17c1854ed","start":42}],"target_id":"concept.planetmath.logicallyequivalent","target_kind":"node","target_sha256":"90638fd3fcb419ab68a89c9a4c475b9664ee351515450c4ed056064d78a8b9bb"}],"concept.planetmath.logicism":[{"id":"assertion.concept.planetmath.logicism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logicism as stated in the captured PlanetMath entry logicism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: In the literature on the foundations of mathematics logicism aims at proving that the propositions of pure mathematics can be derived from the propositions of logic.","support":[{"end":183,"quote":"In the literature on the\nfoundations of mathematics\nlogicism\naims at proving that the\npropositions\nof pure mathematics can be derived from the propositions of logic.","source_id":"planetmath.logicism","source_sha256":"8eb7b97996831b1cac7708a2b3bed19791c0450a1599f3c76d4850ee768c72b6","start":18}],"target_id":"concept.planetmath.logicism","target_kind":"node","target_sha256":"8f710a0e9b7f3115458ff1e5d21ad40b16a4ac146d465c1bb12faf5a7c7af264"}],"concept.planetmath.longline":[{"id":"assertion.concept.planetmath.longline","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Long line as stated in the captured PlanetMath entry longline","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54G20) states: The long line is a non-paracompact Hausdorff 1 -dimensional manifold constructed as follows.","support":[{"end":112,"quote":"The\nlong line\nis a non-paracompact\nHausdorff\n1\n-dimensional\nmanifold\nconstructed as\nfollows.","source_id":"planetmath.longline","source_sha256":"d373a73113412e1f432b28bc8ff9f3434f1e6a71130e9c0cf7f120095a2d3898","start":20}],"target_id":"concept.planetmath.longline","target_kind":"node","target_sha256":"6dfb8dd791f30dd51664ad0a3e3d08aa30965b1069fafd293f571118d0568184"}],"concept.planetmath.manifold":[{"id":"assertion.concept.planetmath.manifold","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Manifold as stated in the captured PlanetMath entry manifold","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53-00, 57R50, 58A05, 58A07) states: Summary. A manifold is a space that is locally like ℝ n , however lacking a preferred system of coordinates.","support":[{"end":126,"quote":"Summary.\nA\nmanifold\nis a space that is\nlocally like\nℝ\nn\n, however lacking a preferred system of\ncoordinates.","source_id":"planetmath.manifold","source_sha256":"54324af466875c32ae061f35b671bb056ba7e02237a4aeec8de9e27c49cf8270","start":18}],"target_id":"concept.planetmath.manifold","target_kind":"node","target_sha256":"4311fbd27fba129fb20aa76a8fc3189d63d70dcaf1c73fa630f787922a297ddb"}],"concept.planetmath.markovalgorithm":[{"id":"assertion.concept.planetmath.markovalgorithm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Markov algorithm as stated in the captured PlanetMath entry markovalgorithm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10) states: Definition A Markov algorithm is a variant of a rewriting system , invented by mathematician Andrey Andreevich Markov Jr.","support":[{"end":155,"quote":"Definition\nA\nMarkov algorithm\nis a variant of a\nrewriting system\n, invented by mathematician Andrey Andreevich Markov Jr.","source_id":"planetmath.markovalgorithm","source_sha256":"4c9a52de1d58ffc13ea79903e9efc662b0fee0305b00f1346524fd2536127e91","start":34}],"target_id":"concept.planetmath.markovalgorithm","target_kind":"node","target_sha256":"f0f7eb7cb2309d6e865e178ecd922a12a1f0eade22dc2047703bad37d6cac17a"}],"concept.planetmath.mathematica":[{"id":"assertion.concept.planetmath.mathematica","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Mathematica as stated in the captured PlanetMath entry mathematica","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 68W30) states: Mathematica is a computer algebra system produced by Wolfram Research.","support":[{"end":94,"quote":"Mathematica\nis a\ncomputer algebra system\nproduced by Wolfram Research.","source_id":"planetmath.mathematica","source_sha256":"21d302dbe013220d095c90429815bed4220e691a00ea70b0f60260f3d7430e8e","start":24}],"target_id":"concept.planetmath.mathematica","target_kind":"node","target_sha256":"b9418d9ef0c9a49cc1338dab848db5c13d983bb79948c10d7762d0ba82e85550"}],"concept.planetmath.matrixinverse":[{"id":"assertion.concept.planetmath.matrixinverse","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Matrix inverse as stated in the captured PlanetMath entry matrixinverse","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A09) states: 1 Matrix Inverse The inverse of an n × n matrix A is denoted by A - 1 .","support":[{"end":101,"quote":"1\nMatrix Inverse\nThe\ninverse\nof an\nn\n×\nn\nmatrix\nA\nis denoted by\nA\n-\n1\n.","source_id":"planetmath.matrixinverse","source_sha256":"fe4dabdc2c380ca1b15ceb0374ef202a7ad358bf21d4d3e51f696dcc920d59e8","start":30}],"target_id":"concept.planetmath.matrixinverse","target_kind":"node","target_sha256":"a4a73973db61bb739af4e552d965b7eabea9dc31d23f3b4952fb2d040f6f0203"}],"concept.planetmath.maximalelement":[{"id":"assertion.concept.planetmath.maximalelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximal element as stated in the captured PlanetMath entry maximalelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E04) states: Let ≤ be an ordering on a set S , and let A ⊆ S . Then, with respect to the ordering ≤ , • a ∈ A is the least element of A if a ≤ x , for all x ∈ A .","support":[{"end":181,"quote":"Let\n≤\nbe an\nordering\non a set\nS\n, and let\nA\n⊆\nS\n. Then, with respect to the ordering\n≤\n,\n•\na\n∈\nA\nis the\nleast\nelement of\nA\nif\na\n≤\nx\n, for all\nx\n∈\nA\n.","source_id":"planetmath.maximalelement","source_sha256":"fb241418be5277265aeca0d98ff416e6381f59c769909099742d5e53bca217b7","start":32}],"target_id":"concept.planetmath.maximalelement","target_kind":"node","target_sha256":"70cf9a0184abc291d24deb21d02236ec9293ec2fec9b270bfa0ad0225c5c1cf6"}],"concept.planetmath.maximallyconsistent":[{"id":"assertion.concept.planetmath.maximallyconsistent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximally consistent as stated in the captured PlanetMath entry maximallyconsistent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03B10, 03B99, 03B45) states: A set Δ of well-formed formulas (wff) is maximally consistent if Δ is consistent and any consistent superset of it is itself: Δ ⊆ Γ with Γ consistent implies Γ = Δ .","support":[{"end":207,"quote":"A set\nΔ\nof\nwell-formed formulas\n(wff) is\nmaximally consistent\nif\nΔ\nis\nconsistent\nand any consistent\nsuperset\nof it is itself:\nΔ\n⊆\nΓ\nwith\nΓ\nconsistent implies\nΓ\n=\nΔ\n.","source_id":"planetmath.maximallyconsistent","source_sha256":"36d0c33e8893ef801e3d394b17277bb0ac5adff080901a612791249012d91f69","start":42}],"target_id":"concept.planetmath.maximallyconsistent","target_kind":"node","target_sha256":"b1a81c2eca8317bfc1b095edaa0c0255bfd298d204ddb7e9322c90835c142727"}],"concept.planetmath.maximalsubgroup":[{"id":"assertion.concept.planetmath.maximalsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximal subgroup as stated in the captured PlanetMath entry maximalsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20E28) states: Let G be a group. A subgroup H of G is said to be a maximal subgroup of G if H ≠ G and there is no subgroup K of G such that H < K < G .","support":[{"end":170,"quote":"Let\nG\nbe a group.\nA\nsubgroup\nH\nof\nG\nis said to be a\nmaximal subgroup\nof\nG\nif\nH\n≠\nG\nand there is no subgroup\nK\nof\nG\nsuch that\nH\n<\nK\n<\nG\n.","source_id":"planetmath.maximalsubgroup","source_sha256":"43a3a3787b4d6f6c93a9ee800a221dd394fd26dfdc704643a37fb5331be808c8","start":34}],"target_id":"concept.planetmath.maximalsubgroup","target_kind":"node","target_sha256":"b1f013c6eb602941a20eb55fc0dd65ca1e776456148fd34fad94b4b76656d06e"}],"concept.planetmath.measurablespace":[{"id":"assertion.concept.planetmath.measurablespace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Measurable space as stated in the captured PlanetMath entry measurablespace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 28A33) states: A measurable space is a set E together with a collection ℬ of subsets of E which is a sigma algebra .","support":[{"end":135,"quote":"A\nmeasurable space\nis a set\nE\ntogether with a\ncollection\nℬ\nof subsets of\nE\nwhich is a\nsigma algebra\n.","source_id":"planetmath.measurablespace","source_sha256":"2990b76ba6e1d1b80fb1a1894a4785f36554a98b717bfd56a6b22c4c2a89ffec","start":34}],"target_id":"concept.planetmath.measurablespace","target_kind":"node","target_sha256":"2278b787a4dd5e0d588214a235ec3ad2cfa9b9179d7c5c2fb2f229a41ca7c1ab"}],"concept.planetmath.metalanguage":[{"id":"assertion.concept.planetmath.metalanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metalanguage as stated in the captured PlanetMath entry metalanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: A remedy for Berry’s Paradox and related paradoxes is to separate the language used to formulate a particular mathematical theory from the language used for its discourse.","support":[{"end":197,"quote":"A remedy for Berry’s\nParadox\nand related paradoxes is to\nseparate the\nlanguage\nused to formulate a particular mathematical\ntheory from the language used for its discourse.","source_id":"planetmath.metalanguage","source_sha256":"fed3ca5413c141359e007684e29735cc3e8ea2780d70b253a9c475dcd707db52","start":26}],"target_id":"concept.planetmath.metalanguage","target_kind":"node","target_sha256":"becffa1310dae1a3c824fd1610fc0304ed9e6f574482cfc3c0cef853691bc7fb"}],"concept.planetmath.metricequivalence":[{"id":"assertion.concept.planetmath.metricequivalence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metric equivalence as stated in the captured PlanetMath entry metricequivalence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Let X be a set equipped with two metrics ρ and σ . We say that ρ is equivalent to σ (on X ) if the identity map on X , is a homeomorphism between the metric topology on X induced by ρ and the metric topology on X induced by σ .","support":[{"end":265,"quote":"Let\nX\nbe a set equipped with two metrics\nρ\nand\nσ\n. We say that\nρ\nis\nequivalent\nto\nσ\n(on\nX\n) if the\nidentity map\non\nX\n, is a\nhomeomorphism\nbetween the\nmetric topology\non\nX\ninduced by\nρ\nand the metric topology on\nX\ninduced by\nσ\n.","source_id":"planetmath.metricequivalence","source_sha256":"17bd62f8505c605ecf703a4011571fead92c6427bb4394717b98c953d246c09a","start":38}],"target_id":"concept.planetmath.metricequivalence","target_kind":"node","target_sha256":"c64fc4dc12a36001a4d3d2af6ff2ca86b98c34e768548dd02bf1291793c9d816"}],"concept.planetmath.metricspace":[{"id":"assertion.concept.planetmath.metricspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metric space as stated in the captured PlanetMath entry metricspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 82-00, 83-00, 81-00) states: A metric space is a set X together with a real valued function d : X × X ⟶ ℝ (called a metric , or sometimes a distance function) such that, for every x , y , z ∈ X , • d ⁢ ( x , y ) ≥ 0 , with equality 1 1 This condition can be replaced with the weaker statement d ⁢ ( x , y ) = 0 ⇔ x = y without affecting the definition.","support":[{"end":349,"quote":"A\nmetric space\nis a set\nX\ntogether with a real valued\nfunction\nd\n:\nX\n×\nX\n⟶\nℝ\n(called a\nmetric\n, or sometimes a\ndistance\nfunction) such that, for every\nx\n,\ny\n,\nz\n∈\nX\n,\n•\nd\n⁢\n(\nx\n,\ny\n)\n≥\n0\n, with equality\n1\n1\nThis condition can be replaced with the weaker statement\nd\n⁢\n(\nx\n,\ny\n)\n=\n0\n⇔\nx\n=\ny\nwithout affecting the definition.","source_id":"planetmath.metricspace","source_sha256":"619e9a878509c6d5796ed16829e9503c9b59c2036f9e8a49ba7c695921d4cedf","start":26}],"target_id":"concept.planetmath.metricspace","target_kind":"node","target_sha256":"b2cc8ed490299616ab02e51f5526b827bc3e4e56683b1dbcd1cda2a05f960b57"}],"concept.planetmath.metrizable":[{"id":"assertion.concept.planetmath.metrizable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metrizable as stated in the captured PlanetMath entry metrizable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00, 55-00, 22-00) states: A topological space ( X , 𝒯 ) is said to be metrizable if there is a metric d : X → [ 0 , ∞ ) such that the topology induced by d is 𝒯 .","support":[{"end":158,"quote":"A\ntopological space\n(\nX\n,\n𝒯\n)\nis said to be\nmetrizable\nif there is a metric\nd\n:\nX\n→\n[\n0\n,\n∞\n)\nsuch that the\ntopology\ninduced by\nd\nis\n𝒯\n.","source_id":"planetmath.metrizable","source_sha256":"c064f2572e7f2f3442c8c1169f365de6fb03f43f3c3dea2918f89b230f9eb16f","start":22}],"target_id":"concept.planetmath.metrizable","target_kind":"node","target_sha256":"91a61a0693201e0ac23dbb3045ac39d2e860e82037cdb780d77fbfb2763e0d93"}],"concept.planetmath.modallogic":[{"id":"assertion.concept.planetmath.modallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modal logic as stated in the captured PlanetMath entry modallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B45) states: Introduction Modal logic is the logic of “ necessity ” and “possibility”.","support":[{"end":97,"quote":"Introduction\nModal logic\nis the logic of “\nnecessity\n” and “possibility”.","source_id":"planetmath.modallogic","source_sha256":"d2821100b89606483505b429ad9cf10aab1e7e65dbc6f451f7f973fcfdcf904e","start":24}],"target_id":"concept.planetmath.modallogic","target_kind":"node","target_sha256":"a97249bd61721c0ba501cb7f5ca1b4e06b22d717ad5d08934bd7f25ad19843fb"}],"concept.planetmath.modelsconstructedfromconstants":[{"id":"assertion.concept.planetmath.modelsconstructedfromconstants","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Models constructed from constants as stated in the captured PlanetMath entry modelsconstructedfromconstants","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: The definition of a structure and of the satisfaction relation is nice, but it raises the following question : how do we get models in the first place? The most basic construction for models of first-order theory is the construction that uses constants .","support":[{"end":322,"quote":"The\ndefinition\nof a\nstructure\nand of the\nsatisfaction relation\nis\nnice, but it raises the following question : how do we get models in\nthe first place? The most basic construction for models of\nfirst-order theory\nis the construction that uses\nconstants\n.","source_id":"planetmath.modelsconstructedfromconstants","source_sha256":"4e199b023d7f6c7f78766f0bf5bc9d2b6038549300f425653b06c48990dc1c37","start":68}],"target_id":"concept.planetmath.modelsconstructedfromconstants","target_kind":"node","target_sha256":"ad43a2a6a7e39aae66597f62f7ddaf6b57aa7d3cf1e2365b6cd1a448f8cd6db9"}],"concept.planetmath.modeltheory":[{"id":"assertion.concept.planetmath.modeltheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Model theory as stated in the captured PlanetMath entry modeltheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C99) states: Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","support":[{"end":149,"quote":"Model theory\nis a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","source_id":"planetmath.modeltheory","source_sha256":"1d0595e99b710e8e882331819f1f880473573b9a4df465764bbcd2a95cef403b","start":26}],"target_id":"concept.planetmath.modeltheory","target_kind":"node","target_sha256":"afc7c91166a4596397747d1cb7ad435b9112c673410ef2e9c98451b8aef93df4"}],"concept.planetmath.modulusofcomplexnumber":[{"id":"assertion.concept.planetmath.modulusofcomplexnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modulus of complex number as stated in the captured PlanetMath entry modulusofcomplexnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 32-00, 30-00, 12D99) states: Definition Let z be a complex number , and let z ¯ be the complex conjugate of z .","support":[{"end":134,"quote":"Definition\nLet\nz\nbe a\ncomplex number\n, and let\nz\n¯\nbe the\ncomplex conjugate\nof\nz\n.","source_id":"planetmath.modulusofcomplexnumber","source_sha256":"7a3d4cd80becd035ce2441214723e891a8cd77427a0902c17b4e761a29a079bc","start":52}],"target_id":"concept.planetmath.modulusofcomplexnumber","target_kind":"node","target_sha256":"e1ceacd40a5358f29b2afc1ccb91695f539ce7e747dd0fae4b1c792a3eee75b2"}],"concept.planetmath.modusponens":[{"id":"assertion.concept.planetmath.modusponens","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modus ponens as stated in the captured PlanetMath entry modusponens","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B22, 03B05, 03B35) states: Modus ponens is a rule of inference that is commonly found in many logics where the binary logical connective → (sometimes written ⇒ or ⊃ ) called logical implication are defined.","support":[{"end":205,"quote":"Modus ponens\nis a\nrule of inference\nthat is commonly found in many logics where the binary\nlogical connective\n→\n(sometimes written\n⇒\nor\n⊃\n) called\nlogical implication\nare defined.","source_id":"planetmath.modusponens","source_sha256":"6970f5ab3e357b6742e32019bbc3b149dee8941cd9ed3a8086800896a9547df7","start":26}],"target_id":"concept.planetmath.modusponens","target_kind":"node","target_sha256":"328186bad138923ec1b8766b1f1b2b0dafb08de7c60eab34f44df4bded503fec"}],"concept.planetmath.monoid":[{"id":"assertion.concept.planetmath.monoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monoid as stated in the captured PlanetMath entry monoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99, 34-01) states: A monoid is a semigroup G which contains an identity element ; that is, there exists an element e ∈ G such that e ⋅ a = a ⋅ e = a for all a ∈ G .","support":[{"end":159,"quote":"A monoid is a\nsemigroup\nG\nwhich contains an\nidentity element\n; that is, there exists an\nelement\ne\n∈\nG\nsuch that\ne\n⋅\na\n=\na\n⋅\ne\n=\na\nfor all\na\n∈\nG\n.","source_id":"planetmath.monoid","source_sha256":"316bdc1256bf1a9244c8d7163d44a5d4d7f5f40f376492a0d3ce716dbd92e27d","start":14}],"target_id":"concept.planetmath.monoid","target_kind":"node","target_sha256":"4c34f257100b46c7b9dd5d83c8deb1b82adeb3a38bcfef2cb546ca4b27a10e36"}],"concept.planetmath.monoidalcategory":[{"id":"assertion.concept.planetmath.monoidalcategory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monoidal category as stated in the captured PlanetMath entry monoidalcategory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 81-00, 18-00, 18D10) states: A monoidal category is a category which has the structure of a monoid, that is, among the objects there is a binary operation which is associative and has an unique neutral or unit element.","support":[{"end":225,"quote":"A\nmonoidal category\nis a\ncategory\nwhich has the\nstructure\nof a monoid, that is, among the objects there is a\nbinary operation\nwhich is\nassociative\nand has an unique neutral or unit element.","source_id":"planetmath.monoidalcategory","source_sha256":"6673cc88b63bce95a4a575c8c9cb2b9db605d6ce4f5cbf841af772d66f145806","start":36}],"target_id":"concept.planetmath.monoidalcategory","target_kind":"node","target_sha256":"9193e1894d0e4267a49f213beb7d1b6651ce08fa7c4e0f173ea29c3b055b2721"}],"concept.planetmath.monomial":[{"id":"assertion.concept.planetmath.monomial","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monomial as stated in the captured PlanetMath entry monomial","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12-00) states: A monomial is a product of non-negative powers of variables .","support":[{"end":79,"quote":"A\nmonomial\nis a\nproduct\nof non-negative powers of\nvariables\n.","source_id":"planetmath.monomial","source_sha256":"a0829a2cd58dda3489739664bbaeda2526b4d826cbcc21d101ecc7cc8e679ac4","start":18}],"target_id":"concept.planetmath.monomial","target_kind":"node","target_sha256":"5d751e61b07f23c246365cfdb250fa9c86873500104ed978202cb6bbfef48f19"}],"concept.planetmath.multilinear":[{"id":"assertion.concept.planetmath.multilinear","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multi-linear as stated in the captured PlanetMath entry multilinear","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69) states: Let V 1 , V 2 , … , V n , W be vector spaces over a field K .","support":[{"end":87,"quote":"Let\nV\n1\n,\nV\n2\n,\n…\n,\nV\nn\n,\nW\nbe\nvector spaces\nover a field\nK\n.","source_id":"planetmath.multilinear","source_sha256":"1775ae0939b04c0f5953baf8fe5c61afbf8db6b7a354bc8a7dc6a32b3c39ac68","start":26}],"target_id":"concept.planetmath.multilinear","target_kind":"node","target_sha256":"49e08505b330e6e96b5d8abaf3c8c0c5d23cfdded053802d082fb7c247f25f96"}],"concept.planetmath.multiplication":[{"id":"assertion.concept.planetmath.multiplication","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiplication as stated in the captured PlanetMath entry multiplication","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A06, 11B25, 00A05) states: Multiplication is a mathematical operation in which two or more numbers are added up to themselves by a factor of other numbers.","support":[{"end":158,"quote":"Multiplication\nis a mathematical\noperation\nin which two or more numbers are added up to themselves by a factor of other numbers.","source_id":"planetmath.multiplication","source_sha256":"3efbdee95c7b88ba04c03acf699dfbb8364ca93382576ed35791110652f0609d","start":30}],"target_id":"concept.planetmath.multiplication","target_kind":"node","target_sha256":"f0c5b62b1acef082fe86db9e8edb92452e9e03e467bbad397eb3eda852e6daa9"}],"concept.planetmath.multiplicationoperator":[{"id":"assertion.concept.planetmath.multiplicationoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiplication operator as stated in the captured PlanetMath entry multiplicationoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A99) states: A multiplication operator is an operator signifying multiplication among two or more operands.","support":[{"end":142,"quote":"A\nmultiplication operator\nis an\noperator\nsignifying\nmultiplication\namong two or more operands.","source_id":"planetmath.multiplicationoperator","source_sha256":"df6785d682f7ae7755adcb6d17792e7c740bf8ffd215bb9b8b2ff4f87dd541fd","start":48}],"target_id":"concept.planetmath.multiplicationoperator","target_kind":"node","target_sha256":"b0fac47ed3c1030744bdb13d7084dd8a0e27e0ae9716bc6a44456e0a1a471fa8"}],"concept.planetmath.multiset":[{"id":"assertion.concept.planetmath.multiset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiset as stated in the captured PlanetMath entry multiset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: A multiset is a set for which repeated elements are considered.","support":[{"end":81,"quote":"A\nmultiset\nis a set for which repeated\nelements\nare considered.","source_id":"planetmath.multiset","source_sha256":"b211e4a66e6af6affe5550f5f9242b8e0a75abc710f20f5b8eae8a3cabddc8cf","start":18}],"target_id":"concept.planetmath.multiset","target_kind":"node","target_sha256":"2f2f01d47a37d3be4aa225b79a8af2610d64bac1c4fcf757e65b43a2ff942de4"}],"concept.planetmath.multivaluedfunction":[{"id":"assertion.concept.planetmath.multivaluedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multivalued function as stated in the captured PlanetMath entry multivaluedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let us recall that a function f from a set A to a set B is an assignment that takes each element of A to a unique element of B .","support":[{"end":170,"quote":"Let us recall that a\nfunction\nf\nfrom a set\nA\nto a set\nB\nis an assignment that takes each element of\nA\nto a\nunique\nelement of\nB\n.","source_id":"planetmath.multivaluedfunction","source_sha256":"e6c43ab96a914e069f41e1e917458e287ab534844ee1b67cfc4bda655b4c3f0c","start":42}],"target_id":"concept.planetmath.multivaluedfunction","target_kind":"node","target_sha256":"26cfda9355f672c95a2d9f9b359aeddfbd7de7feb81f828a1e8677a2d9637b9e"}],"concept.planetmath.naturaldeduction":[{"id":"assertion.concept.planetmath.naturaldeduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Natural deduction as stated in the captured PlanetMath entry naturaldeduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03) states: Natural deduction refers to related proof systems for several different kinds of logic, intended to be similar to the way people actually reason.","support":[{"end":181,"quote":"Natural deduction\nrefers to related\nproof systems\nfor several different kinds of logic, intended to be\nsimilar\nto the way people actually reason.","source_id":"planetmath.naturaldeduction","source_sha256":"da719ce5c56e01f0b96a68c465131d17a00b01f31130a707fb26fbbd9918efc0","start":36}],"target_id":"concept.planetmath.naturaldeduction","target_kind":"node","target_sha256":"baa0838243b2f482956939d6b6bdefa7ea3272d3e3a2caffac9872403fc300a9"}],"concept.planetmath.naturalnumber":[{"id":"assertion.concept.planetmath.naturalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Natural number as stated in the captured PlanetMath entry naturalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10, 74D99) states: Given the Zermelo-Fraenkel axioms of set theory , one can prove that there exists an inductive set X such that ∅ ∈ X .","support":[{"end":148,"quote":"Given the\nZermelo-Fraenkel axioms\nof\nset theory\n, one can prove that there exists an\ninductive set\nX\nsuch that\n∅\n∈\nX\n.","source_id":"planetmath.naturalnumber","source_sha256":"6f3bf110d753d9e8fccd59de44dfe3b308faaafbba7c7431c972078f524a43ef","start":30}],"target_id":"concept.planetmath.naturalnumber","target_kind":"node","target_sha256":"3f5076d4babd67da2c4c51f13232e37d5420a5e3d3163b520cd34880658551a4"}],"concept.planetmath.nearring":[{"id":"assertion.concept.planetmath.nearring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Near-ring as stated in the captured PlanetMath entry nearring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16Y30) states: Definitions A near-ring is a set ( http://planetmath.org/Set ) N together with two binary operations , denoted + : N × N → N and ⋅ : N × N → N , such that 1.","support":[{"end":177,"quote":"Definitions\nA\nnear-ring\nis a set (\nhttp://planetmath.org/Set\n)\nN\ntogether with two\nbinary operations\n, denoted\n+\n:\nN\n×\nN\n→\nN\nand\n⋅\n:\nN\n×\nN\n→\nN\n, such that\n1.","source_id":"planetmath.nearring","source_sha256":"e8c7bd04e003c14a8894c0146a8bd8ec71381c981d2daf182facadd10fe57004","start":20}],"target_id":"concept.planetmath.nearring","target_kind":"node","target_sha256":"b29789c7bde02dcda8c052f35ae6c431b89e8d630d47b2cb287d9c464e531d55"}],"concept.planetmath.necessaryandsufficient":[{"id":"assertion.concept.planetmath.necessaryandsufficient","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Necessary and sufficient as stated in the captured PlanetMath entry necessaryandsufficient","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03F07) states: The statement “ p is necessary for q ” “ q implies ( http://planetmath.org/ Implication ) p ”.","support":[{"end":145,"quote":"The statement “\np\nis\nnecessary\nfor\nq\n”  “\nq\nimplies (\nhttp://planetmath.org/\nImplication\n)\np\n”.","source_id":"planetmath.necessaryandsufficient","source_sha256":"f54351a3fea8d8f8ac87034fb1b6201e46fd1368710a580fc5a5e0076c45e9fd","start":50}],"target_id":"concept.planetmath.necessaryandsufficient","target_kind":"node","target_sha256":"0e0f57356f657145a12a3fd015f58b1ff1b752fd3dedd41008298deafa352e93"}],"concept.planetmath.negativenumber":[{"id":"assertion.concept.planetmath.negativenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Negative number as stated in the captured PlanetMath entry negativenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A negative number is a number that is less than zero.","support":[{"end":85,"quote":"A\nnegative number\nis a number that is less than zero.","source_id":"planetmath.negativenumber","source_sha256":"9d7a27405f59967fa2052d6cdb2f4be067abf527063ecc936645ff0e65880ce9","start":32}],"target_id":"concept.planetmath.negativenumber","target_kind":"node","target_sha256":"1c1c4ef005f1ca3e357b1217d721ed2a293c6d18f67168418fa1629c65b9248a"}],"concept.planetmath.neighborhood":[{"id":"assertion.concept.planetmath.neighborhood","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Neighborhood as stated in the captured PlanetMath entry neighborhood","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: The meaning of the word neighborhood in topology is not well standardized.","support":[{"end":100,"quote":"The meaning of the word\nneighborhood\nin\ntopology\nis not well standardized.","source_id":"planetmath.neighborhood","source_sha256":"4fca53119d178fcda32906bae284d0cf6053338dee716d8cdbe0979041b1692e","start":26}],"target_id":"concept.planetmath.neighborhood","target_kind":"node","target_sha256":"e375a0e1208c2b8bee90f95d38908770ddd162d63571fd8881c883148af7d89f"}],"concept.planetmath.neighborhoodofavertex":[{"id":"assertion.concept.planetmath.neighborhoodofavertex","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Neighborhood (of a vertex) as stated in the captured PlanetMath entry neighborhoodofavertex","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C99) states: For a graph G , the set of vertices adjacent to a vertex x ∈ G , the neighborhood of x , is denoted by Γ ⁢ ( x ) .","support":[{"end":168,"quote":"For a graph\nG\n, the set of vertices\nadjacent\nto a vertex\nx\n∈\nG\n, the\nneighborhood\nof\nx\n, is denoted by\nΓ\n⁢\n(\nx\n)\n.","source_id":"planetmath.neighborhoodofavertex","source_sha256":"f7865fd6fde1d6e79a8fc5dd5ad5a08232fed00b3b753c36722758d5f5c17df5","start":54}],"target_id":"concept.planetmath.neighborhoodofavertex","target_kind":"node","target_sha256":"e3ce0c3184ef78807a566621a7c8c11a8effe747a50f8f983decf648ff10602d"}],"concept.planetmath.net":[{"id":"assertion.concept.planetmath.net","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Net as stated in the captured PlanetMath entry net","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A20) states: Let X be a set. A net is a map from a directed set to X .","support":[{"end":65,"quote":"Let\nX\nbe a set. A\nnet\nis a map from a directed set to\nX\n.","source_id":"planetmath.net","source_sha256":"a9071141b7d3ed3e851076d32796a2c97744e61e5a26e2f31c58f64cd3d292fd","start":8}],"target_id":"concept.planetmath.net","target_kind":"node","target_sha256":"f42401c4eb6dbbf54742498fe0565ef2850be7527ee803cb61e640398f508bc0"}],"concept.planetmath.noncommutativedynamicmodelingdiagrams":[{"id":"assertion.concept.planetmath.noncommutativedynamicmodelingdiagrams","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-commutative dynamic modeling diagrams as stated in the captured PlanetMath entry noncommutativedynamicmodelingdiagrams","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C98, 03C52, 18-00, 03D80, 03D15) states: \\xyoption curve 0.1 Introduction In an interesting report, Rosen(1987) showed that complex dynamical systems , such as biological organisms, cannot be adequately modelled through a commutative modelling diagram – in the sense of digital computer simulation –whereas the simple (‘physical’/ engineering) dynamical systems can be thus numerically simulated.","support":[{"end":439,"quote":"\\xyoption\ncurve\n0.1\nIntroduction\nIn an interesting report, Rosen(1987) showed that\ncomplex\ndynamical systems\n,\nsuch as biological organisms, cannot be adequately modelled through\na\ncommutative\nmodelling diagram\n– in the sense of digital\ncomputer simulation\n–whereas the simple (‘physical’/ engineering)\ndynamical systems can be thus numerically simulated.","source_id":"planetmath.noncommutativedynamicmodelingdiagrams","source_sha256":"1e48aed8f54309398dd32aa87c9ebc4debe4bf93864eb6944a735ba9a494e475","start":84}],"target_id":"concept.planetmath.noncommutativedynamicmodelingdiagrams","target_kind":"node","target_sha256":"0d253f3594ebf29e00c73fcb4735ddaf199fd4e9dab03de80812dce95ffb1458"}],"concept.planetmath.noncommutativestructure":[{"id":"assertion.concept.planetmath.noncommutativestructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-commutative structure as stated in the captured PlanetMath entry noncommutativestructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55-00, 18-00) states: Definition 0.1 . Let ( C , ∘ ) be a structure consisting of a class , C , together with a binary operation ∘ defined for pairs of objects in C (or elements of C when the latter is a small class, i.e., a set).","support":[{"end":260,"quote":"Definition 0.1\n.\nLet\n(\nC\n,\n∘\n)\nbe a\nstructure\nconsisting of a\nclass\n,\nC\n, together with a\nbinary operation\n∘\ndefined for pairs of objects in\nC\n(or elements of\nC\nwhen the latter is a small class, i.e., a set).","source_id":"planetmath.noncommutativestructure","source_sha256":"39f18106d6c1c0d1076dcff73f4111f659b5b51d02328d202006552da2c78ad1","start":52}],"target_id":"concept.planetmath.noncommutativestructure","target_kind":"node","target_sha256":"75f583d168e2c401dd945ba49aaa13410e150e6ef05cf7f5c76ab593365cc192"}],"concept.planetmath.nondegeneratebilinearform":[{"id":"assertion.concept.planetmath.nondegeneratebilinearform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-degenerate bilinear form as stated in the captured PlanetMath entry nondegeneratebilinearform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39) states: A bilinear form B over a vector space V is said to be non-degenerate when • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐱 ∈ V , then 𝐲 = 𝟎 , and • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐲 ∈ V , then 𝐱 = 𝟎 .","support":[{"end":239,"quote":"A\nbilinear form\nB\nover a\nvector space\nV\nis said to be\nnon-degenerate\nwhen\n•\nif\nB\n⁢\n(\n𝐱\n,\n𝐲\n)\n=\n0\nfor all\n𝐱\n∈\nV\n, then\n𝐲\n=\n𝟎\n, and\n•\nif\nB\n⁢\n(\n𝐱\n,\n𝐲\n)\n=\n0\nfor all\n𝐲\n∈\nV\n, then\n𝐱\n=\n𝟎\n.","source_id":"planetmath.nondegeneratebilinearform","source_sha256":"904b42747deeb8f1e0d5125ee6fc86568e6acea733550dfe719a76d23e625a31","start":58}],"target_id":"concept.planetmath.nondegeneratebilinearform","target_kind":"node","target_sha256":"d0705ea38083752bf9a451832c518c51501ec9ee2d67c150f31cd2eeb8ccea5d"}],"concept.planetmath.normalmodallogic":[{"id":"assertion.concept.planetmath.normalmodallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normal modal logic as stated in the captured PlanetMath entry normalmodallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B45) states: The study of modal logic is based on the concept of a logic , which is a set Λ of wff’s satisfying the following: • contains all tautologies , and • is closed under modus ponens .","support":[{"end":217,"quote":"The study of\nmodal logic\nis based on the\nconcept\nof a\nlogic\n, which is a set\nΛ\nof wff’s satisfying the following:\n•\ncontains all\ntautologies\n, and\n•\nis\nclosed under\nmodus ponens\n.","source_id":"planetmath.normalmodallogic","source_sha256":"cca884013fa3f04fac523e3ba89ba23108e958b44a8647c7ef4328675a1987f1","start":38}],"target_id":"concept.planetmath.normalmodallogic","target_kind":"node","target_sha256":"10b6e9ec42a1a61690cf9d55fe376e94d3ef88581e41ebabb9cab2de80da51dc"}],"concept.planetmath.normalsubgroup":[{"id":"assertion.concept.planetmath.normalsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normal subgroup as stated in the captured PlanetMath entry normalsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: A subgroup H of a group G is normal if a ⁢ H = H ⁢ a for all a ∈ G .","support":[{"end":100,"quote":"A\nsubgroup\nH\nof a group\nG\nis\nnormal\nif\na\n⁢\nH\n=\nH\n⁢\na\nfor all\na\n∈\nG\n.","source_id":"planetmath.normalsubgroup","source_sha256":"5d4b5b8e96e192e23a564d653af46dc10f08f7cc755e7f4a39caacbd90efd18b","start":32}],"target_id":"concept.planetmath.normalsubgroup","target_kind":"node","target_sha256":"b5d5ffe76d49e46e8fc7b38843e66baf805d2b574e143deedfceac14da2f33d6"}],"concept.planetmath.normedvectorspace":[{"id":"assertion.concept.planetmath.normedvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normed vector space as stated in the captured PlanetMath entry normedvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B99) states: Let 𝔽 be a field which is either ℝ or ℂ . A over 𝔽 is a pair ( V , ∥ ⋅ ∥ ) where V is a vector space over 𝔽 and ∥ ⋅ ∥ : V → ℝ is a function such that 1.","support":[{"end":192,"quote":"Let\n𝔽\nbe a field which is either\nℝ\nor\nℂ\n. A\nover\n𝔽\nis a pair\n(\nV\n,\n∥\n⋅\n∥\n)\nwhere\nV\nis a\nvector space\nover\n𝔽\nand\n∥\n⋅\n∥\n:\nV\n→\nℝ\nis a function such that\n1.","source_id":"planetmath.normedvectorspace","source_sha256":"bc93cb3125040dfdcd8e9b9e651f5611e78166ad8694de2eb667c8e86ab57e6e","start":40}],"target_id":"concept.planetmath.normedvectorspace","target_kind":"node","target_sha256":"99f2bcacb7c7be52b8c13652ef07e72e0f0af636cf86ff6724c1030f2f344105"}],"concept.planetmath.oddnumber":[{"id":"assertion.concept.planetmath.oddnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Odd number as stated in the captured PlanetMath entry oddnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A51) states: An odd number n is an integer of the form 2 ⁢ m + 1 , and as such it is not divisible by 2.","support":[{"end":113,"quote":"An\nodd number\nn\nis an\ninteger\nof the form\n2\n⁢\nm\n+\n1\n, and as such it is not\ndivisible\nby 2.","source_id":"planetmath.oddnumber","source_sha256":"49c32ac6fea407e8355af849bddfca61ea20fa95f78ffecdff967c354859c4f6","start":22}],"target_id":"concept.planetmath.oddnumber","target_kind":"node","target_sha256":"e7a6b0e558c5cab04e6c96f5fbfcd589b9d40b6bb8ca038cd3c9491efb087e4e"}],"concept.planetmath.ominimality":[{"id":"assertion.concept.planetmath.ominimality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"O-minimality as stated in the captured PlanetMath entry ominimality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C64, 14P10) states: Let M be an ordered structure . An interval in M is any subset of M that can be expressed in one of the following forms: • { x : a < x < b } for some a , b from M • { x : x > a } for some a from M • { x : x < a } for some a from M Then we define M to be o-minimal iff every definable subset of M is a finite union of intervals and points.","support":[{"end":364,"quote":"Let\nM\nbe an ordered\nstructure\n. An\ninterval\nin\nM\nis any subset of\nM\nthat can be expressed in one of the following forms:\n•\n{\nx\n:\na\n<\nx\n<\nb\n}\nfor some\na\n,\nb\nfrom\nM\n•\n{\nx\n:\nx\n>\na\n}\nfor some\na\nfrom\nM\n•\n{\nx\n:\nx\n<\na\n}\nfor some\na\nfrom\nM\nThen we define\nM\nto be\no-minimal\niff every\ndefinable\nsubset of\nM\nis a finite union of intervals and points.","source_id":"planetmath.ominimality","source_sha256":"47e01001f61334a5da29852dadec77639e06847818cf87720f67110be0e769e7","start":26}],"target_id":"concept.planetmath.ominimality","target_kind":"node","target_sha256":"3acbb399f86dd0e483b636b064961c143524f9c36686eaa105f539a035b5b51c"}],"concept.planetmath.openset":[{"id":"assertion.concept.planetmath.openset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Open set as stated in the captured PlanetMath entry openset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: In a metric space M a set O is called an open subset of M or just open , if for every x ∈ O there is an open ball S around x such that S ⊂ O .","support":[{"end":160,"quote":"In a\nmetric space\nM\na set\nO\nis called an\nopen subset\nof\nM\nor just\nopen\n, if for every\nx\n∈\nO\nthere is an open ball\nS\naround\nx\nsuch that\nS\n⊂\nO\n.","source_id":"planetmath.openset","source_sha256":"0a2ca658f0dc8a0af6e50a94fb2152cd8dadc3832aa8857ad2b7b6f0d9fe6b2d","start":18}],"target_id":"concept.planetmath.openset","target_kind":"node","target_sha256":"bd73542ba77c774920e11f3bf58651119c4fab2f2ae0626df1e3236af4331019"}],"concept.planetmath.operationsonrelations":[{"id":"assertion.concept.planetmath.operationsonrelations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Operations on relations as stated in the captured PlanetMath entry operationsonrelations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A02, 03E20) states: Recall that an n -ary relation ( n > 0 ) is a subset of a product of some n sets.","support":[{"end":129,"quote":"Recall that an\nn\n-ary\nrelation\n(\nn\n>\n0\n) is a subset of a\nproduct\nof some\nn\nsets.","source_id":"planetmath.operationsonrelations","source_sha256":"1dda6f9fe2e8b257063d7851a56a9aacaefb0f3281490d8e0d1454dd882d8151","start":48}],"target_id":"concept.planetmath.operationsonrelations","target_kind":"node","target_sha256":"8c23b66c9971ce766d98d1c553c0af8ad40324923e19cddbea3a22a55dab5318"}],"concept.planetmath.operatornorm":[{"id":"assertion.concept.planetmath.operatornorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Operator norm as stated in the captured PlanetMath entry operatornorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47L25, 46A32, 47A30) states: Definition Let A : 𝖵 → 𝖶 be a linear map between normed vector spaces 𝖵 and 𝖶 .","support":[{"end":107,"quote":"Definition\nLet\nA\n:\n𝖵\n→\n𝖶\nbe a\nlinear map\nbetween\nnormed vector spaces\n𝖵\nand\n𝖶\n.","source_id":"planetmath.operatornorm","source_sha256":"cf8e67ad7d027b8803b3f7c65cb968d86860a0c131d7263307bd26c5b6d82b07","start":28}],"target_id":"concept.planetmath.operatornorm","target_kind":"node","target_sha256":"a4a557f0c4442d9e9850014d9449ce36baf8f07b4def01fded8d42da0a6ed2e0"}],"concept.planetmath.orderedgeometry":[{"id":"assertion.concept.planetmath.orderedgeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered geometry as stated in the captured PlanetMath entry orderedgeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51G05) states: \\PMlinkescapephrase line segment \\PMlinkescapephrase generated by \\PMlinkescapephrase opposite sides \\PMlinkescapephrase end points 1 Definition Let ( A , B ) be a linear ordered geometry , where A = ( P , n , I ) is an incidence geometry , and B is a strict betweenness relation .","support":[{"end":315,"quote":"\\PMlinkescapephrase\nline segment\n\\PMlinkescapephrase\ngenerated by\n\\PMlinkescapephrase\nopposite sides\n\\PMlinkescapephrase\nend points\n1\nDefinition\nLet\n(\nA\n,\nB\n)\nbe a\nlinear ordered geometry\n, where\nA\n=\n(\nP\n,\nn\n,\nI\n)\nis an\nincidence geometry\n,\nand\nB\nis a\nstrict betweenness relation\n.","source_id":"planetmath.orderedgeometry","source_sha256":"6d44b35b4a147dac13fa98a07a966e70d7b538c7cc19487bd80e7fa71f8563eb","start":34}],"target_id":"concept.planetmath.orderedgeometry","target_kind":"node","target_sha256":"ae42b20605035200adc1497d25e26ecb616e63db7efa02e214cea68d3a4af995"}],"concept.planetmath.orderedpair":[{"id":"assertion.concept.planetmath.orderedpair","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered pair as stated in the captured PlanetMath entry orderedpair","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 70A05, 70G99) states: For any sets a and b , the ordered pair ( a , b ) is the set { { a } , { a , b } } .","support":[{"end":110,"quote":"For any sets\na\nand\nb\n, the\nordered pair\n(\na\n,\nb\n)\nis the set\n{\n{\na\n}\n,\n{\na\n,\nb\n}\n}\n.","source_id":"planetmath.orderedpair","source_sha256":"e827d7ec2e3406f7fedc55d135f1fcb8be793855c62b12d8dc39b355464e3e34","start":26}],"target_id":"concept.planetmath.orderedpair","target_kind":"node","target_sha256":"4ae1a4abfb0dfa233577af1172da20c29209c9dbbf18074d4a897f68e0f8a81c"}],"concept.planetmath.orderedtuplet":[{"id":"assertion.concept.planetmath.orderedtuplet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered tuplet as stated in the captured PlanetMath entry orderedtuplet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: The concept of ordered n -tuplet is the generalization of ordered pair to n items.","support":[{"end":112,"quote":"The\nconcept\nof ordered\nn\n-tuplet is the\ngeneralization\nof\nordered pair\nto\nn\nitems.","source_id":"planetmath.orderedtuplet","source_sha256":"457e29347bfac2aadf9f36b8d6db948bc93dc2c5277d806c2e766f688e9106fc","start":30}],"target_id":"concept.planetmath.orderedtuplet","target_kind":"node","target_sha256":"ad0c28b52281052b170ff11555bbba5f33ad6e5e70810a96a701fad42f0ff07d"}],"concept.planetmath.orderideal":[{"id":"assertion.concept.planetmath.orderideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Order ideal as stated in the captured PlanetMath entry orderideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06, 06A12) states: Order Ideals and Filters Let P be a poset. A subset I of P is said to be an order ideal if • I is a lower set : ↓ I = I , and • I is a directed set : I is non-empty, and every pair of elements in I has an upper bound in I .","support":[{"end":247,"quote":"Order Ideals and Filters\nLet\nP\nbe a poset. A subset\nI\nof\nP\nis said to be an\norder ideal\nif\n•\nI\nis a\nlower set\n:\n↓\nI\n=\nI\n, and\n•\nI\nis a\ndirected set\n:\nI\nis non-empty, and every pair of\nelements\nin\nI\nhas an\nupper bound\nin\nI\n.","source_id":"planetmath.orderideal","source_sha256":"e20e3873b7dc91724d9f01abb2716004cb1d129f62c371a8c200809565ac6fde","start":24}],"target_id":"concept.planetmath.orderideal","target_kind":"node","target_sha256":"fb8996f25067f311cfcbc38d4475e0c50ae800342cf568c6ebb8356cc766ad46"}],"concept.planetmath.orderingrelation":[{"id":"assertion.concept.planetmath.orderingrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordering relation as stated in the captured PlanetMath entry orderingrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 81-00, 18-00, 17B37, 18D10, 18D35, 16W30) states: Let S be a set. An ordering relation is a relation ≤ on S such that, for every a , b , c ∈ S : • Either a ≤ b , or b ≤ a , • If a ≤ b and b ≤ c , then a ≤ c , • If a ≤ b and b ≤ a , then a = b .","support":[{"end":230,"quote":"Let\nS\nbe a set. An\nordering relation\nis a\nrelation\n≤\non\nS\nsuch that, for every\na\n,\nb\n,\nc\n∈\nS\n:\n•\nEither\na\n≤\nb\n, or\nb\n≤\na\n,\n•\nIf\na\n≤\nb\nand\nb\n≤\nc\n, then\na\n≤\nc\n,\n•\nIf\na\n≤\nb\nand\nb\n≤\na\n, then\na\n=\nb\n.","source_id":"planetmath.orderingrelation","source_sha256":"8a26379ffa79789324e633a0b43469900f4c927e82d3757c0609a4d2232f6b28","start":36}],"target_id":"concept.planetmath.orderingrelation","target_kind":"node","target_sha256":"5220b5f8821a2cef0bb0e7ea23d7a08f0b6795f016f8f379f2964194287f8459"}],"concept.planetmath.orderpreservingmap":[{"id":"assertion.concept.planetmath.orderpreservingmap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Order-preserving map as stated in the captured PlanetMath entry orderpreservingmap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06) states: Order-preserving map from a poset L to a poset M is a function f such that ∀ x , y ∈ L : ( x ≥ y ⟹ f ( x ) ≥ f ( y ) ) .","support":[{"end":162,"quote":"Order-preserving map\nfrom a poset\nL\nto a poset\nM\nis a\nfunction\nf\nsuch that\n∀\nx\n,\ny\n∈\nL\n:\n(\nx\n≥\ny\n⟹\nf\n(\nx\n)\n≥\nf\n(\ny\n)\n)\n.","source_id":"planetmath.orderpreservingmap","source_sha256":"9c87a2595b06dee7d0424a02b370aca571c24c5fd0952182b982287f6a690a95","start":42}],"target_id":"concept.planetmath.orderpreservingmap","target_kind":"node","target_sha256":"c791cd0da18f179458d9b68cfdaa92365a8189bb3403537ec555d37b4b7ab784"}],"concept.planetmath.ordinalarithmetic":[{"id":"assertion.concept.planetmath.ordinalarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordinal arithmetic as stated in the captured PlanetMath entry ordinalarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: Ordinal arithmetic is the extension of normal arithmetic to the transfinite ordinal numbers.","support":[{"end":130,"quote":"Ordinal arithmetic\nis the\nextension\nof normal\narithmetic\nto the transfinite ordinal numbers.","source_id":"planetmath.ordinalarithmetic","source_sha256":"82c530b1c99e8d7b80ea5e216c2b57337846fa369d09f75c3ca5601b024503d4","start":38}],"target_id":"concept.planetmath.ordinalarithmetic","target_kind":"node","target_sha256":"53b53ac7b57c2b2137e68f9de30e22127ed513cf483c4fae9c070a826b0e0caa"}],"concept.planetmath.ordinalnumber":[{"id":"assertion.concept.planetmath.ordinalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordinal number as stated in the captured PlanetMath entry ordinalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: An ordinal number is a well ordered set S such that, for every x ∈ S , x = { z ∈ S ∣ z < x } (where < is the ordering relation on S ).","support":[{"end":164,"quote":"An\nordinal number\nis a well\nordered set\nS\nsuch that, for every\nx\n∈\nS\n,\nx\n=\n{\nz\n∈\nS\n∣\nz\n<\nx\n}\n(where\n<\nis the\nordering relation\non\nS\n).","source_id":"planetmath.ordinalnumber","source_sha256":"d5fc49adba72dcdc62cdc3268b14b9247be2895a50640736bb4b8cb075a75442","start":30}],"target_id":"concept.planetmath.ordinalnumber","target_kind":"node","target_sha256":"b68a1313821adedcbc91f75da237ff7fdbafa1f4d187006c6906f3a2ee9d5c11"}],"concept.planetmath.orthomodularlattice":[{"id":"assertion.concept.planetmath.orthomodularlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Orthomodular lattice as stated in the captured PlanetMath entry orthomodularlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06C15, 81P10, 03G12) states: Orthogonality Relations Let L be an orthocomplemented lattice and a , b ∈ L .","support":[{"end":119,"quote":"Orthogonality Relations\nLet\nL\nbe an\northocomplemented lattice\nand\na\n,\nb\n∈\nL\n.","source_id":"planetmath.orthomodularlattice","source_sha256":"836b7ccb2bceb285d247f45f77cb9148d0e7d63d8606cbd63dddb1d65b82e870","start":42}],"target_id":"concept.planetmath.orthomodularlattice","target_kind":"node","target_sha256":"857005670a9f7290883d8973bfc8f233c0d50a7c321494d14d6a4084a62de68a"}],"concept.planetmath.pa":[{"id":"assertion.concept.planetmath.pa","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"PA as stated in the captured PlanetMath entry pa","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F30) states: (PA) is the restriction of Peano’s axioms to a first order theory of .","support":[{"end":76,"quote":"(PA) is the\nrestriction\nof Peano’s axioms to a\nfirst order theory\nof .","source_id":"planetmath.pa","source_sha256":"02b48a51bdb37ee1cfeea65d22b8b14f1bede7f1dd075de3ee3363077853b253","start":6}],"target_id":"concept.planetmath.pa","target_kind":"node","target_sha256":"bafd3d634860a20646853b79264564759b8acf0cfc00dc3bb924d94abda30154"}],"concept.planetmath.pairingfunction":[{"id":"assertion.concept.planetmath.pairingfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pairing function as stated in the captured PlanetMath entry pairingfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: A pairing function is a function P : ℤ + 2 → ℤ + which establishes a one-to-one correspondence between ℤ + 2 and ℤ + .","support":[{"end":152,"quote":"A\npairing function\nis a\nfunction\nP\n:\nℤ\n+\n2\n→\nℤ\n+\nwhich establishes a\none-to-one correspondence\nbetween\nℤ\n+\n2\nand\nℤ\n+\n.","source_id":"planetmath.pairingfunction","source_sha256":"e8890cacb13d4ccce5373635d19c31df3e281862fbf131bf29838e25660d946a","start":34}],"target_id":"concept.planetmath.pairingfunction","target_kind":"node","target_sha256":"67d7e835079726c5aff824ec7f05e916f3ac8056d6476e03fc7fbfe654d72718"}],"concept.planetmath.pairwisedisjoint":[{"id":"assertion.concept.planetmath.pairwisedisjoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pairwise disjoint as stated in the captured PlanetMath entry pairwisedisjoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Definition Suppose { E α ∣ α ∈ I } is an arbitrary collection of sets.","support":[{"end":106,"quote":"Definition\nSuppose\n{\nE\nα\n∣\nα\n∈\nI\n}\nis an arbitrary\ncollection\nof sets.","source_id":"planetmath.pairwisedisjoint","source_sha256":"2148d00716b8c564ed73687b8272cf80173e336bb2f1cca74ad65b8be3b2c06b","start":36}],"target_id":"concept.planetmath.pairwisedisjoint","target_kind":"node","target_sha256":"e24d0b2313468cadb7c30b4eda28b32007a7f436d5fbf305d6a0f9158a956d89"}],"concept.planetmath.paracompacttopologicalspace":[{"id":"assertion.concept.planetmath.paracompacttopologicalspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paracompact topological space as stated in the captured PlanetMath entry paracompacttopologicalspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00, 55-00) states: A topological space X is said to be paracompact if every open cover of X has a locally finite open refinement.","support":[{"end":170,"quote":"A\ntopological space\nX\nis said to be\nparacompact\nif every\nopen cover\nof\nX\nhas a\nlocally finite\nopen refinement.","source_id":"planetmath.paracompacttopologicalspace","source_sha256":"b59db3ba7554d55bc70f961ac11985fc02a2a39a75ced840520c4e37c4f70506","start":60}],"target_id":"concept.planetmath.paracompacttopologicalspace","target_kind":"node","target_sha256":"f3d616c7043b7198aea96ea6c5747a05ecd24065720901ef70010d412a783618"}],"concept.planetmath.paradox":[{"id":"assertion.concept.planetmath.paradox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paradox as stated in the captured PlanetMath entry paradox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03A05, 03B99) states: A paradox is an assertion that is apparently self-contradictory, though based on a valid deduction from acceptable premises .","support":[{"end":141,"quote":"A\nparadox\nis an assertion that is apparently self-contradictory, though based on a valid\ndeduction\nfrom acceptable\npremises\n.","source_id":"planetmath.paradox","source_sha256":"54d4574d2901e3fa64595bcd021ca4fa93277befc8898fdbc5237db23285d538","start":16}],"target_id":"concept.planetmath.paradox","target_kind":"node","target_sha256":"07fbe3c3b0ef8249aadaed8dc9bcd5706571c3a477f6bd77292b5c637dfe4f55"}],"concept.planetmath.paradoxofthebinarytree":[{"id":"assertion.concept.planetmath.paradoxofthebinarytree","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paradox of the binary tree as stated in the captured PlanetMath entry paradoxofthebinarytree","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E75, 03E15) states: The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node.","support":[{"end":230,"quote":"The\ncomplete infinite binary tree\nis a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two\nchildren\nwhich are not children of any other node.","source_id":"planetmath.paradoxofthebinarytree","source_sha256":"d3079b07db1c67c5bad53130ba3dbd891b6ce6d94bc06add9aa074fc4b4319e4","start":54}],"target_id":"concept.planetmath.paradoxofthebinarytree","target_kind":"node","target_sha256":"928bf441c8f321193dd18242ce5c64cc959eaf43222540d8e508304bb69dd300"}],"concept.planetmath.partialalgebraicsystem":[{"id":"assertion.concept.planetmath.partialalgebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partial algebraic system as stated in the captured PlanetMath entry partialalgebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 08A55, 08A62) states: Let λ be a cardinal . A partial function f : A λ → A is called a partial operation on A .","support":[{"end":139,"quote":"Let\nλ\nbe a\ncardinal\n. A\npartial function\nf\n:\nA\nλ\n→\nA\nis called a\npartial operation\non\nA\n.","source_id":"planetmath.partialalgebraicsystem","source_sha256":"d33d86acd322249793de773e7457024968c7a27a218acd1d66bc04fb542b3831","start":50}],"target_id":"concept.planetmath.partialalgebraicsystem","target_kind":"node","target_sha256":"5c84e859b6e026944280fdcf59e0e15aad9f863ceb34a1df78d2f4c9c89cdec8"}],"concept.planetmath.partialderivative":[{"id":"assertion.concept.planetmath.partialderivative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partial derivative as stated in the captured PlanetMath entry partialderivative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B12) states: The partial derivative of a multivariable function f is simply its derivative with respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","support":[{"end":242,"quote":"The\npartial derivative\nof a multivariable function\nf\nis simply its\nderivative\nwith respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","source_id":"planetmath.partialderivative","source_sha256":"ba1f9683b488f9ce08173cdb68aab42b336622be92ac0aa2161477519fa99fa7","start":38}],"target_id":"concept.planetmath.partialderivative","target_kind":"node","target_sha256":"59100b9fb1b5843cc25a64faec2a39a293f992193cb306c348a14a45269272e8"}],"concept.planetmath.partiallyorderedgroup":[{"id":"assertion.concept.planetmath.partiallyorderedgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partially ordered group as stated in the captured PlanetMath entry partiallyorderedgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06F05, 06F20, 06F15, 20F60) states: A partially ordered group is a group G that is a poset at the same time, such that if a , b ∈ G and a ≤ b , then 1.","support":[{"end":163,"quote":"A\npartially ordered group\nis a group\nG\nthat is a poset at the same time, such that if\na\n,\nb\n∈\nG\nand\na\n≤\nb\n, then\n1.","source_id":"planetmath.partiallyorderedgroup","source_sha256":"cc52d72cc316db86073f8deb7c72a1c8c29773f7ad404558c90737784b9f3dd5","start":48}],"target_id":"concept.planetmath.partiallyorderedgroup","target_kind":"node","target_sha256":"074a60a01af14dd077b702f1626eedc9eb5060f6c33a1763080bd9b0cb262170"}],"concept.planetmath.peanoarithmetic":[{"id":"assertion.concept.planetmath.peanoarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Peano arithmetic as stated in the captured PlanetMath entry peanoarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03F30) states: Peano’s axioms are a definition of the set of natural numbers, denoted ℕ .","support":[{"end":108,"quote":"Peano’s axioms\nare a\ndefinition\nof the set of natural numbers, denoted\nℕ\n.","source_id":"planetmath.peanoarithmetic","source_sha256":"94f5c1ab9791a58d7540f70e1d8e35c2996ed43763fce6b6cb1618ceac905c5a","start":34}],"target_id":"concept.planetmath.peanoarithmetic","target_kind":"node","target_sha256":"c019ef5e54be87a0cc8d428b775d75a6b5666381a2b63d963f253354df67669a"}],"concept.planetmath.perfectset":[{"id":"assertion.concept.planetmath.perfectset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Perfect set as stated in the captured PlanetMath entry perfectset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: A set is called perfect if it is equal to the set of its limit points .","support":[{"end":95,"quote":"A set is called\nperfect\nif it is equal to the set of its\nlimit points\n.","source_id":"planetmath.perfectset","source_sha256":"2eb107f0c832928784f0b7c156eea5071c7b829ac1145d23d37cdbe0ac4c24a6","start":24}],"target_id":"concept.planetmath.perfectset","target_kind":"node","target_sha256":"864f38244236dd718374e20cbccca06d4d84d83310bd7a200ad3381a51ccbb1f"}],"concept.planetmath.planetmath":[{"id":"assertion.concept.planetmath.planetmath","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"PlanetMath as stated in the captured PlanetMath entry planetmath","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A65, 01A61) states: PlanetMath is a free, collaborative, online mathematics encyclopedia.","support":[{"end":91,"quote":"PlanetMath\nis a free, collaborative, online mathematics encyclopedia.","source_id":"planetmath.planetmath","source_sha256":"b2c4dffd2292a7cce84277da7f21539147a51f7f6668520cbacab1d646e5f922","start":22}],"target_id":"concept.planetmath.planetmath","target_kind":"node","target_sha256":"a9b6ec34351198f9eadd5ee8881edd07313287954d6990db669faec2644b9112"}],"concept.planetmath.pointedset":[{"id":"assertion.concept.planetmath.pointedset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pointed set as stated in the captured PlanetMath entry pointedset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: 0.1 Definition A pointed set is an ordered pair ( A , a ) such that A is a set and a ∈ A .","support":[{"end":114,"quote":"0.1\nDefinition\nA\npointed set\nis an\nordered pair\n(\nA\n,\na\n)\nsuch that\nA\nis a set and\na\n∈\nA\n.","source_id":"planetmath.pointedset","source_sha256":"91fbc7c82b5156cba87e50b517f83ef956ebe94e97e0c68fa1bef76d4c418521","start":24}],"target_id":"concept.planetmath.pointedset","target_kind":"node","target_sha256":"7c26b545f0b9b2adc75b98f3b1577c31172db78b866ccb89ce63eb3a40d699f9"}],"concept.planetmath.pointwise":[{"id":"assertion.concept.planetmath.pointwise","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pointwise as stated in the captured PlanetMath entry pointwise","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 08-00) states: When concepts (properties, operations , etc.) on a set Y are extended to functions f : X ⟶ Y by treating each function value f ⁢ ( x ) in isolation, the extended concept is often qualified with the word pointwise .","support":[{"end":234,"quote":"When\nconcepts\n(properties,\noperations\n, etc.) on a set\nY\nare extended to\nfunctions\nf\n:\nX\n⟶\nY\nby treating each\nfunction value\nf\n⁢\n(\nx\n)\nin isolation, the\nextended concept is often qualified with the word\npointwise\n.","source_id":"planetmath.pointwise","source_sha256":"2789971a3ea6b51e63f907b0317bf4e90e5343ac3711b8d68f5b89789e02a372","start":20}],"target_id":"concept.planetmath.pointwise","target_kind":"node","target_sha256":"9ec64eec502c1e9a42fb96beda24bad3530c24c82279ff5b3b9916536ce23052"}],"concept.planetmath.polishnotation":[{"id":"assertion.concept.planetmath.polishnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polish notation as stated in the captured PlanetMath entry polishnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","support":[{"end":324,"quote":"Whereas\noperators\nare traditionally placed between operands, with parentheses used to override\noperator precedence\n, it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","source_id":"planetmath.polishnotation","source_sha256":"b1ba8fabe09877ddf6ca72e689716c33e15da857e7788659f434b6a8e3697d79","start":32}],"target_id":"concept.planetmath.polishnotation","target_kind":"node","target_sha256":"19ee969189f4866e4663c58209b0b91c24aef6d18f086e9f540cf6813331c578"}],"concept.planetmath.polyadicalgebra":[{"id":"assertion.concept.planetmath.polyadicalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polyadic algebra as stated in the captured PlanetMath entry polyadicalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: A polyadic algebra is a quadruple ( B , V , ∃ , S ) , where ( B , V , ∃ ) is a quantifier algebra , and S is a function from the set of functions on V to the set of endomorphisms on the Boolean algebra B , in other words S : V V → End ⁡ ( B ) such that 1.","support":[{"end":289,"quote":"A\npolyadic algebra\nis a quadruple\n(\nB\n,\nV\n,\n∃\n,\nS\n)\n, where\n(\nB\n,\nV\n,\n∃\n)\nis a\nquantifier algebra\n, and\nS\nis a\nfunction\nfrom the set of functions on\nV\nto the set of\nendomorphisms\non the\nBoolean algebra\nB\n, in other words\nS\n:\nV\nV\n→\nEnd\n⁡\n(\nB\n)\nsuch that\n1.","source_id":"planetmath.polyadicalgebra","source_sha256":"abccf25124c0ceed1c3f84ee5ab600a9e10dfebe0cd9301858bff74636627b6a","start":34}],"target_id":"concept.planetmath.polyadicalgebra","target_kind":"node","target_sha256":"3f1c30dd695c0882021c1a0427e922446e3f3e64bda9bcc9b8f5eb5dcc939965"}],"concept.planetmath.polyadicalgebrawithequality":[{"id":"assertion.concept.planetmath.polyadicalgebrawithequality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polyadic algebra with equality as stated in the captured PlanetMath entry polyadicalgebrawithequality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: Let A = ( B , V , ∃ , S ) be a polyadic algebra . An equality predicate on A is a function E : V × V → B such that 1.","support":[{"end":179,"quote":"Let\nA\n=\n(\nB\n,\nV\n,\n∃\n,\nS\n)\nbe a\npolyadic algebra\n. An\nequality predicate\non\nA\nis a\nfunction\nE\n:\nV\n×\nV\n→\nB\nsuch that\n1.","source_id":"planetmath.polyadicalgebrawithequality","source_sha256":"eccaed36205cd36e5f9db78b9624289e49a49df792ef97ee650a0b519e66c2f2","start":62}],"target_id":"concept.planetmath.polyadicalgebrawithequality","target_kind":"node","target_sha256":"fa79f264e625f3328cf099ade91b09e9f046ff31dfbc09e9f795b4ad757af515"}],"concept.planetmath.polynomialring":[{"id":"assertion.concept.planetmath.polynomialring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomial ring as stated in the captured PlanetMath entry polynomialring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11C08, 12E05, 13P05, 17B66, 16W10, 70G65, 17B45) states: 1 Polynomial rings in one variable Let R be a ring.","support":[{"end":83,"quote":"1\nPolynomial rings in one variable\nLet\nR\nbe a ring.","source_id":"planetmath.polynomialring","source_sha256":"a26ae44f4e2950749a1fea104b43894dbd401d565b7ceff2231b31a19188b119","start":32}],"target_id":"concept.planetmath.polynomialring","target_kind":"node","target_sha256":"4970371625279e5d384c8051c2ac9bbe5e0b6e9a66b162e98bedbf43867ef5e1"}],"concept.planetmath.polynomialsinalgebraicsystems":[{"id":"assertion.concept.planetmath.polynomialsinalgebraicsystems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomials in algebraic systems as stated in the captured PlanetMath entry polynomialsinalgebraicsystems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A40) states: Polynomials in an Algebraic System Let ( A , O ) be an algebraic system .","support":[{"end":139,"quote":"Polynomials in an Algebraic System\nLet\n(\nA\n,\nO\n)\nbe an\nalgebraic system\n.","source_id":"planetmath.polynomialsinalgebraicsystems","source_sha256":"466128359387d7760884a0de1b18d318b3fc102685710fd165865a0277bcc4a8","start":66}],"target_id":"concept.planetmath.polynomialsinalgebraicsystems","target_kind":"node","target_sha256":"77314d261711f77557fcebfc4baddf136d1e9a0a2aa052cc1f518ab4a3beaa30"}],"concept.planetmath.positiveelement":[{"id":"assertion.concept.planetmath.positiveelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Positive element as stated in the captured PlanetMath entry positiveelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46L05, 47L07, 47A05) states: Let H be a complex Hilbert space . Let T : H ⟶ H be a bounded operator in H .","support":[{"end":111,"quote":"Let\nH\nbe a complex\nHilbert space\n. Let\nT\n:\nH\n⟶\nH\nbe a\nbounded operator\nin\nH\n.","source_id":"planetmath.positiveelement","source_sha256":"5691384f085f9536e49d7ba6539028cf29aef4d4ecf64b6f1e65be4781f8cb27","start":34}],"target_id":"concept.planetmath.positiveelement","target_kind":"node","target_sha256":"2f9f731be8b75cf74284260b97a28acc95c980bdb1cc4c044f096077b07f3c28"}],"concept.planetmath.postsystem":[{"id":"assertion.concept.planetmath.postsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Post system as stated in the captured PlanetMath entry postsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q42, 03D03) states: Introduction A Post canonical system (or Post system for short) 𝔓 is a triple ( Σ , X , P ) , such that 1.","support":[{"end":130,"quote":"Introduction\nA\nPost canonical system\n(or\nPost system\nfor short)\n𝔓\nis a triple\n(\nΣ\n,\nX\n,\nP\n)\n, such that\n1.","source_id":"planetmath.postsystem","source_sha256":"4bf669681f3ab4d24a77f7ffaf83e3d6bba8064936f073bcc57c1d918cca272e","start":24}],"target_id":"concept.planetmath.postsystem","target_kind":"node","target_sha256":"51b1a24f94352c9283b24b142b70b22b6b6800697579102aaab226ebfea2b078"}],"concept.planetmath.powerset":[{"id":"assertion.concept.planetmath.powerset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Power set as stated in the captured PlanetMath entry powerset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 03E10, 37-01) states: Definition If X is a set, then the power set of X , denoted by 𝒫 ⁢ ( X ) , is the set whose elements are the subsets of X .","support":[{"end":143,"quote":"Definition\nIf\nX\nis a set, then the\npower set\nof\nX\n, denoted by\n𝒫\n⁢\n(\nX\n)\n, is the\nset whose\nelements\nare the subsets of\nX\n.","source_id":"planetmath.powerset","source_sha256":"b9c2fcc6295830e69b18088ebcf5ba30512c5b43d20c4c9e9071e9fe528b9eb6","start":20}],"target_id":"concept.planetmath.powerset","target_kind":"node","target_sha256":"4b4955b02881c5d2f34b4ef9bc1d12068a8a00d20021dec92fe85fcec2466898"}],"concept.planetmath.predicativism":[{"id":"assertion.concept.planetmath.predicativism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Predicativism as stated in the captured PlanetMath entry predicativism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05) states: Predicativism Contents: 1 Initial definitions 2 The vicious circle principle 3 The scope of the vicious circle principle 4 Russell’s threefold formulation in Principia mathematica 5 Predicative reasoning in the ramified theory of types 6 Towards the predicative concept of set 7 Predicative philosophy of mathematics 1 Initial definitions In the literature on the foundations of mathematics the range of the concept predicativism is formulated in two divergent formulations.","support":[{"end":502,"quote":"Predicativism\nContents:\n1\nInitial definitions\n2\nThe vicious circle principle\n3\nThe scope of the vicious circle principle\n4\nRussell’s threefold formulation in\nPrincipia mathematica\n5\nPredicative reasoning in the ramified theory of types\n6\nTowards the predicative concept of set\n7\nPredicative philosophy of mathematics\n1\nInitial definitions\nIn the literature on the\nfoundations of mathematics\nthe range of the\nconcept\npredicativism is formulated in two divergent formulations.","source_id":"planetmath.predicativism","source_sha256":"aa3a9a0ffa8e5ba8a34a3108a642ec301952b02cba87fbf9ea3f0a980e5caf86","start":28}],"target_id":"concept.planetmath.predicativism","target_kind":"node","target_sha256":"e926b32f8021d947035a5640196e967be9b74197943e12368e6da90a346d9ddf"}],"concept.planetmath.preorder":[{"id":"assertion.concept.planetmath.preorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pre-order as stated in the captured PlanetMath entry preorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: Definition A pre-order on a set S is a relation ≲ on S satisfying the following two axioms: reflexivity : s ≲ s for all s ∈ S , and transitivity : If s ≲ t and t ≲ u , then s ≲ u ; for all s , t , u ∈ S .","support":[{"end":224,"quote":"Definition\nA\npre-order\non a set\nS\nis a\nrelation\n≲\non\nS\nsatisfying the following two axioms:\nreflexivity\n:\ns\n≲\ns\nfor all\ns\n∈\nS\n, and\ntransitivity\n: If\ns\n≲\nt\nand\nt\n≲\nu\n, then\ns\n≲\nu\n; for all\ns\n,\nt\n,\nu\n∈\nS\n.","source_id":"planetmath.preorder","source_sha256":"8c9d4341312a608fa261f3bc23182ae7ac043e23b0ae4579a559aca7541388b2","start":20}],"target_id":"concept.planetmath.preorder","target_kind":"node","target_sha256":"a149426016669cb15950e8afec4045838c323c5e04eaa7eea449db2d13ad168d"}],"concept.planetmath.presentationofagroup":[{"id":"assertion.concept.planetmath.presentationofagroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Presentation of a group as stated in the captured PlanetMath entry presentationofagroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05, 20F05) states: A presentation of a group G is a description of G in terms of generators and relations (sometimes also known as relators).","support":[{"end":170,"quote":"A\npresentation\nof a group\nG\nis a description of\nG\nin terms of\ngenerators and relations (sometimes also known as relators).","source_id":"planetmath.presentationofagroup","source_sha256":"62df8c310671bfad772a713449a6a6d48d4ea5711d6a167f3a66b8294bc1b187","start":48}],"target_id":"concept.planetmath.presentationofagroup","target_kind":"node","target_sha256":"8a7d4012e827dec821347a7a5de1ae0634d441b5f37f8d27b16d48693363f18c"}],"concept.planetmath.preservationandreflection":[{"id":"assertion.concept.planetmath.preservationandreflection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Preservation and reflection as stated in the captured PlanetMath entry preservationandreflection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A35) states: In mathematics, the word “preserve” usually means the “preservation of properties”.","support":[{"end":139,"quote":"In mathematics, the word “preserve” usually means the “preservation of properties”.","source_id":"planetmath.preservationandreflection","source_sha256":"04d427176a71b0e52368b5de3da2000a9f5658e9b1dd2e8742868d8696243608","start":56}],"target_id":"concept.planetmath.preservationandreflection","target_kind":"node","target_sha256":"26c6cc55c714532c7d59fd4f2ace60f1e671cd0123ef1d81345905dd7c3c0c6a"}],"concept.planetmath.primitiverecursivefunction":[{"id":"assertion.concept.planetmath.primitiverecursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Primitive recursive function as stated in the captured PlanetMath entry primitiverecursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: To define what a primitive recursive function is, the following notations are used: ℱ = ⋃ { F k ∣ k ∈ ℕ } , where for each k ∈ ℕ ⁢ , ⁢ F k = { f ∣ f : ℕ k → ℕ } .","support":[{"end":220,"quote":"To define what a\nprimitive recursive function\nis, the following notations are used:\nℱ\n=\n⋃\n{\nF\nk\n∣\nk\n∈\nℕ\n}\n, where for each\nk\n∈\nℕ\n⁢\n,\n⁢\nF\nk\n=\n{\nf\n∣\nf\n:\nℕ\nk\n→\nℕ\n}\n.","source_id":"planetmath.primitiverecursivefunction","source_sha256":"8df37f9e3b01dafaa1f640bf9299ca8bba29db9360462cefcc9e6e26535b8089","start":58}],"target_id":"concept.planetmath.primitiverecursivefunction","target_kind":"node","target_sha256":"e80e4dce4512a9395495a9e21db3520ffdfa37893a15c6a90e21ddc28b71cba2"}],"concept.planetmath.principalideal":[{"id":"assertion.concept.planetmath.principalideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Principal ideal as stated in the captured PlanetMath entry principalideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13A15, 16D25, 81-00, 82-00, 83-00, 46L05) states: Let R be a ring and let a ∈ R . The principal left (resp.","support":[{"end":89,"quote":"Let\nR\nbe a ring and let\na\n∈\nR\n. The principal left (resp.","source_id":"planetmath.principalideal","source_sha256":"e195a825dc98a566ddb7f5d639a089f2f55f5cb612a057bee12af9f19190f593","start":32}],"target_id":"concept.planetmath.principalideal","target_kind":"node","target_sha256":"633b9b1852370f9da7de1602b0675c1eccd928fb991859072a9a6996026e8480"}],"concept.planetmath.probabilitydistributionfunction":[{"id":"assertion.concept.planetmath.probabilitydistributionfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Probability distribution function as stated in the captured PlanetMath entry probabilitydistributionfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60E99) states: 1 Definition Let ( Ω , 𝔅 , μ ) be a measure space . A probability distribution function on Ω is a function f : Ω ⟶ ℝ such that: 1.","support":[{"end":198,"quote":"1\nDefinition\nLet\n(\nΩ\n,\n𝔅\n,\nμ\n)\nbe a\nmeasure space\n. A\nprobability distribution function\non\nΩ\nis a\nfunction\nf\n:\nΩ\n⟶\nℝ\nsuch that:\n1.","source_id":"planetmath.probabilitydistributionfunction","source_sha256":"67167dcda862d39465debfeafbd06bc850366e1dfb6bd69f93c530c72e3bf9d3","start":68}],"target_id":"concept.planetmath.probabilitydistributionfunction","target_kind":"node","target_sha256":"2d04d07fe37da44c656b87e37107d9c48f6e5bf283460e6093f33888676426e2"}],"concept.planetmath.producttopology":[{"id":"assertion.concept.planetmath.producttopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Product topology as stated in the captured PlanetMath entry producttopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B10) states: Definition Let ( ( X α , 𝒯 α ) ) α ∈ A be a family of topological spaces , and let Y be the Cartesian product ( http://planetmath.org/GeneralizedCartesianProduct ) of the sets X α , that is Y = ∏ α ∈ A X α .","support":[{"end":241,"quote":"Definition\nLet\n(\n(\nX\nα\n,\n𝒯\nα\n)\n)\nα\n∈\nA\nbe a family of\ntopological spaces\n, and let\nY\nbe the\nCartesian product\n(\nhttp://planetmath.org/GeneralizedCartesianProduct\n)\nof the sets\nX\nα\n, that is\nY\n=\n∏\nα\n∈\nA\nX\nα\n.","source_id":"planetmath.producttopology","source_sha256":"ab4c3d6939ed8c0e230b8f656e2a45050f96b0ee16f74d5768d3e4d8e0708dc4","start":34}],"target_id":"concept.planetmath.producttopology","target_kind":"node","target_sha256":"b5b59617b9c8a28d5a73d75171b46340a36b81733eafeb437ddc47ec8706e20f"}],"concept.planetmath.projectivebasis":[{"id":"assertion.concept.planetmath.projectivebasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Projective basis as stated in the captured PlanetMath entry projectivebasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: In the parent entry, we see how one may define dimension of a projective space inductively, from its subspaces starting with a point, then a line, and working its way up.","support":[{"end":204,"quote":"In the parent entry, we see how one may define\ndimension\nof a projective space inductively, from its\nsubspaces\nstarting with a point, then a line, and working its way up.","source_id":"planetmath.projectivebasis","source_sha256":"5fc35d3835c2e83c9987a8826d291fc834e574440feef0a840407a1090d59ace","start":34}],"target_id":"concept.planetmath.projectivebasis","target_kind":"node","target_sha256":"64aeb42e87e2bfb8304e4b4a44d490fa29893d106b80ef3df7199d37fb2d9bcb"}],"concept.planetmath.propositionalcalculus":[{"id":"assertion.concept.planetmath.propositionalcalculus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Propositional calculus as stated in the captured PlanetMath entry propositionalcalculus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03C05, 03B22, 03B05) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase angle \\PMlinkescapephrase Angle \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase complete \\PMlinkescapephrase Complete \\PMlinkescapephrase component \\PMlinkescapephrase Component \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formalism \\PMlinkescapephrase Formalism \\PMlinkescapephrase holder \\PMlinkescapephrase Holder \\PMlinkescapephrase holders \\PMlinkescapephrase Holders \\PMlinkescapephrase origin \\PMlinkescapephrase Origin \\PMlinkescapephrase plus \\PMlinkescapephrase Plus \\PMlinkescapephrase point \\PMlinkescapephrase Point \\PMlinkescapephrase points \\PMlinkescapephrase Points \\PMlinkescapephrase right \\PMlinkescapephrase Right \\PMlinkescapephrase utility \\PMlinkescapephrase Utility A propositional calculus is a formal system whose expressions represent formal objects known as propositions and whose distinguished relations among expressions represent existing relations among propositions.","support":[{"end":1081,"quote":"\\PMlinkescapephrase\nadapted\n\\PMlinkescapephrase\nAdapted\n\\PMlinkescapephrase\nangle\n\\PMlinkescapephrase\nAngle\n\\PMlinkescapephrase\ncalculus\n\\PMlinkescapephrase\nCalculus\n\\PMlinkescapephrase\ncomplete\n\\PMlinkescapephrase\nComplete\n\\PMlinkescapephrase\ncomponent\n\\PMlinkescapephrase\nComponent\n\\PMlinkescapephrase\ndegree\n\\PMlinkescapephrase\nDegree\n\\PMlinkescapephrase\nformalism\n\\PMlinkescapephrase\nFormalism\n\\PMlinkescapephrase\nholder\n\\PMlinkescapephrase\nHolder\n\\PMlinkescapephrase\nholders\n\\PMlinkescapephrase\nHolders\n\\PMlinkescapephrase\norigin\n\\PMlinkescapephrase\nOrigin\n\\PMlinkescapephrase\nplus\n\\PMlinkescapephrase\nPlus\n\\PMlinkescapephrase\npoint\n\\PMlinkescapephrase\nPoint\n\\PMlinkescapephrase\npoints\n\\PMlinkescapephrase\nPoints\n\\PMlinkescapephrase\nright\n\\PMlinkescapephrase\nRight\n\\PMlinkescapephrase\nutility\n\\PMlinkescapephrase\nUtility\nA\npropositional calculus\nis a\nformal system\nwhose expressions\nrepresent\nformal objects\nknown as\npropositions\nand whose distinguished\nrelations\namong expressions represent existing relations among propositions.","source_id":"planetmath.propositionalcalculus","source_sha256":"91026f8fd674efb0838cc9384d5bd5113f4b0795413a1a7ed976288a72435c21","start":46}],"target_id":"concept.planetmath.propositionalcalculus","target_kind":"node","target_sha256":"096c1f22fc27e6f9d7cd78cdb138b433060f57bfed385b274b022f934c5bfd06"}],"concept.planetmath.propositionallogic":[{"id":"assertion.concept.planetmath.propositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Propositional logic as stated in the captured PlanetMath entry propositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A propositional logic is a logic in which the only objects are propositions , that is, objects which themselves have truth values.","support":[{"end":170,"quote":"A\npropositional logic\nis a logic in which the only objects are\npropositions\n, that is, objects which themselves have truth values.","source_id":"planetmath.propositionallogic","source_sha256":"b0c50eb2314d7a3c9323d24cc306ceca8835f819862c358ab36812ce256f395c","start":40}],"target_id":"concept.planetmath.propositionallogic","target_kind":"node","target_sha256":"4dc9b019fb86ca8d27108ed998dae02247e5db8a51482180d1035c0e34c94608"}],"concept.planetmath.pseudograph":[{"id":"assertion.concept.planetmath.pseudograph","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pseudograph as stated in the captured PlanetMath entry pseudograph","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C75) states: A pseudograph is a graph that allows both parallel edges and loops.","support":[{"end":91,"quote":"A\npseudograph\nis a graph that allows both\nparallel edges\nand loops.","source_id":"planetmath.pseudograph","source_sha256":"a40f3cd7fee17b743549d7858b8d7ca0cc2ce578af7cd090df065b89805d6039","start":24}],"target_id":"concept.planetmath.pseudograph","target_kind":"node","target_sha256":"4e734c597f6b196933d98f3528bba348595a76acdd29c8e8e332997dfa56287a"}],"concept.planetmath.pseudometrictopology":[{"id":"assertion.concept.planetmath.pseudometrictopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pseudometric topology as stated in the captured PlanetMath entry pseudometrictopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Let ( X , d ) be a pseudometric space . As in a metric space , we define B ε ⁢ ( x ) = { y ∈ X ∣ d ⁢ ( x , y ) < ε } .","support":[{"end":162,"quote":"Let\n(\nX\n,\nd\n)\nbe a\npseudometric space\n. As in a\nmetric space\n, we define\nB\nε\n⁢\n(\nx\n)\n=\n{\ny\n∈\nX\n∣\nd\n⁢\n(\nx\n,\ny\n)\n<\nε\n}\n.","source_id":"planetmath.pseudometrictopology","source_sha256":"46dde0635840cd0b75c3ffdc32916ac9c3c678eb211421cad66a70735d3be428","start":44}],"target_id":"concept.planetmath.pseudometrictopology","target_kind":"node","target_sha256":"d99524e62c93d5adc99743b22c3ee1fe7b650dbc0f16e502e086e0a893a5ed60"}],"concept.planetmath.quantifier":[{"id":"assertion.concept.planetmath.quantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantifier as stated in the captured PlanetMath entry quantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Introduction A quantifier is a logical symbol which makes an assertion about the set of values which make one or more formulas true.","support":[{"end":154,"quote":"Introduction\nA\nquantifier\nis a\nlogical symbol\nwhich makes an assertion about the set of values which make one or more\nformulas\ntrue.","source_id":"planetmath.quantifier","source_sha256":"91d93149420c9b74764dd39d88023fc9495ef5692c0ee40653b32e6e17d53398","start":22}],"target_id":"concept.planetmath.quantifier","target_kind":"node","target_sha256":"21a4963dd0d358700d14b4f0cd0e5769ee08b913634065146ecfad26d5206f83"}],"concept.planetmath.quantifierfree":[{"id":"assertion.concept.planetmath.quantifierfree","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantifier free as stated in the captured PlanetMath entry quantifierfree","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C10, 03C07, 03B10) states: Let L be a first order language . A formula ψ is quantifier free iff it contains no quantifiers .","support":[{"end":129,"quote":"Let\nL\nbe a\nfirst order language\n.\nA\nformula\nψ\nis\nquantifier free\niff it contains no\nquantifiers\n.","source_id":"planetmath.quantifierfree","source_sha256":"7fb57f9f2c1d368cb6d7044aaa9bc84019841b68339570de848c0103ded8be08","start":32}],"target_id":"concept.planetmath.quantifierfree","target_kind":"node","target_sha256":"62ac8f2f58bdfd5461cbdbf0dd8708e055f9f7a2234de1eef5dbc83e77f657dd"}],"concept.planetmath.quantumfieldtheoriesqft":[{"id":"assertion.concept.planetmath.quantumfieldtheoriesqft","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantum field theories (QFT) as stated in the captured PlanetMath entry quantumfieldtheoriesqft","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U99, 81T80, 81T75, 81T70, 81T60, 81T40, 81T25, 81T18, 81T13, 81T10, 81T05) states: This topic links the general framework of quantum field theories to group symmetries and other relevant mathematical concepts utilized to represent quantum fields and their fundamental properties.","support":[{"end":254,"quote":"This topic links the general framework of\nquantum field theories\nto group\nsymmetries\nand other relevant mathematical concepts utilized to\nrepresent\nquantum fields\nand their fundamental properties.","source_id":"planetmath.quantumfieldtheoriesqft","source_sha256":"d0aab612d8a423d83af13cebb70a1b736af3bd05baaa88043e2cd830a43a4dae","start":58}],"target_id":"concept.planetmath.quantumfieldtheoriesqft","target_kind":"node","target_sha256":"1a28f18ee0dabdb45a3df9b763d374305e372eb9283007a47040a5d432a69b43"}],"concept.planetmath.quantumlogic":[{"id":"assertion.concept.planetmath.quantumlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantum logic as stated in the captured PlanetMath entry quantumlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G12) states: Introduction In classical physics, results regarding experiments performed on physical propositions obey classical propositional logic .","support":[{"end":164,"quote":"Introduction\nIn classical physics, results regarding experiments performed on physical\npropositions\nobey classical\npropositional logic\n.","source_id":"planetmath.quantumlogic","source_sha256":"d92afdcdda38e1833789fd7466c2e4def043cc1c000c8caf9a7b49dc15be9107","start":28}],"target_id":"concept.planetmath.quantumlogic","target_kind":"node","target_sha256":"280902180cf48a180969fe6c60649b9b06e54ccacb9080418bb08bab6ddf9970"}],"concept.planetmath.quotientgroup":[{"id":"assertion.concept.planetmath.quotientgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient group as stated in the captured PlanetMath entry quotientgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20-00) states: Before defining quotient groups , some preliminary definitions must be introduced and a few established.","support":[{"end":135,"quote":"Before defining\nquotient groups\n, some preliminary\ndefinitions\nmust be introduced and a few  established.","source_id":"planetmath.quotientgroup","source_sha256":"2947b52ab0e622c2df844cbfe4400e233f5ff072d30abf64da6c060628e58a1f","start":30}],"target_id":"concept.planetmath.quotientgroup","target_kind":"node","target_sha256":"dc6cad6906cc55dc307816bc7df3a2259b7b5b0ef23c09fe27f191741a5dea8c"}],"concept.planetmath.quotientstructure":[{"id":"assertion.concept.planetmath.quotientstructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient structure as stated in the captured PlanetMath entry quotientstructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , 𝔄 a structure for Σ , and ∼ a congruence on 𝔄 .","support":[{"end":114,"quote":"Let\nΣ\nbe a fixed\nsignature\n,\n𝔄\na\nstructure\nfor\nΣ\n, and\n∼\na\ncongruence\non\n𝔄\n.","source_id":"planetmath.quotientstructure","source_sha256":"412058c68496b2bf96e6d2146feb6709e383df12a27f633b3aabe54026a72f0c","start":38}],"target_id":"concept.planetmath.quotientstructure","target_kind":"node","target_sha256":"86a76672608ab631e33d19ada6cffa5138dfc49d522f3678fae919101bfa39cb"}],"concept.planetmath.radicalofanideal":[{"id":"assertion.concept.planetmath.radicalofanideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Radical of an ideal as stated in the captured PlanetMath entry radicalofanideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 14A05, 16N40, 13-00) states: Let R be a commutative ring . For any ideal I of R , the radical of I , written I or Rad ⁡ ( I ) , is the set { a ∈ R ⁢ ∣ a n ∈ I ⁢ for some integer ⁢ n > ⁢ 0 } The radical of an ideal I is always an ideal of R .","support":[{"end":252,"quote":"Let\nR\nbe a\ncommutative ring\n. For any ideal\nI\nof\nR\n, the\nradical\nof\nI\n, written\nI\nor\nRad\n⁡\n(\nI\n)\n, is the set\n{\na\n∈\nR\n⁢\n∣\na\nn\n∈\nI\n⁢\nfor some integer\n⁢\nn\n>\n⁢\n0\n}\nThe radical of an ideal\nI\nis always an ideal of\nR\n.","source_id":"planetmath.radicalofanideal","source_sha256":"ab02bfdae98fe03765df41e4848d7598ece1167f165d24399c7f5c94a9f5c6f0","start":40}],"target_id":"concept.planetmath.radicalofanideal","target_kind":"node","target_sha256":"edab7fb8ca8b3a0f88fa368e32638f39ca136bb6badd69b89030c68c485354b8"}],"concept.planetmath.radicalofaninteger":[{"id":"assertion.concept.planetmath.radicalofaninteger","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Radical of an integer as stated in the captured PlanetMath entry radicalofaninteger","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13A10, 81-00, 18-00) states: Given a natural number n , let n = p 1 α 1 ⁢ ⋯ ⁢ p k α k be its unique factorization as a product of distinct prime powers.","support":[{"end":167,"quote":"Given a\nnatural number\nn\n, let\nn\n=\np\n1\nα\n1\n⁢\n⋯\n⁢\np\nk\nα\nk\nbe its\nunique factorization\nas a\nproduct\nof distinct prime powers.","source_id":"planetmath.radicalofaninteger","source_sha256":"24125b4e020f828a1d948d0e621f6ea1ea73bab981f689aaa5397646f2e7bc45","start":44}],"target_id":"concept.planetmath.radicalofaninteger","target_kind":"node","target_sha256":"6593d99c6fa2f66bce65ef00e219a8071ed4c659d3006dfbf7b93fd019309084"}],"concept.planetmath.randomvariable":[{"id":"assertion.concept.planetmath.randomvariable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Random variable as stated in the captured PlanetMath entry randomvariable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 62-00, 60-00, 11R32, 03-01, 20B25) states: If ( Ω , 𝒜 , P ) is a probability space , then a random variable on Ω is a measurable function X : ( Ω , 𝒜 ) → S to a measurable space S (frequently taken to be the real numbers with the standard measure ).","support":[{"end":238,"quote":"If\n(\nΩ\n,\n𝒜\n,\nP\n)\nis a\nprobability space\n, then a\nrandom variable\non\nΩ\nis a\nmeasurable function\nX\n:\n(\nΩ\n,\n𝒜\n)\n→\nS\nto a\nmeasurable space\nS\n(frequently taken to be the\nreal numbers\nwith the standard\nmeasure\n).","source_id":"planetmath.randomvariable","source_sha256":"3607482598b38d1f7da8e4d1b1bfaf4e2e80fc39ae76fd2f1d4aafb89fa893b1","start":32}],"target_id":"concept.planetmath.randomvariable","target_kind":"node","target_sha256":"bf6687214dc121552667b325ffd2e23fcb467efdd8528cc417e793f17f91e282"}],"concept.planetmath.rationalnumber":[{"id":"assertion.concept.planetmath.rationalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rational number as stated in the captured PlanetMath entry rationalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B30, 11A99, 03E99) states: The rational numbers ℚ are the fraction field of the ring ℤ of integers .","support":[{"end":105,"quote":"The\nrational numbers\nℚ\nare the\nfraction field\nof the ring\nℤ\nof\nintegers\n.","source_id":"planetmath.rationalnumber","source_sha256":"7d97345536d8221e3b74fa29d767612adbacd55d0b6502fe0f91440f1030d27d","start":32}],"target_id":"concept.planetmath.rationalnumber","target_kind":"node","target_sha256":"f1c4b73dd3f46f4e752226e96cb0c57931cfe2bd3ef34d9d5a0d18aa08d4076d"}],"concept.planetmath.realnumber":[{"id":"assertion.concept.planetmath.realnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Real number as stated in the captured PlanetMath entry realnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54C30, 26-00, 12D99) states: 1 Definition There are several equivalent definitions of real number , all in common use.","support":[{"end":113,"quote":"1\nDefinition\nThere are several\nequivalent\ndefinitions\nof\nreal number\n, all in common use.","source_id":"planetmath.realnumber","source_sha256":"f3e804bd8552da2fc734b565599cfc54947592bfaf29de479f2991df1b141db5","start":24}],"target_id":"concept.planetmath.realnumber","target_kind":"node","target_sha256":"319001b8b5455744230e1cea8cf99f4f9820363a941bf00dc63a7ed8a5aa6095"}],"concept.planetmath.recursivefunction":[{"id":"assertion.concept.planetmath.recursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursive function as stated in the captured PlanetMath entry recursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: Intuitively, a recursive function is a positive integer valued function of one or more positive integer arguments which may be computed by a definite algorithm .","support":[{"end":199,"quote":"Intuitively, a\nrecursive function\nis a\npositive integer\nvalued\nfunction\nof one or more positive integer\narguments\nwhich may be computed by a definite\nalgorithm\n.","source_id":"planetmath.recursivefunction","source_sha256":"b3ed8b62365e338cabd706d0c3566d4da304c7579e4c83dc831d200b040ab2fd","start":38}],"target_id":"concept.planetmath.recursivefunction","target_kind":"node","target_sha256":"65488868b08eec609516861144e8fc1bd53c3c78ae77d346d7b2396cebebbf29"}],"concept.planetmath.recursivelyenumerable":[{"id":"assertion.concept.planetmath.recursivelyenumerable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursively enumerable as stated in the captured PlanetMath entry recursivelyenumerable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D25) states: For a language L , TFAE: • There exists a Turing machine f such that ∀ x .","support":[{"end":120,"quote":"For a\nlanguage\nL\n, TFAE:\n•\nThere exists a\nTuring machine\nf\nsuch that\n∀\nx\n.","source_id":"planetmath.recursivelyenumerable","source_sha256":"bbe1095bf2b68731c0a9b30cd9fc970f947d65fe429ecdca679178d5f41f570f","start":46}],"target_id":"concept.planetmath.recursivelyenumerable","target_kind":"node","target_sha256":"33dabd716e5486e1a13c743ef40af0cd6fe011d1c203134437f299745a490f41"}],"concept.planetmath.recursiveset":[{"id":"assertion.concept.planetmath.recursiveset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursive set as stated in the captured PlanetMath entry recursiveset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B25, 03D20) states: A subset S of the natural numbers ℕ is said to be recursive if its characteristic function χ S ⁢ ( x ) := { 1 if ⁢ x ∈ S 0 if ⁢ x ∈ ℕ - S is recursive ( computable ).","support":[{"end":194,"quote":"A subset\nS\nof the\nnatural numbers\nℕ\nis said to be\nrecursive\nif its\ncharacteristic function\nχ\nS\n⁢\n(\nx\n)\n:=\n{\n1\nif\n⁢\nx\n∈\nS\n0\nif\n⁢\nx\n∈\nℕ\n-\nS\nis recursive (\ncomputable\n).","source_id":"planetmath.recursiveset","source_sha256":"5962d4ba1f0f1012dc5f9523a712f18ebd4ff0e44b3ffbe007afd0fdaf46a958","start":28}],"target_id":"concept.planetmath.recursiveset","target_kind":"node","target_sha256":"5b8e11e2c510d78819f30afedac53970cc2cf73615f13bec661fbd86cc2e6deb"}],"concept.planetmath.reducedautomaton":[{"id":"assertion.concept.planetmath.reducedautomaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reduced automaton as stated in the captured PlanetMath entry reducedautomaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an automaton ? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","support":[{"end":311,"quote":"Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an\nautomaton\n? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","source_id":"planetmath.reducedautomaton","source_sha256":"834db70d8fe410730de7292083496ab7ac4181909a6602489f514f0cd9e38231","start":36}],"target_id":"concept.planetmath.reducedautomaton","target_kind":"node","target_sha256":"c527fe7b6293210f7e892e5bb49727f25f85b2e7dc9f0414a6a561e6b69bbb04"}],"concept.planetmath.reductioadabsurdum":[{"id":"assertion.concept.planetmath.reductioadabsurdum","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reductio ad absurdum as stated in the captured PlanetMath entry reductioadabsurdum","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-01) states: Reductio ad Absurdum is a process of inference by means of which one can derive a proposition ¬ ⁢ X from the fact the the assumption of X leads to a contradiction .","support":[{"end":206,"quote":"Reductio ad Absurdum\nis a process of inference by means of which one can derive a\nproposition\n¬\n⁢\nX\nfrom the fact the the\nassumption\nof\nX\nleads to a\ncontradiction\n.","source_id":"planetmath.reductioadabsurdum","source_sha256":"3b13033c5b0f07e1402292d8d993129ed1d0c14c46fb4f9309033b495650c3b0","start":42}],"target_id":"concept.planetmath.reductioadabsurdum","target_kind":"node","target_sha256":"a5e8af34ffa80e802bf900f77a24215b6dd65af69623ec933577ac1ff2a103f2"}],"concept.planetmath.reflexiverelation":[{"id":"assertion.concept.planetmath.reflexiverelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reflexive relation as stated in the captured PlanetMath entry reflexiverelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is reflexive if and only if a ⁢ ℛ ⁢ a for all a ∈ A .","support":[{"end":115,"quote":"A\nrelation\nℛ\non a set\nA\nis\nreflexive\nif and only if\na\n⁢\nℛ\n⁢\na\nfor all\na\n∈\nA\n.","source_id":"planetmath.reflexiverelation","source_sha256":"5c1d8c8a2a0b665b1ceba3f4ee175255ee04aedb298f58683e8140717b5c44c8","start":38}],"target_id":"concept.planetmath.reflexiverelation","target_kind":"node","target_sha256":"92d5051264bf70d2406b0ed45cbfe851588bf9a00a95763163bf18ca9ebc8eaf"}],"concept.planetmath.regularsemigroup":[{"id":"assertion.concept.planetmath.regularsemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Regular semigroup as stated in the captured PlanetMath entry regularsemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M17, 20M18) states: \\PMlinkescapephrase completely regular \\PMlinkescapephrase generated by Let S be a semigroup .","support":[{"end":130,"quote":"\\PMlinkescapephrase\ncompletely regular\n\\PMlinkescapephrase\ngenerated by\nLet\nS\nbe a\nsemigroup\n.","source_id":"planetmath.regularsemigroup","source_sha256":"ef67e7743f26bb766c40dcfe3281ce557f3a89721a78e86311cbc6961ffd4039","start":36}],"target_id":"concept.planetmath.regularsemigroup","target_kind":"node","target_sha256":"61fec79b4935055c7c1f9954d2c18e0ee3a12dec53b1c191af148a627b2a722c"}],"concept.planetmath.regularspace":[{"id":"assertion.concept.planetmath.regularspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Regular space as stated in the captured PlanetMath entry regularspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: Definition 1 . A topological space is a regular space if it is both a T 0 space ( http://planetmath.org/T0Space ) and a T 3 space ( http://planetmath.org/T3Space ).","support":[{"end":192,"quote":"Definition 1\n.\nA\ntopological space\nis a\nregular space\nif\nit is both a\nT\n0\nspace (\nhttp://planetmath.org/T0Space\n) and a\nT\n3\nspace (\nhttp://planetmath.org/T3Space\n).","source_id":"planetmath.regularspace","source_sha256":"e0098937d93e93d05cb58f907357b804960e46d6a842a05795e9cc07a1844b85","start":28}],"target_id":"concept.planetmath.regularspace","target_kind":"node","target_sha256":"22fd22d6d49b6a0fa241cdfacb8c29d5df81f1db40416eb1056412748fbf3402"}],"concept.planetmath.relatedrates":[{"id":"assertion.concept.planetmath.relatedrates","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Related rates as stated in the captured PlanetMath entry relatedrates","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53A45, 53A17, 26A24) states: The notion of a derivative has numerous interpretations and applications.","support":[{"end":101,"quote":"The notion of a\nderivative\nhas numerous\ninterpretations\nand\napplications.","source_id":"planetmath.relatedrates","source_sha256":"655af6fde233c9d2a38ab25b18c1f1441bb5a93e098261a895185b74e89c4ed7","start":28}],"target_id":"concept.planetmath.relatedrates","target_kind":"node","target_sha256":"c64e7c93004ee1064f39a6585e53c3c8ee7557a5c82b33e031ea5a73c4341a8d"}],"concept.planetmath.relationalgebra":[{"id":"assertion.concept.planetmath.relationalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relation algebra as stated in the captured PlanetMath entry relationalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15, 06E25) states: It is a well-known fact that if A is a set, then P ⁢ ( A ) the power set of A , equipped with the intersection operation ∩ , the union operation ∪ , and the complement operation ′ turns P ⁢ ( A ) into a Boolean algebra .","support":[{"end":254,"quote":"It is a well-known fact that if\nA\nis a set, then\nP\n⁢\n(\nA\n)\nthe\npower set\nof\nA\n, equipped with the\nintersection\noperation\n∩\n, the union operation\n∪\n, and the\ncomplement\noperation\n′\nturns\nP\n⁢\n(\nA\n)\ninto a\nBoolean algebra\n.","source_id":"planetmath.relationalgebra","source_sha256":"7075bac1fe0ad42d2ed09bea898efa0378d992e5e59f84ae291d2b45cd5b962f","start":34}],"target_id":"concept.planetmath.relationalgebra","target_kind":"node","target_sha256":"4de70544a57f5e377e56e702d326995b27dc41c11ee17ce31b9c7b69f11f3472"}],"concept.planetmath.relationalsystem":[{"id":"assertion.concept.planetmath.relationalsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relational system as stated in the captured PlanetMath entry relationalsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03C07, 08A02) states: A relational system , loosely speaking, is a pair ( A , R ) where A is a set and R is a set of finitary relations defined on A (a finitary relation is just an n -ary relation where n ∈ ℕ ; when n = 1 , it is called a property ).","support":[{"end":264,"quote":"A\nrelational system\n, loosely speaking, is a pair\n(\nA\n,\nR\n)\nwhere\nA\nis a set and\nR\nis a set of finitary relations defined on\nA\n(a finitary relation is just an\nn\n-ary\nrelation\nwhere\nn\n∈\nℕ\n; when\nn\n=\n1\n, it is called a\nproperty\n).","source_id":"planetmath.relationalsystem","source_sha256":"b5abd6175785f2d73c536efa9489f82385de4fad798c43613aa088aa2f8fa1e2","start":36}],"target_id":"concept.planetmath.relationalsystem","target_kind":"node","target_sha256":"5ffd1819bc8ec33cfb7cefe1b4002410e79b116eee839c1497b4807794fa355a"}],"concept.planetmath.relationcomposition":[{"id":"assertion.concept.planetmath.relationcomposition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relation composition as stated in the captured PlanetMath entry relationcomposition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 68R01, 68P15, 08A02, 05C65, 05B30, 05B20, 03E20, 03B10) states: Relation composition , or the composition of relations , is the generalization of function composition, or the composition of functions.","support":[{"end":178,"quote":"Relation composition\n, or the\ncomposition of relations\n, is the\ngeneralization\nof function composition, or the\ncomposition\nof functions.","source_id":"planetmath.relationcomposition","source_sha256":"7f7f0aff2adddb3ad723eecfa36ad3a98a7ca427d9e8ad11359d032a8623ccda","start":42}],"target_id":"concept.planetmath.relationcomposition","target_kind":"node","target_sha256":"50763ee31bc03af83c08ad6cd432afc7560234c2b13ce94b26915259dc9fd929"}],"concept.planetmath.restrictionofafunction":[{"id":"assertion.concept.planetmath.restrictionofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Restriction of a function as stated in the captured PlanetMath entry restrictionofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let f : X → Y be a function from a set X to a set Y .","support":[{"end":116,"quote":"Definition\nLet\nf\n:\nX\n→\nY\nbe a\nfunction\nfrom a set\nX\nto a set\nY\n.","source_id":"planetmath.restrictionofafunction","source_sha256":"a04b8eae7113ad8136a6b620fa089a3d5b326a1d855726d476dd729c7c273425","start":52}],"target_id":"concept.planetmath.restrictionofafunction","target_kind":"node","target_sha256":"627cb26b7c7a86ce576bcde2db9ca0104cd0f16560ed6869491a1e8b5e2bcd81"}],"concept.planetmath.reversepolishnotation":[{"id":"assertion.concept.planetmath.reversepolishnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reverse Polish notation as stated in the captured PlanetMath entry reversepolishnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","support":[{"end":333,"quote":"Whereas\noperators\nare traditionally placed between operands, with parentheses used to override\noperator precedence\n, it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","source_id":"planetmath.reversepolishnotation","source_sha256":"bca88c4ccb5a7ece6949946a0286d9e35392e8dd4df357bccbbefd0fca813c1c","start":48}],"target_id":"concept.planetmath.reversepolishnotation","target_kind":"node","target_sha256":"42cc90bbaf300cf7a2a14ee35984a7fe7dcdcd9fe703dd65fa1726aad5899051"}],"concept.planetmath.ringhomomorphism":[{"id":"assertion.concept.planetmath.ringhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ring homomorphism as stated in the captured PlanetMath entry ringhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B10, 16B99, 81P05) states: Let R and S be rings. A ring homomorphism is a function f : R ⟶ S such that: • f ⁢ ( a + b ) = f ⁢ ( a ) + f ⁢ ( b ) for all a , b ∈ R • f ⁢ ( a ⋅ b ) = f ⁢ ( a ) ⋅ f ⁢ ( b ) for all a , b ∈ R A ring isomorphism is a ring homomorphism which is a bijection .","support":[{"end":293,"quote":"Let\nR\nand\nS\nbe rings. A\nring homomorphism\nis a\nfunction\nf\n:\nR\n⟶\nS\nsuch that:\n•\nf\n⁢\n(\na\n+\nb\n)\n=\nf\n⁢\n(\na\n)\n+\nf\n⁢\n(\nb\n)\nfor all\na\n,\nb\n∈\nR\n•\nf\n⁢\n(\na\n⋅\nb\n)\n=\nf\n⁢\n(\na\n)\n⋅\nf\n⁢\n(\nb\n)\nfor all\na\n,\nb\n∈\nR\nA\nring isomorphism\nis a ring homomorphism which is a\nbijection\n.","source_id":"planetmath.ringhomomorphism","source_sha256":"303e591ba0d05abd5094905ea804b8d6d4930346fbeba361b973e23424c86ade","start":36}],"target_id":"concept.planetmath.ringhomomorphism","target_kind":"node","target_sha256":"50b252535a91e070fdc0128559eafc3d551b6dc457226713c63b6df490e40ac4"}],"concept.planetmath.ruleofproduct":[{"id":"assertion.concept.planetmath.ruleofproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rule of product as stated in the captured PlanetMath entry ruleofproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05A05, 03-00) states: If a process A can have altogether m different results and another process B altogether n different results, then the two processes can have altogether m ⁢ n different combined results.","support":[{"end":217,"quote":"If a process\nA\ncan have altogether\nm\ndifferent results and another process\nB\naltogether\nn\ndifferent results, then the two processes can have altogether\nm\n⁢\nn\ndifferent combined results.","source_id":"planetmath.ruleofproduct","source_sha256":"a96bffa7714c264f5d329fb61f9857cfa12ef576a7f6169cbe67eb4e99d59f9a","start":32}],"target_id":"concept.planetmath.ruleofproduct","target_kind":"node","target_sha256":"0ab1c58b916a8759e94c61dad07eeee1f7b286d2aa84db0c1a4577075a7184c2"}],"concept.planetmath.russellsparadox":[{"id":"assertion.concept.planetmath.russellsparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Russell’s paradox as stated in the captured PlanetMath entry russellsparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: Suppose that for any coherent proposition P ⁢ ( x ) , we can construct a set { x : P ⁢ ( x ) } .","support":[{"end":132,"quote":"Suppose that for any coherent\nproposition\nP\n⁢\n(\nx\n)\n, we can construct a set\n{\nx\n:\nP\n⁢\n(\nx\n)\n}\n.","source_id":"planetmath.russellsparadox","source_sha256":"5c01d870e4fc3fd1322b1df14345efc3ca94f0e91bbfe5e0557d1d3c87f12285","start":36}],"target_id":"concept.planetmath.russellsparadox","target_kind":"node","target_sha256":"71dd310cf92c8335cead820f24ab8cd98568af7f776a8b287a5600382c02edc3"}],"concept.planetmath.russellstheoryoftypes":[{"id":"assertion.concept.planetmath.russellstheoryoftypes","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Russell’s theory of types as stated in the captured PlanetMath entry russellstheoryoftypes","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: After the discovery of the paradoxes of set theory (notably Russell’s paradox ), it become apparent that naive set theory must be replaced by something in which the paradoxes can’t arise.","support":[{"end":239,"quote":"After the discovery of the paradoxes of set theory (notably Russell’s\nparadox\n), it become apparent that\nnaive set theory\nmust be replaced by something in which the paradoxes can’t arise.","source_id":"planetmath.russellstheoryoftypes","source_sha256":"bfc1bb1f912dabf4412945d2d746842d947c9a171bfba81a9dff84b165997cd7","start":52}],"target_id":"concept.planetmath.russellstheoryoftypes","target_kind":"node","target_sha256":"5c9b5f48020750726edb2f94c11477e2213b29566c235f7a0a7d7e22b1586546"}],"concept.planetmath.satisfactionrelation":[{"id":"assertion.concept.planetmath.satisfactionrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Satisfaction relation as stated in the captured PlanetMath entry satisfactionrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Alfred Tarski was the first mathematician to give a formal definition of what it means for a formula to be “true” in a structure .","support":[{"end":174,"quote":"Alfred Tarski was the first mathematician to give a formal definition of what\nit means for a\nformula\nto be “true” in a\nstructure\n.","source_id":"planetmath.satisfactionrelation","source_sha256":"f3c8a24eb9d729356d66d50eedcf9d398a3fc56ac051965bb4952e17bb50257e","start":44}],"target_id":"concept.planetmath.satisfactionrelation","target_kind":"node","target_sha256":"42da95f34158b5e75b37c485ab6df3ea8fbef03dcf1fc93918486285e8c89884"}],"concept.planetmath.secondcountable":[{"id":"assertion.concept.planetmath.secondcountable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Second countable as stated in the captured PlanetMath entry secondcountable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D70) states: A topological space is said to be second if it has a countable basis ( http://planetmath.org/BasisTopologicalSpace ).","support":[{"end":151,"quote":"A\ntopological space\nis said to be\nsecond\nif it has a countable basis (\nhttp://planetmath.org/BasisTopologicalSpace\n).","source_id":"planetmath.secondcountable","source_sha256":"09650a40f9d4adcd4f16613135f5ddfa1b8cca86c1ab05b1a77f97ff0c8c4d2a","start":34}],"target_id":"concept.planetmath.secondcountable","target_kind":"node","target_sha256":"cdfa88ee9127d6b080debc07cc3868062c477a5a3484600094350054f93d4c80"}],"concept.planetmath.secondorderlogic":[{"id":"assertion.concept.planetmath.secondorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Second order logic as stated in the captured PlanetMath entry secondorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: Second order logic refers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or functions on those objects (or both, in the three type case).","support":[{"end":262,"quote":"Second order logic\nrefers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or\nfunctions\non those objects (or both, in the three type case).","source_id":"planetmath.secondorderlogic","source_sha256":"730e944fb02a299cf17e6174757a162d934f541244c3f3dfe87485e8e93f106a","start":38}],"target_id":"concept.planetmath.secondorderlogic","target_kind":"node","target_sha256":"d19184278ea0537ee6a5358638698e12f5747215f59b851fd692be2752158760"}],"concept.planetmath.sectionofafiberbundle":[{"id":"assertion.concept.planetmath.sectionofafiberbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Section of a fiber bundle as stated in the captured PlanetMath entry sectionofafiberbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R10) states: Let p : E → B be a fiber bundle , denoted by ξ . A section of ξ is a continuous map s : B → E such that the composition p ∘ s equals the identity .","support":[{"end":199,"quote":"Let\np\n:\nE\n→\nB\nbe a\nfiber bundle\n, denoted by\nξ\n.\nA\nsection\nof\nξ\nis a\ncontinuous map\ns\n:\nB\n→\nE\nsuch that the\ncomposition\np\n∘\ns\nequals the\nidentity\n.","source_id":"planetmath.sectionofafiberbundle","source_sha256":"a2e9f2a4d73a0d7599610e8717a6845db72f9504b380b77c347ff1ffea9d6101","start":52}],"target_id":"concept.planetmath.sectionofafiberbundle","target_kind":"node","target_sha256":"499f2eb3cd8a797300996fe7af372c0a555604d6de744d5af765d2d7dd1a2345"}],"concept.planetmath.sectionofagroup":[{"id":"assertion.concept.planetmath.sectionofagroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Section of a group as stated in the captured PlanetMath entry sectionofagroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20F99) states: A section of a group G is a quotient ( http://planetmath.org/QuotientGroup ) of a subgroup of G .","support":[{"end":135,"quote":"A\nsection\nof a group\nG\nis\na\nquotient\n(\nhttp://planetmath.org/QuotientGroup\n) of a\nsubgroup\nof\nG\n.","source_id":"planetmath.sectionofagroup","source_sha256":"84924de7b5c027e1faaac9cbcfaeb2e362fd6c2ba70eb84e4951d66d0860bf0a","start":38}],"target_id":"concept.planetmath.sectionofagroup","target_kind":"node","target_sha256":"2ca783960eec92423f1a0ebfd609d1ea41ece6143f1b1c32f007c5fef88e3ec2"}],"concept.planetmath.selector":[{"id":"assertion.concept.planetmath.selector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Selector as stated in the captured PlanetMath entry selector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E25) states: Let S be a collection of sets. A selector of S is by definition a set { f ⁢ ( R ) | R ∈ S } where f is a choice function on S (that is f ⁢ ( R ) ∈ R ).","support":[{"end":169,"quote":"Let\nS\nbe a\ncollection\nof sets. A\nselector\nof\nS\nis by definition a set\n{\nf\n⁢\n(\nR\n)\n|\nR\n∈\nS\n}\nwhere\nf\nis a\nchoice function\non\nS\n(that is\nf\n⁢\n(\nR\n)\n∈\nR\n).","source_id":"planetmath.selector","source_sha256":"50bc67472cb7b2ee294d4c0f20250e57f4ce57669c52cd1b7e53187ed0d5d2cf","start":18}],"target_id":"concept.planetmath.selector","target_kind":"node","target_sha256":"22579da1698a9309db7272c5a810e96fd79e17f48e645d6b2a28156e83a36dd3"}],"concept.planetmath.semiautomatonhomomorphism":[{"id":"assertion.concept.planetmath.semiautomatonhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiautomaton homomorphism as stated in the captured PlanetMath entry semiautomatonhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45, 20M35, 03D05, 68Q70) states: Just like groups and rings, a semiautomaton can be viewed as an algebraic structure .","support":[{"end":139,"quote":"Just like groups and rings, a\nsemiautomaton\ncan be viewed as an\nalgebraic structure\n.","source_id":"planetmath.semiautomatonhomomorphism","source_sha256":"46843f23a81dbf139584dfec50933db940888550089e3ea1574aea24c06764f8","start":54}],"target_id":"concept.planetmath.semiautomatonhomomorphism","target_kind":"node","target_sha256":"84f581790384d9a3caed23fb38be19fd46a856bf4a775ddeb14f74ac31e1da81"}],"concept.planetmath.semigroup":[{"id":"assertion.concept.planetmath.semigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semigroup as stated in the captured PlanetMath entry semigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99) states: A semigroup G is a set together with a binary operation ⋅ : G × G ⟶ G which satisfies the associative property: ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) for all a , b , c ∈ G .","support":[{"end":185,"quote":"A\nsemigroup\nG\nis a set together with a\nbinary operation\n⋅\n:\nG\n×\nG\n⟶\nG\nwhich\nsatisfies\nthe associative property:\n(\na\n⋅\nb\n)\n⋅\nc\n=\na\n⋅\n(\nb\n⋅\nc\n)\nfor all\na\n,\nb\n,\nc\n∈\nG\n.","source_id":"planetmath.semigroup","source_sha256":"ce170036ac03eca9c5635e78b02d1ad02bb0e97b666ad3b1ae7941b2213574c3","start":20}],"target_id":"concept.planetmath.semigroup","target_kind":"node","target_sha256":"d8713746ecba435bcbe1b4a9e9596635aad1eb2367e273d7c2445c2063e96bff"}],"concept.planetmath.seminorm":[{"id":"assertion.concept.planetmath.seminorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Seminorm as stated in the captured PlanetMath entry seminorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B20) states: Let V be a real, or a complex vector space , with K denoting the corresponding field of scalars.","support":[{"end":114,"quote":"Let\nV\nbe a real, or a\ncomplex vector space\n, with\nK\ndenoting the\ncorresponding field of scalars.","source_id":"planetmath.seminorm","source_sha256":"6ebbca2c6f43cb998dfc608ccd05f6d1ed93b5cb955c475cdc9582f4965fd366","start":18}],"target_id":"concept.planetmath.seminorm","target_kind":"node","target_sha256":"484a7c5b107c2d5c53ec2227a3ea1fc6e86b8030c759144fdb02b50dbe8a34c3"}],"concept.planetmath.semioticequivalencerelation":[{"id":"assertion.concept.planetmath.semioticequivalencerelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiotic equivalence relation as stated in the captured PlanetMath entry semioticequivalencerelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 94A05, 03G15, 03E20, 03B42, 03B10, 94A15) states: Note. The intended forms of the Tables are visible only in the Page Image view.","support":[{"end":139,"quote":"Note.\nThe intended forms of the Tables are visible only in the Page Image view.","source_id":"planetmath.semioticequivalencerelation","source_sha256":"3ba69e6c21ddca817864c77c8cd35db17416469736305b1b058b38991b0227ac","start":60}],"target_id":"concept.planetmath.semioticequivalencerelation","target_kind":"node","target_sha256":"36186107b5b7daa0952aca85743c811cf4e0cf72160d3c817b91a357ef513291"}],"concept.planetmath.semiring":[{"id":"assertion.concept.planetmath.semiring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiring as stated in the captured PlanetMath entry semiring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16Y60) states: \\PMlinkescapephrase right annihilator A semiring is a set A with two operations , + and ⋅ , such that 0 ∈ A makes ( A , + ) into a commutative monoid , 1 ∈ A makes ( A , ⋅ ) into a monoid, the operation ⋅ distributes ( http://planetmath.org/ Distributivity ) over + , and for any a ∈ A , 0 ⋅ a = a ⋅ 0 = 0 .","support":[{"end":325,"quote":"\\PMlinkescapephrase\nright annihilator\nA\nsemiring\nis a set\nA\nwith two\noperations\n,\n+\nand\n⋅\n, such that\n0\n∈\nA\nmakes\n(\nA\n,\n+\n)\ninto a\ncommutative monoid\n,\n1\n∈\nA\nmakes\n(\nA\n,\n⋅\n)\ninto a monoid, the operation\n⋅\ndistributes (\nhttp://planetmath.org/\nDistributivity\n)\nover\n+\n, and for any\na\n∈\nA\n,\n0\n⋅\na\n=\na\n⋅\n0\n=\n0\n.","source_id":"planetmath.semiring","source_sha256":"05b597d6cd82d94bad746aead7d5d0d76ca263aa8a8c227b04fb1aa8ba38fc52","start":18}],"target_id":"concept.planetmath.semiring","target_kind":"node","target_sha256":"6cc34fb002600be42d7a21added9f0b4faa413120e5d086ff50e5d670acec05a"}],"concept.planetmath.semithuesystem":[{"id":"assertion.concept.planetmath.semithuesystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semi-Thue system as stated in the captured PlanetMath entry semithuesystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q42, 03D40, 20M35, 03D03) states: A semi-Thue system 𝔖 is a pair ( Σ , P ) where Σ is an alphabet and P is a non-empty finite binary relation on Σ * , the Kleene star of Σ .","support":[{"end":173,"quote":"A\nsemi-Thue system\n𝔖\nis a pair\n(\nΣ\n,\nP\n)\nwhere\nΣ\nis an\nalphabet\nand\nP\nis a non-empty finite\nbinary relation\non\nΣ\n*\n, the\nKleene star\nof\nΣ\n.","source_id":"planetmath.semithuesystem","source_sha256":"3f5af952e719734e8013f9a4949d3a5a84fe477b5426fb726fbccd0ccb04d57a","start":34}],"target_id":"concept.planetmath.semithuesystem","target_kind":"node","target_sha256":"1d9235ab0f90e84dfd695ee5c1d43529bea80c98e517a24b272c6f5292c26fb4"}],"concept.planetmath.separationaxioms":[{"id":"assertion.concept.planetmath.separationaxioms","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Separation axioms as stated in the captured PlanetMath entry separationaxioms","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10, 54D15) states: The separation axioms are additional conditions which may be required to a topological space in order to ensure that some particular types of sets can be separated by open sets , thus avoiding certain pathological cases.","support":[{"end":256,"quote":"The\nseparation axioms\nare additional conditions which may be required to a\ntopological space\nin order to ensure that some particular types of sets can be\nseparated\nby\nopen sets\n, thus avoiding certain pathological cases.","source_id":"planetmath.separationaxioms","source_sha256":"1a87df36e25e174dda5ae1623e617997b50bedb7a65a24d31331d93908a4da4a","start":36}],"target_id":"concept.planetmath.separationaxioms","target_kind":"node","target_sha256":"1b0a97a98bf8d14d3cd0bc56a1cd4e8db21761e05b6589880918e9c55ea37527"}],"concept.planetmath.sequent":[{"id":"assertion.concept.planetmath.sequent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sequent as stated in the captured PlanetMath entry sequent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03) states: A sequent represents a formal step in a proof. Typically it consists of two lists of formulas , one representing the premises and one the conclusions .","support":[{"end":167,"quote":"A\nsequent\nrepresents a formal step in a proof. Typically it consists of two lists of\nformulas\n, one representing the\npremises\nand one the\nconclusions\n.","source_id":"planetmath.sequent","source_sha256":"56f7b8e0ef4fd3108f8d9cf4aeb25d934688a66a0ef922a79da4ec0db6171172","start":16}],"target_id":"concept.planetmath.sequent","target_kind":"node","target_sha256":"32e37462dba54f4fb3f69533f47916f5189cc6685340434a6e32a86ef1fa728b"}],"concept.planetmath.sequentiallycompact":[{"id":"assertion.concept.planetmath.sequentiallycompact","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sequentially compact as stated in the captured PlanetMath entry sequentiallycompact","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 40A05, 54D30) states: A topological space X is sequentially compact if every sequence in X has a convergent subsequence.","support":[{"end":140,"quote":"A\ntopological space\nX\nis\nsequentially compact\nif every\nsequence\nin\nX\nhas a convergent subsequence.","source_id":"planetmath.sequentiallycompact","source_sha256":"8fbbe11cca07ddc67f3c49d5a132a6135a225ec0f5c27efe4f2c3faa620e7f15","start":42}],"target_id":"concept.planetmath.sequentiallycompact","target_kind":"node","target_sha256":"21d7b52e56afde8fefc4468cbc8e295fa700a9048001f86861f72c613c6a61e6"}],"concept.planetmath.sesquilinearformsovergeneralfields":[{"id":"assertion.concept.planetmath.sesquilinearformsovergeneralfields","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sesquilinear forms over general fields as stated in the captured PlanetMath entry sesquilinearformsovergeneralfields","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39, 51A05) states: Let V be a vector space over a field k . k may be of any characteristic .","support":[{"end":151,"quote":"Let\nV\nbe a\nvector space\nover a field\nk\n.\nk\nmay be of any\ncharacteristic\n.","source_id":"planetmath.sesquilinearformsovergeneralfields","source_sha256":"f729f609f0aac1dc4d9f0b30d726f0f58edbc208cf9608d41f0497203930d02c","start":78}],"target_id":"concept.planetmath.sesquilinearformsovergeneralfields","target_kind":"node","target_sha256":"304bb92c79e079320eee5a7f22f64a1ce1b79b6fe5ceb3888a1c8a265e985d42"}],"concept.planetmath.setdifference":[{"id":"assertion.concept.planetmath.setdifference","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Set difference as stated in the captured PlanetMath entry setdifference","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let A and B be sets. The set difference (or simply difference ) between A and B (in that order) is the set of all elements of A that are not in B .","support":[{"end":188,"quote":"Definition\nLet\nA\nand\nB\nbe sets.\nThe\nset difference\n(or simply\ndifference\n)\nbetween\nA\nand\nB\n(in that order)\nis the set of all elements of\nA\nthat are not in\nB\n.","source_id":"planetmath.setdifference","source_sha256":"0a6bfc9b0cf1933ce98f2dd0f5faeb58868823459239bee65d9e9dd6107fcf1e","start":30}],"target_id":"concept.planetmath.setdifference","target_kind":"node","target_sha256":"ce18b7b605fa40b54745e9ac1f3fb800f9853a10000cf8fd573a10770578699a"}],"concept.planetmath.settheory":[{"id":"assertion.concept.planetmath.settheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Set theory as stated in the captured PlanetMath entry settheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E30) states: Set theory is special among mathematical theories, in two ways: It plays a central role in putting mathematics on a reliable axiomatic foundation , and it provides the basic language and apparatus in which most of mathematics is expressed.","support":[{"end":261,"quote":"Set theory\nis special among mathematical theories, in two ways: It plays\na central role in putting mathematics on a reliable axiomatic\nfoundation\n,\nand it provides the basic\nlanguage\nand apparatus in which most of\nmathematics is expressed.","source_id":"planetmath.settheory","source_sha256":"c510af83743dc5b9b2a6785f6d082a91b206f42c77a4160fe46e43d2cb58a3a1","start":22}],"target_id":"concept.planetmath.settheory","target_kind":"node","target_sha256":"088a9a5be6f812b01a8a6cbd04c6503988767212feb28387ddb0bd16bd027089"}],"concept.planetmath.shefferstroke":[{"id":"assertion.concept.planetmath.shefferstroke","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sheffer stroke as stated in the captured PlanetMath entry shefferstroke","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In the late 19th century and early 20th century, Charles Sanders Peirce and H.M.","support":[{"end":110,"quote":"In the late 19th century and early 20th century,\nCharles Sanders Peirce\nand H.M.","source_id":"planetmath.shefferstroke","source_sha256":"8cd53bcdacfe5f3f2cb9b3c4d2556628f0ef2d313c3ed9d91a7470af3b62a7c9","start":30}],"target_id":"concept.planetmath.shefferstroke","target_kind":"node","target_sha256":"e1610b88ba44eede76edcb44c9eaaa6ff66463d6051fdd1c4aab1da92049ea79"}],"concept.planetmath.signatureofapermutation":[{"id":"assertion.concept.planetmath.signatureofapermutation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Signature of a permutation as stated in the captured PlanetMath entry signatureofapermutation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Let X be a finite set , and let G be the group of permutations of X (see permutation group ).","support":[{"end":147,"quote":"Let\nX\nbe a\nfinite set\n, and let\nG\nbe the group of\npermutations\nof\nX\n(see\npermutation group\n).","source_id":"planetmath.signatureofapermutation","source_sha256":"a8ca63ac1a4884229efad8965a6e2ce8a4fd5453f4abdbe6f276bd67ee6dc9ce","start":54}],"target_id":"concept.planetmath.signatureofapermutation","target_kind":"node","target_sha256":"c2086e6ae4b3022b3a25edf038c78524e7bc41ad24166d870a9dab5243e57913"}],"concept.planetmath.signrelation":[{"id":"assertion.concept.planetmath.signrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sign relation as stated in the captured PlanetMath entry signrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: A sign relation is a special type of triadic relation that arises in the use of signs to connote meanings and denote objects.","support":[{"end":153,"quote":"A\nsign relation\nis a special type of\ntriadic relation\nthat arises in the use of signs to connote meanings and denote objects.","source_id":"planetmath.signrelation","source_sha256":"5ed124eda4f8529bc55b691a6046b4a442cc5c442e8a0b1406c8e39a81e399b3","start":28}],"target_id":"concept.planetmath.signrelation","target_kind":"node","target_sha256":"0a4a36fa4dd26ba975339392aa88fb39e55035e5b8cfc51e09f9fa1f7c0109fc"}],"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence":[{"id":"assertion.concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Similarity and analogous systems: dynamic adjointness and topological equivalence as stated in the captured PlanetMath entry similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C98, 18-00, 37F99, 37F05, 03D80, 03D15, 03C52, 18A40) states: \\xyoption curve 0.1 Dynamic Adjointness, Similarity and Analogous Systems.","support":[{"end":238,"quote":"\\xyoption\ncurve\n0.1\nDynamic Adjointness, Similarity and Analogous Systems.","source_id":"planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","source_sha256":"f826a4e66d64f118a86db4ab772870112af959fea5202f2c6c3b8abc3f0634ec","start":164}],"target_id":"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","target_kind":"node","target_sha256":"2f96a84c8c7d6e3333929521665932e33206236a597838c26a0516a8451dc6d8"}],"concept.planetmath.similarmatrix":[{"id":"assertion.concept.planetmath.similarmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Similar matrix as stated in the captured PlanetMath entry similarmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Definition A square matrix A is similar (or conjugate ) to a square matrix B if there exists a nonsingular square matrix S such that A = S - 1 ⁢ B ⁢ S .","support":[{"end":182,"quote":"Definition\nA\nsquare matrix\nA\nis\nsimilar\n(or\nconjugate\n) to a square matrix\nB\nif there exists a\nnonsingular\nsquare matrix\nS\nsuch that\nA\n=\nS\n-\n1\n⁢\nB\n⁢\nS\n.","source_id":"planetmath.similarmatrix","source_sha256":"734b8e015ceb44dc2bb639b63e429668fe20fbcf0083f9174bb3a5151c77b032","start":30}],"target_id":"concept.planetmath.similarmatrix","target_kind":"node","target_sha256":"6e4228fe1df2ecc1cdfec364d82970a90bd4ec6af32b60a76b6bda13ff3f36b1"}],"concept.planetmath.simplifiedautomaton":[{"id":"assertion.concept.planetmath.simplifiedautomaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Simplified automaton as stated in the captured PlanetMath entry simplifiedautomaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Word acceptance is the primary function of an automaton .","support":[{"end":99,"quote":"Word acceptance is the primary\nfunction\nof an\nautomaton\n.","source_id":"planetmath.simplifiedautomaton","source_sha256":"b78881993c6319f5ef1351b5cfbba8388da06435dd7e35b7d760a7ba4566200f","start":42}],"target_id":"concept.planetmath.simplifiedautomaton","target_kind":"node","target_sha256":"6199d390354220ca16784377d70fcabde9c552a1af0efbc9b7a0455189591666"}],"concept.planetmath.singleton":[{"id":"assertion.concept.planetmath.singleton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Singleton as stated in the captured PlanetMath entry singleton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A singleton is a set containing a single element.","support":[{"end":69,"quote":"A\nsingleton\nis a set containing a single element.","source_id":"planetmath.singleton","source_sha256":"5ed85445f151b40d495a22b869dd6a665181900f788e2570f53b9e09b96784df","start":20}],"target_id":"concept.planetmath.singleton","target_kind":"node","target_sha256":"cee3c10000f91b05b72ea6e829278b504c5a04bfcc34d670f51157359795dc73"}],"concept.planetmath.skolemization":[{"id":"assertion.concept.planetmath.skolemization","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Skolemization as stated in the captured PlanetMath entry skolemization","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Skolemization is a way of removing existential quantifiers from a formula .","support":[{"end":103,"quote":"Skolemization\nis a way of removing\nexistential quantifiers\nfrom a\nformula\n.","source_id":"planetmath.skolemization","source_sha256":"eb335eb6fef9714f27614c71f04bd2b05effa432a7efc670820398b684d4647d","start":28}],"target_id":"concept.planetmath.skolemization","target_kind":"node","target_sha256":"c781f1e66d4c7dfa1791d0f1a36d5939b28135cd92aa19e492c9221b7e5b263c"}],"concept.planetmath.solesufficientoperator":[{"id":"assertion.concept.planetmath.solesufficientoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sole sufficient operator as stated in the captured PlanetMath entry solesufficientoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05) states: A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to define all of the operators in a specified set of operators.","support":[{"end":216,"quote":"A\nsole sufficient operator\nor a\nsole sufficient connective\nis an\noperator\nthat is\nsufficient\nby itself to define all of the operators in a specified set of operators.","source_id":"planetmath.solesufficientoperator","source_sha256":"9551caf3ee982a005ef768234f3f9c435087aafbc839eb3b6e3e02ae857ef13f","start":50}],"target_id":"concept.planetmath.solesufficientoperator","target_kind":"node","target_sha256":"17a7c300b2d1babd5ad93788e0d5620934d8cf3c2655a2f59838702fa252d6f5"}],"concept.planetmath.specialelementsinalattice":[{"id":"assertion.concept.planetmath.specialelementsinalattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Special elements in a lattice as stated in the captured PlanetMath entry specialelementsinalattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B99) states: Let L be a lattice and a ∈ L is said to be • distributive if a ∨ ( b ∧ c ) = ( a ∨ b ) ∧ ( a ∨ c ) , • standard if b ∧ ( a ∨ c ) = ( b ∧ a ) ∨ ( b ∧ c ) , or • neutral if ( a ∧ b ) ∨ ( b ∧ c ) ∨ ( c ∧ a ) = ( a ∨ b ) ∧ ( b ∨ c ) ∧ ( c ∨ a ) for all b , c ∈ L .","support":[{"end":320,"quote":"Let\nL\nbe a\nlattice\nand\na\n∈\nL\nis said to be\n•\ndistributive\nif\na\n∨\n(\nb\n∧\nc\n)\n=\n(\na\n∨\nb\n)\n∧\n(\na\n∨\nc\n)\n,\n•\nstandard\nif\nb\n∧\n(\na\n∨\nc\n)\n=\n(\nb\n∧\na\n)\n∨\n(\nb\n∧\nc\n)\n, or\n•\nneutral\nif\n(\na\n∧\nb\n)\n∨\n(\nb\n∧\nc\n)\n∨\n(\nc\n∧\na\n)\n=\n(\na\n∨\nb\n)\n∧\n(\nb\n∨\nc\n)\n∧\n(\nc\n∨\na\n)\nfor all\nb\n,\nc\n∈\nL\n.","source_id":"planetmath.specialelementsinalattice","source_sha256":"e878ef7db946edc58344fc4a19ba2b635e4395c1e92dbe661547f7b046b8331f","start":60}],"target_id":"concept.planetmath.specialelementsinalattice","target_kind":"node","target_sha256":"73c4d9ab65da7b33aab0820f30f735b5c0109da65c306d096a45adf2db3fb02f"}],"concept.planetmath.specialelementsinarelationalgebra":[{"id":"assertion.concept.planetmath.specialelementsinarelationalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Special elements in a relation algebra as stated in the captured PlanetMath entry specialelementsinarelationalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: Let A be a relation algebra with operators ( ∨ , ∧ , ; , ′ , - , 0 , 1 , i ) of type ( 2 , 2 , 2 , 1 , 1 , 0 , 0 , 0 ) .","support":[{"end":198,"quote":"Let\nA\nbe a\nrelation algebra\nwith\noperators\n(\n∨\n,\n∧\n,\n;\n,\n′\n,\n-\n,\n0\n,\n1\n,\ni\n)\nof type\n(\n2\n,\n2\n,\n2\n,\n1\n,\n1\n,\n0\n,\n0\n,\n0\n)\n.","source_id":"planetmath.specialelementsinarelationalgebra","source_sha256":"16496a532fb5c11fd917ade98d1f01bf610857c274d8511026da8430bef89643","start":78}],"target_id":"concept.planetmath.specialelementsinarelationalgebra","target_kind":"node","target_sha256":"ce934ea6abbdb7a4458707c562a0b40ee67d8509d0f2a50d67b69f053d7e8034"}],"concept.planetmath.sphenicnumber":[{"id":"assertion.concept.planetmath.sphenicnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sphenic number as stated in the captured PlanetMath entry sphenicnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A05) states: Given three primes p < q < r , the composite integer p ⁢ q ⁢ r is a sphenic number .","support":[{"end":114,"quote":"Given three primes\np\n<\nq\n<\nr\n, the\ncomposite\ninteger\np\n⁢\nq\n⁢\nr\nis a\nsphenic number\n.","source_id":"planetmath.sphenicnumber","source_sha256":"d8e27a32765209be20d482360648d8bc17c7643aac640b37ba88230abe5ab720","start":30}],"target_id":"concept.planetmath.sphenicnumber","target_kind":"node","target_sha256":"5f1936f944ba60951cb273c1bb25db4f469a23a39ec309afd8205b428ccf3d99"}],"concept.planetmath.stablesubspace":[{"id":"assertion.concept.planetmath.stablesubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Stable subspace as stated in the captured PlanetMath entry stablesubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A subset S of a larger set T is said to a stable subset for a function f : T → T iff f ⁢ ( S ) ⊂ S .","support":[{"end":132,"quote":"A subset\nS\nof a larger set\nT\nis said to a\nstable subset\nfor a function\nf\n:\nT\n→\nT\niff\nf\n⁢\n(\nS\n)\n⊂\nS\n.","source_id":"planetmath.stablesubspace","source_sha256":"719810aa4d87b785b22dd569c60ea9b6ec45c5ba5f341c2023ccc0ef3785dcd0","start":32}],"target_id":"concept.planetmath.stablesubspace","target_kind":"node","target_sha256":"ee753b34a471eb0d9f89c03d7734128ac1847f7213c6c576ae0fa48b71e78983"}],"concept.planetmath.standardenumeration":[{"id":"assertion.concept.planetmath.standardenumeration","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Standard enumeration as stated in the captured PlanetMath entry standardenumeration","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45, 03B65) states: The standard enumeration of { 0 , 1 } * is the sequence of strings s 0 = λ , s 1 = 0 , s 2 = 1 , s 3 = 00 , s 4 = 01 , ⋯ in lexicographic order .","support":[{"end":187,"quote":"The\nstandard enumeration\nof\n{\n0\n,\n1\n}\n*\nis the\nsequence\nof strings\ns\n0\n=\nλ\n,\ns\n1\n=\n0\n,\ns\n2\n=\n1\n,\ns\n3\n=\n00\n,\ns\n4\n=\n01\n,\n⋯\nin\nlexicographic order\n.","source_id":"planetmath.standardenumeration","source_sha256":"bf349fdcb760e2ccc6ac097dc6e5148d0778d684950dbb22016bea215462c759","start":42}],"target_id":"concept.planetmath.standardenumeration","target_kind":"node","target_sha256":"47a7f310dda5db687ca5ba6d5ae0d351b7d436bca1308e87892166c0542bf74c"}],"concept.planetmath.stronglyminimal":[{"id":"assertion.concept.planetmath.stronglyminimal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Strongly minimal as stated in the captured PlanetMath entry stronglyminimal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03C10, 03C45) states: Let L be a first order language and let M be an L - structure .","support":[{"end":97,"quote":"Let\nL\nbe a\nfirst order language\nand let\nM\nbe an\nL\n-\nstructure\n.","source_id":"planetmath.stronglyminimal","source_sha256":"519140432b257b29fe53aff362f3404f7bcb2b4b9f25602864997896d498a2be","start":34}],"target_id":"concept.planetmath.stronglyminimal","target_kind":"node","target_sha256":"43145605304aed123b026f0c4621de5ac693c59334865721e3dcadd55e8cb919"}],"concept.planetmath.structurehomomorphism":[{"id":"assertion.concept.planetmath.structurehomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Structure homomorphism as stated in the captured PlanetMath entry structurehomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 be two structures for Σ .","support":[{"end":112,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\nand\n𝔅\nbe two\nstructures\nfor\nΣ\n.","source_id":"planetmath.structurehomomorphism","source_sha256":"3f0953a8dc215da08e6312e6d37f9cb0938d8137909cef0eb342a335dfe311f6","start":46}],"target_id":"concept.planetmath.structurehomomorphism","target_kind":"node","target_sha256":"ebec43db16a3ba5f18c4c67d729b5bc11b2a7de0ffe841cb0ab8dfb59c40d064"}],"concept.planetmath.subalgebraofanalgebraicsystem":[{"id":"assertion.concept.planetmath.subalgebraofanalgebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subalgebra of an algebraic system as stated in the captured PlanetMath entry subalgebraofanalgebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A30, 08A05, 08A62) states: Let ( A , O ) be an algebraic system ( A ≠ ∅ is the underlying set and O is the set of operators on A ).","support":[{"end":172,"quote":"Let\n(\nA\n,\nO\n)\nbe an\nalgebraic system\n(\nA\n≠\n∅\nis the underlying set and\nO\nis the set of\noperators\non\nA\n).","source_id":"planetmath.subalgebraofanalgebraicsystem","source_sha256":"ff0a1d28d0ad7a35d76566557fd1e34cef5e1474bcce6325af14f7795b4c1f6b","start":68}],"target_id":"concept.planetmath.subalgebraofanalgebraicsystem","target_kind":"node","target_sha256":"01a9eaeab4e55b4d926ad8296f47107561fa39971bfcaa6427978d5439e297ac"}],"concept.planetmath.subalgebraofapartialalgebra":[{"id":"assertion.concept.planetmath.subalgebraofapartialalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subalgebra of a partial algebra as stated in the captured PlanetMath entry subalgebraofapartialalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Unlike an algebraic system , where there is only one way to define a subalgebra , there are several ways to define a subalgebra of a partial algebra .","support":[{"end":214,"quote":"Unlike an\nalgebraic system\n, where there is only one way to define a\nsubalgebra\n, there are several ways to define a subalgebra of a\npartial algebra\n.","source_id":"planetmath.subalgebraofapartialalgebra","source_sha256":"986913f311c247522577fba96b79bccd6e6b542137e0cfbafa53d4d8781ece14","start":64}],"target_id":"concept.planetmath.subalgebraofapartialalgebra","target_kind":"node","target_sha256":"d011825b7daa8327514cdf305de37b03f2715f72401d4c0cc3e5ab3b86b465f8"}],"concept.planetmath.subbasis":[{"id":"assertion.concept.planetmath.subbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subbasis as stated in the captured PlanetMath entry subbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let ( X , 𝒯 ) be a topological space . A subset 𝒜 ⊆ 𝒯 is said to be a subbasis if the collection ℬ of intersections of finitely many elements of 𝒜 is a basis ( http://planetmath.org/BasisTopologicalSpace ) for 𝒯 .","support":[{"end":231,"quote":"Let\n(\nX\n,\n𝒯\n)\nbe a\ntopological space\n. A subset\n𝒜\n⊆\n𝒯\nis said to be a\nsubbasis\nif the\ncollection\nℬ\nof\nintersections\nof finitely many\nelements of\n𝒜\nis a basis (\nhttp://planetmath.org/BasisTopologicalSpace\n) for\n𝒯\n.","source_id":"planetmath.subbasis","source_sha256":"ba37f1039619d691264fb2f51528672dbca5f88cf85cdba536a51e8fed4cc00c","start":18}],"target_id":"concept.planetmath.subbasis","target_kind":"node","target_sha256":"0ad7c081e6b8318787952f36cff78e99e8132f37beb57b4f62b4e021cb57c2d8"}],"concept.planetmath.subcommutative":[{"id":"assertion.concept.planetmath.subcommutative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subcommutative as stated in the captured PlanetMath entry subcommutative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M25, 20M99) states: A semigroup ( S , ⋅ ) is said to be left subcommutative if for any two of its elements a and b , there exists its element c such that a ⁢ b = c ⁢ a .","support":[{"end":179,"quote":"A\nsemigroup\n(\nS\n,\n⋅\n)\nis said to be\nleft subcommutative\nif for any two of its elements\na\nand\nb\n, there exists its element\nc\nsuch that\na\n⁢\nb\n=\nc\n⁢\na\n.","source_id":"planetmath.subcommutative","source_sha256":"01e13f1c2e85170045ef760c92f47079f4520bd85f68c2771a491873929b3a71","start":30}],"target_id":"concept.planetmath.subcommutative","target_kind":"node","target_sha256":"7d9177f4a65be5786e4d3ff50b67db1b6e9b56965687d5e68a0a4a928046d1be"}],"concept.planetmath.subformula":[{"id":"assertion.concept.planetmath.subformula","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subformula as stated in the captured PlanetMath entry subformula","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let L be a first order language and suppose φ is a formula of L .","support":[{"end":87,"quote":"Let\nL\nbe a\nfirst order language\nand suppose\nφ\nis a\nformula\nof\nL\n.","source_id":"planetmath.subformula","source_sha256":"3e403021e309679cb251fd57077b6a1adc4bf8c3559e737715f060cc3a10dcdd","start":22}],"target_id":"concept.planetmath.subformula","target_kind":"node","target_sha256":"56a08b77af46a9130b6a7c625506ba2d2874f158733258548607b218088ca161"}],"concept.planetmath.subfunction":[{"id":"assertion.concept.planetmath.subfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subfunction as stated in the captured PlanetMath entry subfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E20) states: Definition . Let f : A → B and g : C → D be partial functions .","support":[{"end":87,"quote":"Definition\n. Let\nf\n:\nA\n→\nB\nand\ng\n:\nC\n→\nD\nbe\npartial functions\n.","source_id":"planetmath.subfunction","source_sha256":"8f003f7a3d9f8848cb7cfb9f75d9d7c15eb34c8dc8d63ee7c66759a92f5213a3","start":24}],"target_id":"concept.planetmath.subfunction","target_kind":"node","target_sha256":"a0b51a3a5f3292fdcc6e4150438e0009c1a16e997f88820e185a0973702f54e8"}],"concept.planetmath.subgroup":[{"id":"assertion.concept.planetmath.subgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subgroup as stated in the captured PlanetMath entry subgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Definition: Let ( G , * ) be a group and let K be subset of G .","support":[{"end":81,"quote":"Definition:\nLet\n(\nG\n,\n*\n)\nbe a group and let\nK\nbe subset of\nG\n.","source_id":"planetmath.subgroup","source_sha256":"bc107f3ebbd708fbdf217d3c0623aed4c0d9853ee69e5c00ddbfe85002ed3448","start":18}],"target_id":"concept.planetmath.subgroup","target_kind":"node","target_sha256":"a803c09fec17945ee6ccd9c93e511eb0fe83237e9d00e5882c270aa421f43b63"}],"concept.planetmath.submanifold":[{"id":"assertion.concept.planetmath.submanifold","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Submanifold as stated in the captured PlanetMath entry submanifold","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 32V40, 53C40, 53B25, 57N99) states: There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","support":[{"end":134,"quote":"There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","source_id":"planetmath.submanifold","source_sha256":"427fa9c3d3261a10e212358655aa293593b0f8b5e10a02cd313b9f9e62954482","start":24}],"target_id":"concept.planetmath.submanifold","target_kind":"node","target_sha256":"61b87ab468cadd4dd202e47d3d0f097baed0573fa28878a65b61c20885bc60fb"}],"concept.planetmath.subspacetopology":[{"id":"assertion.concept.planetmath.subspacetopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subspace topology as stated in the captured PlanetMath entry subspacetopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B05, 15A66, 11E88) states: Let X be a topological space , and let Y ⊂ X be a subset.","support":[{"end":93,"quote":"Let\nX\nbe a\ntopological space\n, and let\nY\n⊂\nX\nbe a subset.","source_id":"planetmath.subspacetopology","source_sha256":"a222c4cf2a2c6f893accff07dd6cf06454fdc90d1d515623359af251297e150f","start":36}],"target_id":"concept.planetmath.subspacetopology","target_kind":"node","target_sha256":"a356672dbd6079a7b0f415c909aef28784ccd002042583392e96df8c25283a86"}],"concept.planetmath.substitutability":[{"id":"assertion.concept.planetmath.substitutability","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substitutability as stated in the captured PlanetMath entry substitutability","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10, 03B05) states: In any logical system , the way to obtain (well-formed) formulas from existing ones is by attaching logical connectives to existing ones.","support":[{"end":171,"quote":"In any\nlogical system\n, the way to obtain (well-formed)\nformulas\nfrom existing ones is by attaching\nlogical connectives\nto existing ones.","source_id":"planetmath.substitutability","source_sha256":"52645abf43e534804a54d5282b1ac4139b3daa57d7e27992bebb0dd3b6822239","start":34}],"target_id":"concept.planetmath.substitutability","target_kind":"node","target_sha256":"c7a3945518db7efd0287d187b2e1add8e49b801fcbbf37ae0aea20075447dd35"}],"concept.planetmath.substitutionsinpropositionallogic":[{"id":"assertion.concept.planetmath.substitutionsinpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substitutions in propositional logic as stated in the captured PlanetMath entry substitutionsinpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: Uniform Substitution One area of mathematics where substitution plays a prominent role is mathematical logic.","support":[{"end":183,"quote":"Uniform Substitution\nOne area of mathematics where\nsubstitution\nplays a prominent role is mathematical logic.","source_id":"planetmath.substitutionsinpropositionallogic","source_sha256":"1e89b6a478960d2418f5d4c9faf97498d8356d7aabea684ac3690780ec40affd","start":74}],"target_id":"concept.planetmath.substitutionsinpropositionallogic","target_kind":"node","target_sha256":"fe8508ec9a5e3bd35d387003860d33c8436793e21c76f9a27ab8316727f2ec2d"}],"concept.planetmath.substructure":[{"id":"assertion.concept.planetmath.substructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substructure as stated in the captured PlanetMath entry substructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 structures for Σ .","support":[{"end":85,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\nand\n𝔅\nstructures\nfor\nΣ\n.","source_id":"planetmath.substructure","source_sha256":"d8fd221fbd886df4f1b1d822e5afda10fea5078a5c3b1561d383f17fd6570bf7","start":26}],"target_id":"concept.planetmath.substructure","target_kind":"node","target_sha256":"a9af1634f6d16c6e71f00208ecd57adda7461c453231d5431df5ec1c3decfac6"}],"concept.planetmath.subtraction":[{"id":"assertion.concept.planetmath.subtraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subtraction as stated in the captured PlanetMath entry subtraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A06, 00A05, 11B25) states: Subtraction is a mathematical operation in which the value of a number is decreased by the values of one or more other numbers.","support":[{"end":151,"quote":"Subtraction\nis a mathematical\noperation\nin which the value of a number is decreased by the values of one or more other numbers.","source_id":"planetmath.subtraction","source_sha256":"69f920b9fb837717d5e576bdec4574b35d943187974fe0ac4aee667df550caf0","start":24}],"target_id":"concept.planetmath.subtraction","target_kind":"node","target_sha256":"1cda9bd78c27a1f4a0c5bcde3cff7eb91702cf44dad6a06d8dc418f01081e9d3"}],"concept.planetmath.successor":[{"id":"assertion.concept.planetmath.successor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Successor as stated in the captured PlanetMath entry successor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10, 70K75) states: Given a set S , the successor of S is the set S ∪ { S } .","support":[{"end":77,"quote":"Given a set\nS\n, the\nsuccessor\nof\nS\nis the set\nS\n∪\n{\nS\n}\n.","source_id":"planetmath.successor","source_sha256":"10b03f69d292ffc970b9e1596ad4deb0a361e80ec386558664e211bb3ce328b7","start":20}],"target_id":"concept.planetmath.successor","target_kind":"node","target_sha256":"d8fa901e39a616399c4f238eea715fa7119db34b6cf912ca535d3696fc9fa04e"}],"concept.planetmath.summation":[{"id":"assertion.concept.planetmath.summation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Summation as stated in the captured PlanetMath entry summation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 11B25, 00A05) states: Sigma notation Sigma notation is often used to write complicated sums in a concise and compact way.","support":[{"end":119,"quote":"Sigma notation\nSigma notation\nis often used to write complicated sums in a concise and compact way.","source_id":"planetmath.summation","source_sha256":"4a178ef100d799211fa7e3ade380a2c3d9e38b6fe784c52ec0ef16c016f2b41c","start":20}],"target_id":"concept.planetmath.summation","target_kind":"node","target_sha256":"2b99f7052d54853eae89e11c3da0e99a9611cf5839d06901ee110f236d74c1c7"}],"concept.planetmath.surjective":[{"id":"assertion.concept.planetmath.surjective","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Surjective as stated in the captured PlanetMath entry surjective","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: A function f : X → Y is called surjective or onto if, for every y ∈ Y , there is an x ∈ X such that f ⁢ ( x ) = y .","support":[{"end":137,"quote":"A\nfunction\nf\n:\nX\n→\nY\nis called\nsurjective\nor\nonto\nif, for every\ny\n∈\nY\n, there is an\nx\n∈\nX\nsuch that\nf\n⁢\n(\nx\n)\n=\ny\n.","source_id":"planetmath.surjective","source_sha256":"c65167780b32650905a82dfda136bd9bc6df64312f07348aa9f0f097fb8bf9e1","start":22}],"target_id":"concept.planetmath.surjective","target_kind":"node","target_sha256":"7305b12f79d8034abac08c8554a8eccf0523230de166d5f224462753aa4879b5"}],"concept.planetmath.symmetricdifference":[{"id":"assertion.concept.planetmath.symmetricdifference","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric difference as stated in the captured PlanetMath entry symmetricdifference","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: The symmetric difference between two sets A and B , written A ⁢ △ ⁢ B , is the set of all x such that either x ∈ A or x ∈ B but not both.","support":[{"end":179,"quote":"The\nsymmetric difference\nbetween two sets\nA\nand\nB\n, written\nA\n⁢\n△\n⁢\nB\n, is the set of all\nx\nsuch that either\nx\n∈\nA\nor\nx\n∈\nB\nbut not both.","source_id":"planetmath.symmetricdifference","source_sha256":"31d44c61a55c610026d01770e60693b8bc5fc479a522f524dd7b0090afe263de","start":42}],"target_id":"concept.planetmath.symmetricdifference","target_kind":"node","target_sha256":"9f2a6a6891d68acb94d0eabf844dfae303b54985426d558e41e245383f0e6447"}],"concept.planetmath.symmetricinversesemigroup":[{"id":"assertion.concept.planetmath.symmetricinversesemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric inverse semigroup as stated in the captured PlanetMath entry symmetricinversesemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M18) states: Let X be a set. A partial map on X is an application defined from a subset of X into X .","support":[{"end":144,"quote":"Let\nX\nbe a set. A\npartial map\non\nX\nis an application defined from a subset of\nX\ninto\nX\n.","source_id":"planetmath.symmetricinversesemigroup","source_sha256":"fa08456ad4d126371fedf92416d16125231de1c3e10bbb34a762bf49c662a5b5","start":56}],"target_id":"concept.planetmath.symmetricinversesemigroup","target_kind":"node","target_sha256":"ed981b53f69adf3f6920a0f08730c26674e9ced8333974207de6732343589722"}],"concept.planetmath.symmetricmatrix":[{"id":"assertion.concept.planetmath.symmetricmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric matrix as stated in the captured PlanetMath entry symmetricmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Definition : Let A = ( a i ⁢ j ) be a square matrix of order n .","support":[{"end":98,"quote":"Definition\n:\nLet\nA\n=\n(\na\ni\n⁢\nj\n)\nbe a\nsquare matrix\nof\norder\nn\n.","source_id":"planetmath.symmetricmatrix","source_sha256":"1b2edc69e3d426a2f0b7298d9e4a6e10b1ce868553bc6f74c94557c0c550c98c","start":34}],"target_id":"concept.planetmath.symmetricmatrix","target_kind":"node","target_sha256":"c64421e6152977460341f4e36304a2cd85d4033ab59041b49d8dab80ad05ee58"}],"concept.planetmath.symmetricrelation":[{"id":"assertion.concept.planetmath.symmetricrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric relation as stated in the captured PlanetMath entry symmetricrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is symmetric if and only if whenever x ⁢ ℛ ⁢ y for some x , y ∈ A then also y ⁢ ℛ ⁢ x .","support":[{"end":149,"quote":"A\nrelation\nℛ\non a set\nA\nis\nsymmetric\nif and only if\nwhenever\nx\n⁢\nℛ\n⁢\ny\nfor some\nx\n,\ny\n∈\nA\nthen also\ny\n⁢\nℛ\n⁢\nx\n.","source_id":"planetmath.symmetricrelation","source_sha256":"3bb6baddcbe1a65ebc172680f0b540dcf404fc930a75edbe8aacd76523063391","start":38}],"target_id":"concept.planetmath.symmetricrelation","target_kind":"node","target_sha256":"953afe939ede86770b47ec43db4459da6d0df499dd0a9b0b571c1c5c8192f7ea"}],"concept.planetmath.symmetry":[{"id":"assertion.concept.planetmath.symmetry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetry as stated in the captured PlanetMath entry symmetry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51A10, 15A04, 51A15) states: Let V be a Euclidean vector space , F ⊆ V , and E : V → V be a Euclidean transformation that is not the identity map .","support":[{"end":136,"quote":"Let\nV\nbe a\nEuclidean vector space\n,\nF\n⊆\nV\n, and\nE\n:\nV\n→\nV\nbe a\nEuclidean transformation\nthat is not the\nidentity map\n.","source_id":"planetmath.symmetry","source_sha256":"ac6748326da1160762ae945ac1507eda933238606d74d822d07030699efc16ce","start":18}],"target_id":"concept.planetmath.symmetry","target_kind":"node","target_sha256":"bb2f3254b49a52ff38fd74eab0a7a3ba2cfefd30d5e2b38d7febd066b74afbd5"}],"concept.planetmath.t3space":[{"id":"assertion.concept.planetmath.t3space","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"T3 space as stated in the captured PlanetMath entry t3space","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: A regular space is a topological space in which points and closed sets can be separated by open sets ; in other words, given a closed set A and a point x ∉ A , there are disjoint open sets U and V such that x ∈ U and A ⊆ V .","support":[{"end":242,"quote":"A\nregular space\nis a\ntopological space\nin which points and\nclosed sets\ncan be\nseparated\nby\nopen sets\n;\nin other words, given a closed set\nA\nand a point\nx\n∉\nA\n,\nthere are disjoint open sets\nU\nand\nV\nsuch that\nx\n∈\nU\nand\nA\n⊆\nV\n.","source_id":"planetmath.t3space","source_sha256":"bca96f50cb0cca3b8dc1381722b137d80e040779b09e7f3be79c8f1f63c805c2","start":18}],"target_id":"concept.planetmath.t3space","target_kind":"node","target_sha256":"61981b76f9ac5b1f92d5312d9142f314d8d9e208b895510630b7a8aac941f306"}],"concept.planetmath.tacitmultiplicationoperator":[{"id":"assertion.concept.planetmath.tacitmultiplicationoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tacit multiplication operator as stated in the captured PlanetMath entry tacitmultiplicationoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A99) states: A tacit multiplication operator is a multiplication operator not actually written in a formula but usually understood from the context , at least by humans.","support":[{"end":216,"quote":"A\ntacit multiplication operator\nis a\nmultiplication operator\nnot actually written in a formula but usually understood from the\ncontext\n, at least by humans.","source_id":"planetmath.tacitmultiplicationoperator","source_sha256":"2e9b291b169fd6d682cebc8d6d0c8739e4af0594dd85242c987949d13356e786","start":60}],"target_id":"concept.planetmath.tacitmultiplicationoperator","target_kind":"node","target_sha256":"7f506904cd295815fd6879296b50d520ab7a5b61e41660633950a5f39a3855a5"}],"concept.planetmath.tangentline":[{"id":"assertion.concept.planetmath.tangentline","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tangent line as stated in the captured PlanetMath entry tangentline","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B05, 26A24) states: If the curve y = f ⁢ ( x ) of x ⁢ y -plane is sufficiently smooth in its point ( x 0 , y 0 ) and in a neighborhood of this, the curve may have a tangent line (or simply ) in ( x 0 , y 0 ) .","support":[{"end":215,"quote":"If the curve\ny\n=\nf\n⁢\n(\nx\n)\nof\nx\n⁢\ny\n-plane is sufficiently smooth in its point\n(\nx\n0\n,\ny\n0\n)\nand in a\nneighborhood\nof this, the curve may have a\ntangent line\n(or simply ) in\n(\nx\n0\n,\ny\n0\n)\n.","source_id":"planetmath.tangentline","source_sha256":"451cfd3d280f72c5a473bf9c619d2719b029242930e1eb934c9f551603fd6bb0","start":26}],"target_id":"concept.planetmath.tangentline","target_kind":"node","target_sha256":"8e0f1a6f8fa93629cda5cd228414dae7428bc81d89fc3e317ff06d2ee331dee5"}],"concept.planetmath.tautology":[{"id":"assertion.concept.planetmath.tautology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tautology as stated in the captured PlanetMath entry tautology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03B10) states: A tautology is a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","support":[{"end":166,"quote":"A\ntautology\nis a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","source_id":"planetmath.tautology","source_sha256":"af957c6b40f4b1c0ee34d72a2da92e0824211ce1bf4aaaca25412a280633e0d3","start":20}],"target_id":"concept.planetmath.tautology","target_kind":"node","target_sha256":"5799d68a02f51c4fd5b240fba29675329428666f7fabce9a8179254fe816af5c"}],"concept.planetmath.tensorproduct":[{"id":"assertion.concept.planetmath.tensorproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tensor product as stated in the captured PlanetMath entry tensorproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13-00, 18-00) states: Summary. The tensor product is a formal bilinear multiplication of two modules or vector spaces .","support":[{"end":127,"quote":"Summary.\nThe\ntensor product\nis a formal\nbilinear\nmultiplication\nof two modules or\nvector spaces\n.","source_id":"planetmath.tensorproduct","source_sha256":"38c5b7c5ee9b7b8267a76c7f04bd6aef984fe287a07ed12ab829628fdf175ec0","start":30}],"target_id":"concept.planetmath.tensorproduct","target_kind":"node","target_sha256":"44dd5442faf807f45d34e8db01b069151e0e55aae11d569d0d1e9c3ce2874e6b"}],"concept.planetmath.tensorproductvectorspaces":[{"id":"assertion.concept.planetmath.tensorproductvectorspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tensor product (vector spaces) as stated in the captured PlanetMath entry tensorproductvectorspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69) states: Definition . The classical conception of the tensor product operation involved finite dimensional vector spaces A , B , say over a field 𝕂 .","support":[{"end":202,"quote":"Definition\n.\nThe classical conception of the\ntensor product\noperation\ninvolved finite dimensional\nvector spaces\nA\n,\nB\n, say over\na field\n𝕂\n.","source_id":"planetmath.tensorproductvectorspaces","source_sha256":"5fb476fa33fef9fa33633ffa04fe067260012bf37ca3089844f84de9174d78c2","start":62}],"target_id":"concept.planetmath.tensorproductvectorspaces","target_kind":"node","target_sha256":"c15531e017a552586f761334eeaf7de1248a5d0be8e4350f38fe2a48bcba03a4"}],"concept.planetmath.textbookprojectsonplanetmath":[{"id":"assertion.concept.planetmath.textbookprojectsonplanetmath","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Textbook projects on PlanetMath as stated in the captured PlanetMath entry textbookprojectsonplanetmath","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: This will be a guide to textbook projects on PM. Since I don’t know if there currently are any textbook projects on PM, this is just a “stub” entry for now.","support":[{"end":220,"quote":"This will be a guide to textbook projects on PM. Since I don’t know\nif there currently are any textbook projects on PM, this is just a\n“stub” entry for now.","source_id":"planetmath.textbookprojectsonplanetmath","source_sha256":"a48229b3584bdf1864eaa6281d31e1440c0b95d20465ca8687442c86661d6274","start":64}],"target_id":"concept.planetmath.textbookprojectsonplanetmath","target_kind":"node","target_sha256":"7ea45e51742ae09ce8052ea859aa5c12632287239e65b32a6f05cff5c2b2015b"}],"concept.planetmath.theinclusionofclassicalintointuitionisticlogic":[{"id":"assertion.concept.planetmath.theinclusionofclassicalintointuitionisticlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"The inclusion of classical into intuitionistic logic as stated in the captured PlanetMath entry theinclusionofclassicalintointuitionisticlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B20, 03A05, 03-01) states: Abstract The entry is a report of Gödel’s 1933 first proof of the consistency of classical arithmetic by means of an interpretation of the basic concepts of intuitionistic logic .","support":[{"end":285,"quote":"Abstract\nThe entry is a report of\nGödel’s 1933\nfirst proof of the\nconsistency\nof classical\narithmetic\nby means of an\ninterpretation\nof the basic\nconcepts\nof\nintuitionistic logic\n.","source_id":"planetmath.theinclusionofclassicalintointuitionisticlogic","source_sha256":"99eb8ff68bd7d1fa9e62745915503a9be705cfbbab2b78217071be50df537293","start":106}],"target_id":"concept.planetmath.theinclusionofclassicalintointuitionisticlogic","target_kind":"node","target_sha256":"9f1654060f84921b861cd647ce523d04bf7b3aad45b6a7a0396ae56e9311c81f"}],"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics":[{"id":"assertion.concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topic entry on the algebraic foundations of mathematics as stated in the captured PlanetMath entry topicentryonthealgebraicfoundationsofmathematics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 08A99, 08A70, 18E05, 18-00, 03-00, 08A05) states: This is a contributed topic on the algebraic foundations of mathematics .","support":[{"end":185,"quote":"This is a contributed topic on the\nalgebraic foundations of mathematics\n.","source_id":"planetmath.topicentryonthealgebraicfoundationsofmathematics","source_sha256":"bd62d5caf1a24593ce1ea664b721802a828589d18cb509763b06c12754fb93b8","start":112}],"target_id":"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","target_kind":"node","target_sha256":"ac805ca2af0c09f2141b721d633afb60b4b9188ec24608ca71b89e4df12333bd"}],"concept.planetmath.topicsinalgebraictopology":[{"id":"assertion.concept.planetmath.topicsinalgebraictopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topics in algebraic topology as stated in the captured PlanetMath entry topicsinalgebraictopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 57R19, 57N65, 11F23, 11E72, 18-00, 55N30, 55N15, 55N99, 55N40, 55N20, 55-01) states: 1 Algebraic topology topics 1.1 Introduction Algebraic topology (AT) utilizes algebraic approaches to solve topological problems, such as the classification of surfaces , proving duality theorems for manifolds and approximation theorems for topological spaces .","support":[{"end":319,"quote":"1\nAlgebraic topology topics\n1.1\nIntroduction\nAlgebraic topology\n(AT) utilizes\nalgebraic\napproaches to solve topological problems,\nsuch as the classification of\nsurfaces\n, proving duality theorems for\nmanifolds\nand\napproximation theorems for topological spaces\n.","source_id":"planetmath.topicsinalgebraictopology","source_sha256":"e3c02ec134fa74cc757e7c504270f1d94a405e5f54474ced4e2e3f9141f2d799","start":58}],"target_id":"concept.planetmath.topicsinalgebraictopology","target_kind":"node","target_sha256":"a16117d37152d2b9489779c15efd1afe0e86e5446f0b72d70618684b8f9170ff"}],"concept.planetmath.topologicalspace":[{"id":"assertion.concept.planetmath.topologicalspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topological space as stated in the captured PlanetMath entry topologicalspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 22-00, 55-00, 54-00) states: A topological space is a set X together with a set 𝒯 whose elements are subsets of X , such that • ∅ ∈ 𝒯 • X ∈ 𝒯 • If U j ∈ 𝒯 for all j ∈ J , then ⋃ j ∈ J U j ∈ 𝒯 • If U ∈ 𝒯 and V ∈ 𝒯 , then U ∩ V ∈ 𝒯 Elements of 𝒯 are called open sets of X .","support":[{"end":278,"quote":"A\ntopological space\nis a set\nX\ntogether with a set\n𝒯\nwhose\nelements\nare subsets of\nX\n, such that\n•\n∅\n∈\n𝒯\n•\nX\n∈\n𝒯\n•\nIf\nU\nj\n∈\n𝒯\nfor all\nj\n∈\nJ\n, then\n⋃\nj\n∈\nJ\nU\nj\n∈\n𝒯\n•\nIf\nU\n∈\n𝒯\nand\nV\n∈\n𝒯\n, then\nU\n∩\nV\n∈\n𝒯\nElements of\n𝒯\nare called\nopen sets\nof\nX\n.","source_id":"planetmath.topologicalspace","source_sha256":"08da0ef4f3b09372c75b4e6f325b8fd7b52d5e78da74528dcbf840422ca8c1b2","start":36}],"target_id":"concept.planetmath.topologicalspace","target_kind":"node","target_sha256":"48af7e84512652721f6d1c0fea56cc4e98e63691c3a9c7ef9ed080369a5623ba"}],"concept.planetmath.topologicalvectorspace":[{"id":"assertion.concept.planetmath.topologicalvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topological vector space as stated in the captured PlanetMath entry topologicalvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A99) states: Definition A topological vector space is a pair ( V , 𝒯 ) , where V is a vector space over a topological field K , and 𝒯 is a topology on V such that under 𝒯 the scalar multiplication ( λ , v ) ↦ λ ⁢ v is a continuous function K × V → V and the vector addition ( v , w ) ↦ v + w is a continuous function V × V → V , where K × V and V × V are given the respective product topologies .","support":[{"end":433,"quote":"Definition\nA\ntopological vector space\nis a pair\n(\nV\n,\n𝒯\n)\n,\nwhere\nV\nis a\nvector space\nover a\ntopological field\nK\n,\nand\n𝒯\nis a\ntopology\non\nV\nsuch that under\n𝒯\nthe\nscalar multiplication\n(\nλ\n,\nv\n)\n↦\nλ\n⁢\nv\nis a\ncontinuous function\nK\n×\nV\n→\nV\nand the\nvector addition\n(\nv\n,\nw\n)\n↦\nv\n+\nw\nis a continuous function\nV\n×\nV\n→\nV\n,\nwhere\nK\n×\nV\nand\nV\n×\nV\nare given the respective\nproduct topologies\n.","source_id":"planetmath.topologicalvectorspace","source_sha256":"06c08d3a7be7cf64260c4699922575d2c5a6ab301eedaa622e7ed31f4f3de544","start":50}],"target_id":"concept.planetmath.topologicalvectorspace","target_kind":"node","target_sha256":"0f5d3e891f3e77f42e4ebd5888dd25462166d8bfabbe73779a4c0674823966cb"}],"concept.planetmath.topologyofthecomplexplane":[{"id":"assertion.concept.planetmath.topologyofthecomplexplane","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topology of the complex plane as stated in the captured PlanetMath entry topologyofthecomplexplane","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 30-00) states: The usual topology for the complex plane ℂ is the topology induced by the metric d ⁢ ( x , y ) := | x - y | for x , y ∈ ℂ .","support":[{"end":183,"quote":"The\nusual topology\nfor the\ncomplex plane\nℂ\nis the\ntopology\ninduced by the metric\nd\n⁢\n(\nx\n,\ny\n)\n:=\n|\nx\n-\ny\n|\nfor\nx\n,\ny\n∈\nℂ\n.","source_id":"planetmath.topologyofthecomplexplane","source_sha256":"84a9d441f0e43a480c002f3150cf263f335a468b648c396378a98f2499cede91","start":60}],"target_id":"concept.planetmath.topologyofthecomplexplane","target_kind":"node","target_sha256":"01aa33cba92123822406876507a9204f6f1b3d06720cd53b6e433b442d7cb398"}],"concept.planetmath.totaldifferential":[{"id":"assertion.concept.planetmath.totaldifferential","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Total differential as stated in the captured PlanetMath entry totaldifferential","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53A04, 26B05, 01A45) states: There is the generalisation of the theorem in the parent entry ( http:// planetmath .org/ Differential ) concerning the real functions of several variables; here we formulate it for three variables: Theorem.","support":[{"end":245,"quote":"There is the generalisation of the theorem in the parent entry (\nhttp://\nplanetmath\n.org/\nDifferential\n) concerning the\nreal functions\nof several variables; here we formulate it for three variables:\nTheorem.","source_id":"planetmath.totaldifferential","source_sha256":"11b9e5e42cb5a1f8c78a556ae21c1d3d7b54d9f643e481bca8005f51b93ca1d3","start":38}],"target_id":"concept.planetmath.totaldifferential","target_kind":"node","target_sha256":"a57d769fd5d997ff55aab60cf20f3ee736710ed9801d29e18a27679db8035eda"}],"concept.planetmath.toytheorem":[{"id":"assertion.concept.planetmath.toytheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Toy theorem as stated in the captured PlanetMath entry toytheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: A toy theorem is a simplified version of a more general theorem .","support":[{"end":89,"quote":"A\ntoy theorem\nis a simplified version of a more general\ntheorem\n.","source_id":"planetmath.toytheorem","source_sha256":"77712fc06c02a31362cd290e5f72c33c44d06b99700be111369db94ba237aa4a","start":24}],"target_id":"concept.planetmath.toytheorem","target_kind":"node","target_sha256":"aeed5686028db9af608dbee49c8ce68ddda22ce3a918da5e100e1d1d3297f477"}],"concept.planetmath.traceable":[{"id":"assertion.concept.planetmath.traceable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Traceable as stated in the captured PlanetMath entry traceable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C45, 03B22, 03-00, 03-01) states: Let G be a graph. If G has a Hamiltonian path , we say that G is traceable .","support":[{"end":96,"quote":"Let\nG\nbe a graph. If\nG\nhas a\nHamiltonian path\n, we say that\nG\nis\ntraceable\n.","source_id":"planetmath.traceable","source_sha256":"6055fd35b610031c95c70ce0f549218e3c93fdc0dfe6ea856d16644e2f10c24f","start":20}],"target_id":"concept.planetmath.traceable","target_kind":"node","target_sha256":"eb7415e0b26936642062df37f1ee90cd26ca8815e81e96d5629de3363e9bbe2b"}],"concept.planetmath.transformation":[{"id":"assertion.concept.planetmath.transformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transformation as stated in the captured PlanetMath entry transformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Synonym of mapping and function . Often used to refer to mappings where the domain and codomain are the same set, i.e.","support":[{"end":148,"quote":"Synonym of\nmapping\nand\nfunction\n. Often used to refer to mappings where the domain and\ncodomain are the same set, i.e.","source_id":"planetmath.transformation","source_sha256":"bd57c2f2d4219b8ceb81e9d73dbb4dfcc96c1d020fbd4f7f75815864305dc2f3","start":30}],"target_id":"concept.planetmath.transformation","target_kind":"node","target_sha256":"9525a8f42ed65b994bfcbeb3d5ea4a195ac8189fba3cbb6fb705aa55770532d8"}],"concept.planetmath.transitiverelation":[{"id":"assertion.concept.planetmath.transitiverelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transitive relation as stated in the captured PlanetMath entry transitiverelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is transitive if and only if ∀ x , y , z ∈ A , ( x ⁢ ℛ ⁢ y ∧ y ⁢ ℛ ⁢ z ) → ( x ⁢ ℛ ⁢ z ) .","support":[{"end":154,"quote":"A\nrelation\nℛ\non a set\nA\nis\ntransitive\nif and only if\n∀\nx\n,\ny\n,\nz\n∈\nA\n,\n(\nx\n⁢\nℛ\n⁢\ny\n∧\ny\n⁢\nℛ\n⁢\nz\n)\n→\n(\nx\n⁢\nℛ\n⁢\nz\n)\n.","source_id":"planetmath.transitiverelation","source_sha256":"89019ae1c6123fd2d9a8089f820d4b807eb44d6845521fa575a91f40fafada12","start":40}],"target_id":"concept.planetmath.transitiverelation","target_kind":"node","target_sha256":"eab3930aaf2552c32d0c13de2d317d544a8ad78467ffc8b6e3f6cfafb69025f8"}],"concept.planetmath.transpose":[{"id":"assertion.concept.planetmath.transpose","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transpose as stated in the captured PlanetMath entry transpose","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A57) states: The transpose of a matrix A is the matrix formed by “flipping” A about the diagonal line from the upper left corner.","support":[{"end":136,"quote":"The\ntranspose\nof a matrix\nA\nis the matrix formed by “flipping”\nA\nabout the\ndiagonal\nline from the upper left corner.","source_id":"planetmath.transpose","source_sha256":"6d1c69f24a3326d4e5b56018657bde2d03667f57ef69f92e553727920b6ca052","start":20}],"target_id":"concept.planetmath.transpose","target_kind":"node","target_sha256":"e545ef868eac55851b2efdc4371b8c41584f58806653a44ce237348e888add9e"}],"concept.planetmath.transposition":[{"id":"assertion.concept.planetmath.transposition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transposition as stated in the captured PlanetMath entry transposition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Given a finite set X = { a 1 , a 2 , … , a n } , a transposition is a permutation ( bijective function of X onto itself) f such that there exist indices i , j such that f ⁢ ( a i ) = a j , f ⁢ ( a j ) = a i and f ⁢ ( a k ) = a k for all other indices k .","support":[{"end":282,"quote":"Given a\nfinite set\nX\n=\n{\na\n1\n,\na\n2\n,\n…\n,\na\nn\n}\n, a\ntransposition\nis a\npermutation\n(\nbijective function\nof\nX\nonto itself)\nf\nsuch that there exist indices\ni\n,\nj\nsuch that\nf\n⁢\n(\na\ni\n)\n=\na\nj\n,\nf\n⁢\n(\na\nj\n)\n=\na\ni\nand\nf\n⁢\n(\na\nk\n)\n=\na\nk\nfor all other indices\nk\n.","source_id":"planetmath.transposition","source_sha256":"7baa71b0a04ee558fa07417a585e0297fe23882751934df0f71334a4a5d4e2de","start":28}],"target_id":"concept.planetmath.transposition","target_kind":"node","target_sha256":"ddb4cfa1b23307c1d62df6edfd8e65a16c8b8ba5bb8f8a7ada0c131223060787"}],"concept.planetmath.treesettheoretic":[{"id":"assertion.concept.planetmath.treesettheoretic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tree (set theoretic) as stated in the captured PlanetMath entry treesettheoretic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E05) states: In a set , a tree is defined to be a set T and a relation < T ⊆ T × T such that: • < T is a partial ordering of T • For any t ∈ T , { s ∈ T ∣ s < T t } is well-ordered The nodes (elements of the tree) immediately greater than a node are termed its children , the node immediately less is its parent (if it exists), any node less is an ancestor and any node greater is a descendant .","support":[{"end":424,"quote":"In a set , a\ntree\nis defined to be a set\nT\nand a\nrelation\n<\nT\n⊆\nT\n×\nT\nsuch that:\n•\n<\nT\nis a\npartial ordering\nof\nT\n•\nFor any\nt\n∈\nT\n,\n{\ns\n∈\nT\n∣\ns\n<\nT\nt\n}\nis\nwell-ordered\nThe nodes (elements of the tree) immediately greater than a node are termed its\nchildren\n, the node immediately less is its\nparent\n(if it exists), any node less is an\nancestor\nand any node greater is a\ndescendant\n.","source_id":"planetmath.treesettheoretic","source_sha256":"e9323bc0d0f01ef78931746e2a9c27f87d379d7bba843b0fba80a9d6d2935c4a","start":42}],"target_id":"concept.planetmath.treesettheoretic","target_kind":"node","target_sha256":"008a3ded31c364f4ff5478362fcc327d87414deffec95fa5dc937c22b9302fa5"}],"concept.planetmath.triadicrelation":[{"id":"assertion.concept.planetmath.triadicrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Triadic relation as stated in the captured PlanetMath entry triadicrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: In logic, mathematics, and semiotics, a triadic relation is an important special case of a polyadic or finitary relation, one in which the number of places in the relation is three.","support":[{"end":215,"quote":"In logic, mathematics, and semiotics, a\ntriadic relation\nis an important special case of a\npolyadic\nor finitary relation, one in which the number of places in the\nrelation\nis three.","source_id":"planetmath.triadicrelation","source_sha256":"0917c1c3aad02b4a33674e5ce2ed19ec3b45d3ceadc7cfdc05c5c94b2ebf40ba","start":34}],"target_id":"concept.planetmath.triadicrelation","target_kind":"node","target_sha256":"d4403e2c5c67bc9a6638cf5bc18753ecf69598efc5ba5563eef628c48a170a39"}],"concept.planetmath.trigonometry":[{"id":"assertion.concept.planetmath.trigonometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Trigonometry as stated in the captured PlanetMath entry trigonometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 43-00, 51-00, 42-00, 33B10) states: 1 Geometrical definitions Trigonometry arose in ancient times out of attempts to measure the lengths of various lines associated with circles.","support":[{"end":168,"quote":"1\nGeometrical definitions\nTrigonometry\narose in ancient times out of attempts to measure the lengths of various lines associated with circles.","source_id":"planetmath.trigonometry","source_sha256":"f4a761a7c046d6efd6b7ce8f8f8ce5d26d1509d271d97f7d8515e85b6fb9dbce","start":26}],"target_id":"concept.planetmath.trigonometry","target_kind":"node","target_sha256":"43c649f6154e3c6162979ae7b49a763a61679d8a82117aeaab4b8c891e3dda49"}],"concept.planetmath.truthfunction":[{"id":"assertion.concept.planetmath.truthfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth function as stated in the captured PlanetMath entry truthfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A truth function is a function that returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","support":[{"end":178,"quote":"A\ntruth function\nis a\nfunction\nthat returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","source_id":"planetmath.truthfunction","source_sha256":"52a0e7ba60e440dfeed593c1b20e6b07f798004c8a6a9773c5c50d0077d4f151","start":30}],"target_id":"concept.planetmath.truthfunction","target_kind":"node","target_sha256":"8781b657c0fde59f4d6c785eced90cc65620d1f420d6388dd462a3b17a24bdfa"}],"concept.planetmath.truthtable":[{"id":"assertion.concept.planetmath.truthtable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth table as stated in the captured PlanetMath entry truthtable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 34C29) states: A truth table is a tabular listing of all possible input value combinations for a logical function and their corresponding output values.","support":[{"end":161,"quote":"A\ntruth table\nis a tabular listing of all possible input value\ncombinations\nfor a logical\nfunction\nand their corresponding output values.","source_id":"planetmath.truthtable","source_sha256":"5ac52c74ac1098e84df4eb4087585c93ee694fd775c866f0e8b9d421362227d3","start":24}],"target_id":"concept.planetmath.truthtable","target_kind":"node","target_sha256":"4c0be2b0a44a2df3d96902d67be612751aa553444e565c8d6970953b8a323232"}],"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic":[{"id":"assertion.concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth-value semantics for classical propositional logic as stated in the captured PlanetMath entry truthvaluesemanticsforclassicalpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In classical propositional logic , an interpretation of a well-formed formula (wff) p is an assignment of truth (=1) or falsity (=0) to p .","support":[{"end":251,"quote":"In classical\npropositional logic\n, an\ninterpretation\nof a\nwell-formed formula\n(wff)\np\nis an assignment of truth (=1) or falsity (=0) to\np\n.","source_id":"planetmath.truthvaluesemanticsforclassicalpropositionallogic","source_sha256":"883caeeeadd90e3eccf17baff8c552fee643b346ae85e6db27cd9cbf7e0dadf1","start":112}],"target_id":"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","target_kind":"node","target_sha256":"eb7e381e7936536585f2c36643cec4a3dea3f3184213910495ffb83331db9f20"}],"concept.planetmath.turingcomputable":[{"id":"assertion.concept.planetmath.turingcomputable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Turing computable as stated in the captured PlanetMath entry turingcomputable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q05) states: A function is Turing computable if the function’s value can be computed with a Turing machine .","support":[{"end":131,"quote":"A\nfunction\nis\nTuring computable\nif the function’s value can be\ncomputed with a\nTuring machine\n.","source_id":"planetmath.turingcomputable","source_sha256":"511471a3de3dbe0a4fbddddbb766ba53fd4b77daf87a3cc1121a620feb1415cd","start":36}],"target_id":"concept.planetmath.turingcomputable","target_kind":"node","target_sha256":"93a0e58677d67afe873cf641cca442bdfe7a95a3ead68c656b5d4218738fb6e5"}],"concept.planetmath.tychonoffspace":[{"id":"assertion.concept.planetmath.tychonoffspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tychonoff space as stated in the captured PlanetMath entry tychonoffspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D15) states: A topological space X is said to be completely regular if whenever C ⊆ X is closed and x ∈ X ∖ C then there is a continuous function f : X → [ 0 , 1 ] with f ⁢ ( x ) = 0 and f ⁢ ( C ) ⊆ { 1 } .","support":[{"end":225,"quote":"A\ntopological space\nX\nis said to be\ncompletely regular\nif whenever\nC\n⊆\nX\nis closed and\nx\n∈\nX\n∖\nC\nthen there is a\ncontinuous function\nf\n:\nX\n→\n[\n0\n,\n1\n]\nwith\nf\n⁢\n(\nx\n)\n=\n0\nand\nf\n⁢\n(\nC\n)\n⊆\n{\n1\n}\n.","source_id":"planetmath.tychonoffspace","source_sha256":"d3a9afbc6b7cf95d4286e2913182f0373162f5589eb7590b76159f46bad9e915","start":32}],"target_id":"concept.planetmath.tychonoffspace","target_kind":"node","target_sha256":"da2b94d0b1ec8ad313d1bc265344a390672f14c9bd40b33fd39e4dbfa80423bb"}],"concept.planetmath.ultraconnectedspace":[{"id":"assertion.concept.planetmath.ultraconnectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ultraconnected space as stated in the captured PlanetMath entry ultraconnectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be ultraconnected if no pair of nonempty closed sets of X is disjoint.","support":[{"end":145,"quote":"A\ntopological space\nX\nis said to be\nultraconnected\nif no pair of nonempty\nclosed sets\nof\nX\nis disjoint.","source_id":"planetmath.ultraconnectedspace","source_sha256":"3f4fefd9dff0ef45c9aca7adf91e520781d540294780291fbba7bdd34373172b","start":42}],"target_id":"concept.planetmath.ultraconnectedspace","target_kind":"node","target_sha256":"375357f47c7a47395de8af848744e12539189f3ca2d9ca6018067051edf78569"}],"concept.planetmath.ultrametric":[{"id":"assertion.concept.planetmath.ultrametric","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ultrametric as stated in the captured PlanetMath entry ultrametric","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Any metric d : X × X → ℝ on a set X must satisfy the triangle inequality : ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ d ⁢ ( x , y ) + d ⁢ ( y , z ) An ultrametric must additionally satisfy a stronger version of the triangle inequality: ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ max ⁡ { d ⁢ ( x , y ) , d ⁢ ( y , z ) } Here is an example of an ultrametric on a space with 5 points, labelled a , b , c , d , e : a b c d e a 0 12 4 6 12 b 0 12 12 5 c 0 6 12 d 0 12 e 0 In the table above, an entry n in the for element x and the for element y indicates that d ⁢ ( x , y ) = n , where d is the ultrametric.","support":[{"end":607,"quote":"Any metric\nd\n:\nX\n×\nX\n→\nℝ\non a set\nX\nmust\nsatisfy\nthe\ntriangle inequality\n:\n(\n∀\nx\n,\ny\n,\nz\n)\nd\n⁢\n(\nx\n,\nz\n)\n≤\nd\n⁢\n(\nx\n,\ny\n)\n+\nd\n⁢\n(\ny\n,\nz\n)\nAn\nultrametric\nmust additionally satisfy a\nstronger\nversion of the triangle inequality:\n(\n∀\nx\n,\ny\n,\nz\n)\nd\n⁢\n(\nx\n,\nz\n)\n≤\nmax\n⁡\n{\nd\n⁢\n(\nx\n,\ny\n)\n,\nd\n⁢\n(\ny\n,\nz\n)\n}\nHere is an example of an ultrametric on a space with 5 points, labelled\na\n,\nb\n,\nc\n,\nd\n,\ne\n:\na\nb\nc\nd\ne\na\n0\n12\n4\n6\n12\nb\n0\n12\n12\n5\nc\n0\n6\n12\nd\n0\n12\ne\n0\nIn the table above, an entry\nn\nin the  for\nelement\nx\nand the  for element\ny\nindicates that\nd\n⁢\n(\nx\n,\ny\n)\n=\nn\n, where\nd\nis the ultrametric.","source_id":"planetmath.ultrametric","source_sha256":"e23412232c00479811946e18c100b3316694a1a09649946dd7b57527d8689541","start":24}],"target_id":"concept.planetmath.ultrametric","target_kind":"node","target_sha256":"d37e07286df3435c0a057fc50824630ba96ed2612be067c702a0305a79c0e3ec"}],"concept.planetmath.uncountable":[{"id":"assertion.concept.planetmath.uncountable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Uncountable as stated in the captured PlanetMath entry uncountable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: Definition A set is uncountable if it is not countable .","support":[{"end":80,"quote":"Definition\nA set is\nuncountable\nif it is not\ncountable\n.","source_id":"planetmath.uncountable","source_sha256":"39ef5804305608036b963862cfff8166cdf73735630f6d0ba48fa891e7031220","start":24}],"target_id":"concept.planetmath.uncountable","target_kind":"node","target_sha256":"e9287a60ec2b1d3b3135bb348d07744ffffa11a5b1d53c6abefb7e17c5bfe919"}],"concept.planetmath.uniformspace":[{"id":"assertion.concept.planetmath.uniformspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Uniform space as stated in the captured PlanetMath entry uniformspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E15) states: A uniform structure (or uniformity ) on a set X is a non empty set 𝒰 of subsets of X × X which satisfies the following axioms: 1.","support":[{"end":157,"quote":"A\nuniform structure\n(or\nuniformity\n) on a set\nX\nis a non\nempty set\n𝒰\nof subsets of\nX\n×\nX\nwhich\nsatisfies\nthe following axioms:\n1.","source_id":"planetmath.uniformspace","source_sha256":"7b5cdf2e89b74bae63e39f76ccd32991c2181649e7e48640962e27c19e23aafa","start":28}],"target_id":"concept.planetmath.uniformspace","target_kind":"node","target_sha256":"588494af3090c4ae7062c1faa6a6e6e3900eeacf6bdea4d99e2b0fd2d830178c"}],"concept.planetmath.unitvector":[{"id":"assertion.concept.planetmath.unitvector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Unit vector as stated in the captured PlanetMath entry unitvector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: A unit vector is a unit-length element of Euclidean space .","support":[{"end":83,"quote":"A\nunit vector\nis a unit-length element of\nEuclidean space\n.","source_id":"planetmath.unitvector","source_sha256":"2731aa4e4e4507ab1317fe2998c9517d964d19ee465eb1b78e3d977b310c3146","start":24}],"target_id":"concept.planetmath.unitvector","target_kind":"node","target_sha256":"fadef249fe1efdbf3871d32fab7e1503cb4c64f8d5ba3b53cd973d229dec839b"}],"concept.planetmath.universalbundle":[{"id":"assertion.concept.planetmath.universalbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal bundle as stated in the captured PlanetMath entry universalbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R10, 55R15) states: Let G be a topological group . A universal bundle for G is a principal bundle p : E ⁢ G → B ⁢ G such that for any principal bundle π : E → B , with B a CW-complex , there is a map φ : B → B ⁢ G , unique up to homotopy , such that the pullback bundle φ * ⁢ ( p ) is equivalent to π , that is such that there is a bundle map φ ′ .","support":[{"end":362,"quote":"Let\nG\nbe a\ntopological group\n. A\nuniversal bundle\nfor\nG\nis a\nprincipal bundle\np\n:\nE\n⁢\nG\n→\nB\n⁢\nG\nsuch that for any principal bundle\nπ\n:\nE\n→\nB\n, with\nB\na\nCW-complex\n, there is a map\nφ\n:\nB\n→\nB\n⁢\nG\n, unique up to\nhomotopy\n, such that the\npullback bundle\nφ\n*\n⁢\n(\np\n)\nis\nequivalent\nto\nπ\n, that is such that there is a\nbundle map\nφ\n′\n.","source_id":"planetmath.universalbundle","source_sha256":"97179618927595044772eee69ea8650898108e41f4687cf1acdfbfbd262589b8","start":34}],"target_id":"concept.planetmath.universalbundle","target_kind":"node","target_sha256":"fb00b2ef4fb3342e76b87622eb3c40fbfed2b20231074627442f7a613727b65c"}],"concept.planetmath.universalrelation":[{"id":"assertion.concept.planetmath.universalrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal relation as stated in the captured PlanetMath entry universalrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: If Φ is a class of n -ary relations with x → as the only free variables , an n + 1 -ary formula ψ is universal for Φ if for any ϕ ∈ Φ there is some e such that ψ ⁢ ( e , x → ) ↔ ϕ ⁢ ( x → ) .","support":[{"end":229,"quote":"If\nΦ\nis a class of\nn\n-ary\nrelations\nwith\nx\n→\nas the only\nfree variables\n, an\nn\n+\n1\n-ary\nformula\nψ\nis\nuniversal\nfor\nΦ\nif for any\nϕ\n∈\nΦ\nthere is some\ne\nsuch that\nψ\n⁢\n(\ne\n,\nx\n→\n)\n↔\nϕ\n⁢\n(\nx\n→\n)\n.","source_id":"planetmath.universalrelation","source_sha256":"af0ae9fa57c40fbb0fc52afd063fb21fde4276903fa87c8374be0a0cd9e0cdd3","start":38}],"target_id":"concept.planetmath.universalrelation","target_kind":"node","target_sha256":"29b5443ab2acea96f1352c3f87e02e5d2494459543a988d64c009c62dc31890e"}],"concept.planetmath.universalstructure":[{"id":"assertion.concept.planetmath.universalstructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal structure as stated in the captured PlanetMath entry universalstructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C50, 03C52) states: Let L be a first order language , and let R be an elementary class of L - structures .","support":[{"end":126,"quote":"Let\nL\nbe a\nfirst order language\n, and let\nR\nbe an\nelementary class\nof\nL\n-\nstructures\n.","source_id":"planetmath.universalstructure","source_sha256":"6c56fb5ac30e09d314f5193846e130bc1ff8821345a6cfae8bbbae8efcdd0a4b","start":40}],"target_id":"concept.planetmath.universalstructure","target_kind":"node","target_sha256":"975326834a6ae042567859efaf10796efd034d0644bb0d0946f0aaa662cf1d2a"}],"concept.planetmath.universeofdiscourse":[{"id":"assertion.concept.planetmath.universeofdiscourse","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universe of discourse as stated in the captured PlanetMath entry universeofdiscourse","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B48, 03B05, 03A05, 03G05) states: \\PMlinkescapephrase field \\PMlinkescapephrase Field \\PMlinkescapephrase limit \\PMlinkescapephrase Limit \\PMlinkescapephrase object \\PMlinkescapephrase Object \\PMlinkescapephrase objects \\PMlinkescapephrase Objects Boole (1854) defines universe of discourse in the following manner: In every discourse, whether of the mind conversing with its own thoughts, or of the individual in his intercourse with others, there is an assumed or expressed limit within which the subjects of its operation are confined.","support":[{"end":548,"quote":"\\PMlinkescapephrase\nfield\n\\PMlinkescapephrase\nField\n\\PMlinkescapephrase\nlimit\n\\PMlinkescapephrase\nLimit\n\\PMlinkescapephrase\nobject\n\\PMlinkescapephrase\nObject\n\\PMlinkescapephrase\nobjects\n\\PMlinkescapephrase\nObjects\nBoole (1854) defines\nuniverse of discourse\nin the following manner:\nIn every discourse, whether of the mind conversing with its own thoughts, or of the\nindividual\nin his intercourse with others, there is an assumed or expressed limit within which the subjects of its\noperation\nare confined.","source_id":"planetmath.universeofdiscourse","source_sha256":"2a8344b64f6c90ca356fbb19c9fc7df8d628135b1dd7681a0187f2b2d877bf1f","start":44}],"target_id":"concept.planetmath.universeofdiscourse","target_kind":"node","target_sha256":"e8cc8b36654295ac5689a37298efd7dedbf1ba02eb0a3b26fcce8bf0f4ad95bc"}],"concept.planetmath.variable":[{"id":"assertion.concept.planetmath.variable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Variable as stated in the captured PlanetMath entry variable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: The word variable as used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the context .","support":[{"end":189,"quote":"The word\nvariable\nas used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the\ncontext\n.","source_id":"planetmath.variable","source_sha256":"9404e0b0e188ac71e885f70730c5472662cb7dcdc0dcfd07d4f5cb71cea6d73e","start":18}],"target_id":"concept.planetmath.variable","target_kind":"node","target_sha256":"f7679d92c6b90909aa31dfb88c05fed5060f70ec14e59ca08aa48a0838141ae3"}],"concept.planetmath.vectorbundle":[{"id":"assertion.concept.planetmath.vectorbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector bundle as stated in the captured PlanetMath entry vectorbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R25) states: Basic definition A vector bundle is a fiber bundle having a vector space as a fiber and the general linear group of that vector space (or some subgroup ) as structure group.","support":[{"end":201,"quote":"Basic definition\nA\nvector bundle\nis a\nfiber bundle\nhaving a\nvector space\nas a fiber and the\ngeneral linear group\nof that vector space (or some\nsubgroup\n) as structure group.","source_id":"planetmath.vectorbundle","source_sha256":"2233d52cf1fb75cca43377f7bc94c875453671449b8af2dd359381125ae588c7","start":28}],"target_id":"concept.planetmath.vectorbundle","target_kind":"node","target_sha256":"5d78c0330119236851f8e9e1c2620496bca575079a4574199f41f0422de0f0e3"}],"concept.planetmath.vectorfield":[{"id":"assertion.concept.planetmath.vectorfield","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector field as stated in the captured PlanetMath entry vectorfield","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46E40) states: Vector fields in ℝ n Definition . A vector field v on some open set U ⊂ R n is a function which associates a vector v ⁢ ( x ) to each point x of U .","support":[{"end":174,"quote":"Vector fields in\nℝ\nn\nDefinition\n.\nA\nvector field\nv\non some open set\nU\n⊂\nR\nn\nis a\nfunction\nwhich associates a vector\nv\n⁢\n(\nx\n)\nto each point\nx\nof\nU\n.","source_id":"planetmath.vectorfield","source_sha256":"c2e20acac80258dc2499ebecf8864bf4e8c0333cf34aea041184a4c906f5a9d4","start":26}],"target_id":"concept.planetmath.vectorfield","target_kind":"node","target_sha256":"7dd9a51bb941e9aa5c26c756b7f350d5c5c2eae270ac869551d1ed47597a2663"}],"concept.planetmath.vectornorm":[{"id":"assertion.concept.planetmath.vectornorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector norm as stated in the captured PlanetMath entry vectornorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B20, 18-01, 20H15, 20B30) states: A vector norm on the real vector space V is a function f : V → ℝ that satisfies the following properties: f ⁢ ( x ) = 0 ⇔ x = 0 f ⁢ ( x ) ≥ 0 x ∈ V f ⁢ ( x + y ) ≤ f ⁢ ( x ) + f ⁢ ( y ) x , y ∈ V f ⁢ ( α ⁢ x ) = | α | ⁢ f ⁢ ( x ) α ∈ ℝ , x ∈ V Such a function is denoted as || x || .","support":[{"end":307,"quote":"A\nvector norm\non the\nreal vector space\nV\nis a function\nf\n:\nV\n→\nℝ\nthat satisfies the following properties:\nf\n⁢\n(\nx\n)\n=\n0\n⇔\nx\n=\n0\nf\n⁢\n(\nx\n)\n≥\n0\nx\n∈\nV\nf\n⁢\n(\nx\n+\ny\n)\n≤\nf\n⁢\n(\nx\n)\n+\nf\n⁢\n(\ny\n)\nx\n,\ny\n∈\nV\nf\n⁢\n(\nα\n⁢\nx\n)\n=\n|\nα\n|\n⁢\nf\n⁢\n(\nx\n)\nα\n∈\nℝ\n,\nx\n∈\nV\nSuch a function is denoted as\n||\nx\n||\n.","source_id":"planetmath.vectornorm","source_sha256":"28f4fbf40b5ae63aed15bfe76dabbe377f2dc058942e8866b9b088bb0077b245","start":24}],"target_id":"concept.planetmath.vectornorm","target_kind":"node","target_sha256":"2cd52c64c422a2f88b8d95ab67f174f72e33f7c79737583504cbddf43fe66915"}],"concept.planetmath.vectorproductingeneralvectorspaces":[{"id":"assertion.concept.planetmath.vectorproductingeneralvectorspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector product in general vector spaces as stated in the captured PlanetMath entry vectorproductingeneralvectorspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A72) states: The vector product can be defined in any finite dimensional vector space V with dim ⁡ V = n .","support":[{"end":173,"quote":"The\nvector product\ncan be defined in any finite dimensional\nvector space\nV\nwith\ndim\n⁡\nV\n=\nn\n.","source_id":"planetmath.vectorproductingeneralvectorspaces","source_sha256":"45060dbf6793a7b07b82f9859df5ab57c29afb12575d8cb6c9798ff13e2676ed","start":80}],"target_id":"concept.planetmath.vectorproductingeneralvectorspaces","target_kind":"node","target_sha256":"443ea6f66e86ae9e26671a02c7744603493f9878229306f17cba7230fc054756"}],"concept.planetmath.vectorspace":[{"id":"assertion.concept.planetmath.vectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector space as stated in the captured PlanetMath entry vectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16-00, 13-00, 20-00, 15-00, 70B15) states: Let F be a field (or, more generally, a division ring).","support":[{"end":81,"quote":"Let\nF\nbe a field (or, more generally, a division ring).","source_id":"planetmath.vectorspace","source_sha256":"49f146b93bc49524737a569d2970896b20f143ba87cb4d16fcda4a1fe612d48c","start":26}],"target_id":"concept.planetmath.vectorspace","target_kind":"node","target_sha256":"c356bee6c3976200ee5d365620c923f36c82ad686c611160a12e12b554657d95"}],"concept.planetmath.vectorsubspace":[{"id":"assertion.concept.planetmath.vectorsubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector subspace as stated in the captured PlanetMath entry vectorsubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Definition Let V be a vector space over a field F , and let W be a subset of V .","support":[{"end":112,"quote":"Definition\nLet\nV\nbe a\nvector space\nover a field\nF\n,\nand let\nW\nbe a subset of\nV\n.","source_id":"planetmath.vectorsubspace","source_sha256":"18c7c90578165b022246316cae76d41230f7be2d7ef2fc15d9a8a0b865e55dda","start":32}],"target_id":"concept.planetmath.vectorsubspace","target_kind":"node","target_sha256":"53d62305559b83e83ae2fc5d9b9078030c8efd61ce6664e38342522278d327d6"}],"concept.planetmath.vonneumannordinal":[{"id":"assertion.concept.planetmath.vonneumannordinal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Von Neumann ordinal as stated in the captured PlanetMath entry vonneumannordinal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: The is a method of defining ordinals in set theory .","support":[{"end":92,"quote":"The\nis a method of defining\nordinals\nin\nset theory\n.","source_id":"planetmath.vonneumannordinal","source_sha256":"8b3186e274131293428c708e0e83f8cccf3881297b1cf532d8818b6a7a2afb04","start":40}],"target_id":"concept.planetmath.vonneumannordinal","target_kind":"node","target_sha256":"485ecef12b0dcc1fdcc3c3e53a1ac195eb071a45d9e7d7cd8960d57c6dc495bc"}],"concept.planetmath.vonneumannregular":[{"id":"assertion.concept.planetmath.vonneumannregular","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Von Neumann regular as stated in the captured PlanetMath entry vonneumannregular","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16E50) states: An element a of a ring R is said to be von Neumann regular if there exists b ∈ R such that a ⁢ b ⁢ a = a .","support":[{"end":146,"quote":"An\nelement\na\nof a ring\nR\nis said to be\nvon Neumann regular\nif there\nexists\nb\n∈\nR\nsuch that\na\n⁢\nb\n⁢\na\n=\na\n.","source_id":"planetmath.vonneumannregular","source_sha256":"1596ef1a855f5aa6cf984b2799f7e734f507387517669535d27534aa9202373f","start":40}],"target_id":"concept.planetmath.vonneumannregular","target_kind":"node","target_sha256":"ee5b77bf1e8f7dbc4f80bae836bb2064963f1d6d2c5641af728654dda31e2a54"}],"concept.planetmath.waveequation":[{"id":"assertion.concept.planetmath.waveequation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Wave equation as stated in the captured PlanetMath entry waveequation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 35L05) states: The wave equation is a partial differential equation which describes certain kinds of waves.","support":[{"end":120,"quote":"The\nwave equation\nis a\npartial differential equation\nwhich\ndescribes certain kinds of waves.","source_id":"planetmath.waveequation","source_sha256":"ebab90ea6ee87fcaad10b4196f11d47ac13d3a535bfa57db8df665a00df64db6","start":28}],"target_id":"concept.planetmath.waveequation","target_kind":"node","target_sha256":"c8e000a1b4e3381c897533e504709427bb7ccadfc279305b33c93b3a6feaecd9"}],"concept.planetmath.welldefined":[{"id":"assertion.concept.planetmath.welldefined","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Well-defined as stated in the captured PlanetMath entry welldefined","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A mathematical concept is well-defined (German wohldefiniert , French bien défini ), if its contents is on the form or the alternative representative which is used for defining it.","support":[{"end":207,"quote":"A mathematical\nconcept\nis\nwell-defined\n(German\nwohldefiniert\n, French\nbien défini\n), if its contents is\n on the form or the alternative representative which is used for defining it.","source_id":"planetmath.welldefined","source_sha256":"4b0fa6fd5bd52e7883fc337c62b2771b21be41f930a9ab3a2fb73da47271450f","start":26}],"target_id":"concept.planetmath.welldefined","target_kind":"node","target_sha256":"42c77c00b64c817d05cd5fc77ea053d704d77a293adf2eaf7ed7f7ba93eed185"}],"concept.planetmath.z2":[{"id":"assertion.concept.planetmath.z2","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Z as stated in the captured PlanetMath entry z2","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: 2 Z 2 is the full system of second order arithmetic , that is, the full theory of numbers and sets of numbers.","support":[{"end":116,"quote":"2\nZ\n2\nis the full system of\nsecond order arithmetic\n, that is, the full theory of numbers and sets of numbers.","source_id":"planetmath.z2","source_sha256":"0a3afd57b58034ffbe50361a533409912a04e7f70008238bf2574c0034413312","start":6}],"target_id":"concept.planetmath.z2","target_kind":"node","target_sha256":"590d8aa97919be6488a961f9d875ef144dd3bf87a6be0de84d377b59ebabc6e5"}],"concept.planetmath.zermelofraenkelaxioms":[{"id":"assertion.concept.planetmath.zermelofraenkelaxioms","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zermelo-Fraenkel axioms as stated in the captured PlanetMath entry zermelofraenkelaxioms","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E99) states: Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a for what is now called Zermelo-Fraenkel set theory , or ZF.","support":[{"end":178,"quote":"Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a  for what is now called\nZermelo-Fraenkel set theory\n, or ZF.","source_id":"planetmath.zermelofraenkelaxioms","source_sha256":"bf41078d5e54b807d8d32ad80d015792d006381ba6797331d7ce715f4670890c","start":48}],"target_id":"concept.planetmath.zermelofraenkelaxioms","target_kind":"node","target_sha256":"42551dacdfebc6d16c21387e2a56e32667f191b525a6b6cb4da93273a7099273"}],"concept.planetmath.zerodivisor":[{"id":"assertion.concept.planetmath.zerodivisor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero divisor as stated in the captured PlanetMath entry zerodivisor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13G05) states: Let a be a nonzero element of a ring R . The element a is a left zero divisor if there exists a nonzero element b ∈ R such that a ⋅ b = 0 .","support":[{"end":165,"quote":"Let\na\nbe a nonzero element of a ring\nR\n.\nThe element\na\nis a\nleft zero divisor\nif there exists a nonzero element\nb\n∈\nR\nsuch that\na\n⋅\nb\n=\n0\n.","source_id":"planetmath.zerodivisor","source_sha256":"2675fd41dfce05df90db46e411eb44de5dd1077121f276882c068862a8c45c48","start":26}],"target_id":"concept.planetmath.zerodivisor","target_kind":"node","target_sha256":"08d9f6ecc7c2dc41409d89ad8dcf26a055df26408bb866143e64ecb00154da73"}],"concept.planetmath.zeroelements":[{"id":"assertion.concept.planetmath.zeroelements","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero elements as stated in the captured PlanetMath entry zeroelements","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let S be a semigroup . An element z is called a right zero [resp.","support":[{"end":93,"quote":"Let\nS\nbe a\nsemigroup\n. An\nelement\nz\nis called a\nright zero\n[resp.","source_id":"planetmath.zeroelements","source_sha256":"5c989a960c72cddc8962948e8392974eae2c44abd6b8266aafcfa9d756257921","start":28}],"target_id":"concept.planetmath.zeroelements","target_kind":"node","target_sha256":"7341e632f1c6dd8fd88944e968a50bcc8c6f844affe4d06f6115c07040f88557"}],"concept.planetmath.zeroofafunction":[{"id":"assertion.concept.planetmath.zeroofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero of a function as stated in the captured PlanetMath entry zeroofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26E99) states: \\PMlinkescapephrase closed set Suppose X is a set and f a complex ( http://planetmath.org/Complex )-valued function f : X → ℂ .","support":[{"end":165,"quote":"\\PMlinkescapephrase\nclosed set\nSuppose\nX\nis a set and\nf\na\ncomplex\n(\nhttp://planetmath.org/Complex\n)-valued\nfunction\nf\n:\nX\n→\nℂ\n.","source_id":"planetmath.zeroofafunction","source_sha256":"17a38be82a7a52dbfc6539b9b2650459a4a045e21d9bb48cb9ebb8f7180acf7b","start":38}],"target_id":"concept.planetmath.zeroofafunction","target_kind":"node","target_sha256":"194799ecdf35cd28aa092d1e983aac91bd6997f54d8d2cca9078f58347b1f6bc"}],"concept.planetmath.zerothorderlogic":[{"id":"assertion.concept.planetmath.zerothorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zeroth order logic as stated in the captured PlanetMath entry zerothorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G05, 03B05) states: \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase column \\PMlinkescapephrase Column \\PMlinkescapephrase columns \\PMlinkescapephrase Columns \\PMlinkescapephrase compact \\PMlinkescapephrase Compact \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formal logic \\PMlinkescapephrase Formal logic \\PMlinkescapephrase level \\PMlinkescapephrase Level \\PMlinkescapephrase order \\PMlinkescapephrase Order \\PMlinkescapephrase reference \\PMlinkescapephrase Reference \\PMlinkescapephrase translation \\PMlinkescapephrase Translation Note.","support":[{"end":615,"quote":"\\PMlinkescapephrase\ncalculus\n\\PMlinkescapephrase\nCalculus\n\\PMlinkescapephrase\ncolumn\n\\PMlinkescapephrase\nColumn\n\\PMlinkescapephrase\ncolumns\n\\PMlinkescapephrase\nColumns\n\\PMlinkescapephrase\ncompact\n\\PMlinkescapephrase\nCompact\n\\PMlinkescapephrase\ndegree\n\\PMlinkescapephrase\nDegree\n\\PMlinkescapephrase\nformal logic\n\\PMlinkescapephrase\nFormal logic\n\\PMlinkescapephrase\nlevel\n\\PMlinkescapephrase\nLevel\n\\PMlinkescapephrase\norder\n\\PMlinkescapephrase\nOrder\n\\PMlinkescapephrase\nreference\n\\PMlinkescapephrase\nReference\n\\PMlinkescapephrase\ntranslation\n\\PMlinkescapephrase\nTranslation\nNote.","source_id":"planetmath.zerothorderlogic","source_sha256":"b657c80d3346aba99c7f3652d317607f5ed7812cb13999e2d832afe05c89fca8","start":38}],"target_id":"concept.planetmath.zerothorderlogic","target_kind":"node","target_sha256":"c68ee30133159f1108e5df3063f5d53f73c3ad8fe84f0aa1612b7468ddfcf45d"}],"concept.quantum-information-gravity-test":[{"id":"assertion.complete.concept.quantum-information-gravity-test","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited proposals use entanglement between two spatially superposed masses as an indirect witness of quantum features of the mediating gravitational field; they do not report a completed measurement.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"concept.quantum-information-gravity-test","target_kind":"node","target_sha256":"e52c8dc12ae05b31d4f61cc051360fa0fced18636ce0161dafd7431068bcb31b"}],"concept.quantum-mediator-principle":[{"id":"assertion.complete.concept.quantum-mediator-principle","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Entanglement mediation implies nonclassical mediator structure in the cited argument.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"concept.quantum-mediator-principle","target_kind":"node","target_sha256":"11063b6b9d7b21d1a08a8088553349fbcf79944f7b4ff6bacdebcfc6060eb7fd"}],"concept.quantum-nature-of-gravity":[{"id":"assertion.complete.concept.quantum-nature-of-gravity","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Whether gravity has quantum degrees of freedom.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.quantum-nature-of-gravity","target_kind":"node","target_sha256":"f739d3c893998cfde46bb834d6046004c4dc3aa232cfe6f7582b53f087320a88"}],"concept.running-newton-constant":[{"id":"assertion.complete.concept.running-newton-constant","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Scale dependence of Newton coupling.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477}],"target_id":"concept.running-newton-constant","target_kind":"node","target_sha256":"87d83a6e0831c6f7c3760f2833b83bf52a31179adac51cc7619447ebd222d58b"}],"concept.single-graviton-signature":[{"id":"assertion.complete.concept.single-graviton-signature","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Discrete matter-gravity energy exchange as quantization clue.","support":[{"end":1443,"quote":"The quantization of gravity is widely believed to result in gravitons -- particles of discrete energy that form gravitational waves. But their detection has so far been considered impossible. Here we show that signatures of single graviton exchange can be observed in laboratory experiments. We show that stimulated and spontaneous single-graviton processes can become relevant for massive quantum acoustic resonators and that stimulated absorption can be resolved through continuous sensing of quantum jumps. We analyze the feasibility of observing the exchange of single energy quanta between matter and gravitational waves. Our results show that single graviton signatures are within reach of experiments. In analogy to the discovery of the photo-electric effect for photons, such signatures can provide the first experimental clue of the quantization of gravity.","source_id":"completion-source.c3fd2ff048f4ab5e51f1","source_sha256":"c9ed5d040eb702c4487c53daad529efbe4503831d59f32a671eef5d0622c3666","start":577}],"target_id":"concept.single-graviton-signature","target_kind":"node","target_sha256":"39183456cd4c2a365cde3710a32dd1ff6f85855d057dc75d6d5653004872a7f3"}],"concept.spin-correlation-readout":[{"id":"assertion.complete.concept.spin-correlation-readout","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spin correlations witness generated entanglement.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.spin-correlation-readout","target_kind":"node","target_sha256":"e510f5fc09a5675183fdf356ce1f06e745b459bf3005b03edb7df389f3d255a0"}],"concept.spin-dependent-cross-section":[{"id":"assertion.complete.concept.spin-dependent-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The spin-dependent WIMP-nucleon cross section is an interaction parameter on which the cited LZ nuclear-recoil search places constraints; it is not a detection of that interaction.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.spin-dependent-cross-section","target_kind":"node","target_sha256":"e47c92ae9333cf90063bd541c0f9de7f0708657aee11627c1e1905d368b170c3"}],"concept.sub-gev-dark-matter":[{"id":"assertion.complete.concept.sub-gev-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Dark-matter candidates below the conventional WIMP mass range.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"concept.sub-gev-dark-matter","target_kind":"node","target_sha256":"9752fc46fd70a72bcbc99df0ccbb8162687dea5adc87bcb94821e710adffe497"}],"concept.ultrashort-microlensing-events":[{"id":"assertion.complete.concept.ultrashort-microlensing-events","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Six very short events discussed as PBH or free-floating-planet candidates.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"concept.ultrashort-microlensing-events","target_kind":"node","target_sha256":"89f677abe1599d3e2fd11783ffa478d6d35927874f15b438fea9b46e6f06bc82"}],"concept.usgs.1005":[{"id":"assertion.concept.usgs.1005","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Rocks and deposits as defined in the captured USGS Thesaurus term 1005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Rocks and deposits as: Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms. This category is also used for crystals , with maps and atlases for lithologic maps , lithology , and rock composition","support":[{"end":425,"quote":"Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms.\nThis category is also used for\ncrystals\n,  with\nmaps and atlases\nfor\nlithologic maps\n,\nlithology\n, and\nrock composition","source_id":"usgs-thesaurus.1005","source_sha256":"44546750cc4b723a43ef3a8fa3370b001c883fb128e46228a28b15e23432dfba","start":118}],"target_id":"concept.usgs.1005","target_kind":"node","target_sha256":"90d3453aad9be5842c40c592f71ed50ce06da3458242a549a557b84eb0e23dee"}],"concept.usgs.101":[{"id":"assertion.concept.usgs.101","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biological and physical processes as defined in the captured USGS Thesaurus term 101","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biological and physical processes as: All continuing activities, functions, and phenomena associated with organisms and non-living matter. This category is also used for bioenergetic processes","support":[{"end":278,"quote":"All continuing activities, functions, and phenomena associated with organisms and non-living matter.\nThis category is also used for\nbioenergetic processes","source_id":"usgs-thesaurus.101","source_sha256":"66cfd8e2e5a757699bcce908b2650aed77bd19bc9490dbb077b96fd0777dfd0f","start":124}],"target_id":"concept.usgs.101","target_kind":"node","target_sha256":"019d958845a630b40da17961a5eb8e3676b0ffc8bef69d69dced923f059363c9"}],"concept.usgs.1010":[{"id":"assertion.concept.usgs.1010","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Salinity as defined in the captured USGS Thesaurus term 1010","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Salinity as: Measure of the concentration of salts dissolved in a solution. This category is also used for chloride concentration","support":[{"end":209,"quote":"Measure of the concentration of salts dissolved in a solution.\nThis category is also used for\nchloride concentration","source_id":"usgs-thesaurus.1010","source_sha256":"69f34cbfc050d227f6bfdb2f51840afe1070e2a0297a54a33271b754b6cd14db","start":93}],"target_id":"concept.usgs.1010","target_kind":"node","target_sha256":"44abde9cbab2bf8184df2200e9ea58fcbd382485e11317534f6d3e6d4c1c1b64"}],"concept.usgs.1028":[{"id":"assertion.concept.usgs.1028","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea-level change as defined in the captured USGS Thesaurus term 1028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea-level change as: Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface. Includes both global (eustatic) and local (relative) sea-level variations. This category is also used for sea level change , sea level rise , and sea-level rise","support":[{"end":528,"quote":"Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface.  Includes both global (eustatic) and local (relative) sea-level variations.\nThis category is also used for\nsea level change\n,\nsea level rise\n, and\nsea-level rise","source_id":"usgs-thesaurus.1028","source_sha256":"1ec69dfccc8b4e3f31c09c1f4985d4f167662b0c24d931042e80bdda6533435e","start":138}],"target_id":"concept.usgs.1028","target_kind":"node","target_sha256":"5c5335769baa99838e3476f043515f44a8881a0feda420a2437696c17186b7d4"}],"concept.usgs.1034":[{"id":"assertion.concept.usgs.1034","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sediment transport as defined in the captured USGS Thesaurus term 1034","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow","support":[{"end":622,"quote":"Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials.\nThis category is also used for\nalluvial transport\n,\nbed load\n,\nbedload\n,\ndensity flow\n,\ndust transport\n,  with\nestuarine processes\nfor\nestuarine sediment transport\n,  with\nlongshore currents\nfor\nlittoral drift\n,  with\nlongshore currents\nfor\nlongshore drift\n,  with\nocean processes\nfor\nmarine sediment transport\n,\nsuspended load\n, and\nturbidity flow","source_id":"usgs-thesaurus.1034","source_sha256":"da27563208acfdf678c3a45d4a7e91523bd5e6936f549c00bb98bb68d8d4efdb","start":151}],"target_id":"concept.usgs.1034","target_kind":"node","target_sha256":"89f6715573b4df01d6653cd69478a09ec9c6e6d94552d20edd686c94b6171cc5"}],"concept.usgs.1035":[{"id":"assertion.concept.usgs.1035","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sedimentary rocks as defined in the captured USGS Thesaurus term 1035","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sedimentary rocks as: Rocks formed by the consolidation of loose, uncemented pieces of sediments.","support":[{"end":212,"quote":"Rocks formed by the consolidation of loose, uncemented pieces of sediments.","source_id":"usgs-thesaurus.1035","source_sha256":"43a89c499792f971bb44a714c471ebf6dd93a8569d0375267524cf3478c38a0b","start":137}],"target_id":"concept.usgs.1035","target_kind":"node","target_sha256":"f3d383c712cfb5108128fc9e63eefb968f2a6b5eb0336abe53251b0056fd44b7"}],"concept.usgs.1036":[{"id":"assertion.concept.usgs.1036","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sedimentation as defined in the captured USGS Thesaurus term 1036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sedimentation as: Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials). The sediments settle out of water or air into layers on a surface. This category is also used for alluvial sedimentation , deposition (sediment) , and dust deposition","support":[{"end":423,"quote":"Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials).  The sediments settle out of water or air into layers on a surface.\nThis category is also used for\nalluvial sedimentation\n,\ndeposition (sediment)\n, and\ndust deposition","source_id":"usgs-thesaurus.1036","source_sha256":"f561bb544109fdadafe894e7a121fbfd9f74766792209a36c15c0ffae974c209","start":141}],"target_id":"concept.usgs.1036","target_kind":"node","target_sha256":"2e507f5e1ea49ed116a2cd8a44871a35c9266159810c06af039d566a1ce3a8d6"}],"concept.usgs.1072":[{"id":"assertion.concept.usgs.1072","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Snow and ice cover as defined in the captured USGS Thesaurus term 1072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Snow and ice cover as: Accumulation of snow or ice blanketing land surfaces. This category is also used for cryosphere , glaciers , ice , with drilling and coring for ice core sampling , and snowpack","support":[{"end":295,"quote":"Accumulation of snow or ice blanketing land surfaces.\nThis category is also used for\ncryosphere\n,\nglaciers\n,\nice\n,  with\ndrilling and coring\nfor\nice core sampling\n, and\nsnowpack","source_id":"usgs-thesaurus.1072","source_sha256":"dea1b1c81b023fa61bf083e98035adc8cb89cce51a9f5d686f26013c77d2041d","start":118}],"target_id":"concept.usgs.1072","target_kind":"node","target_sha256":"9a89082843c60ee14a1d4d2dcecbb991bf4a97a71139967c028dc3d8563cf704"}],"concept.usgs.1078":[{"id":"assertion.concept.usgs.1078","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil chemistry as defined in the captured USGS Thesaurus term 1078","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil chemistry as: Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","support":[{"end":246,"quote":"Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","source_id":"usgs-thesaurus.1078","source_sha256":"9a6f90f16720b3fa3fcdd749b9ce3a8b9b9e19ed1b2505eebdc94b2a76ea1cd9","start":120}],"target_id":"concept.usgs.1078","target_kind":"node","target_sha256":"447a52e33f64335d9816790752a685f31f339c80e3349c27ce99780fb8a5ccb7"}],"concept.usgs.108":[{"id":"assertion.concept.usgs.108","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biological productivity as defined in the captured USGS Thesaurus term 108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biological productivity as: The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","support":[{"end":398,"quote":"The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","source_id":"usgs-thesaurus.108","source_sha256":"802c5d9b91452e66a599cf1a1af77c155909bfefedcdf758474d7e65d3673a1b","start":163}],"target_id":"concept.usgs.108","target_kind":"node","target_sha256":"85fc0256180c3a0d99cba7f6aed2502e5040d973184e375dc8a316d850541ea5"}],"concept.usgs.1080":[{"id":"assertion.concept.usgs.1080","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil resources as defined in the captured USGS Thesaurus term 1080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil resources as: Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth. This category is also used with contamination and pollution for soil pollution","support":[{"end":300,"quote":"Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth.\nThis category is also used with\ncontamination and pollution\nfor\nsoil pollution","source_id":"usgs-thesaurus.1080","source_sha256":"3d8bf7b867984540533924199f8f00893b95123308fc5c5ef395e58cfb417afe","start":106}],"target_id":"concept.usgs.1080","target_kind":"node","target_sha256":"706b153281d063bd83461a18e1bf207ea9307f123fbae9b0d262052be0f8987f"}],"concept.usgs.1102":[{"id":"assertion.concept.usgs.1102","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Storms as defined in the captured USGS Thesaurus term 1102","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Storms as: Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","support":[{"end":288,"quote":"Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","source_id":"usgs-thesaurus.1102","source_sha256":"ed510e49a9d1acc6f2da5e36a8a79c1e934cdb215ab869d8ce3147feb9d0a1ec","start":143}],"target_id":"concept.usgs.1102","target_kind":"node","target_sha256":"fd175c3fac09537abd3562780ea9817d871889b3e9f0ba53ee613313f972a2aa"}],"concept.usgs.1103":[{"id":"assertion.concept.usgs.1103","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Stratigraphic sections as defined in the captured USGS Thesaurus term 1103","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Stratigraphic sections as: Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata. This category is also used for geologic sections , geologic units , sections (geologic) , sections (stratigraphic) , strata , and stratum","support":[{"end":378,"quote":"Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata.\nThis category is also used for\ngeologic sections\n,\ngeologic units\n,\nsections (geologic)\n,\nsections (stratigraphic)\n,\nstrata\n, and\nstratum","source_id":"usgs-thesaurus.1103","source_sha256":"4935f28a350e92cbf00e69f16e829c99684641fcbc82ed8b0fffde8a85ea60e7","start":126}],"target_id":"concept.usgs.1103","target_kind":"node","target_sha256":"b3bd7f73d5286bcd9d95aaecffeb9671068b9a7bdef311e2fb98c7ced6eb6cd5"}],"concept.usgs.1118":[{"id":"assertion.concept.usgs.1118","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Structure contours as defined in the captured USGS Thesaurus term 1118","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Structure contours as: Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features. This category is also used with maps and atlases for depth-to maps","support":[{"end":303,"quote":"Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features.\nThis category is also used with\nmaps and atlases\nfor\ndepth-to maps","source_id":"usgs-thesaurus.1118","source_sha256":"1940253d7de3f01f39f1385e229898365eb266393cd75ae9b07bce5b34ee52ff","start":139}],"target_id":"concept.usgs.1118","target_kind":"node","target_sha256":"2e64ce2efa73069481828c0060fbbe2cd8db4e37eba4f059d002e0b7fac585a8"}],"concept.usgs.1123":[{"id":"assertion.concept.usgs.1123","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Succession (biological) as defined in the captured USGS Thesaurus term 1123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Succession (biological) as: Gradual replacement of one species in an area by another. This category is also used for ecologic succession","support":[{"end":271,"quote":"Gradual replacement of one species in an area by another.\nThis category is also used for\necologic succession","source_id":"usgs-thesaurus.1123","source_sha256":"0224cfed646a51b08d273ea542df7276b7b1e31158fe1603ebc4b40734e660f4","start":163}],"target_id":"concept.usgs.1123","target_kind":"node","target_sha256":"0a15df100e4c92b40370fcf5520eaad977b88426fd7643e49cf6205ef250adc2"}],"concept.usgs.1127":[{"id":"assertion.concept.usgs.1127","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Surficial geologic units as defined in the captured USGS Thesaurus term 1127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Surficial geologic units as: Rock units on the earth's surface. This category is also used with maps and atlases for surficial geologic maps","support":[{"end":266,"quote":"Rock units on the earth's surface.\nThis category is also used with\nmaps and atlases\nfor\nsurficial geologic maps","source_id":"usgs-thesaurus.1127","source_sha256":"0dc06fee52f0ee31cc7acb14ff1733f72a8b336089048173b3dd020b3778d31d","start":155}],"target_id":"concept.usgs.1127","target_kind":"node","target_sha256":"f031edceb5eef32ac1fea86a1c798a5a78a17ee7d03e2fe351b9c7ee821bdaac"}],"concept.usgs.1129":[{"id":"assertion.concept.usgs.1129","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Suspended material (water) as defined in the captured USGS Thesaurus term 1129","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Suspended material (water) as: Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission. This category is also used for suspended sediment concentration and suspended-sediment concentration","support":[{"end":463,"quote":"Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission.\nThis category is also used for\nsuspended sediment concentration\nand\nsuspended-sediment concentration","source_id":"usgs-thesaurus.1129","source_sha256":"73395410788eb64be192a95d823b1c0b50bbe9b959a5d0394a5e4ce763578fbe","start":129}],"target_id":"concept.usgs.1129","target_kind":"node","target_sha256":"caf8dc00c5bcfb161d542bed5103cbf251ec8a5cca2623c23c01ecb124cb03f0"}],"concept.usgs.1145":[{"id":"assertion.concept.usgs.1145","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tectonic processes as defined in the captured USGS Thesaurus term 1145","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle","support":[{"end":462,"quote":"The structural forces affecting the deformation, uplift, and movement of the earth's crust.\nThis category is also used for\ncontinental drift\n,\ndynamic geology\n,  with\nmaps and atlases\nfor\npaleotectonic maps\n,\nplate tectonics\n,\nsubduction\n,  with\nmaps and atlases\nfor\ntectonic maps\n,\ntectonics\n, and\nwilson cycle","source_id":"usgs-thesaurus.1145","source_sha256":"58f532703777736489de58f63df12fd6df1d53a8a89029b7bf2433a9ab86846f","start":151}],"target_id":"concept.usgs.1145","target_kind":"node","target_sha256":"f9a0e39a4a36588569df1d63aea21c6eba7721b372a4df80d3de6fab2c8fbaca"}],"concept.usgs.1199":[{"id":"assertion.concept.usgs.1199","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Unconsolidated deposits as defined in the captured USGS Thesaurus term 1199","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits","support":[{"end":409,"quote":"Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys.\nThis category is also used for\nalluvium\n,\neolian sediments\n,\nloess\n,  with\nchemical analysis\nfor\nsediment geochemistry\n,\nsediments\n, and\nsurficial deposits","source_id":"usgs-thesaurus.1199","source_sha256":"4b6e7dc102443bffbef2ec12c335c6592728b95da9491b61250783e8f65c19ff","start":149}],"target_id":"concept.usgs.1199","target_kind":"node","target_sha256":"5779f35f3f9a54a0b5d8783f5c4a725aee9b5cc19d4ca2f916118a99db6534bc"}],"concept.usgs.1286":[{"id":"assertion.concept.usgs.1286","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Volcanic activity as defined in the captured USGS Thesaurus term 1286","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Volcanic activity as: Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors. This category is also used for eruption , lava flows , pyroclastic flows , volcanic tremors , volcanism , and with field inventory and monitoring for volcano monitoring","support":[{"end":445,"quote":"Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors.\nThis category is also used for\neruption\n,\nlava flows\n,\npyroclastic flows\n,\nvolcanic tremors\n,\nvolcanism\n, and  with\nfield inventory and monitoring\nfor\nvolcano monitoring","source_id":"usgs-thesaurus.1286","source_sha256":"6f59db88fdfd49ded4b0eba1315143c28704d4f4a020c60ca69a7a6d4fede0c6","start":149}],"target_id":"concept.usgs.1286","target_kind":"node","target_sha256":"0f91e44ed5b3983104ee5c07ef74fe9673d5ec81ac903dc59d42e79d53c6ae6a"}],"concept.usgs.1298":[{"id":"assertion.concept.usgs.1298","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water chemistry as defined in the captured USGS Thesaurus term 1298","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.","support":[{"end":194,"quote":"Branch of chemistry that deals with the elements and compounds in water.","source_id":"usgs-thesaurus.1298","source_sha256":"8c394dab3e31f96ff8ec57316e2123abdecd190da1bafed66df8d70a34869761","start":122}],"target_id":"concept.usgs.1298","target_kind":"node","target_sha256":"8acfe5ddb46b1162c68c7c5cbdcb4a33a73716f9a351305511a9c622e978bce5"}],"concept.usgs.1301":[{"id":"assertion.concept.usgs.1301","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water hardness as defined in the captured USGS Thesaurus term 1301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water hardness as: Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality. This category is also used for hardness (water)","support":[{"end":272,"quote":"Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality.\nThis category is also used for\nhardness (water)","source_id":"usgs-thesaurus.1301","source_sha256":"4022db028a46303b7a2470a86c451f8743e95a75eb2871c83c0d659d57380d9b","start":105}],"target_id":"concept.usgs.1301","target_kind":"node","target_sha256":"92b689497660222435cf90d983d8c268f724ec2a15a2bef345e93ca7cc26fd29"}],"concept.usgs.1302":[{"id":"assertion.concept.usgs.1302","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water pH as defined in the captured USGS Thesaurus term 1302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water pH as: The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral. This category is also used for pH (water)","support":[{"end":337,"quote":"The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral.\nThis category is also used for\npH (water)","source_id":"usgs-thesaurus.1302","source_sha256":"5aaf3d319dc7b764c5a4ef46cf3a1acb430f6a588d96c06f472084dc55b97cc8","start":93}],"target_id":"concept.usgs.1302","target_kind":"node","target_sha256":"6dc27f59504b1daec7a0c72f799e4e0a77a06e7319320fec60c1d30672d1379f"}],"concept.usgs.1304":[{"id":"assertion.concept.usgs.1304","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water properties as defined in the captured USGS Thesaurus term 1304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water properties as: Measurable physical and chemical characteristics of water from different sources.","support":[{"end":171,"quote":"Measurable physical and chemical characteristics of water from different sources.","source_id":"usgs-thesaurus.1304","source_sha256":"77aaa1859e7bd70204e8223ae95e1d77687d4aa7bcf1485b4d25f0eec54b62d1","start":90}],"target_id":"concept.usgs.1304","target_kind":"node","target_sha256":"e7accf297608fe37607d88b8e28a48403bc8ac4784c57d500b6a7fc6d8cf242b"}],"concept.usgs.1308":[{"id":"assertion.concept.usgs.1308","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water resources as defined in the captured USGS Thesaurus term 1308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution","support":[{"end":376,"quote":"Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface.\nThis category is also used for\nhydrosphere\nand  with\ncontamination and pollution\nfor\nwater pollution","source_id":"usgs-thesaurus.1308","source_sha256":"958f90911315f23c90a427519b409f6b87fe63f7525d53fb00e73b117e356ec1","start":108}],"target_id":"concept.usgs.1308","target_kind":"node","target_sha256":"a63abeef4a5622cbf1f9cef18d50dae227dbeadbfefb7679306bf593807dd171"}],"concept.usgs.1312":[{"id":"assertion.concept.usgs.1312","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water temperature as defined in the captured USGS Thesaurus term 1312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)","support":[{"end":230,"quote":"The degrees of heat of water from a given source at a specific time.\nThis category is also used for\ntemperature (water)","source_id":"usgs-thesaurus.1312","source_sha256":"343251cb18a897a369f1c8dd180afa650573494533d80e7741969bd24b6125ce","start":111}],"target_id":"concept.usgs.1312","target_kind":"node","target_sha256":"ea3ea36b6bc34ec639c174c76037ef0d44939944965d52587dbf39995232cd4d"}],"concept.usgs.1346":[{"id":"assertion.concept.usgs.1346","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biodegradation as defined in the captured USGS Thesaurus term 1346","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biodegradation as: Reduction in the concentration of harmful chemicals by the action of animals and plants. This category is also used for natural attenuation (harmful chemicals)","support":[{"end":305,"quote":"Reduction in the concentration of harmful chemicals by the action of animals and plants.\nThis category is also used for\nnatural attenuation (harmful chemicals)","source_id":"usgs-thesaurus.1346","source_sha256":"cdc94a0cc6d15a79622f59776cf89128c35ba71b74fa3107efbce62134101809","start":146}],"target_id":"concept.usgs.1346","target_kind":"node","target_sha256":"670d36113a62e16443d2ec67b48ad43068f74c8d29df5829b0f54e1973a48f3b"}],"concept.usgs.1347":[{"id":"assertion.concept.usgs.1347","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Physiological processes as defined in the captured USGS Thesaurus term 1347","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Physiological processes as: Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","support":[{"end":291,"quote":"Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","source_id":"usgs-thesaurus.1347","source_sha256":"9ffff2fb74597db1fe1ddca09e891c80dd124080a3aa63229b1e39a172105fc3","start":140}],"target_id":"concept.usgs.1347","target_kind":"node","target_sha256":"8f68db6c08669358cda9d16190966819e4e37bed233d8c39bb63a46bfd2e749d"}],"concept.usgs.1355":[{"id":"assertion.concept.usgs.1355","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Evaporation as defined in the captured USGS Thesaurus term 1355","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Evaporation as: Transfer of water from a surface into the atmosphere. This category is also used with transpiration for evapotranspiration","support":[{"end":275,"quote":"Transfer of water from a surface into the atmosphere.\nThis category is also used with\ntranspiration\nfor\nevapotranspiration","source_id":"usgs-thesaurus.1355","source_sha256":"56f2cf5b5e3ab9d0fe96a6804c91027de7b85a1aa44822eb252ef9b1eec7c929","start":153}],"target_id":"concept.usgs.1355","target_kind":"node","target_sha256":"e8965ce89ad493086fc3daa2bc9e4ca626dfcfdd8730253cb786f9014a6a7e12"}],"concept.usgs.1356":[{"id":"assertion.concept.usgs.1356","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Transpiration as defined in the captured USGS Thesaurus term 1356","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Transpiration as: Evaporation of water from plants. This category is also used with evaporation for evapotranspiration","support":[{"end":243,"quote":"Evaporation of water from plants.\nThis category is also used with\nevaporation\nfor\nevapotranspiration","source_id":"usgs-thesaurus.1356","source_sha256":"94d3bd4dbb718e21af2e6cadcdd1517a34e41240eb581a7a5feef995dcc6ce68","start":143}],"target_id":"concept.usgs.1356","target_kind":"node","target_sha256":"d964d95c948bc56dd898a3c0cb1f808860e0cd798ac07b001798edb9b6896bc2"}],"concept.usgs.1367":[{"id":"assertion.concept.usgs.1367","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth material properties as defined in the captured USGS Thesaurus term 1367","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth material properties as: Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","support":[{"end":229,"quote":"Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","source_id":"usgs-thesaurus.1367","source_sha256":"0ea1e90713385406884a0267ee383b5c48374f95c6d4c964e6f9a68bcbaea1b1","start":132}],"target_id":"concept.usgs.1367","target_kind":"node","target_sha256":"e4164fc79e740fd1e23bf8f76fd076d6051f5c7e8e9885791ef442f1f7355441"}],"concept.usgs.1368":[{"id":"assertion.concept.usgs.1368","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Permeability as defined in the captured USGS Thesaurus term 1368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Permeability as: The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material. This category is also used for soil permeability","support":[{"end":311,"quote":"The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material.\nThis category is also used for\nsoil permeability","source_id":"usgs-thesaurus.1368","source_sha256":"f96fb5a9cacc9b6a6266cbdee96196ee6a8cd92ba422a22af285232d7ccbb256","start":134}],"target_id":"concept.usgs.1368","target_kind":"node","target_sha256":"7cc06da3c1150efd2a5d0677edecea163c5d6cc8530e74bf1d570e3c86c0f02e"}],"concept.usgs.1369":[{"id":"assertion.concept.usgs.1369","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Porosity as defined in the captured USGS Thesaurus term 1369","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Porosity as: The proportion of open space in a rock or unconsolidated material. This category is also used for interstices and soil porosity","support":[{"end":253,"quote":"The proportion of open space in a rock or unconsolidated material.\nThis category is also used for\ninterstices\nand\nsoil porosity","source_id":"usgs-thesaurus.1369","source_sha256":"c883e17fcf5aafdd1a0aa082ba9e00c490d5129619a103d0db31b9f09aa52022","start":126}],"target_id":"concept.usgs.1369","target_kind":"node","target_sha256":"392896ee4d8aa8c1fdc3921b0e1732c974776bef246ff987bc16edd634d0ae22"}],"concept.usgs.1370":[{"id":"assertion.concept.usgs.1370","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Permafrost as defined in the captured USGS Thesaurus term 1370","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Permafrost as: Rocks and deposits in which the interstitial waters remain perennially frozen.","support":[{"end":201,"quote":"Rocks and deposits in which the interstitial waters remain perennially frozen.","source_id":"usgs-thesaurus.1370","source_sha256":"dbe6e2b271205c68721e2a71e674f3975a58348ba9e762447cd069563a7ef8ee","start":123}],"target_id":"concept.usgs.1370","target_kind":"node","target_sha256":"36821dfa99092afbb1ba7b23e536e34b620dddde22dae66109a3700ae08b28a6"}],"concept.usgs.1622":[{"id":"assertion.concept.usgs.1622","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Archaean as defined in the captured USGS Thesaurus term 1622","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Archaean as: Eon of geologic time approximately 4 to 2.5 billion years ago. https://doi.org/10.3133/fs20103059","support":[{"end":215,"quote":"Eon of geologic time approximately 4 to 2.5 billion years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1622","source_sha256":"075bc5921cb4ae9295fc7384f04be17c1fc8720e4b16ff7e23bd9fc53415da3c","start":118}],"target_id":"concept.usgs.1622","target_kind":"node","target_sha256":"96829d8b93ec69d9e18cdd2ac27e73cb591e1d7731fe25e240aa170ce306ff96"}],"concept.usgs.1626":[{"id":"assertion.concept.usgs.1626","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cambrian as defined in the captured USGS Thesaurus term 1626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cambrian as: Period of geologic time approximately 542 to 488 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":232,"quote":"Period of geologic time approximately 542 to 488 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1626","source_sha256":"165202e08e3f9f35605e4cf4309935b86bdce4edfae8e4ac401aafb4bc83d36e","start":130}],"target_id":"concept.usgs.1626","target_kind":"node","target_sha256":"2c1529b7bcee4ab3b8ffc3b9dcd1560404a5eb56ae23ec1eab97a0dba698e28f"}],"concept.usgs.1627":[{"id":"assertion.concept.usgs.1627","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cenozoic as defined in the captured USGS Thesaurus term 1627","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cenozoic as: Era of geologic time approximately 65 million years ago extending to the present. https://doi.org/10.3133/fs20103059","support":[{"end":234,"quote":"Era of geologic time approximately 65 million years ago extending to the present.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1627","source_sha256":"2a867df1b2579e2ce6c23b83e21283c33f5942076a35d4693390650e30029a6e","start":118}],"target_id":"concept.usgs.1627","target_kind":"node","target_sha256":"0dd1cd4b75099c26fb3c2398551e52b7ce4f8ba37e9e1b15254646709b049a3f"}],"concept.usgs.1628":[{"id":"assertion.concept.usgs.1628","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cretaceous as defined in the captured USGS Thesaurus term 1628","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cretaceous as: Period of geologic time approximately 145 to 65 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":234,"quote":"Period of geologic time approximately 145 to 65 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1628","source_sha256":"ab6a495a4b811da7370a2ff8516d74cfbfcf4279c46a3577618901957b5da3d3","start":133}],"target_id":"concept.usgs.1628","target_kind":"node","target_sha256":"2e77d7a1b786545627d3e11853f8534e8e84cba0ac2b1cb18b0a92d85d1e457a"}],"concept.usgs.1630":[{"id":"assertion.concept.usgs.1630","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Devonian as defined in the captured USGS Thesaurus term 1630","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Devonian as: Period of geologic time approximately 416 to 359 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":232,"quote":"Period of geologic time approximately 416 to 359 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1630","source_sha256":"4e7d2b5639b181b9d20bc17378200c06f6116e322cf200273d914951ddce85ae","start":130}],"target_id":"concept.usgs.1630","target_kind":"node","target_sha256":"8e5b818f2698838084fcaa0cd31162cb53a55ac20eeea50af54b58228ae33e1d"}],"concept.usgs.1634":[{"id":"assertion.concept.usgs.1634","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic time periods as defined in the captured USGS Thesaurus term 1634","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic time periods as: This category is also used for geologic age and geologic time","support":[{"end":167,"quote":"This category is also used for\ngeologic age\nand\ngeologic time","source_id":"usgs-thesaurus.1634","source_sha256":"791fa0275aab7649f96747add7dca2699d676c2d706d909810f577d723cac88e","start":106}],"target_id":"concept.usgs.1634","target_kind":"node","target_sha256":"fb7db6df3dcb10ea7f745e4b9731126e31f45e2c049f1251090b9a89f459f5d6"}],"concept.usgs.1635":[{"id":"assertion.concept.usgs.1635","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hadean as defined in the captured USGS Thesaurus term 1635","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hadean as: Eon of geologic time prior to 4 billion years ago. https://doi.org/10.3133/fs20103059","support":[{"end":199,"quote":"Eon of geologic time prior to 4 billion years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1635","source_sha256":"93d6ee4baab86877d8fb967f605e78efaec234ba9d1add4bd50a63544e9ae4d0","start":114}],"target_id":"concept.usgs.1635","target_kind":"node","target_sha256":"0a892a21b7802ac646283430348ca222d350b955a9a8e714f6f4adc069d2ec2a"}],"concept.usgs.1638":[{"id":"assertion.concept.usgs.1638","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Jurassic as defined in the captured USGS Thesaurus term 1638","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Jurassic as: Period of geologic time approximately 200 to 145 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Period of geologic time approximately 200 to 145 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1638","source_sha256":"a6a50c3272e61d3fc3481ec08606571564664c8ad61d8d4fc39f292b52347a5e","start":129}],"target_id":"concept.usgs.1638","target_kind":"node","target_sha256":"cb3edaf0a1f4e8b7d2b70b4a5e82a446c1a29b1acd1ce0f1557ae973090704b2"}],"concept.usgs.1640":[{"id":"assertion.concept.usgs.1640","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mesozoic as defined in the captured USGS Thesaurus term 1640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mesozoic as: Era of geologic time approximately 251 to 65 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":216,"quote":"Era of geologic time approximately 251 to 65 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1640","source_sha256":"53aafb5db97b483ab3db3b8b1e796a1d682e7c582cfc3d8e34101043cb7a5d77","start":118}],"target_id":"concept.usgs.1640","target_kind":"node","target_sha256":"bfd3a267487656b37270c543507a2af8c66e8b9e13feb157625fd8cd506194ca"}],"concept.usgs.1642":[{"id":"assertion.concept.usgs.1642","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mississippian as defined in the captured USGS Thesaurus term 1642","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mississippian as: Subperiod of geologic time approximately 359 to 318 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for lower carboniferous","support":[{"end":296,"quote":"Subperiod of geologic time approximately 359 to 318 million years ago.\nhttps://doi.org/10.3133/fs20103059\nThis category is also used for\nlower carboniferous","source_id":"usgs-thesaurus.1642","source_sha256":"ae02be5ae6e65b3048cc902a72ebcc5d010727892f0691adf65cf41b78581898","start":140}],"target_id":"concept.usgs.1642","target_kind":"node","target_sha256":"410ffaf74462ca8cc63babfabb1658be856f89ad7fc9b3d4ec7af23a180b0ad3"}],"concept.usgs.1649":[{"id":"assertion.concept.usgs.1649","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleozoic as defined in the captured USGS Thesaurus term 1649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleozoic as: Era of geologic time approximately 542 to 251 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":219,"quote":"Era of geologic time approximately 542 to 251 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1649","source_sha256":"dc325859ef149d30aa736b6ec228b777e068767a71bbffaf167572f024662916","start":120}],"target_id":"concept.usgs.1649","target_kind":"node","target_sha256":"123e77da3ff4c927971424ba40d295acc0da148ed0da37645bd231e6b72564ff"}],"concept.usgs.1652":[{"id":"assertion.concept.usgs.1652","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Phanerozoic as defined in the captured USGS Thesaurus term 1652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Phanerozoic as: Eon of geologic time approximately 542 million years ago extending to the present. https://doi.org/10.3133/fs20103059","support":[{"end":227,"quote":"Eon of geologic time approximately 542 million years ago extending to the present.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1652","source_sha256":"59920b7c7e771fed3dd711000cc50720c96ae0381fd870acc5af932b03533f89","start":110}],"target_id":"concept.usgs.1652","target_kind":"node","target_sha256":"74aaf78feef2708eae146e83c9c6c9a560004c9673be889726095f08d78016f0"}],"concept.usgs.1655":[{"id":"assertion.concept.usgs.1655","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Precambrian as defined in the captured USGS Thesaurus term 1655","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Precambrian as: General interval of geologic time before approximately 542 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for cryptozoic","support":[{"end":264,"quote":"General interval of geologic time before approximately 542 million years ago.\nhttps://doi.org/10.3133/fs20103059\nThis category is also used for\ncryptozoic","source_id":"usgs-thesaurus.1655","source_sha256":"9745220f28924cca0ab4da3fd6f113ee051ad94def731d8ec46851ea7585bfd9","start":110}],"target_id":"concept.usgs.1655","target_kind":"node","target_sha256":"af6877f445577a855a877edd5e66d77541853f0aad359d3b6ef07adcebc90b02"}],"concept.usgs.1656":[{"id":"assertion.concept.usgs.1656","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Proterozoic as defined in the captured USGS Thesaurus term 1656","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Proterozoic as: Eon of geologic time approximately 2.5 billion to 542 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Eon of geologic time approximately 2.5 billion to 542 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1656","source_sha256":"1d402e35017b23540955ec7feef6d250960169c5cc357b7dac7377f158d11220","start":124}],"target_id":"concept.usgs.1656","target_kind":"node","target_sha256":"24bed061402744db71bd7bd5d956f8400aee31ae7396c867566e33c1173e5dc1"}],"concept.usgs.1657":[{"id":"assertion.concept.usgs.1657","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Quaternary as defined in the captured USGS Thesaurus term 1657","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Quaternary as: Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene. https://doi.org/10.3133/fs20103059","support":[{"end":331,"quote":"Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1657","source_sha256":"2310239c98d25641f5d8056cdfb53d50f9474327aca658344ff7f0690ea19538","start":133}],"target_id":"concept.usgs.1657","target_kind":"node","target_sha256":"fcca22aaa0e17b0378ceb0847293f1815dac5259d6d29e66c6a5259f61c6b5fd"}],"concept.usgs.1662":[{"id":"assertion.concept.usgs.1662","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tertiary as defined in the captured USGS Thesaurus term 1662","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tertiary as: Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene. https://doi.org/10.3133/fs20103059","support":[{"end":305,"quote":"Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1662","source_sha256":"35586b10b4fdf21ead8a4d196d9fba32adffb7d2ad7769e813ce199fd7b5b874","start":129}],"target_id":"concept.usgs.1662","target_kind":"node","target_sha256":"3d82d251a3e963f6c5611945eb694868ed97e80a34550f2f0154d7bac1befbf4"}],"concept.usgs.1664":[{"id":"assertion.concept.usgs.1664","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Triassic as defined in the captured USGS Thesaurus term 1664","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Triassic as: Period of geologic time approximately 251 to 200 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Period of geologic time approximately 251 to 200 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1664","source_sha256":"ace3de7fa94e6aeccb13a7b3b1274d64637d5857df109575c58a4662bba2906b","start":129}],"target_id":"concept.usgs.1664","target_kind":"node","target_sha256":"89738e49e6f72bf34a96e94ecc864d3433d9417c599023fff0862e2a4c9d8283"}],"concept.usgs.1673":[{"id":"assertion.concept.usgs.1673","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Isostatic anomaly as defined in the captured USGS Thesaurus term 1673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Isostatic anomaly as: Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","support":[{"end":230,"quote":"Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","source_id":"usgs-thesaurus.1673","source_sha256":"bfdbfcec6b41b5452998ae96cdf37b352f70ded9448f40bb4e71bce169d026ce","start":146}],"target_id":"concept.usgs.1673","target_kind":"node","target_sha256":"1f8f9198b1cf779b97f06ff5ebda83d148fb6b98b0aaea1258b107a99c5f0929"}],"concept.usgs.1674":[{"id":"assertion.concept.usgs.1674","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Free-air anomaly as defined in the captured USGS Thesaurus term 1674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Free-air anomaly as: Gravity anomaly corrected for elevation of the location at which the measurements were made.","support":[{"end":236,"quote":"Gravity anomaly corrected for elevation of the location at which the measurements were made.","source_id":"usgs-thesaurus.1674","source_sha256":"756523ec92d2b9a677794dd0b5f7ca5a526742ebf286852a6cf46a8bdebc1a3e","start":144}],"target_id":"concept.usgs.1674","target_kind":"node","target_sha256":"46e4a5f6cde088fa8a81a637b2eaa39d70dcc6998efc51fc9d8c3ec3ae10d46f"}],"concept.usgs.1675":[{"id":"assertion.concept.usgs.1675","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bouguer anomaly as defined in the captured USGS Thesaurus term 1675","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bouguer anomaly as: Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","support":[{"end":283,"quote":"Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","source_id":"usgs-thesaurus.1675","source_sha256":"2730e3c853b8cbfe784e9a80e3dc4758fb454711ff4512a1a5cf653a437caf81","start":142}],"target_id":"concept.usgs.1675","target_kind":"node","target_sha256":"612e9c0dd671a3dab92ef8eb1a30bfc1ea7773a1bdd3b3ee6c88813265b3d930"}],"concept.usgs.168":[{"id":"assertion.concept.usgs.168","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Climate change as defined in the captured USGS Thesaurus term 168","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate","support":[{"end":430,"quote":"Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature.\nThis category is also used for\nclimate history\n,\nclimate variability\n,\nclimatic change\n,\nglobal climate change\n,\nglobal warming\n, and\npaleoclimate","source_id":"usgs-thesaurus.168","source_sha256":"02f8cf30bc663cb057c111d0378a04ee23c90a639b3b652073ae80eb9789c483","start":159}],"target_id":"concept.usgs.168","target_kind":"node","target_sha256":"8208acfd73da261ea61fba99ab507c6cc018a2c3f0ab2d2250fa63fc4858a0ef"}],"concept.usgs.1682":[{"id":"assertion.concept.usgs.1682","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved gases as defined in the captured USGS Thesaurus term 1682","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved gases as: Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","support":[{"end":206,"quote":"Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","source_id":"usgs-thesaurus.1682","source_sha256":"e6b808e0b9e0e2561ec231af6fb88607f3f9b819df2bab1069920fa730f87757","start":107}],"target_id":"concept.usgs.1682","target_kind":"node","target_sha256":"639b8935476606126144fdc9f021e2ecb7ee6d01b5e2b506c5ebe2a65ff1a6d0"}],"concept.usgs.1683":[{"id":"assertion.concept.usgs.1683","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth tides as defined in the captured USGS Thesaurus term 1683","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth tides as: Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters. Used in studies of volcanic activity.","support":[{"end":310,"quote":"Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters.  Used in studies of volcanic activity.","source_id":"usgs-thesaurus.1683","source_sha256":"7f10f935199174d46b7e2fc8f7aadce97f8da260aeddd52e3ab03e06510448ae","start":137}],"target_id":"concept.usgs.1683","target_kind":"node","target_sha256":"90e400b5c7349d1da7320cb4e43e924ccfb05cf906e1efe8ef1d44799fd970d9"}],"concept.usgs.1690":[{"id":"assertion.concept.usgs.1690","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Wind as defined in the captured USGS Thesaurus term 1690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Wind as: Local air movements. This category is also used with erosion for wind erosion","support":[{"end":216,"quote":"Local air movements.\nThis category is also used with\nerosion\nfor\nwind erosion","source_id":"usgs-thesaurus.1690","source_sha256":"c3f711e3d8790051ec030d9ec351a5f52d9da34bb6253818e3aeef4604b141fe","start":139}],"target_id":"concept.usgs.1690","target_kind":"node","target_sha256":"cf51883bb62087bea4b924fb1f044126c199cf2feed27507b69ec569850460a8"}],"concept.usgs.1692":[{"id":"assertion.concept.usgs.1692","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Groundwater and surface-water interaction as defined in the captured USGS Thesaurus term 1692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Groundwater and surface-water interaction as: Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water. This category is also used for aquifer-surface water interaction , ground-water/surface-water interaction , groundwater/surface water interaction , hyporheic zone processes , surface water/groundwater interaction , and surface-water/ground-water interaction","support":[{"end":1395,"quote":"Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water.\nThis category is also used for\naquifer-surface water interaction\n,\nground-water/surface-water interaction\n,\ngroundwater/surface water interaction\n,\nhyporheic zone processes\n,\nsurface water/groundwater interaction\n, and\nsurface-water/ground-water interaction","source_id":"usgs-thesaurus.1692","source_sha256":"6fb031488865a6abb296959a091c336ca3aca41ad63c2cec34b7f247d372566a","start":199}],"target_id":"concept.usgs.1692","target_kind":"node","target_sha256":"40820b53b5660ce62a78c9a59022c1e9a928c7b34111f429bcda7c684cd96032"}],"concept.usgs.1699":[{"id":"assertion.concept.usgs.1699","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Deformation (geologic) as defined in the captured USGS Thesaurus term 1699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Deformation (geologic) as: Change in form and structure of geologic materials in response to stress, typically heat and pressure. This category is also used for rheology and strain history","support":[{"end":320,"quote":"Change in form and structure of geologic materials in response to stress, typically heat and pressure.\nThis category is also used for\nrheology\nand\nstrain history","source_id":"usgs-thesaurus.1699","source_sha256":"05403593d008b86dec650e0290c5d35b4a048739fdde0ffe8919d9e38dbb818a","start":159}],"target_id":"concept.usgs.1699","target_kind":"node","target_sha256":"21bf5841c6009380e67f38669564ab7c0aaec15b13bd3970d22c58ea7758a351"}],"concept.usgs.1701":[{"id":"assertion.concept.usgs.1701","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Radioactivity as defined in the captured USGS Thesaurus term 1701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Radioactivity as: Release of subatomic particles from earth materials. Generally the energy of these particles is used to determine the chemical elements present. This category is also used for gamma ray emission","support":[{"end":331,"quote":"Release of subatomic particles from earth materials.  Generally the energy of these particles is used to determine the chemical elements present.\nThis category is also used for\ngamma ray emission","source_id":"usgs-thesaurus.1701","source_sha256":"a403825bd7733c39d949cc961c74eb29f2bb2d265fc302161b969a798ab3142e","start":136}],"target_id":"concept.usgs.1701","target_kind":"node","target_sha256":"f4efec0a556aea8134225d5e6538ba058305c9b5fca599d829a13b259b5320ef"}],"concept.usgs.1702":[{"id":"assertion.concept.usgs.1702","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Evolution as defined in the captured USGS Thesaurus term 1702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Evolution as: Change in the genetic composition of populations of living organisms. This category is also used for gene flow","support":[{"end":222,"quote":"Change in the genetic composition of populations of living organisms.\nThis category is also used for\ngene flow","source_id":"usgs-thesaurus.1702","source_sha256":"9cecf61e8662a67634dd250f00d5fecf9b58f8e957efb9bffd4a34c09bd85e13","start":112}],"target_id":"concept.usgs.1702","target_kind":"node","target_sha256":"b5e108f95dbc0a1a69f4f331c795021e894e40314944c4cc3195ede10bfbbd5e"}],"concept.usgs.1703":[{"id":"assertion.concept.usgs.1703","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ore formation as defined in the captured USGS Thesaurus term 1703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ore formation as: Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials. Typically refers to metal ores. This category is also used for metallogenesis , metallogeny , and mineralization","support":[{"end":369,"quote":"Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials.  Typically refers to metal ores.\nThis category is also used for\nmetallogenesis\n,\nmetallogeny\n, and\nmineralization","source_id":"usgs-thesaurus.1703","source_sha256":"cf60741aa1741527868092031aa0a02af834aad020b6ef27cbfba88a0d2c9185","start":144}],"target_id":"concept.usgs.1703","target_kind":"node","target_sha256":"bc0c581a1e271514e54e56f36bdc6e9845636278f78df4c622f6ee574b35790e"}],"concept.usgs.1704":[{"id":"assertion.concept.usgs.1704","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Greenhouse effect as defined in the captured USGS Thesaurus term 1704","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Greenhouse effect as: Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","support":[{"end":310,"quote":"Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","source_id":"usgs-thesaurus.1704","source_sha256":"a56cd11fc712bf9fc81dd53bfd18a7206cbd1f066b0869217da5630410e1d4c6","start":165}],"target_id":"concept.usgs.1704","target_kind":"node","target_sha256":"f4e4194557befa745354f4016a77016bffe8d0c188b3e3715085fa006cd86351"}],"concept.usgs.1708":[{"id":"assertion.concept.usgs.1708","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Oxidation and reduction as defined in the captured USGS Thesaurus term 1708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Oxidation and reduction as: Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms. This category is also used for fermentation","support":[{"end":303,"quote":"Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms.\nThis category is also used for\nfermentation","source_id":"usgs-thesaurus.1708","source_sha256":"b1b30717b7433e9c9241153f5baf63c77f5a88a91c43b01f144c0c84860a31e6","start":164}],"target_id":"concept.usgs.1708","target_kind":"node","target_sha256":"99358be289e8c3cde8bb6e27e29b7b5f10bd1f263304c755e6a6d60517ddc0df"}],"concept.usgs.1710":[{"id":"assertion.concept.usgs.1710","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil formation as defined in the captured USGS Thesaurus term 1710","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil formation as: Geological, geochemical, and ecological processes that work together to produce soils. This category is also used for pedogenesis","support":[{"end":272,"quote":"Geological, geochemical, and ecological processes that work together to produce soils.\nThis category is also used for\npedogenesis","source_id":"usgs-thesaurus.1710","source_sha256":"f7e051590f47c3b38eb4c794d0b4d718e26c6817c051f7b94b0943bfaecba120","start":143}],"target_id":"concept.usgs.1710","target_kind":"node","target_sha256":"790a3f269f6e14baea4ff3699e71c37d8bcd64f418a506aa87ef894c31af8a6d"}],"concept.usgs.1711":[{"id":"assertion.concept.usgs.1711","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Reaction transport as defined in the captured USGS Thesaurus term 1711","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Reaction transport as: Chemical reactions occurring during ground-water flow.","support":[{"end":208,"quote":"Chemical reactions occurring during ground-water flow.","source_id":"usgs-thesaurus.1711","source_sha256":"fa38b6b341913b8c2d936ebfd2d92f47fbce08c86e72f56f3dd40d3fd1e40823","start":154}],"target_id":"concept.usgs.1711","target_kind":"node","target_sha256":"0d45a65524c9bc20957cb9c4887289c61a90457888bac60ca7ee819cc3b6488a"}],"concept.usgs.1712":[{"id":"assertion.concept.usgs.1712","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Resistivity as defined in the captured USGS Thesaurus term 1712","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Resistivity as: Electrical resistance of materials, often measured in boreholes.","support":[{"end":196,"quote":"Electrical resistance of materials, often measured in boreholes.","source_id":"usgs-thesaurus.1712","source_sha256":"35184d087a110126e9ebeb7e1e6029148f41a386e23e0458bd30fd14b45c6652","start":132}],"target_id":"concept.usgs.1712","target_kind":"node","target_sha256":"cb97eeaa1340b1e9065704cd8fb3c6bc124a3e054aa7fb38f0d039022bca77dd"}],"concept.usgs.1714":[{"id":"assertion.concept.usgs.1714","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bulk density as defined in the captured USGS Thesaurus term 1714","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bulk density as: Overall density of an unconsolidated earth material.","support":[{"end":186,"quote":"Overall density of an unconsolidated earth material.","source_id":"usgs-thesaurus.1714","source_sha256":"2715f15a4c13298451c61b79abba0cb9ba61f3d21c875139266819536a52010e","start":134}],"target_id":"concept.usgs.1714","target_kind":"node","target_sha256":"7378593ece3279344df10f4940c9e474616416c655b8624d67b61344e9be91de"}],"concept.usgs.1715":[{"id":"assertion.concept.usgs.1715","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sorption as defined in the captured USGS Thesaurus term 1715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sorption as: Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption). This category is also used for absorption and adsorption","support":[{"end":303,"quote":"Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption).\nThis category is also used for\nabsorption\nand\nadsorption","source_id":"usgs-thesaurus.1715","source_sha256":"80bf445f52686dad5aae947b2c7e6f65fedb116d6b2b07936c013df20805312a","start":134}],"target_id":"concept.usgs.1715","target_kind":"node","target_sha256":"15dec6d7caeb5473129d0a228cb77be6d5b6bdb7e0bc8a4825829b899bcfcb30"}],"concept.usgs.1718":[{"id":"assertion.concept.usgs.1718","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Impact cratering as defined in the captured USGS Thesaurus term 1718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Impact cratering as: Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth. This category is also used for asteroid impact , bolide impact , comet impact , and meteor impact","support":[{"end":310,"quote":"Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth.\nThis category is also used for\nasteroid impact\n,\nbolide impact\n,\ncomet impact\n, and\nmeteor impact","source_id":"usgs-thesaurus.1718","source_sha256":"2dcd3181ff3c8e58206a0c84747f7bec20481b440abd1d7e858aa9552ece5da6","start":126}],"target_id":"concept.usgs.1718","target_kind":"node","target_sha256":"d209128fd807bd64956e8f9be741a85990cc3d147d6237a60d30d0983d910a6a"}],"concept.usgs.1721":[{"id":"assertion.concept.usgs.1721","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetic storms as defined in the captured USGS Thesaurus term 1721","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetic storms as: A period of time during which the earth's magnetic field varies rapidly. During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation. This category is also used for geomagnetic storms","support":[{"end":493,"quote":"A period of time during which the earth's magnetic field varies rapidly.  During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation.\nThis category is also used for\ngeomagnetic storms","source_id":"usgs-thesaurus.1721","source_sha256":"aa9c32afb1eb7cc374508f382f2f1693c2c2dc78f75184e42aba4ffab8501867","start":145}],"target_id":"concept.usgs.1721","target_kind":"node","target_sha256":"10a4fbc7e87361cc064a481e65392647695d90df1b86a639560b9cbd071fce47"}],"concept.usgs.1722":[{"id":"assertion.concept.usgs.1722","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea ice concentration as defined in the captured USGS Thesaurus term 1722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea ice concentration as: Proportion of ocean area in a given region that contains or is covered by floating ice. This category is also used for sea ice cover and sea-ice concentration","support":[{"end":303,"quote":"Proportion of ocean area in a given region that contains or is covered by floating ice.\nThis category is also used for\nsea ice cover\nand\nsea-ice concentration","source_id":"usgs-thesaurus.1722","source_sha256":"996cf70964344e6353fef2191749f4d80893d051a04bea578a5dd31a31f846ae","start":145}],"target_id":"concept.usgs.1722","target_kind":"node","target_sha256":"42577589b5c3a8d2fb3b0d34e42396a9e7d57382dccc4101c20dd5d3f467140a"}],"concept.usgs.1731":[{"id":"assertion.concept.usgs.1731","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Carbon sequestration as defined in the captured USGS Thesaurus term 1731","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage","support":[{"end":444,"quote":"Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system.\nThis category is also used for\ncarbon capture\n,\ncarbon capture and storage\n, and\ncarbon storage","source_id":"usgs-thesaurus.1731","source_sha256":"0f34754cad67c3062ee5d58a32cc500faec608d3b6944cfc5278c28a6b8a3707","start":158}],"target_id":"concept.usgs.1731","target_kind":"node","target_sha256":"26ceba1b5af8a55f09516210c4a86475bd9dab673ce4e0c6e8a24e23177447e3"}],"concept.usgs.1736":[{"id":"assertion.concept.usgs.1736","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Slope processes as defined in the captured USGS Thesaurus term 1736","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Slope processes as: The down slope movement of earth material under the influence of gravity. This category is also used for mass wasting and soil creep","support":[{"end":277,"quote":"The down slope movement of earth material under the influence of gravity.\nThis category is also used for\nmass wasting\nand\nsoil creep","source_id":"usgs-thesaurus.1736","source_sha256":"1c40be8679858a28461e532b4049f331334ce7f67d2ce454fa61da62037ba0b6","start":145}],"target_id":"concept.usgs.1736","target_kind":"node","target_sha256":"225fa66f31d44a679173d53d06f0e6f2e7411a59bb985c65d703f99660af9d2d"}],"concept.usgs.1741":[{"id":"assertion.concept.usgs.1741","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetism as defined in the captured USGS Thesaurus term 1741","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetism as: Strength and orientation of the permanent magnetic field in a given sample of an earth material","support":[{"end":223,"quote":"Strength and orientation of the permanent magnetic field in a given sample of an earth material","source_id":"usgs-thesaurus.1741","source_sha256":"ba99c7144f0e95b38ad9830c8995d17f6399ae6b169fb77bf6c71d854c2e2980","start":128}],"target_id":"concept.usgs.1741","target_kind":"node","target_sha256":"0a8d5f67e3bf24f80837cce7bef40847b48daa8a8c1f016994ecef0b3dddff64"}],"concept.usgs.1751":[{"id":"assertion.concept.usgs.1751","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Uplift as defined in the captured USGS Thesaurus term 1751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Uplift as: Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","support":[{"end":234,"quote":"Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","source_id":"usgs-thesaurus.1751","source_sha256":"655b75663d61f299c4022357ea71fdb87a7517d695d8484df0c0dabcf3defb8b","start":127}],"target_id":"concept.usgs.1751","target_kind":"node","target_sha256":"b9875d60b4487f72ff9a147b047d9333f0517d2dd35f132837da2c70d4eb9184"}],"concept.usgs.1799":[{"id":"assertion.concept.usgs.1799","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal processes as defined in the captured USGS Thesaurus term 1799","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal processes as: Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation This category is also used with erosion for beach erosion , with erosion for coastal erosion , with hazards for coastal hazards , shoreline change , with erosion for shoreline erosion , and with erosion for shoreline retreat","support":[{"end":544,"quote":"Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation\nThis category is also used with\nerosion\nfor\nbeach erosion\n,  with\nerosion\nfor\ncoastal erosion\n,  with\nhazards\nfor\ncoastal hazards\n,\nshoreline change\n,  with\nerosion\nfor\nshoreline erosion\n, and  with\nerosion\nfor\nshoreline retreat","source_id":"usgs-thesaurus.1799","source_sha256":"ed4b4cce691b28a633c4123df5e3b472df7139494483819b5afc5a019b18b36b","start":128}],"target_id":"concept.usgs.1799","target_kind":"node","target_sha256":"bddcc5bdea509cb21425808cd25c937c030e64f2bb8cc4f751595b3c273844ce"}],"concept.usgs.1800":[{"id":"assertion.concept.usgs.1800","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine processes as defined in the captured USGS Thesaurus term 1800","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine processes as: Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters This category is also used with sediment transport for estuarine sediment transport","support":[{"end":305,"quote":"Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters\nThis category is also used with\nsediment transport\nfor\nestuarine sediment transport","source_id":"usgs-thesaurus.1800","source_sha256":"7b552cf7bdf934437d0ec9f67a388986c3d7571c5e1b6e002830f803a8736fa6","start":132}],"target_id":"concept.usgs.1800","target_kind":"node","target_sha256":"8794b4fc6780104d0e21497639d97bfbff495c994bdfccbd919a959a44b2d260"}],"concept.usgs.1801":[{"id":"assertion.concept.usgs.1801","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Longshore currents as defined in the captured USGS Thesaurus term 1801","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Longshore currents as: Movement of water parallel to the coast due to waves striking the shoreline at an angle This category is also used with sediment transport for littoral drift and with sediment transport for longshore drift","support":[{"end":356,"quote":"Movement of water parallel to the coast due to waves striking the shoreline at an angle\nThis category is also used with\nsediment transport\nfor\nlittoral drift\nand  with\nsediment transport\nfor\nlongshore drift","source_id":"usgs-thesaurus.1801","source_sha256":"4a0e2dca712969145257e515d619fb31d25fdcc02ec358bf0d6315bd077fb30c","start":150}],"target_id":"concept.usgs.1801","target_kind":"node","target_sha256":"75bb0220e6d01042348b396f3c1ee4dd5cd6f086c1cf83d607ad16f9e2bf51ab"}],"concept.usgs.1802":[{"id":"assertion.concept.usgs.1802","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine currents as defined in the captured USGS Thesaurus term 1802","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine currents as: Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","support":[{"end":266,"quote":"Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","source_id":"usgs-thesaurus.1802","source_sha256":"d1959a286a47d561dd029e8d432dee5a5eb1a09a371e85b50e58753a14801262","start":152}],"target_id":"concept.usgs.1802","target_kind":"node","target_sha256":"def933bd87403ddb760d0681abbde736c2c8d1c3708f822f9b9deab453810eb1"}],"concept.usgs.1803":[{"id":"assertion.concept.usgs.1803","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine mixing as defined in the captured USGS Thesaurus term 1803","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine mixing as: Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","support":[{"end":368,"quote":"Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","source_id":"usgs-thesaurus.1803","source_sha256":"1cc57518713ac5cb102cabbb57f77b0047d74ca745427d8389a6b27d194205fd","start":148}],"target_id":"concept.usgs.1803","target_kind":"node","target_sha256":"532794b3ab53ff5ba39f73f7e4fb9ba003c8a553d5fda6b73d1e820e090f791b"}],"concept.usgs.1804":[{"id":"assertion.concept.usgs.1804","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Petroleum as defined in the captured USGS Thesaurus term 1804","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Petroleum as: Naturally occurring hydrocarbons, typically fluid or gas, often of economic use. Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales. This category is also used with industrial pollution for oil spills","support":[{"end":356,"quote":"Naturally occurring hydrocarbons, typically fluid or gas, often of economic use.  Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales.\nThis category is also used with\nindustrial pollution\nfor\noil spills","source_id":"usgs-thesaurus.1804","source_sha256":"84fd0e7a1863aea53d7b95fee426722b608c95607a74016babcb4d4efe355079","start":121}],"target_id":"concept.usgs.1804","target_kind":"node","target_sha256":"f21185ddb3fa9698cacdb89ebeb47123128fd5fb2ff1500b312ca7d10c60bf18"}],"concept.usgs.196":[{"id":"assertion.concept.usgs.196","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Contaminant transport as defined in the captured USGS Thesaurus term 196","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Contaminant transport as: Processes involved in the movement of impurities through air, water, and soil.","support":[{"end":237,"quote":"Processes involved in the movement of impurities through air, water, and soil.","source_id":"usgs-thesaurus.196","source_sha256":"d8ece0060c7ebfa693a9a262c9b52f587051d2f7f477dab84b6871f76a8d1f32","start":159}],"target_id":"concept.usgs.196","target_kind":"node","target_sha256":"1a330b2da374379140ea0708f1e4dc6c013c4c16f0333e8886d127c69298e2da"}],"concept.usgs.1999":[{"id":"assertion.concept.usgs.1999","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved metals as defined in the captured USGS Thesaurus term 1999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved metals as: Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","support":[{"end":224,"quote":"Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","source_id":"usgs-thesaurus.1999","source_sha256":"513a902a1b1cb2ff6d1ca97190e3ba941135d48645782335060706286826d86a","start":109}],"target_id":"concept.usgs.1999","target_kind":"node","target_sha256":"1310a3634a094dd56b57cb34313cc93f965e43d3c0ab710bdec4ab2440e0f62c"}],"concept.usgs.2000":[{"id":"assertion.concept.usgs.2000","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved organic compounds as defined in the captured USGS Thesaurus term 2000","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved organic compounds as: Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","support":[{"end":261,"quote":"Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","source_id":"usgs-thesaurus.2000","source_sha256":"367561cc64953937a10a988d2f4baf848cb1d738844f53284bdd3fd94eb59e91","start":131}],"target_id":"concept.usgs.2000","target_kind":"node","target_sha256":"43e9922994c7f95c95db5b02b3c3740037b955fe38dfbd3deb50e8290d49b65c"}],"concept.usgs.2027":[{"id":"assertion.concept.usgs.2027","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil moisture as defined in the captured USGS Thesaurus term 2027","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material","support":[{"end":210,"quote":"Water content of soil and other near-surface unconsolidated earth material","source_id":"usgs-thesaurus.2027","source_sha256":"d0ebce541ec5b583c6768fd1b08f2e33c40931078d4275a64d14656d6129d003","start":136}],"target_id":"concept.usgs.2027","target_kind":"node","target_sha256":"63eada4127222ba73f350430cd07ee527d840b3a95050b5b9e8268ce940069a6"}],"concept.usgs.2028":[{"id":"assertion.concept.usgs.2028","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil temperature as defined in the captured USGS Thesaurus term 2028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","support":[{"end":241,"quote":"Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","source_id":"usgs-thesaurus.2028","source_sha256":"180c90b4a0aad47e5fa587c1921c0996004ce3792733a0e93c75ff2ada938964","start":142}],"target_id":"concept.usgs.2028","target_kind":"node","target_sha256":"f17d1b54d8103965a394b548076521510bfa7487b3b954fe9cc11556d3763350"}],"concept.usgs.2031":[{"id":"assertion.concept.usgs.2031","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Karst as defined in the captured USGS Thesaurus term 2031","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Karst as: Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes. This category is also used for karst topography and karstic","support":[{"end":304,"quote":"Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes.\nThis category is also used for\nkarst topography\nand\nkarstic","source_id":"usgs-thesaurus.2031","source_sha256":"372ce9b03c3e41e40441447284aad476a2bb3d4a8721e9fbe1574775bccf2574","start":123}],"target_id":"concept.usgs.2031","target_kind":"node","target_sha256":"aecdbe80118b927dd426a84a20627d2bebdf43317cfd0ca35a9524b88f9f5683"}],"concept.usgs.2043":[{"id":"assertion.concept.usgs.2043","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mineral deposits as defined in the captured USGS Thesaurus term 2043","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mineral deposits as: Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value. This category is also used for ore deposits","support":[{"end":301,"quote":"Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value.\nThis category is also used for\nore deposits","source_id":"usgs-thesaurus.2043","source_sha256":"b6c994f35d393d957c3b6d2cfb09be002939c7a9e0305899c7d841cf7ca8448f","start":135}],"target_id":"concept.usgs.2043","target_kind":"node","target_sha256":"6b16dbe47f07677645bda77a8bcd07ffd6f336d3ba26bda043adbd5e2d334e76"}],"concept.usgs.2058":[{"id":"assertion.concept.usgs.2058","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean acidification as defined in the captured USGS Thesaurus term 2058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean acidification as: Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","support":[{"end":263,"quote":"Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","source_id":"usgs-thesaurus.2058","source_sha256":"8dbe9fc11898ed6a64c5fe92f1e0b1497961002d8c5fb1ce01c9655c3acb0161","start":156}],"target_id":"concept.usgs.2058","target_kind":"node","target_sha256":"5186cd34428c9c4ce42cfaab6caabd2154209a3df638d6a30473daefdb1c6674"}],"concept.usgs.2068":[{"id":"assertion.concept.usgs.2068","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tidal currents as defined in the captured USGS Thesaurus term 2068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tidal currents as: Currents caused by tidal changes in water level from one body of water to another.","support":[{"end":224,"quote":"Currents caused by tidal changes in water level from one body of water to another.","source_id":"usgs-thesaurus.2068","source_sha256":"c817ec6e5fb62961baf67649cde795b8ac0ca80281384b7fd2464fd2d238d645","start":142}],"target_id":"concept.usgs.2068","target_kind":"node","target_sha256":"0e6a6e119a1b453e0928e3b1e7cb1012c9e32220993def7b4eb83c634ae09ec3"}],"concept.usgs.2069":[{"id":"assertion.concept.usgs.2069","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Barrier island migration as defined in the captured USGS Thesaurus term 2069","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Barrier island migration as: The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","support":[{"end":267,"quote":"The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","source_id":"usgs-thesaurus.2069","source_sha256":"62d2af5286159761586445e78877a9ac479c8aaf3382dd1600c74a694d3a305e","start":162}],"target_id":"concept.usgs.2069","target_kind":"node","target_sha256":"35b8e14bff48666cb4fb51d44aa9c238a26979b6a2bb60f1209a976047032257"}],"concept.usgs.2070":[{"id":"assertion.concept.usgs.2070","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal emergence as defined in the captured USGS Thesaurus term 2070","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal emergence as: Relative uplift of the coast accompanied by seaward displacement of the shoreline. This category is also used for regression (marine)","support":[{"end":281,"quote":"Relative uplift of the coast accompanied by seaward displacement of the shoreline.\nThis category is also used for\nregression (marine)","source_id":"usgs-thesaurus.2070","source_sha256":"8d600734e81c8373f7bef6dd4ee01e546b3701c4b0a09b5e359f1975449f6c69","start":148}],"target_id":"concept.usgs.2070","target_kind":"node","target_sha256":"470cb2afd56d545b1bcc7aad8f80a02fe4bd6d0335c7eeb667fe0aed02b1e83b"}],"concept.usgs.2071":[{"id":"assertion.concept.usgs.2071","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal submergence as defined in the captured USGS Thesaurus term 2071","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal submergence as: Relative subsidence of the coast accompanied by landward displacement of the shoreline. This category is also used for transgression (marine)","support":[{"end":293,"quote":"Relative subsidence of the coast accompanied by landward displacement of the shoreline.\nThis category is also used for\ntransgression (marine)","source_id":"usgs-thesaurus.2071","source_sha256":"fd2c329f3dee73707ae30f81f2849515cf267ab6d399f181382a3f73c3e8980c","start":152}],"target_id":"concept.usgs.2071","target_kind":"node","target_sha256":"0bba603cc32f9759d9d78f9de7d03c751f42515c4964d808dd310239ba019ff7"}],"concept.usgs.2072":[{"id":"assertion.concept.usgs.2072","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Shoreline accretion as defined in the captured USGS Thesaurus term 2072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Shoreline accretion as: Seaward migration of the shoreline resulting from the addition of earth materials.","support":[{"end":234,"quote":"Seaward migration of the shoreline resulting from the addition of earth materials.","source_id":"usgs-thesaurus.2072","source_sha256":"00a9058e511535e9fa9add5938022ff59987531feb6fd2160d8cc59ed4cd6dd0","start":152}],"target_id":"concept.usgs.2072","target_kind":"node","target_sha256":"e6c4e147d2dba9ddf0b21da6d27dd29ed9cae07499e23a9737a40df398006a64"}],"concept.usgs.2080":[{"id":"assertion.concept.usgs.2080","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sound velocity as defined in the captured USGS Thesaurus term 2080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sound velocity as: Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties. This category is also used with profiles for sound velocity profiles","support":[{"end":307,"quote":"Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties.\nThis category is also used with\nprofiles\nfor\nsound velocity profiles","source_id":"usgs-thesaurus.2080","source_sha256":"81ff7202ee150b2f3ca962655af3c73b678c4996ceb788762cce24d824721ad0","start":105}],"target_id":"concept.usgs.2080","target_kind":"node","target_sha256":"b7b57bb36fc68c35198ddd56a8dc37172635113a08a9be3f8d533984b44f3365"}],"concept.usgs.2089":[{"id":"assertion.concept.usgs.2089","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Stratigraphic thickness as defined in the captured USGS Thesaurus term 2089","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Stratigraphic thickness as: Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data. This category is also used for isopach , with maps and atlases for isopach maps , sediment thickness , and with maps and atlases for stratigraphic thickness maps","support":[{"end":433,"quote":"Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data.\nThis category is also used for\nisopach\n,  with\nmaps and atlases\nfor\nisopach maps\n,\nsediment thickness\n, and  with\nmaps and atlases\nfor\nstratigraphic thickness maps","source_id":"usgs-thesaurus.2089","source_sha256":"52300acfab5522969a7206ebd1c2d28076b1d1d890341ad7c40b7e01e8a69608","start":153}],"target_id":"concept.usgs.2089","target_kind":"node","target_sha256":"36ac3fa10797bb9ac11412d1f120f14c949ee2aa48935aba637bb030469bc590"}],"concept.usgs.2091":[{"id":"assertion.concept.usgs.2091","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lakebed acoustic reflectivity as defined in the captured USGS Thesaurus term 2091","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lakebed acoustic reflectivity as: Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed. This category is also used for backscatter (lakebed)","support":[{"end":315,"quote":"Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed.\nThis category is also used for\nbackscatter (lakebed)","source_id":"usgs-thesaurus.2091","source_sha256":"73597b7f72b7ba7abd1b610b5a7680339c7e2db0c3de47887e722ede4e82d47b","start":166}],"target_id":"concept.usgs.2091","target_kind":"node","target_sha256":"136d1b4c83ad9fa6206770c3104a524ec60e18422045221c39c02fabd2916aa2"}],"concept.usgs.211":[{"id":"assertion.concept.usgs.211","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Core (earth) as defined in the captured USGS Thesaurus term 211","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Core (earth) as: The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","support":[{"end":257,"quote":"The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","source_id":"usgs-thesaurus.211","source_sha256":"22083940dab7ab13a66d525669d96c3cdcb4abefca6f65e401edff7779e8faad","start":124}],"target_id":"concept.usgs.211","target_kind":"node","target_sha256":"f11fe0f7e6870c129f5131747b3e14d6a57330037ab7b4b3f5d18e245d84eabc"}],"concept.usgs.219":[{"id":"assertion.concept.usgs.219","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Crust (earth) as defined in the captured USGS Thesaurus term 219","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Crust (earth) as: The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","support":[{"end":227,"quote":"The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","source_id":"usgs-thesaurus.219","source_sha256":"88dadf57eeb755bdb9796d8a4941d853be3f8f64546f207d172b9b11e308b1ec","start":126}],"target_id":"concept.usgs.219","target_kind":"node","target_sha256":"dfbb05550662677d7076f5429214e7b39d4c35ce9003a561f30f1d85f885a2ca"}],"concept.usgs.2264":[{"id":"assertion.concept.usgs.2264","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water column reflectivity as defined in the captured USGS Thesaurus term 2264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water column reflectivity as: A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles. This category is also used for backscatter (water column) , water column acoustic reflectivity , and water column optical reflectivity","support":[{"end":562,"quote":"A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles.\nThis category is also used for\nbackscatter (water column)\n,\nwater column acoustic reflectivity\n, and\nwater column optical reflectivity","source_id":"usgs-thesaurus.2264","source_sha256":"0a95a5d4e5bf4b2fded3a1270264966bc16f2c8b75fa42e5ff1f3478b876a2fc","start":127}],"target_id":"concept.usgs.2264","target_kind":"node","target_sha256":"f4c8f9d4926f84d6496b2e0c0b85845d2c858ccb60abb496175517289d6c12d3"}],"concept.usgs.2276":[{"id":"assertion.concept.usgs.2276","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Acid neutralizing potential as defined in the captured USGS Thesaurus term 2276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Acid neutralizing potential as: Geochemical capacity of earth materials to affect the pH of waters flowing through them. This category is also used for acid neutralizing capacity and neutralization potential","support":[{"end":339,"quote":"Geochemical capacity of earth materials to affect the pH of waters flowing through them.\nThis category is also used for\nacid neutralizing capacity\nand\nneutralization potential","source_id":"usgs-thesaurus.2276","source_sha256":"49a14855e0da15a47aa75bd5ea370a933ef838d46cd3beafca21dd3c6366c40e","start":164}],"target_id":"concept.usgs.2276","target_kind":"node","target_sha256":"1155b75aae72aac43ae58bb3e8990236da8b223e4ef904977d64a58925212156"}],"concept.usgs.2277":[{"id":"assertion.concept.usgs.2277","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Carbon flux as defined in the captured USGS Thesaurus term 2277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange","support":[{"end":282,"quote":"The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things.\nThis category is also used for\ncarbon exchange","source_id":"usgs-thesaurus.2277","source_sha256":"9643e6e583a4a6a8f2179d0e574c9b94077fa74d8bb8e0ca15f2e6aa1580ff81","start":139}],"target_id":"concept.usgs.2277","target_kind":"node","target_sha256":"545f11fbbfff5f26b5a5353301392d144e152b3fb1b79c7335ba35ce17a5a73d"}],"concept.usgs.2279":[{"id":"assertion.concept.usgs.2279","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Thermal maturation as defined in the captured USGS Thesaurus term 2279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Thermal maturation as: Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum. This category is also used for thermal indices , thermal maturity , and vitrinite reflectance","support":[{"end":470,"quote":"Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum.\nThis category is also used for\nthermal indices\n,\nthermal maturity\n, and\nvitrinite reflectance","source_id":"usgs-thesaurus.2279","source_sha256":"3f5fe6b2f1b4a6a66c6b674058779bb4ddfd5a08f6ee71babf830f808144c7b6","start":154}],"target_id":"concept.usgs.2279","target_kind":"node","target_sha256":"8215401dc01423e0e898083a7a4b4d12214cdc67deae256478c97ab9be4e3869"}],"concept.usgs.2281":[{"id":"assertion.concept.usgs.2281","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecosystem resilience as defined in the captured USGS Thesaurus term 2281","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecosystem resilience as: Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973) This category is also used for ecological resilience","support":[{"end":399,"quote":"Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973)\nThis category is also used for\necological resilience","source_id":"usgs-thesaurus.2281","source_sha256":"bf429f170c1f6c6972873826654b232fbd2eba7911be769ef9bcd0c4ec78b6be","start":157}],"target_id":"concept.usgs.2281","target_kind":"node","target_sha256":"25345cc5484e186d9a681234ef78d8627bba2049f2690ddca2651e81d1dc4600"}],"concept.usgs.2282":[{"id":"assertion.concept.usgs.2282","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fluid migration as defined in the captured USGS Thesaurus term 2282","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fluid migration as: Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces. This category is also used for interstitial fluid and pore fluid","support":[{"end":342,"quote":"Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces.\nThis category is also used for\ninterstitial fluid\nand\npore fluid","source_id":"usgs-thesaurus.2282","source_sha256":"d1fba003dc832c147fab457d7e180e199f6489b697e7676888999e07c2be9036","start":145}],"target_id":"concept.usgs.2282","target_kind":"node","target_sha256":"4325a53e80aaf4d56945053aac32165c3c99886feedc3cc79638b53f3d966f4b"}],"concept.usgs.2290":[{"id":"assertion.concept.usgs.2290","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Electromagnetic reflectance and emissivity as defined in the captured USGS Thesaurus term 2290","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Electromagnetic reflectance and emissivity as: Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength. Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems. This category is also used for infrared reflectance , laboratory reflectance , laboratory spectra , spectral radiance , and spectral reflectance","support":[{"end":615,"quote":"Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength.  Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems.\nThis category is also used for\ninfrared reflectance\n,\nlaboratory reflectance\n,\nlaboratory spectra\n,\nspectral radiance\n, and\nspectral reflectance","source_id":"usgs-thesaurus.2290","source_sha256":"6f65c16e4ecf93ab259f0c114232615c24bce11e9f7d2c2ad2e55b79969a4e3d","start":194}],"target_id":"concept.usgs.2290","target_kind":"node","target_sha256":"4a3bee9382a44c755c08c59c60366ec5a9cb46feff544ba9eeb6da7dfa647e9b"}],"concept.usgs.2291":[{"id":"assertion.concept.usgs.2291","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Gravity gradient as defined in the captured USGS Thesaurus term 2291","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Gravity gradient as: Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors. This category is also used for gravity gradiometry","support":[{"end":310,"quote":"Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors.\nThis category is also used for\ngravity gradiometry","source_id":"usgs-thesaurus.2291","source_sha256":"b72995bcaf359490f357c600413cf4d1b0ef7b8f80c97ecbb16067a4da1122a2","start":144}],"target_id":"concept.usgs.2291","target_kind":"node","target_sha256":"189b0c938b1e30607ae7384e44dbbfa7555ec16b25af9fa36539a0249c17130e"}],"concept.usgs.2295":[{"id":"assertion.concept.usgs.2295","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrocarbon reservoir processes as defined in the captured USGS Thesaurus term 2295","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrocarbon reservoir processes as: Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","support":[{"end":372,"quote":"Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","source_id":"usgs-thesaurus.2295","source_sha256":"828318a5f3f00eac0e7337f0d6f650d4168dfc2da85c6934468d1dc5e02bedf1","start":156}],"target_id":"concept.usgs.2295","target_kind":"node","target_sha256":"9487278ca74f006637f6fac34b338de0146722171387a2f6212f245f72daea09"}],"concept.usgs.2305":[{"id":"assertion.concept.usgs.2305","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Wildfires as defined in the captured USGS Thesaurus term 2305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Wildfires as: Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments. This category is also used for wildland fire","support":[{"end":380,"quote":"Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments.\nThis category is also used for\nwildland fire","source_id":"usgs-thesaurus.2305","source_sha256":"3ff7055c877336cbfe07e9d93d134532b7879a3476149f3d26ba9eb70492c609","start":120}],"target_id":"concept.usgs.2305","target_kind":"node","target_sha256":"4ffd4c3215ace31791a383abde97324f751e2bc85ad3a82d5b29d3f957ec3b5d"}],"concept.usgs.248":[{"id":"assertion.concept.usgs.248","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Diagenesis as defined in the captured USGS Thesaurus term 248","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Diagenesis as: Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","support":[{"end":246,"quote":"Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","source_id":"usgs-thesaurus.248","source_sha256":"e34b682bf3d711c9e3a6fb59b957877e3bda989174c71db4e4af810bbbe253fb","start":135}],"target_id":"concept.usgs.248","target_kind":"node","target_sha256":"2cd1bd9e64d83e7fd1f37763d498502107c5a80125b9273ccada83f285a4da58"}],"concept.usgs.268":[{"id":"assertion.concept.usgs.268","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dispersal (organisms) as defined in the captured USGS Thesaurus term 268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dispersal (organisms) as: The dissemination or geographic spread of individuals of a plant or animal population. This category is also used for colonization (organisms)","support":[{"end":301,"quote":"The dissemination or geographic spread of individuals of a plant or animal population.\nThis category is also used for\ncolonization (organisms)","source_id":"usgs-thesaurus.268","source_sha256":"bb9a8ce5390e4ae4b0ce4f8636de92ca2e0e55420bbf2f20ae9fd78cb56d6f7b","start":159}],"target_id":"concept.usgs.268","target_kind":"node","target_sha256":"22e7fe93881c7e85bc0cb9deca91e67aac851612138fc8c73c2546cd7f0e0f89"}],"concept.usgs.27":[{"id":"assertion.concept.usgs.27","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Air temperature as defined in the captured USGS Thesaurus term 27","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)","support":[{"end":185,"quote":"This category is also used for\ntemperature (air)","source_id":"usgs-thesaurus.27","source_sha256":"6a06ffc0eb2e82e95c8956691cb3befc2a3df25b89e22cf95101db4cee3b67d7","start":137}],"target_id":"concept.usgs.27","target_kind":"node","target_sha256":"f1c8be308228d8b79c53c25c4e3d280401ebcac7571a75daf12b7c57e2688fa4"}],"concept.usgs.284":[{"id":"assertion.concept.usgs.284","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Droughts as defined in the captured USGS Thesaurus term 284","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Droughts as: Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man. This category is also used for drought","support":[{"end":312,"quote":"Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man.\nThis category is also used for\ndrought","source_id":"usgs-thesaurus.284","source_sha256":"bfe8da5555412de7f6d6cf2f143f6641d1a4766ad95a7693142057417b5fab7b","start":147}],"target_id":"concept.usgs.284","target_kind":"node","target_sha256":"5355fc3db818bd301743802639ac11657df6b9603a5c25d6a007368e5de8100f"}],"concept.usgs.292":[{"id":"assertion.concept.usgs.292","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth structure as defined in the captured USGS Thesaurus term 292","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth structure as: Major interior structural features of the planet earth.","support":[{"end":167,"quote":"Major interior structural features of the planet earth.","source_id":"usgs-thesaurus.292","source_sha256":"92286eef60976e6749c02ca541229ab6d5542dee6ca751099ff3b912e3e83a4a","start":112}],"target_id":"concept.usgs.292","target_kind":"node","target_sha256":"ab562ae9e139c76441b9cfbf421af53b8345bf5c89efcb45d7fb09315a34779c"}],"concept.usgs.30":[{"id":"assertion.concept.usgs.30","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Algal blooms as defined in the captured USGS Thesaurus term 30","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides","support":[{"end":364,"quote":"Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions.\nThis category is also used for\nbrown tides\n,  with\nhazards\nfor\nharmful algal blooms\n, and\nred tides","source_id":"usgs-thesaurus.30","source_sha256":"a47846494a60aa3649f9dcd5745354a6f6fcdc899988f2634b00c859d77f3e1a","start":141}],"target_id":"concept.usgs.30","target_kind":"node","target_sha256":"a3654993d4a92ba515e4acf6ca17ca0bafa5758622e9aafaada4c07fbaca0b89"}],"concept.usgs.304":[{"id":"assertion.concept.usgs.304","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earthquakes as defined in the captured USGS Thesaurus term 304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earthquakes as: Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth. This category is also used with hazards for earthquake hazards","support":[{"end":404,"quote":"Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth.\nThis category is also used with\nhazards\nfor\nearthquake hazards","source_id":"usgs-thesaurus.304","source_sha256":"d5588013a51ce6c6e3c77160ae7bc9d77424c82023ef68a92ac7f9445172390e","start":137}],"target_id":"concept.usgs.304","target_kind":"node","target_sha256":"f035acbeeadbd64d7a20ec63f2b6f4ce1e16cbfdc420f385633ae770e603c32d"}],"concept.usgs.308":[{"id":"assertion.concept.usgs.308","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecological competition as defined in the captured USGS Thesaurus term 308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecological competition as: The struggle between members of two or more species for scarce environmental resources.","support":[{"end":248,"quote":"The struggle between members of two or more species for scarce environmental resources.","source_id":"usgs-thesaurus.308","source_sha256":"92f05afec7d255fe65f6dbd1b05a72cc42418c3a223c65cce0b45c6c78d5dbd0","start":161}],"target_id":"concept.usgs.308","target_kind":"node","target_sha256":"c1031accff64e8da9f58663e88e3fbf81441369dffcdcd08b75372930681fe7c"}],"concept.usgs.310":[{"id":"assertion.concept.usgs.310","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecological processes as defined in the captured USGS Thesaurus term 310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecological processes as: Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere. This category is also used for ecological models and environmental processes","support":[{"end":323,"quote":"Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere.\nThis category is also used for\necological models\nand\nenvironmental processes","source_id":"usgs-thesaurus.310","source_sha256":"95bc0804c8382ba580758b6df4ff14b42b8cd8bbebb34be60e0ee5705523119f","start":134}],"target_id":"concept.usgs.310","target_kind":"node","target_sha256":"9366bc7f34ebec197a8d8c7068326d9f343a1fe5fa7e8b9748b021921a377f28"}],"concept.usgs.315":[{"id":"assertion.concept.usgs.315","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecosystem functions as defined in the captured USGS Thesaurus term 315","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecosystem functions as: The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment. This category is also used with estuarine ecosystems for estuarine ecosystem functions","support":[{"end":376,"quote":"The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment.\nThis category is also used with\nestuarine ecosystems\nfor\nestuarine ecosystem functions","source_id":"usgs-thesaurus.315","source_sha256":"a73010a70320b1db812bbdc20cbcb92a057bc8a1072643315f3a46bffa921ce3","start":155}],"target_id":"concept.usgs.315","target_kind":"node","target_sha256":"0a3fadc548c9656cad1032b0fb4712a1ffe4c0d5dc11f7c946952a16934007a1"}],"concept.usgs.353":[{"id":"assertion.concept.usgs.353","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Erosion as defined in the captured USGS Thesaurus term 353","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Erosion as: The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another. This category is also used with coastal processes for beach erosion , with coastal processes for coastal erosion , dissolution , with coastal processes for shoreline erosion , with coastal processes for shoreline retreat , and with wind for wind erosion","support":[{"end":527,"quote":"The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another.\nThis category is also used with\ncoastal processes\nfor\nbeach erosion\n,  with\ncoastal processes\nfor\ncoastal erosion\n,\ndissolution\n,  with\ncoastal processes\nfor\nshoreline erosion\n,  with\ncoastal processes\nfor\nshoreline retreat\n, and  with\nwind\nfor\nwind erosion","source_id":"usgs-thesaurus.353","source_sha256":"2dcb37c7f3a5fcfab0e326d64607705d0e39af706576665908b49e90948b1391","start":129}],"target_id":"concept.usgs.353","target_kind":"node","target_sha256":"ec32f7adaa8ce8047a396cbcd0de797a0ae92f99975eec134d85c45b27583a01"}],"concept.usgs.359":[{"id":"assertion.concept.usgs.359","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Eutrophication as defined in the captured USGS Thesaurus term 359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Eutrophication as: The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","support":[{"end":249,"quote":"The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","source_id":"usgs-thesaurus.359","source_sha256":"b7ce266fba49d497d8cf1871003d1240080dd8774ccf245e16d56366c5bad60d","start":145}],"target_id":"concept.usgs.359","target_kind":"node","target_sha256":"c4f8ec8fb4cafd14b71151ec1f3f5c0aeb9a5fec9df5ec32dcaa7a3e1a1fafbd"}],"concept.usgs.365":[{"id":"assertion.concept.usgs.365","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Extinction and extirpation as defined in the captured USGS Thesaurus term 365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Extinction and extirpation as: Extinction is the complete disappearance of a species from the earth. Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area. This category is also used for extirpation","support":[{"end":389,"quote":"Extinction is the complete disappearance of a species from the earth.  Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area.\nThis category is also used for\nextirpation","source_id":"usgs-thesaurus.365","source_sha256":"6c7377c4f180eefe748766b44e58676a697b3f635aa2636407aed70632086f7d","start":169}],"target_id":"concept.usgs.365","target_kind":"node","target_sha256":"e1a320661bb76e5c9a84b09199ed1d6a9c0d97baedb87e9443fb8ce070135ea0"}],"concept.usgs.384":[{"id":"assertion.concept.usgs.384","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fires as defined in the captured USGS Thesaurus term 384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fires as: Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires. This category is also used with hazard preparedness for fire preparedness and fires (uncontrolled)","support":[{"end":411,"quote":"Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires.\nThis category is also used with\nhazard preparedness\nfor\nfire preparedness\nand\nfires (uncontrolled)","source_id":"usgs-thesaurus.384","source_sha256":"0f9e88f176714b011be2eba01da0188a18e7ea6119ccd213082dffeba4c496b1","start":104}],"target_id":"concept.usgs.384","target_kind":"node","target_sha256":"24bf8fe86f0af38b3c6c674ffab1cfe9b2f655aafe83736943639c8ba84ac63b"}],"concept.usgs.391":[{"id":"assertion.concept.usgs.391","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fishery resources as defined in the captured USGS Thesaurus term 391","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fishery resources as: The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","support":[{"end":233,"quote":"The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","source_id":"usgs-thesaurus.391","source_sha256":"6d70daf57b7f7208c8daa03bbacbbd0fca2e9caed89e93e1ac49650391f20ece","start":112}],"target_id":"concept.usgs.391","target_kind":"node","target_sha256":"4edc7070dd3cac4ccd37913cd2bf7a69e8b543333febdb51652266a58ad50315"}],"concept.usgs.398":[{"id":"assertion.concept.usgs.398","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Floods as defined in the captured USGS Thesaurus term 398","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Floods as: Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level. This category is also used for bankfull stage and with hazard preparedness for flood preparedness","support":[{"end":376,"quote":"Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level.\nThis category is also used for\nbankfull stage\nand  with\nhazard preparedness\nfor\nflood preparedness","source_id":"usgs-thesaurus.398","source_sha256":"350e22adc918377e2fead93583c09e0db7f8cf18970e9e367c57c4b7f1ee5e56","start":129}],"target_id":"concept.usgs.398","target_kind":"node","target_sha256":"edbbac770ea21976a8dab39e521966c6b35221437a9cf0c756239692973e83f3"}],"concept.usgs.404":[{"id":"assertion.concept.usgs.404","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Foliation (geologic) as defined in the captured USGS Thesaurus term 404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Foliation (geologic) as: The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","support":[{"end":270,"quote":"The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","source_id":"usgs-thesaurus.404","source_sha256":"a3f2fc935e0743efe6e0c2582da2834676484937c2aa2828ccfa9c90386871fb","start":143}],"target_id":"concept.usgs.404","target_kind":"node","target_sha256":"aaf02d4d8fd2ec6e99371ae71cec4ff40a8d08d89b3f1539961857ac727cc158"}],"concept.usgs.411":[{"id":"assertion.concept.usgs.411","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Forest resources as defined in the captured USGS Thesaurus term 411","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Forest resources as: Trees and associated vegetation available for human use. Use for timber and other forest resources with economic value. This category is also used for forestry","support":[{"end":270,"quote":"Trees and associated vegetation available for human use.  Use for timber and other forest resources with economic value.\nThis category is also used for\nforestry","source_id":"usgs-thesaurus.411","source_sha256":"ba81650877adc141fcd9c11e3bf736c0fcdf4560b001396bdbc5c3112e16a0b4","start":110}],"target_id":"concept.usgs.411","target_kind":"node","target_sha256":"9fb2a46800dd8281e4e3cea83aa6cf6f107d2b36247c9e08d6ad8cc6285ee60e"}],"concept.usgs.414":[{"id":"assertion.concept.usgs.414","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fossils as defined in the captured USGS Thesaurus term 414","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fossils as: Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth. This category is also used for index fossils and microfossils","support":[{"end":289,"quote":"Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth.\nThis category is also used for\nindex fossils\nand\nmicrofossils","source_id":"usgs-thesaurus.414","source_sha256":"ce87ec3b7297bb31173898a7db9dde3484b23e7cabbe02af7600118a3702eafc","start":117}],"target_id":"concept.usgs.414","target_kind":"node","target_sha256":"21a5be7824e40800cd85864bd78794e5c3550bdf3f035e0003ab1878a669a849"}],"concept.usgs.435":[{"id":"assertion.concept.usgs.435","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geochemical processes as defined in the captured USGS Thesaurus term 435","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","support":[{"end":257,"quote":"Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","source_id":"usgs-thesaurus.435","source_sha256":"a953c8432a136596af5f9500b2434db67449e2a2d06c125ce9e4247db21b95a3","start":136}],"target_id":"concept.usgs.435","target_kind":"node","target_sha256":"e2ce56c0e550b88486c7738430bfc618a04125651c6702a1a5003ad2404adf30"}],"concept.usgs.440":[{"id":"assertion.concept.usgs.440","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geodesy as defined in the captured USGS Thesaurus term 440","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geodesy as: Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","support":[{"end":322,"quote":"Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","source_id":"usgs-thesaurus.440","source_sha256":"2e1ad2ab1451e8850992fc39ab820b5eb81746fd8d252c49bd183f818bf9d392","start":104}],"target_id":"concept.usgs.440","target_kind":"node","target_sha256":"991e6dc61ea774d2b2d8495bb8d002d49e19cb16ac520b5ed17982b59e09b07b"}],"concept.usgs.451":[{"id":"assertion.concept.usgs.451","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic processes as defined in the captured USGS Thesaurus term 451","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic processes as: All types of processes involving geological structures. This category is also used for lithification","support":[{"end":230,"quote":"All types of processes involving geological structures.\nThis category is also used for\nlithification","source_id":"usgs-thesaurus.451","source_sha256":"e46db624243362bd4f452bbabad397726ba6ce3548867f98abbf9f029cfe9fba","start":130}],"target_id":"concept.usgs.451","target_kind":"node","target_sha256":"bb6d7ed3258c76b251f341c7f5ef58ce3a0ae0be812762ad65ff65408f1fc996"}],"concept.usgs.452":[{"id":"assertion.concept.usgs.452","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic contacts as defined in the captured USGS Thesaurus term 452","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic contacts as: Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes. This category is also used for contacts (geologic)","support":[{"end":320,"quote":"Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes.\nThis category is also used for\ncontacts (geologic)","source_id":"usgs-thesaurus.452","source_sha256":"83511b9925d107683512b72918b367b6a89a8593b4c7e310b4908dcf55c8b843","start":141}],"target_id":"concept.usgs.452","target_kind":"node","target_sha256":"8f69fad01afd5ca0ca03cb8e30611b3a860ed7fa2fff3859a46d502cf4cd57b3"}],"concept.usgs.459":[{"id":"assertion.concept.usgs.459","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic structure as defined in the captured USGS Thesaurus term 459","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic structure as: General position of rocks in an area, and geometrical relationships among rocks.","support":[{"end":198,"quote":"General position of rocks in an area, and geometrical relationships among rocks.","source_id":"usgs-thesaurus.459","source_sha256":"f68198744a8e61af855a2f23237e0d37e1eb1bb1f307355ea8b9a4147105c153","start":118}],"target_id":"concept.usgs.459","target_kind":"node","target_sha256":"45e60b5ab731faf20bb2e3a574a16d26428c0603fff527dc9c5b67dea813d1c0"}],"concept.usgs.482":[{"id":"assertion.concept.usgs.482","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Glaciation as defined in the captured USGS Thesaurus term 482","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Glaciation as: The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","support":[{"end":247,"quote":"The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","source_id":"usgs-thesaurus.482","source_sha256":"66b860eb92d46b179bfc365c24a2f3e7d87df55f0608579d19ea302960eb7abc","start":135}],"target_id":"concept.usgs.482","target_kind":"node","target_sha256":"206e7a3509df43583d619b314c126e529a9924e263fa037b5d4014b56af70195"}],"concept.usgs.501":[{"id":"assertion.concept.usgs.501","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Gravitational field (earth) as defined in the captured USGS Thesaurus term 501","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Gravitational field (earth) as: Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them. This category is also used for gravity , with maps and atlases for gravity anomaly maps , and gravity field","support":[{"end":415,"quote":"Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them.\nThis category is also used for\ngravity\n,  with\nmaps and atlases\nfor\ngravity anomaly maps\n, and\ngravity field","source_id":"usgs-thesaurus.501","source_sha256":"1daa8556ba43d8d29252064c82b00805b92c26803922c9b37e0d118ac8f3ffd9","start":136}],"target_id":"concept.usgs.501","target_kind":"node","target_sha256":"a97631917af645c7ddf7435e1848015eddd8b8927dd55b5eb8b277eac5b2f9fe"}],"concept.usgs.514":[{"id":"assertion.concept.usgs.514","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Groundwater flow as defined in the captured USGS Thesaurus term 514","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Groundwater flow as: Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge. This category is also used for ground-water flow , groundwater flow modeling , and groundwater movement","support":[{"end":349,"quote":"Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge.\nThis category is also used for\nground-water flow\n,\ngroundwater flow modeling\n, and\ngroundwater movement","source_id":"usgs-thesaurus.514","source_sha256":"f9fc1beffc0522deb285e94fc0a2b553bae33cdcd38fc4b6aa4fba3a7103e561","start":149}],"target_id":"concept.usgs.514","target_kind":"node","target_sha256":"c08959c44acb85f07a34d4d2d1f1a038eb2c11199e9d11c3a493017659394ff8"}],"concept.usgs.522":[{"id":"assertion.concept.usgs.522","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Habitat alteration and disturbance as defined in the captured USGS Thesaurus term 522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Habitat alteration and disturbance as: Changes in the environments where plants and animals live. Includes natural changes as well as results of human actions, deliberate or accidental. This category is also used for ecological disturbance , environmental disturbance , habitat destruction , and habitat disturbance","support":[{"end":462,"quote":"Changes in the environments where plants and animals live.  Includes natural changes as well as results of human actions, deliberate or accidental.\nThis category is also used for\necological disturbance\n,\nenvironmental disturbance\n,\nhabitat destruction\n, and\nhabitat disturbance","source_id":"usgs-thesaurus.522","source_sha256":"74836441f10673c29ff09190ce7fcb24a4f85e6d15e4d328f620604bc3f5d767","start":185}],"target_id":"concept.usgs.522","target_kind":"node","target_sha256":"585df39a949d0cfe10efbf0d9fc522f6fc013a5fa9081bdce59b0d71df001b10"}],"concept.usgs.531":[{"id":"assertion.concept.usgs.531","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hazards as defined in the captured USGS Thesaurus term 531","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hazards as: Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment. This category is also used for catastrophes , with coastal processes for coastal hazards , disasters , with earthquakes for earthquake hazards , emergency management resources , environmental hazards , geologic hazards , with algal blooms for harmful algal blooms , and with ocean processes for ocean hazards","support":[{"end":516,"quote":"Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment.\nThis category is also used for\ncatastrophes\n,  with\ncoastal processes\nfor\ncoastal hazards\n,\ndisasters\n,  with\nearthquakes\nfor\nearthquake hazards\n,\nemergency management resources\n,\nenvironmental hazards\n,\ngeologic hazards\n,  with\nalgal blooms\nfor\nharmful algal blooms\n, and  with\nocean processes\nfor\nocean hazards","source_id":"usgs-thesaurus.531","source_sha256":"e8b78cfabb7063d79d6059b1ca9ea3be8d4a9c09535c63efa99b0c75a7b6115e","start":72}],"target_id":"concept.usgs.531","target_kind":"node","target_sha256":"14557e4b4a1170dd25e5f0f58fce42c1978709c1764a5b1a5e71f0e453b36167"}],"concept.usgs.534":[{"id":"assertion.concept.usgs.534","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Heat flow (earth) as defined in the captured USGS Thesaurus term 534","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Heat flow (earth) as: Energy transferred by a difference in temperature through the surface of the earth. This category is also used for geothermics and heatflow (earth)","support":[{"end":296,"quote":"Energy transferred by a difference in temperature through the surface of the earth.\nThis category is also used for\ngeothermics\nand\nheatflow (earth)","source_id":"usgs-thesaurus.534","source_sha256":"6a8b929a06365044cce22653f8732aa754028b662e7db7248383226409c9a420","start":149}],"target_id":"concept.usgs.534","target_kind":"node","target_sha256":"38b0aca3ba0474eab901fb4a037f748abbfe9a35f536a3906949b7df876d25ba"}],"concept.usgs.562":[{"id":"assertion.concept.usgs.562","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrothermal processes as defined in the captured USGS Thesaurus term 562","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.","support":[{"end":232,"quote":"Natural phenomena relating to heated water generated by igneous activity.","source_id":"usgs-thesaurus.562","source_sha256":"8a71b4386761b2106f0dee125338412bb34adbb01f08ee96d5113cfc7b1cdbb0","start":159}],"target_id":"concept.usgs.562","target_kind":"node","target_sha256":"e801535a0af509c0d1838e0c48143bba437ed75f49389f2cad649f7c819afadd"}],"concept.usgs.572":[{"id":"assertion.concept.usgs.572","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Igneous rocks as defined in the captured USGS Thesaurus term 572","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Igneous rocks as: Rocks formed from melted rock that has cooled and solidified.","support":[{"end":190,"quote":"Rocks formed from melted rock that has cooled and solidified.","source_id":"usgs-thesaurus.572","source_sha256":"68de0220444c5d18efcef3c17101ba9c240d27b02f4baad105ddc50ffd3eadb5","start":129}],"target_id":"concept.usgs.572","target_kind":"node","target_sha256":"6b2ce2687fc7c69f4a05ea19d484a4bfd98dece6b5163cf8b902b767f85bdd6b"}],"concept.usgs.608":[{"id":"assertion.concept.usgs.608","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Isostasy as defined in the captured USGS Thesaurus term 608","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Isostasy as: Condition of equilibrium or buoyancy of the earth's crust above the mantle.","support":[{"end":206,"quote":"Condition of equilibrium or buoyancy of the earth's crust above the mantle.","source_id":"usgs-thesaurus.608","source_sha256":"9de444e25e1588079fc15fe431d298861003d37c73aef9773f0bf0b19e2889c9","start":131}],"target_id":"concept.usgs.608","target_kind":"node","target_sha256":"39078814c6d343a54728d08bf97d95ecd653608c25feda6e2ec7a7eca89eed9a"}],"concept.usgs.624":[{"id":"assertion.concept.usgs.624","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Subsidence as defined in the captured USGS Thesaurus term 624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Subsidence as: Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas. This category is also used for land subsidence and with maps and atlases for land subsidence maps","support":[{"end":357,"quote":"Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas.\nThis category is also used for\nland subsidence\nand  with\nmaps and atlases\nfor\nland subsidence maps","source_id":"usgs-thesaurus.624","source_sha256":"1f5f37c1ef10306ae077a07566d9b171a0a1024cdd92457bb60418a5c35aebd9","start":135}],"target_id":"concept.usgs.624","target_kind":"node","target_sha256":"0e2d107f4bcaff0f5b89d0ea313d19b8df346e877403ecc478e5253dade8662e"}],"concept.usgs.63":[{"id":"assertion.concept.usgs.63","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric and climatic processes as defined in the captured USGS Thesaurus term 63","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric and climatic processes as: Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions. This category is also used for climate , microclimate , weather , with field inventory and monitoring for weather monitoring , and with field inventory and monitoring for weather observations","support":[{"end":507,"quote":"Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions.\nThis category is also used for\nclimate\n,\nmicroclimate\n,\nweather\n,  with\nfield inventory and monitoring\nfor\nweather monitoring\n, and  with\nfield inventory and monitoring\nfor\nweather observations","source_id":"usgs-thesaurus.63","source_sha256":"d2880c4405d4d156d5f745e3166ef1a41f554a933935f2dcd2ee077a0c797754","start":162}],"target_id":"concept.usgs.63","target_kind":"node","target_sha256":"4587f59c0860aa5314b4dc6fc342ead1ab6bc5d96f03ad217f02226e756baa91"}],"concept.usgs.64":[{"id":"assertion.concept.usgs.64","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric circulation as defined in the captured USGS Thesaurus term 64","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.","support":[{"end":224,"quote":"Movement of atmospheric gases around the earth.","source_id":"usgs-thesaurus.64","source_sha256":"4ec370930fc44718196e072775863fed158e057e90a2cfc73bd6806fb8400996","start":177}],"target_id":"concept.usgs.64","target_kind":"node","target_sha256":"8671f65f2770696830f763fd73d1f519374b888baa27c38bb63b074c0e8abad1"}],"concept.usgs.65":[{"id":"assertion.concept.usgs.65","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric composition as defined in the captured USGS Thesaurus term 65","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution","support":[{"end":376,"quote":"Components of the mass of gases that surrounds a planet.  The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases.\nThis category is also used with\ncontamination and pollution\nfor\nair pollution","source_id":"usgs-thesaurus.65","source_sha256":"1d023bb1608cc042d18e601324745d230c1b92b6eb0994339b4471a1b5e4d53e","start":153}],"target_id":"concept.usgs.65","target_kind":"node","target_sha256":"82b0019e8240ae5e54e169020999b506e77dd3443b04374431101706d269a6d6"}],"concept.usgs.66":[{"id":"assertion.concept.usgs.66","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric deposition (chemical & particulate) as defined in the captured USGS Thesaurus term 66","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric deposition (chemical & particulate) as: The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles). This category is also used for atmospheric deposition (chemical and particulate) and atmospheric dust deposition","support":[{"end":506,"quote":"The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles).\nThis category is also used for\natmospheric deposition (chemical and particulate)\nand\natmospheric dust deposition","source_id":"usgs-thesaurus.66","source_sha256":"2b220058d3a000c35e561292540258c09947800ee011c51fe0e64f1a4ea2057a","start":225}],"target_id":"concept.usgs.66","target_kind":"node","target_sha256":"6229cb7f5c2ab2b6db038a056b4f50d00926df7bd941f3ae7c4c9847c215bf3c"}],"concept.usgs.660":[{"id":"assertion.concept.usgs.660","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lineation (geologic) as defined in the captured USGS Thesaurus term 660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lineation (geologic) as: Linear topographic feature on the earth's surface or in rocks. This category is also used for lineaments","support":[{"end":247,"quote":"Linear topographic feature on the earth's surface or in rocks.\nThis category is also used for\nlineaments","source_id":"usgs-thesaurus.660","source_sha256":"0408d0ecda228dd1f923b3bb8179c1a36a5d850412c4e00e8238f2cab08fc065","start":143}],"target_id":"concept.usgs.660","target_kind":"node","target_sha256":"1788f5fa0de18f9a0100e79bf5ef0cdb309fac58001a19efa4bce6742da7db20"}],"concept.usgs.67":[{"id":"assertion.concept.usgs.67","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric properties as defined in the captured USGS Thesaurus term 67","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric properties as: Characteristics of the mass of gases surrounding the earth such as composition, temperature, pressure, and humidity. This category is also used for atmosphere properties","support":[{"end":296,"quote":"Characteristics of the mass of gases surrounding the earth  such as composition, temperature, pressure, and humidity.\nThis category is also used for\natmosphere properties","source_id":"usgs-thesaurus.67","source_sha256":"b106aa8112b498fd7f10fbde22492535ed892a33bf4aeba1357cfe146fe0a36d","start":126}],"target_id":"concept.usgs.67","target_kind":"node","target_sha256":"effd65fe5b7b9f95046e715d05556d2a58aece6e4517d323f68505e31b052f51"}],"concept.usgs.677":[{"id":"assertion.concept.usgs.677","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetic field (earth) as defined in the captured USGS Thesaurus term 677","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere","support":[{"end":512,"quote":"The magnetic region surrounding earth.  It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles.\nThis category is also used for\ngeomagnetic field\n,\ngeomagnetics\n,\ngeomagnetism\n,  with\nmaps and atlases\nfor\nmagnetic anomaly maps\n,\nmagnetic field\n, and\nmagnetosphere","source_id":"usgs-thesaurus.677","source_sha256":"a6cfad72b19379d7710ec186243f784fcce1b5c04bb83167f4b466bddc69136c","start":126}],"target_id":"concept.usgs.677","target_kind":"node","target_sha256":"34789bedc53461ae9aaf2a94c5093cf817d77855439b21a110f123fa6f9d140a"}],"concept.usgs.690":[{"id":"assertion.concept.usgs.690","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mantle (earth) as defined in the captured USGS Thesaurus term 690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mantle (earth) as: Zone of earth's interior between the crust and the core. It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","support":[{"end":362,"quote":"Zone of earth's interior between the crust and the core.  It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","source_id":"usgs-thesaurus.690","source_sha256":"6acb1cd1a761ca35ec65bd99f356ed93e5ed0676037fcc0cd7a2c76feb560890","start":128}],"target_id":"concept.usgs.690","target_kind":"node","target_sha256":"6518a382398e5dd55c4bdded22977d1d876ef16ebe770d363a92e3b66640bb3c"}],"concept.usgs.703":[{"id":"assertion.concept.usgs.703","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine chemistry as defined in the captured USGS Thesaurus term 703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine chemistry as: Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans. This category is also used for chemical oceanography , ocean chemistry , and water properties (marine)","support":[{"end":374,"quote":"Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans.\nThis category is also used for\nchemical oceanography\n,\nocean chemistry\n, and\nwater properties (marine)","source_id":"usgs-thesaurus.703","source_sha256":"2f9dbb636c96f597b16bb777defd75a08032ce17162f9b0c7722a55974c7d472","start":142}],"target_id":"concept.usgs.703","target_kind":"node","target_sha256":"35ee298eada582883cd3935782632573137dc6bf3b144f6fa786334e2d46bc2a"}],"concept.usgs.725":[{"id":"assertion.concept.usgs.725","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Metamorphic rocks as defined in the captured USGS Thesaurus term 725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Metamorphic rocks as: Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","support":[{"end":321,"quote":"Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","source_id":"usgs-thesaurus.725","source_sha256":"9b55905ac3a3689e53f49b3a6e7558ada24756ab69db0915f7f0da2e55e0c75a","start":137}],"target_id":"concept.usgs.725","target_kind":"node","target_sha256":"741e8de664b22fb4755aa11ef87b92671fcc3bc0b632f8c566d9482698933058"}],"concept.usgs.727":[{"id":"assertion.concept.usgs.727","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Metamorphism (geological) as defined in the captured USGS Thesaurus term 727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","support":[{"end":286,"quote":"Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","source_id":"usgs-thesaurus.727","source_sha256":"82e97d11d1d66484217ab5a9321052b756f610e69ab1d5eb6249bbfdb8ca0840","start":165}],"target_id":"concept.usgs.727","target_kind":"node","target_sha256":"4a94f75142c5097b3af06bef6af9c6bb3f1c2e6092d352965ad2c6deb1b7b64c"}],"concept.usgs.743":[{"id":"assertion.concept.usgs.743","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Migration (organisms) as defined in the captured USGS Thesaurus term 743","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Migration (organisms) as: The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions. This category is also used with invasive species for biological invasions , with biogeography for flyways , and seasonal migration","support":[{"end":429,"quote":"The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions.\nThis category is also used with\ninvasive species\nfor\nbiological invasions\n,  with\nbiogeography\nfor\nflyways\n, and\nseasonal migration","source_id":"usgs-thesaurus.743","source_sha256":"779f25eea3a696c2a7f0fb9853da7ac2b653bb3b8295cb07277e1391f4af0537","start":159}],"target_id":"concept.usgs.743","target_kind":"node","target_sha256":"4e3dc6803b4fd4ca207a2bac7e3f713cfa1d1ec533a8d88bdd6e75b567aa33e2"}],"concept.usgs.745":[{"id":"assertion.concept.usgs.745","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mineral resources as defined in the captured USGS Thesaurus term 745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mineral resources as: Natural occurrences of useful inorganic elements or compounds.","support":[{"end":174,"quote":"Natural occurrences of useful inorganic elements or compounds.","source_id":"usgs-thesaurus.745","source_sha256":"d08f4db09a0c5adafbb85e68fc8710c91f1af42e1b6357020c4a8f3889118110","start":112}],"target_id":"concept.usgs.745","target_kind":"node","target_sha256":"8f03446fc7c819ea21d7a37193edda3e3bc1b042857b7014f3f4d8d6b6428624"}],"concept.usgs.777":[{"id":"assertion.concept.usgs.777","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Natural resources as defined in the captured USGS Thesaurus term 777","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Natural resources as: Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","support":[{"end":243,"quote":"Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","source_id":"usgs-thesaurus.777","source_sha256":"5a1a60c3984fc8a6cd66b15aeae4bdebf6cd424582c93c15638f25b27764c026","start":92}],"target_id":"concept.usgs.777","target_kind":"node","target_sha256":"ddb7fff7c7c83694a7b3c8d540e1a7326c35537751f33f9fc9a3bbc862729c39"}],"concept.usgs.799":[{"id":"assertion.concept.usgs.799","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Energy resources as defined in the captured USGS Thesaurus term 799","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Energy resources as: Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy. This category is also used for energy sources and fossil fuels","support":[{"end":292,"quote":"Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy.\nThis category is also used for\nenergy sources\nand\nfossil fuels","source_id":"usgs-thesaurus.799","source_sha256":"b3defc5af01386048f25aeb6696d627b46835726b327fe09cbf9afc9f9c9a56c","start":110}],"target_id":"concept.usgs.799","target_kind":"node","target_sha256":"e8f7f3fc15750c54f5283fa062f6fb249d73446326940e17d668a748f53b8e52"}],"concept.usgs.80":[{"id":"assertion.concept.usgs.80","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bathymetry as defined in the captured USGS Thesaurus term 80","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bathymetry as: The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface. This category is also used for bathymetry data , sea floor topography , and underwater contours","support":[{"end":364,"quote":"The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface.\nThis category is also used for\nbathymetry data\n,\nsea floor topography\n, and\nunderwater contours","source_id":"usgs-thesaurus.80","source_sha256":"da62756dfd43151c6c16988cc2c6e36d66552eec6d1d1be572cb36bdef414d35","start":115}],"target_id":"concept.usgs.80","target_kind":"node","target_sha256":"7bf178aa2668ecc971ae2db7263653ea156194df15901941b7e8049e4c7d0569"}],"concept.usgs.806":[{"id":"assertion.concept.usgs.806","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Nutrient content (water) as defined in the captured USGS Thesaurus term 806","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Nutrient content (water) as: Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water. This category is also used for nitrogen content and phosphorus content","support":[{"end":410,"quote":"Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water.\nThis category is also used for\nnitrogen content\nand\nphosphorus content","source_id":"usgs-thesaurus.806","source_sha256":"6a6b244edecdec3620f43bd9fd641fe5b731d9bc6babcb816d357a5b38e61f29","start":125}],"target_id":"concept.usgs.806","target_kind":"node","target_sha256":"64a80071885ead05fb9a3e811f79a468f37095acbc43fb54219b5c9016f4db7e"}],"concept.usgs.816":[{"id":"assertion.concept.usgs.816","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean processes as defined in the captured USGS Thesaurus term 816","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean processes as: Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans. This category is also used with sediment transport for marine sediment transport , with hazards for ocean hazards , and with ocean characteristics for oceans","support":[{"end":393,"quote":"Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans.\nThis category is also used with\nsediment transport\nfor\nmarine sediment transport\n,  with\nhazards\nfor\nocean hazards\n, and  with\nocean characteristics\nfor\noceans","source_id":"usgs-thesaurus.816","source_sha256":"a3dedf689394cf36e4c121427f4d9547d402e07d297f2c43047816274c5e2524","start":124}],"target_id":"concept.usgs.816","target_kind":"node","target_sha256":"64867346fd2914149d4035631b15b2d004d3d329854cbaf5009fcc7031db4e09"}],"concept.usgs.817":[{"id":"assertion.concept.usgs.817","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean salinity as defined in the captured USGS Thesaurus term 817","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean salinity as: Measure of the percentage of dissolved salts in seawater.","support":[{"end":191,"quote":"Measure of the percentage of dissolved salts in seawater.","source_id":"usgs-thesaurus.817","source_sha256":"f8ff9095b9fd513dc88a0428fdcb1f02c11581943211e9e51b2757a80e0bfc26","start":134}],"target_id":"concept.usgs.817","target_kind":"node","target_sha256":"92b7cddacc277768f9aa0bcf94fd204466522f0f1aac2036f7342d11b446583b"}],"concept.usgs.819":[{"id":"assertion.concept.usgs.819","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean temperature as defined in the captured USGS Thesaurus term 819","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)","support":[{"end":374,"quote":"Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters.  Includes discussion and measures of both in-situ and potential temperature.\nThis category is also used for\ntemperature (ocean)","source_id":"usgs-thesaurus.819","source_sha256":"429ad76720d7741f187573874d3acfedc7b121aca0e23bab84ed89c1d92fc9ec","start":140}],"target_id":"concept.usgs.819","target_kind":"node","target_sha256":"28c408bc96816fb768b4f05f1d83825d1110502cd2542db7064415d37c9db24f"}],"concept.usgs.823":[{"id":"assertion.concept.usgs.823","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean-atmosphere interaction as defined in the captured USGS Thesaurus term 823","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean-atmosphere interaction as: Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans. This category is also used for El Nino and La Nina","support":[{"end":429,"quote":"Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans.\nThis category is also used for\nEl Nino\nand\nLa Nina","source_id":"usgs-thesaurus.823","source_sha256":"1a4022c24856143afc083a1bcae4f194f6e670a3cd43f3b19f093f44c4d9cb73","start":187}],"target_id":"concept.usgs.823","target_kind":"node","target_sha256":"4b9a2bef36bf17b67300ec18f8bd8d1ee2c1a17758dda333c78f0719ab8a1d71"}],"concept.usgs.84":[{"id":"assertion.concept.usgs.84","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bedrock geologic units as defined in the captured USGS Thesaurus term 84","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bedrock geologic units as: Units of consolidated (solid) rock that underlie soils or other unconsolidated materials. This category is also used with maps and atlases for basement maps and geologic formations","support":[{"end":331,"quote":"Units of consolidated (solid) rock that underlie soils or other unconsolidated materials.\nThis category is also used with\nmaps and atlases\nfor\nbasement maps\nand\ngeologic formations","source_id":"usgs-thesaurus.84","source_sha256":"b0aa5da46deed69a730a9ade33ce27def09d6d427d4f7db6078b2a4130bc20fb","start":151}],"target_id":"concept.usgs.84","target_kind":"node","target_sha256":"142ee12bf55fe217b073b239a1c8f3586f5fda50eda5a6c0a7f2312e0c102cd9"}],"concept.usgs.854":[{"id":"assertion.concept.usgs.854","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Oxygen content (water) as defined in the captured USGS Thesaurus term 854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Oxygen content (water) as: Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body. This category is also used for anoxia , dissolved oxygen , and hypoxia","support":[{"end":320,"quote":"Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body.\nThis category is also used for\nanoxia\n,\ndissolved oxygen\n, and\nhypoxia","source_id":"usgs-thesaurus.854","source_sha256":"d4d7503ea45e5c94ab66398a465030384d08e6fe53e12ea0d9588e7a43bc758b","start":121}],"target_id":"concept.usgs.854","target_kind":"node","target_sha256":"2db9053a5266c8ad517f5dac4a1a1ed44a9e8bf76f7876a3719a169d259dcc89"}],"concept.usgs.858":[{"id":"assertion.concept.usgs.858","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleobotany as defined in the captured USGS Thesaurus term 858","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleobotany as: Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","support":[{"end":215,"quote":"Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","source_id":"usgs-thesaurus.858","source_sha256":"10f816652547e27118f67084b692adfda3cda051d9f341a71bf257d51564a5a1","start":114}],"target_id":"concept.usgs.858","target_kind":"node","target_sha256":"b7ffabf1756bf4fdea503d201e37259a047ab83cafab2cc89cb08f81a466fc88"}],"concept.usgs.88":[{"id":"assertion.concept.usgs.88","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bioaccumulation as defined in the captured USGS Thesaurus term 88","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bioaccumulation as: The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium. Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources. This category is also used for bioconcentration","support":[{"end":458,"quote":"The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium.  Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources.\nThis category is also used for\nbioconcentration","source_id":"usgs-thesaurus.88","source_sha256":"9bb3f1683ec671bf189a3aee2a4b808cb8964802253c62f407e45cde281bcd2a","start":147}],"target_id":"concept.usgs.88","target_kind":"node","target_sha256":"d9588d893cb013114578b232007ff84854b918a1878b45667309b872ade2fac6"}],"concept.usgs.915":[{"id":"assertion.concept.usgs.915","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Pollination as defined in the captured USGS Thesaurus term 915","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Pollination as: Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","support":[{"end":274,"quote":"Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","source_id":"usgs-thesaurus.915","source_sha256":"d466e4ca642e7798b3efe5d11a437a0a7bee2201bb5f85ddce8b770b934e9901","start":139}],"target_id":"concept.usgs.915","target_kind":"node","target_sha256":"be0ad08fe0d6077b9404bd540d84a0f00489a18472d86f1a889e5b98f8240f62"}],"concept.usgs.927":[{"id":"assertion.concept.usgs.927","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Precipitation (atmospheric) as defined in the captured USGS Thesaurus term 927","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Precipitation (atmospheric) as: Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet. This category is also used with field inventory and monitoring for precipitation measurement , rain , rainfall , with field inventory and monitoring for rainfall measurement , snow , snowfall , and with field inventory and monitoring for snowfall measurement","support":[{"end":548,"quote":"Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet.\nThis category is also used with\nfield inventory and monitoring\nfor\nprecipitation measurement\n,\nrain\n,\nrainfall\n,  with\nfield inventory and monitoring\nfor\nrainfall measurement\n,\nsnow\n,\nsnowfall\n, and  with\nfield inventory and monitoring\nfor\nsnowfall measurement","source_id":"usgs-thesaurus.927","source_sha256":"6dc6959dafecbcb1683a3d966a11572cba91a6315a5b007c683c0dda8c29c0bd","start":185}],"target_id":"concept.usgs.927","target_kind":"node","target_sha256":"f7236c38690b84405b1b33c7a563d023aaf4ed318682eaf9e1b6664372622bcc"}],"concept.usgs.93":[{"id":"assertion.concept.usgs.93","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biogeochemical cycling as defined in the captured USGS Thesaurus term 93","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition","support":[{"end":365,"quote":"The cycling of chemical constituents through a biological system.\nThis category is also used for\nbiogeochemical functioning\n,\nbiogeochemical processes\n,\ndecomposition (organic)\n, and\norganic decomposition","source_id":"usgs-thesaurus.93","source_sha256":"b376bdc281906d72a5570f2392ac5750e56a9d2235f5bb413264d93ab9d56d9b","start":161}],"target_id":"concept.usgs.93","target_kind":"node","target_sha256":"f4dd0675bc700abb62979893ca579b2792219bfebef5547a918ce2054a2da57a"}],"concept.wikipedia.a-b-testing":[{"id":"assertion.concept.wikipedia.a-b-testing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A/B testing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A/B testing\", CC BY-SA 4.0) states: A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","support":[{"end":214,"quote":"A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","source_id":"wikipedia.article.a-b-testing","source_sha256":"765242c1521535d6fbfae3a2c87156c6a1e09a9f5ddb47e0d23ded318fb0e204","start":98}],"target_id":"concept.wikipedia.a-b-testing","target_kind":"node","target_sha256":"9f9ca7339d6f22da0bcc976387991e9d160b37dfafb3166b0a12df3c63fd1088"}],"concept.wikipedia.a-frame":[{"id":"assertion.concept.wikipedia.a-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A-frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A-frame\", CC BY-SA 4.0) states: An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","support":[{"end":185,"quote":"An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","source_id":"wikipedia.article.a-frame","source_sha256":"7d621a9f4a5fd9fb83d9e9afb0ba06027d6cae4351291cdbf34fbf032f15e35e","start":94}],"target_id":"concept.wikipedia.a-frame","target_kind":"node","target_sha256":"56b0637de23263006321b0a8690b4300253547fc31668b291def52bcbde6a4a6"}],"concept.wikipedia.a-homotopy-theory":[{"id":"assertion.concept.wikipedia.a-homotopy-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A¹ homotopy theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A¹ homotopy theory\", CC BY-SA 4.0) states: In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","support":[{"end":357,"quote":"In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","source_id":"wikipedia.article.a-homotopy-theory","source_sha256":"3b1cb7ed7addcbc95174b37ba9c14d794a0e727362dcbcad09e46257ffe580ba","start":106}],"target_id":"concept.wikipedia.a-homotopy-theory","target_kind":"node","target_sha256":"627b8e7e56905ed33d0c2582181efa03e395563042cbc2f9b0bfdf48365c8cac"}],"concept.wikipedia.a-priori-and-a-posteriori":[{"id":"assertion.concept.wikipedia.a-priori-and-a-posteriori","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A priori and a posteriori as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A priori and a posteriori\", CC BY-SA 4.0) states: In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","support":[{"end":342,"quote":"In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","source_id":"wikipedia.article.a-priori-and-a-posteriori","source_sha256":"5f19b2fd15c6f47b6873342aac9444df37227c9871e090afba4b55a124269596","start":112}],"target_id":"concept.wikipedia.a-priori-and-a-posteriori","target_kind":"node","target_sha256":"65d1d6fe1d05646f75e1671adde2bdb6df52f389260dbd6b241fb14960a729b2"}],"concept.wikipedia.a-series-and-b-series":[{"id":"assertion.concept.wikipedia.a-series-and-b-series","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A series and B series as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A series and B series\", CC BY-SA 4.0) states: In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","support":[{"end":232,"quote":"In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","source_id":"wikipedia.article.a-series-and-b-series","source_sha256":"e65bd3796d2089a843f885dcffababbcb319269e5ca7f687a24b4604731cbc8c","start":108}],"target_id":"concept.wikipedia.a-series-and-b-series","target_kind":"node","target_sha256":"3a61ddfb25c2e943509ec4afd489b15d56da530bb6dbcfc4b95424ebe972fa6e"}],"concept.wikipedia.abductive-reasoning":[{"id":"assertion.concept.wikipedia.abductive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abductive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abductive reasoning\", CC BY-SA 4.0) states: Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","support":[{"end":295,"quote":"Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","source_id":"wikipedia.article.abductive-reasoning","source_sha256":"6d46153feadfe66eb39b937e4ed2730b274503fe090548e715ed0c7c4de15d73","start":104}],"target_id":"concept.wikipedia.abductive-reasoning","target_kind":"node","target_sha256":"e6ca96543ec6d3e668af4061fbca12aad4092c357df45bfa413873e23d81dbde"}],"concept.wikipedia.abel-s-summation-formula":[{"id":"assertion.concept.wikipedia.abel-s-summation-formula","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's summation formula as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's summation formula\", CC BY-SA 4.0) states: In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","support":[{"end":285,"quote":"In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","source_id":"wikipedia.article.abel-s-summation-formula","source_sha256":"92cdf545f08a20d8dc8956c4f1ff196d1cd40ba4ebcc4826ba96c855d8397a00","start":111}],"target_id":"concept.wikipedia.abel-s-summation-formula","target_kind":"node","target_sha256":"366d3c29b82a00bb2e19960c0ccc6831717be0825fb68c0e5d9b3d859f57403a"}],"concept.wikipedia.abelian-category":[{"id":"assertion.concept.wikipedia.abelian-category","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abelian category as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abelian category\", CC BY-SA 4.0) states: In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","support":[{"end":266,"quote":"In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","source_id":"wikipedia.article.abelian-category","source_sha256":"5dd552ad7b407d12963f2568612860e5907fd5ce7eced790468a543bcb7f5c14","start":101}],"target_id":"concept.wikipedia.abelian-category","target_kind":"node","target_sha256":"95822d6efcaf80b38a6fdddcc66d5fe6a2049408abbafff9fc321c240f62d556"}],"concept.wikipedia.abenics":[{"id":"assertion.concept.wikipedia.abenics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ABENICS as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ABENICS\", CC BY-SA 4.0) states: ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","support":[{"end":381,"quote":"ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","source_id":"wikipedia.article.abenics","source_sha256":"ff0093efc6c7781665e0014bfd85e650cacf04ca6f833c1be8c347a61b5a2151","start":95}],"target_id":"concept.wikipedia.abenics","target_kind":"node","target_sha256":"2421abf9f8099abc8bb993cfbd3b7c40062bbc2b74d38daf4c66b61562c657bd"}],"concept.wikipedia.abnormal-grain-growth":[{"id":"assertion.concept.wikipedia.abnormal-grain-growth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abnormal grain growth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abnormal grain growth\", CC BY-SA 4.0) states: In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","support":[{"end":432,"quote":"In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","source_id":"wikipedia.article.abnormal-grain-growth","source_sha256":"68dd3f8d7f5020d3efc028394b550678273c239daf91406d2b20c071bb4c3568","start":109}],"target_id":"concept.wikipedia.abnormal-grain-growth","target_kind":"node","target_sha256":"f622581ff9badac8cefd26eb0d2fc5881cb3eb5a2e3cc5d664daecd467a8c55d"}],"concept.wikipedia.abrams-law":[{"id":"assertion.concept.wikipedia.abrams-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrams' law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrams' law\", CC BY-SA 4.0) states: Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","support":[{"end":224,"quote":"Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","source_id":"wikipedia.article.abrams-law","source_sha256":"e0d33811f14ccf1d15e365762062f7d725f733d769ba3205234ecda3508be912","start":99}],"target_id":"concept.wikipedia.abrams-law","target_kind":"node","target_sha256":"6e43581e6cf5e60512d9965b1ceecd1078bf883e63d83b08f64e064577bee657"}],"concept.wikipedia.abrasion-mechanical":[{"id":"assertion.concept.wikipedia.abrasion-mechanical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasion (mechanical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasion (mechanical)\", CC BY-SA 4.0) states: Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","support":[{"end":197,"quote":"Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","source_id":"wikipedia.article.abrasion-mechanical","source_sha256":"a962affa37fc8558bdf8176424472dbd86bac194350295dc2cb968aa400fe1af","start":109}],"target_id":"concept.wikipedia.abrasion-mechanical","target_kind":"node","target_sha256":"adf52cdab076a6b3b2cd7b670fc92633c2fe8017d40d3a88fda9a6b71ad9d466"}],"concept.wikipedia.abrasive":[{"id":"assertion.concept.wikipedia.abrasive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive\", CC BY-SA 4.0) states: An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","support":[{"end":263,"quote":"An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","source_id":"wikipedia.article.abrasive","source_sha256":"210fdb2be95457dbf0b2cba63a077a5f0f03666dcd6a3422fb2240e21d0afad9","start":94}],"target_id":"concept.wikipedia.abrasive","target_kind":"node","target_sha256":"6b71df4780e62229891296efeca8159fe902ff663af5657d538efb351a7574f5"}],"concept.wikipedia.abrasive-flow-machining":[{"id":"assertion.concept.wikipedia.abrasive-flow-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive flow machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive flow machining\", CC BY-SA 4.0) states: Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","support":[{"end":308,"quote":"Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","source_id":"wikipedia.article.abrasive-flow-machining","source_sha256":"21a50d8e28ad0b8715b3257f249e3597cb279fcb7036a905a5665fb7ef8a831f","start":110}],"target_id":"concept.wikipedia.abrasive-flow-machining","target_kind":"node","target_sha256":"ec4c152c021fd01acd7469c1db215ed8590c5b13b2b5fca1afb0cb72d6cb9c77"}],"concept.wikipedia.abrasive-machining":[{"id":"assertion.concept.wikipedia.abrasive-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive machining\", CC BY-SA 4.0) states: Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","support":[{"end":237,"quote":"Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","source_id":"wikipedia.article.abrasive-machining","source_sha256":"f324abb8c6d3ec3cc87d11738fa4d372efbd2ea7ad997fffc13e1f4aa9d6febc","start":106}],"target_id":"concept.wikipedia.abrasive-machining","target_kind":"node","target_sha256":"eacfc63d0127815acb54c26d0b27f210c04fdee6a46ebf55d57e1e65c4df30bb"}],"concept.wikipedia.absolute-continuity":[{"id":"assertion.concept.wikipedia.absolute-continuity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute continuity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute continuity\", CC BY-SA 4.0) states: In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","support":[{"end":257,"quote":"In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","source_id":"wikipedia.article.absolute-continuity","source_sha256":"75f9a10f73c2407afd57a4ff32bf4a55875688932ce193e4dad30df306c40dfd","start":105}],"target_id":"concept.wikipedia.absolute-continuity","target_kind":"node","target_sha256":"73e707018cfbdf156fe4fccb02d0678adafd8bbea82723568867487f06952cf8"}],"concept.wikipedia.absolute-neighborhood-retract":[{"id":"assertion.concept.wikipedia.absolute-neighborhood-retract","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute neighborhood retract as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute neighborhood retract\", CC BY-SA 4.0) states: In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \"nice\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","support":[{"end":322,"quote":"In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \\\"nice\\\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","source_id":"wikipedia.article.absolute-neighborhood-retract","source_sha256":"7ec2d346f752e1920071e8a7945833ec780b3b10c21aaa5984879109ec5a0c12","start":117}],"target_id":"concept.wikipedia.absolute-neighborhood-retract","target_kind":"node","target_sha256":"959f44800ce8fbce044f84b7dc82634c16243682590af384ba86b366ff2a5989"}],"concept.wikipedia.absolute-philosophy":[{"id":"assertion.concept.wikipedia.absolute-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute (philosophy)\", CC BY-SA 4.0) states: In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","support":[{"end":286,"quote":"In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","source_id":"wikipedia.article.absolute-philosophy","source_sha256":"5a76d421001827f398252574a1b70fcf90f36ccc6a44c677e3ef9ed8ee8db588","start":109}],"target_id":"concept.wikipedia.absolute-philosophy","target_kind":"node","target_sha256":"6eae5e96a54a985adaa20bc6ea9835e154a0427fa978de483a6ba56510be0b5d"}],"concept.wikipedia.absolute-space-and-time":[{"id":"assertion.concept.wikipedia.absolute-space-and-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute space and time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute space and time\", CC BY-SA 4.0) states: Absolute space and time is a concept in physics and philosophy about the properties of the universe.","support":[{"end":209,"quote":"Absolute space and time is a concept in physics and philosophy about the properties of the universe.","source_id":"wikipedia.article.absolute-space-and-time","source_sha256":"30ea876fffd4fcad265d321e8f140a22be08d2a6e68989b3ad9566213d154b83","start":109}],"target_id":"concept.wikipedia.absolute-space-and-time","target_kind":"node","target_sha256":"93080a90976cdb3e9d38e653da614171f799d3508dc410d8417aae5271c97be1"}],"concept.wikipedia.absolutely-convex-set":[{"id":"assertion.concept.wikipedia.absolutely-convex-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolutely convex set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolutely convex set\", CC BY-SA 4.0) states: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \"circled\" instead of \"balanced\"), in which case it is called a disk.","support":[{"end":338,"quote":"In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \\\"circled\\\" instead of \\\"balanced\\\"), in which case it is called a disk.","source_id":"wikipedia.article.absolutely-convex-set","source_sha256":"a6181464301d29c875f5fe61e7a5748331ee66a019a3242a626e63a3a1a5dfe9","start":108}],"target_id":"concept.wikipedia.absolutely-convex-set","target_kind":"node","target_sha256":"f58762c7d0c5f81ac15be4d561a77803157895e1ab62bd13e428f49f85327f0a"}],"concept.wikipedia.absoluteness-logic":[{"id":"assertion.concept.wikipedia.absoluteness-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absoluteness (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absoluteness (logic)\", CC BY-SA 4.0) states: In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","support":[{"end":282,"quote":"In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","source_id":"wikipedia.article.absoluteness-logic","source_sha256":"f4e3d4954d83f33014460fb3278487e645617832cfbb2a320133692749ef9a84","start":108}],"target_id":"concept.wikipedia.absoluteness-logic","target_kind":"node","target_sha256":"ac28bdc688ebe0f63ba68f5d04794458c79f2b2d1522b762be683710104f38aa"}],"concept.wikipedia.absorption-law":[{"id":"assertion.concept.wikipedia.absorption-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absorption law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absorption law\", CC BY-SA 4.0) states: In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","support":[{"end":205,"quote":"In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","source_id":"wikipedia.article.absorption-law","source_sha256":"69c843b2c17a7f35b690f4efb294366ae121863ea11abea73b1b56059bba8a81","start":100}],"target_id":"concept.wikipedia.absorption-law","target_kind":"node","target_sha256":"1f430375c471c6965510dfdb50da5b878dc1c01d4da41c7b6a9fc56575752bd9"}],"concept.wikipedia.abstract-logic":[{"id":"assertion.concept.wikipedia.abstract-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract logic\", CC BY-SA 4.0) states: In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","support":[{"end":325,"quote":"In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","source_id":"wikipedia.article.abstract-logic","source_sha256":"724220b1e13884cacfe47ee39833efcda7664b6f8b97fc84d11230e27822d0af","start":102}],"target_id":"concept.wikipedia.abstract-logic","target_kind":"node","target_sha256":"3c8ddaa9b605f79442c722a22597d607ae6105dc9e6a9fa44e47ca4ff290aee6"}],"concept.wikipedia.abstract-nonsense":[{"id":"assertion.concept.wikipedia.abstract-nonsense","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract nonsense as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract nonsense\", CC BY-SA 4.0) states: In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","support":[{"end":377,"quote":"In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","source_id":"wikipedia.article.abstract-nonsense","source_sha256":"80f96135e3c581ad2ec622761be127469a5aa1812b74d04918a32937629a675f","start":103}],"target_id":"concept.wikipedia.abstract-nonsense","target_kind":"node","target_sha256":"71778475a1151060f80b81093ba1b3b3b5f9ee0e5622440d8e8fa44accaa229d"}],"concept.wikipedia.abstract-polytope":[{"id":"assertion.concept.wikipedia.abstract-polytope","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract polytope as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract polytope\", CC BY-SA 4.0) states: In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","support":[{"end":333,"quote":"In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","source_id":"wikipedia.article.abstract-polytope","source_sha256":"d22b16d20f7e71cc9243ff7610c4dd7cbdf71b87ff37f8dd95165acc67d4201c","start":104}],"target_id":"concept.wikipedia.abstract-polytope","target_kind":"node","target_sha256":"cb7d110804bb2c3b5a7740200e6bd7dbe439555c26361d4a82d493a93138a3f2"}],"concept.wikipedia.abstract-simplicial-complex":[{"id":"assertion.concept.wikipedia.abstract-simplicial-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract simplicial complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract simplicial complex\", CC BY-SA 4.0) states: In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","support":[{"end":342,"quote":"In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","source_id":"wikipedia.article.abstract-simplicial-complex","source_sha256":"70604d9b279081dc0a67e98d7c557bec9739fd51d50a041877e2df90fe60a4d0","start":113}],"target_id":"concept.wikipedia.abstract-simplicial-complex","target_kind":"node","target_sha256":"f47655a142c719032f977e402cdb2233851a7d6bf3f6768dafbe6db2f238904e"}],"concept.wikipedia.abstract-wiener-space":[{"id":"assertion.concept.wikipedia.abstract-wiener-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract Wiener space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract Wiener space\", CC BY-SA 4.0) states: The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","support":[{"end":286,"quote":"The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","source_id":"wikipedia.article.abstract-wiener-space","source_sha256":"0eddbb8e5788233194a84030ca55b09fedb18de4f6f16fd13ce4e2e0fecffe6d","start":108}],"target_id":"concept.wikipedia.abstract-wiener-space","target_kind":"node","target_sha256":"6c73c5ada69fa5025df00cce07c344958e33d8a1d8308e79a6b44ca9340e8bf1"}],"concept.wikipedia.abstraction":[{"id":"assertion.concept.wikipedia.abstraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstraction\", CC BY-SA 4.0) states: Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","support":[{"end":255,"quote":"Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","source_id":"wikipedia.article.abstraction","source_sha256":"9b664437dc878f7ad8cb5dd84fbb15fb1149c5f57e4986b3c384108a0487f664","start":95}],"target_id":"concept.wikipedia.abstraction","target_kind":"node","target_sha256":"3a42180210f692984dc85e35d286251bd82d5c69b9c0264102924a6a9054e566"}],"concept.wikipedia.abundant-number":[{"id":"assertion.concept.wikipedia.abundant-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abundant number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abundant number\", CC BY-SA 4.0) states: In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","support":[{"end":248,"quote":"In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","source_id":"wikipedia.article.abundant-number","source_sha256":"b4889df159a3ba413cc0ae4228356e0121d4d0314a4e6f5850c46c30e08675b4","start":101}],"target_id":"concept.wikipedia.abundant-number","target_kind":"node","target_sha256":"8f825fe43832c6b9a052e471537451029dc25c868954530f6ac0a3f0fe444b94"}],"concept.wikipedia.abutment":[{"id":"assertion.concept.wikipedia.abutment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abutment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abutment\", CC BY-SA 4.0) states: An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","support":[{"end":193,"quote":"An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","source_id":"wikipedia.article.abutment","source_sha256":"292e2758008de074b8ccb69793c61d4ab36bd044fb1006709f162c0479ee07c2","start":95}],"target_id":"concept.wikipedia.abutment","target_kind":"node","target_sha256":"0fb6f1803b2dda4d37168ef528938a70bfceecbfdcab38db0020c5fa4518d853"}],"concept.wikipedia.ac-dc-receiver-design":[{"id":"assertion.concept.wikipedia.ac-dc-receiver-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"AC/DC receiver design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"AC/DC receiver design\", CC BY-SA 4.0) states: An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","support":[{"end":272,"quote":"An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","source_id":"wikipedia.article.ac-dc-receiver-design","source_sha256":"402018e76f6be7f924bb81dc7b5951a9bf7b3222b8b71265a63eb1308ffbfbc4","start":109}],"target_id":"concept.wikipedia.ac-dc-receiver-design","target_kind":"node","target_sha256":"a331069c735d282cbbaae6415b852edc847a46020bc9329545b95ac9ce539f09"}],"concept.wikipedia.academic-skepticism":[{"id":"assertion.concept.wikipedia.academic-skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Academic skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Academic skepticism\", CC BY-SA 4.0) states: Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","support":[{"end":438,"quote":"Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","source_id":"wikipedia.article.academic-skepticism","source_sha256":"16926f2c3d9e087271bcc8abe506fe5b6d257e4b544a1ac1feb92a673de72a67","start":107}],"target_id":"concept.wikipedia.academic-skepticism","target_kind":"node","target_sha256":"b9e85a28aa23122b4738168896079f5d3b0bfb53acac2e801c3310c24552d29e"}],"concept.wikipedia.access-consciousness":[{"id":"assertion.concept.wikipedia.access-consciousness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Access Consciousness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Access Consciousness\", CC BY-SA 4.0) states: Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","support":[{"end":276,"quote":"Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","source_id":"wikipedia.article.access-consciousness","source_sha256":"03092d288b1d7a707cd79590aaa84792813869135b5e863221882a115bdb3622","start":108}],"target_id":"concept.wikipedia.access-consciousness","target_kind":"node","target_sha256":"892dc74b4cfb7628709a669eca2c9f4e30341e47f959870006bcd7391c234877"}],"concept.wikipedia.accessible-quasi-category":[{"id":"assertion.concept.wikipedia.accessible-quasi-category","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Accessible quasi-category as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Accessible quasi-category\", CC BY-SA 4.0) states: In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","support":[{"end":273,"quote":"In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","source_id":"wikipedia.article.accessible-quasi-category","source_sha256":"fee6c9a0378259b71bb22ca4bd1417c75e8540812965409b3c5f544efc4a99ec","start":113}],"target_id":"concept.wikipedia.accessible-quasi-category","target_kind":"node","target_sha256":"c06c36a5a2c3918a9baae47e0ca4411cabdb5ef014d81efc7ab425d456b7d81d"}],"concept.wikipedia.accident-philosophy":[{"id":"assertion.concept.wikipedia.accident-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Accident (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Accident (philosophy)\", CC BY-SA 4.0) states: An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","support":[{"end":289,"quote":"An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","source_id":"wikipedia.article.accident-philosophy","source_sha256":"a57f74dd53506fc69f86dbe01e34e627feffd553cf8d15ef58f1c821fd7deb75","start":107}],"target_id":"concept.wikipedia.accident-philosophy","target_kind":"node","target_sha256":"9603e58b7f348d1c1acb514122eec348dc29913092a5a1ebb5688575c1f932b0"}],"concept.wikipedia.achilles-number":[{"id":"assertion.concept.wikipedia.achilles-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Achilles number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Achilles number\", CC BY-SA 4.0) states: An Achilles number is a number that is powerful but not a perfect power.","support":[{"end":174,"quote":"An Achilles number is a number that is powerful but not a perfect power.","source_id":"wikipedia.article.achilles-number","source_sha256":"6fa5ac3e10fddd40800b513551ff96ae9ad5ee67f170861bf546f3bb7ef19dc7","start":102}],"target_id":"concept.wikipedia.achilles-number","target_kind":"node","target_sha256":"33caba01b63a722d36cfa68ed7e612b123f33b4f2f201ec60903016e9688adda"}],"concept.wikipedia.acicular-ferrite":[{"id":"assertion.concept.wikipedia.acicular-ferrite","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acicular ferrite as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acicular ferrite\", CC BY-SA 4.0) states: Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","support":[{"end":252,"quote":"Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","source_id":"wikipedia.article.acicular-ferrite","source_sha256":"7ec0bbad157826d2402a19cb98766c29e678930d12cdcf4e82a07bdf6ee9ebbf","start":103}],"target_id":"concept.wikipedia.acicular-ferrite","target_kind":"node","target_sha256":"766003701f3ab742faa713f5b8b3645cbc3ad43653be9d2e94018c6d5a2b07eb"}],"concept.wikipedia.acid-egg":[{"id":"assertion.concept.wikipedia.acid-egg","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acid egg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acid egg\", CC BY-SA 4.0) states: The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","support":[{"end":291,"quote":"The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","source_id":"wikipedia.article.acid-egg","source_sha256":"447c3bd6ff5662e282a027c640caafd10049ee2d5610789c88f8b6e6662dca8b","start":96}],"target_id":"concept.wikipedia.acid-egg","target_kind":"node","target_sha256":"0b9ae700896de2dcd811c4010b155686373b0187ba5fef000c8e8281ec5ff823"}],"concept.wikipedia.acoustic-emission":[{"id":"assertion.concept.wikipedia.acoustic-emission","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic emission as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic emission\", CC BY-SA 4.0) states: Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","support":[{"end":415,"quote":"Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","source_id":"wikipedia.article.acoustic-emission","source_sha256":"757eecc18791a9b74be362f3036692bb495dcc9913b4dbc33989e780d8b49e0d","start":104}],"target_id":"concept.wikipedia.acoustic-emission","target_kind":"node","target_sha256":"d18b3b5121b70783c2ae088b39502c029171b7c8202d2c7990c029a659c13716"}],"concept.wikipedia.acoustic-panel":[{"id":"assertion.concept.wikipedia.acoustic-panel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic panel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic panel\", CC BY-SA 4.0) states: Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","support":[{"end":279,"quote":"Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","source_id":"wikipedia.article.acoustic-panel","source_sha256":"8e3c1118a850f0584204302d518a41c0e50fe37bc16bd4f8a723047858d40f9e","start":102}],"target_id":"concept.wikipedia.acoustic-panel","target_kind":"node","target_sha256":"82393dc6425b64b28290d51db3f1bdf65e96366269d9d42c37c5034e41e4c0b2"}],"concept.wikipedia.acoustic-pod":[{"id":"assertion.concept.wikipedia.acoustic-pod","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic pod as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic pod\", CC BY-SA 4.0) states: An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","support":[{"end":265,"quote":"An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","source_id":"wikipedia.article.acoustic-pod","source_sha256":"42762eb77d11e0721cf311497488dcdf15df274667502fc639b432c68c137ad5","start":100}],"target_id":"concept.wikipedia.acoustic-pod","target_kind":"node","target_sha256":"765816af58756d84e95108dcc5963d2a5582f3cc32391f37aaae4ec3f3c854e2"}],"concept.wikipedia.acoustic-transmission":[{"id":"assertion.concept.wikipedia.acoustic-transmission","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic transmission as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic transmission\", CC BY-SA 4.0) states: Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","support":[{"end":236,"quote":"Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","source_id":"wikipedia.article.acoustic-transmission","source_sha256":"e42d4c089db61536a5860fcbf66379aebdd5f56643cb1d05a6c3dba53fadb0bb","start":108}],"target_id":"concept.wikipedia.acoustic-transmission","target_kind":"node","target_sha256":"ca6c0b864413a2eb3a024149a34b375d2a2d096a174aa1d055b29a8740938d26"}],"concept.wikipedia.action-angle-coordinates":[{"id":"assertion.concept.wikipedia.action-angle-coordinates","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action-angle coordinates as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action-angle coordinates\", CC BY-SA 4.0) states: In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","support":[{"end":364,"quote":"In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","source_id":"wikipedia.article.action-angle-coordinates","source_sha256":"5c313dd174ae0498c1d54da471f47aee11fcb81fdceb187ba8ad16240375180e","start":111}],"target_id":"concept.wikipedia.action-angle-coordinates","target_kind":"node","target_sha256":"0416ccb331cafd6b88e5f17d5ed33f0a3d8f75e3005d9d0cdbeb9a74bcfc5f36"}],"concept.wikipedia.action-bias":[{"id":"assertion.concept.wikipedia.action-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action bias\", CC BY-SA 4.0) states: Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","support":[{"end":275,"quote":"Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","source_id":"wikipedia.article.action-bias","source_sha256":"b13a8543712bbd7811955dc3670f7ff2a888f61e54c4716248e84ec75ba8d29b","start":99}],"target_id":"concept.wikipedia.action-bias","target_kind":"node","target_sha256":"b70fc531d5231e654f3565d6881da26f53fa866cee61bbb2221c1ff63c711481"}],"concept.wikipedia.action-theory-philosophy":[{"id":"assertion.concept.wikipedia.action-theory-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action theory (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action theory (philosophy)\", CC BY-SA 4.0) states: Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","support":[{"end":284,"quote":"Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","source_id":"wikipedia.article.action-theory-philosophy","source_sha256":"cc39ef5411ea1e51442bc08eaa6e763c3a5616e5c7bf5e0133bde54f492a4ee9","start":111}],"target_id":"concept.wikipedia.action-theory-philosophy","target_kind":"node","target_sha256":"76413584af2a2208b5bf382f0be3b47d3898dbe1b60e9589f1acd6a185be3b92"}],"concept.wikipedia.action-type-approach":[{"id":"assertion.concept.wikipedia.action-type-approach","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action type approach as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action type approach\", CC BY-SA 4.0) states: The action type approach is a series of mental exercises—variously described as \"pseudoscientific\", \"empirically challenged\", or a \"neuromyth\"— that purport to increase physical performance in athletes.","support":[{"end":316,"quote":"The action type approach is a series of mental exercises—variously described as \\\"pseudoscientific\\\", \\\"empirically challenged\\\", or a \\\"neuromyth\\\"— that purport to increase physical performance in athletes.","source_id":"wikipedia.article.action-type-approach","source_sha256":"b5ed70b206254ac3627178b1c790ccc77ddc08d3a8b30c961f35de955530422a","start":108}],"target_id":"concept.wikipedia.action-type-approach","target_kind":"node","target_sha256":"8dba3e93170d1a4d16d75065fb768f0e2d6eee61dea170ad22ae9a8629217e4e"}],"concept.wikipedia.activated-sludge":[{"id":"assertion.concept.wikipedia.activated-sludge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Activated sludge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Activated sludge\", CC BY-SA 4.0) states: The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","support":[{"end":302,"quote":"The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","source_id":"wikipedia.article.activated-sludge","source_sha256":"c8bd71585211f67342b627c8d057a94f10fe156e3d16b65a17199db51ad2ada1","start":103}],"target_id":"concept.wikipedia.activated-sludge","target_kind":"node","target_sha256":"783c46121523bcc49ac2ab9bb4d5f917cdcf22a4134397f6b6d879b967391726"}],"concept.wikipedia.active-circulator":[{"id":"assertion.concept.wikipedia.active-circulator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active circulator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active circulator\", CC BY-SA 4.0) states: In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","support":[{"end":307,"quote":"In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","source_id":"wikipedia.article.active-circulator","source_sha256":"69941056f9bc168078df97b184c78c1eec52f7443649de3c678a4ba6355254c0","start":105}],"target_id":"concept.wikipedia.active-circulator","target_kind":"node","target_sha256":"56eb005265f2131be369ce424b99743d0dfd62ec34c085d66f9ce7a20b2388c2"}],"concept.wikipedia.active-disturbance-rejection-control":[{"id":"assertion.concept.wikipedia.active-disturbance-rejection-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active disturbance rejection control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active disturbance rejection control\", CC BY-SA 4.0) states: Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","support":[{"end":351,"quote":"Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","source_id":"wikipedia.article.active-disturbance-rejection-control","source_sha256":"4df4c2fe0b771d1a7652153675966270b5400f3b5d6a88aba6f5ff5047790fc9","start":124}],"target_id":"concept.wikipedia.active-disturbance-rejection-control","target_kind":"node","target_sha256":"ed55cc126cd7a32e6f3d5796c3737e7bbcda65de0a8b09ad027bde91794efff3"}],"concept.wikipedia.active-intellect":[{"id":"assertion.concept.wikipedia.active-intellect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active intellect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active intellect\", CC BY-SA 4.0) states: In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","support":[{"end":380,"quote":"In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","source_id":"wikipedia.article.active-intellect","source_sha256":"3435e519189be67bffce54c966f0013d99da2b0bccd3b4b8f0883c218b2510a2","start":103}],"target_id":"concept.wikipedia.active-intellect","target_kind":"node","target_sha256":"946a41df6e6993861f45b13334ac020990393b6d24249e16250b3844f657e251"}],"concept.wikipedia.active-power-filter":[{"id":"assertion.concept.wikipedia.active-power-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active power filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active power filter\", CC BY-SA 4.0) states: Active power filters (APF) are filters, which can perform the job of harmonic elimination.","support":[{"end":197,"quote":"Active power filters (APF) are filters, which can perform the job of harmonic elimination.","source_id":"wikipedia.article.active-power-filter","source_sha256":"42106cddd8e2110e4ce2459c84ffd1c779cc679aed93c22bf10a81e1d52778a3","start":107}],"target_id":"concept.wikipedia.active-power-filter","target_kind":"node","target_sha256":"c5e5f992f7544ce77abc292840be39fd3b4e0a53f3bc6f943559be13393771fe"}],"concept.wikipedia.active-redundancy":[{"id":"assertion.concept.wikipedia.active-redundancy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active redundancy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active redundancy\", CC BY-SA 4.0) states: Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","support":[{"end":263,"quote":"Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","source_id":"wikipedia.article.active-redundancy","source_sha256":"45368fcccbcbf45cf68d0207e7031b5a5eba3b94d93cd8b9a5c84133b80d40d3","start":105}],"target_id":"concept.wikipedia.active-redundancy","target_kind":"node","target_sha256":"11eae07843062b0dfade6baf9b4e4b7b42e4e96d340f350d7afe61e2e7ad0f63"}],"concept.wikipedia.active-thermography":[{"id":"assertion.concept.wikipedia.active-thermography","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active thermography as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active thermography\", CC BY-SA 4.0) states: Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","support":[{"end":283,"quote":"Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","source_id":"wikipedia.article.active-thermography","source_sha256":"1f1a1aeb6059ef94a89f54e6babcb68474209fb253e70812287018a62eaa5afc","start":107}],"target_id":"concept.wikipedia.active-thermography","target_kind":"node","target_sha256":"1e04666bcdc01a9dd2c27894a6c7ef7e0fd2168b2ed63f5ede1017a79433d522"}],"concept.wikipedia.actor-network-theory":[{"id":"assertion.concept.wikipedia.actor-network-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actor–network theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actor–network theory\", CC BY-SA 4.0) states: Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","support":[{"end":301,"quote":"Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","source_id":"wikipedia.article.actor-network-theory","source_sha256":"c2001ca0e9fef493d1032328c59362bc86c66a64908a3c88dda8598cde2b3adb","start":106}],"target_id":"concept.wikipedia.actor-network-theory","target_kind":"node","target_sha256":"7fa18c148460d7ab8ecb998a8a75231eb3c150c480b098a69077b47277f6e20d"}],"concept.wikipedia.actor-observer-asymmetry":[{"id":"assertion.concept.wikipedia.actor-observer-asymmetry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actor–observer asymmetry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actor–observer asymmetry\", CC BY-SA 4.0) states: Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","support":[{"end":283,"quote":"Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","source_id":"wikipedia.article.actor-observer-asymmetry","source_sha256":"17bc4e4877ff5470e5767a89a338555799e1eb0df8cdd5d61ed50e648ada2d1c","start":110}],"target_id":"concept.wikipedia.actor-observer-asymmetry","target_kind":"node","target_sha256":"316cb677849d51de72c960dab37c5d32f844546ae5021832c499dce58ecdb439"}],"concept.wikipedia.actuator":[{"id":"assertion.concept.wikipedia.actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actuator\", CC BY-SA 4.0) states: An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","support":[{"end":288,"quote":"An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","source_id":"wikipedia.article.actuator","source_sha256":"f5c683e3fa31c0f5b0e8bf50eb11996c96f982fe69734388639581ef3eb5935e","start":94}],"target_id":"concept.wikipedia.actuator","target_kind":"node","target_sha256":"20b001fb154474651e9bb91f4452648f082c9f5fb544ddca99c48fdb82a0521d"}],"concept.wikipedia.acyclic-model":[{"id":"assertion.concept.wikipedia.acyclic-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acyclic model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acyclic model\", CC BY-SA 4.0) states: In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","support":[{"end":246,"quote":"In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","source_id":"wikipedia.article.acyclic-model","source_sha256":"189c025aad7bd0a098cd72f1915183d3fd3be087a89b69cce94fa67b56e5bfd3","start":101}],"target_id":"concept.wikipedia.acyclic-model","target_kind":"node","target_sha256":"eb41cf6f7a7cb46002783bbf767c75ccfa85f8eebb913e6dd39a8bb709f1b572"}],"concept.wikipedia.ad-hoc-hypothesis":[{"id":"assertion.concept.wikipedia.ad-hoc-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ad hoc hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ad hoc hypothesis\", CC BY-SA 4.0) states: In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","support":[{"end":226,"quote":"In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","source_id":"wikipedia.article.ad-hoc-hypothesis","source_sha256":"9c0c878c5ae13857bf7e16086f120d030919a81ef1351b5af1ba14ceffab5c11","start":103}],"target_id":"concept.wikipedia.ad-hoc-hypothesis","target_kind":"node","target_sha256":"0f678a6cf92c608314ef53a8e70ef882815f2c085be30508445ec50b39115d38"}],"concept.wikipedia.ad-personam":[{"id":"assertion.concept.wikipedia.ad-personam","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ad personam as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ad personam\", CC BY-SA 4.0) states: In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","support":[{"end":284,"quote":"In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","source_id":"wikipedia.article.ad-personam","source_sha256":"691b83b9ef09a396af769396798dafac86178772d8f34a56402b85b7b07b77b8","start":99}],"target_id":"concept.wikipedia.ad-personam","target_kind":"node","target_sha256":"52fcbeb3a4d9dc5cf088dfcfd9c202d21438abb85e49a187da184838b95a9803"}],"concept.wikipedia.adapter":[{"id":"assertion.concept.wikipedia.adapter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adapter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adapter\", CC BY-SA 4.0) states: An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","support":[{"end":242,"quote":"An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","source_id":"wikipedia.article.adapter","source_sha256":"e30fc4b240f4ad493b6b08f2cf12b09583d402c59700ebffacddc988efc41d69","start":93}],"target_id":"concept.wikipedia.adapter","target_kind":"node","target_sha256":"23e443ac5e097a3395f24ce126aa6fc7364062ccee2050f9abb7525a4426b72e"}],"concept.wikipedia.adaptive-beamformer":[{"id":"assertion.concept.wikipedia.adaptive-beamformer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive beamformer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive beamformer\", CC BY-SA 4.0) states: An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","support":[{"end":233,"quote":"An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","source_id":"wikipedia.article.adaptive-beamformer","source_sha256":"78d8758efd878dc7a1afc59191b0af528e4f415e6e561de3abaa9d26ea8ffa11","start":106}],"target_id":"concept.wikipedia.adaptive-beamformer","target_kind":"node","target_sha256":"e3af768b3ef30a76201b280977c2ee0eb8e5d07fa1dc018390f25c445a36505a"}],"concept.wikipedia.adaptive-bias":[{"id":"assertion.concept.wikipedia.adaptive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive bias\", CC BY-SA 4.0) states: Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","support":[{"end":455,"quote":"Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","source_id":"wikipedia.article.adaptive-bias","source_sha256":"0b457a2a4702374924182b9e4c2b29b1be74e1691860dafdfc34b82a11478e18","start":100}],"target_id":"concept.wikipedia.adaptive-bias","target_kind":"node","target_sha256":"82f0623f0a7bc3da554cdb408d4702b1c894f2b9572c94a87dab2230f0533bf0"}],"concept.wikipedia.adaptive-control":[{"id":"assertion.concept.wikipedia.adaptive-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive control\", CC BY-SA 4.0) states: Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","support":[{"end":258,"quote":"Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","source_id":"wikipedia.article.adaptive-control","source_sha256":"7c6af0b2a9f82456a445362f7d8415f0aa7cb144631e284ab7fa449a23f266d8","start":103}],"target_id":"concept.wikipedia.adaptive-control","target_kind":"node","target_sha256":"941a31e164ff3a171b7cb402b833c4de02802b6f1e07378eb8fd379db750d3f9"}],"concept.wikipedia.adaptive-reasoning":[{"id":"assertion.concept.wikipedia.adaptive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive reasoning\", CC BY-SA 4.0) states: Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","support":[{"end":230,"quote":"Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","source_id":"wikipedia.article.adaptive-reasoning","source_sha256":"4fbe9d1956d2691a4a487d7c988db9523bc9db6a0d3ad2c1e30e839074b3eae7","start":106}],"target_id":"concept.wikipedia.adaptive-reasoning","target_kind":"node","target_sha256":"5f8ac378dd90e581aabd25f7eb32737ffc2c3de0004ae6cc95c42ec720f59d27"}],"concept.wikipedia.adaptive-step-size":[{"id":"assertion.concept.wikipedia.adaptive-step-size","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive step size as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive step size\", CC BY-SA 4.0) states: In mathematics and numerical analysis, an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","support":[{"end":407,"quote":"In mathematics and numerical analysis,  an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","source_id":"wikipedia.article.adaptive-step-size","source_sha256":"4a0eb49691462b5d1a2a7e0b181672acd2541f6ebd8b34dcc5927bd680b5df36","start":105}],"target_id":"concept.wikipedia.adaptive-step-size","target_kind":"node","target_sha256":"0a5db7e309208034325c18f7ec6ca38cb9db274eccb70cb8f570829ff7343ad8"}],"concept.wikipedia.addition-principle":[{"id":"assertion.concept.wikipedia.addition-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Addition principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Addition principle\", CC BY-SA 4.0) states: In combinatorics, the addition principle or rule of sum is a basic counting principle.","support":[{"end":191,"quote":"In combinatorics, the addition principle or rule of sum is a basic counting principle.","source_id":"wikipedia.article.addition-principle","source_sha256":"49f87650a215a30a78d3d38a2be82d94d1698d597d706e64d878bef62eadf8b5","start":105}],"target_id":"concept.wikipedia.addition-principle","target_kind":"node","target_sha256":"4425af0537c2cbc72caeabc770bbacc5cd4d21c3dff2f4e5b05a9cabd28ebb0f"}],"concept.wikipedia.additive-bias":[{"id":"assertion.concept.wikipedia.additive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive bias\", CC BY-SA 4.0) states: Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","support":[{"end":229,"quote":"Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","source_id":"wikipedia.article.additive-bias","source_sha256":"aafe2d80a2a5d23f6ec19a2ce1e5bc80d45e7dd901e63fea02e63972eec0d770","start":101}],"target_id":"concept.wikipedia.additive-bias","target_kind":"node","target_sha256":"02a62ed9a24bee8e3494f9a6f45b7efc2912bdd3b4794ba613a865e6b6e8f028"}],"concept.wikipedia.additive-group":[{"id":"assertion.concept.wikipedia.additive-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive group\", CC BY-SA 4.0) states: An additive group is a group of which the group operation is to be thought of as addition in some sense.","support":[{"end":204,"quote":"An additive group is a group of which the group operation is to be thought of as addition in some sense.","source_id":"wikipedia.article.additive-group","source_sha256":"f983761671412e07352f97fb7b702bcb963609a8c436376aa6419330430e4697","start":100}],"target_id":"concept.wikipedia.additive-group","target_kind":"node","target_sha256":"bdf580db9a810a605315a36de0689b8bf48b8657b17edb3cb84649a7c583be97"}],"concept.wikipedia.additive-identity":[{"id":"assertion.concept.wikipedia.additive-identity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive identity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive identity\", CC BY-SA 4.0) states: In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","support":[{"end":478,"quote":"In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","source_id":"wikipedia.article.additive-identity","source_sha256":"47ea78ac38fc1d0b38c692fc4c8f40468681d8a6894f140ce5da4392a65c1fd0","start":104}],"target_id":"concept.wikipedia.additive-identity","target_kind":"node","target_sha256":"d3677d4eaffdb3a06b9b1de1e944ffe8fdb93fe3009118b46b8b823a5de5aab4"}],"concept.wikipedia.additive-inverse":[{"id":"assertion.concept.wikipedia.additive-inverse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive inverse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive inverse\", CC BY-SA 4.0) states: In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","support":[{"end":234,"quote":"In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","source_id":"wikipedia.article.additive-inverse","source_sha256":"717443da068476877d7cff7d9c8edf3051f9c869e5b81320e60892e1e6f614e0","start":102}],"target_id":"concept.wikipedia.additive-inverse","target_kind":"node","target_sha256":"4cdc4d05915e0633a5f0d9faf6324253543abb35806149fd093ca820e2b9b0f3"}],"concept.wikipedia.additive-polynomial":[{"id":"assertion.concept.wikipedia.additive-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive polynomial\", CC BY-SA 4.0) states: In mathematics, the additive polynomials are an important topic in classical algebraic number theory.","support":[{"end":208,"quote":"In mathematics, the additive polynomials are an important topic in  classical algebraic number theory.","source_id":"wikipedia.article.additive-polynomial","source_sha256":"3f82c7a0d032f2fc6a172a7c6a890d2d197bbf65b67776b3a2f78d95951a090d","start":106}],"target_id":"concept.wikipedia.additive-polynomial","target_kind":"node","target_sha256":"73168a969bc49a2e471a2169442c3d8b95400eecfcc2aaa1e39438d5f2a3c624"}],"concept.wikipedia.additive-process":[{"id":"assertion.concept.wikipedia.additive-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive process\", CC BY-SA 4.0) states: An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","support":[{"end":234,"quote":"An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","source_id":"wikipedia.article.additive-process","source_sha256":"9b8be245b1f26d097ef034d4aaff16263194d00c65152a98802db6b32df1918c","start":104}],"target_id":"concept.wikipedia.additive-process","target_kind":"node","target_sha256":"102c566cf1109bca311d990c81bf5cd2977bc4a124df813a86b5625aa12f9c2b"}],"concept.wikipedia.addressed-fiber-bragg-structure":[{"id":"assertion.concept.wikipedia.addressed-fiber-bragg-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Addressed fiber Bragg structure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Addressed fiber Bragg structure\", CC BY-SA 4.0) states: An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","support":[{"end":387,"quote":"An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","source_id":"wikipedia.article.addressed-fiber-bragg-structure","source_sha256":"9dda4740b48eda85ee35f95cbbf80633f46de6b047ce004bff7cc185b5cb9b5b","start":119}],"target_id":"concept.wikipedia.addressed-fiber-bragg-structure","target_kind":"node","target_sha256":"636ae332dcff2eba9c8ae579b262775482006d0307a8dcee00de8ae532026df6"}],"concept.wikipedia.ade-classification":[{"id":"assertion.concept.wikipedia.ade-classification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ADE classification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ADE classification\", CC BY-SA 4.0) states: In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","support":[{"end":280,"quote":"In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","source_id":"wikipedia.article.ade-classification","source_sha256":"a80a980f540b2565d763fa482523a2ee47ab568939207135fd8d2341287bb7f5","start":104}],"target_id":"concept.wikipedia.ade-classification","target_kind":"node","target_sha256":"91826431ec14c578e87936cb8b7c51e2b1cc5d6dbbceb3627d7bc12eb2d7c94b"}],"concept.wikipedia.adjoint-representation":[{"id":"assertion.concept.wikipedia.adjoint-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjoint representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjoint representation\", CC BY-SA 4.0) states: In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","support":[{"end":322,"quote":"In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","source_id":"wikipedia.article.adjoint-representation","source_sha256":"55c34f4fd658dd5789d8830a120aac8c503e89653939c8e9e0017eb8b891433e","start":108}],"target_id":"concept.wikipedia.adjoint-representation","target_kind":"node","target_sha256":"8cae9ca47343e001a8feaf2b9c4b5dd7a0b99670874799f6e919d611ad4ff484"}],"concept.wikipedia.adjoint-state-method":[{"id":"assertion.concept.wikipedia.adjoint-state-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjoint state method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjoint state method\", CC BY-SA 4.0) states: The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","support":[{"end":256,"quote":"The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","source_id":"wikipedia.article.adjoint-state-method","source_sha256":"7a19989ff31dc098cec68aa865ff63689d4d6e07fcea349754d5c80a2db0a790","start":108}],"target_id":"concept.wikipedia.adjoint-state-method","target_kind":"node","target_sha256":"7d855e5835dfaaa7870e38d710d557690f1e39b13fddde987ba422c3ab4899b9"}],"concept.wikipedia.adjugate-matrix":[{"id":"assertion.concept.wikipedia.adjugate-matrix","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjugate matrix as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjugate matrix\", CC BY-SA 4.0) states: In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","support":[{"end":222,"quote":"In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","source_id":"wikipedia.article.adjugate-matrix","source_sha256":"ec75fe40c8cf3c945c4b5f5abed23fc031d7716bd14f95fefc9190cda0190e30","start":101}],"target_id":"concept.wikipedia.adjugate-matrix","target_kind":"node","target_sha256":"48cc09fe45c4d5b7366b5dfd12d93633b9193dba89dcd2abfbf34ac6064dc9bb"}],"concept.wikipedia.adjustable-pressure-limiting-valve":[{"id":"assertion.concept.wikipedia.adjustable-pressure-limiting-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjustable pressure-limiting valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjustable pressure-limiting valve\", CC BY-SA 4.0) states: An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","support":[{"end":356,"quote":"An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","source_id":"wikipedia.article.adjustable-pressure-limiting-valve","source_sha256":"849b78c105a8efbfb451361a7a7a56147249fb37ebbae1a8bbb5fa05055c0d4d","start":122}],"target_id":"concept.wikipedia.adjustable-pressure-limiting-valve","target_kind":"node","target_sha256":"4e89c0affeeda8cfdd3f88d8f953d2961e091937d1e42c8b3447be9e603fcef6"}],"concept.wikipedia.admissible-heuristic":[{"id":"assertion.concept.wikipedia.admissible-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible heuristic\", CC BY-SA 4.0) states: In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","support":[{"end":407,"quote":"In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","source_id":"wikipedia.article.admissible-heuristic","source_sha256":"9812a9f113568ae4a6ef159ec4417c22d6537278b526ca4ca482e1066389b8a1","start":108}],"target_id":"concept.wikipedia.admissible-heuristic","target_kind":"node","target_sha256":"6d1ab894ac96be0385443030f3c8f6f6bbd888b14644f7a9b91f5c745610e8bd"}],"concept.wikipedia.admissible-numbering":[{"id":"assertion.concept.wikipedia.admissible-numbering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible numbering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible numbering\", CC BY-SA 4.0) states: In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","support":[{"end":316,"quote":"In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","source_id":"wikipedia.article.admissible-numbering","source_sha256":"06905f1e9510de0db491252d03715e0b0bf65dfb2bbcca3876f0b4b2d79516f7","start":107}],"target_id":"concept.wikipedia.admissible-numbering","target_kind":"node","target_sha256":"995bc869bfacbfd1beef68a6d5821b3b395c983c1f4737df17faeaf241195540"}],"concept.wikipedia.admissible-representation":[{"id":"assertion.concept.wikipedia.admissible-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible representation\", CC BY-SA 4.0) states: In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","support":[{"end":306,"quote":"In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","source_id":"wikipedia.article.admissible-representation","source_sha256":"0378ec8b844a15003715a134757def24c925e4c0edb1fc023b8b05b37e7dc2f2","start":113}],"target_id":"concept.wikipedia.admissible-representation","target_kind":"node","target_sha256":"c99b3c638614771260322e1a747f3cab497ff138e1ff877f086d8e53b06b66f4"}],"concept.wikipedia.adomian-decomposition-method":[{"id":"assertion.concept.wikipedia.adomian-decomposition-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adomian decomposition method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adomian decomposition method\", CC BY-SA 4.0) states: The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","support":[{"end":248,"quote":"The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","source_id":"wikipedia.article.adomian-decomposition-method","source_sha256":"dbac44382d871c5f7351afecdd56c662cfbd351f21f990892e918aa61caa6992","start":115}],"target_id":"concept.wikipedia.adomian-decomposition-method","target_kind":"node","target_sha256":"583d2451453a339cb6adc24f856ab8ed47f43131888f41deeb23bbe1dcdd65cd"}],"concept.wikipedia.adsorption-bio-oxidation-process":[{"id":"assertion.concept.wikipedia.adsorption-bio-oxidation-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adsorption/bio-oxidation process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adsorption/bio-oxidation process\", CC BY-SA 4.0) states: The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","support":[{"end":246,"quote":"The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","source_id":"wikipedia.article.adsorption-bio-oxidation-process","source_sha256":"3b7720d5925430b8cd91988fc8b1e3f773d2a51b02d0be823efa8ad8a69b9481","start":120}],"target_id":"concept.wikipedia.adsorption-bio-oxidation-process","target_kind":"node","target_sha256":"7df12d610180b677016f4d2775dd186b5372213636e5a7746435db976abefa6f"}],"concept.wikipedia.advance-ratio":[{"id":"assertion.concept.wikipedia.advance-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advance ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advance ratio\", CC BY-SA 4.0) states: The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","support":[{"end":376,"quote":"The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","source_id":"wikipedia.article.advance-ratio","source_sha256":"847132488d8bee07249c966ee8930137d0d60f731c73a49ab9b2dc63ab7be678","start":101}],"target_id":"concept.wikipedia.advance-ratio","target_kind":"node","target_sha256":"cbbac952bd1b1d02946cfc5cafa64630886b76805d13e105d0e951ccdd9647a4"}],"concept.wikipedia.advanced-composite-materials-engineering":[{"id":"assertion.concept.wikipedia.advanced-composite-materials-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced composite materials (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced composite materials (engineering)\", CC BY-SA 4.0) states: In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","support":[{"end":411,"quote":"In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","source_id":"wikipedia.article.advanced-composite-materials-engineering","source_sha256":"8d14252f4be02b8677b5fa452fd593c9dd400db7770a5d0889f3b77f8d3eca22","start":130}],"target_id":"concept.wikipedia.advanced-composite-materials-engineering","target_kind":"node","target_sha256":"3c39be3ceae65d906562c10404b764a8f923d0efa545c555bd6d82590eb65f3d"}],"concept.wikipedia.advanced-multi-mission-operations-system":[{"id":"assertion.concept.wikipedia.advanced-multi-mission-operations-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced multi-mission operations system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced multi-mission operations system\", CC BY-SA 4.0) states: The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","support":[{"end":354,"quote":"The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","source_id":"wikipedia.article.advanced-multi-mission-operations-system","source_sha256":"8b505c433253fa6d6bc1222409db090eab17fd2e737d27565729ed74e9e203a4","start":126}],"target_id":"concept.wikipedia.advanced-multi-mission-operations-system","target_kind":"node","target_sha256":"a9c24f046d9e155a67273e47ee02893e3a0211100e924aa85880fcb140aa01a9"}],"concept.wikipedia.advanced-oxidation-process":[{"id":"assertion.concept.wikipedia.advanced-oxidation-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced oxidation process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced oxidation process\", CC BY-SA 4.0) states: Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","support":[{"end":359,"quote":"Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","source_id":"wikipedia.article.advanced-oxidation-process","source_sha256":"481e0a87463fdd6606635184a87c67889085d29c499270df84d466af40dd9eb9","start":114}],"target_id":"concept.wikipedia.advanced-oxidation-process","target_kind":"node","target_sha256":"bc55cf9c5efbe9151710d97370dca92cafff42a90a3026db13a7d6bdc3f7c6ee"}],"concept.wikipedia.advanced-process-control":[{"id":"assertion.concept.wikipedia.advanced-process-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced process control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced process control\", CC BY-SA 4.0) states: In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","support":[{"end":270,"quote":"In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","source_id":"wikipedia.article.advanced-process-control","source_sha256":"a56fbcd3798b5601f5f3eca186c8670597e970d39e73f2895bb4fb0f74275c79","start":111}],"target_id":"concept.wikipedia.advanced-process-control","target_kind":"node","target_sha256":"7912f2b77981c92b25e549803e149fbd30a500a77ce421529dbdd33619f5d529"}],"concept.wikipedia.advanced-stirling-radioisotope-generator":[{"id":"assertion.concept.wikipedia.advanced-stirling-radioisotope-generator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced Stirling radioisotope generator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced Stirling radioisotope generator\", CC BY-SA 4.0) states: The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","support":[{"end":259,"quote":"The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","source_id":"wikipedia.article.advanced-stirling-radioisotope-generator","source_sha256":"d4fa3eef460bf0942e4b6ca5e61d34ad1cc69630bc2a5db9b8f3616484bfd4f4","start":128}],"target_id":"concept.wikipedia.advanced-stirling-radioisotope-generator","target_kind":"node","target_sha256":"d83dbe63dcdd4aba5e9147a3d210fd3d0d5c32fe5f0e874149c7a14fac863054"}],"concept.wikipedia.adverse-inference":[{"id":"assertion.concept.wikipedia.adverse-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adverse inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adverse inference\", CC BY-SA 4.0) states: Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","support":[{"end":229,"quote":"Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","source_id":"wikipedia.article.adverse-inference","source_sha256":"490253a01c7e24e9dad7e4984ff79c6eb319bb9c2654d2ed7c58b19376c01c1e","start":105}],"target_id":"concept.wikipedia.adverse-inference","target_kind":"node","target_sha256":"2ead7d2773f3a0a0f559ebd6ab3e008f9c31386fc4ca1f3197a84e339e5dd4c2"}],"concept.wikipedia.aerial-manned-unmanned-teaming":[{"id":"assertion.concept.wikipedia.aerial-manned-unmanned-teaming","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerial manned-unmanned teaming as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerial manned-unmanned teaming\", CC BY-SA 4.0) states: Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","support":[{"end":252,"quote":"Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","source_id":"wikipedia.article.aerial-manned-unmanned-teaming","source_sha256":"169561b69f8607d2ad1b4640c94148e2f269abe1bbe77cfe7aa0ac21181e0746","start":118}],"target_id":"concept.wikipedia.aerial-manned-unmanned-teaming","target_kind":"node","target_sha256":"4ceab3fbe7b283caa3cf7b806cfd6e8e958d6d975784b32fc630138b12d7c498"}],"concept.wikipedia.aerobic-granular-reactor":[{"id":"assertion.concept.wikipedia.aerobic-granular-reactor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerobic granular reactor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerobic granular reactor\", CC BY-SA 4.0) states: Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","support":[{"end":342,"quote":"Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","source_id":"wikipedia.article.aerobic-granular-reactor","source_sha256":"e4f724c8d68700848530c6a73d31ccc5402b7937ea51c9d695ab40d15f4baf21","start":111}],"target_id":"concept.wikipedia.aerobic-granular-reactor","target_kind":"node","target_sha256":"2cfa8e7f5fedc3c47f5ce2f82052efbef2898373767ff6978775683160e3f814"}],"concept.wikipedia.aerobic-granulation":[{"id":"assertion.concept.wikipedia.aerobic-granulation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerobic granulation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerobic granulation\", CC BY-SA 4.0) states: The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","support":[{"end":242,"quote":"The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","source_id":"wikipedia.article.aerobic-granulation","source_sha256":"d0e404e4da9f06d716b77ad3dd9fa6e988d0ffa4bc285e9e2d0184dce62baa3b","start":107}],"target_id":"concept.wikipedia.aerobic-granulation","target_kind":"node","target_sha256":"a7f5a095e89f389b94b88bb2109f0aaee19e955cebd6ad765f3c7a3be1f85dd3"}],"concept.wikipedia.aerodynamic-center":[{"id":"assertion.concept.wikipedia.aerodynamic-center","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerodynamic center as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerodynamic center\", CC BY-SA 4.0) states: In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","support":[{"end":410,"quote":"In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","source_id":"wikipedia.article.aerodynamic-center","source_sha256":"a6cd2b579b47b52379815df4847cdf88db03bc8b6017c027213e0f425970a46c","start":105}],"target_id":"concept.wikipedia.aerodynamic-center","target_kind":"node","target_sha256":"a4d3b2b5b2c867e49d28553356157e71d32e4def55998277ef7975b1f5b36ede"}],"concept.wikipedia.aeroelasticity":[{"id":"assertion.concept.wikipedia.aeroelasticity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aeroelasticity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aeroelasticity\", CC BY-SA 4.0) states: Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","support":[{"end":294,"quote":"Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","source_id":"wikipedia.article.aeroelasticity","source_sha256":"612b14d53b21b7bb6ddf1f762c722e3b20140bafe811dcdab25e521cd7eec5c0","start":99}],"target_id":"concept.wikipedia.aeroelasticity","target_kind":"node","target_sha256":"440c5bd6b237d17cae1c8fe5d20788ae246442e3c2c97e9b4bacf0dbd4d96066"}],"concept.wikipedia.aerospace-architecture":[{"id":"assertion.concept.wikipedia.aerospace-architecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace architecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace architecture\", CC BY-SA 4.0) states: Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","support":[{"end":319,"quote":"Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","source_id":"wikipedia.article.aerospace-architecture","source_sha256":"cec43433b8d663b3f7127f4256d9f7616a4b819ab48fc6d85421ea2c27f9e068","start":109}],"target_id":"concept.wikipedia.aerospace-architecture","target_kind":"node","target_sha256":"0566d7e8255327cf6cccafe0e920a1b0bd8efff42d19dabcc3ce351233f5eb44"}],"concept.wikipedia.aerospace-bearing":[{"id":"assertion.concept.wikipedia.aerospace-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace bearing\", CC BY-SA 4.0) states: Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","support":[{"end":248,"quote":"Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","source_id":"wikipedia.article.aerospace-bearing","source_sha256":"f43de874dcb1e14c37b23a51009ea10410d1954c6ddc17ef5e24ff4d474b81f4","start":105}],"target_id":"concept.wikipedia.aerospace-bearing","target_kind":"node","target_sha256":"106651f180673d090fbe35080a802412fcd10b4e0120a2178106e2c57e966891"}],"concept.wikipedia.aerospace-materials":[{"id":"assertion.concept.wikipedia.aerospace-materials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace materials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace materials\", CC BY-SA 4.0) states: Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","support":[{"end":272,"quote":"Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","source_id":"wikipedia.article.aerospace-materials","source_sha256":"70d11db2ab16ab2055fc4c33fa947215f14489eca0e7543d68865e8b43c09398","start":107}],"target_id":"concept.wikipedia.aerospace-materials","target_kind":"node","target_sha256":"3d36cc29b75f25c7fa34f7a942df2c69e459532b8de798696a0e9547eb044bfe"}],"concept.wikipedia.aerostructure":[{"id":"assertion.concept.wikipedia.aerostructure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerostructure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerostructure\", CC BY-SA 4.0) states: An aerostructure is a component of an aircraft's airframe.","support":[{"end":158,"quote":"An aerostructure is a component of an aircraft's airframe.","source_id":"wikipedia.article.aerostructure","source_sha256":"5257f45401129a35223c686234d5c7625e24d63a75ce91c77a9f5b4a9bacf244","start":100}],"target_id":"concept.wikipedia.aerostructure","target_kind":"node","target_sha256":"32885ef802a8909c7b41f4eceed58dcdc8df06e1b8813be47057fdb1b0d34c2d"}],"concept.wikipedia.aesthetic-usability-effect":[{"id":"assertion.concept.wikipedia.aesthetic-usability-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aesthetic–usability effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aesthetic–usability effect\", CC BY-SA 4.0) states: The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","support":[{"end":288,"quote":"The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","source_id":"wikipedia.article.aesthetic-usability-effect","source_sha256":"23374f56f63b6f7c0dc501a29f74c3b4ed065b4cdb3309d31c0d69b264a6249b","start":114}],"target_id":"concept.wikipedia.aesthetic-usability-effect","target_kind":"node","target_sha256":"cdd4a3c2e19a45c4deb86f578f44781a78278dd64dc0f189e1a5aff53e9b35fc"}],"concept.wikipedia.affect-heuristic":[{"id":"assertion.concept.wikipedia.affect-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affect heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affect heuristic\", CC BY-SA 4.0) states: The affect heuristic is a heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","support":[{"end":317,"quote":"The affect heuristic is a  heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","source_id":"wikipedia.article.affect-heuristic","source_sha256":"b503ca228139e7dcfe82412483a61ff2137dbc9a3dd24a8f109e0b56cea68f62","start":103}],"target_id":"concept.wikipedia.affect-heuristic","target_kind":"node","target_sha256":"16ba991bd487ccedb2171b9aa5b354a4686c9f13de301079fc354298fc717ac3"}],"concept.wikipedia.affine-arithmetic":[{"id":"assertion.concept.wikipedia.affine-arithmetic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine arithmetic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine arithmetic\", CC BY-SA 4.0) states: Affine arithmetic (AA) is a model for self-validated numerical analysis.","support":[{"end":176,"quote":"Affine arithmetic (AA) is a model for self-validated numerical analysis.","source_id":"wikipedia.article.affine-arithmetic","source_sha256":"ca42c7d2596a4b73a31324ef637717e7cb2408084597e15b6a2b9c3e1f9d9cef","start":104}],"target_id":"concept.wikipedia.affine-arithmetic","target_kind":"node","target_sha256":"1a780a91f89f12443c2cdcb044bc956864389e5b5797e5ab6606131e4677e29c"}],"concept.wikipedia.affine-bundle":[{"id":"assertion.concept.wikipedia.affine-bundle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine bundle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine bundle\", CC BY-SA 4.0) states: In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","support":[{"end":296,"quote":"In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","source_id":"wikipedia.article.affine-bundle","source_sha256":"3ce0072a7d44ca64ca00995ce5c3986bef4d795888399ad9834b1b54cbcd1572","start":101}],"target_id":"concept.wikipedia.affine-bundle","target_kind":"node","target_sha256":"17a8ed46bca1ade74745d79b41279a96b2e4b49389f19d907ec15df36e6e11c7"}],"concept.wikipedia.affine-connection":[{"id":"assertion.concept.wikipedia.affine-connection","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine connection as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine connection\", CC BY-SA 4.0) states: In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","support":[{"end":366,"quote":"In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","source_id":"wikipedia.article.affine-connection","source_sha256":"32bee1e890fa7075a7252353cf8680dd0b6fc4ff3b6b98cdee56eba2ba504584","start":103}],"target_id":"concept.wikipedia.affine-connection","target_kind":"node","target_sha256":"4e99a0644612bf29b7167f82da40d80ac44117c0adc965d4bd61ee73ccf417b2"}],"concept.wikipedia.affine-grassmannian-manifold":[{"id":"assertion.concept.wikipedia.affine-grassmannian-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine Grassmannian (manifold) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine Grassmannian (manifold)\", CC BY-SA 4.0) states: In mathematics, there are two distinct meanings of the term affine Grassmannian.","support":[{"end":198,"quote":"In mathematics, there are two distinct meanings of the term affine Grassmannian.","source_id":"wikipedia.article.affine-grassmannian-manifold","source_sha256":"9252af393598ddf078078c19545f6f4fa2b1e3ba360cebffa121474499cc0566","start":118}],"target_id":"concept.wikipedia.affine-grassmannian-manifold","target_kind":"node","target_sha256":"f0b14bbea4983feaee8fc1f5a67f0bcf75b023c0f5720e39c49d47f2e1353467"}],"concept.wikipedia.affine-group":[{"id":"assertion.concept.wikipedia.affine-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine group\", CC BY-SA 4.0) states: In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","support":[{"end":256,"quote":"In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","source_id":"wikipedia.article.affine-group","source_sha256":"c8a83a048307f09955b28d7d28bba15ddb02ac1c462217a1e15c2486498b1028","start":98}],"target_id":"concept.wikipedia.affine-group","target_kind":"node","target_sha256":"a2a124475614f1c1fe833bce8f6141c8ee956b58ad63530b2fec02e0bc5c15fd"}],"concept.wikipedia.affine-lie-algebra":[{"id":"assertion.concept.wikipedia.affine-lie-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine Lie algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine Lie algebra\", CC BY-SA 4.0) states: In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","support":[{"end":272,"quote":"In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","source_id":"wikipedia.article.affine-lie-algebra","source_sha256":"3d43273528bbc9323b14086cbfdcc663a28253a8c762066c6f5fef53ffa50878","start":105}],"target_id":"concept.wikipedia.affine-lie-algebra","target_kind":"node","target_sha256":"8807bed74eb6192abf276066db460020858637972a53543a6f9002bdd456a960"}],"concept.wikipedia.affine-plank-problem":[{"id":"assertion.concept.wikipedia.affine-plank-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine plank problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine plank problem\", CC BY-SA 4.0) states: In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","support":[{"end":262,"quote":"In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","source_id":"wikipedia.article.affine-plank-problem","source_sha256":"67cf867c0dfa64f6a64c16141b01c65e0d0f5fcac95c8ce08f02c22390e19aad","start":108}],"target_id":"concept.wikipedia.affine-plank-problem","target_kind":"node","target_sha256":"a89062c1b8cdb0fa6db1eed1fe3ca56e8200d60daf25248c88705073c5b26c7f"}],"concept.wikipedia.affine-space":[{"id":"assertion.concept.wikipedia.affine-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine space\", CC BY-SA 4.0) states: In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","support":[{"end":406,"quote":"In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","source_id":"wikipedia.article.affine-space","source_sha256":"25eac7f539638e90924e1190253c0b5556130c3c4e7ce0c98f4d1d92e92fe61f","start":98}],"target_id":"concept.wikipedia.affine-space","target_kind":"node","target_sha256":"fb589ef5dcd10a5c351f1f654a637c45b5176d5ea5e4354e8385da25bb9d90dc"}],"concept.wikipedia.affine-sphere":[{"id":"assertion.concept.wikipedia.affine-sphere","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine sphere as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine sphere\", CC BY-SA 4.0) states: In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","support":[{"end":392,"quote":"In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","source_id":"wikipedia.article.affine-sphere","source_sha256":"963c95a8342d40fc1b6f72a74950f136a002ed287587523e98df4f98e638a915","start":101}],"target_id":"concept.wikipedia.affine-sphere","target_kind":"node","target_sha256":"c13c6bc6d201dfc72569fa77d53f1268a3aeff04643d1b327eae4b3e603e0111"}],"concept.wikipedia.affine-symmetric-group":[{"id":"assertion.concept.wikipedia.affine-symmetric-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine symmetric group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine symmetric group\", CC BY-SA 4.0) states: The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","support":[{"end":320,"quote":"The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","source_id":"wikipedia.article.affine-symmetric-group","source_sha256":"7efd367b1af73934eb6b6917c2e138e728a50812256746d1dddddccaae28921e","start":110}],"target_id":"concept.wikipedia.affine-symmetric-group","target_kind":"node","target_sha256":"dd592f2a401bff3400ebefd06f389f98af590f5f168b17487bf9ee4bc8a35000"}],"concept.wikipedia.affinity-laws":[{"id":"assertion.concept.wikipedia.affinity-laws","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affinity laws as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affinity laws\", CC BY-SA 4.0) states: The affinity laws (also known as the \"Fan Laws\" or \"Pump Laws\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","support":[{"end":371,"quote":"The affinity laws (also known as the \\\"Fan Laws\\\" or \\\"Pump Laws\\\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","source_id":"wikipedia.article.affinity-laws","source_sha256":"90007a158e8379e6b6312e68ee455571f9bcb3d1340c8844271b638b80cf4f1e","start":100}],"target_id":"concept.wikipedia.affinity-laws","target_kind":"node","target_sha256":"a782643903b40ef505bf6945f99f58f40ba4152cbeaff342f7269c65486333ee"}],"concept.wikipedia.affirming-the-consequent":[{"id":"assertion.concept.wikipedia.affirming-the-consequent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affirming the consequent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affirming the consequent\", CC BY-SA 4.0) states: In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","support":[{"end":470,"quote":"In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","source_id":"wikipedia.article.affirming-the-consequent","source_sha256":"a1fc6f413fe0b30224c790115cbb3c39bcb82c33fd75b0ae8fc74f714e3914f8","start":107}],"target_id":"concept.wikipedia.affirming-the-consequent","target_kind":"node","target_sha256":"2c5cae270485de8c0cae0444aaac82f804e70571de37c5ded7f1476b7a9d192c"}],"concept.wikipedia.agent-causation":[{"id":"assertion.concept.wikipedia.agent-causation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agent causation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agent causation\", CC BY-SA 4.0) states: Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","support":[{"end":293,"quote":"Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","source_id":"wikipedia.article.agent-causation","source_sha256":"b0786632237a2f3b37d5a29a147de92c4127bc58dfd109279d3822ff4ac97725","start":103}],"target_id":"concept.wikipedia.agent-causation","target_kind":"node","target_sha256":"521f5c2eb19872658f817c3fd92a520a46d69e4f91118dc2c8f200c85b64905a"}],"concept.wikipedia.agentive-logic":[{"id":"assertion.concept.wikipedia.agentive-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agentive logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agentive logic\", CC BY-SA 4.0) states: Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","support":[{"end":318,"quote":"Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","source_id":"wikipedia.article.agentive-logic","source_sha256":"f24aa56faff96e9e6064f65a6b7dd222cd88037c9a61f531266412ce5c5bb7ac","start":102}],"target_id":"concept.wikipedia.agentive-logic","target_kind":"node","target_sha256":"fc9d5dc264bf788b682e707ac3a9ec0dab901c38a85288adca1d99737b1f3571"}],"concept.wikipedia.agitator-device":[{"id":"assertion.concept.wikipedia.agitator-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agitator (device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agitator (device)\", CC BY-SA 4.0) states: An agitator is a device or mechanism to put something into motion by shaking or stirring.","support":[{"end":193,"quote":"An agitator is a device or mechanism to put something into motion by shaking or stirring.","source_id":"wikipedia.article.agitator-device","source_sha256":"795d4c411866fba976dab15b73e4746b13e2a63755231e85e477899aa0b17446","start":104}],"target_id":"concept.wikipedia.agitator-device","target_kind":"node","target_sha256":"3f8023568d2e9f773ef6e332e609dc7eb5b5f31242849cd09dd2e3e06735285c"}],"concept.wikipedia.ai-trust-paradox":[{"id":"assertion.concept.wikipedia.ai-trust-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"AI trust paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"AI trust paradox\", CC BY-SA 4.0) states: The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","support":[{"end":406,"quote":"The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","source_id":"wikipedia.article.ai-trust-paradox","source_sha256":"5b2bf29586a8570a20eb87c96fcfdf23ee7dfdcfb81beca068013b12448a4ca1","start":104}],"target_id":"concept.wikipedia.ai-trust-paradox","target_kind":"node","target_sha256":"68a914ee82b436f0976bc9cc34c1ddad45827e4d41a594086b47ce71f9befe07"}],"concept.wikipedia.air-bearing":[{"id":"assertion.concept.wikipedia.air-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air bearing\", CC BY-SA 4.0) states: Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","support":[{"end":282,"quote":"Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","source_id":"wikipedia.article.air-bearing","source_sha256":"ee2641e5dbe1b3f8ec04ad3893b0681652bdb6b4d2e579f4eff38db7de1c646b","start":99}],"target_id":"concept.wikipedia.air-bearing","target_kind":"node","target_sha256":"7194f4639e8c5f3fbeb9dd626d9b6538af2b7d5cc4f4029d157672c9158fb601"}],"concept.wikipedia.air-carbon-arc-cutting":[{"id":"assertion.concept.wikipedia.air-carbon-arc-cutting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air carbon arc cutting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air carbon arc cutting\", CC BY-SA 4.0) states: Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","support":[{"end":292,"quote":"Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","source_id":"wikipedia.article.air-carbon-arc-cutting","source_sha256":"f0de64eae7bfaab260187157aa9b91595957357ec18afc2ef66c8586fa7aac5e","start":110}],"target_id":"concept.wikipedia.air-carbon-arc-cutting","target_kind":"node","target_sha256":"7c76665bee8e44ee6d02755aaaa4272b9f24f896cc8c41af96e19638143a0b74"}],"concept.wikipedia.air-cooled-heat-exchanger":[{"id":"assertion.concept.wikipedia.air-cooled-heat-exchanger","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air cooled heat exchanger as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air cooled heat exchanger\", CC BY-SA 4.0) states: An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","support":[{"end":363,"quote":"An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","source_id":"wikipedia.article.air-cooled-heat-exchanger","source_sha256":"00cd98d1ee6fe7bc38bf6ebb508a99b559995a091bc7422f776db7b0c9cfee7f","start":113}],"target_id":"concept.wikipedia.air-cooled-heat-exchanger","target_kind":"node","target_sha256":"a4f266ec57b19321a75450e65a02e4a1575e022af3c8c8726170571aeaaeecc4"}],"concept.wikipedia.air-data-inertial-reference-unit":[{"id":"assertion.concept.wikipedia.air-data-inertial-reference-unit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air data inertial reference unit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air data inertial reference unit\", CC BY-SA 4.0) states: An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","support":[{"end":557,"quote":"An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","source_id":"wikipedia.article.air-data-inertial-reference-unit","source_sha256":"14f13721f7154974c8ed411da264df7e7f26a21d421f37e293d21461831c3602","start":119}],"target_id":"concept.wikipedia.air-data-inertial-reference-unit","target_kind":"node","target_sha256":"34030597e05ab76e8bf9a85b57af3c08734c4d56074792dfbba710a0440efb9c"}],"concept.wikipedia.air-fuel-ratio":[{"id":"assertion.concept.wikipedia.air-fuel-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air–fuel ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air–fuel ratio\", CC BY-SA 4.0) states: Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","support":[{"end":215,"quote":"Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","source_id":"wikipedia.article.air-fuel-ratio","source_sha256":"b07fed0d6a35abb3c595bb81076cf5dacd13ba0757d3efdabf7d4dc0c026b1ca","start":101}],"target_id":"concept.wikipedia.air-fuel-ratio","target_kind":"node","target_sha256":"bdcd181f88df55567e50dd9db70b5f457367dcf4d39eaa89cdfb2213947f834a"}],"concept.wikipedia.air-handler":[{"id":"assertion.concept.wikipedia.air-handler","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air handler as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air handler\", CC BY-SA 4.0) states: An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","support":[{"end":280,"quote":"An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","source_id":"wikipedia.article.air-handler","source_sha256":"725a012d75fd6aa9bb407af0cfc331d2ccf00b8ed3bf661a8e0b6d3732932b01","start":98}],"target_id":"concept.wikipedia.air-handler","target_kind":"node","target_sha256":"8873db462b882fc5d0691bd6652679b5fbbda49100fe305627b0f0e5170a1df6"}],"concept.wikipedia.air-operated-valve":[{"id":"assertion.concept.wikipedia.air-operated-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air-operated valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air-operated valve\", CC BY-SA 4.0) states: An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","support":[{"end":267,"quote":"An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","source_id":"wikipedia.article.air-operated-valve","source_sha256":"549e08ccd477dabbea8c5aa1032afe7dc86c47ade4ffaf10e6fe9f24b8879e79","start":105}],"target_id":"concept.wikipedia.air-operated-valve","target_kind":"node","target_sha256":"404d51eb6e49cee4f417a8f61771c1f723ae3c0a99ec9623ade2db62f4c99b69"}],"concept.wikipedia.air-permeability-specific-surface":[{"id":"assertion.concept.wikipedia.air-permeability-specific-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air permeability specific surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air permeability specific surface\", CC BY-SA 4.0) states: The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","support":[{"end":244,"quote":"The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","source_id":"wikipedia.article.air-permeability-specific-surface","source_sha256":"01c47059818a4680732fbb275ffd20d22648b686d309da2e61cb045cf36a3d15","start":121}],"target_id":"concept.wikipedia.air-permeability-specific-surface","target_kind":"node","target_sha256":"9ceefbf89434db080be0df12b7f28d0131de4b3304b46801f965e896b15cbb0c"}],"concept.wikipedia.air-preheater":[{"id":"assertion.concept.wikipedia.air-preheater","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air preheater as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air preheater\", CC BY-SA 4.0) states: An air preheater is any device designed to heat air before another process (for example, combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","support":[{"end":294,"quote":"An air preheater is any device designed to heat air before another process (for example,  combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","source_id":"wikipedia.article.air-preheater","source_sha256":"d1da5e46576ed506970984c7f0cac276b410beafcc734d4bc04175559749496e","start":100}],"target_id":"concept.wikipedia.air-preheater","target_kind":"node","target_sha256":"881b398d93f85a773f43bae08c9d8d18c32a095ad77d2f08aa1cfb498cec2128"}],"concept.wikipedia.air-pump":[{"id":"assertion.concept.wikipedia.air-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air pump\", CC BY-SA 4.0) states: An air pump is a pump for pushing air. Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","support":[{"end":381,"quote":"An air pump is a pump for pushing air.  Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","source_id":"wikipedia.article.air-pump","source_sha256":"a3958cf864687251ae1021d5fb1cf5014dac00763598bd75d5ff4ad79129bf34","start":95}],"target_id":"concept.wikipedia.air-pump","target_kind":"node","target_sha256":"9bee414f215ca6b011201cad68e090b8f0f83001a2428dd2831722523cbdf081"}],"concept.wikipedia.airframe":[{"id":"assertion.concept.wikipedia.airframe","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airframe as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airframe\", CC BY-SA 4.0) states: The mechanical structure of an aircraft is known as the airframe.","support":[{"end":159,"quote":"The mechanical structure of an aircraft is known as the airframe.","source_id":"wikipedia.article.airframe","source_sha256":"fad97f0802c817c12caa68bb0488bc30fc8ade563ca2be1fac7bcee4ae07dbd4","start":94}],"target_id":"concept.wikipedia.airframe","target_kind":"node","target_sha256":"6b6269ccb5ce4707757f950f6baa763f4a4ba01f6235e5c9119dd237e05283d3"}],"concept.wikipedia.airlift-pump":[{"id":"assertion.concept.wikipedia.airlift-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airlift pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airlift pump\", CC BY-SA 4.0) states: An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","support":[{"end":200,"quote":"An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","source_id":"wikipedia.article.airlift-pump","source_sha256":"2313f99e442b5f6b231964ba4640cbfe6de84cb647bdcd866d13d0b73f980638","start":99}],"target_id":"concept.wikipedia.airlift-pump","target_kind":"node","target_sha256":"ec28f15dcdaa535766cfa178b33f7846e0e4e022a657770567b0560f897cc8c3"}],"concept.wikipedia.airshaft":[{"id":"assertion.concept.wikipedia.airshaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airshaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airshaft\", CC BY-SA 4.0) states: In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","support":[{"end":253,"quote":"In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","source_id":"wikipedia.article.airshaft","source_sha256":"f7975797e9e5adda46dcef0730118a860b562e5740ba9f9f6b710af9fffcda2b","start":95}],"target_id":"concept.wikipedia.airshaft","target_kind":"node","target_sha256":"89357b026c459c6eb675ecbe52ef1ec3e42273f13fd13f5bbc1021ab02531100"}],"concept.wikipedia.aitken-interpolation":[{"id":"assertion.concept.wikipedia.aitken-interpolation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aitken interpolation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aitken interpolation\", CC BY-SA 4.0) states: Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","support":[{"end":234,"quote":"Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","source_id":"wikipedia.article.aitken-interpolation","source_sha256":"a5832f513504062729117012bf8129f13ca827b852455a52d352ebaa3932ef81","start":108}],"target_id":"concept.wikipedia.aitken-interpolation","target_kind":"node","target_sha256":"de845ce2ee0f772d727901838c6849a2b87a981fb98b96b60b759d4db3f6cf5c"}],"concept.wikipedia.alarm-management":[{"id":"assertion.concept.wikipedia.alarm-management","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alarm management as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alarm management\", CC BY-SA 4.0) states: Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","support":[{"end":296,"quote":"Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","source_id":"wikipedia.article.alarm-management","source_sha256":"18cf59529db6895c931fdd0456751be6432ab20cd2058889b69fc4f1b8a65c72","start":102}],"target_id":"concept.wikipedia.alarm-management","target_kind":"node","target_sha256":"18be014a5e4c99160154c3f53977efce90ecaf107e1cc5f03e6b853b5483bacd"}],"concept.wikipedia.albertson-index":[{"id":"assertion.concept.wikipedia.albertson-index","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Albertson index as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Albertson index\", CC BY-SA 4.0) states: The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","support":[{"end":290,"quote":"The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","source_id":"wikipedia.article.albertson-index","source_sha256":"e6a9687641f1a24d053e9538ccaa0a149c80711c34feb28f9311b37b2a609ebe","start":103}],"target_id":"concept.wikipedia.albertson-index","target_kind":"node","target_sha256":"b7d8be1ca3cdae401eb09381ae0ad4f658908dbbb55d87034f38976cc3082e4c"}],"concept.wikipedia.alexander-duality":[{"id":"assertion.concept.wikipedia.alexander-duality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander duality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander duality\", CC BY-SA 4.0) states: In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","support":[{"end":303,"quote":"In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","source_id":"wikipedia.article.alexander-duality","source_sha256":"f5f44580b7a4aa1ea37e7999d87576a63b2ace2d919f9db4f5f9b318ff646be6","start":104}],"target_id":"concept.wikipedia.alexander-duality","target_kind":"node","target_sha256":"d085eef169232d7790a132c402759ed319c36018613b0d93322bd44df02b8167"}],"concept.wikipedia.alexander-polynomial":[{"id":"assertion.concept.wikipedia.alexander-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander polynomial\", CC BY-SA 4.0) states: In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","support":[{"end":239,"quote":"In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","source_id":"wikipedia.article.alexander-polynomial","source_sha256":"0ed6cc84135da42b792dbcee21d4b9bcc641c0edac779d3caa30ba16e4609233","start":107}],"target_id":"concept.wikipedia.alexander-polynomial","target_kind":"node","target_sha256":"9d7f31240a4a8ffcc5faf7368aaf6163a9045fd538daa3e7b7071716dd3af795"}],"concept.wikipedia.alexandroff-extension":[{"id":"assertion.concept.wikipedia.alexandroff-extension","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandroff extension as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandroff extension\", CC BY-SA 4.0) states: In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","support":[{"end":299,"quote":"In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","source_id":"wikipedia.article.alexandroff-extension","source_sha256":"fe7d56c04a23816d29b3d696e8579c766fc981cf4fd4b0627fd0e8ad473e9e27","start":106}],"target_id":"concept.wikipedia.alexandroff-extension","target_kind":"node","target_sha256":"ad9f3f4e2e27d2709c1e73c971f87bef5ed31328bbc37ab8a51e4ef0a4b0dc5d"}],"concept.wikipedia.alexandrov-space":[{"id":"assertion.concept.wikipedia.alexandrov-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandrov space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandrov space\", CC BY-SA 4.0) states: In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","support":[{"end":271,"quote":"In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","source_id":"wikipedia.article.alexandrov-space","source_sha256":"aae255a25b698b558359e98c34e4c71d4695eae85fb96610c0d8b850283c7bea","start":104}],"target_id":"concept.wikipedia.alexandrov-space","target_kind":"node","target_sha256":"2f7b69a492707621ae233776ae9595cc16738f4d5ecfd9bf854b3cca67526c10"}],"concept.wikipedia.alexandrov-topology":[{"id":"assertion.concept.wikipedia.alexandrov-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandrov topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandrov topology\", CC BY-SA 4.0) states: In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","support":[{"end":309,"quote":"In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","source_id":"wikipedia.article.alexandrov-topology","source_sha256":"91f5d719859cb893c50b0f13f2245c14c8c06c5eb042bc3b1183780b15f9828a","start":105}],"target_id":"concept.wikipedia.alexandrov-topology","target_kind":"node","target_sha256":"3502ddd7b8d217d63b25a8b97c37dbcefb1d31d91f8beddc129e3b7bff98fd2d"}],"concept.wikipedia.algebra-extension":[{"id":"assertion.concept.wikipedia.algebra-extension","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebra extension as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebra extension\", CC BY-SA 4.0) states: In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","support":[{"end":201,"quote":"In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","source_id":"wikipedia.article.algebra-extension","source_sha256":"f1ff18875218685a3748b5c35a21a19c2fa7f7c96a19cdc8d0ede6a90295ead1","start":105}],"target_id":"concept.wikipedia.algebra-extension","target_kind":"node","target_sha256":"610084ca92b620e4c0be9122740f39ea253857d9403daccb984cc9bfb37fc703"}],"concept.wikipedia.algebra-representation":[{"id":"assertion.concept.wikipedia.algebra-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebra representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebra representation\", CC BY-SA 4.0) states: In abstract algebra, a representation of an associative algebra is a module for that algebra.","support":[{"end":201,"quote":"In abstract algebra, a representation of an associative algebra is a module for that algebra.","source_id":"wikipedia.article.algebra-representation","source_sha256":"e42fdffe240853f29b6899d863dc722ba18455b15ff1e8f9b962b5c5c267324c","start":108}],"target_id":"concept.wikipedia.algebra-representation","target_kind":"node","target_sha256":"5d6eee5e947c9ceab045ec53865f83f070664a8db3f68be7987819798c178162"}],"concept.wikipedia.algebraic-cycle":[{"id":"assertion.concept.wikipedia.algebraic-cycle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic cycle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic cycle\", CC BY-SA 4.0) states: In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V. These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","support":[{"end":316,"quote":"In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V.  These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","source_id":"wikipedia.article.algebraic-cycle","source_sha256":"a1ed8f49987d19098db2d83e5f2717f479744d617aab5efbbebe487942cd03d9","start":102}],"target_id":"concept.wikipedia.algebraic-cycle","target_kind":"node","target_sha256":"a50189987ae4ad8ffacbb6fcdb96d6b19cea8db79bb6adf5817bfc32de4ff72a"}],"concept.wikipedia.algebraic-differential-equation":[{"id":"assertion.concept.wikipedia.algebraic-differential-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic differential equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic differential equation\", CC BY-SA 4.0) states: In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","support":[{"end":251,"quote":"In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","source_id":"wikipedia.article.algebraic-differential-equation","source_sha256":"20a73133bcd45ec75ad552005580c76e2b8b821a595e692444b68a3cedd76467","start":118}],"target_id":"concept.wikipedia.algebraic-differential-equation","target_kind":"node","target_sha256":"1d5f2265792d6705acddc1150aad8238e7ba029c78a7ed44b2f829ca11c2c57e"}],"concept.wikipedia.algebraic-function":[{"id":"assertion.concept.wikipedia.algebraic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic function\", CC BY-SA 4.0) states: In mathematics, an algebraic function is a function that satisfies a polynomial equation.","support":[{"end":193,"quote":"In mathematics, an algebraic function is a function that satisfies a polynomial equation.","source_id":"wikipedia.article.algebraic-function","source_sha256":"073286b57c3048dabd96453a18e51f59038fe4111ed9380acade3959455988a9","start":104}],"target_id":"concept.wikipedia.algebraic-function","target_kind":"node","target_sha256":"e35d67cf387d9db6d8efbe37a1b6e78fe3d1e15e9ce87fed0d1c07390e70fb99"}],"concept.wikipedia.algebraic-geometry-and-analytic-geometry":[{"id":"assertion.concept.wikipedia.algebraic-geometry-and-analytic-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic geometry and analytic geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic geometry and analytic geometry\", CC BY-SA 4.0) states: In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","support":[{"end":216,"quote":"In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","source_id":"wikipedia.article.algebraic-geometry-and-analytic-geometry","source_sha256":"9b3a3ee2c59ea274736d5e3a4d0fc77268b367cfa78cb4066119ac546e93844a","start":126}],"target_id":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","target_kind":"node","target_sha256":"509f0bb8576652150829f7822206a8f1e0063236adb4bd19162f878772a375c0"}],"concept.wikipedia.algebraic-interior":[{"id":"assertion.concept.wikipedia.algebraic-interior","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic interior as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic interior\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","support":[{"end":272,"quote":"In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","source_id":"wikipedia.article.algebraic-interior","source_sha256":"4195c2ee12eef06702b765a69a7d8adfda82457180ec5f8fe6f3ad55c23ee8a7","start":106}],"target_id":"concept.wikipedia.algebraic-interior","target_kind":"node","target_sha256":"e622a87a917b37bd759bc2b1bc2686331e046acaa1647840338dfba68b2cbe7e"}],"concept.wikipedia.algebraic-k-theory":[{"id":"assertion.concept.wikipedia.algebraic-k-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic K-theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic K-theory\", CC BY-SA 4.0) states: Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","support":[{"end":227,"quote":"Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","source_id":"wikipedia.article.algebraic-k-theory","source_sha256":"c70a109055c4449aac61f33c564bf5b942ea718bdd15fa70c3010dc01c923d57","start":104}],"target_id":"concept.wikipedia.algebraic-k-theory","target_kind":"node","target_sha256":"e4a9f4944471f13feaa2429c6f460e62e1d2c7ac9a32861c9ce9575111628237"}],"concept.wikipedia.algebraic-manifold":[{"id":"assertion.concept.wikipedia.algebraic-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic manifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic manifold\", CC BY-SA 4.0) states: In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","support":[{"end":192,"quote":"In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","source_id":"wikipedia.article.algebraic-manifold","source_sha256":"ad19068268ec26e6431f0a75031daa427db77e926b1623d057d159f7af0164d2","start":105}],"target_id":"concept.wikipedia.algebraic-manifold","target_kind":"node","target_sha256":"c7aca5b51f3de645146c8fa3e6df88e2b0633d0814693130ec0e2d5abc49eb8b"}],"concept.wikipedia.algebraic-semantics-mathematical-logic":[{"id":"assertion.concept.wikipedia.algebraic-semantics-mathematical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic semantics (mathematical logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic semantics (mathematical logic)\", CC BY-SA 4.0) states: In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","support":[{"end":245,"quote":"In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","source_id":"wikipedia.article.algebraic-semantics-mathematical-logic","source_sha256":"4aeeaff69e7ba92a53ddfbe574828506b902d45de4f176d8c809e6e5591c6a17","start":127}],"target_id":"concept.wikipedia.algebraic-semantics-mathematical-logic","target_kind":"node","target_sha256":"b525064379fa70f5940fad47c3246bb02e0dde0aabd14b8f45a7a3a97c5eae5c"}],"concept.wikipedia.algebraic-structure":[{"id":"assertion.concept.wikipedia.algebraic-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic structure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic structure\", CC BY-SA 4.0) states: In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","support":[{"end":428,"quote":"In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","source_id":"wikipedia.article.algebraic-structure","source_sha256":"d152cf257e90068c846f46d4241966d46a27dc325a2bb59d425a6722f1cecccb","start":105}],"target_id":"concept.wikipedia.algebraic-structure","target_kind":"node","target_sha256":"15dc84610b940fcbd4445c8a561be5ad00fc1702f27f5613034863b26fdbe2b8"}],"concept.wikipedia.algebraically-compact-module":[{"id":"assertion.concept.wikipedia.algebraically-compact-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraically compact module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraically compact module\", CC BY-SA 4.0) states: In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \"nice\" property which allows the solution of infinite systems of equations in the module by finitary means.","support":[{"end":338,"quote":"In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \\\"nice\\\" property which allows the solution of infinite systems of equations in the module by finitary means.","source_id":"wikipedia.article.algebraically-compact-module","source_sha256":"127adf2a79c83471f2d771e938087bba50e6c4d5b0180e4c77e21aa5d0462bb7","start":114}],"target_id":"concept.wikipedia.algebraically-compact-module","target_kind":"node","target_sha256":"b19f362e137d07f5ec30272cf88f23389ed5890b8f4575ade2b777c03f2f42c3"}],"concept.wikipedia.aliasing":[{"id":"assertion.concept.wikipedia.aliasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aliasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aliasing\", CC BY-SA 4.0) states: In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","support":[{"end":292,"quote":"In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","source_id":"wikipedia.article.aliasing","source_sha256":"0eb6a5af935dfef86437559e8e357bae416c0201a801860128eaf5baca02995b","start":94}],"target_id":"concept.wikipedia.aliasing","target_kind":"node","target_sha256":"eadbfb03367dc6dcc75e39df9739b01091e86b7545c28a7cb6a43879680c4f37"}],"concept.wikipedia.alief-mental-state":[{"id":"assertion.concept.wikipedia.alief-mental-state","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alief (mental state) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alief (mental state)\", CC BY-SA 4.0) states: In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","support":[{"end":266,"quote":"In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","source_id":"wikipedia.article.alief-mental-state","source_sha256":"5e1c37b7fa2c03efb24fb490caa19ea53c46d805f632750f69923675889bb587","start":108}],"target_id":"concept.wikipedia.alief-mental-state","target_kind":"node","target_sha256":"3c2e0cac864432a1af2b5f8d20ca4f580772acbfa0a24e0e4d9151910331d8f7"}],"concept.wikipedia.alignments-of-random-points":[{"id":"assertion.concept.wikipedia.alignments-of-random-points","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alignments of random points as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alignments of random points\", CC BY-SA 4.0) states: The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","support":[{"end":318,"quote":"The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","source_id":"wikipedia.article.alignments-of-random-points","source_sha256":"69819e03c7915db30773deb9f84df299d0e4ca31acbe834c4edce36aed82b386","start":113}],"target_id":"concept.wikipedia.alignments-of-random-points","target_kind":"node","target_sha256":"488a1fc302e8024c5eaab532fa7b5bf7899e846af868c7f4b11a20847588968b"}],"concept.wikipedia.alkali-metal-thermal-to-electric-converter":[{"id":"assertion.concept.wikipedia.alkali-metal-thermal-to-electric-converter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alkali-metal thermal to electric converter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alkali-metal thermal to electric converter\", CC BY-SA 4.0) states: An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","support":[{"end":338,"quote":"An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","source_id":"wikipedia.article.alkali-metal-thermal-to-electric-converter","source_sha256":"1910f08b04b08e56ed9a7ce912ed8951fca4e20647384fb760798b898f5cd2a8","start":129}],"target_id":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","target_kind":"node","target_sha256":"40609b5b80f541a124ca7c5097f5c06ccdf08c69b55bd3bf4e3bd5549c1a0b85"}],"concept.wikipedia.all-in-rate":[{"id":"assertion.concept.wikipedia.all-in-rate","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"All-in rate as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"All-in rate\", CC BY-SA 4.0) states: All-in rate is a term used in both the construction industry and the financial sector.","support":[{"end":185,"quote":"All-in rate is a term used in both the construction industry and the financial sector.","source_id":"wikipedia.article.all-in-rate","source_sha256":"ef3c20f5b188278d9e5f57a5c87335f2605f1b229c9462c125501865d04dcf1d","start":99}],"target_id":"concept.wikipedia.all-in-rate","target_kind":"node","target_sha256":"08d28ad24ca38c9e91f3fb97f4f7ac3d043389de906eac749f708c6451d4ab23"}],"concept.wikipedia.all-one-polynomial":[{"id":"assertion.concept.wikipedia.all-one-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"All one polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"All one polynomial\", CC BY-SA 4.0) states: In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","support":[{"end":199,"quote":"In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","source_id":"wikipedia.article.all-one-polynomial","source_sha256":"47c65f2fc2b9d129bf825ff7ec99da6b2cd042b39cb0c6cc8162d2c0f6a21b01","start":105}],"target_id":"concept.wikipedia.all-one-polynomial","target_kind":"node","target_sha256":"1f72c527ef6759026a2ad9ec736e34a03c4245fe1f29bd7daa40d6e4178c21e4"}],"concept.wikipedia.allegory-of-the-cave":[{"id":"assertion.concept.wikipedia.allegory-of-the-cave","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Allegory of the cave as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Allegory of the cave\", CC BY-SA 4.0) states: The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \"the effect of education (παιδεία) and the lack of it on our nature\".","support":[{"end":311,"quote":"The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \\\"the effect of education (παιδεία) and the lack of it on our nature\\\".","source_id":"wikipedia.article.allegory-of-the-cave","source_sha256":"676b50b9623ec983551d248d2bdda73275e57cb3895f86c4be1a3775df3db2f6","start":105}],"target_id":"concept.wikipedia.allegory-of-the-cave","target_kind":"node","target_sha256":"cd06991fe7e06e433640b1e55b98549eeb57ff7ef8edbbb9bb9b371bdffcc4e2"}],"concept.wikipedia.almost-everywhere":[{"id":"assertion.concept.wikipedia.almost-everywhere","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost everywhere as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost everywhere\", CC BY-SA 4.0) states: In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","support":[{"end":307,"quote":"In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","source_id":"wikipedia.article.almost-everywhere","source_sha256":"d1d2fa957926b715f08b1a7de31acd7342344824dfac35eaf6124531352f51f9","start":102}],"target_id":"concept.wikipedia.almost-everywhere","target_kind":"node","target_sha256":"fd80aec1e0092c11df27d6465196eccd644b3be316a44309d1cebcaca3a5e8b0"}],"concept.wikipedia.almost-perfect-number":[{"id":"assertion.concept.wikipedia.almost-perfect-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost perfect number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost perfect number\", CC BY-SA 4.0) states: In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","support":[{"end":414,"quote":"In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","source_id":"wikipedia.article.almost-perfect-number","source_sha256":"f41dbd6a61845a18451f38ac1b981cfbe43c9157ed9f610e9b3c9d412ec02f3d","start":107}],"target_id":"concept.wikipedia.almost-perfect-number","target_kind":"node","target_sha256":"1bac32de3b8c16a6de53af435ed257878fd7dac17c0c727f084ff6194af6eed2"}],"concept.wikipedia.almost-periodic-function":[{"id":"assertion.concept.wikipedia.almost-periodic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost periodic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost periodic function\", CC BY-SA 4.0) states: In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \"almost-periods\".","support":[{"end":321,"quote":"In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \\\"almost-periods\\\".","source_id":"wikipedia.article.almost-periodic-function","source_sha256":"b6ff3c5dedd0c85a0a0d53502f799fa8c09eb6bacc6ff0542962aefdcb084a5f","start":110}],"target_id":"concept.wikipedia.almost-periodic-function","target_kind":"node","target_sha256":"9ca0c0da92dfa18e27b45f4e5c93036dd1e45a4e3d23dec22f799109c1683baa"}],"concept.wikipedia.almost-ring":[{"id":"assertion.concept.wikipedia.almost-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost ring\", CC BY-SA 4.0) states: In mathematics, almost modules and almost rings are certain objects interpolating between rings and their fields of fractions.","support":[{"end":226,"quote":"In mathematics, almost modules and almost rings are certain objects interpolating between  rings and their fields of fractions.","source_id":"wikipedia.article.almost-ring","source_sha256":"88da25d9805dd7ffd4cbd3ff99d8be9c285b549ae1d0bf82ead7b954f2f9a30b","start":99}],"target_id":"concept.wikipedia.almost-ring","target_kind":"node","target_sha256":"64792e3c20677288f072c3a27e574dd4e482f5a43f09113737b3b3a6d7fe8c1e"}],"concept.wikipedia.almost-surely":[{"id":"assertion.concept.wikipedia.almost-surely","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost surely as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost surely\", CC BY-SA 4.0) states: In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","support":[{"end":270,"quote":"In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","source_id":"wikipedia.article.almost-surely","source_sha256":"0de8f6059ce071e012d294df709931101826e797c606c35f1a4207b109f56bd9","start":99}],"target_id":"concept.wikipedia.almost-surely","target_kind":"node","target_sha256":"5c42e37ba3c48b8e6b0b5723e8fbac4e39dda82a07cd2ec41f23b58c91e9617e"}],"concept.wikipedia.alpha-beta-filter":[{"id":"assertion.concept.wikipedia.alpha-beta-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alpha beta filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alpha beta filter\", CC BY-SA 4.0) states: An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","support":[{"end":273,"quote":"An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","source_id":"wikipedia.article.alpha-beta-filter","source_sha256":"24aec09b52e3ecde3e0d76974ac77b9ccce3eca3025158eac76e02d67e1d5403","start":105}],"target_id":"concept.wikipedia.alpha-beta-filter","target_kind":"node","target_sha256":"f1b2c7ef4040ea9338fe4001b3023dd0594ea0e616476a7febebd606ea45aa37"}],"concept.wikipedia.alpha-factor":[{"id":"assertion.concept.wikipedia.alpha-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alpha factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alpha factor\", CC BY-SA 4.0) states: The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","support":[{"end":225,"quote":"The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","source_id":"wikipedia.article.alpha-factor","source_sha256":"56dc6d1644ef664565fcbaa9d071583e2eeedcad917cc14c48ea8d3a91aa6fd9","start":100}],"target_id":"concept.wikipedia.alpha-factor","target_kind":"node","target_sha256":"9e6be167fa36fdf44dd2513d1787e9375bf11c0045302b0be986ca933003e430"}],"concept.wikipedia.alphabet-of-human-thought":[{"id":"assertion.concept.wikipedia.alphabet-of-human-thought","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alphabet of human thought as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alphabet of human thought\", CC BY-SA 4.0) states: The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","support":[{"end":365,"quote":"The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","source_id":"wikipedia.article.alphabet-of-human-thought","source_sha256":"44f65a17ed658728649826bf13b4546c4e19a37d602da42c98e76a842b4d71cf","start":111}],"target_id":"concept.wikipedia.alphabet-of-human-thought","target_kind":"node","target_sha256":"e7cf57970e3d7f5273be1d7e76c8de3b1a6d67391bd725949e53947cceed52c1"}],"concept.wikipedia.alternating-current":[{"id":"assertion.concept.wikipedia.alternating-current","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alternating current as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alternating current\", CC BY-SA 4.0) states: Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","support":[{"end":309,"quote":"Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","source_id":"wikipedia.article.alternating-current","source_sha256":"18a6e09fc37bc42467570c8803f91458a44578a67ba8ff43d699e77c2b71ea2d","start":104}],"target_id":"concept.wikipedia.alternating-current","target_kind":"node","target_sha256":"54eb290564804b1137efd2225169e5e5eda7e580d5689daa79b97abd8659863a"}],"concept.wikipedia.alternating-series":[{"id":"assertion.concept.wikipedia.alternating-series","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alternating series as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alternating series\", CC BY-SA 4.0) states: In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","support":[{"end":224,"quote":"In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","source_id":"wikipedia.article.alternating-series","source_sha256":"88197222820fdb7067e04b17e48ce965e062c0445c79c3e72d0fde9e0770c8d4","start":104}],"target_id":"concept.wikipedia.alternating-series","target_kind":"node","target_sha256":"9d72d20604a41d96d3fe35c2f2eab971b05336d53beeaa5f1a053095fef16105"}],"concept.wikipedia.aluminium-conductor-steel-reinforced-cable":[{"id":"assertion.concept.wikipedia.aluminium-conductor-steel-reinforced-cable","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aluminium-conductor steel-reinforced cable as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aluminium-conductor steel-reinforced cable\", CC BY-SA 4.0) states: Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","support":[{"end":279,"quote":"Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","source_id":"wikipedia.article.aluminium-conductor-steel-reinforced-cable","source_sha256":"ca7df856c998c31c1c9cbc2c8e52d59f4bd271c60a39fb5d0e987a08f7502a7d","start":130}],"target_id":"concept.wikipedia.aluminium-conductor-steel-reinforced-cable","target_kind":"node","target_sha256":"652001eabfd31421b553c36ddbd6451b99899e87d40b1edd60e4605b61b6e997"}],"concept.wikipedia.alvin-plantinga-s-free-will-defense":[{"id":"assertion.concept.wikipedia.alvin-plantinga-s-free-will-defense","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alvin Plantinga's free-will defense as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alvin Plantinga's free-will defense\", CC BY-SA 4.0) states: Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","support":[{"end":319,"quote":"Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","source_id":"wikipedia.article.alvin-plantinga-s-free-will-defense","source_sha256":"e280db366964879677f9bd4f1fda0936bc843125ca9ec9b45d3d98a72a1c8bef","start":123}],"target_id":"concept.wikipedia.alvin-plantinga-s-free-will-defense","target_kind":"node","target_sha256":"bf69d376fc90615b77378abafac916d2de8381f0722d1e7b4ff88a6536d56f69"}],"concept.wikipedia.always-already":[{"id":"assertion.concept.wikipedia.always-already","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Always already as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Always already\", CC BY-SA 4.0) states: In philosophy, always already describes the perception of phenomena by the mind of an observer.","support":[{"end":197,"quote":"In philosophy, always already describes the perception of phenomena by the mind of an observer.","source_id":"wikipedia.article.always-already","source_sha256":"20bb933878816ca3af1c3f5200cc1367bcf67edf68f7685a3b74d8042a9a09ba","start":102}],"target_id":"concept.wikipedia.always-already","target_kind":"node","target_sha256":"248ee5849cf033d38f091f8653a8d209618913905fb77962e6ac59d2abf31e8c"}],"concept.wikipedia.amalgamation-property":[{"id":"assertion.concept.wikipedia.amalgamation-property","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amalgamation property as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amalgamation property\", CC BY-SA 4.0) states: In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","support":[{"end":351,"quote":"In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","source_id":"wikipedia.article.amalgamation-property","source_sha256":"b6af461ad87591a648d4217b17d9784ecb66cd0d7dd671867fc240d39e07cae9","start":109}],"target_id":"concept.wikipedia.amalgamation-property","target_kind":"node","target_sha256":"4ed84e8a399c260d8b05babef5af3add6f5033952251bd5fdd30d0647bd7644b"}],"concept.wikipedia.ambient-isotopy":[{"id":"assertion.concept.wikipedia.ambient-isotopy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambient isotopy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambient isotopy\", CC BY-SA 4.0) states: In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","support":[{"end":313,"quote":"In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","source_id":"wikipedia.article.ambient-isotopy","source_sha256":"919660f17c111ecc803c3d2078a8ccdc6fdb3e5d07eb1e96936642c3bc007c3e","start":102}],"target_id":"concept.wikipedia.ambient-isotopy","target_kind":"node","target_sha256":"6164fb917fed71bb68f8b45e3e6d0b59f323ae57f0f35e2c3919d0360161984f"}],"concept.wikipedia.ambient-space-mathematics":[{"id":"assertion.concept.wikipedia.ambient-space-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambient space (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambient space (mathematics)\", CC BY-SA 4.0) states: In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","support":[{"end":260,"quote":"In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","source_id":"wikipedia.article.ambient-space-mathematics","source_sha256":"1b4ef100c66f07005609a701536394262698876f8f93ec018ea5efeb975402b6","start":114}],"target_id":"concept.wikipedia.ambient-space-mathematics","target_kind":"node","target_sha256":"f576b370297127bb4840d79d68a3521c538453a764257a6f854ba81051b333a9"}],"concept.wikipedia.ambiguity":[{"id":"assertion.concept.wikipedia.ambiguity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambiguity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambiguity\", CC BY-SA 4.0) states: Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","support":[{"end":256,"quote":"Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","source_id":"wikipedia.article.ambiguity","source_sha256":"1015a00212c82572fb57899340a6c5d8bcfa5bb43feaad45a2db78d3709a791e","start":92}],"target_id":"concept.wikipedia.ambiguity","target_kind":"node","target_sha256":"4d0829996bd8501c950980cef880606e7d02af5e13b2795be7a3ca1b67054b84"}],"concept.wikipedia.ambiguity-effect":[{"id":"assertion.concept.wikipedia.ambiguity-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambiguity effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambiguity effect\", CC BY-SA 4.0) states: The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \"ambiguity\".","support":[{"end":225,"quote":"The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \\\"ambiguity\\\".","source_id":"wikipedia.article.ambiguity-effect","source_sha256":"927a75525786d9809517fa3de91185a3a5384d765e6a3b959dfbfc0847b5ec44","start":103}],"target_id":"concept.wikipedia.ambiguity-effect","target_kind":"node","target_sha256":"0d351b1ad47b69388bebd855ca449e59e8fea9f249b1d2472a4478d8c41278a9"}],"concept.wikipedia.ameca-robot":[{"id":"assertion.concept.wikipedia.ameca-robot","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ameca (robot) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ameca (robot)\", CC BY-SA 4.0) states: Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","support":[{"end":217,"quote":"Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","source_id":"wikipedia.article.ameca-robot","source_sha256":"00731cb34236752990197204630ff4932604a38c8eb22f1cdb70167d4584e059","start":101}],"target_id":"concept.wikipedia.ameca-robot","target_kind":"node","target_sha256":"c7677a35f80ab2974c0e8b08370165b26133cc482ee9c94f16b3b20b3eb4e624"}],"concept.wikipedia.amenable-number":[{"id":"assertion.concept.wikipedia.amenable-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amenable number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amenable number\", CC BY-SA 4.0) states: An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","support":[{"end":314,"quote":"An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","source_id":"wikipedia.article.amenable-number","source_sha256":"815b49d82ef0805634216945baaed113c4d7125cd586e99cd5518246f30da516","start":102}],"target_id":"concept.wikipedia.amenable-number","target_kind":"node","target_sha256":"cc531b230be91e4008debb432929f85d9396d16358938e7859c9f6a2f3c7c8d9"}],"concept.wikipedia.amicable-numbers":[{"id":"assertion.concept.wikipedia.amicable-numbers","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amicable numbers as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amicable numbers\", CC BY-SA 4.0) states: In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","support":[{"end":266,"quote":"In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","source_id":"wikipedia.article.amicable-numbers","source_sha256":"3523d7c418d79e17ad10d1222d525bdb9efc18fc2ff95cddc2721e2f1b5ccd55","start":100}],"target_id":"concept.wikipedia.amicable-numbers","target_kind":"node","target_sha256":"65afcd538460a5787b52de4415a99d93359dd77ed1909ad1e2f46c851fc7f024"}],"concept.wikipedia.amicable-triple":[{"id":"assertion.concept.wikipedia.amicable-triple","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amicable triple as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amicable triple\", CC BY-SA 4.0) states: In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","support":[{"end":278,"quote":"In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","source_id":"wikipedia.article.amicable-triple","source_sha256":"1f9539239dee5fafa147978fe2bc713991e7ac4828ec1743edcf4bf571cbb374","start":103}],"target_id":"concept.wikipedia.amicable-triple","target_kind":"node","target_sha256":"ffbf18183531e402ec67ee070a3f47cda8f52eb43db62637261638e8857177a7"}],"concept.wikipedia.amplifier":[{"id":"assertion.concept.wikipedia.amplifier","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amplifier as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amplifier\", CC BY-SA 4.0) states: An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","support":[{"end":252,"quote":"An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","source_id":"wikipedia.article.amplifier","source_sha256":"712a09c187e04fd0133b64fadcc7b296e91efe7b5709643225be64029d1153c6","start":93}],"target_id":"concept.wikipedia.amplifier","target_kind":"node","target_sha256":"949e0747490dbc364d287045166cf84661434de49201ab3a5510c2851f7e290a"}],"concept.wikipedia.amplitwist":[{"id":"assertion.concept.wikipedia.amplitwist","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amplitwist as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amplitwist\", CC BY-SA 4.0) states: In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","support":[{"end":271,"quote":"In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","source_id":"wikipedia.article.amplitwist","source_sha256":"769c4be276b8695ccaa7ce940bd0e5d77f26b27b8ba7c928c8543e1e9c12cb7f","start":98}],"target_id":"concept.wikipedia.amplitwist","target_kind":"node","target_sha256":"7ed9c335edf519fdef86dea7523bca013eb9709c1d4a5826f4c1da5d1fb13395"}],"concept.wikipedia.anaesthetic-machine":[{"id":"assertion.concept.wikipedia.anaesthetic-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anaesthetic machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anaesthetic machine\", CC BY-SA 4.0) states: An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","support":[{"end":358,"quote":"An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","source_id":"wikipedia.article.anaesthetic-machine","source_sha256":"da0c35974b64fdaef333c74cea7cc0e8175c805178709f3efffef010fa58a092","start":105}],"target_id":"concept.wikipedia.anaesthetic-machine","target_kind":"node","target_sha256":"1dd45bdb66d9cfd3ff574c43f0fe7eb7024d8f9a65c4391d13ce179392464c17"}],"concept.wikipedia.analog-delay-line":[{"id":"assertion.concept.wikipedia.analog-delay-line","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog delay line as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog delay line\", CC BY-SA 4.0) states: An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","support":[{"end":270,"quote":"An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","source_id":"wikipedia.article.analog-delay-line","source_sha256":"9adb90c69ded9431bd16c829c2f2cdd3d3a48b4141c95846d09039f5da6f1600","start":104}],"target_id":"concept.wikipedia.analog-delay-line","target_kind":"node","target_sha256":"1b607e8f272079e95e833cd999b9943e1eafc45e4e445c066542856334d2e61b"}],"concept.wikipedia.analog-device":[{"id":"assertion.concept.wikipedia.analog-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog device\", CC BY-SA 4.0) states: Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","support":[{"end":375,"quote":"Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","source_id":"wikipedia.article.analog-device","source_sha256":"e2f560f883edd6677678c37245689ff726406f8a249f47a3f811edb794da58ee","start":101}],"target_id":"concept.wikipedia.analog-device","target_kind":"node","target_sha256":"0471fbab5ed1ad4247408ac1700cec1d4d7baf5748912187d7c03a9c8e207804"}],"concept.wikipedia.analog-front-end":[{"id":"assertion.concept.wikipedia.analog-front-end","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog front-end as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog front-end\", CC BY-SA 4.0) states: An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","support":[{"end":589,"quote":"An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","source_id":"wikipedia.article.analog-front-end","source_sha256":"066c690e6d2d0479c5dd542a8682baa5d2f75e13c7eab750d677a6b74f0ceb8a","start":104}],"target_id":"concept.wikipedia.analog-front-end","target_kind":"node","target_sha256":"6ae904ad7a1abdd9082dce56ccd5b06d0e18239768701fd14c372c0dff9e8b0b"}],"concept.wikipedia.analog-signal-processing":[{"id":"assertion.concept.wikipedia.analog-signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog signal processing\", CC BY-SA 4.0) states: Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","support":[{"end":351,"quote":"Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","source_id":"wikipedia.article.analog-signal-processing","source_sha256":"d1d7895b1592341179ea2dd732726aec15eb59f2c03e14ea421b715a57c7740c","start":110}],"target_id":"concept.wikipedia.analog-signal-processing","target_kind":"node","target_sha256":"23137c3a762243292099379490d8b8fa52b3c5b4e4b07828ac5a26e332161e1a"}],"concept.wikipedia.analog-to-digital-converter":[{"id":"assertion.concept.wikipedia.analog-to-digital-converter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog-to-digital converter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog-to-digital converter\", CC BY-SA 4.0) states: In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","support":[{"end":357,"quote":"In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","source_id":"wikipedia.article.analog-to-digital-converter","source_sha256":"f59ee3072b8ea2120851eeccf7148640d2f4397a618783579284da746ba4aba7","start":112}],"target_id":"concept.wikipedia.analog-to-digital-converter","target_kind":"node","target_sha256":"8d1b25339c1e79a96c55a3d5133944bf989bcbccc8c61083589b3cfe4e0ba1ce"}],"concept.wikipedia.analogue-electronics":[{"id":"assertion.concept.wikipedia.analogue-electronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogue electronics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogue electronics\", CC BY-SA 4.0) states: Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","support":[{"end":305,"quote":"Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","source_id":"wikipedia.article.analogue-electronics","source_sha256":"9e5ead582992b2d34655be5a74604861f945f43d598d6c8323086eb9906e998a","start":107}],"target_id":"concept.wikipedia.analogue-electronics","target_kind":"node","target_sha256":"64810c69743bdadccff95f66cee87e4046ef34ad18e7972f18c9e214ce346ec9"}],"concept.wikipedia.analogy":[{"id":"assertion.concept.wikipedia.analogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogy\", CC BY-SA 4.0) states: Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","support":[{"end":241,"quote":"Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","source_id":"wikipedia.article.analogy","source_sha256":"f389735a8d535a14bd10cb492303ed779338473510a7cb8ad79ae4e1fc7ea2e6","start":93}],"target_id":"concept.wikipedia.analogy","target_kind":"node","target_sha256":"91bfb103b1424b8be41ce2f8a238acf21bd24141d7f4f7f89274c64ceea0bd8f"}],"concept.wikipedia.analogy-of-the-divided-line":[{"id":"assertion.concept.wikipedia.analogy-of-the-divided-line","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogy of the divided line as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogy of the divided line\", CC BY-SA 4.0) states: The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","support":[{"end":290,"quote":"The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","source_id":"wikipedia.article.analogy-of-the-divided-line","source_sha256":"630c4d66a068fa791acc7f9b5fd94ff01f741f6cb3fa35150bff0e8f8fda19cb","start":112}],"target_id":"concept.wikipedia.analogy-of-the-divided-line","target_kind":"node","target_sha256":"3c52733e14a8c8ae0590f096470185ffdfa13d99622b43d02e0583f0c88e64e4"}],"concept.wikipedia.analysis-of-competing-hypotheses":[{"id":"assertion.concept.wikipedia.analysis-of-competing-hypotheses","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analysis of competing hypotheses as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analysis of competing hypotheses\", CC BY-SA 4.0) states: The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","support":[{"end":242,"quote":"The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","source_id":"wikipedia.article.analysis-of-competing-hypotheses","source_sha256":"6fa78c7f4203b011c57a342017019fda3618bada198a1b59d1c52b2eec31f273","start":119}],"target_id":"concept.wikipedia.analysis-of-competing-hypotheses","target_kind":"node","target_sha256":"2e13c43dda84b11e5ae2cb7aaf6762336a13289a627c604c7e2a92d7436f6574"}],"concept.wikipedia.analytic-hierarchy-process":[{"id":"assertion.concept.wikipedia.analytic-hierarchy-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic hierarchy process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic hierarchy process\", CC BY-SA 4.0) states: In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","support":[{"end":330,"quote":"In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","source_id":"wikipedia.article.analytic-hierarchy-process","source_sha256":"5ea2c91d1453f637b320386340b34a74f9854d6a1373bc3597d6cdbfe260d4dd","start":113}],"target_id":"concept.wikipedia.analytic-hierarchy-process","target_kind":"node","target_sha256":"58114bf8e35a3158c39273a08cce7adf0a17824520901f67ccbc3d9998385331"}],"concept.wikipedia.analytic-proof":[{"id":"assertion.concept.wikipedia.analytic-proof","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic proof as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic proof\", CC BY-SA 4.0) states: In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","support":[{"end":294,"quote":"In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","source_id":"wikipedia.article.analytic-proof","source_sha256":"9a347e1328b219141256af1045728668584c03dfe7dc3c899467180243b329ee","start":101}],"target_id":"concept.wikipedia.analytic-proof","target_kind":"node","target_sha256":"3e14a961585f524c99d1d5180ea23edd0cf60b7428c1f7a6606a9823be5c3da7"}],"concept.wikipedia.analytic-reasoning":[{"id":"assertion.concept.wikipedia.analytic-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic reasoning\", CC BY-SA 4.0) states: Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","support":[{"end":297,"quote":"Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","source_id":"wikipedia.article.analytic-reasoning","source_sha256":"1ab225adb5533019f249857075504d1dcb96392fabdd5e5e066d68327278183c","start":105}],"target_id":"concept.wikipedia.analytic-reasoning","target_kind":"node","target_sha256":"aa9891dad3f12f633e3e588a9ea2b8f50ae3c546d8f25d7d5cdade70fa1fb0a7"}],"concept.wikipedia.analytic-semigroup":[{"id":"assertion.concept.wikipedia.analytic-semigroup","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic semigroup as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic semigroup\", CC BY-SA 4.0) states: In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","support":[{"end":196,"quote":"In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","source_id":"wikipedia.article.analytic-semigroup","source_sha256":"c8f518ceba69bb839b48a1cae55f14acf8e1e083ae7a2f522fbec41d75aa956b","start":106}],"target_id":"concept.wikipedia.analytic-semigroup","target_kind":"node","target_sha256":"c5107cadfde4523814a85585072b107e29ba2246ec076d26bd73129efd2885fc"}],"concept.wikipedia.analytic-signal":[{"id":"assertion.concept.wikipedia.analytic-signal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic signal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic signal\", CC BY-SA 4.0) states: In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","support":[{"end":229,"quote":"In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","source_id":"wikipedia.article.analytic-signal","source_sha256":"19879fee641c7aebe6bb8c339360f3b91a483285d2c44f11d37b409b45bde206","start":101}],"target_id":"concept.wikipedia.analytic-signal","target_kind":"node","target_sha256":"b25f8196a73b92107c4dac967cf7e503110c6566a7500760e71db80dcc4dc730"}],"concept.wikipedia.analytic-synthetic-distinction":[{"id":"assertion.concept.wikipedia.analytic-synthetic-distinction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic–synthetic distinction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic–synthetic distinction\", CC BY-SA 4.0) states: The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","support":[{"end":392,"quote":"The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","source_id":"wikipedia.article.analytic-synthetic-distinction","source_sha256":"4a03bd563175fd700caace56ca570a79942fa7e0c86bd77a72f57f1adaed57f3","start":117}],"target_id":"concept.wikipedia.analytic-synthetic-distinction","target_kind":"node","target_sha256":"30cee2038897dd0f7a5e20a4acbef882fe9caf833dec4cf0ab2f6c21950f2cee"}],"concept.wikipedia.analytical-chemistry":[{"id":"assertion.concept.wikipedia.analytical-chemistry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytical chemistry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytical chemistry\", CC BY-SA 4.0) states: Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","support":[{"end":334,"quote":"Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","source_id":"wikipedia.article.analytical-chemistry","source_sha256":"0186d5558c6b6a85f0870e7c56cc8e3a99de0d1a87d4a6689079e7e8e71c31c1","start":104}],"target_id":"concept.wikipedia.analytical-chemistry","target_kind":"node","target_sha256":"af458c9800b0f46a891435dd8385af2190a0954b9126f1aebd41a15ab87db93d"}],"concept.wikipedia.analytical-hierarchy":[{"id":"assertion.concept.wikipedia.analytical-hierarchy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytical hierarchy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytical hierarchy\", CC BY-SA 4.0) states: In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","support":[{"end":227,"quote":"In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","source_id":"wikipedia.article.analytical-hierarchy","source_sha256":"e7eadb010362c40446c3bbce6b270d9f168561beff5022895e778b3438e85025","start":106}],"target_id":"concept.wikipedia.analytical-hierarchy","target_kind":"node","target_sha256":"9911dcbfbf84bab1bc4de76325e569f64d1c134c24a41b6f4669492719d42b8b"}],"concept.wikipedia.anamorphism":[{"id":"assertion.concept.wikipedia.anamorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anamorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anamorphism\", CC BY-SA 4.0) states: In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","support":[{"end":241,"quote":"In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","source_id":"wikipedia.article.anamorphism","source_sha256":"fdca7b5d0d3f962a9829189b84c7e7d9a45e95505879a6273b4531783e666a01","start":98}],"target_id":"concept.wikipedia.anamorphism","target_kind":"node","target_sha256":"541167992b6d285216b9d9e42e7224e29d09565d69e570c2d7b515a604536871"}],"concept.wikipedia.anchor-channel":[{"id":"assertion.concept.wikipedia.anchor-channel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anchor channel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anchor channel\", CC BY-SA 4.0) states: Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","support":[{"end":292,"quote":"Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","source_id":"wikipedia.article.anchor-channel","source_sha256":"682308d680e4b18d5ac036adeac4e3b34b2a09726351c5bf27c121b12ad94540","start":102}],"target_id":"concept.wikipedia.anchor-channel","target_kind":"node","target_sha256":"2d56cda7a1faed5d1c3c57ea0b04dd76af10ec070aa3fce10701eae90b6782be"}],"concept.wikipedia.anchoring-effect":[{"id":"assertion.concept.wikipedia.anchoring-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anchoring effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anchoring effect\", CC BY-SA 4.0) states: The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \"anchor\" which can be completely irrelevant.","support":[{"end":286,"quote":"The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \\\"anchor\\\" which can be completely irrelevant.","source_id":"wikipedia.article.anchoring-effect","source_sha256":"94482ae9976df9d87e1d41de5ca50b29dcffef3a6e29ccb4ec3c97566905d0ec","start":102}],"target_id":"concept.wikipedia.anchoring-effect","target_kind":"node","target_sha256":"609678b87c25fa6770cd54c2190f4f2a176ae13d441e0c8b1594bf6539a864f0"}],"concept.wikipedia.anderson-acceleration":[{"id":"assertion.concept.wikipedia.anderson-acceleration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anderson acceleration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anderson acceleration\", CC BY-SA 4.0) states: In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","support":[{"end":260,"quote":"In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","source_id":"wikipedia.article.anderson-acceleration","source_sha256":"e371757a02107ba74d6652da0fc07e7c57ca36ef4c7df029edc8258f86dd999c","start":109}],"target_id":"concept.wikipedia.anderson-acceleration","target_kind":"node","target_sha256":"a0df60b5de2fab124c53152d415acef16ca2deeb63137da892bbe2cd1d17da88"}],"concept.wikipedia.andr-quillen-cohomology":[{"id":"assertion.concept.wikipedia.andr-quillen-cohomology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"André–Quillen cohomology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"André–Quillen cohomology\", CC BY-SA 4.0) states: In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","support":[{"end":288,"quote":"In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","source_id":"wikipedia.article.andr-quillen-cohomology","source_sha256":"4ea1372cc27e9abe9fad583236a028a4d027d8a8c4cd8680b1b3132c3f119c38","start":112}],"target_id":"concept.wikipedia.andr-quillen-cohomology","target_kind":"node","target_sha256":"ac86cf3bf3bd235bce3d35024d02443269af85270ffc30a5c37b624b7e663fdf"}],"concept.wikipedia.android-epistemology":[{"id":"assertion.concept.wikipedia.android-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Android epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Android epistemology\", CC BY-SA 4.0) states: Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","support":[{"end":316,"quote":"Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","source_id":"wikipedia.article.android-epistemology","source_sha256":"b381a32981867a92f8a32be9777aa0d3aab93383c7117e7946eafb495b401675","start":107}],"target_id":"concept.wikipedia.android-epistemology","target_kind":"node","target_sha256":"32671c35ecc12b7c9e7f5914099302a7f7ee0bf6e31eaecdacdffaddd6ee7e58"}],"concept.wikipedia.andronov-pontryagin-criterion":[{"id":"assertion.concept.wikipedia.andronov-pontryagin-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Andronov–Pontryagin criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Andronov–Pontryagin criterion\", CC BY-SA 4.0) states: The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","support":[{"end":243,"quote":"The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","source_id":"wikipedia.article.andronov-pontryagin-criterion","source_sha256":"b4d89f16fe3258d128db2f551347ec7d4e8f361bd3f95a3ac2f422f684275b73","start":117}],"target_id":"concept.wikipedia.andronov-pontryagin-criterion","target_kind":"node","target_sha256":"5104004190bb1054992fa60a63e84b05c99e2e3a1ff1a3d212c0dde15513af44"}],"concept.wikipedia.anecdotal-evidence":[{"id":"assertion.concept.wikipedia.anecdotal-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anecdotal evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anecdotal evidence\", CC BY-SA 4.0) states: Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","support":[{"end":274,"quote":"Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","source_id":"wikipedia.article.anecdotal-evidence","source_sha256":"4e27c363d7a14b13e58393b3fd00670f9c32f89521bb586576f251a650ea68f9","start":104}],"target_id":"concept.wikipedia.anecdotal-evidence","target_kind":"node","target_sha256":"75ae30c724cda7bcf0883e7ececab7b3f1592ff7ea7111ef12eefdb89e7b558d"}],"concept.wikipedia.anfinsen-s-dogma":[{"id":"assertion.concept.wikipedia.anfinsen-s-dogma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anfinsen's dogma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anfinsen's dogma\", CC BY-SA 4.0) states: Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","support":[{"end":201,"quote":"Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","source_id":"wikipedia.article.anfinsen-s-dogma","source_sha256":"e146e2682491a34170cb7b4289c8822fd3e73e8cf31071f14ed219fa8b40830b","start":103}],"target_id":"concept.wikipedia.anfinsen-s-dogma","target_kind":"node","target_sha256":"582627d04e74788a9931b8a34b04ab7c0492effab9632cce12acb2fca22be7a7"}],"concept.wikipedia.angelescu-polynomials":[{"id":"assertion.concept.wikipedia.angelescu-polynomials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angelescu polynomials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angelescu polynomials\", CC BY-SA 4.0) states: In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","support":[{"end":253,"quote":"In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","source_id":"wikipedia.article.angelescu-polynomials","source_sha256":"21d416ee38be2ad09d0a2a8afba3ae3f83f472140d1b741d1c9dacbd7c95dc7e","start":109}],"target_id":"concept.wikipedia.angelescu-polynomials","target_kind":"node","target_sha256":"146efc8d84cfb0c4ad03eb4b2c207aca0e8252d8d6a8910d182ae411ace56755"}],"concept.wikipedia.angle-bracket-fastener":[{"id":"assertion.concept.wikipedia.angle-bracket-fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angle bracket (fastener) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angle bracket (fastener)\", CC BY-SA 4.0) states: An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","support":[{"end":237,"quote":"An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","source_id":"wikipedia.article.angle-bracket-fastener","source_sha256":"df2485c01e79e5ae5f99dba0865ce95742487d3477c5c011a4b0c4fb1759cbca","start":112}],"target_id":"concept.wikipedia.angle-bracket-fastener","target_kind":"node","target_sha256":"8777b3eb58b7e1ecbdc653085e5a7ed3471d10fc3a1fd3bfbfe6204077016832"}],"concept.wikipedia.angle-of-arrival":[{"id":"assertion.concept.wikipedia.angle-of-arrival","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angle of arrival as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angle of arrival\", CC BY-SA 4.0) states: The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","support":[{"end":227,"quote":"The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","source_id":"wikipedia.article.angle-of-arrival","source_sha256":"31cc2ec242b6e2bee264d447663c795c23b4fcbf3a36eafaa0cd79322977a2e0","start":103}],"target_id":"concept.wikipedia.angle-of-arrival","target_kind":"node","target_sha256":"ce58f418cbe8c098b94efdc1fe08102147939045164005bdc0952219eeaf9da3"}],"concept.wikipedia.angular-rate-sensor":[{"id":"assertion.concept.wikipedia.angular-rate-sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angular rate sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angular rate sensor\", CC BY-SA 4.0) states: Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","support":[{"end":230,"quote":"Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","source_id":"wikipedia.article.angular-rate-sensor","source_sha256":"ee60c4cc25b5f1fb6c81378c26f53433b7a219bf2de064be044ec2cc2fadec3c","start":107}],"target_id":"concept.wikipedia.angular-rate-sensor","target_kind":"node","target_sha256":"3b1c31f665afe35bb4ce3fa67a3955e4b444cabe4d9a7ef52e327c91ea7ef746"}],"concept.wikipedia.annealing-materials-science":[{"id":"assertion.concept.wikipedia.annealing-materials-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Annealing (materials science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Annealing (materials science)\", CC BY-SA 4.0) states: In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","support":[{"end":331,"quote":"In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","source_id":"wikipedia.article.annealing-materials-science","source_sha256":"d910aa86454897794fc8bc6fdcb3d20a05171c8dcb8b310ab7a61d895cfdde59","start":116}],"target_id":"concept.wikipedia.annealing-materials-science","target_kind":"node","target_sha256":"986a987dc893e86da58e26abe35f39863cf3290b820371154b0fc32b91af3535"}],"concept.wikipedia.anosov-diffeomorphism":[{"id":"assertion.concept.wikipedia.anosov-diffeomorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anosov diffeomorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anosov diffeomorphism\", CC BY-SA 4.0) states: In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \"expansion\" and \"contraction\".","support":[{"end":360,"quote":"In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \\\"expansion\\\" and \\\"contraction\\\".","source_id":"wikipedia.article.anosov-diffeomorphism","source_sha256":"ed936108feb42c21f87572c9df9db167260374be938d2c12b36215f89a7ca420","start":108}],"target_id":"concept.wikipedia.anosov-diffeomorphism","target_kind":"node","target_sha256":"3683614e9146c49551d1b2ea8bd4fd7251d38566782f01dbf46414d5c2f04536"}],"concept.wikipedia.anthrobotics":[{"id":"assertion.concept.wikipedia.anthrobotics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anthrobotics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anthrobotics\", CC BY-SA 4.0) states: Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","support":[{"end":212,"quote":"Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","source_id":"wikipedia.article.anthrobotics","source_sha256":"1b83c43f15874e9c2e8900648811b637eefca9693328c81b95227529a9e06dbc","start":99}],"target_id":"concept.wikipedia.anthrobotics","target_kind":"node","target_sha256":"39668faa372be218dc0442a1e51e05aad1576c2b25b225bdf6330eadcca54920"}],"concept.wikipedia.anthropic-principle":[{"id":"assertion.concept.wikipedia.anthropic-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anthropic principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anthropic principle\", CC BY-SA 4.0) states: In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","support":[{"end":426,"quote":"In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","source_id":"wikipedia.article.anthropic-principle","source_sha256":"1f33ad20a907cc161060e4b63bc986b5b5ddacc0004fab73621b5e5021a806ae","start":103}],"target_id":"concept.wikipedia.anthropic-principle","target_kind":"node","target_sha256":"2e5fe82808a44fa20ff66344a19be9566390dacc1c9ba181ac222cf81284cb2b"}],"concept.wikipedia.anti-twister-mechanism":[{"id":"assertion.concept.wikipedia.anti-twister-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anti-twister mechanism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anti-twister mechanism\", CC BY-SA 4.0) states: The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","support":[{"end":319,"quote":"The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","source_id":"wikipedia.article.anti-twister-mechanism","source_sha256":"73fbb2b2660c409c01cf8115d3cebf866b42b74feec1b9fd5a81bb5e3d97a595","start":108}],"target_id":"concept.wikipedia.anti-twister-mechanism","target_kind":"node","target_sha256":"76c76fde2537a36a922d4579e4c70df2880aae74efe01af8ecebe2b5c58794b8"}],"concept.wikipedia.anticausal-system":[{"id":"assertion.concept.wikipedia.anticausal-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anticausal system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anticausal system\", CC BY-SA 4.0) states: In systems theory, an anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","support":[{"end":246,"quote":"In systems theory, an  anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","source_id":"wikipedia.article.anticausal-system","source_sha256":"ffe588603becac5aa32087c26ba3a5190380a581062531d364fff9a650c2d912","start":105}],"target_id":"concept.wikipedia.anticausal-system","target_kind":"node","target_sha256":"5b5c656d9af5afc6a43820d484fd38b7846cd568cd81baff460045376c528113"}],"concept.wikipedia.antieigenvalue-theory":[{"id":"assertion.concept.wikipedia.antieigenvalue-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antieigenvalue theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antieigenvalue theory\", CC BY-SA 4.0) states: In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","support":[{"end":205,"quote":"In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","source_id":"wikipedia.article.antieigenvalue-theory","source_sha256":"5c9152bf8bd1b1f282aa9bd32dbe00137090172b39d7785e1f5544d5976fd92b","start":109}],"target_id":"concept.wikipedia.antieigenvalue-theory","target_kind":"node","target_sha256":"3a1a96b28154cc63958b8b357a427a1274f1f2179a6fcb0852351bd48e7c71de"}],"concept.wikipedia.antifragility":[{"id":"assertion.concept.wikipedia.antifragility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antifragility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antifragility\", CC BY-SA 4.0) states: Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","support":[{"end":279,"quote":"Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","source_id":"wikipedia.article.antifragility","source_sha256":"62e33aa735c1fb315973d40f18410a60765aafbd886dcc70be1ecf1c993d428d","start":101}],"target_id":"concept.wikipedia.antifragility","target_kind":"node","target_sha256":"6dad967819663d717d801e01c83f50e950f5f624ae3be86c7c7cb53cf127ab9e"}],"concept.wikipedia.antiholomorphic-function":[{"id":"assertion.concept.wikipedia.antiholomorphic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiholomorphic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiholomorphic function\", CC BY-SA 4.0) states: In mathematics, antiholomorphic functions (also called antianalytic functions) are a family of functions closely related to but distinct from holomorphic functions.","support":[{"end":276,"quote":"In mathematics,  antiholomorphic functions (also called antianalytic functions) are a family of  functions closely related to but distinct from holomorphic functions.","source_id":"wikipedia.article.antiholomorphic-function","source_sha256":"062e1f01cb489fc5e309fdc30edd7f572a2df151c8578432047c3c3935529561","start":110}],"target_id":"concept.wikipedia.antiholomorphic-function","target_kind":"node","target_sha256":"e312d450d008534d6cffa8ce2385d2dfd444ff808c2fc9ebb995d644ba0b4266"}],"concept.wikipedia.antiisomorphism":[{"id":"assertion.concept.wikipedia.antiisomorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiisomorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiisomorphism\", CC BY-SA 4.0) states: In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","support":[{"end":312,"quote":"In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","source_id":"wikipedia.article.antiisomorphism","source_sha256":"acc6ae5350019c48844c8d9d9368d22c2cce8fdee71eaf19be63c5d02af4f94c","start":102}],"target_id":"concept.wikipedia.antiisomorphism","target_kind":"node","target_sha256":"4ecdadfedb0aa9de9d276823a76349f8319b81aac2050ffaf723cbe3f846d3af"}],"concept.wikipedia.antimatroid":[{"id":"assertion.concept.wikipedia.antimatroid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antimatroid as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antimatroid\", CC BY-SA 4.0) states: In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","support":[{"end":330,"quote":"In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","source_id":"wikipedia.article.antimatroid","source_sha256":"b834c97500753a56d77c537c5bb27c0c777d5bd5b19eb1ae01a9f91fef7f2e05","start":97}],"target_id":"concept.wikipedia.antimatroid","target_kind":"node","target_sha256":"d901b7970feba87d9d5e134f3d83095fe55169b6e78d8c2bdfcd3e1afd51e963"}],"concept.wikipedia.antinomy":[{"id":"assertion.concept.wikipedia.antinomy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antinomy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antinomy\", CC BY-SA 4.0) states: In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","support":[{"end":257,"quote":"In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","source_id":"wikipedia.article.antinomy","source_sha256":"08b4918b55b56bbd6c1be2ea8c5a81a46a4194ad8667ddfe9e5cbb6608d77561","start":92}],"target_id":"concept.wikipedia.antinomy","target_kind":"node","target_sha256":"52a926824df7b0dfdcc9339d2af10bf54919d99a058d4e96dc1c6cadaf2b935c"}],"concept.wikipedia.antipedagogy":[{"id":"assertion.concept.wikipedia.antipedagogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antipedagogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antipedagogy\", CC BY-SA 4.0) states: Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","support":[{"end":430,"quote":"Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","source_id":"wikipedia.article.antipedagogy","source_sha256":"0c30118ccd965943772a027caaf5882b1d0c719ad0db7ce2a406eda50902cc4e","start":100}],"target_id":"concept.wikipedia.antipedagogy","target_kind":"node","target_sha256":"f712ecc286faa3abbd9b2c8e406c1ef5b2c92547430800394a3b256598db8cdc"}],"concept.wikipedia.antipositivism":[{"id":"assertion.concept.wikipedia.antipositivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antipositivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antipositivism\", CC BY-SA 4.0) states: In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","support":[{"end":415,"quote":"In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","source_id":"wikipedia.article.antipositivism","source_sha256":"1ea5f782e64aae3e073533c8436d27f9315435f41365bf247783bf1f5c2dde77","start":101}],"target_id":"concept.wikipedia.antipositivism","target_kind":"node","target_sha256":"ec42fe0a98a196420b369a932a07d2acde25a7cb0ad04bd0779727dfae6dd8ee"}],"concept.wikipedia.antireductionism":[{"id":"assertion.concept.wikipedia.antireductionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antireductionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antireductionism\", CC BY-SA 4.0) states: Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","support":[{"end":341,"quote":"Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","source_id":"wikipedia.article.antireductionism","source_sha256":"110a104aee502b4b0bc2db858caca1cc1d694d08c067b40c1e1e20e0a4a6942e","start":103}],"target_id":"concept.wikipedia.antireductionism","target_kind":"node","target_sha256":"fc17ebeb05ba0a2e7d7b2e9e359c751e7bc5dbde38abf5f730a52be9a41ee99f"}],"concept.wikipedia.antiscience":[{"id":"assertion.concept.wikipedia.antiscience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiscience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiscience\", CC BY-SA 4.0) states: Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","support":[{"end":230,"quote":"Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","source_id":"wikipedia.article.antiscience","source_sha256":"2e4b2df04057ee783eaf901891faa63a539ef875e910e455df82ea0a51607ea0","start":98}],"target_id":"concept.wikipedia.antiscience","target_kind":"node","target_sha256":"fed84c7e7492ff346190c3c9b81b6f6202823515dbb791ca7bc9bddb21871266"}],"concept.wikipedia.antoine-s-necklace":[{"id":"assertion.concept.wikipedia.antoine-s-necklace","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antoine's necklace as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antoine's necklace\", CC BY-SA 4.0) states: In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","support":[{"end":261,"quote":"In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","source_id":"wikipedia.article.antoine-s-necklace","source_sha256":"29a4da7ca5747558999d1c4cfea5fc8adff9c51d037b118016f2bf1cc76a9684","start":106}],"target_id":"concept.wikipedia.antoine-s-necklace","target_kind":"node","target_sha256":"bf1dd69cd376bacb922c8f2df5d7e34b3bee69c5b71f9efd8aa5228e106c5df3"}],"concept.wikipedia.apodicticity":[{"id":"assertion.concept.wikipedia.apodicticity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apodicticity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apodicticity\", CC BY-SA 4.0) states: \"Apodictic\", also spelled \"apodeictic\" (Ancient Greek: ἀποδεικτικός, \"capable of demonstration\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","support":[{"end":341,"quote":"\\\"Apodictic\\\", also spelled \\\"apodeictic\\\" (Ancient Greek: ἀποδεικτικός, \\\"capable of demonstration\\\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","source_id":"wikipedia.article.apodicticity","source_sha256":"f7a64e53ee6fa4855d9d7bab4853a6bed029ea1f8ab641d801d8cc7b68e1e5d7","start":99}],"target_id":"concept.wikipedia.apodicticity","target_kind":"node","target_sha256":"e32b3080c80a4a47f452882a8ce84603a6555d91e5b484a2d21f6c8457f4c98a"}],"concept.wikipedia.apodization":[{"id":"assertion.concept.wikipedia.apodization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apodization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apodization\", CC BY-SA 4.0) states: In signal processing, apodization (from Greek \"removing the foot\") is the modification of the shape of a mathematical function.","support":[{"end":227,"quote":"In signal processing, apodization (from Greek \\\"removing the foot\\\") is the modification of the shape of a mathematical function.","source_id":"wikipedia.article.apodization","source_sha256":"7f0ab39f33d29e7ce845ede62b993dfee08a5d0226b0bd7e348f55ab3af50df9","start":98}],"target_id":"concept.wikipedia.apodization","target_kind":"node","target_sha256":"5e08cf857d8bc1d5cc97a29d9f8741a73c6a2276ab88f7a417c01ae683078276"}],"concept.wikipedia.apoha":[{"id":"assertion.concept.wikipedia.apoha","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apoha as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apoha\", CC BY-SA 4.0) states: Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","support":[{"end":253,"quote":"Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","source_id":"wikipedia.article.apoha","source_sha256":"16c3154c948ec588d614b0e22471e760aaafab015088b6b21d57123ae6201714","start":93}],"target_id":"concept.wikipedia.apoha","target_kind":"node","target_sha256":"037fea7ef31acf2aae1a486232b870efdb58254e2d0c66692d5d46e81861ab6e"}],"concept.wikipedia.apophantic":[{"id":"assertion.concept.wikipedia.apophantic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apophantic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apophantic\", CC BY-SA 4.0) states: In logic, Apophantic (Greek: ἀποφαντικός, \"declaratory\", from ἀποφαίνειν apophainein, \"to show, to make known\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","support":[{"end":366,"quote":"In logic, Apophantic (Greek: ἀποφαντικός, \\\"declaratory\\\", from ἀποφαίνειν apophainein, \\\"to show, to make known\\\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","source_id":"wikipedia.article.apophantic","source_sha256":"ac989fe4e16a895df6fca30213c7a35e74c6136500b26f7ab9134793a7968f88","start":98}],"target_id":"concept.wikipedia.apophantic","target_kind":"node","target_sha256":"f614624d5814d98ccddb5842db747148a0d21833725cd2f20acd3e5f668d7dac"}],"concept.wikipedia.apophenia":[{"id":"assertion.concept.wikipedia.apophenia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apophenia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apophenia\", CC BY-SA 4.0) states: Apophenia () is the tendency to perceive meaningful connections between unrelated things.","support":[{"end":184,"quote":"Apophenia () is the tendency to perceive meaningful connections between unrelated things.","source_id":"wikipedia.article.apophenia","source_sha256":"3ba090c7100adc5f39192f5975c2b22413eb369194bf6665074ba0dc9763984a","start":95}],"target_id":"concept.wikipedia.apophenia","target_kind":"node","target_sha256":"258606f9b2cc88c7054217415fd2ddd515789457dbb5389cc3203e4a1036c3fc"}],"concept.wikipedia.aporia":[{"id":"assertion.concept.wikipedia.aporia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aporia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aporia\", CC BY-SA 4.0) states: In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\"lacking passage\", also: \"impasse\", \"difficulty in passage\", \"puzzlement\"') is a conundrum or state of puzzlement.","support":[{"end":290,"quote":"In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\\\"lacking passage\\\", also: \\\"impasse\\\", \\\"difficulty in passage\\\", \\\"puzzlement\\\"') is a conundrum or state of puzzlement.","source_id":"wikipedia.article.aporia","source_sha256":"fbdb97b58d3097cec8b0d75aa10ad02470d83dc285f3876f00b1411d22bb20be","start":92}],"target_id":"concept.wikipedia.aporia","target_kind":"node","target_sha256":"af05f8813557c5a660471279783f9e3fb2ff208d19f56bab45edb8fc9b505d32"}],"concept.wikipedia.appeal-to-the-law":[{"id":"assertion.concept.wikipedia.appeal-to-the-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appeal to the law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appeal to the law\", CC BY-SA 4.0) states: An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","support":[{"end":328,"quote":"An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","source_id":"wikipedia.article.appeal-to-the-law","source_sha256":"0d698ed50264133a4bd6fd20e01a11e566871bfdb79f82721d08a65ca0c16662","start":105}],"target_id":"concept.wikipedia.appeal-to-the-law","target_kind":"node","target_sha256":"ffde03712c734b8ed06d5f33db559df19f9631527e580bbd56cb2bf408ca81c7"}],"concept.wikipedia.appeal-to-the-stone":[{"id":"assertion.concept.wikipedia.appeal-to-the-stone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appeal to the stone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appeal to the stone\", CC BY-SA 4.0) states: Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","support":[{"end":232,"quote":"Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","source_id":"wikipedia.article.appeal-to-the-stone","source_sha256":"3b9b2ed9a6891b6b4e83a59d1f00a976f13a56f1f866e811c901f27788d4780f","start":106}],"target_id":"concept.wikipedia.appeal-to-the-stone","target_kind":"node","target_sha256":"d79a024d7da55b2569fc4083a391e9ead7f6e16dad390baea5eaa0f84bb2ec2b"}],"concept.wikipedia.apperception":[{"id":"assertion.concept.wikipedia.apperception","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apperception as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apperception\", CC BY-SA 4.0) states: Apperception (from the Latin ad-, \"to, toward\" and percipere, \"to perceive, gain, secure, learn, or feel\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","support":[{"end":326,"quote":"Apperception (from the Latin ad-, \\\"to, toward\\\" and percipere, \\\"to perceive, gain, secure, learn, or feel\\\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","source_id":"wikipedia.article.apperception","source_sha256":"9c4608398e8efdf21ae20ca0a3cee905d2c88a4cd28629a4eab47911c84c4323","start":99}],"target_id":"concept.wikipedia.apperception","target_kind":"node","target_sha256":"e73d87d53dc518fe16b78fb1a3f617fb2f7af7f53e4e6175b947d21aad7eb905"}],"concept.wikipedia.application-layer-framing":[{"id":"assertion.concept.wikipedia.application-layer-framing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Application-layer framing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Application-layer framing\", CC BY-SA 4.0) states: Application-layer framing or application-level framing (ALF) is a method of allowing an application to use its semantics for the design of its network protocols.","support":[{"end":276,"quote":"Application-layer framing or application-level framing (ALF)  is a method of allowing  an application to use its semantics for the design of its network protocols.","source_id":"wikipedia.article.application-layer-framing","source_sha256":"a38df14053459ccdff415bb75e3e4d978666802862efe56baf82855397477c7d","start":113}],"target_id":"concept.wikipedia.application-layer-framing","target_kind":"node","target_sha256":"a838f2460345fed18f498e65d3234818af120cc3b5b6d7db17376d7a315a4071"}],"concept.wikipedia.applied-epistemology":[{"id":"assertion.concept.wikipedia.applied-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied epistemology\", CC BY-SA 4.0) states: Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","support":[{"end":259,"quote":"Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","source_id":"wikipedia.article.applied-epistemology","source_sha256":"ee734d5bfbb92aac8c3dcaaa0fe66ed896554869e114cf24a2e136d7de8652f0","start":108}],"target_id":"concept.wikipedia.applied-epistemology","target_kind":"node","target_sha256":"e6fe525c977d862124b72a6a8f1fbb7509d2cce5750b435aeb05944e8998191b"}],"concept.wikipedia.applied-physics":[{"id":"assertion.concept.wikipedia.applied-physics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied physics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied physics\", CC BY-SA 4.0) states: Applied physics is the application of physics to solve scientific or engineering problems.","support":[{"end":192,"quote":"Applied physics is the application of physics to solve scientific or engineering problems.","source_id":"wikipedia.article.applied-physics","source_sha256":"5ee3c3909630d4db10f4eaff4816b615c1e29162b539b06b45b45c053e740864","start":102}],"target_id":"concept.wikipedia.applied-physics","target_kind":"node","target_sha256":"1edc393af439d05349facaef62dea9a6252ccdcb8b33002d7e41f5b0f3db9bec"}],"concept.wikipedia.appropriation-of-knowledge":[{"id":"assertion.concept.wikipedia.appropriation-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appropriation of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appropriation of knowledge\", CC BY-SA 4.0) states: Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","support":[{"end":261,"quote":"Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","source_id":"wikipedia.article.appropriation-of-knowledge","source_sha256":"61e806bbd97e9aed4f4018b0fa5d5cc8ac0d2c84c5b25a3da1a9b821488b1047","start":114}],"target_id":"concept.wikipedia.appropriation-of-knowledge","target_kind":"node","target_sha256":"c6556c45d50cf8bbacb0cfac6bf406f707a21a70fece3e6f22f0f51767005ba0"}],"concept.wikipedia.approximate-fibration":[{"id":"assertion.concept.wikipedia.approximate-fibration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate fibration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate fibration\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","support":[{"end":270,"quote":"In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","source_id":"wikipedia.article.approximate-fibration","source_sha256":"6c9b8ad6393aeacabb7d438cc304e130c98e8fc32c275ffe0bb70bee12c57fdc","start":109}],"target_id":"concept.wikipedia.approximate-fibration","target_kind":"node","target_sha256":"c1353d4c9910fce27f4c2efb13e5e731aa29ed81c42c26928e45ae9d5bb047dd"}],"concept.wikipedia.approximate-group":[{"id":"assertion.concept.wikipedia.approximate-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate group\", CC BY-SA 4.0) states: In mathematics, an approximate group is a subset of a group which behaves like a subgroup \"up to a constant error\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","support":[{"end":310,"quote":"In mathematics, an approximate group is a subset of a group which behaves like a subgroup \\\"up to a constant error\\\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","source_id":"wikipedia.article.approximate-group","source_sha256":"2b64a30a2b67d13bdc2541009ddd72305517d3f0c9b05df35f38a48ba777bc1c","start":105}],"target_id":"concept.wikipedia.approximate-group","target_kind":"node","target_sha256":"733c8a20848248578cf20c2f44bd833ad9e875d7da138156e040e6cd0ad17b41"}],"concept.wikipedia.approximate-limit":[{"id":"assertion.concept.wikipedia.approximate-limit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate limit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate limit\", CC BY-SA 4.0) states: In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","support":[{"end":237,"quote":"In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","source_id":"wikipedia.article.approximate-limit","source_sha256":"a0b2e7164954224113bfc7a597b011bc4382827f24264ec14892fed374d259aa","start":105}],"target_id":"concept.wikipedia.approximate-limit","target_kind":"node","target_sha256":"f72925fb987dc0feb3e3a73255d649b13a0f4d2c560c6c1bba42d111d8f21160"}],"concept.wikipedia.approximate-measures":[{"id":"assertion.concept.wikipedia.approximate-measures","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate measures as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate measures\", CC BY-SA 4.0) states: Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","support":[{"end":321,"quote":"Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","source_id":"wikipedia.article.approximate-measures","source_sha256":"17842d3f2ddf555845daa2ca60da76d8dcc5e93a62cfb8507a201bdca32eb9cb","start":108}],"target_id":"concept.wikipedia.approximate-measures","target_kind":"node","target_sha256":"f2647092c8ecde7869806233bdfe395521dc0cb196a3dc84ec080e7fbd00a9b9"}],"concept.wikipedia.approximate-tangent-space":[{"id":"assertion.concept.wikipedia.approximate-tangent-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate tangent space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate tangent space\", CC BY-SA 4.0) states: In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","support":[{"end":272,"quote":"In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","source_id":"wikipedia.article.approximate-tangent-space","source_sha256":"128ecb04b04768775065f28c4002a8d3d7d37546e577145f8edc5ac29185d482","start":113}],"target_id":"concept.wikipedia.approximate-tangent-space","target_kind":"node","target_sha256":"ba3cf86f3f45745729b2e391765a9b14b680c05724c4d5c074753b00c4fe8e51"}],"concept.wikipedia.approximately-continuous-function":[{"id":"assertion.concept.wikipedia.approximately-continuous-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximately continuous function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximately continuous function\", CC BY-SA 4.0) states: In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","support":[{"end":355,"quote":"In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","source_id":"wikipedia.article.approximately-continuous-function","source_sha256":"86bfbb3e457fa85d3088e00160ffd9db4ae870c5bfd7c24d6f412b30a2133e7c","start":121}],"target_id":"concept.wikipedia.approximately-continuous-function","target_kind":"node","target_sha256":"8eb5886f6a7e48e3a947a78fa4c66e454cdbb6caecc3480d1bf28e2aef20b978"}],"concept.wikipedia.approximation-error":[{"id":"assertion.concept.wikipedia.approximation-error","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximation error as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximation error\", CC BY-SA 4.0) states: The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","support":[{"end":282,"quote":"The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","source_id":"wikipedia.article.approximation-error","source_sha256":"df7e715a284d3ee43443d83a3a56192a9c02aeb55f6efc874e6d21e4ff964adf","start":105}],"target_id":"concept.wikipedia.approximation-error","target_kind":"node","target_sha256":"09459591d359af079bb288258dc7da739890346d620459409bef3bb753e2bfd2"}],"concept.wikipedia.approximation-theory":[{"id":"assertion.concept.wikipedia.approximation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximation theory\", CC BY-SA 4.0) states: In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","support":[{"end":294,"quote":"In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","source_id":"wikipedia.article.approximation-theory","source_sha256":"7836a70f798fcb09eae0ee4be11f84795197ca7027bebd66aa079f62f683594c","start":107}],"target_id":"concept.wikipedia.approximation-theory","target_kind":"node","target_sha256":"85d7ae92a3c12b334279dd8e761ffe260bf80c581373dbc1827e326ea70d9409"}],"concept.wikipedia.apriorism":[{"id":"assertion.concept.wikipedia.apriorism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apriorism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apriorism\", CC BY-SA 4.0) states: Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","support":[{"end":366,"quote":"Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","source_id":"wikipedia.article.apriorism","source_sha256":"fc250f4ccd8d02acab79f9c3d760cc2fba8e144329aa379d35de70016f5f6d8d","start":97}],"target_id":"concept.wikipedia.apriorism","target_kind":"node","target_sha256":"5aa6535f1c94726287fe6f7367564500e41a790fcfa6a33471b61438d269a9bf"}],"concept.wikipedia.aquifer":[{"id":"assertion.concept.wikipedia.aquifer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aquifer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aquifer\", CC BY-SA 4.0) states: An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","support":[{"end":251,"quote":"An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","source_id":"wikipedia.article.aquifer","source_sha256":"242c7a791e9baace3f06bb84d7dbdaf6030955bc0039f33cc1ff0767a60da8fe","start":92}],"target_id":"concept.wikipedia.aquifer","target_kind":"node","target_sha256":"faa93273d6a4fcabc30a930ea2d10b9aef3e0ae2cc2db41ce2b0779cb9be392b"}],"concept.wikipedia.aquifer-test":[{"id":"assertion.concept.wikipedia.aquifer-test","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aquifer test as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aquifer test\", CC BY-SA 4.0) states: In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \"stimulating\" the aquifer through constant pumping, and observing the aquifer's \"response\" (drawdown) in observation wells.","support":[{"end":318,"quote":"In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \\\"stimulating\\\" the aquifer through constant pumping, and observing the aquifer's \\\"response\\\" (drawdown) in observation wells.","source_id":"wikipedia.article.aquifer-test","source_sha256":"78187f0b97b77e9347cdce55d39a2eb17d7502de0d017ec8caa8dd26e229f232","start":99}],"target_id":"concept.wikipedia.aquifer-test","target_kind":"node","target_sha256":"788dd76c5a06ed515096d9141b24542b67dbc289665137bbfcb77fc30934bdae"}],"concept.wikipedia.arbitrary-inference":[{"id":"assertion.concept.wikipedia.arbitrary-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arbitrary inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arbitrary inference\", CC BY-SA 4.0) states: Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","support":[{"end":200,"quote":"Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","source_id":"wikipedia.article.arbitrary-inference","source_sha256":"9c67679e15285abe2deb4683f7a6d126910f482e014f7675f79b9b361efbdf70","start":107}],"target_id":"concept.wikipedia.arbitrary-inference","target_kind":"node","target_sha256":"f1df2d3ec1a0a98883434118685a6dce9fd0c78574ba5d207ebcbbb510005b83"}],"concept.wikipedia.arbor-milling":[{"id":"assertion.concept.wikipedia.arbor-milling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arbor milling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arbor milling\", CC BY-SA 4.0) states: Arbor milling is a cutting process which removes material via a multi-toothed cutter.","support":[{"end":186,"quote":"Arbor milling is a cutting process which removes material via a multi-toothed cutter.","source_id":"wikipedia.article.arbor-milling","source_sha256":"a9725623ee8e69420e2b4ed60d503ccdadb4966ce6554e9a2b3258029cbc4a7d","start":101}],"target_id":"concept.wikipedia.arbor-milling","target_kind":"node","target_sha256":"76cab6e90fbb19a4a5eff91765524a0da5b96955248d4e8b59e4ea9276215679"}],"concept.wikipedia.arc-fault":[{"id":"assertion.concept.wikipedia.arc-fault","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arc fault as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arc fault\", CC BY-SA 4.0) states: An arc fault is a high power discharge of electricity between two or more conductors.","support":[{"end":182,"quote":"An arc fault is a high power discharge of electricity between two or more conductors.","source_id":"wikipedia.article.arc-fault","source_sha256":"ce0e48cc61149743bae631c202ba0e141ff5c331a0913b74e102af459e088e85","start":97}],"target_id":"concept.wikipedia.arc-fault","target_kind":"node","target_sha256":"81e2575b5a0a643fdf4669b385c062fc72a2d20d179bcdcf88b8ed00bc27b3f1"}],"concept.wikipedia.arc-length-method":[{"id":"assertion.concept.wikipedia.arc-length-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arc-length method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arc-length method\", CC BY-SA 4.0) states: In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","support":[{"end":385,"quote":"In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","source_id":"wikipedia.article.arc-length-method","source_sha256":"95f0b21119eecb827f9ebca0331ff27246d53efd602db12648fdcc7e21abd807","start":105}],"target_id":"concept.wikipedia.arc-length-method","target_kind":"node","target_sha256":"5f25506e23ec7bafa74f36958ed9777cf2a41d1a35fc6f18373aca833b168a3a"}],"concept.wikipedia.arcadia-engineering":[{"id":"assertion.concept.wikipedia.arcadia-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arcadia (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arcadia (engineering)\", CC BY-SA 4.0) states: ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","support":[{"end":297,"quote":"ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","source_id":"wikipedia.article.arcadia-engineering","source_sha256":"a6844d696b0403645086313084ce4292453a61e7b8d728b606f5033e6b699977","start":109}],"target_id":"concept.wikipedia.arcadia-engineering","target_kind":"node","target_sha256":"88220959ad8476101d6e45ae146faf88c294ebcbfa78f7682c9c6640d5bca449"}],"concept.wikipedia.archard-equation":[{"id":"assertion.concept.wikipedia.archard-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archard equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archard equation\", CC BY-SA 4.0) states: The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","support":[{"end":225,"quote":"The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","source_id":"wikipedia.article.archard-equation","source_sha256":"da22c1f32fa73108e7d91719c69314b884ebff244361e01c697a756ab5edecfc","start":104}],"target_id":"concept.wikipedia.archard-equation","target_kind":"node","target_sha256":"7a028fad91d6f6c6edb7de7f6060fe991fdcbed0dbf23ab1cccea57dc98e37ee"}],"concept.wikipedia.arche-writing":[{"id":"assertion.concept.wikipedia.arche-writing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arche-writing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arche-writing\", CC BY-SA 4.0) states: In the philosophy of language, \"Arche-writing\" (French: archi-écriture \"arche-\" meaning \"origin, principle, or telos\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","support":[{"end":376,"quote":"In the philosophy of language, \\\"Arche-writing\\\" (French: archi-écriture \\\"arche-\\\" meaning \\\"origin, principle, or telos\\\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","source_id":"wikipedia.article.arche-writing","source_sha256":"a054741e037cf472025c4e129beb6b86f81f128ca0cc48d31aadcaf1c0081b76","start":100}],"target_id":"concept.wikipedia.arche-writing","target_kind":"node","target_sha256":"b3fce8dafcef058568937b43655b2cba3c4006bedc7d79870d7dbbfd697e8085"}],"concept.wikipedia.archimedean-point":[{"id":"assertion.concept.wikipedia.archimedean-point","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archimedean point as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archimedean point\", CC BY-SA 4.0) states: An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","support":[{"end":331,"quote":"An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","source_id":"wikipedia.article.archimedean-point","source_sha256":"af2b88dd38f47e565a7b1fcc48f5691e8091580784437f2d74c1366cf6dcebfc","start":103}],"target_id":"concept.wikipedia.archimedean-point","target_kind":"node","target_sha256":"e87381031efe427aaf033f421f61e7e817847ebd07e28a47f8953879d8fb58a7"}],"concept.wikipedia.archimedes-screw":[{"id":"assertion.concept.wikipedia.archimedes-screw","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archimedes' screw as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archimedes' screw\", CC BY-SA 4.0) states: An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","support":[{"end":218,"quote":"An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","source_id":"wikipedia.article.archimedes-screw","source_sha256":"91cd6d442331effdc5169ddfc58ebfb1d6b50b2bc379a5a5fa6eccd2bb923a79","start":102}],"target_id":"concept.wikipedia.archimedes-screw","target_kind":"node","target_sha256":"d7289c3988efaefa2335d44f62e46df4f2ed45aacb6734bf8dfc6b9d151b6e79"}],"concept.wikipedia.architectural-ironmongery":[{"id":"assertion.concept.wikipedia.architectural-ironmongery","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural ironmongery as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural ironmongery\", CC BY-SA 4.0) states: Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","support":[{"end":347,"quote":"Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","source_id":"wikipedia.article.architectural-ironmongery","source_sha256":"551184335ad2ee84cc2595739a461815679f9cca41727ffbf1b565c65aa39ed7","start":113}],"target_id":"concept.wikipedia.architectural-ironmongery","target_kind":"node","target_sha256":"e72e0c90ab698b67dbcdddf62f9283ede7f21bc563b78e3f695d64edb9cc7290"}],"concept.wikipedia.archival-research":[{"id":"assertion.concept.wikipedia.archival-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archival research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archival research\", CC BY-SA 4.0) states: Archival research is a type of research which involves seeking out and extracting evidence from archival records.","support":[{"end":218,"quote":"Archival research is a type of research which involves seeking out and extracting evidence from archival records.","source_id":"wikipedia.article.archival-research","source_sha256":"0d7856923b76967af1521b4d3b5538e3530896e2b83edc55f12315cffa15e3d8","start":105}],"target_id":"concept.wikipedia.archival-research","target_kind":"node","target_sha256":"42fb09d564b7ea50e0a83c7f578a0d150009d528c67be73fa0987982687829ad"}],"concept.wikipedia.arens-fort-space":[{"id":"assertion.concept.wikipedia.arens-fort-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arens–Fort space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arens–Fort space\", CC BY-SA 4.0) states: In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","support":[{"end":252,"quote":"In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","source_id":"wikipedia.article.arens-fort-space","source_sha256":"93e107e8590c630437a8df41b78c6e6ecb02fa8d3d3eb1dc689da1501f89df7b","start":103}],"target_id":"concept.wikipedia.arens-fort-space","target_kind":"node","target_sha256":"f0dc2ae5077b8fe51dbbacc827a5f5c5ebd656ba81490d558ed9155bc0510706"}],"concept.wikipedia.arf-ring":[{"id":"assertion.concept.wikipedia.arf-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arf ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arf ring\", CC BY-SA 4.0) states: In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","support":[{"end":273,"quote":"In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","source_id":"wikipedia.article.arf-ring","source_sha256":"813774d193c4524e48219588c23a0d77bed441b49814fcd63366645a88dcc83a","start":96}],"target_id":"concept.wikipedia.arf-ring","target_kind":"node","target_sha256":"bc8d8d2cedf7c6c31397f96d9d785a0c3cd565682d7a42c4f4e08c733f760cbd"}],"concept.wikipedia.argument":[{"id":"assertion.concept.wikipedia.argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument\", CC BY-SA 4.0) states: An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","support":[{"end":221,"quote":"An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","source_id":"wikipedia.article.argument","source_sha256":"b5a627179efb38ef4d0db9cf1f2767686f5b2d68041478fe58e3202c5f2f3ac1","start":96}],"target_id":"concept.wikipedia.argument","target_kind":"node","target_sha256":"ba29d27717d8e8ac849a1d0524a5b19ddace7297834c6f3c40ae9ba3d81e3b0a"}],"concept.wikipedia.argument-from-analogy":[{"id":"assertion.concept.wikipedia.argument-from-analogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from analogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from analogy\", CC BY-SA 4.0) states: Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","support":[{"end":285,"quote":"Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","source_id":"wikipedia.article.argument-from-analogy","source_sha256":"e1fc6f372ebf7ac04df80ba5d2464d92998c817a3be458d3cd36dd378b29b9fd","start":109}],"target_id":"concept.wikipedia.argument-from-analogy","target_kind":"node","target_sha256":"4049945ccf286801782c68292cc475c1ddde2beab205c4ab46ead9437c0ffaa1"}],"concept.wikipedia.argument-from-illusion":[{"id":"assertion.concept.wikipedia.argument-from-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from illusion\", CC BY-SA 4.0) states: The argument from illusion is an argument for the existence of sense-data.","support":[{"end":184,"quote":"The argument from illusion is an argument for the existence of sense-data.","source_id":"wikipedia.article.argument-from-illusion","source_sha256":"705c66c3b7892c80647748c81f3130b9477743663b02e98c59c9fd410800805a","start":110}],"target_id":"concept.wikipedia.argument-from-illusion","target_kind":"node","target_sha256":"9cf75c3607285bd4d78abc219e9459b5603d07453b211cc83631410b148c28f7"}],"concept.wikipedia.argument-from-incredulity":[{"id":"assertion.concept.wikipedia.argument-from-incredulity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from incredulity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from incredulity\", CC BY-SA 4.0) states: Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","support":[{"end":267,"quote":"Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","source_id":"wikipedia.article.argument-from-incredulity","source_sha256":"f0986abf20e5750e4090944bbd42bb444585a0120d1678acbf004bf929db6d95","start":112}],"target_id":"concept.wikipedia.argument-from-incredulity","target_kind":"node","target_sha256":"fbc0010150979abe6c66cba540745bb38ed489cbf9c94b27b816fc633a6590f3"}],"concept.wikipedia.argument-from-marginal-cases":[{"id":"assertion.concept.wikipedia.argument-from-marginal-cases","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from marginal cases as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from marginal cases\", CC BY-SA 4.0) states: The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","support":[{"end":302,"quote":"The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","source_id":"wikipedia.article.argument-from-marginal-cases","source_sha256":"4a5860aa0a3fecb980eea1fa7e9cafbed9b0dc8e610266b67d72d23e3bd3bc12","start":115}],"target_id":"concept.wikipedia.argument-from-marginal-cases","target_kind":"node","target_sha256":"14263fa62e916c40287ae9216eb23f7db803ea40e14a5dd448a57282cfd91300"}],"concept.wikipedia.argument-map":[{"id":"assertion.concept.wikipedia.argument-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument map\", CC BY-SA 4.0) states: An argument map or argument diagram is a visual representation of the structure of an argument.","support":[{"end":194,"quote":"An argument map or argument diagram is a visual representation of the structure of an argument.","source_id":"wikipedia.article.argument-map","source_sha256":"1e146e84f808bd9cc653efb86c351ae0918b56dc20fbaa7f215cbe1188dec86e","start":99}],"target_id":"concept.wikipedia.argument-map","target_kind":"node","target_sha256":"a62e7b0f055d1f6700b33b419960a3ac71802c8ede94eecbcd57ac82585efbce"}],"concept.wikipedia.argumentum-a-fortiori":[{"id":"assertion.concept.wikipedia.argumentum-a-fortiori","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum a fortiori as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum a fortiori\", CC BY-SA 4.0) states: Argumentum a fortiori (literally \"argument from the stronger [reason]\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","support":[{"end":388,"quote":"Argumentum a fortiori (literally \\\"argument from the stronger [reason]\\\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","source_id":"wikipedia.article.argumentum-a-fortiori","source_sha256":"3408b31dfee8292212fe16e06e7df0959c5140a2f7a144989cb8051ad5146c13","start":109}],"target_id":"concept.wikipedia.argumentum-a-fortiori","target_kind":"node","target_sha256":"65ff2bd8765f8fb73f3326aa44129faf9dd8b974c2ca950a6a72e75dc4f9e760"}],"concept.wikipedia.argumentum-ad-baculum":[{"id":"assertion.concept.wikipedia.argumentum-ad-baculum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum ad baculum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum ad baculum\", CC BY-SA 4.0) states: Argumentum ad baculum (Latin for \"argument to the cudgel\" or \"appeal to the stick\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","support":[{"end":304,"quote":"Argumentum ad baculum (Latin for \\\"argument to the cudgel\\\" or \\\"appeal to the stick\\\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","source_id":"wikipedia.article.argumentum-ad-baculum","source_sha256":"cfb0419a9820e941f6899db587fdd6c91d2ac9958bba914ff8824902be9c7825","start":106}],"target_id":"concept.wikipedia.argumentum-ad-baculum","target_kind":"node","target_sha256":"c1fdf428da6be5681d0ae56e22854919f2c7f5c2cec8c61f423451d2cf0660dd"}],"concept.wikipedia.argumentum-ad-captandum":[{"id":"assertion.concept.wikipedia.argumentum-ad-captandum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum ad captandum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum ad captandum\", CC BY-SA 4.0) states: In rhetoric, an argumentum ad captandum, \"for capturing\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","support":[{"end":321,"quote":"In rhetoric, an argumentum ad captandum, \\\"for capturing\\\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","source_id":"wikipedia.article.argumentum-ad-captandum","source_sha256":"9acab6dc11c0a85a3839c8651972ba5b898118c0005635333bc638c8f2d79694","start":109}],"target_id":"concept.wikipedia.argumentum-ad-captandum","target_kind":"node","target_sha256":"59df84af77d404456055fce89abdcc0e463ed4c7ad4eba8067af651fb927f89e"}],"concept.wikipedia.ariadne-s-thread-logic":[{"id":"assertion.concept.wikipedia.ariadne-s-thread-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ariadne's thread (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ariadne's thread (logic)\", CC BY-SA 4.0) states: Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","support":[{"end":465,"quote":"Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","source_id":"wikipedia.article.ariadne-s-thread-logic","source_sha256":"38b7b94ccb83bb5c7048950c783cdec105b34043214ff595ce78dccefaa187dd","start":111}],"target_id":"concept.wikipedia.ariadne-s-thread-logic","target_kind":"node","target_sha256":"3758ba0c1a365e53ce54bd0bc6e443dd660c3f94237d5d4893c3098ec7237fed"}],"concept.wikipedia.aristotle-s-theory-of-universals":[{"id":"assertion.concept.wikipedia.aristotle-s-theory-of-universals","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aristotle's theory of universals as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aristotle's theory of universals\", CC BY-SA 4.0) states: Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","support":[{"end":277,"quote":"Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","source_id":"wikipedia.article.aristotle-s-theory-of-universals","source_sha256":"f2cd64797acf35361825a8d25fe848f31ca3de3bf34b4857843434b1016c6415","start":118}],"target_id":"concept.wikipedia.aristotle-s-theory-of-universals","target_kind":"node","target_sha256":"9dde63edaebb0c90dd1be4b5992e63568f316882bb40f5be1ed01cdda250d330"}],"concept.wikipedia.arithmetic-derivative":[{"id":"assertion.concept.wikipedia.arithmetic-derivative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic derivative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic derivative\", CC BY-SA 4.0) states: In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","support":[{"end":353,"quote":"In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","source_id":"wikipedia.article.arithmetic-derivative","source_sha256":"9448d251e31881d385c8cfb500a4f51f83cde237f408023e7f5355e0a604e77e","start":109}],"target_id":"concept.wikipedia.arithmetic-derivative","target_kind":"node","target_sha256":"a9132cc0c01e52396ee9944f6f68a64a6512e13bb9fcd218f0ecdf109fead98c"}],"concept.wikipedia.arithmetic-fuchsian-group":[{"id":"assertion.concept.wikipedia.arithmetic-fuchsian-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic Fuchsian group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic Fuchsian group\", CC BY-SA 4.0) states: Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","support":[{"end":227,"quote":"Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","source_id":"wikipedia.article.arithmetic-fuchsian-group","source_sha256":"9062c1189a4854307c8239dc57f9a38155d0fb2e648a47263834c1dab0c4d534","start":113}],"target_id":"concept.wikipedia.arithmetic-fuchsian-group","target_kind":"node","target_sha256":"90b99dc9eca49160f051340859b07ebfdb7d9d7d3ccad41dcf8ed1ef306cfb06"}],"concept.wikipedia.arithmetic-number":[{"id":"assertion.concept.wikipedia.arithmetic-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic number\", CC BY-SA 4.0) states: In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","support":[{"end":224,"quote":"In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","source_id":"wikipedia.article.arithmetic-number","source_sha256":"f6a88ca045f3021156917862416d470551d24d0d9999b73a9d18572476e73b57","start":105}],"target_id":"concept.wikipedia.arithmetic-number","target_kind":"node","target_sha256":"534c9e15a11c8f45e158be7d799001403c0aad000e7da6586e7624ae8277f841"}],"concept.wikipedia.arithmetic-progression":[{"id":"assertion.concept.wikipedia.arithmetic-progression","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic progression as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic progression\", CC BY-SA 4.0) states: An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","support":[{"end":312,"quote":"An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","source_id":"wikipedia.article.arithmetic-progression","source_sha256":"2c4cba242f89bee55162cb63c53c526d13fc86c7e231430bddfc5ecd480e666f","start":108}],"target_id":"concept.wikipedia.arithmetic-progression","target_kind":"node","target_sha256":"1fdb5c719200cd86bc5dd42df63defd794cc3d0c5e65e453465a5b31d538ebbd"}],"concept.wikipedia.arithmetic-zeta-function":[{"id":"assertion.concept.wikipedia.arithmetic-zeta-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic zeta function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic zeta function\", CC BY-SA 4.0) states: In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","support":[{"end":230,"quote":"In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","source_id":"wikipedia.article.arithmetic-zeta-function","source_sha256":"a4d1ee85f016b2933210a1f7e0b297e3c350ebfaf91db72f5165d0f9a4209b52","start":112}],"target_id":"concept.wikipedia.arithmetic-zeta-function","target_kind":"node","target_sha256":"965fded121d892ba4ca685dd74672a2de028ee2a54f1b9319abb344114c33186"}],"concept.wikipedia.arithmetical-set":[{"id":"assertion.concept.wikipedia.arithmetical-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetical set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetical set\", CC BY-SA 4.0) states: In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","support":[{"end":259,"quote":"In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","source_id":"wikipedia.article.arithmetical-set","source_sha256":"2de96f44b0d33427bda6c502c3704ad30e6a256148bba21a5ab2f40addf0f005","start":103}],"target_id":"concept.wikipedia.arithmetical-set","target_kind":"node","target_sha256":"6ec9c2be39017bb1e55e05f857d117959ac6479c0be0512d99eec830def9eadc"}],"concept.wikipedia.arithmetico-geometric-sequence":[{"id":"assertion.concept.wikipedia.arithmetico-geometric-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetico-geometric sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetico-geometric sequence\", CC BY-SA 4.0) states: In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","support":[{"end":323,"quote":"In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","source_id":"wikipedia.article.arithmetico-geometric-sequence","source_sha256":"385d21e7a204e3044c91b594a2b129debdd5ce8a2e7fb677739abb2d68247a29","start":118}],"target_id":"concept.wikipedia.arithmetico-geometric-sequence","target_kind":"node","target_sha256":"f823f9d3bf743696b0f5013913fb763e00fb3ce8386c367217e6357d0dc053d8"}],"concept.wikipedia.arity":[{"id":"assertion.concept.wikipedia.arity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arity\", CC BY-SA 4.0) states: In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","support":[{"end":227,"quote":"In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","source_id":"wikipedia.article.arity","source_sha256":"0b0565c806f32ca43cc992bac681f926bd7670b95ba7d1548df2ba3bc3b3ea14","start":90}],"target_id":"concept.wikipedia.arity","target_kind":"node","target_sha256":"fd67b1bcca6efc5a7cf1f23eabc6355248033960162481c8480368733b4aa9f8"}],"concept.wikipedia.armature-controlled-dc-motor":[{"id":"assertion.concept.wikipedia.armature-controlled-dc-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armature-controlled DC motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armature-controlled DC motor\", CC BY-SA 4.0) states: An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","support":[{"end":242,"quote":"An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","source_id":"wikipedia.article.armature-controlled-dc-motor","source_sha256":"50515318cf78778f23a01f5acbf36e49c1179e2bb3515f4964f356a8e76d9e1b","start":116}],"target_id":"concept.wikipedia.armature-controlled-dc-motor","target_kind":"node","target_sha256":"46eef912eb4e6451aea3f57efa414c4e50395097e0455ebcc7703a4946815ff9"}],"concept.wikipedia.armature-electrical":[{"id":"assertion.concept.wikipedia.armature-electrical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armature (electrical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armature (electrical)\", CC BY-SA 4.0) states: In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","support":[{"end":240,"quote":"In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","source_id":"wikipedia.article.armature-electrical","source_sha256":"9642df35d57945f1accf6d66f525f75439244b0efb327edd91861be47f333fb9","start":108}],"target_id":"concept.wikipedia.armature-electrical","target_kind":"node","target_sha256":"0012a7ab83d403273231a40e3630a0cc428e673d3efc2d411eea3d8df24a8722"}],"concept.wikipedia.armchair-theorizing":[{"id":"assertion.concept.wikipedia.armchair-theorizing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armchair theorizing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armchair theorizing\", CC BY-SA 4.0) states: Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","support":[{"end":264,"quote":"Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","source_id":"wikipedia.article.armchair-theorizing","source_sha256":"0c6c403e629cc3439a9c623ca827e3fcf06dc9b98b4560b1c855a079ea29fe49","start":107}],"target_id":"concept.wikipedia.armchair-theorizing","target_kind":"node","target_sha256":"d1655481ff07013fa3f68a9d2def94aff53dc4377798b271839d3b8b842d3612"}],"concept.wikipedia.armourstone":[{"id":"assertion.concept.wikipedia.armourstone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armourstone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armourstone\", CC BY-SA 4.0) states: Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","support":[{"end":291,"quote":"Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","source_id":"wikipedia.article.armourstone","source_sha256":"9050af8f3a7f17bb32730f8fa77b7312bbc345bacfc093336b0fe364ee97a518","start":99}],"target_id":"concept.wikipedia.armourstone","target_kind":"node","target_sha256":"344e5d3280a4d99afda78acedd94141c47b292ce62af358b656593cf6c1f9853"}],"concept.wikipedia.arnold-diffusion":[{"id":"assertion.concept.wikipedia.arnold-diffusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arnold diffusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arnold diffusion\", CC BY-SA 4.0) states: In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","support":[{"end":219,"quote":"In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","source_id":"wikipedia.article.arnold-diffusion","source_sha256":"4dbe5bd26ad68ad509b6367aac798a7e2d7afc174ee53e0296614b4d0b8d7535","start":104}],"target_id":"concept.wikipedia.arnold-diffusion","target_kind":"node","target_sha256":"5a77158aeb967b2ff8ac8076321bdc2910a6d15b2c2342b700a15ec5cd8b8632"}],"concept.wikipedia.arnold-invariants":[{"id":"assertion.concept.wikipedia.arnold-invariants","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arnold invariants as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arnold invariants\", CC BY-SA 4.0) states: In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","support":[{"end":289,"quote":"In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","source_id":"wikipedia.article.arnold-invariants","source_sha256":"00cf86f4db3600314755de1777b2f29fd30f35014e2cf9260680a12b3403ccad","start":105}],"target_id":"concept.wikipedia.arnold-invariants","target_kind":"node","target_sha256":"dfe702637ffa03dc9b83882eee626ec78eefcfe89aae49b18d5d0b421a7e3c66"}],"concept.wikipedia.array-processing":[{"id":"assertion.concept.wikipedia.array-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Array processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Array processing\", CC BY-SA 4.0) states: Array processing is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","support":[{"end":287,"quote":"Array processing  is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","source_id":"wikipedia.article.array-processing","source_sha256":"19b02ce7fa41cd13f27d7d5f2e9dd8db328973dfb0a75bd18f5787ff1943f3b5","start":103}],"target_id":"concept.wikipedia.array-processing","target_kind":"node","target_sha256":"f2a11ca86c013946f7fe48da3f3154cacc4f04009db09752543f08885e3cb508"}],"concept.wikipedia.artifact-centric-business-process-model":[{"id":"assertion.concept.wikipedia.artifact-centric-business-process-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artifact-centric business process model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artifact-centric business process model\", CC BY-SA 4.0) states: Artifact-centric business process model represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","support":[{"end":348,"quote":"Artifact-centric business process model  represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","source_id":"wikipedia.article.artifact-centric-business-process-model","source_sha256":"291ad4dde16fa2924d5b19086d9d6c7a3a1fc54f7e2345ee64f56f3f58d138e0","start":127}],"target_id":"concept.wikipedia.artifact-centric-business-process-model","target_kind":"node","target_sha256":"22d51b871cafc7826ec4acfee7e0b3620a6dccc480ae2d07da849b71f688ce35"}],"concept.wikipedia.artificio-de-juanelo":[{"id":"assertion.concept.wikipedia.artificio-de-juanelo","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artificio de Juanelo as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artificio de Juanelo\", CC BY-SA 4.0) states: The Artificio de Juanelo (\"Gianello's artifice\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","support":[{"end":243,"quote":"The Artificio de Juanelo (\\\"Gianello's artifice\\\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","source_id":"wikipedia.article.artificio-de-juanelo","source_sha256":"77a58d8c39b8a3d0fe775f0a649a8a8b40325778ceb71b8f349707d0dc9a871d","start":108}],"target_id":"concept.wikipedia.artificio-de-juanelo","target_kind":"node","target_sha256":"530282a2bb89ae85a58da173a0bac1814dd936b8a3080eca8532751dab821b79"}],"concept.wikipedia.artin-verdier-duality":[{"id":"assertion.concept.wikipedia.artin-verdier-duality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artin–Verdier duality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artin–Verdier duality\", CC BY-SA 4.0) states: In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","support":[{"end":341,"quote":"In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","source_id":"wikipedia.article.artin-verdier-duality","source_sha256":"dc3a4297031229e9b4f54e1bf13c13b331f9bb87c0b933534c655ba344afa54c","start":109}],"target_id":"concept.wikipedia.artin-verdier-duality","target_kind":"node","target_sha256":"125645b91992feabcd16bad9a3df24e8a0335d53b0ea1087b3fb5fe894f46897"}],"concept.wikipedia.artinian-module":[{"id":"assertion.concept.wikipedia.artinian-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artinian module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artinian module\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","support":[{"end":252,"quote":"In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","source_id":"wikipedia.article.artinian-module","source_sha256":"32f126272795b57d038afde240a10da068833d11dd50a20965bdea59d6213ff0","start":101}],"target_id":"concept.wikipedia.artinian-module","target_kind":"node","target_sha256":"f0f7c0427897bb00dda4b8b43b7ef7a3f5135bc2cbf9bcd81367870b13701585"}],"concept.wikipedia.artinian-ring":[{"id":"assertion.concept.wikipedia.artinian-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artinian ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artinian ring\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","support":[{"end":325,"quote":"In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","source_id":"wikipedia.article.artinian-ring","source_sha256":"84beeb9c04e97ed4fb5cacc772aa18cf8a976a1f60ef7a5fb8130feed3b2e79f","start":99}],"target_id":"concept.wikipedia.artinian-ring","target_kind":"node","target_sha256":"a18cd3daaadd8ea150c55b5da0b90b2f8d7404f21d9378c8b37e4b1d3b490f84"}],"concept.wikipedia.asano-contraction":[{"id":"assertion.concept.wikipedia.asano-contraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asano contraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asano contraction\", CC BY-SA 4.0) states: In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","support":[{"end":300,"quote":"In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","source_id":"wikipedia.article.asano-contraction","source_sha256":"ac62447849e7879de27447e1fb50e9e8d975bfb835c7c4ec2e864fc92ce75b11","start":105}],"target_id":"concept.wikipedia.asano-contraction","target_kind":"node","target_sha256":"82a8bf0ee7d6bee72c90a1ac881e8914231a8a012a3f5e889025e9b072acde1d"}],"concept.wikipedia.ascending-chain-condition":[{"id":"assertion.concept.wikipedia.ascending-chain-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ascending chain condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ascending chain condition\", CC BY-SA 4.0) states: In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","support":[{"end":317,"quote":"In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","source_id":"wikipedia.article.ascending-chain-condition","source_sha256":"bf28e7cfaef079b960f9a47ff056e7c9bbb6dfae4d004a49a8445a4d23c79199","start":109}],"target_id":"concept.wikipedia.ascending-chain-condition","target_kind":"node","target_sha256":"d9d71a7e4cd15ce403cc2a8ee6d368d1e9ea683fda1d2241a1c00341920168dc"}],"concept.wikipedia.asplund-space":[{"id":"assertion.concept.wikipedia.asplund-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asplund space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asplund space\", CC BY-SA 4.0) states: In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","support":[{"end":247,"quote":"In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","source_id":"wikipedia.article.asplund-space","source_sha256":"05fa90db3a81e09b8969168fc76fbfe7b144282057d1ee3114d8655836981581","start":101}],"target_id":"concept.wikipedia.asplund-space","target_kind":"node","target_sha256":"94ae4eb7d7a1bc3e4ca0aafbb6dc43bfa0c642a8f995e51d16ff6eb6a01f0a7d"}],"concept.wikipedia.asset-health-management":[{"id":"assertion.concept.wikipedia.asset-health-management","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asset health management as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asset health management\", CC BY-SA 4.0) states: In asset management, asset health management (AHM) is the field of study that looks at how to manage the \"health\" of an assets in a facility, system, or fleet.","support":[{"end":272,"quote":"In asset management, asset health management (AHM) is the field of study that looks at how to manage the \\\"health\\\" of an assets in a facility, system, or fleet.","source_id":"wikipedia.article.asset-health-management","source_sha256":"73a042f8745ec1ed53a13327610354a400869b7ab028088429274d0d73271626","start":111}],"target_id":"concept.wikipedia.asset-health-management","target_kind":"node","target_sha256":"87cb8ae14452920d0352e5783770b681de0f767ba82a239749d48f24abaab4df"}],"concept.wikipedia.associative-property":[{"id":"assertion.concept.wikipedia.associative-property","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Associative property as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Associative property\", CC BY-SA 4.0) states: In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","support":[{"end":262,"quote":"In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","source_id":"wikipedia.article.associative-property","source_sha256":"153a30378b69745cf8f9b846138d212cb904ac85e9de5481c6bbeff4473a600b","start":104}],"target_id":"concept.wikipedia.associative-property","target_kind":"node","target_sha256":"c04a5e2f2bb4f5a6786a589657493d85856db6c8cd62fced8d05ec551c17957d"}],"concept.wikipedia.astm-g65":[{"id":"assertion.concept.wikipedia.astm-g65","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ASTM G65 as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ASTM G65\", CC BY-SA 4.0) states: ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","support":[{"end":276,"quote":"ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","source_id":"wikipedia.article.astm-g65","source_sha256":"43beeafe20c402e7afe0c8c728fde6471708900c96c3f6da9dfb1e32698d7907","start":96}],"target_id":"concept.wikipedia.astm-g65","target_kind":"node","target_sha256":"633c48e11e5fcbbe4da9d9e9ee27c9dbaa34eb8d50080e95952b7c38e3dac9cf"}],"concept.wikipedia.asymmetric-norm":[{"id":"assertion.concept.wikipedia.asymmetric-norm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymmetric norm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymmetric norm\", CC BY-SA 4.0) states: In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","support":[{"end":201,"quote":"In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","source_id":"wikipedia.article.asymmetric-norm","source_sha256":"4b4c89989dd2d1cf9dbd30f7e5ad588c3b4b449f5f2197cc720eac348bd3d491","start":103}],"target_id":"concept.wikipedia.asymmetric-norm","target_kind":"node","target_sha256":"a11f22f29b9f04cf7efd512ca34ca8cc5cf427ddc340e31edc47d4e6e6901a9a"}],"concept.wikipedia.asymptote":[{"id":"assertion.concept.wikipedia.asymptote","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptote as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptote\", CC BY-SA 4.0) states: In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","support":[{"end":291,"quote":"In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","source_id":"wikipedia.article.asymptote","source_sha256":"05f66671009ed315f42352142817a87a1f951b376d538628c1bf02e6d4a7e475","start":93}],"target_id":"concept.wikipedia.asymptote","target_kind":"node","target_sha256":"d660b17dc5a96c71c2387c2444018f7c125091a680e08497e8b4230d8cca9756"}],"concept.wikipedia.asymptotic-expansion":[{"id":"assertion.concept.wikipedia.asymptotic-expansion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptotic expansion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptotic expansion\", CC BY-SA 4.0) states: In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function near a specific point or at infinity.","support":[{"end":282,"quote":"In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function  near a specific point or at infinity.","source_id":"wikipedia.article.asymptotic-expansion","source_sha256":"aa98a95fcd50d5f8a41c4b6b62422f7878919d71f404bbb7d72a36269a8880ab","start":106}],"target_id":"concept.wikipedia.asymptotic-expansion","target_kind":"node","target_sha256":"06d8b2d57d37ab9f51c0f44def5120035aaaff66cc3bd10e705256ec72fbcdec"}],"concept.wikipedia.atlas-topology":[{"id":"assertion.concept.wikipedia.atlas-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atlas (topology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atlas (topology)\", CC BY-SA 4.0) states: In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","support":[{"end":190,"quote":"In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","source_id":"wikipedia.article.atlas-topology","source_sha256":"58bd4a6f937556c703e11d442db0cdcf1cf4970ead4071e0d93b95753cc49e34","start":101}],"target_id":"concept.wikipedia.atlas-topology","target_kind":"node","target_sha256":"689d4202f7688eeb6fb3a4b8c7ac20a778e4b11eac7931ef8d39ca9e295c5de1"}],"concept.wikipedia.atom-measure-theory":[{"id":"assertion.concept.wikipedia.atom-measure-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atom (measure theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atom (measure theory)\", CC BY-SA 4.0) states: In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","support":[{"end":261,"quote":"In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","source_id":"wikipedia.article.atom-measure-theory","source_sha256":"d3add0cd5cb7044d14e4b2ad803cd3c9d80a8f6f45b43be5cf04cb255b6fa031","start":108}],"target_id":"concept.wikipedia.atom-measure-theory","target_kind":"node","target_sha256":"26ea445825760c19bde6e8754eb7ce997174c30fe8e7379ef893e481c369a297"}],"concept.wikipedia.attack-time-delay":[{"id":"assertion.concept.wikipedia.attack-time-delay","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attack-time delay as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attack-time delay\", CC BY-SA 4.0) states: In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","support":[{"end":225,"quote":"In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","source_id":"wikipedia.article.attack-time-delay","source_sha256":"7b543797bf1bdd55957b68a393858cbd9428c581eab8331e30781cb312ff81c8","start":102}],"target_id":"concept.wikipedia.attack-time-delay","target_kind":"node","target_sha256":"90eec6f20735a98cc4e01fb0a10d78865192de1a16265893897cb9e37109168b"}],"concept.wikipedia.attention-inequality":[{"id":"assertion.concept.wikipedia.attention-inequality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attention inequality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attention inequality\", CC BY-SA 4.0) states: Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","support":[{"end":254,"quote":"Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","source_id":"wikipedia.article.attention-inequality","source_sha256":"8bd18b5b33871a14cff98cbc819a44a53f4a53c8a98567e2509ae7fd2097c749","start":108}],"target_id":"concept.wikipedia.attention-inequality","target_kind":"node","target_sha256":"7021f19e6732692ca6da50638cb546287d74c09c1fabe73eb569cc83a96077f7"}],"concept.wikipedia.attribute-substitution":[{"id":"assertion.concept.wikipedia.attribute-substitution","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attribute substitution as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attribute substitution\", CC BY-SA 4.0) states: Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","support":[{"end":234,"quote":"Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","source_id":"wikipedia.article.attribute-substitution","source_sha256":"39921c659cba91524ab21795a672d09f16e2c6b399b6878857b7d2a5e5d60af9","start":110}],"target_id":"concept.wikipedia.attribute-substitution","target_kind":"node","target_sha256":"321d510b4decc184775a79fb7df0f9d29b78dbe656950d65c9ad71c2956f970d"}],"concept.wikipedia.attribution-psychology":[{"id":"assertion.concept.wikipedia.attribution-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attribution (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attribution (psychology)\", CC BY-SA 4.0) states: Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","support":[{"end":266,"quote":"Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","source_id":"wikipedia.article.attribution-psychology","source_sha256":"24a975050fe9d522ce78edd21ed2bc4bd1968a56b469a30d5b21ea8a8591ce75","start":111}],"target_id":"concept.wikipedia.attribution-psychology","target_kind":"node","target_sha256":"fabcb65be00249c8ef833563d08a36cb355bddfd0c677f829902324866b5aa97"}],"concept.wikipedia.attrition-research":[{"id":"assertion.concept.wikipedia.attrition-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attrition (research) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attrition (research)\", CC BY-SA 4.0) states: In science, attrition are ratios regarding the loss of participants during an experiment.","support":[{"end":197,"quote":"In science, attrition are ratios regarding the loss of participants during an experiment.","source_id":"wikipedia.article.attrition-research","source_sha256":"787e7a3707ade45124280e6acb806147d88aa214a2484dccb7993aa8cd3b6d56","start":108}],"target_id":"concept.wikipedia.attrition-research","target_kind":"node","target_sha256":"98a4da0fe4732f7b57116b6a498614ee2257b5acbb1743cb457513cbe1531581"}],"concept.wikipedia.audio-filter":[{"id":"assertion.concept.wikipedia.audio-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audio filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audio filter\", CC BY-SA 4.0) states: An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","support":[{"end":223,"quote":"An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","source_id":"wikipedia.article.audio-filter","source_sha256":"e0da534c8cedd7570b0b7db6d8477e05a913c988a6990712ea963c4fba0d49e6","start":98}],"target_id":"concept.wikipedia.audio-filter","target_kind":"node","target_sha256":"e11086b6aac9faf83037b43442bd3b3b2ce608377c4edceebd9db4ca4b47a215"}],"concept.wikipedia.audio-signal-processing":[{"id":"assertion.concept.wikipedia.audio-signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audio signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audio signal processing\", CC BY-SA 4.0) states: Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","support":[{"end":234,"quote":"Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","source_id":"wikipedia.article.audio-signal-processing","source_sha256":"62c14361aa1e3b3e65f447d31514efefda6e1871500ac4b2121ba4db127e64f3","start":107}],"target_id":"concept.wikipedia.audio-signal-processing","target_kind":"node","target_sha256":"779272eaaa01db832762b6654b19597fc3d2a2248f3158686996f68dc11498c9"}],"concept.wikipedia.audit-study":[{"id":"assertion.concept.wikipedia.audit-study","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audit study as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audit study\", CC BY-SA 4.0) states: A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\"auditors\") are matched on all characteristics except the one being tested for discrimination.","support":[{"end":344,"quote":"A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\\\"auditors\\\") are matched on all characteristics except the one being tested for discrimination.","source_id":"wikipedia.article.audit-study","source_sha256":"8e2a893c6075e72229a91938e066e7f8a89e4d8768938cb8a39ff0f8da395f14","start":99}],"target_id":"concept.wikipedia.audit-study","target_kind":"node","target_sha256":"2081dffc6fec815824268e99064d19ff005f16f3a49dd3112bd54af813eba11f"}],"concept.wikipedia.augustinian-hypothesis":[{"id":"assertion.concept.wikipedia.augustinian-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Augustinian hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Augustinian hypothesis\", CC BY-SA 4.0) states: The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","support":[{"end":299,"quote":"The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","source_id":"wikipedia.article.augustinian-hypothesis","source_sha256":"6fe870e53da942ebd5d6728385859d1361c1f28be3b935c3b260eb1fb44783da","start":109}],"target_id":"concept.wikipedia.augustinian-hypothesis","target_kind":"node","target_sha256":"76041af9ec1e9ef470ad85cd1e98ccdeab56bf1e8dc76e640eb490844cc1385d"}],"concept.wikipedia.authority-bias":[{"id":"assertion.concept.wikipedia.authority-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Authority bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Authority bias\", CC BY-SA 4.0) states: Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","support":[{"end":267,"quote":"Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","source_id":"wikipedia.article.authority-bias","source_sha256":"94de1fca749556177b3c9196572d5f5ae22692e0b7a89db6de2933cff7b9537c","start":102}],"target_id":"concept.wikipedia.authority-bias","target_kind":"node","target_sha256":"67c56ba14482b4756a01012c7e82d6fcf5dcf298c6981ad53039a093824a856c"}],"concept.wikipedia.authority-of-the-bootmaker":[{"id":"assertion.concept.wikipedia.authority-of-the-bootmaker","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Authority of the bootmaker as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Authority of the bootmaker\", CC BY-SA 4.0) states: Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","support":[{"end":368,"quote":"Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","source_id":"wikipedia.article.authority-of-the-bootmaker","source_sha256":"2012981b8f5f08bc07e1a31789fb1f7a1bda4f06f0c98c1ac2200b9664e70599","start":114}],"target_id":"concept.wikipedia.authority-of-the-bootmaker","target_kind":"node","target_sha256":"08d03dec6f2d4b5eb3cadabd01842c5925f1c1da7beb5ee277f9f0b3f2a9d1e5"}],"concept.wikipedia.autocovariance":[{"id":"assertion.concept.wikipedia.autocovariance","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autocovariance as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autocovariance\", CC BY-SA 4.0) states: In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","support":[{"end":277,"quote":"In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","source_id":"wikipedia.article.autocovariance","source_sha256":"ad6aa99b4876b20de0fe446f0274b2367edd8d5a89eef3c476f58c568f2c6462","start":101}],"target_id":"concept.wikipedia.autocovariance","target_kind":"node","target_sha256":"e81ece791e462b69291bb6b879e9d4174773da0e770bf8718ae04f4f635c76cb"}],"concept.wikipedia.autofrettage":[{"id":"assertion.concept.wikipedia.autofrettage","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autofrettage as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autofrettage\", CC BY-SA 4.0) states: Autofrettage is a work-hardening process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","support":[{"end":357,"quote":"Autofrettage is a work-hardening  process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","source_id":"wikipedia.article.autofrettage","source_sha256":"7d59d78cd0743853a9d458e59cb4862dbcd779da95b548ed1a36292fa29a7688","start":98}],"target_id":"concept.wikipedia.autofrettage","target_kind":"node","target_sha256":"8e4295418f059b1c46ba9c95c1923b3fec9ce949c2b6be04592f440b7cce014d"}],"concept.wikipedia.autogenous-welding":[{"id":"assertion.concept.wikipedia.autogenous-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autogenous welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autogenous welding\", CC BY-SA 4.0) states: Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","support":[{"end":254,"quote":"Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","source_id":"wikipedia.article.autogenous-welding","source_sha256":"d37d3d70b6ae2a7263182fc8a0d0b262e6cff7f83562c37810559071d481b1d2","start":106}],"target_id":"concept.wikipedia.autogenous-welding","target_kind":"node","target_sha256":"581be1a7ca6b6c93edd71743130dd4a5a2259bbac9eeb539cac72377d2499f62"}],"concept.wikipedia.automatic-semigroup":[{"id":"assertion.concept.wikipedia.automatic-semigroup","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automatic semigroup as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automatic semigroup\", CC BY-SA 4.0) states: In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","support":[{"end":267,"quote":"In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","source_id":"wikipedia.article.automatic-semigroup","source_sha256":"8caaf1d1059ef02d255c9177adec74b0993f60df57bef57f3f9e4e8da2cb3580","start":107}],"target_id":"concept.wikipedia.automatic-semigroup","target_kind":"node","target_sha256":"fcc8c8eafc6575fce3b9ef92400a95732606443fae7afa1c81435fbae7b4e103"}],"concept.wikipedia.automatic-sequence":[{"id":"assertion.concept.wikipedia.automatic-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automatic sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automatic sequence\", CC BY-SA 4.0) states: In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","support":[{"end":378,"quote":"In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","source_id":"wikipedia.article.automatic-sequence","source_sha256":"9da2dc9fd370ead5be7efee2c25c9c529e477f42e32ad7988031c14e9de9cb5f","start":105}],"target_id":"concept.wikipedia.automatic-sequence","target_kind":"node","target_sha256":"1bf7eb7f500b628eaf6ca4e3168d8f511b48fb54dd6374075c0ec52840f743e8"}],"concept.wikipedia.automation-bias":[{"id":"assertion.concept.wikipedia.automation-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automation bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automation bias\", CC BY-SA 4.0) states: Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","support":[{"end":295,"quote":"Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","source_id":"wikipedia.article.automation-bias","source_sha256":"c9255726e2fb1da166a4db4604097b0a930d895f5c701b9fdb7dbbfbf4ed9845","start":103}],"target_id":"concept.wikipedia.automation-bias","target_kind":"node","target_sha256":"089ed8876f1907c6954c44ad8d5704fc812701be70650847ad7f4cbc0057cf24"}],"concept.wikipedia.automorphism":[{"id":"assertion.concept.wikipedia.automorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automorphism\", CC BY-SA 4.0) states: In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","support":[{"end":183,"quote":"In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","source_id":"wikipedia.article.automorphism","source_sha256":"7e844822c238f99c8a47ae059b79c67e83a0cd08b9596c541edf5aa98b2c83b6","start":96}],"target_id":"concept.wikipedia.automorphism","target_kind":"node","target_sha256":"309154c958f2d4874e9c24a1936c698e30387e3def5508918407d89bc13ecc43"}],"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups":[{"id":"assertion.concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automorphisms of the symmetric and alternating groups as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automorphisms of the symmetric and alternating groups\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","support":[{"end":453,"quote":"In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","source_id":"wikipedia.article.automorphisms-of-the-symmetric-and-alternating-groups","source_sha256":"3e988d04fd44181e2a4482af0493cef971e7ded6245b95a401739c937ca9f81a","start":141}],"target_id":"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","target_kind":"node","target_sha256":"d80081db0015db1727fe1234321ae61bc99a75d709a478a4113a54b2ec6257ce"}],"concept.wikipedia.automotive-fuse":[{"id":"assertion.concept.wikipedia.automotive-fuse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automotive fuse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automotive fuse\", CC BY-SA 4.0) states: Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","support":[{"end":212,"quote":"Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","source_id":"wikipedia.article.automotive-fuse","source_sha256":"821a2a4922a7b5554f7271181e8e4ad9151da7ca4fae64ed2f5d8e1e4418f80d","start":103}],"target_id":"concept.wikipedia.automotive-fuse","target_kind":"node","target_sha256":"345ad2189e912e91e8d59fdb599971eacce8f368b4d10be3d2652dcb7015ba93"}],"concept.wikipedia.autonomous-aircraft":[{"id":"assertion.concept.wikipedia.autonomous-aircraft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous aircraft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous aircraft\", CC BY-SA 4.0) states: An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","support":[{"end":277,"quote":"An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","source_id":"wikipedia.article.autonomous-aircraft","source_sha256":"ba57c39884f9123e8c5dbbd24fcb70f371c28e2c25c21715bf49fd43166af7a2","start":107}],"target_id":"concept.wikipedia.autonomous-aircraft","target_kind":"node","target_sha256":"f56f9c8de6a5ad76e6c2b7bbd7471701dbfc56741fa37106fc15eb7506cd1770"}],"concept.wikipedia.autonomous-circuit":[{"id":"assertion.concept.wikipedia.autonomous-circuit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous circuit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous circuit\", CC BY-SA 4.0) states: An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","support":[{"end":278,"quote":"An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","source_id":"wikipedia.article.autonomous-circuit","source_sha256":"73c83a40db67832d88d7a69828e44eb714a0e6f8714e1d9acf8e4a006e86d8bb","start":106}],"target_id":"concept.wikipedia.autonomous-circuit","target_kind":"node","target_sha256":"959f97919ae903575a50cc127335fac9751c2b6993d84ef7fb6192364a0d249b"}],"concept.wikipedia.autonomous-logistics":[{"id":"assertion.concept.wikipedia.autonomous-logistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous logistics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous logistics\", CC BY-SA 4.0) states: Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","support":[{"end":298,"quote":"Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","source_id":"wikipedia.article.autonomous-logistics","source_sha256":"ee58b2c236ff88acdbd9840979f158a775f989a6289f3600eff879150cba0a78","start":108}],"target_id":"concept.wikipedia.autonomous-logistics","target_kind":"node","target_sha256":"3f1dd7627b794c74aecdbb5e4b876e72ab9b4816b99ce045885d96a6db60c272"}],"concept.wikipedia.autonomous-system-mathematics":[{"id":"assertion.concept.wikipedia.autonomous-system-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous system (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous system (mathematics)\", CC BY-SA 4.0) states: In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","support":[{"end":298,"quote":"In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","source_id":"wikipedia.article.autonomous-system-mathematics","source_sha256":"e9695c2e223f54885e9e65dd0e003da731652dac0a6a3aa63c27c2f86af51f29","start":117}],"target_id":"concept.wikipedia.autonomous-system-mathematics","target_kind":"node","target_sha256":"63987586fca7a8f94c4dc2ebd821971f1e27cbd8fbacd1fccbc135dbe93e71d6"}],"concept.wikipedia.autonomy-of-syntax":[{"id":"assertion.concept.wikipedia.autonomy-of-syntax","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomy of syntax as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomy of syntax\", CC BY-SA 4.0) states: In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","support":[{"end":314,"quote":"In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","source_id":"wikipedia.article.autonomy-of-syntax","source_sha256":"ce3e5ab5b0401dc760c64efda6a3088e52f5ab4e6bf525b4e9616e4e55820d29","start":106}],"target_id":"concept.wikipedia.autonomy-of-syntax","target_kind":"node","target_sha256":"3c2481a00627a8897c15ff99c66e0c24f98cbb2d6b0b78efdc01d1e9b63cc0f9"}],"concept.wikipedia.autopen":[{"id":"assertion.concept.wikipedia.autopen","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autopen as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autopen\", CC BY-SA 4.0) states: An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","support":[{"end":240,"quote":"An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","source_id":"wikipedia.article.autopen","source_sha256":"3e533a1c2d2a87e1c998bf087da26b81036a5a6f17ad8417dcc05e2134b4783a","start":94}],"target_id":"concept.wikipedia.autopen","target_kind":"node","target_sha256":"f6d1f307cda0917c2ac6b97935ff9787bffd2ea39999c8c7efb60710ed4b9b7c"}],"concept.wikipedia.availability-cascade":[{"id":"assertion.concept.wikipedia.availability-cascade","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability cascade as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability cascade\", CC BY-SA 4.0) states: An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","support":[{"end":229,"quote":"An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","source_id":"wikipedia.article.availability-cascade","source_sha256":"85a6839f88cbdb3810cd548d84c8060234bbcf71020066a557ced411176c3403","start":108}],"target_id":"concept.wikipedia.availability-cascade","target_kind":"node","target_sha256":"e3f3b83b3a453c2574da1ebbc151c65ca0c2fe52b6247afaf2e047d2abe407ed"}],"concept.wikipedia.availability-heuristic":[{"id":"assertion.concept.wikipedia.availability-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability heuristic\", CC BY-SA 4.0) states: The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","support":[{"end":322,"quote":"The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","source_id":"wikipedia.article.availability-heuristic","source_sha256":"6b8d205bc6bf5f67faaced2b1b936f0fb56a88807eaaa00bcaad4dbf318ea7ae","start":108}],"target_id":"concept.wikipedia.availability-heuristic","target_kind":"node","target_sha256":"5a7ab2ea11bf7e300aafae1c2058288ce399ad332d4565c3bc694f797fbdeffa"}],"concept.wikipedia.availability-zone":[{"id":"assertion.concept.wikipedia.availability-zone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability zone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability zone\", CC BY-SA 4.0) states: In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","support":[{"end":224,"quote":"In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","source_id":"wikipedia.article.availability-zone","source_sha256":"c2c3d0a0538e0a0216e1b391a757e0360a42cef1d6a6ef14a132c311c6443954","start":105}],"target_id":"concept.wikipedia.availability-zone","target_kind":"node","target_sha256":"36bfc36bac2f75607c60fc9fedb8e5f3ccadde5fe6f7ceb7c5f44d17f8faeb8c"}],"concept.wikipedia.average-treatment-effect":[{"id":"assertion.concept.wikipedia.average-treatment-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Average treatment effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Average treatment effect\", CC BY-SA 4.0) states: The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","support":[{"end":288,"quote":"The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","source_id":"wikipedia.article.average-treatment-effect","source_sha256":"3423a3424ca95fb2b9adc54aae725faa421ae0bcab2bea6bcc8d77808bf556cf","start":112}],"target_id":"concept.wikipedia.average-treatment-effect","target_kind":"node","target_sha256":"e111a45d0bb3c0955bbd6342ea0d40f1a9dc739ae53d2228ad965a39d7eccdb5"}],"concept.wikipedia.avionics":[{"id":"assertion.concept.wikipedia.avionics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Avionics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Avionics\", CC BY-SA 4.0) states: Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","support":[{"end":189,"quote":"Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","source_id":"wikipedia.article.avionics","source_sha256":"dcb48872d325afc7e527700d425b1eb117322c0081482b064068ab5e022e507f","start":92}],"target_id":"concept.wikipedia.avionics","target_kind":"node","target_sha256":"fad0516dd3ce02a5ad5380dda16e093a4cc7da369ba04a147582dd42ebd71280"}],"concept.wikipedia.avulsion-river":[{"id":"assertion.concept.wikipedia.avulsion-river","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Avulsion (river) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Avulsion (river)\", CC BY-SA 4.0) states: In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","support":[{"end":309,"quote":"In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","source_id":"wikipedia.article.avulsion-river","source_sha256":"1338b41307b2f0efd764f7eea9b10da7bf1012a68975f757fba3f3a84a02061a","start":104}],"target_id":"concept.wikipedia.avulsion-river","target_kind":"node","target_sha256":"0831764ae61dbe3bbb3fa91d70d1b5b8866d77e6954af1ff9ddae966d9ee6ff4"}],"concept.wikipedia.axial-fan-design":[{"id":"assertion.concept.wikipedia.axial-fan-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial fan design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial fan design\", CC BY-SA 4.0) states: An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","support":[{"end":263,"quote":"An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","source_id":"wikipedia.article.axial-fan-design","source_sha256":"1db6ed4046f7576b514d70a8b441da808faa2e5b13565ab41db4ad840104913d","start":104}],"target_id":"concept.wikipedia.axial-fan-design","target_kind":"node","target_sha256":"88ae575fefc5893930e06c5db8c268e64f601daeeed818a4627e34479d285bb4"}],"concept.wikipedia.axial-flow-pump":[{"id":"assertion.concept.wikipedia.axial-flow-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial-flow pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial-flow pump\", CC BY-SA 4.0) states: An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","support":[{"end":226,"quote":"An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","source_id":"wikipedia.article.axial-flow-pump","source_sha256":"ebaff606dc0ceac1a93bca8797af00059daa40f16a0d2d9d16b426b444d71e90","start":102}],"target_id":"concept.wikipedia.axial-flow-pump","target_kind":"node","target_sha256":"d3c33e91f26f3aaeb9b27be7192a726d74d3c8baa18087c6bbd3c26c19b8b7cd"}],"concept.wikipedia.axial-flux-motor":[{"id":"assertion.concept.wikipedia.axial-flux-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial flux motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial flux motor\", CC BY-SA 4.0) states: An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","support":[{"end":460,"quote":"An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","source_id":"wikipedia.article.axial-flux-motor","source_sha256":"1747124612c4c34835ad266689216123c20645e7adc47c958ba6a5e731ea9259","start":104}],"target_id":"concept.wikipedia.axial-flux-motor","target_kind":"node","target_sha256":"510bee9f4c52cd2f2879a542b04ca968d3f2f44a8b8ebec8ddf4a499c9476ce2"}],"concept.wikipedia.axial-piston-pump":[{"id":"assertion.concept.wikipedia.axial-piston-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial piston pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial piston pump\", CC BY-SA 4.0) states: An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","support":[{"end":230,"quote":"An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","source_id":"wikipedia.article.axial-piston-pump","source_sha256":"a5b4bc12a4098a7dc4dbbb61445a34c7086524cded2c672ebc98874cfc07dffc","start":104}],"target_id":"concept.wikipedia.axial-piston-pump","target_kind":"node","target_sha256":"2d969f2e49b4f6019360cdf64a17497aad3adb08523c40d57528abf7aa6dbd81"}],"concept.wikipedia.axial-turbine":[{"id":"assertion.concept.wikipedia.axial-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial turbine\", CC BY-SA 4.0) states: In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","support":[{"end":301,"quote":"In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","source_id":"wikipedia.article.axial-turbine","source_sha256":"911722de645906a7bf4e20c40550dedc4b89d7b4613e384829cceeaeb7e342a4","start":101}],"target_id":"concept.wikipedia.axial-turbine","target_kind":"node","target_sha256":"51067c8cf3cfc9067d4846c0eabf4b1a7e5116009b9ae57dbd75291bb1515966"}],"concept.wikipedia.axiom-of-countability":[{"id":"assertion.concept.wikipedia.axiom-of-countability","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiom of countability as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiom of countability\", CC BY-SA 4.0) states: In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","support":[{"end":264,"quote":"In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","source_id":"wikipedia.article.axiom-of-countability","source_sha256":"de4802b6229d5a4224a3ca04c2bfd5b371beb67ad81c33147ea6520395ce2097","start":107}],"target_id":"concept.wikipedia.axiom-of-countability","target_kind":"node","target_sha256":"e55e6477cd51f901c47b21f93f7b74dc480a7a4c3c95099b524c2de20d881e9b"}],"concept.wikipedia.axiom-of-reducibility":[{"id":"assertion.concept.wikipedia.axiom-of-reducibility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiom of reducibility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiom of reducibility\", CC BY-SA 4.0) states: The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","support":[{"end":236,"quote":"The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","source_id":"wikipedia.article.axiom-of-reducibility","source_sha256":"419f24f879cd80ad92bcd34cc0fa25b14463f67dcc122baf9783274eb74351de","start":109}],"target_id":"concept.wikipedia.axiom-of-reducibility","target_kind":"node","target_sha256":"ef6b048a1ac6e108bb4cb94db51ad47ab390aea076bc1a8b74cf976a1c304832"}],"concept.wikipedia.axiomatic-design":[{"id":"assertion.concept.wikipedia.axiomatic-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiomatic design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiomatic design\", CC BY-SA 4.0) states: Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","support":[{"end":307,"quote":"Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","source_id":"wikipedia.article.axiomatic-design","source_sha256":"34e7485da98d139089f56013a6ed23f9c50559527f67ed374da2ed66f8b9b656","start":103}],"target_id":"concept.wikipedia.axiomatic-design","target_kind":"node","target_sha256":"94d90e5142642aa60220e77fd93ee9b293bb8449ff4aaf90d976c7298edebdd0"}],"concept.wikipedia.axiomatic-foundations-of-topological-spaces":[{"id":"assertion.concept.wikipedia.axiomatic-foundations-of-topological-spaces","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiomatic foundations of topological spaces as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiomatic foundations of topological spaces\", CC BY-SA 4.0) states: In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","support":[{"end":235,"quote":"In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","source_id":"wikipedia.article.axiomatic-foundations-of-topological-spaces","source_sha256":"ff2e026ccd7db96f4e19d94afe017d64eefcb6089ef3f9dee106261b28dbecf8","start":130}],"target_id":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","target_kind":"node","target_sha256":"69f286c2622546a48441f4dc35650ed714839d80bf40e522c724472f8e3452eb"}],"concept.wikipedia.b-n-pair":[{"id":"assertion.concept.wikipedia.b-n-pair","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"(B, N) pair as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"(B, N) pair\", CC BY-SA 4.0) states: In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","support":[{"end":277,"quote":"In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","source_id":"wikipedia.article.b-n-pair","source_sha256":"4b4e427c536a9f5b5176fee23934ba593acaf34e62ded88ed2b981b9b29a6b91","start":98}],"target_id":"concept.wikipedia.b-n-pair","target_kind":"node","target_sha256":"3c99bcbd9cd75b2eb8788e3a0c448d3eaa65a7f666a4737ff5dcba0c01a4c973"}],"concept.wikipedia.b-theory-of-time":[{"id":"assertion.concept.wikipedia.b-theory-of-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"B-theory of time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"B-theory of time\", CC BY-SA 4.0) states: The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","support":[{"end":260,"quote":"The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","source_id":"wikipedia.article.b-theory-of-time","source_sha256":"b31451a83150a28de7fa69dc16a525c580495b0e391d5965014061808e14f6d5","start":104}],"target_id":"concept.wikipedia.b-theory-of-time","target_kind":"node","target_sha256":"2cc556136ae14d64a61b5ffb89b4b25848a100d02b2ed0f3061960d5c9f0e76a"}],"concept.wikipedia.baby-step-giant-step":[{"id":"assertion.concept.wikipedia.baby-step-giant-step","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baby-step giant-step as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baby-step giant-step\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","support":[{"end":310,"quote":"In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","source_id":"wikipedia.article.baby-step-giant-step","source_sha256":"85d557eb28bb90e06faf2faa1e8ba2ac6f4a3373c91a018b07f67103b180c9b7","start":106}],"target_id":"concept.wikipedia.baby-step-giant-step","target_kind":"node","target_sha256":"71d1a9537552a55871b84f55cb6f1de027faa4fb7ab90d24eabefe210c0fb7eb"}],"concept.wikipedia.bachmann-howard-ordinal":[{"id":"assertion.concept.wikipedia.bachmann-howard-ordinal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bachmann–Howard ordinal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bachmann–Howard ordinal\", CC BY-SA 4.0) states: In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","support":[{"end":247,"quote":"In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","source_id":"wikipedia.article.bachmann-howard-ordinal","source_sha256":"d767f23e253085f958822239354ed3c0cf6e2cfdc3ca93c9c67eaef49d81e020","start":111}],"target_id":"concept.wikipedia.bachmann-howard-ordinal","target_kind":"node","target_sha256":"20944b4129e16ae250f5ec5247ed34a7c788d4cec6e836be58473c4e1e52d8a7"}],"concept.wikipedia.back-and-forth-method":[{"id":"assertion.concept.wikipedia.back-and-forth-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Back-and-forth method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Back-and-forth method\", CC BY-SA 4.0) states: In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","support":[{"end":303,"quote":"In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","source_id":"wikipedia.article.back-and-forth-method","source_sha256":"126ff9754790d033e584a5425e20ea9029e52342c682198a1ad484e193b5f0a3","start":108}],"target_id":"concept.wikipedia.back-and-forth-method","target_kind":"node","target_sha256":"4fc0043f09ddae41cfa6050478192638095c38b2f6a62d178eea41ff9e72e0c3"}],"concept.wikipedia.backcasting":[{"id":"assertion.concept.wikipedia.backcasting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backcasting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backcasting\", CC BY-SA 4.0) states: Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","support":[{"end":290,"quote":"Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","source_id":"wikipedia.article.backcasting","source_sha256":"11c2890f3b213d6f8e0d54342dc16d55818eaccfccdbf765ad113581c14b1c8c","start":98}],"target_id":"concept.wikipedia.backcasting","target_kind":"node","target_sha256":"6e15eb98784f6c74e3f2e4543cbb55b59f89c09f2d4f04e06291e7f19ff4bc0c"}],"concept.wikipedia.backlash-engineering":[{"id":"assertion.concept.wikipedia.backlash-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backlash (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backlash (engineering)\", CC BY-SA 4.0) states: In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","support":[{"end":263,"quote":"In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","source_id":"wikipedia.article.backlash-engineering","source_sha256":"b6e26f2d1bb7bbd1a874baff923c492c730ed44a9bf813454af4c53de6036df3","start":110}],"target_id":"concept.wikipedia.backlash-engineering","target_kind":"node","target_sha256":"0ddb02a11d6e491b5c6cb4f7e1ef7159ac229fbdd1883e14a38e859b125be1fa"}],"concept.wikipedia.backward-chaining":[{"id":"assertion.concept.wikipedia.backward-chaining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backward chaining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backward chaining\", CC BY-SA 4.0) states: Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","support":[{"end":225,"quote":"Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","source_id":"wikipedia.article.backward-chaining","source_sha256":"e41d6e68a5d5e4fdda9acdee23402ca9d3a5cde65d10ea116d66ce3d11ae0b27","start":103}],"target_id":"concept.wikipedia.backward-chaining","target_kind":"node","target_sha256":"603fcc5085684ad2c196abb5eac5e4c987857742f572198da5218ac367283c71"}],"concept.wikipedia.backward-induction":[{"id":"assertion.concept.wikipedia.backward-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backward induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backward induction\", CC BY-SA 4.0) states: Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","support":[{"end":298,"quote":"Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","source_id":"wikipedia.article.backward-induction","source_sha256":"015c3de876a99426fcad512b0b448445e144caafb5d9c10d9b144e665a4a079e","start":105}],"target_id":"concept.wikipedia.backward-induction","target_kind":"node","target_sha256":"20ab9e0be7a162f0707a820563788fe7ef94dc366ebd5f0d00b7b3259085e21d"}],"concept.wikipedia.baconian-method":[{"id":"assertion.concept.wikipedia.baconian-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baconian method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baconian method\", CC BY-SA 4.0) states: The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","support":[{"end":274,"quote":"The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","source_id":"wikipedia.article.baconian-method","source_sha256":"b38d3884a12049790c928275c86c08c484d703095a10ca13f43fa8360618afca","start":100}],"target_id":"concept.wikipedia.baconian-method","target_kind":"node","target_sha256":"7e03301284cffa5cb3a39fda7366058f1c0d6887da48e5763432de70a9c00096"}],"concept.wikipedia.baer-norm":[{"id":"assertion.concept.wikipedia.baer-norm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baer norm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baer norm\", CC BY-SA 4.0) states: In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","support":[{"end":222,"quote":"In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","source_id":"wikipedia.article.baer-norm","source_sha256":"bafd620d1c0c32bc4d3c592971cc37479d8150f563472962f934f2f6e6eb691f","start":96}],"target_id":"concept.wikipedia.baer-norm","target_kind":"node","target_sha256":"829e83eedfd22b59c996ed0c7a48e4b545f598542c762ad1bd8bd3f680796c58"}],"concept.wikipedia.baffle-heat-transfer":[{"id":"assertion.concept.wikipedia.baffle-heat-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baffle (heat transfer) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baffle (heat transfer)\", CC BY-SA 4.0) states: Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","support":[{"end":207,"quote":"Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","source_id":"wikipedia.article.baffle-heat-transfer","source_sha256":"9c70384685135f38bea0f60f8d6029b4f515bb7afa994c058390952c06e3e2c2","start":110}],"target_id":"concept.wikipedia.baffle-heat-transfer","target_kind":"node","target_sha256":"da9ae06b8c1e2e3b88435f85a64579574805e2cd070a3a725d3b876feb89d613"}],"concept.wikipedia.bagel-machine":[{"id":"assertion.concept.wikipedia.bagel-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bagel machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bagel machine\", CC BY-SA 4.0) states: A bagel machine is a machine that automatically produces bagels.","support":[{"end":165,"quote":"A bagel machine is a machine that automatically produces bagels.","source_id":"wikipedia.article.bagel-machine","source_sha256":"d4b26667ba59aa03276838e59dea563608b5c7911385df2e11aab5098eaa9792","start":101}],"target_id":"concept.wikipedia.bagel-machine","target_kind":"node","target_sha256":"1ceb4bd0cdbbd8581b42c298d1eadcc81fd103e6dbcc657192189baf7ef05cb7"}],"concept.wikipedia.baire-one-star-function":[{"id":"assertion.concept.wikipedia.baire-one-star-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire one star function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire one star function\", CC BY-SA 4.0) states: A Baire one star function is a type of function studied in real analysis.","support":[{"end":183,"quote":"A Baire one star function is a type of function studied in real analysis.","source_id":"wikipedia.article.baire-one-star-function","source_sha256":"e765572c674dc711e925227dc0081490800af66d0ad169f57fb2727227c24b8b","start":110}],"target_id":"concept.wikipedia.baire-one-star-function","target_kind":"node","target_sha256":"a53e58047318488dbf64016d68c2bafe003a44384afe342012f879cd49a14f37"}],"concept.wikipedia.baire-space-set-theory":[{"id":"assertion.concept.wikipedia.baire-space-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire space (set theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire space (set theory)\", CC BY-SA 4.0) states: In set theory, the Baire space is the set of all infinite sequences of natural numbers.","support":[{"end":198,"quote":"In set theory, the Baire space is the set of all infinite sequences of natural numbers.","source_id":"wikipedia.article.baire-space-set-theory","source_sha256":"de2ac883a51ab13c03796689cb3d8e50d2fe6d6b13d96dfd1a8e99a5658d3367","start":111}],"target_id":"concept.wikipedia.baire-space-set-theory","target_kind":"node","target_sha256":"d8709ec3beb9691c9e3e557915ba8d74ed8b6f329314587fe761cac8c25dbbdd"}],"concept.wikipedia.baker-clamp":[{"id":"assertion.concept.wikipedia.baker-clamp","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baker clamp as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baker clamp\", CC BY-SA 4.0) states: Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","support":[{"end":316,"quote":"Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","source_id":"wikipedia.article.baker-clamp","source_sha256":"76d5e14709dbd457f7ac093dd64535c0bec17d0055d8a2a19e8dfca118af9648","start":99}],"target_id":"concept.wikipedia.baker-clamp","target_kind":"node","target_sha256":"5b79c4dff8fb4ee97c64199acf9d712eb2e1c8fbef42150348c5646cbf7bd649"}],"concept.wikipedia.balancing-lake":[{"id":"assertion.concept.wikipedia.balancing-lake","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Balancing lake as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Balancing lake\", CC BY-SA 4.0) states: A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","support":[{"end":253,"quote":"A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","source_id":"wikipedia.article.balancing-lake","source_sha256":"01cae08d9c34318143e0efbc367d9776bf38e0b343705eddfeb13172f5a31b9e","start":101}],"target_id":"concept.wikipedia.balancing-lake","target_kind":"node","target_sha256":"55c9825ba12c179ce94ca4e8dfc5cde112c348d671cc8e5e51371e63509f3f28"}],"concept.wikipedia.ball-bearing":[{"id":"assertion.concept.wikipedia.ball-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball (bearing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball (bearing)\", CC BY-SA 4.0) states: Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","support":[{"end":264,"quote":"Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","source_id":"wikipedia.article.ball-bearing","source_sha256":"de9fe8ad6a434f06d5526e8fa0c3ba048d5ed892abf28682ab871b378cb14097","start":102}],"target_id":"concept.wikipedia.ball-bearing","target_kind":"node","target_sha256":"b5782c7f160d3780438312132ce6477eb7592412ff697063c61c0dc82231c998"}],"concept.wikipedia.ball-detent":[{"id":"assertion.concept.wikipedia.ball-detent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball detent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball detent\", CC BY-SA 4.0) states: A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","support":[{"end":231,"quote":"A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","source_id":"wikipedia.article.ball-detent","source_sha256":"7247cb062903625bfd8884503f0bc4c2cfdbbe7701387dc6e38b64d9713f7c7b","start":98}],"target_id":"concept.wikipedia.ball-detent","target_kind":"node","target_sha256":"de1781f6b3e6c53c552df910f87cb59eaa986d8fed95c35cb832ae09e8fcf7db"}],"concept.wikipedia.ball-differential":[{"id":"assertion.concept.wikipedia.ball-differential","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball differential as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball differential\", CC BY-SA 4.0) states: A ball differential is a type of differential typically used on radio-controlled cars.","support":[{"end":190,"quote":"A ball differential is a type of differential typically used on radio-controlled cars.","source_id":"wikipedia.article.ball-differential","source_sha256":"a3c91920ead8c0c627b17d9995120805938b68368656ad2c8cb2721bf6ee21a6","start":104}],"target_id":"concept.wikipedia.ball-differential","target_kind":"node","target_sha256":"14c252353ea2a5bc3d8253ad1b6425482d3342c7efcf1c7c2e80d83c7b10975a"}],"concept.wikipedia.ball-joint":[{"id":"assertion.concept.wikipedia.ball-joint","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball joint as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball joint\", CC BY-SA 4.0) states: In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","support":[{"end":254,"quote":"In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","source_id":"wikipedia.article.ball-joint","source_sha256":"c18b1abc38b8bcc3136d3806abb90b5ecffbbde42f72d9d00ac0b8fb582da0f2","start":97}],"target_id":"concept.wikipedia.ball-joint","target_kind":"node","target_sha256":"825fa0b556c7dbed75dfceb634f921d37cf44ba5e2bfd9cd31476c72c36f903b"}],"concept.wikipedia.ball-mathematics":[{"id":"assertion.concept.wikipedia.ball-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball (mathematics)\", CC BY-SA 4.0) states: In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","support":[{"end":201,"quote":"In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","source_id":"wikipedia.article.ball-mathematics","source_sha256":"a1679b3104731aa1c62b711098e376339643b542b547f0d2ada3bf3b3e790394","start":104}],"target_id":"concept.wikipedia.ball-mathematics","target_kind":"node","target_sha256":"4ffe23e542c86dd8c21207b2aa8f03bf94c0fc3fb016191b3acb91183d0cb7b7"}],"concept.wikipedia.ball-screw":[{"id":"assertion.concept.wikipedia.ball-screw","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball screw as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball screw\", CC BY-SA 4.0) states: A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","support":[{"end":229,"quote":"A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","source_id":"wikipedia.article.ball-screw","source_sha256":"f5060692f8f3bf9b3873714db46c5fbf4736c679e921653bc47112de029e7509","start":97}],"target_id":"concept.wikipedia.ball-screw","target_kind":"node","target_sha256":"72e53ef93fad6c919d4e3c16a51f60ce4423d5db1d26fb9dc3484a8a80b4a6f0"}],"concept.wikipedia.ball-valve":[{"id":"assertion.concept.wikipedia.ball-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball valve\", CC BY-SA 4.0) states: A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","support":[{"end":253,"quote":"A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","source_id":"wikipedia.article.ball-valve","source_sha256":"57cf19c866df1b986ecf949b9774adc6dd0bd02de6b8d3225f5b729871801056","start":96}],"target_id":"concept.wikipedia.ball-valve","target_kind":"node","target_sha256":"7ce4ebdf6fba1843f7b0b3cb6a784f347b4529de44e63d9228ae187a7f28985e"}],"concept.wikipedia.ballast":[{"id":"assertion.concept.wikipedia.ballast","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ballast as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ballast\", CC BY-SA 4.0) states: Ballast is dense material used as a weight to provide stability to a vehicle or structure.","support":[{"end":185,"quote":"Ballast is dense material used as a weight to provide stability to a vehicle or structure.","source_id":"wikipedia.article.ballast","source_sha256":"c3a88a1ec213b7976794d807e3b3a4a61ac624384008696e81fbd9178bd77aed","start":95}],"target_id":"concept.wikipedia.ballast","target_kind":"node","target_sha256":"599ba1a0b362bd47af942a5fceff5234d94565502d20760797b1af8769c24183"}],"concept.wikipedia.ban-number":[{"id":"assertion.concept.wikipedia.ban-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ban number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ban number\", CC BY-SA 4.0) states: In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \"banned.\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","support":[{"end":404,"quote":"In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \\\"banned.\\\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","source_id":"wikipedia.article.ban-number","source_sha256":"25b9e712ce2f3e83fb07a63ec52e47da39227155013f716a285378b33287eb7b","start":97}],"target_id":"concept.wikipedia.ban-number","target_kind":"node","target_sha256":"e4a7c5b384cb2b0624abca219360b2b0fdcadb5db1c73de67d2e114d0abaac05"}],"concept.wikipedia.bandgap-voltage-reference":[{"id":"assertion.concept.wikipedia.bandgap-voltage-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bandgap voltage reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bandgap voltage reference\", CC BY-SA 4.0) states: A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","support":[{"end":205,"quote":"A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","source_id":"wikipedia.article.bandgap-voltage-reference","source_sha256":"5a4d4bd1eeba4d7664633ba880b953e7f1294126170043b207100d8dc35c6d04","start":111}],"target_id":"concept.wikipedia.bandgap-voltage-reference","target_kind":"node","target_sha256":"86c7fbe6b15e32429c90fd2690e38e8f5208f320ac5243bcdb58d59c75c92da4"}],"concept.wikipedia.bandwagon-effect":[{"id":"assertion.concept.wikipedia.bandwagon-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bandwagon effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bandwagon effect\", CC BY-SA 4.0) states: The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","support":[{"end":247,"quote":"The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","source_id":"wikipedia.article.bandwagon-effect","source_sha256":"e6692def41a6da861b303e11d46851e1a021b72e736148528a015942addb2d42","start":102}],"target_id":"concept.wikipedia.bandwagon-effect","target_kind":"node","target_sha256":"aad1880230023d600ec3faf6a4ba86853c535644466a0c2567b8587e65779261"}],"concept.wikipedia.bar-complex":[{"id":"assertion.concept.wikipedia.bar-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bar complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bar complex\", CC BY-SA 4.0) states: In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","support":[{"end":284,"quote":"In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","source_id":"wikipedia.article.bar-complex","source_sha256":"71a4fb74a48e1a97d8e54f23844318e154d2b5e5ac187ab3d7b310f0cbf88f2a","start":99}],"target_id":"concept.wikipedia.bar-complex","target_kind":"node","target_sha256":"cf20265f1a420fcaaeb00841f88fb5c7e88086ab55dc2e4cac317d31061b7e28"}],"concept.wikipedia.barkhausen-stability-criterion":[{"id":"assertion.concept.wikipedia.barkhausen-stability-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barkhausen stability criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barkhausen stability criterion\", CC BY-SA 4.0) states: In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","support":[{"end":258,"quote":"In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","source_id":"wikipedia.article.barkhausen-stability-criterion","source_sha256":"1ad2708566c613e1e76130d464bb2ec318e49c7eb8b0c02d00ec5f4c95a3008d","start":118}],"target_id":"concept.wikipedia.barkhausen-stability-criterion","target_kind":"node","target_sha256":"b7dee0b5c3ec51ade5120333918abe324d609dbe5ef735addbd674a6f40e5414"}],"concept.wikipedia.barlow-s-wheel":[{"id":"assertion.concept.wikipedia.barlow-s-wheel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barlow's wheel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barlow's wheel\", CC BY-SA 4.0) states: Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","support":[{"end":243,"quote":"Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","source_id":"wikipedia.article.barlow-s-wheel","source_sha256":"5011831772abf511b7567a6ac3290bff74b4a2ee751280ce51052e5670589a5e","start":100}],"target_id":"concept.wikipedia.barlow-s-wheel","target_kind":"node","target_sha256":"038becdd515cab94e1999b2ef8929aa0dae2a4ff7b4f97e5ad966c18205e9df8"}],"concept.wikipedia.barn-raising":[{"id":"assertion.concept.wikipedia.barn-raising","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barn raising as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barn raising\", CC BY-SA 4.0) states: A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","support":[{"end":245,"quote":"A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","source_id":"wikipedia.article.barn-raising","source_sha256":"8bdb643588acfcf6426781038fcca96e5092d8168089a19e15e9b32631cb6ee1","start":98}],"target_id":"concept.wikipedia.barn-raising","target_kind":"node","target_sha256":"0c376eea48087d4abd11cb6076c746b2d8c45ea4ab8dbeb2bfe38c80b88244e2"}],"concept.wikipedia.barycentric-coordinate-system":[{"id":"assertion.concept.wikipedia.barycentric-coordinate-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barycentric coordinate system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barycentric coordinate system\", CC BY-SA 4.0) states: In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","support":[{"end":349,"quote":"In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","source_id":"wikipedia.article.barycentric-coordinate-system","source_sha256":"60fd51e3c9facb1569b7d0a7d54db42cfbfdd6bfbe08683e27ca3097b1608fb7","start":115}],"target_id":"concept.wikipedia.barycentric-coordinate-system","target_kind":"node","target_sha256":"b356510e5dde392313924a7e239fc7129bd79daa3a7ed314000af617d3af62d9"}],"concept.wikipedia.barycentric-subdivision":[{"id":"assertion.concept.wikipedia.barycentric-subdivision","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barycentric subdivision as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barycentric subdivision\", CC BY-SA 4.0) states: In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","support":[{"end":218,"quote":"In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","source_id":"wikipedia.article.barycentric-subdivision","source_sha256":"951afc877a6c9fbb8b7fbfa05a355eb7f38579ad981ec104306b67ffbd9f2078","start":109}],"target_id":"concept.wikipedia.barycentric-subdivision","target_kind":"node","target_sha256":"9fecc54b2beabf7eb64ea0e349d6cbe7a0123d8959c5c83c4e69d71a0be1edac"}],"concept.wikipedia.base-50":[{"id":"assertion.concept.wikipedia.base-50","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Base 50 as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Base 50\", CC BY-SA 4.0) states: A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","support":[{"end":249,"quote":"A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","source_id":"wikipedia.article.base-50","source_sha256":"d7b82105b8e2049f55bcbaea759cfd3335c0c8d4e75bcdffee8568fc6cc43dca","start":95}],"target_id":"concept.wikipedia.base-50","target_kind":"node","target_sha256":"8db237b7762e792a2475e097811410b838c56b98c2cd5e4ff95fbd8684d1ddaa"}],"concept.wikipedia.base-unit-of-measurement":[{"id":"assertion.concept.wikipedia.base-unit-of-measurement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Base unit of measurement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Base unit of measurement\", CC BY-SA 4.0) states: A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","support":[{"end":243,"quote":"A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","source_id":"wikipedia.article.base-unit-of-measurement","source_sha256":"48ca80987fdbcf1c7219a7e0922df3a31e0073779ab10964f3be40619be57bd3","start":109}],"target_id":"concept.wikipedia.base-unit-of-measurement","target_kind":"node","target_sha256":"fad73c22b535153a120ec8f4dbaa0c43ab62d7490e8422df4ddf9139dbb43da9"}],"concept.wikipedia.basic-belief":[{"id":"assertion.concept.wikipedia.basic-belief","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basic belief as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basic belief\", CC BY-SA 4.0) states: Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism, the axioms of a belief system.","support":[{"end":264,"quote":"Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism,  the axioms of a belief system.","source_id":"wikipedia.article.basic-belief","source_sha256":"f4eb37f4cc6c0359e7c3c2e92b7ef17d765f20a7b0759ecc82a6ec97d2d6ff49","start":99}],"target_id":"concept.wikipedia.basic-belief","target_kind":"node","target_sha256":"320579906742bb0e1673cdfe7a323c14e845775ee63512058395d3edb969ac44"}],"concept.wikipedia.basis-function":[{"id":"assertion.concept.wikipedia.basis-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basis function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basis function\", CC BY-SA 4.0) states: In mathematics, a basis function is an element of a particular basis for a function space.","support":[{"end":189,"quote":"In mathematics, a basis function is an element of a particular basis for a function space.","source_id":"wikipedia.article.basis-function","source_sha256":"46ca4b760cc8d109468bafbd9edb53989c3bc505ece7bda26e1a7976dcc89e01","start":99}],"target_id":"concept.wikipedia.basis-function","target_kind":"node","target_sha256":"5fd6a6c283fdf149f6f48ec0a01d263d1528179f19aee9720e9642dfd6a661c9"}],"concept.wikipedia.basis-linear-algebra":[{"id":"assertion.concept.wikipedia.basis-linear-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basis (linear algebra) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basis (linear algebra)\", CC BY-SA 4.0) states: In mathematics, a set B of elements of a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","support":[{"end":468,"quote":"In mathematics, a set B of elements of  a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","source_id":"wikipedia.article.basis-linear-algebra","source_sha256":"b22eb31230e9b11ea718c201ade1e0f87239bfb05934b5ba098cc24c795f3e0e","start":107}],"target_id":"concept.wikipedia.basis-linear-algebra","target_kind":"node","target_sha256":"8bf7884fb2ccc3abac2a6ae586a767beff8f653cdb577ee3908e037efd2f6056"}],"concept.wikipedia.bateman-transform":[{"id":"assertion.concept.wikipedia.bateman-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bateman transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bateman transform\", CC BY-SA 4.0) states: In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","support":[{"end":357,"quote":"In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","source_id":"wikipedia.article.bateman-transform","source_sha256":"a565aa271c2afa96e4224ad587ffd12736c714071b4271fc0299900c0850afba","start":105}],"target_id":"concept.wikipedia.bateman-transform","target_kind":"node","target_sha256":"ed36765d5b0a76f39f88d7686cdf39e5ad3f0d23dd68cad22573909216a8ee79"}],"concept.wikipedia.bathtub-curve":[{"id":"assertion.concept.wikipedia.bathtub-curve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bathtub curve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bathtub curve\", CC BY-SA 4.0) states: In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","support":[{"end":254,"quote":"In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","source_id":"wikipedia.article.bathtub-curve","source_sha256":"59070032c6c82e768dbbe76d9cd315063e4d0f35ca41c6dcf6ebc2b7fab23ad1","start":100}],"target_id":"concept.wikipedia.bathtub-curve","target_kind":"node","target_sha256":"0505b5086d6a81294191f85b5d7f67cf6770f3aabd683cccafda3c61b21a993f"}],"concept.wikipedia.bating-leather":[{"id":"assertion.concept.wikipedia.bating-leather","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bating (leather) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bating (leather)\", CC BY-SA 4.0) states: Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","support":[{"end":469,"quote":"Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","source_id":"wikipedia.article.bating-leather","source_sha256":"d3a6408f5ae621cf4fdad2ba88e5d2abeb69b499ac5c2428c4d36e3f33a29851","start":104}],"target_id":"concept.wikipedia.bating-leather","target_kind":"node","target_sha256":"7563d0553fb938418f02e75c21d771fb64d33f60c549b21f220008939e365fbe"}],"concept.wikipedia.baubotanik":[{"id":"assertion.concept.wikipedia.baubotanik","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baubotanik as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baubotanik\", CC BY-SA 4.0) states: Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","support":[{"end":237,"quote":"Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","source_id":"wikipedia.article.baubotanik","source_sha256":"34a9aa1dcbcc81ddc89b2eaeadfe6ba79ea49ba7081810e4cac8fffb7c00f683","start":98}],"target_id":"concept.wikipedia.baubotanik","target_kind":"node","target_sha256":"f91be3bf9e825ff22a751144797566d634f680bbbb3eff3b41292a91c12452b4"}],"concept.wikipedia.bauschinger-effect":[{"id":"assertion.concept.wikipedia.bauschinger-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bauschinger effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bauschinger effect\", CC BY-SA 4.0) states: The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","support":[{"end":287,"quote":"The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","source_id":"wikipedia.article.bauschinger-effect","source_sha256":"63301d914370385cf21e2c69ca2d4845d343e94a02ceb2c53c861f13f1ca5039","start":105}],"target_id":"concept.wikipedia.bauschinger-effect","target_kind":"node","target_sha256":"ce29bb17b94c962b60eb6acc8ca4ea64e72a7d739e52d7ffc4470b79b448270f"}],"concept.wikipedia.bayonet-mount":[{"id":"assertion.concept.wikipedia.bayonet-mount","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bayonet mount as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bayonet mount\", CC BY-SA 4.0) states: A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","support":[{"end":471,"quote":"A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","source_id":"wikipedia.article.bayonet-mount","source_sha256":"d3d644f11748a0f67b9d9c838da10d1c85033c39290bac79fe1723846c4dc5db","start":100}],"target_id":"concept.wikipedia.bayonet-mount","target_kind":"node","target_sha256":"02e7ef9c97f3004124467edb03d6bc732f85d4700561de444cad3988432ed470"}],"concept.wikipedia.beam-bridge":[{"id":"assertion.concept.wikipedia.beam-bridge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beam bridge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beam bridge\", CC BY-SA 4.0) states: Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","support":[{"end":207,"quote":"Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","source_id":"wikipedia.article.beam-bridge","source_sha256":"01f9484aaba94f976bfc217dd43c5b9bfa0f179afa64416167c8be0355644d1b","start":98}],"target_id":"concept.wikipedia.beam-bridge","target_kind":"node","target_sha256":"4b27ac2b4fc4596477824dc8cff1b42c95c20c84ac3b77aa71da3ba15c74f6de"}],"concept.wikipedia.beam-structure":[{"id":"assertion.concept.wikipedia.beam-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beam (structure) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beam (structure)\", CC BY-SA 4.0) states: A beam is a structural element designed to carry loads perpendicular to its long (or \"horizontal\") axis.","support":[{"end":208,"quote":"A beam is a structural element designed to carry loads perpendicular to its long (or \\\"horizontal\\\") axis.","source_id":"wikipedia.article.beam-structure","source_sha256":"2b74e5d16d7757644e5c9b0e23b742780d6869b33514fcecad0f4854d291d86c","start":102}],"target_id":"concept.wikipedia.beam-structure","target_kind":"node","target_sha256":"cdaa3b4a509b59e97bfa572cdf112425329582a1f636d7ccbd61590127e10a64"}],"concept.wikipedia.beamline":[{"id":"assertion.concept.wikipedia.beamline","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beamline as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beamline\", CC BY-SA 4.0) states: In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","support":[{"end":318,"quote":"In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","source_id":"wikipedia.article.beamline","source_sha256":"9dcc4e0c0553e4bd51a502755ad606ad6a0103dc64b38ed9cc99026365679631","start":94}],"target_id":"concept.wikipedia.beamline","target_kind":"node","target_sha256":"8fbcd62035ffdf9933acd81191686b08ed9690fb6dc92c3580a63a5483617fe4"}],"concept.wikipedia.bearing-pressure":[{"id":"assertion.concept.wikipedia.bearing-pressure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bearing pressure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bearing pressure\", CC BY-SA 4.0) states: Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","support":[{"end":319,"quote":"Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","source_id":"wikipedia.article.bearing-pressure","source_sha256":"42727eca41b1ac661bab6b6bab9721af12fdbf003b0e066e58098e6baf395f91","start":104}],"target_id":"concept.wikipedia.bearing-pressure","target_kind":"node","target_sha256":"389771418e2b826df97c254cddcf74da987516e4cca3ac8afb7ebbd638dc15dd"}],"concept.wikipedia.bearing-surface":[{"id":"assertion.concept.wikipedia.bearing-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bearing surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bearing surface\", CC BY-SA 4.0) states: A bearing surface in mechanical engineering is the area of contact between two objects.","support":[{"end":190,"quote":"A bearing surface in mechanical engineering is the area of contact between two objects.","source_id":"wikipedia.article.bearing-surface","source_sha256":"3c25d1dce9080e726daa4bd5c913aaac634c205a39079d8e471e1d93912b49af","start":103}],"target_id":"concept.wikipedia.bearing-surface","target_kind":"node","target_sha256":"9effd893443065078b37221a6a22d9a4d1cebe4b20bc38302457b55c1fe95b75"}],"concept.wikipedia.beatty-sequence":[{"id":"assertion.concept.wikipedia.beatty-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beatty sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beatty sequence\", CC BY-SA 4.0) states: In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","support":[{"end":298,"quote":"In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","source_id":"wikipedia.article.beatty-sequence","source_sha256":"dc7158123e5cac5d93f283572b0941f9e37e8622dc13bc12e60d0f1aecfd6a79","start":102}],"target_id":"concept.wikipedia.beatty-sequence","target_kind":"node","target_sha256":"b3637eb7d034d73457e3ab5a1c418a74e3ad3c381562b4990437dc2437af498a"}],"concept.wikipedia.beer-engine":[{"id":"assertion.concept.wikipedia.beer-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beer engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beer engine\", CC BY-SA 4.0) states: A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","support":[{"end":188,"quote":"A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","source_id":"wikipedia.article.beer-engine","source_sha256":"05147fc5798e55d64b25514f281ff8292eff566ca20c4335940dc665e5664c5b","start":98}],"target_id":"concept.wikipedia.beer-engine","target_kind":"node","target_sha256":"634f39be739173373b4f4bc52b1e82b4eea0377377567f1ddb219127652d6949"}],"concept.wikipedia.beer-tap":[{"id":"assertion.concept.wikipedia.beer-tap","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beer tap as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beer tap\", CC BY-SA 4.0) states: A beer tap is a valved device for controlling the release of beer.","support":[{"end":160,"quote":"A beer tap is a valved device for controlling the release of beer.","source_id":"wikipedia.article.beer-tap","source_sha256":"6a3d07e489cf216225844f2e3efe907999777eafefed074285096e6206023dc3","start":94}],"target_id":"concept.wikipedia.beer-tap","target_kind":"node","target_sha256":"92faf772f61e4f9fa0ecc0242a0a705ce6ceaf13a2091045cc4dba1458d1a2d8"}],"concept.wikipedia.begging-the-question":[{"id":"assertion.concept.wikipedia.begging-the-question","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Begging the question as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Begging the question\", CC BY-SA 4.0) states: In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","support":[{"end":313,"quote":"In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","source_id":"wikipedia.article.begging-the-question","source_sha256":"1ad5c0c73dd43abaeaf3f4dcffd735615ce6da0459dc2324564259817e5aa9d5","start":105}],"target_id":"concept.wikipedia.begging-the-question","target_kind":"node","target_sha256":"2fd6d402eed2d2a4780bbd91e5a1818d7dc54b4082b74537a1c30f82f148cf0a"}],"concept.wikipedia.behavior-based-robotics":[{"id":"assertion.concept.wikipedia.behavior-based-robotics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behavior-based robotics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behavior-based robotics\", CC BY-SA 4.0) states: Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","support":[{"end":404,"quote":"Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","source_id":"wikipedia.article.behavior-based-robotics","source_sha256":"70bcbc7f7df6f3247acf7dec205a99bd042075e454ad87b10c205d14f2f9ef80","start":109}],"target_id":"concept.wikipedia.behavior-based-robotics","target_kind":"node","target_sha256":"4b4ad09251154db2e1a227f596124c52b8fa5ae37da7a716f58331b467e3ebcc"}],"concept.wikipedia.behavior-tree":[{"id":"assertion.concept.wikipedia.behavior-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behavior tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behavior tree\", CC BY-SA 4.0) states: A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","support":[{"end":241,"quote":"A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","source_id":"wikipedia.article.behavior-tree","source_sha256":"17d71d4c5ba391ec4948f439cc15f4dbb4e7df1f07a15fae11793b4abfddb6a9","start":101}],"target_id":"concept.wikipedia.behavior-tree","target_kind":"node","target_sha256":"76488d54324cb2730640a0769da39dead009353a66e264c0e2bdfb6808a77ce8"}],"concept.wikipedia.behrend-sequence":[{"id":"assertion.concept.wikipedia.behrend-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behrend sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behrend sequence\", CC BY-SA 4.0) states: In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","support":[{"end":208,"quote":"In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","source_id":"wikipedia.article.behrend-sequence","source_sha256":"ee7f01a49ef252232b7ff4d30dd1016db7361b23682a098ca201845123943a7f","start":104}],"target_id":"concept.wikipedia.behrend-sequence","target_kind":"node","target_sha256":"e51fc812cc0750448da52996c29c38128fb828d96264be0eb837137dbf2a8a08"}],"concept.wikipedia.belief":[{"id":"assertion.concept.wikipedia.belief","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief\", CC BY-SA 4.0) states: A belief is a subjective attitude that something is true or a state of affairs is the case.","support":[{"end":183,"quote":"A belief is a subjective attitude that something is true or a state of affairs is the case.","source_id":"wikipedia.article.belief","source_sha256":"87686ccf400255dbaec83df45d47fab8a02552f1f022d7708cf9a15e9cf3a64e","start":92}],"target_id":"concept.wikipedia.belief","target_kind":"node","target_sha256":"78d289c8b0a5393a109a85c4a7a527e5cca368f6b5bf83ef8b67bdf9c1185991"}],"concept.wikipedia.belief-desire-intention-model":[{"id":"assertion.concept.wikipedia.belief-desire-intention-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief–desire–intention model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief–desire–intention model\", CC BY-SA 4.0) states: For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","support":[{"end":291,"quote":"For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","source_id":"wikipedia.article.belief-desire-intention-model","source_sha256":"042937fec851fb465dd5c893135c4faa622f9d7a28d91581720b5fc3eaac5197","start":116}],"target_id":"concept.wikipedia.belief-desire-intention-model","target_kind":"node","target_sha256":"4e5b51fdc22c9b134cc03b7b7b3bee1f78104e6f0b7873b4ff30d772603eb4cf"}],"concept.wikipedia.belief-revision":[{"id":"assertion.concept.wikipedia.belief-revision","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief revision as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief revision\", CC BY-SA 4.0) states: Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","support":[{"end":229,"quote":"Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","source_id":"wikipedia.article.belief-revision","source_sha256":"c6ac8d5bbaa70be2b75e2d60aeeadbc4b4a9c0be21bf8956da9b6cf8dc2866dd","start":102}],"target_id":"concept.wikipedia.belief-revision","target_kind":"node","target_sha256":"7ce3d286b9aae7237b6b2ac141df828fb4b08d6481f41b43c94f22acb4e583f0"}],"concept.wikipedia.bell-nipple":[{"id":"assertion.concept.wikipedia.bell-nipple","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bell nipple as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bell nipple\", CC BY-SA 4.0) states: A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","support":[{"end":328,"quote":"A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","source_id":"wikipedia.article.bell-nipple","source_sha256":"ed93e9d0f0b9521c1f3f7c6ce51f3b23ed43638f4c5b656b6df4ef8b27a04275","start":99}],"target_id":"concept.wikipedia.bell-nipple","target_kind":"node","target_sha256":"6a420b580d5a83366357048e0f13f6540152d6ac41a32113f4192852c35fa90f"}],"concept.wikipedia.bell-polynomials":[{"id":"assertion.concept.wikipedia.bell-polynomials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bell polynomials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bell polynomials\", CC BY-SA 4.0) states: In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","support":[{"end":230,"quote":"In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","source_id":"wikipedia.article.bell-polynomials","source_sha256":"ad726b2cf38b2d06c4dbd52e2a64823da60458cdaa9fa9e83d70dde1a40f6207","start":102}],"target_id":"concept.wikipedia.bell-polynomials","target_kind":"node","target_sha256":"becac1119715960c887120725c3b153c704123c5eab02da6b81076593cb56521"}],"concept.wikipedia.belt-mechanical":[{"id":"assertion.concept.wikipedia.belt-mechanical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belt (mechanical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belt (mechanical)\", CC BY-SA 4.0) states: A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","support":[{"end":217,"quote":"A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","source_id":"wikipedia.article.belt-mechanical","source_sha256":"02bdc37bbf865c1cd94ce58810ec3eb73cd4a0c9ac9c4c914ec0f04f7ddd91b7","start":104}],"target_id":"concept.wikipedia.belt-mechanical","target_kind":"node","target_sha256":"af02468a051fd63d02562bd3b4f6ec5c0eb0f8590e4a2e27e9d97965834ae8fd"}],"concept.wikipedia.benacerraf-s-identification-problem":[{"id":"assertion.concept.wikipedia.benacerraf-s-identification-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Benacerraf's identification problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Benacerraf's identification problem\", CC BY-SA 4.0) states: In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \"What Numbers Could Not Be\".","support":[{"end":357,"quote":"In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \\\"What Numbers Could Not Be\\\".","source_id":"wikipedia.article.benacerraf-s-identification-problem","source_sha256":"a9cdc12cbd03732f979710a02782c2fb6d740eb2e7529434634bb08ee0f15bf7","start":123}],"target_id":"concept.wikipedia.benacerraf-s-identification-problem","target_kind":"node","target_sha256":"f0858e159391f3285cc05d266ec0773f9d9e52538ad65dea9f6aca3f86adde10"}],"concept.wikipedia.bending-moment":[{"id":"assertion.concept.wikipedia.bending-moment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bending moment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bending moment\", CC BY-SA 4.0) states: In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","support":[{"end":245,"quote":"In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","source_id":"wikipedia.article.bending-moment","source_sha256":"9616ed9b33b59dc804e1b5894ee9c213e03b03c9f277f3133d1a79927f799226","start":101}],"target_id":"concept.wikipedia.bending-moment","target_kind":"node","target_sha256":"476dc5345d86dc48d0da5ddc0509727f0996928d992fe6c0428d7cdbb34463a4"}],"concept.wikipedia.bendix-drive":[{"id":"assertion.concept.wikipedia.bendix-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bendix drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bendix drive\", CC BY-SA 4.0) states: A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","support":[{"end":203,"quote":"A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","source_id":"wikipedia.article.bendix-drive","source_sha256":"a43aa49e787a14fd99ad01e248242e3c8d1cb06fae8939a8a6dd0ab87175635c","start":100}],"target_id":"concept.wikipedia.bendix-drive","target_kind":"node","target_sha256":"bce4410fc81fdead33accd0bbf3e8436d48b05a3eac55577774da85c210bb91e"}],"concept.wikipedia.bent-structural":[{"id":"assertion.concept.wikipedia.bent-structural","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bent (structural) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bent (structural)\", CC BY-SA 4.0) states: A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","support":[{"end":212,"quote":"A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","source_id":"wikipedia.article.bent-structural","source_sha256":"dbba1ccfdc6d7a793f9165b46e564022e1027cd1941af913a01ff9b39d9b87b2","start":105}],"target_id":"concept.wikipedia.bent-structural","target_kind":"node","target_sha256":"0cb414e18d8abeb59622319c34277fbe7305aa9f38a29ec81581f7b44d450a70"}],"concept.wikipedia.bentley-s-paradox":[{"id":"assertion.concept.wikipedia.bentley-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bentley's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bentley's paradox\", CC BY-SA 4.0) states: In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","support":[{"end":319,"quote":"In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox  or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","source_id":"wikipedia.article.bentley-s-paradox","source_sha256":"117a23cae32ff2f23191178dc21453f3cafa8b327a4f54ec1cd66b456f306463","start":105}],"target_id":"concept.wikipedia.bentley-s-paradox","target_kind":"node","target_sha256":"ae666f8c69c5fb16466cbf34e3e996153eebb8e68ba371b123d83a35cf8f1bec"}],"concept.wikipedia.bergeron-diagram":[{"id":"assertion.concept.wikipedia.bergeron-diagram","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bergeron diagram as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bergeron diagram\", CC BY-SA 4.0) states: The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","support":[{"end":207,"quote":"The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","source_id":"wikipedia.article.bergeron-diagram","source_sha256":"b4c0fb4b1f96fde6a2b242200d2ee15e23b63855ec9daaff9ab48db0b9582dbc","start":104}],"target_id":"concept.wikipedia.bergeron-diagram","target_kind":"node","target_sha256":"b19ef93e6f6547e64b55602ebf8e045571136fb07ae49ab13267030480f5f60e"}],"concept.wikipedia.bernstein-polynomial":[{"id":"assertion.concept.wikipedia.bernstein-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein polynomial\", CC BY-SA 4.0) states: In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","support":[{"end":259,"quote":"In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","source_id":"wikipedia.article.bernstein-polynomial","source_sha256":"58b6a2f018b755ba9f9c76d547a2175f54a0014f296889abd494f3bc949dc51b","start":106}],"target_id":"concept.wikipedia.bernstein-polynomial","target_kind":"node","target_sha256":"d1a3356528a3cbbea82377886ca992bcfe5d6f8fcdc1ec7a6982eb836e26732f"}],"concept.wikipedia.bernstein-s-constant":[{"id":"assertion.concept.wikipedia.bernstein-s-constant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein's constant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein's constant\", CC BY-SA 4.0) states: Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","support":[{"end":276,"quote":"Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","source_id":"wikipedia.article.bernstein-s-constant","source_sha256":"ed533a076f9e7f1c159972c065c84e3d7d4aba1609a41a4b0a17a4abf71456c7","start":108}],"target_id":"concept.wikipedia.bernstein-s-constant","target_kind":"node","target_sha256":"6415dd91c27720c550e677f28a737056236b1a8a11dae368600a8a55844ee0c8"}],"concept.wikipedia.bernstein-sato-polynomial":[{"id":"assertion.concept.wikipedia.bernstein-sato-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein–Sato polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein–Sato polynomial\", CC BY-SA 4.0) states: In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","support":[{"end":322,"quote":"In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","source_id":"wikipedia.article.bernstein-sato-polynomial","source_sha256":"251246ada33c8b6071543d24a9cd32c67218334c3bf3686715ede6c821dedbf5","start":112}],"target_id":"concept.wikipedia.bernstein-sato-polynomial","target_kind":"node","target_sha256":"5402919b35799216526c3ddcb7ec2099f8a325b5f3031f102fe7499d442bfbfc"}],"concept.wikipedia.berry-robbins-problem":[{"id":"assertion.concept.wikipedia.berry-robbins-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Berry–Robbins problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Berry–Robbins problem\", CC BY-SA 4.0) states: In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","support":[{"end":327,"quote":"In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","source_id":"wikipedia.article.berry-robbins-problem","source_sha256":"2d8a37531bb9ba8fc58054d4a3e187819a740d3b6873d453010408d586bf5a44","start":109}],"target_id":"concept.wikipedia.berry-robbins-problem","target_kind":"node","target_sha256":"ad0ea6ad9d853714458947edbf788c06e469e6a70a41e22857199b35d0985bc5"}],"concept.wikipedia.bessel-function":[{"id":"assertion.concept.wikipedia.bessel-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bessel function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bessel function\", CC BY-SA 4.0) states: Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","support":[{"end":289,"quote":"Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","source_id":"wikipedia.article.bessel-function","source_sha256":"cb33e4c5b945878b009546f1b8aefe30496ae8b31bcc45e41c2d8c46c27ea831","start":99}],"target_id":"concept.wikipedia.bessel-function","target_kind":"node","target_sha256":"1de25b2dba7043f95e20cd4fcf2194a0cc056e1d1db2f413a74061d93e2aeaf5"}],"concept.wikipedia.best-management-practice-for-water-pollution":[{"id":"assertion.concept.wikipedia.best-management-practice-for-water-pollution","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Best management practice for water pollution as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Best management practice for water pollution\", CC BY-SA 4.0) states: Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","support":[{"end":257,"quote":"Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","source_id":"wikipedia.article.best-management-practice-for-water-pollution","source_sha256":"2c268648da5aa3882cefc0ec5ece6a42832b55e4c9d8459aced6ba9a752f47b3","start":131}],"target_id":"concept.wikipedia.best-management-practice-for-water-pollution","target_kind":"node","target_sha256":"1cc1ac15374acb73ef08a36afd8ca32e85275ce86319d54a0f505ed25f532b3c"}],"concept.wikipedia.best-of-all-possible-worlds":[{"id":"assertion.concept.wikipedia.best-of-all-possible-worlds","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Best of all possible worlds as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Best of all possible worlds\", CC BY-SA 4.0) states: The phrase \"the best of all possible worlds\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","support":[{"end":560,"quote":"The phrase \\\"the best of all possible worlds\\\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","source_id":"wikipedia.article.best-of-all-possible-worlds","source_sha256":"1bd0744fd9316c2c7bdf4ac50eb4d72a83ad874d446c36c112ac380fdd433baa","start":114}],"target_id":"concept.wikipedia.best-of-all-possible-worlds","target_kind":"node","target_sha256":"6d01698e95ce6082b9f658a2c93e52a73886cd6168b69779784f3549056c24c6"}],"concept.wikipedia.beta-model":[{"id":"assertion.concept.wikipedia.beta-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beta-model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beta-model\", CC BY-SA 4.0) states: In model theory, a mathematical discipline, a β-model (from the French \"bon ordre\", well-ordering) is a model that is correct about statements of the form \"X is well-ordered\".","support":[{"end":277,"quote":"In model theory, a mathematical discipline, a β-model (from the French \\\"bon ordre\\\", well-ordering) is a model that is correct about statements of the form \\\"X is well-ordered\\\".","source_id":"wikipedia.article.beta-model","source_sha256":"679142b1fdc511c34556809cb6322a359aa9b36f35f67cbdbf5355fea34a126f","start":98}],"target_id":"concept.wikipedia.beta-model","target_kind":"node","target_sha256":"6b0609b3a9f09476f8ada803f3dc251e93e4a581b8de326e2250183d3b390c50"}],"concept.wikipedia.betavoltaic-device":[{"id":"assertion.concept.wikipedia.betavoltaic-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Betavoltaic device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Betavoltaic device\", CC BY-SA 4.0) states: A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","support":[{"end":339,"quote":"A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","source_id":"wikipedia.article.betavoltaic-device","source_sha256":"9e98f420e5c3ac0bdbd83121d719147be1c09e772e8d159b7fcde92bede36c29","start":105}],"target_id":"concept.wikipedia.betavoltaic-device","target_kind":"node","target_sha256":"c2b8c387fec0b613d95f36d3ab044bd1b13ba51e8ee6bfcb0ffe09fa6b59a0c8"}],"concept.wikipedia.betweenness-problem":[{"id":"assertion.concept.wikipedia.betweenness-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Betweenness problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Betweenness problem\", CC BY-SA 4.0) states: Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","support":[{"end":266,"quote":"Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","source_id":"wikipedia.article.betweenness-problem","source_sha256":"b34230f2df73fa74f16b16fc9527e86230f4df13b4fc93eee5219072b1f5b7d9","start":106}],"target_id":"concept.wikipedia.betweenness-problem","target_kind":"node","target_sha256":"7b373f4c0a5a56bbfceac20bf4cac60f265ee0e610177fd5df39ebfae8519aed"}],"concept.wikipedia.bevel-gear":[{"id":"assertion.concept.wikipedia.bevel-gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bevel gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bevel gear\", CC BY-SA 4.0) states: Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","support":[{"end":238,"quote":"Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","source_id":"wikipedia.article.bevel-gear","source_sha256":"8fd204fd4471982b53e0dc6b115f3077624057e63aace4e5bbcad3099aff520d","start":97}],"target_id":"concept.wikipedia.bevel-gear","target_kind":"node","target_sha256":"557b33a7ed8276c8e76aa1a6adfca54945440c0ffa79032bb51a92f53786b92a"}],"concept.wikipedia.biasing":[{"id":"assertion.concept.wikipedia.biasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biasing\", CC BY-SA 4.0) states: In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","support":[{"end":262,"quote":"In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","source_id":"wikipedia.article.biasing","source_sha256":"5e9beed0304f23862503f6e546edfe56843f3f02a23dc8f549935d0843843c6f","start":94}],"target_id":"concept.wikipedia.biasing","target_kind":"node","target_sha256":"5248c2a60acda6f46e3e0f303a365607457493a178d38d72aaa79de967740cf3"}],"concept.wikipedia.bicircular-matroid":[{"id":"assertion.concept.wikipedia.bicircular-matroid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicircular matroid as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicircular matroid\", CC BY-SA 4.0) states: In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","support":[{"end":393,"quote":"In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","source_id":"wikipedia.article.bicircular-matroid","source_sha256":"4f042ffe5d995588398387931b21b9b8c6dbaece1a016584de13b8eae51db92b","start":106}],"target_id":"concept.wikipedia.bicircular-matroid","target_kind":"node","target_sha256":"61c7a4e9e3ebae99fc3b200c1bc9605416be90dcaaf7f5a3f1a01bc46d917243"}],"concept.wikipedia.bicoherence":[{"id":"assertion.concept.wikipedia.bicoherence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicoherence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicoherence\", CC BY-SA 4.0) states: In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","support":[{"end":238,"quote":"In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","source_id":"wikipedia.article.bicoherence","source_sha256":"d719f5a1568b4ddd3edc710d24512b70d8304905aecf9ba1b79d04839fba1fdd","start":98}],"target_id":"concept.wikipedia.bicoherence","target_kind":"node","target_sha256":"3874584bc3c89ab4084daeaff09a6aa4dcf7fce8fb7fedf88ef27e627a352bc1"}],"concept.wikipedia.bicycle-tree":[{"id":"assertion.concept.wikipedia.bicycle-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicycle tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicycle tree\", CC BY-SA 4.0) states: A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","support":[{"end":201,"quote":"A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","source_id":"wikipedia.article.bicycle-tree","source_sha256":"f740763bf1adb4b5e1a399ea79bfaf05f0f62e9c048aad93563d9f3aabb4cacc","start":100}],"target_id":"concept.wikipedia.bicycle-tree","target_kind":"node","target_sha256":"0d62c29b7611caf9a58563c2be3042b82bdb467af025b36516a2fe17e76107c3"}],"concept.wikipedia.bifacial-solar-cells":[{"id":"assertion.concept.wikipedia.bifacial-solar-cells","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bifacial solar cells as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bifacial solar cells\", CC BY-SA 4.0) states: A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","support":[{"end":230,"quote":"A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","source_id":"wikipedia.article.bifacial-solar-cells","source_sha256":"a8fc23231e54e112e79049522e33a61a7736cfcfd08b45473734cf01b8e21f9b","start":108}],"target_id":"concept.wikipedia.bifacial-solar-cells","target_kind":"node","target_sha256":"8f37f1b0ba115f7634608af0556093d835c61914a032f2b5f5b2ac572e3b0d00"}],"concept.wikipedia.big-m-method":[{"id":"assertion.concept.wikipedia.big-m-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big M method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big M method\", CC BY-SA 4.0) states: In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","support":[{"end":220,"quote":"In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","source_id":"wikipedia.article.big-m-method","source_sha256":"c6ff20415586050051deae2e39df733b187e312f6325b4825b1c9f7ff1d8e972","start":100}],"target_id":"concept.wikipedia.big-m-method","target_kind":"node","target_sha256":"84e6b0729906a5b829a08c9c8b34578b63bb0d6d086bbf6cf1a04f20e096aa27"}],"concept.wikipedia.big-stan-drill-rig":[{"id":"assertion.concept.wikipedia.big-stan-drill-rig","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big Stan (drill rig) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big Stan (drill rig)\", CC BY-SA 4.0) states: Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","support":[{"end":183,"quote":"Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","source_id":"wikipedia.article.big-stan-drill-rig","source_sha256":"4fcee60a3ae3cbe2813bda95c87bec605182a3d6643e23c3fbd0600de41a83a0","start":108}],"target_id":"concept.wikipedia.big-stan-drill-rig","target_kind":"node","target_sha256":"776e8f65672f23d803d4a70f30e208d0fcb3aaf8ca86694893f9815a8d8a212b"}],"concept.wikipedia.bigdog":[{"id":"assertion.concept.wikipedia.bigdog","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"BigDog as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"BigDog\", CC BY-SA 4.0) states: BigDog is a dynamically stable quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","support":[{"end":253,"quote":"BigDog is a dynamically stable  quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","source_id":"wikipedia.article.bigdog","source_sha256":"0fa4daebbb98a6e88aa7f2f82a1a7b746c85011eb9b06338476f4534706618eb","start":93}],"target_id":"concept.wikipedia.bigdog","target_kind":"node","target_sha256":"9ec4275ed02b15810d67f3ce9b6b80034a79b2874a83c1daec6383222338e79f"}],"concept.wikipedia.bilge-pump":[{"id":"assertion.concept.wikipedia.bilge-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bilge pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bilge pump\", CC BY-SA 4.0) states: A bilge pump is a water pump used to remove bilge water.","support":[{"end":153,"quote":"A bilge pump is a water pump used to remove bilge water.","source_id":"wikipedia.article.bilge-pump","source_sha256":"27cedd39ea1a3c571e92d99f38f43fad76f2e0f0dd1bdf8faa71999112aaa3a9","start":97}],"target_id":"concept.wikipedia.bilge-pump","target_kind":"node","target_sha256":"1c276b0dff281f91cb94d44b5caa1ddc3d62b632a1020e083dcf341ae61f862b"}],"concept.wikipedia.bill-of-materials":[{"id":"assertion.concept.wikipedia.bill-of-materials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bill of materials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bill of materials\", CC BY-SA 4.0) states: A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","support":[{"end":358,"quote":"A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","source_id":"wikipedia.article.bill-of-materials","source_sha256":"b2ee992f9a030f41eb2f0a7704e17dddc9b47d1d138525b5cb714593bbf4a055","start":104}],"target_id":"concept.wikipedia.bill-of-materials","target_kind":"node","target_sha256":"05aeb87048b51b6c0ef6a8cf591d5393fbfed81c2ecce4e400735d32a0932247"}],"concept.wikipedia.bill-of-quantities":[{"id":"assertion.concept.wikipedia.bill-of-quantities","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bill of quantities as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bill of quantities\", CC BY-SA 4.0) states: A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","support":[{"end":255,"quote":"A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","source_id":"wikipedia.article.bill-of-quantities","source_sha256":"8fd25e3885a76692d8c24fa155290148a31b3faddfd5e2a60f905fa640e57ecb","start":105}],"target_id":"concept.wikipedia.bill-of-quantities","target_kind":"node","target_sha256":"b7fb7137947222f708beaeaa76a775925544c564681cfff1eda82a9187b1fc4d"}],"concept.wikipedia.bimodule":[{"id":"assertion.concept.wikipedia.bimodule","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bimodule as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bimodule\", CC BY-SA 4.0) states: In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","support":[{"end":246,"quote":"In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","source_id":"wikipedia.article.bimodule","source_sha256":"8294cb851d3ccc225cf14218d373bc4c61fabdce91439cd1fb68ef7957d881f1","start":94}],"target_id":"concept.wikipedia.bimodule","target_kind":"node","target_sha256":"9875f7b4130bd8f5c85811138a18decef7343a7d4c13e9979c0b41c5a03fe2fd"}],"concept.wikipedia.bin-tipper":[{"id":"assertion.concept.wikipedia.bin-tipper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bin tipper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bin tipper\", CC BY-SA 4.0) states: A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","support":[{"end":262,"quote":"A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","source_id":"wikipedia.article.bin-tipper","source_sha256":"3b9bcad4c62e572586d52944d0a5d5bcf5713a0e5ac9ab015da09362b8c0c8ba","start":98}],"target_id":"concept.wikipedia.bin-tipper","target_kind":"node","target_sha256":"725e23f4c566c47281bbe978c3670d96ea7bfadd562c17745670df44c92b8597"}],"concept.wikipedia.binary-opposition":[{"id":"assertion.concept.wikipedia.binary-opposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Binary opposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Binary opposition\", CC BY-SA 4.0) states: A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","support":[{"end":213,"quote":"A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","source_id":"wikipedia.article.binary-opposition","source_sha256":"00b1d30808de0177154929a4dab0fed2112b560ab2069e580334fefabf2fbe78","start":104}],"target_id":"concept.wikipedia.binary-opposition","target_kind":"node","target_sha256":"4f418c2be9cc4fc680759ea195e7b7c0612691419d20b42e97343ed6ea80dfee"}],"concept.wikipedia.binder-clip":[{"id":"assertion.concept.wikipedia.binder-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Binder clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Binder clip\", CC BY-SA 4.0) states: A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","support":[{"end":277,"quote":"A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","source_id":"wikipedia.article.binder-clip","source_sha256":"0d3b4e25f41988ecba9bfd131e9e77bb310fea9167c87f74cee6d3e4258eefbb","start":97}],"target_id":"concept.wikipedia.binder-clip","target_kind":"node","target_sha256":"3d7bc04ead284067f6ff604fba8d35674ac79e7b6a0cca7cca9c2ebf1466afcc"}],"concept.wikipedia.bioactive-paper":[{"id":"assertion.concept.wikipedia.bioactive-paper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bioactive paper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bioactive paper\", CC BY-SA 4.0) states: Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","support":[{"end":200,"quote":"Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","source_id":"wikipedia.article.bioactive-paper","source_sha256":"4cf0b60c9e67be702b084c64e92e70bdc1004316404efd9dcf87c0e10bb63b10","start":103}],"target_id":"concept.wikipedia.bioactive-paper","target_kind":"node","target_sha256":"12c82f173c60a8f6c9e16ff41fcaf85d49cea84f69f5eeceb6e0a3dedb0a5068"}],"concept.wikipedia.biofilter":[{"id":"assertion.concept.wikipedia.biofilter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biofilter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biofilter\", CC BY-SA 4.0) states: Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","support":[{"end":236,"quote":"Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","source_id":"wikipedia.article.biofilter","source_sha256":"7148f9019c65b945fe9048c584ea2cc7c75694ad4b9321818b606cc7f649f897","start":96}],"target_id":"concept.wikipedia.biofilter","target_kind":"node","target_sha256":"8e33233071a4d024c94ae6fbf20757fb37fe08463dc72631039e97975de576a1"}],"concept.wikipedia.biological-determinism":[{"id":"assertion.concept.wikipedia.biological-determinism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biological determinism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biological determinism\", CC BY-SA 4.0) states: Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","support":[{"end":395,"quote":"Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","source_id":"wikipedia.article.biological-determinism","source_sha256":"e0b525222306de2278c0c278e2b053473a0ba5ca4c515369aa7c48b17b54a3e4","start":107}],"target_id":"concept.wikipedia.biological-determinism","target_kind":"node","target_sha256":"1e24f000e06b065a057d1fd2d2e4b9bacd959e63d71e0d4d328edb51b95e9e83"}],"concept.wikipedia.biomachining":[{"id":"assertion.concept.wikipedia.biomachining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biomachining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biomachining\", CC BY-SA 4.0) states: Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","support":[{"end":320,"quote":"Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","source_id":"wikipedia.article.biomachining","source_sha256":"eeffa77fd91fa1bf663947b0f8192458d8300f6b622ea4050905678100487ace","start":100}],"target_id":"concept.wikipedia.biomachining","target_kind":"node","target_sha256":"86654cc013ef0437f7a3a72c9941c613cfcf2d670cddfee39d1c33833c20b74a"}],"concept.wikipedia.bipolar-electric-motor":[{"id":"assertion.concept.wikipedia.bipolar-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bipolar electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bipolar electric motor\", CC BY-SA 4.0) states: A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","support":[{"end":212,"quote":"A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","source_id":"wikipedia.article.bipolar-electric-motor","source_sha256":"f307afed91a7245585fa60f980bf083a5dfab75d727250ca00299b3ad2a37d7e","start":110}],"target_id":"concept.wikipedia.bipolar-electric-motor","target_kind":"node","target_sha256":"f91e9dd871d8ece841058aac043fec74d23b8a7d2dd2878e0a3d87ceced348bb"}],"concept.wikipedia.bipolar-transistor-biasing":[{"id":"assertion.concept.wikipedia.bipolar-transistor-biasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bipolar transistor biasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bipolar transistor biasing\", CC BY-SA 4.0) states: Biasing is the setting of the DC operating point of an electronic component.","support":[{"end":190,"quote":"Biasing is the setting of the DC operating point of an electronic component.","source_id":"wikipedia.article.bipolar-transistor-biasing","source_sha256":"5a648a08c426b3fa3b37ba38fc14b1a72e9323a81290e943230e654ca17de8a2","start":114}],"target_id":"concept.wikipedia.bipolar-transistor-biasing","target_kind":"node","target_sha256":"6b07c1c9adfa26461c90730145b0efc745f3bea061830c28e757bf3fa614b4a0"}],"concept.wikipedia.biryukov-equation":[{"id":"assertion.concept.wikipedia.biryukov-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biryukov equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biryukov equation\", CC BY-SA 4.0) states: In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","support":[{"end":307,"quote":"In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","source_id":"wikipedia.article.biryukov-equation","source_sha256":"78c45549d75985d44340e95a020fce71e017fb1ef6a083c1975e71d4a09aa459","start":105}],"target_id":"concept.wikipedia.biryukov-equation","target_kind":"node","target_sha256":"8174f5d4f07e26bdd47db74a15f3dbd1bbae3e47deb050c9b66400a77d6cef6c"}],"concept.wikipedia.bispectrum":[{"id":"assertion.concept.wikipedia.bispectrum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bispectrum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bispectrum\", CC BY-SA 4.0) states: In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","support":[{"end":222,"quote":"In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","source_id":"wikipedia.article.bispectrum","source_sha256":"f774b49adfed437fa33ed82be73174be98091fa6360fc74b9b638edeaba1dc9f","start":97}],"target_id":"concept.wikipedia.bispectrum","target_kind":"node","target_sha256":"9d410f023f52a857cfaf5b6638d6bd11894549aefaad61009777bdc267a11d90"}],"concept.wikipedia.bitopological-space":[{"id":"assertion.concept.wikipedia.bitopological-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bitopological space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bitopological space\", CC BY-SA 4.0) states: In mathematics, a bitopological space is a set endowed with two topologies.","support":[{"end":181,"quote":"In mathematics, a bitopological space is a set endowed with two topologies.","source_id":"wikipedia.article.bitopological-space","source_sha256":"ea95528134e018ebb22263aca9cc96200a9dbc6706aa84ac6fd3e94848c0c9cd","start":106}],"target_id":"concept.wikipedia.bitopological-space","target_kind":"node","target_sha256":"da6c10a6deffb7968b1db4443f8c47ce5dc05bc090466b8af5701506b78a4a27"}],"concept.wikipedia.black-swan-theory":[{"id":"assertion.concept.wikipedia.black-swan-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Black swan theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Black swan theory\", CC BY-SA 4.0) states: The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","support":[{"end":328,"quote":"The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","source_id":"wikipedia.article.black-swan-theory","source_sha256":"10bd4594933a8930ce93ed8230d2eadc0424a41be02a195ea9f8623683c76278","start":104}],"target_id":"concept.wikipedia.black-swan-theory","target_kind":"node","target_sha256":"d92ee5f522123cd651b43e232cc3ee24cffc8123f0542b3dd484c75cee1af355"}],"concept.wikipedia.blackwell-girshick-equation":[{"id":"assertion.concept.wikipedia.blackwell-girshick-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blackwell-Girshick equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blackwell-Girshick equation\", CC BY-SA 4.0) states: The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","support":[{"end":267,"quote":"The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","source_id":"wikipedia.article.blackwell-girshick-equation","source_sha256":"e145086ef417acfb4476009b56e1559f2fb33280a3c4d3d629c3d1fa22d81363","start":115}],"target_id":"concept.wikipedia.blackwell-girshick-equation","target_kind":"node","target_sha256":"ec44bbec26d35718c27fcea874f9f0ae330ae4bf76463f07a8e06e703a9f5246"}],"concept.wikipedia.blaschke-sum":[{"id":"assertion.concept.wikipedia.blaschke-sum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blaschke sum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blaschke sum\", CC BY-SA 4.0) states: In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","support":[{"end":295,"quote":"In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","source_id":"wikipedia.article.blaschke-sum","source_sha256":"86a6d86e41b43cee14018f9643e94cbc4c162dc7f14906f1d59d64cd8d048b1c","start":100}],"target_id":"concept.wikipedia.blaschke-sum","target_kind":"node","target_sha256":"2260b05bd8fcec1b499896c0a94e8c74844cec0cea2f3cbc9b62850e2ade56fe"}],"concept.wikipedia.blast-valve":[{"id":"assertion.concept.wikipedia.blast-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blast valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blast valve\", CC BY-SA 4.0) states: A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","support":[{"end":235,"quote":"A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","source_id":"wikipedia.article.blast-valve","source_sha256":"7352a9c2075259050a6bb62ed2c57136727017311d2a314d5b0222528a278c91","start":98}],"target_id":"concept.wikipedia.blast-valve","target_kind":"node","target_sha256":"3ee2ad0d5eb49105048bffc170b344c306cf99a16661d718dd846d7e8b52fc7a"}],"concept.wikipedia.blind-men-and-an-elephant":[{"id":"assertion.concept.wikipedia.blind-men-and-an-elephant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blind men and an elephant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blind men and an elephant\", CC BY-SA 4.0) states: The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","support":[{"end":305,"quote":"The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","source_id":"wikipedia.article.blind-men-and-an-elephant","source_sha256":"6a4785e0ab0c6ae9e60cae2b10e3301b458968668fc304609de9de57f3b42ed1","start":112}],"target_id":"concept.wikipedia.blind-men-and-an-elephant","target_kind":"node","target_sha256":"3e4c4b63470b9c0fccbd738de66231df3d420057bf4ec88182199936ba4268eb"}],"concept.wikipedia.blinded-experiment":[{"id":"assertion.concept.wikipedia.blinded-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blinded experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blinded experiment\", CC BY-SA 4.0) states: In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","support":[{"end":247,"quote":"In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","source_id":"wikipedia.article.blinded-experiment","source_sha256":"eb0200f74a02f6411816cc05198717fad7fe1d7be1146974a416808ca1bab2ef","start":104}],"target_id":"concept.wikipedia.blinded-experiment","target_kind":"node","target_sha256":"053718a284dff52d94d49c9538a5293821f304c3a022e47bc9dad3e13fa8e6f9"}],"concept.wikipedia.block-and-tackle":[{"id":"assertion.concept.wikipedia.block-and-tackle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Block and tackle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Block and tackle\", CC BY-SA 4.0) states: A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","support":[{"end":271,"quote":"A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","source_id":"wikipedia.article.block-and-tackle","source_sha256":"a5dd7eb775e0dd42918bb89acc86e0f84b1fecf2a6900408d2370cd3587b314f","start":102}],"target_id":"concept.wikipedia.block-and-tackle","target_kind":"node","target_sha256":"3828ddbfe4878610a621c21ddf8c3aac5b57f7444c3fc58f84e7983283e836b9"}],"concept.wikipedia.block-matrix-pseudoinverse":[{"id":"assertion.concept.wikipedia.block-matrix-pseudoinverse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Block matrix pseudoinverse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Block matrix pseudoinverse\", CC BY-SA 4.0) states: In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","support":[{"end":217,"quote":"In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","source_id":"wikipedia.article.block-matrix-pseudoinverse","source_sha256":"3c167c699d663f2c30b3157f9592e64b96b010ecb32d1bfe2fd0e782266c2730","start":113}],"target_id":"concept.wikipedia.block-matrix-pseudoinverse","target_kind":"node","target_sha256":"960d6bf4cee8a1c8b6355f2a2ef9c570ed116d6f4c87041625545bd26a79a9cf"}],"concept.wikipedia.blockhead-thought-experiment":[{"id":"assertion.concept.wikipedia.blockhead-thought-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blockhead (thought experiment) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blockhead (thought experiment)\", CC BY-SA 4.0) states: Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \"Psychologism and Behaviorism\".","support":[{"end":293,"quote":"Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \\\"Psychologism and Behaviorism\\\".","source_id":"wikipedia.article.blockhead-thought-experiment","source_sha256":"2cf6cdde4945b091add2dc096478d0f3e78c17fb189b381ed0bca5739023f422","start":117}],"target_id":"concept.wikipedia.blockhead-thought-experiment","target_kind":"node","target_sha256":"5cc17b6901bd9629d279c73385d2914851a05180319da94029c2ab46146bd0a2"}],"concept.wikipedia.blowpipe-tool":[{"id":"assertion.concept.wikipedia.blowpipe-tool","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blowpipe (tool) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blowpipe (tool)\", CC BY-SA 4.0) states: A blowpipe is one of several tools used to direct streams of gases into any of several working media.","support":[{"end":203,"quote":"A blowpipe is one of several tools used to direct streams of gases into any of several working media.","source_id":"wikipedia.article.blowpipe-tool","source_sha256":"979ef30aec16753d01ae9a590bbe8b1ed7afafdade000c529020ff87808eec2f","start":102}],"target_id":"concept.wikipedia.blowpipe-tool","target_kind":"node","target_sha256":"7a848689aec45e8ece39bc35312fd4728cd168306969b824cfcb34643eebcd87"}],"concept.wikipedia.blue-skies-research":[{"id":"assertion.concept.wikipedia.blue-skies-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blue skies research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blue skies research\", CC BY-SA 4.0) states: Blue skies research, also called blue sky science, is scientific research in domains where \"real-world\" applications are not immediately apparent.","support":[{"end":255,"quote":"Blue skies research, also called blue sky science, is scientific research in domains where \\\"real-world\\\" applications are not immediately apparent.","source_id":"wikipedia.article.blue-skies-research","source_sha256":"d1cebcea17216ee788ad9386e00078179abf68bbcef045add408cccc64d7b222","start":107}],"target_id":"concept.wikipedia.blue-skies-research","target_kind":"node","target_sha256":"52b79196d20f36659b41175a51a9f497a53baa731f85f5ba22309310ed5efdf0"}],"concept.wikipedia.bodenstein-number":[{"id":"assertion.concept.wikipedia.bodenstein-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bodenstein number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bodenstein number\", CC BY-SA 4.0) states: The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","support":[{"end":345,"quote":"The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","source_id":"wikipedia.article.bodenstein-number","source_sha256":"c5385ef923d52f56a1ebd8243cee7643e32feab345161587e04c314be69ae5e0","start":105}],"target_id":"concept.wikipedia.bodenstein-number","target_kind":"node","target_sha256":"40b12de1e89eab34b032307a26a682f9df09f3e205e219fac83bc3cc25fff546"}],"concept.wikipedia.body-on-frame":[{"id":"assertion.concept.wikipedia.body-on-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Body-on-frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Body-on-frame\", CC BY-SA 4.0) states: Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","support":[{"end":429,"quote":"Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","source_id":"wikipedia.article.body-on-frame","source_sha256":"b7db0c6bf1b4645c2340354d97304d76af9783662ec19098b87b14c9ce1c9e5e","start":100}],"target_id":"concept.wikipedia.body-on-frame","target_kind":"node","target_sha256":"719bb57e6f77e6b42624919efaec22556d25ddb6429d987fa5f4f2d2b60ee813"}],"concept.wikipedia.bogdanov-map":[{"id":"assertion.concept.wikipedia.bogdanov-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bogdanov map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bogdanov map\", CC BY-SA 4.0) states: In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","support":[{"end":209,"quote":"In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","source_id":"wikipedia.article.bogdanov-map","source_sha256":"bcf06d7af5565788550e35d463189537053c5154db2d63327899ffbddc257c9a","start":100}],"target_id":"concept.wikipedia.bogdanov-map","target_kind":"node","target_sha256":"3143023645888e56e2e68a3655e0fffcd42a72fea9022c47e53273e265fd2629"}],"concept.wikipedia.bold-hypothesis":[{"id":"assertion.concept.wikipedia.bold-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bold hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bold hypothesis\", CC BY-SA 4.0) states: Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","support":[{"end":330,"quote":"Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","source_id":"wikipedia.article.bold-hypothesis","source_sha256":"aa2b079caf41c8da4c8859d8348a1a87d518651c4acd6cf330508eca2cafaafe","start":103}],"target_id":"concept.wikipedia.bold-hypothesis","target_kind":"node","target_sha256":"08a005123da567f65892b2839793b0278cf4386f4a440c47cec65858cfd38381"}],"concept.wikipedia.bolometer":[{"id":"assertion.concept.wikipedia.bolometer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bolometer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bolometer\", CC BY-SA 4.0) states: A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","support":[{"end":221,"quote":"A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","source_id":"wikipedia.article.bolometer","source_sha256":"b79b1425df17479df338ccbac2afafb35f27c0a0ddbc6c04b7e4fd3b993502db","start":94}],"target_id":"concept.wikipedia.bolometer","target_kind":"node","target_sha256":"5dd8f2a2dd950448da207123160293f164d90973a4f228881c25d6ce6bafb8cd"}],"concept.wikipedia.bolt-snap":[{"id":"assertion.concept.wikipedia.bolt-snap","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bolt snap as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bolt snap\", CC BY-SA 4.0) states: A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","support":[{"end":298,"quote":"A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","source_id":"wikipedia.article.bolt-snap","source_sha256":"d56aba556bdba8c415b32db1802b910237286e64c6e0ad91ca25c19288ed29bc","start":97}],"target_id":"concept.wikipedia.bolt-snap","target_kind":"node","target_sha256":"493b8ecd41a08a92201c684943eb81236d5b0d4cbaf8c64f46aa75648369f393"}],"concept.wikipedia.boolean-differential-calculus":[{"id":"assertion.concept.wikipedia.boolean-differential-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean differential calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean differential calculus\", CC BY-SA 4.0) states: Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","support":[{"end":299,"quote":"Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","source_id":"wikipedia.article.boolean-differential-calculus","source_sha256":"b6a13cb3dc0dde3fae6f66eded188e236946e36430c0b5aa9c5cdf30ccec638f","start":117}],"target_id":"concept.wikipedia.boolean-differential-calculus","target_kind":"node","target_sha256":"661607a8fad5f9682b5405e77d9ecee2b6aaf672ad75b37d12282b257d19a144"}],"concept.wikipedia.boolean-valued-model":[{"id":"assertion.concept.wikipedia.boolean-valued-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean-valued model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean-valued model\", CC BY-SA 4.0) states: In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","support":[{"end":236,"quote":"In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","source_id":"wikipedia.article.boolean-valued-model","source_sha256":"ad32be15dbc3b3160b2cda1f5817937bc0fd3a5e61034284824bbbeaf8081479","start":107}],"target_id":"concept.wikipedia.boolean-valued-model","target_kind":"node","target_sha256":"f68215fc71b76593ea913380d92dba2ae09d60aa8b550e6a66606bd46e90fb33"}],"concept.wikipedia.bootstrapping-electronics":[{"id":"assertion.concept.wikipedia.bootstrapping-electronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bootstrapping (electronics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bootstrapping (electronics)\", CC BY-SA 4.0) states: Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","support":[{"end":227,"quote":"Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","source_id":"wikipedia.article.bootstrapping-electronics","source_sha256":"d2b7281b72593d5a036c50f5cd9d10072f9cc96288cecb9d2fd588a9757fc41b","start":114}],"target_id":"concept.wikipedia.bootstrapping-electronics","target_kind":"node","target_sha256":"810587f2f4acfda8b7c441222d278d8024ff6c602014ce69e82f317b668123e8"}],"concept.wikipedia.borel-set":[{"id":"assertion.concept.wikipedia.borel-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Borel set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Borel set\", CC BY-SA 4.0) states: In mathematics, the Borel sets of a topological space are a particular class of \"well-behaved\" subsets of that space.","support":[{"end":213,"quote":"In mathematics, the Borel sets of a topological space are a particular class of \\\"well-behaved\\\" subsets of that space.","source_id":"wikipedia.article.borel-set","source_sha256":"56962fcdc37a06fd95969d061f458f9a00ee22635f5438cd314cb0eb4ea9ab8a","start":94}],"target_id":"concept.wikipedia.borel-set","target_kind":"node","target_sha256":"2a083a253bcb98bcd45d6d2d2771082aecd5b7b9068012e38943916499abc79c"}],"concept.wikipedia.boring-manufacturing":[{"id":"assertion.concept.wikipedia.boring-manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boring (manufacturing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boring (manufacturing)\", CC BY-SA 4.0) states: In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","support":[{"end":351,"quote":"In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","source_id":"wikipedia.article.boring-manufacturing","source_sha256":"26506fb607da6f509abf0c4a545e130737b9572daeee328f30924b763fca1830","start":109}],"target_id":"concept.wikipedia.boring-manufacturing","target_kind":"node","target_sha256":"5bcda36a0dd06f0695d1a371909a9f182c13ab7d354f7b9e1f131edb5fa4f3c7"}],"concept.wikipedia.both-and-reasoning":[{"id":"assertion.concept.wikipedia.both-and-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Both/and reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Both/and reasoning\", CC BY-SA 4.0) states: Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","support":[{"end":227,"quote":"Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","source_id":"wikipedia.article.both-and-reasoning","source_sha256":"468785dee4e09f54c4ea349c2fc3dd8c6e2b91c87eb72673ac33a484afcc6e7a","start":106}],"target_id":"concept.wikipedia.both-and-reasoning","target_kind":"node","target_sha256":"4e17ca64891f05d9ebb98e59f229a44fc9afc7fd7c9b9f8d5faa571f8ba1cbd5"}],"concept.wikipedia.boundary-topology":[{"id":"assertion.concept.wikipedia.boundary-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boundary (topology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boundary (topology)\", CC BY-SA 4.0) states: In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","support":[{"end":416,"quote":"In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","source_id":"wikipedia.article.boundary-topology","source_sha256":"0d21fc056f56105dca6aedacb0151f9d78b771dff46d13e7a26f5023fad23e94","start":104}],"target_id":"concept.wikipedia.boundary-topology","target_kind":"node","target_sha256":"0c557d0a2a5c341a095029366cd4bbaecf15abf307c9ec279ef4a8243eb55fed"}],"concept.wikipedia.boundary-work":[{"id":"assertion.concept.wikipedia.boundary-work","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boundary-work as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boundary-work\", CC BY-SA 4.0) states: Boundary-work is part of science studies.","support":[{"end":141,"quote":"Boundary-work is part of science studies.","source_id":"wikipedia.article.boundary-work","source_sha256":"65395003f0e170af97671718571f5c4a2319e2af76d77a25e47df0a8847dec46","start":100}],"target_id":"concept.wikipedia.boundary-work","target_kind":"node","target_sha256":"0ee16af45ab3960cd7a47bc1836d8fad05e62679756e1ee4c5af57b671f63f26"}],"concept.wikipedia.bounded-quantifier":[{"id":"assertion.concept.wikipedia.bounded-quantifier","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounded quantifier as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounded quantifier\", CC BY-SA 4.0) states: In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \"∀\" and \"∃\".","support":[{"end":315,"quote":"In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \\\"∀\\\" and \\\"∃\\\".","source_id":"wikipedia.article.bounded-quantifier","source_sha256":"f55806e5d6d9a30193b993f68fb5badc590785bcff18c2921b5d1f81dbd433a5","start":105}],"target_id":"concept.wikipedia.bounded-quantifier","target_kind":"node","target_sha256":"438074c84ed4f29cc3287e82702aa6fcc40218d57abb1c9097f4fe7367006d50"}],"concept.wikipedia.bounded-variation":[{"id":"assertion.concept.wikipedia.bounded-variation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounded variation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounded variation\", CC BY-SA 4.0) states: In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","support":[{"end":338,"quote":"In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","source_id":"wikipedia.article.bounded-variation","source_sha256":"7f16518a83bbdda57539145a553640d555415401b6e143ed3412d335c558d08e","start":103}],"target_id":"concept.wikipedia.bounded-variation","target_kind":"node","target_sha256":"003324958ec523f005dfa9bc5e5982635378c8c9de9bb9f3a5cf381cd8b10a60"}],"concept.wikipedia.bounding-point":[{"id":"assertion.concept.wikipedia.bounding-point","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounding point as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounding point\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","support":[{"end":249,"quote":"In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","source_id":"wikipedia.article.bounding-point","source_sha256":"ad74a99d403738f6bf7c400bd095ce8be5312008301592fe6c06e8cbde6a684d","start":102}],"target_id":"concept.wikipedia.bounding-point","target_kind":"node","target_sha256":"07533a828a90019970e3313330d05633180c836f21ac537bcb7f90377507fba5"}],"concept.wikipedia.braced-frame":[{"id":"assertion.concept.wikipedia.braced-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braced frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braced frame\", CC BY-SA 4.0) states: In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","support":[{"end":211,"quote":"In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","source_id":"wikipedia.article.braced-frame","source_sha256":"b5e9b51e84a1bfdc425b2f8412a4d2a5c2167005bf8ca971da94dacbb2615b79","start":100}],"target_id":"concept.wikipedia.braced-frame","target_kind":"node","target_sha256":"4a48bfe39013287dbb23a08e613fdd3b7b925fbc821661428b71a224bb374595"}],"concept.wikipedia.bracketing-paradox":[{"id":"assertion.concept.wikipedia.bracketing-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bracketing paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bracketing paradox\", CC BY-SA 4.0) states: In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","support":[{"end":347,"quote":"In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","source_id":"wikipedia.article.bracketing-paradox","source_sha256":"c44ec866fe0802b83145c05a94e6020c0c086d598db8f3a41b0bfb7d7cd6dc04","start":105}],"target_id":"concept.wikipedia.bracketing-paradox","target_kind":"node","target_sha256":"bf5dbcaddab53a9432a6ed33d79ec857097ea33d06c784e343f8ce0a84242e29"}],"concept.wikipedia.bracketing-phenomenology":[{"id":"assertion.concept.wikipedia.bracketing-phenomenology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bracketing (phenomenology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bracketing (phenomenology)\", CC BY-SA 4.0) states: Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","support":[{"end":356,"quote":"Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","source_id":"wikipedia.article.bracketing-phenomenology","source_sha256":"7a96479485eb2868a69b053770e6e73b84be2782fcf33b8418911880b4bc3ad1","start":114}],"target_id":"concept.wikipedia.bracketing-phenomenology","target_kind":"node","target_sha256":"97885fe8a7fcc3069723d8c132742ba8963f626cd558eb5f24b29135b35fcac1"}],"concept.wikipedia.bradley-s-regress":[{"id":"assertion.concept.wikipedia.bradley-s-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bradley's regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bradley's regress\", CC BY-SA 4.0) states: Bradley's regress is a philosophical problem concerning the nature of relations.","support":[{"end":185,"quote":"Bradley's regress is a philosophical problem concerning the nature of relations.","source_id":"wikipedia.article.bradley-s-regress","source_sha256":"08bf70bce0744ac23ae544a9ab39756d77840249b9afa9533c0ae339f3e630e5","start":105}],"target_id":"concept.wikipedia.bradley-s-regress","target_kind":"node","target_sha256":"d446bf16ca88a5aa069971a5aa3bb18a6ad897612e6e088fe7a2769325740a5e"}],"concept.wikipedia.braitenberg-vehicle":[{"id":"assertion.concept.wikipedia.braitenberg-vehicle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braitenberg vehicle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braitenberg vehicle\", CC BY-SA 4.0) states: A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","support":[{"end":235,"quote":"A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","source_id":"wikipedia.article.braitenberg-vehicle","source_sha256":"44c828683d33accf6fa0337e3e963f00049016828246422dc63d02f847be09ad","start":107}],"target_id":"concept.wikipedia.braitenberg-vehicle","target_kind":"node","target_sha256":"8d23302a5b851a4971f34ee5575046f78aaf15ec64c2f395aad6a32f17abae5f"}],"concept.wikipedia.braking-chopper":[{"id":"assertion.concept.wikipedia.braking-chopper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braking chopper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braking chopper\", CC BY-SA 4.0) states: Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","support":[{"end":318,"quote":"Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","source_id":"wikipedia.article.braking-chopper","source_sha256":"619c50906a569e9619aaeeae89833ba66029fe058ad82f30acc153dcee0c77e7","start":103}],"target_id":"concept.wikipedia.braking-chopper","target_kind":"node","target_sha256":"9d223ebd2a485cbfec3e2526fdefbc69decb0eb6e5036e08c812985a9f7de624"}],"concept.wikipedia.brass-fastener":[{"id":"assertion.concept.wikipedia.brass-fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brass fastener as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brass fastener\", CC BY-SA 4.0) states: A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","support":[{"end":243,"quote":"A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","source_id":"wikipedia.article.brass-fastener","source_sha256":"ccd864491b831e4f205dff6794c5c309963a2b2775e91ec3806694dcf64eb3f8","start":101}],"target_id":"concept.wikipedia.brass-fastener","target_kind":"node","target_sha256":"4a39b007b17284a534c2be3c6b081458b47f23eaea3b748bbb6d4d09d2495437"}],"concept.wikipedia.bread-clip":[{"id":"assertion.concept.wikipedia.bread-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bread clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bread clip\", CC BY-SA 4.0) states: A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","support":[{"end":220,"quote":"A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","source_id":"wikipedia.article.bread-clip","source_sha256":"a6c25c8128409a1414212951c6a6a9898494b9688c515be9065ffe5dee52ac58","start":96}],"target_id":"concept.wikipedia.bread-clip","target_kind":"node","target_sha256":"77dbb1ea67959dfe58610f117ec5c5424004d255aad88920997daf73360e9d15"}],"concept.wikipedia.breaking-capacity":[{"id":"assertion.concept.wikipedia.breaking-capacity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breaking capacity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breaking capacity\", CC BY-SA 4.0) states: Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","support":[{"end":319,"quote":"Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","source_id":"wikipedia.article.breaking-capacity","source_sha256":"5fc093e6298d08d12a58c575e93dda1331c80f131fa2cf1c64305f0a72c3eaac","start":104}],"target_id":"concept.wikipedia.breaking-capacity","target_kind":"node","target_sha256":"37d1c91252c684cabbc8e48a48303938cf4466ab9354475c0438ce064668fc27"}],"concept.wikipedia.breather-surface":[{"id":"assertion.concept.wikipedia.breather-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breather surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breather surface\", CC BY-SA 4.0) states: In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","support":[{"end":325,"quote":"In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","source_id":"wikipedia.article.breather-surface","source_sha256":"823520bf000c3d3331753073f9f45a33c1cf6d0c69345df15f9d0135321086a4","start":104}],"target_id":"concept.wikipedia.breather-surface","target_kind":"node","target_sha256":"b31c5d6d6f45960c832e5701eccb92f4602e1d8af1bf5852e44dd686a1a55881"}],"concept.wikipedia.breech-lock":[{"id":"assertion.concept.wikipedia.breech-lock","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breech-lock as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breech-lock\", CC BY-SA 4.0) states: A breech-lock is a system for mounting camera lenses to camera bodies.","support":[{"end":168,"quote":"A breech-lock is a system for mounting camera lenses to camera bodies.","source_id":"wikipedia.article.breech-lock","source_sha256":"3168c00454ffdc52edb854787d93ab4ea6c055334c15d5ae903aa8586e4bbb58","start":98}],"target_id":"concept.wikipedia.breech-lock","target_kind":"node","target_sha256":"e9e0610475635d4c94055b24e9e16556284c96e47489e6a52e4d64698b87afb3"}],"concept.wikipedia.bressummer":[{"id":"assertion.concept.wikipedia.bressummer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bressummer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bressummer\", CC BY-SA 4.0) states: A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","support":[{"end":289,"quote":"A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","source_id":"wikipedia.article.bressummer","source_sha256":"a8ce201e9d72199ed27327f0f7c65cdadc15f7e4fecd2d5a028c68f5c3ca119d","start":97}],"target_id":"concept.wikipedia.bressummer","target_kind":"node","target_sha256":"772b2e7c3da0f1b48ae5908626ebedb78e1f91f95015dcfc760405f4bc229e5c"}],"concept.wikipedia.bridge-bearing":[{"id":"assertion.concept.wikipedia.bridge-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge bearing\", CC BY-SA 4.0) states: In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","support":[{"end":257,"quote":"In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","source_id":"wikipedia.article.bridge-bearing","source_sha256":"c98da73aa3e1b9a83f756790a7ca8075fe117bbbc6489faf2ea94765b6e4319c","start":102}],"target_id":"concept.wikipedia.bridge-bearing","target_kind":"node","target_sha256":"96fb794b82dbca08ec01606fd457e782420baec61799ef07ca093e7c1f42188c"}],"concept.wikipedia.bridge-scour":[{"id":"assertion.concept.wikipedia.bridge-scour","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge scour as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge scour\", CC BY-SA 4.0) states: Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","support":[{"end":202,"quote":"Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","source_id":"wikipedia.article.bridge-scour","source_sha256":"a38f021f5ddc3c38a1205ed61367ded142368624a4a4046ab79b4edfcfe28f9c","start":100}],"target_id":"concept.wikipedia.bridge-scour","target_kind":"node","target_sha256":"fd2edb1af7c25b037aeb4cb86cfd4984b1a08b76a23b9ba782bc0db7bf7e6f41"}],"concept.wikipedia.bridge-strike":[{"id":"assertion.concept.wikipedia.bridge-strike","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge strike as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge strike\", CC BY-SA 4.0) states: Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","support":[{"end":260,"quote":"Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","source_id":"wikipedia.article.bridge-strike","source_sha256":"85f17e92fcd5c7ca8ded678fa39a1d1884efa1fdb8b6ef5612c82025891d8820","start":101}],"target_id":"concept.wikipedia.bridge-strike","target_kind":"node","target_sha256":"a786a915551ae2e08db5dff37cacc9acb20d3299ab1baf9992e400321633a5cc"}],"concept.wikipedia.bridgeland-stability-condition":[{"id":"assertion.concept.wikipedia.bridgeland-stability-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridgeland stability condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridgeland stability condition\", CC BY-SA 4.0) states: In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","support":[{"end":293,"quote":"In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","source_id":"wikipedia.article.bridgeland-stability-condition","source_sha256":"c4f92d5f19fd1eca86007f4281d8dbd9b122b5cd95953e884258acb75ca65e17","start":118}],"target_id":"concept.wikipedia.bridgeland-stability-condition","target_kind":"node","target_sha256":"9491e689636f7e22d02b38c19ec6daf4fc749679bbfd4072fe7e494271481e99"}],"concept.wikipedia.brokaw-bandgap-reference":[{"id":"assertion.concept.wikipedia.brokaw-bandgap-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brokaw bandgap reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brokaw bandgap reference\", CC BY-SA 4.0) states: The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","support":[{"end":284,"quote":"The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","source_id":"wikipedia.article.brokaw-bandgap-reference","source_sha256":"12f78b905062dc2c2fe1c2edab6b27e7fe731754b05089491a484ce92be1f137","start":110}],"target_id":"concept.wikipedia.brokaw-bandgap-reference","target_kind":"node","target_sha256":"a9da9082281aba274110b826ced98afe83e1096055d7b89a94d4c29bfb982b27"}],"concept.wikipedia.brooch":[{"id":"assertion.concept.wikipedia.brooch","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brooch as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brooch\", CC BY-SA 4.0) states: A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","support":[{"end":252,"quote":"A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","source_id":"wikipedia.article.brooch","source_sha256":"46fa4c8cb4ec6bd67cccc078cd4f31f2f6912efc9b80fff5f1c9ec2fe2441ec6","start":92}],"target_id":"concept.wikipedia.brooch","target_kind":"node","target_sha256":"8d2d21bf1fa8c5b15718eb1239d7bf4022069f06a804074f684846971a320016"}],"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation":[{"id":"assertion.concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brouwer–Heyting–Kolmogorov interpretation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brouwer–Heyting–Kolmogorov interpretation\", CC BY-SA 4.0) states: In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","support":[{"end":375,"quote":"In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","source_id":"wikipedia.article.brouwer-heyting-kolmogorov-interpretation","source_sha256":"c424e2ab298c46711f930f39818a996850102bb7b7eee35c16e752d87a68809f","start":128}],"target_id":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","target_kind":"node","target_sha256":"1cf607fa2cabdaca427cb67fb5fd63c3a4ad9502c074343c4cd0f2ce6c819214"}],"concept.wikipedia.bruhat-order":[{"id":"assertion.concept.wikipedia.bruhat-order","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bruhat order as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bruhat order\", CC BY-SA 4.0) states: In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","support":[{"end":370,"quote":"In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","source_id":"wikipedia.article.bruhat-order","source_sha256":"0b2568d8a4634aa5d8f09cff5bf495e04b99504a690e01ffa9367ce6a7ae5d87","start":100}],"target_id":"concept.wikipedia.bruhat-order","target_kind":"node","target_sha256":"8632bb79092a010c1815e2c36c6fee3752b7bd0b588a6623a1f1054c2f29545e"}],"concept.wikipedia.brumer-bound":[{"id":"assertion.concept.wikipedia.brumer-bound","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brumer bound as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brumer bound\", CC BY-SA 4.0) states: In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","support":[{"end":203,"quote":"In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","source_id":"wikipedia.article.brumer-bound","source_sha256":"2b324c36de64da6eb2f88c6acfe6d6f4be00265a36ac035b3f66258cfd64a258","start":100}],"target_id":"concept.wikipedia.brumer-bound","target_kind":"node","target_sha256":"557569d8ddecfe32496f84231c673b76a7a2f703a8202b1fa176fcf8a0eeb060"}],"concept.wikipedia.brush-electric":[{"id":"assertion.concept.wikipedia.brush-electric","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brush (electric) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brush (electric)\", CC BY-SA 4.0) states: A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","support":[{"end":332,"quote":"A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","source_id":"wikipedia.article.brush-electric","source_sha256":"eaddb6622772c28f9a1931621913ee1842368064fdf4b8d3926fc4ad4d604d47","start":103}],"target_id":"concept.wikipedia.brush-electric","target_kind":"node","target_sha256":"1bdd04867e0bf4ce8fa9ca29a350f43b3b9e5d4cc1922a1d2f0c18699a4d64dd"}],"concept.wikipedia.brushed-dc-electric-motor":[{"id":"assertion.concept.wikipedia.brushed-dc-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brushed DC electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brushed DC electric motor\", CC BY-SA 4.0) states: A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","support":[{"end":282,"quote":"A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","source_id":"wikipedia.article.brushed-dc-electric-motor","source_sha256":"fd9acaf2187d642ceedbcf1046cf43d9dcd115329db5f4095fb22087e7b766e9","start":113}],"target_id":"concept.wikipedia.brushed-dc-electric-motor","target_kind":"node","target_sha256":"8b9b7357185a53bd73c27027d96c494d9cdce8c8b51d181a9de3c89db60030e5"}],"concept.wikipedia.brushless-dc-electric-motor":[{"id":"assertion.concept.wikipedia.brushless-dc-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brushless DC electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brushless DC electric motor\", CC BY-SA 4.0) states: A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","support":[{"end":274,"quote":"A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","source_id":"wikipedia.article.brushless-dc-electric-motor","source_sha256":"633c4a77b3fd5bc4ac65b084627744bb0b88c3e940c594bde154a3cbbb44a3c0","start":113}],"target_id":"concept.wikipedia.brushless-dc-electric-motor","target_kind":"node","target_sha256":"229277215c20230756e5c87cfdd66ef477ca47f7e9abc211cb953dedd4b0eefb"}],"concept.wikipedia.bubble-sensor":[{"id":"assertion.concept.wikipedia.bubble-sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bubble sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bubble sensor\", CC BY-SA 4.0) states: Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","support":[{"end":181,"quote":"Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","source_id":"wikipedia.article.bubble-sensor","source_sha256":"a9801608dcf3b0367ad2f691ec47d808685053531bc93f3701d8278afae940b7","start":101}],"target_id":"concept.wikipedia.bubble-sensor","target_kind":"node","target_sha256":"b0858861a3393071f05dbb37ad707e60adac3344c8c6026d50c01b05d722ac64"}],"concept.wikipedia.buchholz-s-ordinal":[{"id":"assertion.concept.wikipedia.buchholz-s-ordinal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buchholz's ordinal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buchholz's ordinal\", CC BY-SA 4.0) states: In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","support":[{"end":277,"quote":"In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","source_id":"wikipedia.article.buchholz-s-ordinal","source_sha256":"db8f96473b5bfa4da955aac34cc80454f6770be65f34afd4cd87c12f5f7d5722","start":106}],"target_id":"concept.wikipedia.buchholz-s-ordinal","target_kind":"node","target_sha256":"f319dcf97925b9392a664c03be8c7b148a0fe26b69792b9af838c425f827ddad"}],"concept.wikipedia.buckling-restrained-braced-frame":[{"id":"assertion.concept.wikipedia.buckling-restrained-braced-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buckling-restrained braced frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buckling-restrained braced frame\", CC BY-SA 4.0) states: Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","support":[{"end":271,"quote":"Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","source_id":"wikipedia.article.buckling-restrained-braced-frame","source_sha256":"ebd495d5d959aead754848d1f7e91ee39a9d33f17b9a1003a4c7ccc96ed57b65","start":120}],"target_id":"concept.wikipedia.buckling-restrained-braced-frame","target_kind":"node","target_sha256":"94440a0f1c9751cd2d5b031b377bc7574b5d304477488f5b86e07caba963e24b"}],"concept.wikipedia.building-engineer":[{"id":"assertion.concept.wikipedia.building-engineer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Building engineer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Building engineer\", CC BY-SA 4.0) states: A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","support":[{"end":262,"quote":"A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","source_id":"wikipedia.article.building-engineer","source_sha256":"916046ecdcbdc5d6976e35fdcaafc2614694fd1021cb814e6e294ee3befa5262","start":105}],"target_id":"concept.wikipedia.building-engineer","target_kind":"node","target_sha256":"998db9ce91b8bce2ebf43c164a29b5fdaddfc7b430b1eed178a57854990ec2e6"}],"concept.wikipedia.bulldog-clip":[{"id":"assertion.concept.wikipedia.bulldog-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bulldog clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bulldog clip\", CC BY-SA 4.0) states: A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","support":[{"end":186,"quote":"A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","source_id":"wikipedia.article.bulldog-clip","source_sha256":"2a0722e8c9fbff14e209a62af88ef80d3d4ae248d5ac16127697554a0427b407","start":99}],"target_id":"concept.wikipedia.bulldog-clip","target_kind":"node","target_sha256":"fab1299ff7f3659779992532c10b373dee000086d6130d8c1ffe476d4dc8f9ec"}],"concept.wikipedia.burden-of-knowledge":[{"id":"assertion.concept.wikipedia.burden-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Burden of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Burden of knowledge\", CC BY-SA 4.0) states: The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","support":[{"end":263,"quote":"The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","source_id":"wikipedia.article.burden-of-knowledge","source_sha256":"f919312cd0854bc02669ff7fc45ac7d080d6aa69774a79c79a6de77821ab4526","start":107}],"target_id":"concept.wikipedia.burden-of-knowledge","target_kind":"node","target_sha256":"4476f78b973f64616542cbb81321de0b4028924bffed72206ca3f8f80a384b07"}],"concept.wikipedia.bus-holder":[{"id":"assertion.concept.wikipedia.bus-holder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bus-holder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bus-holder\", CC BY-SA 4.0) states: A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","support":[{"end":193,"quote":"A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","source_id":"wikipedia.article.bus-holder","source_sha256":"3b3b8def1dee9681221bf97b19e679782c412658ae2594f5d61fc73ebf858aaf","start":97}],"target_id":"concept.wikipedia.bus-holder","target_kind":"node","target_sha256":"1bc1ede4307070b6a3bc4cc7b0368c6dc2bec7c5ef9c53f9ff60562f17e5a53e"}],"concept.wikipedia.busemann-petty-problem":[{"id":"assertion.concept.wikipedia.busemann-petty-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Busemann–Petty problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Busemann–Petty problem\", CC BY-SA 4.0) states: In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","support":[{"end":369,"quote":"In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","source_id":"wikipedia.article.busemann-petty-problem","source_sha256":"ad01d9b3db36f302d469347e231d5df25ab8586b5bb172f3dd220b60a258f065","start":110}],"target_id":"concept.wikipedia.busemann-petty-problem","target_kind":"node","target_sha256":"7576695211bf485e4188aba790913c8c85677d0d83d640b2a642732d3402f34b"}],"concept.wikipedia.butt-welding":[{"id":"assertion.concept.wikipedia.butt-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butt welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butt welding\", CC BY-SA 4.0) states: Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","support":[{"end":365,"quote":"Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","source_id":"wikipedia.article.butt-welding","source_sha256":"94765ba13844807ebb3b69f5ceb6efd92ec74a4203390b1521e0d445c38c66ca","start":99}],"target_id":"concept.wikipedia.butt-welding","target_kind":"node","target_sha256":"9b85130818cb48b96993be8c8425171782d2d4b95b2aab9a824c88964acb2960"}],"concept.wikipedia.butterfly-effect":[{"id":"assertion.concept.wikipedia.butterfly-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butterfly effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butterfly effect\", CC BY-SA 4.0) states: In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","support":[{"end":310,"quote":"In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","source_id":"wikipedia.article.butterfly-effect","source_sha256":"c328aba036a3b259096aa81107ae0dbde92186668b3286cb4f2d40bdb89359c0","start":100}],"target_id":"concept.wikipedia.butterfly-effect","target_kind":"node","target_sha256":"cbb998c1c878f254cca92416573eda49a34769f09b4604ed004f7569fc5b8c62"}],"concept.wikipedia.butterfly-valve":[{"id":"assertion.concept.wikipedia.butterfly-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butterfly valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butterfly valve\", CC BY-SA 4.0) states: A butterfly valve is a valve that isolates or regulates the flow of a fluid.","support":[{"end":177,"quote":"A butterfly valve is a valve that isolates or regulates the flow of a fluid.","source_id":"wikipedia.article.butterfly-valve","source_sha256":"7d4f25551387587cd891de447e7e4a5956fb80bcb000ed20c4936f520b2eed1e","start":101}],"target_id":"concept.wikipedia.butterfly-valve","target_kind":"node","target_sha256":"1f6f6091695e96fc27e560ca0a8a7e0db94601d63a7cc9f56bca19fbef68db86"}],"concept.wikipedia.buttressed-core":[{"id":"assertion.concept.wikipedia.buttressed-core","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buttressed core as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buttressed core\", CC BY-SA 4.0) states: A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","support":[{"end":246,"quote":"A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","source_id":"wikipedia.article.buttressed-core","source_sha256":"be80f4da70fe0be3ec1d38ecc14b67801e5e08e08f0eb0d083ba90714b56d17e","start":103}],"target_id":"concept.wikipedia.buttressed-core","target_kind":"node","target_sha256":"764fa5ee58df07768dd2a56942e3e18c971dc38bceb8f635d69623d3941a67e3"}],"concept.wikipedia.buzzer":[{"id":"assertion.concept.wikipedia.buzzer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buzzer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buzzer\", CC BY-SA 4.0) states: A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","support":[{"end":220,"quote":"A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","source_id":"wikipedia.article.buzzer","source_sha256":"ccfbb4f985c83adcb5fb04e33a2b1a036f5cde23823b7fc47750b6adf05f7710","start":92}],"target_id":"concept.wikipedia.buzzer","target_kind":"node","target_sha256":"c3eb1ee8d5520d343fc94921977c490a9cc7bfc0f81def569dab336939e57d40"}],"concept.wikipedia.c-dl-g":[{"id":"assertion.concept.wikipedia.c-dl-g","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Càdlàg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Càdlàg\", CC BY-SA 4.0) states: In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\"right continuous with left limits\"), or corlol (\"continuous on (the) right, limit on (the) left\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","support":[{"end":414,"quote":"In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\\\"right continuous with left limits\\\"), or corlol (\\\"continuous on (the) right, limit on (the) left\\\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","source_id":"wikipedia.article.c-dl-g","source_sha256":"8f76ad8dfa0c303aa0a399825d967eaa9eee0aa5504eb8997e0109d9d518c57c","start":94}],"target_id":"concept.wikipedia.c-dl-g","target_kind":"node","target_sha256":"1d445ddaebf11e9c5b2a59d6d9a9bec4800ce1de23c3ee6c9c392ef59896f9e1"}],"concept.wikipedia.cable-fairing":[{"id":"assertion.concept.wikipedia.cable-fairing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cable fairing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cable fairing\", CC BY-SA 4.0) states: A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","support":[{"end":241,"quote":"A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","source_id":"wikipedia.article.cable-fairing","source_sha256":"f2b2b820c6135c7a0631017644c3d273fe3e4c8ed9a70a5f12420c8d397e52f4","start":101}],"target_id":"concept.wikipedia.cable-fairing","target_kind":"node","target_sha256":"283c9bca60cbd08f292b5254e4c39dd86edd6c92b041cfcd4550cefa33fb25e1"}],"concept.wikipedia.cable-robots":[{"id":"assertion.concept.wikipedia.cable-robots","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cable robots as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cable robots\", CC BY-SA 4.0) states: Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","support":[{"end":285,"quote":"Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","source_id":"wikipedia.article.cable-robots","source_sha256":"22b99cac88b5e134e9e3e8e046b612c08e56bdcfdc21a02ae46a43c23f7ea0d3","start":100}],"target_id":"concept.wikipedia.cable-robots","target_kind":"node","target_sha256":"8159ca8b92bdca0e186e1da3c4ed47b11fc702dc21c6d9ad87784b2cae14adc5"}],"concept.wikipedia.cagniard-de-hoop-method":[{"id":"assertion.concept.wikipedia.cagniard-de-hoop-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cagniard–De Hoop method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cagniard–De Hoop method\", CC BY-SA 4.0) states: In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","support":[{"end":310,"quote":"In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","source_id":"wikipedia.article.cagniard-de-hoop-method","source_sha256":"f8436daa843fba48315f4a897f2651530d0b438e424632d8955db9aec01107ac","start":111}],"target_id":"concept.wikipedia.cagniard-de-hoop-method","target_kind":"node","target_sha256":"776b9af314b1fd02ac1c288b0419acc436a52f6c754564d62680c0ee9c217d7b"}],"concept.wikipedia.calcium-looping":[{"id":"assertion.concept.wikipedia.calcium-looping","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calcium looping as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calcium looping\", CC BY-SA 4.0) states: Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","support":[{"end":216,"quote":"Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","source_id":"wikipedia.article.calcium-looping","source_sha256":"1616c15b8eef3e383a2a9cf3f79c2a56a04d2f95c71610b7137e7a275cfc3a0f","start":103}],"target_id":"concept.wikipedia.calcium-looping","target_kind":"node","target_sha256":"043a84dd8915953154207fef622013a1897c26019d94ab37dcdd554aaac5ec9d"}],"concept.wikipedia.calculus":[{"id":"assertion.concept.wikipedia.calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus\", CC BY-SA 4.0) states: Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","support":[{"end":225,"quote":"Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","source_id":"wikipedia.article.calculus","source_sha256":"f037fd3ccae5d49070f1a21e012af94cab21296635c2fd93bb59be6dfd9c9ec2","start":92}],"target_id":"concept.wikipedia.calculus","target_kind":"node","target_sha256":"f0abe08f475e3f384f7a558eefd238aecd191d9d03ad3dcb485d07c400187d36"}],"concept.wikipedia.calculus-on-finite-weighted-graphs":[{"id":"assertion.concept.wikipedia.calculus-on-finite-weighted-graphs","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus on finite weighted graphs as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus on finite weighted graphs\", CC BY-SA 4.0) states: In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","support":[{"end":321,"quote":"In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","source_id":"wikipedia.article.calculus-on-finite-weighted-graphs","source_sha256":"8060d72dda9f7f403d92f3f0f370ad464be17b1cff19baa58e47760ed990b7ef","start":122}],"target_id":"concept.wikipedia.calculus-on-finite-weighted-graphs","target_kind":"node","target_sha256":"548179325f045f2249a84896346a53d24093096955c29a7f10228333079c1691"}],"concept.wikipedia.calculus-ratiocinator":[{"id":"assertion.concept.wikipedia.calculus-ratiocinator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus ratiocinator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus ratiocinator\", CC BY-SA 4.0) states: The calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","support":[{"end":361,"quote":"The  calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","source_id":"wikipedia.article.calculus-ratiocinator","source_sha256":"336367a6c3bc47d18c2d66e34988573840eefcce8349ae9194ade62ba38dd3d0","start":107}],"target_id":"concept.wikipedia.calculus-ratiocinator","target_kind":"node","target_sha256":"be034eadbf7bf68609bb65e7abe1c6bc8c113ece24e5a5ecdfeaeb670d125898"}],"concept.wikipedia.cam-mechanism":[{"id":"assertion.concept.wikipedia.cam-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cam (mechanism) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cam (mechanism)\", CC BY-SA 4.0) states: A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","support":[{"end":226,"quote":"A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","source_id":"wikipedia.article.cam-mechanism","source_sha256":"124154e3ac0e74e30a7df242fb7d58004c52162a8c876e2e079a0d0132c82328","start":100}],"target_id":"concept.wikipedia.cam-mechanism","target_kind":"node","target_sha256":"4ae306b198c80feffd4dab9f66095be6ef15ed69d434a474e49e4a527740192f"}],"concept.wikipedia.cam-timer":[{"id":"assertion.concept.wikipedia.cam-timer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cam timer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cam timer\", CC BY-SA 4.0) states: A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","support":[{"end":207,"quote":"A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","source_id":"wikipedia.article.cam-timer","source_sha256":"a303826ac33896bdd7a01bc3ed6ff4f3de66b53a7d1d0af50e0799c9659d8884","start":95}],"target_id":"concept.wikipedia.cam-timer","target_kind":"node","target_sha256":"a9e6366c44d70a62d3146a11620ca54ad6cdad241b60b6000a797ce1b7ce9ef1"}],"concept.wikipedia.camcon-binary-actuator":[{"id":"assertion.concept.wikipedia.camcon-binary-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Camcon binary actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Camcon binary actuator\", CC BY-SA 4.0) states: The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","support":[{"end":251,"quote":"The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","source_id":"wikipedia.article.camcon-binary-actuator","source_sha256":"f874becb8e4ed0dce522cfcaacd8fffba036cede0394827625b8d12f10573e2b","start":110}],"target_id":"concept.wikipedia.camcon-binary-actuator","target_kind":"node","target_sha256":"cd399efa48ee2f1246d317da10cb76ef23ac1c93f6e036da395a58636f51f970"}],"concept.wikipedia.cameleon-protein":[{"id":"assertion.concept.wikipedia.cameleon-protein","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cameleon (protein) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cameleon (protein)\", CC BY-SA 4.0) states: Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","support":[{"end":234,"quote":"Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","source_id":"wikipedia.article.cameleon-protein","source_sha256":"71401211622bcbfccf51c549b8ddde5204f00cfd981de9b8b03e614aa3fbd063","start":105}],"target_id":"concept.wikipedia.cameleon-protein","target_kind":"node","target_sha256":"2f828191c293a5f4ab25b3de6fdbac087bbf97c61d5772d717e37b77f7cdabc0"}],"concept.wikipedia.canberra-plan":[{"id":"assertion.concept.wikipedia.canberra-plan","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Canberra Plan as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Canberra Plan\", CC BY-SA 4.0) states: In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","support":[{"end":262,"quote":"In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","source_id":"wikipedia.article.canberra-plan","source_sha256":"d3de7c46bff4a6cc8e4ce23259a2c9e530b8534469a7787f4f75d07a8bc2e69a","start":101}],"target_id":"concept.wikipedia.canberra-plan","target_kind":"node","target_sha256":"6b95eb9f49f3f557bd8ef47b234cbfbdc85a5f9b2afe2e75750003d9b5c216e1"}],"concept.wikipedia.candle-problem":[{"id":"assertion.concept.wikipedia.candle-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Candle problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Candle problem\", CC BY-SA 4.0) states: The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","support":[{"end":306,"quote":"The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","source_id":"wikipedia.article.candle-problem","source_sha256":"5d3335c0262ce9e14a592097b2137de75183eb8bc8ad34355240eb44a1b830c6","start":102}],"target_id":"concept.wikipedia.candle-problem","target_kind":"node","target_sha256":"8c060d39578c1278b9a0a62d04c1f02f3e77268ce3785d239a7b4b2f63e03891"}],"concept.wikipedia.cannon-bearing":[{"id":"assertion.concept.wikipedia.cannon-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cannon bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cannon bearing\", CC BY-SA 4.0) states: A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","support":[{"end":251,"quote":"A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","source_id":"wikipedia.article.cannon-bearing","source_sha256":"49d9282a26213df599f80d77344c14c4026264ea9f4b596689b2d77aa9f38359","start":102}],"target_id":"concept.wikipedia.cannon-bearing","target_kind":"node","target_sha256":"e1ae7a178b04b35a439df3e476936dce239cf1fa6d346c410cba1ef0fa32b419"}],"concept.wikipedia.canonical-form":[{"id":"assertion.concept.wikipedia.canonical-form","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Canonical form as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Canonical form\", CC BY-SA 4.0) states: In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","support":[{"end":273,"quote":"In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","source_id":"wikipedia.article.canonical-form","source_sha256":"f56d06b328ffb0263961c7b59c3bdfc00b69952775d1582fb9fc3a7faedd9d31","start":100}],"target_id":"concept.wikipedia.canonical-form","target_kind":"node","target_sha256":"279b3a4813ec599d2023e43295a5042d2e53f906e7a3b58e4408c9dea30a2ca0"}],"concept.wikipedia.cantilever":[{"id":"assertion.concept.wikipedia.cantilever","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantilever as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantilever\", CC BY-SA 4.0) states: A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","support":[{"end":225,"quote":"A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","source_id":"wikipedia.article.cantilever","source_sha256":"0cff716c11a2dbd69cef91d4b628d4897ae001577374f524dcc162054f3953d9","start":96}],"target_id":"concept.wikipedia.cantilever","target_kind":"node","target_sha256":"52b3e91d89e998ff5b6e0fa285d5e8fdb386ec2cf07164f9a9ae7b27e40fb206"}],"concept.wikipedia.cantor-function":[{"id":"assertion.concept.wikipedia.cantor-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor function\", CC BY-SA 4.0) states: In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous.","support":[{"end":216,"quote":"In mathematics, the Cantor function is an example of a  function that is continuous, but not absolutely continuous.","source_id":"wikipedia.article.cantor-function","source_sha256":"cd6226112e6e68adc63f989f03dc8264e2b5871ddc320b4a3a99da5bfae0bddf","start":101}],"target_id":"concept.wikipedia.cantor-function","target_kind":"node","target_sha256":"4f4ce0258e3e44107e74c3bfd37763c6842e3c3fe56ebd395336eae2e184620a"}],"concept.wikipedia.cantor-set":[{"id":"assertion.concept.wikipedia.cantor-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor set\", CC BY-SA 4.0) states: In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","support":[{"end":232,"quote":"In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","source_id":"wikipedia.article.cantor-set","source_sha256":"bd34e21972d7b6114b83ca67f3da4f0f0bd8bc7766ca79e00a440d7ac68a909f","start":94}],"target_id":"concept.wikipedia.cantor-set","target_kind":"node","target_sha256":"91f0d8f04586b768623c54551633d0725559b2ed4eb55b69bae2b10539f55796"}],"concept.wikipedia.cantor-space":[{"id":"assertion.concept.wikipedia.cantor-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor space\", CC BY-SA 4.0) states: In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","support":[{"end":290,"quote":"In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","source_id":"wikipedia.article.cantor-space","source_sha256":"a86ca11b0a1dc1f7726ac12be65364168869f41adab9d1be465430fbd89a49fe","start":98}],"target_id":"concept.wikipedia.cantor-space","target_kind":"node","target_sha256":"c6a54a5d50516f5b8a935cadea2533b799d95281c6322dc958f4b97f748eed5a"}],"concept.wikipedia.cantor-tree":[{"id":"assertion.concept.wikipedia.cantor-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor tree\", CC BY-SA 4.0) states: In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","support":[{"end":267,"quote":"In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","source_id":"wikipedia.article.cantor-tree","source_sha256":"fa295d4e43bff607cb33ad9fb9e67c05183b3ed2435d6953517725071e53797b","start":99}],"target_id":"concept.wikipedia.cantor-tree","target_kind":"node","target_sha256":"7a93bbb77fc7df4a9e9bfdfa390d937c351cc09b0137afc0a4a6f4e279854fe3"}],"concept.wikipedia.capacitor":[{"id":"assertion.concept.wikipedia.capacitor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capacitor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capacitor\", CC BY-SA 4.0) states: A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","support":[{"end":249,"quote":"A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","source_id":"wikipedia.article.capacitor","source_sha256":"664d073a795f0e3026b3b61aadee89fffa6ee1fc9d338532bac55b00bc2722c1","start":96}],"target_id":"concept.wikipedia.capacitor","target_kind":"node","target_sha256":"0da68ec230d35cdf4f1ec36bc4621014861787ad58e6310ea3b393bdc72a9d5b"}],"concept.wikipedia.capacitor-discharge-sintering":[{"id":"assertion.concept.wikipedia.capacitor-discharge-sintering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capacitor discharge sintering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capacitor discharge sintering\", CC BY-SA 4.0) states: Capacitor discharge sintering (CDS) is an electric current assisted sintering (ECAS) technique.","support":[{"end":213,"quote":"Capacitor discharge sintering (CDS)  is an electric current assisted sintering (ECAS) technique.","source_id":"wikipedia.article.capacitor-discharge-sintering","source_sha256":"452bb3cd5e5622a16ff8a090c35a3b5f672daec501e74e590ed25ffb9bd4675a","start":117}],"target_id":"concept.wikipedia.capacitor-discharge-sintering","target_kind":"node","target_sha256":"c05bac55597183a9ed0c6509dcaecd6a591fa04da1d11c43019595ce31cb9db2"}],"concept.wikipedia.capella-engineering":[{"id":"assertion.concept.wikipedia.capella-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capella (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capella (engineering)\", CC BY-SA 4.0) states: Capella is an open-source solution for model-based systems engineering (MBSE).","support":[{"end":187,"quote":"Capella is an open-source solution for model-based systems engineering (MBSE).","source_id":"wikipedia.article.capella-engineering","source_sha256":"4ee6cdaf07a8dc72bb2b665c8ccd04d00b2bb79276537aaa99c553815f40751f","start":109}],"target_id":"concept.wikipedia.capella-engineering","target_kind":"node","target_sha256":"40b67203dcbde5750ed907a67c9a9856fd2939bbd27ab2f01d6ac5686ed13757"}],"concept.wikipedia.carath-odory-s-criterion":[{"id":"assertion.concept.wikipedia.carath-odory-s-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carathéodory's criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carathéodory's criterion\", CC BY-SA 4.0) states: Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","support":[{"end":287,"quote":"Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","source_id":"wikipedia.article.carath-odory-s-criterion","source_sha256":"f3ecce1321d61476c56d1646aee0304ac323e66e9ab4fd5da6da5ccdef9240ef","start":112}],"target_id":"concept.wikipedia.carath-odory-s-criterion","target_kind":"node","target_sha256":"59872bb9555da560bf0853f7ffa1852f847a7a2d666ca76a6b0059d6d3b93ec2"}],"concept.wikipedia.carlyle-circle":[{"id":"assertion.concept.wikipedia.carlyle-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carlyle circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carlyle circle\", CC BY-SA 4.0) states: In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","support":[{"end":248,"quote":"In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","source_id":"wikipedia.article.carlyle-circle","source_sha256":"841dc6275d353d1fc39a204a9e8f830f6fc0813432eb42e829ebaa1416eb744e","start":102}],"target_id":"concept.wikipedia.carlyle-circle","target_kind":"node","target_sha256":"b0a3f933f753e7cd9e873577fa6b22a849587bfed5120ecee0b2f50be5f5c193"}],"concept.wikipedia.carnot-heat-engine":[{"id":"assertion.concept.wikipedia.carnot-heat-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carnot heat engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carnot heat engine\", CC BY-SA 4.0) states: A Carnot heat engine (English: kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","support":[{"end":223,"quote":"A Carnot heat engine (English:  kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","source_id":"wikipedia.article.carnot-heat-engine","source_sha256":"a3388dda742833ef37d8d531e31834b3c8e3a7e073d41b1f5e30b433460a0377","start":102}],"target_id":"concept.wikipedia.carnot-heat-engine","target_kind":"node","target_sha256":"0830b2ac597e4fccd5de35f6f276da12c9314d838c767818f2d3356896f64bf2"}],"concept.wikipedia.carr-du-champ-operator":[{"id":"assertion.concept.wikipedia.carr-du-champ-operator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carré du champ operator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carré du champ operator\", CC BY-SA 4.0) states: The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","support":[{"end":250,"quote":"The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","source_id":"wikipedia.article.carr-du-champ-operator","source_sha256":"d673519d1db90e0c5f79fba43334b8e401cb12df7ac3778d1154c1a445870017","start":111}],"target_id":"concept.wikipedia.carr-du-champ-operator","target_kind":"node","target_sha256":"35ef349e83c8ccdd4ac66a720692503325820a48f9b0811263cf4a4796e5c140"}],"concept.wikipedia.carrier-grade":[{"id":"assertion.concept.wikipedia.carrier-grade","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carrier grade as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carrier grade\", CC BY-SA 4.0) states: In telecommunications, a \"carrier grade\" or \"carrier class\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","support":[{"end":292,"quote":"In telecommunications, a \\\"carrier grade\\\" or \\\"carrier class\\\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","source_id":"wikipedia.article.carrier-grade","source_sha256":"a2c19541ebc187140fa989d59138cf80c36dcb82a5b5591d388be475a4b1e1a6","start":101}],"target_id":"concept.wikipedia.carrier-grade","target_kind":"node","target_sha256":"692a4a369e3cbbaca1d8bf0b7e87168ed1bdc688229f32015440941c4f8da5fc"}],"concept.wikipedia.cartan-decomposition":[{"id":"assertion.concept.wikipedia.cartan-decomposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartan decomposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartan decomposition\", CC BY-SA 4.0) states: In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","support":[{"end":291,"quote":"In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","source_id":"wikipedia.article.cartan-decomposition","source_sha256":"c30eb6ab6e24651df27226cc5f941bb696975a30807c7b920a9f1e72d27e03e0","start":107}],"target_id":"concept.wikipedia.cartan-decomposition","target_kind":"node","target_sha256":"9ce586b427ddfa9d78ef6841234739e50a7fdef865698d81e0841c74debf9ae2"}],"concept.wikipedia.cartesian-circle":[{"id":"assertion.concept.wikipedia.cartesian-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesian circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesian circle\", CC BY-SA 4.0) states: The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","support":[{"end":252,"quote":"The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","source_id":"wikipedia.article.cartesian-circle","source_sha256":"b9ad40ec83da7d3be4126d60529fb8a230e7d7871e0b3558b7aa4c1125e34cdf","start":103}],"target_id":"concept.wikipedia.cartesian-circle","target_kind":"node","target_sha256":"719af8da7d8e64e900131d2ce931dbaefc4f9917116a9ca3c52cc3063f3077af"}],"concept.wikipedia.cartesian-doubt":[{"id":"assertion.concept.wikipedia.cartesian-doubt","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesian doubt as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesian doubt\", CC BY-SA 4.0) states: Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","support":[{"end":221,"quote":"Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","source_id":"wikipedia.article.cartesian-doubt","source_sha256":"302f95d3603e1e368c47a2e213dea68a6e4a78c40a1ae1ba47d7c4a36ec2310b","start":103}],"target_id":"concept.wikipedia.cartesian-doubt","target_kind":"node","target_sha256":"580370303d4a45ae3145c64d75701d19722417365a6a8a53679d91735a1f57e3"}],"concept.wikipedia.cartesianism":[{"id":"assertion.concept.wikipedia.cartesianism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesianism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesianism\", CC BY-SA 4.0) states: Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","support":[{"end":327,"quote":"Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","source_id":"wikipedia.article.cartesianism","source_sha256":"9d5c9d8206ca0efbbb7d695bdca99071a19485ab4790822c7dc26abc00705906","start":100}],"target_id":"concept.wikipedia.cartesianism","target_kind":"node","target_sha256":"18a2f4bb60d3fcbe5b8fda75d2560338d2733d30754214427b5e8a426d83382f"}],"concept.wikipedia.cascading-failure":[{"id":"assertion.concept.wikipedia.cascading-failure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cascading failure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cascading failure\", CC BY-SA 4.0) states: A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","support":[{"end":305,"quote":"A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","source_id":"wikipedia.article.cascading-failure","source_sha256":"17d11c28a4c0727ab0261180a95493d30dffb2bc7dac7589b14696d8abd8b9b6","start":103}],"target_id":"concept.wikipedia.cascading-failure","target_kind":"node","target_sha256":"94ecaef30c3186eaad1b57119dffdfcd7ab959eca498c1a54069196180aef835"}],"concept.wikipedia.case-based-reasoning":[{"id":"assertion.concept.wikipedia.case-based-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Case-based reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Case-based reasoning\", CC BY-SA 4.0) states: Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","support":[{"end":240,"quote":"Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","source_id":"wikipedia.article.case-based-reasoning","source_sha256":"ad3130fdf0a05cdac606c0a3979ca3ff3c092c21969b6e05189f4ef99836dbce","start":106}],"target_id":"concept.wikipedia.case-based-reasoning","target_kind":"node","target_sha256":"4f91ce90050b534a6579907c54bdd70516ff1acea3720b4521f3033a2ca09551"}],"concept.wikipedia.cask-breather":[{"id":"assertion.concept.wikipedia.cask-breather","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cask breather as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cask breather\", CC BY-SA 4.0) states: A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","support":[{"end":206,"quote":"A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","source_id":"wikipedia.article.cask-breather","source_sha256":"41940e320fa2db650106e6b1ffd50031301a1962a30d5ab409ef7569979e0b3d","start":101}],"target_id":"concept.wikipedia.cask-breather","target_kind":"node","target_sha256":"d17629432fc1f59d507a8a06edf414e532a962cc84f241bbcb21eec046a307cd"}],"concept.wikipedia.castellated-beam":[{"id":"assertion.concept.wikipedia.castellated-beam","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Castellated beam as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Castellated beam\", CC BY-SA 4.0) states: A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","support":[{"end":233,"quote":"A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","source_id":"wikipedia.article.castellated-beam","source_sha256":"8cb68fd74fb1f58695c219bc45816d4d0f4e8b704a98787c0006c10fe539abcf","start":104}],"target_id":"concept.wikipedia.castellated-beam","target_kind":"node","target_sha256":"c189a5657f84cf07665caa9ceea45946f3a86368d6ffde2948144bc3146a2866"}],"concept.wikipedia.catch-22-logic":[{"id":"assertion.concept.wikipedia.catch-22-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catch-22 (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catch-22 (logic)\", CC BY-SA 4.0) states: A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","support":[{"end":226,"quote":"A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","source_id":"wikipedia.article.catch-22-logic","source_sha256":"04077c23956fd698e6d16f303bce9fafffe9a7c35ad79274652ecd90b5383066","start":103}],"target_id":"concept.wikipedia.catch-22-logic","target_kind":"node","target_sha256":"272383c4d2b248170c0e5caaa1d8faa659a9f18a837a5ede3814aeb6c7b76898"}],"concept.wikipedia.categorical-set-theory":[{"id":"assertion.concept.wikipedia.categorical-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Categorical set theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Categorical set theory\", CC BY-SA 4.0) states: Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","support":[{"end":250,"quote":"Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","source_id":"wikipedia.article.categorical-set-theory","source_sha256":"28774ed84d976863d27359bb660a743ecb874cb4e6eccc20f240aa886c4d2405","start":109}],"target_id":"concept.wikipedia.categorical-set-theory","target_kind":"node","target_sha256":"8dd7999c4d371799c90bfa53c74e79727577968577d52d2cfe8f334e4cf3c7c3"}],"concept.wikipedia.category-mathematics":[{"id":"assertion.concept.wikipedia.category-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category (mathematics)\", CC BY-SA 4.0) states: In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \"objects\" that are linked by \"arrows\".","support":[{"end":278,"quote":"In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \\\"objects\\\" that are linked by \\\"arrows\\\".","source_id":"wikipedia.article.category-mathematics","source_sha256":"2f33f56822c212be644c3add26f7f137eec08dc7f3307704e7bb0a74b067e56e","start":107}],"target_id":"concept.wikipedia.category-mathematics","target_kind":"node","target_sha256":"933cfaa4806947b6a4fe4ea0635a2861c0e4315fb93a093add62922d01c7b316"}],"concept.wikipedia.category-mistake":[{"id":"assertion.concept.wikipedia.category-mistake","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category mistake as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category mistake\", CC BY-SA 4.0) states: A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","support":[{"end":425,"quote":"A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","source_id":"wikipedia.article.category-mistake","source_sha256":"956f1f2582f79a87aefc73743c54eca32ba93782bf3b8261425281dce1542606","start":102}],"target_id":"concept.wikipedia.category-mistake","target_kind":"node","target_sha256":"d0360af13757b4ae879eb758054f75fe765ec5450671cedea42d4c4225ed34e6"}],"concept.wikipedia.category-of-manifolds":[{"id":"assertion.concept.wikipedia.category-of-manifolds","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of manifolds as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of manifolds\", CC BY-SA 4.0) states: In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","support":[{"end":304,"quote":"In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","source_id":"wikipedia.article.category-of-manifolds","source_sha256":"fd16ab2d52b0fb1584b3dd5d45d2d1fcf604958da652c8acfaccbd3727267e3a","start":109}],"target_id":"concept.wikipedia.category-of-manifolds","target_kind":"node","target_sha256":"66656e6e6ee95b3cd88b9d79397ca506a509d2757c31da4817e1fb80d4e75077"}],"concept.wikipedia.category-of-markov-kernels":[{"id":"assertion.concept.wikipedia.category-of-markov-kernels","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of Markov kernels as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of Markov kernels\", CC BY-SA 4.0) states: In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","support":[{"end":274,"quote":"In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","source_id":"wikipedia.article.category-of-markov-kernels","source_sha256":"a693805c5e959707c669de918b127e09234aeb7fa9ceb60fb97f2429a688475f","start":114}],"target_id":"concept.wikipedia.category-of-markov-kernels","target_kind":"node","target_sha256":"508d2ac6c083d49ab538f0e74f1f86c5581169e33beab98f61e06371f5e750d7"}],"concept.wikipedia.category-of-measurable-spaces":[{"id":"assertion.concept.wikipedia.category-of-measurable-spaces","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of measurable spaces as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of measurable spaces\", CC BY-SA 4.0) states: In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","support":[{"end":280,"quote":"In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","source_id":"wikipedia.article.category-of-measurable-spaces","source_sha256":"a6bb45d7bfdbd29a78266325fe017caeaba245141663d3d7db02d45bd732f6cb","start":117}],"target_id":"concept.wikipedia.category-of-measurable-spaces","target_kind":"node","target_sha256":"83a5346b3ef3b3cd3ca82f60b9b6b577d379dda931113e94a8fffceb019cc694"}],"concept.wikipedia.catu-ko-i":[{"id":"assertion.concept.wikipedia.catu-ko-i","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catuṣkoṭi as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catuṣkoṭi\", CC BY-SA 4.0) states: Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","support":[{"end":468,"quote":"Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","source_id":"wikipedia.article.catu-ko-i","source_sha256":"73a48076333f1a394e7e06c647b0a20ed038fbff807e459d63f30b332e0210ed","start":97}],"target_id":"concept.wikipedia.catu-ko-i","target_kind":"node","target_sha256":"cb531ef78c06d73198998eb4a624c4d596079f5c357a157b29d0b33f4b6886ee"}],"concept.wikipedia.cauchy-principal-value":[{"id":"assertion.concept.wikipedia.cauchy-principal-value","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy principal value as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy principal value\", CC BY-SA 4.0) states: In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","support":[{"end":285,"quote":"In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","source_id":"wikipedia.article.cauchy-principal-value","source_sha256":"9e9ddfb310a457fa2dfaef81f563f8bb47e5ee6030cc00bd5846514368f8fab2","start":108}],"target_id":"concept.wikipedia.cauchy-principal-value","target_kind":"node","target_sha256":"b5883697fc7989cc014dded2093577157a977362ae59eee3a3c010d336878f75"}],"concept.wikipedia.cauchy-product":[{"id":"assertion.concept.wikipedia.cauchy-product","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy product as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy product\", CC BY-SA 4.0) states: In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","support":[{"end":230,"quote":"In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","source_id":"wikipedia.article.cauchy-product","source_sha256":"bb2751a5a561a2c105aa56979ff27b4b66b35e1cab50f59752226a9b616642cd","start":100}],"target_id":"concept.wikipedia.cauchy-product","target_kind":"node","target_sha256":"22c9dae0142b924a13da9c82ded5deada2ebc53b9f8fb52aa5218419752d1380"}],"concept.wikipedia.cauchy-sequence":[{"id":"assertion.concept.wikipedia.cauchy-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy sequence\", CC BY-SA 4.0) states: In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","support":[{"end":228,"quote":"In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","source_id":"wikipedia.article.cauchy-sequence","source_sha256":"53f85965297862f6dbd698932b6da80e1f98f3c6eb470946f490abda84f81534","start":99}],"target_id":"concept.wikipedia.cauchy-sequence","target_kind":"node","target_sha256":"05ff707ef980bec38f159d000f75f9beeb28c3676c1a7e652b115f8e9942eb62"}],"concept.wikipedia.causal-closure":[{"id":"assertion.concept.wikipedia.causal-closure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal closure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal closure\", CC BY-SA 4.0) states: Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","support":[{"end":274,"quote":"Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","source_id":"wikipedia.article.causal-closure","source_sha256":"fb94c89fbc2ed08d63ddf0adda4c342eb5d73a5e07e4d6f655408dd511f34926","start":101}],"target_id":"concept.wikipedia.causal-closure","target_kind":"node","target_sha256":"1124f81d5fbaf9b158cac751f0ff8ee5fc38e6ddd020a56aa320f041da446408"}],"concept.wikipedia.causal-inference":[{"id":"assertion.concept.wikipedia.causal-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal inference\", CC BY-SA 4.0) states: Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","support":[{"end":248,"quote":"Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","source_id":"wikipedia.article.causal-inference","source_sha256":"242c6c1788209dde36e5b79e754ca5e4118e34c40f22e5da512d7be09f409ea3","start":104}],"target_id":"concept.wikipedia.causal-inference","target_kind":"node","target_sha256":"a81dcf34c5af14e3c98b255cc674fcb9285a8a1987e52d0484d6beee6cc9e58f"}],"concept.wikipedia.causal-model":[{"id":"assertion.concept.wikipedia.causal-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal model\", CC BY-SA 4.0) states: In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","support":[{"end":257,"quote":"In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","source_id":"wikipedia.article.causal-model","source_sha256":"7a8677e583f6cf9a4203056d7a4f89195acaacac1810c7005159506d02e80778","start":99}],"target_id":"concept.wikipedia.causal-model","target_kind":"node","target_sha256":"35d403a8c5806d883080ee20ee4ba1266e5e02b69b765b01ac9ea4e2f69e0da0"}],"concept.wikipedia.causal-reasoning":[{"id":"assertion.concept.wikipedia.causal-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal reasoning\", CC BY-SA 4.0) states: Causal reasoning is the process of identifying causality: the relationship between a cause and its effect.","support":[{"end":211,"quote":"Causal reasoning is the process of  identifying causality: the relationship between a cause and its effect.","source_id":"wikipedia.article.causal-reasoning","source_sha256":"0924b63059b05b075516d7e1ff02fe0a26404a826031eadc5fe2c634f1301114","start":104}],"target_id":"concept.wikipedia.causal-reasoning","target_kind":"node","target_sha256":"3911048a8f71f452e2138ea2cc6e4cbcd7bc16b016e61201a43cb9a0a480fedf"}],"concept.wikipedia.causal-theory-of-reference":[{"id":"assertion.concept.wikipedia.causal-theory-of-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal theory of reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal theory of reference\", CC BY-SA 4.0) states: A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","support":[{"end":251,"quote":"A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","source_id":"wikipedia.article.causal-theory-of-reference","source_sha256":"b6677a481ece0b884ee88d002270ccf3ce9fd5ea11909c62c872802de8075a4b","start":112}],"target_id":"concept.wikipedia.causal-theory-of-reference","target_kind":"node","target_sha256":"b3b77a5a6c66ee713470842e4beb8a602a3a1bb719f6df4ebb9d7ed890770afe"}],"concept.wikipedia.center-algebra":[{"id":"assertion.concept.wikipedia.center-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Center (algebra) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Center (algebra)\", CC BY-SA 4.0) states: The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","support":[{"end":253,"quote":"The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","source_id":"wikipedia.article.center-algebra","source_sha256":"78d35093cbe7b4676dbec8933820bef9b972deed3a66e6a3207440c1177cc32e","start":102}],"target_id":"concept.wikipedia.center-algebra","target_kind":"node","target_sha256":"4b341d9d2c385289d51d7c9466c591801771e9a9ea34802bfa76a3dbbadd3c62"}],"concept.wikipedia.centerpoint-geometry":[{"id":"assertion.concept.wikipedia.centerpoint-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centerpoint (geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centerpoint (geometry)\", CC BY-SA 4.0) states: In statistics and computational geometry, the notion of centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","support":[{"end":259,"quote":"In statistics and computational geometry, the notion of  centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","source_id":"wikipedia.article.centerpoint-geometry","source_sha256":"2014e08ef97885622cda78edd8d76bff3bf6956bb20e7eaf54e60a632b1b2f28","start":110}],"target_id":"concept.wikipedia.centerpoint-geometry","target_kind":"node","target_sha256":"2bd15a9cac05beaab33a0d654c41f866ef6ed86dab5ece04b281d5822a6603d6"}],"concept.wikipedia.centrifugal-governor":[{"id":"assertion.concept.wikipedia.centrifugal-governor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centrifugal governor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centrifugal governor\", CC BY-SA 4.0) states: A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","support":[{"end":308,"quote":"A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","source_id":"wikipedia.article.centrifugal-governor","source_sha256":"7c2953a34fc653ddbef2bd60b520404a309f873e1fb75b03c934f8fe5d92d996","start":105}],"target_id":"concept.wikipedia.centrifugal-governor","target_kind":"node","target_sha256":"b6642e1100d5ad1db7b7e9940383b21cc916e044e10bd66341745853acdff09f"}],"concept.wikipedia.ceramic-engine":[{"id":"assertion.concept.wikipedia.ceramic-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ceramic engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ceramic engine\", CC BY-SA 4.0) states: A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","support":[{"end":201,"quote":"A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","source_id":"wikipedia.article.ceramic-engine","source_sha256":"b83c7382617d93ea456a9a0b42ce7614a0b009330c0908473253c9c879f3a0ee","start":102}],"target_id":"concept.wikipedia.ceramic-engine","target_kind":"node","target_sha256":"9920fa6ba4ddad3b78d966dc701cb0a21dfef5ba58d9356de51e72af5acfbb10"}],"concept.wikipedia.certificate-of-analysis":[{"id":"assertion.concept.wikipedia.certificate-of-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Certificate of analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Certificate of analysis\", CC BY-SA 4.0) states: A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","support":[{"end":411,"quote":"A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","source_id":"wikipedia.article.certificate-of-analysis","source_sha256":"6a81ecc05424f3d7caed8a2cfd6e7814cd978a1235f86870e8dbdc2eb82fc0e4","start":111}],"target_id":"concept.wikipedia.certificate-of-analysis","target_kind":"node","target_sha256":"28ef2ac601edfa82fcbb766fdfea5dfe323fb06d60784852d809e415f55a4f41"}],"concept.wikipedia.chain-complex":[{"id":"assertion.concept.wikipedia.chain-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain complex\", CC BY-SA 4.0) states: In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","support":[{"end":355,"quote":"In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","source_id":"wikipedia.article.chain-complex","source_sha256":"22d40bbd2a657da5a7b9343e3217e31e6fefca3c5bb97c416a10f4675c937600","start":99}],"target_id":"concept.wikipedia.chain-complex","target_kind":"node","target_sha256":"eee39aef75238a7787c28f270f38a01808f516d8f7f80f9aabd4663437c50e5c"}],"concept.wikipedia.chain-conveyor":[{"id":"assertion.concept.wikipedia.chain-conveyor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain conveyor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain conveyor\", CC BY-SA 4.0) states: A chain conveyor is a type of conveyor system for moving material through production lines.","support":[{"end":193,"quote":"A chain conveyor is a type of conveyor system for moving material through production lines.","source_id":"wikipedia.article.chain-conveyor","source_sha256":"7c946d4923b94c20809b380d613f179113d1f481edf142f09a9d5f8771eaeafd","start":102}],"target_id":"concept.wikipedia.chain-conveyor","target_kind":"node","target_sha256":"64508c60ba8e9d9a1ea160899e528df03a2f6492f7ca931e50847a06b897fc71"}],"concept.wikipedia.chain-drive":[{"id":"assertion.concept.wikipedia.chain-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain drive\", CC BY-SA 4.0) states: A chain drive is a way of transmitting mechanical power from one place to another.","support":[{"end":180,"quote":"A chain drive is a way of transmitting mechanical power from one place to another.","source_id":"wikipedia.article.chain-drive","source_sha256":"bb59794860e665a9b385f695f63ebbb9db0559cec0f449c54530671c0f87ec61","start":98}],"target_id":"concept.wikipedia.chain-drive","target_kind":"node","target_sha256":"67734377f514dc854fae84ac10e9a780386def25bc4b3474103cf97d7d4249ac"}],"concept.wikipedia.change-management-engineering":[{"id":"assertion.concept.wikipedia.change-management-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Change management (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Change management (engineering)\", CC BY-SA 4.0) states: The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","support":[{"end":298,"quote":"The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","source_id":"wikipedia.article.change-management-engineering","source_sha256":"e85374f6ead1d44407f5a0cf1779aa9402772f897057cc20c618de0c2888af90","start":118}],"target_id":"concept.wikipedia.change-management-engineering","target_kind":"node","target_sha256":"22b34fd317f9492151a5e99f9850ff2cd028cfb8eeafa26677804585f8278c84"}],"concept.wikipedia.change-request":[{"id":"assertion.concept.wikipedia.change-request","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Change request as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Change request\", CC BY-SA 4.0) states: A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","support":[{"end":288,"quote":"A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","source_id":"wikipedia.article.change-request","source_sha256":"6b66df5d69b44e4eb0ea2b52a78b7bcec2ebbf1cfb18dcf7465cfcb8045ebb43","start":101}],"target_id":"concept.wikipedia.change-request","target_kind":"node","target_sha256":"05371ac72dd0cbc6f4101e80098b20f3e35478725adb24caae642d5f1f8e122a"}],"concept.wikipedia.charlesworth-s-paradox":[{"id":"assertion.concept.wikipedia.charlesworth-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Charlesworth's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Charlesworth's paradox\", CC BY-SA 4.0) states: Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","support":[{"end":218,"quote":"Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","source_id":"wikipedia.article.charlesworth-s-paradox","source_sha256":"369764d4ac63eaa4f55d11677709461b62e6bfa19c023277153fa018d5b7137d","start":110}],"target_id":"concept.wikipedia.charlesworth-s-paradox","target_kind":"node","target_sha256":"40b0308f1adf4cb1a2b1ec806a595a7cc978b72bd3722b397728790f35d7ac3d"}],"concept.wikipedia.charts-on-so-3":[{"id":"assertion.concept.wikipedia.charts-on-so-3","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Charts on SO(3) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Charts on SO(3)\", CC BY-SA 4.0) states: In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","support":[{"end":259,"quote":"In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","source_id":"wikipedia.article.charts-on-so-3","source_sha256":"50304f33e9274ceae69130dffaef7de1c915fc2a554811107330bcbbe3bf9d79","start":101}],"target_id":"concept.wikipedia.charts-on-so-3","target_kind":"node","target_sha256":"1f24c0a8ddb070c9036178d38d9fe6c515824cd2f6f507a047c028d8a1d406d6"}],"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion":[{"id":"assertion.concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chebychev–Grübler–Kutzbach criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chebychev–Grübler–Kutzbach criterion\", CC BY-SA 4.0) states: The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","support":[{"end":302,"quote":"The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","source_id":"wikipedia.article.chebychev-gr-bler-kutzbach-criterion","source_sha256":"27b84df9c052b60ee23a0632d36eea21c17f2c3d5cec06931f9800a55c2b812c","start":124}],"target_id":"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","target_kind":"node","target_sha256":"21d55008593a3593f2e77b8936c78b91a4b79d510da61bafd5888e1f0ba8e061"}],"concept.wikipedia.check-valve":[{"id":"assertion.concept.wikipedia.check-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Check valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Check valve\", CC BY-SA 4.0) states: A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","support":[{"end":285,"quote":"A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","source_id":"wikipedia.article.check-valve","source_sha256":"1a7dc92dc72cf671a62b4e87bffbf3c0a9848b9d77c2b3adb7d2ca598f77718b","start":97}],"target_id":"concept.wikipedia.check-valve","target_kind":"node","target_sha256":"0caa0e8077d6c71f0932daa7f92718f73b6b52a8bd3d7be29133979c19d762a2"}],"concept.wikipedia.chemical-field-effect-transistor":[{"id":"assertion.concept.wikipedia.chemical-field-effect-transistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemical field-effect transistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemical field-effect transistor\", CC BY-SA 4.0) states: A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","support":[{"end":281,"quote":"A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","source_id":"wikipedia.article.chemical-field-effect-transistor","source_sha256":"86b7403692df90b2c1c8249d79c083cf08b70588892d2698113a6ec89d1b7e1a","start":119}],"target_id":"concept.wikipedia.chemical-field-effect-transistor","target_kind":"node","target_sha256":"5b3e82843d8c09bc66ecc6c97ed8bf781e48abf1cbc457bd45625357f5dad9b5"}],"concept.wikipedia.chemical-reaction-engineering":[{"id":"assertion.concept.wikipedia.chemical-reaction-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemical reaction engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemical reaction engineering\", CC BY-SA 4.0) states: Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","support":[{"end":287,"quote":"Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","source_id":"wikipedia.article.chemical-reaction-engineering","source_sha256":"b29823347cf5868c7e0a84d218d0c5c2686995763e7a76877d7ba0407d708cc8","start":117}],"target_id":"concept.wikipedia.chemical-reaction-engineering","target_kind":"node","target_sha256":"1e16a07b0840977731dddd4a0bee7ade32cead3044ec8d4bd3886fb2658a2ad9"}],"concept.wikipedia.chemiresistor":[{"id":"assertion.concept.wikipedia.chemiresistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemiresistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemiresistor\", CC BY-SA 4.0) states: A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","support":[{"end":228,"quote":"A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","source_id":"wikipedia.article.chemiresistor","source_sha256":"93e4f962c8d91107f4959ff4a5abfdd1e522ebdc221d8ee6bb3252aa806ce63c","start":101}],"target_id":"concept.wikipedia.chemiresistor","target_kind":"node","target_sha256":"44c529ea0f05906a92c4593783a2fbc9d1ce189ca7e535d41a9b08b44739ee18"}],"concept.wikipedia.cheng-cycle":[{"id":"assertion.concept.wikipedia.cheng-cycle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cheng cycle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cheng cycle\", CC BY-SA 4.0) states: The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","support":[{"end":210,"quote":"The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","source_id":"wikipedia.article.cheng-cycle","source_sha256":"2434ca9265ed5901dde678a2858b3560acdc1a8f15bf209c5550c9344383cd33","start":99}],"target_id":"concept.wikipedia.cheng-cycle","target_kind":"node","target_sha256":"a202d3311b422472adfdaa7d15a9dfc566cd8889ddce1431a4cee17c23617c5d"}],"concept.wikipedia.cheng-zhu-school":[{"id":"assertion.concept.wikipedia.cheng-zhu-school","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cheng–Zhu school as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cheng–Zhu school\", CC BY-SA 4.0) states: The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","support":[{"end":408,"quote":"The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","source_id":"wikipedia.article.cheng-zhu-school","source_sha256":"b156efc57d3ee71b94e786717390896de9601954a3f9613eb4482e42456ec363","start":104}],"target_id":"concept.wikipedia.cheng-zhu-school","target_kind":"node","target_sha256":"e5cbd1f298b6956e155e131d9ddcb81a3399bf3f39478582834282fbcd53c4e8"}],"concept.wikipedia.chern-simons-theory":[{"id":"assertion.concept.wikipedia.chern-simons-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"∞-Chern–Simons theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"∞-Chern–Simons theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","support":[{"end":381,"quote":"In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","source_id":"wikipedia.article.chern-simons-theory","source_sha256":"ded8bf2a9ed4d0b05a908b8509e0abd7acc271891485d312dee9c017e6123ca3","start":109}],"target_id":"concept.wikipedia.chern-simons-theory","target_kind":"node","target_sha256":"925032e1401f7b048da1ee8801c50e4e206a2a45772fe1c8701083003862deb2"}],"concept.wikipedia.chern-weil-theory":[{"id":"assertion.concept.wikipedia.chern-weil-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"∞-Chern–Weil theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"∞-Chern–Weil theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","support":[{"end":266,"quote":"In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","source_id":"wikipedia.article.chern-weil-theory","source_sha256":"4b3ba1067c252140d50318c8725e201eb105af9441ac3b576200a8c60ad42442","start":107}],"target_id":"concept.wikipedia.chern-weil-theory","target_kind":"node","target_sha256":"ae35ea7bb6704c312f3341744453cfb49fe83c869e1ff8582010a1a97426c92b"}],"concept.wikipedia.chicken-or-the-egg":[{"id":"assertion.concept.wikipedia.chicken-or-the-egg","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chicken or the egg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chicken or the egg\", CC BY-SA 4.0) states: The chicken or the egg causality dilemma is commonly stated as the question, \"which came first: the chicken or the egg?\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \"Chicken-and-egg\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","support":[{"end":674,"quote":"The chicken or the egg causality dilemma is commonly stated as the question, \\\"which came first: the chicken or the egg?\\\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \\\"Chicken-and-egg\\\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","source_id":"wikipedia.article.chicken-or-the-egg","source_sha256":"a9b60e86b3089057f35d4d722de1e276bd4241ade199cd332788ddfd6c8d447e","start":103}],"target_id":"concept.wikipedia.chicken-or-the-egg","target_kind":"node","target_sha256":"6b836de96e7dfee9bc882310aa624e171f570293f61d58259eab0f83de6db50d"}],"concept.wikipedia.chinese-room":[{"id":"assertion.concept.wikipedia.chinese-room","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chinese room as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chinese room\", CC BY-SA 4.0) states: The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","support":[{"end":304,"quote":"The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","source_id":"wikipedia.article.chinese-room","source_sha256":"0b901b384e735ea38bbe8ace107ab546897543562952bde152fea83a4d8224e3","start":96}],"target_id":"concept.wikipedia.chinese-room","target_kind":"node","target_sha256":"3fa4787c773e8d9f8164788fedc1b4f060f174e80dc9dd4621aa3734558b8916"}],"concept.wikipedia.chiplet":[{"id":"assertion.concept.wikipedia.chiplet","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chiplet as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chiplet\", CC BY-SA 4.0) states: A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","support":[{"end":192,"quote":"A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","source_id":"wikipedia.article.chiplet","source_sha256":"ff21ad2d82bee803a58ea3a4ff0576a5b483a6efda36ee14858f313cdbe2bb5e","start":95}],"target_id":"concept.wikipedia.chiplet","target_kind":"node","target_sha256":"ad1eb48f97ce997b5174a6af97cd4aa09f03cf9706f8eb8b70506e74ce6da312"}],"concept.wikipedia.chirp-z-transform":[{"id":"assertion.concept.wikipedia.chirp-z-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chirp Z-transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chirp Z-transform\", CC BY-SA 4.0) states: The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","support":[{"end":191,"quote":"The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","source_id":"wikipedia.article.chirp-z-transform","source_sha256":"922290d84f0283f2f5d54f58b02ab45b46c091bbf2e71a53a257899e27f6587b","start":103}],"target_id":"concept.wikipedia.chirp-z-transform","target_kind":"node","target_sha256":"c169b18e359e990299afd35e8a52f2dddb7994bb2e4934defa4187cb4309039f"}],"concept.wikipedia.chirplet-transform":[{"id":"assertion.concept.wikipedia.chirplet-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chirplet transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chirplet transform\", CC BY-SA 4.0) states: In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","support":[{"end":243,"quote":"In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","source_id":"wikipedia.article.chirplet-transform","source_sha256":"fcda238fb91673db4714411d8b101757735255b2e05594c53aa52ad81f697aa4","start":105}],"target_id":"concept.wikipedia.chirplet-transform","target_kind":"node","target_sha256":"32fa01fe10d1ad83dedab9aef7cd5256cd0859a815c230f5fa3c82d753d4b44a"}],"concept.wikipedia.chowla-selberg-formula":[{"id":"assertion.concept.wikipedia.chowla-selberg-formula","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chowla–Selberg formula as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chowla–Selberg formula\", CC BY-SA 4.0) states: In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","support":[{"end":331,"quote":"In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","source_id":"wikipedia.article.chowla-selberg-formula","source_sha256":"49f7d3c743372c9de7da7b5c1394c62ea89b676827aad994957c2a109c26ec2b","start":108}],"target_id":"concept.wikipedia.chowla-selberg-formula","target_kind":"node","target_sha256":"82cdd4153ea5d7bb2fa9edea1ec679cc451a626e985066c510d44dd1b2cd1458"}],"concept.wikipedia.chronotope":[{"id":"assertion.concept.wikipedia.chronotope","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chronotope as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chronotope\", CC BY-SA 4.0) states: In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","support":[{"end":241,"quote":"In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","source_id":"wikipedia.article.chronotope","source_sha256":"f3d0d852eac82065ad300511606506a97254b4973e5d6e2d917d09e06930880b","start":97}],"target_id":"concept.wikipedia.chronotope","target_kind":"node","target_sha256":"74ad440e20c41ac9e47a7e66de6955432570f351e629d64b356da35e4e5cc4d5"}],"concept.wikipedia.church-turing-thesis":[{"id":"assertion.concept.wikipedia.church-turing-thesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Church–Turing thesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Church–Turing thesis\", CC BY-SA 4.0) states: In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","support":[{"end":207,"quote":"In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","source_id":"wikipedia.article.church-turing-thesis","source_sha256":"7e49b2f983e78728733742f03b9b7616ab118b80662c8a762f3ace379b6cfadc","start":104}],"target_id":"concept.wikipedia.church-turing-thesis","target_kind":"node","target_sha256":"076f9b219736e2398050b1a668e130d108769a33f1f87edf7d77bc95587583cb"}],"concept.wikipedia.chv-tal-sankoff-constants":[{"id":"assertion.concept.wikipedia.chv-tal-sankoff-constants","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chvátal–Sankoff constants as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chvátal–Sankoff constants\", CC BY-SA 4.0) states: In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","support":[{"end":261,"quote":"In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","source_id":"wikipedia.article.chv-tal-sankoff-constants","source_sha256":"df489560da7927e6dd0227a1f02125dae27b615d24d625fbb1b9214a8ec85c24","start":113}],"target_id":"concept.wikipedia.chv-tal-sankoff-constants","target_kind":"node","target_sha256":"14f4781552c6a63ae239ed5a442bde9643d70308cf1bbd7f88187a544be2edc5"}],"concept.wikipedia.circuit-extraction":[{"id":"assertion.concept.wikipedia.circuit-extraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit extraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit extraction\", CC BY-SA 4.0) states: The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","support":[{"end":314,"quote":"The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","source_id":"wikipedia.article.circuit-extraction","source_sha256":"ee20e836c0024d969216e8d0dbadd3f2cc66cfc9bbc3e561ce4a5e9249eaefd3","start":105}],"target_id":"concept.wikipedia.circuit-extraction","target_kind":"node","target_sha256":"1008b5daa50729a7ce0e6046111c189f25e1f142af8324c82fc6f0b21882354a"}],"concept.wikipedia.circuit-topology-electrical":[{"id":"assertion.concept.wikipedia.circuit-topology-electrical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit topology (electrical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit topology (electrical)\", CC BY-SA 4.0) states: The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","support":[{"end":242,"quote":"The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","source_id":"wikipedia.article.circuit-topology-electrical","source_sha256":"9dac29b3e96f4f15c1e9f2853e8c793a36cbc3b81b83f0774b78dd170582c0f2","start":117}],"target_id":"concept.wikipedia.circuit-topology-electrical","target_kind":"node","target_sha256":"379f049a0b1a0c17f5d65c7a08dd5e7f045d68e2d20afeb682600c4e451f84d8"}],"concept.wikipedia.circuit-total-limitation":[{"id":"assertion.concept.wikipedia.circuit-total-limitation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit total limitation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit total limitation\", CC BY-SA 4.0) states: Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","support":[{"end":254,"quote":"Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","source_id":"wikipedia.article.circuit-total-limitation","source_sha256":"6a17504b78adeeb63f6d822079003c2cb7aa4974d9876f443d519bed378d9c9c","start":112}],"target_id":"concept.wikipedia.circuit-total-limitation","target_kind":"node","target_sha256":"5f609d3457eb6f38a6eeb1600c922c341f9791d4f8348a5dc848b3e328ee3a62"}],"concept.wikipedia.circular-definition":[{"id":"assertion.concept.wikipedia.circular-definition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circular definition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circular definition\", CC BY-SA 4.0) states: A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","support":[{"end":275,"quote":"A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","source_id":"wikipedia.article.circular-definition","source_sha256":"124d9f4114184e4279f82cf44105815897a217d48ca8e7992fc94af8c2efd161","start":104}],"target_id":"concept.wikipedia.circular-definition","target_kind":"node","target_sha256":"38999584670ae5e4817057b95947ec0c839563da531017f3294491d4ef515a09"}],"concept.wikipedia.circular-reasoning":[{"id":"assertion.concept.wikipedia.circular-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circular reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circular reasoning\", CC BY-SA 4.0) states: Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","support":[{"end":289,"quote":"Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","source_id":"wikipedia.article.circular-reasoning","source_sha256":"593b9564704ddf3a8d10f886e4a5e1a90b1d7c16b84a9026f3f2d5b3697a16be","start":104}],"target_id":"concept.wikipedia.circular-reasoning","target_kind":"node","target_sha256":"ac242bd0bc11cd475f279caa2c85a032dc9d813d456a1e2046dc97cdb2de1765"}],"concept.wikipedia.circumstantial-evidence":[{"id":"assertion.concept.wikipedia.circumstantial-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circumstantial evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circumstantial evidence\", CC BY-SA 4.0) states: Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","support":[{"end":258,"quote":"Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","source_id":"wikipedia.article.circumstantial-evidence","source_sha256":"cd674333cb1694993ee0591db77e471e943ca5a53a16e7d9dd897c190ac65daf","start":109}],"target_id":"concept.wikipedia.circumstantial-evidence","target_kind":"node","target_sha256":"62502297973335772f47cbfdf9af323818d2741f55103b6f4c191c4275a40fb7"}],"concept.wikipedia.class-set-theory":[{"id":"assertion.concept.wikipedia.class-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Class (set theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Class (set theory)\", CC BY-SA 4.0) states: In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","support":[{"end":298,"quote":"In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","source_id":"wikipedia.article.class-set-theory","source_sha256":"2e9b3d2a3ebf6da8208ab8868c9fc64611462f304e2871e1f6a5871df3a3482a","start":103}],"target_id":"concept.wikipedia.class-set-theory","target_kind":"node","target_sha256":"e924c9aa36acd1ca9208bc713fa2734acf14bbd748cd670bd2444df51e415da7"}],"concept.wikipedia.classical-group":[{"id":"assertion.concept.wikipedia.classical-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Classical group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Classical group\", CC BY-SA 4.0) states: In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","support":[{"end":286,"quote":"In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","source_id":"wikipedia.article.classical-group","source_sha256":"512c90135fb983627b639d48a3384ca0e6e4fc01add0dc2c9e34a296f79e0974","start":103}],"target_id":"concept.wikipedia.classical-group","target_kind":"node","target_sha256":"bbf382746d5beb5fed005708263bb4c0cebe3e63459d6fedf9ce0858e7d0f995"}],"concept.wikipedia.clinamen":[{"id":"assertion.concept.wikipedia.clinamen","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clinamen as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clinamen\", CC BY-SA 4.0) states: Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","support":[{"end":234,"quote":"Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","source_id":"wikipedia.article.clinamen","source_sha256":"d60911b5cb9025dab70fd1c49ca691ef555750c016337260c9a918bcc243cfd4","start":95}],"target_id":"concept.wikipedia.clinamen","target_kind":"node","target_sha256":"6855af01d86449e5abcbae49af5d487e6c59f6df98e4233223a5739a125a661f"}],"concept.wikipedia.clinical-study-design":[{"id":"assertion.concept.wikipedia.clinical-study-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clinical study design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clinical study design\", CC BY-SA 4.0) states: Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including epidemiology .","support":[{"end":325,"quote":"Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including  epidemiology .","source_id":"wikipedia.article.clinical-study-design","source_sha256":"469e50b6b7293b2265ac1db284a2eee1b6ea99a2d91a239a7afe547c67ffef35","start":108}],"target_id":"concept.wikipedia.clinical-study-design","target_kind":"node","target_sha256":"1fab7151a4906342a88ad25c613cbb27f481afd243dafe06ce300b7a18d4c2a9"}],"concept.wikipedia.closed-circle":[{"id":"assertion.concept.wikipedia.closed-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closed circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closed circle\", CC BY-SA 4.0) states: A closed-circle argument is one that is unfalsifiable.","support":[{"end":154,"quote":"A closed-circle argument is one that is unfalsifiable.","source_id":"wikipedia.article.closed-circle","source_sha256":"4e6c411f68e678677c9c64c25b5d36e960a9747be2f9b09af0e9a199819cdef6","start":100}],"target_id":"concept.wikipedia.closed-circle","target_kind":"node","target_sha256":"2dd0c894d1178c78a20ac31ac1d3f00f9d8c4abfc0d0700f3a046a3872301aad"}],"concept.wikipedia.closed-concept":[{"id":"assertion.concept.wikipedia.closed-concept","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closed concept as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closed concept\", CC BY-SA 4.0) states: A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","support":[{"end":244,"quote":"A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","source_id":"wikipedia.article.closed-concept","source_sha256":"3d9c0ee415c3b384f7985197ffd140aea2405022f073e69d66ca945b06d05a2e","start":101}],"target_id":"concept.wikipedia.closed-concept","target_kind":"node","target_sha256":"0c6d97b1f88f282415268d708e2369c970f09bb4db7c83a452f4666645b3164d"}],"concept.wikipedia.closure-mathematics":[{"id":"assertion.concept.wikipedia.closure-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closure (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closure (mathematics)\", CC BY-SA 4.0) states: In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","support":[{"end":294,"quote":"In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","source_id":"wikipedia.article.closure-mathematics","source_sha256":"fad5e051b80cfebe5962a0cef91c6ef764ea3691406144b1e6dfd0409f441fa1","start":107}],"target_id":"concept.wikipedia.closure-mathematics","target_kind":"node","target_sha256":"f940c5cde3786d451b573ec2b664fa80b08fab9d83f38a44c34fb1bf894cf165"}],"concept.wikipedia.cluster-algebra":[{"id":"assertion.concept.wikipedia.cluster-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cluster algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cluster algebra\", CC BY-SA 4.0) states: Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007).","support":[{"end":208,"quote":"Cluster algebras are a class of commutative rings introduced by Fomin and  Zelevinsky (2002, 2003, 2007).","source_id":"wikipedia.article.cluster-algebra","source_sha256":"c65c4441e3d225f175593744698667504a5571b9f7d5ed3986614b116e477813","start":103}],"target_id":"concept.wikipedia.cluster-algebra","target_kind":"node","target_sha256":"ae072a9ceed02a485135c387f5defcbc24614c7f2e9fc41361c3a31f0deb44eb"}],"concept.wikipedia.cluster-aware-application":[{"id":"assertion.concept.wikipedia.cluster-aware-application","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cluster-aware application as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cluster-aware application\", CC BY-SA 4.0) states: A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","support":[{"end":473,"quote":"A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","source_id":"wikipedia.article.cluster-aware-application","source_sha256":"30026c59f25d6c40ad0248bec16ce2ffb62d87805c9a96b80848e5fe20c0957c","start":113}],"target_id":"concept.wikipedia.cluster-aware-application","target_kind":"node","target_sha256":"9fdfc7cf60ffa007f8d4bc19eacafd00966ae8bd8668e8ac1309083efa9a6971"}],"concept.wikipedia.clutch-delay-valve":[{"id":"assertion.concept.wikipedia.clutch-delay-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clutch delay valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clutch delay valve\", CC BY-SA 4.0) states: A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","support":[{"end":233,"quote":"A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","source_id":"wikipedia.article.clutch-delay-valve","source_sha256":"1e3a3fb77dca6789c9c45809525c54010826d9c680d4cd4e419e6738b5847f1f","start":106}],"target_id":"concept.wikipedia.clutch-delay-valve","target_kind":"node","target_sha256":"3ca343d712b66bd42a99b16c662348498c2468fdb4ef6d0a8beff9fbd97b62a1"}],"concept.wikipedia.code-talker-paradox":[{"id":"assertion.concept.wikipedia.code-talker-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Code-talker paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Code-talker paradox\", CC BY-SA 4.0) states: A code-talker paradox is a situation in which a language prevents communication.","support":[{"end":187,"quote":"A code-talker paradox  is a situation in which a language prevents communication.","source_id":"wikipedia.article.code-talker-paradox","source_sha256":"0e41ce9daa899a3ebae1c5299dd2bd902c6c2ab385cf02862cfd04a1d4d4edd8","start":106}],"target_id":"concept.wikipedia.code-talker-paradox","target_kind":"node","target_sha256":"ba3d77aa1e53b0e09548a4a1b52432ae5bb28f96ab65273ec2aca86cc12d9b8f"}],"concept.wikipedia.cogging-torque":[{"id":"assertion.concept.wikipedia.cogging-torque","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cogging torque as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cogging torque\", CC BY-SA 4.0) states: In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","support":[{"end":293,"quote":"In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","source_id":"wikipedia.article.cogging-torque","source_sha256":"d96a973e4fe2c5c67248822086bedc19fd8c394091b2cf03418df64856485731","start":101}],"target_id":"concept.wikipedia.cogging-torque","target_kind":"node","target_sha256":"2ee66d99a2d0cdd78ab6cda1faefffc132944642f165daada2d2dd2f22ea52b8"}],"concept.wikipedia.cognitive-bias":[{"id":"assertion.concept.wikipedia.cognitive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive bias\", CC BY-SA 4.0) states: A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","support":[{"end":194,"quote":"A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","source_id":"wikipedia.article.cognitive-bias","source_sha256":"e9c54218c1e04bdf03db7f2e538281e4ab88fda19f930896293718b7ce7892b7","start":99}],"target_id":"concept.wikipedia.cognitive-bias","target_kind":"node","target_sha256":"fedef8c0648429d7eaac52b7c40af95910e43068707b70a3b14cde74b29537dc"}],"concept.wikipedia.cognitive-dissonance":[{"id":"assertion.concept.wikipedia.cognitive-dissonance","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive dissonance as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive dissonance\", CC BY-SA 4.0) states: In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","support":[{"end":279,"quote":"In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","source_id":"wikipedia.article.cognitive-dissonance","source_sha256":"8c67bea1fe823d93215c02cf24af0d446830df92a7aaddfcb9592010d2def5f2","start":106}],"target_id":"concept.wikipedia.cognitive-dissonance","target_kind":"node","target_sha256":"32e8c53a3172b2f92be41251c516a03539631e282c74c8bd975529fbf68a0304"}],"concept.wikipedia.cognitive-inertia":[{"id":"assertion.concept.wikipedia.cognitive-inertia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive inertia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive inertia\", CC BY-SA 4.0) states: Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","support":[{"end":253,"quote":"Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","source_id":"wikipedia.article.cognitive-inertia","source_sha256":"348db5eae5f89761b052e13242cf0b13943470cabd9bce4a568e391037f1aa01","start":105}],"target_id":"concept.wikipedia.cognitive-inertia","target_kind":"node","target_sha256":"0943e1c5ec533453fbdebd1f0755028b8394af61b6952265805b8f0892aac641"}],"concept.wikipedia.cognitive-justice":[{"id":"assertion.concept.wikipedia.cognitive-justice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive justice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive justice\", CC BY-SA 4.0) states: The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","support":[{"end":268,"quote":"The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","source_id":"wikipedia.article.cognitive-justice","source_sha256":"ac1cc3471d0b23f3651674309660f73850803efd5bcac9d174a94347972bd50b","start":105}],"target_id":"concept.wikipedia.cognitive-justice","target_kind":"node","target_sha256":"0b623a28ad5e6ffe7f38d8be86235464a9ad87c60d107deacdc98757b8d0426c"}],"concept.wikipedia.cognitive-synonymy":[{"id":"assertion.concept.wikipedia.cognitive-synonymy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive synonymy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive synonymy\", CC BY-SA 4.0) states: Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","support":[{"end":356,"quote":"Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","source_id":"wikipedia.article.cognitive-synonymy","source_sha256":"954f9c661a11e39b69885d6c0988a84fe7e674a174ad9c97008cba9f6cc00f4e","start":106}],"target_id":"concept.wikipedia.cognitive-synonymy","target_kind":"node","target_sha256":"a8baf3f1f6bad19c8df03e92633059b46dc537ad01aae32cf93e9c6837ac0583"}],"concept.wikipedia.coherence-theory-of-truth":[{"id":"assertion.concept.wikipedia.coherence-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherence theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherence theory of truth\", CC BY-SA 4.0) states: In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","support":[{"end":378,"quote":"In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","source_id":"wikipedia.article.coherence-theory-of-truth","source_sha256":"f76e5b76e758866ed3cdadca27e4d6dbd7ee76bdc19869176572b2959d4e1196","start":112}],"target_id":"concept.wikipedia.coherence-theory-of-truth","target_kind":"node","target_sha256":"55ef365566a7e6604f4ede6b3a7d2c6024ee4317c3821e36d9b9e788c91dd9b5"}],"concept.wikipedia.coherent-extrapolated-volition":[{"id":"assertion.concept.wikipedia.coherent-extrapolated-volition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherent extrapolated volition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherent extrapolated volition\", CC BY-SA 4.0) states: Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","support":[{"end":526,"quote":"Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","source_id":"wikipedia.article.coherent-extrapolated-volition","source_sha256":"e6e9a89ce7fbe5253f7fb2feb0bd5fea5d81677cdb40d2d68f0b2fed74dda734","start":118}],"target_id":"concept.wikipedia.coherent-extrapolated-volition","target_kind":"node","target_sha256":"69bbb7b1a411ae04c3465b0d9bf479ced7f6b546a18961e23484dc1062632286"}],"concept.wikipedia.coherentism":[{"id":"assertion.concept.wikipedia.coherentism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherentism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherentism\", CC BY-SA 4.0) states: In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","support":[{"end":261,"quote":"In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","source_id":"wikipedia.article.coherentism","source_sha256":"35607264669b023d485f17a29a539bc20d9a3037fce55461ccef925e0037ab62","start":97}],"target_id":"concept.wikipedia.coherentism","target_kind":"node","target_sha256":"1bdfb435df8e507b9963f391fa9e27d7fe2d731163c17cbc4da0ee6d3a33cf8e"}],"concept.wikipedia.coilgun":[{"id":"assertion.concept.wikipedia.coilgun","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coilgun as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coilgun\", CC BY-SA 4.0) states: A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","support":[{"end":296,"quote":"A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","source_id":"wikipedia.article.coilgun","source_sha256":"ad4936854c339fd08501b108770d5f014342fb71bd97332c29f9eca57b2a3530","start":93}],"target_id":"concept.wikipedia.coilgun","target_kind":"node","target_sha256":"a17efbea19218de705a2691b4d2bfad2d60e4c5bfa02c4ccc4f1e750af77ef50"}],"concept.wikipedia.coincidence":[{"id":"assertion.concept.wikipedia.coincidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coincidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coincidence\", CC BY-SA 4.0) states: A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","support":[{"end":224,"quote":"A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","source_id":"wikipedia.article.coincidence","source_sha256":"c99834b1bb56a288b42f2667eae2525460ba95992779d798151f7fb8a4815672","start":98}],"target_id":"concept.wikipedia.coincidence","target_kind":"node","target_sha256":"e6ca12e34d4d94c2ca80b41b4fc2dab3ffd19afa9d4800d997c90fc669f2e2d8"}],"concept.wikipedia.cold-metal-transfer":[{"id":"assertion.concept.wikipedia.cold-metal-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cold metal transfer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cold metal transfer\", CC BY-SA 4.0) states: Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","support":[{"end":198,"quote":"Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","source_id":"wikipedia.article.cold-metal-transfer","source_sha256":"fd86885e2a5f207d99c349eef1809e1abde2fd6b4de3e54ad3a12baf6aa5f167","start":107}],"target_id":"concept.wikipedia.cold-metal-transfer","target_kind":"node","target_sha256":"790fa514f1034ef7aea3dd9898edede3fad7b0874916b327bf0c4a634baa3b7d"}],"concept.wikipedia.cold-welding":[{"id":"assertion.concept.wikipedia.cold-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cold welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cold welding\", CC BY-SA 4.0) states: Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","support":[{"end":265,"quote":"Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","source_id":"wikipedia.article.cold-welding","source_sha256":"1a6d7992e9475f3dff931e059e3a4f5e9a478aeed7dd97e343976341dbfab908","start":98}],"target_id":"concept.wikipedia.cold-welding","target_kind":"node","target_sha256":"ffa5dbf78eafde7fc25c8a2870c3aa6a9247af9cfe942a6d9ce5c9f150dbe36d"}],"concept.wikipedia.collectively-exhaustive-events":[{"id":"assertion.concept.wikipedia.collectively-exhaustive-events","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Collectively exhaustive events as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Collectively exhaustive events\", CC BY-SA 4.0) states: In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","support":[{"end":245,"quote":"In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","source_id":"wikipedia.article.collectively-exhaustive-events","source_sha256":"2c06c0854aeb61f4c178076e55de936bc489772eb4f2310e9b4dd2c7cdeb34d1","start":117}],"target_id":"concept.wikipedia.collectively-exhaustive-events","target_kind":"node","target_sha256":"655fc4c6f5f09a89c414b41993a5fb6b206ed5602b7cd1599221eb6af986e5b8"}],"concept.wikipedia.colloid-thruster":[{"id":"assertion.concept.wikipedia.colloid-thruster","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Colloid thruster as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Colloid thruster\", CC BY-SA 4.0) states: A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","support":[{"end":286,"quote":"A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","source_id":"wikipedia.article.colloid-thruster","source_sha256":"3f3c5066d96ee788177202c79e792dfdb6dc24888ab6b3e2a0ea2429eb1becbb","start":103}],"target_id":"concept.wikipedia.colloid-thruster","target_kind":"node","target_sha256":"b6cd59ed87ff50492d8afda9eff69d9ec86c28d584cd958c9a46eae930842908"}],"concept.wikipedia.colonnette":[{"id":"assertion.concept.wikipedia.colonnette","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Colonnette as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Colonnette\", CC BY-SA 4.0) states: A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","support":[{"end":200,"quote":"A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","source_id":"wikipedia.article.colonnette","source_sha256":"ac17ca5fa1f0b5d6face1e7f1f860556e44434392d9ff709e4d194f940684d96","start":98}],"target_id":"concept.wikipedia.colonnette","target_kind":"node","target_sha256":"229325b2b7b1aec3a6e66f7b2e59eed9503e6e6181d6fccf61215d9d083aa68f"}],"concept.wikipedia.color-wheel-optics":[{"id":"assertion.concept.wikipedia.color-wheel-optics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Color wheel (optics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Color wheel (optics)\", CC BY-SA 4.0) states: A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","support":[{"end":279,"quote":"A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","source_id":"wikipedia.article.color-wheel-optics","source_sha256":"9dce9d7fa53af131cf6dff65b4c0416bb00d89de26b2107407b571a174374ca0","start":108}],"target_id":"concept.wikipedia.color-wheel-optics","target_kind":"node","target_sha256":"a5e881cc6421330e171c55f117ca61d127ab6179fa1728dfbe8deb8f202627ec"}],"concept.wikipedia.column":[{"id":"assertion.concept.wikipedia.column","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Column as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Column\", CC BY-SA 4.0) states: A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","support":[{"end":279,"quote":"A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","source_id":"wikipedia.article.column","source_sha256":"60e18dd12103b732dbec6f3b6d960ba354f161af4559b35365ac95d76cba06fe","start":90}],"target_id":"concept.wikipedia.column","target_kind":"node","target_sha256":"d21726e99a5e862ec0866204b90ef631de723e8dc700bfaadfa9cbadaa6dd1d4"}],"concept.wikipedia.comb-drive":[{"id":"assertion.concept.wikipedia.comb-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Comb drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Comb drive\", CC BY-SA 4.0) states: Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","support":[{"end":265,"quote":"Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","source_id":"wikipedia.article.comb-drive","source_sha256":"4151cf95b72d7e97f4b9e1d0d4b2c969f6fce4356774a4a20af911543f457e91","start":97}],"target_id":"concept.wikipedia.comb-drive","target_kind":"node","target_sha256":"4f2b504dd2e211c5784ae6051c42ae2a7631a35319b5cc6fb9800da6f4f06b2e"}],"concept.wikipedia.combinatorial-principles":[{"id":"assertion.concept.wikipedia.combinatorial-principles","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Combinatorial principles as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Combinatorial principles\", CC BY-SA 4.0) states: In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","support":[{"end":243,"quote":"In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","source_id":"wikipedia.article.combinatorial-principles","source_sha256":"be735fcba375516cd441d6e80188f5d350c7e3461fd8981ed6f11e97ec03dd38","start":111}],"target_id":"concept.wikipedia.combinatorial-principles","target_kind":"node","target_sha256":"34aa89c3c8bdcad1abb957147f5f69cd7c6f9c3af5c19d7977bcb652f82cffec"}],"concept.wikipedia.common-rail-electricity":[{"id":"assertion.concept.wikipedia.common-rail-electricity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Common rail (electricity) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Common rail (electricity)\", CC BY-SA 4.0) states: In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","support":[{"end":251,"quote":"In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","source_id":"wikipedia.article.common-rail-electricity","source_sha256":"521fdfde5873f04edaa98e161e90216f7f5abc4e6b4ff487bb3cc6e75350d572","start":113}],"target_id":"concept.wikipedia.common-rail-electricity","target_kind":"node","target_sha256":"1a75319a6db58982a374d173130fbeef9552070fab9b37fdcdc73cf4b600ca07"}],"concept.wikipedia.commonsense-reasoning":[{"id":"assertion.concept.wikipedia.commonsense-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commonsense reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commonsense reasoning\", CC BY-SA 4.0) states: In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","support":[{"end":284,"quote":"In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","source_id":"wikipedia.article.commonsense-reasoning","source_sha256":"79dfaaf8a17afada47df8fd1516b74868745a7f430edc7676a9f6ea3c796586c","start":107}],"target_id":"concept.wikipedia.commonsense-reasoning","target_kind":"node","target_sha256":"b96e796885376db9a97103882e7ac6b56a73984dc98d02f471821648b33ce4ca"}],"concept.wikipedia.communal-reinforcement":[{"id":"assertion.concept.wikipedia.communal-reinforcement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Communal reinforcement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Communal reinforcement\", CC BY-SA 4.0) states: Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","support":[{"end":305,"quote":"Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","source_id":"wikipedia.article.communal-reinforcement","source_sha256":"dd0a6ac02fc1214911a482b316b86b27bec777271ca03b6bd0b76b9d2eed34e1","start":108}],"target_id":"concept.wikipedia.communal-reinforcement","target_kind":"node","target_sha256":"e734cd35643bb4e7c544af15cb303367c3bcffe91fc502bc6961f29b8327d847"}],"concept.wikipedia.communicative-rationality":[{"id":"assertion.concept.wikipedia.communicative-rationality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Communicative rationality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Communicative rationality\", CC BY-SA 4.0) states: Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","support":[{"end":315,"quote":"Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","source_id":"wikipedia.article.communicative-rationality","source_sha256":"7d7d9cf6112c067487d42640818b2e9295ac43bc19698a97671b2ee18574f28a","start":112}],"target_id":"concept.wikipedia.communicative-rationality","target_kind":"node","target_sha256":"d4f2dd4da078c87bb5a6adcd146b51204b2c38115d7177f15fd20f49dcacd63b"}],"concept.wikipedia.commutator-electric":[{"id":"assertion.concept.wikipedia.commutator-electric","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commutator (electric) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commutator (electric)\", CC BY-SA 4.0) states: A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","support":[{"end":304,"quote":"A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","source_id":"wikipedia.article.commutator-electric","source_sha256":"e8a43d11d4c1aca3d6c382d2012e1b130c9460762c9698fcac9334612c992e17","start":107}],"target_id":"concept.wikipedia.commutator-electric","target_kind":"node","target_sha256":"eb134f0ab70663675e9ce08157aa63d05e2c91ed4d45565eb79e83314c50f11f"}],"concept.wikipedia.compact-group":[{"id":"assertion.concept.wikipedia.compact-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compact group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compact group\", CC BY-SA 4.0) states: In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","support":[{"end":226,"quote":"In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","source_id":"wikipedia.article.compact-group","source_sha256":"35d708c463f35cbf9e4e6cef74590f216be95e9be8c0633b407112bb9112d734","start":99}],"target_id":"concept.wikipedia.compact-group","target_kind":"node","target_sha256":"57d6be2607cb1a8bba04698f642538d781b80ebda1ffb0924adeff1d22f5a06c"}],"concept.wikipedia.complemented-lattice":[{"id":"assertion.concept.wikipedia.complemented-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Complemented lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Complemented lattice\", CC BY-SA 4.0) states: In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","support":[{"end":341,"quote":"In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","source_id":"wikipedia.article.complemented-lattice","source_sha256":"81912268c8489d6de5885090a08604035d5d9d0f4f625d545511c781347db689","start":106}],"target_id":"concept.wikipedia.complemented-lattice","target_kind":"node","target_sha256":"f456a20ae46b0d2967a9a6cd70c3062aad169a1f403fc81f21ed8306733d1a29"}],"concept.wikipedia.compliant-mechanism":[{"id":"assertion.concept.wikipedia.compliant-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compliant mechanism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compliant mechanism\", CC BY-SA 4.0) states: In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","support":[{"end":257,"quote":"In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","source_id":"wikipedia.article.compliant-mechanism","source_sha256":"c67367a49866dca2637bd0f848fe8d1e0de38b1648788fd1f2083a04338f3254","start":107}],"target_id":"concept.wikipedia.compliant-mechanism","target_kind":"node","target_sha256":"02d35ebe960a2030fbc2f9f0f6ea9e60775824d52e1484218f7aa2936915c652"}],"concept.wikipedia.composite-bearing":[{"id":"assertion.concept.wikipedia.composite-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Composite bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Composite bearing\", CC BY-SA 4.0) states: A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","support":[{"end":284,"quote":"A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","source_id":"wikipedia.article.composite-bearing","source_sha256":"1fc2b25056d38c10399a589387f12ceab4504f4b7ca534fd49d630e6285b5d82","start":105}],"target_id":"concept.wikipedia.composite-bearing","target_kind":"node","target_sha256":"f495f74ade7a8dc7259ca60231387e5d6eb1f6be16f9e8b524e59b5ce9ff4e69"}],"concept.wikipedia.compossibility":[{"id":"assertion.concept.wikipedia.compossibility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compossibility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compossibility\", CC BY-SA 4.0) states: Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","support":[{"end":174,"quote":"Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","source_id":"wikipedia.article.compossibility","source_sha256":"1a0d0bb886c532c9f49b18951d408b26b318a93dabb2e6e3beae089ed184fe6e","start":101}],"target_id":"concept.wikipedia.compossibility","target_kind":"node","target_sha256":"b1a24f91ec29eda21d40a6a1e50728e62c1ba0f2d6da138465e91cd890f08122"}],"concept.wikipedia.comprehension-logic":[{"id":"assertion.concept.wikipedia.comprehension-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Comprehension (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Comprehension (logic)\", CC BY-SA 4.0) states: In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the context of a given discussion.","support":[{"end":365,"quote":"In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the  context of a given discussion.","source_id":"wikipedia.article.comprehension-logic","source_sha256":"50ed2821556fbf874e694debb50b8d7aada4de9779046d7d7d2ee3a121cae0e3","start":108}],"target_id":"concept.wikipedia.comprehension-logic","target_kind":"node","target_sha256":"1fffd1526cdf9535afcaa8d7107b6d51d5ce0c3eb883d15079867d9f0da45cee"}],"concept.wikipedia.computational-philosophy":[{"id":"assertion.concept.wikipedia.computational-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computational philosophy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computational philosophy\", CC BY-SA 4.0) states: Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","support":[{"end":212,"quote":"Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","source_id":"wikipedia.article.computational-philosophy","source_sha256":"b1e0443588ed2b19d16c7ed91ea2b5ce4fd7ab9b4d2b7f1b219cbf8a13bfd989","start":112}],"target_id":"concept.wikipedia.computational-philosophy","target_kind":"node","target_sha256":"9e983651e06e726061453c227fb7149b77ecfa45a59d8507ff0a92d23a11edc3"}],"concept.wikipedia.computer-aided-engineering":[{"id":"assertion.concept.wikipedia.computer-aided-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer-aided engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer-aided engineering\", CC BY-SA 4.0) states: Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","support":[{"end":228,"quote":"Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","source_id":"wikipedia.article.computer-aided-engineering","source_sha256":"db2519f264f43e5279bfcf554cf552981ac06cfe93bb5b64209143edf8fcdcca","start":112}],"target_id":"concept.wikipedia.computer-aided-engineering","target_kind":"node","target_sha256":"206417743b3a38db9b5f7057bb9789111a1d43e006df1051583ad7fe3571484d"}],"concept.wikipedia.concept-horse-paradox":[{"id":"assertion.concept.wikipedia.concept-horse-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Concept horse paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Concept horse paradox\", CC BY-SA 4.0) states: The concept \"horse\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","support":[{"end":376,"quote":"The concept \\\"horse\\\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","source_id":"wikipedia.article.concept-horse-paradox","source_sha256":"ea5fa1eea630e18d5b5f4518ed5ee5f27de6dbf8952de60e99e9453613468717","start":109}],"target_id":"concept.wikipedia.concept-horse-paradox","target_kind":"node","target_sha256":"fc20abfb90c896a5f730bed6e69c4e4c63eaa88bd8060fb2e2d83688a6394aa2"}],"concept.wikipedia.conciliationism":[{"id":"assertion.concept.wikipedia.conciliationism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conciliationism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conciliationism\", CC BY-SA 4.0) states: Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","support":[{"end":287,"quote":"Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","source_id":"wikipedia.article.conciliationism","source_sha256":"32919f592cf06b4b05ebc138df8a89ab889f90020d98d85a079cb2002957962e","start":103}],"target_id":"concept.wikipedia.conciliationism","target_kind":"node","target_sha256":"14902faf3e866d4430098f14a948b3820fb0f331481355dd744a1864a6fbd537"}],"concept.wikipedia.concurrent-engineering":[{"id":"assertion.concept.wikipedia.concurrent-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Concurrent engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Concurrent engineering\", CC BY-SA 4.0) states: Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","support":[{"end":410,"quote":"Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","source_id":"wikipedia.article.concurrent-engineering","source_sha256":"3a8b92bc56e57dd0b5730445976844726319802e8fffbfb6d513f6624671c09b","start":109}],"target_id":"concept.wikipedia.concurrent-engineering","target_kind":"node","target_sha256":"04870d09e0dcafddd82b7b367747e8e2e1ae27364a217c7fdb5eee478f81dc87"}],"concept.wikipedia.condensed-detachment":[{"id":"assertion.concept.wikipedia.condensed-detachment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Condensed detachment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Condensed detachment\", CC BY-SA 4.0) states: Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","support":[{"end":233,"quote":"Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","source_id":"wikipedia.article.condensed-detachment","source_sha256":"be598a37fa95fe8f1b87d6ed8e52fc919d79ba2e0563db6c043b10e040e09b33","start":107}],"target_id":"concept.wikipedia.condensed-detachment","target_kind":"node","target_sha256":"3a5d2b287090b5885074d279130b7f50fc8c4bd15f2a7b9109c5dafa46fff15d"}],"concept.wikipedia.condenser-heat-transfer":[{"id":"assertion.concept.wikipedia.condenser-heat-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Condenser (heat transfer) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Condenser (heat transfer)\", CC BY-SA 4.0) states: In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","support":[{"end":254,"quote":"In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","source_id":"wikipedia.article.condenser-heat-transfer","source_sha256":"4a0cb9d64021201dcc02426501d556b929972e86ea82f83eba8272c9b8176428","start":113}],"target_id":"concept.wikipedia.condenser-heat-transfer","target_kind":"node","target_sha256":"7bb00b838ff6eccc33c720f447b2f1f963b1431269f1dde539481f3672a08487"}],"concept.wikipedia.conditional-logic":[{"id":"assertion.concept.wikipedia.conditional-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conditional logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conditional logic\", CC BY-SA 4.0) states: Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \"if A, (then) B\".","support":[{"end":255,"quote":"Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \\\"if A, (then) B\\\".","source_id":"wikipedia.article.conditional-logic","source_sha256":"40dbc85923596d12adbc82c3ecd310d0eeb6aa1d35961b0e60928d63d5c10d64","start":105}],"target_id":"concept.wikipedia.conditional-logic","target_kind":"node","target_sha256":"28482fe15f7b68108fea578fd5df733641867f60ef85b9c22031a2087c7c1e6f"}],"concept.wikipedia.conductive-ink":[{"id":"assertion.concept.wikipedia.conductive-ink","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conductive ink as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conductive ink\", CC BY-SA 4.0) states: Conductive ink is an ink that results in a printed object which conducts electricity.","support":[{"end":186,"quote":"Conductive ink is an ink that results in a printed object which conducts electricity.","source_id":"wikipedia.article.conductive-ink","source_sha256":"169c308ce62921cd97bc46089820e85607aa71f914e7c1586dd4899ee872de1d","start":101}],"target_id":"concept.wikipedia.conductive-ink","target_kind":"node","target_sha256":"ecf811be75316796d6dafbe5ebdc51d4140edc10c531d4029db198665686b6c2"}],"concept.wikipedia.conductor-pipe":[{"id":"assertion.concept.wikipedia.conductor-pipe","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conductor pipe as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conductor pipe\", CC BY-SA 4.0) states: A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","support":[{"end":251,"quote":"A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","source_id":"wikipedia.article.conductor-pipe","source_sha256":"7dfe9b612531a0c5eb53cdb8198dbae968b51b4a5e0a1bf19d69bc32309d1a6c","start":102}],"target_id":"concept.wikipedia.conductor-pipe","target_kind":"node","target_sha256":"bf148239cdf92817f9c3831b99d344e3ee30f1a07ca3b25063d5ebed3907c819"}],"concept.wikipedia.cone-condition":[{"id":"assertion.concept.wikipedia.cone-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cone condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cone condition\", CC BY-SA 4.0) states: In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","support":[{"end":207,"quote":"In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","source_id":"wikipedia.article.cone-condition","source_sha256":"0a22a283deba1a09d4156e84f6fe2fb50c3c1391fd7dcfdd08bd68928d2fe110","start":102}],"target_id":"concept.wikipedia.cone-condition","target_kind":"node","target_sha256":"680e483d5e72d2abd901be264ed9b14049d0a89ba0fe6fcdd697f72b64a10874"}],"concept.wikipedia.congruence-lattice-problem":[{"id":"assertion.concept.wikipedia.congruence-lattice-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Congruence lattice problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Congruence lattice problem\", CC BY-SA 4.0) states: In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","support":[{"end":272,"quote":"In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","source_id":"wikipedia.article.congruence-lattice-problem","source_sha256":"7cbe7e2b50506f3541a538968db4b9f17f3751976a237a57b9cc5814b4266a20","start":113}],"target_id":"concept.wikipedia.congruence-lattice-problem","target_kind":"node","target_sha256":"fb1e706e03b01af871bd4fe38231542ccc2b7afc7c3dca18827b677e641da8ad"}],"concept.wikipedia.consciousness-causes-collapse":[{"id":"assertion.concept.wikipedia.consciousness-causes-collapse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consciousness causes collapse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consciousness causes collapse\", CC BY-SA 4.0) states: The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","support":[{"end":326,"quote":"The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","source_id":"wikipedia.article.consciousness-causes-collapse","source_sha256":"573b919daead58639b71ae6819898b6c238ace503302a27bbf630cf1afa1dbf2","start":117}],"target_id":"concept.wikipedia.consciousness-causes-collapse","target_kind":"node","target_sha256":"1c13bf40b95250ebd70b60b525cb77ec3d7ed77a39766d1b46e4d6028a967cf6"}],"concept.wikipedia.consistency":[{"id":"assertion.concept.wikipedia.consistency","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consistency as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consistency\", CC BY-SA 4.0) states: In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","support":[{"end":189,"quote":"In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","source_id":"wikipedia.article.consistency","source_sha256":"9d5c7a83c091d8e68e1390f69873b6001ae130112287aacf1c659435771dbcf4","start":96}],"target_id":"concept.wikipedia.consistency","target_kind":"node","target_sha256":"c0e13fe69293f96210a8c0cf814efca0caf1ae9e1fec7a75136f3c1567c96191"}],"concept.wikipedia.consistent-heuristic":[{"id":"assertion.concept.wikipedia.consistent-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consistent heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consistent heuristic\", CC BY-SA 4.0) states: In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","support":[{"end":387,"quote":"In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","source_id":"wikipedia.article.consistent-heuristic","source_sha256":"3e86587298bff18843913446c19b798417932f361fbc7e9cd6de3dc6f09996ef","start":107}],"target_id":"concept.wikipedia.consistent-heuristic","target_kind":"node","target_sha256":"ae7a9043fc4723e1387f24d3dc402aba03d2271e3a6b75017cbb6a6c0dc51437"}],"concept.wikipedia.constant-conjunction":[{"id":"assertion.concept.wikipedia.constant-conjunction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constant conjunction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constant conjunction\", CC BY-SA 4.0) states: In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","support":[{"end":327,"quote":"In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","source_id":"wikipedia.article.constant-conjunction","source_sha256":"845242ffdc477f00e6522035994bfaaa5708adbb6b78c9d2eed0d7c0a66c9e4e","start":108}],"target_id":"concept.wikipedia.constant-conjunction","target_kind":"node","target_sha256":"cd0b84f9e4c05fc0470606eaf7c9b2363e17567a926959d48f2467a4189f44f3"}],"concept.wikipedia.construct-psychology":[{"id":"assertion.concept.wikipedia.construct-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Construct (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Construct (psychology)\", CC BY-SA 4.0) states: In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","support":[{"end":329,"quote":"In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","source_id":"wikipedia.article.construct-psychology","source_sha256":"fa810c3da1e72c14e6d681990966e72cac23b3efd527d3e153a3c191baa864ee","start":110}],"target_id":"concept.wikipedia.construct-psychology","target_kind":"node","target_sha256":"4a90315e77e0d72662c1c8cf398cc4eaa995f96c6dfdf57c94d8f1b74c95a9d1"}],"concept.wikipedia.construction":[{"id":"assertion.concept.wikipedia.construction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Construction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Construction\", CC BY-SA 4.0) states: Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","support":[{"end":258,"quote":"Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","source_id":"wikipedia.article.construction","source_sha256":"1b82cc216da3b8984c856a5485feaebc909de2ba8bfa43fe50ebbd85891a96a0","start":98}],"target_id":"concept.wikipedia.construction","target_kind":"node","target_sha256":"67b25716da090bfa262cfd3e334d1a7f777161575b6682963f3b6568257b4b97"}],"concept.wikipedia.constructive-analysis":[{"id":"assertion.concept.wikipedia.constructive-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive analysis\", CC BY-SA 4.0) states: In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","support":[{"end":232,"quote":"In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","source_id":"wikipedia.article.constructive-analysis","source_sha256":"c6c6559836165d91a0f094cb502954f01607745dac90cfb7fcdf1f9c00f32966","start":107}],"target_id":"concept.wikipedia.constructive-analysis","target_kind":"node","target_sha256":"693805958b513a053a39efbae4ad9cab2aa8000bb181c2b2a82f74df2614d88d"}],"concept.wikipedia.constructive-empiricism":[{"id":"assertion.concept.wikipedia.constructive-empiricism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive empiricism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive empiricism\", CC BY-SA 4.0) states: In philosophy of science, constructive empiricism is a form of empiricism.","support":[{"end":183,"quote":"In philosophy of science, constructive empiricism is a form of empiricism.","source_id":"wikipedia.article.constructive-empiricism","source_sha256":"69e7b56ef19ea282aab326c257af46f33d36464e5496ddd66faed726d7847b51","start":109}],"target_id":"concept.wikipedia.constructive-empiricism","target_kind":"node","target_sha256":"f0e7597c3c925077d4e712217080c2b734ad743118f5edf36ed475cd076888b0"}],"concept.wikipedia.constructive-heuristic":[{"id":"assertion.concept.wikipedia.constructive-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive heuristic\", CC BY-SA 4.0) states: A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","support":[{"end":283,"quote":"A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","source_id":"wikipedia.article.constructive-heuristic","source_sha256":"90cf5d9334fae3fe4abad966258e91d2d92655f4bf8088af2817d157ad9b3e00","start":110}],"target_id":"concept.wikipedia.constructive-heuristic","target_kind":"node","target_sha256":"bfed64788c99b1a6c1eb9c9dd84a017f160d407f18b1fe65582b06d94be184bd"}],"concept.wikipedia.constructivism-philosophy-of-mathematics":[{"id":"assertion.concept.wikipedia.constructivism-philosophy-of-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructivism (philosophy of mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructivism (philosophy of mathematics)\", CC BY-SA 4.0) states: In philosophy of mathematics, constructivism asserts that it is necessary to find (or \"construct\") a specific example of a mathematical object in order to prove that an example exists.","support":[{"end":313,"quote":"In philosophy of mathematics, constructivism asserts that it is necessary to find (or \\\"construct\\\") a specific example of a mathematical object in order to prove that an example exists.","source_id":"wikipedia.article.constructivism-philosophy-of-mathematics","source_sha256":"4d99a9efb371a4dbd956f007773d0ff120a39380cff072718ed56b41037ce858","start":127}],"target_id":"concept.wikipedia.constructivism-philosophy-of-mathematics","target_kind":"node","target_sha256":"c73257e36b8a12e1ba3f326c8cde25479c5daa2586cb5e054657d7288979a549"}],"concept.wikipedia.constructivism-philosophy-of-science":[{"id":"assertion.concept.wikipedia.constructivism-philosophy-of-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructivism (philosophy of science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructivism (philosophy of science)\", CC BY-SA 4.0) states: Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","support":[{"end":329,"quote":"Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","source_id":"wikipedia.article.constructivism-philosophy-of-science","source_sha256":"c59bd13b64e3c73a57dc5bb9a9bd73c9d697191c85b0f967d9b2602560fc30e0","start":124}],"target_id":"concept.wikipedia.constructivism-philosophy-of-science","target_kind":"node","target_sha256":"1b60f61b2205a87ba72acc35139c2a7a98f9aecd5bdae83a02e97af12982438c"}],"concept.wikipedia.contact-protection":[{"id":"assertion.concept.wikipedia.contact-protection","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contact protection as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contact protection\", CC BY-SA 4.0) states: Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","support":[{"end":359,"quote":"Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","source_id":"wikipedia.article.contact-protection","source_sha256":"396205f879a88700637b333baf6d3700cb7b27adb11fdc73c0ba80c25c7867cd","start":106}],"target_id":"concept.wikipedia.contact-protection","target_kind":"node","target_sha256":"47044cabf9c0a469fd0eaeef485286567bcce90279f22179669ae18ecf487a2a"}],"concept.wikipedia.contagion-heuristic":[{"id":"assertion.concept.wikipedia.contagion-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contagion heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contagion heuristic\", CC BY-SA 4.0) states: The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \"contaminated\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","support":[{"end":472,"quote":"The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \\\"contaminated\\\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","source_id":"wikipedia.article.contagion-heuristic","source_sha256":"99ac656f63f8e7f3a94035758e90f69bbb5abd1792cf16fccb5c1561bd31bd1f","start":106}],"target_id":"concept.wikipedia.contagion-heuristic","target_kind":"node","target_sha256":"3136abd002a252d299ea632d19fe0563f1d818178078eeb6f8cafe3c00f7cb68"}],"concept.wikipedia.contingency-electrical-grid":[{"id":"assertion.concept.wikipedia.contingency-electrical-grid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contingency (electrical grid) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contingency (electrical grid)\", CC BY-SA 4.0) states: In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","support":[{"end":356,"quote":"In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","source_id":"wikipedia.article.contingency-electrical-grid","source_sha256":"f79bcacc35234ab007162be9571951c8e980a8950bd9cd51fbf5d8c18f48797f","start":117}],"target_id":"concept.wikipedia.contingency-electrical-grid","target_kind":"node","target_sha256":"8d6a6e227c2b20ec9514ad4ecb36bf27a4271979cad82c33c2dd1216634dcf7e"}],"concept.wikipedia.contingency-philosophy":[{"id":"assertion.concept.wikipedia.contingency-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contingency (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contingency (philosophy)\", CC BY-SA 4.0) states: In logic, contingency is the feature of a statement making it neither necessary nor impossible.","support":[{"end":207,"quote":"In logic, contingency is the feature of a statement making it neither necessary nor impossible.","source_id":"wikipedia.article.contingency-philosophy","source_sha256":"89318778f0e417dd0c9d6cb748d21917469b53f6a0635a10e902fbc7a82d875e","start":112}],"target_id":"concept.wikipedia.contingency-philosophy","target_kind":"node","target_sha256":"a4d33d15fe391c57c2fa2998e33df3479703e858ba821be770334149f88689eb"}],"concept.wikipedia.continuous-emissions-monitoring-system":[{"id":"assertion.concept.wikipedia.continuous-emissions-monitoring-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Continuous emissions monitoring system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Continuous emissions monitoring system\", CC BY-SA 4.0) states: Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","support":[{"end":277,"quote":"Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","source_id":"wikipedia.article.continuous-emissions-monitoring-system","source_sha256":"b53c8fa953d09aa1f06196c40556eede26dd6aa8313aca94ec30b7bb6ddf89c3","start":126}],"target_id":"concept.wikipedia.continuous-emissions-monitoring-system","target_kind":"node","target_sha256":"80e9b67a5a37920fb27a7bb8e7f4f27c7ecca70330553931ac410ca3747ca5c7"}],"concept.wikipedia.continuous-function":[{"id":"assertion.concept.wikipedia.continuous-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Continuous function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Continuous function\", CC BY-SA 4.0) states: In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","support":[{"end":246,"quote":"In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","source_id":"wikipedia.article.continuous-function","source_sha256":"2d045363976ce00f6ab9478d672ac6e42635958e20e4bad93f74527232c1e375","start":103}],"target_id":"concept.wikipedia.continuous-function","target_kind":"node","target_sha256":"eee30ff490dad4ee6898010afc753b2aa4e14404f302cc7ea83363dc12563f02"}],"concept.wikipedia.contra-principia-negantem-non-est-disputandum":[{"id":"assertion.concept.wikipedia.contra-principia-negantem-non-est-disputandum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contra principia negantem non est disputandum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contra principia negantem non est disputandum\", CC BY-SA 4.0) states: Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \"Against one who denies the principles, there can be no debate\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","support":[{"end":545,"quote":"Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \\\"Against one who denies the principles, there can be no debate\\\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","source_id":"wikipedia.article.contra-principia-negantem-non-est-disputandum","source_sha256":"074903846a947abcc2e855321c284025b44eaa8682f24084f2e42a83e803a70a","start":133}],"target_id":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","target_kind":"node","target_sha256":"b95968f092cd0823d23df2bbdf524fe4f61034361df9f867b73c089e713ab4ef"}],"concept.wikipedia.contrastivism":[{"id":"assertion.concept.wikipedia.contrastivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contrastivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contrastivism\", CC BY-SA 4.0) states: Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","support":[{"end":320,"quote":"Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","source_id":"wikipedia.article.contrastivism","source_sha256":"0f38f422f5694a2843db802aede0270bbb0530701adf65a1c700ac715df0e33d","start":101}],"target_id":"concept.wikipedia.contrastivism","target_kind":"node","target_sha256":"22a8bee992eda34049449604493c9e67ee36c6c2d8515614bea76372c19fb8a2"}],"concept.wikipedia.control-knob":[{"id":"assertion.concept.wikipedia.control-knob","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control knob as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control knob\", CC BY-SA 4.0) states: A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","support":[{"end":334,"quote":"A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","source_id":"wikipedia.article.control-knob","source_sha256":"cdddf90d1601e5dba4223c1947d34979c7ac9eaedb5e148ecaacde05cb15e2dd","start":99}],"target_id":"concept.wikipedia.control-knob","target_kind":"node","target_sha256":"0f036d69932dc21a8abeb7b27c399ee4905a0b769a880b921f0b82ff3be5aa68"}],"concept.wikipedia.control-valve":[{"id":"assertion.concept.wikipedia.control-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control valve\", CC BY-SA 4.0) states: A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","support":[{"end":236,"quote":"A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","source_id":"wikipedia.article.control-valve","source_sha256":"dea3a1d58ed7c6a67d6b5c1eacc2214098fb9a3110e4dcb1b8eeb2c9d9aa6409","start":100}],"target_id":"concept.wikipedia.control-valve","target_kind":"node","target_sha256":"f4fdfb2a5eb79e8bf454cdef32cc5c5519cdad7eaa2f3974193a631e2e7312a4"}],"concept.wikipedia.convergence-space":[{"id":"assertion.concept.wikipedia.convergence-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convergence space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convergence space\", CC BY-SA 4.0) states: In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","support":[{"end":475,"quote":"In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X.  Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","source_id":"wikipedia.article.convergence-space","source_sha256":"482e150d2fd638809536c528b75f4be97ce214e1e658cbcb834ed86bb136095f","start":105}],"target_id":"concept.wikipedia.convergence-space","target_kind":"node","target_sha256":"c75040f0251491d52fd1f66736700974422c2f32d546407f9f6cf1e8cea377c4"}],"concept.wikipedia.convex-curve":[{"id":"assertion.concept.wikipedia.convex-curve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex curve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex curve\", CC BY-SA 4.0) states: In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","support":[{"end":199,"quote":"In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","source_id":"wikipedia.article.convex-curve","source_sha256":"0546528fcb868127801a785cea9a973bb45fe6347c564ab10cbfddbb5778d68f","start":100}],"target_id":"concept.wikipedia.convex-curve","target_kind":"node","target_sha256":"1de85f897623ac78f71f37b2ab5b12f72ef18300c26dd172eae431ded4fbd8c3"}],"concept.wikipedia.convex-metric-space":[{"id":"assertion.concept.wikipedia.convex-metric-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex metric space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex metric space\", CC BY-SA 4.0) states: In mathematics, there are several notions of \"convexity\" on metric spaces.","support":[{"end":183,"quote":"In mathematics, there are several notions of \\\"convexity\\\" on metric spaces.","source_id":"wikipedia.article.convex-metric-space","source_sha256":"88cb54a5c5445bfb17acaa3480ccade55248c15ce2c711fa25eca46c5376d28a","start":107}],"target_id":"concept.wikipedia.convex-metric-space","target_kind":"node","target_sha256":"20382251df7d8fb7faf5e9d3d4894c14c70800597a6feb99d16e9c444f114052"}],"concept.wikipedia.convex-polygon":[{"id":"assertion.concept.wikipedia.convex-polygon","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex polygon as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex polygon\", CC BY-SA 4.0) states: In geometry, a convex polygon is a polygon that is the boundary of a convex set.","support":[{"end":180,"quote":"In geometry, a convex polygon is a polygon that is the boundary of a convex set.","source_id":"wikipedia.article.convex-polygon","source_sha256":"4a25651df36696133d7b4997d266e02a53104c6403f6d1a2bdff9f7274c780a5","start":100}],"target_id":"concept.wikipedia.convex-polygon","target_kind":"node","target_sha256":"b8c6c5fa24afdf423f204d38245dae167c4e0b02e7392f8fcc9aee6a40d21f9d"}],"concept.wikipedia.convex-set":[{"id":"assertion.concept.wikipedia.convex-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex set\", CC BY-SA 4.0) states: In geometry, a set of points is convex if it contains every line segment between two points in the set.","support":[{"end":197,"quote":"In geometry, a set of points is convex if it contains every line segment between two points in the set.","source_id":"wikipedia.article.convex-set","source_sha256":"0714df557ba3fa44d07b2891f42d726d481043817d4cd36cfc7da4329f5f1a50","start":94}],"target_id":"concept.wikipedia.convex-set","target_kind":"node","target_sha256":"09aa58c7fead3e56a65af3a443be49e6b32619a11cb0f8e5535019452e94fcab"}],"concept.wikipedia.convex-space":[{"id":"assertion.concept.wikipedia.convex-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex space\", CC BY-SA 4.0) states: In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","support":[{"end":247,"quote":"In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","source_id":"wikipedia.article.convex-space","source_sha256":"2bd8e49c8e93bbf5b034beed0e6c23e2ecdd1e0cab2c2c3cef2a90f29cb52616","start":100}],"target_id":"concept.wikipedia.convex-space","target_kind":"node","target_sha256":"f5d7f1948ac0946cfbcae5f33ce57dadbdf075b333f019da5ade2c8a028e8c7e"}],"concept.wikipedia.cooperative-principle":[{"id":"assertion.concept.wikipedia.cooperative-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cooperative principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cooperative principle\", CC BY-SA 4.0) states: In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","support":[{"end":411,"quote":"In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","source_id":"wikipedia.article.cooperative-principle","source_sha256":"cddff45fc57d4a37e40c194039779fb4735d149172711429f9f25e4982b0916f","start":108}],"target_id":"concept.wikipedia.cooperative-principle","target_kind":"node","target_sha256":"e29e308bf9c4c52fe0024d0c5af3db12a799de0c0abd7fcbfd2ab78c47c06fe2"}],"concept.wikipedia.copper-loss":[{"id":"assertion.concept.wikipedia.copper-loss","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Copper loss as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Copper loss\", CC BY-SA 4.0) states: Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","support":[{"end":245,"quote":"Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","source_id":"wikipedia.article.copper-loss","source_sha256":"eed196c36cccb8baa1d27fbde8fafe73c781ddc15dcdc714fa36ecacee2bd48a","start":98}],"target_id":"concept.wikipedia.copper-loss","target_kind":"node","target_sha256":"2e6929e9f4e908c9130cee23fc6b4b29e078986c9f0048193e68fd4a791edfd8"}],"concept.wikipedia.corexy":[{"id":"assertion.concept.wikipedia.corexy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"CoreXY as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"CoreXY\", CC BY-SA 4.0) states: CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","support":[{"end":250,"quote":"CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","source_id":"wikipedia.article.corexy","source_sha256":"c8101476354ec47b41d3cebbacd3f83eb0de767e7610028d2c1304590d55790d","start":94}],"target_id":"concept.wikipedia.corexy","target_kind":"node","target_sha256":"434dfa3dca39913362046f59ddb04807853b5b6f7bc22f6fb941fb63e843d9af"}],"concept.wikipedia.correlative-based-fallacies":[{"id":"assertion.concept.wikipedia.correlative-based-fallacies","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correlative-based fallacies as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correlative-based fallacies\", CC BY-SA 4.0) states: In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","support":[{"end":213,"quote":"In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","source_id":"wikipedia.article.correlative-based-fallacies","source_sha256":"3b5289c3aa638697b54f44db5cf0b99106a87a3c8c09a83b08ed9a8147e539db","start":113}],"target_id":"concept.wikipedia.correlative-based-fallacies","target_kind":"node","target_sha256":"d574177688e644d2a0a957c62d6f2d7605412dc3d00a9270b682697bc9855db1"}],"concept.wikipedia.correspondence-theory-of-truth":[{"id":"assertion.concept.wikipedia.correspondence-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correspondence theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correspondence theory of truth\", CC BY-SA 4.0) states: In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","support":[{"end":364,"quote":"In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","source_id":"wikipedia.article.correspondence-theory-of-truth","source_sha256":"eb2c1eb6a9bd98564db5faf29ea3132443e5ed80a0a6480609bb3d54da384db9","start":116}],"target_id":"concept.wikipedia.correspondence-theory-of-truth","target_kind":"node","target_sha256":"448c054cbcc05114ba80e6f8eb9c6f9250ea5dca5b3a97e0012b2260b5265cf3"}],"concept.wikipedia.correspondent-inference-theory":[{"id":"assertion.concept.wikipedia.correspondent-inference-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correspondent inference theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correspondent inference theory\", CC BY-SA 4.0) states: Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965) that \"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\".","support":[{"end":356,"quote":"Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965)  that \\\"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\\\".","source_id":"wikipedia.article.correspondent-inference-theory","source_sha256":"e66ebe02b911cf977a50a6b0296d07aea7967d93dab9c712148f45a4e33a1758","start":117}],"target_id":"concept.wikipedia.correspondent-inference-theory","target_kind":"node","target_sha256":"f3de7fe7e1e164079c7a9cd16bf35a2f49271dce4245fe25e41a027f0dc21fb6"}],"concept.wikipedia.cosmological-argument":[{"id":"assertion.concept.wikipedia.cosmological-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cosmological argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cosmological argument\", CC BY-SA 4.0) states: In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","support":[{"end":347,"quote":"In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","source_id":"wikipedia.article.cosmological-argument","source_sha256":"570b48518b9679044c90fed7ff9d47c295a5def7b5499a54a8bcb0f63ba2be7d","start":105}],"target_id":"concept.wikipedia.cosmological-argument","target_kind":"node","target_sha256":"00e4d35d4424899719b988cefadfa7ee897499c67ef80422b45b3856af581e2b"}],"concept.wikipedia.countably-generated-module":[{"id":"assertion.concept.wikipedia.countably-generated-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Countably generated module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Countably generated module\", CC BY-SA 4.0) states: In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","support":[{"end":257,"quote":"In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","source_id":"wikipedia.article.countably-generated-module","source_sha256":"996c45c0dd5e0da132e6ded511d1f345c21dc0ea68ac088cd6a4b715f27ac28a","start":114}],"target_id":"concept.wikipedia.countably-generated-module","target_kind":"node","target_sha256":"2c03ca513f1b1881cdeaec08de7fb73332a80e7917629e29d114cd9b442e5f16"}],"concept.wikipedia.counterbore":[{"id":"assertion.concept.wikipedia.counterbore","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Counterbore as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Counterbore\", CC BY-SA 4.0) states: In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","support":[{"end":250,"quote":"In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","source_id":"wikipedia.article.counterbore","source_sha256":"bfcc6423bbebacd838f56fbf6ea20da4e463fe11a92bb9d974f61798ccfa8ab0","start":98}],"target_id":"concept.wikipedia.counterbore","target_kind":"node","target_sha256":"a152410bd6aa0759fb985bd63ada5c7e48809124fd23956a6f91c3b262954474"}],"concept.wikipedia.counterfactual-conditional":[{"id":"assertion.concept.wikipedia.counterfactual-conditional","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Counterfactual conditional as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Counterfactual conditional\", CC BY-SA 4.0) states: Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","support":[{"end":393,"quote":"Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","source_id":"wikipedia.article.counterfactual-conditional","source_sha256":"5477faaf46c07344cc7dc6c3c1bece0b344addb171611dc98733e05b32fde883","start":112}],"target_id":"concept.wikipedia.counterfactual-conditional","target_kind":"node","target_sha256":"d62d72fa86307ec80db8f234ac382fa70e0046c86c1667416c9042f238a2c90e"}],"concept.wikipedia.coupling":[{"id":"assertion.concept.wikipedia.coupling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coupling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coupling\", CC BY-SA 4.0) states: A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","support":[{"end":204,"quote":"A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","source_id":"wikipedia.article.coupling","source_sha256":"d4ba8c539742fb3de0fc4f05ddeee6f128c74029d4a042c88016adda957124cb","start":93}],"target_id":"concept.wikipedia.coupling","target_kind":"node","target_sha256":"1b5c7fb9bf216e39869c008f14fd65254303dddc0bbbcedda81ba9563b57381d"}],"concept.wikipedia.courtier-s-reply":[{"id":"assertion.concept.wikipedia.courtier-s-reply","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Courtier's reply as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Courtier's reply\", CC BY-SA 4.0) states: The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","support":[{"end":347,"quote":"The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","source_id":"wikipedia.article.courtier-s-reply","source_sha256":"063a8d5a734ae35ede3ee8973ec0e96975bd3269b2e2e2763418775814938b80","start":104}],"target_id":"concept.wikipedia.courtier-s-reply","target_kind":"node","target_sha256":"131b2c2fbb8d39db3bcafd7892fdf877571f5d7513db697fe27457df14bee75a"}],"concept.wikipedia.cover-time":[{"id":"assertion.concept.wikipedia.cover-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cover time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cover time\", CC BY-SA 4.0) states: In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","support":[{"end":285,"quote":"In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","source_id":"wikipedia.article.cover-time","source_sha256":"8472dceda598fd317e3007f620222ac1fecf14a0bdcf3f37f4060ec5014d0d50","start":98}],"target_id":"concept.wikipedia.cover-time","target_kind":"node","target_sha256":"ed74ed92c7530705e38d9cd855015eb7babd1a59646b31c294b4701bfe2d1329"}],"concept.wikipedia.cr-maill-re":[{"id":"assertion.concept.wikipedia.cr-maill-re","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crémaillère as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crémaillère\", CC BY-SA 4.0) states: A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","support":[{"end":298,"quote":"A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","source_id":"wikipedia.article.cr-maill-re","source_sha256":"6d754833f1b34d6e73c1ca9bbd66825252835230074d2856a9baaf90aa736d91","start":99}],"target_id":"concept.wikipedia.cr-maill-re","target_kind":"node","target_sha256":"47d1f0892fc47c519eb4825cfe65b0522683b362e66501d97d1ff91b4e14f454"}],"concept.wikipedia.crawl-ratio":[{"id":"assertion.concept.wikipedia.crawl-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crawl ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crawl ratio\", CC BY-SA 4.0) states: In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","support":[{"end":264,"quote":"In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","source_id":"wikipedia.article.crawl-ratio","source_sha256":"6dfd0c4423ef81ff2745767275e2d15cf6d83957487aafaa8475bb59ada9faad","start":98}],"target_id":"concept.wikipedia.crawl-ratio","target_kind":"node","target_sha256":"06e7eb6e290ea6e3f1ff59913d72c0e4eb0359bd7a89b496ec48d14c81125bd6"}],"concept.wikipedia.crayford-focuser":[{"id":"assertion.concept.wikipedia.crayford-focuser","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crayford focuser as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crayford focuser\", CC BY-SA 4.0) states: The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","support":[{"end":195,"quote":"The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","source_id":"wikipedia.article.crayford-focuser","source_sha256":"f557e1da8392a45b13d241aabe4f1d0c9e0d02d81df38fc1587815692c2c5efb","start":103}],"target_id":"concept.wikipedia.crayford-focuser","target_kind":"node","target_sha256":"5c12735387908b199a5180ab4f079dbe2728419bdce6ffdbf230383d7712fe9b"}],"concept.wikipedia.credulity":[{"id":"assertion.concept.wikipedia.credulity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Credulity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Credulity\", CC BY-SA 4.0) states: Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","support":[{"end":225,"quote":"Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","source_id":"wikipedia.article.credulity","source_sha256":"da1c5d4bcf79bf075f8330db18f2b341514139e4e97a81b940851557eff3621d","start":97}],"target_id":"concept.wikipedia.credulity","target_kind":"node","target_sha256":"fdbabed784e75477a1a43ea0c93c189fef3304d99f2242d393b9b3e6ce1e0c7b"}],"concept.wikipedia.critical-realism-philosophy-of-perception":[{"id":"assertion.concept.wikipedia.critical-realism-philosophy-of-perception","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Critical realism (philosophy of perception) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Critical realism (philosophy of perception)\", CC BY-SA 4.0) states: In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","support":[{"end":546,"quote":"In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","source_id":"wikipedia.article.critical-realism-philosophy-of-perception","source_sha256":"258b268a00c9986ddc1b1d44b1c85196021eac1edae15a882d3e0ae4055c0d01","start":131}],"target_id":"concept.wikipedia.critical-realism-philosophy-of-perception","target_kind":"node","target_sha256":"ef129d787986725c58d50b5a682d7b5f96da28a78af5e527392885f4918ca8a1"}],"concept.wikipedia.critical-thinking":[{"id":"assertion.concept.wikipedia.critical-thinking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Critical thinking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Critical thinking\", CC BY-SA 4.0) states: Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","support":[{"end":251,"quote":"Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","source_id":"wikipedia.article.critical-thinking","source_sha256":"767b8dcf3ba665a628b4ecc87b8819965a20fda472c6e45113a901c6392eb461","start":103}],"target_id":"concept.wikipedia.critical-thinking","target_kind":"node","target_sha256":"ad0c690a1658793e57012d9e4bd30c09832fdcb0cd7739fefc5de7685ce9f78b"}],"concept.wikipedia.cross-impact-analysis":[{"id":"assertion.concept.wikipedia.cross-impact-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cross impact analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cross impact analysis\", CC BY-SA 4.0) states: Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","support":[{"end":322,"quote":"Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","source_id":"wikipedia.article.cross-impact-analysis","source_sha256":"ae35c232205a10b7a19c9c6f271de19c388ef7a598e11147fdc09228c437d8b7","start":109}],"target_id":"concept.wikipedia.cross-impact-analysis","target_kind":"node","target_sha256":"613a0910aee4418b1973773c9857084c229f32389eef090618b84525bef0b2c4"}],"concept.wikipedia.cross-sectional-study":[{"id":"assertion.concept.wikipedia.cross-sectional-study","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cross-sectional study as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cross-sectional study\", CC BY-SA 4.0) states: In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","support":[{"end":428,"quote":"In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","source_id":"wikipedia.article.cross-sectional-study","source_sha256":"49cb08d76e97a6eb8b533d0e9cc3ed9ccba9188b87e9bc38c743baf191fec183","start":108}],"target_id":"concept.wikipedia.cross-sectional-study","target_kind":"node","target_sha256":"7e2ed762cec070d24285d4ef374ae541517f0c2225d3a2c7c0f6194128bd2f39"}],"concept.wikipedia.crosshead":[{"id":"assertion.concept.wikipedia.crosshead","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crosshead as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crosshead\", CC BY-SA 4.0) states: In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","support":[{"end":345,"quote":"In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","source_id":"wikipedia.article.crosshead","source_sha256":"6e0e78387c9de4965b6eb7b9f3ce8f797e3eb7d6639a8a40269c2ce73751e8a8","start":95}],"target_id":"concept.wikipedia.crosshead","target_kind":"node","target_sha256":"dee5ad91e6723adb12ed8356268df912e86970e69d30be54983a8a81c2beaaab"}],"concept.wikipedia.cubicity":[{"id":"assertion.concept.wikipedia.cubicity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cubicity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cubicity\", CC BY-SA 4.0) states: In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","support":[{"end":313,"quote":"In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","source_id":"wikipedia.article.cubicity","source_sha256":"9f14e2a5efb08a5fa84467f7d298b44711ba7053dbb57424f2b7f974a5d62a11","start":96}],"target_id":"concept.wikipedia.cubicity","target_kind":"node","target_sha256":"691b6a4d9f5d1a866ce693eb27e11be4a70d3ae87b468a6bf0bb68ef01ec7f5e"}],"concept.wikipedia.curry-howard-correspondence":[{"id":"assertion.concept.wikipedia.curry-howard-correspondence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Curry–Howard correspondence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Curry–Howard correspondence\", CC BY-SA 4.0) states: In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","support":[{"end":269,"quote":"In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","source_id":"wikipedia.article.curry-howard-correspondence","source_sha256":"980c3d16a6eed990774afe285db6ce0fff92121f9e78c7fc9f55d6c0d9228b0d","start":113}],"target_id":"concept.wikipedia.curry-howard-correspondence","target_kind":"node","target_sha256":"a5b9061e75c8589ef75b2a3c5019ef5633859648ffe61fe2e63a05cd062f6b88"}],"concept.wikipedia.cuthill-mckee-algorithm":[{"id":"assertion.concept.wikipedia.cuthill-mckee-algorithm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cuthill–McKee algorithm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cuthill–McKee algorithm\", CC BY-SA 4.0) states: In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth.","support":[{"end":350,"quote":"In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a   band matrix form with a small bandwidth.","source_id":"wikipedia.article.cuthill-mckee-algorithm","source_sha256":"1ee9f1d193df9c963b2b81a43f8064c0bfe7ae2a1424aa8fced991a867e39c01","start":110}],"target_id":"concept.wikipedia.cuthill-mckee-algorithm","target_kind":"node","target_sha256":"9f2e51f0a3fbfd5859c58c1d667ea195df8d0fd31dfabbba90f5943b58893be0"}],"concept.wikipedia.cutting-sequence":[{"id":"assertion.concept.wikipedia.cutting-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting sequence\", CC BY-SA 4.0) states: In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\"cut\") as a curve crosses a square grid.","support":[{"end":275,"quote":"In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\\\"cut\\\") as a curve crosses a square grid.","source_id":"wikipedia.article.cutting-sequence","source_sha256":"f8ffe8602f82a8ea60062d3ae5b45c904e6d8ceb2953c3768436a6712cd55db9","start":104}],"target_id":"concept.wikipedia.cutting-sequence","target_kind":"node","target_sha256":"978c403ad093dea750edb34ce1e6b451cace1e0b1c857488f1e9751dfea1b3d5"}],"concept.wikipedia.cutting-tool-machining":[{"id":"assertion.concept.wikipedia.cutting-tool-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting tool (machining) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting tool (machining)\", CC BY-SA 4.0) states: In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","support":[{"end":347,"quote":"In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","source_id":"wikipedia.article.cutting-tool-machining","source_sha256":"665938665510938b067d225bedd5766d8186eae8dc59e5771060e53d5deed616","start":111}],"target_id":"concept.wikipedia.cutting-tool-machining","target_kind":"node","target_sha256":"2609b9ff206d86cb2f74349fc1145c97096c059cdcbf28ad0f6ba081420b286d"}],"concept.wikipedia.cutting-tool-material":[{"id":"assertion.concept.wikipedia.cutting-tool-material","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting tool material as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting tool material\", CC BY-SA 4.0) states: Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","support":[{"end":308,"quote":"Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","source_id":"wikipedia.article.cutting-tool-material","source_sha256":"5e951944508f6a76c9762e73013908f963a7cda1eec8a122913b2a937d4f3581","start":109}],"target_id":"concept.wikipedia.cutting-tool-material","target_kind":"node","target_sha256":"838f6c6e9687d7bacd52a91ef18a6f477f1cc645d0a6f984ba47b80a276889cf"}],"concept.wikipedia.cvcc":[{"id":"assertion.concept.wikipedia.cvcc","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"CVCC as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"CVCC\", CC BY-SA 4.0) states: CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","support":[{"end":304,"quote":"CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","source_id":"wikipedia.article.cvcc","source_sha256":"bf0c007c47d1827e4116acbd8172df6940653a39567d6a703099f0a32379ee22","start":90}],"target_id":"concept.wikipedia.cvcc","target_kind":"node","target_sha256":"a95c2966a20e8f732942fa4df0fbedaff6235ce267dda9e577593c0ca56e4b13"}],"concept.wikipedia.cycloid-gear":[{"id":"assertion.concept.wikipedia.cycloid-gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cycloid gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cycloid gear\", CC BY-SA 4.0) states: A cycloidal gear is a toothed gear with a cycloidal profile.","support":[{"end":159,"quote":"A cycloidal gear is a toothed gear with a cycloidal profile.","source_id":"wikipedia.article.cycloid-gear","source_sha256":"6967728058c2273630c647178e68f22dae2fcf03287f1245f4067441c905c1ea","start":99}],"target_id":"concept.wikipedia.cycloid-gear","target_kind":"node","target_sha256":"cd4ae79e4d024f290cd683dace82434052768f0863f5ea5cf64eb78fdc624f50"}],"concept.wikipedia.cycloidal-drive":[{"id":"assertion.concept.wikipedia.cycloidal-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cycloidal drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cycloidal drive\", CC BY-SA 4.0) states: A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","support":[{"end":222,"quote":"A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","source_id":"wikipedia.article.cycloidal-drive","source_sha256":"07237d5fcb3a7f4809abab039abdc08acf19a8cd1bbfb8fc1ed236b772eb75e9","start":102}],"target_id":"concept.wikipedia.cycloidal-drive","target_kind":"node","target_sha256":"44430c0ecd4aab380435a8e7e1dd97e46d20404437d1900d2691e775afe71835"}],"concept.wikipedia.dashpot":[{"id":"assertion.concept.wikipedia.dashpot","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dashpot as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dashpot\", CC BY-SA 4.0) states: A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","support":[{"end":192,"quote":"A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","source_id":"wikipedia.article.dashpot","source_sha256":"9e62a467464b2bf036d0ef649e82420af7c4523e1c34bf309e6fa805f68d174d","start":94}],"target_id":"concept.wikipedia.dashpot","target_kind":"node","target_sha256":"6beb379d2005bbe05234134b65ff07ecb0341df7ce2b633cbeefcaedcf88c6d4"}],"concept.wikipedia.data-center-tiers":[{"id":"assertion.concept.wikipedia.data-center-tiers","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data center tiers as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data center tiers\", CC BY-SA 4.0) states: Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","support":[{"end":202,"quote":"Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","source_id":"wikipedia.article.data-center-tiers","source_sha256":"3226b1e491406c32862e5f4202143a68ead060d42e5ba0ec257e326730847b69","start":105}],"target_id":"concept.wikipedia.data-center-tiers","target_kind":"node","target_sha256":"1103df70d725cb8d8c382ec413a15f5dde1c93b5e9af049d343b881316739e06"}],"concept.wikipedia.data-sharing":[{"id":"assertion.concept.wikipedia.data-sharing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data sharing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data sharing\", CC BY-SA 4.0) states: Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","support":[{"end":208,"quote":"Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","source_id":"wikipedia.article.data-sharing","source_sha256":"30a999ae00753600cd3fc15f98216f66b1a251b90c6841bb53185404184e82a8","start":100}],"target_id":"concept.wikipedia.data-sharing","target_kind":"node","target_sha256":"1d38bbdf2e393839cafd69bc8c5decf1a7476229771b1c53ab9d5a98c2f3f0c1"}],"concept.wikipedia.data-universalism":[{"id":"assertion.concept.wikipedia.data-universalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data universalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data universalism\", CC BY-SA 4.0) states: Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","support":[{"end":282,"quote":"Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","source_id":"wikipedia.article.data-universalism","source_sha256":"bc27dba5b8b31c444f3c0e58ad8c70ee1b43f54dd88ec3d88c464705811b0999","start":105}],"target_id":"concept.wikipedia.data-universalism","target_kind":"node","target_sha256":"2e1aa50d9df99a60a7554848eb650094f12918e352a9f61a3c5857c4ea0993f7"}],"concept.wikipedia.davenport-schinzel-sequence":[{"id":"assertion.concept.wikipedia.davenport-schinzel-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Davenport–Schinzel sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Davenport–Schinzel sequence\", CC BY-SA 4.0) states: In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","support":[{"end":270,"quote":"In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","source_id":"wikipedia.article.davenport-schinzel-sequence","source_sha256":"f4424f49ddbb90533663c74d9f9e0e563946fe0af56fe50d413f79694a3f2338","start":115}],"target_id":"concept.wikipedia.davenport-schinzel-sequence","target_kind":"node","target_sha256":"4948b0b8545511a2cf81d932f85d807502cfdbef4a4e8278a12ee9a954c3dc8e"}],"concept.wikipedia.dc-injection-braking":[{"id":"assertion.concept.wikipedia.dc-injection-braking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"DC injection braking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"DC injection braking\", CC BY-SA 4.0) states: DC injection braking is a method of slowing AC electric motors.","support":[{"end":171,"quote":"DC injection braking is a method of slowing AC electric motors.","source_id":"wikipedia.article.dc-injection-braking","source_sha256":"c38c780ae4a125c1c5228c74f6c6b98bd31e6d12a99d9acf9cd08b8fa96dd376","start":108}],"target_id":"concept.wikipedia.dc-injection-braking","target_kind":"node","target_sha256":"457a374c0370966744ec78e295da576958140772f1c588cfaeedf75a7331a412"}],"concept.wikipedia.de-se":[{"id":"assertion.concept.wikipedia.de-se","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"De se as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"De se\", CC BY-SA 4.0) states: De se is Latin for \"of oneself\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \"de dicto and de re\".","support":[{"end":261,"quote":"De se is Latin for \\\"of oneself\\\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \\\"de dicto and de re\\\".","source_id":"wikipedia.article.de-se","source_sha256":"546f9e40f76613d54538371cc467dbece27c4e418629d56676aca27e29f6df3a","start":93}],"target_id":"concept.wikipedia.de-se","target_kind":"node","target_sha256":"d3e6eefeb12ec8a77c5dde6865904ff8bac8e3feb8933bb7208d9d3316154b3e"}],"concept.wikipedia.deal-grove-model":[{"id":"assertion.concept.wikipedia.deal-grove-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deal–Grove model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deal–Grove model\", CC BY-SA 4.0) states: The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","support":[{"end":207,"quote":"The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","source_id":"wikipedia.article.deal-grove-model","source_sha256":"166a875968d027e8f1b2e15eab7fa7d0a05826a459882651aba2419a5a4ec870","start":103}],"target_id":"concept.wikipedia.deal-grove-model","target_kind":"node","target_sha256":"45fe3a78d4b884585356f81afdbca0b5d54c858e34b98afc4284448af0edf65c"}],"concept.wikipedia.decidability-logic":[{"id":"assertion.concept.wikipedia.decidability-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decidability (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decidability (logic)\", CC BY-SA 4.0) states: In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","support":[{"end":227,"quote":"In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","source_id":"wikipedia.article.decidability-logic","source_sha256":"cb649bcc5e9080cfc5b361cf8fb35e5bcedea6a002abd97959114fa5631f5e58","start":106}],"target_id":"concept.wikipedia.decidability-logic","target_kind":"node","target_sha256":"b05436b449999a093a5378f1c0bdbd0b1f7325f862952004336f574c3ef7894c"}],"concept.wikipedia.decolonization-of-knowledge":[{"id":"assertion.concept.wikipedia.decolonization-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decolonization of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decolonization of knowledge\", CC BY-SA 4.0) states: Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","support":[{"end":324,"quote":"Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","source_id":"wikipedia.article.decolonization-of-knowledge","source_sha256":"a979b2411d2825ef8fb6a046a2490706327c6a78b5f64da5c3d68b9acee9a7dd","start":115}],"target_id":"concept.wikipedia.decolonization-of-knowledge","target_kind":"node","target_sha256":"9c525294c08d5c1df12ec5ddea23b4740bd43f19d1d2e06a943b43091004db63"}],"concept.wikipedia.decomposition-of-a-module":[{"id":"assertion.concept.wikipedia.decomposition-of-a-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decomposition of a module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decomposition of a module\", CC BY-SA 4.0) states: In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","support":[{"end":216,"quote":"In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","source_id":"wikipedia.article.decomposition-of-a-module","source_sha256":"5f51dd613e8e346ff9d16a844b17f97c43d7033e7eb04f72e93a7ec4f9766d47","start":113}],"target_id":"concept.wikipedia.decomposition-of-a-module","target_kind":"node","target_sha256":"ba804840361d96a938fe92017a7b93999c1fb6bb5611fccf409f68aaf0fd84b6"}],"concept.wikipedia.deconstruction":[{"id":"assertion.concept.wikipedia.deconstruction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deconstruction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deconstruction\", CC BY-SA 4.0) states: In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","support":[{"end":226,"quote":"In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","source_id":"wikipedia.article.deconstruction","source_sha256":"99fe3d0cbed94675fd9f3b3a887c495fb93ac1215667a3a939138d15a878d304","start":98}],"target_id":"concept.wikipedia.deconstruction","target_kind":"node","target_sha256":"36cbacbc3395ec3438289be40c252151891489357f7f528fb03a85b4f3876b2c"}],"concept.wikipedia.deductive-reasoning":[{"id":"assertion.concept.wikipedia.deductive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deductive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deductive reasoning\", CC BY-SA 4.0) states: Deductive reasoning is the process of drawing valid inferences.","support":[{"end":167,"quote":"Deductive reasoning is the process of drawing valid inferences.","source_id":"wikipedia.article.deductive-reasoning","source_sha256":"56c703ea347f75516c81df98c0b6ee58cfd95fee9fe3f4b38517965340174780","start":104}],"target_id":"concept.wikipedia.deductive-reasoning","target_kind":"node","target_sha256":"d8a70931b1a5a867dccf5d897a1a2b5cd67e2cdbb6497a42371eb32709b0f4a1"}],"concept.wikipedia.defeasibility-linguistics":[{"id":"assertion.concept.wikipedia.defeasibility-linguistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defeasibility (linguistics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defeasibility (linguistics)\", CC BY-SA 4.0) states: In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","support":[{"end":302,"quote":"In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","source_id":"wikipedia.article.defeasibility-linguistics","source_sha256":"9ad305a60aa2798a208ec1ea2c9f21d1a20e138998df59ce12af85e73d2b6971","start":115}],"target_id":"concept.wikipedia.defeasibility-linguistics","target_kind":"node","target_sha256":"b17bc3091e041218dd64b8ab623e38e80ee9a3cd53980cbc432b629a7218d692"}],"concept.wikipedia.defeasible-reasoning":[{"id":"assertion.concept.wikipedia.defeasible-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defeasible reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defeasible reasoning\", CC BY-SA 4.0) states: In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","support":[{"end":247,"quote":"In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","source_id":"wikipedia.article.defeasible-reasoning","source_sha256":"eb39fa0321646d5cb0c6bb305e33a6568b01cab98d7ccf242a5cb465b26bba39","start":107}],"target_id":"concept.wikipedia.defeasible-reasoning","target_kind":"node","target_sha256":"6fc1bdbf6efe7d8f088f99fc8dd395824a32e924c65e8ed20a18262bb2574924"}],"concept.wikipedia.defensive-pessimism":[{"id":"assertion.concept.wikipedia.defensive-pessimism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defensive pessimism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defensive pessimism\", CC BY-SA 4.0) states: Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","support":[{"end":270,"quote":"Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","source_id":"wikipedia.article.defensive-pessimism","source_sha256":"d6f3dd23fc40266319fc0888d220b190bded7b1f88a40ff91c6dec422fe8d7c6","start":107}],"target_id":"concept.wikipedia.defensive-pessimism","target_kind":"node","target_sha256":"44d80e5f676780cd5a1dc5de20656837d49732c52a4bd39e249e9d5008f55312"}],"concept.wikipedia.definite-description":[{"id":"assertion.concept.wikipedia.definite-description","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definite description as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definite description\", CC BY-SA 4.0) states: In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \"the X\" where X is a noun-phrase or a singular common noun.","support":[{"end":274,"quote":"In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \\\"the X\\\" where X is a noun-phrase or a singular common noun.","source_id":"wikipedia.article.definite-description","source_sha256":"6c329d54988a88df7f5c835485e9441e5f5bcc806b9e241b3e0f3424c8da1e5a","start":106}],"target_id":"concept.wikipedia.definite-description","target_kind":"node","target_sha256":"9633b1c46de51b2a611cd40df6f4d1ecf4a9a3a6d6f9035d6ea48b9ade7a013d"}],"concept.wikipedia.definition":[{"id":"assertion.concept.wikipedia.definition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definition\", CC BY-SA 4.0) states: A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","support":[{"end":198,"quote":"A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","source_id":"wikipedia.article.definition","source_sha256":"a9ec0af5465f3f97efaed51f577047eb75a7c627a181a67e0531aa263117bdf7","start":94}],"target_id":"concept.wikipedia.definition","target_kind":"node","target_sha256":"f0ee97ecd9bd06483de716000a2448b338be36496b1dcede0a4fab9ace0521c3"}],"concept.wikipedia.definitionism":[{"id":"assertion.concept.wikipedia.definitionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definitionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definitionism\", CC BY-SA 4.0) states: Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","support":[{"end":317,"quote":"Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","source_id":"wikipedia.article.definitionism","source_sha256":"d611f74be72eec751e8b0b17a0f7f16b8f7c78008d80e8ebeeca1a9746249f25","start":101}],"target_id":"concept.wikipedia.definitionism","target_kind":"node","target_sha256":"50c7a9c671e66ba8ec8d183afaac9ef230b7e8572c7d0a6b3b9147e73fba880a"}],"concept.wikipedia.deflationary-theory-of-truth":[{"id":"assertion.concept.wikipedia.deflationary-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deflationary theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deflationary theory of truth\", CC BY-SA 4.0) states: In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \"truth\" to such a statement.","support":[{"end":402,"quote":"In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \\\"truth\\\" to such a statement.","source_id":"wikipedia.article.deflationary-theory-of-truth","source_sha256":"f3a56493e1e8e87c14325a3928cf6cd23bff54ad890fbde2b084a3c22511cb3b","start":114}],"target_id":"concept.wikipedia.deflationary-theory-of-truth","target_kind":"node","target_sha256":"052bbf054ea86e9389ded881716c2176c064379d91cc90815375623ce54acd87"}],"concept.wikipedia.degeneracy-mathematics":[{"id":"assertion.concept.wikipedia.degeneracy-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Degeneracy (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Degeneracy (mathematics)\", CC BY-SA 4.0) states: In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \"degeneracy\" is the condition of being a degenerate case.","support":[{"end":343,"quote":"In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \\\"degeneracy\\\" is the condition of being a degenerate case.","source_id":"wikipedia.article.degeneracy-mathematics","source_sha256":"8998ea1e669aa070871ddd6d0dd47f3de417432f9ac2bf5b2261f8a04946b6c8","start":110}],"target_id":"concept.wikipedia.degeneracy-mathematics","target_kind":"node","target_sha256":"6cd249706668c8b829dc97d0274571773df81fc79da7e5278502861deb6d269e"}],"concept.wikipedia.deliberative-indispensability-argument":[{"id":"assertion.concept.wikipedia.deliberative-indispensability-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deliberative indispensability argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deliberative indispensability argument\", CC BY-SA 4.0) states: The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","support":[{"end":291,"quote":"The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","source_id":"wikipedia.article.deliberative-indispensability-argument","source_sha256":"e51539e102a3503ed8287811ab87036d3888926cafc49d491665b52765d78393","start":126}],"target_id":"concept.wikipedia.deliberative-indispensability-argument","target_kind":"node","target_sha256":"85894e7122e6527164bc52dea8d512965f60d36663da98baa89fc027b0788cc7"}],"concept.wikipedia.delta-functor":[{"id":"assertion.concept.wikipedia.delta-functor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Delta-functor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Delta-functor\", CC BY-SA 4.0) states: In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","support":[{"end":319,"quote":"In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","source_id":"wikipedia.article.delta-functor","source_sha256":"349bb15b99b0801df86095d18acf9de9f4ed84556d2d8cc26b2d15b9bd28dd59","start":101}],"target_id":"concept.wikipedia.delta-functor","target_kind":"node","target_sha256":"f3cdd1d59b7d3f26c52c534b8d4b6f171d44f89b848460461e2580597f5841b3"}],"concept.wikipedia.delusion":[{"id":"assertion.concept.wikipedia.delusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Delusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Delusion\", CC BY-SA 4.0) states: A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","support":[{"end":187,"quote":"A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","source_id":"wikipedia.article.delusion","source_sha256":"4fb87d8c03c18a179dc9c3f9ed569f571e728be14f0030ab84bdb7bb3d7a5917","start":94}],"target_id":"concept.wikipedia.delusion","target_kind":"node","target_sha256":"7e3de2a4622cda73c0c2a396b341663458ae732ae51bd71cc9cb5fd7090e3c25"}],"concept.wikipedia.demand-factor":[{"id":"assertion.concept.wikipedia.demand-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Demand factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Demand factor\", CC BY-SA 4.0) states: In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","support":[{"end":330,"quote":"In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","source_id":"wikipedia.article.demand-factor","source_sha256":"32e746f94c33be2bcdf42204125b98476c9b535d30e9f6f9db4add25f88da7bb","start":98}],"target_id":"concept.wikipedia.demand-factor","target_kind":"node","target_sha256":"0cc82b3d514471a15816c226d45af791bedc9c4902caf274698d22aeb09fbcfb"}],"concept.wikipedia.dempster-shafer-theory":[{"id":"assertion.concept.wikipedia.dempster-shafer-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dempster–Shafer theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dempster–Shafer theory\", CC BY-SA 4.0) states: The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","support":[{"end":380,"quote":"The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","source_id":"wikipedia.article.dempster-shafer-theory","source_sha256":"df43a3d221b5cdb7786bc19035d35650ffbf10ed7aaa9e4fa809c81e56d61706","start":108}],"target_id":"concept.wikipedia.dempster-shafer-theory","target_kind":"node","target_sha256":"6420b10992b6f76e2434edd57a53f2ade4e9e77c49ded2af5896b802b87a5f02"}],"concept.wikipedia.denotation":[{"id":"assertion.concept.wikipedia.denotation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denotation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denotation\", CC BY-SA 4.0) states: In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","support":[{"end":198,"quote":"In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","source_id":"wikipedia.article.denotation","source_sha256":"722af92245903b787796355ffe96304ac0218f8159cd2ac7177356e7f2c42a2a","start":96}],"target_id":"concept.wikipedia.denotation","target_kind":"node","target_sha256":"ce1a89df0cb9e2b3fbf1c2bb14fc5a2dcf7254c819a8e7702dc5e9a0d879743c"}],"concept.wikipedia.denying-the-antecedent":[{"id":"assertion.concept.wikipedia.denying-the-antecedent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denying the antecedent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denying the antecedent\", CC BY-SA 4.0) states: Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","support":[{"end":286,"quote":"Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","source_id":"wikipedia.article.denying-the-antecedent","source_sha256":"271131b058ffec01a4ed39927d0369a5210b92e197394309688d19ca28052278","start":108}],"target_id":"concept.wikipedia.denying-the-antecedent","target_kind":"node","target_sha256":"18b38ad78454e98324fae7e72d3cf4ba76b9a9b4e86984b86de0ca67b2bb22b6"}],"concept.wikipedia.denying-the-correlative":[{"id":"assertion.concept.wikipedia.denying-the-correlative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denying the correlative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denying the correlative\", CC BY-SA 4.0) states: The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","support":[{"end":225,"quote":"The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","source_id":"wikipedia.article.denying-the-correlative","source_sha256":"16fb4a24c7435e76f7a61e2f62901cc3538ebf3060e663c9d86f33d6e7a161f5","start":109}],"target_id":"concept.wikipedia.denying-the-correlative","target_kind":"node","target_sha256":"b3d48bc21da1df8762b2a6f9bc9824989aebf78cad809905464a36a251e40e53"}],"concept.wikipedia.deontic-logic":[{"id":"assertion.concept.wikipedia.deontic-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deontic logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deontic logic\", CC BY-SA 4.0) states: Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","support":[{"end":218,"quote":"Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","source_id":"wikipedia.article.deontic-logic","source_sha256":"61f4b3001bfb9dd707df87e2ea23882b48c2e528949953224782ac70426ad487","start":100}],"target_id":"concept.wikipedia.deontic-logic","target_kind":"node","target_sha256":"3538026ca9d79909e590f4a41325e57582591cc9f3c20908e4c484bda0d1a9fe"}],"concept.wikipedia.deriaz-turbine":[{"id":"assertion.concept.wikipedia.deriaz-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deriaz turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deriaz turbine\", CC BY-SA 4.0) states: The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","support":[{"end":218,"quote":"The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","source_id":"wikipedia.article.deriaz-turbine","source_sha256":"afd1aee5124b04c46bcf842ec6e3783563022c2695e31f1edafe0a04770a77ef","start":102}],"target_id":"concept.wikipedia.deriaz-turbine","target_kind":"node","target_sha256":"536f2d80745303572f0a87994056138f6216a82c737e7cc8e7cad2431c37e7f8"}],"concept.wikipedia.derivative-of-the-exponential-map":[{"id":"assertion.concept.wikipedia.derivative-of-the-exponential-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Derivative of the exponential map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Derivative of the exponential map\", CC BY-SA 4.0) states: In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","support":[{"end":314,"quote":"In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","source_id":"wikipedia.article.derivative-of-the-exponential-map","source_sha256":"2f0bfe666d1e820fb558fdb17555101f7d530d81507ca15d5317db2e77cb3931","start":121}],"target_id":"concept.wikipedia.derivative-of-the-exponential-map","target_kind":"node","target_sha256":"e1a35b5ea6cf7951ed1a7d36a5a60b5a0b4e8a75649a2a85207628a0c558eba7"}],"concept.wikipedia.desander":[{"id":"assertion.concept.wikipedia.desander","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Desander as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Desander\", CC BY-SA 4.0) states: Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","support":[{"end":246,"quote":"Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","source_id":"wikipedia.article.desander","source_sha256":"4e93ce3f9e2c69fc9b90ef1cff00763fe8f0a3618ef30cd54bf3fc1297e6c89f","start":96}],"target_id":"concept.wikipedia.desander","target_kind":"node","target_sha256":"5b47eb0271807007a22a1117d99e7d1bece7c693dddf6849715976a670a8d82a"}],"concept.wikipedia.design-based-research":[{"id":"assertion.concept.wikipedia.design-based-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design-based research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design-based research\", CC BY-SA 4.0) states: Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","support":[{"end":251,"quote":"Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","source_id":"wikipedia.article.design-based-research","source_sha256":"c3982881f8fcbb59ecb465d3f607cb1b1dee18c5cfaceeda7c5118336ffa402b","start":109}],"target_id":"concept.wikipedia.design-based-research","target_kind":"node","target_sha256":"bd4d6f764e426e1fff9138d0b1f96c7be986afa5d15bf8a421ed47d58b8eb8da"}],"concept.wikipedia.design-manufacture-service":[{"id":"assertion.concept.wikipedia.design-manufacture-service","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design manufacture service as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design manufacture service\", CC BY-SA 4.0) states: Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","support":[{"end":329,"quote":"Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","source_id":"wikipedia.article.design-manufacture-service","source_sha256":"b9402c8189631ec667c36e687c38499478cd2e2ffc2664b03469f52a5864a706","start":114}],"target_id":"concept.wikipedia.design-manufacture-service","target_kind":"node","target_sha256":"851d93d428e6039ec31fcf49003ed1cdd8d010aadd928f20557499aa314054f6"}],"concept.wikipedia.design-of-experiments":[{"id":"assertion.concept.wikipedia.design-of-experiments","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design of experiments as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design of experiments\", CC BY-SA 4.0) states: The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","support":[{"end":326,"quote":"The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","source_id":"wikipedia.article.design-of-experiments","source_sha256":"0bd9f343c9c53ea6841a31930541ba9ecc55110dd65ca61e8a14073d3b0be418","start":105}],"target_id":"concept.wikipedia.design-of-experiments","target_kind":"node","target_sha256":"2ee6cb9e5838d1c93755b69587e4b6ad95e97c4d3345ff54fd0fac4114df2ca4"}],"concept.wikipedia.design-rationale":[{"id":"assertion.concept.wikipedia.design-rationale","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design rationale as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design rationale\", CC BY-SA 4.0) states: A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","support":[{"end":225,"quote":"A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","source_id":"wikipedia.article.design-rationale","source_sha256":"90afdc66b2d5474a4656a6d15b13df7d71fbf6df1e447dcd8627bf9d926b5a97","start":104}],"target_id":"concept.wikipedia.design-rationale","target_kind":"node","target_sha256":"7e66f4f1777a629e927d92e295d691ef8971b79cb56bf08ad554e8bcd8e3b627"}],"concept.wikipedia.design-science":[{"id":"assertion.concept.wikipedia.design-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design science\", CC BY-SA 4.0) states: Design science refers to a scientific, i.e. rational and systematic, approach to designing.","support":[{"end":192,"quote":"Design science refers to a scientific, i.e. rational and systematic, approach to designing.","source_id":"wikipedia.article.design-science","source_sha256":"a8d950c65246de6df721be8a21de12ac9a01dba5be97cabba1b02dd7bb762369","start":101}],"target_id":"concept.wikipedia.design-science","target_kind":"node","target_sha256":"b6b3a93fc6c896fd1f3ab2ab5e30af70426bd5acb806747b53309cb700733e30"}],"concept.wikipedia.detent":[{"id":"assertion.concept.wikipedia.detent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Detent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Detent\", CC BY-SA 4.0) states: A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","support":[{"end":192,"quote":"A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","source_id":"wikipedia.article.detent","source_sha256":"c3fd773adabc6d181c61773f1bf1d76be8555f8d157223133c0555f1b4e1e6d3","start":93}],"target_id":"concept.wikipedia.detent","target_kind":"node","target_sha256":"3a44be558391910b59fa7b06d60b86bb0b20379908744369c686807aad0dbcbb"}],"concept.wikipedia.diagrammatic-reasoning":[{"id":"assertion.concept.wikipedia.diagrammatic-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diagrammatic reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diagrammatic reasoning\", CC BY-SA 4.0) states: Diagrammatic reasoning is reasoning by means of visual representations.","support":[{"end":180,"quote":"Diagrammatic reasoning is reasoning by means of visual representations.","source_id":"wikipedia.article.diagrammatic-reasoning","source_sha256":"620772faeba15b309cbd48d3831d69d0b18edccb68ef4605fa9c1d156327aba7","start":109}],"target_id":"concept.wikipedia.diagrammatic-reasoning","target_kind":"node","target_sha256":"f2fe3e9ed0330e1cf9ebbbfb0880c09f2a4fc4525f19bc188dd6fed10f5975d9"}],"concept.wikipedia.diairesis":[{"id":"assertion.concept.wikipedia.diairesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diairesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diairesis\", CC BY-SA 4.0) states: Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \"division\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","support":[{"end":301,"quote":"Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \\\"division\\\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","source_id":"wikipedia.article.diairesis","source_sha256":"9770c982dc28f9cea71966e18c0ef8437a003717a29b47868b1a9906f3cbe3d3","start":96}],"target_id":"concept.wikipedia.diairesis","target_kind":"node","target_sha256":"e29326b6fc65443667c6104c387fcce80698fe259aea1e4ea83af4be34714a41"}],"concept.wikipedia.dialectica-interpretation":[{"id":"assertion.concept.wikipedia.dialectica-interpretation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dialectica interpretation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dialectica interpretation\", CC BY-SA 4.0) states: In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T. It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","support":[{"end":396,"quote":"In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T.  It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","source_id":"wikipedia.article.dialectica-interpretation","source_sha256":"1527c923d331e1cf828bdbcc9b2a463ccce10d5a2320689812e2a531f204d907","start":113}],"target_id":"concept.wikipedia.dialectica-interpretation","target_kind":"node","target_sha256":"aab96d9d7e41f89ce671c03134b34afd768f9686f31cd204b421384184513eee"}],"concept.wikipedia.dialectical-logic":[{"id":"assertion.concept.wikipedia.dialectical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dialectical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dialectical logic\", CC BY-SA 4.0) states: Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","support":[{"end":273,"quote":"Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","source_id":"wikipedia.article.dialectical-logic","source_sha256":"4fa4c10d42b7d2d6e3cc759d34bd1dded87e6b30cb60e9d86f702f42731ea3c4","start":105}],"target_id":"concept.wikipedia.dialectical-logic","target_kind":"node","target_sha256":"a01ca168350a73eb57e1354f4325fcf3df0ade7c2bc9e4bce4a0a81bc1f90721"}],"concept.wikipedia.diaphragm-valve":[{"id":"assertion.concept.wikipedia.diaphragm-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diaphragm valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diaphragm valve\", CC BY-SA 4.0) states: A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","support":[{"end":281,"quote":"A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","source_id":"wikipedia.article.diaphragm-valve","source_sha256":"ebddee7251c7eafd08cc3b842ca2cd6ff6ada3d4bb3250b48add024c43b8d73d","start":102}],"target_id":"concept.wikipedia.diaphragm-valve","target_kind":"node","target_sha256":"b530082f36172c15bb2505c7c634325113082d94c2e6b404d237c64b78d1f280"}],"concept.wikipedia.dieudonn-plank":[{"id":"assertion.concept.wikipedia.dieudonn-plank","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dieudonné plank as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dieudonné plank\", CC BY-SA 4.0) states: In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","support":[{"end":202,"quote":"In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","source_id":"wikipedia.article.dieudonn-plank","source_sha256":"2dede73b7275fb6d5aaa608492b18c373532b517bdb3901f4d0e35561aea1498","start":103}],"target_id":"concept.wikipedia.dieudonn-plank","target_kind":"node","target_sha256":"07d49dd574ddf133087791232fce193ccf466e7fef107fe281c94dd45fd6af0a"}],"concept.wikipedia.differential-calculus":[{"id":"assertion.concept.wikipedia.differential-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential calculus\", CC BY-SA 4.0) states: In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","support":[{"end":220,"quote":"In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","source_id":"wikipedia.article.differential-calculus","source_sha256":"e0e2a41e92edbf9f79de7994e7161edd93d6432acfef8d53d06c87e59154d085","start":106}],"target_id":"concept.wikipedia.differential-calculus","target_kind":"node","target_sha256":"bc025ab70b9a7b1c9b61c3c38eb7253838909770db5c16966ab3fa98984ceebe"}],"concept.wikipedia.differential-effects":[{"id":"assertion.concept.wikipedia.differential-effects","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential effects as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential effects\", CC BY-SA 4.0) states: Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","support":[{"end":343,"quote":"Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","source_id":"wikipedia.article.differential-effects","source_sha256":"43152afc3764711830d4a28648502032c35bdbb9a075a83584595f22a1657376","start":108}],"target_id":"concept.wikipedia.differential-effects","target_kind":"node","target_sha256":"818c773062e0d7da693df65e446c098a0510748b81aa1c75602beb7b0a4f863c"}],"concept.wikipedia.differential-mathematics":[{"id":"assertion.concept.wikipedia.differential-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential (mathematics)\", CC BY-SA 4.0) states: In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","support":[{"end":310,"quote":"In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","source_id":"wikipedia.article.differential-mathematics","source_sha256":"ccf51e50bd4154dfac7a257af53265ea07a206788f31f2ea68fc5d107616659d","start":112}],"target_id":"concept.wikipedia.differential-mathematics","target_kind":"node","target_sha256":"f51cea258e8fd243e34251f7b162f7d657aa2c617543ad502bf9868858e6548e"}],"concept.wikipedia.differential-mechanical-device":[{"id":"assertion.concept.wikipedia.differential-mechanical-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential (mechanical device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential (mechanical device)\", CC BY-SA 4.0) states: A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","support":[{"end":277,"quote":"A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","source_id":"wikipedia.article.differential-mechanical-device","source_sha256":"027d1817aa580bc3b0a304a424aec76531aac3e0a10311e084204703fdc565b7","start":118}],"target_id":"concept.wikipedia.differential-mechanical-device","target_kind":"node","target_sha256":"7520ff685c9e063cdf35577b5cc02a42473586a8b5dd47791df0ecdd47437026"}],"concept.wikipedia.digifold":[{"id":"assertion.concept.wikipedia.digifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Digifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Digifold\", CC BY-SA 4.0) states: Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","support":[{"end":203,"quote":"Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","source_id":"wikipedia.article.digifold","source_sha256":"3b0552d3803649888ef41f7262ce69c5e1eca5487cf811367e8e821ccf61d9b1","start":96}],"target_id":"concept.wikipedia.digifold","target_kind":"node","target_sha256":"72973d799936608b4a9a692f680346a58c26318c9434c5ee84418b66f43f4971"}],"concept.wikipedia.digital-micromirror-device":[{"id":"assertion.concept.wikipedia.digital-micromirror-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Digital micromirror device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Digital micromirror device\", CC BY-SA 4.0) states: The digital micromirror device, or DMD, is the microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","support":[{"end":321,"quote":"The digital micromirror device, or DMD, is the  microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","source_id":"wikipedia.article.digital-micromirror-device","source_sha256":"cf1749bab4e5125778c811d42402194b7da0232aff4b51f5342ef965d219d307","start":114}],"target_id":"concept.wikipedia.digital-micromirror-device","target_kind":"node","target_sha256":"a32e1690ac983dbd7dddc02c364c7cfb85181998a019b3a48ba3c6fc7cdbbe30"}],"concept.wikipedia.dilemma":[{"id":"assertion.concept.wikipedia.dilemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dilemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dilemma\", CC BY-SA 4.0) states: A dilemma (from Ancient Greek δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","support":[{"end":265,"quote":"A dilemma (from Ancient Greek  δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","source_id":"wikipedia.article.dilemma","source_sha256":"b5ebb108d3dbc507ff3ec0a3896fea636f8c7bf7d9e3c7c808bcab936b951f9b","start":94}],"target_id":"concept.wikipedia.dilemma","target_kind":"node","target_sha256":"65eb75f224e52bbf3ea36dc5f9e6729248f22dcdf777097c18c5cb01611420ce"}],"concept.wikipedia.diode":[{"id":"assertion.concept.wikipedia.diode","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diode as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diode\", CC BY-SA 4.0) states: A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","support":[{"end":219,"quote":"A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","source_id":"wikipedia.article.diode","source_sha256":"c733c46d0d864ed5ae84f4cc129b810a5ac289666c9fa9cc99f67e1c00b32c28","start":89}],"target_id":"concept.wikipedia.diode","target_kind":"node","target_sha256":"b079509aef49ebc509c646a138130485140ceb05a35dc550e223b457562bce1e"}],"concept.wikipedia.direct-and-indirect-realism":[{"id":"assertion.concept.wikipedia.direct-and-indirect-realism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Direct and indirect realism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Direct and indirect realism\", CC BY-SA 4.0) states: In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","support":[{"end":317,"quote":"In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","source_id":"wikipedia.article.direct-and-indirect-realism","source_sha256":"7345865d78e88f1e59861a9aada9385979e47e0e5b63142f3df520daa248ae64","start":113}],"target_id":"concept.wikipedia.direct-and-indirect-realism","target_kind":"node","target_sha256":"db015564ecf6bd558713692aa8b9b21edb275b895bd435e4eca20444faffab19"}],"concept.wikipedia.directed-assembly-of-micro-and-nano-structures":[{"id":"assertion.concept.wikipedia.directed-assembly-of-micro-and-nano-structures","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Directed assembly of micro- and nano-structures as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Directed assembly of micro- and nano-structures\", CC BY-SA 4.0) states: Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","support":[{"end":249,"quote":"Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","source_id":"wikipedia.article.directed-assembly-of-micro-and-nano-structures","source_sha256":"e1787d906b7e252326fd253e81f86147a197491d4f18eddc14b7d454ed32d737","start":135}],"target_id":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","target_kind":"node","target_sha256":"b864f059b1756ead699deeb815e66421b597d22f698c8b9bdf2ed0321c987e6e"}],"concept.wikipedia.dirichlet-average":[{"id":"assertion.concept.wikipedia.dirichlet-average","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dirichlet average as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dirichlet average\", CC BY-SA 4.0) states: Dirichlet averages are averages of functions under the Dirichlet distribution.","support":[{"end":183,"quote":"Dirichlet averages are averages of functions under the Dirichlet distribution.","source_id":"wikipedia.article.dirichlet-average","source_sha256":"a7cbbddd818a707b3d3b2185ca477cab1976011111eeb97469f090108846842b","start":105}],"target_id":"concept.wikipedia.dirichlet-average","target_kind":"node","target_sha256":"2111dae0d656d82af01f6c018c795f45430a3adee7c5f5e641af3e5597fefdf3"}],"concept.wikipedia.discontinuous-group":[{"id":"assertion.concept.wikipedia.discontinuous-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discontinuous group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discontinuous group\", CC BY-SA 4.0) states: A discontinuous group is a mathematical concept relating to mappings in topological space.","support":[{"end":197,"quote":"A discontinuous group is a mathematical concept relating to mappings in topological space.","source_id":"wikipedia.article.discontinuous-group","source_sha256":"fe08623c741418107a81dd7a3e6b2a5a72d6e83720f5c50a144f954755689c00","start":107}],"target_id":"concept.wikipedia.discontinuous-group","target_kind":"node","target_sha256":"896286286799d9f2c17914a3e7b0b908eb00aa44998811d38559dca53467cf5a"}],"concept.wikipedia.discourse-ethics":[{"id":"assertion.concept.wikipedia.discourse-ethics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discourse ethics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discourse ethics\", CC BY-SA 4.0) states: Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","support":[{"end":253,"quote":"Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","source_id":"wikipedia.article.discourse-ethics","source_sha256":"06da91cae877a098283875fd9330491d793809db1701c242a9969adba7cd98ee","start":103}],"target_id":"concept.wikipedia.discourse-ethics","target_kind":"node","target_sha256":"cbda3b1fcffd83629bfc5de2cb8c966596e7e9bf90a26a42d59b5f2e7aef9142"}],"concept.wikipedia.discovery-science":[{"id":"assertion.concept.wikipedia.discovery-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discovery science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discovery science\", CC BY-SA 4.0) states: Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","support":[{"end":311,"quote":"Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","source_id":"wikipedia.article.discovery-science","source_sha256":"6a3be3095d427ded9ed03865e00f5fc17100ddd0b31502b6f9237f8f79459892","start":104}],"target_id":"concept.wikipedia.discovery-science","target_kind":"node","target_sha256":"b517392ce2020c389c827a58b8538ee5d6bce759b5a95ec763c197007c8f2fc3"}],"concept.wikipedia.discrete-two-point-space":[{"id":"assertion.concept.wikipedia.discrete-two-point-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discrete two-point space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discrete two-point space\", CC BY-SA 4.0) states: In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","support":[{"end":242,"quote":"In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","source_id":"wikipedia.article.discrete-two-point-space","source_sha256":"1f995a25b9aa665dcc69cf9b098e3430a5be4b8ac8c0373310e6fe834722aba5","start":112}],"target_id":"concept.wikipedia.discrete-two-point-space","target_kind":"node","target_sha256":"acec32794da70f61138ee8d22e9aa3a0897958d94c8be52eebdd31973b19506a"}],"concept.wikipedia.disinformation-research":[{"id":"assertion.concept.wikipedia.disinformation-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disinformation research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disinformation research\", CC BY-SA 4.0) states: Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","support":[{"end":316,"quote":"Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","source_id":"wikipedia.article.disinformation-research","source_sha256":"7b71d63e888a19c724c302e24a066546065f5421279a56fdcbb61a98f585acba","start":111}],"target_id":"concept.wikipedia.disinformation-research","target_kind":"node","target_sha256":"149403b9ce4aa15873041099da6a9f3c3df73f58ec57ef44631b5d71f2ded488"}],"concept.wikipedia.disjunctive-sequence":[{"id":"assertion.concept.wikipedia.disjunctive-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disjunctive sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disjunctive sequence\", CC BY-SA 4.0) states: A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","support":[{"end":250,"quote":"A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","source_id":"wikipedia.article.disjunctive-sequence","source_sha256":"f05536b26adeadad5a4d6f1a08df29e9819ef3110999abd099802c948dd4da6a","start":107}],"target_id":"concept.wikipedia.disjunctive-sequence","target_kind":"node","target_sha256":"87e2b51bab793f8c7f72eb010746efec0815383bc87f076c0c1d1e1c8790038c"}],"concept.wikipedia.dispersed-knowledge":[{"id":"assertion.concept.wikipedia.dispersed-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dispersed knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dispersed knowledge\", CC BY-SA 4.0) states: Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","support":[{"end":274,"quote":"Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","source_id":"wikipedia.article.dispersed-knowledge","source_sha256":"8390bbba2fb2f578ee44c3d398a4f9da802f3d419cea7e368e4e344ec5fe1c2d","start":105}],"target_id":"concept.wikipedia.dispersed-knowledge","target_kind":"node","target_sha256":"fdaecc5b1e983a6a16f0e2ecdbe27fa17a40541a10b0e193ee73b3b1239d0b12"}],"concept.wikipedia.disquotational-principle":[{"id":"assertion.concept.wikipedia.disquotational-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disquotational principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disquotational principle\", CC BY-SA 4.0) states: The disquotational principle is a philosophical principle which holds that a rational speaker will accept \"p\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","support":[{"end":362,"quote":"The disquotational principle is a philosophical principle which holds that a rational speaker will accept \\\"p\\\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","source_id":"wikipedia.article.disquotational-principle","source_sha256":"0706ad47d14ce1f0366a32f29fb631a0ee4facc9ebd487b39a983a9ab0c3859c","start":112}],"target_id":"concept.wikipedia.disquotational-principle","target_kind":"node","target_sha256":"a468fe9dbcbc14d622ca41ac5a1c960dd564434b96a05e46655d9cb18edb5100"}],"concept.wikipedia.dissoi-logoi":[{"id":"assertion.concept.wikipedia.dissoi-logoi","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dissoi logoi as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dissoi logoi\", CC BY-SA 4.0) states: The Dissoi logoi (Greek δισσοὶ λόγοι, \"contrasting arguments\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","support":[{"end":314,"quote":"The Dissoi logoi (Greek δισσοὶ λόγοι, \\\"contrasting arguments\\\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","source_id":"wikipedia.article.dissoi-logoi","source_sha256":"ea06f1b1cb9fc3e589c3d65be9c7f413b2554ad48f1eaa61bb69579768b504c4","start":100}],"target_id":"concept.wikipedia.dissoi-logoi","target_kind":"node","target_sha256":"7155e1a16e31525fcd53a001ce66b63ab83aa6cbb15bf3742c4a2166e273f56d"}],"concept.wikipedia.distinction-bias":[{"id":"assertion.concept.wikipedia.distinction-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distinction bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distinction bias\", CC BY-SA 4.0) states: Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","support":[{"end":281,"quote":"Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","source_id":"wikipedia.article.distinction-bias","source_sha256":"9656dddd7b3b570f71586b2c0b240a72ca6657e08fc1fcf5c70069e6e9abc96e","start":104}],"target_id":"concept.wikipedia.distinction-bias","target_kind":"node","target_sha256":"496f3836bc72e1de56106709b01b1090c4533d97cc37d3c50ef3387d25b6b6c8"}],"concept.wikipedia.distinction-without-a-difference":[{"id":"assertion.concept.wikipedia.distinction-without-a-difference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distinction without a difference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distinction without a difference\", CC BY-SA 4.0) states: A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","support":[{"end":297,"quote":"A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","source_id":"wikipedia.article.distinction-without-a-difference","source_sha256":"95d53a7e34ff81023980b77dc34ef843525b49ba6c4f6e81c52b631220161d79","start":119}],"target_id":"concept.wikipedia.distinction-without-a-difference","target_kind":"node","target_sha256":"e4727cd34c46e035b3c2ab64d2d758b78bcffe71110721e77c5e247a954fbe02"}],"concept.wikipedia.distributed-parameter-system":[{"id":"assertion.concept.wikipedia.distributed-parameter-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distributed parameter system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distributed parameter system\", CC BY-SA 4.0) states: In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","support":[{"end":261,"quote":"In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","source_id":"wikipedia.article.distributed-parameter-system","source_sha256":"c6c2bb44d9c3695ab90274a54a72e5d33c65ec08d3f956e7068520ab7956f788","start":115}],"target_id":"concept.wikipedia.distributed-parameter-system","target_kind":"node","target_sha256":"88a210a5a49c1f4fff46b9525f933b6eb08b1a15f3ed607918ea8c79041e298b"}],"concept.wikipedia.distributive-lattice":[{"id":"assertion.concept.wikipedia.distributive-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distributive lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distributive lattice\", CC BY-SA 4.0) states: In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","support":[{"end":227,"quote":"In mathematics,  a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","source_id":"wikipedia.article.distributive-lattice","source_sha256":"f7b843d6cd7ff19e95e14c2adcd4de5310f60e35e7a1b53d68bfc5c0d31cffba","start":106}],"target_id":"concept.wikipedia.distributive-lattice","target_kind":"node","target_sha256":"842d448fbdb78224c91618b4c373ce2520ef758d3206953ae624fa8fe5968c01"}],"concept.wikipedia.dn-factor":[{"id":"assertion.concept.wikipedia.dn-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"DN factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"DN factor\", CC BY-SA 4.0) states: DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","support":[{"end":248,"quote":"DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","source_id":"wikipedia.article.dn-factor","source_sha256":"25c0de964e1c3ab0ef654dc504cf5df473f4044187fe3eb2f56683e5934c420c","start":97}],"target_id":"concept.wikipedia.dn-factor","target_kind":"node","target_sha256":"47dd2420b876f7fece5d13715635dbdbfd4134e99aad0c7f09d4bd40a5096a97"}],"concept.wikipedia.doctrine":[{"id":"assertion.concept.wikipedia.doctrine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Doctrine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Doctrine\", CC BY-SA 4.0) states: Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","support":[{"end":343,"quote":"Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","source_id":"wikipedia.article.doctrine","source_sha256":"7392315f5b42e520f4597ca61a78ebefad3baddbf4fd50e17f77c95f0a3a4287","start":96}],"target_id":"concept.wikipedia.doctrine","target_kind":"node","target_sha256":"1ee769429880146bfd160033e23a2eac0eb79683ab80d365a3020cbc4d4398d7"}],"concept.wikipedia.dogma":[{"id":"assertion.concept.wikipedia.dogma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dogma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dogma\", CC BY-SA 4.0) states: Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","support":[{"end":190,"quote":"Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","source_id":"wikipedia.article.dogma","source_sha256":"7497f74f2e164aae71f7e710401eefb505dda6a309cc75ce888bf39fa64dfc1b","start":90}],"target_id":"concept.wikipedia.dogma","target_kind":"node","target_sha256":"e7214c0b4f0915df7810d3b71682ce5f525de3024fafb06b38c2f1791cbcbd0d"}],"concept.wikipedia.dominance-order":[{"id":"assertion.concept.wikipedia.dominance-order","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dominance order as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dominance order\", CC BY-SA 4.0) states: In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","support":[{"end":462,"quote":"In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","source_id":"wikipedia.article.dominance-order","source_sha256":"f4c0bb1c1dd68fb1a0501568574f9319014e0988aa91392106d3a50dd7a5888c","start":103}],"target_id":"concept.wikipedia.dominance-order","target_kind":"node","target_sha256":"d532e07a5201ff369da665a3b327fddd1179bd538ba413d9a58acccebcebbddd"}],"concept.wikipedia.double-articulation":[{"id":"assertion.concept.wikipedia.double-articulation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double articulation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double articulation\", CC BY-SA 4.0) states: In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","support":[{"end":401,"quote":"In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","source_id":"wikipedia.article.double-articulation","source_sha256":"79eda1ea8239973831af175437c2b232602229f8e42b35b9b8cb918aa0fab1fd","start":106}],"target_id":"concept.wikipedia.double-articulation","target_kind":"node","target_sha256":"ebc83ba945cbf3298023b0106d001a8e8b599bbd268a42cbe25ebddbe5c4ac91"}],"concept.wikipedia.double-counting-fallacy":[{"id":"assertion.concept.wikipedia.double-counting-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double counting (fallacy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double counting (fallacy)\", CC BY-SA 4.0) states: Double counting is a fallacy in reasoning.","support":[{"end":154,"quote":"Double counting is a fallacy in reasoning.","source_id":"wikipedia.article.double-counting-fallacy","source_sha256":"2ced0717457af99d989363048fe09f6111187f63b3382a057a68ca1b2283c275","start":112}],"target_id":"concept.wikipedia.double-counting-fallacy","target_kind":"node","target_sha256":"4a59156643ce6b8a25c837fb9b4c86897659d3a6f61b9b706c3f2bc9e1200f73"}],"concept.wikipedia.double-hermeneutic":[{"id":"assertion.concept.wikipedia.double-hermeneutic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double hermeneutic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double hermeneutic\", CC BY-SA 4.0) states: The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \"lay\" concepts and those from the social sciences have a two-way relationship.","support":[{"end":279,"quote":"The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \\\"lay\\\" concepts and those from the social sciences have a two-way relationship.","source_id":"wikipedia.article.double-hermeneutic","source_sha256":"0031316c616bb204f8a1414db7a70cca9ffcc7a6d54db9eee82d328703b8caab","start":105}],"target_id":"concept.wikipedia.double-hermeneutic","target_kind":"node","target_sha256":"68cfb667015640c151d7572dfe4572509a110a71652fa55e9d69819a3557f932"}],"concept.wikipedia.downstream-manufacturing":[{"id":"assertion.concept.wikipedia.downstream-manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Downstream (manufacturing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Downstream (manufacturing)\", CC BY-SA 4.0) states: Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","support":[{"end":228,"quote":"Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","source_id":"wikipedia.article.downstream-manufacturing","source_sha256":"742a28375021c943356a995ec52b1d584bc729d2f3a85f8e442b0345cd6e32bc","start":113}],"target_id":"concept.wikipedia.downstream-manufacturing","target_kind":"node","target_sha256":"06b2cab54c3aa7584bbbddddabe2f3ebbb6c965380d314c7aae00ac3e4caded2"}],"concept.wikipedia.doxastic-logic":[{"id":"assertion.concept.wikipedia.doxastic-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Doxastic logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Doxastic logic\", CC BY-SA 4.0) states: Doxastic logic is a type of logic concerned with reasoning about beliefs.","support":[{"end":175,"quote":"Doxastic logic is a type of logic concerned with reasoning about beliefs.","source_id":"wikipedia.article.doxastic-logic","source_sha256":"0894eedf6b163e9e1d3de71da2ec1804826c185e4a1599e8ac3686c9213c2949","start":102}],"target_id":"concept.wikipedia.doxastic-logic","target_kind":"node","target_sha256":"078e4cf6627bcccb11ae7d60c4b5d5831009e41c4049e185675303f85a575b85"}],"concept.wikipedia.drill-bit-sizes":[{"id":"assertion.concept.wikipedia.drill-bit-sizes","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drill bit sizes as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drill bit sizes\", CC BY-SA 4.0) states: Drill bits are the cutting tools of drilling machines.","support":[{"end":156,"quote":"Drill bits are the cutting tools of drilling machines.","source_id":"wikipedia.article.drill-bit-sizes","source_sha256":"2518e1f05e8e631b9a26dc3c0dbdc13c545099177c526389b17f401846c982aa","start":102}],"target_id":"concept.wikipedia.drill-bit-sizes","target_kind":"node","target_sha256":"2bafb558eeb1a19fb5fa4719e16a3e294cf07eb5c9f940ce839c44572d5947d9"}],"concept.wikipedia.drilling":[{"id":"assertion.concept.wikipedia.drilling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drilling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drilling\", CC BY-SA 4.0) states: Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","support":[{"end":209,"quote":"Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","source_id":"wikipedia.article.drilling","source_sha256":"84d384ad821dfc64a18019513d7ec662472d857874b7a1230b58e6912d208788","start":94}],"target_id":"concept.wikipedia.drilling","target_kind":"node","target_sha256":"a2bd781051360d68d5e4e79fea71274cbbe0e014aee074eccd9af1c1441ccd37"}],"concept.wikipedia.drive-shaft":[{"id":"assertion.concept.wikipedia.drive-shaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drive shaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drive shaft\", CC BY-SA 4.0) states: A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","support":[{"end":482,"quote":"A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","source_id":"wikipedia.article.drive-shaft","source_sha256":"05732eaa3c8bd719d4c1a63da36263ebf85afe520eb0737a9d36abe47be7b3fb","start":98}],"target_id":"concept.wikipedia.drive-shaft","target_kind":"node","target_sha256":"1fb366fb1a0c2ad51aa510a861825b2d322cb12725e7852eb5a94867ef87f8a8"}],"concept.wikipedia.dry-lubricant":[{"id":"assertion.concept.wikipedia.dry-lubricant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dry lubricant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dry lubricant\", CC BY-SA 4.0) states: Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","support":[{"end":307,"quote":"Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","source_id":"wikipedia.article.dry-lubricant","source_sha256":"77ef49fa1f55eaedf5044483cb80b317ecbe213f6cffda260cd518ddce16e8f2","start":101}],"target_id":"concept.wikipedia.dry-lubricant","target_kind":"node","target_sha256":"9bd1e0cca27b2723b6b8ffd33beba8784466e8625063af472208790eeda8c431"}],"concept.wikipedia.dual-cone-and-polar-cone":[{"id":"assertion.concept.wikipedia.dual-cone-and-polar-cone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dual cone and polar cone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dual cone and polar cone\", CC BY-SA 4.0) states: Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","support":[{"end":210,"quote":"Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","source_id":"wikipedia.article.dual-cone-and-polar-cone","source_sha256":"d81701aea7411b090b33abc060a497f187e26f792521521f368acdb342c7e8c7","start":112}],"target_id":"concept.wikipedia.dual-cone-and-polar-cone","target_kind":"node","target_sha256":"33c4eb2d850a4949e072a32f9bdf4595bb9e20dc337533786645fc42299ef23d"}],"concept.wikipedia.dual-lattice":[{"id":"assertion.concept.wikipedia.dual-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dual lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dual lattice\", CC BY-SA 4.0) states: In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","support":[{"end":202,"quote":"In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","source_id":"wikipedia.article.dual-lattice","source_sha256":"3dd970b4f85b449fdf4ebfb2b450277c7714ba7062cc5ddbdacaf49a65e0fd55","start":99}],"target_id":"concept.wikipedia.dual-lattice","target_kind":"node","target_sha256":"1849291e7dc88ef4623ec4507e2d2654cc90c0e2aad4fb25e43737789c0829fb"}],"concept.wikipedia.duck-test":[{"id":"assertion.concept.wikipedia.duck-test","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Duck test as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Duck test\", CC BY-SA 4.0) states: The duck test is a frequently cited colloquial example of abductive reasoning.","support":[{"end":174,"quote":"The duck test is a frequently cited colloquial example of abductive reasoning.","source_id":"wikipedia.article.duck-test","source_sha256":"a77ee672e835f0b9f2c3b663fc12343b6d030478b9ea95221d69b8d27c13a83c","start":96}],"target_id":"concept.wikipedia.duck-test","target_kind":"node","target_sha256":"0aef027e6fed91a904b58836c432a5b3604e779b9d443859430a779d3b9fb073"}],"concept.wikipedia.dyadic-cubes":[{"id":"assertion.concept.wikipedia.dyadic-cubes","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dyadic cubes as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dyadic cubes\", CC BY-SA 4.0) states: In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","support":[{"end":329,"quote":"In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","source_id":"wikipedia.article.dyadic-cubes","source_sha256":"e2de8463849c3fec4c723f5b6ddf34823bb9288c9b69a81af2a0dedda3657e0e","start":100}],"target_id":"concept.wikipedia.dyadic-cubes","target_kind":"node","target_sha256":"d9529a71b992e5b5a5cc48c4e9b10ab8c46f50e9a60a4f23bbe2e6a496356181"}],"concept.wikipedia.dye-and-pry":[{"id":"assertion.concept.wikipedia.dye-and-pry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dye-and-pry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dye-and-pry\", CC BY-SA 4.0) states: Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","support":[{"end":340,"quote":"Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","source_id":"wikipedia.article.dye-and-pry","source_sha256":"3a332c6249f2ecc31d8ee2f27a8f645b6e0b3b138689c14b504e7ba88db2c528","start":99}],"target_id":"concept.wikipedia.dye-and-pry","target_kind":"node","target_sha256":"5f07f360e2fdfb1b608d60d886dfee0433b50adf3f435c95809b6b7056cc12f3"}],"concept.wikipedia.dynamic-semantics":[{"id":"assertion.concept.wikipedia.dynamic-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dynamic semantics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dynamic semantics\", CC BY-SA 4.0) states: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","support":[{"end":253,"quote":"Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","source_id":"wikipedia.article.dynamic-semantics","source_sha256":"e202886a8aed04e22ee700ef7868ee099a8076705c65d099f754ce5269e2645c","start":105}],"target_id":"concept.wikipedia.dynamic-semantics","target_kind":"node","target_sha256":"23259b19b8bd97d89b4a3a59252b0d72dc74bfd971584033d7dce29a7226e81c"}],"concept.wikipedia.dynamical-system":[{"id":"assertion.concept.wikipedia.dynamical-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dynamical system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dynamical system\", CC BY-SA 4.0) states: In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","support":[{"end":259,"quote":"In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","source_id":"wikipedia.article.dynamical-system","source_sha256":"6228121c559cf6468a031c0254dcddfddf3a904ec52711953e5a762003c69a40","start":100}],"target_id":"concept.wikipedia.dynamical-system","target_kind":"node","target_sha256":"3d091650e615d6f6b8aac90ac73592a4f59745edca114a2dedfba49eaac086d7"}],"concept.wikipedia.dysrationalia":[{"id":"assertion.concept.wikipedia.dysrationalia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dysrationalia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dysrationalia\", CC BY-SA 4.0) states: Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","support":[{"end":203,"quote":"Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","source_id":"wikipedia.article.dysrationalia","source_sha256":"06fd352894a573ef713bb22b2032c80c104432cdd622ac68d0087ad967d0806b","start":100}],"target_id":"concept.wikipedia.dysrationalia","target_kind":"node","target_sha256":"049ccb0c74374d955565e7d15cd6e72c49f263b697b000b2113f27dd597ee8eb"}],"concept.wikipedia.dysteleology":[{"id":"assertion.concept.wikipedia.dysteleology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dysteleology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dysteleology\", CC BY-SA 4.0) states: Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","support":[{"end":239,"quote":"Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","source_id":"wikipedia.article.dysteleology","source_sha256":"1502619c2aaee94bb6329ee37f6bd6c155cdfff85a8dde02000ac736af684862","start":99}],"target_id":"concept.wikipedia.dysteleology","target_kind":"node","target_sha256":"7d226580ad3487a388e576f04410c2ba1bf572f779d1dfaa8123cc4dcbffb840"}],"concept.wikipedia.ecological-fallacy":[{"id":"assertion.concept.wikipedia.ecological-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecological fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecological fallacy\", CC BY-SA 4.0) states: An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \"Ecological fallacy\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","support":[{"end":513,"quote":"An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \\\"Ecological fallacy\\\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","source_id":"wikipedia.article.ecological-fallacy","source_sha256":"0e1b3cba7cb199ba2c670326db046eb2c5e6e8d6aff4c0c05e69e9a742635cae","start":104}],"target_id":"concept.wikipedia.ecological-fallacy","target_kind":"node","target_sha256":"0a67edfccb2a77c94f3966d4b3a6fd6d3e1c7f629cd98d1d1bfcf11ea5ba7fcb"}],"concept.wikipedia.ecology-of-contexts":[{"id":"assertion.concept.wikipedia.ecology-of-contexts","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecology of contexts as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecology of contexts\", CC BY-SA 4.0) states: The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","support":[{"end":262,"quote":"The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","source_id":"wikipedia.article.ecology-of-contexts","source_sha256":"291be065ba4b6cbbe4c349492ac2793b2d0f6ffdc40c3ddbbfdc287e1205da96","start":107}],"target_id":"concept.wikipedia.ecology-of-contexts","target_kind":"node","target_sha256":"2020c0898a756c3e8f4e74306f1bee668c390e451028923184b9f3050d6f2287"}],"concept.wikipedia.ecstasy-philosophy":[{"id":"assertion.concept.wikipedia.ecstasy-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecstasy (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecstasy (philosophy)\", CC BY-SA 4.0) states: In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \"outside-itself\".","support":[{"end":349,"quote":"In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \\\"outside-itself\\\".","source_id":"wikipedia.article.ecstasy-philosophy","source_sha256":"d2d0c95958ccc0eeaadf00f4f24970adec745aba341833e603bab8dc4ac5caa1","start":107}],"target_id":"concept.wikipedia.ecstasy-philosophy","target_kind":"node","target_sha256":"0a6b1beb02bc44b817356da9cdf3eb7ca9357b4e38154718aec3991f8d02d18e"}],"concept.wikipedia.effective-theory":[{"id":"assertion.concept.wikipedia.effective-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Effective theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Effective theory\", CC BY-SA 4.0) states: In science, an effective theory is a deliberately limited scientific theory applicable under specific circumstances.","support":[{"end":220,"quote":"In science, an effective theory is a deliberately limited  scientific theory applicable under specific circumstances.","source_id":"wikipedia.article.effective-theory","source_sha256":"7a59746bf2361985bd8696ec127a9d82385240a2d6b4d12ff87673785b40bf9a","start":103}],"target_id":"concept.wikipedia.effective-theory","target_kind":"node","target_sha256":"f21fa309a701ed2e327474b2a74ba43c5d6ccb77202fdef088c4ae3a36bbf7df"}],"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative":[{"id":"assertion.concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eigenvalues and eigenvectors of the second derivative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eigenvalues and eigenvectors of the second derivative\", CC BY-SA 4.0) states: Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","support":[{"end":308,"quote":"Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","source_id":"wikipedia.article.eigenvalues-and-eigenvectors-of-the-second-derivative","source_sha256":"524f0626371cbfafa9242deab5acbf3be5047048d0f746250ba2790ac47319f3","start":141}],"target_id":"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","target_kind":"node","target_sha256":"16ec87a9ce86874a24a454659146f6bcc1edc4db59426e4dad4ef62c278c2b4b"}],"concept.wikipedia.elastic-and-inelastic-collisions-apparatus":[{"id":"assertion.concept.wikipedia.elastic-and-inelastic-collisions-apparatus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elastic and inelastic collisions apparatus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elastic and inelastic collisions apparatus\", CC BY-SA 4.0) states: The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","support":[{"end":240,"quote":"The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","source_id":"wikipedia.article.elastic-and-inelastic-collisions-apparatus","source_sha256":"c085c8fd95434068fbc2e96e87728035e8b26a4d4cf58f94a6abab79a50d8a47","start":130}],"target_id":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","target_kind":"node","target_sha256":"e51146198f5263925394e8b5a8cf07c0e5fb3834c7a3e6bc0f675844e57278c2"}],"concept.wikipedia.elastomeric-bridge-bearing":[{"id":"assertion.concept.wikipedia.elastomeric-bridge-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elastomeric bridge bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elastomeric bridge bearing\", CC BY-SA 4.0) states: An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","support":[{"end":288,"quote":"An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","source_id":"wikipedia.article.elastomeric-bridge-bearing","source_sha256":"8208e6f873b190e6aa608e98b8824a274309e0ef993153769b393b0a4ba0988b","start":114}],"target_id":"concept.wikipedia.elastomeric-bridge-bearing","target_kind":"node","target_sha256":"c7b1445df6bfd029060d2fa9cb0d834a88e22c91acd3c0a033f791c0b16f333f"}],"concept.wikipedia.electric-motor":[{"id":"assertion.concept.wikipedia.electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric motor\", CC BY-SA 4.0) states: An electric motor is a machine that converts electrical energy into mechanical energy.","support":[{"end":185,"quote":"An electric motor is a machine that converts electrical energy into mechanical energy.","source_id":"wikipedia.article.electric-motor","source_sha256":"e14906ef07e7ed5331691b4372f425caeeb6c941b795ebe6aa9f09e5785ff1df","start":99}],"target_id":"concept.wikipedia.electric-motor","target_kind":"node","target_sha256":"fa402c725890c31e8b4070c523f5a3959be13a86c06f3007e881186b4a2b952b"}],"concept.wikipedia.electric-power-quality":[{"id":"assertion.concept.wikipedia.electric-power-quality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric power quality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric power quality\", CC BY-SA 4.0) states: Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","support":[{"end":255,"quote":"Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","source_id":"wikipedia.article.electric-power-quality","source_sha256":"6294243e11c3be316480441b8a4d0011b5126ebf2f4de2513a839e433ff00cc1","start":109}],"target_id":"concept.wikipedia.electric-power-quality","target_kind":"node","target_sha256":"94dc88d4900bce13a4110dae8d4b9e8e129327c71b1a8aafd1ca11e87d805a91"}],"concept.wikipedia.electric-power-system":[{"id":"assertion.concept.wikipedia.electric-power-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric power system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric power system\", CC BY-SA 4.0) states: An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","support":[{"end":225,"quote":"An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","source_id":"wikipedia.article.electric-power-system","source_sha256":"ecf9610d5a30b2bdda22dc6477c45743c0950ce97b7505c7f2aba78b31feb031","start":109}],"target_id":"concept.wikipedia.electric-power-system","target_kind":"node","target_sha256":"27b857ba422ebf001ff76cb1c12a16210487eeabf38ffca5e1a6a5635f4d00cc"}],"concept.wikipedia.electrical-fault":[{"id":"assertion.concept.wikipedia.electrical-fault","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electrical fault as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electrical fault\", CC BY-SA 4.0) states: In an electric power system, a fault is a defect that results in abnormality of electric current.","support":[{"end":200,"quote":"In an electric power system, a fault is a defect that results in abnormality of electric current.","source_id":"wikipedia.article.electrical-fault","source_sha256":"554aa2888b752714463e9ebd95dd90602eb16e831a43aeab4c82fe546f807218","start":103}],"target_id":"concept.wikipedia.electrical-fault","target_kind":"node","target_sha256":"cb703fc5d8209cbba842e450f51933467728621fba56cb8c27d98ab47a2e7a6a"}],"concept.wikipedia.electronic-circuit":[{"id":"assertion.concept.wikipedia.electronic-circuit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic circuit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic circuit\", CC BY-SA 4.0) states: An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","support":[{"end":322,"quote":"An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","source_id":"wikipedia.article.electronic-circuit","source_sha256":"4d68dac47aec3ee5c19d5514dac970cb6d95160c6d12e1e2b291350a397bb449","start":105}],"target_id":"concept.wikipedia.electronic-circuit","target_kind":"node","target_sha256":"5c94229d80588878b8721e72906dfe029278b163a754ad06d03d1fd63ad398ed"}],"concept.wikipedia.electronic-color-code":[{"id":"assertion.concept.wikipedia.electronic-color-code","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic color code as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic color code\", CC BY-SA 4.0) states: An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","support":[{"end":270,"quote":"An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","source_id":"wikipedia.article.electronic-color-code","source_sha256":"542c0c851d15b71a6cfd3f9a04860fb8c0b9e448b62d8fa9310951ec5ecffca5","start":106}],"target_id":"concept.wikipedia.electronic-color-code","target_kind":"node","target_sha256":"02fa4e5f87ae916401a2f89259e667c51a27b383cc512209f241513011e2c570"}],"concept.wikipedia.electronic-component":[{"id":"assertion.concept.wikipedia.electronic-component","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic component as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic component\", CC BY-SA 4.0) states: An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","support":[{"end":271,"quote":"An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","source_id":"wikipedia.article.electronic-component","source_sha256":"fc869b7a1fb29b368016b162d61a365002ca8328fa087df6d2bf1cd07ea0177c","start":107}],"target_id":"concept.wikipedia.electronic-component","target_kind":"node","target_sha256":"1c747972a01134172fa87f8c4c0987eee5c20ff69d767347d9f9f9f531f42878"}],"concept.wikipedia.elementary-class":[{"id":"assertion.concept.wikipedia.elementary-class","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elementary class as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elementary class\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","support":[{"end":275,"quote":"In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","source_id":"wikipedia.article.elementary-class","source_sha256":"5895e7d89e7f12715e3cf8df9b7681d2c349065b7cb090e78d3e427224a3a7cb","start":103}],"target_id":"concept.wikipedia.elementary-class","target_kind":"node","target_sha256":"34eda768a88b936644f8ed569372d1b16dda115e90f0ea5ba9b3ffd8c7dcb0a5"}],"concept.wikipedia.eliminative-materialism":[{"id":"assertion.concept.wikipedia.eliminative-materialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eliminative materialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eliminative materialism\", CC BY-SA 4.0) states: Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","support":[{"end":300,"quote":"Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","source_id":"wikipedia.article.eliminative-materialism","source_sha256":"4eaed4fb7399ede61be0b9976c839a2742c82947269a01395abb3b7c39686360","start":109}],"target_id":"concept.wikipedia.eliminative-materialism","target_kind":"node","target_sha256":"306dcc0bc801e64ef73b705bdd33678fe5291bcb1e08c2bd39b75ccc88b7519b"}],"concept.wikipedia.embedded-instrumentation":[{"id":"assertion.concept.wikipedia.embedded-instrumentation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Embedded instrumentation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Embedded instrumentation\", CC BY-SA 4.0) states: In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","support":[{"end":289,"quote":"In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","source_id":"wikipedia.article.embedded-instrumentation","source_sha256":"94b751aebd35634e655e7ee0ef0de4d784bc32cc04223f8c009fcedb9dd710d8","start":112}],"target_id":"concept.wikipedia.embedded-instrumentation","target_kind":"node","target_sha256":"55bc7c26ff87a5549291ce6e2a9619f52bfe215f099db98d6e178231bb8d057a"}],"concept.wikipedia.emotional-reasoning":[{"id":"assertion.concept.wikipedia.emotional-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Emotional reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Emotional reasoning\", CC BY-SA 4.0) states: Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","support":[{"end":274,"quote":"Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","source_id":"wikipedia.article.emotional-reasoning","source_sha256":"24a812bb6221d98252fcc4ca11bec04c823f4124bd8f01a4f2ea67fea8f3c320","start":106}],"target_id":"concept.wikipedia.emotional-reasoning","target_kind":"node","target_sha256":"7ad9d5e7e61feeac3e4b4bb790415cec03d6522354bc55e03fb1a1a84ba01969"}],"concept.wikipedia.empiric-school":[{"id":"assertion.concept.wikipedia.empiric-school","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Empiric school as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Empiric school\", CC BY-SA 4.0) states: The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","support":[{"end":271,"quote":"The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","source_id":"wikipedia.article.empiric-school","source_sha256":"cc759883786452b3c7c470df3929d1762316379c02aef312359843191e844619","start":102}],"target_id":"concept.wikipedia.empiric-school","target_kind":"node","target_sha256":"1c3a6329e5c7af5cfa5686ff3ba3e3b08051d7e42ff86d24a5f53f46a6d6b0e5"}],"concept.wikipedia.empirical-evidence":[{"id":"assertion.concept.wikipedia.empirical-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Empirical evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Empirical evidence\", CC BY-SA 4.0) states: Empirical evidence is evidence obtained through sense experience or experimental procedure.","support":[{"end":195,"quote":"Empirical evidence is evidence obtained through sense experience or experimental procedure.","source_id":"wikipedia.article.empirical-evidence","source_sha256":"c07a3cb62daa5c1c88ffaca0555da17f869fbe51ad11be0600a83019dec2dc83","start":104}],"target_id":"concept.wikipedia.empirical-evidence","target_kind":"node","target_sha256":"d56f5226c228f029796db0039a8f946500d5be707431e245c04492330fcc6198"}],"concept.wikipedia.encyclopedic-knowledge":[{"id":"assertion.concept.wikipedia.encyclopedic-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Encyclopedic knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Encyclopedic knowledge\", CC BY-SA 4.0) states: To have encyclopedic knowledge is to have \"vast and complete\" knowledge about a large number of diverse subjects.","support":[{"end":225,"quote":"To have encyclopedic knowledge is to have \\\"vast and complete\\\" knowledge about a large number of diverse subjects.","source_id":"wikipedia.article.encyclopedic-knowledge","source_sha256":"dc413cec8c7da8068842669f31762e5a25a42213783c1907cc15a1b515dfe90b","start":110}],"target_id":"concept.wikipedia.encyclopedic-knowledge","target_kind":"node","target_sha256":"25a83e4ba5ae8ca523dbcb5b97b813fadd23a396ac44e3813cfcaa3da374ffad"}],"concept.wikipedia.end-of-history-illusion":[{"id":"assertion.concept.wikipedia.end-of-history-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"End-of-history illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"End-of-history illusion\", CC BY-SA 4.0) states: The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","support":[{"end":367,"quote":"The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","source_id":"wikipedia.article.end-of-history-illusion","source_sha256":"781cd95ed70ff8003418d43aebb44c2e7cd24471b80687eadb54daa1b8184706","start":111}],"target_id":"concept.wikipedia.end-of-history-illusion","target_kind":"node","target_sha256":"e2855ed6f4c620c7d7f13932a42c66eee5ec5c8af3f74d70d70d4c1cfa4b7efc"}],"concept.wikipedia.engaged-theory":[{"id":"assertion.concept.wikipedia.engaged-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engaged theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engaged theory\", CC BY-SA 4.0) states: Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","support":[{"end":356,"quote":"Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","source_id":"wikipedia.article.engaged-theory","source_sha256":"5fd03e90f70c73a6fcfb53c094f94f68862be6cd6e8d13d5b585128e704dc180","start":102}],"target_id":"concept.wikipedia.engaged-theory","target_kind":"node","target_sha256":"ae7e5372d80253cd329dde6dc9d05acc6189a7e181aef5702d02581564e75d60"}],"concept.wikipedia.engine":[{"id":"assertion.concept.wikipedia.engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engine\", CC BY-SA 4.0) states: An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","support":[{"end":193,"quote":"An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","source_id":"wikipedia.article.engine","source_sha256":"23770c4eb69102515204e8777455beab5a10db7cdbe9444a0e359404b225b401","start":90}],"target_id":"concept.wikipedia.engine","target_kind":"node","target_sha256":"9ac1611ee83efecf0509467ed17a788f890b291b5932d212c64c739d6de1236c"}],"concept.wikipedia.engineering-geology":[{"id":"assertion.concept.wikipedia.engineering-geology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engineering geology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engineering geology\", CC BY-SA 4.0) states: Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","support":[{"end":358,"quote":"Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","source_id":"wikipedia.article.engineering-geology","source_sha256":"5f1eb870bf7b3dffa85929a84b6017441c900d78da833c567bebbef854d786df","start":105}],"target_id":"concept.wikipedia.engineering-geology","target_kind":"node","target_sha256":"9333574ce940306f1fc9c9c58b4dd14379a937b284e27610054bf72cbbc27347"}],"concept.wikipedia.epicurean-paradox":[{"id":"assertion.concept.wikipedia.epicurean-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epicurean paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epicurean paradox\", CC BY-SA 4.0) states: The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","support":[{"end":327,"quote":"The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","source_id":"wikipedia.article.epicurean-paradox","source_sha256":"1cb1ef5d0cfb3cb7761546bf98768f1db50c2814afce06935de53d8b51b982cf","start":105}],"target_id":"concept.wikipedia.epicurean-paradox","target_kind":"node","target_sha256":"653a3f39633ae4a8c72c9bb3c5c48e336517c8e67bf51e17628c5ff6f62cc423"}],"concept.wikipedia.epicyclic-gearing":[{"id":"assertion.concept.wikipedia.epicyclic-gearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epicyclic gearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epicyclic gearing\", CC BY-SA 4.0) states: An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \"planet\") revolves around the center of the other (the \"sun\").","support":[{"end":326,"quote":"An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \\\"planet\\\") revolves around the center of the other (the \\\"sun\\\").","source_id":"wikipedia.article.epicyclic-gearing","source_sha256":"e904f6af2594b42bef76c043b89fa91028ea2014868666edbd41afa4afef5a28","start":103}],"target_id":"concept.wikipedia.epicyclic-gearing","target_kind":"node","target_sha256":"85e1805e3f0d3a28ad555c83656a24263c693a9230f1d3dbf8a49f07d7a68237"}],"concept.wikipedia.epistemic-democracy":[{"id":"assertion.concept.wikipedia.epistemic-democracy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic democracy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic democracy\", CC BY-SA 4.0) states: Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","support":[{"end":300,"quote":"Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","source_id":"wikipedia.article.epistemic-democracy","source_sha256":"73a4c6f4fff603077bec93c2aaa47eea01100d73777ef7f7d661a8a721496d2f","start":107}],"target_id":"concept.wikipedia.epistemic-democracy","target_kind":"node","target_sha256":"47afbb7ab67a813b0f93feb0df384154ab5bdcb1921c18eea79851d89702c5a7"}],"concept.wikipedia.epistemic-insight":[{"id":"assertion.concept.wikipedia.epistemic-insight","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic insight as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic insight\", CC BY-SA 4.0) states: Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","support":[{"end":233,"quote":"Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","source_id":"wikipedia.article.epistemic-insight","source_sha256":"f07813e89a313f89eabb15542cac5cb2bfb152c1d55255ddcfbb15bee78cb37d","start":105}],"target_id":"concept.wikipedia.epistemic-insight","target_kind":"node","target_sha256":"aa8741cb22373d1ed2d65e9c0fac8e1ba17df123b29839016596fa92cc208310"}],"concept.wikipedia.epistemic-theories-of-truth":[{"id":"assertion.concept.wikipedia.epistemic-theories-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic theories of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic theories of truth\", CC BY-SA 4.0) states: In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","support":[{"end":332,"quote":"In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","source_id":"wikipedia.article.epistemic-theories-of-truth","source_sha256":"d30474e579c22a51aa6710e87fea25ab2c7a9243414543bb45f262fba5726dc2","start":114}],"target_id":"concept.wikipedia.epistemic-theories-of-truth","target_kind":"node","target_sha256":"1ca048525d90e4f5cda22cf5f926e2c99230c0a5161949a5e62212a3fc340011"}],"concept.wikipedia.epistemicism":[{"id":"assertion.concept.wikipedia.epistemicism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemicism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemicism\", CC BY-SA 4.0) states: Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","support":[{"end":300,"quote":"Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","source_id":"wikipedia.article.epistemicism","source_sha256":"074475ca4a944bbbfb605edfd8384d89d801f2a78eb23b4db4b1c0bb004aabe9","start":100}],"target_id":"concept.wikipedia.epistemicism","target_kind":"node","target_sha256":"cbd7c47218ad45aa015241cdaf3ed0941612759a0fd6586e18b1eba796ff5f70"}],"concept.wikipedia.epistemological-idealism":[{"id":"assertion.concept.wikipedia.epistemological-idealism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological idealism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological idealism\", CC BY-SA 4.0) states: Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","support":[{"end":251,"quote":"Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","source_id":"wikipedia.article.epistemological-idealism","source_sha256":"aa9a397fbd93701d6ea954342b8371cea4e6e70c4a0ce0f8868f0be624160084","start":110}],"target_id":"concept.wikipedia.epistemological-idealism","target_kind":"node","target_sha256":"b1a09240e9cdeb4d0323dc74de626f942e4b1c8187154a704179d8be3c30eb03"}],"concept.wikipedia.epistemological-particularism":[{"id":"assertion.concept.wikipedia.epistemological-particularism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological particularism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological particularism\", CC BY-SA 4.0) states: Epistemological particularism is the view that one can know something without knowing how one knows it.","support":[{"end":220,"quote":"Epistemological particularism is the view that one can know something without knowing how one knows it.","source_id":"wikipedia.article.epistemological-particularism","source_sha256":"a5c7cff003874aa13ae6da4e5d4243a07a04d505dc8484bd36b3a5f0a94a0744","start":117}],"target_id":"concept.wikipedia.epistemological-particularism","target_kind":"node","target_sha256":"e5afb4830cf5ede46af8856862b810e0dd89bc193b80747c7e0605d18e1ef073"}],"concept.wikipedia.epistemological-pluralism":[{"id":"assertion.concept.wikipedia.epistemological-pluralism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological pluralism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological pluralism\", CC BY-SA 4.0) states: Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","support":[{"end":356,"quote":"Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","source_id":"wikipedia.article.epistemological-pluralism","source_sha256":"eb018ee1f7a9a8761a3221a0c126dc4acfd7707259861331455cd6d6b5d10550","start":113}],"target_id":"concept.wikipedia.epistemological-pluralism","target_kind":"node","target_sha256":"9a94004f3a29859e0aa24fb5cebffc7e1abe83216894cc6696f4e8f5f87fd6d3"}],"concept.wikipedia.epistemological-rupture":[{"id":"assertion.concept.wikipedia.epistemological-rupture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological rupture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological rupture\", CC BY-SA 4.0) states: Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","support":[{"end":266,"quote":"Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","source_id":"wikipedia.article.epistemological-rupture","source_sha256":"98143c63389fdc7e22c7dac6b1296b0fcb967be237d4be8e13630ddbb0a12052","start":110}],"target_id":"concept.wikipedia.epistemological-rupture","target_kind":"node","target_sha256":"0e4aaea0259bd08682785a7629702c9af98a12f61196f4f0016ba532918ecfee"}],"concept.wikipedia.epsilon-calculus":[{"id":"assertion.concept.wikipedia.epsilon-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epsilon calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epsilon calculus\", CC BY-SA 4.0) states: In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","support":[{"end":354,"quote":"In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","source_id":"wikipedia.article.epsilon-calculus","source_sha256":"4f260b1882ffd26f5332fc2137650f58ac31a4c6c9d9df759e3270a2762230df","start":104}],"target_id":"concept.wikipedia.epsilon-calculus","target_kind":"node","target_sha256":"d3cf5a0f7e150f42aa534ecd0fcfa1a526acf3af10491dfa223bfd78aed7e4b6"}],"concept.wikipedia.ergo-decedo":[{"id":"assertion.concept.wikipedia.ergo-decedo","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ergo decedo as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ergo decedo\", CC BY-SA 4.0) states: Ergo decedo, Latin for \"therefore I leave\" or \"then I go off\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","support":[{"end":462,"quote":"Ergo decedo, Latin for \\\"therefore I leave\\\" or \\\"then I go off\\\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","source_id":"wikipedia.article.ergo-decedo","source_sha256":"bbd42bbe8370b00ffd5c0c01262efeaa5450718882d26b1ff339108982b58981","start":99}],"target_id":"concept.wikipedia.ergo-decedo","target_kind":"node","target_sha256":"1b5a55aaaeb8b805e53d104a31cbc615d0b8e28b072e7eaa04ad6ff853b4bd11"}],"concept.wikipedia.euclidean-geometry":[{"id":"assertion.concept.wikipedia.euclidean-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Euclidean geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Euclidean geometry\", CC BY-SA 4.0) states: Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","support":[{"end":257,"quote":"Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","source_id":"wikipedia.article.euclidean-geometry","source_sha256":"592f4fab7144fcf9f1ff00aedcdc296017776e1b362a98f2d98b90f097b6c29f","start":102}],"target_id":"concept.wikipedia.euclidean-geometry","target_kind":"node","target_sha256":"da6bf55f67fd2b4a7901e9231dd242b375aae02ea35284d140737decd7d6b8a7"}],"concept.wikipedia.euler-spiral":[{"id":"assertion.concept.wikipedia.euler-spiral","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Euler spiral as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Euler spiral\", CC BY-SA 4.0) states: An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","support":[{"end":259,"quote":"An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","source_id":"wikipedia.article.euler-spiral","source_sha256":"93f7a0d3b0dd5a2f826ef70452d46bc48b217b7781d5adad7c903e023094e2f5","start":100}],"target_id":"concept.wikipedia.euler-spiral","target_kind":"node","target_sha256":"157fe5e0d33db22e7179f9d38adc232d9bb80c6a34a410e82071340ecd5e1c68"}],"concept.wikipedia.evidence-based-practice":[{"id":"assertion.concept.wikipedia.evidence-based-practice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evidence-based practice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evidence-based practice\", CC BY-SA 4.0) states: Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","support":[{"end":221,"quote":"Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","source_id":"wikipedia.article.evidence-based-practice","source_sha256":"ddefaf787fe5bf43ffd94dc77da473006824a578184f300c6a0a45e0dcc3cfd5","start":110}],"target_id":"concept.wikipedia.evidence-based-practice","target_kind":"node","target_sha256":"a1edc4db5911146c370921d85a6b163afab1005d3abdcff9f3dac4f7bf295043"}],"concept.wikipedia.evidentialism":[{"id":"assertion.concept.wikipedia.evidentialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evidentialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evidentialism\", CC BY-SA 4.0) states: Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","support":[{"end":264,"quote":"Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","source_id":"wikipedia.article.evidentialism","source_sha256":"2e60d08474176fad7d0b59965f44b43e4ae59783153fd982b7facc626d0644e6","start":99}],"target_id":"concept.wikipedia.evidentialism","target_kind":"node","target_sha256":"ffa8cc72ba56ee17b40cc27039776f0023c6d0fc0acd03cdbf4af418768fb8ad"}],"concept.wikipedia.evolutionary-debunking":[{"id":"assertion.concept.wikipedia.evolutionary-debunking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evolutionary debunking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evolutionary debunking\", CC BY-SA 4.0) states: An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","support":[{"end":458,"quote":"An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","source_id":"wikipedia.article.evolutionary-debunking","source_sha256":"e318c5dda43a157cbb9a9ef31fd103519064f8b7dae9d588a270bf6507063d3e","start":110}],"target_id":"concept.wikipedia.evolutionary-debunking","target_kind":"node","target_sha256":"864970f597572f703b2b11bfb06cd11442a8d2acb296f0cd124a12a68bc8fe59"}],"concept.wikipedia.excluded-point-topology":[{"id":"assertion.concept.wikipedia.excluded-point-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Excluded point topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Excluded point topology\", CC BY-SA 4.0) states: In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","support":[{"end":223,"quote":"In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","source_id":"wikipedia.article.excluded-point-topology","source_sha256":"d7f9a427dfeeabd43d748148cbf522a226d009896eb47aac0e2a7bb857e58b66","start":110}],"target_id":"concept.wikipedia.excluded-point-topology","target_kind":"node","target_sha256":"51e558d16966b1b336bc88df8a08db5124aecbfd0ca5dbffdfc7b76640de25d1"}],"concept.wikipedia.exercise-machine":[{"id":"assertion.concept.wikipedia.exercise-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Exercise machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Exercise machine\", CC BY-SA 4.0) states: An exercise machine is any machine used for physical exercise.","support":[{"end":165,"quote":"An exercise machine is any machine used for physical exercise.","source_id":"wikipedia.article.exercise-machine","source_sha256":"75d1543ddaaa60ed557d6da644ef1276c0df0e4b82a8fd5131302d713c2874d3","start":103}],"target_id":"concept.wikipedia.exercise-machine","target_kind":"node","target_sha256":"0bf50f7bc87e5c2cdc3e6c308dadaf632ad1166f4c41bb651e8277f84a357eef"}],"concept.wikipedia.existential-graph":[{"id":"assertion.concept.wikipedia.existential-graph","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Existential graph as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Existential graph\", CC BY-SA 4.0) states: An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","support":[{"end":337,"quote":"An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","source_id":"wikipedia.article.existential-graph","source_sha256":"fce377ab0a7a091f1d696171b2605ba1d5237e6cd309b6d12ee7cddb71d2ded0","start":104}],"target_id":"concept.wikipedia.existential-graph","target_kind":"node","target_sha256":"50ded4c56d237a5029e4e90658d804db6e7cf1fc478de310b85d2abcaec33144"}],"concept.wikipedia.expectancy-theory":[{"id":"assertion.concept.wikipedia.expectancy-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Expectancy theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Expectancy theory\", CC BY-SA 4.0) states: Expectancy theory (or expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","support":[{"end":361,"quote":"Expectancy theory (or  expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","source_id":"wikipedia.article.expectancy-theory","source_sha256":"effb08d117098fdcfdde331a09710c3e8d138ec2579c27cc39463c33392d33fa","start":103}],"target_id":"concept.wikipedia.expectancy-theory","target_kind":"node","target_sha256":"af018dcf49991fec4fc8a23f134ed56c0dfc1829947257e5103dd45201de8ba1"}],"concept.wikipedia.expectancy-violations-theory":[{"id":"assertion.concept.wikipedia.expectancy-violations-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Expectancy violations theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Expectancy violations theory\", CC BY-SA 4.0) states: Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","support":[{"end":278,"quote":"Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","source_id":"wikipedia.article.expectancy-violations-theory","source_sha256":"8fcd233f2bcc00e9803b138b7f2c5fbc6b9404242cb070b64380f36359e9eec3","start":115}],"target_id":"concept.wikipedia.expectancy-violations-theory","target_kind":"node","target_sha256":"93ea8c6f34161bc19f3c9ccf6d650ae19c2e1eb53ca50e1ae0eccf77636cdd7d"}],"concept.wikipedia.experience-machine":[{"id":"assertion.concept.wikipedia.experience-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experience machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experience machine\", CC BY-SA 4.0) states: The experience machine or pleasure machine is a thought experiment put forward by philosopher Robert Nozick in his 1974 book Anarchy, State, and Utopia.","support":[{"end":259,"quote":"The experience machine or pleasure machine is a thought experiment put forward by  philosopher Robert Nozick in his 1974 book  Anarchy, State, and Utopia.","source_id":"wikipedia.article.experience-machine","source_sha256":"3d167e53177941a5005b87825ee0ea9865d68dd9b6bdb743ca5be4ebe0c67c4a","start":105}],"target_id":"concept.wikipedia.experience-machine","target_kind":"node","target_sha256":"57bf86d2b8c4e02ae22bc179aa0da312c52e8f6dd14a1a81b1b38b3d99b07f53"}],"concept.wikipedia.experiment":[{"id":"assertion.concept.wikipedia.experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experiment\", CC BY-SA 4.0) states: An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","support":[{"end":243,"quote":"An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","source_id":"wikipedia.article.experiment","source_sha256":"fa1de9df3db3da82e310756f2d8c19052337c74b46ff243e4b45f706b24a81f3","start":95}],"target_id":"concept.wikipedia.experiment","target_kind":"node","target_sha256":"ae123452ee97e7fc8cdbf1835ccbd5195d765825f2c522855a071edd5c3dac65"}],"concept.wikipedia.experimental-philosophy":[{"id":"assertion.concept.wikipedia.experimental-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimental philosophy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimental philosophy\", CC BY-SA 4.0) states: Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","support":[{"end":370,"quote":"Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","source_id":"wikipedia.article.experimental-philosophy","source_sha256":"8cbd3a256d1efeee00a9b15c7f51590e9f2dbf921c1f62c3b31c27e933f96d47","start":110}],"target_id":"concept.wikipedia.experimental-philosophy","target_kind":"node","target_sha256":"ee56e1d1686f6b427ce6afb80d2afd0273d59836a3da609170ef58d805b6f075"}],"concept.wikipedia.experimenter-s-regress":[{"id":"assertion.concept.wikipedia.experimenter-s-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimenter's regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimenter's regress\", CC BY-SA 4.0) states: In science, experimenter's regress refers to a loop of dependence between theory and evidence.","support":[{"end":203,"quote":"In science, experimenter's regress refers to a loop of dependence between theory and evidence.","source_id":"wikipedia.article.experimenter-s-regress","source_sha256":"444106ac20c54cf17d65bf927d33cf89ffe6d643af744e454f7603efc393e3f3","start":109}],"target_id":"concept.wikipedia.experimenter-s-regress","target_kind":"node","target_sha256":"cbe4af7e9edee7ffc3c0b195330fa3c9b213188d7a196dc9a73a6322c6bf7aba"}],"concept.wikipedia.experimentum-crucis":[{"id":"assertion.concept.wikipedia.experimentum-crucis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimentum crucis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimentum crucis\", CC BY-SA 4.0) states: In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","support":[{"end":388,"quote":"In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","source_id":"wikipedia.article.experimentum-crucis","source_sha256":"0c4a22386318d08002289b142ec22e59809a860ed0096f11b950d3e27c018c15","start":105}],"target_id":"concept.wikipedia.experimentum-crucis","target_kind":"node","target_sha256":"233d78445f0ba93088df77eca3fb6808c79df96d778aad828cd13406d8a38776"}],"concept.wikipedia.explanatory-indispensability-argument":[{"id":"assertion.concept.wikipedia.explanatory-indispensability-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explanatory indispensability argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explanatory indispensability argument\", CC BY-SA 4.0) states: The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","support":[{"end":257,"quote":"The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","source_id":"wikipedia.article.explanatory-indispensability-argument","source_sha256":"26a784fd575d347cbb28636bd07c58543f497e4d71dca051261d06fdc104aa5e","start":125}],"target_id":"concept.wikipedia.explanatory-indispensability-argument","target_kind":"node","target_sha256":"9ce0d106e1052a79a56c65a4a8ecb83deca2e9e4b904a3c1e2a0ceb8170c8b01"}],"concept.wikipedia.explanatory-power":[{"id":"assertion.concept.wikipedia.explanatory-power","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explanatory power as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explanatory power\", CC BY-SA 4.0) states: Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","support":[{"end":227,"quote":"Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","source_id":"wikipedia.article.explanatory-power","source_sha256":"c05592412b7025bb988c47fb572d76b29bd4558707aabcd2924338c1ab2e99c8","start":105}],"target_id":"concept.wikipedia.explanatory-power","target_kind":"node","target_sha256":"1d0a6f337f43d5cdd726102be8bed95752e1ff4d139129d282436def783f5167"}],"concept.wikipedia.explicit-knowledge":[{"id":"assertion.concept.wikipedia.explicit-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explicit knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explicit knowledge\", CC BY-SA 4.0) states: Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","support":[{"end":256,"quote":"Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","source_id":"wikipedia.article.explicit-knowledge","source_sha256":"c50704af37625ce241692da09793030a17e650106a54c6df20ee580725c6cc88","start":105}],"target_id":"concept.wikipedia.explicit-knowledge","target_kind":"node","target_sha256":"1850d021dd99e2a3c8955d45c910d629f62cedeaa7def65d96af7793264961aa"}],"concept.wikipedia.exponential-field":[{"id":"assertion.concept.wikipedia.exponential-field","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Exponential field as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Exponential field\", CC BY-SA 4.0) states: In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","support":[{"end":267,"quote":"In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","source_id":"wikipedia.article.exponential-field","source_sha256":"bbebcc9bf14b7110da21472dbe652eb0f174f6a9811a419ec3cf4f8aca22f99a","start":105}],"target_id":"concept.wikipedia.exponential-field","target_kind":"node","target_sha256":"8029852e11d8672aa0645f08176c36c9a6f12c14173715a3b6c390d7fa8ec973"}],"concept.wikipedia.extension-semantics":[{"id":"assertion.concept.wikipedia.extension-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extension (semantics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extension (semantics)\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","support":[{"end":539,"quote":"In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","source_id":"wikipedia.article.extension-semantics","source_sha256":"0aeccfceefca2deccd1665382b7b28bdafe38a665d7e48a3e9dbd1080651e8c2","start":106}],"target_id":"concept.wikipedia.extension-semantics","target_kind":"node","target_sha256":"95237318e0a7d031f78baf5b2155a9f6f5b4c211e7613ebdb7d94da2f029f0e8"}],"concept.wikipedia.extensional-context":[{"id":"assertion.concept.wikipedia.extensional-context","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extensional context as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extensional context\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","support":[{"end":506,"quote":"In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","source_id":"wikipedia.article.extensional-context","source_sha256":"1bd5bc8b05cbbe53472dcb91e30b9282fad813045238d439ae06a5eae6896213","start":106}],"target_id":"concept.wikipedia.extensional-context","target_kind":"node","target_sha256":"671d5452ef1adc42175b996fbd085d69af4dd4dea76bd2787aaa6068b0541e7a"}],"concept.wikipedia.fallacy":[{"id":"assertion.concept.wikipedia.fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fallacy\", CC BY-SA 4.0) states: A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","support":[{"end":238,"quote":"A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","source_id":"wikipedia.article.fallacy","source_sha256":"13ef7eade885875b25b0600f9ba7a956a992a42fdae29d1035b44bfd3da96ab7","start":92}],"target_id":"concept.wikipedia.fallacy","target_kind":"node","target_sha256":"7200da20e4404fd7461ed6ff2602918c535d93a196044e7928abd8e84a176632"}],"concept.wikipedia.false-brinelling":[{"id":"assertion.concept.wikipedia.false-brinelling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"False brinelling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"False brinelling\", CC BY-SA 4.0) states: False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","support":[{"end":289,"quote":"False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","source_id":"wikipedia.article.false-brinelling","source_sha256":"0d12148c009f4f8b55330edba9970bc884ae36f7a8b0e494ee518a19dd372465","start":103}],"target_id":"concept.wikipedia.false-brinelling","target_kind":"node","target_sha256":"7e4cffa9297be7b88696f9262360cdc7efaccec41ddf7be2f905a52d5f92a811"}],"concept.wikipedia.faraday-paradox-electrochemistry":[{"id":"assertion.concept.wikipedia.faraday-paradox-electrochemistry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Faraday paradox (electrochemistry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Faraday paradox (electrochemistry)\", CC BY-SA 4.0) states: The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","support":[{"end":218,"quote":"The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","source_id":"wikipedia.article.faraday-paradox-electrochemistry","source_sha256":"850d28aa1d4ac7e6a8e18a805cd4769e14d0f12b1787f7068f464d37a91ca282","start":121}],"target_id":"concept.wikipedia.faraday-paradox-electrochemistry","target_kind":"node","target_sha256":"96ff02876cd0fec369cd0cb1f298729a4e602c36236b115410409621da60e519"}],"concept.wikipedia.fast-growing-hierarchy":[{"id":"assertion.concept.wikipedia.fast-growing-hierarchy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fast-growing hierarchy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fast-growing hierarchy\", CC BY-SA 4.0) states: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","support":[{"end":468,"quote":"In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","source_id":"wikipedia.article.fast-growing-hierarchy","source_sha256":"49aabb0f774f847e00c1c9b17438e598d2e85d2cb7921a0329641bcf49f70735","start":110}],"target_id":"concept.wikipedia.fast-growing-hierarchy","target_kind":"node","target_sha256":"65c0319c3886d02bd2375c96964fd0f6f32c501415b3552f4a49816768cdda1a"}],"concept.wikipedia.fastener":[{"id":"assertion.concept.wikipedia.fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fastener as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fastener\", CC BY-SA 4.0) states: A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","support":[{"end":229,"quote":"A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","source_id":"wikipedia.article.fastener","source_sha256":"910e83a5fa1bcfb1925eb5ab03594058ddd27da68134b47037d57b6dd05c9987","start":94}],"target_id":"concept.wikipedia.fastener","target_kind":"node","target_sha256":"7d3c28339f9c9a4b742582a37e204e8c1c55bd0878ff8a606af1fabdcfc4eac1"}],"concept.wikipedia.feminist-epistemology":[{"id":"assertion.concept.wikipedia.feminist-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Feminist epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Feminist epistemology\", CC BY-SA 4.0) states: Feminist epistemology is an examination of epistemology from a feminist standpoint.","support":[{"end":192,"quote":"Feminist epistemology is an examination of epistemology from a feminist standpoint.","source_id":"wikipedia.article.feminist-epistemology","source_sha256":"0863ab3c39aa91598863e25ba4649b41863686b14eed478b479a15c7b9e79cef","start":109}],"target_id":"concept.wikipedia.feminist-epistemology","target_kind":"node","target_sha256":"db51a82dc7d0d74e4b32fded819af5074da591f7acfb2823845de984c5ca7858"}],"concept.wikipedia.feminist-post-structuralist-discourse-analysis":[{"id":"assertion.concept.wikipedia.feminist-post-structuralist-discourse-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Feminist post-structuralist discourse analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Feminist post-structuralist discourse analysis\", CC BY-SA 4.0) states: Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","support":[{"end":350,"quote":"Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","source_id":"wikipedia.article.feminist-post-structuralist-discourse-analysis","source_sha256":"23c6258f644e54ef2565dc668dac74b72a51040e3892461f224b5087981bd15a","start":134}],"target_id":"concept.wikipedia.feminist-post-structuralist-discourse-analysis","target_kind":"node","target_sha256":"abffe2a7b29291d1968d3a2e6629b22b459932542a170f3fbe5bb7834d98c53d"}],"concept.wikipedia.fictionalism":[{"id":"assertion.concept.wikipedia.fictionalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fictionalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fictionalism\", CC BY-SA 4.0) states: Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \"make believe\", thus allowing individuals to treat something as literally true (a \"useful fiction\").","support":[{"end":388,"quote":"Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \\\"make believe\\\", thus allowing individuals to treat something as literally true (a \\\"useful fiction\\\").","source_id":"wikipedia.article.fictionalism","source_sha256":"931da8cc260751f351007688030117a48c281b6a0988ac528b19db65907f4d6b","start":99}],"target_id":"concept.wikipedia.fictionalism","target_kind":"node","target_sha256":"7e75463bab4a04665d615a9dd8b56537d651970a025d9a3be833013b075a7873"}],"concept.wikipedia.field-programmable-gate-array":[{"id":"assertion.concept.wikipedia.field-programmable-gate-array","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Field-programmable gate array as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Field-programmable gate array\", CC BY-SA 4.0) states: A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","support":[{"end":252,"quote":"A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","source_id":"wikipedia.article.field-programmable-gate-array","source_sha256":"de7f4a6616632662bdf739126d5ca46769ef7e875b47fd63269282682673114d","start":114}],"target_id":"concept.wikipedia.field-programmable-gate-array","target_kind":"node","target_sha256":"f5b5c31308f87bf889674251966d5d838b22540c4d1687c8ec18a0a69fe8ead8"}],"concept.wikipedia.fin-field-effect-transistor":[{"id":"assertion.concept.wikipedia.fin-field-effect-transistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fin field-effect transistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fin field-effect transistor\", CC BY-SA 4.0) states: A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","support":[{"end":422,"quote":"A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","source_id":"wikipedia.article.fin-field-effect-transistor","source_sha256":"5295f18951445c8f039daa74cad965365e10e5f587b90eff82f11d94c2e48d0a","start":114}],"target_id":"concept.wikipedia.fin-field-effect-transistor","target_kind":"node","target_sha256":"c00f47446c8b3ef909e5ace1e29670cb62682addc2161a22fd899172a9866f82"}],"concept.wikipedia.finite-model-theory":[{"id":"assertion.concept.wikipedia.finite-model-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Finite model theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Finite model theory\", CC BY-SA 4.0) states: Finite model theory is a subarea of model theory.","support":[{"end":155,"quote":"Finite model theory is a subarea of model theory.","source_id":"wikipedia.article.finite-model-theory","source_sha256":"4af28905c38d558c984ca94c14195b0c7f6b9887229c97bda2848d5f240e70ea","start":106}],"target_id":"concept.wikipedia.finite-model-theory","target_kind":"node","target_sha256":"dc7b5d2dd1d84881dc787412ee93f05180ac86696648edd0f9d37c1a262bace7"}],"concept.wikipedia.first-order-logic":[{"id":"assertion.concept.wikipedia.first-order-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"First-order logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"First-order logic\", CC BY-SA 4.0) states: In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","support":[{"end":293,"quote":"In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","source_id":"wikipedia.article.first-order-logic","source_sha256":"6cd37bb24403b0b1935c11a25fea1cc1dba8c4fbd629ba4825e319e2b3825d8a","start":102}],"target_id":"concept.wikipedia.first-order-logic","target_kind":"node","target_sha256":"811991d4ca56a92d6e4c204801da19f8008d5261e37af7c54dc5fa7646325db7"}],"concept.wikipedia.first-principle":[{"id":"assertion.concept.wikipedia.first-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"First principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"First principle\", CC BY-SA 4.0) states: In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","support":[{"end":247,"quote":"In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","source_id":"wikipedia.article.first-principle","source_sha256":"5199af12a2666ba631ef571760b45f4672f0fb6f80cd94087c0f46261e130e11","start":101}],"target_id":"concept.wikipedia.first-principle","target_kind":"node","target_sha256":"4274675ac905372d6799567671ad2d09ceacafe89d34101dadc0b08a3376d1b9"}],"concept.wikipedia.fitch-notation":[{"id":"assertion.concept.wikipedia.fitch-notation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fitch notation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fitch notation\", CC BY-SA 4.0) states: Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","support":[{"end":379,"quote":"Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","source_id":"wikipedia.article.fitch-notation","source_sha256":"bd3ce4349105c21bdf7f15fc0fe67a4f7eb323b76f1eb8f0a718de86365e80ee","start":101}],"target_id":"concept.wikipedia.fitch-notation","target_kind":"node","target_sha256":"4c4400fed9022fe6907341c06cdac43da55b5084796b277c9ea7e4a61f40bc90"}],"concept.wikipedia.flat-chain":[{"id":"assertion.concept.wikipedia.flat-chain","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flat chain as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flat chain\", CC BY-SA 4.0) states: Flat chain is a form of chain used chiefly in agricultural machinery.","support":[{"end":165,"quote":"Flat chain is a form of chain used chiefly in agricultural machinery.","source_id":"wikipedia.article.flat-chain","source_sha256":"82347ab864988568b503a048ecf324345c30f58dc63b84480b43c7e5ae2f6733","start":96}],"target_id":"concept.wikipedia.flat-chain","target_kind":"node","target_sha256":"ef0af4d917ddf10d1964d7be96de15810fe2022ad7ff363fb83dee3a87b0ada4"}],"concept.wikipedia.flexible-shaft":[{"id":"assertion.concept.wikipedia.flexible-shaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flexible shaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flexible shaft\", CC BY-SA 4.0) states: A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","support":[{"end":261,"quote":"A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","source_id":"wikipedia.article.flexible-shaft","source_sha256":"2031f1c7404dd6e6495622c9f4c6dcbc009aef797306b65fc9bf30eec5990df7","start":101}],"target_id":"concept.wikipedia.flexible-shaft","target_kind":"node","target_sha256":"9253a1587d29cce7f70642155ea656461a71ae9ebc29bd226e87b005c89bb4ea"}],"concept.wikipedia.flexure-bearing":[{"id":"assertion.concept.wikipedia.flexure-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flexure bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flexure bearing\", CC BY-SA 4.0) states: A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","support":[{"end":222,"quote":"A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","source_id":"wikipedia.article.flexure-bearing","source_sha256":"804931c45db537a7e54bf5149c5519d9be541c53f71ad14bcfc54de1310c6841","start":101}],"target_id":"concept.wikipedia.flexure-bearing","target_kind":"node","target_sha256":"7e8721df5f1cb634e4bcfcfe9c142421f41963a223eca771a4dfff97cadb4baa"}],"concept.wikipedia.floquet-theory":[{"id":"assertion.concept.wikipedia.floquet-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Floquet theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Floquet theory\", CC BY-SA 4.0) states: Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","support":[{"end":325,"quote":"Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","source_id":"wikipedia.article.floquet-theory","source_sha256":"cc38de1afcb09f384f70ada213fbf6c7ea07782007e9a7fa6b9437dd3b278a07","start":101}],"target_id":"concept.wikipedia.floquet-theory","target_kind":"node","target_sha256":"5f5fa1a4950901819fcf5cef3bc7f7f7b35119db72f3dc2729d6cbae8607d7cc"}],"concept.wikipedia.flowability":[{"id":"assertion.concept.wikipedia.flowability","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flowability as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flowability\", CC BY-SA 4.0) states: Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","support":[{"end":229,"quote":"Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","source_id":"wikipedia.article.flowability","source_sha256":"1ea0689d8dec2b5758b8001f6684ccf6ad09610851f32b363912921edafa12f1","start":99}],"target_id":"concept.wikipedia.flowability","target_kind":"node","target_sha256":"5cc7c67c300ea43e550b56903a37d22653f6a16090bf5027cd454b6fbddc9038"}],"concept.wikipedia.flue-gas-condensation":[{"id":"assertion.concept.wikipedia.flue-gas-condensation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flue-gas condensation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flue-gas condensation\", CC BY-SA 4.0) states: Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","support":[{"end":306,"quote":"Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","source_id":"wikipedia.article.flue-gas-condensation","source_sha256":"1d55d2d3513c1d3d4fed49e9cf2dfb8add08d627f5c90afed266c9c92f0475ab","start":109}],"target_id":"concept.wikipedia.flue-gas-condensation","target_kind":"node","target_sha256":"32e8a5c3671609c8ad687c1eb6ad419f8b3e31cfbe4549932ac455035e91dc13"}],"concept.wikipedia.fluid-bearing":[{"id":"assertion.concept.wikipedia.fluid-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fluid bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fluid bearing\", CC BY-SA 4.0) states: Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","support":[{"end":247,"quote":"Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","source_id":"wikipedia.article.fluid-bearing","source_sha256":"925b2bba97f25ba8b21da6a1c3f3a6c0fca7e85439a6a6e653129667713e6a97","start":99}],"target_id":"concept.wikipedia.fluid-bearing","target_kind":"node","target_sha256":"5e8c703849d37c00582b23eba364697022e3a8ecefc6ae8ae181e7df7c8ff71d"}],"concept.wikipedia.fluid-coupling":[{"id":"assertion.concept.wikipedia.fluid-coupling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fluid coupling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fluid coupling\", CC BY-SA 4.0) states: A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","support":[{"end":226,"quote":"A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","source_id":"wikipedia.article.fluid-coupling","source_sha256":"089206caa95db54499ddb4cc50f7940673077175944b0e3b978b93ad0d7c86e9","start":101}],"target_id":"concept.wikipedia.fluid-coupling","target_kind":"node","target_sha256":"8bdeec183e52c3c199825271dcdd431814308a92f031054900d682eed025fefd"}],"concept.wikipedia.foil-bearing":[{"id":"assertion.concept.wikipedia.foil-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Foil bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Foil bearing\", CC BY-SA 4.0) states: A foil bearing, also known as a foil-air bearing, is a type of air bearing.","support":[{"end":173,"quote":"A foil bearing, also known as a foil-air bearing, is a type of air bearing.","source_id":"wikipedia.article.foil-bearing","source_sha256":"8ed8e246a75ad36646c06ed0e3f5ea8500101c154b356a56a11bedf1fa7b748b","start":98}],"target_id":"concept.wikipedia.foil-bearing","target_kind":"node","target_sha256":"4271be9306ff32b5ea108bc3366c921f463edd9a9c39491ccfe06629524a03f0"}],"concept.wikipedia.forbidden-knowledge":[{"id":"assertion.concept.wikipedia.forbidden-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Forbidden knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Forbidden knowledge\", CC BY-SA 4.0) states: Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","support":[{"end":262,"quote":"Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","source_id":"wikipedia.article.forbidden-knowledge","source_sha256":"ea0d6c44eba7d3978007f4e850fa369cf945345381e243f120c5f2ada9f96618","start":105}],"target_id":"concept.wikipedia.forbidden-knowledge","target_kind":"node","target_sha256":"14a7c0cf7751d1da2f11134d22b96e667c4b724d004ce4227331263107c7a0fb"}],"concept.wikipedia.force-matching":[{"id":"assertion.concept.wikipedia.force-matching","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Force matching as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Force matching\", CC BY-SA 4.0) states: Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","support":[{"end":259,"quote":"Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","source_id":"wikipedia.article.force-matching","source_sha256":"bef92e8e16477659cb6376116f3a8d1f342119b3b67263ff3c63e83e37867d81","start":102}],"target_id":"concept.wikipedia.force-matching","target_kind":"node","target_sha256":"06550c41d9c9210019057d4cc23f18caf426826225af4eb85ec8dc7eaa9a678f"}],"concept.wikipedia.formal-concept-analysis":[{"id":"assertion.concept.wikipedia.formal-concept-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Formal concept analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Formal concept analysis\", CC BY-SA 4.0) states: In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","support":[{"end":284,"quote":"In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","source_id":"wikipedia.article.formal-concept-analysis","source_sha256":"ad34ce9eae9aeea70c0ffbe6d7eb22cd021f97bd553c4d06d0287fc54292cc62","start":109}],"target_id":"concept.wikipedia.formal-concept-analysis","target_kind":"node","target_sha256":"d55a649b8d99428b292eae4ac665b5850c1816796590f60f9fbd34cd9b2a29a9"}],"concept.wikipedia.formal-fallacy":[{"id":"assertion.concept.wikipedia.formal-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Formal fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Formal fallacy\", CC BY-SA 4.0) states: In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","support":[{"end":273,"quote":"In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","source_id":"wikipedia.article.formal-fallacy","source_sha256":"f4d3ec97f9808ae23ba08e3e2de359bd946fac342f987841e0ed56e11896445e","start":101}],"target_id":"concept.wikipedia.formal-fallacy","target_kind":"node","target_sha256":"d9af9b1d1269c1cf7a491c12f29c1c21042743c53f2272092ab3cb2e902f2508"}],"concept.wikipedia.fort-space":[{"id":"assertion.concept.wikipedia.fort-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fort space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fort space\", CC BY-SA 4.0) states: In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","support":[{"end":176,"quote":"In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","source_id":"wikipedia.article.fort-space","source_sha256":"66d01e5c2914d6a5444e5517a7acfe1a18fe620377e2e2d8ec20c4e0dac6afac","start":98}],"target_id":"concept.wikipedia.fort-space","target_kind":"node","target_sha256":"41a0f28a96d3834583c1e040b3b45f1e9716338cd49422eaf28ee202e5b0852d"}],"concept.wikipedia.four-slide":[{"id":"assertion.concept.wikipedia.four-slide","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Four-slide as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Four-slide\", CC BY-SA 4.0) states: A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","support":[{"end":284,"quote":"A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","source_id":"wikipedia.article.four-slide","source_sha256":"b1109dd214b733bc5ef3096adc1c51709898cbf6488ba07b59e505d293997e7f","start":98}],"target_id":"concept.wikipedia.four-slide","target_kind":"node","target_sha256":"e0fbbdacc87c0e767dd1671ba1791561fbe1e4807cc43d0ba50001fdc7061986"}],"concept.wikipedia.fr-chet-manifold":[{"id":"assertion.concept.wikipedia.fr-chet-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fréchet manifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fréchet manifold\", CC BY-SA 4.0) states: In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","support":[{"end":292,"quote":"In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","source_id":"wikipedia.article.fr-chet-manifold","source_sha256":"110c28ba8b668968d798961a96017b1b482b637c291efe09040ebf7162103d37","start":103}],"target_id":"concept.wikipedia.fr-chet-manifold","target_kind":"node","target_sha256":"7ff385cfddc68a547fb1210edbeb0e9a2113466a394986ad114704102449cc68"}],"concept.wikipedia.frankfurt-cases":[{"id":"assertion.concept.wikipedia.frankfurt-cases","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Frankfurt cases as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Frankfurt cases\", CC BY-SA 4.0) states: Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","support":[{"end":418,"quote":"Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","source_id":"wikipedia.article.frankfurt-cases","source_sha256":"0a27a91f53bb8b46062aba6c9c1155a486298765caa639ccaf8efdafdcd4e711","start":102}],"target_id":"concept.wikipedia.frankfurt-cases","target_kind":"node","target_sha256":"d1c47ba90e9cf71f106a10ed098314d713b743efa8a1a61559a28542d04f59ea"}],"concept.wikipedia.free-choice-inference":[{"id":"assertion.concept.wikipedia.free-choice-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Free choice inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Free choice inference\", CC BY-SA 4.0) states: Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","support":[{"end":284,"quote":"Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","source_id":"wikipedia.article.free-choice-inference","source_sha256":"0581b43b30935370bde462bd5b67ff3d9db950f6bdb0c926c4338eebd2481399","start":109}],"target_id":"concept.wikipedia.free-choice-inference","target_kind":"node","target_sha256":"3fa7f1c7e60b242204d99772beb5643f7fc31b41365aa59b8a1fb0713232272b"}],"concept.wikipedia.free-lattice":[{"id":"assertion.concept.wikipedia.free-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Free lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Free lattice\", CC BY-SA 4.0) states: In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","support":[{"end":206,"quote":"In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","source_id":"wikipedia.article.free-lattice","source_sha256":"0a1390a252b990dbd88bcf2180d9e4c9737929135fe9aa2973c31a6f0d89663b","start":100}],"target_id":"concept.wikipedia.free-lattice","target_kind":"node","target_sha256":"dfcc566897b844a09ce26930345385b6d6819af03f4715f15a768c81067597d9"}],"concept.wikipedia.freivalds-algorithm":[{"id":"assertion.concept.wikipedia.freivalds-algorithm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Freivalds' algorithm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Freivalds' algorithm\", CC BY-SA 4.0) states: Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","support":[{"end":244,"quote":"Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","source_id":"wikipedia.article.freivalds-algorithm","source_sha256":"d6c747a1351e3ef23570bf8ecbbcdafc26ed2038a064426cf8226d13e2d53540","start":107}],"target_id":"concept.wikipedia.freivalds-algorithm","target_kind":"node","target_sha256":"85e5b635a176f2dea7ce4b04580a2bb0cec6230edeb7497ffcfe7df9dcd808f4"}],"concept.wikipedia.fretting":[{"id":"assertion.concept.wikipedia.fretting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fretting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fretting\", CC BY-SA 4.0) states: Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","support":[{"end":248,"quote":"Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","source_id":"wikipedia.article.fretting","source_sha256":"016dccd3390a5ef9bcb65948bd0c5adcdd2d2ce8f892bd20025a769df05de970","start":95}],"target_id":"concept.wikipedia.fretting","target_kind":"node","target_sha256":"0450685ba40d478b498b421fe87d8e5a13859094303b4f66ec2ece9e7fa22b07"}],"concept.wikipedia.friction":[{"id":"assertion.concept.wikipedia.friction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Friction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Friction\", CC BY-SA 4.0) states: Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","support":[{"end":239,"quote":"Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","source_id":"wikipedia.article.friction","source_sha256":"c57314f98cab70c04101ccd81303163d794dac27da96bcc77ed461b210169563","start":93}],"target_id":"concept.wikipedia.friction","target_kind":"node","target_sha256":"954304c58f374486abed6c8ab5aa9e8f7b0692c7926cea9bebd781ef535003ce"}],"concept.wikipedia.fringe-science":[{"id":"assertion.concept.wikipedia.fringe-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fringe science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fringe science\", CC BY-SA 4.0) states: Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","support":[{"end":220,"quote":"Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","source_id":"wikipedia.article.fringe-science","source_sha256":"0bc624921861cb73bb73cd63ef7f311b4c057c13d585a5129456e546996a9788","start":100}],"target_id":"concept.wikipedia.fringe-science","target_kind":"node","target_sha256":"6bfab7022c15994a8ebe560c9b8acb5e1a88708ef06f42785f9ac2d9491af4bc"}],"concept.wikipedia.fudge-factor":[{"id":"assertion.concept.wikipedia.fudge-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fudge factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fudge factor\", CC BY-SA 4.0) states: A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","support":[{"end":248,"quote":"A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","source_id":"wikipedia.article.fudge-factor","source_sha256":"d0c2321c0eb6fffad42d76d52b87b3b046937a665f9c61bcc145d7feb2214e07","start":99}],"target_id":"concept.wikipedia.fudge-factor","target_kind":"node","target_sha256":"557df0735b3aaea11214c05d97eed4634c1f324bde266e443b74f66fa64dc7fd"}],"concept.wikipedia.functional-fixedness":[{"id":"assertion.concept.wikipedia.functional-fixedness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Functional fixedness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Functional fixedness\", CC BY-SA 4.0) states: Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","support":[{"end":227,"quote":"Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","source_id":"wikipedia.article.functional-fixedness","source_sha256":"2320f57f52f7f2470912bb4cc1bcf869a364fe52677f66797242a70b5f4310ed","start":107}],"target_id":"concept.wikipedia.functional-fixedness","target_kind":"node","target_sha256":"86f26fd3e8aa294f6abfc8eaa04be2a2e5fef1f55ebe58fb4849100bea0c119d"}],"concept.wikipedia.furstenberg-boundary":[{"id":"assertion.concept.wikipedia.furstenberg-boundary","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Furstenberg boundary as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Furstenberg boundary\", CC BY-SA 4.0) states: In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","support":[{"end":252,"quote":"In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","source_id":"wikipedia.article.furstenberg-boundary","source_sha256":"14f2c409bada995bb384b0c46aeb6e245efdb9b51cc46f360a1eb8d5940af1a0","start":108}],"target_id":"concept.wikipedia.furstenberg-boundary","target_kind":"node","target_sha256":"4207ccd40ec351bef77d613e314a93cd9a2f7978aba4db690ea3d13adbd5ef8a"}],"concept.wikipedia.further-research-is-needed":[{"id":"assertion.concept.wikipedia.further-research-is-needed","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Further research is needed as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Further research is needed\", CC BY-SA 4.0) states: \"Further research is needed\" (FRIN), \"more research is needed\" and other variants of similar phrases are commonly used in research papers.","support":[{"end":256,"quote":"\\\"Further research is needed\\\" (FRIN), \\\"more research is needed\\\" and other variants of similar phrases are commonly used in research papers.","source_id":"wikipedia.article.further-research-is-needed","source_sha256":"c1582f6aa072548129dd05fca70508f7308954df469b596e5893d6dbb7658d40","start":114}],"target_id":"concept.wikipedia.further-research-is-needed","target_kind":"node","target_sha256":"a4f63b15877f9bec6bcd04eae2225757d74131ec7737951d76847d4299c6e1ed"}],"concept.wikipedia.game-semantics":[{"id":"assertion.concept.wikipedia.game-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Game semantics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Game semantics\", CC BY-SA 4.0) states: Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","support":[{"end":282,"quote":"Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","source_id":"wikipedia.article.game-semantics","source_sha256":"7ff8c7ec45ecf4aec35d8ba1ab18cbf8f3094c23a588259bd6d31eb228d2ebd1","start":100}],"target_id":"concept.wikipedia.game-semantics","target_kind":"node","target_sha256":"8e5cf79e0f8386cb7f8a5eb79e1ef6a730b8272680bd600b961f86aa14b35214"}],"concept.wikipedia.gate-oxide":[{"id":"assertion.concept.wikipedia.gate-oxide","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gate oxide as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gate oxide\", CC BY-SA 4.0) states: The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","support":[{"end":379,"quote":"The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","source_id":"wikipedia.article.gate-oxide","source_sha256":"5cde5d2b887131f2ca39ad2c7f1e35954f7066c1450b7115f964c014b4996229","start":98}],"target_id":"concept.wikipedia.gate-oxide","target_kind":"node","target_sha256":"8ea9d86cceb9c4009943131b10ecff0f395735f355567d52fbaab6390e79ebe6"}],"concept.wikipedia.gear":[{"id":"assertion.concept.wikipedia.gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear\", CC BY-SA 4.0) states: A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \"teeth\" that engage with compatible teeth of another gear or other part.","support":[{"end":327,"quote":"A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \\\"teeth\\\"  that engage with compatible teeth of another gear or other part.","source_id":"wikipedia.article.gear","source_sha256":"6043b16ad62bcd86898cfcf743b9621c0fdfc84c36a614d5ff69ebea3cbb606d","start":89}],"target_id":"concept.wikipedia.gear","target_kind":"node","target_sha256":"1b20519eb8ee4a2b2b3adefd8a772c297b05448b4887c4e9621972da2ec09bc3"}],"concept.wikipedia.gear-failure":[{"id":"assertion.concept.wikipedia.gear-failure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear failure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear failure\", CC BY-SA 4.0) states: Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","support":[{"end":213,"quote":"Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","source_id":"wikipedia.article.gear-failure","source_sha256":"68043f2b7b31c38e9a03665488f75ec8f315fc746f296aca7204331eb971cf91","start":100}],"target_id":"concept.wikipedia.gear-failure","target_kind":"node","target_sha256":"4209f4460142a24729e78246621483e1f670822a1a90a24719d81128445132ac"}],"concept.wikipedia.gear-oil":[{"id":"assertion.concept.wikipedia.gear-oil","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear oil as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear oil\", CC BY-SA 4.0) states: Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","support":[{"end":234,"quote":"Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","source_id":"wikipedia.article.gear-oil","source_sha256":"691f32809b3dc21a57ce58333f8332a7ac167cb6353d16a72f0af9fa0c342381","start":95}],"target_id":"concept.wikipedia.gear-oil","target_kind":"node","target_sha256":"cad304c4d6e8e0d0e9ada4f4c3e17730ab2efc53700803168b4fd132e92824ab"}],"concept.wikipedia.gelfand-pair":[{"id":"assertion.concept.wikipedia.gelfand-pair","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gelfand pair as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gelfand pair\", CC BY-SA 4.0) states: In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","support":[{"end":285,"quote":"In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","source_id":"wikipedia.article.gelfand-pair","source_sha256":"6ce9c15ba7a11cd00c4919cace2c2886426749dbc1567d11ab8a3c3fa7e4a9f9","start":99}],"target_id":"concept.wikipedia.gelfand-pair","target_kind":"node","target_sha256":"0ac1a54e7e90b97d6333d858f0ac95fa3ced82be90e34958ec8f3c334120b83b"}],"concept.wikipedia.gender-of-connectors-and-fasteners":[{"id":"assertion.concept.wikipedia.gender-of-connectors-and-fasteners","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gender of connectors and fasteners as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gender of connectors and fasteners\", CC BY-SA 4.0) states: In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","support":[{"end":318,"quote":"In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","source_id":"wikipedia.article.gender-of-connectors-and-fasteners","source_sha256":"7513d481f5a8f31e3095cf12afb756afcd861402944e260d47ff851c051dfc53","start":121}],"target_id":"concept.wikipedia.gender-of-connectors-and-fasteners","target_kind":"node","target_sha256":"6defb8e27a66f72d6791ba958e9694d89e59fb149cae401497c75543083c3fed"}],"concept.wikipedia.general-knowledge":[{"id":"assertion.concept.wikipedia.general-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"General knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"General knowledge\", CC BY-SA 4.0) states: General knowledge is information that has been accumulated over time through various media and sources.","support":[{"end":207,"quote":"General knowledge is information that has been accumulated over time through various media and sources.","source_id":"wikipedia.article.general-knowledge","source_sha256":"33c258e9325a0d1194263570f19907f0cbad28e3d544ca7e1fa511fdd90e577a","start":104}],"target_id":"concept.wikipedia.general-knowledge","target_kind":"node","target_sha256":"2ab11489b82f2ead4436155792b093de6bc66db4160fcfc70381d9dd1c2d5e58"}],"concept.wikipedia.generality-psychology":[{"id":"assertion.concept.wikipedia.generality-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Generality (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Generality (psychology)\", CC BY-SA 4.0) states: In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","support":[{"end":340,"quote":"In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","source_id":"wikipedia.article.generality-psychology","source_sha256":"ec749169314a9aa39a0b49a93f7aaa3a8124757caf2d8bf2bceff64381281a4e","start":110}],"target_id":"concept.wikipedia.generality-psychology","target_kind":"node","target_sha256":"9cadbc81385e739937f01cd6c953538a1296cf21505904f95da5f395b13cfcb1"}],"concept.wikipedia.generalization":[{"id":"assertion.concept.wikipedia.generalization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Generalization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Generalization\", CC BY-SA 4.0) states: A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","support":[{"end":234,"quote":"A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","source_id":"wikipedia.article.generalization","source_sha256":"e1f8dcc48c390a0beb2b9a90643152d294e1238361fae20f7547e4b8211ad605","start":99}],"target_id":"concept.wikipedia.generalization","target_kind":"node","target_sha256":"558ca6973bf8da88ddb7138a46c26a846e75d77e3a744bec3e7c3223c2236bdc"}],"concept.wikipedia.geological-structure-measurement-by-lidar":[{"id":"assertion.concept.wikipedia.geological-structure-measurement-by-lidar","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geological structure measurement by LiDAR as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geological structure measurement by LiDAR\", CC BY-SA 4.0) states: Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","support":[{"end":239,"quote":"Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","source_id":"wikipedia.article.geological-structure-measurement-by-lidar","source_sha256":"4b912bc3687a8ed00a60fde467eea4cee55fd67bfed72face1794724c9221cdf","start":129}],"target_id":"concept.wikipedia.geological-structure-measurement-by-lidar","target_kind":"node","target_sha256":"8dfb9118b39f2bf3418961f86f15218cc921ccaf70d39631eba77bea92e47246"}],"concept.wikipedia.geometric-progression":[{"id":"assertion.concept.wikipedia.geometric-progression","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric progression as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric progression\", CC BY-SA 4.0) states: A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","support":[{"end":332,"quote":"A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","source_id":"wikipedia.article.geometric-progression","source_sha256":"86ae99fd392beb8c807f6d53786855b97aec25e388552cc3770926f06e18721e","start":109}],"target_id":"concept.wikipedia.geometric-progression","target_kind":"node","target_sha256":"a7727dd60136d751e2be2339be8207ac666955d6452a9b8ac91cd49a62292460"}],"concept.wikipedia.geometric-topology-object":[{"id":"assertion.concept.wikipedia.geometric-topology-object","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric topology (object) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric topology (object)\", CC BY-SA 4.0) states: In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","support":[{"end":235,"quote":"In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","source_id":"wikipedia.article.geometric-topology-object","source_sha256":"6b66bf4867e0b15d9906a0b3061545ff3a3a3ff5213b018bdc411bb9bf9b2f76","start":114}],"target_id":"concept.wikipedia.geometric-topology-object","target_kind":"node","target_sha256":"9befb77cd54ca4858a4be8e471befd74a94253a76991f5d03fd1e2a8733cc982"}],"concept.wikipedia.geometry-of-interaction":[{"id":"assertion.concept.wikipedia.geometry-of-interaction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometry of interaction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometry of interaction\", CC BY-SA 4.0) states: In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","support":[{"end":235,"quote":"In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","source_id":"wikipedia.article.geometry-of-interaction","source_sha256":"9fa1b5deb4f29ac71300405154470f6ede4193f0153fbf6d1a4ece89b935f718","start":110}],"target_id":"concept.wikipedia.geometry-of-interaction","target_kind":"node","target_sha256":"20e73dae8f62cbd2cf9cfd1af37f9ce14571fd4719e71f8c0720efac8294521b"}],"concept.wikipedia.gestell":[{"id":"assertion.concept.wikipedia.gestell","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gestell as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gestell\", CC BY-SA 4.0) states: Gestell (or Ge-stell, translated as \"Enframing\" or \"positioning\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","support":[{"end":301,"quote":"Gestell (or Ge-stell, translated as \\\"Enframing\\\" or \\\"positioning\\\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","source_id":"wikipedia.article.gestell","source_sha256":"666744373fc2e4cad09d05dcd4299ddb697db95b18ae1d2849a233514541fe40","start":94}],"target_id":"concept.wikipedia.gestell","target_kind":"node","target_sha256":"6a82177f7cb541c8b51c1cf1697208df1e5e913f5e9f4055b6c49cf7a054a1ae"}],"concept.wikipedia.ggnmos":[{"id":"assertion.concept.wikipedia.ggnmos","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"GgNMOS as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"GgNMOS\", CC BY-SA 4.0) states: Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","support":[{"end":236,"quote":"Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","source_id":"wikipedia.article.ggnmos","source_sha256":"e47662671eb90d35df712488f1e4d39ec538229627d02be98c9e73933ae11eff","start":93}],"target_id":"concept.wikipedia.ggnmos","target_kind":"node","target_sha256":"24288489e010014c2522ec3738472eaa0d22f08692f5678147eb77c480ffcc9d"}],"concept.wikipedia.graph-coloring":[{"id":"assertion.concept.wikipedia.graph-coloring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Graph coloring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Graph coloring\", CC BY-SA 4.0) states: In graph theory, graph coloring is a methodic assignment of labels traditionally called \"colors\" to elements of a graph.","support":[{"end":222,"quote":"In graph theory, graph coloring is a methodic assignment of labels traditionally called \\\"colors\\\" to elements of a graph.","source_id":"wikipedia.article.graph-coloring","source_sha256":"a47924373604ae8d49dad58c9bc1173eeb61cad4d60ec802819b448f02f91fb1","start":100}],"target_id":"concept.wikipedia.graph-coloring","target_kind":"node","target_sha256":"30b1290ac4c5b2740742f69310b5a0bef6dc408dcab1baaf84cf544f2e86db30"}],"concept.wikipedia.graphism-thesis":[{"id":"assertion.concept.wikipedia.graphism-thesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Graphism thesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Graphism thesis\", CC BY-SA 4.0) states: In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","support":[{"end":375,"quote":"In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","source_id":"wikipedia.article.graphism-thesis","source_sha256":"a62b99c3771c3d08c7b8607c250119549daf37dcd31a2435e8d77e413e98d2a0","start":103}],"target_id":"concept.wikipedia.graphism-thesis","target_kind":"node","target_sha256":"fbd3bf424f6e5e66673610c261b42e9f3e04e26d77242227b878c28c411ed4cc"}],"concept.wikipedia.ground-truth":[{"id":"assertion.concept.wikipedia.ground-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ground truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ground truth\", CC BY-SA 4.0) states: Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","support":[{"end":281,"quote":"Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","source_id":"wikipedia.article.ground-truth","source_sha256":"3b3c0818e9574ee0abaed4ef9e2b8f43cc7a1559618a2130f36906931cc1a72b","start":98}],"target_id":"concept.wikipedia.ground-truth","target_kind":"node","target_sha256":"28da23a706a4c87c4c0870b4aa3d8f290c490858024a1836ff4a9bd51945aaa8"}],"concept.wikipedia.group-algebra-of-a-locally-compact-group":[{"id":"assertion.concept.wikipedia.group-algebra-of-a-locally-compact-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Group algebra of a locally compact group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Group algebra of a locally compact group\", CC BY-SA 4.0) states: In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","support":[{"end":414,"quote":"In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group  an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","source_id":"wikipedia.article.group-algebra-of-a-locally-compact-group","source_sha256":"f9a9326b390afcbab8f7a4aa7491ea7cb4a8491dbf05ccba426d12440dd795c7","start":126}],"target_id":"concept.wikipedia.group-algebra-of-a-locally-compact-group","target_kind":"node","target_sha256":"abf65e4c012c839a0f0b3c2a4fbc8d3c395279e6dc10d6d43442610dd9a4800a"}],"concept.wikipedia.group-mathematics":[{"id":"assertion.concept.wikipedia.group-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Group (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Group (mathematics)\", CC BY-SA 4.0) states: In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","support":[{"end":244,"quote":"In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","source_id":"wikipedia.article.group-mathematics","source_sha256":"eefaf5e31abf300469a1a051ddfd759b763658d7b86de7acfd39d16aa2a005bd","start":104}],"target_id":"concept.wikipedia.group-mathematics","target_kind":"node","target_sha256":"0f2a677dee647be9113201f5cd91cfa0450dd8ab88dd0c091f1e81ea58376e5a"}],"concept.wikipedia.gunslinger-effect":[{"id":"assertion.concept.wikipedia.gunslinger-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gunslinger effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gunslinger effect\", CC BY-SA 4.0) states: The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","support":[{"end":316,"quote":"The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","source_id":"wikipedia.article.gunslinger-effect","source_sha256":"cfff405457fd4efd9d06dc4303208405e9a2f934e72d65d31459be7f65d9abc9","start":105}],"target_id":"concept.wikipedia.gunslinger-effect","target_kind":"node","target_sha256":"2f2fe6e7ae5491950c442172dbfd0d499d3c6dbcba31abcdec8a7fddaa9bd34a"}],"concept.wikipedia.hadamard-product-matrices":[{"id":"assertion.concept.wikipedia.hadamard-product-matrices","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hadamard product (matrices) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hadamard product (matrices)\", CC BY-SA 4.0) states: In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","support":[{"end":363,"quote":"In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","source_id":"wikipedia.article.hadamard-product-matrices","source_sha256":"204ce7b2d897ccafafe3adcae9c28b650b3be98ac3b3d40799272bb0fdda268a","start":115}],"target_id":"concept.wikipedia.hadamard-product-matrices","target_kind":"node","target_sha256":"0efc0eabc6eac67ff49c7f8174dc13531099438478c60a995ba0a6acad981700"}],"concept.wikipedia.half-truth":[{"id":"assertion.concept.wikipedia.half-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Half-truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Half-truth\", CC BY-SA 4.0) states: A half-truth is a deceptive statement that includes some element of truth.","support":[{"end":171,"quote":"A half-truth is a deceptive statement that includes some element of truth.","source_id":"wikipedia.article.half-truth","source_sha256":"650274c562a04b448754ad6823feb4652ee3402ea770b34affcf38ab7b971493","start":97}],"target_id":"concept.wikipedia.half-truth","target_kind":"node","target_sha256":"f75b62ee5b8e1962b55655f82340976743ebf16d8fc0f56399aad3f1f4fe2e53"}],"concept.wikipedia.halton-sequence":[{"id":"assertion.concept.wikipedia.halton-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Halton sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Halton sequence\", CC BY-SA 4.0) states: In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","support":[{"end":235,"quote":"In statistics, Halton sequences are  sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","source_id":"wikipedia.article.halton-sequence","source_sha256":"67d337e087cdc74c1bef695934a03c2f1b789b2e1ca9720aa6a62ffa525aac80","start":101}],"target_id":"concept.wikipedia.halton-sequence","target_kind":"node","target_sha256":"298495e2173ba37ce125fd0841605453cf2d7ac62a7e9a2b96895dbac673a6fd"}],"concept.wikipedia.harking":[{"id":"assertion.concept.wikipedia.harking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"HARKing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"HARKing\", CC BY-SA 4.0) states: HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\".","support":[{"end":372,"quote":"HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \\\"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\\\".","source_id":"wikipedia.article.harking","source_sha256":"c849ef208ec43aff5396b73a974b4ea8b62794800f63db04636c64dcc1f07071","start":95}],"target_id":"concept.wikipedia.harking","target_kind":"node","target_sha256":"03eaab86fadc071999697117f64c40d476dbb292e6584467e76aedeab0b69893"}],"concept.wikipedia.harmonic-progression-mathematics":[{"id":"assertion.concept.wikipedia.harmonic-progression-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic progression (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic progression (mathematics)\", CC BY-SA 4.0) states: In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","support":[{"end":310,"quote":"In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","source_id":"wikipedia.article.harmonic-progression-mathematics","source_sha256":"9f0514fea419f200aca40e33c11cad9034cf434c1312211aab87abb01c1e7c87","start":122}],"target_id":"concept.wikipedia.harmonic-progression-mathematics","target_kind":"node","target_sha256":"1df1d016c89394429f512057091292507c8c55f6223692101e01d4ba6377daa9"}],"concept.wikipedia.harmonic-tensors":[{"id":"assertion.concept.wikipedia.harmonic-tensors","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic tensors as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic tensors\", CC BY-SA 4.0) states: In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","support":[{"end":276,"quote":"In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","source_id":"wikipedia.article.harmonic-tensors","source_sha256":"f11cd1e8368474cba7f9e1c9412db11ed1ccaf0cfca3578ac1fbfda2179375a1","start":104}],"target_id":"concept.wikipedia.harmonic-tensors","target_kind":"node","target_sha256":"c73626b84a03de250cac03b8c09a25fe4cbdaf385065679d3065485bc00fd98d"}],"concept.wikipedia.heat-exchanger":[{"id":"assertion.concept.wikipedia.heat-exchanger","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heat exchanger as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heat exchanger\", CC BY-SA 4.0) states: A heat exchanger is a system used to transfer heat between a source and a working fluid.","support":[{"end":188,"quote":"A heat exchanger is a system used to transfer heat between a source and a working fluid.","source_id":"wikipedia.article.heat-exchanger","source_sha256":"1e03284fbd5f3648047b158df5f509cb82e3496bb12a84a0801076f697ad828e","start":100}],"target_id":"concept.wikipedia.heat-exchanger","target_kind":"node","target_sha256":"e11e3368513963ef6114c9d8e1d139d47194fe4423fed9af5f5a7e73e22e8a78"}],"concept.wikipedia.heat-sink":[{"id":"assertion.concept.wikipedia.heat-sink","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heat sink as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heat sink\", CC BY-SA 4.0) states: A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","support":[{"end":393,"quote":"A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","source_id":"wikipedia.article.heat-sink","source_sha256":"d4920f5d93d401f82f33e17b7da31937c53298e4d4dbb02c4be9f25cf63e24e5","start":95}],"target_id":"concept.wikipedia.heat-sink","target_kind":"node","target_sha256":"828593825e444ce5551fb36faac7493dfe9ae43ee38400c59d310d1e115a7bfa"}],"concept.wikipedia.heater-core":[{"id":"assertion.concept.wikipedia.heater-core","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heater core as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heater core\", CC BY-SA 4.0) states: A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","support":[{"end":275,"quote":"A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","source_id":"wikipedia.article.heater-core","source_sha256":"e838a7bbf649b001cca694b6acf34c0076a0b14f2e9d394e8ebb61b1b20075b9","start":98}],"target_id":"concept.wikipedia.heater-core","target_kind":"node","target_sha256":"ac6365e48e886bb900e848df61b6847650bc82e156094f1f38eb30e9c25ab5d0"}],"concept.wikipedia.helix-angle":[{"id":"assertion.concept.wikipedia.helix-angle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Helix angle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Helix angle\", CC BY-SA 4.0) states: In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","support":[{"end":229,"quote":"In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","source_id":"wikipedia.article.helix-angle","source_sha256":"47e487958ff8afa76281166392584d6288208fec8387fdb86ad94f396be8199c","start":99}],"target_id":"concept.wikipedia.helix-angle","target_kind":"node","target_sha256":"41911c5d02ad54335b3bcb2bb45304e73a189ec4a80936a54c2cd0fe74d60a0f"}],"concept.wikipedia.high-tensile-chain":[{"id":"assertion.concept.wikipedia.high-tensile-chain","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"High-tensile chain as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"High-tensile chain\", CC BY-SA 4.0) states: A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength used for drawing or securing loads.","support":[{"end":248,"quote":"A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength  used for drawing or securing loads.","source_id":"wikipedia.article.high-tensile-chain","source_sha256":"156859a794bbae16a1d5c9e29ab3fc71d899bfa85edd2b68708ed902a3b7c75c","start":106}],"target_id":"concept.wikipedia.high-tensile-chain","target_kind":"node","target_sha256":"61a1d3a402194c39cf16dd24c44ce815192d0757b3f2ace990802b9922b9ab7b"}],"concept.wikipedia.hoist-device":[{"id":"assertion.concept.wikipedia.hoist-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hoist (device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hoist (device)\", CC BY-SA 4.0) states: A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","support":[{"end":223,"quote":"A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","source_id":"wikipedia.article.hoist-device","source_sha256":"e7947eef440242bae216fd5be58e37839b8073a533d4ffb4a7cc6528678655c5","start":101}],"target_id":"concept.wikipedia.hoist-device","target_kind":"node","target_sha256":"ebeb502d3e4c0a0c781864bb9b49b2b0ac51d6f9ce149dae6effaabca8370070"}],"concept.wikipedia.hydraulic-cylinder":[{"id":"assertion.concept.wikipedia.hydraulic-cylinder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hydraulic cylinder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hydraulic cylinder\", CC BY-SA 4.0) states: A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","support":[{"end":296,"quote":"A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","source_id":"wikipedia.article.hydraulic-cylinder","source_sha256":"b11076e4a61c09b97abe24ba85a9d1d70cdd42d4a5a610fa4f5a53a4522e9abd","start":105}],"target_id":"concept.wikipedia.hydraulic-cylinder","target_kind":"node","target_sha256":"2e303849e440e1a8a3321fc45d0d165ddd3a9d643aedf13687251c958d5e76ac"}],"concept.wikipedia.imperfect-induction":[{"id":"assertion.concept.wikipedia.imperfect-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Imperfect induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Imperfect induction\", CC BY-SA 4.0) states: Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","support":[{"end":224,"quote":"Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","source_id":"wikipedia.article.imperfect-induction","source_sha256":"4fe007efa4dd28f3adffca4c23b3b49dc727e3b118fd45e6109ddc9c1590b9b7","start":106}],"target_id":"concept.wikipedia.imperfect-induction","target_kind":"node","target_sha256":"67bbdb669f7433e66dd59c3e8ee175f9f56f5b0a129281ab1a231b03916d7087"}],"concept.wikipedia.implicit-and-explicit-knowledge":[{"id":"assertion.concept.wikipedia.implicit-and-explicit-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Implicit and explicit knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Implicit and explicit knowledge\", CC BY-SA 4.0) states: Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","support":[{"end":256,"quote":"Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","source_id":"wikipedia.article.implicit-and-explicit-knowledge","source_sha256":"eccbf7d2300f098c3a8f75a6e4c0a71ebf8bc634443a85d9adb58cb8b25a203d","start":119}],"target_id":"concept.wikipedia.implicit-and-explicit-knowledge","target_kind":"node","target_sha256":"8c5bd976b6dd6158f26ddc999503e30ef381c45464214c09434951ea53a92375"}],"concept.wikipedia.inductionism":[{"id":"assertion.concept.wikipedia.inductionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inductionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inductionism\", CC BY-SA 4.0) states: Inductionism is the scientific philosophy where laws are \"induced\" from sets of data.","support":[{"end":186,"quote":"Inductionism is the scientific philosophy where laws are \\\"induced\\\" from sets of data.","source_id":"wikipedia.article.inductionism","source_sha256":"d8897010435ee2136ecc201c3bbe5a59ff2e28320c6b3ecf0ec9ec59d97c65cf","start":99}],"target_id":"concept.wikipedia.inductionism","target_kind":"node","target_sha256":"e708f21ff95a993749c880939433683ea20cc483116212b856658068fa49ba6f"}],"concept.wikipedia.inert-knowledge":[{"id":"assertion.concept.wikipedia.inert-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inert knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inert knowledge\", CC BY-SA 4.0) states: Inert knowledge is information which one can express but not use.","support":[{"end":167,"quote":"Inert knowledge is information which one can express but not use.","source_id":"wikipedia.article.inert-knowledge","source_sha256":"7d000ce87c9c788336ccc920287ab576e2b1c8b616d87425b711d1479e774ec9","start":102}],"target_id":"concept.wikipedia.inert-knowledge","target_kind":"node","target_sha256":"38943ddd1f6d8b38ccebb14a685227987fa48b332d46c301246e04bf6e82a5b4"}],"concept.wikipedia.inference-engine":[{"id":"assertion.concept.wikipedia.inference-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inference engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inference engine\", CC BY-SA 4.0) states: In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","support":[{"end":287,"quote":"In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","source_id":"wikipedia.article.inference-engine","source_sha256":"37fc86683bc270e3b2acb4bc5409708f55ebc982fccd5b6cb72d46a620280580","start":102}],"target_id":"concept.wikipedia.inference-engine","target_kind":"node","target_sha256":"73d6233b6c754512868396807e92d8f6826e5025fd81b92c52b3f8adbd76cc76"}],"concept.wikipedia.infinite-regress":[{"id":"assertion.concept.wikipedia.infinite-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Infinite regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Infinite regress\", CC BY-SA 4.0) states: Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","support":[{"end":250,"quote":"Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","source_id":"wikipedia.article.infinite-regress","source_sha256":"4feb18e50ce70f25afeed8f4cae0263c71e7537df36309510c93a3805e8de059","start":103}],"target_id":"concept.wikipedia.infinite-regress","target_kind":"node","target_sha256":"8df6cbe78695436ad994269b0bda5114e6c57c2953185e487a0cd43980fc64e7"}],"concept.wikipedia.inflatable-packer":[{"id":"assertion.concept.wikipedia.inflatable-packer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inflatable packer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inflatable packer\", CC BY-SA 4.0) states: An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","support":[{"end":278,"quote":"An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","source_id":"wikipedia.article.inflatable-packer","source_sha256":"201e37faac6a98c0fd7f7123b764eae2f9732844e535b63551bf25b9ec6bec45","start":105}],"target_id":"concept.wikipedia.inflatable-packer","target_kind":"node","target_sha256":"c4f95573981abc6d3560d6251219413c1902d56b496428f513edf4149f3dba46"}],"concept.wikipedia.informal-fallacy":[{"id":"assertion.concept.wikipedia.informal-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Informal fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Informal fallacy\", CC BY-SA 4.0) states: Informal fallacies are a type of incorrect argument in natural language.","support":[{"end":175,"quote":"Informal fallacies are a type of incorrect argument in natural language.","source_id":"wikipedia.article.informal-fallacy","source_sha256":"7502ae964cf2b55064e1a216d538ac704d7c29f42c89080d76457ca59172dbe3","start":103}],"target_id":"concept.wikipedia.informal-fallacy","target_kind":"node","target_sha256":"2126e3b039291174118a3d4d3ef2ad80040db4029c78566e68c7bdaa9436c6ae"}],"concept.wikipedia.insight-phenomenology":[{"id":"assertion.concept.wikipedia.insight-phenomenology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Insight phenomenology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Insight phenomenology\", CC BY-SA 4.0) states: Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","support":[{"end":200,"quote":"Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","source_id":"wikipedia.article.insight-phenomenology","source_sha256":"61824fd5587efb6cc222e76b39b3c32f07272e9d29075da0645059433ee20fcd","start":108}],"target_id":"concept.wikipedia.insight-phenomenology","target_kind":"node","target_sha256":"2ded380b8cc4ae80a45b271fe4aca2157bb4668070e5872182cd6bfb2f394d09"}],"concept.wikipedia.instrumentalism":[{"id":"assertion.concept.wikipedia.instrumentalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Instrumentalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Instrumentalism\", CC BY-SA 4.0) states: In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","support":[{"end":332,"quote":"In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","source_id":"wikipedia.article.instrumentalism","source_sha256":"cf4e8a2adac4e4c0a079aa20c8acc0db1e7322608ed687c698f644c23a9ab1b4","start":101}],"target_id":"concept.wikipedia.instrumentalism","target_kind":"node","target_sha256":"a90656cdd3babf6154d3d1c91fe91e0e0acfa7a8dbb082d0cddffbbfbe811b3a"}],"concept.wikipedia.interdisciplinarity":[{"id":"assertion.concept.wikipedia.interdisciplinarity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Interdisciplinarity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Interdisciplinarity\", CC BY-SA 4.0) states: Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","support":[{"end":263,"quote":"Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","source_id":"wikipedia.article.interdisciplinarity","source_sha256":"720fbbbc89b553ec3bb0d609aeefb327010c356ee11ddfb9c82cfc2f5bec461e","start":104}],"target_id":"concept.wikipedia.interdisciplinarity","target_kind":"node","target_sha256":"d1c920e153de9e0cec786fdb4f2ee6742d59a9d586a0022de55feca5cbcbaace"}],"concept.wikipedia.intertwingularity":[{"id":"assertion.concept.wikipedia.intertwingularity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Intertwingularity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Intertwingularity\", CC BY-SA 4.0) states: Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","support":[{"end":315,"quote":"Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","source_id":"wikipedia.article.intertwingularity","source_sha256":"448769ee8d3255254db0fafa9953a4f9bf53889fc39e07fce2660984a0124446","start":103}],"target_id":"concept.wikipedia.intertwingularity","target_kind":"node","target_sha256":"cb8fbc1386306e37dd0cc8242d00c7c79ca13af383345b8c14e85ba4bb3ead94"}],"concept.wikipedia.inventor-s-paradox":[{"id":"assertion.concept.wikipedia.inventor-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inventor's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inventor's paradox\", CC BY-SA 4.0) states: The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","support":[{"end":198,"quote":"The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","source_id":"wikipedia.article.inventor-s-paradox","source_sha256":"05cddb2641e51c2adb375e9c40d4ad4eb0d28385e2c84a95120eedb0d6dfaa41","start":106}],"target_id":"concept.wikipedia.inventor-s-paradox","target_kind":"node","target_sha256":"9ba5d608dab619d7005a391af1b8a201f8930cee7e1bf7c52fae87cd90a52baf"}],"concept.wikipedia.inverterization":[{"id":"assertion.concept.wikipedia.inverterization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inverterization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inverterization\", CC BY-SA 4.0) states: Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","support":[{"end":267,"quote":"Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","source_id":"wikipedia.article.inverterization","source_sha256":"e69a05b49ceb7aef25d15bf4f169ecdd4f8eb394be9c294e2edcc4426cae8689","start":103}],"target_id":"concept.wikipedia.inverterization","target_kind":"node","target_sha256":"7b11d6e4e13ae3c44b69f8d6e184c10da775a31bd07ab30db3a11eeaff466dbd"}],"concept.wikipedia.irrationality":[{"id":"assertion.concept.wikipedia.irrationality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Irrationality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Irrationality\", CC BY-SA 4.0) states: Irrationality is cognition, thinking, talking, or acting without rationality.","support":[{"end":176,"quote":"Irrationality is cognition, thinking, talking, or acting without rationality.","source_id":"wikipedia.article.irrationality","source_sha256":"734d9a5f28f27a32a5a7a9656e6f47e4ed0a028dc64a7467d5663c99058c6142","start":99}],"target_id":"concept.wikipedia.irrationality","target_kind":"node","target_sha256":"60d8d11e7b26284a400b55b19379de3badadfb5a58becd00b0757a6a11e5ab26"}],"concept.wikipedia.issue-based-information-system":[{"id":"assertion.concept.wikipedia.issue-based-information-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Issue-based information system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Issue-based information system\", CC BY-SA 4.0) states: The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","support":[{"end":290,"quote":"The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","source_id":"wikipedia.article.issue-based-information-system","source_sha256":"bac92b0377ed928fd19c963d2b877e6f3f92c8c4d6ec7a8330538afdd17ff2d0","start":118}],"target_id":"concept.wikipedia.issue-based-information-system","target_kind":"node","target_sha256":"7edfb49f5532bba4fe458f83a3d38db306c45c01cf8e57378c3c059d81e84a12"}],"concept.wikipedia.jackshaft-locomotive":[{"id":"assertion.concept.wikipedia.jackshaft-locomotive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jackshaft (locomotive) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jackshaft (locomotive)\", CC BY-SA 4.0) states: A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","support":[{"end":294,"quote":"A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","source_id":"wikipedia.article.jackshaft-locomotive","source_sha256":"d5a6a9837e8a117f514051463439b30e394268a75f20cf3f5a2dfa9628fea3e3","start":109}],"target_id":"concept.wikipedia.jackshaft-locomotive","target_kind":"node","target_sha256":"60fcba032fef464658145045ed100676d264d4babdd395d4f2fe6ce850e45246"}],"concept.wikipedia.javelin-argument":[{"id":"assertion.concept.wikipedia.javelin-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Javelin argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Javelin argument\", CC BY-SA 4.0) states: The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","support":[{"end":238,"quote":"The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","source_id":"wikipedia.article.javelin-argument","source_sha256":"8bf31b46a74aa6e250d30603b5e23a17fde4c712a7c078f0a65747366e42b813","start":103}],"target_id":"concept.wikipedia.javelin-argument","target_kind":"node","target_sha256":"a2b2ed79391507a3d021b4c290cbad00b734989a63060d51d0dc46aff0c3c96e"}],"concept.wikipedia.jewel-bearing":[{"id":"assertion.concept.wikipedia.jewel-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jewel bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jewel bearing\", CC BY-SA 4.0) states: A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","support":[{"end":193,"quote":"A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","source_id":"wikipedia.article.jewel-bearing","source_sha256":"bff6949f277d805298adfa6be7a5f5010bc9784bffad6ff4ad31eb0ba5b8caec","start":99}],"target_id":"concept.wikipedia.jewel-bearing","target_kind":"node","target_sha256":"80e283b08fb837ee32245f76bc4cc1f2d53857b468e308dd1951a159583c48ce"}],"concept.wikipedia.knowledge-falsification":[{"id":"assertion.concept.wikipedia.knowledge-falsification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge falsification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge falsification\", CC BY-SA 4.0) states: Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","support":[{"end":222,"quote":"Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","source_id":"wikipedia.article.knowledge-falsification","source_sha256":"c2d058284f48e5d67edf43a34566d8bc0d1f94b8106d00304d778539a087d270","start":111}],"target_id":"concept.wikipedia.knowledge-falsification","target_kind":"node","target_sha256":"560959545e1c53506006ce7eccf35778904eb1d66786b389e20df7397783262e"}],"concept.wikipedia.knowledge-inertia":[{"id":"assertion.concept.wikipedia.knowledge-inertia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge inertia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge inertia\", CC BY-SA 4.0) states: Knowledge inertia (KI) is a concept in knowledge management.","support":[{"end":166,"quote":"Knowledge inertia  (KI) is a concept in knowledge management.","source_id":"wikipedia.article.knowledge-inertia","source_sha256":"ba54c09c44a3f65b0ba738ca2c59e8100283a69096e2b589aae2bb30bcb73b92","start":105}],"target_id":"concept.wikipedia.knowledge-inertia","target_kind":"node","target_sha256":"5a1f04e989aba7a5cbcb199170af856a82c0b03147e6f765c9b390dff8fa9ae6"}],"concept.wikipedia.knowledge-is-power":[{"id":"assertion.concept.wikipedia.knowledge-is-power","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge is power as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge is power\", CC BY-SA 4.0) states: The phrase \"scientia potentia est\" (or \"scientia est potentia\" or also \"scientia potestas est\") is a Latin aphorism meaning \"knowledge is power\", commonly attributed to Sir Francis Bacon.","support":[{"end":300,"quote":"The phrase \\\"scientia potentia est\\\" (or \\\"scientia est potentia\\\" or also \\\"scientia potestas est\\\") is a Latin aphorism meaning \\\"knowledge is power\\\", commonly attributed to Sir Francis Bacon.","source_id":"wikipedia.article.knowledge-is-power","source_sha256":"5c1550823dad8a2dc2043053fd5d4747858b4b43a38aaf3440041afa42563749","start":105}],"target_id":"concept.wikipedia.knowledge-is-power","target_kind":"node","target_sha256":"2519e9f4a6a2f8f2585d27f0d758e8a2580590ee13f0b2f9968632e7fed4b42f"}],"concept.wikipedia.knowledge-organization":[{"id":"assertion.concept.wikipedia.knowledge-organization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge organization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge organization\", CC BY-SA 4.0) states: Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","support":[{"end":433,"quote":"Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","source_id":"wikipedia.article.knowledge-organization","source_sha256":"b06eeb2b44e7079dbf8d021de73c002891c0782a88206d888c8e0b8da03b646e","start":109}],"target_id":"concept.wikipedia.knowledge-organization","target_kind":"node","target_sha256":"ae2f4d458e9e515e234999f6ac68f3e5a97d6dac1c4c340131134c8ea50cff6b"}],"concept.wikipedia.lateral-thinking":[{"id":"assertion.concept.wikipedia.lateral-thinking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Lateral thinking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Lateral thinking\", CC BY-SA 4.0) states: Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","support":[{"end":237,"quote":"Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","source_id":"wikipedia.article.lateral-thinking","source_sha256":"e798af585093b7c47c0295c92b67f04a435593b09afa50f46e0c84e49ee98d1d","start":102}],"target_id":"concept.wikipedia.lateral-thinking","target_kind":"node","target_sha256":"552845ddc5af6b4c86f638e6343c8e83f78051967cac02144a4575194c7fd7ec"}],"concept.wikipedia.lazy-argument":[{"id":"assertion.concept.wikipedia.lazy-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Lazy argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Lazy argument\", CC BY-SA 4.0) states: The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","support":[{"end":343,"quote":"The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","source_id":"wikipedia.article.lazy-argument","source_sha256":"5a35e1aef75f0991432c89ac48f27fc2570803bd866d0bd76175c58d7987bdeb","start":100}],"target_id":"concept.wikipedia.lazy-argument","target_kind":"node","target_sha256":"a886c3c5bde5f574fe66919a2f1e19d86610a34f0d3f87986f67353a3ff9cb8d"}],"concept.wikipedia.limiting-case-mathematics":[{"id":"assertion.concept.wikipedia.limiting-case-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Limiting case (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Limiting case (mathematics)\", CC BY-SA 4.0) states: In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","support":[{"end":287,"quote":"In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","source_id":"wikipedia.article.limiting-case-mathematics","source_sha256":"ae09509335653796fb7493e6d51a424bf366edbffd76e5a64b28cc4994213b05","start":115}],"target_id":"concept.wikipedia.limiting-case-mathematics","target_kind":"node","target_sha256":"970ddab589dad9493496da374c0edaec91772783aaa777b03f1487e8d5e4f6f5"}],"concept.wikipedia.linear-actuator":[{"id":"assertion.concept.wikipedia.linear-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Linear actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Linear actuator\", CC BY-SA 4.0) states: A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","support":[{"end":258,"quote":"A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","source_id":"wikipedia.article.linear-actuator","source_sha256":"791543fd524070da72cf1fc0d08d7733f2c692b0242810b41dbe8a4790729879","start":102}],"target_id":"concept.wikipedia.linear-actuator","target_kind":"node","target_sha256":"aa6e33c059b959e7092ddea7c75c8ff45ac749b7dd40bdda5c5c2d093ee5bc78"}],"concept.wikipedia.local-skepticism":[{"id":"assertion.concept.wikipedia.local-skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Local skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Local skepticism\", CC BY-SA 4.0) states: Local skepticism is the view that one cannot possess knowledge in some particular domain.","support":[{"end":193,"quote":"Local skepticism is the view that one cannot possess knowledge in some particular domain.","source_id":"wikipedia.article.local-skepticism","source_sha256":"6072fb52ad43b1efcb05baf84be2fdd041f4b366b082243132bb19d288ad9f72","start":104}],"target_id":"concept.wikipedia.local-skepticism","target_kind":"node","target_sha256":"e451bdd9474d6aaa9f448a884e7f6aa10a05de523cdbeff68106e6417170fbc3"}],"concept.wikipedia.logarithmically-concave-sequence":[{"id":"assertion.concept.wikipedia.logarithmically-concave-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logarithmically concave sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logarithmically concave sequence\", CC BY-SA 4.0) states: In mathematics, a sequence a = (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","support":[{"end":320,"quote":"In mathematics, a sequence a =  (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","source_id":"wikipedia.article.logarithmically-concave-sequence","source_sha256":"feaa814f840b6fe11dcf5efb04c4a625e2ad6647f400a40c6f35768965de6b6b","start":120}],"target_id":"concept.wikipedia.logarithmically-concave-sequence","target_kind":"node","target_sha256":"41f044c09f9fc47ef27de3fbae935f26cfa39041e6d2b21fda61d43bcd4f763a"}],"concept.wikipedia.logic-of-argumentation":[{"id":"assertion.concept.wikipedia.logic-of-argumentation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logic of argumentation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logic of argumentation\", CC BY-SA 4.0) states: The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","support":[{"end":234,"quote":"The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","source_id":"wikipedia.article.logic-of-argumentation","source_sha256":"c756ad68415c92243976c4045dd60972a17a4f73805fbb1680cd7e961f1e4d87","start":110}],"target_id":"concept.wikipedia.logic-of-argumentation","target_kind":"node","target_sha256":"da5414418cb64df74290ccda1893c2a4bc7e582bffec88e982213e51ea649e39"}],"concept.wikipedia.logical-form":[{"id":"assertion.concept.wikipedia.logical-form","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical form as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical form\", CC BY-SA 4.0) states: In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","support":[{"end":220,"quote":"In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","source_id":"wikipedia.article.logical-form","source_sha256":"caaa34822bdb3d87ecbcd4ab43e67f4e66a1fc65a235307d7fbff5fe1319a591","start":99}],"target_id":"concept.wikipedia.logical-form","target_kind":"node","target_sha256":"a192a197c3aea62201a15e0de9df6fb6a83797d7e7c5a38f3ed340d9f442c788"}],"concept.wikipedia.logical-hexagon":[{"id":"assertion.concept.wikipedia.logical-hexagon","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical hexagon as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical hexagon\", CC BY-SA 4.0) states: In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","support":[{"end":273,"quote":"In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","source_id":"wikipedia.article.logical-hexagon","source_sha256":"ca974efe3ea03e7da927557d65b2c55632bf74c47add69f7889c1ff91c5ff4a7","start":103}],"target_id":"concept.wikipedia.logical-hexagon","target_kind":"node","target_sha256":"b1d133f8fd3e2a26a7bc38e0729a5872ba768951131f61c965d0401772ef99e8"}],"concept.wikipedia.logical-truth":[{"id":"assertion.concept.wikipedia.logical-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical truth\", CC BY-SA 4.0) states: Logical truth is one of the most fundamental concepts in logic.","support":[{"end":163,"quote":"Logical truth is one of the most fundamental concepts in logic.","source_id":"wikipedia.article.logical-truth","source_sha256":"d4cbe8af2a6b102c91340b14c18c4ca062e1ee40b7148ed26d142b3925bc8f7b","start":100}],"target_id":"concept.wikipedia.logical-truth","target_kind":"node","target_sha256":"63d43274fbb72360dcbad1bde94bd31568d9eedc64f749a32156b5266a124384"}],"concept.wikipedia.loki-s-wager":[{"id":"assertion.concept.wikipedia.loki-s-wager","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Loki's wager as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Loki's wager\", CC BY-SA 4.0) states: Loki's wager is the insistence that because two or more categories exist as poles on a spectrum with a grey area in the middle, the distinction between the two cannot be defined.","support":[{"end":278,"quote":"Loki's wager is the insistence that because two or more categories exist as poles on a spectrum  with a grey area in the middle, the distinction between the two cannot be defined.","source_id":"wikipedia.article.loki-s-wager","source_sha256":"ffbc8321a8f44519b8c8b2fa4592227b21879e73015adabdca1546de5bc89fee","start":99}],"target_id":"concept.wikipedia.loki-s-wager","target_kind":"node","target_sha256":"ad6cf91e5dee037e12a161fbb332a182593ccac2519add1f3407ccec8a9b7cd5"}],"concept.wikipedia.machine":[{"id":"assertion.concept.wikipedia.machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Machine\", CC BY-SA 4.0) states: A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","support":[{"end":202,"quote":"A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","source_id":"wikipedia.article.machine","source_sha256":"bd1e1bc819d38622c6e0079c79d42be6bead37155f468784e005c54253aa92b1","start":92}],"target_id":"concept.wikipedia.machine","target_kind":"node","target_sha256":"4c6afdef8ab52a3e425340c7eba3303e3abf799e8aceb8e06edc8780ae6ab769"}],"concept.wikipedia.machining":[{"id":"assertion.concept.wikipedia.machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Machining\", CC BY-SA 4.0) states: Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","support":[{"end":280,"quote":"Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","source_id":"wikipedia.article.machining","source_sha256":"515a85285b810605f94e9a69c0ab7c6bc210e203750f876300ab6273e73d9de7","start":95}],"target_id":"concept.wikipedia.machining","target_kind":"node","target_sha256":"7776cdd02d6d8419e7e158459804a10436f73dc6f7cf642b6a97f6c52bd17b28"}],"concept.wikipedia.malibu-hydro":[{"id":"assertion.concept.wikipedia.malibu-hydro","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Malibu Hydro as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Malibu Hydro\", CC BY-SA 4.0) states: Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","support":[{"end":185,"quote":"Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","source_id":"wikipedia.article.malibu-hydro","source_sha256":"44bbeb4367e9d7d2ee368a13923ca29b9807f877526d3c3a247621c13a24d355","start":100}],"target_id":"concept.wikipedia.malibu-hydro","target_kind":"node","target_sha256":"246f68046bef31965f48943cdecb3b26276b06236d96347f5586d24bba9b77f8"}],"concept.wikipedia.manufacturing":[{"id":"assertion.concept.wikipedia.manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Manufacturing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Manufacturing\", CC BY-SA 4.0) states: Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","support":[{"end":256,"quote":"Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","source_id":"wikipedia.article.manufacturing","source_sha256":"c28859d7f119cb32e72de33aee3595b52d6524e0fcd5fa71c84da4a71fde9400","start":98}],"target_id":"concept.wikipedia.manufacturing","target_kind":"node","target_sha256":"18dda8dfe09facef81ab177d2ed18e61459ed864b76dd0a0d696259886028bc5"}],"concept.wikipedia.material-inference":[{"id":"assertion.concept.wikipedia.material-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Material inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Material inference\", CC BY-SA 4.0) states: In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","support":[{"end":215,"quote":"In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","source_id":"wikipedia.article.material-inference","source_sha256":"b9cadfdeac5587abd0471605f494a34ec2fe85021157b4bf1644ca04ba84a64b","start":106}],"target_id":"concept.wikipedia.material-inference","target_kind":"node","target_sha256":"3c20db9be3ce15f1640fcddade110d760299c5daecb2584aca1f4d4db1d1991e"}],"concept.wikipedia.mathematical-diagram":[{"id":"assertion.concept.wikipedia.mathematical-diagram","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical diagram as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical diagram\", CC BY-SA 4.0) states: Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","support":[{"end":250,"quote":"Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","source_id":"wikipedia.article.mathematical-diagram","source_sha256":"94965251e91e95da94d9da5d4628a030abdba9c512e73db5d0bcc64613e1d274","start":108}],"target_id":"concept.wikipedia.mathematical-diagram","target_kind":"node","target_sha256":"fbd7dbde2a8ab342de29043dc877efce5d1cb6966cbaceca74de2a786e84bdd8"}],"concept.wikipedia.mathematical-logic":[{"id":"assertion.concept.wikipedia.mathematical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical logic\", CC BY-SA 4.0) states: Mathematical logic is the study of formal logic within mathematics.","support":[{"end":170,"quote":"Mathematical logic is the study of formal logic within mathematics.","source_id":"wikipedia.article.mathematical-logic","source_sha256":"80a941a28d5557df3536ea3df6a9eac8bf37067cd21064850c94a281c117967f","start":103}],"target_id":"concept.wikipedia.mathematical-logic","target_kind":"node","target_sha256":"56e5f084ccede16c53576e42a4e22a1db2caef5b24e88c1ad0c7a90e103e67d2"}],"concept.wikipedia.measure-mathematics":[{"id":"assertion.concept.wikipedia.measure-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Measure (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Measure (mathematics)\", CC BY-SA 4.0) states: In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","support":[{"end":309,"quote":"In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","source_id":"wikipedia.article.measure-mathematics","source_sha256":"8fac8382790a72f723e8ba78d26696d1dc172ef436ca65557d2972a643cc6356","start":106}],"target_id":"concept.wikipedia.measure-mathematics","target_kind":"node","target_sha256":"2429e134f43ed3318b117da2b8fded822147da1ac1ec436b054e61e9cc3f76b5"}],"concept.wikipedia.measurement":[{"id":"assertion.concept.wikipedia.measurement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Measurement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Measurement\", CC BY-SA 4.0) states: Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","support":[{"end":225,"quote":"Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","source_id":"wikipedia.article.measurement","source_sha256":"cee020945aa4a69c0431406415eb331fe422aacf9c52c4ca010e744cbaf5b637","start":96}],"target_id":"concept.wikipedia.measurement","target_kind":"node","target_sha256":"958b0333cb3deac1703a205ee784531a840f268d7a9565c34152acdfba8e4fdd"}],"concept.wikipedia.meta-functional-expertise":[{"id":"assertion.concept.wikipedia.meta-functional-expertise","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Meta-functional expertise as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Meta-functional expertise\", CC BY-SA 4.0) states: Meta-functional expertise is the breadth of one’s strategically important knowledge.","support":[{"end":197,"quote":"Meta-functional expertise is the breadth of one’s strategically important knowledge.","source_id":"wikipedia.article.meta-functional-expertise","source_sha256":"00d0ee19f6fadbbae03a7a79e79381c45196f4e545d7cd7919196dd379f9857e","start":113}],"target_id":"concept.wikipedia.meta-functional-expertise","target_kind":"node","target_sha256":"f642c27e3024381f277efdd1c262f7e24f76200704a07bc9dc4b9eb1a0f2d668"}],"concept.wikipedia.modular-representation-theory":[{"id":"assertion.concept.wikipedia.modular-representation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Modular representation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Modular representation theory\", CC BY-SA 4.0) states: In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","support":[{"end":291,"quote":"In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","source_id":"wikipedia.article.modular-representation-theory","source_sha256":"6b4a7f219ca546c728b13a803a4802fe74551fe8d84ad66851561fa461560e63","start":116}],"target_id":"concept.wikipedia.modular-representation-theory","target_kind":"node","target_sha256":"47799ce03c4bb9b7aee2515301005c37d6924df32655502a2758567cf30ea5f6"}],"concept.wikipedia.module-mathematics":[{"id":"assertion.concept.wikipedia.module-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Module (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Module (mathematics)\", CC BY-SA 4.0) states: In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","support":[{"end":263,"quote":"In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","source_id":"wikipedia.article.module-mathematics","source_sha256":"f58805fbf8fc17fda334366db824b8987d5629538d0e2bc4caf66daa884a53b5","start":106}],"target_id":"concept.wikipedia.module-mathematics","target_kind":"node","target_sha256":"f39255db51e42246a9b7bab9e86bce07675cd2f3f915c1a9c6e650f2cf888cfe"}],"concept.wikipedia.moment-statistics":[{"id":"assertion.concept.wikipedia.moment-statistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Moment (statistics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Moment (statistics)\", CC BY-SA 4.0) states: In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","support":[{"end":226,"quote":"In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","source_id":"wikipedia.article.moment-statistics","source_sha256":"3937b33609ae2e9a255bb0ff5c5f36308c8b9862fa71e2c0b3aa74c77edb5b30","start":107}],"target_id":"concept.wikipedia.moment-statistics","target_kind":"node","target_sha256":"fa21c6df791fb2830daa75d9262aaef63e617519752241074408457561e90a78"}],"concept.wikipedia.moral-intellectualism":[{"id":"assertion.concept.wikipedia.moral-intellectualism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Moral intellectualism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Moral intellectualism\", CC BY-SA 4.0) states: Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","support":[{"end":313,"quote":"Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","source_id":"wikipedia.article.moral-intellectualism","source_sha256":"09fd92886e1379b4bd35bfacab12a82c47c9cf57bfe1589a568c110b8e065954","start":109}],"target_id":"concept.wikipedia.moral-intellectualism","target_kind":"node","target_sha256":"b2441498cf06f1ee502654511e918d20e5c25c265339d04a7dbd1d71513ead5f"}],"concept.wikipedia.new-riddle-of-induction":[{"id":"assertion.concept.wikipedia.new-riddle-of-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"New riddle of induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"New riddle of induction\", CC BY-SA 4.0) states: The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","support":[{"end":242,"quote":"The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","source_id":"wikipedia.article.new-riddle-of-induction","source_sha256":"b285bd73341162e73f25b9e70382a93bdd974eb9aece32439fa1b8b4fc498437","start":109}],"target_id":"concept.wikipedia.new-riddle-of-induction","target_kind":"node","target_sha256":"e93e7ae1e7239bfc1b66e38a75e428604553dafb7230f9b1761508c7386db6c1"}],"concept.wikipedia.nothing-to-hide-argument":[{"id":"assertion.concept.wikipedia.nothing-to-hide-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Nothing to hide argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Nothing to hide argument\", CC BY-SA 4.0) states: The \"nothing to hide\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","support":[{"end":329,"quote":"The \\\"nothing to hide\\\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","source_id":"wikipedia.article.nothing-to-hide-argument","source_sha256":"50f6628a6a453c7532d458486378d2ff7e37ba0bce5f42856612073cb5680c72","start":112}],"target_id":"concept.wikipedia.nothing-to-hide-argument","target_kind":"node","target_sha256":"4777ead8e472c58533fca1a8c05a134929c14e398062555ad556c297a915a6f0"}],"concept.wikipedia.nuclear-technology":[{"id":"assertion.concept.wikipedia.nuclear-technology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Nuclear technology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Nuclear technology\", CC BY-SA 4.0) states: Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","support":[{"end":189,"quote":"Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","source_id":"wikipedia.article.nuclear-technology","source_sha256":"46082db1c0f5c9f5c869b7cafbeb3ee190e63a454f1d18c9ee56c4286efba8c8","start":103}],"target_id":"concept.wikipedia.nuclear-technology","target_kind":"node","target_sha256":"d87bff7bcd8d8bcabbc97b78dff11f20fb67c434f3a464992a911ae75206429c"}],"concept.wikipedia.objection-argument":[{"id":"assertion.concept.wikipedia.objection-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Objection (argument) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Objection (argument)\", CC BY-SA 4.0) states: In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","support":[{"end":201,"quote":"In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","source_id":"wikipedia.article.objection-argument","source_sha256":"bcb5ded1c728028cb36cfcab1ce10421fcf81160c3a517209901ece83bdb3e71","start":107}],"target_id":"concept.wikipedia.objection-argument","target_kind":"node","target_sha256":"28e51496327f74434b5dc0fcef6288c12b8a2626c38b4b53c17c61a63627cff8"}],"concept.wikipedia.ontoclean":[{"id":"assertion.concept.wikipedia.ontoclean","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"OntoClean as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"OntoClean\", CC BY-SA 4.0) states: OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","support":[{"end":272,"quote":"OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","source_id":"wikipedia.article.ontoclean","source_sha256":"c61ad98d6721c6ed25162691c3a25fd6e4293f47189c431dfa1677fb73eb1960","start":97}],"target_id":"concept.wikipedia.ontoclean","target_kind":"node","target_sha256":"f16bd4800c10feefebd0d5e997ee2b485bb2eae3431792149315d4453ae22da2"}],"concept.wikipedia.open-question-argument":[{"id":"assertion.concept.wikipedia.open-question-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open-question argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open-question argument\", CC BY-SA 4.0) states: The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","support":[{"end":382,"quote":"The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","source_id":"wikipedia.article.open-question-argument","source_sha256":"d5aa849a35b551608dd0453813fc3e59d5c895e37640a4154061c3bd6ab749ff","start":108}],"target_id":"concept.wikipedia.open-question-argument","target_kind":"node","target_sha256":"2daaa3da2c6a214b665897ed6dc394229bfe26e72040b98411bc9b332498d9df"}],"concept.wikipedia.open-science":[{"id":"assertion.concept.wikipedia.open-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open science\", CC BY-SA 4.0) states: Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","support":[{"end":340,"quote":"Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","source_id":"wikipedia.article.open-science","source_sha256":"79ca63347b400f6e6a335c7264c00bb2231ad4b7a45dcaac7bfb0b5fe86624f1","start":99}],"target_id":"concept.wikipedia.open-science","target_kind":"node","target_sha256":"b12cce4a0839513fba62c9153ccc06347d21f73a262e258b174a6326686e4f7b"}],"concept.wikipedia.open-texture":[{"id":"assertion.concept.wikipedia.open-texture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open texture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open texture\", CC BY-SA 4.0) states: Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \"Verifiability\" to refer to the universal possibility of vagueness in empirical statements.","support":[{"end":287,"quote":"Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \\\"Verifiability\\\" to refer to the universal possibility of vagueness in empirical statements.","source_id":"wikipedia.article.open-texture","source_sha256":"7a7175d0d71619c10c82271bd271b411dc85e85a4db5afd11d7002478a7495d4","start":100}],"target_id":"concept.wikipedia.open-texture","target_kind":"node","target_sha256":"1f8233a5949a8b71ab87f33233c576b04d3ec6526205e106307954a500f474f5"}],"concept.wikipedia.overdetermination":[{"id":"assertion.concept.wikipedia.overdetermination","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Overdetermination as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Overdetermination\", CC BY-SA 4.0) states: Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\"determine\") the effect.","support":[{"end":291,"quote":"Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\\\"determine\\\") the effect.","source_id":"wikipedia.article.overdetermination","source_sha256":"21805c11a3b21940999828732532931c00cab26914b4db6a5876dfec3b24eefb","start":105}],"target_id":"concept.wikipedia.overdetermination","target_kind":"node","target_sha256":"9736aaad9606db79bcf3328e71000d131a6fd9a3a895cf5b0521ab77c395c755"}],"concept.wikipedia.philosophical-logic":[{"id":"assertion.concept.wikipedia.philosophical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Philosophical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Philosophical logic\", CC BY-SA 4.0) states: Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","support":[{"end":314,"quote":"Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","source_id":"wikipedia.article.philosophical-logic","source_sha256":"c30b585df4aa209b0bf29bbd0e08750c98fa8f45d560a0ccd0d3236a5f47098e","start":105}],"target_id":"concept.wikipedia.philosophical-logic","target_kind":"node","target_sha256":"91ac4f44dec8cfbad869ee2d33e4bc3677418b9f31eace644bc2649b59731d45"}],"concept.wikipedia.philosophical-razor":[{"id":"assertion.concept.wikipedia.philosophical-razor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Philosophical razor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Philosophical razor\", CC BY-SA 4.0) states: In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","support":[{"end":272,"quote":"In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","source_id":"wikipedia.article.philosophical-razor","source_sha256":"56c5f18e4a897e0a5de36ec2bb2ab182068310a66a91fb0468527b1e8ccac737","start":107}],"target_id":"concept.wikipedia.philosophical-razor","target_kind":"node","target_sha256":"2bf9ba8724261f7aa21ef067b278144be04d2632841cd0c52d571218a2b72ea0"}],"concept.wikipedia.pragmatic-theory-of-truth":[{"id":"assertion.concept.wikipedia.pragmatic-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pragmatic theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pragmatic theory of truth\", CC BY-SA 4.0) states: A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","support":[{"end":215,"quote":"A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","source_id":"wikipedia.article.pragmatic-theory-of-truth","source_sha256":"4b2fd6ac911ef332b1bdf48b72da30d2a496e01b9fff2ce059a95ef8c58e9d72","start":111}],"target_id":"concept.wikipedia.pragmatic-theory-of-truth","target_kind":"node","target_sha256":"90821210d48b960ff47a4cf642244db52270dee0815baf360315a16a45b052ac"}],"concept.wikipedia.pregeometry-model-theory":[{"id":"assertion.concept.wikipedia.pregeometry-model-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pregeometry (model theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pregeometry (model theory)\", CC BY-SA 4.0) states: Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \"matroid\".","support":[{"end":206,"quote":"Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \\\"matroid\\\".","source_id":"wikipedia.article.pregeometry-model-theory","source_sha256":"ee17cbe00b547b57fdd734463976f2c1c11f3bf7dfffa6d92310d88530de403e","start":113}],"target_id":"concept.wikipedia.pregeometry-model-theory","target_kind":"node","target_sha256":"3cb6cfaf0397f0f024eabfa6ee8f746323def2d8345f044d8f7e4d6d40bb32ab"}],"concept.wikipedia.preregistration-science":[{"id":"assertion.concept.wikipedia.preregistration-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Preregistration (science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Preregistration (science)\", CC BY-SA 4.0) states: Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","support":[{"end":242,"quote":"Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","source_id":"wikipedia.article.preregistration-science","source_sha256":"aa2bfce7c4741cb62adfff55489eeaa5dfa6cf29687b5b146ab0c8e91656c64e","start":113}],"target_id":"concept.wikipedia.preregistration-science","target_kind":"node","target_sha256":"215122e4d2510c5e54030cd62bc2fa3643f7e6291dbb34dab0c22ee6cedfc194"}],"concept.wikipedia.prime-number":[{"id":"assertion.concept.wikipedia.prime-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Prime number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Prime number\", CC BY-SA 4.0) states: A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","support":[{"end":213,"quote":"A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","source_id":"wikipedia.article.prime-number","source_sha256":"b28675516b97771fa6343e42a38ad1161a26f0cafb2f3ca271645f5cdcbd1ca6","start":97}],"target_id":"concept.wikipedia.prime-number","target_kind":"node","target_sha256":"d152a5e56553b89cb6985de2cee9142a204a4ed0003026b8f78e4175a9034374"}],"concept.wikipedia.problem-finding":[{"id":"assertion.concept.wikipedia.problem-finding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem finding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem finding\", CC BY-SA 4.0) states: Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","support":[{"end":219,"quote":"Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","source_id":"wikipedia.article.problem-finding","source_sha256":"81de84706d016ec44cc7db16b9f618d87040af03e42cf7dfa597a766b0549bd9","start":102}],"target_id":"concept.wikipedia.problem-finding","target_kind":"node","target_sha256":"8b10286f065d8ac041ad215b4584c453e28b3d53dbe7bb1e41c912de3d6f5e8c"}],"concept.wikipedia.problem-solving-environment":[{"id":"assertion.concept.wikipedia.problem-solving-environment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem solving environment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem solving environment\", CC BY-SA 4.0) states: A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","support":[{"end":351,"quote":"A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","source_id":"wikipedia.article.problem-solving-environment","source_sha256":"73ee159d29c18ce2fa071a8963a6d6543a9e33a141636273528a477084904a26","start":114}],"target_id":"concept.wikipedia.problem-solving-environment","target_kind":"node","target_sha256":"08cc2544f906b544ad5ab91f74ecc3507f5c3a76b6fc44e875e850c0ab65328c"}],"concept.wikipedia.problem-statement":[{"id":"assertion.concept.wikipedia.problem-statement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem statement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem statement\", CC BY-SA 4.0) states: A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","support":[{"end":206,"quote":"A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","source_id":"wikipedia.article.problem-statement","source_sha256":"dd5faefd118a13bfb1d8d0b1ba57efff7044a13d2c50b180a3423aa312e85932","start":105}],"target_id":"concept.wikipedia.problem-statement","target_kind":"node","target_sha256":"2159059fd74f8e05c02ef3717e201e70f153a7a21bf9ff55301ebeb7cb77b10a"}],"concept.wikipedia.pseudoscience":[{"id":"assertion.concept.wikipedia.pseudoscience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pseudoscience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pseudoscience\", CC BY-SA 4.0) states: Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","support":[{"end":245,"quote":"Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","source_id":"wikipedia.article.pseudoscience","source_sha256":"a3b99d187b1ee561b4416d4e8b67aa32d3747ea726624c2ea8e2fa4266abe881","start":98}],"target_id":"concept.wikipedia.pseudoscience","target_kind":"node","target_sha256":"02db12be5297d05acadd69fb0c76c845450698c1f63ebc18963007fd35d9a912"}],"concept.wikipedia.pump":[{"id":"assertion.concept.wikipedia.pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pump\", CC BY-SA 4.0) states: A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","support":[{"end":269,"quote":"A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","source_id":"wikipedia.article.pump","source_sha256":"557fab341bec86e4e0b8cbcc2e0f6720687a758ce11a323a7066275fa0c0ab83","start":89}],"target_id":"concept.wikipedia.pump","target_kind":"node","target_sha256":"a52d340cc2a253e26411552275bdda5466ef15f96364bf1b95d30f304c548412"}],"concept.wikipedia.radial-turbine":[{"id":"assertion.concept.wikipedia.radial-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Radial turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Radial turbine\", CC BY-SA 4.0) states: A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","support":[{"end":194,"quote":"A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","source_id":"wikipedia.article.radial-turbine","source_sha256":"e71ffa503678717ef5dfd0d527ad39eae8c3d23fce28df3fd5382cc7f5b4ca0e","start":102}],"target_id":"concept.wikipedia.radial-turbine","target_kind":"node","target_sha256":"22d9c2669a742605b5c456a011307c1543887537d6b85241111e627f295b8bed"}],"concept.wikipedia.radical-empiricism":[{"id":"assertion.concept.wikipedia.radical-empiricism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Radical empiricism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Radical empiricism\", CC BY-SA 4.0) states: Radical empiricism is a philosophical doctrine put forward by William James.","support":[{"end":181,"quote":"Radical empiricism is a philosophical doctrine put forward by William James.","source_id":"wikipedia.article.radical-empiricism","source_sha256":"321b427661f06ef8c2e0e9b0a89f2dcddb7001e79455f331f42486f9618577a2","start":105}],"target_id":"concept.wikipedia.radical-empiricism","target_kind":"node","target_sha256":"119768b4be8b065732731c7a5f07c9b6a23377ea8040c5c0e8674850d987d55d"}],"concept.wikipedia.rational-egoism":[{"id":"assertion.concept.wikipedia.rational-egoism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rational egoism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rational egoism\", CC BY-SA 4.0) states: Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","support":[{"end":245,"quote":"Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","source_id":"wikipedia.article.rational-egoism","source_sha256":"1c7988b394f11bb9ca3cfe316579035c3ec347004b5d136f801deab4c747a2c4","start":102}],"target_id":"concept.wikipedia.rational-egoism","target_kind":"node","target_sha256":"27bf94c9dd14cb19659747611bd8c6d146426e28fe20b26d9c05622373db7b1e"}],"concept.wikipedia.rational-fideism":[{"id":"assertion.concept.wikipedia.rational-fideism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rational fideism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rational fideism\", CC BY-SA 4.0) states: Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","support":[{"end":211,"quote":"Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","source_id":"wikipedia.article.rational-fideism","source_sha256":"ce2924d13d6c7b4c716e351c017b7d16f697c03f0cf1e2dd489c0f7d01540b76","start":104}],"target_id":"concept.wikipedia.rational-fideism","target_kind":"node","target_sha256":"b8350e701c1014dd894503f13b8972d9f114114cb835774dffa733711f1610b5"}],"concept.wikipedia.real-analysis":[{"id":"assertion.concept.wikipedia.real-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Real analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Real analysis\", CC BY-SA 4.0) states: Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","support":[{"end":287,"quote":"Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","source_id":"wikipedia.article.real-analysis","source_sha256":"5cd68fef65487d4f9074b21b17222457c1df24d135605f0806ae5ab9321a99d6","start":98}],"target_id":"concept.wikipedia.real-analysis","target_kind":"node","target_sha256":"c7b7c669f348aa88a7efefeae7b88627a24c3a2fe5255679623ac97438ede092"}],"concept.wikipedia.reasonable-doubt":[{"id":"assertion.concept.wikipedia.reasonable-doubt","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Reasonable doubt as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Reasonable doubt\", CC BY-SA 4.0) states: Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","support":[{"end":234,"quote":"Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","source_id":"wikipedia.article.reasonable-doubt","source_sha256":"8f1e56bbdea4a481639b4d5ce0fb106b13760647baef40ae4c952e6431d4ba7d","start":103}],"target_id":"concept.wikipedia.reasonable-doubt","target_kind":"node","target_sha256":"38b9d0266657d5ebf204ed417e109940a599b9602533a09df8e8cc0fbeb5f734"}],"concept.wikipedia.reasoning-system":[{"id":"assertion.concept.wikipedia.reasoning-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Reasoning system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Reasoning system\", CC BY-SA 4.0) states: In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","support":[{"end":279,"quote":"In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","source_id":"wikipedia.article.reasoning-system","source_sha256":"ff1b261150525d755e8f4247fd4d12f1ee7d7fa495aedad6bcb1bc31b3486aca","start":104}],"target_id":"concept.wikipedia.reasoning-system","target_kind":"node","target_sha256":"75f7b058a87e2f4c26d11bee3ed55b787406d7d9a12223ad11b72a6c077e9686"}],"concept.wikipedia.redundancy-theory-of-truth":[{"id":"assertion.concept.wikipedia.redundancy-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Redundancy theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Redundancy theory of truth\", CC BY-SA 4.0) states: According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","support":[{"end":303,"quote":"According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","source_id":"wikipedia.article.redundancy-theory-of-truth","source_sha256":"0c14b9a0c5f9bb133dce052aa420584e1aa1cecf11ec56c91e1b18cc82ddd78e","start":113}],"target_id":"concept.wikipedia.redundancy-theory-of-truth","target_kind":"node","target_sha256":"77a0059e4ee43b681ae9dbe7c8989e3da03717056f5b6718c6a9de42da06987e"}],"concept.wikipedia.research-program":[{"id":"assertion.concept.wikipedia.research-program","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Research program as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Research program\", CC BY-SA 4.0) states: A research program (British English: research programme) is a professional network of scientists conducting basic research.","support":[{"end":227,"quote":"A research program (British English: research programme) is a professional network of scientists conducting basic research.","source_id":"wikipedia.article.research-program","source_sha256":"1c05a5150fe6ba772f14ce394f56b598b622e19cd0bc79012170fd0bc2887eed","start":104}],"target_id":"concept.wikipedia.research-program","target_kind":"node","target_sha256":"d79e2d401859038bf33a7d89cf8860b1c27f43b3870bb5f5187918f919b862ae"}],"concept.wikipedia.residue-field":[{"id":"assertion.concept.wikipedia.residue-field","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Residue field as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Residue field\", CC BY-SA 4.0) states: In mathematics, the residue field is a basic construction in commutative algebra.","support":[{"end":182,"quote":"In mathematics, the residue field is a basic construction in commutative algebra.","source_id":"wikipedia.article.residue-field","source_sha256":"4ece439153f1c557f3c55b3209f8a4cbfb754adfe3fd4c5a9df91ce713638214","start":101}],"target_id":"concept.wikipedia.residue-field","target_kind":"node","target_sha256":"b32fd18fb5955fddf6071a20b4dd4112a5b4b596f20b3ebd5b5e461ec7a40e75"}],"concept.wikipedia.rule-induction":[{"id":"assertion.concept.wikipedia.rule-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rule induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rule induction\", CC BY-SA 4.0) states: Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","support":[{"end":210,"quote":"Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","source_id":"wikipedia.article.rule-induction","source_sha256":"085c4886d1bddeaff4383842a7d7207f0e81d448b1daaf0e33ea19a20eace32e","start":101}],"target_id":"concept.wikipedia.rule-induction","target_kind":"node","target_sha256":"4a69786c29f1bb4c54d35854308755c92e0ec7bd3e7dd9e7fd621cd00db09025"}],"concept.wikipedia.rule-of-succession":[{"id":"assertion.concept.wikipedia.rule-of-succession","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rule of succession as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rule of succession\", CC BY-SA 4.0) states: In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","support":[{"end":264,"quote":"In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","source_id":"wikipedia.article.rule-of-succession","source_sha256":"9bbb5c9c3ee7fdab04ca446782ada4be83d109916c42fef5f9351f64310a9292","start":104}],"target_id":"concept.wikipedia.rule-of-succession","target_kind":"node","target_sha256":"f36661850a0987ba53baa7b2ae8d2bdf41672217f4d1dcbeb90fabaad15a90af"}],"concept.wikipedia.sat":[{"id":"assertion.concept.wikipedia.sat","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"♯SAT as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"♯SAT\", CC BY-SA 4.0) states: In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","support":[{"end":324,"quote":"In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","source_id":"wikipedia.article.sat","source_sha256":"29a934e65626c0ad09461868e1d0e30ac01862353933029ab180a18562d35911","start":92}],"target_id":"concept.wikipedia.sat","target_kind":"node","target_sha256":"6b4616201753a66ed92c3a9224dd4e537aea67cf7a47d039df41ab514a595b27"}],"concept.wikipedia.scalar-implicature":[{"id":"assertion.concept.wikipedia.scalar-implicature","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Scalar implicature as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Scalar implicature\", CC BY-SA 4.0) states: In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","support":[{"end":393,"quote":"In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","source_id":"wikipedia.article.scalar-implicature","source_sha256":"4aff866feff8646a3c8190b843f09ea757c88727a25cdd8fd0bd633ef52d4549","start":106}],"target_id":"concept.wikipedia.scalar-implicature","target_kind":"node","target_sha256":"5ce4dd13e0d1ec923e681d7517a2ef561f67275447c036c96bbfa88c70f6c67f"}],"concept.wikipedia.science-and-technology-studies":[{"id":"assertion.concept.wikipedia.science-and-technology-studies","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Science and technology studies as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Science and technology studies\", CC BY-SA 4.0) states: Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","support":[{"end":463,"quote":"Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","source_id":"wikipedia.article.science-and-technology-studies","source_sha256":"ecb006f21146fee9e262f067e10dc7247da986c5094f64d3dfac3e38fbd2c298","start":116}],"target_id":"concept.wikipedia.science-and-technology-studies","target_kind":"node","target_sha256":"5fad9b14460e4a4d89b53844beeabed346bd348172591413a039adc63ef8478f"}],"concept.wikipedia.science-of-science-policy":[{"id":"assertion.concept.wikipedia.science-of-science-policy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Science of science policy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Science of science policy\", CC BY-SA 4.0) states: Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","support":[{"end":277,"quote":"Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","source_id":"wikipedia.article.science-of-science-policy","source_sha256":"958fee5d6dd4aab4a63116bdd275ce9d5ee3d902114c88b97b8ddc1f273e8bba","start":113}],"target_id":"concept.wikipedia.science-of-science-policy","target_kind":"node","target_sha256":"d71cc835a682b701f4b72f86b537a00dc8fac12a9168ca28ee175871202c0443"}],"concept.wikipedia.seismic-base-isolation":[{"id":"assertion.concept.wikipedia.seismic-base-isolation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Seismic base isolation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Seismic base isolation\", CC BY-SA 4.0) states: Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","support":[{"end":275,"quote":"Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","source_id":"wikipedia.article.seismic-base-isolation","source_sha256":"26c647115ccac54af0fe0592c78b89415826265830ef9db23025cddca33d1a34","start":110}],"target_id":"concept.wikipedia.seismic-base-isolation","target_kind":"node","target_sha256":"7584ee9048acc119e64fb130073eef690adba2dc57cd1938799c4bcdd60b0d2f"}],"concept.wikipedia.semantic-theory-of-truth":[{"id":"assertion.concept.wikipedia.semantic-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Semantic theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Semantic theory of truth\", CC BY-SA 4.0) states: A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","support":[{"end":238,"quote":"A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","source_id":"wikipedia.article.semantic-theory-of-truth","source_sha256":"74ecd3b8ab8b73555b48fc3dfacff55b0ca1b78a3d6b58eb0815863b23f057cc","start":110}],"target_id":"concept.wikipedia.semantic-theory-of-truth","target_kind":"node","target_sha256":"61c51fa709dd050955b2157c13bd33eb7bde306805b58c9ac889bae860554ad3"}],"concept.wikipedia.semiconductor-device":[{"id":"assertion.concept.wikipedia.semiconductor-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Semiconductor device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Semiconductor device\", CC BY-SA 4.0) states: A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","support":[{"end":329,"quote":"A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","source_id":"wikipedia.article.semiconductor-device","source_sha256":"55ea79a9dbd0982687773239cb285a47ad183ca60da6c21637b5a6dd567a44ec","start":105}],"target_id":"concept.wikipedia.semiconductor-device","target_kind":"node","target_sha256":"2793e1edba59cc65816b8e6170a9adda55368f496d3a17b4a8a5d6f41d7b79d9"}],"concept.wikipedia.sense-data":[{"id":"assertion.concept.wikipedia.sense-data","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sense data as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sense data\", CC BY-SA 4.0) states: The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","support":[{"end":303,"quote":"The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","source_id":"wikipedia.article.sense-data","source_sha256":"11a1c8f1ad407ab2f7b51cf855154ad9069242659a0ee28f0ece8254af7d1045","start":98}],"target_id":"concept.wikipedia.sense-data","target_kind":"node","target_sha256":"a4eab36f023eccdebeaf7b953c41cc5dee17abb7e70c3fad53b261f95f241afa"}],"concept.wikipedia.sensor":[{"id":"assertion.concept.wikipedia.sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sensor\", CC BY-SA 4.0) states: A sensor is often defined as a device that receives and responds to a signal or stimulus.","support":[{"end":181,"quote":"A sensor is often defined as a device that receives and responds to a signal or stimulus.","source_id":"wikipedia.article.sensor","source_sha256":"5bcc15d0a9c4331d74dd89bcfeaf7f162758410d4d2d9dd91feba7b9722f1e11","start":92}],"target_id":"concept.wikipedia.sensor","target_kind":"node","target_sha256":"7712079ae9ebc49afc75b3090dbc2565f01cf440e0bf61bd4416982c6b32ea37"}],"concept.wikipedia.signal-processing":[{"id":"assertion.concept.wikipedia.signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Signal processing\", CC BY-SA 4.0) states: Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","support":[{"end":329,"quote":"Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","source_id":"wikipedia.article.signal-processing","source_sha256":"e752d511bedba35151eafd1d6acbe54e3b77888f2bf32e182c3c253881642a0d","start":102}],"target_id":"concept.wikipedia.signal-processing","target_kind":"node","target_sha256":"640e8974a6fc1ee697d8f4f88c9942059e47455394254fb6fe4ab941a6d4a0c5"}],"concept.wikipedia.simple-philosophy":[{"id":"assertion.concept.wikipedia.simple-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Simple (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Simple (philosophy)\", CC BY-SA 4.0) states: In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","support":[{"end":237,"quote":"In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","source_id":"wikipedia.article.simple-philosophy","source_sha256":"754d4a944e64bc77d00ba6fa79713e51ed9d9b3fc727eba17723ca114bf2c476","start":106}],"target_id":"concept.wikipedia.simple-philosophy","target_kind":"node","target_sha256":"1c5f48242c66b32db0619070f3d97a622956ce7d68c9632d72d9325983842e12"}],"concept.wikipedia.skepticism":[{"id":"assertion.concept.wikipedia.skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Skepticism\", CC BY-SA 4.0) states: Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","support":[{"end":227,"quote":"Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","source_id":"wikipedia.article.skepticism","source_sha256":"58e92278463146ceee62cb4116d7681967c732be3729bb7dc6a87809eb228528","start":95}],"target_id":"concept.wikipedia.skepticism","target_kind":"node","target_sha256":"eba3d765e4037ca0e96ebe5aa3c7e5d7bee95b812814eb75c725ba469dbcdcfe"}],"concept.wikipedia.social-constructionism":[{"id":"assertion.concept.wikipedia.social-constructionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Social constructionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Social constructionism\", CC BY-SA 4.0) states: Social constructionism is a term used in sociology, social ontology, and communication theory.","support":[{"end":202,"quote":"Social constructionism is a term used in sociology, social ontology, and communication theory.","source_id":"wikipedia.article.social-constructionism","source_sha256":"fe08bcd1cfdaf05d0967f9b06a7d04f02048167f4b2beaec00b86f2aa3424853","start":108}],"target_id":"concept.wikipedia.social-constructionism","target_kind":"node","target_sha256":"f514e22b35d6b6befa380112c8322172753361be8bcba6ae7b3e50d112e2b349"}],"concept.wikipedia.social-constructivism":[{"id":"assertion.concept.wikipedia.social-constructivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Social constructivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Social constructivism\", CC BY-SA 4.0) states: Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","support":[{"end":287,"quote":"Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","source_id":"wikipedia.article.social-constructivism","source_sha256":"209ee0bdff7a727f5e48ab7e86376c7e4d48f911943c25732cfc8d793a28593c","start":107}],"target_id":"concept.wikipedia.social-constructivism","target_kind":"node","target_sha256":"0adfbf8443d9d183d050bce7ed0b2584a59dfad90a53f9d2a855f39d0abfdfeb"}],"concept.wikipedia.sociology-of-absences":[{"id":"assertion.concept.wikipedia.sociology-of-absences","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sociology of absences as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sociology of absences\", CC BY-SA 4.0) states: The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","support":[{"end":378,"quote":"The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \\\"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","source_id":"wikipedia.article.sociology-of-absences","source_sha256":"c735d395355723e46fa822f8544aa8c26b830cadd58c6b37f0b1cff8f4e91e48","start":109}],"target_id":"concept.wikipedia.sociology-of-absences","target_kind":"node","target_sha256":"ee0b239f41b984ffadd755bd9128b660b120251f7943c6654c967c830cf94352"}],"concept.wikipedia.square-of-opposition":[{"id":"assertion.concept.wikipedia.square-of-opposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Square of opposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Square of opposition\", CC BY-SA 4.0) states: In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","support":[{"end":268,"quote":"In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","source_id":"wikipedia.article.square-of-opposition","source_sha256":"abf34788b6ff7149bc7033afce0bbb43b94e43e75d7a1e3b163bb6e52041b642","start":106}],"target_id":"concept.wikipedia.square-of-opposition","target_kind":"node","target_sha256":"0c4521c164bf74a8c35809c25b307c1ad9eb908b63531c78aa3133c0b96e9836"}],"concept.wikipedia.standpoint-feminism":[{"id":"assertion.concept.wikipedia.standpoint-feminism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Standpoint feminism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Standpoint feminism\", CC BY-SA 4.0) states: Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","support":[{"end":269,"quote":"Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","source_id":"wikipedia.article.standpoint-feminism","source_sha256":"1aa655e19e72e3f753f1cc18e25a0d97095b86fe477ad3e9977857e7eac10f64","start":106}],"target_id":"concept.wikipedia.standpoint-feminism","target_kind":"node","target_sha256":"071a42bee7b7dc34ceb6951ba64a377b0deb642f025c43f7e549b4aefdd5ce74"}],"concept.wikipedia.structural-system":[{"id":"assertion.concept.wikipedia.structural-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Structural system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Structural system\", CC BY-SA 4.0) states: The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","support":[{"end":241,"quote":"The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","source_id":"wikipedia.article.structural-system","source_sha256":"e963ec5a9cb7558851c7f2c9c168a9db88e555aa2030e6c4e8a6d37cecb9d50d","start":104}],"target_id":"concept.wikipedia.structural-system","target_kind":"node","target_sha256":"289a2ca92a82e45da696297c22ada2c61d97a350b4a1576da1d86c7f78edea0b"}],"concept.wikipedia.supergeometry":[{"id":"assertion.concept.wikipedia.supergeometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Supergeometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Supergeometry\", CC BY-SA 4.0) states: Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","support":[{"end":221,"quote":"Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","source_id":"wikipedia.article.supergeometry","source_sha256":"776e1321ef26137b628063fa8231537d7b8dab8f945a758899028d976768b82c","start":101}],"target_id":"concept.wikipedia.supergeometry","target_kind":"node","target_sha256":"76d43e5927e22221cb0e9ed073e1fee2df6c9b1ed70778544a01285b57f84a19"}],"concept.wikipedia.supervenience":[{"id":"assertion.concept.wikipedia.supervenience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Supervenience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Supervenience\", CC BY-SA 4.0) states: In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","support":[{"end":193,"quote":"In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","source_id":"wikipedia.article.supervenience","source_sha256":"5f09a7a495dcb8744e9927ca84b0970d0c637c0deaf750b4ee532cbdb9c5f8ea","start":99}],"target_id":"concept.wikipedia.supervenience","target_kind":"node","target_sha256":"e8438b1004409fc89749a835016c49c3709d012dc132a047b781874ab524fdf8"}],"concept.wikipedia.tau-mathematics":[{"id":"assertion.concept.wikipedia.tau-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tau (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tau (mathematics)\", CC BY-SA 4.0) states: The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","support":[{"end":431,"quote":"The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","source_id":"wikipedia.article.tau-mathematics","source_sha256":"0bfd7bdbd0a93052edbcc4a8bdff448ddd0bb4cecca582e44b49dfabce5daf7d","start":105}],"target_id":"concept.wikipedia.tau-mathematics","target_kind":"node","target_sha256":"ffe5ff874d8031e035f3a1ac68564e020765856d4157ee2dda2eef575310122c"}],"concept.wikipedia.tesla-turbine":[{"id":"assertion.concept.wikipedia.tesla-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tesla turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tesla turbine\", CC BY-SA 4.0) states: The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","support":[{"end":189,"quote":"The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","source_id":"wikipedia.article.tesla-turbine","source_sha256":"feadd94d4030c508e27cad7b963356e1330b40de2f4915fe5bf1a7ee7c7563ce","start":98}],"target_id":"concept.wikipedia.tesla-turbine","target_kind":"node","target_sha256":"1ad1d1ca230abec42c9087d8816b102195a259e2f291d03844bf02bacd8533f3"}],"concept.wikipedia.testimony":[{"id":"assertion.concept.wikipedia.testimony","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Testimony as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Testimony\", CC BY-SA 4.0) states: Testimony is a solemn attestation as to the truth of a situation.","support":[{"end":159,"quote":"Testimony is a solemn attestation as to the truth of a situation.","source_id":"wikipedia.article.testimony","source_sha256":"42a94493c09ef48622a7a2269d03a435befe7df7c331e36089e8dfa7a0f6ebaf","start":94}],"target_id":"concept.wikipedia.testimony","target_kind":"node","target_sha256":"75a782c8ce7c465089e6650c10a4e91892e9577ec8f0f3456c70cf601a27d67c"}],"concept.wikipedia.the-central-science":[{"id":"assertion.concept.wikipedia.the-central-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"The central science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"The central science\", CC BY-SA 4.0) states: Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","support":[{"end":337,"quote":"Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","source_id":"wikipedia.article.the-central-science","source_sha256":"ff41be6e91ec399f42b16316c22e6246a5436a6ddb89b0c9489e29c55c569740","start":107}],"target_id":"concept.wikipedia.the-central-science","target_kind":"node","target_sha256":"7d41c1e4f89295a1a2aec5d2bcd852e92781b2493f856cd0262290974d427e2c"}],"concept.wikipedia.theory":[{"id":"assertion.concept.wikipedia.theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Theory\", CC BY-SA 4.0) states: A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","support":[{"end":225,"quote":"A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","source_id":"wikipedia.article.theory","source_sha256":"d58d865d0d01d613144121b687b0a0cd6404261e0af7442c8d9bf0bec08ff5f6","start":91}],"target_id":"concept.wikipedia.theory","target_kind":"node","target_sha256":"a2e47008d15f47efc65bafb5f96723edfe02a74f881be41325b24ff0f445fd2a"}],"concept.wikipedia.theory-ladenness":[{"id":"assertion.concept.wikipedia.theory-ladenness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Theory-ladenness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Theory-ladenness\", CC BY-SA 4.0) states: In philosophy of science, an observation is said to be \"theory-laden\" when shaped by the investigator's theoretical presuppositions.","support":[{"end":238,"quote":"In philosophy of science, an observation is said to be \\\"theory-laden\\\" when shaped by the investigator's theoretical presuppositions.","source_id":"wikipedia.article.theory-ladenness","source_sha256":"30672bae0aca9b332e4a11a211500a839e657fe54eff62438f4a78ac64954f17","start":104}],"target_id":"concept.wikipedia.theory-ladenness","target_kind":"node","target_sha256":"064efffd4f93688835ede7efd75a104869942f38899d5e361dec87874c9c2cb4"}],"concept.wikipedia.thought-experiment":[{"id":"assertion.concept.wikipedia.thought-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Thought experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Thought experiment\", CC BY-SA 4.0) states: A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","support":[{"end":206,"quote":"A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","source_id":"wikipedia.article.thought-experiment","source_sha256":"3ef1f506b3cb3c38469d994e28bf5a98c015c349a4a0cf105ad7e4d50eaeb906","start":103}],"target_id":"concept.wikipedia.thought-experiment","target_kind":"node","target_sha256":"12238345ede0a77665cb3452f036fce5491c4ed827d280a808aa57531e783e6e"}],"concept.wikipedia.trivialism":[{"id":"assertion.concept.wikipedia.trivialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Trivialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Trivialism\", CC BY-SA 4.0) states: Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \"p and not p\" (e.g. the ball is red and not red) are true.","support":[{"end":304,"quote":"Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \\\"p and not p\\\" (e.g. the ball is red and not red) are true.","source_id":"wikipedia.article.trivialism","source_sha256":"f5ddad7a3d1f7f3e7b613d4a1ccacee047fb24128b87c41125db4a49ea3c7989","start":98}],"target_id":"concept.wikipedia.trivialism","target_kind":"node","target_sha256":"4caafc3ab0f3c07305a3797dcb2d228e66b0369440861327a880a9397146de69"}],"concept.wikipedia.trust-social-science":[{"id":"assertion.concept.wikipedia.trust-social-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Trust (social science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Trust (social science)\", CC BY-SA 4.0) states: Trust is the belief that another person will do what is expected and is built through repeated consistency.","support":[{"end":215,"quote":"Trust is the belief that another person will do what is expected and is built through repeated consistency.","source_id":"wikipedia.article.trust-social-science","source_sha256":"111de50908ca08d59c82e85166916a5b0059d8550b262451d100ef9ad45bb602","start":108}],"target_id":"concept.wikipedia.trust-social-science","target_kind":"node","target_sha256":"63da7490a0d789787326d3026cdbe5e59c1c84f4b86cf17a4d5ad43b6ae7bc45"}],"concept.wikipedia.truth-predicate":[{"id":"assertion.concept.wikipedia.truth-predicate","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Truth predicate as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Truth predicate\", CC BY-SA 4.0) states: In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","support":[{"end":243,"quote":"In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","source_id":"wikipedia.article.truth-predicate","source_sha256":"2eff6019b262e5ed28d134847c35a543a7d5a6f4e48c9df715565bdc25cacef7","start":102}],"target_id":"concept.wikipedia.truth-predicate","target_kind":"node","target_sha256":"daa69b7656f077508785f2331808014edcc209dd2a0196d3022b48d96c77d874"}],"concept.wikipedia.turbine-trip":[{"id":"assertion.concept.wikipedia.turbine-trip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turbine trip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turbine trip\", CC BY-SA 4.0) states: A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","support":[{"end":203,"quote":"A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","source_id":"wikipedia.article.turbine-trip","source_sha256":"b546ce5f8b4feda1085b442053dcfa786af55289cc39e5098598d0c71c3064a9","start":100}],"target_id":"concept.wikipedia.turbine-trip","target_kind":"node","target_sha256":"c9c4c88bc960fd11e12a7ecab4981c3978dd3064ae844e3ffd4d162f713fc917"}],"concept.wikipedia.turkey-illusion":[{"id":"assertion.concept.wikipedia.turkey-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turkey illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turkey illusion\", CC BY-SA 4.0) states: Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","support":[{"end":273,"quote":"Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","source_id":"wikipedia.article.turkey-illusion","source_sha256":"fedae77f612e377f3894e06dc8ca94b97c91d0ff4a0c582c32c971364609cc85","start":103}],"target_id":"concept.wikipedia.turkey-illusion","target_kind":"node","target_sha256":"246f1bb3a0d6368135b5335d488a5d2b37914050112c8634c3eebb351c307c42"}],"concept.wikipedia.turn-angle":[{"id":"assertion.concept.wikipedia.turn-angle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turn (angle) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turn (angle)\", CC BY-SA 4.0) states: The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","support":[{"end":258,"quote":"The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","source_id":"wikipedia.article.turn-angle","source_sha256":"36ee5592ad24f2edd55c4b8924dea845d553d0636e208ed52a78494396b4fe4d","start":98}],"target_id":"concept.wikipedia.turn-angle","target_kind":"node","target_sha256":"5e5f5c34590e053bf0ce8b2e831b5971a6bba001be74f21b5f0e6c0aea9015c1"}],"concept.wikipedia.valve":[{"id":"assertion.concept.wikipedia.valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Valve\", CC BY-SA 4.0) states: A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","support":[{"end":298,"quote":"A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","source_id":"wikipedia.article.valve","source_sha256":"554241121eaf1f0fe8bbc9a5e6ea907f4889445e7d771b4d5c745dab07adb16a","start":90}],"target_id":"concept.wikipedia.valve","target_kind":"node","target_sha256":"3cbae4d15992c2298adf36eb03365cf14148041dbae68685af0daaba59682c6c"}],"concept.wikipedia.valve-actuator":[{"id":"assertion.concept.wikipedia.valve-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Valve actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Valve actuator\", CC BY-SA 4.0) states: A valve actuator is the mechanism for opening and closing a valve.","support":[{"end":167,"quote":"A valve actuator is the mechanism for opening and closing a valve.","source_id":"wikipedia.article.valve-actuator","source_sha256":"15d0e0a10b4b1c496583d7c786b0005b48c8e1356da5bfbe1b55ba816fbafb7b","start":101}],"target_id":"concept.wikipedia.valve-actuator","target_kind":"node","target_sha256":"838ddf74f058c6ba8420465f6f487e17fe1204533faea4f3d1274e136a087d6c"}],"concept.wikipedia.veridicality":[{"id":"assertion.concept.wikipedia.veridicality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Veridicality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Veridicality\", CC BY-SA 4.0) states: In linguistics, veridicality (from Latin \"truthfully said\") is a semantic or grammatical assertion of the truth of an utterance.","support":[{"end":230,"quote":"In linguistics, veridicality (from Latin \\\"truthfully said\\\") is a semantic or grammatical assertion of the truth of an utterance.","source_id":"wikipedia.article.veridicality","source_sha256":"41bad4cadb253d6362b827fb4b0a24cf4b55f543c19d8b2498a9cb1df275ad8d","start":100}],"target_id":"concept.wikipedia.veridicality","target_kind":"node","target_sha256":"7403cb75dac3aa51bf7c911c486c79ee7c419da6c68637e96ad02c41b22a272a"}],"concept.wikipedia.vietoris-rips-filtration":[{"id":"assertion.concept.wikipedia.vietoris-rips-filtration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Vietoris–Rips filtration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Vietoris–Rips filtration\", CC BY-SA 4.0) states: In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \"Rips filtration\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","support":[{"end":379,"quote":"In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \\\"Rips filtration\\\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","source_id":"wikipedia.article.vietoris-rips-filtration","source_sha256":"73e601c17f170be7ca578d567afee5be6a16551d85ff93ea82060ea2ff7df1c1","start":112}],"target_id":"concept.wikipedia.vietoris-rips-filtration","target_kind":"node","target_sha256":"929ab13f22330730b18b973f9d6810da070271f4f906c2926a3abaf3a279146f"}],"concept.wikipedia.virtue-epistemology":[{"id":"assertion.concept.wikipedia.virtue-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Virtue epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Virtue epistemology\", CC BY-SA 4.0) states: Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","support":[{"end":250,"quote":"Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","source_id":"wikipedia.article.virtue-epistemology","source_sha256":"a671f9303a09749e96c07c9ed87c882ec69018e215f8bb9326a7df188abe8736","start":106}],"target_id":"concept.wikipedia.virtue-epistemology","target_kind":"node","target_sha256":"4585e37ad0504b1265e72f2df36eb72244b3d6fe983c155434868564967e2672"}],"concept.wikipedia.welder":[{"id":"assertion.concept.wikipedia.welder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welder\", CC BY-SA 4.0) states: A welder is a person or equipment that fuses materials together.","support":[{"end":156,"quote":"A welder is a person or equipment that fuses materials together.","source_id":"wikipedia.article.welder","source_sha256":"b853afa7c759df66ad8f9be17c6a0e6c2bac3d6d528df1c5350aa06093b5a682","start":92}],"target_id":"concept.wikipedia.welder","target_kind":"node","target_sha256":"5b0fffe34dc03cfe9c3c138e7c82dc13d07355a555f9b71418b1db80f85f37ce"}],"concept.wikipedia.welder-certification":[{"id":"assertion.concept.wikipedia.welder-certification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welder certification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welder certification\", CC BY-SA 4.0) states: Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","support":[{"end":310,"quote":"Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","source_id":"wikipedia.article.welder-certification","source_sha256":"7957a47470d781ccfb952478f28fa383b50cb38dde78b1e9948bf50b5e6b26e8","start":107}],"target_id":"concept.wikipedia.welder-certification","target_kind":"node","target_sha256":"96bed595bc43584cde805bf7cfad19a0dc3f1266858f570fed1aa3230fb14d94"}],"concept.wikipedia.welding":[{"id":"assertion.concept.wikipedia.welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welding\", CC BY-SA 4.0) states: Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","support":[{"end":284,"quote":"Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","source_id":"wikipedia.article.welding","source_sha256":"cbe135c90548c52231249e991de6467a33ef4499da262067ec3349710aa5df5d","start":92}],"target_id":"concept.wikipedia.welding","target_kind":"node","target_sha256":"5133d13897327fe3b297b3b90e00d8afb4e07709b24f0d7867239960889c2975"}],"concept.wimp-parameter-space":[{"id":"assertion.complete.concept.wimp-parameter-space","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Mass-cross-section region constrained by direct searches.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.wimp-parameter-space","target_kind":"node","target_sha256":"3e8138d2ec612b7739cfdb4cdf3cd9cb66903ba47c3dbb438d6fa78047029090"}],"dataset.admx-run1b":[{"id":"assertion.complete.dataset.admx-run1b","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2018 search data covering 2.81-3.31 micro-eV.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"dataset.admx-run1b","target_kind":"node","target_sha256":"c6e6f04db3fcd198c99ca93d142f1d103c8b717057f6decd8752ba6c5f302a5f"}],"dataset.fermi-grb090510-photons":[{"id":"assertion.complete.dataset.fermi-grb090510-photons","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The photon observations of GRB090510 collected by Fermi-LAT are analyzed in the cited work to constrain energy-dependent vacuum dispersion, under its stated source and propagation assumptions.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"dataset.fermi-grb090510-photons","target_kind":"node","target_sha256":"ad3b6eb667f0bad7fd6ce75b5658d7924bb1776bea8b46287eb6ca08f075aa67"}],"dataset.grb090510":[{"id":"assertion.complete.dataset.grb090510","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: GRB090510 is a gamma-ray burst observed by Fermi-LAT whose emission was used in the cited conditional vacuum-dispersion analysis. This record denotes the burst; its photon observations have a separate dataset record.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"dataset.grb090510","target_kind":"node","target_sha256":"e3cceb04e9e3e38d54fce7dfab651dc41a628c0c48afb8b2b4751f227f38d7b7"}],"dataset.lz-4p2-tonne-year":[{"id":"assertion.complete.dataset.lz-4p2-tonne-year","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP-search analysis has a total exposure of 4.2 ± 0.1 tonne-years over 280 live days. This record denotes that exposure quantity; the associated detector data have a separate dataset record.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"dataset.lz-4p2-tonne-year","target_kind":"node","target_sha256":"71d6ca07377db1278856ddad47d315e2b0fd0044a578125c89e47bea5b83e5df"}],"dataset.lz-wimp-280-live-days":[{"id":"assertion.complete.dataset.lz-wimp-280-live-days","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP-search analysis uses detector data corresponding to 4.2 ± 0.1 tonne-years of total exposure over 280 live days. It reports no excess over expected backgrounds.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"dataset.lz-wimp-280-live-days","target_kind":"node","target_sha256":"905fc23c916e4bd6e3d66274e670347c08b99d3d22492b85f4c9fbec3b5768d8"}],"dataset.ogle-five-year-events":[{"id":"assertion.complete.dataset.ogle-five-year-events","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2622 Galactic-bulge microlensing events used for PBH constraints.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"dataset.ogle-five-year-events","target_kind":"node","target_sha256":"819b26e67bcbae0bb65e4e163dea13185d27aca271b01179f4b4e09db519a871"}],"dataset.xq100-hires-mike":[{"id":"assertion.complete.dataset.xq100-hires-mike","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Quasar spectra used in cited fuzzy-DM limits.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"dataset.xq100-hires-mike","target_kind":"node","target_sha256":"44d81fd0da28b38fc52aadc76934158ac915dfbb16d6d46b54b829f721372dde"}],"engineering.biaxially-textured-ybco-tapes-1996":[{"id":"assertion.hts.04","scope":{"assumptions":["Thermomechanical substrate texture followed by epitaxial metal and/or ceramic buffer deposition"],"population":"Epitaxial YBa2Cu3Ox films on biaxially textured, buffered metal substrates","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1996","uncertainty":"Publisher-deposited abstract retained through Crossref; the exponent formatting in the current-density value is ambiguous and no numeric Jc is claimed. Long-length manufacturing is a potential route, not established commercial output.","units":{"field":"zero field","temperature":"K"}},"statement":"Goyal et al. reported a route using industrially scalable thermomechanical texturing of flexible metal substrates followed by epitaxial buffer layers and YBa2Cu3Ox films; the deposited films carried critical currents at 77 K in zero field and had field dependencies similar to epitaxial films on single-crystal ceramic substrates.","support":[{"end":1309,"quote":"A method to obtain long lengths of flexible, biaxially oriented substrates with smooth, chemically compatible surfaces for epitaxial growth of high-temperature superconductors is reported. The technique uses well established, industrially scalable, thermomechanical processes to impart a strong biaxial texture to a base metal. This is followed by vapor deposition of epitaxial buffer layers (metal and\\/or ceramic) to yield chemically compatible surfaces. Epitaxial YBa2Cu3Ox films grown on such substrates have critical current densities exceeding 105 A\\/cm2 at 77 K in zero field and have field dependencies similar to epitaxial films on single crystal ceramic substrates. Deposited conductors made using this technique offer a potential route for the fabrication of long lengths of high-Jc wire capable of carrying high currents in high magnetic fields and at elevated temperatures.","source_id":"source.goyal-rabits-1996","source_sha256":"232bb4f07a74ff459b0ce8dfd0625fdfb685079b3452bfb9254debf07c399037","start":423}],"target_id":"engineering.biaxially-textured-ybco-tapes-1996","target_kind":"node","target_sha256":"279798f4a3962db3f109f28aaeaf339e3db3b4654bcf1a2a7d0d3b9e926a6d11"}],"engineering.tfmc-demountable-nanohm-joints":[{"id":"assertion.hts.10","scope":{"assumptions":["Conditions are joint temperature 20 K and local field up to 12 T"],"population":"Fifteen internal pancake-to-pancake joints in TFMC","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"Not resistance-free, not measured at 20.1 T joint field, and not a demonstrated repeatedly remountable reactor lifetime.","units":{"magnetic_field":"T (joint field)","resistance":"nanohm","temperature":"K"}},"statement":"Hartwig et al. reported fifteen internal demountable pancake-to-pancake TFMC joints operating with resistance in the 0.5–2.0 nanohm range at 20 K and magnetic fields up to 12 T.","support":[{"end":8308,"page":2,"quote":"Fifteen  internal  demountable  pancake-to-pancake  joints                       T 2018  and  2021             to  retire  the  design,  fabrication,  and\noperated in the 0.5 to 2.0 nΩ range at 20 K and in magnetic                      operational     risks     inherent     in     large  -scale,     high-field\nfields   up   to   12   T.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":7970}],"target_id":"engineering.tfmc-demountable-nanohm-joints","target_kind":"node","target_sha256":"1026ab72e960837eb8aa9cda347f555c83eb162522a88f6b715a285b11a0e001"}],"engineering.tfmc-nint-stack-in-plate":[{"id":"assertion.hts.08","scope":{"assumptions":["NINT denotes no insulation–no twist; modular stack-in-plate construction"],"population":"The built representative-scale TFMC winding pack and assembly","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2018–2021 program; 2023 author preprint","uncertainty":"This is an implemented magnet architecture, not a claim of unconditional passive quench protection or a completed tokamak power plant.","units":{"mass":"kg","pancakes":"count","tape_length":"km"}},"statement":"Hartwig et al. described the built TFMC as a no-insulation, no-twist REBCO stack-in-plate magnet using 270 km of tape, weighing 10058 kg, with 16 single-pancake modules and two termination plates. REBCO stacks occupy spiral plate channels, with single-pass supercritical-helium coolant channels on the other side; vacuum-pressure solder impregnation provides mechanical protection and thermal/electrical connectivity.","support":[{"end":72497,"page":10,"quote":"The   TFMC,  shown  at  the  bottom-left  of           Fig.  1  and  as  a           backed  by  Leybold  Ecodry  35  scroll  pumps. The  scroll\ndetailed CAD rendering in Fig. 4, is a non-insulated, REBCO                             pumps  were  located  outside  of  the  35-gauss  line  of  the\nstack-in-plate,     style   superconducting   magnet.   It   weighed                    TFMC  with the turbos enclosed within 1-inch thick iron\n10,058 kg and utilized 270 km of REBCO. It has three main                               magnetic shields. High vacuum in the 10-6 to 10-7 torr range\ncomponents: (1) the winding pack; (2) the structural case; and                          was routinely achieved during experiments.\n(3) the plena. The winding pack is composed of a stack of 16                       •    LN2 radiation shields and distribution system: Radiation\nsingle pancakes with 2 termination plates top and bottom. The                           shields, consisting of modules of two steel panels with a\npancakes  are  Nitronic-40  radial  plates  machined with  spiral                       thin interstitial space for LN2, were also designed at MIT\nchannels on one side for the REBCO tape stack and single-pass                           and  built  by    an  external  vendor.      They  were  assembled\nchannels on the opposite side for supercritical helium              coolant.            within the vacuum cryostat. The LN2 was gravity fed from\nAfter REBCO winding and pancake assembly is complete, the                               two storage dewars adjacent to the vacuum cryostat, which\npancake  undergoes  a  vacuum-pressure  impregnation  solder                            were provided with  LN2 from an 18,000 external gallon\nprocess to provide good mechanical protection of the REBCO                              storage tank.\nstack    and    efficient    thermal    and    electrical    connectivity          •    Power   supply:       The   system   was   delivered   by   Alpha\nthroughout each pancake.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":70469},{"end":64853,"page":9,"quote":"C. Selection of NINT for the TFMC winding pack                                    and the absence of high voltage insulation makes production of\n   At the conclusion of the first phase of TFMC in June 2019,                     NI magnets relatively efficient and scalable. In particular, the\na review  was  held  to  assess  the results  from the  VIPER  and                use of REBCO as opposed to LTS materials and the absence of\nNINT development programs with the objective of selecting the                     an epoxy vacuum pressure impregnation step eliminates two of\ntechnology     that  would  be  scaled-up       into  the  TFMC  and,  if         the   most   complex,   long   duration   high   temperature   heat\nsuccessful, the SPARC TF. Design and analysis based on the                        treatment  operations  involved  in  traditional  insulated  LTS\nexperimental and modelling results from the VIPER and NINT                        CICC  superconducting  fusion  magnets.  Because  the  magnet\ndevelopment                                                                       winding  pack  is  not  encased  in  VPI  epoxy  and  because\nprograms showed that either technology could successfully be                      demountable  pancake-to-pancake  joints             can  be    used,  NINT\nused as the base magnet winding pack technology to achieve                        magnets   can   be   fully   disassembled   for   maintenance   or\nthe necessary requirements for both the TFMC and the SPARC                        component    replacement    without    destructive    operations.\nTF. Ultimately, NINT technology was selected for the TFMC                         Finally, the intrinsic low voltage nature of NINT eliminates the\non the basis of the proposed advantages summarized in Table II                    need   for   high   voltage   current       leads   and   feeder   cables,\nalthough, as discussed at the end of this section, VIPER cable                    traditionally  one  of  the  most  challenging         parts  of  insulated\nwas utilized in several ways in the        TFMC Program.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":62719}],"target_id":"engineering.tfmc-nint-stack-in-plate","target_kind":"node","target_sha256":"0c7fa08bdb3c4c63ab67052b0ace533652a4289abea70e9102af4c4ec297b593"}],"engineering.ybco-y2o3-high-field-wire-2021":[{"id":"assertion.hts.07","scope":{"assumptions":["Field B parallel to c (normal to tape surface); JE averages over complete wire cross-section; specified substrate and stabilizer thickness"],"population":"Reported industrial wire output and the specified tested YBCO/Y2O3 tape specimens","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"Paper published in 2021","uncertainty":"Not every delivered length is claimed to exceed these JE values; selected measurements and production volume have different populations. No claim that these exact lots compose the entire TFMC.","units":{"engineering_current_density":"A/mm²","length":"km","magnetic_field":"T","temperature":"K","thickness":"micrometres","width":"mm"}},"statement":"Molodyk et al. reported over 300 km of 4 mm-wide YBCO wire manufactured in nine months, with most delivered to CFS. In tested B-parallel-c samples with a 40 micrometre substrate and 5 micrometre copper stabilizer per side, engineering current density exceeded 1000 A/mm² at 20 K and 20 T and 2000 A/mm² at 4.2 K and 20 T; the formulation used Y2O3 nanoparticles without c-axis-correlated nanocolumnar defects.","support":[{"end":14548,"page":2,"quote":"In 9  months, we manufactured over 300  km of 4  mm wide YB CO wire, delivering most of it to CFS. This has\n                                                been the largest completed order in the histor y of the 2G HTS wire industr y. We fabricated the wire on a strong\n                                                Hastelloy C276 substrate with a buffer layer architecture based on MgO textured using ion beam assisted depo-\n                                                sition and with the HTS layer grown by pulsed laser deposition (PLD), as explained in the Methods section.\n                                                The YB CO layer contains uniformly distributed  Y2O3 nanoparticles with (001) and (110) axial orientation, with\n                                                the average density of 4000                 ± 2000 μm-2. Microstructural analysis is presented in Supplementar y Information.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":13632},{"end":16218,"page":2,"quote":"Superconducting  properties  in  high  magnetic  field.                                                                                                                   In Fig.  1a we present the superconducting per                  -\n                                                formance at low temperature and high magnetic field oriented perpendicular to the wire surface (B//c) of three\n                                                representative YB CO wires measured at high field facilities in Switzerland, Japan and the USA. The samples dif-\n                                                fered in substrate thickness: 40, 60 and 100 µm and YB CO layer thickness: 2.55, 2.82 and 3.28 µm, respectively.\n                                                In all three samples ver y high values of critical current were achieved, among the best reported to date for com-\n                                                mercial 2G HTS                   wire7,26,30–34                                                                              . In particular, an I                              c at 20  K, 20  T in the 220–270 A/4  mm range and an I                              c at 4.2  K,\n                                                20 T in the 450–570 A/4 mm range were measured. Record J                              E values for commercial wires of over 1000 A/mm2\n                                                at 20   K, 20   T and over 2000 A/mm2 at 4.2   K, 20   T were established for 40   μm substrate with 5   μm per side of\n                                                stabilising copper.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":14598},{"end":4134,"page":1,"quote":"We demonstrate a novel YBCO superconductor formulation without\n                                                          the c-axis correlated nano-columnar defects that are widely believed to be prerequisite for high\n                                                          in-field performance.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":3837}],"target_id":"engineering.ybco-y2o3-high-field-wire-2021","target_kind":"node","target_sha256":"05a7573184051f7a762d9c3a190174d4fd1ae93f101d8d74866d1dad5ed39e31"}],"event.bullet-cluster":[{"id":"assertion.complete.event.bullet-cluster","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The Bullet Cluster is a merging-cluster system used in the cited studies to investigate dark-matter interactions. The finite-range-force analysis considers possible effects on collision velocity and post-collision separation of dark matter and galaxies.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":2381,"quote":"We review theories of dark matter (DM) beyond the collisionless paradigm, known as self-interacting dark matter (SIDM), and their observable implications for astrophysical structure in the Universe. Self-interactions are motivated, in part, due to the potential to explain long-standing (and more recent) small scale structure observations that are in tension with collisionless cold DM (CDM) predictions. Simple particle physics models for SIDM can provide a universal explanation for these observations across a wide range of mass scales spanning dwarf galaxies, low and high surface brightness spiral galaxies, and clusters of galaxies. At the same time, SIDM leaves intact the success of $\\Lambda$CDM cosmology on large scales. This report covers the following topics: (1) small scale structure issues, including the core-cusp problem, the diversity problem for rotation curves, the missing satellites problem, and the too-big-to-fail problem, as well as recent progress in hydrodynamical simulations of galaxy formation; (2) N-body simulations for SIDM, including implications for density profiles, halo shapes, substructure, and the interplay between baryons and self-interactions; (3) semi-analytic Jeans-based methods that provide a complementary approach for connecting particle models with observations; (4) merging systems, such as cluster mergers (e.g., the Bullet Cluster) and minor infalls, along with recent simulation results for mergers; (5) particle physics models, including light mediator models and composite DM models; and (6) complementary probes for SIDM, including indirect and direct detection experiments, particle collider searches, and cosmological observations. We provide a summary and critical look for all current constraints on DM self-interactions and an outline for future directions.","source_id":"completion-source.495bd78c68aa1596d994","source_sha256":"7add5fe1b98d3f97f006857a5ad1a04b37c36be497e2f7eb35652b95a47ee519","start":561}],"target_id":"event.bullet-cluster","target_kind":"node","target_sha256":"f53fbe4bc53ba095b8254f1ead16448d0d3584560e787d6360fab7c0e5eefcfe"}],"evidence.admx-dfsz-exclusion":[{"id":"assertion.complete.evidence.admx-dfsz-exclusion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX Run 1B analysis excludes DFSZ axions over 680–790 MHz except for mode-crossing gaps, assuming axions supply 100% of the dark-matter density.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"evidence.admx-dfsz-exclusion","target_kind":"node","target_sha256":"3c01df78ccc646428864d61d25552f7532171da9b5e95263a0cf9a11a07297ac"}],"evidence.bmv-proposal-2017":[{"id":"assertion.complete.evidence.bmv-proposal-2017","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2017 laboratory entanglement-witness proposal.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615},{"end":1105,"quote":"We provide brief answers to a number of recurring questions about the BMV effect and the related experimental proposal (Bose et al., 2017; Marletto and Vedral, 2017). Some of these questions include alleged counter-examples to our result, stating that if gravity (or anything mediating the interaction) can create entanglement while complying with locality, then it must then be non-classical. Here we explain why these objections are not counter-examples and why our result still stands; we also explore a few other important subtleties often disregarded on a first read of our paper (Marletto and Vedral, 2017).","source_id":"completion-source.b0684b58644cb3ab135c","source_sha256":"8f9b9ee23bbaa60ef23eb04b9f1c91a1df138a89248fece1782281c1364e4953","start":492}],"target_id":"evidence.bmv-proposal-2017","target_kind":"node","target_sha256":"877adc97a859d7207976c682219c7c90ae794fe45e908164f6bdfb5e0d5df1c3"}],"evidence.fuzzy-dm-lyman-alpha-limit":[{"id":"assertion.complete.evidence.fuzzy-dm-lyman-alpha-limit","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Cited analysis sets lower mass limits under thermal-history assumptions.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"evidence.fuzzy-dm-lyman-alpha-limit","target_kind":"node","target_sha256":"9e32c39ebf5217792df96eec9bcd8d7f64732629bfe6107223572eaf0f8d350b"}],"evidence.lz-crdm-null-2025":[{"id":"assertion.complete.evidence.lz-crdm-null-2025","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: No excess above background in cited boosted-DM search.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"evidence.lz-crdm-null-2025","target_kind":"node","target_sha256":"95badcbe7646d511fe8d51fde2e1a84afafaeab6f964c8514a2bce0276a7c7b3"}],"evidence.lz-null-2024":[{"id":"assertion.complete.evidence.lz-null-2024","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: No excess over expected backgrounds in cited WIMP search.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"evidence.lz-null-2024","target_kind":"node","target_sha256":"4abf970133a2eeac7690a70040d269a5b75397d149ee82179301bb852a99ed07"}],"evidence.ogle-pbh-constraint":[{"id":"assertion.complete.evidence.ogle-pbh-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Microlensing sample constrains PBH abundance in Earth-Jupiter mass range.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"evidence.ogle-pbh-constraint","target_kind":"node","target_sha256":"704663dd5d7d240ee49561581fc3da55793294214782f39e57baecf70948c4fa"}],"evidence.qg-liv-constraint-2013":[{"id":"assertion.complete.evidence.qg-liv-constraint-2013","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Fermi data disfavors some Planck-scale linear-dispersion models.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"evidence.qg-liv-constraint-2013","target_kind":"node","target_sha256":"e4ea8ad3d2d5ac924877928fe227204ff6b8eec67c036574c730200d900822cc"}],"field.aat.300054162":[{"id":"assertion.field.aat.300054162","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural history as defined in the captured Getty AAT record 300054162","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural history as: Study of the development over time of the human built environment.","support":[{"end":501,"quote":"Study of the development over time of the human built environment.","source_id":"getty-aat.300054162","source_sha256":"8c446b144dd2ae817b202e844cf0b23934c9f394eee2ca1d262eaa345606f4c8","start":435}],"target_id":"field.aat.300054162","target_kind":"node","target_sha256":"089e0383b3042aa3dec880e448134e88e12826043a6f264519979227148b32f4"}],"field.aat.300054233":[{"id":"assertion.field.aat.300054233","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art history as defined in the captured Getty AAT record 300054233","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art history as: Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","support":[{"end":721,"quote":"Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","source_id":"getty-aat.300054233","source_sha256":"05f0259ddef9c12b8671493f4f6b6da54bd8ac2cba0320fb09258fa0cf76c36e","start":425}],"target_id":"field.aat.300054233","target_kind":"node","target_sha256":"059b7401f4014537e9d8f5b65f10286129b86569ea2d16201bcd481c7d4d467f"}],"field.aat.300054240":[{"id":"assertion.field.aat.300054240","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musicology as defined in the captured Getty AAT record 300054240","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","support":[{"end":598,"quote":"Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","source_id":"getty-aat.300054240","source_sha256":"628d6177e23f40d8ef6bce1f4cfe5b9a2fea6252b8f063673537711d57260f90","start":424}],"target_id":"field.aat.300054240","target_kind":"node","target_sha256":"d30027c4896aa5afd898ab5887bacc38ffb61a42581bd48e98e70e828f1b671f"}],"field.aat.300054241":[{"id":"assertion.field.aat.300054241","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ethnomusicology as defined in the captured Getty AAT record 300054241","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ethnomusicology as: Branch of musicology focusing on the study of music in its cultural context.","support":[{"end":485,"quote":"Branch of musicology focusing on the study of music in its cultural context.","source_id":"getty-aat.300054241","source_sha256":"d471ea0ca72ac46d48e4c6bf56d8edb515470e77854b21130d01509ea436e418","start":409}],"target_id":"field.aat.300054241","target_kind":"node","target_sha256":"9b76e12cc70557ee0298f9cc4bf66131151a66069f73f5a3c4f637003f271eab"}],"field.aat.300054245":[{"id":"assertion.field.aat.300054245","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"linguistics as defined in the captured Getty AAT record 300054245","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","support":[{"end":625,"quote":"Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","source_id":"getty-aat.300054245","source_sha256":"4c78f04b65bcaeda4650619eb0a471da1289c4ab83cf7ec50d4ae762b213d4b5","start":418}],"target_id":"field.aat.300054245","target_kind":"node","target_sha256":"0ef82225111b7b1eb24f7dded0e7aea00db697ae6520483e12ac111030553c7c"}],"field.aat.300054247":[{"id":"assertion.field.aat.300054247","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"applied linguistics as defined in the captured Getty AAT record 300054247","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines applied linguistics as: Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","support":[{"end":657,"quote":"Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","source_id":"getty-aat.300054247","source_sha256":"a1e7e97e85e2dee33aa15ad53949dfd53f2b615b6f064ed97d89129d93b058d0","start":427}],"target_id":"field.aat.300054247","target_kind":"node","target_sha256":"ca37d3ccef43018a6c3a0c04cc74fb3fadd9d705f6712b0fb4d4a37db7f77172"}],"field.aat.300054248":[{"id":"assertion.field.aat.300054248","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropological linguistics as defined in the captured Getty AAT record 300054248","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropological linguistics as: Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","support":[{"end":553,"quote":"Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","source_id":"getty-aat.300054248","source_sha256":"f7dd4c1c84dfc641a87ce7d022173d4402e29ac9a548745e524ee21e67bc3b06","start":417}],"target_id":"field.aat.300054248","target_kind":"node","target_sha256":"61041d0d305c5084d5051777ea954d6d4136d250aeacd4f0a1aa02f43b23d57a"}],"field.aat.300054250":[{"id":"assertion.field.aat.300054250","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"computational linguistics as defined in the captured Getty AAT record 300054250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines computational linguistics as: Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","support":[{"end":601,"quote":"Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","source_id":"getty-aat.300054250","source_sha256":"2bbebc03073ab9bf89c3ac9f94edbd7baf9f2406eeb275a0893686bad5086fc8","start":415}],"target_id":"field.aat.300054250","target_kind":"node","target_sha256":"9853d8a6fc4011408a05a6f89f87acaa0db514def0aa5869e9f542715113ae94"}],"field.aat.300054251":[{"id":"assertion.field.aat.300054251","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"graphemics as defined in the captured Getty AAT record 300054251","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines graphemics as: Study of writing systems and of their relation to speech.","support":[{"end":461,"quote":"Study of writing systems and of their relation to speech.","source_id":"getty-aat.300054251","source_sha256":"1d8ecc39b110ba74705f8059840af80ce792982b4083356465ea0a2d4abc4525","start":404}],"target_id":"field.aat.300054251","target_kind":"node","target_sha256":"13899441bddfe016ac1dea610641a2f9d7cbda6a9694f394879622013e2b59e2"}],"field.aat.300054254":[{"id":"assertion.field.aat.300054254","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"semiotics as defined in the captured Getty AAT record 300054254","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","support":[{"end":572,"quote":"Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","source_id":"getty-aat.300054254","source_sha256":"fb27eb8544ba14857ff22bf9014021a284cce9e3f84e9c276e76b1a5b51364ac","start":437}],"target_id":"field.aat.300054254","target_kind":"node","target_sha256":"d4e1b95d09da68ebcaef2b58d11e4b4de0f12065c5edf3b48b718c0697f578d6"}],"field.aat.300054255":[{"id":"assertion.field.aat.300054255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sociolinguistics as defined in the captured Getty AAT record 300054255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.","support":[{"end":519,"quote":"The study of language as it functions in society, and of the interaction between linguistic and social variables.","source_id":"getty-aat.300054255","source_sha256":"f32e5d80bd60b3349604c5cb3db90666647c29197c5b79acb2b7baed7ce27a8e","start":406}],"target_id":"field.aat.300054255","target_kind":"node","target_sha256":"25a4c8b5d07b523ab298a8736772808e98f601dfaa6b8879e40a645b022ec82e"}],"field.aat.300054256":[{"id":"assertion.field.aat.300054256","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theoretical linguistics as defined in the captured Getty AAT record 300054256","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","support":[{"end":639,"quote":"Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","source_id":"getty-aat.300054256","source_sha256":"d87b021cf97f7e4fa5287d8a121abfdd959fa07dd5d20f8f610ee9c4199138f1","start":431}],"target_id":"field.aat.300054256","target_kind":"node","target_sha256":"0ebe667d0d81a0518b55dac832eff7c5d6aaf9d45826bb48fcde5db7774f2a04"}],"field.aat.300054257":[{"id":"assertion.field.aat.300054257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"historical linguistics as defined in the captured Getty AAT record 300054257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines historical linguistics as: Study of the development of or changes in words, speech, and language or groups of languages over time.","support":[{"end":519,"quote":"Study of the development of or changes in words, speech, and language or groups of languages over time.","source_id":"getty-aat.300054257","source_sha256":"7bbfd58d035735b3e009baef334761a43664be5667b76cf1896041feb545203b","start":416}],"target_id":"field.aat.300054257","target_kind":"node","target_sha256":"d521d8fcbed6345e6eae4d52ab2bb3aba61c3972c8b25c2a93ed996ed7a0f26c"}],"field.aat.300054258":[{"id":"assertion.field.aat.300054258","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metalinguistics as defined in the captured Getty AAT record 300054258","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines metalinguistics as: Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","support":[{"end":515,"quote":"Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","source_id":"getty-aat.300054258","source_sha256":"331efa37f810e9f97ff24bd36218dd4c6c75f7b390b8e809879f6c564c8daba4","start":409}],"target_id":"field.aat.300054258","target_kind":"node","target_sha256":"26828596f16b13d0ae5651884453d51ac56157b9891b87569d7c48e8da3bf7ff"}],"field.aat.300054262":[{"id":"assertion.field.aat.300054262","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phonetics as defined in the captured Getty AAT record 300054262","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phonetics as: Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","support":[{"end":643,"quote":"Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","source_id":"getty-aat.300054262","source_sha256":"885d2dc98d95c32e323f35711dfd9ba56f9c36798be957a8b708dadabe7f2c18","start":403}],"target_id":"field.aat.300054262","target_kind":"node","target_sha256":"794415625bb8a6bccd2f613be24233fd25aa1f3c51d64435a59e34e0124a153e"}],"field.aat.300054263":[{"id":"assertion.field.aat.300054263","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phonology as defined in the captured Getty AAT record 300054263","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","support":[{"end":632,"quote":"Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","source_id":"getty-aat.300054263","source_sha256":"0b3e5b7c9e0913f303a6dc38da3f737c515cee2c02ad919dc21bf5c7976f6431","start":403}],"target_id":"field.aat.300054263","target_kind":"node","target_sha256":"40eff5869e0cba7a7f0bce7533e514cf88ea1f120ccfaf59c62f46f096d5f438"}],"field.aat.300054264":[{"id":"assertion.field.aat.300054264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pragmatics as defined in the captured Getty AAT record 300054264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.","support":[{"end":509,"quote":"Study of the aspects of meaning in language that are related to the use of language in a natural context.","source_id":"getty-aat.300054264","source_sha256":"a49970291aac2368c04b994d03f51262ee4a457bc2c2fcdb33852e1ac14185a8","start":404}],"target_id":"field.aat.300054264","target_kind":"node","target_sha256":"63111ab3bc2b99e43f3b71b63407db11e6f3ec5543f533b03c2128d87aaad0f5"}],"field.aat.300054268":[{"id":"assertion.field.aat.300054268","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"semantics as defined in the captured Getty AAT record 300054268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines semantics as: Study of meanings in language and of changes in those meanings.","support":[{"end":466,"quote":"Study of meanings in language and of changes in those meanings.","source_id":"getty-aat.300054268","source_sha256":"ac5808180065a924b1c0da939ae2bdb2e2bd24a476d8df41cb1a560f31181afa","start":403}],"target_id":"field.aat.300054268","target_kind":"node","target_sha256":"bd4f17728869602e04d55487c379ca669aff58260789f344a0ca8e68bbdfa0eb"}],"field.aat.300054273":[{"id":"assertion.field.aat.300054273","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary studies as defined in the captured Getty AAT record 300054273","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary studies as: Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","support":[{"end":1003,"quote":"Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","source_id":"getty-aat.300054273","source_sha256":"cd5dd94c1ef7226014396c53f441d3bebce115676e4ab71d6b5532ed8f559ba8","start":403}],"target_id":"field.aat.300054273","target_kind":"node","target_sha256":"88c0fd85161a7aafb0d0086fc119afdca055a070d13bb792780b98b214fae417"}],"field.aat.300054275":[{"id":"assertion.field.aat.300054275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museology as defined in the captured Getty AAT record 300054275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museology as: The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","support":[{"end":607,"quote":"The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","source_id":"getty-aat.300054275","source_sha256":"37380e6f30329006309fb7683025c410c8233b62514b54ba669c3bf7fba07214","start":396}],"target_id":"field.aat.300054275","target_kind":"node","target_sha256":"19dbec9f9b2d4a9446e576212e0cdff89a6a5e8e864fee9c1b0dd99d77f244e2"}],"field.aat.300054280":[{"id":"assertion.field.aat.300054280","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"aesthetics as defined in the captured Getty AAT record 300054280","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","support":[{"end":747,"quote":"Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","source_id":"getty-aat.300054280","source_sha256":"9a4d060c54538ef264af1ff43707cc812a2ae77dc30a9e76bf47647b1e11ed10","start":390}],"target_id":"field.aat.300054280","target_kind":"node","target_sha256":"15bca56fbd856e6d2dd6dbdd956e9bed858fd1b34f703fa4818ec4298da89d57"}],"field.aat.300054283":[{"id":"assertion.field.aat.300054283","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axiology as defined in the captured Getty AAT record 300054283","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines axiology as: Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","support":[{"end":678,"quote":"Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","source_id":"getty-aat.300054283","source_sha256":"4ed213135e7aa2aa4fdc8341d12b6451afd33908939aaa6f457338bcaf27e3c0","start":388}],"target_id":"field.aat.300054283","target_kind":"node","target_sha256":"7e85711aa9b40e9c9cf79e7d115ee3e272699467637376ff65b03045294024bb"}],"field.aat.300054288":[{"id":"assertion.field.aat.300054288","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"epistemology as defined in the captured Getty AAT record 300054288","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","support":[{"end":486,"quote":"Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","source_id":"getty-aat.300054288","source_sha256":"9d2b558f24366a8c6252907b8735373076e1dcf2420f9b553f53e6373445f0da","start":392}],"target_id":"field.aat.300054288","target_kind":"node","target_sha256":"6f51e292115e38cafabcd0be653c86ba620a6e307150b4d673c62610d011cec8"}],"field.aat.300054296":[{"id":"assertion.field.aat.300054296","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"process philosophy as defined in the captured Getty AAT record 300054296","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines process philosophy as: Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","support":[{"end":545,"quote":"Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","source_id":"getty-aat.300054296","source_sha256":"790b8f53210503f8f99316ad37ecaed753d182e0c9753102ee3edd41f214596b","start":399}],"target_id":"field.aat.300054296","target_kind":"node","target_sha256":"ebb4295d32c002a3c36d81bc55bb0526220e86b31c32eaafbcd0ec56033a6ec3"}],"field.aat.300054297":[{"id":"assertion.field.aat.300054297","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phenomenology as defined in the captured Getty AAT record 300054297","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.","support":[{"end":482,"quote":"Branch of modern philosophy dealing with the description and classification of phenomena.","source_id":"getty-aat.300054297","source_sha256":"ad770d0f664de620880b777c09bb2b38932dcfcf46a01ca279d1708bd94f0c39","start":393}],"target_id":"field.aat.300054297","target_kind":"node","target_sha256":"e9a4ca299d689f567b59cda7a185fcec773e0ee1bd32cbf9379b00dfc8242634"}],"field.aat.300054307":[{"id":"assertion.field.aat.300054307","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biblical studies as defined in the captured Getty AAT record 300054307","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines biblical studies as: Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","support":[{"end":616,"quote":"Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","source_id":"getty-aat.300054307","source_sha256":"0faa183f99a6e8dfdf519ce3f80893ec8cee75f737bce8f897e30d0b8c12f159","start":438}],"target_id":"field.aat.300054307","target_kind":"node","target_sha256":"65b8fc50dad9e8f01fff67ba4ddb55b830a53f033703699ac88453d47c37640b"}],"field.aat.300054308":[{"id":"assertion.field.aat.300054308","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"church history as defined in the captured Getty AAT record 300054308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines church history as: Study of the history of the Christian Church and its sects and branches.","support":[{"end":508,"quote":"Study of the history of the Christian Church and its sects and branches.","source_id":"getty-aat.300054308","source_sha256":"5bb7535699d504ca90670e2278b3f1614e468a02949e51b98afec53e6f50e06e","start":436}],"target_id":"field.aat.300054308","target_kind":"node","target_sha256":"5431e72ebaeddd97447c406237450b1060ff5795b1e24cb5acfb03c311b80188"}],"field.aat.300054309":[{"id":"assertion.field.aat.300054309","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious history as defined in the captured Getty AAT record 300054309","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious history as: Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","support":[{"end":843,"quote":"Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","source_id":"getty-aat.300054309","source_sha256":"9226fcbdd3e5f56305224f911ac17f8ea66e0b6ae28d2839d1a86f6302fbcc96","start":439}],"target_id":"field.aat.300054309","target_kind":"node","target_sha256":"3172e3c2a33c4196b39fd88103fd0c61788626b92f681527c5c4f94afa5b8198"}],"field.aat.300054310":[{"id":"assertion.field.aat.300054310","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ecclesiology as defined in the captured Getty AAT record 300054310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ecclesiology as: Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","support":[{"end":572,"quote":"Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","source_id":"getty-aat.300054310","source_sha256":"bd31a00058c14edff509ba4160f96a117f5cb9c382da2a0e35aff90ad3307d08","start":434}],"target_id":"field.aat.300054310","target_kind":"node","target_sha256":"f6ecbc3042de3b09b678a69e6411814e3e5976e2b4f7612d2fed6876fe6b71b0"}],"field.aat.300054311":[{"id":"assertion.field.aat.300054311","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"eschatology as defined in the captured Getty AAT record 300054311","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines eschatology as: The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","support":[{"end":658,"quote":"The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","source_id":"getty-aat.300054311","source_sha256":"774020abe4ef0fe157b3711b05f5eda9f00c783c0d9f33a7d12f400420cc8718","start":433}],"target_id":"field.aat.300054311","target_kind":"node","target_sha256":"4d592ed365cbe44c0e8b9a96e28c4c260600b98312a6813b402bb8d6419bfedd"}],"field.aat.300054312":[{"id":"assertion.field.aat.300054312","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious ethics as defined in the captured Getty AAT record 300054312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious ethics as: Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","support":[{"end":599,"quote":"Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","source_id":"getty-aat.300054312","source_sha256":"fff546ca6a64a6dc235f7b524d90afb5a7a74bf5c1a7840aba7aceb1410a2a34","start":438}],"target_id":"field.aat.300054312","target_kind":"node","target_sha256":"f8a6b84be289400f15212d88754a7fdfd7ab32d7558095871c989622e2b2e319"}],"field.aat.300055944":[{"id":"assertion.field.aat.300055944","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"social ethics as defined in the captured Getty AAT record 300055944","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines social ethics as: Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","support":[{"end":529,"quote":"Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","source_id":"getty-aat.300055944","source_sha256":"1e8bafbe542ea8bb95ccc934a37cfddc2c3d542648f0af4ce4fb89f475fd37ef","start":429}],"target_id":"field.aat.300055944","target_kind":"node","target_sha256":"4818aeacd73c395caf5ec90d7dca06193f0757b2af50f2d4fe049d6eec60a922"}],"field.aat.300055987":[{"id":"assertion.field.aat.300055987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious ideologies as defined in the captured Getty AAT record 300055987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious ideologies as: Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","support":[{"end":744,"quote":"Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","source_id":"getty-aat.300055987","source_sha256":"640fff13e6cf0cdb04a1f82164c1a53b8bfe41c0ea1991e7aea7baeaa95a357e","start":436}],"target_id":"field.aat.300055987","target_kind":"node","target_sha256":"4bce4333b727e0612a8316bd8bbd09688181192aadeb07d705a820f2d6b0a56a"}],"field.aat.300069325":[{"id":"assertion.field.aat.300069325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"poetics as defined in the captured Getty AAT record 300069325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines poetics as: The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","support":[{"end":525,"quote":"The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","source_id":"getty-aat.300069325","source_sha256":"82fa2e1ca635d796d09e010c2b961bc246d4bd315a01cbce7a95c97734b80550","start":393}],"target_id":"field.aat.300069325","target_kind":"node","target_sha256":"8f0b37b972781744d5b8153fce39b330726ac1bde0141fe547e8ae59d7e63b53"}],"field.aat.300080402":[{"id":"assertion.field.aat.300080402","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural criticism as defined in the captured Getty AAT record 300080402","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural criticism as: The study or practice of the analytical description, interpretation, and evaluation of architectural works.","support":[{"end":544,"quote":"The study or practice of the analytical description, interpretation, and evaluation of architectural works.","source_id":"getty-aat.300080402","source_sha256":"71e19436b75cf7f1ae16b7f477f1b35ad4f3aee1a480bac74d12cb63fda30c39","start":437}],"target_id":"field.aat.300080402","target_kind":"node","target_sha256":"20829f44d5ec407c862cd419b1953ae92d9b365949bb81b0a91f26f906cd3d32"}],"field.aat.300112920":[{"id":"assertion.field.aat.300112920","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"etymology as defined in the captured Getty AAT record 300112920","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines etymology as: Study of the history of a particular word or element of a word, or of historical linguistic change.","support":[{"end":536,"quote":"Study of the history of a particular word or element of a word, or of historical linguistic change.","source_id":"getty-aat.300112920","source_sha256":"a4ad5ac76b33e21e062101ee41226455cc5466ced3eb948de50cd258911a52b6","start":437}],"target_id":"field.aat.300112920","target_kind":"node","target_sha256":"db882b586887a73653613ebead6e09bc6c38cc656d75ceb8ec725676943a01a2"}],"field.aat.300168233":[{"id":"assertion.field.aat.300168233","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art criticism as defined in the captured Getty AAT record 300168233","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art criticism as: The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","support":[{"end":547,"quote":"The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","source_id":"getty-aat.300168233","source_sha256":"cd33a11a41f24191ea60801b12f66d58406aea531fe921662043142cb85d6a5a","start":427}],"target_id":"field.aat.300168233","target_kind":"node","target_sha256":"29f20d7b6a110f902162bf1038ccb6c1249d03da3147367e8ad3fe3618e6f26b"}],"field.aat.300174160":[{"id":"assertion.field.aat.300174160","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary criticism as defined in the captured Getty AAT record 300174160","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary criticism as: The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","support":[{"end":572,"quote":"The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","source_id":"getty-aat.300174160","source_sha256":"d623b65b5915e38a41dcfa7d7ed503568554dca9f37229f61bc0a99313bca0ef","start":404}],"target_id":"field.aat.300174160","target_kind":"node","target_sha256":"06f1bcb522958fd1644289d10cc99a282c0e7b2e2948b885bbd3507e3779ff4f"}],"field.aat.300174173":[{"id":"assertion.field.aat.300174173","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary history as defined in the captured Getty AAT record 300174173","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary history as: Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","support":[{"end":523,"quote":"Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","source_id":"getty-aat.300174173","source_sha256":"f332deb6f26f6d771f52dc47b0f20c98683d2f22c212adb29b0733911112c532","start":402}],"target_id":"field.aat.300174173","target_kind":"node","target_sha256":"28c8de8a0555f413e60b22169badbda6fd9794c89cec7e23c6a29764a4b29c59"}],"field.aat.300205021":[{"id":"assertion.field.aat.300205021","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organology as defined in the captured Getty AAT record 300205021","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines organology as: Descriptive and analytical study of musical instruments.","support":[{"end":460,"quote":"Descriptive and analytical study of musical instruments.","source_id":"getty-aat.300205021","source_sha256":"9f2a08bbb8144fffb68c5d50373657b364eb42741762a30192e1a710c1763efd","start":404}],"target_id":"field.aat.300205021","target_kind":"node","target_sha256":"bc4ccb74c2bd94b60b6119494bbcae7eb5e0453bf1e4839ec50c3ee2a9265139"}],"field.aat.300255715":[{"id":"assertion.field.aat.300255715","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"choreography as defined in the captured Getty AAT record 300255715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines choreography as: The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","support":[{"end":608,"quote":"The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","source_id":"getty-aat.300255715","source_sha256":"8c8155135be03f682b5748b79a9e25d74949d6fc7e3b003f48626e8469842cb4","start":418}],"target_id":"field.aat.300255715","target_kind":"node","target_sha256":"586a714487737c0350dd38f61bd967748e219c0944203782e9d7dd00bb8adcdf"}],"field.aat.300258340":[{"id":"assertion.field.aat.300258340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ideology as defined in the captured Getty AAT record 300258340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ideology as: Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","support":[{"end":712,"quote":"Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","source_id":"getty-aat.300258340","source_sha256":"d1c7802a0ea5c915af5840df920723e46b2a6a09acc904a517ff0e3360a2b24c","start":392}],"target_id":"field.aat.300258340","target_kind":"node","target_sha256":"32abe7a259fccd5f6ab51cd697e3826a2be9effd39d65aa8382a8f74c1bee295"}],"field.aat.300265672":[{"id":"assertion.field.aat.300265672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectonics as defined in the captured Getty AAT record 300265672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectonics as: The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","support":[{"end":551,"quote":"The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","source_id":"getty-aat.300265672","source_sha256":"7e891eba4a0e1ce81808efa389ddf7ed923b7df7531206917f8e5ad14c2567c7","start":423}],"target_id":"field.aat.300265672","target_kind":"node","target_sha256":"2499b3eaa12f85b2ed87e641ae213998d378c778e43aa35dc659aba2477edb9d"}],"field.aat.300265767":[{"id":"assertion.field.aat.300265767","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"teleology as defined in the captured Getty AAT record 300265767","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines teleology as: Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","support":[{"end":497,"quote":"Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","source_id":"getty-aat.300265767","source_sha256":"2b0334afd9c829e10b40b21e8d2d57ef79127f04a1a0e90fc138c37a36b5ed22","start":389}],"target_id":"field.aat.300265767","target_kind":"node","target_sha256":"a6641342a25b80b05ecc973dc0957a6ca31da1707ec206b5a7fc7f309dfa1747"}],"field.aat.300379540":[{"id":"assertion.field.aat.300379540","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"technical art history as defined in the captured Getty AAT record 300379540","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines technical art history as: Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","support":[{"end":782,"quote":"Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","source_id":"getty-aat.300379540","source_sha256":"885c751e155f2fa4b298bd80fb27c33ab71aaf81198225a93082f6bafda04889","start":416}],"target_id":"field.aat.300379540","target_kind":"node","target_sha256":"e5709e4d9e0b0eeb83c833c08d7ed4d4095334136ea6d69074aab2063c646615"}],"field.aat.300387576":[{"id":"assertion.field.aat.300387576","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museography as defined in the captured Getty AAT record 300387576","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museography as: Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","support":[{"end":537,"quote":"Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","source_id":"getty-aat.300387576","source_sha256":"b47de4a11e764bdf91a45b28b8ec95394e14483d982f9293c04bde2a08688c5c","start":390}],"target_id":"field.aat.300387576","target_kind":"node","target_sha256":"8ae914b8a67deecc99d5c7d9f07c4abeeae2051ab39d0f504110930916adaaa5"}],"field.aat.300389757":[{"id":"assertion.field.aat.300389757","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cryptology as defined in the captured Getty AAT record 300389757","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cryptology as: The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","support":[{"end":617,"quote":"The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","source_id":"getty-aat.300389757","source_sha256":"f44007bd4e9f85d48aea9a0105238be6467e81b38ad89c46f30820fbcc12f810","start":438}],"target_id":"field.aat.300389757","target_kind":"node","target_sha256":"99c1eebefd5019489c70eef7d82014e68efe9561c47990a3ab4ea836e0c21b59"}],"field.aat.300389758":[{"id":"assertion.field.aat.300389758","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cryptography as defined in the captured Getty AAT record 300389758","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.","support":[{"end":483,"quote":"The practice of writing in code or symbols.","source_id":"getty-aat.300389758","source_sha256":"7ec97679edf7ea49d65ddb7f6ace52cca2abc837705f00da76df964e574a382b","start":440}],"target_id":"field.aat.300389758","target_kind":"node","target_sha256":"8b704d583f45f5d988b45c9237fa3ce42809583c8e89a4578ba4363787aeffd2"}],"field.aat.300412155":[{"id":"assertion.field.aat.300412155","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"book history as defined in the captured Getty AAT record 300412155","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines book history as: Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","support":[{"end":1081,"quote":"Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","source_id":"getty-aat.300412155","source_sha256":"f97123540749ebbcca6c3e57ce7417b50fe7ec9cfc830534335bef182e3afe71","start":399}],"target_id":"field.aat.300412155","target_kind":"node","target_sha256":"842a06a5c36fbdee740dc80c63afc7d4cde0feecad3d147cc4cab9822ec40e54"}],"field.aat.300417579":[{"id":"assertion.field.aat.300417579","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"music theory as defined in the captured Getty AAT record 300417579","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music theory as: Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","support":[{"end":546,"quote":"Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","source_id":"getty-aat.300417579","source_sha256":"7d8709ad288108456b0a30fb8e0e2af8e340d525b8d0e11d6561e7e681d4cc5d","start":418}],"target_id":"field.aat.300417579","target_kind":"node","target_sha256":"de9bd80fb6fc28b15b80bb8086749f1665f9a1c3ea14055ff5ab1f6650eecbc2"}],"field.aat.300435151":[{"id":"assertion.field.aat.300435151","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural photography as defined in the captured Getty AAT record 300435151","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural photography as: Specialization of photography focused on architecture as subject.","support":[{"end":498,"quote":"Specialization of photography focused on architecture as subject.","source_id":"getty-aat.300435151","source_sha256":"c74df4212891c7ee97bf42488e76c6b91f33536986c8890e760ce8ef8b2cc4d4","start":433}],"target_id":"field.aat.300435151","target_kind":"node","target_sha256":"eb72874b4ab1b1e63c60aaba8bae2c1abbf3476424373aa43a28daf794949158"}],"field.aat.300444364":[{"id":"assertion.field.aat.300444364","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paper history as defined in the captured Getty AAT record 300444364","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paper history as: Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","support":[{"end":629,"quote":"Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","source_id":"getty-aat.300444364","source_sha256":"f8a922de5280f93a178b3981b1f410ed7602130de62014f59d683a6e5d4b8277","start":400}],"target_id":"field.aat.300444364","target_kind":"node","target_sha256":"5d22624b553dc5249817089a8d0ee51ced07e0d9cc405feefc66427955d89f6e"}],"field.ai":[{"id":"assertion.complete.field.ai","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Artificial intelligence in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Artificial intelligence as: Theory and development of COMPUTER SYSTEMS which perform tasks that normally require human intelligence. Such tasks may include speech recognition, LEARNING ; VISUAL PERCEPTION ; MATHEMATICAL COMPUTING ; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","support":[{"end":655,"quote":"Theory and development of\nCOMPUTER SYSTEMS\nwhich perform tasks that normally require human intelligence. Such tasks may include speech recognition,\nLEARNING\n;\nVISUAL PERCEPTION\n;\nMATHEMATICAL COMPUTING\n; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","source_id":"nlm-mesh.8fdf3c0558d0b89101fb","source_sha256":"acce7fa759a5505014b23ce88c231e5f68cea1bcd3188361e87f4dedcc9e790b","start":378}],"target_id":"field.ai","target_kind":"node","target_sha256":"a454a254c4fd117c5ec18947bd40fc9bbcd1050e6f733c5fad200fb591b32358"}],"field.anatomy":[{"id":"assertion.complete.field.anatomy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Anatomy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Anatomy as: A branch of biology dealing with the structure of organisms.","support":[{"end":544,"quote":"A branch of biology dealing with the structure of organisms.","source_id":"nlm-mesh.0b589dd05c92deac1e04","source_sha256":"e8edd3705857ad1c75b8acc3e4f9bb4623884a10102b79b5e7342a2f05a87a9c","start":484}],"target_id":"field.anatomy","target_kind":"node","target_sha256":"fcd6a062888cb1e70ecf74a027f601fa74169b992177ae173fb9c8a95beea2cf"}],"field.anthropology":[{"id":"assertion.complete.field.anthropology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Anthropology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.","support":[{"end":455,"quote":"The science devoted to the comparative study of man.","source_id":"nlm-mesh.bcc9794e5c2487d85964","source_sha256":"0dae9a26be94f6fdb84ae4db206436830a3003a86150917797dce444c2e29cbd","start":403}],"target_id":"field.anthropology","target_kind":"node","target_sha256":"db936b1d24777d51c4e14d51a2c932a97c7367471c12d86b49781a5d1a0c35be"}],"field.archaeology":[{"id":"assertion.complete.field.archaeology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Archaeology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Archaeology as: Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","support":[{"end":537,"quote":"Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","source_id":"nlm-mesh.76d8813e0d4330d9aaf5","source_sha256":"c823370f3944ce6fb2da5ddf3a58d97f526157497200b8ad414e3c245540795b","start":342}],"target_id":"field.archaeology","target_kind":"node","target_sha256":"7cc1236951992a66a7a6c4779108b524d10a640fac839e73988822ba4dd94fc3"}],"field.astronomy":[{"id":"assertion.complete.field.astronomy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Astronomy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Astronomy as: The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","support":[{"end":775,"quote":"The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","source_id":"nlm-mesh.dd44e18a1fa393e60806","source_sha256":"9c1b1d697f9039e72e1ce473229040abdda68010baf9f284d10db6e2d953ed6c","start":530}],"target_id":"field.astronomy","target_kind":"node","target_sha256":"e5a28f62bb9ca35aaca4745faedf3f6ac4617435fee89d592f6f3f3e6fff1fc5"}],"field.biology":[{"id":"assertion.complete.field.biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Biology as: One of the BIOLOGICAL SCIENCE DISCIPLINES concerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","support":[{"end":768,"quote":"One of the\nBIOLOGICAL SCIENCE DISCIPLINES\nconcerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","source_id":"nlm-mesh.5934874aa38f9094fd81","source_sha256":"6750f82ab65595e9c57c5cec35c086fe2e1468bfcc80d7ab7df79a17d321338b","start":591}],"target_id":"field.biology","target_kind":"node","target_sha256":"e0aa59a0722f7eb26102e292cb698c897f7cd54958e5d74624325815c3d8d45c"}],"field.cartography":[{"id":"assertion.complete.field.cartography","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Cartography as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Cartography as: The science and art of making maps.","support":[{"end":146,"quote":"The science and art of making maps.","source_id":"usgs-thesaurus.5381093d44dfea691929","source_sha256":"b656c996a4d11f7e3301005c6db7b79ba9f4d0654ba45a685d6466ad947bc3a3","start":111}],"target_id":"field.cartography","target_kind":"node","target_sha256":"21ada9fe780a1d6c8aa8c65776b75f8bb1df598b8d2502354c620346db95ab35"}],"field.chemistry":[{"id":"assertion.complete.field.chemistry","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Chemistry in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Chemistry as: A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","support":[{"end":770,"quote":"A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","source_id":"nlm-mesh.67a1950c3c2557253dd5","source_sha256":"c1d9cafd09ebd4b93899758d9a8ac6d90d3a618189ae5fd2de25a122b1ba9ece","start":602}],"target_id":"field.chemistry","target_kind":"node","target_sha256":"bba5fc429d86559b99d27d140453e7932ee85a832dd7d79ff71f18635cd77f1c"}],"field.climatology":[{"id":"assertion.complete.field.climatology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Climatology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.","support":[{"end":200,"quote":"Scientific study of the characteristic weather conditions of geographic areas.","source_id":"usgs-thesaurus.e70c8d2c1e03ea23b093","source_sha256":"20e842d7f926a4ee2a1feec3fb4ad56768373e3b879e3e114b044e2822792a38","start":122}],"target_id":"field.climatology","target_kind":"node","target_sha256":"901b275990a79741f544339cb1f2f92d51f9592e441fa3db6aa5d6e31bc5d8cc"}],"field.cognitive-science":[{"id":"assertion.complete.field.cognitive-science","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cognitive science in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cognitive science as: The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","support":[{"end":601,"quote":"The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.3afa87c4efa263dea007","source_sha256":"83d06c651636977640e1defba29a2d0d0dd301b3d5eaf03889e4055d2b8239a5","start":354}],"target_id":"field.cognitive-science","target_kind":"node","target_sha256":"8eea67b5da8c68cf242419d8a273855dd0d82a73b41617f9732b3a9d986003e1"}],"field.computer-science":[{"id":"assertion.complete.field.computer-science","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Computer science as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Computer science as: Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","support":[{"end":233,"quote":"Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","source_id":"usgs-thesaurus.c12f0d8d6bc2875dfd18","source_sha256":"9ed5afa033c33f8000ad565538d4793493362b7ac2238aba899333966bb04ea0","start":115}],"target_id":"field.computer-science","target_kind":"node","target_sha256":"c465320deab376daa2c78e0186e2bd4a6efb8f15b6de076aa52a1f2806bff68b"}],"field.ecology":[{"id":"assertion.complete.field.ecology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ecology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ecology as: Study of the relations between living plants and animals and their environment.","support":[{"end":169,"quote":"Study of the relations between living plants and animals and their environment.","source_id":"usgs-thesaurus.54a47b5a480dee09e51c","source_sha256":"29534ed09b491b5c47a02485dd576cab608126d22e5e5393203d359ba635d877","start":90}],"target_id":"field.ecology","target_kind":"node","target_sha256":"4252367969341fb187fc5e8df26ea1b8ce18f97fa1698ee767050862f38d9c3e"}],"field.economics":[{"id":"assertion.complete.field.economics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Economics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Economics as: The science of utilization, distribution, and consumption of services and materials.","support":[{"end":540,"quote":"The science of utilization, distribution, and consumption of services and materials.","source_id":"nlm-mesh.3b75ab5915b79fbe20b6","source_sha256":"6c14983657d8114e03039e7c3816663e8019ae1489061a5d884d88d46a7ea372","start":456}],"target_id":"field.economics","target_kind":"node","target_sha256":"f21373350254a4c299207e1663d7f9cc2cc08392ba7eaad4b207c71586be98f5"}],"field.epidemiology":[{"id":"assertion.complete.field.epidemiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Epidemiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Epidemiology as: Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","support":[{"end":826,"quote":"Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","source_id":"nlm-mesh.ca259dbfe57d6af9326c","source_sha256":"6282a4f957e88aaf13b80a2608f552f606459941f1a15ded9e2871b48dd9c5be","start":566}],"target_id":"field.epidemiology","target_kind":"node","target_sha256":"14d42826a32bf9a96e4dec89772df0701884305f6fec971b68769df4b65d0863"}],"field.genetics":[{"id":"assertion.complete.field.genetics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Genetics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","support":[{"end":212,"quote":"Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","source_id":"usgs-thesaurus.55d3172c77bc4f57a64a","source_sha256":"7b13e742b744011c55c946924cf7f3792dfae9f81f567ab4ab8f202a946df5e0","start":92}],"target_id":"field.genetics","target_kind":"node","target_sha256":"1be8ac6d29dbad2119370d3e2cb5464d0588f58f6bb96916d7e88cae3c4d5d02"},{"id":"assertion.mesh-r2.context.field.genetics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Genetics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","support":[{"end":212,"quote":"Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","source_id":"usgs-thesaurus.55d3172c77bc4f57a64a","source_sha256":"7b13e742b744011c55c946924cf7f3792dfae9f81f567ab4ab8f202a946df5e0","start":92}],"target_id":"field.genetics","target_kind":"node","target_sha256":"1be8ac6d29dbad2119370d3e2cb5464d0588f58f6bb96916d7e88cae3c4d5d02"}],"field.geology":[{"id":"assertion.complete.field.geology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geology as: Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","support":[{"end":208,"quote":"Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","source_id":"usgs-thesaurus.91b39721167a39a9ed03","source_sha256":"4bec33357e1e14fccf76cf9c455c557476ec42012c683852f242c9b04e35f3de","start":91}],"target_id":"field.geology","target_kind":"node","target_sha256":"20cbbae923a8f46b98691ce1512755bad5d0949c4e77513d9b31d2fa247f9daa"}],"field.information-theory":[{"id":"assertion.complete.field.information-theory","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Information theory in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Information theory as: An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and CYBERNETICS .","support":[{"end":665,"quote":"An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and\nCYBERNETICS\n.","source_id":"nlm-mesh.29527d691d2b917a2f70","source_sha256":"1196258c27016f5457b20c68f1c04e91e37cb85b531a35523bf2d9aa31656076","start":348}],"target_id":"field.information-theory","target_kind":"node","target_sha256":"7d30ca668c1569834142793fe61f1f55f32da29511c606cf8cf5b50bd93eddcc"}],"field.logic":[{"id":"assertion.complete.field.logic","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Logic in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Logic as: The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","support":[{"end":648,"quote":"The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","source_id":"nlm-mesh.a39a42601f13cc4e3244","source_sha256":"e33c72899bfe59365d03e2c8fff33e69d9d14a2a64aa2b062d2f224f6d9abcb6","start":326}],"target_id":"field.logic","target_kind":"node","target_sha256":"7cef9bf304d88d42494fd4ebeb852073db63539934b3fa9d613bf0d38b406b09"}],"field.mesh.d000066949":[{"id":"assertion.field.mesh.d000066949","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biobehavioral Sciences as described in the captured NLM MeSH descriptor D000066949","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biobehavioral Sciences as: An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","support":[{"end":515,"quote":"An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","source_id":"nlm-mesh.d000066949","source_sha256":"1eab570eaeb66b22b0b9990a5b93469bb156a76120ad1c8114d841dfc9e1f0e3","start":374}],"target_id":"field.mesh.d000066949","target_kind":"node","target_sha256":"870afec917edbf2f555114d86cc0d1d611b24b50207b759b41e66ad3f2206255"}],"field.mesh.d000067568":[{"id":"assertion.field.mesh.d000067568","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Culturally Appropriate Technology as described in the captured NLM MeSH descriptor D000067568","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Culturally Appropriate Technology as: A SCIENCE or TECHNOLOGY that promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","support":[{"end":568,"quote":"A SCIENCE or\nTECHNOLOGY\nthat promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","source_id":"nlm-mesh.d000067568","source_sha256":"11dda86f54d7b086c4f479788cd6ef516b435be5c85ea2951e79e903aa9b7a57","start":388}],"target_id":"field.mesh.d000067568","target_kind":"node","target_sha256":"dd94429c75cc17c9cf16294001e3f8b829a757d065beedb3c4e06bc179159c31"}],"field.mesh.d000068936":[{"id":"assertion.field.mesh.d000068936","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Theranostic Nanomedicine as described in the captured NLM MeSH descriptor D000068936","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Theranostic Nanomedicine as: An integrated nano-scale approach to MEDICINE which involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","support":[{"end":592,"quote":"An integrated nano-scale approach to\nMEDICINE\nwhich involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","source_id":"nlm-mesh.d000068936","source_sha256":"38ce011762120b1a454004756d36a590c1756a85e879c07511c1d54b22bf45ff","start":446}],"target_id":"field.mesh.d000068936","target_kind":"node","target_sha256":"3e24424cb3f367aae63384173a128c4b542d0458f9e84588adb5511dc33d24ce"}],"field.mesh.d000070316":[{"id":"assertion.field.mesh.d000070316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pediatric Emergency Medicine as described in the captured NLM MeSH descriptor D000070316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pediatric Emergency Medicine as: Branch of EMERGENCY MEDICINE dealing with the emergency care of children.","support":[{"end":471,"quote":"Branch of\nEMERGENCY MEDICINE\ndealing with the emergency care of children.","source_id":"nlm-mesh.d000070316","source_sha256":"1dcf0c572a71de175b9358c8510d62e2abae7f38e9c8dd7bb71273db6dd8279e","start":398}],"target_id":"field.mesh.d000070316","target_kind":"node","target_sha256":"94a7216f7002c56fb42c293354e8088ba980075ea47efdc3a4ff15ab7498c008"}],"field.mesh.d000071077":[{"id":"assertion.field.mesh.d000071077","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Surgical Oncology as described in the captured NLM MeSH descriptor D000071077","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Surgical Oncology as: A surgical specialty concerned with management of cancer.","support":[{"end":437,"quote":"A surgical specialty concerned with management of cancer.","source_id":"nlm-mesh.d000071077","source_sha256":"f0de4ebb1b943d23fec226d7d5a516417e15b9481dc604f551a3d3e7b3eb38cd","start":380}],"target_id":"field.mesh.d000071077","target_kind":"node","target_sha256":"32785c2a4814704dca154d12a5a03a56471559b8a176fd7889c8b969cba36020"}],"field.mesh.d000073316":[{"id":"assertion.field.mesh.d000073316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Addiction Medicine as described in the captured NLM MeSH descriptor D000073316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Addiction Medicine as: A medical specialty focused on the diagnosis and treatment of ADDICTIVE BEHAVIOR disorders, including SUBSTANCE-RELATED DISORDERS and IMPULSE CONTROL DISORDERS ; and the management of co-occurring medical and psychiatric conditions","support":[{"end":589,"quote":"A medical specialty focused on the diagnosis and treatment of\nADDICTIVE BEHAVIOR\ndisorders, including\nSUBSTANCE-RELATED DISORDERS\nand\nIMPULSE CONTROL DISORDERS\n; and the management of co-occurring medical and psychiatric conditions","source_id":"nlm-mesh.d000073316","source_sha256":"28052e88b1cdb043f90b70c1986b599c3b38466fcdddb18c5a0dfc7fe9af5253","start":358}],"target_id":"field.mesh.d000073316","target_kind":"node","target_sha256":"ea2e6da7cd42fcf1642793e108b3b4872a4aed3b3ed5dfeec97de4bde2b67f1b"}],"field.mesh.d000073320":[{"id":"assertion.field.mesh.d000073320","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psycho-Oncology as described in the captured NLM MeSH descriptor D000073320","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psycho-Oncology as: A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","support":[{"end":672,"quote":"A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","source_id":"nlm-mesh.d000073320","source_sha256":"4c75fe1e28715f58b8ed3f8c6b5c043a6626d2a3fdfa756efc23bbe5b597c77a","start":392}],"target_id":"field.mesh.d000073320","target_kind":"node","target_sha256":"6c244bcc74560b06f3933057cb9e98632a68a8b8a7f16f7756fedf28a963b1a0"}],"field.mesh.d000074266":[{"id":"assertion.field.mesh.d000074266","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Materials Science as described in the captured NLM MeSH descriptor D000074266","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Materials Science as: An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","support":[{"end":673,"quote":"An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","source_id":"nlm-mesh.d000074266","source_sha256":"982e28555c7a10445af4c02e741cf1114a05244aefda6ae6bfddd305613e6d9c","start":364}],"target_id":"field.mesh.d000074266","target_kind":"node","target_sha256":"e14676ca14ce281b52268f3e742d1e788c13089d873a5297b872c8c1ed504883"}],"field.mesh.d000075863":[{"id":"assertion.field.mesh.d000075863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science in Literature as described in the captured NLM MeSH descriptor D000075863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science in Literature as: Literary works whose subject matter is science or about the profession of science and related areas.","support":[{"end":464,"quote":"Literary works whose subject matter is science or about the profession of science and related areas.","source_id":"nlm-mesh.d000075863","source_sha256":"8bd87abfa059ef53258fcce80f3173e0ec9dd505250a62c573f141cc12b53f17","start":364}],"target_id":"field.mesh.d000075863","target_kind":"node","target_sha256":"f68e39918738088c16d42fc435751142e6e00ffdb6c60a640b9bbfed700e74df"}],"field.mesh.d000076227":[{"id":"assertion.field.mesh.d000076227","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereolithography as described in the captured NLM MeSH descriptor D000076227","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).","support":[{"end":622,"quote":"A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid\nPOLYMERS\nthat harden on contact with laser light (photopolymerization).","source_id":"nlm-mesh.d000076227","source_sha256":"5c43f7c07b2e7796343994895c621335e81c0514e2c749cb29c4670adcc3d61c","start":408}],"target_id":"field.mesh.d000076227","target_kind":"node","target_sha256":"8b8a555ac0ae72f4a1cc75f1d437917f4a5e62c296be3a782075164f473414c9"}],"field.mesh.d000077283":[{"id":"assertion.field.mesh.d000077283","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Psychology as described in the captured NLM MeSH descriptor D000077283","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Psychology as: A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","support":[{"end":552,"quote":"A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","source_id":"nlm-mesh.d000077283","source_sha256":"4fadb7ce41af86375e7f64f19042f17654b473404f4fd8ee7c84647e70fcc1df","start":380}],"target_id":"field.mesh.d000077283","target_kind":"node","target_sha256":"2b9e2a6472a9673dbf33199c85858d6fb3f52d218889f984ef535915780cb352"}],"field.mesh.d000078782":[{"id":"assertion.field.mesh.d000078782","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vaccinology as described in the captured NLM MeSH descriptor D000078782","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vaccinology as: Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","support":[{"end":568,"quote":"Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","source_id":"nlm-mesh.d000078782","source_sha256":"03f5c1871883f3e88b1016f9f7678e35bbba2bcfa2b81060b6ff852c4f9ae94f","start":344}],"target_id":"field.mesh.d000078782","target_kind":"node","target_sha256":"51022c94a627aa92ea841d552d25d64356ac18681488311c090a18d376a203aa"}],"field.mesh.d000079203":[{"id":"assertion.field.mesh.d000079203","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disruptive Technology as described in the captured NLM MeSH descriptor D000079203","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disruptive Technology as: A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","support":[{"end":608,"quote":"A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","source_id":"nlm-mesh.d000079203","source_sha256":"ebfaba60532dbd4741ef73e8d0005c6df45b97e4721af073756766069c65242e","start":364}],"target_id":"field.mesh.d000079203","target_kind":"node","target_sha256":"9ae47f0e1a9e1c54265fb94083f609dc39977ee7c1f8d13afeb12a877e4fc20f"}],"field.mesh.d000079645":[{"id":"assertion.field.mesh.d000079645","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perioperative Medicine as described in the captured NLM MeSH descriptor D000079645","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perioperative Medicine as: A medical specialty concerned with the patient before and after surgical procedures.","support":[{"end":450,"quote":"A medical specialty concerned with the patient before and after surgical procedures.","source_id":"nlm-mesh.d000079645","source_sha256":"4ebeda4ea61cae5e90d8ce1065048a6bdb0735a30295811bdb20d3ff6f862235","start":366}],"target_id":"field.mesh.d000079645","target_kind":"node","target_sha256":"3969cb0e3cc2960903d994d75c7c46e020aa09f16d716ab5edf804fb8f3f73b9"}],"field.mesh.d000080029":[{"id":"assertion.field.mesh.d000080029","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Citizen Science as described in the captured NLM MeSH descriptor D000080029","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Citizen Science as: Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","support":[{"end":748,"quote":"Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","source_id":"nlm-mesh.d000080029","source_sha256":"8beb6a18b97db484e8e751096d81058a06091ef792189e96f00318e98c227abd","start":380}],"target_id":"field.mesh.d000080029","target_kind":"node","target_sha256":"b79fd7e2ced8cb599c48cd4921fe1e1f340531ad5639c70917e9f201fbc73e60"}],"field.mesh.d000080048":[{"id":"assertion.field.mesh.d000080048","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hot Melt Extrusion Technology as described in the captured NLM MeSH descriptor D000080048","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hot Melt Extrusion Technology as: Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an increase in the dissolution profile for the active pharmaceutical ingredients.","support":[{"end":856,"quote":"Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an  increase in the dissolution profile for the active pharmaceutical ingredients.","source_id":"nlm-mesh.d000080048","source_sha256":"36f5f1464a4f10343c13fac7a1ce6b93b27743373ec58d0ffcbe7c2d37d4e85c","start":412}],"target_id":"field.mesh.d000080048","target_kind":"node","target_sha256":"e812e457715e1837f5db0fdc5d33e1de90305e2d1c35520a0140c769e46109c1"}],"field.mesh.d000081230":[{"id":"assertion.field.mesh.d000081230","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Entomology as described in the captured NLM MeSH descriptor D000081230","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Entomology as: The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","support":[{"end":539,"quote":"The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","source_id":"nlm-mesh.d000081230","source_sha256":"d4f1c471889e76c1b6698bf504be89a7ea673da7c216f3f19bf0d7b0020af80f","start":388}],"target_id":"field.mesh.d000081230","target_kind":"node","target_sha256":"52db2a25f9a1ca77b157d97315a795c52bd9453f9b7aa306e2e9660967a0de02"}],"field.mesh.d000082222":[{"id":"assertion.field.mesh.d000082222","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Digital Technology as described in the captured NLM MeSH descriptor D000082222","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Digital Technology as: The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","support":[{"end":572,"quote":"The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","source_id":"nlm-mesh.d000082222","source_sha256":"7c8c014cb4c060558d79a11e00b8622ef0d641af767f7fa5827d4d8e1e5199c1","start":374}],"target_id":"field.mesh.d000082222","target_kind":"node","target_sha256":"2f975a9952e5cd170c865bbd08e6f79c19f1c36153dc2fb673c43664016992dd"}],"field.mesh.d000084542":[{"id":"assertion.field.mesh.d000084542","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eye-Tracking Technology as described in the captured NLM MeSH descriptor D000084542","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eye-Tracking Technology as: Technology used for EYE MOVEMENT MEASUREMENTS , which capture and measure a persons EYE MOVEMENT and/or EYE GAZE","support":[{"end":524,"quote":"Technology used for\nEYE MOVEMENT MEASUREMENTS\n, which capture and measure a persons\nEYE MOVEMENT\nand/or\nEYE GAZE","source_id":"nlm-mesh.d000084542","source_sha256":"5850d415a862632d0f378797189515a5f34cbf836b6d168342d41cfdca9d5242","start":412}],"target_id":"field.mesh.d000084542","target_kind":"node","target_sha256":"b8a76a7f6488dd327a6c4d29089ef1193145f967d7def7514d337bb2816b5feb"}],"field.mesh.d000085843":[{"id":"assertion.field.mesh.d000085843","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Imaging Genomics as described in the captured NLM MeSH descriptor D000085843","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Imaging Genomics as: The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","support":[{"end":622,"quote":"The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","source_id":"nlm-mesh.d000085843","source_sha256":"1ad810ef036e448eeb8e4ca16a294d111a791b693afa3c61825f6cc8f85390ff","start":406}],"target_id":"field.mesh.d000085843","target_kind":"node","target_sha256":"dedbce1fd60affc8048ac148c7939a5e4af153c41732d4c54d45adf926f343d9"}],"field.mesh.d000085844":[{"id":"assertion.field.mesh.d000085844","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiation Genomics as described in the captured NLM MeSH descriptor D000085844","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiation Genomics as: The study of the association between patient genomic data and the response to IONIZING RADIATION .","support":[{"end":504,"quote":"The study of the association between patient genomic data and the response to\nIONIZING RADIATION\n.","source_id":"nlm-mesh.d000085844","source_sha256":"d24551ed7132d96bad14b7be8220280688bc3f262aa096c54a861bf89ebdb8cc","start":406}],"target_id":"field.mesh.d000085844","target_kind":"node","target_sha256":"978be5dae91ef9a802513f4f723d4ae7a3610538e87c607714cd146806ab4046"}],"field.mesh.d000088744":[{"id":"assertion.field.mesh.d000088744","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genomic Medicine as described in the captured NLM MeSH descriptor D000088744","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genomic Medicine as: A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use. (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","support":[{"end":658,"quote":"A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use.  (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","source_id":"nlm-mesh.d000088744","source_sha256":"dbc5846d406bd4638a0fc35334502cceb0aba1c8a2733ad5ff0ac322fcbbd0ec","start":366}],"target_id":"field.mesh.d000088744","target_kind":"node","target_sha256":"c8f399dd4eac393a180b321ede9427ceb0488d104dfd85fe8349d161ce9b49f0"}],"field.mesh.d000089323":[{"id":"assertion.field.mesh.d000089323","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geroscience as described in the captured NLM MeSH descriptor D000089323","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geroscience as: The study of the BIOLOGY ; BIOCHEMISTRY ; and PHYSIOLOGY of AGING and the AGED and age-related diseases such as CARDIOVASCULAR DISEASES ; DIABETES MELLITUS ; and CANCER , as well as debilitating conditions like ARTHRITIS ; FATIGUE ; and FRAILTY .","support":[{"end":606,"quote":"The study of the\nBIOLOGY\n;\nBIOCHEMISTRY\n; and\nPHYSIOLOGY\nof\nAGING\nand the\nAGED\nand age-related diseases such as\nCARDIOVASCULAR DISEASES\n;\nDIABETES MELLITUS\n; and\nCANCER\n, as well as debilitating conditions like\nARTHRITIS\n;\nFATIGUE\n; and\nFRAILTY\n.","source_id":"nlm-mesh.d000089323","source_sha256":"6246ec1ab04f2470d89d0fe741e5d2b02cc439d2972a47f9c5ea9f2a205f4966","start":360}],"target_id":"field.mesh.d000089323","target_kind":"node","target_sha256":"609f3d6110d667aafef5a63cf8f58af3151831ac90d42befc4256bee2b1aedf5"}],"field.mesh.d000089862":[{"id":"assertion.field.mesh.d000089862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Haptic Technology as described in the captured NLM MeSH descriptor D000089862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Haptic Technology as: The study of the use of touch and KINESTHESIS in order to produce HAPTIC COMPUTER INTERFACES that will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","support":[{"end":634,"quote":"The study of the use of touch and\nKINESTHESIS\nin order to produce\nHAPTIC COMPUTER INTERFACES\nthat will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","source_id":"nlm-mesh.d000089862","source_sha256":"37c544ab7251b363d426d2dc2598b903013217bbf9fef0b7dcf0bbb6c2aff319","start":424}],"target_id":"field.mesh.d000089862","target_kind":"node","target_sha256":"8ae2eb0d7e89fe155a6c6be3ee3b147c5c5ccaedd83b894fffb6ffe368a4b550"}],"field.mesh.d000095024":[{"id":"assertion.field.mesh.d000095024","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Microbiology as described in the captured NLM MeSH descriptor D000095024","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Microbiology as: The scientific discipline dedicated to analyzing evidence from BIOTERRORISM , biocrime, HOAX , or inadvertent microorganism/toxin release for attribution purposes.","support":[{"end":551,"quote":"The scientific discipline dedicated to analyzing evidence from\nBIOTERRORISM\n, biocrime,\nHOAX\n, or inadvertent microorganism/toxin release for attribution purposes.","source_id":"nlm-mesh.d000095024","source_sha256":"d914ee6a5c31352044b9a36611d1a474e91da59c68648f3318f83ee392ab3b78","start":388}],"target_id":"field.mesh.d000095024","target_kind":"node","target_sha256":"b76e335992e349d1734d691fd6a9db5acfa781f0d518c8140c4cb300e51c6b47"}],"field.mesh.d000095763":[{"id":"assertion.field.mesh.d000095763","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immunoinformatics as described in the captured NLM MeSH descriptor D000095763","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immunoinformatics as: The interface between INFORMATICS and IMMUNOLOGY . Otherwise known as computational immunology, it is the use of computational methods and resources for studying IMMUNE SYSTEM PHENOMENA .","support":[{"end":583,"quote":"The interface between\nINFORMATICS\nand\nIMMUNOLOGY\n. Otherwise known as computational immunology, it is the use of computational methods and resources for studying\nIMMUNE SYSTEM PHENOMENA\n.","source_id":"nlm-mesh.d000095763","source_sha256":"5f5b958093a17785be2ca6060df9765efeb751883308f21f7e5fa674f909fb5e","start":396}],"target_id":"field.mesh.d000095763","target_kind":"node","target_sha256":"1f7df36a24ceee786d5228e341060a14e1fcb3943b2fda01aac318a37fa57fa1"}],"field.mesh.d000096725":[{"id":"assertion.field.mesh.d000096725","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Acute Care Surgery as described in the captured NLM MeSH descriptor D000096725","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Acute Care Surgery as: Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","support":[{"end":633,"quote":"Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","source_id":"nlm-mesh.d000096725","source_sha256":"fa9d25bb2f71f5de6300f0e1543b547bf7fa3630ff55d452a6ea9c4cecc46e76","start":362}],"target_id":"field.mesh.d000096725","target_kind":"node","target_sha256":"c46523bc75f9734e2a4a737ccb359d1e9de88c9f6ea0404812160745903953ac"}],"field.mesh.d000097562":[{"id":"assertion.field.mesh.d000097562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardio-Oncology as described in the captured NLM MeSH descriptor D000097562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardio-Oncology as: The study, diagnosis, and treatment of CARDIOTOXICITY in patients who undergo treatment for cancer.","support":[{"end":479,"quote":"The study, diagnosis, and treatment of\nCARDIOTOXICITY\nin patients who undergo treatment for cancer.","source_id":"nlm-mesh.d000097562","source_sha256":"c370b29d1f595032d65c2333c0af5c229962b3f8452ac753a295d67c4a3e3213","start":380}],"target_id":"field.mesh.d000097562","target_kind":"node","target_sha256":"5030d607a8ac9032e3c37ffd66cd4baa0c8005a26d7f389067ca15b118463e63"}],"field.mesh.d000099051":[{"id":"assertion.field.mesh.d000099051","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Diving and Hyperbaric Medicine as described in the captured NLM MeSH descriptor D000099051","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Diving and Hyperbaric Medicine as: The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","support":[{"end":566,"quote":"The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","source_id":"nlm-mesh.d000099051","source_sha256":"f4d6d9c13c9be72dd8ccb5c101882e8d471a437c249dba619d6b467956728275","start":386}],"target_id":"field.mesh.d000099051","target_kind":"node","target_sha256":"48e58920e478b97e5c2a51aaf252ba94d91d6787894cbdf7df008b14c24f6834"}],"field.mesh.d000099079":[{"id":"assertion.field.mesh.d000099079","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Functional Medicine as described in the captured NLM MeSH descriptor D000099079","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Functional Medicine as: The clinical application of SYSTEMS BIOLOGY , that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","support":[{"end":577,"quote":"The clinical application of\nSYSTEMS BIOLOGY\n, that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","source_id":"nlm-mesh.d000099079","source_sha256":"424c81489ee74183c5c5d809d1f63f9c230bb5cd1434d36177cbdd3fe95c5994","start":360}],"target_id":"field.mesh.d000099079","target_kind":"node","target_sha256":"64f5d4be317fa3a0fb0c2f9111a062b0a9dd3690cae14ccde31ae33f7f6996d2"}],"field.mesh.d000295":[{"id":"assertion.field.mesh.d000295","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Medicine as described in the captured NLM MeSH descriptor D000295","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Medicine as: A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of ADOLESCENCE .","support":[{"end":567,"quote":"A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of\nADOLESCENCE\n.","source_id":"nlm-mesh.d000295","source_sha256":"38d6accfd2e0f3d03a6ffd51a6985b7fb73f687dae862435a6c9c575ed3acc9c","start":448}],"target_id":"field.mesh.d000295","target_kind":"node","target_sha256":"b5fef823aecf578b495b0370d8e062897e3538e7b269cc9d49ecf9660658ceae"}],"field.mesh.d000296":[{"id":"assertion.field.mesh.d000296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Psychiatry as described in the captured NLM MeSH descriptor D000296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","support":[{"end":617,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","source_id":"nlm-mesh.d000296","source_sha256":"d79a0f30788dcb46556b2db29fca598b6d5dd0dcb665586eb468b2f7ca336bcc","start":485}],"target_id":"field.mesh.d000296","target_kind":"node","target_sha256":"144659d1931e383b043a0600c1f293150864bd473189cdd07fa9c32da8b697e5"}],"field.mesh.d000337":[{"id":"assertion.field.mesh.d000337","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Aerospace Medicine as described in the captured NLM MeSH descriptor D000337","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Aerospace Medicine as: That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from NASA Thesaurus)","support":[{"end":815,"quote":"That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from\nNASA\nThesaurus)","source_id":"nlm-mesh.d000337","source_sha256":"a4029e3a3c2bbf87116a171aa3b9ec1db34adb9576b69e13d223b74315ad5b3a","start":561}],"target_id":"field.mesh.d000337","target_kind":"node","target_sha256":"d6f91a9c80835fabdbc2899fa3aa9fd012d409c87c52166baa791caeee6a933f"}],"field.mesh.d000486":[{"id":"assertion.field.mesh.d000486","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Allergy and Immunology as described in the captured NLM MeSH descriptor D000486","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Allergy and Immunology as: A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","support":[{"end":844,"quote":"A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","source_id":"nlm-mesh.d000486","source_sha256":"aa912c6a30d3d2b6acbb857dc0fd1e6d1bc1c978196eb6dfe19b175e4706e9e0","start":692}],"target_id":"field.mesh.d000486","target_kind":"node","target_sha256":"acb9afd94114117f3fd0407c402eb5f1cecdbaa3f0288cf24b9eb23dcfd00b89"}],"field.mesh.d000776":[{"id":"assertion.field.mesh.d000776","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anesthesiology as described in the captured NLM MeSH descriptor D000776","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anesthesiology as: A specialty concerned with the study of anesthetics and anesthesia.","support":[{"end":411,"quote":"A specialty concerned with the study of anesthetics and anesthesia.","source_id":"nlm-mesh.d000776","source_sha256":"84a265575532447db0700e08e56509b298ded46a4acb70b375cd131581b14a8a","start":344}],"target_id":"field.mesh.d000776","target_kind":"node","target_sha256":"5c70a8ed6dd7123ad3a0e2ad327b8b44154d4095ece9ed627a76f1aa1042e5b1"}],"field.mesh.d001154":[{"id":"assertion.field.mesh.d001154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Art as described in the captured NLM MeSH descriptor D001154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Art as: Processes and results of aesthetic expression.","support":[{"end":464,"quote":"Processes and results of aesthetic expression.","source_id":"nlm-mesh.d001154","source_sha256":"b13b244818c7839e3a7d4effa3e6e5423e3d6aa70728e4a57708fee804a0a967","start":418}],"target_id":"field.mesh.d001154","target_kind":"node","target_sha256":"1c65d6da7f470ca5456a9aa6f065ef0e62160f0cde73cd74291cf017fdc5580b"}],"field.mesh.d001255":[{"id":"assertion.field.mesh.d001255","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Astrology as described in the captured NLM MeSH descriptor D001255","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Astrology as: System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","support":[{"end":485,"quote":"System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","source_id":"nlm-mesh.d001255","source_sha256":"8a05723e0cb6520fd84a7ea93001e71aa5a9552c5bf0566afa871fc15737c22a","start":334}],"target_id":"field.mesh.d001255","target_kind":"node","target_sha256":"d91a6cdbbf608e457e2a4972c6637f6f4d241a0da2c4817290b2d978ccfae91d"}],"field.mesh.d001524":[{"id":"assertion.field.mesh.d001524","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Medicine as described in the captured NLM MeSH descriptor D001524","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Medicine as: The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","support":[{"end":651,"quote":"The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","source_id":"nlm-mesh.d001524","source_sha256":"27a7149b0a07c19a022dbee13c9cca0bd3868307853567c411d4ec680fbac019","start":366}],"target_id":"field.mesh.d001524","target_kind":"node","target_sha256":"b2c9b2b4e32cabeacf55786f30a4a3a10c71863fdf9596cff3120da323995a3f"}],"field.mesh.d001675":[{"id":"assertion.field.mesh.d001675","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioethics as described in the captured NLM MeSH descriptor D001675","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioethics as: A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","support":[{"end":605,"quote":"A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","source_id":"nlm-mesh.d001675","source_sha256":"f5e6108820e04e57168afa8854fe2c3bb573b62a0c00bbad24aa3de4f92732b8","start":468}],"target_id":"field.mesh.d001675","target_kind":"node","target_sha256":"24a6f408d783ae53f7e8fd5adcb752c563b492277c3ab1196e978b1c66e3b53c"}],"field.mesh.d001689":[{"id":"assertion.field.mesh.d001689","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biological Psychiatry as described in the captured NLM MeSH descriptor D001689","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biological Psychiatry as: An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","support":[{"end":596,"quote":"An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","source_id":"nlm-mesh.d001689","source_sha256":"af2365aa981f05d8a76fbc6215f46ef01d6c5d87ef65ad0f90dd3d99870f2c4c","start":378}],"target_id":"field.mesh.d001689","target_kind":"node","target_sha256":"2d2665062ac98d3d9630afb33a3a512ca99a824272642ea723a28e5de162637d"}],"field.mesh.d002665":[{"id":"assertion.field.mesh.d002665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Psychiatry as described in the captured NLM MeSH descriptor D002665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","support":[{"end":601,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","source_id":"nlm-mesh.d002665","source_sha256":"96cdbc0bce603a356a8705f99a547aa05ebe30f41c643fc0567fe1cff77f6d91","start":484}],"target_id":"field.mesh.d002665","target_kind":"node","target_sha256":"1f96d87bc97a7257c5f2bcae1ef1e7bbbe34491a28ec8f7fa26a2d0bf14f3644"}],"field.mesh.d002834":[{"id":"assertion.field.mesh.d002834","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Christian Science as described in the captured NLM MeSH descriptor D002834","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Christian Science as: A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","support":[{"end":577,"quote":"A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","source_id":"nlm-mesh.d002834","source_sha256":"7214bf49dc5e6d3b01c7ab923e070996152c554323159567dd3332ea6da6d6bd","start":406}],"target_id":"field.mesh.d002834","target_kind":"node","target_sha256":"b6a390df514868cd291ae1da3c739abb961875d71172fd1d27951f8b1ecc21a0"}],"field.mesh.d003107":[{"id":"assertion.field.mesh.d003107","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Colorectal Surgery as described in the captured NLM MeSH descriptor D003107","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Colorectal Surgery as: A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the COLON ; RECTUM ; and ANAL CANAL .","support":[{"end":571,"quote":"A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the\nCOLON\n;\nRECTUM\n; and\nANAL CANAL\n.","source_id":"nlm-mesh.d003107","source_sha256":"e5ac7ba23452cff30073759dbca3b709f8a83e04e97e0d7b5f3ee02174ddebfd","start":436}],"target_id":"field.mesh.d003107","target_kind":"node","target_sha256":"7a7932a451c8f862f5ae6a09d1a333795f04ec3a677e1799f306b36ec542ee12"}],"field.mesh.d003154":[{"id":"assertion.field.mesh.d003154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community Medicine as described in the captured NLM MeSH descriptor D003154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community Medicine as: A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","support":[{"end":587,"quote":"A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","source_id":"nlm-mesh.d003154","source_sha256":"9e8bf5ad410e3d380e241e888a77cac4deb1b8fc9d9c1fef9585ff4e13600fd8","start":352}],"target_id":"field.mesh.d003154","target_kind":"node","target_sha256":"5262dfb929fc6b74f86f23f665a05b64de0d7ddf096a22016e97f1b8c0472df3"}],"field.mesh.d003158":[{"id":"assertion.field.mesh.d003158","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community Psychiatry as described in the captured NLM MeSH descriptor D003158","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community Psychiatry as: Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","support":[{"end":688,"quote":"Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","source_id":"nlm-mesh.d003158","source_sha256":"6c0142826debca92e3a37f9b826338df7a7729aa88e67d3958937aa88687c3a7","start":376}],"target_id":"field.mesh.d003158","target_kind":"node","target_sha256":"01daf90ee8848d8601d2aaf80ed0a3541b3bb1ab6306d6cde51619b8869b3523"}],"field.mesh.d003416":[{"id":"assertion.field.mesh.d003416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Criminal Law as described in the captured NLM MeSH descriptor D003416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Criminal Law as: A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","support":[{"end":594,"quote":"A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","source_id":"nlm-mesh.d003416","source_sha256":"e69f661d4a3e70542f71dca1a8f9cbc49cc6246389ae9bbd55bde11af8300582","start":396}],"target_id":"field.mesh.d003416","target_kind":"node","target_sha256":"7566a6bd7fa92ceb32f8a97fd2e24ea489cbbd9e7ae8802d328a6c2d455adec0"}],"field.mesh.d004635":[{"id":"assertion.field.mesh.d004635","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emergency Medicine as described in the captured NLM MeSH descriptor D004635","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emergency Medicine as: The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","support":[{"end":715,"quote":"The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","source_id":"nlm-mesh.d004635","source_sha256":"86f164bc3c30d2775c9ce82dfe98b7e5e81485f607be009c8cfbe19bb0996482","start":419}],"target_id":"field.mesh.d004635","target_kind":"node","target_sha256":"93f8608fddc3d6260c2db1f2346848083e9e6f61c4d9be8859c1e6622f02e056"}],"field.mesh.d004954":[{"id":"assertion.field.mesh.d004954","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Esthetics as described in the captured NLM MeSH descriptor D004954","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Esthetics as: The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","support":[{"end":511,"quote":"The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","source_id":"nlm-mesh.d004954","source_sha256":"a08f6bc1dd69019ccb9432f340835c52e9019d3428b7fd6d739f1256a27378d9","start":350}],"target_id":"field.mesh.d004954","target_kind":"node","target_sha256":"40eb657a6bf87e162ac732a72034d3b07ea2cdea7ead86ac7c0bc5dffddec551"}],"field.mesh.d004989":[{"id":"assertion.field.mesh.d004989","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics as described in the captured NLM MeSH descriptor D004989","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics as: The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","support":[{"end":488,"quote":"The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","source_id":"nlm-mesh.d004989","source_sha256":"9ccb5e25621ebe1c8980a355a28d8e5e3c88eed12a29fd28d0c306cb140341f0","start":340}],"target_id":"field.mesh.d004989","target_kind":"node","target_sha256":"d40dd91f154d0dcdd66dc6484b6a2ebd1fd064c4ad3702d45c388dc4dd30add5"}],"field.mesh.d004990":[{"id":"assertion.field.mesh.d004990","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Dental as described in the captured NLM MeSH descriptor D004990","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Dental as: The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","support":[{"end":713,"quote":"The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","source_id":"nlm-mesh.d004990","source_sha256":"1fc002124e8d7fa8755c747f92936480afd8b5bb07d1a939fb68b3a6691c89f6","start":444}],"target_id":"field.mesh.d004990","target_kind":"node","target_sha256":"84a14e65a1cc446904daa9cac6391891a17e9e5fd404abcebcbb83738da1c200"}],"field.mesh.d004991":[{"id":"assertion.field.mesh.d004991","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Institutional as described in the captured NLM MeSH descriptor D004991","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Institutional as: The moral and ethical obligations or responsibilities of institutions.","support":[{"end":525,"quote":"The moral and ethical obligations or responsibilities of institutions.","source_id":"nlm-mesh.d004991","source_sha256":"cf03c73b07883928ef6ae477811fcff869c9c764ffc073689c254fdd9194cb77","start":455}],"target_id":"field.mesh.d004991","target_kind":"node","target_sha256":"f27e6e10a9949d402d36a1cec3fa5a05416e0c89d16c3fb2d7c2ac8c4d2c25a9"}],"field.mesh.d004993":[{"id":"assertion.field.mesh.d004993","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Nursing as described in the captured NLM MeSH descriptor D004993","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Nursing as: The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","support":[{"end":633,"quote":"The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","source_id":"nlm-mesh.d004993","source_sha256":"856e51f3f187db9c79be5f0465b4b56f7c9b24bbe9975fe1eca363029ff4fd20","start":398}],"target_id":"field.mesh.d004993","target_kind":"node","target_sha256":"d989aef6670824d37ff9616d5680298d37dcd3e1263d9f8cdf97ed38e7968bf9"}],"field.mesh.d004995":[{"id":"assertion.field.mesh.d004995","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Professional as described in the captured NLM MeSH descriptor D004995","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Professional as: The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","support":[{"end":688,"quote":"The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","source_id":"nlm-mesh.d004995","source_sha256":"ba05820d3c293a7c97178368f71dc6e58403100b110b3b4149889d44de080166","start":413}],"target_id":"field.mesh.d004995","target_kind":"node","target_sha256":"484c2bc1584986abdb4e1bc7024afb7cfde72df6406f5b92567f585d6b611fed"}],"field.mesh.d005053":[{"id":"assertion.field.mesh.d005053","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eugenics as described in the captured NLM MeSH descriptor D005053","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eugenics as: The attempt to improve the PHENOTYPES of future generations of the human population by fostering the reproduction of those with favorable phenotypes and GENOTYPES and hampering or preventing BREEDING by those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":686,"quote":"The attempt to improve the\nPHENOTYPES\nof future generations of the human population by fostering the reproduction of those with favorable phenotypes and\nGENOTYPES\nand hampering or preventing\nBREEDING\nby those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.d005053","source_sha256":"230855404e747ac91d1496b36d8d1ff45748274e57038431e960e395cb96f01c","start":332}],"target_id":"field.mesh.d005053","target_kind":"node","target_sha256":"637fe5255caa5916fb7d3a91bd7e72645c19163b03367b79d27d970e48644468"}],"field.mesh.d005191":[{"id":"assertion.field.mesh.d005191","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Characteristics as described in the captured NLM MeSH descriptor D005191","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Characteristics as: Size and composition of the family.","support":[{"end":475,"quote":"Size and composition of the family.","source_id":"nlm-mesh.d005191","source_sha256":"5252a3698a500a6038b522652f44f22597fde8daf1965ee322300a4ed7687035","start":440}],"target_id":"field.mesh.d005191","target_kind":"node","target_sha256":"c4a00a1ebbb512284fd57dc1478959b8deff69d291b40043962468f89224aaf0"}],"field.mesh.d005194":[{"id":"assertion.field.mesh.d005194","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Practice as described in the captured NLM MeSH descriptor D005194","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Practice as: A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","support":[{"end":470,"quote":"A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","source_id":"nlm-mesh.d005194","source_sha256":"daf11d026840e32f67ef85f1d8d243bf32361693845de6314d1fa32596e903d4","start":350}],"target_id":"field.mesh.d005194","target_kind":"node","target_sha256":"e9a14d7f2ad30de2437cd348d0aed82d8f578927f93168612287bded2b738c04"}],"field.mesh.d005554":[{"id":"assertion.field.mesh.d005554","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Medicine as described in the captured NLM MeSH descriptor D005554","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Medicine as: The application of medical knowledge to questions of law.","support":[{"end":738,"quote":"The application of medical knowledge to questions of law.","source_id":"nlm-mesh.d005554","source_sha256":"e3bf2a8c7c82a21b22fa47a911ea836112c63ed72c8258f336eb50f9ee63728e","start":681}],"target_id":"field.mesh.d005554","target_kind":"node","target_sha256":"ce7f4ef77ffc01f955f9d6241e516e5fb8c13135c4969bb0859ba63db81ffac7"}],"field.mesh.d005555":[{"id":"assertion.field.mesh.d005555","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Psychiatry as described in the captured NLM MeSH descriptor D005555","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Psychiatry as: Psychiatry in its legal aspects. This includes criminology, penology, COMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS , the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","support":[{"end":674,"quote":"Psychiatry in its legal aspects. This includes criminology, penology,\nCOMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS\n, the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","source_id":"nlm-mesh.d005555","source_sha256":"d1d593bbce684ea8c6a731495b4810886e6f4f701774806af32c4421c7cf8e82","start":430}],"target_id":"field.mesh.d005555","target_kind":"node","target_sha256":"a4cdc5b6c3612ec9c423a26b45fc25cc826437347414f542d8fdc5c8858c3b18"}],"field.mesh.d005826":[{"id":"assertion.field.mesh.d005826","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetics, Medical as described in the captured NLM MeSH descriptor D005826","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetics, Medical as: A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","support":[{"end":712,"quote":"A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","source_id":"nlm-mesh.d005826","source_sha256":"9b7134eb1a95f7c770be84c729801dc78401d1612bc4ebcae8639580c5c0c54e","start":502}],"target_id":"field.mesh.d005826","target_kind":"node","target_sha256":"6d81f231931572fe1dfae9cc4e6bfc0ed60bbc1b22f57019d800f118fd66b669"}],"field.mesh.d005852":[{"id":"assertion.field.mesh.d005852","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatric Psychiatry as described in the captured NLM MeSH descriptor D005852","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatric Psychiatry as: A subspecialty of psychiatry concerned with the mental health of the aged.","support":[{"end":550,"quote":"A subspecialty of psychiatry concerned with the mental health of the aged.","source_id":"nlm-mesh.d005852","source_sha256":"687632f1e37cadc7c3044e6708ebd04695e71f7b65d9dedee4dc69538cfb849c","start":476}],"target_id":"field.mesh.d005852","target_kind":"node","target_sha256":"a809585f96d909bdbe33f88a2f550f3fe7ef9dc900ef3535b537c4eae975efe5"}],"field.mesh.d005853":[{"id":"assertion.field.mesh.d005853","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatrics as described in the captured NLM MeSH descriptor D005853","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatrics as: The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","support":[{"end":566,"quote":"The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","source_id":"nlm-mesh.d005853","source_sha256":"f5b09e5715c6743e7ca82a18742006a11b93d03c3c842ee750baea148e730faf","start":413}],"target_id":"field.mesh.d005853","target_kind":"node","target_sha256":"06c1405d5057eee5c8e5c7f21a166c30599cc154ffe2cf359af971f056c03dbd"}],"field.mesh.d006663":[{"id":"assertion.field.mesh.d006663","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Historiography as described in the captured NLM MeSH descriptor D006663","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Historiography as: The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","support":[{"end":478,"quote":"The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","source_id":"nlm-mesh.d006663","source_sha256":"5cb377209ea12e49e92621abc3525c195af65be37808b1900cb028aad65c7956","start":344}],"target_id":"field.mesh.d006663","target_kind":"node","target_sha256":"91e828607a601824a4029222ff15c65ba6e58d8ca8651ae2185f20d4cd9f62ad"}],"field.mesh.d006664":[{"id":"assertion.field.mesh.d006664","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History as described in the captured NLM MeSH descriptor D006664","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History as: Record and study of past events.","support":[{"end":460,"quote":"Record and study of past events.","source_id":"nlm-mesh.d006664","source_sha256":"26f4fff4783c19df709a539cb8a7cf62efdfa8de13499c31446ca612ba2e046a","start":428}],"target_id":"field.mesh.d006664","target_kind":"node","target_sha256":"a4d5248d8d59c758495c43b43ec1e72f61963b52656d729f2bfa5082b78c96aa"}],"field.mesh.d006666":[{"id":"assertion.field.mesh.d006666","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Medicine as described in the captured NLM MeSH descriptor D006666","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Medicine as: Study of past events and development in the field of Medicine.","support":[{"end":600,"quote":"Study of past events and development in the field of Medicine.","source_id":"nlm-mesh.d006666","source_sha256":"570988beb1917485117417573b7db3c2353f99cc486b3462127bf7a44eb56b37","start":538}],"target_id":"field.mesh.d006666","target_kind":"node","target_sha256":"0bfeec700b0f2eb842e8baba4697bfadb3c6f5c6024d7143ab1b7caa48659404"}],"field.mesh.d006804":[{"id":"assertion.field.mesh.d006804","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ergonomics as described in the captured NLM MeSH descriptor D006804","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ergonomics as: The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","support":[{"end":621,"quote":"The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","source_id":"nlm-mesh.d006804","source_sha256":"f661a116708147aa3ea37ee69676f8b61ba3820f4f0586b05b7288a106015e33","start":427}],"target_id":"field.mesh.d006804","target_kind":"node","target_sha256":"39dcc5776e961755fed1f1e625bdfb1f93ddd89c5bb3f5a9a0758c71a4592dee"}],"field.mesh.d007120":[{"id":"assertion.field.mesh.d007120","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immunochemistry as described in the captured NLM MeSH descriptor D007120","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immunochemistry as: Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","support":[{"end":697,"quote":"Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","source_id":"nlm-mesh.d007120","source_sha256":"73806bc3b805a64bb75f52c1f5cd4e4e6a8a73b61ae9cf786ab8ec31a3022e95","start":485}],"target_id":"field.mesh.d007120","target_kind":"node","target_sha256":"ec1da04875a4758915082b47c5c4af3e8c87306d07a58b404ede1d0f56fc5475"}],"field.mesh.d007218":[{"id":"assertion.field.mesh.d007218","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Industrial Microbiology as described in the captured NLM MeSH descriptor D007218","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Industrial Microbiology as: The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","support":[{"end":578,"quote":"The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","source_id":"nlm-mesh.d007218","source_sha256":"d2c0e796fc10f710581139b0654b642cd6bc7bfd52aa1f45dd4c283dd067b253","start":386}],"target_id":"field.mesh.d007218","target_kind":"node","target_sha256":"c4204c9806463b423f3a0811b3f5ec6a903abc4ee19d0bb2d06fee860ea0bc80"}],"field.mesh.d007388":[{"id":"assertion.field.mesh.d007388","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Internal Medicine as described in the captured NLM MeSH descriptor D007388","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Internal Medicine as: A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","support":[{"end":486,"quote":"A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","source_id":"nlm-mesh.d007388","source_sha256":"0bee9d581efb0b42c53db51ae0ada5273360c0219f2abd5cbe354675016e106b","start":371}],"target_id":"field.mesh.d007388","target_kind":"node","target_sha256":"ee7e559e66f1552967eb23b6dff8d34118423e076e3e58735cfc7e85208b7b2d"}],"field.mesh.d008091":[{"id":"assertion.field.mesh.d008091","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature as described in the captured NLM MeSH descriptor D008091","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature as: Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","support":[{"end":596,"quote":"Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","source_id":"nlm-mesh.d008091","source_sha256":"328c7114462c3a55144fef357738b2c1a10e5cd66b9c298bbff0764f387f267f","start":396}],"target_id":"field.mesh.d008091","target_kind":"node","target_sha256":"848a773b9dd5d95f59d4e461e21d8d663ced8dc2fca3d4291ca7434b67216788"}],"field.mesh.d008092":[{"id":"assertion.field.mesh.d008092","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature, Medieval as described in the captured NLM MeSH descriptor D008092","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature, Medieval as: Writings originating in the 5th century A.D. through the 15h century.","support":[{"end":492,"quote":"Writings originating in the 5th century A.D. through the 15h century.","source_id":"nlm-mesh.d008092","source_sha256":"41b48524159490df781eaa2397169415afee46f63db67bc090de13987bb864bf","start":423}],"target_id":"field.mesh.d008092","target_kind":"node","target_sha256":"bde8ea59a20ae3c776f26ef0e9437c93787efa1fa8901807bf41326204ec7a7a"}],"field.mesh.d008093":[{"id":"assertion.field.mesh.d008093","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature, Modern as described in the captured NLM MeSH descriptor D008093","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature, Modern as: Writings originating from the 15th century A.D. to the present","support":[{"end":513,"quote":"Writings originating from the 15th century A.D. to the present","source_id":"nlm-mesh.d008093","source_sha256":"5b079d81f4c82b48025e2b4b8dda0f014880b63e1d7d80065ec6a3a2e756e6e1","start":451}],"target_id":"field.mesh.d008093","target_kind":"node","target_sha256":"9c37d4aad70ed7e4e5cd9d1157f6c0aa8e9d4fd542ff5ef6e87d58d1d64e54ab"}],"field.mesh.d008433":[{"id":"assertion.field.mesh.d008433","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mathematics as described in the captured NLM MeSH descriptor D008433","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mathematics as: The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":650,"quote":"The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.d008433","source_sha256":"483a0ff03e582d89c450eaf31269edb1510f643d4fb3cd6e88c34faadfe9c422","start":523}],"target_id":"field.mesh.d008433","target_kind":"node","target_sha256":"89fddea04c4b616e512c2b3a8f81bfa55f25cfe015b766ea430e8eb918a4860c"}],"field.mesh.d008495":[{"id":"assertion.field.mesh.d008495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Oncology as described in the captured NLM MeSH descriptor D008495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Oncology as: A subspecialty of internal medicine concerned with the study of neoplasms.","support":[{"end":501,"quote":"A subspecialty of internal medicine concerned with the study of neoplasms.","source_id":"nlm-mesh.d008495","source_sha256":"ec1b4579f838aaf4631107a17760818bad5b6363489115bdee06748bd060df93","start":427}],"target_id":"field.mesh.d008495","target_kind":"node","target_sha256":"977979d111b500793d148291f08ad478abb03ea4b5804a1bdaea74ad43e7ac61"}],"field.mesh.d008511":[{"id":"assertion.field.mesh.d008511","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine as described in the captured NLM MeSH descriptor D008511","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine as: The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","support":[{"end":935,"quote":"The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","source_id":"nlm-mesh.d008511","source_sha256":"a764f83e8800f5fade6406d58ffdc005120d99f1dbbc5e855cfc09550b8714f1","start":795}],"target_id":"field.mesh.d008511","target_kind":"node","target_sha256":"c0b02a9fc660d6b5f254313e16dcf59867e30bfdaafe6203bb7a3b858df5836d"}],"field.mesh.d008513":[{"id":"assertion.field.mesh.d008513","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine in Literature as described in the captured NLM MeSH descriptor D008513","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine in Literature as: Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","support":[{"end":624,"quote":"Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","source_id":"nlm-mesh.d008513","source_sha256":"504b6a97f8cd244514e11b649800eb18623bfbc960381aa1cb41bcd7a7590dfb","start":506}],"target_id":"field.mesh.d008513","target_kind":"node","target_sha256":"a396a7a16c35ec4daa1653654eb7b191658a0ced189244fe4175cd64f92ff776"}],"field.mesh.d008678":[{"id":"assertion.field.mesh.d008678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metaphysics as described in the captured NLM MeSH descriptor D008678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":579,"quote":"The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d008678","source_sha256":"ca4c9beb6311ce2fcbcb9e412dffed2e1e5a53ee24a9c103b651a41ee811ef6b","start":361}],"target_id":"field.mesh.d008678","target_kind":"node","target_sha256":"88920d49f9b5e59132f2dbbd520d9aab5931330ab18b01787be1ce3033686594"}],"field.mesh.d008887":[{"id":"assertion.field.mesh.d008887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Military Medicine as described in the captured NLM MeSH descriptor D008887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Military Medicine as: The practice of medicine as applied to special circumstances associated with military operations.","support":[{"end":616,"quote":"The practice of medicine as applied to special circumstances associated with military operations.","source_id":"nlm-mesh.d008887","source_sha256":"0e33ce869323e73fc65b2588439b68a5e40272d54e464b1d95b2405ad94aa503","start":519}],"target_id":"field.mesh.d008887","target_kind":"node","target_sha256":"3663736cf015d70df59f1a6b5176e62d1215ea159b39033e4330010f3bd84b8f"}],"field.mesh.d008890":[{"id":"assertion.field.mesh.d008890","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Military Psychiatry as described in the captured NLM MeSH descriptor D008890","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Military Psychiatry as: Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","support":[{"end":610,"quote":"Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","source_id":"nlm-mesh.d008890","source_sha256":"ebc3919b182666a3fcfdb66fe386998c5cf59bc88d4ed35ed0e4fc110eca2ca0","start":444}],"target_id":"field.mesh.d008890","target_kind":"node","target_sha256":"5ba2ef5dcc97ef878d210933b9d6343ca5c403a8977f04c16e6dedbceca170cf"}],"field.mesh.d009146":[{"id":"assertion.field.mesh.d009146","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Music as described in the captured NLM MeSH descriptor D009146","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Music as: Sound that expresses emotion through rhythm, melody, and harmony.","support":[{"end":430,"quote":"Sound that expresses emotion through rhythm, melody, and harmony.","source_id":"nlm-mesh.d009146","source_sha256":"184effda1ad0a389039fea99ffd297551abe2ff0b245e98a749548bd161fd695","start":365}],"target_id":"field.mesh.d009146","target_kind":"node","target_sha256":"0ee28e2f221239125902361d6b6b8e9b6cf5c087b65bdf162fdfbb08dd5e570d"}],"field.mesh.d009229":[{"id":"assertion.field.mesh.d009229","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mythology as described in the captured NLM MeSH descriptor D009229","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mythology as: A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","support":[{"end":703,"quote":"A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","source_id":"nlm-mesh.d009229","source_sha256":"ea9a5687024b780712cd2169642a5bc73421c4667f45627846813274406bc52f","start":416}],"target_id":"field.mesh.d009229","target_kind":"node","target_sha256":"2d8a68f997a953aea8f804fa389e6ddd551f52a536f66d2ac67daa38f7977c13"}],"field.mesh.d009326":[{"id":"assertion.field.mesh.d009326","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Naval Medicine as described in the captured NLM MeSH descriptor D009326","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Naval Medicine as: The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","support":[{"end":610,"quote":"The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","source_id":"nlm-mesh.d009326","source_sha256":"ec46b7ad1cbe35c4b43147595e5c14264ccdfb015fb8431debec11ef6ebd46fb","start":484}],"target_id":"field.mesh.d009326","target_kind":"node","target_sha256":"b157ee9513a82042046d8af4c789495f94ca33d4fbe32b5d0117d27cb4266375"}],"field.mesh.d009493":[{"id":"assertion.field.mesh.d009493","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurosurgery as described in the captured NLM MeSH descriptor D009493","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurosurgery as: A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","support":[{"end":493,"quote":"A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","source_id":"nlm-mesh.d009493","source_sha256":"0ed1ee3ded8ee1a3c1e0508242f76419277b4c342b50adb97f12f0871d70695f","start":344}],"target_id":"field.mesh.d009493","target_kind":"node","target_sha256":"24729774ab1c2a44bfff27aa07dd40d964cc79322b72be2c2bb38a79c00004dd"}],"field.mesh.d009683":[{"id":"assertion.field.mesh.d009683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nuclear Medicine as described in the captured NLM MeSH descriptor D009683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nuclear Medicine as: A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","support":[{"end":470,"quote":"A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","source_id":"nlm-mesh.d009683","source_sha256":"e6bf077fe4508118c35b0c890690da016fa5fa5ba552f4c727563f43b7e58b10","start":352}],"target_id":"field.mesh.d009683","target_kind":"node","target_sha256":"0b08ab53d097210d69b2c41dea8d487f07daf519b8f22be1195638cca62412a3"}],"field.mesh.d009717":[{"id":"assertion.field.mesh.d009717","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Numismatics as described in the captured NLM MeSH descriptor D009717","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Numismatics as: Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","support":[{"end":715,"quote":"Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","source_id":"nlm-mesh.d009717","source_sha256":"c211f04f7ff9947bcca5875877241e31909c4d7a888a49cf1c36d586cda74cb6","start":603}],"target_id":"field.mesh.d009717","target_kind":"node","target_sha256":"1da8aa7fda45d1900baea694de7029ae31fb21ff556aba76aeabbd53a6ab42a9"}],"field.mesh.d009774":[{"id":"assertion.field.mesh.d009774","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Obstetrics as described in the captured NLM MeSH descriptor D009774","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Obstetrics as: A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","support":[{"end":566,"quote":"A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","source_id":"nlm-mesh.d009774","source_sha256":"cd7a00a12ef4afb1c7d902217d3f1d1afb8110117eb9562fba9dc24ae5d5d4d6","start":443}],"target_id":"field.mesh.d009774","target_kind":"node","target_sha256":"1fe64fc0fec46b13e6767d448ea3eac936877830ce5ac46a887054281acb79d4"}],"field.mesh.d009985":[{"id":"assertion.field.mesh.d009985","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orthopedics as described in the captured NLM MeSH descriptor D009985","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orthopedics as: A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","support":[{"end":629,"quote":"A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","source_id":"nlm-mesh.d009985","source_sha256":"7ff68109c0d16be0adca538acfde2f5534be7af7c38051a79e43c023547a63e1","start":436}],"target_id":"field.mesh.d009985","target_kind":"node","target_sha256":"fa6792265c333247200298d2df74bf58e4ced5ff9db88b44c5544a098858cc93"}],"field.mesh.d010021":[{"id":"assertion.field.mesh.d010021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Osteopathic Medicine as described in the captured NLM MeSH descriptor D010021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Osteopathic Medicine as: A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the MUSCULOSKELETAL SYSTEM .","support":[{"end":819,"quote":"A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the\nMUSCULOSKELETAL SYSTEM\n.","source_id":"nlm-mesh.d010021","source_sha256":"b2109352d05c9c43e6ac5f71b0c790af7e5070e06aa586e6d50cdf38918f4663","start":445}],"target_id":"field.mesh.d010021","target_kind":"node","target_sha256":"b2c381026d69e3af629fdcad49b442a6b75fe67aecfe2d0fcbdd55bb77c840b5"}],"field.mesh.d010036":[{"id":"assertion.field.mesh.d010036","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Otolaryngology as described in the captured NLM MeSH descriptor D010036","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Otolaryngology as: A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","support":[{"end":557,"quote":"A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","source_id":"nlm-mesh.d010036","source_sha256":"da97a0e59062a0741a868c1ef89024665e905b79cbbde1c6e43096f78aca519d","start":455}],"target_id":"field.mesh.d010036","target_kind":"node","target_sha256":"bcc94cba537048aa63fee3db2214842d73f564357bbd8a712ffd8335f396572f"}],"field.mesh.d010338":[{"id":"assertion.field.mesh.d010338","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Clinical as described in the captured NLM MeSH descriptor D010338","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Clinical as: A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","support":[{"end":603,"quote":"A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","source_id":"nlm-mesh.d010338","source_sha256":"50977746c10deb7a11bd9e7c640427b09e4a0705134f93b6cd4a46c2e19704be","start":446}],"target_id":"field.mesh.d010338","target_kind":"node","target_sha256":"8a009edfc88d1bd941b2b7c9e89e8aaae29458eb5a4c805a616bd8e15bd5cb09"}],"field.mesh.d010340":[{"id":"assertion.field.mesh.d010340","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Surgical as described in the captured NLM MeSH descriptor D010340","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Surgical as: A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","support":[{"end":478,"quote":"A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","source_id":"nlm-mesh.d010340","source_sha256":"98a161517b98d84ed6d17f818df8b41c64e117a23abeb72fbb9c98be70ab5ffe","start":358}],"target_id":"field.mesh.d010340","target_kind":"node","target_sha256":"cfe30c2a77c0f2874f0b625c2892db21544d6dab436cdd8a9dc8b2fb4f417949"}],"field.mesh.d010372":[{"id":"assertion.field.mesh.d010372","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pediatrics as described in the captured NLM MeSH descriptor D010372","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pediatrics as: A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","support":[{"end":476,"quote":"A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","source_id":"nlm-mesh.d010372","source_sha256":"ba60cc5402c9c0e3952fe3a33a40e649b36dad43ad1900e779932689eb4a2c9f","start":357}],"target_id":"field.mesh.d010372","target_kind":"node","target_sha256":"c0b8e38917d3bc9932fd115fec50ede98604d44c8f2e276ccf79b93d2ad807ec"}],"field.mesh.d010500":[{"id":"assertion.field.mesh.d010500","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perinatology as described in the captured NLM MeSH descriptor D010500","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perinatology as: The branch of medicine dealing with the FETUS and NEWBORN during the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","support":[{"end":633,"quote":"The branch of medicine dealing with the\nFETUS\nand\nNEWBORN\nduring the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","source_id":"nlm-mesh.d010500","source_sha256":"85c08faf817704a304f4ed7f4368aecf0b3c20f713180ac10ac718ee7ae4ec2a","start":438}],"target_id":"field.mesh.d010500","target_kind":"node","target_sha256":"8aacf667623330ea0f9710e3145eb8345f2f250e277f438294ea8f72c3ac6fc4"}],"field.mesh.d010681":[{"id":"assertion.field.mesh.d010681","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Classical as described in the captured NLM MeSH descriptor D010681","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Classical as: The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":504,"quote":"The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010681","source_sha256":"2abdc64693fd8cff57a0bb6ffeec03d1d26e7c93fd670cf4a5d9065e8d23fdee","start":360}],"target_id":"field.mesh.d010681","target_kind":"node","target_sha256":"b0654f6fd297faafd83bbdf95721db44f6b1194a9d710c5a928577c4458dee2c"}],"field.mesh.d010682":[{"id":"assertion.field.mesh.d010682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Oriental as described in the captured NLM MeSH descriptor D010682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Oriental as: The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":524,"quote":"The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010682","source_sha256":"53111d2bb2594f9873eb7358229818bccea051152b07b9793ef888e43b49ef55","start":358}],"target_id":"field.mesh.d010682","target_kind":"node","target_sha256":"7328d6c0811944b5fcafea84e01f8317926171b60b668f16d5a8f7342f532712"}],"field.mesh.d010683":[{"id":"assertion.field.mesh.d010683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Romance as described in the captured NLM MeSH descriptor D010683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Romance as: The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":569,"quote":"The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010683","source_sha256":"344d9da5a42209c7ad89a48c02438e82bec1f92c26feafcb06d6840c3687b09a","start":356}],"target_id":"field.mesh.d010683","target_kind":"node","target_sha256":"4eb0825bed9d50fb6c3c9de753fb4a1aac32ade01d092c91bd66863e6c7c744d"}],"field.mesh.d010685":[{"id":"assertion.field.mesh.d010685","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Dental as described in the captured NLM MeSH descriptor D010685","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Dental as: The underlying rationale or theoretical basis for the principles of DENTISTRY .","support":[{"end":431,"quote":"The underlying rationale or theoretical basis for the principles of\nDENTISTRY\n.","source_id":"nlm-mesh.d010685","source_sha256":"f23451b055c7e1dc807ea5c196b9e54ad55aaab56bfbbde54d3787a9311be6ca","start":352}],"target_id":"field.mesh.d010685","target_kind":"node","target_sha256":"5c9964ae8af97c3ee7c6d653668494c6d52716816f39ead10472886f7393dea8"}],"field.mesh.d010686":[{"id":"assertion.field.mesh.d010686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Medical as described in the captured NLM MeSH descriptor D010686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Medical as: The underlying rationale or theoretical basis for the principles of MEDICINE .","support":[{"end":432,"quote":"The underlying rationale or theoretical basis for the principles of\nMEDICINE\n.","source_id":"nlm-mesh.d010686","source_sha256":"5df85c4ad982d0d180db891173ae8710e3ab275aa5d152ffb92b38c29a0b223d","start":354}],"target_id":"field.mesh.d010686","target_kind":"node","target_sha256":"8482b57755e902a2a88464a1adae120cb1507f9f34288fddef2e6e1fbc231e5d"}],"field.mesh.d010687":[{"id":"assertion.field.mesh.d010687","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Nursing as described in the captured NLM MeSH descriptor D010687","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Nursing as: The underlying rationale or theoretical basis for the principles of NURSING .","support":[{"end":431,"quote":"The underlying rationale or theoretical basis for the principles of\nNURSING\n.","source_id":"nlm-mesh.d010687","source_sha256":"d79c409f044a154436377b568ccdda1641d5a269a88794b072c811946a3a3c23","start":354}],"target_id":"field.mesh.d010687","target_kind":"node","target_sha256":"20c484dc9474e95a9c2ce403e9d542c23dacb583328df9a21b72f36b3fb7cc94"}],"field.mesh.d010792":[{"id":"assertion.field.mesh.d010792","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Phrenology as described in the captured NLM MeSH descriptor D010792","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Phrenology as: The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","support":[{"end":519,"quote":"The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","source_id":"nlm-mesh.d010792","source_sha256":"8d8e19f93d8e55cb2d8acfd12fb0ada034b0f55340d9b355f9ca68635ee66b1d","start":336}],"target_id":"field.mesh.d010792","target_kind":"node","target_sha256":"086d0d894fb0b61b47a22f69c9543957a953f76545e0fcb47df08cea7f857b08"}],"field.mesh.d010810":[{"id":"assertion.field.mesh.d010810","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Physical and Rehabilitation Medicine as described in the captured NLM MeSH descriptor D010810","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Physical and Rehabilitation Medicine as: A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","support":[{"end":697,"quote":"A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","source_id":"nlm-mesh.d010810","source_sha256":"9eb503ff3a1f78aa0ef1c30f31701175dab2adbe62ced8b190fe398720f4118f","start":537}],"target_id":"field.mesh.d010810","target_kind":"node","target_sha256":"3dea61ce3b2af02d74a7f9c4a335c6b8c6ad3c6d566f7c5044d1c204c6450907"}],"field.mesh.d011057":[{"id":"assertion.field.mesh.d011057","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Politics as described in the captured NLM MeSH descriptor D011057","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.","support":[{"end":429,"quote":"Activities concerned with governmental policies, functions, etc.","source_id":"nlm-mesh.d011057","source_sha256":"a1ed5c1deb12c39c565f82c9ca80135cae350a3ff0026bc8390ef284fbefed35","start":365}],"target_id":"field.mesh.d011057","target_kind":"node","target_sha256":"d153abc7b3d102ee0cf58552558bb5bdb5b0249bacfdf3299e8fc88b2b00a351"}],"field.mesh.d011157":[{"id":"assertion.field.mesh.d011157","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Dynamics as described in the captured NLM MeSH descriptor D011157","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Dynamics as: The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","support":[{"end":565,"quote":"The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","source_id":"nlm-mesh.d011157","source_sha256":"a79437150cd920350237e854e16dc0ee97d9ec818e97a0bfe7475534823cffcd","start":447}],"target_id":"field.mesh.d011157","target_kind":"node","target_sha256":"9ad802ed7ed9a8b51f1f4dfb8f6723f25f5aecce68aa7c2c0339de441ea9e4ea"}],"field.mesh.d011315":[{"id":"assertion.field.mesh.d011315","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Preventive Medicine as described in the captured NLM MeSH descriptor D011315","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Preventive Medicine as: A medical specialty primarily concerned with prevention of disease ( PRIMARY PREVENTION ) and the promotion and preservation of health in the individual.","support":[{"end":665,"quote":"A medical specialty primarily concerned with prevention of disease (\nPRIMARY PREVENTION\n) and the promotion and preservation of health in the individual.","source_id":"nlm-mesh.d011315","source_sha256":"c0c186c3d01b7591076ff23c55e587197874a35bc1d21fcfffce6ae64d1427e0","start":512}],"target_id":"field.mesh.d011315","target_kind":"node","target_sha256":"3fd2aa14c0006dfb4b722d2a87723b328542a5f94d01f343b8dc871f59671787"}],"field.mesh.d011316":[{"id":"assertion.field.mesh.d011316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Preventive Psychiatry as described in the captured NLM MeSH descriptor D011316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Preventive Psychiatry as: A discipline concerned with the prevention of mental illness and the promotion of mental health.","support":[{"end":621,"quote":"A discipline concerned with the prevention of mental illness and the promotion of mental health.","source_id":"nlm-mesh.d011316","source_sha256":"849bd45b2617d356a15137557d48cb7407cd24d80ecb2eff6ecacb8726b591ff","start":525}],"target_id":"field.mesh.d011316","target_kind":"node","target_sha256":"8dade37ea53547d54515eeb54caae6168a90d68f35c9618105e79450a6060917"}],"field.mesh.d011570":[{"id":"assertion.field.mesh.d011570","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychiatry as described in the captured NLM MeSH descriptor D011570","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","support":[{"end":517,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","source_id":"nlm-mesh.d011570","source_sha256":"1e931e1765b8d4912f3b3157b0acc7638ba2662082d3940ddbe989aacbfa9899","start":412}],"target_id":"field.mesh.d011570","target_kind":"node","target_sha256":"5c6fe12db00331175dcfde1443202988a355f6a5d374a5a5853d96c56787b3b0"}],"field.mesh.d011593":[{"id":"assertion.field.mesh.d011593","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychology, Social as described in the captured NLM MeSH descriptor D011593","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","support":[{"end":549,"quote":"The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","source_id":"nlm-mesh.d011593","source_sha256":"da9760990d68ed77c4c9fdfb678ce4a366011d4b6fc6688b7cbe74c5941d62b3","start":418}],"target_id":"field.mesh.d011593","target_kind":"node","target_sha256":"4ea8036cb8e1c3c0cced67238285ff93937934c26f652682c023bd0cba972062"}],"field.mesh.d011634":[{"id":"assertion.field.mesh.d011634","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Public Health as described in the captured NLM MeSH descriptor D011634","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Public Health as: Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","support":[{"end":641,"quote":"Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","source_id":"nlm-mesh.d011634","source_sha256":"49d795fe2078dfd8ecda286471f8683955f3725a0f4b68fdaaefcc72e77d6462","start":429}],"target_id":"field.mesh.d011634","target_kind":"node","target_sha256":"6093893aae4e5111cffdb6ff371e83f4ea2436006015b717660a930cf292d3c9"}],"field.mesh.d012067":[{"id":"assertion.field.mesh.d012067","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion as described in the captured NLM MeSH descriptor D012067","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion as: A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","support":[{"end":628,"quote":"A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","source_id":"nlm-mesh.d012067","source_sha256":"571c96ac68a8f7b1c5819aefdfc5c41f6b047c21e2293ba989f7cf95a93ac907","start":328}],"target_id":"field.mesh.d012067","target_kind":"node","target_sha256":"2274c42cf65e0305dc6568904cb17977cb7bf934117f8bdc332d143afdde36f8"}],"field.mesh.d012068":[{"id":"assertion.field.mesh.d012068","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Medicine as described in the captured NLM MeSH descriptor D012068","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Medicine as: The interrelationship of medicine and religion.","support":[{"end":475,"quote":"The interrelationship of medicine and religion.","source_id":"nlm-mesh.d012068","source_sha256":"95ac2c14cbff1fec2245216773ce10c4cc098ce17b27eb14a7cc77b7aac82f8d","start":428}],"target_id":"field.mesh.d012068","target_kind":"node","target_sha256":"1aac76aa089e0529e3483f5ac2c34b7b52ae71a08651b25ca7b41eb15a3411fa"}],"field.mesh.d012069":[{"id":"assertion.field.mesh.d012069","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Psychology as described in the captured NLM MeSH descriptor D012069","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Psychology as: The interrelationship of psychology and religion.","support":[{"end":419,"quote":"The interrelationship of psychology and religion.","source_id":"nlm-mesh.d012069","source_sha256":"44b773afc3f7899a6b31f0853c1ab45ab7d0392991c506a8545cb66c16b20421","start":370}],"target_id":"field.mesh.d012069","target_kind":"node","target_sha256":"01af8a1a0e4d7381a9b20398a7cb5af5b8a23740725a850221f463e422135819"}],"field.mesh.d012070":[{"id":"assertion.field.mesh.d012070","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Science as described in the captured NLM MeSH descriptor D012070","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Science as: The interrelationship of science and religion.","support":[{"end":402,"quote":"The interrelationship of science and religion.","source_id":"nlm-mesh.d012070","source_sha256":"b45591271567e9764a19b0338ca34e30afe07561f96d43a43857792a79bacc66","start":356}],"target_id":"field.mesh.d012070","target_kind":"node","target_sha256":"046955660d7ed6f8e26c9d2c29a730e0e0e639e19335853e301faf252b78ec40"}],"field.mesh.d012371":[{"id":"assertion.field.mesh.d012371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Robotics as described in the captured NLM MeSH descriptor D012371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Robotics as: The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","support":[{"end":662,"quote":"The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","source_id":"nlm-mesh.d012371","source_sha256":"ab268773c4669260cf016ebf523e4d14ba9bcf8183bd61a01abb6f9a94476cc8","start":372}],"target_id":"field.mesh.d012371","target_kind":"node","target_sha256":"03918f2946d235ac03094687f2c39bf0804f07ef7cb508274bf91ca35b5de0da"}],"field.mesh.d012586":[{"id":"assertion.field.mesh.d012586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science as described in the captured NLM MeSH descriptor D012586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science as: The study of natural phenomena by observation, measurement, and experimentation.","support":[{"end":471,"quote":"The study of natural phenomena by observation, measurement, and experimentation.","source_id":"nlm-mesh.d012586","source_sha256":"39b60447bdd83ff694373661139be4164623ddb0ce6621f784b828e88ad80d4a","start":391}],"target_id":"field.mesh.d012586","target_kind":"node","target_sha256":"8c4395f3bee09d529bb51e911fd698332da6a9832b3d3a6de256a0ece8f1504e"}],"field.mesh.d012936":[{"id":"assertion.field.mesh.d012936","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Medicine as described in the captured NLM MeSH descriptor D012936","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Medicine as: A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","support":[{"end":477,"quote":"A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","source_id":"nlm-mesh.d012936","source_sha256":"435ca04e6afd7afeefb319d77e0ab235b7bd107200cc12c69e30207cfb434356","start":346}],"target_id":"field.mesh.d012936","target_kind":"node","target_sha256":"bf73d9d9136f752dfe401e2b2f5c92951ba49507a230fd1d3b75f39f72e0c358"}],"field.mesh.d012942":[{"id":"assertion.field.mesh.d012942","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Sciences as described in the captured NLM MeSH descriptor D012942","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Sciences as: Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","support":[{"end":524,"quote":"Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","source_id":"nlm-mesh.d012942","source_sha256":"360f81175ffa9c71e7eb3e5aaf24189d952dae0fa8adec6233b87e1b934ab531","start":350}],"target_id":"field.mesh.d012942","target_kind":"node","target_sha256":"095afb891b1982f7623dd4e463b6dfd08d56c2d2fdcd0b4e1a3cb139994ebbd0"}],"field.mesh.d012962":[{"id":"assertion.field.mesh.d012962","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sociology, Medical as described in the captured NLM MeSH descriptor D012962","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sociology, Medical as: The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","support":[{"end":564,"quote":"The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","source_id":"nlm-mesh.d012962","source_sha256":"705ffb14f79c640244ee4af7cee593abe26eb12ec68ce4872129fe988f4351b2","start":418}],"target_id":"field.mesh.d012962","target_kind":"node","target_sha256":"39db8cf0fa1faa62435dd6e7e7c9e8a9d9a8886aa050c206ffc1667b7726a0ee"}],"field.mesh.d013043":[{"id":"assertion.field.mesh.d013043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Specialties, Surgical as described in the captured NLM MeSH descriptor D013043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Specialties, Surgical as: Various branches of surgical practice limited to specialized areas.","support":[{"end":655,"quote":"Various branches of surgical practice limited to specialized areas.","source_id":"nlm-mesh.d013043","source_sha256":"dcaa9156bb8c1f89c8f5bce60498d7d365cf8fa3f41fb7f457a375ca501f8e0a","start":588}],"target_id":"field.mesh.d013043","target_kind":"node","target_sha256":"494b7cd4945e55a4f980cdb5f1714e5c859adbf3465bc5dde08c820b7d22516b"}],"field.mesh.d013178":[{"id":"assertion.field.mesh.d013178","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sports Medicine as described in the captured NLM MeSH descriptor D013178","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sports Medicine as: The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","support":[{"end":612,"quote":"The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","source_id":"nlm-mesh.d013178","source_sha256":"b287ffd927333d3593a17e8363d8beb2c68e20ac77c4db063843b3016e81b50a","start":470}],"target_id":"field.mesh.d013178","target_kind":"node","target_sha256":"765715db5ca9943bc36d7d084b2617b74668689c98451f188721232e97a84c9a"}],"field.mesh.d013366":[{"id":"assertion.field.mesh.d013366","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Submarine Medicine as described in the captured NLM MeSH descriptor D013366","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Submarine Medicine as: The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","support":[{"end":595,"quote":"The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","source_id":"nlm-mesh.d013366","source_sha256":"4c9431f8cba1ff0cb239b95a303944723b70cf6e6511f5bf2528a4c2db53cc36","start":491}],"target_id":"field.mesh.d013366","target_kind":"node","target_sha256":"bc06085e57392cd6e90097200e477c36a547ca0cab000889a18bdb6beb53e6ba"}],"field.mesh.d013502":[{"id":"assertion.field.mesh.d013502","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"General Surgery as described in the captured NLM MeSH descriptor D013502","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes General Surgery as: A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","support":[{"end":639,"quote":"A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","source_id":"nlm-mesh.d013502","source_sha256":"b09e59f9a6e68c6220cf3dd7c3bd3a25b654e7a3c68d655c5bf21927fb701fc5","start":524}],"target_id":"field.mesh.d013502","target_kind":"node","target_sha256":"1e4414c759de741d379af934d9e577bc2f0d41613581291e5145cee445a639bb"}],"field.mesh.d013518":[{"id":"assertion.field.mesh.d013518","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Surgery, Plastic as described in the captured NLM MeSH descriptor D013518","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Surgery, Plastic as: The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","support":[{"end":588,"quote":"The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","source_id":"nlm-mesh.d013518","source_sha256":"0c05c22f027d816bc0e406ecf5ff87685c722c8341414af5e46f867b03387feb","start":462}],"target_id":"field.mesh.d013518","target_kind":"node","target_sha256":"51f942b31a13e24126abb8219e45cb3521c4bbe805c1bddbd6c6dcd98b21db2f"}],"field.mesh.d013672":[{"id":"assertion.field.mesh.d013672","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology as described in the captured NLM MeSH descriptor D013672","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology as: The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","support":[{"end":461,"quote":"The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","source_id":"nlm-mesh.d013672","source_sha256":"08f99616a82431407ac21d1e4ecc727aabc9bba820cfe0a3f6f62156e5150ad6","start":332}],"target_id":"field.mesh.d013672","target_kind":"node","target_sha256":"bda6f1dae4bdff1c0f688ed2cb3521a9446aa5e69879c06be649b36954acfd2e"}],"field.mesh.d013674":[{"id":"assertion.field.mesh.d013674","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Dental as described in the captured NLM MeSH descriptor D013674","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Dental as: The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","support":[{"end":545,"quote":"The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","source_id":"nlm-mesh.d013674","source_sha256":"a6e3a86aaac59d0b85a423f67dc513dcc741b1cd30d4548fa079ba6db4ba5b9f","start":372}],"target_id":"field.mesh.d013674","target_kind":"node","target_sha256":"0f53a94519ab3f60f48ac5e4b4aaf95d3ec0c3043d9a3aeb30418fc64a94151e"}],"field.mesh.d013677":[{"id":"assertion.field.mesh.d013677","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Laboratory Science as described in the captured NLM MeSH descriptor D013677","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Laboratory Science as: The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","support":[{"end":551,"quote":"The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","source_id":"nlm-mesh.d013677","source_sha256":"48886ea008f208539d2dfca58dec5f4ed1095f1665f2b904845819d2784a99b7","start":380}],"target_id":"field.mesh.d013677","target_kind":"node","target_sha256":"6b678f4d6011a752ea02cd55c3c3d87ebffa0a0a37ce039c2d26daa9fd8bc864"}],"field.mesh.d013678":[{"id":"assertion.field.mesh.d013678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Pharmaceutical as described in the captured NLM MeSH descriptor D013678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Pharmaceutical as: The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","support":[{"end":723,"quote":"The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","source_id":"nlm-mesh.d013678","source_sha256":"9bbf6f2ff0c9af09ee12346b5772e36bb78d6c545a2f69290baf41ae26a73587","start":376}],"target_id":"field.mesh.d013678","target_kind":"node","target_sha256":"fabd4c31274a6efb3d773de795449a170f4df90178ea7a19377fa6c0e60aa48a"}],"field.mesh.d013679":[{"id":"assertion.field.mesh.d013679","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Radiologic as described in the captured NLM MeSH descriptor D013679","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Radiologic as: The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","support":[{"end":726,"quote":"The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","source_id":"nlm-mesh.d013679","source_sha256":"e0f21659c097388ab1baaf0ac5737affd9746a78c1ff390ccacd70b7bc693428","start":423}],"target_id":"field.mesh.d013679","target_kind":"node","target_sha256":"164cafcbce667a0cfb29294f2a26cdcd001d26fbd1c22113896386bd2dc802d7"}],"field.mesh.d013903":[{"id":"assertion.field.mesh.d013903","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Thoracic Surgery as described in the captured NLM MeSH descriptor D013903","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Thoracic Surgery as: A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","support":[{"end":626,"quote":"A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","source_id":"nlm-mesh.d013903","source_sha256":"1a1c42a53c2dadd9c35864b13b6ae81e4c792b5aa1a67622fc6d990612f12ba1","start":434}],"target_id":"field.mesh.d013903","target_kind":"node","target_sha256":"3df6fa7521ced4bf616f0dde6f74f5f887a9cc994af57f1249ea74ebeeb7c80a"}],"field.mesh.d014330":[{"id":"assertion.field.mesh.d014330","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tropical Medicine as described in the captured NLM MeSH descriptor D014330","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tropical Medicine as: The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","support":[{"end":582,"quote":"The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","source_id":"nlm-mesh.d014330","source_sha256":"95595a05d4d4337e00e0541ffb29a2520f662e01cf2891abcd0b76bfa8e22473","start":463}],"target_id":"field.mesh.d014330","target_kind":"node","target_sha256":"361b6d1299cdb13bd1b831111736e8b9eb6db493a322589b1b0bab9260a350d5"}],"field.mesh.d014686":[{"id":"assertion.field.mesh.d014686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Venereology as described in the captured NLM MeSH descriptor D014686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Venereology as: A branch of medicine which deals with sexually transmitted disease.","support":[{"end":405,"quote":"A branch of medicine which deals with sexually transmitted disease.","source_id":"nlm-mesh.d014686","source_sha256":"8ada370f70d1693646e26161e362907fae36deb1aaa37e68374bd426f4e0101d","start":338}],"target_id":"field.mesh.d014686","target_kind":"node","target_sha256":"b8e47868999e406a2eedd18a0b8153c4ef35f61b81f5a014d5e18c2d25b90c96"}],"field.mesh.d014943":[{"id":"assertion.field.mesh.d014943","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Global Health as described in the captured NLM MeSH descriptor D014943","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Global Health as: A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","support":[{"end":671,"quote":"A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","source_id":"nlm-mesh.d014943","source_sha256":"ca65929785f6206a7003417d503ee05f5f47035dd0cba777f665a2c613e2d919","start":354}],"target_id":"field.mesh.d014943","target_kind":"node","target_sha256":"c796812b5441ce953f5a72f747ad2c5112c3d93496fefc696b0bdafe51df2e65"}],"field.mesh.d015272":[{"id":"assertion.field.mesh.d015272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pulmonary Medicine as described in the captured NLM MeSH descriptor D015272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pulmonary Medicine as: A subspecialty of internal medicine concerned with the study of the RESPIRATORY SYSTEM . It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","support":[{"end":618,"quote":"A subspecialty of internal medicine concerned with the study of the\nRESPIRATORY SYSTEM\n. It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","source_id":"nlm-mesh.d015272","source_sha256":"047f790fba559bdd4fe535fbd621b9181a379eca85aefb6487a2c606629fccf7","start":417}],"target_id":"field.mesh.d015272","target_kind":"node","target_sha256":"a40e9233f137e498de0f906737ce9321a7dae0b395bc10d9add4a9576831430d"}],"field.mesh.d015510":[{"id":"assertion.field.mesh.d015510","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Clinical Medicine as described in the captured NLM MeSH descriptor D015510","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Clinical Medicine as: The study and practice of medicine by direct examination of the patient.","support":[{"end":422,"quote":"The study and practice of medicine by direct examination of the patient.","source_id":"nlm-mesh.d015510","source_sha256":"985f485b4a309b94c1ccaa3fdd4c7eafc20fe240375db0c21ff9d9a85eb6c977","start":350}],"target_id":"field.mesh.d015510","target_kind":"node","target_sha256":"270e7190f1d7ce459b08fb7e58079fc944d364e6687b66a04f56f585f92238e8"}],"field.mesh.d015642":[{"id":"assertion.field.mesh.d015642","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiology, Interventional as described in the captured NLM MeSH descriptor D015642","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiology, Interventional as: Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","support":[{"end":587,"quote":"Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","source_id":"nlm-mesh.d015642","source_sha256":"bd368b4fde31f0291bc0d5adaf62ee98daca3ccdb3adbe2582ce9f9f2a746bd8","start":479}],"target_id":"field.mesh.d015642","target_kind":"node","target_sha256":"418f72dd7198c6b4d1d81a843dc59b74a47471f889dcc210fa664072aec18382"}],"field.mesh.d017711":[{"id":"assertion.field.mesh.d017711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nonlinear Dynamics as described in the captured NLM MeSH descriptor D017711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nonlinear Dynamics as: The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal ( FRACTALS ) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","support":[{"end":1105,"quote":"The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal (\nFRACTALS\n) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","source_id":"nlm-mesh.d017711","source_sha256":"7339d4ceab6363dc4440ad1a27ed68eea69381232d1f23ec79c4457e0b49b503","start":418}],"target_id":"field.mesh.d017711","target_kind":"node","target_sha256":"bb9d3a644e09becb3f5d065480d28eae3c99070ea8e7b91f5bce99ecdd3f9c9c"}],"field.mesh.d017720":[{"id":"assertion.field.mesh.d017720","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Epidemiology as described in the captured NLM MeSH descriptor D017720","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Epidemiology as: The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in DNA to implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","support":[{"end":1247,"quote":"The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in\nDNA\nto implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","source_id":"nlm-mesh.d017720","source_sha256":"7584ca84d4564c8cef08bbc868ca2941750fe20537384b50f50e36b060a03c2f","start":965}],"target_id":"field.mesh.d017720","target_kind":"node","target_sha256":"e249ef10d0aebacd85c1d0474a0ed8ce738a25b15fadde8964d3ac655999cf54"}],"field.mesh.d017891":[{"id":"assertion.field.mesh.d017891","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmacoepidemiology as described in the captured NLM MeSH descriptor D017891","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmacoepidemiology as: The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","support":[{"end":1047,"quote":"The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","source_id":"nlm-mesh.d017891","source_sha256":"b1791614dbf02b48d88ae2647a316193f907672c63c5368c2277284dd54f5169","start":392}],"target_id":"field.mesh.d017891","target_kind":"node","target_sha256":"c0fab0fab6c9193cb7f7dd55c91f67d3c34b0fc7c3e38b8644f07f351d56e273"}],"field.mesh.d018456":[{"id":"assertion.field.mesh.d018456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Medicine as described in the captured NLM MeSH descriptor D018456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Medicine as: A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","support":[{"end":1061,"quote":"A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","source_id":"nlm-mesh.d018456","source_sha256":"d3f96a2c14bff790e29ee2d800f42813cf066dbd03ff823e3701fede0f769cc1","start":462}],"target_id":"field.mesh.d018456","target_kind":"node","target_sha256":"2474083ff2927639fc79f08b457e879b494bfd14851fbe9486c3201213f41080"}],"field.mesh.d018732":[{"id":"assertion.field.mesh.d018732","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Anthropology as described in the captured NLM MeSH descriptor D018732","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Anthropology as: Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","support":[{"end":1107,"quote":"Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","source_id":"nlm-mesh.d018732","source_sha256":"895770077cd26a6eae098654705410f68e9a8ef77797c79cbba1967827c4fd10","start":521}],"target_id":"field.mesh.d018732","target_kind":"node","target_sha256":"b3c8603c8566e8e6b4a78e97023f56ad4fdeaefc976c334db0e32a2b4c051cdd"}],"field.mesh.d018787":[{"id":"assertion.field.mesh.d018787","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiation Oncology as described in the captured NLM MeSH descriptor D018787","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiation Oncology as: A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","support":[{"end":584,"quote":"A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","source_id":"nlm-mesh.d018787","source_sha256":"24cc301d90c732395e6aa95925edf5bb1b44f46a3f79c51bfb44f12bc1d36f70","start":493}],"target_id":"field.mesh.d018787","target_kind":"node","target_sha256":"9dedad3a292116006f8695adf7c4c855e11442f23b6d1d3701dd2b2ea53f9c40"}],"field.mesh.d018961":[{"id":"assertion.field.mesh.d018961","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Educational Technology as described in the captured NLM MeSH descriptor D018961","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Educational Technology as: Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","support":[{"end":752,"quote":"Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","source_id":"nlm-mesh.d018961","source_sha256":"fec82e43a3c6e99157f4b3356f0f87ad7130ab656c3ce2c25197a88b9e91adcb","start":416}],"target_id":"field.mesh.d018961","target_kind":"node","target_sha256":"ddf4953ca425246d474cf138f8b291a0375587f1304a17b8af188d012c48af2b"}],"field.mesh.d019021":[{"id":"assertion.field.mesh.d019021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Natural History as described in the captured NLM MeSH descriptor D019021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":930,"quote":"A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019021","source_sha256":"a311f940b7dcd549e907c0bcf73addfc851c1397331b0b574ef03c28a883b88a","start":493}],"target_id":"field.mesh.d019021","target_kind":"node","target_sha256":"decc8682c9a97ecc7c00b7156ce5025628d23f2cfc52649a1c4747d18c8d6933"}],"field.mesh.d019317":[{"id":"assertion.field.mesh.d019317","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence-Based Medicine as described in the captured NLM MeSH descriptor D019317","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence-Based Medicine as: An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","support":[{"end":868,"quote":"An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","source_id":"nlm-mesh.d019317","source_sha256":"e1d4683bf9a782e08e009c69022db97f84401c7544eef70fb66e8e212d33ae43","start":406}],"target_id":"field.mesh.d019317","target_kind":"node","target_sha256":"ea82fb2ae0c8692fd2db344d829cac8fc33b3f75c4fd8d4baf1d5439aca06e92"}],"field.mesh.d019371":[{"id":"assertion.field.mesh.d019371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Topography, Medical as described in the captured NLM MeSH descriptor D019371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Topography, Medical as: The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from EPIDEMIOLOGY in that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","support":[{"end":960,"quote":"The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from\nEPIDEMIOLOGY\nin that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","source_id":"nlm-mesh.d019371","source_sha256":"34550447f56c2717df070f990038d093403d112e71bce125d99f81384be8afec","start":625}],"target_id":"field.mesh.d019371","target_kind":"node","target_sha256":"ae76ebb9865d4b585610c332952279daa86710990f27df5f25af53b3f9e5cf41"}],"field.mesh.d020811":[{"id":"assertion.field.mesh.d020811","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Technology as described in the captured NLM MeSH descriptor D020811","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Technology as: The application of technology to the solution of medical problems.","support":[{"end":428,"quote":"The application of technology to the solution of medical problems.","source_id":"nlm-mesh.d020811","source_sha256":"f1797c521c5d00775331d775f36c2aa35eb9837cc61f238049c36af78b7b2d0e","start":362}],"target_id":"field.mesh.d020811","target_kind":"node","target_sha256":"733da2e94232a6c9ca87d646e572b8ea26f4cbfa4b06e9513e893b145e042084"}],"field.mesh.d026690":[{"id":"assertion.field.mesh.d026690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Clinical as described in the captured NLM MeSH descriptor D026690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","support":[{"end":769,"quote":"The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026690","source_sha256":"809eb3278963950c09addcf8bb75038047b70a00bd640895de003aae3663237f","start":649}],"target_id":"field.mesh.d026690","target_kind":"node","target_sha256":"c29bdb29b292244a8e3ef114c6df050b5beb4d273bc6b4eaeb44c1972a79ef67"}],"field.mesh.d028662":[{"id":"assertion.field.mesh.d028662","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Principle-Based Ethics as described in the captured NLM MeSH descriptor D028662","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Principle-Based Ethics as: An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","support":[{"end":537,"quote":"An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","source_id":"nlm-mesh.d028662","source_sha256":"2416e311da3e306c70befff014f44140beb06cb26eb8f87a51fdea795ee46847","start":380}],"target_id":"field.mesh.d028662","target_kind":"node","target_sha256":"cb005a3828ecd5e5a37dd63279c480f4158f58a5d52afa15cf9ad6b9fae7c567"}],"field.mesh.d032701":[{"id":"assertion.field.mesh.d032701","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomimetics as described in the captured NLM MeSH descriptor D032701","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomimetics as: An interdisciplinary field in materials science, ENGINEERING , and BIOLOGY , studying the use of biological principles for synthesis or fabrication of BIOMIMETIC MATERIALS .","support":[{"end":581,"quote":"An interdisciplinary field in materials science,\nENGINEERING\n, and\nBIOLOGY\n, studying the use of biological principles for synthesis or fabrication of\nBIOMIMETIC MATERIALS\n.","source_id":"nlm-mesh.d032701","source_sha256":"115dd0c7e511626f261efe3357d0882a512b70b36ebf4b146b839d18cff3170a","start":408}],"target_id":"field.mesh.d032701","target_kind":"node","target_sha256":"cdb95880b307d6da326a68e13a0719ccc5ba99f6e500ae353b03ed64dd99bfac"}],"field.mesh.d032781":[{"id":"assertion.field.mesh.d032781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Codes of Ethics as described in the captured NLM MeSH descriptor D032781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Codes of Ethics as: Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","support":[{"end":662,"quote":"Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","source_id":"nlm-mesh.d032781","source_sha256":"f55324cf9c30cbb15e7433ceee6def9d66f45deb08d4678e7151ab22c24949fa","start":534}],"target_id":"field.mesh.d032781","target_kind":"node","target_sha256":"9d11d6a7556c32dfec1e3ed880ca7f108416a3627a13dcf9e8647b1d00e0ea42"}],"field.mesh.d032984":[{"id":"assertion.field.mesh.d032984","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Research as described in the captured NLM MeSH descriptor D032984","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Research as: The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","support":[{"end":653,"quote":"The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","source_id":"nlm-mesh.d032984","source_sha256":"1ee1cb41e82cd1ee9ed0000a9ff2030f93240ad7152f28b2f1643c74a5a528ab","start":537}],"target_id":"field.mesh.d032984","target_kind":"node","target_sha256":"4b6eb63c7be7ffb92aac3a2fea8bf637ae17a4a5729a96a36ab07b010dc382a0"}],"field.mesh.d040821":[{"id":"assertion.field.mesh.d040821","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Characteristics as described in the captured NLM MeSH descriptor D040821","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Characteristics as: The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":455,"quote":"The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d040821","source_sha256":"3ff2e4966dbdd3d6a3fdbb3f8e22b91df1172ce6e0f683fa8a4b2a2462948080","start":354}],"target_id":"field.mesh.d040821","target_kind":"node","target_sha256":"93fc870f8f9780579811be70ac835528940a087a496ee1da66e929634a67afe0"}],"field.mesh.d040861":[{"id":"assertion.field.mesh.d040861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Business as described in the captured NLM MeSH descriptor D040861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Business as: The moral obligations governing the conduct of commercial or industrial enterprises.","support":[{"end":452,"quote":"The moral obligations governing the conduct of commercial or industrial enterprises.","source_id":"nlm-mesh.d040861","source_sha256":"6a8d4dd2b8edabb5b312b6f5e030a64913e2a1e7c1e0d7536195d1f979f5301b","start":368}],"target_id":"field.mesh.d040861","target_kind":"node","target_sha256":"33bfa0bcce857dac7564c981e1fe57104bf5297f3e99baf55f71bc327013be85"}],"field.mesh.d044085":[{"id":"assertion.field.mesh.d044085","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microfluidics as described in the captured NLM MeSH descriptor D044085","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .","support":[{"end":622,"quote":"The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological\nMICROCIRCULATION\nand used in\nMICROCHEMISTRY\nand\nINVESTIGATIVE TECHNIQUES\n.","source_id":"nlm-mesh.d044085","source_sha256":"c5c8478d80327123b39bd8a04bd547c843267c4eec5da1781e2db04d6edb0449","start":378}],"target_id":"field.mesh.d044085","target_kind":"node","target_sha256":"61278e444b9fe8d9920f576ee1786ac1a2c92d014f68af7f936b2776a3329774"}],"field.mesh.d044707":[{"id":"assertion.field.mesh.d044707","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Sciences as described in the captured NLM MeSH descriptor D044707","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Sciences as: Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as FORENSIC TOXICOLOGY ; FORENSIC ANTHROPOLOGY ; FORENSIC MEDICINE ; FORENSIC DENTISTRY ; and others.","support":[{"end":551,"quote":"Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as\nFORENSIC TOXICOLOGY\n;\nFORENSIC ANTHROPOLOGY\n;\nFORENSIC MEDICINE\n;\nFORENSIC DENTISTRY\n; and others.","source_id":"nlm-mesh.d044707","source_sha256":"0d09f0c3351d68e84f1734ef838afceeb6a612f6dd7e080941843d3e502b47d7","start":350}],"target_id":"field.mesh.d044707","target_kind":"node","target_sha256":"fcf7fe6138c9d3ed85aee52a87f4ce5d81a2e1fbce529097321bc7b5911458d8"}],"field.mesh.d044709":[{"id":"assertion.field.mesh.d044709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Ballistics as described in the captured NLM MeSH descriptor D044709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Ballistics as: The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","support":[{"end":645,"quote":"The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","source_id":"nlm-mesh.d044709","source_sha256":"acede0e0b839f4b9fe4e90c05d741adfb7e3fea6a947a59d2a5a56b76def2ecb","start":358}],"target_id":"field.mesh.d044709","target_kind":"node","target_sha256":"a0051f5d7f5f6545fc25c04de97dcf2e08c5f74300eae78f6fcc399945c1a99c"}],"field.mesh.d044968":[{"id":"assertion.field.mesh.d044968","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Regenerative Medicine as described in the captured NLM MeSH descriptor D044968","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Regenerative Medicine as: A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via TISSUE ENGINEERING ; CELL TRANSPLANTATION ; and ARTIFICIAL ORGANS and BIOARTIFICIAL ORGANS and tissues.","support":[{"end":677,"quote":"A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via\nTISSUE ENGINEERING\n;\nCELL TRANSPLANTATION\n; and\nARTIFICIAL ORGANS\nand\nBIOARTIFICIAL ORGANS\nand tissues.","source_id":"nlm-mesh.d044968","source_sha256":"1a74d258ccaec4713f439a4628bebbc10d87df4a1715cb4544c21a0cd88e653c","start":396}],"target_id":"field.mesh.d044968","target_kind":"node","target_sha256":"e4d2506bf0626ccd53623be466fe8c906b0339bf016cc40a8dc58947336240e0"}],"field.mesh.d049429":[{"id":"assertion.field.mesh.d049429","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Pathology as described in the captured NLM MeSH descriptor D049429","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Pathology as: The application of pathology to questions of law.","support":[{"end":514,"quote":"The application of pathology to questions of law.","source_id":"nlm-mesh.d049429","source_sha256":"1060f7d20f4aa72761b085911640934142e915a963387c43da5e31ea418ac41e","start":465}],"target_id":"field.mesh.d049429","target_kind":"node","target_sha256":"324faadcc8b823cae485ffd35a7c5d227b51680fd645d67dfc3dfecd63dd0fab"}],"field.mesh.d049690":[{"id":"assertion.field.mesh.d049690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Ancient as described in the captured NLM MeSH descriptor D049690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Ancient as: The period of history before 500 of the common era.","support":[{"end":493,"quote":"The period of history before 500 of the common era.","source_id":"nlm-mesh.d049690","source_sha256":"540f19bf7796754b686922cf3ebc3115fd7e11e278299c60e4a78de2d32163cf","start":442}],"target_id":"field.mesh.d049690","target_kind":"node","target_sha256":"f4838bd717a67235a0172a349a2d6d2c12ba0052b62f217fe2a36579cb01e30b"}],"field.mesh.d049691":[{"id":"assertion.field.mesh.d049691","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Medieval as described in the captured NLM MeSH descriptor D049691","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.","support":[{"end":466,"quote":"The period of history from the year 500 through 1450 of the common era.","source_id":"nlm-mesh.d049691","source_sha256":"78131ae2120040ed2e51df7a6266eae947d7938bd12b2c4576033e9027766566","start":395}],"target_id":"field.mesh.d049691","target_kind":"node","target_sha256":"8757bccce7a7886a890de78fc070bc859ca59b428f7e485c8bc0159bd1665481"}],"field.mesh.d049692":[{"id":"assertion.field.mesh.d049692","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Early Modern 1451-1600 as described in the captured NLM MeSH descriptor D049692","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Early Modern 1451-1600 as: The period of history from 1451 through 1600 of the common era.","support":[{"end":472,"quote":"The period of history from 1451 through 1600 of the common era.","source_id":"nlm-mesh.d049692","source_sha256":"6b559db671d65cc331407430f415e6eec906b361671d1a131ee9c1b1a0244966","start":409}],"target_id":"field.mesh.d049692","target_kind":"node","target_sha256":"3da27d4e210b5069a9266a1d7b57b38a436e837d0a9dbc1276b7425b4c61b4c7"}],"field.mesh.d049711":[{"id":"assertion.field.mesh.d049711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Modern 1601- as described in the captured NLM MeSH descriptor D049711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Modern 1601- as: The period of history from 1601 of the common era to the present.","support":[{"end":454,"quote":"The period of history from 1601 of the common era to the present.","source_id":"nlm-mesh.d049711","source_sha256":"32e801b75e430c8028bdabd7df1fce286a71a14bc7e2a3e54cd53d7250c25229","start":389}],"target_id":"field.mesh.d049711","target_kind":"node","target_sha256":"d84e4d80c9ea878a49d4462be7403ea0d096a83651e8b1996e8270ad668acdf3"}],"field.mesh.d052938":[{"id":"assertion.field.mesh.d052938","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bariatric Medicine as described in the captured NLM MeSH descriptor D052938","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bariatric Medicine as: The discipline concerned with WEIGHT REDUCTION in patients with OBESITY .","support":[{"end":501,"quote":"The discipline concerned with\nWEIGHT REDUCTION\nin patients with\nOBESITY\n.","source_id":"nlm-mesh.d052938","source_sha256":"baf7fe1aa98d23164d3f17adf9916a1fbcae5a4fc9561486517945c04a470a4c","start":428}],"target_id":"field.mesh.d052938","target_kind":"node","target_sha256":"6de5f94a89efcc5aa7a88880f634f8fc9d4850e045569dbc59d09132f6284e92"}],"field.mesh.d053593":[{"id":"assertion.field.mesh.d053593","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Toxicology as described in the captured NLM MeSH descriptor D053593","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Toxicology as: The application of TOXICOLOGY knowledge to questions of law.","support":[{"end":446,"quote":"The application of\nTOXICOLOGY\nknowledge to questions of law.","source_id":"nlm-mesh.d053593","source_sha256":"62e1af6618eadf3b7176eba08c7e90f286640dc4c3a72a0d2dfa0fd41956d890","start":386}],"target_id":"field.mesh.d053593","target_kind":"node","target_sha256":"43fe4e8dbfd85e6407f6f8fe5e123dd5e405eb4517c66fd40457a9eb366fff42"}],"field.mesh.d053803":[{"id":"assertion.field.mesh.d053803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Genetics as described in the captured NLM MeSH descriptor D053803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Genetics as: The application of genetic analyses and MOLECULAR DIAGNOSTIC TECHNIQUES to legal matters and crime analysis.","support":[{"end":482,"quote":"The application of genetic analyses and\nMOLECULAR DIAGNOSTIC TECHNIQUES\nto legal matters and crime analysis.","source_id":"nlm-mesh.d053803","source_sha256":"7ac667ad8bc60b3984d9b4bbbb4e2d18ebbd1f754affee679073a1efdcb50c14","start":374}],"target_id":"field.mesh.d053803","target_kind":"node","target_sha256":"086128751da630be8afb684e0d04564ace587c1937d3f03f1b828c70d374f82e"}],"field.mesh.d054597":[{"id":"assertion.field.mesh.d054597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disaster Medicine as described in the captured NLM MeSH descriptor D054597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disaster Medicine as: Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","support":[{"end":594,"quote":"Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","source_id":"nlm-mesh.d054597","source_sha256":"7f3d2b0d3fcfb906ed96692df63fe378e6cf42238ad98cb6065ee357664182da","start":401}],"target_id":"field.mesh.d054597","target_kind":"node","target_sha256":"7834000b8e94ef405352ece57e6c7660b9d4373b4ca7a696f6aa623fd353ca4c"}],"field.mesh.d054849":[{"id":"assertion.field.mesh.d054849","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiac Electrophysiology as described in the captured NLM MeSH descriptor D054849","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiac Electrophysiology as: The study of the electrical activity and characteristics of the HEART ; MYOCARDIUM ; and CARDIOMYOCYTES .","support":[{"end":603,"quote":"The study of the electrical activity and characteristics of the\nHEART\n;\nMYOCARDIUM\n; and\nCARDIOMYOCYTES\n.","source_id":"nlm-mesh.d054849","source_sha256":"e153f29ecdb34c79fcef46e58b2941c152d86841ae12a0e5526e6e6c0a033dac","start":498}],"target_id":"field.mesh.d054849","target_kind":"node","target_sha256":"aeead8f711be38bfb11bf0ca6cee6eb117ff09685493cd785839e6f996f75d74"}],"field.mesh.d055048":[{"id":"assertion.field.mesh.d055048","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Integrative Medicine as described in the captured NLM MeSH descriptor D055048","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Integrative Medicine as: The discipline concerned with using the combination of conventional allopathic medicine and ALTERNATIVE MEDICINE to address the biological, psychological, social, and spiritual aspects of health and illness.","support":[{"end":563,"quote":"The discipline concerned with using the combination of conventional allopathic medicine and\nALTERNATIVE MEDICINE\nto address the biological, psychological, social, and spiritual aspects of health and illness.","source_id":"nlm-mesh.d055048","source_sha256":"9bb6da1f8cc045d0bee029f4fb14f7f7c23e5b4c3463311c8ffab8ff72422573","start":356}],"target_id":"field.mesh.d055048","target_kind":"node","target_sha256":"94bdfff78b7d9cd9d86e95a2271836b18fbadf3b160b32260ab86f025dfd7956"}],"field.mesh.d055095":[{"id":"assertion.field.mesh.d055095","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optics and Photonics as described in the captured NLM MeSH descriptor D055095","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optics and Photonics as: A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating ELECTROMAGNETIC RADIATION in the visible, infrared, and ultraviolet range.","support":[{"end":806,"quote":"A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating\nELECTROMAGNETIC RADIATION\nin the visible, infrared, and ultraviolet range.","source_id":"nlm-mesh.d055095","source_sha256":"8c7133becec32656bd061b73d7df6e7e048b101b87d1966caaf2f21996cf2919","start":551}],"target_id":"field.mesh.d055095","target_kind":"node","target_sha256":"576328bb1c6221e67e91688688ef5ff0cedb189f3250c413535f888ce83b600a"}],"field.mesh.d055416":[{"id":"assertion.field.mesh.d055416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence-Based Emergency Medicine as described in the captured NLM MeSH descriptor D055416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence-Based Emergency Medicine as: A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in EMERGENCY MEDICINE . This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","support":[{"end":855,"quote":"A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in\nEMERGENCY MEDICINE\n. This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","source_id":"nlm-mesh.d055416","source_sha256":"826b4f94fed2138a43f6991258b9752e2e96283a9ca3f2564bd97d02036cdb3a","start":406}],"target_id":"field.mesh.d055416","target_kind":"node","target_sha256":"c88d015d7eb45c756a19b5ffbd1cd8aefd97fefc295fc8def4d894fc92c3bc8f"}],"field.mesh.d055552":[{"id":"assertion.field.mesh.d055552","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Infectious Disease Medicine as described in the captured NLM MeSH descriptor D055552","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Infectious Disease Medicine as: A branch of internal medicine concerned with the diagnosis and treatment of INFECTIOUS DISEASES .","support":[{"end":587,"quote":"A branch of internal medicine concerned with the diagnosis and treatment of\nINFECTIOUS DISEASES\n.","source_id":"nlm-mesh.d055552","source_sha256":"a32b37cad6b0fe37a7dc62861e77ef3716d28bc13c9f3cf1a560052782099a8c","start":490}],"target_id":"field.mesh.d055552","target_kind":"node","target_sha256":"99a441279d0aaeb3e04090eb7fe3adf6995237f7b1c7795ca848fc62be3a78a4"}],"field.mesh.d055616":[{"id":"assertion.field.mesh.d055616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microtechnology as described in the captured NLM MeSH descriptor D055616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microtechnology as: Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or MEMS . The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","support":[{"end":725,"quote":"Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or\nMEMS\n. The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","source_id":"nlm-mesh.d055616","source_sha256":"e76917cd6af6664ee9ce6f56b8de338d165eb570bfb3b62cfc3d2f822ed0e312","start":358}],"target_id":"field.mesh.d055616","target_kind":"node","target_sha256":"94375b04a6759b0510567522e851c35c784bfe9284f8c93cd60d73a076a3d2b8"}],"field.mesh.d055772":[{"id":"assertion.field.mesh.d055772","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Green Chemistry Technology as described in the captured NLM MeSH descriptor D055772","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Green Chemistry Technology as: Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","support":[{"end":570,"quote":"Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","source_id":"nlm-mesh.d055772","source_sha256":"f378ea002cc0db347173e25235ba4eb35c449e524e38f27bff029de8af1f61d4","start":368}],"target_id":"field.mesh.d055772","target_kind":"node","target_sha256":"306057c004d8aa7b9f2bed683f7a15722fa3fed7fcadbc4b0f01be0acde205d8"}],"field.mesh.d055813":[{"id":"assertion.field.mesh.d055813","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wilderness Medicine as described in the captured NLM MeSH descriptor D055813","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wilderness Medicine as: Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","support":[{"end":514,"quote":"Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","source_id":"nlm-mesh.d055813","source_sha256":"f65e8fbbf7daf20e7155e2349c185a89954cc02809ad55fa22a791f73e9513e8","start":354}],"target_id":"field.mesh.d055813","target_kind":"node","target_sha256":"57e863914b9d8d48daf31c3e9b9719483a8b0926143bddb558470b8b110492a2"}],"field.mesh.d056508":[{"id":"assertion.field.mesh.d056508","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sleep Medicine Specialty as described in the captured NLM MeSH descriptor D056508","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sleep Medicine Specialty as: A medical specialty concerned with the diagnosis and treatment of SLEEP WAKE DISORDERS and their causes.","support":[{"end":571,"quote":"A medical specialty concerned with the diagnosis and treatment of\nSLEEP WAKE DISORDERS\nand their causes.","source_id":"nlm-mesh.d056508","source_sha256":"caf12993076fa4a033697656284f82f9dce6966c7b10a6d9406e00f9c33c93ee","start":467}],"target_id":"field.mesh.d056508","target_kind":"node","target_sha256":"1374d6309800e98bbcbf2afb042edfde0f118168ea4f1a8243b807b6612f3ea9"}],"field.mesh.d057089":[{"id":"assertion.field.mesh.d057089","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Molecular as described in the captured NLM MeSH descriptor D057089","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Molecular as: A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","support":[{"end":602,"quote":"A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","source_id":"nlm-mesh.d057089","source_sha256":"04dd0a2d4fd5510da33ef0f0bf28672534d8eef02e30e94ca3f2db959219dcb5","start":501}],"target_id":"field.mesh.d057089","target_kind":"node","target_sha256":"ecb64923215868e7fae675ed6f2bbb43f6c78a5bfcd7d6116c5884413ea6b918"}],"field.mesh.d057236":[{"id":"assertion.field.mesh.d057236","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Travel Medicine as described in the captured NLM MeSH descriptor D057236","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Travel Medicine as: Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international TRAVEL . Key element of patient's pre-travel visit to the physician is a health risk assessment.","support":[{"end":728,"quote":"Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international\nTRAVEL\n. Key element of patient's pre-travel visit to the physician is a health risk assessment.","source_id":"nlm-mesh.d057236","source_sha256":"b11e957a9330b40f1e95b09eec3547f3cd1b4e454f0fc03635e02481e30ffcf9","start":522}],"target_id":"field.mesh.d057236","target_kind":"node","target_sha256":"90f20eac0229e6650207db0fca4551dc09ac42048aff23d950af37593c5caa7b"}],"field.mesh.d057285":[{"id":"assertion.field.mesh.d057285","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precision Medicine as described in the captured NLM MeSH descriptor D057285","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precision Medicine as: Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","support":[{"end":504,"quote":"Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","source_id":"nlm-mesh.d057285","source_sha256":"b714d014ec0a4e5ce92501007cba6da1226d163096269255cc5be5c902d70a2b","start":364}],"target_id":"field.mesh.d057285","target_kind":"node","target_sha256":"9d29e6198b138139828922c4027e5cd16ba6a53e8236ac66b357d3dc9e573ec6"}],"field.mesh.d057909":[{"id":"assertion.field.mesh.d057909","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orthognathic Surgery as described in the captured NLM MeSH descriptor D057909","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orthognathic Surgery as: A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related MAXILLOFACIAL ABNORMALITIES (e.g., CLEFT PALATE ; RETROGNATHISM ).","support":[{"end":637,"quote":"A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related\nMAXILLOFACIAL ABNORMALITIES\n(e.g.,\nCLEFT PALATE\n;\nRETROGNATHISM\n).","source_id":"nlm-mesh.d057909","source_sha256":"b1ea1aed038e4498fd5251afcc06e6327fc27644ed56cf57fbd7626714fad7be","start":456}],"target_id":"field.mesh.d057909","target_kind":"node","target_sha256":"ede92d17d9cb52c2bb9ab659728319c66176513a1562feceaff027a969f75979"}],"field.mesh.d058006":[{"id":"assertion.field.mesh.d058006","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"General Practice as described in the captured NLM MeSH descriptor D058006","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes General Practice as: Patient-based medical care provided across age and gender or specialty boundaries.","support":[{"end":430,"quote":"Patient-based medical care provided across age and gender or specialty boundaries.","source_id":"nlm-mesh.d058006","source_sha256":"bca72062757ded9e4a73d102fffe6af7a515baf1b0635fedff142e3cc4f3cdfa","start":348}],"target_id":"field.mesh.d058006","target_kind":"node","target_sha256":"2d3f9552dc50acafaf7db8c3c1bcf637abade81668a1c53f3db0c6c91b0ffdbc"}],"field.mesh.d058027":[{"id":"assertion.field.mesh.d058027","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuropsychiatry as described in the captured NLM MeSH descriptor D058027","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuropsychiatry as: A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","support":[{"end":720,"quote":"A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","source_id":"nlm-mesh.d058027","source_sha256":"5ca359ee5e6c822d918c194841fc9ef6d88df105cd54cc7d7459435525c7f529","start":392}],"target_id":"field.mesh.d058027","target_kind":"node","target_sha256":"de73c1161352264dda145127ee58bd3642fc967747f62b2331b208d7e993213e"}],"field.mesh.d058615":[{"id":"assertion.field.mesh.d058615","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Synthetic Biology as described in the captured NLM MeSH descriptor D058615","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Synthetic Biology as: A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","support":[{"end":686,"quote":"A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","source_id":"nlm-mesh.d058615","source_sha256":"9681b043a4597b02956482cbcc7813d3f5616dfcc48a3a559fe5eab7200f64a6","start":525}],"target_id":"field.mesh.d058615","target_kind":"node","target_sha256":"f071a775557b28f90636178a2ca9cafbfdbbd23948065f6afedf78f7a7249dff"}],"field.mesh.d060432":[{"id":"assertion.field.mesh.d060432","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anthropology, Medical as described in the captured NLM MeSH descriptor D060432","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anthropology, Medical as: Field of social science that is concerned with differences between human groups as related to health status and beliefs.","support":[{"end":601,"quote":"Field of social science that is concerned with differences between human groups as related to health status and beliefs.","source_id":"nlm-mesh.d060432","source_sha256":"8b77f264e12017995e0fe7db1dc5ef354757102c428151a61c7ed03cecef8019","start":481}],"target_id":"field.mesh.d060432","target_kind":"node","target_sha256":"d5500aeb7460304954f67131745f09af92e929e8de682615cd739dc6f243c95a"}],"field.mesh.d062306":[{"id":"assertion.field.mesh.d062306","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geography, Medical as described in the captured NLM MeSH descriptor D062306","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geography, Medical as: The area of medicine concerned with the effects on health and disease due to geographic factors such as CLIMATE , environmental conditions, and geographic location.","support":[{"end":630,"quote":"The area of medicine concerned with the effects on health and disease due to geographic factors such as\nCLIMATE\n, environmental conditions, and geographic location.","source_id":"nlm-mesh.d062306","source_sha256":"0c220a7d59322054e96e76fa9c71f140f4fa556784fc4f573bea29c083ad2fef","start":466}],"target_id":"field.mesh.d062306","target_kind":"node","target_sha256":"c57ddc27e717a33d2eba06a4158190ea22da978179200948f5b99883f4483c5f"}],"field.mesh.d062346":[{"id":"assertion.field.mesh.d062346","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Medicine as described in the captured NLM MeSH descriptor D062346","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Medicine as: The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize MOLECULAR BIOLOGY techniques.","support":[{"end":680,"quote":"The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize\nMOLECULAR BIOLOGY\ntechniques.","source_id":"nlm-mesh.d062346","source_sha256":"6fcc592969bd46ad27127d66c0d9810376dd9c06f9e4518d5ac19cb2723abfcd","start":481}],"target_id":"field.mesh.d062346","target_kind":"node","target_sha256":"fc2291ddbf7762091eda0cf2f78198bd49dbf214f67a53e9e4ba66bbc7630b9f"}],"field.mesh.d063165":[{"id":"assertion.field.mesh.d063165","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurotology as described in the captured NLM MeSH descriptor D063165","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurotology as: A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","support":[{"end":497,"quote":"A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","source_id":"nlm-mesh.d063165","source_sha256":"cfb77e5b443211780a844323751450dcabd1dd1fa87e651bb962ef8d6a6976f3","start":400}],"target_id":"field.mesh.d063165","target_kind":"node","target_sha256":"8355fb293d6f71304faedd17c83ed25f1baf88323d5f63f4cfbf42c72905f6c7"}],"field.mesh.d064132":[{"id":"assertion.field.mesh.d064132","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sports Nutritional Sciences as described in the captured NLM MeSH descriptor D064132","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sports Nutritional Sciences as: The study of NUTRITION PROCESSES during EXERCISE and ATHLETIC PERFORMANCE as well as specific NUTRITIONAL REQUIREMENTS of ATHLETES and the relationship between NUTRITIONAL STATUS and NUTRITION DISORDERS in athletes.","support":[{"end":601,"quote":"The study of\nNUTRITION PROCESSES\nduring\nEXERCISE\nand\nATHLETIC PERFORMANCE\nas well as specific\nNUTRITIONAL REQUIREMENTS\nof\nATHLETES\nand the relationship between\nNUTRITIONAL STATUS\nand\nNUTRITION DISORDERS\nin athletes.","source_id":"nlm-mesh.d064132","source_sha256":"c1bdee8c0a1d00e1dd3200c49ed82bddc69b42167614ef7cee7dd33613940764","start":386}],"target_id":"field.mesh.d064132","target_kind":"node","target_sha256":"1b61cf60eb5c9301d7f8da240bb0267950160aefcf6ba313a72fe6f80342ad7d"}],"field.mesh.d064416":[{"id":"assertion.field.mesh.d064416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hospital Medicine as described in the captured NLM MeSH descriptor D064416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hospital Medicine as: The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","support":[{"end":746,"quote":"The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","source_id":"nlm-mesh.d064416","source_sha256":"422d4842c83f89d1da6a17edf8711b7bfdbfb7c4555cd821da0871f5c5c97c6d","start":388}],"target_id":"field.mesh.d064416","target_kind":"node","target_sha256":"0d4250d7a5e696fedf2dc369505bbe5113a540f00a97f8ebd7a241d8c1972116"}],"field.mesh.d064796":[{"id":"assertion.field.mesh.d064796","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Veterinary Sports Medicine as described in the captured NLM MeSH descriptor D064796","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Veterinary Sports Medicine as: The field of veterinary medicine concerned with PHYSICAL FITNESS of animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","support":[{"end":565,"quote":"The field of veterinary medicine concerned with\nPHYSICAL FITNESS\nof animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","source_id":"nlm-mesh.d064796","source_sha256":"abf0769da9470ee5daf1628610b5b239d4b86740ffa4aacbf98dfe012b88b464","start":384}],"target_id":"field.mesh.d064796","target_kind":"node","target_sha256":"3940e9bb2c50daec9a62280d8350574900292976afeb0c0cbafb577cf149e7ed"}],"field.mesh.d064826":[{"id":"assertion.field.mesh.d064826","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Transfusion Medicine as described in the captured NLM MeSH descriptor D064826","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Transfusion Medicine as: The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from BLOOD TRANSFUSION errors.","support":[{"end":538,"quote":"The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from\nBLOOD TRANSFUSION\nerrors.","source_id":"nlm-mesh.d064826","source_sha256":"7ea145d71818c193c91b1db89c0bb1a4ef7dcef272847c39701fa4507dfcb2d7","start":364}],"target_id":"field.mesh.d064826","target_kind":"node","target_sha256":"286441e3e2b20c8e470d992bda9b23c75c874e1246e9be39684c38d03cc64d5b"}],"field.mesh.d065126":[{"id":"assertion.field.mesh.d065126","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Palliative Medicine as described in the captured NLM MeSH descriptor D065126","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Palliative Medicine as: A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","support":[{"end":630,"quote":"A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","source_id":"nlm-mesh.d065126","source_sha256":"7c12e1eed57af860407b7fa3ef142ca60b10a7002c29256e98ce7b6d2b1dd7c8","start":422}],"target_id":"field.mesh.d065126","target_kind":"node","target_sha256":"8760bf8ae6135d2f68c93cb9650bc98440efefa0ad0d28ba204ed55eace9cbe4"}],"field.mesh.d066291":[{"id":"assertion.field.mesh.d066291","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychiatry in Literature as described in the captured NLM MeSH descriptor D066291","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychiatry in Literature as: Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","support":[{"end":637,"quote":"Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","source_id":"nlm-mesh.d066291","source_sha256":"e42a10713615e21661896e2cc6223c1c57df9468ba2566ec2b6f5c29c58bc424","start":498}],"target_id":"field.mesh.d066291","target_kind":"node","target_sha256":"cfb5559c5d678e28775f4e56f380851d309cfcaea2ae3432b6887b0bf13bd7c7"}],"field.microbiology":[{"id":"assertion.complete.field.microbiology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Microbiology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Microbiology as: Branch of biology dealing with organisms too small to be seen without the use of a microscope.","support":[{"end":194,"quote":"Branch of biology dealing with organisms too small to be seen without the use of a microscope.","source_id":"usgs-thesaurus.dcab6f768c008f0c2c69","source_sha256":"0b76bb3b937cda900c15b3fb20f98125b2750c987d1af71a99b427b72a2bad41","start":100}],"target_id":"field.microbiology","target_kind":"node","target_sha256":"915220248c92e14251ac41b3ef841466140391beb5a09b6c40237ee398f4e78a"}],"field.molecular-biology":[{"id":"assertion.complete.field.molecular-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Molecular biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Molecular biology as: Branch of biology concerned with the study of physiology at the molecular level.","support":[{"end":190,"quote":"Branch of biology concerned with the study of physiology at the molecular level.","source_id":"usgs-thesaurus.d2d1d971931c29ceef7f","source_sha256":"adab88904576f799cca8153007b3d33faa05a2f0a588251a28ffad1044cdd210","start":110}],"target_id":"field.molecular-biology","target_kind":"node","target_sha256":"73e7cbc441014179c5d99bdbb329bc93147f2b2320bca41722dbc78f43bd42d6"}],"field.philosophy":[{"id":"assertion.complete.field.philosophy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Philosophy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Philosophy as: A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","support":[{"end":439,"quote":"A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","source_id":"nlm-mesh.ed675d30c3b71c4b6263","source_sha256":"05bbf9751db0e1573d1130c6e9c7eaaf9e4f58089badc5ca5d86bd4912a4fb72","start":332}],"target_id":"field.philosophy","target_kind":"node","target_sha256":"deb93e9a15176a2071c3d801ea08f37dcb755fff7f4b07849bde50b9cd3ef46a"}],"field.physics":[{"id":"assertion.complete.field.physics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Physics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Physics as: The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":654,"quote":"The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.c9083b1f6c559b444afe","source_sha256":"d7fb365d079f2c81c4f52226663dff89309701eb570a919a631d227c0738e2e8","start":491}],"target_id":"field.physics","target_kind":"node","target_sha256":"1d9feb5b691def0e4dbe4c8cf826e7a8ca68acec1a24a68aa3ec2899a59a5889"}],"field.psychology":[{"id":"assertion.complete.field.psychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychology as: The science dealing with the study of mental processes and behavior in man and animals.","support":[{"end":545,"quote":"The science dealing with the study of mental processes and behavior in man and animals.","source_id":"nlm-mesh.7d823551929a4fc3072e","source_sha256":"59a71455c76b75dc90035af6099231e367076aaef0bc0fdf2abe3c97fc5f9400","start":458}],"target_id":"field.psychology","target_kind":"node","target_sha256":"b2512b868d6c7dcf0c609b3a3d64bd481d5204d9c0cbc8f23096447d30e02ea1"}],"field.sociology":[{"id":"assertion.complete.field.sociology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sociology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sociology as: A social science dealing with group relationships, patterns of collective behavior, and social organization.","support":[{"end":621,"quote":"A social science dealing with group relationships, patterns of collective behavior, and social organization.","source_id":"nlm-mesh.902611a238e10eb5c9bf","source_sha256":"fdb12adac755ce34630509204ce61e38eddeb47d64cec43b55f0f3c27f4e433f","start":513}],"target_id":"field.sociology","target_kind":"node","target_sha256":"952a2e4d52876c8b75142592cde4845d0b5f26b1ed6f6dd306d94d03a1bb1015"}],"field.systems-biology":[{"id":"assertion.complete.field.systems-biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Systems biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Systems biology as: Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","support":[{"end":605,"quote":"Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","source_id":"nlm-mesh.ac32a89227fa482fcba6","source_sha256":"5f220ee076569ea7d8397594e104a2f4fe9881f69a65d579c1b67d0f6213b5b9","start":354}],"target_id":"field.systems-biology","target_kind":"node","target_sha256":"c1e551ef958b2df921a7f1cf7896cc59c4c4c28d0c7683db0bdf59e0d6e138d2"}],"field.usgs.1025":[{"id":"assertion.field.usgs.1025","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea-floor characteristics as defined in the captured USGS Thesaurus term 1025","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea-floor characteristics as: Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor. This category is also used for ocean bottom characteristics , sea floor characteristics , and seafloor characteristics","support":[{"end":525,"quote":"Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor.\nThis category is also used for\nocean bottom characteristics\n,\nsea floor characteristics\n, and\nseafloor characteristics","source_id":"usgs-thesaurus.1025","source_sha256":"e17d221caac2dd6df199f7ed4a705bac6317d8d459b17400afcf4a5432b654d3","start":156}],"target_id":"field.usgs.1025","target_kind":"node","target_sha256":"4c5181549481c37a48f438ddc1d7172891a26dccb66d9f596b89551ca78c541f"}],"field.usgs.1081":[{"id":"assertion.field.usgs.1081","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil sciences as defined in the captured USGS Thesaurus term 1081","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil sciences as: Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils. This category is also used for pedology (soils)","support":[{"end":262,"quote":"Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils.\nThis category is also used for\npedology (soils)","source_id":"usgs-thesaurus.1081","source_sha256":"d4653d5d35e5aae8bd21f5ab80b6099bc2d212327b44107f8211ed61c0eda6c9","start":103}],"target_id":"field.usgs.1081","target_kind":"node","target_sha256":"1c3740d5325c184fbaa9e905dd1d2d436afd6d74fe9d4d0d47e6ee281aabd91b"}],"field.usgs.1117":[{"id":"assertion.field.usgs.1117","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Structural geology as defined in the captured USGS Thesaurus term 1117","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Structural geology as: Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","support":[{"end":223,"quote":"Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","source_id":"usgs-thesaurus.1117","source_sha256":"95df20c1babf3252b77c9c4260d51d08b1e40f79ee1f0e83f0cc539ff34c421d","start":123}],"target_id":"field.usgs.1117","target_kind":"node","target_sha256":"875e4bcbd749f07eced37c0038693cdabbb41e1073970d5605607583724e9518"}],"field.usgs.115":[{"id":"assertion.field.usgs.115","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biostratigraphy as defined in the captured USGS Thesaurus term 115","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biostratigraphy as: Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","support":[{"end":248,"quote":"Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","source_id":"usgs-thesaurus.115","source_sha256":"2b45b2440d097fd5a5f3646703be8d4894640e7ef694c8596043f96930e5bcbb","start":132}],"target_id":"field.usgs.115","target_kind":"node","target_sha256":"670354572cc65a23aba671ccecd0fbfbaff46490dc2b1b4403806dcd8b97d0bc"}],"field.usgs.1176":[{"id":"assertion.field.usgs.1176","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Topography as defined in the captured USGS Thesaurus term 1176","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief","support":[{"end":202,"quote":"Configuration of the land surface and sea floor.\nThis category is also used for\nelevation and relief","source_id":"usgs-thesaurus.1176","source_sha256":"b3c1190ab4358443f78ca711a3b5b3a8fb3c822547e89ec1002ffb7cc3bf720c","start":102}],"target_id":"field.usgs.1176","target_kind":"node","target_sha256":"6a0fe2bec2f4e51fffa31da4d84809586ad4a6204d43737c2f1458d5e504a2f0"}],"field.usgs.1267":[{"id":"assertion.field.usgs.1267","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Vertebrate paleontology as defined in the captured USGS Thesaurus term 1267","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Vertebrate paleontology as: Branch of paleontology dealing with fossil animals that have spinal columns.","support":[{"end":214,"quote":"Branch of paleontology dealing with fossil animals that have spinal columns.","source_id":"usgs-thesaurus.1267","source_sha256":"c7316b1c931eb4c7bfaeaebbfdd38be025b578e57a98a6930451f69563a1a009","start":138}],"target_id":"field.usgs.1267","target_kind":"node","target_sha256":"328fe484d362946c588db006ba93c0e5ae71e8dc9845b7c0c4a8dd4a961ca3ac"}],"field.usgs.1678":[{"id":"assertion.field.usgs.1678","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrodynamics as defined in the captured USGS Thesaurus term 1678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics","support":[{"end":214,"quote":"Principles of fluid dynamics applied to water bodies.\nThis category is also used for\nfluid dynamics","source_id":"usgs-thesaurus.1678","source_sha256":"cf3bddf3c38503680c31da711d4cb10a9748f34555a0776c88b814380d29b6f4","start":115}],"target_id":"field.usgs.1678","target_kind":"node","target_sha256":"50f4fcdbd6462e4dcc338904559d1897e05833d24f73e12394561668a98853f6"}],"field.usgs.1679":[{"id":"assertion.field.usgs.1679","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleogeography as defined in the captured USGS Thesaurus term 1679","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleogeography as: Study of the history of earth surface characteristics; geomorphology in the past.","support":[{"end":198,"quote":"Study of the history of earth surface characteristics; geomorphology in the past.","source_id":"usgs-thesaurus.1679","source_sha256":"3a4aa8fca56d1dadcbf6ccaf1b16a80e200e87da68f127aa512dad00bd7a8547","start":117}],"target_id":"field.usgs.1679","target_kind":"node","target_sha256":"0ae1822e3ca728ce1e8e11f8f2ab4091bc2236d44119f01ebdb671d1c8659c1b"}],"field.usgs.2090":[{"id":"assertion.field.usgs.2090","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lakebed characteristics as defined in the captured USGS Thesaurus term 2090","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lakebed characteristics as: Characteristics of the bottom of inland bodies of water. This category is also used for lake-bed characteristics , lake-bottom characteristics , and lake-floor characteristics","support":[{"end":303,"quote":"Characteristics of the bottom of inland bodies of water.\nThis category is also used for\nlake-bed characteristics\n,\nlake-bottom characteristics\n, and\nlake-floor characteristics","source_id":"usgs-thesaurus.2090","source_sha256":"d79926b0e705be6481e2b3fbf72f18375a4c9e137a229f95421ef87e2afd291c","start":128}],"target_id":"field.usgs.2090","target_kind":"node","target_sha256":"31708f59572a04ccf5482cb24eb161c99f3c36629bde0c84e5904b353a787777"}],"field.usgs.287":[{"id":"assertion.field.usgs.287","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth characteristics as defined in the captured USGS Thesaurus term 287","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth characteristics as: The measurable, definable properties and features of the earth.","support":[{"end":163,"quote":"The measurable, definable properties and features of the earth.","source_id":"usgs-thesaurus.287","source_sha256":"ca69641e4049c03a1b1e956e22d0562d1d89ba1a4c4a828392ca643a22806f10","start":100}],"target_id":"field.usgs.287","target_kind":"node","target_sha256":"4dae575ad77550ea75aec43cbdbe99daf65e8d907165e1f80419d6f5c2af343b"}],"field.usgs.288":[{"id":"assertion.field.usgs.288","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth history as defined in the captured USGS Thesaurus term 288","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth history as: The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","support":[{"end":310,"quote":"The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","source_id":"usgs-thesaurus.288","source_sha256":"d267e5d8f2f156690d8315000fea4efd1d8895ff91e2181979c0ad89c4f14a21","start":127}],"target_id":"field.usgs.288","target_kind":"node","target_sha256":"073d1faff4c914b71276fec14653e70f3f3d69fa3965822b20d04c4f4002a388"}],"field.usgs.291":[{"id":"assertion.field.usgs.291","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth sciences as defined in the captured USGS Thesaurus term 291","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth sciences as: Broad term for all science related to the study of the earth. This category is also used for geosciences","support":[{"end":192,"quote":"Broad term for all science related to the study of the earth.\nThis category is also used for\ngeosciences","source_id":"usgs-thesaurus.291","source_sha256":"b7f78697d0e8f3f15deb65da9938400fd83602bcd998c8ec1cf8ef6683825c19","start":88}],"target_id":"field.usgs.291","target_kind":"node","target_sha256":"208319c6c928294626bd07bbad0eacaba77024144e7ac7f2445b7885b734b29c"}],"field.usgs.312":[{"id":"assertion.field.usgs.312","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Economic geology as defined in the captured USGS Thesaurus term 312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Economic geology as: Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","support":[{"end":250,"quote":"Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","source_id":"usgs-thesaurus.312","source_sha256":"51e4419db6331bc323a253384d883f816a3364290f1f237d9b7bf8ec44711ec5","start":119}],"target_id":"field.usgs.312","target_kind":"node","target_sha256":"e15e01d94cd1b435efedddbe680bb99b38ed6eaad25a1c8fe0a620c00fbc34a7"}],"field.usgs.447":[{"id":"assertion.field.usgs.447","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geography as defined in the captured USGS Thesaurus term 447","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geography as: Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations. This category is also used for geographic information sciences","support":[{"end":319,"quote":"Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations.\nThis category is also used for\ngeographic information sciences","source_id":"usgs-thesaurus.447","source_sha256":"664bef5d57d566dbd756206e387941ad2795894f175a389476d6b340a5516698","start":95}],"target_id":"field.usgs.447","target_kind":"node","target_sha256":"eb461a8fcc6d35fbb3ef65fd859fd8f530086383ac5f46f6dee22a64bab4cb51"}],"field.usgs.455":[{"id":"assertion.field.usgs.455","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic history as defined in the captured USGS Thesaurus term 455","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic history as: Record (and inferred reconstruction) of the origin and development of the earth since its formation. This category is also used for chronostratigraphy and geohistory","support":[{"end":279,"quote":"Record (and inferred reconstruction) of the origin and development of the earth since its formation.\nThis category is also used for\nchronostratigraphy\nand\ngeohistory","source_id":"usgs-thesaurus.455","source_sha256":"1b7fbcc7c672b3f1976d709e16eb6fa54aefa27cd1a16790579d0d0a83d94e17","start":114}],"target_id":"field.usgs.455","target_kind":"node","target_sha256":"b440ddbce6d18be15af2beb4874d83a25ea8fe278e909e709101f0ace4621f9d"}],"field.usgs.470":[{"id":"assertion.field.usgs.470","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geophysics as defined in the captured USGS Thesaurus term 470","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geophysics as: Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere. This category is also used with maps and atlases for geophysical maps","support":[{"end":269,"quote":"Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere.\nThis category is also used with\nmaps and atlases\nfor\ngeophysical maps","source_id":"usgs-thesaurus.470","source_sha256":"7778c51494b82021e1b34d4767226e65fbb9239a34878dae377f5cf79276020e","start":97}],"target_id":"field.usgs.470","target_kind":"node","target_sha256":"c51aa604eb5ad24ecab06f9519bdcd43dba7a70f40f72cc3bd19c665dc8d53b4"}],"field.usgs.604":[{"id":"assertion.field.usgs.604","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Invertebrate paleontology as defined in the captured USGS Thesaurus term 604","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Invertebrate paleontology as: Branch of paleontology which deals with fossil animals without backbones.","support":[{"end":215,"quote":"Branch of paleontology which deals with fossil animals without backbones.","source_id":"usgs-thesaurus.604","source_sha256":"3106464fc4d51b5f0e3070e4cd5033d7897f53444859cd41775577132c793a45","start":142}],"target_id":"field.usgs.604","target_kind":"node","target_sha256":"4ccbc627db26df49221f273cfee899ac40ebbf67093ca7158903ae2aceb01dcc"}],"field.usgs.626":[{"id":"assertion.field.usgs.626","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Land surface characteristics as defined in the captured USGS Thesaurus term 626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Land surface characteristics as: Features and attributes of earth's land surface. This category is also used for landscape and physiography","support":[{"end":244,"quote":"Features and attributes of earth's land surface.\nThis category is also used for\nlandscape\nand\nphysiography","source_id":"usgs-thesaurus.626","source_sha256":"d80fde4161c55c1e07cdd9e0e6723b5daa2f80041c399712d22d8783c2615e0d","start":138}],"target_id":"field.usgs.626","target_kind":"node","target_sha256":"87f33e5c50676908f5ed3ba335b925d71aca7996313804d2a7dce7fb49148b69"}],"field.usgs.668":[{"id":"assertion.field.usgs.668","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lithostratigraphy as defined in the captured USGS Thesaurus term 668","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lithostratigraphy as: Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","support":[{"end":340,"quote":"Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","source_id":"usgs-thesaurus.668","source_sha256":"cfb4912f5deded9b30e8f13498a9cd9879468aa306449f5ae3530cdf4f5d7f0a","start":136}],"target_id":"field.usgs.668","target_kind":"node","target_sha256":"7aeb68ded789a8c470bd49e353d1310a78c5f720821add1c140b7f4b595ada1f"}],"field.usgs.68":[{"id":"assertion.field.usgs.68","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric sciences as defined in the captured USGS Thesaurus term 68","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","support":[{"end":212,"quote":"Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","source_id":"usgs-thesaurus.68","source_sha256":"b8c85cc1a3d428338236db0abc875209a315cf8419890925be55b016cecb4dbc","start":117}],"target_id":"field.usgs.68","target_kind":"node","target_sha256":"c2d1e3e57171ec7d1a1d7885d528d21a4945cc5a1bc041f2a5dc956288616126"}],"field.usgs.706":[{"id":"assertion.field.usgs.706","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine geology as defined in the captured USGS Thesaurus term 706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine geology as: Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin. This category is also used for geological oceanography","support":[{"end":304,"quote":"Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin.\nThis category is also used for\ngeological oceanography","source_id":"usgs-thesaurus.706","source_sha256":"96683ccc8136bc657fc18a5f3b50638a1632d67e8279a6f86e71b14468aaf9a4","start":115}],"target_id":"field.usgs.706","target_kind":"node","target_sha256":"491f6aee5ca67fcb2847c6fb24e3eacebe58f5897142321282b7f404b9f34a34"}],"field.usgs.707":[{"id":"assertion.field.usgs.707","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine geophysics as defined in the captured USGS Thesaurus term 707","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine geophysics as: Branch of earth sciences concerned with the physical processes of the oceans and continental margins. We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","support":[{"end":321,"quote":"Branch of earth sciences concerned with the physical processes of the oceans and continental margins.  We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","source_id":"usgs-thesaurus.707","source_sha256":"1d79c58d6fc69b4b8b3cadff42431981ff63d7afe1acda7489a6abc3bef84d12","start":124}],"target_id":"field.usgs.707","target_kind":"node","target_sha256":"71e712f4b1ed9834137e6b93690b5cb1d72ebd75b63e280ffec2295d61a2f7b4"}],"field.usgs.738":[{"id":"assertion.field.usgs.738","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Micropaleontology as defined in the captured USGS Thesaurus term 738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Micropaleontology as: Branch of paleontology dealing with fossils too small to be seen without a microscope.","support":[{"end":212,"quote":"Branch of paleontology dealing with fossils too small to be seen without a microscope.","source_id":"usgs-thesaurus.738","source_sha256":"cf4d5c915642a1f6c02800a88b07371934ae7ef6c0ad77fdcf1210073d43ea62","start":126}],"target_id":"field.usgs.738","target_kind":"node","target_sha256":"9be2f07b9606d4a21e443d40b7ae79542f5aefc7feaff6784d2ae8377079e30d"}],"field.usgs.810":[{"id":"assertion.field.usgs.810","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean characteristics as defined in the captured USGS Thesaurus term 810","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean characteristics as: The attributes and process of seas and oceans. This category is also used for ocean mixed-layer depth , with field inventory and monitoring for ocean monitoring , ocean surface characteristics , with ocean processes for oceans , and sea surface reflectance","support":[{"end":382,"quote":"The attributes and process of seas and oceans.\nThis category is also used for\nocean mixed-layer depth\n,  with\nfield inventory and monitoring\nfor\nocean monitoring\n,\nocean surface characteristics\n,  with\nocean processes\nfor\noceans\n, and\nsea surface reflectance","source_id":"usgs-thesaurus.810","source_sha256":"243247b1d2abf76416d468177c095a46ff5afeeef623047a426a43639aa49f67","start":124}],"target_id":"field.usgs.810","target_kind":"node","target_sha256":"d62ee1366694c8034d76b3e71f4fcd3d7036fc7b424f6e15ac2ddb19eaf00965"}],"field.usgs.818":[{"id":"assertion.field.usgs.818","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean sciences as defined in the captured USGS Thesaurus term 818","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean sciences as: Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans. This category is also used for oceanography and physical oceanography","support":[{"end":300,"quote":"Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans.\nThis category is also used for\noceanography\nand\nphysical oceanography","source_id":"usgs-thesaurus.818","source_sha256":"9ce96247834363de427791996e64a8dae6069a6dfe5a6f5c2a28abae682f9224","start":105}],"target_id":"field.usgs.818","target_kind":"node","target_sha256":"41dff1d87ded5db4c205f31137d6f5d76d85320f97aa294c70e2950639163837"}],"field.usgs.859":[{"id":"assertion.field.usgs.859","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleoceanography as defined in the captured USGS Thesaurus term 859","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleoceanography as: Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","support":[{"end":235,"quote":"Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","source_id":"usgs-thesaurus.859","source_sha256":"870c4912c73a119d43e4882fb871f8c64f8c4c819d32841d9a8c928c8d07ecdc","start":126}],"target_id":"field.usgs.859","target_kind":"node","target_sha256":"53444b4b7a32db68072a3d50849a7c93cc8941d30f22f3813d431e020a74ef1b"}],"field.usgs.862":[{"id":"assertion.field.usgs.862","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleoseismology as defined in the captured USGS Thesaurus term 862","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleoseismology as: Branch of seismology concerned with ancient earthquakes. Clues which indicate seismic activities in the geologic past are used to date and determine the effects of those earthquakes.","support":[{"end":317,"quote":"Branch of seismology concerned with ancient earthquakes.  Clues which indicate seismic activities in the geologic past are used  to date and determine the effects of those earthquakes.","source_id":"usgs-thesaurus.862","source_sha256":"ff23d3bf2bfa647b7d5bee8cd7fd69332107162248174a3c53c7dadeade8783e","start":133}],"target_id":"field.usgs.862","target_kind":"node","target_sha256":"f8f375f9f8ce88ff742a3996d2e674d4827aedf1e25e01057ab15f6bd885d030"}],"field.wikipedia.abstract-algebra":[{"id":"assertion.field.wikipedia.abstract-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract algebra\", CC BY-SA 4.0) states: In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","support":[{"end":285,"quote":"In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","source_id":"wikipedia.article.abstract-algebra","source_sha256":"b914c6a89315c6af5de93ae44b2135dfb69092646db6351dd47bc6cda45a1235","start":104}],"target_id":"field.wikipedia.abstract-algebra","target_kind":"node","target_sha256":"3011d24281af85fc68e76ce6aa6985e0ab710e6547debdd5b174293d0d310976"}],"field.wikipedia.acoustical-engineering":[{"id":"assertion.field.wikipedia.acoustical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustical engineering\", CC BY-SA 4.0) states: Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","support":[{"end":230,"quote":"Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","source_id":"wikipedia.article.acoustical-engineering","source_sha256":"3d0e12508dc3985a2b8b0ccd3bf4bae12660abee32b015b9d7575c5353b57962","start":108}],"target_id":"field.wikipedia.acoustical-engineering","target_kind":"node","target_sha256":"49f188d38522cbe0b8fb2fb92384a416b82ef2c5cea278c323fa88eabdd2fc30"}],"field.wikipedia.aerospace-engineering":[{"id":"assertion.field.wikipedia.aerospace-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace engineering\", CC BY-SA 4.0) states: Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","support":[{"end":225,"quote":"Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","source_id":"wikipedia.article.aerospace-engineering","source_sha256":"43d820ee7a74c974fff38dcb315a38a234be6df25ff838e313e40c9f23fed314","start":109}],"target_id":"field.wikipedia.aerospace-engineering","target_kind":"node","target_sha256":"32237d3a99013f588b68a341515246b39a4fe1b539fd895b462cad723ae754d2"}],"field.wikipedia.agnoiology":[{"id":"assertion.field.wikipedia.agnoiology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agnoiology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agnoiology\", CC BY-SA 4.0) states: Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \"unknowable\" (as distinct from \"unknown\").","support":[{"end":317,"quote":"Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \\\"unknowable\\\" (as distinct from \\\"unknown\\\").","source_id":"wikipedia.article.agnoiology","source_sha256":"ad2eb372d28b3d1b2c2cbe7a5017ece7e2147d0b22402a86de63658cbb76ec84","start":98}],"target_id":"field.wikipedia.agnoiology","target_kind":"node","target_sha256":"51eb8810b8f468423d5b1812a84c5c3b0bbe681f4e89f861c53b40cfd7ab904f"}],"field.wikipedia.agricultural-engineering":[{"id":"assertion.field.wikipedia.agricultural-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agricultural engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agricultural engineering\", CC BY-SA 4.0) states: Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","support":[{"end":570,"quote":"Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","source_id":"wikipedia.article.agricultural-engineering","source_sha256":"ccc6297b61bd7b28cbb653e5a4609fa1d68801ea409cdc182a89195105b07cca","start":112}],"target_id":"field.wikipedia.agricultural-engineering","target_kind":"node","target_sha256":"00cdac86ed1529f936f92cc43d1720f0faa5cfd53305f74bf283eeaeeebf1e0c"}],"field.wikipedia.alethiology":[{"id":"assertion.field.wikipedia.alethiology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alethiology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alethiology\", CC BY-SA 4.0) states: Alethiology (or alethology, \"the study of aletheia\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","support":[{"end":263,"quote":"Alethiology (or alethology, \\\"the study of aletheia\\\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","source_id":"wikipedia.article.alethiology","source_sha256":"a253660a7045cc063f335ad9900821b5c2cc5c48a98b0e849dbfedec249d382a","start":98}],"target_id":"field.wikipedia.alethiology","target_kind":"node","target_sha256":"561632bc950746151e3c2237cca9b13a88137775afe49c0f2c147e630a259424"}],"field.wikipedia.algebraic-analysis":[{"id":"assertion.field.wikipedia.algebraic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic analysis\", CC BY-SA 4.0) states: Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","support":[{"end":354,"quote":"Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","source_id":"wikipedia.article.algebraic-analysis","source_sha256":"e36e8a62e908d85945858ca6d0e5d98d64938a376c1d84fb30abb83b440f9abf","start":106}],"target_id":"field.wikipedia.algebraic-analysis","target_kind":"node","target_sha256":"c94ebec4841713d8832152fad9667a376b8a7e22c83540f610c1c5acf9f846c2"}],"field.wikipedia.algebraic-number-theory":[{"id":"assertion.field.wikipedia.algebraic-number-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic number theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic number theory\", CC BY-SA 4.0) states: Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","support":[{"end":274,"quote":"Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","source_id":"wikipedia.article.algebraic-number-theory","source_sha256":"aced4bb02a991fb5362adb8cf97cd13505e471c37db0e2f8b6b40951efd48494","start":109}],"target_id":"field.wikipedia.algebraic-number-theory","target_kind":"node","target_sha256":"eb16e74dbf140221e45e850d1e53ef10fead8b9f9600d9e86551eb34b6eca8b0"}],"field.wikipedia.algebraic-topology":[{"id":"assertion.field.wikipedia.algebraic-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic topology\", CC BY-SA 4.0) states: Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","support":[{"end":215,"quote":"Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","source_id":"wikipedia.article.algebraic-topology","source_sha256":"816c31ad92147e32f7a22c99063af2029d171cc2fa823523a48d8034e66a80d3","start":103}],"target_id":"field.wikipedia.algebraic-topology","target_kind":"node","target_sha256":"6c8a664da2c90dc3a7920fd5de9cf3beed45a5f414a90a708e806ec2a3266b3b"}],"field.wikipedia.appert-topology":[{"id":"assertion.field.wikipedia.appert-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appert topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appert topology\", CC BY-SA 4.0) states: In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","support":[{"end":268,"quote":"In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","source_id":"wikipedia.article.appert-topology","source_sha256":"817e3afab0844b8a32ce79b08f1cb4efbcd6157f97b4f5a5030738b7e05ac041","start":103}],"target_id":"field.wikipedia.appert-topology","target_kind":"node","target_sha256":"aa003d8a8c3f7f974c4b350bb6f82803c8f31d699b7f4074b579a6112cf205b8"}],"field.wikipedia.applied-category-theory":[{"id":"assertion.field.wikipedia.applied-category-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied category theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied category theory\", CC BY-SA 4.0) states: Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","support":[{"end":398,"quote":"Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","source_id":"wikipedia.article.applied-category-theory","source_sha256":"8f78a25c0345a6c792a409c0df8150afa78df0d296bbe1e172d9c9a13b7a87aa","start":111}],"target_id":"field.wikipedia.applied-category-theory","target_kind":"node","target_sha256":"8b1012e00d2df48b4fcf6cff8e67f9d52c04fcd3d78df6856e1498b47a163dbb"}],"field.wikipedia.applied-mechanics":[{"id":"assertion.field.wikipedia.applied-mechanics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied mechanics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied mechanics\", CC BY-SA 4.0) states: Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","support":[{"end":269,"quote":"Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","source_id":"wikipedia.article.applied-mechanics","source_sha256":"d6953c3a186f4dcab81f87d460470486b724adac3c6b30c9ac49e4cf8ebb8879","start":104}],"target_id":"field.wikipedia.applied-mechanics","target_kind":"node","target_sha256":"157515579c2703a34a2d944e4f478d83c4ba0130a7a6dc0624c30ee8652b4cde"}],"field.wikipedia.architectural-acoustics":[{"id":"assertion.field.wikipedia.architectural-acoustics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural acoustics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural acoustics\", CC BY-SA 4.0) states: Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","support":[{"end":286,"quote":"Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","source_id":"wikipedia.article.architectural-acoustics","source_sha256":"51e3108a6bc8de9a7bbf787e09f02c4bcf0e5a21c10e2e3dd2410a940f22d172","start":110}],"target_id":"field.wikipedia.architectural-acoustics","target_kind":"node","target_sha256":"593c28cf83cab6c1111c73d91509232ef60aacc0d4e473d21442f61897bf634a"}],"field.wikipedia.architectural-engineering":[{"id":"assertion.field.wikipedia.architectural-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural engineering\", CC BY-SA 4.0) states: Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","support":[{"end":396,"quote":"Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","source_id":"wikipedia.article.architectural-engineering","source_sha256":"0f2d99f21a3cbcf1e04691af93823257b4aed729d6c8c36fe99ba2adc8a45e22","start":113}],"target_id":"field.wikipedia.architectural-engineering","target_kind":"node","target_sha256":"6f758218c5aa1cbdbd0e431e16437bd125ed6cd1866532fbe89320bddc575318"}],"field.wikipedia.argumentation-theory":[{"id":"assertion.field.wikipedia.argumentation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentation theory\", CC BY-SA 4.0) states: Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","support":[{"end":247,"quote":"Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","source_id":"wikipedia.article.argumentation-theory","source_sha256":"78216012fa171462a17524293032e966e23c062d3b982d3049edb212f8102048","start":107}],"target_id":"field.wikipedia.argumentation-theory","target_kind":"node","target_sha256":"7d4d56cf266c326e32015f38b9a541707f58233a2d8f11e45e94785c5868a994"}],"field.wikipedia.arithmetic-combinatorics":[{"id":"assertion.field.wikipedia.arithmetic-combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic combinatorics\", CC BY-SA 4.0) states: In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","support":[{"end":254,"quote":"In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","source_id":"wikipedia.article.arithmetic-combinatorics","source_sha256":"fda0e0896cdaee446b4e1a8aa7ae46744add263f99638903242577eb5b7cc55f","start":112}],"target_id":"field.wikipedia.arithmetic-combinatorics","target_kind":"node","target_sha256":"a71c444998332f18de919cb03f64e95aa93f4e97a66735e0cd6898cacdebfac3"}],"field.wikipedia.arithmetic-dynamics":[{"id":"assertion.field.wikipedia.arithmetic-dynamics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic dynamics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic dynamics\", CC BY-SA 4.0) states: Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","support":[{"end":217,"quote":"Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","source_id":"wikipedia.article.arithmetic-dynamics","source_sha256":"f0f3d559126f473f2cfedc4a18e1e88d9abfa9b306a13e996ecd530e8e04f96d","start":107}],"target_id":"field.wikipedia.arithmetic-dynamics","target_kind":"node","target_sha256":"fdf68c72037ba187469d95cd6d57d74217f760ca2ebd680831d7df5962612917"}],"field.wikipedia.artificial-intelligence-engineering":[{"id":"assertion.field.wikipedia.artificial-intelligence-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artificial intelligence engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artificial intelligence engineering\", CC BY-SA 4.0) states: Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","support":[{"end":272,"quote":"Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","source_id":"wikipedia.article.artificial-intelligence-engineering","source_sha256":"2c5dcea1cdca78edd3775c9b7bc482d065d48c5e2b04b60ea3ca4cf065f64d63","start":123}],"target_id":"field.wikipedia.artificial-intelligence-engineering","target_kind":"node","target_sha256":"1c7ce65f99f1ce36cb4144d8a5dda8b22a35a5b32cf9bffdec8642bbe1cb755d"}],"field.wikipedia.asymptotic-geometry":[{"id":"assertion.field.wikipedia.asymptotic-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptotic geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptotic geometry\", CC BY-SA 4.0) states: Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","support":[{"end":378,"quote":"Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","source_id":"wikipedia.article.asymptotic-geometry","source_sha256":"4f5ab8c058ffa10ef129fa06b8e81319a12814899eb947b4f5666b0160e17586","start":107}],"target_id":"field.wikipedia.asymptotic-geometry","target_kind":"node","target_sha256":"0ed3576cf1c5de4ce21cc9f4460fb2a7a081b99642d9b44c736b5f4b93432218"}],"field.wikipedia.automation-engineering":[{"id":"assertion.field.wikipedia.automation-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automation engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automation engineering\", CC BY-SA 4.0) states: Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","support":[{"end":344,"quote":"Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","source_id":"wikipedia.article.automation-engineering","source_sha256":"ece3ffcbd3a29d5b8153e3b343e7f0726f3ee31422159fc4ef7acf7e4c5924a2","start":110}],"target_id":"field.wikipedia.automation-engineering","target_kind":"node","target_sha256":"c61fe7e98228e89a1b796d6d2d279d28abfe1480b120d2b61d9cb77578564194"}],"field.wikipedia.aviation-engineering":[{"id":"assertion.field.wikipedia.aviation-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aviation engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aviation engineering\", CC BY-SA 4.0) states: Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","support":[{"end":267,"quote":"Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","source_id":"wikipedia.article.aviation-engineering","source_sha256":"f03bd54a62863f7e167c76839f02a10e2d446ce4bbc9564e89325905ecea1433","start":108}],"target_id":"field.wikipedia.aviation-engineering","target_kind":"node","target_sha256":"f54d4562fbaf77e735741f02794f8670a45854b5e42187c0f18ea74a5daa997c"}],"field.wikipedia.bayesian-epistemology":[{"id":"assertion.field.wikipedia.bayesian-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bayesian epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bayesian epistemology\", CC BY-SA 4.0) states: Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","support":[{"end":262,"quote":"Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","source_id":"wikipedia.article.bayesian-epistemology","source_sha256":"84d6e9908a5905879eb51d54a7c608a706a4c013891d629e70afba2f5778e6ca","start":109}],"target_id":"field.wikipedia.bayesian-epistemology","target_kind":"node","target_sha256":"1ab542c4aa75177d49665fac9851bad34ae4c4057801eac95818225ae4d50405"}],"field.wikipedia.biological-systems-engineering":[{"id":"assertion.field.wikipedia.biological-systems-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biological systems engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biological systems engineering\", CC BY-SA 4.0) states: Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","support":[{"end":262,"quote":"Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","source_id":"wikipedia.article.biological-systems-engineering","source_sha256":"84c8ad52c1640aad5043d184e58059efb2d82b6216ea5c0ddb6a82fc4bb6a22a","start":117}],"target_id":"field.wikipedia.biological-systems-engineering","target_kind":"node","target_sha256":"3278893830bf1b5179663a1146f35ad12a73a0cfda9df434336f506db63b414a"}],"field.wikipedia.bioresource-engineering":[{"id":"assertion.field.wikipedia.bioresource-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bioresource engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bioresource engineering\", CC BY-SA 4.0) states: Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","support":[{"end":218,"quote":"Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","source_id":"wikipedia.article.bioresource-engineering","source_sha256":"cbfdd9957c50c2738376406e797366a7e92fc4a831194e677533b1f3677cea49","start":111}],"target_id":"field.wikipedia.bioresource-engineering","target_kind":"node","target_sha256":"547d432bcaea46a73209ecdd49d0dcd60c294bf35eebf70e6c920b78efba4738"}],"field.wikipedia.categorical-topology":[{"id":"assertion.field.wikipedia.categorical-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Categorical topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Categorical topology\", CC BY-SA 4.0) states: In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","support":[{"end":299,"quote":"In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","source_id":"wikipedia.article.categorical-topology","source_sha256":"0767f2c8bec022adf050a5f8c73aca8c29ac803f0e4f6298ebc57cd55baade9b","start":108}],"target_id":"field.wikipedia.categorical-topology","target_kind":"node","target_sha256":"33b81114343308a672d27dd240ba5c9a5c3a6c68f3a6f53ee21eef996afe4e4c"}],"field.wikipedia.chaos-engineering":[{"id":"assertion.field.wikipedia.chaos-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chaos engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chaos engineering\", CC BY-SA 4.0) states: Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","support":[{"end":274,"quote":"Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","source_id":"wikipedia.article.chaos-engineering","source_sha256":"34b3a2bc6a354dce01895c2bc2b8851bf4a0154828a3a1bea49b543fdde1a6ae","start":105}],"target_id":"field.wikipedia.chaos-engineering","target_kind":"node","target_sha256":"d960faaa17b68b6f69b82cc7d6e15a8f3f950b2045de7f58e8ea62dcab29761c"}],"field.wikipedia.chemotronics":[{"id":"assertion.field.wikipedia.chemotronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemotronics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemotronics\", CC BY-SA 4.0) states: Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","support":[{"end":269,"quote":"Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","source_id":"wikipedia.article.chemotronics","source_sha256":"110f1a6fb49b2cfafa432f357dd78ba2c3e5088265003815b90503c8700b77e9","start":100}],"target_id":"field.wikipedia.chemotronics","target_kind":"node","target_sha256":"3a879322d1dfd2c8b21faeebbf8236d28271ddf8353692bb27166f643c90fef7"}],"field.wikipedia.civil-engineering":[{"id":"assertion.field.wikipedia.civil-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Civil engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Civil engineering\", CC BY-SA 4.0) states: Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","support":[{"end":414,"quote":"Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","source_id":"wikipedia.article.civil-engineering","source_sha256":"1652caa7287e0291bd3401f0d941067f7e504009bc966f0892544cc3608a6845","start":101}],"target_id":"field.wikipedia.civil-engineering","target_kind":"node","target_sha256":"8847d65e5b75669f21c61348ea154e3b11d1a61d2e8e1557e4ce805a8521e565"}],"field.wikipedia.combinatorics":[{"id":"assertion.field.wikipedia.combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Combinatorics\", CC BY-SA 4.0) states: Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","support":[{"end":268,"quote":"Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","source_id":"wikipedia.article.combinatorics","source_sha256":"c5e6762b3b4cf14ad1c39419af69cd8fd65096a681577ec8175aee8751344f95","start":97}],"target_id":"field.wikipedia.combinatorics","target_kind":"node","target_sha256":"7a8dd8a7271d41a381ca962b51e2d4f02ad8eb97a6b4929c1ced4d2955f05d5a"}],"field.wikipedia.commutative-algebra":[{"id":"assertion.field.wikipedia.commutative-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commutative algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commutative algebra\", CC BY-SA 4.0) states: Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","support":[{"end":254,"quote":"Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","source_id":"wikipedia.article.commutative-algebra","source_sha256":"010dec44b016b1ef8d3b5523a4f51161505bcd149877163ec9c5479c96254722","start":105}],"target_id":"field.wikipedia.commutative-algebra","target_kind":"node","target_sha256":"cd26965896f39c70cc18e786a7d4fa345b73aacd0984e133b5771fe39e82ae90"}],"field.wikipedia.complex-analysis":[{"id":"assertion.field.wikipedia.complex-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Complex analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Complex analysis\", CC BY-SA 4.0) states: Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","support":[{"end":298,"quote":"Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","source_id":"wikipedia.article.complex-analysis","source_sha256":"26e36b429afe1deb80f6d4faf9e35a0c2e6bbfd945b0d260d6fc97acdf12517d","start":100}],"target_id":"field.wikipedia.complex-analysis","target_kind":"node","target_sha256":"d9099e6f9e9a87bdcda5a781b4e4b28816a6a8988de9bda69d38b5a2756bbbd2"}],"field.wikipedia.computability-theory":[{"id":"assertion.field.wikipedia.computability-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computability theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computability theory\", CC BY-SA 4.0) states: Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","support":[{"end":330,"quote":"Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","source_id":"wikipedia.article.computability-theory","source_sha256":"eb219d73180e0db246e2543e2e10fa8e9be642568ddfd58d7aba06792869b10a","start":106}],"target_id":"field.wikipedia.computability-theory","target_kind":"node","target_sha256":"eee76ffb1093b722dadaddf42b5b1408ee8e0da0efac45b46a4bf2778d6de642"}],"field.wikipedia.computer-engineering":[{"id":"assertion.field.wikipedia.computer-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer engineering\", CC BY-SA 4.0) states: Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","support":[{"end":235,"quote":"Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","source_id":"wikipedia.article.computer-engineering","source_sha256":"b6cdee707c60616e1b59f68161a0cd26a5a905d93724ea2d5375baa4d0b7bc80","start":105}],"target_id":"field.wikipedia.computer-engineering","target_kind":"node","target_sha256":"891ffc3beb0021692ffedcee760c846cca9fb868ec0904305df6ac4fb75b807a"}],"field.wikipedia.computer-network-engineering":[{"id":"assertion.field.wikipedia.computer-network-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer network engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer network engineering\", CC BY-SA 4.0) states: Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","support":[{"end":271,"quote":"Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","source_id":"wikipedia.article.computer-network-engineering","source_sha256":"1391dc8f4eb69ebf09f90ab4281139ddd53ed83dc07132ba3142662def0e42ff","start":116}],"target_id":"field.wikipedia.computer-network-engineering","target_kind":"node","target_sha256":"62f503a308cc6e59f36593041f9359ec0a7e2009f7d0b808299f82a5903a587b"}],"field.wikipedia.conceptual-engineering":[{"id":"assertion.field.wikipedia.conceptual-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conceptual engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conceptual engineering\", CC BY-SA 4.0) states: Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","support":[{"end":253,"quote":"Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","source_id":"wikipedia.article.conceptual-engineering","source_sha256":"a8f7d0c23e1f4b1c8645412d996b232988ce85f924892af5ba7b5ff8d321fdaa","start":110}],"target_id":"field.wikipedia.conceptual-engineering","target_kind":"node","target_sha256":"13604301b51a5a8f7a7bf64e4f741017bdde501160242a43e3c3688d0719d1e0"}],"field.wikipedia.consensus-dynamics":[{"id":"assertion.field.wikipedia.consensus-dynamics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consensus dynamics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consensus dynamics\", CC BY-SA 4.0) states: Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","support":[{"end":238,"quote":"Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","source_id":"wikipedia.article.consensus-dynamics","source_sha256":"561998ed1973622b395e92cab044c3a19638cd42d446645e91a04147c98e9443","start":106}],"target_id":"field.wikipedia.consensus-dynamics","target_kind":"node","target_sha256":"72a9a373cdefff2cc7ffd97b3f33059428dc745b8c75b272f2a293db4230954b"}],"field.wikipedia.control-theory":[{"id":"assertion.field.wikipedia.control-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control theory\", CC BY-SA 4.0) states: Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","support":[{"end":220,"quote":"Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","source_id":"wikipedia.article.control-theory","source_sha256":"a24e996a9caa742e5c35b8c43b98301d807a83242c961f22731db7500787f759","start":98}],"target_id":"field.wikipedia.control-theory","target_kind":"node","target_sha256":"d33fe1a18774c9ac24d66a65f6957bfa2b6251ce73edba1fec35ef9d88e4be80"}],"field.wikipedia.convex-analysis":[{"id":"assertion.field.wikipedia.convex-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex analysis\", CC BY-SA 4.0) states: Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","support":[{"end":321,"quote":"Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","source_id":"wikipedia.article.convex-analysis","source_sha256":"cef4cd83eaca39ad1087cda7455cf043e4ee6e107e83b11d8704b3a3932a6c02","start":102}],"target_id":"field.wikipedia.convex-analysis","target_kind":"node","target_sha256":"911a8cd2375c1b8f1a6fbb3ac5e989704cdbb538aa5d317d49ff88945ec6ce8d"}],"field.wikipedia.convex-geometry":[{"id":"assertion.field.wikipedia.convex-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex geometry\", CC BY-SA 4.0) states: In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","support":[{"end":208,"quote":"In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","source_id":"wikipedia.article.convex-geometry","source_sha256":"a817399c37725e803f886822927037b8532f75309447122b3f58e8ee82089260","start":102}],"target_id":"field.wikipedia.convex-geometry","target_kind":"node","target_sha256":"216008ed15962ee0d800e5ebb0cf94d1e79b37c9617a702cacdb485afbc3519a"}],"field.wikipedia.differential-geometry":[{"id":"assertion.field.wikipedia.differential-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential geometry\", CC BY-SA 4.0) states: Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","support":[{"end":254,"quote":"Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","source_id":"wikipedia.article.differential-geometry","source_sha256":"bb15f037c5427d487984e21dc0a74f86c569bfbd8bdc59fced5680a7e886d707","start":105}],"target_id":"field.wikipedia.differential-geometry","target_kind":"node","target_sha256":"11b2498e6e0b5f7d9494b2540c39146e926f7947a7e976de0d33dd6d1b772602"}],"field.wikipedia.discrete-mathematics":[{"id":"assertion.field.wikipedia.discrete-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discrete mathematics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discrete mathematics\", CC BY-SA 4.0) states: Discrete mathematics is the study of mathematical structures that can be considered \"discrete\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \"continuous\" (analogously to continuous functions).","support":[{"end":379,"quote":"Discrete mathematics is the study of mathematical structures that can be considered \\\"discrete\\\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \\\"continuous\\\" (analogously to continuous functions).","source_id":"wikipedia.article.discrete-mathematics","source_sha256":"aee41777f21c001d746a59e6b83478816a8b795370954348bcb21761f9a62ecd","start":104}],"target_id":"field.wikipedia.discrete-mathematics","target_kind":"node","target_sha256":"ef1c3e12c0958adf0ae4aea2889f48a8d06e44d7cb97fd8c3446b1fec8b6911d"}],"field.wikipedia.electrical-engineering":[{"id":"assertion.field.wikipedia.electrical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electrical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electrical engineering\", CC BY-SA 4.0) states: Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","support":[{"end":299,"quote":"Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","source_id":"wikipedia.article.electrical-engineering","source_sha256":"73f4bd99c02717d7813b6d786e4a5aed15bef05f5e963c63435d06e7a4f86549","start":106}],"target_id":"field.wikipedia.electrical-engineering","target_kind":"node","target_sha256":"53d71890e08e47e371dadb3f0fe625b73a809e08d28caf5699016c122a140e27"}],"field.wikipedia.extremal-combinatorics":[{"id":"assertion.field.wikipedia.extremal-combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extremal combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extremal combinatorics\", CC BY-SA 4.0) states: Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","support":[{"end":199,"quote":"Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","source_id":"wikipedia.article.extremal-combinatorics","source_sha256":"b1b4338812fe35b0a95897879bb540c3704e3850c0812ea97756f3d524484941","start":109}],"target_id":"field.wikipedia.extremal-combinatorics","target_kind":"node","target_sha256":"4a26a843fee31b48bc4d66a2fc6d8985d8cb1624ece47b903bc1c573a3d857d5"}],"field.wikipedia.fourier-analysis":[{"id":"assertion.field.wikipedia.fourier-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fourier analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fourier analysis\", CC BY-SA 4.0) states: In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of trigonometric functions or more conveniently, complex exponentials.","support":[{"end":421,"quote":"In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of  trigonometric functions or more conveniently, complex exponentials.","source_id":"wikipedia.article.fourier-analysis","source_sha256":"e3dbcda56208ffe347a7c199b9abd70a9b805fa3eea017ef30c6dd70ae44d2b1","start":101}],"target_id":"field.wikipedia.fourier-analysis","target_kind":"node","target_sha256":"a102d118cfeaaca9393ba4e9d0cfc60d23bbe5c487a2ced84bced2888d9cd69c"}],"field.wikipedia.functional-analysis":[{"id":"assertion.field.wikipedia.functional-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Functional analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Functional analysis\", CC BY-SA 4.0) states: Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","support":[{"end":408,"quote":"Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","source_id":"wikipedia.article.functional-analysis","source_sha256":"39ee898b84a5e26d0e48b0cf954cc87447f337b6a2d31c425449bf9aa0b7eb8b","start":104}],"target_id":"field.wikipedia.functional-analysis","target_kind":"node","target_sha256":"de9fe92e2747d2c7f5cbb5d09f3f0417c474b9bfdf335cc76f73bb60ff91a737"}],"field.wikipedia.general-topology":[{"id":"assertion.field.wikipedia.general-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"General topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"General topology\", CC BY-SA 4.0) states: In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","support":[{"end":272,"quote":"In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","source_id":"wikipedia.article.general-topology","source_sha256":"bbb12ce87227b06504e63d52bcf6c94d412454630be00476ca00c36dc7207102","start":102}],"target_id":"field.wikipedia.general-topology","target_kind":"node","target_sha256":"c497dac6ed255c6fc64ae4da2f31c9f841e4d5b453941309d384fd98cc8c5f40"}],"field.wikipedia.genetic-epistemology":[{"id":"assertion.field.wikipedia.genetic-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Genetic epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Genetic epistemology\", CC BY-SA 4.0) states: Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","support":[{"end":278,"quote":"Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","source_id":"wikipedia.article.genetic-epistemology","source_sha256":"c74057f24f44c2991c7a1797a5a93bfc126b390e65c517f7b356dee021e1e7c1","start":108}],"target_id":"field.wikipedia.genetic-epistemology","target_kind":"node","target_sha256":"f70f44b11c8c9ab2f9f2a515c54a173969673165ec7c43a08067758ef57f71e0"}],"field.wikipedia.geometric-analysis":[{"id":"assertion.field.wikipedia.geometric-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric analysis\", CC BY-SA 4.0) states: Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","support":[{"end":338,"quote":"Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","source_id":"wikipedia.article.geometric-analysis","source_sha256":"95adaf24a467daa07c78b09f0fc0f1af640d4c0801c1ff893ed96603549d8ec2","start":105}],"target_id":"field.wikipedia.geometric-analysis","target_kind":"node","target_sha256":"621c525f6779fe3f92b4ac6d1936859cb8bad7e2e0cb2596af8031458eb2d9b4"}],"field.wikipedia.geotechnical-engineering":[{"id":"assertion.field.wikipedia.geotechnical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geotechnical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geotechnical engineering\", CC BY-SA 4.0) states: Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","support":[{"end":256,"quote":"Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","source_id":"wikipedia.article.geotechnical-engineering","source_sha256":"0030eef34e2e5d05aa9e74bfd3ad416c07f279edbd23563c198ac73c8b4e16cf","start":109}],"target_id":"field.wikipedia.geotechnical-engineering","target_kind":"node","target_sha256":"798e59165b18a813ea73d37b0a4661aa56ea3df46e2a514ee53df7fced2860f0"}],"field.wikipedia.global-analysis":[{"id":"assertion.field.wikipedia.global-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Global analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Global analysis\", CC BY-SA 4.0) states: In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","support":[{"end":283,"quote":"In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","source_id":"wikipedia.article.global-analysis","source_sha256":"1e10b28b5709b7d4a00e802cb8f09ff35b828f10b35b26592d810f86ec004ebf","start":103}],"target_id":"field.wikipedia.global-analysis","target_kind":"node","target_sha256":"e96c52ae025d556014f895e2c0cb088a38fa4738a129ed4549ed6f2c1acf80da"}],"field.wikipedia.harmonic-analysis":[{"id":"assertion.field.wikipedia.harmonic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic analysis\", CC BY-SA 4.0) states: Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","support":[{"end":246,"quote":"Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","source_id":"wikipedia.article.harmonic-analysis","source_sha256":"474a2cbfb2e2ce6a0027ad1fe937f292a0f99f82c8446eafbe1960a7a4d739b2","start":102}],"target_id":"field.wikipedia.harmonic-analysis","target_kind":"node","target_sha256":"208d78a72f8e31841861149709ce4be7b0b987e6521c2316bd7bb1fc2dc0badc"}],"field.wikipedia.hermeneutics":[{"id":"assertion.field.wikipedia.hermeneutics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hermeneutics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hermeneutics\", CC BY-SA 4.0) states: Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","support":[{"end":270,"quote":"Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","source_id":"wikipedia.article.hermeneutics","source_sha256":"8189bc325e90b595fb18572b0da6d177531d235e928a55bcc3ea8927ab6e9054","start":97}],"target_id":"field.wikipedia.hermeneutics","target_kind":"node","target_sha256":"f7605c7c6f5a29a097cbc5092d06ee6e9f8ba77b0767402f4170142041001a0f"}],"field.wikipedia.history-and-philosophy-of-science":[{"id":"assertion.field.wikipedia.history-and-philosophy-of-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"History and philosophy of science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"History and philosophy of science\", CC BY-SA 4.0) states: The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","support":[{"end":260,"quote":"The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","source_id":"wikipedia.article.history-and-philosophy-of-science","source_sha256":"a904862f00f3e6bc069a218eb8e1409b94a48b462fc5559e53766d4e62fdc36d","start":120}],"target_id":"field.wikipedia.history-and-philosophy-of-science","target_kind":"node","target_sha256":"0ff19f1a10dd1ae2b4b30cbf3f266d84779c2d653648ebdb81a246ada5403d61"}],"field.wikipedia.homological-algebra":[{"id":"assertion.field.wikipedia.homological-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Homological algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Homological algebra\", CC BY-SA 4.0) states: Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","support":[{"end":207,"quote":"Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","source_id":"wikipedia.article.homological-algebra","source_sha256":"563784e1be9b8f0641d8e1637bb178e9f4d85e611ae7bf49a7379da20f46c5fe","start":105}],"target_id":"field.wikipedia.homological-algebra","target_kind":"node","target_sha256":"2cd8699d503a1fa66b5b3fc598efd679b00f166f255f20f9918a738527b5dd01"}],"field.wikipedia.mathematical-analysis":[{"id":"assertion.field.wikipedia.mathematical-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical analysis\", CC BY-SA 4.0) states: Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","support":[{"end":252,"quote":"Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","source_id":"wikipedia.article.mathematical-analysis","source_sha256":"88b8cb874eb78cfbfd139efd879545732c86f2ecc34ba0f47537801d40007113","start":106}],"target_id":"field.wikipedia.mathematical-analysis","target_kind":"node","target_sha256":"455368cec39ff073c640c83c5540241982c233be1b30461122100769e3af4d56"}],"field.wikipedia.noncommutative-harmonic-analysis":[{"id":"assertion.field.wikipedia.noncommutative-harmonic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Noncommutative harmonic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Noncommutative harmonic analysis\", CC BY-SA 4.0) states: In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","support":[{"end":281,"quote":"In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","source_id":"wikipedia.article.noncommutative-harmonic-analysis","source_sha256":"635eaf894a4cdca231b6d197f2d852fc2b3ffb3efb7a2e7e63dbe00cdb1b8bf8","start":120}],"target_id":"field.wikipedia.noncommutative-harmonic-analysis","target_kind":"node","target_sha256":"dded5e69acd777b96e5c3f675dfa3a34fccd0d32c3d8ffaa4c49d808620200fb"}],"field.wikipedia.number-theory":[{"id":"assertion.field.wikipedia.number-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Number theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Number theory\", CC BY-SA 4.0) states: Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","support":[{"end":211,"quote":"Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","source_id":"wikipedia.article.number-theory","source_sha256":"65ad76112e37a89c1ace150fed6aca64cc059fee7f6521ed9cfbf46bf2997062","start":98}],"target_id":"field.wikipedia.number-theory","target_kind":"node","target_sha256":"ca324cae36a7301c08812dbbea65582346db509c096d375a3ecf46d146b0f2e7"}],"field.wikipedia.numerical-analysis":[{"id":"assertion.field.wikipedia.numerical-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Numerical analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Numerical analysis\", CC BY-SA 4.0) states: Numerical analysis is the study of algorithms for the problems of continuous mathematics.","support":[{"end":192,"quote":"Numerical analysis is the study of algorithms for the problems of continuous mathematics.","source_id":"wikipedia.article.numerical-analysis","source_sha256":"7d42a0f7fa1d74e3adfbe43914531b9dcdeee2647ac24482dd612e605b89fa08","start":103}],"target_id":"field.wikipedia.numerical-analysis","target_kind":"node","target_sha256":"0fa19e5dc851806db90903ec0c5d5c9a8d60ae79b44f76c9718157f32cd3742b"}],"field.wikipedia.offshore-geotechnical-engineering":[{"id":"assertion.field.wikipedia.offshore-geotechnical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Offshore geotechnical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Offshore geotechnical engineering\", CC BY-SA 4.0) states: Offshore geotechnical engineering is a sub-field of geotechnical engineering.","support":[{"end":198,"quote":"Offshore geotechnical engineering is a sub-field of geotechnical engineering.","source_id":"wikipedia.article.offshore-geotechnical-engineering","source_sha256":"f041d9d1cd9dd0e99ae090e9caf36f6dd69562c7ed2860dfe5b6ed459591b99b","start":121}],"target_id":"field.wikipedia.offshore-geotechnical-engineering","target_kind":"node","target_sha256":"0c683e5e19d12c8d77b16ed33d120a4ce83630bf05cd4ea03f05b469e247157d"}],"field.wikipedia.order-theory":[{"id":"assertion.field.wikipedia.order-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Order theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Order theory\", CC BY-SA 4.0) states: Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","support":[{"end":209,"quote":"Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","source_id":"wikipedia.article.order-theory","source_sha256":"bace12a5b8441aabf2a2da792a676d5a22ab5ea8ed820983e566624f70d923af","start":98}],"target_id":"field.wikipedia.order-theory","target_kind":"node","target_sha256":"ce600837f9b5b272b4fbb821bb3864c57cb03146572de54e3ef53bddee46a397"}],"field.wikipedia.probability-theory":[{"id":"assertion.field.wikipedia.probability-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Probability theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Probability theory\", CC BY-SA 4.0) states: Probability theory or probability calculus is the branch of mathematics concerned with probability.","support":[{"end":202,"quote":"Probability theory or probability calculus is the branch of mathematics concerned with probability.","source_id":"wikipedia.article.probability-theory","source_sha256":"66692308fe33d15a2beddd1c83049d51f3534f3c0d14847cbb698be4127b585d","start":103}],"target_id":"field.wikipedia.probability-theory","target_kind":"node","target_sha256":"7f9836278db82d80797a326975aff3d83291fac607efb00ff62989ec9cf1a722"}],"field.wikipedia.projective-differential-geometry":[{"id":"assertion.field.wikipedia.projective-differential-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Projective differential geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Projective differential geometry\", CC BY-SA 4.0) states: In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","support":[{"end":387,"quote":"In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","source_id":"wikipedia.article.projective-differential-geometry","source_sha256":"fcabab1cc57687cb02fd8f1094bc5a9b7c4a5e432c6da00aa2fda6b4a4bd3f57","start":119}],"target_id":"field.wikipedia.projective-differential-geometry","target_kind":"node","target_sha256":"43760dc2ccb7ce24d8ee0c6ce765b90c59cc5e11682f1c0a4a1d1fdc3353756f"}],"field.wikipedia.representation-theory":[{"id":"assertion.field.wikipedia.representation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Representation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Representation theory\", CC BY-SA 4.0) states: Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","support":[{"end":275,"quote":"Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","source_id":"wikipedia.article.representation-theory","source_sha256":"fa70e3022a3e53f87880315893e93717ac45ebbdbea183d2ec938a88f1f921c2","start":109}],"target_id":"field.wikipedia.representation-theory","target_kind":"node","target_sha256":"687fd6e00648220849be86490d28642ce811e2d685261d061aa301882566575a"}],"field.wikipedia.ring-theory":[{"id":"assertion.field.wikipedia.ring-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ring theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ring theory\", CC BY-SA 4.0) states: In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","support":[{"end":287,"quote":"In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","source_id":"wikipedia.article.ring-theory","source_sha256":"87cadb9946f4a494b13c91c29394869ebbbc532a58bab42ac44d8b28a9f0fb71","start":97}],"target_id":"field.wikipedia.ring-theory","target_kind":"node","target_sha256":"c5779f1dd125aafd0cd4fb3d7b69ebd363efc80d5277f89fb86f92e6b5219e03"}],"field.wikipedia.scientometrics":[{"id":"assertion.field.wikipedia.scientometrics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Scientometrics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Scientometrics\", CC BY-SA 4.0) states: Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","support":[{"end":274,"quote":"Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","source_id":"wikipedia.article.scientometrics","source_sha256":"5899874c9cb80c2bc46cb2191ae53ab00554edb0101089134b0aac14aeffecfd","start":101}],"target_id":"field.wikipedia.scientometrics","target_kind":"node","target_sha256":"e5e04b0c1c457d7fe71a2812dc54e71e2ae96d3c53e449ddb6310aa1b244884d"}],"field.wikipedia.systems-engineering":[{"id":"assertion.field.wikipedia.systems-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Systems engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Systems engineering\", CC BY-SA 4.0) states: Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","support":[{"end":288,"quote":"Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","source_id":"wikipedia.article.systems-engineering","source_sha256":"c9fed2abb569cc20beb89a5e9a1ef0ab2be55b461939570d616eba689dbaf201","start":104}],"target_id":"field.wikipedia.systems-engineering","target_kind":"node","target_sha256":"0a7ce273d661e433d371b38def61b50b424b69935f94844155c4b526258ce387"}],"field.wikipedia.telecommunications-engineering":[{"id":"assertion.field.wikipedia.telecommunications-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Telecommunications engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Telecommunications engineering\", CC BY-SA 4.0) states: Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","support":[{"end":259,"quote":"Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","source_id":"wikipedia.article.telecommunications-engineering","source_sha256":"17b5de9ce29d29b841bd5bd61de3a8b9d79bd41f669898cd1a975beeac3743a9","start":117}],"target_id":"field.wikipedia.telecommunications-engineering","target_kind":"node","target_sha256":"e230000dfa9db03779fc826b925e70c1d5a5c7a80310ac808467533c62e461f9"}],"field.wikipedia.truthmaker-theory":[{"id":"assertion.field.wikipedia.truthmaker-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Truthmaker theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Truthmaker theory\", CC BY-SA 4.0) states: Truthmaker theory is \"the branch of metaphysics that explores the relationships between what is true and what exists\".","support":[{"end":223,"quote":"Truthmaker theory is \\\"the branch of metaphysics that explores the relationships between what is true and what exists\\\".","source_id":"wikipedia.article.truthmaker-theory","source_sha256":"3ea61b142aa3866d536b596e240ad3bbaa2fcdfde1bc857ad47241fa176bca09","start":103}],"target_id":"field.wikipedia.truthmaker-theory","target_kind":"node","target_sha256":"0a09f1d8f9ee5eab33a912d072180159131ba069f0bb6aa50365b2867bdfb058"}],"instrument.admx":[{"id":"assertion.complete.instrument.admx","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Microwave-cavity axion haloscope.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"instrument.admx","target_kind":"node","target_sha256":"9bfc2a103467e26da7ce7ea023bbba01e17a2556df4d75fbd3cae7d625567062"}],"instrument.fermi-lat":[{"id":"assertion.complete.instrument.fermi-lat","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gamma-ray telescope used for LIV constraints.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"instrument.fermi-lat","target_kind":"node","target_sha256":"5451f3e7ab557645f975be27288253e9d1eb3c0bec57672667abca9406e93974"}],"instrument.lux-zeplin":[{"id":"assertion.complete.instrument.lux-zeplin","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Two-phase xenon TPC used for direct dark-matter searches.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"instrument.lux-zeplin","target_kind":"node","target_sha256":"ad6ee2c1c37d897c1cd5e98cd5ba4b101caa80081926968cd095ac8e6a0ab822"}],"method.axion-haloscope":[{"id":"assertion.complete.method.axion-haloscope","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX search uses an axion haloscope consisting of a microwave cavity in a strong magnetic field to test axion dark matter.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"method.axion-haloscope","target_kind":"node","target_sha256":"ebb1533ce4d2f82988d956e75c407452e94ca0e191e68b16c711034bb6fdf28d"}],"method.bmv-entanglement-witness":[{"id":"assertion.complete.method.bmv-entanglement-witness","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spin-correlation test using mesoscopic masses.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615},{"end":1105,"quote":"We provide brief answers to a number of recurring questions about the BMV effect and the related experimental proposal (Bose et al., 2017; Marletto and Vedral, 2017). Some of these questions include alleged counter-examples to our result, stating that if gravity (or anything mediating the interaction) can create entanglement while complying with locality, then it must then be non-classical. Here we explain why these objections are not counter-examples and why our result still stands; we also explore a few other important subtleties often disregarded on a first read of our paper (Marletto and Vedral, 2017).","source_id":"completion-source.b0684b58644cb3ab135c","source_sha256":"8f9b9ee23bbaa60ef23eb04b9f1c91a1df138a89248fece1782281c1364e4953","start":492}],"target_id":"method.bmv-entanglement-witness","target_kind":"node","target_sha256":"f1432b44430531805e0b2e273c3833a5f8f9d93dcf4b42b48de10f19de816e80"}],"method.cluster-offset-constraint":[{"id":"assertion.complete.method.cluster-offset-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited finite-range-force analysis constrains dark-matter models using conditional predictions of altered cluster collision velocity or separation between dark matter and galaxies after collision, along with the stated observational assumptions.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"method.cluster-offset-constraint","target_kind":"node","target_sha256":"1b94a5d18450db6c1587e3dd38e29a4606bd10ec7951ff0adde7d9fe742a433b"}],"method.crdm-direct-search":[{"id":"assertion.complete.method.crdm-direct-search","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Search for boosted sub-GeV dark matter in xenon data.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"method.crdm-direct-search","target_kind":"node","target_sha256":"6652c2d4ca5a5c3e43d34c653a53d7a0cd9d3b71e5cf01a092423b6a4a172510"}],"method.functional-rg-gravity":[{"id":"assertion.complete.method.functional-rg-gravity","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Scale-dependent effective-action flow.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477}],"target_id":"method.functional-rg-gravity","target_kind":"node","target_sha256":"9536c066a9b062befcbd0a5c93bcc9531fca568320032e4f2aa5f2a44b0d43c6"}],"method.gamma-ray-burst-dispersion-test":[{"id":"assertion.complete.method.gamma-ray-burst-dispersion-test","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gamma-ray timing constrains vacuum dispersion.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"method.gamma-ray-burst-dispersion-test","target_kind":"node","target_sha256":"d4a73be619a9e4589a39a08869a596882bcbafcc23f0180858aacdfc182f07c9"}],"method.lyman-alpha-forest-constraint":[{"id":"assertion.complete.method.lyman-alpha-forest-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Uses quasar absorption power spectra to constrain fuzzy dark matter.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"method.lyman-alpha-forest-constraint","target_kind":"node","target_sha256":"48b35f227147c028537a5e51efb8d460078ed114ec4619924c5bb57a281aed12"}],"method.mass-superposition-probe":[{"id":"assertion.complete.method.mass-superposition-probe","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spatial superpositions probe gravity-mediated quantum effects.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"method.mass-superposition-probe","target_kind":"node","target_sha256":"ff0748031c48bcb1d96cdf4c4770971d08feb88e5f5750b3656e64073d993b1c"}],"method.microlensing-dark-matter":[{"id":"assertion.complete.method.microlensing-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Uses transient lensing magnification to test compact dark matter.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"method.microlensing-dark-matter","target_kind":"node","target_sha256":"d39794dd0e875a1d6fe8da70b3ae419773fc703019d10ab276c62ab968c46923"}],"method.nist.ackermann":[{"id":"assertion.method.nist.ackermann","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ackermann's function as: A function of two parameters whose value grows very fast. Formal Definition: A(0, j)=j+1 for j ≥ 0 A(i, 0)=A(i-1, 1) for i > 0 A(i, j)=A(i-1, A(i, j-1)) for i, j > 0","support":[{"end":236,"quote":"A function of two parameters whose value grows very fast.\nFormal Definition:\nA(0, j)=j+1\t\t\tfor j ≥ 0\nA(i, 0)=A(i-1, 1)\t\t\tfor i > 0\nA(i, j)=A(i-1, A(i, j-1))\t\tfor i, j > 0","source_id":"nist-dads.ackermann","source_sha256":"498e1a49c607f9415f6b17af40a06e785f67b0b572d1a31e285bb7c4ae6dac88","start":66}],"target_id":"method.nist.ackermann","target_kind":"node","target_sha256":"7ddce0781d5639b0ff26f2334b441d3a2fae1975f3ef53f4af0cfd65a6bbe512"}],"method.nist.adaptiveheapsort":[{"id":"assertion.method.nist.adaptiveheapsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive heap sort as: A variant of heapsort that uses a randomized binary search tree (RBST) to structure the input according to any preexisting order. The RBST is used to select candidates that are put into the heap so the heap doesn't need to keep track of all elements.","support":[{"end":314,"quote":"A variant of\nheapsort\nthat uses a\nrandomized binary search tree\n(RBST) to structure the input according to any preexisting order.  The RBST is used to select candidates that are put into the\nheap\nso the heap doesn't need to  keep track of all elements.","source_id":"nist-dads.adaptiveheapsort","source_sha256":"c94aaf893bca380d8acbb7ae44ff46f49c287df82a2c5f568c9ae72969ad4494","start":62}],"target_id":"method.nist.adaptiveheapsort","target_kind":"node","target_sha256":"3cb595fdcfef664cfc1245a8acc3a3a2cee1e40671abff621723c78ffaf3e28f"}],"method.nist.adaptivehuffman":[{"id":"assertion.method.nist.adaptivehuffman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive Huffman coding as: A near-minimal variable-length character coding that changes based on the frequency of characters processed. As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified). Also known as dynamic Huffman coding.","support":[{"end":329,"quote":"A near-minimal variable-length character coding that changes based on the frequency of characters processed.  As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified).\nAlso known as\ndynamic Huffman coding.","source_id":"nist-dads.adaptivehuffman","source_sha256":"0337b06b51d476a0c945669d54ba2dc794adb27a64ee756df43a2c4c63438406","start":72}],"target_id":"method.nist.adaptivehuffman","target_kind":"node","target_sha256":"3bea9474f9bffafba24118f41179a7d4f315cba8a2bffa007ec4c61f1034297c"}],"method.nist.addresscalc":[{"id":"assertion.method.nist.addresscalc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines address-calculation sort as: A sort algorithm which uses knowledge of the domain of the items to calculate the position of each item in the sorted array .","support":[{"end":199,"quote":"A\nsort\nalgorithm which uses knowledge of the\ndomain\nof the items to calculate the position of each item in the sorted\narray\n.","source_id":"nist-dads.addresscalc","source_sha256":"57813157e6cb36ec5b20dffe340839c5fbba228a7769742f76c3bb50c7f0094c","start":74}],"target_id":"method.nist.addresscalc","target_kind":"node","target_sha256":"e251251221a31a0ac1d0cb48408bf8e50a52ae27f78f4c8ea6f23eaf807b59cc"}],"method.nist.ahocorasick":[{"id":"assertion.method.nist.ahocorasick","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Aho-Corasick as: A multiple string matching algorithm that constructs a finite state machine from a pattern (list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","support":[{"end":243,"quote":"A multiple\nstring matching\nalgorithm that constructs a\nfinite state machine\nfrom a\npattern\n(list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","source_id":"nist-dads.ahocorasick","source_sha256":"b521aaa511658871ec7e9e154de6903b9c6564adff07372b72996413613d9885","start":50}],"target_id":"method.nist.ahocorasick","target_kind":"node","target_sha256":"d70e1a20f7c108aa576055b35d30352d8880a6f7a8cc278a5e0f9ab4696d61d0"}],"method.nist.algorithmfgk":[{"id":"assertion.method.nist.algorithmfgk","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines algorithm FGK as: An adaptive Huffman coding scheme. Coding is never much worse than twice optimal .","support":[{"end":135,"quote":"An\nadaptive Huffman coding\nscheme.  Coding is never much worse than twice\noptimal\n.","source_id":"nist-dads.algorithmfgk","source_sha256":"8d3f479b445c0cfcbc74e406521332f1256570cd21d8a1c4cfc2da89cfdc760e","start":52}],"target_id":"method.nist.algorithmfgk","target_kind":"node","target_sha256":"9f35d34afca072c456a6046e0cca77ed77a8565670dffd178520d1a8f6ad1592"}],"method.nist.americanflagsort":[{"id":"assertion.method.nist.americanflagsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines American flag sort as: An efficient, in-place variant of radix sort that distributes items into hundreds of buckets . The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array. The last step cyclically permutes items to their proper bucket. Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the Dutch national flag problem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as quicksort for large sets of strings.","support":[{"end":656,"quote":"An efficient,\nin-place\nvariant of\nradix sort\nthat distributes items into hundreds of\nbuckets\n.   The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array.  The last step cyclically\npermutes\nitems to their proper bucket.  Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the\nDutch national flag\nproblem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as\nquicksort\nfor large sets of strings.","source_id":"nist-dads.americanflagsort","source_sha256":"0155cdce01e5dc56cb1a71b9cf5c99299a55ea760b69a95e98eecfcfb68d03d5","start":62}],"target_id":"method.nist.americanflagsort","target_kind":"node","target_sha256":"a4c772513aa62dbb5ae8ee7852882c04e8048af4de432835aeb52713d587fc5d"}],"method.nist.approximatin":[{"id":"assertion.method.nist.approximatin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines approximation algorithm as: An algorithm to solve an optimization problem that runs in polynomial time in the length of the input and outputs a solution that is guaranteed to be close to the optimal solution . \"Close\" has some well-defined sense called the performance guarantee .","support":[{"end":337,"quote":"An\nalgorithm\nto solve an\noptimization problem\nthat runs in\npolynomial time\nin the length of the input and outputs a solution that is guaranteed to be close to the\noptimal solution\n.  \"Close\" has some well-defined sense called the\nperformance guarantee\n.","source_id":"nist-dads.approximatin","source_sha256":"c6525b948214baf474ad2088ed4ab30121ecf8c2290c8e451f377045c3feed5e","start":84}],"target_id":"method.nist.approximatin","target_kind":"node","target_sha256":"8855b1793228fd9585602b1068d9d9e94d4f24520630f7e49cacc8a018f62a24"}],"method.nist.arithmeticcoding":[{"id":"assertion.method.nist.arithmeticcoding","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines arithmetic coding as: A minimal variable-length message coding based on the frequency of each character. The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","support":[{"end":303,"quote":"A minimal variable-length message coding based on the frequency of each character.  The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","source_id":"nist-dads.arithmeticcoding","source_sha256":"ac2e2ff17f362916fbb50261f2f63522864ed8b0fbc6b5f27798cac2fd17ac6f","start":60}],"target_id":"method.nist.arithmeticcoding","target_kind":"node","target_sha256":"270c5b544ce53effa787084956d7305f41c9d9e974c9e82eed6e5c4958d65635"}],"method.nist.arraymerg":[{"id":"assertion.method.nist.arraymerg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array merging as: Joining two arrays into one.","support":[{"end":80,"quote":"Joining two arrays into one.","source_id":"nist-dads.arraymerg","source_sha256":"01767415264c1ca05126047d7f299a73d00cf778c9d895ed0c844d289e3252c9","start":52}],"target_id":"method.nist.arraymerg","target_kind":"node","target_sha256":"8ddc1971f0256c611deb640594949878172286f4d27b6902f3d809ebd8c9ee46"}],"method.nist.backtrack":[{"id":"assertion.method.nist.backtrack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines backtracking as: Find a solution by trying one of several choices. If the choice proves incorrect, computation backtracks or restarts at the point of choice and tries another choice. It is often convenient to maintain choice points and alternate choices using recursion .","support":[{"end":318,"quote":"Find a solution by trying one of several choices.  If the choice proves incorrect, computation\nbacktracks\nor restarts at the point of choice and tries another choice.  It is often convenient to maintain choice points and alternate choices using\nrecursion\n.","source_id":"nist-dads.backtrack","source_sha256":"5034ab49bbfb913385905358512212e9bf1a3bda923bdf2fd19467797eb7894e","start":62}],"target_id":"method.nist.backtrack","target_kind":"node","target_sha256":"444984b4fb61d6728516942dc3255015c2e8cbc237980bef2a8b8d56825b4749"}],"method.nist.balanc2wayms":[{"id":"assertion.method.nist.balanc2wayms","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced two-way merge sort as: A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","support":[{"end":452,"quote":"A\nbalanced k-way merge sort\nthat sorts a data stream using repeated merges.  It distributes the input into two streams by repeatedly reading a\nblock\nof input that fits in memory, a\nrun\n, sorting it, then writing it to the next stream.  It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","source_id":"nist-dads.balanc2wayms","source_sha256":"fb382909518d57a7e314da736eb227cbda494dcd65258a5e5d6546cad4cbe078","start":80}],"target_id":"method.nist.balanc2wayms","target_kind":"node","target_sha256":"5a85ee4d6dca5793257dc8cc7e8d88594b6891d149f7a322c9a74ca618c6b2fc"}],"method.nist.balancedqsrt":[{"id":"assertion.method.nist.balancedqsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced quicksort as: A variant of quicksort which attempts to choose a pivot likely to represent the middle of the values to be sorted.","support":[{"end":176,"quote":"A variant of\nquicksort\nwhich attempts to choose a pivot likely to represent the middle of the values to be sorted.","source_id":"nist-dads.balancedqsrt","source_sha256":"73530677357b2d803438ad18a5e482e64e187170f5075dfeb84bd022323caab9","start":62}],"target_id":"method.nist.balancedqsrt","target_kind":"node","target_sha256":"9872dc5f2002bd1a0ec4e7a50d042fff6ddc0fc713f8aa4e1c2c48053dbd2e6f"}],"method.nist.balanckwayms":[{"id":"assertion.method.nist.balanckwayms","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","support":[{"end":434,"quote":"A\nmerge sort\nthat sorts a data stream using repeated merges.  It distributes the input into k streams by repeatedly reading a\nblock\nof input that fits in memory, called a\nrun\n, sorting it, then writing it to the next stream.  It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","source_id":"nist-dads.balanckwayms","source_sha256":"c5212c2be449872276b869a7954e7c7c6421484ac8acd821f25686765ef60af9","start":76}],"target_id":"method.nist.balanckwayms","target_kind":"node","target_sha256":"ff413db436dbc31da04e6073af474f22598c02e4767e8124d1593d81e1a86f40"}],"method.nist.balancmrgsrt":[{"id":"assertion.method.nist.balancmrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced merge sort as: A k-way merge sort in which the number of input and output data streams is the same. See balanced k-way merge sort .","support":[{"end":182,"quote":"A\nk-way merge sort\nin which the number of input and  output data streams is the same.  See\nbalanced k-way merge sort\n.","source_id":"nist-dads.balancmrgsrt","source_sha256":"4d93081da1aad38381060dc8573ac8e90376152d948c4b126f75ca24cefbac7c","start":64}],"target_id":"method.nist.balancmrgsrt","target_kind":"node","target_sha256":"8901fabd115e3b503f1466b6aab415af2fe7d00b95c8ad4fb2109b18c560ab7d"}],"method.nist.baumwelch":[{"id":"assertion.method.nist.baumwelch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Baum Welch algorithm as: An algorithm to find hidden Markov model parameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","support":[{"end":224,"quote":"An algorithm to find\nhidden Markov model\nparameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","source_id":"nist-dads.baumwelch","source_sha256":"7b0043e2475dd61d1b22b1331c2d8a8053b821db7ad984da3ec579e75f693a8c","start":66}],"target_id":"method.nist.baumwelch","target_kind":"node","target_sha256":"f70076346fc3abdcdf22fe5f401f1ef468b0f16442030eabaebd32b26a1a4abb"}],"method.nist.bbp":[{"id":"assertion.method.nist.bbp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BBP algorithm as: Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","support":[{"end":147,"quote":"Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","source_id":"nist-dads.bbp","source_sha256":"c166e1d6be7e125bc3b269f46cf7ca31cf116da7724dc1ee80d7cc688030ef97","start":52}],"target_id":"method.nist.bbp","target_kind":"node","target_sha256":"834e2c512bcddbd768ce82d2165b99316ef15a715746e0625fe82f6d5ed491ed"}],"method.nist.bellmanford":[{"id":"assertion.method.nist.bellmanford","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Bellman-Ford algorithm as: An efficient algorithm to solve the single-source shortest-path problem . Weights may be negative. The algorithm initializes the distance to the source vertex to 0 and all other vertices to ∞. It then does V-1 passes (V is the number of vertices) over all edges relaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight cycles , in which case it returns false. The time complexity is O(VE) , where E is the number of edges. Also known as Ford-Bellman.","support":[{"end":596,"quote":"An efficient algorithm to solve the\nsingle-source shortest-path problem\n. Weights may be negative.   The algorithm initializes the distance to the\nsource\nvertex to 0 and all other vertices to ∞.  It then does V-1 passes (V is the number of vertices) over all\nedges\nrelaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight\ncycles\n, in which case it returns false.  The time complexity is\nO(VE)\n, where E is the number of edges.\nAlso known as\nFord-Bellman.","source_id":"nist-dads.bellmanford","source_sha256":"f5b8c250350fef1af20c1c7a647c31fea8e55e197b289e0cfc951067103127b8","start":70}],"target_id":"method.nist.bellmanford","target_kind":"node","target_sha256":"3cb1de6171d4f8c38b006f95c8af804f06eeeb17210ac26a0fef7c1f83ee79b3"}],"method.nist.bestfirst":[{"id":"assertion.method.nist.bestfirst","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best-first search as: A state-space search algorithm that considers the estimated best partial solution next. This is typically implemented with a priority queue .","support":[{"end":202,"quote":"A state-space search algorithm that considers the estimated best partial solution next.  This is typically implemented with a\npriority queue\n.","source_id":"nist-dads.bestfirst","source_sha256":"f07957db8213fa246132c8c19559de964e598d56494cc5a3484fc7c4fff0c377","start":60}],"target_id":"method.nist.bestfirst","target_kind":"node","target_sha256":"afcd30564e8e29a9aa264830a1eb47449bf5e03c71f61bc8ce3f0ba3b5044c5b"}],"method.nist.bidirectionalbubblesort":[{"id":"assertion.method.nist.bidirectionalbubblesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bidirectional bubble sort as: A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps. Also known as cocktail shaker sort, shaker sort, double-direction bubble sort.","support":[{"end":410,"quote":"A variant of\nbubble sort\nthat compares each adjacent pair of items in a\nlist\nin turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.\nAlso known as\ncocktail shaker sort, shaker sort, double-direction bubble sort.","source_id":"nist-dads.bidirectionalbubblesort","source_sha256":"bf1666329c338f15fac37979dbf2a9e3325e5629a46402bee83a0166439c7413","start":76}],"target_id":"method.nist.bidirectionalbubblesort","target_kind":"node","target_sha256":"5ce8e1b3a06d55579793dc87323cfa7e172194938ec79ed0fe2f9de97374dcb0"}],"method.nist.binaryinsort":[{"id":"assertion.method.nist.binaryinsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary insertion sort as: Insertion sort in which the proper location for the next item is found with a binary search .","support":[{"end":161,"quote":"Insertion sort\nin which the proper location for the next item is found with a\nbinary search\n.","source_id":"nist-dads.binaryinsort","source_sha256":"1f48745d5aafced4843c7e37f577880ba1d0d79e5b9675e99823125f68bc79ad","start":68}],"target_id":"method.nist.binaryinsort","target_kind":"node","target_sha256":"f837d6f56ebe2ed25737e020b9213068d688ffa61b1dd34a2a675412e1f13d1f"}],"method.nist.binarysearch":[{"id":"assertion.method.nist.binarysearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary search as: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.","support":[{"end":407,"quote":"Search a\nsorted array\nby repeatedly dividing the search interval in half.  Begin with an interval covering the whole array. If the value of the search\nkey\nis less than the item in the middle of the interval, narrow the interval to the lower half.  Otherwise narrow it to the upper half.  Repeatedly check until the value is found or the interval is empty.","source_id":"nist-dads.binarysearch","source_sha256":"68aa31889be5cd50665f583de20e5f87b7b15216d0e38b35ca75c70289d58572","start":52}],"target_id":"method.nist.binarysearch","target_kind":"node","target_sha256":"33d4f59bf845e0ff05b2879f7fb21a64917541b413b2c8c41516c109ec973fdb"}],"method.nist.bingosort":[{"id":"assertion.method.nist.bingosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bingo sort as: A variant of selection sort that orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass. This is more efficient than selection sort if there are many duplicate values.","support":[{"end":322,"quote":"A variant of\nselection sort\nthat orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass.  This is more efficient than selection sort if there are many duplicate values.","source_id":"nist-dads.bingosort","source_sha256":"109f1f858e8b25c4620db9cc61b8438c160ede455affb85cd14a857b67209a1a","start":46}],"target_id":"method.nist.bingosort","target_kind":"node","target_sha256":"81720bd0b32c5426d7f0c8be4eaca839068579d19a27f2b2c4d137152a87b3ad"}],"method.nist.bitonicsort":[{"id":"assertion.method.nist.bitonicsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bitonic sort as: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort.","support":[{"end":172,"quote":"Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged.\nAlso known as\nBatcher sort.","source_id":"nist-dads.bitonicsort","source_sha256":"8ee8c8f8c8b5e6b412b363124b8e6e4848060d1f4342f83ec15775ac8ec6943d","start":50}],"target_id":"method.nist.bitonicsort","target_kind":"node","target_sha256":"bd09ab17af42d7a9b00f783010fa370ae71cf18cd4a08539121686a3da795628"}],"method.nist.blindsort":[{"id":"assertion.method.nist.blindsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blind sort as: A specialized sort algorithm that first builds a blind trie , then traverse the tree left to right.","support":[{"end":145,"quote":"A specialized\nsort\nalgorithm that first builds a\nblind trie\n, then traverse the tree left to right.","source_id":"nist-dads.blindsort","source_sha256":"607c5cf624646d7e3ec3c37b64b063102630c53ac8f8b8fb6df82a712ea4b294","start":46}],"target_id":"method.nist.blindsort","target_kind":"node","target_sha256":"cdbcf2621e2ca998b89d1ea14b11dde0100faf32779ff51486f892a837430f90"}],"method.nist.bogosort":[{"id":"assertion.method.nist.bogosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bogosort as: A terribly inefficient sort algorithm that repeatedly generates a random permutation of the items until the items are in order.","support":[{"end":169,"quote":"A terribly inefficient\nsort\nalgorithm that repeatedly generates a random\npermutation\nof the items until the items are in order.","source_id":"nist-dads.bogosort","source_sha256":"af8637fb0b6e9a90c10ca2fc9a5abae9c538f5429a7620e0931aa527a9dfaa03","start":42}],"target_id":"method.nist.bogosort","target_kind":"node","target_sha256":"2cfdfe8c7fe5911d9f64827255046dc8f6fb046f288ce7d53e240194f1dadd4f"}],"method.nist.bondseqsearch":[{"id":"assertion.method.nist.bondseqsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bond Sequential Search as: Search an array or list for two keys at once by using the bitwise or of the keys as the search key. When a possible match is found, compare each key against the item.","support":[{"end":237,"quote":"Search an\narray\nor\nlist\nfor two\nkeys\nat once by using the bitwise\nor\nof the keys as the search key.  When a possible match is found, compare each key against the item.","source_id":"nist-dads.bondseqsearch","source_sha256":"fa949d2c8fff88e0c151433496955902cb3956482c165cca2ef31a574f753254","start":70}],"target_id":"method.nist.bondseqsearch","target_kind":"node","target_sha256":"ead2091d036bd04e0436ee26b522728c2ae5db9a8bd712511498b86807aa9148"}],"method.nist.boruvkasalgorithm":[{"id":"assertion.method.nist.boruvkasalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Boruvka's algorithm as: Compute a minimum spanning tree .","support":[{"end":97,"quote":"Compute a\nminimum spanning tree\n.","source_id":"nist-dads.boruvkasalgorithm","source_sha256":"25c92ed6531755fe4de27776910c41387ec86d9a5071629d36057c33a9ba8165","start":64}],"target_id":"method.nist.boruvkasalgorithm","target_kind":"node","target_sha256":"e47d32c87eeaf46f6988c02143204c3ec0d783bc828ffdd395b7bd1c1ac8a0a4"}],"method.nist.boyermoore":[{"id":"assertion.method.nist.boyermoore","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Boyer-Moore as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the Knuth-Morris-Pratt algorithm and the next matching position in the pattern .","support":[{"end":343,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the\npattern\nto its beginning.  When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the\nKnuth-Morris-Pratt algorithm\nand the next matching position in the\npattern\n.","source_id":"nist-dads.boyermoore","source_sha256":"e19956dc3d71bdf474ef374a70d8c4f1005b0cfecd562750deac813672a88b0c","start":48}],"target_id":"method.nist.boyermoore","target_kind":"node","target_sha256":"46eada8823b8b0921e16cd21c6150ff292232703c044babbf58d43e13be2968b"}],"method.nist.boyermoorehorspool":[{"id":"assertion.method.nist.boyermoorehorspool","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Boyer-Moore-Horspool as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next matching position in the pattern. Also known as Horspool.","support":[{"end":280,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the\npattern\nto its beginning.  When characters don't match, searching jumps to the next matching position in the pattern.\nAlso known as\nHorspool.","source_id":"nist-dads.boyermoorehorspool","source_sha256":"cbdfc6665e1427284866a166c52ec7b885958582e8c956c1a9d2366b1106bc6b","start":66}],"target_id":"method.nist.boyermoorehorspool","target_kind":"node","target_sha256":"dbdb1cf5ea37c062cfe48976eb31c1319c84bd99e8b08b4e2fe559685d678714"}],"method.nist.bozosort":[{"id":"assertion.method.nist.bozosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bozo sort as: A terribly inefficient sort algorithm that randomly swaps items until they are in order.","support":[{"end":132,"quote":"A terribly inefficient\nsort\nalgorithm that randomly swaps items until they are in order.","source_id":"nist-dads.bozosort","source_sha256":"e87f037ca9f60d7ace6d165bfc6546b75ad73dca994f75ee3bc1b11532e46347","start":44}],"target_id":"method.nist.bozosort","target_kind":"node","target_sha256":"b62e738ce5fd2e81ded7919a1d0a01e3c0c7a95db1d116ff929e557f37c55c3d"}],"method.nist.branchnbound":[{"id":"assertion.method.nist.branchnbound","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines branch and bound as: An algorithmic technique to find the optimal solution by keeping the best solution found so far. If a partial solution cannot improve on the best, it is abandoned.","support":[{"end":234,"quote":"An algorithmic technique to find the optimal solution by keeping the best solution found so far.  If a partial solution cannot improve on the best, it is abandoned.","source_id":"nist-dads.branchnbound","source_sha256":"9bfe6473a02dc163b315dddc9a463a234c65e394d078138766ce3d3ce0fc8a62","start":70}],"target_id":"method.nist.branchnbound","target_kind":"node","target_sha256":"5dabd87c9ae1c6cc47405698f735445b7d9ef67900299d548dbe6f7beae52e36"}],"method.nist.breadthfirst":[{"id":"assertion.method.nist.breadthfirst","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines breadth-first search as: Any search algorithm that considers neighbors of a vertex , that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue .","support":[{"end":308,"quote":"Any search algorithm that considers neighbors of a\nvertex\n, that is, outgoing\nedges\nof the vertex's predecessor in the search, before any outgoing edges of the vertex.  Extremes are searched last.  This is typically implemented with a\nqueue\n.","source_id":"nist-dads.breadthfirst","source_sha256":"ce8bb0255160e02d3de2a9883def59bcdff82db18419f6a37014d63ee2881213","start":66}],"target_id":"method.nist.breadthfirst","target_kind":"node","target_sha256":"773605ff26593cf1b41aa5cffa4b51ecacbf189a0459270a0d4ddd1b92c30de8"}],"method.nist.bresenham":[{"id":"assertion.method.nist.bresenham","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bresenham's algorithm as: An efficient algorithm to render a line with pixels. The long dimension is incremented for each pixel, and the fractional slope is accumulated.","support":[{"end":212,"quote":"An efficient algorithm to render a line with pixels.  The long dimension is incremented for each pixel, and the fractional slope is accumulated.","source_id":"nist-dads.bresenham","source_sha256":"6fd5bc9218673dc1667d8b8f4fdac3b3e12b6b1448aad41f19537fa8e92d43bb","start":68}],"target_id":"method.nist.bresenham","target_kind":"node","target_sha256":"e041cb3cc3dafac0566c4d9e62bcc6e597d971d09d85feb016a53dfa7e728dd9"}],"method.nist.britishmuseum":[{"id":"assertion.method.nist.britishmuseum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines British Museum technique as: Find a solution by checking all possibilities one by one, beginning with the smallest. This is a conceptual, not a practical, technique where the number of possibilities are enormous.","support":[{"end":270,"quote":"Find a solution by checking all possibilities one by one, beginning with the smallest.  This is a conceptual, not a practical, technique where the number of possibilities are enormous.","source_id":"nist-dads.britishmuseum","source_sha256":"59e9e77942707d622ae83aa66557b5c9ed49d22fff7de3759578a03c040fd247","start":86}],"target_id":"method.nist.britishmuseum","target_kind":"node","target_sha256":"083f44f18936a24be5e8ace13f65272c9c363a143047f86e1d7ae2cb76fd8c60"}],"method.nist.bruteforce":[{"id":"assertion.method.nist.bruteforce","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force as: An algorithm that inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","support":[{"end":174,"quote":"An\nalgorithm\nthat inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","source_id":"nist-dads.bruteforce","source_sha256":"b44ecdae2a9185db68d3a64479946814c45fdee22cd09846f8fe02533b69b171","start":60}],"target_id":"method.nist.bruteforce","target_kind":"node","target_sha256":"116317e6c72c1eae18be86b3c523056f4bb6c3f0d6d93beffd303ad9c85ba7ad"}],"method.nist.bruteforcestringsearch":[{"id":"assertion.method.nist.bruteforcestringsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force string search as: Find a string in another string or body of text by trying each position one at a time. There are many far faster string matching algorithms. Also known as naive string search.","support":[{"end":252,"quote":"Find a\nstring\nin another string or body of text by trying each position one at a time.  There are many far faster\nstring matching\nalgorithms.\nAlso known as\nnaive string search.","source_id":"nist-dads.bruteforcestringsearch","source_sha256":"eff3ffda4931b56f1ecaa33f0e7689ffc8f15b740fc71de67958daf0a846d755","start":76}],"target_id":"method.nist.bruteforcestringsearch","target_kind":"node","target_sha256":"2992aae44b8d9ff3d898f244b92aec8d03bdebc5fc0051875f052e540fcb7a69"}],"method.nist.bruteforcestrsrchwmismatch":[{"id":"assertion.method.nist.bruteforcestrsrchwmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force string search with mismatches as: Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the pattern and the substring beginning at that position don't match (the Hamming distance ). Return the first position with k or fewer mismatches.","support":[{"end":381,"quote":"Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the\npattern\nand the substring beginning at that position don't match (the\nHamming distance\n).  Return the first position with k or fewer mismatches.","source_id":"nist-dads.bruteforcestrsrchwmismatch","source_sha256":"aa5950d5956a374a5aefc7599759bd2f50730a86f5baa1215b4d5f8d2f025c76","start":108}],"target_id":"method.nist.bruteforcestrsrchwmismatch","target_kind":"node","target_sha256":"604e12c00757e29b59c6ffd3644cd4cb2d2475d140d5d7e8ba82ebd822c771f2"}],"method.nist.bubblesort":[{"id":"assertion.method.nist.bubblesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bubble sort as: Sort by comparing each adjacent pair of items in a list in turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done. Also known as sinking sort, exchange sort.","support":[{"end":253,"quote":"Sort by comparing each adjacent pair of items in a\nlist\nin turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done.\nAlso known as\nsinking sort, exchange sort.","source_id":"nist-dads.bubblesort","source_sha256":"e5b5afb0bf3731c6ff10c0a01d478eef9dd4b7ad68faabd3b749ee8d508af782","start":48}],"target_id":"method.nist.bubblesort","target_kind":"node","target_sha256":"35b5c006fb5df908d5f1bc442b514e4400fb8ba1904f8ebe1175e5f39d8ecdae"}],"method.nist.bucketsort":[{"id":"assertion.method.nist.bucketsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bucket sort as: A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key . Each bucket is sorted if necessary, and the buckets' contents are concatenated. Also known as bin sort.","support":[{"end":287,"quote":"A\ndistribution sort\nwhere input elements are initially  distributed to several\nbuckets\nbased on an interpolation of the element's\nkey\n. Each bucket is sorted if necessary, and the buckets' contents are concatenated.\nAlso known as\nbin sort.","source_id":"nist-dads.bucketsort","source_sha256":"f910086f6a3aef25d3b9f604975650cff905bf64b8d3c600598def8bc226d7f3","start":48}],"target_id":"method.nist.bucketsort","target_kind":"node","target_sha256":"da6bfc3c0fad4772c81bd1b8b91026da4d49e0cd52521e0562cb9db5f35ad020"}],"method.nist.buddysystem":[{"id":"assertion.method.nist.buddysystem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines buddy system as: A memory allocation strategy which recursively divides allocatable blocks of memory into pairs of adjacent equal-sized blocks called \"buddies\".","support":[{"end":193,"quote":"A memory allocation strategy which recursively divides allocatable\nblocks\nof memory into pairs of adjacent equal-sized blocks called \"buddies\".","source_id":"nist-dads.buddysystem","source_sha256":"63122ce9efd9bff983b5c7cea559da442df9d4f5b1553356c7a6549b12b081fd","start":50}],"target_id":"method.nist.buddysystem","target_kind":"node","target_sha256":"4b62c68c30377b413185dd62e5bd27e1e839943f12dd17d5bd5a493eb2ad9287"}],"method.nist.buildheap":[{"id":"assertion.method.nist.buildheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines build-heap as: Convert an array into a heap by executing heapify progressively closer to the root . For an array of n nodes, this takes O(n) time under the comparison model.","support":[{"end":205,"quote":"Convert an\narray\ninto a\nheap\nby executing\nheapify\nprogressively closer to the\nroot\n.  For an array of n nodes, this takes\nO(n)\ntime under the comparison model.","source_id":"nist-dads.buildheap","source_sha256":"d35d7367ab0d1761832cb6542392b4c0a4c95871c7d88fd27d1d3976f5c6db37","start":46}],"target_id":"method.nist.buildheap","target_kind":"node","target_sha256":"3c57331f2a0da196db3a952d78f98d72037777a6b6bb04510be4cdd8e714b5f0"}],"method.nist.burrowswheelertransform":[{"id":"assertion.method.nist.burrowswheelertransform","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Burrows-Wheeler transform as: Permute a string . Repeated substrings lead to repeated characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string. Also known as BWT.","support":[{"end":334,"quote":"Permute\na\nstring\n. Repeated\nsubstrings\nlead to repeated  characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string.\nAlso known as\nBWT.","source_id":"nist-dads.burrowswheelertransform","source_sha256":"ef77742cd477739d2a97f2bd31e18b2096f32eee01bfed6426ebd32ddaf9d037","start":76}],"target_id":"method.nist.burrowswheelertransform","target_kind":"node","target_sha256":"a197ec0fc277917f5604f7c93c36c849126077a82e2377ce4bd9f5a2ce620fa1"}],"method.nist.caverphone":[{"id":"assertion.method.nist.caverphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Caverphone as: An algorithm to code English names phonetically.","support":[{"end":94,"quote":"An algorithm to code English names phonetically.","source_id":"nist-dads.caverphone","source_sha256":"b22f2910bd48fdd11ca56582c3d48bbebf169720e058be463f17c971f72933aa","start":46}],"target_id":"method.nist.caverphone","target_kind":"node","target_sha256":"c073e5fdefa190c45a4cda4438bf71ae04fff25784b00e6cf125b9a6d6c516ce"}],"method.nist.chinesermndr":[{"id":"assertion.method.nist.chinesermndr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Chinese remainder theorem as: An integer n can be solved uniquely mod LCM(A(i)) , given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","support":[{"end":405,"quote":"An integer n can be solved uniquely mod\nLCM(A(i))\n, given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","source_id":"nist-dads.chinesermndr","source_sha256":"a5d2aff31e24d38ff54046658375ebf9c78f8d305edae63623ac9fcbdb4c0efc","start":76}],"target_id":"method.nist.chinesermndr","target_kind":"node","target_sha256":"5c962a00ef9e1f9cf1bb2a4ac9541863c558cfb66a67050e6c05f27424ad6767"}],"method.nist.christofides":[{"id":"assertion.method.nist.christofides","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Christofides algorithm as: (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Step 1: find a minimum spanning tree T. Step 2: find a perfect matching M among vertices with odd degree . Step 3: combine the edges of M and T to make a multigraph G. Step 4: find an Euler cycle in G. Step 5: Turn the Euler cycle into a Hamiltonian cycle by skipping vertices already seen. (2) An algorithm to find the chromatic number of a graph.","support":[{"end":516,"quote":"(1) A\nheuristic\nalgorithm\nto find a near-optimal solution to the\ntraveling salesman\nproblem.  Step 1: find a\nminimum spanning tree\nT.  Step 2: find a\nperfect matching\nM among\nvertices\nwith odd\ndegree\n.  Step 3: combine the\nedges\nof M and T to make a\nmultigraph\nG.  Step 4: find an\nEuler cycle\nin G. Step 5: Turn the Euler cycle into a\nHamiltonian cycle\nby skipping vertices already seen.  (2) An algorithm to find the\nchromatic number\nof a graph.","source_id":"nist-dads.christofides","source_sha256":"ecf5ed84afd2fd3e12d6ef7876af308715463e49a62169f49e643c8af95a30b2","start":70}],"target_id":"method.nist.christofides","target_kind":"node","target_sha256":"3fd59a2a8bf1d1b6c784e63b1e6a498b8d738e246d0c483b2d952a049bf6978a"}],"method.nist.collectiverecursion":[{"id":"assertion.method.nist.collectiverecursion","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collective recursion as: A special form of tail recursion , where the results are produced during the recursive calls and nothing is returned. The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","support":[{"end":413,"quote":"A special form of\ntail recursion\n, where the results are produced during the recursive calls and nothing is returned.  The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","source_id":"nist-dads.collectiverecursion","source_sha256":"2c80087304eba3ba26c5bbe849b17e899f4fa8f4ae78aba4318341de17bc6fb8","start":78}],"target_id":"method.nist.collectiverecursion","target_kind":"node","target_sha256":"1e51ccc50f85862b98c4f063331a17cc47eb95bfb8357ec1fecc834cafef1804"}],"method.nist.collisionres":[{"id":"assertion.method.nist.collisionres","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collision resolution scheme as: A way of handling collisions , that is, when two or more items should be kept in the same location, especially in a hash table . The general ways are keeping subsequent items within the table and computing possible locations ( open addressing ), keeping lists for items that collide ( chaining ), or keeping one special overflow area.","support":[{"end":414,"quote":"A way of handling\ncollisions\n, that is, when two or more items should be kept in the same location, especially in a\nhash table\n. The general ways are keeping subsequent items within the table and computing possible locations (\nopen addressing\n), keeping\nlists\nfor items that collide (\nchaining\n), or keeping one special overflow area.","source_id":"nist-dads.collisionres","source_sha256":"2da275a63b8dcc87a94371fd6009120b18cc16bf4501a8cfcfcc0bce2c2bd406","start":80}],"target_id":"method.nist.collisionres","target_kind":"node","target_sha256":"06b370e03c9f3a15f4e5b072827401de2727e1f486111c061b1240b9a96563d9"}],"method.nist.combination":[{"id":"assertion.method.nist.combination","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines combination as: Choose m of n elements, where m ≤ n.","support":[{"end":84,"quote":"Choose m of n elements, where m ≤ n.","source_id":"nist-dads.combination","source_sha256":"e9fb06cb9235614d52875dd640d003e7948f63534c15a668c5bf76f07ee5b14c","start":48}],"target_id":"method.nist.combination","target_kind":"node","target_sha256":"91d377ea34ac03fadd8181607b0838b4dc88208df163219cf4671cef7cc27fa5"}],"method.nist.combsort":[{"id":"assertion.method.nist.combsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines comb sort as: An in-place sort algorithm that repeatedly reorders different pairs of items. On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3). The gap starts at about 3/4 of the number of items. Continue until the gap is 1 and a pass had no swaps.","support":[{"end":353,"quote":"An\nin-place sort\nalgorithm that repeatedly reorders different pairs of items.  On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3).  The gap starts at about 3/4 of the number of items.  Continue until the gap is 1 and a pass had no swaps.","source_id":"nist-dads.combsort","source_sha256":"aa71a9b7d4e5267551b5ded093872158e37f2b6b588ee93f9dfd71d033aa512b","start":44}],"target_id":"method.nist.combsort","target_kind":"node","target_sha256":"8f775d480b5b91987112339341cedbac7e7bb0ffebe8baee8e9feb7002fd0a2c"}],"method.nist.commentzwalter":[{"id":"assertion.method.nist.commentzwalter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Commentz-Walter as: A multiple string matching algorithm that compares from the end of the pattern , like Boyer-Moore , using a finite state machine , like Aho-Corasick .","support":[{"end":206,"quote":"A multiple\nstring matching\nalgorithm that compares from the end of the\npattern\n, like\nBoyer-Moore\n, using a\nfinite state machine\n, like\nAho-Corasick\n.","source_id":"nist-dads.commentzwalter","source_sha256":"3e491e4e43dc46819b457b8b791bd22b6b20e99613ae81683adfe477e75c6202","start":56}],"target_id":"method.nist.commentzwalter","target_kind":"node","target_sha256":"7a3329395ee5bd1df124ec480e71551be85550c4768410ad5236ca1467f4e206"}],"method.nist.cordic":[{"id":"assertion.method.nist.cordic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CORDIC as: Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","support":[{"end":199,"quote":"Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","source_id":"nist-dads.cordic","source_sha256":"a3e5b40038389bd9f1bed2ab9478f406d0b5802f011026f7fb14be7e2ec92aa0","start":38}],"target_id":"method.nist.cordic","target_kind":"node","target_sha256":"e637b27dda85398d4f3fdbc592b29f61b7d55929bdb0053af5a9d252873ffa13"}],"method.nist.countingsort":[{"id":"assertion.method.nist.countingsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines counting sort as: A 2-pass sort algorithm that is efficient when the number of distinct keys is small compared to the number of items. The first pass counts the occurrences of each key in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding keys. The second pass puts each item in its final place according to the auxiliary entry for that key.","support":[{"end":429,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the number of distinct\nkeys\nis small compared to the number of items.  The first pass counts the occurrences of each key in an auxiliary\narray\n, and then makes a running total so each auxiliary entry is the number of preceding keys.  The second pass puts each item in its final place according to the auxiliary entry for that key.","source_id":"nist-dads.countingsort","source_sha256":"2dd515e2de79d069b3f21249ef0ad68d729686008544106ad8613cedfe5452b9","start":52}],"target_id":"method.nist.countingsort","target_kind":"node","target_sha256":"d4db387c8f645073694fd09e1b0fef5e84cce2f3881821c2cd332fb7c5a7b66b"}],"method.nist.cyclicredundancycheck":[{"id":"assertion.method.nist.cyclicredundancycheck","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cyclic redundancy check as: (1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of polynomials over the integers, modulo 2. (3) The characteristic bits of a block. Also known as CRC.","support":[{"end":364,"quote":"(1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of\npolynomials\nover the integers, modulo 2. (3) The characteristic bits of a block.\nAlso known as\nCRC.","source_id":"nist-dads.cyclicredundancycheck","source_sha256":"11713b402daaccbf9b437784135124eee852e05322bf096062c94eb1f41fbecb","start":72}],"target_id":"method.nist.cyclicredundancycheck","target_kind":"node","target_sha256":"f642a517705b12e0d9cc33b72b2df196f9c02f7e577ffac43818d3e0b9f32cbb"}],"method.nist.dagshortpath":[{"id":"assertion.method.nist.dagshortpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines DAG shortest paths as: Solve the single-source shortest-path problem in a weighted directed acyclic graph by 1) doing a topological sort on the vertices by edge so vertices with no incoming edges are first and vertices with only incoming edges are last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","support":[{"end":556,"quote":"Solve the\nsingle-source shortest-path problem\nin a\nweighted\ndirected acyclic graph\nby 1) doing a\ntopological sort\non the\nvertices\nby\nedge\nso vertices with no incoming\nedges\nare first and vertices with only incoming\nedges\nare last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","source_id":"nist-dads.dagshortpath","source_sha256":"3532b3cb67b505d527199a77a0030576ad4c412b6f20ede897e623f25ab48041","start":62}],"target_id":"method.nist.dagshortpath","target_kind":"node","target_sha256":"0b769ff554ce5056bac23b443145db20e87961d38e867186cae63e08820d7706"}],"method.nist.depthfirst":[{"id":"assertion.method.nist.depthfirst","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines depth-first search as: (1) Any search algorithm that considers outgoing edges ( children ) of a vertex before any of the vertex's siblings , that is, outgoing edges of the vertex's predecessor in the search. Extremes are searched first. This is easily implemented with recursion . (2) An algorithm that marks all vertices in a directed graph in the order they are discovered and finished, partitioning the graph into a forest . Also known as DFS.","support":[{"end":489,"quote":"(1) Any search algorithm that considers outgoing\nedges\n(\nchildren\n) of a\nvertex\nbefore any of the vertex's\nsiblings\n, that is, outgoing  edges of the vertex's predecessor in the search.  Extremes are searched first.  This is easily implemented with\nrecursion\n.  (2) An algorithm that marks all vertices in a\ndirected graph\nin the order they are discovered and finished, partitioning the graph into a\nforest\n.\nAlso known as\nDFS.","source_id":"nist-dads.depthfirst","source_sha256":"1d66559ce426dcbae32bbeec3c58b61535000e4dc46efa8728bfbe8d4e4c283d","start":62}],"target_id":"method.nist.depthfirst","target_kind":"node","target_sha256":"7822907d6e361dfc3ab95bf077208b1cf9f3544d1ba7081e0fc7e52d496403d3"}],"method.nist.derangement":[{"id":"assertion.method.nist.derangement","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines derangement as: A permutation of elements, where no element is in its original position.","support":[{"end":120,"quote":"A\npermutation\nof elements, where no element is in its original position.","source_id":"nist-dads.derangement","source_sha256":"734e1e1f2c80d9fd0b2473336a099252918ebc7a71f3bcd454b9c24e2fbb8d0b","start":48}],"target_id":"method.nist.derangement","target_kind":"node","target_sha256":"9c33e18ee047cba34802a006d5fc0d5c037c200c1fa1fb47f6a5079810d06cac"}],"method.nist.determfinitautsrch":[{"id":"assertion.method.nist.determfinitautsrch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic finite automata string search as: A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.","support":[{"end":314,"quote":"A\nstring matching\nalgorithm which builds a\ndeterministic finite state machine\nto recognize the search string.  The machine is then run at each location in turn.  If the machine accepts, that is a match.","source_id":"nist-dads.determfinitautsrch","source_sha256":"bc126febdbef4b1731e1bfff69fc7fb75f24a50b83e6654f3986ec7566bff0dc","start":112}],"target_id":"method.nist.determfinitautsrch","target_kind":"node","target_sha256":"56f103a0b2e9a45a48ca8a8258a3c2b871e3a2d8abf0fb4d5fbe2c9cb37c28a7"}],"method.nist.deterministicalgorithm":[{"id":"assertion.method.nist.deterministicalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic algorithm as: An algorithm whose behavior can be completely predicted from the input.","support":[{"end":155,"quote":"An\nalgorithm\nwhose behavior can be completely predicted from the input.","source_id":"nist-dads.deterministicalgorithm","source_sha256":"fe738db4c1e81974f341bbd7eee122ba72e77a49d43869f05fb5d413bf1b3f60","start":84}],"target_id":"method.nist.deterministicalgorithm","target_kind":"node","target_sha256":"6748a3455381d9fdb7238b44081bfc108e6738b2480c9ecb911e7ec0bc6708d6"}],"method.nist.deutschjozsaalgo":[{"id":"assertion.method.nist.deutschjozsaalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Deutsch-Jozsa algorithm as: A quantum algorithm to determine whether a function is constant or balanced, that is, returns 1 for half the domain and 0 for the other half. For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this exclusive or 's the result with the answer qubit. Finally, do Hadamards on the n inputs again, and measure the answer qubit. If it is 0, the function is constant, otherwise the function is balanced.","support":[{"end":594,"quote":"A quantum algorithm to determine whether a function is\nconstant\nor balanced, that is, returns 1 for half the\ndomain\nand 0 for the other half.  For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this\nexclusive or\n's the result with the answer qubit.  Finally, do Hadamards on the n inputs again, and measure the answer qubit.  If it is 0, the function is constant, otherwise the function is balanced.","source_id":"nist-dads.deutschjozsaalgo","source_sha256":"944e4ae3bc5fc04c502c49842e0d62ada81e402171c8d18bbf5d612b01d0026d","start":72}],"target_id":"method.nist.deutschjozsaalgo","target_kind":"node","target_sha256":"3eb9b5a8149f298010035fcc5a103447703f46022d82beb7559049345f8c23de"}],"method.nist.dijkstraalgo":[{"id":"assertion.method.nist.dijkstraalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Dijkstra's algorithm as: An algorithm to find the shortest paths from a single source vertex to all other vertices in a weighted, directed graph . All weights must be nonnegative.","support":[{"end":221,"quote":"An algorithm to find the\nshortest paths\nfrom a single\nsource\nvertex\nto all other vertices in a\nweighted, directed graph\n.  All weights must be nonnegative.","source_id":"nist-dads.dijkstraalgo","source_sha256":"92fbe3f77c70cb66956d14187e0121c7bf784eb5e8c35ec8f578c5d7c5a98aca","start":66}],"target_id":"method.nist.dijkstraalgo","target_kind":"node","target_sha256":"84a68b8eb865831e8a51df8dbdd0bec2adcefcb71a1561263e4844848563384b"}],"method.nist.diminishingincsort":[{"id":"assertion.method.nist.diminishingincsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diminishing increment sort as: An in-place sort algorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items. Each set is every i th item, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc. On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","support":[{"end":476,"quote":"An\nin-place sort\nalgorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items.  Each set is every i\nth\nitem, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc.  On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","source_id":"nist-dads.diminishingincsort","source_sha256":"a4ca64787e2e33292b2bb98a3c186857f0226fafdb02ec0388d433fc511412f2","start":78}],"target_id":"method.nist.diminishingincsort","target_kind":"node","target_sha256":"9eac35e88982d38ed41739d2098a596f6c0bd7e94b8832bb88b77c927c7cfe35"}],"method.nist.distributionsort":[{"id":"assertion.method.nist.distributionsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distribution sort as: Any sort algorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","support":[{"end":208,"quote":"Any\nsort\nalgorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","source_id":"nist-dads.distributionsort","source_sha256":"3894d81800ce34e2e99cc4a9d85c283af11c36795efb19fb4b0ef343bfa78a90","start":60}],"target_id":"method.nist.distributionsort","target_kind":"node","target_sha256":"a7a4f845bdea7393aa6402a340d75c40dee640b95b2dc79c85e6d93dc67e5133"}],"method.nist.distributivepartitioningsort":[{"id":"assertion.method.nist.distributivepartitioningsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distributive partitioning sort as: Step 1: find the median key . Step 2: distribute the n items into n/2 buckets linearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum. Step 3: compact the buckets, removing empty buckets. Recursively start again at step 1 for any bucket with multiple items. Linked lists are used to avoid moving items until a final phase and to avoid bucket overflows.","support":[{"end":525,"quote":"Step 1: find the\nmedian\nkey\n. Step 2: distribute the n items into n/2\nbuckets\nlinearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum.   Step 3: compact the buckets, removing empty buckets.  Recursively start again at step 1 for any bucket with multiple items.\nLinked lists\nare used to avoid moving items until a final phase and to avoid bucket overflows.","source_id":"nist-dads.distributivepartitioningsort","source_sha256":"0e9e86422870e42a2081cd2487dc0e9e771c6e7acba20c14594bf9c961f0677e","start":86}],"target_id":"method.nist.distributivepartitioningsort","target_kind":"node","target_sha256":"5ed9c826ef727df0bd4620ba762c9b82239c6b331b92cf07fe41e8020a1f1cd1"}],"method.nist.divideandconquer":[{"id":"assertion.method.nist.divideandconquer","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines divide and conquer as: Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by dividing it into two or more smaller instances. Each of these smaller instances is recursively solved, and the solutions are combined to produce a solution for the original instance.","support":[{"end":377,"quote":"Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by\ndividing\nit into two or more smaller instances.  Each of these smaller instances is\nrecursively\nsolved, and the solutions are combined to produce a solution for the original instance.","source_id":"nist-dads.divideandconquer","source_sha256":"47b7a0164cf957b005b5dffb99a81ba6d4759967a38c0fea80b29cf36e0ebf4e","start":74}],"target_id":"method.nist.divideandconquer","target_kind":"node","target_sha256":"a9fb74d1cd33217ba01fb4d9927642de47515c033cf889a64513d70c3946942f"}],"method.nist.dividemarrig":[{"id":"assertion.method.nist.dividemarrig","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines divide and marriage before conquest as: A variant of divide and conquer in which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","support":[{"end":227,"quote":"A variant of\ndivide and conquer\nin which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","source_id":"nist-dads.dividemarrig","source_sha256":"6bc4fa57b4d362dda25c194311441052abc6621e5fdc4f66a928cda1b770db47","start":108}],"target_id":"method.nist.dividemarrig","target_kind":"node","target_sha256":"d401594d2ff539705969a5aac2f4b4e9a980d0a77ae0e3abc7d996f923335534"}],"method.nist.doomsday":[{"id":"assertion.method.nist.doomsday","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Doomsday rule as: An algorithm to find the day of the week for any date. It is simple enough to memorize and do mentally.","support":[{"end":156,"quote":"An algorithm to find the day of the week for any date.  It is simple enough to memorize and do mentally.","source_id":"nist-dads.doomsday","source_sha256":"a5a379a2e63fe46d9e42b7494a24d6f5178d09135e06097f20bba8c9b76787c1","start":52}],"target_id":"method.nist.doomsday","target_kind":"node","target_sha256":"3c99c29956260d38471c46570ffb5968a5bba119f48fa6ccd054f82b11680bfe"}],"method.nist.doublehashng":[{"id":"assertion.method.nist.doublehashng","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines double hashing as: A method of open addressing for a hash table in which a collision is resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing clustering . Also known as rehashing.","support":[{"end":276,"quote":"A method of\nopen addressing\nfor a\nhash table\nin which a\ncollision\nis resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing\nclustering\n.\nAlso known as\nrehashing.","source_id":"nist-dads.doublehashng","source_sha256":"a64b45a6ba996c9140c402f410fdddb3966671470f7e2a790b830e1cd56b179d","start":54}],"target_id":"method.nist.doublehashng","target_kind":"node","target_sha256":"741d1585568217b3ab307b4cf19ee8ac6b9360d3a3515759fb9a9aad1fda9b01"}],"method.nist.doublemetaphone":[{"id":"assertion.method.nist.doublemetaphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines double metaphone as: An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds. It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","support":[{"end":359,"quote":"An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds.   It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","source_id":"nist-dads.doublemetaphone","source_sha256":"fe4801d57ce59db3b947f496651e38e69c9c6ff62c02bba4425b6b3a977752f2","start":58}],"target_id":"method.nist.doublemetaphone","target_kind":"node","target_sha256":"3dca6bd089e31e1029be17b67c3982ae80f5dcc9a3eaf898b0b89a8d2fd843c2"}],"method.nist.dualpivotquicksort":[{"id":"assertion.method.nist.dualpivotquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dual-pivot quicksort as: Pick two elements from the array to be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","support":[{"end":319,"quote":"Pick two elements from the\narray\nto be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","source_id":"nist-dads.dualpivotquicksort","source_sha256":"0fbf27ccc3ac0504363198f2e09b53348569d81c56edec4196b5fe0b92bc5d35","start":66}],"target_id":"method.nist.dualpivotquicksort","target_kind":"node","target_sha256":"715e3234064ecb64bbc55539078335f28b98d00b018abbd0aee361477e1e5240"}],"method.nist.dynamicprog":[{"id":"assertion.method.nist.dynamicprog","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines dynamic programming as: Solve an optimization problem by caching subproblem solutions ( memoization ) rather than recomputing them.","support":[{"end":183,"quote":"Solve an\noptimization problem\nby caching subproblem solutions (\nmemoization\n) rather than recomputing them.","source_id":"nist-dads.dynamicprog","source_sha256":"3b04a362b511d3237ec862fdb693950bd750f4c65868d1ac88cbc093ee4e9f79","start":76}],"target_id":"method.nist.dynamicprog","target_kind":"node","target_sha256":"55c99e59cd24fdd56592d4c04cf4a3bf6ef4beffff2aeb890938005ee9db971b"}],"method.nist.dynamization":[{"id":"assertion.method.nist.dynamization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamization transformation as: A data structuring technique that can make a static data structure dynamic . In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","support":[{"end":266,"quote":"A data structuring technique that can make a\nstatic\ndata structure\ndynamic\n.  In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","source_id":"nist-dads.dynamization","source_sha256":"bc99568c3f762a79860cb6de4386a0b2bb0135fa5580e609955e6edd8f94ef70","start":92}],"target_id":"method.nist.dynamization","target_kind":"node","target_sha256":"783c68cf3c565ed4e5a452ed49999b647ae44295be9adc33aedd29028c7bd87f"}],"method.nist.easysplithardmerge":[{"id":"assertion.method.nist.easysplithardmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines easy split, hard merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","support":[{"end":269,"quote":"A\nrecursive\nalgorithm, especially a\nsort\nalgorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","source_id":"nist-dads.easysplithardmerge","source_sha256":"1d67055000ee567e6d2a50d489f3ba81c04cccfb41bf32b0d4bf953a09d2e0b5","start":82}],"target_id":"method.nist.easysplithardmerge","target_kind":"node","target_sha256":"33a31602aaaa2cabdb07280a99743fa0f15df41cc0b9de3d16c9789146939258"}],"method.nist.euclidalgo":[{"id":"assertion.method.nist.euclidalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Euclid's algorithm as: An algorithm to compute the greatest common divisor of two positive integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);} . The run time complexity is O((log a)(log b)) bit operations. Also known as Euclidean algorithm.","support":[{"end":314,"quote":"An algorithm to compute the\ngreatest common divisor\nof two positive integers.  It is\nEuclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);}\n.  The run time complexity is\nO((log a)(log b))\nbit operations.\nAlso known as\nEuclidean algorithm.","source_id":"nist-dads.euclidalgo","source_sha256":"03c113c74cb3ad356cf7e8e9645fcdec8e41efa1ec5e4fa5f0c7a713c4265bab","start":62}],"target_id":"method.nist.euclidalgo","target_kind":"node","target_sha256":"843ee59b7f7be413ec2c4f9663406c6320e0fd9aec44f2c6b302d48bcbfb64da"}],"method.nist.exhaustivesearch":[{"id":"assertion.method.nist.exhaustivesearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines exhaustive search as: An algorithm that finds a solution by trying every possibility.","support":[{"end":135,"quote":"An\nalgorithm\nthat finds a solution by trying every possibility.","source_id":"nist-dads.exhaustivesearch","source_sha256":"32e81d530691ab058602010165e499a140e10b0a4f7df777f73650cc8fb33bdd","start":72}],"target_id":"method.nist.exhaustivesearch","target_kind":"node","target_sha256":"fe334a9f425e4f40493d19578bde72b4fc56ad9ce3895421a02eef3b37ebdc0d"}],"method.nist.extendeuclid":[{"id":"assertion.method.nist.extendeuclid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended Euclid's algorithm as: An algorithm to find the greatest common divisor , g , of two positive integers, a and b , and coefficients, h and j , such that g = ha + jb .","support":[{"end":222,"quote":"An algorithm to find the\ngreatest common divisor\n,\ng\n, of two positive integers,\na\nand\nb\n, and coefficients,\nh\nand\nj\n, such that\ng = ha + jb\n.","source_id":"nist-dads.extendeuclid","source_sha256":"4c3c34da6e38f49ff9499ed7c91adeb7643a7b5292fee25e252aa6e75bdc53da","start":80}],"target_id":"method.nist.extendeuclid","target_kind":"node","target_sha256":"4c970fd0b00a554e43da25f0a28979243be9bb0b5380946f41768b14477265ab"}],"method.nist.externalmemoryalgo":[{"id":"assertion.method.nist.externalmemoryalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external memory algorithm as: An algorithm that is efficient when accessing most of the data is very slow, such as, on disk.","support":[{"end":170,"quote":"An\nalgorithm\nthat is efficient when accessing most of the data is very slow, such as, on disk.","source_id":"nist-dads.externalmemoryalgo","source_sha256":"068de27a9bbd80adfad82762073dad6f76990a920a58f8c07f6d250ef3c9a1a6","start":76}],"target_id":"method.nist.externalmemoryalgo","target_kind":"node","target_sha256":"b4f1100e322145cc820ffb30fbe4f89fc553134888e6ee5d0fe9a5d6871111c4"}],"method.nist.externalmerg":[{"id":"assertion.method.nist.externalmerg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external merge as: To combine multiple sorted data streams into a single sorted stream using external storage.","support":[{"end":145,"quote":"To combine multiple sorted data streams into a single sorted stream using external storage.","source_id":"nist-dads.externalmerg","source_sha256":"6a8ba04833c54d9279ebe8d2852f14408ca1813bab6920a09e6c813eb4289d68","start":54}],"target_id":"method.nist.externalmerg","target_kind":"node","target_sha256":"f0b1cbc7f1e09c27a6ba5cf5283f7a655dd23cc584e558e6ec72b3467ee55eba"}],"method.nist.externalquicksort":[{"id":"assertion.method.nist.externalquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external quicksort as: Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in quicksort ), and sort them. Read the next element from the beginning or end to balance writing. If the next element is less than the least of the buffer, write it to available space at the beginning. If greater than the greatest, write it to the end. Otherwise write the greatest or least of the buffer, and put the next element in the buffer. Keep the maximum lower and minimum upper keys written to avoid resorting middle elements that are in order. When done, write the buffer. Recursively sort the smaller partition, and loop to sort the remaining partition.","support":[{"end":717,"quote":"Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in\nquicksort\n), and sort them.  Read the next element from the beginning or end to balance writing.  If the next element is less than the least of the buffer, write it to available space at the beginning.  If greater than the greatest, write it to the end.  Otherwise write the greatest or least of the buffer, and put the next element in the buffer.  Keep the maximum lower and minimum upper\nkeys\nwritten to avoid resorting middle elements that are in order.   When done, write the buffer.\nRecursively\nsort the smaller partition, and loop to sort the remaining partition.","source_id":"nist-dads.externalquicksort","source_sha256":"323b941fbb390a40279706c21cd865e074122a3a16d398df91cf6f46b92dba39","start":62}],"target_id":"method.nist.externalquicksort","target_kind":"node","target_sha256":"aa14f0b169735da09ff8cc6e55c2c80016b324eda8a053325d770afa4efe9a7a"}],"method.nist.fastfouriertransform":[{"id":"assertion.method.nist.fastfouriertransform","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines fast fourier transform as: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain. Also known as FFT.","support":[{"end":191,"quote":"An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain.\nAlso known as\nFFT.","source_id":"nist-dads.fastfouriertransform","source_sha256":"7409e476ed8b14c5792c775e7f6e6861fdd94f9005f911e8c2471d62b435f261","start":70}],"target_id":"method.nist.fastfouriertransform","target_kind":"node","target_sha256":"5f5288d4e013fb394ad189f585eeb5c2b771c6d7d3b41167c00ce7be11b0a5c7"}],"method.nist.fathoming":[{"id":"assertion.method.nist.fathoming","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fathoming as: Pruning a search tree .","support":[{"end":79,"quote":"Pruning a\nsearch tree\n.","source_id":"nist-dads.fathoming","source_sha256":"4259b33e13dbe052144e118ef5763244781fda553a339ea5fc4ce82bbaec5703","start":56}],"target_id":"method.nist.fathoming","target_kind":"node","target_sha256":"61785987b48ca88a2b8e17bd683ac8b0c8c7384140a19a793b700e569a625b57"}],"method.nist.fibonacciansearch":[{"id":"assertion.method.nist.fibonacciansearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Fibonaccian search as: Search a sorted array by narrowing possible locations to progressively smaller intervals. Begin with two Fibonacci numbers , p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array. The first step checks location p. The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","support":[{"end":424,"quote":"Search a\nsorted array\nby narrowing possible locations to progressively smaller intervals.  Begin with two\nFibonacci numbers\n, p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array.  The first step checks location p.  The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","source_id":"nist-dads.fibonacciansearch","source_sha256":"5b19e28c2e2c873265e47fc224bd6b71b98c50dcd683ce3c27c505d076dce95e","start":62}],"target_id":"method.nist.fibonacciansearch","target_kind":"node","target_sha256":"01d2ff912f6814de32c15873e62326d06341faf5c7cdad9d3e331bf04cb3d485"}],"method.nist.find":[{"id":"assertion.method.nist.find","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Find as: An algorithm to select the k th smallest element of an array and partition the array around it. First, partition around the value of the k th element. If the split is not at element k, move the upper or lower boundary and partition again.","support":[{"end":274,"quote":"An algorithm to select the k\nth\nsmallest element of an array and\npartition\nthe array around it.  First, partition around the value of the k\nth\nelement.  If the split is not at element k, move the upper or lower boundary and partition again.","source_id":"nist-dads.find","source_sha256":"b3e2abf5740a0a0e793904cedae8f4c9fe7631ca779b030e1ba69034cbcf1f47","start":34}],"target_id":"method.nist.find","target_kind":"node","target_sha256":"d606be72d1118042bd158aacaf89b77223f79d33ca54d9afcbcc8b807cb078fc"}],"method.nist.floydwarshall":[{"id":"assertion.method.nist.floydwarshall","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Floyd-Warshall algorithm as: An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles . The time complexity is Θ (V³) .","support":[{"end":342,"quote":"An algorithm to solve the\nall pairs shortest path\nproblem in a\nweighted, directed graph\nby multiplying an\nadjacency-matrix representation\nof the graph multiple times.  The edges may have negative weights, but no negative weight\ncycles\n. The time complexity is\nΘ (V³)\n.","source_id":"nist-dads.floydwarshall","source_sha256":"001b4abb65d4a69980f23d845da2bf9165aced6ee6a66d3e313412bd58d681b2","start":74}],"target_id":"method.nist.floydwarshall","target_kind":"node","target_sha256":"6c53f26dfb8b817d120223f2b05829de5403cfb1eece7cc2d3ad44a9b381b445"}],"method.nist.fordfulkerson":[{"id":"assertion.method.nist.fordfulkerson","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ford-Fulkerson method as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a path from the source to the sink along which the flow can be increased and increase the flow. Repeat until there are no such paths.","support":[{"end":294,"quote":"Given a\nflow function\nand its corresponding residual graph (a\nmaximum-flow problem\n), select a\npath\nfrom the\nsource\nto the\nsink\nalong which the\nflow\ncan be increased and increase the flow. Repeat until there are no such paths.","source_id":"nist-dads.fordfulkerson","source_sha256":"1ef3b2adf59958d4250775d0264b450c7a17e9573a6bcadcdd69340f52fa6ac4","start":68}],"target_id":"method.nist.fordfulkerson","target_kind":"node","target_sha256":"b27555911422c8a9d4c92db7d65b2028c2944e942290cde63b6f8ddb309f9f31"}],"method.nist.frequencycounthueristic":[{"id":"assertion.method.nist.frequencycounthueristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines frequency count heuristic as: A heuristic that keeps the elements of a list ordered by number of times each element is the target of a search .","support":[{"end":189,"quote":"A\nheuristic\nthat keeps the elements of a\nlist\nordered by number of times each element is the target of a\nsearch\n.","source_id":"nist-dads.frequencycounthueristic","source_sha256":"bfbd608de914df28d200ab4a8febdf86dce3aa4bece3fbead07f586820fbc1f1","start":76}],"target_id":"method.nist.frequencycounthueristic","target_kind":"node","target_sha256":"1bc5f297732099a747df01d4249d1302fd5d1edb52becc3fccf7536952bf3f64"}],"method.nist.fullypolynml":[{"id":"assertion.method.nist.fullypolynml","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a 1+ε- approximation algorithm bounded by a polynomial in the length of the input and 1/ε.","support":[{"end":256,"quote":"A set of\nalgorithms\n{A\nε\n| ε > 0},  where each A\nε\nis a 1+ε-\napproximation algorithm\nbounded by a\npolynomial\nin the length of the input and 1/ε.","source_id":"nist-dads.fullypolynml","source_sha256":"a508d128c6edee09e41dae1ac00c4a37c02e5bbb8ed3fa75f6c03c3dadaadbfd","start":112}],"target_id":"method.nist.fullypolynml","target_kind":"node","target_sha256":"ebc96ce805913afbc38defdb40a013b5363765f29ec99940fb6e62e422a82a71"}],"method.nist.gnomesort":[{"id":"assertion.method.nist.gnomesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines gnome sort as: Put items in order by comparing the current item with the previous item. If they are in order, move to the next item (or stop if the end is reached). If they are out of order, swap them and move to the previous item. If there is no previous item, move to the next item.","support":[{"end":318,"quote":"Put items in order by comparing the current item with the previous item.  If they are in order, move to the next item (or stop if the end is reached).  If they are out of order, swap them and move to the previous item.  If there is no previous item, move to the next item.","source_id":"nist-dads.gnomesort","source_sha256":"1d373373f74207feb0122b220da59a13464ecf75fbe23f419bb3ac23c4718e5a","start":46}],"target_id":"method.nist.gnomesort","target_kind":"node","target_sha256":"884d447f2f16e3495ac11d17a4d313a4701ca9d2c36d50b266ccfd0c749fdf65"}],"method.nist.greatestcommondivisor":[{"id":"assertion.method.nist.greatestcommondivisor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines greatest common divisor as: (1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same. Also known as GCD, highest common factor.","support":[{"end":253,"quote":"(1) The greatest integer which is a divisor of given positive integers.  For instance, GCD(30, 42) = 6.  (2) An algorithm to find the same.\nAlso known as\nGCD, highest common factor.","source_id":"nist-dads.greatestcommondivisor","source_sha256":"972a6229e64bcc54d4856990084f4a235e774af40ae9b9a1c9c316a881c7c568","start":72}],"target_id":"method.nist.greatestcommondivisor","target_kind":"node","target_sha256":"f366d2584572f6c216a2deffc97a66b08b71a0456a735afa91acc823c537e3af"}],"method.nist.greedyalgo":[{"id":"assertion.method.nist.greedyalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines greedy algorithm as: An algorithm that always takes the best immediate, or local, solution while finding an answer. Greedy algorithms find the overall, or globally, optimal solution for some optimization problems , but may find less-than-optimal solutions for some instances of other problems.","support":[{"end":343,"quote":"An algorithm that always takes the best immediate, or local, solution while finding an answer.  Greedy algorithms find the overall, or globally,\noptimal solution\nfor some\noptimization problems\n, but may find less-than-optimal solutions for some instances of other problems.","source_id":"nist-dads.greedyalgo","source_sha256":"b726b175af45e8bdf4269abedd0918a9437dbbc66b666cb0bc7e30ee738cd6e6","start":70}],"target_id":"method.nist.greedyalgo","target_kind":"node","target_sha256":"1b31eb1f65bd8f79b85f1d4302e990ea4d4d317b27375d3b7575cf4d175b733c"}],"method.nist.greedyheuristic":[{"id":"assertion.method.nist.greedyheuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines greedy heuristic as: Solve an optimization problem by finding locally optimal solutions .","support":[{"end":138,"quote":"Solve an\noptimization problem\nby finding locally\noptimal solutions\n.","source_id":"nist-dads.greedyheuristic","source_sha256":"fd392b601e1051b399ff68c2754f18c0d0e9670f5b79197d5d0d314cd32d0ab4","start":70}],"target_id":"method.nist.greedyheuristic","target_kind":"node","target_sha256":"b034e1551ae50f91b3b4cd5d5f31bfddb81a9b102e6169010ec3d7c60dbd632a"}],"method.nist.hardspliteasymerge":[{"id":"assertion.method.nist.hardspliteasymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hard split, easy merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","support":[{"end":270,"quote":"A\nrecursive\nalgorithm, especially a\nsort\nalgorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","source_id":"nist-dads.hardspliteasymerge","source_sha256":"4d4c4d78456dae8c95ecb6646d0e381220ba5aabac3670dd1055eeba4a8a69c3","start":82}],"target_id":"method.nist.hardspliteasymerge","target_kind":"node","target_sha256":"2baf98fee5e829b9d832587962831997d1fa9799b244676c7387d911b47320e4"}],"method.nist.hash":[{"id":"assertion.method.nist.hash","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines hash function as: A function that maps keys to integers, usually to get an even distribution on a smaller set of values. Also known as hash.","support":[{"end":174,"quote":"A function that maps\nkeys\nto integers, usually to get an even distribution on a smaller set of values.\nAlso known as\nhash.","source_id":"nist-dads.hash","source_sha256":"a403ee883530b9788f5c3e72b1b1f562aa575c3839661f7f3135792cf781f2ae","start":52}],"target_id":"method.nist.hash","target_kind":"node","target_sha256":"57717db64dd84b812728ea461d1df06371c9cbcbfe54ff44659e7692e82f92d3"}],"method.nist.hashtabdelet":[{"id":"assertion.method.nist.hashtabdelet","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hash table delete as: If the hash table uses chaining , use the chaining data structure delete. If it uses open addressing , mark the item \"deleted\" for future reuse.","support":[{"end":205,"quote":"If the\nhash table\nuses\nchaining\n, use the chaining data structure delete.  If it uses\nopen addressing\n, mark the item \"deleted\" for future reuse.","source_id":"nist-dads.hashtabdelet","source_sha256":"3456c04766169ce18d864fd420f223611c3a34a81f2b171d51573e707d47dbfb","start":60}],"target_id":"method.nist.hashtabdelet","target_kind":"node","target_sha256":"c707165d2286fd56373f6379810ff1c2791d933fb725cdb1aca0a38d4013fd21"}],"method.nist.heapify":[{"id":"assertion.method.nist.heapify","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heapify as: Rearrange a heap to maintain the heap property , that is, the key of the root node is more extreme (greater or less) than or equal to the keys of its children . If the root node's key is not more extreme, swap it with the most extreme child key, then recursively heapify that child's subtree. The child subtrees must be heaps to start.","support":[{"end":377,"quote":"Rearrange a\nheap\nto maintain the\nheap property\n, that is, the\nkey\nof the\nroot\nnode\nis more extreme (greater or less) than or equal to the keys of its\nchildren\n.  If the root node's key is not more extreme, swap it with the most extreme child key, then\nrecursively\nheapify that child's subtree.  The child subtrees must be heaps to start.","source_id":"nist-dads.heapify","source_sha256":"aeaa5dbab3e5b7dba059ddda98111773b74620975a75bbbf702b79a0c17cd705","start":40}],"target_id":"method.nist.heapify","target_kind":"node","target_sha256":"a733254447a1a411f4f8af806393bd5b46fa7adec704953b3e12dd89f1eeffcd"}],"method.nist.heapsort":[{"id":"assertion.method.nist.heapsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines heapsort as: A sort algorithm that builds a heap , then repeatedly extracts the maximum item. Run time is O(n log n) .","support":[{"end":148,"quote":"A\nsort\nalgorithm that builds a\nheap\n, then repeatedly extracts the maximum item.  Run time is\nO(n log n)\n.","source_id":"nist-dads.heapsort","source_sha256":"33495638dc8092b72c4b3a860ccb9b5f115394bb20701cc1994ccdb2721f2039","start":42}],"target_id":"method.nist.heapsort","target_kind":"node","target_sha256":"d97aee44f6af8981ce017ccf0e14a92c31ab655b0b536f1ed29ff345c7dffaa5"}],"method.nist.heuristic":[{"id":"assertion.method.nist.heuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heuristic as: An algorithm that usually, but not always, works or that gives nearly the right answer.","support":[{"end":143,"quote":"An\nalgorithm\nthat usually, but not always, works or that gives nearly the right answer.","source_id":"nist-dads.heuristic","source_sha256":"c88fa411b177be6b5c6fc148d29238a00502fe94d3bda5b032ec97015ea84a3a","start":56}],"target_id":"method.nist.heuristic","target_kind":"node","target_sha256":"708baca77d2dec983fc8db10a636450d05a8f0eb8ff2bfbda7587f516c88851e"}],"method.nist.histogramsort":[{"id":"assertion.method.nist.histogramsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines histogram sort as: An efficient 3-pass refinement of a bucket sort algorithm. The first pass counts the number of items for each bucket in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding items. The second pass puts each item in its proper bucket according to the auxiliary entry for the key of that item. The last pass sorts each bucket. Also known as interpolation sort.","support":[{"end":465,"quote":"An efficient 3-pass refinement of a\nbucket sort\nalgorithm.   The first pass counts the number of items for each bucket in an auxiliary\narray\n, and then makes a running total so each auxiliary entry is the number of preceding items.  The second pass puts each item in its proper bucket according to the auxiliary entry for the\nkey\nof that item.  The last pass sorts each bucket.\nAlso known as\ninterpolation sort.","source_id":"nist-dads.histogramsort","source_sha256":"f7115927702f8dbd46861329bd480901e91d125b6ede73e5406ee96fdf6a4e50","start":54}],"target_id":"method.nist.histogramsort","target_kind":"node","target_sha256":"e3998329ec45709884d44177de451537e36e4cde23d58f09bd443771efbe72ab"}],"method.nist.hsadelta":[{"id":"assertion.method.nist.hsadelta","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hsadelta as: An algorithm to produce a sequence of insert and copy commands (an edit script ) which creates a new version file from a reference file. To begin, hash every block of the reference file and store every hash in a hash value array . Build a suffix array and three other data structures for quick access. Beginning at the first location in the version file, hash a block and look for the longest match in the reference file. Upon a match, encode an insert back to the previous match and a copy of the match. If no match, look at the next location. At the end, encode an insert for remaining unmatched characters.","support":[{"end":657,"quote":"An\nalgorithm\nto produce a sequence of insert and copy commands (an\nedit script\n) which creates a new version file from a reference file. To begin,\nhash\nevery block of the reference file and store every hash in a hash value\narray\n.  Build a\nsuffix array\nand three other data  structures for quick access.  Beginning at the first location in the version file, hash a block and look for the longest match in the reference file.  Upon a match, encode an insert back to the previous match and a copy of the match.  If no match, look at the next location.  At the end, encode an insert for remaining unmatched characters.","source_id":"nist-dads.hsadelta","source_sha256":"8d82824fcb907a529eb4850e274a345c1b535ac685dbf2dce3e6a0a8ccd2ab18","start":42}],"target_id":"method.nist.hsadelta","target_kind":"node","target_sha256":"21012502baffd9b8387d74a3b891dc3d10c9b79696f14b0836cfe98c41cbe793"}],"method.nist.huffmancoding":[{"id":"assertion.method.nist.huffmancoding","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Huffman coding as: A minimal variable-length character coding based on the frequency of each character. First, each character becomes a one-node binary tree , with the character as the only node . The character's frequency is the tree's frequency. Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree. One code bit represents each level . Thus more frequent characters are near the root and are coded with few bits, and rare characters are far from the root and are coded with many bits. Also known as static Huffman coding.","support":[{"end":681,"quote":"A minimal variable-length character coding based on the frequency of  each character.  First, each character becomes a one-node\nbinary tree\n, with the character as the only\nnode\n.  The character's frequency is the tree's frequency.  Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree.  One code bit represents each\nlevel\n.  Thus more frequent characters are near the\nroot\nand are coded with few bits, and rare characters are far from the root and are coded with many bits.\nAlso known as\nstatic Huffman coding.","source_id":"nist-dads.huffmancoding","source_sha256":"0a26d58ba6341bcaccde7795a8f98f77c15b4a7665caae84340feea0782ce379","start":54}],"target_id":"method.nist.huffmancoding","target_kind":"node","target_sha256":"973818339ff869e8990bfff448f842caa6ec224548963f3946b11401bc923395"}],"method.nist.idealmerge":[{"id":"assertion.method.nist.idealmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ideal merge as: Merge n sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output. That stream is inserted back into the list of streams according to its new head. Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using linear search to insert a stream into the list, the execution time is Θ(M N) where M is the total number of elements. Keeping the streams in a heap , the execution time is Θ(M log N) .","support":[{"end":681,"quote":"Merge\nn sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output.  That stream is inserted back into the list of streams according to its new head.  Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using\nlinear search\nto insert a stream into the list, the execution time is\nΘ(M N)\nwhere M is the total number of elements. Keeping the streams in a\nheap\n, the execution time is\nΘ(M log N)\n.","source_id":"nist-dads.idealmerge","source_sha256":"35aa61da68f8577b21cd653347968d58c1e85c219280c8587b9da0565e96c73c","start":48}],"target_id":"method.nist.idealmerge","target_kind":"node","target_sha256":"a5e791bf19539109946253ef621015fe6941cf0dfbddad5dc8394b5f225b5cb2"}],"method.nist.idealrandomshuffle":[{"id":"assertion.method.nist.idealrandomshuffle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ideal random shuffle as: A permutation algorithm, or shuffle, that has exactly the same chance of producing any permutation.","support":[{"end":165,"quote":"A\npermutation\nalgorithm, or shuffle, that has exactly the same chance of producing any permutation.","source_id":"nist-dads.idealrandomshuffle","source_sha256":"800278cf6ac2c39425a8b1370281599d5aa2cfda53a7ef23b154f0d63ca18949","start":66}],"target_id":"method.nist.idealrandomshuffle","target_kind":"node","target_sha256":"57c8de870d7bc13488734474941154c4e494cde58a9772d3f54ff82330f14286"}],"method.nist.inordertraversal":[{"id":"assertion.method.nist.inordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines in-order traversal as: Process all nodes of a tree by recursively processing the left subtree, then processing the root , and finally the right subtree. Also known as symmetric traversal.","support":[{"end":226,"quote":"Process all\nnodes\nof a\ntree\nby\nrecursively\nprocessing the left subtree, then processing the\nroot\n, and finally the right subtree.\nAlso known as\nsymmetric traversal.","source_id":"nist-dads.inordertraversal","source_sha256":"ca801223ea3923a02243197c9a0215bfccb83bc0955dab471e305396b949a371","start":62}],"target_id":"method.nist.inordertraversal","target_kind":"node","target_sha256":"ccd9718795cfe2e6bbeacd9aecbf1db861f7eb740f16402ef27a2a7107c02536"}],"method.nist.inplacesort":[{"id":"assertion.method.nist.inplacesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines in-place sort as: A sort algorithm in which the sorted items occupy the same storage as the original ones. These algorithms may use o(n) additional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time. Also known as sort in place.","support":[{"end":316,"quote":"A\nsort\nalgorithm in which the sorted items occupy the same storage as the original ones.  These algorithms may use\no(n)\nadditional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time.\nAlso known as\nsort in place.","source_id":"nist-dads.inplacesort","source_sha256":"88881d85f4b5bc4ed539fc30068f958a2591bfc73337590a5ffc4bee3d2af1de","start":52}],"target_id":"method.nist.inplacesort","target_kind":"node","target_sha256":"3d1790e99bfa772040c832000ec4cd502c958d1b85c576194ad5bf125ebaf6ce"}],"method.nist.insertionsort":[{"id":"assertion.method.nist.insertionsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines insertion sort as: Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted. Run time is O(n 2 ) because of moves. Also known as linear insertion sort.","support":[{"end":276,"quote":"Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted.  Run time is\nO(n\n2\n)\nbecause of moves.\nAlso known as\nlinear insertion sort.","source_id":"nist-dads.insertionsort","source_sha256":"e43a6a25f3af6427d5229b35bf517e2266fea7fd33861ca0d5e9c629bdd007bc","start":54}],"target_id":"method.nist.insertionsort","target_kind":"node","target_sha256":"b42934545120c8e0fcc3edd8478442725ca156534bb387c110e632ff29adb934"}],"method.nist.interpolationsearch":[{"id":"assertion.method.nist.interpolationsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines interpolation search as: Search a sorted array by estimating the next position to check based on a linear interpolation of the search key and the values at the ends of the search interval. Also known as extrapolation search.","support":[{"end":265,"quote":"Search a\nsorted array\nby estimating the next position to check based on a linear interpolation of the search\nkey\nand the values at the ends of the search interval.\nAlso known as\nextrapolation search.","source_id":"nist-dads.interpolationsearch","source_sha256":"8ca00d41b29165bdde46cacf01e22d74e575729715fa80d44c9387506c32205d","start":66}],"target_id":"method.nist.interpolationsearch","target_kind":"node","target_sha256":"524695f29850494fd1f27131340f68a5c055bee9f50466cf1806f6a2405eecc5"}],"method.nist.interpsequen":[{"id":"assertion.method.nist.interpsequen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interpolation-sequential search as: An approximate location is interpolated from the first and last items of a sorted array , then a linear search finds the actual location.","support":[{"end":225,"quote":"An approximate location is interpolated from the first and last items of a sorted\narray\n, then a\nlinear search\nfinds the actual location.","source_id":"nist-dads.interpsequen","source_sha256":"af1cb5a4ab63594cc84c0812ba96229315cc75f4989d5805ce0b59fde2330dd0","start":88}],"target_id":"method.nist.interpsequen","target_kind":"node","target_sha256":"9dbe1473c2290a738a46a875e011cfb8e3fc3d89dfe8107d67b6cbd7c94c01f0"}],"method.nist.introspectivesort":[{"id":"assertion.method.nist.introspectivesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines introspective sort as: A variant of quicksort which switches to heapsort for pathological inputs, that is, when execution time is becoming quadratic. Also known as introsort.","support":[{"end":213,"quote":"A variant of\nquicksort\nwhich switches to\nheapsort\nfor pathological inputs, that is, when execution time is becoming quadratic.\nAlso known as\nintrosort.","source_id":"nist-dads.introspectivesort","source_sha256":"c466910cd23e820ca14b149d47eabad0585cdf47f54f64fbcdcf85421bf3677a","start":62}],"target_id":"method.nist.introspectivesort","target_kind":"node","target_sha256":"703c78426e02f8921c3d5e6ad5c095b11dade8688e0b50da11b8f26fdc94a0dc"}],"method.nist.iteration":[{"id":"assertion.method.nist.iteration","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines iteration as: Solve a problem by repeatedly working on successive parts of the problem.","support":[{"end":129,"quote":"Solve a problem by repeatedly working on successive parts of the problem.","source_id":"nist-dads.iteration","source_sha256":"276cb63f503c5160710a06fa3d501470d0d8bc4dd688861aa4acc13b98ee9f91","start":56}],"target_id":"method.nist.iteration","target_kind":"node","target_sha256":"54767cbf1fe6dbaa1c156f114319258a486b9e2e3945b603adcb1de96d023579"}],"method.nist.j_sort":[{"id":"assertion.method.nist.j_sort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines J sort as: An in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more.","support":[{"end":151,"quote":"An\nin-place sort\nalgorithm that uses\nstrand sort\nto sort fewer than about 40 items and\nshuffle sort\nto sort more.","source_id":"nist-dads.j_sort","source_sha256":"802e2c48a977bbe9c9a0dcb7aadb562f1b8c09e08a26b3049ea1576ff43564a9","start":38}],"target_id":"method.nist.j_sort","target_kind":"node","target_sha256":"80ca76ad50e8bfd895b96e7479ad88a25b281129091081231a42dc9719699dbd"}],"method.nist.jarowinkler":[{"id":"assertion.method.nist.jarowinkler","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Jaro-Winkler as: A measure of similarity between two strings . The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters. Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","support":[{"end":414,"quote":"A measure of similarity between two\nstrings\n.  The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters.  Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","source_id":"nist-dads.jarowinkler","source_sha256":"3464a670e153342a1dd094ab5050029c73a0d8e62e959d0104c5d4108ca2acc7","start":50}],"target_id":"method.nist.jarowinkler","target_kind":"node","target_sha256":"7fee1a04c37f12fd24ce26fa4e0339240dfc641814275d9b1a6583e27babdc9d"}],"method.nist.johnsonsalgorithm":[{"id":"assertion.method.nist.johnsonsalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Johnson's algorithm as: An algorithm to solve the all pairs shortest path problem in a sparse weighted, directed graph . First, it adds a new node with zero weight edges from it to all other nodes, and runs the Bellman-Ford algorithm to check for negative weight cycles and find h(v), the least weight of a path from the new node to node v. Next it reweights the edges using the nodes' h(v) values. Finally for each node, it runs Dijkstra's algorithm and stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is O(V²log V + VE) .","support":[{"end":649,"quote":"An algorithm to solve the\nall pairs shortest path\nproblem in a\nsparse\nweighted, directed graph\n.  First, it adds a new\nnode\nwith zero weight edges from it to all other nodes, and runs the\nBellman-Ford algorithm\nto check for negative weight\ncycles\nand find h(v), the least weight of a path from the new node to node v.  Next it reweights the edges using the nodes' h(v) values.  Finally for each node, it runs\nDijkstra's algorithm\nand stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is\nO(V²log V + VE)\n.","source_id":"nist-dads.johnsonsalgorithm","source_sha256":"2d7e3330c170b2bb3277c14b1c2291ad27e528b9732565031826526206ed96f8","start":64}],"target_id":"method.nist.johnsonsalgorithm","target_kind":"node","target_sha256":"00003d1551e7fa7d38a92fe25cb5156f16d3e64ab1880e1d38e6b7f029614a77"}],"method.nist.johnsontrotter":[{"id":"assertion.method.nist.johnsontrotter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Johnson-Trotter as: Generate permutations by swapping one adjacent pair of elements at a time. Also known as Steinhaus-Johnson-Trotter, Trotter-Johnson.","support":[{"end":188,"quote":"Generate\npermutations\nby swapping one adjacent pair of elements at a time.\nAlso known as\nSteinhaus-Johnson-Trotter, Trotter-Johnson.","source_id":"nist-dads.johnsontrotter","source_sha256":"8923680f71cd5e1191185bf57c2d0ecacca9dc8b60a5ba29b81c46046b9c44ec","start":56}],"target_id":"method.nist.johnsontrotter","target_kind":"node","target_sha256":"d82bb40525ca9edbb36bf00e6e2a5edc095d55f764f17317ee8429790e366fbc"}],"method.nist.jsort":[{"id":"assertion.method.nist.jsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines JSort as: An in-place sort that partially orders the array twice with build-heap , once moving lesser items earlier and once in reverse moving greater items later, then uses insertion sort on the nearly-ordered array.","support":[{"end":243,"quote":"An\nin-place sort\nthat partially orders the\narray\ntwice with\nbuild-heap\n, once moving lesser items earlier and once in reverse moving greater items later, then uses\ninsertion sort\non the nearly-ordered array.","source_id":"nist-dads.jsort","source_sha256":"9bd4f9c1b8c15818d2cfc301672bdf72385ef40dd0b856a226a51fcb33fea49a","start":36}],"target_id":"method.nist.jsort","target_kind":"node","target_sha256":"deaee8fc3267174b3a12dd4f07c05c67676f07f37cc72195bb82662510aceb94"}],"method.nist.jumpsearch":[{"id":"assertion.method.nist.jumpsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines jump search as: Search a sorted array by checking every j th item until the right area is found, then doing a linear search . The optimum for n items is when j=√ n. Also known as block search.","support":[{"end":225,"quote":"Search a\nsorted array\nby checking every j\nth\nitem until the right area is found, then doing a\nlinear search\n.  The optimum for n items is when j=√ n.\nAlso known as\nblock search.","source_id":"nist-dads.jumpsearch","source_sha256":"b2fa8d99641d96c32a7d43fbf47c0c1d6520d8007646e74329dee8af35766138","start":48}],"target_id":"method.nist.jumpsearch","target_kind":"node","target_sha256":"2bc1d1c88af0f8cfe5a9d25afb13463d695f2da69d90f8428a8da57182c77c98"}],"method.nist.karnaughmap":[{"id":"assertion.method.nist.karnaughmap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karnaugh map as: A method for minimizing a boolean expression , usually aided by a rectangular map of the value of the expression for all possible input values. Input values are arranged in a Gray code . Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation. Also known as Veitch diagram, KV diagram.","support":[{"end":389,"quote":"A method for minimizing a\nboolean expression\n, usually aided by a rectangular map of the value of the expression for all possible input values.  Input values are arranged in a\nGray code\n.  Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation.\nAlso known as\nVeitch diagram, KV diagram.","source_id":"nist-dads.karnaughmap","source_sha256":"7ae4011653527f0e33e5fa3449f40e61813882c01f6b9da7794a906de5a8a22f","start":50}],"target_id":"method.nist.karnaughmap","target_kind":"node","target_sha256":"906efd9132df5f65425bf9892d68813c8e287c290bc55884d21de94c2787020d"}],"method.nist.karprabin":[{"id":"assertion.method.nist.karprabin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karp-Rabin as: A string matching algorithm that compares string's hash values, rather than the strings themselves. For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position. Also known as Rabin-Karp.","support":[{"end":300,"quote":"A\nstring matching\nalgorithm that compares string's\nhash\nvalues, rather than the strings themselves.  For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position.\nAlso known as\nRabin-Karp.","source_id":"nist-dads.karprabin","source_sha256":"1c57507036c9312e0191e5e963400edc3d295c3a94ffc71580b2db4fd3a9f3cd","start":46}],"target_id":"method.nist.karprabin","target_kind":"node","target_sha256":"6396a2d0775af17429a50c6576713c8377a9a97cf59af3a929f580b5e8f6550d"}],"method.nist.karyhuffman":[{"id":"assertion.method.nist.karyhuffman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary Huffman coding as: A minimal variable-length coding based on the frequency of each character. Similar to a Huffman coding , but joins k trees into a k-ary tree at each step, and uses k symbols for each level.","support":[{"end":256,"quote":"A minimal variable-length coding based on the frequency of each character.  Similar to a\nHuffman coding\n, but joins k trees into a\nk-ary tree\nat each step, and uses k symbols for each level.","source_id":"nist-dads.karyhuffman","source_sha256":"bfb9d3a86c0034c0f3d9887f6b3258689cc235a26869fbcded81756fea4b64d6","start":66}],"target_id":"method.nist.karyhuffman","target_kind":"node","target_sha256":"3e3f3fd13bd4a0b9abb1b280ab6a364cb5adfe094917f7f35d1aecaedf5617d5"}],"method.nist.knuthmorrispratt":[{"id":"assertion.method.nist.knuthmorrispratt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Knuth-Morris-Pratt algorithm as: A string matching algorithm that turns the search string into a finite state machine , then runs the machine with the string to be searched as the input string. Execution time is O(m+n) , where m is the length of the search string, and n is the length of the string to be searched. Also known as KMP.","support":[{"end":383,"quote":"A\nstring matching\nalgorithm that turns the search string into a\nfinite state machine\n, then runs the machine with the string to be searched as the input string.  Execution time is\nO(m+n)\n, where m is the length of the search string, and n is the length of the string to be searched.\nAlso known as\nKMP.","source_id":"nist-dads.knuthmorrispratt","source_sha256":"f8c309241f4ef5f851ca36270ad6674345c036e26f506e07b3ad5a7fc6ae2a7c","start":82}],"target_id":"method.nist.knuthmorrispratt","target_kind":"node","target_sha256":"42bc596267820d160cd42f0adcb261c29c2c5348a76ea7e9c2b007cd2bb4d01e"}],"method.nist.kruskalsalgo":[{"id":"assertion.method.nist.kruskalsalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Kruskal's algorithm as: An algorithm for computing a minimum spanning tree . It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest edge in the graph whose vertices are in different partial minimum spanning trees.","support":[{"end":286,"quote":"An algorithm for computing a\nminimum spanning tree\n.  It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest\nedge\nin the\ngraph\nwhose\nvertices\nare in different partial minimum spanning trees.","source_id":"nist-dads.kruskalsalgo","source_sha256":"4b187bcf5043f2c5bd05cf7ddf0b57fc56d61ba0ea95b807194147a16b1e7637","start":64}],"target_id":"method.nist.kruskalsalgo","target_kind":"node","target_sha256":"21749f8b2f15bbdd26db79d7ee64ca2b2503aa3f63b7cda2d04786f684c64474"}],"method.nist.kwaymergesort":[{"id":"assertion.method.nist.kwaymergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It merges runs from the k streams into an output stream. It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output. Also known as p-way merge sort.","support":[{"end":506,"quote":"A\nmerge sort\nthat sorts a data stream using repeated merges.  It distributes the input into k streams by repeatedly reading a\nblock\nof input that fits in memory, called a\nrun\n, sorting it, then writing it to the next stream.  It merges runs from the k streams into an output stream.  It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output.\nAlso known as\np-way merge sort.","source_id":"nist-dads.kwaymergesort","source_sha256":"6d702d9f09dc65a4b05917b1ac0ed76704151762b94a9d586c6e482f94a3fc0c","start":58}],"target_id":"method.nist.kwaymergesort","target_kind":"node","target_sha256":"ec0fd1a38003a18d553c0e98aeed69950b5bd91ae7e4f604b714fe8c378b6261"}],"method.nist.lasvegas":[{"id":"assertion.method.nist.lasvegas","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Las Vegas algorithm as: A randomized algorithm that always produces correct results, with the only variation from one run to another being its running time.","support":[{"end":208,"quote":"A\nrandomized algorithm\nthat always produces correct results, with the only variation from one run to another being its running time.","source_id":"nist-dads.lasvegas","source_sha256":"8318e3f4770c327e628dbec79348330e10ea28d2b5581d0a5c0aa11fea937a9d","start":76}],"target_id":"method.nist.lasvegas","target_kind":"node","target_sha256":"0c7b6644cd8bb85828ac5501a0cf602c4446c9aa050ca857fe09d024afa2a5f4"}],"method.nist.lcfshashing":[{"id":"assertion.method.nist.lcfshashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines LCFS hashing as: In case of collision , move the existing item to another position, dictated by the open addressing scheme used.","support":[{"end":161,"quote":"In case of\ncollision\n, move the existing item to another position, dictated by the\nopen addressing\nscheme used.","source_id":"nist-dads.lcfshashing","source_sha256":"519906461568b64597d7a6a08ac3cbc87a1f4ea24982b003b524a85bc3f2f953","start":50}],"target_id":"method.nist.lcfshashing","target_kind":"node","target_sha256":"882983cd48fbe00806d24db49b6a04134d6c7dac9dd88a91d735487da1d299a6"}],"method.nist.leftrotation":[{"id":"assertion.method.nist.leftrotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines left rotation as: (1) In a binary search tree , pushing a node N down and to the left to balance the tree. N's right child replaces N, and the right child's left child becomes N's right child. (2) In an array , moving all items to the next lower location. The first item is moved to the last location, which is now vacant. (3) In a list , removing the head and inserting it at the tail . Also known as rotate left.","support":[{"end":450,"quote":"(1) In a\nbinary search tree\n, pushing a\nnode\nN down and to the left to\nbalance\nthe tree.  N's right\nchild\nreplaces N, and the right child's left child becomes N's right child. (2) In an\narray\n, moving all items to the next lower location.  The first item is moved to the last location, which is now vacant. (3) In a\nlist\n, removing the\nhead\nand inserting it at the\ntail\n.\nAlso known as\nrotate left.","source_id":"nist-dads.leftrotation","source_sha256":"346687c6891d606cfec208ae7dd2541bd3b8b680d75058ba7aa8368c2181fb4d","start":52}],"target_id":"method.nist.leftrotation","target_kind":"node","target_sha256":"133daffdd3ba3a82e77dbc5b81b109fa7bfd43f323af06d8db2213aaf7175101"}],"method.nist.lempelzivwelch":[{"id":"assertion.method.nist.lempelzivwelch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Lempel-Ziv-Welch as: A compression algorithm that codes strings of characters with codes of a fixed number of bits. Every new string in the input is added to a table until it is full. The codes of existing strings are output instead of the strings. Also known as LZW compression.","support":[{"end":318,"quote":"A compression algorithm that codes strings of characters with codes of a fixed number of bits.  Every new string in the input is added to a table until it is full.  The codes of existing strings are output instead of the strings.\nAlso known as\nLZW compression.","source_id":"nist-dads.lempelzivwelch","source_sha256":"4049baa4da5dc280fec120bc03ff57ef12c51233e5e0fbff7e69d7421a9acdaa","start":58}],"target_id":"method.nist.lempelzivwelch","target_kind":"node","target_sha256":"96a56ada71780f20b97990458c9357af424881bb6a71043b3f0667f2b26e4820"}],"method.nist.levelordertraversal":[{"id":"assertion.method.nist.levelordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines level-order traversal as: Process all nodes of a tree by depth : first the root , then the children of the root, etc. Equivalent to a breadth-first search from the root.","support":[{"end":212,"quote":"Process all\nnodes\nof a\ntree\nby\ndepth\n: first the\nroot\n, then the\nchildren\nof the root, etc.  Equivalent to a\nbreadth-first search\nfrom the root.","source_id":"nist-dads.levelordertraversal","source_sha256":"93c0ccb4bbd8ee5d7d29e0d0b38b1418892f4bf4df1a8c877c0f786fb29bafda","start":68}],"target_id":"method.nist.levelordertraversal","target_kind":"node","target_sha256":"0dec9eaf3da7d50ddc2f165e21cb1ae33c918d753cf4fa3dafd02ee04b7efdac"}],"method.nist.linearhash":[{"id":"assertion.method.nist.linearhash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linear hash as: A numeric function that maintains the order of input keys while changing their spacing. Formal Definition: A hash function f for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2). Also known as order-preserving hash.","support":[{"end":271,"quote":"A numeric function that maintains the order of input\nkeys\nwhile changing their spacing.\nFormal Definition:\nA\nhash function\nf for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2).\nAlso known as\norder-preserving hash.","source_id":"nist-dads.linearhash","source_sha256":"02ff354bd099fd7995ce8bb04a201642710838683a304f0f7e0e0ddd78884a6b","start":48}],"target_id":"method.nist.linearhash","target_kind":"node","target_sha256":"8d7c91e4ebef0e57245c13f8cdc20594e070aeb9ce670d2da6eb8f31f55fb723"}],"method.nist.linearsearch":[{"id":"assertion.method.nist.linearsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linear search as: Search an array or list by checking items one at a time. Also known as sequential search.","support":[{"end":141,"quote":"Search an\narray\nor\nlist\nby checking items one at a time.\nAlso known as\nsequential search.","source_id":"nist-dads.linearsearch","source_sha256":"98b34c763528f3e21071e2ed34d68da4b48513c3b3bab79f2187a8bb6fc81a40","start":52}],"target_id":"method.nist.linearsearch","target_kind":"node","target_sha256":"537d6848766a0943d3d408748e1b6df500996c0abf09d3cf801c94191cea6c8d"}],"method.nist.localitysensitivehashing":[{"id":"assertion.method.nist.localitysensitivehashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines locality-sensitive hashing as: A probabilistic algorithm to quickly find points in a high dimensional space near a query point. Preprocessing: put every point in multiple hash tables . Each table has its own locality-sensitive hash function and uses buckets (or chaining ) since many collisions are expected. The hash functions come from a family of functions. Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","support":[{"end":540,"quote":"A\nprobabilistic algorithm\nto quickly find points in a high dimensional space near a query point.  Preprocessing: put every point in multiple\nhash tables\n.  Each table has its own locality-sensitive\nhash function\nand uses\nbuckets\n(or\nchaining\n) since many collisions are expected. The\nhash functions\ncome from a family of functions.   Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","source_id":"nist-dads.localitysensitivehashing","source_sha256":"881fd73e44b2610799deb7c3a37eabddeb151d3dd4db11a7871eb775760023b8","start":78}],"target_id":"method.nist.localitysensitivehashing","target_kind":"node","target_sha256":"a1bb4ec83d62b2745a4dc78c706c5239d492eea3f2cc6d5c862d577309c2aa02"}],"method.nist.luckysort":[{"id":"assertion.method.nist.luckysort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lucky sort as: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing!","support":[{"end":152,"quote":"The best possible\nsort\nalgorithm: it is so lucky that the input is already sorted, and it need do nothing!","source_id":"nist-dads.luckysort","source_sha256":"3e7370a03272c10f24d61ca117963d50bc96343f94bb297f0605f41602e72d92","start":46}],"target_id":"method.nist.luckysort","target_kind":"node","target_sha256":"0e6126e8d86e408fe5e18a14d5b8ed62a80f5e4beac3c15e68b9b31e76c9a9b6"}],"method.nist.malhotrakumr":[{"id":"assertion.method.nist.malhotrakumr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Malhotra-Kumar-Maheshwari blocking flow as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a vertex with the least throughput and greedily push the maximum flow from it to the sink . This is repeated until all vertices are deleted.","support":[{"end":338,"quote":"Given a\nflow function\nand its corresponding residual graph (a\nmaximum-flow problem\n), select a\nvertex\nwith the least throughput and\ngreedily\npush the maximum flow from it to the\nsink\n.  This is repeated until all vertices are deleted.","source_id":"nist-dads.malhotrakumr","source_sha256":"d62af5438f39566b410c72b24d78e6e0b376744723ad866c03f36aacb3b26286","start":104}],"target_id":"method.nist.malhotrakumr","target_kind":"node","target_sha256":"217c992165b7983dead76cd2988c9eca449b22c8bbb00d9d2ae45595d571c0ae"}],"method.nist.memoize":[{"id":"assertion.method.nist.memoize","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines memoization as: Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","support":[{"end":154,"quote":"Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","source_id":"nist-dads.memoize","source_sha256":"51257d9af5d6bb37c6264c693c98a439bcf13b71590d057be45ab847e4cd80b4","start":60}],"target_id":"method.nist.memoize","target_kind":"node","target_sha256":"f73631cb75a2d24eba694613a949a022c4a7fc3d276cbe5bda5d41383b5c5ca8"}],"method.nist.mergesort":[{"id":"assertion.method.nist.mergesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines merge sort as: A sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence. Run time is Θ (n log n).","support":[{"end":218,"quote":"A\nsort\nalgorithm that splits the items to be sorted into two groups,\nrecursively\nsorts each group, and\nmerges\nthem into a final, sorted sequence.   Run time is\nΘ\n(n log n).","source_id":"nist-dads.mergesort","source_sha256":"8cff46f3edb0aec6a3a99f565d232f595a68ef3ab72018f406e27efb264afb6d","start":46}],"target_id":"method.nist.mergesort","target_kind":"node","target_sha256":"071557e230c3115cb1efeb80589486acc83a5e7b7c5c7554c27290b5d58f2698"}],"method.nist.metaheuristic":[{"id":"assertion.method.nist.metaheuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines metaheuristic as: (1) A high-level algorithmic framework or approach that can be specialized to solve optimization problems . (2) A high-level strategy that guides other heuristics in a search for feasible solutions .","support":[{"end":264,"quote":"(1) A high-level algorithmic framework or approach that can be specialized to solve\noptimization problems\n.  (2) A high-level strategy that guides other\nheuristics\nin a search for\nfeasible solutions\n.","source_id":"nist-dads.metaheuristic","source_sha256":"ce45a1c03c867e90466272aeeda4683e56eb052ca8f2318aee527c76ccc4f34d","start":64}],"target_id":"method.nist.metaheuristic","target_kind":"node","target_sha256":"c83aa0c22f3cef4e15994b7d62cc120aae68c8cdf889a95023a1509d218194dd"}],"method.nist.metaphone":[{"id":"assertion.method.nist.metaphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines metaphone as: An algorithm to code English words phonetically by reducing them to 16 consonant sounds. A better variant is double metaphone .","support":[{"end":172,"quote":"An algorithm to code English words phonetically by reducing them to 16 consonant sounds.  A better variant is\ndouble metaphone\n.","source_id":"nist-dads.metaphone","source_sha256":"1e22de5b877c16eda43d1bd5f80f38bd6218e92cb271b826c7f83267bd994b85","start":44}],"target_id":"method.nist.metaphone","target_kind":"node","target_sha256":"c5ad1fdf60531a8f40c8ba30f45b36bb0d0e4bc2d29c4889919d6e3da0ff0053"}],"method.nist.minimalperfecthash":[{"id":"assertion.method.nist.minimalperfecthash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimal perfect hashing as: A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formal Definition: A function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the range of f(k) is 1… |K|.","support":[{"end":358,"quote":"A\nperfect hashing\nfunction that maps each different\nkey\nto a distinct integer and has the same number of possible integers as keys.\nFormal Definition:\nA function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the\nrange\nof f(k) is 1… |K|.","source_id":"nist-dads.minimalperfecthash","source_sha256":"fd175a557a320b9f708d54e78f76632a5adede728399e29d2f861a05f88ceb1d","start":72}],"target_id":"method.nist.minimalperfecthash","target_kind":"node","target_sha256":"0b8d58851f8e7d78ed49cc24bc7d78ff230d31d800a30dda9bcf0f31825ee3cc"}],"method.nist.minimax":[{"id":"assertion.method.nist.minimax","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimax as: Generate all nodes in a game tree. Score each leaf node with its utility value. Score each minimizing node with the smallest of its children's scores, and maximizing node with the largest of its children's scores.","support":[{"end":255,"quote":"Generate all nodes in a game tree.  Score each\nleaf\nnode with its utility value.  Score each minimizing node with the smallest of its\nchildren's\nscores, and maximizing node with the largest of its children's scores.","source_id":"nist-dads.minimax","source_sha256":"29977022bea244e7a724baa202bb9415b0fc31c2875b422c560d61bad8623d17","start":40}],"target_id":"method.nist.minimax","target_kind":"node","target_sha256":"a0a58f29b408a147ebed871519cfb024ede7557fbc4c42c72da274373848e597"}],"method.nist.modelcheckng":[{"id":"assertion.method.nist.modelcheckng","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines model checking as: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.","support":[{"end":153,"quote":"Efficiently deciding whether a\ntemporal logic\nformula is satisfied in a\nfinite state machine\nmodel.","source_id":"nist-dads.modelcheckng","source_sha256":"69d894eeeb6399ec8d2fe1f701324d1fe1924ce25d66b6234cb7fe2773be5137","start":54}],"target_id":"method.nist.modelcheckng","target_kind":"node","target_sha256":"179d00569b3bec70176547bb6042abdd92122b30d9804bc5dc6ffaf954baa509"}],"method.nist.modifind":[{"id":"assertion.method.nist.modifind","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines MODIFIND as: Select the k th smallest element of an array and partition the array around it. Partition around the value of the k th element. If the partition boundary is not at k, repeat in the partition that includes k.","support":[{"end":251,"quote":"Select the k\nth\nsmallest element of an array and\npartition\nthe array around it.  Partition around the value of the k\nth\nelement.  If the partition boundary is not at k, repeat in the partition that includes k.","source_id":"nist-dads.modifind","source_sha256":"fae0832bcea4c48ac8b5afb484724ea4f64d8e36556ad18b95ad7ef1e8c2d4cd","start":42}],"target_id":"method.nist.modifind","target_kind":"node","target_sha256":"5de23c005006aa4946c49b4c4644409dacad2a81a56de208336da56f50cddb3d"}],"method.nist.montecarlo":[{"id":"assertion.method.nist.montecarlo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Monte Carlo algorithm as: A randomized algorithm that may produce incorrect results, but with bounded error probability.","support":[{"end":174,"quote":"A\nrandomized algorithm\nthat may produce incorrect results, but with bounded error probability.","source_id":"nist-dads.montecarlo","source_sha256":"82166e8633740bccda0cf05d7bee2261c8816534d4f36bf35993572846d3dcff","start":80}],"target_id":"method.nist.montecarlo","target_kind":"node","target_sha256":"9d0b72d1c184ff13163515a9c885ce8c4a74b734a65c76360ebd52df86277929"}],"method.nist.movefront":[{"id":"assertion.method.nist.movefront","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines move-to-front heuristic as: A heuristic that moves the target of a search to the head of a list so it is found faster next time.","support":[{"end":172,"quote":"A\nheuristic\nthat moves the target of a\nsearch\nto the\nhead\nof a\nlist\nso it is found faster next time.","source_id":"nist-dads.movefront","source_sha256":"457cf76a8c0855fcf2a9ec04a448709681a8b9c9b0af367641debb7eaa301ee0","start":72}],"target_id":"method.nist.movefront","target_kind":"node","target_sha256":"05ac1537d465aecce72b409e3aa1c512e0b4094bb904df3d426772c07f491b4c"}],"method.nist.movetoroot":[{"id":"assertion.method.nist.movetoroot","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines move-to-root heuristic as: A heuristic that moves the target of a search to the root of the search tree so it is found faster next time.","support":[{"end":179,"quote":"A\nheuristic\nthat moves the target of a\nsearch\nto the\nroot\nof the\nsearch tree\nso it is found faster next time.","source_id":"nist-dads.movetoroot","source_sha256":"3c63a8b0423f4c8c65811462f9d96135665bd0269040000bbd63d2d561094959","start":70}],"target_id":"method.nist.movetoroot","target_kind":"node","target_sha256":"33b5c5a2411a974c07e55505ab1b231cdda720f42a3c6d14647416d26c54d8a0"}],"method.nist.multikeyquicksort":[{"id":"assertion.method.nist.multikeyquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multikey Quicksort as: Pick an element from the array (the pivot). Consider the first character (key) of the string (multikey). Partition the remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character. Recursively sort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key). Also known as three-way radix quicksort.","support":[{"end":515,"quote":"Pick an element from the array (the pivot).  Consider the first character (key) of the\nstring\n(multikey).\nPartition\nthe remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character.\nRecursively\nsort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key).\nAlso known as\nthree-way radix quicksort.","source_id":"nist-dads.multikeyquicksort","source_sha256":"35fa9e30e6ba1c840bd1c70799f6b4a139652a5d45b526a592d2e196cac14482","start":62}],"target_id":"method.nist.multikeyquicksort","target_kind":"node","target_sha256":"d373bac85216bff601677ebc4535e2a1efc7d1585664a45f31f6bce81bb5a71b"}],"method.nist.multiprefix":[{"id":"assertion.method.nist.multiprefix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiprefix as: A generalization of scan in which the partial sums are grouped by keys .","support":[{"end":120,"quote":"A generalization of\nscan\nin which the partial sums are grouped by\nkeys\n.","source_id":"nist-dads.multiprefix","source_sha256":"ad580805b1c440e0807ce8fb7817bdf706255fafee463b34ce1ecd3f45c226c1","start":48}],"target_id":"method.nist.multiprefix","target_kind":"node","target_sha256":"0c865ff16d610f64362047086d6a175f24b6af89c8b380bbabc3b52a734c013c"}],"method.nist.munkresassignment":[{"id":"assertion.method.nist.munkresassignment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Munkres' assignment algorithm as: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns. Also known as Hungarian algorithm.","support":[{"end":245,"quote":"Solve the\nassignment problem\nin\npolynomial time\nby marking and unmarking entries and covering and uncovering rows and columns.\nAlso known as\nHungarian algorithm.","source_id":"nist-dads.munkresassignment","source_sha256":"30736ed89087377cd4df9fb9dc1062912e2ea357950243e1d2ad7e47b9df3e54","start":84}],"target_id":"method.nist.munkresassignment","target_kind":"node","target_sha256":"182c0c1e24c30479d7608ddbb2d40fd29987631d313f12b70911f9156122e2e6"}],"method.nist.nonbalncmsrt":[{"id":"assertion.method.nist.nonbalncmsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nonbalanced merge sort as: A k-way merge sort in which the number of input and output data streams is different for any particular pass. Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","support":[{"end":334,"quote":"A\nk-way merge sort\nin which the number of input and  output data streams is different for any particular  pass.  Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","source_id":"nist-dads.nonbalncmsrt","source_sha256":"bea350a5fd3d2b12f54175ebc5a1b1a71aac6110be44d5e9108781dce823f0c7","start":70}],"target_id":"method.nist.nonbalncmsrt","target_kind":"node","target_sha256":"32a822e9ce7e6d0b8ce50f145997b3baca4837aa4b874d8debd36567f7730529"}],"method.nist.nondetermalgo":[{"id":"assertion.method.nist.nondetermalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic algorithm as: A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It is not random, as in randomized algorithm , or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","support":[{"end":361,"quote":"A conceptual\nalgorithm\nwith more than one allowed step at certain times and which always takes the right or best step.   It is not random, as in\nrandomized algorithm\n, or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","source_id":"nist-dads.nondetermalgo","source_sha256":"4a3f6e614c396881689a3c402c9006b867619345bb4d10875180e6b46a15d868","start":90}],"target_id":"method.nist.nondetermalgo","target_kind":"node","target_sha256":"df762c0c30646ea60ab3d55064d93bb433ca2cc6a0f7b8924e95d19db45037e6"}],"method.nist.nysiis":[{"id":"assertion.method.nist.nysiis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NYSIIS as: Convert a name to a phonetic coding of up to six characters.","support":[{"end":98,"quote":"Convert a name to a phonetic coding of up to six characters.","source_id":"nist-dads.nysiis","source_sha256":"d6a94fcfad46a225536d81abf2b6ec81c71ab314a49ae3ec3fc1b0f965e5bf82","start":38}],"target_id":"method.nist.nysiis","target_kind":"node","target_sha256":"184aaa7056bface6b35a8325af4b50806343423d7cf4acdb1350e9746c9b0afe"}],"method.nist.openaddressing":[{"id":"assertion.method.nist.openaddressing","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines open addressing as: A class of collision resolution schemes in which all items are stored within the hash table . In case of collision , other positions are computed, giving a probe sequence , and checked until an empty position is found. Some ways of computing possible new positions are less efficient because of clustering . Typically items never move once put in place, but in Robin Hood hashing , LCFS hashing , and other techniques, previously placed items may move.","support":[{"end":511,"quote":"A class of\ncollision resolution schemes\nin which all items are stored within the\nhash table\n.  In case of\ncollision\n, other positions are computed, giving a\nprobe sequence\n, and checked until an empty position is found.  Some ways of computing possible new positions are less efficient because of\nclustering\n. Typically items never move once put in place, but in\nRobin Hood hashing\n,\nLCFS hashing\n, and other techniques,  previously placed items may move.","source_id":"nist-dads.openaddressing","source_sha256":"86639cadf497d4cd7f686e62ca9fcb374f57a14c869676513f0356c81a283b68","start":56}],"target_id":"method.nist.openaddressing","target_kind":"node","target_sha256":"76494ba702a0f1662d3081daef0cb1964d6cc3e3eeafbcd8b6d51aac7229d14f"}],"method.nist.optimalmismatch":[{"id":"assertion.method.nist.optimalmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal mismatch as: A string matching algorithm that compares the rarest character first. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","support":[{"end":265,"quote":"A\nstring matching\nalgorithm that compares the rarest character first.  When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","source_id":"nist-dads.optimalmismatch","source_sha256":"da1003ac32a4c93f6c9a5d093c62bb6dc88d332fcf7b04648ffce60a9a0e2bed","start":58}],"target_id":"method.nist.optimalmismatch","target_kind":"node","target_sha256":"b6a2279b63f4b9c71fdd4b4f467a6b4894a779882713d39ddf1e9b6384017cf7"}],"method.nist.optimalpolyphasemergesort":[{"id":"assertion.method.nist.optimalpolyphasemergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal polyphase merge sort as: An external sort algorithm that uses optimal polyphase merges .","support":[{"end":145,"quote":"An\nexternal sort\nalgorithm that uses\noptimal polyphase merges\n.","source_id":"nist-dads.optimalpolyphasemergesort","source_sha256":"78f678110a3a6262b951df65e33d1ae9cc7aef6eefa59396331ef359752adca3","start":82}],"target_id":"method.nist.optimalpolyphasemergesort","target_kind":"node","target_sha256":"6fff355a224a04aebafca660881123831fabc2348f396fa57a9d194dbc338712"}],"method.nist.optimpolymrg":[{"id":"assertion.method.nist.optimpolymrg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal polyphase merge as: A polyphase merge which seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files. Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file. A series of kth order Fibonacci numbers is one way to select the number of runs.","support":[{"end":461,"quote":"A\npolyphase merge\nwhich seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files.  Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file.  A series of\nkth order Fibonacci numbers\nis one way to select the number of runs.","source_id":"nist-dads.optimpolymrg","source_sha256":"338b8152021c21608548da123feb9ed9acb3b9d0cc61bb9ea41aa8352ec5b33c","start":72}],"target_id":"method.nist.optimpolymrg","target_kind":"node","target_sha256":"491664067aafc608449ed6ee87fd3444587ceac4068a29fbee339c0f72faa993"}],"method.nist.orderpreservinghuffmancoding":[{"id":"assertion.method.nist.orderpreservinghuffmancoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order-preserving Huffman coding as: A variable-length character coding based on the frequency of each character. The algorithm is similar to Huffman coding , but the trees are kept in the same order as the characters. Two adjacent trees with the least combined frequency are joined as subtrees of a new root. As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies. Repeat until all characters are in one tree.","support":[{"end":497,"quote":"A variable-length character coding based on the frequency of each character.  The algorithm is similar to\nHuffman coding\n, but the trees are kept in the same order as the characters.  Two\nadjacent\ntrees with the least combined frequency are joined as subtrees of a new root.  As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies.  Repeat until all characters are in one tree.","source_id":"nist-dads.orderpreservinghuffmancoding","source_sha256":"1541c6d209e942d65bc57668fa0abd704e7de418a81e65a1203bd3f82e4eb2d7","start":88}],"target_id":"method.nist.orderpreservinghuffmancoding","target_kind":"node","target_sha256":"757fb1c7974f4509c3675bfc5f79763449b8cb0156595a4bc2d58fbfefd05702"}],"method.nist.orderpreservminperfecthash":[{"id":"assertion.method.nist.orderpreservminperfecthash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order-preserving minimal perfect hashing as: A minimal perfect hashing function for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","support":[{"end":211,"quote":"A\nminimal perfect hashing\nfunction for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","source_id":"nist-dads.orderpreservminperfecthash","source_sha256":"568f565a957cbbe009b53414e116e6a3aa568018b2cbd53415ba549dd52f7c10","start":106}],"target_id":"method.nist.orderpreservminperfecthash","target_kind":"node","target_sha256":"ea7cc36fb3dfb4892e70944e9c346fdc455eda617ccb601ff860a00a88e2279e"}],"method.nist.oscillatingmergesort":[{"id":"assertion.method.nist.oscillatingmergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oscillating merge sort as: Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward. Repeat until n-2 (backward) merged runs have been created, at which time they are merged. Continue building up powers of n-2 batches until done.","support":[{"end":379,"quote":"Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward.  Repeat until n-2 (backward) merged runs have been created, at which time they are  merged.  Continue building up powers of n-2 batches until done.","source_id":"nist-dads.oscillatingmergesort","source_sha256":"a2b35ade8d38be138c9e349c654f469ea6d9397fa959e7377e4f95b9d9cab1f6","start":70}],"target_id":"method.nist.oscillatingmergesort","target_kind":"node","target_sha256":"87cc05fe56960c0e078bfcfc35c5d4b0c0075eb6ef4b808f50b26e3e9d774660"}],"method.nist.pearsonshash":[{"id":"assertion.method.nist.pearsonshash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Pearson's hash as: A hash function that uses an auxiliary array, but no shift or exclusive-or ( xor ) operations.","support":[{"end":148,"quote":"A\nhash function\nthat uses an auxiliary array, but no shift or exclusive-or (\nxor\n) operations.","source_id":"nist-dads.pearsonshash","source_sha256":"ff4fc46f19620af88fb1f6ddc9f8b7253fe878474e8b1904678b0d09d77f1d20","start":54}],"target_id":"method.nist.pearsonshash","target_kind":"node","target_sha256":"2a86d9cc74e0cacf1fea7a40c2e4dec5a3b6c43d0684a52cf7a4e3fc621e1931"}],"method.nist.perfecthash":[{"id":"assertion.method.nist.perfecthash","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines perfect hashing as: A hash function that maps each different key to a distinct integer. Usually all possible keys must be known beforehand. A hash table that uses a perfect hash has no collisions . Formal Definition: A function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k. Also known as optimal hashing.","support":[{"end":365,"quote":"A\nhash function\nthat maps each different\nkey\nto a distinct integer.  Usually all possible keys must be known beforehand.  A\nhash table\nthat uses a perfect hash has no\ncollisions\n.\nFormal Definition:\nA function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k.\nAlso known as\noptimal hashing.","source_id":"nist-dads.perfecthash","source_sha256":"a5d69550cd9f0f0573fe0abfd5ff44b003a1d95df2e741578695b2d904824723","start":56}],"target_id":"method.nist.perfecthash","target_kind":"node","target_sha256":"36d3a19ac462c1d97406c218dcafe52082c0f8fdd0229c84b04145b56161dedb"}],"method.nist.perfectshuffle":[{"id":"assertion.method.nist.perfectshuffle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect shuffle as: Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","support":[{"end":157,"quote":"Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","source_id":"nist-dads.perfectshuffle","source_sha256":"32c4d2b435df36f2f9911d3c747ed13e216fadec722ec02270598cf63314fe5e","start":56}],"target_id":"method.nist.perfectshuffle","target_kind":"node","target_sha256":"ca6ac2c54761faeffb856ab9e380bfb13620818ee051124957ff26401c347e6c"}],"method.nist.permutation":[{"id":"assertion.method.nist.permutation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines permutation as: A rearrangement of elements, where none are lost, added, or changed. The Fisher-Yates shuffle randomly permutes elements. Also known as shuffle.","support":[{"end":193,"quote":"A rearrangement of elements, where none are lost, added, or changed.  The\nFisher-Yates shuffle\nrandomly permutes elements.\nAlso known as\nshuffle.","source_id":"nist-dads.permutation","source_sha256":"ce156ee8ab3d7451a40895ef84b9d1704ef9e67f6c1bc39440951f258ee89a33","start":48}],"target_id":"method.nist.permutation","target_kind":"node","target_sha256":"7e9d67380cefaef813dbbf5f5f93bfd6692265c509ea1daeaff5738383cb8b0c"}],"method.nist.permutationsort":[{"id":"assertion.method.nist.permutationsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines permutation sort as: A terribly inefficient sort algorithm that generates each permutation of the items until the items are in order.","support":[{"end":170,"quote":"A terribly inefficient\nsort\nalgorithm that generates each\npermutation\nof the items until the items are in order.","source_id":"nist-dads.permutationsort","source_sha256":"5fc2880dc3f719b8df6f0a8320be938fbdcc8ebcd252421811e2d11d26991cc6","start":58}],"target_id":"method.nist.permutationsort","target_kind":"node","target_sha256":"4c149ce316da0a75a5254d9a97da73cc95001f89af5984f8be44df42dc358aa1"}],"method.nist.pigeonholesort":[{"id":"assertion.method.nist.pigeonholesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pigeonhole sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items. The first pass allocates an array of buckets , one bucket for each possible key value, then moves each item to its key's bucket. The second pass goes over the bucket array moving each item to the next place in the destination.","support":[{"end":396,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the range of\nkeys\nis approximately equal to the number of items.  The first pass allocates an\narray\nof\nbuckets\n, one bucket for each possible\nkey\nvalue, then moves each item to its key's bucket.  The second pass goes over the bucket array moving each item to the next place in the destination.","source_id":"nist-dads.pigeonholesort","source_sha256":"d91e5e538fa22d040faa03d6bc7591cea943510a403c27c061f0f12c0db33570","start":56}],"target_id":"method.nist.pigeonholesort","target_kind":"node","target_sha256":"725718d465e40da14a79342ae94619bc2fa466fc210cab7ced29748efc1c5922"}],"method.nist.pipelineddvd":[{"id":"assertion.method.nist.pipelineddvd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pipelined divide and conquer as: A divide and conquer paradigm in which partial results from recursive calls can be used before the calls complete. The technique is often useful for reducing the depth of an algorithm .","support":[{"end":279,"quote":"A\ndivide and conquer\nparadigm in which partial results from\nrecursive\ncalls can be used before the calls complete. The technique is often useful for reducing the\ndepth\nof an\nalgorithm\n.","source_id":"nist-dads.pipelineddvd","source_sha256":"d911c4da968d5ec13b939127558def311135318418ba54eab0aa9dbcd7e6eebd","start":94}],"target_id":"method.nist.pipelineddvd","target_kind":"node","target_sha256":"e9a14a0f8fa489b9db16959b3c668e661c89906e7b0b77bbd2eee2b9cd4bf290"}],"method.nist.polynomaprox":[{"id":"assertion.method.nist.polynomaprox","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a (1+ε)-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of ε. Sometimes referred to more precisely as polynomial-time approximation scheme. Also known as PTAS.","support":[{"end":412,"quote":"A set of\nalgorithms\n{A\nε\n| ε > 0}, where each A\nε\nis a\n(1+ε)-approximation algorithm\nand the execution time is bounded by a\npolynomial\nin the length of the input.  The execution time may depend on the choice of ε.  Sometimes referred to more precisely as polynomial-time approximation scheme.\nAlso known as\nPTAS.","source_id":"nist-dads.polynomaprox","source_sha256":"c703d11352b1f66fed9aac056a6cd9d72539acf4bfb1122d137e0a42078204c6","start":100}],"target_id":"method.nist.polynomaprox","target_kind":"node","target_sha256":"a9be6d21b562fc0dd0764b2a59e056aff0ff294c389e6d9949b915b4bd1cc3b4"}],"method.nist.polyphmerge":[{"id":"assertion.method.nist.polyphmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polyphase merge as: A nonbalanced k-way merge which reduces the number of output files needed by reusing the emptied input file or device as one of the output devices. This is most efficient if the number of output runs in each output file is different.","support":[{"end":290,"quote":"A nonbalanced\nk-way merge\nwhich reduces the number of output files needed by reusing the emptied input file or device as one of the output devices.  This is most efficient if the number of output runs in each output file is different.","source_id":"nist-dads.polyphmerge","source_sha256":"c36a02bd68f62a0467d6093195efeda11b7585bffc67f12c6c0b63828e075fea","start":56}],"target_id":"method.nist.polyphmerge","target_kind":"node","target_sha256":"539b036074399709dd0c66df0b30a2400543b1a5a726305f108538943f23fbe0"}],"method.nist.polyphmrgsrt":[{"id":"assertion.method.nist.polyphmrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polyphase merge sort as: A merge sort algorithm that reduces the number of intermediate files needed by reusing emptied files.","support":[{"end":167,"quote":"A\nmerge sort\nalgorithm that reduces the number of intermediate files needed by reusing emptied files.","source_id":"nist-dads.polyphmrgsrt","source_sha256":"0713a157e655c2743f78e104a2091904ac4624611fd70c44975c4be607b1f002","start":66}],"target_id":"method.nist.polyphmrgsrt","target_kind":"node","target_sha256":"f68714853da068269cd0a073cbc91dd0e72789d50b33dba46a559eee03901053"}],"method.nist.postmansort":[{"id":"assertion.method.nist.postmansort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines postman's sort as: A highly engineered variant of top-down radix sort where attributes of the key are described so the algorithm can allocate buckets and distribute efficiently.","support":[{"end":212,"quote":"A highly engineered variant of\ntop-down radix sort\nwhere attributes of the\nkey\nare described so the algorithm can allocate buckets and distribute efficiently.","source_id":"nist-dads.postmansort","source_sha256":"326576c451b5306c72c7fcd221bbbe079e7d8e3409a24489edeba5ccaffd36c0","start":54}],"target_id":"method.nist.postmansort","target_kind":"node","target_sha256":"36990effd05b788ced371d7ac4e94d212467cae21085b4397731126aece2b0ae"}],"method.nist.postordertraversal":[{"id":"assertion.method.nist.postordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines postorder traversal as: Process all nodes of a tree by recursively processing all subtrees, then finally processing the root . Also known as postfix traversal.","support":[{"end":199,"quote":"Process all\nnodes\nof a\ntree\nby\nrecursively\nprocessing all subtrees, then finally processing the\nroot\n.\nAlso known as\npostfix traversal.","source_id":"nist-dads.postordertraversal","source_sha256":"96ce23cb392f55631e3fcbba6273e577e34016447ab35df659257e5a94fea857","start":64}],"target_id":"method.nist.postordertraversal","target_kind":"node","target_sha256":"43bb3fc47a3d387514a76bbe0b09eed19d67891edc326bcc263163188889990f"}],"method.nist.preordertraversal":[{"id":"assertion.method.nist.preordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines preorder traversal as: Process all nodes of a tree by processing the root , then recursively processing all subtrees. Also known as prefix traversal.","support":[{"end":188,"quote":"Process all\nnodes\nof a\ntree\nby processing the\nroot\n, then\nrecursively\nprocessing all subtrees.\nAlso known as\nprefix traversal.","source_id":"nist-dads.preordertraversal","source_sha256":"529ca5ac1b71f7f2b6aa3f1231f911f57b1983d1bd88bd22eb8d1a6350754b7d","start":62}],"target_id":"method.nist.preordertraversal","target_kind":"node","target_sha256":"bc94cb61f9a9bd071b3f339c89ea4a776798465209bfe58dbede8fcbc060e26a"}],"method.nist.primjarnik":[{"id":"assertion.method.nist.primjarnik","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Prim-Jarnik algorithm as: Compute a minimum spanning tree by beginning with any vertex as the current tree . At each step add a least edge between any vertex not in the tree and any vertex in the tree. Continue until all vertices have been added.","support":[{"end":290,"quote":"Compute a\nminimum spanning tree\nby beginning with any\nvertex\nas the current\ntree\n.  At each step add a least\nedge\nbetween any\nvertex\nnot in the tree and any vertex in the tree.  Continue until all vertices have been added.","source_id":"nist-dads.primjarnik","source_sha256":"182665b9d10c2ece0f563d3bac08cb6cb29c9302a9088e7315d4668ee95df510","start":68}],"target_id":"method.nist.primjarnik","target_kind":"node","target_sha256":"bcefbfede2463547edda893fec70408a15969fb6c86b7234b50221acde19c821"}],"method.nist.prunensearch":[{"id":"assertion.method.nist.prunensearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prune and search as: Find an optimal value by eliminating a constant fraction of remaining objects at each step. Eliminated objects are guaranteed not to affect the optimal value. A logarithmic number of steps reduces the number of objects to a constant, and a brute force approach can then solve it. Also known as decimation.","support":[{"end":377,"quote":"Find an\noptimal value\nby eliminating a constant fraction of remaining objects at each step.  Eliminated objects are guaranteed not to affect the optimal value.  A\nlogarithmic\nnumber of steps reduces the number of objects to a constant, and a\nbrute force\napproach can then solve it.\nAlso known as\ndecimation.","source_id":"nist-dads.prunensearch","source_sha256":"c2bec4ceb1f19fcb3ca9a30c14d18618e687e239523fed0dc704bb6eae3cdfef","start":70}],"target_id":"method.nist.prunensearch","target_kind":"node","target_sha256":"dbb78a2b15fc0f6dc082ba1198e3a78a02e2f636b1426eb6191b21db228ad73d"}],"method.nist.pseudorandomnumbergen":[{"id":"assertion.method.nist.pseudorandomnumbergen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pseudo-random number generator as: A deterministic algorithm to generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties. Also known as PRNG, deterministic random bit generator, DRBG.","support":[{"end":302,"quote":"A\ndeterministic algorithm\nto generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties.\nAlso known as\nPRNG, deterministic random bit generator, DRBG.","source_id":"nist-dads.pseudorandomnumbergen","source_sha256":"dd9863e891f330ce124accfc80f6039b6b7f71eaf5300e0e0b5dad1d979c7095","start":86}],"target_id":"method.nist.pseudorandomnumbergen","target_kind":"node","target_sha256":"a4266eafec185d788e9a60e408085bba051f5829193a6fe32de0e02578812f22"}],"method.nist.qsort":[{"id":"assertion.method.nist.qsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines q sort as: The sort function in many libraries. It is generally a combination of quicksort, for many items, and insertion sort , for a few items.","support":[{"end":172,"quote":"The\nsort\nfunction in many libraries. It is generally a combination of quicksort, for many items, and\ninsertion sort\n, for a few items.","source_id":"nist-dads.qsort","source_sha256":"5de8a90679d0a4801804280d9968c3a1f144f051f53fb381a23251a1c2cb1847","start":38}],"target_id":"method.nist.qsort","target_kind":"node","target_sha256":"9dcdbdf37e41f9faf62742e2e3456215c439256356d2d11885360e8112300a8b"}],"method.nist.quadraticprb":[{"id":"assertion.method.nist.quadraticprb","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quadratic probing as: A method of open addressing for a hash table in which a collision is resolved by putting the item in the next empty place given by a probe sequence . The space between places in the sequence increases quadratically.","support":[{"end":276,"quote":"A method of\nopen addressing\nfor a\nhash table\nin which a\ncollision\nis resolved by putting the item in the next empty place given by a\nprobe sequence\n.  The space between places in the sequence increases quadratically.","source_id":"nist-dads.quadraticprb","source_sha256":"52910a88e5ec859d6aa1f5f8438b64e144cb26e88ec3ae436446a6c0d17e6312","start":60}],"target_id":"method.nist.quadraticprb","target_kind":"node","target_sha256":"2268915267031d3bd34d7f0a01b570e2b28499b818eab0bbdb46009360fee397"}],"method.nist.quicksearch":[{"id":"assertion.method.nist.quicksearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quick search as: A string matching algorithm that compares characters from the end of the search string to its beginning. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","support":[{"end":292,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the search string to its beginning.  When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","source_id":"nist-dads.quicksearch","source_sha256":"5c615ff093cc5edd59467ec3b03c3bcb728cf82de88c4afc9ebe0df6425812c9","start":50}],"target_id":"method.nist.quicksearch","target_kind":"node","target_sha256":"d9984270d67028a7e5f39c8bf5841880651613fd672a7ca0605879c77eaaada0"}],"method.nist.quicksort":[{"id":"assertion.method.nist.quicksort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines quicksort as: Pick an element from the array (the pivot), partition the remaining elements into those greater than and less than this pivot, and recursively sort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","support":[{"end":383,"quote":"Pick an element from the array (the pivot),\npartition\nthe remaining elements into those greater than and less than this pivot, and\nrecursively\nsort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","source_id":"nist-dads.quicksort","source_sha256":"0782b309479e447f90ae37b5fd4804aa9e617eaeaf1c1bfb38d43d29402a7b1e","start":44}],"target_id":"method.nist.quicksort","target_kind":"node","target_sha256":"333feb7621bfc1412387e14a2009093b393ebcc215bf4f0e0797517047ea4832"}],"method.nist.radixsort":[{"id":"assertion.method.nist.radixsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines radix sort as: A multiple pass distribution sort algorithm that distributes each item to a bucket according to part of the item's key beginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","support":[{"end":376,"quote":"A multiple pass\ndistribution sort\nalgorithm that distributes each item to a\nbucket\naccording to part of the item's\nkey\nbeginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","source_id":"nist-dads.radixsort","source_sha256":"a100bba766cbf8977c872a6521a1311d6aba58ec69121272ed871660b4e07282","start":46}],"target_id":"method.nist.radixsort","target_kind":"node","target_sha256":"429bc1885f2104da9f5663a7472cc7700465217c7e10d7d6bbf692b98be2812c"}],"method.nist.randomizdrnd":[{"id":"assertion.method.nist.randomizdrnd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized rounding as: A probabilistic method to convert a solution of a relaxed problem into an approximate solution to the original problem.","support":[{"end":183,"quote":"A probabilistic method to convert a solution of a\nrelaxed\nproblem into an approximate solution to the original problem.","source_id":"nist-dads.randomizdrnd","source_sha256":"34c91448929459ed05e3424ffef09ca21d1225e83304d991171bab5d6025ffbc","start":64}],"target_id":"method.nist.randomizdrnd","target_kind":"node","target_sha256":"fb84a641e5405cc49ac047f990e134a4115365ffcb9a238e8822f14d08c8aee6"}],"method.nist.randomsampl":[{"id":"assertion.method.nist.randomsampl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random sampling as: Using a randomly selected sample of the data to help solve a problem on the whole data.","support":[{"end":155,"quote":"Using a randomly selected sample of the data to help solve a problem on the whole data.","source_id":"nist-dads.randomsampl","source_sha256":"99a5f3a07e16dde99d54f7949f7175219878669739c7107fb3d99419aac5cb1d","start":68}],"target_id":"method.nist.randomsampl","target_kind":"node","target_sha256":"4260d1ab6c54e420beb59f52dfea66bd5f30ddf3eacab73eaf120b26eaaf20b9"}],"method.nist.randomsearch":[{"id":"assertion.method.nist.randomsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random search as: Repeatedly check items in an array at random until successful.","support":[{"end":114,"quote":"Repeatedly check items in an\narray\nat random until successful.","source_id":"nist-dads.randomsearch","source_sha256":"685152c5b0fb50ffaabc75d899be29d97bb5ad35ab37866d60c576d6b234d4ac","start":52}],"target_id":"method.nist.randomsearch","target_kind":"node","target_sha256":"54d6ff72a1020ae22bc5953b640f4cf6f34c88bbdc176915d783ec33b06dc8d3"}],"method.nist.rangesort":[{"id":"assertion.method.nist.rangesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines range sort as: A bucket sort where the function to determine the bucket is based on the range of possible keys .","support":[{"end":143,"quote":"A\nbucket sort\nwhere the function to determine the\nbucket\nis based on the\nrange\nof possible\nkeys\n.","source_id":"nist-dads.rangesort","source_sha256":"26fbaaefe9780fbcca6e5f1e3ecaba8fd8712b6015b56f895c494f913c307bc6","start":46}],"target_id":"method.nist.rangesort","target_kind":"node","target_sha256":"5bc18e7061f283210326fa48acfed51dfdb6b95434a8ff77b04d3ba51aad78de"}],"method.nist.rapidsort":[{"id":"assertion.method.nist.rapidsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rapid sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary array . The second pass goes over the auxiliary array writing the counted number of keys to the destination.","support":[{"end":357,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the range of\nkeys\nis approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary\narray\n. The second pass goes over the auxiliary array writing the counted number of keys to the destination.","source_id":"nist-dads.rapidsort","source_sha256":"4b3cad6866cad9c884deb7ae3a717126394bd2774e962a6c1d900b60064cc1c0","start":46}],"target_id":"method.nist.rapidsort","target_kind":"node","target_sha256":"5cd342cd02c5fe3bfec9c62f0d70ea68c5123b98d80016aa9af4bdeeec750488"}],"method.nist.ratcliffobershelp":[{"id":"assertion.method.nist.ratcliffobershelp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ratcliff/Obershelp pattern recognition as: Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common substring plus, recursively, matching characters in the unmatched region on either side of the longest common substring.","support":[{"end":412,"quote":"Compute the similarity of two\nstrings\nas the number of matching characters divided by the total number of characters in the two strings.  Matching characters are those in the\nlongest common substring\nplus, recursively, matching characters in the unmatched region on either side of the longest common substring.","source_id":"nist-dads.ratcliffobershelp","source_sha256":"7b699795308416bb805af1de0b8596a75c9fbd2f309014796e5a9d28f4f0ba2c","start":102}],"target_id":"method.nist.ratcliffobershelp","target_kind":"node","target_sha256":"bff99f88e959045887473b8c043c4730f7d88558d069352b6fe1665c79c24428"}],"method.nist.rebalance":[{"id":"assertion.method.nist.rebalance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rebalance as: Restore balance to a tree .","support":[{"end":71,"quote":"Restore\nbalance\nto a\ntree\n.","source_id":"nist-dads.rebalance","source_sha256":"376064a758a690f561e6da31ef4c116a293596937367f815c50124c1d7c328c2","start":44}],"target_id":"method.nist.rebalance","target_kind":"node","target_sha256":"2a545d4c6ec33f58881fa0149347f7604021669b8eb0dd5101fa12c73778a491"}],"method.nist.recursion":[{"id":"assertion.method.nist.recursion","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines recursion as: An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","support":[{"end":170,"quote":"An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","source_id":"nist-dads.recursion","source_sha256":"22e73481a2c3487b2e35080a2ef2abec1a5df04b470f63186cd5fce2d04342d5","start":56}],"target_id":"method.nist.recursion","target_kind":"node","target_sha256":"219cb89dd1677e39912603f3f231dc6faaa437bcfe0446a06da229339d984ff9"}],"method.nist.repeatedsquaring":[{"id":"assertion.method.nist.repeatedsquaring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines repeated squaring as: Compute the n th power of an expression in Θ(log n) steps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","support":[{"end":246,"quote":"Compute the n\nth\npower of an expression in\nΘ(log n)\nsteps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","source_id":"nist-dads.repeatedsquaring","source_sha256":"f8eaff86444a00e6a3da69c65099c97bdc0843a54d61c531cb8c6736c9e9da37","start":60}],"target_id":"method.nist.repeatedsquaring","target_kind":"node","target_sha256":"b87d369e88d5d805edd5ba3a76849f409c0f6d831ef134dd369333dfd99954e8"}],"method.nist.reservoirsampling":[{"id":"assertion.method.nist.reservoirsampling","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reservoir sampling as: Randomly select k items from a stream of items of unknown length. Save the first k items in an array of size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive). If M ≤ k, replace item M of the array with item j.","support":[{"end":301,"quote":"Randomly select k items from a stream of items of unknown length.  Save the first k items in an\narray\nof size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive).  If M ≤ k, replace item M of the array with item j.","source_id":"nist-dads.reservoirsampling","source_sha256":"ced24fac1562ff0a5344be627d2c6953e6ef7b38f792b956764e1e800e429b96","start":62}],"target_id":"method.nist.reservoirsampling","target_kind":"node","target_sha256":"e4bf574d96e032524019331f9cfefce9f351a2c58a3170d5fc573dcfc0a9559d"}],"method.nist.rhoapproxmtn":[{"id":"assertion.method.nist.rhoapproxmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ρ-approximation algorithm as: An approximation algorithm guaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or relative performance guarantee of the algorithm.","support":[{"end":294,"quote":"An\napproximation algorithm\nguaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or\nrelative performance guarantee\nof the algorithm.","source_id":"nist-dads.rhoapproxmtn","source_sha256":"e84386d66472aa1deb376b85d79cd067a5aa0aec261135961308a800f84476ce","start":90}],"target_id":"method.nist.rhoapproxmtn","target_kind":"node","target_sha256":"fae842708fc391afb24db2c6f83563bc10c36099d562116a9936d8122656985e"}],"method.nist.rightrotatn":[{"id":"assertion.method.nist.rightrotatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines right rotation as: (1) In a binary search tree , pushing a node N down and to the right to balance the tree. N's left child replaces N, and the left child's right child becomes N's left child. (2) In an array , moving all items to the next higher location. The last item is moved to the first location, which is now vacant. (3) In a list , removing the tail and inserting it at the head . Also known as rotate right.","support":[{"end":453,"quote":"(1) In a\nbinary search tree\n, pushing a\nnode\nN down and to the right to\nbalance\nthe tree.  N's left\nchild\nreplaces N, and the left child's right child becomes N's left child. (2) In an\narray\n, moving all items to the next higher location.  The last item is moved to the first location, which is now vacant. (3) In a\nlist\n, removing the\ntail\nand inserting it at the\nhead\n.\nAlso known as\nrotate right.","source_id":"nist-dads.rightrotatn","source_sha256":"4f2e7a19a7e85bc57a14c8db23243bcb131faf107ba61881a5698fffb3f5843f","start":54}],"target_id":"method.nist.rightrotatn","target_kind":"node","target_sha256":"ee89de6c8d34c0ba7336e989184f5f3e875cd9a583e139bf97bdf7b70fca8b1c"}],"method.nist.robinhoodhashing":[{"id":"assertion.method.nist.robinhoodhashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Robin Hood hashing as: In case of collision , the item with the longer probe sequence stays in the position. The other item is moved. This tends to equalize the length of probe sequences.","support":[{"end":228,"quote":"In case of\ncollision\n, the item with the longer\nprobe sequence\nstays in the position.  The other item is moved.  This tends to equalize the length of probe sequences.","source_id":"nist-dads.robinhoodhashing","source_sha256":"3df2ae0eb31cac4c0c019f143e0f6b4f897a218ab733fe58f29e7fe2772c60f1","start":62}],"target_id":"method.nist.robinhoodhashing","target_kind":"node","target_sha256":"864d4f17ee9e52247e45c9af69840594e821ffc7f37a3389b5bd371eb3ff7dfc"}],"method.nist.scan":[{"id":"assertion.method.nist.scan","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines scan as: A parallel operation in which each element in an array or linked list receives the sum of all previous elements. Also known as prefix sums.","support":[{"end":173,"quote":"A parallel operation in which each element in an\narray\nor\nlinked list\nreceives the sum of all previous elements.\nAlso known as\nprefix sums.","source_id":"nist-dads.scan","source_sha256":"b8579e67a02740e05bb1d1435f62ceb2cadcc045a83f0362d60d2d3a512c11bd","start":34}],"target_id":"method.nist.scan","target_kind":"node","target_sha256":"f2e7e3658fe483cc32af0f574f07696196cc3313eb65703fdefd8884e0691314"}],"method.nist.scapegoattree":[{"id":"assertion.method.nist.scapegoattree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines scapegoat tree as: A binary search tree that needs no balance information. Search time is logarithmic , and the amortized cost of update is logarithmic .","support":[{"end":188,"quote":"A\nbinary search tree\nthat needs no\nbalance\ninformation. Search time is\nlogarithmic\n, and the\namortized cost\nof update is\nlogarithmic\n.","source_id":"nist-dads.scapegoattree","source_sha256":"ca8d26699631e0f5b66239dd88442b33bccecf986dfc7f1293b648e35466efe9","start":54}],"target_id":"method.nist.scapegoattree","target_kind":"node","target_sha256":"92149c038ae7cb9e44884d44d51688b931556f8eeddf9ca1906a890b880aa224"}],"method.nist.search":[{"id":"assertion.method.nist.search","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines search as: Look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches.","support":[{"end":149,"quote":"Look for a value or item in a data structure.  There are dozens of algorithms, data structures, and approaches.","source_id":"nist-dads.search","source_sha256":"6ae86819505e27d7efc139527fa93c055ce8002bbc202c0c63c3c5be0c11b49f","start":38}],"target_id":"method.nist.search","target_kind":"node","target_sha256":"85838381a72d68dcd78b781e296f1a26f7e05b36f1d1f304ef745219aa088d6c"}],"method.nist.secantsearch":[{"id":"assertion.method.nist.secantsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines secant search as: Search a sorted array by estimating the next position to check based on the values at the two previous positions checked.","support":[{"end":173,"quote":"Search a\nsorted array\nby estimating the next position to check based on the values at the two previous positions checked.","source_id":"nist-dads.secantsearch","source_sha256":"5a17c610e140f433ee499ed0b706c095882282b3690199a67ecb3fe254fd1312","start":52}],"target_id":"method.nist.secantsearch","target_kind":"node","target_sha256":"ef457cea68a43598512e60adb85218647a53567bd97d0491cd673b7e1c00ebea"}],"method.nist.select":[{"id":"assertion.method.nist.select","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Select as: A four-part algorithm to select the k th smallest element of an array . Part 1) Consider the array as groups of 5 elements; sort and find the median of each group. 2) Use Select recursively to find x , the median of the medians. 3) Next partition the array around x . 4) Let i be the number of elements in the low side of the partition. If k ≤ i, use Select recursively to find the k th element of the low side. Otherwise Select the k-i th element of the high side.","support":[{"end":509,"quote":"A four-part algorithm to select the k\nth\nsmallest element of an\narray\n.  Part 1) Consider the array as groups of 5 elements; sort and find the\nmedian\nof each group.  2) Use Select\nrecursively\nto find\nx\n, the median of the medians. 3) Next\npartition\nthe array around\nx\n.   4) Let i be the number of elements in the low side of the partition.  If k ≤ i, use Select recursively to find the k\nth\nelement of the low side.  Otherwise Select the k-i\nth\nelement of the high side.","source_id":"nist-dads.select","source_sha256":"49abb127dd47a896be309253eb3af0946b8fec3d8a2f3f691df60b55b57f43a4","start":38}],"target_id":"method.nist.select","target_kind":"node","target_sha256":"25ea3aadd2904e70584bb761f8d9e279844f028ae6aabfba7580ab6f12c785d4"}],"method.nist.selectionsort":[{"id":"assertion.method.nist.selectionsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines selection sort as: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²) , where n is the number of elements. The number of swaps is O(n) .","support":[{"end":260,"quote":"A\nsort\nalgorithm that repeatedly searches remaining items to find the least one and moves it to its final location.  The run time is\nΘ(n²)\n, where n is the number of elements.  The number of swaps is\nO(n)\n.","source_id":"nist-dads.selectionsort","source_sha256":"210824667c4e247cf74c075c7aebf9f2daca04a8c505c5a488650ba1eb6f7d3a","start":54}],"target_id":"method.nist.selectionsort","target_kind":"node","target_sha256":"76ce5b4319b2823a61ecc64ff271c65a28840559e1b3a90d433805131585fa08"}],"method.nist.selectmode":[{"id":"assertion.method.nist.selectmode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines select mode as: An algorithm to find the mode, or most frequently occurring value, in a group of elements.","support":[{"end":138,"quote":"An algorithm to find the mode, or most frequently occurring value, in a group of elements.","source_id":"nist-dads.selectmode","source_sha256":"8ca4e3c4e1e1aa994b990231e0749e90a457b947609eed03a10fc32211edeac8","start":48}],"target_id":"method.nist.selectmode","target_kind":"node","target_sha256":"d5c18610ff6fd7aadef97615e61a0f5dc4e77e4b0e3cd2e89a3d4820a607a39a"}],"method.nist.shadowmerge":[{"id":"assertion.method.nist.shadowmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow merge as: An algorithm to merge two heaps by concatenating the smaller heap to the larger, then reordering just the concatenated nodes and their parents to restore the heap property.","support":[{"end":222,"quote":"An algorithm to merge two\nheaps\nby concatenating the smaller heap to the larger, then reordering just the concatenated\nnodes\nand their\nparents\nto restore the heap property.","source_id":"nist-dads.shadowmerge","source_sha256":"028fd17238730e130a40bd39306a8e04222c8d28f1e1078620699d7dd8d57c31","start":50}],"target_id":"method.nist.shadowmerge","target_kind":"node","target_sha256":"7a6a7cda2d95b29239c8b793a964ba3f7f673b9783820fc6a0018d46b82174be"}],"method.nist.shadowmrgins":[{"id":"assertion.method.nist.shadowmrgins","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow merge insert as: An algorithm to insert a new node into a shadow heap . The new node is placed in the unordered table. When the table grows beyond some threshold size, table nodes and all their parents are reordered so everything is a heap.","support":[{"end":288,"quote":"An\nalgorithm\nto insert a new\nnode\ninto a\nshadow heap\n. The new node is placed in the unordered table. When the table grows beyond some threshold size, table  nodes and all their\nparents\nare reordered so everything is a heap.","source_id":"nist-dads.shadowmrgins","source_sha256":"6e631a2698a883b4a0af5df15d98f4a9c979d928d51d80414a480fb68df412fa","start":64}],"target_id":"method.nist.shadowmrgins","target_kind":"node","target_sha256":"39c976254b977c6e7d9eb4c08b40084b21927b268f3634e4e03c2f403c298e0f"}],"method.nist.shannonfano":[{"id":"assertion.method.nist.shannonfano","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Shannon-Fano coding as: A variable-length coding based on the frequency of occurrence of each character. Divide the characters into two sets with the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding. Repeatedly divide the sets until each character has a unique coding.","support":[{"end":354,"quote":"A variable-length coding based on the frequency of occurrence of each character.  Divide the characters into two\nsets\nwith the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding.  Repeatedly divide the sets until each character has a unique coding.","source_id":"nist-dads.shannonfano","source_sha256":"20eb6f518528ad31c8e2cd84ea4c4b2f33045b3790b33214910e094499774cd9","start":64}],"target_id":"method.nist.shannonfano","target_kind":"node","target_sha256":"05d8a0188f5bde06ed60be460c370c41c0ccebbefdc307e45c93c8c3e087619d"}],"method.nist.shellsort":[{"id":"assertion.method.nist.shellsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Shell sort as: The first diminishing increment sort . On each pass i sets of n/i items are sorted, typically with insertion sort . On each succeeding pass, i is reduced until it is 1 for the last pass. A good series of i values is important to efficiency.","support":[{"end":289,"quote":"The first\ndiminishing increment sort\n.  On each pass i sets of n/i items are sorted, typically with\ninsertion sort\n.  On each succeeding pass, i is reduced until it is 1 for the last pass.  A good series of i values is important to efficiency.","source_id":"nist-dads.shellsort","source_sha256":"cadb664db3f88af94c604e2a509533a265abc9c1ea456f4582e9f50da94468ed","start":46}],"target_id":"method.nist.shellsort","target_kind":"node","target_sha256":"610149a82fd192b79dc73e93919f8231142ae893542097d4f1daa591ae7b46d2"}],"method.nist.shiftor":[{"id":"assertion.method.nist.shiftor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Shift-Or as: A string matching algorithm which keeps an array of bits, R, showing if prefixes of the pattern don't match at the current place. Before searching, mismatch arrays are computed for each character in the alphabet and saved in an array, S. For the next position, with the character c, R = shift(R) or S[c]. If the last bit of R is 0, the pattern matches.","support":[{"end":397,"quote":"A\nstring matching\nalgorithm which keeps an\narray\nof bits, R, showing if\nprefixes\nof the\npattern\ndon't match at the current place.  Before searching, mismatch arrays are computed for each character in the\nalphabet\nand saved in an array, S.  For the next position, with the character c, R = shift(R)\nor\nS[c].  If the last bit of R is 0, the pattern matches.","source_id":"nist-dads.shiftor","source_sha256":"e6b19706704ac32ed4b4e29214722e60ece8fa7a2944b948a24bb7b4e8a8ffda","start":42}],"target_id":"method.nist.shiftor","target_kind":"node","target_sha256":"96ae4cb5226dd4bcfd22f0f06aa74dc892608c6da1c93231f7f598e8ac106de7"}],"method.nist.shufflesort":[{"id":"assertion.method.nist.shufflesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shuffle sort as: A distribution sort algorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array. This creates n/8 buckets to which the remaining 7/8 of the items are distributed. Each bucket is then sorted, and the buckets are concatenated.","support":[{"end":337,"quote":"A\ndistribution sort\nalgorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array.  This creates n/8\nbuckets\nto which the remaining 7/8 of the items are distributed.  Each bucket is then sorted, and the buckets are concatenated.","source_id":"nist-dads.shufflesort","source_sha256":"4618771755724face5fa21724679321b2a993a9f1cb201fb406725410ee78980","start":50}],"target_id":"method.nist.shufflesort","target_kind":"node","target_sha256":"16a532fd2752f9f82c52f46628826892feecae7a9805a8ab5e3014ff1ee48e62"}],"method.nist.sieve":[{"id":"assertion.method.nist.sieve","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sieve of Eratosthenes as: An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked) array of integers from 2 to N. The first unmarked integer, 2, is the first prime. Mark every multiple of this prime. Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","support":[{"end":368,"quote":"An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked)\narray\nof integers from 2 to N.  The first unmarked integer, 2, is the first prime.  Mark every multiple of this prime.  Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","source_id":"nist-dads.sieve","source_sha256":"22cdbc297a359d85a643bc5485fcb969adb9f95fec137a208b15b3bfab98420e","start":68}],"target_id":"method.nist.sieve","target_kind":"node","target_sha256":"c180391ee95b2bba5e69ead5331f2c4f7b049287663a436fedfd14ebebfe8523"}],"method.nist.siftup":[{"id":"assertion.method.nist.siftup","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sift up as: Restoring the heap property by swapping a node with its parent , and repeating the process on the parent until the root is reached or the heap property is satisfied.","support":[{"end":205,"quote":"Restoring the\nheap property\nby swapping a\nnode\nwith its\nparent\n, and repeating the process on the parent until the\nroot\nis reached or the heap property is satisfied.","source_id":"nist-dads.siftup","source_sha256":"2b8528e624e6b05c7b61934f08c0a11288f382800fcf43324fbdf25c5e05671f","start":40}],"target_id":"method.nist.siftup","target_kind":"node","target_sha256":"ffff2ccaa7ea92f4ed6a7dee86f97660e5aa967e6442df2132fbba151b150b47"}],"method.nist.simplemerge":[{"id":"assertion.method.nist.simplemerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple merge as: Merge n sorted streams into one output stream. All the stream heads are compared, and the head with the least key is removed and written to the output. This is repeated until all streams are empty.","support":[{"end":247,"quote":"Merge\nn sorted streams into one output stream. All the stream heads are compared, and the head with the least\nkey\nis removed and written to the output. This is repeated until all streams are empty.","source_id":"nist-dads.simplemerge","source_sha256":"b344fc608739a11e0dec63bed512eec32476278f8401573a0b997639afe00314","start":50}],"target_id":"method.nist.simplemerge","target_kind":"node","target_sha256":"3b4ff152a5819830becafbe61e27d60e511ab6fd7428691ea4532746955517c3"}],"method.nist.simulatedannealing":[{"id":"assertion.method.nist.simulatedannealing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simulated annealing as: A technique to find a good solution to an optimization problem by trying random variations of the current solution. A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds. The slower the cooling schedule , or rate of decrease, the more likely the algorithm is to find an optimal or near- optimal solution .","support":[{"end":429,"quote":"A technique to find a good solution to an\noptimization problem\nby trying random variations of the current solution.  A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds.  The slower the\ncooling schedule\n, or rate of decrease, the more likely the algorithm is to find an optimal or near-\noptimal solution\n.","source_id":"nist-dads.simulatedannealing","source_sha256":"99fcaae80e16487f142705cf1653792ef0cb63e48786d4a28fcd9ae8d7f8f7fd","start":64}],"target_id":"method.nist.simulatedannealing","target_kind":"node","target_sha256":"4b663e50151cd2f8f0ff0b629995bd846a5df65fef176a1f826d5a15c5b9d7d8"}],"method.nist.smithalgorithm":[{"id":"assertion.method.nist.smithalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Smith algorithm as: A string matching algorithm which computes the shift value for both the rightmost character of the window and the character preceding it, then uses the maximum of the two values.","support":[{"end":234,"quote":"A\nstring matching\nalgorithm which computes the shift value for both the rightmost character of the\nwindow\nand the character preceding it, then uses the maximum of the two values.","source_id":"nist-dads.smithalgorithm","source_sha256":"0850c75f8bee323ac86e94136528453e586e2622abcdfe4715ea652e3977516d","start":56}],"target_id":"method.nist.smithalgorithm","target_kind":"node","target_sha256":"421357ebd3164a09b14cf924f70878b9c31f366505ff4107bd3caf81eea17a8e"}],"method.nist.smithwaterman":[{"id":"assertion.method.nist.smithwaterman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Smith-Waterman algorithm as: A means of searching protein databases to find those with the best alignment.","support":[{"end":151,"quote":"A means of searching protein databases to find those with the best alignment.","source_id":"nist-dads.smithwaterman","source_sha256":"a9a4a20178d679955780bd54aa324f220f9b7e02c870e6429186a349b9433020","start":74}],"target_id":"method.nist.smithwaterman","target_kind":"node","target_sha256":"617fb56790014ab894912cc529d03cc2517179dbf580d5b224c908605a0a7f64"}],"method.nist.smoothsort":[{"id":"assertion.method.nist.smoothsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines smoothsort as: A variant of heapsort that takes advantage of a partially ordered table. Performance is O(n) when input is sorted and O(n log n) performance for worst case .","support":[{"end":205,"quote":"A variant of\nheapsort\nthat takes advantage of a partially ordered table.  Performance is O(n) when input is sorted and O(n log n)  performance for\nworst case\n.","source_id":"nist-dads.smoothsort","source_sha256":"317f9917a6777a9a458a15fca638f69be38bba73d846222a7226c24cc97a3fb4","start":46}],"target_id":"method.nist.smoothsort","target_kind":"node","target_sha256":"6c92602498ae8ec7c8ff47a0aed46a4ff7524b647786ebef1177df64a3405011"}],"method.nist.sort":[{"id":"assertion.method.nist.sort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines sort as: Arrange items in a predetermined order. There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the keys , the cost of comparing keys vs. the cost of moving items, etc. Most algorithms can be implemented as an in-place sort , and many can be implemented so they are stable , too. Formal Definition: The sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows. S′ i ≤ S′ i+1 , 0 < i < N (the items are in order) and S′ is a permutation of S.","support":[{"end":657,"quote":"Arrange items in a predetermined order.  There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the\nkeys\n, the cost of comparing keys vs. the cost of moving items, etc.  Most algorithms can be implemented as an\nin-place sort\n, and many can be implemented so they are\nstable\n, too.\nFormal Definition:\nThe sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows.\nS′\ni\n≤ S′\ni+1\n, 0 < i < N\n(the items are in order) and\nS′ is a\npermutation\nof S.","source_id":"nist-dads.sort","source_sha256":"1055fa7ba1c68225a4a1cf591d06992d50dacfdb9bcbda468d358c54b591a155","start":34}],"target_id":"method.nist.sort","target_kind":"node","target_sha256":"eadc23976a278bfde0e02cc3283c035f52f19cca358574433b07040f474452e7"}],"method.nist.soundex":[{"id":"assertion.method.nist.soundex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines soundex as: An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds. This reduces matching problems from different spellings.","support":[{"end":250,"quote":"An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds.  This reduces matching problems from different spellings.","source_id":"nist-dads.soundex","source_sha256":"c661440783005c9ddc2a95f9b915fb9e6d847588033d82245ab044d633dacf6a","start":40}],"target_id":"method.nist.soundex","target_kind":"node","target_sha256":"00ea55100c4ae1c765c5cceeecb6daa1d93ad6d70225b422cbc8d282989d035d"}],"method.nist.spaceorderingmethod":[{"id":"assertion.method.nist.spaceorderingmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines space ordering method as: A mapping from a discrete k-dimensional space into a linear order.","support":[{"end":134,"quote":"A mapping from a discrete k-dimensional space into a linear order.","source_id":"nist-dads.spaceorderingmethod","source_sha256":"72754115f9746f77d7730720bad00eac8e283a8b2164a12b17723908df148af0","start":68}],"target_id":"method.nist.spaceorderingmethod","target_kind":"node","target_sha256":"20d79fdc2e76afe2653d1b8f7d297cf138f103800b247fec11d8f4fa9cf76109"}],"method.nist.sparsificatn":[{"id":"assertion.method.nist.sparsificatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparsification as: Technique for designing dynamic graph algorithms , which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of edges and n is the number of vertices of the given graph.","support":[{"end":270,"quote":"Technique for designing dynamic\ngraph\nalgorithms\n, which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of\nedges\nand n is the number of\nvertices\nof the given graph.","source_id":"nist-dads.sparsificatn","source_sha256":"1ea60d43af8a0ce48d438b2fc02708ba793de5479e339622f968017a66bfc133","start":66}],"target_id":"method.nist.sparsificatn","target_kind":"node","target_sha256":"6c1df8d4c5f8ac7021bbc570f0f65c0f3efc24d77a578d4bb316375b3dd5f925"}],"method.nist.starencoding":[{"id":"assertion.method.nist.starencoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines star encoding as: Using a fixed dictionary , encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","support":[{"end":182,"quote":"Using a fixed\ndictionary\n, encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","source_id":"nist-dads.starencoding","source_sha256":"90a89b4c0a1edbef819250b6509b86bd205fd7d1979c265abad09b0d19ebcf3e","start":52}],"target_id":"method.nist.starencoding","target_kind":"node","target_sha256":"99d4f1c8d800819306a9a182e047fde27695351d8d839b4bc60081bfbe4ad203"}],"method.nist.stoogesort":[{"id":"assertion.method.nist.stoogesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stooge sort as: A terribly inefficient sort algorithm that swaps the top and bottom items if needed, then ( recursively ) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","support":[{"end":241,"quote":"A terribly inefficient\nsort\nalgorithm that swaps the top and bottom items if needed, then (\nrecursively\n) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","source_id":"nist-dads.stoogesort","source_sha256":"5875a1bfea305431af56773c0a16a9cc1fc8a2e661110524e49cf3ff0db03fac","start":48}],"target_id":"method.nist.stoogesort","target_kind":"node","target_sha256":"6406bb87229ef9cc7f6e02530d587a48dfd7f2a2dfd6138c647ca39452cc9218"}],"method.nist.strandsort":[{"id":"assertion.method.nist.strandsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strand sort as: A sort algorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist. For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist. Merge the sublist into a final, sorted list. Repeatedly extract and merge sublists until all items are sorted. Handle two or fewer items as special cases.","support":[{"end":516,"quote":"A\nsort\nalgorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist.  For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist.\nMerge\nthe sublist into a final, sorted list.  Repeatedly extract and merge  sublists until all items are sorted.  Handle two or fewer items as special cases.","source_id":"nist-dads.strandsort","source_sha256":"3f3aa4106813c013246100fa0083845ee9bf2c64e71e186145fe373f7999dd78","start":48}],"target_id":"method.nist.strandsort","target_kind":"node","target_sha256":"f6dbc4a8ebd40ec8b24291d7092349d8ed6d5c91a738212b3c92fa370bc67483"}],"method.nist.stringmatchwerror":[{"id":"assertion.method.nist.stringmatchwerror","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string matching with errors as: Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string. Preprocessing, e.g., building an index, may or may not be allowed. Also known as approximate string matching.","support":[{"end":348,"quote":"Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string.  Preprocessing, e.g., building an index, may or may not be allowed.\nAlso known as\napproximate string matching.","source_id":"nist-dads.stringmatchwerror","source_sha256":"aab04c10028533d7980eb204bd7e6dfc34efda9301b488cd89f8ef8bc2fe6cf7","start":80}],"target_id":"method.nist.stringmatchwerror","target_kind":"node","target_sha256":"baa21d8195bf149872e2f1af4878cc723b492a0c4221b7780e6d39640d5cf3fa"}],"method.nist.stringmatchwmismatch":[{"id":"assertion.method.nist.stringmatchwmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string matching with mismatches as: The special case of string matching with errors where mismatches are the only type of error allowed.","support":[{"end":188,"quote":"The special case of\nstring matching with errors\nwhere mismatches are the only type of error allowed.","source_id":"nist-dads.stringmatchwmismatch","source_sha256":"177b70bbfcb002dbbc119c27cad553cfcb36628e72051ef1b38a1732754352f0","start":88}],"target_id":"method.nist.stringmatchwmismatch","target_kind":"node","target_sha256":"8ffd3c15fba98022ccfa4e15d1341911de46a53cf37f2251e4c2585be2727aa1"}],"method.nist.strsrch":[{"id":"assertion.method.nist.strsrch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strsrch as: Find occurrences of a substring in a target string by trying the substring at each possible location in the string. Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","support":[{"end":258,"quote":"Find occurrences of a\nsubstring\nin a target\nstring\nby trying the substring at each possible location in the string.  Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","source_id":"nist-dads.strsrch","source_sha256":"b9b179c6023d878d07a9cfeeaec01f4c1ba30c03c536f3c1d02c0649cf2224e8","start":40}],"target_id":"method.nist.strsrch","target_kind":"node","target_sha256":"2c3be498d1b4ea4990039f0bab2d01df819cbfe9d3772c387dce646ef8812c09"}],"method.nist.stupidsort":[{"id":"assertion.method.nist.stupidsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stupid sort as: (1) The original name of gnome sort . (2) An alternate name for bogosort .","support":[{"end":122,"quote":"(1) The original name of\ngnome sort\n. (2) An alternate name for\nbogosort\n.","source_id":"nist-dads.stupidsort","source_sha256":"9e20bf0443b93c851d392214c70eee2d4f419812212822e26f217d712b3cc38b","start":48}],"target_id":"method.nist.stupidsort","target_kind":"node","target_sha256":"1685b954070874da62e917a6b17ac904ab1f555cb3b680961e2fe070be782cd1"}],"method.nist.symmetrybrek":[{"id":"assertion.method.nist.symmetrybrek","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetry breaking as: To differentiate parts of a structure, such as a graph , which locally look the same to all vertices . Usually implemented with randomization .","support":[{"end":216,"quote":"To differentiate parts of a structure, such as a\ngraph\n, which locally look the same to all\nvertices\n.  Usually implemented with\nrandomization\n.","source_id":"nist-dads.symmetrybrek","source_sha256":"328c4637788eb1db8c3bdda70ec8091044808f9e0a701ca78b521b3f5243b7e6","start":72}],"target_id":"method.nist.symmetrybrek","target_kind":"node","target_sha256":"464fc1b10aa5678f65546f81cbe3c06d48521b30b71ffffc9c9cbce5ee12eff3"}],"method.nist.tailrecursion":[{"id":"assertion.method.nist.tailrecursion","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tail recursion as: A special form of recursion where the last operation of a function is a recursive call. The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","support":[{"end":304,"quote":"A special form of\nrecursion\nwhere the last operation of a function is a recursive call.  The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","source_id":"nist-dads.tailrecursion","source_sha256":"03763f16730b90bc923f96a38f78b2dc5a1d56a96327501421ba77c1af65de9a","start":66}],"target_id":"method.nist.tailrecursion","target_kind":"node","target_sha256":"5a9ba7972b5ecba34f81eba1c0e767edf2c0134352a94d777bf236853823e185"}],"method.nist.threewaymsrt":[{"id":"assertion.method.nist.threewaymsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines three-way merge sort as: A k-way merge sort which uses three input and three output streams.","support":[{"end":133,"quote":"A\nk-way merge sort\nwhich uses three input and three output streams.","source_id":"nist-dads.threewaymsrt","source_sha256":"9fbe69facb916916972623165db8040bcabc9c430dc5eaf090a19301fdcba3d0","start":66}],"target_id":"method.nist.threewaymsrt","target_kind":"node","target_sha256":"519561b46aaf97dde72a8250703d9a06d028a1f29d4df781bb928da796ce473e"}],"method.nist.topdownradixsort":[{"id":"assertion.method.nist.topdownradixsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines top-down radix sort as: A recursive bucket sort where elements are distributed based on succeeding pieces (characters) of the key .","support":[{"end":171,"quote":"A recursive\nbucket sort\nwhere elements are distributed based on succeeding pieces (characters) of the\nkey\n.","source_id":"nist-dads.topdownradixsort","source_sha256":"dff8c7b4b14efb283dbab1d62e23d911c57ddb4900e827d43a0adf69e8ea0d66","start":64}],"target_id":"method.nist.topdownradixsort","target_kind":"node","target_sha256":"188b7b364582ca5d4bc45c1ff66d0234cad9364c448ea6de6f740dc2cc331e9c"}],"method.nist.tournament":[{"id":"assertion.method.nist.tournament","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tournament as: Find the maximum of a set of n elements in ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round. It takes n-1 comparisons, like linear search , but may be parallelized, extended to also find the second greatest element, etc.","support":[{"end":354,"quote":"Find the maximum of a set of n elements in  ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round.  It takes n-1 comparisons, like\nlinear search\n, but may be parallelized, extended to also find the second greatest element, etc.","source_id":"nist-dads.tournament","source_sha256":"d44a5e77a6dcad4b38aa84c0c7cc486b055eb0250bda999dcf754eca56abddd8","start":46}],"target_id":"method.nist.tournament","target_kind":"node","target_sha256":"76ded0bc4b792d6474af5e3a985117c5935a782bede4e0a8c7007fcb363a2bf0"}],"method.nist.transposeseqsearch":[{"id":"assertion.method.nist.transposeseqsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transpose sequential search as: Search an array or list by checking items one at a time. If the value is found, swap it with its predecessor so it is found faster next time. Also known as self-organizing sequential search.","support":[{"end":271,"quote":"Search an\narray\nor\nlist\nby checking items one at a time.  If the value is found, swap it with its predecessor so it is found faster next time.\nAlso known as\nself-organizing sequential search.","source_id":"nist-dads.transposeseqsearch","source_sha256":"b5c1bd884ffa91e1096215e30a022e9070dc9ed6923517dd6d9076624692d162","start":80}],"target_id":"method.nist.transposeseqsearch","target_kind":"node","target_sha256":"456c8c6e89b7379b685c0f66ddccc5b08837b506d579aacec936baff48d37ea5"}],"method.nist.treesort1":[{"id":"assertion.method.nist.treesort1","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treesort (1) as: A sort algorithm that first builds a binary search tree of the keys , then accesses the keys with an in-order traversal .","support":[{"end":171,"quote":"A\nsort\nalgorithm that first builds a\nbinary search tree\nof the\nkeys\n, then accesses the keys with an\nin-order traversal\n.","source_id":"nist-dads.treesort1","source_sha256":"d36b4fc56d13b700220aeb7938d6fa3543b6a5245a00f79eb5d3cce8dfbaa435","start":50}],"target_id":"method.nist.treesort1","target_kind":"node","target_sha256":"62a39c79b825c964b8f870eaae60d2309488f761d21ebffc3ab04c8495965970"}],"method.nist.treesort2":[{"id":"assertion.method.nist.treesort2","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treesort (2) as: Variants of heapsort .","support":[{"end":72,"quote":"Variants of\nheapsort\n.","source_id":"nist-dads.treesort2","source_sha256":"5ed6f7942d424b598b85321d038c96c0a4af152734b059370702fa887d954704","start":50}],"target_id":"method.nist.treesort2","target_kind":"node","target_sha256":"f8ac0ac4b96222acdb7e848fefdeb32617ede8fc3461e633d1d107be61c6d396"}],"method.nist.tripartition":[{"id":"assertion.method.nist.tripartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tripartition as: To partition array elements into three groups.","support":[{"end":96,"quote":"To\npartition\narray\nelements into three groups.","source_id":"nist-dads.tripartition","source_sha256":"936e002fb8dc1eb4faf086b979dd0328aed2d5c9fc20bab570704ef7f28d98c8","start":50}],"target_id":"method.nist.tripartition","target_kind":"node","target_sha256":"e920c9188292046ae822eb98843fded313d9f31e16ff2e0add5ff7f626dc92c2"}],"method.nist.twoway":[{"id":"assertion.method.nist.twoway","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Two Way algorithm as: Partition (\"factor\") the pattern , x, into left, x l , and right, x r , parts in such a way to optimize searching. Compare x r left to right then, if it matches, compare x l right to left.","support":[{"end":249,"quote":"Partition\n(\"factor\") the\npattern\n, x, into left, x\nl\n, and right, x\nr\n, parts in such a way to optimize searching.  Compare x\nr\nleft to right then, if it matches, compare x\nl\nright to left.","source_id":"nist-dads.twoway","source_sha256":"d56413f45c672176078d3fc34e8614287c81437b322195a90e384bcafd9f5ea7","start":60}],"target_id":"method.nist.twoway","target_kind":"node","target_sha256":"fa083f7815267df1b236183346a11fc5af13e1c6e1a480d9da0d30164418d84c"}],"method.nist.twowaymrgsrt":[{"id":"assertion.method.nist.twowaymrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-way merge sort as: A k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It merges runs from the two streams into an output stream. It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","support":[{"end":483,"quote":"A\nk-way merge sort\nthat sorts a data stream using repeated merges.  It distributes the input into two streams by repeatedly reading a\nblock\nof input that fits in memory, a\nrun\n, sorting it, then writing it to the next stream.  It merges runs from the two streams into an output stream.  It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","source_id":"nist-dads.twowaymrgsrt","source_sha256":"3db11fc076116faf508c8a4c0cad6e00c43f090be11f9f2bafa1ed260271e0ca","start":62}],"target_id":"method.nist.twowaymrgsrt","target_kind":"node","target_sha256":"720a6617d55cdbbae898d61e7c6b14090ab487b187683d8a48b8b8497265c87f"}],"method.nist.unbiasedcoinflipalgo":[{"id":"assertion.method.nist.unbiasedcoinflipalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unbiased coin flipping algorithm as: To get unbiased random bits, flip a coin twice. If it comes up heads then tails, the result bit is 1. It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","support":[{"end":294,"quote":"To get unbiased random bits, flip a coin twice.  If it comes up heads then tails, the result bit is 1.  It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","source_id":"nist-dads.unbiasedcoinflipalgo","source_sha256":"dc07b535a46c96ee03a273f4218ecc332788754685e2798c8cb6958f90e9ec8d","start":90}],"target_id":"method.nist.unbiasedcoinflipalgo","target_kind":"node","target_sha256":"a5612343f367144a617328a355f9611d3cf2c3c85c8ee1c2d547647eee0ebe47"}],"method.nist.uniformhashn":[{"id":"assertion.method.nist.uniformhashn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform hashing as: A conceptual method of open addressing for a hash table . A collision is resolved by putting the item in the next empty place given by a probe sequence which is independent of sequences for all other key .","support":[{"end":261,"quote":"A conceptual method of\nopen addressing\nfor a\nhash table\n. A\ncollision\nis resolved by putting the item in the next empty place given by a\nprobe sequence\nwhich is independent of sequences for all other\nkey\n.","source_id":"nist-dads.uniformhashn","source_sha256":"9be915357107cb6d540d9d71984a908a948a37c41a248f34cade23aeb3ea9cff","start":56}],"target_id":"method.nist.uniformhashn","target_kind":"node","target_sha256":"4a8d238005b979a09064bce62aa449b0f7759066a52011fb3fa8ae3b6ac7127d"}],"method.nist.unionautoma":[{"id":"assertion.method.nist.unionautoma","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines union of automata as: Find an automaton that accepts everything which the automata accept individually.","support":[{"end":141,"quote":"Find an\nautomaton\nthat accepts everything which the automata accept individually.","source_id":"nist-dads.unionautoma","source_sha256":"678b9b04d08a3d506ada7f9cfe6c8fd78d5b9cb7a80c96e5bf24a2d001a7f115","start":60}],"target_id":"method.nist.unionautoma","target_kind":"node","target_sha256":"65c6f57ace665c8088e778670de05d20550a880dd07fe14af5d6237c0e52aea6"}],"method.nist.unrank":[{"id":"assertion.method.nist.unrank","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unranking as: Given a ranking, r, generate the r th permutation of n elements.","support":[{"end":108,"quote":"Given a ranking, r, generate the r\nth\npermutation\nof n elements.","source_id":"nist-dads.unrank","source_sha256":"031dcc89f7bdcd19b18b8cb8a43ea016391d8488709dd9068d458c48d34f228f","start":44}],"target_id":"method.nist.unrank","target_kind":"node","target_sha256":"b45485b49deb844b295edbee1f7e13379021c44a65abfd1b71796b5f80887291"}],"method.nist.unshufflsort":[{"id":"assertion.method.nist.unshufflsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines UnShuffle sort as: A distribution sort with two phases. In the first phase, the inputs are distributed among doubly-ended queues keeping the items in each queue ordered and creating a new queue when there is no place on an existing queue. The second phase is an ideal merge in which the item to be removed is determined by keeping the queues in a priority queue .","support":[{"end":400,"quote":"A\ndistribution sort\nwith two phases.  In the first phase, the inputs are distributed among\ndoubly-ended queues\nkeeping the items in each queue ordered and creating a new queue when there is no place on an existing queue.  The second phase is an\nideal merge\nin which the item to be removed is determined by keeping the queues in a\npriority queue\n.","source_id":"nist-dads.unshufflsort","source_sha256":"acd3bd7cde8feeda5fd19dd87fa5594224295a841b94ef727ba12c50d358bceb","start":54}],"target_id":"method.nist.unshufflsort","target_kind":"node","target_sha256":"56ac3d8b77ab0b6adcc77e1ed6d274ef279275779d52e2e19c2c0e883fc43114"}],"method.nist.viterbialgorithm":[{"id":"assertion.method.nist.viterbialgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Viterbi algorithm as: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.","support":[{"end":187,"quote":"An algorithm to compute the optimal (most likely) state sequence in a\nhidden Markov model\ngiven a sequence of observed outputs.","source_id":"nist-dads.viterbialgorithm","source_sha256":"d8cbd1dc410afd97de5f0e088648e556e6f18ceb9195988669f6cdb217917c30","start":60}],"target_id":"method.nist.viterbialgorithm","target_kind":"node","target_sha256":"286e10d66fb56868b4ebe2bdcd97228490d0be77ec6fbad105e316a1445725e5"}],"method.nist.vittersalgorithm":[{"id":"assertion.method.nist.vittersalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Vitter's algorithm as: An adaptive Huffman coding scheme. Typically this produces codings the same length as or shorter than static Huffman coding . In the worst case , this uses one more bit per codeword .","support":[{"end":246,"quote":"An\nadaptive Huffman coding\nscheme.  Typically this produces codings the same length as or shorter than static\nHuffman coding\n. In the\nworst case\n, this uses one more bit per\ncodeword\n.","source_id":"nist-dads.vittersalgorithm","source_sha256":"506e3bb9d62fea05a18057be5369ec4e58066a22e487aed62afa45290c796baa","start":62}],"target_id":"method.nist.vittersalgorithm","target_kind":"node","target_sha256":"e326ff0c06e1919785fca3d3c6b9c2cc8154d6c0d37bc0049ed092cf4b7f2feb"}],"method.nist.weakheapsort":[{"id":"assertion.method.nist.weakheapsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weak-heap sort as: A sort algorithm that builds a weak-heap , then repeatedly extracts the maximum item. In the worst case , the run time is O(n log n + 0.1 n) .","support":[{"end":197,"quote":"A\nsort\nalgorithm that builds a\nweak-heap\n, then repeatedly extracts the maximum item.  In the\nworst case\n, the run time is\nO(n log n + 0.1 n)\n.","source_id":"nist-dads.weakheapsort","source_sha256":"3af6a0bd4c69b5a20f4ba07c1496b9e19f99c601bfa573de68b8908690f57189","start":54}],"target_id":"method.nist.weakheapsort","target_kind":"node","target_sha256":"c7dd34004bc30c78ae716e3a309e89474585c46cbb51bd27e1a4b445ced8d0f8"}],"method.nist.zellerscongruence":[{"id":"assertion.method.nist.zellerscongruence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zeller's congruence as: An algorithm to find the day of the week for any date.","support":[{"end":118,"quote":"An algorithm to find the day of the week for any date.","source_id":"nist-dads.zellerscongruence","source_sha256":"a8ff2f6361f9fc90fe037cac4f7d782d09ea113445031b56b96e1e5961ad4f69","start":64}],"target_id":"method.nist.zellerscongruence","target_kind":"node","target_sha256":"17f1dec333c8e49cc61ab90a48346dd267a0386b2c20ab2c153bf45e4fd2175c"}],"method.nist.zhutakaoka":[{"id":"assertion.method.nist.zhutakaoka","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zhu-Takaoka as: A string matching algorithm that is a variant of the Boyer-Moore algorithm. It uses two consecutive text characters to compute the bad character shift. It is faster when the alphabet or pattern is small, but the skip table grows quickly, slowing the pre-processing phase.","support":[{"end":321,"quote":"A\nstring matching\nalgorithm that is a variant of the\nBoyer-Moore\nalgorithm.  It uses two consecutive text characters to compute the bad character shift.  It is faster when the\nalphabet\nor\npattern\nis small, but the skip table grows quickly, slowing the pre-processing phase.","source_id":"nist-dads.zhutakaoka","source_sha256":"456c2d18d0fdc15b0645114458ba6ea2e857b5581455df3db1770159d5d85b8e","start":48}],"target_id":"method.nist.zhutakaoka","target_kind":"node","target_sha256":"64f9c1797b69a551469b8bde3897f5d05e693dd25b2217f42275c58ce140026a"}],"method.single-graviton-quantum-sensing":[{"id":"assertion.complete.method.single-graviton-quantum-sensing","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Quantum sensing proposal for single-graviton exchange signatures.","support":[{"end":1443,"quote":"The quantization of gravity is widely believed to result in gravitons -- particles of discrete energy that form gravitational waves. But their detection has so far been considered impossible. Here we show that signatures of single graviton exchange can be observed in laboratory experiments. We show that stimulated and spontaneous single-graviton processes can become relevant for massive quantum acoustic resonators and that stimulated absorption can be resolved through continuous sensing of quantum jumps. We analyze the feasibility of observing the exchange of single energy quanta between matter and gravitational waves. Our results show that single graviton signatures are within reach of experiments. In analogy to the discovery of the photo-electric effect for photons, such signatures can provide the first experimental clue of the quantization of gravity.","source_id":"completion-source.c3fd2ff048f4ab5e51f1","source_sha256":"c9ed5d040eb702c4487c53daad529efbe4503831d59f32a671eef5d0622c3666","start":577}],"target_id":"method.single-graviton-quantum-sensing","target_kind":"node","target_sha256":"dee2ccabc8ab62cbe258423d7186a32506f0ced2199eb5df7a235f5843900dff"}],"ology.andrology":[{"id":"assertion.complete.ology.andrology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Andrology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Andrology as: A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include ENDOCRINOLOGY ; SPERMATOGENESIS ; SEMEN ANALYSIS ; FERTILIZATION ; CONTRACEPTION ; and CRYOPRESERVATION .","support":[{"end":658,"quote":"A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include\nENDOCRINOLOGY\n;\nSPERMATOGENESIS\n;\nSEMEN ANALYSIS\n;\nFERTILIZATION\n;\nCONTRACEPTION\n; and\nCRYOPRESERVATION\n.","source_id":"nlm-mesh.47e3bfae5378d264a4a6","source_sha256":"22342bde576af2b2e1957e6053513d34ef89a5ecdd8e2b6c1ece9549eb056c4a","start":376}],"target_id":"ology.andrology","target_kind":"node","target_sha256":"25cce35aa909d4643d5d6337cc92c2812c083fe99337438829a8d24093ccbe57"}],"ology.audiology":[{"id":"assertion.complete.ology.audiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Audiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Audiology as: Allied medical specialty that studies hearing and hearing impairment.","support":[{"end":621,"quote":"Allied medical specialty that studies hearing and hearing impairment.","source_id":"nlm-mesh.6358ed9b75543994a867","source_sha256":"de37eea7706082cb13ce02d449f3cfce2f81f68ec5614478ea938ee0d50fa169","start":552}],"target_id":"ology.audiology","target_kind":"node","target_sha256":"f5e1005bcfc5acabebb4c2e13a4cfd2521fb872db8c6a3e4dc87c89c95af3a97"}],"ology.bacteriology":[{"id":"assertion.complete.ology.bacteriology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Bacteriology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Bacteriology as: Study of the single celled microorganisms known as bacteria.","support":[{"end":175,"quote":"Study of the single celled microorganisms known as bacteria.","source_id":"usgs-thesaurus.2638b993d82a3ee7dc55","source_sha256":"41075a31d0022f6078d2ba23acc6938a22c25b02068229e9f84a148d55e59a91","start":115}],"target_id":"ology.bacteriology","target_kind":"node","target_sha256":"08505d08a880d153667e386326cbb42e84840783a5c1e33ddb498fd35a3d8eec"}],"ology.bionics":[{"id":"assertion.complete.ology.bionics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Bionics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Bionics as: The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","support":[{"end":686,"quote":"The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","source_id":"nlm-mesh.96b0d9c21edd54e642e5","source_sha256":"a5cbc5b5407db399a19754152d014205cf51a7bdc147b1be335b9f2af83a065b","start":431}],"target_id":"ology.bionics","target_kind":"node","target_sha256":"524d4fb49401a7fb0bd4f3dabc979edc27e96b28da1f8a22ffcc71f42ec429f1"}],"ology.biotechnology":[{"id":"assertion.complete.ology.biotechnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Biotechnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Biotechnology as: Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e., GENETIC ENGINEERING ) is a central focus; laboratory methods used include TRANSFECTION and CLONING technologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","support":[{"end":843,"quote":"Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e.,\nGENETIC ENGINEERING\n) is a central focus; laboratory methods used include\nTRANSFECTION\nand\nCLONING\ntechnologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","source_id":"nlm-mesh.e21655cf4050fe8a0ce0","source_sha256":"80ae877d7528421cbb32d5673363532f23c7d22ce6a412421360964cfcfd310a","start":354}],"target_id":"ology.biotechnology","target_kind":"node","target_sha256":"442b91a0eafad769a1d11554289222da29cb5cfb912bc53affbc81815ebe91f5"}],"ology.cardiology":[{"id":"assertion.complete.ology.cardiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cardiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cardiology as: The study of the heart, its physiology, and its functions.","support":[{"end":531,"quote":"The study of the heart, its physiology, and its functions.","source_id":"nlm-mesh.ef1675e27d8e1b53b18d","source_sha256":"9ea8d11ffbca78ff16ee1fa968e789b0eabc7801b76549e01e0472ad44f61082","start":473}],"target_id":"ology.cardiology","target_kind":"node","target_sha256":"9cbe277168de70924d219d2c4d87d3de8d0c71e0f033543bdaf439b4a6dd5eaf"}],"ology.cell-biology":[{"id":"assertion.complete.ology.cell-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Cell biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Cell biology as: Branch of biology that deals with the study of the formation, structure, and physiology of cells.","support":[{"end":197,"quote":"Branch of biology that deals with the study of the formation, structure, and physiology of cells.","source_id":"usgs-thesaurus.54dbaf6b936415d8d2d7","source_sha256":"520e14d2014bc32d3b2f734d0894a03fd90513e094684b8bcb701e1c1de5bd6f","start":100}],"target_id":"ology.cell-biology","target_kind":"node","target_sha256":"3fcb0df5a65aece58e35100576bb90a4dc3828e067028e749490e39a2f7d3161"}],"ology.cognitive-psychology":[{"id":"assertion.complete.ology.cognitive-psychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus; proposed information-domain grouping is additionally evidenced by explicit MeSH Cognitive Science ancestry and the retained parent scope including computer science; this is not a claim that all psychology is information science","population":"Cognitive psychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved; crosswalk from publisher vocabulary to this coarse domain is an explicit author proposal requiring independent review","units":null},"statement":"NLM MeSH describes Cognitive psychology as: Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","support":[{"end":662,"quote":"Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","source_id":"nlm-mesh.84e5e4de8f730357653e","source_sha256":"14391759697fb5917c72b647049e5986e43c819eda2513fab0ce1b8686f9211c","start":386},{"end":2431,"quote":"Cognitive Science [F04.096.628.255]\nCognitive Neuroscience [F04.096.628.255.500]\nCognitive Psychology [F04.096.628.255.750]","source_id":"nlm-mesh.84e5e4de8f730357653e","source_sha256":"14391759697fb5917c72b647049e5986e43c819eda2513fab0ce1b8686f9211c","start":2308},{"end":601,"quote":"The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.3afa87c4efa263dea007","source_sha256":"83d06c651636977640e1defba29a2d0d0dd301b3d5eaf03889e4055d2b8239a5","start":354}],"target_id":"ology.cognitive-psychology","target_kind":"node","target_sha256":"ba67628438901552cd9151e339ce500fb5674783676bfb19b67f4f08cde69d49"}],"ology.computational-biology":[{"id":"assertion.complete.ology.computational-biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Computational biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Computational biology as: A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","support":[{"end":787,"quote":"A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","source_id":"nlm-mesh.e55950fe926d0ebee0e8","source_sha256":"724c6eb576f6dc29c8f6259ec9bbc1cfad51d79c9824773c7400d95408892c3e","start":455}],"target_id":"ology.computational-biology","target_kind":"node","target_sha256":"0abacceb35edf023950293efb750c68307e07a60445110e796bec69f0768a494"}],"ology.criminology":[{"id":"assertion.complete.ology.criminology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Criminology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Criminology as: The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","support":[{"end":474,"quote":"The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","source_id":"nlm-mesh.49b6dba2f266b504ca82","source_sha256":"d9bd96d5c9df3f4f6bcd266aa15cf1f95245dc4bb833dbf355f3c14a39e2fd1b","start":334}],"target_id":"ology.criminology","target_kind":"node","target_sha256":"aa35cd8deb2d100aba44cb83fc9030d9e36245acee9c643f829816e553d612a8"}],"ology.cryobiology":[{"id":"assertion.complete.ology.cryobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cryobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cryobiology as: The study of biological materials or systems subjected to temperatures below their normal range.","support":[{"end":483,"quote":"The study of biological materials or systems subjected to temperatures below their normal range.","source_id":"nlm-mesh.946d44c7d4c966d8f70c","source_sha256":"05564a0c9eda9296af1d645f794653363278b3c62072433c04905d62f545d688","start":387}],"target_id":"ology.cryobiology","target_kind":"node","target_sha256":"6a005b631d723595926009c111889ebb3ad3b5d581f723a2fe294ea82cc5fcdb"}],"ology.cytology":[{"id":"assertion.complete.ology.cytology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cytology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cytology as: The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","support":[{"end":831,"quote":"The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","source_id":"nlm-mesh.0d50c20ba335a36532f3","source_sha256":"66c3fbb453fb979cef5c72e470db78949fabb38226d9ae7be41f1eda2578dbe0","start":648}],"target_id":"ology.cytology","target_kind":"node","target_sha256":"34a450f7303bd440d9df48ea315e2e94f63d849cc3dd7b860c1b9d3dd02d0e14"}],"ology.demography":[{"id":"assertion.complete.ology.demography","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Demography in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Demography as: Statistical interpretation and description of a population with reference to distribution, composition, or structure.","support":[{"end":579,"quote":"Statistical interpretation and description of a population with reference to distribution, composition, or structure.","source_id":"nlm-mesh.cf575eadb37c41446ec6","source_sha256":"fe5a8841d69fdae9ea3d031164acef874adedcbfa2d01597cd49ae8daaa1abc7","start":462}],"target_id":"ology.demography","target_kind":"node","target_sha256":"4260fb5c3eec093ce19d7587a3ac6711dc7bb7facc73d584d8c08a250c7aeca0"}],"ology.dermatology":[{"id":"assertion.complete.ology.dermatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Dermatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Dermatology as: A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","support":[{"end":433,"quote":"A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","source_id":"nlm-mesh.963851b0921eef8ae42d","source_sha256":"8dd4377b43c3a18b8d3bb7c791baa96afffc2220fed8de3f77b0f41ce6b2d42a","start":338}],"target_id":"ology.dermatology","target_kind":"node","target_sha256":"bc0d1600147e7a644c661d61eee7f08afa26a6aec6b02404cbd9df9d94a89ce9"}],"ology.developmental-biology":[{"id":"assertion.complete.ology.developmental-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Developmental biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Developmental biology as: Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","support":[{"end":256,"quote":"Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","source_id":"usgs-thesaurus.43c406756994e4d6a610","source_sha256":"9ee1607473b6c684efd223ebfc8c41b3045ad26cdddbf0acb650577faabcf512","start":118}],"target_id":"ology.developmental-biology","target_kind":"node","target_sha256":"9ecbfebf8e518aa4938756fe7f697836f9f3da7a1b5265ebbd61c97583fc0aa1"}],"ology.embryology":[{"id":"assertion.complete.ology.embryology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Embryology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Embryology as: The study of the development of an organism during the embryonic and fetal stages of life.","support":[{"end":607,"quote":"The study of the development of an organism during the embryonic and fetal stages of life.","source_id":"nlm-mesh.fe237ee68bf6ac2997f1","source_sha256":"1139c4e8952aec7cda0d7eacd8065a0e3b8dc94980599316c88f2ec88390524d","start":517}],"target_id":"ology.embryology","target_kind":"node","target_sha256":"09e2e469b621b47a6193b1377910592007a41724e47289a81d105e7df0116980"}],"ology.endocrinology":[{"id":"assertion.complete.ology.endocrinology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Endocrinology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Endocrinology as: Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","support":[{"end":262,"quote":"Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","source_id":"usgs-thesaurus.7fecd1d9d681f5519ebb","source_sha256":"75be4c7ca6f42af4b6d86a466ad0ddf7b3c5e3535d1714666dd51a1935df9d36","start":127},{"end":480,"quote":"A subspecialty of internal medicine concerned with the metabolism, physiology, and disorders of the\nENDOCRINE SYSTEM\n.","source_id":"completion-source.e90badae02d39b991a93","source_sha256":"8a771ad79863d843b424d5a908fbb55c1603ec23314e2b56af34520140edf2a1","start":362}],"target_id":"ology.endocrinology","target_kind":"node","target_sha256":"eca0771a252a3ba328a5240dbd55833b0a0dca4cfc30a8b4a7fe471cb73456fc"}],"ology.entomology":[{"id":"assertion.complete.ology.entomology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Entomology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Entomology as: Branch of zoology involved in studying insects.","support":[{"end":176,"quote":"Branch of zoology involved in studying insects.","source_id":"usgs-thesaurus.26d0f4a60626d67a41cf","source_sha256":"2fd467cf92662bdeb7328c600a9d318e5700b5c53156bc810045bdd906ee4013","start":129}],"target_id":"ology.entomology","target_kind":"node","target_sha256":"0cef0c2287b4ba7b2e403038af48db70cc4dd8190d7c78e5825d61bd8ef74838"}],"ology.ethnology":[{"id":"assertion.complete.ology.ethnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Ethnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Ethnology as: The comparative and theoretical study of culture, often synonymous with cultural anthropology.","support":[{"end":524,"quote":"The comparative and theoretical study of culture, often synonymous with cultural anthropology.","source_id":"nlm-mesh.3294b344080d4d981ed0","source_sha256":"8f002862cbb167ba4abf91d3c6f2301795cafbe8cf639b2fb8abb8b93efab8f3","start":430}],"target_id":"ology.ethnology","target_kind":"node","target_sha256":"2b060f4463e464c710f01a26aed6449febdc3b018268f6b106fc7c96e3f447f2"}],"ology.ethology":[{"id":"assertion.complete.ology.ethology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ethology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ethology as: Study of animal behavior under natural conditions","support":[{"end":151,"quote":"Study of animal behavior under natural conditions","source_id":"usgs-thesaurus.9375aebb8cb97e02bd6f","source_sha256":"1f80354cdb62f0f56d23c25a04917aeebbd940b81d538fc540e1bd2d5668fee9","start":102}],"target_id":"ology.ethology","target_kind":"node","target_sha256":"112406d6402c798f7d6564826b60d740c91a534eba82295ed7a6107ba7c0396c"}],"ology.gastroenterology":[{"id":"assertion.complete.ology.gastroenterology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Gastroenterology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Gastroenterology as: A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","support":[{"end":537,"quote":"A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","source_id":"nlm-mesh.b5b237de56e2aaaa3266","source_sha256":"1b19a2319ea18b96bb21c9025a3540490a8f9cd363f6cd0160cc155b72d55e05","start":352}],"target_id":"ology.gastroenterology","target_kind":"node","target_sha256":"95a1a50ec2508283db3ec75eb91ec0de3f342f090054ed2bdac23cff80337223"}],"ology.genomics":[{"id":"assertion.complete.ology.genomics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Genomics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Genomics as: The systematic study of the complete DNA sequences ( GENOME ) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in GENOME WIDE ASSOCIATION STUDIES .","support":[{"end":686,"quote":"The systematic study of the complete\nDNA\nsequences (\nGENOME\n) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in\nGENOME WIDE ASSOCIATION STUDIES\n.","source_id":"nlm-mesh.effd12a7827847f3b1ba","source_sha256":"b0aaffebed8abbbfc36294e85bd02f2fb99057beda75972447ff2779f750ea6d","start":415}],"target_id":"ology.genomics","target_kind":"node","target_sha256":"b7f74da014b7be8552d25e02dbebb391dd2af73e73203fd046bed8baeb677484"}],"ology.geochemistry":[{"id":"assertion.complete.ology.geochemistry","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geochemistry as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geochemistry as: Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","support":[{"end":254,"quote":"Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","source_id":"usgs-thesaurus.45717bf85fdd31a41c91","source_sha256":"09a511efa85e2e21b037b9ecc1f5befd3f57421dad6433b0068916db0623885f","start":101}],"target_id":"ology.geochemistry","target_kind":"node","target_sha256":"d15b6fcb7e4a8c32b1830938920103a5733acff9aee903efeb2650f8cd446eae"}],"ology.geochronology":[{"id":"assertion.complete.ology.geochronology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geochronology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.","support":[{"end":195,"quote":"Study of the age of the earth by dating geological formations, rocks, and fossils.","source_id":"usgs-thesaurus.9b9b9c2209b3540da35b","source_sha256":"e11321b2e85984746c01bea99870860b7a27d5ccbb12581742cf376d2633d2f8","start":113}],"target_id":"ology.geochronology","target_kind":"node","target_sha256":"40833547fe0850db8f64d7d78ca8d62a2215f19560c6fa94358a6a9b524173e6"}],"ology.geomorphology":[{"id":"assertion.complete.ology.geomorphology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geomorphology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geomorphology as: Branch of geology dealing with surface land features and the processes that create and change them.","support":[{"end":212,"quote":"Branch of geology dealing with surface land features and the processes that create and change them.","source_id":"usgs-thesaurus.ac143557ea12a17d3c6d","source_sha256":"6d4e08a53abcc0fa1150d278c5c354765dc6136556b32f4533bcaa052ec63916","start":113}],"target_id":"ology.geomorphology","target_kind":"node","target_sha256":"d68e4a0fdcec0c396c853bb14fc2deed980d59601fa5f2a68a356a319fd4c112"}],"ology.glaciology":[{"id":"assertion.complete.ology.glaciology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Glaciology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Glaciology as: Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","support":[{"end":206,"quote":"Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","source_id":"usgs-thesaurus.72927539f9b5c6155294","source_sha256":"94bf50bab9debece80993d9aa58a431a7458ec5ef6360334bb44ed7c7d9c515f","start":97}],"target_id":"ology.glaciology","target_kind":"node","target_sha256":"7a4b2fea9315cc6cd87b2dbc88717d4bd9ac4a8975f64a48d44e3ce6842e3e72"}],"ology.glycobiology":[{"id":"assertion.complete.ology.glycobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Glycobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Glycobiology as: The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","support":[{"end":505,"quote":"The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","source_id":"nlm-mesh.7bc5eafef50d053d5814","source_sha256":"567573316e3263c00c49ef5bc9e6926e579eb06079ce7ba72be4b0a208dcd1a6","start":350}],"target_id":"ology.glycobiology","target_kind":"node","target_sha256":"9c3abd13642cb2b0e4f0642735e784ae1a966078e063bd1588708307a7d1106e"}],"ology.gynecology":[{"id":"assertion.complete.ology.gynecology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Gynecology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Gynecology as: A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","support":[{"end":596,"quote":"A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","source_id":"nlm-mesh.2d51683a5c47ff65a4e9","source_sha256":"3ade9eba0ae8f11b5bdbd988e55e95b6d265cf256be14635e14af7a7f3bc1313","start":424}],"target_id":"ology.gynecology","target_kind":"node","target_sha256":"1ba84eac1e2c5556906ea4a4de9179556006bf1c728b67905cffd724bd63e781"}],"ology.hematology":[{"id":"assertion.complete.ology.hematology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Hematology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Hematology as: A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","support":[{"end":468,"quote":"A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","source_id":"nlm-mesh.44db89f7a8e212468382","source_sha256":"a39661d3ad758cf6a6569365760afc4c3db48d2f702d38d23e3040e9acdcbe57","start":340}],"target_id":"ology.hematology","target_kind":"node","target_sha256":"84dc9b8cefe6b1132a97914bf17b9d81e5a22953a468492ec09f0c4e4f0278e4"}],"ology.herpetology":[{"id":"assertion.complete.ology.herpetology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Herpetology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Herpetology as: Branch of zoology concerned with the study of reptiles and amphibians.","support":[{"end":199,"quote":"Branch of zoology concerned with the study of reptiles and amphibians.","source_id":"usgs-thesaurus.7a6a2965ad207743d814","source_sha256":"919a91962c4fc7f727eb5111f68a8c5ba888fc48a8ff6af3413686a2c8de7df6","start":129}],"target_id":"ology.herpetology","target_kind":"node","target_sha256":"4475fa4260914066e5c62d178e9f1e638a9a5d79fa05a57073ce2e8da6278f3d"}],"ology.histology":[{"id":"assertion.complete.ology.histology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Histology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Histology as: Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","support":[{"end":205,"quote":"Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","source_id":"usgs-thesaurus.6b30b2d3f6402ab23f69","source_sha256":"876165b8c9834aefa3ff81283eed0d18b8d006ee98a523c2a5967abb973cd50c","start":119}],"target_id":"ology.histology","target_kind":"node","target_sha256":"14ffe6b44a81fa11dcab2ce977aec252af1c66d6e73d41e462ab77410db8be50"}],"ology.hydrogeology":[{"id":"assertion.complete.ology.hydrogeology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Hydrogeology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Hydrogeology as: Study of subsurface waters and geologic aspects of surface waters.","support":[{"end":177,"quote":"Study of subsurface waters and geologic aspects of surface waters.","source_id":"usgs-thesaurus.ce8e9bd3a3dd978ad873","source_sha256":"37c2f07c7414b104b53197d8582f966282b4e8b60b25f129380c0f3a6eedbc26","start":111}],"target_id":"ology.hydrogeology","target_kind":"node","target_sha256":"0e587437dade2d7275288bb1deeff29578bf16e8663d303fec137fe3f2dbe3a3"}],"ology.hydrology":[{"id":"assertion.complete.ology.hydrology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Hydrology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","support":[{"end":219,"quote":"Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","source_id":"usgs-thesaurus.7691e5829ecd899aeb75","source_sha256":"84e4a77fd1f639c254e332f2ce48795daafe22a691731d09bb64d303bc724dfa","start":95}],"target_id":"ology.hydrology","target_kind":"node","target_sha256":"0510ad057853f0b278867b84f65f6df8711badc8e0e291b4ebdb9dc68affbc3b"}],"ology.ichthyology":[{"id":"assertion.complete.ology.ichthyology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ichthyology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ichthyology as: Branch of zoology concerned with the study of fish.","support":[{"end":180,"quote":"Branch of zoology concerned with the study of fish.","source_id":"usgs-thesaurus.fc3a1187d897acbd35b3","source_sha256":"cdeee23755d5cfe8bf46ee409b13eeaa3e6ce97a695e98a5879d497b7e254066","start":129}],"target_id":"ology.ichthyology","target_kind":"node","target_sha256":"943df569b50b60040c9af0abe782e543c5abf776880eb9693374b4cd5a17f567"}],"ology.immunology":[{"id":"assertion.complete.ology.immunology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Immunology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Immunology as: Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","support":[{"end":277,"quote":"Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","source_id":"usgs-thesaurus.1e207764c4dcaddcfa3f","source_sha256":"4acff4859b80a983cfd8e2d1eab25a5383412d50d1e7c16429ce7122ab9502d4","start":121}],"target_id":"ology.immunology","target_kind":"node","target_sha256":"1a661c7ea75e24af2e2ad29ae907c5715db52df6dee34115838f7b5392955959"}],"ology.limnology":[{"id":"assertion.complete.ology.limnology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Limnology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Limnology as: Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","support":[{"end":209,"quote":"Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","source_id":"usgs-thesaurus.2e19bcc18d8f8bb2cd4f","source_sha256":"a109fe1ec6d5c09b51369d9194ed6c4860f3bb5dfbbc208c7afb9eba23cfe90a","start":95}],"target_id":"ology.limnology","target_kind":"node","target_sha256":"19571154704b50d9ac324f7fdf9d68d9dd9e3396e9dc6ead877976c917f8d88b"}],"ology.mammalogy":[{"id":"assertion.complete.ology.mammalogy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mammalogy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mammalogy as: Branch of zoology concerned with the study of mammals.","support":[{"end":179,"quote":"Branch of zoology concerned with the study of mammals.","source_id":"usgs-thesaurus.371c76fcaf528fc15e5e","source_sha256":"6b8734fcae6ddd21220dede80f89accd9e35766c31c2dfae4a9f6041ffca76a8","start":125}],"target_id":"ology.mammalogy","target_kind":"node","target_sha256":"2267987070312ddf19030e8b9f2368e2422036c1dceb2db71ddd90bc44ed8ca4"}],"ology.marine-biology":[{"id":"assertion.complete.ology.marine-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Marine biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Marine biology as: Branch of biology concerned with the organisms and habitats of the seas and oceans.","support":[{"end":187,"quote":"Branch of biology concerned with the organisms and habitats of the seas and oceans.","source_id":"usgs-thesaurus.c06c39ee767c6bf57f75","source_sha256":"40514a937e9acbb59b4bca285f444b0df126c75565bff3a5c0883c4775a362ef","start":104}],"target_id":"ology.marine-biology","target_kind":"node","target_sha256":"e829709b1720c6e911f7c3109c7d6a0c0692a679a793db2b2eeb2fa423706137"}],"ology.meteorology":[{"id":"assertion.complete.ology.meteorology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Meteorology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","support":[{"end":289,"quote":"Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","source_id":"usgs-thesaurus.4c9d6896b889ce2b2e86","source_sha256":"a38a07d239077c0053d671d02b18a70019ad5b1bee7d8706f06da5ed4dd18298","start":122}],"target_id":"ology.meteorology","target_kind":"node","target_sha256":"72dc8f2c520b53ade0aec649b163ac5dba5c77a99f3d6b3710a6a5f0a380c1d0"}],"ology.mineralogy":[{"id":"assertion.complete.ology.mineralogy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mineralogy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","support":[{"end":212,"quote":"Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","source_id":"usgs-thesaurus.a5b24d28b9768fcf1686","source_sha256":"5147eb376f53be06a955dfa299dadadfc56340d32f71a143398798f9be453d52","start":107}],"target_id":"ology.mineralogy","target_kind":"node","target_sha256":"e46137b7ab9376acc53bf8f3ecfa32d3470078b1a90f67c27860b698576a3600"}],"ology.mycology":[{"id":"assertion.complete.ology.mycology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mycology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mycology as: Branch of biology concerned with the study of fungi.","support":[{"end":144,"quote":"Branch of biology concerned with the study of fungi.","source_id":"usgs-thesaurus.4cae14b1bd2e1d062020","source_sha256":"8b80f345736f8abd211dc2d602a4c2921f279f9e9d9e1150f4fd58b183f52f35","start":92}],"target_id":"ology.mycology","target_kind":"node","target_sha256":"e5307053c8070f0621be1292fee6cc611ead5b7aabf8459eef0512cc5cee27f7"}],"ology.nanotechnology":[{"id":"assertion.complete.ology.nanotechnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nanotechnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nanotechnology as: The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","support":[{"end":486,"quote":"The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","source_id":"nlm-mesh.81fd205e36d18b028764","source_sha256":"be4d8a80a39e64a7fd27e1e33e8a02c6042ce535b1c6541b1bd5f09d2b69af65","start":356}],"target_id":"ology.nanotechnology","target_kind":"node","target_sha256":"7dd516b638061c57e66dc30bbdbf49d9a6da3359ca82bd3c7ed5f1c4ba24d75a"}],"ology.neonatology":[{"id":"assertion.complete.ology.neonatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neonatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neonatology as: A subspecialty of Pediatrics concerned with the newborn infant.","support":[{"end":613,"quote":"A subspecialty of Pediatrics concerned with the newborn infant.","source_id":"nlm-mesh.8268ca3c835135b3e0de","source_sha256":"0da00c55c484715a52a1a24913f5c26552a42de4a3bf40d43654df830675f4a1","start":550}],"target_id":"ology.neonatology","target_kind":"node","target_sha256":"28777069c0ddae374101f309b187dd15d784a407cb2eef18311a2fe1cb741a55"}],"ology.nephrology":[{"id":"assertion.complete.ology.nephrology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nephrology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nephrology as: A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","support":[{"end":444,"quote":"A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","source_id":"nlm-mesh.afe32e7cd24512af6fea","source_sha256":"48d2a03dbd630a667e04a35aab16d0e042d5140210e0b7bba3b5104e4d2e24bc","start":340}],"target_id":"ology.nephrology","target_kind":"node","target_sha256":"0528e79a805deb37ea5bbdc29597e38dfbe2da713cec661e13e3b126c1ca9106"}],"ology.neurobiology":[{"id":"assertion.complete.ology.neurobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neurobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neurobiology as: The study of the structure, growth, activities, and functions of NEURONS and the NERVOUS SYSTEM .","support":[{"end":522,"quote":"The study of the structure, growth, activities, and functions of\nNEURONS\nand the\nNERVOUS SYSTEM\n.","source_id":"nlm-mesh.8d297a4fd89adab5fa15","source_sha256":"7f01610b43f095181d41084bfd36faa76dfa822f2f69c40bb59f6c246d67bebc","start":425}],"target_id":"ology.neurobiology","target_kind":"node","target_sha256":"ee8cab3e1925246b041a2f1ec525e18cb6f4b486ecc4b2e5545068b318a0958c"}],"ology.neurology":[{"id":"assertion.complete.ology.neurology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neurology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neurology as: A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","support":[{"end":444,"quote":"A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","source_id":"nlm-mesh.6ce32d2c745cf556384b","source_sha256":"65c543143829c6d8a5b348c92a25cefdd2133eede2bfd1c07cb833cd44331961","start":334}],"target_id":"ology.neurology","target_kind":"node","target_sha256":"bbbededad8e4e5563f1e46e62084163b3effdb36416e92732e9980fc56a3e120"}],"ology.neuropathology":[{"id":"assertion.complete.ology.neuropathology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neuropathology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neuropathology as: The branch of medicine and biomedical science concerned with diseases of the nervous system.","support":[{"end":549,"quote":"The branch of medicine and biomedical science concerned with diseases of the nervous system.","source_id":"nlm-mesh.b195e4fedf3aa920449b","source_sha256":"e978845e2de7fc678c8fa658b69e6be34d8a072ed2a9d8cff4eaad74f05a0ff8","start":457}],"target_id":"ology.neuropathology","target_kind":"node","target_sha256":"54fb095e2cdb26e72d359f82cb0a1835a708250b842e549c508386be37998f88"}],"ology.neuropsychology":[{"id":"assertion.complete.ology.neuropsychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neuropsychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neuropsychology as: A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","support":[{"end":742,"quote":"A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","source_id":"nlm-mesh.ef3566806174802f82a1","source_sha256":"c8268de56d93c71d93c273a8eea3b85bdaf556c91b745bb7a528cd5112bec0ad","start":448}],"target_id":"ology.neuropsychology","target_kind":"node","target_sha256":"0c84da63db927cac80a8d6af9e03d0956eb4610e64c4f0303309d304aebd8499"}],"ology.ophthalmology":[{"id":"assertion.complete.ology.ophthalmology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Ophthalmology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Ophthalmology as: A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","support":[{"end":487,"quote":"A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","source_id":"nlm-mesh.ef44f675a31fc40f56be","source_sha256":"9bc5b2232140d5e527220ea577b1eaf20c065046bd216096593869d015720e8d","start":346}],"target_id":"ology.ophthalmology","target_kind":"node","target_sha256":"a3d05aa071c5ea67e65357210a38087f6581cc39640aa160290647627ded54b8"}],"ology.ornithology":[{"id":"assertion.complete.ology.ornithology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ornithology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ornithology as: Branch of biology concerned with the study of birds.","support":[{"end":181,"quote":"Branch of biology concerned with the study of birds.","source_id":"usgs-thesaurus.45d1b09cab533d0d8add","source_sha256":"d90e6af61e6a60b37c189753b2535d2ea1c843f1798707f7f55913e5778b625a","start":129}],"target_id":"ology.ornithology","target_kind":"node","target_sha256":"2e96bb1ee5f674805205cb323275b9ab8da428c4c86ec0186848ba86addf0a91"}],"ology.paleography":[{"id":"assertion.complete.ology.paleography","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Paleography in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Paleography as: The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","support":[{"end":589,"quote":"The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","source_id":"nlm-mesh.de31c6b64b58d9b44545","source_sha256":"dcc7dafe0b9f98075117d4cbfbd83f0e81f15e7d1ca9aca2f1f5e92ebb166bb7","start":414}],"target_id":"ology.paleography","target_kind":"node","target_sha256":"527bc0be89188a1d7e59c9151203c206b8695320264eb413a32dbc9c191fd6c9"}],"ology.paleontology":[{"id":"assertion.complete.ology.paleontology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Paleontology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Paleontology as: Study of life in past geologic time based on fossil plants and animals.","support":[{"end":172,"quote":"Study of life in past geologic time based on fossil plants and animals.","source_id":"usgs-thesaurus.2dcbaf2d1a595f7517e5","source_sha256":"949f27e6056d88039c41b36d440cb54c3d747d6fcbcf399f908e89272e212d14","start":101}],"target_id":"ology.paleontology","target_kind":"node","target_sha256":"7105275efd769ffffbeed8377227f3a5d8f5c3a2759af9831fd0d77bcb307fcf"}],"ology.parasitology":[{"id":"assertion.complete.ology.parasitology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Parasitology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Parasitology as: Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","support":[{"end":243,"quote":"Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","source_id":"usgs-thesaurus.50ce134a036f2d19ef0a","source_sha256":"e5a6efcae30794bb2221aa39ad2f737a29ebbf0d8535bef25664397e63aef733","start":100}],"target_id":"ology.parasitology","target_kind":"node","target_sha256":"5e4e9ef97ac7e39690a23a085679ef4ed9f2174f5c1ecb80b365975640afc341"}],"ology.pathology":[{"id":"assertion.complete.ology.pathology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Pathology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Pathology as: Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","support":[{"end":207,"quote":"Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","source_id":"usgs-thesaurus.e4b94d24f020cbbbfc43","source_sha256":"aa8edd82fcac3336290b170af26c4916f0fc562ee7db7913ded2e886b9feb68c","start":94}],"target_id":"ology.pathology","target_kind":"node","target_sha256":"d49dd23bfc5e63d2c1f956ea762a0605414d6ad2534969deb2399044c65b543f"}],"ology.petrology":[{"id":"assertion.complete.ology.petrology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Petrology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Petrology as: Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","support":[{"end":205,"quote":"Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","source_id":"usgs-thesaurus.c8966d506e18150be2fe","source_sha256":"77bcf2f32b615f4aa7b8e3261b9f257d86d31210b166c52bad154afda7568c70","start":105}],"target_id":"ology.petrology","target_kind":"node","target_sha256":"02eea409a1b06f54e6f758cc15803298979648385f39719aeb30bdbf3b509174"}],"ology.pharmacognosy":[{"id":"assertion.complete.ology.pharmacognosy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Pharmacognosy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Pharmacognosy as: The science of drugs prepared from natural-sources including preparations from PLANTS , animals, and other organisms as well as MINERALS and other substances included in MATERIA MEDICA . The therapeutic usage of plants is PHYTOTHERAPY .","support":[{"end":623,"quote":"The science of drugs prepared from natural-sources including preparations from\nPLANTS\n, animals, and other organisms as well as\nMINERALS\nand other substances included in\nMATERIA MEDICA\n. The therapeutic usage of plants is\nPHYTOTHERAPY\n.","source_id":"nlm-mesh.77137917b685045258f0","source_sha256":"2090bd85d37c8b26abf4cf358ebf5e3439e2c574bdfb2690d9f21ede03470ddb","start":387}],"target_id":"ology.pharmacognosy","target_kind":"node","target_sha256":"4877cb2e0800c9db880f7623e31b7e1a9d4b90d7329eecd09dd8c27db5874d84"}],"ology.pharmacology":[{"id":"assertion.complete.ology.pharmacology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Pharmacology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Pharmacology as: The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","support":[{"end":774,"quote":"The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","source_id":"nlm-mesh.72dc31200ed8c2a213c9","source_sha256":"4fe306e710b5a7aca6d3a88e55e7b5c153e139e868c143c6eb208073d208db02","start":670}],"target_id":"ology.pharmacology","target_kind":"node","target_sha256":"fc9eed1c9074e316f7a08eb9b96d640fac1b2eb4796e18ef464d55dcba04d09c"}],"ology.philology":[{"id":"assertion.complete.ology.philology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Philology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Philology as: The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","support":[{"end":809,"quote":"The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","source_id":"nlm-mesh.7bf6c0775e9e1bc14a38","source_sha256":"370031fef7c48721e497c2bb5cb4d7fcbbffbeeb5c86d15a5a736dbd274ae76c","start":490}],"target_id":"ology.philology","target_kind":"node","target_sha256":"285dd10af71f8ddb915ee0872801e27f3c1e22b8d526f4c85d61270da781b16d"}],"ology.photobiology":[{"id":"assertion.complete.ology.photobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Photobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Photobiology as: The branch of biology dealing with the effect of light on organisms.","support":[{"end":595,"quote":"The branch of biology dealing with the effect of light on organisms.","source_id":"nlm-mesh.99640cd221760e32fc9e","source_sha256":"de3f313a4810757be8af6d5ec2dcb3e798b4aac50d2b3b24e49000dce3943403","start":527}],"target_id":"ology.photobiology","target_kind":"node","target_sha256":"84396d38a943bb1273c40f9321866db85dba70edbb76e5b22a4f5f23e10aa687"}],"ology.phycology":[{"id":"assertion.complete.ology.phycology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Phycology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Phycology as: Branch of biology concerned with the study of algae.","support":[{"end":155,"quote":"Branch of biology concerned with the study of algae.","source_id":"usgs-thesaurus.9a880c55f1553c1253d9","source_sha256":"c0bdbf4b3493c965bdd7acac66a834e774bea42308155a6debf9dbe8b26e90d8","start":103}],"target_id":"ology.phycology","target_kind":"node","target_sha256":"6a4614dbff1b83453158dd95ce1537c508ff78635d7c2f9360de24d2306a8045"}],"ology.physiology":[{"id":"assertion.complete.ology.physiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Physiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Physiology as: The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","support":[{"end":741,"quote":"The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","source_id":"nlm-mesh.c63837a70e6aa338de39","source_sha256":"9136e9847dbf199caeabe3f14726c38ea8cc040d3ce39f3404c0ebd45c2ac678","start":611}],"target_id":"ology.physiology","target_kind":"node","target_sha256":"94c884ce89614df3a3b7b32fea4de2c072e461a0923096888cabcd80604f5a02"}],"ology.proteomics":[{"id":"assertion.complete.ology.proteomics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Proteomics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Proteomics as: The systematic study of the complete complement of proteins ( PROTEOME ) of organisms.","support":[{"end":490,"quote":"The systematic study of the complete complement of proteins (\nPROTEOME\n) of organisms.","source_id":"nlm-mesh.55c7bf5248c252ae0c2b","source_sha256":"b0865ad783fdc6fac5b91e6ceb2af08cc66dd35887daefe9a3ad296a17d8cfcd","start":404}],"target_id":"ology.proteomics","target_kind":"node","target_sha256":"1b0becbe499550f912836a52476ac4a6b181c56b2103f8b0fc26c55663475b19"}],"ology.psycholinguistics":[{"id":"assertion.complete.ology.psycholinguistics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psycholinguistics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psycholinguistics as: A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","support":[{"end":724,"quote":"A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","source_id":"nlm-mesh.14af6d0afad21004276f","source_sha256":"37a49119f24ad947a32d820cd08f29da49ff41b772e1ebc7d4ccead01d44e7f6","start":446}],"target_id":"ology.psycholinguistics","target_kind":"node","target_sha256":"2ad8b04cb6c9b30ef0babf3dee9ca0c8d52f02fd004f349af6578f196f6b868c"}],"ology.psychopathology":[{"id":"assertion.complete.ology.psychopathology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychopathology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.","support":[{"end":517,"quote":"The study of significant causes and processes in the development of mental illness.","source_id":"nlm-mesh.cfcfe0e017d161687831","source_sha256":"c6d8dfe37473fdf2dd2d9f021f5fa8805609e7a3e56917dac21907c552804fd2","start":434}],"target_id":"ology.psychopathology","target_kind":"node","target_sha256":"12e51f31c4e488f0f064ea37f72dbcc183d60c37af0c244d302d775b3bda1322"}],"ology.psychopharmacology":[{"id":"assertion.complete.ology.psychopharmacology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychopharmacology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychopharmacology as: The study of the effects of drugs on mental and behavioral activity.","support":[{"end":510,"quote":"The study of the effects of drugs on mental and behavioral activity.","source_id":"nlm-mesh.aac03d67dea48e69ae86","source_sha256":"1745c9274aa43d0ca740964456c2336dbc89a801be973e2ac56fb07d9dd7d6d5","start":442}],"target_id":"ology.psychopharmacology","target_kind":"node","target_sha256":"25ef3be151777e64df1139860bd58c8efc48a8ba318599cb8d1e86c8b657a5c4"}],"ology.radiobiology":[{"id":"assertion.complete.ology.radiobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Radiobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Radiobiology as: Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","support":[{"end":552,"quote":"Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","source_id":"nlm-mesh.4614a1a23cf1eb79c224","source_sha256":"fefb27d6245ef7b14d67ace47f59bf2b7deb76a6db8798697d110bfa51406d75","start":365}],"target_id":"ology.radiobiology","target_kind":"node","target_sha256":"9c7508d05b85d1d06d9c4d5b94523968d986135e59d48bc78f0208cf1a49c577"}],"ology.radiology":[{"id":"assertion.complete.ology.radiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Radiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Radiology as: A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","support":[{"end":530,"quote":"A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","source_id":"nlm-mesh.e9897a03354d6948a211","source_sha256":"f91d24ebaeb0feee49476546c2654a978f760d4ab66c80598f78c088c682cbde","start":410}],"target_id":"ology.radiology","target_kind":"node","target_sha256":"fb3528a6b942c684299f525a81ccf698c8bb576a5870a63bf9ce06963763456d"}],"ology.rheology":[{"id":"assertion.complete.ology.rheology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Rheology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Rheology as: The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and VISCOSITY .","support":[{"end":690,"quote":"The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and\nVISCOSITY\n.","source_id":"nlm-mesh.672caf2b40c74990f490","source_sha256":"dc5b5dc6c05bc74829e3ecda574a3470b0a2c07c67f68688223744d4e1f1c095","start":464}],"target_id":"ology.rheology","target_kind":"node","target_sha256":"20b85e09d8b02ac30db5d946159eb94f98fb72d5e5dfb242a9780c2f90d95b20"}],"ology.rheumatology":[{"id":"assertion.complete.ology.rheumatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Rheumatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Rheumatology as: A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","support":[{"end":580,"quote":"A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","source_id":"nlm-mesh.137dd360907a3740cb66","source_sha256":"37f2c34552935ac4e09708125570c9db40db11e58cba1c07105cb37783b52b39","start":344}],"target_id":"ology.rheumatology","target_kind":"node","target_sha256":"573a72037766e70271c8ef48835d388ab4e33bf5634fe59155b3c46a16f472a8"}],"ology.sedimentology":[{"id":"assertion.complete.ology.sedimentology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Sedimentology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","support":[{"end":260,"quote":"Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","source_id":"usgs-thesaurus.fd7a87508131b4ecaf86","source_sha256":"fb25dd7484399e9129448983d292216b44627a7227e39e6935ec287e9fc3ac0e","start":113}],"target_id":"ology.sedimentology","target_kind":"node","target_sha256":"416871d608b7288836f6fc250e588c233b12356198fc29ec17361567affc1207"}],"ology.seismology":[{"id":"assertion.complete.ology.seismology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Seismology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","support":[{"end":205,"quote":"Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","source_id":"usgs-thesaurus.762a1e9db52aec2a89a0","source_sha256":"64678ea7c99a3b5f49dc438de2eaed5619ea5edf5fdc9a76db89b79681911e46","start":110}],"target_id":"ology.seismology","target_kind":"node","target_sha256":"cd7466044cdccb23fed139dbaa87959d38412e458b1b24fb75f5a52c24ae2019"}],"ology.serology":[{"id":"assertion.complete.ology.serology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Serology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Serology as: The study of serum, especially of antigen-antibody reactions in vitro.","support":[{"end":445,"quote":"The study of serum, especially of antigen-antibody reactions in vitro.","source_id":"nlm-mesh.33ea8d12d5d7f3a0a806","source_sha256":"66c364a7b3e01d56583ce9760ae72f62c2fb21ef603234b673556fb2bcd865de","start":375}],"target_id":"ology.serology","target_kind":"node","target_sha256":"8a03d7ccb91051ab15cea81277f0544ca0607c9b353bdd88d191674b6981b667"}],"ology.sexology":[{"id":"assertion.complete.ology.sexology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sexology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sexology as: This discipline concerns the study of SEXUALITY , and the application of sexual knowledge such as sexual attitudes, psychology, and SEXUAL BEHAVIOR . Scope of application generally includes educational ( SEX EDUCATION ), clinical ( SEX COUNSELING ), and other settings.","support":[{"end":601,"quote":"This discipline concerns the study of\nSEXUALITY\n, and the application of sexual knowledge such as sexual attitudes, psychology, and\nSEXUAL BEHAVIOR\n. Scope of application generally includes educational (\nSEX EDUCATION\n), clinical (\nSEX COUNSELING\n), and other settings.","source_id":"nlm-mesh.e1b8584f6a96cec5e422","source_sha256":"682a7f691c4074f5fe97f4d1ec1d1abd5a1ae4c79c4a19db6018d913d4561133","start":332}],"target_id":"ology.sexology","target_kind":"node","target_sha256":"86899ab14e7aaab1a641d24759f5d394c26c5ce26aaaf5487f3f45ff43f629a8"}],"ology.sociobiology":[{"id":"assertion.complete.ology.sociobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sociobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sociobiology as: The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":550,"quote":"The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.0390edf50d0d577e17eb","source_sha256":"1ce2e21abf91fff83ecfa8ef5a613afc4dccefd63a8595a0a1b0e560809a5cc5","start":356}],"target_id":"ology.sociobiology","target_kind":"node","target_sha256":"b55919d2940819ac372979e44bb7afc99e9ee0b06c20652eb75c1a35a187947e"}],"ology.stratigraphy":[{"id":"assertion.complete.ology.stratigraphy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Stratigraphy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","support":[{"end":248,"quote":"Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","source_id":"usgs-thesaurus.d2e306d9307aced4b202","source_sha256":"aef62888af7262deb597388f1f6a810dd60c7bd118f6a093bbaec6c8503a42ba","start":111}],"target_id":"ology.stratigraphy","target_kind":"node","target_sha256":"7292cdd5d9b38f1675cef84e2410d1b41e978096a2de9d074ddc43e1c7485125"}],"ology.tectonophysics":[{"id":"assertion.complete.ology.tectonophysics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Tectonophysics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Tectonophysics as: Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","support":[{"end":245,"quote":"Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","source_id":"usgs-thesaurus.969a1d445933c65b567f","source_sha256":"3534dbbc8c20e3fc18f96816cd8567f14238c501d1ca89f068c8955246189eb7","start":118}],"target_id":"ology.tectonophysics","target_kind":"node","target_sha256":"a36ecd9e339e4e4a2290d0103136f45bd6aae743bb7113ae4726721f412a9a93"}],"ology.teratology":[{"id":"assertion.complete.ology.teratology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Teratology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Teratology as: A branch of embryology for the study of congenital malformations and developmental abnormalities.","support":[{"end":672,"quote":"A branch of embryology for the study of congenital malformations and developmental abnormalities.","source_id":"nlm-mesh.60ac9995c95fb563be08","source_sha256":"39cb891d4dd60b97f56ca1912e1a995c7d11479552b4fb434b9202a48d8a7208","start":575}],"target_id":"ology.teratology","target_kind":"node","target_sha256":"41c9b9c04a5334049ac5e4172c5cb0611b7474a82c1fa1dbc263bbe4b28a0cf2"}],"ology.thanatology":[{"id":"assertion.complete.ology.thanatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Thanatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Thanatology as: The study of the theory, philosophy, and doctrine of death.","support":[{"end":515,"quote":"The study of the theory, philosophy, and doctrine of death.","source_id":"nlm-mesh.8e3f51354957e235535b","source_sha256":"55eefcbdab555398d5f6f215f2fec8a26eb942902dbf533aecf670eefb22d266","start":456}],"target_id":"ology.thanatology","target_kind":"node","target_sha256":"5b7bf04c0a36ad26322df7ba14572d1de361429b7604a98b3387b5172fd28475"}],"ology.theology":[{"id":"assertion.complete.ology.theology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Theology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Theology as: The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","support":[{"end":554,"quote":"The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","source_id":"nlm-mesh.0e8764007d2f3f2a9f63","source_sha256":"4207b2c1044a134c5d6bd16883193178a0c9e984752a4f631b7f9c1b7d5739fd","start":332}],"target_id":"ology.theology","target_kind":"node","target_sha256":"8e8cae30c18d625c664d31c6d74a42eadfdc94b89b56dc759df0611660d63731"}],"ology.toxicology":[{"id":"assertion.complete.ology.toxicology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Toxicology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Toxicology as: The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","support":[{"end":697,"quote":"The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","source_id":"nlm-mesh.c5eb56bf612a44ac8d8a","source_sha256":"88daf97e6e3260694b9eae5fae82d6498558874eb2bcd3a5b9120035e7d274db","start":523}],"target_id":"ology.toxicology","target_kind":"node","target_sha256":"3c817687b7fcdd14c6cf152229d0fdb829bfa3364a22f7e4391a0313923990de"}],"ology.traumatology":[{"id":"assertion.complete.ology.traumatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Traumatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Traumatology as: The medical specialty which deals with WOUNDS and INJURIES as well as resulting disability and disorders from physical traumas.","support":[{"end":563,"quote":"The medical specialty which deals with\nWOUNDS\nand\nINJURIES\nas well as resulting disability and disorders from physical traumas.","source_id":"nlm-mesh.8ae339a83d3cf2750aee","source_sha256":"b27d583409e1e64050f47b5af7f2b69af61e6ec9d8853bf75c0d6546b069df3a","start":436}],"target_id":"ology.traumatology","target_kind":"node","target_sha256":"36aaebfe35e49b8f4e195301846ae7d1ca4f91d827593887afe353e39dd49791"}],"ology.urology":[{"id":"assertion.complete.ology.urology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Urology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Urology as: A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction, URINARY INCONTINENCE , infections, and UROGENITAL NEOPLASMS .","support":[{"end":627,"quote":"A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction,\nURINARY INCONTINENCE\n, infections, and\nUROGENITAL NEOPLASMS\n.","source_id":"nlm-mesh.0c9c3700d764125cf02e","source_sha256":"2a0139ccfdc92197e4522bd44f553ae830da7f3685530df94732836de2d997b4","start":355}],"target_id":"ology.urology","target_kind":"node","target_sha256":"9e148b6ded02342a3be6efc589e4d58bd90d2895a0ad2debce791c5aab8ee290"}],"ology.virology":[{"id":"assertion.complete.ology.virology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Virology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Virology as: Branch of biology dealing with viruses and viral diseases.","support":[{"end":165,"quote":"Branch of biology dealing with viruses and viral diseases.","source_id":"usgs-thesaurus.bf9e37c0e60da0feaec7","source_sha256":"1427435511d28f6ebd0ea76877af6d5e7213609328775849004c0f7496de5776","start":107}],"target_id":"ology.virology","target_kind":"node","target_sha256":"ff5f6543b65f4f27f994c7d4bec5aa35b99185d1daa5714ec2b39e1d17b0c0c0"}],"ology.volcanology":[{"id":"assertion.complete.ology.volcanology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Volcanology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Volcanology as: The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","support":[{"end":249,"quote":"The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","source_id":"usgs-thesaurus.cfccf058f7b98949dc69","source_sha256":"52d0e5427dd7d4b41ef435c127dea3e0a89829ed29198cfd37b3e0679bd33e28","start":109}],"target_id":"ology.volcanology","target_kind":"node","target_sha256":"8c30b4b1ba7a18e86bbf67814e21ce84971d921e8849bb758dc550b37bc4bcd3"}],"ology.zoology":[{"id":"assertion.complete.ology.zoology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Zoology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Zoology as: Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","support":[{"end":211,"quote":"Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","source_id":"usgs-thesaurus.2e13d5f63b99994c4e0c","source_sha256":"12025245b9eae078cb15ded0a48e6476a3c765ec08bbe6511feb430e969eb7ff","start":90}],"target_id":"ology.zoology","target_kind":"node","target_sha256":"79506e97965b7d07250c79462d106f24d5ee7a6b9f34d1b9aa8087bbbd42fa50"}],"paper.bose-spin-entanglement-witness-2017":[{"id":"assert.paper.bose-spin-entanglement-witness-2017.rev3","scope":{"assumptions":"The proposal is based on the authors' stated principle that two objects cannot be entangled without a quantum mediator and on the experimental conditions described in the retained abstract.","population":"Two micron-size test masses in adjacent matter-wave interferometers, with one embedded spin in each test mass, as described in the proposal.","quantifiers":"Restricted to the particular proposed test and spin-correlation witness described in the retained source.","time":"The retained source was submitted on 19 Jul 2017; atlas chronology remains unresolved under era=undated.","uncertainty":"This records a proposal reported by the source. It does not assert that the experiment was performed, that gravity was experimentally demonstrated to be quantum, or that the proposal establishes current frontier status.","units":"Micron size is qualitative in the retained abstract; no numerical mass or precision is asserted."},"statement":"Bose and coauthors reported a proposal for a laboratory test in which gravitational interaction between two micron-size test masses could entangle them, with correlations between one embedded spin in each test mass proposed as the entanglement witness.","support":[{"end":288,"quote":"Title:\nA Spin Entanglement Witness for Quantum Gravity","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":234},{"end":233,"quote":"[Submitted on 19 Jul 2017]","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":207},{"end":1616,"quote":"Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":991},{"end":1925,"quote":"Subjects:\nQuantum Physics (quant-ph)\n; General Relativity and Quantum Cosmology (gr-qc); High Energy Physics - Theory (hep-th)","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":1799}],"target_id":"paper.bose-spin-entanglement-witness-2017","target_kind":"node","target_sha256":"fb2e59dd9f68228e3e725be699fe961732955605ba1c339dc2aaed33d80cc8d7"}],"physical.balacuo-resistive-onset-1986":[{"id":"assertion.hts.01","scope":{"assumptions":["Annealing below 900 degrees C under reducing conditions"],"population":"Multiphase oxygen-deficient polycrystalline Ba-La-Cu-O; x=1 or 0.75, y>0","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1986","uncertainty":"Tentative resistive interpretation in the original abstract; no claim here of bulk Meissner confirmation.","units":{"resistivity_change":"orders of magnitude","temperature":"K"}},"statement":"Bednorz and Mueller reported an abrupt resistivity decrease of up to three orders of magnitude in multiphase, oxygen-deficient polycrystalline Ba-La-Cu-O samples, with the highest onset in the 30 K range and suppression at high current density; they described this as reminiscent of percolative superconductivity.","support":[{"end":1167,"quote":"Metallic, oxygen-deficient compounds in the Ba-La-Cu-O system, with the composition BaxLa5-xCu5O5(3-y) have been prepared in polycrystalline form. Samples with x=1 and 0.75, y>0, annealed below 900°C under reducing conditions, consist of three phases, one of them a perovskite-like mixed-valent copper compound. Upon cooling, the samples show a linear decrease in resistivity, then an approximately logarithmic increase, interpreted as a beginning of localization. Finally an abrupt decrease by up to three orders of magnitude occurs, reminiscent of the onset of percolative superconductivity. The highest onset temperature is observed in the 30 K range. It is markedly reduced by high current densities. Thus, it results partially from the percolative nature, bute possibly also from 2 D superconducting fluctuations of double perovskite layers of one of the phases present. © 1986 Springer-Verlag.","source_id":"source.bednorz-ibm-abstract","source_sha256":"c2fdd644df3b748c793b2a7c5e8bf5e5e91ccc988e004d6a364bae95906289ee","start":268}],"target_id":"physical.balacuo-resistive-onset-1986","target_kind":"node","target_sha256":"f02bb230a77807ae817f471a8b2f520b3ad3fa25c9bbcdcfab6d9d22d6711488"}],"physical.bzo-ybco-in-field-current-2004":[{"id":"assertion.hts.06","scope":{"assumptions":["Comparison accounts for film thickness; transport at 75.5 K; field parallel to c for field-dependence measurements"],"population":"Studied PLD YBCO films with BaZrO3 additions on single-crystal and buffered IBAD-MgO substrates","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2004","uncertainty":"Approximate, field-dependent improvements; not all temperatures, orientations, tape lengths, or REBCO formulations. Mechanistic attribution is the authors’ interpretation.","units":{"Jc_ratio":"dimensionless approximate factor","magnetic_field":"T","temperature":"K"}},"statement":"MacManus-Driscoll et al. reported that BaZrO3 additions to pulsed-laser-deposited YBCO films improved thickness-accounted in-field critical current densities by about 1.5–2 times over roughly 1–5 T and about 5 times at 7 T in the studied single-crystal and IBAD-MgO substrate samples; the transport study used 75.5 K and associated the enhancement with stronger vortex pinning.","support":[{"end":4280,"page":2,"quote":"We show that nano-particles of BaZrO3 grow heteroepitaxially within laser ablated\nYBCO films. These particles are easily incorporated in the films from the source target of\na ceramic BaZrO3/YBCO mixture. The particles lead to significant improvement in the\nin-field Jc (at 75.5K) in films both on single crystal substrates and on practical, buffered\nmetallic substrates.","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":3910},{"end":7557,"page":3,"quote":"The striking result of Figure 1 is the upwards shift in both normalised Jc and J                       c for the\nYBCO+BaZrO3 samples. Identical behaviours were observed for the two other samples\nmeasured on single crystal substrates (13 and 83).  Even though the YBCO+BaZrO3\nsamples of Figure 1 have slightly lower T              c’s than the pure ones, the in-field Jc’s  are\nimproved significantly. Hence, the BaZrO3 addition has clearly increased the\nirreversibility field. On both the single crystal and IBAD-MgO substrates, accounting for\nthe thickness differences between samples the Jc values are around a factor of 1.5-2\nhigher over a wide field range (~1-5T) and they increase to a factor of around 5 higher at\n7T. In ~1µm thick YBCO+BaZrO3 films on IBAD, J                        c’s remain in excess of 0.1MA.cm-2\nat 4.5T.","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":6724},{"end":7887,"page":3,"quote":"The inset of Figure 1 a shows the angular dependence of Jc measured in a field of 1T for\nthe samples on STO single crystal. A shift upwards in the relative height of the c-axis\nangular peak is observed for YBCO+BaZrO3 compared to the pure YBCO, indicative of\nstrong pinning defects along the c-axis in the YBCO+BaZrO3 film [17].","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":7559}],"target_id":"physical.bzo-ybco-in-field-current-2004","target_kind":"node","target_sha256":"dc2cb65158542d0dfdf329f86ed22e893fe3d30837767d23916d0ab5403d3a81"}],"physical.density-functional-theory":[{"id":"assertion.complete.physical.density-functional-theory","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Density functional theory in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Density functional theory as: A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","support":[{"end":668,"quote":"A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","source_id":"nlm-mesh.7ab391e314472715de34","source_sha256":"c14bea511894a5e34f38cec5010fa0f6bffd261ac43ad5a8c0108c5cee02b757","start":380}],"target_id":"physical.density-functional-theory","target_kind":"node","target_sha256":"2ebe201c4bfbb547b6b4f3e9386e194307971cb2bc4a96f538e0f8a3d6d91e5d"}],"physical.high-field-rebco-fusion-pathway":[{"id":"assertion.hts.12","scope":{"assumptions":["Prospective tokamak design; field on coil differs from field at plasma center"],"population":"High-field tokamak pathway and representative-scale stand-alone magnet qualification described by the authors","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2023 author preprint","uncertainty":"A proposal with a demonstrated magnet component; no plasma performance, net electricity, plant economics, neutron lifetime, or current 2026 frontier status is asserted.","units":{"magnetic_field":"T; distinguish coil peak and plasma center"}},"statement":"Hartwig et al. describe a proposed fusion pathway using REBCO superconducting toroidal-field coils above 20 T peak field on the coil, corresponding to 8–12 T in the plasma center. The model-coil program qualifies representative-scale magnet technology for this pathway; stand-alone magnet qualification is distinct from demonstrated fusion electricity generation.","support":[{"end":20892,"page":4,"quote":"mid-2010s [25]. Anchored in the record-setting plasma physics                      inherently scalable on rapid timescales. The second part would\nperformance  of  Alcator  C-Mod  in  2016           [26],  this  new  high-        undertake the scale-up of the conductor/coil technology into a\nfield  path  proposes  the  use  of  superconducting           TF   magnets        representative   scale   magnet,   or   “model   coil”,   that   would\nexceeding  20  T  peak  field-on-coil  (8         –  12  T  in  the  plasma        ultimately   qualify   the   design,   fabrication,   modeling,   and\ncenter) based on REBCO.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":20270},{"end":24565,"page":4,"quote":"model coils have historically played a critical role in advancing\nengineering-relevant   form   factor         remained     decades  in   the        superconducting  fusion  magnets,  confirming  the  arrival  of  a\nfuture, several theoretical papers emerged in the following few                    step-change in this key enabling technology.\nyears   that   examined   the   advantageous   physics,   cost,   and\ncomplexity implications of superconducting toroidal field coils                        IV. BRIEF REVIEW OF LARGE-SCALE  SUPERCONDUCTING\napproaching      20   T   [24   -25].   Only    relatively   recently     has                        FUSION MAGNET TEST PROGRAMS\nsufficiently  high performance REBCO coated conductor tape                            Superconducting   magnet   systems   for   fusion   embody\nbeen characterized and manufactured at the industrial volumes                      substantial scale, cost, schedule, complexity, and risk. From a\nand cost levels required to actually design and build large-scale                  physics   perspective,   the   design,   operation,   and   ultimately\nhigh-field fusion magnets [30].                                                    fusion performance of the machine is fundamentally set by the\n   An  important  engineering  study of  a  toroidal  field  (TF)                  magnetic  fields,  making  achievement  of  the  magnet  design\nmagnet with modern REBCO superconductor was carried out                            specifications imperative. From an engineering perspective, the\nin 2011 [31] as part of the conceptual design activities for the                   magnet   systems   are   heavily   integrated   into   the   device\nVULCAN tokamak [32]. The study was the first to highlight                          superstructure, making them difficult or impossible to replace\nsignificant advantages of high-field REBCO-based magnets for                       or  repair.  Thus,  while  advances  in  superconducting  magnet\ntokamaks,  including  feasible  TF  magnets  approaching  20  T                    technology can often bring transformational benefits to a fusion\npeak field-on-coil, an optimized operational temperature of 20                     machine, it is imperative that the technology be derisked  before\nK,  tolerance  of  large  nuclear  heating,  and  demountable  low-                being utilized in a fusion device. Therefore, the integration of\nresistance   joints.     Since   that   time,   several   physics   and            major  advances  in  superconducting  magnet  technology  has\nengineering  assessments        reinforcing  and  extending       the  scale,      historically    been    preceded    by    signficant    research    and\nschedule,  cost,  and  plasma-physics  advantages  of  high-field                  development programs on specially designed “model coils” that\nfusion  energy  powerplants        based  on  REBCO  magnets            have       achieve fusion device magnet relevant scale and performance\nbeen carried out for conventional aspect ratio tokamaks  [33],                     but  often  in  a  stand-alone  configuration  in  specialized  test\nspherical tokamaks       [34], and stellarators [35].                              facilities for efficiency.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":21262},{"end":2776,"page":1,"quote":"The SPARC Toroidal Field Model Coil (TFMC)                               of  sixteen REBCO stack           -in-plate style pancakes and twoij\nProgram      was  a  three-year       effort  between  2018  and  2021              termination  plates  inside  a  Nitronic-50  structural  case,\nthat developed novel Rare Earth Yttrium Barium Copper                               which  also  serves  as  a  pressure  vessel  for  the              cryogenic\nOxide  (REBCO)  superconduc               tor  technologies  and  then              coolant flowing through channels in the winding pack. To\nsuccessfully utilized these technologies to design, build, and                      execute the TFMC tests, a new magnet test facility was built\ntest a first-in-class, high-field (~20 T), representative-scale","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":1976}],"target_id":"physical.high-field-rebco-fusion-pathway","target_kind":"node","target_sha256":"50459204dcdae39f894ce9222ea898dac12016ded8c524db29f639e3baf502ac"}],"physical.nuclear-fission":[{"id":"assertion.complete.physical.nuclear-fission","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear fission in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear fission as: Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","support":[{"end":581,"quote":"Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","source_id":"nlm-mesh.318cd4bb9106898947d3","source_sha256":"a248b1d9541683897120e7d777f26227a26d6f3c83b242a2d22bd62caf759065","start":412}],"target_id":"physical.nuclear-fission","target_kind":"node","target_sha256":"1df0f0ef0a8556bd73bfbc19947d49f46a03672d8e60534cd6790ca1b28c77e5"}],"physical.nuclear-fusion":[{"id":"assertion.complete.physical.nuclear-fusion","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear fusion in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear fusion as: Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","support":[{"end":577,"quote":"Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","source_id":"nlm-mesh.544020cbe017717b1a9e","source_sha256":"44be36f97a12606c3649a50efb26f02ae84851170c8a1ecd8f7bd7625f23900e","start":411}],"target_id":"physical.nuclear-fusion","target_kind":"node","target_sha256":"b9c479170e6a02e34e35f870b2f162a0c3b7ec251f53038d86659a8599dfb224"}],"physical.nuclear-physics":[{"id":"assertion.complete.physical.nuclear-physics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear physics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear physics as: The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":612,"quote":"The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.07b63efcca979228caf2","source_sha256":"278df774aaee7727e14a1b72239682ca8d08e0c88665c99902c655d380547d14","start":411}],"target_id":"physical.nuclear-physics","target_kind":"node","target_sha256":"a5f4ac06f9d6bf538f6611c8a59afc24303b07eb09ba8cccd9a30c168d94bdfb"}],"physical.phonons":[{"id":"assertion.complete.physical.phonons","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Phonons in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Phonons as: Quanta of acoustic energy which move at the speed of sound.","support":[{"end":409,"quote":"Quanta of acoustic energy which move at the speed of sound.","source_id":"nlm-mesh.eec83cc55bf64504604d","source_sha256":"0d1456dadf7b7890cf29d0fb2d50673e011c768a69f8fc6dfb2136e1863f228d","start":350}],"target_id":"physical.phonons","target_kind":"node","target_sha256":"4dec729d6387641230f3a0586c2d8b65d13ec1df15199329742af9cbf510afe4"}],"physical.quantum-mechanics":[{"id":"assertion.complete.physical.quantum-mechanics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Quantum mechanics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Quantum mechanics as: The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","support":[{"end":570,"quote":"The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","source_id":"nlm-mesh.87b2a38d9d82c9b74732","source_sha256":"e4f4947e2a24b6f99592d2ef283d9c9eaae612652a2d139934cbce44846a2b40","start":364}],"target_id":"physical.quantum-mechanics","target_kind":"node","target_sha256":"00a0593abba6525a2d2cd9c96f587573831fba87f91c2166eae2631f80a93210"}],"physical.si-system":[{"id":"assertion.complete.physical.si-system","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"International System of Units in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes International System of Units as: A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","support":[{"end":853,"quote":"A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","source_id":"nlm-mesh.c66f441f7c1286f2be8b","source_sha256":"f260cba08ebb28abd8027f5405b328ff752f2cc51c3532402a7328ab61901ad8","start":468}],"target_id":"physical.si-system","target_kind":"node","target_sha256":"14b398a587b87b3d400a0bb9120dcf0226d353e471874b111c6e86dbca0808ca"}],"physical.superconductivity":[{"id":"assertion.complete.physical.superconductivity","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Superconductivity in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Superconductivity as: The ability of an element or metallic alloy to allow the passage of ELECTRONS without ELECTRICAL RESISTANCE and expel MAGNETIC FIELDS below a certain threshold temperature called superconducting transition temperature.","support":[{"end":578,"quote":"The ability of an element or metallic alloy to allow the passage of\nELECTRONS\nwithout\nELECTRICAL RESISTANCE\nand expel\nMAGNETIC FIELDS\nbelow a certain threshold temperature called superconducting transition temperature.","source_id":"nlm-mesh.ea1a6d368c155be3d8c0","source_sha256":"74d7c5731bddb0649e0d12ec03f350013c649c8453003008ec8bdb6280dad094","start":360}],"target_id":"physical.superconductivity","target_kind":"node","target_sha256":"c63d3cdf4aa8a008f4baef9402a661180d67908769dee9f0be19e845ee5634bd"}],"physical.tfmc-20-1t-demonstration":[{"id":"assertion.hts.09","scope":{"assumptions":["Terminal current is not individual tape current; peak conductor field is not plasma-axis field"],"population":"Representative-scale SPARC Toroidal Field Model Coil; conductor peak field and case stress","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"Reported program result; no net fusion gain, electrical generation, or reactor-duration operation is established.","units":{"Lorentz_loading":"kN/m","case_stress":"GPa (almost 1)","magnetic_field":"T (peak conductor field)","terminal_current":"kA"}},"statement":"Hartwig et al. reported TFMC reaching 20.1 T peak field on the conductor at 40.5 kA terminal current, with 815 kN/m Lorentz loading on the REBCO stacks and almost 1 GPa stress accommodated by the structural case.","support":[{"end":7880,"page":2,"quote":"REBCO magnet, achieving 20.1 T peak field-on-conductor                                                     I . INTRODUCTION\nwith  40.5 kA      of  terminal  current,  815  kN/m  of  Lorentz                             he   SPARC   Toroidal   Field   Model   Coil   (TFMC)\nloading  on  the  REBCO  stacks,  and  almost  1  GPa  of\nmechanical  stress      accommodated  by  the  structural  case.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":7486}],"target_id":"physical.tfmc-20-1t-demonstration","target_kind":"node","target_sha256":"9bd9644af3a10798adb9a033b9e92cca41b7db7db4b186e10bddf93f02d425a0"}],"physical.tfmc-open-circuit-quench-damage":[{"id":"assertion.hts.11","scope":{"assumptions":["Terminal current 31.5 kA; coil intentionally not optimized for quench resilience"],"population":"Intentional open-circuit quench of the TFMC","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"This failure mode does not invalidate the successful DC field test or show that all NINT designs fail; protection at reactor scale remains a separate engineering obligation.","units":{"terminal_current":"kA"}},"statement":"Hartwig et al. reported localized thermal damage following an intentional open-circuit TFMC quench at 31.5 kA terminal current. The TFMC was deliberately not optimized for quench resiliency, so this experiment assessed passive self-protection rather than demonstrating damage-free protection for fusion-scale NINT coils.","support":[{"end":10795,"page":2,"quote":"Finally,       the  feasibility  of    using    passive,  self-      new  superconducting  magnet  test  facility  was  established  at\nprotection against a quench in a fusion           -scale NI TF coil was          MIT  to  serve  as  the  proving  grounds  for  the  experimental\nexperimentally assessed. While the TFMC was intentionally                        demonstration    of    the    magnet.        The    test    facility    itself\nnot optimized for quench resiliency           – and suffered localized           incorporated  novel  advances  in  both  REBCO  and  cryogenic\nthermal damage in response to an intentional open-circuit                        technology to meet the technical and schedule requirements for\nquench at 31.5 kA terminal current            – the extensive data and           testing the magnet. The magnet and test facility, shown together\nvalidated models that it produced            represent a critical step           in Fig. 1, were combined in the fall of 2021 to carry out a series\ntowards this important objective.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":9737}],"target_id":"physical.tfmc-open-circuit-quench-damage","target_kind":"node","target_sha256":"b84a6d3b91eb4a45c9162ed21a95810eb73b21b56b847cf42c79827b9877fe41"}],"physical.ybco-grain-boundary-orientation-1988":[{"id":"assertion.hts.03","scope":{"assumptions":["Basal-plane grain misorientation is the varied parameter"],"population":"YBCO bicrystals; implication scoped to pure polycrystalline samples","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1988","uncertainty":"Author-institution abstract only; its incomplete chemical formula and malformed large-angle numerical ratio are not repaired or interpreted.","units":null},"statement":"Dimos et al. measured grain-boundary critical current densities as a function of basal-plane misorientation in YBCO bicrystals and concluded that strong texture both normal to and within the basal plane is important for very high critical currents in pure polycrystalline samples.","support":[{"end":932,"quote":"The critical current densities across grain boundaries have been measured as a function of misorientation angle in the basal plane of bicrystals of YBa2Cu3O7-. For small misorientation angles, the ratio of the grain-boundary critical current density to the bulk critical current density is roughly proportional to the inverse of the misorientation angle; for large angles, this ratio saturates to a value of about 150. These results imply that achieving a high degree of texture both normal to and within the basal plane is important for the obtaining of very high critical currents in pure polycrystalline samples. © 1988 The American Physical Society.","source_id":"source.dimos-ibm-abstract","source_sha256":"3eaa8518b7702787a3c8b9a2a9f95aba42cfa4f8be689bf422b0807165917120","start":279}],"target_id":"physical.ybco-grain-boundary-orientation-1988","target_kind":"node","target_sha256":"0a700081fbfc62706ba75fe66f789404804dc1080b15f7fbaa8f89dd3c48e251"}],"physical.ybco-tricrystal-half-flux-1994":[{"id":"assertion.hts.05","scope":{"assumptions":["Scanning superconducting quantum interference device microscopy at 4.2 K"],"population":"YBa2Cu3O7-delta rings with 0, 2, and 3 grain-boundary Josephson junctions","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1994","uncertainty":"Consistency with d-wave symmetry is retained; the experiment does not select a unique microscopic pairing interaction. Formula typography in the web abstract is not used to derive a new quantity.","units":{"flux":"half of a magnetic flux quantum","temperature":"K"}},"statement":"Tsuei et al. used scanning SQUID microscopy at 4.2 K to observe spontaneous half-flux-quantum magnetization in a YBa2Cu3O7-delta ring with three grain-boundary Josephson junctions, but not in the two-junction rings; the authors reported consistency with d-wave pairing symmetry.","support":[{"end":864,"quote":"We have used the concept of flux quantization in superconducting YBa2Cu3O7-δ rings with 0, 2, and 3 grain-boundary Josephson junctions to test the pairing symmetry in high-Tc superconductors. The magnetic flux threading these rings at 4.2 K is measured by employing a scanning superconducting quantum interference device microscope. Spontaneous magnetization of a half magnetic flux quantum, Φ02=h4e has been observed in the 3-junction ring, but not in the 2-junction rings. These results are consistent with d-wave pairing symmetry. © 1994 The American Physical Society.","source_id":"source.tsuei-ibm-abstract","source_sha256":"bf6401b58e54c1c872a40d5d9ce058e9820024b87c877034c7063e25496d221d","start":293}],"target_id":"physical.ybco-tricrystal-half-flux-1994","target_kind":"node","target_sha256":"2f2b081eb04a9b4284b879f49dc420d8c37a5342552b0e25257f2e279eeb94bf"}],"physical.ybcuo-80-93k-1987":[{"id":"assertion.hts.02","scope":{"assumptions":["Ambient pressure; liquid-nitrogen Dewar"],"population":"Mixed-phase Y-Ba-Cu-O compound system described in Wu et al.","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1987","uncertainty":"The machine-bound support is a secondary NASA catalogue summary, not a captured full paper; no single-phase composition or precise critical-field measurement is asserted.","units":{"temperature":"K"}},"statement":"NASA’s catalogue summary of Wu et al. reports a stable, reproducible superconductivity transition between 80 and 93 K in a mixed-phase Y-Ba-Cu-O compound system at ambient pressure, maintained in a liquid-nitrogen Dewar.","support":[{"end":906,"quote":"Superconductivity at 93 K in a new mixed-phase Y-Ba-Cu-O compound system at ambient pressure - NASA Technical Reports Server (NTRS)\nNTRS\nNTRS - NASA Technical Reports Server\nSearch\nmore_vert\nCollections\nAbout\nNews\nHelp\nLogin\nPress Enter or click the Search button to begin your search.\nBack to Results\nSuperconductivity at 93 K in a new mixed-phase Y-Ba-Cu-O compound system at ambient pressure\nA stable and reproducible superconductivity transition between 80 and 93 K has been achieved and maintained in a Y-Ba-Cu-O compound system at ambient pressure in a simple liquid-nitrogen Dewar. An upper critical field Hc2(0) estimate of between 80 and 180 T is obtained, and the paramagnetic limiting field at 0 K for a sample with a T(c) of about 90 K is 165 T. It is suggested that the lattice parameters, the valence ratio, and the sample treatments all play a role in achieving superconductivity above 77 K.","source_id":"source.wu-nasa-catalogue","source_sha256":"8d0e40bf57fc80eefb78075aae8ff7137a9ca6e53e8ef3a9ffa20e9e383cdb6a","start":0}],"target_id":"physical.ybcuo-80-93k-1987","target_kind":"node","target_sha256":"16a045ce8a0307e315a087d0408d2e32b07e299fd8f3b761774bba8062f68b53"}],"practice.agriculture":[{"id":"assertion.complete.practice.agriculture","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Agriculture as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Agriculture as: The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","support":[{"end":194,"quote":"The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","source_id":"usgs-thesaurus.8faa7636b7aa8527a5ab","source_sha256":"ef7e0a02eac5837139c50fb3de7c9be3c1b15b03a2bbc1e6318044a29e1b0b86","start":80}],"target_id":"practice.agriculture","target_kind":"node","target_sha256":"02a4558adf1711033c1fc0fa011e5cb3c8f84727fe8de0fc8aa3a06978bdbdf5"}],"question.wikipedia.abc-conjecture":[{"id":"assertion.question.wikipedia.abc-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abc conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abc conjecture\", CC BY-SA 4.0) states: The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","support":[{"end":274,"quote":"The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","source_id":"wikipedia.article.abc-conjecture","source_sha256":"62c68fec9d36ce263e1cae017c7ef34f0933b47e9c5b8a644e519e0362a52b7e","start":100}],"target_id":"question.wikipedia.abc-conjecture","target_kind":"node","target_sha256":"7d397ac889be584d1a3efcbc0f7cda84d7acc225fe3ef8f5a3f59e10dfac3102"}],"question.wikipedia.atiyah-jones-conjecture":[{"id":"assertion.question.wikipedia.atiyah-jones-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atiyah–Jones conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atiyah–Jones conjecture\", CC BY-SA 4.0) states: In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","support":[{"end":225,"quote":"In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","source_id":"wikipedia.article.atiyah-jones-conjecture","source_sha256":"a93dd07d0f8c2d6d8c1717d7ebd66c9570f3b9502fb59985de27958d659e91d9","start":111}],"target_id":"question.wikipedia.atiyah-jones-conjecture","target_kind":"node","target_sha256":"0802a0c103f465e1db66237ac8120de53d2b69e7d53bea3b43078b2e9ce83e51"}],"question.wikipedia.brauer-s-k-b-conjecture":[{"id":"assertion.question.wikipedia.brauer-s-k-b-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brauer's k(B) conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brauer's k(B) conjecture\", CC BY-SA 4.0) states: Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","support":[{"end":318,"quote":"Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","source_id":"wikipedia.article.brauer-s-k-b-conjecture","source_sha256":"46c2dcd737d17a61bea4b18e5f38c11ec1bf8867d470cc3a7cf2fa91ddec7cb4","start":112}],"target_id":"question.wikipedia.brauer-s-k-b-conjecture","target_kind":"node","target_sha256":"b79da461c6e63bbbbbe548afc5f377996ff70f4e5dba9acacdc2da1fbe171fc0"}],"question.wikipedia.catalan-s-conjecture":[{"id":"assertion.question.wikipedia.catalan-s-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catalan's conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catalan's conjecture\", CC BY-SA 4.0) states: Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","support":[{"end":318,"quote":"Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","source_id":"wikipedia.article.catalan-s-conjecture","source_sha256":"1b168c853ec6174cf03f7ad55c8e002f6afb09e1fd8e6b50e25421543dbdab03","start":105}],"target_id":"question.wikipedia.catalan-s-conjecture","target_kind":"node","target_sha256":"3a67ccc4017521b28143fa8be1ceab3db57508b073b8c83ae52f5d4546fb6234"}],"question.wikipedia.chang-s-conjecture":[{"id":"assertion.question.wikipedia.chang-s-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chang's conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chang's conjecture\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","support":[{"end":339,"quote":"In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","source_id":"wikipedia.article.chang-s-conjecture","source_sha256":"fff4879ec2e91e74695b59c5fa65ce79caf55cdb794787f912daf2861e49a073","start":106}],"target_id":"question.wikipedia.chang-s-conjecture","target_kind":"node","target_sha256":"39538d1b7021876a177de614ed4a6690a3408840f07720a1da6f26809d53a2af"}],"question.wikipedia.conjecture":[{"id":"assertion.question.wikipedia.conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conjecture\", CC BY-SA 4.0) states: In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","support":[{"end":193,"quote":"In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","source_id":"wikipedia.article.conjecture","source_sha256":"1c3a3640dcdffc248b3b57328deb3ec8f79bb8867e002aebeba2158211be1557","start":94}],"target_id":"question.wikipedia.conjecture","target_kind":"node","target_sha256":"c6f1dcd059955f74a46ec645333513e9c510ac92ffb0c2e9a221770e2be82f6e"}],"question.wikipedia.ehrenpreis-conjecture":[{"id":"assertion.question.wikipedia.ehrenpreis-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ehrenpreis conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ehrenpreis conjecture\", CC BY-SA 4.0) states: In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","support":[{"end":382,"quote":"In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","source_id":"wikipedia.article.ehrenpreis-conjecture","source_sha256":"30c1368403b6ec2350615d1f48ded5d9b7432f1a4414a55f78b526d4b7c1537d","start":109}],"target_id":"question.wikipedia.ehrenpreis-conjecture","target_kind":"node","target_sha256":"8b2744a3a93bf8367847fe01da64d78fdc9038e7c2acaec302d64a61155b237b"}],"theory.ads-cft":[{"id":"assertion.complete.theory.ads-cft","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Maldacena conjectures that particular M/string-theory compactifications on Anti-de Sitter spacetimes are dual to particular conformal field theories, using a large-N and low-energy construction.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"theory.ads-cft","target_kind":"node","target_sha256":"df605ba56fbb0b8e3c510d7cbc78ff055665bc7fb3e1cc534715cfee8dff84ed"}],"theory.asymptotic-safety":[{"id":"assertion.complete.theory.asymptotic-safety","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Reuter and Saueressig describe the Asymptotic Safety program in Quantum Einstein Gravity through the effective average action and a proposed non-trivial renormalization-group fixed point. Their review summarizes supporting evidence, rather than establishing universal validity.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477},{"end":1075,"quote":"We give a pedagogical introduction to the basic ideas and concepts of the Asymptotic Safety program in Quantum Einstein Gravity. Using the continuum approach based upon the effective average action, we summarize the state of the art of the field with a particular focus on the evidence supporting the existence of the non-trivial renormalization group fixed point at the heart of the construction. As an application, the multifractal structure of the emerging space-times is discussed in detail. In particular, we compare the continuum prediction for their spectral dimension with Monte Carlo data from the Causal Dynamical Triangulation approach.","source_id":"completion-source.8f929def81c8e1f18329","source_sha256":"fb0d0c47d70eadfdb8276ebdf26a5240bd027bdd37a14168ce0e1a07701a91f8","start":428}],"target_id":"theory.asymptotic-safety","target_kind":"node","target_sha256":"549ef746bd5ce4440c990e85f9d507792997c8bfc89c8bd65d370377464ecbf2"}],"theory.axion-dark-matter":[{"id":"assertion.complete.theory.axion-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX analysis tests the hypothesis that axions constitute dark matter, using a strong-field microwave-cavity haloscope and conditional exclusions of DFSZ axions.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"theory.axion-dark-matter","target_kind":"node","target_sha256":"a0c67b37ae8a01cd122dcaaf6dff4d897d74153a940473dfdfaecec4e10a75c9"}],"theory.cosmic-ray-boosted-dark-matter":[{"id":"assertion.complete.theory.cosmic-ray-boosted-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ search considers a scenario in which collisions with Milky Way cosmic rays boost otherwise light dark-matter candidates above a nuclear-recoil detection threshold. It reports no excess above expected backgrounds.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"theory.cosmic-ray-boosted-dark-matter","target_kind":"node","target_sha256":"8f8b76a7c94891eb015f97d705b82069894a0d400fedf34bb8dfb5c6dd48eada"}],"theory.dfsz-axion":[{"id":"assertion.complete.theory.dfsz-axion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX Run 1B paper describes the Dine-Fischler-Srednicki-Zhitnitsky (DFSZ) model as a benchmark for axion experiments, characterized by its axion-photon coupling.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"theory.dfsz-axion","target_kind":"node","target_sha256":"e35d5139e227122de6e54c3b47671a87d1b1e170bdc094b161fcd9bd283eb530"}],"theory.fuzzy-dark-matter":[{"id":"assertion.complete.theory.fuzzy-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Extremely light bosonic dark matter with kiloparsec-scale de Broglie wavelength.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"theory.fuzzy-dark-matter","target_kind":"node","target_sha256":"4feb63dd905fb06ff9e6f178db4b209af7b1e49c0f612d9384f807f1e7cfa60b"}],"theory.planetmath.banachtarskiparadox":[{"id":"assertion.theory.planetmath.banachtarskiparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Banach-Tarski paradox as stated in the captured PlanetMath entry banachtarskiparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 28A99, 03B99) states: The 3 -dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first! Let us formulate the theorem formally.","support":[{"end":228,"quote":"The\n3\n-dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first!\nLet us formulate the\ntheorem\nformally.","source_id":"planetmath.banachtarskiparadox","source_sha256":"bd0d30ca746f228c1d241a55cdceb6271ef19ae37e94aa73a492b1aa7be497a0","start":44}],"target_id":"theory.planetmath.banachtarskiparadox","target_kind":"node","target_sha256":"af0201f4807cfae313eb0fdd3de0be9f6351105849b1e4e38b6d7b90f88125a0"}],"theory.planetmath.binomialtheorem":[{"id":"assertion.theory.planetmath.binomialtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Binomial theorem as stated in the captured PlanetMath entry binomialtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 11B65, 06F25, 03E20) states: The binomial theorem is a formula for the expansion of ( a + b ) n , for n a positive integer and a and b any two real (or complex) numbers, into a sum of powers of a and b .","support":[{"end":208,"quote":"The\nbinomial theorem\nis a\nformula\nfor the expansion of\n(\na\n+\nb\n)\nn\n, for\nn\na\npositive integer\nand\na\nand\nb\nany two real (or complex) numbers, into a sum of powers of\na\nand\nb\n.","source_id":"planetmath.binomialtheorem","source_sha256":"6d7f02ac3d3f5f8dc0ef211f53a61304a9672bb8027efc3a331e8cb1860643c9","start":34}],"target_id":"theory.planetmath.binomialtheorem","target_kind":"node","target_sha256":"4dd3798552589db088b46586912b02807bc49494c982080782ddc6f0ce17738f"}],"theory.planetmath.chainrule":[{"id":"assertion.theory.planetmath.chainrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chain rule as stated in the captured PlanetMath entry chainrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: Let f , g be differentiable , real-valued functions such that g is defined on an open set I ⊆ ℝ , and f is defined on g ⁢ ( I ) .","support":[{"end":151,"quote":"Let\nf\n,\ng\nbe\ndifferentiable\n,\nreal-valued functions such that\ng\nis defined on an open set\nI\n⊆\nℝ\n, and\nf\nis defined on\ng\n⁢\n(\nI\n)\n.","source_id":"planetmath.chainrule","source_sha256":"5c39cf428f840a394fe936b70465fa05750d739052247e8599a473d62d5f6e7a","start":22}],"target_id":"theory.planetmath.chainrule","target_kind":"node","target_sha256":"b153596c59a3be09fbc9dcd230aca3ff3222a3fb315f0848f84ba4d769b85dad"}],"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic":[{"id":"assertion.theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deduction theorem holds for classical propositional logic as stated in the captured PlanetMath entry deductiontheoremholdsforclassicalpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03F03, 03B99, 03B22) states: In this entry, we prove that the deduction theorem holds for classical propositional logic .","support":[{"end":208,"quote":"In this entry, we prove that the\ndeduction theorem holds for classical propositional logic\n.","source_id":"planetmath.deductiontheoremholdsforclassicalpropositionallogic","source_sha256":"92d61ea09568f5e86907b57321a0a977148512d225f82e920f81260186720f39","start":116}],"target_id":"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","target_kind":"node","target_sha256":"2de7f071acb02c692d9dbdc9db17db0ddffbc4c702fdf5c6f2b665f329947da9"}],"theory.planetmath.godelsincompletenesstheorems":[{"id":"assertion.theory.planetmath.godelsincompletenesstheorems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Gödel’s incompleteness theorems as stated in the captured PlanetMath entry godelsincompletenesstheorems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B10, 03F45) states: Gödel’s first and second incompleteness theorems are perhaps the most celebrated results in mathematical logic.","support":[{"end":175,"quote":"Gödel’s first and second\nincompleteness theorems\nare perhaps the most celebrated results in mathematical logic.","source_id":"planetmath.godelsincompletenesstheorems","source_sha256":"90e3544cc990f3a1a197238c927dd7c424be216daff0db94151cffa95dfab094","start":64}],"target_id":"theory.planetmath.godelsincompletenesstheorems","target_kind":"node","target_sha256":"9efad6815d458f850276984de0cc728fb02d9b97aa5afaa2e2607f7648bda5c9"}],"theory.planetmath.hallsmarriagetheorem":[{"id":"assertion.theory.planetmath.hallsmarriagetheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hall’s marriage theorem as stated in the captured PlanetMath entry hallsmarriagetheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 05D15) states: Let S = { S 1 , S 2 , … ⁢ S n } be a finite collection of finite sets .","support":[{"end":119,"quote":"Let\nS\n=\n{\nS\n1\n,\nS\n2\n,\n…\n⁢\nS\nn\n}\nbe a finite\ncollection\nof\nfinite sets\n.","source_id":"planetmath.hallsmarriagetheorem","source_sha256":"5cde11759639f38bc50cbed68e23406868cab519ac2fdd67cb7bbc09d4af3845","start":48}],"target_id":"theory.planetmath.hallsmarriagetheorem","target_kind":"node","target_sha256":"ee99ea53cec72c0ba2cf7c50fd7f042e2050dba288b2fab29a9803d836db6917"}],"theory.planetmath.hausdorffparadox":[{"id":"assertion.theory.planetmath.hausdorffparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff paradox as stated in the captured PlanetMath entry hausdorffparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25, 51M04) states: Let S 2 be the unit sphere in the Euclidean space ℝ 3 .","support":[{"end":91,"quote":"Let\nS\n2\nbe the\nunit sphere\nin the\nEuclidean space\nℝ\n3\n.","source_id":"planetmath.hausdorffparadox","source_sha256":"38c565fd0f49e709cdd604cc39ba3bd5cc35a47c7aa4ff70e5799a294f9c855f","start":36}],"target_id":"theory.planetmath.hausdorffparadox","target_kind":"node","target_sha256":"ae8944097a988323c0fa0f70044cfc62e8b88db6a428c497844da6e95d65328d"}],"theory.planetmath.hausdorffsmaximumprinciple":[{"id":"assertion.theory.planetmath.hausdorffsmaximumprinciple","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff’s maximum principle as stated in the captured PlanetMath entry hausdorffsmaximumprinciple","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25) states: Theorem Let X be a partially ordered set . Then there exists a maximal totally ordered subset of X .","support":[{"end":160,"quote":"Theorem\nLet\nX\nbe a\npartially ordered set\n. Then there exists a maximal\ntotally\nordered\nsubset of\nX\n.","source_id":"planetmath.hausdorffsmaximumprinciple","source_sha256":"fd01bca5a7dfce46f873019f926663975017f4ee3d7f1ace40c59600fdc38f32","start":60}],"target_id":"theory.planetmath.hausdorffsmaximumprinciple","target_kind":"node","target_sha256":"46b1730809190eff6735a79e8d5c1830c576597254a6c5f819ea2aa894e3cf29"}],"theory.planetmath.inversefunctiontheorem":[{"id":"assertion.theory.planetmath.inversefunctiontheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse function theorem as stated in the captured PlanetMath entry inversefunctiontheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E20) states: Let 𝐟 be a continuously differentiable , vector-valued function mapping the open set E ⊂ ℝ n to ℝ n and let S = 𝐟 ⁢ ( E ) .","support":[{"end":173,"quote":"Let\n𝐟\nbe a\ncontinuously differentiable\n,\nvector-valued function\nmapping the open set\nE\n⊂\nℝ\nn\nto\nℝ\nn\nand let\nS\n=\n𝐟\n⁢\n(\nE\n)\n.","source_id":"planetmath.inversefunctiontheorem","source_sha256":"b837d4f04821c5b33244542004edf2a3390f9b684e7ea15892ce5908b924b97f","start":50}],"target_id":"theory.planetmath.inversefunctiontheorem","target_kind":"node","target_sha256":"db7883483edf503a4ebbde9383f00bee51a4fba45af232d9598745044b5d065d"}],"theory.planetmath.mcalistercoveringtheorem":[{"id":"assertion.theory.planetmath.mcalistercoveringtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"McAlister covering theorem as stated in the captured PlanetMath entry mcalistercoveringtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 20M18) states: A subset X in an inverse semigroup S is called unitary if for any elements x ∈ X and s ∈ S , x ⁢ s ∈ X or s ⁢ x ∈ X implies s ∈ X .","support":[{"end":185,"quote":"A subset\nX\nin an\ninverse semigroup\nS\nis called\nunitary\nif for any\nelements\nx\n∈\nX\nand\ns\n∈\nS\n,\nx\n⁢\ns\n∈\nX\nor\ns\n⁢\nx\n∈\nX\nimplies\ns\n∈\nX\n.","source_id":"planetmath.mcalistercoveringtheorem","source_sha256":"76b59d230700c6bc3f2c1ad14ef9a101596827a07bf23bff0bc0fc5c401c2f1a","start":54}],"target_id":"theory.planetmath.mcalistercoveringtheorem","target_kind":"node","target_sha256":"c58dabd6d246604832b718d21c18e347d0fb31ecb9a9cbef05fb573554cc9f81"}],"theory.planetmath.polynomialringoverintegraldomain":[{"id":"assertion.theory.planetmath.polynomialringoverintegraldomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomial ring over integral domain as stated in the captured PlanetMath entry polynomialringoverintegraldomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 13P05) states: Theorem . If the coefficient ring R is an integral domain , then so is also its polynomial ring R ⁢ [ X ] .","support":[{"end":181,"quote":"Theorem\n.\nIf the\ncoefficient ring\nR\nis an\nintegral domain\n, then so is also its\npolynomial ring\nR\n⁢\n[\nX\n]\n.","source_id":"planetmath.polynomialringoverintegraldomain","source_sha256":"ca702a9c74797d8c689748b62e9caf4b91e1fcf441e0fb079e9fea6633c9f886","start":74}],"target_id":"theory.planetmath.polynomialringoverintegraldomain","target_kind":"node","target_sha256":"82b92b746d71d0a72b2118e94b5098f05847a7048ed0e854d701228e31fb5906"}],"theory.planetmath.principleoffiniteinduction":[{"id":"assertion.theory.planetmath.principleoffiniteinduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Principle of finite induction as stated in the captured PlanetMath entry principleoffiniteinduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25, 00-02) states: The principle of finite induction , also known as mathematical induction , is commonly formulated in two ways.","support":[{"end":170,"quote":"The\nprinciple of finite induction\n, also known as\nmathematical induction\n, is commonly formulated in two ways.","source_id":"planetmath.principleoffiniteinduction","source_sha256":"38c9e9e538462dbb0d39ff6979402d0388bceaea48fe5ff57f7a6c49d8b4b978","start":60}],"target_id":"theory.planetmath.principleoffiniteinduction","target_kind":"node","target_sha256":"8eaaf3f385c981446621e2659378ef839863665f7b5d20a575cd242cb3a46703"}],"theory.planetmath.productrule":[{"id":"assertion.theory.planetmath.productrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Product rule as stated in the captured PlanetMath entry productrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: The product rule states that if f : ℝ → ℝ and g : ℝ → ℝ are functions in one variable both differentiable at a point x 0 , then the derivative of the product of the two functions, denoted f ⋅ g , at x 0 is given by d d ⁢ x ⁢ ( f ⋅ g ) ⁢ ( x 0 ) = f ⁢ ( x 0 ) ⁢ g ′ ⁢ ( x 0 ) + f ′ ⁢ ( x 0 ) ⁢ g ⁢ ( x 0 ) .","support":[{"end":332,"quote":"The\nproduct rule\nstates that if\nf\n:\nℝ\n→\nℝ\nand\ng\n:\nℝ\n→\nℝ\nare functions in one variable both\ndifferentiable\nat a point\nx\n0\n, then the\nderivative\nof the product of the two functions, denoted\nf\n⋅\ng\n, at\nx\n0\nis given by\nd\nd\n⁢\nx\n⁢\n(\nf\n⋅\ng\n)\n⁢\n(\nx\n0\n)\n=\nf\n⁢\n(\nx\n0\n)\n⁢\ng\n′\n⁢\n(\nx\n0\n)\n+\nf\n′\n⁢\n(\nx\n0\n)\n⁢\ng\n⁢\n(\nx\n0\n)\n.","source_id":"planetmath.productrule","source_sha256":"5b8bfe37199f5a43edaf78ab183f19bbacd2fe2980e3a7b501ea5edafcadb8b9","start":26}],"target_id":"theory.planetmath.productrule","target_kind":"node","target_sha256":"6778371046d7accc6f0f8f3c5acd072c8ef759b0356013c2c113dc23eec87bde"}],"theory.planetmath.quotientrule":[{"id":"assertion.theory.planetmath.quotientrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient rule as stated in the captured PlanetMath entry quotientrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: The quotient rule says that the derivative of the quotient f / g of two differentiable functions f and g exists at all values of x as long as g ⁢ ( x ) ≠ 0 and is given by the formula d d ⁢ x ⁢ [ f ⁢ ( x ) g ⁢ ( x ) ] = g ⁢ ( x ) ⁢ f ′ ⁢ ( x ) - f ⁢ ( x ) ⁢ g ′ ⁢ ( x ) [ g ⁢ ( x ) ] 2 The Quotient Rule and the other differentiation formulas allow us to compute the derivative of any rational function .","support":[{"end":432,"quote":"The\nquotient rule\nsays that the\nderivative\nof the quotient\nf\n/\ng\nof two\ndifferentiable functions\nf\nand\ng\nexists at all values of\nx\nas long as\ng\n⁢\n(\nx\n)\n≠\n0\nand is given by the formula\nd\nd\n⁢\nx\n⁢\n[\nf\n⁢\n(\nx\n)\ng\n⁢\n(\nx\n)\n]\n=\ng\n⁢\n(\nx\n)\n⁢\nf\n′\n⁢\n(\nx\n)\n-\nf\n⁢\n(\nx\n)\n⁢\ng\n′\n⁢\n(\nx\n)\n[\ng\n⁢\n(\nx\n)\n]\n2\nThe Quotient Rule and the other\ndifferentiation\nformulas allow us to compute the derivative of any\nrational function\n.","source_id":"planetmath.quotientrule","source_sha256":"fa9a295826264a9a7d12c40027799717b157560c2cca6631849cf474c884b17c","start":28}],"target_id":"theory.planetmath.quotientrule","target_kind":"node","target_sha256":"6dd9cf997135e155cfaa97fad5b070c90f8574aff02a38fd954df0772c17566a"}],"theory.planetmath.ranknullitytheorem":[{"id":"assertion.theory.planetmath.ranknullitytheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rank-nullity theorem as stated in the captured PlanetMath entry ranknullitytheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A03) states: Let V and W be vector spaces over the same field. If ϕ : V → W is a linear mapping , then dim ⁡ V = dim ⁡ ( ker ⁡ ϕ ) + dim ⁡ ( im ⁡ ϕ ) .","support":[{"end":180,"quote":"Let\nV\nand\nW\nbe\nvector spaces\nover the same field.\nIf\nϕ\n:\nV\n→\nW\nis a\nlinear mapping\n, then\ndim\n⁡\nV\n=\ndim\n⁡\n(\nker\n⁡\nϕ\n)\n+\ndim\n⁡\n(\nim\n⁡\nϕ\n)\n.","source_id":"planetmath.ranknullitytheorem","source_sha256":"bcc46ef0ebf6ebe5b79dfb08ada6ecfb380eff5a968b0c56a158b36cae50b2b1","start":42}],"target_id":"theory.planetmath.ranknullitytheorem","target_kind":"node","target_sha256":"3e405f7f1ab1c8593da38ecb3e3857db26499e0f21c56e89b296b9789753771e"}],"theory.planetmath.spectraltheorem":[{"id":"assertion.theory.planetmath.spectraltheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Spectral theorem as stated in the captured PlanetMath entry spectraltheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A23, 15A63, 15A18) states: Let U be a finite-dimensional , unitary space and let M : U → U be an endomorphism .","support":[{"end":118,"quote":"Let\nU\nbe a\nfinite-dimensional\n,\nunitary space\nand let\nM\n:\nU\n→\nU\nbe an\nendomorphism\n.","source_id":"planetmath.spectraltheorem","source_sha256":"d77fb9fa455ee2bac5c8ba67771e493adce1028262b14fed58369f7a68aab3bd","start":34}],"target_id":"theory.planetmath.spectraltheorem","target_kind":"node","target_sha256":"13924ea2c17a2677cf8ba5cf925ae65addbad75ecbf6135255906e2ce2eef888"}],"theory.planetmath.sylvesterslaw":[{"id":"assertion.theory.planetmath.sylvesterslaw","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sylvester’s law as stated in the captured PlanetMath entry sylvesterslaw","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A03) states: Let V be an n -dimensional real vector space and let Q : V × V → ℝ be a symmetric quadratic form .","support":[{"end":130,"quote":"Let\nV\nbe an\nn\n-dimensional\nreal vector space\nand let\nQ\n:\nV\n×\nV\n→\nℝ\nbe a\nsymmetric quadratic form\n.","source_id":"planetmath.sylvesterslaw","source_sha256":"0b5cf0a2e8734db09dfd2bf9d31acd137276dd0d210c80195779d24dd5a002a5","start":32}],"target_id":"theory.planetmath.sylvesterslaw","target_kind":"node","target_sha256":"842196359235541a75c4d462bbe834e69a2768b51c15f23b8ceaa6c6b07ca653"}],"theory.planetmath.transfiniteinduction":[{"id":"assertion.theory.planetmath.transfiniteinduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transfinite induction as stated in the captured PlanetMath entry transfiniteinduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B10) states: Suppose Φ ⁢ ( α ) is a property defined for every ordinal α , the principle of transfinite induction states that in the case where for every α , if the fact that Φ ⁢ ( β ) is true for every β < α implies that Φ ⁢ ( α ) is true, then Φ ⁢ ( α ) is true for every ordinal α .","support":[{"end":316,"quote":"Suppose\nΦ\n⁢\n(\nα\n)\nis a\nproperty\ndefined for every\nordinal\nα\n, the principle of\ntransfinite induction\nstates that in the case where for every\nα\n, if the fact that\nΦ\n⁢\n(\nβ\n)\nis true for every\nβ\n<\nα\nimplies that\nΦ\n⁢\n(\nα\n)\nis true, then\nΦ\n⁢\n(\nα\n)\nis true for every ordinal\nα\n.","source_id":"planetmath.transfiniteinduction","source_sha256":"234c8f5ed4409a7e57a6aaee61d85a5d3b8f113c4b7e13ae0ea42394a98b7342","start":44}],"target_id":"theory.planetmath.transfiniteinduction","target_kind":"node","target_sha256":"6694b682e470842aac5d12fb02abab9dc8de6ec4ea247e6020fceab0ff2af977"}],"theory.planetmath.transfiniterecursion":[{"id":"assertion.theory.planetmath.transfiniterecursion","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transfinite recursion as stated in the captured PlanetMath entry transfiniterecursion","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E45, 03E10) states: Transfinite recursion , roughly speaking, is a statement about the ability to define a function recursively using transfinite induction .","support":[{"end":181,"quote":"Transfinite recursion\n, roughly speaking, is a statement about the ability to define a\nfunction\nrecursively using\ntransfinite induction\n.","source_id":"planetmath.transfiniterecursion","source_sha256":"a116e6e7c56936ae937fc962b39bf0a243b359e7cd78cfb5edde049b32a8be25","start":44}],"target_id":"theory.planetmath.transfiniterecursion","target_kind":"node","target_sha256":"6fc464fa2b9c7b987c5437f929f0c9ae39f725b62d9d567dd4046449b86e8ac7"}],"theory.planetmath.uniquereadabilityofwellformedformulas":[{"id":"assertion.theory.planetmath.uniquereadabilityofwellformedformulas","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Unique readability of well-formed formulas as stated in the captured PlanetMath entry uniquereadabilityofwellformedformulas","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B05) states: Suppose V is an alphabet . Two words w 1 and w 2 over V are the same if they have the same length and same symbol for every position of the word.","support":[{"end":231,"quote":"Suppose\nV\nis an\nalphabet\n. Two words\nw\n1\nand\nw\n2\nover\nV\nare the same if they have the same length and same symbol for every position of the word.","source_id":"planetmath.uniquereadabilityofwellformedformulas","source_sha256":"681d6ce75bd274024317a4fb84b49b6d262cb8674593f8d41488a91a3e9ef9d1","start":86}],"target_id":"theory.planetmath.uniquereadabilityofwellformedformulas","target_kind":"node","target_sha256":"2555600507355aa474a780e9238e5b77d526a832d33dfb0761fb9ea662b8ba6b"}],"theory.planetmath.zermeloswellorderingtheorem":[{"id":"assertion.theory.planetmath.zermeloswellorderingtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zermelo’s well-ordering theorem as stated in the captured PlanetMath entry zermeloswellorderingtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25) states: If X is any set whatsoever, then there exists a well-ordering of X .","support":[{"end":132,"quote":"If\nX\nis any set whatsoever, then there exists a\nwell-ordering\nof\nX\n.","source_id":"planetmath.zermeloswellorderingtheorem","source_sha256":"07803743058ab89fb5194e0e89f8f393457155e51d2e68534178d2d0c6e0820e","start":64}],"target_id":"theory.planetmath.zermeloswellorderingtheorem","target_kind":"node","target_sha256":"5d600aa0415e2270c8a94457410c36ef39c6aa89f00e1d732b4222eea6fdedf5"}],"theory.primordial-black-hole-dark-matter":[{"id":"assertion.complete.theory.primordial-black-hole-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited OGLE analysis treats primordial black holes as a possible fraction of Milky Way halo dark matter and conditionally constrains that fraction using microlensing events.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"theory.primordial-black-hole-dark-matter","target_kind":"node","target_sha256":"61f8fbdcfe15b74ebc3037152f89b3de28fd57a54a616c12a445a95e54fb63d3"}],"theory.self-interacting-dark-matter":[{"id":"assertion.complete.theory.self-interacting-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited sources discuss a family of dark-matter models with interactions beyond gravity. Their predictions and astrophysical constraints depend on the interaction model; no single unified model is asserted here.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":2381,"quote":"We review theories of dark matter (DM) beyond the collisionless paradigm, known as self-interacting dark matter (SIDM), and their observable implications for astrophysical structure in the Universe. Self-interactions are motivated, in part, due to the potential to explain long-standing (and more recent) small scale structure observations that are in tension with collisionless cold DM (CDM) predictions. Simple particle physics models for SIDM can provide a universal explanation for these observations across a wide range of mass scales spanning dwarf galaxies, low and high surface brightness spiral galaxies, and clusters of galaxies. At the same time, SIDM leaves intact the success of $\\Lambda$CDM cosmology on large scales. This report covers the following topics: (1) small scale structure issues, including the core-cusp problem, the diversity problem for rotation curves, the missing satellites problem, and the too-big-to-fail problem, as well as recent progress in hydrodynamical simulations of galaxy formation; (2) N-body simulations for SIDM, including implications for density profiles, halo shapes, substructure, and the interplay between baryons and self-interactions; (3) semi-analytic Jeans-based methods that provide a complementary approach for connecting particle models with observations; (4) merging systems, such as cluster mergers (e.g., the Bullet Cluster) and minor infalls, along with recent simulation results for mergers; (5) particle physics models, including light mediator models and composite DM models; and (6) complementary probes for SIDM, including indirect and direct detection experiments, particle collider searches, and cosmological observations. We provide a summary and critical look for all current constraints on DM self-interactions and an outline for future directions.","source_id":"completion-source.495bd78c68aa1596d994","source_sha256":"7add5fe1b98d3f97f006857a5ad1a04b37c36be497e2f7eb35652b95a47ee519","start":561}],"target_id":"theory.self-interacting-dark-matter","target_kind":"node","target_sha256":"d7ebf527083c7e10099b063770cd71856c537f18c64192a9fd6a82c834e0618d"}],"theory.wikipedia.abel-s-binomial-theorem":[{"id":"assertion.theory.wikipedia.abel-s-binomial-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's binomial theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's binomial theorem\", CC BY-SA 4.0) states: Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","support":[{"end":234,"quote":"Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","source_id":"wikipedia.article.abel-s-binomial-theorem","source_sha256":"8131cae280a85f7a52ee9332e30df919a226e7467c577ad9c564385538522868","start":111}],"target_id":"theory.wikipedia.abel-s-binomial-theorem","target_kind":"node","target_sha256":"dc96c5007e437a6a710a273ba7c9c6b978600540cb019dc12e088e8ea0e69977"}],"theory.wikipedia.abel-s-irreducibility-theorem":[{"id":"assertion.theory.wikipedia.abel-s-irreducibility-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's irreducibility theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's irreducibility theorem\", CC BY-SA 4.0) states: In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is irreducible over F, then every root of g(x) is a root of f(x).","support":[{"end":391,"quote":"In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is  irreducible over F, then every root of g(x) is a root of f(x).","source_id":"wikipedia.article.abel-s-irreducibility-theorem","source_sha256":"eab8ee1a11ad08682515b925b1bb112f3bf2f8f006191d68d6d2a95b7cd5d11d","start":117}],"target_id":"theory.wikipedia.abel-s-irreducibility-theorem","target_kind":"node","target_sha256":"bba32856a8696747feb1a17bfd86636d1656c0f2d592e626fdd5098d9ec73c05"}],"theory.wikipedia.ahlfors-finiteness-theorem":[{"id":"assertion.theory.wikipedia.ahlfors-finiteness-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ahlfors finiteness theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ahlfors finiteness theorem\", CC BY-SA 4.0) states: In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","support":[{"end":285,"quote":"In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","source_id":"wikipedia.article.ahlfors-finiteness-theorem","source_sha256":"a933abdc806b4e87d8ce6c1e6952753206fcc15109b2bcdd0ac2a6c28c6b7a42","start":114}],"target_id":"theory.wikipedia.ahlfors-finiteness-theorem","target_kind":"node","target_sha256":"7b8fec6e13e0fb33d5b9d26db430413a55ee17788b6c1b5fe254dc9bf83fd205"}],"theory.wikipedia.alexander-s-subbase-lemma":[{"id":"assertion.theory.wikipedia.alexander-s-subbase-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander's subbase lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander's subbase lemma\", CC BY-SA 4.0) states: In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","support":[{"end":358,"quote":"In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","source_id":"wikipedia.article.alexander-s-subbase-lemma","source_sha256":"828df255ff870a9aba1213eb6beb203b6945c466ba783d8310ad47df14473261","start":113}],"target_id":"theory.wikipedia.alexander-s-subbase-lemma","target_kind":"node","target_sha256":"fc1561e580f52323779fabfdc5bb10daeb5e6134afcbfe1fc085b4ed86dea416"}],"theory.wikipedia.amitsur-levitzki-theorem":[{"id":"assertion.theory.wikipedia.amitsur-levitzki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amitsur–Levitzki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amitsur–Levitzki theorem\", CC BY-SA 4.0) states: In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","support":[{"end":261,"quote":"In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","source_id":"wikipedia.article.amitsur-levitzki-theorem","source_sha256":"8c68040bbd9a8004c55e3de421b1f2cd16145d757332b5337c2f9a64d8fa7d12","start":112}],"target_id":"theory.wikipedia.amitsur-levitzki-theorem","target_kind":"node","target_sha256":"2e123452fb889ec534f996f5a767d139f0ecc8f5e60493226ad21005599514d4"}],"theory.wikipedia.analytic-subgroup-theorem":[{"id":"assertion.theory.wikipedia.analytic-subgroup-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic subgroup theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic subgroup theorem\", CC BY-SA 4.0) states: In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","support":[{"end":222,"quote":"In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","source_id":"wikipedia.article.analytic-subgroup-theorem","source_sha256":"837091cdc7610b686f7bc923252a47899e6ce7064562ccb7545b7b5db7bfe1bd","start":113}],"target_id":"theory.wikipedia.analytic-subgroup-theorem","target_kind":"node","target_sha256":"97b3ede6c87c31f452f1a5a8f5e73287f6b372491f094726ccf2d2200ea1f829"}],"theory.wikipedia.anderson-kadec-theorem":[{"id":"assertion.theory.wikipedia.anderson-kadec-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anderson–Kadec theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anderson–Kadec theorem\", CC BY-SA 4.0) states: In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","support":[{"end":345,"quote":"In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","source_id":"wikipedia.article.anderson-kadec-theorem","source_sha256":"28f835dbe46ac5c90359c26c5d136ad2946e8276306b5216c643802b75a47fa5","start":110}],"target_id":"theory.wikipedia.anderson-kadec-theorem","target_kind":"node","target_sha256":"0889218d1dfc8e6149f4292802776fdbad2263e099fa1a39169a56d055bae286"}],"theory.wikipedia.andreotti-vesentini-theorem":[{"id":"assertion.theory.wikipedia.andreotti-vesentini-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Andreotti–Vesentini theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Andreotti–Vesentini theorem\", CC BY-SA 4.0) states: In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","support":[{"end":312,"quote":"In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","source_id":"wikipedia.article.andreotti-vesentini-theorem","source_sha256":"4189425b9e60acad405391a3b13a514678e60f95921c72731b8fbc76085b4517","start":115}],"target_id":"theory.wikipedia.andreotti-vesentini-theorem","target_kind":"node","target_sha256":"1881072d2dcc7664eb9713884346d680a2a32eea56668a2af72f20aa7aeead2b"}],"theory.wikipedia.annulus-theorem":[{"id":"assertion.theory.wikipedia.annulus-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Annulus theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Annulus theorem\", CC BY-SA 4.0) states: In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","support":[{"end":258,"quote":"In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","source_id":"wikipedia.article.annulus-theorem","source_sha256":"f087f2e9902a75ac94774b14044492d33e4a93434a0efc472d66b803ed956a15","start":103}],"target_id":"theory.wikipedia.annulus-theorem","target_kind":"node","target_sha256":"2c2f4c5b616b1da89ed298878ecbd615e325fcda19ea55ac4225eb9d26ae58a6"}],"theory.wikipedia.ap-ry-s-theorem":[{"id":"assertion.theory.wikipedia.ap-ry-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apéry's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apéry's theorem\", CC BY-SA 4.0) states: In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","support":[{"end":217,"quote":"In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","source_id":"wikipedia.article.ap-ry-s-theorem","source_sha256":"5ec5b5c51f6ca84152cb0044d7649109ebc42fdbdb53166a87f2b762e6d15689","start":102}],"target_id":"theory.wikipedia.ap-ry-s-theorem","target_kind":"node","target_sha256":"07f63956f70c6555a17abaa9adc3b6c18433a616094f361e6e33bd4876acbcef"}],"theory.wikipedia.apollonius-s-theorem":[{"id":"assertion.theory.wikipedia.apollonius-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apollonius's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apollonius's theorem\", CC BY-SA 4.0) states: In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","support":[{"end":228,"quote":"In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","source_id":"wikipedia.article.apollonius-s-theorem","source_sha256":"746c640c78b6c81629d108b1d6fe6306b52dd2d2025240c0aff9c1f47d605610","start":107}],"target_id":"theory.wikipedia.apollonius-s-theorem","target_kind":"node","target_sha256":"beb21356e176ecb455310028e3d681019e427cb139f84d4ed6ec139e02a67ec4"}],"theory.wikipedia.atiyah-segal-completion-theorem":[{"id":"assertion.theory.wikipedia.atiyah-segal-completion-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atiyah–Segal completion theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atiyah–Segal completion theorem\", CC BY-SA 4.0) states: The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","support":[{"end":229,"quote":"The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","source_id":"wikipedia.article.atiyah-segal-completion-theorem","source_sha256":"e733c0b97604d4730010027a8df2f2d83409ad6b76735ea0149701a93c8c8cf6","start":119}],"target_id":"theory.wikipedia.atiyah-segal-completion-theorem","target_kind":"node","target_sha256":"a8a72b3d61683b4909baea301afd81988b120aa23ef60c1a7a4ed414457033f2"}],"theory.wikipedia.aubin-lions-lemma":[{"id":"assertion.theory.wikipedia.aubin-lions-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aubin–Lions lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aubin–Lions lemma\", CC BY-SA 4.0) states: In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","support":[{"end":360,"quote":"In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","source_id":"wikipedia.article.aubin-lions-lemma","source_sha256":"5da722e9e82729fa498c54aaa8ab7d8a14d4e5d3b90c89c7460769dcd5fdb191","start":105}],"target_id":"theory.wikipedia.aubin-lions-lemma","target_kind":"node","target_sha256":"8e1b2bf131191e049eba5624bfd7183b0e3d17ff19570fe1f3710102a86bd3b7"}],"theory.wikipedia.auslander-buchsbaum-theorem":[{"id":"assertion.theory.wikipedia.auslander-buchsbaum-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Auslander–Buchsbaum theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Auslander–Buchsbaum theorem\", CC BY-SA 4.0) states: In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","support":[{"end":236,"quote":"In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","source_id":"wikipedia.article.auslander-buchsbaum-theorem","source_sha256":"bbce3f839ee284ef5343038134c6f1d85c6c4a2300c459dedcaf955f570d83c3","start":115}],"target_id":"theory.wikipedia.auslander-buchsbaum-theorem","target_kind":"node","target_sha256":"eecd923092f41ce0969964d156b80d4c152a10d9b65cb55525cb2def420f3f9f"}],"theory.wikipedia.ax-grothendieck-theorem":[{"id":"assertion.theory.wikipedia.ax-grothendieck-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ax–Grothendieck theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ax–Grothendieck theorem\", CC BY-SA 4.0) states: In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","support":[{"end":286,"quote":"In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","source_id":"wikipedia.article.ax-grothendieck-theorem","source_sha256":"f24fa25864074375da7f81a9399a9be39dfe7fda60d52997946f335a446f5159","start":111}],"target_id":"theory.wikipedia.ax-grothendieck-theorem","target_kind":"node","target_sha256":"2fb6e3e89120c4ea5b0dfec862a64489b87529d8ad5df196512cb8eb9e514419"}],"theory.wikipedia.ax-kochen-theorem":[{"id":"assertion.theory.wikipedia.ax-kochen-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ax–Kochen theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ax–Kochen theorem\", CC BY-SA 4.0) states: The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","support":[{"end":409,"quote":"The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","source_id":"wikipedia.article.ax-kochen-theorem","source_sha256":"885f960e774d0bb75670fbbb52406a4ce68e636a66be7cc05f9059fed981d5d5","start":104}],"target_id":"theory.wikipedia.ax-kochen-theorem","target_kind":"node","target_sha256":"e72cfea9eb60da17bdb94f270b9b4c1cab2260ad9c26694b621607c3ae59a717"}],"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem":[{"id":"assertion.theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Büchi–Elgot–Trakhtenbrot theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Büchi–Elgot–Trakhtenbrot theorem\", CC BY-SA 4.0) states: In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","support":[{"end":300,"quote":"In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","source_id":"wikipedia.article.b-chi-elgot-trakhtenbrot-theorem","source_sha256":"49245034f54508476f113b29772471b23524e4b65b2a34a7bed965abb9f55658","start":120}],"target_id":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","target_kind":"node","target_sha256":"58bb7405834fed54ab7a545aaefb121ccdbcce4f9e9ebd429b55a9f5ba4fad35"}],"theory.wikipedia.bagpipe-theorem":[{"id":"assertion.theory.wikipedia.bagpipe-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bagpipe theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bagpipe theorem\", CC BY-SA 4.0) states: In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \"bagpipes\": the connected sum of a compact \"bag\" with several \"long pipes\".","support":[{"end":352,"quote":"In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \\\"bagpipes\\\": the connected sum of a compact \\\"bag\\\" with several \\\"long pipes\\\".","source_id":"wikipedia.article.bagpipe-theorem","source_sha256":"e51c96ea32742cb48ea2ed046626efb77b4e1119bb60dc1290a8e7085d6ba61a","start":103}],"target_id":"theory.wikipedia.bagpipe-theorem","target_kind":"node","target_sha256":"db98b87e571992744b7e1f9ec2ec634a90a171984c538a91a6e4869f63e0666a"}],"theory.wikipedia.baire-category-theorem":[{"id":"assertion.theory.wikipedia.baire-category-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire category theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire category theorem\", CC BY-SA 4.0) states: The Baire category theorem (BCT) is an important result in general topology and functional analysis.","support":[{"end":207,"quote":"The Baire category theorem (BCT) is an important result in general topology and functional analysis.","source_id":"wikipedia.article.baire-category-theorem","source_sha256":"15e70706d0d197cbf35afd147379e09d29560d0e07772fcbbb92266388e21b9d","start":107}],"target_id":"theory.wikipedia.baire-category-theorem","target_kind":"node","target_sha256":"0269b3074780a633f58d89e72e7bfa44663b9548f4a93d43211830ebccaf3424"}],"theory.wikipedia.banach-fixed-point-theorem":[{"id":"assertion.theory.wikipedia.banach-fixed-point-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Banach fixed-point theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Banach fixed-point theorem\", CC BY-SA 4.0) states: In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","support":[{"end":479,"quote":"In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","source_id":"wikipedia.article.banach-fixed-point-theorem","source_sha256":"364c90730bf06b13601d5cd04d9f192021bb43e04d4e300ac79b02dc27e77664","start":111}],"target_id":"theory.wikipedia.banach-fixed-point-theorem","target_kind":"node","target_sha256":"82a73f5d1251749dec551f8ab3df2c32855ca866d253a9390136fc43e2bd6175"}],"theory.wikipedia.beauville-laszlo-theorem":[{"id":"assertion.theory.wikipedia.beauville-laszlo-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beauville–Laszlo theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beauville–Laszlo theorem\", CC BY-SA 4.0) states: In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \"glue\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","support":[{"end":323,"quote":"In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \\\"glue\\\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","source_id":"wikipedia.article.beauville-laszlo-theorem","source_sha256":"56aa832c1ea1d8c25e010302024070c9ea5c10c32ef5b183aa4ff8c1cbfa9d97","start":112}],"target_id":"theory.wikipedia.beauville-laszlo-theorem","target_kind":"node","target_sha256":"fb7ee5f9a343b3c3dd1a93676df4850560fe4224e18f958e057f02a87ec3d531"}],"theory.wikipedia.beckman-quarles-theorem":[{"id":"assertion.theory.wikipedia.beckman-quarles-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beckman–Quarles theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beckman–Quarles theorem\", CC BY-SA 4.0) states: In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","support":[{"end":314,"quote":"In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","source_id":"wikipedia.article.beckman-quarles-theorem","source_sha256":"5af7af512b22ede6038ba8b52875b2c3202349584f4b5a7014a918d47d1d8a36","start":110}],"target_id":"theory.wikipedia.beckman-quarles-theorem","target_kind":"node","target_sha256":"5facb33c6a1c0cc8c02b57ed9f54d3f63fd2ca1608c09de1a327b2f392cd31cf"}],"theory.wikipedia.beki-s-theorem":[{"id":"assertion.theory.wikipedia.beki-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bekić's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bekić's theorem\", CC BY-SA 4.0) states: In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","support":[{"end":277,"quote":"In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","source_id":"wikipedia.article.beki-s-theorem","source_sha256":"a260bf476598bceb093f8bbfb93517c82eca3d2d8a2b3a10b0100d5230c0416f","start":103}],"target_id":"theory.wikipedia.beki-s-theorem","target_kind":"node","target_sha256":"40e65ed3079d590d7d594ab814bded766882eebd3b6cbfd35a6127633df265eb"}],"theory.wikipedia.bendixson-dulac-theorem":[{"id":"assertion.theory.wikipedia.bendixson-dulac-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bendixson–Dulac theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bendixson–Dulac theorem\", CC BY-SA 4.0) states: In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","support":[{"end":258,"quote":"In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","source_id":"wikipedia.article.bendixson-dulac-theorem","source_sha256":"2c60dcad659e4d59ede145f4c6ad533434965e80cfed04eeea1c879bf195b41f","start":109}],"target_id":"theory.wikipedia.bendixson-dulac-theorem","target_kind":"node","target_sha256":"278561b1216e267a4e0c4c92fe6a67ed1a1abba5f93851ae937b931a3d9ad67b"}],"theory.wikipedia.big-little-big-lemma":[{"id":"assertion.theory.wikipedia.big-little-big-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big-little-big lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big-little-big lemma\", CC BY-SA 4.0) states: In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","support":[{"end":292,"quote":"In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","source_id":"wikipedia.article.big-little-big-lemma","source_sha256":"7049fff00e2ce1d12918c260ed87350afb66119c29691700b405c70516e4e851","start":108}],"target_id":"theory.wikipedia.big-little-big-lemma","target_kind":"node","target_sha256":"7f103b5fd2ee1f559a5b6513224541782d4559c253631774e1cc46e378805298"}],"theory.wikipedia.bing-metrization-theorem":[{"id":"assertion.theory.wikipedia.bing-metrization-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bing metrization theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bing metrization theorem\", CC BY-SA 4.0) states: In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","support":[{"end":231,"quote":"In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","source_id":"wikipedia.article.bing-metrization-theorem","source_sha256":"2bbdbf87b0bb4ae1bca1ff27e8afd4e3118442bdf1b1027123573dd0fa559b58","start":111}],"target_id":"theory.wikipedia.bing-metrization-theorem","target_kind":"node","target_sha256":"e76f4e4b4e9b06e5d57914494f55c56ccf906a90c59d87cbde143230d5442f97"}],"theory.wikipedia.bing-s-recognition-theorem":[{"id":"assertion.theory.wikipedia.bing-s-recognition-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bing's recognition theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bing's recognition theorem\", CC BY-SA 4.0) states: In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","support":[{"end":377,"quote":"In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","source_id":"wikipedia.article.bing-s-recognition-theorem","source_sha256":"0904184c1690100181672a88d10e7070e2844593b0f656f868a4240b8ca43115","start":114}],"target_id":"theory.wikipedia.bing-s-recognition-theorem","target_kind":"node","target_sha256":"efa4b2b103105e3010b097eb57b4be2a8e92fee0189e4cf96db73bf10ed0d766"}],"theory.wikipedia.birch-s-theorem":[{"id":"assertion.theory.wikipedia.birch-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Birch's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Birch's theorem\", CC BY-SA 4.0) states: In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","support":[{"end":233,"quote":"In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","source_id":"wikipedia.article.birch-s-theorem","source_sha256":"d4de202fe8111165679c767fedabe20241964682b7141304236b12d07abe3faa","start":102}],"target_id":"theory.wikipedia.birch-s-theorem","target_kind":"node","target_sha256":"b035ff3b30200b9a3fc225f0afcc95e2e62ba1d6ceb5b3ca40f233e1e172e9ea"}],"theory.wikipedia.boolean-prime-ideal-theorem":[{"id":"assertion.theory.wikipedia.boolean-prime-ideal-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean prime ideal theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean prime ideal theorem\", CC BY-SA 4.0) states: In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals.","support":[{"end":234,"quote":"In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to  prime ideals.","source_id":"wikipedia.article.boolean-prime-ideal-theorem","source_sha256":"87a407e4956e3a17933b0ada94b6022baf812e8aa1a89b661e40063fa3270976","start":113}],"target_id":"theory.wikipedia.boolean-prime-ideal-theorem","target_kind":"node","target_sha256":"ef25892b6b503b4987522d5a8deaa2937d985471c615c4d2fdad1ba62c094905"}],"theory.wikipedia.borel-cantelli-lemma":[{"id":"assertion.theory.wikipedia.borel-cantelli-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Borel–Cantelli lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Borel–Cantelli lemma\", CC BY-SA 4.0) states: The Borel–Cantelli lemma is a result in measure theory.","support":[{"end":160,"quote":"The Borel–Cantelli lemma is a result in measure theory.","source_id":"wikipedia.article.borel-cantelli-lemma","source_sha256":"d0bc64d3b1fed4198289c14c93f99b1d56c899166f995e4b1ba07de63348b961","start":105}],"target_id":"theory.wikipedia.borel-cantelli-lemma","target_kind":"node","target_sha256":"89517aa2a9709aa93e893ba668169821a657355874a8e0646d84cc93b8353be8"}],"theory.wikipedia.bourbaki-witt-theorem":[{"id":"assertion.theory.wikipedia.bourbaki-witt-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bourbaki–Witt theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bourbaki–Witt theorem\", CC BY-SA 4.0) states: In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","support":[{"end":270,"quote":"In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","source_id":"wikipedia.article.bourbaki-witt-theorem","source_sha256":"7bbd66ab4ce1bbee66ed95fd9ab0c4ded76fbc786ccee7e9ff26460c75bc96f8","start":108}],"target_id":"theory.wikipedia.bourbaki-witt-theorem","target_kind":"node","target_sha256":"4790ce13bfcb0fb4e6cb9ee9780d5d5aa37119ce4e611c6adc3947877ac6b2a0"}],"theory.wikipedia.brauer-s-theorem-on-forms":[{"id":"assertion.theory.wikipedia.brauer-s-theorem-on-forms","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brauer's theorem on forms as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brauer's theorem on forms\", CC BY-SA 4.0) states: There also is Brauer's theorem on induced characters.","support":[{"end":165,"quote":"There also is Brauer's theorem on induced characters.","source_id":"wikipedia.article.brauer-s-theorem-on-forms","source_sha256":"2555710d33ed70a91b7ccecf706c7ba2489ce9b8036a5b69bbed9f75ad587178","start":112}],"target_id":"theory.wikipedia.brauer-s-theorem-on-forms","target_kind":"node","target_sha256":"273f5ed6818646ea6fab96bb10a3cd4eb13fa0eaf1547fa254f9f33adef33797"}],"theory.wikipedia.british-flag-theorem":[{"id":"assertion.theory.wikipedia.british-flag-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"British flag theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"British flag theorem\", CC BY-SA 4.0) states: In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","support":[{"end":364,"quote":"In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","source_id":"wikipedia.article.british-flag-theorem","source_sha256":"48caf2b04437fca60251917f6d327a27fb42967a4673691bbefae888da98b0a4","start":107}],"target_id":"theory.wikipedia.british-flag-theorem","target_kind":"node","target_sha256":"8df5fca9e218a003eedcaa3cbb45720a750ef93ed11d5beec20f5069e6d714ab"}],"theory.wikipedia.brouwer-fixed-point-theorem":[{"id":"assertion.theory.wikipedia.brouwer-fixed-point-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brouwer fixed-point theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brouwer fixed-point theorem\", CC BY-SA 4.0) states: Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","support":[{"end":208,"quote":"Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","source_id":"wikipedia.article.brouwer-fixed-point-theorem","source_sha256":"3e7e9541653bf603b6a60a5b4cb68e0493a5d573aaf7c2c3bf9aae162a6953e6","start":111}],"target_id":"theory.wikipedia.brouwer-fixed-point-theorem","target_kind":"node","target_sha256":"a1fdfe32dd06ecb4f42c714917a3815b3b9cfa69d66075b1fdc2335455c0bb76"}],"theory.wikipedia.cantor-bernstein-theorem":[{"id":"assertion.theory.wikipedia.cantor-bernstein-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor–Bernstein theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor–Bernstein theorem\", CC BY-SA 4.0) states: In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","support":[{"end":301,"quote":"In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","source_id":"wikipedia.article.cantor-bernstein-theorem","source_sha256":"fcc582f76f3f30b420c140eae7f679eb2e3906a4755d1bf1998be4d75a5d7dc2","start":110}],"target_id":"theory.wikipedia.cantor-bernstein-theorem","target_kind":"node","target_sha256":"12481ba861cca6cd7c69e628943553bbb1dd5b47fa74af9ad0f45a2dab378088"}],"theory.wikipedia.cantor-s-intersection-theorem":[{"id":"assertion.theory.wikipedia.cantor-s-intersection-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor's intersection theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor's intersection theorem\", CC BY-SA 4.0) states: Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","support":[{"end":376,"quote":"Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","source_id":"wikipedia.article.cantor-s-intersection-theorem","source_sha256":"07d2c3ba30d82b176c8ffd1093abfc6dd68832d948609d5d11379dd14d3e7ab6","start":117}],"target_id":"theory.wikipedia.cantor-s-intersection-theorem","target_kind":"node","target_sha256":"830742911805d23cbc3a8c6e138501b317a4e4960086a98ebe3bc16469ea9b95"}],"theory.wikipedia.casey-s-theorem":[{"id":"assertion.theory.wikipedia.casey-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Casey's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Casey's theorem\", CC BY-SA 4.0) states: In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","support":[{"end":267,"quote":"In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","source_id":"wikipedia.article.casey-s-theorem","source_sha256":"2c09d5bfd02f052555288684934c532f32afe85c4a7336e473287e270a02eb5f","start":103}],"target_id":"theory.wikipedia.casey-s-theorem","target_kind":"node","target_sha256":"db3059daf569e6d5f71c97c059d83805135a70c6d74a882946dedf657e277fa7"}],"theory.wikipedia.cauchy-s-theorem-geometry":[{"id":"assertion.theory.wikipedia.cauchy-s-theorem-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy's theorem (geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy's theorem (geometry)\", CC BY-SA 4.0) states: Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","support":[{"end":185,"quote":"Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","source_id":"wikipedia.article.cauchy-s-theorem-geometry","source_sha256":"26be3a6f558cc9e793b022567f632e0d7d38456920ffa71cb78947b7ad6b8177","start":114}],"target_id":"theory.wikipedia.cauchy-s-theorem-geometry","target_kind":"node","target_sha256":"92f0a8ac42f16c17f08b04f474736247e768e98813c76510091233e2b48ca7c3"}],"theory.wikipedia.cayley-hamilton-theorem":[{"id":"assertion.theory.wikipedia.cayley-hamilton-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cayley–Hamilton theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cayley–Hamilton theorem\", CC BY-SA 4.0) states: In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","support":[{"end":382,"quote":"In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","source_id":"wikipedia.article.cayley-hamilton-theorem","source_sha256":"e3b521bccfdc018c4a162d8ffb20f7f9b100b22fb2f0a1282a65590a992882d9","start":109}],"target_id":"theory.wikipedia.cayley-hamilton-theorem","target_kind":"node","target_sha256":"9a06916445bb180ef71ab0194aa03c4ce83355a234ac3f4429ac0dfd4fae225e"}],"theory.wikipedia.centered-polygonal-number-theorem":[{"id":"assertion.theory.wikipedia.centered-polygonal-number-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centered polygonal number theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centered polygonal number theorem\", CC BY-SA 4.0) states: In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","support":[{"end":270,"quote":"In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","source_id":"wikipedia.article.centered-polygonal-number-theorem","source_sha256":"1f5e3fba736d2a36e9dc61368e685d7847c36c3a1e92f12fe3f45dbb6863c867","start":121}],"target_id":"theory.wikipedia.centered-polygonal-number-theorem","target_kind":"node","target_sha256":"a79ac7b3a61321938acb8fe59ec99960fb20ed140ae4806c7e8cab7dbaab98d2"}],"theory.wikipedia.chowla-mordell-theorem":[{"id":"assertion.theory.wikipedia.chowla-mordell-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chowla–Mordell theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chowla–Mordell theorem\", CC BY-SA 4.0) states: In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","support":[{"end":301,"quote":"In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","source_id":"wikipedia.article.chowla-mordell-theorem","source_sha256":"185044517018347d77e5b0b783bf8adc459d4119227da61e684a3603c08d5ef1","start":108}],"target_id":"theory.wikipedia.chowla-mordell-theorem","target_kind":"node","target_sha256":"37f9774fc252aa47f5d507f58e3f66944bae82613b685e4d112693b6dbb71197"}],"theory.wikipedia.commandino-s-theorem":[{"id":"assertion.theory.wikipedia.commandino-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commandino's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commandino's theorem\", CC BY-SA 4.0) states: Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","support":[{"end":284,"quote":"Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","source_id":"wikipedia.article.commandino-s-theorem","source_sha256":"b053c145ebe85cf21c5a95b1eeca54376f80e9de58ee9f2316f58ffa46671c82","start":108}],"target_id":"theory.wikipedia.commandino-s-theorem","target_kind":"node","target_sha256":"2e13c89103b929e6d8270ab9e90ac8e5784ad16b2daa8fd848b7a9b22dc4dd77"}],"theory.wikipedia.constant-chord-theorem":[{"id":"assertion.theory.wikipedia.constant-chord-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constant chord theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constant chord theorem\", CC BY-SA 4.0) states: The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","support":[{"end":238,"quote":"The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","source_id":"wikipedia.article.constant-chord-theorem","source_sha256":"a948fe1de0278a7ca4954df662aa166daa7725c797aece847bbda139feba971c","start":110}],"target_id":"theory.wikipedia.constant-chord-theorem","target_kind":"node","target_sha256":"34461700b3f38c7b9701f748a81078bd4fdd825ae987989c42c6340ae1f083f5"}],"theory.wikipedia.cut-elimination-theorem":[{"id":"assertion.theory.wikipedia.cut-elimination-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cut-elimination theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cut-elimination theorem\", CC BY-SA 4.0) states: The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","support":[{"end":238,"quote":"The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","source_id":"wikipedia.article.cut-elimination-theorem","source_sha256":"3ff287001439f6e7925b94bc3b6936a67cc52c8b67274e80009733deccaa7e55","start":109}],"target_id":"theory.wikipedia.cut-elimination-theorem","target_kind":"node","target_sha256":"21e11af8c23610471e860e9920b32e620acf8f3dcf6ebf19b2190a7e6dc7e1e2"}],"theory.wikipedia.cyclic-surgery-theorem":[{"id":"assertion.theory.wikipedia.cyclic-surgery-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cyclic surgery theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cyclic surgery theorem\", CC BY-SA 4.0) states: In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","support":[{"end":571,"quote":"In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","source_id":"wikipedia.article.cyclic-surgery-theorem","source_sha256":"5db5ecac042fb3c6c0f23b6ce67416b9ca6bea07223c5a83f5ba2a63a9f7e3d5","start":110}],"target_id":"theory.wikipedia.cyclic-surgery-theorem","target_kind":"node","target_sha256":"dd4dfea783c55f2a7ae17a2496f185c494e88ee601a6683be159228cfc3c79d9"}],"theory.wikipedia.dehn-s-lemma":[{"id":"assertion.theory.wikipedia.dehn-s-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dehn's lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dehn's lemma\", CC BY-SA 4.0) states: In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","support":[{"end":397,"quote":"In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","source_id":"wikipedia.article.dehn-s-lemma","source_sha256":"402cfd4728cc8e0ad419f656d394356a89c804269ac7655ecb9076aad918b9b5","start":99}],"target_id":"theory.wikipedia.dehn-s-lemma","target_kind":"node","target_sha256":"869b2797d3682fe0f4d392f864d5b73cec1ffd838e4e2dd75ccf1ea7aa08cfda"}],"theory.wikipedia.donaldson-s-theorem":[{"id":"assertion.theory.wikipedia.donaldson-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Donaldson's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Donaldson's theorem\", CC BY-SA 4.0) states: In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","support":[{"end":310,"quote":"In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","source_id":"wikipedia.article.donaldson-s-theorem","source_sha256":"9e939377f7de6c5a3709fc2c03e1589e8f7bdd298281595401e4487f71606935","start":106}],"target_id":"theory.wikipedia.donaldson-s-theorem","target_kind":"node","target_sha256":"4338050bb88dc76bad72d21b435fc1acac46a46ee25c4eb5acaed8411b04e397"}],"theory.wikipedia.double-suspension-theorem":[{"id":"assertion.theory.wikipedia.double-suspension-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double suspension theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double suspension theorem\", CC BY-SA 4.0) states: In geometric topology, the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","support":[{"end":309,"quote":"In geometric topology,  the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","source_id":"wikipedia.article.double-suspension-theorem","source_sha256":"b1021be9eeff37d32d54410c1415eda62659c5a5cf7df5927b7cdfac7a63f492","start":113}],"target_id":"theory.wikipedia.double-suspension-theorem","target_kind":"node","target_sha256":"87d23ed8c868d367edcc751335ae3b342209368b04dddf87b93d465d55dbaa12"}],"theory.wikipedia.eilenberg-watts-theorem":[{"id":"assertion.theory.wikipedia.eilenberg-watts-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eilenberg–Watts theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eilenberg–Watts theorem\", CC BY-SA 4.0) states: In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","support":[{"end":291,"quote":"In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","source_id":"wikipedia.article.eilenberg-watts-theorem","source_sha256":"5fddc0547dae5ccf0e90489d017f6651d8fa9b8425ddcfc050082e35c5bef9a7","start":111}],"target_id":"theory.wikipedia.eilenberg-watts-theorem","target_kind":"node","target_sha256":"2c6697dca9a46c8db962508dc432b5d50959cc37c381d3b69e58b3c7c7b0e3d7"}],"theory.wikipedia.excision-theorem":[{"id":"assertion.theory.wikipedia.excision-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Excision theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Excision theorem\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","support":[{"end":250,"quote":"In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","source_id":"wikipedia.article.excision-theorem","source_sha256":"6b7107d69372f8c7187a9a57726af898a1005cd1bdd7772b71868a96e89fe5fd","start":103}],"target_id":"theory.wikipedia.excision-theorem","target_kind":"node","target_sha256":"d01b5bdbdec82a5f89344ecb1725aa4ff82a4e7b71c3f95b767d7b77a7d2abc4"}],"theory.wikipedia.f-ry-milnor-theorem":[{"id":"assertion.theory.wikipedia.f-ry-milnor-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fáry–Milnor theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fáry–Milnor theorem\", CC BY-SA 4.0) states: In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","support":[{"end":298,"quote":"In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","source_id":"wikipedia.article.f-ry-milnor-theorem","source_sha256":"b633851b807101bcaf95f4cdddbf1d07ccddcc1e98916169d8fafcf0469cf48f","start":106}],"target_id":"theory.wikipedia.f-ry-milnor-theorem","target_kind":"node","target_sha256":"83b4ab930d7adba0d8a03e12cd41db431d987d8af763ac7d838f0dfdb207784a"}],"theory.wikipedia.gauss-s-lemma-riemannian-geometry":[{"id":"assertion.theory.wikipedia.gauss-s-lemma-riemannian-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gauss's lemma (Riemannian geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gauss's lemma (Riemannian geometry)\", CC BY-SA 4.0) states: In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","support":[{"end":302,"quote":"In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","source_id":"wikipedia.article.gauss-s-lemma-riemannian-geometry","source_sha256":"6bbc10bc090c6e6d7c6a17829cb33a3185187138fce6e8cb9c8b6b99815b8b9b","start":123}],"target_id":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","target_kind":"node","target_sha256":"484eeaaacdd878fbd989e7b54e5a7865afbe7d604f6297fb72f6910855a95a00"}],"theory.wikipedia.hilbert-burch-theorem":[{"id":"assertion.theory.wikipedia.hilbert-burch-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hilbert–Burch theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hilbert–Burch theorem\", CC BY-SA 4.0) states: In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","support":[{"end":297,"quote":"In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","source_id":"wikipedia.article.hilbert-burch-theorem","source_sha256":"542ce60770b26f8d0e01add5104bdc2a394bc1490b7b20010a537cc2ccd67604","start":109}],"target_id":"theory.wikipedia.hilbert-burch-theorem","target_kind":"node","target_sha256":"85e01b8b8bf5eeb2b0b5d58906507ed9884cbaf351dd66449dc763faf32084fc"}],"theory.wikipedia.hochster-roberts-theorem":[{"id":"assertion.theory.wikipedia.hochster-roberts-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hochster–Roberts theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hochster–Roberts theorem\", CC BY-SA 4.0) states: In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","support":[{"end":317,"quote":"In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","source_id":"wikipedia.article.hochster-roberts-theorem","source_sha256":"1b8246e2e1a094b66238f1c975c2ca6c67df4a279e3efc99d0b198e2a05a2828","start":112}],"target_id":"theory.wikipedia.hochster-roberts-theorem","target_kind":"node","target_sha256":"e9a19d859d1e4d08a6c9123e1dc8d43d0fecaffac8b5bdb14afd7b8a5b2cf3cd"}],"theory.wikipedia.hua-s-lemma":[{"id":"assertion.theory.wikipedia.hua-s-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hua's lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hua's lemma\", CC BY-SA 4.0) states: In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","support":[{"end":187,"quote":"In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","source_id":"wikipedia.article.hua-s-lemma","source_sha256":"8f4164687ed28ec6f66443b07f566b5ea4f679d86258ad3d65256ceacc1ff964","start":98}],"target_id":"theory.wikipedia.hua-s-lemma","target_kind":"node","target_sha256":"f85dc98cf97a9837e97020db9751baa17a98ce9a13d895ebeab3e70c90ff3f4a"}],"theory.wikipedia.jacobson-bourbaki-theorem":[{"id":"assertion.theory.wikipedia.jacobson-bourbaki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jacobson–Bourbaki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jacobson–Bourbaki theorem\", CC BY-SA 4.0) states: In algebra, the Jacobson–Bourbaki theorem is a theorem used to extend Galois theory to field extensions that need not be separable.","support":[{"end":245,"quote":"In algebra, the Jacobson–Bourbaki theorem is a theorem used to  extend Galois theory to field extensions that need not be separable.","source_id":"wikipedia.article.jacobson-bourbaki-theorem","source_sha256":"c00f2745ddbda3c76e50fcd12b799f3b0aab0d8aa698228ee02d955f7a152e43","start":113}],"target_id":"theory.wikipedia.jacobson-bourbaki-theorem","target_kind":"node","target_sha256":"c3638184b25659056a7cb3003c33fa8687e9cc5f6fa4c06f9909ef725e054d23"}],"theory.wikipedia.koecher-vinberg-theorem":[{"id":"assertion.theory.wikipedia.koecher-vinberg-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Koecher–Vinberg theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Koecher–Vinberg theorem\", CC BY-SA 4.0) states: In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","support":[{"end":213,"quote":"In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","source_id":"wikipedia.article.koecher-vinberg-theorem","source_sha256":"2a0a0e4e180e50d8d3673ae9f9101a94ca6ebfb7ae4e6efa03f9f874f941098a","start":111}],"target_id":"theory.wikipedia.koecher-vinberg-theorem","target_kind":"node","target_sha256":"24105043f4e4ee1b7078e6f2c5045a96f3296b9d8cd41c90746bb5309c797549"}],"theory.wikipedia.krull-akizuki-theorem":[{"id":"assertion.theory.wikipedia.krull-akizuki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Krull–Akizuki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Krull–Akizuki theorem\", CC BY-SA 4.0) states: In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","support":[{"end":263,"quote":"In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","source_id":"wikipedia.article.krull-akizuki-theorem","source_sha256":"08b6eccc32754b34c16a0fff80f2686d890dd9bb3eee57efba6f676b23fbc5e5","start":109}],"target_id":"theory.wikipedia.krull-akizuki-theorem","target_kind":"node","target_sha256":"c546bd3e1eeab6c7c0ea1c1f3fdc0d0e31ae5c1bf113a05a918c88ed2af502f5"}],"theory.wikipedia.monotone-convergence-theorem":[{"id":"assertion.theory.wikipedia.monotone-convergence-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Monotone convergence theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Monotone convergence theorem\", CC BY-SA 4.0) states: In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","support":[{"end":337,"quote":"In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","source_id":"wikipedia.article.monotone-convergence-theorem","source_sha256":"5f81d70222e0798beb94672769a983271d147b60078f2e730f4b468ffb26d63e","start":114}],"target_id":"theory.wikipedia.monotone-convergence-theorem","target_kind":"node","target_sha256":"004673dc2fa251a7067bdb9f123367e182fda86333f2e70f26b25ed3cfaec7c4"}],"theory.wikipedia.tarski-s-undefinability-theorem":[{"id":"assertion.theory.wikipedia.tarski-s-undefinability-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tarski's undefinability theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tarski's undefinability theorem\", CC BY-SA 4.0) states: Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","support":[{"end":307,"quote":"Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","source_id":"wikipedia.article.tarski-s-undefinability-theorem","source_sha256":"d4043e6ed830efaa012f70c4567b673d9dcfe245dad8970d595aac160d403c56","start":117}],"target_id":"theory.wikipedia.tarski-s-undefinability-theorem","target_kind":"node","target_sha256":"9ac0c2a6c2c358982dace3b5d511efb4a99c860a7d50d4d2d2c4e8766f4413c2"}]},"nodes":[{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.self-other","kind":"origin","label":"Self / other","sources":[],"status":"foundational","summary":"Distinguishing one's own body and agency from other entities.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.living-dead","kind":"origin","label":"Living / dead","sources":[],"status":"foundational","summary":"Distinguishing living organisms from dead matter or remains.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.safe-danger","kind":"origin","label":"Safe / dangerous","sources":[],"status":"foundational","summary":"Learning and transmitting threat distinctions.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.edible-toxic","kind":"origin","label":"Edible / harmful","sources":[],"status":"foundational","summary":"Learning which materials can be consumed or should be avoided.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.place","kind":"origin","label":"Here / there","sources":[],"status":"foundational","summary":"Spatial distinction and remembered location.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.cause-effect","kind":"origin","label":"Cause / effect","sources":[],"status":"foundational","summary":"Learning repeatable relations between actions and consequences.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.time-cycle","kind":"origin","label":"Day / night / cycles","sources":[],"status":"foundational","summary":"Recognition of recurring temporal and environmental patterns.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.kin-social","kind":"origin","label":"Kin / stranger / group","sources":[],"status":"foundational","summary":"Social recognition, affiliation, obligation, and threat.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.material","kind":"origin","label":"Material properties","sources":[],"status":"foundational","summary":"Practical distinctions such as hard/soft, sharp/dull, brittle/flexible.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.quantity","kind":"origin","label":"More / less / number","sources":[],"status":"foundational","summary":"Approximate quantity and eventually explicit counting.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.fire","kind":"practice","label":"Controlled fire","sources":[],"status":"established","summary":"Use of controlled combustion for heat, cooking, protection, landscape modification, and materials processing.","tags":[]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.toolmaking","kind":"practice","label":"Toolmaking","sources":[],"status":"established","summary":"Deliberate shaping and use of external objects to alter the environment.","tags":[]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.tracking","kind":"practice","label":"Tracking & ecological inference","sources":[],"status":"established","summary":"Inferring animals, weather, resources, and recent events from traces.","tags":[]},{"aliases":[],"domain":"humanities","era":"origins","frontier":false,"id":"practice.oral-tradition","kind":"practice","label":"Oral tradition","sources":[],"status":"foundational","summary":"Transmission of knowledge through speech, story, ritual, demonstration, and memory.","tags":[]},{"aliases":[],"domain":"formal","era":"agrarian","frontier":false,"id":"concept.counting","kind":"concept","label":"Counting","sources":[],"status":"established","summary":"Explicit symbolic or systematic enumeration of quantities.","tags":[]},{"aliases":[],"domain":"formal","era":"agrarian","frontier":false,"id":"field.geometry","kind":"field","label":"Geometry","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of shape, space, measurement, and spatial relations.","tags":[]},{"aliases":[],"domain":"humanities","era":"agrarian","frontier":false,"id":"practice.writing","kind":"practice","label":"Writing & records","sources":[],"status":"established","summary":"Durable external symbolic records that allow knowledge to outlive individual memory.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.astronomy","kind":"field","label":"Astronomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.dd44e18a1fa393e60806","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001256","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001256"}],"status":"reported","summary":"NLM MeSH describes Astronomy as: The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"practice.agriculture","kind":"practice","label":"Agriculture","sources":[{"id":"usgs-thesaurus.8faa7636b7aa8527a5ab","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=24","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=24"}],"status":"reported","summary":"USGS Thesaurus defines Agriculture as: The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","tags":[]},{"aliases":[],"domain":"health","era":"agrarian","frontier":false,"id":"practice.medicine","kind":"practice","label":"Early medicine","sources":[],"status":"historical","summary":"Early healing practices combining empirical remedies, surgery, ritual, and inherited explanations.","tags":[]},{"aliases":[],"domain":"social","era":"agrarian","frontier":false,"id":"concept.law","kind":"concept","label":"Codified law","sources":[],"status":"active","summary":"Externalized rules and procedures for social governance.","tags":[]},{"aliases":[],"domain":"earth","era":"agrarian","frontier":false,"id":"field.navigation","kind":"field","label":"Navigation","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Knowledge and methods for determining position and direction across terrain and water.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.logic","kind":"field","label":"Logic","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.a39a42601f13cc4e3244","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D008128","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008128"}],"status":"reported","summary":"NLM MeSH describes Logic as: The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.philosophy","kind":"field","label":"Philosophy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.ed675d30c3b71c4b6263","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010684","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010684"}],"status":"reported","summary":"NLM MeSH describes Philosophy as: A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.anatomy","kind":"field","label":"Anatomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh","title":"NLM Medical Subject Headings (MeSH)","url":"https://www.nlm.nih.gov/mesh/meshhome.html"},{"id":"nlm-mesh.0b589dd05c92deac1e04","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000715","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000715"}],"status":"reported","summary":"NLM MeSH describes Anatomy as: A branch of biology dealing with the structure of organisms.","tags":[]},{"aliases":[],"domain":"formal","era":"classical","frontier":false,"id":"field.algebra","kind":"field","label":"Algebra","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Symbolic study of operations, relations, equations, and abstract structures.","tags":[]},{"aliases":[],"domain":"physical","era":"classical","frontier":false,"id":"field.optics","kind":"field","label":"Optics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of light, vision, and optical phenomena.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.cartography","kind":"field","label":"Cartography","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.5381093d44dfea691929","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=147","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=147"}],"status":"reported","summary":"USGS Thesaurus defines Cartography as: The science and art of making maps.","tags":[]},{"aliases":[],"domain":"roots","era":"early-modern","frontier":false,"id":"method.scientific","kind":"method","label":"Experimental scientific method","sources":[],"status":"established","summary":"Iterative observation, measurement, hypothesis testing, controlled comparison, and public reproducibility.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.physics","kind":"field","label":"Physics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.c9083b1f6c559b444afe","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010825","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010825"}],"status":"reported","summary":"NLM MeSH describes Physics as: The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.chemistry","kind":"field","label":"Chemistry","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.67a1950c3c2557253dd5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D002621","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002621"}],"status":"reported","summary":"NLM MeSH describes Chemistry as: A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.geology","kind":"field","label":"Geology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.91b39721167a39a9ed03","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=464","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=464"}],"status":"reported","summary":"USGS Thesaurus defines Geology as: Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.biology","kind":"field","label":"Biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.5934874aa38f9094fd81","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001695","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001695"}],"status":"reported","summary":"NLM MeSH describes Biology as: One of the BIOLOGICAL SCIENCE DISCIPLINES concerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"early-modern","frontier":false,"id":"field.taxonomy","kind":"field","label":"Taxonomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Theory and practice of classification and naming.","tags":["ology"]},{"aliases":[],"domain":"formal","era":"early-modern","frontier":false,"id":"field.statistics","kind":"field","label":"Statistics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Methods for learning from variable data and quantifying uncertainty.","tags":[]},{"aliases":[],"domain":"physical","era":"classical","frontier":false,"id":"claim.geocentric","kind":"claim","label":"Geocentric planetary model","sources":[],"status":"invalidated","summary":"Historical Earth-centered planetary models fail as general physical descriptions of planetary motion and have been superseded by heliocentric and celestial-mechanical models.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"claim.phlogiston","kind":"claim","label":"Phlogiston theory","sources":[],"status":"invalidated","summary":"Historical theory positing a fire-like substance released during combustion; superseded by oxygen-based chemistry.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"claim.miasma","kind":"claim","label":"Miasma disease theory","sources":[],"status":"invalidated","summary":"Historical theory attributing many diseases to harmful bad air; superseded for infectious disease causation by germ theory and modern epidemiology.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"concept.phlogiston-program","kind":"concept","label":"Phlogiston chemistry program","sources":[],"status":"historical","summary":"A historical explanatory program built around phlogiston.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"practice.miasma-control","kind":"practice","label":"Miasma-based disease control","sources":[],"status":"historical","summary":"Public-health interventions justified specifically by miasma causation; some sanitation actions helped for reasons the theory did not correctly identify.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"claim.germ-theory","kind":"claim","label":"Germ theory of infectious disease","sources":[],"status":"established","summary":"Many infectious diseases are caused by microorganisms and transmissible biological agents.","tags":[]},{"aliases":[],"domain":"life","era":"industrial-modern","frontier":false,"id":"claim.evolution","kind":"claim","label":"Evolution by natural selection","sources":[],"status":"established","summary":"Heritable variation combined with differential reproduction can drive adaptive evolutionary change.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.genetics","kind":"field","label":"Genetics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.55d3172c77bc4f57a64a","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=433","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=433"}],"status":"reported","summary":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.ecology","kind":"field","label":"Ecology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.54a47b5a480dee09e51c","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=311","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=311"}],"status":"reported","summary":"USGS Thesaurus defines Ecology as: Study of the relations between living plants and animals and their environment.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.microbiology","kind":"field","label":"Microbiology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.dcab6f768c008f0c2c69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=735","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=735"}],"status":"reported","summary":"USGS Thesaurus defines Microbiology as: Branch of biology dealing with organisms too small to be seen without the use of a microscope.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.thermodynamics","kind":"field","label":"Thermodynamics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"url":"https://www.nist.gov/thermodynamics"}],"status":"active","summary":"Study of energy, heat, work, entropy, and macroscopic state relations.","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"field.electromagnetism","kind":"field","label":"Electromagnetism","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Unified study of electric and magnetic fields and interactions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.sociology","kind":"field","label":"Sociology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.902611a238e10eb5c9bf","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012961"}],"status":"reported","summary":"NLM MeSH describes Sociology as: A social science dealing with group relationships, patterns of collective behavior, and social organization.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.psychology","kind":"field","label":"Psychology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.7d823551929a4fc3072e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011584","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011584"}],"status":"reported","summary":"NLM MeSH describes Psychology as: The science dealing with the study of mental processes and behavior in man and animals.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.anthropology","kind":"field","label":"Anthropology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.bcc9794e5c2487d85964","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000883","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000883"}],"status":"reported","summary":"NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.archaeology","kind":"field","label":"Archaeology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.76d8813e0d4330d9aaf5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001106"}],"status":"reported","summary":"NLM MeSH describes Archaeology as: Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.economics","kind":"field","label":"Economics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.3b75ab5915b79fbe20b6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004467","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004467"}],"status":"reported","summary":"NLM MeSH describes Economics as: The science of utilization, distribution, and consumption of services and materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"industrial-modern","frontier":false,"id":"field.engineering","kind":"field","label":"Engineering science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Application of scientific and mathematical knowledge to design and build systems.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"claim.relativity","kind":"claim","label":"Relativity","sources":[],"status":"established","summary":"Special and general relativity describe spacetime, gravitation, and relativistic motion across tested regimes.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"claim.quantum","kind":"claim","label":"Quantum mechanics","sources":[],"status":"established","summary":"Quantum theory models microscopic systems using probabilistic amplitudes, operators, and quantized observables.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.cosmology","kind":"field","label":"Cosmology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"url":"https://science.nasa.gov/universe/the-big-bang/"}],"status":"active","summary":"Study of the origin, structure, evolution, and large-scale dynamics of the universe.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.molecular-biology","kind":"field","label":"Molecular biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.d2d1d971931c29ceef7f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=756","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=756"}],"status":"reported","summary":"USGS Thesaurus defines Molecular biology as: Branch of biology concerned with the study of physiology at the molecular level.","tags":["ology"]},{"aliases":[],"domain":"information","era":"twentieth","frontier":false,"id":"field.neuroscience","kind":"field","label":"Neuroscience","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of nervous systems, neural computation, development, function, and disease.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.computer-science","kind":"field","label":"Computer science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.c12f0d8d6bc2875dfd18","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190"}],"status":"reported","summary":"USGS Thesaurus defines Computer science as: Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.information-theory","kind":"field","label":"Information theory","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.29527d691d2b917a2f70","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D007257","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007257"}],"status":"reported","summary":"NLM MeSH describes Information theory as: An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and CYBERNETICS .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.ai","kind":"field","label":"Artificial intelligence","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.8fdf3c0558d0b89101fb","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001185","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001185"}],"status":"reported","summary":"NLM MeSH describes Artificial intelligence as: Theory and development of COMPUTER SYSTEMS which perform tasks that normally require human intelligence. Such tasks may include speech recognition, LEARNING ; VISUAL PERCEPTION ; MATHEMATICAL COMPUTING ; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.cognitive-science","kind":"field","label":"Cognitive science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.3afa87c4efa263dea007","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019336"}],"status":"reported","summary":"NLM MeSH describes Cognitive science as: The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.epidemiology","kind":"field","label":"Epidemiology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh","title":"NLM Medical Subject Headings (MeSH)","url":"https://www.nlm.nih.gov/mesh/meshhome.html"},{"id":"nlm-mesh.ca259dbfe57d6af9326c","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004813"}],"status":"reported","summary":"NLM MeSH describes Epidemiology as: Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.systems-biology","kind":"field","label":"Systems biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.ac32a89227fa482fcba6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D049490","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049490"}],"status":"reported","summary":"NLM MeSH describes Systems biology as: Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.climatology","kind":"field","label":"Climatology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.e70c8d2c1e03ea23b093","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170"}],"status":"reported","summary":"USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.quantum-gravity","kind":"question","label":"Quantum gravity","sources":[],"status":"frontier","summary":"How can gravity and quantum theory be reconciled in a predictive, empirically grounded framework?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.dark-matter","kind":"question","label":"Nature of dark matter","sources":[],"status":"frontier","summary":"What accounts for the gravitational phenomena attributed to dark matter?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.dark-energy","kind":"question","label":"Nature of dark energy","sources":[],"status":"frontier","summary":"What explains the observed accelerated expansion of the universe?","tags":["frontier"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"question.origin-life","kind":"question","label":"Origin of life","sources":[],"status":"frontier","summary":"Which chemical and environmental pathways produced the first self-sustaining evolving systems?","tags":["frontier"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"question.consciousness","kind":"question","label":"Mechanistic basis of consciousness","sources":[],"status":"frontier","summary":"Which physical and computational properties are sufficient and necessary for conscious experience?","tags":["frontier"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"question.aging","kind":"question","label":"Comprehensive control of biological aging","sources":[],"status":"frontier","summary":"Which causal mechanisms of aging can be safely modified to extend healthy function?","tags":["frontier"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"question.predict-climate","kind":"question","label":"High-resolution climate predictability","sources":[],"status":"frontier","summary":"How far can coupled climate dynamics be predicted at useful local resolution under changing forcing?","tags":["frontier"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"question.general-ai","kind":"question","label":"General machine intelligence","sources":[],"status":"frontier","summary":"Which architectures can robustly generalize, plan, learn, and self-correct across open-ended domains?","tags":["frontier"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"question.math-foundations","kind":"question","label":"Limits of formal reasoning","sources":[],"status":"frontier","summary":"What new formal structures best characterize provability, computation, complexity, and mathematical discovery?","tags":["frontier"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"question.social-prediction","kind":"question","label":"Reliable social-system prediction","sources":[],"status":"frontier","summary":"Which aspects of large-scale social behavior can be predicted without destroying validity through intervention and adaptation?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"smoke.automate-merge","kind":"concept","label":"Automate merge smoke","sources":[{"kind":"primary","title":"Nemesis","url":"https://github.com/mikecreation/ZotBot"}],"status":"active","summary":"Proves Brain auto-merge after Open PR when Automate is on.","tags":["smoke"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.dark-energy","kind":"field","label":"Dark energy","sources":[{"id":"desi-science-mission","kind":"collaboration","title":"the DESI science mission","url":"https://www.desi.lbl.gov/the-desi-science-mission/"},{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","summary":"Research program investigating the cause and possible evolution of late-time cosmic acceleration.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cosmic-acceleration","kind":"concept","label":"Late-time cosmic acceleration","sources":[],"status":"established","summary":"Observed accelerated expansion whose physical cause remains unresolved.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.lambda-cdm","kind":"theory","label":"LambdaCDM","sources":[{"id":"desi-lya-2026","kind":"collaboration","title":"New DESI DR2 Lyman-alpha Results Shed Light on Dark Energy","url":"https://www.desi.lbl.gov/2026/07/30/new-desi-dr2-lyman-alpha-results-shed-light-on-dark-energy/"},{"id":"lvk-o4b-cosmology","kind":"collaboration","title":"Latest constraints on cosmic expansion and general relativity with gravitational waves","url":"https://ligo.org/science-summaries/o4b_cosmology/"},{"url":"https://science.nasa.gov/universe/overview/"}],"status":"active","summary":"Standard cosmological model combining cold dark matter with a cosmological constant.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cosmological-constant-de","kind":"theory","label":"Cosmological constant as dark energy","sources":[],"status":"disputed","summary":"Constant vacuum-energy explanation of acceleration; current datasets test departures from it.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.wcdm","kind":"theory","label":"wCDM","sources":[{"id":"des-y6-dark-energy","kind":"collaboration","title":"DES Y6 Cosmology Papers","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Cosmological extension in which dark energy has a constant equation-of-state parameter w that need not equal minus one.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"physical.w0wa-cdm","kind":"theory","label":"w0waCDM","sources":[{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Extension allowing dark energy to evolve with scale factor.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"physical.evolving-dark-energy","kind":"concept","label":"Evolving dark energy","sources":[{"url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"}],"status":"active","summary":"Hypothesis that dark-energy density or equation of state changes over cosmic time.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.bao","kind":"method","label":"Baryon acoustic oscillations","sources":[{"id":"desi-dr2-guide","url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"},{"id":"desi-science-mission","kind":"collaboration","title":"the DESI science mission","url":"https://www.desi.lbl.gov/the-desi-science-mission/"},{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","summary":"Standard-ruler technique using the characteristic clustering scale inherited from early-universe acoustic waves to constrain cosmic expansion.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi-dr2-bao","kind":"dataset","label":"DESI DR2 BAO cosmology","sources":[{"id":"desi-dr2","url":"https://data.desi.lbl.gov/doc/papers/dr2/"},{"id":"desi-dr2-guide","kind":"collaboration","title":"DESI DR2 Results: March 19 Guide","url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"},{"id":"desi-dr2-publications","kind":"collaboration","title":"DESI DR2 Publications","url":"https://data.desi.lbl.gov/doc/papers/dr2/"},{"url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"}],"status":"active","summary":"Cosmological baryon-acoustic-oscillation measurements and constraints derived from DESI's first three survey years.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi-dr2-lya-fullshape","kind":"dataset","label":"DESI DR2 Lyman-alpha full-shape","sources":[{"id":"desi-lya-2026","url":"https://www.desi.lbl.gov/2026/07/30/new-desi-dr2-lyman-alpha-results-shed-light-on-dark-energy/"}],"status":"active","summary":"Full-shape Lyman-alpha forest analysis providing improved cosmological constraints and discrimination between competing dark-energy models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.des-y6-dark-energy","kind":"dataset","label":"DES Year 6 dark-energy constraints","sources":[{"id":"des-y6","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"id":"des-y6-dark-energy","kind":"collaboration","title":"DES Y6 Cosmology Papers","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Full six-year Dark Energy Survey multi-probe constraints on constant and dynamical dark-energy models.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.standard-model-particle-physics","kind":"theory","label":"Standard Model of particle physics","sources":[{"id":"cern-standard-model","kind":"official","title":"The Standard Model","url":"https://home.cern/science/physics/standard-model/"},{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","summary":"Framework describing fundamental particles and three of the four fundamental interactions.","tags":[]},{"aliases":["Gravitational-wave laser interferometry"],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gravitational-wave-interferometry","kind":"method","label":"Gravitational-wave interferometry","sources":[{"id":"ligo-gw150914-detectors","kind":"collaboration","title":"GW150914: The Advanced LIGO detectors in the era of first discoveries","url":"https://ligo.org/science-summaries/GW150914Detector/"},{"url":"https://ligo.org/science-summaries/GW150914Detector/"}],"status":"active","summary":"Laser-interferometric measurement of differential length changes produced by passing gravitational waves.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw150914","kind":"dataset","label":"GW150914","sources":[{"id":"ligo-gw150914","kind":"collaboration","title":"GW150914","url":"https://ligo.org/detections/gw150914/"},{"url":"https://ligo.org/detections/gw150914/"}],"status":"active","summary":"First directly detected gravitational-wave event, associated with a binary black-hole merger.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.si-defining-constants","kind":"concept","label":"SI defining constants","sources":[{"id":"nist-meet-constants","kind":"standards-body","title":"Meet the Constants","url":"https://www.nist.gov/si-redefinition/meet-constants"},{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","summary":"Seven fixed constants that define the modern International System of Units.","tags":[]},{"aliases":["CODATA fundamental physical constants"],"domain":"physical","era":"frontier","frontier":false,"id":"physical.codata-fundamental-constants","kind":"dataset","label":"CODATA fundamental constants","sources":[{"id":"nist-fundamental-constants","kind":"standards-body","title":"Fundamental Physical Constants","url":"https://www.nist.gov/pml/fundamental-physical-constants"},{"id":"nist-codata-2022","kind":"standards-body","title":"CODATA Recommended Values of the Fundamental Physical Constants: 2022","url":"https://www.nist.gov/publications/codata-recommended-values-fundamental-physical-constants-2022"},{"url":"https://www.nist.gov/pml/fundamental-physical-constants"}],"status":"active","summary":"Internationally recommended values and conversion factors for fundamental physical constants.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.precision-metrology","kind":"field","label":"Precision physical metrology","sources":[{"id":"nist-si-units","kind":"standards-body","title":"SI Units","url":"https://www.nist.gov/pml/owm/metric-si/si-units"}],"status":"active","summary":"High-precision measurement science linking physical quantities to stable standards and fundamental constants.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.general-relativity","kind":"theory","label":"General relativity","sources":[{"id":"lvk-o4b-tgr-2026","kind":"collaboration","title":"Testing general relativity with the latest and loudest compact binary merger observations","url":"https://ligo.org/science-summaries/o4b_tgr/"},{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","summary":"Einsteinian theory in which gravitation is described through dynamical spacetime geometry.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw250114","kind":"dataset","label":"GW250114","sources":[{"id":"ligo-gw250114-gr","kind":"collaboration","title":"Exceptional tests of general relativity with GW250114","url":"https://ligo.org/exceptional-tests-of-general-relativity-with-gw250114/"},{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","summary":"Exceptionally loud 2025 binary-black-hole gravitational-wave signal used for stringent strong-field tests of general relativity.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gwtc5-cosmology-gr","kind":"dataset","label":"GWTC-5 cosmology and gravity constraints","sources":[{"id":"lvk-o4b-cosmology","kind":"collaboration","title":"Latest constraints on cosmic expansion and general relativity with gravitational waves","url":"https://ligo.org/science-summaries/o4b_cosmology/"}],"status":"active","summary":"Gravitational-wave catalog analysis using 236 detections to constrain cosmic expansion and test gravitational-wave propagation under general relativity.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"physical.classical-mechanics","kind":"field","label":"Classical mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"physical.newtonian-mechanics","kind":"theory","label":"Newtonian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.lagrangian-mechanics","kind":"method","label":"Lagrangian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.hamiltonian-mechanics","kind":"method","label":"Hamiltonian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.phase-space","kind":"concept","label":"Phase space","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.chaos-theory","kind":"field","label":"Chaos theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.continuum-mechanics","kind":"field","label":"Continuum mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.fluid-dynamics","kind":"field","label":"Fluid dynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.classical-wave-theory","kind":"theory","label":"Classical wave theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.special-relativity","kind":"theory","label":"Special relativity","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.lorentz-transformations","kind":"concept","label":"Lorentz transformations","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.equivalence-principle","kind":"concept","label":"Equivalence principle","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spacetime","kind":"concept","label":"Spacetime","sources":["https://www.einstein-online.info/en/",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.black-holes","kind":"concept","label":"Black holes","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.schwarzschild-solution","kind":"theory","label":"Schwarzschild solution","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.kerr-solution","kind":"theory","label":"Kerr solution","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gravitational-lensing","kind":"method","label":"Gravitational lensing","sources":["https://www.einstein-online.info/en/",{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gravitational-time-dilation","kind":"concept","label":"Gravitational time dilation","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gravitational-waves","kind":"concept","label":"Gravitational waves","sources":["https://www.ligo.org/science/GW-Detecting.php",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.thermodynamic-entropy","kind":"concept","label":"Thermodynamic entropy","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.first-law-thermodynamics","kind":"concept","label":"First law of thermodynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.second-law-thermodynamics","kind":"concept","label":"Second law of thermodynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.statistical-mechanics","kind":"field","label":"Statistical mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.boltzmann-distribution","kind":"concept","label":"Boltzmann distribution","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.partition-function","kind":"concept","label":"Partition function","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.fluctuation-dissipation","kind":"theory","label":"Fluctuation-dissipation relation","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.phase-transitions","kind":"concept","label":"Phase transitions","sources":["https://www.nobelprize.org/prizes/physics/1982/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.renormalization-group","kind":"method","label":"Renormalization group","sources":["https://www.nobelprize.org/prizes/physics/1982/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.condensed-matter-physics","kind":"field","label":"Condensed matter physics","sources":["https://www.nobelprize.org/prizes/physics/2016/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.superconductivity","kind":"concept","label":"Superconductivity","sources":["https://www.nobelprize.org/prizes/physics/1972/summary/",{"url":"https://www.nist.gov/publications/superconductive-materials-and-some-their-properties"},{"id":"nlm-mesh.ea1a6d368c155be3d8c0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000072176","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072176"}],"status":"reported","summary":"NLM MeSH describes Superconductivity as: The ability of an element or metallic alloy to allow the passage of ELECTRONS without ELECTRICAL RESISTANCE and expel MAGNETIC FIELDS below a certain threshold temperature called superconducting transition temperature.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.superfluidity","kind":"concept","label":"Superfluidity","sources":["https://www.nobelprize.org/prizes/physics/2003/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.bose-einstein-condensate","kind":"concept","label":"Bose-Einstein condensate","sources":["https://www.nobelprize.org/prizes/physics/2001/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.band-theory","kind":"theory","label":"Electronic band theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.semiconductor-physics","kind":"field","label":"Semiconductor physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-hall-effect","kind":"concept","label":"Quantum Hall effect","sources":["https://www.nobelprize.org/prizes/physics/1985/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.topological-phases","kind":"field","label":"Topological phases of matter","sources":["https://www.nobelprize.org/prizes/physics/2016/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.phonons","kind":"concept","label":"Phonons","sources":["https://www.feynmanlectures.caltech.edu/",{"id":"nlm-mesh.eec83cc55bf64504604d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D060739","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060739"}],"status":"reported","summary":"NLM MeSH describes Phonons as: Quanta of acoustic energy which move at the speed of sound.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.density-functional-theory","kind":"theory","label":"Density functional theory","sources":["https://www.nobelprize.org/prizes/chemistry/1998/summary/",{"id":"nlm-mesh.7ab391e314472715de34","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000077318","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077318"}],"status":"reported","summary":"NLM MeSH describes Density functional theory as: A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.atomic-physics","kind":"field","label":"Atomic physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.molecular-physics","kind":"field","label":"Molecular physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spectroscopy","kind":"method","label":"Spectroscopy","sources":["https://www.nist.gov/pml/atomic-spectroscopy",{"url":"https://www.nist.gov/quantum-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.laser-physics","kind":"field","label":"Laser physics","sources":["https://www.nobelprize.org/prizes/physics/1964/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.photoelectric-effect","kind":"concept","label":"Photoelectric effect","sources":["https://www.nobelprize.org/prizes/physics/1921/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.compton-scattering","kind":"concept","label":"Compton scattering","sources":["https://www.nobelprize.org/prizes/physics/1927/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-entanglement","kind":"concept","label":"Quantum entanglement","sources":["https://www.nobelprize.org/prizes/physics/2022/summary/",{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.uncertainty-principle","kind":"concept","label":"Uncertainty principle","sources":["https://www.nobelprize.org/prizes/physics/1932/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.schrodinger-equation","kind":"theory","label":"Schrodinger equation","sources":["https://www.nobelprize.org/prizes/physics/1933/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-field-theory","kind":"theory","label":"Quantum field theory","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gauge-symmetry","kind":"concept","label":"Gauge symmetry","sources":["https://home.cern/science/physics/standard-model"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-electrodynamics","kind":"theory","label":"Quantum electrodynamics","sources":["https://pdg.lbl.gov/",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-chromodynamics","kind":"theory","label":"Quantum chromodynamics","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.electroweak-theory","kind":"theory","label":"Electroweak theory","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spontaneous-symmetry-breaking","kind":"concept","label":"Spontaneous symmetry breaking","sources":["https://home.cern/science/physics/higgs-boson"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.higgs-mechanism","kind":"theory","label":"Higgs mechanism","sources":["https://home.cern/science/physics/higgs-boson"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.higgs-boson","kind":"concept","label":"Higgs boson","sources":["https://www.nobelprize.org/prizes/physics/2013/summary/",{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quarks","kind":"concept","label":"Quarks","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.leptons","kind":"concept","label":"Leptons","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gluons","kind":"concept","label":"Gluons","sources":["https://home.cern/science/physics/standard-model"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutrino-oscillation","kind":"concept","label":"Neutrino oscillation","sources":["https://www.nobelprize.org/prizes/physics/2015/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ckm-matrix","kind":"concept","label":"CKM matrix","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cp-violation","kind":"concept","label":"CP violation","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.proton","kind":"concept","label":"Proton","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutron","kind":"concept","label":"Neutron","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-physics","kind":"field","label":"Nuclear physics","sources":["https://science.osti.gov/np",{"id":"nlm-mesh.07b63efcca979228caf2","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009686"}],"status":"reported","summary":"NLM MeSH describes Nuclear physics as: The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.nuclear-shell-model","kind":"theory","label":"Nuclear shell model","sources":["https://science.osti.gov/np"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.radioactive-decay","kind":"concept","label":"Radioactive decay","sources":["https://science.osti.gov/np"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-fission","kind":"concept","label":"Nuclear fission","sources":["https://science.osti.gov/np",{"id":"nlm-mesh.318cd4bb9106898947d3","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009680","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009680"}],"status":"reported","summary":"NLM MeSH describes Nuclear fission as: Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-fusion","kind":"concept","label":"Nuclear fusion","sources":["https://science.osti.gov/fes",{"id":"nlm-mesh.544020cbe017717b1a9e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009681"}],"status":"reported","summary":"NLM MeSH describes Nuclear fusion as: Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.plasma-physics","kind":"field","label":"Plasma physics","sources":["https://science.osti.gov/fes"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.magnetohydrodynamics","kind":"theory","label":"Magnetohydrodynamics","sources":["https://science.osti.gov/fes"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.astrophysics","kind":"field","label":"Astrophysics","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.stellar-evolution","kind":"theory","label":"Stellar evolution","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.hertzsprung-russell-diagram","kind":"method","label":"Hertzsprung-Russell diagram","sources":["https://science.nasa.gov/universe/stars/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.white-dwarfs","kind":"concept","label":"White dwarfs","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutron-stars","kind":"concept","label":"Neutron stars","sources":["https://science.nasa.gov/universe/stars/",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.pulsars","kind":"concept","label":"Pulsars","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.supernovae","kind":"concept","label":"Supernovae","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.accretion-disks","kind":"concept","label":"Accretion disks","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.active-galactic-nuclei","kind":"concept","label":"Active galactic nuclei","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.exoplanet-transit-method","kind":"method","label":"Exoplanet transit method","sources":["https://science.nasa.gov/exoplanets/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-microwave-background","kind":"concept","label":"Cosmic microwave background","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck",{"url":"https://science.nasa.gov/astrophysics/programs/physics-of-the-cosmos/big-bang-and-the-evolution-of-the-universe/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.inflationary-cosmology","kind":"theory","label":"Inflationary cosmology","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.big-bang-nucleosynthesis","kind":"theory","label":"Big Bang nucleosynthesis","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.hubble-lemaitre-law","kind":"concept","label":"Hubble-Lemaitre law","sources":["https://science.nasa.gov/universe/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw-standard-sirens","kind":"method","label":"Gravitational-wave standard sirens","sources":["https://www.ligo.org/science/GW-Detecting.php"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.strong-gravitational-lensing","kind":"method","label":"Strong gravitational lensing","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.weak-gravitational-lensing","kind":"method","label":"Weak gravitational lensing","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.large-scale-structure","kind":"concept","label":"Large-scale structure","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck",{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.baryon-acoustic-oscillations","kind":"method","label":"Baryon acoustic oscillations","sources":["https://www.desi.lbl.gov/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.dark-matter-cosmology","kind":"theory","label":"Dark-matter cosmology","sources":["https://science.nasa.gov/universe/dark-matter-dark-energy/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.quantum-mechanics","kind":"theory","label":"Quantum mechanics","sources":[{"url":"https://www.nist.gov/physics"},{"id":"nlm-mesh.87b2a38d9d82c9b74732","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000098222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098222"}],"status":"reported","summary":"NLM MeSH describes Quantum mechanics as: The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.higgs-field","kind":"concept","label":"Higgs field","sources":[{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutrinos","kind":"concept","label":"Neutrinos","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gauge-bosons","kind":"concept","label":"Gauge bosons","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gluon","kind":"concept","label":"Gluon","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.photon","kind":"concept","label":"Photon","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.w-z-bosons","kind":"concept","label":"W and Z bosons","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.top-quark","kind":"concept","label":"Top quark","sources":[{"url":"https://home.cern/science/accelerators/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.large-hadron-collider","kind":"technology","label":"Large Hadron Collider","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.atlas-detector","kind":"technology","label":"ATLAS detector","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cms-detector","kind":"technology","label":"CMS detector","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.higgs-discovery-2012","kind":"claim","label":"Higgs boson discovery","sources":[{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.binary-black-holes","kind":"concept","label":"Binary black holes","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.binary-neutron-stars","kind":"concept","label":"Binary neutron stars","sources":[{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.ligo","kind":"technology","label":"LIGO","sources":[{"url":"https://ligo.org/science-summaries/GW150914Detector/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.virgo","kind":"technology","label":"Virgo gravitational-wave detector","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.kagra","kind":"technology","label":"KAGRA gravitational-wave detector","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw170817","kind":"dataset","label":"GW170817","sources":[{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.strong-field-gr-tests","kind":"method","label":"Strong-field tests of general relativity","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-expansion","kind":"concept","label":"Cosmic expansion","sources":[{"url":"https://science.nasa.gov/astrophysics/science-questions/how-do-matter-energy-space-and-time-behave-under-the-extraordinarily-diverse-conditions-of-the-cosmos/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.big-bang","kind":"theory","label":"Big Bang cosmology","sources":[{"url":"https://science.nasa.gov/universe/the-big-bang/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-inflation","kind":"theory","label":"Cosmic inflation","sources":[{"url":"https://science.nasa.gov/astrophysics/programs/physics-of-the-cosmos/big-bang-and-the-evolution-of-the-universe/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.dark-matter","kind":"field","label":"Dark matter","sources":[{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.galaxy-clusters","kind":"concept","label":"Galaxy clusters","sources":[{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.primordial-nucleosynthesis","kind":"theory","label":"Primordial nucleosynthesis","sources":[{"url":"https://science.nasa.gov/universe/overview/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi","kind":"technology","label":"Dark Energy Spectroscopic Instrument","sources":[{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.roman-space-telescope","kind":"technology","label":"Nancy Grace Roman Space Telescope","sources":[{"url":"https://science.nasa.gov/astrophysics/science-questions/how-do-matter-energy-space-and-time-behave-under-the-extraordinarily-diverse-conditions-of-the-cosmos/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-information-science","kind":"field","label":"Quantum information science","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-superposition","kind":"concept","label":"Quantum superposition","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-computing","kind":"field","label":"Quantum computing","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.qubit","kind":"concept","label":"Qubit","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.trapped-ion-quantum-computing","kind":"method","label":"Trapped-ion quantum computing","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-sensing","kind":"method","label":"Quantum sensing","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-networking","kind":"method","label":"Quantum networking","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.atomic-clocks","kind":"technology","label":"Atomic clocks","sources":[{"url":"https://www.nist.gov/atomic-clocks/how-do-atomic-clocks-work"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.optical-clocks","kind":"technology","label":"Optical clocks","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.optical-frequency-combs","kind":"technology","label":"Optical frequency combs","sources":[{"url":"https://www.nist.gov/quantum-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.ultracold-atoms","kind":"concept","label":"Ultracold atoms","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-many-body-physics","kind":"field","label":"Quantum many-body physics","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-simulation","kind":"method","label":"Quantum simulation","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.si-system","kind":"concept","label":"International System of Units","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"},{"id":"nlm-mesh.c66f441f7c1286f2be8b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D007394","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007394"}],"status":"reported","summary":"NLM MeSH describes International System of Units as: A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.speed-of-light-constant","kind":"concept","label":"Speed of light in vacuum c","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.planck-constant","kind":"concept","label":"Planck constant h","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.elementary-charge","kind":"concept","label":"Elementary charge e","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.boltzmann-constant","kind":"concept","label":"Boltzmann constant k","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.avogadro-constant","kind":"concept","label":"Avogadro constant NA","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cesium-hyperfine-frequency","kind":"concept","label":"Cesium-133 hyperfine frequency","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.luminous-efficacy-constant","kind":"concept","label":"Luminous efficacy Kcd","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.chemistry-webbook","kind":"dataset","label":"NIST Chemistry WebBook","sources":[{"url":"https://webbook.nist.gov/chemistry/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.refprop","kind":"dataset","label":"REFPROP","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.janaf-thermochemical-tables","kind":"dataset","label":"JANAF thermochemical tables","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.mass-spectral-library","kind":"dataset","label":"NIST Mass Spectral Library","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.xps-database","kind":"dataset","label":"NIST XPS Database","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.thermochemical-data","kind":"field","label":"Thermochemical reference data","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.thermophysical-properties","kind":"field","label":"Thermophysical properties","sources":[{"url":"https://trc.nist.gov/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.spectroscopic-reference-data","kind":"dataset","label":"Spectroscopic reference data","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"field.quantum-gravity","kind":"field","label":"Quantum gravity","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Gravity-quantum unification and tests.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-nature-of-gravity","kind":"concept","label":"Quantum nature of gravity","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Whether gravity has quantum degrees of freedom.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.gravity-mediated-entanglement","kind":"concept","label":"Gravity-mediated entanglement","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Entanglement generated through gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.bmv-entanglement-witness","kind":"method","label":"BMV entanglement witness","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.b0684b58644cb3ab135c","title":"Public source for atlas completion: https://arxiv.org/abs/1907.08994","url":"https://arxiv.org/abs/1907.08994"}],"status":"reported","summary":"Source-attributed description: Spin-correlation test using mesoscopic masses.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.mass-superposition-probe","kind":"method","label":"Mass-superposition gravity probe","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: Spatial superpositions probe gravity-mediated quantum effects.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-mediator-principle","kind":"concept","label":"Quantum mediator principle","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: Entanglement mediation implies nonclassical mediator structure in the cited argument.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.spin-correlation-readout","kind":"concept","label":"Spin-correlation readout","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Spin correlations witness generated entanglement.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.gravitational-phase-evolution","kind":"concept","label":"Gravitational phase evolution","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Gravity-induced relative phase can entangle masses.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.bmv-proposal-2017","kind":"claim","label":"BMV proposal","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.b0684b58644cb3ab135c","title":"Public source for atlas completion: https://arxiv.org/abs/1907.08994","url":"https://arxiv.org/abs/1907.08994"}],"status":"reported","summary":"Source-attributed description: 2017 laboratory entanglement-witness proposal.","tags":[]},{"aliases":["Classical gravity with QFT entanglement"],"domain":"physical","era":"frontier","frontier":false,"id":"theory.classical-gravity-qft-entanglement","kind":"theory","label":"Classical gravity plus QFT entanglement","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Classical-gravity/QFT construction generating entanglement.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.entanglement-scaling-discriminator","kind":"concept","label":"Entanglement scaling discriminator","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Scaling difference proposed to distinguish gravity models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.classical-gravity-entanglement-2025","kind":"claim","label":"Classical-gravity entanglement result","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Entanglement alone need not uniquely select quantized gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-information-gravity-test","kind":"concept","label":"Quantum-information gravity test","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: The cited proposals use entanglement between two spatially superposed masses as an indirect witness of quantum features of the mediating gravitational field; they do not report a completed measurement.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.single-graviton-quantum-sensing","kind":"method","label":"Single-graviton quantum sensing","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"},{"id":"completion-source.c3fd2ff048f4ab5e51f1","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"status":"reported","summary":"Source-attributed description: Quantum sensing proposal for single-graviton exchange signatures.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.single-graviton-signature","kind":"concept","label":"Single-graviton signature","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"},{"id":"completion-source.c3fd2ff048f4ab5e51f1","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"status":"reported","summary":"Source-attributed description: Discrete matter-gravity energy exchange as quantization clue.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.loop-quantum-gravity","kind":"field","label":"Loop quantum gravity","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Nonperturbative loop/connection quantum gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.spin-network","kind":"concept","label":"Spin network","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Basis states for quantum geometry.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.discrete-quantum-geometry","kind":"concept","label":"Discrete quantum geometry","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Discrete Planck-scale geometry from area/volume operators.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.area-operator","kind":"concept","label":"Quantum area operator","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Operator representing surface area.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.volume-operator","kind":"concept","label":"Quantum volume operator","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Operator representing spatial volume.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"method.connection-representation","kind":"method","label":"Connection representation","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Representation used for nonperturbative quantum-gravity states.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.hamiltonian-constraint","kind":"concept","label":"Hamiltonian constraint","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Constraint tied to Wheeler-DeWitt dynamics.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.ads-cft","kind":"theory","label":"AdS/CFT correspondence","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: Maldacena conjectures that particular M/string-theory compactifications on Anti-de Sitter spacetimes are dual to particular conformal field theories, using a large-N and low-energy construction.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.holographic-duality","kind":"concept","label":"Holographic duality","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: In the cited AdS/CFT proposal, particular M/string-theory compactifications on Anti-de Sitter spacetimes are conjectured to be dual to conformal field theories. This record describes that proposal, without asserting a universal duality.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.large-n-limit","kind":"concept","label":"Large-N limit","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: In Maldacena's construction, the large-N limit of certain conformal field theories contains a sector describing supergravity on products of Anti-de Sitter spaces and compact manifolds.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.asymptotic-safety","kind":"theory","label":"Asymptotic safety gravity","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.8f929def81c8e1f18329","title":"Public source for atlas completion: https://arxiv.org/abs/1202.2274","url":"https://arxiv.org/abs/1202.2274"}],"status":"reported","summary":"Source-attributed description: Reuter and Saueressig describe the Asymptotic Safety program in Quantum Einstein Gravity through the effective average action and a proposed non-trivial renormalization-group fixed point. Their review summarizes supporting evidence, rather than establishing universal validity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.functional-rg-gravity","kind":"method","label":"Functional RG for gravity","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"}],"status":"reported","summary":"Source-attributed description: Scale-dependent effective-action flow.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.running-newton-constant","kind":"concept","label":"Running Newton constant","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"}],"status":"reported","summary":"Source-attributed description: Scale dependence of Newton coupling.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"theory.causal-dynamical-triangulations","kind":"theory","label":"Causal dynamical triangulations","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Background-independent causal sum over geometries.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.emergent-four-dimensionality","kind":"concept","label":"Emergent four-dimensionality","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Macroscopic 4D spacetime emerges dynamically.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"method.sum-over-geometries","kind":"method","label":"Sum over geometries","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Nonperturbative summation of causal geometries.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"theory.causal-set","kind":"theory","label":"Causal set theory","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Spacetime as locally finite partial order.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.local-finiteness","kind":"concept","label":"Causal-set local finiteness","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Finite elements in bounded causal intervals.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.causal-partial-order","kind":"concept","label":"Causal partial order","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Order relation encodes causal precedence.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.minimal-observable-length","kind":"concept","label":"Minimal observable length","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Lower bound on position resolution.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"theory.generalized-uncertainty-relation","kind":"theory","label":"Generalized uncertainty relation","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Modified uncertainty relation encoding minimal length.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"method.minimal-length-hilbert-space","kind":"method","label":"Minimal-length Hilbert representation","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Hilbert-space realization of generalized uncertainty.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.lorentz-invariance-violation","kind":"concept","label":"Lorentz-invariance violation","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Energy-dependent photon propagation in some QG models.","tags":[]},{"aliases":["Gamma-ray burst dispersion test"],"domain":"physical","era":"undated","frontier":false,"id":"method.gamma-ray-burst-dispersion-test","kind":"method","label":"GRB dispersion test","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Gamma-ray timing constrains vacuum dispersion.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.fermi-lat","kind":"technology","label":"Fermi LAT","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Gamma-ray telescope used for LIV constraints.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.grb090510","kind":"concept","label":"GRB 090510","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: GRB090510 is a gamma-ray burst observed by Fermi-LAT whose emission was used in the cited conditional vacuum-dispersion analysis. This record denotes the burst; its photon observations have a separate dataset record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.qg-liv-constraint-2013","kind":"claim","label":"Quantum-gravity LIV constraint","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Fermi data disfavors some Planck-scale linear-dispersion models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"field.dark-matter","kind":"field","label":"Dark matter","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Unseen gravitating matter inferred from astrophysical and cosmological observations.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"theory.wimp-dark-matter","kind":"theory","label":"WIMP dark matter","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Weakly interacting massive particle dark-matter hypothesis.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"method.direct-detection","kind":"method","label":"Direct dark-matter detection","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Searches for dark-matter scattering in terrestrial detectors.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"instrument.xenonnt","kind":"technology","label":"XENONnT","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Dual-phase xenon detector used for WIMP searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"dataset.xenonnt-3p1-tonne-year","kind":"dataset","label":"XENONnT 3.1 tonne-year exposure","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Combined exposure from two science campaigns.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.nuclear-recoil-signal","kind":"concept","label":"Nuclear recoil signal","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Recoil signature targeted in WIMP-xenon scattering searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.spin-independent-cross-section","kind":"concept","label":"Spin-independent WIMP cross section","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Interaction parameter constrained by xenon searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.xenonnt-null-2025","kind":"claim","label":"XENONnT null excess","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"No significant excess above background in the cited exposure.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.lux-zeplin","kind":"technology","label":"LUX-ZEPLIN","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: Two-phase xenon TPC used for direct dark-matter searches.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.lz-4p2-tonne-year","kind":"concept","label":"LZ 4.2 tonne-year exposure","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP-search analysis has a total exposure of 4.2 ± 0.1 tonne-years over 280 live days. This record denotes that exposure quantity; the associated detector data have a separate dataset record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.spin-dependent-cross-section","kind":"concept","label":"Spin-dependent WIMP cross section","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The spin-dependent WIMP-nucleon cross section is an interaction parameter on which the cited LZ nuclear-recoil search places constraints; it is not a detection of that interaction.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.lz-null-2024","kind":"claim","label":"LZ null excess","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: No excess over expected backgrounds in cited WIMP search.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.wimp-parameter-space","kind":"concept","label":"WIMP parameter space","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: Mass-cross-section region constrained by direct searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.lz-high-energy-event-2026","kind":"claim","label":"LZ high-energy recoil-like event","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"status":"active","summary":"One high-energy nuclear-recoil-like event with limited global significance.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.look-elsewhere-corrected-significance","kind":"concept","label":"Look-elsewhere corrected significance","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"status":"active","summary":"Global significance after accounting for scanned models.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.cosmic-ray-boosted-dark-matter","kind":"model","label":"Cosmic-ray-boosted dark matter","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: The cited LZ search considers a scenario in which collisions with Milky Way cosmic rays boost otherwise light dark-matter candidates above a nuclear-recoil detection threshold. It reports no excess above expected backgrounds.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.crdm-direct-search","kind":"method","label":"CRDM direct search","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Search for boosted sub-GeV dark matter in xenon data.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.sub-gev-dark-matter","kind":"concept","label":"Sub-GeV dark matter","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Dark-matter candidates below the conventional WIMP mass range.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.lz-crdm-null-2025","kind":"claim","label":"LZ CRDM null result","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: No excess above background in cited boosted-DM search.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.crdm-nucleon-cross-section","kind":"concept","label":"CRDM-nucleon cross section","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Interaction parameter constrained for boosted dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.axion-dark-matter","kind":"model","label":"Axion dark matter","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX analysis tests the hypothesis that axions constitute dark matter, using a strong-field microwave-cavity haloscope and conditional exclusions of DFSZ axions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.admx","kind":"technology","label":"ADMX","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: Microwave-cavity axion haloscope.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.axion-haloscope","kind":"method","label":"Axion haloscope","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX search uses an axion haloscope consisting of a microwave cavity in a strong magnetic field to test axion dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.admx-run1b","kind":"dataset","label":"ADMX Run 1B","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: 2018 search data covering 2.81-3.31 micro-eV.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.dfsz-axion","kind":"model","label":"DFSZ axion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX Run 1B paper describes the Dine-Fischler-Srednicki-Zhitnitsky (DFSZ) model as a benchmark for axion experiments, characterized by its axion-photon coupling.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.axion-photon-conversion","kind":"concept","label":"Axion-photon conversion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX paper describes inverse Primakoff conversion: a static magnetic field provides a channel for an axion to convert into a photon, whose resulting power can be resonantly enhanced in a microwave cavity. This is the proposed detection mechanism, not an observed axion signal.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.admx-dfsz-exclusion","kind":"claim","label":"ADMX DFSZ exclusion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX Run 1B analysis excludes DFSZ axions over 680–790 MHz except for mode-crossing gaps, assuming axions supply 100% of the dark-matter density.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.primordial-black-hole-dark-matter","kind":"model","label":"Primordial black-hole dark matter","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: The cited OGLE analysis treats primordial black holes as a possible fraction of Milky Way halo dark matter and conditionally constrains that fraction using microlensing events.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.microlensing-dark-matter","kind":"method","label":"Microlensing dark-matter search","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Uses transient lensing magnification to test compact dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.ogle-five-year-events","kind":"dataset","label":"OGLE five-year microlensing sample","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: 2622 Galactic-bulge microlensing events used for PBH constraints.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.earth-mass-pbh","kind":"concept","label":"Earth-mass primordial black holes","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: The cited analysis finds that an Earth-mass primordial-black-hole population could reproduce six ultrashort OGLE events if its dark-matter fraction is at the percent level. It presents this as a conditional interpretation alongside free-floating planets.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.ogle-pbh-constraint","kind":"claim","label":"OGLE PBH constraint","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Microlensing sample constrains PBH abundance in Earth-Jupiter mass range.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.fuzzy-dark-matter","kind":"theory","label":"Fuzzy dark matter","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Extremely light bosonic dark matter with kiloparsec-scale de Broglie wavelength.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.lyman-alpha-forest-constraint","kind":"method","label":"Lyman-alpha forest constraint","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Uses quasar absorption power spectra to constrain fuzzy dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.xq100-hires-mike","kind":"dataset","label":"XQ-100 and HIRES/MIKE spectra","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Quasar spectra used in cited fuzzy-DM limits.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.fuzzy-dm-mass","kind":"concept","label":"Fuzzy-DM particle mass","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: The cited Lyman-alpha analysis constrains the particle mass of extremely light bosonic dark-matter models, with lower limits that depend on assumptions about the intergalactic medium's thermal history.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.fuzzy-dm-lyman-alpha-limit","kind":"claim","label":"Fuzzy-DM Lyman-alpha limit","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Cited analysis sets lower mass limits under thermal-history assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.self-interacting-dark-matter","kind":"model","label":"Self-interacting dark matter","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.495bd78c68aa1596d994","title":"Public source for atlas completion: https://arxiv.org/abs/1705.02358","url":"https://arxiv.org/abs/1705.02358"}],"status":"reported","summary":"Source-attributed description: The cited sources discuss a family of dark-matter models with interactions beyond gravity. Their predictions and astrophysical constraints depend on the interaction model; no single unified model is asserted here.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.finite-range-dark-force","kind":"concept","label":"Finite-range dark force","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: Intermediate-range self-interaction between dark-matter particles.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"event.bullet-cluster","kind":"concept","label":"Bullet Cluster","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.495bd78c68aa1596d994","title":"Public source for atlas completion: https://arxiv.org/abs/1705.02358","url":"https://arxiv.org/abs/1705.02358"}],"status":"reported","summary":"Source-attributed description: The Bullet Cluster is a merging-cluster system used in the cited studies to investigate dark-matter interactions. The finite-range-force analysis considers possible effects on collision velocity and post-collision separation of dark matter and galaxies.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.cluster-offset-constraint","kind":"method","label":"Cluster offset constraint","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: The cited finite-range-force analysis constrains dark-matter models using conditional predictions of altered cluster collision velocity or separation between dark matter and galaxies after collision, along with the stated observational assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dark-matter-self-interaction-cross-section","kind":"concept","label":"Dark-matter self-interaction cross section","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.ad17fd11e99deb1b05e1","title":"Public source for atlas completion: https://arxiv.org/html/1705.02358v2","url":"https://arxiv.org/html/1705.02358v2"}],"status":"reported","summary":"Source-attributed description: In the Tulin–Yu review, the dark-matter scattering cross section, often expressed per unit particle mass, is a parameter constrained conditionally by astrophysical observations, including merging clusters. The relevant bounds depend on interaction and velocity assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dark-matter-candidate-space","kind":"concept","label":"Dark-matter candidate space","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: The cited analyses investigate different proposed dark-matter candidates: WIMPs in LZ nuclear-recoil searches, axions in ADMX, primordial black holes in OGLE microlensing, ultralight bosons in Lyman-alpha data, and self-interacting models in cluster studies. This is a comparison of those cited targets, not a complete list of possibilities.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.null-result-constraint","kind":"concept","label":"Null-result constraint","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP search reports no excess above expected backgrounds and places conditional limits on WIMP-nucleon cross sections. A bounded exclusion is the outcome described here.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.complementary-dark-matter-searches","kind":"concept","label":"Complementary dark-matter searches","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ and ADMX analyses test different proposed dark-matter signals: WIMP-induced xenon nuclear recoils and axion signals in a strong-field microwave cavity, respectively. Their exclusions apply under their separate stated assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dfsz-axion","kind":"model","label":"DFSZ axion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX Run 1B paper describes the DFSZ model as an axion-experiment benchmark characterized by axion-photon coupling. This existing record is retained separately pending an explicit identity review of the other DFSZ record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.ultrashort-microlensing-events","kind":"concept","label":"Ultrashort microlensing events","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Six very short events discussed as PBH or free-floating-planet candidates.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.shoes-cepheid-sn-h0-baseline","kind":"claim","label":"SH0ES baseline Cepheid-SN H0 result","sources":[{"id":"src-shoes-2112.04510","title":"A Comprehensive Measurement of the Local Value of the Hubble Constant with 1 km/s/Mpc Uncertainty from the Hubble Space Telescope and the SH0ES Team","url":"https://arxiv.org/abs/2112.04510"}],"status":"reported","summary":"The SH0ES analysis reports a baseline Cepheid-SN H0 result of 73.04+-1.04 km/s/Mpc, including systematics.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"paper.bose-spin-entanglement-witness-2017","kind":"paper","label":"A Spin Entanglement Witness for Quantum Gravity","sources":[{"id":"src.qg.bose-2017","title":"A Spin Entanglement Witness for Quantum Gravity","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Bose and coauthors reported a proposal for a laboratory test in which gravitational interaction between two micron-size test masses could entangle them, with correlations between one embedded spin in each test mass proposed as the entanglement witness.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.lz-4p2ty-background-consistency","kind":"claim","label":"LZ 4.2 tonne-year WIMP search background consistency","sources":[{"id":"src.dm.lz-2024","title":"Dark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"In the LUX-ZEPLIN 4.2 tonne-year WIMP dark-matter search, the collaboration reported no evidence for an excess over expected backgrounds after removing artificial signal-like events injected to mitigate analyzer bias.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.lz-4p2ty-no-excess-reported","kind":"claim","label":"LZ 4.2 tonne-year WIMP search reported no excess","sources":[{"id":"src-dm-lz-4p2ty","title":"Dark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"In its 4.2 tonne-year WIMP dark-matter search, LUX-ZEPLIN reported no evidence for an excess over expected backgrounds after removal of artificial signal-like events injected to mitigate analyzer bias.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.bose-2017-gravitational-entanglement-proposal-reported","kind":"claim","label":"Bose et al. gravitational entanglement test proposal","sources":[{"id":"src.qg.bose-2017","title":"A Spin Entanglement Witness for Quantum Gravity","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Bose and collaborators proposed a test in which gravitationally induced phase evolution between two micron-size test masses in adjacent matter-wave interferometers could produce detectable entanglement, with the masses separated sufficiently to keep Casimir-Polder forces at bay.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported","kind":"claim","label":"DESI DR2 flat-LambdaCDM fit with mild BAO-CMB tension","sources":[{"id":"src.physical.desi-dr2-dark-energy-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"DESI reported that its DR2 BAO results were well described by a flat LambdaCDM model while the parameters preferred by BAO were in mild 2.3-sigma tension with those determined from the CMB.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.des-y6-weak-evolving-dark-energy-preference-reported","kind":"claim","label":"DES Y6 reported weak preference for evolving dark energy","sources":[{"id":"src.physical.des-y6-dynamical-dark-energy-2026","title":"Constraints on Dynamical Dark Energy from Multiple Probes in the Full Dark Energy Survey","url":"https://arxiv.org/abs/2605.27221"}],"status":"reported","summary":"The DES Collaboration reported that its analyzed probe combinations supported a weak preference for evolving dark energy, with the significance of deviation from a cosmological constant ranging from 2.3 to 3.2 sigma when individual probes were left out.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.desi-dr2-bao-consistency-reported","kind":"claim","label":"DESI DR2 BAO consistency with DR1, SDSS and supernova distances","sources":[{"id":"src.de.desi-dr2-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"The retained DESI DR2 source reports that its BAO results are consistent with DESI DR1 and SDSS, and that their distance-redshift relationship matches recent supernova compilations over the same redshift range.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.who-semen-manual-procedures","kind":"claim","label":"WHO sixth-edition semen examination and processing procedures","sources":[{"id":"src.andrology.who-semen-manual-2021","title":"WHO laboratory manual for the examination and processing of human semen, 6th ed","url":"https://www.who.int/publications/i/item/9789240030787"}],"status":"reported","summary":"The WHO sixth-edition semen manual describes procedures and methods for laboratory examination and processing of human semen.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.who-semen-analysis-clinical-research-uses","kind":"claim","label":"WHO-described clinical and research uses of semen analysis","sources":[{"id":"src.andrology.who-semen-manual-2021","title":"WHO laboratory manual for the examination and processing of human semen, 6th ed","url":"https://www.who.int/publications/i/item/9789240030787"}],"status":"reported","summary":"The WHO semen manual states that semen analysis may be useful for investigating male fertility status and monitoring spermatogenesis during and following male fertility regulation and other interventions, in clinical and research settings.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-varicocelectomy-indications","kind":"claim","label":"AUA/ASRM varicocelectomy recommendation for selected infertile men","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline recommends considering surgical varicocelectomy for men attempting conception who have palpable varicoceles, infertility and abnormal semen parameters, except azoospermic men; it labels this a moderate recommendation supported by Grade B evidence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-microtese-noa-recommendation","kind":"claim","label":"AUA/ASRM microdissection sperm retrieval recommendation in NOA","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline recommends microdissection testicular sperm extraction for men with non-obstructive azoospermia undergoing sperm retrieval, assigning a moderate recommendation with Grade C evidence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-testosterone-monotherapy-fertility","kind":"claim","label":"AUA/ASRM recommendation against testosterone monotherapy when fertility is desired","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline states that testosterone monotherapy should not be prescribed to a male interested in current or future fertility, identifying this recommendation as a clinical principle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-infertility-supplement-evidence-gap","kind":"claim","label":"AUA/ASRM uncertainty regarding fertility supplements","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline reports that clear, reliable evidence is lacking for supplements offered to men attempting conception and describes their value for improving fertility outcomes as questionable.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","kind":"claim","label":"AUA/ASRM sperm banking recommendation before gonadotoxic therapy","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline advises clinicians to encourage sperm banking, preferably multiple specimens when possible, before gonadotoxic therapy or other cancer treatment that may affect male fertility; it classifies this as expert opinion.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-male-infertility-etiology-knowledge-gap","kind":"claim","label":"AUA/ASRM-reported gaps in understanding male infertility causes","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"In its future-directions discussion, the AUA/ASRM guideline states that the causes of male infertility, including their genetic basis, had been only superficially explained at the time of the guideline.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-hypogonadism-diagnostic-criteria","kind":"claim","label":"Endocrine Society hypogonadism diagnostic criteria","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends diagnosing hypogonadism only in men with compatible symptoms and signs and unequivocally and consistently low serum testosterone concentrations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-repeat-morning-testosterone","kind":"claim","label":"Endocrine Society recommendation for repeat morning testosterone measurement","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends confirming hypogonadism by repeating measurement of morning fasting total testosterone concentrations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-primary-secondary-hypogonadism","kind":"claim","label":"Endocrine Society hormonal evaluation of primary versus secondary hypogonadism","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"For men with hypogonadism, the Endocrine Society guideline recommends measuring serum luteinizing hormone and follicle-stimulating hormone concentrations to distinguish primary testicular from secondary pituitary-hypothalamic hypogonadism.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-no-routine-population-screening","kind":"claim","label":"Endocrine Society recommendation against routine population screening for hypogonadism","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends against routine screening of men in the general population for hypogonadism.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-geyserite-localities-2017","kind":"claim","label":"Inferred Dresser geyserite at three localities","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"Djokic and colleagues interpret microlaminated siliceous rocks at three Dresser Formation DFc1 localities, approximately 2 km apart, as geyserite.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-sinter-terracettes-2017","kind":"claim","label":"Dresser siliceous ridges interpreted as sinter terracettes","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"At Dresser locality 1S, the authors interpret convex siliceous ridges above stratiform geyserite as resembling mid- to distal-apron hot-spring sinter terracettes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-barite-hot-spring-pools-2017","kind":"claim","label":"Dresser barite masses interpreted as fossil hot-spring pools","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors propose that at least some large Dresser barite masses at hydrothermal vein tips are mineralized remnants of terrestrial hot-spring pools and shallow hydrothermal plumbing.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-bubbles-eps-2017","kind":"claim","label":"Inferred gas-bubble preservation in Dresser microbial EPS","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors interpret roughly 200 µm circular structures in Dresser geyserite as gas bubbles likely trapped in microbial EPS, while leaving thermal-fluid versus metabolic gas origin unresolved.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-palisade-fabric-2017","kind":"claim","label":"Dresser quartz fabric proposed as microbial palisade texture","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors suggest that bedding-normal quartz crystals in Dresser sinter terracettes are analogous to recrystallized microbial palisade fabric formed by silicified filaments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-stromatolites-locality-24s-2017","kind":"claim","label":"Dresser stromatolitic laminates associated with sinter clasts","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"At Dresser locality 24S, geyserite rip-up clasts occur among domical and conical stromatolitic laminates; their internal laminae and sediment onlap are described as consistent with microbial origin.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","kind":"claim","label":"Dresser microfossil-like vesicles interpreted as volcanic glass","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"A 2018 study interprets spheroidal-to-lenticular Dresser microstructures resembling Archean microfossils as silicified and pyritized vesicular volcanic glass based on size, wall ultrastructure and chemistry.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-vesicle-organic-carbon-2018","kind":"claim","label":"Kerogenous carbon associated with Dresser volcanic vesicles","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"In the studied Dresser volcanic-glass microstructures, organic kerogenous material accompanies altered glass, with some vesicles lined or filled by carbon and organic-rich laminae enveloping multiple vesicles.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","kind":"claim","label":"Isolated volcanic vesicles can imitate microfossils","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"The Dresser pseudo-fossil study cautions that isolated reworked silicified volcanic vesicles can adsorb carbon and become pyritized, complicating early-life identification; nanoscale wall analysis may be required to exclude biogenicity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-nutrient-depletion-dissolution-2018","kind":"claim","label":"Nutrient limitation conditions basalt microbial element release","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"In laboratory incubations of HSDP2 drill-core basalt with Burkholderia fungorum, release of Fe and other major elements exceeded abiotic controls only for nutrient-depleted rock-sample assays.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-glass-stress-feii-release-2018","kind":"claim","label":"Synthetic basalt glass stress and Fe(II) track element release","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"In biotic laboratory colonization assays using synthetic basaltic glasses, dissolved major-element concentrations increased with greater residual stress and Fe(II) content.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-glass-biofilm-redox-stress-2018","kind":"claim","label":"Biofilm coverage differs across synthetic basalt glass types","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"The 2018 colonization assays reported dense biofilm on stressed Fe(II)-rich basalt glasses, versus sparse colonization on unstressed Fe(III)-rich glasses.","tags":[]},{"aliases":["P000005","VAT 15153"],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.cdli-p000005-metadata","kind":"claim","label":"CDLI P000005 Uruk IV lexical tablet metadata","sources":[{"id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","title":"CDLI Lexical 000002, ex. 172 (P000005)","url":"https://cdli.earth/artifacts/5"}],"status":"reported","summary":"CDLI catalogs P000005 (museum number VAT 15153) as a clay lexical tablet from Uruk (modern Warka), assigned to Uruk IV (ca. 3350–3200 BC), held in the Vorderasiatisches Museum, Berlin, with language undetermined.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.cdli-p000005-transliteration","kind":"claim","label":"CDLI P000005 column-one lexical signs and witness classification","sources":[{"id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","title":"CDLI Lexical 000002, ex. 172 (P000005)","url":"https://cdli.earth/artifacts/5"}],"status":"reported","summary":"CDLI transcribes P000005 obverse column 1 as 1(N01) with ESZDA#, KAB, and DI@t?, marks the remainder broken, and lists the tablet as a witness to the Archaic Lu2 A composite P464118.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.etcsl-ur-iii-ob-catalogues","kind":"claim","label":"Distinct Ur III and Old Babylonian literary catalogue entries in ETCSL","sources":[{"id":"src.assyriology.etcsl-sumerian-literary-corpus","title":"The Electronic Text Corpus of Sumerian Literature: Catalogue of all available compositions and translations","url":"https://etcsl.orinst.ox.ac.uk/cgi-bin/etcsl.cgi?text=all"}],"status":"reported","summary":"ETCSL separately lists an Ur III catalogue from Nibru (N1), an Old Babylonian catalogue from Nibru (N2), and an Old Babylonian catalogue possibly from Zimbir (B1); these listings do not themselves establish a transmission path among the catalogues.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.etcsl-huwawa-versions","kind":"claim","label":"ETCSL listings for Gilgameš and Ḫuwawa Versions A and B","sources":[{"id":"src.assyriology.etcsl-sumerian-literary-corpus","title":"The Electronic Text Corpus of Sumerian Literature: Catalogue of all available compositions and translations","url":"https://etcsl.orinst.ox.ac.uk/cgi-bin/etcsl.cgi?text=all"}],"status":"reported","summary":"ETCSL catalogs Gilgameš and Ḫuwawa as separate Version A (1.8.1.5) and Version B (1.8.1.5.1) entries, each offering transliteration and translation; those entries alone establish no copying direction or relative date.","tags":[]},{"aliases":["SAA 01 001","P224485","NL 039"],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-metadata","kind":"claim","label":"SAA 01 001 royal letter cataloguing and date limits","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"SAAo catalogs SAA 01 001 (CDLI P224485; primary publication NL 039) as a Neo-Assyrian clay administrative letter from the Northwest Palace archive at Nimrud, attributed to Sargon II’s reign (721–705 BC) but explicitly undated, with sender the king and addressee Aššur-šarru-u[ṣur].","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-midas-messenger","kind":"claim","label":"Reported Midas messenger and alliance claim in SAA 01 001","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"In SAA 01 001 the royal writer quotes an earlier report that a messenger [of] Midas brought 14 men of Que previously sent by Urik to Urarṭu and declares that the Phrygian became an ally; these are reported statements in the letter, not independent verification of either event.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-phrygian-contact","kind":"claim","label":"SAA 01 001 instruction to maintain Phrygian messenger contact","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"SAA 01 001 directs its recipient not to withdraw a messenger from the Phrygian, to write amicably, and to monitor news about him; the instruction does not establish that the recipient complied.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-tabal-strategy","kind":"claim","label":"Threatened two-sided pressure against Tabal in SAA 01 001","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"In SAA 01 001 the royal writer proposes that the recipient pressure the kings of Tabal from one side while the Phrygian does so from the other; the source includes an ellipsis and does not confirm that the plan occurred.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-hezekiah-jerusalem","kind":"claim","label":"Sennacherib 015 claims confinement of Hezekiah in Jerusalem","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In RINAP Sennacherib 015, the first-person royal narrator claims to have confined Hezekiah in Jerusalem like a bird in a cage; this records an inscriptional claim rather than independent proof of the campaign outcome.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-tebilti-river","kind":"claim","label":"Sennacherib 015 claims diversion of the Tebilti River","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In column vi of RINAP Sennacherib 015, the royal narrator reports changing the Tebilti River’s course, repairing erosion damage, and directing its outflow, with several portions of the translation editorially restored.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-nineveh-orchards-canal","kind":"claim","label":"Sennacherib 015 reports Nineveh orchard plots and a canal route","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In column viii of RINAP Sennacherib 015, the royal narrator reports dividing upstream meadowland into plots of two pānu for Nineveh’s citizens and cutting a canal from near Kisiri toward Nineveh’s plain; parts of the canal construction and route appear in brackets as editorial restorations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.leinster-universal-properties-approaches","kind":"claim","label":"Three presentations of universal properties in Leinster’s textbook","sources":[{"id":"src.category-theory.leinster-basic-category-theory","title":"Basic Category Theory","url":"https://arxiv.org/abs/1612.09375"}],"status":"reported","summary":"Leinster describes his introductory category theory textbook as presenting universal properties through adjoint functors, representable functors, and limits, with a final chapter tying the three approaches together.","tags":["universal properties","adjoint functors","representable functors","limits"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.fong-spivak-seven-applied-sketches","kind":"claim","label":"Seven-sketch application tour of category theory","sources":[{"id":"src.category-theory.fong-spivak-seven-sketches","title":"Seven Sketches in Compositionality: An Invitation to Applied Category Theory","url":"https://arxiv.org/abs/1803.05316"}],"status":"reported","summary":"Fong and Spivak describe seven instructional sketches pairing examples including databases, electric circuits, and dynamical systems with categorical structures including adjoint functors, enriched categories, and toposes.","tags":["applied category theory","compositionality","pedagogy"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-schema-category-instance-functor","kind":"claim","label":"Database schemas as categories and instances as functors","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak proposes a database definition language in which a database schema is a small category and an instance is a set-valued functor on that schema.","tags":["categorical databases","small categories","set-valued functors"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-three-migration-functors","kind":"claim","label":"Three schema-induced data-migration functors","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Within Spivak’s category-and-functor database model, morphisms of schemas induce three data-migration functors that translate instances between schemas in canonical ways.","tags":["schema morphisms","data migration","functors"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-relational-operations","kind":"claim","label":"Data-migration functors parameterize relational operations","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak reports that the three data-migration functors parameterize projections, unions, and joins across all tables simultaneously in the categorical database formulation.","tags":["projections","unions","joins"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-query-expressiveness","kind":"claim","label":"Categorical migration functors as alternatives to query types","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak states that his three data-migration functors can be used in place of conjunctive and disjunctive queries within the paper’s database framework.","tags":["conjunctive queries","disjunctive queries","data migration"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-programming-types-bridge","kind":"claim","label":"Functorial connection to functional-programming types","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak describes connecting a database to a functional programming language by introducing a functorial connection between the database schema and the language’s category of types.","tags":["functional programming","category of types","database integration"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-gray-generalization-open-problem","kind":"claim","label":"Higher Gray tensor generalization described as open","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber describe the systematic construction of higher-dimensional analogues of the Gray tensor product as an open problem in higher category theory in their 2009-submitted paper.","tags":["higher category theory","Gray tensor product","historical open problem"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-gray-crans-inclusion","kind":"claim","label":"Gray and Crans tensor products included in higher-operad theory","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber state that their resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product of Gray categories.","tags":["globular operads","Gray tensor product","Crans tensor product"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-ekmann-hilton-braided-2cats","kind":"claim","label":"Reported Ekmann-Hilton result for braided monoidal 2-categories","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber report obtaining an “Ekmann-Hilton” result for braided monoidal 2-categories as an application of their higher-operad framework.","tags":["braided monoidal 2-categories","higher operads","Ekmann-Hilton"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-ainfinity-tensor","kind":"claim","label":"Tensor product construction for A-infinity algebras","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber state that their paper gives a construction of a tensor product of A-infinity algebras.","tags":["A-infinity algebras","tensor products","higher operads"]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-controlled-blocking","kind":"claim","label":"NIST controlled blocking","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST describes blocking as holding nuisance factors constant inside homogeneous blocks while varying the factor of interest.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-balanced-blocks","kind":"claim","label":"NIST balanced blocking criterion","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST defines a blocking factor by equal occurrence of each primary-factor level at each nuisance-factor level.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-randomization","kind":"claim","label":"NIST residual nuisance randomization","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST recommends blocking important nuisance variables and randomizing to reduce contamination by remaining nuisance variables.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-wafer-example","kind":"claim","label":"NIST hypothetical blocked wafer allocation","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST illustrates a hypothetical design putting four wafers with different dosages in each of three furnace runs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-preregistration","kind":"claim","label":"Nosek preregistration definition","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. (2018) define analysis preregistration as committing to analytic steps without prior knowledge of outcomes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-forking","kind":"claim","label":"Nosek postdiction diagnosticity warning","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. warn that postdictive NHST analyses may yield p-values of unknown diagnosticity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-prereg-evidence","kind":"claim","label":"Nosek 2018 preregistration evidence limit","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. (2018) report theoretical and correlational support for preregistration but insufficient experimental evidence of a reproducibility advantage.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-preexisting","kind":"claim","label":"Nosek preexisting-data blinding","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. explain that tests of predictions using preexisting data depend on blinded analysis decisions, which face risks when data have already been observed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-decisiontree","kind":"claim","label":"Nosek biased preregistered decision trees","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. warn that preregistered decision trees can still embed bias, such as stopping after achieving p < 0.05.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-all-results","kind":"claim","label":"Nosek complete reporting across studies","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. argue that reporting all planned outcomes matters because preregistration alone cannot eliminate multiple-comparison and selective-reporting problems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-registered-reports","kind":"claim","label":"Nosek Registered Reports workflow","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. describe Registered Reports as pre-outcome methodological peer review with in-principle acceptance, followed by review of execution and adherence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-holdout","kind":"claim","label":"Nosek exploratory-to-holdout testing","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. describe splitting a dataset, sealing the holdout and preregistering exploration-derived predictions before unsealing it.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-seasonal-syzygies","kind":"claim","label":"Ptolemy's four seasonal lunar-syzygy markers","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.10, Ptolemy proposes using new- and full-moon syzygies preceding the four equinoctial and solstitial starting points to conjecture seasonal conditions for spring, summer, autumn and winter.","tags":["ancient weather prediction","syzygies","seasons"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-fixed-star-appearances","kind":"claim","label":"Ptolemy's daily fixed-star weather intensifications","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.12, Ptolemy attributes day-by-day intensification of weather qualities chiefly to appearances of bright fixed stars at their morning or evening rising or setting relative to the Sun.","tags":["ancient weather prediction","fixed stars","stellar appearances"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-lunar-halo-omens","kind":"claim","label":"Ptolemy's lunar halo weather signs","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.13, Ptolemy treats a single clear fading lunar halo as a fair-weather sign and multiple or differently colored and shaped lunar halos as signs of storms or winds.","tags":["ancient weather signs","lunar halos","storm forecasting"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-crescent-horn-signs","kind":"claim","label":"Aratus's early-crescent weather signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"In Phaenomena, Aratus presents the shape and color of the Moon's horns on the third and fourth nights as signs for calm, wind, rain and storms, including directional winds linked to horn orientation.","tags":["ancient weather signs","crescent moon","wind direction"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-manger-ass-stars","kind":"claim","label":"Aratus's Manger and Asses wind-rain signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"Aratus states that a darkening or vanishing Manger in Cancer signals rain or storms, and that relative dimming of the northern or southern Ass star can indicate a southerly or northerly wind.","tags":["Praesepe","the Asses","ancient weather signs"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-seabird-wind-signs","kind":"claim","label":"Aratus's seabird and shorebird wind signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"Aratus describes a heron flying landward from the sea with cries, storm petrels turning toward winds, and ducks or gulls beating wings on shore as signs preceding gales.","tags":["animal weather signs","seabirds","winds"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-local-cloud-conditions","kind":"claim","label":"Theophrastus's local mountain-cloud weather guidance","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus says mountainous and coastal terrain affects cloud movements when winds change and advises attending to local conditions and knowledgeable local observers when interpreting weather signs.","tags":["local weather observations","terrain","cloud movement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-red-sky-three-days","kind":"claim","label":"Theophrastus's red-sky rain time window","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus describes a reddish sky before sunrise as a rain sign for the same day or within three days, and a red sunset sky as a similar but less certain sign.","tags":["red sky","rain prediction","ancient weather signs"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-ant-eggs-rain-signs","kind":"claim","label":"Theophrastus's ant-egg movement omens","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus treats ants moving their eggs from hollow anthills to higher ground as a sign of rain and moving them down as a sign of fair weather.","tags":["ants","animal weather signs","rain prediction"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.cit-plus-cit-plus-plus-timing","kind":"claim","label":"LTEE Cit+ emergence and Cit++ expansion","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) describe emergence of citrate utilization in the Ara−3 LTEE population after 31,500 generations and descendants fully exploiting citrate by 33,000 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-duplication-2p2-fitness","kind":"claim","label":"CitT duplication fitness in early LTEE Cit+ isolate","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 2.2% competitive fitness advantage associated with the citT-activating duplication by comparing early Cit+ isolate ZDB564 with its Cit− revertant ZDB706.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-ancestor-1p0-fitness","kind":"claim","label":"Weak ancestral fitness benefit of aerobic citT activation","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 1.0% fitness advantage for the engineered Cit+ activation in ancestral LTEE strain REL606, with weak statistical support (one-tailed P = 0.033; n = 12).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-anti-potentiation-23clones","kind":"claim","label":"Deleterious citT activation in evolved genetic backgrounds","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) reported that activating citT reduced competitive fitness in 11 of 23 tested evolved pre-Cit+ clones, including five with reductions greater than 20%.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-phylo-negative-group","kind":"claim","label":"Negative Cit+ activation effect in intermediate Ara−3 phylogeny","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) estimated a −5.4% fitness effect (interval −7.2% to −3.6%) for citT activation in the intermediate pre-Cit+ lineage group represented by ZDB425, ZDB458 and ZDB464.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-phylo-positive-group","kind":"claim","label":"Late positive Cit+ activation effect in Ara−3 phylogeny","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) estimated a +2.4% fitness effect (95% interval +1.4% to +3.4%) in a later fully potentiated pre-Cit+ lineage group containing ZDB19 and ZDB13 from as early as 29,000 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-ecological-potentiation-test","kind":"claim","label":"Ecological potentiation test in evolved generation-31,000 Ara−3 population mixture","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 0.9% Cit+ fitness advantage when competing engineered ZDB706 variants at low frequency within the generation-31,000 LTEE population and reported no support for an ecological-potentiation advantage.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-detection-loss","kind":"claim","label":"Loss of detectable Cit− lineage in Ara−3 samples","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) detected the Ara−3 Cit− genotype and phenotype through 43,500 LTEE generations but not in samples from 44,000 generations onward.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-replay-survival","kind":"claim","label":"Cit− persisted through 40 reconstructed evolution replays","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) found Cit− persistence in all 20 replay populations from generation 43,500 and all 20 from generation 40,000 after 500 generations, plus one generation-43,000 replay propagated for 2,500 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-50k-reinvasion","kind":"claim","label":"Reinvasion of a 50,000-generation Cit+ population","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) observed that a generation-43,000 Cit− clone reinvaded the generation-50,000 Ara−3 population, reaching about 3 × 10^5 cells/mL, roughly an order of magnitude below final Cit− densities in the other treatments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-extinction-cause-unresolved","kind":"claim","label":"Turner extinction cause unresolved; random-catastrophe proposal","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) stated that the Ara−3 Cit− lineage extinction cause remained unknown, rejected their initial ongoing Cit+ adaptation explanation, and proposed an unidentified rare perturbation as a possible cause rather than an observed event.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.liu-relevant-position","kind":"claim","label":"Liu et al. reported position-dependent retrieval in long inputs","sources":[{"id":"src.longcontext.liu-lost-middle-2024","title":"Lost in the Middle: How Language Models Use Long Contexts","url":"https://arxiv.org/abs/2307.03172"}],"status":"reported","summary":"Liu and colleagues report that models evaluated on multi-document question answering and key-value retrieval often performed best when relevant information occurred at the start or end of a long input, with marked degradation for middle positions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.ruler-task-design","kind":"claim","label":"RULER expands needle retrieval to multi-hop and aggregation","sources":[{"id":"src.longcontext.hsieh-ruler-2024","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","url":"https://arxiv.org/abs/2404.06654"}],"status":"reported","summary":"The RULER paper describes a configurable synthetic long-context benchmark extending needle-in-a-haystack retrieval with different needle types and counts, plus multi-hop tracing and aggregation; it evaluates 17 language models on 13 representative tasks.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.ruler-32k-performance","kind":"claim","label":"RULER performance gap at claimed 32K context","sources":[{"id":"src.longcontext.hsieh-ruler-2024","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","url":"https://arxiv.org/abs/2404.06654"}],"status":"reported","summary":"In the RULER authors’ evaluation of 17 long-context models advertised for at least 32K tokens, almost all declined on RULER as input length grew, and the authors reported only about half maintained satisfactory performance at 32K, despite nearly perfect results on vanilla needle retrieval.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.nolima-nonliteral-retrieval","kind":"claim","label":"NoLiMa tests retrieval without literal matching","sources":[{"id":"src.longcontext.modarressi-nolima-2025","title":"NoLiMa: Long-Context Evaluation Beyond Literal Matching","url":"https://proceedings.mlr.press/v267/modarressi25a.html"}],"status":"reported","summary":"The NoLiMa authors introduce a needle-retrieval benchmark in which questions and relevant text have minimal lexical overlap, requiring latent associations rather than straightforward literal matching to locate evidence.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.nolima-32k-degradation","kind":"claim","label":"NoLiMa reported degradation in 13-model evaluation at 32K","sources":[{"id":"src.longcontext.modarressi-nolima-2025","title":"NoLiMa: Long-Context Evaluation Beyond Literal Matching","url":"https://proceedings.mlr.press/v267/modarressi25a.html"}],"status":"reported","summary":"In NoLiMa evaluations of 13 models claiming at least 128K-token support, 11 performed at under half their short-context baseline at 32K; the reported GPT-4o score dropped from 99.3% at short context to 69.7% at 32K.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-v2-design","kind":"claim","label":"LongBench v2 realistic long-context question collection","sources":[{"id":"src.longcontext.bai-longbench-v2-2025","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","url":"https://aclanthology.org/2025.acl-long.183/"}],"status":"reported","summary":"The LongBench v2 authors describe 503 multiple-choice questions with source contexts from 8,000 to 2 million words spanning six categories, including multi-document questions and code-repository understanding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-v2-score-comparison","kind":"claim","label":"LongBench v2 reported expert and model benchmark accuracies","sources":[{"id":"src.longcontext.bai-longbench-v2-2025","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","url":"https://aclanthology.org/2025.acl-long.183/"}],"status":"reported","summary":"The LongBench v2 authors report 53.7% human-expert accuracy with a 15-minute limit, 50.1% for the strongest directly answering model, and 57.7% for o1-preview using longer reasoning under their reported evaluation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.babilong-20-reasoning-tasks","kind":"claim","label":"BABILong distributes reasoning facts through long documents","sources":[{"id":"src.longcontext.kuratov-babilong-2024","title":"BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack","url":"https://arxiv.org/abs/2406.10149"}],"status":"reported","summary":"BABILong introduces 20 tasks involving fact chaining, induction, deduction, counting and lists or sets, designed to require reasoning over facts distributed through very long natural-language documents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.helmet-niah-vs-downstream","kind":"claim","label":"HELMET reported poor predictive validity of simple needle tests","sources":[{"id":"src.longcontext.yen-helmet-2025","title":"HELMET: How to Evaluate Long-Context Language Models Effectively and Thoroughly","url":"https://arxiv.org/abs/2410.02694"}],"status":"reported","summary":"In a study of 59 long-context models, the HELMET authors report that synthetic needle-in-a-haystack scores do not reliably predict downstream performance and that their different application-centered task categories have low correlations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.infinitybench-over100k","kind":"claim","label":"InfinityBench longer-than-100K-token benchmark design","sources":[{"id":"src.longcontext.zhang-infinitybench-2024","title":"∞Bench: Extending Long Context Evaluation Beyond 100K Tokens","url":"https://aclanthology.org/2024.acl-long.814/"}],"status":"reported","summary":"The 2024 InfinityBench paper describes a benchmark with average data length above 100K tokens and a mix of synthetic and realistic English and Chinese tasks intended to require long-distance dependencies rather than retrieval of isolated passages.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-original-design","kind":"claim","label":"Original LongBench multilingual multitask composition","sources":[{"id":"src.longcontext.bai-longbench-2024","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","url":"https://aclanthology.org/2024.acl-long.172/"}],"status":"reported","summary":"The original LongBench authors report 21 datasets in six task categories in English and Chinese, with average input lengths of 6,711 English words and 13,386 Chinese characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longcite-citation-pipeline","kind":"claim","label":"LongCite sentence-level citation generation workflow","sources":[{"id":"src.longcontext.zhang-longcite-2024","title":"LongCite: Enabling LLMs to Generate Fine-grained Citations in Long-context QA","url":"https://arxiv.org/abs/2409.02897"}],"status":"reported","summary":"The LongCite authors propose a Coarse-to-Fine pipeline producing long-context question-answer pairs with sentence-level citations and report using its LongCite-45k training data to train LongCite-8B and LongCite-9B.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-data-splittings-2026","kind":"claim","label":"JUNO 207-day atmospheric mass-splitting fits","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO analysis reported 8,294 inverse-beta-decay candidates in 207.2 live days at an average 52.5 km reactor baseline and obtained different fitted atmospheric mass splittings under normal and inverted ordering using a Daya Bay constraint.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-solar-parameters-2026","kind":"claim","label":"JUNO solar oscillation-parameter estimates","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO analysis reported sin²θ12=0.3036±0.0064 and Δm21²=(7.388±0.078)×10^-5 eV², with stated relative precisions of 2.1% and 1.1%, respectively.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-accelerator-ordering-indication-2026","kind":"claim","label":"JUNO combined ordering indication and Bayes factor","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO collaboration reported that incorporating long-baseline accelerator constraints on Δm31² favored normal over inverted neutrino mass ordering with one-sided significance of at least 2.1σ across CP-violating phases and a Bayesian Bayes factor of 10.18.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.katrin-endpoint-bound-259d","kind":"claim","label":"KATRIN effective electron-antineutrino mass bound","sources":[{"id":"src.neutrino.katrin-259days-mass-2024","title":"Direct neutrino-mass measurement based on 259 days of KATRIN data","url":"https://arxiv.org/abs/2406.13516"}],"status":"reported","summary":"KATRIN reported a fitted squared effective electron-antineutrino mass of -0.14 (+0.13/-0.15) eV² from five tritium beta-decay campaigns and an effective-mass upper limit of 0.45 eV at 90% confidence using 259 measurement days and 36 million electrons.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.kamlandzen-half-life-2024","kind":"claim","label":"KamLAND-Zen xenon-136 neutrinoless-decay half-life limit","sources":[{"id":"src.neutrino.kamlandzen-complete-2024","title":"Search for Majorana Neutrinos with the Complete KamLAND-Zen Dataset","url":"https://arxiv.org/abs/2406.11438"}],"status":"reported","summary":"The KamLAND-Zen full-dataset search with 745 kg enriched xenon and 2.1 tonne-years of xenon-136 exposure, combined with its previous phase, reported a 90%-confidence lower bound on the neutrinoless double-beta half-life of 3.8×10^26 years.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.kamlandzen-majorana-translation-2024","kind":"claim","label":"KamLAND-Zen nuclear-model-dependent effective Majorana bound","sources":[{"id":"src.neutrino.kamlandzen-complete-2024","title":"Search for Majorana Neutrinos with the Complete KamLAND-Zen Dataset","url":"https://arxiv.org/abs/2406.11438"}],"status":"reported","summary":"The KamLAND-Zen full-dataset report translated its neutrinoless xenon-136 double-beta half-life constraint into effective Majorana neutrino-mass upper limits ranging from 28 to 122 meV using phenomenological nuclear matrix-element calculations.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.planck-bao-mass-sum-2018","kind":"claim","label":"Planck 2018 plus BAO neutrino mass-sum bound","sources":[{"id":"src.neutrino.planck-2018-cosmological-parameters","title":"Planck 2018 results. VI. Cosmological parameters","url":"https://arxiv.org/abs/1807.06209"}],"status":"reported","summary":"The Planck 2018 cosmological-parameter analysis reported Σmν<0.12 eV as a 95% upper limit when combined with baryon acoustic oscillation data in its base spatially flat ΛCDM framework.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","kind":"claim","label":"DESI DR2 neutrino sum bound changes with dark-energy model","sources":[{"id":"src.neutrino.desi-dr2-bao-cosmology-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"The DESI DR2 analysis reported a 95% upper limit Σmν<0.064 eV for DESI BAO plus CMB under ΛCDM, versus Σmν<0.16 eV under a time-evolving w0wa dark-energy model using the same stated combination.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","kind":"claim","label":"DESI DR2 neutrino mass tension and boundary-sensitive inference","sources":[{"id":"src.neutrino.desi-dr2-neutrino-constraints-2025","title":"Constraints on Neutrino Physics from DESI DR2 BAO and DR1 Full Shape","url":"https://arxiv.org/abs/2503.14744"}],"status":"reported","summary":"The DESI DR2 neutrino-constraints analysis reported a Feldman-Cousins 95% bound Σmν<0.053 eV after correcting for the zero-mass boundary, below the oscillation-inferred lower limit, and a separate effective-mass parametrization yielding 3σ tension under its analysis assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.planck-prior-ordering-dependence-2019","kind":"claim","label":"Planck 2018 BAO mass bounds change under hierarchy priors","sources":[{"id":"src.neutrino.planck-ordering-prior-analysis-2019","title":"Updated results on neutrino mass and mass hierarchy from cosmology with Planck 2018 likelihoods","url":"https://arxiv.org/abs/1907.12598"}],"status":"reported","summary":"A Bayesian reanalysis using Planck 2018 CMB plus BOSS DR12, MGS and 6dFGS BAO data reported 95%-confidence neutrino mass-sum limits of 0.12 eV (degenerate masses), 0.15 eV (normal ordering) and 0.17 eV (inverted ordering), attributing their differences to mass-sum priors.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.isocurvature-mass-limits-2026","kind":"claim","label":"DESI and CMB neutrino constraints with isocurvature allowed","sources":[{"id":"src.neutrino.desi-isocurvature-mass-priors-2026","title":"Constraints on the Sum of Neutrino Masses from ACT DR6 and DESI DR2 Considering Isocurvature Initial Conditions","url":"https://arxiv.org/abs/2606.17994"}],"status":"reported","summary":"A 2026 joint CMB, DESI DR2 and supernova analysis reported that allowing a neutrino-density isocurvature mode shifted its 95% neutrino mass-sum limits from 0.052 to 0.057 eV under ΛCDM and 0.111 to 0.115 eV under dynamical dark energy, without detecting the isocurvature mode.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.isocurvature-hierarchy-prior-2026","kind":"claim","label":"Hierarchy-aware prior relaxes cosmological mass-sum bound","sources":[{"id":"src.neutrino.desi-isocurvature-mass-priors-2026","title":"Constraints on the Sum of Neutrino Masses from ACT DR6 and DESI DR2 Considering Isocurvature Initial Conditions","url":"https://arxiv.org/abs/2606.17994"}],"status":"reported","summary":"The 2026 cosmological isocurvature analysis reported that its purely adiabatic ΛCDM upper limit of 0.052 eV lay below the oscillation-implied normal-ordering minimum of 0.05878 eV because of a statistical prior extending to zero, while a hierarchy-informed prior raised the reported upper limit to 0.092 eV.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","kind":"model","label":"Kurvers spatial producer-scrounger evolutionary simulation","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"Kurvers and colleagues modeled group foraging with a spatially explicit genetic algorithm whose simulated agents could alternate between producing and scrounging; the exploration level and the probability of scrounging were distinct, evolving continuous traits each ranging from 0 to 1.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","kind":"claim","label":"Foraging patch density shifts exploration and scrounging in simulation","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers producer-scrounger simulations, increasing food-patch density favored higher exploration; it also reduced scrounging at low or intermediate patch richness, but this reduction disappeared at high patch richness.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","kind":"claim","label":"Food patch richness increases modeled scrounging","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers producer-scrounger simulations, richer food patches increased evolved scrounging propensities among both fast and slow explorers, while patch richness showed no effect on evolved exploration.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","kind":"claim","label":"No stable explorer-type polymorphism within simulated environments","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers evolutionary simulations, populations within a given environmental run approached one exploration optimum rather than retaining a stable coexistence of distinct explorer personality types.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","kind":"claim","label":"Thornton meerkat provisioning and monitoring sample sizes","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"Thornton analyzed 1,070 scorpion feeds by 347 meerkat helpers to 339 pups from 137 litters in 15 groups for prey-provisioning state, and recorded monitoring times for 6,148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","kind":"claim","label":"Meerkat pup age predicts intact versus disabled scorpion feeds","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s wild meerkat scorpion-feeding analysis, older pups were less likely to receive dead or disabled scorpions and more likely to receive intact scorpions, adjusting for significant modeled covariates.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","kind":"claim","label":"Helper age versus previous pup-care experience in scorpion provisioning","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s meerkat scorpion-provisioning analysis, older eligible helpers were more likely to give pups intact scorpions, whereas prior experience with earlier foraging litters showed no statistically significant association after controlling for helper age.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","kind":"claim","label":"Meerkat pup monitoring varies with prey movement size and pup age","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"For 6,148 observed meerkat pup feeds, helpers spent longer monitoring pups when provisioned prey was moving or larger and spent less time monitoring as pups grew older.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","kind":"claim","label":"Meerkat monitoring duration declines with nearby helpers and rain","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s meerkat feeding observations, pup monitoring duration decreased with larger litter size, higher recent rainfall, and the presence of another helper within two metres.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.balacuo-resistive-onset-1986","kind":"claim","label":"Ba-La-Cu-O: tentative 30 K onset (1986)","sources":[{"id":"source.bednorz-ibm-abstract","url":"https://research.ibm.com/publications/possible-high-tlessinfgreaterclessinfgreater-superconductivity-in-the-ba-la-cu-o-system"}],"status":"reported","summary":"Bednorz and Mueller reported an abrupt resistivity decrease of up to three orders of magnitude in multiphase, oxygen-deficient polycrystalline Ba-La-Cu-O samples, with the highest onset in the 30 K range and suppression at high current density; they described this as reminiscent of percolative superconductivity.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybcuo-80-93k-1987","kind":"claim","label":"Mixed-phase Y-Ba-Cu-O: 80–93 K transition (1987)","sources":[{"id":"source.wu-nasa-catalogue","url":"https://ntrs.nasa.gov/citations/19870046673"}],"status":"reported","summary":"NASA’s catalogue summary of Wu et al. reports a stable, reproducible superconductivity transition between 80 and 93 K in a mixed-phase Y-Ba-Cu-O compound system at ambient pressure, maintained in a liquid-nitrogen Dewar.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybco-grain-boundary-orientation-1988","kind":"claim","label":"YBCO grain-boundary orientation limits (1988)","sources":[{"id":"source.dimos-ibm-abstract","url":"https://research.ibm.com/publications/orientation-dependence-of-grain-boundary-critical-currents-in-yba2cu3o7-bicrystals"}],"status":"reported","summary":"Dimos et al. measured grain-boundary critical current densities as a function of basal-plane misorientation in YBCO bicrystals and concluded that strong texture both normal to and within the basal plane is important for very high critical currents in pure polycrystalline samples.","tags":[]},{"aliases":[],"domain":"engineering","era":"twentieth","frontier":false,"id":"engineering.biaxially-textured-ybco-tapes-1996","kind":"method","label":"Biaxially textured metal substrates for YBCO tapes (1996)","sources":[{"id":"source.goyal-rabits-1996","url":"https://api.crossref.org/works/10.1063/1.117489"}],"status":"reported","summary":"Goyal et al. reported a route using industrially scalable thermomechanical texturing of flexible metal substrates followed by epitaxial buffer layers and YBa2Cu3Ox films; the deposited films carried critical currents at 77 K in zero field and had field dependencies similar to epitaxial films on single-crystal ceramic substrates.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybco-tricrystal-half-flux-1994","kind":"experiment","label":"YBCO tricrystal half-flux evidence (1994)","sources":[{"id":"source.tsuei-ibm-abstract","url":"https://research.ibm.com/publications/pairing-symmetry-and-flux-quantization-in-a-tricrystal-superconducting-ring-of-yba2cu3o7-d"}],"status":"reported","summary":"Tsuei et al. used scanning SQUID microscopy at 4.2 K to observe spontaneous half-flux-quantum magnetization in a YBa2Cu3O7-delta ring with three grain-boundary Josephson junctions, but not in the two-junction rings; the authors reported consistency with d-wave pairing symmetry.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.bzo-ybco-in-field-current-2004","kind":"claim","label":"BaZrO3 additions enhance YBCO in-field current (2004)","sources":[{"id":"source.macmanus-driscoll-bzo","url":"https://arxiv.org/pdf/cond-mat/0406087"}],"status":"reported","summary":"MacManus-Driscoll et al. reported that BaZrO3 additions to pulsed-laser-deposited YBCO films improved thickness-accounted in-field critical current densities by about 1.5–2 times over roughly 1–5 T and about 5 times at 7 T in the studied single-crystal and IBAD-MgO substrate samples; the transport study used 75.5 K and associated the enhancement with stronger vortex pinning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.ybco-y2o3-high-field-wire-2021","kind":"technology","label":"Industrial YBCO/Y2O3 tape for high-field fusion magnets","sources":[{"id":"source.molodyk-mit-paper","url":"https://eng.s-innovations.ru/upload/iblock/4c4/4c4a3119a03bbb5b8113924ad1324714.pdf"}],"status":"reported","summary":"Molodyk et al. reported over 300 km of 4 mm-wide YBCO wire manufactured in nine months, with most delivered to CFS. In tested B-parallel-c samples with a 40 micrometre substrate and 5 micrometre copper stabilizer per side, engineering current density exceeded 1000 A/mm² at 20 K and 20 T and 2000 A/mm² at 4.2 K and 20 T; the formulation used Y2O3 nanoparticles without c-axis-correlated nanocolumnar defects.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.tfmc-nint-stack-in-plate","kind":"technology","label":"SPARC TFMC: NINT stack-in-plate magnet","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. described the built TFMC as a no-insulation, no-twist REBCO stack-in-plate magnet using 270 km of tape, weighing 10058 kg, with 16 single-pancake modules and two termination plates. REBCO stacks occupy spiral plate channels, with single-pass supercritical-helium coolant channels on the other side; vacuum-pressure solder impregnation provides mechanical protection and thermal/electrical connectivity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.tfmc-20-1t-demonstration","kind":"experiment","label":"SPARC TFMC: 20.1 T magnet demonstration","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported TFMC reaching 20.1 T peak field on the conductor at 40.5 kA terminal current, with 815 kN/m Lorentz loading on the REBCO stacks and almost 1 GPa stress accommodated by the structural case.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.tfmc-demountable-nanohm-joints","kind":"technology","label":"SPARC TFMC: demountable nanohm joints","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported fifteen internal demountable pancake-to-pancake TFMC joints operating with resistance in the 0.5–2.0 nanohm range at 20 K and magnetic fields up to 12 T.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.tfmc-open-circuit-quench-damage","kind":"experiment","label":"SPARC TFMC: deliberate quench caused local damage","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported localized thermal damage following an intentional open-circuit TFMC quench at 31.5 kA terminal current. The TFMC was deliberately not optimized for quench resiliency, so this experiment assessed passive self-protection rather than demonstrating damage-free protection for fusion-scale NINT coils.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.high-field-rebco-fusion-pathway","kind":"model","label":"High-field REBCO fusion pathway: proposal and qualification","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. describe a proposed fusion pathway using REBCO superconducting toroidal-field coils above 20 T peak field on the coil, corresponding to 8–12 T in the plasma center. The model-coil program qualifies representative-scale magnet technology for this pathway; stand-alone magnet qualification is distinct from demonstrated fusion electricity generation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.alce-metrics","kind":"claim","label":"ALCE evaluates fluency, correctness and citation quality","sources":[{"id":"src.citation.alce-gao-2023","title":"Enabling Large Language Models to Generate Text with Citations","url":"https://aclanthology.org/2023.emnlp-main.398/"}],"status":"reported","summary":"Gao et al. (2023) report that ALCE uses automatic metrics for fluency, correctness, and citation quality and that these metrics correlate strongly with human judgments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.alce-eli5","kind":"claim","label":"ALCE ELI5 evaluation found incomplete citation support","sources":[{"id":"src.citation.alce-gao-2023","title":"Enabling Large Language Models to Generate Text with Citations","url":"https://aclanthology.org/2023.emnlp-main.398/"}],"status":"reported","summary":"Gao et al. (2023) report that even the best models in their ELI5 evaluation lacked complete citation support 50% of the time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextcite-method","kind":"claim","label":"ContextCite contextual attribution method","sources":[{"id":"src.citation.contextcite-cohenwang-2024","title":"ContextCite: Attributing Model Generation to Context","url":"https://papers.nips.cc/paper_files/paper/2024/hash/adbea136219b64db96a9941e4249a857-Abstract-Conference.html"}],"status":"reported","summary":"Cohen-Wang et al. (2024) introduce ContextCite as a scalable method for attributing generated statements to supplied context, designed to operate on top of existing language models.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.finegrained-labels","kind":"claim","label":"Three-level evaluation of citation support","sources":[{"id":"src.citation.finegrained-zhang-2024","title":"Towards Fine-Grained Citation Evaluation in Generated Text: A Comparative Analysis of Faithfulness Metrics","url":"https://aclanthology.org/2024.inlg-main.35/"}],"status":"reported","summary":"Zhang et al. (2024) propose evaluating citation faithfulness metrics against three support levels: full, partial, and no support.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.finegrained-metrics","kind":"claim","label":"No consistently best fine-grained citation faithfulness metric","sources":[{"id":"src.citation.finegrained-zhang-2024","title":"Towards Fine-Grained Citation Evaluation in Generated Text: A Comparative Analysis of Faithfulness Metrics","url":"https://aclanthology.org/2024.inlg-main.35/"}],"status":"reported","summary":"Zhang et al. (2024) report that no single citation-faithfulness metric consistently performs best across their fine-grained evaluations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextprior-task","kind":"claim","label":"Context-prior augmented citation evaluation dimensions","sources":[{"id":"src.citation.contextprior-shen-2025","title":"Transparentize the Internal and External Knowledge Utilization in LLMs with Trustworthy Citation","url":"https://aclanthology.org/2025.findings-acl.919/"}],"status":"reported","summary":"Shen et al. (2025) introduce a citation-generation task considering external context and internal model knowledge, evaluated with five metrics addressing helpfulness, citation faithfulness, and trustworthiness.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.mirage-attribution","kind":"claim","label":"MIRAGE saliency-based answer attribution","sources":[{"id":"src.citation.mirage-qi-2024","title":"Model Internals-based Answer Attribution for Trustworthy Retrieval-Augmented Generation","url":"https://aclanthology.org/2024.emnlp-main.347/"}],"status":"reported","summary":"Qi et al. (2024) describe MIRAGE as identifying context-sensitive answer tokens and attributing them to retrieved documents using saliency methods.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.counterfactual-eval","kind":"claim","label":"Fluent counterfactuals for attribution-faithfulness evaluation","sources":[{"id":"src.citation.counterfactual-kamahi-2024","title":"Counterfactuals As a Means for Evaluating Faithfulness of Attribution Methods in Autoregressive Language Models","url":"https://aclanthology.org/2024.blackboxnlp-1.28/"}],"status":"reported","summary":"Kamahi et al. (2024) argue that removing or corrupting input tokens creates out-of-distribution inputs for autoregressive language models and propose fluent in-distribution counterfactuals for evaluating attribution methods.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.claimbench-limits","kind":"claim","label":"CLAIM-BENCH observed scientific claim-evidence reasoning limitations","sources":[{"id":"src.citation.claimbench-javaji-2025","title":"Can AI Validate Science? Benchmarking LLMs on Claim →Evidence Reasoning in AI Papers","url":"https://aclanthology.org/2025.ijcnlp-long.127/"}],"status":"reported","summary":"Javaji et al. (2025) report substantial limitations in processing scientific claim-evidence relationships when evaluating six LLMs on more than 300 claim-evidence pairs across multiple research domains.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.claimbench-prompting","kind":"claim","label":"Multi-pass prompting tradeoff in CLAIM-BENCH","sources":[{"id":"src.citation.claimbench-javaji-2025","title":"Can AI Validate Science? Benchmarking LLMs on Claim →Evidence Reasoning in AI Papers","url":"https://aclanthology.org/2025.ijcnlp-long.127/"}],"status":"reported","summary":"Javaji et al. (2025) report that three-pass and one-by-one prompting improve LLM claim-to-evidence linking in their evaluations, with increased computational cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.faithfulrag-conflict","kind":"claim","label":"FaithfulRAG models context-prior conflicts at fact level","sources":[{"id":"src.citation.faithfulrag-zhang-2025","title":"FaithfulRAG: Fact-Level Conflict Modeling for Context-Faithful Retrieval-Augmented Generation","url":"https://aclanthology.org/2025.acl-long.1062/"}],"status":"reported","summary":"Zhang et al. (2025) propose FaithfulRAG, which identifies fact-level conflicts between retrieved context and model knowledge and uses a self-thinking process before generating responses.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextdpo-gain","kind":"claim","label":"Reported Context-DPO context-faithfulness improvements","sources":[{"id":"src.citation.contextdpo-bi-2025","title":"Context-DPO: Aligning Language Models for Context-Faithfulness","url":"https://aclanthology.org/2025.findings-acl.536/"}],"status":"reported","summary":"Bi et al. (2025) report Context-DPO context-faithfulness improvements of 35% to 280% on popular open-source models in their experiments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-historical-depletion-2007","kind":"claim","label":"High Plains well-derived groundwater depletion through 2007","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report approximately 330 km³ of High Plains groundwater depletion from predevelopment in the 1950s through 2007, based on groundwater levels from 3,600 wells.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cv-historical-depletion-2003","kind":"claim","label":"Central Valley model-derived historical groundwater depletion","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report an estimated 140 km³ of Central Valley groundwater depletion from the 1860s through 2003, comprising 60 km³ before 1961 and 80 km³ during 1962–2003, based on groundwater models.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.groundwater-residual-method","kind":"claim","label":"GRACE groundwater inference requires subtraction of other water stores","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues describe deriving groundwater storage changes from GRACE total water storage by subtracting snow, reservoir surface-water and modeled soil-moisture storage changes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-satellite-well-correlation","kind":"claim","label":"High Plains GRACE-well groundwater estimates correlation","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report r² values of 0.7–0.8 between GRACE-derived groundwater storage changes and estimates from monitoring approximately 1,000 High Plains wells.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cv-drought-depletion-2006-2010","kind":"claim","label":"GRACE-derived Central Valley groundwater depletion during 2006–2010","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report GRACE-derived Central Valley groundwater depletion of 6–8 km³ per year, totaling 24–34 km³, between April 2006 and March 2010.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-storage-2019","kind":"claim","label":"USGS High Plains recoverable groundwater storage through 2019","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"McGuire and Strauch estimate that the High Plains aquifer contained approximately 2.91 billion acre-feet of recoverable groundwater in 2019, representing a decline of 286.4 million acre-feet, about 10%, since predevelopment.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-recovery-2017-2019","kind":"claim","label":"High Plains short-period groundwater recovery, 2017–2019","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"McGuire and Strauch report a High Plains aquifer area-weighted average water-level rise of 0.1 foot and an estimated increase of 1.6 million acre-feet of recoverable groundwater storage during 2017–2019.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-specific-yield","kind":"claim","label":"High Plains specific-yield assumptions in recoverable storage estimates","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"The USGS High Plains report gives an area-weighted mean specific yield of 15.1% for the aquifer excluding areas of little or no saturated thickness, with state means ranging from 8.1% in Wyoming to 18.5% in Oklahoma.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.jpl-mascon-gridding-v02","kind":"claim","label":"JPL GRACE mascon native and mapped grid distinction","sources":[{"id":"src.grace.jpl-rl06m-v02-documentation","title":"JPL GRACE and GRACE-FO Mascon RL06M version 02 Datasets Released","url":"https://podaac.jpl.nasa.gov/highlights/JPL_GRACE_and_GRACE-FO_Mascon_RL06M_v2_Datasets_Released"}],"status":"reported","summary":"NASA JPL describes its GRACE/GRACE-FO RL06M v02 solution as 4,551 relatively independent surface-mass estimates derived using an equal-area 3-degree mascon grid, subsequently mapped onto a 0.5-degree latitude-longitude grid.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cvhm2-simulation-period","kind":"claim","label":"Central Valley Hydrologic Model version 2 simulation period","sources":[{"id":"src.grace.centralvalley.usgs-cvhm2-model-data","title":"MODFLOW-OWHM Used to Characterize the Groundwater Flow System of the Central Valley","url":"https://www.usgs.gov/data/modflow-owhm-used-characterize-groundwater-flow-system-central-valley"}],"status":"reported","summary":"USGS describes Central Valley Hydrologic Model version 2 as using MODFLOW-OWHM to simulate groundwater and surface-water flow, irrigation, land subsidence and associated processes monthly from April 1961 through September 2019.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-bayesian-downscaling-2026","kind":"claim","label":"Bayesian joint inference from GRACE and High Plains groundwater wells","sources":[{"id":"src.grace.highplains.pakrashi-2026-downscaling","title":"Estimating water levels in the High Plains Aquifer by synthesizing satellite data with groundwater well observations","url":"https://arxiv.org/abs/2609.05753"}],"status":"reported","summary":"Pakrashi, Haran and Zuidema describe combining GRACE satellite measurements, groundwater-well observations and covariates using a Bayesian hierarchical framework to estimate High Plains groundwater variations over 2002–2022.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.confidence-sequences-uniform-coverage","kind":"claim","label":"Howard et al. confidence sequences over unbounded horizons","sources":[{"id":"src.anytime.howard-confidence-sequences-2021","title":"Time-uniform, nonparametric, nonasymptotic confidence sequences","url":"https://arxiv.org/abs/1810.08240"}],"status":"reported","summary":"Howard et al. report constructing shrinking confidence sequences with time-uniform, nonasymptotic coverage under nonparametric conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.vovk-wang-averaging-evalues","kind":"claim","label":"Vovk and Wang e-value averaging","sources":[{"id":"src.anytime.vovk-wang-e-calibration-2021","title":"E-values: Calibration, combination, and applications","url":"https://arxiv.org/abs/1912.06116"}],"status":"reported","summary":"Vovk and Wang report that multiple e-values for one hypothesis can be merged by averaging them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.xu-ramdas-elond-arbitrary-dependence","kind":"claim","label":"Xu and Ramdas e-LOND dependence-robust online FDR","sources":[{"id":"src.anytime.xu-ramdas-elond-2024","title":"Online multiple testing with e-values","url":"https://proceedings.mlr.press/v238/xu24a.html"}],"status":"reported","summary":"Xu and Ramdas report e-LOND control of online false discovery rate under arbitrary, possibly unknown, dependence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.waudbysmith-bounded-means-betting","kind":"claim","label":"Waudby-Smith and Ramdas bounded-mean betting inference","sources":[{"id":"src.anytime.waudbysmith-betting-means-2023","title":"Estimating means of bounded random variables by betting","url":"https://arxiv.org/abs/2010.09686"}],"status":"reported","summary":"Waudby-Smith and Ramdas report martingale-based confidence intervals and time-uniform sequences for bounded means, including sampling without replacement and adaptation to unknown variance.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.choe-ramdas-coarse-fine-incompatibility","kind":"claim","label":"Choe and Ramdas filtration-mismatch warning","sources":[{"id":"src.anytime.choe-ramdas-filtrations-2026","title":"Combining Evidence Across Filtrations","url":"https://arxiv.org/abs/2402.09698"}],"status":"reported","summary":"Choe and Ramdas report that e-process validity in a coarser filtration does not automatically hold in a finer filtration, preventing unadjusted averaging across them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.choe-ramdas-adjust-then-combine","kind":"claim","label":"Choe and Ramdas adjust-then-combine procedure","sources":[{"id":"src.anytime.choe-ramdas-filtrations-2026","title":"Combining Evidence Across Filtrations","url":"https://arxiv.org/abs/2402.09698"}],"status":"reported","summary":"Choe and Ramdas report an adjust-then-combine procedure lifting e-processes across filtrations, with a logarithmic validity-recovery cost.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.dwork-adaptive-holdout-validation","kind":"claim","label":"Dwork et al. reusable holdout for adaptive validation","sources":[{"id":"src.anytime.dwork-adaptive-generalization-2015","title":"Generalization in Adaptive Data Analysis and Holdout Reuse","url":"https://arxiv.org/abs/1506.02629"}],"status":"reported","summary":"Dwork et al. report that adaptive holdout reuse risks overfitting and propose an algorithm to validate many adaptively chosen hypotheses while avoiding that overfitting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.lee-lasso-postselection-conditioning","kind":"claim","label":"Lee et al. selection-conditional inference for lasso","sources":[{"id":"src.anytime.lee-post-selection-2016","title":"Exact post-selection inference, with application to the lasso","url":"https://arxiv.org/abs/1311.6238"}],"status":"reported","summary":"Lee et al. report selection-conditional inference for lasso-selected coefficients, including confidence intervals and tests.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.ramdas-admissible-martingale-necessity","kind":"claim","label":"Ramdas et al. necessity of martingales for admissible anytime-valid inference","sources":[{"id":"src.anytime.ramdas-admissible-2022","title":"Admissible anytime-valid sequential inference must rely on nonnegative martingales","url":"https://arxiv.org/abs/2009.03167"}],"status":"reported","summary":"Ramdas et al. report that all admissible confidence sequences, p-processes and e-processes rely on nonnegative martingales under their formal admissibility definition.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.happy-code-flm-experimental-test","kind":"claim","label":"FLM formula test in a trapped-ion HaPPY code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in a trapped-ion implementation of the HaPPY holographic code.","tags":["holographic-codes","quantum-simulation","entanglement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.happy-code-magic-entropic-precursors","kind":"claim","label":"Entropic precursors of emergent gravity in a modified holographic code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report observing entropic precursors expected of emergent gravity after introducing non-stabilizerness into their holographic-code model.","tags":["holographic-codes","non-stabilizerness","emergent-gravity"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.holographic-code-wormhole-entropic-behavior","kind":"claim","label":"Wormhole-like entropic behavior in a quantum code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report constructing and measuring a quantum code whose entropic behavior resembles that of a highly quantum wormhole.","tags":["holographic-codes","quantum-wormholes","entanglement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.grb090510-energy-separated-photon-arrivals","kind":"claim","label":"Nearly simultaneous arrival of widely separated photon energies from GRB 090510","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA reports that two photons from GRB 090510, differing in energy by a factor of one million, arrived at Fermi nearly simultaneously after traveling more than 7.3 billion light-years.","tags":["GRB-090510","Fermi-LAT","Lorentz-invariance"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.grb090510-energy-dispersion-constraint","kind":"claim","label":"GRB 090510 constraint on energy-dependent light speed","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA reports that GRB 090510 placed a strong constraint on variation of light speed with photon energy, with high- and low-energy gamma rays arriving within one second after traveling approximately seven billion light-years.","tags":["GRB-090510","Lorentz-invariance","photon-dispersion"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.fermi-gbm-detection-coverage","kind":"claim","label":"Fermi GBM detector coverage and burst detection rate","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA describes the Fermi Gamma-ray Burst Monitor as having 14 detectors covering the unobscured sky, detecting approximately 240 gamma-ray bursts per year across an energy range of 8 keV to 40 MeV.","tags":["Fermi-GBM","gamma-ray-bursts","instrumentation"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.algorithm","kind":"concept","label":"algorithm","sources":[{"id":"nist-dads.algorithm","title":"NIST Dictionary of Algorithms and Data Structures: algorithm","url":"https://xlinux.nist.gov/dads/HTML/algorithm.html"}],"status":"reported","summary":"NIST DADS defines algorithm as: A computable set of steps to achieve a desired result.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.datastructure","kind":"concept","label":"data structure","sources":[{"id":"nist-dads.datastructure","title":"NIST Dictionary of Algorithms and Data Structures: dataStructure","url":"https://xlinux.nist.gov/dads/HTML/dataStructure.html"}],"status":"reported","summary":"NIST DADS defines data structure as: An organization of information, usually in memory, for better algorithm efficiency , such as queue , stack , linked list , heap , dictionary , and tree , or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.search","kind":"method","label":"search","sources":[{"id":"nist-dads.search","title":"NIST Dictionary of Algorithms and Data Structures: search","url":"https://xlinux.nist.gov/dads/HTML/search.html"}],"status":"reported","summary":"NIST DADS defines search as: Look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sort","kind":"method","label":"sort","sources":[{"id":"nist-dads.sort","title":"NIST Dictionary of Algorithms and Data Structures: sort","url":"https://xlinux.nist.gov/dads/HTML/sort.html"}],"status":"reported","summary":"NIST DADS defines sort as: Arrange items in a predetermined order. There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the keys , the cost of comparing keys vs. the cost of moving items, etc. Most algorithms can be implemented as an in-place sort , and many can be implemented so they are stable , too. Formal Definition: The sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows. S′ i ≤ S′ i+1 , 0 < i < N (the items are in order) and S′ is a permutation of S.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.binarysearch","kind":"method","label":"binary search","sources":[{"id":"nist-dads.binarysearch","title":"NIST Dictionary of Algorithms and Data Structures: binarySearch","url":"https://xlinux.nist.gov/dads/HTML/binarySearch.html"}],"status":"reported","summary":"NIST DADS defines binary search as: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.linearsearch","kind":"method","label":"linear search","sources":[{"id":"nist-dads.linearsearch","title":"NIST Dictionary of Algorithms and Data Structures: linearSearch","url":"https://xlinux.nist.gov/dads/HTML/linearSearch.html"}],"status":"reported","summary":"NIST DADS defines linear search as: Search an array or list by checking items one at a time. Also known as sequential search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.mergesort","kind":"method","label":"merge sort","sources":[{"id":"nist-dads.mergesort","title":"NIST Dictionary of Algorithms and Data Structures: mergesort","url":"https://xlinux.nist.gov/dads/HTML/mergesort.html"}],"status":"reported","summary":"NIST DADS defines merge sort as: A sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence. Run time is Θ (n log n).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quicksort","kind":"method","label":"quicksort","sources":[{"id":"nist-dads.quicksort","title":"NIST Dictionary of Algorithms and Data Structures: quicksort","url":"https://xlinux.nist.gov/dads/HTML/quicksort.html"}],"status":"reported","summary":"NIST DADS defines quicksort as: Pick an element from the array (the pivot), partition the remaining elements into those greater than and less than this pivot, and recursively sort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heapsort","kind":"method","label":"heapsort","sources":[{"id":"nist-dads.heapsort","title":"NIST Dictionary of Algorithms and Data Structures: heapSort","url":"https://xlinux.nist.gov/dads/HTML/heapSort.html"}],"status":"reported","summary":"NIST DADS defines heapsort as: A sort algorithm that builds a heap , then repeatedly extracts the maximum item. Run time is O(n log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.insertionsort","kind":"method","label":"insertion sort","sources":[{"id":"nist-dads.insertionsort","title":"NIST Dictionary of Algorithms and Data Structures: insertionSort","url":"https://xlinux.nist.gov/dads/HTML/insertionSort.html"}],"status":"reported","summary":"NIST DADS defines insertion sort as: Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted. Run time is O(n 2 ) because of moves. Also known as linear insertion sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.selectionsort","kind":"method","label":"selection sort","sources":[{"id":"nist-dads.selectionsort","title":"NIST Dictionary of Algorithms and Data Structures: selectionSort","url":"https://xlinux.nist.gov/dads/HTML/selectionSort.html"}],"status":"reported","summary":"NIST DADS defines selection sort as: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²) , where n is the number of elements. The number of swaps is O(n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bubblesort","kind":"method","label":"bubble sort","sources":[{"id":"nist-dads.bubblesort","title":"NIST Dictionary of Algorithms and Data Structures: bubblesort","url":"https://xlinux.nist.gov/dads/HTML/bubblesort.html"}],"status":"reported","summary":"NIST DADS defines bubble sort as: Sort by comparing each adjacent pair of items in a list in turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done. Also known as sinking sort, exchange sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.countingsort","kind":"method","label":"counting sort","sources":[{"id":"nist-dads.countingsort","title":"NIST Dictionary of Algorithms and Data Structures: countingsort","url":"https://xlinux.nist.gov/dads/HTML/countingsort.html"}],"status":"reported","summary":"NIST DADS defines counting sort as: A 2-pass sort algorithm that is efficient when the number of distinct keys is small compared to the number of items. The first pass counts the occurrences of each key in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding keys. The second pass puts each item in its final place according to the auxiliary entry for that key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.radixsort","kind":"method","label":"radix sort","sources":[{"id":"nist-dads.radixsort","title":"NIST Dictionary of Algorithms and Data Structures: radixsort","url":"https://xlinux.nist.gov/dads/HTML/radixsort.html"}],"status":"reported","summary":"NIST DADS defines radix sort as: A multiple pass distribution sort algorithm that distributes each item to a bucket according to part of the item's key beginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bucketsort","kind":"method","label":"bucket sort","sources":[{"id":"nist-dads.bucketsort","title":"NIST Dictionary of Algorithms and Data Structures: bucketsort","url":"https://xlinux.nist.gov/dads/HTML/bucketsort.html"}],"status":"reported","summary":"NIST DADS defines bucket sort as: A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key . Each bucket is sorted if necessary, and the buckets' contents are concatenated. Also known as bin sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bintree","kind":"concept","label":"bintree","sources":[{"id":"nist-dads.bintree","title":"NIST Dictionary of Algorithms and Data Structures: bintree","url":"https://xlinux.nist.gov/dads/HTML/bintree.html"}],"status":"reported","summary":"NIST DADS defines bintree as: A regular decomposition k-d tree for region data.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarysearchtree","kind":"concept","label":"binary search tree","sources":[{"id":"nist-dads.binarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: binarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/binarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines binary search tree as: A binary tree where every node's left subtree has keys less than the node's key, and every right subtree has keys greater than the node's key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.avltree","kind":"concept","label":"AVL tree","sources":[{"id":"nist-dads.avltree","title":"NIST Dictionary of Algorithms and Data Structures: avltree","url":"https://xlinux.nist.gov/dads/HTML/avltree.html"}],"status":"reported","summary":"NIST DADS defines AVL tree as: A balanced binary search tree where the height of the two subtrees ( children ) of a node differs by at most one. Look-up, insertion, and deletion are O(log n) , where n is the number of nodes in the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.redblack","kind":"concept","label":"red-black tree","sources":[{"id":"nist-dads.redblack","title":"NIST Dictionary of Algorithms and Data Structures: redblack","url":"https://xlinux.nist.gov/dads/HTML/redblack.html"}],"status":"reported","summary":"NIST DADS defines red-black tree as: A nearly-balanced tree that uses an extra bit per node to maintain balance. No leaf is more than twice as far from the root as any other. Formal Definition: A red-black tree with n internal nodes has height at most 2log 2 (n+1). Also known as symmetric binary B-tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heap","kind":"concept","label":"heap","sources":[{"id":"nist-dads.heap","title":"NIST Dictionary of Algorithms and Data Structures: heap","url":"https://xlinux.nist.gov/dads/HTML/heap.html"}],"status":"reported","summary":"NIST DADS defines heap as: A complete tree where every node has a key more extreme (greater or less) than or equal to the key of its parent . Usually understood to be a binary heap .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.queue","kind":"concept","label":"queue","sources":[{"id":"nist-dads.queue","title":"NIST Dictionary of Algorithms and Data Structures: queue","url":"https://xlinux.nist.gov/dads/HTML/queue.html"}],"status":"reported","summary":"NIST DADS defines queue as: A collection of items in which only the earliest added item may be accessed. Basic operations are add (to the tail ) or enqueue and delete (from the head ) or dequeue. Delete returns the item removed. Also known as \"first-in, first-out\" or FIFO. Formal Definition: It is convenient to define delete or dequeue in terms of remove and a new operation, front. The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with axiomatic semantics as follows. new() returns a queue front(add(v, new())) = v remove(add(v, new())) = new() front(add(v, add(w, Q))) = front(add(w, Q)) remove(add(v, add(w, Q))) = add(v, remove(add(w, Q))) where Q is a queue and v and w are values. Also known as FIFO.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stack","kind":"concept","label":"stack","sources":[{"id":"nist-dads.stack","title":"NIST Dictionary of Algorithms and Data Structures: stack","url":"https://xlinux.nist.gov/dads/HTML/stack.html"}],"status":"reported","summary":"NIST DADS defines stack as: A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO. Formal Definition: The operations new(), push(v, S), top(S), and popoff(S) may be defined with axiomatic semantics as follows. new() returns a stack popoff(push(v, S)) = S top(push(v, S)) = v where S is a stack and v is a value. The pop operation is a combination of top, to return the top value, and popoff, to remove the top value. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(push(v, S)) = false Also known as LIFO.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linkedlist","kind":"concept","label":"linked list","sources":[{"id":"nist-dads.linkedlist","title":"NIST Dictionary of Algorithms and Data Structures: linkedList","url":"https://xlinux.nist.gov/dads/HTML/linkedList.html"}],"status":"reported","summary":"NIST DADS defines linked list as: A list implemented by each item having a link to the next item. Also known as singly linked list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.doublylinkedlist","kind":"concept","label":"doubly linked list","sources":[{"id":"nist-dads.doublylinkedlist","title":"NIST Dictionary of Algorithms and Data Structures: doublyLinkedList","url":"https://xlinux.nist.gov/dads/HTML/doublyLinkedList.html"}],"status":"reported","summary":"NIST DADS defines doubly linked list as: A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time. Also known as two-way linked list, symmetrically linked list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graph","kind":"concept","label":"graph","sources":[{"id":"nist-dads.graph","title":"NIST Dictionary of Algorithms and Data Structures: graph","url":"https://xlinux.nist.gov/dads/HTML/graph.html"}],"status":"reported","summary":"NIST DADS defines graph as: A set of items connected by edges . Each item is called a vertex or node . Formally, a graph is a set of vertices and a binary relation between vertices, adjacency. Formal Definition: A graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is symmetric , or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow self-loops , adjacency is irreflexive .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dijkstraalgo","kind":"method","label":"Dijkstra's algorithm","sources":[{"id":"nist-dads.dijkstraalgo","title":"NIST Dictionary of Algorithms and Data Structures: dijkstraalgo","url":"https://xlinux.nist.gov/dads/HTML/dijkstraalgo.html"}],"status":"reported","summary":"NIST DADS defines Dijkstra's algorithm as: An algorithm to find the shortest paths from a single source vertex to all other vertices in a weighted, directed graph . All weights must be nonnegative.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bellmanford","kind":"method","label":"Bellman-Ford algorithm","sources":[{"id":"nist-dads.bellmanford","title":"NIST Dictionary of Algorithms and Data Structures: bellmanford","url":"https://xlinux.nist.gov/dads/HTML/bellmanford.html"}],"status":"reported","summary":"NIST DADS defines Bellman-Ford algorithm as: An efficient algorithm to solve the single-source shortest-path problem . Weights may be negative. The algorithm initializes the distance to the source vertex to 0 and all other vertices to ∞. It then does V-1 passes (V is the number of vertices) over all edges relaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight cycles , in which case it returns false. The time complexity is O(VE) , where E is the number of edges. Also known as Ford-Bellman.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologicalsort","kind":"concept","label":"topological sort","sources":[{"id":"nist-dads.topologicalsort","title":"NIST Dictionary of Algorithms and Data Structures: topologicalSort","url":"https://xlinux.nist.gov/dads/HTML/topologicalSort.html"}],"status":"reported","summary":"NIST DADS defines topological sort as: To arrange items when some pairs of items have no comparison, that is, according to a partial order .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumspanningtree","kind":"concept","label":"minimum spanning tree","sources":[{"id":"nist-dads.minimumspanningtree","title":"NIST Dictionary of Algorithms and Data Structures: minimumSpanningTree","url":"https://xlinux.nist.gov/dads/HTML/minimumSpanningTree.html"}],"status":"reported","summary":"NIST DADS defines minimum spanning tree as: A minimum-weight tree in a weighted graph which contains all of the graph's vertices . Also known as MST, shortest spanning tree, SST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.primjarnik","kind":"method","label":"Prim-Jarnik algorithm","sources":[{"id":"nist-dads.primjarnik","title":"NIST Dictionary of Algorithms and Data Structures: primJarnik","url":"https://xlinux.nist.gov/dads/HTML/primJarnik.html"}],"status":"reported","summary":"NIST DADS defines Prim-Jarnik algorithm as: Compute a minimum spanning tree by beginning with any vertex as the current tree . At each step add a least edge between any vertex not in the tree and any vertex in the tree. Continue until all vertices have been added.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.divideandconquer","kind":"method","label":"divide and conquer","sources":[{"id":"nist-dads.divideandconquer","title":"NIST Dictionary of Algorithms and Data Structures: divideAndConquer","url":"https://xlinux.nist.gov/dads/HTML/divideAndConquer.html"}],"status":"reported","summary":"NIST DADS defines divide and conquer as: Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by dividing it into two or more smaller instances. Each of these smaller instances is recursively solved, and the solutions are combined to produce a solution for the original instance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.backtrack","kind":"method","label":"backtracking","sources":[{"id":"nist-dads.backtrack","title":"NIST Dictionary of Algorithms and Data Structures: backtrack","url":"https://xlinux.nist.gov/dads/HTML/backtrack.html"}],"status":"reported","summary":"NIST DADS defines backtracking as: Find a solution by trying one of several choices. If the choice proves incorrect, computation backtracks or restarts at the point of choice and tries another choice. It is often convenient to maintain choice points and alternate choices using recursion .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trie","kind":"concept","label":"trie","sources":[{"id":"nist-dads.trie","title":"NIST Dictionary of Algorithms and Data Structures: trie","url":"https://xlinux.nist.gov/dads/HTML/trie.html"}],"status":"reported","summary":"NIST DADS defines trie as: A tree for storing strings in which there is one node for every common prefix . The strings are stored in extra leaf nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.btree","kind":"concept","label":"B-tree","sources":[{"id":"nist-dads.btree","title":"NIST Dictionary of Algorithms and Data Structures: btree","url":"https://xlinux.nist.gov/dads/HTML/btree.html"}],"status":"reported","summary":"NIST DADS defines B-tree as: A balanced search tree in which every node has between ⌈ m/2⌉ and m children , where m>1 is a fixed integer. m is the order . The root may have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the height , and hence the number of accesses, can be kept small, say one or two, by picking a large m. Also known as balanced multiway tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitestatemachine","kind":"concept","label":"finite state machine","sources":[{"id":"nist-dads.finitestatemachine","title":"NIST Dictionary of Algorithms and Data Structures: finiteStateMachine","url":"https://xlinux.nist.gov/dads/HTML/finiteStateMachine.html"}],"status":"reported","summary":"NIST DADS defines finite state machine as: A model of computation consisting of a set of states , a start state , an input alphabet , and a transition function that maps input symbols and current states to a next state . Computation begins in the start state with an input string. It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions ( Mealy machine ) or states ( Moore machine ), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state ( nondeterministic finite state machine ), one or more states designated as accepting states ( recognizer ), etc. Also known as finite state automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedbitr","kind":"concept","label":"balanced binary tree","sources":[{"id":"nist-dads.balancedbitr","title":"NIST Dictionary of Algorithms and Data Structures: balancedbitr","url":"https://xlinux.nist.gov/dads/HTML/balancedbitr.html"}],"status":"reported","summary":"NIST DADS defines balanced binary tree as: A binary tree where no leaf is more than a certain amount farther from the root than any other. After inserting or deleting a node , the tree may rebalanced with rotations .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.priorityque","kind":"concept","label":"priority queue","sources":[{"id":"nist-dads.priorityque","title":"NIST Dictionary of Algorithms and Data Structures: priorityque","url":"https://xlinux.nist.gov/dads/HTML/priorityque.html"}],"status":"reported","summary":"NIST DADS defines priority queue as: An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues ( meld ), delete an arbitrary item, and increase the priority of a item (decrease-key). Formal Definition: The operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with axiomatic semantics as follows. new() returns a priority queue min(insert(v, new())) = v dm(insert(v, new())) = new() min(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then v else min(insert(w, PQ)) dm(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then insert(w, PQ) else insert(v, dm(insert(w, PQ))) where PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashtab","kind":"concept","label":"hash table","sources":[{"id":"nist-dads.hashtab","title":"NIST Dictionary of Algorithms and Data Structures: hashtab","url":"https://xlinux.nist.gov/dads/HTML/hashtab.html"}],"status":"reported","summary":"NIST DADS defines hash table as: A dictionary in which keys are mapped to array positions by hash functions . Having the keys of more than one item map to the same position is called a collision . There are many collision resolution schemes , but they may be divided into open addressing , chaining , and keeping one special overflow area. Perfect hashing avoids collisions, but may be time-consuming to create. Also known as scatter storage.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.breadthfirst","kind":"method","label":"breadth-first search","sources":[{"id":"nist-dads.breadthfirst","title":"NIST Dictionary of Algorithms and Data Structures: breadthfirst","url":"https://xlinux.nist.gov/dads/HTML/breadthfirst.html"}],"status":"reported","summary":"NIST DADS defines breadth-first search as: Any search algorithm that considers neighbors of a vertex , that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.depthfirst","kind":"method","label":"depth-first search","sources":[{"id":"nist-dads.depthfirst","title":"NIST Dictionary of Algorithms and Data Structures: depthfirst","url":"https://xlinux.nist.gov/dads/HTML/depthfirst.html"}],"status":"reported","summary":"NIST DADS defines depth-first search as: (1) Any search algorithm that considers outgoing edges ( children ) of a vertex before any of the vertex's siblings , that is, outgoing edges of the vertex's predecessor in the search. Extremes are searched first. This is easily implemented with recursion . (2) An algorithm that marks all vertices in a directed graph in the order they are discovered and finished, partitioning the graph into a forest . Also known as DFS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.kruskalsalgo","kind":"method","label":"Kruskal's algorithm","sources":[{"id":"nist-dads.kruskalsalgo","title":"NIST Dictionary of Algorithms and Data Structures: kruskalsalgo","url":"https://xlinux.nist.gov/dads/HTML/kruskalsalgo.html"}],"status":"reported","summary":"NIST DADS defines Kruskal's algorithm as: An algorithm for computing a minimum spanning tree . It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest edge in the graph whose vertices are in different partial minimum spanning trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dynamicprog","kind":"method","label":"dynamic programming","sources":[{"id":"nist-dads.dynamicprog","title":"NIST Dictionary of Algorithms and Data Structures: dynamicprog","url":"https://xlinux.nist.gov/dads/HTML/dynamicprog.html"}],"status":"reported","summary":"NIST DADS defines dynamic programming as: Solve an optimization problem by caching subproblem solutions ( memoization ) rather than recomputing them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greedyalgo","kind":"method","label":"greedy algorithm","sources":[{"id":"nist-dads.greedyalgo","title":"NIST Dictionary of Algorithms and Data Structures: greedyalgo","url":"https://xlinux.nist.gov/dads/HTML/greedyalgo.html"}],"status":"reported","summary":"NIST DADS defines greedy algorithm as: An algorithm that always takes the best immediate, or local, solution while finding an answer. Greedy algorithms find the overall, or globally, optimal solution for some optimization problems , but may find less-than-optimal solutions for some instances of other problems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarytree","kind":"concept","label":"binary tree","sources":[{"id":"nist-dads.binarytree","title":"NIST Dictionary of Algorithms and Data Structures: binarytree","url":"https://xlinux.nist.gov/dads/HTML/binarytree.html"}],"status":"reported","summary":"NIST DADS defines binary tree as: A tree with at most two children for each node . Formal Definition: A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree. Also known as dyadic tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directedgraph","kind":"concept","label":"directed graph","sources":[{"id":"nist-dads.directedgraph","title":"NIST Dictionary of Algorithms and Data Structures: directedGraph","url":"https://xlinux.nist.gov/dads/HTML/directedGraph.html"}],"status":"reported","summary":"NIST DADS defines directed graph as: A graph whose edges are ordered pairs of vertices . That is, each edge can be followed from one vertex to another vertex. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}. Also known as digraph, oriented graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determfinitstatemach","kind":"concept","label":"deterministic finite state machine","sources":[{"id":"nist-dads.determfinitstatemach","title":"NIST Dictionary of Algorithms and Data Structures: determFinitStateMach","url":"https://xlinux.nist.gov/dads/HTML/determFinitStateMach.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite state machine as: A finite state machine with at most one transition for each symbol and state . Also known as DFA, deterministic finite automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermfinitestatemach","kind":"concept","label":"nondeterministic finite state machine","sources":[{"id":"nist-dads.nondetermfinitestatemach","title":"NIST Dictionary of Algorithms and Data Structures: nondetermFiniteStateMach","url":"https://xlinux.nist.gov/dads/HTML/nondetermFiniteStateMach.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic finite state machine as: A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states . The transition function also may map the null symbol (no input symbol needed) and states to next states. Also known as NFA, nondeterministic finite automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.array","kind":"concept","label":"array","sources":[{"id":"nist-dads.array","title":"NIST Dictionary of Algorithms and Data Structures: array","url":"https://xlinux.nist.gov/dads/HTML/array.html"}],"status":"reported","summary":"NIST DADS defines array as: An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and get(i, A), where i is a numeric index, v is a value, and A is an array. The operations may be defined with axiomatic semantics as follows. new() returns an array get(i, set(i, v, A)) = v get(i, set(j, v, A)) = get(i, A) if i ≠ j Compare this with a dictionary using integers as keys. If the contents of a new array are set to some implicit initial value v i , we could add the following rule for get. get(i, new()) = v i Typically arrays have a fixed size and use either 0-based indexing or 1-based indexing . Fixed initial size and 0-based indexing may incorporated as follows. new(s) returns an array, which has a size s size(new(s)) = s size(set(i, v, A)) = size(A) get(i, set(i, v, A)) = v if 0 ≤ i < size(A) get(i, set(j, v, A)) = get(i, A) if i ≠ j One-based or other indexing may be defined similarly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.list","kind":"concept","label":"list","sources":[{"id":"nist-dads.list","title":"NIST Dictionary of Algorithms and Data Structures: list","url":"https://xlinux.nist.gov/dads/HTML/list.html"}],"status":"reported","summary":"NIST DADS defines list as: A collection of items accessible one after another beginning at the head and ending at the tail .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.set","kind":"concept","label":"set","sources":[{"id":"nist-dads.set","title":"NIST Dictionary of Algorithms and Data Structures: set","url":"https://xlinux.nist.gov/dads/HTML/set.html"}],"status":"reported","summary":"NIST DADS defines set as: An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a universe , (2) either each element is a member of the set or it is not, and (3) the elements are unordered. Formal Definition: As an abstract data type , a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with axiomatic semantics as follows. new() returns a set isIn(v, new()) = false isIn(v, add(v, S)) = true isIn(v, add(u, S)) = isIn(v , S) if v ≠ u remove(v, new()) = new() remove(v, add(v, S)) = remove(v, S) remove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u where S is a set and u and v are elements. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, S)) = false","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tree","kind":"concept","label":"tree","sources":[{"id":"nist-dads.tree","title":"NIST Dictionary of Algorithms and Data Structures: tree","url":"https://xlinux.nist.gov/dads/HTML/tree.html"}],"status":"reported","summary":"NIST DADS defines tree as: (1) A data structure accessed beginning at the root node. Each node is either a leaf or an internal node . An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A connected , undirected , acyclic graph . It is rooted and ordered unless otherwise specified. Thanks to Joshua O'Madadhain ( [email protected] ) for the figure, 6 October 2005. Formal Definition: (1) A tree is either empty (no nodes), or a root and zero or more subtrees. The subtrees are ordered.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.root","kind":"concept","label":"root","sources":[{"id":"nist-dads.root","title":"NIST Dictionary of Algorithms and Data Structures: root","url":"https://xlinux.nist.gov/dads/HTML/root.html"}],"status":"reported","summary":"NIST DADS defines root as: The distinguished initial or fundamental item of a tree . The only item which has no parent . See the figure at tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leaf","kind":"concept","label":"leaf","sources":[{"id":"nist-dads.leaf","title":"NIST Dictionary of Algorithms and Data Structures: leaf","url":"https://xlinux.nist.gov/dads/HTML/leaf.html"}],"status":"reported","summary":"NIST DADS defines leaf as: A node in a tree without any children . See the figure at tree . Also known as external node, terminal node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edge","kind":"concept","label":"edge","sources":[{"id":"nist-dads.edge","title":"NIST Dictionary of Algorithms and Data Structures: edge","url":"https://xlinux.nist.gov/dads/HTML/edge.html"}],"status":"reported","summary":"NIST DADS defines edge as: A connection between two vertices of a graph . In a weighted graph , each edge has an number, called a \"weight\". In a directed graph , an edge goes from one vertex, the source , to another, the target , and hence makes connection in only one direction. Also known as arc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertex","kind":"concept","label":"vertex","sources":[{"id":"nist-dads.vertex","title":"NIST Dictionary of Algorithms and Data Structures: vertex","url":"https://xlinux.nist.gov/dads/HTML/vertex.html"}],"status":"reported","summary":"NIST DADS defines vertex as: An item in a graph . Sometimes referred to as a node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.path","kind":"concept","label":"path","sources":[{"id":"nist-dads.path","title":"NIST Dictionary of Algorithms and Data Structures: path","url":"https://xlinux.nist.gov/dads/HTML/path.html"}],"status":"reported","summary":"NIST DADS defines path as: A list of vertices of a graph where each vertex has an edge between it and the next vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cycle","kind":"concept","label":"cycle","sources":[{"id":"nist-dads.cycle","title":"NIST Dictionary of Algorithms and Data Structures: cycle","url":"https://xlinux.nist.gov/dads/HTML/cycle.html"}],"status":"reported","summary":"NIST DADS defines cycle as: A path that starts and ends at the same vertex and includes at least one edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weightedgraph","kind":"concept","label":"weighted graph","sources":[{"id":"nist-dads.weightedgraph","title":"NIST Dictionary of Algorithms and Data Structures: weightedGraph","url":"https://xlinux.nist.gov/dads/HTML/weightedGraph.html"}],"status":"reported","summary":"NIST DADS defines weighted graph as: A graph having a weight, or number, associated with each edge . Some algorithms require all weights to be nonnegative, integral, positive, etc. Also known as edge-weighted graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.connectedgraph","kind":"concept","label":"connected graph","sources":[{"id":"nist-dads.connectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: connectedGraph","url":"https://xlinux.nist.gov/dads/HTML/connectedGraph.html"}],"status":"reported","summary":"NIST DADS defines connected graph as: An undirected graph that has a path between every pair of vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completegraph","kind":"concept","label":"complete graph","sources":[{"id":"nist-dads.completegraph","title":"NIST Dictionary of Algorithms and Data Structures: completeGraph","url":"https://xlinux.nist.gov/dads/HTML/completeGraph.html"}],"status":"reported","summary":"NIST DADS defines complete graph as: An undirected graph with an edge between every pair of vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bipartgraph","kind":"concept","label":"bipartite graph","sources":[{"id":"nist-dads.bipartgraph","title":"NIST Dictionary of Algorithms and Data Structures: bipartgraph","url":"https://xlinux.nist.gov/dads/HTML/bipartgraph.html"}],"status":"reported","summary":"NIST DADS defines bipartite graph as: An undirected graph where vertices can be partition ed into two sets such that no edge connects vertices in the same set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directacycgraph","kind":"concept","label":"directed acyclic graph","sources":[{"id":"nist-dads.directacycgraph","title":"NIST Dictionary of Algorithms and Data Structures: directAcycGraph","url":"https://xlinux.nist.gov/dads/HTML/directAcycGraph.html"}],"status":"reported","summary":"NIST DADS defines directed acyclic graph as: A directed graph with no path that starts and ends at the same vertex . Also known as DAG, acyclic directed graph, oriented acyclic graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.abstractdatatype","kind":"concept","label":"abstract data type","sources":[{"id":"nist-dads.abstractdatatype","title":"NIST Dictionary of Algorithms and Data Structures: abstractDataType","url":"https://xlinux.nist.gov/dads/HTML/abstractDataType.html"}],"status":"reported","summary":"NIST DADS defines abstract data type as: A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circularlist","kind":"concept","label":"circular list","sources":[{"id":"nist-dads.circularlist","title":"NIST Dictionary of Algorithms and Data Structures: circularlist","url":"https://xlinux.nist.gov/dads/HTML/circularlist.html"}],"status":"reported","summary":"NIST DADS defines circular list as: A variant of a linked list in which the nominal tail is linked to the head . The entire list may be accessed starting at any item and following links until one comes to the starting item again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circularqueue","kind":"concept","label":"circular queue","sources":[{"id":"nist-dads.circularqueue","title":"NIST Dictionary of Algorithms and Data Structures: circularQueue","url":"https://xlinux.nist.gov/dads/HTML/circularQueue.html"}],"status":"reported","summary":"NIST DADS defines circular queue as: An implementation of a bounded queue using an array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.deque","kind":"concept","label":"deque","sources":[{"id":"nist-dads.deque","title":"NIST Dictionary of Algorithms and Data Structures: deque","url":"https://xlinux.nist.gov/dads/HTML/deque.html"}],"status":"reported","summary":"NIST DADS defines deque as: A data structure in which items may be added to or deleted from the head or the tail . Also known as doubly-ended queue.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryheap","kind":"concept","label":"binary heap","sources":[{"id":"nist-dads.binaryheap","title":"NIST Dictionary of Algorithms and Data Structures: binaryheap","url":"https://xlinux.nist.gov/dads/HTML/binaryheap.html"}],"status":"reported","summary":"NIST DADS defines binary heap as: A complete binary tree where every node has a key more extreme (greater or less) than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fibonacciheap","kind":"concept","label":"Fibonacci heap","sources":[{"id":"nist-dads.fibonacciheap","title":"NIST Dictionary of Algorithms and Data Structures: fibonacciHeap","url":"https://xlinux.nist.gov/dads/HTML/fibonacciHeap.html"}],"status":"reported","summary":"NIST DADS defines Fibonacci heap as: A heap made of a forest of trees . The amortized cost of the operations create, insert a value, decrease a value, find minimum, and merge or join ( meld ) two heaps, is a constant Θ(1) . The delete operation takes O(log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binomialheap","kind":"concept","label":"binomial heap","sources":[{"id":"nist-dads.binomialheap","title":"NIST Dictionary of Algorithms and Data Structures: binomialheap","url":"https://xlinux.nist.gov/dads/HTML/binomialheap.html"}],"status":"reported","summary":"NIST DADS defines binomial heap as: A heap made of a forest of binomial trees with the heap property numbered k=0, 1, 2, …, n, each containing either 0 or 2 k nodes . Each tree is formed by linking two of its predecessors, by joining one at the root of the other. The operations of insert a value, decrease a value, delete a value, and merge or join ( meld ) two queues take O(log n) time. The find minimum operation is a constant Θ(1) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.splaytree","kind":"concept","label":"splay tree","sources":[{"id":"nist-dads.splaytree","title":"NIST Dictionary of Algorithms and Data Structures: splaytree","url":"https://xlinux.nist.gov/dads/HTML/splaytree.html"}],"status":"reported","summary":"NIST DADS defines splay tree as: A binary search tree in which operations that access nodes restructure the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.two3tree","kind":"concept","label":"2-3 tree","sources":[{"id":"nist-dads.two3tree","title":"NIST Dictionary of Algorithms and Data Structures: two3tree","url":"https://xlinux.nist.gov/dads/HTML/two3tree.html"}],"status":"reported","summary":"NIST DADS defines 2-3 tree as: A B-tree of order 3, that is, internal nodes have two or three children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixtree","kind":"concept","label":"suffix tree","sources":[{"id":"nist-dads.suffixtree","title":"NIST Dictionary of Algorithms and Data Structures: suffixtree","url":"https://xlinux.nist.gov/dads/HTML/suffixtree.html"}],"status":"reported","summary":"NIST DADS defines suffix tree as: A compact representation of a trie corresponding to the suffixes of a given string where all nodes with one child are merged with their parents .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixarray","kind":"concept","label":"suffix array","sources":[{"id":"nist-dads.suffixarray","title":"NIST Dictionary of Algorithms and Data Structures: suffixarray","url":"https://xlinux.nist.gov/dads/HTML/suffixarray.html"}],"status":"reported","summary":"NIST DADS defines suffix array as: An array of all starting positions of suffixes of a string arranged in lexicographical order . This allows a binary search or fast substring search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hash","kind":"method","label":"hash function","sources":[{"id":"nist-dads.hash","title":"NIST Dictionary of Algorithms and Data Structures: hash","url":"https://xlinux.nist.gov/dads/HTML/hash.html"}],"status":"reported","summary":"NIST DADS defines hash function as: A function that maps keys to integers, usually to get an even distribution on a smaller set of values. Also known as hash.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.perfecthash","kind":"method","label":"perfect hashing","sources":[{"id":"nist-dads.perfecthash","title":"NIST Dictionary of Algorithms and Data Structures: perfecthash","url":"https://xlinux.nist.gov/dads/HTML/perfecthash.html"}],"status":"reported","summary":"NIST DADS defines perfect hashing as: A hash function that maps each different key to a distinct integer. Usually all possible keys must be known beforehand. A hash table that uses a perfect hash has no collisions . Formal Definition: A function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k. Also known as optimal hashing.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.openaddressing","kind":"method","label":"open addressing","sources":[{"id":"nist-dads.openaddressing","title":"NIST Dictionary of Algorithms and Data Structures: openAddressing","url":"https://xlinux.nist.gov/dads/HTML/openAddressing.html"}],"status":"reported","summary":"NIST DADS defines open addressing as: A class of collision resolution schemes in which all items are stored within the hash table . In case of collision , other positions are computed, giving a probe sequence , and checked until an empty position is found. Some ways of computing possible new positions are less efficient because of clustering . Typically items never move once put in place, but in Robin Hood hashing , LCFS hashing , and other techniques, previously placed items may move.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linearprobng","kind":"concept","label":"linear probing","sources":[{"id":"nist-dads.linearprobng","title":"NIST Dictionary of Algorithms and Data Structures: linearprobng","url":"https://xlinux.nist.gov/dads/HTML/linearprobng.html"}],"status":"reported","summary":"NIST DADS defines linear probing as: A hash table in which a collision is resolved by putting the item in the next empty place in the array following the occupied place. Even with a moderate load factor , primary clustering tends to slow retrieval.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doublehashng","kind":"method","label":"double hashing","sources":[{"id":"nist-dads.doublehashng","title":"NIST Dictionary of Algorithms and Data Structures: doublehashng","url":"https://xlinux.nist.gov/dads/HTML/doublehashng.html"}],"status":"reported","summary":"NIST DADS defines double hashing as: A method of open addressing for a hash table in which a collision is resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing clustering . Also known as rehashing.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuckoohashing","kind":"concept","label":"cuckoo hashing","sources":[{"id":"nist-dads.cuckoohashing","title":"NIST Dictionary of Algorithms and Data Structures: cuckooHashing","url":"https://xlinux.nist.gov/dads/HTML/cuckooHashing.html"}],"status":"reported","summary":"NIST DADS defines cuckoo hashing as: A dictionary implemented with two hash tables , T 1 and T 2 , and two different hash functions , h 1 and h 2 . Each key , k, is either in T 1 [h 1 (k)] or T 2 [h 2 (k)]. A new key , k, is stored in T 1 [h 1 (k)]. If that location is already occupied by another key, l, the other key is moved to T 2 [h 2 (l)]. Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed. For tables that are a bit less than half full and with carefully chosen universal hashing functions, performance is good. A key is deleted by removing it from a table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.recursion","kind":"method","label":"recursion","sources":[{"id":"nist-dads.recursion","title":"NIST Dictionary of Algorithms and Data Structures: recursion","url":"https://xlinux.nist.gov/dads/HTML/recursion.html"}],"status":"reported","summary":"NIST DADS defines recursion as: An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.iteration","kind":"method","label":"iteration","sources":[{"id":"nist-dads.iteration","title":"NIST Dictionary of Algorithms and Data Structures: iteration","url":"https://xlinux.nist.gov/dads/HTML/iteration.html"}],"status":"reported","summary":"NIST DADS defines iteration as: Solve a problem by repeatedly working on successive parts of the problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.memoize","kind":"method","label":"memoization","sources":[{"id":"nist-dads.memoize","title":"NIST Dictionary of Algorithms and Data Structures: memoize","url":"https://xlinux.nist.gov/dads/HTML/memoize.html"}],"status":"reported","summary":"NIST DADS defines memoization as: Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.branchnbound","kind":"method","label":"branch and bound","sources":[{"id":"nist-dads.branchnbound","title":"NIST Dictionary of Algorithms and Data Structures: branchNbound","url":"https://xlinux.nist.gov/dads/HTML/branchNbound.html"}],"status":"reported","summary":"NIST DADS defines branch and bound as: An algorithmic technique to find the optimal solution by keeping the best solution found so far. If a partial solution cannot improve on the best, it is abandoned.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.exhaustivesearch","kind":"method","label":"exhaustive search","sources":[{"id":"nist-dads.exhaustivesearch","title":"NIST Dictionary of Algorithms and Data Structures: exhaustiveSearch","url":"https://xlinux.nist.gov/dads/HTML/exhaustiveSearch.html"}],"status":"reported","summary":"NIST DADS defines exhaustive search as: An algorithm that finds a solution by trying every possibility.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.interpolationsearch","kind":"method","label":"interpolation search","sources":[{"id":"nist-dads.interpolationsearch","title":"NIST Dictionary of Algorithms and Data Structures: interpolationSearch","url":"https://xlinux.nist.gov/dads/HTML/interpolationSearch.html"}],"status":"reported","summary":"NIST DADS defines interpolation search as: Search a sorted array by estimating the next position to check based on a linear interpolation of the search key and the values at the ends of the search interval. Also known as extrapolation search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jumpsearch","kind":"method","label":"jump search","sources":[{"id":"nist-dads.jumpsearch","title":"NIST Dictionary of Algorithms and Data Structures: jumpsearch","url":"https://xlinux.nist.gov/dads/HTML/jumpsearch.html"}],"status":"reported","summary":"NIST DADS defines jump search as: Search a sorted array by checking every j th item until the right area is found, then doing a linear search . The optimum for n items is when j=√ n. Also known as block search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fibonacciansearch","kind":"method","label":"Fibonaccian search","sources":[{"id":"nist-dads.fibonacciansearch","title":"NIST Dictionary of Algorithms and Data Structures: fibonaccianSearch","url":"https://xlinux.nist.gov/dads/HTML/fibonaccianSearch.html"}],"status":"reported","summary":"NIST DADS defines Fibonaccian search as: Search a sorted array by narrowing possible locations to progressively smaller intervals. Begin with two Fibonacci numbers , p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array. The first step checks location p. The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.allpairsshortestpath","kind":"concept","label":"all pairs shortest path","sources":[{"id":"nist-dads.allpairsshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: allPairsShortestPath","url":"https://xlinux.nist.gov/dads/HTML/allPairsShortestPath.html"}],"status":"reported","summary":"NIST DADS defines all pairs shortest path as: Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitiveclosure","kind":"concept","label":"transitive closure","sources":[{"id":"nist-dads.transitiveclosure","title":"NIST Dictionary of Algorithms and Data Structures: transitiveClosure","url":"https://xlinux.nist.gov/dads/HTML/transitiveClosure.html"}],"status":"reported","summary":"NIST DADS defines transitive closure as: An extension or superset of a binary relation such that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.euclidalgo","kind":"method","label":"Euclid's algorithm","sources":[{"id":"nist-dads.euclidalgo","title":"NIST Dictionary of Algorithms and Data Structures: euclidalgo","url":"https://xlinux.nist.gov/dads/HTML/euclidalgo.html"}],"status":"reported","summary":"NIST DADS defines Euclid's algorithm as: An algorithm to compute the greatest common divisor of two positive integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);} . The run time complexity is O((log a)(log b)) bit operations. Also known as Euclidean algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fastfouriertransform","kind":"method","label":"fast fourier transform","sources":[{"id":"nist-dads.fastfouriertransform","title":"NIST Dictionary of Algorithms and Data Structures: fastFourierTransform","url":"https://xlinux.nist.gov/dads/HTML/fastFourierTransform.html"}],"status":"reported","summary":"NIST DADS defines fast fourier transform as: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain. Also known as FFT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.huffmancoding","kind":"method","label":"Huffman coding","sources":[{"id":"nist-dads.huffmancoding","title":"NIST Dictionary of Algorithms and Data Structures: huffmanCoding","url":"https://xlinux.nist.gov/dads/HTML/huffmanCoding.html"}],"status":"reported","summary":"NIST DADS defines Huffman coding as: A minimal variable-length character coding based on the frequency of each character. First, each character becomes a one-node binary tree , with the character as the only node . The character's frequency is the tree's frequency. Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree. One code bit represents each level . Thus more frequent characters are near the root and are coded with few bits, and rare characters are far from the root and are coded with many bits. Also known as static Huffman coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.arithmeticcoding","kind":"method","label":"arithmetic coding","sources":[{"id":"nist-dads.arithmeticcoding","title":"NIST Dictionary of Algorithms and Data Structures: arithmeticCoding","url":"https://xlinux.nist.gov/dads/HTML/arithmeticCoding.html"}],"status":"reported","summary":"NIST DADS defines arithmetic coding as: A minimal variable-length message coding based on the frequency of each character. The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lempelzivwelch","kind":"method","label":"Lempel-Ziv-Welch","sources":[{"id":"nist-dads.lempelzivwelch","title":"NIST Dictionary of Algorithms and Data Structures: lempelZivWelch","url":"https://xlinux.nist.gov/dads/HTML/lempelZivWelch.html"}],"status":"reported","summary":"NIST DADS defines Lempel-Ziv-Welch as: A compression algorithm that codes strings of characters with codes of a fixed number of bits. Every new string in the input is added to a table until it is full. The codes of existing strings are output instead of the strings. Also known as LZW compression.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stringmatching","kind":"concept","label":"string matching","sources":[{"id":"nist-dads.stringmatching","title":"NIST Dictionary of Algorithms and Data Structures: stringMatching","url":"https://xlinux.nist.gov/dads/HTML/stringMatching.html"}],"status":"reported","summary":"NIST DADS defines string matching as: The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching. Also known as exact string matching, string searching, text searching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boyermoore","kind":"method","label":"Boyer-Moore","sources":[{"id":"nist-dads.boyermoore","title":"NIST Dictionary of Algorithms and Data Structures: boyermoore","url":"https://xlinux.nist.gov/dads/HTML/boyermoore.html"}],"status":"reported","summary":"NIST DADS defines Boyer-Moore as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the Knuth-Morris-Pratt algorithm and the next matching position in the pattern .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shellsort","kind":"method","label":"Shell sort","sources":[{"id":"nist-dads.shellsort","title":"NIST Dictionary of Algorithms and Data Structures: shellsort","url":"https://xlinux.nist.gov/dads/HTML/shellsort.html"}],"status":"reported","summary":"NIST DADS defines Shell sort as: The first diminishing increment sort . On each pass i sets of n/i items are sorted, typically with insertion sort . On each succeeding pass, i is reduced until it is 1 for the last pass. A good series of i values is important to efficiency.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.combsort","kind":"method","label":"comb sort","sources":[{"id":"nist-dads.combsort","title":"NIST Dictionary of Algorithms and Data Structures: combSort","url":"https://xlinux.nist.gov/dads/HTML/combSort.html"}],"status":"reported","summary":"NIST DADS defines comb sort as: An in-place sort algorithm that repeatedly reorders different pairs of items. On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3). The gap starts at about 3/4 of the number of items. Continue until the gap is 1 and a pass had no swaps.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.gnomesort","kind":"method","label":"gnome sort","sources":[{"id":"nist-dads.gnomesort","title":"NIST Dictionary of Algorithms and Data Structures: gnomeSort","url":"https://xlinux.nist.gov/dads/HTML/gnomeSort.html"}],"status":"reported","summary":"NIST DADS defines gnome sort as: Put items in order by comparing the current item with the previous item. If they are in order, move to the next item (or stop if the end is reached). If they are out of order, swap them and move to the previous item. If there is no previous item, move to the next item.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.inplacesort","kind":"method","label":"in-place sort","sources":[{"id":"nist-dads.inplacesort","title":"NIST Dictionary of Algorithms and Data Structures: inplacesort","url":"https://xlinux.nist.gov/dads/HTML/inplacesort.html"}],"status":"reported","summary":"NIST DADS defines in-place sort as: A sort algorithm in which the sorted items occupy the same storage as the original ones. These algorithms may use o(n) additional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time. Also known as sort in place.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.comparisnsrt","kind":"concept","label":"comparison sort","sources":[{"id":"nist-dads.comparisnsrt","title":"NIST Dictionary of Algorithms and Data Structures: comparisnsrt","url":"https://xlinux.nist.gov/dads/HTML/comparisnsrt.html"}],"status":"reported","summary":"NIST DADS defines comparison sort as: Any sort algorithm using comparisons between keys , and nothing else about the keys, to arrange items in a predetermined order. An alternative is a restricted universe sort such as counting sort or bucket sort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalsort","kind":"concept","label":"external sort","sources":[{"id":"nist-dads.externalsort","title":"NIST Dictionary of Algorithms and Data Structures: externalsort","url":"https://xlinux.nist.gov/dads/HTML/externalsort.html"}],"status":"reported","summary":"NIST DADS defines external sort as: Any sort algorithm that uses external memory, such as tape or disk, during the sort. Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.internalsort","kind":"concept","label":"internal sort","sources":[{"id":"nist-dads.internalsort","title":"NIST Dictionary of Algorithms and Data Structures: internalsort","url":"https://xlinux.nist.gov/dads/HTML/internalsort.html"}],"status":"reported","summary":"NIST DADS defines internal sort as: Any sort algorithm which uses exclusively main memory during the sort. This assumes high-speed random access to all memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bitonicsort","kind":"method","label":"bitonic sort","sources":[{"id":"nist-dads.bitonicsort","title":"NIST Dictionary of Algorithms and Data Structures: bitonicSort","url":"https://xlinux.nist.gov/dads/HTML/bitonicSort.html"}],"status":"reported","summary":"NIST DADS defines bitonic sort as: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitestatetransducer","kind":"concept","label":"finite state transducer","sources":[{"id":"nist-dads.finitestatetransducer","title":"NIST Dictionary of Algorithms and Data Structures: finiteStateTransducer","url":"https://xlinux.nist.gov/dads/HTML/finiteStateTransducer.html"}],"status":"reported","summary":"NIST DADS defines finite state transducer as: A finite state machine specifically with a read-only input and a write-only output. The input and output cannot be reread or changed.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.turingmachine","kind":"concept","label":"Turing machine","sources":[{"id":"nist-dads.turingmachine","title":"NIST Dictionary of Algorithms and Data Structures: turingMachine","url":"https://xlinux.nist.gov/dads/HTML/turingMachine.html"}],"status":"reported","summary":"NIST DADS defines Turing machine as: A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermturingmach","kind":"concept","label":"nondeterministic Turing machine","sources":[{"id":"nist-dads.nondetermturingmach","title":"NIST Dictionary of Algorithms and Data Structures: nondetermTuringMach","url":"https://xlinux.nist.gov/dads/HTML/nondetermTuringMach.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic Turing machine as: A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bigonotation","kind":"concept","label":"big-O notation","sources":[{"id":"nist-dads.bigonotation","title":"NIST Dictionary of Algorithms and Data Structures: bigOnotation","url":"https://xlinux.nist.gov/dads/HTML/bigOnotation.html"}],"status":"reported","summary":"NIST DADS defines big-O notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n). The notation is read, \"f of n is big oh of g of n\". Formal Definition: f(n) = O(g(n)) means there are positive constants c and k, such that 0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n. Also known as O, asymptotic upper bound.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptoticbound","kind":"concept","label":"asymptotic bound","sources":[{"id":"nist-dads.asymptoticbound","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticBound","url":"https://xlinux.nist.gov/dads/HTML/asymptoticBound.html"}],"status":"reported","summary":"NIST DADS defines asymptotic bound as: A curve representing the limit of a function. That is, the distance between a function and the curve tends to zero. The function may or may not intersect the bounding curve.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.npcomplete","kind":"concept","label":"NP-complete","sources":[{"id":"nist-dads.npcomplete","title":"NIST Dictionary of Algorithms and Data Structures: npcomplete","url":"https://xlinux.nist.gov/dads/HTML/npcomplete.html"}],"status":"reported","summary":"NIST DADS defines NP-complete as: The complexity class of decision problems for which answers can be checked for correctness, given a certificate , by an algorithm whose run time is polynomial in the size of the input (that is, it is NP ) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomialtm","kind":"concept","label":"polynomial time","sources":[{"id":"nist-dads.polynomialtm","title":"NIST Dictionary of Algorithms and Data Structures: polynomialtm","url":"https://xlinux.nist.gov/dads/HTML/polynomialtm.html"}],"status":"reported","summary":"NIST DADS defines polynomial time as: When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(n k ) where k is a constant.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geochemistry","kind":"field","label":"Geochemistry","sources":[{"id":"usgs-thesaurus.45717bf85fdd31a41c91","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=437","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=437"}],"status":"reported","summary":"USGS Thesaurus defines Geochemistry as: Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geochronology","kind":"field","label":"Geochronology","sources":[{"id":"usgs-thesaurus.9b9b9c2209b3540da35b","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438"}],"status":"reported","summary":"USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geomorphology","kind":"field","label":"Geomorphology","sources":[{"id":"usgs-thesaurus.ac143557ea12a17d3c6d","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=468","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=468"}],"status":"reported","summary":"USGS Thesaurus defines Geomorphology as: Branch of geology dealing with surface land features and the processes that create and change them.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.glaciology","kind":"field","label":"Glaciology","sources":[{"id":"usgs-thesaurus.72927539f9b5c6155294","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=484","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=484"}],"status":"reported","summary":"USGS Thesaurus defines Glaciology as: Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.hydrogeology","kind":"field","label":"Hydrogeology","sources":[{"id":"usgs-thesaurus.ce8e9bd3a3dd978ad873","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=554","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=554"}],"status":"reported","summary":"USGS Thesaurus defines Hydrogeology as: Study of subsurface waters and geologic aspects of surface waters.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.hydrology","kind":"field","label":"Hydrology","sources":[{"id":"usgs-thesaurus.7691e5829ecd899aeb75","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560"}],"status":"reported","summary":"USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.limnology","kind":"field","label":"Limnology","sources":[{"id":"usgs-thesaurus.2e19bcc18d8f8bb2cd4f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=657","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=657"}],"status":"reported","summary":"USGS Thesaurus defines Limnology as: Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.meteorology","kind":"field","label":"Meteorology","sources":[{"id":"usgs-thesaurus.4c9d6896b889ce2b2e86","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731"}],"status":"reported","summary":"USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.mineralogy","kind":"field","label":"Mineralogy","sources":[{"id":"usgs-thesaurus.a5b24d28b9768fcf1686","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747"}],"status":"reported","summary":"USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.paleontology","kind":"field","label":"Paleontology","sources":[{"id":"usgs-thesaurus.2dcbaf2d1a595f7517e5","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=861","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=861"}],"status":"reported","summary":"USGS Thesaurus defines Paleontology as: Study of life in past geologic time based on fossil plants and animals.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.petrology","kind":"field","label":"Petrology","sources":[{"id":"usgs-thesaurus.c8966d506e18150be2fe","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=883","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=883"}],"status":"reported","summary":"USGS Thesaurus defines Petrology as: Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.sedimentology","kind":"field","label":"Sedimentology","sources":[{"id":"usgs-thesaurus.fd7a87508131b4ecaf86","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037"}],"status":"reported","summary":"USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.seismology","kind":"field","label":"Seismology","sources":[{"id":"usgs-thesaurus.762a1e9db52aec2a89a0","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050"}],"status":"reported","summary":"USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.stratigraphy","kind":"field","label":"Stratigraphy","sources":[{"id":"usgs-thesaurus.d2e306d9307aced4b202","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104"}],"status":"reported","summary":"USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.tectonophysics","kind":"field","label":"Tectonophysics","sources":[{"id":"usgs-thesaurus.969a1d445933c65b567f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1147","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1147"}],"status":"reported","summary":"USGS Thesaurus defines Tectonophysics as: Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.volcanology","kind":"field","label":"Volcanology","sources":[{"id":"usgs-thesaurus.cfccf058f7b98949dc69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1289","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1289"}],"status":"reported","summary":"USGS Thesaurus defines Volcanology as: The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.endocrinology","kind":"field","label":"Endocrinology","sources":[{"id":"usgs-thesaurus.7fecd1d9d681f5519ebb","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=334","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=334"},{"id":"completion-source.e90badae02d39b991a93","title":"NLM MeSH: Endocrinology","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004704"}],"status":"reported","summary":"USGS Thesaurus defines Endocrinology as: Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.pathology","kind":"field","label":"Pathology","sources":[{"id":"usgs-thesaurus.e4b94d24f020cbbbfc43","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=876","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=876"}],"status":"reported","summary":"USGS Thesaurus defines Pathology as: Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.bacteriology","kind":"field","label":"Bacteriology","sources":[{"id":"usgs-thesaurus.2638b993d82a3ee7dc55","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=77","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=77"}],"status":"reported","summary":"USGS Thesaurus defines Bacteriology as: Study of the single celled microorganisms known as bacteria.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cell-biology","kind":"field","label":"Cell biology","sources":[{"id":"usgs-thesaurus.54dbaf6b936415d8d2d7","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=151","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=151"}],"status":"reported","summary":"USGS Thesaurus defines Cell biology as: Branch of biology that deals with the study of the formation, structure, and physiology of cells.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.developmental-biology","kind":"field","label":"Developmental biology","sources":[{"id":"usgs-thesaurus.43c406756994e4d6a610","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=247","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=247"}],"status":"reported","summary":"USGS Thesaurus defines Developmental biology as: Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.entomology","kind":"field","label":"Entomology","sources":[{"id":"usgs-thesaurus.26d0f4a60626d67a41cf","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=341","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=341"}],"status":"reported","summary":"USGS Thesaurus defines Entomology as: Branch of zoology involved in studying insects.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ethology","kind":"field","label":"Ethology","sources":[{"id":"usgs-thesaurus.9375aebb8cb97e02bd6f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2040","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2040"}],"status":"reported","summary":"USGS Thesaurus defines Ethology as: Study of animal behavior under natural conditions","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.herpetology","kind":"field","label":"Herpetology","sources":[{"id":"usgs-thesaurus.7a6a2965ad207743d814","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=539","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=539"}],"status":"reported","summary":"USGS Thesaurus defines Herpetology as: Branch of zoology concerned with the study of reptiles and amphibians.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.histology","kind":"field","label":"Histology","sources":[{"id":"usgs-thesaurus.6b30b2d3f6402ab23f69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=540","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=540"}],"status":"reported","summary":"USGS Thesaurus defines Histology as: Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ichthyology","kind":"field","label":"Ichthyology","sources":[{"id":"usgs-thesaurus.fc3a1187d897acbd35b3","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=570","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=570"}],"status":"reported","summary":"USGS Thesaurus defines Ichthyology as: Branch of zoology concerned with the study of fish.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.immunology","kind":"field","label":"Immunology","sources":[{"id":"usgs-thesaurus.1e207764c4dcaddcfa3f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=576","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=576"}],"status":"reported","summary":"USGS Thesaurus defines Immunology as: Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.mammalogy","kind":"field","label":"Mammalogy","sources":[{"id":"usgs-thesaurus.371c76fcaf528fc15e5e","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=685","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=685"}],"status":"reported","summary":"USGS Thesaurus defines Mammalogy as: Branch of zoology concerned with the study of mammals.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.marine-biology","kind":"field","label":"Marine biology","sources":[{"id":"usgs-thesaurus.c06c39ee767c6bf57f75","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=702","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=702"}],"status":"reported","summary":"USGS Thesaurus defines Marine biology as: Branch of biology concerned with the organisms and habitats of the seas and oceans.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.mycology","kind":"field","label":"Mycology","sources":[{"id":"usgs-thesaurus.4cae14b1bd2e1d062020","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=767","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=767"}],"status":"reported","summary":"USGS Thesaurus defines Mycology as: Branch of biology concerned with the study of fungi.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ornithology","kind":"field","label":"Ornithology","sources":[{"id":"usgs-thesaurus.45d1b09cab533d0d8add","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=845","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=845"}],"status":"reported","summary":"USGS Thesaurus defines Ornithology as: Branch of biology concerned with the study of birds.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.parasitology","kind":"field","label":"Parasitology","sources":[{"id":"usgs-thesaurus.50ce134a036f2d19ef0a","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=871","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=871"}],"status":"reported","summary":"USGS Thesaurus defines Parasitology as: Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.phycology","kind":"field","label":"Phycology","sources":[{"id":"usgs-thesaurus.9a880c55f1553c1253d9","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=890","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=890"}],"status":"reported","summary":"USGS Thesaurus defines Phycology as: Branch of biology concerned with the study of algae.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.virology","kind":"field","label":"Virology","sources":[{"id":"usgs-thesaurus.bf9e37c0e60da0feaec7","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1279","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1279"}],"status":"reported","summary":"USGS Thesaurus defines Virology as: Branch of biology dealing with viruses and viral diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.zoology","kind":"field","label":"Zoology","sources":[{"id":"usgs-thesaurus.2e13d5f63b99994c4e0c","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1339","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1339"}],"status":"reported","summary":"USGS Thesaurus defines Zoology as: Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bondseqsearch","kind":"method","label":"Bond Sequential Search","sources":[{"id":"nist-dads.bondseqsearch","title":"NIST Dictionary of Algorithms and Data Structures: BondSeqSearch","url":"https://xlinux.nist.gov/dads/HTML/BondSeqSearch.html"}],"status":"reported","summary":"NIST DADS defines Bond Sequential Search as: Search an array or list for two keys at once by using the bitwise or of the keys as the search key. When a possible match is found, compare each key against the item.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.collatzproblem","kind":"concept","label":"Collatz problem","sources":[{"id":"nist-dads.collatzproblem","title":"NIST Dictionary of Algorithms and Data Structures: CollatzProblem","url":"https://xlinux.nist.gov/dads/HTML/CollatzProblem.html"}],"status":"reported","summary":"NIST DADS defines Collatz problem as: Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.commentzwalter","kind":"method","label":"Commentz-Walter","sources":[{"id":"nist-dads.commentzwalter","title":"NIST Dictionary of Algorithms and Data Structures: CommentzWalter","url":"https://xlinux.nist.gov/dads/HTML/CommentzWalter.html"}],"status":"reported","summary":"NIST DADS defines Commentz-Walter as: A multiple string matching algorithm that compares from the end of the pattern , like Boyer-Moore , using a finite state machine , like Aho-Corasick .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dfsforest","kind":"concept","label":"DFS forest","sources":[{"id":"nist-dads.dfsforest","title":"NIST Dictionary of Algorithms and Data Structures: DFSforest","url":"https://xlinux.nist.gov/dads/HTML/DFSforest.html"}],"status":"reported","summary":"NIST DADS defines DFS forest as: A rooted forest formed by depth-first search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dtree","kind":"concept","label":"D-tree","sources":[{"id":"nist-dads.dtree","title":"NIST Dictionary of Algorithms and Data Structures: DTree","url":"https://xlinux.nist.gov/dads/HTML/DTree.html"}],"status":"reported","summary":"NIST DADS defines D-tree as: (1) A BB(α) tree where the weights are the number of searches down that path. (2) A height-balanced binary tree that divides regions along their boundaries to serve as a spatial access method .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dutchnationalflag","kind":"concept","label":"Dutch national flag","sources":[{"id":"nist-dads.dutchnationalflag","title":"NIST Dictionary of Algorithms and Data Structures: DutchNationalFlag","url":"https://xlinux.nist.gov/dads/HTML/DutchNationalFlag.html"}],"status":"reported","summary":"NIST DADS defines Dutch national flag as: Rearrange elements in an array into three groups: bottom, middle, and top. One algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom. The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes. At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top. If it belongs in the bottom, swap it with the element just above the bottom. If it is in the middle, leave it. Update the appropriate index. Complexity is Θ(n) moves and examinations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eulersformula","kind":"concept","label":"Euler's formula","sources":[{"id":"nist-dads.eulersformula","title":"NIST Dictionary of Algorithms and Data Structures: EulersFormula","url":"https://xlinux.nist.gov/dads/HTML/EulersFormula.html"}],"status":"reported","summary":"NIST DADS defines Euler's formula as: For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jsort","kind":"method","label":"JSort","sources":[{"id":"nist-dads.jsort","title":"NIST Dictionary of Algorithms and Data Structures: JSort","url":"https://xlinux.nist.gov/dads/HTML/JSort.html"}],"status":"reported","summary":"NIST DADS defines JSort as: An in-place sort that partially orders the array twice with build-heap , once moving lesser items earlier and once in reverse moving greater items later, then uses insertion sort on the nearly-ordered array.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lcs","kind":"concept","label":"LCS","sources":[{"id":"nist-dads.lcs","title":"NIST Dictionary of Algorithms and Data Structures: LCS","url":"https://xlinux.nist.gov/dads/HTML/LCS.html"}],"status":"reported","summary":"NIST DADS defines LCS as: Either longest common subsequence or longest common substring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.levenshtein","kind":"concept","label":"Levenshtein distance","sources":[{"id":"nist-dads.levenshtein","title":"NIST Dictionary of Algorithms and Data Structures: Levenshtein","url":"https://xlinux.nist.gov/dads/HTML/Levenshtein.html"}],"status":"reported","summary":"NIST DADS defines Levenshtein distance as: (1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n are the lengths of the strings. Also known as edit distance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.merkletree","kind":"concept","label":"Merkle tree","sources":[{"id":"nist-dads.merkletree","title":"NIST Dictionary of Algorithms and Data Structures: MerkleTree","url":"https://xlinux.nist.gov/dads/HTML/MerkleTree.html"}],"status":"reported","summary":"NIST DADS defines Merkle tree as: A tree (usually a binary tree ) in which each internal node has a hash of all the information in the leaf nodes under it. Specifically, each internal node has a hash of the information in its children . Each leaf has a hash of the block of information it represents. All leaf nodes are at the same depth . All nodes are as far left as possible. To add a block (leaf) to a full tree, a new root is created with the old root as its left child. Its right child is a degenerate tree (only left subtrees) all the way to the leaf level. Also known as hash tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sstable","kind":"concept","label":"SSTable","sources":[{"id":"nist-dads.sstable","title":"NIST Dictionary of Algorithms and Data Structures: SSTable","url":"https://xlinux.nist.gov/dads/HTML/SSTable.html"}],"status":"reported","summary":"NIST DADS defines SSTable as: An immutable dictionary stored on disk. Values are far larger than keys. Keys and values are in key-order in a \"data block\". Ordered keys are in an \"index block\", where each key has an offset into its location in the data block. Also known as sorted-string table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.absolute","kind":"concept","label":"absolute performance guarantee","sources":[{"id":"nist-dads.absolute","title":"NIST Dictionary of Algorithms and Data Structures: absolute","url":"https://xlinux.nist.gov/dads/HTML/absolute.html"}],"status":"reported","summary":"NIST DADS defines absolute performance guarantee as: An approximation algorithm will return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.abtree","kind":"concept","label":"(a,b)-tree","sources":[{"id":"nist-dads.abtree","title":"NIST Dictionary of Algorithms and Data Structures: abtree","url":"https://xlinux.nist.gov/dads/HTML/abtree.html"}],"status":"reported","summary":"NIST DADS defines (a,b)-tree as: A search tree with the restrictions that all leaves are at the same depth and all internal nodes have between a and b children , where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root may have as few as 2 children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.acceptingstt","kind":"concept","label":"accepting state","sources":[{"id":"nist-dads.acceptingstt","title":"NIST Dictionary of Algorithms and Data Structures: acceptingstt","url":"https://xlinux.nist.gov/dads/HTML/acceptingstt.html"}],"status":"reported","summary":"NIST DADS defines accepting state as: If a finite state machine finishes an input string and is in an accepting state , the string is accepted or considered to be valid.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ackermann","kind":"method","label":"Ackermann's function","sources":[{"id":"nist-dads.ackermann","title":"NIST Dictionary of Algorithms and Data Structures: ackermann","url":"https://xlinux.nist.gov/dads/HTML/ackermann.html"}],"status":"reported","summary":"NIST DADS defines Ackermann's function as: A function of two parameters whose value grows very fast. Formal Definition: A(0, j)=j+1 for j ≥ 0 A(i, 0)=A(i-1, 1) for i > 0 A(i, j)=A(i-1, A(i, j-1)) for i, j > 0","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.activedatastruc","kind":"concept","label":"active data structure","sources":[{"id":"nist-dads.activedatastruc","title":"NIST Dictionary of Algorithms and Data Structures: activeDataStruc","url":"https://xlinux.nist.gov/dads/HTML/activeDataStruc.html"}],"status":"reported","summary":"NIST DADS defines active data structure as: A data structure with an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure. Also known as functional data structure.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.acyclicgraph","kind":"concept","label":"acyclic graph","sources":[{"id":"nist-dads.acyclicgraph","title":"NIST Dictionary of Algorithms and Data Structures: acyclicgraph","url":"https://xlinux.nist.gov/dads/HTML/acyclicgraph.html"}],"status":"reported","summary":"NIST DADS defines acyclic graph as: A graph with no path that starts and ends at the same vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.adaptiveheapsort","kind":"method","label":"adaptive heap sort","sources":[{"id":"nist-dads.adaptiveheapsort","title":"NIST Dictionary of Algorithms and Data Structures: adaptiveHeapSort","url":"https://xlinux.nist.gov/dads/HTML/adaptiveHeapSort.html"}],"status":"reported","summary":"NIST DADS defines adaptive heap sort as: A variant of heapsort that uses a randomized binary search tree (RBST) to structure the input according to any preexisting order. The RBST is used to select candidates that are put into the heap so the heap doesn't need to keep track of all elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.adaptivehuffman","kind":"method","label":"adaptive Huffman coding","sources":[{"id":"nist-dads.adaptivehuffman","title":"NIST Dictionary of Algorithms and Data Structures: adaptiveHuffman","url":"https://xlinux.nist.gov/dads/HTML/adaptiveHuffman.html"}],"status":"reported","summary":"NIST DADS defines adaptive Huffman coding as: A near-minimal variable-length character coding that changes based on the frequency of characters processed. As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified). Also known as dynamic Huffman coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adaptivesort","kind":"concept","label":"adaptive sort","sources":[{"id":"nist-dads.adaptivesort","title":"NIST Dictionary of Algorithms and Data Structures: adaptivesort","url":"https://xlinux.nist.gov/dads/HTML/adaptivesort.html"}],"status":"reported","summary":"NIST DADS defines adaptive sort as: A sorting algorithm that can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adaptkdtree","kind":"concept","label":"adaptive k-d tree","sources":[{"id":"nist-dads.adaptkdtree","title":"NIST Dictionary of Algorithms and Data Structures: adaptkdtree","url":"https://xlinux.nist.gov/dads/HTML/adaptkdtree.html"}],"status":"reported","summary":"NIST DADS defines adaptive k-d tree as: A tree for multidimensional points where successive levels may be split along different dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.addresscalc","kind":"method","label":"address-calculation sort","sources":[{"id":"nist-dads.addresscalc","title":"NIST Dictionary of Algorithms and Data Structures: addresscalc","url":"https://xlinux.nist.gov/dads/HTML/addresscalc.html"}],"status":"reported","summary":"NIST DADS defines address-calculation sort as: A sort algorithm which uses knowledge of the domain of the items to calculate the position of each item in the sorted array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adjacencylistrep","kind":"concept","label":"adjacency-list representation","sources":[{"id":"nist-dads.adjacencylistrep","title":"NIST Dictionary of Algorithms and Data Structures: adjacencyListRep","url":"https://xlinux.nist.gov/dads/HTML/adjacencyListRep.html"}],"status":"reported","summary":"NIST DADS defines adjacency-list representation as: A representation of a directed graph with n vertices using an array of n lists of vertices. List i contains vertex j if there is an edge from vertex i to vertex j. A weighted graph may be represented with a list of vertex/weight pairs. An undirected graph may be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adjacent","kind":"concept","label":"adjacent","sources":[{"id":"nist-dads.adjacent","title":"NIST Dictionary of Algorithms and Data Structures: adjacent","url":"https://xlinux.nist.gov/dads/HTML/adjacent.html"}],"status":"reported","summary":"NIST DADS defines adjacent as: Two vertices of a graph are adjacent if there is an edge between them. Two edges of a graph are adjacent if they connect the same vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adversary","kind":"concept","label":"adversary","sources":[{"id":"nist-dads.adversary","title":"NIST Dictionary of Algorithms and Data Structures: adversary","url":"https://xlinux.nist.gov/dads/HTML/adversary.html"}],"status":"reported","summary":"NIST DADS defines adversary as: A theoretical agent that uses information about the past moves of an on-line algorithm to choose inputs that force the worst-case cost of the algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ahocorasick","kind":"method","label":"Aho-Corasick","sources":[{"id":"nist-dads.ahocorasick","title":"NIST Dictionary of Algorithms and Data Structures: ahoCorasick","url":"https://xlinux.nist.gov/dads/HTML/ahoCorasick.html"}],"status":"reported","summary":"NIST DADS defines Aho-Corasick as: A multiple string matching algorithm that constructs a finite state machine from a pattern (list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.algorithmfgk","kind":"method","label":"algorithm FGK","sources":[{"id":"nist-dads.algorithmfgk","title":"NIST Dictionary of Algorithms and Data Structures: algorithmFGK","url":"https://xlinux.nist.gov/dads/HTML/algorithmFGK.html"}],"status":"reported","summary":"NIST DADS defines algorithm FGK as: An adaptive Huffman coding scheme. Coding is never much worse than twice optimal .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.allsimplepaths","kind":"concept","label":"all simple paths","sources":[{"id":"nist-dads.allsimplepaths","title":"NIST Dictionary of Algorithms and Data Structures: allSimplePaths","url":"https://xlinux.nist.gov/dads/HTML/allSimplePaths.html"}],"status":"reported","summary":"NIST DADS defines all simple paths as: Find all simple paths from a starting vertex ( source ) to a destination vertex ( sink ) in a directed graph . In an undirected graph , find all simple paths between two vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alphabet","kind":"concept","label":"alphabet","sources":[{"id":"nist-dads.alphabet","title":"NIST Dictionary of Algorithms and Data Structures: alphabet","url":"https://xlinux.nist.gov/dads/HTML/alphabet.html"}],"status":"reported","summary":"NIST DADS defines alphabet as: The set of all possible symbols in an application. For instance, input characters used by a finite state machine , letters making up strings in a language , or symbols in a pattern element . In some cases, an alphabet may be infinite.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alternation","kind":"concept","label":"alternation","sources":[{"id":"nist-dads.alternation","title":"NIST Dictionary of Algorithms and Data Structures: alternation","url":"https://xlinux.nist.gov/dads/HTML/alternation.html"}],"status":"reported","summary":"NIST DADS defines alternation as: A model of computation proposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR. The definition of accepting computation is adjusted accordingly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alternatngtr","kind":"concept","label":"alternating Turing machine","sources":[{"id":"nist-dads.alternatngtr","title":"NIST Dictionary of Algorithms and Data Structures: alternatngTr","url":"https://xlinux.nist.gov/dads/HTML/alternatngTr.html"}],"status":"reported","summary":"NIST DADS defines alternating Turing machine as: A nondeterministic Turing machine having universal states , from which the machine accepts only if all possible moves out of that state lead to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alterntngpth","kind":"concept","label":"alternating path","sources":[{"id":"nist-dads.alterntngpth","title":"NIST Dictionary of Algorithms and Data Structures: alterntngpth","url":"https://xlinux.nist.gov/dads/HTML/alterntngpth.html"}],"status":"reported","summary":"NIST DADS defines alternating path as: A path with alternating free and matched edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.americanflagsort","kind":"method","label":"American flag sort","sources":[{"id":"nist-dads.americanflagsort","title":"NIST Dictionary of Algorithms and Data Structures: americanFlagSort","url":"https://xlinux.nist.gov/dads/HTML/americanFlagSort.html"}],"status":"reported","summary":"NIST DADS defines American flag sort as: An efficient, in-place variant of radix sort that distributes items into hundreds of buckets . The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array. The last step cyclically permutes items to their proper bucket. Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the Dutch national flag problem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as quicksort for large sets of strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.amortizdcost","kind":"concept","label":"amortized cost","sources":[{"id":"nist-dads.amortizdcost","title":"NIST Dictionary of Algorithms and Data Structures: amortizdcost","url":"https://xlinux.nist.gov/dads/HTML/amortizdcost.html"}],"status":"reported","summary":"NIST DADS defines amortized cost as: The theoretical speed of a given set of operations. It is O(f(n)) when the execution time of the worst case of all sequences of n operations never exceeds O(n*f(n)).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ancestor","kind":"concept","label":"ancestor","sources":[{"id":"nist-dads.ancestor","title":"NIST Dictionary of Algorithms and Data Structures: ancestor","url":"https://xlinux.nist.gov/dads/HTML/ancestor.html"}],"status":"reported","summary":"NIST DADS defines ancestor as: A parent of a node in a tree , the parent of the parent, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.and","kind":"concept","label":"and","sources":[{"id":"nist-dads.and","title":"NIST Dictionary of Algorithms and Data Structures: and","url":"https://xlinux.nist.gov/dads/HTML/and.html"}],"status":"reported","summary":"NIST DADS defines and as: Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ansi","kind":"concept","label":"ANSI","sources":[{"id":"nist-dads.ansi","title":"NIST Dictionary of Algorithms and Data Structures: ansi","url":"https://xlinux.nist.gov/dads/HTML/ansi.html"}],"status":"reported","summary":"NIST DADS defines ANSI as: American National Standards Institute.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.antichain","kind":"concept","label":"antichain","sources":[{"id":"nist-dads.antichain","title":"NIST Dictionary of Algorithms and Data Structures: antichain","url":"https://xlinux.nist.gov/dads/HTML/antichain.html"}],"status":"reported","summary":"NIST DADS defines antichain as: A subset of mutually incomparable elements in a poset .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.antisymmetric","kind":"concept","label":"antisymmetric","sources":[{"id":"nist-dads.antisymmetric","title":"NIST Dictionary of Algorithms and Data Structures: antisymmetric","url":"https://xlinux.nist.gov/dads/HTML/antisymmetric.html"}],"status":"reported","summary":"NIST DADS defines antisymmetric as: A binary relation R for which a R b and b R a implies a = b.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.approximatin","kind":"method","label":"approximation algorithm","sources":[{"id":"nist-dads.approximatin","title":"NIST Dictionary of Algorithms and Data Structures: approximatin","url":"https://xlinux.nist.gov/dads/HTML/approximatin.html"}],"status":"reported","summary":"NIST DADS defines approximation algorithm as: An algorithm to solve an optimization problem that runs in polynomial time in the length of the input and outputs a solution that is guaranteed to be close to the optimal solution . \"Close\" has some well-defined sense called the performance guarantee .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arborescence","kind":"concept","label":"arborescence","sources":[{"id":"nist-dads.arborescence","title":"NIST Dictionary of Algorithms and Data Structures: arborescence","url":"https://xlinux.nist.gov/dads/HTML/arborescence.html"}],"status":"reported","summary":"NIST DADS defines arborescence as: Informally, a directed tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arrayindex","kind":"concept","label":"array index","sources":[{"id":"nist-dads.arrayindex","title":"NIST Dictionary of Algorithms and Data Structures: arrayindex","url":"https://xlinux.nist.gov/dads/HTML/arrayindex.html"}],"status":"reported","summary":"NIST DADS defines array index as: The location of an item in an array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.arraymerg","kind":"method","label":"array merging","sources":[{"id":"nist-dads.arraymerg","title":"NIST Dictionary of Algorithms and Data Structures: arraymerg","url":"https://xlinux.nist.gov/dads/HTML/arraymerg.html"}],"status":"reported","summary":"NIST DADS defines array merging as: Joining two arrays into one.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arraysearch","kind":"concept","label":"array search","sources":[{"id":"nist-dads.arraysearch","title":"NIST Dictionary of Algorithms and Data Structures: arraysearch","url":"https://xlinux.nist.gov/dads/HTML/arraysearch.html"}],"status":"reported","summary":"NIST DADS defines array search as: Find an element in an array . Various algorithms exist which require more or less structure in the array elements or implementation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.assignment","kind":"concept","label":"assignment problem","sources":[{"id":"nist-dads.assignment","title":"NIST Dictionary of Algorithms and Data Structures: assignment","url":"https://xlinux.nist.gov/dads/HTML/assignment.html"}],"status":"reported","summary":"NIST DADS defines assignment problem as: The problem of finding a maximum (or minimum) weight matching in a weighted , bipartite graph . Also known as marriage problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.assocarray","kind":"concept","label":"associative array","sources":[{"id":"nist-dads.assocarray","title":"NIST Dictionary of Algorithms and Data Structures: assocarray","url":"https://xlinux.nist.gov/dads/HTML/assocarray.html"}],"status":"reported","summary":"NIST DADS defines associative array as: A collection of items that are randomly accessible by a key , often a string .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.associative","kind":"concept","label":"associative","sources":[{"id":"nist-dads.associative","title":"NIST Dictionary of Algorithms and Data Structures: associative","url":"https://xlinux.nist.gov/dads/HTML/associative.html"}],"status":"reported","summary":"NIST DADS defines associative as: A function where f(A, f(B, C)) = f(f(A, B), C).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptoticspacecomplexity","kind":"concept","label":"asymptotic space complexity","sources":[{"id":"nist-dads.asymptoticspacecomplexity","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticSpaceComplexity","url":"https://xlinux.nist.gov/dads/HTML/asymptoticSpaceComplexity.html"}],"status":"reported","summary":"NIST DADS defines asymptotic space complexity as: The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptotictimecomplexity","kind":"concept","label":"asymptotic time complexity","sources":[{"id":"nist-dads.asymptotictimecomplexity","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticTimeComplexity","url":"https://xlinux.nist.gov/dads/HTML/asymptoticTimeComplexity.html"}],"status":"reported","summary":"NIST DADS defines asymptotic time complexity as: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.augmentngpth","kind":"concept","label":"augmenting path","sources":[{"id":"nist-dads.augmentngpth","title":"NIST Dictionary of Algorithms and Data Structures: augmentngpth","url":"https://xlinux.nist.gov/dads/HTML/augmentngpth.html"}],"status":"reported","summary":"NIST DADS defines augmenting path as: A path with alternating free and matched edges that begins and ends with free vertices . Used to augment (improve or increase) a matching or flow .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.averagecasecost","kind":"concept","label":"average-case cost","sources":[{"id":"nist-dads.averagecasecost","title":"NIST Dictionary of Algorithms and Data Structures: averageCaseCost","url":"https://xlinux.nist.gov/dads/HTML/averageCaseCost.html"}],"status":"reported","summary":"NIST DADS defines average-case cost as: The sum of costs of an algorithm over all possible inputs divided by the number of possible inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.averagecase","kind":"concept","label":"average case","sources":[{"id":"nist-dads.averagecase","title":"NIST Dictionary of Algorithms and Data Structures: averagecase","url":"https://xlinux.nist.gov/dads/HTML/averagecase.html"}],"status":"reported","summary":"NIST DADS defines average case as: Having to do with the mathematical average of all cases.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.axiomaticsemantics","kind":"concept","label":"axiomatic semantics","sources":[{"id":"nist-dads.axiomaticsemantics","title":"NIST Dictionary of Algorithms and Data Structures: axiomaticSemantics","url":"https://xlinux.nist.gov/dads/HTML/axiomaticSemantics.html"}],"status":"reported","summary":"NIST DADS defines axiomatic semantics as: Defining the behavior of an abstract data type with axioms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bag","kind":"concept","label":"bag","sources":[{"id":"nist-dads.bag","title":"NIST Dictionary of Algorithms and Data Structures: bag","url":"https://xlinux.nist.gov/dads/HTML/bag.html"}],"status":"reported","summary":"NIST DADS defines bag as: An unordered collection of values that may have duplicates. Formal Definition: A bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with axiomatic semantics as follows. new() returns a bag numberIn(v, new()) = 0 numberIn(v, add(v, B)) = 1 + numberIn(v, B) numberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u remove(v, new()) = new() remove(v, add(v, B)) = B remove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u where B is a bag and u and v are elements. The predicate isEmpty(B) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, B)) = false Also known as multi-set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balanc2wayms","kind":"method","label":"balanced two-way merge sort","sources":[{"id":"nist-dads.balanc2wayms","title":"NIST Dictionary of Algorithms and Data Structures: balanc2wayms","url":"https://xlinux.nist.gov/dads/HTML/balanc2wayms.html"}],"status":"reported","summary":"NIST DADS defines balanced two-way merge sort as: A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balance","kind":"concept","label":"balance","sources":[{"id":"nist-dads.balance","title":"NIST Dictionary of Algorithms and Data Structures: balance","url":"https://xlinux.nist.gov/dads/HTML/balance.html"}],"status":"reported","summary":"NIST DADS defines balance as: The (weight) balance of a tree is the number of leaves of the left subtree of a tree, denoted |T l |, divided by the total number of leaves of the tree. Formally, ρ(T) = |T l |/|T|. Also known as root balance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedbist","kind":"concept","label":"balanced binary search tree","sources":[{"id":"nist-dads.balancedbist","title":"NIST Dictionary of Algorithms and Data Structures: balancedbist","url":"https://xlinux.nist.gov/dads/HTML/balancedbist.html"}],"status":"reported","summary":"NIST DADS defines balanced binary search tree as: A binary search tree that is balanced .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balancedqsrt","kind":"method","label":"balanced quicksort","sources":[{"id":"nist-dads.balancedqsrt","title":"NIST Dictionary of Algorithms and Data Structures: balancedqsrt","url":"https://xlinux.nist.gov/dads/HTML/balancedqsrt.html"}],"status":"reported","summary":"NIST DADS defines balanced quicksort as: A variant of quicksort which attempts to choose a pivot likely to represent the middle of the values to be sorted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedtree","kind":"concept","label":"balanced tree","sources":[{"id":"nist-dads.balancedtree","title":"NIST Dictionary of Algorithms and Data Structures: balancedtree","url":"https://xlinux.nist.gov/dads/HTML/balancedtree.html"}],"status":"reported","summary":"NIST DADS defines balanced tree as: A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balanckwayms","kind":"method","label":"balanced k-way merge sort","sources":[{"id":"nist-dads.balanckwayms","title":"NIST Dictionary of Algorithms and Data Structures: balanckwayms","url":"https://xlinux.nist.gov/dads/HTML/balanckwayms.html"}],"status":"reported","summary":"NIST DADS defines balanced k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balancmrgsrt","kind":"method","label":"balanced merge sort","sources":[{"id":"nist-dads.balancmrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: balancmrgsrt","url":"https://xlinux.nist.gov/dads/HTML/balancmrgsrt.html"}],"status":"reported","summary":"NIST DADS defines balanced merge sort as: A k-way merge sort in which the number of input and output data streams is the same. See balanced k-way merge sort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bangfile","kind":"concept","label":"BANG file","sources":[{"id":"nist-dads.bangfile","title":"NIST Dictionary of Algorithms and Data Structures: bangfile","url":"https://xlinux.nist.gov/dads/HTML/bangfile.html"}],"status":"reported","summary":"NIST DADS defines BANG file as: A balanced and nested grid (BANG) file is a point access method that divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Cells may intersect, and points may be distributed between them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.baumwelch","kind":"method","label":"Baum Welch algorithm","sources":[{"id":"nist-dads.baumwelch","title":"NIST Dictionary of Algorithms and Data Structures: baumWelch","url":"https://xlinux.nist.gov/dads/HTML/baumWelch.html"}],"status":"reported","summary":"NIST DADS defines Baum Welch algorithm as: An algorithm to find hidden Markov model parameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bbalphatree","kind":"concept","label":"BB(α) tree","sources":[{"id":"nist-dads.bbalphatree","title":"NIST Dictionary of Algorithms and Data Structures: bbalphatree","url":"https://xlinux.nist.gov/dads/HTML/bbalphatree.html"}],"status":"reported","summary":"NIST DADS defines BB(α) tree as: A binary tree where the balance of every subtree, ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α. Also known as weight-balanced tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bbp","kind":"method","label":"BBP algorithm","sources":[{"id":"nist-dads.bbp","title":"NIST Dictionary of Algorithms and Data Structures: bbp","url":"https://xlinux.nist.gov/dads/HTML/bbp.html"}],"status":"reported","summary":"NIST DADS defines BBP algorithm as: Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bdd","kind":"concept","label":"BDD","sources":[{"id":"nist-dads.bdd","title":"NIST Dictionary of Algorithms and Data Structures: bdd","url":"https://xlinux.nist.gov/dads/HTML/bdd.html"}],"status":"reported","summary":"NIST DADS defines BDD as: A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bdtree","kind":"concept","label":"BD-tree","sources":[{"id":"nist-dads.bdtree","title":"NIST Dictionary of Algorithms and Data Structures: bdtree","url":"https://xlinux.nist.gov/dads/HTML/bdtree.html"}],"status":"reported","summary":"NIST DADS defines BD-tree as: A binary tree that organizes multidimensional points by splitting off regular subintervals.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bestcase","kind":"concept","label":"best case","sources":[{"id":"nist-dads.bestcase","title":"NIST Dictionary of Algorithms and Data Structures: bestcase","url":"https://xlinux.nist.gov/dads/HTML/bestcase.html"}],"status":"reported","summary":"NIST DADS defines best case as: (1) The situation or input for which an algorithm or data structure takes the least time or resources. (2) Having to do with this situation or input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bestcasecost","kind":"concept","label":"best-case cost","sources":[{"id":"nist-dads.bestcasecost","title":"NIST Dictionary of Algorithms and Data Structures: bestcasecost","url":"https://xlinux.nist.gov/dads/HTML/bestcasecost.html"}],"status":"reported","summary":"NIST DADS defines best-case cost as: The minimum cost to process an input sequence. Also known as optimal cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bestfirst","kind":"method","label":"best-first search","sources":[{"id":"nist-dads.bestfirst","title":"NIST Dictionary of Algorithms and Data Structures: bestfirst","url":"https://xlinux.nist.gov/dads/HTML/bestfirst.html"}],"status":"reported","summary":"NIST DADS defines best-first search as: A state-space search algorithm that considers the estimated best partial solution next. This is typically implemented with a priority queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.biconnectedcomponent","kind":"concept","label":"biconnected component","sources":[{"id":"nist-dads.biconnectedcomponent","title":"NIST Dictionary of Algorithms and Data Structures: biconnectedComponent","url":"https://xlinux.nist.gov/dads/HTML/biconnectedComponent.html"}],"status":"reported","summary":"NIST DADS defines biconnected component as: A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.biconnectedgraph","kind":"concept","label":"biconnected graph","sources":[{"id":"nist-dads.biconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: biconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/biconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines biconnected graph as: A connected graph that is not broken into disconnected pieces by deleting any single vertex (and incident edges ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bidirectionalbubblesort","kind":"method","label":"bidirectional bubble sort","sources":[{"id":"nist-dads.bidirectionalbubblesort","title":"NIST Dictionary of Algorithms and Data Structures: bidirectionalBubbleSort","url":"https://xlinux.nist.gov/dads/HTML/bidirectionalBubbleSort.html"}],"status":"reported","summary":"NIST DADS defines bidirectional bubble sort as: A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps. Also known as cocktail shaker sort, shaker sort, double-direction bubble sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarypriorityqueue","kind":"concept","label":"binary priority queue","sources":[{"id":"nist-dads.binarypriorityqueue","title":"NIST Dictionary of Algorithms and Data Structures: binaryPriorityQueue","url":"https://xlinux.nist.gov/dads/HTML/binaryPriorityQueue.html"}],"status":"reported","summary":"NIST DADS defines binary priority queue as: A priority queue implemented with a binary tree having the following restrictions: The key of a node is greater than keys of its children , i.e., it has the heap property . If the right subtree is not empty, the left subtree is not empty. If there are both left and right children, the left child's key is greater than the right child's key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryrelation","kind":"concept","label":"binary relation","sources":[{"id":"nist-dads.binaryrelation","title":"NIST Dictionary of Algorithms and Data Structures: binaryRelation","url":"https://xlinux.nist.gov/dads/HTML/binaryRelation.html"}],"status":"reported","summary":"NIST DADS defines binary relation as: A relation between exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an edge to) for vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryfunc","kind":"concept","label":"binary function","sources":[{"id":"nist-dads.binaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: binaryfunc","url":"https://xlinux.nist.gov/dads/HTML/binaryfunc.html"}],"status":"reported","summary":"NIST DADS defines binary function as: A function with two arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.binaryinsort","kind":"method","label":"binary insertion sort","sources":[{"id":"nist-dads.binaryinsort","title":"NIST Dictionary of Algorithms and Data Structures: binaryinsort","url":"https://xlinux.nist.gov/dads/HTML/binaryinsort.html"}],"status":"reported","summary":"NIST DADS defines binary insertion sort as: Insertion sort in which the proper location for the next item is found with a binary search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bingosort","kind":"method","label":"bingo sort","sources":[{"id":"nist-dads.bingosort","title":"NIST Dictionary of Algorithms and Data Structures: bingosort","url":"https://xlinux.nist.gov/dads/HTML/bingosort.html"}],"status":"reported","summary":"NIST DADS defines bingo sort as: A variant of selection sort that orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass. This is more efficient than selection sort if there are many duplicate values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binpacking","kind":"concept","label":"bin packing problem","sources":[{"id":"nist-dads.binpacking","title":"NIST Dictionary of Algorithms and Data Structures: binpacking","url":"https://xlinux.nist.gov/dads/HTML/binpacking.html"}],"status":"reported","summary":"NIST DADS defines bin packing problem as: Determine how to put the most objects in the least number of fixed space bins. More formally, find a partition and assignment of a set of objects such that a constraint is satisfied or an objective function is minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bipartmatch","kind":"concept","label":"bipartite matching","sources":[{"id":"nist-dads.bipartmatch","title":"NIST Dictionary of Algorithms and Data Structures: bipartmatch","url":"https://xlinux.nist.gov/dads/HTML/bipartmatch.html"}],"status":"reported","summary":"NIST DADS defines bipartite matching as: (1) A perfect matching between vertices of a bipartite graph , that is, a subgraph that pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching. Also known as maximum bipartite matching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bitvector","kind":"concept","label":"bit vector","sources":[{"id":"nist-dads.bitvector","title":"NIST Dictionary of Algorithms and Data Structures: bitVector","url":"https://xlinux.nist.gov/dads/HTML/bitVector.html"}],"status":"reported","summary":"NIST DADS defines bit vector as: An array of bits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.blindsort","kind":"method","label":"blind sort","sources":[{"id":"nist-dads.blindsort","title":"NIST Dictionary of Algorithms and Data Structures: blindSort","url":"https://xlinux.nist.gov/dads/HTML/blindSort.html"}],"status":"reported","summary":"NIST DADS defines blind sort as: A specialized sort algorithm that first builds a blind trie , then traverse the tree left to right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blindtrie","kind":"concept","label":"blind trie","sources":[{"id":"nist-dads.blindtrie","title":"NIST Dictionary of Algorithms and Data Structures: blindTrie","url":"https://xlinux.nist.gov/dads/HTML/blindTrie.html"}],"status":"reported","summary":"NIST DADS defines blind trie as: A specialized Patricia tree whose internal nodes store only an integer, k, which is the length of the common prefix of the strings in the children . Equivalently, the strings first differ in the (k+1) st character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.block","kind":"concept","label":"block","sources":[{"id":"nist-dads.block","title":"NIST Dictionary of Algorithms and Data Structures: block","url":"https://xlinux.nist.gov/dads/HTML/block.html"}],"status":"reported","summary":"NIST DADS defines block as: (1) A number of items which are handled together for efficiency. (2) A sequence of don't care symbols.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blockaddressingindex","kind":"concept","label":"block addressing index","sources":[{"id":"nist-dads.blockaddressingindex","title":"NIST Dictionary of Algorithms and Data Structures: blockAddressingIndex","url":"https://xlinux.nist.gov/dads/HTML/blockAddressingIndex.html"}],"status":"reported","summary":"NIST DADS defines block addressing index as: An inverted index that includes the block , or general location, within texts, in addition to the text in which the word appears.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blockingflow","kind":"concept","label":"blocking flow","sources":[{"id":"nist-dads.blockingflow","title":"NIST Dictionary of Algorithms and Data Structures: blockingflow","url":"https://xlinux.nist.gov/dads/HTML/blockingflow.html"}],"status":"reported","summary":"NIST DADS defines blocking flow as: A flow function in which any directed path from the source to the sink contains a saturated edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bloomfilter","kind":"concept","label":"Bloom filter","sources":[{"id":"nist-dads.bloomfilter","title":"NIST Dictionary of Algorithms and Data Structures: bloomFilter","url":"https://xlinux.nist.gov/dads/HTML/bloomFilter.html"}],"status":"reported","summary":"NIST DADS defines Bloom filter as: A data structure with a probabilistic algorithm to quickly test membership in a large set using multiple hash functions into a single array of bits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blossom","kind":"concept","label":"blossom","sources":[{"id":"nist-dads.blossom","title":"NIST Dictionary of Algorithms and Data Structures: blossom","url":"https://xlinux.nist.gov/dads/HTML/blossom.html"}],"status":"reported","summary":"NIST DADS defines blossom as: An odd length cycle which appears during a matching algorithm on general graphs .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bogosort","kind":"method","label":"bogosort","sources":[{"id":"nist-dads.bogosort","title":"NIST Dictionary of Algorithms and Data Structures: bogosort","url":"https://xlinux.nist.gov/dads/HTML/bogosort.html"}],"status":"reported","summary":"NIST DADS defines bogosort as: A terribly inefficient sort algorithm that repeatedly generates a random permutation of the items until the items are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boolean","kind":"concept","label":"boolean","sources":[{"id":"nist-dads.boolean","title":"NIST Dictionary of Algorithms and Data Structures: boolean","url":"https://xlinux.nist.gov/dads/HTML/boolean.html"}],"status":"reported","summary":"NIST DADS defines boolean as: (1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations and , or , and not . (2) In mathematics, entities from an algebra equivalent to intersection , union , and complement over subsets of a given set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.booleanexpr","kind":"concept","label":"boolean expression","sources":[{"id":"nist-dads.booleanexpr","title":"NIST Dictionary of Algorithms and Data Structures: booleanexpr","url":"https://xlinux.nist.gov/dads/HTML/booleanexpr.html"}],"status":"reported","summary":"NIST DADS defines boolean expression as: An expression consisting solely of boolean variables and values and boolean operations, such as and , or , not , implies , etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.booleanfnctn","kind":"concept","label":"boolean function","sources":[{"id":"nist-dads.booleanfnctn","title":"NIST Dictionary of Algorithms and Data Structures: booleanfnctn","url":"https://xlinux.nist.gov/dads/HTML/booleanfnctn.html"}],"status":"reported","summary":"NIST DADS defines boolean function as: A function whose range is {0, 1}. It can be understood to evaluate the truth or falsity of each element of its domain .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.border","kind":"concept","label":"border","sources":[{"id":"nist-dads.border","title":"NIST Dictionary of Algorithms and Data Structures: border","url":"https://xlinux.nist.gov/dads/HTML/border.html"}],"status":"reported","summary":"NIST DADS defines border as: A string v which is both a prefix and a suffix of another string u. String v is the border of u if it is the longest proper border of u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boruvkasalgorithm","kind":"method","label":"Boruvka's algorithm","sources":[{"id":"nist-dads.boruvkasalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: boruvkasAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/boruvkasAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Boruvka's algorithm as: Compute a minimum spanning tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bottlenecktravelingsales","kind":"concept","label":"bottleneck traveling salesman","sources":[{"id":"nist-dads.bottlenecktravelingsales","title":"NIST Dictionary of Algorithms and Data Structures: bottleneckTravelingSales","url":"https://xlinux.nist.gov/dads/HTML/bottleneckTravelingSales.html"}],"status":"reported","summary":"NIST DADS defines bottleneck traveling salesman as: Find a tour where no edge is more costly than some (bottleneck) amount.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundarybasd","kind":"concept","label":"boundary-based representation","sources":[{"id":"nist-dads.boundarybasd","title":"NIST Dictionary of Algorithms and Data Structures: boundarybasd","url":"https://xlinux.nist.gov/dads/HTML/boundarybasd.html"}],"status":"reported","summary":"NIST DADS defines boundary-based representation as: A representation of a region that is based on its boundary.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundedqueue","kind":"concept","label":"bounded queue","sources":[{"id":"nist-dads.boundedqueue","title":"NIST Dictionary of Algorithms and Data Structures: boundedqueue","url":"https://xlinux.nist.gov/dads/HTML/boundedqueue.html"}],"status":"reported","summary":"NIST DADS defines bounded queue as: A queue limited to a fixed number of items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundedstack","kind":"concept","label":"bounded stack","sources":[{"id":"nist-dads.boundedstack","title":"NIST Dictionary of Algorithms and Data Structures: boundedstack","url":"https://xlinux.nist.gov/dads/HTML/boundedstack.html"}],"status":"reported","summary":"NIST DADS defines bounded stack as: A stack limited to a fixed number of items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boyermoorehorspool","kind":"method","label":"Boyer-Moore-Horspool","sources":[{"id":"nist-dads.boyermoorehorspool","title":"NIST Dictionary of Algorithms and Data Structures: boyerMooreHorspool","url":"https://xlinux.nist.gov/dads/HTML/boyerMooreHorspool.html"}],"status":"reported","summary":"NIST DADS defines Boyer-Moore-Horspool as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next matching position in the pattern. Also known as Horspool.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bozosort","kind":"method","label":"bozo sort","sources":[{"id":"nist-dads.bozosort","title":"NIST Dictionary of Algorithms and Data Structures: bozoSort","url":"https://xlinux.nist.gov/dads/HTML/bozoSort.html"}],"status":"reported","summary":"NIST DADS defines bozo sort as: A terribly inefficient sort algorithm that randomly swaps items until they are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bpp","kind":"concept","label":"BPP","sources":[{"id":"nist-dads.bpp","title":"NIST Dictionary of Algorithms and Data Structures: bpp","url":"https://xlinux.nist.gov/dads/HTML/bpp.html"}],"status":"reported","summary":"NIST DADS defines BPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \" B ounded error P robability in P olynomial\" time. Also known as bounded error probability in polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bradfordslaw","kind":"concept","label":"Bradford's law","sources":[{"id":"nist-dads.bradfordslaw","title":"NIST Dictionary of Algorithms and Data Structures: bradfordsLaw","url":"https://xlinux.nist.gov/dads/HTML/bradfordsLaw.html"}],"status":"reported","summary":"NIST DADS defines Bradford's law as: Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals. The number of journals is 1:n:n².","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bresenham","kind":"method","label":"Bresenham's algorithm","sources":[{"id":"nist-dads.bresenham","title":"NIST Dictionary of Algorithms and Data Structures: bresenham","url":"https://xlinux.nist.gov/dads/HTML/bresenham.html"}],"status":"reported","summary":"NIST DADS defines Bresenham's algorithm as: An efficient algorithm to render a line with pixels. The long dimension is incremented for each pixel, and the fractional slope is accumulated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bridge","kind":"concept","label":"bridge","sources":[{"id":"nist-dads.bridge","title":"NIST Dictionary of Algorithms and Data Structures: bridge","url":"https://xlinux.nist.gov/dads/HTML/bridge.html"}],"status":"reported","summary":"NIST DADS defines bridge as: An edge of a connected graph whose removal would make the graph unconnected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.britishmuseum","kind":"method","label":"British Museum technique","sources":[{"id":"nist-dads.britishmuseum","title":"NIST Dictionary of Algorithms and Data Structures: britishMuseum","url":"https://xlinux.nist.gov/dads/HTML/britishMuseum.html"}],"status":"reported","summary":"NIST DADS defines British Museum technique as: Find a solution by checking all possibilities one by one, beginning with the smallest. This is a conceptual, not a practical, technique where the number of possibilities are enormous.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforcestrsrchwmismatch","kind":"method","label":"brute force string search with mismatches","sources":[{"id":"nist-dads.bruteforcestrsrchwmismatch","title":"NIST Dictionary of Algorithms and Data Structures: bruteForceStrSrchwMismatch","url":"https://xlinux.nist.gov/dads/HTML/bruteForceStrSrchwMismatch.html"}],"status":"reported","summary":"NIST DADS defines brute force string search with mismatches as: Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the pattern and the substring beginning at that position don't match (the Hamming distance ). Return the first position with k or fewer mismatches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforcestringsearch","kind":"method","label":"brute force string search","sources":[{"id":"nist-dads.bruteforcestringsearch","title":"NIST Dictionary of Algorithms and Data Structures: bruteForceStringSearch","url":"https://xlinux.nist.gov/dads/HTML/bruteForceStringSearch.html"}],"status":"reported","summary":"NIST DADS defines brute force string search as: Find a string in another string or body of text by trying each position one at a time. There are many far faster string matching algorithms. Also known as naive string search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforce","kind":"method","label":"brute force","sources":[{"id":"nist-dads.bruteforce","title":"NIST Dictionary of Algorithms and Data Structures: bruteforce","url":"https://xlinux.nist.gov/dads/HTML/bruteforce.html"}],"status":"reported","summary":"NIST DADS defines brute force as: An algorithm that inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bsptree","kind":"concept","label":"BSP-tree","sources":[{"id":"nist-dads.bsptree","title":"NIST Dictionary of Algorithms and Data Structures: bsptree","url":"https://xlinux.nist.gov/dads/HTML/bsptree.html"}],"status":"reported","summary":"NIST DADS defines BSP-tree as: A binary space partitioning (BSP) tree is a binary tree for multidimensional points where successive levels are split by arbitrary hyperplanes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bstartree","kind":"concept","label":"B*-tree","sources":[{"id":"nist-dads.bstartree","title":"NIST Dictionary of Algorithms and Data Structures: bstartree","url":"https://xlinux.nist.gov/dads/HTML/bstartree.html"}],"status":"reported","summary":"NIST DADS defines B*-tree as: A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bucket","kind":"concept","label":"bucket","sources":[{"id":"nist-dads.bucket","title":"NIST Dictionary of Algorithms and Data Structures: bucket","url":"https://xlinux.nist.gov/dads/HTML/bucket.html"}],"status":"reported","summary":"NIST DADS defines bucket as: An area of storage where items with a common property are stored. Typically tree data structures and sort algorithms use many buckets, one for each group of items. Usually buckets are kept on disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.buckettrie","kind":"concept","label":"bucket trie","sources":[{"id":"nist-dads.buckettrie","title":"NIST Dictionary of Algorithms and Data Structures: bucketTrie","url":"https://xlinux.nist.gov/dads/HTML/bucketTrie.html"}],"status":"reported","summary":"NIST DADS defines bucket trie as: A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bucketmeth","kind":"concept","label":"bucketing method","sources":[{"id":"nist-dads.bucketmeth","title":"NIST Dictionary of Algorithms and Data Structures: bucketmeth","url":"https://xlinux.nist.gov/dads/HTML/bucketmeth.html"}],"status":"reported","summary":"NIST DADS defines bucketing method as: Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.buddysystem","kind":"method","label":"buddy system","sources":[{"id":"nist-dads.buddysystem","title":"NIST Dictionary of Algorithms and Data Structures: buddysystem","url":"https://xlinux.nist.gov/dads/HTML/buddysystem.html"}],"status":"reported","summary":"NIST DADS defines buddy system as: A memory allocation strategy which recursively divides allocatable blocks of memory into pairs of adjacent equal-sized blocks called \"buddies\".","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.buddytree","kind":"concept","label":"buddy tree","sources":[{"id":"nist-dads.buddytree","title":"NIST Dictionary of Algorithms and Data Structures: buddytree","url":"https://xlinux.nist.gov/dads/HTML/buddytree.html"}],"status":"reported","summary":"NIST DADS defines buddy tree as: A point access method which splits multidimensional space in different dimensions at each level. It also keeps a minimum bounding box of points accessible by each node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.buildheap","kind":"method","label":"build-heap","sources":[{"id":"nist-dads.buildheap","title":"NIST Dictionary of Algorithms and Data Structures: buildHeap","url":"https://xlinux.nist.gov/dads/HTML/buildHeap.html"}],"status":"reported","summary":"NIST DADS defines build-heap as: Convert an array into a heap by executing heapify progressively closer to the root . For an array of n nodes, this takes O(n) time under the comparison model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.burrowswheelertransform","kind":"method","label":"Burrows-Wheeler transform","sources":[{"id":"nist-dads.burrowswheelertransform","title":"NIST Dictionary of Algorithms and Data Structures: burrowsWheelerTransform","url":"https://xlinux.nist.gov/dads/HTML/burrowsWheelerTransform.html"}],"status":"reported","summary":"NIST DADS defines Burrows-Wheeler transform as: Permute a string . Repeated substrings lead to repeated characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string. Also known as BWT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.busybeaver","kind":"concept","label":"busy beaver","sources":[{"id":"nist-dads.busybeaver","title":"NIST Dictionary of Algorithms and Data Structures: busyBeaver","url":"https://xlinux.nist.gov/dads/HTML/busyBeaver.html"}],"status":"reported","summary":"NIST DADS defines busy beaver as: (1) A Turing machine with a small number of states that halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps. (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bvtree","kind":"concept","label":"BV-tree","sources":[{"id":"nist-dads.bvtree","title":"NIST Dictionary of Algorithms and Data Structures: bvtree","url":"https://xlinux.nist.gov/dads/HTML/bvtree.html"}],"status":"reported","summary":"NIST DADS defines BV-tree as: A conceptual idea which generalizes B-trees to multiple dimensions. BV-trees are not balanced, and searching may require backtracking .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.byzantine","kind":"concept","label":"Byzantine generals","sources":[{"id":"nist-dads.byzantine","title":"NIST Dictionary of Algorithms and Data Structures: byzantine","url":"https://xlinux.nist.gov/dads/HTML/byzantine.html"}],"status":"reported","summary":"NIST DADS defines Byzantine generals as: The problem of reaching a consensus among distributed units if some of them give misleading answers. To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making algorithm should the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cactusstack","kind":"concept","label":"cactus stack","sources":[{"id":"nist-dads.cactusstack","title":"NIST Dictionary of Algorithms and Data Structures: cactusstack","url":"https://xlinux.nist.gov/dads/HTML/cactusstack.html"}],"status":"reported","summary":"NIST DADS defines cactus stack as: A variant of stack in which one other cactus stack may be attached to the top. An attached stack is called a \"branch.\" When a branch becomes empty, it is removed. Pop is not allowed if there is a branch. A branch is only accessible through the original reference; it is not accessible through the stack. Formal Definition: The operations new to this variant of stack, branch(S, T) and notch(v), may be defined with axiomatic semantics as follows. top(branch(S, T)) = top(S) notch(new()) = false notch(push(v, S)) = false notch(branch(S, T)) = true Also known as saguaro stack.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.calcucommsys","kind":"concept","label":"Calculus of Communicating Systems","sources":[{"id":"nist-dads.calcucommsys","title":"NIST Dictionary of Algorithms and Data Structures: calcucommsys","url":"https://xlinux.nist.gov/dads/HTML/calcucommsys.html"}],"status":"reported","summary":"NIST DADS defines Calculus of Communicating Systems as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. Commonly known as CCS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.calendarqueue","kind":"concept","label":"calendar queue","sources":[{"id":"nist-dads.calendarqueue","title":"NIST Dictionary of Algorithms and Data Structures: calendarQueue","url":"https://xlinux.nist.gov/dads/HTML/calendarQueue.html"}],"status":"reported","summary":"NIST DADS defines calendar queue as: A fast priority queue implementation having N buckets each with width w, or covering w time. An item with priority p more than current goes in bucket (p/w)%N. Choose N and w to have few items in each bucket. Keep items sorted within buckets. Double or halve N and change w if the number of items grows or shrinks a lot.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.candidate","kind":"concept","label":"candidate consistency testing","sources":[{"id":"nist-dads.candidate","title":"NIST Dictionary of Algorithms and Data Structures: candidate","url":"https://xlinux.nist.gov/dads/HTML/candidate.html"}],"status":"reported","summary":"NIST DADS defines candidate consistency testing as: The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.candidateverification","kind":"concept","label":"candidate verification","sources":[{"id":"nist-dads.candidateverification","title":"NIST Dictionary of Algorithms and Data Structures: candidateVerification","url":"https://xlinux.nist.gov/dads/HTML/candidateVerification.html"}],"status":"reported","summary":"NIST DADS defines candidate verification as: The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.canonical","kind":"concept","label":"canonical complexity class","sources":[{"id":"nist-dads.canonical","title":"NIST Dictionary of Algorithms and Data Structures: canonical","url":"https://xlinux.nist.gov/dads/HTML/canonical.html"}],"status":"reported","summary":"NIST DADS defines canonical complexity class as: One of the classes defined by logarithmic , polynomial , and exponential bounds on time and space, for deterministic and nondeterministic machines. These classify most of the important computational problems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacifacloc","kind":"concept","label":"capacitated facility location","sources":[{"id":"nist-dads.capacifacloc","title":"NIST Dictionary of Algorithms and Data Structures: capacifacloc","url":"https://xlinux.nist.gov/dads/HTML/capacifacloc.html"}],"status":"reported","summary":"NIST DADS defines capacitated facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance objective function and no supply supports too many demand points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacity","kind":"concept","label":"capacity","sources":[{"id":"nist-dads.capacity","title":"NIST Dictionary of Algorithms and Data Structures: capacity","url":"https://xlinux.nist.gov/dads/HTML/capacity.html"}],"status":"reported","summary":"NIST DADS defines capacity as: The maximum flow that may be sent through an edge or a vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacitycstr","kind":"concept","label":"capacity constraint","sources":[{"id":"nist-dads.capacitycstr","title":"NIST Dictionary of Algorithms and Data Structures: capacitycstr","url":"https://xlinux.nist.gov/dads/HTML/capacitycstr.html"}],"status":"reported","summary":"NIST DADS defines capacity constraint as: The property that the flow on every edge of a flow network is no more than the edge's capacity . More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.caverphone","kind":"method","label":"Caverphone","sources":[{"id":"nist-dads.caverphone","title":"NIST Dictionary of Algorithms and Data Structures: caverphone","url":"https://xlinux.nist.gov/dads/HTML/caverphone.html"}],"status":"reported","summary":"NIST DADS defines Caverphone as: An algorithm to code English names phonetically.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ccs","kind":"concept","label":"CCS","sources":[{"id":"nist-dads.ccs","title":"NIST Dictionary of Algorithms and Data Structures: ccs","url":"https://xlinux.nist.gov/dads/HTML/ccs.html"}],"status":"reported","summary":"NIST DADS defines CCS as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. An acronym for Calculus of Communicating Systems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cellprobemodel","kind":"concept","label":"cell probe model","sources":[{"id":"nist-dads.cellprobemodel","title":"NIST Dictionary of Algorithms and Data Structures: cellProbeModel","url":"https://xlinux.nist.gov/dads/HTML/cellProbeModel.html"}],"status":"reported","summary":"NIST DADS defines cell probe model as: A model of computation where the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size. All other computations are not counted and are considered to be free.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.celltree","kind":"concept","label":"cell tree","sources":[{"id":"nist-dads.celltree","title":"NIST Dictionary of Algorithms and Data Structures: celltree","url":"https://xlinux.nist.gov/dads/HTML/celltree.html"}],"status":"reported","summary":"NIST DADS defines cell tree as: A spatial access method where successive levels are split by arbitrary hyperplanes. Concave objects are decomposed into convex pieces. Each convex piece is indexed in every cell which it overlaps.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cellulartmtn","kind":"concept","label":"cellular automaton","sources":[{"id":"nist-dads.cellulartmtn","title":"NIST Dictionary of Algorithms and Data Structures: cellulartmtn","url":"https://xlinux.nist.gov/dads/HTML/cellulartmtn.html"}],"status":"reported","summary":"NIST DADS defines cellular automaton as: Usually a two-dimensional organization of simple finite state machines whose next state depends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.centroid","kind":"concept","label":"centroid","sources":[{"id":"nist-dads.centroid","title":"NIST Dictionary of Algorithms and Data Structures: centroid","url":"https://xlinux.nist.gov/dads/HTML/centroid.html"}],"status":"reported","summary":"NIST DADS defines centroid as: The center of gravity or center of mass of an object.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.certificate","kind":"concept","label":"certificate","sources":[{"id":"nist-dads.certificate","title":"NIST Dictionary of Algorithms and Data Structures: certificate","url":"https://xlinux.nist.gov/dads/HTML/certificate.html"}],"status":"reported","summary":"NIST DADS defines certificate as: (1) Extra information so the correctness of an answer to a decision problem can be quickly checked. (2) For any graph property P and graph G, a certificate for G is a graph G' such that G has property P if and only if G' has the property.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chain","kind":"concept","label":"chain","sources":[{"id":"nist-dads.chain","title":"NIST Dictionary of Algorithms and Data Structures: chain","url":"https://xlinux.nist.gov/dads/HTML/chain.html"}],"status":"reported","summary":"NIST DADS defines chain as: A set with a total order .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chaining","kind":"concept","label":"chaining","sources":[{"id":"nist-dads.chaining","title":"NIST Dictionary of Algorithms and Data Structures: chaining","url":"https://xlinux.nist.gov/dads/HTML/chaining.html"}],"status":"reported","summary":"NIST DADS defines chaining as: A class of collision resolution schemes in which linked lists handle collisions in a hash table . The two main subclasses are separate chaining , where lists are outside the table, and coalesced chaining , where the lists are within the table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.child","kind":"concept","label":"child","sources":[{"id":"nist-dads.child","title":"NIST Dictionary of Algorithms and Data Structures: child","url":"https://xlinux.nist.gov/dads/HTML/child.html"}],"status":"reported","summary":"NIST DADS defines child as: A node of a tree referred to by a parent node. See the figure at tree . Every node, except the root , is the child of some parent.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chinesepostman","kind":"concept","label":"Chinese postman problem","sources":[{"id":"nist-dads.chinesepostman","title":"NIST Dictionary of Algorithms and Data Structures: chinesePostman","url":"https://xlinux.nist.gov/dads/HTML/chinesePostman.html"}],"status":"reported","summary":"NIST DADS defines Chinese postman problem as: Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.chinesermndr","kind":"method","label":"Chinese remainder theorem","sources":[{"id":"nist-dads.chinesermndr","title":"NIST Dictionary of Algorithms and Data Structures: chineseRmndr","url":"https://xlinux.nist.gov/dads/HTML/chineseRmndr.html"}],"status":"reported","summary":"NIST DADS defines Chinese remainder theorem as: An integer n can be solved uniquely mod LCM(A(i)) , given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.christofides","kind":"method","label":"Christofides algorithm","sources":[{"id":"nist-dads.christofides","title":"NIST Dictionary of Algorithms and Data Structures: christofides","url":"https://xlinux.nist.gov/dads/HTML/christofides.html"}],"status":"reported","summary":"NIST DADS defines Christofides algorithm as: (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Step 1: find a minimum spanning tree T. Step 2: find a perfect matching M among vertices with odd degree . Step 3: combine the edges of M and T to make a multigraph G. Step 4: find an Euler cycle in G. Step 5: Turn the Euler cycle into a Hamiltonian cycle by skipping vertices already seen. (2) An algorithm to find the chromatic number of a graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chromatcnmbr","kind":"concept","label":"chromatic number","sources":[{"id":"nist-dads.chromatcnmbr","title":"NIST Dictionary of Algorithms and Data Structures: chromatcnmbr","url":"https://xlinux.nist.gov/dads/HTML/chromatcnmbr.html"}],"status":"reported","summary":"NIST DADS defines chromatic number as: The minimum number of colors needed to color the vertices of a graph such that no two adjacent vertices have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chromaticndx","kind":"concept","label":"chromatic index","sources":[{"id":"nist-dads.chromaticndx","title":"NIST Dictionary of Algorithms and Data Structures: chromaticndx","url":"https://xlinux.nist.gov/dads/HTML/chromaticndx.html"}],"status":"reported","summary":"NIST DADS defines chromatic index as: The minimum number of colors needed to color the edges of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circuit","kind":"concept","label":"circuit","sources":[{"id":"nist-dads.circuit","title":"NIST Dictionary of Algorithms and Data Structures: circuit","url":"https://xlinux.nist.gov/dads/HTML/circuit.html"}],"status":"reported","summary":"NIST DADS defines circuit as: (1) An acyclic network of inputs, logic gates, and outputs. Contrasted with a Turing machine , it has no memory. (2) A cycle in a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circuitcomplexity","kind":"concept","label":"circuit complexity","sources":[{"id":"nist-dads.circuitcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: circuitComplexity","url":"https://xlinux.nist.gov/dads/HTML/circuitComplexity.html"}],"status":"reported","summary":"NIST DADS defines circuit complexity as: The study of the size, depth, and other attributes of circuits that decide specified languages or compute specified functions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clique","kind":"concept","label":"clique","sources":[{"id":"nist-dads.clique","title":"NIST Dictionary of Algorithms and Data Structures: clique","url":"https://xlinux.nist.gov/dads/HTML/clique.html"}],"status":"reported","summary":"NIST DADS defines clique as: A set of vertices in an undirected graph in which there is an edge between every pair of vertices. In other words, a subgraph that is complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cliqueproblm","kind":"concept","label":"clique problem","sources":[{"id":"nist-dads.cliqueproblm","title":"NIST Dictionary of Algorithms and Data Structures: cliqueproblm","url":"https://xlinux.nist.gov/dads/HTML/cliqueproblm.html"}],"status":"reported","summary":"NIST DADS defines clique problem as: Find the largest clique in an undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clustering","kind":"concept","label":"clustering","sources":[{"id":"nist-dads.clustering","title":"NIST Dictionary of Algorithms and Data Structures: clustering","url":"https://xlinux.nist.gov/dads/HTML/clustering.html"}],"status":"reported","summary":"NIST DADS defines clustering as: The tendency for entries in a hash table using open addressing to be stored together, even when the table has ample empty space to spread them out.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clusteringfree","kind":"concept","label":"clustering free","sources":[{"id":"nist-dads.clusteringfree","title":"NIST Dictionary of Algorithms and Data Structures: clusteringFree","url":"https://xlinux.nist.gov/dads/HTML/clusteringFree.html"}],"status":"reported","summary":"NIST DADS defines clustering free as: When a collision resolution scheme spreads out entries in a hash table .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.coalescedchaining","kind":"concept","label":"coalesced chaining","sources":[{"id":"nist-dads.coalescedchaining","title":"NIST Dictionary of Algorithms and Data Structures: coalescedChaining","url":"https://xlinux.nist.gov/dads/HTML/coalescedChaining.html"}],"status":"reported","summary":"NIST DADS defines coalesced chaining as: A scheme in which linked lists within the hash table handle collisions . An item that collides is put in the next empty place in the array and added to the end of a list embedded in the array items. Any open addressing method to compute possible new positions may be used to find the \"next\" empty place.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.coarsening","kind":"concept","label":"coarsening","sources":[{"id":"nist-dads.coarsening","title":"NIST Dictionary of Algorithms and Data Structures: coarsening","url":"https://xlinux.nist.gov/dads/HTML/coarsening.html"}],"status":"reported","summary":"NIST DADS defines coarsening as: To alter a problem, typically restricting it to a less complex feasible region or objective function , so that the resulting problem can be efficiently solved, usually by dynamic programming .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.codeword","kind":"concept","label":"codeword","sources":[{"id":"nist-dads.codeword","title":"NIST Dictionary of Algorithms and Data Structures: codeword","url":"https://xlinux.nist.gov/dads/HTML/codeword.html"}],"status":"reported","summary":"NIST DADS defines codeword as: Sequence of bits of a code corresponding to a symbol.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.codingtree","kind":"concept","label":"coding tree","sources":[{"id":"nist-dads.codingtree","title":"NIST Dictionary of Algorithms and Data Structures: codingTree","url":"https://xlinux.nist.gov/dads/HTML/codingTree.html"}],"status":"reported","summary":"NIST DADS defines coding tree as: A full binary tree that represents a coding, such as produced by Huffman coding . Each leaf is an encoded symbol. The path from the root to a leaf is its codeword.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.collectiverecursion","kind":"method","label":"collective recursion","sources":[{"id":"nist-dads.collectiverecursion","title":"NIST Dictionary of Algorithms and Data Structures: collectiveRecursion","url":"https://xlinux.nist.gov/dads/HTML/collectiveRecursion.html"}],"status":"reported","summary":"NIST DADS defines collective recursion as: A special form of tail recursion , where the results are produced during the recursive calls and nothing is returned. The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.collision","kind":"concept","label":"collision","sources":[{"id":"nist-dads.collision","title":"NIST Dictionary of Algorithms and Data Structures: collision","url":"https://xlinux.nist.gov/dads/HTML/collision.html"}],"status":"reported","summary":"NIST DADS defines collision as: When two or more items should be kept in the same location, especially in hash tables , that is, when two or more different keys hash to the same value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.collisionres","kind":"method","label":"collision resolution scheme","sources":[{"id":"nist-dads.collisionres","title":"NIST Dictionary of Algorithms and Data Structures: collisionres","url":"https://xlinux.nist.gov/dads/HTML/collisionres.html"}],"status":"reported","summary":"NIST DADS defines collision resolution scheme as: A way of handling collisions , that is, when two or more items should be kept in the same location, especially in a hash table . The general ways are keeping subsequent items within the table and computing possible locations ( open addressing ), keeping lists for items that collide ( chaining ), or keeping one special overflow area.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.combination","kind":"method","label":"combination","sources":[{"id":"nist-dads.combination","title":"NIST Dictionary of Algorithms and Data Structures: combination","url":"https://xlinux.nist.gov/dads/HTML/combination.html"}],"status":"reported","summary":"NIST DADS defines combination as: Choose m of n elements, where m ≤ n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.communseqpro","kind":"concept","label":"Communicating Sequential Processes","sources":[{"id":"nist-dads.communseqpro","title":"NIST Dictionary of Algorithms and Data Structures: communseqpro","url":"https://xlinux.nist.gov/dads/HTML/communseqpro.html"}],"status":"reported","summary":"NIST DADS defines Communicating Sequential Processes as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. Commonly known as CSP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.commutative","kind":"concept","label":"commutative","sources":[{"id":"nist-dads.commutative","title":"NIST Dictionary of Algorithms and Data Structures: commutative","url":"https://xlinux.nist.gov/dads/HTML/commutative.html"}],"status":"reported","summary":"NIST DADS defines commutative as: A function where f(A, B) = f(B, A).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compactdawg","kind":"concept","label":"compact DAWG","sources":[{"id":"nist-dads.compactdawg","title":"NIST Dictionary of Algorithms and Data Structures: compactDAWG","url":"https://xlinux.nist.gov/dads/HTML/compactDAWG.html"}],"status":"reported","summary":"NIST DADS defines compact DAWG as: A directed acyclic word graph (DAWG) representing the suffixes of a given string in which each edge is labeled with the longest possible string. The strings along a path from the root to a node are the substring which the node represents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compactdatastruct","kind":"concept","label":"compact data structure","sources":[{"id":"nist-dads.compactdatastruct","title":"NIST Dictionary of Algorithms and Data Structures: compactDataStruct","url":"https://xlinux.nist.gov/dads/HTML/compactDataStruct.html"}],"status":"reported","summary":"NIST DADS defines compact data structure as: A data structure that needs far less space and allows efficient access without decompression.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compacttrie","kind":"concept","label":"compact trie","sources":[{"id":"nist-dads.compacttrie","title":"NIST Dictionary of Algorithms and Data Structures: compactTrie","url":"https://xlinux.nist.gov/dads/HTML/compactTrie.html"}],"status":"reported","summary":"NIST DADS defines compact trie as: A trie in which nonbranching subtrees leading to leaf nodes are cut off.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.competitiveanalysis","kind":"concept","label":"competitive analysis","sources":[{"id":"nist-dads.competitiveanalysis","title":"NIST Dictionary of Algorithms and Data Structures: competitiveAnalysis","url":"https://xlinux.nist.gov/dads/HTML/competitiveAnalysis.html"}],"status":"reported","summary":"NIST DADS defines competitive analysis as: An analysis in which the performance of an on-line algorithm is compared to the best that could have been achieved if all the inputs had been known in advance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.competitivrt","kind":"concept","label":"competitive ratio","sources":[{"id":"nist-dads.competitivrt","title":"NIST Dictionary of Algorithms and Data Structures: competitivrt","url":"https://xlinux.nist.gov/dads/HTML/competitivrt.html"}],"status":"reported","summary":"NIST DADS defines competitive ratio as: The worst case of the ratio between the cost incurred by an on-line algorithm and the best-case cost .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complement","kind":"concept","label":"complement","sources":[{"id":"nist-dads.complement","title":"NIST Dictionary of Algorithms and Data Structures: complement","url":"https://xlinux.nist.gov/dads/HTML/complement.html"}],"status":"reported","summary":"NIST DADS defines complement as: (1) Of a boolean , 0 if 1, or 1 if 0. See not . (2) Of a set A, a set having all the members which are in the universe , but not in A.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completebinarytree","kind":"concept","label":"complete binary tree","sources":[{"id":"nist-dads.completebinarytree","title":"NIST Dictionary of Algorithms and Data Structures: completeBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/completeBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines complete binary tree as: A binary tree in which every level (depth), except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completetree","kind":"concept","label":"complete tree","sources":[{"id":"nist-dads.completetree","title":"NIST Dictionary of Algorithms and Data Structures: completetree","url":"https://xlinux.nist.gov/dads/HTML/completetree.html"}],"status":"reported","summary":"NIST DADS defines complete tree as: A tree in which every level , except possibly the deepest, is entirely filled. At depth n, the height of the tree, all nodes are as far left as possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complexity","kind":"concept","label":"complexity","sources":[{"id":"nist-dads.complexity","title":"NIST Dictionary of Algorithms and Data Structures: complexity","url":"https://xlinux.nist.gov/dads/HTML/complexity.html"}],"status":"reported","summary":"NIST DADS defines complexity as: The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an algorithm .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complexityclass","kind":"concept","label":"complexity class","sources":[{"id":"nist-dads.complexityclass","title":"NIST Dictionary of Algorithms and Data Structures: complexityClass","url":"https://xlinux.nist.gov/dads/HTML/complexityClass.html"}],"status":"reported","summary":"NIST DADS defines complexity class as: Any of a set of computational problems with the same bounds ( Θ(n) ) on time and space, for deterministic and nondeterministic machines.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compoundalgorithm","kind":"concept","label":"compound algorithm","sources":[{"id":"nist-dads.compoundalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: compoundAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/compoundAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines compound algorithm as: An algorithm in which one or more of the computable steps is a call to execute another algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.computable","kind":"concept","label":"computable","sources":[{"id":"nist-dads.computable","title":"NIST Dictionary of Algorithms and Data Structures: computable","url":"https://xlinux.nist.gov/dads/HTML/computable.html"}],"status":"reported","summary":"NIST DADS defines computable as: A function that can be computed by an algorithm --- equivalently, by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentdatastructure","kind":"concept","label":"concurrent data structure","sources":[{"id":"nist-dads.concurrentdatastructure","title":"NIST Dictionary of Algorithms and Data Structures: concurrentDataStructure","url":"https://xlinux.nist.gov/dads/HTML/concurrentDataStructure.html"}],"status":"reported","summary":"NIST DADS defines concurrent data structure as: A data structure designed to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentreadconwrt","kind":"concept","label":"concurrent read, concurrent write","sources":[{"id":"nist-dads.concurrentreadconwrt","title":"NIST Dictionary of Algorithms and Data Structures: concurrentReadConWrt","url":"https://xlinux.nist.gov/dads/HTML/concurrentReadConWrt.html"}],"status":"reported","summary":"NIST DADS defines concurrent read, concurrent write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location. Also known as CRCW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentreadexcluwrt","kind":"concept","label":"concurrent read, exclusive write","sources":[{"id":"nist-dads.concurrentreadexcluwrt","title":"NIST Dictionary of Algorithms and Data Structures: concurrentReadExcluWrt","url":"https://xlinux.nist.gov/dads/HTML/concurrentReadExcluWrt.html"}],"status":"reported","summary":"NIST DADS defines concurrent read, exclusive write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time. Also known as CREW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrntflw","kind":"concept","label":"concurrent flow","sources":[{"id":"nist-dads.concurrntflw","title":"NIST Dictionary of Algorithms and Data Structures: concurrntflw","url":"https://xlinux.nist.gov/dads/HTML/concurrntflw.html"}],"status":"reported","summary":"NIST DADS defines concurrent flow as: A multi-commodity flow in which the same fraction of the demand of each commodity is satisfied.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.confluentlypersistdata","kind":"concept","label":"confluently persistent data structure","sources":[{"id":"nist-dads.confluentlypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: confluentlyPersistData","url":"https://xlinux.nist.gov/dads/HTML/confluentlyPersistData.html"}],"status":"reported","summary":"NIST DADS defines confluently persistent data structure as: A fully persistent data structure that allows meld or merge operations to combine two different versions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.conjunction","kind":"concept","label":"conjunction","sources":[{"id":"nist-dads.conjunction","title":"NIST Dictionary of Algorithms and Data Structures: conjunction","url":"https://xlinux.nist.gov/dads/HTML/conjunction.html"}],"status":"reported","summary":"NIST DADS defines conjunction as: The boolean and function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.connectedcomponents","kind":"concept","label":"connected components","sources":[{"id":"nist-dads.connectedcomponents","title":"NIST Dictionary of Algorithms and Data Structures: connectedComponents","url":"https://xlinux.nist.gov/dads/HTML/connectedComponents.html"}],"status":"reported","summary":"NIST DADS defines connected components as: The set of maximally connected components of an undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.constantfunc","kind":"concept","label":"constant function","sources":[{"id":"nist-dads.constantfunc","title":"NIST Dictionary of Algorithms and Data Structures: constantfunc","url":"https://xlinux.nist.gov/dads/HTML/constantfunc.html"}],"status":"reported","summary":"NIST DADS defines constant function as: A function that always gives the same value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cookreductin","kind":"concept","label":"Cook reduction","sources":[{"id":"nist-dads.cookreductin","title":"NIST Dictionary of Algorithms and Data Structures: cookreductin","url":"https://xlinux.nist.gov/dads/HTML/cookreductin.html"}],"status":"reported","summary":"NIST DADS defines Cook reduction as: A reduction computed by a deterministic polynomial time oracle Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cookstheorem","kind":"concept","label":"Cook's theorem","sources":[{"id":"nist-dads.cookstheorem","title":"NIST Dictionary of Algorithms and Data Structures: cookstheorem","url":"https://xlinux.nist.gov/dads/HTML/cookstheorem.html"}],"status":"reported","summary":"NIST DADS defines Cook's theorem as: The language SAT of satisfiable Boolean formulas is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.cordic","kind":"method","label":"CORDIC","sources":[{"id":"nist-dads.cordic","title":"NIST Dictionary of Algorithms and Data Structures: cordic","url":"https://xlinux.nist.gov/dads/HTML/cordic.html"}],"status":"reported","summary":"NIST DADS defines CORDIC as: Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.covering","kind":"concept","label":"covering","sources":[{"id":"nist-dads.covering","title":"NIST Dictionary of Algorithms and Data Structures: covering","url":"https://xlinux.nist.gov/dads/HTML/covering.html"}],"status":"reported","summary":"NIST DADS defines covering as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.criticalpath","kind":"concept","label":"critical path problem","sources":[{"id":"nist-dads.criticalpath","title":"NIST Dictionary of Algorithms and Data Structures: criticalPath","url":"https://xlinux.nist.gov/dads/HTML/criticalPath.html"}],"status":"reported","summary":"NIST DADS defines critical path problem as: Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.csp","kind":"concept","label":"CSP","sources":[{"id":"nist-dads.csp","title":"NIST Dictionary of Algorithms and Data Structures: csp","url":"https://xlinux.nist.gov/dads/HTML/csp.html"}],"status":"reported","summary":"NIST DADS defines CSP as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. An acronym for Communicating Sequential Processes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ctl","kind":"concept","label":"CTL","sources":[{"id":"nist-dads.ctl","title":"NIST Dictionary of Algorithms and Data Structures: ctl","url":"https://xlinux.nist.gov/dads/HTML/ctl.html"}],"status":"reported","summary":"NIST DADS defines CTL as: A propositional, branching-time temporal logic for which formulas can be checked in linear time. An acronym for Computation Tree Logic.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cut","kind":"concept","label":"cut","sources":[{"id":"nist-dads.cut","title":"NIST Dictionary of Algorithms and Data Structures: cut","url":"https://xlinux.nist.gov/dads/HTML/cut.html"}],"status":"reported","summary":"NIST DADS defines cut as: A nonempty, proper subset of vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuttingstock","kind":"concept","label":"cutting stock problem","sources":[{"id":"nist-dads.cuttingstock","title":"NIST Dictionary of Algorithms and Data Structures: cuttingStock","url":"https://xlinux.nist.gov/dads/HTML/cuttingStock.html"}],"status":"reported","summary":"NIST DADS defines cutting stock problem as: Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem . It is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuttingplane","kind":"concept","label":"cutting plane","sources":[{"id":"nist-dads.cuttingplane","title":"NIST Dictionary of Algorithms and Data Structures: cuttingplane","url":"https://xlinux.nist.gov/dads/HTML/cuttingplane.html"}],"status":"reported","summary":"NIST DADS defines cutting plane as: A valid inequality for an integer polyhedron that separates the polyhedron from a given point outside it.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cutvertex","kind":"concept","label":"cut vertex","sources":[{"id":"nist-dads.cutvertex","title":"NIST Dictionary of Algorithms and Data Structures: cutvertex","url":"https://xlinux.nist.gov/dads/HTML/cutvertex.html"}],"status":"reported","summary":"NIST DADS defines cut vertex as: A vertex whose deletion along with incident edges results in a graph with more components than the original graph. Also known as articulation point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.cyclicredundancycheck","kind":"method","label":"cyclic redundancy check","sources":[{"id":"nist-dads.cyclicredundancycheck","title":"NIST Dictionary of Algorithms and Data Structures: cyclicRedundancyCheck","url":"https://xlinux.nist.gov/dads/HTML/cyclicRedundancyCheck.html"}],"status":"reported","summary":"NIST DADS defines cyclic redundancy check as: (1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of polynomials over the integers, modulo 2. (3) The characteristic bits of a block. Also known as CRC.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dadjacent","kind":"concept","label":"D-adjacent","sources":[{"id":"nist-dads.dadjacent","title":"NIST Dictionary of Algorithms and Data Structures: dadjacent","url":"https://xlinux.nist.gov/dads/HTML/dadjacent.html"}],"status":"reported","summary":"NIST DADS defines D-adjacent as: An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dagshortpath","kind":"method","label":"DAG shortest paths","sources":[{"id":"nist-dads.dagshortpath","title":"NIST Dictionary of Algorithms and Data Structures: dagShortPath","url":"https://xlinux.nist.gov/dads/HTML/dagShortPath.html"}],"status":"reported","summary":"NIST DADS defines DAG shortest paths as: Solve the single-source shortest-path problem in a weighted directed acyclic graph by 1) doing a topological sort on the vertices by edge so vertices with no incoming edges are first and vertices with only incoming edges are last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decidablelanguage","kind":"concept","label":"decidable language","sources":[{"id":"nist-dads.decidablelanguage","title":"NIST Dictionary of Algorithms and Data Structures: decidableLanguage","url":"https://xlinux.nist.gov/dads/HTML/decidableLanguage.html"}],"status":"reported","summary":"NIST DADS defines decidable language as: A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps --- equivalently, can be recognized by a Turing machine that halts for all inputs. Also known as recursive language, totally decidable language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decidableproblem","kind":"concept","label":"decidable problem","sources":[{"id":"nist-dads.decidableproblem","title":"NIST Dictionary of Algorithms and Data Structures: decidableProblem","url":"https://xlinux.nist.gov/dads/HTML/decidableProblem.html"}],"status":"reported","summary":"NIST DADS defines decidable problem as: A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language . Also known as totally decidable problem, algorithmically solvable, recursively solvable.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decisionproblem","kind":"concept","label":"decision problem","sources":[{"id":"nist-dads.decisionproblem","title":"NIST Dictionary of Algorithms and Data Structures: decisionProblem","url":"https://xlinux.nist.gov/dads/HTML/decisionProblem.html"}],"status":"reported","summary":"NIST DADS defines decision problem as: A problem with a \"yes\" or \"no\" answer. Equivalently, a function whose range is two values, such as {0,1}.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decomposable","kind":"concept","label":"decomposable searching problem","sources":[{"id":"nist-dads.decomposable","title":"NIST Dictionary of Algorithms and Data Structures: decomposable","url":"https://xlinux.nist.gov/dads/HTML/decomposable.html"}],"status":"reported","summary":"NIST DADS defines decomposable searching problem as: A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem. More formally a problem with a query Q is decomposable given if there exists an efficiently computable associative and commutative binary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.degree","kind":"concept","label":"degree","sources":[{"id":"nist-dads.degree","title":"NIST Dictionary of Algorithms and Data Structures: degree","url":"https://xlinux.nist.gov/dads/HTML/degree.html"}],"status":"reported","summary":"NIST DADS defines degree as: (1) Of a vertex , the number of edges connected to it. (2) Of a graph , the maximum degree of any vertex. (3) Of a tree node , the number of child nodes it has.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.densegraph","kind":"concept","label":"dense graph","sources":[{"id":"nist-dads.densegraph","title":"NIST Dictionary of Algorithms and Data Structures: densegraph","url":"https://xlinux.nist.gov/dads/HTML/densegraph.html"}],"status":"reported","summary":"NIST DADS defines dense graph as: A graph in which the number of edges is close to the possible number of edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.depoissonization","kind":"concept","label":"depoissonization","sources":[{"id":"nist-dads.depoissonization","title":"NIST Dictionary of Algorithms and Data Structures: depoissonization","url":"https://xlinux.nist.gov/dads/HTML/depoissonization.html"}],"status":"reported","summary":"NIST DADS defines depoissonization as: To interpret a solution to a poisson model in the original model after poissonization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.depth","kind":"concept","label":"depth","sources":[{"id":"nist-dads.depth","title":"NIST Dictionary of Algorithms and Data Structures: depth","url":"https://xlinux.nist.gov/dads/HTML/depth.html"}],"status":"reported","summary":"NIST DADS defines depth as: Of a node , the distance from the node to the root of the tree . Formal Definition: The depth of the root is 0. The depth of a node is one plus the depth of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.derangement","kind":"method","label":"derangement","sources":[{"id":"nist-dads.derangement","title":"NIST Dictionary of Algorithms and Data Structures: derangement","url":"https://xlinux.nist.gov/dads/HTML/derangement.html"}],"status":"reported","summary":"NIST DADS defines derangement as: A permutation of elements, where no element is in its original position.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.descendant","kind":"concept","label":"descendant","sources":[{"id":"nist-dads.descendant","title":"NIST Dictionary of Algorithms and Data Structures: descendant","url":"https://xlinux.nist.gov/dads/HTML/descendant.html"}],"status":"reported","summary":"NIST DADS defines descendant as: A child of a node in a tree , any of the children of the children, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.determfinitautsrch","kind":"method","label":"deterministic finite automata string search","sources":[{"id":"nist-dads.determfinitautsrch","title":"NIST Dictionary of Algorithms and Data Structures: determFinitAutSrch","url":"https://xlinux.nist.gov/dads/HTML/determFinitAutSrch.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite automata string search as: A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determfinittreeautom","kind":"concept","label":"deterministic finite tree automaton","sources":[{"id":"nist-dads.determfinittreeautom","title":"NIST Dictionary of Algorithms and Data Structures: determFinitTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/determFinitTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite tree automaton as: A deterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as DFTA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determtreeautom","kind":"concept","label":"deterministic tree automaton","sources":[{"id":"nist-dads.determtreeautom","title":"NIST Dictionary of Algorithms and Data Structures: determTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/determTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines deterministic tree automaton as: A deterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.deterministc","kind":"concept","label":"deterministic","sources":[{"id":"nist-dads.deterministc","title":"NIST Dictionary of Algorithms and Data Structures: deterministc","url":"https://xlinux.nist.gov/dads/HTML/deterministc.html"}],"status":"reported","summary":"NIST DADS defines deterministic as: Permitting at most one next move at any step in a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.deterministicalgorithm","kind":"method","label":"deterministic algorithm","sources":[{"id":"nist-dads.deterministicalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: deterministicAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/deterministicAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines deterministic algorithm as: An algorithm whose behavior can be completely predicted from the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.deutschjozsaalgo","kind":"method","label":"Deutsch-Jozsa algorithm","sources":[{"id":"nist-dads.deutschjozsaalgo","title":"NIST Dictionary of Algorithms and Data Structures: deutschJozsaAlgo","url":"https://xlinux.nist.gov/dads/HTML/deutschJozsaAlgo.html"}],"status":"reported","summary":"NIST DADS defines Deutsch-Jozsa algorithm as: A quantum algorithm to determine whether a function is constant or balanced, that is, returns 1 for half the domain and 0 for the other half. For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this exclusive or 's the result with the answer qubit. Finally, do Hadamards on the n inputs again, and measure the answer qubit. If it is 0, the function is constant, otherwise the function is balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diagonaliztn","kind":"concept","label":"diagonalization","sources":[{"id":"nist-dads.diagonaliztn","title":"NIST Dictionary of Algorithms and Data Structures: diagonaliztn","url":"https://xlinux.nist.gov/dads/HTML/diagonaliztn.html"}],"status":"reported","summary":"NIST DADS defines diagonalization as: A proof technique for showing that a given language does not belong to a given complexity class, used in many separation theorems .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diameter","kind":"concept","label":"diameter","sources":[{"id":"nist-dads.diameter","title":"NIST Dictionary of Algorithms and Data Structures: diameter","url":"https://xlinux.nist.gov/dads/HTML/diameter.html"}],"status":"reported","summary":"NIST DADS defines diameter as: The maximum of the distances between all possible pairs of vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dichotomicsearch","kind":"concept","label":"dichotomic search","sources":[{"id":"nist-dads.dichotomicsearch","title":"NIST Dictionary of Algorithms and Data Structures: dichotomicSearch","url":"https://xlinux.nist.gov/dads/HTML/dichotomicSearch.html"}],"status":"reported","summary":"NIST DADS defines dichotomic search as: Search by selecting between two distinct alternatives (dichotomies) at each step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dictionary","kind":"concept","label":"dictionary","sources":[{"id":"nist-dads.dictionary","title":"NIST Dictionary of Algorithms and Data Structures: dictionary","url":"https://xlinux.nist.gov/dads/HTML/dictionary.html"}],"status":"reported","summary":"NIST DADS defines dictionary as: An abstract data type storing items, or values. A value is accessed by an associated key . Basic operations are new, insert, find and delete. Formal Definition: The operations new(), insert(k, v, D), and find(k, D) may be defined with axiomatic semantics as follows. new() returns a dictionary find(k, insert(k, v, D)) = v find(k, insert(j, v, D)) = find(k, D) if k ≠ j where k and j are keys, v is a value, and D is a dictionary. The modifier function delete(k, D) may be defined as follows. delete(k, new()) = new() delete(k, insert(k, v, D)) = delete(k, D) delete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j If we want find to be a total function , we could define find(k, new()) using a special value: fail . This only changes the return type of find. find(k, new()) = fail Also known as association list, map, property list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.difference","kind":"concept","label":"difference","sources":[{"id":"nist-dads.difference","title":"NIST Dictionary of Algorithms and Data Structures: difference","url":"https://xlinux.nist.gov/dads/HTML/difference.html"}],"status":"reported","summary":"NIST DADS defines difference as: The difference of set A minus set B is a set having all the members which are in A, but not in B.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.digitalsearchtree","kind":"concept","label":"digital search tree","sources":[{"id":"nist-dads.digitalsearchtree","title":"NIST Dictionary of Algorithms and Data Structures: digitalSearchTree","url":"https://xlinux.nist.gov/dads/HTML/digitalSearchTree.html"}],"status":"reported","summary":"NIST DADS defines digital search tree as: A trie which stores the strings in internal nodes , so there is no need for extra leaf nodes to store the strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.digitaltree","kind":"concept","label":"digital tree","sources":[{"id":"nist-dads.digitaltree","title":"NIST Dictionary of Algorithms and Data Structures: digitaltree","url":"https://xlinux.nist.gov/dads/HTML/digitaltree.html"}],"status":"reported","summary":"NIST DADS defines digital tree as: A tree for storing strings in which nodes are organized by substrings common to two or more strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.diminishingincsort","kind":"method","label":"diminishing increment sort","sources":[{"id":"nist-dads.diminishingincsort","title":"NIST Dictionary of Algorithms and Data Structures: diminishingIncSort","url":"https://xlinux.nist.gov/dads/HTML/diminishingIncSort.html"}],"status":"reported","summary":"NIST DADS defines diminishing increment sort as: An in-place sort algorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items. Each set is every i th item, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc. On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diningphilos","kind":"concept","label":"dining philosophers","sources":[{"id":"nist-dads.diningphilos","title":"NIST Dictionary of Algorithms and Data Structures: diningphilos","url":"https://xlinux.nist.gov/dads/HTML/diningphilos.html"}],"status":"reported","summary":"NIST DADS defines dining philosophers as: Suppose a number of philosophers surround a dining table. Adjacent philosophers share one fork. They spend time thinking or trying to eat. A philosopher must have both the fork on the left and the fork on the right to eat. Clearly adjacent philosophers cannot eat at the same time. The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directchaining","kind":"concept","label":"direct chaining","sources":[{"id":"nist-dads.directchaining","title":"NIST Dictionary of Algorithms and Data Structures: directChaining","url":"https://xlinux.nist.gov/dads/HTML/directChaining.html"}],"status":"reported","summary":"NIST DADS defines direct chaining as: A collision resolution scheme in which the hash table is an array of links to lists . Each list holds all the items with the same hash value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directedacyclicwordgraph","kind":"concept","label":"directed acyclic word graph","sources":[{"id":"nist-dads.directedacyclicwordgraph","title":"NIST Dictionary of Algorithms and Data Structures: directedAcyclicWordGraph","url":"https://xlinux.nist.gov/dads/HTML/directedAcyclicWordGraph.html"}],"status":"reported","summary":"NIST DADS defines directed acyclic word graph as: (1) A directed acyclic graph representing the suffixes of a given string in which each edge is labeled with a character. The characters along a path from the root to a node are the substring which the node represents. (2) A finite state machine that recognizes a set of words. Also known as DAWG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.discretintrv","kind":"concept","label":"discrete interval encoding tree","sources":[{"id":"nist-dads.discretintrv","title":"NIST Dictionary of Algorithms and Data Structures: discretintrv","url":"https://xlinux.nist.gov/dads/HTML/discretintrv.html"}],"status":"reported","summary":"NIST DADS defines discrete interval encoding tree as: A binary search tree that stores consecutive values as intervals. Also known as diet.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.discretpcntr","kind":"concept","label":"discrete p-center","sources":[{"id":"nist-dads.discretpcntr","title":"NIST Dictionary of Algorithms and Data Structures: discretpcntr","url":"https://xlinux.nist.gov/dads/HTML/discretpcntr.html"}],"status":"reported","summary":"NIST DADS defines discrete p-center as: A facility location problem in which the supply points must be a subset of demand points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.disjointset","kind":"concept","label":"disjoint set","sources":[{"id":"nist-dads.disjointset","title":"NIST Dictionary of Algorithms and Data Structures: disjointset","url":"https://xlinux.nist.gov/dads/HTML/disjointset.html"}],"status":"reported","summary":"NIST DADS defines disjoint set as: A set whose members do not overlap, are not duplicated, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.disjunction","kind":"concept","label":"disjunction","sources":[{"id":"nist-dads.disjunction","title":"NIST Dictionary of Algorithms and Data Structures: disjunction","url":"https://xlinux.nist.gov/dads/HTML/disjunction.html"}],"status":"reported","summary":"NIST DADS defines disjunction as: The boolean or function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.distributionsort","kind":"method","label":"distribution sort","sources":[{"id":"nist-dads.distributionsort","title":"NIST Dictionary of Algorithms and Data Structures: distributionSort","url":"https://xlinux.nist.gov/dads/HTML/distributionSort.html"}],"status":"reported","summary":"NIST DADS defines distribution sort as: Any sort algorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.distributionalcomplex","kind":"concept","label":"distributional complexity","sources":[{"id":"nist-dads.distributionalcomplex","title":"NIST Dictionary of Algorithms and Data Structures: distributionalComplex","url":"https://xlinux.nist.gov/dads/HTML/distributionalComplex.html"}],"status":"reported","summary":"NIST DADS defines distributional complexity as: The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.distributivepartitioningsort","kind":"method","label":"distributive partitioning sort","sources":[{"id":"nist-dads.distributivepartitioningsort","title":"NIST Dictionary of Algorithms and Data Structures: distributivePartitioningSort","url":"https://xlinux.nist.gov/dads/HTML/distributivePartitioningSort.html"}],"status":"reported","summary":"NIST DADS defines distributive partitioning sort as: Step 1: find the median key . Step 2: distribute the n items into n/2 buckets linearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum. Step 3: compact the buckets, removing empty buckets. Recursively start again at step 1 for any bucket with multiple items. Linked lists are used to avoid moving items until a final phase and to avoid bucket overflows.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dividemarrig","kind":"method","label":"divide and marriage before conquest","sources":[{"id":"nist-dads.dividemarrig","title":"NIST Dictionary of Algorithms and Data Structures: dividemarrig","url":"https://xlinux.nist.gov/dads/HTML/dividemarrig.html"}],"status":"reported","summary":"NIST DADS defines divide and marriage before conquest as: A variant of divide and conquer in which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.domain","kind":"concept","label":"domain","sources":[{"id":"nist-dads.domain","title":"NIST Dictionary of Algorithms and Data Structures: domain","url":"https://xlinux.nist.gov/dads/HTML/domain.html"}],"status":"reported","summary":"NIST DADS defines domain as: (1) The inputs for which a function or relation is defined. For instance, 0 is not in the domain of reciprocal (1/x). (2) The possible values of a variable.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dontcare","kind":"concept","label":"don't care","sources":[{"id":"nist-dads.dontcare","title":"NIST Dictionary of Algorithms and Data Structures: dontcare","url":"https://xlinux.nist.gov/dads/HTML/dontcare.html"}],"status":"reported","summary":"NIST DADS defines don't care as: A special symbol which matches any other symbol of a given alphabet .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doomsday","kind":"method","label":"Doomsday rule","sources":[{"id":"nist-dads.doomsday","title":"NIST Dictionary of Algorithms and Data Structures: doomsday","url":"https://xlinux.nist.gov/dads/HTML/doomsday.html"}],"status":"reported","summary":"NIST DADS defines Doomsday rule as: An algorithm to find the day of the week for any date. It is simple enough to memorize and do mentally.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doublemetaphone","kind":"method","label":"double metaphone","sources":[{"id":"nist-dads.doublemetaphone","title":"NIST Dictionary of Algorithms and Data Structures: doubleMetaphone","url":"https://xlinux.nist.gov/dads/HTML/doubleMetaphone.html"}],"status":"reported","summary":"NIST DADS defines double metaphone as: An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds. It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.doubleendpq","kind":"concept","label":"double-ended priority queue","sources":[{"id":"nist-dads.doubleendpq","title":"NIST Dictionary of Algorithms and Data Structures: doubleendpq","url":"https://xlinux.nist.gov/dads/HTML/doubleendpq.html"}],"status":"reported","summary":"NIST DADS defines double-ended priority queue as: A priority queue which simultaneously keeps track of the maximum and minimum keys , and supports operations efficiently on either extreme (minimum or maximum).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dual","kind":"concept","label":"dual","sources":[{"id":"nist-dads.dual","title":"NIST Dictionary of Algorithms and Data Structures: dual","url":"https://xlinux.nist.gov/dads/HTML/dual.html"}],"status":"reported","summary":"NIST DADS defines dual as: The dual of a planar graph , G, is a graph with a vertex for each region in G and an edge between vertices for each pair of adjacent regions. The new edge crosses the edge in G which is the boundary between the adjacent regions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dualpivotquicksort","kind":"method","label":"dual-pivot quicksort","sources":[{"id":"nist-dads.dualpivotquicksort","title":"NIST Dictionary of Algorithms and Data Structures: dualPivotQuicksort","url":"https://xlinux.nist.gov/dads/HTML/dualPivotQuicksort.html"}],"status":"reported","summary":"NIST DADS defines dual-pivot quicksort as: Pick two elements from the array to be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamic","kind":"concept","label":"dynamic","sources":[{"id":"nist-dads.dynamic","title":"NIST Dictionary of Algorithms and Data Structures: dynamic","url":"https://xlinux.nist.gov/dads/HTML/dynamic.html"}],"status":"reported","summary":"NIST DADS defines dynamic as: When the problem domain may change, e.g., there may be insertions and deletions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamichashing","kind":"concept","label":"dynamic hashing","sources":[{"id":"nist-dads.dynamichashing","title":"NIST Dictionary of Algorithms and Data Structures: dynamicHashing","url":"https://xlinux.nist.gov/dads/HTML/dynamicHashing.html"}],"status":"reported","summary":"NIST DADS defines dynamic hashing as: A hash table that grows to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamicarray","kind":"concept","label":"dynamic array","sources":[{"id":"nist-dads.dynamicarray","title":"NIST Dictionary of Algorithms and Data Structures: dynamicarray","url":"https://xlinux.nist.gov/dads/HTML/dynamicarray.html"}],"status":"reported","summary":"NIST DADS defines dynamic array as: An array whose size may change over time. Items are not only added or removed, but memory used changes, too.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dynamization","kind":"method","label":"dynamization transformation","sources":[{"id":"nist-dads.dynamization","title":"NIST Dictionary of Algorithms and Data Structures: dynamization","url":"https://xlinux.nist.gov/dads/HTML/dynamization.html"}],"status":"reported","summary":"NIST DADS defines dynamization transformation as: A data structuring technique that can make a static data structure dynamic . In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.easysplithardmerge","kind":"method","label":"easy split, hard merge","sources":[{"id":"nist-dads.easysplithardmerge","title":"NIST Dictionary of Algorithms and Data Structures: easySplitHardMerge","url":"https://xlinux.nist.gov/dads/HTML/easySplitHardMerge.html"}],"status":"reported","summary":"NIST DADS defines easy split, hard merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgeconnectivity","kind":"concept","label":"edge connectivity","sources":[{"id":"nist-dads.edgeconnectivity","title":"NIST Dictionary of Algorithms and Data Structures: edgeConnectivity","url":"https://xlinux.nist.gov/dads/HTML/edgeConnectivity.html"}],"status":"reported","summary":"NIST DADS defines edge connectivity as: (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgecoloring","kind":"concept","label":"edge coloring","sources":[{"id":"nist-dads.edgecoloring","title":"NIST Dictionary of Algorithms and Data Structures: edgecoloring","url":"https://xlinux.nist.gov/dads/HTML/edgecoloring.html"}],"status":"reported","summary":"NIST DADS defines edge coloring as: An assignment of colors (or any distinct marks) to the edges of a graph . A coloring is a proper coloring if no two adjacent edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgecrossing","kind":"concept","label":"edge crossing","sources":[{"id":"nist-dads.edgecrossing","title":"NIST Dictionary of Algorithms and Data Structures: edgecrossing","url":"https://xlinux.nist.gov/dads/HTML/edgecrossing.html"}],"status":"reported","summary":"NIST DADS defines edge crossing as: Two different edges cross in a graph drawing if their geometric representations intersect. The number of crossings in a graph drawing is the number of pairs of edges which cross.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.editoperation","kind":"concept","label":"edit operation","sources":[{"id":"nist-dads.editoperation","title":"NIST Dictionary of Algorithms and Data Structures: editoperation","url":"https://xlinux.nist.gov/dads/HTML/editoperation.html"}],"status":"reported","summary":"NIST DADS defines edit operation as: On a string , the operation of deletion, insertion, or substitution performed on a single symbol. On a tree , the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a child , the insertion of a new node followed by the reassignment of some arcs departing from the parent of the new node, or the substitution of the label of one of the nodes with another label. Each edit operation may have an associated nonnegative real number representing its cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.editscript","kind":"concept","label":"edit script","sources":[{"id":"nist-dads.editscript","title":"NIST Dictionary of Algorithms and Data Structures: editscript","url":"https://xlinux.nist.gov/dads/HTML/editscript.html"}],"status":"reported","summary":"NIST DADS defines edit script as: A sequence of viable edit operations on a string or tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.efficiency","kind":"concept","label":"efficiency","sources":[{"id":"nist-dads.efficiency","title":"NIST Dictionary of Algorithms and Data Structures: efficiency","url":"https://xlinux.nist.gov/dads/HTML/efficiency.html"}],"status":"reported","summary":"NIST DADS defines efficiency as: The resources an algorithm used to find an answer. It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eightqueens","kind":"concept","label":"8 queens","sources":[{"id":"nist-dads.eightqueens","title":"NIST Dictionary of Algorithms and Data Structures: eightqueens","url":"https://xlinux.nist.gov/dads/HTML/eightqueens.html"}],"status":"reported","summary":"NIST DADS defines 8 queens as: Place eight chess queens on an 8 × 8 board such that no queen can attack another. Efficiently find all possible placements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.elasticbuckettrie","kind":"concept","label":"elastic-bucket trie","sources":[{"id":"nist-dads.elasticbuckettrie","title":"NIST Dictionary of Algorithms and Data Structures: elasticBucketTrie","url":"https://xlinux.nist.gov/dads/HTML/elasticBucketTrie.html"}],"status":"reported","summary":"NIST DADS defines elastic-bucket trie as: A variant of a bucket trie in which each leaf node for n strings is a bucket allocated to hold exactly n strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.elementnqnss","kind":"concept","label":"element uniqueness","sources":[{"id":"nist-dads.elementnqnss","title":"NIST Dictionary of Algorithms and Data Structures: elementnqnss","url":"https://xlinux.nist.gov/dads/HTML/elementnqnss.html"}],"status":"reported","summary":"NIST DADS defines element uniqueness as: The problem of determining if there are duplicates in a set of numbers.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.endofstring","kind":"concept","label":"end-of-string","sources":[{"id":"nist-dads.endofstring","title":"NIST Dictionary of Algorithms and Data Structures: endofstring","url":"https://xlinux.nist.gov/dads/HTML/endofstring.html"}],"status":"reported","summary":"NIST DADS defines end-of-string as: A special character indicating the end of a string .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euclidsteinertree","kind":"concept","label":"Euclidean Steiner tree","sources":[{"id":"nist-dads.euclidsteinertree","title":"NIST Dictionary of Algorithms and Data Structures: euclidSteinerTree","url":"https://xlinux.nist.gov/dads/HTML/euclidSteinerTree.html"}],"status":"reported","summary":"NIST DADS defines Euclidean Steiner tree as: A tree of minimum Euclidean distance connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euclidntrvls","kind":"concept","label":"Euclidean traveling salesman problem","sources":[{"id":"nist-dads.euclidntrvls","title":"NIST Dictionary of Algorithms and Data Structures: euclidntrvls","url":"https://xlinux.nist.gov/dads/HTML/euclidntrvls.html"}],"status":"reported","summary":"NIST DADS defines Euclidean traveling salesman problem as: Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eulercycle","kind":"concept","label":"Euler cycle","sources":[{"id":"nist-dads.eulercycle","title":"NIST Dictionary of Algorithms and Data Structures: eulercycle","url":"https://xlinux.nist.gov/dads/HTML/eulercycle.html"}],"status":"reported","summary":"NIST DADS defines Euler cycle as: A path through a graph which starts and ends at the same vertex and includes every edge exactly once. Also known as Eulerian path, Königsberg bridges problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euleriangrph","kind":"concept","label":"Eulerian graph","sources":[{"id":"nist-dads.euleriangrph","title":"NIST Dictionary of Algorithms and Data Structures: euleriangrph","url":"https://xlinux.nist.gov/dads/HTML/euleriangrph.html"}],"status":"reported","summary":"NIST DADS defines Eulerian graph as: A graph that has an Euler cycle .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.excell","kind":"concept","label":"EXCELL","sources":[{"id":"nist-dads.excell","title":"NIST Dictionary of Algorithms and Data Structures: excell","url":"https://xlinux.nist.gov/dads/HTML/excell.html"}],"status":"reported","summary":"NIST DADS defines EXCELL as: A point access method using a dynamic multidimensional array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.exclusivereadconwrt","kind":"concept","label":"exclusive read, concurrent write","sources":[{"id":"nist-dads.exclusivereadconwrt","title":"NIST Dictionary of Algorithms and Data Structures: exclusiveReadConWrt","url":"https://xlinux.nist.gov/dads/HTML/exclusiveReadConWrt.html"}],"status":"reported","summary":"NIST DADS defines exclusive read, concurrent write as: A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location. Also known as ERCW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.exclusivereadexcluwrt","kind":"concept","label":"exclusive read, exclusive write","sources":[{"id":"nist-dads.exclusivereadexcluwrt","title":"NIST Dictionary of Algorithms and Data Structures: exclusiveReadExcluWrt","url":"https://xlinux.nist.gov/dads/HTML/exclusiveReadExcluWrt.html"}],"status":"reported","summary":"NIST DADS defines exclusive read, exclusive write as: A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time. Also known as EREW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.existentlstt","kind":"concept","label":"existential state","sources":[{"id":"nist-dads.existentlstt","title":"NIST Dictionary of Algorithms and Data Structures: existentlstt","url":"https://xlinux.nist.gov/dads/HTML/existentlstt.html"}],"status":"reported","summary":"NIST DADS defines existential state as: A state in a nondeterministic Turing machine from which the machine accepts if any move leads to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.extendeuclid","kind":"method","label":"extended Euclid's algorithm","sources":[{"id":"nist-dads.extendeuclid","title":"NIST Dictionary of Algorithms and Data Structures: extendEuclid","url":"https://xlinux.nist.gov/dads/HTML/extendEuclid.html"}],"status":"reported","summary":"NIST DADS defines extended Euclid's algorithm as: An algorithm to find the greatest common divisor , g , of two positive integers, a and b , and coefficients, h and j , such that g = ha + jb .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendedbinarytree","kind":"concept","label":"extended binary tree","sources":[{"id":"nist-dads.extendedbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: extendedBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/extendedBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines extended binary tree as: A binary tree with special nodes replacing every null subtree. Every regular node has two children , and every special node has no children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendiblehashing","kind":"concept","label":"extendible hashing","sources":[{"id":"nist-dads.extendiblehashing","title":"NIST Dictionary of Algorithms and Data Structures: extendibleHashing","url":"https://xlinux.nist.gov/dads/HTML/extendibleHashing.html"}],"status":"reported","summary":"NIST DADS defines extendible hashing as: A hash table in which the hash function is the last few bits of the key and the table refers to buckets . Table entries with the same final bits may use the same bucket. If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size. If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendkdtree","kind":"concept","label":"extended k-d tree","sources":[{"id":"nist-dads.extendkdtree","title":"NIST Dictionary of Algorithms and Data Structures: extendkdtree","url":"https://xlinux.nist.gov/dads/HTML/extendkdtree.html"}],"status":"reported","summary":"NIST DADS defines extended k-d tree as: A spatial access method where successive levels are split along different dimensions into nonoverlapping cells. Objects are indexed in all cells they intersect.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalmemoryalgo","kind":"method","label":"external memory algorithm","sources":[{"id":"nist-dads.externalmemoryalgo","title":"NIST Dictionary of Algorithms and Data Structures: externalMemoryAlgo","url":"https://xlinux.nist.gov/dads/HTML/externalMemoryAlgo.html"}],"status":"reported","summary":"NIST DADS defines external memory algorithm as: An algorithm that is efficient when accessing most of the data is very slow, such as, on disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalmemorydatastr","kind":"concept","label":"external memory data structure","sources":[{"id":"nist-dads.externalmemorydatastr","title":"NIST Dictionary of Algorithms and Data Structures: externalMemoryDataStr","url":"https://xlinux.nist.gov/dads/HTML/externalMemoryDataStr.html"}],"status":"reported","summary":"NIST DADS defines external memory data structure as: A data structure that is efficient even when accessing most of the data is very slow, such as, on a disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalquicksort","kind":"method","label":"external quicksort","sources":[{"id":"nist-dads.externalquicksort","title":"NIST Dictionary of Algorithms and Data Structures: externalQuicksort","url":"https://xlinux.nist.gov/dads/HTML/externalQuicksort.html"}],"status":"reported","summary":"NIST DADS defines external quicksort as: Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in quicksort ), and sort them. Read the next element from the beginning or end to balance writing. If the next element is less than the least of the buffer, write it to available space at the beginning. If greater than the greatest, write it to the end. Otherwise write the greatest or least of the buffer, and put the next element in the buffer. Keep the maximum lower and minimum upper keys written to avoid resorting middle elements that are in order. When done, write the buffer. Recursively sort the smaller partition, and loop to sort the remaining partition.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalindx","kind":"concept","label":"external index","sources":[{"id":"nist-dads.externalindx","title":"NIST Dictionary of Algorithms and Data Structures: externalindx","url":"https://xlinux.nist.gov/dads/HTML/externalindx.html"}],"status":"reported","summary":"NIST DADS defines external index as: An auxiliary data structure added to a main data structure to improve operations, such as a search on a secondary key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalmerg","kind":"method","label":"external merge","sources":[{"id":"nist-dads.externalmerg","title":"NIST Dictionary of Algorithms and Data Structures: externalmerg","url":"https://xlinux.nist.gov/dads/HTML/externalmerg.html"}],"status":"reported","summary":"NIST DADS defines external merge as: To combine multiple sorted data streams into a single sorted stream using external storage.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extremal","kind":"concept","label":"extremal","sources":[{"id":"nist-dads.extremal","title":"NIST Dictionary of Algorithms and Data Structures: extremal","url":"https://xlinux.nist.gov/dads/HTML/extremal.html"}],"status":"reported","summary":"NIST DADS defines extremal as: Some of the entries of the auxiliary array used in a string matching algorithm. An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extremepoint","kind":"concept","label":"extreme point","sources":[{"id":"nist-dads.extremepoint","title":"NIST Dictionary of Algorithms and Data Structures: extremepoint","url":"https://xlinux.nist.gov/dads/HTML/extremepoint.html"}],"status":"reported","summary":"NIST DADS defines extreme point as: A corner point of a polyhedron . More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.facilityloc","kind":"concept","label":"facility location","sources":[{"id":"nist-dads.facilityloc","title":"NIST Dictionary of Algorithms and Data Structures: facilityloc","url":"https://xlinux.nist.gov/dads/HTML/facilityloc.html"}],"status":"reported","summary":"NIST DADS defines facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance objective function . The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fathoming","kind":"method","label":"fathoming","sources":[{"id":"nist-dads.fathoming","title":"NIST Dictionary of Algorithms and Data Structures: fathoming","url":"https://xlinux.nist.gov/dads/HTML/fathoming.html"}],"status":"reported","summary":"NIST DADS defines fathoming as: Pruning a search tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feasibleregn","kind":"concept","label":"feasible region","sources":[{"id":"nist-dads.feasibleregn","title":"NIST Dictionary of Algorithms and Data Structures: feasibleregn","url":"https://xlinux.nist.gov/dads/HTML/feasibleregn.html"}],"status":"reported","summary":"NIST DADS defines feasible region as: The set of all possible solutions of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feasiblesltn","kind":"concept","label":"feasible solution","sources":[{"id":"nist-dads.feasiblesltn","title":"NIST Dictionary of Algorithms and Data Structures: feasiblesltn","url":"https://xlinux.nist.gov/dads/HTML/feasiblesltn.html"}],"status":"reported","summary":"NIST DADS defines feasible solution as: Any element of the feasible region of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feedbackedgeset","kind":"concept","label":"feedback edge set","sources":[{"id":"nist-dads.feedbackedgeset","title":"NIST Dictionary of Algorithms and Data Structures: feedbackEdgeSet","url":"https://xlinux.nist.gov/dads/HTML/feedbackEdgeSet.html"}],"status":"reported","summary":"NIST DADS defines feedback edge set as: The smallest set of edges whose deletion results in an acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feedbackvertexset","kind":"concept","label":"feedback vertex set","sources":[{"id":"nist-dads.feedbackvertexset","title":"NIST Dictionary of Algorithms and Data Structures: feedbackVertexSet","url":"https://xlinux.nist.gov/dads/HTML/feedbackVertexSet.html"}],"status":"reported","summary":"NIST DADS defines feedback vertex set as: The smallest set of vertices whose deletion results in an acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fibonaccitree","kind":"concept","label":"Fibonacci tree","sources":[{"id":"nist-dads.fibonaccitree","title":"NIST Dictionary of Algorithms and Data Structures: fibonacciTree","url":"https://xlinux.nist.gov/dads/HTML/fibonacciTree.html"}],"status":"reported","summary":"NIST DADS defines Fibonacci tree as: A variant of a binary tree where a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2. An order 0 Fibonacci tree has no nodes , and an order 1 tree has 1 node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.find","kind":"method","label":"Find","sources":[{"id":"nist-dads.find","title":"NIST Dictionary of Algorithms and Data Structures: find","url":"https://xlinux.nist.gov/dads/HTML/find.html"}],"status":"reported","summary":"NIST DADS defines Find as: An algorithm to select the k th smallest element of an array and partition the array around it. First, partition around the value of the k th element. If the split is not at element k, move the upper or lower boundary and partition again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitarytree","kind":"concept","label":"finitary tree","sources":[{"id":"nist-dads.finitarytree","title":"NIST Dictionary of Algorithms and Data Structures: finitarytree","url":"https://xlinux.nist.gov/dads/HTML/finitarytree.html"}],"status":"reported","summary":"NIST DADS defines finitary tree as: A tree with a finite number of children at every node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.firstinfrstt","kind":"concept","label":"first-in, first-out","sources":[{"id":"nist-dads.firstinfrstt","title":"NIST Dictionary of Algorithms and Data Structures: firstinfrstt","url":"https://xlinux.nist.gov/dads/HTML/firstinfrstt.html"}],"status":"reported","summary":"NIST DADS defines first-in, first-out as: A policy that items are processed in order of arrival. A queue implements this.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fixedgrdmthd","kind":"concept","label":"fixed-grid method","sources":[{"id":"nist-dads.fixedgrdmthd","title":"NIST Dictionary of Algorithms and Data Structures: fixedgrdmthd","url":"https://xlinux.nist.gov/dads/HTML/fixedgrdmthd.html"}],"status":"reported","summary":"NIST DADS defines fixed-grid method as: Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flow","kind":"concept","label":"flow","sources":[{"id":"nist-dads.flow","title":"NIST Dictionary of Algorithms and Data Structures: flow","url":"https://xlinux.nist.gov/dads/HTML/flow.html"}],"status":"reported","summary":"NIST DADS defines flow as: A measure of the maximum weight along paths in a weighted, directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flowconsrvtn","kind":"concept","label":"flow conservation","sources":[{"id":"nist-dads.flowconsrvtn","title":"NIST Dictionary of Algorithms and Data Structures: flowconsrvtn","url":"https://xlinux.nist.gov/dads/HTML/flowconsrvtn.html"}],"status":"reported","summary":"NIST DADS defines flow conservation as: The property that no vertex , except the source and sink , of a flow network creates or stores flow. More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flowfunction","kind":"concept","label":"flow function","sources":[{"id":"nist-dads.flowfunction","title":"NIST Dictionary of Algorithms and Data Structures: flowfunction","url":"https://xlinux.nist.gov/dads/HTML/flowfunction.html"}],"status":"reported","summary":"NIST DADS defines flow function as: An assignment of flow values to the edges of a flow network that satisfies flow conservation , skew symmetry , and capacity constraints . Also known as network flow.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flownetwork","kind":"concept","label":"flow network","sources":[{"id":"nist-dads.flownetwork","title":"NIST Dictionary of Algorithms and Data Structures: flownetwork","url":"https://xlinux.nist.gov/dads/HTML/flownetwork.html"}],"status":"reported","summary":"NIST DADS defines flow network as: A weighted , directed graph with two specially marked nodes, the source s and the sink t, and a capacity function that maps edges to positive real numbers, u: E |→ ℜ + .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.floydwarshall","kind":"method","label":"Floyd-Warshall algorithm","sources":[{"id":"nist-dads.floydwarshall","title":"NIST Dictionary of Algorithms and Data Structures: floydWarshall","url":"https://xlinux.nist.gov/dads/HTML/floydWarshall.html"}],"status":"reported","summary":"NIST DADS defines Floyd-Warshall algorithm as: An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles . The time complexity is Θ (V³) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fordfulkerson","kind":"method","label":"Ford-Fulkerson method","sources":[{"id":"nist-dads.fordfulkerson","title":"NIST Dictionary of Algorithms and Data Structures: fordFulkerson","url":"https://xlinux.nist.gov/dads/HTML/fordFulkerson.html"}],"status":"reported","summary":"NIST DADS defines Ford-Fulkerson method as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a path from the source to the sink along which the flow can be increased and increase the flow. Repeat until there are no such paths.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forest","kind":"concept","label":"forest","sources":[{"id":"nist-dads.forest","title":"NIST Dictionary of Algorithms and Data Structures: forest","url":"https://xlinux.nist.gov/dads/HTML/forest.html"}],"status":"reported","summary":"NIST DADS defines forest as: A collection of one or more trees . Formal Definition: An undirected , acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forestedit","kind":"concept","label":"forest editing problem","sources":[{"id":"nist-dads.forestedit","title":"NIST Dictionary of Algorithms and Data Structures: forestedit","url":"https://xlinux.nist.gov/dads/HTML/forestedit.html"}],"status":"reported","summary":"NIST DADS defines forest editing problem as: The problem of finding an edit script of minimum cost which transforms a given forest into another given forest.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.formalmethod","kind":"concept","label":"formal methods","sources":[{"id":"nist-dads.formalmethod","title":"NIST Dictionary of Algorithms and Data Structures: formalmethod","url":"https://xlinux.nist.gov/dads/HTML/formalmethod.html"}],"status":"reported","summary":"NIST DADS defines formal methods as: A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.formalverf","kind":"concept","label":"formal verification","sources":[{"id":"nist-dads.formalverf","title":"NIST Dictionary of Algorithms and Data Structures: formalverf","url":"https://xlinux.nist.gov/dads/HTML/formalverf.html"}],"status":"reported","summary":"NIST DADS defines formal verification as: Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments. This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forwardindex","kind":"concept","label":"forward index","sources":[{"id":"nist-dads.forwardindex","title":"NIST Dictionary of Algorithms and Data Structures: forwardIndex","url":"https://xlinux.nist.gov/dads/HTML/forwardIndex.html"}],"status":"reported","summary":"NIST DADS defines forward index as: An index into a set of texts . This is usually created as the first step to making an inverted index .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fractional","kind":"concept","label":"fractional solution","sources":[{"id":"nist-dads.fractional","title":"NIST Dictionary of Algorithms and Data Structures: fractional","url":"https://xlinux.nist.gov/dads/HTML/fractional.html"}],"status":"reported","summary":"NIST DADS defines fractional solution as: Typically, a solution to a relaxation of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fractionalknapsack","kind":"concept","label":"fractional knapsack problem","sources":[{"id":"nist-dads.fractionalknapsack","title":"NIST Dictionary of Algorithms and Data Structures: fractionalKnapsack","url":"https://xlinux.nist.gov/dads/HTML/fractionalKnapsack.html"}],"status":"reported","summary":"NIST DADS defines fractional knapsack problem as: Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of materials, a greedy algorithm finds the optimum. Take as much as possible of the material that is most valuable per unit volume. If there is still room, take as much as possible of the next most valuable material. Continue until the knapsack is full. Also known as continuous knapsack problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freeedge","kind":"concept","label":"free edge","sources":[{"id":"nist-dads.freeedge","title":"NIST Dictionary of Algorithms and Data Structures: freeedge","url":"https://xlinux.nist.gov/dads/HTML/freeedge.html"}],"status":"reported","summary":"NIST DADS defines free edge as: An edge which is not in a matching .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freetree","kind":"concept","label":"free tree","sources":[{"id":"nist-dads.freetree","title":"NIST Dictionary of Algorithms and Data Structures: freetree","url":"https://xlinux.nist.gov/dads/HTML/freetree.html"}],"status":"reported","summary":"NIST DADS defines free tree as: A connected , acyclic , undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freevertex","kind":"concept","label":"free vertex","sources":[{"id":"nist-dads.freevertex","title":"NIST Dictionary of Algorithms and Data Structures: freevertex","url":"https://xlinux.nist.gov/dads/HTML/freevertex.html"}],"status":"reported","summary":"NIST DADS defines free vertex as: A vertex not on a matched edge in a matching , or, one which has not been matched.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.frequencycounthueristic","kind":"method","label":"frequency count heuristic","sources":[{"id":"nist-dads.frequencycounthueristic","title":"NIST Dictionary of Algorithms and Data Structures: frequencyCountHueristic","url":"https://xlinux.nist.gov/dads/HTML/frequencyCountHueristic.html"}],"status":"reported","summary":"NIST DADS defines frequency count heuristic as: A heuristic that keeps the elements of a list ordered by number of times each element is the target of a search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullbinarytree","kind":"concept","label":"full binary tree","sources":[{"id":"nist-dads.fullbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: fullBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/fullBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines full binary tree as: A binary tree in which each node has exactly zero or two children . Also known as proper binary tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullinvertedindex","kind":"concept","label":"full inverted index","sources":[{"id":"nist-dads.fullinvertedindex","title":"NIST Dictionary of Algorithms and Data Structures: fullInvertedIndex","url":"https://xlinux.nist.gov/dads/HTML/fullInvertedIndex.html"}],"status":"reported","summary":"NIST DADS defines full inverted index as: An inverted index that includes the exact location within texts, in addition to the text in which the word appears.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullypersistdata","kind":"concept","label":"fully persistent data structure","sources":[{"id":"nist-dads.fullypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: fullyPersistData","url":"https://xlinux.nist.gov/dads/HTML/fullyPersistData.html"}],"status":"reported","summary":"NIST DADS defines fully persistent data structure as: A persistent data structure that allows updates to all versions, previous and latest.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullydynamic","kind":"concept","label":"fully dynamic graph problem","sources":[{"id":"nist-dads.fullydynamic","title":"NIST Dictionary of Algorithms and Data Structures: fullydynamic","url":"https://xlinux.nist.gov/dads/HTML/fullydynamic.html"}],"status":"reported","summary":"NIST DADS defines fully dynamic graph problem as: Problem where the update operations include unrestricted insertions and deletions of edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fullypolynml","kind":"method","label":"fully polynomial approximation scheme","sources":[{"id":"nist-dads.fullypolynml","title":"NIST Dictionary of Algorithms and Data Structures: fullypolynml","url":"https://xlinux.nist.gov/dads/HTML/fullypolynml.html"}],"status":"reported","summary":"NIST DADS defines fully polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a 1+ε- approximation algorithm bounded by a polynomial in the length of the input and 1/ε.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.function","kind":"concept","label":"function","sources":[{"id":"nist-dads.function","title":"NIST Dictionary of Algorithms and Data Structures: function","url":"https://xlinux.nist.gov/dads/HTML/function.html"}],"status":"reported","summary":"NIST DADS defines function as: (1) A computation which takes some arguments or inputs and yields an output. Any particular input yields the same output every time. More formally, a mapping from each element in the domain to an element in the range . (2) A subroutine which returns a value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.gbdtree","kind":"concept","label":"GBD-tree","sources":[{"id":"nist-dads.gbdtree","title":"NIST Dictionary of Algorithms and Data Structures: gbdtree","url":"https://xlinux.nist.gov/dads/HTML/gbdtree.html"}],"status":"reported","summary":"NIST DADS defines GBD-tree as: A generalized BD-tree , hence the name, which stores spatially extended objects as a hierarchy of minimum bounding boxes . It is a balanced multiway tree which serves as a spatial access method .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.geometricopt","kind":"concept","label":"geometric optimization problem","sources":[{"id":"nist-dads.geometricopt","title":"NIST Dictionary of Algorithms and Data Structures: geometricopt","url":"https://xlinux.nist.gov/dads/HTML/geometricopt.html"}],"status":"reported","summary":"NIST DADS defines geometric optimization problem as: An optimization problem induced by a collection of geometric objects.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.globaloptimum","kind":"concept","label":"global optimum","sources":[{"id":"nist-dads.globaloptimum","title":"NIST Dictionary of Algorithms and Data Structures: globalOptimum","url":"https://xlinux.nist.gov/dads/HTML/globalOptimum.html"}],"status":"reported","summary":"NIST DADS defines global optimum as: The best possible solution to a problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphpartition","kind":"concept","label":"graph partition","sources":[{"id":"nist-dads.graphpartition","title":"NIST Dictionary of Algorithms and Data Structures: graphPartition","url":"https://xlinux.nist.gov/dads/HTML/graphPartition.html"}],"status":"reported","summary":"NIST DADS defines graph partition as: Partition the vertices while keeping the cost of spanning edges low.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphconcen","kind":"concept","label":"graph concentration","sources":[{"id":"nist-dads.graphconcen","title":"NIST Dictionary of Algorithms and Data Structures: graphconcen","url":"https://xlinux.nist.gov/dads/HTML/graphconcen.html"}],"status":"reported","summary":"NIST DADS defines graph concentration as: Contracting a graph by removing a subset of the vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphdrawing","kind":"concept","label":"graph drawing","sources":[{"id":"nist-dads.graphdrawing","title":"NIST Dictionary of Algorithms and Data Structures: graphdrawing","url":"https://xlinux.nist.gov/dads/HTML/graphdrawing.html"}],"status":"reported","summary":"NIST DADS defines graph drawing as: The problem of representing a graph in a plane \"neatly,\" for instance with a minimum number of edge crossings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphisomrph","kind":"concept","label":"graph isomorphism","sources":[{"id":"nist-dads.graphisomrph","title":"NIST Dictionary of Algorithms and Data Structures: graphisomrph","url":"https://xlinux.nist.gov/dads/HTML/graphisomrph.html"}],"status":"reported","summary":"NIST DADS defines graph isomorphism as: Determine if two graphs are isomorphic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greatestcommondivisor","kind":"method","label":"greatest common divisor","sources":[{"id":"nist-dads.greatestcommondivisor","title":"NIST Dictionary of Algorithms and Data Structures: greatestCommonDivisor","url":"https://xlinux.nist.gov/dads/HTML/greatestCommonDivisor.html"}],"status":"reported","summary":"NIST DADS defines greatest common divisor as: (1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same. Also known as GCD, highest common factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greedyheuristic","kind":"method","label":"greedy heuristic","sources":[{"id":"nist-dads.greedyheuristic","title":"NIST Dictionary of Algorithms and Data Structures: greedyHeuristic","url":"https://xlinux.nist.gov/dads/HTML/greedyHeuristic.html"}],"status":"reported","summary":"NIST DADS defines greedy heuristic as: Solve an optimization problem by finding locally optimal solutions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.griddrawing","kind":"concept","label":"grid drawing","sources":[{"id":"nist-dads.griddrawing","title":"NIST Dictionary of Algorithms and Data Structures: griddrawing","url":"https://xlinux.nist.gov/dads/HTML/griddrawing.html"}],"status":"reported","summary":"NIST DADS defines grid drawing as: A graph drawing in which each vertex is represented by a point with integer coordinates.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.gridfile","kind":"concept","label":"grid file","sources":[{"id":"nist-dads.gridfile","title":"NIST Dictionary of Algorithms and Data Structures: gridfile","url":"https://xlinux.nist.gov/dads/HTML/gridfile.html"}],"status":"reported","summary":"NIST DADS defines grid file as: A point access method which splits space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Small sets of points are referred to by one or more cells of the grid.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.haltingproblem","kind":"concept","label":"halting problem","sources":[{"id":"nist-dads.haltingproblem","title":"NIST Dictionary of Algorithms and Data Structures: haltingProblem","url":"https://xlinux.nist.gov/dads/HTML/haltingProblem.html"}],"status":"reported","summary":"NIST DADS defines halting problem as: Is there an algorithm to determine whether any arbitrary program halts? Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although heuristic or partial solutions are possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hamiltoniancycle","kind":"concept","label":"Hamiltonian cycle","sources":[{"id":"nist-dads.hamiltoniancycle","title":"NIST Dictionary of Algorithms and Data Structures: hamiltonianCycle","url":"https://xlinux.nist.gov/dads/HTML/hamiltonianCycle.html"}],"status":"reported","summary":"NIST DADS defines Hamiltonian cycle as: A path through a graph that starts and ends at the same vertex and includes every other vertex exactly once. Also known as tour.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hamiltonianpath","kind":"concept","label":"Hamiltonian path","sources":[{"id":"nist-dads.hamiltonianpath","title":"NIST Dictionary of Algorithms and Data Structures: hamiltonianPath","url":"https://xlinux.nist.gov/dads/HTML/hamiltonianPath.html"}],"status":"reported","summary":"NIST DADS defines Hamiltonian path as: A simple path through a graph that includes every vertex in the graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hardspliteasymerge","kind":"method","label":"hard split, easy merge","sources":[{"id":"nist-dads.hardspliteasymerge","title":"NIST Dictionary of Algorithms and Data Structures: hardSplitEasyMerge","url":"https://xlinux.nist.gov/dads/HTML/hardSplitEasyMerge.html"}],"status":"reported","summary":"NIST DADS defines hard split, easy merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashbelt","kind":"concept","label":"hashbelt","sources":[{"id":"nist-dads.hashbelt","title":"NIST Dictionary of Algorithms and Data Structures: hashbelt","url":"https://xlinux.nist.gov/dads/HTML/hashbelt.html"}],"status":"reported","summary":"NIST DADS defines hashbelt as: Use a short list or array of hash tables to implement a hash table with aging to expire items. To expire items, add a new table at the head of the list and drop the oldest table, along with its contents. To find an item, search all the tables.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashheap","kind":"concept","label":"hash heap","sources":[{"id":"nist-dads.hashheap","title":"NIST Dictionary of Algorithms and Data Structures: hashheap","url":"https://xlinux.nist.gov/dads/HTML/hashheap.html"}],"status":"reported","summary":"NIST DADS defines hash heap as: An efficient implementation of a priority queue . The linear hash function monotonically maps keys to buckets , and each bucket is a heap .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hashtabdelet","kind":"method","label":"hash table delete","sources":[{"id":"nist-dads.hashtabdelet","title":"NIST Dictionary of Algorithms and Data Structures: hashtabdelet","url":"https://xlinux.nist.gov/dads/HTML/hashtabdelet.html"}],"status":"reported","summary":"NIST DADS defines hash table delete as: If the hash table uses chaining , use the chaining data structure delete. If it uses open addressing , mark the item \"deleted\" for future reuse.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hausdorffdst","kind":"concept","label":"Hausdorff distance","sources":[{"id":"nist-dads.hausdorffdst","title":"NIST Dictionary of Algorithms and Data Structures: hausdorffdst","url":"https://xlinux.nist.gov/dads/HTML/hausdorffdst.html"}],"status":"reported","summary":"NIST DADS defines Hausdorff distance as: A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max a∈ P min b∈ Q d(a,b), max a∈ Q min b∈ P d(a,b)} where d(·,·) is the distance metric, usually the Euclidean distance .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hbtree","kind":"concept","label":"hB-tree","sources":[{"id":"nist-dads.hbtree","title":"NIST Dictionary of Algorithms and Data Structures: hbtree","url":"https://xlinux.nist.gov/dads/HTML/hbtree.html"}],"status":"reported","summary":"NIST DADS defines hB-tree as: A point access method which uses k-d trees to organize the space, but partitions as excluded intervals, like the BANG file . Searching is like in a k-d-B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.head","kind":"concept","label":"head","sources":[{"id":"nist-dads.head","title":"NIST Dictionary of Algorithms and Data Structures: head","url":"https://xlinux.nist.gov/dads/HTML/head.html"}],"status":"reported","summary":"NIST DADS defines head as: The first item of a list .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heapify","kind":"method","label":"heapify","sources":[{"id":"nist-dads.heapify","title":"NIST Dictionary of Algorithms and Data Structures: heapify","url":"https://xlinux.nist.gov/dads/HTML/heapify.html"}],"status":"reported","summary":"NIST DADS defines heapify as: Rearrange a heap to maintain the heap property , that is, the key of the root node is more extreme (greater or less) than or equal to the keys of its children . If the root node's key is not more extreme, swap it with the most extreme child key, then recursively heapify that child's subtree. The child subtrees must be heaps to start.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heapproperty","kind":"concept","label":"heap property","sources":[{"id":"nist-dads.heapproperty","title":"NIST Dictionary of Algorithms and Data Structures: heapproperty","url":"https://xlinux.nist.gov/dads/HTML/heapproperty.html"}],"status":"reported","summary":"NIST DADS defines heap property as: Each node in a tree has a key which is more extreme (greater or less) than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.height","kind":"concept","label":"height","sources":[{"id":"nist-dads.height","title":"NIST Dictionary of Algorithms and Data Structures: height","url":"https://xlinux.nist.gov/dads/HTML/height.html"}],"status":"reported","summary":"NIST DADS defines height as: The maximum distance of any node from the root . If a tree has only one node (the root), the height is zero. The height of an empty tree is not defined.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heightbalancedbinsrchtree","kind":"concept","label":"height-balanced binary search tree","sources":[{"id":"nist-dads.heightbalancedbinsrchtree","title":"NIST Dictionary of Algorithms and Data Structures: heightBalancedBinSrchTree","url":"https://xlinux.nist.gov/dads/HTML/heightBalancedBinSrchTree.html"}],"status":"reported","summary":"NIST DADS defines height-balanced binary search tree as: A height-balanced tree which is also a binary search tree . It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heightbalancedtree","kind":"concept","label":"height-balanced tree","sources":[{"id":"nist-dads.heightbalancedtree","title":"NIST Dictionary of Algorithms and Data Structures: heightBalancedTree","url":"https://xlinux.nist.gov/dads/HTML/heightBalancedTree.html"}],"status":"reported","summary":"NIST DADS defines height-balanced tree as: A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heuristic","kind":"method","label":"heuristic","sources":[{"id":"nist-dads.heuristic","title":"NIST Dictionary of Algorithms and Data Structures: heuristic","url":"https://xlinux.nist.gov/dads/HTML/heuristic.html"}],"status":"reported","summary":"NIST DADS defines heuristic as: An algorithm that usually, but not always, works or that gives nearly the right answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.histogramsort","kind":"method","label":"histogram sort","sources":[{"id":"nist-dads.histogramsort","title":"NIST Dictionary of Algorithms and Data Structures: histogramSort","url":"https://xlinux.nist.gov/dads/HTML/histogramSort.html"}],"status":"reported","summary":"NIST DADS defines histogram sort as: An efficient 3-pass refinement of a bucket sort algorithm. The first pass counts the number of items for each bucket in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding items. The second pass puts each item in its proper bucket according to the auxiliary entry for the key of that item. The last pass sorts each bucket. Also known as interpolation sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.homeomorphic","kind":"concept","label":"homeomorphic","sources":[{"id":"nist-dads.homeomorphic","title":"NIST Dictionary of Algorithms and Data Structures: homeomorphic","url":"https://xlinux.nist.gov/dads/HTML/homeomorphic.html"}],"status":"reported","summary":"NIST DADS defines homeomorphic as: Two graphs are homeomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.horizontalvismap","kind":"concept","label":"horizontal visibility map","sources":[{"id":"nist-dads.horizontalvismap","title":"NIST Dictionary of Algorithms and Data Structures: horizontalVisMap","url":"https://xlinux.nist.gov/dads/HTML/horizontalVisMap.html"}],"status":"reported","summary":"NIST DADS defines horizontal visibility map as: A partition of the plane into regions by drawing a horizontal straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be horizontally visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hsadelta","kind":"method","label":"hsadelta","sources":[{"id":"nist-dads.hsadelta","title":"NIST Dictionary of Algorithms and Data Structures: hsadelta","url":"https://xlinux.nist.gov/dads/HTML/hsadelta.html"}],"status":"reported","summary":"NIST DADS defines hsadelta as: An algorithm to produce a sequence of insert and copy commands (an edit script ) which creates a new version file from a reference file. To begin, hash every block of the reference file and store every hash in a hash value array . Build a suffix array and three other data structures for quick access. Beginning at the first location in the version file, hash a block and look for the longest match in the reference file. Upon a match, encode an insert back to the previous match and a copy of the match. If no match, look at the next location. At the end, encode an insert for remaining unmatched characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hybridalgorithm","kind":"concept","label":"hybrid algorithm","sources":[{"id":"nist-dads.hybridalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: hybridAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/hybridAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines hybrid algorithm as: Any algorithm composed of simpler algorithms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hyperedge","kind":"concept","label":"hyperedge","sources":[{"id":"nist-dads.hyperedge","title":"NIST Dictionary of Algorithms and Data Structures: hyperedge","url":"https://xlinux.nist.gov/dads/HTML/hyperedge.html"}],"status":"reported","summary":"NIST DADS defines hyperedge as: A connection between any number of vertices of a hypergraph . Formal Definition: A hyperedge is a set of vertices of a hypergraph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.idealrandomshuffle","kind":"method","label":"ideal random shuffle","sources":[{"id":"nist-dads.idealrandomshuffle","title":"NIST Dictionary of Algorithms and Data Structures: idealRandomShuffle","url":"https://xlinux.nist.gov/dads/HTML/idealRandomShuffle.html"}],"status":"reported","summary":"NIST DADS defines ideal random shuffle as: A permutation algorithm, or shuffle, that has exactly the same chance of producing any permutation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.idealmerge","kind":"method","label":"ideal merge","sources":[{"id":"nist-dads.idealmerge","title":"NIST Dictionary of Algorithms and Data Structures: idealmerge","url":"https://xlinux.nist.gov/dads/HTML/idealmerge.html"}],"status":"reported","summary":"NIST DADS defines ideal merge as: Merge n sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output. That stream is inserted back into the list of streams according to its new head. Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using linear search to insert a stream into the list, the execution time is Θ(M N) where M is the total number of elements. Keeping the streams in a heap , the execution time is Θ(M log N) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.implication","kind":"concept","label":"implication","sources":[{"id":"nist-dads.implication","title":"NIST Dictionary of Algorithms and Data Structures: implication","url":"https://xlinux.nist.gov/dads/HTML/implication.html"}],"status":"reported","summary":"NIST DADS defines implication as: The boolean implies function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.implies","kind":"concept","label":"implies","sources":[{"id":"nist-dads.implies","title":"NIST Dictionary of Algorithms and Data Structures: implies","url":"https://xlinux.nist.gov/dads/HTML/implies.html"}],"status":"reported","summary":"NIST DADS defines implies as: Implication: 0 → 0 = 1, 0 → 1 = 1, 1 → 0 = 0, 1 → 1 = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.incompressbl","kind":"concept","label":"incompressible string","sources":[{"id":"nist-dads.incompressbl","title":"NIST Dictionary of Algorithms and Data Structures: incompressbl","url":"https://xlinux.nist.gov/dads/HTML/incompressbl.html"}],"status":"reported","summary":"NIST DADS defines incompressible string as: A string whose Kolmogorov complexity equals its length, so that it has no shorter encodings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.indegree","kind":"concept","label":"in-degree","sources":[{"id":"nist-dads.indegree","title":"NIST Dictionary of Algorithms and Data Structures: indegree","url":"https://xlinux.nist.gov/dads/HTML/indegree.html"}],"status":"reported","summary":"NIST DADS defines in-degree as: The number of edges coming into a vertex in a directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.independentset","kind":"concept","label":"independent set","sources":[{"id":"nist-dads.independentset","title":"NIST Dictionary of Algorithms and Data Structures: independentSet","url":"https://xlinux.nist.gov/dads/HTML/independentSet.html"}],"status":"reported","summary":"NIST DADS defines independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.indexfile","kind":"concept","label":"index file","sources":[{"id":"nist-dads.indexfile","title":"NIST Dictionary of Algorithms and Data Structures: indexfile","url":"https://xlinux.nist.gov/dads/HTML/indexfile.html"}],"status":"reported","summary":"NIST DADS defines index file as: A file which stores keys and an index into another file. The index file may have additional structure, e.g., be a B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.information","kind":"concept","label":"information theoretic bound","sources":[{"id":"nist-dads.information","title":"NIST Dictionary of Algorithms and Data Structures: information","url":"https://xlinux.nist.gov/dads/HTML/information.html"}],"status":"reported","summary":"NIST DADS defines information theoretic bound as: lower bounds on the execution of a computation based on the rate at which information can be accumulated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.inordertraversal","kind":"method","label":"in-order traversal","sources":[{"id":"nist-dads.inordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: inorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/inorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines in-order traversal as: Process all nodes of a tree by recursively processing the left subtree, then processing the root , and finally the right subtree. Also known as symmetric traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integer","kind":"concept","label":"integer polyhedron","sources":[{"id":"nist-dads.integer","title":"NIST Dictionary of Algorithms and Data Structures: integer","url":"https://xlinux.nist.gov/dads/HTML/integer.html"}],"status":"reported","summary":"NIST DADS defines integer polyhedron as: A polyhedron , all of whose extreme points are integer valued.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integerliner","kind":"concept","label":"integer linear program","sources":[{"id":"nist-dads.integerliner","title":"NIST Dictionary of Algorithms and Data Structures: integerliner","url":"https://xlinux.nist.gov/dads/HTML/integerliner.html"}],"status":"reported","summary":"NIST DADS defines integer linear program as: A linear program with additional constraints that all of the variables must take on integer values. Solving such problems is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integermulti","kind":"concept","label":"integer multi-commodity flow","sources":[{"id":"nist-dads.integermulti","title":"NIST Dictionary of Algorithms and Data Structures: integermulti","url":"https://xlinux.nist.gov/dads/HTML/integermulti.html"}],"status":"reported","summary":"NIST DADS defines integer multi-commodity flow as: A multi-commodity flow in which the flow of each commodity through each edge must take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.interactvprf","kind":"concept","label":"interactive proof system","sources":[{"id":"nist-dads.interactvprf","title":"NIST Dictionary of Algorithms and Data Structures: interactvprf","url":"https://xlinux.nist.gov/dads/HTML/interactvprf.html"}],"status":"reported","summary":"NIST DADS defines interactive proof system as: A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a string x in a given language , often with the goal of revealing no further details about this knowledge. The prover(s) and verifier are formally defined as probabilistic Turing machines with special \"interaction tapes\" for exchanging messages.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.interiorbasd","kind":"concept","label":"interior-based representation","sources":[{"id":"nist-dads.interiorbasd","title":"NIST Dictionary of Algorithms and Data Structures: interiorbasd","url":"https://xlinux.nist.gov/dads/HTML/interiorbasd.html"}],"status":"reported","summary":"NIST DADS defines interior-based representation as: A representation of a region that is based on its interior (i.e., the cells that compose it).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.internalnode","kind":"concept","label":"internal node","sources":[{"id":"nist-dads.internalnode","title":"NIST Dictionary of Algorithms and Data Structures: internalnode","url":"https://xlinux.nist.gov/dads/HTML/internalnode.html"}],"status":"reported","summary":"NIST DADS defines internal node as: A node of a tree that has one or more child nodes, equivalently, one that is not a leaf . Also known as nonterminal node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.interpsequen","kind":"method","label":"interpolation-sequential search","sources":[{"id":"nist-dads.interpsequen","title":"NIST Dictionary of Algorithms and Data Structures: interpsequen","url":"https://xlinux.nist.gov/dads/HTML/interpsequen.html"}],"status":"reported","summary":"NIST DADS defines interpolation-sequential search as: An approximate location is interpolated from the first and last items of a sorted array , then a linear search finds the actual location.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.intersection","kind":"concept","label":"intersection","sources":[{"id":"nist-dads.intersection","title":"NIST Dictionary of Algorithms and Data Structures: intersection","url":"https://xlinux.nist.gov/dads/HTML/intersection.html"}],"status":"reported","summary":"NIST DADS defines intersection as: The intersection of two sets is a set having those members which are in both sets.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.intractable","kind":"concept","label":"intractable","sources":[{"id":"nist-dads.intractable","title":"NIST Dictionary of Algorithms and Data Structures: intractable","url":"https://xlinux.nist.gov/dads/HTML/intractable.html"}],"status":"reported","summary":"NIST DADS defines intractable as: A problem for which no algorithm can exist which computes all instances of it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.introspectivesort","kind":"method","label":"introspective sort","sources":[{"id":"nist-dads.introspectivesort","title":"NIST Dictionary of Algorithms and Data Structures: introspectiveSort","url":"https://xlinux.nist.gov/dads/HTML/introspectiveSort.html"}],"status":"reported","summary":"NIST DADS defines introspective sort as: A variant of quicksort which switches to heapsort for pathological inputs, that is, when execution time is becoming quadratic. Also known as introsort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.inversesuffixarray","kind":"concept","label":"inverse suffix array","sources":[{"id":"nist-dads.inversesuffixarray","title":"NIST Dictionary of Algorithms and Data Structures: inverseSuffixArray","url":"https://xlinux.nist.gov/dads/HTML/inverseSuffixArray.html"}],"status":"reported","summary":"NIST DADS defines inverse suffix array as: For each position in a string , the inverse suffix array has its index in the string's suffix array . Formal Definition: Given a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.inversionlist","kind":"concept","label":"inversion list","sources":[{"id":"nist-dads.inversionlist","title":"NIST Dictionary of Algorithms and Data Structures: inversionList","url":"https://xlinux.nist.gov/dads/HTML/inversionList.html"}],"status":"reported","summary":"NIST DADS defines inversion list as: A set of non-overlapping numeric ranges, stored in an array in increasing order. Items in odd indexes begin ranges, and items in even indexes are the first number after the ends. Use a form of binary search to determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set. If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertedfileindex","kind":"concept","label":"inverted file index","sources":[{"id":"nist-dads.invertedfileindex","title":"NIST Dictionary of Algorithms and Data Structures: invertedFileIndex","url":"https://xlinux.nist.gov/dads/HTML/invertedFileIndex.html"}],"status":"reported","summary":"NIST DADS defines inverted file index as: An inverted index that only indicates the text in which a word appears, not where the word appears within the text.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertedindex","kind":"concept","label":"inverted index","sources":[{"id":"nist-dads.invertedindex","title":"NIST Dictionary of Algorithms and Data Structures: invertedIndex","url":"https://xlinux.nist.gov/dads/HTML/invertedIndex.html"}],"status":"reported","summary":"NIST DADS defines inverted index as: An index into a set of texts of the words in the texts. The index is accessed by some search method. Each index entry gives the word and a list of texts, possibly with locations within the text, where the word occurs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertiblebloomtable","kind":"concept","label":"invertible Bloom lookup table","sources":[{"id":"nist-dads.invertiblebloomtable","title":"NIST Dictionary of Algorithms and Data Structures: invertibleBloomTable","url":"https://xlinux.nist.gov/dads/HTML/invertibleBloomTable.html"}],"status":"reported","summary":"NIST DADS defines invertible Bloom lookup table as: Algorithms and an array of cells to store key/value pairs. Each cell has a count of how many pairs are mapped to the cell, the sum of the keys mapped to it, and the sum of the values mapped to it. Using k hash functions , each pair is mapped to T[h 1 (k)], T[h 2 (k)], ..., T[h k (k)]. Also known as IBLT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.irreflexive","kind":"concept","label":"irreflexive","sources":[{"id":"nist-dads.irreflexive","title":"NIST Dictionary of Algorithms and Data Structures: irreflexive","url":"https://xlinux.nist.gov/dads/HTML/irreflexive.html"}],"status":"reported","summary":"NIST DADS defines irreflexive as: A binary relation R for which there is no element a such that a R a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.isomorphic","kind":"concept","label":"isomorphic","sources":[{"id":"nist-dads.isomorphic","title":"NIST Dictionary of Algorithms and Data Structures: isomorphic","url":"https://xlinux.nist.gov/dads/HTML/isomorphic.html"}],"status":"reported","summary":"NIST DADS defines isomorphic as: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.j_sort","kind":"method","label":"J sort","sources":[{"id":"nist-dads.j_sort","title":"NIST Dictionary of Algorithms and Data Structures: j_sort","url":"https://xlinux.nist.gov/dads/HTML/j_sort.html"}],"status":"reported","summary":"NIST DADS defines J sort as: An in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jarowinkler","kind":"method","label":"Jaro-Winkler","sources":[{"id":"nist-dads.jarowinkler","title":"NIST Dictionary of Algorithms and Data Structures: jaroWinkler","url":"https://xlinux.nist.gov/dads/HTML/jaroWinkler.html"}],"status":"reported","summary":"NIST DADS defines Jaro-Winkler as: A measure of similarity between two strings . The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters. Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.jellyfish","kind":"concept","label":"jelly-fish","sources":[{"id":"nist-dads.jellyfish","title":"NIST Dictionary of Algorithms and Data Structures: jellyfish","url":"https://xlinux.nist.gov/dads/HTML/jellyfish.html"}],"status":"reported","summary":"NIST DADS defines jelly-fish as: A theoretical data structure for n items. It starts with a balanced binary search tree of about √(n) nodes. The leaf nodes lead to \"tentacles\" or linked lists , each of about √(n) nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.johnsontrotter","kind":"method","label":"Johnson-Trotter","sources":[{"id":"nist-dads.johnsontrotter","title":"NIST Dictionary of Algorithms and Data Structures: johnsonTrotter","url":"https://xlinux.nist.gov/dads/HTML/johnsonTrotter.html"}],"status":"reported","summary":"NIST DADS defines Johnson-Trotter as: Generate permutations by swapping one adjacent pair of elements at a time. Also known as Steinhaus-Johnson-Trotter, Trotter-Johnson.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.johnsonsalgorithm","kind":"method","label":"Johnson's algorithm","sources":[{"id":"nist-dads.johnsonsalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: johnsonsAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/johnsonsAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Johnson's algorithm as: An algorithm to solve the all pairs shortest path problem in a sparse weighted, directed graph . First, it adds a new node with zero weight edges from it to all other nodes, and runs the Bellman-Ford algorithm to check for negative weight cycles and find h(v), the least weight of a path from the new node to node v. Next it reweights the edges using the nodes' h(v) values. Finally for each node, it runs Dijkstra's algorithm and stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is O(V²log V + VE) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.k2tree","kind":"concept","label":"k²-tree","sources":[{"id":"nist-dads.k2tree","title":"NIST Dictionary of Algorithms and Data Structures: k2tree","url":"https://xlinux.nist.gov/dads/HTML/k2tree.html"}],"status":"reported","summary":"NIST DADS defines k²-tree as: A compact representation of a sparse directed graph . It requires 1 to 3 bits per edge. Many access functions, like successor(s), predecessor(s), and range (all links from a range of vertices to another range of vertices), have very efficient implementations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karnaughmap","kind":"method","label":"Karnaugh map","sources":[{"id":"nist-dads.karnaughmap","title":"NIST Dictionary of Algorithms and Data Structures: karnaughmap","url":"https://xlinux.nist.gov/dads/HTML/karnaughmap.html"}],"status":"reported","summary":"NIST DADS defines Karnaugh map as: A method for minimizing a boolean expression , usually aided by a rectangular map of the value of the expression for all possible input values. Input values are arranged in a Gray code . Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation. Also known as Veitch diagram, KV diagram.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karprabin","kind":"method","label":"Karp-Rabin","sources":[{"id":"nist-dads.karprabin","title":"NIST Dictionary of Algorithms and Data Structures: karpRabin","url":"https://xlinux.nist.gov/dads/HTML/karpRabin.html"}],"status":"reported","summary":"NIST DADS defines Karp-Rabin as: A string matching algorithm that compares string's hash values, rather than the strings themselves. For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position. Also known as Rabin-Karp.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karpreductin","kind":"concept","label":"Karp reduction","sources":[{"id":"nist-dads.karpreductin","title":"NIST Dictionary of Algorithms and Data Structures: karpreductin","url":"https://xlinux.nist.gov/dads/HTML/karpreductin.html"}],"status":"reported","summary":"NIST DADS defines Karp reduction as: A reduction given by a polynomial time computable transformation function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karyhuffman","kind":"method","label":"k-ary Huffman coding","sources":[{"id":"nist-dads.karyhuffman","title":"NIST Dictionary of Algorithms and Data Structures: karyHuffman","url":"https://xlinux.nist.gov/dads/HTML/karyHuffman.html"}],"status":"reported","summary":"NIST DADS defines k-ary Huffman coding as: A minimal variable-length coding based on the frequency of each character. Similar to a Huffman coding , but joins k trees into a k-ary tree at each step, and uses k symbols for each level.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karytree","kind":"concept","label":"k-ary tree","sources":[{"id":"nist-dads.karytree","title":"NIST Dictionary of Algorithms and Data Structures: karyTree","url":"https://xlinux.nist.gov/dads/HTML/karyTree.html"}],"status":"reported","summary":"NIST DADS defines k-ary tree as: A tree with no more than k children for each node . Also known as k-way tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karyheap","kind":"concept","label":"k-ary heap","sources":[{"id":"nist-dads.karyheap","title":"NIST Dictionary of Algorithms and Data Structures: karyheap","url":"https://xlinux.nist.gov/dads/HTML/karyheap.html"}],"status":"reported","summary":"NIST DADS defines k-ary heap as: A complete tree where every node has a key more extreme (greater or less) than the key of its parent . Each node has k or fewer children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kcoloring","kind":"concept","label":"k-coloring","sources":[{"id":"nist-dads.kcoloring","title":"NIST Dictionary of Algorithms and Data Structures: kcoloring","url":"https://xlinux.nist.gov/dads/HTML/kcoloring.html"}],"status":"reported","summary":"NIST DADS defines k-coloring as: 1) The assignment of k colors (or any distinct marks) to the vertices of a graph . 2) The assignment of k colors to the edges of a graph . A coloring is a proper coloring if no two adjacent vertices or edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kconnectedgraph","kind":"concept","label":"k-connected graph","sources":[{"id":"nist-dads.kconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: kconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/kconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines k-connected graph as: A connected graph such that deleting any k-1 vertices (and incident edges ) results in a graph that is still connected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdbtree","kind":"concept","label":"k-d-B-tree","sources":[{"id":"nist-dads.kdbtree","title":"NIST Dictionary of Algorithms and Data Structures: kdbtree","url":"https://xlinux.nist.gov/dads/HTML/kdbtree.html"}],"status":"reported","summary":"NIST DADS defines k-d-B-tree as: A data structure which splits multidimensional spaces like an adaptive k-d tree , but balances the resulting tree like a B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdimensional","kind":"concept","label":"k-dimensional","sources":[{"id":"nist-dads.kdimensional","title":"NIST Dictionary of Algorithms and Data Structures: kdimensional","url":"https://xlinux.nist.gov/dads/HTML/kdimensional.html"}],"status":"reported","summary":"NIST DADS defines k-dimensional as: (1) Dealing with or restricted to a space where location can be completely described with exactly k orthogonal axes. (2) Dealing with a space of any number of dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdominant","kind":"concept","label":"K-dominant match","sources":[{"id":"nist-dads.kdominant","title":"NIST Dictionary of Algorithms and Data Structures: kdominant","url":"https://xlinux.nist.gov/dads/HTML/kdominant.html"}],"status":"reported","summary":"NIST DADS defines K-dominant match as: A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdtree","kind":"concept","label":"k-d tree","sources":[{"id":"nist-dads.kdtree","title":"NIST Dictionary of Algorithms and Data Structures: kdtree","url":"https://xlinux.nist.gov/dads/HTML/kdtree.html"}],"status":"reported","summary":"NIST DADS defines k-d tree as: A multidimensional search tree for points in k dimensional space. Levels of the tree are split along successive dimensions at the points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.key","kind":"concept","label":"key","sources":[{"id":"nist-dads.key","title":"NIST Dictionary of Algorithms and Data Structures: key","url":"https://xlinux.nist.gov/dads/HTML/key.html"}],"status":"reported","summary":"NIST DADS defines key as: The part of a group of data by which it is sorted, indexed, cross referenced, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.knightstour","kind":"concept","label":"knight's tour","sources":[{"id":"nist-dads.knightstour","title":"NIST Dictionary of Algorithms and Data Structures: knightstour","url":"https://xlinux.nist.gov/dads/HTML/knightstour.html"}],"status":"reported","summary":"NIST DADS defines knight's tour as: A series of moves of a chess knight that visits all squares on the board exactly once.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.knuthmorrispratt","kind":"method","label":"Knuth-Morris-Pratt algorithm","sources":[{"id":"nist-dads.knuthmorrispratt","title":"NIST Dictionary of Algorithms and Data Structures: knuthMorrisPratt","url":"https://xlinux.nist.gov/dads/HTML/knuthMorrisPratt.html"}],"status":"reported","summary":"NIST DADS defines Knuth-Morris-Pratt algorithm as: A string matching algorithm that turns the search string into a finite state machine , then runs the machine with the string to be searched as the input string. Execution time is O(m+n) , where m is the length of the search string, and n is the length of the string to be searched. Also known as KMP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kolmogorov","kind":"concept","label":"Kolmogorov complexity","sources":[{"id":"nist-dads.kolmogorov","title":"NIST Dictionary of Algorithms and Data Structures: kolmogorov","url":"https://xlinux.nist.gov/dads/HTML/kolmogorov.html"}],"status":"reported","summary":"NIST DADS defines Kolmogorov complexity as: The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kripkestruct","kind":"concept","label":"Kripke structure","sources":[{"id":"nist-dads.kripkestruct","title":"NIST Dictionary of Algorithms and Data Structures: kripkeStruct","url":"https://xlinux.nist.gov/dads/HTML/kripkeStruct.html"}],"status":"reported","summary":"NIST DADS defines Kripke structure as: A nondeterministic finite state machine whose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.kwaymergesort","kind":"method","label":"k-way merge sort","sources":[{"id":"nist-dads.kwaymergesort","title":"NIST Dictionary of Algorithms and Data Structures: kwayMergeSort","url":"https://xlinux.nist.gov/dads/HTML/kwayMergeSort.html"}],"status":"reported","summary":"NIST DADS defines k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It merges runs from the k streams into an output stream. It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output. Also known as p-way merge sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kwaymerge","kind":"concept","label":"k-way merge","sources":[{"id":"nist-dads.kwaymerge","title":"NIST Dictionary of Algorithms and Data Structures: kwaymerge","url":"https://xlinux.nist.gov/dads/HTML/kwaymerge.html"}],"status":"reported","summary":"NIST DADS defines k-way merge as: Combine k sorted data streams into a single sorted stream.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.labeledgraph","kind":"concept","label":"labeled graph","sources":[{"id":"nist-dads.labeledgraph","title":"NIST Dictionary of Algorithms and Data Structures: labeledgraph","url":"https://xlinux.nist.gov/dads/HTML/labeledgraph.html"}],"status":"reported","summary":"NIST DADS defines labeled graph as: A graph which has labels associated with each edge or each vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.language","kind":"concept","label":"language","sources":[{"id":"nist-dads.language","title":"NIST Dictionary of Algorithms and Data Structures: language","url":"https://xlinux.nist.gov/dads/HTML/language.html"}],"status":"reported","summary":"NIST DADS defines language as: A set of strings over some fixed alphabet . A characterization of inputs which may or may not be solved by algorithms . Also known as formal language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lasvegas","kind":"method","label":"Las Vegas algorithm","sources":[{"id":"nist-dads.lasvegas","title":"NIST Dictionary of Algorithms and Data Structures: lasVegas","url":"https://xlinux.nist.gov/dads/HTML/lasVegas.html"}],"status":"reported","summary":"NIST DADS defines Las Vegas algorithm as: A randomized algorithm that always produces correct results, with the only variation from one run to another being its running time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lastfirstout","kind":"concept","label":"last-in, first-out","sources":[{"id":"nist-dads.lastfirstout","title":"NIST Dictionary of Algorithms and Data Structures: lastfirstout","url":"https://xlinux.nist.gov/dads/HTML/lastfirstout.html"}],"status":"reported","summary":"NIST DADS defines last-in, first-out as: A policy that the most recently arrived item is processed first. A stack implements this.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lattice","kind":"concept","label":"lattice","sources":[{"id":"nist-dads.lattice","title":"NIST Dictionary of Algorithms and Data Structures: lattice","url":"https://xlinux.nist.gov/dads/HTML/lattice.html"}],"status":"reported","summary":"NIST DADS defines lattice as: A point lattice generated by taking integer linear combinations of a set of basis vectors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lcfshashing","kind":"method","label":"LCFS hashing","sources":[{"id":"nist-dads.lcfshashing","title":"NIST Dictionary of Algorithms and Data Structures: lcfsHashing","url":"https://xlinux.nist.gov/dads/HTML/lcfsHashing.html"}],"status":"reported","summary":"NIST DADS defines LCFS hashing as: In case of collision , move the existing item to another position, dictated by the open addressing scheme used.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leastcommonmultiple","kind":"concept","label":"least common multiple","sources":[{"id":"nist-dads.leastcommonmultiple","title":"NIST Dictionary of Algorithms and Data Structures: leastCommonMultiple","url":"https://xlinux.nist.gov/dads/HTML/leastCommonMultiple.html"}],"status":"reported","summary":"NIST DADS defines least common multiple as: The least integer which is a multiple of given integers. For instance, LCM(6, 10) = 30. Also known as LCM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leftisttree","kind":"concept","label":"leftist tree","sources":[{"id":"nist-dads.leftisttree","title":"NIST Dictionary of Algorithms and Data Structures: leftisttree","url":"https://xlinux.nist.gov/dads/HTML/leftisttree.html"}],"status":"reported","summary":"NIST DADS defines leftist tree as: A priority queue implemented with a variant of a binary tree . Every node has a count which is the distance to the nearest leaf . In addition to the heap property , leftist trees are kept so the right descendant of each node has the shorter distance to a leaf.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.leftrotation","kind":"method","label":"left rotation","sources":[{"id":"nist-dads.leftrotation","title":"NIST Dictionary of Algorithms and Data Structures: leftrotation","url":"https://xlinux.nist.gov/dads/HTML/leftrotation.html"}],"status":"reported","summary":"NIST DADS defines left rotation as: (1) In a binary search tree , pushing a node N down and to the left to balance the tree. N's right child replaces N, and the right child's left child becomes N's right child. (2) In an array , moving all items to the next lower location. The first item is moved to the last location, which is now vacant. (3) In a list , removing the head and inserting it at the tail . Also known as rotate left.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.letteromega","kind":"concept","label":"omega","sources":[{"id":"nist-dads.letteromega","title":"NIST Dictionary of Algorithms and Data Structures: letterOmega","url":"https://xlinux.nist.gov/dads/HTML/letterOmega.html"}],"status":"reported","summary":"NIST DADS defines omega as: The Greek letter written as ω (see ω(n) ) or Ω (see Ω(n) ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.level","kind":"concept","label":"level","sources":[{"id":"nist-dads.level","title":"NIST Dictionary of Algorithms and Data Structures: level","url":"https://xlinux.nist.gov/dads/HTML/level.html"}],"status":"reported","summary":"NIST DADS defines level as: (1) All the nodes of a tree with the same depth . (2) Of a node, the depth.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.levelordertraversal","kind":"method","label":"level-order traversal","sources":[{"id":"nist-dads.levelordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: levelOrderTraversal","url":"https://xlinux.nist.gov/dads/HTML/levelOrderTraversal.html"}],"status":"reported","summary":"NIST DADS defines level-order traversal as: Process all nodes of a tree by depth : first the root , then the children of the root, etc. Equivalent to a breadth-first search from the root.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lexicgrphcl","kind":"concept","label":"lexicographical order","sources":[{"id":"nist-dads.lexicgrphcl","title":"NIST Dictionary of Algorithms and Data Structures: lexicgrphcl","url":"https://xlinux.nist.gov/dads/HTML/lexicgrphcl.html"}],"status":"reported","summary":"NIST DADS defines lexicographical order as: Alphabetical or \"dictionary\" order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.linearhash","kind":"method","label":"linear hash","sources":[{"id":"nist-dads.linearhash","title":"NIST Dictionary of Algorithms and Data Structures: linearhash","url":"https://xlinux.nist.gov/dads/HTML/linearhash.html"}],"status":"reported","summary":"NIST DADS defines linear hash as: A numeric function that maintains the order of input keys while changing their spacing. Formal Definition: A hash function f for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2). Also known as order-preserving hash.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linearquadtr","kind":"concept","label":"linear quadtree","sources":[{"id":"nist-dads.linearquadtr","title":"NIST Dictionary of Algorithms and Data Structures: linearquadtr","url":"https://xlinux.nist.gov/dads/HTML/linearquadtr.html"}],"status":"reported","summary":"NIST DADS defines linear quadtree as: A quadtree implemented as a single array of nodes .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.link","kind":"concept","label":"link","sources":[{"id":"nist-dads.link","title":"NIST Dictionary of Algorithms and Data Structures: link","url":"https://xlinux.nist.gov/dads/HTML/link.html"}],"status":"reported","summary":"NIST DADS defines link as: A reference, pointer, or access handle to another part of the data structure. Often, a memory address.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linkeddatasignature","kind":"concept","label":"linked data signature","sources":[{"id":"nist-dads.linkeddatasignature","title":"NIST Dictionary of Algorithms and Data Structures: linkedDataSignature","url":"https://xlinux.nist.gov/dads/HTML/linkedDataSignature.html"}],"status":"reported","summary":"NIST DADS defines linked data signature as: A digital signature, and information to verify it, for linked data. Also known as LDS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.listcontrctn","kind":"concept","label":"list contraction","sources":[{"id":"nist-dads.listcontrctn","title":"NIST Dictionary of Algorithms and Data Structures: listcontrctn","url":"https://xlinux.nist.gov/dads/HTML/listcontrctn.html"}],"status":"reported","summary":"NIST DADS defines list contraction as: Contracting a list by removing some of the items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.littleonotation","kind":"concept","label":"little-o notation","sources":[{"id":"nist-dads.littleonotation","title":"NIST Dictionary of Algorithms and Data Structures: littleOnotation","url":"https://xlinux.nist.gov/dads/HTML/littleOnotation.html"}],"status":"reported","summary":"NIST DADS defines little-o notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity. The notation is read, \"f of n is little oh of g of n\". Formal Definition: f(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.loadfactor","kind":"concept","label":"load factor","sources":[{"id":"nist-dads.loadfactor","title":"NIST Dictionary of Algorithms and Data Structures: loadfactor","url":"https://xlinux.nist.gov/dads/HTML/loadfactor.html"}],"status":"reported","summary":"NIST DADS defines load factor as: The number of elements in a hash table divided by the number of slots. Usually written α (alpha).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.localalgnmnt","kind":"concept","label":"local alignment","sources":[{"id":"nist-dads.localalgnmnt","title":"NIST Dictionary of Algorithms and Data Structures: localalgnmnt","url":"https://xlinux.nist.gov/dads/HTML/localalgnmnt.html"}],"status":"reported","summary":"NIST DADS defines local alignment as: The detection of local similarities among two or more strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.localitysensitivehashing","kind":"method","label":"locality-sensitive hashing","sources":[{"id":"nist-dads.localitysensitivehashing","title":"NIST Dictionary of Algorithms and Data Structures: localitySensitiveHashing","url":"https://xlinux.nist.gov/dads/HTML/localitySensitiveHashing.html"}],"status":"reported","summary":"NIST DADS defines locality-sensitive hashing as: A probabilistic algorithm to quickly find points in a high dimensional space near a query point. Preprocessing: put every point in multiple hash tables . Each table has its own locality-sensitive hash function and uses buckets (or chaining ) since many collisions are expected. The hash functions come from a family of functions. Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.localoptimum","kind":"concept","label":"local optimum","sources":[{"id":"nist-dads.localoptimum","title":"NIST Dictionary of Algorithms and Data Structures: localoptimum","url":"https://xlinux.nist.gov/dads/HTML/localoptimum.html"}],"status":"reported","summary":"NIST DADS defines local optimum as: A solution to a problem that is better than all other solutions that are slightly different, but worse than the global optimum .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.logarithmic","kind":"concept","label":"logarithmic","sources":[{"id":"nist-dads.logarithmic","title":"NIST Dictionary of Algorithms and Data Structures: logarithmic","url":"https://xlinux.nist.gov/dads/HTML/logarithmic.html"}],"status":"reported","summary":"NIST DADS defines logarithmic as: (1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n. More formally m(n) = O(log n) . (3) Sometimes imprecisely used to mean polylogarithmic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.longestcommonsubsequence","kind":"concept","label":"longest common subsequence","sources":[{"id":"nist-dads.longestcommonsubsequence","title":"NIST Dictionary of Algorithms and Data Structures: longestCommonSubsequence","url":"https://xlinux.nist.gov/dads/HTML/longestCommonSubsequence.html"}],"status":"reported","summary":"NIST DADS defines longest common subsequence as: The problem of finding a maximum length (or maximum weight) subsequence of two or more strings . Also known as heaviest common subsequence.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.longestcommonsubstring","kind":"concept","label":"longest common substring","sources":[{"id":"nist-dads.longestcommonsubstring","title":"NIST Dictionary of Algorithms and Data Structures: longestCommonSubstring","url":"https://xlinux.nist.gov/dads/HTML/longestCommonSubstring.html"}],"status":"reported","summary":"NIST DADS defines longest common substring as: Find the longest substring of two or more strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowertriangularmatrix","kind":"concept","label":"lower triangular matrix","sources":[{"id":"nist-dads.lowertriangularmatrix","title":"NIST Dictionary of Algorithms and Data Structures: lowerTriangularMatrix","url":"https://xlinux.nist.gov/dads/HTML/lowerTriangularMatrix.html"}],"status":"reported","summary":"NIST DADS defines lower triangular matrix as: A matrix that is only defined at (i,j) when i ≥ j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowerbound","kind":"concept","label":"lower bound","sources":[{"id":"nist-dads.lowerbound","title":"NIST Dictionary of Algorithms and Data Structures: lowerbound","url":"https://xlinux.nist.gov/dads/HTML/lowerbound.html"}],"status":"reported","summary":"NIST DADS defines lower bound as: A function or growth rate below which solving a problem is impossible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowestcommon","kind":"concept","label":"lowest common ancestor","sources":[{"id":"nist-dads.lowestcommon","title":"NIST Dictionary of Algorithms and Data Structures: lowestcommon","url":"https://xlinux.nist.gov/dads/HTML/lowestcommon.html"}],"status":"reported","summary":"NIST DADS defines lowest common ancestor as: The deepest node in a tree that is an ancestor of two given leaves .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lreduction","kind":"concept","label":"l-reduction","sources":[{"id":"nist-dads.lreduction","title":"NIST Dictionary of Algorithms and Data Structures: lreduction","url":"https://xlinux.nist.gov/dads/HTML/lreduction.html"}],"status":"reported","summary":"NIST DADS defines l-reduction as: A Karp reduction that preserves approximation properties of optimization problems .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.luckysort","kind":"method","label":"lucky sort","sources":[{"id":"nist-dads.luckysort","title":"NIST Dictionary of Algorithms and Data Structures: luckySort","url":"https://xlinux.nist.gov/dads/HTML/luckySort.html"}],"status":"reported","summary":"NIST DADS defines lucky sort as: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing!","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.malhotrakumr","kind":"method","label":"Malhotra-Kumar-Maheshwari blocking flow","sources":[{"id":"nist-dads.malhotrakumr","title":"NIST Dictionary of Algorithms and Data Structures: malhotraKumr","url":"https://xlinux.nist.gov/dads/HTML/malhotraKumr.html"}],"status":"reported","summary":"NIST DADS defines Malhotra-Kumar-Maheshwari blocking flow as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a vertex with the least throughput and greedily push the maximum flow from it to the sink . This is repeated until all vertices are deleted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.manhattandistance","kind":"concept","label":"Manhattan distance","sources":[{"id":"nist-dads.manhattandistance","title":"NIST Dictionary of Algorithms and Data Structures: manhattanDistance","url":"https://xlinux.nist.gov/dads/HTML/manhattanDistance.html"}],"status":"reported","summary":"NIST DADS defines Manhattan distance as: The distance between two points measured along axes at right angles. In a plane with p 1 at (x 1 , y 1 ) and p 2 at (x 2 , y 2 ), it is |x 1 - x 2 | + |y 1 - y 2 |.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.manyonerdctn","kind":"concept","label":"many-one reduction","sources":[{"id":"nist-dads.manyonerdctn","title":"NIST Dictionary of Algorithms and Data Structures: manyonerdctn","url":"https://xlinux.nist.gov/dads/HTML/manyonerdctn.html"}],"status":"reported","summary":"NIST DADS defines many-one reduction as: A reduction that maps an instance of one problem into an equivalent instance of another problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.markovchain","kind":"concept","label":"Markov chain","sources":[{"id":"nist-dads.markovchain","title":"NIST Dictionary of Algorithms and Data Structures: markovchain","url":"https://xlinux.nist.gov/dads/HTML/markovchain.html"}],"status":"reported","summary":"NIST DADS defines Markov chain as: A finite state machine with probabilities for each transition, that is, a probability that the next state is s j given that the current state is s i .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mastertheorm","kind":"concept","label":"Master theorem","sources":[{"id":"nist-dads.mastertheorm","title":"NIST Dictionary of Algorithms and Data Structures: mastertheorm","url":"https://xlinux.nist.gov/dads/HTML/mastertheorm.html"}],"status":"reported","summary":"NIST DADS defines Master theorem as: A theorem giving a solution in asymptotic terms for recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matchededge","kind":"concept","label":"matched edge","sources":[{"id":"nist-dads.matchededge","title":"NIST Dictionary of Algorithms and Data Structures: matchededge","url":"https://xlinux.nist.gov/dads/HTML/matchededge.html"}],"status":"reported","summary":"NIST DADS defines matched edge as: An edge which is in a matching .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matchedvertx","kind":"concept","label":"matched vertex","sources":[{"id":"nist-dads.matchedvertx","title":"NIST Dictionary of Algorithms and Data Structures: matchedvertx","url":"https://xlinux.nist.gov/dads/HTML/matchedvertx.html"}],"status":"reported","summary":"NIST DADS defines matched vertex as: A vertex on an matched edge in a matching , or, one which has been matched.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matching","kind":"concept","label":"matching","sources":[{"id":"nist-dads.matching","title":"NIST Dictionary of Algorithms and Data Structures: matching","url":"https://xlinux.nist.gov/dads/HTML/matching.html"}],"status":"reported","summary":"NIST DADS defines matching as: (1) A subgraph in which every vertex has a degree at most one. In other words, no two edges share a common vertex. (2) The problem of finding such a subgraph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matrix","kind":"concept","label":"matrix","sources":[{"id":"nist-dads.matrix","title":"NIST Dictionary of Algorithms and Data Structures: matrix","url":"https://xlinux.nist.gov/dads/HTML/matrix.html"}],"status":"reported","summary":"NIST DADS defines matrix as: A two-dimensional array. By convention, the first index is the row, and the second index is the column.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matrxchnmltp","kind":"concept","label":"matrix-chain multiplication problem","sources":[{"id":"nist-dads.matrxchnmltp","title":"NIST Dictionary of Algorithms and Data Structures: matrxchnmltp","url":"https://xlinux.nist.gov/dads/HTML/matrxchnmltp.html"}],"status":"reported","summary":"NIST DADS defines matrix-chain multiplication problem as: Given a sequence of matrices such that any matrix may be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum number of arithmetic operations. One may use dynamic programming to find the best association.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maxheapprop","kind":"concept","label":"max-heap property","sources":[{"id":"nist-dads.maxheapprop","title":"NIST Dictionary of Algorithms and Data Structures: maxheapprop","url":"https://xlinux.nist.gov/dads/HTML/maxheapprop.html"}],"status":"reported","summary":"NIST DADS defines max-heap property as: Each node in a tree has a key which is less than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximalindependentset","kind":"concept","label":"maximal independent set","sources":[{"id":"nist-dads.maximalindependentset","title":"NIST Dictionary of Algorithms and Data Structures: maximalIndependentSet","url":"https://xlinux.nist.gov/dads/HTML/maximalIndependentSet.html"}],"status":"reported","summary":"NIST DADS defines maximal independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them and such that no more vertices can be added and it still be an independent set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximallyconnectedcomponent","kind":"concept","label":"maximally connected component","sources":[{"id":"nist-dads.maximallyconnectedcomponent","title":"NIST Dictionary of Algorithms and Data Structures: maximallyConnectedComponent","url":"https://xlinux.nist.gov/dads/HTML/maximallyConnectedComponent.html"}],"status":"reported","summary":"NIST DADS defines maximally connected component as: A connected subgraph of a graph to which no vertex can be added and it still be connected. Formal Definition: Given a graph G=(V, E), a subgraph S=(V', E') is a maximally connected component if S is connected , and for all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximumflow","kind":"concept","label":"maximum-flow problem","sources":[{"id":"nist-dads.maximumflow","title":"NIST Dictionary of Algorithms and Data Structures: maximumflow","url":"https://xlinux.nist.gov/dads/HTML/maximumflow.html"}],"status":"reported","summary":"NIST DADS defines maximum-flow problem as: The problem of finding the maximum flow between any two vertices of a directed graph . Also known as network flow problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mealymachine","kind":"concept","label":"Mealy machine","sources":[{"id":"nist-dads.mealymachine","title":"NIST Dictionary of Algorithms and Data Structures: mealyMachine","url":"https://xlinux.nist.gov/dads/HTML/mealyMachine.html"}],"status":"reported","summary":"NIST DADS defines Mealy machine as: A finite state machine which produces an output for each transition .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mean","kind":"concept","label":"mean","sources":[{"id":"nist-dads.mean","title":"NIST Dictionary of Algorithms and Data Structures: mean","url":"https://xlinux.nist.gov/dads/HTML/mean.html"}],"status":"reported","summary":"NIST DADS defines mean as: The (arithmetic) mean of some values is the sum of all values divided by the number of values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.median","kind":"concept","label":"median","sources":[{"id":"nist-dads.median","title":"NIST Dictionary of Algorithms and Data Structures: median","url":"https://xlinux.nist.gov/dads/HTML/median.html"}],"status":"reported","summary":"NIST DADS defines median as: The value that has an equal number of values greater and less than it. For an even number of values, it is the mean of the two middle values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.meld","kind":"concept","label":"meld","sources":[{"id":"nist-dads.meld","title":"NIST Dictionary of Algorithms and Data Structures: meld","url":"https://xlinux.nist.gov/dads/HTML/meld.html"}],"status":"reported","summary":"NIST DADS defines meld as: Joining several data structures with particular properties into one large data structure having those properties. For instance, some priority queue implementations support the operation of joining two priority queues into a larger one.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.metaheuristic","kind":"method","label":"metaheuristic","sources":[{"id":"nist-dads.metaheuristic","title":"NIST Dictionary of Algorithms and Data Structures: metaheuristic","url":"https://xlinux.nist.gov/dads/HTML/metaheuristic.html"}],"status":"reported","summary":"NIST DADS defines metaheuristic as: (1) A high-level algorithmic framework or approach that can be specialized to solve optimization problems . (2) A high-level strategy that guides other heuristics in a search for feasible solutions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.metaphone","kind":"method","label":"metaphone","sources":[{"id":"nist-dads.metaphone","title":"NIST Dictionary of Algorithms and Data Structures: metaphone","url":"https://xlinux.nist.gov/dads/HTML/metaphone.html"}],"status":"reported","summary":"NIST DADS defines metaphone as: An algorithm to code English words phonetically by reducing them to 16 consonant sounds. A better variant is double metaphone .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.midrange","kind":"concept","label":"midrange","sources":[{"id":"nist-dads.midrange","title":"NIST Dictionary of Algorithms and Data Structures: midrange","url":"https://xlinux.nist.gov/dads/HTML/midrange.html"}],"status":"reported","summary":"NIST DADS defines midrange as: The sum of the minimum and maximum values, divided by two.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minheapprop","kind":"concept","label":"min-heap property","sources":[{"id":"nist-dads.minheapprop","title":"NIST Dictionary of Algorithms and Data Structures: minheapprop","url":"https://xlinux.nist.gov/dads/HTML/minheapprop.html"}],"status":"reported","summary":"NIST DADS defines min-heap property as: Each node in a tree has a key which is greater than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.minimalperfecthash","kind":"method","label":"minimal perfect hashing","sources":[{"id":"nist-dads.minimalperfecthash","title":"NIST Dictionary of Algorithms and Data Structures: minimalPerfectHash","url":"https://xlinux.nist.gov/dads/HTML/minimalPerfectHash.html"}],"status":"reported","summary":"NIST DADS defines minimal perfect hashing as: A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formal Definition: A function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the range of f(k) is 1… |K|.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.minimax","kind":"method","label":"minimax","sources":[{"id":"nist-dads.minimax","title":"NIST Dictionary of Algorithms and Data Structures: minimax","url":"https://xlinux.nist.gov/dads/HTML/minimax.html"}],"status":"reported","summary":"NIST DADS defines minimax as: Generate all nodes in a game tree. Score each leaf node with its utility value. Score each minimizing node with the smallest of its children's scores, and maximizing node with the largest of its children's scores.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumboundingbox","kind":"concept","label":"minimum bounding box","sources":[{"id":"nist-dads.minimumboundingbox","title":"NIST Dictionary of Algorithms and Data Structures: minimumBoundingBox","url":"https://xlinux.nist.gov/dads/HTML/minimumBoundingBox.html"}],"status":"reported","summary":"NIST DADS defines minimum bounding box as: The smallest rectangle completely enclosing a set of points. Also known as MBB.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumcut","kind":"concept","label":"minimum cut","sources":[{"id":"nist-dads.minimumcut","title":"NIST Dictionary of Algorithms and Data Structures: minimumcut","url":"https://xlinux.nist.gov/dads/HTML/minimumcut.html"}],"status":"reported","summary":"NIST DADS defines minimum cut as: The smallest set of edges in an undirected graph which separate two distinct vertices . That is, every path between them includes some member of the set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minvertexcut","kind":"concept","label":"minimum vertex cut","sources":[{"id":"nist-dads.minvertexcut","title":"NIST Dictionary of Algorithms and Data Structures: minvertexcut","url":"https://xlinux.nist.gov/dads/HTML/minvertexcut.html"}],"status":"reported","summary":"NIST DADS defines minimum vertex cut as: The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mixedinteger","kind":"concept","label":"mixed integer linear program","sources":[{"id":"nist-dads.mixedinteger","title":"NIST Dictionary of Algorithms and Data Structures: mixedinteger","url":"https://xlinux.nist.gov/dads/HTML/mixedinteger.html"}],"status":"reported","summary":"NIST DADS defines mixed integer linear program as: A linear program with additional constraints that some of the variables must take on integer values. Solving such problems is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mode","kind":"concept","label":"mode","sources":[{"id":"nist-dads.mode","title":"NIST Dictionary of Algorithms and Data Structures: mode","url":"https://xlinux.nist.gov/dads/HTML/mode.html"}],"status":"reported","summary":"NIST DADS defines mode as: The value that occurs most often. If no value is repeated, there is no mode. If more than one value occurs with the same greatest frequency, each value is a mode.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.modelofcomputation","kind":"concept","label":"model of computation","sources":[{"id":"nist-dads.modelofcomputation","title":"NIST Dictionary of Algorithms and Data Structures: modelOfComputation","url":"https://xlinux.nist.gov/dads/HTML/modelOfComputation.html"}],"status":"reported","summary":"NIST DADS defines model of computation as: A formal, abstract definition of a computer. Using a model one can more easily analyze the intrinsic execution time or memory space of an algorithm while ignoring many implementation issues. There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.modelcheckng","kind":"method","label":"model checking","sources":[{"id":"nist-dads.modelcheckng","title":"NIST Dictionary of Algorithms and Data Structures: modelcheckng","url":"https://xlinux.nist.gov/dads/HTML/modelcheckng.html"}],"status":"reported","summary":"NIST DADS defines model checking as: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.modifind","kind":"method","label":"MODIFIND","sources":[{"id":"nist-dads.modifind","title":"NIST Dictionary of Algorithms and Data Structures: modifind","url":"https://xlinux.nist.gov/dads/HTML/modifind.html"}],"status":"reported","summary":"NIST DADS defines MODIFIND as: Select the k th smallest element of an array and partition the array around it. Partition around the value of the k th element. If the partition boundary is not at k, repeat in the partition that includes k.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonicallydecreasing","kind":"concept","label":"monotonically decreasing","sources":[{"id":"nist-dads.monotonicallydecreasing","title":"NIST Dictionary of Algorithms and Data Structures: monotonicallyDecreasing","url":"https://xlinux.nist.gov/dads/HTML/monotonicallyDecreasing.html"}],"status":"reported","summary":"NIST DADS defines monotonically decreasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≥ f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonicallyincreasing","kind":"concept","label":"monotonically increasing","sources":[{"id":"nist-dads.monotonicallyincreasing","title":"NIST Dictionary of Algorithms and Data Structures: monotonicallyIncreasing","url":"https://xlinux.nist.gov/dads/HTML/monotonicallyIncreasing.html"}],"status":"reported","summary":"NIST DADS defines monotonically increasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≤ f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonprioq","kind":"concept","label":"monotone priority queue","sources":[{"id":"nist-dads.monotonprioq","title":"NIST Dictionary of Algorithms and Data Structures: monotonprioq","url":"https://xlinux.nist.gov/dads/HTML/monotonprioq.html"}],"status":"reported","summary":"NIST DADS defines monotone priority queue as: A priority queue in which a key being inserted is never higher in priority than a previously deleted node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.montecarlo","kind":"method","label":"Monte Carlo algorithm","sources":[{"id":"nist-dads.montecarlo","title":"NIST Dictionary of Algorithms and Data Structures: monteCarlo","url":"https://xlinux.nist.gov/dads/HTML/monteCarlo.html"}],"status":"reported","summary":"NIST DADS defines Monte Carlo algorithm as: A randomized algorithm that may produce incorrect results, but with bounded error probability.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mooremachine","kind":"concept","label":"Moore machine","sources":[{"id":"nist-dads.mooremachine","title":"NIST Dictionary of Algorithms and Data Structures: mooreMachine","url":"https://xlinux.nist.gov/dads/HTML/mooreMachine.html"}],"status":"reported","summary":"NIST DADS defines Moore machine as: A finite state machine that produces an output for each state .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.movefront","kind":"method","label":"move-to-front heuristic","sources":[{"id":"nist-dads.movefront","title":"NIST Dictionary of Algorithms and Data Structures: movefront","url":"https://xlinux.nist.gov/dads/HTML/movefront.html"}],"status":"reported","summary":"NIST DADS defines move-to-front heuristic as: A heuristic that moves the target of a search to the head of a list so it is found faster next time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.movetoroot","kind":"method","label":"move-to-root heuristic","sources":[{"id":"nist-dads.movetoroot","title":"NIST Dictionary of Algorithms and Data Structures: movetoroot","url":"https://xlinux.nist.gov/dads/HTML/movetoroot.html"}],"status":"reported","summary":"NIST DADS defines move-to-root heuristic as: A heuristic that moves the target of a search to the root of the search tree so it is found faster next time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multisuffixtree","kind":"concept","label":"multi suffix tree","sources":[{"id":"nist-dads.multisuffixtree","title":"NIST Dictionary of Algorithms and Data Structures: multiSuffixTree","url":"https://xlinux.nist.gov/dads/HTML/multiSuffixTree.html"}],"status":"reported","summary":"NIST DADS defines multi suffix tree as: A suffix tree extended to multiple strings by concatenating the strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multicommdty","kind":"concept","label":"multi-commodity flow","sources":[{"id":"nist-dads.multicommdty","title":"NIST Dictionary of Algorithms and Data Structures: multicommdty","url":"https://xlinux.nist.gov/dads/HTML/multicommdty.html"}],"status":"reported","summary":"NIST DADS defines multi-commodity flow as: A maximum-flow problem involving multiple commodities, in which each commodity has an associated demand and source - sink pairs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multigraph","kind":"concept","label":"multigraph","sources":[{"id":"nist-dads.multigraph","title":"NIST Dictionary of Algorithms and Data Structures: multigraph","url":"https://xlinux.nist.gov/dads/HTML/multigraph.html"}],"status":"reported","summary":"NIST DADS defines multigraph as: A graph whose edges are unordered pairs of vertices , and the same pair of vertices can be connected by multiple edges. Formal Definition: Same as graph, but E is a bag of edges, not a set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.multikeyquicksort","kind":"method","label":"multikey Quicksort","sources":[{"id":"nist-dads.multikeyquicksort","title":"NIST Dictionary of Algorithms and Data Structures: multikeyQuicksort","url":"https://xlinux.nist.gov/dads/HTML/multikeyQuicksort.html"}],"status":"reported","summary":"NIST DADS defines multikey Quicksort as: Pick an element from the array (the pivot). Consider the first character (key) of the string (multikey). Partition the remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character. Recursively sort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key). Also known as three-way radix quicksort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multilaygrd","kind":"concept","label":"multilayer grid file","sources":[{"id":"nist-dads.multilaygrd","title":"NIST Dictionary of Algorithms and Data Structures: multilaygrd","url":"https://xlinux.nist.gov/dads/HTML/multilaygrd.html"}],"status":"reported","summary":"NIST DADS defines multilayer grid file as: A spatial access method which is two or more simultaneous grid files . Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.multiprefix","kind":"method","label":"multiprefix","sources":[{"id":"nist-dads.multiprefix","title":"NIST Dictionary of Algorithms and Data Structures: multiprefix","url":"https://xlinux.nist.gov/dads/HTML/multiprefix.html"}],"status":"reported","summary":"NIST DADS defines multiprefix as: A generalization of scan in which the partial sums are grouped by keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiprocssr","kind":"concept","label":"multiprocessor model","sources":[{"id":"nist-dads.multiprocssr","title":"NIST Dictionary of Algorithms and Data Structures: multiprocssr","url":"https://xlinux.nist.gov/dads/HTML/multiprocssr.html"}],"status":"reported","summary":"NIST DADS defines multiprocessor model as: A model of parallel computation based on a set of communicating sequential processors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaydecision","kind":"concept","label":"multiway decision","sources":[{"id":"nist-dads.multiwaydecision","title":"NIST Dictionary of Algorithms and Data Structures: multiwayDecision","url":"https://xlinux.nist.gov/dads/HTML/multiwayDecision.html"}],"status":"reported","summary":"NIST DADS defines multiway decision as: A decision which has more than two results. For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaymerge","kind":"concept","label":"multiway merge","sources":[{"id":"nist-dads.multiwaymerge","title":"NIST Dictionary of Algorithms and Data Structures: multiwayMerge","url":"https://xlinux.nist.gov/dads/HTML/multiwayMerge.html"}],"status":"reported","summary":"NIST DADS defines multiway merge as: Combine more than two sorted data streams into a single sorted stream.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaytree","kind":"concept","label":"multiway tree","sources":[{"id":"nist-dads.multiwaytree","title":"NIST Dictionary of Algorithms and Data Structures: multiwaytree","url":"https://xlinux.nist.gov/dads/HTML/multiwaytree.html"}],"status":"reported","summary":"NIST DADS defines multiway tree as: A tree with any number of children for each node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.munkresassignment","kind":"method","label":"Munkres' assignment algorithm","sources":[{"id":"nist-dads.munkresassignment","title":"NIST Dictionary of Algorithms and Data Structures: munkresAssignment","url":"https://xlinux.nist.gov/dads/HTML/munkresAssignment.html"}],"status":"reported","summary":"NIST DADS defines Munkres' assignment algorithm as: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns. Also known as Hungarian algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.npcompltlngg","kind":"concept","label":"NP-complete language","sources":[{"id":"nist-dads.npcompltlngg","title":"NIST Dictionary of Algorithms and Data Structures: nPcompltlngg","url":"https://xlinux.nist.gov/dads/HTML/nPcompltlngg.html"}],"status":"reported","summary":"NIST DADS defines NP-complete language as: A language in NP such that every language in NP can be reduced to it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nand","kind":"concept","label":"nand","sources":[{"id":"nist-dads.nand","title":"NIST Dictionary of Algorithms and Data Structures: nand","url":"https://xlinux.nist.gov/dads/HTML/nand.html"}],"status":"reported","summary":"NIST DADS defines nand as: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.naryfunc","kind":"concept","label":"n-ary function","sources":[{"id":"nist-dads.naryfunc","title":"NIST Dictionary of Algorithms and Data Structures: naryfunc","url":"https://xlinux.nist.gov/dads/HTML/naryfunc.html"}],"status":"reported","summary":"NIST DADS defines n-ary function as: (1) A function with exactly n arguments. (2) A function which takes any number of arguments, or a variable number of arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nearestneighbor","kind":"concept","label":"nearest neighbor","sources":[{"id":"nist-dads.nearestneighbor","title":"NIST Dictionary of Algorithms and Data Structures: nearestNeighbor","url":"https://xlinux.nist.gov/dads/HTML/nearestNeighbor.html"}],"status":"reported","summary":"NIST DADS defines nearest neighbor as: Find the point (rectangle, line, etc.) that is closest to another point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.negation","kind":"concept","label":"negation","sources":[{"id":"nist-dads.negation","title":"NIST Dictionary of Algorithms and Data Structures: negation","url":"https://xlinux.nist.gov/dads/HTML/negation.html"}],"status":"reported","summary":"NIST DADS defines negation as: The negation of 0 is 1; the negation of 1 is 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nextstate","kind":"concept","label":"next state","sources":[{"id":"nist-dads.nextstate","title":"NIST Dictionary of Algorithms and Data Structures: nextstate","url":"https://xlinux.nist.gov/dads/HTML/nextstate.html"}],"status":"reported","summary":"NIST DADS defines next state as: The state immediately following the current state, defined by the transition function of a finite state machine and the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nist","kind":"concept","label":"NIST","sources":[{"id":"nist-dads.nist","title":"NIST Dictionary of Algorithms and Data Structures: nist","url":"https://xlinux.nist.gov/dads/HTML/nist.html"}],"status":"reported","summary":"NIST DADS defines NIST as: The United States National Institute of Standards and Technology.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.node","kind":"concept","label":"node","sources":[{"id":"nist-dads.node","title":"NIST Dictionary of Algorithms and Data Structures: node","url":"https://xlinux.nist.gov/dads/HTML/node.html"}],"status":"reported","summary":"NIST DADS defines node as: (1) A unit of reference in a data structure. Also called a vertex in graphs and trees . (2) A collection of information which must be kept at a single memory location.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nonbalncmsrt","kind":"method","label":"nonbalanced merge sort","sources":[{"id":"nist-dads.nonbalncmsrt","title":"NIST Dictionary of Algorithms and Data Structures: nonbalncmsrt","url":"https://xlinux.nist.gov/dads/HTML/nonbalncmsrt.html"}],"status":"reported","summary":"NIST DADS defines nonbalanced merge sort as: A k-way merge sort in which the number of input and output data streams is different for any particular pass. Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nondetermalgo","kind":"method","label":"nondeterministic algorithm","sources":[{"id":"nist-dads.nondetermalgo","title":"NIST Dictionary of Algorithms and Data Structures: nondetermAlgo","url":"https://xlinux.nist.gov/dads/HTML/nondetermAlgo.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic algorithm as: A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It is not random, as in randomized algorithm , or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermfinitetreeautom","kind":"concept","label":"nondeterministic finite tree automaton","sources":[{"id":"nist-dads.nondetermfinitetreeautom","title":"NIST Dictionary of Algorithms and Data Structures: nondetermFiniteTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/nondetermFiniteTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic finite tree automaton as: A nondeterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as NFTA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermtreeautom","kind":"concept","label":"nondeterministic tree automaton","sources":[{"id":"nist-dads.nondetermtreeautom","title":"NIST Dictionary of Algorithms and Data Structures: nondetermTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/nondetermTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic tree automaton as: A nondeterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondeterministic","kind":"concept","label":"nondeterministic","sources":[{"id":"nist-dads.nondeterministic","title":"NIST Dictionary of Algorithms and Data Structures: nondeterministic","url":"https://xlinux.nist.gov/dads/HTML/nondeterministic.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic as: Permitting more than one choice of next move at some step in a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nor","kind":"concept","label":"nor","sources":[{"id":"nist-dads.nor","title":"NIST Dictionary of Algorithms and Data Structures: nor","url":"https://xlinux.nist.gov/dads/HTML/nor.html"}],"status":"reported","summary":"NIST DADS defines nor as: Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.not","kind":"concept","label":"not","sources":[{"id":"nist-dads.not","title":"NIST Dictionary of Algorithms and Data Structures: not","url":"https://xlinux.nist.gov/dads/HTML/not.html"}],"status":"reported","summary":"NIST DADS defines not as: Negation: NOT 0 = 1, NOT 1 = 0. Also known as complement .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.np","kind":"concept","label":"NP","sources":[{"id":"nist-dads.np","title":"NIST Dictionary of Algorithms and Data Structures: np","url":"https://xlinux.nist.gov/dads/HTML/np.html"}],"status":"reported","summary":"NIST DADS defines NP as: The complexity class of decision problems for which answers can be checked by an algorithm whose run time is polynomial in the size of the input. Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly. \"NP\" is the class that a N ondeterministic Turing machine accepts in P olynomial time. Also known as nondeterministic polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nphard","kind":"concept","label":"NP-hard","sources":[{"id":"nist-dads.nphard","title":"NIST Dictionary of Algorithms and Data Structures: nphard","url":"https://xlinux.nist.gov/dads/HTML/nphard.html"}],"status":"reported","summary":"NIST DADS defines NP-hard as: The complexity class of decision problems that are intrinsically harder than those that can be solved by a nondeterministic Turing machine in polynomial time . When a decision version of a combinatorial optimization problem is proved to belong to the class of NP-complete problems, then the optimization version is NP-hard.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nqueens","kind":"concept","label":"n queens","sources":[{"id":"nist-dads.nqueens","title":"NIST Dictionary of Algorithms and Data Structures: nqueens","url":"https://xlinux.nist.gov/dads/HTML/nqueens.html"}],"status":"reported","summary":"NIST DADS defines n queens as: Place n chess queens on an n × n board such that no queen can attack another. Efficiently find all possible placements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nulltree","kind":"concept","label":"null tree","sources":[{"id":"nist-dads.nulltree","title":"NIST Dictionary of Algorithms and Data Structures: nulltree","url":"https://xlinux.nist.gov/dads/HTML/nulltree.html"}],"status":"reported","summary":"NIST DADS defines null tree as: (1) A tree which is empty. (2) A tree whose leaf nodes all have a null value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nysiis","kind":"method","label":"NYSIIS","sources":[{"id":"nist-dads.nysiis","title":"NIST Dictionary of Algorithms and Data Structures: nysiis","url":"https://xlinux.nist.gov/dads/HTML/nysiis.html"}],"status":"reported","summary":"NIST DADS defines NYSIIS as: Convert a name to a phonetic coding of up to six characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.objective","kind":"concept","label":"objective function","sources":[{"id":"nist-dads.objective","title":"NIST Dictionary of Algorithms and Data Structures: objective","url":"https://xlinux.nist.gov/dads/HTML/objective.html"}],"status":"reported","summary":"NIST DADS defines objective function as: A function associated with an optimization problem which determines how good a solution is, for instance, the total cost of edges in a solution to a traveling salesman problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.obliviousalgorithm","kind":"concept","label":"oblivious algorithm","sources":[{"id":"nist-dads.obliviousalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: obliviousAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/obliviousAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines oblivious algorithm as: An algorithm whose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.occurrence","kind":"concept","label":"occurrence","sources":[{"id":"nist-dads.occurrence","title":"NIST Dictionary of Algorithms and Data Structures: occurrence","url":"https://xlinux.nist.gov/dads/HTML/occurrence.html"}],"status":"reported","summary":"NIST DADS defines occurrence as: A string v occurs in a string u if v is a substring of u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.octree","kind":"concept","label":"octree","sources":[{"id":"nist-dads.octree","title":"NIST Dictionary of Algorithms and Data Structures: octree","url":"https://xlinux.nist.gov/dads/HTML/octree.html"}],"status":"reported","summary":"NIST DADS defines octree as: A tree to index three dimensions. Each node has either eight children or no children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.offline","kind":"concept","label":"off-line algorithm","sources":[{"id":"nist-dads.offline","title":"NIST Dictionary of Algorithms and Data Structures: offline","url":"https://xlinux.nist.gov/dads/HTML/offline.html"}],"status":"reported","summary":"NIST DADS defines off-line algorithm as: An algorithm which is given the entire sequence of inputs in advance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.offset","kind":"concept","label":"offset","sources":[{"id":"nist-dads.offset","title":"NIST Dictionary of Algorithms and Data Structures: offset","url":"https://xlinux.nist.gov/dads/HTML/offset.html"}],"status":"reported","summary":"NIST DADS defines offset as: The distance from the beginning of a string to the end of a segment in that string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.omega","kind":"concept","label":"ω","sources":[{"id":"nist-dads.omega","title":"NIST Dictionary of Algorithms and Data Structures: omega","url":"https://xlinux.nist.gov/dads/HTML/omega.html"}],"status":"reported","summary":"NIST DADS defines ω as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity. Formal Definition: f(n) = ω (g(n)) means that for any positive constant c, there exists a constant k, such that 0 ≤ cg(n) < f(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.omicron","kind":"concept","label":"omicron","sources":[{"id":"nist-dads.omicron","title":"NIST Dictionary of Algorithms and Data Structures: omicron","url":"https://xlinux.nist.gov/dads/HTML/omicron.html"}],"status":"reported","summary":"NIST DADS defines omicron as: The Greek letter written as \"o\" (see little-o notation ) or \"O\" (see big-O notation ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.onebasedindexing","kind":"concept","label":"1-based indexing","sources":[{"id":"nist-dads.onebasedindexing","title":"NIST Dictionary of Algorithms and Data Structures: oneBasedIndexing","url":"https://xlinux.nist.gov/dads/HTML/oneBasedIndexing.html"}],"status":"reported","summary":"NIST DADS defines 1-based indexing as: Indexing (an array ) beginning with 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.onedimensnal","kind":"concept","label":"one-dimensional","sources":[{"id":"nist-dads.onedimensnal","title":"NIST Dictionary of Algorithms and Data Structures: onedimensnal","url":"https://xlinux.nist.gov/dads/HTML/onedimensnal.html"}],"status":"reported","summary":"NIST DADS defines one-dimensional as: Dealing with or restricted to a line. An organization where location can be completely described with exactly one axis.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.online","kind":"concept","label":"on-line algorithm","sources":[{"id":"nist-dads.online","title":"NIST Dictionary of Algorithms and Data Structures: online","url":"https://xlinux.nist.gov/dads/HTML/online.html"}],"status":"reported","summary":"NIST DADS defines on-line algorithm as: An algorithm that must process each input in turn, without detailed knowledge of future inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimtriangulation","kind":"concept","label":"optimal triangulation problem","sources":[{"id":"nist-dads.optimtriangulation","title":"NIST Dictionary of Algorithms and Data Structures: optimTriangulation","url":"https://xlinux.nist.gov/dads/HTML/optimTriangulation.html"}],"status":"reported","summary":"NIST DADS defines optimal triangulation problem as: Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes O(n log n) time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimal","kind":"concept","label":"optimal","sources":[{"id":"nist-dads.optimal","title":"NIST Dictionary of Algorithms and Data Structures: optimal","url":"https://xlinux.nist.gov/dads/HTML/optimal.html"}],"status":"reported","summary":"NIST DADS defines optimal as: (1) A solution to an optimization problem which has the minimum (or maximum) value of the objective function . (2) The time, space, resource, etc. complexity of an algorithm which matches the best known lower bound of a problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimalmismatch","kind":"method","label":"optimal mismatch","sources":[{"id":"nist-dads.optimalmismatch","title":"NIST Dictionary of Algorithms and Data Structures: optimalMismatch","url":"https://xlinux.nist.gov/dads/HTML/optimalMismatch.html"}],"status":"reported","summary":"NIST DADS defines optimal mismatch as: A string matching algorithm that compares the rarest character first. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimalpolyphasemergesort","kind":"method","label":"optimal polyphase merge sort","sources":[{"id":"nist-dads.optimalpolyphasemergesort","title":"NIST Dictionary of Algorithms and Data Structures: optimalPolyphaseMergeSort","url":"https://xlinux.nist.gov/dads/HTML/optimalPolyphaseMergeSort.html"}],"status":"reported","summary":"NIST DADS defines optimal polyphase merge sort as: An external sort algorithm that uses optimal polyphase merges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimalsoltn","kind":"concept","label":"optimal solution","sources":[{"id":"nist-dads.optimalsoltn","title":"NIST Dictionary of Algorithms and Data Structures: optimalsoltn","url":"https://xlinux.nist.gov/dads/HTML/optimalsoltn.html"}],"status":"reported","summary":"NIST DADS defines optimal solution as: A solution to an optimization problem which minimizes (or maximizes) the objective function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimalvalue","kind":"concept","label":"optimal value","sources":[{"id":"nist-dads.optimalvalue","title":"NIST Dictionary of Algorithms and Data Structures: optimalvalue","url":"https://xlinux.nist.gov/dads/HTML/optimalvalue.html"}],"status":"reported","summary":"NIST DADS defines optimal value as: The minimum (or maximum) value of the objective function over the feasible region of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimization","kind":"concept","label":"optimization problem","sources":[{"id":"nist-dads.optimization","title":"NIST Dictionary of Algorithms and Data Structures: optimization","url":"https://xlinux.nist.gov/dads/HTML/optimization.html"}],"status":"reported","summary":"NIST DADS defines optimization problem as: A computational problem in which the object is to find the best of all possible solutions. More formally, find a solution in the feasible region which has the minimum (or maximum) value of the objective function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimpolymrg","kind":"method","label":"optimal polyphase merge","sources":[{"id":"nist-dads.optimpolymrg","title":"NIST Dictionary of Algorithms and Data Structures: optimpolymrg","url":"https://xlinux.nist.gov/dads/HTML/optimpolymrg.html"}],"status":"reported","summary":"NIST DADS defines optimal polyphase merge as: A polyphase merge which seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files. Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file. A series of kth order Fibonacci numbers is one way to select the number of runs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.or","kind":"concept","label":"or","sources":[{"id":"nist-dads.or","title":"NIST Dictionary of Algorithms and Data Structures: or","url":"https://xlinux.nist.gov/dads/HTML/or.html"}],"status":"reported","summary":"NIST DADS defines or as: Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1. Also known as inclusive or.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracletur","kind":"concept","label":"oracle Turing machine","sources":[{"id":"nist-dads.oracletur","title":"NIST Dictionary of Algorithms and Data Structures: oracleTur","url":"https://xlinux.nist.gov/dads/HTML/oracleTur.html"}],"status":"reported","summary":"NIST DADS defines oracle Turing machine as: A Turing machine with an extra oracle tape and three extra states q ? , q y , q n . When the machine enters q ? , control goes to state q y if the oracle tape content is in the oracle set ; otherwise control goes to state q n .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracleset","kind":"concept","label":"oracle set","sources":[{"id":"nist-dads.oracleset","title":"NIST Dictionary of Algorithms and Data Structures: oracleset","url":"https://xlinux.nist.gov/dads/HTML/oracleset.html"}],"status":"reported","summary":"NIST DADS defines oracle set as: A predetermined set of tapes used by an oracle Turing machine to make decisions otherwise not feasibled.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracletape","kind":"concept","label":"oracle tape","sources":[{"id":"nist-dads.oracletape","title":"NIST Dictionary of Algorithms and Data Structures: oracletape","url":"https://xlinux.nist.gov/dads/HTML/oracletape.html"}],"status":"reported","summary":"NIST DADS defines oracle tape as: An extra tape used by an oracle Turing machine to make decisions otherwise not feasible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.order","kind":"concept","label":"order","sources":[{"id":"nist-dads.order","title":"NIST Dictionary of Algorithms and Data Structures: order","url":"https://xlinux.nist.gov/dads/HTML/order.html"}],"status":"reported","summary":"NIST DADS defines order as: (1) The height of a tree . (2) The number of children of the root of a binomial tree . (3) The maximum number of children of nodes in a B-tree . (4) The number of data streams, usually denoted ω, in a multiway merge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.orderpreservminperfecthash","kind":"method","label":"order-preserving minimal perfect hashing","sources":[{"id":"nist-dads.orderpreservminperfecthash","title":"NIST Dictionary of Algorithms and Data Structures: orderPreservMinPerfectHash","url":"https://xlinux.nist.gov/dads/HTML/orderPreservMinPerfectHash.html"}],"status":"reported","summary":"NIST DADS defines order-preserving minimal perfect hashing as: A minimal perfect hashing function for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.orderpreservinghuffmancoding","kind":"method","label":"order-preserving Huffman coding","sources":[{"id":"nist-dads.orderpreservinghuffmancoding","title":"NIST Dictionary of Algorithms and Data Structures: orderPreservingHuffmanCoding","url":"https://xlinux.nist.gov/dads/HTML/orderPreservingHuffmanCoding.html"}],"status":"reported","summary":"NIST DADS defines order-preserving Huffman coding as: A variable-length character coding based on the frequency of each character. The algorithm is similar to Huffman coding , but the trees are kept in the same order as the characters. Two adjacent trees with the least combined frequency are joined as subtrees of a new root. As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies. Repeat until all characters are in one tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedlinkedlist","kind":"concept","label":"ordered linked list","sources":[{"id":"nist-dads.orderedlinkedlist","title":"NIST Dictionary of Algorithms and Data Structures: orderedLinkedList","url":"https://xlinux.nist.gov/dads/HTML/orderedLinkedList.html"}],"status":"reported","summary":"NIST DADS defines ordered linked list as: A linked list whose items are kept in some order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedarry","kind":"concept","label":"ordered array","sources":[{"id":"nist-dads.orderedarry","title":"NIST Dictionary of Algorithms and Data Structures: orderedarry","url":"https://xlinux.nist.gov/dads/HTML/orderedarry.html"}],"status":"reported","summary":"NIST DADS defines ordered array as: An array whose items have some order. Usually, it means a sorted array , but may mean not fully ordered, for example, all values less than the median are in the first half.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedtree","kind":"concept","label":"ordered tree","sources":[{"id":"nist-dads.orderedtree","title":"NIST Dictionary of Algorithms and Data Structures: orderedtree","url":"https://xlinux.nist.gov/dads/HTML/orderedtree.html"}],"status":"reported","summary":"NIST DADS defines ordered tree as: A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogonaldrawing","kind":"concept","label":"orthogonal drawing","sources":[{"id":"nist-dads.orthogonaldrawing","title":"NIST Dictionary of Algorithms and Data Structures: orthogonalDrawing","url":"https://xlinux.nist.gov/dads/HTML/orthogonalDrawing.html"}],"status":"reported","summary":"NIST DADS defines orthogonal drawing as: A graph drawing in which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogonallists","kind":"concept","label":"orthogonal lists","sources":[{"id":"nist-dads.orthogonallists","title":"NIST Dictionary of Algorithms and Data Structures: orthogonalLists","url":"https://xlinux.nist.gov/dads/HTML/orthogonalLists.html"}],"status":"reported","summary":"NIST DADS defines orthogonal lists as: Lists that share items, but are structurally independent.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogoncnvx","kind":"concept","label":"orthogonally convex rectilinear polygon","sources":[{"id":"nist-dads.orthogoncnvx","title":"NIST Dictionary of Algorithms and Data Structures: orthogoncnvx","url":"https://xlinux.nist.gov/dads/HTML/orthogoncnvx.html"}],"status":"reported","summary":"NIST DADS defines orthogonally convex rectilinear polygon as: A rectilinear polygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.oscillatingmergesort","kind":"method","label":"oscillating merge sort","sources":[{"id":"nist-dads.oscillatingmergesort","title":"NIST Dictionary of Algorithms and Data Structures: oscillatingMergeSort","url":"https://xlinux.nist.gov/dads/HTML/oscillatingMergeSort.html"}],"status":"reported","summary":"NIST DADS defines oscillating merge sort as: Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward. Repeat until n-2 (backward) merged runs have been created, at which time they are merged. Continue building up powers of n-2 batches until done.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.outdegree","kind":"concept","label":"out-degree","sources":[{"id":"nist-dads.outdegree","title":"NIST Dictionary of Algorithms and Data Structures: outdegree","url":"https://xlinux.nist.gov/dads/HTML/outdegree.html"}],"status":"reported","summary":"NIST DADS defines out-degree as: The number of edges going out of a vertex in a directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.p","kind":"concept","label":"P","sources":[{"id":"nist-dads.p","title":"NIST Dictionary of Algorithms and Data Structures: p","url":"https://xlinux.nist.gov/dads/HTML/p.html"}],"status":"reported","summary":"NIST DADS defines P as: The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.packing","kind":"concept","label":"packing","sources":[{"id":"nist-dads.packing","title":"NIST Dictionary of Algorithms and Data Structures: packing","url":"https://xlinux.nist.gov/dads/HTML/packing.html"}],"status":"reported","summary":"NIST DADS defines packing as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.paddingrgmnt","kind":"concept","label":"padding argument","sources":[{"id":"nist-dads.paddingrgmnt","title":"NIST Dictionary of Algorithms and Data Structures: paddingrgmnt","url":"https://xlinux.nist.gov/dads/HTML/paddingrgmnt.html"}],"status":"reported","summary":"NIST DADS defines padding argument as: A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pagoda","kind":"concept","label":"pagoda","sources":[{"id":"nist-dads.pagoda","title":"NIST Dictionary of Algorithms and Data Structures: pagoda","url":"https://xlinux.nist.gov/dads/HTML/pagoda.html"}],"status":"reported","summary":"NIST DADS defines pagoda as: A priority queue implemented with a variant of a binary tree . The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child ) or rightmost (if it is a left child) descendant leaf . The basic operation is merge or meld , which maintains the heap property . An element is inserted by merging it as a singleton. The root is removed by merging its right and left children. Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parallel","kind":"concept","label":"parallel computation thesis","sources":[{"id":"nist-dads.parallel","title":"NIST Dictionary of Algorithms and Data Structures: parallel","url":"https://xlinux.nist.gov/dads/HTML/parallel.html"}],"status":"reported","summary":"NIST DADS defines parallel computation thesis as: Sequential space is a polynomial of parallel time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parallelrandomaccessmachine","kind":"concept","label":"parallel random-access machine","sources":[{"id":"nist-dads.parallelrandomaccessmachine","title":"NIST Dictionary of Algorithms and Data Structures: parallelRandomAccessMachine","url":"https://xlinux.nist.gov/dads/HTML/parallelRandomAccessMachine.html"}],"status":"reported","summary":"NIST DADS defines parallel random-access machine as: A shared memory model of computation , where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time. Also known as PRAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parent","kind":"concept","label":"parent","sources":[{"id":"nist-dads.parent","title":"NIST Dictionary of Algorithms and Data Structures: parent","url":"https://xlinux.nist.gov/dads/HTML/parent.html"}],"status":"reported","summary":"NIST DADS defines parent as: Of a node : the tree node conceptually above or closer to the root than the node and which has a link to the node. See the figure at tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialfunct","kind":"concept","label":"partial function","sources":[{"id":"nist-dads.partialfunct","title":"NIST Dictionary of Algorithms and Data Structures: partialfunct","url":"https://xlinux.nist.gov/dads/HTML/partialfunct.html"}],"status":"reported","summary":"NIST DADS defines partial function as: A function which is not defined for some inputs of the right type, that is, for some of a domain . For instance, division is a partial function since division by 0 is undefined (on the Reals).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallydecidableprob","kind":"concept","label":"partially decidable problem","sources":[{"id":"nist-dads.partiallydecidableprob","title":"NIST Dictionary of Algorithms and Data Structures: partiallyDecidableProb","url":"https://xlinux.nist.gov/dads/HTML/partiallyDecidableProb.html"}],"status":"reported","summary":"NIST DADS defines partially decidable problem as: One whose associated language is a recursively enumerable language . Equivalently, there exists an algorithm that halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallydynamicgraph","kind":"concept","label":"partially dynamic graph problem","sources":[{"id":"nist-dads.partiallydynamicgraph","title":"NIST Dictionary of Algorithms and Data Structures: partiallyDynamicGraph","url":"https://xlinux.nist.gov/dads/HTML/partiallyDynamicGraph.html"}],"status":"reported","summary":"NIST DADS defines partially dynamic graph problem as: Problem where the update operations include either edge insertions (incremental) or deletions (decremental).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallypersistdata","kind":"concept","label":"partially persistent data structure","sources":[{"id":"nist-dads.partiallypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: partiallyPersistData","url":"https://xlinux.nist.gov/dads/HTML/partiallyPersistData.html"}],"status":"reported","summary":"NIST DADS defines partially persistent data structure as: A persistent data structure that allows updates to the latest version only.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialorder","kind":"concept","label":"partial order","sources":[{"id":"nist-dads.partialorder","title":"NIST Dictionary of Algorithms and Data Structures: partialorder","url":"https://xlinux.nist.gov/dads/HTML/partialorder.html"}],"status":"reported","summary":"NIST DADS defines partial order as: An order defined for some, but not necessarily all, pairs of items. For instance, the sets {a, b} and {a, c, d} are subsets of {a, b, c, d}, but neither is a subset of the other. So \"subset of\" is a partial order on sets. Formal Definition: A partial order is a binary relation that is reflexive , transitive , and antisymmetric .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialrcrsv","kind":"concept","label":"partial recursive function","sources":[{"id":"nist-dads.partialrcrsv","title":"NIST Dictionary of Algorithms and Data Structures: partialrcrsv","url":"https://xlinux.nist.gov/dads/HTML/partialrcrsv.html"}],"status":"reported","summary":"NIST DADS defines partial recursive function as: A function computed by a Turing machine that need not halt for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.passivedatastruc","kind":"concept","label":"passive data structure","sources":[{"id":"nist-dads.passivedatastruc","title":"NIST Dictionary of Algorithms and Data Structures: passiveDataStruc","url":"https://xlinux.nist.gov/dads/HTML/passiveDataStruc.html"}],"status":"reported","summary":"NIST DADS defines passive data structure as: A data structure that is only changed by external threads or processes, in contrast to an active data structure .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pathsystem","kind":"concept","label":"path system problem","sources":[{"id":"nist-dads.pathsystem","title":"NIST Dictionary of Algorithms and Data Structures: pathsystem","url":"https://xlinux.nist.gov/dads/HTML/pathsystem.html"}],"status":"reported","summary":"NIST DADS defines path system problem as: For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pattern","kind":"concept","label":"pattern","sources":[{"id":"nist-dads.pattern","title":"NIST Dictionary of Algorithms and Data Structures: pattern","url":"https://xlinux.nist.gov/dads/HTML/pattern.html"}],"status":"reported","summary":"NIST DADS defines pattern as: A finite number of strings that are searched for in texts .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.patternelmnt","kind":"concept","label":"pattern element","sources":[{"id":"nist-dads.patternelmnt","title":"NIST Dictionary of Algorithms and Data Structures: patternelmnt","url":"https://xlinux.nist.gov/dads/HTML/patternelmnt.html"}],"status":"reported","summary":"NIST DADS defines pattern element as: A positive (negative) pattern element is a \"partial wild card\" presented as a subset of the alphabet Σ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pearsonshash","kind":"method","label":"Pearson's hash","sources":[{"id":"nist-dads.pearsonshash","title":"NIST Dictionary of Algorithms and Data Structures: pearsonshash","url":"https://xlinux.nist.gov/dads/HTML/pearsonshash.html"}],"status":"reported","summary":"NIST DADS defines Pearson's hash as: A hash function that uses an auxiliary array, but no shift or exclusive-or ( xor ) operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.perfectbinarytree","kind":"concept","label":"perfect binary tree","sources":[{"id":"nist-dads.perfectbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: perfectBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/perfectBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines perfect binary tree as: A binary tree with all leaf nodes at the same depth . All internal nodes have degree 2.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.perfectshuffle","kind":"method","label":"perfect shuffle","sources":[{"id":"nist-dads.perfectshuffle","title":"NIST Dictionary of Algorithms and Data Structures: perfectShuffle","url":"https://xlinux.nist.gov/dads/HTML/perfectShuffle.html"}],"status":"reported","summary":"NIST DADS defines perfect shuffle as: Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.perfectmatch","kind":"concept","label":"perfect matching","sources":[{"id":"nist-dads.perfectmatch","title":"NIST Dictionary of Algorithms and Data Structures: perfectmatch","url":"https://xlinux.nist.gov/dads/HTML/perfectmatch.html"}],"status":"reported","summary":"NIST DADS defines perfect matching as: A matching , or subset of edges without common vertices , of a connected graph that touches all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.performance","kind":"concept","label":"performance guarantee","sources":[{"id":"nist-dads.performance","title":"NIST Dictionary of Algorithms and Data Structures: performance","url":"https://xlinux.nist.gov/dads/HTML/performance.html"}],"status":"reported","summary":"NIST DADS defines performance guarantee as: An expression of the most the result of an approximation algorithm may depart from the optimal solution .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.permutation","kind":"method","label":"permutation","sources":[{"id":"nist-dads.permutation","title":"NIST Dictionary of Algorithms and Data Structures: permutation","url":"https://xlinux.nist.gov/dads/HTML/permutation.html"}],"status":"reported","summary":"NIST DADS defines permutation as: A rearrangement of elements, where none are lost, added, or changed. The Fisher-Yates shuffle randomly permutes elements. Also known as shuffle.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.permutationsort","kind":"method","label":"permutation sort","sources":[{"id":"nist-dads.permutationsort","title":"NIST Dictionary of Algorithms and Data Structures: permutationSort","url":"https://xlinux.nist.gov/dads/HTML/permutationSort.html"}],"status":"reported","summary":"NIST DADS defines permutation sort as: A terribly inefficient sort algorithm that generates each permutation of the items until the items are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.persistentdatastructure","kind":"concept","label":"persistent data structure","sources":[{"id":"nist-dads.persistentdatastructure","title":"NIST Dictionary of Algorithms and Data Structures: persistentDataStructure","url":"https://xlinux.nist.gov/dads/HTML/persistentDataStructure.html"}],"status":"reported","summary":"NIST DADS defines persistent data structure as: A data structure that preserves its old versions, that is, previous versions may be queried in addition to the latest version.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.phoneticcoding","kind":"concept","label":"phonetic coding","sources":[{"id":"nist-dads.phoneticcoding","title":"NIST Dictionary of Algorithms and Data Structures: phoneticCoding","url":"https://xlinux.nist.gov/dads/HTML/phoneticCoding.html"}],"status":"reported","summary":"NIST DADS defines phonetic coding as: Code a string based on how it is pronounced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pigeonholesort","kind":"method","label":"pigeonhole sort","sources":[{"id":"nist-dads.pigeonholesort","title":"NIST Dictionary of Algorithms and Data Structures: pigeonholeSort","url":"https://xlinux.nist.gov/dads/HTML/pigeonholeSort.html"}],"status":"reported","summary":"NIST DADS defines pigeonhole sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items. The first pass allocates an array of buckets , one bucket for each possible key value, then moves each item to its key's bucket. The second pass goes over the bucket array moving each item to the next place in the destination.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pile","kind":"concept","label":"pile","sources":[{"id":"nist-dads.pile","title":"NIST Dictionary of Algorithms and Data Structures: pile","url":"https://xlinux.nist.gov/dads/HTML/pile.html"}],"status":"reported","summary":"NIST DADS defines pile as: An ordered deque , that is, items may only be added to or removed from the head or the tail . An item is added to the head if it is smaller than the current head. An item is added to the tail if it is greater than the current tail. Items are never inserted into the middle, rather, an additional pile may be created.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pipelineddvd","kind":"method","label":"pipelined divide and conquer","sources":[{"id":"nist-dads.pipelineddvd","title":"NIST Dictionary of Algorithms and Data Structures: pipelineddvd","url":"https://xlinux.nist.gov/dads/HTML/pipelineddvd.html"}],"status":"reported","summary":"NIST DADS defines pipelined divide and conquer as: A divide and conquer paradigm in which partial results from recursive calls can be used before the calls complete. The technique is often useful for reducing the depth of an algorithm .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planargraph","kind":"concept","label":"planar graph","sources":[{"id":"nist-dads.planargraph","title":"NIST Dictionary of Algorithms and Data Structures: planargraph","url":"https://xlinux.nist.gov/dads/HTML/planargraph.html"}],"status":"reported","summary":"NIST DADS defines planar graph as: A graph that can be drawn in the plane with no crossing edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planarization","kind":"concept","label":"planarization","sources":[{"id":"nist-dads.planarization","title":"NIST Dictionary of Algorithms and Data Structures: planarization","url":"https://xlinux.nist.gov/dads/HTML/planarization.html"}],"status":"reported","summary":"NIST DADS defines planarization as: The process of transforming a graph into a planar graph . More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing vertices ). In both cases, the aim of planarization is minimize the number of edge removals or replacements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planarstrght","kind":"concept","label":"planar straight-line graph","sources":[{"id":"nist-dads.planarstrght","title":"NIST Dictionary of Algorithms and Data Structures: planarstrght","url":"https://xlinux.nist.gov/dads/HTML/planarstrght.html"}],"status":"reported","summary":"NIST DADS defines planar straight-line graph as: A graph that can be embedded in the plane without crossings in which every edge in the graph is a straight line segment. It is sometimes referred to as planar subdivision or map.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.plophashing","kind":"concept","label":"PLOP-hashing","sources":[{"id":"nist-dads.plophashing","title":"NIST Dictionary of Algorithms and Data Structures: plophashing","url":"https://xlinux.nist.gov/dads/HTML/plophashing.html"}],"status":"reported","summary":"NIST DADS defines PLOP-hashing as: Piecewise linear order-preserving (PLOP) hashing is a spatial access method which splits space into a nonperiodic grid. Each spatial dimension is divided by nodes of a binary tree . Object are stored in the grid cell of their centroid .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointaccessmethod","kind":"concept","label":"point access method","sources":[{"id":"nist-dads.pointaccessmethod","title":"NIST Dictionary of Algorithms and Data Structures: pointAccessMethod","url":"https://xlinux.nist.gov/dads/HTML/pointAccessMethod.html"}],"status":"reported","summary":"NIST DADS defines point access method as: A data structure and associated algorithms primarily to search for points defined in multidimensional space. Also known as PAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointerjumping","kind":"concept","label":"pointer jumping","sources":[{"id":"nist-dads.pointerjumping","title":"NIST Dictionary of Algorithms and Data Structures: pointerJumping","url":"https://xlinux.nist.gov/dads/HTML/pointerJumping.html"}],"status":"reported","summary":"NIST DADS defines pointer jumping as: In a linked structure, replacing a pointer with the pointer it points to. Used for various algorithms on lists and trees . Also known as recursive doubling, shortcutting.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointermachn","kind":"concept","label":"pointer machine","sources":[{"id":"nist-dads.pointermachn","title":"NIST Dictionary of Algorithms and Data Structures: pointermachn","url":"https://xlinux.nist.gov/dads/HTML/pointermachn.html"}],"status":"reported","summary":"NIST DADS defines pointer machine as: A model of computation whose memory consists of an unbounded collection of registers, or records, connected by pointers. Each register may contain an arbitrary amount of additional information. No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.poissonizatn","kind":"concept","label":"poissonization","sources":[{"id":"nist-dads.poissonizatn","title":"NIST Dictionary of Algorithms and Data Structures: poissonizatn","url":"https://xlinux.nist.gov/dads/HTML/poissonizatn.html"}],"status":"reported","summary":"NIST DADS defines poissonization as: To replace a deterministic input by poisson process, changing the model into a poisson model. A solution to the poisson model must be interpreted in the original model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polychotomy","kind":"concept","label":"polychotomy","sources":[{"id":"nist-dads.polychotomy","title":"NIST Dictionary of Algorithms and Data Structures: polychotomy","url":"https://xlinux.nist.gov/dads/HTML/polychotomy.html"}],"status":"reported","summary":"NIST DADS defines polychotomy as: Division into many distinct classifications.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polynomaprox","kind":"method","label":"polynomial approximation scheme","sources":[{"id":"nist-dads.polynomaprox","title":"NIST Dictionary of Algorithms and Data Structures: polynomaprox","url":"https://xlinux.nist.gov/dads/HTML/polynomaprox.html"}],"status":"reported","summary":"NIST DADS defines polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a (1+ε)-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of ε. Sometimes referred to more precisely as polynomial-time approximation scheme. Also known as PTAS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomhier","kind":"concept","label":"polynomial hierarchy","sources":[{"id":"nist-dads.polynomhier","title":"NIST Dictionary of Algorithms and Data Structures: polynomhier","url":"https://xlinux.nist.gov/dads/HTML/polynomhier.html"}],"status":"reported","summary":"NIST DADS defines polynomial hierarchy as: The classes of languages accepted by k- alternating Turing machines , over all k≥ 0 and with initial state existential or universal. The bottom level (k=0) is the class P . The next level (k=1) comprises NP and co- NP .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomtredc","kind":"concept","label":"polynomial-time reduction","sources":[{"id":"nist-dads.polynomtredc","title":"NIST Dictionary of Algorithms and Data Structures: polynomtredc","url":"https://xlinux.nist.gov/dads/HTML/polynomtredc.html"}],"status":"reported","summary":"NIST DADS defines polynomial-time reduction as: A transformation of one problem into another which is computable in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polyphmerge","kind":"method","label":"polyphase merge","sources":[{"id":"nist-dads.polyphmerge","title":"NIST Dictionary of Algorithms and Data Structures: polyphmerge","url":"https://xlinux.nist.gov/dads/HTML/polyphmerge.html"}],"status":"reported","summary":"NIST DADS defines polyphase merge as: A nonbalanced k-way merge which reduces the number of output files needed by reusing the emptied input file or device as one of the output devices. This is most efficient if the number of output runs in each output file is different.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polyphmrgsrt","kind":"method","label":"polyphase merge sort","sources":[{"id":"nist-dads.polyphmrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: polyphmrgsrt","url":"https://xlinux.nist.gov/dads/HTML/polyphmrgsrt.html"}],"status":"reported","summary":"NIST DADS defines polyphase merge sort as: A merge sort algorithm that reduces the number of intermediate files needed by reusing emptied files.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polytope","kind":"concept","label":"polytope","sources":[{"id":"nist-dads.polytope","title":"NIST Dictionary of Algorithms and Data Structures: polytope","url":"https://xlinux.nist.gov/dads/HTML/polytope.html"}],"status":"reported","summary":"NIST DADS defines polytope as: A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides. A generalization of polyhedron.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.poset","kind":"concept","label":"poset","sources":[{"id":"nist-dads.poset","title":"NIST Dictionary of Algorithms and Data Structures: poset","url":"https://xlinux.nist.gov/dads/HTML/poset.html"}],"status":"reported","summary":"NIST DADS defines poset as: A set the elements of which are subject to a partial order . Also known as partially ordered set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.postmansort","kind":"method","label":"postman's sort","sources":[{"id":"nist-dads.postmansort","title":"NIST Dictionary of Algorithms and Data Structures: postmansort","url":"https://xlinux.nist.gov/dads/HTML/postmansort.html"}],"status":"reported","summary":"NIST DADS defines postman's sort as: A highly engineered variant of top-down radix sort where attributes of the key are described so the algorithm can allocate buckets and distribute efficiently.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.postordertraversal","kind":"method","label":"postorder traversal","sources":[{"id":"nist-dads.postordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: postorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/postorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines postorder traversal as: Process all nodes of a tree by recursively processing all subtrees, then finally processing the root . Also known as postfix traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.postscorrespondprob","kind":"concept","label":"Post's correspondence problem","sources":[{"id":"nist-dads.postscorrespondprob","title":"NIST Dictionary of Algorithms and Data Structures: postsCorrespondProb","url":"https://xlinux.nist.gov/dads/HTML/postsCorrespondProb.html"}],"status":"reported","summary":"NIST DADS defines Post's correspondence problem as: Given a set of pairs of strings , find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem . Also known as PCP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.potentialfnc","kind":"concept","label":"potential function","sources":[{"id":"nist-dads.potentialfnc","title":"NIST Dictionary of Algorithms and Data Structures: potentialfnc","url":"https://xlinux.nist.gov/dads/HTML/potentialfnc.html"}],"status":"reported","summary":"NIST DADS defines potential function as: A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.predicate","kind":"concept","label":"predicate","sources":[{"id":"nist-dads.predicate","title":"NIST Dictionary of Algorithms and Data Structures: predicate","url":"https://xlinux.nist.gov/dads/HTML/predicate.html"}],"status":"reported","summary":"NIST DADS defines predicate as: A function that returns true or false. Conceptually it tests for a condition.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prefix","kind":"concept","label":"prefix","sources":[{"id":"nist-dads.prefix","title":"NIST Dictionary of Algorithms and Data Structures: prefix","url":"https://xlinux.nist.gov/dads/HTML/prefix.html"}],"status":"reported","summary":"NIST DADS defines prefix as: The beginning characters of a string . More formally a string v∈Σ * is a prefix of a string u∈Σ * if u=vu' for some string u'∈Σ * .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prefixcode","kind":"concept","label":"prefix code","sources":[{"id":"nist-dads.prefixcode","title":"NIST Dictionary of Algorithms and Data Structures: prefixcode","url":"https://xlinux.nist.gov/dads/HTML/prefixcode.html"}],"status":"reported","summary":"NIST DADS defines prefix code as: Set of words such that no word of the set is a prefix of another word in the set. A prefix code may be represented by a coding tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.preordertraversal","kind":"method","label":"preorder traversal","sources":[{"id":"nist-dads.preordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: preorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/preorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines preorder traversal as: Process all nodes of a tree by processing the root , then recursively processing all subtrees. Also known as prefix traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primaryclustering","kind":"concept","label":"primary clustering","sources":[{"id":"nist-dads.primaryclustering","title":"NIST Dictionary of Algorithms and Data Structures: primaryClustering","url":"https://xlinux.nist.gov/dads/HTML/primaryClustering.html"}],"status":"reported","summary":"NIST DADS defines primary clustering as: The tendency for some collision resolution schemes to create long runs of filled slots near the hash function position of keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primitivealgorithm","kind":"concept","label":"primitive algorithm","sources":[{"id":"nist-dads.primitivealgorithm","title":"NIST Dictionary of Algorithms and Data Structures: primitiveAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/primitiveAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines primitive algorithm as: An algorithm in which all the computable steps are basic operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primitiverecursive","kind":"concept","label":"primitive recursive","sources":[{"id":"nist-dads.primitiverecursive","title":"NIST Dictionary of Algorithms and Data Structures: primitiveRecursive","url":"https://xlinux.nist.gov/dads/HTML/primitiveRecursive.html"}],"status":"reported","summary":"NIST DADS defines primitive recursive as: A total function that can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.principle","kind":"concept","label":"principle of optimality","sources":[{"id":"nist-dads.principle","title":"NIST Dictionary of Algorithms and Data Structures: principle","url":"https://xlinux.nist.gov/dads/HTML/principle.html"}],"status":"reported","summary":"NIST DADS defines principle of optimality as: In some optimization problems , components of a globally optimal solution are themselves globally optimal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prisonersdilemma","kind":"concept","label":"prisoner's dilemma","sources":[{"id":"nist-dads.prisonersdilemma","title":"NIST Dictionary of Algorithms and Data Structures: prisonersDilemma","url":"https://xlinux.nist.gov/dads/HTML/prisonersDilemma.html"}],"status":"reported","summary":"NIST DADS defines prisoner's dilemma as: Two prisoners are questioned separately about a crime they committed. Each may give evidence against the other or may say nothing. If both say nothing, they get a minor reprimand and go free because of lack of evidence. If one gives evidence and the other says nothing, the first goes free and the second is severely punished. If both give evidence, both are severely punished. The overall (globally) best strategy is for both to say nothing. However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome. In general, a situation where local optimization leads to the worst possible outcome globally.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probabilisticallycheckableproof","kind":"concept","label":"probabilistically checkable proof","sources":[{"id":"nist-dads.probabilisticallycheckableproof","title":"NIST Dictionary of Algorithms and Data Structures: probabilisticallyCheckableProof","url":"https://xlinux.nist.gov/dads/HTML/probabilisticallyCheckableProof.html"}],"status":"reported","summary":"NIST DADS defines probabilistically checkable proof as: An interactive proof system in which provers follow a fixed strategy, that is, one not affected by any messages from the verifier. The prover's strategy for a given instance x of a decision problem can be represented by a finite oracle language B x , which constitutes a proof of the correct answer for x.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probablalgo","kind":"concept","label":"probabilistic algorithm","sources":[{"id":"nist-dads.probablalgo","title":"NIST Dictionary of Algorithms and Data Structures: probablAlgo","url":"https://xlinux.nist.gov/dads/HTML/probablAlgo.html"}],"status":"reported","summary":"NIST DADS defines probabilistic algorithm as: Any algorithm that works for all practical purposes but has a theoretical chance of being wrong.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probablturng","kind":"concept","label":"probabilistic Turing machine","sources":[{"id":"nist-dads.probablturng","title":"NIST Dictionary of Algorithms and Data Structures: probablturng","url":"https://xlinux.nist.gov/dads/HTML/probablturng.html"}],"status":"reported","summary":"NIST DADS defines probabilistic Turing machine as: A Turing machine in which some transitions are random choices among finitely many alternatives.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probesequenc","kind":"concept","label":"probe sequence","sources":[{"id":"nist-dads.probesequenc","title":"NIST Dictionary of Algorithms and Data Structures: probesequenc","url":"https://xlinux.nist.gov/dads/HTML/probesequenc.html"}],"status":"reported","summary":"NIST DADS defines probe sequence as: The list of locations which a method for open addressing produces as alternatives in case of a collision .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.procedure","kind":"concept","label":"procedure","sources":[{"id":"nist-dads.procedure","title":"NIST Dictionary of Algorithms and Data Structures: procedure","url":"https://xlinux.nist.gov/dads/HTML/procedure.html"}],"status":"reported","summary":"NIST DADS defines procedure as: A subroutine which does not return a value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.processalgbr","kind":"concept","label":"process algebra","sources":[{"id":"nist-dads.processalgbr","title":"NIST Dictionary of Algorithms and Data Structures: processalgbr","url":"https://xlinux.nist.gov/dads/HTML/processalgbr.html"}],"status":"reported","summary":"NIST DADS defines process algebra as: An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.proper","kind":"concept","label":"proper","sources":[{"id":"nist-dads.proper","title":"NIST Dictionary of Algorithms and Data Structures: proper","url":"https://xlinux.nist.gov/dads/HTML/proper.html"}],"status":"reported","summary":"NIST DADS defines proper as: (1) A subunit of a unit is not equal to the unit itself. For instance, a proper substring is not the whole string , a proper subset is not the whole set , a proper subgraph is not the whole graph , etc. (2) According to a rule, as in proper coloring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.propercolor","kind":"concept","label":"proper coloring","sources":[{"id":"nist-dads.propercolor","title":"NIST Dictionary of Algorithms and Data Structures: propercolor","url":"https://xlinux.nist.gov/dads/HTML/propercolor.html"}],"status":"reported","summary":"NIST DADS defines proper coloring as: A vertex coloring or edge coloring of a graph in which no two adjacent vertices or edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.propersubset","kind":"concept","label":"proper subset","sources":[{"id":"nist-dads.propersubset","title":"NIST Dictionary of Algorithms and Data Structures: propersubset","url":"https://xlinux.nist.gov/dads/HTML/propersubset.html"}],"status":"reported","summary":"NIST DADS defines proper subset as: A set S 2 is a proper subset of another set S 1 if every element in S 2 is in S 1 and S 1 has some elements which are not in S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.prunensearch","kind":"method","label":"prune and search","sources":[{"id":"nist-dads.prunensearch","title":"NIST Dictionary of Algorithms and Data Structures: pruneNsearch","url":"https://xlinux.nist.gov/dads/HTML/pruneNsearch.html"}],"status":"reported","summary":"NIST DADS defines prune and search as: Find an optimal value by eliminating a constant fraction of remaining objects at each step. Eliminated objects are guaranteed not to affect the optimal value. A logarithmic number of steps reduces the number of objects to a constant, and a brute force approach can then solve it. Also known as decimation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pseudorandomnumbergen","kind":"method","label":"pseudo-random number generator","sources":[{"id":"nist-dads.pseudorandomnumbergen","title":"NIST Dictionary of Algorithms and Data Structures: pseudorandomNumberGen","url":"https://xlinux.nist.gov/dads/HTML/pseudorandomNumberGen.html"}],"status":"reported","summary":"NIST DADS defines pseudo-random number generator as: A deterministic algorithm to generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties. Also known as PRNG, deterministic random bit generator, DRBG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ptree","kind":"concept","label":"P-tree","sources":[{"id":"nist-dads.ptree","title":"NIST Dictionary of Algorithms and Data Structures: ptree","url":"https://xlinux.nist.gov/dads/HTML/ptree.html"}],"status":"reported","summary":"NIST DADS defines P-tree as: (1) A spatial access method that defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel. Space is split by hierarchically nested polytopes (multidimensional boxes with nonrectangular sides). The R-tree is a special case that has no additional hyperplanes. (2) A spatial access method that splits space by hierarchically nested polytopes. The R-tree is a special case in which all polytopes are boxes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.purelyfnctnl","kind":"concept","label":"purely functional language","sources":[{"id":"nist-dads.purelyfnctnl","title":"NIST Dictionary of Algorithms and Data Structures: purelyfnctnl","url":"https://xlinux.nist.gov/dads/HTML/purelyfnctnl.html"}],"status":"reported","summary":"NIST DADS defines purely functional language as: A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pushdownautm","kind":"concept","label":"pushdown automaton","sources":[{"id":"nist-dads.pushdownautm","title":"NIST Dictionary of Algorithms and Data Structures: pushdownautm","url":"https://xlinux.nist.gov/dads/HTML/pushdownautm.html"}],"status":"reported","summary":"NIST DADS defines pushdown automaton as: A restricted Turing machine where the tape acts as a pushdown store (or stack , where only the latest element can be read), with an extra one-way read-only input tape. Also known as PDA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.qsort","kind":"method","label":"q sort","sources":[{"id":"nist-dads.qsort","title":"NIST Dictionary of Algorithms and Data Structures: qsort","url":"https://xlinux.nist.gov/dads/HTML/qsort.html"}],"status":"reported","summary":"NIST DADS defines q sort as: The sort function in many libraries. It is generally a combination of quicksort, for many items, and insertion sort , for a few items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quadraticprb","kind":"method","label":"quadratic probing","sources":[{"id":"nist-dads.quadraticprb","title":"NIST Dictionary of Algorithms and Data Structures: quadraticprb","url":"https://xlinux.nist.gov/dads/HTML/quadraticprb.html"}],"status":"reported","summary":"NIST DADS defines quadratic probing as: A method of open addressing for a hash table in which a collision is resolved by putting the item in the next empty place given by a probe sequence . The space between places in the sequence increases quadratically.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.quadtrie","kind":"concept","label":"quad trie","sources":[{"id":"nist-dads.quadtrie","title":"NIST Dictionary of Algorithms and Data Structures: quadtrie","url":"https://xlinux.nist.gov/dads/HTML/quadtrie.html"}],"status":"reported","summary":"NIST DADS defines quad trie as: A tree in which each node is split according to some subset of the key , typically a character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.quantumcomputation","kind":"concept","label":"quantum computation","sources":[{"id":"nist-dads.quantumcomputation","title":"NIST Dictionary of Algorithms and Data Structures: quantumComputation","url":"https://xlinux.nist.gov/dads/HTML/quantumComputation.html"}],"status":"reported","summary":"NIST DADS defines quantum computation as: Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quicksearch","kind":"method","label":"quick search","sources":[{"id":"nist-dads.quicksearch","title":"NIST Dictionary of Algorithms and Data Structures: quicksearch","url":"https://xlinux.nist.gov/dads/HTML/quicksearch.html"}],"status":"reported","summary":"NIST DADS defines quick search as: A string matching algorithm that compares characters from the end of the search string to its beginning. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.raggedmatrix","kind":"concept","label":"ragged matrix","sources":[{"id":"nist-dads.raggedmatrix","title":"NIST Dictionary of Algorithms and Data Structures: raggedmatrix","url":"https://xlinux.nist.gov/dads/HTML/raggedmatrix.html"}],"status":"reported","summary":"NIST DADS defines ragged matrix as: A matrix having irregular numbers of items in each row.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomsearch","kind":"method","label":"random search","sources":[{"id":"nist-dads.randomsearch","title":"NIST Dictionary of Algorithms and Data Structures: randomSearch","url":"https://xlinux.nist.gov/dads/HTML/randomSearch.html"}],"status":"reported","summary":"NIST DADS defines random search as: Repeatedly check items in an array at random until successful.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomaccess","kind":"concept","label":"random access machine","sources":[{"id":"nist-dads.randomaccess","title":"NIST Dictionary of Algorithms and Data Structures: randomaccess","url":"https://xlinux.nist.gov/dads/HTML/randomaccess.html"}],"status":"reported","summary":"NIST DADS defines random access machine as: A model of computation whose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomizdrnd","kind":"method","label":"randomized rounding","sources":[{"id":"nist-dads.randomizdrnd","title":"NIST Dictionary of Algorithms and Data Structures: randomizdrnd","url":"https://xlinux.nist.gov/dads/HTML/randomizdrnd.html"}],"status":"reported","summary":"NIST DADS defines randomized rounding as: A probabilistic method to convert a solution of a relaxed problem into an approximate solution to the original problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedalgo","kind":"concept","label":"randomized algorithm","sources":[{"id":"nist-dads.randomizedalgo","title":"NIST Dictionary of Algorithms and Data Structures: randomizedAlgo","url":"https://xlinux.nist.gov/dads/HTML/randomizedAlgo.html"}],"status":"reported","summary":"NIST DADS defines randomized algorithm as: An algorithm that makes random (or pseudorandom) choices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedbinarysearchtree","kind":"concept","label":"randomized binary search tree","sources":[{"id":"nist-dads.randomizedbinarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: randomizedBinarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/randomizedBinarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines randomized binary search tree as: A binary search tree in which nodes have a randomly assigned priority. Updates keep priorities in heap order instead of keeping balance information and doing rebalance operations. Also known as cartesian tree, RBST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedcomplexity","kind":"concept","label":"randomized complexity","sources":[{"id":"nist-dads.randomizedcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: randomizedComplexity","url":"https://xlinux.nist.gov/dads/HTML/randomizedComplexity.html"}],"status":"reported","summary":"NIST DADS defines randomized complexity as: The expected running time of the best possible randomized algorithm over the worst input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomsampl","kind":"method","label":"random sampling","sources":[{"id":"nist-dads.randomsampl","title":"NIST Dictionary of Algorithms and Data Structures: randomsampl","url":"https://xlinux.nist.gov/dads/HTML/randomsampl.html"}],"status":"reported","summary":"NIST DADS defines random sampling as: Using a randomly selected sample of the data to help solve a problem on the whole data.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.range","kind":"concept","label":"range","sources":[{"id":"nist-dads.range","title":"NIST Dictionary of Algorithms and Data Structures: range","url":"https://xlinux.nist.gov/dads/HTML/range.html"}],"status":"reported","summary":"NIST DADS defines range as: The possible results of a function or relation . For instance, the range of cosine is [-1,+1].","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rangesort","kind":"method","label":"range sort","sources":[{"id":"nist-dads.rangesort","title":"NIST Dictionary of Algorithms and Data Structures: rangesort","url":"https://xlinux.nist.gov/dads/HTML/rangesort.html"}],"status":"reported","summary":"NIST DADS defines range sort as: A bucket sort where the function to determine the bucket is based on the range of possible keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rank","kind":"concept","label":"rank","sources":[{"id":"nist-dads.rank","title":"NIST Dictionary of Algorithms and Data Structures: rank","url":"https://xlinux.nist.gov/dads/HTML/rank.html"}],"status":"reported","summary":"NIST DADS defines rank as: For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rapidsort","kind":"method","label":"rapid sort","sources":[{"id":"nist-dads.rapidsort","title":"NIST Dictionary of Algorithms and Data Structures: rapidSort","url":"https://xlinux.nist.gov/dads/HTML/rapidSort.html"}],"status":"reported","summary":"NIST DADS defines rapid sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary array . The second pass goes over the auxiliary array writing the counted number of keys to the destination.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ratcliffobershelp","kind":"method","label":"Ratcliff/Obershelp pattern recognition","sources":[{"id":"nist-dads.ratcliffobershelp","title":"NIST Dictionary of Algorithms and Data Structures: ratcliffObershelp","url":"https://xlinux.nist.gov/dads/HTML/ratcliffObershelp.html"}],"status":"reported","summary":"NIST DADS defines Ratcliff/Obershelp pattern recognition as: Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common substring plus, recursively, matching characters in the unmatched region on either side of the longest common substring.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reachable","kind":"concept","label":"reachable","sources":[{"id":"nist-dads.reachable","title":"NIST Dictionary of Algorithms and Data Structures: reachable","url":"https://xlinux.nist.gov/dads/HTML/reachable.html"}],"status":"reported","summary":"NIST DADS defines reachable as: A vertex v is reachable from another vertex u if there is a path of any length from u to v. Also known as reachability.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rebalance","kind":"method","label":"rebalance","sources":[{"id":"nist-dads.rebalance","title":"NIST Dictionary of Algorithms and Data Structures: rebalance","url":"https://xlinux.nist.gov/dads/HTML/rebalance.html"}],"status":"reported","summary":"NIST DADS defines rebalance as: Restore balance to a tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recognizer","kind":"concept","label":"recognizer","sources":[{"id":"nist-dads.recognizer","title":"NIST Dictionary of Algorithms and Data Structures: recognizer","url":"https://xlinux.nist.gov/dads/HTML/recognizer.html"}],"status":"reported","summary":"NIST DADS defines recognizer as: A finite state machine with one or more states designated as accepting states . An input string is accepted if there is a path from the start state to an accepting state.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectangmatrx","kind":"concept","label":"rectangular matrix","sources":[{"id":"nist-dads.rectangmatrx","title":"NIST Dictionary of Algorithms and Data Structures: rectangmatrx","url":"https://xlinux.nist.gov/dads/HTML/rectangmatrx.html"}],"status":"reported","summary":"NIST DADS defines rectangular matrix as: An n × m matrix , or, one whose size may not be the same in both dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectilinear","kind":"concept","label":"rectilinear","sources":[{"id":"nist-dads.rectilinear","title":"NIST Dictionary of Algorithms and Data Structures: rectilinear","url":"https://xlinux.nist.gov/dads/HTML/rectilinear.html"}],"status":"reported","summary":"NIST DADS defines rectilinear as: Distance, paths, lines, etc. which are always parallel to axes at right angles. For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectilinearsteinertree","kind":"concept","label":"rectilinear Steiner tree","sources":[{"id":"nist-dads.rectilinearsteinertree","title":"NIST Dictionary of Algorithms and Data Structures: rectilinearSteinertree","url":"https://xlinux.nist.gov/dads/HTML/rectilinearSteinertree.html"}],"status":"reported","summary":"NIST DADS defines rectilinear Steiner tree as: A minimum-length rectilinear tree connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recurrence","kind":"concept","label":"recurrence relation","sources":[{"id":"nist-dads.recurrence","title":"NIST Dictionary of Algorithms and Data Structures: recurrence","url":"https://xlinux.nist.gov/dads/HTML/recurrence.html"}],"status":"reported","summary":"NIST DADS defines recurrence relation as: The specification of a sequence of values in terms of earlier values in the sequence and base values. Also known as recurrence equations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursiontree","kind":"concept","label":"recursion tree","sources":[{"id":"nist-dads.recursiontree","title":"NIST Dictionary of Algorithms and Data Structures: recursionTree","url":"https://xlinux.nist.gov/dads/HTML/recursionTree.html"}],"status":"reported","summary":"NIST DADS defines recursion tree as: A method to analyze the complexity of an algorithm by diagramming the recursive function calls. Formal Definition: A recursion tree T(p) of degree p is either (i) null or (ii) has p children which are recursion trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursiontrm","kind":"concept","label":"recursion termination","sources":[{"id":"nist-dads.recursiontrm","title":"NIST Dictionary of Algorithms and Data Structures: recursiontrm","url":"https://xlinux.nist.gov/dads/HTML/recursiontrm.html"}],"status":"reported","summary":"NIST DADS defines recursion termination as: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursive","kind":"concept","label":"recursive","sources":[{"id":"nist-dads.recursive","title":"NIST Dictionary of Algorithms and Data Structures: recursive","url":"https://xlinux.nist.gov/dads/HTML/recursive.html"}],"status":"reported","summary":"NIST DADS defines recursive as: (1) A data structure that is partially composed of other instances of the data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements. (2) An algorithm in which functions might call themselves. For instance, quicksort or heapify .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursivelyenumerablelang","kind":"concept","label":"recursively enumerable language","sources":[{"id":"nist-dads.recursivelyenumerablelang","title":"NIST Dictionary of Algorithms and Data Structures: recursivelyEnumerableLang","url":"https://xlinux.nist.gov/dads/HTML/recursivelyEnumerableLang.html"}],"status":"reported","summary":"NIST DADS defines recursively enumerable language as: A language accepted by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursivstrc","kind":"concept","label":"recursive data structure","sources":[{"id":"nist-dads.recursivstrc","title":"NIST Dictionary of Algorithms and Data Structures: recursivstrc","url":"https://xlinux.nist.gov/dads/HTML/recursivstrc.html"}],"status":"reported","summary":"NIST DADS defines recursive data structure as: A data structure that is partially composed of smaller or simpler instances of the same data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reducedbasis","kind":"concept","label":"reduced basis","sources":[{"id":"nist-dads.reducedbasis","title":"NIST Dictionary of Algorithms and Data Structures: reducedbasis","url":"https://xlinux.nist.gov/dads/HTML/reducedbasis.html"}],"status":"reported","summary":"NIST DADS defines reduced basis as: A basis for a lattice that is nearly orthogonal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reduction","kind":"concept","label":"reduction","sources":[{"id":"nist-dads.reduction","title":"NIST Dictionary of Algorithms and Data Structures: reduction","url":"https://xlinux.nist.gov/dads/HTML/reduction.html"}],"status":"reported","summary":"NIST DADS defines reduction as: A computable transformation of one problem into another.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reflexive","kind":"concept","label":"reflexive","sources":[{"id":"nist-dads.reflexive","title":"NIST Dictionary of Algorithms and Data Structures: reflexive","url":"https://xlinux.nist.gov/dads/HTML/reflexive.html"}],"status":"reported","summary":"NIST DADS defines reflexive as: A binary relation R for which a R a for all a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.regular","kind":"concept","label":"regular decomposition","sources":[{"id":"nist-dads.regular","title":"NIST Dictionary of Algorithms and Data Structures: regular","url":"https://xlinux.nist.gov/dads/HTML/regular.html"}],"status":"reported","summary":"NIST DADS defines regular decomposition as: A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relation","kind":"concept","label":"relation","sources":[{"id":"nist-dads.relation","title":"NIST Dictionary of Algorithms and Data Structures: relation","url":"https://xlinux.nist.gov/dads/HTML/relation.html"}],"status":"reported","summary":"NIST DADS defines relation as: A computation which takes some inputs and yields an output. Any particular input may yield different outputs at different times. Formally, a mapping from each element in the domain to one or more elements in the range .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relational","kind":"concept","label":"relational structure","sources":[{"id":"nist-dads.relational","title":"NIST Dictionary of Algorithms and Data Structures: relational","url":"https://xlinux.nist.gov/dads/HTML/relational.html"}],"status":"reported","summary":"NIST DADS defines relational structure as: The counterpart in formal logic of a data structure or class instance in the object-oriented sense. Examples are strings , directed graphs , and undirected graphs . Sets of relational structures generalize the notion of languages as sets of strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relativeperformguar","kind":"concept","label":"relative performance guarantee","sources":[{"id":"nist-dads.relativeperformguar","title":"NIST Dictionary of Algorithms and Data Structures: relativePerformGuar","url":"https://xlinux.nist.gov/dads/HTML/relativePerformGuar.html"}],"status":"reported","summary":"NIST DADS defines relative performance guarantee as: The maximum ratio by which the result of a ρ-approximation algorithm may depart from the optimal solution . Also known as performance ratio.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relaxation","kind":"concept","label":"relaxation","sources":[{"id":"nist-dads.relaxation","title":"NIST Dictionary of Algorithms and Data Structures: relaxation","url":"https://xlinux.nist.gov/dads/HTML/relaxation.html"}],"status":"reported","summary":"NIST DADS defines relaxation as: An optimization problem with an enlarged feasible region (and extended objective function ) compared with an original optimization problem. Typically, the relaxation is considerably easier to solve than the original.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relaxedbalance","kind":"concept","label":"relaxed balance","sources":[{"id":"nist-dads.relaxedbalance","title":"NIST Dictionary of Algorithms and Data Structures: relaxedBalance","url":"https://xlinux.nist.gov/dads/HTML/relaxedBalance.html"}],"status":"reported","summary":"NIST DADS defines relaxed balance as: When rebalancing a search tree is independent of updating the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.repeatedsquaring","kind":"method","label":"repeated squaring","sources":[{"id":"nist-dads.repeatedsquaring","title":"NIST Dictionary of Algorithms and Data Structures: repeatedSquaring","url":"https://xlinux.nist.gov/dads/HTML/repeatedSquaring.html"}],"status":"reported","summary":"NIST DADS defines repeated squaring as: Compute the n th power of an expression in Θ(log n) steps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rescalable","kind":"concept","label":"rescalable","sources":[{"id":"nist-dads.rescalable","title":"NIST Dictionary of Algorithms and Data Structures: rescalable","url":"https://xlinux.nist.gov/dads/HTML/rescalable.html"}],"status":"reported","summary":"NIST DADS defines rescalable as: An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the objective function for the second instance is (element-wise) λ times the objective function of the first instance. For such problems, the best one can hope for is a relative performance guarantee , not an absolute performance guarantee .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.reservoirsampling","kind":"method","label":"reservoir sampling","sources":[{"id":"nist-dads.reservoirsampling","title":"NIST Dictionary of Algorithms and Data Structures: reservoirSampling","url":"https://xlinux.nist.gov/dads/HTML/reservoirSampling.html"}],"status":"reported","summary":"NIST DADS defines reservoir sampling as: Randomly select k items from a stream of items of unknown length. Save the first k items in an array of size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive). If M ≤ k, replace item M of the array with item j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.restricted","kind":"concept","label":"restricted universe sort","sources":[{"id":"nist-dads.restricted","title":"NIST Dictionary of Algorithms and Data Structures: restricted","url":"https://xlinux.nist.gov/dads/HTML/restricted.html"}],"status":"reported","summary":"NIST DADS defines restricted universe sort as: A sort algorithm that operates on the basis that the keys are members of a restricted set of values. They may not require comparisons of keys to perform the sorting.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rfile","kind":"concept","label":"R-file","sources":[{"id":"nist-dads.rfile","title":"NIST Dictionary of Algorithms and Data Structures: rfile","url":"https://xlinux.nist.gov/dads/HTML/rfile.html"}],"status":"reported","summary":"NIST DADS defines R-file as: A spatial access method which divides space into a hierarchically of nested boxes. Objects are indexed in the lowest cell which completely contains them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rhoapproxmtn","kind":"method","label":"ρ-approximation algorithm","sources":[{"id":"nist-dads.rhoapproxmtn","title":"NIST Dictionary of Algorithms and Data Structures: rhoapproxmtn","url":"https://xlinux.nist.gov/dads/HTML/rhoapproxmtn.html"}],"status":"reported","summary":"NIST DADS defines ρ-approximation algorithm as: An approximation algorithm guaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or relative performance guarantee of the algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ricesmethod","kind":"concept","label":"Rice's method","sources":[{"id":"nist-dads.ricesmethod","title":"NIST Dictionary of Algorithms and Data Structures: ricesmethod","url":"https://xlinux.nist.gov/dads/HTML/ricesmethod.html"}],"status":"reported","summary":"NIST DADS defines Rice's method as: A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rightthreadedtree","kind":"concept","label":"right-threaded tree","sources":[{"id":"nist-dads.rightthreadedtree","title":"NIST Dictionary of Algorithms and Data Structures: rightThreadedTree","url":"https://xlinux.nist.gov/dads/HTML/rightThreadedTree.html"}],"status":"reported","summary":"NIST DADS defines right-threaded tree as: A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rightrotatn","kind":"method","label":"right rotation","sources":[{"id":"nist-dads.rightrotatn","title":"NIST Dictionary of Algorithms and Data Structures: rightrotatn","url":"https://xlinux.nist.gov/dads/HTML/rightrotatn.html"}],"status":"reported","summary":"NIST DADS defines right rotation as: (1) In a binary search tree , pushing a node N down and to the right to balance the tree. N's left child replaces N, and the left child's right child becomes N's left child. (2) In an array , moving all items to the next higher location. The last item is moved to the first location, which is now vacant. (3) In a list , removing the tail and inserting it at the head . Also known as rotate right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.robinhoodhashing","kind":"method","label":"Robin Hood hashing","sources":[{"id":"nist-dads.robinhoodhashing","title":"NIST Dictionary of Algorithms and Data Structures: robinHoodHashing","url":"https://xlinux.nist.gov/dads/HTML/robinHoodHashing.html"}],"status":"reported","summary":"NIST DADS defines Robin Hood hashing as: In case of collision , the item with the longer probe sequence stays in the position. The other item is moved. This tends to equalize the length of probe sequences.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rootedtree","kind":"concept","label":"rooted tree","sources":[{"id":"nist-dads.rootedtree","title":"NIST Dictionary of Algorithms and Data Structures: rootedtree","url":"https://xlinux.nist.gov/dads/HTML/rootedtree.html"}],"status":"reported","summary":"NIST DADS defines rooted tree as: A tree in which one node is designated as the root . Also known as oriented tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rotation","kind":"concept","label":"rotation","sources":[{"id":"nist-dads.rotation","title":"NIST Dictionary of Algorithms and Data Structures: rotation","url":"https://xlinux.nist.gov/dads/HTML/rotation.html"}],"status":"reported","summary":"NIST DADS defines rotation as: To switch children and parents among two or three adjacent nodes to restore balance to a tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rp","kind":"concept","label":"RP","sources":[{"id":"nist-dads.rp","title":"NIST Dictionary of Algorithms and Data Structures: rp","url":"https://xlinux.nist.gov/dads/HTML/rp.html"}],"status":"reported","summary":"NIST DADS defines RP as: The class of languages for which membership can be determined in polynomial time by a probabilistic Turing machine with no false acceptances and less than half false rejections. \"RP\" means \" R andomized P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that accepts or rejects any string in polynomial time . If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2. Also known as randomized polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rtree","kind":"concept","label":"R-tree","sources":[{"id":"nist-dads.rtree","title":"NIST Dictionary of Algorithms and Data Structures: rtree","url":"https://xlinux.nist.gov/dads/HTML/rtree.html"}],"status":"reported","summary":"NIST DADS defines R-tree as: (1) A spatial access method that splits space with hierarchically nested, and possibly overlapping, boxes. The tree is height-balanced. (2) A recursion tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.runtime","kind":"concept","label":"run time","sources":[{"id":"nist-dads.runtime","title":"NIST Dictionary of Algorithms and Data Structures: runtime","url":"https://xlinux.nist.gov/dads/HTML/runtime.html"}],"status":"reported","summary":"NIST DADS defines run time as: (1) The amount of time needed to execute an algorithm . (2) The time when a compiled program is executing, versus compile time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.saturatededge","kind":"concept","label":"saturated edge","sources":[{"id":"nist-dads.saturatededge","title":"NIST Dictionary of Algorithms and Data Structures: saturatedEdge","url":"https://xlinux.nist.gov/dads/HTML/saturatedEdge.html"}],"status":"reported","summary":"NIST DADS defines saturated edge as: An edge in a flow network which has the maximum possible flow.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sbbtree","kind":"concept","label":"SBB tree","sources":[{"id":"nist-dads.sbbtree","title":"NIST Dictionary of Algorithms and Data Structures: sbbtree","url":"https://xlinux.nist.gov/dads/HTML/sbbtree.html"}],"status":"reported","summary":"NIST DADS defines SBB tree as: A symmetric binary B-tree. Now known as a red-black tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.scan","kind":"method","label":"scan","sources":[{"id":"nist-dads.scan","title":"NIST Dictionary of Algorithms and Data Structures: scan","url":"https://xlinux.nist.gov/dads/HTML/scan.html"}],"status":"reported","summary":"NIST DADS defines scan as: A parallel operation in which each element in an array or linked list receives the sum of all previous elements. Also known as prefix sums.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.scapegoattree","kind":"method","label":"scapegoat tree","sources":[{"id":"nist-dads.scapegoattree","title":"NIST Dictionary of Algorithms and Data Structures: scapegoatTree","url":"https://xlinux.nist.gov/dads/HTML/scapegoatTree.html"}],"status":"reported","summary":"NIST DADS defines scapegoat tree as: A binary search tree that needs no balance information. Search time is logarithmic , and the amortized cost of update is logarithmic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.searchtree","kind":"concept","label":"search tree","sources":[{"id":"nist-dads.searchtree","title":"NIST Dictionary of Algorithms and Data Structures: searchtree","url":"https://xlinux.nist.gov/dads/HTML/searchtree.html"}],"status":"reported","summary":"NIST DADS defines search tree as: A tree where every subtree of a node has keys less than any other subtree of the node to its right. The keys in a node are conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.searchtrprop","kind":"concept","label":"search tree property","sources":[{"id":"nist-dads.searchtrprop","title":"NIST Dictionary of Algorithms and Data Structures: searchtrprop","url":"https://xlinux.nist.gov/dads/HTML/searchtrprop.html"}],"status":"reported","summary":"NIST DADS defines search tree property as: When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.secantsearch","kind":"method","label":"secant search","sources":[{"id":"nist-dads.secantsearch","title":"NIST Dictionary of Algorithms and Data Structures: secantSearch","url":"https://xlinux.nist.gov/dads/HTML/secantSearch.html"}],"status":"reported","summary":"NIST DADS defines secant search as: Search a sorted array by estimating the next position to check based on the values at the two previous positions checked.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.secondaryclustering","kind":"concept","label":"secondary clustering","sources":[{"id":"nist-dads.secondaryclustering","title":"NIST Dictionary of Algorithms and Data Structures: secondaryClustering","url":"https://xlinux.nist.gov/dads/HTML/secondaryClustering.html"}],"status":"reported","summary":"NIST DADS defines secondary clustering as: The tendency for some collision resolution schemes to create long run of filled slots away from a key hash position, e.g., along the probe sequence .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.segment","kind":"concept","label":"segment","sources":[{"id":"nist-dads.segment","title":"NIST Dictionary of Algorithms and Data Structures: segment","url":"https://xlinux.nist.gov/dads/HTML/segment.html"}],"status":"reported","summary":"NIST DADS defines segment as: (1) The substring of a pattern delimited by two don't cares or one don't care and beginning or end of the pattern. (2) A substring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.select","kind":"method","label":"Select","sources":[{"id":"nist-dads.select","title":"NIST Dictionary of Algorithms and Data Structures: select","url":"https://xlinux.nist.gov/dads/HTML/select.html"}],"status":"reported","summary":"NIST DADS defines Select as: A four-part algorithm to select the k th smallest element of an array . Part 1) Consider the array as groups of 5 elements; sort and find the median of each group. 2) Use Select recursively to find x , the median of the medians. 3) Next partition the array around x . 4) Let i be the number of elements in the low side of the partition. If k ≤ i, use Select recursively to find the k th element of the low side. Otherwise Select the k-i th element of the high side.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selectandpartition","kind":"concept","label":"select and partition","sources":[{"id":"nist-dads.selectandpartition","title":"NIST Dictionary of Algorithms and Data Structures: selectAndPartition","url":"https://xlinux.nist.gov/dads/HTML/selectAndPartition.html"}],"status":"reported","summary":"NIST DADS defines select and partition as: Given an array A of n elements and a positive integer k ≤ n, find the k th smallest element of A and partition the array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.selectmode","kind":"method","label":"select mode","sources":[{"id":"nist-dads.selectmode","title":"NIST Dictionary of Algorithms and Data Structures: selectmode","url":"https://xlinux.nist.gov/dads/HTML/selectmode.html"}],"status":"reported","summary":"NIST DADS defines select mode as: An algorithm to find the mode, or most frequently occurring value, in a group of elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selforganizinglist","kind":"concept","label":"self-organizing list","sources":[{"id":"nist-dads.selforganizinglist","title":"NIST Dictionary of Algorithms and Data Structures: selfOrganizingList","url":"https://xlinux.nist.gov/dads/HTML/selfOrganizingList.html"}],"status":"reported","summary":"NIST DADS defines self-organizing list as: A list that reorders the elements based on some self-organizing heuristic [Wikipedia] to improve average access time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selfloop","kind":"concept","label":"self-loop","sources":[{"id":"nist-dads.selfloop","title":"NIST Dictionary of Algorithms and Data Structures: selfloop","url":"https://xlinux.nist.gov/dads/HTML/selfloop.html"}],"status":"reported","summary":"NIST DADS defines self-loop as: An edge of a graph which starts and ends at the same vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.semidefinite","kind":"concept","label":"semidefinite programming","sources":[{"id":"nist-dads.semidefinite","title":"NIST Dictionary of Algorithms and Data Structures: semidefinite","url":"https://xlinux.nist.gov/dads/HTML/semidefinite.html"}],"status":"reported","summary":"NIST DADS defines semidefinite programming as: A generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.separatechaining","kind":"concept","label":"separate chaining","sources":[{"id":"nist-dads.separatechaining","title":"NIST Dictionary of Algorithms and Data Structures: separateChaining","url":"https://xlinux.nist.gov/dads/HTML/separateChaining.html"}],"status":"reported","summary":"NIST DADS defines separate chaining as: A scheme in which each position in the hash table has a list to handle collisions . Each position may be just a link to the list ( direct chaining ) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list. Also known as external chaining.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.separatnthrm","kind":"concept","label":"separation theorem","sources":[{"id":"nist-dads.separatnthrm","title":"NIST Dictionary of Algorithms and Data Structures: separatnthrm","url":"https://xlinux.nist.gov/dads/HTML/separatnthrm.html"}],"status":"reported","summary":"NIST DADS defines separation theorem as: A theorem showing that two complexity classes are distinct. Most separation theorems have been proved by diagonalization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.setpacking","kind":"concept","label":"set packing","sources":[{"id":"nist-dads.setpacking","title":"NIST Dictionary of Algorithms and Data Structures: setpacking","url":"https://xlinux.nist.gov/dads/HTML/setpacking.html"}],"status":"reported","summary":"NIST DADS defines set packing as: An optimization problem to find the largest number of mutually disjoint subsets that cover a given set of sets .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shadowheap","kind":"concept","label":"shadow heap","sources":[{"id":"nist-dads.shadowheap","title":"NIST Dictionary of Algorithms and Data Structures: shadowheap","url":"https://xlinux.nist.gov/dads/HTML/shadowheap.html"}],"status":"reported","summary":"NIST DADS defines shadow heap as: A heap , implemented in an array , adjacent to an unordered table. The shadow is the table nodes and all their (recursive) parents , by array index, in the heap.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shadowmerge","kind":"method","label":"shadow merge","sources":[{"id":"nist-dads.shadowmerge","title":"NIST Dictionary of Algorithms and Data Structures: shadowmerge","url":"https://xlinux.nist.gov/dads/HTML/shadowmerge.html"}],"status":"reported","summary":"NIST DADS defines shadow merge as: An algorithm to merge two heaps by concatenating the smaller heap to the larger, then reordering just the concatenated nodes and their parents to restore the heap property.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shadowmrgins","kind":"method","label":"shadow merge insert","sources":[{"id":"nist-dads.shadowmrgins","title":"NIST Dictionary of Algorithms and Data Structures: shadowmrgins","url":"https://xlinux.nist.gov/dads/HTML/shadowmrgins.html"}],"status":"reported","summary":"NIST DADS defines shadow merge insert as: An algorithm to insert a new node into a shadow heap . The new node is placed in the unordered table. When the table grows beyond some threshold size, table nodes and all their parents are reordered so everything is a heap.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shannonfano","kind":"method","label":"Shannon-Fano coding","sources":[{"id":"nist-dads.shannonfano","title":"NIST Dictionary of Algorithms and Data Structures: shannonFano","url":"https://xlinux.nist.gov/dads/HTML/shannonFano.html"}],"status":"reported","summary":"NIST DADS defines Shannon-Fano coding as: A variable-length coding based on the frequency of occurrence of each character. Divide the characters into two sets with the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding. Repeatedly divide the sets until each character has a unique coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sharedmemory","kind":"concept","label":"shared memory","sources":[{"id":"nist-dads.sharedmemory","title":"NIST Dictionary of Algorithms and Data Structures: sharedmemory","url":"https://xlinux.nist.gov/dads/HTML/sharedmemory.html"}],"status":"reported","summary":"NIST DADS defines shared memory as: All processors have the same global image of (and access to) all of the memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shiftor","kind":"method","label":"Shift-Or","sources":[{"id":"nist-dads.shiftor","title":"NIST Dictionary of Algorithms and Data Structures: shiftOr","url":"https://xlinux.nist.gov/dads/HTML/shiftOr.html"}],"status":"reported","summary":"NIST DADS defines Shift-Or as: A string matching algorithm which keeps an array of bits, R, showing if prefixes of the pattern don't match at the current place. Before searching, mismatch arrays are computed for each character in the alphabet and saved in an array, S. For the next position, with the character c, R = shift(R) or S[c]. If the last bit of R is 0, the pattern matches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shortestcommonsuperseq","kind":"concept","label":"shortest common supersequence","sources":[{"id":"nist-dads.shortestcommonsuperseq","title":"NIST Dictionary of Algorithms and Data Structures: shortestCommonSuperseq","url":"https://xlinux.nist.gov/dads/HTML/shortestCommonSuperseq.html"}],"status":"reported","summary":"NIST DADS defines shortest common supersequence as: Find the shortest string that contains two or more strings as subsequences .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shortestcommonsuperstring","kind":"concept","label":"shortest common superstring","sources":[{"id":"nist-dads.shortestcommonsuperstring","title":"NIST Dictionary of Algorithms and Data Structures: shortestCommonSuperstring","url":"https://xlinux.nist.gov/dads/HTML/shortestCommonSuperstring.html"}],"status":"reported","summary":"NIST DADS defines shortest common superstring as: Find the shortest string that contains two or more strings as substrings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shufflesort","kind":"method","label":"shuffle sort","sources":[{"id":"nist-dads.shufflesort","title":"NIST Dictionary of Algorithms and Data Structures: shuffleSort","url":"https://xlinux.nist.gov/dads/HTML/shuffleSort.html"}],"status":"reported","summary":"NIST DADS defines shuffle sort as: A distribution sort algorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array. This creates n/8 buckets to which the remaining 7/8 of the items are distributed. Each bucket is then sorted, and the buckets are concatenated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sibling","kind":"concept","label":"sibling","sources":[{"id":"nist-dads.sibling","title":"NIST Dictionary of Algorithms and Data Structures: sibling","url":"https://xlinux.nist.gov/dads/HTML/sibling.html"}],"status":"reported","summary":"NIST DADS defines sibling as: A node in a tree that has the same parent as another node is its sibling.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sieve","kind":"method","label":"sieve of Eratosthenes","sources":[{"id":"nist-dads.sieve","title":"NIST Dictionary of Algorithms and Data Structures: sieve","url":"https://xlinux.nist.gov/dads/HTML/sieve.html"}],"status":"reported","summary":"NIST DADS defines sieve of Eratosthenes as: An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked) array of integers from 2 to N. The first unmarked integer, 2, is the first prime. Mark every multiple of this prime. Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.siftup","kind":"method","label":"sift up","sources":[{"id":"nist-dads.siftup","title":"NIST Dictionary of Algorithms and Data Structures: siftup","url":"https://xlinux.nist.gov/dads/HTML/siftup.html"}],"status":"reported","summary":"NIST DADS defines sift up as: Restoring the heap property by swapping a node with its parent , and repeating the process on the parent until the root is reached or the heap property is satisfied.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.signature","kind":"concept","label":"signature","sources":[{"id":"nist-dads.signature","title":"NIST Dictionary of Algorithms and Data Structures: signature","url":"https://xlinux.nist.gov/dads/HTML/signature.html"}],"status":"reported","summary":"NIST DADS defines signature as: The types or domains , and order, in some representations, of inputs to and outputs from a function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sim","kind":"concept","label":"∼","sources":[{"id":"nist-dads.sim","title":"NIST Dictionary of Algorithms and Data Structures: sim","url":"https://xlinux.nist.gov/dads/HTML/sim.html"}],"status":"reported","summary":"NIST DADS defines ∼ as: (1) Proportional to. (2) Asymptotically equal to. A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means lim x → ∞ f(x)/g(x) = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simpleuniformhashing","kind":"concept","label":"simple uniform hashing","sources":[{"id":"nist-dads.simpleuniformhashing","title":"NIST Dictionary of Algorithms and Data Structures: simpleUniformHashing","url":"https://xlinux.nist.gov/dads/HTML/simpleUniformHashing.html"}],"status":"reported","summary":"NIST DADS defines simple uniform hashing as: The assumption or goal that items are equally likely to hash to any value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.simplemerge","kind":"method","label":"simple merge","sources":[{"id":"nist-dads.simplemerge","title":"NIST Dictionary of Algorithms and Data Structures: simplemerge","url":"https://xlinux.nist.gov/dads/HTML/simplemerge.html"}],"status":"reported","summary":"NIST DADS defines simple merge as: Merge n sorted streams into one output stream. All the stream heads are compared, and the head with the least key is removed and written to the output. This is repeated until all streams are empty.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simplepath","kind":"concept","label":"simple path","sources":[{"id":"nist-dads.simplepath","title":"NIST Dictionary of Algorithms and Data Structures: simplepath","url":"https://xlinux.nist.gov/dads/HTML/simplepath.html"}],"status":"reported","summary":"NIST DADS defines simple path as: A path that repeats no vertex , except that the first and last may be the same vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simplex","kind":"concept","label":"simplex","sources":[{"id":"nist-dads.simplex","title":"NIST Dictionary of Algorithms and Data Structures: simplex","url":"https://xlinux.nist.gov/dads/HTML/simplex.html"}],"status":"reported","summary":"NIST DADS defines simplex as: The simplest N-dimensional polytope . The generalization of a triangle (2D) or tetrahedron (3D).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.simulatedannealing","kind":"method","label":"simulated annealing","sources":[{"id":"nist-dads.simulatedannealing","title":"NIST Dictionary of Algorithms and Data Structures: simulatedAnnealing","url":"https://xlinux.nist.gov/dads/HTML/simulatedAnnealing.html"}],"status":"reported","summary":"NIST DADS defines simulated annealing as: A technique to find a good solution to an optimization problem by trying random variations of the current solution. A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds. The slower the cooling schedule , or rate of decrease, the more likely the algorithm is to find an optimal or near- optimal solution .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simulatnthrm","kind":"concept","label":"simulation theorem","sources":[{"id":"nist-dads.simulatnthrm","title":"NIST Dictionary of Algorithms and Data Structures: simulatnthrm","url":"https://xlinux.nist.gov/dads/HTML/simulatnthrm.html"}],"status":"reported","summary":"NIST DADS defines simulation theorem as: One kind of computation can be simulated by another kind within stated complexity bounds. Most known containment or equality relationships between complexity classes were proved this way.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singledestshortestpath","kind":"concept","label":"single-destination shortest-path problem","sources":[{"id":"nist-dads.singledestshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: singleDestShortestPath","url":"https://xlinux.nist.gov/dads/HTML/singleDestShortestPath.html"}],"status":"reported","summary":"NIST DADS defines single-destination shortest-path problem as: Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singlesourceshortestpath","kind":"concept","label":"single-source shortest-path problem","sources":[{"id":"nist-dads.singlesourceshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: singleSourceShortestPath","url":"https://xlinux.nist.gov/dads/HTML/singleSourceShortestPath.html"}],"status":"reported","summary":"NIST DADS defines single-source shortest-path problem as: Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph . Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singleprogrm","kind":"concept","label":"single program multiple data","sources":[{"id":"nist-dads.singleprogrm","title":"NIST Dictionary of Algorithms and Data Structures: singleprogrm","url":"https://xlinux.nist.gov/dads/HTML/singleprogrm.html"}],"status":"reported","summary":"NIST DADS defines single program multiple data as: The dominant style of parallel programming, where all processors use the same program, though each has its own data. Also known as SPMD.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singularity","kind":"concept","label":"singularity analysis","sources":[{"id":"nist-dads.singularity","title":"NIST Dictionary of Algorithms and Data Structures: singularity","url":"https://xlinux.nist.gov/dads/HTML/singularity.html"}],"status":"reported","summary":"NIST DADS defines singularity analysis as: A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sink","kind":"concept","label":"sink","sources":[{"id":"nist-dads.sink","title":"NIST Dictionary of Algorithms and Data Structures: sink","url":"https://xlinux.nist.gov/dads/HTML/sink.html"}],"status":"reported","summary":"NIST DADS defines sink as: A vertex of a directed graph with no outgoing edges . More formally, a vertex with with out-degree 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skdtree","kind":"concept","label":"skd-tree","sources":[{"id":"nist-dads.skdtree","title":"NIST Dictionary of Algorithms and Data Structures: skdtree","url":"https://xlinux.nist.gov/dads/HTML/skdtree.html"}],"status":"reported","summary":"NIST DADS defines skd-tree as: The spatial k-d tree is a spatial access method where successive levels are split along different dimensions. Objects are indexed by their centroid , and the minimum bounding box of objects in a node are stored in the node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skewsymmetry","kind":"concept","label":"skew symmetry","sources":[{"id":"nist-dads.skewsymmetry","title":"NIST Dictionary of Algorithms and Data Structures: skewsymmetry","url":"https://xlinux.nist.gov/dads/HTML/skewsymmetry.html"}],"status":"reported","summary":"NIST DADS defines skew symmetry as: The property that the flow is the same amount, but reversed direction, starting from either vertex of every edge of a flow network . More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skiplist","kind":"concept","label":"skip list","sources":[{"id":"nist-dads.skiplist","title":"NIST Dictionary of Algorithms and Data Structures: skiplist","url":"https://xlinux.nist.gov/dads/HTML/skiplist.html"}],"status":"reported","summary":"NIST DADS defines skip list as: A randomized variant of an ordered linked list with additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels. With enough levels, searching is O(log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smithalgorithm","kind":"method","label":"Smith algorithm","sources":[{"id":"nist-dads.smithalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: smithAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/smithAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Smith algorithm as: A string matching algorithm which computes the shift value for both the rightmost character of the window and the character preceding it, then uses the maximum of the two values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smithwaterman","kind":"method","label":"Smith-Waterman algorithm","sources":[{"id":"nist-dads.smithwaterman","title":"NIST Dictionary of Algorithms and Data Structures: smithWaterman","url":"https://xlinux.nist.gov/dads/HTML/smithWaterman.html"}],"status":"reported","summary":"NIST DADS defines Smith-Waterman algorithm as: A means of searching protein databases to find those with the best alignment.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smoothsort","kind":"method","label":"smoothsort","sources":[{"id":"nist-dads.smoothsort","title":"NIST Dictionary of Algorithms and Data Structures: smoothsort","url":"https://xlinux.nist.gov/dads/HTML/smoothsort.html"}],"status":"reported","summary":"NIST DADS defines smoothsort as: A variant of heapsort that takes advantage of a partially ordered table. Performance is O(n) when input is sorted and O(n log n) performance for worst case .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.solvable","kind":"concept","label":"solvable","sources":[{"id":"nist-dads.solvable","title":"NIST Dictionary of Algorithms and Data Structures: solvable","url":"https://xlinux.nist.gov/dads/HTML/solvable.html"}],"status":"reported","summary":"NIST DADS defines solvable as: A computational problem that can be solved by a Turing machine . The problem may have a nonbinary output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sortedarray","kind":"concept","label":"sorted array","sources":[{"id":"nist-dads.sortedarray","title":"NIST Dictionary of Algorithms and Data Structures: sortedarray","url":"https://xlinux.nist.gov/dads/HTML/sortedarray.html"}],"status":"reported","summary":"NIST DADS defines sorted array as: An array whose items are kept sorted, often so searching is faster.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sortedlist","kind":"concept","label":"sorted list","sources":[{"id":"nist-dads.sortedlist","title":"NIST Dictionary of Algorithms and Data Structures: sortedlist","url":"https://xlinux.nist.gov/dads/HTML/sortedlist.html"}],"status":"reported","summary":"NIST DADS defines sorted list as: A list whose items are kept sorted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.soundex","kind":"method","label":"soundex","sources":[{"id":"nist-dads.soundex","title":"NIST Dictionary of Algorithms and Data Structures: soundex","url":"https://xlinux.nist.gov/dads/HTML/soundex.html"}],"status":"reported","summary":"NIST DADS defines soundex as: An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds. This reduces matching problems from different spellings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.source","kind":"concept","label":"source","sources":[{"id":"nist-dads.source","title":"NIST Dictionary of Algorithms and Data Structures: source","url":"https://xlinux.nist.gov/dads/HTML/source.html"}],"status":"reported","summary":"NIST DADS defines source as: (1) A vertex of a directed graph with no incoming edges . More formally, a vertex with in-degree 0. (2) The vertex from which an edge of a directed graph leaves.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.space","kind":"concept","label":"space-constructible function","sources":[{"id":"nist-dads.space","title":"NIST Dictionary of Algorithms and Data Structures: space","url":"https://xlinux.nist.gov/dads/HTML/space.html"}],"status":"reported","summary":"NIST DADS defines space-constructible function as: A function s(n) that gives the actual space used by some Turing machine on all inputs of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.spaceorderingmethod","kind":"method","label":"space ordering method","sources":[{"id":"nist-dads.spaceorderingmethod","title":"NIST Dictionary of Algorithms and Data Structures: spaceOrderingMethod","url":"https://xlinux.nist.gov/dads/HTML/spaceOrderingMethod.html"}],"status":"reported","summary":"NIST DADS defines space ordering method as: A mapping from a discrete k-dimensional space into a linear order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.spanningtree","kind":"concept","label":"spanning tree","sources":[{"id":"nist-dads.spanningtree","title":"NIST Dictionary of Algorithms and Data Structures: spanningtree","url":"https://xlinux.nist.gov/dads/HTML/spanningtree.html"}],"status":"reported","summary":"NIST DADS defines spanning tree as: A connected , acyclic subgraph containing all the vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsegraph","kind":"concept","label":"sparse graph","sources":[{"id":"nist-dads.sparsegraph","title":"NIST Dictionary of Algorithms and Data Structures: sparsegraph","url":"https://xlinux.nist.gov/dads/HTML/sparsegraph.html"}],"status":"reported","summary":"NIST DADS defines sparse graph as: A graph in which the number of edges is much less than the possible number of edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsematrix","kind":"concept","label":"sparse matrix","sources":[{"id":"nist-dads.sparsematrix","title":"NIST Dictionary of Algorithms and Data Structures: sparsematrix","url":"https://xlinux.nist.gov/dads/HTML/sparsematrix.html"}],"status":"reported","summary":"NIST DADS defines sparse matrix as: A matrix that has relatively few non-zero (or \"interesting\") entries. It may be represented in much less than n × m space.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sparsificatn","kind":"method","label":"sparsification","sources":[{"id":"nist-dads.sparsificatn","title":"NIST Dictionary of Algorithms and Data Structures: sparsificatn","url":"https://xlinux.nist.gov/dads/HTML/sparsificatn.html"}],"status":"reported","summary":"NIST DADS defines sparsification as: Technique for designing dynamic graph algorithms , which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of edges and n is the number of vertices of the given graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsity","kind":"concept","label":"sparsity","sources":[{"id":"nist-dads.sparsity","title":"NIST Dictionary of Algorithms and Data Structures: sparsity","url":"https://xlinux.nist.gov/dads/HTML/sparsity.html"}],"status":"reported","summary":"NIST DADS defines sparsity as: Instances of the longest common subsequence problem in which the number of matches is small compared to the product of the lengths of the input strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.spatialaccessmethod","kind":"concept","label":"spatial access method","sources":[{"id":"nist-dads.spatialaccessmethod","title":"NIST Dictionary of Algorithms and Data Structures: spatialAccessMethod","url":"https://xlinux.nist.gov/dads/HTML/spatialAccessMethod.html"}],"status":"reported","summary":"NIST DADS defines spatial access method as: A data structure to search for lines, polygons, etc. Also known as SAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.squarematrix","kind":"concept","label":"square matrix","sources":[{"id":"nist-dads.squarematrix","title":"NIST Dictionary of Algorithms and Data Structures: squarematrix","url":"https://xlinux.nist.gov/dads/HTML/squarematrix.html"}],"status":"reported","summary":"NIST DADS defines square matrix as: A n × n matrix , i.e., one whose size is the same in both dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stable","kind":"concept","label":"stable","sources":[{"id":"nist-dads.stable","title":"NIST Dictionary of Algorithms and Data Structures: stable","url":"https://xlinux.nist.gov/dads/HTML/stable.html"}],"status":"reported","summary":"NIST DADS defines stable as: An algorithm where the relative order upon input of items with equal keys is always preserved in the output. Usually a sort algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stacktree","kind":"concept","label":"stack tree","sources":[{"id":"nist-dads.stacktree","title":"NIST Dictionary of Algorithms and Data Structures: stacktree","url":"https://xlinux.nist.gov/dads/HTML/stacktree.html"}],"status":"reported","summary":"NIST DADS defines stack tree as: A binary tree where no node , except the root , has more than one non- leaf child .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.starencoding","kind":"method","label":"star encoding","sources":[{"id":"nist-dads.starencoding","title":"NIST Dictionary of Algorithms and Data Structures: starEncoding","url":"https://xlinux.nist.gov/dads/HTML/starEncoding.html"}],"status":"reported","summary":"NIST DADS defines star encoding as: Using a fixed dictionary , encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.starshaped","kind":"concept","label":"star-shaped polygon","sources":[{"id":"nist-dads.starshaped","title":"NIST Dictionary of Algorithms and Data Structures: starshaped","url":"https://xlinux.nist.gov/dads/HTML/starshaped.html"}],"status":"reported","summary":"NIST DADS defines star-shaped polygon as: A polygon P in which there exists an interior point p such that all the boundary points of P are visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.startstate","kind":"concept","label":"start state","sources":[{"id":"nist-dads.startstate","title":"NIST Dictionary of Algorithms and Data Structures: startstate","url":"https://xlinux.nist.gov/dads/HTML/startstate.html"}],"status":"reported","summary":"NIST DADS defines start state as: An initial state or condition of a finite state machine or Turing machine . Informally, how the memory is initially set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.state","kind":"concept","label":"state","sources":[{"id":"nist-dads.state","title":"NIST Dictionary of Algorithms and Data Structures: state","url":"https://xlinux.nist.gov/dads/HTML/state.html"}],"status":"reported","summary":"NIST DADS defines state as: The condition of a finite state machine or Turing machine at a certain time. Informally, the content of memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.statemachine","kind":"concept","label":"state machine","sources":[{"id":"nist-dads.statemachine","title":"NIST Dictionary of Algorithms and Data Structures: statemachine","url":"https://xlinux.nist.gov/dads/HTML/statemachine.html"}],"status":"reported","summary":"NIST DADS defines state machine as: A model of computation consisting of a (possibly infinite) set of states , a set of start states , an input alphabet , and a transition function which maps input symbols and current states to a next state . Usually understood to be a finite state machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.static","kind":"concept","label":"static","sources":[{"id":"nist-dads.static","title":"NIST Dictionary of Algorithms and Data Structures: static","url":"https://xlinux.nist.gov/dads/HTML/static.html"}],"status":"reported","summary":"NIST DADS defines static as: When the problem domain does not change.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stcut","kind":"concept","label":"s-t cut","sources":[{"id":"nist-dads.stcut","title":"NIST Dictionary of Algorithms and Data Structures: stcut","url":"https://xlinux.nist.gov/dads/HTML/stcut.html"}],"status":"reported","summary":"NIST DADS defines s-t cut as: A partitioning of the vertices of a flow network into S and T such that the source is in S and the sink is in T.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stdigraph","kind":"concept","label":"st-digraph","sources":[{"id":"nist-dads.stdigraph","title":"NIST Dictionary of Algorithms and Data Structures: stdigraph","url":"https://xlinux.nist.gov/dads/HTML/stdigraph.html"}],"status":"reported","summary":"NIST DADS defines st-digraph as: A directed acyclic graph with two specially marked nodes, the source s and the sink t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinerpoint","kind":"concept","label":"Steiner point","sources":[{"id":"nist-dads.steinerpoint","title":"NIST Dictionary of Algorithms and Data Structures: steinerpoint","url":"https://xlinux.nist.gov/dads/HTML/steinerpoint.html"}],"status":"reported","summary":"NIST DADS defines Steiner point as: (1) A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree . (2) A point with a particular geometric relation to a triangle.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinerratio","kind":"concept","label":"Steiner ratio","sources":[{"id":"nist-dads.steinerratio","title":"NIST Dictionary of Algorithms and Data Structures: steinerratio","url":"https://xlinux.nist.gov/dads/HTML/steinerratio.html"}],"status":"reported","summary":"NIST DADS defines Steiner ratio as: For a given variant of the Steiner tree problem, the maximum possible ratio of the length of a minimum spanning tree of a set of terminals to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinertree","kind":"concept","label":"Steiner tree","sources":[{"id":"nist-dads.steinertree","title":"NIST Dictionary of Algorithms and Data Structures: steinertree","url":"https://xlinux.nist.gov/dads/HTML/steinertree.html"}],"status":"reported","summary":"NIST DADS defines Steiner tree as: A minimum-weight tree connecting a designated set of vertices , called terminals , in an undirected , weighted graph or points in a space. The tree may include non-terminals, which are called Steiner vertices or Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinervertx","kind":"concept","label":"Steiner vertex","sources":[{"id":"nist-dads.steinervertx","title":"NIST Dictionary of Algorithms and Data Structures: steinervertx","url":"https://xlinux.nist.gov/dads/HTML/steinervertx.html"}],"status":"reported","summary":"NIST DADS defines Steiner vertex as: A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stoogesort","kind":"method","label":"stooge sort","sources":[{"id":"nist-dads.stoogesort","title":"NIST Dictionary of Algorithms and Data Structures: stoogesort","url":"https://xlinux.nist.gov/dads/HTML/stoogesort.html"}],"status":"reported","summary":"NIST DADS defines stooge sort as: A terribly inefficient sort algorithm that swaps the top and bottom items if needed, then ( recursively ) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.straightline","kind":"concept","label":"straight-line drawing","sources":[{"id":"nist-dads.straightline","title":"NIST Dictionary of Algorithms and Data Structures: straightline","url":"https://xlinux.nist.gov/dads/HTML/straightline.html"}],"status":"reported","summary":"NIST DADS defines straight-line drawing as: A graph drawing in which each edge is represented by a straight line segment.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.strandsort","kind":"method","label":"strand sort","sources":[{"id":"nist-dads.strandsort","title":"NIST Dictionary of Algorithms and Data Structures: strandSort","url":"https://xlinux.nist.gov/dads/HTML/strandSort.html"}],"status":"reported","summary":"NIST DADS defines strand sort as: A sort algorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist. For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist. Merge the sublist into a final, sorted list. Repeatedly extract and merge sublists until all items are sorted. Handle two or fewer items as special cases.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlydecreasing","kind":"concept","label":"strictly decreasing","sources":[{"id":"nist-dads.strictlydecreasing","title":"NIST Dictionary of Algorithms and Data Structures: strictlyDecreasing","url":"https://xlinux.nist.gov/dads/HTML/strictlyDecreasing.html"}],"status":"reported","summary":"NIST DADS defines strictly decreasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) > f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlyincreasing","kind":"concept","label":"strictly increasing","sources":[{"id":"nist-dads.strictlyincreasing","title":"NIST Dictionary of Algorithms and Data Structures: strictlyIncreasing","url":"https://xlinux.nist.gov/dads/HTML/strictlyIncreasing.html"}],"status":"reported","summary":"NIST DADS defines strictly increasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) < f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlylowertriangmat","kind":"concept","label":"strictly lower triangular matrix","sources":[{"id":"nist-dads.strictlylowertriangmat","title":"NIST Dictionary of Algorithms and Data Structures: strictlyLowerTriangMat","url":"https://xlinux.nist.gov/dads/HTML/strictlyLowerTriangMat.html"}],"status":"reported","summary":"NIST DADS defines strictly lower triangular matrix as: A matrix that is only defined at (i,j) when i > j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlyuppertriangmat","kind":"concept","label":"strictly upper triangular matrix","sources":[{"id":"nist-dads.strictlyuppertriangmat","title":"NIST Dictionary of Algorithms and Data Structures: strictlyUpperTriangMat","url":"https://xlinux.nist.gov/dads/HTML/strictlyUpperTriangMat.html"}],"status":"reported","summary":"NIST DADS defines strictly upper triangular matrix as: A matrix that is only defined at (i,j) when i < j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.string","kind":"concept","label":"string","sources":[{"id":"nist-dads.string","title":"NIST Dictionary of Algorithms and Data Structures: string","url":"https://xlinux.nist.gov/dads/HTML/string.html"}],"status":"reported","summary":"NIST DADS defines string as: A list of characters, usually implemented as an array . Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stringmatchwerror","kind":"method","label":"string matching with errors","sources":[{"id":"nist-dads.stringmatchwerror","title":"NIST Dictionary of Algorithms and Data Structures: stringMatchwError","url":"https://xlinux.nist.gov/dads/HTML/stringMatchwError.html"}],"status":"reported","summary":"NIST DADS defines string matching with errors as: Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string. Preprocessing, e.g., building an index, may or may not be allowed. Also known as approximate string matching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stringmatchwmismatch","kind":"method","label":"string matching with mismatches","sources":[{"id":"nist-dads.stringmatchwmismatch","title":"NIST Dictionary of Algorithms and Data Structures: stringMatchwMismatch","url":"https://xlinux.nist.gov/dads/HTML/stringMatchwMismatch.html"}],"status":"reported","summary":"NIST DADS defines string matching with mismatches as: The special case of string matching with errors where mismatches are the only type of error allowed.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stringedit","kind":"concept","label":"string editing problem","sources":[{"id":"nist-dads.stringedit","title":"NIST Dictionary of Algorithms and Data Structures: stringedit","url":"https://xlinux.nist.gov/dads/HTML/stringedit.html"}],"status":"reported","summary":"NIST DADS defines string editing problem as: The problem of finding an edit script of minimum cost which transforms a given string into another given string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strippacking","kind":"concept","label":"strip packing","sources":[{"id":"nist-dads.strippacking","title":"NIST Dictionary of Algorithms and Data Structures: strippacking","url":"https://xlinux.nist.gov/dads/HTML/strippacking.html"}],"status":"reported","summary":"NIST DADS defines strip packing as: Pack a set of rectangles into a strip of width 1 to minimize the height used. Rectangles may not overlap or be rotated. Without loss of generality, the height of rectangles is at most 1. This is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglyconnectedcompo","kind":"concept","label":"strongly connected component","sources":[{"id":"nist-dads.stronglyconnectedcompo","title":"NIST Dictionary of Algorithms and Data Structures: stronglyConnectedCompo","url":"https://xlinux.nist.gov/dads/HTML/stronglyConnectedCompo.html"}],"status":"reported","summary":"NIST DADS defines strongly connected component as: A strongly connected subgraph , S, of a directed graph , D, such that no vertex of D can be added to S and it still be strongly connected. Informally, a maximal subgraph in which every vertex is reachable from every other vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglyconnectedgraph","kind":"concept","label":"strongly connected graph","sources":[{"id":"nist-dads.stronglyconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: stronglyConnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/stronglyConnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines strongly connected graph as: A directed graph that has a path from each vertex to every other vertex. Formal Definition: A directed graph D=(V, E) such that for all pairs of vertices u, v ∈ V, there is a path from u to v and from v to u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglynp","kind":"concept","label":"strongly NP-hard","sources":[{"id":"nist-dads.stronglynp","title":"NIST Dictionary of Algorithms and Data Structures: stronglyNP","url":"https://xlinux.nist.gov/dads/HTML/stronglyNP.html"}],"status":"reported","summary":"NIST DADS defines strongly NP-hard as: The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.strsrch","kind":"method","label":"strsrch","sources":[{"id":"nist-dads.strsrch","title":"NIST Dictionary of Algorithms and Data Structures: strsrch","url":"https://xlinux.nist.gov/dads/HTML/strsrch.html"}],"status":"reported","summary":"NIST DADS defines strsrch as: Find occurrences of a substring in a target string by trying the substring at each possible location in the string. Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stupidsort","kind":"method","label":"stupid sort","sources":[{"id":"nist-dads.stupidsort","title":"NIST Dictionary of Algorithms and Data Structures: stupidSort","url":"https://xlinux.nist.gov/dads/HTML/stupidSort.html"}],"status":"reported","summary":"NIST DADS defines stupid sort as: (1) The original name of gnome sort . (2) An alternate name for bogosort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subadditive","kind":"concept","label":"subadditive ergodic theorem","sources":[{"id":"nist-dads.subadditive","title":"NIST Dictionary of Algorithms and Data Structures: subadditive","url":"https://xlinux.nist.gov/dads/HTML/subadditive.html"}],"status":"reported","summary":"NIST DADS defines subadditive ergodic theorem as: If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subgraph","kind":"concept","label":"subgraph","sources":[{"id":"nist-dads.subgraph","title":"NIST Dictionary of Algorithms and Data Structures: subgraph","url":"https://xlinux.nist.gov/dads/HTML/subgraph.html"}],"status":"reported","summary":"NIST DADS defines subgraph as: A graph whose vertices and edges are subsets of another graph . Formal Definition: A graph G'=(V', E') is a subgraph of another graph G=(V, E) iff V'⊆ V, and E'⊆ E ∧ ( (v 1 , v 2 )∈ E' → v 1 , v 2 ∈ V').","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subgraphiso","kind":"concept","label":"subgraph isomorphism","sources":[{"id":"nist-dads.subgraphiso","title":"NIST Dictionary of Algorithms and Data Structures: subgraphiso","url":"https://xlinux.nist.gov/dads/HTML/subgraphiso.html"}],"status":"reported","summary":"NIST DADS defines subgraph isomorphism as: Decide if there is a subgraph of one graph which is isomorphic to another graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sublineartimealgo","kind":"concept","label":"sublinear time algorithm","sources":[{"id":"nist-dads.sublineartimealgo","title":"NIST Dictionary of Algorithms and Data Structures: sublinearTimeAlgo","url":"https://xlinux.nist.gov/dads/HTML/sublinearTimeAlgo.html"}],"status":"reported","summary":"NIST DADS defines sublinear time algorithm as: A algorithm whose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subsequence","kind":"concept","label":"subsequence","sources":[{"id":"nist-dads.subsequence","title":"NIST Dictionary of Algorithms and Data Structures: subsequence","url":"https://xlinux.nist.gov/dads/HTML/subsequence.html"}],"status":"reported","summary":"NIST DADS defines subsequence as: Any string that can be obtained by deleting zero or more symbols from a given string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subset","kind":"concept","label":"subset","sources":[{"id":"nist-dads.subset","title":"NIST Dictionary of Algorithms and Data Structures: subset","url":"https://xlinux.nist.gov/dads/HTML/subset.html"}],"status":"reported","summary":"NIST DADS defines subset as: A set S 1 is a subset of another set S 2 if every element in S 1 is in S 2 . S 2 may have exactly the same elements as S 1 . Formal Definition: S 1 ⊆ S 2 iff ∀ s, s ∈ S 1 → s ∈ S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.substring","kind":"concept","label":"substring","sources":[{"id":"nist-dads.substring","title":"NIST Dictionary of Algorithms and Data Structures: substring","url":"https://xlinux.nist.gov/dads/HTML/substring.html"}],"status":"reported","summary":"NIST DADS defines substring as: A string v is a substring of a string u if u=u′ vu″ for some prefix u′ and suffix u″. Also known as factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subtree","kind":"concept","label":"subtree","sources":[{"id":"nist-dads.subtree","title":"NIST Dictionary of Algorithms and Data Structures: subtree","url":"https://xlinux.nist.gov/dads/HTML/subtree.html"}],"status":"reported","summary":"NIST DADS defines subtree as: The tree which is a child of a node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffix","kind":"concept","label":"suffix","sources":[{"id":"nist-dads.suffix","title":"NIST Dictionary of Algorithms and Data Structures: suffix","url":"https://xlinux.nist.gov/dads/HTML/suffix.html"}],"status":"reported","summary":"NIST DADS defines suffix as: The end characters of a string . More formally a string v is a suffix of a string u if u=u'v for some string u'.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixautmtn","kind":"concept","label":"suffix automaton","sources":[{"id":"nist-dads.suffixautmtn","title":"NIST Dictionary of Algorithms and Data Structures: suffixautmtn","url":"https://xlinux.nist.gov/dads/HTML/suffixautmtn.html"}],"status":"reported","summary":"NIST DADS defines suffix automaton as: The smallest automaton accepting all suffixes of a string . The states form a directed acyclic word graph or DAWG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.superimposedcode","kind":"concept","label":"superimposed code","sources":[{"id":"nist-dads.superimposedcode","title":"NIST Dictionary of Algorithms and Data Structures: superimposedCode","url":"https://xlinux.nist.gov/dads/HTML/superimposedCode.html"}],"status":"reported","summary":"NIST DADS defines superimposed code as: A set of bit vectors such that no vector is a subset of a bitwise or of a small number of others.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.superset","kind":"concept","label":"superset","sources":[{"id":"nist-dads.superset","title":"NIST Dictionary of Algorithms and Data Structures: superset","url":"https://xlinux.nist.gov/dads/HTML/superset.html"}],"status":"reported","summary":"NIST DADS defines superset as: A set S 1 is a superset of another set S 2 if every element in S 2 is in S 1 . S 1 may have elements which are not in S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.supersink","kind":"concept","label":"supersink","sources":[{"id":"nist-dads.supersink","title":"NIST Dictionary of Algorithms and Data Structures: supersink","url":"https://xlinux.nist.gov/dads/HTML/supersink.html"}],"status":"reported","summary":"NIST DADS defines supersink as: A vertex of a directed graph which is reachable from all other vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.supersource","kind":"concept","label":"supersource","sources":[{"id":"nist-dads.supersource","title":"NIST Dictionary of Algorithms and Data Structures: supersource","url":"https://xlinux.nist.gov/dads/HTML/supersource.html"}],"status":"reported","summary":"NIST DADS defines supersource as: A vertex of a directed graph from which all other vertices are reachable .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.symmetric","kind":"concept","label":"symmetric","sources":[{"id":"nist-dads.symmetric","title":"NIST Dictionary of Algorithms and Data Structures: symmetric","url":"https://xlinux.nist.gov/dads/HTML/symmetric.html"}],"status":"reported","summary":"NIST DADS defines symmetric as: A binary relation R for which a R b implies b R a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.symmetricsetdiff","kind":"concept","label":"symmetric set difference","sources":[{"id":"nist-dads.symmetricsetdiff","title":"NIST Dictionary of Algorithms and Data Structures: symmetricSetDiff","url":"https://xlinux.nist.gov/dads/HTML/symmetricSetDiff.html"}],"status":"reported","summary":"NIST DADS defines symmetric set difference as: Members which are in either set , but not in both. That is, for sets A and B, it is (A - B) ∪ (B - A).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.symmetrybrek","kind":"method","label":"symmetry breaking","sources":[{"id":"nist-dads.symmetrybrek","title":"NIST Dictionary of Algorithms and Data Structures: symmetrybrek","url":"https://xlinux.nist.gov/dads/HTML/symmetrybrek.html"}],"status":"reported","summary":"NIST DADS defines symmetry breaking as: To differentiate parts of a structure, such as a graph , which locally look the same to all vertices . Usually implemented with randomization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tail","kind":"concept","label":"tail","sources":[{"id":"nist-dads.tail","title":"NIST Dictionary of Algorithms and Data Structures: tail","url":"https://xlinux.nist.gov/dads/HTML/tail.html"}],"status":"reported","summary":"NIST DADS defines tail as: (1) The last item of a list . (2) All but the first item of a list; the list following the head.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tailrecursion","kind":"method","label":"tail recursion","sources":[{"id":"nist-dads.tailrecursion","title":"NIST Dictionary of Algorithms and Data Structures: tailRecursion","url":"https://xlinux.nist.gov/dads/HTML/tailRecursion.html"}],"status":"reported","summary":"NIST DADS defines tail recursion as: A special form of recursion where the last operation of a function is a recursive call. The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.target","kind":"concept","label":"target","sources":[{"id":"nist-dads.target","title":"NIST Dictionary of Algorithms and Data Structures: target","url":"https://xlinux.nist.gov/dads/HTML/target.html"}],"status":"reported","summary":"NIST DADS defines target as: The vertex which an edge of a directed graph enters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.temporllogic","kind":"concept","label":"temporal logic","sources":[{"id":"nist-dads.temporllogic","title":"NIST Dictionary of Algorithms and Data Structures: temporllogic","url":"https://xlinux.nist.gov/dads/HTML/temporllogic.html"}],"status":"reported","summary":"NIST DADS defines temporal logic as: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.terminal","kind":"concept","label":"terminal","sources":[{"id":"nist-dads.terminal","title":"NIST Dictionary of Algorithms and Data Structures: terminal","url":"https://xlinux.nist.gov/dads/HTML/terminal.html"}],"status":"reported","summary":"NIST DADS defines terminal as: The set of points in a plane or vertices in a graph defining endpoints of a Steiner tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ternarysearchtree","kind":"concept","label":"ternary search tree","sources":[{"id":"nist-dads.ternarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: ternarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/ternarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines ternary search tree as: A 3-way tree where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key. If the key is a multikey ( string , array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.) Also known as TST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.text","kind":"concept","label":"text","sources":[{"id":"nist-dads.text","title":"NIST Dictionary of Algorithms and Data Structures: text","url":"https://xlinux.nist.gov/dads/HTML/text.html"}],"status":"reported","summary":"NIST DADS defines text as: A list of characters, usually thought of as a list of words separated by spaces.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.threadedtree","kind":"concept","label":"threaded tree","sources":[{"id":"nist-dads.threadedtree","title":"NIST Dictionary of Algorithms and Data Structures: threadedtree","url":"https://xlinux.nist.gov/dads/HTML/threadedtree.html"}],"status":"reported","summary":"NIST DADS defines threaded tree as: A binary search tree in which each node uses an otherwise-empty left child link to refer to the node's in-order predecessor and an empty right child link to refer to its in-order successor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.threedimnsnl","kind":"concept","label":"three-dimensional","sources":[{"id":"nist-dads.threedimnsnl","title":"NIST Dictionary of Algorithms and Data Structures: threedimnsnl","url":"https://xlinux.nist.gov/dads/HTML/threedimnsnl.html"}],"status":"reported","summary":"NIST DADS defines three-dimensional as: Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.threewaymsrt","kind":"method","label":"three-way merge sort","sources":[{"id":"nist-dads.threewaymsrt","title":"NIST Dictionary of Algorithms and Data Structures: threewaymsrt","url":"https://xlinux.nist.gov/dads/HTML/threewaymsrt.html"}],"status":"reported","summary":"NIST DADS defines three-way merge sort as: A k-way merge sort which uses three input and three output streams.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.time","kind":"concept","label":"time-constructible function","sources":[{"id":"nist-dads.time","title":"NIST Dictionary of Algorithms and Data Structures: time","url":"https://xlinux.nist.gov/dads/HTML/time.html"}],"status":"reported","summary":"NIST DADS defines time-constructible function as: A function t(n) that gives the actual running time of some Turing machine on all inputs of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.timespace","kind":"concept","label":"time/space complexity","sources":[{"id":"nist-dads.timespace","title":"NIST Dictionary of Algorithms and Data Structures: timespace","url":"https://xlinux.nist.gov/dads/HTML/timespace.html"}],"status":"reported","summary":"NIST DADS defines time/space complexity as: The maximum time or space required by a Turing machine on any input of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.topdownradixsort","kind":"method","label":"top-down radix sort","sources":[{"id":"nist-dads.topdownradixsort","title":"NIST Dictionary of Algorithms and Data Structures: topdownRadixSort","url":"https://xlinux.nist.gov/dads/HTML/topdownRadixSort.html"}],"status":"reported","summary":"NIST DADS defines top-down radix sort as: A recursive bucket sort where elements are distributed based on succeeding pieces (characters) of the key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologicalorder","kind":"concept","label":"topological order","sources":[{"id":"nist-dads.topologicalorder","title":"NIST Dictionary of Algorithms and Data Structures: topologicalOrder","url":"https://xlinux.nist.gov/dads/HTML/topologicalOrder.html"}],"status":"reported","summary":"NIST DADS defines topological order as: A numbering of the vertices of a directed acyclic graph such that every edge from a vertex numbered i to a vertex numbered j satisfies i<j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologytree","kind":"concept","label":"topology tree","sources":[{"id":"nist-dads.topologytree","title":"NIST Dictionary of Algorithms and Data Structures: topologytree","url":"https://xlinux.nist.gov/dads/HTML/topologytree.html"}],"status":"reported","summary":"NIST DADS defines topology tree as: Tree that describes a balanced decomposition of another tree, according to its topology. More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at level l represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two children , representing the vertex clusters at level l-1 whose union gives the vertex cluster the node represents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totalfunc","kind":"concept","label":"total function","sources":[{"id":"nist-dads.totalfunc","title":"NIST Dictionary of Algorithms and Data Structures: totalfunc","url":"https://xlinux.nist.gov/dads/HTML/totalfunc.html"}],"status":"reported","summary":"NIST DADS defines total function as: A function which is defined for all inputs of the right type, that is, for all of a domain .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totallyundecidableprob","kind":"concept","label":"totally undecidable problem","sources":[{"id":"nist-dads.totallyundecidableprob","title":"NIST Dictionary of Algorithms and Data Structures: totallyUndecidableProb","url":"https://xlinux.nist.gov/dads/HTML/totallyUndecidableProb.html"}],"status":"reported","summary":"NIST DADS defines totally undecidable problem as: A problem that cannot be solved by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totalorder","kind":"concept","label":"total order","sources":[{"id":"nist-dads.totalorder","title":"NIST Dictionary of Algorithms and Data Structures: totalorder","url":"https://xlinux.nist.gov/dads/HTML/totalorder.html"}],"status":"reported","summary":"NIST DADS defines total order as: An order defined for all pairs of items of a set. For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other. Formal Definition: A total order is a relation that is reflexive , transitive , antisymmetric , and total. Also known as linear order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tournament","kind":"method","label":"tournament","sources":[{"id":"nist-dads.tournament","title":"NIST Dictionary of Algorithms and Data Structures: tournament","url":"https://xlinux.nist.gov/dads/HTML/tournament.html"}],"status":"reported","summary":"NIST DADS defines tournament as: Find the maximum of a set of n elements in ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round. It takes n-1 comparisons, like linear search , but may be parallelized, extended to also find the second greatest element, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tractable","kind":"concept","label":"tractable","sources":[{"id":"nist-dads.tractable","title":"NIST Dictionary of Algorithms and Data Structures: tractable","url":"https://xlinux.nist.gov/dads/HTML/tractable.html"}],"status":"reported","summary":"NIST DADS defines tractable as: A problem which has an algorithm which computes all instances of it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transition","kind":"concept","label":"transition","sources":[{"id":"nist-dads.transition","title":"NIST Dictionary of Algorithms and Data Structures: transition","url":"https://xlinux.nist.gov/dads/HTML/transition.html"}],"status":"reported","summary":"NIST DADS defines transition as: The change from one state to another in a finite state machine . Analogously, an edge in a directed graph . Also known as state transition, move.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitionfn","kind":"concept","label":"transition function","sources":[{"id":"nist-dads.transitionfn","title":"NIST Dictionary of Algorithms and Data Structures: transitionfn","url":"https://xlinux.nist.gov/dads/HTML/transitionfn.html"}],"status":"reported","summary":"NIST DADS defines transition function as: A function of the current state and input giving the next state of a finite state machine or Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitive","kind":"concept","label":"transitive","sources":[{"id":"nist-dads.transitive","title":"NIST Dictionary of Algorithms and Data Structures: transitive","url":"https://xlinux.nist.gov/dads/HTML/transitive.html"}],"status":"reported","summary":"NIST DADS defines transitive as: A binary relation R for which a R b and b R c implies a R c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitivereduction","kind":"concept","label":"transitive reduction","sources":[{"id":"nist-dads.transitivereduction","title":"NIST Dictionary of Algorithms and Data Structures: transitiveReduction","url":"https://xlinux.nist.gov/dads/HTML/transitiveReduction.html"}],"status":"reported","summary":"NIST DADS defines transitive reduction as: The transitive reduction of a directed graph G is the directed graph G' with the smallest number of edges such that for every path between vertices in G, G' has a path between those vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.transposeseqsearch","kind":"method","label":"transpose sequential search","sources":[{"id":"nist-dads.transposeseqsearch","title":"NIST Dictionary of Algorithms and Data Structures: transposeSeqSearch","url":"https://xlinux.nist.gov/dads/HTML/transposeSeqSearch.html"}],"status":"reported","summary":"NIST DADS defines transpose sequential search as: Search an array or list by checking items one at a time. If the value is found, swap it with its predecessor so it is found faster next time. Also known as self-organizing sequential search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.travelingsalesman","kind":"concept","label":"traveling salesman","sources":[{"id":"nist-dads.travelingsalesman","title":"NIST Dictionary of Algorithms and Data Structures: travelingSalesman","url":"https://xlinux.nist.gov/dads/HTML/travelingSalesman.html"}],"status":"reported","summary":"NIST DADS defines traveling salesman as: Find a path through a weighted graph that starts and ends at the same vertex , includes every other vertex exactly once, and minimizes the total cost of edges . Also known as TSP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treap","kind":"concept","label":"treap","sources":[{"id":"nist-dads.treap","title":"NIST Dictionary of Algorithms and Data Structures: treap","url":"https://xlinux.nist.gov/dads/HTML/treap.html"}],"status":"reported","summary":"NIST DADS defines treap as: A binary search tree in which nodes have another key , called the priority. Operations also keep the nodes heap ordered with regard to the priority.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treeautomaton","kind":"concept","label":"tree automaton","sources":[{"id":"nist-dads.treeautomaton","title":"NIST Dictionary of Algorithms and Data Structures: treeAutomaton","url":"https://xlinux.nist.gov/dads/HTML/treeAutomaton.html"}],"status":"reported","summary":"NIST DADS defines tree automaton as: An extension of a finite state machine that operates on n-ary constructors. Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes n states and constructors. Tree automata may be top-down (starting from the root ) or bottom-up (starting from the leaves ), and deterministic or nondeterministic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treetraversal","kind":"concept","label":"tree traversal","sources":[{"id":"nist-dads.treetraversal","title":"NIST Dictionary of Algorithms and Data Structures: treeTraversal","url":"https://xlinux.nist.gov/dads/HTML/treeTraversal.html"}],"status":"reported","summary":"NIST DADS defines tree traversal as: A technique for processing the nodes of a tree in some order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treecontrctn","kind":"concept","label":"tree contraction","sources":[{"id":"nist-dads.treecontrctn","title":"NIST Dictionary of Algorithms and Data Structures: treecontrctn","url":"https://xlinux.nist.gov/dads/HTML/treecontrctn.html"}],"status":"reported","summary":"NIST DADS defines tree contraction as: Contracting a tree by removing some of the nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treeedit","kind":"concept","label":"tree editing problem","sources":[{"id":"nist-dads.treeedit","title":"NIST Dictionary of Algorithms and Data Structures: treeedit","url":"https://xlinux.nist.gov/dads/HTML/treeedit.html"}],"status":"reported","summary":"NIST DADS defines tree editing problem as: The problem of finding an edit script of minimum cost which transforms a given tree into another given tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.treesort1","kind":"method","label":"treesort (1)","sources":[{"id":"nist-dads.treesort1","title":"NIST Dictionary of Algorithms and Data Structures: treesort1","url":"https://xlinux.nist.gov/dads/HTML/treesort1.html"}],"status":"reported","summary":"NIST DADS defines treesort (1) as: A sort algorithm that first builds a binary search tree of the keys , then accesses the keys with an in-order traversal .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.treesort2","kind":"method","label":"treesort (2)","sources":[{"id":"nist-dads.treesort2","title":"NIST Dictionary of Algorithms and Data Structures: treesort2","url":"https://xlinux.nist.gov/dads/HTML/treesort2.html"}],"status":"reported","summary":"NIST DADS defines treesort (2) as: Variants of heapsort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trianglnqlty","kind":"concept","label":"triangle inequality","sources":[{"id":"nist-dads.trianglnqlty","title":"NIST Dictionary of Algorithms and Data Structures: trianglnqlty","url":"https://xlinux.nist.gov/dads/HTML/trianglnqlty.html"}],"status":"reported","summary":"NIST DADS defines triangle inequality as: The property that a complete weighted graph satisfies weight(u,v) ≤ weight(u,w) + weight(w,v) for all vertices u, v, w. Informally, the graph has no short cuts.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.triconnectedgraph","kind":"concept","label":"triconnected graph","sources":[{"id":"nist-dads.triconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: triconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/triconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines triconnected graph as: A connected graph such that deleting any two vertices (and incident edges ) results in a graph that is still connected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trinaryfunc","kind":"concept","label":"trinary function","sources":[{"id":"nist-dads.trinaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: trinaryfunc","url":"https://xlinux.nist.gov/dads/HTML/trinaryfunc.html"}],"status":"reported","summary":"NIST DADS defines trinary function as: A function with three arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tripartition","kind":"method","label":"tripartition","sources":[{"id":"nist-dads.tripartition","title":"NIST Dictionary of Algorithms and Data Structures: tripartition","url":"https://xlinux.nist.gov/dads/HTML/tripartition.html"}],"status":"reported","summary":"NIST DADS defines tripartition as: To partition array elements into three groups.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.turingredctn","kind":"concept","label":"Turing reduction","sources":[{"id":"nist-dads.turingredctn","title":"NIST Dictionary of Algorithms and Data Structures: turingredctn","url":"https://xlinux.nist.gov/dads/HTML/turingredctn.html"}],"status":"reported","summary":"NIST DADS defines Turing reduction as: A reduction computable by an oracle Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twingridfl","kind":"concept","label":"twin grid file","sources":[{"id":"nist-dads.twingridfl","title":"NIST Dictionary of Algorithms and Data Structures: twingridfl","url":"https://xlinux.nist.gov/dads/HTML/twingridfl.html"}],"status":"reported","summary":"NIST DADS defines twin grid file as: A point access method which is two simultaneous grid files . Points are shuffled between the primary and secondary file to minimize the total size.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.two34tree","kind":"concept","label":"2-3-4 tree","sources":[{"id":"nist-dads.two34tree","title":"NIST Dictionary of Algorithms and Data Structures: two34tree","url":"https://xlinux.nist.gov/dads/HTML/two34tree.html"}],"status":"reported","summary":"NIST DADS defines 2-3-4 tree as: A B-tree of order 4, that is, internal nodes have two, three, or four children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.twoway","kind":"method","label":"Two Way algorithm","sources":[{"id":"nist-dads.twoway","title":"NIST Dictionary of Algorithms and Data Structures: twoWay","url":"https://xlinux.nist.gov/dads/HTML/twoWay.html"}],"status":"reported","summary":"NIST DADS defines Two Way algorithm as: Partition (\"factor\") the pattern , x, into left, x l , and right, x r , parts in such a way to optimize searching. Compare x r left to right then, if it matches, compare x l right to left.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twodimensnal","kind":"concept","label":"two-dimensional","sources":[{"id":"nist-dads.twodimensnal","title":"NIST Dictionary of Algorithms and Data Structures: twodimensnal","url":"https://xlinux.nist.gov/dads/HTML/twodimensnal.html"}],"status":"reported","summary":"NIST DADS defines two-dimensional as: Dealing with or restricted to a plane. An organization where location can be completely described with exactly two orthogonal axes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twolevgrid","kind":"concept","label":"two-level grid file","sources":[{"id":"nist-dads.twolevgrid","title":"NIST Dictionary of Algorithms and Data Structures: twolevgrid","url":"https://xlinux.nist.gov/dads/HTML/twolevgrid.html"}],"status":"reported","summary":"NIST DADS defines two-level grid file as: A point access method which is two levels of grid files . The first level addresses second level grid files.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.twowaymrgsrt","kind":"method","label":"two-way merge sort","sources":[{"id":"nist-dads.twowaymrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: twowaymrgsrt","url":"https://xlinux.nist.gov/dads/HTML/twowaymrgsrt.html"}],"status":"reported","summary":"NIST DADS defines two-way merge sort as: A k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It merges runs from the two streams into an output stream. It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ubtree","kind":"concept","label":"UB-tree","sources":[{"id":"nist-dads.ubtree","title":"NIST Dictionary of Algorithms and Data Structures: ubtree","url":"https://xlinux.nist.gov/dads/HTML/ubtree.html"}],"status":"reported","summary":"NIST DADS defines UB-tree as: Refers to either universal B-tree or unlimited branching tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unaryfunc","kind":"concept","label":"unary function","sources":[{"id":"nist-dads.unaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: unaryfunc","url":"https://xlinux.nist.gov/dads/HTML/unaryfunc.html"}],"status":"reported","summary":"NIST DADS defines unary function as: A function which takes one argument.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unbiasedcoinflipalgo","kind":"method","label":"unbiased coin flipping algorithm","sources":[{"id":"nist-dads.unbiasedcoinflipalgo","title":"NIST Dictionary of Algorithms and Data Structures: unbiasedCoinFlipAlgo","url":"https://xlinux.nist.gov/dads/HTML/unbiasedCoinFlipAlgo.html"}],"status":"reported","summary":"NIST DADS defines unbiased coin flipping algorithm as: To get unbiased random bits, flip a coin twice. If it comes up heads then tails, the result bit is 1. It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uncomputablefunction","kind":"concept","label":"uncomputable function","sources":[{"id":"nist-dads.uncomputablefunction","title":"NIST Dictionary of Algorithms and Data Structures: uncomputableFunction","url":"https://xlinux.nist.gov/dads/HTML/uncomputableFunction.html"}],"status":"reported","summary":"NIST DADS defines uncomputable function as: A function that cannot be computed by any algorithm --- equivalently, not by any Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undecidablelanguage","kind":"concept","label":"undecidable language","sources":[{"id":"nist-dads.undecidablelanguage","title":"NIST Dictionary of Algorithms and Data Structures: undecidableLanguage","url":"https://xlinux.nist.gov/dads/HTML/undecidableLanguage.html"}],"status":"reported","summary":"NIST DADS defines undecidable language as: A language for which the membership cannot be decided by an algorithm --- equivalently, cannot be recognized by a Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undecidableproblem","kind":"concept","label":"undecidable problem","sources":[{"id":"nist-dads.undecidableproblem","title":"NIST Dictionary of Algorithms and Data Structures: undecidableProblem","url":"https://xlinux.nist.gov/dads/HTML/undecidableProblem.html"}],"status":"reported","summary":"NIST DADS defines undecidable problem as: A problem that cannot be solved for all cases by any algorithm whatsoever---equivalently, whose associated language cannot be recognized by a Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undirectedgraph","kind":"concept","label":"undirected graph","sources":[{"id":"nist-dads.undirectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: undirectedGraph","url":"https://xlinux.nist.gov/dads/HTML/undirectedGraph.html"}],"status":"reported","summary":"NIST DADS defines undirected graph as: A graph whose edges are unordered pairs of vertices . That is, each edge connects two vertices. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformcircuitcomplexity","kind":"concept","label":"uniform circuit complexity","sources":[{"id":"nist-dads.uniformcircuitcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: uniformCircuitComplexity","url":"https://xlinux.nist.gov/dads/HTML/uniformCircuitComplexity.html"}],"status":"reported","summary":"NIST DADS defines uniform circuit complexity as: The study of complexity classes defined by uniform circuit families .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformcircuitfamily","kind":"concept","label":"uniform circuit family","sources":[{"id":"nist-dads.uniformcircuitfamily","title":"NIST Dictionary of Algorithms and Data Structures: uniformCircuitFamily","url":"https://xlinux.nist.gov/dads/HTML/uniformCircuitFamily.html"}],"status":"reported","summary":"NIST DADS defines uniform circuit family as: A sequence of circuits , one for each input length n, that can be efficiently generated by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.uniformhashn","kind":"method","label":"uniform hashing","sources":[{"id":"nist-dads.uniformhashn","title":"NIST Dictionary of Algorithms and Data Structures: uniformhashn","url":"https://xlinux.nist.gov/dads/HTML/uniformhashn.html"}],"status":"reported","summary":"NIST DADS defines uniform hashing as: A conceptual method of open addressing for a hash table . A collision is resolved by putting the item in the next empty place given by a probe sequence which is independent of sequences for all other key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformmatrx","kind":"concept","label":"uniform matrix","sources":[{"id":"nist-dads.uniformmatrx","title":"NIST Dictionary of Algorithms and Data Structures: uniformmatrx","url":"https://xlinux.nist.gov/dads/HTML/uniformmatrx.html"}],"status":"reported","summary":"NIST DADS defines uniform matrix as: A matrix having the same number of items in each row.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.union","kind":"concept","label":"union","sources":[{"id":"nist-dads.union","title":"NIST Dictionary of Algorithms and Data Structures: union","url":"https://xlinux.nist.gov/dads/HTML/union.html"}],"status":"reported","summary":"NIST DADS defines union as: The union of two sets is a set having all members in either set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unionautoma","kind":"method","label":"union of automata","sources":[{"id":"nist-dads.unionautoma","title":"NIST Dictionary of Algorithms and Data Structures: unionautoma","url":"https://xlinux.nist.gov/dads/HTML/unionautoma.html"}],"status":"reported","summary":"NIST DADS defines union of automata as: Find an automaton that accepts everything which the automata accept individually.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universaltur","kind":"concept","label":"universal Turing machine","sources":[{"id":"nist-dads.universaltur","title":"NIST Dictionary of Algorithms and Data Structures: universalTur","url":"https://xlinux.nist.gov/dads/HTML/universalTur.html"}],"status":"reported","summary":"NIST DADS defines universal Turing machine as: A Turing machine that is capable of simulating any other Turing machine by encoding the latter.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universalhsh","kind":"concept","label":"universal hashing","sources":[{"id":"nist-dads.universalhsh","title":"NIST Dictionary of Algorithms and Data Structures: universalhsh","url":"https://xlinux.nist.gov/dads/HTML/universalhsh.html"}],"status":"reported","summary":"NIST DADS defines universal hashing as: A scheme that chooses randomly from a set of hash functions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universalstt","kind":"concept","label":"universal state","sources":[{"id":"nist-dads.universalstt","title":"NIST Dictionary of Algorithms and Data Structures: universalstt","url":"https://xlinux.nist.gov/dads/HTML/universalstt.html"}],"status":"reported","summary":"NIST DADS defines universal state as: A state in an alternating Turing machine from which the machine accepts only if all possible moves lead to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universe","kind":"concept","label":"universe","sources":[{"id":"nist-dads.universe","title":"NIST Dictionary of Algorithms and Data Structures: universe","url":"https://xlinux.nist.gov/dads/HTML/universe.html"}],"status":"reported","summary":"NIST DADS defines universe as: All potential elements of a set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unlimitedbranchingtree","kind":"concept","label":"unlimited branching tree","sources":[{"id":"nist-dads.unlimitedbranchingtree","title":"NIST Dictionary of Algorithms and Data Structures: unlimitedBranchingTree","url":"https://xlinux.nist.gov/dads/HTML/unlimitedBranchingTree.html"}],"status":"reported","summary":"NIST DADS defines unlimited branching tree as: A forest of ordered trees used to contain ordered lists . The root of each tree is unique. An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element). Lists with common prefixes share nodes. The last node in common has one child for each list. This allows rapid searches for subset inclusion of sequences.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unrank","kind":"method","label":"unranking","sources":[{"id":"nist-dads.unrank","title":"NIST Dictionary of Algorithms and Data Structures: unrank","url":"https://xlinux.nist.gov/dads/HTML/unrank.html"}],"status":"reported","summary":"NIST DADS defines unranking as: Given a ranking, r, generate the r th permutation of n elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unshufflsort","kind":"method","label":"UnShuffle sort","sources":[{"id":"nist-dads.unshufflsort","title":"NIST Dictionary of Algorithms and Data Structures: unshufflsort","url":"https://xlinux.nist.gov/dads/HTML/unshufflsort.html"}],"status":"reported","summary":"NIST DADS defines UnShuffle sort as: A distribution sort with two phases. In the first phase, the inputs are distributed among doubly-ended queues keeping the items in each queue ordered and creating a new queue when there is no place on an existing queue. The second phase is an ideal merge in which the item to be removed is determined by keeping the queues in a priority queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unsolvableproblem","kind":"concept","label":"unsolvable problem","sources":[{"id":"nist-dads.unsolvableproblem","title":"NIST Dictionary of Algorithms and Data Structures: unsolvableProblem","url":"https://xlinux.nist.gov/dads/HTML/unsolvableProblem.html"}],"status":"reported","summary":"NIST DADS defines unsolvable problem as: A computational problem that cannot be solved by a Turing machine . The associated function is called an uncomputable function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unsortedlist","kind":"concept","label":"unsorted list","sources":[{"id":"nist-dads.unsortedlist","title":"NIST Dictionary of Algorithms and Data Structures: unsortedList","url":"https://xlinux.nist.gov/dads/HTML/unsortedList.html"}],"status":"reported","summary":"NIST DADS defines unsorted list as: A list whose order of items, if any, is not known.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uppertriangularmatrix","kind":"concept","label":"upper triangular matrix","sources":[{"id":"nist-dads.uppertriangularmatrix","title":"NIST Dictionary of Algorithms and Data Structures: upperTriangularMatrix","url":"https://xlinux.nist.gov/dads/HTML/upperTriangularMatrix.html"}],"status":"reported","summary":"NIST DADS defines upper triangular matrix as: A matrix that is only defined at (i,j) when i ≤ j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vanemdeboas","kind":"concept","label":"van Emde-Boas priority queue","sources":[{"id":"nist-dads.vanemdeboas","title":"NIST Dictionary of Algorithms and Data Structures: vanemdeboas","url":"https://xlinux.nist.gov/dads/HTML/vanemdeboas.html"}],"status":"reported","summary":"NIST DADS defines van Emde-Boas priority queue as: An efficient implementation of priority queues where insert, delete, get minimum, get maximum, etc. take O(log log N) time, where N is the total possible number of keys . Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a bit vector of size N (if N is small), or a special data structure : an array of priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vehiclerouting","kind":"concept","label":"vehicle routing problem","sources":[{"id":"nist-dads.vehiclerouting","title":"NIST Dictionary of Algorithms and Data Structures: vehicleRouting","url":"https://xlinux.nist.gov/dads/HTML/vehicleRouting.html"}],"status":"reported","summary":"NIST DADS defines vehicle routing problem as: Find an optimal route of one or more vehicles through a graph . Also known as VRP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.venndiagram","kind":"concept","label":"Venn diagram","sources":[{"id":"nist-dads.venndiagram","title":"NIST Dictionary of Algorithms and Data Structures: venndiagram","url":"https://xlinux.nist.gov/dads/HTML/venndiagram.html"}],"status":"reported","summary":"NIST DADS defines Venn diagram as: A visual depiction of membership in sets according to binary properties, using overlapping ovals to divide the plane into regions. Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexconnectivity","kind":"concept","label":"vertex connectivity","sources":[{"id":"nist-dads.vertexconnectivity","title":"NIST Dictionary of Algorithms and Data Structures: vertexConnectivity","url":"https://xlinux.nist.gov/dads/HTML/vertexConnectivity.html"}],"status":"reported","summary":"NIST DADS defines vertex connectivity as: (1) The smallest number of vertices whose deletion causes a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexcolor","kind":"concept","label":"vertex coloring","sources":[{"id":"nist-dads.vertexcolor","title":"NIST Dictionary of Algorithms and Data Structures: vertexcolor","url":"https://xlinux.nist.gov/dads/HTML/vertexcolor.html"}],"status":"reported","summary":"NIST DADS defines vertex coloring as: An assignment of colors (or any distinct marks) to the vertices of a graph . Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexcover","kind":"concept","label":"vertex cover","sources":[{"id":"nist-dads.vertexcover","title":"NIST Dictionary of Algorithms and Data Structures: vertexcover","url":"https://xlinux.nist.gov/dads/HTML/vertexcover.html"}],"status":"reported","summary":"NIST DADS defines vertex cover as: A set of vertices in an undirected graph where every edge connects at least one vertex. The vertex cover problem is to find a minimum size set and is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertical","kind":"concept","label":"vertical visibility map","sources":[{"id":"nist-dads.vertical","title":"NIST Dictionary of Algorithms and Data Structures: vertical","url":"https://xlinux.nist.gov/dads/HTML/vertical.html"}],"status":"reported","summary":"NIST DADS defines vertical visibility map as: A partition of the plane into regions by drawing a vertical straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be vertically visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.visibilitymap","kind":"concept","label":"visibility map","sources":[{"id":"nist-dads.visibilitymap","title":"NIST Dictionary of Algorithms and Data Structures: visibilityMap","url":"https://xlinux.nist.gov/dads/HTML/visibilityMap.html"}],"status":"reported","summary":"NIST DADS defines visibility map as: A planar subdivision that encodes the visibility information, that is, which points are mutually visible .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.visible","kind":"concept","label":"visible","sources":[{"id":"nist-dads.visible","title":"NIST Dictionary of Algorithms and Data Structures: visible","url":"https://xlinux.nist.gov/dads/HTML/visible.html"}],"status":"reported","summary":"NIST DADS defines visible as: Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.viterbialgorithm","kind":"method","label":"Viterbi algorithm","sources":[{"id":"nist-dads.viterbialgorithm","title":"NIST Dictionary of Algorithms and Data Structures: viterbiAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/viterbiAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Viterbi algorithm as: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.vittersalgorithm","kind":"method","label":"Vitter's algorithm","sources":[{"id":"nist-dads.vittersalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: vittersAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/vittersAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Vitter's algorithm as: An adaptive Huffman coding scheme. Typically this produces codings the same length as or shorter than static Huffman coding . In the worst case , this uses one more bit per codeword .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.walk","kind":"concept","label":"walk","sources":[{"id":"nist-dads.walk","title":"NIST Dictionary of Algorithms and Data Structures: walk","url":"https://xlinux.nist.gov/dads/HTML/walk.html"}],"status":"reported","summary":"NIST DADS defines walk as: A path in which edges may be repeated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weakheap","kind":"concept","label":"weak-heap","sources":[{"id":"nist-dads.weakheap","title":"NIST Dictionary of Algorithms and Data Structures: weakheap","url":"https://xlinux.nist.gov/dads/HTML/weakheap.html"}],"status":"reported","summary":"NIST DADS defines weak-heap as: A relaxed heap satisfying the following three conditions: (1) every key in the right subtree of a node is greater than the key stored in the node itself, (2) the root has no left child , and (3) leaves are only found on the last two levels of the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.weakheapsort","kind":"method","label":"weak-heap sort","sources":[{"id":"nist-dads.weakheapsort","title":"NIST Dictionary of Algorithms and Data Structures: weakheapsort","url":"https://xlinux.nist.gov/dads/HTML/weakheapsort.html"}],"status":"reported","summary":"NIST DADS defines weak-heap sort as: A sort algorithm that builds a weak-heap , then repeatedly extracts the maximum item. In the worst case , the run time is O(n log n + 0.1 n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weighteddigraph","kind":"concept","label":"weighted, directed graph","sources":[{"id":"nist-dads.weighteddigraph","title":"NIST Dictionary of Algorithms and Data Structures: weightedDigraph","url":"https://xlinux.nist.gov/dads/HTML/weightedDigraph.html"}],"status":"reported","summary":"NIST DADS defines weighted, directed graph as: A directed graph that has a weight, or numeric value, associated with each edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.window","kind":"concept","label":"window","sources":[{"id":"nist-dads.window","title":"NIST Dictionary of Algorithms and Data Structures: window","url":"https://xlinux.nist.gov/dads/HTML/window.html"}],"status":"reported","summary":"NIST DADS defines window as: substring of the text that is aligned with the pattern .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.witness","kind":"concept","label":"witness","sources":[{"id":"nist-dads.witness","title":"NIST Dictionary of Algorithms and Data Structures: witness","url":"https://xlinux.nist.gov/dads/HTML/witness.html"}],"status":"reported","summary":"NIST DADS defines witness as: (1) a structure providing an easily verified bound on the optimal value of an optimization problem . Typically used in the analysis of an approximation algorithm to prove the performance guarantee . (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.work","kind":"concept","label":"work","sources":[{"id":"nist-dads.work","title":"NIST Dictionary of Algorithms and Data Structures: work","url":"https://xlinux.nist.gov/dads/HTML/work.html"}],"status":"reported","summary":"NIST DADS defines work as: The total number of operations taken by a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workdepthmdl","kind":"concept","label":"work-depth model","sources":[{"id":"nist-dads.workdepthmdl","title":"NIST Dictionary of Algorithms and Data Structures: workdepthmdl","url":"https://xlinux.nist.gov/dads/HTML/workdepthmdl.html"}],"status":"reported","summary":"NIST DADS defines work-depth model as: A model of parallel computation in which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workefficint","kind":"concept","label":"work-efficient","sources":[{"id":"nist-dads.workefficint","title":"NIST Dictionary of Algorithms and Data Structures: workefficint","url":"https://xlinux.nist.gov/dads/HTML/workefficint.html"}],"status":"reported","summary":"NIST DADS defines work-efficient as: A parallel algorithm which asymptotically requires at most a constant factor more work than the best known sequential algorithm or the optimal work.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workpreserv","kind":"concept","label":"work-preserving","sources":[{"id":"nist-dads.workpreserv","title":"NIST Dictionary of Algorithms and Data Structures: workpreserv","url":"https://xlinux.nist.gov/dads/HTML/workpreserv.html"}],"status":"reported","summary":"NIST DADS defines work-preserving as: A translation of an algorithm from one model of computation to another in which the work is the same in both models, to within a constant factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcaseexecutiontime","kind":"concept","label":"worst-case execution time","sources":[{"id":"nist-dads.worstcaseexecutiontime","title":"NIST Dictionary of Algorithms and Data Structures: worstCaseExecutionTime","url":"https://xlinux.nist.gov/dads/HTML/worstCaseExecutionTime.html"}],"status":"reported","summary":"NIST DADS defines worst-case execution time as: The execution time of an algorithm in the worst case . Also known as WCET.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcaseminimumaccess","kind":"concept","label":"worst-case minimum access","sources":[{"id":"nist-dads.worstcaseminimumaccess","title":"NIST Dictionary of Algorithms and Data Structures: worstCaseMinimumAccess","url":"https://xlinux.nist.gov/dads/HTML/worstCaseMinimumAccess.html"}],"status":"reported","summary":"NIST DADS defines worst-case minimum access as: A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the worst case .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcase","kind":"concept","label":"worst case","sources":[{"id":"nist-dads.worstcase","title":"NIST Dictionary of Algorithms and Data Structures: worstcase","url":"https://xlinux.nist.gov/dads/HTML/worstcase.html"}],"status":"reported","summary":"NIST DADS defines worst case as: (1) The situation or input that forces an algorithm or data structure to take the most time or resources. (2) Having to do with this situation or input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcasecost","kind":"concept","label":"worst-case cost","sources":[{"id":"nist-dads.worstcasecost","title":"NIST Dictionary of Algorithms and Data Structures: worstcaseCost","url":"https://xlinux.nist.gov/dads/HTML/worstcaseCost.html"}],"status":"reported","summary":"NIST DADS defines worst-case cost as: The highest possible use of resources of an algorithm , which occurs for the most pessimistic, or worst possible, input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.xor","kind":"concept","label":"xor","sources":[{"id":"nist-dads.xor","title":"NIST Dictionary of Algorithms and Data Structures: xor","url":"https://xlinux.nist.gov/dads/HTML/xor.html"}],"status":"reported","summary":"NIST DADS defines xor as: \"Exclusive OR\" or \"not equal to\" function: 0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0. Also known as exclusive or.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.zellerscongruence","kind":"method","label":"Zeller's congruence","sources":[{"id":"nist-dads.zellerscongruence","title":"NIST Dictionary of Algorithms and Data Structures: zellersCongruence","url":"https://xlinux.nist.gov/dads/HTML/zellersCongruence.html"}],"status":"reported","summary":"NIST DADS defines Zeller's congruence as: An algorithm to find the day of the week for any date.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zerobasedindexing","kind":"concept","label":"0-based indexing","sources":[{"id":"nist-dads.zerobasedindexing","title":"NIST Dictionary of Algorithms and Data Structures: zeroBasedIndexing","url":"https://xlinux.nist.gov/dads/HTML/zeroBasedIndexing.html"}],"status":"reported","summary":"NIST DADS defines 0-based indexing as: Indexing (an array ) beginning with 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zeroaryfunc","kind":"concept","label":"0-ary function","sources":[{"id":"nist-dads.zeroaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: zeroaryfunc","url":"https://xlinux.nist.gov/dads/HTML/zeroaryfunc.html"}],"status":"reported","summary":"NIST DADS defines 0-ary function as: A function that takes no arguments. Also known as nullary function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.zhutakaoka","kind":"method","label":"Zhu-Takaoka","sources":[{"id":"nist-dads.zhutakaoka","title":"NIST Dictionary of Algorithms and Data Structures: zhuTakaoka","url":"https://xlinux.nist.gov/dads/HTML/zhuTakaoka.html"}],"status":"reported","summary":"NIST DADS defines Zhu-Takaoka as: A string matching algorithm that is a variant of the Boyer-Moore algorithm. It uses two consecutive text characters to compute the bad character shift. It is faster when the alphabet or pattern is small, but the skip table grows quickly, slowing the pre-processing phase.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zipfian","kind":"concept","label":"Zipfian distribution","sources":[{"id":"nist-dads.zipfian","title":"NIST Dictionary of Algorithms and Data Structures: zipfian","url":"https://xlinux.nist.gov/dads/HTML/zipfian.html"}],"status":"reported","summary":"NIST DADS defines Zipfian distribution as: A distribution of probabilities of occurrence that follows Zipf's law . Also known as Yule distribution.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zipper","kind":"concept","label":"zipper","sources":[{"id":"nist-dads.zipper","title":"NIST Dictionary of Algorithms and Data Structures: zipper","url":"https://xlinux.nist.gov/dads/HTML/zipper.html"}],"status":"reported","summary":"NIST DADS defines zipper as: A data structure equivalent to a binary tree that is \"opened\" so that some node is accessible. It consists of a pair: the current node, along with information to reconstruct the tree. Reconstruction information is called the path or context. A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path. A similar operation moves to the right child. A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zpp","kind":"concept","label":"ZPP","sources":[{"id":"nist-dads.zpp","title":"NIST Dictionary of Algorithms and Data Structures: zpp","url":"https://xlinux.nist.gov/dads/HTML/zpp.html"}],"status":"reported","summary":"NIST DADS defines ZPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \" Z ero error P robability in P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that halts in polynomial time . M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.bionics","kind":"field","label":"Bionics","sources":[{"id":"nlm-mesh.96b0d9c21edd54e642e5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001701","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001701"}],"status":"reported","summary":"NLM MeSH describes Bionics as: The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","tags":["ology"]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.biotechnology","kind":"field","label":"Biotechnology","sources":[{"id":"nlm-mesh.e21655cf4050fe8a0ce0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001709"}],"status":"reported","summary":"NLM MeSH describes Biotechnology as: Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e., GENETIC ENGINEERING ) is a central focus; laboratory methods used include TRANSFECTION and CLONING technologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","tags":["ology"]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.nanotechnology","kind":"field","label":"Nanotechnology","sources":[{"id":"nlm-mesh.81fd205e36d18b028764","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D036103","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036103"}],"status":"reported","summary":"NLM MeSH describes Nanotechnology as: The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.andrology","kind":"field","label":"Andrology","sources":[{"id":"nlm-mesh.47e3bfae5378d264a4a6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D033441","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033441"}],"status":"reported","summary":"NLM MeSH describes Andrology as: A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include ENDOCRINOLOGY ; SPERMATOGENESIS ; SEMEN ANALYSIS ; FERTILIZATION ; CONTRACEPTION ; and CRYOPRESERVATION .","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.audiology","kind":"field","label":"Audiology","sources":[{"id":"nlm-mesh.6358ed9b75543994a867","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001298","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001298"}],"status":"reported","summary":"NLM MeSH describes Audiology as: Allied medical specialty that studies hearing and hearing impairment.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.cardiology","kind":"field","label":"Cardiology","sources":[{"id":"nlm-mesh.ef1675e27d8e1b53b18d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D002309","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002309"}],"status":"reported","summary":"NLM MeSH describes Cardiology as: The study of the heart, its physiology, and its functions.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.dermatology","kind":"field","label":"Dermatology","sources":[{"id":"nlm-mesh.963851b0921eef8ae42d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003880","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003880"}],"status":"reported","summary":"NLM MeSH describes Dermatology as: A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.gastroenterology","kind":"field","label":"Gastroenterology","sources":[{"id":"nlm-mesh.b5b237de56e2aaaa3266","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D005762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005762"}],"status":"reported","summary":"NLM MeSH describes Gastroenterology as: A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.gynecology","kind":"field","label":"Gynecology","sources":[{"id":"nlm-mesh.2d51683a5c47ff65a4e9","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D006176","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006176"}],"status":"reported","summary":"NLM MeSH describes Gynecology as: A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.hematology","kind":"field","label":"Hematology","sources":[{"id":"nlm-mesh.44db89f7a8e212468382","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D006405","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006405"}],"status":"reported","summary":"NLM MeSH describes Hematology as: A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neonatology","kind":"field","label":"Neonatology","sources":[{"id":"nlm-mesh.8268ca3c835135b3e0de","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009359"}],"status":"reported","summary":"NLM MeSH describes Neonatology as: A subspecialty of Pediatrics concerned with the newborn infant.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.nephrology","kind":"field","label":"Nephrology","sources":[{"id":"nlm-mesh.afe32e7cd24512af6fea","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009398","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009398"}],"status":"reported","summary":"NLM MeSH describes Nephrology as: A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neurology","kind":"field","label":"Neurology","sources":[{"id":"nlm-mesh.6ce32d2c745cf556384b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009462","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009462"}],"status":"reported","summary":"NLM MeSH describes Neurology as: A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neuropathology","kind":"field","label":"Neuropathology","sources":[{"id":"nlm-mesh.b195e4fedf3aa920449b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000069338","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069338"}],"status":"reported","summary":"NLM MeSH describes Neuropathology as: The branch of medicine and biomedical science concerned with diseases of the nervous system.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.ophthalmology","kind":"field","label":"Ophthalmology","sources":[{"id":"nlm-mesh.ef44f675a31fc40f56be","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009885","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009885"}],"status":"reported","summary":"NLM MeSH describes Ophthalmology as: A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.pharmacology","kind":"field","label":"Pharmacology","sources":[{"id":"nlm-mesh.72dc31200ed8c2a213c9","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010600"}],"status":"reported","summary":"NLM MeSH describes Pharmacology as: The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.psychopharmacology","kind":"field","label":"Psychopharmacology","sources":[{"id":"nlm-mesh.aac03d67dea48e69ae86","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011600"}],"status":"reported","summary":"NLM MeSH describes Psychopharmacology as: The study of the effects of drugs on mental and behavioral activity.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.radiology","kind":"field","label":"Radiology","sources":[{"id":"nlm-mesh.e9897a03354d6948a211","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011871","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011871"}],"status":"reported","summary":"NLM MeSH describes Radiology as: A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.rheumatology","kind":"field","label":"Rheumatology","sources":[{"id":"nlm-mesh.137dd360907a3740cb66","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012219","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012219"}],"status":"reported","summary":"NLM MeSH describes Rheumatology as: A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.serology","kind":"field","label":"Serology","sources":[{"id":"nlm-mesh.33ea8d12d5d7f3a0a806","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012699","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012699"}],"status":"reported","summary":"NLM MeSH describes Serology as: The study of serum, especially of antigen-antibody reactions in vitro.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.thanatology","kind":"field","label":"Thanatology","sources":[{"id":"nlm-mesh.8e3f51354957e235535b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D013795","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013795"}],"status":"reported","summary":"NLM MeSH describes Thanatology as: The study of the theory, philosophy, and doctrine of death.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.toxicology","kind":"field","label":"Toxicology","sources":[{"id":"nlm-mesh.c5eb56bf612a44ac8d8a","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014116","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014116"}],"status":"reported","summary":"NLM MeSH describes Toxicology as: The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.traumatology","kind":"field","label":"Traumatology","sources":[{"id":"nlm-mesh.8ae339a83d3cf2750aee","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014194","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014194"}],"status":"reported","summary":"NLM MeSH describes Traumatology as: The medical specialty which deals with WOUNDS and INJURIES as well as resulting disability and disorders from physical traumas.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.urology","kind":"field","label":"Urology","sources":[{"id":"nlm-mesh.0c9c3700d764125cf02e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014572","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014572"}],"status":"reported","summary":"NLM MeSH describes Urology as: A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction, URINARY INCONTINENCE , infections, and UROGENITAL NEOPLASMS .","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.paleography","kind":"field","label":"Paleography","sources":[{"id":"nlm-mesh.de31c6b64b58d9b44545","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010162","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010162"}],"status":"reported","summary":"NLM MeSH describes Paleography as: The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.philology","kind":"field","label":"Philology","sources":[{"id":"nlm-mesh.7bf6c0775e9e1bc14a38","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010680","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010680"}],"status":"reported","summary":"NLM MeSH describes Philology as: The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.theology","kind":"field","label":"Theology","sources":[{"id":"nlm-mesh.0e8764007d2f3f2a9f63","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D028725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028725"}],"status":"reported","summary":"NLM MeSH describes Theology as: The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.cognitive-psychology","kind":"field","label":"Cognitive psychology","sources":[{"id":"nlm-mesh.84e5e4de8f730357653e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000090182","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090182"},{"id":"nlm-mesh.3afa87c4efa263dea007","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019336"}],"status":"reported","summary":"NLM MeSH describes Cognitive psychology as: Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.computational-biology","kind":"field","label":"Computational biology","sources":[{"id":"nlm-mesh.e55950fe926d0ebee0e8","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019295","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019295"}],"status":"reported","summary":"NLM MeSH describes Computational biology as: A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.psycholinguistics","kind":"field","label":"Psycholinguistics","sources":[{"id":"nlm-mesh.14af6d0afad21004276f","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011578","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011578"}],"status":"reported","summary":"NLM MeSH describes Psycholinguistics as: A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cryobiology","kind":"field","label":"Cryobiology","sources":[{"id":"nlm-mesh.946d44c7d4c966d8f70c","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000073920","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073920"}],"status":"reported","summary":"NLM MeSH describes Cryobiology as: The study of biological materials or systems subjected to temperatures below their normal range.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cytology","kind":"field","label":"Cytology","sources":[{"id":"nlm-mesh.0d50c20ba335a36532f3","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000093222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000093222"}],"status":"reported","summary":"NLM MeSH describes Cytology as: The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.embryology","kind":"field","label":"Embryology","sources":[{"id":"nlm-mesh.fe237ee68bf6ac2997f1","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004626","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004626"}],"status":"reported","summary":"NLM MeSH describes Embryology as: The study of the development of an organism during the embryonic and fetal stages of life.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.genomics","kind":"field","label":"Genomics","sources":[{"id":"nlm-mesh.effd12a7827847f3b1ba","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D023281","url":"https://meshb.nlm.nih.gov/record/ui?ui=D023281"}],"status":"reported","summary":"NLM MeSH describes Genomics as: The systematic study of the complete DNA sequences ( GENOME ) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in GENOME WIDE ASSOCIATION STUDIES .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.glycobiology","kind":"field","label":"Glycobiology","sources":[{"id":"nlm-mesh.7bc5eafef50d053d5814","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000099126","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099126"}],"status":"reported","summary":"NLM MeSH describes Glycobiology as: The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.neurobiology","kind":"field","label":"Neurobiology","sources":[{"id":"nlm-mesh.8d297a4fd89adab5fa15","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009446","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009446"}],"status":"reported","summary":"NLM MeSH describes Neurobiology as: The study of the structure, growth, activities, and functions of NEURONS and the NERVOUS SYSTEM .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.pharmacognosy","kind":"field","label":"Pharmacognosy","sources":[{"id":"nlm-mesh.77137917b685045258f0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010598","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010598"}],"status":"reported","summary":"NLM MeSH describes Pharmacognosy as: The science of drugs prepared from natural-sources including preparations from PLANTS , animals, and other organisms as well as MINERALS and other substances included in MATERIA MEDICA . The therapeutic usage of plants is PHYTOTHERAPY .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.physiology","kind":"field","label":"Physiology","sources":[{"id":"nlm-mesh.c63837a70e6aa338de39","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010827","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010827"}],"status":"reported","summary":"NLM MeSH describes Physiology as: The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.proteomics","kind":"field","label":"Proteomics","sources":[{"id":"nlm-mesh.55c7bf5248c252ae0c2b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D040901","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040901"}],"status":"reported","summary":"NLM MeSH describes Proteomics as: The systematic study of the complete complement of proteins ( PROTEOME ) of organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.sociobiology","kind":"field","label":"Sociobiology","sources":[{"id":"nlm-mesh.0390edf50d0d577e17eb","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D035503","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035503"}],"status":"reported","summary":"NLM MeSH describes Sociobiology as: The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.teratology","kind":"field","label":"Teratology","sources":[{"id":"nlm-mesh.60ac9995c95fb563be08","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D018600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018600"}],"status":"reported","summary":"NLM MeSH describes Teratology as: A branch of embryology for the study of congenital malformations and developmental abnormalities.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.photobiology","kind":"field","label":"Photobiology","sources":[{"id":"nlm-mesh.99640cd221760e32fc9e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D018462","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018462"}],"status":"reported","summary":"NLM MeSH describes Photobiology as: The branch of biology dealing with the effect of light on organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.radiobiology","kind":"field","label":"Radiobiology","sources":[{"id":"nlm-mesh.4614a1a23cf1eb79c224","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011853","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011853"}],"status":"reported","summary":"NLM MeSH describes Radiobiology as: Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","tags":["ology"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"ology.rheology","kind":"field","label":"Rheology","sources":[{"id":"nlm-mesh.672caf2b40c74990f490","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012212"}],"status":"reported","summary":"NLM MeSH describes Rheology as: The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and VISCOSITY .","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.criminology","kind":"field","label":"Criminology","sources":[{"id":"nlm-mesh.49b6dba2f266b504ca82","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003418","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003418"}],"status":"reported","summary":"NLM MeSH describes Criminology as: The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.demography","kind":"field","label":"Demography","sources":[{"id":"nlm-mesh.cf575eadb37c41446ec6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003710","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003710"}],"status":"reported","summary":"NLM MeSH describes Demography as: Statistical interpretation and description of a population with reference to distribution, composition, or structure.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.ethnology","kind":"field","label":"Ethnology","sources":[{"id":"nlm-mesh.3294b344080d4d981ed0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D005007","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005007"}],"status":"reported","summary":"NLM MeSH describes Ethnology as: The comparative and theoretical study of culture, often synonymous with cultural anthropology.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.neuropsychology","kind":"field","label":"Neuropsychology","sources":[{"id":"nlm-mesh.ef3566806174802f82a1","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009484","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009484"}],"status":"reported","summary":"NLM MeSH describes Neuropsychology as: A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.psychopathology","kind":"field","label":"Psychopathology","sources":[{"id":"nlm-mesh.cfcfe0e017d161687831","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011599","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011599"}],"status":"reported","summary":"NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.sexology","kind":"field","label":"Sexology","sources":[{"id":"nlm-mesh.e1b8584f6a96cec5e422","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D044347","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044347"}],"status":"reported","summary":"NLM MeSH describes Sexology as: This discipline concerns the study of SEXUALITY , and the application of sexual knowledge such as sexual attitudes, psychology, and SEXUAL BEHAVIOR . Scope of application generally includes educational ( SEX EDUCATION ), clinical ( SEX COUNSELING ), and other settings.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.fermi-grb090510-photons","kind":"dataset","label":"Fermi-LAT GRB 090510 photon observations","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: The photon observations of GRB090510 collected by Fermi-LAT are analyzed in the cited work to constrain energy-dependent vacuum dispersion, under its stated source and propagation assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.lz-wimp-280-live-days","kind":"dataset","label":"LZ WIMP-search data from 280 live days","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP-search analysis uses detector data corresponding to 4.2 ± 0.1 tonne-years of total exposure over 280 live days. It reports no excess over expected backgrounds.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008511","kind":"field","label":"Medicine","sources":[{"id":"nlm-mesh.d008511","title":"NLM MeSH Browser descriptor D008511","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008511"}],"status":"reported","summary":"NLM MeSH describes Medicine as: The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000073316","kind":"field","label":"Addiction Medicine","sources":[{"id":"nlm-mesh.d000073316","title":"NLM MeSH Browser descriptor D000073316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073316"}],"status":"reported","summary":"NLM MeSH describes Addiction Medicine as: A medical specialty focused on the diagnosis and treatment of ADDICTIVE BEHAVIOR disorders, including SUBSTANCE-RELATED DISORDERS and IMPULSE CONTROL DISORDERS ; and the management of co-occurring medical and psychiatric conditions","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000295","kind":"field","label":"Adolescent Medicine","sources":[{"id":"nlm-mesh.d000295","title":"NLM MeSH Browser descriptor D000295","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000295"}],"status":"reported","summary":"NLM MeSH describes Adolescent Medicine as: A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of ADOLESCENCE .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000337","kind":"field","label":"Aerospace Medicine","sources":[{"id":"nlm-mesh.d000337","title":"NLM MeSH Browser descriptor D000337","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000337"}],"status":"reported","summary":"NLM MeSH describes Aerospace Medicine as: That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from NASA Thesaurus)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000486","kind":"field","label":"Allergy and Immunology","sources":[{"id":"nlm-mesh.d000486","title":"NLM MeSH Browser descriptor D000486","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000486"}],"status":"reported","summary":"NLM MeSH describes Allergy and Immunology as: A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000776","kind":"field","label":"Anesthesiology","sources":[{"id":"nlm-mesh.d000776","title":"NLM MeSH Browser descriptor D000776","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000776"}],"status":"reported","summary":"NLM MeSH describes Anesthesiology as: A specialty concerned with the study of anesthetics and anesthesia.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d052938","kind":"field","label":"Bariatric Medicine","sources":[{"id":"nlm-mesh.d052938","title":"NLM MeSH Browser descriptor D052938","url":"https://meshb.nlm.nih.gov/record/ui?ui=D052938"}],"status":"reported","summary":"NLM MeSH describes Bariatric Medicine as: The discipline concerned with WEIGHT REDUCTION in patients with OBESITY .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d001524","kind":"field","label":"Behavioral Medicine","sources":[{"id":"nlm-mesh.d001524","title":"NLM MeSH Browser descriptor D001524","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001524"}],"status":"reported","summary":"NLM MeSH describes Behavioral Medicine as: The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015510","kind":"field","label":"Clinical Medicine","sources":[{"id":"nlm-mesh.d015510","title":"NLM MeSH Browser descriptor D015510","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015510"}],"status":"reported","summary":"NLM MeSH describes Clinical Medicine as: The study and practice of medicine by direct examination of the patient.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003154","kind":"field","label":"Community Medicine","sources":[{"id":"nlm-mesh.d003154","title":"NLM MeSH Browser descriptor D003154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003154"}],"status":"reported","summary":"NLM MeSH describes Community Medicine as: A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d054597","kind":"field","label":"Disaster Medicine","sources":[{"id":"nlm-mesh.d054597","title":"NLM MeSH Browser descriptor D054597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054597"}],"status":"reported","summary":"NLM MeSH describes Disaster Medicine as: Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d004635","kind":"field","label":"Emergency Medicine","sources":[{"id":"nlm-mesh.d004635","title":"NLM MeSH Browser descriptor D004635","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004635"}],"status":"reported","summary":"NLM MeSH describes Emergency Medicine as: The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005554","kind":"field","label":"Forensic Medicine","sources":[{"id":"nlm-mesh.d005554","title":"NLM MeSH Browser descriptor D005554","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005554"}],"status":"reported","summary":"NLM MeSH describes Forensic Medicine as: The application of medical knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000099079","kind":"field","label":"Functional Medicine","sources":[{"id":"nlm-mesh.d000099079","title":"NLM MeSH Browser descriptor D000099079","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099079"}],"status":"reported","summary":"NLM MeSH describes Functional Medicine as: The clinical application of SYSTEMS BIOLOGY , that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d058006","kind":"field","label":"General Practice","sources":[{"id":"nlm-mesh.d058006","title":"NLM MeSH Browser descriptor D058006","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058006"}],"status":"reported","summary":"NLM MeSH describes General Practice as: Patient-based medical care provided across age and gender or specialty boundaries.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005826","kind":"field","label":"Genetics, Medical","sources":[{"id":"nlm-mesh.d005826","title":"NLM MeSH Browser descriptor D005826","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005826"}],"status":"reported","summary":"NLM MeSH describes Genetics, Medical as: A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d062306","kind":"field","label":"Geography, Medical","sources":[{"id":"nlm-mesh.d062306","title":"NLM MeSH Browser descriptor D062306","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062306"}],"status":"reported","summary":"NLM MeSH describes Geography, Medical as: The area of medicine concerned with the effects on health and disease due to geographic factors such as CLIMATE , environmental conditions, and geographic location.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005853","kind":"field","label":"Geriatrics","sources":[{"id":"nlm-mesh.d005853","title":"NLM MeSH Browser descriptor D005853","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005853"}],"status":"reported","summary":"NLM MeSH describes Geriatrics as: The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014943","kind":"field","label":"Global Health","sources":[{"id":"nlm-mesh.d014943","title":"NLM MeSH Browser descriptor D014943","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014943"}],"status":"reported","summary":"NLM MeSH describes Global Health as: A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064416","kind":"field","label":"Hospital Medicine","sources":[{"id":"nlm-mesh.d064416","title":"NLM MeSH Browser descriptor D064416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064416"}],"status":"reported","summary":"NLM MeSH describes Hospital Medicine as: The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055048","kind":"field","label":"Integrative Medicine","sources":[{"id":"nlm-mesh.d055048","title":"NLM MeSH Browser descriptor D055048","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055048"}],"status":"reported","summary":"NLM MeSH describes Integrative Medicine as: The discipline concerned with using the combination of conventional allopathic medicine and ALTERNATIVE MEDICINE to address the biological, psychological, social, and spiritual aspects of health and illness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d007388","kind":"field","label":"Internal Medicine","sources":[{"id":"nlm-mesh.d007388","title":"NLM MeSH Browser descriptor D007388","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007388"}],"status":"reported","summary":"NLM MeSH describes Internal Medicine as: A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008887","kind":"field","label":"Military Medicine","sources":[{"id":"nlm-mesh.d008887","title":"NLM MeSH Browser descriptor D008887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008887"}],"status":"reported","summary":"NLM MeSH describes Military Medicine as: The practice of medicine as applied to special circumstances associated with military operations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d062346","kind":"field","label":"Molecular Medicine","sources":[{"id":"nlm-mesh.d062346","title":"NLM MeSH Browser descriptor D062346","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062346"}],"status":"reported","summary":"NLM MeSH describes Molecular Medicine as: The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize MOLECULAR BIOLOGY techniques.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009326","kind":"field","label":"Naval Medicine","sources":[{"id":"nlm-mesh.d009326","title":"NLM MeSH Browser descriptor D009326","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009326"}],"status":"reported","summary":"NLM MeSH describes Naval Medicine as: The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010021","kind":"field","label":"Osteopathic Medicine","sources":[{"id":"nlm-mesh.d010021","title":"NLM MeSH Browser descriptor D010021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010021"}],"status":"reported","summary":"NLM MeSH describes Osteopathic Medicine as: A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the MUSCULOSKELETAL SYSTEM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d065126","kind":"field","label":"Palliative Medicine","sources":[{"id":"nlm-mesh.d065126","title":"NLM MeSH Browser descriptor D065126","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065126"}],"status":"reported","summary":"NLM MeSH describes Palliative Medicine as: A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010372","kind":"field","label":"Pediatrics","sources":[{"id":"nlm-mesh.d010372","title":"NLM MeSH Browser descriptor D010372","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010372"}],"status":"reported","summary":"NLM MeSH describes Pediatrics as: A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000079645","kind":"field","label":"Perioperative Medicine","sources":[{"id":"nlm-mesh.d000079645","title":"NLM MeSH Browser descriptor D000079645","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079645"}],"status":"reported","summary":"NLM MeSH describes Perioperative Medicine as: A medical specialty concerned with the patient before and after surgical procedures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010810","kind":"field","label":"Physical and Rehabilitation Medicine","sources":[{"id":"nlm-mesh.d010810","title":"NLM MeSH Browser descriptor D010810","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010810"}],"status":"reported","summary":"NLM MeSH describes Physical and Rehabilitation Medicine as: A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011570","kind":"field","label":"Psychiatry","sources":[{"id":"nlm-mesh.d011570","title":"NLM MeSH Browser descriptor D011570","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011570"}],"status":"reported","summary":"NLM MeSH describes Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011634","kind":"field","label":"Public Health","sources":[{"id":"nlm-mesh.d011634","title":"NLM MeSH Browser descriptor D011634","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011634"}],"status":"reported","summary":"NLM MeSH describes Public Health as: Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d044968","kind":"field","label":"Regenerative Medicine","sources":[{"id":"nlm-mesh.d044968","title":"NLM MeSH Browser descriptor D044968","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044968"}],"status":"reported","summary":"NLM MeSH describes Regenerative Medicine as: A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via TISSUE ENGINEERING ; CELL TRANSPLANTATION ; and ARTIFICIAL ORGANS and BIOARTIFICIAL ORGANS and tissues.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d018456","kind":"field","label":"Reproductive Medicine","sources":[{"id":"nlm-mesh.d018456","title":"NLM MeSH Browser descriptor D018456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018456"}],"status":"reported","summary":"NLM MeSH describes Reproductive Medicine as: A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d012936","kind":"field","label":"Social Medicine","sources":[{"id":"nlm-mesh.d012936","title":"NLM MeSH Browser descriptor D012936","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012936"}],"status":"reported","summary":"NLM MeSH describes Social Medicine as: A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013043","kind":"field","label":"Specialties, Surgical","sources":[{"id":"nlm-mesh.d013043","title":"NLM MeSH Browser descriptor D013043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013043"}],"status":"reported","summary":"NLM MeSH describes Specialties, Surgical as: Various branches of surgical practice limited to specialized areas.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013178","kind":"field","label":"Sports Medicine","sources":[{"id":"nlm-mesh.d013178","title":"NLM MeSH Browser descriptor D013178","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013178"}],"status":"reported","summary":"NLM MeSH describes Sports Medicine as: The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000068936","kind":"field","label":"Theranostic Nanomedicine","sources":[{"id":"nlm-mesh.d000068936","title":"NLM MeSH Browser descriptor D000068936","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000068936"}],"status":"reported","summary":"NLM MeSH describes Theranostic Nanomedicine as: An integrated nano-scale approach to MEDICINE which involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057236","kind":"field","label":"Travel Medicine","sources":[{"id":"nlm-mesh.d057236","title":"NLM MeSH Browser descriptor D057236","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057236"}],"status":"reported","summary":"NLM MeSH describes Travel Medicine as: Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international TRAVEL . Key element of patient's pre-travel visit to the physician is a health risk assessment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014330","kind":"field","label":"Tropical Medicine","sources":[{"id":"nlm-mesh.d014330","title":"NLM MeSH Browser descriptor D014330","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014330"}],"status":"reported","summary":"NLM MeSH describes Tropical Medicine as: The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000078782","kind":"field","label":"Vaccinology","sources":[{"id":"nlm-mesh.d000078782","title":"NLM MeSH Browser descriptor D000078782","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078782"}],"status":"reported","summary":"NLM MeSH describes Vaccinology as: Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014686","kind":"field","label":"Venereology","sources":[{"id":"nlm-mesh.d014686","title":"NLM MeSH Browser descriptor D014686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014686"}],"status":"reported","summary":"NLM MeSH describes Venereology as: A branch of medicine which deals with sexually transmitted disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055813","kind":"field","label":"Wilderness Medicine","sources":[{"id":"nlm-mesh.d055813","title":"NLM MeSH Browser descriptor D055813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055813"}],"status":"reported","summary":"NLM MeSH describes Wilderness Medicine as: Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d007120","kind":"field","label":"Immunochemistry","sources":[{"id":"nlm-mesh.d007120","title":"NLM MeSH Browser descriptor D007120","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007120"}],"status":"reported","summary":"NLM MeSH describes Immunochemistry as: Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000095763","kind":"field","label":"Immunoinformatics","sources":[{"id":"nlm-mesh.d000095763","title":"NLM MeSH Browser descriptor D000095763","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095763"}],"status":"reported","summary":"NLM MeSH describes Immunoinformatics as: The interface between INFORMATICS and IMMUNOLOGY . Otherwise known as computational immunology, it is the use of computational methods and resources for studying IMMUNE SYSTEM PHENOMENA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d019317","kind":"field","label":"Evidence-Based Medicine","sources":[{"id":"nlm-mesh.d019317","title":"NLM MeSH Browser descriptor D019317","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019317"}],"status":"reported","summary":"NLM MeSH describes Evidence-Based Medicine as: An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000088744","kind":"field","label":"Genomic Medicine","sources":[{"id":"nlm-mesh.d000088744","title":"NLM MeSH Browser descriptor D000088744","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088744"}],"status":"reported","summary":"NLM MeSH describes Genomic Medicine as: A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use. (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057285","kind":"field","label":"Precision Medicine","sources":[{"id":"nlm-mesh.d057285","title":"NLM MeSH Browser descriptor D057285","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057285"}],"status":"reported","summary":"NLM MeSH describes Precision Medicine as: Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000070316","kind":"field","label":"Pediatric Emergency Medicine","sources":[{"id":"nlm-mesh.d000070316","title":"NLM MeSH Browser descriptor D000070316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070316"}],"status":"reported","summary":"NLM MeSH describes Pediatric Emergency Medicine as: Branch of EMERGENCY MEDICINE dealing with the emergency care of children.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d053803","kind":"field","label":"Forensic Genetics","sources":[{"id":"nlm-mesh.d053803","title":"NLM MeSH Browser descriptor D053803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053803"}],"status":"reported","summary":"NLM MeSH describes Forensic Genetics as: The application of genetic analyses and MOLECULAR DIAGNOSTIC TECHNIQUES to legal matters and crime analysis.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d049429","kind":"field","label":"Forensic Pathology","sources":[{"id":"nlm-mesh.d049429","title":"NLM MeSH Browser descriptor D049429","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049429"}],"status":"reported","summary":"NLM MeSH describes Forensic Pathology as: The application of pathology to questions of law.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005194","kind":"field","label":"Family Practice","sources":[{"id":"nlm-mesh.d005194","title":"NLM MeSH Browser descriptor D005194","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005194"}],"status":"reported","summary":"NLM MeSH describes Family Practice as: A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d019371","kind":"field","label":"Topography, Medical","sources":[{"id":"nlm-mesh.d019371","title":"NLM MeSH Browser descriptor D019371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019371"}],"status":"reported","summary":"NLM MeSH describes Topography, Medical as: The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from EPIDEMIOLOGY in that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000089323","kind":"field","label":"Geroscience","sources":[{"id":"nlm-mesh.d000089323","title":"NLM MeSH Browser descriptor D000089323","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089323"}],"status":"reported","summary":"NLM MeSH describes Geroscience as: The study of the BIOLOGY ; BIOCHEMISTRY ; and PHYSIOLOGY of AGING and the AGED and age-related diseases such as CARDIOVASCULAR DISEASES ; DIABETES MELLITUS ; and CANCER , as well as debilitating conditions like ARTHRITIS ; FATIGUE ; and FRAILTY .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055552","kind":"field","label":"Infectious Disease Medicine","sources":[{"id":"nlm-mesh.d055552","title":"NLM MeSH Browser descriptor D055552","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055552"}],"status":"reported","summary":"NLM MeSH describes Infectious Disease Medicine as: A branch of internal medicine concerned with the diagnosis and treatment of INFECTIOUS DISEASES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008495","kind":"field","label":"Medical Oncology","sources":[{"id":"nlm-mesh.d008495","title":"NLM MeSH Browser descriptor D008495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008495"}],"status":"reported","summary":"NLM MeSH describes Medical Oncology as: A subspecialty of internal medicine concerned with the study of neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015272","kind":"field","label":"Pulmonary Medicine","sources":[{"id":"nlm-mesh.d015272","title":"NLM MeSH Browser descriptor D015272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015272"}],"status":"reported","summary":"NLM MeSH describes Pulmonary Medicine as: A subspecialty of internal medicine concerned with the study of the RESPIRATORY SYSTEM . It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d056508","kind":"field","label":"Sleep Medicine Specialty","sources":[{"id":"nlm-mesh.d056508","title":"NLM MeSH Browser descriptor D056508","url":"https://meshb.nlm.nih.gov/record/ui?ui=D056508"}],"status":"reported","summary":"NLM MeSH describes Sleep Medicine Specialty as: A medical specialty concerned with the diagnosis and treatment of SLEEP WAKE DISORDERS and their causes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000099051","kind":"field","label":"Diving and Hyperbaric Medicine","sources":[{"id":"nlm-mesh.d000099051","title":"NLM MeSH Browser descriptor D000099051","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099051"}],"status":"reported","summary":"NLM MeSH describes Diving and Hyperbaric Medicine as: The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013366","kind":"field","label":"Submarine Medicine","sources":[{"id":"nlm-mesh.d013366","title":"NLM MeSH Browser descriptor D013366","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013366"}],"status":"reported","summary":"NLM MeSH describes Submarine Medicine as: The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d063165","kind":"field","label":"Neurotology","sources":[{"id":"nlm-mesh.d063165","title":"NLM MeSH Browser descriptor D063165","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063165"}],"status":"reported","summary":"NLM MeSH describes Neurotology as: A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010338","kind":"field","label":"Pathology, Clinical","sources":[{"id":"nlm-mesh.d010338","title":"NLM MeSH Browser descriptor D010338","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010338"}],"status":"reported","summary":"NLM MeSH describes Pathology, Clinical as: A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057089","kind":"field","label":"Pathology, Molecular","sources":[{"id":"nlm-mesh.d057089","title":"NLM MeSH Browser descriptor D057089","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057089"}],"status":"reported","summary":"NLM MeSH describes Pathology, Molecular as: A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010340","kind":"field","label":"Pathology, Surgical","sources":[{"id":"nlm-mesh.d010340","title":"NLM MeSH Browser descriptor D010340","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010340"}],"status":"reported","summary":"NLM MeSH describes Pathology, Surgical as: A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010500","kind":"field","label":"Perinatology","sources":[{"id":"nlm-mesh.d010500","title":"NLM MeSH Browser descriptor D010500","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010500"}],"status":"reported","summary":"NLM MeSH describes Perinatology as: The branch of medicine dealing with the FETUS and NEWBORN during the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000296","kind":"field","label":"Adolescent Psychiatry","sources":[{"id":"nlm-mesh.d000296","title":"NLM MeSH Browser descriptor D000296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000296"}],"status":"reported","summary":"NLM MeSH describes Adolescent Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d001689","kind":"field","label":"Biological Psychiatry","sources":[{"id":"nlm-mesh.d001689","title":"NLM MeSH Browser descriptor D001689","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001689"}],"status":"reported","summary":"NLM MeSH describes Biological Psychiatry as: An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d002665","kind":"field","label":"Child Psychiatry","sources":[{"id":"nlm-mesh.d002665","title":"NLM MeSH Browser descriptor D002665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002665"}],"status":"reported","summary":"NLM MeSH describes Child Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003158","kind":"field","label":"Community Psychiatry","sources":[{"id":"nlm-mesh.d003158","title":"NLM MeSH Browser descriptor D003158","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003158"}],"status":"reported","summary":"NLM MeSH describes Community Psychiatry as: Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005555","kind":"field","label":"Forensic Psychiatry","sources":[{"id":"nlm-mesh.d005555","title":"NLM MeSH Browser descriptor D005555","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005555"}],"status":"reported","summary":"NLM MeSH describes Forensic Psychiatry as: Psychiatry in its legal aspects. This includes criminology, penology, COMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS , the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005852","kind":"field","label":"Geriatric Psychiatry","sources":[{"id":"nlm-mesh.d005852","title":"NLM MeSH Browser descriptor D005852","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005852"}],"status":"reported","summary":"NLM MeSH describes Geriatric Psychiatry as: A subspecialty of psychiatry concerned with the mental health of the aged.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008890","kind":"field","label":"Military Psychiatry","sources":[{"id":"nlm-mesh.d008890","title":"NLM MeSH Browser descriptor D008890","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008890"}],"status":"reported","summary":"NLM MeSH describes Military Psychiatry as: Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d058027","kind":"field","label":"Neuropsychiatry","sources":[{"id":"nlm-mesh.d058027","title":"NLM MeSH Browser descriptor D058027","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058027"}],"status":"reported","summary":"NLM MeSH describes Neuropsychiatry as: A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011315","kind":"field","label":"Preventive Medicine","sources":[{"id":"nlm-mesh.d011315","title":"NLM MeSH Browser descriptor D011315","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011315"}],"status":"reported","summary":"NLM MeSH describes Preventive Medicine as: A medical specialty primarily concerned with prevention of disease ( PRIMARY PREVENTION ) and the promotion and preservation of health in the individual.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009683","kind":"field","label":"Nuclear Medicine","sources":[{"id":"nlm-mesh.d009683","title":"NLM MeSH Browser descriptor D009683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009683"}],"status":"reported","summary":"NLM MeSH describes Nuclear Medicine as: A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d018787","kind":"field","label":"Radiation Oncology","sources":[{"id":"nlm-mesh.d018787","title":"NLM MeSH Browser descriptor D018787","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018787"}],"status":"reported","summary":"NLM MeSH describes Radiation Oncology as: A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000085843","kind":"field","label":"Imaging Genomics","sources":[{"id":"nlm-mesh.d000085843","title":"NLM MeSH Browser descriptor D000085843","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085843"}],"status":"reported","summary":"NLM MeSH describes Imaging Genomics as: The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000085844","kind":"field","label":"Radiation Genomics","sources":[{"id":"nlm-mesh.d000085844","title":"NLM MeSH Browser descriptor D000085844","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085844"}],"status":"reported","summary":"NLM MeSH describes Radiation Genomics as: The study of the association between patient genomic data and the response to IONIZING RADIATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015642","kind":"field","label":"Radiology, Interventional","sources":[{"id":"nlm-mesh.d015642","title":"NLM MeSH Browser descriptor D015642","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015642"}],"status":"reported","summary":"NLM MeSH describes Radiology, Interventional as: Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000096725","kind":"field","label":"Acute Care Surgery","sources":[{"id":"nlm-mesh.d000096725","title":"NLM MeSH Browser descriptor D000096725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096725"}],"status":"reported","summary":"NLM MeSH describes Acute Care Surgery as: Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003107","kind":"field","label":"Colorectal Surgery","sources":[{"id":"nlm-mesh.d003107","title":"NLM MeSH Browser descriptor D003107","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003107"}],"status":"reported","summary":"NLM MeSH describes Colorectal Surgery as: A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the COLON ; RECTUM ; and ANAL CANAL .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013502","kind":"field","label":"General Surgery","sources":[{"id":"nlm-mesh.d013502","title":"NLM MeSH Browser descriptor D013502","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013502"}],"status":"reported","summary":"NLM MeSH describes General Surgery as: A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009493","kind":"field","label":"Neurosurgery","sources":[{"id":"nlm-mesh.d009493","title":"NLM MeSH Browser descriptor D009493","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009493"}],"status":"reported","summary":"NLM MeSH describes Neurosurgery as: A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009774","kind":"field","label":"Obstetrics","sources":[{"id":"nlm-mesh.d009774","title":"NLM MeSH Browser descriptor D009774","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009774"}],"status":"reported","summary":"NLM MeSH describes Obstetrics as: A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057909","kind":"field","label":"Orthognathic Surgery","sources":[{"id":"nlm-mesh.d057909","title":"NLM MeSH Browser descriptor D057909","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057909"}],"status":"reported","summary":"NLM MeSH describes Orthognathic Surgery as: A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related MAXILLOFACIAL ABNORMALITIES (e.g., CLEFT PALATE ; RETROGNATHISM ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009985","kind":"field","label":"Orthopedics","sources":[{"id":"nlm-mesh.d009985","title":"NLM MeSH Browser descriptor D009985","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009985"}],"status":"reported","summary":"NLM MeSH describes Orthopedics as: A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010036","kind":"field","label":"Otolaryngology","sources":[{"id":"nlm-mesh.d010036","title":"NLM MeSH Browser descriptor D010036","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010036"}],"status":"reported","summary":"NLM MeSH describes Otolaryngology as: A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013518","kind":"field","label":"Surgery, Plastic","sources":[{"id":"nlm-mesh.d013518","title":"NLM MeSH Browser descriptor D013518","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013518"}],"status":"reported","summary":"NLM MeSH describes Surgery, Plastic as: The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000071077","kind":"field","label":"Surgical Oncology","sources":[{"id":"nlm-mesh.d000071077","title":"NLM MeSH Browser descriptor D000071077","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000071077"}],"status":"reported","summary":"NLM MeSH describes Surgical Oncology as: A surgical specialty concerned with management of cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013903","kind":"field","label":"Thoracic Surgery","sources":[{"id":"nlm-mesh.d013903","title":"NLM MeSH Browser descriptor D013903","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013903"}],"status":"reported","summary":"NLM MeSH describes Thoracic Surgery as: A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064132","kind":"field","label":"Sports Nutritional Sciences","sources":[{"id":"nlm-mesh.d064132","title":"NLM MeSH Browser descriptor D064132","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064132"}],"status":"reported","summary":"NLM MeSH describes Sports Nutritional Sciences as: The study of NUTRITION PROCESSES during EXERCISE and ATHLETIC PERFORMANCE as well as specific NUTRITIONAL REQUIREMENTS of ATHLETES and the relationship between NUTRITIONAL STATUS and NUTRITION DISORDERS in athletes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064796","kind":"field","label":"Veterinary Sports Medicine","sources":[{"id":"nlm-mesh.d064796","title":"NLM MeSH Browser descriptor D064796","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064796"}],"status":"reported","summary":"NLM MeSH describes Veterinary Sports Medicine as: The field of veterinary medicine concerned with PHYSICAL FITNESS of animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055416","kind":"field","label":"Evidence-Based Emergency Medicine","sources":[{"id":"nlm-mesh.d055416","title":"NLM MeSH Browser descriptor D055416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055416"}],"status":"reported","summary":"NLM MeSH describes Evidence-Based Emergency Medicine as: A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in EMERGENCY MEDICINE . This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d054849","kind":"field","label":"Cardiac Electrophysiology","sources":[{"id":"nlm-mesh.d054849","title":"NLM MeSH Browser descriptor D054849","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054849"}],"status":"reported","summary":"NLM MeSH describes Cardiac Electrophysiology as: The study of the electrical activity and characteristics of the HEART ; MYOCARDIUM ; and CARDIOMYOCYTES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000097562","kind":"field","label":"Cardio-Oncology","sources":[{"id":"nlm-mesh.d000097562","title":"NLM MeSH Browser descriptor D000097562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097562"}],"status":"reported","summary":"NLM MeSH describes Cardio-Oncology as: The study, diagnosis, and treatment of CARDIOTOXICITY in patients who undergo treatment for cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064826","kind":"field","label":"Transfusion Medicine","sources":[{"id":"nlm-mesh.d064826","title":"NLM MeSH Browser descriptor D064826","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064826"}],"status":"reported","summary":"NLM MeSH describes Transfusion Medicine as: The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from BLOOD TRANSFUSION errors.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000073320","kind":"field","label":"Psycho-Oncology","sources":[{"id":"nlm-mesh.d000073320","title":"NLM MeSH Browser descriptor D000073320","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073320"}],"status":"reported","summary":"NLM MeSH describes Psycho-Oncology as: A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011316","kind":"field","label":"Preventive Psychiatry","sources":[{"id":"nlm-mesh.d011316","title":"NLM MeSH Browser descriptor D011316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011316"}],"status":"reported","summary":"NLM MeSH describes Preventive Psychiatry as: A discipline concerned with the prevention of mental illness and the promotion of mental health.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d017720","kind":"field","label":"Molecular Epidemiology","sources":[{"id":"nlm-mesh.d017720","title":"NLM MeSH Browser descriptor D017720","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017720"}],"status":"reported","summary":"NLM MeSH describes Molecular Epidemiology as: The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in DNA to implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d017891","kind":"field","label":"Pharmacoepidemiology","sources":[{"id":"nlm-mesh.d017891","title":"NLM MeSH Browser descriptor D017891","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017891"}],"status":"reported","summary":"NLM MeSH describes Pharmacoepidemiology as: The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.291","kind":"field","label":"Earth sciences","sources":[{"id":"usgs-thesaurus.291","title":"USGS Thesaurus term 291","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=291"}],"status":"reported","summary":"The USGS Thesaurus defines Earth sciences as: Broad term for all science related to the study of the earth. This category is also used for geosciences","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1634","kind":"concept","label":"Geologic time periods","sources":[{"id":"usgs-thesaurus.1634","title":"USGS Thesaurus term 1634","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1634"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic time periods as: This category is also used for geologic age and geologic time","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.531","kind":"concept","label":"Hazards","sources":[{"id":"usgs-thesaurus.531","title":"USGS Thesaurus term 531","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=531"}],"status":"reported","summary":"The USGS Thesaurus defines Hazards as: Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment. This category is also used for catastrophes , with coastal processes for coastal hazards , disasters , with earthquakes for earthquake hazards , emergency management resources , environmental hazards , geologic hazards , with algal blooms for harmful algal blooms , and with ocean processes for ocean hazards","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.287","kind":"field","label":"Earth characteristics","sources":[{"id":"usgs-thesaurus.287","title":"USGS Thesaurus term 287","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=287"}],"status":"reported","summary":"The USGS Thesaurus defines Earth characteristics as: The measurable, definable properties and features of the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.68","kind":"field","label":"Atmospheric sciences","sources":[{"id":"usgs-thesaurus.68","title":"USGS Thesaurus term 68","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=68"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.447","kind":"field","label":"Geography","sources":[{"id":"usgs-thesaurus.447","title":"USGS Thesaurus term 447","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=447"}],"status":"reported","summary":"The USGS Thesaurus defines Geography as: Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations. This category is also used for geographic information sciences","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.470","kind":"field","label":"Geophysics","sources":[{"id":"usgs-thesaurus.470","title":"USGS Thesaurus term 470","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=470"}],"status":"reported","summary":"The USGS Thesaurus defines Geophysics as: Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere. This category is also used with maps and atlases for geophysical maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.818","kind":"field","label":"Ocean sciences","sources":[{"id":"usgs-thesaurus.818","title":"USGS Thesaurus term 818","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=818"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean sciences as: Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans. This category is also used for oceanography and physical oceanography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1081","kind":"field","label":"Soil sciences","sources":[{"id":"usgs-thesaurus.1081","title":"USGS Thesaurus term 1081","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1081"}],"status":"reported","summary":"The USGS Thesaurus defines Soil sciences as: Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils. This category is also used for pedology (soils)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1652","kind":"concept","label":"Phanerozoic","sources":[{"id":"usgs-thesaurus.1652","title":"USGS Thesaurus term 1652","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1652"}],"status":"reported","summary":"The USGS Thesaurus defines Phanerozoic as: Eon of geologic time approximately 542 million years ago extending to the present. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1655","kind":"concept","label":"Precambrian","sources":[{"id":"usgs-thesaurus.1655","title":"USGS Thesaurus term 1655","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1655"}],"status":"reported","summary":"The USGS Thesaurus defines Precambrian as: General interval of geologic time before approximately 542 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for cryptozoic","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.67","kind":"concept","label":"Atmospheric properties","sources":[{"id":"usgs-thesaurus.67","title":"USGS Thesaurus term 67","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=67"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric properties as: Characteristics of the mass of gases surrounding the earth such as composition, temperature, pressure, and humidity. This category is also used for atmosphere properties","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1367","kind":"concept","label":"Earth material properties","sources":[{"id":"usgs-thesaurus.1367","title":"USGS Thesaurus term 1367","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1367"}],"status":"reported","summary":"The USGS Thesaurus defines Earth material properties as: Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.292","kind":"concept","label":"Earth structure","sources":[{"id":"usgs-thesaurus.292","title":"USGS Thesaurus term 292","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=292"}],"status":"reported","summary":"The USGS Thesaurus defines Earth structure as: Major interior structural features of the planet earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.455","kind":"field","label":"Geologic history","sources":[{"id":"usgs-thesaurus.455","title":"USGS Thesaurus term 455","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=455"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic history as: Record (and inferred reconstruction) of the origin and development of the earth since its formation. This category is also used for chronostratigraphy and geohistory","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.459","kind":"concept","label":"Geologic structure","sources":[{"id":"usgs-thesaurus.459","title":"USGS Thesaurus term 459","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=459"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic structure as: General position of rocks in an area, and geometrical relationships among rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.501","kind":"concept","label":"Gravitational field (earth)","sources":[{"id":"usgs-thesaurus.501","title":"USGS Thesaurus term 501","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=501"}],"status":"reported","summary":"The USGS Thesaurus defines Gravitational field (earth) as: Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them. This category is also used for gravity , with maps and atlases for gravity anomaly maps , and gravity field","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.2090","kind":"field","label":"Lakebed characteristics","sources":[{"id":"usgs-thesaurus.2090","title":"USGS Thesaurus term 2090","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2090"}],"status":"reported","summary":"The USGS Thesaurus defines Lakebed characteristics as: Characteristics of the bottom of inland bodies of water. This category is also used for lake-bed characteristics , lake-bottom characteristics , and lake-floor characteristics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.626","kind":"field","label":"Land surface characteristics","sources":[{"id":"usgs-thesaurus.626","title":"USGS Thesaurus term 626","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=626"}],"status":"reported","summary":"The USGS Thesaurus defines Land surface characteristics as: Features and attributes of earth's land surface. This category is also used for landscape and physiography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.677","kind":"concept","label":"Magnetic field (earth)","sources":[{"id":"usgs-thesaurus.677","title":"USGS Thesaurus term 677","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=677"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.810","kind":"field","label":"Ocean characteristics","sources":[{"id":"usgs-thesaurus.810","title":"USGS Thesaurus term 810","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=810"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean characteristics as: The attributes and process of seas and oceans. This category is also used for ocean mixed-layer depth , with field inventory and monitoring for ocean monitoring , ocean surface characteristics , with ocean processes for oceans , and sea surface reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1005","kind":"concept","label":"Rocks and deposits","sources":[{"id":"usgs-thesaurus.1005","title":"USGS Thesaurus term 1005","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1005"}],"status":"reported","summary":"The USGS Thesaurus defines Rocks and deposits as: Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms. This category is also used for crystals , with maps and atlases for lithologic maps , lithology , and rock composition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1072","kind":"concept","label":"Snow and ice cover","sources":[{"id":"usgs-thesaurus.1072","title":"USGS Thesaurus term 1072","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1072"}],"status":"reported","summary":"The USGS Thesaurus defines Snow and ice cover as: Accumulation of snow or ice blanketing land surfaces. This category is also used for cryosphere , glaciers , ice , with drilling and coring for ice core sampling , and snowpack","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1103","kind":"concept","label":"Stratigraphic sections","sources":[{"id":"usgs-thesaurus.1103","title":"USGS Thesaurus term 1103","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1103"}],"status":"reported","summary":"The USGS Thesaurus defines Stratigraphic sections as: Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata. This category is also used for geologic sections , geologic units , sections (geologic) , sections (stratigraphic) , strata , and stratum","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1176","kind":"field","label":"Topography","sources":[{"id":"usgs-thesaurus.1176","title":"USGS Thesaurus term 1176","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1176"}],"status":"reported","summary":"The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1078","kind":"concept","label":"Soil chemistry","sources":[{"id":"usgs-thesaurus.1078","title":"USGS Thesaurus term 1078","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1078"}],"status":"reported","summary":"The USGS Thesaurus defines Soil chemistry as: Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1298","kind":"concept","label":"Water chemistry","sources":[{"id":"usgs-thesaurus.1298","title":"USGS Thesaurus term 1298","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1298"}],"status":"reported","summary":"The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1679","kind":"field","label":"Paleogeography","sources":[{"id":"usgs-thesaurus.1679","title":"USGS Thesaurus term 1679","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1679"}],"status":"reported","summary":"The USGS Thesaurus defines Paleogeography as: Study of the history of earth surface characteristics; geomorphology in the past.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.312","kind":"field","label":"Economic geology","sources":[{"id":"usgs-thesaurus.312","title":"USGS Thesaurus term 312","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=312"}],"status":"reported","summary":"The USGS Thesaurus defines Economic geology as: Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.706","kind":"field","label":"Marine geology","sources":[{"id":"usgs-thesaurus.706","title":"USGS Thesaurus term 706","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=706"}],"status":"reported","summary":"The USGS Thesaurus defines Marine geology as: Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin. This category is also used for geological oceanography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1117","kind":"field","label":"Structural geology","sources":[{"id":"usgs-thesaurus.1117","title":"USGS Thesaurus term 1117","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1117"}],"status":"reported","summary":"The USGS Thesaurus defines Structural geology as: Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.440","kind":"concept","label":"Geodesy","sources":[{"id":"usgs-thesaurus.440","title":"USGS Thesaurus term 440","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=440"}],"status":"reported","summary":"The USGS Thesaurus defines Geodesy as: Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.707","kind":"field","label":"Marine geophysics","sources":[{"id":"usgs-thesaurus.707","title":"USGS Thesaurus term 707","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=707"}],"status":"reported","summary":"The USGS Thesaurus defines Marine geophysics as: Branch of earth sciences concerned with the physical processes of the oceans and continental margins. We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1678","kind":"field","label":"Hydrodynamics","sources":[{"id":"usgs-thesaurus.1678","title":"USGS Thesaurus term 1678","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1678"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.859","kind":"field","label":"Paleoceanography","sources":[{"id":"usgs-thesaurus.859","title":"USGS Thesaurus term 859","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=859"}],"status":"reported","summary":"The USGS Thesaurus defines Paleoceanography as: Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.604","kind":"field","label":"Invertebrate paleontology","sources":[{"id":"usgs-thesaurus.604","title":"USGS Thesaurus term 604","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=604"}],"status":"reported","summary":"The USGS Thesaurus defines Invertebrate paleontology as: Branch of paleontology which deals with fossil animals without backbones.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.738","kind":"field","label":"Micropaleontology","sources":[{"id":"usgs-thesaurus.738","title":"USGS Thesaurus term 738","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=738"}],"status":"reported","summary":"The USGS Thesaurus defines Micropaleontology as: Branch of paleontology dealing with fossils too small to be seen without a microscope.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.858","kind":"concept","label":"Paleobotany","sources":[{"id":"usgs-thesaurus.858","title":"USGS Thesaurus term 858","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=858"}],"status":"reported","summary":"The USGS Thesaurus defines Paleobotany as: Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1267","kind":"field","label":"Vertebrate paleontology","sources":[{"id":"usgs-thesaurus.1267","title":"USGS Thesaurus term 1267","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1267"}],"status":"reported","summary":"The USGS Thesaurus defines Vertebrate paleontology as: Branch of paleontology dealing with fossil animals that have spinal columns.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1627","kind":"concept","label":"Cenozoic","sources":[{"id":"usgs-thesaurus.1627","title":"USGS Thesaurus term 1627","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1627"}],"status":"reported","summary":"The USGS Thesaurus defines Cenozoic as: Era of geologic time approximately 65 million years ago extending to the present. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1640","kind":"concept","label":"Mesozoic","sources":[{"id":"usgs-thesaurus.1640","title":"USGS Thesaurus term 1640","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1640"}],"status":"reported","summary":"The USGS Thesaurus defines Mesozoic as: Era of geologic time approximately 251 to 65 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1649","kind":"concept","label":"Paleozoic","sources":[{"id":"usgs-thesaurus.1649","title":"USGS Thesaurus term 1649","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1649"}],"status":"reported","summary":"The USGS Thesaurus defines Paleozoic as: Era of geologic time approximately 542 to 251 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1622","kind":"concept","label":"Archaean","sources":[{"id":"usgs-thesaurus.1622","title":"USGS Thesaurus term 1622","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1622"}],"status":"reported","summary":"The USGS Thesaurus defines Archaean as: Eon of geologic time approximately 4 to 2.5 billion years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1635","kind":"concept","label":"Hadean","sources":[{"id":"usgs-thesaurus.1635","title":"USGS Thesaurus term 1635","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1635"}],"status":"reported","summary":"The USGS Thesaurus defines Hadean as: Eon of geologic time prior to 4 billion years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1656","kind":"concept","label":"Proterozoic","sources":[{"id":"usgs-thesaurus.1656","title":"USGS Thesaurus term 1656","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1656"}],"status":"reported","summary":"The USGS Thesaurus defines Proterozoic as: Eon of geologic time approximately 2.5 billion to 542 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.27","kind":"concept","label":"Air temperature","sources":[{"id":"usgs-thesaurus.27","title":"USGS Thesaurus term 27","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=27"}],"status":"reported","summary":"The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.65","kind":"concept","label":"Atmospheric composition","sources":[{"id":"usgs-thesaurus.65","title":"USGS Thesaurus term 65","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=65"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2276","kind":"concept","label":"Acid neutralizing potential","sources":[{"id":"usgs-thesaurus.2276","title":"USGS Thesaurus term 2276","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2276"}],"status":"reported","summary":"The USGS Thesaurus defines Acid neutralizing potential as: Geochemical capacity of earth materials to affect the pH of waters flowing through them. This category is also used for acid neutralizing capacity and neutralization potential","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1714","kind":"concept","label":"Bulk density","sources":[{"id":"usgs-thesaurus.1714","title":"USGS Thesaurus term 1714","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1714"}],"status":"reported","summary":"The USGS Thesaurus defines Bulk density as: Overall density of an unconsolidated earth material.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2290","kind":"concept","label":"Electromagnetic reflectance and emissivity","sources":[{"id":"usgs-thesaurus.2290","title":"USGS Thesaurus term 2290","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2290"}],"status":"reported","summary":"The USGS Thesaurus defines Electromagnetic reflectance and emissivity as: Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength. Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems. This category is also used for infrared reflectance , laboratory reflectance , laboratory spectra , spectral radiance , and spectral reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1741","kind":"concept","label":"Magnetism","sources":[{"id":"usgs-thesaurus.1741","title":"USGS Thesaurus term 1741","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1741"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetism as: Strength and orientation of the permanent magnetic field in a given sample of an earth material","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1368","kind":"concept","label":"Permeability","sources":[{"id":"usgs-thesaurus.1368","title":"USGS Thesaurus term 1368","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1368"}],"status":"reported","summary":"The USGS Thesaurus defines Permeability as: The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material. This category is also used for soil permeability","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1369","kind":"concept","label":"Porosity","sources":[{"id":"usgs-thesaurus.1369","title":"USGS Thesaurus term 1369","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1369"}],"status":"reported","summary":"The USGS Thesaurus defines Porosity as: The proportion of open space in a rock or unconsolidated material. This category is also used for interstices and soil porosity","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1701","kind":"concept","label":"Radioactivity","sources":[{"id":"usgs-thesaurus.1701","title":"USGS Thesaurus term 1701","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1701"}],"status":"reported","summary":"The USGS Thesaurus defines Radioactivity as: Release of subatomic particles from earth materials. Generally the energy of these particles is used to determine the chemical elements present. This category is also used for gamma ray emission","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1712","kind":"concept","label":"Resistivity","sources":[{"id":"usgs-thesaurus.1712","title":"USGS Thesaurus term 1712","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1712"}],"status":"reported","summary":"The USGS Thesaurus defines Resistivity as: Electrical resistance of materials, often measured in boreholes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2027","kind":"concept","label":"Soil moisture","sources":[{"id":"usgs-thesaurus.2027","title":"USGS Thesaurus term 2027","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2027"}],"status":"reported","summary":"The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2028","kind":"concept","label":"Soil temperature","sources":[{"id":"usgs-thesaurus.2028","title":"USGS Thesaurus term 2028","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2028"}],"status":"reported","summary":"The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.211","kind":"concept","label":"Core (earth)","sources":[{"id":"usgs-thesaurus.211","title":"USGS Thesaurus term 211","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=211"}],"status":"reported","summary":"The USGS Thesaurus defines Core (earth) as: The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.219","kind":"concept","label":"Crust (earth)","sources":[{"id":"usgs-thesaurus.219","title":"USGS Thesaurus term 219","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=219"}],"status":"reported","summary":"The USGS Thesaurus defines Crust (earth) as: The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.690","kind":"concept","label":"Mantle (earth)","sources":[{"id":"usgs-thesaurus.690","title":"USGS Thesaurus term 690","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=690"}],"status":"reported","summary":"The USGS Thesaurus defines Mantle (earth) as: Zone of earth's interior between the crust and the core. It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.288","kind":"field","label":"Earth history","sources":[{"id":"usgs-thesaurus.288","title":"USGS Thesaurus term 288","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=288"}],"status":"reported","summary":"The USGS Thesaurus defines Earth history as: The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.404","kind":"concept","label":"Foliation (geologic)","sources":[{"id":"usgs-thesaurus.404","title":"USGS Thesaurus term 404","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=404"}],"status":"reported","summary":"The USGS Thesaurus defines Foliation (geologic) as: The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.660","kind":"concept","label":"Lineation (geologic)","sources":[{"id":"usgs-thesaurus.660","title":"USGS Thesaurus term 660","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=660"}],"status":"reported","summary":"The USGS Thesaurus defines Lineation (geologic) as: Linear topographic feature on the earth's surface or in rocks. This category is also used for lineaments","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1118","kind":"concept","label":"Structure contours","sources":[{"id":"usgs-thesaurus.1118","title":"USGS Thesaurus term 1118","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1118"}],"status":"reported","summary":"The USGS Thesaurus defines Structure contours as: Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features. This category is also used with maps and atlases for depth-to maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1675","kind":"concept","label":"Bouguer anomaly","sources":[{"id":"usgs-thesaurus.1675","title":"USGS Thesaurus term 1675","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1675"}],"status":"reported","summary":"The USGS Thesaurus defines Bouguer anomaly as: Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1674","kind":"concept","label":"Free-air anomaly","sources":[{"id":"usgs-thesaurus.1674","title":"USGS Thesaurus term 1674","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1674"}],"status":"reported","summary":"The USGS Thesaurus defines Free-air anomaly as: Gravity anomaly corrected for elevation of the location at which the measurements were made.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2291","kind":"concept","label":"Gravity gradient","sources":[{"id":"usgs-thesaurus.2291","title":"USGS Thesaurus term 2291","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2291"}],"status":"reported","summary":"The USGS Thesaurus defines Gravity gradient as: Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors. This category is also used for gravity gradiometry","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1673","kind":"concept","label":"Isostatic anomaly","sources":[{"id":"usgs-thesaurus.1673","title":"USGS Thesaurus term 1673","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1673"}],"status":"reported","summary":"The USGS Thesaurus defines Isostatic anomaly as: Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2091","kind":"concept","label":"Lakebed acoustic reflectivity","sources":[{"id":"usgs-thesaurus.2091","title":"USGS Thesaurus term 2091","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2091"}],"status":"reported","summary":"The USGS Thesaurus defines Lakebed acoustic reflectivity as: Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed. This category is also used for backscatter (lakebed)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2031","kind":"concept","label":"Karst","sources":[{"id":"usgs-thesaurus.2031","title":"USGS Thesaurus term 2031","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2031"}],"status":"reported","summary":"The USGS Thesaurus defines Karst as: Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes. This category is also used for karst topography and karstic","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.817","kind":"concept","label":"Ocean salinity","sources":[{"id":"usgs-thesaurus.817","title":"USGS Thesaurus term 817","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=817"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean salinity as: Measure of the percentage of dissolved salts in seawater.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.819","kind":"concept","label":"Ocean temperature","sources":[{"id":"usgs-thesaurus.819","title":"USGS Thesaurus term 819","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=819"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1025","kind":"field","label":"Sea-floor characteristics","sources":[{"id":"usgs-thesaurus.1025","title":"USGS Thesaurus term 1025","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1025"}],"status":"reported","summary":"The USGS Thesaurus defines Sea-floor characteristics as: Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor. This category is also used for ocean bottom characteristics , sea floor characteristics , and seafloor characteristics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1028","kind":"concept","label":"Sea-level change","sources":[{"id":"usgs-thesaurus.1028","title":"USGS Thesaurus term 1028","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1028"}],"status":"reported","summary":"The USGS Thesaurus defines Sea-level change as: Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface. Includes both global (eustatic) and local (relative) sea-level variations. This category is also used for sea level change , sea level rise , and sea-level rise","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.414","kind":"concept","label":"Fossils","sources":[{"id":"usgs-thesaurus.414","title":"USGS Thesaurus term 414","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=414"}],"status":"reported","summary":"The USGS Thesaurus defines Fossils as: Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth. This category is also used for index fossils and microfossils","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.572","kind":"concept","label":"Igneous rocks","sources":[{"id":"usgs-thesaurus.572","title":"USGS Thesaurus term 572","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=572"}],"status":"reported","summary":"The USGS Thesaurus defines Igneous rocks as: Rocks formed from melted rock that has cooled and solidified.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.725","kind":"concept","label":"Metamorphic rocks","sources":[{"id":"usgs-thesaurus.725","title":"USGS Thesaurus term 725","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=725"}],"status":"reported","summary":"The USGS Thesaurus defines Metamorphic rocks as: Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2043","kind":"concept","label":"Mineral deposits","sources":[{"id":"usgs-thesaurus.2043","title":"USGS Thesaurus term 2043","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2043"}],"status":"reported","summary":"The USGS Thesaurus defines Mineral deposits as: Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value. This category is also used for ore deposits","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1370","kind":"concept","label":"Permafrost","sources":[{"id":"usgs-thesaurus.1370","title":"USGS Thesaurus term 1370","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1370"}],"status":"reported","summary":"The USGS Thesaurus defines Permafrost as: Rocks and deposits in which the interstitial waters remain perennially frozen.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1804","kind":"concept","label":"Petroleum","sources":[{"id":"usgs-thesaurus.1804","title":"USGS Thesaurus term 1804","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1804"}],"status":"reported","summary":"The USGS Thesaurus defines Petroleum as: Naturally occurring hydrocarbons, typically fluid or gas, often of economic use. Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales. This category is also used with industrial pollution for oil spills","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1035","kind":"concept","label":"Sedimentary rocks","sources":[{"id":"usgs-thesaurus.1035","title":"USGS Thesaurus term 1035","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1035"}],"status":"reported","summary":"The USGS Thesaurus defines Sedimentary rocks as: Rocks formed by the consolidation of loose, uncemented pieces of sediments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1199","kind":"concept","label":"Unconsolidated deposits","sources":[{"id":"usgs-thesaurus.1199","title":"USGS Thesaurus term 1199","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1199"}],"status":"reported","summary":"The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1722","kind":"concept","label":"Sea ice concentration","sources":[{"id":"usgs-thesaurus.1722","title":"USGS Thesaurus term 1722","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1722"}],"status":"reported","summary":"The USGS Thesaurus defines Sea ice concentration as: Proportion of ocean area in a given region that contains or is covered by floating ice. This category is also used for sea ice cover and sea-ice concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.84","kind":"concept","label":"Bedrock geologic units","sources":[{"id":"usgs-thesaurus.84","title":"USGS Thesaurus term 84","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=84"}],"status":"reported","summary":"The USGS Thesaurus defines Bedrock geologic units as: Units of consolidated (solid) rock that underlie soils or other unconsolidated materials. This category is also used with maps and atlases for basement maps and geologic formations","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.452","kind":"concept","label":"Geologic contacts","sources":[{"id":"usgs-thesaurus.452","title":"USGS Thesaurus term 452","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=452"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic contacts as: Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes. This category is also used for contacts (geologic)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2089","kind":"concept","label":"Stratigraphic thickness","sources":[{"id":"usgs-thesaurus.2089","title":"USGS Thesaurus term 2089","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2089"}],"status":"reported","summary":"The USGS Thesaurus defines Stratigraphic thickness as: Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data. This category is also used for isopach , with maps and atlases for isopach maps , sediment thickness , and with maps and atlases for stratigraphic thickness maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1127","kind":"concept","label":"Surficial geologic units","sources":[{"id":"usgs-thesaurus.1127","title":"USGS Thesaurus term 1127","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1127"}],"status":"reported","summary":"The USGS Thesaurus defines Surficial geologic units as: Rock units on the earth's surface. This category is also used with maps and atlases for surficial geologic maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.80","kind":"concept","label":"Bathymetry","sources":[{"id":"usgs-thesaurus.80","title":"USGS Thesaurus term 80","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=80"}],"status":"reported","summary":"The USGS Thesaurus defines Bathymetry as: The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface. This category is also used for bathymetry data , sea floor topography , and underwater contours","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.703","kind":"concept","label":"Marine chemistry","sources":[{"id":"usgs-thesaurus.703","title":"USGS Thesaurus term 703","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=703"}],"status":"reported","summary":"The USGS Thesaurus defines Marine chemistry as: Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans. This category is also used for chemical oceanography , ocean chemistry , and water properties (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.115","kind":"field","label":"Biostratigraphy","sources":[{"id":"usgs-thesaurus.115","title":"USGS Thesaurus term 115","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=115"}],"status":"reported","summary":"The USGS Thesaurus defines Biostratigraphy as: Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.668","kind":"field","label":"Lithostratigraphy","sources":[{"id":"usgs-thesaurus.668","title":"USGS Thesaurus term 668","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=668"}],"status":"reported","summary":"The USGS Thesaurus defines Lithostratigraphy as: Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.862","kind":"field","label":"Paleoseismology","sources":[{"id":"usgs-thesaurus.862","title":"USGS Thesaurus term 862","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=862"}],"status":"reported","summary":"The USGS Thesaurus defines Paleoseismology as: Branch of seismology concerned with ancient earthquakes. Clues which indicate seismic activities in the geologic past are used to date and determine the effects of those earthquakes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1657","kind":"concept","label":"Quaternary","sources":[{"id":"usgs-thesaurus.1657","title":"USGS Thesaurus term 1657","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1657"}],"status":"reported","summary":"The USGS Thesaurus defines Quaternary as: Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1662","kind":"concept","label":"Tertiary","sources":[{"id":"usgs-thesaurus.1662","title":"USGS Thesaurus term 1662","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1662"}],"status":"reported","summary":"The USGS Thesaurus defines Tertiary as: Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1628","kind":"concept","label":"Cretaceous","sources":[{"id":"usgs-thesaurus.1628","title":"USGS Thesaurus term 1628","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1628"}],"status":"reported","summary":"The USGS Thesaurus defines Cretaceous as: Period of geologic time approximately 145 to 65 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1638","kind":"concept","label":"Jurassic","sources":[{"id":"usgs-thesaurus.1638","title":"USGS Thesaurus term 1638","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1638"}],"status":"reported","summary":"The USGS Thesaurus defines Jurassic as: Period of geologic time approximately 200 to 145 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1664","kind":"concept","label":"Triassic","sources":[{"id":"usgs-thesaurus.1664","title":"USGS Thesaurus term 1664","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1664"}],"status":"reported","summary":"The USGS Thesaurus defines Triassic as: Period of geologic time approximately 251 to 200 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1626","kind":"concept","label":"Cambrian","sources":[{"id":"usgs-thesaurus.1626","title":"USGS Thesaurus term 1626","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1626"}],"status":"reported","summary":"The USGS Thesaurus defines Cambrian as: Period of geologic time approximately 542 to 488 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1630","kind":"concept","label":"Devonian","sources":[{"id":"usgs-thesaurus.1630","title":"USGS Thesaurus term 1630","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1630"}],"status":"reported","summary":"The USGS Thesaurus defines Devonian as: Period of geologic time approximately 416 to 359 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1642","kind":"concept","label":"Mississippian","sources":[{"id":"usgs-thesaurus.1642","title":"USGS Thesaurus term 1642","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1642"}],"status":"reported","summary":"The USGS Thesaurus defines Mississippian as: Subperiod of geologic time approximately 359 to 318 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for lower carboniferous","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006809","kind":"concept","label":"Humanities","sources":[{"id":"nlm-mesh.d006809","title":"NLM MeSH Browser descriptor D006809","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006809"}],"status":"reported","summary":"NLM MeSH describes Humanities as: Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001154","kind":"field","label":"Art","sources":[{"id":"nlm-mesh.d001154","title":"NLM MeSH Browser descriptor D001154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001154"}],"status":"reported","summary":"NLM MeSH describes Art as: Processes and results of aesthetic expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000098463","kind":"concept","label":"Ethical Dilemmas","sources":[{"id":"nlm-mesh.d000098463","title":"NLM MeSH Browser descriptor D000098463","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098463"}],"status":"reported","summary":"NLM MeSH describes Ethical Dilemmas as: Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006664","kind":"field","label":"History","sources":[{"id":"nlm-mesh.d006664","title":"NLM MeSH Browser descriptor D006664","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006664"}],"status":"reported","summary":"NLM MeSH describes History as: Record and study of past events.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019359","kind":"concept","label":"Knowledge","sources":[{"id":"nlm-mesh.d019359","title":"NLM MeSH Browser descriptor D019359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019359"}],"status":"reported","summary":"NLM MeSH describes Knowledge as: The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008091","kind":"field","label":"Literature","sources":[{"id":"nlm-mesh.d008091","title":"NLM MeSH Browser descriptor D008091","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008091"}],"status":"reported","summary":"NLM MeSH describes Literature as: Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009146","kind":"field","label":"Music","sources":[{"id":"nlm-mesh.d009146","title":"NLM MeSH Browser descriptor D009146","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009146"}],"status":"reported","summary":"NLM MeSH describes Music as: Sound that expresses emotion through rhythm, melody, and harmony.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019368","kind":"concept","label":"Nature","sources":[{"id":"nlm-mesh.d019368","title":"NLM MeSH Browser descriptor D019368","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019368"}],"status":"reported","summary":"NLM MeSH describes Nature as: The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009781","kind":"concept","label":"Occultism","sources":[{"id":"nlm-mesh.d009781","title":"NLM MeSH Browser descriptor D009781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009781"}],"status":"reported","summary":"NLM MeSH describes Occultism as: The belief in or study of practices and knowledge of magical, mystical, or supernatural powers. ALCHEMY , astrology, and many RELIGIOUS PHILOSOPHIES are based upon occult principles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012067","kind":"field","label":"Religion","sources":[{"id":"nlm-mesh.d012067","title":"NLM MeSH Browser descriptor D012067","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012067"}],"status":"reported","summary":"NLM MeSH describes Religion as: A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d066288","kind":"concept","label":"Romanticism","sources":[{"id":"nlm-mesh.d066288","title":"NLM MeSH Browser descriptor D066288","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066288"}],"status":"reported","summary":"NLM MeSH describes Romanticism as: The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035621","kind":"concept","label":"Secularism","sources":[{"id":"nlm-mesh.d035621","title":"NLM MeSH Browser descriptor D035621","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035621"}],"status":"reported","summary":"NLM MeSH describes Secularism as: Indifference to, or rejection of, RELIGION or religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018594","kind":"concept","label":"Human Body","sources":[{"id":"nlm-mesh.d018594","title":"NLM MeSH Browser descriptor D018594","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018594"}],"status":"reported","summary":"NLM MeSH describes Human Body as: The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008488","kind":"concept","label":"Medical Illustration","sources":[{"id":"nlm-mesh.d008488","title":"NLM MeSH Browser descriptor D008488","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008488"}],"status":"reported","summary":"NLM MeSH describes Medical Illustration as: The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008512","kind":"concept","label":"Medicine in the Arts","sources":[{"id":"nlm-mesh.d008512","title":"NLM MeSH Browser descriptor D008512","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008512"}],"status":"reported","summary":"NLM MeSH describes Medicine in the Arts as: Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009717","kind":"field","label":"Numismatics","sources":[{"id":"nlm-mesh.d009717","title":"NLM MeSH Browser descriptor D009717","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009717"}],"status":"reported","summary":"NLM MeSH describes Numismatics as: Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000075862","kind":"concept","label":"Science in the Arts","sources":[{"id":"nlm-mesh.d000075862","title":"NLM MeSH Browser descriptor D000075862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075862"}],"status":"reported","summary":"NLM MeSH describes Science in the Arts as: Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d005053","kind":"field","label":"Eugenics","sources":[{"id":"nlm-mesh.d005053","title":"NLM MeSH Browser descriptor D005053","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005053"}],"status":"reported","summary":"NLM MeSH describes Eugenics as: The attempt to improve the PHENOTYPES of future generations of the human population by fostering the reproduction of those with favorable phenotypes and GENOTYPES and hampering or preventing BREEDING by those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005789","kind":"concept","label":"Genealogy and Heraldry","sources":[{"id":"nlm-mesh.d005789","title":"NLM MeSH Browser descriptor D005789","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005789"}],"status":"reported","summary":"NLM MeSH describes Genealogy and Heraldry as: Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006663","kind":"field","label":"Historiography","sources":[{"id":"nlm-mesh.d006663","title":"NLM MeSH Browser descriptor D006663","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006663"}],"status":"reported","summary":"NLM MeSH describes Historiography as: The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006665","kind":"concept","label":"History of Dentistry","sources":[{"id":"nlm-mesh.d006665","title":"NLM MeSH Browser descriptor D006665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006665"}],"status":"reported","summary":"NLM MeSH describes History of Dentistry as: Study of past events and development in the field of DENTISTRY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000077406","kind":"concept","label":"History of Pharmacy","sources":[{"id":"nlm-mesh.d000077406","title":"NLM MeSH Browser descriptor D000077406","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077406"}],"status":"reported","summary":"NLM MeSH describes History of Pharmacy as: Study of the origins and development of the field of PHARMACY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049690","kind":"field","label":"History, Ancient","sources":[{"id":"nlm-mesh.d049690","title":"NLM MeSH Browser descriptor D049690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049690"}],"status":"reported","summary":"NLM MeSH describes History, Ancient as: The period of history before 500 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049692","kind":"field","label":"History, Early Modern 1451-1600","sources":[{"id":"nlm-mesh.d049692","title":"NLM MeSH Browser descriptor D049692","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049692"}],"status":"reported","summary":"NLM MeSH describes History, Early Modern 1451-1600 as: The period of history from 1451 through 1600 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049691","kind":"field","label":"History, Medieval","sources":[{"id":"nlm-mesh.d049691","title":"NLM MeSH Browser descriptor D049691","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049691"}],"status":"reported","summary":"NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049711","kind":"field","label":"History, Modern 1601-","sources":[{"id":"nlm-mesh.d049711","title":"NLM MeSH Browser descriptor D049711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049711"}],"status":"reported","summary":"NLM MeSH describes History, Modern 1601- as: The period of history from 1601 of the common era to the present.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006666","kind":"field","label":"History of Medicine","sources":[{"id":"nlm-mesh.d006666","title":"NLM MeSH Browser descriptor D006666","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006666"}],"status":"reported","summary":"NLM MeSH describes History of Medicine as: Study of past events and development in the field of Medicine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006676","kind":"concept","label":"History of Nursing","sources":[{"id":"nlm-mesh.d006676","title":"NLM MeSH Browser descriptor D006676","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006676"}],"status":"reported","summary":"NLM MeSH describes History of Nursing as: Study of past events and development in the field of Nursing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d019021","kind":"field","label":"Natural History","sources":[{"id":"nlm-mesh.d019021","title":"NLM MeSH Browser descriptor D019021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019021"}],"status":"reported","summary":"NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010792","kind":"field","label":"Phrenology","sources":[{"id":"nlm-mesh.d010792","title":"NLM MeSH Browser descriptor D010792","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010792"}],"status":"reported","summary":"NLM MeSH describes Phrenology as: The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d013561","kind":"concept","label":"Symbolism","sources":[{"id":"nlm-mesh.d013561","title":"NLM MeSH Browser descriptor D013561","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013561"}],"status":"reported","summary":"NLM MeSH describes Symbolism as: A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d001633","kind":"concept","label":"Bible","sources":[{"id":"nlm-mesh.d001633","title":"NLM MeSH Browser descriptor D001633","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001633"}],"status":"reported","summary":"NLM MeSH describes Bible as: The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d004324","kind":"concept","label":"Drama","sources":[{"id":"nlm-mesh.d004324","title":"NLM MeSH Browser descriptor D004324","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004324"}],"status":"reported","summary":"NLM MeSH describes Drama as: A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005495","kind":"concept","label":"Folklore","sources":[{"id":"nlm-mesh.d005495","title":"NLM MeSH Browser descriptor D005495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005495"}],"status":"reported","summary":"NLM MeSH describes Folklore as: The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008092","kind":"field","label":"Literature, Medieval","sources":[{"id":"nlm-mesh.d008092","title":"NLM MeSH Browser descriptor D008092","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008092"}],"status":"reported","summary":"NLM MeSH describes Literature, Medieval as: Writings originating in the 5th century A.D. through the 15h century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008093","kind":"field","label":"Literature, Modern","sources":[{"id":"nlm-mesh.d008093","title":"NLM MeSH Browser descriptor D008093","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008093"}],"status":"reported","summary":"NLM MeSH describes Literature, Modern as: Writings originating from the 15th century A.D. to the present","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008513","kind":"field","label":"Medicine in Literature","sources":[{"id":"nlm-mesh.d008513","title":"NLM MeSH Browser descriptor D008513","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008513"}],"status":"reported","summary":"NLM MeSH describes Medicine in Literature as: Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009229","kind":"field","label":"Mythology","sources":[{"id":"nlm-mesh.d009229","title":"NLM MeSH Browser descriptor D009229","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009229"}],"status":"reported","summary":"NLM MeSH describes Mythology as: A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d000075863","kind":"field","label":"Science in Literature","sources":[{"id":"nlm-mesh.d000075863","title":"NLM MeSH Browser descriptor D000075863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075863"}],"status":"reported","summary":"NLM MeSH describes Science in Literature as: Literary works whose subject matter is science or about the profession of science and related areas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000422","kind":"concept","label":"Alchemy","sources":[{"id":"nlm-mesh.d000422","title":"NLM MeSH Browser descriptor D000422","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000422"}],"status":"reported","summary":"NLM MeSH describes Alchemy as: Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001255","kind":"field","label":"Astrology","sources":[{"id":"nlm-mesh.d001255","title":"NLM MeSH Browser descriptor D001255","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001255"}],"status":"reported","summary":"NLM MeSH describes Astrology as: System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004954","kind":"field","label":"Esthetics","sources":[{"id":"nlm-mesh.d004954","title":"NLM MeSH Browser descriptor D004954","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004954"}],"status":"reported","summary":"NLM MeSH describes Esthetics as: The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005086","kind":"concept","label":"Existentialism","sources":[{"id":"nlm-mesh.d005086","title":"NLM MeSH Browser descriptor D005086","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005086"}],"status":"reported","summary":"NLM MeSH describes Existentialism as: Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019369","kind":"concept","label":"Life","sources":[{"id":"nlm-mesh.d019369","title":"NLM MeSH Browser descriptor D019369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019369"}],"status":"reported","summary":"NLM MeSH describes Life as: The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008678","kind":"field","label":"Metaphysics","sources":[{"id":"nlm-mesh.d008678","title":"NLM MeSH Browser descriptor D008678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008678"}],"status":"reported","summary":"NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009014","kind":"concept","label":"Morals","sources":[{"id":"nlm-mesh.d009014","title":"NLM MeSH Browser descriptor D009014","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009014"}],"status":"reported","summary":"NLM MeSH describes Morals as: Standards of conduct that distinguish right from wrong.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010685","kind":"field","label":"Philosophy, Dental","sources":[{"id":"nlm-mesh.d010685","title":"NLM MeSH Browser descriptor D010685","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010685"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Dental as: The underlying rationale or theoretical basis for the principles of DENTISTRY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010686","kind":"field","label":"Philosophy, Medical","sources":[{"id":"nlm-mesh.d010686","title":"NLM MeSH Browser descriptor D010686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010686"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Medical as: The underlying rationale or theoretical basis for the principles of MEDICINE .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010687","kind":"field","label":"Philosophy, Nursing","sources":[{"id":"nlm-mesh.d010687","title":"NLM MeSH Browser descriptor D010687","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010687"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Nursing as: The underlying rationale or theoretical basis for the principles of NURSING .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033302","kind":"concept","label":"Postmodernism","sources":[{"id":"nlm-mesh.d033302","title":"NLM MeSH Browser descriptor D033302","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033302"}],"status":"reported","summary":"NLM MeSH describes Postmodernism as: A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019413","kind":"concept","label":"Qi","sources":[{"id":"nlm-mesh.d019413","title":"NLM MeSH Browser descriptor D019413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019413"}],"status":"reported","summary":"NLM MeSH describes Qi as: The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d014601","kind":"concept","label":"Utopias","sources":[{"id":"nlm-mesh.d014601","title":"NLM MeSH Browser descriptor D014601","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014601"}],"status":"reported","summary":"NLM MeSH describes Utopias as: Ideal perfection especially in laws, government, and social conditions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d014799","kind":"concept","label":"Vitalism","sources":[{"id":"nlm-mesh.d014799","title":"NLM MeSH Browser descriptor D014799","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014799"}],"status":"reported","summary":"NLM MeSH describes Vitalism as: The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d016709","kind":"concept","label":"Yin-Yang","sources":[{"id":"nlm-mesh.d016709","title":"NLM MeSH Browser descriptor D016709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016709"}],"status":"reported","summary":"NLM MeSH describes Yin-Yang as: In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000887","kind":"concept","label":"Anthroposophy","sources":[{"id":"nlm-mesh.d000887","title":"NLM MeSH Browser descriptor D000887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000887"}],"status":"reported","summary":"NLM MeSH describes Anthroposophy as: Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002016","kind":"concept","label":"Buddhism","sources":[{"id":"nlm-mesh.d002016","title":"NLM MeSH Browser descriptor D002016","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002016"}],"status":"reported","summary":"NLM MeSH describes Buddhism as: The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002835","kind":"concept","label":"Christianity","sources":[{"id":"nlm-mesh.d002835","title":"NLM MeSH Browser descriptor D002835","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002835"}],"status":"reported","summary":"NLM MeSH describes Christianity as: The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018596","kind":"concept","label":"Hinduism","sources":[{"id":"nlm-mesh.d018596","title":"NLM MeSH Browser descriptor D018596","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018596"}],"status":"reported","summary":"NLM MeSH describes Hinduism as: A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d007514","kind":"concept","label":"Islam","sources":[{"id":"nlm-mesh.d007514","title":"NLM MeSH Browser descriptor D007514","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007514"}],"status":"reported","summary":"NLM MeSH describes Islam as: A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d007599","kind":"concept","label":"Judaism","sources":[{"id":"nlm-mesh.d007599","title":"NLM MeSH Browser descriptor D007599","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007599"}],"status":"reported","summary":"NLM MeSH describes Judaism as: The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012068","kind":"field","label":"Religion and Medicine","sources":[{"id":"nlm-mesh.d012068","title":"NLM MeSH Browser descriptor D012068","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012068"}],"status":"reported","summary":"NLM MeSH describes Religion and Medicine as: The interrelationship of medicine and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012069","kind":"field","label":"Religion and Psychology","sources":[{"id":"nlm-mesh.d012069","title":"NLM MeSH Browser descriptor D012069","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012069"}],"status":"reported","summary":"NLM MeSH describes Religion and Psychology as: The interrelationship of psychology and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012070","kind":"field","label":"Religion and Science","sources":[{"id":"nlm-mesh.d012070","title":"NLM MeSH Browser descriptor D012070","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012070"}],"status":"reported","summary":"NLM MeSH describes Religion and Science as: The interrelationship of science and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012071","kind":"concept","label":"Religion and Sex","sources":[{"id":"nlm-mesh.d012071","title":"NLM MeSH Browser descriptor D012071","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012071"}],"status":"reported","summary":"NLM MeSH describes Religion and Sex as: The interrelationship of religion and sexual practices and beliefs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008921","kind":"concept","label":"Religious Missions","sources":[{"id":"nlm-mesh.d008921","title":"NLM MeSH Browser descriptor D008921","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008921"}],"status":"reported","summary":"NLM MeSH describes Religious Missions as: Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012072","kind":"concept","label":"Religious Philosophies","sources":[{"id":"nlm-mesh.d012072","title":"NLM MeSH Browser descriptor D012072","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012072"}],"status":"reported","summary":"NLM MeSH describes Religious Philosophies as: Sets of beliefs on the nature of the universe or Man.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000716","kind":"concept","label":"Anatomy, Artistic","sources":[{"id":"nlm-mesh.d000716","title":"NLM MeSH Browser descriptor D000716","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000716"}],"status":"reported","summary":"NLM MeSH describes Anatomy, Artistic as: The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019365","kind":"concept","label":"Metaphor","sources":[{"id":"nlm-mesh.d019365","title":"NLM MeSH Browser descriptor D019365","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019365"}],"status":"reported","summary":"NLM MeSH describes Metaphor as: The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d066291","kind":"field","label":"Psychiatry in Literature","sources":[{"id":"nlm-mesh.d066291","title":"NLM MeSH Browser descriptor D066291","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066291"}],"status":"reported","summary":"NLM MeSH describes Psychiatry in Literature as: Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010681","kind":"field","label":"Philology, Classical","sources":[{"id":"nlm-mesh.d010681","title":"NLM MeSH Browser descriptor D010681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010681"}],"status":"reported","summary":"NLM MeSH describes Philology, Classical as: The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010682","kind":"field","label":"Philology, Oriental","sources":[{"id":"nlm-mesh.d010682","title":"NLM MeSH Browser descriptor D010682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010682"}],"status":"reported","summary":"NLM MeSH describes Philology, Oriental as: The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010683","kind":"field","label":"Philology, Romance","sources":[{"id":"nlm-mesh.d010683","title":"NLM MeSH Browser descriptor D010683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010683"}],"status":"reported","summary":"NLM MeSH describes Philology, Romance as: The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d001504","kind":"concept","label":"Beauty","sources":[{"id":"nlm-mesh.d001504","title":"NLM MeSH Browser descriptor D001504","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001504"}],"status":"reported","summary":"NLM MeSH describes Beauty as: Characteristics or attributes of persons or things which elicit pleasurable feelings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033421","kind":"concept","label":"Beginning of Human Life","sources":[{"id":"nlm-mesh.d033421","title":"NLM MeSH Browser descriptor D033421","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033421"}],"status":"reported","summary":"NLM MeSH describes Beginning of Human Life as: The point at which religious ensoulment or PERSONHOOD is considered to begin.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026712","kind":"concept","label":"Value of Life","sources":[{"id":"nlm-mesh.d026712","title":"NLM MeSH Browser descriptor D026712","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026712"}],"status":"reported","summary":"NLM MeSH describes Value of Life as: The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d017143","kind":"concept","label":"Fuzzy Logic","sources":[{"id":"nlm-mesh.d017143","title":"NLM MeSH Browser descriptor D017143","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017143"}],"status":"reported","summary":"NLM MeSH describes Fuzzy Logic as: Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d003242","kind":"concept","label":"Conscience","sources":[{"id":"nlm-mesh.d003242","title":"NLM MeSH Browser descriptor D003242","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003242"}],"status":"reported","summary":"NLM MeSH describes Conscience as: The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004989","kind":"field","label":"Ethics","sources":[{"id":"nlm-mesh.d004989","title":"NLM MeSH Browser descriptor D004989","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004989"}],"status":"reported","summary":"NLM MeSH describes Ethics as: The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035863","kind":"concept","label":"Moral Development","sources":[{"id":"nlm-mesh.d035863","title":"NLM MeSH Browser descriptor D035863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035863"}],"status":"reported","summary":"NLM MeSH describes Moral Development as: The process by which individuals internalize standards of right and wrong conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012941","kind":"concept","label":"Social Responsibility","sources":[{"id":"nlm-mesh.d012941","title":"NLM MeSH Browser descriptor D012941","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012941"}],"status":"reported","summary":"NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028722","kind":"concept","label":"Virtues","sources":[{"id":"nlm-mesh.d028722","title":"NLM MeSH Browser descriptor D028722","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028722"}],"status":"reported","summary":"NLM MeSH describes Virtues as: Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004990","kind":"field","label":"Ethics, Dental","sources":[{"id":"nlm-mesh.d004990","title":"NLM MeSH Browser descriptor D004990","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004990"}],"status":"reported","summary":"NLM MeSH describes Ethics, Dental as: The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019348","kind":"concept","label":"Empiricism","sources":[{"id":"nlm-mesh.d019348","title":"NLM MeSH Browser descriptor D019348","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019348"}],"status":"reported","summary":"NLM MeSH describes Empiricism as: One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006694","kind":"concept","label":"Holistic Health","sources":[{"id":"nlm-mesh.d006694","title":"NLM MeSH Browser descriptor D006694","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006694"}],"status":"reported","summary":"NLM MeSH describes Holistic Health as: Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019364","kind":"concept","label":"Humoralism","sources":[{"id":"nlm-mesh.d019364","title":"NLM MeSH Browser descriptor D019364","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019364"}],"status":"reported","summary":"NLM MeSH describes Humoralism as: An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d061148","kind":"concept","label":"Hygiene Hypothesis","sources":[{"id":"nlm-mesh.d061148","title":"NLM MeSH Browser descriptor D061148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D061148"}],"status":"reported","summary":"NLM MeSH describes Hygiene Hypothesis as: The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and AUTOIMMUNE DISEASES .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004993","kind":"field","label":"Ethics, Nursing","sources":[{"id":"nlm-mesh.d004993","title":"NLM MeSH Browser descriptor D004993","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004993"}],"status":"reported","summary":"NLM MeSH describes Ethics, Nursing as: The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018939","kind":"concept","label":"Holistic Nursing","sources":[{"id":"nlm-mesh.d018939","title":"NLM MeSH Browser descriptor D018939","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018939"}],"status":"reported","summary":"NLM MeSH describes Holistic Nursing as: A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002410","kind":"concept","label":"Catholicism","sources":[{"id":"nlm-mesh.d002410","title":"NLM MeSH Browser descriptor D002410","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002410"}],"status":"reported","summary":"NLM MeSH describes Catholicism as: The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d002834","kind":"field","label":"Christian Science","sources":[{"id":"nlm-mesh.d002834","title":"NLM MeSH Browser descriptor D002834","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002834"}],"status":"reported","summary":"NLM MeSH describes Christian Science as: A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d034682","kind":"concept","label":"Church of Jesus Christ of Latter-day Saints","sources":[{"id":"nlm-mesh.d034682","title":"NLM MeSH Browser descriptor D034682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034682"}],"status":"reported","summary":"NLM MeSH describes Church of Jesus Christ of Latter-day Saints as: A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033003","kind":"concept","label":"Eastern Orthodoxy","sources":[{"id":"nlm-mesh.d033003","title":"NLM MeSH Browser descriptor D033003","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033003"}],"status":"reported","summary":"NLM MeSH describes Eastern Orthodoxy as: The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033303","kind":"concept","label":"Protestantism","sources":[{"id":"nlm-mesh.d033303","title":"NLM MeSH Browser descriptor D033303","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033303"}],"status":"reported","summary":"NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018597","kind":"concept","label":"Saints","sources":[{"id":"nlm-mesh.d018597","title":"NLM MeSH Browser descriptor D018597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018597"}],"status":"reported","summary":"NLM MeSH describes Saints as: Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000067496","kind":"concept","label":"Spirit Possession","sources":[{"id":"nlm-mesh.d000067496","title":"NLM MeSH Browser descriptor D000067496","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067496"}],"status":"reported","summary":"NLM MeSH describes Spirit Possession as: The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d029181","kind":"concept","label":"Spirituality","sources":[{"id":"nlm-mesh.d029181","title":"NLM MeSH Browser descriptor D029181","url":"https://meshb.nlm.nih.gov/record/ui?ui=D029181"}],"status":"reported","summary":"NLM MeSH describes Spirituality as: Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d032903","kind":"concept","label":"Confucianism","sources":[{"id":"nlm-mesh.d032903","title":"NLM MeSH Browser descriptor D032903","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032903"}],"status":"reported","summary":"NLM MeSH describes Confucianism as: A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009228","kind":"concept","label":"Mysticism","sources":[{"id":"nlm-mesh.d009228","title":"NLM MeSH Browser descriptor D009228","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009228"}],"status":"reported","summary":"NLM MeSH describes Mysticism as: A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d013140","kind":"concept","label":"Spiritualism","sources":[{"id":"nlm-mesh.d013140","title":"NLM MeSH Browser descriptor D013140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013140"}],"status":"reported","summary":"NLM MeSH describes Spiritualism as: Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d015013","kind":"concept","label":"Yoga","sources":[{"id":"nlm-mesh.d015013","title":"NLM MeSH Browser descriptor D015013","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015013"}],"status":"reported","summary":"NLM MeSH describes Yoga as: A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d012942","kind":"field","label":"Social Sciences","sources":[{"id":"nlm-mesh.d012942","title":"NLM MeSH Browser descriptor D012942","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012942"}],"status":"reported","summary":"NLM MeSH describes Social Sciences as: Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004779","kind":"concept","label":"Environment Design","sources":[{"id":"nlm-mesh.d004779","title":"NLM MeSH Browser descriptor D004779","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004779"}],"status":"reported","summary":"NLM MeSH describes Environment Design as: The structuring of the environment to permit or promote specific patterns of behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005544","kind":"concept","label":"Forecasting","sources":[{"id":"nlm-mesh.d005544","title":"NLM MeSH Browser descriptor D005544","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005544"}],"status":"reported","summary":"NLM MeSH describes Forecasting as: The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006076","kind":"concept","label":"Government","sources":[{"id":"nlm-mesh.d006076","title":"NLM MeSH Browser descriptor D006076","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006076"}],"status":"reported","summary":"NLM MeSH describes Government as: The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006078","kind":"concept","label":"Government Programs","sources":[{"id":"nlm-mesh.d006078","title":"NLM MeSH Browser descriptor D006078","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006078"}],"status":"reported","summary":"NLM MeSH describes Government Programs as: Programs and activities sponsored or administered by local, state, or national governments.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d038622","kind":"concept","label":"Internationality","sources":[{"id":"nlm-mesh.d038622","title":"NLM MeSH Browser descriptor D038622","url":"https://meshb.nlm.nih.gov/record/ui?ui=D038622"}],"status":"reported","summary":"NLM MeSH describes Internationality as: The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057766","kind":"concept","label":"Policy","sources":[{"id":"nlm-mesh.d057766","title":"NLM MeSH Browser descriptor D057766","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057766"}],"status":"reported","summary":"NLM MeSH describes Policy as: A course or method of action selected to guide and determine present and future decisions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011056","kind":"concept","label":"Political Systems","sources":[{"id":"nlm-mesh.d011056","title":"NLM MeSH Browser descriptor D011056","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011056"}],"status":"reported","summary":"NLM MeSH describes Political Systems as: The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011057","kind":"field","label":"Politics","sources":[{"id":"nlm-mesh.d011057","title":"NLM MeSH Browser descriptor D011057","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011057"}],"status":"reported","summary":"NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017149","kind":"concept","label":"Private Sector","sources":[{"id":"nlm-mesh.d017149","title":"NLM MeSH Browser descriptor D017149","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017149"}],"status":"reported","summary":"NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017150","kind":"concept","label":"Public Sector","sources":[{"id":"nlm-mesh.d017150","title":"NLM MeSH Browser descriptor D017150","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017150"}],"status":"reported","summary":"NLM MeSH describes Public Sector as: The area of a nation's economy that is tax-supported and under government control.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011788","kind":"concept","label":"Quality of Life","sources":[{"id":"nlm-mesh.d011788","title":"NLM MeSH Browser descriptor D011788","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011788"}],"status":"reported","summary":"NLM MeSH describes Quality of Life as: A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000072358","kind":"concept","label":"Work-Life Balance","sources":[{"id":"nlm-mesh.d000072358","title":"NLM MeSH Browser descriptor D000072358","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072358"}],"status":"reported","summary":"NLM MeSH describes Work-Life Balance as: Complex ongoing balance between a person's working life and private life.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d060432","kind":"field","label":"Anthropology, Medical","sources":[{"id":"nlm-mesh.d060432","title":"NLM MeSH Browser descriptor D060432","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060432"}],"status":"reported","summary":"NLM MeSH describes Anthropology, Medical as: Field of social science that is concerned with differences between human groups as related to health status and beliefs.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000091702","kind":"concept","label":"Intersectional Framework","sources":[{"id":"nlm-mesh.d000091702","title":"NLM MeSH Browser descriptor D000091702","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091702"}],"status":"reported","summary":"NLM MeSH describes Intersectional Framework as: Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097822","kind":"concept","label":"Media Exposure","sources":[{"id":"nlm-mesh.d000097822","title":"NLM MeSH Browser descriptor D000097822","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097822"}],"status":"reported","summary":"NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d012962","kind":"field","label":"Sociology, Medical","sources":[{"id":"nlm-mesh.d012962","title":"NLM MeSH Browser descriptor D012962","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012962"}],"status":"reported","summary":"NLM MeSH describes Sociology, Medical as: The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003415","kind":"concept","label":"Crime","sources":[{"id":"nlm-mesh.d003415","title":"NLM MeSH Browser descriptor D003415","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003415"}],"status":"reported","summary":"NLM MeSH describes Crime as: A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d003416","kind":"field","label":"Criminal Law","sources":[{"id":"nlm-mesh.d003416","title":"NLM MeSH Browser descriptor D003416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003416"}],"status":"reported","summary":"NLM MeSH describes Criminal Law as: A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d044707","kind":"field","label":"Forensic Sciences","sources":[{"id":"nlm-mesh.d044707","title":"NLM MeSH Browser descriptor D044707","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044707"}],"status":"reported","summary":"NLM MeSH describes Forensic Sciences as: Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as FORENSIC TOXICOLOGY ; FORENSIC ANTHROPOLOGY ; FORENSIC MEDICINE ; FORENSIC DENTISTRY ; and others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017677","kind":"concept","label":"Age Distribution","sources":[{"id":"nlm-mesh.d017677","title":"NLM MeSH Browser descriptor D017677","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017677"}],"status":"reported","summary":"NLM MeSH describes Age Distribution as: The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019352","kind":"concept","label":"Censuses","sources":[{"id":"nlm-mesh.d019352","title":"NLM MeSH Browser descriptor D019352","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019352"}],"status":"reported","summary":"NLM MeSH describes Censuses as: Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d005191","kind":"field","label":"Family Characteristics","sources":[{"id":"nlm-mesh.d005191","title":"NLM MeSH Browser descriptor D005191","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005191"}],"status":"reported","summary":"NLM MeSH describes Family Characteristics as: Size and composition of the family.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006304","kind":"concept","label":"Health Status","sources":[{"id":"nlm-mesh.d006304","title":"NLM MeSH Browser descriptor D006304","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006304"}],"status":"reported","summary":"NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011157","kind":"field","label":"Population Dynamics","sources":[{"id":"nlm-mesh.d011157","title":"NLM MeSH Browser descriptor D011157","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011157"}],"status":"reported","summary":"NLM MeSH describes Population Dynamics as: The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017678","kind":"concept","label":"Sex Distribution","sources":[{"id":"nlm-mesh.d017678","title":"NLM MeSH Browser descriptor D017678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017678"}],"status":"reported","summary":"NLM MeSH describes Sex Distribution as: The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d030861","kind":"concept","label":"Capitalism","sources":[{"id":"nlm-mesh.d030861","title":"NLM MeSH Browser descriptor D030861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D030861"}],"status":"reported","summary":"NLM MeSH describes Capitalism as: A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057217","kind":"concept","label":"Economic Development","sources":[{"id":"nlm-mesh.d057217","title":"NLM MeSH Browser descriptor D057217","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057217"}],"status":"reported","summary":"NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057172","kind":"concept","label":"Economic Recession","sources":[{"id":"nlm-mesh.d057172","title":"NLM MeSH Browser descriptor D057172","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057172"}],"status":"reported","summary":"NLM MeSH describes Economic Recession as: Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070337","kind":"concept","label":"Expropriation","sources":[{"id":"nlm-mesh.d000070337","title":"NLM MeSH Browser descriptor D000070337","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070337"}],"status":"reported","summary":"NLM MeSH describes Expropriation as: Taking of goods, property, or right of use by GOVERNMENT or others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d059066","kind":"concept","label":"Gross Domestic Product","sources":[{"id":"nlm-mesh.d059066","title":"NLM MeSH Browser descriptor D059066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059066"}],"status":"reported","summary":"NLM MeSH describes Gross Domestic Product as: Value of all final goods and services produced in a country in one year.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040841","kind":"concept","label":"Resource Allocation","sources":[{"id":"nlm-mesh.d040841","title":"NLM MeSH Browser descriptor D040841","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040841"}],"status":"reported","summary":"NLM MeSH describes Resource Allocation as: Societal or individual decisions about the equitable distribution of available resources.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000080562","kind":"concept","label":"Universal Design","sources":[{"id":"nlm-mesh.d000080562","title":"NLM MeSH Browser descriptor D000080562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080562"}],"status":"reported","summary":"NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000090082","kind":"concept","label":"Climate Models","sources":[{"id":"nlm-mesh.d000090082","title":"NLM MeSH Browser descriptor D000090082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090082"}],"status":"reported","summary":"NLM MeSH describes Climate Models as: Computer representations that simulate or predict the behavior or activity of WEATHER systems, processes, or phenomena.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000069457","kind":"concept","label":"Population Forecast","sources":[{"id":"nlm-mesh.d000069457","title":"NLM MeSH Browser descriptor D000069457","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069457"}],"status":"reported","summary":"NLM MeSH describes Population Forecast as: Estimates of projected population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d035082","kind":"concept","label":"Federal Government","sources":[{"id":"nlm-mesh.d035082","title":"NLM MeSH Browser descriptor D035082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035082"}],"status":"reported","summary":"NLM MeSH describes Federal Government as: The level of governmental organization and function at the national or country-wide level.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006077","kind":"concept","label":"Government Agencies","sources":[{"id":"nlm-mesh.d006077","title":"NLM MeSH Browser descriptor D006077","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006077"}],"status":"reported","summary":"NLM MeSH describes Government Agencies as: Administrative units of government responsible for policy making and management of governmental activities.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009111","kind":"concept","label":"Local Government","sources":[{"id":"nlm-mesh.d009111","title":"NLM MeSH Browser descriptor D009111","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009111"}],"status":"reported","summary":"NLM MeSH describes Local Government as: Smallest political subdivisions within a country at which general governmental functions are carried-out.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013219","kind":"concept","label":"State Government","sources":[{"id":"nlm-mesh.d013219","title":"NLM MeSH Browser descriptor D013219","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013219"}],"status":"reported","summary":"NLM MeSH describes State Government as: The level of governmental organization and function below that of the national or country-wide government.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002959","kind":"concept","label":"Civil Defense","sources":[{"id":"nlm-mesh.d002959","title":"NLM MeSH Browser descriptor D002959","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002959"}],"status":"reported","summary":"NLM MeSH describes Civil Defense as: Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011177","kind":"concept","label":"Postal Service","sources":[{"id":"nlm-mesh.d011177","title":"NLM MeSH Browser descriptor D011177","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011177"}],"status":"reported","summary":"NLM MeSH describes Postal Service as: The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007391","kind":"concept","label":"International Cooperation","sources":[{"id":"nlm-mesh.d007391","title":"NLM MeSH Browser descriptor D007391","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007391"}],"status":"reported","summary":"NLM MeSH describes International Cooperation as: The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070586","kind":"concept","label":"Fiscal Policy","sources":[{"id":"nlm-mesh.d000070586","title":"NLM MeSH Browser descriptor D000070586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070586"}],"status":"reported","summary":"NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011049","kind":"concept","label":"Social Control Policies","sources":[{"id":"nlm-mesh.d011049","title":"NLM MeSH Browser descriptor D011049","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011049"}],"status":"reported","summary":"NLM MeSH describes Social Control Policies as: Decisions for determining and guiding present and future objectives from among alternatives.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000072698","kind":"concept","label":"Apartheid","sources":[{"id":"nlm-mesh.d000072698","title":"NLM MeSH Browser descriptor D000072698","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072698"}],"status":"reported","summary":"NLM MeSH describes Apartheid as: A former political system in SOUTH AFRICA which enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d018595","kind":"concept","label":"Colonialism","sources":[{"id":"nlm-mesh.d018595","title":"NLM MeSH Browser descriptor D018595","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018595"}],"status":"reported","summary":"NLM MeSH describes Colonialism as: The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003148","kind":"concept","label":"Communism","sources":[{"id":"nlm-mesh.d003148","title":"NLM MeSH Browser descriptor D003148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003148"}],"status":"reported","summary":"NLM MeSH describes Communism as: A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003709","kind":"concept","label":"Democracy","sources":[{"id":"nlm-mesh.d003709","title":"NLM MeSH Browser descriptor D003709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003709"}],"status":"reported","summary":"NLM MeSH describes Democracy as: A system of government in which there is free and equal participation by the people in the political decision-making process.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074440","kind":"concept","label":"Fascism","sources":[{"id":"nlm-mesh.d000074440","title":"NLM MeSH Browser descriptor D000074440","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074440"}],"status":"reported","summary":"NLM MeSH describes Fascism as: Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d028683","kind":"concept","label":"National Socialism","sources":[{"id":"nlm-mesh.d028683","title":"NLM MeSH Browser descriptor D028683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028683"}],"status":"reported","summary":"NLM MeSH describes National Socialism as: The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012950","kind":"concept","label":"Socialism","sources":[{"id":"nlm-mesh.d012950","title":"NLM MeSH Browser descriptor D012950","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012950"}],"status":"reported","summary":"NLM MeSH describes Socialism as: A system of government in which means of production and distribution of goods are controlled by the state.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067551","kind":"concept","label":"Diplomacy","sources":[{"id":"nlm-mesh.d000067551","title":"NLM MeSH Browser descriptor D000067551","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067551"}],"status":"reported","summary":"NLM MeSH describes Diplomacy as: The art and practice of conducting negotiations between people, nations or other parties such as organizations.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000088724","kind":"concept","label":"Environmentalism","sources":[{"id":"nlm-mesh.d000088724","title":"NLM MeSH Browser descriptor D000088724","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088724"}],"status":"reported","summary":"NLM MeSH describes Environmentalism as: Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d008119","kind":"concept","label":"Lobbying","sources":[{"id":"nlm-mesh.d008119","title":"NLM MeSH Browser descriptor D008119","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008119"}],"status":"reported","summary":"NLM MeSH describes Lobbying as: A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074439","kind":"concept","label":"Political Activism","sources":[{"id":"nlm-mesh.d000074439","title":"NLM MeSH Browser descriptor D000074439","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074439"}],"status":"reported","summary":"NLM MeSH describes Political Activism as: Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000099075","kind":"concept","label":"Politicization","sources":[{"id":"nlm-mesh.d000099075","title":"NLM MeSH Browser descriptor D000099075","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099075"}],"status":"reported","summary":"NLM MeSH describes Politicization as: Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000073597","kind":"concept","label":"Stakeholder Participation","sources":[{"id":"nlm-mesh.d000073597","title":"NLM MeSH Browser descriptor D000073597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073597"}],"status":"reported","summary":"NLM MeSH describes Stakeholder Participation as: A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000096264","kind":"concept","label":"Voting","sources":[{"id":"nlm-mesh.d000096264","title":"NLM MeSH Browser descriptor D000096264","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096264"}],"status":"reported","summary":"NLM MeSH describes Voting as: Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070100","kind":"concept","label":"Informal Sector","sources":[{"id":"nlm-mesh.d000070100","title":"NLM MeSH Browser descriptor D000070100","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070100"}],"status":"reported","summary":"NLM MeSH describes Informal Sector as: A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations; skills acquired outside of the formal sector; and unregulated markets.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000092862","kind":"concept","label":"Psychological Well-Being","sources":[{"id":"nlm-mesh.d000092862","title":"NLM MeSH Browser descriptor D000092862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092862"}],"status":"reported","summary":"NLM MeSH describes Psychological Well-Being as: Condition of existence, or state of awareness, in which psychological needs are satisfied","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000024","kind":"concept","label":"Abortion, Illegal","sources":[{"id":"nlm-mesh.d000024","title":"NLM MeSH Browser descriptor D000024","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000024"}],"status":"reported","summary":"NLM MeSH describes Abortion, Illegal as: Illegal termination of pregnancy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075066","kind":"concept","label":"Body Packing","sources":[{"id":"nlm-mesh.d000075066","title":"NLM MeSH Browser descriptor D000075066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075066"}],"status":"reported","summary":"NLM MeSH describes Body Packing as: Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of DRUG SMUGGLING or to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d056146","kind":"concept","label":"Corpse Dismemberment","sources":[{"id":"nlm-mesh.d056146","title":"NLM MeSH Browser descriptor D056146","url":"https://meshb.nlm.nih.gov/record/ui?ui=D056146"}],"status":"reported","summary":"NLM MeSH describes Corpse Dismemberment as: Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067448","kind":"concept","label":"Defamation","sources":[{"id":"nlm-mesh.d000067448","title":"NLM MeSH Browser descriptor D000067448","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067448"}],"status":"reported","summary":"NLM MeSH describes Defamation as: Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064423","kind":"concept","label":"Drug Trafficking","sources":[{"id":"nlm-mesh.d064423","title":"NLM MeSH Browser descriptor D064423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064423"}],"status":"reported","summary":"NLM MeSH describes Drug Trafficking as: The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078625","kind":"concept","label":"Euthanasia, Involuntary","sources":[{"id":"nlm-mesh.d000078625","title":"NLM MeSH Browser descriptor D000078625","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078625"}],"status":"reported","summary":"NLM MeSH describes Euthanasia, Involuntary as: The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially PERSONS WITH DISABILITIES , without INFORMED CONSENT , despite the MENTAL COMPETENCY of the person to give consent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005607","kind":"concept","label":"Fraud","sources":[{"id":"nlm-mesh.d005607","title":"NLM MeSH Browser descriptor D005607","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005607"}],"status":"reported","summary":"NLM MeSH describes Fraud as: Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019356","kind":"concept","label":"Grave Robbing","sources":[{"id":"nlm-mesh.d019356","title":"NLM MeSH Browser descriptor D019356","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019356"}],"status":"reported","summary":"NLM MeSH describes Grave Robbing as: Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006708","kind":"concept","label":"Homicide","sources":[{"id":"nlm-mesh.d006708","title":"NLM MeSH Browser descriptor D006708","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006708"}],"status":"reported","summary":"NLM MeSH describes Homicide as: The killing of one person by another.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097824","kind":"concept","label":"Medical Neglect","sources":[{"id":"nlm-mesh.d000097824","title":"NLM MeSH Browser descriptor D000097824","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097824"}],"status":"reported","summary":"NLM MeSH describes Medical Neglect as: Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is PROFESSIONAL NEGLIGENCE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064226","kind":"concept","label":"Prescription Drug Diversion","sources":[{"id":"nlm-mesh.d064226","title":"NLM MeSH Browser descriptor D064226","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064226"}],"status":"reported","summary":"NLM MeSH describes Prescription Drug Diversion as: The transfer of prescription drugs from legal to illegal distribution and marketing networks.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075665","kind":"concept","label":"Recidivism","sources":[{"id":"nlm-mesh.d000075665","title":"NLM MeSH Browser descriptor D000075665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075665"}],"status":"reported","summary":"NLM MeSH describes Recidivism as: Repeated criminal behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012742","kind":"concept","label":"Sex Offenses","sources":[{"id":"nlm-mesh.d012742","title":"NLM MeSH Browser descriptor D012742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012742"}],"status":"reported","summary":"NLM MeSH describes Sex Offenses as: Any violation of established legal or moral codes in respect to sexual behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013800","kind":"concept","label":"Theft","sources":[{"id":"nlm-mesh.d013800","title":"NLM MeSH Browser descriptor D013800","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013800"}],"status":"reported","summary":"NLM MeSH describes Theft as: Unlawful act of taking property.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014754","kind":"concept","label":"Violence","sources":[{"id":"nlm-mesh.d014754","title":"NLM MeSH Browser descriptor D014754","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014754"}],"status":"reported","summary":"NLM MeSH describes Violence as: Use of physical force causing or intent to cause harm, injury or abuse.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014858","kind":"concept","label":"War Crimes","sources":[{"id":"nlm-mesh.d014858","title":"NLM MeSH Browser descriptor D014858","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014858"}],"status":"reported","summary":"NLM MeSH describes War Crimes as: Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d018732","kind":"field","label":"Forensic Anthropology","sources":[{"id":"nlm-mesh.d018732","title":"NLM MeSH Browser descriptor D018732","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018732"}],"status":"reported","summary":"NLM MeSH describes Forensic Anthropology as: Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d044709","kind":"field","label":"Forensic Ballistics","sources":[{"id":"nlm-mesh.d044709","title":"NLM MeSH Browser descriptor D044709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044709"}],"status":"reported","summary":"NLM MeSH describes Forensic Ballistics as: The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005553","kind":"concept","label":"Forensic Dentistry","sources":[{"id":"nlm-mesh.d005553","title":"NLM MeSH Browser descriptor D005553","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005553"}],"status":"reported","summary":"NLM MeSH describes Forensic Dentistry as: The application of dental knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000081230","kind":"field","label":"Forensic Entomology","sources":[{"id":"nlm-mesh.d000081230","title":"NLM MeSH Browser descriptor D000081230","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000081230"}],"status":"reported","summary":"NLM MeSH describes Forensic Entomology as: The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097785","kind":"concept","label":"Forensic Imaging","sources":[{"id":"nlm-mesh.d000097785","title":"NLM MeSH Browser descriptor D000097785","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097785"}],"status":"reported","summary":"NLM MeSH describes Forensic Imaging as: The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes FORENSIC MEDICINE platforms such as X-RAYS ; CT XRAY; and MRI.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000095024","kind":"field","label":"Forensic Microbiology","sources":[{"id":"nlm-mesh.d000095024","title":"NLM MeSH Browser descriptor D000095024","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095024"}],"status":"reported","summary":"NLM MeSH describes Forensic Microbiology as: The scientific discipline dedicated to analyzing evidence from BIOTERRORISM , biocrime, HOAX , or inadvertent microorganism/toxin release for attribution purposes.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d053604","kind":"concept","label":"Forensic Nursing","sources":[{"id":"nlm-mesh.d053604","title":"NLM MeSH Browser descriptor D053604","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053604"}],"status":"reported","summary":"NLM MeSH describes Forensic Nursing as: The application of NURSING knowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000077283","kind":"field","label":"Forensic Psychology","sources":[{"id":"nlm-mesh.d000077283","title":"NLM MeSH Browser descriptor D000077283","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077283"}],"status":"reported","summary":"NLM MeSH describes Forensic Psychology as: A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d053593","kind":"field","label":"Forensic Toxicology","sources":[{"id":"nlm-mesh.d053593","title":"NLM MeSH Browser descriptor D053593","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053593"}],"status":"reported","summary":"NLM MeSH describes Forensic Toxicology as: The application of TOXICOLOGY knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001721","kind":"concept","label":"Birth Intervals","sources":[{"id":"nlm-mesh.d001721","title":"NLM MeSH Browser descriptor D001721","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001721"}],"status":"reported","summary":"NLM MeSH describes Birth Intervals as: The lengths of intervals between births to women in the population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001722","kind":"concept","label":"Birth Order","sources":[{"id":"nlm-mesh.d001722","title":"NLM MeSH Browser descriptor D001722","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001722"}],"status":"reported","summary":"NLM MeSH describes Birth Order as: The sequence in which children are born into the family.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000092822","kind":"concept","label":"Family Structure","sources":[{"id":"nlm-mesh.d000092822","title":"NLM MeSH Browser descriptor D000092822","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092822"}],"status":"reported","summary":"NLM MeSH describes Family Structure as: Structural nature of relationships among members of a household typically in reference to a MINOR residing in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017533","kind":"concept","label":"Marital Status","sources":[{"id":"nlm-mesh.d017533","title":"NLM MeSH Browser descriptor D017533","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017533"}],"status":"reported","summary":"NLM MeSH describes Marital Status as: A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness ( SINGLE PERSON ), etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d015577","kind":"concept","label":"Geriatric Assessment","sources":[{"id":"nlm-mesh.d015577","title":"NLM MeSH Browser descriptor D015577","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015577"}],"status":"reported","summary":"NLM MeSH describes Geriatric Assessment as: Evaluation of the level of physical, physiological, or mental functioning in the older population group.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000091682","kind":"concept","label":"Health Inequities","sources":[{"id":"nlm-mesh.d000091682","title":"NLM MeSH Browser descriptor D000091682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091682"}],"status":"reported","summary":"NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009752","kind":"concept","label":"Nutritional Status","sources":[{"id":"nlm-mesh.d009752","title":"NLM MeSH Browser descriptor D009752","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009752"}],"status":"reported","summary":"NLM MeSH describes Nutritional Status as: State of the body in relation to the consumption and utilization of nutrients.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064890","kind":"concept","label":"Social Determinants of Health","sources":[{"id":"nlm-mesh.d064890","title":"NLM MeSH Browser descriptor D064890","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064890"}],"status":"reported","summary":"NLM MeSH describes Social Determinants of Health as: The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019456","kind":"concept","label":"Health Transition","sources":[{"id":"nlm-mesh.d019456","title":"NLM MeSH Browser descriptor D019456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019456"}],"status":"reported","summary":"NLM MeSH describes Health Transition as: Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d063426","kind":"concept","label":"Human Migration","sources":[{"id":"nlm-mesh.d063426","title":"NLM MeSH Browser descriptor D063426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063426"}],"status":"reported","summary":"NLM MeSH describes Human Migration as: Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011155","kind":"concept","label":"Population Control","sources":[{"id":"nlm-mesh.d011155","title":"NLM MeSH Browser descriptor D011155","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011155"}],"status":"reported","summary":"NLM MeSH describes Population Control as: Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011158","kind":"concept","label":"Population Growth","sources":[{"id":"nlm-mesh.d011158","title":"NLM MeSH Browser descriptor D011158","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011158"}],"status":"reported","summary":"NLM MeSH describes Population Growth as: Increase, over a specific period of time, in the number of individuals living in a country or region.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012744","kind":"concept","label":"Sex Ratio","sources":[{"id":"nlm-mesh.d012744","title":"NLM MeSH Browser descriptor D012744","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012744"}],"status":"reported","summary":"NLM MeSH describes Sex Ratio as: The number of males per 100 females.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067896","kind":"concept","label":"Industrial Development","sources":[{"id":"nlm-mesh.d000067896","title":"NLM MeSH Browser descriptor D000067896","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067896"}],"status":"reported","summary":"NLM MeSH describes Industrial Development as: Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and COMMERCE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003906","kind":"concept","label":"Developing Countries","sources":[{"id":"nlm-mesh.d003906","title":"NLM MeSH Browser descriptor D003906","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003906"}],"status":"reported","summary":"NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007239","kind":"concept","label":"Infections","sources":[{"id":"nlm-mesh.d007239","title":"NLM MeSH Browser descriptor D007239","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007239"}],"status":"reported","summary":"NLM MeSH describes Infections as: Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009369","kind":"concept","label":"Neoplasms","sources":[{"id":"nlm-mesh.d009369","title":"NLM MeSH Browser descriptor D009369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009369"}],"status":"reported","summary":"NLM MeSH describes Neoplasms as: New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002318","kind":"concept","label":"Cardiovascular Diseases","sources":[{"id":"nlm-mesh.d002318","title":"NLM MeSH Browser descriptor D002318","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002318"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Diseases as: Pathological conditions involving the CARDIOVASCULAR SYSTEM including the HEART ; the BLOOD VESSELS ; or the PERICARDIUM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009422","kind":"concept","label":"Nervous System Diseases","sources":[{"id":"nlm-mesh.d009422","title":"NLM MeSH Browser descriptor D009422","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009422"}],"status":"reported","summary":"NLM MeSH describes Nervous System Diseases as: Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012140","kind":"concept","label":"Respiratory Tract Diseases","sources":[{"id":"nlm-mesh.d012140","title":"NLM MeSH Browser descriptor D012140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012140"}],"status":"reported","summary":"NLM MeSH describes Respiratory Tract Diseases as: Diseases involving the RESPIRATORY SYSTEM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d004066","kind":"concept","label":"Digestive System Diseases","sources":[{"id":"nlm-mesh.d004066","title":"NLM MeSH Browser descriptor D004066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004066"}],"status":"reported","summary":"NLM MeSH describes Digestive System Diseases as: Diseases in any part of the GASTROINTESTINAL TRACT or the accessory organs ( LIVER ; BILIARY TRACT ; PANCREAS ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009140","kind":"concept","label":"Musculoskeletal Diseases","sources":[{"id":"nlm-mesh.d009140","title":"NLM MeSH Browser descriptor D009140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009140"}],"status":"reported","summary":"NLM MeSH describes Musculoskeletal Diseases as: Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d004700","kind":"concept","label":"Endocrine System Diseases","sources":[{"id":"nlm-mesh.d004700","title":"NLM MeSH Browser descriptor D004700","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004700"}],"status":"reported","summary":"NLM MeSH describes Endocrine System Diseases as: Pathological processes of the ENDOCRINE GLANDS , and diseases resulting from abnormal level of available HORMONES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007154","kind":"concept","label":"Immune System Diseases","sources":[{"id":"nlm-mesh.d007154","title":"NLM MeSH Browser descriptor D007154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007154"}],"status":"reported","summary":"NLM MeSH describes Immune System Diseases as: Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001523","kind":"concept","label":"Mental Disorders","sources":[{"id":"nlm-mesh.d001523","title":"NLM MeSH Browser descriptor D001523","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001523"}],"status":"reported","summary":"NLM MeSH describes Mental Disorders as: Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014947","kind":"concept","label":"Wounds and Injuries","sources":[{"id":"nlm-mesh.d014947","title":"NLM MeSH Browser descriptor D014947","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014947"}],"status":"reported","summary":"NLM MeSH describes Wounds and Injuries as: Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006425","kind":"concept","label":"Hemic and Lymphatic Diseases","sources":[{"id":"nlm-mesh.d006425","title":"NLM MeSH Browser descriptor D006425","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006425"}],"status":"reported","summary":"NLM MeSH describes Hemic and Lymphatic Diseases as: Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g., ERYTHROCYTE AGGREGATION, INTRAVASCULAR ) and chemical components (e.g., BLOOD PROTEIN DISORDERS ); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000785","kind":"concept","label":"Aneurysm, Infected","sources":[{"id":"nlm-mesh.d000785","title":"NLM MeSH Browser descriptor D000785","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000785"}],"status":"reported","summary":"NLM MeSH describes Aneurysm, Infected as: Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001170","kind":"concept","label":"Arthritis, Infectious","sources":[{"id":"nlm-mesh.d001170","title":"NLM MeSH Browser descriptor D001170","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001170"}],"status":"reported","summary":"NLM MeSH describes Arthritis, Infectious as: Arthritis caused by BACTERIA ; RICKETTSIA ; MYCOPLASMA ; VIRUSES ; FUNGI ; or PARASITES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d058345","kind":"concept","label":"Asymptomatic Infections","sources":[{"id":"nlm-mesh.d058345","title":"NLM MeSH Browser descriptor D058345","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058345"}],"status":"reported","summary":"NLM MeSH describes Asymptomatic Infections as: Infections that do not exhibit symptoms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001423","kind":"concept","label":"Bacterial Infections and Mycoses","sources":[{"id":"nlm-mesh.d001423","title":"NLM MeSH Browser descriptor D001423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001423"}],"status":"reported","summary":"NLM MeSH describes Bacterial Infections and Mycoses as: Infections caused by bacteria and fungi, general, specified, or unspecified.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001850","kind":"concept","label":"Bone Diseases, Infectious","sources":[{"id":"nlm-mesh.d001850","title":"NLM MeSH Browser descriptor D001850","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001850"}],"status":"reported","summary":"NLM MeSH describes Bone Diseases, Infectious as: Bone diseases caused by pathogenic microorganisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000093742","kind":"concept","label":"Breakthrough Infections","sources":[{"id":"nlm-mesh.d000093742","title":"NLM MeSH Browser descriptor D000093742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000093742"}],"status":"reported","summary":"NLM MeSH describes Breakthrough Infections as: Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d053821","kind":"concept","label":"Cardiovascular Infections","sources":[{"id":"nlm-mesh.d053821","title":"NLM MeSH Browser descriptor D053821","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053821"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Infections as: Pathological conditions of the CARDIOVASCULAR SYSTEM caused by infections.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d055499","kind":"concept","label":"Catheter-Related Infections","sources":[{"id":"nlm-mesh.d055499","title":"NLM MeSH Browser descriptor D055499","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055499"}],"status":"reported","summary":"NLM MeSH describes Catheter-Related Infections as: Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002494","kind":"concept","label":"Central Nervous System Infections","sources":[{"id":"nlm-mesh.d002494","title":"NLM MeSH Browser descriptor D002494","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002494"}],"status":"reported","summary":"NLM MeSH describes Central Nervous System Infections as: Pathogenic infections of the brain, spinal cord, and meninges. DNA VIRUS INFECTIONS ; RNA VIRUS INFECTIONS ; BACTERIAL INFECTIONS ; MYCOPLASMA INFECTIONS ; SPIROCHAETALES INFECTIONS ; fungal infections; PROTOZOAN INFECTIONS ; HELMINTHIASIS ; and PRION DISEASES may involve the central nervous system as a primary or secondary process.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d060085","kind":"concept","label":"Coinfection","sources":[{"id":"nlm-mesh.d060085","title":"NLM MeSH Browser descriptor D060085","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060085"}],"status":"reported","summary":"NLM MeSH describes Coinfection as: Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003141","kind":"concept","label":"Communicable Diseases","sources":[{"id":"nlm-mesh.d003141","title":"NLM MeSH Browser descriptor D003141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003141"}],"status":"reported","summary":"NLM MeSH describes Communicable Diseases as: An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d017714","kind":"concept","label":"Community-Acquired Infections","sources":[{"id":"nlm-mesh.d017714","title":"NLM MeSH Browser descriptor D017714","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017714"}],"status":"reported","summary":"NLM MeSH describes Community-Acquired Infections as: Any infection acquired in the community, that is, contrasted with those acquired in a health care facility ( CROSS INFECTION ). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003428","kind":"concept","label":"Cross Infection","sources":[{"id":"nlm-mesh.d003428","title":"NLM MeSH Browser descriptor D003428","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003428"}],"status":"reported","summary":"NLM MeSH describes Cross Infection as: Any infection which a patient contracts in a health-care institution.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015817","kind":"concept","label":"Eye Infections","sources":[{"id":"nlm-mesh.d015817","title":"NLM MeSH Browser descriptor D015817","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015817"}],"status":"reported","summary":"NLM MeSH describes Eye Infections as: Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d005490","kind":"concept","label":"Focal Infection","sources":[{"id":"nlm-mesh.d005490","title":"NLM MeSH Browser descriptor D005490","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005490"}],"status":"reported","summary":"NLM MeSH describes Focal Infection as: An infection at a specific location that may spread to another region of the body.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d005891","kind":"concept","label":"Gingivitis","sources":[{"id":"nlm-mesh.d005891","title":"NLM MeSH Browser descriptor D005891","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005891"}],"status":"reported","summary":"NLM MeSH describes Gingivitis as: Inflammation of gum tissue ( GINGIVA ) without loss of connective tissue.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006520","kind":"concept","label":"Hepatitis, Animal","sources":[{"id":"nlm-mesh.d006520","title":"NLM MeSH Browser descriptor D006520","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006520"}],"status":"reported","summary":"NLM MeSH describes Hepatitis, Animal as: INFLAMMATION of the LIVER in non-human animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d059413","kind":"concept","label":"Intraabdominal Infections","sources":[{"id":"nlm-mesh.d059413","title":"NLM MeSH Browser descriptor D059413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059413"}],"status":"reported","summary":"NLM MeSH describes Intraabdominal Infections as: Infection within the PERITONEAL CAVITY. A frequent cause is an ANASTOMOTIC LEAK following surgery.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007757","kind":"concept","label":"Laboratory Infection","sources":[{"id":"nlm-mesh.d007757","title":"NLM MeSH Browser descriptor D007757","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007757"}],"status":"reported","summary":"NLM MeSH describes Laboratory Infection as: Accidentally acquired infection in laboratory workers.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000085343","kind":"concept","label":"Latent Infection","sources":[{"id":"nlm-mesh.d000085343","title":"NLM MeSH Browser descriptor D000085343","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085343"}],"status":"reported","summary":"NLM MeSH describes Latent Infection as: Delayed infection of the host by a dormant or inactive pathogen.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009894","kind":"concept","label":"Opportunistic Infections","sources":[{"id":"nlm-mesh.d009894","title":"NLM MeSH Browser descriptor D009894","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009894"}],"status":"reported","summary":"NLM MeSH describes Opportunistic Infections as: An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010272","kind":"concept","label":"Parasitic Diseases","sources":[{"id":"nlm-mesh.d010272","title":"NLM MeSH Browser descriptor D010272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010272"}],"status":"reported","summary":"NLM MeSH describes Parasitic Diseases as: Infections or infestations with PARASITES . They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d034161","kind":"concept","label":"Pelvic Infection","sources":[{"id":"nlm-mesh.d034161","title":"NLM MeSH Browser descriptor D034161","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034161"}],"status":"reported","summary":"NLM MeSH describes Pelvic Infection as: Infection involving the tissues or organs in the PELVIS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000088562","kind":"concept","label":"Persistent Infection","sources":[{"id":"nlm-mesh.d000088562","title":"NLM MeSH Browser descriptor D000088562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088562"}],"status":"reported","summary":"NLM MeSH describes Persistent Infection as: Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections. LATENT INFECTIONS are infections in which manifestation of clinical symptoms appear later.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d031261","kind":"concept","label":"Poult Enteritis Mortality Syndrome","sources":[{"id":"nlm-mesh.d031261","title":"NLM MeSH Browser descriptor D031261","url":"https://meshb.nlm.nih.gov/record/ui?ui=D031261"}],"status":"reported","summary":"NLM MeSH describes Poult Enteritis Mortality Syndrome as: An acute, transmissible, infectious disease associated with high MORTALITY and MORBIDITY in young turkeys (poults). It is characterized by DIARRHEA ; ANOREXIA ; growth depression, and immune dysfunction. The cause is unknown but astroviruses ( AVASTROVIRUS ) and coronaviruses ( CORONAVIRUS, TURKEY ) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011251","kind":"concept","label":"Pregnancy Complications, Infectious","sources":[{"id":"nlm-mesh.d011251","title":"NLM MeSH Browser descriptor D011251","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011251"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Infectious as: The co-occurrence of pregnancy and an INFECTION . The infection may precede or follow FERTILIZATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d016459","kind":"concept","label":"Prosthesis-Related Infections","sources":[{"id":"nlm-mesh.d016459","title":"NLM MeSH Browser descriptor D016459","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016459"}],"status":"reported","summary":"NLM MeSH describes Prosthesis-Related Infections as: Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d060737","kind":"concept","label":"Reproductive Tract Infections","sources":[{"id":"nlm-mesh.d060737","title":"NLM MeSH Browser descriptor D060737","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060737"}],"status":"reported","summary":"NLM MeSH describes Reproductive Tract Infections as: Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012141","kind":"concept","label":"Respiratory Tract Infections","sources":[{"id":"nlm-mesh.d012141","title":"NLM MeSH Browser descriptor D012141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012141"}],"status":"reported","summary":"NLM MeSH describes Respiratory Tract Infections as: Invasion of the host RESPIRATORY SYSTEM by microorganisms, usually leading to pathological processes or diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018805","kind":"concept","label":"Sepsis","sources":[{"id":"nlm-mesh.d018805","title":"NLM MeSH Browser descriptor D018805","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018805"}],"status":"reported","summary":"NLM MeSH describes Sepsis as: Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by HYPOTENSION despite adequate fluid infusion, it is called SEPTIC SHOCK .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012749","kind":"concept","label":"Sexually Transmitted Diseases","sources":[{"id":"nlm-mesh.d012749","title":"NLM MeSH Browser descriptor D012749","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012749"}],"status":"reported","summary":"NLM MeSH describes Sexually Transmitted Diseases as: Diseases due to or propagated by sexual contact.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012874","kind":"concept","label":"Skin Diseases, Infectious","sources":[{"id":"nlm-mesh.d012874","title":"NLM MeSH Browser descriptor D012874","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012874"}],"status":"reported","summary":"NLM MeSH describes Skin Diseases, Infectious as: Skin diseases caused by bacteria, fungi, parasites, or viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018461","kind":"concept","label":"Soft Tissue Infections","sources":[{"id":"nlm-mesh.d018461","title":"NLM MeSH Browser descriptor D018461","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018461"}],"status":"reported","summary":"NLM MeSH describes Soft Tissue Infections as: Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d013492","kind":"concept","label":"Suppuration","sources":[{"id":"nlm-mesh.d013492","title":"NLM MeSH Browser descriptor D013492","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013492"}],"status":"reported","summary":"NLM MeSH describes Suppuration as: A pathologic process consisting in the formation of pus.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014115","kind":"concept","label":"Toxemia","sources":[{"id":"nlm-mesh.d014115","title":"NLM MeSH Browser descriptor D014115","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014115"}],"status":"reported","summary":"NLM MeSH describes Toxemia as: A condition produced by the presence of toxins or other harmful substances in the BLOOD .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014552","kind":"concept","label":"Urinary Tract Infections","sources":[{"id":"nlm-mesh.d014552","title":"NLM MeSH Browser descriptor D014552","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014552"}],"status":"reported","summary":"NLM MeSH describes Urinary Tract Infections as: Inflammatory responses of the epithelium of the URINARY TRACT to microbial invasions. They are often bacterial infections with associated BACTERIURIA and PYURIA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000079263","kind":"concept","label":"Vaccine-Preventable Diseases","sources":[{"id":"nlm-mesh.d000079263","title":"NLM MeSH Browser descriptor D000079263","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079263"}],"status":"reported","summary":"NLM MeSH describes Vaccine-Preventable Diseases as: Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000079426","kind":"concept","label":"Vector Borne Diseases","sources":[{"id":"nlm-mesh.d000079426","title":"NLM MeSH Browser descriptor D000079426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079426"}],"status":"reported","summary":"NLM MeSH describes Vector Borne Diseases as: Infectious diseases transmitted by DISEASE VECTORS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014777","kind":"concept","label":"Virus Diseases","sources":[{"id":"nlm-mesh.d014777","title":"NLM MeSH Browser descriptor D014777","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014777"}],"status":"reported","summary":"NLM MeSH describes Virus Diseases as: A general term for diseases caused by viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000069578","kind":"concept","label":"Waterborne Diseases","sources":[{"id":"nlm-mesh.d000069578","title":"NLM MeSH Browser descriptor D000069578","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069578"}],"status":"reported","summary":"NLM MeSH describes Waterborne Diseases as: Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014946","kind":"concept","label":"Wound Infection","sources":[{"id":"nlm-mesh.d014946","title":"NLM MeSH Browser descriptor D014946","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014946"}],"status":"reported","summary":"NLM MeSH describes Wound Infection as: Invasion of a wound by pathogenic microorganisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015047","kind":"concept","label":"Zoonoses","sources":[{"id":"nlm-mesh.d015047","title":"NLM MeSH Browser descriptor D015047","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015047"}],"status":"reported","summary":"NLM MeSH describes Zoonoses as: Diseases of non-human animals that may be transmitted to HUMANS or may be transmitted from humans to non-human animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003560","kind":"concept","label":"Cysts","sources":[{"id":"nlm-mesh.d003560","title":"NLM MeSH Browser descriptor D003560","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003560"}],"status":"reported","summary":"NLM MeSH describes Cysts as: Any fluid-filled closed cavity or sac that is lined by an EPITHELIUM . Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006222","kind":"concept","label":"Hamartoma","sources":[{"id":"nlm-mesh.d006222","title":"NLM MeSH Browser descriptor D006222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006222"}],"status":"reported","summary":"NLM MeSH describes Hamartoma as: A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009370","kind":"concept","label":"Neoplasms by Histologic Type","sources":[{"id":"nlm-mesh.d009370","title":"NLM MeSH Browser descriptor D009370","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009370"}],"status":"reported","summary":"NLM MeSH describes Neoplasms by Histologic Type as: A collective term for the various histological types of NEOPLASMS . It is more likely to be used by searchers than by indexers and catalogers.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009371","kind":"concept","label":"Neoplasms by Site","sources":[{"id":"nlm-mesh.d009371","title":"NLM MeSH Browser descriptor D009371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009371"}],"status":"reported","summary":"NLM MeSH describes Neoplasms by Site as: A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as BRAIN NEOPLASMS ; DUODENAL NEOPLASMS ; LIVER NEOPLASMS ; etc.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009374","kind":"concept","label":"Neoplasms, Experimental","sources":[{"id":"nlm-mesh.d009374","title":"NLM MeSH Browser descriptor D009374","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009374"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Experimental as: Experimentally induced new abnormal growth of TISSUES in animals to provide models for studying human neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009376","kind":"concept","label":"Neoplasms, Hormone-Dependent","sources":[{"id":"nlm-mesh.d009376","title":"NLM MeSH Browser descriptor D009376","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009376"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Hormone-Dependent as: Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009378","kind":"concept","label":"Neoplasms, Multiple Primary","sources":[{"id":"nlm-mesh.d009378","title":"NLM MeSH Browser descriptor D009378","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009378"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Multiple Primary as: Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d017169","kind":"concept","label":"Neoplasms, Post-Traumatic","sources":[{"id":"nlm-mesh.d017169","title":"NLM MeSH Browser descriptor D017169","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017169"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Post-Traumatic as: Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009381","kind":"concept","label":"Neoplasms, Radiation-Induced","sources":[{"id":"nlm-mesh.d009381","title":"NLM MeSH Browser descriptor D009381","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009381"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Radiation-Induced as: Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d016609","kind":"concept","label":"Neoplasms, Second Primary","sources":[{"id":"nlm-mesh.d016609","title":"NLM MeSH Browser descriptor D016609","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016609"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Second Primary as: Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009385","kind":"concept","label":"Neoplastic Processes","sources":[{"id":"nlm-mesh.d009385","title":"NLM MeSH Browser descriptor D009385","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009385"}],"status":"reported","summary":"NLM MeSH describes Neoplastic Processes as: The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009386","kind":"concept","label":"Neoplastic Syndromes, Hereditary","sources":[{"id":"nlm-mesh.d009386","title":"NLM MeSH Browser descriptor D009386","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009386"}],"status":"reported","summary":"NLM MeSH describes Neoplastic Syndromes, Hereditary as: The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010257","kind":"concept","label":"Paraneoplastic Syndromes","sources":[{"id":"nlm-mesh.d010257","title":"NLM MeSH Browser descriptor D010257","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010257"}],"status":"reported","summary":"NLM MeSH describes Paraneoplastic Syndromes as: In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011230","kind":"concept","label":"Precancerous Conditions","sources":[{"id":"nlm-mesh.d011230","title":"NLM MeSH Browser descriptor D011230","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011230"}],"status":"reported","summary":"NLM MeSH describes Precancerous Conditions as: Pathological conditions that tend eventually to become malignant.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011252","kind":"concept","label":"Pregnancy Complications, Neoplastic","sources":[{"id":"nlm-mesh.d011252","title":"NLM MeSH Browser descriptor D011252","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011252"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Neoplastic as: The co-occurrence of pregnancy and NEOPLASMS . The neoplastic disease may precede or follow FERTILIZATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018376","kind":"concept","label":"Cardiovascular Abnormalities","sources":[{"id":"nlm-mesh.d018376","title":"NLM MeSH Browser descriptor D018376","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018376"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Abnormalities as: Congenital, inherited, or acquired anomalies of the CARDIOVASCULAR SYSTEM , including the HEART and BLOOD VESSELS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006331","kind":"concept","label":"Heart Diseases","sources":[{"id":"nlm-mesh.d006331","title":"NLM MeSH Browser descriptor D006331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006331"}],"status":"reported","summary":"NLM MeSH describes Heart Diseases as: Pathological conditions involving the HEART including its structural and functional abnormalities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011249","kind":"concept","label":"Pregnancy Complications, Cardiovascular","sources":[{"id":"nlm-mesh.d011249","title":"NLM MeSH Browser descriptor D011249","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011249"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Cardiovascular as: The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow FERTILIZATION and it may or may not have a deleterious effect on the pregnant woman or FETUS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014652","kind":"concept","label":"Vascular Diseases","sources":[{"id":"nlm-mesh.d014652","title":"NLM MeSH Browser descriptor D014652","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014652"}],"status":"reported","summary":"NLM MeSH describes Vascular Diseases as: Pathological processes involving any of the BLOOD VESSELS in the cardiac or peripheral circulation. They include diseases of ARTERIES ; VEINS ; and rest of the vasculature system in the body.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020274","kind":"concept","label":"Autoimmune Diseases of the Nervous System","sources":[{"id":"nlm-mesh.d020274","title":"NLM MeSH Browser descriptor D020274","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020274"}],"status":"reported","summary":"NLM MeSH describes Autoimmune Diseases of the Nervous System as: Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g., MULTIPLE SCLEROSIS ) or the peripheral nervous system (e.g., GUILLAIN-BARRE SYNDROME ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001342","kind":"concept","label":"Autonomic Nervous System Diseases","sources":[{"id":"nlm-mesh.d001342","title":"NLM MeSH Browser descriptor D001342","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001342"}],"status":"reported","summary":"NLM MeSH describes Autonomic Nervous System Diseases as: Diseases of the AUTONOMIC NERVOUS SYSTEM , including sympathetic, parasympathetic, and enteric nervous systems.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002493","kind":"concept","label":"Central Nervous System Diseases","sources":[{"id":"nlm-mesh.d002493","title":"NLM MeSH Browser descriptor D002493","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002493"}],"status":"reported","summary":"NLM MeSH describes Central Nervous System Diseases as: Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d021081","kind":"concept","label":"Chronobiology Disorders","sources":[{"id":"nlm-mesh.d021081","title":"NLM MeSH Browser descriptor D021081","url":"https://meshb.nlm.nih.gov/record/ui?ui=D021081"}],"status":"reported","summary":"NLM MeSH describes Chronobiology Disorders as: Disruptions of the rhythmic cycle of bodily functions or activities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003389","kind":"concept","label":"Cranial Nerve Diseases","sources":[{"id":"nlm-mesh.d003389","title":"NLM MeSH Browser descriptor D003389","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003389"}],"status":"reported","summary":"NLM MeSH describes Cranial Nerve Diseases as: Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003711","kind":"concept","label":"Demyelinating Diseases","sources":[{"id":"nlm-mesh.d003711","title":"NLM MeSH Browser descriptor D003711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003711"}],"status":"reported","summary":"NLM MeSH describes Demyelinating Diseases as: Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009421","kind":"concept","label":"Nervous System Malformations","sources":[{"id":"nlm-mesh.d009421","title":"NLM MeSH Browser descriptor D009421","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009421"}],"status":"reported","summary":"NLM MeSH describes Nervous System Malformations as: Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009423","kind":"concept","label":"Nervous System Neoplasms","sources":[{"id":"nlm-mesh.d009423","title":"NLM MeSH Browser descriptor D009423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009423"}],"status":"reported","summary":"NLM MeSH describes Nervous System Neoplasms as: Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020752","kind":"concept","label":"Neurocutaneous Syndromes","sources":[{"id":"nlm-mesh.d020752","title":"NLM MeSH Browser descriptor D020752","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020752"}],"status":"reported","summary":"NLM MeSH describes Neurocutaneous Syndromes as: A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d019636","kind":"concept","label":"Neurodegenerative Diseases","sources":[{"id":"nlm-mesh.d019636","title":"NLM MeSH Browser descriptor D019636","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019636"}],"status":"reported","summary":"NLM MeSH describes Neurodegenerative Diseases as: Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000090862","kind":"concept","label":"Neuroinflammatory Diseases","sources":[{"id":"nlm-mesh.d000090862","title":"NLM MeSH Browser descriptor D000090862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090862"}],"status":"reported","summary":"NLM MeSH describes Neuroinflammatory Diseases as: Diseases characterized by inflammation of the nervous tissue.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009461","kind":"concept","label":"Neurologic Manifestations","sources":[{"id":"nlm-mesh.d009461","title":"NLM MeSH Browser descriptor D009461","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009461"}],"status":"reported","summary":"NLM MeSH describes Neurologic Manifestations as: Clinical signs and symptoms caused by nervous system injury or dysfunction.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009468","kind":"concept","label":"Neuromuscular Diseases","sources":[{"id":"nlm-mesh.d009468","title":"NLM MeSH Browser descriptor D009468","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009468"}],"status":"reported","summary":"NLM MeSH describes Neuromuscular Diseases as: A general term encompassing lower MOTOR NEURON DISEASE ; PERIPHERAL NERVOUS SYSTEM DISEASES ; and certain MUSCULAR DISEASES . Manifestations include MUSCLE WEAKNESS ; FASCICULATION ; muscle ATROPHY ; SPASM ; MYOKYMIA ; MUSCLE HYPERTONIA , myalgias, and MUSCLE HYPOTONIA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020258","kind":"concept","label":"Neurotoxicity Syndromes","sources":[{"id":"nlm-mesh.d020258","title":"NLM MeSH Browser descriptor D020258","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020258"}],"status":"reported","summary":"NLM MeSH describes Neurotoxicity Syndromes as: Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012148","kind":"concept","label":"Restless Legs Syndrome","sources":[{"id":"nlm-mesh.d012148","title":"NLM MeSH Browser descriptor D012148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012148"}],"status":"reported","summary":"NLM MeSH describes Restless Legs Syndrome as: A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012893","kind":"concept","label":"Sleep Wake Disorders","sources":[{"id":"nlm-mesh.d012893","title":"NLM MeSH Browser descriptor D012893","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012893"}],"status":"reported","summary":"NLM MeSH describes Sleep Wake Disorders as: Abnormal sleep-wake schedule or pattern associated with the CIRCADIAN RHYTHM which affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020196","kind":"concept","label":"Trauma, Nervous System","sources":[{"id":"nlm-mesh.d020196","title":"NLM MeSH Browser descriptor D020196","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020196"}],"status":"reported","summary":"NLM MeSH describes Trauma, Nervous System as: Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001982","kind":"concept","label":"Bronchial Diseases","sources":[{"id":"nlm-mesh.d001982","title":"NLM MeSH Browser descriptor D001982","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001982"}],"status":"reported","summary":"NLM MeSH describes Bronchial Diseases as: Diseases involving the BRONCHI .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002925","kind":"concept","label":"Ciliary Motility Disorders","sources":[{"id":"nlm-mesh.d002925","title":"NLM MeSH Browser descriptor D002925","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002925"}],"status":"reported","summary":"NLM MeSH describes Ciliary Motility Disorders as: Conditions caused by abnormal CILIA movement in the body, usually causing KARTAGENER SYNDROME , chronic respiratory disorders, chronic SINUSITIS , and chronic OTITIS . Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme DYNEIN arms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015769","kind":"concept","label":"Granuloma, Respiratory Tract","sources":[{"id":"nlm-mesh.d015769","title":"NLM MeSH Browser descriptor D015769","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015769"}],"status":"reported","summary":"NLM MeSH describes Granuloma, Respiratory Tract as: Granulomatous disorders affecting one or more sites in the respiratory tract.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007818","kind":"concept","label":"Laryngeal Diseases","sources":[{"id":"nlm-mesh.d007818","title":"NLM MeSH Browser descriptor D007818","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007818"}],"status":"reported","summary":"NLM MeSH describes Laryngeal Diseases as: Pathological processes involving any part of the LARYNX which coordinates many functions such as voice production, breathing, swallowing, and coughing.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d008171","kind":"concept","label":"Lung Diseases","sources":[{"id":"nlm-mesh.d008171","title":"NLM MeSH Browser descriptor D008171","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008171"}],"status":"reported","summary":"NLM MeSH describes Lung Diseases as: Pathological processes involving any part of the LUNG .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009668","kind":"concept","label":"Nose Diseases","sources":[{"id":"nlm-mesh.d009668","title":"NLM MeSH Browser descriptor D009668","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009668"}],"status":"reported","summary":"NLM MeSH describes Nose Diseases as: Disorders of the nose, general or unspecified.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010995","kind":"concept","label":"Pleural Diseases","sources":[{"id":"nlm-mesh.d010995","title":"NLM MeSH Browser descriptor D010995","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010995"}],"status":"reported","summary":"NLM MeSH describes Pleural Diseases as: Diseases involving the PLEURA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012120","kind":"concept","label":"Respiration Disorders","sources":[{"id":"nlm-mesh.d012120","title":"NLM MeSH Browser descriptor D012120","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012120"}],"status":"reported","summary":"NLM MeSH describes Respiration Disorders as: Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012130","kind":"concept","label":"Respiratory Hypersensitivity","sources":[{"id":"nlm-mesh.d012130","title":"NLM MeSH Browser descriptor D012130","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012130"}],"status":"reported","summary":"NLM MeSH describes Respiratory Hypersensitivity as: A form of hypersensitivity affecting the respiratory tract. It includes ASTHMA and RHINITIS, ALLERGIC, SEASONAL .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015619","kind":"concept","label":"Respiratory System Abnormalities","sources":[{"id":"nlm-mesh.d015619","title":"NLM MeSH Browser descriptor D015619","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015619"}],"status":"reported","summary":"NLM MeSH describes Respiratory System Abnormalities as: Congenital structural abnormalities of the respiratory system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001520","kind":"concept","label":"Behavior and Behavior Mechanisms","sources":[{"id":"nlm-mesh.d001520","title":"NLM MeSH Browser descriptor D001520","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001520"}],"status":"reported","summary":"NLM MeSH describes Behavior and Behavior Mechanisms as: The observable response made to a situation and the unconscious processes underlying it.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000223","kind":"concept","label":"Adaptation, Psychological","sources":[{"id":"nlm-mesh.d000223","title":"NLM MeSH Browser descriptor D000223","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000223"}],"status":"reported","summary":"NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001290","kind":"concept","label":"Attitude","sources":[{"id":"nlm-mesh.d001290","title":"NLM MeSH Browser descriptor D001290","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001290"}],"status":"reported","summary":"NLM MeSH describes Attitude as: An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001519","kind":"concept","label":"Behavior","sources":[{"id":"nlm-mesh.d001519","title":"NLM MeSH Browser descriptor D001519","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001519"}],"status":"reported","summary":"NLM MeSH describes Behavior as: The observable response of a man or animal to a situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002668","kind":"concept","label":"Child Rearing","sources":[{"id":"nlm-mesh.d002668","title":"NLM MeSH Browser descriptor D002668","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002668"}],"status":"reported","summary":"NLM MeSH describes Child Rearing as: The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from PARENTING in that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003674","kind":"concept","label":"Defense Mechanisms","sources":[{"id":"nlm-mesh.d003674","title":"NLM MeSH Browser descriptor D003674","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003674"}],"status":"reported","summary":"NLM MeSH describes Defense Mechanisms as: Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004644","kind":"concept","label":"Emotions","sources":[{"id":"nlm-mesh.d004644","title":"NLM MeSH Browser descriptor D004644","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004644"}],"status":"reported","summary":"NLM MeSH describes Emotions as: Those affective states which can be experienced and have arousing and motivational properties.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000099056","kind":"concept","label":"Outcome Expectations","sources":[{"id":"nlm-mesh.d000099056","title":"NLM MeSH Browser descriptor D000099056","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099056"}],"status":"reported","summary":"NLM MeSH describes Outcome Expectations as: Believed or anticipated consequences of a person’s behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d040821","kind":"field","label":"Human Characteristics","sources":[{"id":"nlm-mesh.d040821","title":"NLM MeSH Browser descriptor D040821","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040821"}],"status":"reported","summary":"NLM MeSH describes Human Characteristics as: The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006803","kind":"concept","label":"Human Development","sources":[{"id":"nlm-mesh.d006803","title":"NLM MeSH Browser descriptor D006803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006803"}],"status":"reported","summary":"NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d016743","kind":"concept","label":"Mental Competency","sources":[{"id":"nlm-mesh.d016743","title":"NLM MeSH Browser descriptor D016743","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016743"}],"status":"reported","summary":"NLM MeSH describes Mental Competency as: The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009042","kind":"concept","label":"Motivation","sources":[{"id":"nlm-mesh.d009042","title":"NLM MeSH Browser descriptor D009042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009042"}],"status":"reported","summary":"NLM MeSH describes Motivation as: Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019954","kind":"concept","label":"Neurobehavioral Manifestations","sources":[{"id":"nlm-mesh.d019954","title":"NLM MeSH Browser descriptor D019954","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019954"}],"status":"reported","summary":"NLM MeSH describes Neurobehavioral Manifestations as: Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010551","kind":"concept","label":"Personality","sources":[{"id":"nlm-mesh.d010551","title":"NLM MeSH Browser descriptor D010551","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010551"}],"status":"reported","summary":"NLM MeSH describes Personality as: Behavior-response patterns that characterize the individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011593","kind":"field","label":"Psychology, Social","sources":[{"id":"nlm-mesh.d011593","title":"NLM MeSH Browser descriptor D011593","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011593"}],"status":"reported","summary":"NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000083623","kind":"concept","label":"Psychosocial Functioning","sources":[{"id":"nlm-mesh.d000083623","title":"NLM MeSH Browser descriptor D000083623","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000083623"}],"status":"reported","summary":"NLM MeSH describes Psychosocial Functioning as: Level of and variations in social and emotional activity or behaviors.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013695","kind":"concept","label":"Temperance","sources":[{"id":"nlm-mesh.d013695","title":"NLM MeSH Browser descriptor D013695","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013695"}],"status":"reported","summary":"NLM MeSH describes Temperance as: Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097813","kind":"concept","label":"Coping Skills","sources":[{"id":"nlm-mesh.d000097813","title":"NLM MeSH Browser descriptor D000097813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097813"}],"status":"reported","summary":"NLM MeSH describes Coping Skills as: Various techniques for actively managing a stressful event or situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000066498","kind":"concept","label":"Emotional Adjustment","sources":[{"id":"nlm-mesh.d000066498","title":"NLM MeSH Browser descriptor D000066498","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066498"}],"status":"reported","summary":"NLM MeSH describes Emotional Adjustment as: Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d030141","kind":"concept","label":"Feedback, Psychological","sources":[{"id":"nlm-mesh.d030141","title":"NLM MeSH Browser descriptor D030141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D030141"}],"status":"reported","summary":"NLM MeSH describes Feedback, Psychological as: A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009949","kind":"concept","label":"Orientation","sources":[{"id":"nlm-mesh.d009949","title":"NLM MeSH Browser descriptor D009949","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009949"}],"status":"reported","summary":"NLM MeSH describes Orientation as: Awareness of oneself in relation to time, place and person.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078002","kind":"concept","label":"Posttraumatic Growth, Psychological","sources":[{"id":"nlm-mesh.d000078002","title":"NLM MeSH Browser descriptor D000078002","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078002"}],"status":"reported","summary":"NLM MeSH describes Posttraumatic Growth, Psychological as: Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097812","kind":"concept","label":"Psychological Growth","sources":[{"id":"nlm-mesh.d000097812","title":"NLM MeSH Browser descriptor D000097812","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097812"}],"status":"reported","summary":"NLM MeSH describes Psychological Growth as: A process of actively learning and adapting to new ways to function following a challenging life crisis.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d060685","kind":"concept","label":"Sense of Coherence","sources":[{"id":"nlm-mesh.d060685","title":"NLM MeSH Browser descriptor D060685","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060685"}],"status":"reported","summary":"NLM MeSH describes Sense of Coherence as: A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001291","kind":"concept","label":"Attitude of Health Personnel","sources":[{"id":"nlm-mesh.d001291","title":"NLM MeSH Browser descriptor D001291","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001291"}],"status":"reported","summary":"NLM MeSH describes Attitude of Health Personnel as: Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001292","kind":"concept","label":"Attitude to Computers","sources":[{"id":"nlm-mesh.d001292","title":"NLM MeSH Browser descriptor D001292","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001292"}],"status":"reported","summary":"NLM MeSH describes Attitude to Computers as: The attitude and behavior associated with an individual using the computer.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001293","kind":"concept","label":"Attitude to Death","sources":[{"id":"nlm-mesh.d001293","title":"NLM MeSH Browser descriptor D001293","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001293"}],"status":"reported","summary":"NLM MeSH describes Attitude to Death as: Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001294","kind":"concept","label":"Attitude to Health","sources":[{"id":"nlm-mesh.d001294","title":"NLM MeSH Browser descriptor D001294","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001294"}],"status":"reported","summary":"NLM MeSH describes Attitude to Health as: Public attitudes toward health, disease, and the medical care system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d058443","kind":"concept","label":"Catastrophization","sources":[{"id":"nlm-mesh.d058443","title":"NLM MeSH Browser descriptor D058443","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058443"}],"status":"reported","summary":"NLM MeSH describes Catastrophization as: Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067656","kind":"concept","label":"Optimism","sources":[{"id":"nlm-mesh.d000067656","title":"NLM MeSH Browser descriptor D000067656","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067656"}],"status":"reported","summary":"NLM MeSH describes Optimism as: Mental attitude that interprets life events as generally being positive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067657","kind":"concept","label":"Pessimism","sources":[{"id":"nlm-mesh.d000067657","title":"NLM MeSH Browser descriptor D000067657","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067657"}],"status":"reported","summary":"NLM MeSH describes Pessimism as: Mental attitude that interprets life events as generally being negative.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078682","kind":"concept","label":"Respect","sources":[{"id":"nlm-mesh.d000078682","title":"NLM MeSH Browser descriptor D000078682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078682"}],"status":"reported","summary":"NLM MeSH describes Respect as: A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013240","kind":"concept","label":"Stereotyping","sources":[{"id":"nlm-mesh.d013240","title":"NLM MeSH Browser descriptor D013240","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013240"}],"status":"reported","summary":"NLM MeSH describes Stereotyping as: An oversimplified perception or conception especially of persons, social groups, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000057","kind":"concept","label":"Accident Proneness","sources":[{"id":"nlm-mesh.d000057","title":"NLM MeSH Browser descriptor D000057","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000057"}],"status":"reported","summary":"NLM MeSH describes Accident Proneness as: Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000294","kind":"concept","label":"Adolescent Behavior","sources":[{"id":"nlm-mesh.d000294","title":"NLM MeSH Browser descriptor D000294","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000294"}],"status":"reported","summary":"NLM MeSH describes Adolescent Behavior as: Any observable response or action of an adolescent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001522","kind":"concept","label":"Behavior, Animal","sources":[{"id":"nlm-mesh.d001522","title":"NLM MeSH Browser descriptor D001522","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001522"}],"status":"reported","summary":"NLM MeSH describes Behavior, Animal as: The observable response an animal makes to any situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001526","kind":"concept","label":"Behavioral Symptoms","sources":[{"id":"nlm-mesh.d001526","title":"NLM MeSH Browser descriptor D001526","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001526"}],"status":"reported","summary":"NLM MeSH describes Behavioral Symptoms as: Observable manifestations of impaired psychological functioning.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002652","kind":"concept","label":"Child Behavior","sources":[{"id":"nlm-mesh.d002652","title":"NLM MeSH Browser descriptor D002652","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002652"}],"status":"reported","summary":"NLM MeSH describes Child Behavior as: Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months, INFANT BEHAVIOR is available.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017004","kind":"concept","label":"Codependency, Psychological","sources":[{"id":"nlm-mesh.d017004","title":"NLM MeSH Browser descriptor D017004","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017004"}],"status":"reported","summary":"NLM MeSH describes Codependency, Psychological as: A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003142","kind":"concept","label":"Communication","sources":[{"id":"nlm-mesh.d003142","title":"NLM MeSH Browser descriptor D003142","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003142"}],"status":"reported","summary":"NLM MeSH describes Communication as: The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003258","kind":"concept","label":"Consumer Behavior","sources":[{"id":"nlm-mesh.d003258","title":"NLM MeSH Browser descriptor D003258","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003258"}],"status":"reported","summary":"NLM MeSH describes Consumer Behavior as: Behavior associated with the procurement of goods, services, or experiences.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000066479","kind":"concept","label":"Criminal Behavior","sources":[{"id":"nlm-mesh.d000066479","title":"NLM MeSH Browser descriptor D000066479","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066479"}],"status":"reported","summary":"NLM MeSH describes Criminal Behavior as: Conduct leading to commission of unlawful acts.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003617","kind":"concept","label":"Dangerous Behavior","sources":[{"id":"nlm-mesh.d003617","title":"NLM MeSH Browser descriptor D003617","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003617"}],"status":"reported","summary":"NLM MeSH describes Dangerous Behavior as: Actions which have a high risk of being harmful or injurious to oneself or others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004327","kind":"concept","label":"Drinking Behavior","sources":[{"id":"nlm-mesh.d004327","title":"NLM MeSH Browser descriptor D004327","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004327"}],"status":"reported","summary":"NLM MeSH describes Drinking Behavior as: Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d058999","kind":"concept","label":"Drug-Seeking Behavior","sources":[{"id":"nlm-mesh.d058999","title":"NLM MeSH Browser descriptor D058999","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058999"}],"status":"reported","summary":"NLM MeSH describes Drug-Seeking Behavior as: Activities performed to obtain licit or illicit substances.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004924","kind":"concept","label":"Escape Reaction","sources":[{"id":"nlm-mesh.d004924","title":"NLM MeSH Browser descriptor D004924","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004924"}],"status":"reported","summary":"NLM MeSH describes Escape Reaction as: Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005106","kind":"concept","label":"Exploratory Behavior","sources":[{"id":"nlm-mesh.d005106","title":"NLM MeSH Browser descriptor D005106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005106"}],"status":"reported","summary":"NLM MeSH describes Exploratory Behavior as: The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005247","kind":"concept","label":"Feeding Behavior","sources":[{"id":"nlm-mesh.d005247","title":"NLM MeSH Browser descriptor D005247","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005247"}],"status":"reported","summary":"NLM MeSH describes Feeding Behavior as: Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006184","kind":"concept","label":"Habits","sources":[{"id":"nlm-mesh.d006184","title":"NLM MeSH Browser descriptor D006184","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006184"}],"status":"reported","summary":"NLM MeSH describes Habits as: Acquired or learned responses which are regularly manifested.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040261","kind":"concept","label":"Harm Reduction","sources":[{"id":"nlm-mesh.d040261","title":"NLM MeSH Browser descriptor D040261","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040261"}],"status":"reported","summary":"NLM MeSH describes Harm Reduction as: The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d015438","kind":"concept","label":"Health Behavior","sources":[{"id":"nlm-mesh.d015438","title":"NLM MeSH Browser descriptor D015438","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015438"}],"status":"reported","summary":"NLM MeSH describes Health Behavior as: Combination of HEALTH KNOWLEDGE, ATTITUDES, PRACTICE which underlie actions taken by individuals regarding their health.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d060845","kind":"concept","label":"Hoarding","sources":[{"id":"nlm-mesh.d060845","title":"NLM MeSH Browser descriptor D060845","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060845"}],"status":"reported","summary":"NLM MeSH describes Hoarding as: A persistent difficulty discarding or parting with possessions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000081762","kind":"concept","label":"Human-Animal Interaction","sources":[{"id":"nlm-mesh.d000081762","title":"NLM MeSH Browser descriptor D000081762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000081762"}],"status":"reported","summary":"NLM MeSH describes Human-Animal Interaction as: Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d055809","kind":"concept","label":"Illness Behavior","sources":[{"id":"nlm-mesh.d055809","title":"NLM MeSH Browser descriptor D055809","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055809"}],"status":"reported","summary":"NLM MeSH describes Illness Behavior as: Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of APPETITE or LIBIDO ; disinterest in ACTIVITIES OF DAILY LIVING ; or withdrawal from social interaction.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007100","kind":"concept","label":"Imitative Behavior","sources":[{"id":"nlm-mesh.d007100","title":"NLM MeSH Browser descriptor D007100","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007100"}],"status":"reported","summary":"NLM MeSH describes Imitative Behavior as: The mimicking of the behavior of one individual by another.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007175","kind":"concept","label":"Impulsive Behavior","sources":[{"id":"nlm-mesh.d007175","title":"NLM MeSH Browser descriptor D007175","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007175"}],"status":"reported","summary":"NLM MeSH describes Impulsive Behavior as: An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057226","kind":"concept","label":"Information Seeking Behavior","sources":[{"id":"nlm-mesh.d057226","title":"NLM MeSH Browser descriptor D057226","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057226"}],"status":"reported","summary":"NLM MeSH describes Information Seeking Behavior as: How information is gathered in personal, academic or work environments and the resources used.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007266","kind":"concept","label":"Inhibition, Psychological","sources":[{"id":"nlm-mesh.d007266","title":"NLM MeSH Browser descriptor D007266","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007266"}],"status":"reported","summary":"NLM MeSH describes Inhibition, Psychological as: The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074609","kind":"concept","label":"Marijuana Use","sources":[{"id":"nlm-mesh.d000074609","title":"NLM MeSH Browser descriptor D000074609","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074609"}],"status":"reported","summary":"NLM MeSH describes Marijuana Use as: Medicinal or recreational utilization of MARIJUANA .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009043","kind":"concept","label":"Motor Activity","sources":[{"id":"nlm-mesh.d009043","title":"NLM MeSH Browser descriptor D009043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009043"}],"status":"reported","summary":"NLM MeSH describes Motor Activity as: Body movements of a human or an animal as a behavioral phenomenon.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000073456","kind":"concept","label":"Multitasking Behavior","sources":[{"id":"nlm-mesh.d000073456","title":"NLM MeSH Browser descriptor D000073456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073456"}],"status":"reported","summary":"NLM MeSH describes Multitasking Behavior as: Simultaneous task performance, or switching between tasks in a concentrated period of time.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010549","kind":"concept","label":"Personal Satisfaction","sources":[{"id":"nlm-mesh.d010549","title":"NLM MeSH Browser descriptor D010549","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010549"}],"status":"reported","summary":"NLM MeSH describes Personal Satisfaction as: The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000084783","kind":"concept","label":"Recreational Drug Use","sources":[{"id":"nlm-mesh.d000084783","title":"NLM MeSH Browser descriptor D000084783","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000084783"}],"status":"reported","summary":"NLM MeSH describes Recreational Drug Use as: Occasional or habitual non-prescribed, not health-related use of substances.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d043762","kind":"concept","label":"Reproductive Behavior","sources":[{"id":"nlm-mesh.d043762","title":"NLM MeSH Browser descriptor D043762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D043762"}],"status":"reported","summary":"NLM MeSH describes Reproductive Behavior as: Human behavior or decision related to REPRODUCTION .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040242","kind":"concept","label":"Risk Reduction Behavior","sources":[{"id":"nlm-mesh.d040242","title":"NLM MeSH Browser descriptor D040242","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040242"}],"status":"reported","summary":"NLM MeSH describes Risk Reduction Behavior as: Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012309","kind":"concept","label":"Risk-Taking","sources":[{"id":"nlm-mesh.d012309","title":"NLM MeSH Browser descriptor D012309","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012309"}],"status":"reported","summary":"NLM MeSH describes Risk-Taking as: Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057185","kind":"concept","label":"Sedentary Behavior","sources":[{"id":"nlm-mesh.d057185","title":"NLM MeSH Browser descriptor D057185","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057185"}],"status":"reported","summary":"NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012653","kind":"concept","label":"Self Stimulation","sources":[{"id":"nlm-mesh.d012653","title":"NLM MeSH Browser descriptor D012653","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012653"}],"status":"reported","summary":"NLM MeSH describes Self Stimulation as: The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012725","kind":"concept","label":"Sexual Behavior","sources":[{"id":"nlm-mesh.d012725","title":"NLM MeSH Browser descriptor D012725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012725"}],"status":"reported","summary":"NLM MeSH describes Sexual Behavior as: Sexual activities of humans.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012907","kind":"concept","label":"Smoking","sources":[{"id":"nlm-mesh.d012907","title":"NLM MeSH Browser descriptor D012907","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012907"}],"status":"reported","summary":"NLM MeSH describes Smoking as: Willful or deliberate act of inhaling and exhaling SMOKE from burning substances or agents held by hand.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012919","kind":"concept","label":"Social Behavior","sources":[{"id":"nlm-mesh.d012919","title":"NLM MeSH Browser descriptor D012919","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012919"}],"status":"reported","summary":"NLM MeSH describes Social Behavior as: Any behavior caused by or affecting another individual or group usually of the same species.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013037","kind":"concept","label":"Spatial Behavior","sources":[{"id":"nlm-mesh.d013037","title":"NLM MeSH Browser descriptor D013037","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013037"}],"status":"reported","summary":"NLM MeSH describes Spatial Behavior as: Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013239","kind":"concept","label":"Stereotyped Behavior","sources":[{"id":"nlm-mesh.d013239","title":"NLM MeSH Browser descriptor D013239","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013239"}],"status":"reported","summary":"NLM MeSH describes Stereotyped Behavior as: Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013391","kind":"concept","label":"Sucking Behavior","sources":[{"id":"nlm-mesh.d013391","title":"NLM MeSH Browser descriptor D013391","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013391"}],"status":"reported","summary":"NLM MeSH describes Sucking Behavior as: Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064424","kind":"concept","label":"Tobacco Use","sources":[{"id":"nlm-mesh.d064424","title":"NLM MeSH Browser descriptor D064424","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064424"}],"status":"reported","summary":"NLM MeSH describes Tobacco Use as: Use of TOBACCO (Nicotiana tabacum L) and TOBACCO PRODUCTS .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014039","kind":"concept","label":"Toilet Training","sources":[{"id":"nlm-mesh.d014039","title":"NLM MeSH Browser descriptor D014039","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014039"}],"status":"reported","summary":"NLM MeSH describes Toilet Training as: Conditioning to defecate and urinate in culturally acceptable places.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000184","kind":"concept","label":"Acting Out","sources":[{"id":"nlm-mesh.d000184","title":"NLM MeSH Browser descriptor D000184","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000184"}],"status":"reported","summary":"NLM MeSH describes Acting Out as: Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003717","kind":"concept","label":"Denial, Psychological","sources":[{"id":"nlm-mesh.d003717","title":"NLM MeSH Browser descriptor D003717","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003717"}],"status":"reported","summary":"NLM MeSH describes Denial, Psychological as: Refusal to admit the truth or reality of a situation or experience.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004208","kind":"concept","label":"Displacement, Psychological","sources":[{"id":"nlm-mesh.d004208","title":"NLM MeSH Browser descriptor D004208","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004208"}],"status":"reported","summary":"NLM MeSH describes Displacement, Psychological as: The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005201","kind":"concept","label":"Fantasy","sources":[{"id":"nlm-mesh.d005201","title":"NLM MeSH Browser descriptor D005201","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005201"}],"status":"reported","summary":"NLM MeSH describes Fantasy as: An imagined sequence of events or mental images, e.g., daydreams.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006380","kind":"concept","label":"Helplessness, Learned","sources":[{"id":"nlm-mesh.d006380","title":"NLM MeSH Browser descriptor D006380","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006380"}],"status":"reported","summary":"NLM MeSH describes Helplessness, Learned as: Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007062","kind":"concept","label":"Identification, Psychological","sources":[{"id":"nlm-mesh.d007062","title":"NLM MeSH Browser descriptor D007062","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007062"}],"status":"reported","summary":"NLM MeSH describes Identification, Psychological as: A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000087366","kind":"concept","label":"Information Avoidance","sources":[{"id":"nlm-mesh.d000087366","title":"NLM MeSH Browser descriptor D000087366","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000087366"}],"status":"reported","summary":"NLM MeSH describes Information Avoidance as: Choosing to not obtain knowledge even if having the information could be to one's benefit.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010467","kind":"concept","label":"Perceptual Defense","sources":[{"id":"nlm-mesh.d010467","title":"NLM MeSH Browser descriptor D010467","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010467"}],"status":"reported","summary":"NLM MeSH describes Perceptual Defense as: Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075682","kind":"concept","label":"Procrastination","sources":[{"id":"nlm-mesh.d000075682","title":"NLM MeSH Browser descriptor D000075682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075682"}],"status":"reported","summary":"NLM MeSH describes Procrastination as: The deferment of actions or tasks to a later time, or to infinity.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011385","kind":"concept","label":"Projection","sources":[{"id":"nlm-mesh.d011385","title":"NLM MeSH Browser descriptor D011385","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011385"}],"status":"reported","summary":"NLM MeSH describes Projection as: A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011908","kind":"concept","label":"Rationalization","sources":[{"id":"nlm-mesh.d011908","title":"NLM MeSH Browser descriptor D011908","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011908"}],"status":"reported","summary":"NLM MeSH describes Rationalization as: A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012043","kind":"concept","label":"Regression, Psychology","sources":[{"id":"nlm-mesh.d012043","title":"NLM MeSH Browser descriptor D012043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012043"}],"status":"reported","summary":"NLM MeSH describes Regression, Psychology as: A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012094","kind":"concept","label":"Repression, Psychology","sources":[{"id":"nlm-mesh.d012094","title":"NLM MeSH Browser descriptor D012094","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012094"}],"status":"reported","summary":"NLM MeSH describes Repression, Psychology as: The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013359","kind":"concept","label":"Sublimation, Psychological","sources":[{"id":"nlm-mesh.d013359","title":"NLM MeSH Browser descriptor D013359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013359"}],"status":"reported","summary":"NLM MeSH describes Sublimation, Psychological as: A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000339","kind":"concept","label":"Affect","sources":[{"id":"nlm-mesh.d000339","title":"NLM MeSH Browser descriptor D000339","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000339"}],"status":"reported","summary":"NLM MeSH describes Affect as: The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000786","kind":"concept","label":"Anger","sources":[{"id":"nlm-mesh.d000786","title":"NLM MeSH Browser descriptor D000786","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000786"}],"status":"reported","summary":"NLM MeSH describes Anger as: A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001007","kind":"concept","label":"Anxiety","sources":[{"id":"nlm-mesh.d001007","title":"NLM MeSH Browser descriptor D001007","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001007"}],"status":"reported","summary":"NLM MeSH describes Anxiety as: Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with ANXIETY DISORDERS .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057565","kind":"concept","label":"Apathy","sources":[{"id":"nlm-mesh.d057565","title":"NLM MeSH Browser descriptor D057565","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057565"}],"status":"reported","summary":"NLM MeSH describes Apathy as: Lack of emotion or emotional expression; a disorder of motivation that persists over time.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001601","kind":"concept","label":"Bereavement","sources":[{"id":"nlm-mesh.d001601","title":"NLM MeSH Browser descriptor D001601","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001601"}],"status":"reported","summary":"NLM MeSH describes Bereavement as: Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001887","kind":"concept","label":"Boredom","sources":[{"id":"nlm-mesh.d001887","title":"NLM MeSH Browser descriptor D001887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001887"}],"status":"reported","summary":"NLM MeSH describes Boredom as: A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d066279","kind":"concept","label":"Courage","sources":[{"id":"nlm-mesh.d066279","title":"NLM MeSH Browser descriptor D066279","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066279"}],"status":"reported","summary":"NLM MeSH describes Courage as: State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003863","kind":"concept","label":"Depression","sources":[{"id":"nlm-mesh.d003863","title":"NLM MeSH Browser descriptor D003863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003863"}],"status":"reported","summary":"NLM MeSH describes Depression as: Depressive states usually of moderate intensity in contrast with MAJOR DEPRESSIVE DISORDER present in neurotic and psychotic disorders.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078382","kind":"concept","label":"Disgust","sources":[{"id":"nlm-mesh.d000078382","title":"NLM MeSH Browser descriptor D000078382","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078382"}],"status":"reported","summary":"NLM MeSH describes Disgust as: A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097815","kind":"concept","label":"Emotional Exhaustion","sources":[{"id":"nlm-mesh.d000097815","title":"NLM MeSH Browser descriptor D000097815","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097815"}],"status":"reported","summary":"NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026688","kind":"concept","label":"Bioethical Issues","sources":[{"id":"nlm-mesh.d026688","title":"NLM MeSH Browser descriptor D026688","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026688"}],"status":"reported","summary":"NLM MeSH describes Bioethical Issues as: Clusters of topics that fall within the domain of BIOETHICS , the field of study concerned with value questions that arise in biomedicine and health care delivery.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001675","kind":"field","label":"Bioethics","sources":[{"id":"nlm-mesh.d001675","title":"NLM MeSH Browser descriptor D001675","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001675"}],"status":"reported","summary":"NLM MeSH describes Bioethics as: A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d032781","kind":"field","label":"Codes of Ethics","sources":[{"id":"nlm-mesh.d032781","title":"NLM MeSH Browser descriptor D032781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032781"}],"status":"reported","summary":"NLM MeSH describes Codes of Ethics as: Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028661","kind":"concept","label":"Complicity","sources":[{"id":"nlm-mesh.d028661","title":"NLM MeSH Browser descriptor D028661","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028661"}],"status":"reported","summary":"NLM MeSH describes Complicity as: Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d016265","kind":"concept","label":"Conflict of Interest","sources":[{"id":"nlm-mesh.d016265","title":"NLM MeSH Browser descriptor D016265","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016265"}],"status":"reported","summary":"NLM MeSH describes Conflict of Interest as: A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d034723","kind":"concept","label":"Double Effect Principle","sources":[{"id":"nlm-mesh.d034723","title":"NLM MeSH Browser descriptor D034723","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034723"}],"status":"reported","summary":"NLM MeSH describes Double Effect Principle as: Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026689","kind":"concept","label":"Ethical Analysis","sources":[{"id":"nlm-mesh.d026689","title":"NLM MeSH Browser descriptor D026689","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026689"}],"status":"reported","summary":"NLM MeSH describes Ethical Analysis as: The use of systematic methods of ethical examination, such as CASUISTRY or ETHICAL THEORY , in reasoning about moral problems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028781","kind":"concept","label":"Ethical Relativism","sources":[{"id":"nlm-mesh.d028781","title":"NLM MeSH Browser descriptor D028781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028781"}],"status":"reported","summary":"NLM MeSH describes Ethical Relativism as: The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026724","kind":"concept","label":"Ethical Review","sources":[{"id":"nlm-mesh.d026724","title":"NLM MeSH Browser descriptor D026724","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026724"}],"status":"reported","summary":"NLM MeSH describes Ethical Review as: A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee ( CLINICAL ETHICS COMMITTEES or RESEARCH ETHICS COMMITTEES ), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist ( ETHICISTS ).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028663","kind":"concept","label":"Ethical Theory","sources":[{"id":"nlm-mesh.d028663","title":"NLM MeSH Browser descriptor D028663","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028663"}],"status":"reported","summary":"NLM MeSH describes Ethical Theory as: A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d040861","kind":"field","label":"Ethics, Business","sources":[{"id":"nlm-mesh.d040861","title":"NLM MeSH Browser descriptor D040861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040861"}],"status":"reported","summary":"NLM MeSH describes Ethics, Business as: The moral obligations governing the conduct of commercial or industrial enterprises.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004991","kind":"field","label":"Ethics, Institutional","sources":[{"id":"nlm-mesh.d004991","title":"NLM MeSH Browser descriptor D004991","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004991"}],"status":"reported","summary":"NLM MeSH describes Ethics, Institutional as: The moral and ethical obligations or responsibilities of institutions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004995","kind":"field","label":"Ethics, Professional","sources":[{"id":"nlm-mesh.d004995","title":"NLM MeSH Browser descriptor D004995","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004995"}],"status":"reported","summary":"NLM MeSH describes Ethics, Professional as: The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d032984","kind":"field","label":"Ethics, Research","sources":[{"id":"nlm-mesh.d032984","title":"NLM MeSH Browser descriptor D032984","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032984"}],"status":"reported","summary":"NLM MeSH describes Ethics, Research as: The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006808","kind":"concept","label":"Humanism","sources":[{"id":"nlm-mesh.d006808","title":"NLM MeSH Browser descriptor D006808","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006808"}],"status":"reported","summary":"NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000072577","kind":"concept","label":"Moral Status","sources":[{"id":"nlm-mesh.d000072577","title":"NLM MeSH Browser descriptor D000072577","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072577"}],"status":"reported","summary":"NLM MeSH describes Moral Status as: A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028723","kind":"concept","label":"Personhood","sources":[{"id":"nlm-mesh.d028723","title":"NLM MeSH Browser descriptor D028723","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028723"}],"status":"reported","summary":"NLM MeSH describes Personhood as: The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d028662","kind":"field","label":"Principle-Based Ethics","sources":[{"id":"nlm-mesh.d028662","title":"NLM MeSH Browser descriptor D028662","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028662"}],"status":"reported","summary":"NLM MeSH describes Principle-Based Ethics as: An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000073624","kind":"concept","label":"Symbolic Interactionism","sources":[{"id":"nlm-mesh.d000073624","title":"NLM MeSH Browser descriptor D000073624","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073624"}],"status":"reported","summary":"NLM MeSH describes Symbolic Interactionism as: Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d026690","kind":"field","label":"Ethics, Clinical","sources":[{"id":"nlm-mesh.d026690","title":"NLM MeSH Browser descriptor D026690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026690"}],"status":"reported","summary":"NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d032764","kind":"concept","label":"Casuistry","sources":[{"id":"nlm-mesh.d032764","title":"NLM MeSH Browser descriptor D032764","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032764"}],"status":"reported","summary":"NLM MeSH describes Casuistry as: A method of ETHICAL ANALYSIS that emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035481","kind":"concept","label":"Retrospective Moral Judgment","sources":[{"id":"nlm-mesh.d035481","title":"NLM MeSH Browser descriptor D035481","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035481"}],"status":"reported","summary":"NLM MeSH describes Retrospective Moral Judgment as: The application of current standards of morality to past actions, institutions, or persons.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035761","kind":"concept","label":"Wedge Argument","sources":[{"id":"nlm-mesh.d035761","title":"NLM MeSH Browser descriptor D035761","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035761"}],"status":"reported","summary":"NLM MeSH describes Wedge Argument as: An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033061","kind":"concept","label":"Ethics Consultation","sources":[{"id":"nlm-mesh.d033061","title":"NLM MeSH Browser descriptor D033061","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033061"}],"status":"reported","summary":"NLM MeSH describes Ethics Consultation as: Services provided by an individual ethicist ( ETHICISTS ) or an ethics team or committee ( ETHICS COMMITTEES, CLINICAL ) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000068616","kind":"concept","label":"Professionalism","sources":[{"id":"nlm-mesh.d000068616","title":"NLM MeSH Browser descriptor D000068616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000068616"}],"status":"reported","summary":"NLM MeSH describes Professionalism as: The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d057212","kind":"concept","label":"Therapeutic Equipoise","sources":[{"id":"nlm-mesh.d057212","title":"NLM MeSH Browser descriptor D057212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057212"}],"status":"reported","summary":"NLM MeSH describes Therapeutic Equipoise as: Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d055990","kind":"concept","label":"Therapeutic Misconception","sources":[{"id":"nlm-mesh.d055990","title":"NLM MeSH Browser descriptor D055990","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055990"}],"status":"reported","summary":"NLM MeSH describes Therapeutic Misconception as: Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019513","kind":"concept","label":"Feminism","sources":[{"id":"nlm-mesh.d019513","title":"NLM MeSH Browser descriptor D019513","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019513"}],"status":"reported","summary":"NLM MeSH describes Feminism as: The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026686","kind":"concept","label":"Beneficence","sources":[{"id":"nlm-mesh.d026686","title":"NLM MeSH Browser descriptor D026686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026686"}],"status":"reported","summary":"NLM MeSH describes Beneficence as: The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of BENEFICENCE requires producing net benefit over harm. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026684","kind":"concept","label":"Personal Autonomy","sources":[{"id":"nlm-mesh.d026684","title":"NLM MeSH Browser descriptor D026684","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026684"}],"status":"reported","summary":"NLM MeSH describes Personal Autonomy as: Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012935","kind":"concept","label":"Social Justice","sources":[{"id":"nlm-mesh.d012935","title":"NLM MeSH Browser descriptor D012935","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012935"}],"status":"reported","summary":"NLM MeSH describes Social Justice as: An interactive process whereby members of a community are concerned for the equality and rights of all.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000091383","kind":"concept","label":"Environmental Justice","sources":[{"id":"nlm-mesh.d000091383","title":"NLM MeSH Browser descriptor D000091383","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091383"}],"status":"reported","summary":"NLM MeSH describes Environmental Justice as: The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028681","kind":"concept","label":"Moral Obligations","sources":[{"id":"nlm-mesh.d028681","title":"NLM MeSH Browser descriptor D028681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028681"}],"status":"reported","summary":"NLM MeSH describes Moral Obligations as: Duties that are based in ETHICS , rather than in law.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000080105","kind":"concept","label":"Relational Autonomy","sources":[{"id":"nlm-mesh.d000080105","title":"NLM MeSH Browser descriptor D000080105","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080105"}],"status":"reported","summary":"NLM MeSH describes Relational Autonomy as: The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000095026","kind":"concept","label":"Antiracism","sources":[{"id":"nlm-mesh.d000095026","title":"NLM MeSH Browser descriptor D000095026","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095026"}],"status":"reported","summary":"NLM MeSH describes Antiracism as: Beliefs, actions or intentions, and policies that oppose RACISM or discrimination based on RACE .","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.101","kind":"concept","label":"Biological and physical processes","sources":[{"id":"usgs-thesaurus.101","title":"USGS Thesaurus term 101","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=101"}],"status":"reported","summary":"The USGS Thesaurus defines Biological and physical processes as: All continuing activities, functions, and phenomena associated with organisms and non-living matter. This category is also used for bioenergetic processes","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1304","kind":"concept","label":"Water properties","sources":[{"id":"usgs-thesaurus.1304","title":"USGS Thesaurus term 1304","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1304"}],"status":"reported","summary":"The USGS Thesaurus defines Water properties as: Measurable physical and chemical characteristics of water from different sources.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.777","kind":"concept","label":"Natural resources","sources":[{"id":"usgs-thesaurus.777","title":"USGS Thesaurus term 777","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=777"}],"status":"reported","summary":"The USGS Thesaurus defines Natural resources as: Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.63","kind":"concept","label":"Atmospheric and climatic processes","sources":[{"id":"usgs-thesaurus.63","title":"USGS Thesaurus term 63","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=63"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric and climatic processes as: Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions. This category is also used for climate , microclimate , weather , with field inventory and monitoring for weather monitoring , and with field inventory and monitoring for weather observations","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1799","kind":"concept","label":"Coastal processes","sources":[{"id":"usgs-thesaurus.1799","title":"USGS Thesaurus term 1799","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1799"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal processes as: Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation This category is also used with erosion for beach erosion , with erosion for coastal erosion , with hazards for coastal hazards , shoreline change , with erosion for shoreline erosion , and with erosion for shoreline retreat","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.310","kind":"concept","label":"Ecological processes","sources":[{"id":"usgs-thesaurus.310","title":"USGS Thesaurus term 310","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=310"}],"status":"reported","summary":"The USGS Thesaurus defines Ecological processes as: Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere. This category is also used for ecological models and environmental processes","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1800","kind":"concept","label":"Estuarine processes","sources":[{"id":"usgs-thesaurus.1800","title":"USGS Thesaurus term 1800","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1800"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine processes as: Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters This category is also used with sediment transport for estuarine sediment transport","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1702","kind":"concept","label":"Evolution","sources":[{"id":"usgs-thesaurus.1702","title":"USGS Thesaurus term 1702","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1702"}],"status":"reported","summary":"The USGS Thesaurus defines Evolution as: Change in the genetic composition of populations of living organisms. This category is also used for gene flow","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.384","kind":"concept","label":"Fires","sources":[{"id":"usgs-thesaurus.384","title":"USGS Thesaurus term 384","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=384"}],"status":"reported","summary":"The USGS Thesaurus defines Fires as: Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires. This category is also used with hazard preparedness for fire preparedness and fires (uncontrolled)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.435","kind":"concept","label":"Geochemical processes","sources":[{"id":"usgs-thesaurus.435","title":"USGS Thesaurus term 435","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=435"}],"status":"reported","summary":"The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.451","kind":"concept","label":"Geologic processes","sources":[{"id":"usgs-thesaurus.451","title":"USGS Thesaurus term 451","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=451"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic processes as: All types of processes involving geological structures. This category is also used for lithification","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2295","kind":"concept","label":"Hydrocarbon reservoir processes","sources":[{"id":"usgs-thesaurus.2295","title":"USGS Thesaurus term 2295","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2295"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrocarbon reservoir processes as: Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1718","kind":"concept","label":"Impact cratering","sources":[{"id":"usgs-thesaurus.1718","title":"USGS Thesaurus term 1718","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1718"}],"status":"reported","summary":"The USGS Thesaurus defines Impact cratering as: Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth. This category is also used for asteroid impact , bolide impact , comet impact , and meteor impact","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.816","kind":"concept","label":"Ocean processes","sources":[{"id":"usgs-thesaurus.816","title":"USGS Thesaurus term 816","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=816"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean processes as: Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans. This category is also used with sediment transport for marine sediment transport , with hazards for ocean hazards , and with ocean characteristics for oceans","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1347","kind":"concept","label":"Physiological processes","sources":[{"id":"usgs-thesaurus.1347","title":"USGS Thesaurus term 1347","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1347"}],"status":"reported","summary":"The USGS Thesaurus defines Physiological processes as: Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1682","kind":"concept","label":"Dissolved gases","sources":[{"id":"usgs-thesaurus.1682","title":"USGS Thesaurus term 1682","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1682"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved gases as: Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1999","kind":"concept","label":"Dissolved metals","sources":[{"id":"usgs-thesaurus.1999","title":"USGS Thesaurus term 1999","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1999"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved metals as: Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2000","kind":"concept","label":"Dissolved organic compounds","sources":[{"id":"usgs-thesaurus.2000","title":"USGS Thesaurus term 2000","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2000"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved organic compounds as: Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.806","kind":"concept","label":"Nutrient content (water)","sources":[{"id":"usgs-thesaurus.806","title":"USGS Thesaurus term 806","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=806"}],"status":"reported","summary":"The USGS Thesaurus defines Nutrient content (water) as: Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water. This category is also used for nitrogen content and phosphorus content","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.854","kind":"concept","label":"Oxygen content (water)","sources":[{"id":"usgs-thesaurus.854","title":"USGS Thesaurus term 854","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=854"}],"status":"reported","summary":"The USGS Thesaurus defines Oxygen content (water) as: Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body. This category is also used for anoxia , dissolved oxygen , and hypoxia","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1010","kind":"concept","label":"Salinity","sources":[{"id":"usgs-thesaurus.1010","title":"USGS Thesaurus term 1010","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1010"}],"status":"reported","summary":"The USGS Thesaurus defines Salinity as: Measure of the concentration of salts dissolved in a solution. This category is also used for chloride concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2080","kind":"concept","label":"Sound velocity","sources":[{"id":"usgs-thesaurus.2080","title":"USGS Thesaurus term 2080","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2080"}],"status":"reported","summary":"The USGS Thesaurus defines Sound velocity as: Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties. This category is also used with profiles for sound velocity profiles","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1129","kind":"concept","label":"Suspended material (water)","sources":[{"id":"usgs-thesaurus.1129","title":"USGS Thesaurus term 1129","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1129"}],"status":"reported","summary":"The USGS Thesaurus defines Suspended material (water) as: Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission. This category is also used for suspended sediment concentration and suspended-sediment concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2264","kind":"concept","label":"Water column reflectivity","sources":[{"id":"usgs-thesaurus.2264","title":"USGS Thesaurus term 2264","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2264"}],"status":"reported","summary":"The USGS Thesaurus defines Water column reflectivity as: A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles. This category is also used for backscatter (water column) , water column acoustic reflectivity , and water column optical reflectivity","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1301","kind":"concept","label":"Water hardness","sources":[{"id":"usgs-thesaurus.1301","title":"USGS Thesaurus term 1301","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1301"}],"status":"reported","summary":"The USGS Thesaurus defines Water hardness as: Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality. This category is also used for hardness (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1302","kind":"concept","label":"Water pH","sources":[{"id":"usgs-thesaurus.1302","title":"USGS Thesaurus term 1302","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1302"}],"status":"reported","summary":"The USGS Thesaurus defines Water pH as: The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral. This category is also used for pH (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1312","kind":"concept","label":"Water temperature","sources":[{"id":"usgs-thesaurus.1312","title":"USGS Thesaurus term 1312","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1312"}],"status":"reported","summary":"The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.799","kind":"concept","label":"Energy resources","sources":[{"id":"usgs-thesaurus.799","title":"USGS Thesaurus term 799","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=799"}],"status":"reported","summary":"The USGS Thesaurus defines Energy resources as: Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy. This category is also used for energy sources and fossil fuels","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.391","kind":"concept","label":"Fishery resources","sources":[{"id":"usgs-thesaurus.391","title":"USGS Thesaurus term 391","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=391"}],"status":"reported","summary":"The USGS Thesaurus defines Fishery resources as: The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.411","kind":"concept","label":"Forest resources","sources":[{"id":"usgs-thesaurus.411","title":"USGS Thesaurus term 411","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=411"}],"status":"reported","summary":"The USGS Thesaurus defines Forest resources as: Trees and associated vegetation available for human use. Use for timber and other forest resources with economic value. This category is also used for forestry","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.745","kind":"concept","label":"Mineral resources","sources":[{"id":"usgs-thesaurus.745","title":"USGS Thesaurus term 745","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=745"}],"status":"reported","summary":"The USGS Thesaurus defines Mineral resources as: Natural occurrences of useful inorganic elements or compounds.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1080","kind":"concept","label":"Soil resources","sources":[{"id":"usgs-thesaurus.1080","title":"USGS Thesaurus term 1080","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1080"}],"status":"reported","summary":"The USGS Thesaurus defines Soil resources as: Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth. This category is also used with contamination and pollution for soil pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1308","kind":"concept","label":"Water resources","sources":[{"id":"usgs-thesaurus.1308","title":"USGS Thesaurus term 1308","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1308"}],"status":"reported","summary":"The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.64","kind":"concept","label":"Atmospheric circulation","sources":[{"id":"usgs-thesaurus.64","title":"USGS Thesaurus term 64","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=64"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.66","kind":"concept","label":"Atmospheric deposition (chemical & particulate)","sources":[{"id":"usgs-thesaurus.66","title":"USGS Thesaurus term 66","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=66"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric deposition (chemical & particulate) as: The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles). This category is also used for atmospheric deposition (chemical and particulate) and atmospheric dust deposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.168","kind":"concept","label":"Climate change","sources":[{"id":"usgs-thesaurus.168","title":"USGS Thesaurus term 168","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=168"}],"status":"reported","summary":"The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.284","kind":"concept","label":"Droughts","sources":[{"id":"usgs-thesaurus.284","title":"USGS Thesaurus term 284","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=284"}],"status":"reported","summary":"The USGS Thesaurus defines Droughts as: Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man. This category is also used for drought","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1355","kind":"concept","label":"Evaporation","sources":[{"id":"usgs-thesaurus.1355","title":"USGS Thesaurus term 1355","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1355"}],"status":"reported","summary":"The USGS Thesaurus defines Evaporation as: Transfer of water from a surface into the atmosphere. This category is also used with transpiration for evapotranspiration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1704","kind":"concept","label":"Greenhouse effect","sources":[{"id":"usgs-thesaurus.1704","title":"USGS Thesaurus term 1704","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1704"}],"status":"reported","summary":"The USGS Thesaurus defines Greenhouse effect as: Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.823","kind":"concept","label":"Ocean-atmosphere interaction","sources":[{"id":"usgs-thesaurus.823","title":"USGS Thesaurus term 823","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=823"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean-atmosphere interaction as: Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans. This category is also used for El Nino and La Nina","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.927","kind":"concept","label":"Precipitation (atmospheric)","sources":[{"id":"usgs-thesaurus.927","title":"USGS Thesaurus term 927","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=927"}],"status":"reported","summary":"The USGS Thesaurus defines Precipitation (atmospheric) as: Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet. This category is also used with field inventory and monitoring for precipitation measurement , rain , rainfall , with field inventory and monitoring for rainfall measurement , snow , snowfall , and with field inventory and monitoring for snowfall measurement","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1102","kind":"concept","label":"Storms","sources":[{"id":"usgs-thesaurus.1102","title":"USGS Thesaurus term 1102","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1102"}],"status":"reported","summary":"The USGS Thesaurus defines Storms as: Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1690","kind":"concept","label":"Wind","sources":[{"id":"usgs-thesaurus.1690","title":"USGS Thesaurus term 1690","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1690"}],"status":"reported","summary":"The USGS Thesaurus defines Wind as: Local air movements. This category is also used with erosion for wind erosion","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2069","kind":"concept","label":"Barrier island migration","sources":[{"id":"usgs-thesaurus.2069","title":"USGS Thesaurus term 2069","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2069"}],"status":"reported","summary":"The USGS Thesaurus defines Barrier island migration as: The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2070","kind":"concept","label":"Coastal emergence","sources":[{"id":"usgs-thesaurus.2070","title":"USGS Thesaurus term 2070","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2070"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal emergence as: Relative uplift of the coast accompanied by seaward displacement of the shoreline. This category is also used for regression (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2071","kind":"concept","label":"Coastal submergence","sources":[{"id":"usgs-thesaurus.2071","title":"USGS Thesaurus term 2071","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2071"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal submergence as: Relative subsidence of the coast accompanied by landward displacement of the shoreline. This category is also used for transgression (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1801","kind":"concept","label":"Longshore currents","sources":[{"id":"usgs-thesaurus.1801","title":"USGS Thesaurus term 1801","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1801"}],"status":"reported","summary":"The USGS Thesaurus defines Longshore currents as: Movement of water parallel to the coast due to waves striking the shoreline at an angle This category is also used with sediment transport for littoral drift and with sediment transport for longshore drift","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2072","kind":"concept","label":"Shoreline accretion","sources":[{"id":"usgs-thesaurus.2072","title":"USGS Thesaurus term 2072","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2072"}],"status":"reported","summary":"The USGS Thesaurus defines Shoreline accretion as: Seaward migration of the shoreline resulting from the addition of earth materials.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2068","kind":"concept","label":"Tidal currents","sources":[{"id":"usgs-thesaurus.2068","title":"USGS Thesaurus term 2068","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2068"}],"status":"reported","summary":"The USGS Thesaurus defines Tidal currents as: Currents caused by tidal changes in water level from one body of water to another.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.30","kind":"concept","label":"Algal blooms","sources":[{"id":"usgs-thesaurus.30","title":"USGS Thesaurus term 30","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=30"}],"status":"reported","summary":"The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.88","kind":"concept","label":"Bioaccumulation","sources":[{"id":"usgs-thesaurus.88","title":"USGS Thesaurus term 88","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=88"}],"status":"reported","summary":"The USGS Thesaurus defines Bioaccumulation as: The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium. Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources. This category is also used for bioconcentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.93","kind":"concept","label":"Biogeochemical cycling","sources":[{"id":"usgs-thesaurus.93","title":"USGS Thesaurus term 93","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=93"}],"status":"reported","summary":"The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.108","kind":"concept","label":"Biological productivity","sources":[{"id":"usgs-thesaurus.108","title":"USGS Thesaurus term 108","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=108"}],"status":"reported","summary":"The USGS Thesaurus defines Biological productivity as: The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2277","kind":"concept","label":"Carbon flux","sources":[{"id":"usgs-thesaurus.2277","title":"USGS Thesaurus term 2277","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2277"}],"status":"reported","summary":"The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.196","kind":"concept","label":"Contaminant transport","sources":[{"id":"usgs-thesaurus.196","title":"USGS Thesaurus term 196","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=196"}],"status":"reported","summary":"The USGS Thesaurus defines Contaminant transport as: Processes involved in the movement of impurities through air, water, and soil.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.268","kind":"concept","label":"Dispersal (organisms)","sources":[{"id":"usgs-thesaurus.268","title":"USGS Thesaurus term 268","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=268"}],"status":"reported","summary":"The USGS Thesaurus defines Dispersal (organisms) as: The dissemination or geographic spread of individuals of a plant or animal population. This category is also used for colonization (organisms)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.308","kind":"concept","label":"Ecological competition","sources":[{"id":"usgs-thesaurus.308","title":"USGS Thesaurus term 308","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=308"}],"status":"reported","summary":"The USGS Thesaurus defines Ecological competition as: The struggle between members of two or more species for scarce environmental resources.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.315","kind":"concept","label":"Ecosystem functions","sources":[{"id":"usgs-thesaurus.315","title":"USGS Thesaurus term 315","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=315"}],"status":"reported","summary":"The USGS Thesaurus defines Ecosystem functions as: The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment. This category is also used with estuarine ecosystems for estuarine ecosystem functions","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2281","kind":"concept","label":"Ecosystem resilience","sources":[{"id":"usgs-thesaurus.2281","title":"USGS Thesaurus term 2281","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2281"}],"status":"reported","summary":"The USGS Thesaurus defines Ecosystem resilience as: Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973) This category is also used for ecological resilience","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.359","kind":"concept","label":"Eutrophication","sources":[{"id":"usgs-thesaurus.359","title":"USGS Thesaurus term 359","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=359"}],"status":"reported","summary":"The USGS Thesaurus defines Eutrophication as: The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.365","kind":"concept","label":"Extinction and extirpation","sources":[{"id":"usgs-thesaurus.365","title":"USGS Thesaurus term 365","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=365"}],"status":"reported","summary":"The USGS Thesaurus defines Extinction and extirpation as: Extinction is the complete disappearance of a species from the earth. Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area. This category is also used for extirpation","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.522","kind":"concept","label":"Habitat alteration and disturbance","sources":[{"id":"usgs-thesaurus.522","title":"USGS Thesaurus term 522","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=522"}],"status":"reported","summary":"The USGS Thesaurus defines Habitat alteration and disturbance as: Changes in the environments where plants and animals live. Includes natural changes as well as results of human actions, deliberate or accidental. This category is also used for ecological disturbance , environmental disturbance , habitat destruction , and habitat disturbance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.743","kind":"concept","label":"Migration (organisms)","sources":[{"id":"usgs-thesaurus.743","title":"USGS Thesaurus term 743","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=743"}],"status":"reported","summary":"The USGS Thesaurus defines Migration (organisms) as: The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions. This category is also used with invasive species for biological invasions , with biogeography for flyways , and seasonal migration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.915","kind":"concept","label":"Pollination","sources":[{"id":"usgs-thesaurus.915","title":"USGS Thesaurus term 915","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=915"}],"status":"reported","summary":"The USGS Thesaurus defines Pollination as: Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1123","kind":"concept","label":"Succession (biological)","sources":[{"id":"usgs-thesaurus.1123","title":"USGS Thesaurus term 1123","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1123"}],"status":"reported","summary":"The USGS Thesaurus defines Succession (biological) as: Gradual replacement of one species in an area by another. This category is also used for ecologic succession","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1356","kind":"concept","label":"Transpiration","sources":[{"id":"usgs-thesaurus.1356","title":"USGS Thesaurus term 1356","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1356"}],"status":"reported","summary":"The USGS Thesaurus defines Transpiration as: Evaporation of water from plants. This category is also used with evaporation for evapotranspiration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1802","kind":"concept","label":"Estuarine currents","sources":[{"id":"usgs-thesaurus.1802","title":"USGS Thesaurus term 1802","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1802"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine currents as: Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1803","kind":"concept","label":"Estuarine mixing","sources":[{"id":"usgs-thesaurus.1803","title":"USGS Thesaurus term 1803","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1803"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine mixing as: Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2305","kind":"concept","label":"Wildfires","sources":[{"id":"usgs-thesaurus.2305","title":"USGS Thesaurus term 2305","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2305"}],"status":"reported","summary":"The USGS Thesaurus defines Wildfires as: Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments. This category is also used for wildland fire","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1346","kind":"concept","label":"Biodegradation","sources":[{"id":"usgs-thesaurus.1346","title":"USGS Thesaurus term 1346","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1346"}],"status":"reported","summary":"The USGS Thesaurus defines Biodegradation as: Reduction in the concentration of harmful chemicals by the action of animals and plants. This category is also used for natural attenuation (harmful chemicals)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1731","kind":"concept","label":"Carbon sequestration","sources":[{"id":"usgs-thesaurus.1731","title":"USGS Thesaurus term 1731","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1731"}],"status":"reported","summary":"The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2058","kind":"concept","label":"Ocean acidification","sources":[{"id":"usgs-thesaurus.2058","title":"USGS Thesaurus term 2058","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2058"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean acidification as: Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1703","kind":"concept","label":"Ore formation","sources":[{"id":"usgs-thesaurus.1703","title":"USGS Thesaurus term 1703","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1703"}],"status":"reported","summary":"The USGS Thesaurus defines Ore formation as: Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials. Typically refers to metal ores. This category is also used for metallogenesis , metallogeny , and mineralization","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1708","kind":"concept","label":"Oxidation and reduction","sources":[{"id":"usgs-thesaurus.1708","title":"USGS Thesaurus term 1708","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1708"}],"status":"reported","summary":"The USGS Thesaurus defines Oxidation and reduction as: Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms. This category is also used for fermentation","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1711","kind":"concept","label":"Reaction transport","sources":[{"id":"usgs-thesaurus.1711","title":"USGS Thesaurus term 1711","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1711"}],"status":"reported","summary":"The USGS Thesaurus defines Reaction transport as: Chemical reactions occurring during ground-water flow.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1715","kind":"concept","label":"Sorption","sources":[{"id":"usgs-thesaurus.1715","title":"USGS Thesaurus term 1715","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1715"}],"status":"reported","summary":"The USGS Thesaurus defines Sorption as: Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption). This category is also used for absorption and adsorption","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2279","kind":"concept","label":"Thermal maturation","sources":[{"id":"usgs-thesaurus.2279","title":"USGS Thesaurus term 2279","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2279"}],"status":"reported","summary":"The USGS Thesaurus defines Thermal maturation as: Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum. This category is also used for thermal indices , thermal maturity , and vitrinite reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1699","kind":"concept","label":"Deformation (geologic)","sources":[{"id":"usgs-thesaurus.1699","title":"USGS Thesaurus term 1699","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1699"}],"status":"reported","summary":"The USGS Thesaurus defines Deformation (geologic) as: Change in form and structure of geologic materials in response to stress, typically heat and pressure. This category is also used for rheology and strain history","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.248","kind":"concept","label":"Diagenesis","sources":[{"id":"usgs-thesaurus.248","title":"USGS Thesaurus term 248","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=248"}],"status":"reported","summary":"The USGS Thesaurus defines Diagenesis as: Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1683","kind":"concept","label":"Earth tides","sources":[{"id":"usgs-thesaurus.1683","title":"USGS Thesaurus term 1683","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1683"}],"status":"reported","summary":"The USGS Thesaurus defines Earth tides as: Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters. Used in studies of volcanic activity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.304","kind":"concept","label":"Earthquakes","sources":[{"id":"usgs-thesaurus.304","title":"USGS Thesaurus term 304","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=304"}],"status":"reported","summary":"The USGS Thesaurus defines Earthquakes as: Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth. This category is also used with hazards for earthquake hazards","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.353","kind":"concept","label":"Erosion","sources":[{"id":"usgs-thesaurus.353","title":"USGS Thesaurus term 353","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=353"}],"status":"reported","summary":"The USGS Thesaurus defines Erosion as: The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another. This category is also used with coastal processes for beach erosion , with coastal processes for coastal erosion , dissolution , with coastal processes for shoreline erosion , with coastal processes for shoreline retreat , and with wind for wind erosion","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2282","kind":"concept","label":"Fluid migration","sources":[{"id":"usgs-thesaurus.2282","title":"USGS Thesaurus term 2282","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2282"}],"status":"reported","summary":"The USGS Thesaurus defines Fluid migration as: Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces. This category is also used for interstitial fluid and pore fluid","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.482","kind":"concept","label":"Glaciation","sources":[{"id":"usgs-thesaurus.482","title":"USGS Thesaurus term 482","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=482"}],"status":"reported","summary":"The USGS Thesaurus defines Glaciation as: The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.534","kind":"concept","label":"Heat flow (earth)","sources":[{"id":"usgs-thesaurus.534","title":"USGS Thesaurus term 534","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=534"}],"status":"reported","summary":"The USGS Thesaurus defines Heat flow (earth) as: Energy transferred by a difference in temperature through the surface of the earth. This category is also used for geothermics and heatflow (earth)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.562","kind":"concept","label":"Hydrothermal processes","sources":[{"id":"usgs-thesaurus.562","title":"USGS Thesaurus term 562","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=562"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.608","kind":"concept","label":"Isostasy","sources":[{"id":"usgs-thesaurus.608","title":"USGS Thesaurus term 608","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=608"}],"status":"reported","summary":"The USGS Thesaurus defines Isostasy as: Condition of equilibrium or buoyancy of the earth's crust above the mantle.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1721","kind":"concept","label":"Magnetic storms","sources":[{"id":"usgs-thesaurus.1721","title":"USGS Thesaurus term 1721","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1721"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetic storms as: A period of time during which the earth's magnetic field varies rapidly. During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation. This category is also used for geomagnetic storms","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.727","kind":"concept","label":"Metamorphism (geological)","sources":[{"id":"usgs-thesaurus.727","title":"USGS Thesaurus term 727","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=727"}],"status":"reported","summary":"The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1034","kind":"concept","label":"Sediment transport","sources":[{"id":"usgs-thesaurus.1034","title":"USGS Thesaurus term 1034","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1034"}],"status":"reported","summary":"The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1036","kind":"concept","label":"Sedimentation","sources":[{"id":"usgs-thesaurus.1036","title":"USGS Thesaurus term 1036","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1036"}],"status":"reported","summary":"The USGS Thesaurus defines Sedimentation as: Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials). The sediments settle out of water or air into layers on a surface. This category is also used for alluvial sedimentation , deposition (sediment) , and dust deposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1736","kind":"concept","label":"Slope processes","sources":[{"id":"usgs-thesaurus.1736","title":"USGS Thesaurus term 1736","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1736"}],"status":"reported","summary":"The USGS Thesaurus defines Slope processes as: The down slope movement of earth material under the influence of gravity. This category is also used for mass wasting and soil creep","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1710","kind":"concept","label":"Soil formation","sources":[{"id":"usgs-thesaurus.1710","title":"USGS Thesaurus term 1710","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1710"}],"status":"reported","summary":"The USGS Thesaurus defines Soil formation as: Geological, geochemical, and ecological processes that work together to produce soils. This category is also used for pedogenesis","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.624","kind":"concept","label":"Subsidence","sources":[{"id":"usgs-thesaurus.624","title":"USGS Thesaurus term 624","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=624"}],"status":"reported","summary":"The USGS Thesaurus defines Subsidence as: Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas. This category is also used for land subsidence and with maps and atlases for land subsidence maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1145","kind":"concept","label":"Tectonic processes","sources":[{"id":"usgs-thesaurus.1145","title":"USGS Thesaurus term 1145","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1145"}],"status":"reported","summary":"The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1751","kind":"concept","label":"Uplift","sources":[{"id":"usgs-thesaurus.1751","title":"USGS Thesaurus term 1751","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1751"}],"status":"reported","summary":"The USGS Thesaurus defines Uplift as: Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1286","kind":"concept","label":"Volcanic activity","sources":[{"id":"usgs-thesaurus.1286","title":"USGS Thesaurus term 1286","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1286"}],"status":"reported","summary":"The USGS Thesaurus defines Volcanic activity as: Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors. This category is also used for eruption , lava flows , pyroclastic flows , volcanic tremors , volcanism , and with field inventory and monitoring for volcano monitoring","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.398","kind":"concept","label":"Floods","sources":[{"id":"usgs-thesaurus.398","title":"USGS Thesaurus term 398","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=398"}],"status":"reported","summary":"The USGS Thesaurus defines Floods as: Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level. This category is also used for bankfull stage and with hazard preparedness for flood preparedness","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1692","kind":"concept","label":"Groundwater and surface-water interaction","sources":[{"id":"usgs-thesaurus.1692","title":"USGS Thesaurus term 1692","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1692"}],"status":"reported","summary":"The USGS Thesaurus defines Groundwater and surface-water interaction as: Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water. This category is also used for aquifer-surface water interaction , ground-water/surface-water interaction , groundwater/surface water interaction , hyporheic zone processes , surface water/groundwater interaction , and surface-water/ground-water interaction","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.514","kind":"concept","label":"Groundwater flow","sources":[{"id":"usgs-thesaurus.514","title":"USGS Thesaurus term 514","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=514"}],"status":"reported","summary":"The USGS Thesaurus defines Groundwater flow as: Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge. This category is also used for ground-water flow , groundwater flow modeling , and groundwater movement","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d004738","kind":"concept","label":"Engineering","sources":[{"id":"nlm-mesh.d004738","title":"NLM MeSH Browser descriptor D004738","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004738"}],"status":"reported","summary":"NLM MeSH describes Engineering as: The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013672","kind":"field","label":"Technology","sources":[{"id":"nlm-mesh.d013672","title":"NLM MeSH Browser descriptor D013672","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013672"}],"status":"reported","summary":"NLM MeSH describes Technology as: The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057005","kind":"concept","label":"Bioengineering","sources":[{"id":"nlm-mesh.d057005","title":"NLM MeSH Browser descriptor D057005","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057005"}],"status":"reported","summary":"NLM MeSH describes Bioengineering as: The application of engineering principles and methods to living organisms or biological systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001698","kind":"concept","label":"Biomedical Engineering","sources":[{"id":"nlm-mesh.d001698","title":"NLM MeSH Browser descriptor D001698","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001698"}],"status":"reported","summary":"NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d002616","kind":"concept","label":"Chemical Engineering","sources":[{"id":"nlm-mesh.d002616","title":"NLM MeSH Browser descriptor D002616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002616"}],"status":"reported","summary":"NLM MeSH describes Chemical Engineering as: Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d006804","kind":"field","label":"Ergonomics","sources":[{"id":"nlm-mesh.d006804","title":"NLM MeSH Browser descriptor D006804","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006804"}],"status":"reported","summary":"NLM MeSH describes Ergonomics as: The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055095","kind":"field","label":"Optics and Photonics","sources":[{"id":"nlm-mesh.d055095","title":"NLM MeSH Browser descriptor D055095","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055095"}],"status":"reported","summary":"NLM MeSH describes Optics and Photonics as: A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating ELECTROMAGNETIC RADIATION in the visible, infrared, and ultraviolet range.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058996","kind":"concept","label":"Quality Improvement","sources":[{"id":"nlm-mesh.d058996","title":"NLM MeSH Browser descriptor D058996","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058996"}],"status":"reported","summary":"NLM MeSH describes Quality Improvement as: The attainment or process of attaining a new level of performance or quality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d012498","kind":"concept","label":"Sanitary Engineering","sources":[{"id":"nlm-mesh.d012498","title":"NLM MeSH Browser descriptor D012498","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012498"}],"status":"reported","summary":"NLM MeSH describes Sanitary Engineering as: A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000067568","kind":"field","label":"Culturally Appropriate Technology","sources":[{"id":"nlm-mesh.d000067568","title":"NLM MeSH Browser descriptor D000067568","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067568"}],"status":"reported","summary":"NLM MeSH describes Culturally Appropriate Technology as: A SCIENCE or TECHNOLOGY that promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001331","kind":"concept","label":"Automation","sources":[{"id":"nlm-mesh.d001331","title":"NLM MeSH Browser descriptor D001331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001331"}],"status":"reported","summary":"NLM MeSH describes Automation as: Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000082222","kind":"field","label":"Digital Technology","sources":[{"id":"nlm-mesh.d000082222","title":"NLM MeSH Browser descriptor D000082222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000082222"}],"status":"reported","summary":"NLM MeSH describes Digital Technology as: The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000079203","kind":"field","label":"Disruptive Technology","sources":[{"id":"nlm-mesh.d000079203","title":"NLM MeSH Browser descriptor D000079203","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079203"}],"status":"reported","summary":"NLM MeSH describes Disruptive Technology as: A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d018961","kind":"field","label":"Educational Technology","sources":[{"id":"nlm-mesh.d018961","title":"NLM MeSH Browser descriptor D018961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018961"}],"status":"reported","summary":"NLM MeSH describes Educational Technology as: Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055772","kind":"field","label":"Green Chemistry Technology","sources":[{"id":"nlm-mesh.d055772","title":"NLM MeSH Browser descriptor D055772","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055772"}],"status":"reported","summary":"NLM MeSH describes Green Chemistry Technology as: Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000089862","kind":"field","label":"Haptic Technology","sources":[{"id":"nlm-mesh.d000089862","title":"NLM MeSH Browser descriptor D000089862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089862"}],"status":"reported","summary":"NLM MeSH describes Haptic Technology as: The study of the use of touch and KINESTHESIS in order to produce HAPTIC COMPUTER INTERFACES that will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d062069","kind":"concept","label":"Inventions","sources":[{"id":"nlm-mesh.d062069","title":"NLM MeSH Browser descriptor D062069","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062069"}],"status":"reported","summary":"NLM MeSH describes Inventions as: A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008328","kind":"concept","label":"Man-Machine Systems","sources":[{"id":"nlm-mesh.d008328","title":"NLM MeSH Browser descriptor D008328","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008328"}],"status":"reported","summary":"NLM MeSH describes Man-Machine Systems as: A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000074266","kind":"field","label":"Materials Science","sources":[{"id":"nlm-mesh.d000074266","title":"NLM MeSH Browser descriptor D000074266","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074266"}],"status":"reported","summary":"NLM MeSH describes Materials Science as: An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013677","kind":"field","label":"Medical Laboratory Science","sources":[{"id":"nlm-mesh.d013677","title":"NLM MeSH Browser descriptor D013677","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013677"}],"status":"reported","summary":"NLM MeSH describes Medical Laboratory Science as: The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008904","kind":"concept","label":"Miniaturization","sources":[{"id":"nlm-mesh.d008904","title":"NLM MeSH Browser descriptor D008904","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008904"}],"status":"reported","summary":"NLM MeSH describes Miniaturization as: The design or construction of objects greatly reduced in scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d066330","kind":"concept","label":"Printing, Three-Dimensional","sources":[{"id":"nlm-mesh.d066330","title":"NLM MeSH Browser descriptor D066330","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066330"}],"status":"reported","summary":"NLM MeSH describes Printing, Three-Dimensional as: Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d011786","kind":"concept","label":"Quality Control","sources":[{"id":"nlm-mesh.d011786","title":"NLM MeSH Browser descriptor D011786","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011786"}],"status":"reported","summary":"NLM MeSH describes Quality Control as: A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013674","kind":"field","label":"Technology, Dental","sources":[{"id":"nlm-mesh.d013674","title":"NLM MeSH Browser descriptor D013674","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013674"}],"status":"reported","summary":"NLM MeSH describes Technology, Dental as: The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013678","kind":"field","label":"Technology, Pharmaceutical","sources":[{"id":"nlm-mesh.d013678","title":"NLM MeSH Browser descriptor D013678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013678"}],"status":"reported","summary":"NLM MeSH describes Technology, Pharmaceutical as: The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013679","kind":"field","label":"Technology, Radiologic","sources":[{"id":"nlm-mesh.d013679","title":"NLM MeSH Browser descriptor D013679","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013679"}],"status":"reported","summary":"NLM MeSH describes Technology, Radiologic as: The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d018581","kind":"concept","label":"Technology Transfer","sources":[{"id":"nlm-mesh.d018581","title":"NLM MeSH Browser descriptor D018581","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018581"}],"status":"reported","summary":"NLM MeSH describes Technology Transfer as: Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d062028","kind":"concept","label":"Bioprinting","sources":[{"id":"nlm-mesh.d062028","title":"NLM MeSH Browser descriptor D062028","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062028"}],"status":"reported","summary":"NLM MeSH describes Bioprinting as: A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as MICROCHIP ANALYTICAL DEVICES , cell microarrays, or three dimensional anatomical structures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060846","kind":"concept","label":"Cell Engineering","sources":[{"id":"nlm-mesh.d060846","title":"NLM MeSH Browser descriptor D060846","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060846"}],"status":"reported","summary":"NLM MeSH describes Cell Engineering as: Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules ( METABOLIC ENGINEERING ), for generation of tissue structures and organs in vitro ( TISSUE ENGINEERING ), or for other BIOENGINEERING research objectives.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d058615","kind":"field","label":"Synthetic Biology","sources":[{"id":"nlm-mesh.d058615","title":"NLM MeSH Browser descriptor D058615","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058615"}],"status":"reported","summary":"NLM MeSH describes Synthetic Biology as: A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000084542","kind":"field","label":"Eye-Tracking Technology","sources":[{"id":"nlm-mesh.d000084542","title":"NLM MeSH Browser descriptor D000084542","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000084542"}],"status":"reported","summary":"NLM MeSH describes Eye-Tracking Technology as: Technology used for EYE MOVEMENT MEASUREMENTS , which capture and measure a persons EYE MOVEMENT and/or EYE GAZE","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014881","kind":"concept","label":"Water Supply","sources":[{"id":"nlm-mesh.d014881","title":"NLM MeSH Browser descriptor D014881","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014881"}],"status":"reported","summary":"NLM MeSH describes Water Supply as: Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000086825","kind":"concept","label":"User-Centered Design","sources":[{"id":"nlm-mesh.d000086825","title":"NLM MeSH Browser descriptor D000086825","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000086825"}],"status":"reported","summary":"NLM MeSH describes User-Centered Design as: Design process using input from users regarding systems, devices, or software.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057205","kind":"concept","label":"Automation, Laboratory","sources":[{"id":"nlm-mesh.d057205","title":"NLM MeSH Browser descriptor D057205","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057205"}],"status":"reported","summary":"NLM MeSH describes Automation, Laboratory as: Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000098451","kind":"concept","label":"Multiple-Instance Learning Algorithms","sources":[{"id":"nlm-mesh.d000098451","title":"NLM MeSH Browser descriptor D000098451","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098451"}],"status":"reported","summary":"NLM MeSH describes Multiple-Instance Learning Algorithms as: Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d012371","kind":"field","label":"Robotics","sources":[{"id":"nlm-mesh.d012371","title":"NLM MeSH Browser descriptor D012371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012371"}],"status":"reported","summary":"NLM MeSH describes Robotics as: The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d020811","kind":"field","label":"Biomedical Technology","sources":[{"id":"nlm-mesh.d020811","title":"NLM MeSH Browser descriptor D020811","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020811"}],"status":"reported","summary":"NLM MeSH describes Biomedical Technology as: The application of technology to the solution of medical problems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d032701","kind":"field","label":"Biomimetics","sources":[{"id":"nlm-mesh.d032701","title":"NLM MeSH Browser descriptor D032701","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032701"}],"status":"reported","summary":"NLM MeSH describes Biomimetics as: An interdisciplinary field in materials science, ENGINEERING , and BIOLOGY , studying the use of biological principles for synthesis or fabrication of BIOMIMETIC MATERIALS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d019149","kind":"concept","label":"Bioreactors","sources":[{"id":"nlm-mesh.d019149","title":"NLM MeSH Browser descriptor D019149","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019149"}],"status":"reported","summary":"NLM MeSH describes Bioreactors as: Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d007218","kind":"field","label":"Industrial Microbiology","sources":[{"id":"nlm-mesh.d007218","title":"NLM MeSH Browser descriptor D007218","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007218"}],"status":"reported","summary":"NLM MeSH describes Industrial Microbiology as: The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001296","kind":"concept","label":"Audiovisual Aids","sources":[{"id":"nlm-mesh.d001296","title":"NLM MeSH Browser descriptor D001296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001296"}],"status":"reported","summary":"NLM MeSH describes Audiovisual Aids as: Auditory and visual instructional materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000080048","kind":"field","label":"Hot Melt Extrusion Technology","sources":[{"id":"nlm-mesh.d000080048","title":"NLM MeSH Browser descriptor D000080048","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080048"}],"status":"reported","summary":"NLM MeSH describes Hot Melt Extrusion Technology as: Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an increase in the dissolution profile for the active pharmaceutical ingredients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055616","kind":"field","label":"Microtechnology","sources":[{"id":"nlm-mesh.d055616","title":"NLM MeSH Browser descriptor D055616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055616"}],"status":"reported","summary":"NLM MeSH describes Microtechnology as: Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or MEMS . The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000076227","kind":"field","label":"Stereolithography","sources":[{"id":"nlm-mesh.d000076227","title":"NLM MeSH Browser descriptor D000076227","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000076227"}],"status":"reported","summary":"NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d059021","kind":"concept","label":"Laboratory Proficiency Testing","sources":[{"id":"nlm-mesh.d059021","title":"NLM MeSH Browser descriptor D059021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059021"}],"status":"reported","summary":"NLM MeSH describes Laboratory Proficiency Testing as: Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060326","kind":"concept","label":"Chemistry Techniques, Synthetic","sources":[{"id":"nlm-mesh.d060326","title":"NLM MeSH Browser descriptor D060326","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060326"}],"status":"reported","summary":"NLM MeSH describes Chemistry Techniques, Synthetic as: Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058634","kind":"concept","label":"Molecular Farming","sources":[{"id":"nlm-mesh.d058634","title":"NLM MeSH Browser descriptor D058634","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058634"}],"status":"reported","summary":"NLM MeSH describes Molecular Farming as: The large scale production of pharmaceutically important and commercially valuable RECOMBINANT PROTEINS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060847","kind":"concept","label":"Metabolic Engineering","sources":[{"id":"nlm-mesh.d060847","title":"NLM MeSH Browser descriptor D060847","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060847"}],"status":"reported","summary":"NLM MeSH describes Metabolic Engineering as: Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as BIOREACTORS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060986","kind":"concept","label":"Water Wells","sources":[{"id":"nlm-mesh.d060986","title":"NLM MeSH Browser descriptor D060986","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060986"}],"status":"reported","summary":"NLM MeSH describes Water Wells as: Constructions built to access underground water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000098402","kind":"concept","label":"Autonomous Robots","sources":[{"id":"nlm-mesh.d000098402","title":"NLM MeSH Browser descriptor D000098402","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098402"}],"status":"reported","summary":"NLM MeSH describes Autonomous Robots as: Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d065287","kind":"concept","label":"Robotic Surgical Procedures","sources":[{"id":"nlm-mesh.d065287","title":"NLM MeSH Browser descriptor D065287","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065287"}],"status":"reported","summary":"NLM MeSH describes Robotic Surgical Procedures as: Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d024803","kind":"concept","label":"Biomedical Enhancement","sources":[{"id":"nlm-mesh.d024803","title":"NLM MeSH Browser descriptor D024803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D024803"}],"status":"reported","summary":"NLM MeSH describes Biomedical Enhancement as: The use of technology-based interventions to improve functional capacities rather than to treat disease.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d050997","kind":"concept","label":"Nanomedicine","sources":[{"id":"nlm-mesh.d050997","title":"NLM MeSH Browser descriptor D050997","url":"https://meshb.nlm.nih.gov/record/ui?ui=D050997"}],"status":"reported","summary":"NLM MeSH describes Nanomedicine as: The branch of medicine concerned with the application of NANOTECHNOLOGY to the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and NANOSTRUCTURES . (From Freitas Jr., Nanomedicine, vol 1, 1999).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058433","kind":"concept","label":"Photobioreactors","sources":[{"id":"nlm-mesh.d058433","title":"NLM MeSH Browser descriptor D058433","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058433"}],"status":"reported","summary":"NLM MeSH describes Photobioreactors as: Devices for generating biological products that use light as the energy source. They are used for controlled BIOMASS production such as growing cyanobacteria, mosses, or algae.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001878","kind":"concept","label":"Books, Illustrated","sources":[{"id":"nlm-mesh.d001878","title":"NLM MeSH Browser descriptor D001878","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001878"}],"status":"reported","summary":"NLM MeSH describes Books, Illustrated as: Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008961","kind":"concept","label":"Models, Structural","sources":[{"id":"nlm-mesh.d008961","title":"NLM MeSH Browser descriptor D008961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008961"}],"status":"reported","summary":"NLM MeSH describes Models, Structural as: A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d009040","kind":"concept","label":"Motion Pictures","sources":[{"id":"nlm-mesh.d009040","title":"NLM MeSH Browser descriptor D009040","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009040"}],"status":"reported","summary":"NLM MeSH describes Motion Pictures as: The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d019212","kind":"concept","label":"Multimedia","sources":[{"id":"nlm-mesh.d019212","title":"NLM MeSH Browser descriptor D019212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019212"}],"status":"reported","summary":"NLM MeSH describes Multimedia as: Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d016249","kind":"concept","label":"Optical Storage Devices","sources":[{"id":"nlm-mesh.d016249","title":"NLM MeSH Browser descriptor D016249","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016249"}],"status":"reported","summary":"NLM MeSH describes Optical Storage Devices as: A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d011845","kind":"concept","label":"Radio","sources":[{"id":"nlm-mesh.d011845","title":"NLM MeSH Browser descriptor D011845","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011845"}],"status":"reported","summary":"NLM MeSH describes Radio as: The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000087983","kind":"concept","label":"Sound Recordings","sources":[{"id":"nlm-mesh.d000087983","title":"NLM MeSH Browser descriptor D000087983","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000087983"}],"status":"reported","summary":"NLM MeSH describes Sound Recordings as: The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d013637","kind":"concept","label":"Tape Recording","sources":[{"id":"nlm-mesh.d013637","title":"NLM MeSH Browser descriptor D013637","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013637"}],"status":"reported","summary":"NLM MeSH describes Tape Recording as: Recording of information on magnetic or punched paper tape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d013690","kind":"concept","label":"Television","sources":[{"id":"nlm-mesh.d013690","title":"NLM MeSH Browser descriptor D013690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013690"}],"status":"reported","summary":"NLM MeSH describes Television as: The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d044085","kind":"field","label":"Microfluidics","sources":[{"id":"nlm-mesh.d044085","title":"NLM MeSH Browser descriptor D044085","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044085"}],"status":"reported","summary":"NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057930","kind":"concept","label":"Click Chemistry","sources":[{"id":"nlm-mesh.d057930","title":"NLM MeSH Browser descriptor D057930","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057930"}],"status":"reported","summary":"NLM MeSH describes Click Chemistry as: Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with COMBINATORIAL CHEMISTRY TECHNIQUES , it is used for the synthesis of new compounds and combinatorial libraries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d020650","kind":"concept","label":"Combinatorial Chemistry Techniques","sources":[{"id":"nlm-mesh.d020650","title":"NLM MeSH Browser descriptor D020650","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020650"}],"status":"reported","summary":"NLM MeSH describes Combinatorial Chemistry Techniques as: A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d061565","kind":"concept","label":"Cycloaddition Reaction","sources":[{"id":"nlm-mesh.d061565","title":"NLM MeSH Browser descriptor D061565","url":"https://meshb.nlm.nih.gov/record/ui?ui=D061565"}],"status":"reported","summary":"NLM MeSH describes Cycloaddition Reaction as: Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d054802","kind":"concept","label":"Molecular Imprinting","sources":[{"id":"nlm-mesh.d054802","title":"NLM MeSH Browser descriptor D054802","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054802"}],"status":"reported","summary":"NLM MeSH describes Molecular Imprinting as: A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for MOLECULARLY IMPRINTED POLYMERS (MIPs) include separations, assays and biosensors, and catalysis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060327","kind":"concept","label":"Solid-Phase Synthesis Techniques","sources":[{"id":"nlm-mesh.d060327","title":"NLM MeSH Browser descriptor D060327","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060327"}],"status":"reported","summary":"NLM MeSH describes Solid-Phase Synthesis Techniques as: Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d024861","kind":"concept","label":"Genetic Enhancement","sources":[{"id":"nlm-mesh.d024861","title":"NLM MeSH Browser descriptor D024861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D024861"}],"status":"reported","summary":"NLM MeSH describes Genetic Enhancement as: The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008953","kind":"concept","label":"Models, Anatomic","sources":[{"id":"nlm-mesh.d008953","title":"NLM MeSH Browser descriptor D008953","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008953"}],"status":"reported","summary":"NLM MeSH describes Models, Anatomic as: Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014742","kind":"concept","label":"Videodisc Recording","sources":[{"id":"nlm-mesh.d014742","title":"NLM MeSH Browser descriptor D014742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014742"}],"status":"reported","summary":"NLM MeSH describes Videodisc Recording as: The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014743","kind":"concept","label":"Videotape Recording","sources":[{"id":"nlm-mesh.d014743","title":"NLM MeSH Browser descriptor D014743","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014743"}],"status":"reported","summary":"NLM MeSH describes Videotape Recording as: Recording of visual and sometimes sound signals on magnetic tape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d018715","kind":"concept","label":"Microscopy, Video","sources":[{"id":"nlm-mesh.d018715","title":"NLM MeSH Browser descriptor D018715","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018715"}],"status":"reported","summary":"NLM MeSH describes Microscopy, Video as: Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in TELEPATHOLOGY .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d052156","kind":"concept","label":"SELEX Aptamer Technique","sources":[{"id":"nlm-mesh.d052156","title":"NLM MeSH Browser descriptor D052156","url":"https://meshb.nlm.nih.gov/record/ui?ui=D052156"}],"status":"reported","summary":"NLM MeSH describes SELEX Aptamer Technique as: A method of generating a large library of randomized nucleotides and selecting NUCLEOTIDE APTAMERS by iterative rounds of in vitro selection. A modified procedure substitutes AMINO ACIDS in place of NUCLEOTIDES to make PEPTIDE APTAMERS .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d015984","kind":"concept","label":"Causality","sources":[{"id":"nlm-mesh.d015984","title":"NLM MeSH Browser descriptor D015984","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015984"}],"status":"reported","summary":"NLM MeSH describes Causality as: The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012107","kind":"concept","label":"Research Design","sources":[{"id":"nlm-mesh.d012107","title":"NLM MeSH Browser descriptor D012107","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012107"}],"status":"reported","summary":"NLM MeSH describes Research Design as: A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d012586","kind":"field","label":"Science","sources":[{"id":"nlm-mesh.d012586","title":"NLM MeSH Browser descriptor D012586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012586"}],"status":"reported","summary":"NLM MeSH describes Science as: The study of natural phenomena by observation, measurement, and experimentation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d015985","kind":"concept","label":"Precipitating Factors","sources":[{"id":"nlm-mesh.d015985","title":"NLM MeSH Browser descriptor D015985","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015985"}],"status":"reported","summary":"NLM MeSH describes Precipitating Factors as: Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d065840","kind":"concept","label":"Protective Factors","sources":[{"id":"nlm-mesh.d065840","title":"NLM MeSH Browser descriptor D065840","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065840"}],"status":"reported","summary":"NLM MeSH describes Protective Factors as: An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012307","kind":"concept","label":"Risk Factors","sources":[{"id":"nlm-mesh.d012307","title":"NLM MeSH Browser descriptor D012307","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012307"}],"status":"reported","summary":"NLM MeSH describes Risk Factors as: An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035061","kind":"concept","label":"Control Groups","sources":[{"id":"nlm-mesh.d035061","title":"NLM MeSH Browser descriptor D035061","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035061"}],"status":"reported","summary":"NLM MeSH describes Control Groups as: Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d004311","kind":"concept","label":"Double-Blind Method","sources":[{"id":"nlm-mesh.d004311","title":"NLM MeSH Browser descriptor D004311","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004311"}],"status":"reported","summary":"NLM MeSH describes Double-Blind Method as: A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d011897","kind":"concept","label":"Random Allocation","sources":[{"id":"nlm-mesh.d011897","title":"NLM MeSH Browser descriptor D011897","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011897"}],"status":"reported","summary":"NLM MeSH describes Random Allocation as: A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d018401","kind":"concept","label":"Sample Size","sources":[{"id":"nlm-mesh.d018401","title":"NLM MeSH Browser descriptor D018401","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018401"}],"status":"reported","summary":"NLM MeSH describes Sample Size as: The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012106","kind":"concept","label":"Research","sources":[{"id":"nlm-mesh.d012106","title":"NLM MeSH Browser descriptor D012106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012106"}],"status":"reported","summary":"NLM MeSH describes Research as: Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d018511","kind":"concept","label":"Systems Integration","sources":[{"id":"nlm-mesh.d018511","title":"NLM MeSH Browser descriptor D018511","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018511"}],"status":"reported","summary":"NLM MeSH describes Systems Integration as: The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d013598","kind":"concept","label":"Systems Theory","sources":[{"id":"nlm-mesh.d013598","title":"NLM MeSH Browser descriptor D013598","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013598"}],"status":"reported","summary":"NLM MeSH describes Systems Theory as: Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000092003","kind":"concept","label":"Artificial Life","sources":[{"id":"nlm-mesh.d000092003","title":"NLM MeSH Browser descriptor D000092003","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092003"}],"status":"reported","summary":"NLM MeSH describes Artificial Life as: Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035841","kind":"concept","label":"Behavioral Research","sources":[{"id":"nlm-mesh.d035841","title":"NLM MeSH Browser descriptor D035841","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035841"}],"status":"reported","summary":"NLM MeSH describes Behavioral Research as: Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035843","kind":"concept","label":"Biomedical Research","sources":[{"id":"nlm-mesh.d035843","title":"NLM MeSH Browser descriptor D035843","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035843"}],"status":"reported","summary":"NLM MeSH describes Biomedical Research as: Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d055812","kind":"concept","label":"Community-Based Participatory Research","sources":[{"id":"nlm-mesh.d055812","title":"NLM MeSH Browser descriptor D055812","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055812"}],"status":"reported","summary":"NLM MeSH describes Community-Based Participatory Research as: Collaborative process of research involving researchers and community representatives.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036262","kind":"concept","label":"Empirical Research","sources":[{"id":"nlm-mesh.d036262","title":"NLM MeSH Browser descriptor D036262","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036262"}],"status":"reported","summary":"NLM MeSH describes Empirical Research as: The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000094505","kind":"concept","label":"Evidence Gaps","sources":[{"id":"nlm-mesh.d000094505","title":"NLM MeSH Browser descriptor D000094505","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000094505"}],"status":"reported","summary":"NLM MeSH describes Evidence Gaps as: Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000075762","kind":"concept","label":"Interdisciplinary Research","sources":[{"id":"nlm-mesh.d000075762","title":"NLM MeSH Browser descriptor D000075762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075762"}],"status":"reported","summary":"NLM MeSH describes Interdisciplinary Research as: Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d063369","kind":"concept","label":"Knowledge Discovery","sources":[{"id":"nlm-mesh.d063369","title":"NLM MeSH Browser descriptor D063369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063369"}],"status":"reported","summary":"NLM MeSH describes Knowledge Discovery as: A process that searches for hidden and important connections among information or results.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d009874","kind":"concept","label":"Operations Research","sources":[{"id":"nlm-mesh.d009874","title":"NLM MeSH Browser descriptor D009874","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009874"}],"status":"reported","summary":"NLM MeSH describes Operations Research as: A group of techniques developed to apply scientific methods and tools to solve the problems of DECISION MAKING in complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting GOALS and makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d017712","kind":"concept","label":"Peer Review, Research","sources":[{"id":"nlm-mesh.d017712","title":"NLM MeSH Browser descriptor D017712","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017712"}],"status":"reported","summary":"NLM MeSH describes Peer Review, Research as: The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000075082","kind":"concept","label":"Proof of Concept Study","sources":[{"id":"nlm-mesh.d000075082","title":"NLM MeSH Browser descriptor D000075082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075082"}],"status":"reported","summary":"NLM MeSH describes Proof of Concept Study as: An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d058028","kind":"concept","label":"Research Report","sources":[{"id":"nlm-mesh.d058028","title":"NLM MeSH Browser descriptor D058028","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058028"}],"status":"reported","summary":"NLM MeSH describes Research Report as: Detailed account or statement or formal record of data resulting from empirical inquiry.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d063586","kind":"concept","label":"Social Validity, Research","sources":[{"id":"nlm-mesh.d063586","title":"NLM MeSH Browser descriptor D063586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063586"}],"status":"reported","summary":"NLM MeSH describes Social Validity, Research as: Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d000066949","kind":"field","label":"Biobehavioral Sciences","sources":[{"id":"nlm-mesh.d000066949","title":"NLM MeSH Browser descriptor D000066949","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066949"}],"status":"reported","summary":"NLM MeSH describes Biobehavioral Sciences as: An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d033041","kind":"concept","label":"Embryo Research","sources":[{"id":"nlm-mesh.d033041","title":"NLM MeSH Browser descriptor D033041","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033041"}],"status":"reported","summary":"NLM MeSH describes Embryo Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d033042","kind":"concept","label":"Fetal Research","sources":[{"id":"nlm-mesh.d033042","title":"NLM MeSH Browser descriptor D033042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033042"}],"status":"reported","summary":"NLM MeSH describes Fetal Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036281","kind":"concept","label":"Genetic Research","sources":[{"id":"nlm-mesh.d036281","title":"NLM MeSH Browser descriptor D036281","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036281"}],"status":"reported","summary":"NLM MeSH describes Genetic Research as: Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d006302","kind":"concept","label":"Health Services Research","sources":[{"id":"nlm-mesh.d006302","title":"NLM MeSH Browser descriptor D006302","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006302"}],"status":"reported","summary":"NLM MeSH describes Health Services Research as: The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d006805","kind":"concept","label":"Human Experimentation","sources":[{"id":"nlm-mesh.d006805","title":"NLM MeSH Browser descriptor D006805","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006805"}],"status":"reported","summary":"NLM MeSH describes Human Experimentation as: The use of humans as investigational subjects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d017063","kind":"concept","label":"Outcome Assessment, Health Care","sources":[{"id":"nlm-mesh.d017063","title":"NLM MeSH Browser descriptor D017063","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017063"}],"status":"reported","summary":"NLM MeSH describes Outcome Assessment, Health Care as: Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000071220","kind":"concept","label":"Pharmaceutical Research","sources":[{"id":"nlm-mesh.d000071220","title":"NLM MeSH Browser descriptor D000071220","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000071220"}],"status":"reported","summary":"NLM MeSH describes Pharmaceutical Research as: RESEARCH activity focused on pharmaceutical products and services.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000070838","kind":"concept","label":"Pharmacy Research","sources":[{"id":"nlm-mesh.d000070838","title":"NLM MeSH Browser descriptor D000070838","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070838"}],"status":"reported","summary":"NLM MeSH describes Pharmacy Research as: RESEARCH activity focused on PHARMACY .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000066768","kind":"concept","label":"Rehabilitation Research","sources":[{"id":"nlm-mesh.d000066768","title":"NLM MeSH Browser descriptor D000066768","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066768"}],"status":"reported","summary":"NLM MeSH describes Rehabilitation Research as: Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of REHABILITATION .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d057905","kind":"concept","label":"Stem Cell Research","sources":[{"id":"nlm-mesh.d057905","title":"NLM MeSH Browser descriptor D057905","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057905"}],"status":"reported","summary":"NLM MeSH describes Stem Cell Research as: Experimentation on STEM CELLS and on the use of stem cells.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d057170","kind":"concept","label":"Translational Research, Biomedical","sources":[{"id":"nlm-mesh.d057170","title":"NLM MeSH Browser descriptor D057170","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057170"}],"status":"reported","summary":"NLM MeSH describes Translational Research, Biomedical as: The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d000080029","kind":"field","label":"Citizen Science","sources":[{"id":"nlm-mesh.d000080029","title":"NLM MeSH Browser descriptor D000080029","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080029"}],"status":"reported","summary":"NLM MeSH describes Citizen Science as: Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d066296","kind":"concept","label":"Grounded Theory","sources":[{"id":"nlm-mesh.d066296","title":"NLM MeSH Browser descriptor D066296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066296"}],"status":"reported","summary":"NLM MeSH describes Grounded Theory as: The generation of theories from analysis of empirical data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036301","kind":"concept","label":"Qualitative Research","sources":[{"id":"nlm-mesh.d036301","title":"NLM MeSH Browser descriptor D036301","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036301"}],"status":"reported","summary":"NLM MeSH describes Qualitative Research as: Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.mesh.d008433","kind":"field","label":"Mathematics","sources":[{"id":"nlm-mesh.d008433","title":"NLM MeSH Browser descriptor D008433","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008433"}],"status":"reported","summary":"NLM MeSH describes Mathematics as: The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d011336","kind":"concept","label":"Probability","sources":[{"id":"nlm-mesh.d011336","title":"NLM MeSH Browser descriptor D011336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011336"}],"status":"reported","summary":"NLM MeSH describes Probability as: The study of chance processes or the relative frequency characterizing a chance process.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d015233","kind":"concept","label":"Models, Statistical","sources":[{"id":"nlm-mesh.d015233","title":"NLM MeSH Browser descriptor D015233","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015233"}],"status":"reported","summary":"NLM MeSH describes Models, Statistical as: Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000078332","kind":"concept","label":"Data Analysis","sources":[{"id":"nlm-mesh.d000078332","title":"NLM MeSH Browser descriptor D000078332","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078332"}],"status":"reported","summary":"NLM MeSH describes Data Analysis as: Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.mesh.d017711","kind":"field","label":"Nonlinear Dynamics","sources":[{"id":"nlm-mesh.d017711","title":"NLM MeSH Browser descriptor D017711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017711"}],"status":"reported","summary":"NLM MeSH describes Nonlinear Dynamics as: The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal ( FRACTALS ) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d001499","kind":"concept","label":"Bayes Theorem","sources":[{"id":"nlm-mesh.d001499","title":"NLM MeSH Browser descriptor D001499","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001499"}],"status":"reported","summary":"NLM MeSH describes Bayes Theorem as: A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016013","kind":"concept","label":"Likelihood Functions","sources":[{"id":"nlm-mesh.d016013","title":"NLM MeSH Browser descriptor D016013","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016013"}],"status":"reported","summary":"NLM MeSH describes Likelihood Functions as: Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d012306","kind":"concept","label":"Risk","sources":[{"id":"nlm-mesh.d012306","title":"NLM MeSH Browser descriptor D012306","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012306"}],"status":"reported","summary":"NLM MeSH describes Risk as: The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d035501","kind":"concept","label":"Uncertainty","sources":[{"id":"nlm-mesh.d035501","title":"NLM MeSH Browser descriptor D035501","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035501"}],"status":"reported","summary":"NLM MeSH describes Uncertainty as: The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016014","kind":"concept","label":"Linear Models","sources":[{"id":"nlm-mesh.d016014","title":"NLM MeSH Browser descriptor D016014","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016014"}],"status":"reported","summary":"NLM MeSH describes Linear Models as: Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016015","kind":"concept","label":"Logistic Models","sources":[{"id":"nlm-mesh.d016015","title":"NLM MeSH Browser descriptor D016015","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016015"}],"status":"reported","summary":"NLM MeSH describes Logistic Models as: Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000073276","kind":"concept","label":"Models, Spatial Interaction","sources":[{"id":"nlm-mesh.d000073276","title":"NLM MeSH Browser descriptor D000073276","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073276"}],"status":"reported","summary":"NLM MeSH describes Models, Spatial Interaction as: Estimates of the flow of people, material or information between locations in geographic space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098446","kind":"concept","label":"Autoencoder","sources":[{"id":"nlm-mesh.d000098446","title":"NLM MeSH Browser descriptor D000098446","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098446"}],"status":"reported","summary":"NLM MeSH describes Autoencoder as: An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images, DIMENSIONALITY REDUCTION and feature extraction.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098428","kind":"concept","label":"Backtracking Algorithms","sources":[{"id":"nlm-mesh.d000098428","title":"NLM MeSH Browser descriptor D000098428","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098428"}],"status":"reported","summary":"NLM MeSH describes Backtracking Algorithms as: A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098404","kind":"concept","label":"Boosting Machine Learning Algorithms","sources":[{"id":"nlm-mesh.d000098404","title":"NLM MeSH Browser descriptor D000098404","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098404"}],"status":"reported","summary":"NLM MeSH describes Boosting Machine Learning Algorithms as: A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098430","kind":"concept","label":"Clustering Algorithms","sources":[{"id":"nlm-mesh.d000098430","title":"NLM MeSH Browser descriptor D000098430","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098430"}],"status":"reported","summary":"NLM MeSH describes Clustering Algorithms as: Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098431","kind":"concept","label":"Compression Algorithms","sources":[{"id":"nlm-mesh.d000098431","title":"NLM MeSH Browser descriptor D000098431","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098431"}],"status":"reported","summary":"NLM MeSH describes Compression Algorithms as: A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098432","kind":"concept","label":"Detection Algorithms","sources":[{"id":"nlm-mesh.d000098432","title":"NLM MeSH Browser descriptor D000098432","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098432"}],"status":"reported","summary":"NLM MeSH describes Detection Algorithms as: Algorithms designed to find or localize the objects in images and assign the objects (affordances).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098405","kind":"concept","label":"Dimensionality Reduction","sources":[{"id":"nlm-mesh.d000098405","title":"NLM MeSH Browser descriptor D000098405","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098405"}],"status":"reported","summary":"NLM MeSH describes Dimensionality Reduction as: A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098434","kind":"concept","label":"Genetic Algorithms","sources":[{"id":"nlm-mesh.d000098434","title":"NLM MeSH Browser descriptor D000098434","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098434"}],"status":"reported","summary":"NLM MeSH describes Genetic Algorithms as: Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by NATURAL SELECTION . They are commonly used to generate solutions for optimization problems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000077272","kind":"concept","label":"Latent Class Analysis","sources":[{"id":"nlm-mesh.d000077272","title":"NLM MeSH Browser descriptor D000077272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077272"}],"status":"reported","summary":"NLM MeSH describes Latent Class Analysis as: A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098435","kind":"concept","label":"Machine Learning Algorithms","sources":[{"id":"nlm-mesh.d000098435","title":"NLM MeSH Browser descriptor D000098435","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098435"}],"status":"reported","summary":"NLM MeSH describes Machine Learning Algorithms as: A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098436","kind":"concept","label":"Parallel Algorithms","sources":[{"id":"nlm-mesh.d000098436","title":"NLM MeSH Browser descriptor D000098436","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098436"}],"status":"reported","summary":"NLM MeSH describes Parallel Algorithms as: Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098413","kind":"concept","label":"Particle Swarm Optimization","sources":[{"id":"nlm-mesh.d000098413","title":"NLM MeSH Browser descriptor D000098413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098413"}],"status":"reported","summary":"NLM MeSH describes Particle Swarm Optimization as: A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098437","kind":"concept","label":"Prediction Algorithms","sources":[{"id":"nlm-mesh.d000098437","title":"NLM MeSH Browser descriptor D000098437","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098437"}],"status":"reported","summary":"NLM MeSH describes Prediction Algorithms as: A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000089682","kind":"concept","label":"Cellular Automata","sources":[{"id":"nlm-mesh.d000089682","title":"NLM MeSH Browser descriptor D000089682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089682"}],"status":"reported","summary":"NLM MeSH describes Cellular Automata as: Space-oriented dynamic modeling ALGORITHMS acting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000078331","kind":"concept","label":"Correlation of Data","sources":[{"id":"nlm-mesh.d000078331","title":"NLM MeSH Browser descriptor D000078331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078331"}],"status":"reported","summary":"NLM MeSH describes Correlation of Data as: Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098403","kind":"concept","label":"Intelligent Systems","sources":[{"id":"nlm-mesh.d000098403","title":"NLM MeSH Browser descriptor D000098403","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098403"}],"status":"reported","summary":"NLM MeSH describes Intelligent Systems as: Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069550","kind":"concept","label":"Machine Learning","sources":[{"id":"nlm-mesh.d000069550","title":"NLM MeSH Browser descriptor D000069550","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069550"}],"status":"reported","summary":"NLM MeSH describes Machine Learning as: A type of ARTIFICIAL INTELLIGENCE that enable COMPUTERS to independently initiate and execute LEARNING when exposed to new data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098414","kind":"concept","label":"Pattern Analysis, Machine","sources":[{"id":"nlm-mesh.d000098414","title":"NLM MeSH Browser descriptor D000098414","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098414"}],"status":"reported","summary":"NLM MeSH describes Pattern Analysis, Machine as: The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098411","kind":"concept","label":"Prediction Methods, Machine","sources":[{"id":"nlm-mesh.d000098411","title":"NLM MeSH Browser descriptor D000098411","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098411"}],"status":"reported","summary":"NLM MeSH describes Prediction Methods, Machine as: Methods of making prediction about a new measurement based on calculations of previous data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000090042","kind":"concept","label":"Sentiment Analysis","sources":[{"id":"nlm-mesh.d000090042","title":"NLM MeSH Browser descriptor D000090042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090042"}],"status":"reported","summary":"NLM MeSH describes Sentiment Analysis as: A data mining technique in which subjective information such as sentiments, OPINIONS , and attitudes are extracted and analyzed from data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d058011","kind":"concept","label":"Multifactor Dimensionality Reduction","sources":[{"id":"nlm-mesh.d058011","title":"NLM MeSH Browser descriptor D058011","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058011"}],"status":"reported","summary":"NLM MeSH describes Multifactor Dimensionality Reduction as: A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098426","kind":"concept","label":"Adaptive Algorithms","sources":[{"id":"nlm-mesh.d000098426","title":"NLM MeSH Browser descriptor D000098426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098426"}],"status":"reported","summary":"NLM MeSH describes Adaptive Algorithms as: Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098429","kind":"concept","label":"Classification Algorithms","sources":[{"id":"nlm-mesh.d000098429","title":"NLM MeSH Browser descriptor D000098429","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098429"}],"status":"reported","summary":"NLM MeSH describes Classification Algorithms as: A class of algorithms that predicts into which category an observation belongs based on training data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098427","kind":"concept","label":"Generative Adversarial Networks","sources":[{"id":"nlm-mesh.d000098427","title":"NLM MeSH Browser descriptor D000098427","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098427"}],"status":"reported","summary":"NLM MeSH describes Generative Adversarial Networks as: An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000073931","kind":"concept","label":"Adverse Outcome Pathways","sources":[{"id":"nlm-mesh.d000073931","title":"NLM MeSH Browser descriptor D000073931","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073931"}],"status":"reported","summary":"NLM MeSH describes Adverse Outcome Pathways as: Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000067495","kind":"concept","label":"Healthcare Failure Mode and Effect Analysis","sources":[{"id":"nlm-mesh.d000067495","title":"NLM MeSH Browser descriptor D000067495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067495"}],"status":"reported","summary":"NLM MeSH describes Healthcare Failure Mode and Effect Analysis as: Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000096442","kind":"concept","label":"Genetic Risk Score","sources":[{"id":"nlm-mesh.d000096442","title":"NLM MeSH Browser descriptor D000096442","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096442"}],"status":"reported","summary":"NLM MeSH describes Genetic Risk Score as: Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000082742","kind":"concept","label":"Heart Disease Risk Factors","sources":[{"id":"nlm-mesh.d000082742","title":"NLM MeSH Browser descriptor D000082742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000082742"}],"status":"reported","summary":"NLM MeSH describes Heart Disease Risk Factors as: Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with HEART DISEASES .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000077321","kind":"concept","label":"Deep Learning","sources":[{"id":"nlm-mesh.d000077321","title":"NLM MeSH Browser descriptor D000077321","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077321"}],"status":"reported","summary":"NLM MeSH describes Deep Learning as: Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific ALGORITHMS , to build and train neural network models.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098406","kind":"concept","label":"Ensemble Learning","sources":[{"id":"nlm-mesh.d000098406","title":"NLM MeSH Browser descriptor D000098406","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098406"}],"status":"reported","summary":"NLM MeSH describes Ensemble Learning as: A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098407","kind":"concept","label":"Federated Learning","sources":[{"id":"nlm-mesh.d000098407","title":"NLM MeSH Browser descriptor D000098407","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098407"}],"status":"reported","summary":"NLM MeSH describes Federated Learning as: A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098408","kind":"concept","label":"Reinforcement Machine Learning","sources":[{"id":"nlm-mesh.d000098408","title":"NLM MeSH Browser descriptor D000098408","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098408"}],"status":"reported","summary":"NLM MeSH describes Reinforcement Machine Learning as: A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098409","kind":"concept","label":"Representation Machine Learning","sources":[{"id":"nlm-mesh.d000098409","title":"NLM MeSH Browser descriptor D000098409","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098409"}],"status":"reported","summary":"NLM MeSH describes Representation Machine Learning as: A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069553","kind":"concept","label":"Supervised Machine Learning","sources":[{"id":"nlm-mesh.d000069553","title":"NLM MeSH Browser descriptor D000069553","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069553"}],"status":"reported","summary":"NLM MeSH describes Supervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098410","kind":"concept","label":"Transfer Machine Learning","sources":[{"id":"nlm-mesh.d000098410","title":"NLM MeSH Browser descriptor D000098410","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098410"}],"status":"reported","summary":"NLM MeSH describes Transfer Machine Learning as: Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069558","kind":"concept","label":"Unsupervised Machine Learning","sources":[{"id":"nlm-mesh.d000069558","title":"NLM MeSH Browser descriptor D000069558","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069558"}],"status":"reported","summary":"NLM MeSH describes Unsupervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098412","kind":"concept","label":"Predictive Learning Models","sources":[{"id":"nlm-mesh.d000098412","title":"NLM MeSH Browser descriptor D000098412","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098412"}],"status":"reported","summary":"NLM MeSH describes Predictive Learning Models as: Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000083202","kind":"concept","label":"Cardiometabolic Risk Factors","sources":[{"id":"nlm-mesh.d000083202","title":"NLM MeSH Browser descriptor D000083202","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000083202"}],"status":"reported","summary":"NLM MeSH describes Cardiometabolic Risk Factors as: A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence, is known to be associated with CARDIOVASCULAR DISEASES and TYPE 2 DIABETES MELLITUS .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000094408","kind":"concept","label":"Obesity Paradox","sources":[{"id":"nlm-mesh.d000094408","title":"NLM MeSH Browser descriptor D000094408","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000094408"}],"status":"reported","summary":"NLM MeSH describes Obesity Paradox as: An observation that high BODY MASS INDEX is sometimes associated with lower CARDIOVASCULAR DISEASE mortality in certain population, e.g., ELDERLY .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098342","kind":"concept","label":"Large Language Models","sources":[{"id":"nlm-mesh.d000098342","title":"NLM MeSH Browser descriptor D000098342","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098342"}],"status":"reported","summary":"NLM MeSH describes Large Language Models as: Computational designs that apply DEEP LEARNING methods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d060388","kind":"concept","label":"Support Vector Machine","sources":[{"id":"nlm-mesh.d060388","title":"NLM MeSH Browser descriptor D060388","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060388"}],"status":"reported","summary":"NLM MeSH describes Support Vector Machine as: SUPERVISED MACHINE LEARNING algorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.adjustable-speed-drives","kind":"concept","label":"Adjustable speed drives","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Adjustable speed drives as: Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.adjusted-electricity","kind":"concept","label":"Adjusted electricity","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Adjusted electricity as: A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.aftermarket-converted-vehicle","kind":"concept","label":"Aftermarket converted vehicle","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Aftermarket converted vehicle as: A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.agglomerating-character","kind":"concept","label":"Agglomerating character","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Agglomerating character as: Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-cleaner","kind":"concept","label":"Air cleaner","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air cleaner as: A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-collector","kind":"concept","label":"Air collector","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-conditioning","kind":"concept","label":"Air conditioning","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air conditioning as: Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-pollution-abatement-equipment","kind":"concept","label":"Air pollution abatement equipment","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air pollution abatement equipment as: Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alkylation","kind":"concept","label":"Alkylation","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alkylation as: A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alternating-current-ac","kind":"concept","label":"Alternating current (AC)","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alternating current (AC) as: An electric current that reverses its direction at regularly recurring intervals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alternative-fuel-vehicle-afv","kind":"concept","label":"Alternative fuel vehicle (AFV)","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alternative fuel vehicle (AFV) as: A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.amorphous-silicon","kind":"concept","label":"Amorphous silicon","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Amorphous silicon as: An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ampere","kind":"concept","label":"Ampere","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ampere as: The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.apparent-power","kind":"concept","label":"Apparent power","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Apparent power as: The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power. It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA). See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.appliance","kind":"concept","label":"Appliance","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Appliance as: A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.asphalt","kind":"concept","label":"Asphalt","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Asphalt as: A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.atmospheric-crude-oil-distillation","kind":"concept","label":"Atmospheric crude oil distillation","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Atmospheric crude oil distillation as: The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.auger-mine","kind":"concept","label":"Auger mine","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Auger mine as: A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.automatic-set-back-or-clock-thermostat","kind":"concept","label":"Automatic set-back or clock thermostat","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Automatic set-back or clock thermostat as: A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.auxiliary-generator","kind":"concept","label":"Auxiliary generator","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Auxiliary generator as: A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.azimuth-angle","kind":"concept","label":"Azimuth angle","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Azimuth angle as: The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.backup-fuel","kind":"concept","label":"Backup fuel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Backup fuel as: In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.backup-power","kind":"concept","label":"Backup power","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Backup power as: Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrel","kind":"concept","label":"Barrel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrel as: A unit of volume equal to 42 U.S. gallons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrels-per-calendar-day","kind":"concept","label":"Barrels per calendar day","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrels per calendar day as: The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrels-per-stream-day","kind":"concept","label":"Barrels per stream day","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrels per stream day as: The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.base-load-capacity","kind":"concept","label":"Base load capacity","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Base load capacity as: The generating equipment normally operated to serve loads on an around-the-clock basis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.baseboard-heater","kind":"concept","label":"Baseboard heater","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Baseboard heater as: As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.battery-electric-vehicle-bev","kind":"concept","label":"Battery electric vehicle (BEV)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Battery electric vehicle (BEV) as: An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bi-fuel-vehicle","kind":"concept","label":"Bi-fuel vehicle","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bi-fuel vehicle as: A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bituminous-coal","kind":"concept","label":"Bituminous coal","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bituminous coal as: A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.black-liquor","kind":"concept","label":"Black liquor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Black liquor as: A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blast-furnace","kind":"concept","label":"Blast furnace","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blast furnace as: A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blast-furnace-gas","kind":"concept","label":"Blast-furnace gas","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blast-furnace gas as: The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blending-plant","kind":"concept","label":"Blending plant","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blending plant as: A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiler","kind":"concept","label":"Boiler","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiler as: A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiler-fuel","kind":"concept","label":"Boiler fuel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiler fuel as: An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiling-water-reactor-bwr","kind":"concept","label":"Boiling-water reactor (BWR)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiling-water reactor (BWR) as: A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottled-gas-lpg-or-propane","kind":"concept","label":"Bottled gas, LPG, or propane","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottled gas, LPG, or propane as: Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottom-ash","kind":"concept","label":"Bottom ash","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottom ash as: Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottoming-cycle","kind":"concept","label":"Bottoming cycle","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottoming cycle as: A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.breeder-reactor","kind":"concept","label":"Breeder reactor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Breeder reactor as: A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.british-thermal-unit","kind":"concept","label":"British thermal unit","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines British thermal unit as: The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.btu-conversion-factor","kind":"concept","label":"Btu conversion factor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Btu conversion factor as: A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.built-in-electric-units","kind":"concept","label":"Built-in electric units","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Built-in electric units as: An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bulk-station","kind":"concept","label":"Bulk station","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bulk station as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bulk-terminal","kind":"concept","label":"Bulk terminal","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bulk terminal as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bundled-utility-service-electric","kind":"concept","label":"Bundled utility service (electric)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bundled utility service (electric) as: A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.burnup","kind":"concept","label":"Burnup","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Burnup as: Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bus","kind":"concept","label":"Bus","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bus as: An electrical conductor that serves as a common connection for two or more electrical circuits.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.calcination","kind":"concept","label":"Calcination","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Calcination as: A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.calcium-sulfite","kind":"concept","label":"Calcium sulfite","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Calcium sulfite as: A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.canadian-deuterium-uranium-reactor-candu","kind":"concept","label":"Canadian deuterium uranium reactor (CANDU)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Canadian deuterium uranium reactor (CANDU) as: Uses heavy water or deuterium oxide (D","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.capacity-purchased","kind":"concept","label":"Capacity (purchased)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Capacity (purchased) as: The amount of energy and capacity available for purchase from outside the system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.carbon-intensity","kind":"concept","label":"Carbon intensity","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Carbon intensity as: The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.carburetor","kind":"concept","label":"Carburetor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Carburetor as: A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.casinghead-gas-or-oil-well-gas","kind":"concept","label":"Casinghead gas (or oil well gas)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Casinghead gas (or oil well gas) as: Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cast-silicon","kind":"concept","label":"Cast silicon","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cast silicon as: Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-converter","kind":"concept","label":"Catalytic converter","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic converter as: A device containing a catalyst for converting automobile exhaust into mostly harmless products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-cracking","kind":"concept","label":"Catalytic cracking","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-hydrotreating","kind":"concept","label":"Catalytic hydrotreating","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic hydrotreating as: A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cells-to-oem-non-pv","kind":"concept","label":"Cells to OEM (non-PV)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cells to OEM (non-PV) as: Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-chiller","kind":"concept","label":"Central chiller","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central chiller as: Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-cooling","kind":"concept","label":"Central cooling","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central cooling as: Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-physical-plant","kind":"concept","label":"Central physical plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central physical plant as: A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-warm-air-furnace","kind":"concept","label":"Central warm air furnace","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central warm air furnace as: A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.centralized-water-heating-system","kind":"concept","label":"Centralized water heating system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Centralized water heating system as: Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.chemical-separation","kind":"concept","label":"Chemical separation","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Chemical separation as: A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.christmas-tree","kind":"concept","label":"Christmas tree","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Christmas tree as: The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.circuit-mile","kind":"concept","label":"Circuit-mile","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Circuit-mile as: The total length in miles of separate circuits regardless of the number of conductors used per circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.clinker","kind":"concept","label":"Clinker","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Clinker as: Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal","kind":"concept","label":"Coal","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal as: A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-blending","kind":"concept","label":"Coal Blending","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal Blending as: The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-briquets","kind":"concept","label":"Coal briquets","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal briquets as: Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-gasification","kind":"concept","label":"Coal gasification","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal gasification as: The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-liquefaction","kind":"concept","label":"Coal liquefaction","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal liquefaction as: A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-mine","kind":"concept","label":"Coal mine","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-synfuel","kind":"concept","label":"Coal synfuel","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal synfuel as: Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coalbed-methane-well-gas","kind":"concept","label":"Coalbed Methane Well Gas","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coalbed Methane Well Gas as: Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cofiring","kind":"concept","label":"Cofiring","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cofiring as: The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cogeneration-system","kind":"concept","label":"Cogeneration system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cogeneration system as: A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-coal","kind":"concept","label":"Coke (coal)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke (coal) as: A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-battery","kind":"concept","label":"Coke Battery","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke Battery as: A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-oven","kind":"concept","label":"Coke Oven","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke Oven as: A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar. The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke. Coke is primarily used in steel production. There are two types of coke ovens: (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles. During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-cycle","kind":"concept","label":"Combined cycle","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined cycle as: An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-cycle-unit","kind":"concept","label":"Combined cycle unit","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined cycle unit as: An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-hydroelectric-plant","kind":"concept","label":"Combined hydroelectric plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined hydroelectric plant as: A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-pumped-storage-plant","kind":"concept","label":"Combined pumped-storage plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined pumped-storage plant as: A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-heat-and-power-chp-plant","kind":"concept","label":"Combined-heat-and-power (CHP) plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined-heat-and-power (CHP) plant as: A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combustion-chamber","kind":"concept","label":"Combustion chamber","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combustion chamber as: An enclosed vessel in which chemical oxidation of fuel occurs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.commercial-facility","kind":"concept","label":"Commercial facility","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Commercial facility as: An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.commercial-operation-nuclear","kind":"concept","label":"Commercial operation (nuclear)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Commercial operation (nuclear) as: The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.completion-oil-gas-production","kind":"concept","label":"Completion (oil/gas production)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Completion (oil/gas production) as: The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.compressor-station","kind":"concept","label":"Compressor station","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Compressor station as: Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.concentrating-solar-power-or-solar-thermal-power-system","kind":"concept","label":"Concentrating solar power or solar thermal power system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Concentrating solar power or solar thermal power system as: A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.concentrator","kind":"concept","label":"Concentrator","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Concentrator as: A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.condenser-cooling-water","kind":"concept","label":"Condenser cooling water","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Condenser cooling water as: A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conductor","kind":"concept","label":"Conductor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conductor as: Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.construction-pipeline-of-a-nuclear-reactor","kind":"concept","label":"Construction pipeline (of a nuclear reactor)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Construction pipeline (of a nuclear reactor) as: The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.construction-work-in-progress-cwip","kind":"concept","label":"Construction work in progress (CWIP)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Construction work in progress (CWIP) as: The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.continuous-mining","kind":"concept","label":"Continuous mining","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Continuous mining as: A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","kind":"concept","label":"Conventional blendstock for oxygenate blending (CBOB)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional blendstock for oxygenate blending (CBOB) as: Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-fuel-ethanol","kind":"concept","label":"Conventional fuel ethanol","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional fuel ethanol as: Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-gasoline","kind":"concept","label":"Conventional gasoline","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional gasoline as: Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-hydroelectric-plant","kind":"concept","label":"Conventional hydroelectric plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional hydroelectric plant as: A plant in which all of the power is produced from natural streamflow as regulated by available storage.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-mill-uranium","kind":"concept","label":"Conventional mill (uranium)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional mill (uranium) as: A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-oil-and-natural-gas-production","kind":"concept","label":"Conventional oil and natural gas production","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional oil and natural gas production as: Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conversion-factor","kind":"concept","label":"Conversion factor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conversion factor as: A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons). (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.converted-alternative-fuel-vehicle","kind":"concept","label":"Converted (alternative-fuel) vehicle","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Converted (alternative-fuel) vehicle as: A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cooling-system","kind":"concept","label":"Cooling system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cooling system as: An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-input","kind":"concept","label":"Crude oil input","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil input as: The total crude oil put into processing units at refineries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-qualities","kind":"concept","label":"Crude oil qualities","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil qualities as: Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-refinery-input","kind":"concept","label":"Crude oil refinery input","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil refinery input as: The total crude oil put into processing units at refineries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.current-electric","kind":"concept","label":"Current (electric)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Current (electric) as: A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cycle-reactor-history","kind":"concept","label":"Cycle/reactor history","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cycle/reactor history as: A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.daylighting-controls","kind":"concept","label":"Daylighting controls","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Daylighting controls as: A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.decontamination","kind":"concept","label":"Decontamination","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Decontamination as: Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dedicated-vehicle","kind":"concept","label":"Dedicated vehicle","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dedicated vehicle as: A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.deepest-total-depth","kind":"concept","label":"Deepest total depth","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Deepest total depth as: The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.degasification-system","kind":"concept","label":"Degasification system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Degasification system as: The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.delayed-coking","kind":"concept","label":"Delayed coking","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Delayed coking as: A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.deliveries-electric","kind":"concept","label":"Deliveries (electric)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Deliveries (electric) as: Energy generated by one system and delivered to another system through one or more transmission lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.denaturant","kind":"concept","label":"Denaturant","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Denaturant as: Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption. Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant. See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.denatured","kind":"concept","label":"Denatured","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Denatured as: Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dependable-capacity","kind":"concept","label":"Dependable capacity","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dependable capacity as: The load-carrying ability of a station or system under adverse conditions for a specified period of time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.depleted-storage-field","kind":"concept","label":"Depleted storage field","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Depleted storage field as: A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.depth-of-deepest-production","kind":"concept","label":"Depth of deepest production","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Depth of deepest production as: The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.design-electrical-rating-capacity-net","kind":"concept","label":"Design electrical rating (capacity) net","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Design electrical rating (capacity) net as: The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.design-head","kind":"concept","label":"Design head","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Design head as: The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.development-well","kind":"concept","label":"Development well","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Development well as: A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-fuel","kind":"concept","label":"Diesel fuel","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel fuel as: A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-fuel-system","kind":"concept","label":"Diesel fuel system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel fuel system as: Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-electric-plant","kind":"concept","label":"Diesel-electric plant","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel-electric plant as: A generating station that uses diesel engines to drive its electric generators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diffusive-transport","kind":"concept","label":"Diffusive transport","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diffusive transport as: The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.direct-electricity-load-control","kind":"concept","label":"Direct electricity load control","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Direct electricity load control as: The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.direct-load-control","kind":"concept","label":"Direct load control","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Direct load control as: This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.directional-deviated-well","kind":"concept","label":"Directional (deviated) well","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Directional (deviated) well as: A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.discharged-fuel","kind":"concept","label":"Discharged fuel","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Discharged fuel as: Irradiated fuel removed from a nuclear reactor during refueling. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distillate-fuel-oil","kind":"concept","label":"Distillate fuel oil","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distillate fuel oil as: A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distillation-unit-atmospheric","kind":"concept","label":"Distillation unit (atmospheric)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distillation unit (atmospheric) as: The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distributed-generator","kind":"concept","label":"Distributed generator","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distributed generator as: A generator that is located close to the particular load that it is intended to serve. General, but non-exclusive, characteristics of these generators include: an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distributed-point-of-use-water-heating-system","kind":"concept","label":"Distributed/point-of-use water-heating system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distributed/point-of-use water-heating system as: A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distribution-system","kind":"concept","label":"Distribution system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distribution system as: The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-chilled-water","kind":"concept","label":"District chilled water","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District chilled water as: Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-energy","kind":"concept","label":"District energy","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District energy as: Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-heat","kind":"concept","label":"District heat","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District heat as: Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.double-circuit-line","kind":"concept","label":"Double circuit line","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Double circuit line as: A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dry-bottom-boiler","kind":"concept","label":"Dry bottom boiler","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dry bottom boiler as: No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dry-hole","kind":"concept","label":"Dry hole","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dry hole as: An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fuel-vehicle-1","kind":"concept","label":"Dual fuel vehicle (1)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (1) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fuel-vehicle-2","kind":"concept","label":"Dual fuel vehicle (2)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (2) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fired-unit","kind":"concept","label":"Dual-fired unit","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual-fired unit as: A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dump-energy","kind":"concept","label":"Dump energy","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dump energy as: Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-energy","kind":"concept","label":"Electric energy","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-plant-physical","kind":"concept","label":"Electric plant (physical)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric plant (physical) as: A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-power-plant","kind":"concept","label":"Electric power plant","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric power plant as: A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-pump-for-well-water","kind":"concept","label":"Electric pump for well water","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric pump for well water as: This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-system-loss","kind":"concept","label":"Electric system loss","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric system loss as: Total energy loss from all causes for an electric utility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-system-reliability","kind":"concept","label":"Electric system reliability","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric system reliability as: The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-vehicle-ev","kind":"concept","label":"Electric vehicle (EV)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric vehicle (EV) as: A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-zone","kind":"concept","label":"Electric zone","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric zone as: A portion of the grid controlled by the independent system operator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electrical-system-energy-losses","kind":"concept","label":"Electrical system energy losses","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electrical system energy losses as: The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electricity-generation","kind":"concept","label":"Electricity generation","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electricity generation as: The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electricity-only-plant","kind":"concept","label":"Electricity-only plant","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electricity-only plant as: A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.elution","kind":"concept","label":"Elution","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Elution as: The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.emissions-coefficient","kind":"concept","label":"Emissions coefficient","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Emissions coefficient as: A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-consumption","kind":"concept","label":"Energy consumption","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-deliveries","kind":"concept","label":"Energy deliveries","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy deliveries as: Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-management-and-control-system-emcs","kind":"concept","label":"Energy management and control system(EMCS)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy management and control system(EMCS) as: An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.engine-size","kind":"concept","label":"Engine size","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Engine size as: The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.enrichment-tails-assay","kind":"concept","label":"Enrichment tails assay","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Enrichment tails assay as: A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.environmental-restoration","kind":"concept","label":"Environmental restoration","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Environmental restoration as: Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.epa-certification","kind":"concept","label":"EPA certification","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines EPA certification as: A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.equilibrium-cycle","kind":"concept","label":"Equilibrium cycle","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Equilibrium cycle as: An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.evacuated-tube-collector","kind":"concept","label":"Evacuated-tube collector","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Evacuated-tube collector as: A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.evaporative-cooler-swamp-cooler","kind":"concept","label":"Evaporative cooler (swamp cooler)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Evaporative cooler (swamp cooler) as: An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.exploratory-well","kind":"concept","label":"Exploratory well","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Exploratory well as: A hole drilled a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.extraction-loss","kind":"concept","label":"Extraction loss","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Extraction loss as: The extraction of gas plant liquids constituents such as","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fast-breeder-reactor-fbr","kind":"concept","label":"Fast breeder reactor (FBR)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fast breeder reactor (FBR) as: A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fission","kind":"concept","label":"Fission","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fission as: The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fixed-carbon","kind":"concept","label":"Fixed carbon","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fixed carbon as: The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flat-plate-pumped","kind":"concept","label":"Flat plate pumped","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flat plate pumped as: A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium predominant use is in water-heating applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.floating-storage-regasification-unit-fsru","kind":"concept","label":"Floating Storage Regasification Unit (FSRU)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Floating Storage Regasification Unit (FSRU) as: A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.floor-wall-or-pipeless-furnace","kind":"concept","label":"Floor, wall, or pipeless furnace","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Floor, wall, or pipeless furnace as: Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-desulfurization","kind":"concept","label":"Flue gas desulfurization","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue gas desulfurization as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-desulfurization-unit-scrubber","kind":"concept","label":"Flue-gas desulfurization unit (scrubber)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue-gas desulfurization unit (scrubber) as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-particulate-collector","kind":"concept","label":"Flue-gas particulate collector","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue-gas particulate collector as: Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fluid-catalytic-cracking","kind":"concept","label":"Fluid catalytic cracking","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fluid catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fluid-coking","kind":"concept","label":"Fluid coking","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fluid coking as: A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fly-ash","kind":"concept","label":"Fly ash","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fly ash as: Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.forced-outage","kind":"concept","label":"Forced outage","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Forced outage as: The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fossil-fuel-plant","kind":"concept","label":"Fossil fuel plant","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fossil fuel plant as: A plant using coal, petroleum, or gas as its source of energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fossil-fuel-steam-electric-power-plant","kind":"concept","label":"Fossil fuel steam-electric power plant","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fossil fuel steam-electric power plant as: An electricity generation plant in which the","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.foundry-coke","kind":"concept","label":"Foundry coke","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Foundry coke as: This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fractionation","kind":"concept","label":"Fractionation","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fractionation as: The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fresh-feed-input","kind":"concept","label":"Fresh feed input","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fresh feed input as: Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fresh-feeds","kind":"concept","label":"Fresh feeds","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fresh feeds as: Crude oil or petroleum distillates that are being fed to processing units for the first time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-cell","kind":"concept","label":"Fuel cell","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel cell as: A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-cell-electric-vehicle-fcev","kind":"concept","label":"Fuel cell electric vehicle (FCEV)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel cell electric vehicle (FCEV) as: An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-injection","kind":"concept","label":"Fuel injection","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel injection as: A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuels-solvent-deasphalting","kind":"concept","label":"Fuels solvent deasphalting","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuels solvent deasphalting as: A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fugitive-emissions","kind":"concept","label":"Fugitive emissions","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fugitive emissions as: Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.full-power-day","kind":"concept","label":"Full power day","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Full power day as: The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.full-power-operation","kind":"concept","label":"Full power operation","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Full power operation as: Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.furnace","kind":"concept","label":"Furnace","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Furnace as: The part of a boiler or warm-air space-heating plant in which combustion takes place.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-cooled-fast-breeder-reactor-gcfb","kind":"concept","label":"Gas cooled fast breeder reactor (GCFB)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas cooled fast breeder reactor (GCFB) as: A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-to-liquids-gtl","kind":"concept","label":"Gas to liquids (GTL)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas to liquids (GTL) as: A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-turbine-plant","kind":"concept","label":"Gas turbine plant","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas turbine plant as: A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-well","kind":"concept","label":"Gas well","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas well as: A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-well-productivity","kind":"concept","label":"Gas well productivity","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas well productivity as: Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasohol","kind":"concept","label":"Gasohol","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasohol as: A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasoline-blending-components","kind":"concept","label":"Gasoline blending components","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasoline blending components as: Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasoline-motor-leaded","kind":"concept","label":"Gasoline motor, (leaded)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasoline motor, (leaded) as: Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gate-station","kind":"concept","label":"Gate station","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gate station as: Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generating-station","kind":"concept","label":"Generating station","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generating station as: A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generating-unit","kind":"concept","label":"Generating unit","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generating unit as: Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generator-capacity","kind":"concept","label":"Generator capacity","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generator capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generator-nameplate-capacity-installed","kind":"concept","label":"Generator nameplate capacity (installed)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generator nameplate capacity (installed) as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.geologic-sequestration","kind":"concept","label":"Geologic sequestration","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Geologic sequestration as: A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.geothermal-plant","kind":"concept","label":"Geothermal plant","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Geothermal plant as: A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","kind":"concept","label":"Gross additions to construction work in progress for the month","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross additions to construction work in progress for the month as: This amount should include the monthly gross additions for an electric plant in the process of construction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-gas-withdrawal","kind":"concept","label":"Gross gas withdrawal","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross gas withdrawal as: The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-inputs","kind":"concept","label":"Gross inputs","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross inputs as: The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-vehicle-weight-rating-gvwr","kind":"concept","label":"Gross vehicle weight rating (GVWR)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross vehicle weight rating (GVWR) as: Vehicle weight plus carrying capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-content","kind":"concept","label":"Heat content","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat content as: The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam). The amount of heat energy is commonly expressed in British thermal units (Btu). Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process). The Energy Information Administration typically uses gross heat content values.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump","kind":"concept","label":"Heat pump","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump as: Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump-air-source","kind":"concept","label":"Heat pump (air source)","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump (air source) as: An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump-geothermal","kind":"concept","label":"Heat pump (geothermal)","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump (geothermal) as: A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heating-value","kind":"concept","label":"Heating value","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heating value as: Heating value: A measure of the energy content of the physical unit of any combustible fuel. For a fuller discussion of","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heavy-water-moderated-reactor","kind":"concept","label":"Heavy-water-moderated reactor","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heavy-water-moderated reactor as: A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heliostat","kind":"concept","label":"Heliostat","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heliostat as: A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.high-efficiency-ballast","kind":"concept","label":"High efficiency ballast","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines High efficiency ballast as: A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.high-temperature-collector","kind":"concept","label":"High-temperature collector","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines High-temperature collector as: A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.horizontal-axis-wind-turbine","kind":"concept","label":"Horizontal axis wind turbine","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Horizontal axis wind turbine as: The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.horsepower","kind":"concept","label":"Horsepower","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Horsepower as: A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hours-under-load","kind":"concept","label":"Hours under load","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hours under load as: The hours the boiler is operating to drive the generator producing electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.htgr","kind":"concept","label":"HTGR","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HTGR as: High Temperature Gas-cooled Reactor","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hub-height","kind":"concept","label":"Hub height","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hub height as: In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.humidifier","kind":"concept","label":"Humidifier","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Humidifier as: A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hvac","kind":"concept","label":"HVAC","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HVAC as: An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hvac-conservation-feature","kind":"concept","label":"HVAC conservation feature","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HVAC conservation feature as: A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hybrid-transmission-line","kind":"concept","label":"Hybrid transmission line","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hybrid transmission line as: A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hydraulic-fracturing","kind":"concept","label":"Hydraulic fracturing","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hydraulic fracturing as: A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open. Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used. The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used. Hydraulic fracturing is common in low-permeability formations.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hydraulic-head","kind":"concept","label":"Hydraulic head","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hydraulic head as: The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.improved-recovery","kind":"concept","label":"Improved recovery","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Improved recovery as: Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.incandescent-lamp","kind":"concept","label":"Incandescent lamp","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Incandescent lamp as: A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","kind":"concept","label":"Incandescent light bulbs, including regular or energy-efficient light bulbs","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Incandescent light bulbs, including regular or energy-efficient light bulbs as: An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.independent-system-operator-iso","kind":"concept","label":"Independent system operator (ISO)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Independent system operator (ISO) as: An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.initial-operation","kind":"concept","label":"Initial operation","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Initial operation as: First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.insulator","kind":"concept","label":"Insulator","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Insulator as: A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integral-collector-storage-ics","kind":"concept","label":"Integral collector storage (ICS)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integral collector storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integrated-demand","kind":"concept","label":"Integrated demand","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integrated demand as: The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integrated-gasification-combined-cycle-technology","kind":"concept","label":"Integrated gasification-combined cycle technology","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integrated gasification-combined cycle technology as: Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interconnected-system","kind":"concept","label":"Interconnected system","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interconnected system as: A system consisting of two or more individual power systems normally operating with connecting tie lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermediate-grade-gasoline","kind":"concept","label":"Intermediate grade gasoline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermediate grade gasoline as: A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermediate-load-electric-system","kind":"concept","label":"Intermediate load (electric system)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermediate load (electric system) as: The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermittent-electric-generator-or-intermittent-resource","kind":"concept","label":"Intermittent electric generator or intermittent resource","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermittent electric generator or intermittent resource as: An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-collector-storage-ics","kind":"concept","label":"Internal Collector Storage (ICS)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal Collector Storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-combustion-engine-ice","kind":"concept","label":"Internal combustion engine (ICE)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal combustion engine (ICE) as: Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-combustion-plant","kind":"concept","label":"Internal combustion plant","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal combustion plant as: A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interruptible-load","kind":"concept","label":"Interruptible load","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interruptible load as: This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interstate-pipeline","kind":"concept","label":"Interstate pipeline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interstate pipeline as: Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intrastate-pipeline","kind":"concept","label":"Intrastate pipeline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intrastate pipeline as: Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ion-exchange","kind":"concept","label":"Ion exchange","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ion exchange as: Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.irradiated-nuclear-fuel","kind":"concept","label":"Irradiated nuclear fuel","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Irradiated nuclear fuel as: Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.isomerization","kind":"concept","label":"Isomerization","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Isomerization as: A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.isopach","kind":"concept","label":"Isopach","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Isopach as: A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.jacket","kind":"concept","label":"Jacket","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Jacket as: The enclosure on a water heater, furnace, or boiler.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.joint-use-facility","kind":"concept","label":"Joint-use facility","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Joint-use facility as: A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.joule-j","kind":"concept","label":"Joule (J)","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Joule (J) as: The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kaplan-turbine","kind":"concept","label":"Kaplan turbine","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kaplan turbine as: A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kerogen","kind":"concept","label":"Kerogen","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kerogen as: Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents. Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments. Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kerosene","kind":"concept","label":"Kerosene","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kerosene as: A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kilovolt-ampere-kva","kind":"concept","label":"Kilovolt-Ampere (kVa)","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kilovolt-Ampere (kVa) as: A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kilowatthour-kwh","kind":"concept","label":"Kilowatthour (kWh)","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kilowatthour (kWh) as: A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.landfill-gas","kind":"concept","label":"Landfill gas","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Landfill gas as: Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content). The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.large-scale-solar","kind":"concept","label":"Large-scale solar","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Large-scale solar as: Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lead-acid-battery","kind":"concept","label":"Lead acid battery","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lead acid battery as: An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.leading-edge","kind":"concept","label":"Leading edge","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.life-extension","kind":"concept","label":"Life extension","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Life extension as: Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lift","kind":"concept","label":"Lift","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lift as: The force that pulls a wind turbine blade, as opposed to drag.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.light-water-reactor-lwr","kind":"concept","label":"Light water reactor (LWR)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Light water reactor (LWR) as: A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lighting-conservation-feature","kind":"concept","label":"Lighting conservation feature","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lighting conservation feature as: A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lighting-equipment","kind":"concept","label":"Lighting equipment","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lighting equipment as: These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.liquid-collector","kind":"concept","label":"Liquid collector","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Liquid collector as: A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.liquid-metal-fast-breeder-reactor","kind":"concept","label":"Liquid metal fast breeder reactor","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Liquid metal fast breeder reactor as: A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-loss-3-hours","kind":"concept","label":"Load loss (3 hours)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load loss (3 hours) as: Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-management-technique","kind":"concept","label":"Load management technique","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load management technique as: Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-on-equipment","kind":"concept","label":"Load on equipment","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load on equipment as: One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.longwall-mining","kind":"concept","label":"Longwall mining","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Longwall mining as: An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.low-power-testing","kind":"concept","label":"Low power testing","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Low power testing as: The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lubricants","kind":"concept","label":"Lubricants","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lubricants as: Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lumens-watt-lpw","kind":"concept","label":"Lumens/Watt (lpw)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lumens/Watt (lpw) as: A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.machine-drive-motors","kind":"concept","label":"Machine drive (motors)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Machine drive (motors) as: The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.main-heating-fuel","kind":"concept","label":"Main heating fuel","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Main heating fuel as: The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mains","kind":"concept","label":"Mains","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mains as: A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.manufactured-gas","kind":"concept","label":"Manufactured gas","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Manufactured gas as: A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.marketed-production","kind":"concept","label":"Marketed production","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Marketed production as: Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.maximum-dependable-capacity-net","kind":"concept","label":"Maximum dependable capacity, net","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Maximum dependable capacity, net as: The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.maximum-generator-nameplate-capacity","kind":"concept","label":"Maximum generator nameplate capacity","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Maximum generator nameplate capacity as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mean-power-output-of-a-wind-turbine","kind":"concept","label":"Mean power output (of a wind turbine)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mean power output (of a wind turbine) as: The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.medium-temperature-collector","kind":"concept","label":"Medium-temperature collector","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Medium-temperature collector as: A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.microgroove","kind":"concept","label":"Microgroove","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Microgroove as: A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.micrometer-or-micron","kind":"concept","label":"Micrometer (or Micron)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Micrometer (or Micron) as: One-millionth of a meter. It can also be expressed as 10-6 meter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mill-feed","kind":"concept","label":"Mill feed","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mill feed as: Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.milling-of-uranium","kind":"concept","label":"Milling of uranium","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Milling of uranium as: The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mineral-matter-free-basis","kind":"concept","label":"Mineral-matter-free basis","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mineral-matter-free basis as: Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.minority-carrier","kind":"concept","label":"Minority carrier","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Minority carrier as: A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.moderator","kind":"concept","label":"Moderator","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Moderator as: A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-gasoline-finished","kind":"concept","label":"Motor gasoline (finished)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor gasoline (finished) as: A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-gasoline-blending","kind":"concept","label":"Motor gasoline blending","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor gasoline blending as: Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-speed","kind":"concept","label":"Motor speed","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor speed as: The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.name-plate","kind":"concept","label":"Name plate","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Name plate as: A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.naphtha-type-jet-fuel","kind":"concept","label":"Naphtha-type jet fuel","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Naphtha-type jet fuel as: A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.naphthas","kind":"concept","label":"Naphthas","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Naphthas as: Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.native-gas","kind":"concept","label":"Native gas","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Native gas as: Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-marketed-production","kind":"concept","label":"Natural gas marketed production","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas marketed production as: Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-plant-liquids-ngpl","kind":"concept","label":"Natural gas plant liquids (NGPL)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) as: Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-plant-liquids-ngpl-production","kind":"concept","label":"Natural gas plant liquids (NGPL) production","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) production as: The extraction of gas plant liquids constituents such as","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-reservoir-pressure","kind":"concept","label":"Natural reservoir pressure","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural reservoir pressure as: The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-streamflow","kind":"concept","label":"Natural streamflow","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural streamflow as: The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-cell-shipments","kind":"concept","label":"Net cell shipments","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net cell shipments as: Represents the difference between cell shipments and cell purchases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-energy-for-load-electric","kind":"concept","label":"Net energy for load (electric)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net energy for load (electric) as: Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-energy-for-system","kind":"concept","label":"Net energy for system","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net energy for system as: The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-generation","kind":"concept","label":"Net generation","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net generation as: The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-head","kind":"concept","label":"Net head","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net head as: The gross head minus all hydraulic losses except those chargeable to the turbine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-module-shipments","kind":"concept","label":"Net module shipments","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net module shipments as: Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-photovoltaic-module-shipment","kind":"concept","label":"Net photovoltaic module shipment","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net photovoltaic module shipment as: The difference between photovoltaic module shipments and photovoltaic module purchases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-summer-capacity","kind":"concept","label":"Net summer capacity","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net summer capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.) This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-winter-capacity","kind":"concept","label":"Net winter capacity","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net winter capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28). This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.no-6-residual-fuel-oil","kind":"concept","label":"No. 6 Residual fuel oil","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines No. 6 Residual fuel oil as: Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes. See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.noload-loss","kind":"concept","label":"Noload loss","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Noload loss as: Power and energy lost by an electric system when not operating under demand.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonconventional-plant-uranium","kind":"concept","label":"Nonconventional plant (uranium)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonconventional plant (uranium) as: A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nondedicated-vehicle","kind":"concept","label":"Nondedicated vehicle","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nondedicated vehicle as: A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonfuel-components","kind":"concept","label":"Nonfuel components","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonfuel components as: Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","kind":"concept","label":"Nonroad alternative fuel vehicle (nonroad AFV)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonroad alternative fuel vehicle (nonroad AFV) as: An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.north-american-electric-reliability-corporation-nerc","kind":"concept","label":"North American Electric Reliability Corporation (NERC)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines North American Electric Reliability Corporation (NERC) as: A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-electric-power-nuclear-power","kind":"concept","label":"Nuclear electric power (nuclear power)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear electric power (nuclear power) as: Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-fuel","kind":"concept","label":"Nuclear fuel","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear fuel as: Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-reactor","kind":"concept","label":"Nuclear reactor","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear reactor as: An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.number-of-mining-operations","kind":"concept","label":"Number of mining operations","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Number of mining operations as: The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ocean-thermal-energy-conversion-otec","kind":"concept","label":"Ocean thermal energy conversion (OTEC)","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ocean thermal energy conversion (OTEC) as: The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.octane","kind":"concept","label":"Octane","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Octane as: A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.octane-rating","kind":"concept","label":"Octane rating","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Octane rating as: A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-peak","kind":"concept","label":"Off peak","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off peak as: Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-hours-equipment-reduction","kind":"concept","label":"Off-hours equipment reduction","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off-hours equipment reduction as: A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","kind":"concept","label":"Off-site produced energy for heat, power, and electricity generation","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off-site produced energy for heat, power, and electricity generation as: This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ohm","kind":"concept","label":"Ohm","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ohm as: A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.oil-well","kind":"concept","label":"Oil well","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Oil well as: A well completed for the production of crude oil from at least one oil zone or reservoir.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.oil-well-casing-head-gas","kind":"concept","label":"Oil well (casing head) gas","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Oil well (casing head) gas as: Associated and dissolved gas produced along with crude oil from oil completions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstorderlogic","kind":"concept","label":"First order logic","sources":[{"id":"planetmath.firstorderlogic","title":"PlanetMath entry firstorderlogic","url":"https://planetmath.org/firstorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: A logic is first order if it has exactly one type.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.propositionallogic","kind":"concept","label":"Propositional logic","sources":[{"id":"planetmath.propositionallogic","title":"PlanetMath entry propositionallogic","url":"https://planetmath.org/propositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A propositional logic is a logic in which the only objects are propositions , that is, objects which themselves have truth values.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.settheory","kind":"concept","label":"Set theory","sources":[{"id":"planetmath.settheory","title":"PlanetMath entry settheory","url":"https://planetmath.org/settheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E30) states: Set theory is special among mathematical theories, in two ways: It plays a central role in putting mathematics on a reliable axiomatic foundation , and it provides the basic language and apparatus in which most of mathematics is expressed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modeltheory","kind":"concept","label":"Model theory","sources":[{"id":"planetmath.modeltheory","title":"PlanetMath entry modeltheory","url":"https://planetmath.org/modeltheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C99) states: Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.zermelofraenkelaxioms","kind":"concept","label":"Zermelo-Fraenkel axioms","sources":[{"id":"planetmath.zermelofraenkelaxioms","title":"PlanetMath entry zermelofraenkelaxioms","url":"https://planetmath.org/zermelofraenkelaxioms"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E99) states: Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a for what is now called Zermelo-Fraenkel set theory , or ZF.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofchoice","kind":"concept","label":"Axiom of choice","sources":[{"id":"planetmath.axiomofchoice","title":"PlanetMath entry axiomofchoice","url":"https://planetmath.org/axiomofchoice"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30, 03E25) states: The Zermelo-Fraenkel axioms for set theory are often accepted as a basis for an axiomatic set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ordinalnumber","kind":"concept","label":"Ordinal number","sources":[{"id":"planetmath.ordinalnumber","title":"PlanetMath entry ordinalnumber","url":"https://planetmath.org/ordinalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: An ordinal number is a well ordered set S such that, for every x ∈ S , x = { z ∈ S ∣ z < x } (where < is the ordering relation on S ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinalnumber","kind":"concept","label":"Cardinal number","sources":[{"id":"planetmath.cardinalnumber","title":"PlanetMath entry cardinalnumber","url":"https://planetmath.org/cardinalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A cardinal number is an ordinal number S with the property that S ≤ X for every ordinal number X which has the same cardinality as S .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursivefunction","kind":"concept","label":"Recursive function","sources":[{"id":"planetmath.recursivefunction","title":"PlanetMath entry recursivefunction","url":"https://planetmath.org/recursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: Intuitively, a recursive function is a positive integer valued function of one or more positive integer arguments which may be computed by a definite algorithm .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.godelsincompletenesstheorems","kind":"theory","label":"Gödel’s incompleteness theorems","sources":[{"id":"planetmath.godelsincompletenesstheorems","title":"PlanetMath entry godelsincompletenesstheorems","url":"https://planetmath.org/godelsincompletenesstheorems"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B10, 03F45) states: Gödel’s first and second incompleteness theorems are perhaps the most celebrated results in mathematical logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modallogic","kind":"concept","label":"Modal logic","sources":[{"id":"planetmath.modallogic","title":"PlanetMath entry modallogic","url":"https://planetmath.org/modallogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B45) states: Introduction Modal logic is the logic of “ necessity ” and “possibility”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.intuitionisticlogic","kind":"concept","label":"Intuitionistic logic","sources":[{"id":"planetmath.intuitionisticlogic","title":"PlanetMath entry intuitionisticlogic","url":"https://planetmath.org/intuitionisticlogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03B20, 03-01) states: Abstract The entry \" intuitionistic logic \" is a beginner’s introduction to the defining features of Brouwer’s (and his School) mathematical philosophy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lambdacalculus","kind":"concept","label":"Lambda calculus","sources":[{"id":"planetmath.lambdacalculus","title":"PlanetMath entry lambdacalculus","url":"https://planetmath.org/lambdacalculus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40) states: Lambda calculus (often referred to as λ -calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with functions and the application of functions to their arguments .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinalarithmetic","kind":"concept","label":"Cardinal arithmetic","sources":[{"id":"planetmath.cardinalarithmetic","title":"PlanetMath entry cardinalarithmetic","url":"https://planetmath.org/cardinalarithmetic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: Definitions Let κ and λ be cardinal numbers , and let A and B be disjoint sets such that | A | = κ and | B | = λ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicalconnective","kind":"concept","label":"Logical connective","sources":[{"id":"planetmath.logicalconnective","title":"PlanetMath entry logicalconnective","url":"https://planetmath.org/logicalconnective"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In propositional logic , the usual way of forming a well-formed formula out of existing ones is by attaching a designated symbol to the existing wffs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicallanguage","kind":"concept","label":"Logical language","sources":[{"id":"planetmath.logicallanguage","title":"PlanetMath entry logicallanguage","url":"https://planetmath.org/logicallanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: In its most general form, a logical language is a set of rules for constructing formulas for some logic, which can then be assigned truth values based on the rules of that logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantifier","kind":"concept","label":"Quantifier","sources":[{"id":"planetmath.quantifier","title":"PlanetMath entry quantifier","url":"https://planetmath.org/quantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Introduction A quantifier is a logical symbol which makes an assertion about the set of values which make one or more formulas true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.arithmeticalhierarchy","kind":"concept","label":"Arithmetical hierarchy","sources":[{"id":"planetmath.arithmeticalhierarchy","title":"PlanetMath entry arithmeticalhierarchy","url":"https://planetmath.org/arithmeticalhierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: The arithmetical hierarchy is a hierarchy of either (depending on the context ) formulas or relations .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.biconditional","kind":"concept","label":"Biconditional","sources":[{"id":"planetmath.biconditional","title":"PlanetMath entry biconditional","url":"https://planetmath.org/biconditional"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: 1 Biconditional A biconditional is a truth function that is true only in the case that both parameters are true or both are false.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanvaluedfunction","kind":"concept","label":"Boolean-valued function","sources":[{"id":"planetmath.booleanvaluedfunction","title":"PlanetMath entry booleanvaluedfunction","url":"https://planetmath.org/booleanvaluedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q01, 68P01, 06E30, 03G05, 03C55, 03B05, 68R01) states: A Boolean-valued function is a function of type f : X → 𝔹 , where X is an arbitrary set and where 𝔹 is a Boolean domain .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.derivedbooleanoperations","kind":"concept","label":"Derived Boolean operations","sources":[{"id":"planetmath.derivedbooleanoperations","title":"PlanetMath entry derivedbooleanoperations","url":"https://planetmath.org/derivedbooleanoperations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Recall that a Boolean algebra is an algebraic system A consisting of five operations : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalenceofforcingnotions","kind":"concept","label":"Equivalence of forcing notions","sources":[{"id":"planetmath.equivalenceofforcingnotions","title":"PlanetMath entry equivalenceofforcingnotions","url":"https://planetmath.org/equivalenceofforcingnotions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E35, 03E40) states: Let P and Q be two forcing notions such that given any generic subset G of P there is a generic subset H of Q with 𝔐 ⁢ [ G ] = 𝔐 ⁢ [ H ] and vice-versa.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalencerelation","kind":"concept","label":"Equivalence relation","sources":[{"id":"planetmath.equivalencerelation","title":"PlanetMath entry equivalencerelation","url":"https://planetmath.org/equivalencerelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06-00, 03D20) states: An equivalence relation ∼ on a set S is a relation that is: Reflexive .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalentmachines","kind":"concept","label":"Equivalent machines","sources":[{"id":"planetmath.equivalentmachines","title":"PlanetMath entry equivalentmachines","url":"https://planetmath.org/equivalentmachines"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Let M 1 = ( S 1 , Σ , Δ , σ 1 , λ 1 ) and M 2 = ( S 2 , Σ , Δ , σ 2 , λ 2 ) be two Mealy machines .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.filterbasis","kind":"concept","label":"Filter basis","sources":[{"id":"planetmath.filterbasis","title":"PlanetMath entry filterbasis","url":"https://planetmath.org/filterbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 54A99) states: A filter subbasis for a set S is a collection of subsets of S which has the finite intersection property .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstorderlanguage","kind":"concept","label":"First order language","sources":[{"id":"planetmath.firstorderlanguage","title":"PlanetMath entry firstorderlanguage","url":"https://planetmath.org/firstorderlanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let Σ be a signature . The first order language FO ⁡ ( Σ ) on Σ contains the following: 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.kripkesemantics","kind":"concept","label":"Kripke semantics","sources":[{"id":"planetmath.kripkesemantics","title":"PlanetMath entry kripkesemantics","url":"https://planetmath.org/kripkesemantics"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B48, 03B20, 03B45) states: A Kripke frame (or simply a frame) ℱ is a pair ( W , R ) where W is a non-empty set whose elements are called worlds or possible worlds , R is a binary relation on W called the accessibility relation .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.maximallyconsistent","kind":"concept","label":"Maximally consistent","sources":[{"id":"planetmath.maximallyconsistent","title":"PlanetMath entry maximallyconsistent","url":"https://planetmath.org/maximallyconsistent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03B10, 03B99, 03B45) states: A set Δ of well-formed formulas (wff) is maximally consistent if Δ is consistent and any consistent superset of it is itself: Δ ⊆ Γ with Γ consistent implies Γ = Δ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.propositionalcalculus","kind":"concept","label":"Propositional calculus","sources":[{"id":"planetmath.propositionalcalculus","title":"PlanetMath entry propositionalcalculus","url":"https://planetmath.org/propositionalcalculus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03C05, 03B22, 03B05) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase angle \\PMlinkescapephrase Angle \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase complete \\PMlinkescapephrase Complete \\PMlinkescapephrase component \\PMlinkescapephrase Component \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formalism \\PMlinkescapephrase Formalism \\PMlinkescapephrase holder \\PMlinkescapephrase Holder \\PMlinkescapephrase holders \\PMlinkescapephrase Holders \\PMlinkescapephrase origin \\PMlinkescapephrase Origin \\PMlinkescapephrase plus \\PMlinkescapephrase Plus \\PMlinkescapephrase point \\PMlinkescapephrase Point \\PMlinkescapephrase points \\PMlinkescapephrase Points \\PMlinkescapephrase right \\PMlinkescapephrase Right \\PMlinkescapephrase utility \\PMlinkescapephrase Utility A propositional calculus is a formal system whose expressions represent formal objects known as propositions and whose distinguished relations among expressions represent existing relations among propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substitutionsinpropositionallogic","kind":"concept","label":"Substitutions in propositional logic","sources":[{"id":"planetmath.substitutionsinpropositionallogic","title":"PlanetMath entry substitutionsinpropositionallogic","url":"https://planetmath.org/substitutionsinpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: Uniform Substitution One area of mathematics where substitution plays a prominent role is mathematical logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.tautology","kind":"concept","label":"Tautology","sources":[{"id":"planetmath.tautology","title":"PlanetMath entry tautology","url":"https://planetmath.org/tautology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03B10) states: A tautology is a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthfunction","kind":"concept","label":"Truth function","sources":[{"id":"planetmath.truthfunction","title":"PlanetMath entry truthfunction","url":"https://planetmath.org/truthfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A truth function is a function that returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthtable","kind":"concept","label":"Truth table","sources":[{"id":"planetmath.truthtable","title":"PlanetMath entry truthtable","url":"https://planetmath.org/truthtable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 34C29) states: A truth table is a tabular listing of all possible input value combinations for a logical function and their corresponding output values.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","kind":"concept","label":"Truth-value semantics for classical propositional logic","sources":[{"id":"planetmath.truthvaluesemanticsforclassicalpropositionallogic","title":"PlanetMath entry truthvaluesemanticsforclassicalpropositionallogic","url":"https://planetmath.org/truthvaluesemanticsforclassicalpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In classical propositional logic , an interpretation of a well-formed formula (wff) p is an assignment of truth (=1) or falsity (=0) to p .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomoffoundation","kind":"concept","label":"Axiom of foundation","sources":[{"id":"planetmath.axiomoffoundation","title":"PlanetMath entry axiomoffoundation","url":"https://planetmath.org/axiomoffoundation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99) states: The axiom of foundation (also called the axiom of regularity ) is an axiom of ZF set theory prohibiting circular sets and sets with infinite levels of containment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.extensionofafunction","kind":"concept","label":"Extension of a function","sources":[{"id":"planetmath.extensionofafunction","title":"PlanetMath entry extensionofafunction","url":"https://planetmath.org/extensionofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let f : X → Y be a function and A and B be sets such that X ⊆ A and Y ⊆ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.naturalnumber","kind":"concept","label":"Natural number","sources":[{"id":"planetmath.naturalnumber","title":"PlanetMath entry naturalnumber","url":"https://planetmath.org/naturalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10, 74D99) states: Given the Zermelo-Fraenkel axioms of set theory , one can prove that there exists an inductive set X such that ∅ ∈ X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderedpair","kind":"concept","label":"Ordered pair","sources":[{"id":"planetmath.orderedpair","title":"PlanetMath entry orderedpair","url":"https://planetmath.org/orderedpair"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 70A05, 70G99) states: For any sets a and b , the ordered pair ( a , b ) is the set { { a } , { a , b } } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.restrictionofafunction","kind":"concept","label":"Restriction of a function","sources":[{"id":"planetmath.restrictionofafunction","title":"PlanetMath entry restrictionofafunction","url":"https://planetmath.org/restrictionofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let f : X → Y be a function from a set X to a set Y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.satisfactionrelation","kind":"concept","label":"Satisfaction relation","sources":[{"id":"planetmath.satisfactionrelation","title":"PlanetMath entry satisfactionrelation","url":"https://planetmath.org/satisfactionrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Alfred Tarski was the first mathematician to give a formal definition of what it means for a formula to be “true” in a structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.structurehomomorphism","kind":"concept","label":"Structure homomorphism","sources":[{"id":"planetmath.structurehomomorphism","title":"PlanetMath entry structurehomomorphism","url":"https://planetmath.org/structurehomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 be two structures for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subfunction","kind":"concept","label":"Subfunction","sources":[{"id":"planetmath.subfunction","title":"PlanetMath entry subfunction","url":"https://planetmath.org/subfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E20) states: Definition . Let f : A → B and g : C → D be partial functions .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substructure","kind":"concept","label":"Substructure","sources":[{"id":"planetmath.substructure","title":"PlanetMath entry substructure","url":"https://planetmath.org/substructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 structures for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.algebraicsystem","kind":"concept","label":"Algebraic system","sources":[{"id":"planetmath.algebraicsystem","title":"PlanetMath entry algebraicsystem","url":"https://planetmath.org/algebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A05, 03E99, 08A62) states: An algebraic system , loosely speaking, is a set, together with some operations on the set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.conceptlattice","kind":"concept","label":"Concept lattice","sources":[{"id":"planetmath.conceptlattice","title":"PlanetMath entry conceptlattice","url":"https://planetmath.org/conceptlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q55, 68P99, 08A70, 06B23, 03B70, 06A15) states: Let G and M be sets whose elements we call objects and attributes respectively.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.elementaryembedding","kind":"concept","label":"Elementary embedding","sources":[{"id":"planetmath.elementaryembedding","title":"PlanetMath entry elementaryembedding","url":"https://planetmath.org/elementaryembedding"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99) states: Let τ be a signature and 𝒜 and ℬ be two structures for τ such that f : 𝒜 → ℬ is an embedding .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.formalgrammar","kind":"concept","label":"Formal grammar","sources":[{"id":"planetmath.formalgrammar","title":"PlanetMath entry formalgrammar","url":"https://planetmath.org/formalgrammar"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 91F20, 68Q42, 68Q45, 03D05) states: Introduction A grammar , loosely speaking, is a set of rules that can be applied to words to generate sentences in a language .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","kind":"concept","label":"From Hilbert’s tenth problem to Gödel’s trichotomy","sources":[{"id":"planetmath.fromhilbertstenthproblemtogodelstrichotomy","title":"PlanetMath entry fromhilbertstenthproblemtogodelstrichotomy","url":"https://planetmath.org/fromhilbertstenthproblemtogodelstrichotomy"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: From Hilbert’s tenth problem to Gödel’s trichotomy Contents: 1 Hilbert on the pursuit of knowledge 2 The two sources of mathematical knowledge 3 Hilbert’s epistemological optimism 4 Stricto sensu and conditional mathematics 5 The cumulative hierarchy 6 Diophantine equivalent of number theoretical statements 7 The incompleteness and consistency propositions 8 Sketch of a Gedankenexperiment 9 Gödel’s trichotomy 1 Hilbert on the pursuit of knowledge In the Summer of 1900 the Second International Congress of Mathematicians took place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.imaginaries","kind":"concept","label":"Imaginaries","sources":[{"id":"planetmath.imaginaries","title":"PlanetMath entry imaginaries","url":"https://planetmath.org/imaginaries"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C95, 03C68) states: Given an algebraic structure S to investigate, mathematicians consider substructures , restrictions of the structure , quotient structures and the like.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ominimality","kind":"concept","label":"O-minimality","sources":[{"id":"planetmath.ominimality","title":"PlanetMath entry ominimality","url":"https://planetmath.org/ominimality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C64, 14P10) states: Let M be an ordered structure . An interval in M is any subset of M that can be expressed in one of the following forms: • { x : a < x < b } for some a , b from M • { x : x > a } for some a from M • { x : x < a } for some a from M Then we define M to be o-minimal iff every definable subset of M is a finite union of intervals and points.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantifierfree","kind":"concept","label":"Quantifier free","sources":[{"id":"planetmath.quantifierfree","title":"PlanetMath entry quantifierfree","url":"https://planetmath.org/quantifierfree"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C10, 03C07, 03B10) states: Let L be a first order language . A formula ψ is quantifier free iff it contains no quantifiers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.signatureofapermutation","kind":"concept","label":"Signature of a permutation","sources":[{"id":"planetmath.signatureofapermutation","title":"PlanetMath entry signatureofapermutation","url":"https://planetmath.org/signatureofapermutation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Let X be a finite set , and let G be the group of permutations of X (see permutation group ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiom","kind":"concept","label":"Axiom","sources":[{"id":"planetmath.axiom","title":"PlanetMath entry axiom","url":"https://planetmath.org/axiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99, 03A05) states: In a nutshell, the logico-deductive method is a system of inference where conclusions (new knowledge) follow from premises (old knowledge) through the application of sound arguments ( syllogisms , rules of inference ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofinfinity","kind":"concept","label":"Axiom of infinity","sources":[{"id":"planetmath.axiomofinfinity","title":"PlanetMath entry axiomofinfinity","url":"https://planetmath.org/axiomofinfinity"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: There exists an infinite set . The Axiom of Infinity is an axiom of Zermelo-Fraenkel set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.classesofordinalsandenumeratingfunctions","kind":"concept","label":"Classes of ordinals and enumerating functions","sources":[{"id":"planetmath.classesofordinalsandenumeratingfunctions","title":"PlanetMath entry classesofordinalsandenumeratingfunctions","url":"https://planetmath.org/classesofordinalsandenumeratingfunctions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F15, 03E10) states: A class of ordinals is just a subclass of the class ( http://planetmath.org/Class ) 𝐎𝐧 of all ordinals.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.continuumhypothesis","kind":"concept","label":"Continuum hypothesis","sources":[{"id":"planetmath.continuumhypothesis","title":"PlanetMath entry continuumhypothesis","url":"https://planetmath.org/continuumhypothesis"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E50) states: The continuum hypothesis that there is no cardinal number κ such that ℵ 0 < κ < 2 ℵ 0 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.emptyset","kind":"concept","label":"Empty set","sources":[{"id":"planetmath.emptyset","title":"PlanetMath entry emptyset","url":"https://planetmath.org/emptyset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 65H05, 65H10) states: An empty set is a set ∅ that contains no elements .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.generalizedcartesianproduct","kind":"concept","label":"Generalized Cartesian product","sources":[{"id":"planetmath.generalizedcartesianproduct","title":"PlanetMath entry generalizedcartesianproduct","url":"https://planetmath.org/generalizedcartesianproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Given any family of sets { A j } j ∈ J indexed by an index set J , the generalized Cartesian product ∏ j ∈ J A j is the set of all functions f : J → ⋃ j ∈ J A j such that f ⁢ ( j ) ∈ A j for all j ∈ J .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.hausdorffsmaximumprinciple","kind":"theory","label":"Hausdorff’s maximum principle","sources":[{"id":"planetmath.hausdorffsmaximumprinciple","title":"PlanetMath entry hausdorffsmaximumprinciple","url":"https://planetmath.org/hausdorffsmaximumprinciple"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25) states: Theorem Let X be a partially ordered set . Then there exists a maximal totally ordered subset of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hilbertsystem","kind":"concept","label":"Hilbert system","sources":[{"id":"planetmath.hilbertsystem","title":"PlanetMath entry hilbertsystem","url":"https://planetmath.org/hilbertsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: A Hilbert system is a style (formulation) of deductive system that emphasizes the role played by the axioms in the system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.injectivefunction","kind":"concept","label":"Injective function","sources":[{"id":"planetmath.injectivefunction","title":"PlanetMath entry injectivefunction","url":"https://planetmath.org/injectivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 03E99) states: We say that a function f : A → B is injective or one-to-one if f ⁢ ( x ) = f ⁢ ( y ) implies x = y , or equivalently, whenever x ≠ y , then f ⁢ ( x ) ≠ f ⁢ ( y ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.surjective","kind":"concept","label":"Surjective","sources":[{"id":"planetmath.surjective","title":"PlanetMath entry surjective","url":"https://planetmath.org/surjective"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: A function f : X → Y is called surjective or onto if, for every y ∈ Y , there is an x ∈ X such that f ⁢ ( x ) = y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.uncountable","kind":"concept","label":"Uncountable","sources":[{"id":"planetmath.uncountable","title":"PlanetMath entry uncountable","url":"https://planetmath.org/uncountable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: Definition A set is uncountable if it is not countable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderingrelation","kind":"concept","label":"Ordering relation","sources":[{"id":"planetmath.orderingrelation","title":"PlanetMath entry orderingrelation","url":"https://planetmath.org/orderingrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 81-00, 18-00, 17B37, 18D10, 18D35, 16W30) states: Let S be a set. An ordering relation is a relation ≤ on S such that, for every a , b , c ∈ S : • Either a ≤ b , or b ≤ a , • If a ≤ b and b ≤ c , then a ≤ c , • If a ≤ b and b ≤ a , then a = b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ordinalarithmetic","kind":"concept","label":"Ordinal arithmetic","sources":[{"id":"planetmath.ordinalarithmetic","title":"PlanetMath entry ordinalarithmetic","url":"https://planetmath.org/ordinalarithmetic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: Ordinal arithmetic is the extension of normal arithmetic to the transfinite ordinal numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinality","kind":"concept","label":"Cardinality","sources":[{"id":"planetmath.cardinality","title":"PlanetMath entry cardinality","url":"https://planetmath.org/cardinality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: Cardinality Cardinality is a notion of the size of a set which does not rely on numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.automaton","kind":"concept","label":"Automaton","sources":[{"id":"planetmath.automaton","title":"PlanetMath entry automaton","url":"https://planetmath.org/automaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: An automaton is a semiautomaton with two types of special states: starting states, and final states.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.combinatorylogic","kind":"concept","label":"Combinatory logic","sources":[{"id":"planetmath.combinatorylogic","title":"PlanetMath entry combinatorylogic","url":"https://planetmath.org/combinatorylogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40) states: Combinatory logic was invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursivelyenumerable","kind":"concept","label":"Recursively enumerable","sources":[{"id":"planetmath.recursivelyenumerable","title":"PlanetMath entry recursivelyenumerable","url":"https://planetmath.org/recursivelyenumerable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D25) states: For a language L , TFAE: • There exists a Turing machine f such that ∀ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.alternativecharacterizationsofrecursivefunctions","kind":"concept","label":"Alternative characterizations of recursive functions","sources":[{"id":"planetmath.alternativecharacterizationsofrecursivefunctions","title":"PlanetMath entry alternativecharacterizationsofrecursivefunctions","url":"https://planetmath.org/alternativecharacterizationsofrecursivefunctions"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03D20) states: The class of recursive functions may be characterized by considerably weaker conditions than those given in the entry “recursive function ( http://planetmath.org/RecursiveFunction )” of this encyclopaedia.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.primitiverecursivefunction","kind":"concept","label":"Primitive recursive function","sources":[{"id":"planetmath.primitiverecursivefunction","title":"PlanetMath entry primitiverecursivefunction","url":"https://planetmath.org/primitiverecursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: To define what a primitive recursive function is, the following notations are used: ℱ = ⋃ { F k ∣ k ∈ ℕ } , where for each k ∈ ℕ ⁢ , ⁢ F k = { f ∣ f : ℕ k → ℕ } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.turingcomputable","kind":"concept","label":"Turing computable","sources":[{"id":"planetmath.turingcomputable","title":"PlanetMath entry turingcomputable","url":"https://planetmath.org/turingcomputable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q05) states: A function is Turing computable if the function’s value can be computed with a Turing machine .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.beyondformalismgodelsincompleteness","kind":"concept","label":"Beyond formalism: Gödel’s incompleteness","sources":[{"id":"planetmath.beyondformalismgodelsincompleteness","title":"PlanetMath entry beyondformalismgodelsincompleteness","url":"https://planetmath.org/beyondformalismgodelsincompleteness"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B10, 03A05, 03-01) states: Contents: 1 Overview 2 Arithmetic 3 From the number sequence to formal arithmetic 4 The formal theory Z 5 A model for Z 6 Gödel numbers 7 Expressing relations and representing functions in Z 8 Omega-consistency and metamathematical predicates 9 How to build Gödel’s undecidable statement 10 Gödel’s first theorem 11 The interpretation of the undecidable formula 12 Gödel’s second theorem 13 The interpretation of the second theorem 14 The concept of truth A Q & A 1 Overview In the literature on the foundations of mathematics the term ” formalism ” occurs with three different configurations .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contradiction","kind":"concept","label":"Contradiction","sources":[{"id":"planetmath.contradiction","title":"PlanetMath entry contradiction","url":"https://planetmath.org/contradiction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F07, 03B05) states: A contradiction occurs when the statements p and ¬ ⁢ p are shown to be true simultaneously.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contradictorystatement","kind":"concept","label":"Contradictory statement","sources":[{"id":"planetmath.contradictorystatement","title":"PlanetMath entry contradictorystatement","url":"https://planetmath.org/contradictorystatement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A contradictory statement is a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.necessaryandsufficient","kind":"concept","label":"Necessary and sufficient","sources":[{"id":"planetmath.necessaryandsufficient","title":"PlanetMath entry necessaryandsufficient","url":"https://planetmath.org/necessaryandsufficient"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03F07) states: The statement “ p is necessary for q ” “ q implies ( http://planetmath.org/ Implication ) p ”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.russellstheoryoftypes","kind":"concept","label":"Russell’s theory of types","sources":[{"id":"planetmath.russellstheoryoftypes","title":"PlanetMath entry russellstheoryoftypes","url":"https://planetmath.org/russellstheoryoftypes"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: After the discovery of the paradoxes of set theory (notably Russell’s paradox ), it become apparent that naive set theory must be replaced by something in which the paradoxes can’t arise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomsystemforfirstorderlogic","kind":"concept","label":"Axiom system for first order logic","sources":[{"id":"planetmath.axiomsystemforfirstorderlogic","title":"PlanetMath entry axiomsystemforfirstorderlogic","url":"https://planetmath.org/axiomsystemforfirstorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: Let FO ( Σ ) be a first order language over signature Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomsystemforpropositionallogic","kind":"concept","label":"Axiom system for propositional logic","sources":[{"id":"planetmath.axiomsystemforpropositionallogic","title":"PlanetMath entry axiomsystemforpropositionallogic","url":"https://planetmath.org/axiomsystemforpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: The language of (classical) propositional logic PL c consists of a set of propositional letters or variables , the symbol ⟂ (for falsity), together with two symbols for logical connectives ¬ and → .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.deduction","kind":"concept","label":"Deduction","sources":[{"id":"planetmath.deduction","title":"PlanetMath entry deduction","url":"https://planetmath.org/deduction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: Deductions are formalizations of proofs. Informally, they can be viewed as arriving at a conclusion from a set of assumptions, via applications of some prescribed rules in a finite number of steps.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.formalsystem","kind":"concept","label":"Formal system","sources":[{"id":"planetmath.formalsystem","title":"PlanetMath entry formalsystem","url":"https://planetmath.org/formalsystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B99) states: In mathematical logic, a formal system is a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inferencerule","kind":"concept","label":"Inference rule","sources":[{"id":"planetmath.inferencerule","title":"PlanetMath entry inferencerule","url":"https://planetmath.org/inferencerule"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B35, 03B22, 03B05) states: In logic, an inference rule is a rule whereby one may correctly draw a conclusion from one or more premises .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicalaxiom","kind":"concept","label":"Logical axiom","sources":[{"id":"planetmath.logicalaxiom","title":"PlanetMath entry logicalaxiom","url":"https://planetmath.org/logicalaxiom"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B22, 03B05) states: In a logical system , a logical axiom (sometimes called an axiom for short) is a logically valid (well-formed) formula used in a deductive system (particularly an axiom system ) to deduce other logically valid formulas.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicallyequivalent","kind":"concept","label":"Logically equivalent","sources":[{"id":"planetmath.logicallyequivalent","title":"PlanetMath entry logicallyequivalent","url":"https://planetmath.org/logicallyequivalent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Two formulas A and B are said to be logically equivalent (typically shortened to equivalent ) when A is true if and only if B is true (that is, A implies B and B implies A ): ⊧ A ↔ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modusponens","kind":"concept","label":"Modus ponens","sources":[{"id":"planetmath.modusponens","title":"PlanetMath entry modusponens","url":"https://planetmath.org/modusponens"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B22, 03B05, 03B35) states: Modus ponens is a rule of inference that is commonly found in many logics where the binary logical connective → (sometimes written ⇒ or ⊃ ) called logical implication are defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.normalmodallogic","kind":"concept","label":"Normal modal logic","sources":[{"id":"planetmath.normalmodallogic","title":"PlanetMath entry normalmodallogic","url":"https://planetmath.org/normalmodallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B45) states: The study of modal logic is based on the concept of a logic , which is a set Λ of wff’s satisfying the following: • contains all tautologies , and • is closed under modus ponens .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.powerset","kind":"concept","label":"Power set","sources":[{"id":"planetmath.powerset","title":"PlanetMath entry powerset","url":"https://planetmath.org/powerset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 03E10, 37-01) states: Definition If X is a set, then the power set of X , denoted by 𝒫 ⁢ ( X ) , is the set whose elements are the subsets of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantumlogic","kind":"concept","label":"Quantum logic","sources":[{"id":"planetmath.quantumlogic","title":"PlanetMath entry quantumlogic","url":"https://planetmath.org/quantumlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G12) states: Introduction In classical physics, results regarding experiments performed on physical propositions obey classical propositional logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.analyticsandformallogicsinmetamathematics","kind":"concept","label":"Analytics and formal logics in meta-mathematics","sources":[{"id":"planetmath.analyticsandformallogicsinmetamathematics","title":"PlanetMath entry analyticsandformallogicsinmetamathematics","url":"https://planetmath.org/analyticsandformallogicsinmetamathematics"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 53B21, 03G30, 03G20, 03B22, 01A60, 18-00, 03G30, 46M15, 03B22, 03B50, 03B15) states: This is a topic on meta-theories , metalogic and metamathematics founded in formal logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.anoutlineofhilbertsprogramme","kind":"concept","label":"An outline of Hilbert’s programme","sources":[{"id":"planetmath.anoutlineofhilbertsprogramme","title":"PlanetMath entry anoutlineofhilbertsprogramme","url":"https://planetmath.org/anoutlineofhilbertsprogramme"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: Contents: 1 Initial definitions. Formalism 2 The two senses of the term ”axiomatic” 3 Meaning is in the model 4 Finite and infinite models 5 Hilbert’s Ansatz 6 Finitist inference 7 The rules of induction and recursion 8 From meaning to logic 9 Negation and disjunction 10 The consistency problem 11 Metamathematics 12 Beyond Incompleteness 1 Initial definitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.chuspace","kind":"concept","label":"Chu space","sources":[{"id":"planetmath.chuspace","title":"PlanetMath entry chuspace","url":"https://planetmath.org/chuspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G99) states: A Chu space over a set Σ is a triple ( 𝒜 , r , 𝒳 ) with r : 𝒜 × 𝒳 → Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.elementaryrecursivefunction","kind":"concept","label":"Elementary recursive function","sources":[{"id":"planetmath.elementaryrecursivefunction","title":"PlanetMath entry elementaryrecursivefunction","url":"https://planetmath.org/elementaryrecursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: Informally, elementary recursive functions are functions that can be obtained from functions encountered in elementary schools: addition , multiplication , subtraction , and division , using basic operations such as substitutions and finite summation and product .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.freeandboundvariables","kind":"concept","label":"Free and bound variables","sources":[{"id":"planetmath.freeandboundvariables","title":"PlanetMath entry freeandboundvariables","url":"https://planetmath.org/freeandboundvariables"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In the entry first-order language ( http://planetmath.org/TermsAndFormulas ), I have mentioned the use of variables without mentioning what variables really are.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","kind":"concept","label":"Interpretation of intuitionistic logic by means of functionals","sources":[{"id":"planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","title":"PlanetMath entry interpretationofintuitionisticlogicbymeansoffunctionals","url":"https://planetmath.org/interpretationofintuitionisticlogicbymeansoffunctionals"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05, 03B20) states: Abstract The entry reports on the analysis of the concept of constructivity and in particular Gödel’s own stricto sensu constructivity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inversefunction","kind":"concept","label":"Inverse function","sources":[{"id":"planetmath.inversefunction","title":"PlanetMath entry inversefunction","url":"https://planetmath.org/inversefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 03E20) states: Definition Suppose f : X → Y is a function between sets X and Y , and suppose f - 1 : Y → X is a mapping that satisfies f - 1 ∘ f = id X , f ∘ f - 1 = id Y , where id A denotes the identity function on the set A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicism","kind":"concept","label":"Logicism","sources":[{"id":"planetmath.logicism","title":"PlanetMath entry logicism","url":"https://planetmath.org/logicism"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: In the literature on the foundations of mathematics logicism aims at proving that the propositions of pure mathematics can be derived from the propositions of logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.multivaluedfunction","kind":"concept","label":"Multivalued function","sources":[{"id":"planetmath.multivaluedfunction","title":"PlanetMath entry multivaluedfunction","url":"https://planetmath.org/multivaluedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let us recall that a function f from a set A to a set B is an assignment that takes each element of A to a unique element of B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.naturaldeduction","kind":"concept","label":"Natural deduction","sources":[{"id":"planetmath.naturaldeduction","title":"PlanetMath entry naturaldeduction","url":"https://planetmath.org/naturaldeduction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03) states: Natural deduction refers to related proof systems for several different kinds of logic, intended to be similar to the way people actually reason.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.operationsonrelations","kind":"concept","label":"Operations on relations","sources":[{"id":"planetmath.operationsonrelations","title":"PlanetMath entry operationsonrelations","url":"https://planetmath.org/operationsonrelations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A02, 03E20) states: Recall that an n -ary relation ( n > 0 ) is a subset of a product of some n sets.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.principleoffiniteinduction","kind":"theory","label":"Principle of finite induction","sources":[{"id":"planetmath.principleoffiniteinduction","title":"PlanetMath entry principleoffiniteinduction","url":"https://planetmath.org/principleoffiniteinduction"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25, 00-02) states: The principle of finite induction , also known as mathematical induction , is commonly formulated in two ways.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reducedautomaton","kind":"concept","label":"Reduced automaton","sources":[{"id":"planetmath.reducedautomaton","title":"PlanetMath entry reducedautomaton","url":"https://planetmath.org/reducedautomaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an automaton ? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reductioadabsurdum","kind":"concept","label":"Reductio ad absurdum","sources":[{"id":"planetmath.reductioadabsurdum","title":"PlanetMath entry reductioadabsurdum","url":"https://planetmath.org/reductioadabsurdum"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-01) states: Reductio ad Absurdum is a process of inference by means of which one can derive a proposition ¬ ⁢ X from the fact the the assumption of X leads to a contradiction .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semithuesystem","kind":"concept","label":"Semi-Thue system","sources":[{"id":"planetmath.semithuesystem","title":"PlanetMath entry semithuesystem","url":"https://planetmath.org/semithuesystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q42, 03D40, 20M35, 03D03) states: A semi-Thue system 𝔖 is a pair ( Σ , P ) where Σ is an alphabet and P is a non-empty finite binary relation on Σ * , the Kleene star of Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.sequent","kind":"concept","label":"Sequent","sources":[{"id":"planetmath.sequent","title":"PlanetMath entry sequent","url":"https://planetmath.org/sequent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03) states: A sequent represents a formal step in a proof. Typically it consists of two lists of formulas , one representing the premises and one the conclusions .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.setdifference","kind":"concept","label":"Set difference","sources":[{"id":"planetmath.setdifference","title":"PlanetMath entry setdifference","url":"https://planetmath.org/setdifference"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let A and B be sets. The set difference (or simply difference ) between A and B (in that order) is the set of all elements of A that are not in B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.signrelation","kind":"concept","label":"Sign relation","sources":[{"id":"planetmath.signrelation","title":"PlanetMath entry signrelation","url":"https://planetmath.org/signrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: A sign relation is a special type of triadic relation that arises in the use of signs to connote meanings and denote objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.theinclusionofclassicalintointuitionisticlogic","kind":"concept","label":"The inclusion of classical into intuitionistic logic","sources":[{"id":"planetmath.theinclusionofclassicalintointuitionisticlogic","title":"PlanetMath entry theinclusionofclassicalintointuitionisticlogic","url":"https://planetmath.org/theinclusionofclassicalintointuitionisticlogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B20, 03A05, 03-01) states: Abstract The entry is a report of Gödel’s 1933 first proof of the consistency of classical arithmetic by means of an interpretation of the basic concepts of intuitionistic logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.churchinteger","kind":"concept","label":"Church integer","sources":[{"id":"planetmath.churchinteger","title":"PlanetMath entry churchinteger","url":"https://planetmath.org/churchinteger"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40, 68N18) states: A Church integer is a representation of integers as functions , invented by Alonzo Church.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.comprehensionaxiom","kind":"concept","label":"Comprehension axiom","sources":[{"id":"planetmath.comprehensionaxiom","title":"PlanetMath entry comprehensionaxiom","url":"https://planetmath.org/comprehensionaxiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: The axiom of comprehension (CA) states that every formula defines a set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.paradox","kind":"concept","label":"Paradox","sources":[{"id":"planetmath.paradox","title":"PlanetMath entry paradox","url":"https://planetmath.org/paradox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03A05, 03B99) states: A paradox is an assertion that is apparently self-contradictory, though based on a valid deduction from acceptable premises .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polishnotation","kind":"concept","label":"Polish notation","sources":[{"id":"planetmath.polishnotation","title":"PlanetMath entry polishnotation","url":"https://planetmath.org/polishnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reversepolishnotation","kind":"concept","label":"Reverse Polish notation","sources":[{"id":"planetmath.reversepolishnotation","title":"PlanetMath entry reversepolishnotation","url":"https://planetmath.org/reversepolishnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cartesianproduct","kind":"concept","label":"Cartesian product","sources":[{"id":"planetmath.cartesianproduct","title":"PlanetMath entry cartesianproduct","url":"https://planetmath.org/cartesianproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 81P10, 81P05) states: For any sets A and B , the Cartesian product A × B is the set consisting of all ordered pairs ( a , b ) where a ∈ A and b ∈ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.indexingset","kind":"concept","label":"Indexing set","sources":[{"id":"planetmath.indexingset","title":"PlanetMath entry indexingset","url":"https://planetmath.org/indexingset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Let Λ and S be sets such that there exists a surjection f : Λ → S .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.indexset","kind":"concept","label":"Index set","sources":[{"id":"planetmath.indexset","title":"PlanetMath entry indexset","url":"https://planetmath.org/indexset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D25) states: In computability theory, a set A ⊆ ω is called an index set if for all x , y , x ∈ A , φ x = φ y ⟹ y ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pairwisedisjoint","kind":"concept","label":"Pairwise disjoint","sources":[{"id":"planetmath.pairwisedisjoint","title":"PlanetMath entry pairwisedisjoint","url":"https://planetmath.org/pairwisedisjoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Definition Suppose { E α ∣ α ∈ I } is an arbitrary collection of sets.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.bijection","kind":"concept","label":"Bijection","sources":[{"id":"planetmath.bijection","title":"PlanetMath entry bijection","url":"https://planetmath.org/bijection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 83-00, 81-00, 82-00) states: Let X and Y be sets. A function f : X → Y that is one-to-one and onto is called a bijection or bijective function from X to Y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderedtuplet","kind":"concept","label":"Ordered tuplet","sources":[{"id":"planetmath.orderedtuplet","title":"PlanetMath entry orderedtuplet","url":"https://planetmath.org/orderedtuplet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: The concept of ordered n -tuplet is the generalization of ordered pair to n items.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universalrelation","kind":"concept","label":"Universal relation","sources":[{"id":"planetmath.universalrelation","title":"PlanetMath entry universalrelation","url":"https://planetmath.org/universalrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: If Φ is a class of n -ary relations with x → as the only free variables , an n + 1 -ary formula ψ is universal for Φ if for any ϕ ∈ Φ there is some e such that ψ ⁢ ( e , x → ) ↔ ϕ ⁢ ( x → ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universalstructure","kind":"concept","label":"Universal structure","sources":[{"id":"planetmath.universalstructure","title":"PlanetMath entry universalstructure","url":"https://planetmath.org/universalstructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C50, 03C52) states: Let L be a first order language , and let R be an elementary class of L - structures .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ampheck","kind":"concept","label":"Ampheck","sources":[{"id":"planetmath.ampheck","title":"PlanetMath entry ampheck","url":"https://planetmath.org/ampheck"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05, 03-03, 01A55) states: Ampheck , from the Greek α ⁢ μ ⁢ ϕ ⁢ η ⁢ κ ⁢ η ⁢ ς , double-edged , is a term coined by Charles Sanders Peirce for either one of the pair of logically dual operators , variously referred to as Peirce arrows , Sheffer strokes , or logical NAND and logical NNOR.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.functionalcompleteness","kind":"concept","label":"Functional completeness","sources":[{"id":"planetmath.functionalcompleteness","title":"PlanetMath entry functionalcompleteness","url":"https://planetmath.org/functionalcompleteness"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Recall that in classical propositional logic , well-formed formulas (wffs) can be built up (recursively) from propositional variables via logical connectives .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.generalizedquantifier","kind":"concept","label":"Generalized quantifier","sources":[{"id":"planetmath.generalizedquantifier","title":"PlanetMath entry generalizedquantifier","url":"https://planetmath.org/generalizedquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C80, 03B15, 03B10) states: Generalized quantifiers are an abstract way of defining quantifiers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.secondorderlogic","kind":"concept","label":"Second order logic","sources":[{"id":"planetmath.secondorderlogic","title":"PlanetMath entry secondorderlogic","url":"https://planetmath.org/secondorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: Second order logic refers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or functions on those objects (or both, in the three type case).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.gametheoreticalquantifier","kind":"concept","label":"Game-theoretical quantifier","sources":[{"id":"planetmath.gametheoreticalquantifier","title":"PlanetMath entry gametheoreticalquantifier","url":"https://planetmath.org/gametheoreticalquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: A Henkin or branching quantifier is a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universeofdiscourse","kind":"concept","label":"Universe of discourse","sources":[{"id":"planetmath.universeofdiscourse","title":"PlanetMath entry universeofdiscourse","url":"https://planetmath.org/universeofdiscourse"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B48, 03B05, 03A05, 03G05) states: \\PMlinkescapephrase field \\PMlinkescapephrase Field \\PMlinkescapephrase limit \\PMlinkescapephrase Limit \\PMlinkescapephrase object \\PMlinkescapephrase Object \\PMlinkescapephrase objects \\PMlinkescapephrase Objects Boole (1854) defines universe of discourse in the following manner: In every discourse, whether of the mind conversing with its own thoughts, or of the individual in his intercourse with others, there is an assumed or expressed limit within which the subjects of its operation are confined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.characteristicfunction","kind":"concept","label":"Characteristic function","sources":[{"id":"planetmath.characteristicfunction","title":"PlanetMath entry characteristicfunction","url":"https://planetmath.org/characteristicfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 26-00, 26A09, 28-00) states: Definition Suppose A is a subset of a set X . Then the function χ A ⁢ ( x ) = { 1 , when ⁢ x ∈ A , 0 , when ⁢ x ∈ X ∖ A is the characteristic function for A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.standardenumeration","kind":"concept","label":"Standard enumeration","sources":[{"id":"planetmath.standardenumeration","title":"PlanetMath entry standardenumeration","url":"https://planetmath.org/standardenumeration"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45, 03B65) states: The standard enumeration of { 0 , 1 } * is the sequence of strings s 0 = λ , s 1 = 0 , s 2 = 1 , s 3 = 00 , s 4 = 01 , ⋯ in lexicographic order .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.triadicrelation","kind":"concept","label":"Triadic relation","sources":[{"id":"planetmath.triadicrelation","title":"PlanetMath entry triadicrelation","url":"https://planetmath.org/triadicrelation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: In logic, mathematics, and semiotics, a triadic relation is an important special case of a polyadic or finitary relation, one in which the number of places in the relation is three.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.randomvariable","kind":"concept","label":"Random variable","sources":[{"id":"planetmath.randomvariable","title":"PlanetMath entry randomvariable","url":"https://planetmath.org/randomvariable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 62-00, 60-00, 11R32, 03-01, 20B25) states: If ( Ω , 𝒜 , P ) is a probability space , then a random variable on Ω is a measurable function X : ( Ω , 𝒜 ) → S to a measurable space S (frequently taken to be the real numbers with the standard measure ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lengthofastring","kind":"concept","label":"Length of a string","sources":[{"id":"planetmath.lengthofastring","title":"PlanetMath entry lengthofastring","url":"https://planetmath.org/lengthofastring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Suppose we have a string w on alphabet Σ . We can then represent the string as w = x 1 ⁢ x 2 ⁢ x 3 ⁢ ⋯ ⁢ x n - 1 ⁢ x n , where for all x i ( 1 ≤ i ≤ n ), x i ∈ Σ (this means that each x i must be a “letter” from the alphabet).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.countable","kind":"concept","label":"Countable","sources":[{"id":"planetmath.countable","title":"PlanetMath entry countable","url":"https://planetmath.org/countable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A set S is countable if there exists a bijection between S and some subset of ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.countablyinfinite","kind":"concept","label":"Countably infinite","sources":[{"id":"planetmath.countablyinfinite","title":"PlanetMath entry countablyinfinite","url":"https://planetmath.org/countablyinfinite"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A set S is countably infinite if there is a bijection between S and ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pointedset","kind":"concept","label":"Pointed set","sources":[{"id":"planetmath.pointedset","title":"PlanetMath entry pointedset","url":"https://planetmath.org/pointedset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: 0.1 Definition A pointed set is an ordered pair ( A , a ) such that A is a set and a ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.analytichierarchy","kind":"concept","label":"Analytic hierarchy","sources":[{"id":"planetmath.analytichierarchy","title":"PlanetMath entry analytichierarchy","url":"https://planetmath.org/analytichierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: The analytic hierarchy is a hierarchy of either (depending on context ) formulas or relations similar to the arithmetical hierarchy .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleandomain","kind":"concept","label":"Boolean domain","sources":[{"id":"planetmath.booleandomain","title":"PlanetMath entry booleandomain","url":"https://planetmath.org/booleandomain"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68R01, 68Q01, 68P01, 03G05, 03C55, 03B05) states: \\PMlinkescapephrase generic \\PMlinkescapephrase Generic A Boolean domain 𝔹 is a generic 2-element set, say, 𝔹 = { 0 , 1 } , whose elements are interpreted as logical values, typically, 0 = false and 1 = true .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.paradoxofthebinarytree","kind":"concept","label":"Paradox of the binary tree","sources":[{"id":"planetmath.paradoxofthebinarytree","title":"PlanetMath entry paradoxofthebinarytree","url":"https://planetmath.org/paradoxofthebinarytree"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E75, 03E15) states: The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.treesettheoretic","kind":"concept","label":"Tree (set theoretic)","sources":[{"id":"planetmath.treesettheoretic","title":"PlanetMath entry treesettheoretic","url":"https://planetmath.org/treesettheoretic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E05) states: In a set , a tree is defined to be a set T and a relation < T ⊆ T × T such that: • < T is a partial ordering of T • For any t ∈ T , { s ∈ T ∣ s < T t } is well-ordered The nodes (elements of the tree) immediately greater than a node are termed its children , the node immediately less is its parent (if it exists), any node less is an ancestor and any node greater is a descendant .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanlattice","kind":"concept","label":"Boolean lattice","sources":[{"id":"planetmath.booleanlattice","title":"PlanetMath entry booleanlattice","url":"https://planetmath.org/booleanlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10, 06E20) states: In this entry, the notions of a Boolean lattice , a Boolean algebra , and a Boolean ring are defined, compared and contrasted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.shefferstroke","kind":"concept","label":"Sheffer stroke","sources":[{"id":"planetmath.shefferstroke","title":"PlanetMath entry shefferstroke","url":"https://planetmath.org/shefferstroke"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In the late 19th century and early 20th century, Charles Sanders Peirce and H.M.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.symmetricdifference","kind":"concept","label":"Symmetric difference","sources":[{"id":"planetmath.symmetricdifference","title":"PlanetMath entry symmetricdifference","url":"https://planetmath.org/symmetricdifference"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: The symmetric difference between two sets A and B , written A ⁢ △ ⁢ B , is the set of all x such that either x ∈ A or x ∈ B but not both.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.exclusiveor","kind":"concept","label":"Exclusive or","sources":[{"id":"planetmath.exclusiveor","title":"PlanetMath entry exclusiveor","url":"https://planetmath.org/exclusiveor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: The logical operator xor, short for “ exclusive or ”, is a binary operator that is true iff exactly one of its parameters is true, and thus corresponds to the normal use of “or” in English.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.forcing","kind":"concept","label":"Forcing","sources":[{"id":"planetmath.forcing","title":"PlanetMath entry forcing","url":"https://planetmath.org/forcing"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E50, 03E35, 03E40) states: Forcing is the method used by Paul Cohen to prove the independence of the continuum hypothesis (CH).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalenceclass","kind":"concept","label":"Equivalence class","sources":[{"id":"planetmath.equivalenceclass","title":"PlanetMath entry equivalenceclass","url":"https://planetmath.org/equivalenceclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 93D05, 03B52, 93C42) states: Let S be a set with an equivalence relation ∼ . An equivalence class of S under ∼ is a subset T ⊂ S such that • If x ∈ T and y ∈ S , then x ∼ y if and only if y ∈ T • If S is nonempty, then T is nonempty For x ∈ S , the equivalence class containing x is often denoted by [ x ] , so that [ x ] := { y ∈ S ∣ x ∼ y } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polyadicalgebrawithequality","kind":"concept","label":"Polyadic algebra with equality","sources":[{"id":"planetmath.polyadicalgebrawithequality","title":"PlanetMath entry polyadicalgebrawithequality","url":"https://planetmath.org/polyadicalgebrawithequality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: Let A = ( B , V , ∃ , S ) be a polyadic algebra . An equality predicate on A is a function E : V × V → B such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reflexiverelation","kind":"concept","label":"Reflexive relation","sources":[{"id":"planetmath.reflexiverelation","title":"PlanetMath entry reflexiverelation","url":"https://planetmath.org/reflexiverelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is reflexive if and only if a ⁢ ℛ ⁢ a for all a ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.symmetricrelation","kind":"concept","label":"Symmetric relation","sources":[{"id":"planetmath.symmetricrelation","title":"PlanetMath entry symmetricrelation","url":"https://planetmath.org/symmetricrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is symmetric if and only if whenever x ⁢ ℛ ⁢ y for some x , y ∈ A then also y ⁢ ℛ ⁢ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transitiverelation","kind":"concept","label":"Transitive relation","sources":[{"id":"planetmath.transitiverelation","title":"PlanetMath entry transitiverelation","url":"https://planetmath.org/transitiverelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is transitive if and only if ∀ x , y , z ∈ A , ( x ⁢ ℛ ⁢ y ∧ y ⁢ ℛ ⁢ z ) → ( x ⁢ ℛ ⁢ z ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.atomicformula","kind":"concept","label":"Atomic formula","sources":[{"id":"planetmath.atomicformula","title":"PlanetMath entry atomicformula","url":"https://planetmath.org/atomicformula"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99, 03B10) states: Let Σ be a signature and T ⁢ ( Σ ) the set of terms over Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.disjointunion","kind":"concept","label":"Disjoint union","sources":[{"id":"planetmath.disjointunion","title":"PlanetMath entry disjointunion","url":"https://planetmath.org/disjointunion"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Disjoint union of two sets Let A and B be sets. Then their disjoint union is the union A ⁢ ∐ B := A ∪ ( B × { ⋆ } ) , where ⋆ is an object chosen so that A and B × { ⋆ } are disjoint .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inclusionmapping","kind":"concept","label":"Inclusion mapping","sources":[{"id":"planetmath.inclusionmapping","title":"PlanetMath entry inclusionmapping","url":"https://planetmath.org/inclusionmapping"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let X be a subset of Y . Then the inclusion map from X to Y is the mapping ι : X → Y x ↦ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.deductivesystem","kind":"concept","label":"Deductive system","sources":[{"id":"planetmath.deductivesystem","title":"PlanetMath entry deductivesystem","url":"https://planetmath.org/deductivesystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03F03, 03B99, 03B22) states: Introduction A deductive system is a formal (mathematical) setup of reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.simplifiedautomaton","kind":"concept","label":"Simplified automaton","sources":[{"id":"planetmath.simplifiedautomaton","title":"PlanetMath entry simplifiedautomaton","url":"https://planetmath.org/simplifiedautomaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Word acceptance is the primary function of an automaton .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contrapositive","kind":"concept","label":"Contrapositive","sources":[{"id":"planetmath.contrapositive","title":"PlanetMath entry contrapositive","url":"https://planetmath.org/contrapositive"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Given an implication of the form p ⟹ q (“p implies q”) the contrapositive of this implication is ¬ ⁢ q ⟹ ¬ ⁢ p (“not q implies not p”).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstordertheory","kind":"concept","label":"First-order theory","sources":[{"id":"planetmath.firstordertheory","title":"PlanetMath entry firstordertheory","url":"https://planetmath.org/firstordertheory"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In what follows, references to sentences and sets of sentences are all relative to some fixed first-order language L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hypostaticabstraction","kind":"concept","label":"Hypostatic abstraction","sources":[{"id":"planetmath.hypostaticabstraction","title":"PlanetMath entry hypostaticabstraction","url":"https://planetmath.org/hypostaticabstraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B42, 03B30, 03B22, 03B15, 03A05, 00A30) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase contain \\PMlinkescapephrase Contain \\PMlinkescapephrase contains \\PMlinkescapephrase Contains \\PMlinkescapephrase occur \\PMlinkescapephrase occurs \\PMlinkescapephrase occur in \\PMlinkescapephrase occur ins \\PMlinkescapephrase occurs in \\PMlinkescapephrase occurs ins \\PMlinkescapephrase trace \\PMlinkescapephrase Trace \\PMlinkescapephrase variety \\PMlinkescapephrase Variety Hypostatic abstraction is a formal operation that takes an element of information, as expressed in a proposition X ⁢ is ⁡ Y , and conceives its information to consist in the relation between that subject and another subject, as expressed in the proposition X ⁢ has ⁡ Y ⁢ - ness .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substitutability","kind":"concept","label":"Substitutability","sources":[{"id":"planetmath.substitutability","title":"PlanetMath entry substitutability","url":"https://planetmath.org/substitutability"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10, 03B05) states: In any logical system , the way to obtain (well-formed) formulas from existing ones is by attaching logical connectives to existing ones.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inductiveset","kind":"concept","label":"Inductive set","sources":[{"id":"planetmath.inductiveset","title":"PlanetMath entry inductiveset","url":"https://planetmath.org/inductiveset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 45D05) states: An inductive set is a set X with the property that, for every x ∈ X , the successor x ′ of x is also an element of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.uniquereadabilityofwellformedformulas","kind":"theory","label":"Unique readability of well-formed formulas","sources":[{"id":"planetmath.uniquereadabilityofwellformedformulas","title":"PlanetMath entry uniquereadabilityofwellformedformulas","url":"https://planetmath.org/uniquereadabilityofwellformedformulas"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B05) states: Suppose V is an alphabet . Two words w 1 and w 2 over V are the same if they have the same length and same symbol for every position of the word.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.additive","kind":"concept","label":"Additive","sources":[{"id":"planetmath.additive","title":"PlanetMath entry additive","url":"https://planetmath.org/additive"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let ϕ be some positive-valued set function defined on an algebra of sets 𝒜 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismbetweenpartialalgebras","kind":"concept","label":"Homomorphism between partial algebras","sources":[{"id":"planetmath.homomorphismbetweenpartialalgebras","title":"PlanetMath entry homomorphismbetweenpartialalgebras","url":"https://planetmath.org/homomorphismbetweenpartialalgebras"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition Like subalgebras of partial algebras , there are also three ways to define homomorphisms between partial algebras .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semiautomatonhomomorphism","kind":"concept","label":"Semiautomaton homomorphism","sources":[{"id":"planetmath.semiautomatonhomomorphism","title":"PlanetMath entry semiautomatonhomomorphism","url":"https://planetmath.org/semiautomatonhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45, 20M35, 03D05, 68Q70) states: Just like groups and rings, a semiautomaton can be viewed as an algebraic structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inversestatement","kind":"concept","label":"Inverse statement","sources":[{"id":"planetmath.inversestatement","title":"PlanetMath entry inversestatement","url":"https://planetmath.org/inversestatement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Let a statement be of the form of an implication If p , then q i.e.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cofinality","kind":"concept","label":"Cofinality","sources":[{"id":"planetmath.cofinality","title":"PlanetMath entry cofinality","url":"https://planetmath.org/cofinality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E04) states: Definitions Let ( P , ≤ ) be a poset. A subset A ⊆ P is said to be cofinal in P if for every x ∈ P there is a y ∈ A such that x ≤ y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.computablenumber","kind":"concept","label":"Computable number","sources":[{"id":"planetmath.computablenumber","title":"PlanetMath entry computablenumber","url":"https://planetmath.org/computablenumber"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03D25, 68Q05) states: A real number r is called computable if there exists some terminating algorithm (or Turing machine ) that can approximate it to arbitrary precision.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.endpoint","kind":"concept","label":"Endpoint","sources":[{"id":"planetmath.endpoint","title":"PlanetMath entry endpoint","url":"https://planetmath.org/endpoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51-00, 03-00) states: An endpoint of a line segment L is a point that belongs to the boundary of L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.linesegment","kind":"concept","label":"Line segment","sources":[{"id":"planetmath.linesegment","title":"PlanetMath entry linesegment","url":"https://planetmath.org/linesegment"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 51-00) states: Definition Suppose V is a vector space over ℝ or ℂ , and L is a subset of V .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofcountablechoice","kind":"concept","label":"Axiom of countable choice","sources":[{"id":"planetmath.axiomofcountablechoice","title":"PlanetMath entry axiomofcountablechoice","url":"https://planetmath.org/axiomofcountablechoice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E25) states: The Axiom of Countable Choice (CC) is a weak form of the Axiom of Choice ( http://planetmath.org/AxiomOfChoice ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.rationalnumber","kind":"concept","label":"Rational number","sources":[{"id":"planetmath.rationalnumber","title":"PlanetMath entry rationalnumber","url":"https://planetmath.org/rationalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B30, 11A99, 03E99) states: The rational numbers ℚ are the fraction field of the ring ℤ of integers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fixtransformationaction","kind":"concept","label":"Fix (transformation action)","sources":[{"id":"planetmath.fixtransformationaction","title":"PlanetMath entry fixtransformationaction","url":"https://planetmath.org/fixtransformationaction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transformation","kind":"concept","label":"Transformation","sources":[{"id":"planetmath.transformation","title":"PlanetMath entry transformation","url":"https://planetmath.org/transformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Synonym of mapping and function . Often used to refer to mappings where the domain and codomain are the same set, i.e.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.identitymap","kind":"concept","label":"Identity map","sources":[{"id":"planetmath.identitymap","title":"PlanetMath entry identitymap","url":"https://planetmath.org/identitymap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition If X is a set, then the identity map in X is the mapping that maps each element in X to itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.peanoarithmetic","kind":"concept","label":"Peano arithmetic","sources":[{"id":"planetmath.peanoarithmetic","title":"PlanetMath entry peanoarithmetic","url":"https://planetmath.org/peanoarithmetic"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03F30) states: Peano’s axioms are a definition of the set of natural numbers, denoted ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.successor","kind":"concept","label":"Successor","sources":[{"id":"planetmath.successor","title":"PlanetMath entry successor","url":"https://planetmath.org/successor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10, 70K75) states: Given a set S , the successor of S is the set S ∪ { S } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.vonneumannordinal","kind":"concept","label":"Von Neumann ordinal","sources":[{"id":"planetmath.vonneumannordinal","title":"PlanetMath entry vonneumannordinal","url":"https://planetmath.org/vonneumannordinal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: The is a method of defining ordinals in set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ruleofproduct","kind":"concept","label":"Rule of product","sources":[{"id":"planetmath.ruleofproduct","title":"PlanetMath entry ruleofproduct","url":"https://planetmath.org/ruleofproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05A05, 03-00) states: If a process A can have altogether m different results and another process B altogether n different results, then the two processes can have altogether m ⁢ n different combined results.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transposition","kind":"concept","label":"Transposition","sources":[{"id":"planetmath.transposition","title":"PlanetMath entry transposition","url":"https://planetmath.org/transposition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Given a finite set X = { a 1 , a 2 , … , a n } , a transposition is a permutation ( bijective function of X onto itself) f such that there exist indices i , j such that f ⁢ ( a i ) = a j , f ⁢ ( a j ) = a i and f ⁢ ( a k ) = a k for all other indices k .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.directproductofpartialalgebras","kind":"concept","label":"Direct product of partial algebras","sources":[{"id":"planetmath.directproductofpartialalgebras","title":"PlanetMath entry directproductofpartialalgebras","url":"https://planetmath.org/directproductofpartialalgebras"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 08A62, 03E99) states: Let 𝑨 and 𝑩 be two partial algebraic systems of type τ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.club","kind":"concept","label":"Club","sources":[{"id":"planetmath.club","title":"PlanetMath entry club","url":"https://planetmath.org/club"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: If κ is a cardinal then a set C ⊆ κ is closed iff for any S ⊆ C and α < κ , sup ⁡ ( S ∩ α ) = α then α ∈ C .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.preservationandreflection","kind":"concept","label":"Preservation and reflection","sources":[{"id":"planetmath.preservationandreflection","title":"PlanetMath entry preservationandreflection","url":"https://planetmath.org/preservationandreflection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A35) states: In mathematics, the word “preserve” usually means the “preservation of properties”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationalsystem","kind":"concept","label":"Relational system","sources":[{"id":"planetmath.relationalsystem","title":"PlanetMath entry relationalsystem","url":"https://planetmath.org/relationalsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03C07, 08A02) states: A relational system , loosely speaking, is a pair ( A , R ) where A is a set and R is a set of finitary relations defined on A (a finitary relation is just an n -ary relation where n ∈ ℕ ; when n = 1 , it is called a property ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","kind":"concept","label":"Topic entry on the algebraic foundations of mathematics","sources":[{"id":"planetmath.topicentryonthealgebraicfoundationsofmathematics","title":"PlanetMath entry topicentryonthealgebraicfoundationsofmathematics","url":"https://planetmath.org/topicentryonthealgebraicfoundationsofmathematics"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 08A99, 08A70, 18E05, 18-00, 03-00, 08A05) states: This is a contributed topic on the algebraic foundations of mathematics .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.comparisonoffilters","kind":"concept","label":"Comparison of filters","sources":[{"id":"planetmath.comparisonoffilters","title":"PlanetMath entry comparisonoffilters","url":"https://planetmath.org/comparisonoffilters"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99, 03E99) states: Let 𝔽 1 and 𝔽 2 be two filters on the same set. The following terminology is commonly used to describe the relation of 𝔽 1 to 𝔽 2 : 𝔽 2 is said to be finer than 𝔽 1 if 𝔽 1 ⊆ 𝔽 2 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.partialalgebraicsystem","kind":"concept","label":"Partial algebraic system","sources":[{"id":"planetmath.partialalgebraicsystem","title":"PlanetMath entry partialalgebraicsystem","url":"https://planetmath.org/partialalgebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 08A55, 08A62) states: Let λ be a cardinal . A partial function f : A λ → A is called a partial operation on A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.selector","kind":"concept","label":"Selector","sources":[{"id":"planetmath.selector","title":"PlanetMath entry selector","url":"https://planetmath.org/selector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E25) states: Let S be a collection of sets. A selector of S is by definition a set { f ⁢ ( R ) | R ∈ S } where f is a choice function on S (that is f ⁢ ( R ) ∈ R ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.completelattice","kind":"concept","label":"Complete lattice","sources":[{"id":"planetmath.completelattice","title":"PlanetMath entry completelattice","url":"https://planetmath.org/completelattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B23, 03G10) states: Complete lattices A complete lattice is a poset P such that every subset of P has both a supremum and an infimum in P .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.chomskyhierarchy","kind":"concept","label":"Chomsky hierarchy","sources":[{"id":"planetmath.chomskyhierarchy","title":"PlanetMath entry chomskyhierarchy","url":"https://planetmath.org/chomskyhierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q15, 03D55) states: The Chomsky hierarchy or Chomsky-Schützenberger hierarchy is a way of classifying formal grammars into four types, with the lower numbered types being more general.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cumulativehierarchy","kind":"concept","label":"Cumulative hierarchy","sources":[{"id":"planetmath.cumulativehierarchy","title":"PlanetMath entry cumulativehierarchy","url":"https://planetmath.org/cumulativehierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: The cumulative hierarchy of sets is defined by transfinite recursion as follows: we define V 0 = ∅ and for each ordinal α we define V α + 1 = 𝒫 ⁢ ( V α ) and for each limit ordinal δ we define V δ = ⋃ α ∈ δ V α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equationalclass","kind":"concept","label":"Equational class","sources":[{"id":"planetmath.equationalclass","title":"PlanetMath entry equationalclass","url":"https://planetmath.org/equationalclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08B99, 03C05) states: Let K be a class of algebraic systems of the same type.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lawoftrichotomy","kind":"concept","label":"Law of trichotomy","sources":[{"id":"planetmath.lawoftrichotomy","title":"PlanetMath entry lawoftrichotomy","url":"https://planetmath.org/lawoftrichotomy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A05, 03E20) states: The law of trichotomy for a binary relation R on a set S is the property that • for all x , y ∈ S , exactly one of the following holds: x ⁢ R ⁢ y or y ⁢ R ⁢ x or x = y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pa","kind":"concept","label":"PA","sources":[{"id":"planetmath.pa","title":"PlanetMath entry pa","url":"https://planetmath.org/pa"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F30) states: (PA) is the restriction of Peano’s axioms to a first order theory of .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.predicativism","kind":"concept","label":"Predicativism","sources":[{"id":"planetmath.predicativism","title":"PlanetMath entry predicativism","url":"https://planetmath.org/predicativism"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05) states: Predicativism Contents: 1 Initial definitions 2 The vicious circle principle 3 The scope of the vicious circle principle 4 Russell’s threefold formulation in Principia mathematica 5 Predicative reasoning in the ramified theory of types 6 Towards the predicative concept of set 7 Predicative philosophy of mathematics 1 Initial definitions In the literature on the foundations of mathematics the range of the concept predicativism is formulated in two divergent formulations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursiveset","kind":"concept","label":"Recursive set","sources":[{"id":"planetmath.recursiveset","title":"PlanetMath entry recursiveset","url":"https://planetmath.org/recursiveset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B25, 03D20) states: A subset S of the natural numbers ℕ is said to be recursive if its characteristic function χ S ⁢ ( x ) := { 1 if ⁢ x ∈ S 0 if ⁢ x ∈ ℕ - S is recursive ( computable ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.transfiniteinduction","kind":"theory","label":"Transfinite induction","sources":[{"id":"planetmath.transfiniteinduction","title":"PlanetMath entry transfiniteinduction","url":"https://planetmath.org/transfiniteinduction"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B10) states: Suppose Φ ⁢ ( α ) is a property defined for every ordinal α , the principle of transfinite induction states that in the case where for every α , if the fact that Φ ⁢ ( β ) is true for every β < α implies that Φ ⁢ ( α ) is true, then Φ ⁢ ( α ) is true for every ordinal α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.consequenceoperator","kind":"concept","label":"Consequence operator","sources":[{"id":"planetmath.consequenceoperator","title":"PlanetMath entry consequenceoperator","url":"https://planetmath.org/consequenceoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G25, 03G10, 03B22) states: 1 Definition Let L be a set. A consequence operator on L is a mapping 1 1 Here, “ 𝒫 ” denotes the power set and ℱ denotes the finite power set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quotientstructure","kind":"concept","label":"Quotient structure","sources":[{"id":"planetmath.quotientstructure","title":"PlanetMath entry quotientstructure","url":"https://planetmath.org/quotientstructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , 𝔄 a structure for Σ , and ∼ a congruence on 𝔄 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.foundationsofmathematicsoverview","kind":"concept","label":"Foundations of mathematics: overview","sources":[{"id":"planetmath.foundationsofmathematicsoverview","title":"PlanetMath entry foundationsofmathematicsoverview","url":"https://planetmath.org/foundationsofmathematicsoverview"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05) states: The term ’ foundations of mathematics ’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.invariant","kind":"concept","label":"Invariant","sources":[{"id":"planetmath.invariant","title":"PlanetMath entry invariant","url":"https://planetmath.org/invariant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanideal","kind":"concept","label":"Boolean ideal","sources":[{"id":"planetmath.booleanideal","title":"PlanetMath entry booleanideal","url":"https://planetmath.org/booleanideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G05, 03G10) states: Let A be a Boolean algebra and B a subset of A . The following are equivalent : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.congruence12","kind":"concept","label":"Congruence","sources":[{"id":"planetmath.congruence12","title":"PlanetMath entry congruence12","url":"https://planetmath.org/congruence12"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , and 𝔄 a structure for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.congruenceonapartialalgebra","kind":"concept","label":"Congruence on a partial algebra","sources":[{"id":"planetmath.congruenceonapartialalgebra","title":"PlanetMath entry congruenceonapartialalgebra","url":"https://planetmath.org/congruenceonapartialalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition There are two types of congruences on a partial algebra 𝑨 , both are special types of a certain equivalence relation on A : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.linearlyordered","kind":"concept","label":"Linearly ordered","sources":[{"id":"planetmath.linearlyordered","title":"PlanetMath entry linearlyordered","url":"https://planetmath.org/linearlyordered"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: An ordering ≤ (or < ) of A is called linear or total if any two elements of A are comparable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.transfiniterecursion","kind":"theory","label":"Transfinite recursion","sources":[{"id":"planetmath.transfiniterecursion","title":"PlanetMath entry transfiniterecursion","url":"https://planetmath.org/transfiniterecursion"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E45, 03E10) states: Transfinite recursion , roughly speaking, is a statement about the ability to define a function recursively using transfinite induction .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inverseimage","kind":"concept","label":"Inverse image","sources":[{"id":"planetmath.inverseimage","title":"PlanetMath entry inverseimage","url":"https://planetmath.org/inverseimage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 46L05, 82-00, 83-00, 81-00) states: Let f : A ⟶ B be a function , and let U ⊂ B be a subset. The inverse image of U is the set f - 1 ⁢ ( U ) ⊂ A consisting of all elements a ∈ A such that f ⁢ ( a ) ∈ U .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","kind":"concept","label":"Similarity and analogous systems: dynamic adjointness and topological equivalence","sources":[{"id":"planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","title":"PlanetMath entry similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","url":"https://planetmath.org/similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C98, 18-00, 37F99, 37F05, 03D80, 03D15, 03C52, 18A40) states: \\xyoption curve 0.1 Dynamic Adjointness, Similarity and Analogous Systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.gentzensystem","kind":"concept","label":"Gentzen system","sources":[{"id":"planetmath.gentzensystem","title":"PlanetMath entry gentzensystem","url":"https://planetmath.org/gentzensystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03F07, 03F03, 03B99, 03F05) states: Introduction A Gentzen system , attributed to the German logician Gerhard Gentzen, is a variant form of a deductive system .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.maximalelement","kind":"concept","label":"Maximal element","sources":[{"id":"planetmath.maximalelement","title":"PlanetMath entry maximalelement","url":"https://planetmath.org/maximalelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E04) states: Let ≤ be an ordering on a set S , and let A ⊆ S . Then, with respect to the ordering ≤ , • a ∈ A is the least element of A if a ≤ x , for all x ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.arrowsrelation","kind":"concept","label":"Arrows relation","sources":[{"id":"planetmath.arrowsrelation","title":"PlanetMath entry arrowsrelation","url":"https://planetmath.org/arrowsrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05A18, 03E05) states: Let [ X ] α = { Y ⊆ X ∣ | Y | = α } , that is, the set of subsets of X of size α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.homogeneous","kind":"concept","label":"Homogeneous","sources":[{"id":"planetmath.homogeneous","title":"PlanetMath entry homogeneous","url":"https://planetmath.org/homogeneous"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C50) states: Let L be a first order language . Let M be an L - structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.boundedcomplete","kind":"concept","label":"Bounded complete","sources":[{"id":"planetmath.boundedcomplete","title":"PlanetMath entry boundedcomplete","url":"https://planetmath.org/boundedcomplete"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A12, 06B23, 03G10) states: Let P be a poset. Recall that a subset S of P is called bounded from above if there is an element a ∈ P such that, for every s ∈ S , s ≤ a .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.infinitesimal","kind":"concept","label":"Infinitesimal","sources":[{"id":"planetmath.infinitesimal","title":"PlanetMath entry infinitesimal","url":"https://planetmath.org/infinitesimal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03H05, 06F25, 03C64) states: Let R be a real closed field, for example the reals thought of as a structure in L , the language of ordered rings .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cantorsdiagonalargument","kind":"concept","label":"Cantor’s diagonal argument","sources":[{"id":"planetmath.cantorsdiagonalargument","title":"PlanetMath entry cantorsdiagonalargument","url":"https://planetmath.org/cantorsdiagonalargument"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: One of the starting points in Cantor’s development of set theory was his discovery that there are different degrees of infinity .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.evennumber","kind":"concept","label":"Even number","sources":[{"id":"planetmath.evennumber","title":"PlanetMath entry evennumber","url":"https://planetmath.org/evennumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11-00, 03-00) states: Definition Suppose k is an integer . If there exists an integer r such that k = 2 ⁢ r + 1 , then k is an odd number .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.binomialtheorem","kind":"theory","label":"Binomial theorem","sources":[{"id":"planetmath.binomialtheorem","title":"PlanetMath entry binomialtheorem","url":"https://planetmath.org/binomialtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 11B65, 06F25, 03E20) states: The binomial theorem is a formula for the expansion of ( a + b ) n , for n a positive integer and a and b any two real (or complex) numbers, into a sum of powers of a and b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.markovalgorithm","kind":"concept","label":"Markov algorithm","sources":[{"id":"planetmath.markovalgorithm","title":"PlanetMath entry markovalgorithm","url":"https://planetmath.org/markovalgorithm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10) states: Definition A Markov algorithm is a variant of a rewriting system , invented by mathematician Andrey Andreevich Markov Jr.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.postsystem","kind":"concept","label":"Post system","sources":[{"id":"planetmath.postsystem","title":"PlanetMath entry postsystem","url":"https://planetmath.org/postsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q42, 03D03) states: Introduction A Post canonical system (or Post system for short) 𝔓 is a triple ( Σ , X , P ) , such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pairingfunction","kind":"concept","label":"Pairing function","sources":[{"id":"planetmath.pairingfunction","title":"PlanetMath entry pairingfunction","url":"https://planetmath.org/pairingfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: A pairing function is a function P : ℤ + 2 → ℤ + which establishes a one-to-one correspondence between ℤ + 2 and ℤ + .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ackermannfunction","kind":"concept","label":"Ackermann function","sources":[{"id":"planetmath.ackermannfunction","title":"PlanetMath entry ackermannfunction","url":"https://planetmath.org/ackermannfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D75) states: Ackermann’s function A ⁢ ( x , y ) is defined by the recurrence relations A ⁢ ( 0 , y ) = y + 1 A ⁢ ( x + 1 , 0 ) = A ⁢ ( x , 1 ) A ⁢ ( x + 1 , y + 1 ) = A ⁢ ( x , A ⁢ ( x + 1 , y ) ) Ackermann’s function is an example of a recursive function that is not primitive recursive , but is instead μ - recursive (that is, Turing-computable ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","kind":"theory","label":"Deduction theorem holds for classical propositional logic","sources":[{"id":"planetmath.deductiontheoremholdsforclassicalpropositionallogic","title":"PlanetMath entry deductiontheoremholdsforclassicalpropositionallogic","url":"https://planetmath.org/deductiontheoremholdsforclassicalpropositionallogic"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03F03, 03B99, 03B22) states: In this entry, we prove that the deduction theorem holds for classical propositional logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inductionaxiom","kind":"concept","label":"Induction axiom","sources":[{"id":"planetmath.inductionaxiom","title":"PlanetMath entry inductionaxiom","url":"https://planetmath.org/inductionaxiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: An induction axiom specifies that a theory includes induction , possibly restricted to specific formulas .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pointwise","kind":"concept","label":"Pointwise","sources":[{"id":"planetmath.pointwise","title":"PlanetMath entry pointwise","url":"https://planetmath.org/pointwise"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 08-00) states: When concepts (properties, operations , etc.) on a set Y are extended to functions f : X ⟶ Y by treating each function value f ⁢ ( x ) in isolation, the extended concept is often qualified with the word pointwise .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.commutativityrelationinanorthocomplementedlattice","kind":"concept","label":"Commutativity relation in an orthocomplemented lattice","sources":[{"id":"planetmath.commutativityrelationinanorthocomplementedlattice","title":"PlanetMath entry commutativityrelationinanorthocomplementedlattice","url":"https://planetmath.org/commutativityrelationinanorthocomplementedlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06C15, 03G12) states: Let L be an orthocomplemented lattice with a , b ∈ L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orthomodularlattice","kind":"concept","label":"Orthomodular lattice","sources":[{"id":"planetmath.orthomodularlattice","title":"PlanetMath entry orthomodularlattice","url":"https://planetmath.org/orthomodularlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06C15, 81P10, 03G12) states: Orthogonality Relations Let L be an orthocomplemented lattice and a , b ∈ L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.noncommutativedynamicmodelingdiagrams","kind":"concept","label":"Non-commutative dynamic modeling diagrams","sources":[{"id":"planetmath.noncommutativedynamicmodelingdiagrams","title":"PlanetMath entry noncommutativedynamicmodelingdiagrams","url":"https://planetmath.org/noncommutativedynamicmodelingdiagrams"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C98, 03C52, 18-00, 03D80, 03D15) states: \\xyoption curve 0.1 Introduction In an interesting report, Rosen(1987) showed that complex dynamical systems , such as biological organisms, cannot be adequately modelled through a commutative modelling diagram – in the sense of digital computer simulation –whereas the simple (‘physical’/ engineering) dynamical systems can be thus numerically simulated.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofextensionality","kind":"concept","label":"Axiom of extensionality","sources":[{"id":"planetmath.axiomofextensionality","title":"PlanetMath entry axiomofextensionality","url":"https://planetmath.org/axiomofextensionality"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: If X and Y have the same elements , then X = Y . The Axiom of Extensionality is one of the axioms of Zermelo-Fraenkel set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fuzzysubset","kind":"concept","label":"Fuzzy subset","sources":[{"id":"planetmath.fuzzysubset","title":"PlanetMath entry fuzzysubset","url":"https://planetmath.org/fuzzysubset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E72, 03G20) states: Fuzzy set theory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modelsconstructedfromconstants","kind":"concept","label":"Models constructed from constants","sources":[{"id":"planetmath.modelsconstructedfromconstants","title":"PlanetMath entry modelsconstructedfromconstants","url":"https://planetmath.org/modelsconstructedfromconstants"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: The definition of a structure and of the satisfaction relation is nice, but it raises the following question : how do we get models in the first place? The most basic construction for models of first-order theory is the construction that uses constants .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.boundedminimization","kind":"concept","label":"Bounded minimization","sources":[{"id":"planetmath.boundedminimization","title":"PlanetMath entry boundedminimization","url":"https://planetmath.org/boundedminimization"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: One useful way of generating more primitive recursive functions from existing ones is through what is known as bounded summation and bounded product .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subformula","kind":"concept","label":"Subformula","sources":[{"id":"planetmath.subformula","title":"PlanetMath entry subformula","url":"https://planetmath.org/subformula"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let L be a first order language and suppose φ is a formula of L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.inversefunctiontheorem","kind":"theory","label":"Inverse function theorem","sources":[{"id":"planetmath.inversefunctiontheorem","title":"PlanetMath entry inversefunctiontheorem","url":"https://planetmath.org/inversefunctiontheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E20) states: Let 𝐟 be a continuously differentiable , vector-valued function mapping the open set E ⊂ ℝ n to ℝ n and let S = 𝐟 ⁢ ( E ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationcomposition","kind":"concept","label":"Relation composition","sources":[{"id":"planetmath.relationcomposition","title":"PlanetMath entry relationcomposition","url":"https://planetmath.org/relationcomposition"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 68R01, 68P15, 08A02, 05C65, 05B30, 05B20, 03E20, 03B10) states: Relation composition , or the composition of relations , is the generalization of function composition, or the composition of functions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.zermeloswellorderingtheorem","kind":"theory","label":"Zermelo’s well-ordering theorem","sources":[{"id":"planetmath.zermeloswellorderingtheorem","title":"PlanetMath entry zermeloswellorderingtheorem","url":"https://planetmath.org/zermeloswellorderingtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25) states: If X is any set whatsoever, then there exists a well-ordering of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.constructingautomatafromregularlanguages","kind":"concept","label":"Constructing automata from regular languages","sources":[{"id":"planetmath.constructingautomatafromregularlanguages","title":"PlanetMath entry constructingautomatafromregularlanguages","url":"https://planetmath.org/constructingautomatafromregularlanguages"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: In this entry, we describe how a certain equivalence relation on words gives rise to a deterministic automaton , and show that deterministic automata to a certain extent can be characterized by these equivalence relations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.stronglyminimal","kind":"concept","label":"Strongly minimal","sources":[{"id":"planetmath.stronglyminimal","title":"PlanetMath entry stronglyminimal","url":"https://planetmath.org/stronglyminimal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03C10, 03C45) states: Let L be a first order language and let M be an L - structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.metalanguage","kind":"concept","label":"Metalanguage","sources":[{"id":"planetmath.metalanguage","title":"PlanetMath entry metalanguage","url":"https://planetmath.org/metalanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: A remedy for Berry’s Paradox and related paradoxes is to separate the language used to formulate a particular mathematical theory from the language used for its discourse.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semioticequivalencerelation","kind":"concept","label":"Semiotic equivalence relation","sources":[{"id":"planetmath.semioticequivalencerelation","title":"PlanetMath entry semioticequivalencerelation","url":"https://planetmath.org/semioticequivalencerelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 94A05, 03G15, 03E20, 03B42, 03B10, 94A15) states: Note. The intended forms of the Tables are visible only in the Page Image view.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.specialelementsinarelationalgebra","kind":"concept","label":"Special elements in a relation algebra","sources":[{"id":"planetmath.specialelementsinarelationalgebra","title":"PlanetMath entry specialelementsinarelationalgebra","url":"https://planetmath.org/specialelementsinarelationalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: Let A be a relation algebra with operators ( ∨ , ∧ , ; , ′ , - , 0 , 1 , i ) of type ( 2 , 2 , 2 , 1 , 1 , 0 , 0 , 0 ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomschemaofseparation","kind":"concept","label":"Axiom schema of separation","sources":[{"id":"planetmath.axiomschemaofseparation","title":"PlanetMath entry axiomschemaofseparation","url":"https://planetmath.org/axiomschemaofseparation"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: Let ϕ ⁢ ( u , p ) be a formula . For any X and p , there exists a set Y = { u ∈ X : ϕ ⁢ ( u , p ) } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.russellsparadox","kind":"concept","label":"Russell’s paradox","sources":[{"id":"planetmath.russellsparadox","title":"PlanetMath entry russellsparadox","url":"https://planetmath.org/russellsparadox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: Suppose that for any coherent proposition P ⁢ ( x ) , we can construct a set { x : P ⁢ ( x ) } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.z2","kind":"concept","label":"Z","sources":[{"id":"planetmath.z2","title":"PlanetMath entry z2","url":"https://planetmath.org/z2"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: 2 Z 2 is the full system of second order arithmetic , that is, the full theory of numbers and sets of numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.banachtarskiparadox","kind":"theory","label":"Banach-Tarski paradox","sources":[{"id":"planetmath.banachtarskiparadox","title":"PlanetMath entry banachtarskiparadox","url":"https://planetmath.org/banachtarskiparadox"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 28A99, 03B99) states: The 3 -dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first! Let us formulate the theorem formally.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.buralifortiparadox","kind":"concept","label":"Burali-Forti paradox","sources":[{"id":"planetmath.buralifortiparadox","title":"PlanetMath entry buralifortiparadox","url":"https://planetmath.org/buralifortiparadox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: The Burali-Forti paradox demonstrates that the class of all ordinals is not a set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.hausdorffparadox","kind":"theory","label":"Hausdorff paradox","sources":[{"id":"planetmath.hausdorffparadox","title":"PlanetMath entry hausdorffparadox","url":"https://planetmath.org/hausdorffparadox"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25, 51M04) states: Let S 2 be the unit sphere in the Euclidean space ℝ 3 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.compactness","kind":"concept","label":"Compactness","sources":[{"id":"planetmath.compactness","title":"PlanetMath entry compactness","url":"https://planetmath.org/compactness"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: A logic is said to be ( κ , λ ) -compact, if the following holds If Φ is a set of sentences of cardinality less than or equal to κ and all subsets of Φ of cardinality less than λ are consistent , then Φ is consistent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polyadicalgebra","kind":"concept","label":"Polyadic algebra","sources":[{"id":"planetmath.polyadicalgebra","title":"PlanetMath entry polyadicalgebra","url":"https://planetmath.org/polyadicalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: A polyadic algebra is a quadruple ( B , V , ∃ , S ) , where ( B , V , ∃ ) is a quantifier algebra , and S is a function from the set of functions on V to the set of endomorphisms on the Boolean algebra B , in other words S : V V → End ⁡ ( B ) such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationalgebra","kind":"concept","label":"Relation algebra","sources":[{"id":"planetmath.relationalgebra","title":"PlanetMath entry relationalgebra","url":"https://planetmath.org/relationalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15, 06E25) states: It is a well-known fact that if A is a set, then P ⁢ ( A ) the power set of A , equipped with the intersection operation ∩ , the union operation ∪ , and the complement operation ′ turns P ⁢ ( A ) into a Boolean algebra .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomatizableclass","kind":"concept","label":"Axiomatizable class","sources":[{"id":"planetmath.axiomatizableclass","title":"PlanetMath entry axiomatizableclass","url":"https://planetmath.org/axiomatizableclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C52) states: Let L be a first order language and T a theory in L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.solesufficientoperator","kind":"concept","label":"Sole sufficient operator","sources":[{"id":"planetmath.solesufficientoperator","title":"PlanetMath entry solesufficientoperator","url":"https://planetmath.org/solesufficientoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05) states: A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to define all of the operators in a specified set of operators.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.zerothorderlogic","kind":"concept","label":"Zeroth order logic","sources":[{"id":"planetmath.zerothorderlogic","title":"PlanetMath entry zerothorderlogic","url":"https://planetmath.org/zerothorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G05, 03B05) states: \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase column \\PMlinkescapephrase Column \\PMlinkescapephrase columns \\PMlinkescapephrase Columns \\PMlinkescapephrase compact \\PMlinkescapephrase Compact \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formal logic \\PMlinkescapephrase Formal logic \\PMlinkescapephrase level \\PMlinkescapephrase Level \\PMlinkescapephrase order \\PMlinkescapephrase Order \\PMlinkescapephrase reference \\PMlinkescapephrase Reference \\PMlinkescapephrase translation \\PMlinkescapephrase Translation Note.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hartigsquantifier","kind":"concept","label":"Härtig’s quantifier","sources":[{"id":"planetmath.hartigsquantifier","title":"PlanetMath entry hartigsquantifier","url":"https://planetmath.org/hartigsquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: Härtig’s quantifier is a quantifier which takes two variables and two formulas , written I ⁢ x ⁢ y ⁢ ϕ ⁢ ( x ) ⁢ ψ ⁢ ( y ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.skolemization","kind":"concept","label":"Skolemization","sources":[{"id":"planetmath.skolemization","title":"PlanetMath entry skolemization","url":"https://planetmath.org/skolemization"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Skolemization is a way of removing existential quantifiers from a formula .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subalgebraofapartialalgebra","kind":"concept","label":"Subalgebra of a partial algebra","sources":[{"id":"planetmath.subalgebraofapartialalgebra","title":"PlanetMath entry subalgebraofapartialalgebra","url":"https://planetmath.org/subalgebraofapartialalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Unlike an algebraic system , where there is only one way to define a subalgebra , there are several ways to define a subalgebra of a partial algebra .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inaccessiblecardinal","kind":"concept","label":"Inaccessible cardinal","sources":[{"id":"planetmath.inaccessiblecardinal","title":"PlanetMath entry inaccessiblecardinal","url":"https://planetmath.org/inaccessiblecardinal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E55) states: A limit cardinal κ is a strong limit cardinal if for any λ < κ , 2 λ < κ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.bisimulation","kind":"concept","label":"Bisimulation","sources":[{"id":"planetmath.bisimulation","title":"PlanetMath entry bisimulation","url":"https://planetmath.org/bisimulation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B45, 68Q85, 68Q10) states: Given two labelled state transition systems (LTS) M = ( S 1 , Σ , → 1 ) , N = ( S 2 , Σ , → 2 ) , a binary relation ≈ ⊆ S 1 × S 2 is called a simulation if whenever p ≈ q and p → α 1 p ′ , then there is a q ′ such that p ′ ≈ q ′ and q → α 2 q ′ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fixedpointsofnormalfunctions","kind":"concept","label":"Fixed points of normal functions","sources":[{"id":"planetmath.fixedpointsofnormalfunctions","title":"PlanetMath entry fixedpointsofnormalfunctions","url":"https://planetmath.org/fixedpointsofnormalfunctions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: If f : M → 𝐎𝐧 is a function from any set of ordinals to the class of ordinals then Fix ⁡ ( f ) = { x ∈ M ∣ f ⁢ ( x ) = x } is the set of fixed points of f .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.multiset","kind":"concept","label":"Multiset","sources":[{"id":"planetmath.multiset","title":"PlanetMath entry multiset","url":"https://planetmath.org/multiset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: A multiset is a set for which repeated elements are considered.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.traceable","kind":"concept","label":"Traceable","sources":[{"id":"planetmath.traceable","title":"PlanetMath entry traceable","url":"https://planetmath.org/traceable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C45, 03B22, 03-00, 03-01) states: Let G be a graph. If G has a Hamiltonian path , we say that G is traceable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofpairing","kind":"concept","label":"Axiom of pairing","sources":[{"id":"planetmath.axiomofpairing","title":"PlanetMath entry axiomofpairing","url":"https://planetmath.org/axiomofpairing"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: For any a and b there exists a set { a , b } that contains exactly a and b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanalgebrahomomorphism","kind":"concept","label":"Boolean algebra homomorphism","sources":[{"id":"planetmath.booleanalgebrahomomorphism","title":"PlanetMath entry booleanalgebrahomomorphism","url":"https://planetmath.org/booleanalgebrahomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Let A and B be Boolean algebras . A function f : A → B is called a Boolean algebra homomorphism , or homomorphism for short, if f is a { 0 , 1 } - lattice homomorphism ( http://planetmath.org/LatticeHomomorphism ) such that f respects ′ : f ⁢ ( a ′ ) = f ⁢ ( a ) ′ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanring","kind":"concept","label":"Boolean ring","sources":[{"id":"planetmath.booleanring","title":"PlanetMath entry booleanring","url":"https://planetmath.org/booleanring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E99, 03G05) states: A Boolean ring is a ring R that has a multiplicative identity , and in which every element is idempotent , that is, x 2 = x ⁢ for all ⁢ x ∈ R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorspace","kind":"concept","label":"Vector space","sources":[{"id":"planetmath.vectorspace","title":"PlanetMath entry vectorspace","url":"https://planetmath.org/vectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16-00, 13-00, 20-00, 15-00, 70B15) states: Let F be a field (or, more generally, a division ring).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologicalspace","kind":"concept","label":"Topological space","sources":[{"id":"planetmath.topologicalspace","title":"PlanetMath entry topologicalspace","url":"https://planetmath.org/topologicalspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 22-00, 55-00, 54-00) states: A topological space is a set X together with a set 𝒯 whose elements are subsets of X , such that • ∅ ∈ 𝒯 • X ∈ 𝒯 • If U j ∈ 𝒯 for all j ∈ J , then ⋃ j ∈ J U j ∈ 𝒯 • If U ∈ 𝒯 and V ∈ 𝒯 , then U ∩ V ∈ 𝒯 Elements of 𝒯 are called open sets of X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metricspace","kind":"concept","label":"Metric space","sources":[{"id":"planetmath.metricspace","title":"PlanetMath entry metricspace","url":"https://planetmath.org/metricspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 82-00, 83-00, 81-00) states: A metric space is a set X together with a real valued function d : X × X ⟶ ℝ (called a metric , or sometimes a distance function) such that, for every x , y , z ∈ X , • d ⁢ ( x , y ) ≥ 0 , with equality 1 1 This condition can be replaced with the weaker statement d ⁢ ( x , y ) = 0 ⇔ x = y without affecting the definition.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.integral","kind":"concept","label":"Integral","sources":[{"id":"planetmath.integral","title":"PlanetMath entry integral","url":"https://planetmath.org/integral"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B21) states: Let B be a ring with a subring A . We will assume that A is contained in the center of B (in particular, A is commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.manifold","kind":"concept","label":"Manifold","sources":[{"id":"planetmath.manifold","title":"PlanetMath entry manifold","url":"https://planetmath.org/manifold"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53-00, 57R50, 58A05, 58A07) states: Summary. A manifold is a space that is locally like ℝ n , however lacking a preferred system of coordinates.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentialequation","kind":"concept","label":"Differential equation","sources":[{"id":"planetmath.differentialequation","title":"PlanetMath entry differentialequation","url":"https://planetmath.org/differentialequation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 35-00, 34-00) states: A differential equation is an equation involving an unknown function of one or more variables, its derivatives and the variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.abeliangroup","kind":"concept","label":"Abelian group","sources":[{"id":"planetmath.abeliangroup","title":"PlanetMath entry abeliangroup","url":"https://planetmath.org/abeliangroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20K99) states: Let ( G , * ) be a group. If for any a , b ∈ G we have a * b = b * a , we say that the group is abelian (or commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.binaryoperation","kind":"concept","label":"Binary operation","sources":[{"id":"planetmath.binaryoperation","title":"PlanetMath entry binaryoperation","url":"https://planetmath.org/binaryoperation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A99) states: A binary operation on a set X is a function from the Cartesian product X × X to X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.equality","kind":"concept","label":"Equality","sources":[{"id":"planetmath.equality","title":"PlanetMath entry equality","url":"https://planetmath.org/equality"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 06-00) states: In any set S , the equality , denoted by “ = ”, is a binary relation which is reflexive , symmetric , transitive and antisymmetric, i.e.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupaction","kind":"concept","label":"Group action","sources":[{"id":"planetmath.groupaction","title":"PlanetMath entry groupaction","url":"https://planetmath.org/groupaction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16W22, 20M30) states: Let G be a group and let X be a set. A left group action is a function ⋅ : G × X ⟶ X such that: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupoid","kind":"concept","label":"Groupoid","sources":[{"id":"planetmath.groupoid","title":"PlanetMath entry groupoid","url":"https://planetmath.org/groupoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02) states: A groupoid G is a set together with a binary operation ⋅ : G × G ⟶ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hypergroup","kind":"concept","label":"Hypergroup","sources":[{"id":"planetmath.hypergroup","title":"PlanetMath entry hypergroup","url":"https://planetmath.org/hypergroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N20) states: Hypergroups are generalizations of groups. Recall that a group is set with a binary operation on it satisfying a number of conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identityelement","kind":"concept","label":"Identity element","sources":[{"id":"planetmath.identityelement","title":"PlanetMath entry identityelement","url":"https://planetmath.org/identityelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05, 20N02, 20N05, 20M99) states: Let G be a groupoid , that is a set with a binary operation G × G → G , written muliplicatively so that ( x , y ) ↦ x ⁢ y .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identityinaclass","kind":"concept","label":"Identity in a class","sources":[{"id":"planetmath.identityinaclass","title":"PlanetMath entry identityinaclass","url":"https://planetmath.org/identityinaclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08B99) states: Let K be a class of algebraic systems of the same type.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.regularsemigroup","kind":"concept","label":"Regular semigroup","sources":[{"id":"planetmath.regularsemigroup","title":"PlanetMath entry regularsemigroup","url":"https://planetmath.org/regularsemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M17, 20M18) states: \\PMlinkescapephrase completely regular \\PMlinkescapephrase generated by Let S be a semigroup .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.specialelementsinalattice","kind":"concept","label":"Special elements in a lattice","sources":[{"id":"planetmath.specialelementsinalattice","title":"PlanetMath entry specialelementsinalattice","url":"https://planetmath.org/specialelementsinalattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B99) states: Let L be a lattice and a ∈ L is said to be • distributive if a ∨ ( b ∧ c ) = ( a ∨ b ) ∧ ( a ∨ c ) , • standard if b ∧ ( a ∨ c ) = ( b ∧ a ) ∨ ( b ∧ c ) , or • neutral if ( a ∧ b ) ∨ ( b ∧ c ) ∨ ( c ∧ a ) = ( a ∨ b ) ∧ ( b ∨ c ) ∧ ( c ∨ a ) for all b , c ∈ L .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subgroup","kind":"concept","label":"Subgroup","sources":[{"id":"planetmath.subgroup","title":"PlanetMath entry subgroup","url":"https://planetmath.org/subgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Definition: Let ( G , * ) be a group and let K be subset of G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.commutativesemigroup","kind":"concept","label":"Commutative semigroup","sources":[{"id":"planetmath.commutativesemigroup","title":"PlanetMath entry commutativesemigroup","url":"https://planetmath.org/commutativesemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M14) states: A semigroup S is commutative if the defining binary operation is commutative ( http://planetmath.org/Commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distributivity","kind":"concept","label":"Distributivity","sources":[{"id":"planetmath.distributivity","title":"PlanetMath entry distributivity","url":"https://planetmath.org/distributivity"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06D99, 16-00, 13-00, 17-00) states: Given a set ( http://planetmath.org/Set ) S with two binary operations + : S × S → S and ⋅ : S × S → S , we say that ⋅ is right distributive over + if ( a + b ) ⋅ c = ( a ⋅ c ) + ( b ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S and left distributive over + if a ⋅ ( b + c ) = ( a ⋅ b ) + ( a ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.semiring","kind":"concept","label":"Semiring","sources":[{"id":"planetmath.semiring","title":"PlanetMath entry semiring","url":"https://planetmath.org/semiring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16Y60) states: \\PMlinkescapephrase right annihilator A semiring is a set A with two operations , + and ⋅ , such that 0 ∈ A makes ( A , + ) into a commutative monoid , 1 ∈ A makes ( A , ⋅ ) into a monoid, the operation ⋅ distributes ( http://planetmath.org/ Distributivity ) over + , and for any a ∈ A , 0 ⋅ a = a ⋅ 0 = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subtraction","kind":"concept","label":"Subtraction","sources":[{"id":"planetmath.subtraction","title":"PlanetMath entry subtraction","url":"https://planetmath.org/subtraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A06, 00A05, 11B25) states: Subtraction is a mathematical operation in which the value of a number is decreased by the values of one or more other numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.addition","kind":"concept","label":"Addition","sources":[{"id":"planetmath.addition","title":"PlanetMath entry addition","url":"https://planetmath.org/addition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11B25, 00A06, 00A05) states: Addition is a mathematical operation in which two or more numbers are added up.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multiplication","kind":"concept","label":"Multiplication","sources":[{"id":"planetmath.multiplication","title":"PlanetMath entry multiplication","url":"https://planetmath.org/multiplication"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A06, 11B25, 00A05) states: Multiplication is a mathematical operation in which two or more numbers are added up to themselves by a factor of other numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zeroelements","kind":"concept","label":"Zero elements","sources":[{"id":"planetmath.zeroelements","title":"PlanetMath entry zeroelements","url":"https://planetmath.org/zeroelements"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let S be a semigroup . An element z is called a right zero [resp.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closedset","kind":"concept","label":"Closed set","sources":[{"id":"planetmath.closedset","title":"PlanetMath entry closedset","url":"https://planetmath.org/closedset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: \\PMlinkescapephrase closed under Let ( X , τ ) be a topological space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.discretespace","kind":"concept","label":"Discrete space","sources":[{"id":"planetmath.discretespace","title":"PlanetMath entry discretespace","url":"https://planetmath.org/discretespace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: The discrete topology on a set X is the topology given by the power set of X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.indiscretetopology","kind":"concept","label":"Indiscrete topology","sources":[{"id":"planetmath.indiscretetopology","title":"PlanetMath entry indiscretetopology","url":"https://planetmath.org/indiscretetopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: If X is a set and it is endowed with a topology defined by τ = { X , ∅ } then X is said to have the indiscrete topology .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.neighborhood","kind":"concept","label":"Neighborhood","sources":[{"id":"planetmath.neighborhood","title":"PlanetMath entry neighborhood","url":"https://planetmath.org/neighborhood"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: The meaning of the word neighborhood in topology is not well standardized.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.neighborhoodofavertex","kind":"concept","label":"Neighborhood (of a vertex)","sources":[{"id":"planetmath.neighborhoodofavertex","title":"PlanetMath entry neighborhoodofavertex","url":"https://planetmath.org/neighborhoodofavertex"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C99) states: For a graph G , the set of vertices adjacent to a vertex x ∈ G , the neighborhood of x , is denoted by Γ ⁢ ( x ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.openset","kind":"concept","label":"Open set","sources":[{"id":"planetmath.openset","title":"PlanetMath entry openset","url":"https://planetmath.org/openset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: In a metric space M a set O is called an open subset of M or just open , if for every x ∈ O there is an open ball S around x such that S ⊂ O .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.producttopology","kind":"concept","label":"Product topology","sources":[{"id":"planetmath.producttopology","title":"PlanetMath entry producttopology","url":"https://planetmath.org/producttopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B10) states: Definition Let ( ( X α , 𝒯 α ) ) α ∈ A be a family of topological spaces , and let Y be the Cartesian product ( http://planetmath.org/GeneralizedCartesianProduct ) of the sets X α , that is Y = ∏ α ∈ A X α .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subspacetopology","kind":"concept","label":"Subspace topology","sources":[{"id":"planetmath.subspacetopology","title":"PlanetMath entry subspacetopology","url":"https://planetmath.org/subspacetopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B05, 15A66, 11E88) states: Let X be a topological space , and let Y ⊂ X be a subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distanceinagraph","kind":"concept","label":"Distance (in a graph)","sources":[{"id":"planetmath.distanceinagraph","title":"PlanetMath entry distanceinagraph","url":"https://planetmath.org/distanceinagraph"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C12) states: The distance d ⁢ ( x , y ) of two vertices x and y of a graph G is the length of the shortest path (or, equivalently, walk) from x to y .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.grouphomomorphism","kind":"concept","label":"Group homomorphism","sources":[{"id":"planetmath.grouphomomorphism","title":"PlanetMath entry grouphomomorphism","url":"https://planetmath.org/grouphomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Let ( G , ∗ ) and ( K , ⋆ ) be two groups. A group homomorphism is a function ϕ : G → K such that ϕ ⁢ ( s ∗ t ) = ϕ ⁢ ( s ) ⋆ ϕ ⁢ ( t ) for all s , t ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hausdorffspace","kind":"concept","label":"Hausdorff space","sources":[{"id":"planetmath.hausdorffspace","title":"PlanetMath entry hausdorffspace","url":"https://planetmath.org/hausdorffspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: A topological space ( X , τ ) is said to be T 2 (or said to satisfy the T 2 axiom) if given distinct x , y ∈ X , there exist disjoint open sets U , V ∈ τ (that is, U ∩ V = ∅ ) such that x ∈ U and y ∈ V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.isomorphicgroups","kind":"concept","label":"Isomorphic groups","sources":[{"id":"planetmath.isomorphicgroups","title":"PlanetMath entry isomorphicgroups","url":"https://planetmath.org/isomorphicgroups"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Two groups ( X 1 , * 1 ) and ( X 2 , * 2 ) are said to be isomorphic if there is a group isomorphism ψ : X 1 → X 2 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.isomorphism","kind":"concept","label":"Isomorphism","sources":[{"id":"planetmath.isomorphism","title":"PlanetMath entry isomorphism","url":"https://planetmath.org/isomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05, 15A04, 13A99, 20A05, 18A05) states: A morphism f : A ⟶ B in a category is an isomorphism if there exists a morphism f - 1 : B ⟶ A which is its inverse .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.normedvectorspace","kind":"concept","label":"Normed vector space","sources":[{"id":"planetmath.normedvectorspace","title":"PlanetMath entry normedvectorspace","url":"https://planetmath.org/normedvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B99) states: Let 𝔽 be a field which is either ℝ or ℂ . A over 𝔽 is a pair ( V , ∥ ⋅ ∥ ) where V is a vector space over 𝔽 and ∥ ⋅ ∥ : V → ℝ is a function such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ultrametric","kind":"concept","label":"Ultrametric","sources":[{"id":"planetmath.ultrametric","title":"PlanetMath entry ultrametric","url":"https://planetmath.org/ultrametric"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Any metric d : X × X → ℝ on a set X must satisfy the triangle inequality : ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ d ⁢ ( x , y ) + d ⁢ ( y , z ) An ultrametric must additionally satisfy a stronger version of the triangle inequality: ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ max ⁡ { d ⁢ ( x , y ) , d ⁢ ( y , z ) } Here is an example of an ultrametric on a space with 5 points, labelled a , b , c , d , e : a b c d e a 0 12 4 6 12 b 0 12 12 5 c 0 6 12 d 0 12 e 0 In the table above, an entry n in the for element x and the for element y indicates that d ⁢ ( x , y ) = n , where d is the ultrametric.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectornorm","kind":"concept","label":"Vector norm","sources":[{"id":"planetmath.vectornorm","title":"PlanetMath entry vectornorm","url":"https://planetmath.org/vectornorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B20, 18-01, 20H15, 20B30) states: A vector norm on the real vector space V is a function f : V → ℝ that satisfies the following properties: f ⁢ ( x ) = 0 ⇔ x = 0 f ⁢ ( x ) ≥ 0 x ∈ V f ⁢ ( x + y ) ≤ f ⁢ ( x ) + f ⁢ ( y ) x , y ∈ V f ⁢ ( α ⁢ x ) = | α | ⁢ f ⁢ ( x ) α ∈ ℝ , x ∈ V Such a function is denoted as || x || .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.banachspace","kind":"concept","label":"Banach space","sources":[{"id":"planetmath.banachspace","title":"PlanetMath entry banachspace","url":"https://planetmath.org/banachspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B99, 54E50) states: A Banach space ( X , ∥ ⋅ ∥ ) is a normed vector space such that X is complete under the metric induced by the norm ∥ ⋅ ∥ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bilinearform","kind":"concept","label":"Bilinear form","sources":[{"id":"planetmath.bilinearform","title":"PlanetMath entry bilinearform","url":"https://planetmath.org/bilinearform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 11E39, 15A63) states: Definition. Let U , V , W be vector spaces over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.chainrule","kind":"theory","label":"Chain rule","sources":[{"id":"planetmath.chainrule","title":"PlanetMath entry chainrule","url":"https://planetmath.org/chainrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: Let f , g be differentiable , real-valued functions such that g is defined on an open set I ⊆ ℝ , and f is defined on g ⁢ ( I ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coordinatevector","kind":"concept","label":"Coordinate vector","sources":[{"id":"planetmath.coordinatevector","title":"PlanetMath entry coordinatevector","url":"https://planetmath.org/coordinatevector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space of dimension n over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.definitionsintrigonometry","kind":"concept","label":"Definitions in trigonometry","sources":[{"id":"planetmath.definitionsintrigonometry","title":"PlanetMath entry definitionsintrigonometry","url":"https://planetmath.org/definitionsintrigonometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A09) states: Informal definitions Given a triangle A ⁢ B ⁢ C with a signed angle x at A and a right angle at B , the ratios B ⁢ C A ⁢ C A ⁢ B A ⁢ C B ⁢ C A ⁢ B are dependent only on the angle x , and therefore define functions , denoted by sin ⁡ x cos ⁡ x tan ⁡ x respectively, where the names are short for sine, cosine and tangent .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.derivativenotation","kind":"concept","label":"Derivative notation","sources":[{"id":"planetmath.derivativenotation","title":"PlanetMath entry derivativenotation","url":"https://planetmath.org/derivativenotation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 26-00) states: This is the list of known standard representations and their nuances.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.directionalderivative","kind":"concept","label":"Directional derivative","sources":[{"id":"planetmath.directionalderivative","title":"PlanetMath entry directionalderivative","url":"https://planetmath.org/directionalderivative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B12, 26B10) states: Let U be an open set in ℝ n and f : U → ℂ is a differentiable function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.elementaryfunction","kind":"concept","label":"Elementary function","sources":[{"id":"planetmath.elementaryfunction","title":"PlanetMath entry elementaryfunction","url":"https://planetmath.org/elementaryfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A99) states: An elementary function is a real function (of one variable) that can be constructed by a finite number of elementary operations ( addition , subtraction , multiplication and division ) and compositions from constant functions , the identity function ( x ↦ x ), algebraic functions , exponential functions , logarithm functions , trigonometric functions and cyclometric functions .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.jacobianmatrix","kind":"concept","label":"Jacobian matrix","sources":[{"id":"planetmath.jacobianmatrix","title":"PlanetMath entry jacobianmatrix","url":"https://planetmath.org/jacobianmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B10) states: The Jacobian matrix [ 𝐉 ⁢ f ⁢ ( 𝐚 ) ] of a function f : ℝ n → ℝ m at the point 𝐚 with respect to some choice of bases for ℝ n and ℝ m is the matrix of the linear map from ℝ n into ℝ m that generalizes the definition of the derivative of a function on ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.jacobideterminant","kind":"concept","label":"Jacobi determinant","sources":[{"id":"planetmath.jacobideterminant","title":"PlanetMath entry jacobideterminant","url":"https://planetmath.org/jacobideterminant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 62H05, 15-00) states: Let f = f ⁢ ( x ) = f ⁢ ( x 1 , … , x n ) be a function of n variables , and let u = u ⁢ ( x ) = ( u 1 ⁢ ( x ) , … , u n ⁢ ( x ) ) be a function of x , where inversely x can be expressed as a function of u , x = x ⁢ ( u ) = ( x 1 ⁢ ( u ) , … , x n ⁢ ( u ) ) The formula for a change of variable in an n -dimensional integral is then ∫ Ω f ⁢ ( x ) ⁢ d n ⁢ x = ∫ u ⁢ ( Ω ) f ⁢ ( x ⁢ ( u ) ) ⁢ | det ⁡ ( d ⁢ x / d ⁢ u ) | ⁢ d n ⁢ u Ω is an integration region, and one integrates over all x ∈ Ω , or equivalently, all u ∈ u ⁢ ( Ω ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.lineartransformation","kind":"concept","label":"Linear transformation","sources":[{"id":"planetmath.lineartransformation","title":"PlanetMath entry lineartransformation","url":"https://planetmath.org/lineartransformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Let V and W be vector spaces over the same field F .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallyhomeomorphic","kind":"concept","label":"Locally homeomorphic","sources":[{"id":"planetmath.locallyhomeomorphic","title":"PlanetMath entry locallyhomeomorphic","url":"https://planetmath.org/locallyhomeomorphic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: Let X and Y be topological spaces . Then X is locally homeomorphic to Y , if for every x ∈ X there is a neighbourhood U ⊆ X of x and an http://planetmath.org/node/380 open set V ⊆ Y , such that U and V with their respective subspace topology are homeomorphic .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.operatornorm","kind":"concept","label":"Operator norm","sources":[{"id":"planetmath.operatornorm","title":"PlanetMath entry operatornorm","url":"https://planetmath.org/operatornorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47L25, 46A32, 47A30) states: Definition Let A : 𝖵 → 𝖶 be a linear map between normed vector spaces 𝖵 and 𝖶 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.partialderivative","kind":"concept","label":"Partial derivative","sources":[{"id":"planetmath.partialderivative","title":"PlanetMath entry partialderivative","url":"https://planetmath.org/partialderivative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B12) states: The partial derivative of a multivariable function f is simply its derivative with respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.productrule","kind":"theory","label":"Product rule","sources":[{"id":"planetmath.productrule","title":"PlanetMath entry productrule","url":"https://planetmath.org/productrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: The product rule states that if f : ℝ → ℝ and g : ℝ → ℝ are functions in one variable both differentiable at a point x 0 , then the derivative of the product of the two functions, denoted f ⋅ g , at x 0 is given by d d ⁢ x ⁢ ( f ⋅ g ) ⁢ ( x 0 ) = f ⁢ ( x 0 ) ⁢ g ′ ⁢ ( x 0 ) + f ′ ⁢ ( x 0 ) ⁢ g ⁢ ( x 0 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.quotientrule","kind":"theory","label":"Quotient rule","sources":[{"id":"planetmath.quotientrule","title":"PlanetMath entry quotientrule","url":"https://planetmath.org/quotientrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: The quotient rule says that the derivative of the quotient f / g of two differentiable functions f and g exists at all values of x as long as g ⁢ ( x ) ≠ 0 and is given by the formula d d ⁢ x ⁢ [ f ⁢ ( x ) g ⁢ ( x ) ] = g ⁢ ( x ) ⁢ f ′ ⁢ ( x ) - f ⁢ ( x ) ⁢ g ′ ⁢ ( x ) [ g ⁢ ( x ) ] 2 The Quotient Rule and the other differentiation formulas allow us to compute the derivative of any rational function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.relatedrates","kind":"concept","label":"Related rates","sources":[{"id":"planetmath.relatedrates","title":"PlanetMath entry relatedrates","url":"https://planetmath.org/relatedrates"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53A45, 53A17, 26A24) states: The notion of a derivative has numerous interpretations and applications.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.similarmatrix","kind":"concept","label":"Similar matrix","sources":[{"id":"planetmath.similarmatrix","title":"PlanetMath entry similarmatrix","url":"https://planetmath.org/similarmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Definition A square matrix A is similar (or conjugate ) to a square matrix B if there exists a nonsingular square matrix S such that A = S - 1 ⁢ B ⁢ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tangentline","kind":"concept","label":"Tangent line","sources":[{"id":"planetmath.tangentline","title":"PlanetMath entry tangentline","url":"https://planetmath.org/tangentline"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B05, 26A24) states: If the curve y = f ⁢ ( x ) of x ⁢ y -plane is sufficiently smooth in its point ( x 0 , y 0 ) and in a neighborhood of this, the curve may have a tangent line (or simply ) in ( x 0 , y 0 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.trigonometry","kind":"concept","label":"Trigonometry","sources":[{"id":"planetmath.trigonometry","title":"PlanetMath entry trigonometry","url":"https://planetmath.org/trigonometry"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 43-00, 51-00, 42-00, 33B10) states: 1 Geometrical definitions Trigonometry arose in ancient times out of attempts to measure the lengths of various lines associated with circles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.uniformspace","kind":"concept","label":"Uniform space","sources":[{"id":"planetmath.uniformspace","title":"PlanetMath entry uniformspace","url":"https://planetmath.org/uniformspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E15) states: A uniform structure (or uniformity ) on a set X is a non empty set 𝒰 of subsets of X × X which satisfies the following axioms: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorfield","kind":"concept","label":"Vector field","sources":[{"id":"planetmath.vectorfield","title":"PlanetMath entry vectorfield","url":"https://planetmath.org/vectorfield"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46E40) states: Vector fields in ℝ n Definition . A vector field v on some open set U ⊂ R n is a function which associates a vector v ⁢ ( x ) to each point x of U .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.incidencegeometry","kind":"concept","label":"Incidence geometry","sources":[{"id":"planetmath.incidencegeometry","title":"PlanetMath entry incidencegeometry","url":"https://planetmath.org/incidencegeometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: Incidence geometry is essentially geometry based on the first postulate in Euclid’s The Elements .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.incidencestructure","kind":"concept","label":"Incidence structure","sources":[{"id":"planetmath.incidencestructure","title":"PlanetMath entry incidencestructure","url":"https://planetmath.org/incidencestructure"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 62K10, 51E30, 51E05, 05B25, 05B07, 05B05) states: Definition . An incidence structure 𝒮 is a triple ( 𝒫 , ℬ , ℐ ) , where 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.pseudograph","kind":"concept","label":"Pseudograph","sources":[{"id":"planetmath.pseudograph","title":"PlanetMath entry pseudograph","url":"https://planetmath.org/pseudograph"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C75) states: A pseudograph is a graph that allows both parallel edges and loops.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.connectedspace","kind":"concept","label":"Connected space","sources":[{"id":"planetmath.connectedspace","title":"PlanetMath entry connectedspace","url":"https://planetmath.org/connectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be connected if there is no pair of nonempty subsets U , V such that both U and V are open in X , U ∩ V = ∅ and U ∪ V = X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentiablefunction","kind":"concept","label":"Differentiable function","sources":[{"id":"planetmath.differentiablefunction","title":"PlanetMath entry differentiablefunction","url":"https://planetmath.org/differentiablefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A24, 57R35) states: Let f : V → W be a function , where V and W are Banach spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homeomorphism","kind":"concept","label":"Homeomorphism","sources":[{"id":"planetmath.homeomorphism","title":"PlanetMath entry homeomorphism","url":"https://planetmath.org/homeomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54C05) states: A homeomorphism f of topological spaces is a continuous , bijective map such that f - 1 is also continuous.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.longline","kind":"concept","label":"Long line","sources":[{"id":"planetmath.longline","title":"PlanetMath entry longline","url":"https://planetmath.org/longline"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54G20) states: The long line is a non-paracompact Hausdorff 1 -dimensional manifold constructed as follows.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metricequivalence","kind":"concept","label":"Metric equivalence","sources":[{"id":"planetmath.metricequivalence","title":"PlanetMath entry metricequivalence","url":"https://planetmath.org/metricequivalence"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Let X be a set equipped with two metrics ρ and σ . We say that ρ is equivalent to σ (on X ) if the identity map on X , is a homeomorphism between the metric topology on X induced by ρ and the metric topology on X induced by σ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metrizable","kind":"concept","label":"Metrizable","sources":[{"id":"planetmath.metrizable","title":"PlanetMath entry metrizable","url":"https://planetmath.org/metrizable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00, 55-00, 22-00) states: A topological space ( X , 𝒯 ) is said to be metrizable if there is a metric d : X → [ 0 , ∞ ) such that the topology induced by d is 𝒯 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.paracompacttopologicalspace","kind":"concept","label":"Paracompact topological space","sources":[{"id":"planetmath.paracompacttopologicalspace","title":"PlanetMath entry paracompacttopologicalspace","url":"https://planetmath.org/paracompacttopologicalspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00, 55-00) states: A topological space X is said to be paracompact if every open cover of X has a locally finite open refinement.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.secondcountable","kind":"concept","label":"Second countable","sources":[{"id":"planetmath.secondcountable","title":"PlanetMath entry secondcountable","url":"https://planetmath.org/secondcountable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D70) states: A topological space is said to be second if it has a countable basis ( http://planetmath.org/BasisTopologicalSpace ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.submanifold","kind":"concept","label":"Submanifold","sources":[{"id":"planetmath.submanifold","title":"PlanetMath entry submanifold","url":"https://planetmath.org/submanifold"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 32V40, 53C40, 53B25, 57N99) states: There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.totaldifferential","kind":"concept","label":"Total differential","sources":[{"id":"planetmath.totaldifferential","title":"PlanetMath entry totaldifferential","url":"https://planetmath.org/totaldifferential"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53A04, 26B05, 01A45) states: There is the generalisation of the theorem in the parent entry ( http:// planetmath .org/ Differential ) concerning the real functions of several variables; here we formulate it for three variables: Theorem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.changeofbasis","kind":"concept","label":"Change of basis","sources":[{"id":"planetmath.changeofbasis","title":"PlanetMath entry changeofbasis","url":"https://planetmath.org/changeofbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Let V be a vector space . Given a basis A for V , each vector v ∈ V can be uniquely expressed in terms of the base elements v i ∈ A as follows: v = ∑ v i ∈ A r i ⁢ v i where the sum is taken over a finite number of elements in A .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.determinant","kind":"concept","label":"Determinant","sources":[{"id":"planetmath.determinant","title":"PlanetMath entry determinant","url":"https://planetmath.org/determinant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A15) states: Overview The determinant is an algebraic operation that transforms a square matrix M into a scalar.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimensionvectorspace","kind":"concept","label":"Dimension (vector space)","sources":[{"id":"planetmath.dimensionvectorspace","title":"PlanetMath entry dimensionvectorspace","url":"https://planetmath.org/dimensionvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space over a field K . We say that V is finite-dimensional if there exists a finite basis of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dualspace","kind":"concept","label":"Dual space","sources":[{"id":"planetmath.dualspace","title":"PlanetMath entry dualspace","url":"https://planetmath.org/dualspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A99) states: Dual of a vector space ; dual bases Let V be a vector space over a field k .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.hallsmarriagetheorem","kind":"theory","label":"Hall’s marriage theorem","sources":[{"id":"planetmath.hallsmarriagetheorem","title":"PlanetMath entry hallsmarriagetheorem","url":"https://planetmath.org/hallsmarriagetheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 05D15) states: Let S = { S 1 , S 2 , … ⁢ S n } be a finite collection of finite sets .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearalgebra","kind":"concept","label":"Linear algebra","sources":[{"id":"planetmath.linearalgebra","title":"PlanetMath entry linearalgebra","url":"https://planetmath.org/linearalgebra"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 15-00, 15-01) states: Linear algebra is the branch of mathematics devoted to the theory of linear structure .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.listvector","kind":"concept","label":"List vector","sources":[{"id":"planetmath.listvector","title":"PlanetMath entry listvector","url":"https://planetmath.org/listvector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03, 15A90) states: Let 𝕂 be a field and n a positive natural number. We define 𝕂 n to be the set of all mappings from the index list ( 1 , 2 , … , n ) to 𝕂 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.projectivebasis","kind":"concept","label":"Projective basis","sources":[{"id":"planetmath.projectivebasis","title":"PlanetMath entry projectivebasis","url":"https://planetmath.org/projectivebasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: In the parent entry, we see how one may define dimension of a projective space inductively, from its subspaces starting with a point, then a line, and working its way up.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sesquilinearformsovergeneralfields","kind":"concept","label":"Sesquilinear forms over general fields","sources":[{"id":"planetmath.sesquilinearformsovergeneralfields","title":"PlanetMath entry sesquilinearformsovergeneralfields","url":"https://planetmath.org/sesquilinearformsovergeneralfields"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39, 51A05) states: Let V be a vector space over a field k . k may be of any characteristic .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.transpose","kind":"concept","label":"Transpose","sources":[{"id":"planetmath.transpose","title":"PlanetMath entry transpose","url":"https://planetmath.org/transpose"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A57) states: The transpose of a matrix A is the matrix formed by “flipping” A about the diagonal line from the upper left corner.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.absolutevalue","kind":"concept","label":"Absolute value","sources":[{"id":"planetmath.absolutevalue","title":"PlanetMath entry absolutevalue","url":"https://planetmath.org/absolutevalue"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13-00, 11A15) states: Let R be an ordered ring and let a ∈ R . The absolute value of a is defined to be the function | | : R → R given by | a | := { a if ⁢ a ≥ 0 , - a otherwise.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.absolutevalueinavectorlattice","kind":"concept","label":"Absolute value in a vector lattice","sources":[{"id":"planetmath.absolutevalueinavectorlattice","title":"PlanetMath entry absolutevalueinavectorlattice","url":"https://planetmath.org/absolutevalueinavectorlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A40, 06F20) states: Let V be a vector lattice over ℝ , and V + be its positive cone .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ascendingorder","kind":"concept","label":"Ascending order","sources":[{"id":"planetmath.ascendingorder","title":"PlanetMath entry ascendingorder","url":"https://planetmath.org/ascendingorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in ascending order if each a i ≤ a i + 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coefficientsofapolynomial","kind":"concept","label":"Coefficients of a polynomial","sources":[{"id":"planetmath.coefficientsofapolynomial","title":"PlanetMath entry coefficientsofapolynomial","url":"https://planetmath.org/coefficientsofapolynomial"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A40) states: If p ⁢ ( x ) = ∑ i = 0 n a i ⁢ x i is a polynomial ( http://planetmath.org/BasicPolynomial ), then its coefficients are { a i } i = 0 n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.complexnumber","kind":"concept","label":"Complex number","sources":[{"id":"planetmath.complexnumber","title":"PlanetMath entry complexnumber","url":"https://planetmath.org/complexnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D99, 30-00, 32-00, 46L05, 18B40, 46M20, 17B37, 22A22, 81R50, 22D25) states: The ring of complex numbers ℂ is defined to be the quotient ring of the polynomial ring ℝ ⁢ [ X ] in one variable over the reals by the principal ideal ( X 2 + 1 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.descendingorder","kind":"concept","label":"Descending order","sources":[{"id":"planetmath.descendingorder","title":"PlanetMath entry descendingorder","url":"https://planetmath.org/descendingorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in descending order if each a i ≥ a i + 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fraction","kind":"concept","label":"Fraction","sources":[{"id":"planetmath.fraction","title":"PlanetMath entry fraction","url":"https://planetmath.org/fraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11-01) states: A fraction is a rational number expressed in the form n d or n / d , where n is designated the numerator and d the denominator .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.modulusofcomplexnumber","kind":"concept","label":"Modulus of complex number","sources":[{"id":"planetmath.modulusofcomplexnumber","title":"PlanetMath entry modulusofcomplexnumber","url":"https://planetmath.org/modulusofcomplexnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 32-00, 30-00, 12D99) states: Definition Let z be a complex number , and let z ¯ be the complex conjugate of z .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monomial","kind":"concept","label":"Monomial","sources":[{"id":"planetmath.monomial","title":"PlanetMath entry monomial","url":"https://planetmath.org/monomial"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12-00) states: A monomial is a product of non-negative powers of variables .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.polynomialring","kind":"concept","label":"Polynomial ring","sources":[{"id":"planetmath.polynomialring","title":"PlanetMath entry polynomialring","url":"https://planetmath.org/polynomialring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11C08, 12E05, 13P05, 17B66, 16W10, 70G65, 17B45) states: 1 Polynomial rings in one variable Let R be a ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.polynomialsinalgebraicsystems","kind":"concept","label":"Polynomials in algebraic systems","sources":[{"id":"planetmath.polynomialsinalgebraicsystems","title":"PlanetMath entry polynomialsinalgebraicsystems","url":"https://planetmath.org/polynomialsinalgebraicsystems"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A40) states: Polynomials in an Algebraic System Let ( A , O ) be an algebraic system .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.radicalofanideal","kind":"concept","label":"Radical of an ideal","sources":[{"id":"planetmath.radicalofanideal","title":"PlanetMath entry radicalofanideal","url":"https://planetmath.org/radicalofanideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 14A05, 16N40, 13-00) states: Let R be a commutative ring . For any ideal I of R , the radical of I , written I or Rad ⁡ ( I ) , is the set { a ∈ R ⁢ ∣ a n ∈ I ⁢ for some integer ⁢ n > ⁢ 0 } The radical of an ideal I is always an ideal of R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.radicalofaninteger","kind":"concept","label":"Radical of an integer","sources":[{"id":"planetmath.radicalofaninteger","title":"PlanetMath entry radicalofaninteger","url":"https://planetmath.org/radicalofaninteger"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13A10, 81-00, 18-00) states: Given a natural number n , let n = p 1 α 1 ⁢ ⋯ ⁢ p k α k be its unique factorization as a product of distinct prime powers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.realnumber","kind":"concept","label":"Real number","sources":[{"id":"planetmath.realnumber","title":"PlanetMath entry realnumber","url":"https://planetmath.org/realnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54C30, 26-00, 12D99) states: 1 Definition There are several equivalent definitions of real number , all in common use.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentialoperator","kind":"concept","label":"Differential operator","sources":[{"id":"planetmath.differentialoperator","title":"PlanetMath entry differentialoperator","url":"https://planetmath.org/differentialoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53-00, 35-00, 47E05, 47F05) states: Roughly speaking, a differential operator is a mapping , typically understood to be linear, that transforms a function into another function by means of partial derivatives and multiplication by other functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.waveequation","kind":"concept","label":"Wave equation","sources":[{"id":"planetmath.waveequation","title":"PlanetMath entry waveequation","url":"https://planetmath.org/waveequation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 35L05) states: The wave equation is a partial differential equation which describes certain kinds of waves.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zeroofafunction","kind":"concept","label":"Zero of a function","sources":[{"id":"planetmath.zeroofafunction","title":"PlanetMath entry zeroofafunction","url":"https://planetmath.org/zeroofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26E99) states: \\PMlinkescapephrase closed set Suppose X is a set and f a complex ( http://planetmath.org/Complex )-valued function f : X → ℂ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.borelspace","kind":"concept","label":"Borel space","sources":[{"id":"planetmath.borelspace","title":"PlanetMath entry borelspace","url":"https://planetmath.org/borelspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60A10, 28C15, 28A12, 54H05, 28A05) states: Definition 0.1 . A Borel space ( X ; ℬ ⁢ ( X ) ) is defined as a set X , together with a Borel σ - algebra ( http://planetmath.org/SigmaAlgebra ) ℬ ⁢ ( X ) of subsets of X , called Borel sets .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distributionfunction","kind":"concept","label":"Distribution function","sources":[{"id":"planetmath.distributionfunction","title":"PlanetMath entry distributionfunction","url":"https://planetmath.org/distributionfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60E05) states: [this entry is currently being revised, so hold off on corrections until this line is removed] Let F : ℝ → ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.extendedrealnumbers","kind":"concept","label":"Extended real numbers","sources":[{"id":"planetmath.extendedrealnumbers","title":"PlanetMath entry extendedrealnumbers","url":"https://planetmath.org/extendedrealnumbers"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 28-00, 12D99) states: The extended real numbers are the real numbers together with + ∞ (or simply ∞ ) and - ∞ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.measurablespace","kind":"concept","label":"Measurable space","sources":[{"id":"planetmath.measurablespace","title":"PlanetMath entry measurablespace","url":"https://planetmath.org/measurablespace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 28A33) states: A measurable space is a set E together with a collection ℬ of subsets of E which is a sigma algebra .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.probabilitydistributionfunction","kind":"concept","label":"Probability distribution function","sources":[{"id":"planetmath.probabilitydistributionfunction","title":"PlanetMath entry probabilitydistributionfunction","url":"https://planetmath.org/probabilitydistributionfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60E99) states: 1 Definition Let ( Ω , 𝔅 , μ ) be a measure space . A probability distribution function on Ω is a function f : Ω ⟶ ℝ such that: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.commutativelanguage","kind":"concept","label":"Commutative language","sources":[{"id":"planetmath.commutativelanguage","title":"PlanetMath entry commutativelanguage","url":"https://planetmath.org/commutativelanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q70) states: Let Σ be an alphabet and u a word over Σ . Write u as a product of symbols in Σ : u = a 1 ⁢ ⋯ ⁢ a n where a i ∈ Σ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismoflanguages","kind":"concept","label":"Homomorphism of languages","sources":[{"id":"planetmath.homomorphismoflanguages","title":"PlanetMath entry homomorphismoflanguages","url":"https://planetmath.org/homomorphismoflanguages"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45) states: Let Σ 1 and Σ 2 be two alphabets . A function h : Σ 1 * → Σ 2 * is called a homomorphism if it is a semigroup homomorphism from semigroups Σ 1 * to Σ 2 * .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.mcalistercoveringtheorem","kind":"theory","label":"McAlister covering theorem","sources":[{"id":"planetmath.mcalistercoveringtheorem","title":"PlanetMath entry mcalistercoveringtheorem","url":"https://planetmath.org/mcalistercoveringtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 20M18) states: A subset X in an inverse semigroup S is called unitary if for any elements x ∈ X and s ∈ S , x ⁢ s ∈ X or s ⁢ x ∈ X implies s ∈ X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monoid","kind":"concept","label":"Monoid","sources":[{"id":"planetmath.monoid","title":"PlanetMath entry monoid","url":"https://planetmath.org/monoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99, 34-01) states: A monoid is a semigroup G which contains an identity element ; that is, there exists an element e ∈ G such that e ⋅ a = a ⋅ e = a for all a ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.quotientgroup","kind":"concept","label":"Quotient group","sources":[{"id":"planetmath.quotientgroup","title":"PlanetMath entry quotientgroup","url":"https://planetmath.org/quotientgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20-00) states: Before defining quotient groups , some preliminary definitions must be introduced and a few established.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.semigroup","kind":"concept","label":"Semigroup","sources":[{"id":"planetmath.semigroup","title":"PlanetMath entry semigroup","url":"https://planetmath.org/semigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99) states: A semigroup G is a set together with a binary operation ⋅ : G × G ⟶ G which satisfies the associative property: ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) for all a , b , c ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.biops","kind":"concept","label":"Biops","sources":[{"id":"planetmath.biops","title":"PlanetMath entry biops","url":"https://planetmath.org/biops"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A99) states: Let S be a set and n ∈ 𝐍 . Set 𝐍 n := { i ∈ 𝐍 | i < n } . If there exists a map ⋅ : 𝐍 n → ( S 2 → S ) : i ↦ ⋅ i where ⋅ i : S 2 → S : ( a , b ) ↦ a ⋅ i b is a binary operation , then I shall say that ( S , ⋅ ) is an n -biops .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.division","kind":"concept","label":"Division","sources":[{"id":"planetmath.division","title":"PlanetMath entry division","url":"https://planetmath.org/division"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05, 12E99) states: Division is the operation which assigns to every two numbers (or more generally, elements of a field) a and b their quotient or ratio, provided that the latter, b , is distinct from zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.expression","kind":"concept","label":"Expression","sources":[{"id":"planetmath.expression","title":"PlanetMath entry expression","url":"https://planetmath.org/expression"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: An expression is a symbol or of symbols used to denote a quantity or value.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.characteristicsubgroup","kind":"concept","label":"Characteristic subgroup","sources":[{"id":"planetmath.characteristicsubgroup","title":"PlanetMath entry characteristicsubgroup","url":"https://planetmath.org/characteristicsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: If ( G , * ) is a group, then H is a characteristic subgroup of G (written H ⁢ char ⁡ G ) if every automorphism of G maps H to itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sectionofagroup","kind":"concept","label":"Section of a group","sources":[{"id":"planetmath.sectionofagroup","title":"PlanetMath entry sectionofagroup","url":"https://planetmath.org/sectionofagroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20F99) states: A section of a group G is a quotient ( http://planetmath.org/QuotientGroup ) of a subgroup of G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.singleton","kind":"concept","label":"Singleton","sources":[{"id":"planetmath.singleton","title":"PlanetMath entry singleton","url":"https://planetmath.org/singleton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A singleton is a set containing a single element.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.variable","kind":"concept","label":"Variable","sources":[{"id":"planetmath.variable","title":"PlanetMath entry variable","url":"https://planetmath.org/variable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: The word variable as used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the context .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.grouprepresentation","kind":"concept","label":"Group representation","sources":[{"id":"planetmath.grouprepresentation","title":"PlanetMath entry grouprepresentation","url":"https://planetmath.org/grouprepresentation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20C99) states: Let G be a group, and let V be a vector space . A representation of G in V is a group homomorphism ρ : G → GL ⁡ ( V ) from G to the general linear group GL ⁡ ( V ) of invertible linear transformations of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closureofasubsetunderrelations","kind":"concept","label":"Closure of a subset under relations","sources":[{"id":"planetmath.closureofasubsetunderrelations","title":"PlanetMath entry closureofasubsetunderrelations","url":"https://planetmath.org/closureofasubsetunderrelations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A02) states: Let A be a set and R be an n -ary relation on A , n ≥ 1 . A subset B of A is said to be closed under R , or R -closed , if, whenever b 1 , … , b n - 1 ∈ B , and ( b 1 , … , b n - 1 , b n ) ∈ R , then b n ∈ B .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coset","kind":"concept","label":"Coset","sources":[{"id":"planetmath.coset","title":"PlanetMath entry coset","url":"https://planetmath.org/coset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Let H be a subgroup of a group G , and let a ∈ G . The left coset of a with respect to H in G is defined to be the set a ⁢ H := { a ⁢ h ∣ h ∈ H } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.leftidentityandrightidentity","kind":"concept","label":"Left identity and right identity","sources":[{"id":"planetmath.leftidentityandrightidentity","title":"PlanetMath entry leftidentityandrightidentity","url":"https://planetmath.org/leftidentityandrightidentity"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let G be a groupoid . An element e ∈ G is called a left identity element if e ⁢ x = x for all x ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.conceptsinabstractalgebra","kind":"concept","label":"Concepts in abstract algebra","sources":[{"id":"planetmath.conceptsinabstractalgebra","title":"PlanetMath entry conceptsinabstractalgebra","url":"https://planetmath.org/conceptsinabstractalgebra"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55-00, 18-00, 16-00, 13-00, 20-00, 15-00) states: The aim of this entry is to present a list of the key operators used in abstract algebra .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.euclideanspace","kind":"concept","label":"Euclidean space","sources":[{"id":"planetmath.euclideanspace","title":"PlanetMath entry euclideanspace","url":"https://planetmath.org/euclideanspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03, 51M05) states: 1 Definition Euclidean n -space is a metric space ( E , d ) with the property that the group of isometries is transitive and is isomorphic to an n -dimensional Euclidean vector space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fractionalidealofcommutativering","kind":"concept","label":"Fractional ideal of commutative ring","sources":[{"id":"planetmath.fractionalidealofcommutativering","title":"PlanetMath entry fractionalidealofcommutativering","url":"https://planetmath.org/fractionalidealofcommutativering"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B30) states: Definition. Let R be a commutative ring having a regular element and let T be the total ring of fractions of R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.invertiblelineartransformation","kind":"concept","label":"Invertible linear transformation","sources":[{"id":"planetmath.invertiblelineartransformation","title":"PlanetMath entry invertiblelineartransformation","url":"https://planetmath.org/invertiblelineartransformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: An invertible linear transformation is a linear transformation T : V ⟶ W which is a bijection .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.matrixinverse","kind":"concept","label":"Matrix inverse","sources":[{"id":"planetmath.matrixinverse","title":"PlanetMath entry matrixinverse","url":"https://planetmath.org/matrixinverse"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A09) states: 1 Matrix Inverse The inverse of an n × n matrix A is denoted by A - 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subalgebraofanalgebraicsystem","kind":"concept","label":"Subalgebra of an algebraic system","sources":[{"id":"planetmath.subalgebraofanalgebraicsystem","title":"PlanetMath entry subalgebraofanalgebraicsystem","url":"https://planetmath.org/subalgebraofanalgebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A30, 08A05, 08A62) states: Let ( A , O ) be an algebraic system ( A ≠ ∅ is the underlying set and O is the set of operators on A ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.higherorderfunction","kind":"concept","label":"Higher-order function","sources":[{"id":"planetmath.higherorderfunction","title":"PlanetMath entry higherorderfunction","url":"https://planetmath.org/higherorderfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q01) states: Any function that maps a function to anything or maps anything to a function is a higher-order function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.crossproduct","kind":"concept","label":"Cross product","sources":[{"id":"planetmath.crossproduct","title":"PlanetMath entry crossproduct","url":"https://planetmath.org/crossproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A90, 15A72) states: \\PMlinkescapephrase imaginary part \\PMlinkescapephrase real part \\PMlinkescapephrase spanned by The cross product (or vector product ) of two vectors in ℝ 3 is a vector http://planetmath.org/node/1285 orthogonal to the plane of the two vectors being crossed, whose magnitude is equal to the area of the parallelogram defined by the two vectors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimension","kind":"concept","label":"Dimension","sources":[{"id":"planetmath.dimension","title":"PlanetMath entry dimension","url":"https://planetmath.org/dimension"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 00-01, 15A03, 54F45) states: The word dimension in mathematics has many definitions, but all of them are trying to quantify our intuition that, for example, a sheet of paper has somehow one less dimension than a stack of papers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dotproduct","kind":"concept","label":"Dot product","sources":[{"id":"planetmath.dotproduct","title":"PlanetMath entry dotproduct","url":"https://planetmath.org/dotproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 83C05, 15A63, 14-02, 14-01) states: Let u = ( u 1 , u 2 , … , u n ) and v = ( v 1 , v 2 , … , v n ) two vectors on k n where k is a field (like ℝ or ℂ ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.inversenumber","kind":"concept","label":"Inverse number","sources":[{"id":"planetmath.inversenumber","title":"PlanetMath entry inversenumber","url":"https://planetmath.org/inversenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12E99, 00A05) states: The inverse number or reciprocal number of a non-zero real or complex number a may be denoted by a - 1 , and it the quotient 1 a (so, it is really the - 1 th power of a ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorproductingeneralvectorspaces","kind":"concept","label":"Vector product in general vector spaces","sources":[{"id":"planetmath.vectorproductingeneralvectorspaces","title":"PlanetMath entry vectorproductingeneralvectorspaces","url":"https://planetmath.org/vectorproductingeneralvectorspaces"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A72) states: The vector product can be defined in any finite dimensional vector space V with dim ⁡ V = n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorsubspace","kind":"concept","label":"Vector subspace","sources":[{"id":"planetmath.vectorsubspace","title":"PlanetMath entry vectorsubspace","url":"https://planetmath.org/vectorsubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Definition Let V be a vector space over a field F , and let W be a subset of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bicyclicsemigroup","kind":"concept","label":"Bicyclic semigroup","sources":[{"id":"planetmath.bicyclicsemigroup","title":"PlanetMath entry bicyclicsemigroup","url":"https://planetmath.org/bicyclicsemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99) states: The bicyclic semigroup 𝒞 ⁢ ( p , q ) is the monoid generated by { p , q } with the single relation p ⁢ q = 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.classicalringofquotients","kind":"concept","label":"Classical ring of quotients","sources":[{"id":"planetmath.classicalringofquotients","title":"PlanetMath entry classicalringofquotients","url":"https://planetmath.org/classicalringofquotients"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16U20, 16S90) states: Let R be a ring. An element of R is called regular if it is not a right zero divisor or a left zero divisor in R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ideal1","kind":"concept","label":"Ideal","sources":[{"id":"planetmath.ideal1","title":"PlanetMath entry ideal1","url":"https://planetmath.org/ideal1"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M12, 20M10) states: Let S be a semigroup . An ideal of S is a non-empty subset of S which is closed under multiplication on either side by elements of S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idempotency","kind":"concept","label":"Idempotency","sources":[{"id":"planetmath.idempotency","title":"PlanetMath entry idempotency","url":"https://planetmath.org/idempotency"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02) states: If ( S , * ) is a magma, then an element x ∈ S is said to be idempotent if x * x = x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idempotent","kind":"concept","label":"Idempotent","sources":[{"id":"planetmath.idempotent","title":"PlanetMath entry idempotent","url":"https://planetmath.org/idempotent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16U99, 20M99) states: An element x of a ring is called an idempotent element , or simply an idempotent if x 2 = x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.principalideal","kind":"concept","label":"Principal ideal","sources":[{"id":"planetmath.principalideal","title":"PlanetMath entry principalideal","url":"https://planetmath.org/principalideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13A15, 16D25, 81-00, 82-00, 83-00, 46L05) states: Let R be a ring and let a ∈ R . The principal left (resp.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.regularspace","kind":"concept","label":"Regular space","sources":[{"id":"planetmath.regularspace","title":"PlanetMath entry regularspace","url":"https://planetmath.org/regularspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: Definition 1 . A topological space is a regular space if it is both a T 0 space ( http://planetmath.org/T0Space ) and a T 3 space ( http://planetmath.org/T3Space ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.separationaxioms","kind":"concept","label":"Separation axioms","sources":[{"id":"planetmath.separationaxioms","title":"PlanetMath entry separationaxioms","url":"https://planetmath.org/separationaxioms"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10, 54D15) states: The separation axioms are additional conditions which may be required to a topological space in order to ensure that some particular types of sets can be separated by open sets , thus avoiding certain pathological cases.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetricinversesemigroup","kind":"concept","label":"Symmetric inverse semigroup","sources":[{"id":"planetmath.symmetricinversesemigroup","title":"PlanetMath entry symmetricinversesemigroup","url":"https://planetmath.org/symmetricinversesemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M18) states: Let X be a set. A partial map on X is an application defined from a subset of X into X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.t3space","kind":"concept","label":"T3 space","sources":[{"id":"planetmath.t3space","title":"PlanetMath entry t3space","url":"https://planetmath.org/t3space"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: A regular space is a topological space in which points and closed sets can be separated by open sets ; in other words, given a closed set A and a point x ∉ A , there are disjoint open sets U and V such that x ∈ U and A ⊆ V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tychonoffspace","kind":"concept","label":"Tychonoff space","sources":[{"id":"planetmath.tychonoffspace","title":"PlanetMath entry tychonoffspace","url":"https://planetmath.org/tychonoffspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D15) states: A topological space X is said to be completely regular if whenever C ⊆ X is closed and x ∈ X ∖ C then there is a continuous function f : X → [ 0 , 1 ] with f ⁢ ( x ) = 0 and f ⁢ ( C ) ⊆ { 1 } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vonneumannregular","kind":"concept","label":"Von Neumann regular","sources":[{"id":"planetmath.vonneumannregular","title":"PlanetMath entry vonneumannregular","url":"https://planetmath.org/vonneumannregular"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16E50) states: An element a of a ring R is said to be von Neumann regular if there exists b ∈ R such that a ⁢ b ⁢ a = a .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.maximalsubgroup","kind":"concept","label":"Maximal subgroup","sources":[{"id":"planetmath.maximalsubgroup","title":"PlanetMath entry maximalsubgroup","url":"https://planetmath.org/maximalsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20E28) states: Let G be a group. A subgroup H of G is said to be a maximal subgroup of G if H ≠ G and there is no subgroup K of G such that H < K < G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idealgeneratedbyasubsetofaring","kind":"concept","label":"Ideal generated by a subset of a ring","sources":[{"id":"planetmath.idealgeneratedbyasubsetofaring","title":"PlanetMath entry idealgeneratedbyasubsetofaring","url":"https://planetmath.org/idealgeneratedbyasubsetofaring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D25) states: Let X be a subset of a ring R . Let S = { I k } be the collection of all left ideals of R that contain X (note that the set is nonempty since X ⊂ R and R is an ideal in itself).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.integraldomain","kind":"concept","label":"Integral domain","sources":[{"id":"planetmath.integraldomain","title":"PlanetMath entry integraldomain","url":"https://planetmath.org/integraldomain"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13G05) states: An integral domain , or domain , is a commutative cancellation ring with an identity element 1 ≠ 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.latticeideal","kind":"concept","label":"Lattice ideal","sources":[{"id":"planetmath.latticeideal","title":"PlanetMath entry latticeideal","url":"https://planetmath.org/latticeideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B10) states: Let L be a lattice . An ideal I of L is a non-empty subset of L such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderideal","kind":"concept","label":"Order ideal","sources":[{"id":"planetmath.orderideal","title":"PlanetMath entry orderideal","url":"https://planetmath.org/orderideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06, 06A12) states: Order Ideals and Filters Let P be a poset. A subset I of P is said to be an order ideal if • I is a lower set : ↓ I = I , and • I is a directed set : I is non-empty, and every pair of elements in I has an upper bound in I .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.polynomialringoverintegraldomain","kind":"theory","label":"Polynomial ring over integral domain","sources":[{"id":"planetmath.polynomialringoverintegraldomain","title":"PlanetMath entry polynomialringoverintegraldomain","url":"https://planetmath.org/polynomialringoverintegraldomain"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 13P05) states: Theorem . If the coefficient ring R is an integral domain , then so is also its polynomial ring R ⁢ [ X ] .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zerodivisor","kind":"concept","label":"Zero divisor","sources":[{"id":"planetmath.zerodivisor","title":"PlanetMath entry zerodivisor","url":"https://planetmath.org/zerodivisor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13G05) states: Let a be a nonzero element of a ring R . The element a is a left zero divisor if there exists a nonzero element b ∈ R such that a ⋅ b = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.canonicalprojection","kind":"concept","label":"Canonical projection","sources":[{"id":"planetmath.canonicalprojection","title":"PlanetMath entry canonicalprojection","url":"https://planetmath.org/canonicalprojection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20-00) states: Given a group G and a normal subgroup N ⊲ G there is an epimorphism π : G → G / N defined by sending an element g ∈ G to its coset g ⁢ N .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.involutoryring","kind":"concept","label":"Involutory ring","sources":[{"id":"planetmath.involutoryring","title":"PlanetMath entry involutoryring","url":"https://planetmath.org/involutoryring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16W10) states: General Definition of a Ring with Involution Let R be a ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.noncommutativestructure","kind":"concept","label":"Non-commutative structure","sources":[{"id":"planetmath.noncommutativestructure","title":"PlanetMath entry noncommutativestructure","url":"https://planetmath.org/noncommutativestructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55-00, 18-00) states: Definition 0.1 . Let ( C , ∘ ) be a structure consisting of a class , C , together with a binary operation ∘ defined for pairs of objects in C (or elements of C when the latter is a small class, i.e., a set).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subcommutative","kind":"concept","label":"Subcommutative","sources":[{"id":"planetmath.subcommutative","title":"PlanetMath entry subcommutative","url":"https://planetmath.org/subcommutative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M25, 20M99) states: A semigroup ( S , ⋅ ) is said to be left subcommutative if for any two of its elements a and b , there exists its element c such that a ⁢ b = c ⁢ a .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.compositenumber","kind":"concept","label":"Composite number","sources":[{"id":"planetmath.compositenumber","title":"PlanetMath entry compositenumber","url":"https://planetmath.org/compositenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A41) states: A composite number is a positive integer which is not prime and not equal to 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.goldenratio","kind":"concept","label":"Golden ratio","sources":[{"id":"planetmath.goldenratio","title":"PlanetMath entry goldenratio","url":"https://planetmath.org/goldenratio"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 40A05, 11B39) states: The “ Golden Ratio ”, or ϕ , has the value 1.61803398874989484820 ⁢ … This number gets its rather illustrious name from the fact that the Greeks thought that a rectangle with ratio of side lengths equal to ϕ was the most pleasing to the eye, and much of classical Greek architecture is based on this premise .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sphenicnumber","kind":"concept","label":"Sphenic number","sources":[{"id":"planetmath.sphenicnumber","title":"PlanetMath entry sphenicnumber","url":"https://planetmath.org/sphenicnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A05) states: Given three primes p < q < r , the composite integer p ⁢ q ⁢ r is a sphenic number .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.welldefined","kind":"concept","label":"Well-defined","sources":[{"id":"planetmath.welldefined","title":"PlanetMath entry welldefined","url":"https://planetmath.org/welldefined"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A mathematical concept is well-defined (German wohldefiniert , French bien défini ), if its contents is on the form or the alternative representative which is used for defining it.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.nearring","kind":"concept","label":"Near-ring","sources":[{"id":"planetmath.nearring","title":"PlanetMath entry nearring","url":"https://planetmath.org/nearring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16Y30) states: Definitions A near-ring is a set ( http://planetmath.org/Set ) N together with two binary operations , denoted + : N × N → N and ⋅ : N × N → N , such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.annihilator","kind":"concept","label":"Annihilator","sources":[{"id":"planetmath.annihilator","title":"PlanetMath entry annihilator","url":"https://planetmath.org/annihilator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D10) states: Let R be a ring, and suppose that M is a left R -module and N a right R -module.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderpreservingmap","kind":"concept","label":"Order-preserving map","sources":[{"id":"planetmath.orderpreservingmap","title":"PlanetMath entry orderpreservingmap","url":"https://planetmath.org/orderpreservingmap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06) states: Order-preserving map from a poset L to a poset M is a function f such that ∀ x , y ∈ L : ( x ≥ y ⟹ f ( x ) ≥ f ( y ) ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.preorder","kind":"concept","label":"Pre-order","sources":[{"id":"planetmath.preorder","title":"PlanetMath entry preorder","url":"https://planetmath.org/preorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: Definition A pre-order on a set S is a relation ≲ on S satisfying the following two axioms: reflexivity : s ≲ s for all s ∈ S , and transitivity : If s ≲ t and t ≲ u , then s ≲ u ; for all s , t , u ∈ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fixedpointarithmetic","kind":"concept","label":"Fixed-point arithmetic","sources":[{"id":"planetmath.fixedpointarithmetic","title":"PlanetMath entry fixedpointarithmetic","url":"https://planetmath.org/fixedpointarithmetic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A63) states: For computation or display in fixed-point arithmetic , each real number x has a variable number k > 0 of integer digits d k - 1 , … , d 0 (in order left to right from the most to the least significant digit) in base b but always l fractional digits to the right of the point.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.infixnotation","kind":"concept","label":"Infix notation","sources":[{"id":"planetmath.infixnotation","title":"PlanetMath entry infixnotation","url":"https://planetmath.org/infixnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: Infix notation is how we usually read and write arithmetic expressions .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.negativenumber","kind":"concept","label":"Negative number","sources":[{"id":"planetmath.negativenumber","title":"PlanetMath entry negativenumber","url":"https://planetmath.org/negativenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A negative number is a number that is less than zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closuremap","kind":"concept","label":"Closure map","sources":[{"id":"planetmath.closuremap","title":"PlanetMath entry closuremap","url":"https://planetmath.org/closuremap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05, 06A15) states: Let P be a poset. A function c : P → P is called a closure map if • c is order preserving, • 1 P ≤ c , • c is idempotent : c ∘ c = c .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.irrational","kind":"concept","label":"Irrational","sources":[{"id":"planetmath.irrational","title":"PlanetMath entry irrational","url":"https://planetmath.org/irrational"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11J82, 11J72) states: An irrational number is a real number which cannot be represented as a ratio of two integers .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.iterator","kind":"concept","label":"Iterator","sources":[{"id":"planetmath.iterator","title":"PlanetMath entry iterator","url":"https://planetmath.org/iterator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N15) states: An iterator is a variable that one by one takes on all the values (usually integers) in a given range.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.lemma","kind":"concept","label":"Lemma","sources":[{"id":"planetmath.lemma","title":"PlanetMath entry lemma","url":"https://planetmath.org/lemma"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: There is no technical distinction a lemma, a proposition , and a theorem .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.perfectset","kind":"concept","label":"Perfect set","sources":[{"id":"planetmath.perfectset","title":"PlanetMath entry perfectset","url":"https://planetmath.org/perfectset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: A set is called perfect if it is equal to the set of its limit points .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.summation","kind":"concept","label":"Summation","sources":[{"id":"planetmath.summation","title":"PlanetMath entry summation","url":"https://planetmath.org/summation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 11B25, 00A05) states: Sigma notation Sigma notation is often used to write complicated sums in a concise and compact way.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.arithmetic","kind":"concept","label":"Arithmetic","sources":[{"id":"planetmath.arithmetic","title":"PlanetMath entry arithmetic","url":"https://planetmath.org/arithmetic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: Arithmetic is ” the science of numbers and operations on sets of numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.compact","kind":"concept","label":"Compact","sources":[{"id":"planetmath.compact","title":"PlanetMath entry compact","url":"https://planetmath.org/compact"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D30, 81-00, 83-00, 82-00, 46L05, 22A22) states: A topological space X is compact if, for every collection { U i } i ∈ I of open sets in X whose union is X , there exists a finite subcollection { U i j } j = 1 n whose union is also X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.mathematica","kind":"concept","label":"Mathematica","sources":[{"id":"planetmath.mathematica","title":"PlanetMath entry mathematica","url":"https://planetmath.org/mathematica"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 68W30) states: Mathematica is a computer algebra system produced by Wolfram Research.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multiplicationoperator","kind":"concept","label":"Multiplication operator","sources":[{"id":"planetmath.multiplicationoperator","title":"PlanetMath entry multiplicationoperator","url":"https://planetmath.org/multiplicationoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A99) states: A multiplication operator is an operator signifying multiplication among two or more operands.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.oddnumber","kind":"concept","label":"Odd number","sources":[{"id":"planetmath.oddnumber","title":"PlanetMath entry oddnumber","url":"https://planetmath.org/oddnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A51) states: An odd number n is an integer of the form 2 ⁢ m + 1 , and as such it is not divisible by 2.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.positiveelement","kind":"concept","label":"Positive element","sources":[{"id":"planetmath.positiveelement","title":"PlanetMath entry positiveelement","url":"https://planetmath.org/positiveelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46L05, 47L07, 47A05) states: Let H be a complex Hilbert space . Let T : H ⟶ H be a bounded operator in H .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tacitmultiplicationoperator","kind":"concept","label":"Tacit multiplication operator","sources":[{"id":"planetmath.tacitmultiplicationoperator","title":"PlanetMath entry tacitmultiplicationoperator","url":"https://planetmath.org/tacitmultiplicationoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A99) states: A tacit multiplication operator is a multiplication operator not actually written in a formula but usually understood from the context , at least by humans.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologyofthecomplexplane","kind":"concept","label":"Topology of the complex plane","sources":[{"id":"planetmath.topologyofthecomplexplane","title":"PlanetMath entry topologyofthecomplexplane","url":"https://planetmath.org/topologyofthecomplexplane"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 30-00) states: The usual topology for the complex plane ℂ is the topology induced by the metric d ⁢ ( x , y ) := | x - y | for x , y ∈ ℂ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finiteintersectionproperty","kind":"concept","label":"Finite intersection property","sources":[{"id":"planetmath.finiteintersectionproperty","title":"PlanetMath entry finiteintersectionproperty","url":"https://planetmath.org/finiteintersectionproperty"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D30) states: A collection 𝒜 = { A α } α ∈ I of subsets of a set X is said to have the finite intersection property , abbreviated f.i.p., if every finite subcollection { A 1 , A 2 , … , A n } of 𝒜 satisifes ⋂ i = 1 n A i ≠ ∅ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.limitpoint","kind":"concept","label":"Limit point","sources":[{"id":"planetmath.limitpoint","title":"PlanetMath entry limitpoint","url":"https://planetmath.org/limitpoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let X be a topological space , and let A ⊆ X . An element x ∈ X is said to be a limit point of A if every open set containing x also contains at least one point of A distinct from x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.net","kind":"concept","label":"Net","sources":[{"id":"planetmath.net","title":"PlanetMath entry net","url":"https://planetmath.org/net"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A20) states: Let X be a set. A net is a map from a directed set to X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.cover","kind":"concept","label":"Cover","sources":[{"id":"planetmath.cover","title":"PlanetMath entry cover","url":"https://planetmath.org/cover"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Definition ( [ 1 ] , pp. 49) Let Y be a subset of a set X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.boxtopology","kind":"concept","label":"Box topology","sources":[{"id":"planetmath.boxtopology","title":"PlanetMath entry boxtopology","url":"https://planetmath.org/boxtopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let { ( X α , 𝒯 α ) } α ∈ A be a family of topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.discrete","kind":"concept","label":"Discrete","sources":[{"id":"planetmath.discrete","title":"PlanetMath entry discrete","url":"https://planetmath.org/discrete"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: This entry aims at highlighting the fact that all uses of the word discrete in mathematics are directly related to the core concept of discrete space : • A discrete set is a set that, endowed with the topology implied by the context, is a \\PMlinkescaptetext discrete space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.egyptianfraction","kind":"concept","label":"Egyptian fraction","sources":[{"id":"planetmath.egyptianfraction","title":"PlanetMath entry egyptianfraction","url":"https://planetmath.org/egyptianfraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A35, 01A30, 01A20, 01A16) states: This narrative reports rational number as a/b rather than in the standard LaTeX fraction form.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hibehpapyrus","kind":"concept","label":"Hibeh Papyrus","sources":[{"id":"planetmath.hibehpapyrus","title":"PlanetMath entry hibehpapyrus","url":"https://planetmath.org/hibehpapyrus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A20, 01A16, 01A15) states: The http://mathforum.org/kb/plaintext.jspa?messageID=5539288 Hibeh Papyrus was written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.liberabaci","kind":"concept","label":"Liber Abaci","sources":[{"id":"planetmath.liberabaci","title":"PlanetMath entry liberabaci","url":"https://planetmath.org/liberabaci"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A35) states: Abstract (2015 Update): The “ Liber Abaci ”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to unit fraction by seven distinctions in a subtraction context .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.planetmath","kind":"concept","label":"PlanetMath","sources":[{"id":"planetmath.planetmath","title":"PlanetMath entry planetmath","url":"https://planetmath.org/planetmath"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A65, 01A61) states: PlanetMath is a free, collaborative, online mathematics encyclopedia.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hyperconnectedspace","kind":"concept","label":"Hyperconnected space","sources":[{"id":"planetmath.hyperconnectedspace","title":"PlanetMath entry hyperconnectedspace","url":"https://planetmath.org/hyperconnectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be hyperconnected if no pair of nonempty open sets of X is disjoint (or, equivalently, if X is not the union of two proper closed sets ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.pseudometrictopology","kind":"concept","label":"Pseudometric topology","sources":[{"id":"planetmath.pseudometrictopology","title":"PlanetMath entry pseudometrictopology","url":"https://planetmath.org/pseudometrictopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Let ( X , d ) be a pseudometric space . As in a metric space , we define B ε ⁢ ( x ) = { y ∈ X ∣ d ⁢ ( x , y ) < ε } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sequentiallycompact","kind":"concept","label":"Sequentially compact","sources":[{"id":"planetmath.sequentiallycompact","title":"PlanetMath entry sequentiallycompact","url":"https://planetmath.org/sequentiallycompact"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 40A05, 54D30) states: A topological space X is sequentially compact if every sequence in X has a convergent subsequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ultraconnectedspace","kind":"concept","label":"Ultraconnected space","sources":[{"id":"planetmath.ultraconnectedspace","title":"PlanetMath entry ultraconnectedspace","url":"https://planetmath.org/ultraconnectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be ultraconnected if no pair of nonempty closed sets of X is disjoint.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.algebraicgeometry","kind":"concept","label":"Algebraic geometry","sources":[{"id":"planetmath.algebraicgeometry","title":"PlanetMath entry algebraicgeometry","url":"https://planetmath.org/algebraicgeometry"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 14-00) states: Introduction Algebraic geometry is the study of algebraic objects using geometrical tools.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.amsmscclassificationofarticlesandconversiontables","kind":"concept","label":"AMS MSC classification of articles and conversion tables","sources":[{"id":"planetmath.amsmscclassificationofarticlesandconversiontables","title":"PlanetMath entry amsmscclassificationofarticlesandconversiontables","url":"https://planetmath.org/amsmscclassificationofarticlesandconversiontables"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 00-02, 00-01) states: 1 Links to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website Because the AMS MSC classification list or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the complete Table of AMS MSC2010 classifications: http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf All MSC 2010 in one PDF : http://www.ams.org/mathscinet/msc/msc2010.html The AMS MSC website with its maths specialized Search Engine 1.1 Conversion Tables http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf CONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000 M ⁢ S ⁢ C ⁢ 2000 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s → M ⁢ S ⁢ C ⁢ 2010 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s ⁢ U ⁢ p ⁢ d ⁢ a ⁢ t ⁢ e .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.categoricalquantumlmlogicalgebras","kind":"concept","label":"Categorical quantum LM- logic algebras","sources":[{"id":"planetmath.categoricalquantumlmlogicalgebras","title":"PlanetMath entry categoricalquantumlmlogicalgebras","url":"https://planetmath.org/categoricalquantumlmlogicalgebras"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U99, 55U40, 55U35, 55U30, 81T05, 18A40, 18A15, 18A05, 18A99) states: \\xyoption curve 0.1 Quantum LM-algebraic Logic 0.1.1 Fundamental concepts of space and time in quantum theory vs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.connectedposet","kind":"concept","label":"Connected poset","sources":[{"id":"planetmath.connectedposet","title":"PlanetMath entry connectedposet","url":"https://planetmath.org/connectedposet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A07) states: Let P be a poset. Write a ⟂ b if either a ≤ b or b ≤ a . In other words, a ⟂ b if a and b are comparable .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimensionofaposet","kind":"concept","label":"Dimension of a poset","sources":[{"id":"planetmath.dimensionofaposet","title":"PlanetMath entry dimensionofaposet","url":"https://planetmath.org/dimensionofaposet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06, 06A07) states: Let P be a finite poset and ℛ be the family of all realizers of P .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.graphtheory","kind":"concept","label":"Graph theory","sources":[{"id":"planetmath.graphtheory","title":"PlanetMath entry graphtheory","url":"https://planetmath.org/graphtheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 81Q30, 18G30, 05C50, 55U10, 18-00, 05C25, 05C99) states: Graph theory is the branch of mathematics that concerns itself with graphs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupcohomologytopologicaldefinition","kind":"concept","label":"Group cohomology","sources":[{"id":"planetmath.groupcohomologytopologicaldefinition","title":"PlanetMath entry groupcohomologytopologicaldefinition","url":"https://planetmath.org/groupcohomologytopologicaldefinition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N25) states: Let G be a topological group . Suppose some contractible space X admits a fixed point free action of G , so that the quotient map p : X → X / G is a fibre map .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homology","kind":"concept","label":"Homology","sources":[{"id":"planetmath.homology","title":"PlanetMath entry homology","url":"https://planetmath.org/homology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N10) states: Homology is the general name for a number of functors from topological spaces to abelian groups (or more generally modules over a fixed ring).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.quantumfieldtheoriesqft","kind":"concept","label":"Quantum field theories (QFT)","sources":[{"id":"planetmath.quantumfieldtheoriesqft","title":"PlanetMath entry quantumfieldtheoriesqft","url":"https://planetmath.org/quantumfieldtheoriesqft"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U99, 81T80, 81T75, 81T70, 81T60, 81T40, 81T25, 81T18, 81T13, 81T10, 81T05) states: This topic links the general framework of quantum field theories to group symmetries and other relevant mathematical concepts utilized to represent quantum fields and their fundamental properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sectionofafiberbundle","kind":"concept","label":"Section of a fiber bundle","sources":[{"id":"planetmath.sectionofafiberbundle","title":"PlanetMath entry sectionofafiberbundle","url":"https://planetmath.org/sectionofafiberbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R10) states: Let p : E → B be a fiber bundle , denoted by ξ . A section of ξ is a continuous map s : B → E such that the composition p ∘ s equals the identity .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.textbookprojectsonplanetmath","kind":"concept","label":"Textbook projects on PlanetMath","sources":[{"id":"planetmath.textbookprojectsonplanetmath","title":"PlanetMath entry textbookprojectsonplanetmath","url":"https://planetmath.org/textbookprojectsonplanetmath"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: This will be a guide to textbook projects on PM. Since I don’t know if there currently are any textbook projects on PM, this is just a “stub” entry for now.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topicsinalgebraictopology","kind":"concept","label":"Topics in algebraic topology","sources":[{"id":"planetmath.topicsinalgebraictopology","title":"PlanetMath entry topicsinalgebraictopology","url":"https://planetmath.org/topicsinalgebraictopology"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 57R19, 57N65, 11F23, 11E72, 18-00, 55N30, 55N15, 55N99, 55N40, 55N20, 55-01) states: 1 Algebraic topology topics 1.1 Introduction Algebraic topology (AT) utilizes algebraic approaches to solve topological problems, such as the classification of surfaces , proving duality theorems for manifolds and approximation theorems for topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.toytheorem","kind":"concept","label":"Toy theorem","sources":[{"id":"planetmath.toytheorem","title":"PlanetMath entry toytheorem","url":"https://planetmath.org/toytheorem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: A toy theorem is a simplified version of a more general theorem .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.universalbundle","kind":"concept","label":"Universal bundle","sources":[{"id":"planetmath.universalbundle","title":"PlanetMath entry universalbundle","url":"https://planetmath.org/universalbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R10, 55R15) states: Let G be a topological group . A universal bundle for G is a principal bundle p : E ⁢ G → B ⁢ G such that for any principal bundle π : E → B , with B a CW-complex , there is a map φ : B → B ⁢ G , unique up to homotopy , such that the pullback bundle φ * ⁢ ( p ) is equivalent to π , that is such that there is a bundle map φ ′ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorbundle","kind":"concept","label":"Vector bundle","sources":[{"id":"planetmath.vectorbundle","title":"PlanetMath entry vectorbundle","url":"https://planetmath.org/vectorbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R25) states: Basic definition A vector bundle is a fiber bundle having a vector space as a fiber and the general linear group of that vector space (or some subgroup ) as structure group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.interval","kind":"concept","label":"Interval","sources":[{"id":"planetmath.interval","title":"PlanetMath entry interval","url":"https://planetmath.org/interval"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D99, 26-00, 54C30) states: Loosely speaking, an interval is a part of the real numbers that start at one number and stops at another number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderedgeometry","kind":"concept","label":"Ordered geometry","sources":[{"id":"planetmath.orderedgeometry","title":"PlanetMath entry orderedgeometry","url":"https://planetmath.org/orderedgeometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51G05) states: \\PMlinkescapephrase line segment \\PMlinkescapephrase generated by \\PMlinkescapephrase opposite sides \\PMlinkescapephrase end points 1 Definition Let ( A , B ) be a linear ordered geometry , where A = ( P , n , I ) is an incidence geometry , and B is a strict betweenness relation .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.convergentsequence","kind":"concept","label":"Convergent sequence","sources":[{"id":"planetmath.convergentsequence","title":"PlanetMath entry convergentsequence","url":"https://planetmath.org/convergentsequence"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 40A05) states: A sequence x 0 , x 1 , x 2 , … in a metric space ( X , d ) is a convergent sequence if there exists a point x ∈ X such that, for every real number ϵ > 0 , there exists a natural number N such that d ⁢ ( x , x n ) < ϵ for all n > N .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.initialtopology","kind":"concept","label":"Initial topology","sources":[{"id":"planetmath.initialtopology","title":"PlanetMath entry initialtopology","url":"https://planetmath.org/initialtopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B99) states: Let X i , i ∈ I be any family of topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subbasis","kind":"concept","label":"Subbasis","sources":[{"id":"planetmath.subbasis","title":"PlanetMath entry subbasis","url":"https://planetmath.org/subbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let ( X , 𝒯 ) be a topological space . A subset 𝒜 ⊆ 𝒯 is said to be a subbasis if the collection ℬ of intersections of finitely many elements of 𝒜 is a basis ( http://planetmath.org/BasisTopologicalSpace ) for 𝒯 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismbetweenalgebraicsystems","kind":"concept","label":"Homomorphism between algebraic systems","sources":[{"id":"planetmath.homomorphismbetweenalgebraicsystems","title":"PlanetMath entry homomorphismbetweenalgebraicsystems","url":"https://planetmath.org/homomorphismbetweenalgebraicsystems"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A05) states: Let ( A , O ) , ( B , O ) be two algebraic systems with operator set O .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.framegroupoid","kind":"concept","label":"Frame groupoid","sources":[{"id":"planetmath.framegroupoid","title":"PlanetMath entry framegroupoid","url":"https://planetmath.org/framegroupoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 18B40, 55U40) states: Definition 0.1 . Let 𝒢 be a groupoid , defined as usual by a category in which all morphisms are invertible , with the structure maps s , t : G 1 ⟶ G 0 , and u : G 0 ⟶ G 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupoidrepresentation","kind":"concept","label":"Groupoid representation","sources":[{"id":"planetmath.groupoidrepresentation","title":"PlanetMath entry groupoidrepresentation","url":"https://planetmath.org/groupoidrepresentation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 55U40) states: Let q : E ⟶ M be a vector bundle , with E the total space , and M a smooth manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.normalsubgroup","kind":"concept","label":"Normal subgroup","sources":[{"id":"planetmath.normalsubgroup","title":"PlanetMath entry normalsubgroup","url":"https://planetmath.org/normalsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: A subgroup H of a group G is normal if a ⁢ H = H ⁢ a for all a ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallycompacthausdorffspaces","kind":"concept","label":"Locally compact Hausdorff spaces","sources":[{"id":"planetmath.locallycompacthausdorffspaces","title":"PlanetMath entry locallycompacthausdorffspaces","url":"https://planetmath.org/locallycompacthausdorffspaces"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U40, 55-00) states: 1 Locally compact Hausdorff spaces Definition 1.1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologicalvectorspace","kind":"concept","label":"Topological vector space","sources":[{"id":"planetmath.topologicalvectorspace","title":"PlanetMath entry topologicalvectorspace","url":"https://planetmath.org/topologicalvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A99) states: Definition A topological vector space is a pair ( V , 𝒯 ) , where V is a vector space over a topological field K , and 𝒯 is a topology on V such that under 𝒯 the scalar multiplication ( λ , v ) ↦ λ ⁢ v is a continuous function K × V → V and the vector addition ( v , w ) ↦ v + w is a continuous function V × V → V , where K × V and V × V are given the respective product topologies .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finitelygeneratedgroup","kind":"concept","label":"Finitely generated group","sources":[{"id":"planetmath.finitelygeneratedgroup","title":"PlanetMath entry finitelygeneratedgroup","url":"https://planetmath.org/finitelygeneratedgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: A finitely generated group is a group that has a finite generating set .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finitelygeneratedmodule","kind":"concept","label":"Finitely generated module","sources":[{"id":"planetmath.finitelygeneratedmodule","title":"PlanetMath entry finitelygeneratedmodule","url":"https://planetmath.org/finitelygeneratedmodule"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D10) states: A module X over a ring R is said to be finitely generated if there is a finite subset Y of X such that Y spans X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ringhomomorphism","kind":"concept","label":"Ring homomorphism","sources":[{"id":"planetmath.ringhomomorphism","title":"PlanetMath entry ringhomomorphism","url":"https://planetmath.org/ringhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B10, 16B99, 81P05) states: Let R and S be rings. A ring homomorphism is a function f : R ⟶ S such that: • f ⁢ ( a + b ) = f ⁢ ( a ) + f ⁢ ( b ) for all a , b ∈ R • f ⁢ ( a ⋅ b ) = f ⁢ ( a ) ⋅ f ⁢ ( b ) for all a , b ∈ R A ring isomorphism is a ring homomorphism which is a bijection .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.convexfunction","kind":"concept","label":"Convex function","sources":[{"id":"planetmath.convexfunction","title":"PlanetMath entry convexfunction","url":"https://planetmath.org/convexfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 52A41, 26A51, 26B25, 55Q05, 18G30, 18B40, 20J05, 20E07, 18-01, 20L05) states: Definition Suppose Ω is a convex set in a vector space over ℝ (or ℂ ), and suppose f is a function f : Ω → ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.innerproductspace","kind":"concept","label":"Inner product space","sources":[{"id":"planetmath.innerproductspace","title":"PlanetMath entry innerproductspace","url":"https://planetmath.org/innerproductspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46C99) states: An inner product space (or pre-Hilbert space ) is a vector space (over ℝ or ℂ ) with an inner product ⟨ ⋅ , ⋅ ⟩ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallyconvextopologicalvectorspace","kind":"concept","label":"Locally convex topological vector space","sources":[{"id":"planetmath.locallyconvextopologicalvectorspace","title":"PlanetMath entry locallyconvextopologicalvectorspace","url":"https://planetmath.org/locallyconvextopologicalvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A03, 46-00) states: Definition Let V be a topological vector space over a subfield of the complex numbers (usually taken to be ℝ or ℂ ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.partiallyorderedgroup","kind":"concept","label":"Partially ordered group","sources":[{"id":"planetmath.partiallyorderedgroup","title":"PlanetMath entry partiallyorderedgroup","url":"https://planetmath.org/partiallyorderedgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06F05, 06F20, 06F15, 20F60) states: A partially ordered group is a group G that is a poset at the same time, such that if a , b ∈ G and a ≤ b , then 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.presentationofagroup","kind":"concept","label":"Presentation of a group","sources":[{"id":"planetmath.presentationofagroup","title":"PlanetMath entry presentationofagroup","url":"https://planetmath.org/presentationofagroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05, 20F05) states: A presentation of a group G is a description of G in terms of generators and relations (sometimes also known as relators).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.sylvesterslaw","kind":"theory","label":"Sylvester’s law","sources":[{"id":"planetmath.sylvesterslaw","title":"PlanetMath entry sylvesterslaw","url":"https://planetmath.org/sylvesterslaw"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A03) states: Let V be an n -dimensional real vector space and let Q : V × V → ℝ be a symmetric quadratic form .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.seminorm","kind":"concept","label":"Seminorm","sources":[{"id":"planetmath.seminorm","title":"PlanetMath entry seminorm","url":"https://planetmath.org/seminorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B20) states: Let V be a real, or a complex vector space , with K denoting the corresponding field of scalars.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.unitvector","kind":"concept","label":"Unit vector","sources":[{"id":"planetmath.unitvector","title":"PlanetMath entry unitvector","url":"https://planetmath.org/unitvector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: A unit vector is a unit-length element of Euclidean space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.invariantsubspace","kind":"concept","label":"Invariant subspace","sources":[{"id":"planetmath.invariantsubspace","title":"PlanetMath entry invariantsubspace","url":"https://planetmath.org/invariantsubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Let T : V → V be a linear transformation of a vector space V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.stablesubspace","kind":"concept","label":"Stable subspace","sources":[{"id":"planetmath.stablesubspace","title":"PlanetMath entry stablesubspace","url":"https://planetmath.org/stablesubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A subset S of a larger set T is said to a stable subset for a function f : T → T iff f ⁢ ( S ) ⊂ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.boundedfunction","kind":"concept","label":"Bounded function","sources":[{"id":"planetmath.boundedfunction","title":"PlanetMath entry boundedfunction","url":"https://planetmath.org/boundedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46-00) states: Definition Suppose X is a nonempty set . Then a function f : X → ℂ is a if there exist a C < ∞ such that | f ⁢ ( x ) | < C for all x ∈ X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearfunctional","kind":"concept","label":"Linear functional","sources":[{"id":"planetmath.linearfunctional","title":"PlanetMath entry linearfunctional","url":"https://planetmath.org/linearfunctional"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A99) states: Let V be a vector space over a field K . A linear functional (or linear form ) on V is a linear mapping ϕ : V → K , where K is thought of as a one-dimensional vector space over itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.adjointendomorphism","kind":"concept","label":"Adjoint endomorphism","sources":[{"id":"planetmath.adjointendomorphism","title":"PlanetMath entry adjointendomorphism","url":"https://planetmath.org/adjointendomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04, 15A63) states: Definition (the bilinear case). Let U be a finite-dimensional vector space over a field 𝕂 , and B : U × U → 𝕂 a symmetric , non-degenerate bilinear mapping , for example a real inner product .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.alternatingform","kind":"concept","label":"Alternating form","sources":[{"id":"planetmath.alternatingform","title":"PlanetMath entry alternatingform","url":"https://planetmath.org/alternatingform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A63) states: A bilinear form A on a vector space V (over a field k ) is called an alternating form if for all v ∈ V , A ⁢ ( v , v ) = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.antisymmetricmapping","kind":"concept","label":"Antisymmetric mapping","sources":[{"id":"planetmath.antisymmetricmapping","title":"PlanetMath entry antisymmetricmapping","url":"https://planetmath.org/antisymmetricmapping"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69, 15A63) states: Let U and V be a vector spaces over a field K . A bilinear mapping B : U × U → V is said to be antisymmetric if B ⁢ ( u , u ) = 0 (1) for all u ∈ U .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bilinearmap","kind":"concept","label":"Bilinear map","sources":[{"id":"planetmath.bilinearmap","title":"PlanetMath entry bilinearmap","url":"https://planetmath.org/bilinearmap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13C99) states: Let R be a ring, and let M , N and P be modules over R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.characteristic","kind":"concept","label":"Characteristic","sources":[{"id":"planetmath.characteristic","title":"PlanetMath entry characteristic","url":"https://planetmath.org/characteristic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12E99) states: Let ( F , + , ⋅ ) be a field. The characteristic Char ⁡ ( F ) of F is commonly given by one of three equivalent definitions : • if there is some positive integer n for which the result of adding any element to itself n times yields 0 , then the characteristic of the field is the least such n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.complementarysubspace","kind":"concept","label":"Complementary subspace","sources":[{"id":"planetmath.complementarysubspace","title":"PlanetMath entry complementarysubspace","url":"https://planetmath.org/complementarysubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Direct sum decomposition. Let U be a vector space , and V , W ⊂ U subspaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dualhomomorphism","kind":"concept","label":"Dual homomorphism","sources":[{"id":"planetmath.dualhomomorphism","title":"PlanetMath entry dualhomomorphism","url":"https://planetmath.org/dualhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A72, 15A04) states: Definition. Let U , V be vector spaces over a field 𝕂 , and T : U → V be a homomorphism (a linear map ) between them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.euclideanfield","kind":"concept","label":"Euclidean field","sources":[{"id":"planetmath.euclideanfield","title":"PlanetMath entry euclideanfield","url":"https://planetmath.org/euclideanfield"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D15) states: An ordered field F is Euclidean if every non-negative element a ( a ≥ 0 ) is a square in F (there exists b ∈ F such that b 2 = a ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identitymatrix","kind":"concept","label":"Identity matrix","sources":[{"id":"planetmath.identitymatrix","title":"PlanetMath entry identitymatrix","url":"https://planetmath.org/identitymatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-01, 15A57) states: The n × n identity matrix I (or I n ) over a ring R (with an identity 1) is the square matrix with coefficients in R given by I = [ 1 0 ⋯ 0 0 1 ⋯ 0 0 0 ⋱ 0 0 0 ⋯ 1 ] , where the numeral “1” and “0” respectively represent the multiplicative and additive identities in R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.innerproduct","kind":"concept","label":"Inner product","sources":[{"id":"planetmath.innerproduct","title":"PlanetMath entry innerproduct","url":"https://planetmath.org/innerproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11E39, 15A63) states: An inner product on a vector space V over a field K (which must be either the field ℝ of real numbers or the field ℂ of complex numbers ) is a function ( , ) : V × V ⟶ K such that, for all k 1 , k 2 ∈ K and 𝐯 1 , 𝐯 2 , 𝐯 , 𝐰 ∈ V , the following properties hold: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monoidalcategory","kind":"concept","label":"Monoidal category","sources":[{"id":"planetmath.monoidalcategory","title":"PlanetMath entry monoidalcategory","url":"https://planetmath.org/monoidalcategory"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 81-00, 18-00, 18D10) states: A monoidal category is a category which has the structure of a monoid, that is, among the objects there is a binary operation which is associative and has an unique neutral or unit element.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multilinear","kind":"concept","label":"Multi-linear","sources":[{"id":"planetmath.multilinear","title":"PlanetMath entry multilinear","url":"https://planetmath.org/multilinear"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69) states: Let V 1 , V 2 , … , V n , W be vector spaces over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.nondegeneratebilinearform","kind":"concept","label":"Non-degenerate bilinear form","sources":[{"id":"planetmath.nondegeneratebilinearform","title":"PlanetMath entry nondegeneratebilinearform","url":"https://planetmath.org/nondegeneratebilinearform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39) states: A bilinear form B over a vector space V is said to be non-degenerate when • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐱 ∈ V , then 𝐲 = 𝟎 , and • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐲 ∈ V , then 𝐱 = 𝟎 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.ranknullitytheorem","kind":"theory","label":"Rank-nullity theorem","sources":[{"id":"planetmath.ranknullitytheorem","title":"PlanetMath entry ranknullitytheorem","url":"https://planetmath.org/ranknullitytheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A03) states: Let V and W be vector spaces over the same field. If ϕ : V → W is a linear mapping , then dim ⁡ V = dim ⁡ ( ker ⁡ ϕ ) + dim ⁡ ( im ⁡ ϕ ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.spectraltheorem","kind":"theory","label":"Spectral theorem","sources":[{"id":"planetmath.spectraltheorem","title":"PlanetMath entry spectraltheorem","url":"https://planetmath.org/spectraltheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A23, 15A63, 15A18) states: Let U be a finite-dimensional , unitary space and let M : U → U be an endomorphism .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetricmatrix","kind":"concept","label":"Symmetric matrix","sources":[{"id":"planetmath.symmetricmatrix","title":"PlanetMath entry symmetricmatrix","url":"https://planetmath.org/symmetricmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Definition : Let A = ( a i ⁢ j ) be a square matrix of order n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetry","kind":"concept","label":"Symmetry","sources":[{"id":"planetmath.symmetry","title":"PlanetMath entry symmetry","url":"https://planetmath.org/symmetry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51A10, 15A04, 51A15) states: Let V be a Euclidean vector space , F ⊆ V , and E : V → V be a Euclidean transformation that is not the identity map .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tensorproduct","kind":"concept","label":"Tensor product","sources":[{"id":"planetmath.tensorproduct","title":"PlanetMath entry tensorproduct","url":"https://planetmath.org/tensorproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13-00, 18-00) states: Summary. The tensor product is a formal bilinear multiplication of two modules or vector spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tensorproductvectorspaces","kind":"concept","label":"Tensor product (vector spaces)","sources":[{"id":"planetmath.tensorproductvectorspaces","title":"PlanetMath entry tensorproductvectorspaces","url":"https://planetmath.org/tensorproductvectorspaces"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69) states: Definition . The classical conception of the tensor product operation involved finite dimensional vector spaces A , B , say over a field 𝕂 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearisomorphism","kind":"concept","label":"Linear isomorphism","sources":[{"id":"planetmath.linearisomorphism","title":"PlanetMath entry linearisomorphism","url":"https://planetmath.org/linearisomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Definition 1 . Suppose V and W are vector spaces and L : V → W is a linear map .","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044848","kind":"concept","label":"biological phase","sources":[{"id":"quickgo.go_0044848","title":"Gene Ontology term GO:0044848 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044848/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological phase as: A distinct period or stage in a biological process or cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043473","kind":"concept","label":"pigmentation","sources":[{"id":"quickgo.go_0043473","title":"Gene Ontology term GO:0043473 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043473/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigmentation as: The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0040007","kind":"concept","label":"growth","sources":[{"id":"quickgo.go_0040007","title":"Gene Ontology term GO:0040007 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0040007/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines growth as: The increase in size or mass of an entire organism, a part of an organism or a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016032","kind":"concept","label":"viral process","sources":[{"id":"quickgo.go_0016032","title":"Gene Ontology term GO:0016032 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016032/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral process as: A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022414","kind":"concept","label":"reproductive process","sources":[{"id":"quickgo.go_0022414","title":"Gene Ontology term GO:0022414 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022414/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process as: A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002376","kind":"concept","label":"immune system process","sources":[{"id":"quickgo.go_0002376","title":"Gene Ontology term GO:0002376 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002376/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system process as: Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009987","kind":"concept","label":"cellular process","sources":[{"id":"quickgo.go_0009987","title":"Gene Ontology term GO:0009987 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009987/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process as: Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0040011","kind":"concept","label":"locomotion","sources":[{"id":"quickgo.go_0040011","title":"Gene Ontology term GO:0040011 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0040011/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion as: Self-propelled movement of a cell or organism from one location to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048511","kind":"concept","label":"rhythmic process","sources":[{"id":"quickgo.go_0048511","title":"Gene Ontology term GO:0048511 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048511/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines rhythmic process as: Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0065007","kind":"concept","label":"biological regulation","sources":[{"id":"quickgo.go_0065007","title":"Gene Ontology term GO:0065007 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0065007/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological regulation as: Any process that modulates a measurable attribute of any biological process, quality or function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051703","kind":"concept","label":"biological process involved in intraspecies interaction between organisms","sources":[{"id":"quickgo.go_0051703","title":"Gene Ontology term GO:0051703 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051703/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in intraspecies interaction between organisms as: Any process in which an organism has an effect on an organism of the same species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032502","kind":"concept","label":"developmental process","sources":[{"id":"quickgo.go_0032502","title":"Gene Ontology term GO:0032502 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032502/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process as: A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032501","kind":"concept","label":"multicellular organismal process","sources":[{"id":"quickgo.go_0032501","title":"Gene Ontology term GO:0032501 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032501/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal process as: Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044419","kind":"concept","label":"biological process involved in interspecies interaction between organisms","sources":[{"id":"quickgo.go_0044419","title":"Gene Ontology term GO:0044419 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044419/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in interspecies interaction between organisms as: Any process evolved to enable an interaction with an organism of a different species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051179","kind":"concept","label":"localization","sources":[{"id":"quickgo.go_0051179","title":"Gene Ontology term GO:0051179 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051179/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization as: Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042592","kind":"concept","label":"homeostatic process","sources":[{"id":"quickgo.go_0042592","title":"Gene Ontology term GO:0042592 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042592/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines homeostatic process as: Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098754","kind":"concept","label":"detoxification","sources":[{"id":"quickgo.go_0098754","title":"Gene Ontology term GO:0098754 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098754/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification as: Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044423","kind":"concept","label":"virion component","sources":[{"id":"quickgo.go_0044423","title":"Gene Ontology term GO:0044423 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044423/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion component as: Any constituent part of a virion, a complete fully infectious extracellular virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0110165","kind":"concept","label":"cellular anatomical structure","sources":[{"id":"quickgo.go_0110165","title":"Gene Ontology term GO:0110165 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0110165/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular anatomical structure as: A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032991","kind":"concept","label":"protein-containing complex","sources":[{"id":"quickgo.go_0032991","title":"Gene Ontology term GO:0032991 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032991/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein-containing complex as: A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0072690","kind":"concept","label":"single-celled organism vegetative growth phase","sources":[{"id":"quickgo.go_0072690","title":"Gene Ontology term GO:0072690 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0072690/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-celled organism vegetative growth phase as: A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044851","kind":"concept","label":"hair cycle phase","sources":[{"id":"quickgo.go_0044851","title":"Gene Ontology term GO:0044851 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044851/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hair cycle phase as: The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0160266","kind":"concept","label":"anestrus phase","sources":[{"id":"quickgo.go_0160266","title":"Gene Ontology term GO:0160266 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0160266/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anestrus phase as: A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060206","kind":"concept","label":"estrous cycle phase","sources":[{"id":"quickgo.go_0060206","title":"Gene Ontology term GO:0060206 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060206/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines estrous cycle phase as: The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990636","kind":"concept","label":"reproductive senescence","sources":[{"id":"quickgo.go_1990636","title":"Gene Ontology term GO:1990636 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990636/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive senescence as: A life cycle stage during which the reproductive capacity and fitness of an organism declines.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022601","kind":"concept","label":"menstrual cycle phase","sources":[{"id":"quickgo.go_0022601","title":"Gene Ontology term GO:0022601 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022601/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines menstrual cycle phase as: The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022403","kind":"concept","label":"cell cycle phase","sources":[{"id":"quickgo.go_0022403","title":"Gene Ontology term GO:0022403 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022403/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle phase as: One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048066","kind":"concept","label":"developmental pigmentation","sources":[{"id":"quickgo.go_0048066","title":"Gene Ontology term GO:0048066 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048066/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental pigmentation as: The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033060","kind":"concept","label":"ocellus pigmentation","sources":[{"id":"quickgo.go_0033060","title":"Gene Ontology term GO:0033060 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033060/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ocellus pigmentation as: The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043476","kind":"concept","label":"pigment accumulation","sources":[{"id":"quickgo.go_0043476","title":"Gene Ontology term GO:0043476 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043476/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation as: The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033059","kind":"concept","label":"cellular pigmentation","sources":[{"id":"quickgo.go_0033059","title":"Gene Ontology term GO:0033059 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033059/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular pigmentation as: The deposition or aggregation of coloring matter in a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0080189","kind":"concept","label":"primary growth","sources":[{"id":"quickgo.go_0080189","title":"Gene Ontology term GO:0080189 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0080189/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines primary growth as: Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048589","kind":"concept","label":"developmental growth","sources":[{"id":"quickgo.go_0048589","title":"Gene Ontology term GO:0048589 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048589/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental growth as: The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016049","kind":"concept","label":"cell growth","sources":[{"id":"quickgo.go_0016049","title":"Gene Ontology term GO:0016049 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016049/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell growth as: The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030447","kind":"concept","label":"filamentous growth","sources":[{"id":"quickgo.go_0030447","title":"Gene Ontology term GO:0030447 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030447/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines filamentous growth as: The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0080190","kind":"concept","label":"lateral growth","sources":[{"id":"quickgo.go_0080190","title":"Gene Ontology term GO:0080190 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0080190/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral growth as: Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007117","kind":"concept","label":"budding cell bud growth","sources":[{"id":"quickgo.go_0007117","title":"Gene Ontology term GO:0007117 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007117/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines budding cell bud growth as: The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051606","kind":"concept","label":"detection of stimulus","sources":[{"id":"quickgo.go_0051606","title":"Gene Ontology term GO:0051606 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051606/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detection of stimulus as: The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006955","kind":"concept","label":"immune response","sources":[{"id":"quickgo.go_0006955","title":"Gene Ontology term GO:0006955 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006955/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune response as: Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043500","kind":"concept","label":"muscle adaptation","sources":[{"id":"quickgo.go_0043500","title":"Gene Ontology term GO:0043500 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043500/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle adaptation as: A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039700","kind":"concept","label":"fusion of viral membrane with host outer nuclear membrane","sources":[{"id":"quickgo.go_0039700","title":"Gene Ontology term GO:0039700 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039700/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fusion of viral membrane with host outer nuclear membrane as: Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098689","kind":"concept","label":"latency-replication decision","sources":[{"id":"quickgo.go_0098689","title":"Gene Ontology term GO:0098689 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098689/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines latency-replication decision as: The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044826","kind":"concept","label":"viral genome integration into host DNA","sources":[{"id":"quickgo.go_0044826","title":"Gene Ontology term GO:0044826 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044826/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome integration into host DNA as: The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039665","kind":"concept","label":"permeabilization of host organelle membrane involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039665","title":"Gene Ontology term GO:0039665 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039665/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines permeabilization of host organelle membrane involved in viral entry into host cell as: Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039663","kind":"concept","label":"membrane fusion involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039663","title":"Gene Ontology term GO:0039663 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039663/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane fusion involved in viral entry into host cell as: Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019058","kind":"concept","label":"viral life cycle","sources":[{"id":"quickgo.go_0019058","title":"Gene Ontology term GO:0019058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral life cycle as: A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019079","kind":"concept","label":"viral genome replication","sources":[{"id":"quickgo.go_0019079","title":"Gene Ontology term GO:0019079 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019079/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome replication as: Any process involved directly in viral genome replication, including viral nucleotide metabolism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098678","kind":"concept","label":"viral tropism switching","sources":[{"id":"quickgo.go_0098678","title":"Gene Ontology term GO:0098678 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098678/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tropism switching as: A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046784","kind":"concept","label":"viral mRNA export from host cell nucleus","sources":[{"id":"quickgo.go_0046784","title":"Gene Ontology term GO:0046784 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046784/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral mRNA export from host cell nucleus as: The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019075","kind":"concept","label":"virus maturation","sources":[{"id":"quickgo.go_0019075","title":"Gene Ontology term GO:0019075 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019075/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus maturation as: The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075522","kind":"concept","label":"IRES-dependent viral translational initiation","sources":[{"id":"quickgo.go_0075522","title":"Gene Ontology term GO:0075522 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075522/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines IRES-dependent viral translational initiation as: Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046745","kind":"concept","label":"viral capsid secondary envelopment","sources":[{"id":"quickgo.go_0046745","title":"Gene Ontology term GO:0046745 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046745/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid secondary envelopment as: The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019081","kind":"concept","label":"viral translation","sources":[{"id":"quickgo.go_0019081","title":"Gene Ontology term GO:0019081 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019081/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translation as: A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075524","kind":"concept","label":"ribosomal skipping","sources":[{"id":"quickgo.go_0075524","title":"Gene Ontology term GO:0075524 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075524/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ribosomal skipping as: A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098003","kind":"concept","label":"viral tail assembly","sources":[{"id":"quickgo.go_0098003","title":"Gene Ontology term GO:0098003 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098003/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tail assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098005","kind":"concept","label":"viral head-tail joining","sources":[{"id":"quickgo.go_0098005","title":"Gene Ontology term GO:0098005 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098005/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral head-tail joining as: Process by which virus heads and tails are attached to each other.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075526","kind":"concept","label":"cap snatching","sources":[{"id":"quickgo.go_0075526","title":"Gene Ontology term GO:0075526 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075526/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cap snatching as: A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039678","kind":"concept","label":"symbiont genome ejection through host cell envelope","sources":[{"id":"quickgo.go_0039678","title":"Gene Ontology term GO:0039678 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039678/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines symbiont genome ejection through host cell envelope as: Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039674","kind":"concept","label":"exit of virus from host cell nucleus","sources":[{"id":"quickgo.go_0039674","title":"Gene Ontology term GO:0039674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines exit of virus from host cell nucleus as: The directed movement of the viral genome or a viral particle out of the host cell nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046794","kind":"concept","label":"transport of virus","sources":[{"id":"quickgo.go_0046794","title":"Gene Ontology term GO:0046794 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046794/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transport of virus as: The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098669","kind":"concept","label":"superinfection exclusion","sources":[{"id":"quickgo.go_0098669","title":"Gene Ontology term GO:0098669 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098669/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines superinfection exclusion as: The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019045","kind":"concept","label":"latent virus replication","sources":[{"id":"quickgo.go_0019045","title":"Gene Ontology term GO:0019045 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019045/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines latent virus replication as: Any process required for latent viral replication in a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019068","kind":"concept","label":"virion assembly","sources":[{"id":"quickgo.go_0019068","title":"Gene Ontology term GO:0019068 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019068/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion assembly as: A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046807","kind":"concept","label":"viral scaffold assembly and maintenance","sources":[{"id":"quickgo.go_0046807","title":"Gene Ontology term GO:0046807 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046807/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral scaffold assembly and maintenance as: The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019083","kind":"concept","label":"viral transcription","sources":[{"id":"quickgo.go_0019083","title":"Gene Ontology term GO:0019083 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019083/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral transcription as: The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019070","kind":"concept","label":"viral genome maturation","sources":[{"id":"quickgo.go_0019070","title":"Gene Ontology term GO:0019070 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019070/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome maturation as: The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046755","kind":"concept","label":"viral budding","sources":[{"id":"quickgo.go_0046755","title":"Gene Ontology term GO:0046755 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046755/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral budding as: A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140755","kind":"concept","label":"reorganization of host cellular membranes to establish sites of replication","sources":[{"id":"quickgo.go_0140755","title":"Gene Ontology term GO:0140755 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140755/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reorganization of host cellular membranes to establish sites of replication as: A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039664","kind":"concept","label":"lysis of host organelle involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039664","title":"Gene Ontology term GO:0039664 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039664/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysis of host organelle involved in viral entry into host cell as: The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098045","kind":"concept","label":"virus baseplate assembly","sources":[{"id":"quickgo.go_0098045","title":"Gene Ontology term GO:0098045 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098045/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus baseplate assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019076","kind":"concept","label":"viral release from host cell","sources":[{"id":"quickgo.go_0019076","title":"Gene Ontology term GO:0019076 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019076/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral release from host cell as: The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098677","kind":"concept","label":"virion maturation","sources":[{"id":"quickgo.go_0098677","title":"Gene Ontology term GO:0098677 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098677/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion maturation as: Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019072","kind":"concept","label":"viral genome packaging","sources":[{"id":"quickgo.go_0019072","title":"Gene Ontology term GO:0019072 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019072/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome packaging as: The encapsulation of the viral genome within the capsid.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075523","kind":"concept","label":"viral translational frameshifting","sources":[{"id":"quickgo.go_0075523","title":"Gene Ontology term GO:0075523 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075523/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational frameshifting as: A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019082","kind":"concept","label":"viral protein processing","sources":[{"id":"quickgo.go_0019082","title":"Gene Ontology term GO:0019082 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019082/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral protein processing as: Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075525","kind":"concept","label":"viral translational termination-reinitiation","sources":[{"id":"quickgo.go_0075525","title":"Gene Ontology term GO:0075525 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075525/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational termination-reinitiation as: A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019080","kind":"concept","label":"viral gene expression","sources":[{"id":"quickgo.go_0019080","title":"Gene Ontology term GO:0019080 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019080/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral gene expression as: A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046786","kind":"concept","label":"viral replication complex formation and maintenance","sources":[{"id":"quickgo.go_0046786","title":"Gene Ontology term GO:0046786 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046786/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral replication complex formation and maintenance as: The process of organizing and assembling viral replication proteins in preparation for viral replication.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098004","kind":"concept","label":"virus tail fiber assembly","sources":[{"id":"quickgo.go_0098004","title":"Gene Ontology term GO:0098004 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098004/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail fiber assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075527","kind":"concept","label":"viral RNA editing","sources":[{"id":"quickgo.go_0075527","title":"Gene Ontology term GO:0075527 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075527/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral RNA editing as: The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019069","kind":"concept","label":"viral capsid assembly","sources":[{"id":"quickgo.go_0019069","title":"Gene Ontology term GO:0019069 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019069/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid assembly as: The assembly of a virus capsid from its protein subunits.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099009","kind":"concept","label":"viral genome circularization","sources":[{"id":"quickgo.go_0099009","title":"Gene Ontology term GO:0099009 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099009/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome circularization as: The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019046","kind":"concept","label":"release from viral latency","sources":[{"id":"quickgo.go_0019046","title":"Gene Ontology term GO:0019046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines release from viral latency as: The process by which a virus begins to replicate following a latency replication decision (switch).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019061","kind":"concept","label":"uncoating of virus","sources":[{"id":"quickgo.go_0019061","title":"Gene Ontology term GO:0019061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines uncoating of virus as: The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019042","kind":"concept","label":"viral latency","sources":[{"id":"quickgo.go_0019042","title":"Gene Ontology term GO:0019042 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019042/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral latency as: The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048609","kind":"concept","label":"multicellular organismal reproductive process","sources":[{"id":"quickgo.go_0048609","title":"Gene Ontology term GO:0048609 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048609/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal reproductive process as: The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009566","kind":"concept","label":"fertilization","sources":[{"id":"quickgo.go_0009566","title":"Gene Ontology term GO:0009566 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009566/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fertilization as: The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022413","kind":"concept","label":"reproductive process in single-celled organism","sources":[{"id":"quickgo.go_0022413","title":"Gene Ontology term GO:0022413 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022413/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process in single-celled organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061948","kind":"concept","label":"premature acrosome loss","sources":[{"id":"quickgo.go_0061948","title":"Gene Ontology term GO:0061948 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061948/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines premature acrosome loss as: The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042628","kind":"concept","label":"mating plug formation","sources":[{"id":"quickgo.go_0042628","title":"Gene Ontology term GO:0042628 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042628/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating plug formation as: The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019953","kind":"concept","label":"sexual reproduction","sources":[{"id":"quickgo.go_0019953","title":"Gene Ontology term GO:0019953 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019953/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sexual reproduction as: A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022602","kind":"concept","label":"ovulation cycle process","sources":[{"id":"quickgo.go_0022602","title":"Gene Ontology term GO:0022602 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022602/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle process as: A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007566","kind":"concept","label":"embryo implantation","sources":[{"id":"quickgo.go_0007566","title":"Gene Ontology term GO:0007566 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007566/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines embryo implantation as: Attachment of the blastocyst to the uterine lining.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044703","kind":"concept","label":"multi-organism reproductive process","sources":[{"id":"quickgo.go_0044703","title":"Gene Ontology term GO:0044703 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044703/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-organism reproductive process as: A biological process that directly contributes to the process of producing new individuals, involving another organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097722","kind":"concept","label":"sperm motility","sources":[{"id":"quickgo.go_0097722","title":"Gene Ontology term GO:0097722 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097722/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm motility as: Any process involved in the controlled movement of a sperm cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0110134","kind":"concept","label":"meiotic drive","sources":[{"id":"quickgo.go_0110134","title":"Gene Ontology term GO:0110134 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0110134/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic drive as: A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007340","kind":"concept","label":"acrosome reaction","sources":[{"id":"quickgo.go_0007340","title":"Gene Ontology term GO:0007340 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007340/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acrosome reaction as: The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051321","kind":"concept","label":"meiotic cell cycle","sources":[{"id":"quickgo.go_0051321","title":"Gene Ontology term GO:0051321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle as: Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1903046","kind":"concept","label":"meiotic cell cycle process","sources":[{"id":"quickgo.go_1903046","title":"Gene Ontology term GO:1903046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1903046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle process as: A process that is part of the meiotic cell cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0003006","kind":"concept","label":"developmental process involved in reproduction","sources":[{"id":"quickgo.go_0003006","title":"Gene Ontology term GO:0003006 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0003006/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process involved in reproduction as: A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019954","kind":"concept","label":"asexual reproduction","sources":[{"id":"quickgo.go_0019954","title":"Gene Ontology term GO:0019954 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019954/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines asexual reproduction as: A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075325","kind":"concept","label":"spore dispersal","sources":[{"id":"quickgo.go_0075325","title":"Gene Ontology term GO:0075325 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075325/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore dispersal as: Any process in which an organism disseminates its spores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990277","kind":"concept","label":"parasexual reproduction with cellular fusion","sources":[{"id":"quickgo.go_1990277","title":"Gene Ontology term GO:1990277 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990277/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines parasexual reproduction with cellular fusion as: A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002404","kind":"concept","label":"antigen sampling in mucosal-associated lymphoid tissue","sources":[{"id":"quickgo.go_0002404","title":"Gene Ontology term GO:0002404 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002404/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen sampling in mucosal-associated lymphoid tissue as: The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019882","kind":"concept","label":"antigen processing and presentation","sources":[{"id":"quickgo.go_0019882","title":"Gene Ontology term GO:0019882 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019882/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen processing and presentation as: The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001776","kind":"concept","label":"leukocyte homeostasis","sources":[{"id":"quickgo.go_0001776","title":"Gene Ontology term GO:0001776 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001776/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte homeostasis as: The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002507","kind":"concept","label":"tolerance induction","sources":[{"id":"quickgo.go_0002507","title":"Gene Ontology term GO:0002507 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002507/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tolerance induction as: A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002339","kind":"concept","label":"B cell selection","sources":[{"id":"quickgo.go_0002339","title":"Gene Ontology term GO:0002339 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002339/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines B cell selection as: The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002253","kind":"concept","label":"activation of immune response","sources":[{"id":"quickgo.go_0002253","title":"Gene Ontology term GO:0002253 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002253/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines activation of immune response as: Any process that initiates an immune response.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045321","kind":"concept","label":"leukocyte activation","sources":[{"id":"quickgo.go_0045321","title":"Gene Ontology term GO:0045321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte activation as: A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002252","kind":"concept","label":"immune effector process","sources":[{"id":"quickgo.go_0002252","title":"Gene Ontology term GO:0002252 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002252/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune effector process as: Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090713","kind":"concept","label":"immunological memory process","sources":[{"id":"quickgo.go_0090713","title":"Gene Ontology term GO:0090713 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090713/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological memory process as: Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031294","kind":"concept","label":"lymphocyte costimulation","sources":[{"id":"quickgo.go_0031294","title":"Gene Ontology term GO:0031294 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031294/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lymphocyte costimulation as: The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002440","kind":"concept","label":"production of molecular mediator of immune response","sources":[{"id":"quickgo.go_0002440","title":"Gene Ontology term GO:0002440 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002440/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator of immune response as: The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002200","kind":"concept","label":"somatic diversification of immune receptors","sources":[{"id":"quickgo.go_0002200","title":"Gene Ontology term GO:0002200 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002200/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines somatic diversification of immune receptors as: The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002262","kind":"concept","label":"myeloid cell homeostasis","sources":[{"id":"quickgo.go_0002262","title":"Gene Ontology term GO:0002262 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002262/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myeloid cell homeostasis as: The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002520","kind":"concept","label":"immune system development","sources":[{"id":"quickgo.go_0002520","title":"Gene Ontology term GO:0002520 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002520/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system development as: The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042386","kind":"concept","label":"hemocyte differentiation","sources":[{"id":"quickgo.go_0042386","title":"Gene Ontology term GO:0042386 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042386/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte differentiation as: The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035172","kind":"concept","label":"hemocyte proliferation","sources":[{"id":"quickgo.go_0035172","title":"Gene Ontology term GO:0035172 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035172/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte proliferation as: The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045058","kind":"concept","label":"T cell selection","sources":[{"id":"quickgo.go_0045058","title":"Gene Ontology term GO:0045058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines T cell selection as: The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050900","kind":"concept","label":"leukocyte migration","sources":[{"id":"quickgo.go_0050900","title":"Gene Ontology term GO:0050900 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050900/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte migration as: The movement of a leukocyte within or between different tissues and organs of the body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051301","kind":"concept","label":"cell division","sources":[{"id":"quickgo.go_0051301","title":"Gene Ontology term GO:0051301 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051301/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division as: The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048489","kind":"concept","label":"synaptic vesicle transport","sources":[{"id":"quickgo.go_0048489","title":"Gene Ontology term GO:0048489 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048489/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic vesicle transport as: The directed movement of synaptic vesicles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048869","kind":"concept","label":"cellular developmental process","sources":[{"id":"quickgo.go_0048869","title":"Gene Ontology term GO:0048869 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048869/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular developmental process as: A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060352","kind":"concept","label":"cell adhesion molecule production","sources":[{"id":"quickgo.go_0060352","title":"Gene Ontology term GO:0060352 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060352/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion molecule production as: The appearance of a cell adhesion molecule due to biosynthesis or secretion.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022402","kind":"concept","label":"cell cycle process","sources":[{"id":"quickgo.go_0022402","title":"Gene Ontology term GO:0022402 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022402/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle process as: The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061919","kind":"concept","label":"process utilizing autophagic mechanism","sources":[{"id":"quickgo.go_0061919","title":"Gene Ontology term GO:0061919 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061919/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines process utilizing autophagic mechanism as: A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007165","kind":"concept","label":"signal transduction","sources":[{"id":"quickgo.go_0007165","title":"Gene Ontology term GO:0007165 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007165/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines signal transduction as: The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010118","kind":"concept","label":"stomatal movement","sources":[{"id":"quickgo.go_0010118","title":"Gene Ontology term GO:0010118 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010118/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines stomatal movement as: The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098743","kind":"concept","label":"cell aggregation","sources":[{"id":"quickgo.go_0098743","title":"Gene Ontology term GO:0098743 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098743/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell aggregation as: The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043335","kind":"concept","label":"protein unfolding","sources":[{"id":"quickgo.go_0043335","title":"Gene Ontology term GO:0043335 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043335/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein unfolding as: The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008219","kind":"concept","label":"cell death","sources":[{"id":"quickgo.go_0008219","title":"Gene Ontology term GO:0008219 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008219/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell death as: Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006515","kind":"concept","label":"protein quality control","sources":[{"id":"quickgo.go_0006515","title":"Gene Ontology term GO:0006515 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006515/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein quality control as: The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006457","kind":"concept","label":"protein folding","sources":[{"id":"quickgo.go_0006457","title":"Gene Ontology term GO:0006457 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006457/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein folding as: The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048870","kind":"concept","label":"cell motility","sources":[{"id":"quickgo.go_0048870","title":"Gene Ontology term GO:0048870 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048870/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell motility as: Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0034337","kind":"concept","label":"RNA folding","sources":[{"id":"quickgo.go_0034337","title":"Gene Ontology term GO:0034337 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0034337/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines RNA folding as: The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061842","kind":"concept","label":"microtubule organizing center localization","sources":[{"id":"quickgo.go_0061842","title":"Gene Ontology term GO:0061842 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061842/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule organizing center localization as: Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097528","kind":"concept","label":"execution phase of necroptosis","sources":[{"id":"quickgo.go_0097528","title":"Gene Ontology term GO:0097528 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097528/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of necroptosis as: A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022406","kind":"concept","label":"membrane docking","sources":[{"id":"quickgo.go_0022406","title":"Gene Ontology term GO:0022406 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022406/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane docking as: The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007154","kind":"concept","label":"cell communication","sources":[{"id":"quickgo.go_0007154","title":"Gene Ontology term GO:0007154 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007154/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell communication as: Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036166","kind":"concept","label":"phenotypic switching","sources":[{"id":"quickgo.go_0036166","title":"Gene Ontology term GO:0036166 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036166/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines phenotypic switching as: A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000920","kind":"concept","label":"septum digestion after cytokinesis","sources":[{"id":"quickgo.go_0000920","title":"Gene Ontology term GO:0000920 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000920/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines septum digestion after cytokinesis as: The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007017","kind":"concept","label":"microtubule-based process","sources":[{"id":"quickgo.go_0007017","title":"Gene Ontology term GO:0007017 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007017/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule-based process as: Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990748","kind":"concept","label":"cellular detoxification","sources":[{"id":"quickgo.go_1990748","title":"Gene Ontology term GO:1990748 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990748/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular detoxification as: Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006276","kind":"concept","label":"plasmid maintenance","sources":[{"id":"quickgo.go_0006276","title":"Gene Ontology term GO:0006276 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006276/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasmid maintenance as: The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019835","kind":"concept","label":"cytolysis","sources":[{"id":"quickgo.go_0019835","title":"Gene Ontology term GO:0019835 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019835/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytolysis as: The rupture of cell membranes and the loss of cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071554","kind":"concept","label":"cell wall organization or biogenesis","sources":[{"id":"quickgo.go_0071554","title":"Gene Ontology term GO:0071554 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071554/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell wall organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001906","kind":"concept","label":"cell killing","sources":[{"id":"quickgo.go_0001906","title":"Gene Ontology term GO:0001906 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001906/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell killing as: Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140352","kind":"concept","label":"export from cell","sources":[{"id":"quickgo.go_0140352","title":"Gene Ontology term GO:0140352 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140352/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines export from cell as: The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051641","kind":"concept","label":"cellular localization","sources":[{"id":"quickgo.go_0051641","title":"Gene Ontology term GO:0051641 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051641/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular localization as: A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009292","kind":"concept","label":"horizontal gene transfer","sources":[{"id":"quickgo.go_0009292","title":"Gene Ontology term GO:0009292 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009292/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines horizontal gene transfer as: The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071840","kind":"concept","label":"cellular component organization or biogenesis","sources":[{"id":"quickgo.go_0071840","title":"Gene Ontology term GO:0071840 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071840/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular component organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055085","kind":"concept","label":"transmembrane transport","sources":[{"id":"quickgo.go_0055085","title":"Gene Ontology term GO:0055085 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055085/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transmembrane transport as: The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140029","kind":"concept","label":"exocytic process","sources":[{"id":"quickgo.go_0140029","title":"Gene Ontology term GO:0140029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines exocytic process as: The cellular processes that contribute to exocytosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140253","kind":"concept","label":"cell-cell fusion","sources":[{"id":"quickgo.go_0140253","title":"Gene Ontology term GO:0140253 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140253/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell-cell fusion as: A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007049","kind":"concept","label":"cell cycle","sources":[{"id":"quickgo.go_0007049","title":"Gene Ontology term GO:0007049 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007049/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle as: The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001775","kind":"concept","label":"cell activation","sources":[{"id":"quickgo.go_0001775","title":"Gene Ontology term GO:0001775 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001775/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell activation as: A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035212","kind":"concept","label":"cell competition in a multicellular organism","sources":[{"id":"quickgo.go_0035212","title":"Gene Ontology term GO:0035212 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035212/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell competition in a multicellular organism as: Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008283","kind":"concept","label":"cell population proliferation","sources":[{"id":"quickgo.go_0008283","title":"Gene Ontology term GO:0008283 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008283/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell population proliferation as: The multiplication or reproduction of cells, resulting in the expansion of a cell population.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120312","kind":"concept","label":"ciliary basal body segregation","sources":[{"id":"quickgo.go_0120312","title":"Gene Ontology term GO:0120312 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120312/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary basal body segregation as: The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0170062","kind":"concept","label":"nutrient storage","sources":[{"id":"quickgo.go_0170062","title":"Gene Ontology term GO:0170062 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0170062/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nutrient storage as: The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045103","kind":"concept","label":"intermediate filament-based process","sources":[{"id":"quickgo.go_0045103","title":"Gene Ontology term GO:0045103 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045103/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intermediate filament-based process as: Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097194","kind":"concept","label":"execution phase of apoptosis","sources":[{"id":"quickgo.go_0097194","title":"Gene Ontology term GO:0097194 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097194/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of apoptosis as: A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090398","kind":"concept","label":"cellular senescence","sources":[{"id":"quickgo.go_0090398","title":"Gene Ontology term GO:0090398 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090398/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular senescence as: A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022412","kind":"concept","label":"cellular process involved in reproduction in multicellular organism","sources":[{"id":"quickgo.go_0022412","title":"Gene Ontology term GO:0022412 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022412/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process involved in reproduction in multicellular organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016037","kind":"concept","label":"light absorption","sources":[{"id":"quickgo.go_0016037","title":"Gene Ontology term GO:0016037 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016037/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines light absorption as: The reception of a photon by a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051674","kind":"concept","label":"localization of cell","sources":[{"id":"quickgo.go_0051674","title":"Gene Ontology term GO:0051674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization of cell as: Any process in which a cell is transported to, and/or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030029","kind":"concept","label":"actin filament-based process","sources":[{"id":"quickgo.go_0030029","title":"Gene Ontology term GO:0030029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament-based process as: Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016192","kind":"concept","label":"vesicle-mediated transport","sources":[{"id":"quickgo.go_0016192","title":"Gene Ontology term GO:0016192 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016192/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines vesicle-mediated transport as: A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007155","kind":"concept","label":"cell adhesion","sources":[{"id":"quickgo.go_0007155","title":"Gene Ontology term GO:0007155 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007155/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion as: The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008152","kind":"concept","label":"metabolic process","sources":[{"id":"quickgo.go_0008152","title":"Gene Ontology term GO:0008152 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008152/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines metabolic process as: A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007272","kind":"concept","label":"ensheathment of neurons","sources":[{"id":"quickgo.go_0007272","title":"Gene Ontology term GO:0007272 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007272/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ensheathment of neurons as: The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008037","kind":"concept","label":"cell recognition","sources":[{"id":"quickgo.go_0008037","title":"Gene Ontology term GO:0008037 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008037/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell recognition as: The process in which a cell in an organism interprets its surroundings.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031987","kind":"concept","label":"locomotion involved in locomotory behavior","sources":[{"id":"quickgo.go_0031987","title":"Gene Ontology term GO:0031987 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031987/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion involved in locomotory behavior as: Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033058","kind":"concept","label":"directional locomotion","sources":[{"id":"quickgo.go_0033058","title":"Gene Ontology term GO:0033058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines directional locomotion as: Self-propelled movement of a cell or organism from one location to another along an axis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060361","kind":"concept","label":"flight","sources":[{"id":"quickgo.go_0060361","title":"Gene Ontology term GO:0060361 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060361/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines flight as: Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042330","kind":"concept","label":"taxis","sources":[{"id":"quickgo.go_0042330","title":"Gene Ontology term GO:0042330 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042330/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines taxis as: The directed movement of a motile cell or organism in response to an external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071965","kind":"concept","label":"multicellular organismal locomotion","sources":[{"id":"quickgo.go_0071965","title":"Gene Ontology term GO:0071965 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071965/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal locomotion as: Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036268","kind":"concept","label":"swimming","sources":[{"id":"quickgo.go_0036268","title":"Gene Ontology term GO:0036268 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036268/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines swimming as: Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007624","kind":"concept","label":"ultradian rhythm","sources":[{"id":"quickgo.go_0007624","title":"Gene Ontology term GO:0007624 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007624/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ultradian rhythm as: The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007623","kind":"concept","label":"circadian rhythm","sources":[{"id":"quickgo.go_0007623","title":"Gene Ontology term GO:0007623 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007623/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines circadian rhythm as: Any biological process in an organism that recurs with a regularity of approximately 24 hours.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042698","kind":"concept","label":"ovulation cycle","sources":[{"id":"quickgo.go_0042698","title":"Gene Ontology term GO:0042698 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042698/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle as: The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010483","kind":"concept","label":"pollen tube reception","sources":[{"id":"quickgo.go_0010483","title":"Gene Ontology term GO:0010483 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010483/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube reception as: An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000752","kind":"concept","label":"agglutination involved in conjugation with cellular fusion","sources":[{"id":"quickgo.go_0000752","title":"Gene Ontology term GO:0000752 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000752/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines agglutination involved in conjugation with cellular fusion as: The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099120","kind":"concept","label":"socially cooperative development","sources":[{"id":"quickgo.go_0099120","title":"Gene Ontology term GO:0099120 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099120/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines socially cooperative development as: The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120318","kind":"concept","label":"olfactory sociosexual communication","sources":[{"id":"quickgo.go_0120318","title":"Gene Ontology term GO:0120318 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120318/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines olfactory sociosexual communication as: The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000128","kind":"concept","label":"flocculation","sources":[{"id":"quickgo.go_0000128","title":"Gene Ontology term GO:0000128 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000128/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines flocculation as: The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044010","kind":"concept","label":"single-species biofilm formation","sources":[{"id":"quickgo.go_0044010","title":"Gene Ontology term GO:0044010 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044010/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-species biofilm formation as: A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009865","kind":"concept","label":"pollen tube adhesion","sources":[{"id":"quickgo.go_0009865","title":"Gene Ontology term GO:0009865 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009865/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube adhesion as: The process in which the pollen tube adheres to cells of the stigma and style.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048646","kind":"concept","label":"anatomical structure formation involved in morphogenesis","sources":[{"id":"quickgo.go_0048646","title":"Gene Ontology term GO:0048646 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048646/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure formation involved in morphogenesis as: The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009653","kind":"concept","label":"anatomical structure morphogenesis","sources":[{"id":"quickgo.go_0009653","title":"Gene Ontology term GO:0009653 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009653/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure morphogenesis as: The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030583","kind":"concept","label":"myxococcal fruiting body development","sources":[{"id":"quickgo.go_0030583","title":"Gene Ontology term GO:0030583 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030583/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myxococcal fruiting body development as: The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048532","kind":"concept","label":"anatomical structure arrangement","sources":[{"id":"quickgo.go_0048532","title":"Gene Ontology term GO:0048532 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048532/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure arrangement as: The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031128","kind":"concept","label":"developmental induction","sources":[{"id":"quickgo.go_0031128","title":"Gene Ontology term GO:0031128 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031128/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental induction as: A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043934","kind":"concept","label":"sporulation","sources":[{"id":"quickgo.go_0043934","title":"Gene Ontology term GO:0043934 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043934/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sporulation as: The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010014","kind":"concept","label":"meristem initiation","sources":[{"id":"quickgo.go_0010014","title":"Gene Ontology term GO:0010014 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010014/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem initiation as: Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022611","kind":"concept","label":"dormancy process","sources":[{"id":"quickgo.go_0022611","title":"Gene Ontology term GO:0022611 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022611/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dormancy process as: A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090644","kind":"concept","label":"age-related resistance","sources":[{"id":"quickgo.go_0090644","title":"Gene Ontology term GO:0090644 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090644/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines age-related resistance as: An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090693","kind":"concept","label":"plant organ senescence","sources":[{"id":"quickgo.go_0090693","title":"Gene Ontology term GO:0090693 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090693/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plant organ senescence as: A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060033","kind":"concept","label":"anatomical structure regression","sources":[{"id":"quickgo.go_0060033","title":"Gene Ontology term GO:0060033 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060033/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure regression as: The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097737","kind":"concept","label":"acquisition of mycelium reproductive competence","sources":[{"id":"quickgo.go_0097737","title":"Gene Ontology term GO:0097737 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097737/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of mycelium reproductive competence as: A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0021700","kind":"concept","label":"developmental maturation","sources":[{"id":"quickgo.go_0021700","title":"Gene Ontology term GO:0021700 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0021700/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental maturation as: A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009838","kind":"concept","label":"abscission","sources":[{"id":"quickgo.go_0009838","title":"Gene Ontology term GO:0009838 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009838/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines abscission as: The controlled shedding of a body part.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048856","kind":"concept","label":"anatomical structure development","sources":[{"id":"quickgo.go_0048856","title":"Gene Ontology term GO:0048856 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048856/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure development as: The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097751","kind":"concept","label":"spore-bearing structure formation","sources":[{"id":"quickgo.go_0097751","title":"Gene Ontology term GO:0097751 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097751/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore-bearing structure formation as: The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043696","kind":"concept","label":"dedifferentiation","sources":[{"id":"quickgo.go_0043696","title":"Gene Ontology term GO:0043696 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043696/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dedifferentiation as: The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140547","kind":"concept","label":"acquisition of seed longevity","sources":[{"id":"quickgo.go_0140547","title":"Gene Ontology term GO:0140547 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140547/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of seed longevity as: The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060384","kind":"concept","label":"innervation","sources":[{"id":"quickgo.go_0060384","title":"Gene Ontology term GO:0060384 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060384/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines innervation as: The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009561","kind":"concept","label":"megagametogenesis","sources":[{"id":"quickgo.go_0009561","title":"Gene Ontology term GO:0009561 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009561/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines megagametogenesis as: The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go7770056","kind":"concept","label":"multicellular organismal-level extracellular fluid acidification","sources":[{"id":"quickgo.go_7770056","title":"Gene Ontology term GO:7770056 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:7770056/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level extracellular fluid acidification as: Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001503","kind":"concept","label":"ossification","sources":[{"id":"quickgo.go_0001503","title":"Gene Ontology term GO:0001503 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001503/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ossification as: The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097242","kind":"concept","label":"amyloid-beta clearance","sources":[{"id":"quickgo.go_0097242","title":"Gene Ontology term GO:0097242 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097242/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines amyloid-beta clearance as: The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035889","kind":"concept","label":"otolith tethering","sources":[{"id":"quickgo.go_0035889","title":"Gene Ontology term GO:0035889 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035889/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines otolith tethering as: The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043480","kind":"concept","label":"pigment accumulation in tissues","sources":[{"id":"quickgo.go_0043480","title":"Gene Ontology term GO:0043480 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043480/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation in tissues as: The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055127","kind":"concept","label":"vibrational conductance of sound to the inner ear","sources":[{"id":"quickgo.go_0055127","title":"Gene Ontology term GO:0055127 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055127/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines vibrational conductance of sound to the inner ear as: The transmission of vibrations via ossicles to the inner ear.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022004","kind":"concept","label":"midbrain-hindbrain boundary maturation during brain development","sources":[{"id":"quickgo.go_0022004","title":"Gene Ontology term GO:0022004 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022004/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during brain development as: A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016203","kind":"concept","label":"muscle attachment","sources":[{"id":"quickgo.go_0016203","title":"Gene Ontology term GO:0016203 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016203/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle attachment as: The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071827","kind":"concept","label":"plasma lipoprotein particle organization","sources":[{"id":"quickgo.go_0071827","title":"Gene Ontology term GO:0071827 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071827/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle organization as: A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050817","kind":"concept","label":"coagulation","sources":[{"id":"quickgo.go_0050817","title":"Gene Ontology term GO:0050817 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050817/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines coagulation as: The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0003008","kind":"concept","label":"system process","sources":[{"id":"quickgo.go_0003008","title":"Gene Ontology term GO:0003008 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0003008/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines system process as: A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035073","kind":"concept","label":"pupariation","sources":[{"id":"quickgo.go_0035073","title":"Gene Ontology term GO:0035073 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035073/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupariation as: The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010022","kind":"concept","label":"meristem determinacy","sources":[{"id":"quickgo.go_0010022","title":"Gene Ontology term GO:0010022 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010022/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem determinacy as: The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055046","kind":"concept","label":"microgametogenesis","sources":[{"id":"quickgo.go_0055046","title":"Gene Ontology term GO:0055046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microgametogenesis as: The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032898","kind":"concept","label":"neurotrophin production","sources":[{"id":"quickgo.go_0032898","title":"Gene Ontology term GO:0032898 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032898/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines neurotrophin production as: The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035264","kind":"concept","label":"multicellular organism growth","sources":[{"id":"quickgo.go_0035264","title":"Gene Ontology term GO:0035264 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035264/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism growth as: The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009791","kind":"concept","label":"post-embryonic development","sources":[{"id":"quickgo.go_0009791","title":"Gene Ontology term GO:0009791 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009791/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines post-embryonic development as: The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009846","kind":"concept","label":"pollen germination","sources":[{"id":"quickgo.go_0009846","title":"Gene Ontology term GO:0009846 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009846/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen germination as: The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010162","kind":"concept","label":"seed dormancy process","sources":[{"id":"quickgo.go_0010162","title":"Gene Ontology term GO:0010162 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010162/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990110","kind":"concept","label":"callus formation","sources":[{"id":"quickgo.go_1990110","title":"Gene Ontology term GO:1990110 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990110/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines callus formation as: The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019827","kind":"concept","label":"stem cell population maintenance","sources":[{"id":"quickgo.go_0019827","title":"Gene Ontology term GO:0019827 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019827/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines stem cell population maintenance as: The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007275","kind":"concept","label":"multicellular organism development","sources":[{"id":"quickgo.go_0007275","title":"Gene Ontology term GO:0007275 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007275/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism development as: The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048647","kind":"concept","label":"polyphenic determination","sources":[{"id":"quickgo.go_0048647","title":"Gene Ontology term GO:0048647 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048647/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines polyphenic determination as: The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008340","kind":"concept","label":"determination of adult lifespan","sources":[{"id":"quickgo.go_0008340","title":"Gene Ontology term GO:0008340 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008340/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines determination of adult lifespan as: The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010073","kind":"concept","label":"meristem maintenance","sources":[{"id":"quickgo.go_0010073","title":"Gene Ontology term GO:0010073 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010073/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem maintenance as: Any process involved in maintaining the identity, size and shape of a meristem.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048771","kind":"concept","label":"tissue remodeling","sources":[{"id":"quickgo.go_0048771","title":"Gene Ontology term GO:0048771 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048771/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue remodeling as: The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050879","kind":"concept","label":"multicellular organismal movement","sources":[{"id":"quickgo.go_0050879","title":"Gene Ontology term GO:0050879 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050879/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal movement as: Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090130","kind":"concept","label":"tissue migration","sources":[{"id":"quickgo.go_0090130","title":"Gene Ontology term GO:0090130 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090130/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue migration as: The process in which the population of cells that make up a tissue undergo directed movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007586","kind":"concept","label":"digestion","sources":[{"id":"quickgo.go_0007586","title":"Gene Ontology term GO:0007586 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007586/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines digestion as: The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045494","kind":"concept","label":"photoreceptor cell maintenance","sources":[{"id":"quickgo.go_0045494","title":"Gene Ontology term GO:0045494 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045494/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor cell maintenance as: Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044706","kind":"concept","label":"multi-multicellular organism process","sources":[{"id":"quickgo.go_0044706","title":"Gene Ontology term GO:0044706 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044706/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-multicellular organism process as: A multicellular organism process which involves another multicellular organism of the same or different species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097207","kind":"concept","label":"bud dormancy process","sources":[{"id":"quickgo.go_0097207","title":"Gene Ontology term GO:0097207 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097207/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bud dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022608","kind":"concept","label":"multicellular organism adhesion","sources":[{"id":"quickgo.go_0022608","title":"Gene Ontology term GO:0022608 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022608/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism adhesion as: The attachment of a multicellular organism to a substrate or other organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002532","kind":"concept","label":"production of molecular mediator involved in inflammatory response","sources":[{"id":"quickgo.go_0002532","title":"Gene Ontology term GO:0002532 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002532/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator involved in inflammatory response as: The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030431","kind":"concept","label":"sleep","sources":[{"id":"quickgo.go_0030431","title":"Gene Ontology term GO:0030431 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030431/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sleep as: Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048871","kind":"concept","label":"multicellular organismal-level homeostasis","sources":[{"id":"quickgo.go_0048871","title":"Gene Ontology term GO:0048871 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048871/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030588","kind":"concept","label":"pseudocleavage","sources":[{"id":"quickgo.go_0030588","title":"Gene Ontology term GO:0030588 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030588/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pseudocleavage as: Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001763","kind":"concept","label":"morphogenesis of a branching structure","sources":[{"id":"quickgo.go_0001763","title":"Gene Ontology term GO:0001763 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001763/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines morphogenesis of a branching structure as: The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031424","kind":"concept","label":"keratinization","sources":[{"id":"quickgo.go_0031424","title":"Gene Ontology term GO:0031424 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031424/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines keratinization as: The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022005","kind":"concept","label":"midbrain-hindbrain boundary maturation during neural plate development","sources":[{"id":"quickgo.go_0022005","title":"Gene Ontology term GO:0022005 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022005/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during neural plate development as: A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071684","kind":"concept","label":"organism emergence from protective structure","sources":[{"id":"quickgo.go_0071684","title":"Gene Ontology term GO:0071684 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071684/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organism emergence from protective structure as: The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045056","kind":"concept","label":"transcytosis","sources":[{"id":"quickgo.go_0045056","title":"Gene Ontology term GO:0045056 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045056/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transcytosis as: The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007389","kind":"concept","label":"pattern specification process","sources":[{"id":"quickgo.go_0007389","title":"Gene Ontology term GO:0007389 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007389/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pattern specification process as: Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035074","kind":"concept","label":"pupation","sources":[{"id":"quickgo.go_0035074","title":"Gene Ontology term GO:0035074 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035074/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupation as: The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042303","kind":"concept","label":"molting cycle","sources":[{"id":"quickgo.go_0042303","title":"Gene Ontology term GO:0042303 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042303/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle as: The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022404","kind":"concept","label":"molting cycle process","sources":[{"id":"quickgo.go_0022404","title":"Gene Ontology term GO:0022404 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022404/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle process as: A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035314","kind":"concept","label":"scab formation","sources":[{"id":"quickgo.go_0035314","title":"Gene Ontology term GO:0035314 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035314/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines scab formation as: Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035265","kind":"concept","label":"organ growth","sources":[{"id":"quickgo.go_0035265","title":"Gene Ontology term GO:0035265 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035265/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organ growth as: The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009845","kind":"concept","label":"seed germination","sources":[{"id":"quickgo.go_0009845","title":"Gene Ontology term GO:0009845 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009845/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed germination as: The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0034381","kind":"concept","label":"plasma lipoprotein particle clearance","sources":[{"id":"quickgo.go_0034381","title":"Gene Ontology term GO:0034381 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0034381/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle clearance as: The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001816","kind":"concept","label":"cytokine production","sources":[{"id":"quickgo.go_0001816","title":"Gene Ontology term GO:0001816 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001816/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytokine production as: The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044403","kind":"concept","label":"biological process involved in symbiotic interaction","sources":[{"id":"quickgo.go_0044403","title":"Gene Ontology term GO:0044403 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044403/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in symbiotic interaction as: A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140106","kind":"concept","label":"hematophagy","sources":[{"id":"quickgo.go_0140106","title":"Gene Ontology term GO:0140106 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140106/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hematophagy as: A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044111","kind":"concept","label":"formation of structure involved in a symbiotic process","sources":[{"id":"quickgo.go_0044111","title":"Gene Ontology term GO:0044111 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044111/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines formation of structure involved in a symbiotic process as: The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0141060","kind":"concept","label":"disruption of anatomical structure in another organism","sources":[{"id":"quickgo.go_0141060","title":"Gene Ontology term GO:0141060 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0141060/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines disruption of anatomical structure in another organism as: The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035821","kind":"concept","label":"modulation of process of another organism","sources":[{"id":"quickgo.go_0035821","title":"Gene Ontology term GO:0035821 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035821/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines modulation of process of another organism as: A process in which an organism effects a change in a biological process in another organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035732","kind":"concept","label":"nitric oxide storage","sources":[{"id":"quickgo.go_0035732","title":"Gene Ontology term GO:0035732 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035732/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nitric oxide storage as: The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051640","kind":"concept","label":"organelle localization","sources":[{"id":"quickgo.go_0051640","title":"Gene Ontology term GO:0051640 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051640/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle localization as: Any process in which an organelle is transported to, and/or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033036","kind":"concept","label":"macromolecule localization","sources":[{"id":"quickgo.go_0033036","title":"Gene Ontology term GO:0033036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines macromolecule localization as: Any process in which a macromolecule is transported to, or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097120","kind":"concept","label":"receptor localization to synapse","sources":[{"id":"quickgo.go_0097120","title":"Gene Ontology term GO:0097120 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097120/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines receptor localization to synapse as: Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048878","kind":"concept","label":"chemical homeostasis","sources":[{"id":"quickgo.go_0048878","title":"Gene Ontology term GO:0048878 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048878/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chemical homeostasis as: Any biological process involved in the maintenance of an internal steady state of a chemical.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019725","kind":"concept","label":"cellular homeostasis","sources":[{"id":"quickgo.go_0019725","title":"Gene Ontology term GO:0019725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140725","kind":"concept","label":"detoxification of free heme","sources":[{"id":"quickgo.go_0140725","title":"Gene Ontology term GO:0140725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of free heme as: Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009407","kind":"concept","label":"toxin catabolic process","sources":[{"id":"quickgo.go_0009407","title":"Gene Ontology term GO:0009407 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009407/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines toxin catabolic process as: The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010127","kind":"concept","label":"mycothiol-dependent detoxification","sources":[{"id":"quickgo.go_0010127","title":"Gene Ontology term GO:0010127 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010127/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mycothiol-dependent detoxification as: The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051410","kind":"concept","label":"detoxification of nitrogen compound","sources":[{"id":"quickgo.go_0051410","title":"Gene Ontology term GO:0051410 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051410/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of nitrogen compound as: Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061687","kind":"concept","label":"detoxification of inorganic compound","sources":[{"id":"quickgo.go_0061687","title":"Gene Ontology term GO:0061687 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061687/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of inorganic compound as: Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140729","kind":"concept","label":"detoxification of endogenously produced metabolite","sources":[{"id":"quickgo.go_0140729","title":"Gene Ontology term GO:0140729 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140729/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of endogenously produced metabolite as: A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071722","kind":"concept","label":"detoxification of arsenic-containing substance","sources":[{"id":"quickgo.go_0071722","title":"Gene Ontology term GO:0071722 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071722/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of arsenic-containing substance as: Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019028","kind":"concept","label":"viral capsid","sources":[{"id":"quickgo.go_0019028","title":"Gene Ontology term GO:0019028 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019028/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid as: The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098061","kind":"concept","label":"viral capsid, internal space","sources":[{"id":"quickgo.go_0098061","title":"Gene Ontology term GO:0098061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, internal space as: The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039642","kind":"concept","label":"virion nucleoid","sources":[{"id":"quickgo.go_0039642","title":"Gene Ontology term GO:0039642 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039642/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion nucleoid as: The region of a virion in which the nucleic acid is confined.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055036","kind":"concept","label":"virion membrane","sources":[{"id":"quickgo.go_0055036","title":"Gene Ontology term GO:0055036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion membrane as: The lipid bilayer surrounding a virion.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019013","kind":"concept","label":"viral nucleocapsid","sources":[{"id":"quickgo.go_0019013","title":"Gene Ontology term GO:0019013 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019013/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral nucleocapsid as: The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039625","kind":"concept","label":"viral inner capsid","sources":[{"id":"quickgo.go_0039625","title":"Gene Ontology term GO:0039625 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039625/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral inner capsid as: The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039624","kind":"concept","label":"viral outer capsid","sources":[{"id":"quickgo.go_0039624","title":"Gene Ontology term GO:0039624 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039624/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral outer capsid as: The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039626","kind":"concept","label":"viral intermediate capsid","sources":[{"id":"quickgo.go_0039626","title":"Gene Ontology term GO:0039626 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039626/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral intermediate capsid as: The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098028","kind":"concept","label":"virus tail, shaft","sources":[{"id":"quickgo.go_0098028","title":"Gene Ontology term GO:0098028 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098028/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, shaft as: The tube of the non-contractile tails of some viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098027","kind":"concept","label":"virus tail, sheath","sources":[{"id":"quickgo.go_0098027","title":"Gene Ontology term GO:0098027 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098027/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, sheath as: The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098029","kind":"concept","label":"icosahedral viral capsid, spike","sources":[{"id":"quickgo.go_0098029","title":"Gene Ontology term GO:0098029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, spike as: A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098024","kind":"concept","label":"virus tail, fiber","sources":[{"id":"quickgo.go_0098024","title":"Gene Ontology term GO:0098024 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098024/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, fiber as: The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046729","kind":"concept","label":"viral procapsid","sources":[{"id":"quickgo.go_0046729","title":"Gene Ontology term GO:0046729 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046729/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral procapsid as: A stable empty viral capsid produced during the assembly of viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098023","kind":"concept","label":"virus tail, tip","sources":[{"id":"quickgo.go_0098023","title":"Gene Ontology term GO:0098023 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098023/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tip as: The basal end of the virus tail, which is used by the virus to attach to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019033","kind":"concept","label":"viral tegument","sources":[{"id":"quickgo.go_0019033","title":"Gene Ontology term GO:0019033 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019033/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tegument as: A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046727","kind":"concept","label":"capsomere","sources":[{"id":"quickgo.go_0046727","title":"Gene Ontology term GO:0046727 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046727/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines capsomere as: Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098026","kind":"concept","label":"virus tail, tube","sources":[{"id":"quickgo.go_0098026","title":"Gene Ontology term GO:0098026 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098026/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tube as: The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098015","kind":"concept","label":"virus tail","sources":[{"id":"quickgo.go_0098015","title":"Gene Ontology term GO:0098015 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098015/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail as: Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098025","kind":"concept","label":"virus tail, baseplate","sources":[{"id":"quickgo.go_0098025","title":"Gene Ontology term GO:0098025 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098025/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, baseplate as: Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098031","kind":"concept","label":"icosahedral viral capsid, collar","sources":[{"id":"quickgo.go_0098031","title":"Gene Ontology term GO:0098031 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098031/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, collar as: A small disk located at the base of some icosahedral virus capsids.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098030","kind":"concept","label":"icosahedral viral capsid, neck","sources":[{"id":"quickgo.go_0098030","title":"Gene Ontology term GO:0098030 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098030/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, neck as: A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098021","kind":"concept","label":"viral capsid, decoration","sources":[{"id":"quickgo.go_0098021","title":"Gene Ontology term GO:0098021 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098021/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, decoration as: Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036338","kind":"concept","label":"viral membrane","sources":[{"id":"quickgo.go_0036338","title":"Gene Ontology term GO:0036338 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036338/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral membrane as: The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009420","kind":"concept","label":"bacterial-type flagellum filament","sources":[{"id":"quickgo.go_0009420","title":"Gene Ontology term GO:0009420 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009420/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament as: The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031672","kind":"concept","label":"A band","sources":[{"id":"quickgo.go_0031672","title":"Gene Ontology term GO:0031672 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031672/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines A band as: The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061834","kind":"concept","label":"actin filament branch point","sources":[{"id":"quickgo.go_0061834","title":"Gene Ontology term GO:0061834 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061834/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament branch point as: The part of an actin filament where the structure forks.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048046","kind":"concept","label":"apoplast","sources":[{"id":"quickgo.go_0048046","title":"Gene Ontology term GO:0048046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines apoplast as: The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009541","kind":"concept","label":"etioplast prolamellar body","sources":[{"id":"quickgo.go_0009541","title":"Gene Ontology term GO:0009541 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009541/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines etioplast prolamellar body as: A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098843","kind":"concept","label":"postsynaptic endocytic zone","sources":[{"id":"quickgo.go_0098843","title":"Gene Ontology term GO:0098843 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098843/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines postsynaptic endocytic zone as: A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005829","kind":"concept","label":"cytosol","sources":[{"id":"quickgo.go_0005829","title":"Gene Ontology term GO:0005829 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005829/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosol as: The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042763","kind":"concept","label":"intracellular immature spore","sources":[{"id":"quickgo.go_0042763","title":"Gene Ontology term GO:0042763 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042763/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intracellular immature spore as: A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090123","kind":"concept","label":"lysosomal glycocalyx","sources":[{"id":"quickgo.go_0090123","title":"Gene Ontology term GO:0090123 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090123/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal glycocalyx as: The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009431","kind":"concept","label":"bacterial-type flagellum basal body, MS ring","sources":[{"id":"quickgo.go_0009431","title":"Gene Ontology term GO:0009431 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009431/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, MS ring as: One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0150034","kind":"concept","label":"distal axon","sources":[{"id":"quickgo.go_0150034","title":"Gene Ontology term GO:0150034 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0150034/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal axon as: That part of an axon close to and including the growth cone or the axon terminus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061822","kind":"concept","label":"ciliary cap","sources":[{"id":"quickgo.go_0061822","title":"Gene Ontology term GO:0061822 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061822/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary cap as: An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046818","kind":"concept","label":"dense nuclear body","sources":[{"id":"quickgo.go_0046818","title":"Gene Ontology term GO:0046818 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046818/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense nuclear body as: A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031430","kind":"concept","label":"M band","sources":[{"id":"quickgo.go_0031430","title":"Gene Ontology term GO:0031430 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031430/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines M band as: The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001917","kind":"concept","label":"photoreceptor inner segment","sources":[{"id":"quickgo.go_0001917","title":"Gene Ontology term GO:0001917 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001917/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor inner segment as: The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060104","kind":"concept","label":"surface coat of collagen and cuticulin-based cuticle extracellular matrix","sources":[{"id":"quickgo.go_0060104","title":"Gene Ontology term GO:0060104 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060104/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines surface coat of collagen and cuticulin-based cuticle extracellular matrix as: An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120102","kind":"concept","label":"bacterial-type flagellum secretion apparatus","sources":[{"id":"quickgo.go_0120102","title":"Gene Ontology term GO:0120102 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120102/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum secretion apparatus as: A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061845","kind":"concept","label":"neuron projection branch point","sources":[{"id":"quickgo.go_0061845","title":"Gene Ontology term GO:0061845 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061845/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines neuron projection branch point as: The location where a secondary projection arises from a neuron projection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001750","kind":"concept","label":"photoreceptor outer segment","sources":[{"id":"quickgo.go_0001750","title":"Gene Ontology term GO:0001750 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001750/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor outer segment as: The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032179","kind":"concept","label":"germ tube","sources":[{"id":"quickgo.go_0032179","title":"Gene Ontology term GO:0032179 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032179/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines germ tube as: The slender tubular outgrowth first produced by most spores in germination.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001400","kind":"concept","label":"mating projection base","sources":[{"id":"quickgo.go_0001400","title":"Gene Ontology term GO:0001400 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001400/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating projection base as: The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016328","kind":"concept","label":"lateral plasma membrane","sources":[{"id":"quickgo.go_0016328","title":"Gene Ontology term GO:0016328 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016328/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral plasma membrane as: The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043672","kind":"concept","label":"nexine","sources":[{"id":"quickgo.go_0043672","title":"Gene Ontology term GO:0043672 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043672/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nexine as: The inner, non-sculptured part of the exine which lies below the sexine.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090692","kind":"concept","label":"mitochondrial membrane scission site","sources":[{"id":"quickgo.go_0090692","title":"Gene Ontology term GO:0090692 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090692/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial membrane scission site as: The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097595","kind":"concept","label":"ventral disc crossbridge","sources":[{"id":"quickgo.go_0097595","title":"Gene Ontology term GO:0097595 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097595/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc crossbridge as: Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005576","kind":"concept","label":"extracellular region","sources":[{"id":"quickgo.go_0005576","title":"Gene Ontology term GO:0005576 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005576/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular region as: The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090726","kind":"concept","label":"cortical dynamic polarity patch","sources":[{"id":"quickgo.go_0090726","title":"Gene Ontology term GO:0090726 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090726/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cortical dynamic polarity patch as: A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031257","kind":"concept","label":"cell trailing edge membrane","sources":[{"id":"quickgo.go_0031257","title":"Gene Ontology term GO:0031257 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031257/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell trailing edge membrane as: The portion of the plasma membrane surrounding the trailing edge of a motile cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001652","kind":"concept","label":"granular component","sources":[{"id":"quickgo.go_0001652","title":"Gene Ontology term GO:0001652 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001652/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines granular component as: A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120135","kind":"concept","label":"distal portion of axoneme","sources":[{"id":"quickgo.go_0120135","title":"Gene Ontology term GO:0120135 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120135/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal portion of axoneme as: The portion of the axoneme that is close to the tip of the cilium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030061","kind":"concept","label":"mitochondrial crista","sources":[{"id":"quickgo.go_0030061","title":"Gene Ontology term GO:0030061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial crista as: Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097683","kind":"concept","label":"dinoflagellate apex","sources":[{"id":"quickgo.go_0097683","title":"Gene Ontology term GO:0097683 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097683/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate apex as: The anterior most point of a dinoflagellate epicone.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0085036","kind":"concept","label":"extrahaustorial matrix","sources":[{"id":"quickgo.go_0085036","title":"Gene Ontology term GO:0085036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0085036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extrahaustorial matrix as: The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120321","kind":"concept","label":"nuclear envelope adjacent to nuclear pore complex","sources":[{"id":"quickgo.go_0120321","title":"Gene Ontology term GO:0120321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear envelope adjacent to nuclear pore complex as: The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009574","kind":"concept","label":"preprophase band","sources":[{"id":"quickgo.go_0009574","title":"Gene Ontology term GO:0009574 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009574/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines preprophase band as: A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097562","kind":"concept","label":"left lateral basal body pair","sources":[{"id":"quickgo.go_0097562","title":"Gene Ontology term GO:0097562 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097562/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines left lateral basal body pair as: Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0014705","kind":"concept","label":"C zone","sources":[{"id":"quickgo.go_0014705","title":"Gene Ontology term GO:0014705 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0014705/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines C zone as: A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0072324","kind":"concept","label":"ascus epiplasm","sources":[{"id":"quickgo.go_0072324","title":"Gene Ontology term GO:0072324 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0072324/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ascus epiplasm as: Ascus cytoplasm that is not packaged into ascospores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097002","kind":"concept","label":"mitochondrial inner boundary membrane","sources":[{"id":"quickgo.go_0097002","title":"Gene Ontology term GO:0097002 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097002/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial inner boundary membrane as: The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990047","kind":"concept","label":"spindle matrix","sources":[{"id":"quickgo.go_1990047","title":"Gene Ontology term GO:1990047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spindle matrix as: A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0070057","kind":"concept","label":"prospore membrane spindle pole body attachment site","sources":[{"id":"quickgo.go_0070057","title":"Gene Ontology term GO:0070057 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0070057/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines prospore membrane spindle pole body attachment site as: The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099522","kind":"concept","label":"cytosolic region","sources":[{"id":"quickgo.go_0099522","title":"Gene Ontology term GO:0099522 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099522/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosolic region as: Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060105","kind":"concept","label":"epicuticle of collagen and cuticulin-based cuticle extracellular matrix","sources":[{"id":"quickgo.go_0060105","title":"Gene Ontology term GO:0060105 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060105/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines epicuticle of collagen and cuticulin-based cuticle extracellular matrix as: A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001772","kind":"concept","label":"immunological synapse","sources":[{"id":"quickgo.go_0001772","title":"Gene Ontology term GO:0001772 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001772/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological synapse as: An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005652","kind":"concept","label":"nuclear lamina","sources":[{"id":"quickgo.go_0005652","title":"Gene Ontology term GO:0005652 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005652/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear lamina as: The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043671","kind":"concept","label":"endexine","sources":[{"id":"quickgo.go_0043671","title":"Gene Ontology term GO:0043671 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043671/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines endexine as: The inner part of the exine, which stains.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0020023","kind":"concept","label":"kinetoplast","sources":[{"id":"quickgo.go_0020023","title":"Gene Ontology term GO:0020023 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0020023/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines kinetoplast as: A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032178","kind":"concept","label":"medial membrane band","sources":[{"id":"quickgo.go_0032178","title":"Gene Ontology term GO:0032178 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032178/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines medial membrane band as: A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097596","kind":"concept","label":"ventral disc supernumerary microtubule array","sources":[{"id":"quickgo.go_0097596","title":"Gene Ontology term GO:0097596 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097596/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc supernumerary microtubule array as: A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030315","kind":"concept","label":"T-tubule","sources":[{"id":"quickgo.go_0030315","title":"Gene Ontology term GO:0030315 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030315/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines T-tubule as: Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035749","kind":"concept","label":"myelin sheath adaxonal region","sources":[{"id":"quickgo.go_0035749","title":"Gene Ontology term GO:0035749 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035749/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myelin sheath adaxonal region as: The region of the myelin sheath nearest to the axon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go7770129","kind":"concept","label":"spermatid residual body","sources":[{"id":"quickgo.go_7770129","title":"Gene Ontology term GO:7770129 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:7770129/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spermatid residual body as: A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031256","kind":"concept","label":"leading edge membrane","sources":[{"id":"quickgo.go_0031256","title":"Gene Ontology term GO:0031256 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031256/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leading edge membrane as: The portion of the plasma membrane surrounding the leading edge of a motile cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140599","kind":"concept","label":"mitotic nuclear bridge midzone membrane domain","sources":[{"id":"quickgo.go_0140599","title":"Gene Ontology term GO:0140599 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140599/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge midzone membrane domain as: A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001651","kind":"concept","label":"dense fibrillar component","sources":[{"id":"quickgo.go_0001651","title":"Gene Ontology term GO:0001651 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001651/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense fibrillar component as: A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009422","kind":"concept","label":"bacterial-type flagellum hook-filament junction","sources":[{"id":"quickgo.go_0009422","title":"Gene Ontology term GO:0009422 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009422/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook-filament junction as: The region of the bacterial-type flagellum where the hook and filament meet.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090637","kind":"concept","label":"inner dense plaque of desmosome","sources":[{"id":"quickgo.go_0090637","title":"Gene Ontology term GO:0090637 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090637/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines inner dense plaque of desmosome as: The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031674","kind":"concept","label":"I band","sources":[{"id":"quickgo.go_0031674","title":"Gene Ontology term GO:0031674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines I band as: A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0170047","kind":"concept","label":"virus-like capsid","sources":[{"id":"quickgo.go_0170047","title":"Gene Ontology term GO:0170047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0170047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus-like capsid as: A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0012505","kind":"concept","label":"endomembrane system","sources":[{"id":"quickgo.go_0012505","title":"Gene Ontology term GO:0012505 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0012505/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines endomembrane system as: A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043226","kind":"concept","label":"organelle","sources":[{"id":"quickgo.go_0043226","title":"Gene Ontology term GO:0043226 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043226/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle as: Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043203","kind":"concept","label":"axon hillock","sources":[{"id":"quickgo.go_0043203","title":"Gene Ontology term GO:0043203 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043203/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines axon hillock as: Portion of the neuronal cell soma from which the axon originates.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0014801","kind":"concept","label":"longitudinal sarcoplasmic reticulum","sources":[{"id":"quickgo.go_0014801","title":"Gene Ontology term GO:0014801 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0014801/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines longitudinal sarcoplasmic reticulum as: The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097047","kind":"concept","label":"DNA replication termination region","sources":[{"id":"quickgo.go_0097047","title":"Gene Ontology term GO:0097047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines DNA replication termination region as: A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042995","kind":"concept","label":"cell projection","sources":[{"id":"quickgo.go_0042995","title":"Gene Ontology term GO:0042995 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042995/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell projection as: A prolongation or process extending from a cell, e.g. a flagellum or axon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009433","kind":"concept","label":"bacterial-type flagellum basal body, C ring","sources":[{"id":"quickgo.go_0009433","title":"Gene Ontology term GO:0009433 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009433/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, C ring as: Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120104","kind":"concept","label":"mitotic actomyosin contractile ring, proximal layer","sources":[{"id":"quickgo.go_0120104","title":"Gene Ontology term GO:0120104 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120104/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic actomyosin contractile ring, proximal layer as: The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005630","kind":"concept","label":"dityrosine layer of spore wall","sources":[{"id":"quickgo.go_0005630","title":"Gene Ontology term GO:0005630 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005630/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dityrosine layer of spore wall as: The outermost layer of the spore wall, as described in Saccharomyces.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001650","kind":"concept","label":"fibrillar center","sources":[{"id":"quickgo.go_0001650","title":"Gene Ontology term GO:0001650 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001650/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fibrillar center as: A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990836","kind":"concept","label":"lysosomal matrix","sources":[{"id":"quickgo.go_1990836","title":"Gene Ontology term GO:1990836 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990836/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal matrix as: A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097593","kind":"concept","label":"ventral disc microtubule array","sources":[{"id":"quickgo.go_0097593","title":"Gene Ontology term GO:0097593 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097593/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc microtubule array as: A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043670","kind":"concept","label":"foot layer","sources":[{"id":"quickgo.go_0043670","title":"Gene Ontology term GO:0043670 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043670/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines foot layer as: The inner layer of the ectexine.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0106126","kind":"concept","label":"reservosome membrane","sources":[{"id":"quickgo.go_0106126","title":"Gene Ontology term GO:0106126 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0106126/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome membrane as: The lipid bilayer surrounding a reservosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090724","kind":"concept","label":"central region of growth cone","sources":[{"id":"quickgo.go_0090724","title":"Gene Ontology term GO:0090724 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090724/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines central region of growth cone as: The center of the migrating motile tip of a growing nerve cell axon or dendrite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120082","kind":"concept","label":"smooth endoplasmic reticulum cisterna","sources":[{"id":"quickgo.go_0120082","title":"Gene Ontology term GO:0120082 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120082/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines smooth endoplasmic reticulum cisterna as: A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120212","kind":"concept","label":"sperm head-tail coupling apparatus","sources":[{"id":"quickgo.go_0120212","title":"Gene Ontology term GO:0120212 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120212/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm head-tail coupling apparatus as: A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061835","kind":"concept","label":"ventral surface of cell","sources":[{"id":"quickgo.go_0061835","title":"Gene Ontology term GO:0061835 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061835/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral surface of cell as: The surface of a migrating cell that is in contact with the substratum or cell layer.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071808","kind":"concept","label":"satellite fibril","sources":[{"id":"quickgo.go_0071808","title":"Gene Ontology term GO:0071808 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071808/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines satellite fibril as: An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009421","kind":"concept","label":"bacterial-type flagellum filament cap","sources":[{"id":"quickgo.go_0009421","title":"Gene Ontology term GO:0009421 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009421/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament cap as: The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031673","kind":"concept","label":"H zone","sources":[{"id":"quickgo.go_0031673","title":"Gene Ontology term GO:0031673 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031673/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines H zone as: A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033774","kind":"concept","label":"basal labyrinth","sources":[{"id":"quickgo.go_0033774","title":"Gene Ontology term GO:0033774 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033774/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines basal labyrinth as: A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009542","kind":"concept","label":"granum","sources":[{"id":"quickgo.go_0009542","title":"Gene Ontology term GO:0009542 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009542/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines granum as: Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043204","kind":"concept","label":"perikaryon","sources":[{"id":"quickgo.go_0043204","title":"Gene Ontology term GO:0043204 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043204/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines perikaryon as: The portion of the cell soma (neuronal cell body) that excludes the nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001891","kind":"concept","label":"phagocytic cup","sources":[{"id":"quickgo.go_0001891","title":"Gene Ontology term GO:0001891 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001891/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines phagocytic cup as: An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044232","kind":"concept","label":"organelle membrane contact site","sources":[{"id":"quickgo.go_0044232","title":"Gene Ontology term GO:0044232 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044232/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle membrane contact site as: A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061823","kind":"concept","label":"ring centriole","sources":[{"id":"quickgo.go_0061823","title":"Gene Ontology term GO:0061823 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061823/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ring centriole as: A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030427","kind":"concept","label":"site of polarized growth","sources":[{"id":"quickgo.go_0030427","title":"Gene Ontology term GO:0030427 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030427/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines site of polarized growth as: Any part of a cell where non-isotropic growth takes place.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043083","kind":"concept","label":"synaptic cleft","sources":[{"id":"quickgo.go_0043083","title":"Gene Ontology term GO:0043083 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043083/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic cleft as: The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048471","kind":"concept","label":"perinuclear region of cytoplasm","sources":[{"id":"quickgo.go_0048471","title":"Gene Ontology term GO:0048471 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048471/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines perinuclear region of cytoplasm as: Cytoplasm situated near, or occurring around, the nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099086","kind":"concept","label":"synaptonemal structure","sources":[{"id":"quickgo.go_0099086","title":"Gene Ontology term GO:0099086 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099086/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptonemal structure as: A proteinaceous scaffold found between homologous chromosomes during meiosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042641","kind":"concept","label":"actomyosin","sources":[{"id":"quickgo.go_0042641","title":"Gene Ontology term GO:0042641 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042641/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actomyosin as: Any complex of actin, myosin, and accessory proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005654","kind":"concept","label":"nucleoplasm","sources":[{"id":"quickgo.go_0005654","title":"Gene Ontology term GO:0005654 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005654/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasm as: That part of the nuclear content other than the chromosomes or the nucleolus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0070701","kind":"concept","label":"mucus layer","sources":[{"id":"quickgo.go_0070701","title":"Gene Ontology term GO:0070701 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0070701/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mucus layer as: An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005631","kind":"concept","label":"chitosan layer of spore wall","sources":[{"id":"quickgo.go_0005631","title":"Gene Ontology term GO:0005631 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005631/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chitosan layer of spore wall as: The second outermost layer of the spore wall, as described in Saccharomyces.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097594","kind":"concept","label":"ventral disc dorsal microribbon","sources":[{"id":"quickgo.go_0097594","title":"Gene Ontology term GO:0097594 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097594/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc dorsal microribbon as: Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0106125","kind":"concept","label":"reservosome matrix","sources":[{"id":"quickgo.go_0106125","title":"Gene Ontology term GO:0106125 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0106125/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome matrix as: A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090725","kind":"concept","label":"peripheral region of growth cone","sources":[{"id":"quickgo.go_0090725","title":"Gene Ontology term GO:0090725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines peripheral region of growth cone as: The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140918","kind":"concept","label":"centrosomal core","sources":[{"id":"quickgo.go_0140918","title":"Gene Ontology term GO:0140918 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140918/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines centrosomal core as: The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032153","kind":"concept","label":"cell division site","sources":[{"id":"quickgo.go_0032153","title":"Gene Ontology term GO:0032153 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032153/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division site as: The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090635","kind":"concept","label":"extracellular core region of desmosome","sources":[{"id":"quickgo.go_0090635","title":"Gene Ontology term GO:0090635 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090635/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular core region of desmosome as: The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090405","kind":"concept","label":"unicellular trichome branch","sources":[{"id":"quickgo.go_0090405","title":"Gene Ontology term GO:0090405 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090405/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines unicellular trichome branch as: A cell projection part that is a branch of a unicellular trichome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140511","kind":"concept","label":"mitotic nuclear bridge stalk","sources":[{"id":"quickgo.go_0140511","title":"Gene Ontology term GO:0140511 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140511/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge stalk as: Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090658","kind":"concept","label":"cone matrix sheath","sources":[{"id":"quickgo.go_0090658","title":"Gene Ontology term GO:0090658 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090658/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cone matrix sheath as: A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009424","kind":"concept","label":"bacterial-type flagellum hook","sources":[{"id":"quickgo.go_0009424","title":"Gene Ontology term GO:0009424 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009424/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook as: The portion of the bacterial-type flagellum that connects the filament to the basal body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099079","kind":"concept","label":"actin body","sources":[{"id":"quickgo.go_0099079","title":"Gene Ontology term GO:0099079 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099079/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin body as: An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030017","kind":"concept","label":"sarcomere","sources":[{"id":"quickgo.go_0030017","title":"Gene Ontology term GO:0030017 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030017/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sarcomere as: The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043036","kind":"concept","label":"starch grain","sources":[{"id":"quickgo.go_0043036","title":"Gene Ontology term GO:0043036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines starch grain as: Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990826","kind":"concept","label":"nucleoplasmic periphery of the nuclear pore complex","sources":[{"id":"quickgo.go_1990826","title":"Gene Ontology term GO:1990826 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990826/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasmic periphery of the nuclear pore complex as: Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098862","kind":"concept","label":"cluster of actin-based cell projections","sources":[{"id":"quickgo.go_0098862","title":"Gene Ontology term GO:0098862 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098862/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cluster of actin-based cell projections as: A cell part consisting of multiple, closely packed actin-based cell projections.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035686","kind":"concept","label":"sperm fibrous sheath","sources":[{"id":"quickgo.go_0035686","title":"Gene Ontology term GO:0035686 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035686/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm fibrous sheath as: A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043220","kind":"concept","label":"Schmidt-Lanterman incisure","sources":[{"id":"quickgo.go_0043220","title":"Gene Ontology term GO:0043220 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043220/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines Schmidt-Lanterman incisure as: Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0020038","kind":"concept","label":"subpellicular network","sources":[{"id":"quickgo.go_0020038","title":"Gene Ontology term GO:0020038 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0020038/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines subpellicular network as: A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097614","kind":"concept","label":"dinoflagellate hypocone","sources":[{"id":"quickgo.go_0097614","title":"Gene Ontology term GO:0097614 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097614/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate hypocone as: The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000785","kind":"concept","label":"chromatin","sources":[{"id":"quickgo.go_0000785","title":"Gene Ontology term GO:0000785 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000785/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chromatin as: The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045171","kind":"concept","label":"intercellular bridge","sources":[{"id":"quickgo.go_0045171","title":"Gene Ontology term GO:0045171 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045171/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intercellular bridge as: A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990900","kind":"concept","label":"ciliary pocket collar","sources":[{"id":"quickgo.go_1990900","title":"Gene Ontology term GO:1990900 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990900/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary pocket collar as: A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990717","kind":"concept","label":"axonemal central bridge","sources":[{"id":"quickgo.go_1990717","title":"Gene Ontology term GO:1990717 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990717/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines axonemal central bridge as: Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060108","kind":"concept","label":"annular furrow extracellular matrix","sources":[{"id":"quickgo.go_0060108","title":"Gene Ontology term GO:0060108 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060108/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines annular furrow extracellular matrix as: The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005825","kind":"concept","label":"half bridge of spindle pole body","sources":[{"id":"quickgo.go_0005825","title":"Gene Ontology term GO:0005825 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005825/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines half bridge of spindle pole body as: Structure adjacent to the plaques of the spindle pole body.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300145966","kind":"concept","label":"religious concepts","sources":[{"id":"getty-aat.300145966","title":"Getty Art & Architecture Thesaurus record 300145966","url":"http://vocab.getty.edu/page/aat/300145966"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious concepts as: Ideas and notions that are fundamentally religious.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055938","kind":"concept","label":"philosophical concepts","sources":[{"id":"getty-aat.300055938","title":"Getty Art & Architecture Thesaurus record 300055938","url":"http://vocab.getty.edu/page/aat/300055938"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophical concepts as: Concepts related to knowledge, learning, and scholarship.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264088","kind":"concept","label":"Styles and Periods Facet","sources":[{"id":"getty-aat.300264088","title":"Getty Art & Architecture Thesaurus record 300264088","url":"http://vocab.getty.edu/page/aat/300264088"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Styles and Periods Facet as: Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300412155","kind":"field","label":"book history","sources":[{"id":"getty-aat.300412155","title":"Getty Art & Architecture Thesaurus record 300412155","url":"http://vocab.getty.edu/page/aat/300412155"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines book history as: Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054273","kind":"field","label":"literary studies","sources":[{"id":"getty-aat.300054273","title":"Getty Art & Architecture Thesaurus record 300054273","url":"http://vocab.getty.edu/page/aat/300054273"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary studies as: Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054275","kind":"field","label":"museology","sources":[{"id":"getty-aat.300054275","title":"Getty Art & Architecture Thesaurus record 300054275","url":"http://vocab.getty.edu/page/aat/300054275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museology as: The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300444364","kind":"field","label":"paper history","sources":[{"id":"getty-aat.300444364","title":"Getty Art & Architecture Thesaurus record 300444364","url":"http://vocab.getty.edu/page/aat/300444364"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paper history as: Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264335","kind":"concept","label":"auspicia","sources":[{"id":"getty-aat.300264335","title":"Getty Art & Architecture Thesaurus record 300264335","url":"http://vocab.getty.edu/page/aat/300264335"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines auspicia as: In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263186","kind":"concept","label":"biblical","sources":[{"id":"getty-aat.300263186","title":"Getty Art & Architecture Thesaurus record 300263186","url":"http://vocab.getty.edu/page/aat/300263186"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines biblical as: Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264359","kind":"concept","label":"blasphemy","sources":[{"id":"getty-aat.300264359","title":"Getty Art & Architecture Thesaurus record 300264359","url":"http://vocab.getty.edu/page/aat/300264359"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines blasphemy as: An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300380145","kind":"concept","label":"cultism","sources":[{"id":"getty-aat.300380145","title":"Getty Art & Architecture Thesaurus record 300380145","url":"http://vocab.getty.edu/page/aat/300380145"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cultism as: Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417271","kind":"concept","label":"divine judgment","sources":[{"id":"getty-aat.300417271","title":"Getty Art & Architecture Thesaurus record 300417271","url":"http://vocab.getty.edu/page/aat/300417271"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines divine judgment as: Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300145975","kind":"concept","label":"doctrinal concepts","sources":[{"id":"getty-aat.300145975","title":"Getty Art & Architecture Thesaurus record 300145975","url":"http://vocab.getty.edu/page/aat/300145975"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines doctrinal concepts as: Religious concepts related to doctrine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264310","kind":"concept","label":"Dreaming, the","sources":[{"id":"getty-aat.300264310","title":"Getty Art & Architecture Thesaurus record 300264310","url":"http://vocab.getty.edu/page/aat/300264310"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dreaming, the as: A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379137","kind":"concept","label":"heresy","sources":[{"id":"getty-aat.300379137","title":"Getty Art & Architecture Thesaurus record 300379137","url":"http://vocab.getty.edu/page/aat/300379137"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines heresy as: Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055991","kind":"concept","label":"monasticism","sources":[{"id":"getty-aat.300055991","title":"Getty Art & Architecture Thesaurus record 300055991","url":"http://vocab.getty.edu/page/aat/300055991"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monasticism as: A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451043","kind":"concept","label":"private devotion","sources":[{"id":"getty-aat.300451043","title":"Getty Art & Architecture Thesaurus record 300451043","url":"http://vocab.getty.edu/page/aat/300451043"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines private devotion as: The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412108","kind":"concept","label":"rabbinical","sources":[{"id":"getty-aat.300412108","title":"Getty Art & Architecture Thesaurus record 300412108","url":"http://vocab.getty.edu/page/aat/300412108"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rabbinical as: Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300055987","kind":"field","label":"religious ideologies","sources":[{"id":"getty-aat.300055987","title":"Getty Art & Architecture Thesaurus record 300055987","url":"http://vocab.getty.edu/page/aat/300055987"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious ideologies as: Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056005","kind":"concept","label":"worship","sources":[{"id":"getty-aat.300056005","title":"Getty Art & Architecture Thesaurus record 300056005","url":"http://vocab.getty.edu/page/aat/300056005"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines worship as: The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300124083","kind":"concept","label":"aesthetic concepts","sources":[{"id":"getty-aat.300124083","title":"Getty Art & Architecture Thesaurus record 300124083","url":"http://vocab.getty.edu/page/aat/300124083"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines aesthetic concepts as: Concepts related to perception of what is ideal or beautiful.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379123","kind":"concept","label":"betrayal","sources":[{"id":"getty-aat.300379123","title":"Getty Art & Architecture Thesaurus record 300379123","url":"http://vocab.getty.edu/page/aat/300379123"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines betrayal as: Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412040","kind":"concept","label":"cosmos","sources":[{"id":"getty-aat.300412040","title":"Getty Art & Architecture Thesaurus record 300412040","url":"http://vocab.getty.edu/page/aat/300412040"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cosmos as: An ordered and harmonious system that comprises the world or universe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410285","kind":"concept","label":"evil","sources":[{"id":"getty-aat.300410285","title":"Getty Art & Architecture Thesaurus record 300410285","url":"http://vocab.getty.edu/page/aat/300410285"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines evil as: The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435308","kind":"concept","label":"fate","sources":[{"id":"getty-aat.300435308","title":"Getty Art & Architecture Thesaurus record 300435308","url":"http://vocab.getty.edu/page/aat/300435308"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fate as: The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410287","kind":"concept","label":"fortitude","sources":[{"id":"getty-aat.300410287","title":"Getty Art & Architecture Thesaurus record 300410287","url":"http://vocab.getty.edu/page/aat/300410287"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fortitude as: Moral strength or courage, unyielding courage, endurance of pain or adversity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410316","kind":"concept","label":"fortune","sources":[{"id":"getty-aat.300410316","title":"Getty Art & Architecture Thesaurus record 300410316","url":"http://vocab.getty.edu/page/aat/300410316"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fortune as: Chance or luck, when regarded as a cause of events and changes in human affairs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379723","kind":"concept","label":"hope","sources":[{"id":"getty-aat.300379723","title":"Getty Art & Architecture Thesaurus record 300379723","url":"http://vocab.getty.edu/page/aat/300379723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hope as: The expectation of something desired.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438472","kind":"concept","label":"hózhó","sources":[{"id":"getty-aat.300438472","title":"Getty Art & Architecture Thesaurus record 300438472","url":"http://vocab.getty.edu/page/aat/300438472"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hózhó as: Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300258340","kind":"field","label":"ideology","sources":[{"id":"getty-aat.300258340","title":"Getty Art & Architecture Thesaurus record 300258340","url":"http://vocab.getty.edu/page/aat/300258340"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ideology as: Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300449137","kind":"concept","label":"ignorance","sources":[{"id":"getty-aat.300449137","title":"Getty Art & Architecture Thesaurus record 300449137","url":"http://vocab.getty.edu/page/aat/300449137"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ignorance as: The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451359","kind":"concept","label":"immortality","sources":[{"id":"getty-aat.300451359","title":"Getty Art & Architecture Thesaurus record 300451359","url":"http://vocab.getty.edu/page/aat/300451359"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines immortality as: In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412128","kind":"concept","label":"inventiveness","sources":[{"id":"getty-aat.300412128","title":"Getty Art & Architecture Thesaurus record 300412128","url":"http://vocab.getty.edu/page/aat/300412128"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines inventiveness as: The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055945","kind":"concept","label":"metaphysical concepts","sources":[{"id":"getty-aat.300055945","title":"Getty Art & Architecture Thesaurus record 300055945","url":"http://vocab.getty.edu/page/aat/300055945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines metaphysical concepts as: Philosophical concepts that deal with the nature of reality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417426","kind":"concept","label":"morality","sources":[{"id":"getty-aat.300417426","title":"Getty Art & Architecture Thesaurus record 300417426","url":"http://vocab.getty.edu/page/aat/300417426"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines morality as: Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412116","kind":"concept","label":"prudence","sources":[{"id":"getty-aat.300412116","title":"Getty Art & Architecture Thesaurus record 300412116","url":"http://vocab.getty.edu/page/aat/300412116"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prudence as: Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417325","kind":"concept","label":"survival","sources":[{"id":"getty-aat.300417325","title":"Getty Art & Architecture Thesaurus record 300417325","url":"http://vocab.getty.edu/page/aat/300417325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines survival as: The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300068765","kind":"concept","label":"truth","sources":[{"id":"getty-aat.300068765","title":"Getty Art & Architecture Thesaurus record 300068765","url":"http://vocab.getty.edu/page/aat/300068765"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines truth as: A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379068","kind":"concept","label":"vengeance","sources":[{"id":"getty-aat.300379068","title":"Getty Art & Architecture Thesaurus record 300379068","url":"http://vocab.getty.edu/page/aat/300379068"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vengeance as: The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300380150","kind":"concept","label":"wisdom","sources":[{"id":"getty-aat.300380150","title":"Getty Art & Architecture Thesaurus record 300380150","url":"http://vocab.getty.edu/page/aat/300380150"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines wisdom as: Accumulated learning and soundness of judgment in the choice of means and ends.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412041","kind":"concept","label":"world","sources":[{"id":"getty-aat.300412041","title":"Getty Art & Architecture Thesaurus record 300412041","url":"http://vocab.getty.edu/page/aat/300412041"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines world as: The state or realm of existence, particularly of the physical.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417578","kind":"concept","label":"theater arts","sources":[{"id":"getty-aat.300417578","title":"Getty Art & Architecture Thesaurus record 300417578","url":"http://vocab.getty.edu/page/aat/300417578"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theater arts as: Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266573","kind":"concept","label":"electronic music","sources":[{"id":"getty-aat.300266573","title":"Getty Art & Architecture Thesaurus record 300266573","url":"http://vocab.getty.edu/page/aat/300266573"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines electronic music as: Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266367","kind":"concept","label":"jazz","sources":[{"id":"getty-aat.300266367","title":"Getty Art & Architecture Thesaurus record 300266367","url":"http://vocab.getty.edu/page/aat/300266367"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines jazz as: Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417616","kind":"concept","label":"musical theater","sources":[{"id":"getty-aat.300417616","title":"Getty Art & Architecture Thesaurus record 300417616","url":"http://vocab.getty.edu/page/aat/300417616"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musical theater as: Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417961","kind":"concept","label":"rhythm and blues","sources":[{"id":"getty-aat.300417961","title":"Getty Art & Architecture Thesaurus record 300417961","url":"http://vocab.getty.edu/page/aat/300417961"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rhythm and blues as: Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266054","kind":"concept","label":"serial music","sources":[{"id":"getty-aat.300266054","title":"Getty Art & Architecture Thesaurus record 300266054","url":"http://vocab.getty.edu/page/aat/300266054"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines serial music as: A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300201023","kind":"concept","label":"myths","sources":[{"id":"getty-aat.300201023","title":"Getty Art & Architecture Thesaurus record 300201023","url":"http://vocab.getty.edu/page/aat/300201023"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines myths as: Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054232","kind":"concept","label":"arts-related disciplines","sources":[{"id":"getty-aat.300054232","title":"Getty Art & Architecture Thesaurus record 300054232","url":"http://vocab.getty.edu/page/aat/300054232"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arts-related disciplines as: Branches of learning devoted to the arts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054245","kind":"field","label":"linguistics","sources":[{"id":"getty-aat.300054245","title":"Getty Art & Architecture Thesaurus record 300054245","url":"http://vocab.getty.edu/page/aat/300054245"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300137410","kind":"concept","label":"linguistics-related disciplines","sources":[{"id":"getty-aat.300137410","title":"Getty Art & Architecture Thesaurus record 300137410","url":"http://vocab.getty.edu/page/aat/300137410"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines linguistics-related disciplines as: Branches of learning and professions related to linguistics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054274","kind":"concept","label":"comparative literature","sources":[{"id":"getty-aat.300054274","title":"Getty Art & Architecture Thesaurus record 300054274","url":"http://vocab.getty.edu/page/aat/300054274"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines comparative literature as: The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two literatures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300174160","kind":"field","label":"literary criticism","sources":[{"id":"getty-aat.300174160","title":"Getty Art & Architecture Thesaurus record 300174160","url":"http://vocab.getty.edu/page/aat/300174160"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary criticism as: The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300174173","kind":"field","label":"literary history","sources":[{"id":"getty-aat.300174173","title":"Getty Art & Architecture Thesaurus record 300174173","url":"http://vocab.getty.edu/page/aat/300174173"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary history as: Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300069325","kind":"field","label":"poetics","sources":[{"id":"getty-aat.300069325","title":"Getty Art & Architecture Thesaurus record 300069325","url":"http://vocab.getty.edu/page/aat/300069325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines poetics as: The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300387576","kind":"field","label":"museography","sources":[{"id":"getty-aat.300387576","title":"Getty Art & Architecture Thesaurus record 300387576","url":"http://vocab.getty.edu/page/aat/300387576"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museography as: Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054672","kind":"concept","label":"museum administration","sources":[{"id":"getty-aat.300054672","title":"Getty Art & Architecture Thesaurus record 300054672","url":"http://vocab.getty.edu/page/aat/300054672"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museum administration as: The study and practice of the administration of museums.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054280","kind":"field","label":"aesthetics","sources":[{"id":"getty-aat.300054280","title":"Getty Art & Architecture Thesaurus record 300054280","url":"http://vocab.getty.edu/page/aat/300054280"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054283","kind":"field","label":"axiology","sources":[{"id":"getty-aat.300054283","title":"Getty Art & Architecture Thesaurus record 300054283","url":"http://vocab.getty.edu/page/aat/300054283"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines axiology as: Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054288","kind":"field","label":"epistemology","sources":[{"id":"getty-aat.300054288","title":"Getty Art & Architecture Thesaurus record 300054288","url":"http://vocab.getty.edu/page/aat/300054288"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054297","kind":"field","label":"phenomenology","sources":[{"id":"getty-aat.300054297","title":"Getty Art & Architecture Thesaurus record 300054297","url":"http://vocab.getty.edu/page/aat/300054297"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312347","kind":"concept","label":"philosophy of art","sources":[{"id":"getty-aat.300312347","title":"Getty Art & Architecture Thesaurus record 300312347","url":"http://vocab.getty.edu/page/aat/300312347"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophy of art as: The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300265767","kind":"field","label":"teleology","sources":[{"id":"getty-aat.300265767","title":"Getty Art & Architecture Thesaurus record 300265767","url":"http://vocab.getty.edu/page/aat/300265767"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines teleology as: Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054306","kind":"concept","label":"religion-related disciplines","sources":[{"id":"getty-aat.300054306","title":"Getty Art & Architecture Thesaurus record 300054306","url":"http://vocab.getty.edu/page/aat/300054306"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religion-related disciplines as: Branches of learning devoted to religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264303","kind":"concept","label":"absolution","sources":[{"id":"getty-aat.300264303","title":"Getty Art & Architecture Thesaurus record 300264303","url":"http://vocab.getty.edu/page/aat/300264303"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines absolution as: A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264304","kind":"concept","label":"afterlife","sources":[{"id":"getty-aat.300264304","title":"Getty Art & Architecture Thesaurus record 300264304","url":"http://vocab.getty.edu/page/aat/300264304"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines afterlife as: The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435319","kind":"concept","label":"apotheosis","sources":[{"id":"getty-aat.300435319","title":"Getty Art & Architecture Thesaurus record 300435319","url":"http://vocab.getty.edu/page/aat/300435319"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines apotheosis as: Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264321","kind":"concept","label":"ascension","sources":[{"id":"getty-aat.300264321","title":"Getty Art & Architecture Thesaurus record 300264321","url":"http://vocab.getty.edu/page/aat/300264321"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ascension as: The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264529","kind":"concept","label":"Buddhist doctrinal concepts","sources":[{"id":"getty-aat.300264529","title":"Getty Art & Architecture Thesaurus record 300264529","url":"http://vocab.getty.edu/page/aat/300264529"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Buddhist doctrinal concepts as: Concepts related to the doctrine of Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264528","kind":"concept","label":"Christian doctrinal concepts","sources":[{"id":"getty-aat.300264528","title":"Getty Art & Architecture Thesaurus record 300264528","url":"http://vocab.getty.edu/page/aat/300264528"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Christian doctrinal concepts as: Concepts related to the doctrine of Christianity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458718","kind":"concept","label":"Cihuatlampan","sources":[{"id":"getty-aat.300458718","title":"Getty Art & Architecture Thesaurus record 300458718","url":"http://vocab.getty.edu/page/aat/300458718"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cihuatlampan as: Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265797","kind":"concept","label":"divine light","sources":[{"id":"getty-aat.300265797","title":"Getty Art & Architecture Thesaurus record 300265797","url":"http://vocab.getty.edu/page/aat/300265797"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines divine light as: Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412084","kind":"concept","label":"eternity","sources":[{"id":"getty-aat.300412084","title":"Getty Art & Architecture Thesaurus record 300412084","url":"http://vocab.getty.edu/page/aat/300412084"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines eternity as: Infinite time, which has neither beginning nor end.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055982","kind":"concept","label":"faith","sources":[{"id":"getty-aat.300055982","title":"Getty Art & Architecture Thesaurus record 300055982","url":"http://vocab.getty.edu/page/aat/300055982"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines faith as: Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404756","kind":"concept","label":"gates of hell","sources":[{"id":"getty-aat.300404756","title":"Getty Art & Architecture Thesaurus record 300404756","url":"http://vocab.getty.edu/page/aat/300404756"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines gates of hell as: Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300185658","kind":"concept","label":"heaven","sources":[{"id":"getty-aat.300185658","title":"Getty Art & Architecture Thesaurus record 300185658","url":"http://vocab.getty.edu/page/aat/300185658"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines heaven as: Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264527","kind":"concept","label":"Hindu doctrinal concepts","sources":[{"id":"getty-aat.300264527","title":"Getty Art & Architecture Thesaurus record 300264527","url":"http://vocab.getty.edu/page/aat/300264527"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hindu doctrinal concepts as: Concepts related to the doctrine of Hinduism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264530","kind":"concept","label":"Jain doctrinal concepts","sources":[{"id":"getty-aat.300264530","title":"Getty Art & Architecture Thesaurus record 300264530","url":"http://vocab.getty.edu/page/aat/300264530"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Jain doctrinal concepts as: Concepts related to the doctrine of Jainism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458684","kind":"concept","label":"Mazahuahcan","sources":[{"id":"getty-aat.300458684","title":"Getty Art & Architecture Thesaurus record 300458684","url":"http://vocab.getty.edu/page/aat/300458684"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mazahuahcan as: Refers to the conception of the west.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458696","kind":"concept","label":"Mictlampan","sources":[{"id":"getty-aat.300458696","title":"Getty Art & Architecture Thesaurus record 300458696","url":"http://vocab.getty.edu/page/aat/300458696"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mictlampan as: Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379822","kind":"concept","label":"purgatory","sources":[{"id":"getty-aat.300379822","title":"Getty Art & Architecture Thesaurus record 300379822","url":"http://vocab.getty.edu/page/aat/300379822"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines purgatory as: State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379085","kind":"concept","label":"redemption","sources":[{"id":"getty-aat.300379085","title":"Getty Art & Architecture Thesaurus record 300379085","url":"http://vocab.getty.edu/page/aat/300379085"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines redemption as: Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300073437","kind":"concept","label":"reincarnation","sources":[{"id":"getty-aat.300073437","title":"Getty Art & Architecture Thesaurus record 300073437","url":"http://vocab.getty.edu/page/aat/300073437"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines reincarnation as: The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056003","kind":"concept","label":"salvation","sources":[{"id":"getty-aat.300056003","title":"Getty Art & Architecture Thesaurus record 300056003","url":"http://vocab.getty.edu/page/aat/300056003"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines salvation as: The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056004","kind":"concept","label":"theophany","sources":[{"id":"getty-aat.300056004","title":"Getty Art & Architecture Thesaurus record 300056004","url":"http://vocab.getty.edu/page/aat/300056004"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theophany as: The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458697","kind":"concept","label":"Tlalocan","sources":[{"id":"getty-aat.300458697","title":"Getty Art & Architecture Thesaurus record 300458697","url":"http://vocab.getty.edu/page/aat/300458697"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tlalocan as: In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055988","kind":"concept","label":"Adoptionism","sources":[{"id":"getty-aat.300055988","title":"Getty Art & Architecture Thesaurus record 300055988","url":"http://vocab.getty.edu/page/aat/300055988"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Adoptionism as: Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055989","kind":"concept","label":"agnosticism","sources":[{"id":"getty-aat.300055989","title":"Getty Art & Architecture Thesaurus record 300055989","url":"http://vocab.getty.edu/page/aat/300055989"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines agnosticism as: Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300072604","kind":"concept","label":"animism","sources":[{"id":"getty-aat.300072604","title":"Getty Art & Architecture Thesaurus record 300072604","url":"http://vocab.getty.edu/page/aat/300072604"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines animism as: Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264322","kind":"concept","label":"asceticism","sources":[{"id":"getty-aat.300264322","title":"Getty Art & Architecture Thesaurus record 300264322","url":"http://vocab.getty.edu/page/aat/300264322"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines asceticism as: Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055990","kind":"concept","label":"atheism","sources":[{"id":"getty-aat.300055990","title":"Getty Art & Architecture Thesaurus record 300055990","url":"http://vocab.getty.edu/page/aat/300055990"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines atheism as: Doctrine that there is neither God nor any other deity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264504","kind":"concept","label":"Deism","sources":[{"id":"getty-aat.300264504","title":"Getty Art & Architecture Thesaurus record 300264504","url":"http://vocab.getty.edu/page/aat/300264504"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Deism as: Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055963","kind":"concept","label":"Gnosticism","sources":[{"id":"getty-aat.300055963","title":"Getty Art & Architecture Thesaurus record 300055963","url":"http://vocab.getty.edu/page/aat/300055963"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gnosticism as: Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300143325","kind":"concept","label":"Hasidism","sources":[{"id":"getty-aat.300143325","title":"Getty Art & Architecture Thesaurus record 300143325","url":"http://vocab.getty.edu/page/aat/300143325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hasidism as: Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300067974","kind":"concept","label":"millenarianism","sources":[{"id":"getty-aat.300067974","title":"Getty Art & Architecture Thesaurus record 300067974","url":"http://vocab.getty.edu/page/aat/300067974"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines millenarianism as: Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310748","kind":"concept","label":"monolatry","sources":[{"id":"getty-aat.300310748","title":"Getty Art & Architecture Thesaurus record 300310748","url":"http://vocab.getty.edu/page/aat/300310748"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monolatry as: The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055992","kind":"concept","label":"monotheism","sources":[{"id":"getty-aat.300055992","title":"Getty Art & Architecture Thesaurus record 300055992","url":"http://vocab.getty.edu/page/aat/300055992"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monotheism as: The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266058","kind":"concept","label":"Monothelitism","sources":[{"id":"getty-aat.300266058","title":"Getty Art & Architecture Thesaurus record 300266058","url":"http://vocab.getty.edu/page/aat/300266058"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Monothelitism as: Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055993","kind":"concept","label":"paganism","sources":[{"id":"getty-aat.300055993","title":"Getty Art & Architecture Thesaurus record 300055993","url":"http://vocab.getty.edu/page/aat/300055993"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paganism as: Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055995","kind":"concept","label":"pantheism","sources":[{"id":"getty-aat.300055995","title":"Getty Art & Architecture Thesaurus record 300055995","url":"http://vocab.getty.edu/page/aat/300055995"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pantheism as: Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055996","kind":"concept","label":"Pietism","sources":[{"id":"getty-aat.300055996","title":"Getty Art & Architecture Thesaurus record 300055996","url":"http://vocab.getty.edu/page/aat/300055996"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pietism as: A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055997","kind":"concept","label":"polytheism","sources":[{"id":"getty-aat.300055997","title":"Getty Art & Architecture Thesaurus record 300055997","url":"http://vocab.getty.edu/page/aat/300055997"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines polytheism as: The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055998","kind":"concept","label":"quietism","sources":[{"id":"getty-aat.300055998","title":"Getty Art & Architecture Thesaurus record 300055998","url":"http://vocab.getty.edu/page/aat/300055998"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines quietism as: Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055999","kind":"concept","label":"shamanism","sources":[{"id":"getty-aat.300055999","title":"Getty Art & Architecture Thesaurus record 300055999","url":"http://vocab.getty.edu/page/aat/300055999"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines shamanism as: Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056000","kind":"concept","label":"theosophy","sources":[{"id":"getty-aat.300056000","title":"Getty Art & Architecture Thesaurus record 300056000","url":"http://vocab.getty.edu/page/aat/300056000"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theosophy as: Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056002","kind":"concept","label":"totemism","sources":[{"id":"getty-aat.300056002","title":"Getty Art & Architecture Thesaurus record 300056002","url":"http://vocab.getty.edu/page/aat/300056002"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines totemism as: Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457805","kind":"concept","label":"hagiolatry","sources":[{"id":"getty-aat.300457805","title":"Getty Art & Architecture Thesaurus record 300457805","url":"http://vocab.getty.edu/page/aat/300457805"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hagiolatry as: The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055983","kind":"concept","label":"liturgy","sources":[{"id":"getty-aat.300055983","title":"Getty Art & Architecture Thesaurus record 300055983","url":"http://vocab.getty.edu/page/aat/300055983"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines liturgy as: Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391479","kind":"concept","label":"dian jing","sources":[{"id":"getty-aat.300391479","title":"Getty Art & Architecture Thesaurus record 300391479","url":"http://vocab.getty.edu/page/aat/300391479"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dian jing as: Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055156","kind":"concept","label":"empathy","sources":[{"id":"getty-aat.300055156","title":"Getty Art & Architecture Thesaurus record 300055156","url":"http://vocab.getty.edu/page/aat/300055156"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines empathy as: The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056180","kind":"concept","label":"grandeur","sources":[{"id":"getty-aat.300056180","title":"Getty Art & Architecture Thesaurus record 300056180","url":"http://vocab.getty.edu/page/aat/300056180"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines grandeur as: The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300069306","kind":"concept","label":"Ideal, the","sources":[{"id":"getty-aat.300069306","title":"Getty Art & Architecture Thesaurus record 300069306","url":"http://vocab.getty.edu/page/aat/300069306"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179281","kind":"concept","label":"imperfection","sources":[{"id":"getty-aat.300179281","title":"Getty Art & Architecture Thesaurus record 300179281","url":"http://vocab.getty.edu/page/aat/300179281"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines imperfection as: The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055826","kind":"concept","label":"mimesis","sources":[{"id":"getty-aat.300055826","title":"Getty Art & Architecture Thesaurus record 300055826","url":"http://vocab.getty.edu/page/aat/300055826"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines mimesis as: Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179426","kind":"concept","label":"perfection","sources":[{"id":"getty-aat.300179426","title":"Getty Art & Architecture Thesaurus record 300179426","url":"http://vocab.getty.edu/page/aat/300179426"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines perfection as: The state, quality, or condition of being accurate, complete, without defect and/or delightful.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055829","kind":"concept","label":"Picturesque, the","sources":[{"id":"getty-aat.300055829","title":"Getty Art & Architecture Thesaurus record 300055829","url":"http://vocab.getty.edu/page/aat/300055829"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Picturesque, the as: Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179462","kind":"concept","label":"quality","sources":[{"id":"getty-aat.300179462","title":"Getty Art & Architecture Thesaurus record 300179462","url":"http://vocab.getty.edu/page/aat/300179462"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines quality as: Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310718","kind":"concept","label":"sabi","sources":[{"id":"getty-aat.300310718","title":"Getty Art & Architecture Thesaurus record 300310718","url":"http://vocab.getty.edu/page/aat/300310718"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sabi as: Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056183","kind":"concept","label":"significant form","sources":[{"id":"getty-aat.300056183","title":"Getty Art & Architecture Thesaurus record 300056183","url":"http://vocab.getty.edu/page/aat/300056183"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines significant form as: Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055837","kind":"concept","label":"Sublime, the","sources":[{"id":"getty-aat.300055837","title":"Getty Art & Architecture Thesaurus record 300055837","url":"http://vocab.getty.edu/page/aat/300055837"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sublime, the as: The conception or expression of awe-inspiring grandeur in a work of art.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055845","kind":"concept","label":"ugliness","sources":[{"id":"getty-aat.300055845","title":"Getty Art & Architecture Thesaurus record 300055845","url":"http://vocab.getty.edu/page/aat/300055845"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ugliness as: That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310717","kind":"concept","label":"wabi","sources":[{"id":"getty-aat.300310717","title":"Getty Art & Architecture Thesaurus record 300310717","url":"http://vocab.getty.edu/page/aat/300310717"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines wabi as: An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300055944","kind":"field","label":"social ethics","sources":[{"id":"getty-aat.300055944","title":"Getty Art & Architecture Thesaurus record 300055944","url":"http://vocab.getty.edu/page/aat/300055944"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines social ethics as: Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412141","kind":"concept","label":"bad luck","sources":[{"id":"getty-aat.300412141","title":"Getty Art & Architecture Thesaurus record 300412141","url":"http://vocab.getty.edu/page/aat/300412141"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bad luck as: A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412140","kind":"concept","label":"good luck","sources":[{"id":"getty-aat.300412140","title":"Getty Art & Architecture Thesaurus record 300412140","url":"http://vocab.getty.edu/page/aat/300412140"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines good luck as: A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300247349","kind":"concept","label":"chaos","sources":[{"id":"getty-aat.300247349","title":"Getty Art & Architecture Thesaurus record 300247349","url":"http://vocab.getty.edu/page/aat/300247349"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines chaos as: The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055946","kind":"concept","label":"dialectic","sources":[{"id":"getty-aat.300055946","title":"Getty Art & Architecture Thesaurus record 300055946","url":"http://vocab.getty.edu/page/aat/300055946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dialectic as: Originally in ancient Greece, a form of logical argumentation proceeding by question and answer. In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300257052","kind":"concept","label":"identity","sources":[{"id":"getty-aat.300257052","title":"Getty Art & Architecture Thesaurus record 300257052","url":"http://vocab.getty.edu/page/aat/300257052"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines identity as: Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265781","kind":"concept","label":"presence","sources":[{"id":"getty-aat.300265781","title":"Getty Art & Architecture Thesaurus record 300265781","url":"http://vocab.getty.edu/page/aat/300265781"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines presence as: Concept regarding the condition of being present in front of, or in the same place with a person or thing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055947","kind":"concept","label":"supernatural","sources":[{"id":"getty-aat.300055947","title":"Getty Art & Architecture Thesaurus record 300055947","url":"http://vocab.getty.edu/page/aat/300055947"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines supernatural as: Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404625","kind":"concept","label":"absurdism","sources":[{"id":"getty-aat.300404625","title":"Getty Art & Architecture Thesaurus record 300404625","url":"http://vocab.getty.edu/page/aat/300404625"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines absurdism as: A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055956","kind":"concept","label":"anthropomorphism","sources":[{"id":"getty-aat.300055956","title":"Getty Art & Architecture Thesaurus record 300055956","url":"http://vocab.getty.edu/page/aat/300055956"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropomorphism as: Interpretation of what is not human in terms of human characteristics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055957","kind":"concept","label":"Aristotelianism","sources":[{"id":"getty-aat.300055957","title":"Getty Art & Architecture Thesaurus record 300055957","url":"http://vocab.getty.edu/page/aat/300055957"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Aristotelianism as: Philosophy incorporating essential features of the thinking of Aristotle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264368","kind":"concept","label":"Augustinianism","sources":[{"id":"getty-aat.300264368","title":"Getty Art & Architecture Thesaurus record 300264368","url":"http://vocab.getty.edu/page/aat/300264368"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Augustinianism as: Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern. Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055959","kind":"concept","label":"determinism","sources":[{"id":"getty-aat.300055959","title":"Getty Art & Architecture Thesaurus record 300055959","url":"http://vocab.getty.edu/page/aat/300055959"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines determinism as: Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056261","kind":"concept","label":"dualism","sources":[{"id":"getty-aat.300056261","title":"Getty Art & Architecture Thesaurus record 300056261","url":"http://vocab.getty.edu/page/aat/300056261"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dualism as: Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300190210","kind":"concept","label":"globalism","sources":[{"id":"getty-aat.300190210","title":"Getty Art & Architecture Thesaurus record 300190210","url":"http://vocab.getty.edu/page/aat/300190210"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines globalism as: The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300178907","kind":"concept","label":"holism","sources":[{"id":"getty-aat.300178907","title":"Getty Art & Architecture Thesaurus record 300178907","url":"http://vocab.getty.edu/page/aat/300178907"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines holism as: Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055966","kind":"concept","label":"individualism","sources":[{"id":"getty-aat.300055966","title":"Getty Art & Architecture Thesaurus record 300055966","url":"http://vocab.getty.edu/page/aat/300055966"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines individualism as: The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300070431","kind":"concept","label":"nihilism","sources":[{"id":"getty-aat.300070431","title":"Getty Art & Architecture Thesaurus record 300070431","url":"http://vocab.getty.edu/page/aat/300070431"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nihilism as: Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300070544","kind":"concept","label":"nominalism","sources":[{"id":"getty-aat.300070544","title":"Getty Art & Architecture Thesaurus record 300070544","url":"http://vocab.getty.edu/page/aat/300070544"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nominalism as: Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055969","kind":"concept","label":"Platonism","sources":[{"id":"getty-aat.300055969","title":"Getty Art & Architecture Thesaurus record 300055969","url":"http://vocab.getty.edu/page/aat/300055969"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Platonism as: Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300233660","kind":"concept","label":"pluralism","sources":[{"id":"getty-aat.300233660","title":"Getty Art & Architecture Thesaurus record 300233660","url":"http://vocab.getty.edu/page/aat/300233660"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pluralism as: Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055971","kind":"concept","label":"positivism","sources":[{"id":"getty-aat.300055971","title":"Getty Art & Architecture Thesaurus record 300055971","url":"http://vocab.getty.edu/page/aat/300055971"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines positivism as: The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055972","kind":"concept","label":"pragmatism","sources":[{"id":"getty-aat.300055972","title":"Getty Art & Architecture Thesaurus record 300055972","url":"http://vocab.getty.edu/page/aat/300055972"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pragmatism as: Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265479","kind":"concept","label":"rasquachismo","sources":[{"id":"getty-aat.300265479","title":"Getty Art & Architecture Thesaurus record 300265479","url":"http://vocab.getty.edu/page/aat/300265479"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rasquachismo as: Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055974","kind":"concept","label":"scholasticism","sources":[{"id":"getty-aat.300055974","title":"Getty Art & Architecture Thesaurus record 300055974","url":"http://vocab.getty.edu/page/aat/300055974"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines scholasticism as: The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055977","kind":"concept","label":"stoicism","sources":[{"id":"getty-aat.300055977","title":"Getty Art & Architecture Thesaurus record 300055977","url":"http://vocab.getty.edu/page/aat/300055977"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines stoicism as: A philosophical movement that flourished in Greek and Roman antiquity. Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300060368","kind":"concept","label":"syncretism","sources":[{"id":"getty-aat.300060368","title":"Getty Art & Architecture Thesaurus record 300060368","url":"http://vocab.getty.edu/page/aat/300060368"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055978","kind":"concept","label":"transcendentalism","sources":[{"id":"getty-aat.300055978","title":"Getty Art & Architecture Thesaurus record 300055978","url":"http://vocab.getty.edu/page/aat/300055978"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines transcendentalism as: A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055979","kind":"concept","label":"utilitarianism","sources":[{"id":"getty-aat.300055979","title":"Getty Art & Architecture Thesaurus record 300055979","url":"http://vocab.getty.edu/page/aat/300055979"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines utilitarianism as: Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300255715","kind":"field","label":"choreography","sources":[{"id":"getty-aat.300255715","title":"Getty Art & Architecture Thesaurus record 300255715","url":"http://vocab.getty.edu/page/aat/300255715"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines choreography as: The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300417579","kind":"field","label":"music theory","sources":[{"id":"getty-aat.300417579","title":"Getty Art & Architecture Thesaurus record 300417579","url":"http://vocab.getty.edu/page/aat/300417579"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music theory as: Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417580","kind":"concept","label":"vocal arts","sources":[{"id":"getty-aat.300417580","title":"Getty Art & Architecture Thesaurus record 300417580","url":"http://vocab.getty.edu/page/aat/300417580"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vocal arts as: Discipline involving the study of singing and other vocal expressions, including performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403979","kind":"concept","label":"dramaturgy","sources":[{"id":"getty-aat.300403979","title":"Getty Art & Architecture Thesaurus record 300403979","url":"http://vocab.getty.edu/page/aat/300403979"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dramaturgy as: Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300393171","kind":"concept","label":"computer music","sources":[{"id":"getty-aat.300393171","title":"Getty Art & Architecture Thesaurus record 300393171","url":"http://vocab.getty.edu/page/aat/300393171"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines computer music as: Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266783","kind":"concept","label":"granular synthesis","sources":[{"id":"getty-aat.300266783","title":"Getty Art & Architecture Thesaurus record 300266783","url":"http://vocab.getty.edu/page/aat/300266783"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines granular synthesis as: A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266052","kind":"concept","label":"musique concrète","sources":[{"id":"getty-aat.300266052","title":"Getty Art & Architecture Thesaurus record 300266052","url":"http://vocab.getty.edu/page/aat/300266052"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musique concrète as: Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451673","kind":"concept","label":"Noh","sources":[{"id":"getty-aat.300451673","title":"Getty Art & Architecture Thesaurus record 300451673","url":"http://vocab.getty.edu/page/aat/300451673"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Noh as: Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266055","kind":"concept","label":"twelve-tone music","sources":[{"id":"getty-aat.300266055","title":"Getty Art & Architecture Thesaurus record 300266055","url":"http://vocab.getty.edu/page/aat/300266055"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines twelve-tone music as: A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300080402","kind":"field","label":"architectural criticism","sources":[{"id":"getty-aat.300080402","title":"Getty Art & Architecture Thesaurus record 300080402","url":"http://vocab.getty.edu/page/aat/300080402"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural criticism as: The study or practice of the analytical description, interpretation, and evaluation of architectural works.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054162","kind":"field","label":"architectural history","sources":[{"id":"getty-aat.300054162","title":"Getty Art & Architecture Thesaurus record 300054162","url":"http://vocab.getty.edu/page/aat/300054162"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural history as: Study of the development over time of the human built environment.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300168233","kind":"field","label":"art criticism","sources":[{"id":"getty-aat.300168233","title":"Getty Art & Architecture Thesaurus record 300168233","url":"http://vocab.getty.edu/page/aat/300168233"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art criticism as: The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054233","kind":"field","label":"art history","sources":[{"id":"getty-aat.300054233","title":"Getty Art & Architecture Thesaurus record 300054233","url":"http://vocab.getty.edu/page/aat/300054233"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art history as: Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054236","kind":"concept","label":"art therapy","sources":[{"id":"getty-aat.300054236","title":"Getty Art & Architecture Thesaurus record 300054236","url":"http://vocab.getty.edu/page/aat/300054236"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art therapy as: Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054240","kind":"field","label":"musicology","sources":[{"id":"getty-aat.300054240","title":"Getty Art & Architecture Thesaurus record 300054240","url":"http://vocab.getty.edu/page/aat/300054240"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054247","kind":"field","label":"applied linguistics","sources":[{"id":"getty-aat.300054247","title":"Getty Art & Architecture Thesaurus record 300054247","url":"http://vocab.getty.edu/page/aat/300054247"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines applied linguistics as: Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054256","kind":"field","label":"theoretical linguistics","sources":[{"id":"getty-aat.300054256","title":"Getty Art & Architecture Thesaurus record 300054256","url":"http://vocab.getty.edu/page/aat/300054256"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300389758","kind":"field","label":"cryptography","sources":[{"id":"getty-aat.300389758","title":"Getty Art & Architecture Thesaurus record 300389758","url":"http://vocab.getty.edu/page/aat/300389758"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300389757","kind":"field","label":"cryptology","sources":[{"id":"getty-aat.300389757","title":"Getty Art & Architecture Thesaurus record 300389757","url":"http://vocab.getty.edu/page/aat/300389757"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cryptology as: The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300112920","kind":"field","label":"etymology","sources":[{"id":"getty-aat.300112920","title":"Getty Art & Architecture Thesaurus record 300112920","url":"http://vocab.getty.edu/page/aat/300112920"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines etymology as: Study of the history of a particular word or element of a word, or of historical linguistic change.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054254","kind":"field","label":"semiotics","sources":[{"id":"getty-aat.300054254","title":"Getty Art & Architecture Thesaurus record 300054254","url":"http://vocab.getty.edu/page/aat/300054254"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054296","kind":"field","label":"process philosophy","sources":[{"id":"getty-aat.300054296","title":"Getty Art & Architecture Thesaurus record 300054296","url":"http://vocab.getty.edu/page/aat/300054296"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines process philosophy as: Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300157724","kind":"concept","label":"anthropology of religion","sources":[{"id":"getty-aat.300157724","title":"Getty Art & Architecture Thesaurus record 300157724","url":"http://vocab.getty.edu/page/aat/300157724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropology of religion as: Study of religion using the methods and theories of anthropology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054302","kind":"concept","label":"comparative religion","sources":[{"id":"getty-aat.300054302","title":"Getty Art & Architecture Thesaurus record 300054302","url":"http://vocab.getty.edu/page/aat/300054302"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines comparative religion as: Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054303","kind":"concept","label":"philosophy of religion","sources":[{"id":"getty-aat.300054303","title":"Getty Art & Architecture Thesaurus record 300054303","url":"http://vocab.getty.edu/page/aat/300054303"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophy of religion as: The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054304","kind":"concept","label":"psychology of religion","sources":[{"id":"getty-aat.300054304","title":"Getty Art & Architecture Thesaurus record 300054304","url":"http://vocab.getty.edu/page/aat/300054304"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines psychology of religion as: Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054305","kind":"concept","label":"sociology of religion","sources":[{"id":"getty-aat.300054305","title":"Getty Art & Architecture Thesaurus record 300054305","url":"http://vocab.getty.edu/page/aat/300054305"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sociology of religion as: Study of religion using the sociological method of approach.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054307","kind":"field","label":"biblical studies","sources":[{"id":"getty-aat.300054307","title":"Getty Art & Architecture Thesaurus record 300054307","url":"http://vocab.getty.edu/page/aat/300054307"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines biblical studies as: Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054308","kind":"field","label":"church history","sources":[{"id":"getty-aat.300054308","title":"Getty Art & Architecture Thesaurus record 300054308","url":"http://vocab.getty.edu/page/aat/300054308"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines church history as: Study of the history of the Christian Church and its sects and branches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054310","kind":"field","label":"ecclesiology","sources":[{"id":"getty-aat.300054310","title":"Getty Art & Architecture Thesaurus record 300054310","url":"http://vocab.getty.edu/page/aat/300054310"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ecclesiology as: Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054311","kind":"field","label":"eschatology","sources":[{"id":"getty-aat.300054311","title":"Getty Art & Architecture Thesaurus record 300054311","url":"http://vocab.getty.edu/page/aat/300054311"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines eschatology as: The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054312","kind":"field","label":"religious ethics","sources":[{"id":"getty-aat.300054312","title":"Getty Art & Architecture Thesaurus record 300054312","url":"http://vocab.getty.edu/page/aat/300054312"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious ethics as: Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054309","kind":"field","label":"religious history","sources":[{"id":"getty-aat.300054309","title":"Getty Art & Architecture Thesaurus record 300054309","url":"http://vocab.getty.edu/page/aat/300054309"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious history as: Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391196","kind":"concept","label":"arhats","sources":[{"id":"getty-aat.300391196","title":"Getty Art & Architecture Thesaurus record 300391196","url":"http://vocab.getty.edu/page/aat/300391196"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arhats as: Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264338","kind":"concept","label":"bardo","sources":[{"id":"getty-aat.300264338","title":"Getty Art & Architecture Thesaurus record 300264338","url":"http://vocab.getty.edu/page/aat/300264338"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bardo as: In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386039","kind":"concept","label":"bhūmi","sources":[{"id":"getty-aat.300386039","title":"Getty Art & Architecture Thesaurus record 300386039","url":"http://vocab.getty.edu/page/aat/300386039"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bhūmi as: The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404619","kind":"concept","label":"buddha field","sources":[{"id":"getty-aat.300404619","title":"Getty Art & Architecture Thesaurus record 300404619","url":"http://vocab.getty.edu/page/aat/300404619"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines buddha field as: In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264384","kind":"concept","label":"dharma","sources":[{"id":"getty-aat.300264384","title":"Getty Art & Architecture Thesaurus record 300264384","url":"http://vocab.getty.edu/page/aat/300264384"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dharma as: Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438552","kind":"concept","label":"dhyana","sources":[{"id":"getty-aat.300438552","title":"Getty Art & Architecture Thesaurus record 300438552","url":"http://vocab.getty.edu/page/aat/300438552"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dhyana as: In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404702","kind":"concept","label":"karma","sources":[{"id":"getty-aat.300404702","title":"Getty Art & Architecture Thesaurus record 300404702","url":"http://vocab.getty.edu/page/aat/300404702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines karma as: The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310716","kind":"concept","label":"mappō","sources":[{"id":"getty-aat.300310716","title":"Getty Art & Architecture Thesaurus record 300310716","url":"http://vocab.getty.edu/page/aat/300310716"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines mappō as: The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264486","kind":"concept","label":"nirvana","sources":[{"id":"getty-aat.300264486","title":"Getty Art & Architecture Thesaurus record 300264486","url":"http://vocab.getty.edu/page/aat/300264486"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nirvana as: Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404618","kind":"concept","label":"pure land","sources":[{"id":"getty-aat.300404618","title":"Getty Art & Architecture Thesaurus record 300404618","url":"http://vocab.getty.edu/page/aat/300404618"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pure land as: In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310095","kind":"concept","label":"satori","sources":[{"id":"getty-aat.300310095","title":"Getty Art & Architecture Thesaurus record 300310095","url":"http://vocab.getty.edu/page/aat/300310095"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines satori as: In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404712","kind":"concept","label":"uṣṇīsạ","sources":[{"id":"getty-aat.300404712","title":"Getty Art & Architecture Thesaurus record 300404712","url":"http://vocab.getty.edu/page/aat/300404712"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines uṣṇīsạ as: Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264482","kind":"concept","label":"consubstantiation","sources":[{"id":"getty-aat.300264482","title":"Getty Art & Architecture Thesaurus record 300264482","url":"http://vocab.getty.edu/page/aat/300264482"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines consubstantiation as: The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300066049","kind":"concept","label":"immaculate conception","sources":[{"id":"getty-aat.300066049","title":"Getty Art & Architecture Thesaurus record 300066049","url":"http://vocab.getty.edu/page/aat/300066049"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines immaculate conception as: The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300065709","kind":"concept","label":"stigmatization","sources":[{"id":"getty-aat.300065709","title":"Getty Art & Architecture Thesaurus record 300065709","url":"http://vocab.getty.edu/page/aat/300065709"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines stigmatization as: The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264336","kind":"concept","label":"avatara","sources":[{"id":"getty-aat.300264336","title":"Getty Art & Architecture Thesaurus record 300264336","url":"http://vocab.getty.edu/page/aat/300264336"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines avatara as: Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264356","kind":"concept","label":"bhakti","sources":[{"id":"getty-aat.300264356","title":"Getty Art & Architecture Thesaurus record 300264356","url":"http://vocab.getty.edu/page/aat/300264356"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bhakti as: In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264385","kind":"concept","label":"moksha","sources":[{"id":"getty-aat.300264385","title":"Getty Art & Architecture Thesaurus record 300264385","url":"http://vocab.getty.edu/page/aat/300264385"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines moksha as: In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300447407","kind":"concept","label":"pañcadēvōpāsanā","sources":[{"id":"getty-aat.300447407","title":"Getty Art & Architecture Thesaurus record 300447407","url":"http://vocab.getty.edu/page/aat/300447407"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pañcadēvōpāsanā as: Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264365","kind":"concept","label":"samsara","sources":[{"id":"getty-aat.300264365","title":"Getty Art & Architecture Thesaurus record 300264365","url":"http://vocab.getty.edu/page/aat/300264365"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines samsara as: The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264386","kind":"concept","label":"trimurti","sources":[{"id":"getty-aat.300264386","title":"Getty Art & Architecture Thesaurus record 300264386","url":"http://vocab.getty.edu/page/aat/300264386"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines trimurti as: Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264305","kind":"concept","label":"ahimsa","sources":[{"id":"getty-aat.300264305","title":"Getty Art & Architecture Thesaurus record 300264305","url":"http://vocab.getty.edu/page/aat/300264305"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ahimsa as: Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300446915","kind":"concept","label":"cāraṇa","sources":[{"id":"getty-aat.300446915","title":"Getty Art & Architecture Thesaurus record 300446915","url":"http://vocab.getty.edu/page/aat/300446915"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cāraṇa as: In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300237780","kind":"concept","label":"image quality","sources":[{"id":"getty-aat.300237780","title":"Getty Art & Architecture Thesaurus record 300237780","url":"http://vocab.getty.edu/page/aat/300237780"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines image quality as: Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264475","kind":"concept","label":"group identity","sources":[{"id":"getty-aat.300264475","title":"Getty Art & Architecture Thesaurus record 300264475","url":"http://vocab.getty.edu/page/aat/300264475"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines group identity as: An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055970","kind":"concept","label":"Neo-Platonism","sources":[{"id":"getty-aat.300055970","title":"Getty Art & Architecture Thesaurus record 300055970","url":"http://vocab.getty.edu/page/aat/300055970"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neo-Platonism as: Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444342","kind":"concept","label":"amalgam style","sources":[{"id":"getty-aat.300444342","title":"Getty Art & Architecture Thesaurus record 300444342","url":"http://vocab.getty.edu/page/aat/300444342"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines amalgam style as: Style that combines recognizable elements of two or more defined styles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106711","kind":"concept","label":"ancient","sources":[{"id":"getty-aat.300106711","title":"Getty Art & Architecture Thesaurus record 300106711","url":"http://vocab.getty.edu/page/aat/300106711"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ancient as: In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404836","kind":"concept","label":"Archaeological Style","sources":[{"id":"getty-aat.300404836","title":"Getty Art & Architecture Thesaurus record 300404836","url":"http://vocab.getty.edu/page/aat/300404836"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Archaeological Style as: Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391250","kind":"concept","label":"geologic time scale","sources":[{"id":"getty-aat.300391250","title":"Getty Art & Architecture Thesaurus record 300391250","url":"http://vocab.getty.edu/page/aat/300391250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines geologic time scale as: An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300443463","kind":"concept","label":"Late Glacial","sources":[{"id":"getty-aat.300443463","title":"Getty Art & Architecture Thesaurus record 300443463","url":"http://vocab.getty.edu/page/aat/300443463"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Glacial as: Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444999","kind":"concept","label":"Post-Colonial","sources":[{"id":"getty-aat.300444999","title":"Getty Art & Architecture Thesaurus record 300444999","url":"http://vocab.getty.edu/page/aat/300444999"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Post-Colonial as: Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019257","kind":"concept","label":"prehistoric","sources":[{"id":"getty-aat.300019257","title":"Getty Art & Architecture Thesaurus record 300019257","url":"http://vocab.getty.edu/page/aat/300019257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric as: Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019280","kind":"concept","label":"protohistoric","sources":[{"id":"getty-aat.300019280","title":"Getty Art & Architecture Thesaurus record 300019280","url":"http://vocab.getty.edu/page/aat/300019280"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines protohistoric as: Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106723","kind":"concept","label":"three-age system","sources":[{"id":"getty-aat.300106723","title":"Getty Art & Architecture Thesaurus record 300106723","url":"http://vocab.getty.edu/page/aat/300106723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines three-age system as: Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300385955","kind":"concept","label":"Antarctic","sources":[{"id":"getty-aat.300385955","title":"Getty Art & Architecture Thesaurus record 300385955","url":"http://vocab.getty.edu/page/aat/300385955"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Antarctic as: Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018279","kind":"concept","label":"Asian","sources":[{"id":"getty-aat.300018279","title":"Getty Art & Architecture Thesaurus record 300018279","url":"http://vocab.getty.edu/page/aat/300018279"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Asian as: Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019255","kind":"concept","label":"Early Western World","sources":[{"id":"getty-aat.300019255","title":"Getty Art & Architecture Thesaurus record 300019255","url":"http://vocab.getty.edu/page/aat/300019255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Western World as: Refers to a style region encompassing the Mediterranean and the Occident.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300020656","kind":"concept","label":"European","sources":[{"id":"getty-aat.300020656","title":"Getty Art & Architecture Thesaurus record 300020656","url":"http://vocab.getty.edu/page/aat/300020656"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines European as: Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444301","kind":"concept","label":"Global","sources":[{"id":"getty-aat.300444301","title":"Getty Art & Architecture Thesaurus record 300444301","url":"http://vocab.getty.edu/page/aat/300444301"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Global as: Styles, periods, and cultures that cross boundaries of multiple nations and regions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021516","kind":"concept","label":"Islamic World, The","sources":[{"id":"getty-aat.300021516","title":"Getty Art & Architecture Thesaurus record 300021516","url":"http://vocab.getty.edu/page/aat/300021516"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Islamic World, The as: Refers to a style region encompassing the regions where Islam is prevalent.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266481","kind":"concept","label":"Middle Eastern","sources":[{"id":"getty-aat.300266481","title":"Getty Art & Architecture Thesaurus record 300266481","url":"http://vocab.getty.edu/page/aat/300266481"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Eastern as: Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021854","kind":"concept","label":"Oceanic","sources":[{"id":"getty-aat.300021854","title":"Getty Art & Architecture Thesaurus record 300021854","url":"http://vocab.getty.edu/page/aat/300021854"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic as: Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016617","kind":"concept","label":"The Americas","sources":[{"id":"getty-aat.300016617","title":"Getty Art & Architecture Thesaurus record 300016617","url":"http://vocab.getty.edu/page/aat/300016617"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444354","kind":"concept","label":"bungalow style","sources":[{"id":"getty-aat.300444354","title":"Getty Art & Architecture Thesaurus record 300444354","url":"http://vocab.getty.edu/page/aat/300444354"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bungalow style as: Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444901","kind":"concept","label":"military style","sources":[{"id":"getty-aat.300444901","title":"Getty Art & Architecture Thesaurus record 300444901","url":"http://vocab.getty.edu/page/aat/300444901"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines military style as: Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312275","kind":"concept","label":"old-fashioned","sources":[{"id":"getty-aat.300312275","title":"Getty Art & Architecture Thesaurus record 300312275","url":"http://vocab.getty.edu/page/aat/300312275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines old-fashioned as: A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310544","kind":"concept","label":"period style","sources":[{"id":"getty-aat.300310544","title":"Getty Art & Architecture Thesaurus record 300310544","url":"http://vocab.getty.edu/page/aat/300310544"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines period style as: Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444311","kind":"concept","label":"plantation house style","sources":[{"id":"getty-aat.300444311","title":"Getty Art & Architecture Thesaurus record 300444311","url":"http://vocab.getty.edu/page/aat/300444311"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines plantation house style as: Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391392","kind":"concept","label":"pre-colonial","sources":[{"id":"getty-aat.300391392","title":"Getty Art & Architecture Thesaurus record 300391392","url":"http://vocab.getty.edu/page/aat/300391392"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pre-colonial as: General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444345","kind":"concept","label":"ranch style","sources":[{"id":"getty-aat.300444345","title":"Getty Art & Architecture Thesaurus record 300444345","url":"http://vocab.getty.edu/page/aat/300444345"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ranch style as: Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310539","kind":"concept","label":"shabby chic","sources":[{"id":"getty-aat.300310539","title":"Getty Art & Architecture Thesaurus record 300310539","url":"http://vocab.getty.edu/page/aat/300310539"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines shabby chic as: A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300311925","kind":"concept","label":"plastic arts","sources":[{"id":"getty-aat.300311925","title":"Getty Art & Architecture Thesaurus record 300311925","url":"http://vocab.getty.edu/page/aat/300311925"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines plastic arts as: In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300379540","kind":"field","label":"technical art history","sources":[{"id":"getty-aat.300379540","title":"Getty Art & Architecture Thesaurus record 300379540","url":"http://vocab.getty.edu/page/aat/300379540"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines technical art history as: Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300343751","kind":"concept","label":"automotive design","sources":[{"id":"getty-aat.300343751","title":"Getty Art & Architecture Thesaurus record 300343751","url":"http://vocab.getty.edu/page/aat/300343751"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines automotive design as: Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457792","kind":"concept","label":"communication design","sources":[{"id":"getty-aat.300457792","title":"Getty Art & Architecture Thesaurus record 300457792","url":"http://vocab.getty.edu/page/aat/300457792"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines communication design as: Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300163423","kind":"concept","label":"costume design","sources":[{"id":"getty-aat.300163423","title":"Getty Art & Architecture Thesaurus record 300163423","url":"http://vocab.getty.edu/page/aat/300163423"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines costume design as: Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300138708","kind":"concept","label":"fashion design","sources":[{"id":"getty-aat.300138708","title":"Getty Art & Architecture Thesaurus record 300138708","url":"http://vocab.getty.edu/page/aat/300138708"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fashion design as: Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\" For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435227","kind":"concept","label":"furniture design","sources":[{"id":"getty-aat.300435227","title":"Getty Art & Architecture Thesaurus record 300435227","url":"http://vocab.getty.edu/page/aat/300435227"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines furniture design as: Practice and discipline of designing furniture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417661","kind":"concept","label":"garden design","sources":[{"id":"getty-aat.300417661","title":"Getty Art & Architecture Thesaurus record 300417661","url":"http://vocab.getty.edu/page/aat/300417661"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines garden design as: Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054181","kind":"concept","label":"graphic design","sources":[{"id":"getty-aat.300054181","title":"Getty Art & Architecture Thesaurus record 300054181","url":"http://vocab.getty.edu/page/aat/300054181"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054183","kind":"concept","label":"industrial design","sources":[{"id":"getty-aat.300054183","title":"Getty Art & Architecture Thesaurus record 300054183","url":"http://vocab.getty.edu/page/aat/300054183"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines industrial design as: The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300161596","kind":"concept","label":"interior decoration","sources":[{"id":"getty-aat.300161596","title":"Getty Art & Architecture Thesaurus record 300161596","url":"http://vocab.getty.edu/page/aat/300161596"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines interior decoration as: The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054184","kind":"concept","label":"interior design","sources":[{"id":"getty-aat.300054184","title":"Getty Art & Architecture Thesaurus record 300054184","url":"http://vocab.getty.edu/page/aat/300054184"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines interior design as: Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435123","kind":"concept","label":"jewelry design","sources":[{"id":"getty-aat.300435123","title":"Getty Art & Architecture Thesaurus record 300435123","url":"http://vocab.getty.edu/page/aat/300435123"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines jewelry design as: Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300260338","kind":"concept","label":"paper engineering","sources":[{"id":"getty-aat.300260338","title":"Getty Art & Architecture Thesaurus record 300260338","url":"http://vocab.getty.edu/page/aat/300260338"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paper engineering as: Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300069390","kind":"concept","label":"participatory design","sources":[{"id":"getty-aat.300069390","title":"Getty Art & Architecture Thesaurus record 300069390","url":"http://vocab.getty.edu/page/aat/300069390"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines participatory design as: Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435128","kind":"concept","label":"set design","sources":[{"id":"getty-aat.300435128","title":"Getty Art & Architecture Thesaurus record 300435128","url":"http://vocab.getty.edu/page/aat/300435128"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines set design as: The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435243","kind":"concept","label":"textile design","sources":[{"id":"getty-aat.300435243","title":"Getty Art & Architecture Thesaurus record 300435243","url":"http://vocab.getty.edu/page/aat/300435243"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines textile design as: Practice and discipline of designing textiles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300375660","kind":"concept","label":"Web design","sources":[{"id":"getty-aat.300375660","title":"Getty Art & Architecture Thesaurus record 300375660","url":"http://vocab.getty.edu/page/aat/300375660"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Web design as: Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054241","kind":"field","label":"ethnomusicology","sources":[{"id":"getty-aat.300054241","title":"Getty Art & Architecture Thesaurus record 300054241","url":"http://vocab.getty.edu/page/aat/300054241"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ethnomusicology as: Branch of musicology focusing on the study of music in its cultural context.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300205021","kind":"field","label":"organology","sources":[{"id":"getty-aat.300205021","title":"Getty Art & Architecture Thesaurus record 300205021","url":"http://vocab.getty.edu/page/aat/300205021"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines organology as: Descriptive and analytical study of musical instruments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300435151","kind":"field","label":"architectural photography","sources":[{"id":"getty-aat.300435151","title":"Getty Art & Architecture Thesaurus record 300435151","url":"http://vocab.getty.edu/page/aat/300435151"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural photography as: Specialization of photography focused on architecture as subject.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054248","kind":"field","label":"anthropological linguistics","sources":[{"id":"getty-aat.300054248","title":"Getty Art & Architecture Thesaurus record 300054248","url":"http://vocab.getty.edu/page/aat/300054248"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropological linguistics as: Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054250","kind":"field","label":"computational linguistics","sources":[{"id":"getty-aat.300054250","title":"Getty Art & Architecture Thesaurus record 300054250","url":"http://vocab.getty.edu/page/aat/300054250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines computational linguistics as: Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054255","kind":"field","label":"sociolinguistics","sources":[{"id":"getty-aat.300054255","title":"Getty Art & Architecture Thesaurus record 300054255","url":"http://vocab.getty.edu/page/aat/300054255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054251","kind":"field","label":"graphemics","sources":[{"id":"getty-aat.300054251","title":"Getty Art & Architecture Thesaurus record 300054251","url":"http://vocab.getty.edu/page/aat/300054251"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines graphemics as: Study of writing systems and of their relation to speech.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054257","kind":"field","label":"historical linguistics","sources":[{"id":"getty-aat.300054257","title":"Getty Art & Architecture Thesaurus record 300054257","url":"http://vocab.getty.edu/page/aat/300054257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines historical linguistics as: Study of the development of or changes in words, speech, and language or groups of languages over time.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054258","kind":"field","label":"metalinguistics","sources":[{"id":"getty-aat.300054258","title":"Getty Art & Architecture Thesaurus record 300054258","url":"http://vocab.getty.edu/page/aat/300054258"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines metalinguistics as: Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054262","kind":"field","label":"phonetics","sources":[{"id":"getty-aat.300054262","title":"Getty Art & Architecture Thesaurus record 300054262","url":"http://vocab.getty.edu/page/aat/300054262"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phonetics as: Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054263","kind":"field","label":"phonology","sources":[{"id":"getty-aat.300054263","title":"Getty Art & Architecture Thesaurus record 300054263","url":"http://vocab.getty.edu/page/aat/300054263"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054264","kind":"field","label":"pragmatics","sources":[{"id":"getty-aat.300054264","title":"Getty Art & Architecture Thesaurus record 300054264","url":"http://vocab.getty.edu/page/aat/300054264"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054268","kind":"field","label":"semantics","sources":[{"id":"getty-aat.300054268","title":"Getty Art & Architecture Thesaurus record 300054268","url":"http://vocab.getty.edu/page/aat/300054268"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines semantics as: Study of meanings in language and of changes in those meanings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054272","kind":"concept","label":"toponymy","sources":[{"id":"getty-aat.300054272","title":"Getty Art & Architecture Thesaurus record 300054272","url":"http://vocab.getty.edu/page/aat/300054272"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines toponymy as: Etymological study of the place-names of a region or language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404706","kind":"concept","label":"parinirvāṇa","sources":[{"id":"getty-aat.300404706","title":"Getty Art & Architecture Thesaurus record 300404706","url":"http://vocab.getty.edu/page/aat/300404706"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines parinirvāṇa as: In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106724","kind":"concept","label":"Stone Age","sources":[{"id":"getty-aat.300106724","title":"Getty Art & Architecture Thesaurus record 300106724","url":"http://vocab.getty.edu/page/aat/300106724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Stone Age as: Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106747","kind":"concept","label":"transitional periods Stone Age to Bronze Age","sources":[{"id":"getty-aat.300106747","title":"Getty Art & Architecture Thesaurus record 300106747","url":"http://vocab.getty.edu/page/aat/300106747"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines transitional periods Stone Age to Bronze Age as: Transitional periods related to Stone Age to Bronze Age cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019275","kind":"concept","label":"Bronze Age","sources":[{"id":"getty-aat.300019275","title":"Getty Art & Architecture Thesaurus record 300019275","url":"http://vocab.getty.edu/page/aat/300019275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019279","kind":"concept","label":"Iron Age","sources":[{"id":"getty-aat.300019279","title":"Getty Art & Architecture Thesaurus record 300019279","url":"http://vocab.getty.edu/page/aat/300019279"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Iron Age as: Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements. It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015649","kind":"concept","label":"prehistoric African","sources":[{"id":"getty-aat.300015649","title":"Getty Art & Architecture Thesaurus record 300015649","url":"http://vocab.getty.edu/page/aat/300015649"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric African as: Cultures and styles from the prehistoric era in Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015690","kind":"concept","label":"Ancient African","sources":[{"id":"getty-aat.300015690","title":"Getty Art & Architecture Thesaurus record 300015690","url":"http://vocab.getty.edu/page/aat/300015690"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient African as: Cultures and styles of Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300108565","kind":"concept","label":"Colonial African","sources":[{"id":"getty-aat.300108565","title":"Getty Art & Architecture Thesaurus record 300108565","url":"http://vocab.getty.edu/page/aat/300108565"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Colonial African as: Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262588","kind":"concept","label":"modern African","sources":[{"id":"getty-aat.300262588","title":"Getty Art & Architecture Thesaurus record 300262588","url":"http://vocab.getty.edu/page/aat/300262588"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern African as: Styles and cultures belonging to modern Africa, generally from the 19th century and later.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300108572","kind":"concept","label":"African sculpture styles","sources":[{"id":"getty-aat.300108572","title":"Getty Art & Architecture Thesaurus record 300108572","url":"http://vocab.getty.edu/page/aat/300108572"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African sculpture styles as: Sculpture styles belonging to African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417674","kind":"concept","label":"African diaspora","sources":[{"id":"getty-aat.300417674","title":"Getty Art & Architecture Thesaurus record 300417674","url":"http://vocab.getty.edu/page/aat/300417674"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African diaspora as: Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391434","kind":"concept","label":"Ancient Asian","sources":[{"id":"getty-aat.300391434","title":"Getty Art & Architecture Thesaurus record 300391434","url":"http://vocab.getty.edu/page/aat/300391434"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Asian as: Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300120146","kind":"concept","label":"Southeast Asian","sources":[{"id":"getty-aat.300120146","title":"Getty Art & Architecture Thesaurus record 300120146","url":"http://vocab.getty.edu/page/aat/300120146"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Southeast Asian as: Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300193867","kind":"concept","label":"West Asian","sources":[{"id":"getty-aat.300193867","title":"Getty Art & Architecture Thesaurus record 300193867","url":"http://vocab.getty.edu/page/aat/300193867"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines West Asian as: Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379854","kind":"concept","label":"Ancient European","sources":[{"id":"getty-aat.300379854","title":"Getty Art & Architecture Thesaurus record 300379854","url":"http://vocab.getty.edu/page/aat/300379854"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient European as: Styles, periods, and cultures of ancient Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387753","kind":"concept","label":"Early Netherlandish","sources":[{"id":"getty-aat.300387753","title":"Getty Art & Architecture Thesaurus record 300387753","url":"http://vocab.getty.edu/page/aat/300387753"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Netherlandish as: The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300111149","kind":"concept","label":"European regions","sources":[{"id":"getty-aat.300111149","title":"Getty Art & Architecture Thesaurus record 300111149","url":"http://vocab.getty.edu/page/aat/300111149"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines European regions as: Used to describe styles of the regions of Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386130","kind":"concept","label":"Hellenic","sources":[{"id":"getty-aat.300386130","title":"Getty Art & Architecture Thesaurus record 300386130","url":"http://vocab.getty.edu/page/aat/300386130"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hellenic as: The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300395490","kind":"concept","label":"Holy Roman Imperial","sources":[{"id":"getty-aat.300395490","title":"Getty Art & Architecture Thesaurus record 300395490","url":"http://vocab.getty.edu/page/aat/300395490"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Holy Roman Imperial as: The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403938","kind":"concept","label":"Hutsul","sources":[{"id":"getty-aat.300403938","title":"Getty Art & Architecture Thesaurus record 300403938","url":"http://vocab.getty.edu/page/aat/300403938"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hutsul as: Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444302","kind":"concept","label":"Dutch Colonial Revival","sources":[{"id":"getty-aat.300444302","title":"Getty Art & Architecture Thesaurus record 300444302","url":"http://vocab.getty.edu/page/aat/300444302"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dutch Colonial Revival as: Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444313","kind":"concept","label":"Late Modernism","sources":[{"id":"getty-aat.300444313","title":"Getty Art & Architecture Thesaurus record 300444313","url":"http://vocab.getty.edu/page/aat/300444313"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Modernism as: General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266399","kind":"concept","label":"Neo-Symbolist","sources":[{"id":"getty-aat.300266399","title":"Getty Art & Architecture Thesaurus record 300266399","url":"http://vocab.getty.edu/page/aat/300266399"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neo-Symbolist as: Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266490","kind":"concept","label":"hip-hop","sources":[{"id":"getty-aat.300266490","title":"Getty Art & Architecture Thesaurus record 300266490","url":"http://vocab.getty.edu/page/aat/300266490"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hip-hop as: Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300065758","kind":"concept","label":"Minimal","sources":[{"id":"getty-aat.300065758","title":"Getty Art & Architecture Thesaurus record 300065758","url":"http://vocab.getty.edu/page/aat/300065758"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Minimal as: A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300022208","kind":"concept","label":"Postmodern","sources":[{"id":"getty-aat.300022208","title":"Getty Art & Architecture Thesaurus record 300022208","url":"http://vocab.getty.edu/page/aat/300022208"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Postmodern as: Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266744","kind":"concept","label":"space age","sources":[{"id":"getty-aat.300266744","title":"Getty Art & Architecture Thesaurus record 300266744","url":"http://vocab.getty.edu/page/aat/300266744"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines space age as: Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444321","kind":"concept","label":"Post-1945","sources":[{"id":"getty-aat.300444321","title":"Getty Art & Architecture Thesaurus record 300444321","url":"http://vocab.getty.edu/page/aat/300444321"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Post-1945 as: General term for styles and periods from post-1945.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264429","kind":"concept","label":"pre-Islamic","sources":[{"id":"getty-aat.300264429","title":"Getty Art & Architecture Thesaurus record 300264429","url":"http://vocab.getty.edu/page/aat/300264429"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pre-Islamic as: Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300111241","kind":"concept","label":"Saracenic","sources":[{"id":"getty-aat.300111241","title":"Getty Art & Architecture Thesaurus record 300111241","url":"http://vocab.getty.edu/page/aat/300111241"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Saracenic as: Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444994","kind":"concept","label":"Kingdom of Jerusalem","sources":[{"id":"getty-aat.300444994","title":"Getty Art & Architecture Thesaurus record 300444994","url":"http://vocab.getty.edu/page/aat/300444994"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kingdom of Jerusalem as: Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021861","kind":"concept","label":"Australian","sources":[{"id":"getty-aat.300021861","title":"Getty Art & Architecture Thesaurus record 300021861","url":"http://vocab.getty.edu/page/aat/300021861"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Australian as: Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021867","kind":"concept","label":"Melanesian","sources":[{"id":"getty-aat.300021867","title":"Getty Art & Architecture Thesaurus record 300021867","url":"http://vocab.getty.edu/page/aat/300021867"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Melanesian as: Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021944","kind":"concept","label":"Polynesian","sources":[{"id":"getty-aat.300021944","title":"Getty Art & Architecture Thesaurus record 300021944","url":"http://vocab.getty.edu/page/aat/300021944"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Polynesian as: Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264773","kind":"concept","label":"Oceanic sculpture styles","sources":[{"id":"getty-aat.300264773","title":"Getty Art & Architecture Thesaurus record 300264773","url":"http://vocab.getty.edu/page/aat/300264773"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic sculpture styles as: Sculpture styles belonging to Oceanic cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264775","kind":"concept","label":"Oceanic ceramic styles","sources":[{"id":"getty-aat.300264775","title":"Getty Art & Architecture Thesaurus record 300264775","url":"http://vocab.getty.edu/page/aat/300264775"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic ceramic styles as: Ceramic styles belonging to Oceanic cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438813","kind":"concept","label":"Australasian","sources":[{"id":"getty-aat.300438813","title":"Getty Art & Architecture Thesaurus record 300438813","url":"http://vocab.getty.edu/page/aat/300438813"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Australasian as: The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386138","kind":"concept","label":"Hispanic","sources":[{"id":"getty-aat.300386138","title":"Getty Art & Architecture Thesaurus record 300386138","url":"http://vocab.getty.edu/page/aat/300386138"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hispanic as: Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300107946","kind":"concept","label":"American regions","sources":[{"id":"getty-aat.300107946","title":"Getty Art & Architecture Thesaurus record 300107946","url":"http://vocab.getty.edu/page/aat/300107946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines American regions as: Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300017437","kind":"concept","label":"Native American","sources":[{"id":"getty-aat.300017437","title":"Getty Art & Architecture Thesaurus record 300017437","url":"http://vocab.getty.edu/page/aat/300017437"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Native American as: Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis. For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300080819","kind":"concept","label":"Latin American","sources":[{"id":"getty-aat.300080819","title":"Getty Art & Architecture Thesaurus record 300080819","url":"http://vocab.getty.edu/page/aat/300080819"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Latin American as: In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018115","kind":"concept","label":"modern American","sources":[{"id":"getty-aat.300018115","title":"Getty Art & Architecture Thesaurus record 300018115","url":"http://vocab.getty.edu/page/aat/300018115"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern American as: Styles, periods, cultures, and movements of America in modern times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387114","kind":"concept","label":"Ancient American","sources":[{"id":"getty-aat.300387114","title":"Getty Art & Architecture Thesaurus record 300387114","url":"http://vocab.getty.edu/page/aat/300387114"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient American as: General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457738","kind":"concept","label":"Hispanic-American","sources":[{"id":"getty-aat.300457738","title":"Getty Art & Architecture Thesaurus record 300457738","url":"http://vocab.getty.edu/page/aat/300457738"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hispanic-American as: Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457715","kind":"concept","label":"Pan-American","sources":[{"id":"getty-aat.300457715","title":"Getty Art & Architecture Thesaurus record 300457715","url":"http://vocab.getty.edu/page/aat/300457715"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pan-American as: Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457703","kind":"concept","label":"Ibero-American","sources":[{"id":"getty-aat.300457703","title":"Getty Art & Architecture Thesaurus record 300457703","url":"http://vocab.getty.edu/page/aat/300457703"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ibero-American as: It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300265672","kind":"field","label":"architectonics","sources":[{"id":"getty-aat.300265672","title":"Getty Art & Architecture Thesaurus record 300265672","url":"http://vocab.getty.edu/page/aat/300265672"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectonics as: The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054159","kind":"concept","label":"naval architecture","sources":[{"id":"getty-aat.300054159","title":"Getty Art & Architecture Thesaurus record 300054159","url":"http://vocab.getty.edu/page/aat/300054159"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines naval architecture as: Art or science of designing and building ships and other waterborne craft.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300189645","kind":"concept","label":"urban design","sources":[{"id":"getty-aat.300189645","title":"Getty Art & Architecture Thesaurus record 300189645","url":"http://vocab.getty.edu/page/aat/300189645"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines urban design as: The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300447138","kind":"concept","label":"vāstuvidyā","sources":[{"id":"getty-aat.300447138","title":"Getty Art & Architecture Thesaurus record 300447138","url":"http://vocab.getty.edu/page/aat/300447138"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vāstuvidyā as: In Indian architecture, a science of building, architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054269","kind":"concept","label":"syntax","sources":[{"id":"getty-aat.300054269","title":"Getty Art & Architecture Thesaurus record 300054269","url":"http://vocab.getty.edu/page/aat/300054269"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines syntax as: That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391505","kind":"concept","label":"Neozoic","sources":[{"id":"getty-aat.300391505","title":"Getty Art & Architecture Thesaurus record 300391505","url":"http://vocab.getty.edu/page/aat/300391505"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neozoic as: An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391475","kind":"concept","label":"Archean","sources":[{"id":"getty-aat.300391475","title":"Getty Art & Architecture Thesaurus record 300391475","url":"http://vocab.getty.edu/page/aat/300391475"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Archean as: On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403945","kind":"concept","label":"Eolithic","sources":[{"id":"getty-aat.300403945","title":"Getty Art & Architecture Thesaurus record 300403945","url":"http://vocab.getty.edu/page/aat/300403945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eolithic as: The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019258","kind":"concept","label":"Paleolithic","sources":[{"id":"getty-aat.300019258","title":"Getty Art & Architecture Thesaurus record 300019258","url":"http://vocab.getty.edu/page/aat/300019258"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Paleolithic as: Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves. Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019264","kind":"concept","label":"Mesolithic","sources":[{"id":"getty-aat.300019264","title":"Getty Art & Architecture Thesaurus record 300019264","url":"http://vocab.getty.edu/page/aat/300019264"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mesolithic as: Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019267","kind":"concept","label":"Neolithic","sources":[{"id":"getty-aat.300019267","title":"Getty Art & Architecture Thesaurus record 300019267","url":"http://vocab.getty.edu/page/aat/300019267"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neolithic as: Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019273","kind":"concept","label":"Chalcolithic","sources":[{"id":"getty-aat.300019273","title":"Getty Art & Architecture Thesaurus record 300019273","url":"http://vocab.getty.edu/page/aat/300019273"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Chalcolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106757","kind":"concept","label":"Eneolithic","sources":[{"id":"getty-aat.300106757","title":"Getty Art & Architecture Thesaurus record 300106757","url":"http://vocab.getty.edu/page/aat/300106757"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eneolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106759","kind":"concept","label":"Final Neolithic","sources":[{"id":"getty-aat.300106759","title":"Getty Art & Architecture Thesaurus record 300106759","url":"http://vocab.getty.edu/page/aat/300106759"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Final Neolithic as: Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019276","kind":"concept","label":"Early Bronze Age","sources":[{"id":"getty-aat.300019276","title":"Getty Art & Architecture Thesaurus record 300019276","url":"http://vocab.getty.edu/page/aat/300019276"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Bronze Age as: Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019277","kind":"concept","label":"Middle Bronze Age","sources":[{"id":"getty-aat.300019277","title":"Getty Art & Architecture Thesaurus record 300019277","url":"http://vocab.getty.edu/page/aat/300019277"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Bronze Age as: Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019278","kind":"concept","label":"Late Bronze Age","sources":[{"id":"getty-aat.300019278","title":"Getty Art & Architecture Thesaurus record 300019278","url":"http://vocab.getty.edu/page/aat/300019278"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106738","kind":"concept","label":"Early Iron Age","sources":[{"id":"getty-aat.300106738","title":"Getty Art & Architecture Thesaurus record 300106738","url":"http://vocab.getty.edu/page/aat/300106738"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Iron Age as: Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106739","kind":"concept","label":"Middle Iron Age","sources":[{"id":"getty-aat.300106739","title":"Getty Art & Architecture Thesaurus record 300106739","url":"http://vocab.getty.edu/page/aat/300106739"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Iron Age as: Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106745","kind":"concept","label":"Late Iron Age","sources":[{"id":"getty-aat.300106745","title":"Getty Art & Architecture Thesaurus record 300106745","url":"http://vocab.getty.edu/page/aat/300106745"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Iron Age as: Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312134","kind":"concept","label":"Abyssinian","sources":[{"id":"getty-aat.300312134","title":"Getty Art & Architecture Thesaurus record 300312134","url":"http://vocab.getty.edu/page/aat/300312134"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Abyssinian as: Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262699","kind":"concept","label":"Algerian","sources":[{"id":"getty-aat.300262699","title":"Getty Art & Architecture Thesaurus record 300262699","url":"http://vocab.getty.edu/page/aat/300262699"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Algerian as: Style and culture of the people of Algeria or Algiers, in northern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262700","kind":"concept","label":"Angolan","sources":[{"id":"getty-aat.300262700","title":"Getty Art & Architecture Thesaurus record 300262700","url":"http://vocab.getty.edu/page/aat/300262700"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Angolan as: Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262993","kind":"concept","label":"Beninese","sources":[{"id":"getty-aat.300262993","title":"Getty Art & Architecture Thesaurus record 300262993","url":"http://vocab.getty.edu/page/aat/300262993"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Beninese as: Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262702","kind":"concept","label":"Burkina Faso","sources":[{"id":"getty-aat.300262702","title":"Getty Art & Architecture Thesaurus record 300262702","url":"http://vocab.getty.edu/page/aat/300262702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burkina Faso as: Style and culture of the people of Burkina Faso.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262703","kind":"concept","label":"Burundi","sources":[{"id":"getty-aat.300262703","title":"Getty Art & Architecture Thesaurus record 300262703","url":"http://vocab.getty.edu/page/aat/300262703"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burundi as: Style and culture of the people of Burundi.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262992","kind":"concept","label":"Cameroonian","sources":[{"id":"getty-aat.300262992","title":"Getty Art & Architecture Thesaurus record 300262992","url":"http://vocab.getty.edu/page/aat/300262992"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cameroonian as: Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262701","kind":"concept","label":"Cape Verdean","sources":[{"id":"getty-aat.300262701","title":"Getty Art & Architecture Thesaurus record 300262701","url":"http://vocab.getty.edu/page/aat/300262701"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cape Verdean as: Style and culture of the people of Cape Verde.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262708","kind":"concept","label":"Chadian","sources":[{"id":"getty-aat.300262708","title":"Getty Art & Architecture Thesaurus record 300262708","url":"http://vocab.getty.edu/page/aat/300262708"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Chadian as: Style or culture of the nation of Chad.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262638","kind":"concept","label":"Djiboutian","sources":[{"id":"getty-aat.300262638","title":"Getty Art & Architecture Thesaurus record 300262638","url":"http://vocab.getty.edu/page/aat/300262638"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Djiboutian as: Style and culture of the nation of Dijbouti.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262644","kind":"concept","label":"Equatorial Guinean","sources":[{"id":"getty-aat.300262644","title":"Getty Art & Architecture Thesaurus record 300262644","url":"http://vocab.getty.edu/page/aat/300262644"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Equatorial Guinean as: Style and culture of the people of Equatorial Guinea.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262645","kind":"concept","label":"Eritrean","sources":[{"id":"getty-aat.300262645","title":"Getty Art & Architecture Thesaurus record 300262645","url":"http://vocab.getty.edu/page/aat/300262645"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eritrean as: Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262648","kind":"concept","label":"Gabonese","sources":[{"id":"getty-aat.300262648","title":"Getty Art & Architecture Thesaurus record 300262648","url":"http://vocab.getty.edu/page/aat/300262648"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gabonese as: Style and culture of the inhabitants of the nation of Gabon.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262649","kind":"concept","label":"Gambian","sources":[{"id":"getty-aat.300262649","title":"Getty Art & Architecture Thesaurus record 300262649","url":"http://vocab.getty.edu/page/aat/300262649"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gambian as: Style and culture of inhabitants of the nation of Gambia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262651","kind":"concept","label":"Ghanaian","sources":[{"id":"getty-aat.300262651","title":"Getty Art & Architecture Thesaurus record 300262651","url":"http://vocab.getty.edu/page/aat/300262651"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ghanaian as: Style and culture of the people of the nation of Ghana.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262652","kind":"concept","label":"Guinea-Bissauan","sources":[{"id":"getty-aat.300262652","title":"Getty Art & Architecture Thesaurus record 300262652","url":"http://vocab.getty.edu/page/aat/300262652"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Guinea-Bissauan as: Style and culture of the people from Guinea-Bissau.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262650","kind":"concept","label":"Guinean","sources":[{"id":"getty-aat.300262650","title":"Getty Art & Architecture Thesaurus record 300262650","url":"http://vocab.getty.edu/page/aat/300262650"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Guinean as: Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262653","kind":"concept","label":"Ivorian","sources":[{"id":"getty-aat.300262653","title":"Getty Art & Architecture Thesaurus record 300262653","url":"http://vocab.getty.edu/page/aat/300262653"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ivorian as: Style and culture of the Ivory Coast.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262654","kind":"concept","label":"Kenyan","sources":[{"id":"getty-aat.300262654","title":"Getty Art & Architecture Thesaurus record 300262654","url":"http://vocab.getty.edu/page/aat/300262654"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kenyan as: Style and culture of Kenya.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262655","kind":"concept","label":"Lesotho","sources":[{"id":"getty-aat.300262655","title":"Getty Art & Architecture Thesaurus record 300262655","url":"http://vocab.getty.edu/page/aat/300262655"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Lesotho as: Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262640","kind":"concept","label":"Libyan","sources":[{"id":"getty-aat.300262640","title":"Getty Art & Architecture Thesaurus record 300262640","url":"http://vocab.getty.edu/page/aat/300262640"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Libyan as: Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262724","kind":"concept","label":"Mahoran","sources":[{"id":"getty-aat.300262724","title":"Getty Art & Architecture Thesaurus record 300262724","url":"http://vocab.getty.edu/page/aat/300262724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mahoran as: Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262641","kind":"concept","label":"Malawian","sources":[{"id":"getty-aat.300262641","title":"Getty Art & Architecture Thesaurus record 300262641","url":"http://vocab.getty.edu/page/aat/300262641"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Malawian as: Style and culture of people of the nation of Malawi.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264906","kind":"concept","label":"Malian","sources":[{"id":"getty-aat.300264906","title":"Getty Art & Architecture Thesaurus record 300264906","url":"http://vocab.getty.edu/page/aat/300264906"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Malian as: Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300375152","kind":"concept","label":"Maure","sources":[{"id":"getty-aat.300375152","title":"Getty Art & Architecture Thesaurus record 300375152","url":"http://vocab.getty.edu/page/aat/300375152"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Maure as: Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262723","kind":"concept","label":"Mauritian","sources":[{"id":"getty-aat.300262723","title":"Getty Art & Architecture Thesaurus record 300262723","url":"http://vocab.getty.edu/page/aat/300262723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mauritian as: The style and culture of the island of Mauritius in the Indian Ocean.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300245255","kind":"concept","label":"Moroccan","sources":[{"id":"getty-aat.300245255","title":"Getty Art & Architecture Thesaurus record 300245255","url":"http://vocab.getty.edu/page/aat/300245255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Moroccan as: Style and culture of the nation of Morocco or its historical counterparts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262725","kind":"concept","label":"Mozambican","sources":[{"id":"getty-aat.300262725","title":"Getty Art & Architecture Thesaurus record 300262725","url":"http://vocab.getty.edu/page/aat/300262725"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mozambican as: Style and culture of the nation of Mozambique.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262726","kind":"concept","label":"Namibian","sources":[{"id":"getty-aat.300262726","title":"Getty Art & Architecture Thesaurus record 300262726","url":"http://vocab.getty.edu/page/aat/300262726"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Namibian as: Style and culture of the people of the nation of Namibia or of the Namib desert.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386510","kind":"concept","label":"Reunionese","sources":[{"id":"getty-aat.300386510","title":"Getty Art & Architecture Thesaurus record 300386510","url":"http://vocab.getty.edu/page/aat/300386510"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Reunionese as: Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386512","kind":"concept","label":"Rhodesian","sources":[{"id":"getty-aat.300386512","title":"Getty Art & Architecture Thesaurus record 300386512","url":"http://vocab.getty.edu/page/aat/300386512"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rhodesian as: Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386517","kind":"concept","label":"Rwandan","sources":[{"id":"getty-aat.300386517","title":"Getty Art & Architecture Thesaurus record 300386517","url":"http://vocab.getty.edu/page/aat/300386517"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rwandan as: Nationality, style, and culture of Rwanda, in central-eastern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262631","kind":"concept","label":"Rwandese","sources":[{"id":"getty-aat.300262631","title":"Getty Art & Architecture Thesaurus record 300262631","url":"http://vocab.getty.edu/page/aat/300262631"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rwandese as: The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262634","kind":"concept","label":"Sao Tomean","sources":[{"id":"getty-aat.300262634","title":"Getty Art & Architecture Thesaurus record 300262634","url":"http://vocab.getty.edu/page/aat/300262634"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sao Tomean as: Style and culture of the nation of São Tomé and Príncipe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262583","kind":"concept","label":"Senegalese","sources":[{"id":"getty-aat.300262583","title":"Getty Art & Architecture Thesaurus record 300262583","url":"http://vocab.getty.edu/page/aat/300262583"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Senegalese as: Style and culture of the people of Senegal.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262632","kind":"concept","label":"Seychellois","sources":[{"id":"getty-aat.300262632","title":"Getty Art & Architecture Thesaurus record 300262632","url":"http://vocab.getty.edu/page/aat/300262632"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Seychellois as: Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262633","kind":"concept","label":"Sierra Leonean","sources":[{"id":"getty-aat.300262633","title":"Getty Art & Architecture Thesaurus record 300262633","url":"http://vocab.getty.edu/page/aat/300262633"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sierra Leonean as: Style and culture of the nation of Sierra Leone.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262705","kind":"concept","label":"Somalian","sources":[{"id":"getty-aat.300262705","title":"Getty Art & Architecture Thesaurus record 300262705","url":"http://vocab.getty.edu/page/aat/300262705"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Somalian as: General national designation of the nation of Somalia, the Somali Democratic Republic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262706","kind":"concept","label":"South African","sources":[{"id":"getty-aat.300262706","title":"Getty Art & Architecture Thesaurus record 300262706","url":"http://vocab.getty.edu/page/aat/300262706"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262698","kind":"concept","label":"Sudanese","sources":[{"id":"getty-aat.300262698","title":"Getty Art & Architecture Thesaurus record 300262698","url":"http://vocab.getty.edu/page/aat/300262698"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sudanese as: Style and culture of the people of the Sudan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262707","kind":"concept","label":"Tanzanian","sources":[{"id":"getty-aat.300262707","title":"Getty Art & Architecture Thesaurus record 300262707","url":"http://vocab.getty.edu/page/aat/300262707"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tanzanian as: Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262709","kind":"concept","label":"Togolese","sources":[{"id":"getty-aat.300262709","title":"Getty Art & Architecture Thesaurus record 300262709","url":"http://vocab.getty.edu/page/aat/300262709"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Togolese as: Nationality, style, or culture of the West African state of Togo (formerly Togoland).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263699","kind":"concept","label":"Ugandan","sources":[{"id":"getty-aat.300263699","title":"Getty Art & Architecture Thesaurus record 300263699","url":"http://vocab.getty.edu/page/aat/300263699"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ugandan as: The style and culture of the central African State, Uganda.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263700","kind":"concept","label":"Zambian","sources":[{"id":"getty-aat.300263700","title":"Getty Art & Architecture Thesaurus record 300263700","url":"http://vocab.getty.edu/page/aat/300263700"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Zambian as: The style and culture of the south central African country, Zambia (formerly Northern Rhodesia).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263701","kind":"concept","label":"Zimbabwean","sources":[{"id":"getty-aat.300263701","title":"Getty Art & Architecture Thesaurus record 300263701","url":"http://vocab.getty.edu/page/aat/300263701"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Zimbabwean as: The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015650","kind":"concept","label":"prehistoric North African periods","sources":[{"id":"getty-aat.300015650","title":"Getty Art & Architecture Thesaurus record 300015650","url":"http://vocab.getty.edu/page/aat/300015650"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric North African periods as: Periods related to prehistoric North African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015667","kind":"concept","label":"prehistoric Sub-Saharan African periods","sources":[{"id":"getty-aat.300015667","title":"Getty Art & Architecture Thesaurus record 300015667","url":"http://vocab.getty.edu/page/aat/300015667"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric Sub-Saharan African periods as: Periods related to prehistoric Sub-Saharan African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015759","kind":"concept","label":"Ancient West African","sources":[{"id":"getty-aat.300015759","title":"Getty Art & Architecture Thesaurus record 300015759","url":"http://vocab.getty.edu/page/aat/300015759"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient West African as: Cultures and styles of West Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015692","kind":"concept","label":"Ancient Central African","sources":[{"id":"getty-aat.300015692","title":"Getty Art & Architecture Thesaurus record 300015692","url":"http://vocab.getty.edu/page/aat/300015692"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Central African as: Cultures and styles of Central Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015727","kind":"concept","label":"Ancient Southern African","sources":[{"id":"getty-aat.300015727","title":"Getty Art & Architecture Thesaurus record 300015727","url":"http://vocab.getty.edu/page/aat/300015727"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Southern African as: Cultures and styles of southern Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015702","kind":"concept","label":"ancient East African","sources":[{"id":"getty-aat.300015702","title":"Getty Art & Architecture Thesaurus record 300015702","url":"http://vocab.getty.edu/page/aat/300015702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ancient East African as: Cultures and styles of East Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015723","kind":"concept","label":"Ancient North African","sources":[{"id":"getty-aat.300015723","title":"Getty Art & Architecture Thesaurus record 300015723","url":"http://vocab.getty.edu/page/aat/300015723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient North African as: Styles and cultures of North Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262589","kind":"concept","label":"modern East African","sources":[{"id":"getty-aat.300262589","title":"Getty Art & Architecture Thesaurus record 300262589","url":"http://vocab.getty.edu/page/aat/300262589"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern East African as: Styles and culture belonging to modern East Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016538","kind":"concept","label":"Southern African","sources":[{"id":"getty-aat.300016538","title":"Getty Art & Architecture Thesaurus record 300016538","url":"http://vocab.getty.edu/page/aat/300016538"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Southern African as: Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016434","kind":"concept","label":"Eastern African","sources":[{"id":"getty-aat.300016434","title":"Getty Art & Architecture Thesaurus record 300016434","url":"http://vocab.getty.edu/page/aat/300016434"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eastern African as: Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016586","kind":"concept","label":"North African","sources":[{"id":"getty-aat.300016586","title":"Getty Art & Architecture Thesaurus record 300016586","url":"http://vocab.getty.edu/page/aat/300016586"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016598","kind":"concept","label":"Pole Style","sources":[{"id":"getty-aat.300016598","title":"Getty Art & Architecture Thesaurus record 300016598","url":"http://vocab.getty.edu/page/aat/300016598"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pole Style as: Style of African sculpture, typically elongated, severe, and abstract-looking.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016600","kind":"concept","label":"Round Style","sources":[{"id":"getty-aat.300016600","title":"Getty Art & Architecture Thesaurus record 300016600","url":"http://vocab.getty.edu/page/aat/300016600"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Round Style as: Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387734","kind":"concept","label":"Turkestani","sources":[{"id":"getty-aat.300387734","title":"Getty Art & Architecture Thesaurus record 300387734","url":"http://vocab.getty.edu/page/aat/300387734"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Turkestani as: Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300244546","kind":"concept","label":"West Turkestani","sources":[{"id":"getty-aat.300244546","title":"Getty Art & Architecture Thesaurus record 300244546","url":"http://vocab.getty.edu/page/aat/300244546"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines West Turkestani as: Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386542","kind":"concept","label":"Taiwanese","sources":[{"id":"getty-aat.300386542","title":"Getty Art & Architecture Thesaurus record 300386542","url":"http://vocab.getty.edu/page/aat/300386542"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Taiwanese as: Nationality, styles, or culture of Taiwan, East Asia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018775","kind":"concept","label":"Afanasievo","sources":[{"id":"getty-aat.300018775","title":"Getty Art & Architecture Thesaurus record 300018775","url":"http://vocab.getty.edu/page/aat/300018775"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Afanasievo as: Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE. Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018803","kind":"concept","label":"Altai","sources":[{"id":"getty-aat.300018803","title":"Getty Art & Architecture Thesaurus record 300018803","url":"http://vocab.getty.edu/page/aat/300018803"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Altai as: Style and culture of the mountain range running along border shared by China and Mongolia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018778","kind":"concept","label":"Andronovo","sources":[{"id":"getty-aat.300018778","title":"Getty Art & Architecture Thesaurus record 300018778","url":"http://vocab.getty.edu/page/aat/300018778"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Andronovo as: Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018779","kind":"concept","label":"Karasuk","sources":[{"id":"getty-aat.300018779","title":"Getty Art & Architecture Thesaurus record 300018779","url":"http://vocab.getty.edu/page/aat/300018779"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Karasuk as: Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018777","kind":"concept","label":"Okunev","sources":[{"id":"getty-aat.300018777","title":"Getty Art & Architecture Thesaurus record 300018777","url":"http://vocab.getty.edu/page/aat/300018777"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Okunev as: Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300116922","kind":"concept","label":"Siberian Arctic Native styles","sources":[{"id":"getty-aat.300116922","title":"Getty Art & Architecture Thesaurus record 300116922","url":"http://vocab.getty.edu/page/aat/300116922"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Siberian Arctic Native styles as: Styles belonging to Siberian Arctic Native cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300113090","kind":"concept","label":"Tashtyk","sources":[{"id":"getty-aat.300113090","title":"Getty Art & Architecture Thesaurus record 300113090","url":"http://vocab.getty.edu/page/aat/300113090"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tashtyk as: Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386953","kind":"concept","label":"Tungus","sources":[{"id":"getty-aat.300386953","title":"Getty Art & Architecture Thesaurus record 300386953","url":"http://vocab.getty.edu/page/aat/300386953"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tungus as: Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458960","kind":"concept","label":"Assamese","sources":[{"id":"getty-aat.300458960","title":"Getty Art & Architecture Thesaurus record 300458960","url":"http://vocab.getty.edu/page/aat/300458960"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Assamese as: The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300385968","kind":"concept","label":"Bangladeshi","sources":[{"id":"getty-aat.300385968","title":"Getty Art & Architecture Thesaurus record 300385968","url":"http://vocab.getty.edu/page/aat/300385968"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Bangladeshi as: The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404787","kind":"concept","label":"Indic","sources":[{"id":"getty-aat.300404787","title":"Getty Art & Architecture Thesaurus record 300404787","url":"http://vocab.getty.edu/page/aat/300404787"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indic as: Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458962","kind":"concept","label":"Magars","sources":[{"id":"getty-aat.300458962","title":"Getty Art & Architecture Thesaurus record 300458962","url":"http://vocab.getty.edu/page/aat/300458962"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Magars as: The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266840","kind":"concept","label":"Pakistani","sources":[{"id":"getty-aat.300266840","title":"Getty Art & Architecture Thesaurus record 300266840","url":"http://vocab.getty.edu/page/aat/300266840"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pakistani as: Refers to the style and culture of modern Pakistan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019068","kind":"concept","label":"Sri Lankan","sources":[{"id":"getty-aat.300019068","title":"Getty Art & Architecture Thesaurus record 300019068","url":"http://vocab.getty.edu/page/aat/300019068"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sri Lankan as: Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458945","kind":"concept","label":"Akha","sources":[{"id":"getty-aat.300458945","title":"Getty Art & Architecture Thesaurus record 300458945","url":"http://vocab.getty.edu/page/aat/300458945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Akha as: The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458946","kind":"concept","label":"Batak","sources":[{"id":"getty-aat.300458946","title":"Getty Art & Architecture Thesaurus record 300458946","url":"http://vocab.getty.edu/page/aat/300458946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Batak as: The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458937","kind":"concept","label":"Brao","sources":[{"id":"getty-aat.300458937","title":"Getty Art & Architecture Thesaurus record 300458937","url":"http://vocab.getty.edu/page/aat/300458937"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Brao as: The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019088","kind":"concept","label":"Burmese","sources":[{"id":"getty-aat.300019088","title":"Getty Art & Architecture Thesaurus record 300019088","url":"http://vocab.getty.edu/page/aat/300019088"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burmese as: Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019104","kind":"concept","label":"Cambodian","sources":[{"id":"getty-aat.300019104","title":"Getty Art & Architecture Thesaurus record 300019104","url":"http://vocab.getty.edu/page/aat/300019104"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cambodian as: Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458939","kind":"concept","label":"Dayak","sources":[{"id":"getty-aat.300458939","title":"Getty Art & Architecture Thesaurus record 300458939","url":"http://vocab.getty.edu/page/aat/300458939"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dayak as: The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300240013","kind":"concept","label":"Hmong","sources":[{"id":"getty-aat.300240013","title":"Getty Art & Architecture Thesaurus record 300240013","url":"http://vocab.getty.edu/page/aat/300240013"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hmong as: Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386148","kind":"concept","label":"Indochinese","sources":[{"id":"getty-aat.300386148","title":"Getty Art & Architecture Thesaurus record 300386148","url":"http://vocab.getty.edu/page/aat/300386148"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indochinese as: Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018704","kind":"concept","label":"Indonesian","sources":[{"id":"getty-aat.300018704","title":"Getty Art & Architecture Thesaurus record 300018704","url":"http://vocab.getty.edu/page/aat/300018704"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indonesian as: Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458936","kind":"concept","label":"Jarai","sources":[{"id":"getty-aat.300458936","title":"Getty Art & Architecture Thesaurus record 300458936","url":"http://vocab.getty.edu/page/aat/300458936"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Jarai as: The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410257","kind":"concept","label":"Kachin","sources":[{"id":"getty-aat.300410257","title":"Getty Art & Architecture Thesaurus record 300410257","url":"http://vocab.getty.edu/page/aat/300410257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kachin as: Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015647","kind":"concept","label":"African (general, continental cultures)","sources":[{"id":"getty-aat.300015647","title":"Getty Art & Architecture Thesaurus record 300015647","url":"http://vocab.getty.edu/page/aat/300015647"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African (general, continental cultures) as: Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018773","kind":"concept","label":"Siberian (culture or style)","sources":[{"id":"getty-aat.300018773","title":"Getty Art & Architecture Thesaurus record 300018773","url":"http://vocab.getty.edu/page/aat/300018773"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Siberian (culture or style) as: Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054156","kind":"concept","label":"architecture (discipline)","sources":[{"id":"getty-aat.300054156","title":"Getty Art & Architecture Thesaurus record 300054156","url":"http://vocab.getty.edu/page/aat/300054156"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architecture (discipline) as: The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations. For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054154","kind":"concept","label":"visual arts (discipline)","sources":[{"id":"getty-aat.300054154","title":"Getty Art & Architecture Thesaurus record 300054154","url":"http://vocab.getty.edu/page/aat/300054154"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines visual arts (discipline) as: Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300175240","kind":"concept","label":"arts (broad discipline)","sources":[{"id":"getty-aat.300175240","title":"Getty Art & Architecture Thesaurus record 300175240","url":"http://vocab.getty.edu/page/aat/300175240"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arts (broad discipline) as: Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054171","kind":"concept","label":"design (discipline)","sources":[{"id":"getty-aat.300054171","title":"Getty Art & Architecture Thesaurus record 300054171","url":"http://vocab.getty.edu/page/aat/300054171"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines design (discipline) as: Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263250","kind":"concept","label":"grammar (discipline)","sources":[{"id":"getty-aat.300263250","title":"Getty Art & Architecture Thesaurus record 300263250","url":"http://vocab.getty.edu/page/aat/300263250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines grammar (discipline) as: The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054300","kind":"concept","label":"religion (discipline)","sources":[{"id":"getty-aat.300054300","title":"Getty Art & Architecture Thesaurus record 300054300","url":"http://vocab.getty.edu/page/aat/300054300"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religion (discipline) as: Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054299","kind":"concept","label":"<religion and related disciplines>","sources":[{"id":"getty-aat.300054299","title":"Getty Art & Architecture Thesaurus record 300054299","url":"http://vocab.getty.edu/page/aat/300054299"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <religion and related disciplines> as: The discipline of religion and closely related disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055126","kind":"concept","label":"Associated Concepts","sources":[{"id":"getty-aat.300055126","title":"Getty Art & Architecture Thesaurus record 300055126","url":"http://vocab.getty.edu/page/aat/300055126"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Associated Concepts as: The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300137365","kind":"concept","label":"<linguistics and related disciplines>","sources":[{"id":"getty-aat.300137365","title":"Getty Art & Architecture Thesaurus record 300137365","url":"http://vocab.getty.edu/page/aat/300137365"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <linguistics and related disciplines> as: The discipline of linguistics and other disciplines related to it.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055980","kind":"concept","label":"<religions and religious concepts>","sources":[{"id":"getty-aat.300055980","title":"Getty Art & Architecture Thesaurus record 300055980","url":"http://vocab.getty.edu/page/aat/300055980"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <religions and religious concepts> as: Religions and concepts related to religions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054146","kind":"concept","label":"music (performing arts genre)","sources":[{"id":"getty-aat.300054146","title":"Getty Art & Architecture Thesaurus record 300054146","url":"http://vocab.getty.edu/page/aat/300054146"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music (performing arts genre) as: Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054140","kind":"concept","label":"performing arts (discipline)","sources":[{"id":"getty-aat.300054140","title":"Getty Art & Architecture Thesaurus record 300054140","url":"http://vocab.getty.edu/page/aat/300054140"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines performing arts (discipline) as: Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417584","kind":"concept","label":"music (discipline)","sources":[{"id":"getty-aat.300417584","title":"Getty Art & Architecture Thesaurus record 300417584","url":"http://vocab.getty.edu/page/aat/300417584"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music (discipline) as: The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055939","kind":"concept","label":"ethics (philosophical concept)","sources":[{"id":"getty-aat.300055939","title":"Getty Art & Architecture Thesaurus record 300055939","url":"http://vocab.getty.edu/page/aat/300055939"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ethics (philosophical concept) as: System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417581","kind":"concept","label":"dance (discipline)","sources":[{"id":"getty-aat.300417581","title":"Getty Art & Architecture Thesaurus record 300417581","url":"http://vocab.getty.edu/page/aat/300417581"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dance (discipline) as: Discipline involving the study of dancing and movement, including performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300389795","kind":"concept","label":"photography (discipline)","sources":[{"id":"getty-aat.300389795","title":"Getty Art & Architecture Thesaurus record 300389795","url":"http://vocab.getty.edu/page/aat/300389795"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines photography (discipline) as: The dedicated practice of making photographs as an applied art.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-theory-philosophy","kind":"concept","label":"Action theory (philosophy)","sources":[{"id":"wikipedia.article.action-theory-philosophy","title":"English Wikipedia article: Action theory (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+theory+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Action theory (philosophy)\", CC BY-SA 4.0) states: Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ad-hoc-hypothesis","kind":"concept","label":"Ad hoc hypothesis","sources":[{"id":"wikipedia.article.ad-hoc-hypothesis","title":"English Wikipedia article: Ad hoc hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ad+hoc+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Ad hoc hypothesis\", CC BY-SA 4.0) states: In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correspondence-theory-of-truth","kind":"concept","label":"Correspondence theory of truth","sources":[{"id":"wikipedia.article.correspondence-theory-of-truth","title":"English Wikipedia article: Correspondence theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correspondence+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Correspondence theory of truth\", CC BY-SA 4.0) states: In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.availability-cascade","kind":"concept","label":"Availability cascade","sources":[{"id":"wikipedia.article.availability-cascade","title":"English Wikipedia article: Availability cascade","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+cascade"}],"status":"reported","summary":"English Wikipedia (article \"Availability cascade\", CC BY-SA 4.0) states: An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.critical-thinking","kind":"concept","label":"Critical thinking","sources":[{"id":"wikipedia.article.critical-thinking","title":"English Wikipedia article: Critical thinking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Critical+thinking"}],"status":"reported","summary":"English Wikipedia (article \"Critical thinking\", CC BY-SA 4.0) states: Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.informal-fallacy","kind":"concept","label":"Informal fallacy","sources":[{"id":"wikipedia.article.informal-fallacy","title":"English Wikipedia article: Informal fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Informal+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Informal fallacy\", CC BY-SA 4.0) states: Informal fallacies are a type of incorrect argument in natural language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.formal-fallacy","kind":"concept","label":"Formal fallacy","sources":[{"id":"wikipedia.article.formal-fallacy","title":"English Wikipedia article: Formal fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Formal+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Formal fallacy\", CC BY-SA 4.0) states: In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.skepticism","kind":"concept","label":"Skepticism","sources":[{"id":"wikipedia.article.skepticism","title":"English Wikipedia article: Skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Skepticism\", CC BY-SA 4.0) states: Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-bias","kind":"concept","label":"Action bias","sources":[{"id":"wikipedia.article.action-bias","title":"English Wikipedia article: Action bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+bias"}],"status":"reported","summary":"English Wikipedia (article \"Action bias\", CC BY-SA 4.0) states: Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absoluteness-logic","kind":"concept","label":"Absoluteness (logic)","sources":[{"id":"wikipedia.article.absoluteness-logic","title":"English Wikipedia article: Absoluteness (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absoluteness+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Absoluteness (logic)\", CC BY-SA 4.0) states: In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.philosophical-logic","kind":"concept","label":"Philosophical logic","sources":[{"id":"wikipedia.article.philosophical-logic","title":"English Wikipedia article: Philosophical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Philosophical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Philosophical logic\", CC BY-SA 4.0) states: Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adverse-inference","kind":"concept","label":"Adverse inference","sources":[{"id":"wikipedia.article.adverse-inference","title":"English Wikipedia article: Adverse inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adverse+inference"}],"status":"reported","summary":"English Wikipedia (article \"Adverse inference\", CC BY-SA 4.0) states: Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.candle-problem","kind":"concept","label":"Candle problem","sources":[{"id":"wikipedia.article.candle-problem","title":"English Wikipedia article: Candle problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Candle+problem"}],"status":"reported","summary":"English Wikipedia (article \"Candle problem\", CC BY-SA 4.0) states: The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alvin-plantinga-s-free-will-defense","kind":"concept","label":"Alvin Plantinga's free-will defense","sources":[{"id":"wikipedia.article.alvin-plantinga-s-free-will-defense","title":"English Wikipedia article: Alvin Plantinga's free-will defense","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alvin+Plantinga%27s+free-will+defense"}],"status":"reported","summary":"English Wikipedia (article \"Alvin Plantinga's free-will defense\", CC BY-SA 4.0) states: Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-series-and-b-series","kind":"concept","label":"A series and B series","sources":[{"id":"wikipedia.article.a-series-and-b-series","title":"English Wikipedia article: A series and B series","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A+series+and+B+series"}],"status":"reported","summary":"English Wikipedia (article \"A series and B series\", CC BY-SA 4.0) states: In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.measurement","kind":"concept","label":"Measurement","sources":[{"id":"wikipedia.article.measurement","title":"English Wikipedia article: Measurement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Measurement"}],"status":"reported","summary":"English Wikipedia (article \"Measurement\", CC BY-SA 4.0) states: Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-bias","kind":"concept","label":"Cognitive bias","sources":[{"id":"wikipedia.article.cognitive-bias","title":"English Wikipedia article: Cognitive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive bias\", CC BY-SA 4.0) states: A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.pseudoscience","kind":"concept","label":"Pseudoscience","sources":[{"id":"wikipedia.article.pseudoscience","title":"English Wikipedia article: Pseudoscience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pseudoscience"}],"status":"reported","summary":"English Wikipedia (article \"Pseudoscience\", CC BY-SA 4.0) states: Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-priori-and-a-posteriori","kind":"concept","label":"A priori and a posteriori","sources":[{"id":"wikipedia.article.a-priori-and-a-posteriori","title":"English Wikipedia article: A priori and a posteriori","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A+priori+and+a+posteriori"}],"status":"reported","summary":"English Wikipedia (article \"A priori and a posteriori\", CC BY-SA 4.0) states: In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.history-and-philosophy-of-science","kind":"field","label":"History and philosophy of science","sources":[{"id":"wikipedia.article.history-and-philosophy-of-science","title":"English Wikipedia article: History and philosophy of science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=History+and+philosophy+of+science"}],"status":"reported","summary":"English Wikipedia (article \"History and philosophy of science\", CC BY-SA 4.0) states: The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.b-theory-of-time","kind":"concept","label":"B-theory of time","sources":[{"id":"wikipedia.article.b-theory-of-time","title":"English Wikipedia article: B-theory of time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=B-theory+of+time"}],"status":"reported","summary":"English Wikipedia (article \"B-theory of time\", CC BY-SA 4.0) states: The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deflationary-theory-of-truth","kind":"concept","label":"Deflationary theory of truth","sources":[{"id":"wikipedia.article.deflationary-theory-of-truth","title":"English Wikipedia article: Deflationary theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deflationary+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Deflationary theory of truth\", CC BY-SA 4.0) states: In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \"truth\" to such a statement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.archival-research","kind":"concept","label":"Archival research","sources":[{"id":"wikipedia.article.archival-research","title":"English Wikipedia article: Archival research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archival+research"}],"status":"reported","summary":"English Wikipedia (article \"Archival research\", CC BY-SA 4.0) states: Archival research is a type of research which involves seeking out and extracting evidence from archival records.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.agent-causation","kind":"concept","label":"Agent causation","sources":[{"id":"wikipedia.article.agent-causation","title":"English Wikipedia article: Agent causation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agent+causation"}],"status":"reported","summary":"English Wikipedia (article \"Agent causation\", CC BY-SA 4.0) states: Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-reasoning","kind":"concept","label":"Adaptive reasoning","sources":[{"id":"wikipedia.article.adaptive-reasoning","title":"English Wikipedia article: Adaptive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive reasoning\", CC BY-SA 4.0) states: Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.affirming-the-consequent","kind":"concept","label":"Affirming the consequent","sources":[{"id":"wikipedia.article.affirming-the-consequent","title":"English Wikipedia article: Affirming the consequent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affirming+the+consequent"}],"status":"reported","summary":"English Wikipedia (article \"Affirming the consequent\", CC BY-SA 4.0) states: In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.empiric-school","kind":"concept","label":"Empiric school","sources":[{"id":"wikipedia.article.empiric-school","title":"English Wikipedia article: Empiric school","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Empiric+school"}],"status":"reported","summary":"English Wikipedia (article \"Empiric school\", CC BY-SA 4.0) states: The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesianism","kind":"concept","label":"Cartesianism","sources":[{"id":"wikipedia.article.cartesianism","title":"English Wikipedia article: Cartesianism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesianism"}],"status":"reported","summary":"English Wikipedia (article \"Cartesianism\", CC BY-SA 4.0) states: Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.accident-philosophy","kind":"concept","label":"Accident (philosophy)","sources":[{"id":"wikipedia.article.accident-philosophy","title":"English Wikipedia article: Accident (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Accident+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Accident (philosophy)\", CC BY-SA 4.0) states: An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.agentive-logic","kind":"concept","label":"Agentive logic","sources":[{"id":"wikipedia.article.agentive-logic","title":"English Wikipedia article: Agentive logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agentive+logic"}],"status":"reported","summary":"English Wikipedia (article \"Agentive logic\", CC BY-SA 4.0) states: Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.catch-22-logic","kind":"concept","label":"Catch-22 (logic)","sources":[{"id":"wikipedia.article.catch-22-logic","title":"English Wikipedia article: Catch-22 (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catch-22+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Catch-22 (logic)\", CC BY-SA 4.0) states: A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.arbitrary-inference","kind":"concept","label":"Arbitrary inference","sources":[{"id":"wikipedia.article.arbitrary-inference","title":"English Wikipedia article: Arbitrary inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arbitrary+inference"}],"status":"reported","summary":"English Wikipedia (article \"Arbitrary inference\", CC BY-SA 4.0) states: Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analogy","kind":"concept","label":"Analogy","sources":[{"id":"wikipedia.article.analogy","title":"English Wikipedia article: Analogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogy"}],"status":"reported","summary":"English Wikipedia (article \"Analogy\", CC BY-SA 4.0) states: Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-philosophy","kind":"concept","label":"Absolute (philosophy)","sources":[{"id":"wikipedia.article.absolute-philosophy","title":"English Wikipedia article: Absolute (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Absolute (philosophy)\", CC BY-SA 4.0) states: In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-justice","kind":"concept","label":"Cognitive justice","sources":[{"id":"wikipedia.article.cognitive-justice","title":"English Wikipedia article: Cognitive justice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+justice"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive justice\", CC BY-SA 4.0) states: The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-heuristic","kind":"concept","label":"Admissible heuristic","sources":[{"id":"wikipedia.article.admissible-heuristic","title":"English Wikipedia article: Admissible heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Admissible heuristic\", CC BY-SA 4.0) states: In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alphabet-of-human-thought","kind":"concept","label":"Alphabet of human thought","sources":[{"id":"wikipedia.article.alphabet-of-human-thought","title":"English Wikipedia article: Alphabet of human thought","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alphabet+of+human+thought"}],"status":"reported","summary":"English Wikipedia (article \"Alphabet of human thought\", CC BY-SA 4.0) states: The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.abductive-reasoning","kind":"concept","label":"Abductive reasoning","sources":[{"id":"wikipedia.article.abductive-reasoning","title":"English Wikipedia article: Abductive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abductive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Abductive reasoning\", CC BY-SA 4.0) states: Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.bayesian-epistemology","kind":"field","label":"Bayesian epistemology","sources":[{"id":"wikipedia.article.bayesian-epistemology","title":"English Wikipedia article: Bayesian epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bayesian+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Bayesian epistemology\", CC BY-SA 4.0) states: Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.actor-network-theory","kind":"concept","label":"Actor–network theory","sources":[{"id":"wikipedia.article.actor-network-theory","title":"English Wikipedia article: Actor–network theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actor%E2%80%93network+theory"}],"status":"reported","summary":"English Wikipedia (article \"Actor–network theory\", CC BY-SA 4.0) states: Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-analogy","kind":"concept","label":"Argument from analogy","sources":[{"id":"wikipedia.article.argument-from-analogy","title":"English Wikipedia article: Argument from analogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+analogy"}],"status":"reported","summary":"English Wikipedia (article \"Argument from analogy\", CC BY-SA 4.0) states: Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ad-personam","kind":"concept","label":"Ad personam","sources":[{"id":"wikipedia.article.ad-personam","title":"English Wikipedia article: Ad personam","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ad+personam"}],"status":"reported","summary":"English Wikipedia (article \"Ad personam\", CC BY-SA 4.0) states: In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denying-the-antecedent","kind":"concept","label":"Denying the antecedent","sources":[{"id":"wikipedia.article.denying-the-antecedent","title":"English Wikipedia article: Denying the antecedent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denying+the+antecedent"}],"status":"reported","summary":"English Wikipedia (article \"Denying the antecedent\", CC BY-SA 4.0) states: Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antipedagogy","kind":"concept","label":"Antipedagogy","sources":[{"id":"wikipedia.article.antipedagogy","title":"English Wikipedia article: Antipedagogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antipedagogy"}],"status":"reported","summary":"English Wikipedia (article \"Antipedagogy\", CC BY-SA 4.0) states: Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antinomy","kind":"concept","label":"Antinomy","sources":[{"id":"wikipedia.article.antinomy","title":"English Wikipedia article: Antinomy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antinomy"}],"status":"reported","summary":"English Wikipedia (article \"Antinomy\", CC BY-SA 4.0) states: In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.communicative-rationality","kind":"concept","label":"Communicative rationality","sources":[{"id":"wikipedia.article.communicative-rationality","title":"English Wikipedia article: Communicative rationality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Communicative+rationality"}],"status":"reported","summary":"English Wikipedia (article \"Communicative rationality\", CC BY-SA 4.0) states: Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analogy-of-the-divided-line","kind":"concept","label":"Analogy of the divided line","sources":[{"id":"wikipedia.article.analogy-of-the-divided-line","title":"English Wikipedia article: Analogy of the divided line","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogy+of+the+divided+line"}],"status":"reported","summary":"English Wikipedia (article \"Analogy of the divided line\", CC BY-SA 4.0) states: The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ai-trust-paradox","kind":"concept","label":"AI trust paradox","sources":[{"id":"wikipedia.article.ai-trust-paradox","title":"English Wikipedia article: AI trust paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=AI+trust+paradox"}],"status":"reported","summary":"English Wikipedia (article \"AI trust paradox\", CC BY-SA 4.0) states: The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-space-and-time","kind":"concept","label":"Absolute space and time","sources":[{"id":"wikipedia.article.absolute-space-and-time","title":"English Wikipedia article: Absolute space and time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+space+and+time"}],"status":"reported","summary":"English Wikipedia (article \"Absolute space and time\", CC BY-SA 4.0) states: Absolute space and time is a concept in physics and philosophy about the properties of the universe.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.effective-theory","kind":"concept","label":"Effective theory","sources":[{"id":"wikipedia.article.effective-theory","title":"English Wikipedia article: Effective theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Effective+theory"}],"status":"reported","summary":"English Wikipedia (article \"Effective theory\", CC BY-SA 4.0) states: In science, an effective theory is a deliberately limited scientific theory applicable under specific circumstances.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.affect-heuristic","kind":"concept","label":"Affect heuristic","sources":[{"id":"wikipedia.article.affect-heuristic","title":"English Wikipedia article: Affect heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affect+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Affect heuristic\", CC BY-SA 4.0) states: The affect heuristic is a heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.academic-skepticism","kind":"concept","label":"Academic skepticism","sources":[{"id":"wikipedia.article.academic-skepticism","title":"English Wikipedia article: Academic skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Academic+skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Academic skepticism\", CC BY-SA 4.0) states: Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.abstraction","kind":"concept","label":"Abstraction","sources":[{"id":"wikipedia.article.abstraction","title":"English Wikipedia article: Abstraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstraction"}],"status":"reported","summary":"English Wikipedia (article \"Abstraction\", CC BY-SA 4.0) states: Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.black-swan-theory","kind":"concept","label":"Black swan theory","sources":[{"id":"wikipedia.article.black-swan-theory","title":"English Wikipedia article: Black swan theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Black+swan+theory"}],"status":"reported","summary":"English Wikipedia (article \"Black swan theory\", CC BY-SA 4.0) states: The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.closed-circle","kind":"concept","label":"Closed circle","sources":[{"id":"wikipedia.article.closed-circle","title":"English Wikipedia article: Closed circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closed+circle"}],"status":"reported","summary":"English Wikipedia (article \"Closed circle\", CC BY-SA 4.0) states: A closed-circle argument is one that is unfalsifiable.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-theories-of-truth","kind":"concept","label":"Epistemic theories of truth","sources":[{"id":"wikipedia.article.epistemic-theories-of-truth","title":"English Wikipedia article: Epistemic theories of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+theories+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic theories of truth\", CC BY-SA 4.0) states: In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blinded-experiment","kind":"concept","label":"Blinded experiment","sources":[{"id":"wikipedia.article.blinded-experiment","title":"English Wikipedia article: Blinded experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blinded+experiment"}],"status":"reported","summary":"English Wikipedia (article \"Blinded experiment\", CC BY-SA 4.0) states: In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dispersed-knowledge","kind":"concept","label":"Dispersed knowledge","sources":[{"id":"wikipedia.article.dispersed-knowledge","title":"English Wikipedia article: Dispersed knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dispersed+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Dispersed knowledge\", CC BY-SA 4.0) states: Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief-revision","kind":"concept","label":"Belief revision","sources":[{"id":"wikipedia.article.belief-revision","title":"English Wikipedia article: Belief revision","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief+revision"}],"status":"reported","summary":"English Wikipedia (article \"Belief revision\", CC BY-SA 4.0) states: Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-reasoning","kind":"concept","label":"Analytic reasoning","sources":[{"id":"wikipedia.article.analytic-reasoning","title":"English Wikipedia article: Analytic reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Analytic reasoning\", CC BY-SA 4.0) states: Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backward-induction","kind":"concept","label":"Backward induction","sources":[{"id":"wikipedia.article.backward-induction","title":"English Wikipedia article: Backward induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backward+induction"}],"status":"reported","summary":"English Wikipedia (article \"Backward induction\", CC BY-SA 4.0) states: Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecological-fallacy","kind":"concept","label":"Ecological fallacy","sources":[{"id":"wikipedia.article.ecological-fallacy","title":"English Wikipedia article: Ecological fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecological+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Ecological fallacy\", CC BY-SA 4.0) states: An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \"Ecological fallacy\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.argumentation-theory","kind":"field","label":"Argumentation theory","sources":[{"id":"wikipedia.article.argumentation-theory","title":"English Wikipedia article: Argumentation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Argumentation theory\", CC BY-SA 4.0) states: Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ariadne-s-thread-logic","kind":"concept","label":"Ariadne's thread (logic)","sources":[{"id":"wikipedia.article.ariadne-s-thread-logic","title":"English Wikipedia article: Ariadne's thread (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ariadne%27s+thread+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Ariadne's thread (logic)\", CC BY-SA 4.0) states: Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.local-skepticism","kind":"concept","label":"Local skepticism","sources":[{"id":"wikipedia.article.local-skepticism","title":"English Wikipedia article: Local skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Local+skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Local skepticism\", CC BY-SA 4.0) states: Local skepticism is the view that one cannot possess knowledge in some particular domain.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.empirical-evidence","kind":"concept","label":"Empirical evidence","sources":[{"id":"wikipedia.article.empirical-evidence","title":"English Wikipedia article: Empirical evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Empirical+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Empirical evidence\", CC BY-SA 4.0) states: Empirical evidence is evidence obtained through sense experience or experimental procedure.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cheng-zhu-school","kind":"concept","label":"Cheng–Zhu school","sources":[{"id":"wikipedia.article.cheng-zhu-school","title":"English Wikipedia article: Cheng–Zhu school","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cheng%E2%80%93Zhu+school"}],"status":"reported","summary":"English Wikipedia (article \"Cheng–Zhu school\", CC BY-SA 4.0) states: The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apodicticity","kind":"concept","label":"Apodicticity","sources":[{"id":"wikipedia.article.apodicticity","title":"English Wikipedia article: Apodicticity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apodicticity"}],"status":"reported","summary":"English Wikipedia (article \"Apodicticity\", CC BY-SA 4.0) states: \"Apodictic\", also spelled \"apodeictic\" (Ancient Greek: ἀποδεικτικός, \"capable of demonstration\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-rationale","kind":"concept","label":"Design rationale","sources":[{"id":"wikipedia.article.design-rationale","title":"English Wikipedia article: Design rationale","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+rationale"}],"status":"reported","summary":"English Wikipedia (article \"Design rationale\", CC BY-SA 4.0) states: A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.expectancy-theory","kind":"concept","label":"Expectancy theory","sources":[{"id":"wikipedia.article.expectancy-theory","title":"English Wikipedia article: Expectancy theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Expectancy+theory"}],"status":"reported","summary":"English Wikipedia (article \"Expectancy theory\", CC BY-SA 4.0) states: Expectancy theory (or expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-b-testing","kind":"concept","label":"A/B testing","sources":[{"id":"wikipedia.article.a-b-testing","title":"English Wikipedia article: A/B testing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A%2FB+testing"}],"status":"reported","summary":"English Wikipedia (article \"A/B testing\", CC BY-SA 4.0) states: A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.baconian-method","kind":"concept","label":"Baconian method","sources":[{"id":"wikipedia.article.baconian-method","title":"English Wikipedia article: Baconian method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baconian+method"}],"status":"reported","summary":"English Wikipedia (article \"Baconian method\", CC BY-SA 4.0) states: The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.burden-of-knowledge","kind":"concept","label":"Burden of knowledge","sources":[{"id":"wikipedia.article.burden-of-knowledge","title":"English Wikipedia article: Burden of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Burden+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Burden of knowledge\", CC BY-SA 4.0) states: The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.agnoiology","kind":"field","label":"Agnoiology","sources":[{"id":"wikipedia.article.agnoiology","title":"English Wikipedia article: Agnoiology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agnoiology"}],"status":"reported","summary":"English Wikipedia (article \"Agnoiology\", CC BY-SA 4.0) states: Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \"unknowable\" (as distinct from \"unknown\").","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesian-doubt","kind":"concept","label":"Cartesian doubt","sources":[{"id":"wikipedia.article.cartesian-doubt","title":"English Wikipedia article: Cartesian doubt","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesian+doubt"}],"status":"reported","summary":"English Wikipedia (article \"Cartesian doubt\", CC BY-SA 4.0) states: Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anecdotal-evidence","kind":"concept","label":"Anecdotal evidence","sources":[{"id":"wikipedia.article.anecdotal-evidence","title":"English Wikipedia article: Anecdotal evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anecdotal+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Anecdotal evidence\", CC BY-SA 4.0) states: Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"question.wikipedia.conjecture","kind":"question","label":"Conjecture","sources":[{"id":"wikipedia.article.conjecture","title":"English Wikipedia article: Conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Conjecture\", CC BY-SA 4.0) states: In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fictionalism","kind":"concept","label":"Fictionalism","sources":[{"id":"wikipedia.article.fictionalism","title":"English Wikipedia article: Fictionalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fictionalism"}],"status":"reported","summary":"English Wikipedia (article \"Fictionalism\", CC BY-SA 4.0) states: Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \"make believe\", thus allowing individuals to treat something as literally true (a \"useful fiction\").","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.audit-study","kind":"concept","label":"Audit study","sources":[{"id":"wikipedia.article.audit-study","title":"English Wikipedia article: Audit study","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audit+study"}],"status":"reported","summary":"English Wikipedia (article \"Audit study\", CC BY-SA 4.0) states: A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\"auditors\") are matched on all characteristics except the one being tested for discrimination.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief-desire-intention-model","kind":"concept","label":"Belief–desire–intention model","sources":[{"id":"wikipedia.article.belief-desire-intention-model","title":"English Wikipedia article: Belief–desire–intention model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief%E2%80%93desire%E2%80%93intention+model"}],"status":"reported","summary":"English Wikipedia (article \"Belief–desire–intention model\", CC BY-SA 4.0) states: For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument","kind":"concept","label":"Argument","sources":[{"id":"wikipedia.article.argument","title":"English Wikipedia article: Argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument"}],"status":"reported","summary":"English Wikipedia (article \"Argument\", CC BY-SA 4.0) states: An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-inference","kind":"concept","label":"Causal inference","sources":[{"id":"wikipedia.article.causal-inference","title":"English Wikipedia article: Causal inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+inference"}],"status":"reported","summary":"English Wikipedia (article \"Causal inference\", CC BY-SA 4.0) states: Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appeal-to-the-law","kind":"concept","label":"Appeal to the law","sources":[{"id":"wikipedia.article.appeal-to-the-law","title":"English Wikipedia article: Appeal to the law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appeal+to+the+law"}],"status":"reported","summary":"English Wikipedia (article \"Appeal to the law\", CC BY-SA 4.0) states: An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.distinction-bias","kind":"concept","label":"Distinction bias","sources":[{"id":"wikipedia.article.distinction-bias","title":"English Wikipedia article: Distinction bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distinction+bias"}],"status":"reported","summary":"English Wikipedia (article \"Distinction bias\", CC BY-SA 4.0) states: Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-a-fortiori","kind":"concept","label":"Argumentum a fortiori","sources":[{"id":"wikipedia.article.argumentum-a-fortiori","title":"English Wikipedia article: Argumentum a fortiori","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+a+fortiori"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum a fortiori\", CC BY-SA 4.0) states: Argumentum a fortiori (literally \"argument from the stronger [reason]\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.armchair-theorizing","kind":"concept","label":"Armchair theorizing","sources":[{"id":"wikipedia.article.armchair-theorizing","title":"English Wikipedia article: Armchair theorizing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armchair+theorizing"}],"status":"reported","summary":"English Wikipedia (article \"Armchair theorizing\", CC BY-SA 4.0) states: Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.reasonable-doubt","kind":"concept","label":"Reasonable doubt","sources":[{"id":"wikipedia.article.reasonable-doubt","title":"English Wikipedia article: Reasonable doubt","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Reasonable+doubt"}],"status":"reported","summary":"English Wikipedia (article \"Reasonable doubt\", CC BY-SA 4.0) states: Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apophantic","kind":"concept","label":"Apophantic","sources":[{"id":"wikipedia.article.apophantic","title":"English Wikipedia article: Apophantic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apophantic"}],"status":"reported","summary":"English Wikipedia (article \"Apophantic\", CC BY-SA 4.0) states: In logic, Apophantic (Greek: ἀποφαντικός, \"declaratory\", from ἀποφαίνειν apophainein, \"to show, to make known\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dogma","kind":"concept","label":"Dogma","sources":[{"id":"wikipedia.article.dogma","title":"English Wikipedia article: Dogma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dogma"}],"status":"reported","summary":"English Wikipedia (article \"Dogma\", CC BY-SA 4.0) states: Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correspondent-inference-theory","kind":"concept","label":"Correspondent inference theory","sources":[{"id":"wikipedia.article.correspondent-inference-theory","title":"English Wikipedia article: Correspondent inference theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correspondent+inference+theory"}],"status":"reported","summary":"English Wikipedia (article \"Correspondent inference theory\", CC BY-SA 4.0) states: Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965) that \"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-marginal-cases","kind":"concept","label":"Argument from marginal cases","sources":[{"id":"wikipedia.article.argument-from-marginal-cases","title":"English Wikipedia article: Argument from marginal cases","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+marginal+cases"}],"status":"reported","summary":"English Wikipedia (article \"Argument from marginal cases\", CC BY-SA 4.0) states: The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.active-intellect","kind":"concept","label":"Active intellect","sources":[{"id":"wikipedia.article.active-intellect","title":"English Wikipedia article: Active intellect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+intellect"}],"status":"reported","summary":"English Wikipedia (article \"Active intellect\", CC BY-SA 4.0) states: In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.expectancy-violations-theory","kind":"concept","label":"Expectancy violations theory","sources":[{"id":"wikipedia.article.expectancy-violations-theory","title":"English Wikipedia article: Expectancy violations theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Expectancy+violations+theory"}],"status":"reported","summary":"English Wikipedia (article \"Expectancy violations theory\", CC BY-SA 4.0) states: Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attrition-research","kind":"concept","label":"Attrition (research)","sources":[{"id":"wikipedia.article.attrition-research","title":"English Wikipedia article: Attrition (research)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attrition+%28research%29"}],"status":"reported","summary":"English Wikipedia (article \"Attrition (research)\", CC BY-SA 4.0) states: In science, attrition are ratios regarding the loss of participants during an experiment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.data-universalism","kind":"concept","label":"Data universalism","sources":[{"id":"wikipedia.article.data-universalism","title":"English Wikipedia article: Data universalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+universalism"}],"status":"reported","summary":"English Wikipedia (article \"Data universalism\", CC BY-SA 4.0) states: Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.eliminative-materialism","kind":"concept","label":"Eliminative materialism","sources":[{"id":"wikipedia.article.eliminative-materialism","title":"English Wikipedia article: Eliminative materialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eliminative+materialism"}],"status":"reported","summary":"English Wikipedia (article \"Eliminative materialism\", CC BY-SA 4.0) states: Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-inertia","kind":"concept","label":"Cognitive inertia","sources":[{"id":"wikipedia.article.cognitive-inertia","title":"English Wikipedia article: Cognitive inertia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+inertia"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive inertia\", CC BY-SA 4.0) states: Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.arche-writing","kind":"concept","label":"Arche-writing","sources":[{"id":"wikipedia.article.arche-writing","title":"English Wikipedia article: Arche-writing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arche-writing"}],"status":"reported","summary":"English Wikipedia (article \"Arche-writing\", CC BY-SA 4.0) states: In the philosophy of language, \"Arche-writing\" (French: archi-écriture \"arche-\" meaning \"origin, principle, or telos\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.alethiology","kind":"field","label":"Alethiology","sources":[{"id":"wikipedia.article.alethiology","title":"English Wikipedia article: Alethiology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alethiology"}],"status":"reported","summary":"English Wikipedia (article \"Alethiology\", CC BY-SA 4.0) states: Alethiology (or alethology, \"the study of aletheia\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alief-mental-state","kind":"concept","label":"Alief (mental state)","sources":[{"id":"wikipedia.article.alief-mental-state","title":"English Wikipedia article: Alief (mental state)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alief+%28mental+state%29"}],"status":"reported","summary":"English Wikipedia (article \"Alief (mental state)\", CC BY-SA 4.0) states: In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antipositivism","kind":"concept","label":"Antipositivism","sources":[{"id":"wikipedia.article.antipositivism","title":"English Wikipedia article: Antipositivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antipositivism"}],"status":"reported","summary":"English Wikipedia (article \"Antipositivism\", CC BY-SA 4.0) states: In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-empiricism","kind":"concept","label":"Constructive empiricism","sources":[{"id":"wikipedia.article.constructive-empiricism","title":"English Wikipedia article: Constructive empiricism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+empiricism"}],"status":"reported","summary":"English Wikipedia (article \"Constructive empiricism\", CC BY-SA 4.0) states: In philosophy of science, constructive empiricism is a form of empiricism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.butterfly-effect","kind":"concept","label":"Butterfly effect","sources":[{"id":"wikipedia.article.butterfly-effect","title":"English Wikipedia article: Butterfly effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butterfly+effect"}],"status":"reported","summary":"English Wikipedia (article \"Butterfly effect\", CC BY-SA 4.0) states: In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.encyclopedic-knowledge","kind":"concept","label":"Encyclopedic knowledge","sources":[{"id":"wikipedia.article.encyclopedic-knowledge","title":"English Wikipedia article: Encyclopedic knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Encyclopedic+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Encyclopedic knowledge\", CC BY-SA 4.0) states: To have encyclopedic knowledge is to have \"vast and complete\" knowledge about a large number of diverse subjects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backward-chaining","kind":"concept","label":"Backward chaining","sources":[{"id":"wikipedia.article.backward-chaining","title":"English Wikipedia article: Backward chaining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backward+chaining"}],"status":"reported","summary":"English Wikipedia (article \"Backward chaining\", CC BY-SA 4.0) states: Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.differential-effects","kind":"concept","label":"Differential effects","sources":[{"id":"wikipedia.article.differential-effects","title":"English Wikipedia article: Differential effects","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+effects"}],"status":"reported","summary":"English Wikipedia (article \"Differential effects\", CC BY-SA 4.0) states: Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-incredulity","kind":"concept","label":"Argument from incredulity","sources":[{"id":"wikipedia.article.argument-from-incredulity","title":"English Wikipedia article: Argument from incredulity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+incredulity"}],"status":"reported","summary":"English Wikipedia (article \"Argument from incredulity\", CC BY-SA 4.0) states: Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bracketing-phenomenology","kind":"concept","label":"Bracketing (phenomenology)","sources":[{"id":"wikipedia.article.bracketing-phenomenology","title":"English Wikipedia article: Bracketing (phenomenology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bracketing+%28phenomenology%29"}],"status":"reported","summary":"English Wikipedia (article \"Bracketing (phenomenology)\", CC BY-SA 4.0) states: Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.disinformation-research","kind":"concept","label":"Disinformation research","sources":[{"id":"wikipedia.article.disinformation-research","title":"English Wikipedia article: Disinformation research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disinformation+research"}],"status":"reported","summary":"English Wikipedia (article \"Disinformation research\", CC BY-SA 4.0) states: Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backcasting","kind":"concept","label":"Backcasting","sources":[{"id":"wikipedia.article.backcasting","title":"English Wikipedia article: Backcasting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backcasting"}],"status":"reported","summary":"English Wikipedia (article \"Backcasting\", CC BY-SA 4.0) states: Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.benacerraf-s-identification-problem","kind":"concept","label":"Benacerraf's identification problem","sources":[{"id":"wikipedia.article.benacerraf-s-identification-problem","title":"English Wikipedia article: Benacerraf's identification problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Benacerraf%27s+identification+problem"}],"status":"reported","summary":"English Wikipedia (article \"Benacerraf's identification problem\", CC BY-SA 4.0) states: In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \"What Numbers Could Not Be\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.average-treatment-effect","kind":"concept","label":"Average treatment effect","sources":[{"id":"wikipedia.article.average-treatment-effect","title":"English Wikipedia article: Average treatment effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Average+treatment+effect"}],"status":"reported","summary":"English Wikipedia (article \"Average treatment effect\", CC BY-SA 4.0) states: The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.decolonization-of-knowledge","kind":"concept","label":"Decolonization of knowledge","sources":[{"id":"wikipedia.article.decolonization-of-knowledge","title":"English Wikipedia article: Decolonization of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decolonization+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Decolonization of knowledge\", CC BY-SA 4.0) states: Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.actor-observer-asymmetry","kind":"concept","label":"Actor–observer asymmetry","sources":[{"id":"wikipedia.article.actor-observer-asymmetry","title":"English Wikipedia article: Actor–observer asymmetry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actor%E2%80%93observer+asymmetry"}],"status":"reported","summary":"English Wikipedia (article \"Actor–observer asymmetry\", CC BY-SA 4.0) states: Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.further-research-is-needed","kind":"concept","label":"Further research is needed","sources":[{"id":"wikipedia.article.further-research-is-needed","title":"English Wikipedia article: Further research is needed","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Further+research+is+needed"}],"status":"reported","summary":"English Wikipedia (article \"Further research is needed\", CC BY-SA 4.0) states: \"Further research is needed\" (FRIN), \"more research is needed\" and other variants of similar phrases are commonly used in research papers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analysis-of-competing-hypotheses","kind":"concept","label":"Analysis of competing hypotheses","sources":[{"id":"wikipedia.article.analysis-of-competing-hypotheses","title":"English Wikipedia article: Analysis of competing hypotheses","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analysis+of+competing+hypotheses"}],"status":"reported","summary":"English Wikipedia (article \"Analysis of competing hypotheses\", CC BY-SA 4.0) states: The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.autonomy-of-syntax","kind":"concept","label":"Autonomy of syntax","sources":[{"id":"wikipedia.article.autonomy-of-syntax","title":"English Wikipedia article: Autonomy of syntax","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomy+of+syntax"}],"status":"reported","summary":"English Wikipedia (article \"Autonomy of syntax\", CC BY-SA 4.0) states: In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.android-epistemology","kind":"concept","label":"Android epistemology","sources":[{"id":"wikipedia.article.android-epistemology","title":"English Wikipedia article: Android epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Android+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Android epistemology\", CC BY-SA 4.0) states: Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.always-already","kind":"concept","label":"Always already","sources":[{"id":"wikipedia.article.always-already","title":"English Wikipedia article: Always already","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Always+already"}],"status":"reported","summary":"English Wikipedia (article \"Always already\", CC BY-SA 4.0) states: In philosophy, always already describes the perception of phenomena by the mind of an observer.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherence-theory-of-truth","kind":"concept","label":"Coherence theory of truth","sources":[{"id":"wikipedia.article.coherence-theory-of-truth","title":"English Wikipedia article: Coherence theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherence+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Coherence theory of truth\", CC BY-SA 4.0) states: In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antireductionism","kind":"concept","label":"Antireductionism","sources":[{"id":"wikipedia.article.antireductionism","title":"English Wikipedia article: Antireductionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antireductionism"}],"status":"reported","summary":"English Wikipedia (article \"Antireductionism\", CC BY-SA 4.0) states: Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.clinical-study-design","kind":"concept","label":"Clinical study design","sources":[{"id":"wikipedia.article.clinical-study-design","title":"English Wikipedia article: Clinical study design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clinical+study+design"}],"status":"reported","summary":"English Wikipedia (article \"Clinical study design\", CC BY-SA 4.0) states: Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including epidemiology .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.both-and-reasoning","kind":"concept","label":"Both/and reasoning","sources":[{"id":"wikipedia.article.both-and-reasoning","title":"English Wikipedia article: Both/and reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Both%2Fand+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Both/and reasoning\", CC BY-SA 4.0) states: Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-ad-baculum","kind":"concept","label":"Argumentum ad baculum","sources":[{"id":"wikipedia.article.argumentum-ad-baculum","title":"English Wikipedia article: Argumentum ad baculum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+ad+baculum"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum ad baculum\", CC BY-SA 4.0) states: Argumentum ad baculum (Latin for \"argument to the cudgel\" or \"appeal to the stick\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inventor-s-paradox","kind":"concept","label":"Inventor's paradox","sources":[{"id":"wikipedia.article.inventor-s-paradox","title":"English Wikipedia article: Inventor's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inventor%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Inventor's paradox\", CC BY-SA 4.0) states: The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.canberra-plan","kind":"concept","label":"Canberra Plan","sources":[{"id":"wikipedia.article.canberra-plan","title":"English Wikipedia article: Canberra Plan","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Canberra+Plan"}],"status":"reported","summary":"English Wikipedia (article \"Canberra Plan\", CC BY-SA 4.0) states: In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.axiom-of-reducibility","kind":"concept","label":"Axiom of reducibility","sources":[{"id":"wikipedia.article.axiom-of-reducibility","title":"English Wikipedia article: Axiom of reducibility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiom+of+reducibility"}],"status":"reported","summary":"English Wikipedia (article \"Axiom of reducibility\", CC BY-SA 4.0) states: The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circular-definition","kind":"concept","label":"Circular definition","sources":[{"id":"wikipedia.article.circular-definition","title":"English Wikipedia article: Circular definition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circular+definition"}],"status":"reported","summary":"English Wikipedia (article \"Circular definition\", CC BY-SA 4.0) states: A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defeasibility-linguistics","kind":"concept","label":"Defeasibility (linguistics)","sources":[{"id":"wikipedia.article.defeasibility-linguistics","title":"English Wikipedia article: Defeasibility (linguistics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defeasibility+%28linguistics%29"}],"status":"reported","summary":"English Wikipedia (article \"Defeasibility (linguistics)\", CC BY-SA 4.0) states: In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blockhead-thought-experiment","kind":"concept","label":"Blockhead (thought experiment)","sources":[{"id":"wikipedia.article.blockhead-thought-experiment","title":"English Wikipedia article: Blockhead (thought experiment)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blockhead+%28thought+experiment%29"}],"status":"reported","summary":"English Wikipedia (article \"Blockhead (thought experiment)\", CC BY-SA 4.0) states: Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \"Psychologism and Behaviorism\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bentley-s-paradox","kind":"concept","label":"Bentley's paradox","sources":[{"id":"wikipedia.article.bentley-s-paradox","title":"English Wikipedia article: Bentley's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bentley%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Bentley's paradox\", CC BY-SA 4.0) states: In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecology-of-contexts","kind":"concept","label":"Ecology of contexts","sources":[{"id":"wikipedia.article.ecology-of-contexts","title":"English Wikipedia article: Ecology of contexts","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecology+of+contexts"}],"status":"reported","summary":"English Wikipedia (article \"Ecology of contexts\", CC BY-SA 4.0) states: The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-bias","kind":"concept","label":"Adaptive bias","sources":[{"id":"wikipedia.article.adaptive-bias","title":"English Wikipedia article: Adaptive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive bias\", CC BY-SA 4.0) states: Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.consistent-heuristic","kind":"concept","label":"Consistent heuristic","sources":[{"id":"wikipedia.article.consistent-heuristic","title":"English Wikipedia article: Consistent heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consistent+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Consistent heuristic\", CC BY-SA 4.0) states: In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anfinsen-s-dogma","kind":"concept","label":"Anfinsen's dogma","sources":[{"id":"wikipedia.article.anfinsen-s-dogma","title":"English Wikipedia article: Anfinsen's dogma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anfinsen%27s+dogma"}],"status":"reported","summary":"English Wikipedia (article \"Anfinsen's dogma\", CC BY-SA 4.0) states: Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apoha","kind":"concept","label":"Apoha","sources":[{"id":"wikipedia.article.apoha","title":"English Wikipedia article: Apoha","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apoha"}],"status":"reported","summary":"English Wikipedia (article \"Apoha\", CC BY-SA 4.0) states: Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ambiguity","kind":"concept","label":"Ambiguity","sources":[{"id":"wikipedia.article.ambiguity","title":"English Wikipedia article: Ambiguity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambiguity"}],"status":"reported","summary":"English Wikipedia (article \"Ambiguity\", CC BY-SA 4.0) states: Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherentism","kind":"concept","label":"Coherentism","sources":[{"id":"wikipedia.article.coherentism","title":"English Wikipedia article: Coherentism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherentism"}],"status":"reported","summary":"English Wikipedia (article \"Coherentism\", CC BY-SA 4.0) states: In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antiscience","kind":"concept","label":"Antiscience","sources":[{"id":"wikipedia.article.antiscience","title":"English Wikipedia article: Antiscience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiscience"}],"status":"reported","summary":"English Wikipedia (article \"Antiscience\", CC BY-SA 4.0) states: Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-rupture","kind":"concept","label":"Epistemological rupture","sources":[{"id":"wikipedia.article.epistemological-rupture","title":"English Wikipedia article: Epistemological rupture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+rupture"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological rupture\", CC BY-SA 4.0) states: Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.pragmatic-theory-of-truth","kind":"concept","label":"Pragmatic theory of truth","sources":[{"id":"wikipedia.article.pragmatic-theory-of-truth","title":"English Wikipedia article: Pragmatic theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pragmatic+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Pragmatic theory of truth\", CC BY-SA 4.0) states: A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-closure","kind":"concept","label":"Causal closure","sources":[{"id":"wikipedia.article.causal-closure","title":"English Wikipedia article: Causal closure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+closure"}],"status":"reported","summary":"English Wikipedia (article \"Causal closure\", CC BY-SA 4.0) states: Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explicit-knowledge","kind":"concept","label":"Explicit knowledge","sources":[{"id":"wikipedia.article.explicit-knowledge","title":"English Wikipedia article: Explicit knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explicit+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Explicit knowledge\", CC BY-SA 4.0) states: Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-dissonance","kind":"concept","label":"Cognitive dissonance","sources":[{"id":"wikipedia.article.cognitive-dissonance","title":"English Wikipedia article: Cognitive dissonance","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+dissonance"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive dissonance\", CC BY-SA 4.0) states: In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.case-based-reasoning","kind":"concept","label":"Case-based reasoning","sources":[{"id":"wikipedia.article.case-based-reasoning","title":"English Wikipedia article: Case-based reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Case-based+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Case-based reasoning\", CC BY-SA 4.0) states: Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.generalization","kind":"concept","label":"Generalization","sources":[{"id":"wikipedia.article.generalization","title":"English Wikipedia article: Generalization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Generalization"}],"status":"reported","summary":"English Wikipedia (article \"Generalization\", CC BY-SA 4.0) states: A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-ad-captandum","kind":"concept","label":"Argumentum ad captandum","sources":[{"id":"wikipedia.article.argumentum-ad-captandum","title":"English Wikipedia article: Argumentum ad captandum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+ad+captandum"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum ad captandum\", CC BY-SA 4.0) states: In rhetoric, an argumentum ad captandum, \"for capturing\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.computational-philosophy","kind":"concept","label":"Computational philosophy","sources":[{"id":"wikipedia.article.computational-philosophy","title":"English Wikipedia article: Computational philosophy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computational+philosophy"}],"status":"reported","summary":"English Wikipedia (article \"Computational philosophy\", CC BY-SA 4.0) states: Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.calculus-ratiocinator","kind":"concept","label":"Calculus ratiocinator","sources":[{"id":"wikipedia.article.calculus-ratiocinator","title":"English Wikipedia article: Calculus ratiocinator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus+ratiocinator"}],"status":"reported","summary":"English Wikipedia (article \"Calculus ratiocinator\", CC BY-SA 4.0) states: The calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.issue-based-information-system","kind":"concept","label":"Issue-based information system","sources":[{"id":"wikipedia.article.issue-based-information-system","title":"English Wikipedia article: Issue-based information system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Issue-based+information+system"}],"status":"reported","summary":"English Wikipedia (article \"Issue-based information system\", CC BY-SA 4.0) states: The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-democracy","kind":"concept","label":"Epistemic democracy","sources":[{"id":"wikipedia.article.epistemic-democracy","title":"English Wikipedia article: Epistemic democracy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+democracy"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic democracy\", CC BY-SA 4.0) states: Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.additive-bias","kind":"concept","label":"Additive bias","sources":[{"id":"wikipedia.article.additive-bias","title":"English Wikipedia article: Additive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Additive bias\", CC BY-SA 4.0) states: Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-heuristic","kind":"concept","label":"Constructive heuristic","sources":[{"id":"wikipedia.article.constructive-heuristic","title":"English Wikipedia article: Constructive heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Constructive heuristic\", CC BY-SA 4.0) states: A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chronotope","kind":"concept","label":"Chronotope","sources":[{"id":"wikipedia.article.chronotope","title":"English Wikipedia article: Chronotope","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chronotope"}],"status":"reported","summary":"English Wikipedia (article \"Chronotope\", CC BY-SA 4.0) states: In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appeal-to-the-stone","kind":"concept","label":"Appeal to the stone","sources":[{"id":"wikipedia.article.appeal-to-the-stone","title":"English Wikipedia article: Appeal to the stone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appeal+to+the+stone"}],"status":"reported","summary":"English Wikipedia (article \"Appeal to the stone\", CC BY-SA 4.0) states: Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-synthetic-distinction","kind":"concept","label":"Analytic–synthetic distinction","sources":[{"id":"wikipedia.article.analytic-synthetic-distinction","title":"English Wikipedia article: Analytic–synthetic distinction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic%E2%80%93synthetic+distinction"}],"status":"reported","summary":"English Wikipedia (article \"Analytic–synthetic distinction\", CC BY-SA 4.0) states: The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.conciliationism","kind":"concept","label":"Conciliationism","sources":[{"id":"wikipedia.article.conciliationism","title":"English Wikipedia article: Conciliationism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conciliationism"}],"status":"reported","summary":"English Wikipedia (article \"Conciliationism\", CC BY-SA 4.0) states: Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explanatory-power","kind":"concept","label":"Explanatory power","sources":[{"id":"wikipedia.article.explanatory-power","title":"English Wikipedia article: Explanatory power","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explanatory+power"}],"status":"reported","summary":"English Wikipedia (article \"Explanatory power\", CC BY-SA 4.0) states: Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.redundancy-theory-of-truth","kind":"concept","label":"Redundancy theory of truth","sources":[{"id":"wikipedia.article.redundancy-theory-of-truth","title":"English Wikipedia article: Redundancy theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Redundancy+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Redundancy theory of truth\", CC BY-SA 4.0) states: According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cross-impact-analysis","kind":"concept","label":"Cross impact analysis","sources":[{"id":"wikipedia.article.cross-impact-analysis","title":"English Wikipedia article: Cross impact analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cross+impact+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Cross impact analysis\", CC BY-SA 4.0) states: Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.forbidden-knowledge","kind":"concept","label":"Forbidden knowledge","sources":[{"id":"wikipedia.article.forbidden-knowledge","title":"English Wikipedia article: Forbidden knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Forbidden+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Forbidden knowledge\", CC BY-SA 4.0) states: Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.communal-reinforcement","kind":"concept","label":"Communal reinforcement","sources":[{"id":"wikipedia.article.communal-reinforcement","title":"English Wikipedia article: Communal reinforcement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Communal+reinforcement"}],"status":"reported","summary":"English Wikipedia (article \"Communal reinforcement\", CC BY-SA 4.0) states: Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-reasoning","kind":"concept","label":"Causal reasoning","sources":[{"id":"wikipedia.article.causal-reasoning","title":"English Wikipedia article: Causal reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Causal reasoning\", CC BY-SA 4.0) states: Causal reasoning is the process of identifying causality: the relationship between a cause and its effect.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.imperfect-induction","kind":"concept","label":"Imperfect induction","sources":[{"id":"wikipedia.article.imperfect-induction","title":"English Wikipedia article: Imperfect induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Imperfect+induction"}],"status":"reported","summary":"English Wikipedia (article \"Imperfect induction\", CC BY-SA 4.0) states: Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.conceptual-engineering","kind":"field","label":"Conceptual engineering","sources":[{"id":"wikipedia.article.conceptual-engineering","title":"English Wikipedia article: Conceptual engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conceptual+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Conceptual engineering\", CC BY-SA 4.0) states: Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experiment","kind":"concept","label":"Experiment","sources":[{"id":"wikipedia.article.experiment","title":"English Wikipedia article: Experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experiment"}],"status":"reported","summary":"English Wikipedia (article \"Experiment\", CC BY-SA 4.0) states: An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.braitenberg-vehicle","kind":"concept","label":"Braitenberg vehicle","sources":[{"id":"wikipedia.article.braitenberg-vehicle","title":"English Wikipedia article: Braitenberg vehicle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braitenberg+vehicle"}],"status":"reported","summary":"English Wikipedia (article \"Braitenberg vehicle\", CC BY-SA 4.0) states: A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chinese-room","kind":"concept","label":"Chinese room","sources":[{"id":"wikipedia.article.chinese-room","title":"English Wikipedia article: Chinese room","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chinese+room"}],"status":"reported","summary":"English Wikipedia (article \"Chinese room\", CC BY-SA 4.0) states: The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bracketing-paradox","kind":"concept","label":"Bracketing paradox","sources":[{"id":"wikipedia.article.bracketing-paradox","title":"English Wikipedia article: Bracketing paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bracketing+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Bracketing paradox\", CC BY-SA 4.0) states: In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aesthetic-usability-effect","kind":"concept","label":"Aesthetic–usability effect","sources":[{"id":"wikipedia.article.aesthetic-usability-effect","title":"English Wikipedia article: Aesthetic–usability effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aesthetic%E2%80%93usability+effect"}],"status":"reported","summary":"English Wikipedia (article \"Aesthetic–usability effect\", CC BY-SA 4.0) states: The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contagion-heuristic","kind":"concept","label":"Contagion heuristic","sources":[{"id":"wikipedia.article.contagion-heuristic","title":"English Wikipedia article: Contagion heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contagion+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Contagion heuristic\", CC BY-SA 4.0) states: The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \"contaminated\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.access-consciousness","kind":"concept","label":"Access Consciousness","sources":[{"id":"wikipedia.article.access-consciousness","title":"English Wikipedia article: Access Consciousness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Access+Consciousness"}],"status":"reported","summary":"English Wikipedia (article \"Access Consciousness\", CC BY-SA 4.0) states: Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.augustinian-hypothesis","kind":"concept","label":"Augustinian hypothesis","sources":[{"id":"wikipedia.article.augustinian-hypothesis","title":"English Wikipedia article: Augustinian hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Augustinian+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Augustinian hypothesis\", CC BY-SA 4.0) states: The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.code-talker-paradox","kind":"concept","label":"Code-talker paradox","sources":[{"id":"wikipedia.article.code-talker-paradox","title":"English Wikipedia article: Code-talker paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Code-talker+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Code-talker paradox\", CC BY-SA 4.0) states: A code-talker paradox is a situation in which a language prevents communication.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.applied-epistemology","kind":"concept","label":"Applied epistemology","sources":[{"id":"wikipedia.article.applied-epistemology","title":"English Wikipedia article: Applied epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Applied epistemology\", CC BY-SA 4.0) states: Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anthropic-principle","kind":"concept","label":"Anthropic principle","sources":[{"id":"wikipedia.article.anthropic-principle","title":"English Wikipedia article: Anthropic principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anthropic+principle"}],"status":"reported","summary":"English Wikipedia (article \"Anthropic principle\", CC BY-SA 4.0) states: In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructivism-philosophy-of-science","kind":"concept","label":"Constructivism (philosophy of science)","sources":[{"id":"wikipedia.article.constructivism-philosophy-of-science","title":"English Wikipedia article: Constructivism (philosophy of science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructivism+%28philosophy+of+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Constructivism (philosophy of science)\", CC BY-SA 4.0) states: Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.first-principle","kind":"concept","label":"First principle","sources":[{"id":"wikipedia.article.first-principle","title":"English Wikipedia article: First principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=First+principle"}],"status":"reported","summary":"English Wikipedia (article \"First principle\", CC BY-SA 4.0) states: In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-model","kind":"concept","label":"Causal model","sources":[{"id":"wikipedia.article.causal-model","title":"English Wikipedia article: Causal model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+model"}],"status":"reported","summary":"English Wikipedia (article \"Causal model\", CC BY-SA 4.0) states: In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inductionism","kind":"concept","label":"Inductionism","sources":[{"id":"wikipedia.article.inductionism","title":"English Wikipedia article: Inductionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inductionism"}],"status":"reported","summary":"English Wikipedia (article \"Inductionism\", CC BY-SA 4.0) states: Inductionism is the scientific philosophy where laws are \"induced\" from sets of data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dilemma","kind":"concept","label":"Dilemma","sources":[{"id":"wikipedia.article.dilemma","title":"English Wikipedia article: Dilemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dilemma"}],"status":"reported","summary":"English Wikipedia (article \"Dilemma\", CC BY-SA 4.0) states: A dilemma (from Ancient Greek δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.instrumentalism","kind":"concept","label":"Instrumentalism","sources":[{"id":"wikipedia.article.instrumentalism","title":"English Wikipedia article: Instrumentalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Instrumentalism"}],"status":"reported","summary":"English Wikipedia (article \"Instrumentalism\", CC BY-SA 4.0) states: In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.canonical-form","kind":"concept","label":"Canonical form","sources":[{"id":"wikipedia.article.canonical-form","title":"English Wikipedia article: Canonical form","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Canonical+form"}],"status":"reported","summary":"English Wikipedia (article \"Canonical form\", CC BY-SA 4.0) states: In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.compossibility","kind":"concept","label":"Compossibility","sources":[{"id":"wikipedia.article.compossibility","title":"English Wikipedia article: Compossibility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compossibility"}],"status":"reported","summary":"English Wikipedia (article \"Compossibility\", CC BY-SA 4.0) states: Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.allegory-of-the-cave","kind":"concept","label":"Allegory of the cave","sources":[{"id":"wikipedia.article.allegory-of-the-cave","title":"English Wikipedia article: Allegory of the cave","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Allegory+of+the+cave"}],"status":"reported","summary":"English Wikipedia (article \"Allegory of the cave\", CC BY-SA 4.0) states: The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \"the effect of education (παιδεία) and the lack of it on our nature\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.feminist-epistemology","kind":"concept","label":"Feminist epistemology","sources":[{"id":"wikipedia.article.feminist-epistemology","title":"English Wikipedia article: Feminist epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Feminist+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Feminist epistemology\", CC BY-SA 4.0) states: Feminist epistemology is an examination of epistemology from a feminist standpoint.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apriorism","kind":"concept","label":"Apriorism","sources":[{"id":"wikipedia.article.apriorism","title":"English Wikipedia article: Apriorism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apriorism"}],"status":"reported","summary":"English Wikipedia (article \"Apriorism\", CC BY-SA 4.0) states: Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apperception","kind":"concept","label":"Apperception","sources":[{"id":"wikipedia.article.apperception","title":"English Wikipedia article: Apperception","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apperception"}],"status":"reported","summary":"English Wikipedia (article \"Apperception\", CC BY-SA 4.0) states: Apperception (from the Latin ad-, \"to, toward\" and percipere, \"to perceive, gain, secure, learn, or feel\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contrastivism","kind":"concept","label":"Contrastivism","sources":[{"id":"wikipedia.article.contrastivism","title":"English Wikipedia article: Contrastivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contrastivism"}],"status":"reported","summary":"English Wikipedia (article \"Contrastivism\", CC BY-SA 4.0) states: Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.gestell","kind":"concept","label":"Gestell","sources":[{"id":"wikipedia.article.gestell","title":"English Wikipedia article: Gestell","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gestell"}],"status":"reported","summary":"English Wikipedia (article \"Gestell\", CC BY-SA 4.0) states: Gestell (or Ge-stell, translated as \"Enframing\" or \"positioning\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.semantic-theory-of-truth","kind":"concept","label":"Semantic theory of truth","sources":[{"id":"wikipedia.article.semantic-theory-of-truth","title":"English Wikipedia article: Semantic theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Semantic+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Semantic theory of truth\", CC BY-SA 4.0) states: A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.data-sharing","kind":"concept","label":"Data sharing","sources":[{"id":"wikipedia.article.data-sharing","title":"English Wikipedia article: Data sharing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+sharing"}],"status":"reported","summary":"English Wikipedia (article \"Data sharing\", CC BY-SA 4.0) states: Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.general-knowledge","kind":"concept","label":"General knowledge","sources":[{"id":"wikipedia.article.general-knowledge","title":"English Wikipedia article: General knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=General+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"General knowledge\", CC BY-SA 4.0) states: General knowledge is information that has been accumulated over time through various media and sources.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.credulity","kind":"concept","label":"Credulity","sources":[{"id":"wikipedia.article.credulity","title":"English Wikipedia article: Credulity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Credulity"}],"status":"reported","summary":"English Wikipedia (article \"Credulity\", CC BY-SA 4.0) states: Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circumstantial-evidence","kind":"concept","label":"Circumstantial evidence","sources":[{"id":"wikipedia.article.circumstantial-evidence","title":"English Wikipedia article: Circumstantial evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circumstantial+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Circumstantial evidence\", CC BY-SA 4.0) states: Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.begging-the-question","kind":"concept","label":"Begging the question","sources":[{"id":"wikipedia.article.begging-the-question","title":"English Wikipedia article: Begging the question","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Begging+the+question"}],"status":"reported","summary":"English Wikipedia (article \"Begging the question\", CC BY-SA 4.0) states: In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.thought-experiment","kind":"concept","label":"Thought experiment","sources":[{"id":"wikipedia.article.thought-experiment","title":"English Wikipedia article: Thought experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Thought+experiment"}],"status":"reported","summary":"English Wikipedia (article \"Thought experiment\", CC BY-SA 4.0) states: A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.diairesis","kind":"concept","label":"Diairesis","sources":[{"id":"wikipedia.article.diairesis","title":"English Wikipedia article: Diairesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diairesis"}],"status":"reported","summary":"English Wikipedia (article \"Diairesis\", CC BY-SA 4.0) states: Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \"division\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.conditional-logic","kind":"concept","label":"Conditional logic","sources":[{"id":"wikipedia.article.conditional-logic","title":"English Wikipedia article: Conditional logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conditional+logic"}],"status":"reported","summary":"English Wikipedia (article \"Conditional logic\", CC BY-SA 4.0) states: Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \"if A, (then) B\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.virtue-epistemology","kind":"concept","label":"Virtue epistemology","sources":[{"id":"wikipedia.article.virtue-epistemology","title":"English Wikipedia article: Virtue epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Virtue+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Virtue epistemology\", CC BY-SA 4.0) states: Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.genetic-epistemology","kind":"field","label":"Genetic epistemology","sources":[{"id":"wikipedia.article.genetic-epistemology","title":"English Wikipedia article: Genetic epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Genetic+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Genetic epistemology\", CC BY-SA 4.0) states: Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ambiguity-effect","kind":"concept","label":"Ambiguity effect","sources":[{"id":"wikipedia.article.ambiguity-effect","title":"English Wikipedia article: Ambiguity effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambiguity+effect"}],"status":"reported","summary":"English Wikipedia (article \"Ambiguity effect\", CC BY-SA 4.0) states: The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \"ambiguity\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-type-approach","kind":"concept","label":"Action type approach","sources":[{"id":"wikipedia.article.action-type-approach","title":"English Wikipedia article: Action type approach","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+type+approach"}],"status":"reported","summary":"English Wikipedia (article \"Action type approach\", CC BY-SA 4.0) states: The action type approach is a series of mental exercises—variously described as \"pseudoscientific\", \"empirically challenged\", or a \"neuromyth\"— that purport to increase physical performance in athletes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.concept-horse-paradox","kind":"concept","label":"Concept horse paradox","sources":[{"id":"wikipedia.article.concept-horse-paradox","title":"English Wikipedia article: Concept horse paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Concept+horse+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Concept horse paradox\", CC BY-SA 4.0) states: The concept \"horse\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aristotle-s-theory-of-universals","kind":"concept","label":"Aristotle's theory of universals","sources":[{"id":"wikipedia.article.aristotle-s-theory-of-universals","title":"English Wikipedia article: Aristotle's theory of universals","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aristotle%27s+theory+of+universals"}],"status":"reported","summary":"English Wikipedia (article \"Aristotle's theory of universals\", CC BY-SA 4.0) states: Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appropriation-of-knowledge","kind":"concept","label":"Appropriation of knowledge","sources":[{"id":"wikipedia.article.appropriation-of-knowledge","title":"English Wikipedia article: Appropriation of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appropriation+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Appropriation of knowledge\", CC BY-SA 4.0) states: Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.wikipedia.tarski-s-undefinability-theorem","kind":"theory","label":"Tarski's undefinability theorem","sources":[{"id":"wikipedia.article.tarski-s-undefinability-theorem","title":"English Wikipedia article: Tarski's undefinability theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tarski%27s+undefinability+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Tarski's undefinability theorem\", CC BY-SA 4.0) states: Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.discovery-science","kind":"concept","label":"Discovery science","sources":[{"id":"wikipedia.article.discovery-science","title":"English Wikipedia article: Discovery science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discovery+science"}],"status":"reported","summary":"English Wikipedia (article \"Discovery science\", CC BY-SA 4.0) states: Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-theory-of-reference","kind":"concept","label":"Causal theory of reference","sources":[{"id":"wikipedia.article.causal-theory-of-reference","title":"English Wikipedia article: Causal theory of reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+theory+of+reference"}],"status":"reported","summary":"English Wikipedia (article \"Causal theory of reference\", CC BY-SA 4.0) states: A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.delusion","kind":"concept","label":"Delusion","sources":[{"id":"wikipedia.article.delusion","title":"English Wikipedia article: Delusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Delusion"}],"status":"reported","summary":"English Wikipedia (article \"Delusion\", CC BY-SA 4.0) states: A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.commonsense-reasoning","kind":"concept","label":"Commonsense reasoning","sources":[{"id":"wikipedia.article.commonsense-reasoning","title":"English Wikipedia article: Commonsense reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commonsense+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Commonsense reasoning\", CC BY-SA 4.0) states: In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesian-circle","kind":"concept","label":"Cartesian circle","sources":[{"id":"wikipedia.article.cartesian-circle","title":"English Wikipedia article: Cartesian circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesian+circle"}],"status":"reported","summary":"English Wikipedia (article \"Cartesian circle\", CC BY-SA 4.0) states: The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.closed-concept","kind":"concept","label":"Closed concept","sources":[{"id":"wikipedia.article.closed-concept","title":"English Wikipedia article: Closed concept","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closed+concept"}],"status":"reported","summary":"English Wikipedia (article \"Closed concept\", CC BY-SA 4.0) states: A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","kind":"concept","label":"Contra principia negantem non est disputandum","sources":[{"id":"wikipedia.article.contra-principia-negantem-non-est-disputandum","title":"English Wikipedia article: Contra principia negantem non est disputandum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contra+principia+negantem+non+est+disputandum"}],"status":"reported","summary":"English Wikipedia (article \"Contra principia negantem non est disputandum\", CC BY-SA 4.0) states: Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \"Against one who denies the principles, there can be no debate\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inference-engine","kind":"concept","label":"Inference engine","sources":[{"id":"wikipedia.article.inference-engine","title":"English Wikipedia article: Inference engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inference+engine"}],"status":"reported","summary":"English Wikipedia (article \"Inference engine\", CC BY-SA 4.0) states: In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.functional-fixedness","kind":"concept","label":"Functional fixedness","sources":[{"id":"wikipedia.article.functional-fixedness","title":"English Wikipedia article: Functional fixedness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Functional+fixedness"}],"status":"reported","summary":"English Wikipedia (article \"Functional fixedness\", CC BY-SA 4.0) states: Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deliberative-indispensability-argument","kind":"concept","label":"Deliberative indispensability argument","sources":[{"id":"wikipedia.article.deliberative-indispensability-argument","title":"English Wikipedia article: Deliberative indispensability argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deliberative+indispensability+argument"}],"status":"reported","summary":"English Wikipedia (article \"Deliberative indispensability argument\", CC BY-SA 4.0) states: The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.catu-ko-i","kind":"concept","label":"Catuṣkoṭi","sources":[{"id":"wikipedia.article.catu-ko-i","title":"English Wikipedia article: Catuṣkoṭi","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catu%E1%B9%A3ko%E1%B9%ADi"}],"status":"reported","summary":"English Wikipedia (article \"Catuṣkoṭi\", CC BY-SA 4.0) states: Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-falsification","kind":"concept","label":"Knowledge falsification","sources":[{"id":"wikipedia.article.knowledge-falsification","title":"English Wikipedia article: Knowledge falsification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+falsification"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge falsification\", CC BY-SA 4.0) states: Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anchoring-effect","kind":"concept","label":"Anchoring effect","sources":[{"id":"wikipedia.article.anchoring-effect","title":"English Wikipedia article: Anchoring effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anchoring+effect"}],"status":"reported","summary":"English Wikipedia (article \"Anchoring effect\", CC BY-SA 4.0) states: The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \"anchor\" which can be completely irrelevant.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-science","kind":"concept","label":"Open science","sources":[{"id":"wikipedia.article.open-science","title":"English Wikipedia article: Open science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open+science"}],"status":"reported","summary":"English Wikipedia (article \"Open science\", CC BY-SA 4.0) states: Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cooperative-principle","kind":"concept","label":"Cooperative principle","sources":[{"id":"wikipedia.article.cooperative-principle","title":"English Wikipedia article: Cooperative principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cooperative+principle"}],"status":"reported","summary":"English Wikipedia (article \"Cooperative principle\", CC BY-SA 4.0) states: In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.archimedean-point","kind":"concept","label":"Archimedean point","sources":[{"id":"wikipedia.article.archimedean-point","title":"English Wikipedia article: Archimedean point","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archimedean+point"}],"status":"reported","summary":"English Wikipedia (article \"Archimedean point\", CC BY-SA 4.0) states: An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.critical-realism-philosophy-of-perception","kind":"concept","label":"Critical realism (philosophy of perception)","sources":[{"id":"wikipedia.article.critical-realism-philosophy-of-perception","title":"English Wikipedia article: Critical realism (philosophy of perception)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Critical+realism+%28philosophy+of+perception%29"}],"status":"reported","summary":"English Wikipedia (article \"Critical realism (philosophy of perception)\", CC BY-SA 4.0) states: In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.biological-determinism","kind":"concept","label":"Biological determinism","sources":[{"id":"wikipedia.article.biological-determinism","title":"English Wikipedia article: Biological determinism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biological+determinism"}],"status":"reported","summary":"English Wikipedia (article \"Biological determinism\", CC BY-SA 4.0) states: Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evidence-based-practice","kind":"concept","label":"Evidence-based practice","sources":[{"id":"wikipedia.article.evidence-based-practice","title":"English Wikipedia article: Evidence-based practice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evidence-based+practice"}],"status":"reported","summary":"English Wikipedia (article \"Evidence-based practice\", CC BY-SA 4.0) states: Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.implicit-and-explicit-knowledge","kind":"concept","label":"Implicit and explicit knowledge","sources":[{"id":"wikipedia.article.implicit-and-explicit-knowledge","title":"English Wikipedia article: Implicit and explicit knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Implicit+and+explicit+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Implicit and explicit knowledge\", CC BY-SA 4.0) states: Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dempster-shafer-theory","kind":"concept","label":"Dempster–Shafer theory","sources":[{"id":"wikipedia.article.dempster-shafer-theory","title":"English Wikipedia article: Dempster–Shafer theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dempster%E2%80%93Shafer+theory"}],"status":"reported","summary":"English Wikipedia (article \"Dempster–Shafer theory\", CC BY-SA 4.0) states: The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deductive-reasoning","kind":"concept","label":"Deductive reasoning","sources":[{"id":"wikipedia.article.deductive-reasoning","title":"English Wikipedia article: Deductive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deductive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Deductive reasoning\", CC BY-SA 4.0) states: Deductive reasoning is the process of drawing valid inferences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.category-mistake","kind":"concept","label":"Category mistake","sources":[{"id":"wikipedia.article.category-mistake","title":"English Wikipedia article: Category mistake","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+mistake"}],"status":"reported","summary":"English Wikipedia (article \"Category mistake\", CC BY-SA 4.0) states: A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.javelin-argument","kind":"concept","label":"Javelin argument","sources":[{"id":"wikipedia.article.javelin-argument","title":"English Wikipedia article: Javelin argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Javelin+argument"}],"status":"reported","summary":"English Wikipedia (article \"Javelin argument\", CC BY-SA 4.0) states: The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dialectical-logic","kind":"concept","label":"Dialectical logic","sources":[{"id":"wikipedia.article.dialectical-logic","title":"English Wikipedia article: Dialectical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dialectical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Dialectical logic\", CC BY-SA 4.0) states: Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-texture","kind":"concept","label":"Open texture","sources":[{"id":"wikipedia.article.open-texture","title":"English Wikipedia article: Open texture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open+texture"}],"status":"reported","summary":"English Wikipedia (article \"Open texture\", CC BY-SA 4.0) states: Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \"Verifiability\" to refer to the universal possibility of vagueness in empirical statements.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.comprehension-logic","kind":"concept","label":"Comprehension (logic)","sources":[{"id":"wikipedia.article.comprehension-logic","title":"English Wikipedia article: Comprehension (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Comprehension+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Comprehension (logic)\", CC BY-SA 4.0) states: In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the context of a given discussion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deontic-logic","kind":"concept","label":"Deontic logic","sources":[{"id":"wikipedia.article.deontic-logic","title":"English Wikipedia article: Deontic logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deontic+logic"}],"status":"reported","summary":"English Wikipedia (article \"Deontic logic\", CC BY-SA 4.0) states: Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-hexagon","kind":"concept","label":"Logical hexagon","sources":[{"id":"wikipedia.article.logical-hexagon","title":"English Wikipedia article: Logical hexagon","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+hexagon"}],"status":"reported","summary":"English Wikipedia (article \"Logical hexagon\", CC BY-SA 4.0) states: In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evolutionary-debunking","kind":"concept","label":"Evolutionary debunking","sources":[{"id":"wikipedia.article.evolutionary-debunking","title":"English Wikipedia article: Evolutionary debunking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evolutionary+debunking"}],"status":"reported","summary":"English Wikipedia (article \"Evolutionary debunking\", CC BY-SA 4.0) states: An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.charlesworth-s-paradox","kind":"concept","label":"Charlesworth's paradox","sources":[{"id":"wikipedia.article.charlesworth-s-paradox","title":"English Wikipedia article: Charlesworth's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Charlesworth%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Charlesworth's paradox\", CC BY-SA 4.0) states: Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.best-of-all-possible-worlds","kind":"concept","label":"Best of all possible worlds","sources":[{"id":"wikipedia.article.best-of-all-possible-worlds","title":"English Wikipedia article: Best of all possible worlds","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Best+of+all+possible+worlds"}],"status":"reported","summary":"English Wikipedia (article \"Best of all possible worlds\", CC BY-SA 4.0) states: The phrase \"the best of all possible worlds\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-organization","kind":"concept","label":"Knowledge organization","sources":[{"id":"wikipedia.article.knowledge-organization","title":"English Wikipedia article: Knowledge organization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+organization"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge organization\", CC BY-SA 4.0) states: Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apophenia","kind":"concept","label":"Apophenia","sources":[{"id":"wikipedia.article.apophenia","title":"English Wikipedia article: Apophenia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apophenia"}],"status":"reported","summary":"English Wikipedia (article \"Apophenia\", CC BY-SA 4.0) states: Apophenia () is the tendency to perceive meaningful connections between unrelated things.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.de-se","kind":"concept","label":"De se","sources":[{"id":"wikipedia.article.de-se","title":"English Wikipedia article: De se","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=De+se"}],"status":"reported","summary":"English Wikipedia (article \"De se\", CC BY-SA 4.0) states: De se is Latin for \"of oneself\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \"de dicto and de re\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-synonymy","kind":"concept","label":"Cognitive synonymy","sources":[{"id":"wikipedia.article.cognitive-synonymy","title":"English Wikipedia article: Cognitive synonymy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+synonymy"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive synonymy\", CC BY-SA 4.0) states: Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-illusion","kind":"concept","label":"Argument from illusion","sources":[{"id":"wikipedia.article.argument-from-illusion","title":"English Wikipedia article: Argument from illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+illusion"}],"status":"reported","summary":"English Wikipedia (article \"Argument from illusion\", CC BY-SA 4.0) states: The argument from illusion is an argument for the existence of sense-data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definitionism","kind":"concept","label":"Definitionism","sources":[{"id":"wikipedia.article.definitionism","title":"English Wikipedia article: Definitionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definitionism"}],"status":"reported","summary":"English Wikipedia (article \"Definitionism\", CC BY-SA 4.0) states: Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blue-skies-research","kind":"concept","label":"Blue skies research","sources":[{"id":"wikipedia.article.blue-skies-research","title":"English Wikipedia article: Blue skies research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blue+skies+research"}],"status":"reported","summary":"English Wikipedia (article \"Blue skies research\", CC BY-SA 4.0) states: Blue skies research, also called blue sky science, is scientific research in domains where \"real-world\" applications are not immediately apparent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.trivialism","kind":"concept","label":"Trivialism","sources":[{"id":"wikipedia.article.trivialism","title":"English Wikipedia article: Trivialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Trivialism"}],"status":"reported","summary":"English Wikipedia (article \"Trivialism\", CC BY-SA 4.0) states: Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \"p and not p\" (e.g. the ball is red and not red) are true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimenter-s-regress","kind":"concept","label":"Experimenter's regress","sources":[{"id":"wikipedia.article.experimenter-s-regress","title":"English Wikipedia article: Experimenter's regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimenter%27s+regress"}],"status":"reported","summary":"English Wikipedia (article \"Experimenter's regress\", CC BY-SA 4.0) states: In science, experimenter's regress refers to a loop of dependence between theory and evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cross-sectional-study","kind":"concept","label":"Cross-sectional study","sources":[{"id":"wikipedia.article.cross-sectional-study","title":"English Wikipedia article: Cross-sectional study","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cross-sectional+study"}],"status":"reported","summary":"English Wikipedia (article \"Cross-sectional study\", CC BY-SA 4.0) states: In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inert-knowledge","kind":"concept","label":"Inert knowledge","sources":[{"id":"wikipedia.article.inert-knowledge","title":"English Wikipedia article: Inert knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inert+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Inert knowledge\", CC BY-SA 4.0) states: Inert knowledge is information which one can express but not use.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defeasible-reasoning","kind":"concept","label":"Defeasible reasoning","sources":[{"id":"wikipedia.article.defeasible-reasoning","title":"English Wikipedia article: Defeasible reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defeasible+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Defeasible reasoning\", CC BY-SA 4.0) states: In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.new-riddle-of-induction","kind":"concept","label":"New riddle of induction","sources":[{"id":"wikipedia.article.new-riddle-of-induction","title":"English Wikipedia article: New riddle of induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=New+riddle+of+induction"}],"status":"reported","summary":"English Wikipedia (article \"New riddle of induction\", CC BY-SA 4.0) states: The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circular-reasoning","kind":"concept","label":"Circular reasoning","sources":[{"id":"wikipedia.article.circular-reasoning","title":"English Wikipedia article: Circular reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circular+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Circular reasoning\", CC BY-SA 4.0) states: Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ground-truth","kind":"concept","label":"Ground truth","sources":[{"id":"wikipedia.article.ground-truth","title":"English Wikipedia article: Ground truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ground+truth"}],"status":"reported","summary":"English Wikipedia (article \"Ground truth\", CC BY-SA 4.0) states: Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.material-inference","kind":"concept","label":"Material inference","sources":[{"id":"wikipedia.article.material-inference","title":"English Wikipedia article: Material inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Material+inference"}],"status":"reported","summary":"English Wikipedia (article \"Material inference\", CC BY-SA 4.0) states: In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherent-extrapolated-volition","kind":"concept","label":"Coherent extrapolated volition","sources":[{"id":"wikipedia.article.coherent-extrapolated-volition","title":"English Wikipedia article: Coherent extrapolated volition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherent+extrapolated+volition"}],"status":"reported","summary":"English Wikipedia (article \"Coherent extrapolated volition\", CC BY-SA 4.0) states: Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experience-machine","kind":"concept","label":"Experience machine","sources":[{"id":"wikipedia.article.experience-machine","title":"English Wikipedia article: Experience machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experience+machine"}],"status":"reported","summary":"English Wikipedia (article \"Experience machine\", CC BY-SA 4.0) states: The experience machine or pleasure machine is a thought experiment put forward by philosopher Robert Nozick in his 1974 book Anarchy, State, and Utopia.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chicken-or-the-egg","kind":"concept","label":"Chicken or the egg","sources":[{"id":"wikipedia.article.chicken-or-the-egg","title":"English Wikipedia article: Chicken or the egg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chicken+or+the+egg"}],"status":"reported","summary":"English Wikipedia (article \"Chicken or the egg\", CC BY-SA 4.0) states: The chicken or the egg causality dilemma is commonly stated as the question, \"which came first: the chicken or the egg?\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \"Chicken-and-egg\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attention-inequality","kind":"concept","label":"Attention inequality","sources":[{"id":"wikipedia.article.attention-inequality","title":"English Wikipedia article: Attention inequality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attention+inequality"}],"status":"reported","summary":"English Wikipedia (article \"Attention inequality\", CC BY-SA 4.0) states: Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.preregistration-science","kind":"concept","label":"Preregistration (science)","sources":[{"id":"wikipedia.article.preregistration-science","title":"English Wikipedia article: Preregistration (science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Preregistration+%28science%29"}],"status":"reported","summary":"English Wikipedia (article \"Preregistration (science)\", CC BY-SA 4.0) states: Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bold-hypothesis","kind":"concept","label":"Bold hypothesis","sources":[{"id":"wikipedia.article.bold-hypothesis","title":"English Wikipedia article: Bold hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bold+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Bold hypothesis\", CC BY-SA 4.0) states: Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deconstruction","kind":"concept","label":"Deconstruction","sources":[{"id":"wikipedia.article.deconstruction","title":"English Wikipedia article: Deconstruction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deconstruction"}],"status":"reported","summary":"English Wikipedia (article \"Deconstruction\", CC BY-SA 4.0) states: In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.construct-psychology","kind":"concept","label":"Construct (psychology)","sources":[{"id":"wikipedia.article.construct-psychology","title":"English Wikipedia article: Construct (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Construct+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Construct (psychology)\", CC BY-SA 4.0) states: In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.direct-and-indirect-realism","kind":"concept","label":"Direct and indirect realism","sources":[{"id":"wikipedia.article.direct-and-indirect-realism","title":"English Wikipedia article: Direct and indirect realism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Direct+and+indirect+realism"}],"status":"reported","summary":"English Wikipedia (article \"Direct and indirect realism\", CC BY-SA 4.0) states: In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.boundary-work","kind":"concept","label":"Boundary-work","sources":[{"id":"wikipedia.article.boundary-work","title":"English Wikipedia article: Boundary-work","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boundary-work"}],"status":"reported","summary":"English Wikipedia (article \"Boundary-work\", CC BY-SA 4.0) states: Boundary-work is part of science studies.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.truth-predicate","kind":"concept","label":"Truth predicate","sources":[{"id":"wikipedia.article.truth-predicate","title":"English Wikipedia article: Truth predicate","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Truth+predicate"}],"status":"reported","summary":"English Wikipedia (article \"Truth predicate\", CC BY-SA 4.0) states: In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimentum-crucis","kind":"concept","label":"Experimentum crucis","sources":[{"id":"wikipedia.article.experimentum-crucis","title":"English Wikipedia article: Experimentum crucis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimentum+crucis"}],"status":"reported","summary":"English Wikipedia (article \"Experimentum crucis\", CC BY-SA 4.0) states: In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.diagrammatic-reasoning","kind":"concept","label":"Diagrammatic reasoning","sources":[{"id":"wikipedia.article.diagrammatic-reasoning","title":"English Wikipedia article: Diagrammatic reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diagrammatic+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Diagrammatic reasoning\", CC BY-SA 4.0) states: Diagrammatic reasoning is reasoning by means of visual representations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.reasoning-system","kind":"concept","label":"Reasoning system","sources":[{"id":"wikipedia.article.reasoning-system","title":"English Wikipedia article: Reasoning system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Reasoning+system"}],"status":"reported","summary":"English Wikipedia (article \"Reasoning system\", CC BY-SA 4.0) states: In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logic-of-argumentation","kind":"concept","label":"Logic of argumentation","sources":[{"id":"wikipedia.article.logic-of-argumentation","title":"English Wikipedia article: Logic of argumentation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logic+of+argumentation"}],"status":"reported","summary":"English Wikipedia (article \"Logic of argumentation\", CC BY-SA 4.0) states: The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dissoi-logoi","kind":"concept","label":"Dissoi logoi","sources":[{"id":"wikipedia.article.dissoi-logoi","title":"English Wikipedia article: Dissoi logoi","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dissoi+logoi"}],"status":"reported","summary":"English Wikipedia (article \"Dissoi logoi\", CC BY-SA 4.0) states: The Dissoi logoi (Greek δισσοὶ λόγοι, \"contrasting arguments\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.half-truth","kind":"concept","label":"Half-truth","sources":[{"id":"wikipedia.article.half-truth","title":"English Wikipedia article: Half-truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Half-truth"}],"status":"reported","summary":"English Wikipedia (article \"Half-truth\", CC BY-SA 4.0) states: A half-truth is a deceptive statement that includes some element of truth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.moral-intellectualism","kind":"concept","label":"Moral intellectualism","sources":[{"id":"wikipedia.article.moral-intellectualism","title":"English Wikipedia article: Moral intellectualism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Moral+intellectualism"}],"status":"reported","summary":"English Wikipedia (article \"Moral intellectualism\", CC BY-SA 4.0) states: Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.existential-graph","kind":"concept","label":"Existential graph","sources":[{"id":"wikipedia.article.existential-graph","title":"English Wikipedia article: Existential graph","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Existential+graph"}],"status":"reported","summary":"English Wikipedia (article \"Existential graph\", CC BY-SA 4.0) states: An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.scalar-implicature","kind":"concept","label":"Scalar implicature","sources":[{"id":"wikipedia.article.scalar-implicature","title":"English Wikipedia article: Scalar implicature","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Scalar+implicature"}],"status":"reported","summary":"English Wikipedia (article \"Scalar implicature\", CC BY-SA 4.0) states: In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explanatory-indispensability-argument","kind":"concept","label":"Explanatory indispensability argument","sources":[{"id":"wikipedia.article.explanatory-indispensability-argument","title":"English Wikipedia article: Explanatory indispensability argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explanatory+indispensability+argument"}],"status":"reported","summary":"English Wikipedia (article \"Explanatory indispensability argument\", CC BY-SA 4.0) states: The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bradley-s-regress","kind":"concept","label":"Bradley's regress","sources":[{"id":"wikipedia.article.bradley-s-regress","title":"English Wikipedia article: Bradley's regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bradley%27s+regress"}],"status":"reported","summary":"English Wikipedia (article \"Bradley's regress\", CC BY-SA 4.0) states: Bradley's regress is a philosophical problem concerning the nature of relations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.theory-ladenness","kind":"concept","label":"Theory-ladenness","sources":[{"id":"wikipedia.article.theory-ladenness","title":"English Wikipedia article: Theory-ladenness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Theory-ladenness"}],"status":"reported","summary":"English Wikipedia (article \"Theory-ladenness\", CC BY-SA 4.0) states: In philosophy of science, an observation is said to be \"theory-laden\" when shaped by the investigator's theoretical presuppositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.science-and-technology-studies","kind":"concept","label":"Science and technology studies","sources":[{"id":"wikipedia.article.science-and-technology-studies","title":"English Wikipedia article: Science and technology studies","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Science+and+technology+studies"}],"status":"reported","summary":"English Wikipedia (article \"Science and technology studies\", CC BY-SA 4.0) states: Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definite-description","kind":"concept","label":"Definite description","sources":[{"id":"wikipedia.article.definite-description","title":"English Wikipedia article: Definite description","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definite+description"}],"status":"reported","summary":"English Wikipedia (article \"Definite description\", CC BY-SA 4.0) states: In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \"the X\" where X is a noun-phrase or a singular common noun.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructivism-philosophy-of-mathematics","kind":"concept","label":"Constructivism (philosophy of mathematics)","sources":[{"id":"wikipedia.article.constructivism-philosophy-of-mathematics","title":"English Wikipedia article: Constructivism (philosophy of mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructivism+%28philosophy+of+mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Constructivism (philosophy of mathematics)\", CC BY-SA 4.0) states: In philosophy of mathematics, constructivism asserts that it is necessary to find (or \"construct\") a specific example of a mathematical object in order to prove that an example exists.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.truthmaker-theory","kind":"field","label":"Truthmaker theory","sources":[{"id":"wikipedia.article.truthmaker-theory","title":"English Wikipedia article: Truthmaker theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Truthmaker+theory"}],"status":"reported","summary":"English Wikipedia (article \"Truthmaker theory\", CC BY-SA 4.0) states: Truthmaker theory is \"the branch of metaphysics that explores the relationships between what is true and what exists\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.interdisciplinarity","kind":"concept","label":"Interdisciplinarity","sources":[{"id":"wikipedia.article.interdisciplinarity","title":"English Wikipedia article: Interdisciplinarity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Interdisciplinarity"}],"status":"reported","summary":"English Wikipedia (article \"Interdisciplinarity\", CC BY-SA 4.0) states: Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.disquotational-principle","kind":"concept","label":"Disquotational principle","sources":[{"id":"wikipedia.article.disquotational-principle","title":"English Wikipedia article: Disquotational principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disquotational+principle"}],"status":"reported","summary":"English Wikipedia (article \"Disquotational principle\", CC BY-SA 4.0) states: The disquotational principle is a philosophical principle which holds that a rational speaker will accept \"p\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dysrationalia","kind":"concept","label":"Dysrationalia","sources":[{"id":"wikipedia.article.dysrationalia","title":"English Wikipedia article: Dysrationalia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dysrationalia"}],"status":"reported","summary":"English Wikipedia (article \"Dysrationalia\", CC BY-SA 4.0) states: Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rule-induction","kind":"concept","label":"Rule induction","sources":[{"id":"wikipedia.article.rule-induction","title":"English Wikipedia article: Rule induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rule+induction"}],"status":"reported","summary":"English Wikipedia (article \"Rule induction\", CC BY-SA 4.0) states: Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-form","kind":"concept","label":"Logical form","sources":[{"id":"wikipedia.article.logical-form","title":"English Wikipedia article: Logical form","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+form"}],"status":"reported","summary":"English Wikipedia (article \"Logical form\", CC BY-SA 4.0) states: In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.engaged-theory","kind":"concept","label":"Engaged theory","sources":[{"id":"wikipedia.article.engaged-theory","title":"English Wikipedia article: Engaged theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engaged+theory"}],"status":"reported","summary":"English Wikipedia (article \"Engaged theory\", CC BY-SA 4.0) states: Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contingency-philosophy","kind":"concept","label":"Contingency (philosophy)","sources":[{"id":"wikipedia.article.contingency-philosophy","title":"English Wikipedia article: Contingency (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contingency+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Contingency (philosophy)\", CC BY-SA 4.0) states: In logic, contingency is the feature of a statement making it neither necessary nor impossible.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fallacy","kind":"concept","label":"Fallacy","sources":[{"id":"wikipedia.article.fallacy","title":"English Wikipedia article: Fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Fallacy\", CC BY-SA 4.0) states: A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.square-of-opposition","kind":"concept","label":"Square of opposition","sources":[{"id":"wikipedia.article.square-of-opposition","title":"English Wikipedia article: Square of opposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Square+of+opposition"}],"status":"reported","summary":"English Wikipedia (article \"Square of opposition\", CC BY-SA 4.0) states: In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.insight-phenomenology","kind":"concept","label":"Insight phenomenology","sources":[{"id":"wikipedia.article.insight-phenomenology","title":"English Wikipedia article: Insight phenomenology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Insight+phenomenology"}],"status":"reported","summary":"English Wikipedia (article \"Insight phenomenology\", CC BY-SA 4.0) states: Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.generality-psychology","kind":"concept","label":"Generality (psychology)","sources":[{"id":"wikipedia.article.generality-psychology","title":"English Wikipedia article: Generality (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Generality+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Generality (psychology)\", CC BY-SA 4.0) states: In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.consciousness-causes-collapse","kind":"concept","label":"Consciousness causes collapse","sources":[{"id":"wikipedia.article.consciousness-causes-collapse","title":"English Wikipedia article: Consciousness causes collapse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consciousness+causes+collapse"}],"status":"reported","summary":"English Wikipedia (article \"Consciousness causes collapse\", CC BY-SA 4.0) states: The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.social-constructionism","kind":"concept","label":"Social constructionism","sources":[{"id":"wikipedia.article.social-constructionism","title":"English Wikipedia article: Social constructionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Social+constructionism"}],"status":"reported","summary":"English Wikipedia (article \"Social constructionism\", CC BY-SA 4.0) states: Social constructionism is a term used in sociology, social ontology, and communication theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attribute-substitution","kind":"concept","label":"Attribute substitution","sources":[{"id":"wikipedia.article.attribute-substitution","title":"English Wikipedia article: Attribute substitution","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attribute+substitution"}],"status":"reported","summary":"English Wikipedia (article \"Attribute substitution\", CC BY-SA 4.0) states: Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denotation","kind":"concept","label":"Denotation","sources":[{"id":"wikipedia.article.denotation","title":"English Wikipedia article: Denotation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denotation"}],"status":"reported","summary":"English Wikipedia (article \"Denotation\", CC BY-SA 4.0) states: In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.authority-of-the-bootmaker","kind":"concept","label":"Authority of the bootmaker","sources":[{"id":"wikipedia.article.authority-of-the-bootmaker","title":"English Wikipedia article: Authority of the bootmaker","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Authority+of+the+bootmaker"}],"status":"reported","summary":"English Wikipedia (article \"Authority of the bootmaker\", CC BY-SA 4.0) states: Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fringe-science","kind":"concept","label":"Fringe science","sources":[{"id":"wikipedia.article.fringe-science","title":"English Wikipedia article: Fringe science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fringe+science"}],"status":"reported","summary":"English Wikipedia (article \"Fringe science\", CC BY-SA 4.0) states: Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.doctrine","kind":"concept","label":"Doctrine","sources":[{"id":"wikipedia.article.doctrine","title":"English Wikipedia article: Doctrine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Doctrine"}],"status":"reported","summary":"English Wikipedia (article \"Doctrine\", CC BY-SA 4.0) states: Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.emotional-reasoning","kind":"concept","label":"Emotional reasoning","sources":[{"id":"wikipedia.article.emotional-reasoning","title":"English Wikipedia article: Emotional reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Emotional+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Emotional reasoning\", CC BY-SA 4.0) states: Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rule-of-succession","kind":"concept","label":"Rule of succession","sources":[{"id":"wikipedia.article.rule-of-succession","title":"English Wikipedia article: Rule of succession","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rule+of+succession"}],"status":"reported","summary":"English Wikipedia (article \"Rule of succession\", CC BY-SA 4.0) states: In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correlative-based-fallacies","kind":"concept","label":"Correlative-based fallacies","sources":[{"id":"wikipedia.article.correlative-based-fallacies","title":"English Wikipedia article: Correlative-based fallacies","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correlative-based+fallacies"}],"status":"reported","summary":"English Wikipedia (article \"Correlative-based fallacies\", CC BY-SA 4.0) states: In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.loki-s-wager","kind":"concept","label":"Loki's wager","sources":[{"id":"wikipedia.article.loki-s-wager","title":"English Wikipedia article: Loki's wager","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Loki%27s+wager"}],"status":"reported","summary":"English Wikipedia (article \"Loki's wager\", CC BY-SA 4.0) states: Loki's wager is the insistence that because two or more categories exist as poles on a spectrum with a grey area in the middle, the distinction between the two cannot be defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimental-philosophy","kind":"concept","label":"Experimental philosophy","sources":[{"id":"wikipedia.article.experimental-philosophy","title":"English Wikipedia article: Experimental philosophy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimental+philosophy"}],"status":"reported","summary":"English Wikipedia (article \"Experimental philosophy\", CC BY-SA 4.0) states: Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.radical-empiricism","kind":"concept","label":"Radical empiricism","sources":[{"id":"wikipedia.article.radical-empiricism","title":"English Wikipedia article: Radical empiricism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Radical+empiricism"}],"status":"reported","summary":"English Wikipedia (article \"Radical empiricism\", CC BY-SA 4.0) states: Radical empiricism is a philosophical doctrine put forward by William James.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.decidability-logic","kind":"concept","label":"Decidability (logic)","sources":[{"id":"wikipedia.article.decidability-logic","title":"English Wikipedia article: Decidability (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decidability+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Decidability (logic)\", CC BY-SA 4.0) states: In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fitch-notation","kind":"concept","label":"Fitch notation","sources":[{"id":"wikipedia.article.fitch-notation","title":"English Wikipedia article: Fitch notation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fitch+notation"}],"status":"reported","summary":"English Wikipedia (article \"Fitch notation\", CC BY-SA 4.0) states: Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.counterfactual-conditional","kind":"concept","label":"Counterfactual conditional","sources":[{"id":"wikipedia.article.counterfactual-conditional","title":"English Wikipedia article: Counterfactual conditional","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Counterfactual+conditional"}],"status":"reported","summary":"English Wikipedia (article \"Counterfactual conditional\", CC BY-SA 4.0) states: Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.clinamen","kind":"concept","label":"Clinamen","sources":[{"id":"wikipedia.article.clinamen","title":"English Wikipedia article: Clinamen","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clinamen"}],"status":"reported","summary":"English Wikipedia (article \"Clinamen\", CC BY-SA 4.0) states: Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.social-constructivism","kind":"concept","label":"Social constructivism","sources":[{"id":"wikipedia.article.social-constructivism","title":"English Wikipedia article: Social constructivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Social+constructivism"}],"status":"reported","summary":"English Wikipedia (article \"Social constructivism\", CC BY-SA 4.0) states: Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attribution-psychology","kind":"concept","label":"Attribution (psychology)","sources":[{"id":"wikipedia.article.attribution-psychology","title":"English Wikipedia article: Attribution (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attribution+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Attribution (psychology)\", CC BY-SA 4.0) states: Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-hermeneutic","kind":"concept","label":"Double hermeneutic","sources":[{"id":"wikipedia.article.double-hermeneutic","title":"English Wikipedia article: Double hermeneutic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+hermeneutic"}],"status":"reported","summary":"English Wikipedia (article \"Double hermeneutic\", CC BY-SA 4.0) states: The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \"lay\" concepts and those from the social sciences have a two-way relationship.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.basic-belief","kind":"concept","label":"Basic belief","sources":[{"id":"wikipedia.article.basic-belief","title":"English Wikipedia article: Basic belief","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basic+belief"}],"status":"reported","summary":"English Wikipedia (article \"Basic belief\", CC BY-SA 4.0) states: Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism, the axioms of a belief system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-science","kind":"concept","label":"Design science","sources":[{"id":"wikipedia.article.design-science","title":"English Wikipedia article: Design science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+science"}],"status":"reported","summary":"English Wikipedia (article \"Design science\", CC BY-SA 4.0) states: Design science refers to a scientific, i.e. rational and systematic, approach to designing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coincidence","kind":"concept","label":"Coincidence","sources":[{"id":"wikipedia.article.coincidence","title":"English Wikipedia article: Coincidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coincidence"}],"status":"reported","summary":"English Wikipedia (article \"Coincidence\", CC BY-SA 4.0) states: A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.intertwingularity","kind":"concept","label":"Intertwingularity","sources":[{"id":"wikipedia.article.intertwingularity","title":"English Wikipedia article: Intertwingularity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Intertwingularity"}],"status":"reported","summary":"English Wikipedia (article \"Intertwingularity\", CC BY-SA 4.0) states: Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.doxastic-logic","kind":"concept","label":"Doxastic logic","sources":[{"id":"wikipedia.article.doxastic-logic","title":"English Wikipedia article: Doxastic logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Doxastic+logic"}],"status":"reported","summary":"English Wikipedia (article \"Doxastic logic\", CC BY-SA 4.0) states: Doxastic logic is a type of logic concerned with reasoning about beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.courtier-s-reply","kind":"concept","label":"Courtier's reply","sources":[{"id":"wikipedia.article.courtier-s-reply","title":"English Wikipedia article: Courtier's reply","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Courtier%27s+reply"}],"status":"reported","summary":"English Wikipedia (article \"Courtier's reply\", CC BY-SA 4.0) states: The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-map","kind":"concept","label":"Argument map","sources":[{"id":"wikipedia.article.argument-map","title":"English Wikipedia article: Argument map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+map"}],"status":"reported","summary":"English Wikipedia (article \"Argument map\", CC BY-SA 4.0) states: An argument map or argument diagram is a visual representation of the structure of an argument.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.feminist-post-structuralist-discourse-analysis","kind":"concept","label":"Feminist post-structuralist discourse analysis","sources":[{"id":"wikipedia.article.feminist-post-structuralist-discourse-analysis","title":"English Wikipedia article: Feminist post-structuralist discourse analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Feminist+post-structuralist+discourse+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Feminist post-structuralist discourse analysis\", CC BY-SA 4.0) states: Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.sense-data","kind":"concept","label":"Sense data","sources":[{"id":"wikipedia.article.sense-data","title":"English Wikipedia article: Sense data","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sense+data"}],"status":"reported","summary":"English Wikipedia (article \"Sense data\", CC BY-SA 4.0) states: The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.free-choice-inference","kind":"concept","label":"Free choice inference","sources":[{"id":"wikipedia.article.free-choice-inference","title":"English Wikipedia article: Free choice inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Free+choice+inference"}],"status":"reported","summary":"English Wikipedia (article \"Free choice inference\", CC BY-SA 4.0) states: Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-inertia","kind":"concept","label":"Knowledge inertia","sources":[{"id":"wikipedia.article.knowledge-inertia","title":"English Wikipedia article: Knowledge inertia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+inertia"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge inertia\", CC BY-SA 4.0) states: Knowledge inertia (KI) is a concept in knowledge management.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.frankfurt-cases","kind":"concept","label":"Frankfurt cases","sources":[{"id":"wikipedia.article.frankfurt-cases","title":"English Wikipedia article: Frankfurt cases","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Frankfurt+cases"}],"status":"reported","summary":"English Wikipedia (article \"Frankfurt cases\", CC BY-SA 4.0) states: Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.gunslinger-effect","kind":"concept","label":"Gunslinger effect","sources":[{"id":"wikipedia.article.gunslinger-effect","title":"English Wikipedia article: Gunslinger effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gunslinger+effect"}],"status":"reported","summary":"English Wikipedia (article \"Gunslinger effect\", CC BY-SA 4.0) states: The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.discourse-ethics","kind":"concept","label":"Discourse ethics","sources":[{"id":"wikipedia.article.discourse-ethics","title":"English Wikipedia article: Discourse ethics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discourse+ethics"}],"status":"reported","summary":"English Wikipedia (article \"Discourse ethics\", CC BY-SA 4.0) states: Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.duck-test","kind":"concept","label":"Duck test","sources":[{"id":"wikipedia.article.duck-test","title":"English Wikipedia article: Duck test","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Duck+test"}],"status":"reported","summary":"English Wikipedia (article \"Duck test\", CC BY-SA 4.0) states: The duck test is a frequently cited colloquial example of abductive reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.the-central-science","kind":"concept","label":"The central science","sources":[{"id":"wikipedia.article.the-central-science","title":"English Wikipedia article: The central science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=The+central+science"}],"status":"reported","summary":"English Wikipedia (article \"The central science\", CC BY-SA 4.0) states: Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.overdetermination","kind":"concept","label":"Overdetermination","sources":[{"id":"wikipedia.article.overdetermination","title":"English Wikipedia article: Overdetermination","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Overdetermination"}],"status":"reported","summary":"English Wikipedia (article \"Overdetermination\", CC BY-SA 4.0) states: Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\"determine\") the effect.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.graphism-thesis","kind":"concept","label":"Graphism thesis","sources":[{"id":"wikipedia.article.graphism-thesis","title":"English Wikipedia article: Graphism thesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Graphism+thesis"}],"status":"reported","summary":"English Wikipedia (article \"Graphism thesis\", CC BY-SA 4.0) states: In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constant-conjunction","kind":"concept","label":"Constant conjunction","sources":[{"id":"wikipedia.article.constant-conjunction","title":"English Wikipedia article: Constant conjunction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constant+conjunction"}],"status":"reported","summary":"English Wikipedia (article \"Constant conjunction\", CC BY-SA 4.0) states: In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.theory","kind":"concept","label":"Theory","sources":[{"id":"wikipedia.article.theory","title":"English Wikipedia article: Theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Theory"}],"status":"reported","summary":"English Wikipedia (article \"Theory\", CC BY-SA 4.0) states: A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denying-the-correlative","kind":"concept","label":"Denying the correlative","sources":[{"id":"wikipedia.article.denying-the-correlative","title":"English Wikipedia article: Denying the correlative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denying+the+correlative"}],"status":"reported","summary":"English Wikipedia (article \"Denying the correlative\", CC BY-SA 4.0) states: The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.nothing-to-hide-argument","kind":"concept","label":"Nothing to hide argument","sources":[{"id":"wikipedia.article.nothing-to-hide-argument","title":"English Wikipedia article: Nothing to hide argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Nothing+to+hide+argument"}],"status":"reported","summary":"English Wikipedia (article \"Nothing to hide argument\", CC BY-SA 4.0) states: The \"nothing to hide\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.hermeneutics","kind":"field","label":"Hermeneutics","sources":[{"id":"wikipedia.article.hermeneutics","title":"English Wikipedia article: Hermeneutics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hermeneutics"}],"status":"reported","summary":"English Wikipedia (article \"Hermeneutics\", CC BY-SA 4.0) states: Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definition","kind":"concept","label":"Definition","sources":[{"id":"wikipedia.article.definition","title":"English Wikipedia article: Definition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definition"}],"status":"reported","summary":"English Wikipedia (article \"Definition\", CC BY-SA 4.0) states: A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.game-semantics","kind":"concept","label":"Game semantics","sources":[{"id":"wikipedia.article.game-semantics","title":"English Wikipedia article: Game semantics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Game+semantics"}],"status":"reported","summary":"English Wikipedia (article \"Game semantics\", CC BY-SA 4.0) states: Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.veridicality","kind":"concept","label":"Veridicality","sources":[{"id":"wikipedia.article.veridicality","title":"English Wikipedia article: Veridicality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Veridicality"}],"status":"reported","summary":"English Wikipedia (article \"Veridicality\", CC BY-SA 4.0) states: In linguistics, veridicality (from Latin \"truthfully said\") is a semantic or grammatical assertion of the truth of an utterance.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.lazy-argument","kind":"concept","label":"Lazy argument","sources":[{"id":"wikipedia.article.lazy-argument","title":"English Wikipedia article: Lazy argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Lazy+argument"}],"status":"reported","summary":"English Wikipedia (article \"Lazy argument\", CC BY-SA 4.0) states: The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epicurean-paradox","kind":"concept","label":"Epicurean paradox","sources":[{"id":"wikipedia.article.epicurean-paradox","title":"English Wikipedia article: Epicurean paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epicurean+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Epicurean paradox\", CC BY-SA 4.0) states: The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-measures","kind":"concept","label":"Approximate measures","sources":[{"id":"wikipedia.article.approximate-measures","title":"English Wikipedia article: Approximate measures","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+measures"}],"status":"reported","summary":"English Wikipedia (article \"Approximate measures\", CC BY-SA 4.0) states: Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.sociology-of-absences","kind":"concept","label":"Sociology of absences","sources":[{"id":"wikipedia.article.sociology-of-absences","title":"English Wikipedia article: Sociology of absences","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sociology+of+absences"}],"status":"reported","summary":"English Wikipedia (article \"Sociology of absences\", CC BY-SA 4.0) states: The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.authority-bias","kind":"concept","label":"Authority bias","sources":[{"id":"wikipedia.article.authority-bias","title":"English Wikipedia article: Authority bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Authority+bias"}],"status":"reported","summary":"English Wikipedia (article \"Authority bias\", CC BY-SA 4.0) states: Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.science-of-science-policy","kind":"concept","label":"Science of science policy","sources":[{"id":"wikipedia.article.science-of-science-policy","title":"English Wikipedia article: Science of science policy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Science+of+science+policy"}],"status":"reported","summary":"English Wikipedia (article \"Science of science policy\", CC BY-SA 4.0) states: Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-articulation","kind":"concept","label":"Double articulation","sources":[{"id":"wikipedia.article.double-articulation","title":"English Wikipedia article: Double articulation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+articulation"}],"status":"reported","summary":"English Wikipedia (article \"Double articulation\", CC BY-SA 4.0) states: In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief","kind":"concept","label":"Belief","sources":[{"id":"wikipedia.article.belief","title":"English Wikipedia article: Belief","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief"}],"status":"reported","summary":"English Wikipedia (article \"Belief\", CC BY-SA 4.0) states: A belief is a subjective attitude that something is true or a state of affairs is the case.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemicism","kind":"concept","label":"Epistemicism","sources":[{"id":"wikipedia.article.epistemicism","title":"English Wikipedia article: Epistemicism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemicism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemicism\", CC BY-SA 4.0) states: Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.research-program","kind":"concept","label":"Research program","sources":[{"id":"wikipedia.article.research-program","title":"English Wikipedia article: Research program","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Research+program"}],"status":"reported","summary":"English Wikipedia (article \"Research program\", CC BY-SA 4.0) states: A research program (British English: research programme) is a professional network of scientists conducting basic research.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.harking","kind":"concept","label":"HARKing","sources":[{"id":"wikipedia.article.harking","title":"English Wikipedia article: HARKing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=HARKing"}],"status":"reported","summary":"English Wikipedia (article \"HARKing\", CC BY-SA 4.0) states: HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-based-research","kind":"concept","label":"Design-based research","sources":[{"id":"wikipedia.article.design-based-research","title":"English Wikipedia article: Design-based research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design-based+research"}],"status":"reported","summary":"English Wikipedia (article \"Design-based research\", CC BY-SA 4.0) states: Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.end-of-history-illusion","kind":"concept","label":"End-of-history illusion","sources":[{"id":"wikipedia.article.end-of-history-illusion","title":"English Wikipedia article: End-of-history illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=End-of-history+illusion"}],"status":"reported","summary":"English Wikipedia (article \"End-of-history illusion\", CC BY-SA 4.0) states: The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.turkey-illusion","kind":"concept","label":"Turkey illusion","sources":[{"id":"wikipedia.article.turkey-illusion","title":"English Wikipedia article: Turkey illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turkey+illusion"}],"status":"reported","summary":"English Wikipedia (article \"Turkey illusion\", CC BY-SA 4.0) states: Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.distinction-without-a-difference","kind":"concept","label":"Distinction without a difference","sources":[{"id":"wikipedia.article.distinction-without-a-difference","title":"English Wikipedia article: Distinction without a difference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distinction+without+a+difference"}],"status":"reported","summary":"English Wikipedia (article \"Distinction without a difference\", CC BY-SA 4.0) states: A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.objection-argument","kind":"concept","label":"Objection (argument)","sources":[{"id":"wikipedia.article.objection-argument","title":"English Wikipedia article: Objection (argument)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Objection+%28argument%29"}],"status":"reported","summary":"English Wikipedia (article \"Objection (argument)\", CC BY-SA 4.0) states: In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-truth","kind":"concept","label":"Logical truth","sources":[{"id":"wikipedia.article.logical-truth","title":"English Wikipedia article: Logical truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+truth"}],"status":"reported","summary":"English Wikipedia (article \"Logical truth\", CC BY-SA 4.0) states: Logical truth is one of the most fundamental concepts in logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.geometry-of-interaction","kind":"concept","label":"Geometry of interaction","sources":[{"id":"wikipedia.article.geometry-of-interaction","title":"English Wikipedia article: Geometry of interaction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometry+of+interaction"}],"status":"reported","summary":"English Wikipedia (article \"Geometry of interaction\", CC BY-SA 4.0) states: In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-finding","kind":"concept","label":"Problem finding","sources":[{"id":"wikipedia.article.problem-finding","title":"English Wikipedia article: Problem finding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+finding"}],"status":"reported","summary":"English Wikipedia (article \"Problem finding\", CC BY-SA 4.0) states: Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.standpoint-feminism","kind":"concept","label":"Standpoint feminism","sources":[{"id":"wikipedia.article.standpoint-feminism","title":"English Wikipedia article: Standpoint feminism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Standpoint+feminism"}],"status":"reported","summary":"English Wikipedia (article \"Standpoint feminism\", CC BY-SA 4.0) states: Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.automation-bias","kind":"concept","label":"Automation bias","sources":[{"id":"wikipedia.article.automation-bias","title":"English Wikipedia article: Automation bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automation+bias"}],"status":"reported","summary":"English Wikipedia (article \"Automation bias\", CC BY-SA 4.0) states: Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fudge-factor","kind":"concept","label":"Fudge factor","sources":[{"id":"wikipedia.article.fudge-factor","title":"English Wikipedia article: Fudge factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fudge+factor"}],"status":"reported","summary":"English Wikipedia (article \"Fudge factor\", CC BY-SA 4.0) states: A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.scientometrics","kind":"field","label":"Scientometrics","sources":[{"id":"wikipedia.article.scientometrics","title":"English Wikipedia article: Scientometrics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Scientometrics"}],"status":"reported","summary":"English Wikipedia (article \"Scientometrics\", CC BY-SA 4.0) states: Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dynamic-semantics","kind":"concept","label":"Dynamic semantics","sources":[{"id":"wikipedia.article.dynamic-semantics","title":"English Wikipedia article: Dynamic semantics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dynamic+semantics"}],"status":"reported","summary":"English Wikipedia (article \"Dynamic semantics\", CC BY-SA 4.0) states: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-insight","kind":"concept","label":"Epistemic insight","sources":[{"id":"wikipedia.article.epistemic-insight","title":"English Wikipedia article: Epistemic insight","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+insight"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic insight\", CC BY-SA 4.0) states: Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.binary-opposition","kind":"concept","label":"Binary opposition","sources":[{"id":"wikipedia.article.binary-opposition","title":"English Wikipedia article: Binary opposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Binary+opposition"}],"status":"reported","summary":"English Wikipedia (article \"Binary opposition\", CC BY-SA 4.0) states: A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-idealism","kind":"concept","label":"Epistemological idealism","sources":[{"id":"wikipedia.article.epistemological-idealism","title":"English Wikipedia article: Epistemological idealism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+idealism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological idealism\", CC BY-SA 4.0) states: Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.simple-philosophy","kind":"concept","label":"Simple (philosophy)","sources":[{"id":"wikipedia.article.simple-philosophy","title":"English Wikipedia article: Simple (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Simple+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Simple (philosophy)\", CC BY-SA 4.0) states: In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cosmological-argument","kind":"concept","label":"Cosmological argument","sources":[{"id":"wikipedia.article.cosmological-argument","title":"English Wikipedia article: Cosmological argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cosmological+argument"}],"status":"reported","summary":"English Wikipedia (article \"Cosmological argument\", CC BY-SA 4.0) states: In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.irrationality","kind":"concept","label":"Irrationality","sources":[{"id":"wikipedia.article.irrationality","title":"English Wikipedia article: Irrationality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Irrationality"}],"status":"reported","summary":"English Wikipedia (article \"Irrationality\", CC BY-SA 4.0) states: Irrationality is cognition, thinking, talking, or acting without rationality.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-counting-fallacy","kind":"concept","label":"Double counting (fallacy)","sources":[{"id":"wikipedia.article.double-counting-fallacy","title":"English Wikipedia article: Double counting (fallacy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+counting+%28fallacy%29"}],"status":"reported","summary":"English Wikipedia (article \"Double counting (fallacy)\", CC BY-SA 4.0) states: Double counting is a fallacy in reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-solving-environment","kind":"concept","label":"Problem solving environment","sources":[{"id":"wikipedia.article.problem-solving-environment","title":"English Wikipedia article: Problem solving environment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+solving+environment"}],"status":"reported","summary":"English Wikipedia (article \"Problem solving environment\", CC BY-SA 4.0) states: A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aporia","kind":"concept","label":"Aporia","sources":[{"id":"wikipedia.article.aporia","title":"English Wikipedia article: Aporia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aporia"}],"status":"reported","summary":"English Wikipedia (article \"Aporia\", CC BY-SA 4.0) states: In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\"lacking passage\", also: \"impasse\", \"difficulty in passage\", \"puzzlement\"') is a conundrum or state of puzzlement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dysteleology","kind":"concept","label":"Dysteleology","sources":[{"id":"wikipedia.article.dysteleology","title":"English Wikipedia article: Dysteleology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dysteleology"}],"status":"reported","summary":"English Wikipedia (article \"Dysteleology\", CC BY-SA 4.0) states: Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.testimony","kind":"concept","label":"Testimony","sources":[{"id":"wikipedia.article.testimony","title":"English Wikipedia article: Testimony","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Testimony"}],"status":"reported","summary":"English Wikipedia (article \"Testimony\", CC BY-SA 4.0) states: Testimony is a solemn attestation as to the truth of a situation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.availability-heuristic","kind":"concept","label":"Availability heuristic","sources":[{"id":"wikipedia.article.availability-heuristic","title":"English Wikipedia article: Availability heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Availability heuristic\", CC BY-SA 4.0) states: The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blind-men-and-an-elephant","kind":"concept","label":"Blind men and an elephant","sources":[{"id":"wikipedia.article.blind-men-and-an-elephant","title":"English Wikipedia article: Blind men and an elephant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blind+men+and+an+elephant"}],"status":"reported","summary":"English Wikipedia (article \"Blind men and an elephant\", CC BY-SA 4.0) states: The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-particularism","kind":"concept","label":"Epistemological particularism","sources":[{"id":"wikipedia.article.epistemological-particularism","title":"English Wikipedia article: Epistemological particularism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+particularism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological particularism\", CC BY-SA 4.0) states: Epistemological particularism is the view that one can know something without knowing how one knows it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-is-power","kind":"concept","label":"Knowledge is power","sources":[{"id":"wikipedia.article.knowledge-is-power","title":"English Wikipedia article: Knowledge is power","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+is+power"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge is power\", CC BY-SA 4.0) states: The phrase \"scientia potentia est\" (or \"scientia est potentia\" or also \"scientia potestas est\") is a Latin aphorism meaning \"knowledge is power\", commonly attributed to Sir Francis Bacon.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evidentialism","kind":"concept","label":"Evidentialism","sources":[{"id":"wikipedia.article.evidentialism","title":"English Wikipedia article: Evidentialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evidentialism"}],"status":"reported","summary":"English Wikipedia (article \"Evidentialism\", CC BY-SA 4.0) states: Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.philosophical-razor","kind":"concept","label":"Philosophical razor","sources":[{"id":"wikipedia.article.philosophical-razor","title":"English Wikipedia article: Philosophical razor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Philosophical+razor"}],"status":"reported","summary":"English Wikipedia (article \"Philosophical razor\", CC BY-SA 4.0) states: In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rational-egoism","kind":"concept","label":"Rational egoism","sources":[{"id":"wikipedia.article.rational-egoism","title":"English Wikipedia article: Rational egoism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rational+egoism"}],"status":"reported","summary":"English Wikipedia (article \"Rational egoism\", CC BY-SA 4.0) states: Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-statement","kind":"concept","label":"Problem statement","sources":[{"id":"wikipedia.article.problem-statement","title":"English Wikipedia article: Problem statement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+statement"}],"status":"reported","summary":"English Wikipedia (article \"Problem statement\", CC BY-SA 4.0) states: A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecstasy-philosophy","kind":"concept","label":"Ecstasy (philosophy)","sources":[{"id":"wikipedia.article.ecstasy-philosophy","title":"English Wikipedia article: Ecstasy (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecstasy+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Ecstasy (philosophy)\", CC BY-SA 4.0) states: In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \"outside-itself\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.base-unit-of-measurement","kind":"concept","label":"Base unit of measurement","sources":[{"id":"wikipedia.article.base-unit-of-measurement","title":"English Wikipedia article: Base unit of measurement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Base+unit+of+measurement"}],"status":"reported","summary":"English Wikipedia (article \"Base unit of measurement\", CC BY-SA 4.0) states: A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.trust-social-science","kind":"concept","label":"Trust (social science)","sources":[{"id":"wikipedia.article.trust-social-science","title":"English Wikipedia article: Trust (social science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Trust+%28social+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Trust (social science)\", CC BY-SA 4.0) states: Trust is the belief that another person will do what is expected and is built through repeated consistency.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bandwagon-effect","kind":"concept","label":"Bandwagon effect","sources":[{"id":"wikipedia.article.bandwagon-effect","title":"English Wikipedia article: Bandwagon effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bandwagon+effect"}],"status":"reported","summary":"English Wikipedia (article \"Bandwagon effect\", CC BY-SA 4.0) states: The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.extensional-context","kind":"concept","label":"Extensional context","sources":[{"id":"wikipedia.article.extensional-context","title":"English Wikipedia article: Extensional context","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extensional+context"}],"status":"reported","summary":"English Wikipedia (article \"Extensional context\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-pluralism","kind":"concept","label":"Epistemological pluralism","sources":[{"id":"wikipedia.article.epistemological-pluralism","title":"English Wikipedia article: Epistemological pluralism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+pluralism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological pluralism\", CC BY-SA 4.0) states: Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.supervenience","kind":"concept","label":"Supervenience","sources":[{"id":"wikipedia.article.supervenience","title":"English Wikipedia article: Supervenience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Supervenience"}],"status":"reported","summary":"English Wikipedia (article \"Supervenience\", CC BY-SA 4.0) states: In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.force-matching","kind":"concept","label":"Force matching","sources":[{"id":"wikipedia.article.force-matching","title":"English Wikipedia article: Force matching","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Force+matching"}],"status":"reported","summary":"English Wikipedia (article \"Force matching\", CC BY-SA 4.0) states: Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.meta-functional-expertise","kind":"concept","label":"Meta-functional expertise","sources":[{"id":"wikipedia.article.meta-functional-expertise","title":"English Wikipedia article: Meta-functional expertise","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Meta-functional+expertise"}],"status":"reported","summary":"English Wikipedia (article \"Meta-functional expertise\", CC BY-SA 4.0) states: Meta-functional expertise is the breadth of one’s strategically important knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.lateral-thinking","kind":"concept","label":"Lateral thinking","sources":[{"id":"wikipedia.article.lateral-thinking","title":"English Wikipedia article: Lateral thinking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Lateral+thinking"}],"status":"reported","summary":"English Wikipedia (article \"Lateral thinking\", CC BY-SA 4.0) states: Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ergo-decedo","kind":"concept","label":"Ergo decedo","sources":[{"id":"wikipedia.article.ergo-decedo","title":"English Wikipedia article: Ergo decedo","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ergo+decedo"}],"status":"reported","summary":"English Wikipedia (article \"Ergo decedo\", CC BY-SA 4.0) states: Ergo decedo, Latin for \"therefore I leave\" or \"then I go off\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ontoclean","kind":"concept","label":"OntoClean","sources":[{"id":"wikipedia.article.ontoclean","title":"English Wikipedia article: OntoClean","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=OntoClean"}],"status":"reported","summary":"English Wikipedia (article \"OntoClean\", CC BY-SA 4.0) states: OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rational-fideism","kind":"concept","label":"Rational fideism","sources":[{"id":"wikipedia.article.rational-fideism","title":"English Wikipedia article: Rational fideism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rational+fideism"}],"status":"reported","summary":"English Wikipedia (article \"Rational fideism\", CC BY-SA 4.0) states: Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.extension-semantics","kind":"concept","label":"Extension (semantics)","sources":[{"id":"wikipedia.article.extension-semantics","title":"English Wikipedia article: Extension (semantics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extension+%28semantics%29"}],"status":"reported","summary":"English Wikipedia (article \"Extension (semantics)\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.infinite-regress","kind":"concept","label":"Infinite regress","sources":[{"id":"wikipedia.article.infinite-regress","title":"English Wikipedia article: Infinite regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Infinite+regress"}],"status":"reported","summary":"English Wikipedia (article \"Infinite regress\", CC BY-SA 4.0) states: Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defensive-pessimism","kind":"concept","label":"Defensive pessimism","sources":[{"id":"wikipedia.article.defensive-pessimism","title":"English Wikipedia article: Defensive pessimism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defensive+pessimism"}],"status":"reported","summary":"English Wikipedia (article \"Defensive pessimism\", CC BY-SA 4.0) states: Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-question-argument","kind":"concept","label":"Open-question argument","sources":[{"id":"wikipedia.article.open-question-argument","title":"English Wikipedia article: Open-question argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open-question+argument"}],"status":"reported","summary":"English Wikipedia (article \"Open-question argument\", CC BY-SA 4.0) states: The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.faraday-paradox-electrochemistry","kind":"concept","label":"Faraday paradox (electrochemistry)","sources":[{"id":"wikipedia.article.faraday-paradox-electrochemistry","title":"English Wikipedia article: Faraday paradox (electrochemistry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Faraday+paradox+%28electrochemistry%29"}],"status":"reported","summary":"English Wikipedia (article \"Faraday paradox (electrochemistry)\", CC BY-SA 4.0) states: The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.civil-engineering","kind":"field","label":"Civil engineering","sources":[{"id":"wikipedia.article.civil-engineering","title":"English Wikipedia article: Civil engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Civil+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Civil engineering\", CC BY-SA 4.0) states: Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.electrical-engineering","kind":"field","label":"Electrical engineering","sources":[{"id":"wikipedia.article.electrical-engineering","title":"English Wikipedia article: Electrical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electrical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Electrical engineering\", CC BY-SA 4.0) states: Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.aerospace-engineering","kind":"field","label":"Aerospace engineering","sources":[{"id":"wikipedia.article.aerospace-engineering","title":"English Wikipedia article: Aerospace engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace engineering\", CC BY-SA 4.0) states: Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.control-theory","kind":"field","label":"Control theory","sources":[{"id":"wikipedia.article.control-theory","title":"English Wikipedia article: Control theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+theory"}],"status":"reported","summary":"English Wikipedia (article \"Control theory\", CC BY-SA 4.0) states: Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.manufacturing","kind":"concept","label":"Manufacturing","sources":[{"id":"wikipedia.article.manufacturing","title":"English Wikipedia article: Manufacturing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Manufacturing"}],"status":"reported","summary":"English Wikipedia (article \"Manufacturing\", CC BY-SA 4.0) states: Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-device","kind":"concept","label":"Analog device","sources":[{"id":"wikipedia.article.analog-device","title":"English Wikipedia article: Analog device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+device"}],"status":"reported","summary":"English Wikipedia (article \"Analog device\", CC BY-SA 4.0) states: Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.systems-engineering","kind":"field","label":"Systems engineering","sources":[{"id":"wikipedia.article.systems-engineering","title":"English Wikipedia article: Systems engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Systems+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Systems engineering\", CC BY-SA 4.0) states: Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.geotechnical-engineering","kind":"field","label":"Geotechnical engineering","sources":[{"id":"wikipedia.article.geotechnical-engineering","title":"English Wikipedia article: Geotechnical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geotechnical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Geotechnical engineering\", CC BY-SA 4.0) states: Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anti-twister-mechanism","kind":"concept","label":"Anti-twister mechanism","sources":[{"id":"wikipedia.article.anti-twister-mechanism","title":"English Wikipedia article: Anti-twister mechanism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anti-twister+mechanism"}],"status":"reported","summary":"English Wikipedia (article \"Anti-twister mechanism\", CC BY-SA 4.0) states: The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.machine","kind":"concept","label":"Machine","sources":[{"id":"wikipedia.article.machine","title":"English Wikipedia article: Machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Machine"}],"status":"reported","summary":"English Wikipedia (article \"Machine\", CC BY-SA 4.0) states: A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.engine","kind":"concept","label":"Engine","sources":[{"id":"wikipedia.article.engine","title":"English Wikipedia article: Engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engine"}],"status":"reported","summary":"English Wikipedia (article \"Engine\", CC BY-SA 4.0) states: An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-component","kind":"concept","label":"Electronic component","sources":[{"id":"wikipedia.article.electronic-component","title":"English Wikipedia article: Electronic component","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+component"}],"status":"reported","summary":"English Wikipedia (article \"Electronic component\", CC BY-SA 4.0) states: An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-power-filter","kind":"concept","label":"Active power filter","sources":[{"id":"wikipedia.article.active-power-filter","title":"English Wikipedia article: Active power filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+power+filter"}],"status":"reported","summary":"English Wikipedia (article \"Active power filter\", CC BY-SA 4.0) states: Active power filters (APF) are filters, which can perform the job of harmonic elimination.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.telecommunications-engineering","kind":"field","label":"Telecommunications engineering","sources":[{"id":"wikipedia.article.telecommunications-engineering","title":"English Wikipedia article: Telecommunications engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Telecommunications+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Telecommunications engineering\", CC BY-SA 4.0) states: Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.semiconductor-device","kind":"concept","label":"Semiconductor device","sources":[{"id":"wikipedia.article.semiconductor-device","title":"English Wikipedia article: Semiconductor device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Semiconductor+device"}],"status":"reported","summary":"English Wikipedia (article \"Semiconductor device\", CC BY-SA 4.0) states: A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-motor","kind":"concept","label":"Electric motor","sources":[{"id":"wikipedia.article.electric-motor","title":"English Wikipedia article: Electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Electric motor\", CC BY-SA 4.0) states: An electric motor is a machine that converts electrical energy into mechanical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.pump","kind":"concept","label":"Pump","sources":[{"id":"wikipedia.article.pump","title":"English Wikipedia article: Pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pump"}],"status":"reported","summary":"English Wikipedia (article \"Pump\", CC BY-SA 4.0) states: A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.valve","kind":"concept","label":"Valve","sources":[{"id":"wikipedia.article.valve","title":"English Wikipedia article: Valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Valve"}],"status":"reported","summary":"English Wikipedia (article \"Valve\", CC BY-SA 4.0) states: A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abenics","kind":"concept","label":"ABENICS","sources":[{"id":"wikipedia.article.abenics","title":"English Wikipedia article: ABENICS","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ABENICS"}],"status":"reported","summary":"English Wikipedia (article \"ABENICS\", CC BY-SA 4.0) states: ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fastener","kind":"concept","label":"Fastener","sources":[{"id":"wikipedia.article.fastener","title":"English Wikipedia article: Fastener","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fastener"}],"status":"reported","summary":"English Wikipedia (article \"Fastener\", CC BY-SA 4.0) states: A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.construction","kind":"concept","label":"Construction","sources":[{"id":"wikipedia.article.construction","title":"English Wikipedia article: Construction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Construction"}],"status":"reported","summary":"English Wikipedia (article \"Construction\", CC BY-SA 4.0) states: Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.belt-mechanical","kind":"concept","label":"Belt (mechanical)","sources":[{"id":"wikipedia.article.belt-mechanical","title":"English Wikipedia article: Belt (mechanical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belt+%28mechanical%29"}],"status":"reported","summary":"English Wikipedia (article \"Belt (mechanical)\", CC BY-SA 4.0) states: A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.building-engineer","kind":"concept","label":"Building engineer","sources":[{"id":"wikipedia.article.building-engineer","title":"English Wikipedia article: Building engineer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Building+engineer"}],"status":"reported","summary":"English Wikipedia (article \"Building engineer\", CC BY-SA 4.0) states: A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.signal-processing","kind":"concept","label":"Signal processing","sources":[{"id":"wikipedia.article.signal-processing","title":"English Wikipedia article: Signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Signal processing\", CC BY-SA 4.0) states: Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abnormal-grain-growth","kind":"concept","label":"Abnormal grain growth","sources":[{"id":"wikipedia.article.abnormal-grain-growth","title":"English Wikipedia article: Abnormal grain growth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abnormal+grain+growth"}],"status":"reported","summary":"English Wikipedia (article \"Abnormal grain growth\", CC BY-SA 4.0) states: In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.nuclear-technology","kind":"concept","label":"Nuclear technology","sources":[{"id":"wikipedia.article.nuclear-technology","title":"English Wikipedia article: Nuclear technology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Nuclear+technology"}],"status":"reported","summary":"English Wikipedia (article \"Nuclear technology\", CC BY-SA 4.0) states: Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-circuit","kind":"concept","label":"Electronic circuit","sources":[{"id":"wikipedia.article.electronic-circuit","title":"English Wikipedia article: Electronic circuit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+circuit"}],"status":"reported","summary":"English Wikipedia (article \"Electronic circuit\", CC BY-SA 4.0) states: An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.structural-system","kind":"concept","label":"Structural system","sources":[{"id":"wikipedia.article.structural-system","title":"English Wikipedia article: Structural system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Structural+system"}],"status":"reported","summary":"English Wikipedia (article \"Structural system\", CC BY-SA 4.0) states: The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heat-exchanger","kind":"concept","label":"Heat exchanger","sources":[{"id":"wikipedia.article.heat-exchanger","title":"English Wikipedia article: Heat exchanger","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heat+exchanger"}],"status":"reported","summary":"English Wikipedia (article \"Heat exchanger\", CC BY-SA 4.0) states: A heat exchanger is a system used to transfer heat between a source and a working fluid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.actuator","kind":"concept","label":"Actuator","sources":[{"id":"wikipedia.article.actuator","title":"English Wikipedia article: Actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actuator"}],"status":"reported","summary":"English Wikipedia (article \"Actuator\", CC BY-SA 4.0) states: An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.sensor","kind":"concept","label":"Sensor","sources":[{"id":"wikipedia.article.sensor","title":"English Wikipedia article: Sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sensor"}],"status":"reported","summary":"English Wikipedia (article \"Sensor\", CC BY-SA 4.0) states: A sensor is often defined as a device that receives and responds to a signal or stimulus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.agitator-device","kind":"concept","label":"Agitator (device)","sources":[{"id":"wikipedia.article.agitator-device","title":"English Wikipedia article: Agitator (device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agitator+%28device%29"}],"status":"reported","summary":"English Wikipedia (article \"Agitator (device)\", CC BY-SA 4.0) states: An agitator is a device or mechanism to put something into motion by shaking or stirring.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ac-dc-receiver-design","kind":"concept","label":"AC/DC receiver design","sources":[{"id":"wikipedia.article.ac-dc-receiver-design","title":"English Wikipedia article: AC/DC receiver design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=AC%2FDC+receiver+design"}],"status":"reported","summary":"English Wikipedia (article \"AC/DC receiver design\", CC BY-SA 4.0) states: An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.activated-sludge","kind":"concept","label":"Activated sludge","sources":[{"id":"wikipedia.article.activated-sludge","title":"English Wikipedia article: Activated sludge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Activated+sludge"}],"status":"reported","summary":"English Wikipedia (article \"Activated sludge\", CC BY-SA 4.0) states: The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.distributed-parameter-system","kind":"concept","label":"Distributed parameter system","sources":[{"id":"wikipedia.article.distributed-parameter-system","title":"English Wikipedia article: Distributed parameter system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distributed+parameter+system"}],"status":"reported","summary":"English Wikipedia (article \"Distributed parameter system\", CC BY-SA 4.0) states: In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alarm-management","kind":"concept","label":"Alarm management","sources":[{"id":"wikipedia.article.alarm-management","title":"English Wikipedia article: Alarm management","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alarm+management"}],"status":"reported","summary":"English Wikipedia (article \"Alarm management\", CC BY-SA 4.0) states: Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analogue-electronics","kind":"concept","label":"Analogue electronics","sources":[{"id":"wikipedia.article.analogue-electronics","title":"English Wikipedia article: Analogue electronics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogue+electronics"}],"status":"reported","summary":"English Wikipedia (article \"Analogue electronics\", CC BY-SA 4.0) states: Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-differential","kind":"concept","label":"Ball differential","sources":[{"id":"wikipedia.article.ball-differential","title":"English Wikipedia article: Ball differential","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+differential"}],"status":"reported","summary":"English Wikipedia (article \"Ball differential\", CC BY-SA 4.0) states: A ball differential is a type of differential typically used on radio-controlled cars.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-bearing","kind":"concept","label":"Air bearing","sources":[{"id":"wikipedia.article.air-bearing","title":"English Wikipedia article: Air bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Air bearing\", CC BY-SA 4.0) states: Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aluminium-conductor-steel-reinforced-cable","kind":"concept","label":"Aluminium-conductor steel-reinforced cable","sources":[{"id":"wikipedia.article.aluminium-conductor-steel-reinforced-cable","title":"English Wikipedia article: Aluminium-conductor steel-reinforced cable","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aluminium-conductor+steel-reinforced+cable"}],"status":"reported","summary":"English Wikipedia (article \"Aluminium-conductor steel-reinforced cable\", CC BY-SA 4.0) states: Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welder","kind":"concept","label":"Welder","sources":[{"id":"wikipedia.article.welder","title":"English Wikipedia article: Welder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welder"}],"status":"reported","summary":"English Wikipedia (article \"Welder\", CC BY-SA 4.0) states: A welder is a person or equipment that fuses materials together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.machining","kind":"concept","label":"Machining","sources":[{"id":"wikipedia.article.machining","title":"English Wikipedia article: Machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Machining"}],"status":"reported","summary":"English Wikipedia (article \"Machining\", CC BY-SA 4.0) states: Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasion-mechanical","kind":"concept","label":"Abrasion (mechanical)","sources":[{"id":"wikipedia.article.abrasion-mechanical","title":"English Wikipedia article: Abrasion (mechanical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasion+%28mechanical%29"}],"status":"reported","summary":"English Wikipedia (article \"Abrasion (mechanical)\", CC BY-SA 4.0) states: Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armature-electrical","kind":"concept","label":"Armature (electrical)","sources":[{"id":"wikipedia.article.armature-electrical","title":"English Wikipedia article: Armature (electrical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armature+%28electrical%29"}],"status":"reported","summary":"English Wikipedia (article \"Armature (electrical)\", CC BY-SA 4.0) states: In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gender-of-connectors-and-fasteners","kind":"concept","label":"Gender of connectors and fasteners","sources":[{"id":"wikipedia.article.gender-of-connectors-and-fasteners","title":"English Wikipedia article: Gender of connectors and fasteners","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gender+of+connectors+and+fasteners"}],"status":"reported","summary":"English Wikipedia (article \"Gender of connectors and fasteners\", CC BY-SA 4.0) states: In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chain-conveyor","kind":"concept","label":"Chain conveyor","sources":[{"id":"wikipedia.article.chain-conveyor","title":"English Wikipedia article: Chain conveyor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+conveyor"}],"status":"reported","summary":"English Wikipedia (article \"Chain conveyor\", CC BY-SA 4.0) states: A chain conveyor is a type of conveyor system for moving material through production lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-beamformer","kind":"concept","label":"Adaptive beamformer","sources":[{"id":"wikipedia.article.adaptive-beamformer","title":"English Wikipedia article: Adaptive beamformer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+beamformer"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive beamformer\", CC BY-SA 4.0) states: An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-emission","kind":"concept","label":"Acoustic emission","sources":[{"id":"wikipedia.article.acoustic-emission","title":"English Wikipedia article: Acoustic emission","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+emission"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic emission\", CC BY-SA 4.0) states: Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-redundancy","kind":"concept","label":"Active redundancy","sources":[{"id":"wikipedia.article.active-redundancy","title":"English Wikipedia article: Active redundancy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+redundancy"}],"status":"reported","summary":"English Wikipedia (article \"Active redundancy\", CC BY-SA 4.0) states: Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.acoustical-engineering","kind":"field","label":"Acoustical engineering","sources":[{"id":"wikipedia.article.acoustical-engineering","title":"English Wikipedia article: Acoustical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Acoustical engineering\", CC BY-SA 4.0) states: Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adsorption-bio-oxidation-process","kind":"concept","label":"Adsorption/bio-oxidation process","sources":[{"id":"wikipedia.article.adsorption-bio-oxidation-process","title":"English Wikipedia article: Adsorption/bio-oxidation process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adsorption%2Fbio-oxidation+process"}],"status":"reported","summary":"English Wikipedia (article \"Adsorption/bio-oxidation process\", CC BY-SA 4.0) states: The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bell-nipple","kind":"concept","label":"Bell nipple","sources":[{"id":"wikipedia.article.bell-nipple","title":"English Wikipedia article: Bell nipple","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bell+nipple"}],"status":"reported","summary":"English Wikipedia (article \"Bell nipple\", CC BY-SA 4.0) states: A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive","kind":"concept","label":"Abrasive","sources":[{"id":"wikipedia.article.abrasive","title":"English Wikipedia article: Abrasive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive\", CC BY-SA 4.0) states: An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.a-frame","kind":"concept","label":"A-frame","sources":[{"id":"wikipedia.article.a-frame","title":"English Wikipedia article: A-frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A-frame"}],"status":"reported","summary":"English Wikipedia (article \"A-frame\", CC BY-SA 4.0) states: An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-joint","kind":"concept","label":"Ball joint","sources":[{"id":"wikipedia.article.ball-joint","title":"English Wikipedia article: Ball joint","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+joint"}],"status":"reported","summary":"English Wikipedia (article \"Ball joint\", CC BY-SA 4.0) states: In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-turbine","kind":"concept","label":"Axial turbine","sources":[{"id":"wikipedia.article.axial-turbine","title":"English Wikipedia article: Axial turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Axial turbine\", CC BY-SA 4.0) states: In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-handler","kind":"concept","label":"Air handler","sources":[{"id":"wikipedia.article.air-handler","title":"English Wikipedia article: Air handler","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+handler"}],"status":"reported","summary":"English Wikipedia (article \"Air handler\", CC BY-SA 4.0) states: An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrams-law","kind":"concept","label":"Abrams' law","sources":[{"id":"wikipedia.article.abrams-law","title":"English Wikipedia article: Abrams' law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrams%27+law"}],"status":"reported","summary":"English Wikipedia (article \"Abrams' law\", CC BY-SA 4.0) states: Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-permeability-specific-surface","kind":"concept","label":"Air permeability specific surface","sources":[{"id":"wikipedia.article.air-permeability-specific-surface","title":"English Wikipedia article: Air permeability specific surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+permeability+specific+surface"}],"status":"reported","summary":"English Wikipedia (article \"Air permeability specific surface\", CC BY-SA 4.0) states: The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.applied-mechanics","kind":"field","label":"Applied mechanics","sources":[{"id":"wikipedia.article.applied-mechanics","title":"English Wikipedia article: Applied mechanics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+mechanics"}],"status":"reported","summary":"English Wikipedia (article \"Applied mechanics\", CC BY-SA 4.0) states: Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arc-fault","kind":"concept","label":"Arc fault","sources":[{"id":"wikipedia.article.arc-fault","title":"English Wikipedia article: Arc fault","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arc+fault"}],"status":"reported","summary":"English Wikipedia (article \"Arc fault\", CC BY-SA 4.0) states: An arc fault is a high power discharge of electricity between two or more conductors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.engineering-geology","kind":"concept","label":"Engineering geology","sources":[{"id":"wikipedia.article.engineering-geology","title":"English Wikipedia article: Engineering geology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engineering+geology"}],"status":"reported","summary":"English Wikipedia (article \"Engineering geology\", CC BY-SA 4.0) states: Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ballast","kind":"concept","label":"Ballast","sources":[{"id":"wikipedia.article.ballast","title":"English Wikipedia article: Ballast","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ballast"}],"status":"reported","summary":"English Wikipedia (article \"Ballast\", CC BY-SA 4.0) states: Ballast is dense material used as a weight to provide stability to a vehicle or structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anaesthetic-machine","kind":"concept","label":"Anaesthetic machine","sources":[{"id":"wikipedia.article.anaesthetic-machine","title":"English Wikipedia article: Anaesthetic machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anaesthetic+machine"}],"status":"reported","summary":"English Wikipedia (article \"Anaesthetic machine\", CC BY-SA 4.0) states: An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-circulator","kind":"concept","label":"Active circulator","sources":[{"id":"wikipedia.article.active-circulator","title":"English Wikipedia article: Active circulator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+circulator"}],"status":"reported","summary":"English Wikipedia (article \"Active circulator\", CC BY-SA 4.0) states: In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-delay-line","kind":"concept","label":"Analog delay line","sources":[{"id":"wikipedia.article.analog-delay-line","title":"English Wikipedia article: Analog delay line","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+delay+line"}],"status":"reported","summary":"English Wikipedia (article \"Analog delay line\", CC BY-SA 4.0) states: An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welding","kind":"concept","label":"Welding","sources":[{"id":"wikipedia.article.welding","title":"English Wikipedia article: Welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welding"}],"status":"reported","summary":"English Wikipedia (article \"Welding\", CC BY-SA 4.0) states: Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bifacial-solar-cells","kind":"concept","label":"Bifacial solar cells","sources":[{"id":"wikipedia.article.bifacial-solar-cells","title":"English Wikipedia article: Bifacial solar cells","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bifacial+solar+cells"}],"status":"reported","summary":"English Wikipedia (article \"Bifacial solar cells\", CC BY-SA 4.0) states: A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armature-controlled-dc-motor","kind":"concept","label":"Armature-controlled DC motor","sources":[{"id":"wikipedia.article.armature-controlled-dc-motor","title":"English Wikipedia article: Armature-controlled DC motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armature-controlled+DC+motor"}],"status":"reported","summary":"English Wikipedia (article \"Armature-controlled DC motor\", CC BY-SA 4.0) states: An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acid-egg","kind":"concept","label":"Acid egg","sources":[{"id":"wikipedia.article.acid-egg","title":"English Wikipedia article: Acid egg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acid+egg"}],"status":"reported","summary":"English Wikipedia (article \"Acid egg\", CC BY-SA 4.0) states: The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.valve-actuator","kind":"concept","label":"Valve actuator","sources":[{"id":"wikipedia.article.valve-actuator","title":"English Wikipedia article: Valve actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Valve+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Valve actuator\", CC BY-SA 4.0) states: A valve actuator is the mechanism for opening and closing a valve.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bevel-gear","kind":"concept","label":"Bevel gear","sources":[{"id":"wikipedia.article.bevel-gear","title":"English Wikipedia article: Bevel gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bevel+gear"}],"status":"reported","summary":"English Wikipedia (article \"Bevel gear\", CC BY-SA 4.0) states: Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chain-drive","kind":"concept","label":"Chain drive","sources":[{"id":"wikipedia.article.chain-drive","title":"English Wikipedia article: Chain drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+drive"}],"status":"reported","summary":"English Wikipedia (article \"Chain drive\", CC BY-SA 4.0) states: A chain drive is a way of transmitting mechanical power from one place to another.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.agricultural-engineering","kind":"field","label":"Agricultural engineering","sources":[{"id":"wikipedia.article.agricultural-engineering","title":"English Wikipedia article: Agricultural engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agricultural+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Agricultural engineering\", CC BY-SA 4.0) states: Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-oxidation-process","kind":"concept","label":"Advanced oxidation process","sources":[{"id":"wikipedia.article.advanced-oxidation-process","title":"English Wikipedia article: Advanced oxidation process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+oxidation+process"}],"status":"reported","summary":"English Wikipedia (article \"Advanced oxidation process\", CC BY-SA 4.0) states: Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive-flow-machining","kind":"concept","label":"Abrasive flow machining","sources":[{"id":"wikipedia.article.abrasive-flow-machining","title":"English Wikipedia article: Abrasive flow machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive+flow+machining"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive flow machining\", CC BY-SA 4.0) states: Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.amplifier","kind":"concept","label":"Amplifier","sources":[{"id":"wikipedia.article.amplifier","title":"English Wikipedia article: Amplifier","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amplifier"}],"status":"reported","summary":"English Wikipedia (article \"Amplifier\", CC BY-SA 4.0) states: An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airframe","kind":"concept","label":"Airframe","sources":[{"id":"wikipedia.article.airframe","title":"English Wikipedia article: Airframe","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airframe"}],"status":"reported","summary":"English Wikipedia (article \"Airframe\", CC BY-SA 4.0) states: The mechanical structure of an aircraft is known as the airframe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-cooled-heat-exchanger","kind":"concept","label":"Air cooled heat exchanger","sources":[{"id":"wikipedia.article.air-cooled-heat-exchanger","title":"English Wikipedia article: Air cooled heat exchanger","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+cooled+heat+exchanger"}],"status":"reported","summary":"English Wikipedia (article \"Air cooled heat exchanger\", CC BY-SA 4.0) states: An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.deriaz-turbine","kind":"concept","label":"Deriaz turbine","sources":[{"id":"wikipedia.article.deriaz-turbine","title":"English Wikipedia article: Deriaz turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deriaz+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Deriaz turbine\", CC BY-SA 4.0) states: The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.addressed-fiber-bragg-structure","kind":"concept","label":"Addressed fiber Bragg structure","sources":[{"id":"wikipedia.article.addressed-fiber-bragg-structure","title":"English Wikipedia article: Addressed fiber Bragg structure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Addressed+fiber+Bragg+structure"}],"status":"reported","summary":"English Wikipedia (article \"Addressed fiber Bragg structure\", CC BY-SA 4.0) states: An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-preheater","kind":"concept","label":"Air preheater","sources":[{"id":"wikipedia.article.air-preheater","title":"English Wikipedia article: Air preheater","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+preheater"}],"status":"reported","summary":"English Wikipedia (article \"Air preheater\", CC BY-SA 4.0) states: An air preheater is any device designed to heat air before another process (for example, combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abutment","kind":"concept","label":"Abutment","sources":[{"id":"wikipedia.article.abutment","title":"English Wikipedia article: Abutment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abutment"}],"status":"reported","summary":"English Wikipedia (article \"Abutment\", CC BY-SA 4.0) states: An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alternating-current","kind":"concept","label":"Alternating current","sources":[{"id":"wikipedia.article.alternating-current","title":"English Wikipedia article: Alternating current","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alternating+current"}],"status":"reported","summary":"English Wikipedia (article \"Alternating current\", CC BY-SA 4.0) states: Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bating-leather","kind":"concept","label":"Bating (leather)","sources":[{"id":"wikipedia.article.bating-leather","title":"English Wikipedia article: Bating (leather)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bating+%28leather%29"}],"status":"reported","summary":"English Wikipedia (article \"Bating (leather)\", CC BY-SA 4.0) states: Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-hierarchy-process","kind":"concept","label":"Analytic hierarchy process","sources":[{"id":"wikipedia.article.analytic-hierarchy-process","title":"English Wikipedia article: Analytic hierarchy process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+hierarchy+process"}],"status":"reported","summary":"English Wikipedia (article \"Analytic hierarchy process\", CC BY-SA 4.0) states: In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aquifer","kind":"concept","label":"Aquifer","sources":[{"id":"wikipedia.article.aquifer","title":"English Wikipedia article: Aquifer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aquifer"}],"status":"reported","summary":"English Wikipedia (article \"Aquifer\", CC BY-SA 4.0) states: An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flowability","kind":"concept","label":"Flowability","sources":[{"id":"wikipedia.article.flowability","title":"English Wikipedia article: Flowability","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flowability"}],"status":"reported","summary":"English Wikipedia (article \"Flowability\", CC BY-SA 4.0) states: Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cable-robots","kind":"concept","label":"Cable robots","sources":[{"id":"wikipedia.article.cable-robots","title":"English Wikipedia article: Cable robots","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cable+robots"}],"status":"reported","summary":"English Wikipedia (article \"Cable robots\", CC BY-SA 4.0) states: Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autopen","kind":"concept","label":"Autopen","sources":[{"id":"wikipedia.article.autopen","title":"English Wikipedia article: Autopen","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autopen"}],"status":"reported","summary":"English Wikipedia (article \"Autopen\", CC BY-SA 4.0) states: An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-fuel-ratio","kind":"concept","label":"Air–fuel ratio","sources":[{"id":"wikipedia.article.air-fuel-ratio","title":"English Wikipedia article: Air–fuel ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air%E2%80%93fuel+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Air–fuel ratio\", CC BY-SA 4.0) states: Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive-machining","kind":"concept","label":"Abrasive machining","sources":[{"id":"wikipedia.article.abrasive-machining","title":"English Wikipedia article: Abrasive machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive+machining"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive machining\", CC BY-SA 4.0) states: Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.archard-equation","kind":"concept","label":"Archard equation","sources":[{"id":"wikipedia.article.archard-equation","title":"English Wikipedia article: Archard equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archard+equation"}],"status":"reported","summary":"English Wikipedia (article \"Archard equation\", CC BY-SA 4.0) states: The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chiplet","kind":"concept","label":"Chiplet","sources":[{"id":"wikipedia.article.chiplet","title":"English Wikipedia article: Chiplet","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chiplet"}],"status":"reported","summary":"English Wikipedia (article \"Chiplet\", CC BY-SA 4.0) states: A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-flux-motor","kind":"concept","label":"Axial flux motor","sources":[{"id":"wikipedia.article.axial-flux-motor","title":"English Wikipedia article: Axial flux motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+flux+motor"}],"status":"reported","summary":"English Wikipedia (article \"Axial flux motor\", CC BY-SA 4.0) states: An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.affinity-laws","kind":"concept","label":"Affinity laws","sources":[{"id":"wikipedia.article.affinity-laws","title":"English Wikipedia article: Affinity laws","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affinity+laws"}],"status":"reported","summary":"English Wikipedia (article \"Affinity laws\", CC BY-SA 4.0) states: The affinity laws (also known as the \"Fan Laws\" or \"Pump Laws\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adjustable-pressure-limiting-valve","kind":"concept","label":"Adjustable pressure-limiting valve","sources":[{"id":"wikipedia.article.adjustable-pressure-limiting-valve","title":"English Wikipedia article: Adjustable pressure-limiting valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjustable+pressure-limiting+valve"}],"status":"reported","summary":"English Wikipedia (article \"Adjustable pressure-limiting valve\", CC BY-SA 4.0) states: An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anchor-channel","kind":"concept","label":"Anchor channel","sources":[{"id":"wikipedia.article.anchor-channel","title":"English Wikipedia article: Anchor channel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anchor+channel"}],"status":"reported","summary":"English Wikipedia (article \"Anchor channel\", CC BY-SA 4.0) states: Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","kind":"concept","label":"Chebychev–Grübler–Kutzbach criterion","sources":[{"id":"wikipedia.article.chebychev-gr-bler-kutzbach-criterion","title":"English Wikipedia article: Chebychev–Grübler–Kutzbach criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chebychev%E2%80%93Gr%C3%BCbler%E2%80%93Kutzbach+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Chebychev–Grübler–Kutzbach criterion\", CC BY-SA 4.0) states: The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-thermography","kind":"concept","label":"Active thermography","sources":[{"id":"wikipedia.article.active-thermography","title":"English Wikipedia article: Active thermography","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+thermography"}],"status":"reported","summary":"English Wikipedia (article \"Active thermography\", CC BY-SA 4.0) states: Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.antifragility","kind":"concept","label":"Antifragility","sources":[{"id":"wikipedia.article.antifragility","title":"English Wikipedia article: Antifragility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antifragility"}],"status":"reported","summary":"English Wikipedia (article \"Antifragility\", CC BY-SA 4.0) states: Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.applied-physics","kind":"concept","label":"Applied physics","sources":[{"id":"wikipedia.article.applied-physics","title":"English Wikipedia article: Applied physics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+physics"}],"status":"reported","summary":"English Wikipedia (article \"Applied physics\", CC BY-SA 4.0) states: Applied physics is the application of physics to solve scientific or engineering problems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerobic-granular-reactor","kind":"concept","label":"Aerobic granular reactor","sources":[{"id":"wikipedia.article.aerobic-granular-reactor","title":"English Wikipedia article: Aerobic granular reactor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerobic+granular+reactor"}],"status":"reported","summary":"English Wikipedia (article \"Aerobic granular reactor\", CC BY-SA 4.0) states: Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-screw","kind":"concept","label":"Ball screw","sources":[{"id":"wikipedia.article.ball-screw","title":"English Wikipedia article: Ball screw","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+screw"}],"status":"reported","summary":"English Wikipedia (article \"Ball screw\", CC BY-SA 4.0) states: A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advance-ratio","kind":"concept","label":"Advance ratio","sources":[{"id":"wikipedia.article.advance-ratio","title":"English Wikipedia article: Advance ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advance+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Advance ratio\", CC BY-SA 4.0) states: The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bill-of-materials","kind":"concept","label":"Bill of materials","sources":[{"id":"wikipedia.article.bill-of-materials","title":"English Wikipedia article: Bill of materials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bill+of+materials"}],"status":"reported","summary":"English Wikipedia (article \"Bill of materials\", CC BY-SA 4.0) states: A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.avionics","kind":"concept","label":"Avionics","sources":[{"id":"wikipedia.article.avionics","title":"English Wikipedia article: Avionics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Avionics"}],"status":"reported","summary":"English Wikipedia (article \"Avionics\", CC BY-SA 4.0) states: Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.asset-health-management","kind":"concept","label":"Asset health management","sources":[{"id":"wikipedia.article.asset-health-management","title":"English Wikipedia article: Asset health management","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asset+health+management"}],"status":"reported","summary":"English Wikipedia (article \"Asset health management\", CC BY-SA 4.0) states: In asset management, asset health management (AHM) is the field of study that looks at how to manage the \"health\" of an assets in a facility, system, or fleet.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arcadia-engineering","kind":"concept","label":"Arcadia (engineering)","sources":[{"id":"wikipedia.article.arcadia-engineering","title":"English Wikipedia article: Arcadia (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arcadia+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Arcadia (engineering)\", CC BY-SA 4.0) states: ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aquifer-test","kind":"concept","label":"Aquifer test","sources":[{"id":"wikipedia.article.aquifer-test","title":"English Wikipedia article: Aquifer test","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aquifer+test"}],"status":"reported","summary":"English Wikipedia (article \"Aquifer test\", CC BY-SA 4.0) states: In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \"stimulating\" the aquifer through constant pumping, and observing the aquifer's \"response\" (drawdown) in observation wells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.geological-structure-measurement-by-lidar","kind":"concept","label":"Geological structure measurement by LiDAR","sources":[{"id":"wikipedia.article.geological-structure-measurement-by-lidar","title":"English Wikipedia article: Geological structure measurement by LiDAR","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geological+structure+measurement+by+LiDAR"}],"status":"reported","summary":"English Wikipedia (article \"Geological structure measurement by LiDAR\", CC BY-SA 4.0) states: Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cam-mechanism","kind":"concept","label":"Cam (mechanism)","sources":[{"id":"wikipedia.article.cam-mechanism","title":"English Wikipedia article: Cam (mechanism)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cam+%28mechanism%29"}],"status":"reported","summary":"English Wikipedia (article \"Cam (mechanism)\", CC BY-SA 4.0) states: A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bagel-machine","kind":"concept","label":"Bagel machine","sources":[{"id":"wikipedia.article.bagel-machine","title":"English Wikipedia article: Bagel machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bagel+machine"}],"status":"reported","summary":"English Wikipedia (article \"Bagel machine\", CC BY-SA 4.0) states: A bagel machine is a machine that automatically produces bagels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adapter","kind":"concept","label":"Adapter","sources":[{"id":"wikipedia.article.adapter","title":"English Wikipedia article: Adapter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adapter"}],"status":"reported","summary":"English Wikipedia (article \"Adapter\", CC BY-SA 4.0) states: An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cheng-cycle","kind":"concept","label":"Cheng cycle","sources":[{"id":"wikipedia.article.cheng-cycle","title":"English Wikipedia article: Cheng cycle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cheng+cycle"}],"status":"reported","summary":"English Wikipedia (article \"Cheng cycle\", CC BY-SA 4.0) states: The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.application-layer-framing","kind":"concept","label":"Application-layer framing","sources":[{"id":"wikipedia.article.application-layer-framing","title":"English Wikipedia article: Application-layer framing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Application-layer+framing"}],"status":"reported","summary":"English Wikipedia (article \"Application-layer framing\", CC BY-SA 4.0) states: Application-layer framing or application-level framing (ALF) is a method of allowing an application to use its semantics for the design of its network protocols.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acicular-ferrite","kind":"concept","label":"Acicular ferrite","sources":[{"id":"wikipedia.article.acicular-ferrite","title":"English Wikipedia article: Acicular ferrite","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acicular+ferrite"}],"status":"reported","summary":"English Wikipedia (article \"Acicular ferrite\", CC BY-SA 4.0) states: Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arbor-milling","kind":"concept","label":"Arbor milling","sources":[{"id":"wikipedia.article.arbor-milling","title":"English Wikipedia article: Arbor milling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arbor+milling"}],"status":"reported","summary":"English Wikipedia (article \"Arbor milling\", CC BY-SA 4.0) states: Arbor milling is a cutting process which removes material via a multi-toothed cutter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-pump","kind":"concept","label":"Air pump","sources":[{"id":"wikipedia.article.air-pump","title":"English Wikipedia article: Air pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+pump"}],"status":"reported","summary":"English Wikipedia (article \"Air pump\", CC BY-SA 4.0) states: An air pump is a pump for pushing air. Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-operated-valve","kind":"concept","label":"Air-operated valve","sources":[{"id":"wikipedia.article.air-operated-valve","title":"English Wikipedia article: Air-operated valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air-operated+valve"}],"status":"reported","summary":"English Wikipedia (article \"Air-operated valve\", CC BY-SA 4.0) states: An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-panel","kind":"concept","label":"Acoustic panel","sources":[{"id":"wikipedia.article.acoustic-panel","title":"English Wikipedia article: Acoustic panel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+panel"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic panel\", CC BY-SA 4.0) states: Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aliasing","kind":"concept","label":"Aliasing","sources":[{"id":"wikipedia.article.aliasing","title":"English Wikipedia article: Aliasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aliasing"}],"status":"reported","summary":"English Wikipedia (article \"Aliasing\", CC BY-SA 4.0) states: In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.availability-zone","kind":"concept","label":"Availability zone","sources":[{"id":"wikipedia.article.availability-zone","title":"English Wikipedia article: Availability zone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+zone"}],"status":"reported","summary":"English Wikipedia (article \"Availability zone\", CC BY-SA 4.0) states: In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerobic-granulation","kind":"concept","label":"Aerobic granulation","sources":[{"id":"wikipedia.article.aerobic-granulation","title":"English Wikipedia article: Aerobic granulation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerobic+granulation"}],"status":"reported","summary":"English Wikipedia (article \"Aerobic granulation\", CC BY-SA 4.0) states: The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.conductor-pipe","kind":"concept","label":"Conductor pipe","sources":[{"id":"wikipedia.article.conductor-pipe","title":"English Wikipedia article: Conductor pipe","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conductor+pipe"}],"status":"reported","summary":"English Wikipedia (article \"Conductor pipe\", CC BY-SA 4.0) states: A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-front-end","kind":"concept","label":"Analog front-end","sources":[{"id":"wikipedia.article.analog-front-end","title":"English Wikipedia article: Analog front-end","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+front-end"}],"status":"reported","summary":"English Wikipedia (article \"Analog front-end\", CC BY-SA 4.0) states: An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.seismic-base-isolation","kind":"concept","label":"Seismic base isolation","sources":[{"id":"wikipedia.article.seismic-base-isolation","title":"English Wikipedia article: Seismic base isolation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Seismic+base+isolation"}],"status":"reported","summary":"English Wikipedia (article \"Seismic base isolation\", CC BY-SA 4.0) states: Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cannon-bearing","kind":"concept","label":"Cannon bearing","sources":[{"id":"wikipedia.article.cannon-bearing","title":"English Wikipedia article: Cannon bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cannon+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Cannon bearing\", CC BY-SA 4.0) states: A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baffle-heat-transfer","kind":"concept","label":"Baffle (heat transfer)","sources":[{"id":"wikipedia.article.baffle-heat-transfer","title":"English Wikipedia article: Baffle (heat transfer)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baffle+%28heat+transfer%29"}],"status":"reported","summary":"English Wikipedia (article \"Baffle (heat transfer)\", CC BY-SA 4.0) states: Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angular-rate-sensor","kind":"concept","label":"Angular rate sensor","sources":[{"id":"wikipedia.article.angular-rate-sensor","title":"English Wikipedia article: Angular rate sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angular+rate+sensor"}],"status":"reported","summary":"English Wikipedia (article \"Angular rate sensor\", CC BY-SA 4.0) states: Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airshaft","kind":"concept","label":"Airshaft","sources":[{"id":"wikipedia.article.airshaft","title":"English Wikipedia article: Airshaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airshaft"}],"status":"reported","summary":"English Wikipedia (article \"Airshaft\", CC BY-SA 4.0) states: In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-multi-mission-operations-system","kind":"concept","label":"Advanced multi-mission operations system","sources":[{"id":"wikipedia.article.advanced-multi-mission-operations-system","title":"English Wikipedia article: Advanced multi-mission operations system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+multi-mission+operations+system"}],"status":"reported","summary":"English Wikipedia (article \"Advanced multi-mission operations system\", CC BY-SA 4.0) states: The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biasing","kind":"concept","label":"Biasing","sources":[{"id":"wikipedia.article.biasing","title":"English Wikipedia article: Biasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biasing"}],"status":"reported","summary":"English Wikipedia (article \"Biasing\", CC BY-SA 4.0) states: In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axiomatic-design","kind":"concept","label":"Axiomatic design","sources":[{"id":"wikipedia.article.axiomatic-design","title":"English Wikipedia article: Axiomatic design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiomatic+design"}],"status":"reported","summary":"English Wikipedia (article \"Axiomatic design\", CC BY-SA 4.0) states: Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.artifact-centric-business-process-model","kind":"concept","label":"Artifact-centric business process model","sources":[{"id":"wikipedia.article.artifact-centric-business-process-model","title":"English Wikipedia article: Artifact-centric business process model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artifact-centric+business+process+model"}],"status":"reported","summary":"English Wikipedia (article \"Artifact-centric business process model\", CC BY-SA 4.0) states: Artifact-centric business process model represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.archimedes-screw","kind":"concept","label":"Archimedes' screw","sources":[{"id":"wikipedia.article.archimedes-screw","title":"English Wikipedia article: Archimedes' screw","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archimedes%27+screw"}],"status":"reported","summary":"English Wikipedia (article \"Archimedes' screw\", CC BY-SA 4.0) states: An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cam-timer","kind":"concept","label":"Cam timer","sources":[{"id":"wikipedia.article.cam-timer","title":"English Wikipedia article: Cam timer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cam+timer"}],"status":"reported","summary":"English Wikipedia (article \"Cam timer\", CC BY-SA 4.0) states: A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bicycle-tree","kind":"concept","label":"Bicycle tree","sources":[{"id":"wikipedia.article.bicycle-tree","title":"English Wikipedia article: Bicycle tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicycle+tree"}],"status":"reported","summary":"English Wikipedia (article \"Bicycle tree\", CC BY-SA 4.0) states: A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerial-manned-unmanned-teaming","kind":"concept","label":"Aerial manned-unmanned teaming","sources":[{"id":"wikipedia.article.aerial-manned-unmanned-teaming","title":"English Wikipedia article: Aerial manned-unmanned teaming","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerial+manned-unmanned+teaming"}],"status":"reported","summary":"English Wikipedia (article \"Aerial manned-unmanned teaming\", CC BY-SA 4.0) states: Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.astm-g65","kind":"concept","label":"ASTM G65","sources":[{"id":"wikipedia.article.astm-g65","title":"English Wikipedia article: ASTM G65","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ASTM+G65"}],"status":"reported","summary":"English Wikipedia (article \"ASTM G65\", CC BY-SA 4.0) states: ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.digital-micromirror-device","kind":"concept","label":"Digital micromirror device","sources":[{"id":"wikipedia.article.digital-micromirror-device","title":"English Wikipedia article: Digital micromirror device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Digital+micromirror+device"}],"status":"reported","summary":"English Wikipedia (article \"Digital micromirror device\", CC BY-SA 4.0) states: The digital micromirror device, or DMD, is the microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barlow-s-wheel","kind":"concept","label":"Barlow's wheel","sources":[{"id":"wikipedia.article.barlow-s-wheel","title":"English Wikipedia article: Barlow's wheel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barlow%27s+wheel"}],"status":"reported","summary":"English Wikipedia (article \"Barlow's wheel\", CC BY-SA 4.0) states: Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airlift-pump","kind":"concept","label":"Airlift pump","sources":[{"id":"wikipedia.article.airlift-pump","title":"English Wikipedia article: Airlift pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airlift+pump"}],"status":"reported","summary":"English Wikipedia (article \"Airlift pump\", CC BY-SA 4.0) states: An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cr-maill-re","kind":"concept","label":"Crémaillère","sources":[{"id":"wikipedia.article.cr-maill-re","title":"English Wikipedia article: Crémaillère","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cr%C3%A9maill%C3%A8re"}],"status":"reported","summary":"English Wikipedia (article \"Crémaillère\", CC BY-SA 4.0) states: A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angle-bracket-fastener","kind":"concept","label":"Angle bracket (fastener)","sources":[{"id":"wikipedia.article.angle-bracket-fastener","title":"English Wikipedia article: Angle bracket (fastener)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angle+bracket+%28fastener%29"}],"status":"reported","summary":"English Wikipedia (article \"Angle bracket (fastener)\", CC BY-SA 4.0) states: An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crawl-ratio","kind":"concept","label":"Crawl ratio","sources":[{"id":"wikipedia.article.crawl-ratio","title":"English Wikipedia article: Crawl ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crawl+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Crawl ratio\", CC BY-SA 4.0) states: In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-pod","kind":"concept","label":"Acoustic pod","sources":[{"id":"wikipedia.article.acoustic-pod","title":"English Wikipedia article: Acoustic pod","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+pod"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic pod\", CC BY-SA 4.0) states: An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alpha-beta-filter","kind":"concept","label":"Alpha beta filter","sources":[{"id":"wikipedia.article.alpha-beta-filter","title":"English Wikipedia article: Alpha beta filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alpha+beta+filter"}],"status":"reported","summary":"English Wikipedia (article \"Alpha beta filter\", CC BY-SA 4.0) states: An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bathtub-curve","kind":"concept","label":"Bathtub curve","sources":[{"id":"wikipedia.article.bathtub-curve","title":"English Wikipedia article: Bathtub curve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bathtub+curve"}],"status":"reported","summary":"English Wikipedia (article \"Bathtub curve\", CC BY-SA 4.0) states: In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-stirling-radioisotope-generator","kind":"concept","label":"Advanced Stirling radioisotope generator","sources":[{"id":"wikipedia.article.advanced-stirling-radioisotope-generator","title":"English Wikipedia article: Advanced Stirling radioisotope generator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+Stirling+radioisotope+generator"}],"status":"reported","summary":"English Wikipedia (article \"Advanced Stirling radioisotope generator\", CC BY-SA 4.0) states: The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-to-digital-converter","kind":"concept","label":"Analog-to-digital converter","sources":[{"id":"wikipedia.article.analog-to-digital-converter","title":"English Wikipedia article: Analog-to-digital converter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog-to-digital+converter"}],"status":"reported","summary":"English Wikipedia (article \"Analog-to-digital converter\", CC BY-SA 4.0) states: In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beam-structure","kind":"concept","label":"Beam (structure)","sources":[{"id":"wikipedia.article.beam-structure","title":"English Wikipedia article: Beam (structure)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beam+%28structure%29"}],"status":"reported","summary":"English Wikipedia (article \"Beam (structure)\", CC BY-SA 4.0) states: A beam is a structural element designed to carry loads perpendicular to its long (or \"horizontal\") axis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.malibu-hydro","kind":"concept","label":"Malibu Hydro","sources":[{"id":"wikipedia.article.malibu-hydro","title":"English Wikipedia article: Malibu Hydro","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Malibu+Hydro"}],"status":"reported","summary":"English Wikipedia (article \"Malibu Hydro\", CC BY-SA 4.0) states: Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.camcon-binary-actuator","kind":"concept","label":"Camcon binary actuator","sources":[{"id":"wikipedia.article.camcon-binary-actuator","title":"English Wikipedia article: Camcon binary actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Camcon+binary+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Camcon binary actuator\", CC BY-SA 4.0) states: The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.array-processing","kind":"concept","label":"Array processing","sources":[{"id":"wikipedia.article.array-processing","title":"English Wikipedia article: Array processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Array+processing"}],"status":"reported","summary":"English Wikipedia (article \"Array processing\", CC BY-SA 4.0) states: Array processing is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.breaking-capacity","kind":"concept","label":"Breaking capacity","sources":[{"id":"wikipedia.article.breaking-capacity","title":"English Wikipedia article: Breaking capacity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breaking+capacity"}],"status":"reported","summary":"English Wikipedia (article \"Breaking capacity\", CC BY-SA 4.0) states: Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bodenstein-number","kind":"concept","label":"Bodenstein number","sources":[{"id":"wikipedia.article.bodenstein-number","title":"English Wikipedia article: Bodenstein number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bodenstein+number"}],"status":"reported","summary":"English Wikipedia (article \"Bodenstein number\", CC BY-SA 4.0) states: The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerodynamic-center","kind":"concept","label":"Aerodynamic center","sources":[{"id":"wikipedia.article.aerodynamic-center","title":"English Wikipedia article: Aerodynamic center","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerodynamic+center"}],"status":"reported","summary":"English Wikipedia (article \"Aerodynamic center\", CC BY-SA 4.0) states: In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-disturbance-rejection-control","kind":"concept","label":"Active disturbance rejection control","sources":[{"id":"wikipedia.article.active-disturbance-rejection-control","title":"English Wikipedia article: Active disturbance rejection control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+disturbance+rejection+control"}],"status":"reported","summary":"English Wikipedia (article \"Active disturbance rejection control\", CC BY-SA 4.0) states: Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.certificate-of-analysis","kind":"concept","label":"Certificate of analysis","sources":[{"id":"wikipedia.article.certificate-of-analysis","title":"English Wikipedia article: Certificate of analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Certificate+of+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Certificate of analysis\", CC BY-SA 4.0) states: A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bipolar-transistor-biasing","kind":"concept","label":"Bipolar transistor biasing","sources":[{"id":"wikipedia.article.bipolar-transistor-biasing","title":"English Wikipedia article: Bipolar transistor biasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bipolar+transistor+biasing"}],"status":"reported","summary":"English Wikipedia (article \"Bipolar transistor biasing\", CC BY-SA 4.0) states: Biasing is the setting of the DC operating point of an electronic component.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bin-tipper","kind":"concept","label":"Bin tipper","sources":[{"id":"wikipedia.article.bin-tipper","title":"English Wikipedia article: Bin tipper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bin+tipper"}],"status":"reported","summary":"English Wikipedia (article \"Bin tipper\", CC BY-SA 4.0) states: A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.base-50","kind":"concept","label":"Base 50","sources":[{"id":"wikipedia.article.base-50","title":"English Wikipedia article: Base 50","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Base+50"}],"status":"reported","summary":"English Wikipedia (article \"Base 50\", CC BY-SA 4.0) states: A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.automotive-fuse","kind":"concept","label":"Automotive fuse","sources":[{"id":"wikipedia.article.automotive-fuse","title":"English Wikipedia article: Automotive fuse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automotive+fuse"}],"status":"reported","summary":"English Wikipedia (article \"Automotive fuse\", CC BY-SA 4.0) states: Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.contact-protection","kind":"concept","label":"Contact protection","sources":[{"id":"wikipedia.article.contact-protection","title":"English Wikipedia article: Contact protection","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contact+protection"}],"status":"reported","summary":"English Wikipedia (article \"Contact protection\", CC BY-SA 4.0) states: Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.attack-time-delay","kind":"concept","label":"Attack-time delay","sources":[{"id":"wikipedia.article.attack-time-delay","title":"English Wikipedia article: Attack-time delay","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attack-time+delay"}],"status":"reported","summary":"English Wikipedia (article \"Attack-time delay\", CC BY-SA 4.0) states: In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-carbon-arc-cutting","kind":"concept","label":"Air carbon arc cutting","sources":[{"id":"wikipedia.article.air-carbon-arc-cutting","title":"English Wikipedia article: Air carbon arc cutting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+carbon+arc+cutting"}],"status":"reported","summary":"English Wikipedia (article \"Air carbon arc cutting\", CC BY-SA 4.0) states: Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biomachining","kind":"concept","label":"Biomachining","sources":[{"id":"wikipedia.article.biomachining","title":"English Wikipedia article: Biomachining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biomachining"}],"status":"reported","summary":"English Wikipedia (article \"Biomachining\", CC BY-SA 4.0) states: Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.diode","kind":"concept","label":"Diode","sources":[{"id":"wikipedia.article.diode","title":"English Wikipedia article: Diode","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diode"}],"status":"reported","summary":"English Wikipedia (article \"Diode\", CC BY-SA 4.0) states: A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-valve","kind":"concept","label":"Ball valve","sources":[{"id":"wikipedia.article.ball-valve","title":"English Wikipedia article: Ball valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+valve"}],"status":"reported","summary":"English Wikipedia (article \"Ball valve\", CC BY-SA 4.0) states: A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bayonet-mount","kind":"concept","label":"Bayonet mount","sources":[{"id":"wikipedia.article.bayonet-mount","title":"English Wikipedia article: Bayonet mount","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bayonet+mount"}],"status":"reported","summary":"English Wikipedia (article \"Bayonet mount\", CC BY-SA 4.0) states: A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dc-injection-braking","kind":"concept","label":"DC injection braking","sources":[{"id":"wikipedia.article.dc-injection-braking","title":"English Wikipedia article: DC injection braking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=DC+injection+braking"}],"status":"reported","summary":"English Wikipedia (article \"DC injection braking\", CC BY-SA 4.0) states: DC injection braking is a method of slowing AC electric motors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-transmission","kind":"concept","label":"Acoustic transmission","sources":[{"id":"wikipedia.article.acoustic-transmission","title":"English Wikipedia article: Acoustic transmission","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+transmission"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic transmission\", CC BY-SA 4.0) states: Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-composite-materials-engineering","kind":"concept","label":"Advanced composite materials (engineering)","sources":[{"id":"wikipedia.article.advanced-composite-materials-engineering","title":"English Wikipedia article: Advanced composite materials (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+composite+materials+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Advanced composite materials (engineering)\", CC BY-SA 4.0) states: In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cascading-failure","kind":"concept","label":"Cascading failure","sources":[{"id":"wikipedia.article.cascading-failure","title":"English Wikipedia article: Cascading failure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cascading+failure"}],"status":"reported","summary":"English Wikipedia (article \"Cascading failure\", CC BY-SA 4.0) states: A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.artificial-intelligence-engineering","kind":"field","label":"Artificial intelligence engineering","sources":[{"id":"wikipedia.article.artificial-intelligence-engineering","title":"English Wikipedia article: Artificial intelligence engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artificial+intelligence+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Artificial intelligence engineering\", CC BY-SA 4.0) states: Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.architectural-ironmongery","kind":"concept","label":"Architectural ironmongery","sources":[{"id":"wikipedia.article.architectural-ironmongery","title":"English Wikipedia article: Architectural ironmongery","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+ironmongery"}],"status":"reported","summary":"English Wikipedia (article \"Architectural ironmongery\", CC BY-SA 4.0) states: Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crosshead","kind":"concept","label":"Crosshead","sources":[{"id":"wikipedia.article.crosshead","title":"English Wikipedia article: Crosshead","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crosshead"}],"status":"reported","summary":"English Wikipedia (article \"Crosshead\", CC BY-SA 4.0) states: In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.condenser-heat-transfer","kind":"concept","label":"Condenser (heat transfer)","sources":[{"id":"wikipedia.article.condenser-heat-transfer","title":"English Wikipedia article: Condenser (heat transfer)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Condenser+%28heat+transfer%29"}],"status":"reported","summary":"English Wikipedia (article \"Condenser (heat transfer)\", CC BY-SA 4.0) states: In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-control","kind":"concept","label":"Adaptive control","sources":[{"id":"wikipedia.article.adaptive-control","title":"English Wikipedia article: Adaptive control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+control"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive control\", CC BY-SA 4.0) states: Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bootstrapping-electronics","kind":"concept","label":"Bootstrapping (electronics)","sources":[{"id":"wikipedia.article.bootstrapping-electronics","title":"English Wikipedia article: Bootstrapping (electronics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bootstrapping+%28electronics%29"}],"status":"reported","summary":"English Wikipedia (article \"Bootstrapping (electronics)\", CC BY-SA 4.0) states: Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armourstone","kind":"concept","label":"Armourstone","sources":[{"id":"wikipedia.article.armourstone","title":"English Wikipedia article: Armourstone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armourstone"}],"status":"reported","summary":"English Wikipedia (article \"Armourstone\", CC BY-SA 4.0) states: Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.inflatable-packer","kind":"concept","label":"Inflatable packer","sources":[{"id":"wikipedia.article.inflatable-packer","title":"English Wikipedia article: Inflatable packer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inflatable+packer"}],"status":"reported","summary":"English Wikipedia (article \"Inflatable packer\", CC BY-SA 4.0) states: An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.centrifugal-governor","kind":"concept","label":"Centrifugal governor","sources":[{"id":"wikipedia.article.centrifugal-governor","title":"English Wikipedia article: Centrifugal governor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centrifugal+governor"}],"status":"reported","summary":"English Wikipedia (article \"Centrifugal governor\", CC BY-SA 4.0) states: A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.block-and-tackle","kind":"concept","label":"Block and tackle","sources":[{"id":"wikipedia.article.block-and-tackle","title":"English Wikipedia article: Block and tackle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Block+and+tackle"}],"status":"reported","summary":"English Wikipedia (article \"Block and tackle\", CC BY-SA 4.0) states: A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bendix-drive","kind":"concept","label":"Bendix drive","sources":[{"id":"wikipedia.article.bendix-drive","title":"English Wikipedia article: Bendix drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bendix+drive"}],"status":"reported","summary":"English Wikipedia (article \"Bendix drive\", CC BY-SA 4.0) states: A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.contingency-electrical-grid","kind":"concept","label":"Contingency (electrical grid)","sources":[{"id":"wikipedia.article.contingency-electrical-grid","title":"English Wikipedia article: Contingency (electrical grid)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contingency+%28electrical+grid%29"}],"status":"reported","summary":"English Wikipedia (article \"Contingency (electrical grid)\", CC BY-SA 4.0) states: In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ameca-robot","kind":"concept","label":"Ameca (robot)","sources":[{"id":"wikipedia.article.ameca-robot","title":"English Wikipedia article: Ameca (robot)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ameca+%28robot%29"}],"status":"reported","summary":"English Wikipedia (article \"Ameca (robot)\", CC BY-SA 4.0) states: Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autogenous-welding","kind":"concept","label":"Autogenous welding","sources":[{"id":"wikipedia.article.autogenous-welding","title":"English Wikipedia article: Autogenous welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autogenous+welding"}],"status":"reported","summary":"English Wikipedia (article \"Autogenous welding\", CC BY-SA 4.0) states: Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.boring-manufacturing","kind":"concept","label":"Boring (manufacturing)","sources":[{"id":"wikipedia.article.boring-manufacturing","title":"English Wikipedia article: Boring (manufacturing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boring+%28manufacturing%29"}],"status":"reported","summary":"English Wikipedia (article \"Boring (manufacturing)\", CC BY-SA 4.0) states: In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.composite-bearing","kind":"concept","label":"Composite bearing","sources":[{"id":"wikipedia.article.composite-bearing","title":"English Wikipedia article: Composite bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Composite+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Composite bearing\", CC BY-SA 4.0) states: A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dye-and-pry","kind":"concept","label":"Dye-and-pry","sources":[{"id":"wikipedia.article.dye-and-pry","title":"English Wikipedia article: Dye-and-pry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dye-and-pry"}],"status":"reported","summary":"English Wikipedia (article \"Dye-and-pry\", CC BY-SA 4.0) states: Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bipolar-electric-motor","kind":"concept","label":"Bipolar electric motor","sources":[{"id":"wikipedia.article.bipolar-electric-motor","title":"English Wikipedia article: Bipolar electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bipolar+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Bipolar electric motor\", CC BY-SA 4.0) states: A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beer-tap","kind":"concept","label":"Beer tap","sources":[{"id":"wikipedia.article.beer-tap","title":"English Wikipedia article: Beer tap","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beer+tap"}],"status":"reported","summary":"English Wikipedia (article \"Beer tap\", CC BY-SA 4.0) states: A beer tap is a valved device for controlling the release of beer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cycloid-gear","kind":"concept","label":"Cycloid gear","sources":[{"id":"wikipedia.article.cycloid-gear","title":"English Wikipedia article: Cycloid gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cycloid+gear"}],"status":"reported","summary":"English Wikipedia (article \"Cycloid gear\", CC BY-SA 4.0) states: A cycloidal gear is a toothed gear with a cycloidal profile.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.binder-clip","kind":"concept","label":"Binder clip","sources":[{"id":"wikipedia.article.binder-clip","title":"English Wikipedia article: Binder clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Binder+clip"}],"status":"reported","summary":"English Wikipedia (article \"Binder clip\", CC BY-SA 4.0) states: A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drive-shaft","kind":"concept","label":"Drive shaft","sources":[{"id":"wikipedia.article.drive-shaft","title":"English Wikipedia article: Drive shaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drive+shaft"}],"status":"reported","summary":"English Wikipedia (article \"Drive shaft\", CC BY-SA 4.0) states: A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-signal-processing","kind":"concept","label":"Analog signal processing","sources":[{"id":"wikipedia.article.analog-signal-processing","title":"English Wikipedia article: Analog signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Analog signal processing\", CC BY-SA 4.0) states: Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.automation-engineering","kind":"field","label":"Automation engineering","sources":[{"id":"wikipedia.article.automation-engineering","title":"English Wikipedia article: Automation engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automation+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Automation engineering\", CC BY-SA 4.0) states: Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.desander","kind":"concept","label":"Desander","sources":[{"id":"wikipedia.article.desander","title":"English Wikipedia article: Desander","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Desander"}],"status":"reported","summary":"English Wikipedia (article \"Desander\", CC BY-SA 4.0) states: Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","kind":"concept","label":"Alkali-metal thermal to electric converter","sources":[{"id":"wikipedia.article.alkali-metal-thermal-to-electric-converter","title":"English Wikipedia article: Alkali-metal thermal to electric converter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alkali-metal+thermal+to+electric+converter"}],"status":"reported","summary":"English Wikipedia (article \"Alkali-metal thermal to electric converter\", CC BY-SA 4.0) states: An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.audio-filter","kind":"concept","label":"Audio filter","sources":[{"id":"wikipedia.article.audio-filter","title":"English Wikipedia article: Audio filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audio+filter"}],"status":"reported","summary":"English Wikipedia (article \"Audio filter\", CC BY-SA 4.0) states: An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bioactive-paper","kind":"concept","label":"Bioactive paper","sources":[{"id":"wikipedia.article.bioactive-paper","title":"English Wikipedia article: Bioactive paper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bioactive+paper"}],"status":"reported","summary":"English Wikipedia (article \"Bioactive paper\", CC BY-SA 4.0) states: Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-fan-design","kind":"concept","label":"Axial fan design","sources":[{"id":"wikipedia.article.axial-fan-design","title":"English Wikipedia article: Axial fan design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+fan+design"}],"status":"reported","summary":"English Wikipedia (article \"Axial fan design\", CC BY-SA 4.0) states: An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.calcium-looping","kind":"concept","label":"Calcium looping","sources":[{"id":"wikipedia.article.calcium-looping","title":"English Wikipedia article: Calcium looping","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calcium+looping"}],"status":"reported","summary":"English Wikipedia (article \"Calcium looping\", CC BY-SA 4.0) states: Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bent-structural","kind":"concept","label":"Bent (structural)","sources":[{"id":"wikipedia.article.bent-structural","title":"English Wikipedia article: Bent (structural)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bent+%28structural%29"}],"status":"reported","summary":"English Wikipedia (article \"Bent (structural)\", CC BY-SA 4.0) states: A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-process-control","kind":"concept","label":"Advanced process control","sources":[{"id":"wikipedia.article.advanced-process-control","title":"English Wikipedia article: Advanced process control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+process+control"}],"status":"reported","summary":"English Wikipedia (article \"Advanced process control\", CC BY-SA 4.0) states: In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.concurrent-engineering","kind":"concept","label":"Concurrent engineering","sources":[{"id":"wikipedia.article.concurrent-engineering","title":"English Wikipedia article: Concurrent engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Concurrent+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Concurrent engineering\", CC BY-SA 4.0) states: Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.color-wheel-optics","kind":"concept","label":"Color wheel (optics)","sources":[{"id":"wikipedia.article.color-wheel-optics","title":"English Wikipedia article: Color wheel (optics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Color+wheel+%28optics%29"}],"status":"reported","summary":"English Wikipedia (article \"Color wheel (optics)\", CC BY-SA 4.0) states: A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buzzer","kind":"concept","label":"Buzzer","sources":[{"id":"wikipedia.article.buzzer","title":"English Wikipedia article: Buzzer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buzzer"}],"status":"reported","summary":"English Wikipedia (article \"Buzzer\", CC BY-SA 4.0) states: A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.demand-factor","kind":"concept","label":"Demand factor","sources":[{"id":"wikipedia.article.demand-factor","title":"English Wikipedia article: Demand factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Demand+factor"}],"status":"reported","summary":"English Wikipedia (article \"Demand factor\", CC BY-SA 4.0) states: In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anthrobotics","kind":"concept","label":"Anthrobotics","sources":[{"id":"wikipedia.article.anthrobotics","title":"English Wikipedia article: Anthrobotics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anthrobotics"}],"status":"reported","summary":"English Wikipedia (article \"Anthrobotics\", CC BY-SA 4.0) states: Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dn-factor","kind":"concept","label":"DN factor","sources":[{"id":"wikipedia.article.dn-factor","title":"English Wikipedia article: DN factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=DN+factor"}],"status":"reported","summary":"English Wikipedia (article \"DN factor\", CC BY-SA 4.0) states: DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.embedded-instrumentation","kind":"concept","label":"Embedded instrumentation","sources":[{"id":"wikipedia.article.embedded-instrumentation","title":"English Wikipedia article: Embedded instrumentation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Embedded+instrumentation"}],"status":"reported","summary":"English Wikipedia (article \"Embedded instrumentation\", CC BY-SA 4.0) states: In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.blast-valve","kind":"concept","label":"Blast valve","sources":[{"id":"wikipedia.article.blast-valve","title":"English Wikipedia article: Blast valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blast+valve"}],"status":"reported","summary":"English Wikipedia (article \"Blast valve\", CC BY-SA 4.0) states: A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cycloidal-drive","kind":"concept","label":"Cycloidal drive","sources":[{"id":"wikipedia.article.cycloidal-drive","title":"English Wikipedia article: Cycloidal drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cycloidal+drive"}],"status":"reported","summary":"English Wikipedia (article \"Cycloidal drive\", CC BY-SA 4.0) states: A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bolt-snap","kind":"concept","label":"Bolt snap","sources":[{"id":"wikipedia.article.bolt-snap","title":"English Wikipedia article: Bolt snap","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bolt+snap"}],"status":"reported","summary":"English Wikipedia (article \"Bolt snap\", CC BY-SA 4.0) states: A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-signal","kind":"concept","label":"Analytic signal","sources":[{"id":"wikipedia.article.analytic-signal","title":"English Wikipedia article: Analytic signal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+signal"}],"status":"reported","summary":"English Wikipedia (article \"Analytic signal\", CC BY-SA 4.0) states: In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alpha-factor","kind":"concept","label":"Alpha factor","sources":[{"id":"wikipedia.article.alpha-factor","title":"English Wikipedia article: Alpha factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alpha+factor"}],"status":"reported","summary":"English Wikipedia (article \"Alpha factor\", CC BY-SA 4.0) states: The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.chaos-engineering","kind":"field","label":"Chaos engineering","sources":[{"id":"wikipedia.article.chaos-engineering","title":"English Wikipedia article: Chaos engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chaos+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Chaos engineering\", CC BY-SA 4.0) states: Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.aviation-engineering","kind":"field","label":"Aviation engineering","sources":[{"id":"wikipedia.article.aviation-engineering","title":"English Wikipedia article: Aviation engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aviation+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Aviation engineering\", CC BY-SA 4.0) states: Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autofrettage","kind":"concept","label":"Autofrettage","sources":[{"id":"wikipedia.article.autofrettage","title":"English Wikipedia article: Autofrettage","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autofrettage"}],"status":"reported","summary":"English Wikipedia (article \"Autofrettage\", CC BY-SA 4.0) states: Autofrettage is a work-hardening process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-circuit","kind":"concept","label":"Autonomous circuit","sources":[{"id":"wikipedia.article.autonomous-circuit","title":"English Wikipedia article: Autonomous circuit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+circuit"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous circuit\", CC BY-SA 4.0) states: An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.braced-frame","kind":"concept","label":"Braced frame","sources":[{"id":"wikipedia.article.braced-frame","title":"English Wikipedia article: Braced frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braced+frame"}],"status":"reported","summary":"English Wikipedia (article \"Braced frame\", CC BY-SA 4.0) states: In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.elastomeric-bridge-bearing","kind":"concept","label":"Elastomeric bridge bearing","sources":[{"id":"wikipedia.article.elastomeric-bridge-bearing","title":"English Wikipedia article: Elastomeric bridge bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elastomeric+bridge+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Elastomeric bridge bearing\", CC BY-SA 4.0) states: An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bolometer","kind":"concept","label":"Bolometer","sources":[{"id":"wikipedia.article.bolometer","title":"English Wikipedia article: Bolometer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bolometer"}],"status":"reported","summary":"English Wikipedia (article \"Bolometer\", CC BY-SA 4.0) states: A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aeroelasticity","kind":"concept","label":"Aeroelasticity","sources":[{"id":"wikipedia.article.aeroelasticity","title":"English Wikipedia article: Aeroelasticity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aeroelasticity"}],"status":"reported","summary":"English Wikipedia (article \"Aeroelasticity\", CC BY-SA 4.0) states: Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.behavior-tree","kind":"concept","label":"Behavior tree","sources":[{"id":"wikipedia.article.behavior-tree","title":"English Wikipedia article: Behavior tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behavior+tree"}],"status":"reported","summary":"English Wikipedia (article \"Behavior tree\", CC BY-SA 4.0) states: A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.avulsion-river","kind":"concept","label":"Avulsion (river)","sources":[{"id":"wikipedia.article.avulsion-river","title":"English Wikipedia article: Avulsion (river)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Avulsion+%28river%29"}],"status":"reported","summary":"English Wikipedia (article \"Avulsion (river)\", CC BY-SA 4.0) states: In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.compliant-mechanism","kind":"concept","label":"Compliant mechanism","sources":[{"id":"wikipedia.article.compliant-mechanism","title":"English Wikipedia article: Compliant mechanism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compliant+mechanism"}],"status":"reported","summary":"English Wikipedia (article \"Compliant mechanism\", CC BY-SA 4.0) states: In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capacitor","kind":"concept","label":"Capacitor","sources":[{"id":"wikipedia.article.capacitor","title":"English Wikipedia article: Capacitor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capacitor"}],"status":"reported","summary":"English Wikipedia (article \"Capacitor\", CC BY-SA 4.0) states: A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-power-quality","kind":"concept","label":"Electric power quality","sources":[{"id":"wikipedia.article.electric-power-quality","title":"English Wikipedia article: Electric power quality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+power+quality"}],"status":"reported","summary":"English Wikipedia (article \"Electric power quality\", CC BY-SA 4.0) states: Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.butt-welding","kind":"concept","label":"Butt welding","sources":[{"id":"wikipedia.article.butt-welding","title":"English Wikipedia article: Butt welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butt+welding"}],"status":"reported","summary":"English Wikipedia (article \"Butt welding\", CC BY-SA 4.0) states: Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.counterbore","kind":"concept","label":"Counterbore","sources":[{"id":"wikipedia.article.counterbore","title":"English Wikipedia article: Counterbore","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Counterbore"}],"status":"reported","summary":"English Wikipedia (article \"Counterbore\", CC BY-SA 4.0) states: In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dry-lubricant","kind":"concept","label":"Dry lubricant","sources":[{"id":"wikipedia.article.dry-lubricant","title":"English Wikipedia article: Dry lubricant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dry+lubricant"}],"status":"reported","summary":"English Wikipedia (article \"Dry lubricant\", CC BY-SA 4.0) states: Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.braking-chopper","kind":"concept","label":"Braking chopper","sources":[{"id":"wikipedia.article.braking-chopper","title":"English Wikipedia article: Braking chopper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braking+chopper"}],"status":"reported","summary":"English Wikipedia (article \"Braking chopper\", CC BY-SA 4.0) states: Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.artificio-de-juanelo","kind":"concept","label":"Artificio de Juanelo","sources":[{"id":"wikipedia.article.artificio-de-juanelo","title":"English Wikipedia article: Artificio de Juanelo","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artificio+de+Juanelo"}],"status":"reported","summary":"English Wikipedia (article \"Artificio de Juanelo\", CC BY-SA 4.0) states: The Artificio de Juanelo (\"Gianello's artifice\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.butterfly-valve","kind":"concept","label":"Butterfly valve","sources":[{"id":"wikipedia.article.butterfly-valve","title":"English Wikipedia article: Butterfly valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butterfly+valve"}],"status":"reported","summary":"English Wikipedia (article \"Butterfly valve\", CC BY-SA 4.0) states: A butterfly valve is a valve that isolates or regulates the flow of a fluid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barn-raising","kind":"concept","label":"Barn raising","sources":[{"id":"wikipedia.article.barn-raising","title":"English Wikipedia article: Barn raising","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barn+raising"}],"status":"reported","summary":"English Wikipedia (article \"Barn raising\", CC BY-SA 4.0) states: A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flat-chain","kind":"concept","label":"Flat chain","sources":[{"id":"wikipedia.article.flat-chain","title":"English Wikipedia article: Flat chain","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flat+chain"}],"status":"reported","summary":"English Wikipedia (article \"Flat chain\", CC BY-SA 4.0) states: Flat chain is a form of chain used chiefly in agricultural machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.all-in-rate","kind":"concept","label":"All-in rate","sources":[{"id":"wikipedia.article.all-in-rate","title":"English Wikipedia article: All-in rate","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=All-in+rate"}],"status":"reported","summary":"English Wikipedia (article \"All-in rate\", CC BY-SA 4.0) states: All-in rate is a term used in both the construction industry and the financial sector.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angle-of-arrival","kind":"concept","label":"Angle of arrival","sources":[{"id":"wikipedia.article.angle-of-arrival","title":"English Wikipedia article: Angle of arrival","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angle+of+arrival"}],"status":"reported","summary":"English Wikipedia (article \"Angle of arrival\", CC BY-SA 4.0) states: The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytical-chemistry","kind":"concept","label":"Analytical chemistry","sources":[{"id":"wikipedia.article.analytical-chemistry","title":"English Wikipedia article: Analytical chemistry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytical+chemistry"}],"status":"reported","summary":"English Wikipedia (article \"Analytical chemistry\", CC BY-SA 4.0) states: Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cluster-aware-application","kind":"concept","label":"Cluster-aware application","sources":[{"id":"wikipedia.article.cluster-aware-application","title":"English Wikipedia article: Cluster-aware application","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cluster-aware+application"}],"status":"reported","summary":"English Wikipedia (article \"Cluster-aware application\", CC BY-SA 4.0) states: A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-bearing","kind":"concept","label":"Ball (bearing)","sources":[{"id":"wikipedia.article.ball-bearing","title":"English Wikipedia article: Ball (bearing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+%28bearing%29"}],"status":"reported","summary":"English Wikipedia (article \"Ball (bearing)\", CC BY-SA 4.0) states: Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baker-clamp","kind":"concept","label":"Baker clamp","sources":[{"id":"wikipedia.article.baker-clamp","title":"English Wikipedia article: Baker clamp","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baker+clamp"}],"status":"reported","summary":"English Wikipedia (article \"Baker clamp\", CC BY-SA 4.0) states: Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bressummer","kind":"concept","label":"Bressummer","sources":[{"id":"wikipedia.article.bressummer","title":"English Wikipedia article: Bressummer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bressummer"}],"status":"reported","summary":"English Wikipedia (article \"Bressummer\", CC BY-SA 4.0) states: A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flexure-bearing","kind":"concept","label":"Flexure bearing","sources":[{"id":"wikipedia.article.flexure-bearing","title":"English Wikipedia article: Flexure bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flexure+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Flexure bearing\", CC BY-SA 4.0) states: A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.radial-turbine","kind":"concept","label":"Radial turbine","sources":[{"id":"wikipedia.article.radial-turbine","title":"English Wikipedia article: Radial turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Radial+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Radial turbine\", CC BY-SA 4.0) states: A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.comb-drive","kind":"concept","label":"Comb drive","sources":[{"id":"wikipedia.article.comb-drive","title":"English Wikipedia article: Comb drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Comb+drive"}],"status":"reported","summary":"English Wikipedia (article \"Comb drive\", CC BY-SA 4.0) states: Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bubble-sensor","kind":"concept","label":"Bubble sensor","sources":[{"id":"wikipedia.article.bubble-sensor","title":"English Wikipedia article: Bubble sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bubble+sensor"}],"status":"reported","summary":"English Wikipedia (article \"Bubble sensor\", CC BY-SA 4.0) states: Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.backlash-engineering","kind":"concept","label":"Backlash (engineering)","sources":[{"id":"wikipedia.article.backlash-engineering","title":"English Wikipedia article: Backlash (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backlash+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Backlash (engineering)\", CC BY-SA 4.0) states: In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beam-bridge","kind":"concept","label":"Beam bridge","sources":[{"id":"wikipedia.article.beam-bridge","title":"English Wikipedia article: Beam bridge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beam+bridge"}],"status":"reported","summary":"English Wikipedia (article \"Beam bridge\", CC BY-SA 4.0) states: Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.body-on-frame","kind":"concept","label":"Body-on-frame","sources":[{"id":"wikipedia.article.body-on-frame","title":"English Wikipedia article: Body-on-frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Body-on-frame"}],"status":"reported","summary":"English Wikipedia (article \"Body-on-frame\", CC BY-SA 4.0) states: Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.biological-systems-engineering","kind":"field","label":"Biological systems engineering","sources":[{"id":"wikipedia.article.biological-systems-engineering","title":"English Wikipedia article: Biological systems engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biological+systems+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Biological systems engineering\", CC BY-SA 4.0) states: Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.balancing-lake","kind":"concept","label":"Balancing lake","sources":[{"id":"wikipedia.article.balancing-lake","title":"English Wikipedia article: Balancing lake","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Balancing+lake"}],"status":"reported","summary":"English Wikipedia (article \"Balancing lake\", CC BY-SA 4.0) states: A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.corexy","kind":"concept","label":"CoreXY","sources":[{"id":"wikipedia.article.corexy","title":"English Wikipedia article: CoreXY","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=CoreXY"}],"status":"reported","summary":"English Wikipedia (article \"CoreXY\", CC BY-SA 4.0) states: CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.digifold","kind":"concept","label":"Digifold","sources":[{"id":"wikipedia.article.digifold","title":"English Wikipedia article: Digifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Digifold"}],"status":"reported","summary":"English Wikipedia (article \"Digifold\", CC BY-SA 4.0) states: Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.carnot-heat-engine","kind":"concept","label":"Carnot heat engine","sources":[{"id":"wikipedia.article.carnot-heat-engine","title":"English Wikipedia article: Carnot heat engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carnot+heat+engine"}],"status":"reported","summary":"English Wikipedia (article \"Carnot heat engine\", CC BY-SA 4.0) states: A Carnot heat engine (English: kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.commutator-electric","kind":"concept","label":"Commutator (electric)","sources":[{"id":"wikipedia.article.commutator-electric","title":"English Wikipedia article: Commutator (electric)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commutator+%28electric%29"}],"status":"reported","summary":"English Wikipedia (article \"Commutator (electric)\", CC BY-SA 4.0) states: A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-power-system","kind":"concept","label":"Electric power system","sources":[{"id":"wikipedia.article.electric-power-system","title":"English Wikipedia article: Electric power system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+power+system"}],"status":"reported","summary":"English Wikipedia (article \"Electric power system\", CC BY-SA 4.0) states: An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bergeron-diagram","kind":"concept","label":"Bergeron diagram","sources":[{"id":"wikipedia.article.bergeron-diagram","title":"English Wikipedia article: Bergeron diagram","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bergeron+diagram"}],"status":"reported","summary":"English Wikipedia (article \"Bergeron diagram\", CC BY-SA 4.0) states: The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.field-programmable-gate-array","kind":"concept","label":"Field-programmable gate array","sources":[{"id":"wikipedia.article.field-programmable-gate-array","title":"English Wikipedia article: Field-programmable gate array","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Field-programmable+gate+array"}],"status":"reported","summary":"English Wikipedia (article \"Field-programmable gate array\", CC BY-SA 4.0) states: A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brush-electric","kind":"concept","label":"Brush (electric)","sources":[{"id":"wikipedia.article.brush-electric","title":"English Wikipedia article: Brush (electric)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brush+%28electric%29"}],"status":"reported","summary":"English Wikipedia (article \"Brush (electric)\", CC BY-SA 4.0) states: A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-flow-pump","kind":"concept","label":"Axial-flow pump","sources":[{"id":"wikipedia.article.axial-flow-pump","title":"English Wikipedia article: Axial-flow pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial-flow+pump"}],"status":"reported","summary":"English Wikipedia (article \"Axial-flow pump\", CC BY-SA 4.0) states: An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cask-breather","kind":"concept","label":"Cask breather","sources":[{"id":"wikipedia.article.cask-breather","title":"English Wikipedia article: Cask breather","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cask+breather"}],"status":"reported","summary":"English Wikipedia (article \"Cask breather\", CC BY-SA 4.0) states: A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.epicyclic-gearing","kind":"concept","label":"Epicyclic gearing","sources":[{"id":"wikipedia.article.epicyclic-gearing","title":"English Wikipedia article: Epicyclic gearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epicyclic+gearing"}],"status":"reported","summary":"English Wikipedia (article \"Epicyclic gearing\", CC BY-SA 4.0) states: An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \"planet\") revolves around the center of the other (the \"sun\").","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brass-fastener","kind":"concept","label":"Brass fastener","sources":[{"id":"wikipedia.article.brass-fastener","title":"English Wikipedia article: Brass fastener","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brass+fastener"}],"status":"reported","summary":"English Wikipedia (article \"Brass fastener\", CC BY-SA 4.0) states: A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flexible-shaft","kind":"concept","label":"Flexible shaft","sources":[{"id":"wikipedia.article.flexible-shaft","title":"English Wikipedia article: Flexible shaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flexible+shaft"}],"status":"reported","summary":"English Wikipedia (article \"Flexible shaft\", CC BY-SA 4.0) states: A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.apodization","kind":"concept","label":"Apodization","sources":[{"id":"wikipedia.article.apodization","title":"English Wikipedia article: Apodization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apodization"}],"status":"reported","summary":"English Wikipedia (article \"Apodization\", CC BY-SA 4.0) states: In signal processing, apodization (from Greek \"removing the foot\") is the modification of the shape of a mathematical function.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.data-center-tiers","kind":"concept","label":"Data center tiers","sources":[{"id":"wikipedia.article.data-center-tiers","title":"English Wikipedia article: Data center tiers","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+center+tiers"}],"status":"reported","summary":"English Wikipedia (article \"Data center tiers\", CC BY-SA 4.0) states: Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.bioresource-engineering","kind":"field","label":"Bioresource engineering","sources":[{"id":"wikipedia.article.bioresource-engineering","title":"English Wikipedia article: Bioresource engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bioresource+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Bioresource engineering\", CC BY-SA 4.0) states: Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bandgap-voltage-reference","kind":"concept","label":"Bandgap voltage reference","sources":[{"id":"wikipedia.article.bandgap-voltage-reference","title":"English Wikipedia article: Bandgap voltage reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bandgap+voltage+reference"}],"status":"reported","summary":"English Wikipedia (article \"Bandgap voltage reference\", CC BY-SA 4.0) states: A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fluid-bearing","kind":"concept","label":"Fluid bearing","sources":[{"id":"wikipedia.article.fluid-bearing","title":"English Wikipedia article: Fluid bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fluid+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Fluid bearing\", CC BY-SA 4.0) states: Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flue-gas-condensation","kind":"concept","label":"Flue-gas condensation","sources":[{"id":"wikipedia.article.flue-gas-condensation","title":"English Wikipedia article: Flue-gas condensation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flue-gas+condensation"}],"status":"reported","summary":"English Wikipedia (article \"Flue-gas condensation\", CC BY-SA 4.0) states: Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cameleon-protein","kind":"concept","label":"Cameleon (protein)","sources":[{"id":"wikipedia.article.cameleon-protein","title":"English Wikipedia article: Cameleon (protein)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cameleon+%28protein%29"}],"status":"reported","summary":"English Wikipedia (article \"Cameleon (protein)\", CC BY-SA 4.0) states: Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-detent","kind":"concept","label":"Ball detent","sources":[{"id":"wikipedia.article.ball-detent","title":"English Wikipedia article: Ball detent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+detent"}],"status":"reported","summary":"English Wikipedia (article \"Ball detent\", CC BY-SA 4.0) states: A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bending-moment","kind":"concept","label":"Bending moment","sources":[{"id":"wikipedia.article.bending-moment","title":"English Wikipedia article: Bending moment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bending+moment"}],"status":"reported","summary":"English Wikipedia (article \"Bending moment\", CC BY-SA 4.0) states: In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-topology-electrical","kind":"concept","label":"Circuit topology (electrical)","sources":[{"id":"wikipedia.article.circuit-topology-electrical","title":"English Wikipedia article: Circuit topology (electrical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+topology+%28electrical%29"}],"status":"reported","summary":"English Wikipedia (article \"Circuit topology (electrical)\", CC BY-SA 4.0) states: The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemical-reaction-engineering","kind":"concept","label":"Chemical reaction engineering","sources":[{"id":"wikipedia.article.chemical-reaction-engineering","title":"English Wikipedia article: Chemical reaction engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemical+reaction+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Chemical reaction engineering\", CC BY-SA 4.0) states: Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-architecture","kind":"concept","label":"Aerospace architecture","sources":[{"id":"wikipedia.article.aerospace-architecture","title":"English Wikipedia article: Aerospace architecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+architecture"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace architecture\", CC BY-SA 4.0) states: Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.design-manufacture-service","kind":"concept","label":"Design manufacture service","sources":[{"id":"wikipedia.article.design-manufacture-service","title":"English Wikipedia article: Design manufacture service","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+manufacture+service"}],"status":"reported","summary":"English Wikipedia (article \"Design manufacture service\", CC BY-SA 4.0) states: Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.continuous-emissions-monitoring-system","kind":"concept","label":"Continuous emissions monitoring system","sources":[{"id":"wikipedia.article.continuous-emissions-monitoring-system","title":"English Wikipedia article: Continuous emissions monitoring system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Continuous+emissions+monitoring+system"}],"status":"reported","summary":"English Wikipedia (article \"Continuous emissions monitoring system\", CC BY-SA 4.0) states: Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.offshore-geotechnical-engineering","kind":"field","label":"Offshore geotechnical engineering","sources":[{"id":"wikipedia.article.offshore-geotechnical-engineering","title":"English Wikipedia article: Offshore geotechnical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Offshore+geotechnical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Offshore geotechnical engineering\", CC BY-SA 4.0) states: Offshore geotechnical engineering is a sub-field of geotechnical engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.coupling","kind":"concept","label":"Coupling","sources":[{"id":"wikipedia.article.coupling","title":"English Wikipedia article: Coupling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coupling"}],"status":"reported","summary":"English Wikipedia (article \"Coupling\", CC BY-SA 4.0) states: A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ceramic-engine","kind":"concept","label":"Ceramic engine","sources":[{"id":"wikipedia.article.ceramic-engine","title":"English Wikipedia article: Ceramic engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ceramic+engine"}],"status":"reported","summary":"English Wikipedia (article \"Ceramic engine\", CC BY-SA 4.0) states: A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.conductive-ink","kind":"concept","label":"Conductive ink","sources":[{"id":"wikipedia.article.conductive-ink","title":"English Wikipedia article: Conductive ink","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conductive+ink"}],"status":"reported","summary":"English Wikipedia (article \"Conductive ink\", CC BY-SA 4.0) states: Conductive ink is an ink that results in a printed object which conducts electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-aircraft","kind":"concept","label":"Autonomous aircraft","sources":[{"id":"wikipedia.article.autonomous-aircraft","title":"English Wikipedia article: Autonomous aircraft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+aircraft"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous aircraft\", CC BY-SA 4.0) states: An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-tool-machining","kind":"concept","label":"Cutting tool (machining)","sources":[{"id":"wikipedia.article.cutting-tool-machining","title":"English Wikipedia article: Cutting tool (machining)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+tool+%28machining%29"}],"status":"reported","summary":"English Wikipedia (article \"Cutting tool (machining)\", CC BY-SA 4.0) states: In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.false-brinelling","kind":"concept","label":"False brinelling","sources":[{"id":"wikipedia.article.false-brinelling","title":"English Wikipedia article: False brinelling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=False+brinelling"}],"status":"reported","summary":"English Wikipedia (article \"False brinelling\", CC BY-SA 4.0) states: False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fin-field-effect-transistor","kind":"concept","label":"Fin field-effect transistor","sources":[{"id":"wikipedia.article.fin-field-effect-transistor","title":"English Wikipedia article: Fin field-effect transistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fin+field-effect+transistor"}],"status":"reported","summary":"English Wikipedia (article \"Fin field-effect transistor\", CC BY-SA 4.0) states: A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brushed-dc-electric-motor","kind":"concept","label":"Brushed DC electric motor","sources":[{"id":"wikipedia.article.brushed-dc-electric-motor","title":"English Wikipedia article: Brushed DC electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brushed+DC+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Brushed DC electric motor\", CC BY-SA 4.0) states: A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-piston-pump","kind":"concept","label":"Axial piston pump","sources":[{"id":"wikipedia.article.axial-piston-pump","title":"English Wikipedia article: Axial piston pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+piston+pump"}],"status":"reported","summary":"English Wikipedia (article \"Axial piston pump\", CC BY-SA 4.0) states: An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.check-valve","kind":"concept","label":"Check valve","sources":[{"id":"wikipedia.article.check-valve","title":"English Wikipedia article: Check valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Check+valve"}],"status":"reported","summary":"English Wikipedia (article \"Check valve\", CC BY-SA 4.0) states: A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bread-clip","kind":"concept","label":"Bread clip","sources":[{"id":"wikipedia.article.bread-clip","title":"English Wikipedia article: Bread clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bread+clip"}],"status":"reported","summary":"English Wikipedia (article \"Bread clip\", CC BY-SA 4.0) states: A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fluid-coupling","kind":"concept","label":"Fluid coupling","sources":[{"id":"wikipedia.article.fluid-coupling","title":"English Wikipedia article: Fluid coupling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fluid+coupling"}],"status":"reported","summary":"English Wikipedia (article \"Fluid coupling\", CC BY-SA 4.0) states: A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.annealing-materials-science","kind":"concept","label":"Annealing (materials science)","sources":[{"id":"wikipedia.article.annealing-materials-science","title":"English Wikipedia article: Annealing (materials science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Annealing+%28materials+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Annealing (materials science)\", CC BY-SA 4.0) states: In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baubotanik","kind":"concept","label":"Baubotanik","sources":[{"id":"wikipedia.article.baubotanik","title":"English Wikipedia article: Baubotanik","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baubotanik"}],"status":"reported","summary":"English Wikipedia (article \"Baubotanik\", CC BY-SA 4.0) states: Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.blowpipe-tool","kind":"concept","label":"Blowpipe (tool)","sources":[{"id":"wikipedia.article.blowpipe-tool","title":"English Wikipedia article: Blowpipe (tool)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blowpipe+%28tool%29"}],"status":"reported","summary":"English Wikipedia (article \"Blowpipe (tool)\", CC BY-SA 4.0) states: A blowpipe is one of several tools used to direct streams of gases into any of several working media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barkhausen-stability-criterion","kind":"concept","label":"Barkhausen stability criterion","sources":[{"id":"wikipedia.article.barkhausen-stability-criterion","title":"English Wikipedia article: Barkhausen stability criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barkhausen+stability+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Barkhausen stability criterion\", CC BY-SA 4.0) states: In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.foil-bearing","kind":"concept","label":"Foil bearing","sources":[{"id":"wikipedia.article.foil-bearing","title":"English Wikipedia article: Foil bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Foil+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Foil bearing\", CC BY-SA 4.0) states: A foil bearing, also known as a foil-air bearing, is a type of air bearing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.tesla-turbine","kind":"concept","label":"Tesla turbine","sources":[{"id":"wikipedia.article.tesla-turbine","title":"English Wikipedia article: Tesla turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tesla+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Tesla turbine\", CC BY-SA 4.0) states: The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemical-field-effect-transistor","kind":"concept","label":"Chemical field-effect transistor","sources":[{"id":"wikipedia.article.chemical-field-effect-transistor","title":"English Wikipedia article: Chemical field-effect transistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemical+field-effect+transistor"}],"status":"reported","summary":"English Wikipedia (article \"Chemical field-effect transistor\", CC BY-SA 4.0) states: A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-total-limitation","kind":"concept","label":"Circuit total limitation","sources":[{"id":"wikipedia.article.circuit-total-limitation","title":"English Wikipedia article: Circuit total limitation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+total+limitation"}],"status":"reported","summary":"English Wikipedia (article \"Circuit total limitation\", CC BY-SA 4.0) states: Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buckling-restrained-braced-frame","kind":"concept","label":"Buckling-restrained braced frame","sources":[{"id":"wikipedia.article.buckling-restrained-braced-frame","title":"English Wikipedia article: Buckling-restrained braced frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buckling-restrained+braced+frame"}],"status":"reported","summary":"English Wikipedia (article \"Buckling-restrained braced frame\", CC BY-SA 4.0) states: Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-bearing","kind":"concept","label":"Aerospace bearing","sources":[{"id":"wikipedia.article.aerospace-bearing","title":"English Wikipedia article: Aerospace bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace bearing\", CC BY-SA 4.0) states: Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anticausal-system","kind":"concept","label":"Anticausal system","sources":[{"id":"wikipedia.article.anticausal-system","title":"English Wikipedia article: Anticausal system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anticausal+system"}],"status":"reported","summary":"English Wikipedia (article \"Anticausal system\", CC BY-SA 4.0) states: In systems theory, an anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crayford-focuser","kind":"concept","label":"Crayford focuser","sources":[{"id":"wikipedia.article.crayford-focuser","title":"English Wikipedia article: Crayford focuser","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crayford+focuser"}],"status":"reported","summary":"English Wikipedia (article \"Crayford focuser\", CC BY-SA 4.0) states: The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.colloid-thruster","kind":"concept","label":"Colloid thruster","sources":[{"id":"wikipedia.article.colloid-thruster","title":"English Wikipedia article: Colloid thruster","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Colloid+thruster"}],"status":"reported","summary":"English Wikipedia (article \"Colloid thruster\", CC BY-SA 4.0) states: A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.control-knob","kind":"concept","label":"Control knob","sources":[{"id":"wikipedia.article.control-knob","title":"English Wikipedia article: Control knob","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+knob"}],"status":"reported","summary":"English Wikipedia (article \"Control knob\", CC BY-SA 4.0) states: A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electrical-fault","kind":"concept","label":"Electrical fault","sources":[{"id":"wikipedia.article.electrical-fault","title":"English Wikipedia article: Electrical fault","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electrical+fault"}],"status":"reported","summary":"English Wikipedia (article \"Electrical fault\", CC BY-SA 4.0) states: In an electric power system, a fault is a defect that results in abnormality of electric current.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-logistics","kind":"concept","label":"Autonomous logistics","sources":[{"id":"wikipedia.article.autonomous-logistics","title":"English Wikipedia article: Autonomous logistics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+logistics"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous logistics\", CC BY-SA 4.0) states: Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welder-certification","kind":"concept","label":"Welder certification","sources":[{"id":"wikipedia.article.welder-certification","title":"English Wikipedia article: Welder certification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welder+certification"}],"status":"reported","summary":"English Wikipedia (article \"Welder certification\", CC BY-SA 4.0) states: Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-tool-material","kind":"concept","label":"Cutting tool material","sources":[{"id":"wikipedia.article.cutting-tool-material","title":"English Wikipedia article: Cutting tool material","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+tool+material"}],"status":"reported","summary":"English Wikipedia (article \"Cutting tool material\", CC BY-SA 4.0) states: Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fretting","kind":"concept","label":"Fretting","sources":[{"id":"wikipedia.article.fretting","title":"English Wikipedia article: Fretting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fretting"}],"status":"reported","summary":"English Wikipedia (article \"Fretting\", CC BY-SA 4.0) states: Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gate-oxide","kind":"concept","label":"Gate oxide","sources":[{"id":"wikipedia.article.gate-oxide","title":"English Wikipedia article: Gate oxide","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gate+oxide"}],"status":"reported","summary":"English Wikipedia (article \"Gate oxide\", CC BY-SA 4.0) states: The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brushless-dc-electric-motor","kind":"concept","label":"Brushless DC electric motor","sources":[{"id":"wikipedia.article.brushless-dc-electric-motor","title":"English Wikipedia article: Brushless DC electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brushless+DC+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Brushless DC electric motor\", CC BY-SA 4.0) states: A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beer-engine","kind":"concept","label":"Beer engine","sources":[{"id":"wikipedia.article.beer-engine","title":"English Wikipedia article: Beer engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beer+engine"}],"status":"reported","summary":"English Wikipedia (article \"Beer engine\", CC BY-SA 4.0) states: A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.breech-lock","kind":"concept","label":"Breech-lock","sources":[{"id":"wikipedia.article.breech-lock","title":"English Wikipedia article: Breech-lock","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breech-lock"}],"status":"reported","summary":"English Wikipedia (article \"Breech-lock\", CC BY-SA 4.0) states: A breech-lock is a system for mounting camera lenses to camera bodies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.high-tensile-chain","kind":"concept","label":"High-tensile chain","sources":[{"id":"wikipedia.article.high-tensile-chain","title":"English Wikipedia article: High-tensile chain","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=High-tensile+chain"}],"status":"reported","summary":"English Wikipedia (article \"High-tensile chain\", CC BY-SA 4.0) states: A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength used for drawing or securing loads.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buttressed-core","kind":"concept","label":"Buttressed core","sources":[{"id":"wikipedia.article.buttressed-core","title":"English Wikipedia article: Buttressed core","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buttressed+core"}],"status":"reported","summary":"English Wikipedia (article \"Buttressed core\", CC BY-SA 4.0) states: A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.hoist-device","kind":"concept","label":"Hoist (device)","sources":[{"id":"wikipedia.article.hoist-device","title":"English Wikipedia article: Hoist (device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hoist+%28device%29"}],"status":"reported","summary":"English Wikipedia (article \"Hoist (device)\", CC BY-SA 4.0) states: A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemiresistor","kind":"concept","label":"Chemiresistor","sources":[{"id":"wikipedia.article.chemiresistor","title":"English Wikipedia article: Chemiresistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemiresistor"}],"status":"reported","summary":"English Wikipedia (article \"Chemiresistor\", CC BY-SA 4.0) states: A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bearing-pressure","kind":"concept","label":"Bearing pressure","sources":[{"id":"wikipedia.article.bearing-pressure","title":"English Wikipedia article: Bearing pressure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bearing+pressure"}],"status":"reported","summary":"English Wikipedia (article \"Bearing pressure\", CC BY-SA 4.0) states: Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.common-rail-electricity","kind":"concept","label":"Common rail (electricity)","sources":[{"id":"wikipedia.article.common-rail-electricity","title":"English Wikipedia article: Common rail (electricity)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Common+rail+%28electricity%29"}],"status":"reported","summary":"English Wikipedia (article \"Common rail (electricity)\", CC BY-SA 4.0) states: In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-materials","kind":"concept","label":"Aerospace materials","sources":[{"id":"wikipedia.article.aerospace-materials","title":"English Wikipedia article: Aerospace materials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+materials"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace materials\", CC BY-SA 4.0) states: Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-extraction","kind":"concept","label":"Circuit extraction","sources":[{"id":"wikipedia.article.circuit-extraction","title":"English Wikipedia article: Circuit extraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+extraction"}],"status":"reported","summary":"English Wikipedia (article \"Circuit extraction\", CC BY-SA 4.0) states: The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dashpot","kind":"concept","label":"Dashpot","sources":[{"id":"wikipedia.article.dashpot","title":"English Wikipedia article: Dashpot","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dashpot"}],"status":"reported","summary":"English Wikipedia (article \"Dashpot\", CC BY-SA 4.0) states: A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.carrier-grade","kind":"concept","label":"Carrier grade","sources":[{"id":"wikipedia.article.carrier-grade","title":"English Wikipedia article: Carrier grade","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carrier+grade"}],"status":"reported","summary":"English Wikipedia (article \"Carrier grade\", CC BY-SA 4.0) states: In telecommunications, a \"carrier grade\" or \"carrier class\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.friction","kind":"concept","label":"Friction","sources":[{"id":"wikipedia.article.friction","title":"English Wikipedia article: Friction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Friction"}],"status":"reported","summary":"English Wikipedia (article \"Friction\", CC BY-SA 4.0) states: Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.clutch-delay-valve","kind":"concept","label":"Clutch delay valve","sources":[{"id":"wikipedia.article.clutch-delay-valve","title":"English Wikipedia article: Clutch delay valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clutch+delay+valve"}],"status":"reported","summary":"English Wikipedia (article \"Clutch delay valve\", CC BY-SA 4.0) states: A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear-oil","kind":"concept","label":"Gear oil","sources":[{"id":"wikipedia.article.gear-oil","title":"English Wikipedia article: Gear oil","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear+oil"}],"status":"reported","summary":"English Wikipedia (article \"Gear oil\", CC BY-SA 4.0) states: Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.architectural-acoustics","kind":"field","label":"Architectural acoustics","sources":[{"id":"wikipedia.article.architectural-acoustics","title":"English Wikipedia article: Architectural acoustics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+acoustics"}],"status":"reported","summary":"English Wikipedia (article \"Architectural acoustics\", CC BY-SA 4.0) states: Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.audio-signal-processing","kind":"concept","label":"Audio signal processing","sources":[{"id":"wikipedia.article.audio-signal-processing","title":"English Wikipedia article: Audio signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audio+signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Audio signal processing\", CC BY-SA 4.0) states: Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.computer-engineering","kind":"field","label":"Computer engineering","sources":[{"id":"wikipedia.article.computer-engineering","title":"English Wikipedia article: Computer engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer engineering\", CC BY-SA 4.0) states: Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.best-management-practice-for-water-pollution","kind":"concept","label":"Best management practice for water pollution","sources":[{"id":"wikipedia.article.best-management-practice-for-water-pollution","title":"English Wikipedia article: Best management practice for water pollution","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Best+management+practice+for+water+pollution"}],"status":"reported","summary":"English Wikipedia (article \"Best management practice for water pollution\", CC BY-SA 4.0) states: Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.betavoltaic-device","kind":"concept","label":"Betavoltaic device","sources":[{"id":"wikipedia.article.betavoltaic-device","title":"English Wikipedia article: Betavoltaic device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Betavoltaic+device"}],"status":"reported","summary":"English Wikipedia (article \"Betavoltaic device\", CC BY-SA 4.0) states: A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brokaw-bandgap-reference","kind":"concept","label":"Brokaw bandgap reference","sources":[{"id":"wikipedia.article.brokaw-bandgap-reference","title":"English Wikipedia article: Brokaw bandgap reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brokaw+bandgap+reference"}],"status":"reported","summary":"English Wikipedia (article \"Brokaw bandgap reference\", CC BY-SA 4.0) states: The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cantilever","kind":"concept","label":"Cantilever","sources":[{"id":"wikipedia.article.cantilever","title":"English Wikipedia article: Cantilever","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantilever"}],"status":"reported","summary":"English Wikipedia (article \"Cantilever\", CC BY-SA 4.0) states: A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heat-sink","kind":"concept","label":"Heat sink","sources":[{"id":"wikipedia.article.heat-sink","title":"English Wikipedia article: Heat sink","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heat+sink"}],"status":"reported","summary":"English Wikipedia (article \"Heat sink\", CC BY-SA 4.0) states: A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.hydraulic-cylinder","kind":"concept","label":"Hydraulic cylinder","sources":[{"id":"wikipedia.article.hydraulic-cylinder","title":"English Wikipedia article: Hydraulic cylinder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hydraulic+cylinder"}],"status":"reported","summary":"English Wikipedia (article \"Hydraulic cylinder\", CC BY-SA 4.0) states: A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.chemotronics","kind":"field","label":"Chemotronics","sources":[{"id":"wikipedia.article.chemotronics","title":"English Wikipedia article: Chemotronics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemotronics"}],"status":"reported","summary":"English Wikipedia (article \"Chemotronics\", CC BY-SA 4.0) states: Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bearing-surface","kind":"concept","label":"Bearing surface","sources":[{"id":"wikipedia.article.bearing-surface","title":"English Wikipedia article: Bearing surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bearing+surface"}],"status":"reported","summary":"English Wikipedia (article \"Bearing surface\", CC BY-SA 4.0) states: A bearing surface in mechanical engineering is the area of contact between two objects.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-bearing","kind":"concept","label":"Bridge bearing","sources":[{"id":"wikipedia.article.bridge-bearing","title":"English Wikipedia article: Bridge bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Bridge bearing\", CC BY-SA 4.0) states: In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","kind":"concept","label":"Directed assembly of micro- and nano-structures","sources":[{"id":"wikipedia.article.directed-assembly-of-micro-and-nano-structures","title":"English Wikipedia article: Directed assembly of micro- and nano-structures","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Directed+assembly+of+micro-+and+nano-structures"}],"status":"reported","summary":"English Wikipedia (article \"Directed assembly of micro- and nano-structures\", CC BY-SA 4.0) states: Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-color-code","kind":"concept","label":"Electronic color code","sources":[{"id":"wikipedia.article.electronic-color-code","title":"English Wikipedia article: Electronic color code","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+color+code"}],"status":"reported","summary":"English Wikipedia (article \"Electronic color code\", CC BY-SA 4.0) states: An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capella-engineering","kind":"concept","label":"Capella (engineering)","sources":[{"id":"wikipedia.article.capella-engineering","title":"English Wikipedia article: Capella (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capella+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Capella (engineering)\", CC BY-SA 4.0) states: Capella is an open-source solution for model-based systems engineering (MBSE).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.detent","kind":"concept","label":"Detent","sources":[{"id":"wikipedia.article.detent","title":"English Wikipedia article: Detent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Detent"}],"status":"reported","summary":"English Wikipedia (article \"Detent\", CC BY-SA 4.0) states: A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","kind":"concept","label":"Elastic and inelastic collisions apparatus","sources":[{"id":"wikipedia.article.elastic-and-inelastic-collisions-apparatus","title":"English Wikipedia article: Elastic and inelastic collisions apparatus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elastic+and+inelastic+collisions+apparatus"}],"status":"reported","summary":"English Wikipedia (article \"Elastic and inelastic collisions apparatus\", CC BY-SA 4.0) states: The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.behavior-based-robotics","kind":"concept","label":"Behavior-based robotics","sources":[{"id":"wikipedia.article.behavior-based-robotics","title":"English Wikipedia article: Behavior-based robotics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behavior-based+robotics"}],"status":"reported","summary":"English Wikipedia (article \"Behavior-based robotics\", CC BY-SA 4.0) states: Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cold-metal-transfer","kind":"concept","label":"Cold metal transfer","sources":[{"id":"wikipedia.article.cold-metal-transfer","title":"English Wikipedia article: Cold metal transfer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cold+metal+transfer"}],"status":"reported","summary":"English Wikipedia (article \"Cold metal transfer\", CC BY-SA 4.0) states: Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drill-bit-sizes","kind":"concept","label":"Drill bit sizes","sources":[{"id":"wikipedia.article.drill-bit-sizes","title":"English Wikipedia article: Drill bit sizes","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drill+bit+sizes"}],"status":"reported","summary":"English Wikipedia (article \"Drill bit sizes\", CC BY-SA 4.0) states: Drill bits are the cutting tools of drilling machines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear","kind":"concept","label":"Gear","sources":[{"id":"wikipedia.article.gear","title":"English Wikipedia article: Gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear"}],"status":"reported","summary":"English Wikipedia (article \"Gear\", CC BY-SA 4.0) states: A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \"teeth\" that engage with compatible teeth of another gear or other part.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ggnmos","kind":"concept","label":"GgNMOS","sources":[{"id":"wikipedia.article.ggnmos","title":"English Wikipedia article: GgNMOS","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=GgNMOS"}],"status":"reported","summary":"English Wikipedia (article \"GgNMOS\", CC BY-SA 4.0) states: Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cogging-torque","kind":"concept","label":"Cogging torque","sources":[{"id":"wikipedia.article.cogging-torque","title":"English Wikipedia article: Cogging torque","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cogging+torque"}],"status":"reported","summary":"English Wikipedia (article \"Cogging torque\", CC BY-SA 4.0) states: In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bilge-pump","kind":"concept","label":"Bilge pump","sources":[{"id":"wikipedia.article.bilge-pump","title":"English Wikipedia article: Bilge pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bilge+pump"}],"status":"reported","summary":"English Wikipedia (article \"Bilge pump\", CC BY-SA 4.0) states: A bilge pump is a water pump used to remove bilge water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.control-valve","kind":"concept","label":"Control valve","sources":[{"id":"wikipedia.article.control-valve","title":"English Wikipedia article: Control valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+valve"}],"status":"reported","summary":"English Wikipedia (article \"Control valve\", CC BY-SA 4.0) states: A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brooch","kind":"concept","label":"Brooch","sources":[{"id":"wikipedia.article.brooch","title":"English Wikipedia article: Brooch","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brooch"}],"status":"reported","summary":"English Wikipedia (article \"Brooch\", CC BY-SA 4.0) states: A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.big-stan-drill-rig","kind":"concept","label":"Big Stan (drill rig)","sources":[{"id":"wikipedia.article.big-stan-drill-rig","title":"English Wikipedia article: Big Stan (drill rig)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big+Stan+%28drill+rig%29"}],"status":"reported","summary":"English Wikipedia (article \"Big Stan (drill rig)\", CC BY-SA 4.0) states: Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.inverterization","kind":"concept","label":"Inverterization","sources":[{"id":"wikipedia.article.inverterization","title":"English Wikipedia article: Inverterization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inverterization"}],"status":"reported","summary":"English Wikipedia (article \"Inverterization\", CC BY-SA 4.0) states: Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bauschinger-effect","kind":"concept","label":"Bauschinger effect","sources":[{"id":"wikipedia.article.bauschinger-effect","title":"English Wikipedia article: Bauschinger effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bauschinger+effect"}],"status":"reported","summary":"English Wikipedia (article \"Bauschinger effect\", CC BY-SA 4.0) states: The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.computer-network-engineering","kind":"field","label":"Computer network engineering","sources":[{"id":"wikipedia.article.computer-network-engineering","title":"English Wikipedia article: Computer network engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer+network+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer network engineering\", CC BY-SA 4.0) states: Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biofilter","kind":"concept","label":"Biofilter","sources":[{"id":"wikipedia.article.biofilter","title":"English Wikipedia article: Biofilter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biofilter"}],"status":"reported","summary":"English Wikipedia (article \"Biofilter\", CC BY-SA 4.0) states: Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capacitor-discharge-sintering","kind":"concept","label":"Capacitor discharge sintering","sources":[{"id":"wikipedia.article.capacitor-discharge-sintering","title":"English Wikipedia article: Capacitor discharge sintering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capacitor+discharge+sintering"}],"status":"reported","summary":"English Wikipedia (article \"Capacitor discharge sintering\", CC BY-SA 4.0) states: Capacitor discharge sintering (CDS) is an electric current assisted sintering (ECAS) technique.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bus-holder","kind":"concept","label":"Bus-holder","sources":[{"id":"wikipedia.article.bus-holder","title":"English Wikipedia article: Bus-holder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bus-holder"}],"status":"reported","summary":"English Wikipedia (article \"Bus-holder\", CC BY-SA 4.0) states: A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.colonnette","kind":"concept","label":"Colonnette","sources":[{"id":"wikipedia.article.colonnette","title":"English Wikipedia article: Colonnette","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Colonnette"}],"status":"reported","summary":"English Wikipedia (article \"Colonnette\", CC BY-SA 4.0) states: A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heater-core","kind":"concept","label":"Heater core","sources":[{"id":"wikipedia.article.heater-core","title":"English Wikipedia article: Heater core","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heater+core"}],"status":"reported","summary":"English Wikipedia (article \"Heater core\", CC BY-SA 4.0) states: A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.turbine-trip","kind":"concept","label":"Turbine trip","sources":[{"id":"wikipedia.article.turbine-trip","title":"English Wikipedia article: Turbine trip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turbine+trip"}],"status":"reported","summary":"English Wikipedia (article \"Turbine trip\", CC BY-SA 4.0) states: A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.linear-actuator","kind":"concept","label":"Linear actuator","sources":[{"id":"wikipedia.article.linear-actuator","title":"English Wikipedia article: Linear actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Linear+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Linear actuator\", CC BY-SA 4.0) states: A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.copper-loss","kind":"concept","label":"Copper loss","sources":[{"id":"wikipedia.article.copper-loss","title":"English Wikipedia article: Copper loss","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Copper+loss"}],"status":"reported","summary":"English Wikipedia (article \"Copper loss\", CC BY-SA 4.0) states: Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.deal-grove-model","kind":"concept","label":"Deal–Grove model","sources":[{"id":"wikipedia.article.deal-grove-model","title":"English Wikipedia article: Deal–Grove model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deal%E2%80%93Grove+model"}],"status":"reported","summary":"English Wikipedia (article \"Deal–Grove model\", CC BY-SA 4.0) states: The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerostructure","kind":"concept","label":"Aerostructure","sources":[{"id":"wikipedia.article.aerostructure","title":"English Wikipedia article: Aerostructure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerostructure"}],"status":"reported","summary":"English Wikipedia (article \"Aerostructure\", CC BY-SA 4.0) states: An aerostructure is a component of an aircraft's airframe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.downstream-manufacturing","kind":"concept","label":"Downstream (manufacturing)","sources":[{"id":"wikipedia.article.downstream-manufacturing","title":"English Wikipedia article: Downstream (manufacturing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Downstream+%28manufacturing%29"}],"status":"reported","summary":"English Wikipedia (article \"Downstream (manufacturing)\", CC BY-SA 4.0) states: Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.design-of-experiments","kind":"concept","label":"Design of experiments","sources":[{"id":"wikipedia.article.design-of-experiments","title":"English Wikipedia article: Design of experiments","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+of+experiments"}],"status":"reported","summary":"English Wikipedia (article \"Design of experiments\", CC BY-SA 4.0) states: The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.change-management-engineering","kind":"concept","label":"Change management (engineering)","sources":[{"id":"wikipedia.article.change-management-engineering","title":"English Wikipedia article: Change management (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Change+management+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Change management (engineering)\", CC BY-SA 4.0) states: The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-scour","kind":"concept","label":"Bridge scour","sources":[{"id":"wikipedia.article.bridge-scour","title":"English Wikipedia article: Bridge scour","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+scour"}],"status":"reported","summary":"English Wikipedia (article \"Bridge scour\", CC BY-SA 4.0) states: Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.exercise-machine","kind":"concept","label":"Exercise machine","sources":[{"id":"wikipedia.article.exercise-machine","title":"English Wikipedia article: Exercise machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Exercise+machine"}],"status":"reported","summary":"English Wikipedia (article \"Exercise machine\", CC BY-SA 4.0) states: An exercise machine is any machine used for physical exercise.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cvcc","kind":"concept","label":"CVCC","sources":[{"id":"wikipedia.article.cvcc","title":"English Wikipedia article: CVCC","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=CVCC"}],"status":"reported","summary":"English Wikipedia (article \"CVCC\", CC BY-SA 4.0) states: CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bigdog","kind":"concept","label":"BigDog","sources":[{"id":"wikipedia.article.bigdog","title":"English Wikipedia article: BigDog","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=BigDog"}],"status":"reported","summary":"English Wikipedia (article \"BigDog\", CC BY-SA 4.0) states: BigDog is a dynamically stable quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cold-welding","kind":"concept","label":"Cold welding","sources":[{"id":"wikipedia.article.cold-welding","title":"English Wikipedia article: Cold welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cold+welding"}],"status":"reported","summary":"English Wikipedia (article \"Cold welding\", CC BY-SA 4.0) states: Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drilling","kind":"concept","label":"Drilling","sources":[{"id":"wikipedia.article.drilling","title":"English Wikipedia article: Drilling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drilling"}],"status":"reported","summary":"English Wikipedia (article \"Drilling\", CC BY-SA 4.0) states: Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear-failure","kind":"concept","label":"Gear failure","sources":[{"id":"wikipedia.article.gear-failure","title":"English Wikipedia article: Gear failure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear+failure"}],"status":"reported","summary":"English Wikipedia (article \"Gear failure\", CC BY-SA 4.0) states: Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.coilgun","kind":"concept","label":"Coilgun","sources":[{"id":"wikipedia.article.coilgun","title":"English Wikipedia article: Coilgun","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coilgun"}],"status":"reported","summary":"English Wikipedia (article \"Coilgun\", CC BY-SA 4.0) states: A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.diaphragm-valve","kind":"concept","label":"Diaphragm valve","sources":[{"id":"wikipedia.article.diaphragm-valve","title":"English Wikipedia article: Diaphragm valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diaphragm+valve"}],"status":"reported","summary":"English Wikipedia (article \"Diaphragm valve\", CC BY-SA 4.0) states: A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.helix-angle","kind":"concept","label":"Helix angle","sources":[{"id":"wikipedia.article.helix-angle","title":"English Wikipedia article: Helix angle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Helix+angle"}],"status":"reported","summary":"English Wikipedia (article \"Helix angle\", CC BY-SA 4.0) states: In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bulldog-clip","kind":"concept","label":"Bulldog clip","sources":[{"id":"wikipedia.article.bulldog-clip","title":"English Wikipedia article: Bulldog clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bulldog+clip"}],"status":"reported","summary":"English Wikipedia (article \"Bulldog clip\", CC BY-SA 4.0) states: A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bill-of-quantities","kind":"concept","label":"Bill of quantities","sources":[{"id":"wikipedia.article.bill-of-quantities","title":"English Wikipedia article: Bill of quantities","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bill+of+quantities"}],"status":"reported","summary":"English Wikipedia (article \"Bill of quantities\", CC BY-SA 4.0) states: A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.jackshaft-locomotive","kind":"concept","label":"Jackshaft (locomotive)","sources":[{"id":"wikipedia.article.jackshaft-locomotive","title":"English Wikipedia article: Jackshaft (locomotive)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jackshaft+%28locomotive%29"}],"status":"reported","summary":"English Wikipedia (article \"Jackshaft (locomotive)\", CC BY-SA 4.0) states: A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.architectural-engineering","kind":"field","label":"Architectural engineering","sources":[{"id":"wikipedia.article.architectural-engineering","title":"English Wikipedia article: Architectural engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Architectural engineering\", CC BY-SA 4.0) states: Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beamline","kind":"concept","label":"Beamline","sources":[{"id":"wikipedia.article.beamline","title":"English Wikipedia article: Beamline","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beamline"}],"status":"reported","summary":"English Wikipedia (article \"Beamline\", CC BY-SA 4.0) states: In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.computer-aided-engineering","kind":"concept","label":"Computer-aided engineering","sources":[{"id":"wikipedia.article.computer-aided-engineering","title":"English Wikipedia article: Computer-aided engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer-aided+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer-aided engineering\", CC BY-SA 4.0) states: Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.column","kind":"concept","label":"Column","sources":[{"id":"wikipedia.article.column","title":"English Wikipedia article: Column","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Column"}],"status":"reported","summary":"English Wikipedia (article \"Column\", CC BY-SA 4.0) states: A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.jewel-bearing","kind":"concept","label":"Jewel bearing","sources":[{"id":"wikipedia.article.jewel-bearing","title":"English Wikipedia article: Jewel bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jewel+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Jewel bearing\", CC BY-SA 4.0) states: A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-strike","kind":"concept","label":"Bridge strike","sources":[{"id":"wikipedia.article.bridge-strike","title":"English Wikipedia article: Bridge strike","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+strike"}],"status":"reported","summary":"English Wikipedia (article \"Bridge strike\", CC BY-SA 4.0) states: Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.castellated-beam","kind":"concept","label":"Castellated beam","sources":[{"id":"wikipedia.article.castellated-beam","title":"English Wikipedia article: Castellated beam","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Castellated+beam"}],"status":"reported","summary":"English Wikipedia (article \"Castellated beam\", CC BY-SA 4.0) states: A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-data-inertial-reference-unit","kind":"concept","label":"Air data inertial reference unit","sources":[{"id":"wikipedia.article.air-data-inertial-reference-unit","title":"English Wikipedia article: Air data inertial reference unit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+data+inertial+reference+unit"}],"status":"reported","summary":"English Wikipedia (article \"Air data inertial reference unit\", CC BY-SA 4.0) states: An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.change-request","kind":"concept","label":"Change request","sources":[{"id":"wikipedia.article.change-request","title":"English Wikipedia article: Change request","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Change+request"}],"status":"reported","summary":"English Wikipedia (article \"Change request\", CC BY-SA 4.0) states: A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cable-fairing","kind":"concept","label":"Cable fairing","sources":[{"id":"wikipedia.article.cable-fairing","title":"English Wikipedia article: Cable fairing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cable+fairing"}],"status":"reported","summary":"English Wikipedia (article \"Cable fairing\", CC BY-SA 4.0) states: A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.differential-mechanical-device","kind":"concept","label":"Differential (mechanical device)","sources":[{"id":"wikipedia.article.differential-mechanical-device","title":"English Wikipedia article: Differential (mechanical device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+%28mechanical+device%29"}],"status":"reported","summary":"English Wikipedia (article \"Differential (mechanical device)\", CC BY-SA 4.0) states: A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.four-slide","kind":"concept","label":"Four-slide","sources":[{"id":"wikipedia.article.four-slide","title":"English Wikipedia article: Four-slide","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Four-slide"}],"status":"reported","summary":"English Wikipedia (article \"Four-slide\", CC BY-SA 4.0) states: A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.abstract-algebra","kind":"field","label":"Abstract algebra","sources":[{"id":"wikipedia.article.abstract-algebra","title":"English Wikipedia article: Abstract algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Abstract algebra\", CC BY-SA 4.0) states: In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.general-topology","kind":"field","label":"General topology","sources":[{"id":"wikipedia.article.general-topology","title":"English Wikipedia article: General topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=General+topology"}],"status":"reported","summary":"English Wikipedia (article \"General topology\", CC BY-SA 4.0) states: In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-topology","kind":"field","label":"Algebraic topology","sources":[{"id":"wikipedia.article.algebraic-topology","title":"English Wikipedia article: Algebraic topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+topology"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic topology\", CC BY-SA 4.0) states: Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.complex-analysis","kind":"field","label":"Complex analysis","sources":[{"id":"wikipedia.article.complex-analysis","title":"English Wikipedia article: Complex analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Complex+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Complex analysis\", CC BY-SA 4.0) states: Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.functional-analysis","kind":"field","label":"Functional analysis","sources":[{"id":"wikipedia.article.functional-analysis","title":"English Wikipedia article: Functional analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Functional+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Functional analysis\", CC BY-SA 4.0) states: Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.measure-mathematics","kind":"concept","label":"Measure (mathematics)","sources":[{"id":"wikipedia.article.measure-mathematics","title":"English Wikipedia article: Measure (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Measure+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Measure (mathematics)\", CC BY-SA 4.0) states: In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.combinatorics","kind":"field","label":"Combinatorics","sources":[{"id":"wikipedia.article.combinatorics","title":"English Wikipedia article: Combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Combinatorics\", CC BY-SA 4.0) states: Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.differential-geometry","kind":"field","label":"Differential geometry","sources":[{"id":"wikipedia.article.differential-geometry","title":"English Wikipedia article: Differential geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Differential geometry\", CC BY-SA 4.0) states: Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.euclidean-geometry","kind":"concept","label":"Euclidean geometry","sources":[{"id":"wikipedia.article.euclidean-geometry","title":"English Wikipedia article: Euclidean geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Euclidean+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Euclidean geometry\", CC BY-SA 4.0) states: Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.probability-theory","kind":"field","label":"Probability theory","sources":[{"id":"wikipedia.article.probability-theory","title":"English Wikipedia article: Probability theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Probability+theory"}],"status":"reported","summary":"English Wikipedia (article \"Probability theory\", CC BY-SA 4.0) states: Probability theory or probability calculus is the branch of mathematics concerned with probability.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.order-theory","kind":"field","label":"Order theory","sources":[{"id":"wikipedia.article.order-theory","title":"English Wikipedia article: Order theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Order+theory"}],"status":"reported","summary":"English Wikipedia (article \"Order theory\", CC BY-SA 4.0) states: Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.mathematical-logic","kind":"concept","label":"Mathematical logic","sources":[{"id":"wikipedia.article.mathematical-logic","title":"English Wikipedia article: Mathematical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical logic\", CC BY-SA 4.0) states: Mathematical logic is the study of formal logic within mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.mathematical-analysis","kind":"field","label":"Mathematical analysis","sources":[{"id":"wikipedia.article.mathematical-analysis","title":"English Wikipedia article: Mathematical analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical analysis\", CC BY-SA 4.0) states: Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convergence-space","kind":"concept","label":"Convergence space","sources":[{"id":"wikipedia.article.convergence-space","title":"English Wikipedia article: Convergence space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convergence+space"}],"status":"reported","summary":"English Wikipedia (article \"Convergence space\", CC BY-SA 4.0) states: In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dynamical-system","kind":"concept","label":"Dynamical system","sources":[{"id":"wikipedia.article.dynamical-system","title":"English Wikipedia article: Dynamical system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dynamical+system"}],"status":"reported","summary":"English Wikipedia (article \"Dynamical system\", CC BY-SA 4.0) states: In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.numerical-analysis","kind":"field","label":"Numerical analysis","sources":[{"id":"wikipedia.article.numerical-analysis","title":"English Wikipedia article: Numerical analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Numerical+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Numerical analysis\", CC BY-SA 4.0) states: Numerical analysis is the study of algorithms for the problems of continuous mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.module-mathematics","kind":"concept","label":"Module (mathematics)","sources":[{"id":"wikipedia.article.module-mathematics","title":"English Wikipedia article: Module (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Module+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Module (mathematics)\", CC BY-SA 4.0) states: In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.prime-number","kind":"concept","label":"Prime number","sources":[{"id":"wikipedia.article.prime-number","title":"English Wikipedia article: Prime number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Prime+number"}],"status":"reported","summary":"English Wikipedia (article \"Prime number\", CC BY-SA 4.0) states: A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antoine-s-necklace","kind":"concept","label":"Antoine's necklace","sources":[{"id":"wikipedia.article.antoine-s-necklace","title":"English Wikipedia article: Antoine's necklace","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antoine%27s+necklace"}],"status":"reported","summary":"English Wikipedia (article \"Antoine's necklace\", CC BY-SA 4.0) states: In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.abel-s-binomial-theorem","kind":"theory","label":"Abel's binomial theorem","sources":[{"id":"wikipedia.article.abel-s-binomial-theorem","title":"English Wikipedia article: Abel's binomial theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+binomial+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Abel's binomial theorem\", CC BY-SA 4.0) states: Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.alexander-s-subbase-lemma","kind":"theory","label":"Alexander's subbase lemma","sources":[{"id":"wikipedia.article.alexander-s-subbase-lemma","title":"English Wikipedia article: Alexander's subbase lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander%27s+subbase+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Alexander's subbase lemma\", CC BY-SA 4.0) states: In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.calculus","kind":"concept","label":"Calculus","sources":[{"id":"wikipedia.article.calculus","title":"English Wikipedia article: Calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus"}],"status":"reported","summary":"English Wikipedia (article \"Calculus\", CC BY-SA 4.0) states: Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.finite-model-theory","kind":"concept","label":"Finite model theory","sources":[{"id":"wikipedia.article.finite-model-theory","title":"English Wikipedia article: Finite model theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Finite+model+theory"}],"status":"reported","summary":"English Wikipedia (article \"Finite model theory\", CC BY-SA 4.0) states: Finite model theory is a subarea of model theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.condensed-detachment","kind":"concept","label":"Condensed detachment","sources":[{"id":"wikipedia.article.condensed-detachment","title":"English Wikipedia article: Condensed detachment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Condensed+detachment"}],"status":"reported","summary":"English Wikipedia (article \"Condensed detachment\", CC BY-SA 4.0) states: Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.fourier-analysis","kind":"field","label":"Fourier analysis","sources":[{"id":"wikipedia.article.fourier-analysis","title":"English Wikipedia article: Fourier analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fourier+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Fourier analysis\", CC BY-SA 4.0) states: In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of trigonometric functions or more conveniently, complex exponentials.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.harmonic-analysis","kind":"field","label":"Harmonic analysis","sources":[{"id":"wikipedia.article.harmonic-analysis","title":"English Wikipedia article: Harmonic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic analysis\", CC BY-SA 4.0) states: Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.homological-algebra","kind":"field","label":"Homological algebra","sources":[{"id":"wikipedia.article.homological-algebra","title":"English Wikipedia article: Homological algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Homological+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Homological algebra\", CC BY-SA 4.0) states: Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.commutative-algebra","kind":"field","label":"Commutative algebra","sources":[{"id":"wikipedia.article.commutative-algebra","title":"English Wikipedia article: Commutative algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commutative+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Commutative algebra\", CC BY-SA 4.0) states: Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.convex-geometry","kind":"field","label":"Convex geometry","sources":[{"id":"wikipedia.article.convex-geometry","title":"English Wikipedia article: Convex geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Convex geometry\", CC BY-SA 4.0) states: In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.discrete-mathematics","kind":"field","label":"Discrete mathematics","sources":[{"id":"wikipedia.article.discrete-mathematics","title":"English Wikipedia article: Discrete mathematics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discrete+mathematics"}],"status":"reported","summary":"English Wikipedia (article \"Discrete mathematics\", CC BY-SA 4.0) states: Discrete mathematics is the study of mathematical structures that can be considered \"discrete\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \"continuous\" (analogously to continuous functions).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.ring-theory","kind":"field","label":"Ring theory","sources":[{"id":"wikipedia.article.ring-theory","title":"English Wikipedia article: Ring theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ring+theory"}],"status":"reported","summary":"English Wikipedia (article \"Ring theory\", CC BY-SA 4.0) states: In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.number-theory","kind":"field","label":"Number theory","sources":[{"id":"wikipedia.article.number-theory","title":"English Wikipedia article: Number theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Number+theory"}],"status":"reported","summary":"English Wikipedia (article \"Number theory\", CC BY-SA 4.0) states: Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.real-analysis","kind":"concept","label":"Real analysis","sources":[{"id":"wikipedia.article.real-analysis","title":"English Wikipedia article: Real analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Real+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Real analysis\", CC BY-SA 4.0) states: Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.combinatorial-principles","kind":"concept","label":"Combinatorial principles","sources":[{"id":"wikipedia.article.combinatorial-principles","title":"English Wikipedia article: Combinatorial principles","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Combinatorial+principles"}],"status":"reported","summary":"English Wikipedia (article \"Combinatorial principles\", CC BY-SA 4.0) states: In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.geometric-analysis","kind":"field","label":"Geometric analysis","sources":[{"id":"wikipedia.article.geometric-analysis","title":"English Wikipedia article: Geometric analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Geometric analysis\", CC BY-SA 4.0) states: Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-mathematics","kind":"concept","label":"Category (mathematics)","sources":[{"id":"wikipedia.article.category-mathematics","title":"English Wikipedia article: Category (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Category (mathematics)\", CC BY-SA 4.0) states: In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \"objects\" that are linked by \"arrows\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-analysis","kind":"concept","label":"Constructive analysis","sources":[{"id":"wikipedia.article.constructive-analysis","title":"English Wikipedia article: Constructive analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Constructive analysis\", CC BY-SA 4.0) states: In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","kind":"concept","label":"Algebraic geometry and analytic geometry","sources":[{"id":"wikipedia.article.algebraic-geometry-and-analytic-geometry","title":"English Wikipedia article: Algebraic geometry and analytic geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+geometry+and+analytic+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic geometry and analytic geometry\", CC BY-SA 4.0) states: In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antieigenvalue-theory","kind":"concept","label":"Antieigenvalue theory","sources":[{"id":"wikipedia.article.antieigenvalue-theory","title":"English Wikipedia article: Antieigenvalue theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antieigenvalue+theory"}],"status":"reported","summary":"English Wikipedia (article \"Antieigenvalue theory\", CC BY-SA 4.0) states: In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arens-fort-space","kind":"concept","label":"Arens–Fort space","sources":[{"id":"wikipedia.article.arens-fort-space","title":"English Wikipedia article: Arens–Fort space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arens%E2%80%93Fort+space"}],"status":"reported","summary":"English Wikipedia (article \"Arens–Fort space\", CC BY-SA 4.0) states: In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.abel-s-irreducibility-theorem","kind":"theory","label":"Abel's irreducibility theorem","sources":[{"id":"wikipedia.article.abel-s-irreducibility-theorem","title":"English Wikipedia article: Abel's irreducibility theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+irreducibility+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Abel's irreducibility theorem\", CC BY-SA 4.0) states: In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is irreducible over F, then every root of g(x) is a root of f(x).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.anderson-kadec-theorem","kind":"theory","label":"Anderson–Kadec theorem","sources":[{"id":"wikipedia.article.anderson-kadec-theorem","title":"English Wikipedia article: Anderson–Kadec theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anderson%E2%80%93Kadec+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Anderson–Kadec theorem\", CC BY-SA 4.0) states: In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amalgamation-property","kind":"concept","label":"Amalgamation property","sources":[{"id":"wikipedia.article.amalgamation-property","title":"English Wikipedia article: Amalgamation property","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amalgamation+property"}],"status":"reported","summary":"English Wikipedia (article \"Amalgamation property\", CC BY-SA 4.0) states: In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-proof","kind":"concept","label":"Analytic proof","sources":[{"id":"wikipedia.article.analytic-proof","title":"English Wikipedia article: Analytic proof","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+proof"}],"status":"reported","summary":"English Wikipedia (article \"Analytic proof\", CC BY-SA 4.0) states: In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-plank-problem","kind":"concept","label":"Affine plank problem","sources":[{"id":"wikipedia.article.affine-plank-problem","title":"English Wikipedia article: Affine plank problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+plank+problem"}],"status":"reported","summary":"English Wikipedia (article \"Affine plank problem\", CC BY-SA 4.0) states: In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.group-mathematics","kind":"concept","label":"Group (mathematics)","sources":[{"id":"wikipedia.article.group-mathematics","title":"English Wikipedia article: Group (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Group+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Group (mathematics)\", CC BY-SA 4.0) states: In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-wiener-space","kind":"concept","label":"Abstract Wiener space","sources":[{"id":"wikipedia.article.abstract-wiener-space","title":"English Wikipedia article: Abstract Wiener space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+Wiener+space"}],"status":"reported","summary":"English Wikipedia (article \"Abstract Wiener space\", CC BY-SA 4.0) states: The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-process","kind":"concept","label":"Additive process","sources":[{"id":"wikipedia.article.additive-process","title":"English Wikipedia article: Additive process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+process"}],"status":"reported","summary":"English Wikipedia (article \"Additive process\", CC BY-SA 4.0) states: An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.computability-theory","kind":"field","label":"Computability theory","sources":[{"id":"wikipedia.article.computability-theory","title":"English Wikipedia article: Computability theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computability+theory"}],"status":"reported","summary":"English Wikipedia (article \"Computability theory\", CC BY-SA 4.0) states: Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.floquet-theory","kind":"concept","label":"Floquet theory","sources":[{"id":"wikipedia.article.floquet-theory","title":"English Wikipedia article: Floquet theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Floquet+theory"}],"status":"reported","summary":"English Wikipedia (article \"Floquet theory\", CC BY-SA 4.0) states: Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antimatroid","kind":"concept","label":"Antimatroid","sources":[{"id":"wikipedia.article.antimatroid","title":"English Wikipedia article: Antimatroid","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antimatroid"}],"status":"reported","summary":"English Wikipedia (article \"Antimatroid\", CC BY-SA 4.0) states: In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.representation-theory","kind":"field","label":"Representation theory","sources":[{"id":"wikipedia.article.representation-theory","title":"English Wikipedia article: Representation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Representation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Representation theory\", CC BY-SA 4.0) states: Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.modular-representation-theory","kind":"concept","label":"Modular representation theory","sources":[{"id":"wikipedia.article.modular-representation-theory","title":"English Wikipedia article: Modular representation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Modular+representation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Modular representation theory\", CC BY-SA 4.0) states: In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.analytic-subgroup-theorem","kind":"theory","label":"Analytic subgroup theorem","sources":[{"id":"wikipedia.article.analytic-subgroup-theorem","title":"English Wikipedia article: Analytic subgroup theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+subgroup+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Analytic subgroup theorem\", CC BY-SA 4.0) states: In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.andreotti-vesentini-theorem","kind":"theory","label":"Andreotti–Vesentini theorem","sources":[{"id":"wikipedia.article.andreotti-vesentini-theorem","title":"English Wikipedia article: Andreotti–Vesentini theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andreotti%E2%80%93Vesentini+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Andreotti–Vesentini theorem\", CC BY-SA 4.0) states: In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.big-little-big-lemma","kind":"theory","label":"Big-little-big lemma","sources":[{"id":"wikipedia.article.big-little-big-lemma","title":"English Wikipedia article: Big-little-big lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big-little-big+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Big-little-big lemma\", CC BY-SA 4.0) states: In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-progression","kind":"concept","label":"Arithmetic progression","sources":[{"id":"wikipedia.article.arithmetic-progression","title":"English Wikipedia article: Arithmetic progression","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+progression"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic progression\", CC BY-SA 4.0) states: An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.degeneracy-mathematics","kind":"concept","label":"Degeneracy (mathematics)","sources":[{"id":"wikipedia.article.degeneracy-mathematics","title":"English Wikipedia article: Degeneracy (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Degeneracy+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Degeneracy (mathematics)\", CC BY-SA 4.0) states: In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \"degeneracy\" is the condition of being a degenerate case.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bachmann-howard-ordinal","kind":"concept","label":"Bachmann–Howard ordinal","sources":[{"id":"wikipedia.article.bachmann-howard-ordinal","title":"English Wikipedia article: Bachmann–Howard ordinal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bachmann%E2%80%93Howard+ordinal"}],"status":"reported","summary":"English Wikipedia (article \"Bachmann–Howard ordinal\", CC BY-SA 4.0) states: In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.noncommutative-harmonic-analysis","kind":"field","label":"Noncommutative harmonic analysis","sources":[{"id":"wikipedia.article.noncommutative-harmonic-analysis","title":"English Wikipedia article: Noncommutative harmonic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Noncommutative+harmonic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Noncommutative harmonic analysis\", CC BY-SA 4.0) states: In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abelian-category","kind":"concept","label":"Abelian category","sources":[{"id":"wikipedia.article.abelian-category","title":"English Wikipedia article: Abelian category","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abelian+category"}],"status":"reported","summary":"English Wikipedia (article \"Abelian category\", CC BY-SA 4.0) states: In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-continuity","kind":"concept","label":"Absolute continuity","sources":[{"id":"wikipedia.article.absolute-continuity","title":"English Wikipedia article: Absolute continuity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+continuity"}],"status":"reported","summary":"English Wikipedia (article \"Absolute continuity\", CC BY-SA 4.0) states: In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-analysis","kind":"field","label":"Algebraic analysis","sources":[{"id":"wikipedia.article.algebraic-analysis","title":"English Wikipedia article: Algebraic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic analysis\", CC BY-SA 4.0) states: Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.albertson-index","kind":"concept","label":"Albertson index","sources":[{"id":"wikipedia.article.albertson-index","title":"English Wikipedia article: Albertson index","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Albertson+index"}],"status":"reported","summary":"English Wikipedia (article \"Albertson index\", CC BY-SA 4.0) states: The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adomian-decomposition-method","kind":"concept","label":"Adomian decomposition method","sources":[{"id":"wikipedia.article.adomian-decomposition-method","title":"English Wikipedia article: Adomian decomposition method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adomian+decomposition+method"}],"status":"reported","summary":"English Wikipedia (article \"Adomian decomposition method\", CC BY-SA 4.0) states: The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-representation","kind":"concept","label":"Admissible representation","sources":[{"id":"wikipedia.article.admissible-representation","title":"English Wikipedia article: Admissible representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+representation"}],"status":"reported","summary":"English Wikipedia (article \"Admissible representation\", CC BY-SA 4.0) states: In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.action-angle-coordinates","kind":"concept","label":"Action-angle coordinates","sources":[{"id":"wikipedia.article.action-angle-coordinates","title":"English Wikipedia article: Action-angle coordinates","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action-angle+coordinates"}],"status":"reported","summary":"English Wikipedia (article \"Action-angle coordinates\", CC BY-SA 4.0) states: In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraically-compact-module","kind":"concept","label":"Algebraically compact module","sources":[{"id":"wikipedia.article.algebraically-compact-module","title":"English Wikipedia article: Algebraically compact module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraically+compact+module"}],"status":"reported","summary":"English Wikipedia (article \"Algebraically compact module\", CC BY-SA 4.0) states: In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \"nice\" property which allows the solution of infinite systems of equations in the module by finitary means.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.block-matrix-pseudoinverse","kind":"concept","label":"Block matrix pseudoinverse","sources":[{"id":"wikipedia.article.block-matrix-pseudoinverse","title":"English Wikipedia article: Block matrix pseudoinverse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Block+matrix+pseudoinverse"}],"status":"reported","summary":"English Wikipedia (article \"Block matrix pseudoinverse\", CC BY-SA 4.0) states: In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-manifold","kind":"concept","label":"Algebraic manifold","sources":[{"id":"wikipedia.article.algebraic-manifold","title":"English Wikipedia article: Algebraic manifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+manifold"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic manifold\", CC BY-SA 4.0) states: In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ap-ry-s-theorem","kind":"theory","label":"Apéry's theorem","sources":[{"id":"wikipedia.article.ap-ry-s-theorem","title":"English Wikipedia article: Apéry's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ap%C3%A9ry%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Apéry's theorem\", CC BY-SA 4.0) states: In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.annulus-theorem","kind":"theory","label":"Annulus theorem","sources":[{"id":"wikipedia.article.annulus-theorem","title":"English Wikipedia article: Annulus theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Annulus+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Annulus theorem\", CC BY-SA 4.0) states: In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.borel-cantelli-lemma","kind":"theory","label":"Borel–Cantelli lemma","sources":[{"id":"wikipedia.article.borel-cantelli-lemma","title":"English Wikipedia article: Borel–Cantelli lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Borel%E2%80%93Cantelli+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Borel–Cantelli lemma\", CC BY-SA 4.0) states: The Borel–Cantelli lemma is a result in measure theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.limiting-case-mathematics","kind":"concept","label":"Limiting case (mathematics)","sources":[{"id":"wikipedia.article.limiting-case-mathematics","title":"English Wikipedia article: Limiting case (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Limiting+case+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Limiting case (mathematics)\", CC BY-SA 4.0) states: In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.moment-statistics","kind":"concept","label":"Moment (statistics)","sources":[{"id":"wikipedia.article.moment-statistics","title":"English Wikipedia article: Moment (statistics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Moment+%28statistics%29"}],"status":"reported","summary":"English Wikipedia (article \"Moment (statistics)\", CC BY-SA 4.0) states: In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.back-and-forth-method","kind":"concept","label":"Back-and-forth method","sources":[{"id":"wikipedia.article.back-and-forth-method","title":"English Wikipedia article: Back-and-forth method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Back-and-forth+method"}],"status":"reported","summary":"English Wikipedia (article \"Back-and-forth method\", CC BY-SA 4.0) states: In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounded-quantifier","kind":"concept","label":"Bounded quantifier","sources":[{"id":"wikipedia.article.bounded-quantifier","title":"English Wikipedia article: Bounded quantifier","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounded+quantifier"}],"status":"reported","summary":"English Wikipedia (article \"Bounded quantifier\", CC BY-SA 4.0) states: In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \"∀\" and \"∃\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-numbering","kind":"concept","label":"Admissible numbering","sources":[{"id":"wikipedia.article.admissible-numbering","title":"English Wikipedia article: Admissible numbering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+numbering"}],"status":"reported","summary":"English Wikipedia (article \"Admissible numbering\", CC BY-SA 4.0) states: In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.autocovariance","kind":"concept","label":"Autocovariance","sources":[{"id":"wikipedia.article.autocovariance","title":"English Wikipedia article: Autocovariance","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autocovariance"}],"status":"reported","summary":"English Wikipedia (article \"Autocovariance\", CC BY-SA 4.0) states: In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.acyclic-model","kind":"concept","label":"Acyclic model","sources":[{"id":"wikipedia.article.acyclic-model","title":"English Wikipedia article: Acyclic model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acyclic+model"}],"status":"reported","summary":"English Wikipedia (article \"Acyclic model\", CC BY-SA 4.0) states: In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.convex-analysis","kind":"field","label":"Convex analysis","sources":[{"id":"wikipedia.article.convex-analysis","title":"English Wikipedia article: Convex analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Convex analysis\", CC BY-SA 4.0) states: Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absorption-law","kind":"concept","label":"Absorption law","sources":[{"id":"wikipedia.article.absorption-law","title":"English Wikipedia article: Absorption law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absorption+law"}],"status":"reported","summary":"English Wikipedia (article \"Absorption law\", CC BY-SA 4.0) states: In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjugate-matrix","kind":"concept","label":"Adjugate matrix","sources":[{"id":"wikipedia.article.adjugate-matrix","title":"English Wikipedia article: Adjugate matrix","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjugate+matrix"}],"status":"reported","summary":"English Wikipedia (article \"Adjugate matrix\", CC BY-SA 4.0) states: In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amplitwist","kind":"concept","label":"Amplitwist","sources":[{"id":"wikipedia.article.amplitwist","title":"English Wikipedia article: Amplitwist","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amplitwist"}],"status":"reported","summary":"English Wikipedia (article \"Amplitwist\", CC BY-SA 4.0) states: In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-everywhere","kind":"concept","label":"Almost everywhere","sources":[{"id":"wikipedia.article.almost-everywhere","title":"English Wikipedia article: Almost everywhere","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+everywhere"}],"status":"reported","summary":"English Wikipedia (article \"Almost everywhere\", CC BY-SA 4.0) states: In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.extremal-combinatorics","kind":"field","label":"Extremal combinatorics","sources":[{"id":"wikipedia.article.extremal-combinatorics","title":"English Wikipedia article: Extremal combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extremal+combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Extremal combinatorics\", CC BY-SA 4.0) states: Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bicircular-matroid","kind":"concept","label":"Bicircular matroid","sources":[{"id":"wikipedia.article.bicircular-matroid","title":"English Wikipedia article: Bicircular matroid","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicircular+matroid"}],"status":"reported","summary":"English Wikipedia (article \"Bicircular matroid\", CC BY-SA 4.0) states: In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.pregeometry-model-theory","kind":"concept","label":"Pregeometry (model theory)","sources":[{"id":"wikipedia.article.pregeometry-model-theory","title":"English Wikipedia article: Pregeometry (model theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pregeometry+%28model+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Pregeometry (model theory)\", CC BY-SA 4.0) states: Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \"matroid\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.projective-differential-geometry","kind":"field","label":"Projective differential geometry","sources":[{"id":"wikipedia.article.projective-differential-geometry","title":"English Wikipedia article: Projective differential geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Projective+differential+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Projective differential geometry\", CC BY-SA 4.0) states: In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-surely","kind":"concept","label":"Almost surely","sources":[{"id":"wikipedia.article.almost-surely","title":"English Wikipedia article: Almost surely","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+surely"}],"status":"reported","summary":"English Wikipedia (article \"Almost surely\", CC BY-SA 4.0) states: In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandrov-topology","kind":"concept","label":"Alexandrov topology","sources":[{"id":"wikipedia.article.alexandrov-topology","title":"English Wikipedia article: Alexandrov topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandrov+topology"}],"status":"reported","summary":"English Wikipedia (article \"Alexandrov topology\", CC BY-SA 4.0) states: In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-differential-equation","kind":"concept","label":"Algebraic differential equation","sources":[{"id":"wikipedia.article.algebraic-differential-equation","title":"English Wikipedia article: Algebraic differential equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+differential+equation"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic differential equation\", CC BY-SA 4.0) states: In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.complemented-lattice","kind":"concept","label":"Complemented lattice","sources":[{"id":"wikipedia.article.complemented-lattice","title":"English Wikipedia article: Complemented lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Complemented+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Complemented lattice\", CC BY-SA 4.0) states: In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-step-size","kind":"concept","label":"Adaptive step size","sources":[{"id":"wikipedia.article.adaptive-step-size","title":"English Wikipedia article: Adaptive step size","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+step+size"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive step size\", CC BY-SA 4.0) states: In mathematics and numerical analysis, an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cayley-hamilton-theorem","kind":"theory","label":"Cayley–Hamilton theorem","sources":[{"id":"wikipedia.article.cayley-hamilton-theorem","title":"English Wikipedia article: Cayley–Hamilton theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cayley%E2%80%93Hamilton+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cayley–Hamilton theorem\", CC BY-SA 4.0) states: In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-polynomial","kind":"concept","label":"Additive polynomial","sources":[{"id":"wikipedia.article.additive-polynomial","title":"English Wikipedia article: Additive polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Additive polynomial\", CC BY-SA 4.0) states: In mathematics, the additive polynomials are an important topic in classical algebraic number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abundant-number","kind":"concept","label":"Abundant number","sources":[{"id":"wikipedia.article.abundant-number","title":"English Wikipedia article: Abundant number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abundant+number"}],"status":"reported","summary":"English Wikipedia (article \"Abundant number\", CC BY-SA 4.0) states: In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-space","kind":"concept","label":"Cantor space","sources":[{"id":"wikipedia.article.cantor-space","title":"English Wikipedia article: Cantor space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+space"}],"status":"reported","summary":"English Wikipedia (article \"Cantor space\", CC BY-SA 4.0) states: In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artin-verdier-duality","kind":"concept","label":"Artin–Verdier duality","sources":[{"id":"wikipedia.article.artin-verdier-duality","title":"English Wikipedia article: Artin–Verdier duality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artin%E2%80%93Verdier+duality"}],"status":"reported","summary":"English Wikipedia (article \"Artin–Verdier duality\", CC BY-SA 4.0) states: In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.atiyah-segal-completion-theorem","kind":"theory","label":"Atiyah–Segal completion theorem","sources":[{"id":"wikipedia.article.atiyah-segal-completion-theorem","title":"English Wikipedia article: Atiyah–Segal completion theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atiyah%E2%80%93Segal+completion+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Atiyah–Segal completion theorem\", CC BY-SA 4.0) states: The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.mathematical-diagram","kind":"concept","label":"Mathematical diagram","sources":[{"id":"wikipedia.article.mathematical-diagram","title":"English Wikipedia article: Mathematical diagram","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+diagram"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical diagram\", CC BY-SA 4.0) states: Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boolean-valued-model","kind":"concept","label":"Boolean-valued model","sources":[{"id":"wikipedia.article.boolean-valued-model","title":"English Wikipedia article: Boolean-valued model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean-valued+model"}],"status":"reported","summary":"English Wikipedia (article \"Boolean-valued model\", CC BY-SA 4.0) states: In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.buchholz-s-ordinal","kind":"concept","label":"Buchholz's ordinal","sources":[{"id":"wikipedia.article.buchholz-s-ordinal","title":"English Wikipedia article: Buchholz's ordinal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buchholz%27s+ordinal"}],"status":"reported","summary":"English Wikipedia (article \"Buchholz's ordinal\", CC BY-SA 4.0) states: In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.arithmetic-combinatorics","kind":"field","label":"Arithmetic combinatorics","sources":[{"id":"wikipedia.article.arithmetic-combinatorics","title":"English Wikipedia article: Arithmetic combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic combinatorics\", CC BY-SA 4.0) states: In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-ring","kind":"concept","label":"Almost ring","sources":[{"id":"wikipedia.article.almost-ring","title":"English Wikipedia article: Almost ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+ring"}],"status":"reported","summary":"English Wikipedia (article \"Almost ring\", CC BY-SA 4.0) states: In mathematics, almost modules and almost rings are certain objects interpolating between rings and their fields of fractions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ade-classification","kind":"concept","label":"ADE classification","sources":[{"id":"wikipedia.article.ade-classification","title":"English Wikipedia article: ADE classification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ADE+classification"}],"status":"reported","summary":"English Wikipedia (article \"ADE classification\", CC BY-SA 4.0) states: In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolutely-convex-set","kind":"concept","label":"Absolutely convex set","sources":[{"id":"wikipedia.article.absolutely-convex-set","title":"English Wikipedia article: Absolutely convex set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolutely+convex+set"}],"status":"reported","summary":"English Wikipedia (article \"Absolutely convex set\", CC BY-SA 4.0) states: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \"circled\" instead of \"balanced\"), in which case it is called a disk.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-space","kind":"concept","label":"Affine space","sources":[{"id":"wikipedia.article.affine-space","title":"English Wikipedia article: Affine space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+space"}],"status":"reported","summary":"English Wikipedia (article \"Affine space\", CC BY-SA 4.0) states: In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-periodic-function","kind":"concept","label":"Almost periodic function","sources":[{"id":"wikipedia.article.almost-periodic-function","title":"English Wikipedia article: Almost periodic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+periodic+function"}],"status":"reported","summary":"English Wikipedia (article \"Almost periodic function\", CC BY-SA 4.0) states: In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \"almost-periods\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-tangent-space","kind":"concept","label":"Approximate tangent space","sources":[{"id":"wikipedia.article.approximate-tangent-space","title":"English Wikipedia article: Approximate tangent space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+tangent+space"}],"status":"reported","summary":"English Wikipedia (article \"Approximate tangent space\", CC BY-SA 4.0) states: In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.supergeometry","kind":"concept","label":"Supergeometry","sources":[{"id":"wikipedia.article.supergeometry","title":"English Wikipedia article: Supergeometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Supergeometry"}],"status":"reported","summary":"English Wikipedia (article \"Supergeometry\", CC BY-SA 4.0) states: Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.apollonius-s-theorem","kind":"theory","label":"Apollonius's theorem","sources":[{"id":"wikipedia.article.apollonius-s-theorem","title":"English Wikipedia article: Apollonius's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apollonius%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Apollonius's theorem\", CC BY-SA 4.0) states: In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.residue-field","kind":"concept","label":"Residue field","sources":[{"id":"wikipedia.article.residue-field","title":"English Wikipedia article: Residue field","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Residue+field"}],"status":"reported","summary":"English Wikipedia (article \"Residue field\", CC BY-SA 4.0) states: In mathematics, the residue field is a basic construction in commutative algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjoint-state-method","kind":"concept","label":"Adjoint state method","sources":[{"id":"wikipedia.article.adjoint-state-method","title":"English Wikipedia article: Adjoint state method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjoint+state+method"}],"status":"reported","summary":"English Wikipedia (article \"Adjoint state method\", CC BY-SA 4.0) states: The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artinian-module","kind":"concept","label":"Artinian module","sources":[{"id":"wikipedia.article.artinian-module","title":"English Wikipedia article: Artinian module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artinian+module"}],"status":"reported","summary":"English Wikipedia (article \"Artinian module\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.aitken-interpolation","kind":"concept","label":"Aitken interpolation","sources":[{"id":"wikipedia.article.aitken-interpolation","title":"English Wikipedia article: Aitken interpolation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aitken+interpolation"}],"status":"reported","summary":"English Wikipedia (article \"Aitken interpolation\", CC BY-SA 4.0) states: Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.achilles-number","kind":"concept","label":"Achilles number","sources":[{"id":"wikipedia.article.achilles-number","title":"English Wikipedia article: Achilles number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Achilles+number"}],"status":"reported","summary":"English Wikipedia (article \"Achilles number\", CC BY-SA 4.0) states: An Achilles number is a number that is powerful but not a perfect power.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.atlas-topology","kind":"concept","label":"Atlas (topology)","sources":[{"id":"wikipedia.article.atlas-topology","title":"English Wikipedia article: Atlas (topology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atlas+%28topology%29"}],"status":"reported","summary":"English Wikipedia (article \"Atlas (topology)\", CC BY-SA 4.0) states: In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-tree","kind":"concept","label":"Cantor tree","sources":[{"id":"wikipedia.article.cantor-tree","title":"English Wikipedia article: Cantor tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+tree"}],"status":"reported","summary":"English Wikipedia (article \"Cantor tree\", CC BY-SA 4.0) states: In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.eilenberg-watts-theorem","kind":"theory","label":"Eilenberg–Watts theorem","sources":[{"id":"wikipedia.article.eilenberg-watts-theorem","title":"English Wikipedia article: Eilenberg–Watts theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eilenberg%E2%80%93Watts+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Eilenberg–Watts theorem\", CC BY-SA 4.0) states: In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ax-kochen-theorem","kind":"theory","label":"Ax–Kochen theorem","sources":[{"id":"wikipedia.article.ax-kochen-theorem","title":"English Wikipedia article: Ax–Kochen theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ax%E2%80%93Kochen+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ax–Kochen theorem\", CC BY-SA 4.0) states: The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bagpipe-theorem","kind":"theory","label":"Bagpipe theorem","sources":[{"id":"wikipedia.article.bagpipe-theorem","title":"English Wikipedia article: Bagpipe theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bagpipe+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bagpipe theorem\", CC BY-SA 4.0) states: In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \"bagpipes\": the connected sum of a compact \"bag\" with several \"long pipes\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-sequence","kind":"concept","label":"Cutting sequence","sources":[{"id":"wikipedia.article.cutting-sequence","title":"English Wikipedia article: Cutting sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Cutting sequence\", CC BY-SA 4.0) states: In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\"cut\") as a curve crosses a square grid.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.tau-mathematics","kind":"concept","label":"Tau (mathematics)","sources":[{"id":"wikipedia.article.tau-mathematics","title":"English Wikipedia article: Tau (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tau+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Tau (mathematics)\", CC BY-SA 4.0) states: The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bateman-transform","kind":"concept","label":"Bateman transform","sources":[{"id":"wikipedia.article.bateman-transform","title":"English Wikipedia article: Bateman transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bateman+transform"}],"status":"reported","summary":"English Wikipedia (article \"Bateman transform\", CC BY-SA 4.0) states: In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjoint-representation","kind":"concept","label":"Adjoint representation","sources":[{"id":"wikipedia.article.adjoint-representation","title":"English Wikipedia article: Adjoint representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjoint+representation"}],"status":"reported","summary":"English Wikipedia (article \"Adjoint representation\", CC BY-SA 4.0) states: In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.blaschke-sum","kind":"concept","label":"Blaschke sum","sources":[{"id":"wikipedia.article.blaschke-sum","title":"English Wikipedia article: Blaschke sum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blaschke+sum"}],"status":"reported","summary":"English Wikipedia (article \"Blaschke sum\", CC BY-SA 4.0) states: In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-inverse","kind":"concept","label":"Additive inverse","sources":[{"id":"wikipedia.article.additive-inverse","title":"English Wikipedia article: Additive inverse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+inverse"}],"status":"reported","summary":"English Wikipedia (article \"Additive inverse\", CC BY-SA 4.0) states: In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.amitsur-levitzki-theorem","kind":"theory","label":"Amitsur–Levitzki theorem","sources":[{"id":"wikipedia.article.amitsur-levitzki-theorem","title":"English Wikipedia article: Amitsur–Levitzki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amitsur%E2%80%93Levitzki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Amitsur–Levitzki theorem\", CC BY-SA 4.0) states: In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandroff-extension","kind":"concept","label":"Alexandroff extension","sources":[{"id":"wikipedia.article.alexandroff-extension","title":"English Wikipedia article: Alexandroff extension","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandroff+extension"}],"status":"reported","summary":"English Wikipedia (article \"Alexandroff extension\", CC BY-SA 4.0) states: In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-neighborhood-retract","kind":"concept","label":"Absolute neighborhood retract","sources":[{"id":"wikipedia.article.absolute-neighborhood-retract","title":"English Wikipedia article: Absolute neighborhood retract","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+neighborhood+retract"}],"status":"reported","summary":"English Wikipedia (article \"Absolute neighborhood retract\", CC BY-SA 4.0) states: In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \"nice\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alternating-series","kind":"concept","label":"Alternating series","sources":[{"id":"wikipedia.article.alternating-series","title":"English Wikipedia article: Alternating series","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alternating+series"}],"status":"reported","summary":"English Wikipedia (article \"Alternating series\", CC BY-SA 4.0) states: In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antiholomorphic-function","kind":"concept","label":"Antiholomorphic function","sources":[{"id":"wikipedia.article.antiholomorphic-function","title":"English Wikipedia article: Antiholomorphic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiholomorphic+function"}],"status":"reported","summary":"English Wikipedia (article \"Antiholomorphic function\", CC BY-SA 4.0) states: In mathematics, antiholomorphic functions (also called antianalytic functions) are a family of functions closely related to but distinct from holomorphic functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.atom-measure-theory","kind":"concept","label":"Atom (measure theory)","sources":[{"id":"wikipedia.article.atom-measure-theory","title":"English Wikipedia article: Atom (measure theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atom+%28measure+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Atom (measure theory)\", CC BY-SA 4.0) states: In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.calculus-on-finite-weighted-graphs","kind":"concept","label":"Calculus on finite weighted graphs","sources":[{"id":"wikipedia.article.calculus-on-finite-weighted-graphs","title":"English Wikipedia article: Calculus on finite weighted graphs","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus+on+finite+weighted+graphs"}],"status":"reported","summary":"English Wikipedia (article \"Calculus on finite weighted graphs\", CC BY-SA 4.0) states: In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chern-simons-theory","kind":"concept","label":"∞-Chern–Simons theory","sources":[{"id":"wikipedia.article.chern-simons-theory","title":"English Wikipedia article: ∞-Chern–Simons theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%88%9E-Chern%E2%80%93Simons+theory"}],"status":"reported","summary":"English Wikipedia (article \"∞-Chern–Simons theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.congruence-lattice-problem","kind":"concept","label":"Congruence lattice problem","sources":[{"id":"wikipedia.article.congruence-lattice-problem","title":"English Wikipedia article: Congruence lattice problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Congruence+lattice+problem"}],"status":"reported","summary":"English Wikipedia (article \"Congruence lattice problem\", CC BY-SA 4.0) states: In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ambient-isotopy","kind":"concept","label":"Ambient isotopy","sources":[{"id":"wikipedia.article.ambient-isotopy","title":"English Wikipedia article: Ambient isotopy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambient+isotopy"}],"status":"reported","summary":"English Wikipedia (article \"Ambient isotopy\", CC BY-SA 4.0) states: In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.a-homotopy-theory","kind":"concept","label":"A¹ homotopy theory","sources":[{"id":"wikipedia.article.a-homotopy-theory","title":"English Wikipedia article: A¹ homotopy theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A%C2%B9+homotopy+theory"}],"status":"reported","summary":"English Wikipedia (article \"A¹ homotopy theory\", CC BY-SA 4.0) states: In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-lie-algebra","kind":"concept","label":"Affine Lie algebra","sources":[{"id":"wikipedia.article.affine-lie-algebra","title":"English Wikipedia article: Affine Lie algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+Lie+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Affine Lie algebra\", CC BY-SA 4.0) states: In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.andronov-pontryagin-criterion","kind":"concept","label":"Andronov–Pontryagin criterion","sources":[{"id":"wikipedia.article.andronov-pontryagin-criterion","title":"English Wikipedia article: Andronov–Pontryagin criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andronov%E2%80%93Pontryagin+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Andronov–Pontryagin criterion\", CC BY-SA 4.0) states: The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-arithmetic","kind":"concept","label":"Affine arithmetic","sources":[{"id":"wikipedia.article.affine-arithmetic","title":"English Wikipedia article: Affine arithmetic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+arithmetic"}],"status":"reported","summary":"English Wikipedia (article \"Affine arithmetic\", CC BY-SA 4.0) states: Affine arithmetic (AA) is a model for self-validated numerical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexander-polynomial","kind":"concept","label":"Alexander polynomial","sources":[{"id":"wikipedia.article.alexander-polynomial","title":"English Wikipedia article: Alexander polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Alexander polynomial\", CC BY-SA 4.0) states: In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.banach-fixed-point-theorem","kind":"theory","label":"Banach fixed-point theorem","sources":[{"id":"wikipedia.article.banach-fixed-point-theorem","title":"English Wikipedia article: Banach fixed-point theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Banach+fixed-point+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Banach fixed-point theorem\", CC BY-SA 4.0) states: In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.davenport-schinzel-sequence","kind":"concept","label":"Davenport–Schinzel sequence","sources":[{"id":"wikipedia.article.davenport-schinzel-sequence","title":"English Wikipedia article: Davenport–Schinzel sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Davenport%E2%80%93Schinzel+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Davenport–Schinzel sequence\", CC BY-SA 4.0) states: In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.turn-angle","kind":"concept","label":"Turn (angle)","sources":[{"id":"wikipedia.article.turn-angle","title":"English Wikipedia article: Turn (angle)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turn+%28angle%29"}],"status":"reported","summary":"English Wikipedia (article \"Turn (angle)\", CC BY-SA 4.0) states: The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytical-hierarchy","kind":"concept","label":"Analytical hierarchy","sources":[{"id":"wikipedia.article.analytical-hierarchy","title":"English Wikipedia article: Analytical hierarchy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytical+hierarchy"}],"status":"reported","summary":"English Wikipedia (article \"Analytical hierarchy\", CC BY-SA 4.0) states: In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bessel-function","kind":"concept","label":"Bessel function","sources":[{"id":"wikipedia.article.bessel-function","title":"English Wikipedia article: Bessel function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bessel+function"}],"status":"reported","summary":"English Wikipedia (article \"Bessel function\", CC BY-SA 4.0) states: Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ahlfors-finiteness-theorem","kind":"theory","label":"Ahlfors finiteness theorem","sources":[{"id":"wikipedia.article.ahlfors-finiteness-theorem","title":"English Wikipedia article: Ahlfors finiteness theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ahlfors+finiteness+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ahlfors finiteness theorem\", CC BY-SA 4.0) states: In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-group","kind":"concept","label":"Additive group","sources":[{"id":"wikipedia.article.additive-group","title":"English Wikipedia article: Additive group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+group"}],"status":"reported","summary":"English Wikipedia (article \"Additive group\", CC BY-SA 4.0) states: An additive group is a group of which the group operation is to be thought of as addition in some sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebra-extension","kind":"concept","label":"Algebra extension","sources":[{"id":"wikipedia.article.algebra-extension","title":"English Wikipedia article: Algebra extension","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebra+extension"}],"status":"reported","summary":"English Wikipedia (article \"Algebra extension\", CC BY-SA 4.0) states: In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.appert-topology","kind":"field","label":"Appert topology","sources":[{"id":"wikipedia.article.appert-topology","title":"English Wikipedia article: Appert topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appert+topology"}],"status":"reported","summary":"English Wikipedia (article \"Appert topology\", CC BY-SA 4.0) states: In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-polytope","kind":"concept","label":"Abstract polytope","sources":[{"id":"wikipedia.article.abstract-polytope","title":"English Wikipedia article: Abstract polytope","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+polytope"}],"status":"reported","summary":"English Wikipedia (article \"Abstract polytope\", CC BY-SA 4.0) states: In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.aubin-lions-lemma","kind":"theory","label":"Aubin–Lions lemma","sources":[{"id":"wikipedia.article.aubin-lions-lemma","title":"English Wikipedia article: Aubin–Lions lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aubin%E2%80%93Lions+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Aubin–Lions lemma\", CC BY-SA 4.0) states: In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ambient-space-mathematics","kind":"concept","label":"Ambient space (mathematics)","sources":[{"id":"wikipedia.article.ambient-space-mathematics","title":"English Wikipedia article: Ambient space (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambient+space+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Ambient space (mathematics)\", CC BY-SA 4.0) states: In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chern-weil-theory","kind":"concept","label":"∞-Chern–Weil theory","sources":[{"id":"wikipedia.article.chern-weil-theory","title":"English Wikipedia article: ∞-Chern–Weil theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%88%9E-Chern%E2%80%93Weil+theory"}],"status":"reported","summary":"English Wikipedia (article \"∞-Chern–Weil theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beckman-quarles-theorem","kind":"theory","label":"Beckman–Quarles theorem","sources":[{"id":"wikipedia.article.beckman-quarles-theorem","title":"English Wikipedia article: Beckman–Quarles theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beckman%E2%80%93Quarles+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Beckman–Quarles theorem\", CC BY-SA 4.0) states: In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.blackwell-girshick-equation","kind":"concept","label":"Blackwell-Girshick equation","sources":[{"id":"wikipedia.article.blackwell-girshick-equation","title":"English Wikipedia article: Blackwell-Girshick equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blackwell-Girshick+equation"}],"status":"reported","summary":"English Wikipedia (article \"Blackwell-Girshick equation\", CC BY-SA 4.0) states: The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boolean-differential-calculus","kind":"concept","label":"Boolean differential calculus","sources":[{"id":"wikipedia.article.boolean-differential-calculus","title":"English Wikipedia article: Boolean differential calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean+differential+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Boolean differential calculus\", CC BY-SA 4.0) states: Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-logic","kind":"concept","label":"Abstract logic","sources":[{"id":"wikipedia.article.abstract-logic","title":"English Wikipedia article: Abstract logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+logic"}],"status":"reported","summary":"English Wikipedia (article \"Abstract logic\", CC BY-SA 4.0) states: In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-symmetric-group","kind":"concept","label":"Affine symmetric group","sources":[{"id":"wikipedia.article.affine-symmetric-group","title":"English Wikipedia article: Affine symmetric group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+symmetric+group"}],"status":"reported","summary":"English Wikipedia (article \"Affine symmetric group\", CC BY-SA 4.0) states: The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anosov-diffeomorphism","kind":"concept","label":"Anosov diffeomorphism","sources":[{"id":"wikipedia.article.anosov-diffeomorphism","title":"English Wikipedia article: Anosov diffeomorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anosov+diffeomorphism"}],"status":"reported","summary":"English Wikipedia (article \"Anosov diffeomorphism\", CC BY-SA 4.0) states: In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \"expansion\" and \"contraction\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beauville-laszlo-theorem","kind":"theory","label":"Beauville–Laszlo theorem","sources":[{"id":"wikipedia.article.beauville-laszlo-theorem","title":"English Wikipedia article: Beauville–Laszlo theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beauville%E2%80%93Laszlo+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Beauville–Laszlo theorem\", CC BY-SA 4.0) states: In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \"glue\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-perfect-number","kind":"concept","label":"Almost perfect number","sources":[{"id":"wikipedia.article.almost-perfect-number","title":"English Wikipedia article: Almost perfect number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+perfect+number"}],"status":"reported","summary":"English Wikipedia (article \"Almost perfect number\", CC BY-SA 4.0) states: In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-manifolds","kind":"concept","label":"Category of manifolds","sources":[{"id":"wikipedia.article.category-of-manifolds","title":"English Wikipedia article: Category of manifolds","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+manifolds"}],"status":"reported","summary":"English Wikipedia (article \"Category of manifolds\", CC BY-SA 4.0) states: In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dieudonn-plank","kind":"concept","label":"Dieudonné plank","sources":[{"id":"wikipedia.article.dieudonn-plank","title":"English Wikipedia article: Dieudonné plank","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dieudonn%C3%A9+plank"}],"status":"reported","summary":"English Wikipedia (article \"Dieudonné plank\", CC BY-SA 4.0) states: In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bing-metrization-theorem","kind":"theory","label":"Bing metrization theorem","sources":[{"id":"wikipedia.article.bing-metrization-theorem","title":"English Wikipedia article: Bing metrization theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bing+metrization+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bing metrization theorem\", CC BY-SA 4.0) states: In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.dehn-s-lemma","kind":"theory","label":"Dehn's lemma","sources":[{"id":"wikipedia.article.dehn-s-lemma","title":"English Wikipedia article: Dehn's lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dehn%27s+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Dehn's lemma\", CC BY-SA 4.0) states: In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.disjunctive-sequence","kind":"concept","label":"Disjunctive sequence","sources":[{"id":"wikipedia.article.disjunctive-sequence","title":"English Wikipedia article: Disjunctive sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disjunctive+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Disjunctive sequence\", CC BY-SA 4.0) states: A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.consistency","kind":"concept","label":"Consistency","sources":[{"id":"wikipedia.article.consistency","title":"English Wikipedia article: Consistency","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consistency"}],"status":"reported","summary":"English Wikipedia (article \"Consistency\", CC BY-SA 4.0) states: In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bar-complex","kind":"concept","label":"Bar complex","sources":[{"id":"wikipedia.article.bar-complex","title":"English Wikipedia article: Bar complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bar+complex"}],"status":"reported","summary":"English Wikipedia (article \"Bar complex\", CC BY-SA 4.0) states: In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.busemann-petty-problem","kind":"concept","label":"Busemann–Petty problem","sources":[{"id":"wikipedia.article.busemann-petty-problem","title":"English Wikipedia article: Busemann–Petty problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Busemann%E2%80%93Petty+problem"}],"status":"reported","summary":"English Wikipedia (article \"Busemann–Petty problem\", CC BY-SA 4.0) states: In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-identity","kind":"concept","label":"Additive identity","sources":[{"id":"wikipedia.article.additive-identity","title":"English Wikipedia article: Additive identity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+identity"}],"status":"reported","summary":"English Wikipedia (article \"Additive identity\", CC BY-SA 4.0) states: In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.axiom-of-countability","kind":"concept","label":"Axiom of countability","sources":[{"id":"wikipedia.article.axiom-of-countability","title":"English Wikipedia article: Axiom of countability","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiom+of+countability"}],"status":"reported","summary":"English Wikipedia (article \"Axiom of countability\", CC BY-SA 4.0) states: In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-simplicial-complex","kind":"concept","label":"Abstract simplicial complex","sources":[{"id":"wikipedia.article.abstract-simplicial-complex","title":"English Wikipedia article: Abstract simplicial complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+simplicial+complex"}],"status":"reported","summary":"English Wikipedia (article \"Abstract simplicial complex\", CC BY-SA 4.0) states: In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.abc-conjecture","kind":"question","label":"Abc conjecture","sources":[{"id":"wikipedia.article.abc-conjecture","title":"English Wikipedia article: Abc conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abc+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Abc conjecture\", CC BY-SA 4.0) states: The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-limit","kind":"concept","label":"Approximate limit","sources":[{"id":"wikipedia.article.approximate-limit","title":"English Wikipedia article: Approximate limit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+limit"}],"status":"reported","summary":"English Wikipedia (article \"Approximate limit\", CC BY-SA 4.0) states: In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asano-contraction","kind":"concept","label":"Asano contraction","sources":[{"id":"wikipedia.article.asano-contraction","title":"English Wikipedia article: Asano contraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asano+contraction"}],"status":"reported","summary":"English Wikipedia (article \"Asano contraction\", CC BY-SA 4.0) states: In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-interior","kind":"concept","label":"Algebraic interior","sources":[{"id":"wikipedia.article.algebraic-interior","title":"English Wikipedia article: Algebraic interior","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+interior"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic interior\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.sat","kind":"concept","label":"♯SAT","sources":[{"id":"wikipedia.article.sat","title":"English Wikipedia article: ♯SAT","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%99%AFSAT"}],"status":"reported","summary":"English Wikipedia (article \"♯SAT\", CC BY-SA 4.0) states: In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ascending-chain-condition","kind":"concept","label":"Ascending chain condition","sources":[{"id":"wikipedia.article.ascending-chain-condition","title":"English Wikipedia article: Ascending chain condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ascending+chain+condition"}],"status":"reported","summary":"English Wikipedia (article \"Ascending chain condition\", CC BY-SA 4.0) states: In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bendixson-dulac-theorem","kind":"theory","label":"Bendixson–Dulac theorem","sources":[{"id":"wikipedia.article.bendixson-dulac-theorem","title":"English Wikipedia article: Bendixson–Dulac theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bendixson%E2%80%93Dulac+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bendixson–Dulac theorem\", CC BY-SA 4.0) states: In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.atiyah-jones-conjecture","kind":"question","label":"Atiyah–Jones conjecture","sources":[{"id":"wikipedia.article.atiyah-jones-conjecture","title":"English Wikipedia article: Atiyah–Jones conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atiyah%E2%80%93Jones+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Atiyah–Jones conjecture\", CC BY-SA 4.0) states: In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebra-representation","kind":"concept","label":"Algebra representation","sources":[{"id":"wikipedia.article.algebra-representation","title":"English Wikipedia article: Algebra representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebra+representation"}],"status":"reported","summary":"English Wikipedia (article \"Algebra representation\", CC BY-SA 4.0) states: In abstract algebra, a representation of an associative algebra is a module for that algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bimodule","kind":"concept","label":"Bimodule","sources":[{"id":"wikipedia.article.bimodule","title":"English Wikipedia article: Bimodule","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bimodule"}],"status":"reported","summary":"English Wikipedia (article \"Bimodule\", CC BY-SA 4.0) states: In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-function","kind":"concept","label":"Algebraic function","sources":[{"id":"wikipedia.article.algebraic-function","title":"English Wikipedia article: Algebraic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+function"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic function\", CC BY-SA 4.0) states: In mathematics, an algebraic function is a function that satisfies a polynomial equation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.discontinuous-group","kind":"concept","label":"Discontinuous group","sources":[{"id":"wikipedia.article.discontinuous-group","title":"English Wikipedia article: Discontinuous group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discontinuous+group"}],"status":"reported","summary":"English Wikipedia (article \"Discontinuous group\", CC BY-SA 4.0) states: A discontinuous group is a mathematical concept relating to mappings in topological space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.birch-s-theorem","kind":"theory","label":"Birch's theorem","sources":[{"id":"wikipedia.article.birch-s-theorem","title":"English Wikipedia article: Birch's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Birch%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Birch's theorem\", CC BY-SA 4.0) states: In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bing-s-recognition-theorem","kind":"theory","label":"Bing's recognition theorem","sources":[{"id":"wikipedia.article.bing-s-recognition-theorem","title":"English Wikipedia article: Bing's recognition theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bing%27s+recognition+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bing's recognition theorem\", CC BY-SA 4.0) states: In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.geometric-progression","kind":"concept","label":"Geometric progression","sources":[{"id":"wikipedia.article.geometric-progression","title":"English Wikipedia article: Geometric progression","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+progression"}],"status":"reported","summary":"English Wikipedia (article \"Geometric progression\", CC BY-SA 4.0) states: A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.curry-howard-correspondence","kind":"concept","label":"Curry–Howard correspondence","sources":[{"id":"wikipedia.article.curry-howard-correspondence","title":"English Wikipedia article: Curry–Howard correspondence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Curry%E2%80%93Howard+correspondence"}],"status":"reported","summary":"English Wikipedia (article \"Curry–Howard correspondence\", CC BY-SA 4.0) states: In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetical-set","kind":"concept","label":"Arithmetical set","sources":[{"id":"wikipedia.article.arithmetical-set","title":"English Wikipedia article: Arithmetical set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetical+set"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetical set\", CC BY-SA 4.0) states: In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.andr-quillen-cohomology","kind":"concept","label":"André–Quillen cohomology","sources":[{"id":"wikipedia.article.andr-quillen-cohomology","title":"English Wikipedia article: André–Quillen cohomology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andr%C3%A9%E2%80%93Quillen+cohomology"}],"status":"reported","summary":"English Wikipedia (article \"André–Quillen cohomology\", CC BY-SA 4.0) states: In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-group","kind":"concept","label":"Affine group","sources":[{"id":"wikipedia.article.affine-group","title":"English Wikipedia article: Affine group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+group"}],"status":"reported","summary":"English Wikipedia (article \"Affine group\", CC BY-SA 4.0) states: In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-structure","kind":"concept","label":"Algebraic structure","sources":[{"id":"wikipedia.article.algebraic-structure","title":"English Wikipedia article: Algebraic structure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+structure"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic structure\", CC BY-SA 4.0) states: In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","kind":"concept","label":"Axiomatic foundations of topological spaces","sources":[{"id":"wikipedia.article.axiomatic-foundations-of-topological-spaces","title":"English Wikipedia article: Axiomatic foundations of topological spaces","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiomatic+foundations+of+topological+spaces"}],"status":"reported","summary":"English Wikipedia (article \"Axiomatic foundations of topological spaces\", CC BY-SA 4.0) states: In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abel-s-summation-formula","kind":"concept","label":"Abel's summation formula","sources":[{"id":"wikipedia.article.abel-s-summation-formula","title":"English Wikipedia article: Abel's summation formula","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+summation+formula"}],"status":"reported","summary":"English Wikipedia (article \"Abel's summation formula\", CC BY-SA 4.0) states: In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximately-continuous-function","kind":"concept","label":"Approximately continuous function","sources":[{"id":"wikipedia.article.approximately-continuous-function","title":"English Wikipedia article: Approximately continuous function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximately+continuous+function"}],"status":"reported","summary":"English Wikipedia (article \"Approximately continuous function\", CC BY-SA 4.0) states: In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymptotic-expansion","kind":"concept","label":"Asymptotic expansion","sources":[{"id":"wikipedia.article.asymptotic-expansion","title":"English Wikipedia article: Asymptotic expansion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptotic+expansion"}],"status":"reported","summary":"English Wikipedia (article \"Asymptotic expansion\", CC BY-SA 4.0) states: In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function near a specific point or at infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-semigroup","kind":"concept","label":"Analytic semigroup","sources":[{"id":"wikipedia.article.analytic-semigroup","title":"English Wikipedia article: Analytic semigroup","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+semigroup"}],"status":"reported","summary":"English Wikipedia (article \"Analytic semigroup\", CC BY-SA 4.0) states: In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.graph-coloring","kind":"concept","label":"Graph coloring","sources":[{"id":"wikipedia.article.graph-coloring","title":"English Wikipedia article: Graph coloring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Graph+coloring"}],"status":"reported","summary":"English Wikipedia (article \"Graph coloring\", CC BY-SA 4.0) states: In graph theory, graph coloring is a methodic assignment of labels traditionally called \"colors\" to elements of a graph.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.british-flag-theorem","kind":"theory","label":"British flag theorem","sources":[{"id":"wikipedia.article.british-flag-theorem","title":"English Wikipedia article: British flag theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=British+flag+theorem"}],"status":"reported","summary":"English Wikipedia (article \"British flag theorem\", CC BY-SA 4.0) states: In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-nonsense","kind":"concept","label":"Abstract nonsense","sources":[{"id":"wikipedia.article.abstract-nonsense","title":"English Wikipedia article: Abstract nonsense","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+nonsense"}],"status":"reported","summary":"English Wikipedia (article \"Abstract nonsense\", CC BY-SA 4.0) states: In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-semantics-mathematical-logic","kind":"concept","label":"Algebraic semantics (mathematical logic)","sources":[{"id":"wikipedia.article.algebraic-semantics-mathematical-logic","title":"English Wikipedia article: Algebraic semantics (mathematical logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+semantics+%28mathematical+logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic semantics (mathematical logic)\", CC BY-SA 4.0) states: In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.distributive-lattice","kind":"concept","label":"Distributive lattice","sources":[{"id":"wikipedia.article.distributive-lattice","title":"English Wikipedia article: Distributive lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distributive+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Distributive lattice\", CC BY-SA 4.0) states: In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ball-mathematics","kind":"concept","label":"Ball (mathematics)","sources":[{"id":"wikipedia.article.ball-mathematics","title":"English Wikipedia article: Ball (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Ball (mathematics)\", CC BY-SA 4.0) states: In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.arithmetic-dynamics","kind":"field","label":"Arithmetic dynamics","sources":[{"id":"wikipedia.article.arithmetic-dynamics","title":"English Wikipedia article: Arithmetic dynamics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+dynamics"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic dynamics\", CC BY-SA 4.0) states: Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anderson-acceleration","kind":"concept","label":"Anderson acceleration","sources":[{"id":"wikipedia.article.anderson-acceleration","title":"English Wikipedia article: Anderson acceleration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anderson+acceleration"}],"status":"reported","summary":"English Wikipedia (article \"Anderson acceleration\", CC BY-SA 4.0) states: In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.brauer-s-k-b-conjecture","kind":"question","label":"Brauer's k(B) conjecture","sources":[{"id":"wikipedia.article.brauer-s-k-b-conjecture","title":"English Wikipedia article: Brauer's k(B) conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brauer%27s+k%28B%29+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Brauer's k(B) conjecture\", CC BY-SA 4.0) states: Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amicable-numbers","kind":"concept","label":"Amicable numbers","sources":[{"id":"wikipedia.article.amicable-numbers","title":"English Wikipedia article: Amicable numbers","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amicable+numbers"}],"status":"reported","summary":"English Wikipedia (article \"Amicable numbers\", CC BY-SA 4.0) states: In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.discrete-two-point-space","kind":"concept","label":"Discrete two-point space","sources":[{"id":"wikipedia.article.discrete-two-point-space","title":"English Wikipedia article: Discrete two-point space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discrete+two-point+space"}],"status":"reported","summary":"English Wikipedia (article \"Discrete two-point space\", CC BY-SA 4.0) states: In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.brauer-s-theorem-on-forms","kind":"theory","label":"Brauer's theorem on forms","sources":[{"id":"wikipedia.article.brauer-s-theorem-on-forms","title":"English Wikipedia article: Brauer's theorem on forms","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brauer%27s+theorem+on+forms"}],"status":"reported","summary":"English Wikipedia (article \"Brauer's theorem on forms\", CC BY-SA 4.0) states: There also is Brauer's theorem on induced characters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.continuous-function","kind":"concept","label":"Continuous function","sources":[{"id":"wikipedia.article.continuous-function","title":"English Wikipedia article: Continuous function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Continuous+function"}],"status":"reported","summary":"English Wikipedia (article \"Continuous function\", CC BY-SA 4.0) states: In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.halton-sequence","kind":"concept","label":"Halton sequence","sources":[{"id":"wikipedia.article.halton-sequence","title":"English Wikipedia article: Halton sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Halton+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Halton sequence\", CC BY-SA 4.0) states: In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cut-elimination-theorem","kind":"theory","label":"Cut-elimination theorem","sources":[{"id":"wikipedia.article.cut-elimination-theorem","title":"English Wikipedia article: Cut-elimination theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cut-elimination+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cut-elimination theorem\", CC BY-SA 4.0) states: The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dyadic-cubes","kind":"concept","label":"Dyadic cubes","sources":[{"id":"wikipedia.article.dyadic-cubes","title":"English Wikipedia article: Dyadic cubes","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dyadic+cubes"}],"status":"reported","summary":"English Wikipedia (article \"Dyadic cubes\", CC BY-SA 4.0) states: In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arf-ring","kind":"concept","label":"Arf ring","sources":[{"id":"wikipedia.article.arf-ring","title":"English Wikipedia article: Arf ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arf+ring"}],"status":"reported","summary":"English Wikipedia (article \"Arf ring\", CC BY-SA 4.0) states: In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.berry-robbins-problem","kind":"concept","label":"Berry–Robbins problem","sources":[{"id":"wikipedia.article.berry-robbins-problem","title":"English Wikipedia article: Berry–Robbins problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Berry%E2%80%93Robbins+problem"}],"status":"reported","summary":"English Wikipedia (article \"Berry–Robbins problem\", CC BY-SA 4.0) states: In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-curve","kind":"concept","label":"Convex curve","sources":[{"id":"wikipedia.article.convex-curve","title":"English Wikipedia article: Convex curve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+curve"}],"status":"reported","summary":"English Wikipedia (article \"Convex curve\", CC BY-SA 4.0) states: In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arity","kind":"concept","label":"Arity","sources":[{"id":"wikipedia.article.arity","title":"English Wikipedia article: Arity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arity"}],"status":"reported","summary":"English Wikipedia (article \"Arity\", CC BY-SA 4.0) states: In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.baire-category-theorem","kind":"theory","label":"Baire category theorem","sources":[{"id":"wikipedia.article.baire-category-theorem","title":"English Wikipedia article: Baire category theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+category+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Baire category theorem\", CC BY-SA 4.0) states: The Baire category theorem (BCT) is an important result in general topology and functional analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-number-theory","kind":"field","label":"Algebraic number theory","sources":[{"id":"wikipedia.article.algebraic-number-theory","title":"English Wikipedia article: Algebraic number theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+number+theory"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic number theory\", CC BY-SA 4.0) states: Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baire-one-star-function","kind":"concept","label":"Baire one star function","sources":[{"id":"wikipedia.article.baire-one-star-function","title":"English Wikipedia article: Baire one star function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+one+star+function"}],"status":"reported","summary":"English Wikipedia (article \"Baire one star function\", CC BY-SA 4.0) states: A Baire one star function is a type of function studied in real analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arnold-invariants","kind":"concept","label":"Arnold invariants","sources":[{"id":"wikipedia.article.arnold-invariants","title":"English Wikipedia article: Arnold invariants","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arnold+invariants"}],"status":"reported","summary":"English Wikipedia (article \"Arnold invariants\", CC BY-SA 4.0) states: In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-bundle","kind":"concept","label":"Affine bundle","sources":[{"id":"wikipedia.article.affine-bundle","title":"English Wikipedia article: Affine bundle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+bundle"}],"status":"reported","summary":"English Wikipedia (article \"Affine bundle\", CC BY-SA 4.0) states: In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beki-s-theorem","kind":"theory","label":"Bekić's theorem","sources":[{"id":"wikipedia.article.beki-s-theorem","title":"English Wikipedia article: Bekić's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beki%C4%87%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bekić's theorem\", CC BY-SA 4.0) states: In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymptote","kind":"concept","label":"Asymptote","sources":[{"id":"wikipedia.article.asymptote","title":"English Wikipedia article: Asymptote","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptote"}],"status":"reported","summary":"English Wikipedia (article \"Asymptote\", CC BY-SA 4.0) states: In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.biryukov-equation","kind":"concept","label":"Biryukov equation","sources":[{"id":"wikipedia.article.biryukov-equation","title":"English Wikipedia article: Biryukov equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biryukov+equation"}],"status":"reported","summary":"English Wikipedia (article \"Biryukov equation\", CC BY-SA 4.0) states: In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arnold-diffusion","kind":"concept","label":"Arnold diffusion","sources":[{"id":"wikipedia.article.arnold-diffusion","title":"English Wikipedia article: Arnold diffusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arnold+diffusion"}],"status":"reported","summary":"English Wikipedia (article \"Arnold diffusion\", CC BY-SA 4.0) states: In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cuthill-mckee-algorithm","kind":"concept","label":"Cuthill–McKee algorithm","sources":[{"id":"wikipedia.article.cuthill-mckee-algorithm","title":"English Wikipedia article: Cuthill–McKee algorithm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cuthill%E2%80%93McKee+algorithm"}],"status":"reported","summary":"English Wikipedia (article \"Cuthill–McKee algorithm\", CC BY-SA 4.0) states: In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.all-one-polynomial","kind":"concept","label":"All one polynomial","sources":[{"id":"wikipedia.article.all-one-polynomial","title":"English Wikipedia article: All one polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=All+one+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"All one polynomial\", CC BY-SA 4.0) states: In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-number","kind":"concept","label":"Arithmetic number","sources":[{"id":"wikipedia.article.arithmetic-number","title":"English Wikipedia article: Arithmetic number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+number"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic number\", CC BY-SA 4.0) states: In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.brumer-bound","kind":"concept","label":"Brumer bound","sources":[{"id":"wikipedia.article.brumer-bound","title":"English Wikipedia article: Brumer bound","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brumer+bound"}],"status":"reported","summary":"English Wikipedia (article \"Brumer bound\", CC BY-SA 4.0) states: In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.brouwer-fixed-point-theorem","kind":"theory","label":"Brouwer fixed-point theorem","sources":[{"id":"wikipedia.article.brouwer-fixed-point-theorem","title":"English Wikipedia article: Brouwer fixed-point theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brouwer+fixed-point+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Brouwer fixed-point theorem\", CC BY-SA 4.0) states: Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.harmonic-progression-mathematics","kind":"concept","label":"Harmonic progression (mathematics)","sources":[{"id":"wikipedia.article.harmonic-progression-mathematics","title":"English Wikipedia article: Harmonic progression (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+progression+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic progression (mathematics)\", CC BY-SA 4.0) states: In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automatic-semigroup","kind":"concept","label":"Automatic semigroup","sources":[{"id":"wikipedia.article.automatic-semigroup","title":"English Wikipedia article: Automatic semigroup","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automatic+semigroup"}],"status":"reported","summary":"English Wikipedia (article \"Automatic semigroup\", CC BY-SA 4.0) states: In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cagniard-de-hoop-method","kind":"concept","label":"Cagniard–De Hoop method","sources":[{"id":"wikipedia.article.cagniard-de-hoop-method","title":"English Wikipedia article: Cagniard–De Hoop method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cagniard%E2%80%93De+Hoop+method"}],"status":"reported","summary":"English Wikipedia (article \"Cagniard–De Hoop method\", CC BY-SA 4.0) states: In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-metric-space","kind":"concept","label":"Convex metric space","sources":[{"id":"wikipedia.article.convex-metric-space","title":"English Wikipedia article: Convex metric space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+metric+space"}],"status":"reported","summary":"English Wikipedia (article \"Convex metric space\", CC BY-SA 4.0) states: In mathematics, there are several notions of \"convexity\" on metric spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-group","kind":"concept","label":"Approximate group","sources":[{"id":"wikipedia.article.approximate-group","title":"English Wikipedia article: Approximate group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+group"}],"status":"reported","summary":"English Wikipedia (article \"Approximate group\", CC BY-SA 4.0) states: In mathematics, an approximate group is a subset of a group which behaves like a subgroup \"up to a constant error\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antiisomorphism","kind":"concept","label":"Antiisomorphism","sources":[{"id":"wikipedia.article.antiisomorphism","title":"English Wikipedia article: Antiisomorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiisomorphism"}],"status":"reported","summary":"English Wikipedia (article \"Antiisomorphism\", CC BY-SA 4.0) states: In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automorphism","kind":"concept","label":"Automorphism","sources":[{"id":"wikipedia.article.automorphism","title":"English Wikipedia article: Automorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automorphism"}],"status":"reported","summary":"English Wikipedia (article \"Automorphism\", CC BY-SA 4.0) states: In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymmetric-norm","kind":"concept","label":"Asymmetric norm","sources":[{"id":"wikipedia.article.asymmetric-norm","title":"English Wikipedia article: Asymmetric norm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymmetric+norm"}],"status":"reported","summary":"English Wikipedia (article \"Asymmetric norm\", CC BY-SA 4.0) states: In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amenable-number","kind":"concept","label":"Amenable number","sources":[{"id":"wikipedia.article.amenable-number","title":"English Wikipedia article: Amenable number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amenable+number"}],"status":"reported","summary":"English Wikipedia (article \"Amenable number\", CC BY-SA 4.0) states: An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asplund-space","kind":"concept","label":"Asplund space","sources":[{"id":"wikipedia.article.asplund-space","title":"English Wikipedia article: Asplund space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asplund+space"}],"status":"reported","summary":"English Wikipedia (article \"Asplund space\", CC BY-SA 4.0) states: In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.addition-principle","kind":"concept","label":"Addition principle","sources":[{"id":"wikipedia.article.addition-principle","title":"English Wikipedia article: Addition principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Addition+principle"}],"status":"reported","summary":"English Wikipedia (article \"Addition principle\", CC BY-SA 4.0) states: In combinatorics, the addition principle or rule of sum is a basic counting principle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.consensus-dynamics","kind":"field","label":"Consensus dynamics","sources":[{"id":"wikipedia.article.consensus-dynamics","title":"English Wikipedia article: Consensus dynamics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consensus+dynamics"}],"status":"reported","summary":"English Wikipedia (article \"Consensus dynamics\", CC BY-SA 4.0) states: Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-connection","kind":"concept","label":"Affine connection","sources":[{"id":"wikipedia.article.affine-connection","title":"English Wikipedia article: Affine connection","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+connection"}],"status":"reported","summary":"English Wikipedia (article \"Affine connection\", CC BY-SA 4.0) states: In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carlyle-circle","kind":"concept","label":"Carlyle circle","sources":[{"id":"wikipedia.article.carlyle-circle","title":"English Wikipedia article: Carlyle circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carlyle+circle"}],"status":"reported","summary":"English Wikipedia (article \"Carlyle circle\", CC BY-SA 4.0) states: In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carr-du-champ-operator","kind":"concept","label":"Carré du champ operator","sources":[{"id":"wikipedia.article.carr-du-champ-operator","title":"English Wikipedia article: Carré du champ operator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carr%C3%A9+du+champ+operator"}],"status":"reported","summary":"English Wikipedia (article \"Carré du champ operator\", CC BY-SA 4.0) states: The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.accessible-quasi-category","kind":"concept","label":"Accessible quasi-category","sources":[{"id":"wikipedia.article.accessible-quasi-category","title":"English Wikipedia article: Accessible quasi-category","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Accessible+quasi-category"}],"status":"reported","summary":"English Wikipedia (article \"Accessible quasi-category\", CC BY-SA 4.0) states: In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.breather-surface","kind":"concept","label":"Breather surface","sources":[{"id":"wikipedia.article.breather-surface","title":"English Wikipedia article: Breather surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breather+surface"}],"status":"reported","summary":"English Wikipedia (article \"Breather surface\", CC BY-SA 4.0) states: In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dominance-order","kind":"concept","label":"Dominance order","sources":[{"id":"wikipedia.article.dominance-order","title":"English Wikipedia article: Dominance order","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dominance+order"}],"status":"reported","summary":"English Wikipedia (article \"Dominance order\", CC BY-SA 4.0) states: In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.derivative-of-the-exponential-map","kind":"concept","label":"Derivative of the exponential map","sources":[{"id":"wikipedia.article.derivative-of-the-exponential-map","title":"English Wikipedia article: Derivative of the exponential map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Derivative+of+the+exponential+map"}],"status":"reported","summary":"English Wikipedia (article \"Derivative of the exponential map\", CC BY-SA 4.0) states: In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetico-geometric-sequence","kind":"concept","label":"Arithmetico-geometric sequence","sources":[{"id":"wikipedia.article.arithmetico-geometric-sequence","title":"English Wikipedia article: Arithmetico-geometric sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetico-geometric+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetico-geometric sequence\", CC BY-SA 4.0) states: In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hilbert-burch-theorem","kind":"theory","label":"Hilbert–Burch theorem","sources":[{"id":"wikipedia.article.hilbert-burch-theorem","title":"English Wikipedia article: Hilbert–Burch theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hilbert%E2%80%93Burch+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Hilbert–Burch theorem\", CC BY-SA 4.0) states: In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cyclic-surgery-theorem","kind":"theory","label":"Cyclic surgery theorem","sources":[{"id":"wikipedia.article.cyclic-surgery-theorem","title":"English Wikipedia article: Cyclic surgery theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cyclic+surgery+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cyclic surgery theorem\", CC BY-SA 4.0) states: In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.furstenberg-boundary","kind":"concept","label":"Furstenberg boundary","sources":[{"id":"wikipedia.article.furstenberg-boundary","title":"English Wikipedia article: Furstenberg boundary","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Furstenberg+boundary"}],"status":"reported","summary":"English Wikipedia (article \"Furstenberg boundary\", CC BY-SA 4.0) states: In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chain-complex","kind":"concept","label":"Chain complex","sources":[{"id":"wikipedia.article.chain-complex","title":"English Wikipedia article: Chain complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+complex"}],"status":"reported","summary":"English Wikipedia (article \"Chain complex\", CC BY-SA 4.0) states: In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-polygon","kind":"concept","label":"Convex polygon","sources":[{"id":"wikipedia.article.convex-polygon","title":"English Wikipedia article: Convex polygon","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+polygon"}],"status":"reported","summary":"English Wikipedia (article \"Convex polygon\", CC BY-SA 4.0) states: In geometry, a convex polygon is a polygon that is the boundary of a convex set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexander-duality","kind":"concept","label":"Alexander duality","sources":[{"id":"wikipedia.article.alexander-duality","title":"English Wikipedia article: Alexander duality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander+duality"}],"status":"reported","summary":"English Wikipedia (article \"Alexander duality\", CC BY-SA 4.0) states: In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amicable-triple","kind":"concept","label":"Amicable triple","sources":[{"id":"wikipedia.article.amicable-triple","title":"English Wikipedia article: Amicable triple","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amicable+triple"}],"status":"reported","summary":"English Wikipedia (article \"Amicable triple\", CC BY-SA 4.0) states: In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.associative-property","kind":"concept","label":"Associative property","sources":[{"id":"wikipedia.article.associative-property","title":"English Wikipedia article: Associative property","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Associative+property"}],"status":"reported","summary":"English Wikipedia (article \"Associative property\", CC BY-SA 4.0) states: In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-function","kind":"concept","label":"Cantor function","sources":[{"id":"wikipedia.article.cantor-function","title":"English Wikipedia article: Cantor function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+function"}],"status":"reported","summary":"English Wikipedia (article \"Cantor function\", CC BY-SA 4.0) states: In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.casey-s-theorem","kind":"theory","label":"Casey's theorem","sources":[{"id":"wikipedia.article.casey-s-theorem","title":"English Wikipedia article: Casey's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Casey%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Casey's theorem\", CC BY-SA 4.0) states: In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.betweenness-problem","kind":"concept","label":"Betweenness problem","sources":[{"id":"wikipedia.article.betweenness-problem","title":"English Wikipedia article: Betweenness problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Betweenness+problem"}],"status":"reported","summary":"English Wikipedia (article \"Betweenness problem\", CC BY-SA 4.0) states: Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dual-lattice","kind":"concept","label":"Dual lattice","sources":[{"id":"wikipedia.article.dual-lattice","title":"English Wikipedia article: Dual lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dual+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Dual lattice\", CC BY-SA 4.0) states: In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bitopological-space","kind":"concept","label":"Bitopological space","sources":[{"id":"wikipedia.article.bitopological-space","title":"English Wikipedia article: Bitopological space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bitopological+space"}],"status":"reported","summary":"English Wikipedia (article \"Bitopological space\", CC BY-SA 4.0) states: In mathematics, a bitopological space is a set endowed with two topologies.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-cycle","kind":"concept","label":"Algebraic cycle","sources":[{"id":"wikipedia.article.algebraic-cycle","title":"English Wikipedia article: Algebraic cycle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+cycle"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic cycle\", CC BY-SA 4.0) states: In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V. These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-system-mathematics","kind":"concept","label":"Autonomous system (mathematics)","sources":[{"id":"wikipedia.article.autonomous-system-mathematics","title":"English Wikipedia article: Autonomous system (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+system+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous system (mathematics)\", CC BY-SA 4.0) states: In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximation-error","kind":"concept","label":"Approximation error","sources":[{"id":"wikipedia.article.approximation-error","title":"English Wikipedia article: Approximation error","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximation+error"}],"status":"reported","summary":"English Wikipedia (article \"Approximation error\", CC BY-SA 4.0) states: The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.angelescu-polynomials","kind":"concept","label":"Angelescu polynomials","sources":[{"id":"wikipedia.article.angelescu-polynomials","title":"English Wikipedia article: Angelescu polynomials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angelescu+polynomials"}],"status":"reported","summary":"English Wikipedia (article \"Angelescu polynomials\", CC BY-SA 4.0) states: In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automatic-sequence","kind":"concept","label":"Automatic sequence","sources":[{"id":"wikipedia.article.automatic-sequence","title":"English Wikipedia article: Automatic sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automatic+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Automatic sequence\", CC BY-SA 4.0) states: In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hochster-roberts-theorem","kind":"theory","label":"Hochster–Roberts theorem","sources":[{"id":"wikipedia.article.hochster-roberts-theorem","title":"English Wikipedia article: Hochster–Roberts theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hochster%E2%80%93Roberts+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Hochster–Roberts theorem\", CC BY-SA 4.0) states: In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.catalan-s-conjecture","kind":"question","label":"Catalan's conjecture","sources":[{"id":"wikipedia.article.catalan-s-conjecture","title":"English Wikipedia article: Catalan's conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catalan%27s+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Catalan's conjecture\", CC BY-SA 4.0) states: Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.differential-mathematics","kind":"concept","label":"Differential (mathematics)","sources":[{"id":"wikipedia.article.differential-mathematics","title":"English Wikipedia article: Differential (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Differential (mathematics)\", CC BY-SA 4.0) states: In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.elementary-class","kind":"concept","label":"Elementary class","sources":[{"id":"wikipedia.article.elementary-class","title":"English Wikipedia article: Elementary class","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elementary+class"}],"status":"reported","summary":"English Wikipedia (article \"Elementary class\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chirp-z-transform","kind":"concept","label":"Chirp Z-transform","sources":[{"id":"wikipedia.article.chirp-z-transform","title":"English Wikipedia article: Chirp Z-transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chirp+Z-transform"}],"status":"reported","summary":"English Wikipedia (article \"Chirp Z-transform\", CC BY-SA 4.0) states: The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.gelfand-pair","kind":"concept","label":"Gelfand pair","sources":[{"id":"wikipedia.article.gelfand-pair","title":"English Wikipedia article: Gelfand pair","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gelfand+pair"}],"status":"reported","summary":"English Wikipedia (article \"Gelfand pair\", CC BY-SA 4.0) states: In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.vietoris-rips-filtration","kind":"concept","label":"Vietoris–Rips filtration","sources":[{"id":"wikipedia.article.vietoris-rips-filtration","title":"English Wikipedia article: Vietoris–Rips filtration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Vietoris%E2%80%93Rips+filtration"}],"status":"reported","summary":"English Wikipedia (article \"Vietoris–Rips filtration\", CC BY-SA 4.0) states: In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \"Rips filtration\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-derivative","kind":"concept","label":"Arithmetic derivative","sources":[{"id":"wikipedia.article.arithmetic-derivative","title":"English Wikipedia article: Arithmetic derivative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+derivative"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic derivative\", CC BY-SA 4.0) states: In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounded-variation","kind":"concept","label":"Bounded variation","sources":[{"id":"wikipedia.article.bounded-variation","title":"English Wikipedia article: Bounded variation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounded+variation"}],"status":"reported","summary":"English Wikipedia (article \"Bounded variation\", CC BY-SA 4.0) states: In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.asymptotic-geometry","kind":"field","label":"Asymptotic geometry","sources":[{"id":"wikipedia.article.asymptotic-geometry","title":"English Wikipedia article: Asymptotic geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptotic+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Asymptotic geometry\", CC BY-SA 4.0) states: Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-set","kind":"concept","label":"Cantor set","sources":[{"id":"wikipedia.article.cantor-set","title":"English Wikipedia article: Cantor set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+set"}],"status":"reported","summary":"English Wikipedia (article \"Cantor set\", CC BY-SA 4.0) states: In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cauchy-s-theorem-geometry","kind":"theory","label":"Cauchy's theorem (geometry)","sources":[{"id":"wikipedia.article.cauchy-s-theorem-geometry","title":"English Wikipedia article: Cauchy's theorem (geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy%27s+theorem+%28geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy's theorem (geometry)\", CC BY-SA 4.0) states: Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.categorical-set-theory","kind":"concept","label":"Categorical set theory","sources":[{"id":"wikipedia.article.categorical-set-theory","title":"English Wikipedia article: Categorical set theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Categorical+set+theory"}],"status":"reported","summary":"English Wikipedia (article \"Categorical set theory\", CC BY-SA 4.0) states: Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.boolean-prime-ideal-theorem","kind":"theory","label":"Boolean prime ideal theorem","sources":[{"id":"wikipedia.article.boolean-prime-ideal-theorem","title":"English Wikipedia article: Boolean prime ideal theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean+prime+ideal+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Boolean prime ideal theorem\", CC BY-SA 4.0) states: In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounding-point","kind":"concept","label":"Bounding point","sources":[{"id":"wikipedia.article.bounding-point","title":"English Wikipedia article: Bounding point","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounding+point"}],"status":"reported","summary":"English Wikipedia (article \"Bounding point\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.borel-set","kind":"concept","label":"Borel set","sources":[{"id":"wikipedia.article.borel-set","title":"English Wikipedia article: Borel set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Borel+set"}],"status":"reported","summary":"English Wikipedia (article \"Borel set\", CC BY-SA 4.0) states: In mathematics, the Borel sets of a topological space are a particular class of \"well-behaved\" subsets of that space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximation-theory","kind":"concept","label":"Approximation theory","sources":[{"id":"wikipedia.article.approximation-theory","title":"English Wikipedia article: Approximation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Approximation theory\", CC BY-SA 4.0) states: In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","kind":"concept","label":"Eigenvalues and eigenvectors of the second derivative","sources":[{"id":"wikipedia.article.eigenvalues-and-eigenvectors-of-the-second-derivative","title":"English Wikipedia article: Eigenvalues and eigenvectors of the second derivative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eigenvalues+and+eigenvectors+of+the+second+derivative"}],"status":"reported","summary":"English Wikipedia (article \"Eigenvalues and eigenvectors of the second derivative\", CC BY-SA 4.0) states: Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baire-space-set-theory","kind":"concept","label":"Baire space (set theory)","sources":[{"id":"wikipedia.article.baire-space-set-theory","title":"English Wikipedia article: Baire space (set theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+space+%28set+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Baire space (set theory)\", CC BY-SA 4.0) states: In set theory, the Baire space is the set of all infinite sequences of natural numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.excluded-point-topology","kind":"concept","label":"Excluded point topology","sources":[{"id":"wikipedia.article.excluded-point-topology","title":"English Wikipedia article: Excluded point topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Excluded+point+topology"}],"status":"reported","summary":"English Wikipedia (article \"Excluded point topology\", CC BY-SA 4.0) states: In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.centered-polygonal-number-theorem","kind":"theory","label":"Centered polygonal number theorem","sources":[{"id":"wikipedia.article.centered-polygonal-number-theorem","title":"English Wikipedia article: Centered polygonal number theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centered+polygonal+number+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Centered polygonal number theorem\", CC BY-SA 4.0) states: In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.donaldson-s-theorem","kind":"theory","label":"Donaldson's theorem","sources":[{"id":"wikipedia.article.donaldson-s-theorem","title":"English Wikipedia article: Donaldson's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Donaldson%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Donaldson's theorem\", CC BY-SA 4.0) states: In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.differential-calculus","kind":"concept","label":"Differential calculus","sources":[{"id":"wikipedia.article.differential-calculus","title":"English Wikipedia article: Differential calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Differential calculus\", CC BY-SA 4.0) states: In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.logarithmically-concave-sequence","kind":"concept","label":"Logarithmically concave sequence","sources":[{"id":"wikipedia.article.logarithmically-concave-sequence","title":"English Wikipedia article: Logarithmically concave sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logarithmically+concave+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Logarithmically concave sequence\", CC BY-SA 4.0) states: In mathematics, a sequence a = (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dialectica-interpretation","kind":"concept","label":"Dialectica interpretation","sources":[{"id":"wikipedia.article.dialectica-interpretation","title":"English Wikipedia article: Dialectica interpretation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dialectica+interpretation"}],"status":"reported","summary":"English Wikipedia (article \"Dialectica interpretation\", CC BY-SA 4.0) states: In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T. It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chirplet-transform","kind":"concept","label":"Chirplet transform","sources":[{"id":"wikipedia.article.chirplet-transform","title":"English Wikipedia article: Chirplet transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chirplet+transform"}],"status":"reported","summary":"English Wikipedia (article \"Chirplet transform\", CC BY-SA 4.0) states: In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.group-algebra-of-a-locally-compact-group","kind":"concept","label":"Group algebra of a locally compact group","sources":[{"id":"wikipedia.article.group-algebra-of-a-locally-compact-group","title":"English Wikipedia article: Group algebra of a locally compact group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Group+algebra+of+a+locally+compact+group"}],"status":"reported","summary":"English Wikipedia (article \"Group algebra of a locally compact group\", CC BY-SA 4.0) states: In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cartan-decomposition","kind":"concept","label":"Cartan decomposition","sources":[{"id":"wikipedia.article.cartan-decomposition","title":"English Wikipedia article: Cartan decomposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartan+decomposition"}],"status":"reported","summary":"English Wikipedia (article \"Cartan decomposition\", CC BY-SA 4.0) states: In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-set","kind":"concept","label":"Convex set","sources":[{"id":"wikipedia.article.convex-set","title":"English Wikipedia article: Convex set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+set"}],"status":"reported","summary":"English Wikipedia (article \"Convex set\", CC BY-SA 4.0) states: In geometry, a set of points is convex if it contains every line segment between two points in the set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","kind":"concept","label":"Automorphisms of the symmetric and alternating groups","sources":[{"id":"wikipedia.article.automorphisms-of-the-symmetric-and-alternating-groups","title":"English Wikipedia article: Automorphisms of the symmetric and alternating groups","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automorphisms+of+the+symmetric+and+alternating+groups"}],"status":"reported","summary":"English Wikipedia (article \"Automorphisms of the symmetric and alternating groups\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.barycentric-coordinate-system","kind":"concept","label":"Barycentric coordinate system","sources":[{"id":"wikipedia.article.barycentric-coordinate-system","title":"English Wikipedia article: Barycentric coordinate system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barycentric+coordinate+system"}],"status":"reported","summary":"English Wikipedia (article \"Barycentric coordinate system\", CC BY-SA 4.0) states: In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-fuchsian-group","kind":"concept","label":"Arithmetic Fuchsian group","sources":[{"id":"wikipedia.article.arithmetic-fuchsian-group","title":"English Wikipedia article: Arithmetic Fuchsian group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+Fuchsian+group"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic Fuchsian group\", CC BY-SA 4.0) states: Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.c-dl-g","kind":"concept","label":"Càdlàg","sources":[{"id":"wikipedia.article.c-dl-g","title":"English Wikipedia article: Càdlàg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=C%C3%A0dl%C3%A0g"}],"status":"reported","summary":"English Wikipedia (article \"Càdlàg\", CC BY-SA 4.0) states: In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\"right continuous with left limits\"), or corlol (\"continuous on (the) right, limit on (the) left\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bicoherence","kind":"concept","label":"Bicoherence","sources":[{"id":"wikipedia.article.bicoherence","title":"English Wikipedia article: Bicoherence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicoherence"}],"status":"reported","summary":"English Wikipedia (article \"Bicoherence\", CC BY-SA 4.0) states: In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carath-odory-s-criterion","kind":"concept","label":"Carathéodory's criterion","sources":[{"id":"wikipedia.article.carath-odory-s-criterion","title":"English Wikipedia article: Carathéodory's criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carath%C3%A9odory%27s+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Carathéodory's criterion\", CC BY-SA 4.0) states: Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.centerpoint-geometry","kind":"concept","label":"Centerpoint (geometry)","sources":[{"id":"wikipedia.article.centerpoint-geometry","title":"English Wikipedia article: Centerpoint (geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centerpoint+%28geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Centerpoint (geometry)\", CC BY-SA 4.0) states: In statistics and computational geometry, the notion of centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.chang-s-conjecture","kind":"question","label":"Chang's conjecture","sources":[{"id":"wikipedia.article.chang-s-conjecture","title":"English Wikipedia article: Chang's conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chang%27s+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Chang's conjecture\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anamorphism","kind":"concept","label":"Anamorphism","sources":[{"id":"wikipedia.article.anamorphism","title":"English Wikipedia article: Anamorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anamorphism"}],"status":"reported","summary":"English Wikipedia (article \"Anamorphism\", CC BY-SA 4.0) states: In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arc-length-method","kind":"concept","label":"Arc-length method","sources":[{"id":"wikipedia.article.arc-length-method","title":"English Wikipedia article: Arc-length method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arc-length+method"}],"status":"reported","summary":"English Wikipedia (article \"Arc-length method\", CC BY-SA 4.0) states: In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.countably-generated-module","kind":"concept","label":"Countably generated module","sources":[{"id":"wikipedia.article.countably-generated-module","title":"English Wikipedia article: Countably generated module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Countably+generated+module"}],"status":"reported","summary":"English Wikipedia (article \"Countably generated module\", CC BY-SA 4.0) states: In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.freivalds-algorithm","kind":"concept","label":"Freivalds' algorithm","sources":[{"id":"wikipedia.article.freivalds-algorithm","title":"English Wikipedia article: Freivalds' algorithm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Freivalds%27+algorithm"}],"status":"reported","summary":"English Wikipedia (article \"Freivalds' algorithm\", CC BY-SA 4.0) states: Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ax-grothendieck-theorem","kind":"theory","label":"Ax–Grothendieck theorem","sources":[{"id":"wikipedia.article.ax-grothendieck-theorem","title":"English Wikipedia article: Ax–Grothendieck theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ax%E2%80%93Grothendieck+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ax–Grothendieck theorem\", CC BY-SA 4.0) states: In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ban-number","kind":"concept","label":"Ban number","sources":[{"id":"wikipedia.article.ban-number","title":"English Wikipedia article: Ban number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ban+number"}],"status":"reported","summary":"English Wikipedia (article \"Ban number\", CC BY-SA 4.0) states: In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \"banned.\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fr-chet-manifold","kind":"concept","label":"Fréchet manifold","sources":[{"id":"wikipedia.article.fr-chet-manifold","title":"English Wikipedia article: Fréchet manifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fr%C3%A9chet+manifold"}],"status":"reported","summary":"English Wikipedia (article \"Fréchet manifold\", CC BY-SA 4.0) states: In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.jacobson-bourbaki-theorem","kind":"theory","label":"Jacobson–Bourbaki theorem","sources":[{"id":"wikipedia.article.jacobson-bourbaki-theorem","title":"English Wikipedia article: Jacobson–Bourbaki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jacobson%E2%80%93Bourbaki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Jacobson–Bourbaki theorem\", CC BY-SA 4.0) states: In algebra, the Jacobson–Bourbaki theorem is a theorem used to extend Galois theory to field extensions that need not be separable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.double-suspension-theorem","kind":"theory","label":"Double suspension theorem","sources":[{"id":"wikipedia.article.double-suspension-theorem","title":"English Wikipedia article: Double suspension theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+suspension+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Double suspension theorem\", CC BY-SA 4.0) states: In geometric topology, the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","kind":"theory","label":"Gauss's lemma (Riemannian geometry)","sources":[{"id":"wikipedia.article.gauss-s-lemma-riemannian-geometry","title":"English Wikipedia article: Gauss's lemma (Riemannian geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gauss%27s+lemma+%28Riemannian+geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Gauss's lemma (Riemannian geometry)\", CC BY-SA 4.0) states: In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dirichlet-average","kind":"concept","label":"Dirichlet average","sources":[{"id":"wikipedia.article.dirichlet-average","title":"English Wikipedia article: Dirichlet average","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dirichlet+average"}],"status":"reported","summary":"English Wikipedia (article \"Dirichlet average\", CC BY-SA 4.0) states: Dirichlet averages are averages of functions under the Dirichlet distribution.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.monotone-convergence-theorem","kind":"theory","label":"Monotone convergence theorem","sources":[{"id":"wikipedia.article.monotone-convergence-theorem","title":"English Wikipedia article: Monotone convergence theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Monotone+convergence+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Monotone convergence theorem\", CC BY-SA 4.0) states: In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.church-turing-thesis","kind":"concept","label":"Church–Turing thesis","sources":[{"id":"wikipedia.article.church-turing-thesis","title":"English Wikipedia article: Church–Turing thesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Church%E2%80%93Turing+thesis"}],"status":"reported","summary":"English Wikipedia (article \"Church–Turing thesis\", CC BY-SA 4.0) states: In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.auslander-buchsbaum-theorem","kind":"theory","label":"Auslander–Buchsbaum theorem","sources":[{"id":"wikipedia.article.auslander-buchsbaum-theorem","title":"English Wikipedia article: Auslander–Buchsbaum theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Auslander%E2%80%93Buchsbaum+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Auslander–Buchsbaum theorem\", CC BY-SA 4.0) states: In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-space","kind":"concept","label":"Convex space","sources":[{"id":"wikipedia.article.convex-space","title":"English Wikipedia article: Convex space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+space"}],"status":"reported","summary":"English Wikipedia (article \"Convex space\", CC BY-SA 4.0) states: In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.b-n-pair","kind":"concept","label":"(B, N) pair","sources":[{"id":"wikipedia.article.b-n-pair","title":"English Wikipedia article: (B, N) pair","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%28B%2C+N%29+pair"}],"status":"reported","summary":"English Wikipedia (article \"(B, N) pair\", CC BY-SA 4.0) states: In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.basis-linear-algebra","kind":"concept","label":"Basis (linear algebra)","sources":[{"id":"wikipedia.article.basis-linear-algebra","title":"English Wikipedia article: Basis (linear algebra)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basis+%28linear+algebra%29"}],"status":"reported","summary":"English Wikipedia (article \"Basis (linear algebra)\", CC BY-SA 4.0) states: In mathematics, a set B of elements of a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-fibration","kind":"concept","label":"Approximate fibration","sources":[{"id":"wikipedia.article.approximate-fibration","title":"English Wikipedia article: Approximate fibration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+fibration"}],"status":"reported","summary":"English Wikipedia (article \"Approximate fibration\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alignments-of-random-points","kind":"concept","label":"Alignments of random points","sources":[{"id":"wikipedia.article.alignments-of-random-points","title":"English Wikipedia article: Alignments of random points","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alignments+of+random+points"}],"status":"reported","summary":"English Wikipedia (article \"Alignments of random points\", CC BY-SA 4.0) states: The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.commandino-s-theorem","kind":"theory","label":"Commandino's theorem","sources":[{"id":"wikipedia.article.commandino-s-theorem","title":"English Wikipedia article: Commandino's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commandino%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Commandino's theorem\", CC BY-SA 4.0) states: Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chv-tal-sankoff-constants","kind":"concept","label":"Chvátal–Sankoff constants","sources":[{"id":"wikipedia.article.chv-tal-sankoff-constants","title":"English Wikipedia article: Chvátal–Sankoff constants","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chv%C3%A1tal%E2%80%93Sankoff+constants"}],"status":"reported","summary":"English Wikipedia (article \"Chvátal–Sankoff constants\", CC BY-SA 4.0) states: In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.class-set-theory","kind":"concept","label":"Class (set theory)","sources":[{"id":"wikipedia.article.class-set-theory","title":"English Wikipedia article: Class (set theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Class+%28set+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Class (set theory)\", CC BY-SA 4.0) states: In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.applied-category-theory","kind":"field","label":"Applied category theory","sources":[{"id":"wikipedia.article.applied-category-theory","title":"English Wikipedia article: Applied category theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+category+theory"}],"status":"reported","summary":"English Wikipedia (article \"Applied category theory\", CC BY-SA 4.0) states: Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.beta-model","kind":"concept","label":"Beta-model","sources":[{"id":"wikipedia.article.beta-model","title":"English Wikipedia article: Beta-model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beta-model"}],"status":"reported","summary":"English Wikipedia (article \"Beta-model\", CC BY-SA 4.0) states: In model theory, a mathematical discipline, a β-model (from the French \"bon ordre\", well-ordering) is a model that is correct about statements of the form \"X is well-ordered\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bell-polynomials","kind":"concept","label":"Bell polynomials","sources":[{"id":"wikipedia.article.bell-polynomials","title":"English Wikipedia article: Bell polynomials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bell+polynomials"}],"status":"reported","summary":"English Wikipedia (article \"Bell polynomials\", CC BY-SA 4.0) states: In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.beatty-sequence","kind":"concept","label":"Beatty sequence","sources":[{"id":"wikipedia.article.beatty-sequence","title":"English Wikipedia article: Beatty sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beatty+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Beatty sequence\", CC BY-SA 4.0) states: In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fort-space","kind":"concept","label":"Fort space","sources":[{"id":"wikipedia.article.fort-space","title":"English Wikipedia article: Fort space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fort+space"}],"status":"reported","summary":"English Wikipedia (article \"Fort space\", CC BY-SA 4.0) states: In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.chowla-mordell-theorem","kind":"theory","label":"Chowla–Mordell theorem","sources":[{"id":"wikipedia.article.chowla-mordell-theorem","title":"English Wikipedia article: Chowla–Mordell theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chowla%E2%80%93Mordell+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Chowla–Mordell theorem\", CC BY-SA 4.0) states: In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.ehrenpreis-conjecture","kind":"question","label":"Ehrenpreis conjecture","sources":[{"id":"wikipedia.article.ehrenpreis-conjecture","title":"English Wikipedia article: Ehrenpreis conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ehrenpreis+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Ehrenpreis conjecture\", CC BY-SA 4.0) states: In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.compact-group","kind":"concept","label":"Compact group","sources":[{"id":"wikipedia.article.compact-group","title":"English Wikipedia article: Compact group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compact+group"}],"status":"reported","summary":"English Wikipedia (article \"Compact group\", CC BY-SA 4.0) states: In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cluster-algebra","kind":"concept","label":"Cluster algebra","sources":[{"id":"wikipedia.article.cluster-algebra","title":"English Wikipedia article: Cluster algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cluster+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Cluster algebra\", CC BY-SA 4.0) states: Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.charts-on-so-3","kind":"concept","label":"Charts on SO(3)","sources":[{"id":"wikipedia.article.charts-on-so-3","title":"English Wikipedia article: Charts on SO(3)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Charts+on+SO%283%29"}],"status":"reported","summary":"English Wikipedia (article \"Charts on SO(3)\", CC BY-SA 4.0) states: In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baby-step-giant-step","kind":"concept","label":"Baby-step giant-step","sources":[{"id":"wikipedia.article.baby-step-giant-step","title":"English Wikipedia article: Baby-step giant-step","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baby-step+giant-step"}],"status":"reported","summary":"English Wikipedia (article \"Baby-step giant-step\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artinian-ring","kind":"concept","label":"Artinian ring","sources":[{"id":"wikipedia.article.artinian-ring","title":"English Wikipedia article: Artinian ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artinian+ring"}],"status":"reported","summary":"English Wikipedia (article \"Artinian ring\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-sequence","kind":"concept","label":"Cauchy sequence","sources":[{"id":"wikipedia.article.cauchy-sequence","title":"English Wikipedia article: Cauchy sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy sequence\", CC BY-SA 4.0) states: In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.basis-function","kind":"concept","label":"Basis function","sources":[{"id":"wikipedia.article.basis-function","title":"English Wikipedia article: Basis function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basis+function"}],"status":"reported","summary":"English Wikipedia (article \"Basis function\", CC BY-SA 4.0) states: In mathematics, a basis function is an element of a particular basis for a function space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boundary-topology","kind":"concept","label":"Boundary (topology)","sources":[{"id":"wikipedia.article.boundary-topology","title":"English Wikipedia article: Boundary (topology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boundary+%28topology%29"}],"status":"reported","summary":"English Wikipedia (article \"Boundary (topology)\", CC BY-SA 4.0) states: In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-zeta-function","kind":"concept","label":"Arithmetic zeta function","sources":[{"id":"wikipedia.article.arithmetic-zeta-function","title":"English Wikipedia article: Arithmetic zeta function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+zeta+function"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic zeta function\", CC BY-SA 4.0) states: In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cantor-s-intersection-theorem","kind":"theory","label":"Cantor's intersection theorem","sources":[{"id":"wikipedia.article.cantor-s-intersection-theorem","title":"English Wikipedia article: Cantor's intersection theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor%27s+intersection+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cantor's intersection theorem\", CC BY-SA 4.0) states: Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bispectrum","kind":"concept","label":"Bispectrum","sources":[{"id":"wikipedia.article.bispectrum","title":"English Wikipedia article: Bispectrum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bispectrum"}],"status":"reported","summary":"English Wikipedia (article \"Bispectrum\", CC BY-SA 4.0) states: In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-markov-kernels","kind":"concept","label":"Category of Markov kernels","sources":[{"id":"wikipedia.article.category-of-markov-kernels","title":"English Wikipedia article: Category of Markov kernels","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+Markov+kernels"}],"status":"reported","summary":"English Wikipedia (article \"Category of Markov kernels\", CC BY-SA 4.0) states: In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cover-time","kind":"concept","label":"Cover time","sources":[{"id":"wikipedia.article.cover-time","title":"English Wikipedia article: Cover time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cover+time"}],"status":"reported","summary":"English Wikipedia (article \"Cover time\", CC BY-SA 4.0) states: In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bridgeland-stability-condition","kind":"concept","label":"Bridgeland stability condition","sources":[{"id":"wikipedia.article.bridgeland-stability-condition","title":"English Wikipedia article: Bridgeland stability condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridgeland+stability+condition"}],"status":"reported","summary":"English Wikipedia (article \"Bridgeland stability condition\", CC BY-SA 4.0) states: In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-grassmannian-manifold","kind":"concept","label":"Affine Grassmannian (manifold)","sources":[{"id":"wikipedia.article.affine-grassmannian-manifold","title":"English Wikipedia article: Affine Grassmannian (manifold)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+Grassmannian+%28manifold%29"}],"status":"reported","summary":"English Wikipedia (article \"Affine Grassmannian (manifold)\", CC BY-SA 4.0) states: In mathematics, there are two distinct meanings of the term affine Grassmannian.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cone-condition","kind":"concept","label":"Cone condition","sources":[{"id":"wikipedia.article.cone-condition","title":"English Wikipedia article: Cone condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cone+condition"}],"status":"reported","summary":"English Wikipedia (article \"Cone condition\", CC BY-SA 4.0) states: In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bourbaki-witt-theorem","kind":"theory","label":"Bourbaki–Witt theorem","sources":[{"id":"wikipedia.article.bourbaki-witt-theorem","title":"English Wikipedia article: Bourbaki–Witt theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bourbaki%E2%80%93Witt+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bourbaki–Witt theorem\", CC BY-SA 4.0) states: In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-principal-value","kind":"concept","label":"Cauchy principal value","sources":[{"id":"wikipedia.article.cauchy-principal-value","title":"English Wikipedia article: Cauchy principal value","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+principal+value"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy principal value\", CC BY-SA 4.0) states: In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.formal-concept-analysis","kind":"concept","label":"Formal concept analysis","sources":[{"id":"wikipedia.article.formal-concept-analysis","title":"English Wikipedia article: Formal concept analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Formal+concept+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Formal concept analysis\", CC BY-SA 4.0) states: In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-k-theory","kind":"concept","label":"Algebraic K-theory","sources":[{"id":"wikipedia.article.algebraic-k-theory","title":"English Wikipedia article: Algebraic K-theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+K-theory"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic K-theory\", CC BY-SA 4.0) states: Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-polynomial","kind":"concept","label":"Bernstein polynomial","sources":[{"id":"wikipedia.article.bernstein-polynomial","title":"English Wikipedia article: Bernstein polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein polynomial\", CC BY-SA 4.0) states: In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.decomposition-of-a-module","kind":"concept","label":"Decomposition of a module","sources":[{"id":"wikipedia.article.decomposition-of-a-module","title":"English Wikipedia article: Decomposition of a module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decomposition+of+a+module"}],"status":"reported","summary":"English Wikipedia (article \"Decomposition of a module\", CC BY-SA 4.0) states: In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.behrend-sequence","kind":"concept","label":"Behrend sequence","sources":[{"id":"wikipedia.article.behrend-sequence","title":"English Wikipedia article: Behrend sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behrend+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Behrend sequence\", CC BY-SA 4.0) states: In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.global-analysis","kind":"field","label":"Global analysis","sources":[{"id":"wikipedia.article.global-analysis","title":"English Wikipedia article: Global analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Global+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Global analysis\", CC BY-SA 4.0) states: In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.koecher-vinberg-theorem","kind":"theory","label":"Koecher–Vinberg theorem","sources":[{"id":"wikipedia.article.koecher-vinberg-theorem","title":"English Wikipedia article: Koecher–Vinberg theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Koecher%E2%80%93Vinberg+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Koecher–Vinberg theorem\", CC BY-SA 4.0) states: In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chowla-selberg-formula","kind":"concept","label":"Chowla–Selberg formula","sources":[{"id":"wikipedia.article.chowla-selberg-formula","title":"English Wikipedia article: Chowla–Selberg formula","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chowla%E2%80%93Selberg+formula"}],"status":"reported","summary":"English Wikipedia (article \"Chowla–Selberg formula\", CC BY-SA 4.0) states: In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.excision-theorem","kind":"theory","label":"Excision theorem","sources":[{"id":"wikipedia.article.excision-theorem","title":"English Wikipedia article: Excision theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Excision+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Excision theorem\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.euler-spiral","kind":"concept","label":"Euler spiral","sources":[{"id":"wikipedia.article.euler-spiral","title":"English Wikipedia article: Euler spiral","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Euler+spiral"}],"status":"reported","summary":"English Wikipedia (article \"Euler spiral\", CC BY-SA 4.0) states: An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.exponential-field","kind":"concept","label":"Exponential field","sources":[{"id":"wikipedia.article.exponential-field","title":"English Wikipedia article: Exponential field","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Exponential+field"}],"status":"reported","summary":"English Wikipedia (article \"Exponential field\", CC BY-SA 4.0) states: In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.epsilon-calculus","kind":"concept","label":"Epsilon calculus","sources":[{"id":"wikipedia.article.epsilon-calculus","title":"English Wikipedia article: Epsilon calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epsilon+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Epsilon calculus\", CC BY-SA 4.0) states: In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.harmonic-tensors","kind":"concept","label":"Harmonic tensors","sources":[{"id":"wikipedia.article.harmonic-tensors","title":"English Wikipedia article: Harmonic tensors","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+tensors"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic tensors\", CC BY-SA 4.0) states: In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baer-norm","kind":"concept","label":"Baer norm","sources":[{"id":"wikipedia.article.baer-norm","title":"English Wikipedia article: Baer norm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baer+norm"}],"status":"reported","summary":"English Wikipedia (article \"Baer norm\", CC BY-SA 4.0) states: In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.center-algebra","kind":"concept","label":"Center (algebra)","sources":[{"id":"wikipedia.article.center-algebra","title":"English Wikipedia article: Center (algebra)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Center+%28algebra%29"}],"status":"reported","summary":"English Wikipedia (article \"Center (algebra)\", CC BY-SA 4.0) states: The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.categorical-topology","kind":"field","label":"Categorical topology","sources":[{"id":"wikipedia.article.categorical-topology","title":"English Wikipedia article: Categorical topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Categorical+topology"}],"status":"reported","summary":"English Wikipedia (article \"Categorical topology\", CC BY-SA 4.0) states: In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-measurable-spaces","kind":"concept","label":"Category of measurable spaces","sources":[{"id":"wikipedia.article.category-of-measurable-spaces","title":"English Wikipedia article: Category of measurable spaces","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+measurable+spaces"}],"status":"reported","summary":"English Wikipedia (article \"Category of measurable spaces\", CC BY-SA 4.0) states: In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cubicity","kind":"concept","label":"Cubicity","sources":[{"id":"wikipedia.article.cubicity","title":"English Wikipedia article: Cubicity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cubicity"}],"status":"reported","summary":"English Wikipedia (article \"Cubicity\", CC BY-SA 4.0) states: In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-sphere","kind":"concept","label":"Affine sphere","sources":[{"id":"wikipedia.article.affine-sphere","title":"English Wikipedia article: Affine sphere","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+sphere"}],"status":"reported","summary":"English Wikipedia (article \"Affine sphere\", CC BY-SA 4.0) states: In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bruhat-order","kind":"concept","label":"Bruhat order","sources":[{"id":"wikipedia.article.bruhat-order","title":"English Wikipedia article: Bruhat order","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bruhat+order"}],"status":"reported","summary":"English Wikipedia (article \"Bruhat order\", CC BY-SA 4.0) states: In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","kind":"concept","label":"Brouwer–Heyting–Kolmogorov interpretation","sources":[{"id":"wikipedia.article.brouwer-heyting-kolmogorov-interpretation","title":"English Wikipedia article: Brouwer–Heyting–Kolmogorov interpretation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brouwer%E2%80%93Heyting%E2%80%93Kolmogorov+interpretation"}],"status":"reported","summary":"English Wikipedia (article \"Brouwer–Heyting–Kolmogorov interpretation\", CC BY-SA 4.0) states: In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.free-lattice","kind":"concept","label":"Free lattice","sources":[{"id":"wikipedia.article.free-lattice","title":"English Wikipedia article: Free lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Free+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Free lattice\", CC BY-SA 4.0) states: In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bogdanov-map","kind":"concept","label":"Bogdanov map","sources":[{"id":"wikipedia.article.bogdanov-map","title":"English Wikipedia article: Bogdanov map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bogdanov+map"}],"status":"reported","summary":"English Wikipedia (article \"Bogdanov map\", CC BY-SA 4.0) states: In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-s-constant","kind":"concept","label":"Bernstein's constant","sources":[{"id":"wikipedia.article.bernstein-s-constant","title":"English Wikipedia article: Bernstein's constant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein%27s+constant"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein's constant\", CC BY-SA 4.0) states: Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.hadamard-product-matrices","kind":"concept","label":"Hadamard product (matrices)","sources":[{"id":"wikipedia.article.hadamard-product-matrices","title":"English Wikipedia article: Hadamard product (matrices)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hadamard+product+%28matrices%29"}],"status":"reported","summary":"English Wikipedia (article \"Hadamard product (matrices)\", CC BY-SA 4.0) states: In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-sato-polynomial","kind":"concept","label":"Bernstein–Sato polynomial","sources":[{"id":"wikipedia.article.bernstein-sato-polynomial","title":"English Wikipedia article: Bernstein–Sato polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein%E2%80%93Sato+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein–Sato polynomial\", CC BY-SA 4.0) states: In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.geometric-topology-object","kind":"concept","label":"Geometric topology (object)","sources":[{"id":"wikipedia.article.geometric-topology-object","title":"English Wikipedia article: Geometric topology (object)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+topology+%28object%29"}],"status":"reported","summary":"English Wikipedia (article \"Geometric topology (object)\", CC BY-SA 4.0) states: In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.krull-akizuki-theorem","kind":"theory","label":"Krull–Akizuki theorem","sources":[{"id":"wikipedia.article.krull-akizuki-theorem","title":"English Wikipedia article: Krull–Akizuki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Krull%E2%80%93Akizuki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Krull–Akizuki theorem\", CC BY-SA 4.0) states: In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.f-ry-milnor-theorem","kind":"theory","label":"Fáry–Milnor theorem","sources":[{"id":"wikipedia.article.f-ry-milnor-theorem","title":"English Wikipedia article: Fáry–Milnor theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=F%C3%A1ry%E2%80%93Milnor+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Fáry–Milnor theorem\", CC BY-SA 4.0) states: In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hua-s-lemma","kind":"theory","label":"Hua's lemma","sources":[{"id":"wikipedia.article.hua-s-lemma","title":"English Wikipedia article: Hua's lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hua%27s+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Hua's lemma\", CC BY-SA 4.0) states: In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.first-order-logic","kind":"concept","label":"First-order logic","sources":[{"id":"wikipedia.article.first-order-logic","title":"English Wikipedia article: First-order logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=First-order+logic"}],"status":"reported","summary":"English Wikipedia (article \"First-order logic\", CC BY-SA 4.0) states: In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fast-growing-hierarchy","kind":"concept","label":"Fast-growing hierarchy","sources":[{"id":"wikipedia.article.fast-growing-hierarchy","title":"English Wikipedia article: Fast-growing hierarchy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fast-growing+hierarchy"}],"status":"reported","summary":"English Wikipedia (article \"Fast-growing hierarchy\", CC BY-SA 4.0) states: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.delta-functor","kind":"concept","label":"Delta-functor","sources":[{"id":"wikipedia.article.delta-functor","title":"English Wikipedia article: Delta-functor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Delta-functor"}],"status":"reported","summary":"English Wikipedia (article \"Delta-functor\", CC BY-SA 4.0) states: In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.classical-group","kind":"concept","label":"Classical group","sources":[{"id":"wikipedia.article.classical-group","title":"English Wikipedia article: Classical group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Classical+group"}],"status":"reported","summary":"English Wikipedia (article \"Classical group\", CC BY-SA 4.0) states: In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dual-cone-and-polar-cone","kind":"concept","label":"Dual cone and polar cone","sources":[{"id":"wikipedia.article.dual-cone-and-polar-cone","title":"English Wikipedia article: Dual cone and polar cone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dual+cone+and+polar+cone"}],"status":"reported","summary":"English Wikipedia (article \"Dual cone and polar cone\", CC BY-SA 4.0) states: Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.closure-mathematics","kind":"concept","label":"Closure (mathematics)","sources":[{"id":"wikipedia.article.closure-mathematics","title":"English Wikipedia article: Closure (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closure+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Closure (mathematics)\", CC BY-SA 4.0) states: In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.big-m-method","kind":"concept","label":"Big M method","sources":[{"id":"wikipedia.article.big-m-method","title":"English Wikipedia article: Big M method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big+M+method"}],"status":"reported","summary":"English Wikipedia (article \"Big M method\", CC BY-SA 4.0) states: In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.barycentric-subdivision","kind":"concept","label":"Barycentric subdivision","sources":[{"id":"wikipedia.article.barycentric-subdivision","title":"English Wikipedia article: Barycentric subdivision","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barycentric+subdivision"}],"status":"reported","summary":"English Wikipedia (article \"Barycentric subdivision\", CC BY-SA 4.0) states: In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-product","kind":"concept","label":"Cauchy product","sources":[{"id":"wikipedia.article.cauchy-product","title":"English Wikipedia article: Cauchy product","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+product"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy product\", CC BY-SA 4.0) states: In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandrov-space","kind":"concept","label":"Alexandrov space","sources":[{"id":"wikipedia.article.alexandrov-space","title":"English Wikipedia article: Alexandrov space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandrov+space"}],"status":"reported","summary":"English Wikipedia (article \"Alexandrov space\", CC BY-SA 4.0) states: In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.constant-chord-theorem","kind":"theory","label":"Constant chord theorem","sources":[{"id":"wikipedia.article.constant-chord-theorem","title":"English Wikipedia article: Constant chord theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constant+chord+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Constant chord theorem\", CC BY-SA 4.0) states: The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.collectively-exhaustive-events","kind":"concept","label":"Collectively exhaustive events","sources":[{"id":"wikipedia.article.collectively-exhaustive-events","title":"English Wikipedia article: Collectively exhaustive events","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Collectively+exhaustive+events"}],"status":"reported","summary":"English Wikipedia (article \"Collectively exhaustive events\", CC BY-SA 4.0) states: In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cantor-bernstein-theorem","kind":"theory","label":"Cantor–Bernstein theorem","sources":[{"id":"wikipedia.article.cantor-bernstein-theorem","title":"English Wikipedia article: Cantor–Bernstein theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor%E2%80%93Bernstein+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cantor–Bernstein theorem\", CC BY-SA 4.0) states: In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","kind":"theory","label":"Büchi–Elgot–Trakhtenbrot theorem","sources":[{"id":"wikipedia.article.b-chi-elgot-trakhtenbrot-theorem","title":"English Wikipedia article: Büchi–Elgot–Trakhtenbrot theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=B%C3%BCchi%E2%80%93Elgot%E2%80%93Trakhtenbrot+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Büchi–Elgot–Trakhtenbrot theorem\", CC BY-SA 4.0) states: In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","tags":[]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42853148","kind":"claim","label":"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.pmid-42853148"]},"sources":[{"id":"source.frontier.pmid-42853148","title":"Europe PMC record PMID 42853148: IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42853148%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.70962/jhi.20260069","title":"doi:10.70962/jhi.20260069","url":"https://doi.org/10.70962/jhi.20260069"}],"status":"frontier","summary":"PMID 42853148 \"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes\" (CC BY, first published 2026-10-09) reports: \"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42842684","kind":"claim","label":"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-07","source_ids":["source.frontier.pmid-42842684"]},"sources":[{"id":"source.frontier.pmid-42842684","title":"Europe PMC record PMID 42842684: Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42842684%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1126/sciadv.aeb5514","title":"doi:10.1126/sciadv.aeb5514","url":"https://doi.org/10.1126/sciadv.aeb5514"}],"status":"frontier","summary":"PMID 42842684 \"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>\" (CC BY, first published 2026-10-07) reports: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42829444","kind":"claim","label":"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-04","source_ids":["source.frontier.pmid-42829444"]},"sources":[{"id":"source.frontier.pmid-42829444","title":"Europe PMC record PMID 42829444: Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infecti","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42829444%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s40104-026-01502-y","title":"doi:10.1186/s40104-026-01502-y","url":"https://doi.org/10.1186/s40104-026-01502-y"}],"status":"frontier","summary":"PMID 42829444 \"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection\" (CC BY, first published 2026-10-04) reports: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827305","kind":"claim","label":"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42827305"]},"sources":[{"id":"source.frontier.pmid-42827305","title":"Europe PMC record PMID 42827305: Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827305%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70554","title":"doi:10.1111/mec.70554","url":"https://doi.org/10.1111/mec.70554"}],"status":"frontier","summary":"PMID 42827305 \"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties\" (CC BY, first published 2026-10-01) reports: \"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42826334","kind":"claim","label":"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42826334"]},"sources":[{"id":"source.frontier.pmid-42826334","title":"Europe PMC record PMID 42826334: Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42826334%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050807","title":"doi:10.1097/md.0000000000050807","url":"https://doi.org/10.1097/md.0000000000050807"}],"status":"frontier","summary":"PMID 42826334 \"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study\" (CC BY, first published 2026-10-01) reports: \"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821620","kind":"claim","label":"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821620"]},"sources":[{"id":"source.frontier.pmid-42821620","title":"Europe PMC record PMID 42821620: Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821620%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014104","title":"doi:10.1371/journal.pntd.0014104","url":"https://doi.org/10.1371/journal.pntd.0014104"}],"status":"frontier","summary":"PMID 42821620 \"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2\" (CC BY, first published 2026-10-01) reports: \"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821607","kind":"claim","label":"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821607"]},"sources":[{"id":"source.frontier.pmid-42821607","title":"Europe PMC record PMID 42821607: Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821607%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358972","title":"doi:10.1371/journal.pone.0358972","url":"https://doi.org/10.1371/journal.pone.0358972"}],"status":"frontier","summary":"PMID 42821607 \"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network\" (CC BY, first published 2026-10-01) reports: \"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821558","kind":"claim","label":"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821558"]},"sources":[{"id":"source.frontier.pmid-42821558","title":"Europe PMC record PMID 42821558: Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821558%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0332281","title":"doi:10.1371/journal.pone.0332281","url":"https://doi.org/10.1371/journal.pone.0332281"}],"status":"frontier","summary":"PMID 42821558 \"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors\" (CC BY, first published 2026-10-01) reports: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42809586","kind":"claim","label":"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42809586"]},"sources":[{"id":"source.frontier.pmid-42809586","title":"Europe PMC record PMID 42809586: Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42809586%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/cbic.70557","title":"doi:10.1002/cbic.70557","url":"https://doi.org/10.1002/cbic.70557"}],"status":"frontier","summary":"PMID 42809586 \"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling\" (CC BY, first published 2026-10-01) reports: \"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42806681","kind":"claim","label":"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42806681"]},"sources":[{"id":"source.frontier.pmid-42806681","title":"Europe PMC record PMID 42806681: Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806681%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jmv.71163","title":"doi:10.1002/jmv.71163","url":"https://doi.org/10.1002/jmv.71163"}],"status":"frontier","summary":"PMID 42806681 \"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients\" (CC BY, first published 2026-10-01) reports: \"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42806242","kind":"claim","label":"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42806242"]},"sources":[{"id":"source.frontier.pmid-42806242","title":"Europe PMC record PMID 42806242: Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806242%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70565","title":"doi:10.1111/mec.70565","url":"https://doi.org/10.1111/mec.70565"}],"status":"frontier","summary":"PMID 42806242 \"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback\" (CC BY, first published 2026-10-01) reports: \"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755230","kind":"claim","label":"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42755230"]},"sources":[{"id":"source.frontier.pmid-42755230","title":"Europe PMC record PMID 42755230: Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755230%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/molbev/msag239","title":"doi:10.1093/molbev/msag239","url":"https://doi.org/10.1093/molbev/msag239"}],"status":"frontier","summary":"PMID 42755230 \"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges\" (CC BY, first published 2026-10-01) reports: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42814760","kind":"claim","label":"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.pmid-42814760"]},"sources":[{"id":"source.frontier.pmid-42814760","title":"Europe PMC record PMID 42814760: Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814760%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/93032","title":"doi:10.2196/93032","url":"https://doi.org/10.2196/93032"}],"status":"frontier","summary":"PMID 42814760 \"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study\" (CC BY, first published 2026-09-30) reports: \"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42814704","kind":"claim","label":"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.pmid-42814704"]},"sources":[{"id":"source.frontier.pmid-42814704","title":"Europe PMC record PMID 42814704: Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814704%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357824","title":"doi:10.1371/journal.pone.0357824","url":"https://doi.org/10.1371/journal.pone.0357824"}],"status":"frontier","summary":"PMID 42814704 \"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study\" (CC BY, first published 2026-09-30) reports: \"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42811346","kind":"claim","label":"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.pmid-42811346"]},"sources":[{"id":"source.frontier.pmid-42811346","title":"Europe PMC record PMID 42811346: Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811346%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s41927-026-00698-w","title":"doi:10.1186/s41927-026-00698-w","url":"https://doi.org/10.1186/s41927-026-00698-w"}],"status":"frontier","summary":"PMID 42811346 \"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis\" (CC BY, first published 2026-09-29) reports: \"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42811130","kind":"claim","label":"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.pmid-42811130"]},"sources":[{"id":"source.frontier.pmid-42811130","title":"Europe PMC record PMID 42811130: Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811130%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41559-026-03171-6","title":"doi:10.1038/s41559-026-03171-6","url":"https://doi.org/10.1038/s41559-026-03171-6"}],"status":"frontier","summary":"PMID 42811130 \"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids\" (CC BY, first published 2026-09-29) reports: \"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760912","kind":"claim","label":"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.pmid-42760912"]},"sources":[{"id":"source.frontier.pmid-42760912","title":"Europe PMC record PMID 42760912: The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760912%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.188625.2","title":"doi:10.12688/f1000research.188625.2","url":"https://doi.org/10.12688/f1000research.188625.2"}],"status":"frontier","summary":"PMID 42760912 \"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations\" (CC BY, first published 2026-09-28) reports: \"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799489","kind":"claim","label":"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42799489"]},"sources":[{"id":"source.frontier.pmid-42799489","title":"Europe PMC record PMID 42799489: Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799489%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crdi/8016755","title":"doi:10.1155/crdi/8016755","url":"https://doi.org/10.1155/crdi/8016755"}],"status":"frontier","summary":"PMID 42799489 \"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review\" (CC BY, first published 2026-09-25) reports: \"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42791331","kind":"claim","label":"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42791331"]},"sources":[{"id":"source.frontier.pmid-42791331","title":"Europe PMC record PMID 42791331: Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791331%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s43856-026-01923-w","title":"doi:10.1038/s43856-026-01923-w","url":"https://doi.org/10.1038/s43856-026-01923-w"}],"status":"frontier","summary":"PMID 42791331 \"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort\" (CC BY, first published 2026-09-25) reports: \"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42789524","kind":"claim","label":"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42789524"]},"sources":[{"id":"source.frontier.pmid-42789524","title":"Europe PMC record PMID 42789524: Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789524%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358956","title":"doi:10.1371/journal.pone.0358956","url":"https://doi.org/10.1371/journal.pone.0358956"}],"status":"frontier","summary":"PMID 42789524 \"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study\" (CC BY, first published 2026-09-25) reports: \"Problem-focused and emotion-focused coping strategies were associated with better QoL.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42789505","kind":"claim","label":"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42789505"]},"sources":[{"id":"source.frontier.pmid-42789505","title":"Europe PMC record PMID 42789505: Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789505%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358890","title":"doi:10.1371/journal.pone.0358890","url":"https://doi.org/10.1371/journal.pone.0358890"}],"status":"frontier","summary":"PMID 42789505 \"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system\" (CC BY, first published 2026-09-25) reports: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784649","kind":"claim","label":"Negative emotions concentrate while positive emotions diffuse in football fan rivalries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.pmid-42784649"]},"sources":[{"id":"source.frontier.pmid-42784649","title":"Europe PMC record PMID 42784649: Negative emotions concentrate while positive emotions diffuse in football fan rivalries","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784649%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356757","title":"doi:10.1371/journal.pone.0356757","url":"https://doi.org/10.1371/journal.pone.0356757"}],"status":"frontier","summary":"PMID 42784649 \"Negative emotions concentrate while positive emotions diffuse in football fan rivalries\" (CC BY, first published 2026-09-24) reports: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784570","kind":"claim","label":"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.pmid-42784570"]},"sources":[{"id":"source.frontier.pmid-42784570","title":"Europe PMC record PMID 42784570: Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Et","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784570%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pdig.0001748","title":"doi:10.1371/journal.pdig.0001748","url":"https://doi.org/10.1371/journal.pdig.0001748"}],"status":"frontier","summary":"PMID 42784570 \"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia\" (CC BY, first published 2026-09-24) reports: \"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778666","kind":"claim","label":"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42778666"]},"sources":[{"id":"source.frontier.pmid-42778666","title":"Europe PMC record PMID 42778666: Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778666%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s42003-026-10927-0","title":"doi:10.1038/s42003-026-10927-0","url":"https://doi.org/10.1038/s42003-026-10927-0"}],"status":"frontier","summary":"PMID 42778666 \"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils\" (CC BY, first published 2026-09-23) reports: \"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778332","kind":"claim","label":"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42778332"]},"sources":[{"id":"source.frontier.pmid-42778332","title":"Europe PMC record PMID 42778332: Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778332%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/rmdopen-2026-007162","title":"doi:10.1136/rmdopen-2026-007162","url":"https://doi.org/10.1136/rmdopen-2026-007162"}],"status":"frontier","summary":"PMID 42778332 \"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual\" (CC BY, first published 2026-09-23) reports: \"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42777016","kind":"claim","label":"Deterministic dynamics of distributional multi-agent reinforcement learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42777016"]},"sources":[{"id":"source.frontier.pmid-42777016","title":"Europe PMC record PMID 42777016: Deterministic dynamics of distributional multi-agent reinforcement learning","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42777016%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014723","title":"doi:10.1371/journal.pcbi.1014723","url":"https://doi.org/10.1371/journal.pcbi.1014723"}],"status":"frontier","summary":"PMID 42777016 \"Deterministic dynamics of distributional multi-agent reinforcement learning\" (CC BY, first published 2026-09-23) reports: \"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42773366","kind":"claim","label":"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42773366"]},"sources":[{"id":"source.frontier.pmid-42773366","title":"Europe PMC record PMID 42773366: ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42773366%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s10802-026-01510-6","title":"doi:10.1007/s10802-026-01510-6","url":"https://doi.org/10.1007/s10802-026-01510-6"}],"status":"frontier","summary":"PMID 42773366 \"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)\" (CC BY, first published 2026-09-23) reports: \"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794852","kind":"claim","label":"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42794852"]},"sources":[{"id":"source.frontier.pmid-42794852","title":"Europe PMC record PMID 42794852: Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794852%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27188426","title":"doi:10.3390/ijms27188426","url":"https://doi.org/10.3390/ijms27188426"}],"status":"frontier","summary":"PMID 42794852 \"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology\" (CC BY, first published 2026-09-21) reports: \"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792502","kind":"claim","label":"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42792502"]},"sources":[{"id":"source.frontier.pmid-42792502","title":"Europe PMC record PMID 42792502: Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792502%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091703","title":"doi:10.3390/bs16091703","url":"https://doi.org/10.3390/bs16091703"}],"status":"frontier","summary":"PMID 42792502 \"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students\" (CC BY, first published 2026-09-21) reports: \"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766660","kind":"claim","label":"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766660"]},"sources":[{"id":"source.frontier.pmid-42766660","title":"Europe PMC record PMID 42766660: The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766660%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014807","title":"doi:10.1371/journal.pcbi.1014807","url":"https://doi.org/10.1371/journal.pcbi.1014807"}],"status":"frontier","summary":"PMID 42766660 \"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart\" (CC BY, first published 2026-09-21) reports: \"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766622","kind":"claim","label":"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766622"]},"sources":[{"id":"source.frontier.pmid-42766622","title":"Europe PMC record PMID 42766622: Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766622%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356518","title":"doi:10.1371/journal.pone.0356518","url":"https://doi.org/10.1371/journal.pone.0356518"}],"status":"frontier","summary":"PMID 42766622 \"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model\" (CC BY, first published 2026-09-21) reports: \"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766584","kind":"claim","label":"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766584"]},"sources":[{"id":"source.frontier.pmid-42766584","title":"Europe PMC record PMID 42766584: Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766584%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356632","title":"doi:10.1371/journal.pone.0356632","url":"https://doi.org/10.1371/journal.pone.0356632"}],"status":"frontier","summary":"PMID 42766584 \"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database\" (CC BY, first published 2026-09-21) reports: \"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766546","kind":"claim","label":"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766546"]},"sources":[{"id":"source.frontier.pmid-42766546","title":"Europe PMC record PMID 42766546: Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358539","title":"doi:10.1371/journal.pone.0358539","url":"https://doi.org/10.1371/journal.pone.0358539"}],"status":"frontier","summary":"PMID 42766546 \"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry\" (CC BY, first published 2026-09-21) reports: \"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764320","kind":"claim","label":"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42764320"]},"sources":[{"id":"source.frontier.pmid-42764320","title":"Europe PMC record PMID 42764320: Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764320%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s10143-026-04441-4","title":"doi:10.1007/s10143-026-04441-4","url":"https://doi.org/10.1007/s10143-026-04441-4"}],"status":"frontier","summary":"PMID 42764320 \"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned\" (CC BY, first published 2026-09-21) reports: \"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796055","kind":"claim","label":"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.pmid-42796055"]},"sources":[{"id":"source.frontier.pmid-42796055","title":"Europe PMC record PMID 42796055: Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Im","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796055%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187283","title":"doi:10.3390/jcm15187283","url":"https://doi.org/10.3390/jcm15187283"}],"status":"frontier","summary":"PMID 42796055 \"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention\" (CC BY, first published 2026-09-19) reports: \"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42762163","kind":"claim","label":"A network dynamical simulation model for the study of antibiotic resistance in microbial communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.pmid-42762163"]},"sources":[{"id":"source.frontier.pmid-42762163","title":"Europe PMC record PMID 42762163: A network dynamical simulation model for the study of antibiotic resistance in microbial communities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42762163%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/19490976.2026.2734703","title":"doi:10.1080/19490976.2026.2734703","url":"https://doi.org/10.1080/19490976.2026.2734703"}],"status":"frontier","summary":"PMID 42762163 \"A network dynamical simulation model for the study of antibiotic resistance in microbial communities\" (CC BY, first published 2026-09-19) reports: \"Our results show that network structure strongly modulates resistance dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827649","kind":"claim","label":"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42827649"]},"sources":[{"id":"source.frontier.pmid-42827649","title":"Europe PMC record PMID 42827649: Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827649%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1845909","title":"doi:10.3389/fneur.2026.1845909","url":"https://doi.org/10.3389/fneur.2026.1845909"}],"status":"frontier","summary":"PMID 42827649 \"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke\" (CC BY, first published 2026-09-18) reports: \"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827524","kind":"claim","label":"Impression management in distributive justice: balancing fairness and social perception","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42827524"]},"sources":[{"id":"source.frontier.pmid-42827524","title":"Europe PMC record PMID 42827524: Impression management in distributive justice: balancing fairness and social perception","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827524%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1848060","title":"doi:10.3389/fpsyg.2026.1848060","url":"https://doi.org/10.3389/fpsyg.2026.1848060"}],"status":"frontier","summary":"PMID 42827524 \"Impression management in distributive justice: balancing fairness and social perception\" (CC BY, first published 2026-09-18) reports: \"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42797642","kind":"claim","label":"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42797642"]},"sources":[{"id":"source.frontier.pmid-42797642","title":"Europe PMC record PMID 42797642: Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42797642%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/vaccines14090822","title":"doi:10.3390/vaccines14090822","url":"https://doi.org/10.3390/vaccines14090822"}],"status":"frontier","summary":"PMID 42797642 \"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?\" (CC BY, first published 2026-09-18) reports: \": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42788599","kind":"claim","label":"Septic arthritis caused by Nocardia asiatica: a case report and narrative review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42788599"]},"sources":[{"id":"source.frontier.pmid-42788599","title":"Europe PMC record PMID 42788599: Septic arthritis caused by Nocardia asiatica: a case report and narrative review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42788599%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1590/s1678-9946202668062","title":"doi:10.1590/s1678-9946202668062","url":"https://doi.org/10.1590/s1678-9946202668062"}],"status":"frontier","summary":"PMID 42788599 \"Septic arthritis caused by Nocardia asiatica: a case report and narrative review\" (CC BY, first published 2026-09-18) reports: \"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763478","kind":"claim","label":"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42763478"]},"sources":[{"id":"source.frontier.pmid-42763478","title":"Europe PMC record PMID 42763478: Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763478%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s12144-026-09895-9","title":"doi:10.1007/s12144-026-09895-9","url":"https://doi.org/10.1007/s12144-026-09895-9"}],"status":"frontier","summary":"PMID 42763478 \"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic\" (CC BY, first published 2026-09-18) reports: \"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761607","kind":"claim","label":"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42761607"]},"sources":[{"id":"source.frontier.pmid-42761607","title":"Europe PMC record PMID 42761607: Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761607%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crin/3992146","title":"doi:10.1155/crin/3992146","url":"https://doi.org/10.1155/crin/3992146"}],"status":"frontier","summary":"PMID 42761607 \"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia\" (CC BY, first published 2026-09-18) reports: \"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760564","kind":"claim","label":"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42760564"]},"sources":[{"id":"source.frontier.pmid-42760564","title":"Europe PMC record PMID 42760564: Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760564%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13256-026-06579-7","title":"doi:10.1186/s13256-026-06579-7","url":"https://doi.org/10.1186/s13256-026-06579-7"}],"status":"frontier","summary":"PMID 42760564 \"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report\" (CC BY, first published 2026-09-18) reports: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42758776","kind":"claim","label":"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42758776"]},"sources":[{"id":"source.frontier.pmid-42758776","title":"Europe PMC record PMID 42758776: The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758776%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0350972","title":"doi:10.1371/journal.pone.0350972","url":"https://doi.org/10.1371/journal.pone.0350972"}],"status":"frontier","summary":"PMID 42758776 \"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province\" (CC BY, first published 2026-09-18) reports: \"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42758734","kind":"claim","label":"A data-driven comparative analysis on citation intents across scientific disciplines","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42758734"]},"sources":[{"id":"source.frontier.pmid-42758734","title":"Europe PMC record PMID 42758734: A data-driven comparative analysis on citation intents across scientific disciplines","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758734%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358327","title":"doi:10.1371/journal.pone.0358327","url":"https://doi.org/10.1371/journal.pone.0358327"}],"status":"frontier","summary":"PMID 42758734 \"A data-driven comparative analysis on citation intents across scientific disciplines\" (CC BY, first published 2026-09-18) reports: \"We found out that there are significant differences in all five characteristics across different research disciplines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824361","kind":"claim","label":"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824361"]},"sources":[{"id":"source.frontier.pmid-42824361","title":"Europe PMC record PMID 42824361: Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824361%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1935888","title":"doi:10.3389/fneur.2026.1935888","url":"https://doi.org/10.3389/fneur.2026.1935888"}],"status":"frontier","summary":"PMID 42824361 \"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study\" (CC BY, first published 2026-09-17) reports: \"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824182","kind":"claim","label":"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824182"]},"sources":[{"id":"source.frontier.pmid-42824182","title":"Europe PMC record PMID 42824182: A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824182%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fspor.2026.1913798","title":"doi:10.3389/fspor.2026.1913798","url":"https://doi.org/10.3389/fspor.2026.1913798"}],"status":"frontier","summary":"PMID 42824182 \"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence\" (CC BY, first published 2026-09-17) reports: \"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824079","kind":"claim","label":"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824079"]},"sources":[{"id":"source.frontier.pmid-42824079","title":"Europe PMC record PMID 42824079: Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824079%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1856345","title":"doi:10.3389/fpsyg.2026.1856345","url":"https://doi.org/10.3389/fpsyg.2026.1856345"}],"status":"frontier","summary":"PMID 42824079 \"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education\" (CC BY, first published 2026-09-17) reports: \"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42823984","kind":"claim","label":"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42823984"]},"sources":[{"id":"source.frontier.pmid-42823984","title":"Europe PMC record PMID 42823984: Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823984%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1901929","title":"doi:10.3389/fpsyg.2026.1901929","url":"https://doi.org/10.3389/fpsyg.2026.1901929"}],"status":"frontier","summary":"PMID 42823984 \"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment\" (CC BY, first published 2026-09-17) reports: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42813109","kind":"claim","label":"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42813109"]},"sources":[{"id":"source.frontier.pmid-42813109","title":"Europe PMC record PMID 42813109: The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42813109%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/pnasnexus/pgag314","title":"doi:10.1093/pnasnexus/pgag314","url":"https://doi.org/10.1093/pnasnexus/pgag314"}],"status":"frontier","summary":"PMID 42813109 \"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis\" (CC BY, first published 2026-09-17) reports: \"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796013","kind":"claim","label":"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42796013"]},"sources":[{"id":"source.frontier.pmid-42796013","title":"Europe PMC record PMID 42796013: Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicen","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796013%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187241","title":"doi:10.3390/jcm15187241","url":"https://doi.org/10.3390/jcm15187241"}],"status":"frontier","summary":"PMID 42796013 \"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study\" (CC BY, first published 2026-09-17) reports: \": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42757005","kind":"claim","label":"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42757005"]},"sources":[{"id":"source.frontier.pmid-42757005","title":"Europe PMC record PMID 42757005: Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757005%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.14309/crj.0000000000002296","title":"doi:10.14309/crj.0000000000002296","url":"https://doi.org/10.14309/crj.0000000000002296"}],"status":"frontier","summary":"PMID 42757005 \"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge\" (CC BY, first published 2026-09-17) reports: \"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42752632","kind":"claim","label":"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42752632"]},"sources":[{"id":"source.frontier.pmid-42752632","title":"Europe PMC record PMID 42752632: A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42752632%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356524","title":"doi:10.1371/journal.pone.0356524","url":"https://doi.org/10.1371/journal.pone.0356524"}],"status":"frontier","summary":"PMID 42752632 \"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital\" (CC BY, first published 2026-09-17) reports: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795965","kind":"claim","label":"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42795965"]},"sources":[{"id":"source.frontier.pmid-42795965","title":"Europe PMC record PMID 42795965: Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795965%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187193","title":"doi:10.3390/jcm15187193","url":"https://doi.org/10.3390/jcm15187193"}],"status":"frontier","summary":"PMID 42795965 \"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study\" (CC BY, first published 2026-09-16) reports: \"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795646","kind":"claim","label":"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42795646"]},"sources":[{"id":"source.frontier.pmid-42795646","title":"Europe PMC record PMID 42795646: Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795646%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/microorganisms14092065","title":"doi:10.3390/microorganisms14092065","url":"https://doi.org/10.3390/microorganisms14092065"}],"status":"frontier","summary":"PMID 42795646 \"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes\" (CC BY, first published 2026-09-16) reports: \"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794677","kind":"claim","label":"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42794677"]},"sources":[{"id":"source.frontier.pmid-42794677","title":"Europe PMC record PMID 42794677: Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular M","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794677%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27188246","title":"doi:10.3390/ijms27188246","url":"https://doi.org/10.3390/ijms27188246"}],"status":"frontier","summary":"PMID 42794677 \"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling\" (CC BY, first published 2026-09-16) reports: \"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42750388","kind":"claim","label":"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42750388"]},"sources":[{"id":"source.frontier.pmid-42750388","title":"Europe PMC record PMID 42750388: Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42750388%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jcla.70323","title":"doi:10.1002/jcla.70323","url":"https://doi.org/10.1002/jcla.70323"}],"status":"frontier","summary":"PMID 42750388 \"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation\" (CC BY, first published 2026-09-16) reports: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42749366","kind":"claim","label":"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42749366"]},"sources":[{"id":"source.frontier.pmid-42749366","title":"Europe PMC record PMID 42749366: Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a no","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749366%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/bmjopen-2026-117886","title":"doi:10.1136/bmjopen-2026-117886","url":"https://doi.org/10.1136/bmjopen-2026-117886"}],"status":"frontier","summary":"PMID 42749366 \"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study\" (CC BY, first published 2026-09-16) reports: \"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748195","kind":"claim","label":"Mathematical skills in deaf and hard-of-hearing children: A systematic review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748195"]},"sources":[{"id":"source.frontier.pmid-42748195","title":"Europe PMC record PMID 42748195: Mathematical skills in deaf and hard-of-hearing children: A systematic review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748195%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358324","title":"doi:10.1371/journal.pone.0358324","url":"https://doi.org/10.1371/journal.pone.0358324"}],"status":"frontier","summary":"PMID 42748195 \"Mathematical skills in deaf and hard-of-hearing children: A systematic review\" (CC BY, first published 2026-09-16) reports: \"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748135","kind":"claim","label":"Bacterial stress responses lower mRNA-protein level correlations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748135"]},"sources":[{"id":"source.frontier.pmid-42748135","title":"Europe PMC record PMID 42748135: Bacterial stress responses lower mRNA-protein level correlations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748135%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1073/pnas.2613102123","title":"doi:10.1073/pnas.2613102123","url":"https://doi.org/10.1073/pnas.2613102123"}],"status":"frontier","summary":"PMID 42748135 \"Bacterial stress responses lower mRNA-protein level correlations\" (CC BY, first published 2026-09-16) reports: \"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748115","kind":"claim","label":"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748115"]},"sources":[{"id":"source.frontier.pmid-42748115","title":"Europe PMC record PMID 42748115: Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748115%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357562","title":"doi:10.1371/journal.pone.0357562","url":"https://doi.org/10.1371/journal.pone.0357562"}],"status":"frontier","summary":"PMID 42748115 \"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement\" (CC BY, first published 2026-09-16) reports: \"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748081","kind":"claim","label":"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748081"]},"sources":[{"id":"source.frontier.pmid-42748081","title":"Europe PMC record PMID 42748081: Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748081%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0351523","title":"doi:10.1371/journal.pone.0351523","url":"https://doi.org/10.1371/journal.pone.0351523"}],"status":"frontier","summary":"PMID 42748081 \"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement\" (CC BY, first published 2026-09-16) reports: \"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748079","kind":"claim","label":"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748079"]},"sources":[{"id":"source.frontier.pmid-42748079","title":"Europe PMC record PMID 42748079: Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748079%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355860","title":"doi:10.1371/journal.pone.0355860","url":"https://doi.org/10.1371/journal.pone.0355860"}],"status":"frontier","summary":"PMID 42748079 \"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise\" (CC BY, first published 2026-09-16) reports: \"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42812171","kind":"claim","label":"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42812171"]},"sources":[{"id":"source.frontier.pmid-42812171","title":"Europe PMC record PMID 42812171: Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42812171%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1931802","title":"doi:10.3389/fonc.2026.1931802","url":"https://doi.org/10.3389/fonc.2026.1931802"}],"status":"frontier","summary":"PMID 42812171 \"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report\" (CC BY, first published 2026-09-15) reports: \"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795945","kind":"claim","label":"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42795945"]},"sources":[{"id":"source.frontier.pmid-42795945","title":"Europe PMC record PMID 42795945: Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract In","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795945%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187173","title":"doi:10.3390/jcm15187173","url":"https://doi.org/10.3390/jcm15187173"}],"status":"frontier","summary":"PMID 42795945 \"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study\" (CC BY, first published 2026-09-15) reports: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768386","kind":"claim","label":"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42768386"]},"sources":[{"id":"source.frontier.pmid-42768386","title":"Europe PMC record PMID 42768386: Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768386%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13099-026-00860-2","title":"doi:10.1186/s13099-026-00860-2","url":"https://doi.org/10.1186/s13099-026-00860-2"}],"status":"frontier","summary":"PMID 42768386 \"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations\" (CC BY, first published 2026-09-15) reports: \"Our analysis revealed variation in the gut resistome across population groups and countries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760901","kind":"claim","label":"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42760901"]},"sources":[{"id":"source.frontier.pmid-42760901","title":"Europe PMC record PMID 42760901: Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760901%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.181753.4","title":"doi:10.12688/f1000research.181753.4","url":"https://doi.org/10.12688/f1000research.181753.4"}],"status":"frontier","summary":"PMID 42760901 \"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand\" (CC BY, first published 2026-09-15) reports: \"Experience of discrimination was associated with higher depression scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746596","kind":"claim","label":"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42746596"]},"sources":[{"id":"source.frontier.pmid-42746596","title":"Europe PMC record PMID 42746596: Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746596%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/ijog/2966459","title":"doi:10.1155/ijog/2966459","url":"https://doi.org/10.1155/ijog/2966459"}],"status":"frontier","summary":"PMID 42746596 \"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity\" (CC BY, first published 2026-09-15) reports: \"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743377","kind":"claim","label":"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743377"]},"sources":[{"id":"source.frontier.pmid-42743377","title":"Europe PMC record PMID 42743377: The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743377%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355938","title":"doi:10.1371/journal.pone.0355938","url":"https://doi.org/10.1371/journal.pone.0355938"}],"status":"frontier","summary":"PMID 42743377 \"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology\" (CC BY, first published 2026-09-15) reports: \"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743310","kind":"claim","label":"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743310"]},"sources":[{"id":"source.frontier.pmid-42743310","title":"Europe PMC record PMID 42743310: Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743310%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356760","title":"doi:10.1371/journal.pone.0356760","url":"https://doi.org/10.1371/journal.pone.0356760"}],"status":"frontier","summary":"PMID 42743310 \"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis\" (CC BY, first published 2026-09-15) reports: \"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743306","kind":"claim","label":"Convergent evolution of viral nucleases targeting cyclic dinucleotides","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743306"]},"sources":[{"id":"source.frontier.pmid-42743306","title":"Europe PMC record PMID 42743306: Convergent evolution of viral nucleases targeting cyclic dinucleotides","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743306%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.ppat.1014605","title":"doi:10.1371/journal.ppat.1014605","url":"https://doi.org/10.1371/journal.ppat.1014605"}],"status":"frontier","summary":"PMID 42743306 \"Convergent evolution of viral nucleases targeting cyclic dinucleotides\" (CC BY, first published 2026-09-15) reports: \"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743204","kind":"claim","label":"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743204"]},"sources":[{"id":"source.frontier.pmid-42743204","title":"Europe PMC record PMID 42743204: Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743204%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358261","title":"doi:10.1371/journal.pone.0358261","url":"https://doi.org/10.1371/journal.pone.0358261"}],"status":"frontier","summary":"PMID 42743204 \"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study\" (CC BY, first published 2026-09-15) reports: \"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743162","kind":"claim","label":"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743162"]},"sources":[{"id":"source.frontier.pmid-42743162","title":"Europe PMC record PMID 42743162: Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743162%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357972","title":"doi:10.1371/journal.pone.0357972","url":"https://doi.org/10.1371/journal.pone.0357972"}],"status":"frontier","summary":"PMID 42743162 \"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids\" (CC BY, first published 2026-09-15) reports: \"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743158","kind":"claim","label":"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743158"]},"sources":[{"id":"source.frontier.pmid-42743158","title":"Europe PMC record PMID 42743158: The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary a","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743158%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357910","title":"doi:10.1371/journal.pone.0357910","url":"https://doi.org/10.1371/journal.pone.0357910"}],"status":"frontier","summary":"PMID 42743158 \"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease\" (CC BY, first published 2026-09-15) reports: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42403695","kind":"claim","label":"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42403695"]},"sources":[{"id":"source.frontier.pmid-42403695","title":"Europe PMC record PMID 42403695: What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42403695%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.173033.4","title":"doi:10.12688/f1000research.173033.4","url":"https://doi.org/10.12688/f1000research.173033.4"}],"status":"frontier","summary":"PMID 42403695 \"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity\" (CC BY, first published 2026-09-15) reports: \"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42807220","kind":"claim","label":"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42807220"]},"sources":[{"id":"source.frontier.pmid-42807220","title":"Europe PMC record PMID 42807220: Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case repo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1936197","title":"doi:10.3389/fmed.2026.1936197","url":"https://doi.org/10.3389/fmed.2026.1936197"}],"status":"frontier","summary":"PMID 42807220 \"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review\" (CC BY, first published 2026-09-14) reports: \"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42807094","kind":"claim","label":"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42807094"]},"sources":[{"id":"source.frontier.pmid-42807094","title":"Europe PMC record PMID 42807094: Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807094%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1897856","title":"doi:10.3389/fmed.2026.1897856","url":"https://doi.org/10.3389/fmed.2026.1897856"}],"status":"frontier","summary":"PMID 42807094 \"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases\" (CC BY, first published 2026-09-14) reports: \"Our findings highlight an association between alcohol consumption and low BMD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795904","kind":"claim","label":"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42795904"]},"sources":[{"id":"source.frontier.pmid-42795904","title":"Europe PMC record PMID 42795904: Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795904%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187131","title":"doi:10.3390/jcm15187131","url":"https://doi.org/10.3390/jcm15187131"}],"status":"frontier","summary":"PMID 42795904 \"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer\" (CC BY, first published 2026-09-14) reports: \"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768354","kind":"claim","label":"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42768354"]},"sources":[{"id":"source.frontier.pmid-42768354","title":"Europe PMC record PMID 42768354: Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768354%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12905-026-04676-9","title":"doi:10.1186/s12905-026-04676-9","url":"https://doi.org/10.1186/s12905-026-04676-9"}],"status":"frontier","summary":"PMID 42768354 \"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency\" (CC BY, first published 2026-09-14) reports: \"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746605","kind":"claim","label":"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42746605"]},"sources":[{"id":"source.frontier.pmid-42746605","title":"Europe PMC record PMID 42746605: Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746605%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/20523211.2026.2719528","title":"doi:10.1080/20523211.2026.2719528","url":"https://doi.org/10.1080/20523211.2026.2719528"}],"status":"frontier","summary":"PMID 42746605 \"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study\" (CC BY, first published 2026-09-14) reports: \"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42736559","kind":"claim","label":"Living with adenomyosis and involuntary childlessness: a qualitative interview study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42736559"]},"sources":[{"id":"source.frontier.pmid-42736559","title":"Europe PMC record PMID 42736559: Living with adenomyosis and involuntary childlessness: a qualitative interview study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42736559%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12905-026-04880-7","title":"doi:10.1186/s12905-026-04880-7","url":"https://doi.org/10.1186/s12905-026-04880-7"}],"status":"frontier","summary":"PMID 42736559 \"Living with adenomyosis and involuntary childlessness: a qualitative interview study\" (CC BY, first published 2026-09-14) reports: \"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796834","kind":"claim","label":"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42796834"]},"sources":[{"id":"source.frontier.pmid-42796834","title":"Europe PMC record PMID 42796834: Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796834%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/plants15182802","title":"doi:10.3390/plants15182802","url":"https://doi.org/10.3390/plants15182802"}],"status":"frontier","summary":"PMID 42796834 \"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling\" (CC BY, first published 2026-09-12) reports: \"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794013","kind":"claim","label":"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42794013"]},"sources":[{"id":"source.frontier.pmid-42794013","title":"Europe PMC record PMID 42794013: Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794013%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/foods15183228","title":"doi:10.3390/foods15183228","url":"https://doi.org/10.3390/foods15183228"}],"status":"frontier","summary":"PMID 42794013 \"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review\" (CC BY, first published 2026-09-12) reports: \"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42731744","kind":"claim","label":"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42731744"]},"sources":[{"id":"source.frontier.pmid-42731744","title":"Europe PMC record PMID 42731744: Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42731744%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.physbeh.2026.115500","title":"doi:10.1016/j.physbeh.2026.115500","url":"https://doi.org/10.1016/j.physbeh.2026.115500"}],"status":"frontier","summary":"PMID 42731744 \"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation\" (CC BY, first published 2026-09-12) reports: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799291","kind":"claim","label":"A review on clinical cases of rare mold infections and their antifungal treatment strategies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42799291"]},"sources":[{"id":"source.frontier.pmid-42799291","title":"Europe PMC record PMID 42799291: A review on clinical cases of rare mold infections and their antifungal treatment strategies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799291%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmicb.2026.1903380","title":"doi:10.3389/fmicb.2026.1903380","url":"https://doi.org/10.3389/fmicb.2026.1903380"}],"status":"frontier","summary":"PMID 42799291 \"A review on clinical cases of rare mold infections and their antifungal treatment strategies\" (CC BY, first published 2026-09-11) reports: \"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798677","kind":"claim","label":"Arts participation and mental health: evidence from the Chinese general social survey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798677"]},"sources":[{"id":"source.frontier.pmid-42798677","title":"Europe PMC record PMID 42798677: Arts participation and mental health: evidence from the Chinese general social survey","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798677%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1933119","title":"doi:10.3389/fpsyg.2026.1933119","url":"https://doi.org/10.3389/fpsyg.2026.1933119"}],"status":"frontier","summary":"PMID 42798677 \"Arts participation and mental health: evidence from the Chinese general social survey\" (CC BY, first published 2026-09-11) reports: \"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798644","kind":"claim","label":"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798644"]},"sources":[{"id":"source.frontier.pmid-42798644","title":"Europe PMC record PMID 42798644: <i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798644%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1948468","title":"doi:10.3389/fmed.2026.1948468","url":"https://doi.org/10.3389/fmed.2026.1948468"}],"status":"frontier","summary":"PMID 42798644 \"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review\" (CC BY, first published 2026-09-11) reports: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798637","kind":"claim","label":"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798637"]},"sources":[{"id":"source.frontier.pmid-42798637","title":"Europe PMC record PMID 42798637: A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798637%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1915868","title":"doi:10.3389/fpubh.2026.1915868","url":"https://doi.org/10.3389/fpubh.2026.1915868"}],"status":"frontier","summary":"PMID 42798637 \"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone\" (CC BY, first published 2026-09-11) reports: \"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798632","kind":"claim","label":"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798632"]},"sources":[{"id":"source.frontier.pmid-42798632","title":"Europe PMC record PMID 42798632: Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798632%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1905102","title":"doi:10.3389/fphar.2026.1905102","url":"https://doi.org/10.3389/fphar.2026.1905102"}],"status":"frontier","summary":"PMID 42798632 \"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients\" (CC BY, first published 2026-09-11) reports: \"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784269","kind":"claim","label":"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42784269"]},"sources":[{"id":"source.frontier.pmid-42784269","title":"Europe PMC record PMID 42784269: The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784269%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/tomography12090131","title":"doi:10.3390/tomography12090131","url":"https://doi.org/10.3390/tomography12090131"}],"status":"frontier","summary":"PMID 42784269 \"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions\" (CC BY, first published 2026-09-11) reports: \"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42730235","kind":"claim","label":"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42730235"]},"sources":[{"id":"source.frontier.pmid-42730235","title":"Europe PMC record PMID 42730235: Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42730235%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74347","title":"doi:10.1002/ece3.74347","url":"https://doi.org/10.1002/ece3.74347"}],"status":"frontier","summary":"PMID 42730235 \"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex\" (CC BY, first published 2026-09-11) reports: \"Together, these results suggest a potential pest complex where previously only one species was in focus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729983","kind":"claim","label":"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42729983"]},"sources":[{"id":"source.frontier.pmid-42729983","title":"Europe PMC record PMID 42729983: Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729983%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74274","title":"doi:10.1002/ece3.74274","url":"https://doi.org/10.1002/ece3.74274"}],"status":"frontier","summary":"PMID 42729983 \"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations\" (CC BY, first published 2026-09-11) reports: \"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42726890","kind":"claim","label":"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42726890"]},"sources":[{"id":"source.frontier.pmid-42726890","title":"Europe PMC record PMID 42726890: Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012306","title":"doi:10.1371/journal.pgen.1012306","url":"https://doi.org/10.1371/journal.pgen.1012306"}],"status":"frontier","summary":"PMID 42726890 \"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex\" (CC BY, first published 2026-09-11) reports: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42726368","kind":"claim","label":"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42726368"]},"sources":[{"id":"source.frontier.pmid-42726368","title":"Europe PMC record PMID 42726368: The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726368%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11883-026-01463-7","title":"doi:10.1007/s11883-026-01463-7","url":"https://doi.org/10.1007/s11883-026-01463-7"}],"status":"frontier","summary":"PMID 42726368 \"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk\" (CC BY, first published 2026-09-11) reports: \"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42793476","kind":"claim","label":"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42793476"]},"sources":[{"id":"source.frontier.pmid-42793476","title":"Europe PMC record PMID 42793476: Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42793476%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14182936","title":"doi:10.3390/healthcare14182936","url":"https://doi.org/10.3390/healthcare14182936"}],"status":"frontier","summary":"PMID 42793476 \"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study\" (CC BY, first published 2026-09-10) reports: \"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42725296","kind":"claim","label":"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42725296"]},"sources":[{"id":"source.frontier.pmid-42725296","title":"Europe PMC record PMID 42725296: Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), I","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725296%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74323","title":"doi:10.1002/ece3.74323","url":"https://doi.org/10.1002/ece3.74323"}],"status":"frontier","summary":"PMID 42725296 \"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia\" (CC BY, first published 2026-09-10) reports: \"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721209","kind":"claim","label":"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721209"]},"sources":[{"id":"source.frontier.pmid-42721209","title":"Europe PMC record PMID 42721209: Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721209%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354427","title":"doi:10.1371/journal.pone.0354427","url":"https://doi.org/10.1371/journal.pone.0354427"}],"status":"frontier","summary":"PMID 42721209 \"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study\" (CC BY, first published 2026-09-10) reports: \"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721180","kind":"claim","label":"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721180"]},"sources":[{"id":"source.frontier.pmid-42721180","title":"Europe PMC record PMID 42721180: Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721180%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014698","title":"doi:10.1371/journal.pntd.0014698","url":"https://doi.org/10.1371/journal.pntd.0014698"}],"status":"frontier","summary":"PMID 42721180 \"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis\" (CC BY, first published 2026-09-10) reports: \"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721148","kind":"claim","label":"Care network types and depression among people with cognitive impairment: A latent class analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721148"]},"sources":[{"id":"source.frontier.pmid-42721148","title":"Europe PMC record PMID 42721148: Care network types and depression among people with cognitive impairment: A latent class analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721148%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357737","title":"doi:10.1371/journal.pone.0357737","url":"https://doi.org/10.1371/journal.pone.0357737"}],"status":"frontier","summary":"PMID 42721148 \"Care network types and depression among people with cognitive impairment: A latent class analysis\" (CC BY, first published 2026-09-10) reports: \"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721140","kind":"claim","label":"Grey voters and populist voting. The role of religiosity and national collective narcissism","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721140"]},"sources":[{"id":"source.frontier.pmid-42721140","title":"Europe PMC record PMID 42721140: Grey voters and populist voting. The role of religiosity and national collective narcissism","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721140%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0336831","title":"doi:10.1371/journal.pone.0336831","url":"https://doi.org/10.1371/journal.pone.0336831"}],"status":"frontier","summary":"PMID 42721140 \"Grey voters and populist voting. The role of religiosity and national collective narcissism\" (CC BY, first published 2026-09-10) reports: \"We also found religious faith to be a stronger predictor of populist voting than religious practice.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721128","kind":"claim","label":"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721128"]},"sources":[{"id":"source.frontier.pmid-42721128","title":"Europe PMC record PMID 42721128: Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721128%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357909","title":"doi:10.1371/journal.pone.0357909","url":"https://doi.org/10.1371/journal.pone.0357909"}],"status":"frontier","summary":"PMID 42721128 \"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops\" (CC BY, first published 2026-09-10) reports: \"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792412","kind":"claim","label":"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42792412"]},"sources":[{"id":"source.frontier.pmid-42792412","title":"Europe PMC record PMID 42792412: Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792412%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091612","title":"doi:10.3390/bs16091612","url":"https://doi.org/10.3390/bs16091612"}],"status":"frontier","summary":"PMID 42792412 \"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students\" (CC BY, first published 2026-09-09) reports: \"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42780961","kind":"claim","label":"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42780961"]},"sources":[{"id":"source.frontier.pmid-42780961","title":"Europe PMC record PMID 42780961: The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780961%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fdgth.2026.1955151","title":"doi:10.3389/fdgth.2026.1955151","url":"https://doi.org/10.3389/fdgth.2026.1955151"}],"status":"frontier","summary":"PMID 42780961 \"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives\" (CC BY, first published 2026-09-09) reports: \"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42780909","kind":"claim","label":"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42780909"]},"sources":[{"id":"source.frontier.pmid-42780909","title":"Europe PMC record PMID 42780909: Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780909%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1900588","title":"doi:10.3389/fpubh.2026.1900588","url":"https://doi.org/10.3389/fpubh.2026.1900588"}],"status":"frontier","summary":"PMID 42780909 \"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes\" (CC BY, first published 2026-09-09) reports: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795560","kind":"claim","label":"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42795560"]},"sources":[{"id":"source.frontier.pmid-42795560","title":"Europe PMC record PMID 42795560: Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795560%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/microorganisms14091979","title":"doi:10.3390/microorganisms14091979","url":"https://doi.org/10.3390/microorganisms14091979"}],"status":"frontier","summary":"PMID 42795560 \"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study\" (CC BY, first published 2026-09-08) reports: \"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42775227","kind":"claim","label":"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42775227"]},"sources":[{"id":"source.frontier.pmid-42775227","title":"Europe PMC record PMID 42775227: Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42775227%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1832219","title":"doi:10.3389/fpsyg.2026.1832219","url":"https://doi.org/10.3389/fpsyg.2026.1832219"}],"status":"frontier","summary":"PMID 42775227 \"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions\" (CC BY, first published 2026-09-08) reports: \"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42732108","kind":"claim","label":"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42732108"]},"sources":[{"id":"source.frontier.pmid-42732108","title":"Europe PMC record PMID 42732108: Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732108%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.180569.3","title":"doi:10.12688/f1000research.180569.3","url":"https://doi.org/10.12688/f1000research.180569.3"}],"status":"frontier","summary":"PMID 42732108 \"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations\" (CC BY, first published 2026-09-08) reports: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709861","kind":"claim","label":"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42709861"]},"sources":[{"id":"source.frontier.pmid-42709861","title":"Europe PMC record PMID 42709861: Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709861%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.ppat.1014558","title":"doi:10.1371/journal.ppat.1014558","url":"https://doi.org/10.1371/journal.ppat.1014558"}],"status":"frontier","summary":"PMID 42709861 \"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection\" (CC BY, first published 2026-09-08) reports: \"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709851","kind":"claim","label":"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42709851"]},"sources":[{"id":"source.frontier.pmid-42709851","title":"Europe PMC record PMID 42709851: Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709851%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pmed.1004917","title":"doi:10.1371/journal.pmed.1004917","url":"https://doi.org/10.1371/journal.pmed.1004917"}],"status":"frontier","summary":"PMID 42709851 \"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study\" (CC BY, first published 2026-09-08) reports: \"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792025","kind":"claim","label":"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42792025"]},"sources":[{"id":"source.frontier.pmid-42792025","title":"Europe PMC record PMID 42792025: Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792025%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15090875","title":"doi:10.3390/antibiotics15090875","url":"https://doi.org/10.3390/antibiotics15090875"}],"status":"frontier","summary":"PMID 42792025 \"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens\" (CC BY, first published 2026-09-07) reports: \": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42769220","kind":"claim","label":"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42769220"]},"sources":[{"id":"source.frontier.pmid-42769220","title":"Europe PMC record PMID 42769220: Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1876551","title":"doi:10.3389/fmed.2026.1876551","url":"https://doi.org/10.3389/fmed.2026.1876551"}],"status":"frontier","summary":"PMID 42769220 \"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD\" (CC BY, first published 2026-09-07) reports: \"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42769130","kind":"claim","label":"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42769130"]},"sources":[{"id":"source.frontier.pmid-42769130","title":"Europe PMC record PMID 42769130: Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769130%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1950267","title":"doi:10.3389/fpsyg.2026.1950267","url":"https://doi.org/10.3389/fpsyg.2026.1950267"}],"status":"frontier","summary":"PMID 42769130 \"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis\" (CC BY, first published 2026-09-07) reports: \"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739931","kind":"claim","label":"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42739931"]},"sources":[{"id":"source.frontier.pmid-42739931","title":"Europe PMC record PMID 42739931: Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739931%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176927","title":"doi:10.3390/jcm15176927","url":"https://doi.org/10.3390/jcm15176927"}],"status":"frontier","summary":"PMID 42739931 \"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs\" (CC BY, first published 2026-09-07) reports: \": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739910","kind":"claim","label":"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42739910"]},"sources":[{"id":"source.frontier.pmid-42739910","title":"Europe PMC record PMID 42739910: A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739910%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176907","title":"doi:10.3390/jcm15176907","url":"https://doi.org/10.3390/jcm15176907"}],"status":"frontier","summary":"PMID 42739910 \"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support\" (CC BY, first published 2026-09-07) reports: \"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42738411","kind":"claim","label":"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42738411"]},"sources":[{"id":"source.frontier.pmid-42738411","title":"Europe PMC record PMID 42738411: Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Im","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42738411%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/cancers18172891","title":"doi:10.3390/cancers18172891","url":"https://doi.org/10.3390/cancers18172891"}],"status":"frontier","summary":"PMID 42738411 \"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia\" (CC BY, first published 2026-09-07) reports: \"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737031","kind":"claim","label":"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42737031"]},"sources":[{"id":"source.frontier.pmid-42737031","title":"Europe PMC record PMID 42737031: Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitati","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737031%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14172873","title":"doi:10.3390/healthcare14172873","url":"https://doi.org/10.3390/healthcare14172873"}],"status":"frontier","summary":"PMID 42737031 \"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study\" (CC BY, first published 2026-09-07) reports: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42783218","kind":"claim","label":"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.pmid-42783218"]},"sources":[{"id":"source.frontier.pmid-42783218","title":"Europe PMC record PMID 42783218: Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-Wor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42783218%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/diseases14090325","title":"doi:10.3390/diseases14090325","url":"https://doi.org/10.3390/diseases14090325"}],"status":"frontier","summary":"PMID 42783218 \"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study\" (CC BY, first published 2026-09-05) reports: \": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42831226","kind":"claim","label":"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42831226"]},"sources":[{"id":"source.frontier.pmid-42831226","title":"Europe PMC record PMID 42831226: Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831226%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115797","title":"doi:10.7759/cureus.115797","url":"https://doi.org/10.7759/cureus.115797"}],"status":"frontier","summary":"PMID 42831226 \"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge\" (CC BY, first published 2026-09-04) reports: \"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42831114","kind":"claim","label":"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42831114"]},"sources":[{"id":"source.frontier.pmid-42831114","title":"Europe PMC record PMID 42831114: Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831114%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115778","title":"doi:10.7759/cureus.115778","url":"https://doi.org/10.7759/cureus.115778"}],"status":"frontier","summary":"PMID 42831114 \"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis\" (CC BY, first published 2026-09-04) reports: \"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761220","kind":"claim","label":"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761220"]},"sources":[{"id":"source.frontier.pmid-42761220","title":"Europe PMC record PMID 42761220: The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating rol","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1918525","title":"doi:10.3389/fpsyg.2026.1918525","url":"https://doi.org/10.3389/fpsyg.2026.1918525"}],"status":"frontier","summary":"PMID 42761220 \"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender\" (CC BY, first published 2026-09-04) reports: \"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761051","kind":"claim","label":"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761051"]},"sources":[{"id":"source.frontier.pmid-42761051","title":"Europe PMC record PMID 42761051: Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761051%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1941386","title":"doi:10.3389/fmed.2026.1941386","url":"https://doi.org/10.3389/fmed.2026.1941386"}],"status":"frontier","summary":"PMID 42761051 \"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims\" (CC BY, first published 2026-09-04) reports: \"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761040","kind":"claim","label":"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761040"]},"sources":[{"id":"source.frontier.pmid-42761040","title":"Europe PMC record PMID 42761040: RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761040%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1894867","title":"doi:10.3389/fcimb.2026.1894867","url":"https://doi.org/10.3389/fcimb.2026.1894867"}],"status":"frontier","summary":"PMID 42761040 \"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil\" (CC BY, first published 2026-09-04) reports: \"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739854","kind":"claim","label":"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42739854"]},"sources":[{"id":"source.frontier.pmid-42739854","title":"Europe PMC record PMID 42739854: Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739854%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176851","title":"doi:10.3390/jcm15176851","url":"https://doi.org/10.3390/jcm15176851"}],"status":"frontier","summary":"PMID 42739854 \"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry\" (CC BY, first published 2026-09-04) reports: \"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42698113","kind":"claim","label":"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42698113"]},"sources":[{"id":"source.frontier.pmid-42698113","title":"Europe PMC record PMID 42698113: A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698113%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42494-026-00277-z","title":"doi:10.1186/s42494-026-00277-z","url":"https://doi.org/10.1186/s42494-026-00277-z"}],"status":"frontier","summary":"PMID 42698113 \"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre\" (CC BY, first published 2026-09-04) reports: \"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42830983","kind":"claim","label":"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42830983"]},"sources":[{"id":"source.frontier.pmid-42830983","title":"Europe PMC record PMID 42830983: Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42830983%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115747","title":"doi:10.7759/cureus.115747","url":"https://doi.org/10.7759/cureus.115747"}],"status":"frontier","summary":"PMID 42830983 \"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42757226","kind":"claim","label":"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42757226"]},"sources":[{"id":"source.frontier.pmid-42757226","title":"Europe PMC record PMID 42757226: Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and health","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757226%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1726738","title":"doi:10.3389/fpsyt.2026.1726738","url":"https://doi.org/10.3389/fpsyt.2026.1726738"}],"status":"frontier","summary":"PMID 42757226 \"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls\" (CC BY, first published 2026-09-03) reports: \"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42756514","kind":"claim","label":"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42756514"]},"sources":[{"id":"source.frontier.pmid-42756514","title":"Europe PMC record PMID 42756514: Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42756514%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1930046","title":"doi:10.3389/fneur.2026.1930046","url":"https://doi.org/10.3389/fneur.2026.1930046"}],"status":"frontier","summary":"PMID 42756514 \"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform\" (CC BY, first published 2026-09-03) reports: \"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755864","kind":"claim","label":"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755864"]},"sources":[{"id":"source.frontier.pmid-42755864","title":"Europe PMC record PMID 42755864: Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755864%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1882392","title":"doi:10.3389/fendo.2026.1882392","url":"https://doi.org/10.3389/fendo.2026.1882392"}],"status":"frontier","summary":"PMID 42755864 \"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity\" (CC BY, first published 2026-09-03) reports: \", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755797","kind":"claim","label":"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755797"]},"sources":[{"id":"source.frontier.pmid-42755797","title":"Europe PMC record PMID 42755797: Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755797%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcvm.2026.1841043","title":"doi:10.3389/fcvm.2026.1841043","url":"https://doi.org/10.3389/fcvm.2026.1841043"}],"status":"frontier","summary":"PMID 42755797 \"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults\" (CC BY, first published 2026-09-03) reports: \"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755627","kind":"claim","label":"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755627"]},"sources":[{"id":"source.frontier.pmid-42755627","title":"Europe PMC record PMID 42755627: Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755627%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1936529","title":"doi:10.3389/fmed.2026.1936529","url":"https://doi.org/10.3389/fmed.2026.1936529"}],"status":"frontier","summary":"PMID 42755627 \"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755626","kind":"claim","label":"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755626"]},"sources":[{"id":"source.frontier.pmid-42755626","title":"Europe PMC record PMID 42755626: Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755626%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1906472","title":"doi:10.3389/fneur.2026.1906472","url":"https://doi.org/10.3389/fneur.2026.1906472"}],"status":"frontier","summary":"PMID 42755626 \"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study\" (CC BY, first published 2026-09-03) reports: \"These findings suggest that PFO diameter may be associated with WMH severity in young adults.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796692","kind":"claim","label":"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42796692"]},"sources":[{"id":"source.frontier.pmid-42796692","title":"Europe PMC record PMID 42796692: Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796692%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/pathogens15090924","title":"doi:10.3390/pathogens15090924","url":"https://doi.org/10.3390/pathogens15090924"}],"status":"frontier","summary":"PMID 42796692 \"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines\" (CC BY, first published 2026-09-02) reports: \"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42688919","kind":"claim","label":"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42688919"]},"sources":[{"id":"source.frontier.pmid-42688919","title":"Europe PMC record PMID 42688919: Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688919%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crcc/7875906","title":"doi:10.1155/crcc/7875906","url":"https://doi.org/10.1155/crcc/7875906"}],"status":"frontier","summary":"PMID 42688919 \"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report\" (CC BY, first published 2026-09-02) reports: \"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42688865","kind":"claim","label":"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42688865"]},"sources":[{"id":"source.frontier.pmid-42688865","title":"Europe PMC record PMID 42688865: Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688865%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crh/8921605","title":"doi:10.1155/crh/8921605","url":"https://doi.org/10.1155/crh/8921605"}],"status":"frontier","summary":"PMID 42688865 \"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review\" (CC BY, first published 2026-09-02) reports: \"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42687189","kind":"claim","label":"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42687189"]},"sources":[{"id":"source.frontier.pmid-42687189","title":"Europe PMC record PMID 42687189: Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687189%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42466-026-00528-x","title":"doi:10.1186/s42466-026-00528-x","url":"https://doi.org/10.1186/s42466-026-00528-x"}],"status":"frontier","summary":"PMID 42687189 \"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis\" (CC BY, first published 2026-09-02) reports: \"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42685061","kind":"claim","label":"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42685061"]},"sources":[{"id":"source.frontier.pmid-42685061","title":"Europe PMC record PMID 42685061: Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic ther","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42685061%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357706","title":"doi:10.1371/journal.pone.0357706","url":"https://doi.org/10.1371/journal.pone.0357706"}],"status":"frontier","summary":"PMID 42685061 \"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study\" (CC BY, first published 2026-09-02) reports: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42825005","kind":"claim","label":"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42825005"]},"sources":[{"id":"source.frontier.pmid-42825005","title":"Europe PMC record PMID 42825005: Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42825005%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115582","title":"doi:10.7759/cureus.115582","url":"https://doi.org/10.7759/cureus.115582"}],"status":"frontier","summary":"PMID 42825005 \"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors\" (CC BY, first published 2026-09-01) reports: \"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42823403","kind":"claim","label":"Global incidence of esophageal cancer by histological and anatomical subtypes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42823403"]},"sources":[{"id":"source.frontier.pmid-42823403","title":"Europe PMC record PMID 42823403: Global incidence of esophageal cancer by histological and anatomical subtypes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823403%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76540-1","title":"doi:10.1038/s41467-026-76540-1","url":"https://doi.org/10.1038/s41467-026-76540-1"}],"status":"frontier","summary":"PMID 42823403 \"Global incidence of esophageal cancer by histological and anatomical subtypes\" (CC BY, first published 2026-09-01) reports: \"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42818964","kind":"claim","label":"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42818964"]},"sources":[{"id":"source.frontier.pmid-42818964","title":"Europe PMC record PMID 42818964: Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42818964%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12669/pjms.42.9.13794","title":"doi:10.12669/pjms.42.9.13794","url":"https://doi.org/10.12669/pjms.42.9.13794"}],"status":"frontier","summary":"PMID 42818964 \"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience\" (CC BY, first published 2026-09-01) reports: \"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42803191","kind":"claim","label":"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42803191"]},"sources":[{"id":"source.frontier.pmid-42803191","title":"Europe PMC record PMID 42803191: Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42803191%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/nar/gkag929","title":"doi:10.1093/nar/gkag929","url":"https://doi.org/10.1093/nar/gkag929"}],"status":"frontier","summary":"PMID 42803191 \"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly\" (CC BY, first published 2026-09-01) reports: \"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42802368","kind":"claim","label":"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42802368"]},"sources":[{"id":"source.frontier.pmid-42802368","title":"Europe PMC record PMID 42802368: Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42802368%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/cch.70346","title":"doi:10.1111/cch.70346","url":"https://doi.org/10.1111/cch.70346"}],"status":"frontier","summary":"PMID 42802368 \"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany\" (CC BY, first published 2026-09-01) reports: \"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798137","kind":"claim","label":"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42798137"]},"sources":[{"id":"source.frontier.pmid-42798137","title":"Europe PMC record PMID 42798137: Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southw","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798137%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70551","title":"doi:10.1111/mec.70551","url":"https://doi.org/10.1111/mec.70551"}],"status":"frontier","summary":"PMID 42798137 \"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest\" (CC BY, first published 2026-09-01) reports: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798110","kind":"claim","label":"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42798110"]},"sources":[{"id":"source.frontier.pmid-42798110","title":"Europe PMC record PMID 42798110: The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798110%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050870","title":"doi:10.1097/md.0000000000050870","url":"https://doi.org/10.1097/md.0000000000050870"}],"status":"frontier","summary":"PMID 42798110 \"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery\" (CC BY, first published 2026-09-01) reports: \"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42782937","kind":"claim","label":"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42782937"]},"sources":[{"id":"source.frontier.pmid-42782937","title":"Europe PMC record PMID 42782937: Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous H","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42782937%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/dj14090550","title":"doi:10.3390/dj14090550","url":"https://doi.org/10.3390/dj14090550"}],"status":"frontier","summary":"PMID 42782937 \"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing\" (CC BY, first published 2026-09-01) reports: \"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42776569","kind":"claim","label":"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42776569"]},"sources":[{"id":"source.frontier.pmid-42776569","title":"Europe PMC record PMID 42776569: Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42776569%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1099/mgen.0.001826","title":"doi:10.1099/mgen.0.001826","url":"https://doi.org/10.1099/mgen.0.001826"}],"status":"frontier","summary":"PMID 42776569 \"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>\" (CC BY, first published 2026-09-01) reports: \"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768698","kind":"claim","label":"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42768698"]},"sources":[{"id":"source.frontier.pmid-42768698","title":"Europe PMC record PMID 42768698: Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768698%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70550","title":"doi:10.1111/mec.70550","url":"https://doi.org/10.1111/mec.70550"}],"status":"frontier","summary":"PMID 42768698 \"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish\" (CC BY, first published 2026-09-01) reports: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760703","kind":"claim","label":"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42760703"]},"sources":[{"id":"source.frontier.pmid-42760703","title":"Europe PMC record PMID 42760703: Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760703%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050725","title":"doi:10.1097/md.0000000000050725","url":"https://doi.org/10.1097/md.0000000000050725"}],"status":"frontier","summary":"PMID 42760703 \"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression\" (CC BY, first published 2026-09-01) reports: \"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746056","kind":"claim","label":"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42746056"]},"sources":[{"id":"source.frontier.pmid-42746056","title":"Europe PMC record PMID 42746056: Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framewo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746056%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1794662","title":"doi:10.3389/fimmu.2026.1794662","url":"https://doi.org/10.3389/fimmu.2026.1794662"}],"status":"frontier","summary":"PMID 42746056 \"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework\" (CC BY, first published 2026-09-01) reports: \"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42745765","kind":"claim","label":"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42745765"]},"sources":[{"id":"source.frontier.pmid-42745765","title":"Europe PMC record PMID 42745765: Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42745765%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1890094","title":"doi:10.3389/fendo.2026.1890094","url":"https://doi.org/10.3389/fendo.2026.1890094"}],"status":"frontier","summary":"PMID 42745765 \"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome\" (CC BY, first published 2026-09-01) reports: \"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42742452","kind":"claim","label":"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42742452"]},"sources":[{"id":"source.frontier.pmid-42742452","title":"Europe PMC record PMID 42742452: Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42742452%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/iid3.70523","title":"doi:10.1002/iid3.70523","url":"https://doi.org/10.1002/iid3.70523"}],"status":"frontier","summary":"PMID 42742452 \"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation\" (CC BY, first published 2026-09-01) reports: \"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737913","kind":"claim","label":"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42737913"]},"sources":[{"id":"source.frontier.pmid-42737913","title":"Europe PMC record PMID 42737913: Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737913%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biology15171481","title":"doi:10.3390/biology15171481","url":"https://doi.org/10.3390/biology15171481"}],"status":"frontier","summary":"PMID 42737913 \"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>\" (CC BY, first published 2026-09-01) reports: \"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709467","kind":"claim","label":"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42709467"]},"sources":[{"id":"source.frontier.pmid-42709467","title":"Europe PMC record PMID 42709467: Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheum","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709467%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/acr2.90145","title":"doi:10.1002/acr2.90145","url":"https://doi.org/10.1002/acr2.90145"}],"status":"frontier","summary":"PMID 42709467 \"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort\" (CC BY, first published 2026-09-01) reports: \"Male sex was associated with treatment escalation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42708953","kind":"claim","label":"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42708953"]},"sources":[{"id":"source.frontier.pmid-42708953","title":"Europe PMC record PMID 42708953: Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42708953%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1021/acs.est.6c05759","title":"doi:10.1021/acs.est.6c05759","url":"https://doi.org/10.1021/acs.est.6c05759"}],"status":"frontier","summary":"PMID 42708953 \"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress\" (CC BY, first published 2026-09-01) reports: \"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42706664","kind":"claim","label":"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42706664"]},"sources":[{"id":"source.frontier.pmid-42706664","title":"Europe PMC record PMID 42706664: The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42706664%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jcop.70146","title":"doi:10.1002/jcop.70146","url":"https://doi.org/10.1002/jcop.70146"}],"status":"frontier","summary":"PMID 42706664 \"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness\" (CC BY, first published 2026-09-01) reports: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42687444","kind":"claim","label":"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42687444"]},"sources":[{"id":"source.frontier.pmid-42687444","title":"Europe PMC record PMID 42687444: Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687444%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/brb3.71714","title":"doi:10.1002/brb3.71714","url":"https://doi.org/10.1002/brb3.71714"}],"status":"frontier","summary":"PMID 42687444 \"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain\" (CC BY, first published 2026-09-01) reports: \"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42670810","kind":"claim","label":"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42670810"]},"sources":[{"id":"source.frontier.pmid-42670810","title":"Europe PMC record PMID 42670810: Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced I","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42670810%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jbt.71104","title":"doi:10.1002/jbt.71104","url":"https://doi.org/10.1002/jbt.71104"}],"status":"frontier","summary":"PMID 42670810 \"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance\" (CC BY, first published 2026-09-01) reports: \"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42663084","kind":"claim","label":"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42663084"]},"sources":[{"id":"source.frontier.pmid-42663084","title":"Europe PMC record PMID 42663084: Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42663084%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70525","title":"doi:10.1111/mec.70525","url":"https://doi.org/10.1111/mec.70525"}],"status":"frontier","summary":"PMID 42663084 \"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution\" (CC BY, first published 2026-09-01) reports: \"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42657789","kind":"claim","label":"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42657789"]},"sources":[{"id":"source.frontier.pmid-42657789","title":"Europe PMC record PMID 42657789: Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657789%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/molbev/msag221","title":"doi:10.1093/molbev/msag221","url":"https://doi.org/10.1093/molbev/msag221"}],"status":"frontier","summary":"PMID 42657789 \"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies\" (CC BY, first published 2026-09-01) reports: \"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42657744","kind":"claim","label":"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42657744"]},"sources":[{"id":"source.frontier.pmid-42657744","title":"Europe PMC record PMID 42657744: The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657744%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/tpg2.70242","title":"doi:10.1002/tpg2.70242","url":"https://doi.org/10.1002/tpg2.70242"}],"status":"frontier","summary":"PMID 42657744 \"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species\" (CC BY, first published 2026-09-01) reports: \"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42530440","kind":"claim","label":"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42530440"]},"sources":[{"id":"source.frontier.pmid-42530440","title":"Europe PMC record PMID 42530440: De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42530440%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/gbe/evag194","title":"doi:10.1093/gbe/evag194","url":"https://doi.org/10.1093/gbe/evag194"}],"status":"frontier","summary":"PMID 42530440 \"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b\" (CC BY, first published 2026-09-01) reports: \"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42522920","kind":"claim","label":"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42522920"]},"sources":[{"id":"source.frontier.pmid-42522920","title":"Europe PMC record PMID 42522920: A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42522920%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/tpg2.70286","title":"doi:10.1002/tpg2.70286","url":"https://doi.org/10.1002/tpg2.70286"}],"status":"frontier","summary":"PMID 42522920 \"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families\" (CC BY, first published 2026-09-01) reports: \"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42379141","kind":"claim","label":"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42379141"]},"sources":[{"id":"source.frontier.pmid-42379141","title":"Europe PMC record PMID 42379141: Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42379141%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/npr2.70152","title":"doi:10.1002/npr2.70152","url":"https://doi.org/10.1002/npr2.70152"}],"status":"frontier","summary":"PMID 42379141 \"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress\" (CC BY, first published 2026-09-01) reports: \"Furthermore, we found that this effect is mediated by 5-HT2AR activation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42372111","kind":"claim","label":"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42372111"]},"sources":[{"id":"source.frontier.pmid-42372111","title":"Europe PMC record PMID 42372111: Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42372111%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/g3journal/jkag171","title":"doi:10.1093/g3journal/jkag171","url":"https://doi.org/10.1093/g3journal/jkag171"}],"status":"frontier","summary":"PMID 42372111 \"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication\" (CC BY, first published 2026-09-01) reports: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42231562","kind":"claim","label":"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42231562"]},"sources":[{"id":"source.frontier.pmid-42231562","title":"Europe PMC record PMID 42231562: Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospecti","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42231562%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/sleep/zsag140","title":"doi:10.1093/sleep/zsag140","url":"https://doi.org/10.1093/sleep/zsag140"}],"status":"frontier","summary":"PMID 42231562 \"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study\" (CC BY, first published 2026-09-01) reports: \"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824002","kind":"claim","label":"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42824002"]},"sources":[{"id":"source.frontier.pmid-42824002","title":"Europe PMC record PMID 42824002: A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824002%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115550","title":"doi:10.7759/cureus.115550","url":"https://doi.org/10.7759/cureus.115550"}],"status":"frontier","summary":"PMID 42824002 \"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock\" (CC BY, first published 2026-08-31) reports: \"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42820092","kind":"claim","label":"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42820092"]},"sources":[{"id":"source.frontier.pmid-42820092","title":"Europe PMC record PMID 42820092: Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospect","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42820092%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115505","title":"doi:10.7759/cureus.115505","url":"https://doi.org/10.7759/cureus.115505"}],"status":"frontier","summary":"PMID 42820092 \"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study\" (CC BY, first published 2026-08-31) reports: \"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42741165","kind":"claim","label":"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42741165"]},"sources":[{"id":"source.frontier.pmid-42741165","title":"Europe PMC record PMID 42741165: Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinji","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741165%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fvets.2026.1892252","title":"doi:10.3389/fvets.2026.1892252","url":"https://doi.org/10.3389/fvets.2026.1892252"}],"status":"frontier","summary":"PMID 42741165 \"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China\" (CC BY, first published 2026-08-31) reports: \"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729934","kind":"claim","label":"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42729934"]},"sources":[{"id":"source.frontier.pmid-42729934","title":"Europe PMC record PMID 42729934: Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729934%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.48101/ujms.v131.14047","title":"doi:10.48101/ujms.v131.14047","url":"https://doi.org/10.48101/ujms.v131.14047"}],"status":"frontier","summary":"PMID 42729934 \"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome\" (CC BY, first published 2026-08-31) reports: \"These findings highlight the need for systematic strategies in primary care to improve management in CCS.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42674467","kind":"claim","label":"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42674467"]},"sources":[{"id":"source.frontier.pmid-42674467","title":"Europe PMC record PMID 42674467: Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42674467%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1055/s-0046-1827210","title":"doi:10.1055/s-0046-1827210","url":"https://doi.org/10.1055/s-0046-1827210"}],"status":"frontier","summary":"PMID 42674467 \"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil\" (CC BY, first published 2026-08-31) reports: \"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42672060","kind":"claim","label":"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42672060"]},"sources":[{"id":"source.frontier.pmid-42672060","title":"Europe PMC record PMID 42672060: Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42672060%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0341524","title":"doi:10.1371/journal.pone.0341524","url":"https://doi.org/10.1371/journal.pone.0341524"}],"status":"frontier","summary":"PMID 42672060 \"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh\" (CC BY, first published 2026-08-31) reports: \"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796271","kind":"claim","label":"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-30","source_ids":["source.frontier.pmid-42796271"]},"sources":[{"id":"source.frontier.pmid-42796271","title":"Europe PMC record PMID 42796271: Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Rev","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796271%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/medicina62091664","title":"doi:10.3390/medicina62091664","url":"https://doi.org/10.3390/medicina62091664"}],"status":"frontier","summary":"PMID 42796271 \"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review\" (CC BY, first published 2026-08-30) reports: \"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42791987","kind":"claim","label":"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.pmid-42791987"]},"sources":[{"id":"source.frontier.pmid-42791987","title":"Europe PMC record PMID 42791987: Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791987%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15090837","title":"doi:10.3390/antibiotics15090837","url":"https://doi.org/10.3390/antibiotics15090837"}],"status":"frontier","summary":"PMID 42791987 \"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients\" (CC BY, first published 2026-08-29) reports: \"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42668719","kind":"claim","label":"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.pmid-42668719"]},"sources":[{"id":"source.frontier.pmid-42668719","title":"Europe PMC record PMID 42668719: The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42668719%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crhe/9286315","title":"doi:10.1155/crhe/9286315","url":"https://doi.org/10.1155/crhe/9286315"}],"status":"frontier","summary":"PMID 42668719 \"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient\" (CC BY, first published 2026-08-29) reports: \"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792321","kind":"claim","label":"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42792321"]},"sources":[{"id":"source.frontier.pmid-42792321","title":"Europe PMC record PMID 42792321: Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792321%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091521","title":"doi:10.3390/bs16091521","url":"https://doi.org/10.3390/bs16091521"}],"status":"frontier","summary":"PMID 42792321 \"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior\" (CC BY, first published 2026-08-28) reports: \"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781606","kind":"claim","label":"From Distraction to Delay: Unpacking Academic Procrastination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42781606"]},"sources":[{"id":"source.frontier.pmid-42781606","title":"Europe PMC record PMID 42781606: From Distraction to Delay: Unpacking Academic Procrastination","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781606%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.5964/ejop.19203","title":"doi:10.5964/ejop.19203","url":"https://doi.org/10.5964/ejop.19203"}],"status":"frontier","summary":"PMID 42781606 \"From Distraction to Delay: Unpacking Academic Procrastination\" (CC BY, first published 2026-08-28) reports: \"These findings highlight the combined role of personal and cognitive factors in academic procrastination.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729546","kind":"claim","label":"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42729546"]},"sources":[{"id":"source.frontier.pmid-42729546","title":"Europe PMC record PMID 42729546: Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/froh.2026.1875959","title":"doi:10.3389/froh.2026.1875959","url":"https://doi.org/10.3389/froh.2026.1875959"}],"status":"frontier","summary":"PMID 42729546 \"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy\" (CC BY, first published 2026-08-28) reports: \"preparations or TQ was associated with improvements in clinical periodontal outcome measures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729309","kind":"claim","label":"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42729309"]},"sources":[{"id":"source.frontier.pmid-42729309","title":"Europe PMC record PMID 42729309: The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729309%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1868817","title":"doi:10.3389/fpubh.2026.1868817","url":"https://doi.org/10.3389/fpubh.2026.1868817"}],"status":"frontier","summary":"PMID 42729309 \"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety\" (CC BY, first published 2026-08-28) reports: \"The results reveal a significant spatial divergence in information perception.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42665853","kind":"claim","label":"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42665853"]},"sources":[{"id":"source.frontier.pmid-42665853","title":"Europe PMC record PMID 42665853: Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42665853%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42466-026-00526-z","title":"doi:10.1186/s42466-026-00526-z","url":"https://doi.org/10.1186/s42466-026-00526-z"}],"status":"frontier","summary":"PMID 42665853 \"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort\" (CC BY, first published 2026-08-28) reports: \"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42664264","kind":"claim","label":"Ecological theory sheds light on plasmid diversity and dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42664264"]},"sources":[{"id":"source.frontier.pmid-42664264","title":"Europe PMC record PMID 42664264: Ecological theory sheds light on plasmid diversity and dynamics","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42664264%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pbio.3003918","title":"doi:10.1371/journal.pbio.3003918","url":"https://doi.org/10.1371/journal.pbio.3003918"}],"status":"frontier","summary":"PMID 42664264 \"Ecological theory sheds light on plasmid diversity and dynamics\" (CC BY, first published 2026-08-28) reports: \"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661611","kind":"claim","label":"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42661611"]},"sources":[{"id":"source.frontier.pmid-42661611","title":"Europe PMC record PMID 42661611: Oncology Providers' Perspectives on Psychedelic-Assisted Therapy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661611%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1177/10499091261483604","title":"doi:10.1177/10499091261483604","url":"https://doi.org/10.1177/10499091261483604"}],"status":"frontier","summary":"PMID 42661611 \"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy\" (CC BY, first published 2026-08-28) reports: \"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42724033","kind":"claim","label":"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42724033"]},"sources":[{"id":"source.frontier.pmid-42724033","title":"Europe PMC record PMID 42724033: Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42724033%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1882335","title":"doi:10.3389/fpsyg.2026.1882335","url":"https://doi.org/10.3389/fpsyg.2026.1882335"}],"status":"frontier","summary":"PMID 42724033 \"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance\" (CC BY, first published 2026-08-27) reports: \"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42684341","kind":"claim","label":"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42684341"]},"sources":[{"id":"source.frontier.pmid-42684341","title":"Europe PMC record PMID 42684341: Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42684341%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/95529","title":"doi:10.2196/95529","url":"https://doi.org/10.2196/95529"}],"status":"frontier","summary":"PMID 42684341 \"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial\" (CC BY, first published 2026-08-27) reports: \"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661048","kind":"claim","label":"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42661048"]},"sources":[{"id":"source.frontier.pmid-42661048","title":"Europe PMC record PMID 42661048: The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661048%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41598-026-67534-6","title":"doi:10.1038/s41598-026-67534-6","url":"https://doi.org/10.1038/s41598-026-67534-6"}],"status":"frontier","summary":"PMID 42661048 \"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST\" (CC BY, first published 2026-08-27) reports: \"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42658813","kind":"claim","label":"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42658813"]},"sources":[{"id":"source.frontier.pmid-42658813","title":"Europe PMC record PMID 42658813: Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42658813%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354454","title":"doi:10.1371/journal.pone.0354454","url":"https://doi.org/10.1371/journal.pone.0354454"}],"status":"frontier","summary":"PMID 42658813 \"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops\" (CC BY, first published 2026-08-27) reports: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799507","kind":"claim","label":"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42799507"]},"sources":[{"id":"source.frontier.pmid-42799507","title":"Europe PMC record PMID 42799507: Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799507%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115239","title":"doi:10.7759/cureus.115239","url":"https://doi.org/10.7759/cureus.115239"}],"status":"frontier","summary":"PMID 42799507 \"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays\" (CC BY, first published 2026-08-26) reports: \"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42786167","kind":"claim","label":"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42786167"]},"sources":[{"id":"source.frontier.pmid-42786167","title":"Europe PMC record PMID 42786167: Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42786167%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-77102-1","title":"doi:10.1038/s41467-026-77102-1","url":"https://doi.org/10.1038/s41467-026-77102-1"}],"status":"frontier","summary":"PMID 42786167 \"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures\" (CC BY, first published 2026-08-26) reports: \"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719160","kind":"claim","label":"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719160"]},"sources":[{"id":"source.frontier.pmid-42719160","title":"Europe PMC record PMID 42719160: The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among co","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719160%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1890570","title":"doi:10.3389/fpsyg.2026.1890570","url":"https://doi.org/10.3389/fpsyg.2026.1890570"}],"status":"frontier","summary":"PMID 42719160 \"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students\" (CC BY, first published 2026-08-26) reports: \"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719051","kind":"claim","label":"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719051"]},"sources":[{"id":"source.frontier.pmid-42719051","title":"Europe PMC record PMID 42719051: Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719051%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpara.2026.1934996","title":"doi:10.3389/fpara.2026.1934996","url":"https://doi.org/10.3389/fpara.2026.1934996"}],"status":"frontier","summary":"PMID 42719051 \"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives\" (CC BY, first published 2026-08-26) reports: \"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719040","kind":"claim","label":"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719040"]},"sources":[{"id":"source.frontier.pmid-42719040","title":"Europe PMC record PMID 42719040: Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719040%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fspor.2026.1914085","title":"doi:10.3389/fspor.2026.1914085","url":"https://doi.org/10.3389/fspor.2026.1914085"}],"status":"frontier","summary":"PMID 42719040 \"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance\" (CC BY, first published 2026-08-26) reports: \"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42718586","kind":"claim","label":"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42718586"]},"sources":[{"id":"source.frontier.pmid-42718586","title":"Europe PMC record PMID 42718586: Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42718586%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1887708","title":"doi:10.3389/fonc.2026.1887708","url":"https://doi.org/10.3389/fonc.2026.1887708"}],"status":"frontier","summary":"PMID 42718586 \"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma\" (CC BY, first published 2026-08-26) reports: \"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739550","kind":"claim","label":"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42739550"]},"sources":[{"id":"source.frontier.pmid-42739550","title":"Europe PMC record PMID 42739550: Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739550%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176544","title":"doi:10.3390/jcm15176544","url":"https://doi.org/10.3390/jcm15176544"}],"status":"frontier","summary":"PMID 42739550 \"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study\" (CC BY, first published 2026-08-25) reports: \"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737509","kind":"claim","label":"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42737509"]},"sources":[{"id":"source.frontier.pmid-42737509","title":"Europe PMC record PMID 42737509: Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737509%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177609","title":"doi:10.3390/ijms27177609","url":"https://doi.org/10.3390/ijms27177609"}],"status":"frontier","summary":"PMID 42737509 \"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities\" (CC BY, first published 2026-08-25) reports: \"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737499","kind":"claim","label":"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42737499"]},"sources":[{"id":"source.frontier.pmid-42737499","title":"Europe PMC record PMID 42737499: <i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737499%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177595","title":"doi:10.3390/ijms27177595","url":"https://doi.org/10.3390/ijms27177595"}],"status":"frontier","summary":"PMID 42737499 \"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling\" (CC BY, first published 2026-08-25) reports: \"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42713496","kind":"claim","label":"Research advances in hypertriglyceridemia-induced acute pancreatitis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42713496"]},"sources":[{"id":"source.frontier.pmid-42713496","title":"Europe PMC record PMID 42713496: Research advances in hypertriglyceridemia-induced acute pancreatitis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42713496%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1829495","title":"doi:10.3389/fmed.2026.1829495","url":"https://doi.org/10.3389/fmed.2026.1829495"}],"status":"frontier","summary":"PMID 42713496 \"Research advances in hypertriglyceridemia-induced acute pancreatitis\" (CC BY, first published 2026-08-25) reports: \"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42712360","kind":"claim","label":"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42712360"]},"sources":[{"id":"source.frontier.pmid-42712360","title":"Europe PMC record PMID 42712360: Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associa","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42712360%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1884571","title":"doi:10.3389/fendo.2026.1884571","url":"https://doi.org/10.3389/fendo.2026.1884571"}],"status":"frontier","summary":"PMID 42712360 \"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain\" (CC BY, first published 2026-08-25) reports: \"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42637891","kind":"claim","label":"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42637891"]},"sources":[{"id":"source.frontier.pmid-42637891","title":"Europe PMC record PMID 42637891: Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637891%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11912-026-01823-1","title":"doi:10.1007/s11912-026-01823-1","url":"https://doi.org/10.1007/s11912-026-01823-1"}],"status":"frontier","summary":"PMID 42637891 \"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches\" (CC BY, first published 2026-08-25) reports: \"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42816488","kind":"claim","label":"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42816488"]},"sources":[{"id":"source.frontier.pmid-42816488","title":"Europe PMC record PMID 42816488: A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42816488%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76091-5","title":"doi:10.1038/s41467-026-76091-5","url":"https://doi.org/10.1038/s41467-026-76091-5"}],"status":"frontier","summary":"PMID 42816488 \"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat\" (CC BY, first published 2026-08-24) reports: \"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781598","kind":"claim","label":"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42781598"]},"sources":[{"id":"source.frontier.pmid-42781598","title":"Europe PMC record PMID 42781598: Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781598%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115093","title":"doi:10.7759/cureus.115093","url":"https://doi.org/10.7759/cureus.115093"}],"status":"frontier","summary":"PMID 42781598 \"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report\" (CC BY, first published 2026-08-24) reports: \"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781208","kind":"claim","label":"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42781208"]},"sources":[{"id":"source.frontier.pmid-42781208","title":"Europe PMC record PMID 42781208: A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781208%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115107","title":"doi:10.7759/cureus.115107","url":"https://doi.org/10.7759/cureus.115107"}],"status":"frontier","summary":"PMID 42781208 \"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients\" (CC BY, first published 2026-08-24) reports: \"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737882","kind":"claim","label":"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42737882"]},"sources":[{"id":"source.frontier.pmid-42737882","title":"Europe PMC record PMID 42737882: Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737882%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biology15171450","title":"doi:10.3390/biology15171450","url":"https://doi.org/10.3390/biology15171450"}],"status":"frontier","summary":"PMID 42737882 \"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance\" (CC BY, first published 2026-08-24) reports: \"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42707529","kind":"claim","label":"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42707529"]},"sources":[{"id":"source.frontier.pmid-42707529","title":"Europe PMC record PMID 42707529: Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707529%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.17505/jpor.2026.29459","title":"doi:10.17505/jpor.2026.29459","url":"https://doi.org/10.17505/jpor.2026.29459"}],"status":"frontier","summary":"PMID 42707529 \"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case\" (CC BY, first published 2026-08-24) reports: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42707216","kind":"claim","label":"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42707216"]},"sources":[{"id":"source.frontier.pmid-42707216","title":"Europe PMC record PMID 42707216: Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707216%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1935668","title":"doi:10.3389/fonc.2026.1935668","url":"https://doi.org/10.3389/fonc.2026.1935668"}],"status":"frontier","summary":"PMID 42707216 \"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases\" (CC BY, first published 2026-08-24) reports: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42637977","kind":"claim","label":"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42637977"]},"sources":[{"id":"source.frontier.pmid-42637977","title":"Europe PMC record PMID 42637977: Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637977%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41592-026-03194-8","title":"doi:10.1038/s41592-026-03194-8","url":"https://doi.org/10.1038/s41592-026-03194-8"}],"status":"frontier","summary":"PMID 42637977 \"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering\" (CC BY, first published 2026-08-24) reports: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42636257","kind":"claim","label":"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42636257"]},"sources":[{"id":"source.frontier.pmid-42636257","title":"Europe PMC record PMID 42636257: Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42636257%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012282","title":"doi:10.1371/journal.pgen.1012282","url":"https://doi.org/10.1371/journal.pgen.1012282"}],"status":"frontier","summary":"PMID 42636257 \"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria\" (CC BY, first published 2026-08-24) reports: \"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42635434","kind":"claim","label":"Species-specific prophage induction by ciprofloxacin in human gut metagenomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42635434"]},"sources":[{"id":"source.frontier.pmid-42635434","title":"Europe PMC record PMID 42635434: Species-specific prophage induction by ciprofloxacin in human gut metagenomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42635434%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00303-26","title":"doi:10.1128/msystems.00303-26","url":"https://doi.org/10.1128/msystems.00303-26"}],"status":"frontier","summary":"PMID 42635434 \"Species-specific prophage induction by ciprofloxacin in human gut metagenomes\" (CC BY, first published 2026-08-24) reports: \"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42634019","kind":"claim","label":"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42634019"]},"sources":[{"id":"source.frontier.pmid-42634019","title":"Europe PMC record PMID 42634019: Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelli","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42634019%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41598-026-54426-y","title":"doi:10.1038/s41598-026-54426-y","url":"https://doi.org/10.1038/s41598-026-54426-y"}],"status":"frontier","summary":"PMID 42634019 \"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence\" (CC BY, first published 2026-08-24) reports: \"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794146","kind":"claim","label":"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-23","source_ids":["source.frontier.pmid-42794146"]},"sources":[{"id":"source.frontier.pmid-42794146","title":"Europe PMC record PMID 42794146: Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794146%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/children13091126","title":"doi:10.3390/children13091126","url":"https://doi.org/10.3390/children13091126"}],"status":"frontier","summary":"PMID 42794146 \"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor\" (CC BY, first published 2026-08-23) reports: \": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737450","kind":"claim","label":"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-23","source_ids":["source.frontier.pmid-42737450"]},"sources":[{"id":"source.frontier.pmid-42737450","title":"Europe PMC record PMID 42737450: Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progres","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737450%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177546","title":"doi:10.3390/ijms27177546","url":"https://doi.org/10.3390/ijms27177546"}],"status":"frontier","summary":"PMID 42737450 \"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis\" (CC BY, first published 2026-08-23) reports: \"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778576","kind":"claim","label":"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-22","source_ids":["source.frontier.pmid-42778576"]},"sources":[{"id":"source.frontier.pmid-42778576","title":"Europe PMC record PMID 42778576: Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778576%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76147-6","title":"doi:10.1038/s41467-026-76147-6","url":"https://doi.org/10.1038/s41467-026-76147-6"}],"status":"frontier","summary":"PMID 42778576 \"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables\" (CC BY, first published 2026-08-22) reports: \"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728936","kind":"claim","label":"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-22","source_ids":["source.frontier.pmid-42728936"]},"sources":[{"id":"source.frontier.pmid-42728936","title":"Europe PMC record PMID 42728936: Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728936%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/openreseurope.22066.4","title":"doi:10.12688/openreseurope.22066.4","url":"https://doi.org/10.12688/openreseurope.22066.4"}],"status":"frontier","summary":"PMID 42728936 \"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas\" (CC BY, first published 2026-08-22) reports: \"Our results reveal that fungal and bacterial communities responded differently to land-use management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764930","kind":"claim","label":"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42764930"]},"sources":[{"id":"source.frontier.pmid-42764930","title":"Europe PMC record PMID 42764930: Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764930%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114919","title":"doi:10.7759/cureus.114919","url":"https://doi.org/10.7759/cureus.114919"}],"status":"frontier","summary":"PMID 42764930 \"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit\" (CC BY, first published 2026-08-21) reports: \"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42698454","kind":"claim","label":"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42698454"]},"sources":[{"id":"source.frontier.pmid-42698454","title":"Europe PMC record PMID 42698454: Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698454%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1893857","title":"doi:10.3389/fpsyg.2026.1893857","url":"https://doi.org/10.3389/fpsyg.2026.1893857"}],"status":"frontier","summary":"PMID 42698454 \"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem\" (CC BY, first published 2026-08-21) reports: \"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42653506","kind":"claim","label":"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42653506"]},"sources":[{"id":"source.frontier.pmid-42653506","title":"Europe PMC record PMID 42653506: Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42653506%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27167508","title":"doi:10.3390/ijms27167508","url":"https://doi.org/10.3390/ijms27167508"}],"status":"frontier","summary":"PMID 42653506 \"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features\" (CC BY, first published 2026-08-21) reports: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627947","kind":"claim","label":"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42627947"]},"sources":[{"id":"source.frontier.pmid-42627947","title":"Europe PMC record PMID 42627947: Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627947%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/97469","title":"doi:10.2196/97469","url":"https://doi.org/10.2196/97469"}],"status":"frontier","summary":"PMID 42627947 \"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial\" (CC BY, first published 2026-08-21) reports: \"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627158","kind":"claim","label":"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42627158"]},"sources":[{"id":"source.frontier.pmid-42627158","title":"Europe PMC record PMID 42627158: Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627158%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00829-26","title":"doi:10.1128/msystems.00829-26","url":"https://doi.org/10.1128/msystems.00829-26"}],"status":"frontier","summary":"PMID 42627158 \"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium\" (CC BY, first published 2026-08-21) reports: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764822","kind":"claim","label":"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42764822"]},"sources":[{"id":"source.frontier.pmid-42764822","title":"Europe PMC record PMID 42764822: Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764822%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114892","title":"doi:10.7759/cureus.114892","url":"https://doi.org/10.7759/cureus.114892"}],"status":"frontier","summary":"PMID 42764822 \"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations\" (CC BY, first published 2026-08-20) reports: \"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763617","kind":"claim","label":"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42763617"]},"sources":[{"id":"source.frontier.pmid-42763617","title":"Europe PMC record PMID 42763617: Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763617%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114847","title":"doi:10.7759/cureus.114847","url":"https://doi.org/10.7759/cureus.114847"}],"status":"frontier","summary":"PMID 42763617 \"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult\" (CC BY, first published 2026-08-20) reports: \"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42694918","kind":"claim","label":"\"What about that violence?\" Transforming the discourse on violence in mental health research and services","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42694918"]},"sources":[{"id":"source.frontier.pmid-42694918","title":"Europe PMC record PMID 42694918: \"What about that violence?\" Transforming the discourse on violence in mental health research and services","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694918%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1905808","title":"doi:10.3389/fpsyt.2026.1905808","url":"https://doi.org/10.3389/fpsyt.2026.1905808"}],"status":"frontier","summary":"PMID 42694918 \"\"What about that violence?\" Transforming the discourse on violence in mental health research and services\" (CC BY, first published 2026-08-20) reports: \"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42694103","kind":"claim","label":"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42694103"]},"sources":[{"id":"source.frontier.pmid-42694103","title":"Europe PMC record PMID 42694103: AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694103%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1860755","title":"doi:10.3389/fpsyg.2026.1860755","url":"https://doi.org/10.3389/fpsyg.2026.1860755"}],"status":"frontier","summary":"PMID 42694103 \"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load\" (CC BY, first published 2026-08-20) reports: \"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42689273","kind":"claim","label":"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42689273"]},"sources":[{"id":"source.frontier.pmid-42689273","title":"Europe PMC record PMID 42689273: Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689273%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1896842","title":"doi:10.3389/fphar.2026.1896842","url":"https://doi.org/10.3389/fphar.2026.1896842"}],"status":"frontier","summary":"PMID 42689273 \"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice\" (CC BY, first published 2026-08-20) reports: \"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627223","kind":"claim","label":"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42627223"]},"sources":[{"id":"source.frontier.pmid-42627223","title":"Europe PMC record PMID 42627223: Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627223%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/96664","title":"doi:10.2196/96664","url":"https://doi.org/10.2196/96664"}],"status":"frontier","summary":"PMID 42627223 \"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint\" (CC BY, first published 2026-08-20) reports: \"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42626349","kind":"claim","label":"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42626349"]},"sources":[{"id":"source.frontier.pmid-42626349","title":"Europe PMC record PMID 42626349: Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multi","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42626349%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114869","title":"doi:10.7759/cureus.114869","url":"https://doi.org/10.7759/cureus.114869"}],"status":"frontier","summary":"PMID 42626349 \"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events\" (CC BY, first published 2026-08-20) reports: \"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42344430","kind":"claim","label":"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42344430"]},"sources":[{"id":"source.frontier.pmid-42344430","title":"Europe PMC record PMID 42344430: Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42344430%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.178353.2","title":"doi:10.12688/f1000research.178353.2","url":"https://doi.org/10.12688/f1000research.178353.2"}],"status":"frontier","summary":"PMID 42344430 \"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'\" (CC BY, first published 2026-08-20) reports: \"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761991","kind":"claim","label":"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42761991"]},"sources":[{"id":"source.frontier.pmid-42761991","title":"Europe PMC record PMID 42761991: Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761991%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114805","title":"doi:10.7759/cureus.114805","url":"https://doi.org/10.7759/cureus.114805"}],"status":"frontier","summary":"PMID 42761991 \"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report\" (CC BY, first published 2026-08-19) reports: \"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42749735","kind":"claim","label":"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42749735"]},"sources":[{"id":"source.frontier.pmid-42749735","title":"Europe PMC record PMID 42749735: APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749735%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76565-6","title":"doi:10.1038/s41467-026-76565-6","url":"https://doi.org/10.1038/s41467-026-76565-6"}],"status":"frontier","summary":"PMID 42749735 \"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics\" (CC BY, first published 2026-08-19) reports: \"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728923","kind":"claim","label":"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42728923"]},"sources":[{"id":"source.frontier.pmid-42728923","title":"Europe PMC record PMID 42728923: Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728923%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.181997.2","title":"doi:10.12688/f1000research.181997.2","url":"https://doi.org/10.12688/f1000research.181997.2"}],"status":"frontier","summary":"PMID 42728923 \"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education\" (CC BY, first published 2026-08-19) reports: \"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42689122","kind":"claim","label":"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42689122"]},"sources":[{"id":"source.frontier.pmid-42689122","title":"Europe PMC record PMID 42689122: The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and surviv","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689122%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1828760","title":"doi:10.3389/fonc.2026.1828760","url":"https://doi.org/10.3389/fonc.2026.1828760"}],"status":"frontier","summary":"PMID 42689122 \"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes\" (CC BY, first published 2026-08-19) reports: \"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42654288","kind":"claim","label":"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42654288"]},"sources":[{"id":"source.frontier.pmid-42654288","title":"Europe PMC record PMID 42654288: Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42654288%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/nu18162708","title":"doi:10.3390/nu18162708","url":"https://doi.org/10.3390/nu18162708"}],"status":"frontier","summary":"PMID 42654288 \"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey\" (CC BY, first published 2026-08-19) reports: \"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42651394","kind":"claim","label":"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42651394"]},"sources":[{"id":"source.frontier.pmid-42651394","title":"Europe PMC record PMID 42651394: Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651394%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14162625","title":"doi:10.3390/healthcare14162625","url":"https://doi.org/10.3390/healthcare14162625"}],"status":"frontier","summary":"PMID 42651394 \"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide\" (CC BY, first published 2026-08-19) reports: \"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42646326","kind":"claim","label":"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42646326"]},"sources":[{"id":"source.frontier.pmid-42646326","title":"Europe PMC record PMID 42646326: HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42646326%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/metabo16080590","title":"doi:10.3390/metabo16080590","url":"https://doi.org/10.3390/metabo16080590"}],"status":"frontier","summary":"PMID 42646326 \"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model\" (CC BY, first published 2026-08-19) reports: \"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42616741","kind":"claim","label":"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42616741"]},"sources":[{"id":"source.frontier.pmid-42616741","title":"Europe PMC record PMID 42616741: Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616741%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006893","title":"doi:10.1371/journal.pgph.0006893","url":"https://doi.org/10.1371/journal.pgph.0006893"}],"status":"frontier","summary":"PMID 42616741 \"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff\" (CC BY, first published 2026-08-19) reports: \"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42616230","kind":"claim","label":"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42616230"]},"sources":[{"id":"source.frontier.pmid-42616230","title":"Europe PMC record PMID 42616230: Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616230%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11046-026-01097-y","title":"doi:10.1007/s11046-026-01097-y","url":"https://doi.org/10.1007/s11046-026-01097-y"}],"status":"frontier","summary":"PMID 42616230 \"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases\" (CC BY, first published 2026-08-19) reports: \"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42682491","kind":"claim","label":"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42682491"]},"sources":[{"id":"source.frontier.pmid-42682491","title":"Europe PMC record PMID 42682491: Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42682491%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1886100","title":"doi:10.3389/fneur.2026.1886100","url":"https://doi.org/10.3389/fneur.2026.1886100"}],"status":"frontier","summary":"PMID 42682491 \"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort\" (CC BY, first published 2026-08-18) reports: \"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42650730","kind":"claim","label":"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42650730"]},"sources":[{"id":"source.frontier.pmid-42650730","title":"Europe PMC record PMID 42650730: Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42650730%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15080806","title":"doi:10.3390/antibiotics15080806","url":"https://doi.org/10.3390/antibiotics15080806"}],"status":"frontier","summary":"PMID 42650730 \"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection\" (CC BY, first published 2026-08-18) reports: \"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42612575","kind":"claim","label":"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42612575"]},"sources":[{"id":"source.frontier.pmid-42612575","title":"Europe PMC record PMID 42612575: Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42612575%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.jacbts.2026.101655","title":"doi:10.1016/j.jacbts.2026.101655","url":"https://doi.org/10.1016/j.jacbts.2026.101655"}],"status":"frontier","summary":"PMID 42612575 \"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response\" (CC BY, first published 2026-08-18) reports: \"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42611865","kind":"claim","label":"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42611865"]},"sources":[{"id":"source.frontier.pmid-42611865","title":"Europe PMC record PMID 42611865: Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42611865%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356286","title":"doi:10.1371/journal.pone.0356286","url":"https://doi.org/10.1371/journal.pone.0356286"}],"status":"frontier","summary":"PMID 42611865 \"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease\" (CC BY, first published 2026-08-18) reports: \"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42751534","kind":"claim","label":"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42751534"]},"sources":[{"id":"source.frontier.pmid-42751534","title":"Europe PMC record PMID 42751534: Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42751534%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114648","title":"doi:10.7759/cureus.114648","url":"https://doi.org/10.7759/cureus.114648"}],"status":"frontier","summary":"PMID 42751534 \"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement\" (CC BY, first published 2026-08-17) reports: \"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42676491","kind":"claim","label":"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42676491"]},"sources":[{"id":"source.frontier.pmid-42676491","title":"Europe PMC record PMID 42676491: Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42676491%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1845591","title":"doi:10.3389/fimmu.2026.1845591","url":"https://doi.org/10.3389/fimmu.2026.1845591"}],"status":"frontier","summary":"PMID 42676491 \"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis\" (CC BY, first published 2026-08-17) reports: \"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652751","kind":"claim","label":"Psychological Factors to Consider in Treating Patients with Acne Vulgaris","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42652751"]},"sources":[{"id":"source.frontier.pmid-42652751","title":"Europe PMC record PMID 42652751: Psychological Factors to Consider in Treating Patients with Acne Vulgaris","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652751%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15166347","title":"doi:10.3390/jcm15166347","url":"https://doi.org/10.3390/jcm15166347"}],"status":"frontier","summary":"PMID 42652751 \"Psychological Factors to Consider in Treating Patients with Acne Vulgaris\" (CC BY, first published 2026-08-17) reports: \"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42609599","kind":"claim","label":"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42609599"]},"sources":[{"id":"source.frontier.pmid-42609599","title":"Europe PMC record PMID 42609599: Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42609599%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/carm/8244011","title":"doi:10.1155/carm/8244011","url":"https://doi.org/10.1155/carm/8244011"}],"status":"frontier","summary":"PMID 42609599 \"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report\" (CC BY, first published 2026-08-17) reports: \"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746465","kind":"claim","label":"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-16","source_ids":["source.frontier.pmid-42746465"]},"sources":[{"id":"source.frontier.pmid-42746465","title":"Europe PMC record PMID 42746465: Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort S","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746465%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114615","title":"doi:10.7759/cureus.114615","url":"https://doi.org/10.7759/cureus.114615"}],"status":"frontier","summary":"PMID 42746465 \"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta\" (CC BY, first published 2026-08-16) reports: \"The condition was associated with prolonged hospital stay and substantial infectious complications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746333","kind":"claim","label":"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-16","source_ids":["source.frontier.pmid-42746333"]},"sources":[{"id":"source.frontier.pmid-42746333","title":"Europe PMC record PMID 42746333: Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746333%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114602","title":"doi:10.7759/cureus.114602","url":"https://doi.org/10.7759/cureus.114602"}],"status":"frontier","summary":"PMID 42746333 \"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp\" (CC BY, first published 2026-08-16) reports: \"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42741475","kind":"claim","label":"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-15","source_ids":["source.frontier.pmid-42741475"]},"sources":[{"id":"source.frontier.pmid-42741475","title":"Europe PMC record PMID 42741475: Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741475%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114568","title":"doi:10.7759/cureus.114568","url":"https://doi.org/10.7759/cureus.114568"}],"status":"frontier","summary":"PMID 42741475 \"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung\" (CC BY, first published 2026-08-15) reports: \"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728996","kind":"claim","label":"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42728996"]},"sources":[{"id":"source.frontier.pmid-42728996","title":"Europe PMC record PMID 42728996: Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728996%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.179376.3","title":"doi:10.12688/f1000research.179376.3","url":"https://doi.org/10.12688/f1000research.179376.3"}],"status":"frontier","summary":"PMID 42728996 \"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy\" (CC BY, first published 2026-08-14) reports: \"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42666182","kind":"claim","label":"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42666182"]},"sources":[{"id":"source.frontier.pmid-42666182","title":"Europe PMC record PMID 42666182: Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42666182%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1878305","title":"doi:10.3389/fmed.2026.1878305","url":"https://doi.org/10.3389/fmed.2026.1878305"}],"status":"frontier","summary":"PMID 42666182 \"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report\" (CC BY, first published 2026-08-14) reports: \"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599952","kind":"claim","label":"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599952"]},"sources":[{"id":"source.frontier.pmid-42599952","title":"Europe PMC record PMID 42599952: Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599952%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014624","title":"doi:10.1371/journal.pntd.0014624","url":"https://doi.org/10.1371/journal.pntd.0014624"}],"status":"frontier","summary":"PMID 42599952 \"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study\" (CC BY, first published 2026-08-14) reports: \"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599899","kind":"claim","label":"Determinants of instructional leadership: A survey of public secondary schools","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599899"]},"sources":[{"id":"source.frontier.pmid-42599899","title":"Europe PMC record PMID 42599899: Determinants of instructional leadership: A survey of public secondary schools","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599899%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355674","title":"doi:10.1371/journal.pone.0355674","url":"https://doi.org/10.1371/journal.pone.0355674"}],"status":"frontier","summary":"PMID 42599899 \"Determinants of instructional leadership: A survey of public secondary schools\" (CC BY, first published 2026-08-14) reports: \"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599850","kind":"claim","label":"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599850"]},"sources":[{"id":"source.frontier.pmid-42599850","title":"Europe PMC record PMID 42599850: The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599850%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355296","title":"doi:10.1371/journal.pone.0355296","url":"https://doi.org/10.1371/journal.pone.0355296"}],"status":"frontier","summary":"PMID 42599850 \"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol\" (CC BY, first published 2026-08-14) reports: \"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42732322","kind":"claim","label":"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42732322"]},"sources":[{"id":"source.frontier.pmid-42732322","title":"Europe PMC record PMID 42732322: Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732322%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114487","title":"doi:10.7759/cureus.114487","url":"https://doi.org/10.7759/cureus.114487"}],"status":"frontier","summary":"PMID 42732322 \"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report\" (CC BY, first published 2026-08-13) reports: \"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661822","kind":"claim","label":"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42661822"]},"sources":[{"id":"source.frontier.pmid-42661822","title":"Europe PMC record PMID 42661822: Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median ar","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661822%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1884767","title":"doi:10.3389/fmed.2026.1884767","url":"https://doi.org/10.3389/fmed.2026.1884767"}],"status":"frontier","summary":"PMID 42661822 \"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome\" (CC BY, first published 2026-08-13) reports: \"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661658","kind":"claim","label":"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42661658"]},"sources":[{"id":"source.frontier.pmid-42661658","title":"Europe PMC record PMID 42661658: Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal m","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661658%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1906024","title":"doi:10.3389/fimmu.2026.1906024","url":"https://doi.org/10.3389/fimmu.2026.1906024"}],"status":"frontier","summary":"PMID 42661658 \"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa\" (CC BY, first published 2026-08-13) reports: \"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652200","kind":"claim","label":"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42652200"]},"sources":[{"id":"source.frontier.pmid-42652200","title":"Europe PMC record PMID 42652200: Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652200%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biomedicines14081818","title":"doi:10.3390/biomedicines14081818","url":"https://doi.org/10.3390/biomedicines14081818"}],"status":"frontier","summary":"PMID 42652200 \"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer\" (CC BY, first published 2026-08-13) reports: \"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42595314","kind":"claim","label":"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42595314"]},"sources":[{"id":"source.frontier.pmid-42595314","title":"Europe PMC record PMID 42595314: Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42595314%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1055/s-0046-1827064","title":"doi:10.1055/s-0046-1827064","url":"https://doi.org/10.1055/s-0046-1827064"}],"status":"frontier","summary":"PMID 42595314 \"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort\" (CC BY, first published 2026-08-13) reports: \"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42594273","kind":"claim","label":"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42594273"]},"sources":[{"id":"source.frontier.pmid-42594273","title":"Europe PMC record PMID 42594273: Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42594273%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/104572","title":"doi:10.2196/104572","url":"https://doi.org/10.2196/104572"}],"status":"frontier","summary":"PMID 42594273 \"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer\" (CC BY, first published 2026-08-13) reports: \"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763558","kind":"claim","label":"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42763558"]},"sources":[{"id":"source.frontier.pmid-42763558","title":"Europe PMC record PMID 42763558: Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763558%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/ofid/ofag496","title":"doi:10.1093/ofid/ofag496","url":"https://doi.org/10.1093/ofid/ofag496"}],"status":"frontier","summary":"PMID 42763558 \"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center\" (CC BY, first published 2026-08-12) reports: \"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42733890","kind":"claim","label":"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42733890"]},"sources":[{"id":"source.frontier.pmid-42733890","title":"Europe PMC record PMID 42733890: Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42733890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114445","title":"doi:10.7759/cureus.114445","url":"https://doi.org/10.7759/cureus.114445"}],"status":"frontier","summary":"PMID 42733890 \"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction\" (CC BY, first published 2026-08-12) reports: \"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656672","kind":"claim","label":"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656672"]},"sources":[{"id":"source.frontier.pmid-42656672","title":"Europe PMC record PMID 42656672: A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based populat","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656672%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1901723","title":"doi:10.3389/fphar.2026.1901723","url":"https://doi.org/10.3389/fphar.2026.1901723"}],"status":"frontier","summary":"PMID 42656672 \"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population\" (CC BY, first published 2026-08-12) reports: \"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656481","kind":"claim","label":"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656481"]},"sources":[{"id":"source.frontier.pmid-42656481","title":"Europe PMC record PMID 42656481: Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656481%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1906103","title":"doi:10.3389/fpsyt.2026.1906103","url":"https://doi.org/10.3389/fpsyt.2026.1906103"}],"status":"frontier","summary":"PMID 42656481 \"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis\" (CC BY, first published 2026-08-12) reports: \"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656460","kind":"claim","label":"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656460"]},"sources":[{"id":"source.frontier.pmid-42656460","title":"Europe PMC record PMID 42656460: Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656460%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1899147","title":"doi:10.3389/fcimb.2026.1899147","url":"https://doi.org/10.3389/fcimb.2026.1899147"}],"status":"frontier","summary":"PMID 42656460 \"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming\" (CC BY, first published 2026-08-12) reports: \"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42585261","kind":"claim","label":"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42585261"]},"sources":[{"id":"source.frontier.pmid-42585261","title":"Europe PMC record PMID 42585261: REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585261%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1013017","title":"doi:10.1371/journal.pcbi.1013017","url":"https://doi.org/10.1371/journal.pcbi.1013017"}],"status":"frontier","summary":"PMID 42585261 \"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories\" (CC BY, first published 2026-08-12) reports: \"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42585188","kind":"claim","label":"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42585188"]},"sources":[{"id":"source.frontier.pmid-42585188","title":"Europe PMC record PMID 42585188: Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585188%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355745","title":"doi:10.1371/journal.pone.0355745","url":"https://doi.org/10.1371/journal.pone.0355745"}],"status":"frontier","summary":"PMID 42585188 \"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens\" (CC BY, first published 2026-08-12) reports: \"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42584423","kind":"claim","label":"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42584423"]},"sources":[{"id":"source.frontier.pmid-42584423","title":"Europe PMC record PMID 42584423: Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42584423%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/advs.77094","title":"doi:10.1002/advs.77094","url":"https://doi.org/10.1002/advs.77094"}],"status":"frontier","summary":"PMID 42584423 \"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation\" (CC BY, first published 2026-08-12) reports: \"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42725211","kind":"claim","label":"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42725211"]},"sources":[{"id":"source.frontier.pmid-42725211","title":"Europe PMC record PMID 42725211: Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess:","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725211%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114353","title":"doi:10.7759/cureus.114353","url":"https://doi.org/10.7759/cureus.114353"}],"status":"frontier","summary":"PMID 42725211 \"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42649901","kind":"claim","label":"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42649901"]},"sources":[{"id":"source.frontier.pmid-42649901","title":"Europe PMC record PMID 42649901: Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42649901%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/cancers18162587","title":"doi:10.3390/cancers18162587","url":"https://doi.org/10.3390/cancers18162587"}],"status":"frontier","summary":"PMID 42649901 \"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions\" (CC BY, first published 2026-08-11) reports: \"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42644024","kind":"claim","label":"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42644024"]},"sources":[{"id":"source.frontier.pmid-42644024","title":"Europe PMC record PMID 42644024: Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> varian","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42644024%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fped.2026.1913335","title":"doi:10.3389/fped.2026.1913335","url":"https://doi.org/10.3389/fped.2026.1913335"}],"status":"frontier","summary":"PMID 42644024 \"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42578673","kind":"claim","label":"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42578673"]},"sources":[{"id":"source.frontier.pmid-42578673","title":"Europe PMC record PMID 42578673: Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578673%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00528-26","title":"doi:10.1128/spectrum.00528-26","url":"https://doi.org/10.1128/spectrum.00528-26"}],"status":"frontier","summary":"PMID 42578673 \"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use\" (CC BY, first published 2026-08-11) reports: \"A balanced microbiome is associated with favorable health outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42578670","kind":"claim","label":"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42578670"]},"sources":[{"id":"source.frontier.pmid-42578670","title":"Europe PMC record PMID 42578670: Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578670%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.03153-24","title":"doi:10.1128/spectrum.03153-24","url":"https://doi.org/10.1128/spectrum.03153-24"}],"status":"frontier","summary":"PMID 42578670 \"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis\" (CC BY, first published 2026-08-11) reports: \"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42651890","kind":"claim","label":"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42651890"]},"sources":[{"id":"source.frontier.pmid-42651890","title":"Europe PMC record PMID 42651890: The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ani16162486","title":"doi:10.3390/ani16162486","url":"https://doi.org/10.3390/ani16162486"}],"status":"frontier","summary":"PMID 42651890 \"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats\" (CC BY, first published 2026-08-10) reports: \"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42639105","kind":"claim","label":"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42639105"]},"sources":[{"id":"source.frontier.pmid-42639105","title":"Europe PMC record PMID 42639105: An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42639105%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1838657","title":"doi:10.3389/fimmu.2026.1838657","url":"https://doi.org/10.3389/fimmu.2026.1838657"}],"status":"frontier","summary":"PMID 42639105 \"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity\" (CC BY, first published 2026-08-10) reports: \"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42638898","kind":"claim","label":"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42638898"]},"sources":[{"id":"source.frontier.pmid-42638898","title":"Europe PMC record PMID 42638898: Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42638898%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1866924","title":"doi:10.3389/fcimb.2026.1866924","url":"https://doi.org/10.3389/fcimb.2026.1866924"}],"status":"frontier","summary":"PMID 42638898 \"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation\" (CC BY, first published 2026-08-10) reports: \"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42577546","kind":"claim","label":"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-09","source_ids":["source.frontier.pmid-42577546"]},"sources":[{"id":"source.frontier.pmid-42577546","title":"Europe PMC record PMID 42577546: Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42577546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/mco2.70907","title":"doi:10.1002/mco2.70907","url":"https://doi.org/10.1002/mco2.70907"}],"status":"frontier","summary":"PMID 42577546 \"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection\" (CC BY, first published 2026-08-09) reports: \"Cluster C3 was associated with poor prognosis and reduced survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728921","kind":"claim","label":"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-08","source_ids":["source.frontier.pmid-42728921"]},"sources":[{"id":"source.frontier.pmid-42728921","title":"Europe PMC record PMID 42728921: Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing &","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728921%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.171577.2","title":"doi:10.12688/f1000research.171577.2","url":"https://doi.org/10.12688/f1000research.171577.2"}],"status":"frontier","summary":"PMID 42728921 \"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector\" (CC BY, first published 2026-08-08) reports: \"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42630507","kind":"claim","label":"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42630507"]},"sources":[{"id":"source.frontier.pmid-42630507","title":"Europe PMC record PMID 42630507: Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42630507%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1879544","title":"doi:10.3389/fimmu.2026.1879544","url":"https://doi.org/10.3389/fimmu.2026.1879544"}],"status":"frontier","summary":"PMID 42630507 \"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming\" (CC BY, first published 2026-08-07) reports: \"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42571083","kind":"claim","label":"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42571083"]},"sources":[{"id":"source.frontier.pmid-42571083","title":"Europe PMC record PMID 42571083: Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42571083%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74115","title":"doi:10.1002/ece3.74115","url":"https://doi.org/10.1002/ece3.74115"}],"status":"frontier","summary":"PMID 42571083 \"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations\" (CC BY, first published 2026-08-07) reports: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42566407","kind":"claim","label":"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42566407"]},"sources":[{"id":"source.frontier.pmid-42566407","title":"Europe PMC record PMID 42566407: Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42566407%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355612","title":"doi:10.1371/journal.pone.0355612","url":"https://doi.org/10.1371/journal.pone.0355612"}],"status":"frontier","summary":"PMID 42566407 \"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study\" (CC BY, first published 2026-08-07) reports: \"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42588195","kind":"claim","label":"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42588195"]},"sources":[{"id":"source.frontier.pmid-42588195","title":"Europe PMC record PMID 42588195: Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Sing","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42588195%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/nu18152572","title":"doi:10.3390/nu18152572","url":"https://doi.org/10.3390/nu18152572"}],"status":"frontier","summary":"PMID 42588195 \"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study\" (CC BY, first published 2026-08-06) reports: \"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560943","kind":"claim","label":"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42560943"]},"sources":[{"id":"source.frontier.pmid-42560943","title":"Europe PMC record PMID 42560943: Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560943%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0353490","title":"doi:10.1371/journal.pone.0353490","url":"https://doi.org/10.1371/journal.pone.0353490"}],"status":"frontier","summary":"PMID 42560943 \"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model\" (CC BY, first published 2026-08-06) reports: \"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560043","kind":"claim","label":"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42560043"]},"sources":[{"id":"source.frontier.pmid-42560043","title":"Europe PMC record PMID 42560043: Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560043%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00371-26","title":"doi:10.1128/msystems.00371-26","url":"https://doi.org/10.1128/msystems.00371-26"}],"status":"frontier","summary":"PMID 42560043 \"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots\" (CC BY, first published 2026-08-06) reports: \"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42569382","kind":"claim","label":"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42569382"]},"sources":[{"id":"source.frontier.pmid-42569382","title":"Europe PMC record PMID 42569382: The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42569382%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.18332/tid/225461","title":"doi:10.18332/tid/225461","url":"https://doi.org/10.18332/tid/225461"}],"status":"frontier","summary":"PMID 42569382 \"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study\" (CC BY, first published 2026-08-05) reports: \"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42554464","kind":"claim","label":"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42554464"]},"sources":[{"id":"source.frontier.pmid-42554464","title":"Europe PMC record PMID 42554464: The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42554464%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/mbio.00360-26","title":"doi:10.1128/mbio.00360-26","url":"https://doi.org/10.1128/mbio.00360-26"}],"status":"frontier","summary":"PMID 42554464 \"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>\" (CC BY, first published 2026-08-05) reports: \"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42528383","kind":"claim","label":"The mycobacterial selenocysteine machinery: presence and expression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42528383"]},"sources":[{"id":"source.frontier.pmid-42528383","title":"Europe PMC record PMID 42528383: The mycobacterial selenocysteine machinery: presence and expression","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42528383%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/15476286.2026.2712054","title":"doi:10.1080/15476286.2026.2712054","url":"https://doi.org/10.1080/15476286.2026.2712054"}],"status":"frontier","summary":"PMID 42528383 \"The mycobacterial selenocysteine machinery: presence and expression\" (CC BY, first published 2026-08-05) reports: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42589669","kind":"claim","label":"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.pmid-42589669"]},"sources":[{"id":"source.frontier.pmid-42589669","title":"Europe PMC record PMID 42589669: Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42589669%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27157016","title":"doi:10.3390/ijms27157016","url":"https://doi.org/10.3390/ijms27157016"}],"status":"frontier","summary":"PMID 42589669 \"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes\" (CC BY, first published 2026-08-04) reports: \"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42590131","kind":"claim","label":"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.pmid-42590131"]},"sources":[{"id":"source.frontier.pmid-42590131","title":"Europe PMC record PMID 42590131: Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42590131%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15156029","title":"doi:10.3390/jcm15156029","url":"https://doi.org/10.3390/jcm15156029"}],"status":"frontier","summary":"PMID 42590131 \"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study\" (CC BY, first published 2026-08-03) reports: \": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42545021","kind":"claim","label":"Diversity and sources of floral microbial communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.pmid-42545021"]},"sources":[{"id":"source.frontier.pmid-42545021","title":"Europe PMC record PMID 42545021: Diversity and sources of floral microbial communities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42545021%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/aem.00323-26","title":"doi:10.1128/aem.00323-26","url":"https://doi.org/10.1128/aem.00323-26"}],"status":"frontier","summary":"PMID 42545021 \"Diversity and sources of floral microbial communities\" (CC BY, first published 2026-08-03) reports: \"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42549006","kind":"claim","label":"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.pmid-42549006"]},"sources":[{"id":"source.frontier.pmid-42549006","title":"Europe PMC record PMID 42549006: The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42549006%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/ijod/7239600","title":"doi:10.1155/ijod/7239600","url":"https://doi.org/10.1155/ijod/7239600"}],"status":"frontier","summary":"PMID 42549006 \"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis\" (CC BY, first published 2026-08-02) reports: \"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42606346","kind":"claim","label":"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42606346"]},"sources":[{"id":"source.frontier.pmid-42606346","title":"Europe PMC record PMID 42606346: The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42606346%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70511","title":"doi:10.1111/mec.70511","url":"https://doi.org/10.1111/mec.70511"}],"status":"frontier","summary":"PMID 42606346 \"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect\" (CC BY, first published 2026-08-01) reports: \"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560857","kind":"claim","label":"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42560857"]},"sources":[{"id":"source.frontier.pmid-42560857","title":"Europe PMC record PMID 42560857: The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560857%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/ejcts/ezag207","title":"doi:10.1093/ejcts/ezag207","url":"https://doi.org/10.1093/ejcts/ezag207"}],"status":"frontier","summary":"PMID 42560857 \"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery\" (CC BY, first published 2026-08-01) reports: \"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42550924","kind":"claim","label":"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42550924"]},"sources":[{"id":"source.frontier.pmid-42550924","title":"Europe PMC record PMID 42550924: Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42550924%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plphys/kiag572","title":"doi:10.1093/plphys/kiag572","url":"https://doi.org/10.1093/plphys/kiag572"}],"status":"frontier","summary":"PMID 42550924 \"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination\" (CC BY, first published 2026-08-01) reports: \"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42520407","kind":"claim","label":"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42520407"]},"sources":[{"id":"source.frontier.pmid-42520407","title":"Europe PMC record PMID 42520407: The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42520407%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plcell/koag224","title":"doi:10.1093/plcell/koag224","url":"https://doi.org/10.1093/plcell/koag224"}],"status":"frontier","summary":"PMID 42520407 \"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology\" (CC BY, first published 2026-08-01) reports: \"Our data highlight the activation of quiescence and homeostatic programs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42489250","kind":"claim","label":"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42489250"]},"sources":[{"id":"source.frontier.pmid-42489250","title":"Europe PMC record PMID 42489250: NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489250%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/gbe/evag185","title":"doi:10.1093/gbe/evag185","url":"https://doi.org/10.1093/gbe/evag185"}],"status":"frontier","summary":"PMID 42489250 \"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex\" (CC BY, first published 2026-08-01) reports: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42470282","kind":"claim","label":"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42470282"]},"sources":[{"id":"source.frontier.pmid-42470282","title":"Europe PMC record PMID 42470282: Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42470282%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plphys/kiag525","title":"doi:10.1093/plphys/kiag525","url":"https://doi.org/10.1093/plphys/kiag525"}],"status":"frontier","summary":"PMID 42470282 \"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues\" (CC BY, first published 2026-08-01) reports: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42538349","kind":"claim","label":"Global trade responses to shark finning regulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.pmid-42538349"]},"sources":[{"id":"source.frontier.pmid-42538349","title":"Europe PMC record PMID 42538349: Global trade responses to shark finning regulations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42538349%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-75625-1","title":"doi:10.1038/s41467-026-75625-1","url":"https://doi.org/10.1038/s41467-026-75625-1"}],"status":"frontier","summary":"PMID 42538349 \"Global trade responses to shark finning regulations\" (CC BY, first published 2026-07-31) reports: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42536671","kind":"claim","label":"NLCD: A method to discover nonlinear causal relations among genes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.pmid-42536671"]},"sources":[{"id":"source.frontier.pmid-42536671","title":"Europe PMC record PMID 42536671: NLCD: A method to discover nonlinear causal relations among genes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42536671%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014570","title":"doi:10.1371/journal.pcbi.1014570","url":"https://doi.org/10.1371/journal.pcbi.1014570"}],"status":"frontier","summary":"PMID 42536671 \"NLCD: A method to discover nonlinear causal relations among genes\" (CC BY, first published 2026-07-31) reports: \"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42597521","kind":"claim","label":"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42597521"]},"sources":[{"id":"source.frontier.pmid-42597521","title":"Europe PMC record PMID 42597521: Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42597521%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/frhs.2026.1816682","title":"doi:10.3389/frhs.2026.1816682","url":"https://doi.org/10.3389/frhs.2026.1816682"}],"status":"frontier","summary":"PMID 42597521 \"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study\" (CC BY, first published 2026-07-30) reports: \"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531275","kind":"claim","label":"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531275"]},"sources":[{"id":"source.frontier.pmid-42531275","title":"Europe PMC record PMID 42531275: Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-metho","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531275%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354470","title":"doi:10.1371/journal.pone.0354470","url":"https://doi.org/10.1371/journal.pone.0354470"}],"status":"frontier","summary":"PMID 42531275 \"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting\" (CC BY, first published 2026-07-30) reports: \"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531267","kind":"claim","label":"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531267"]},"sources":[{"id":"source.frontier.pmid-42531267","title":"Europe PMC record PMID 42531267: Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Childr","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531267%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006694","title":"doi:10.1371/journal.pgph.0006694","url":"https://doi.org/10.1371/journal.pgph.0006694"}],"status":"frontier","summary":"PMID 42531267 \"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)\" (CC BY, first published 2026-07-30) reports: \"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531261","kind":"claim","label":"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531261"]},"sources":[{"id":"source.frontier.pmid-42531261","title":"Europe PMC record PMID 42531261: Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531261%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006629","title":"doi:10.1371/journal.pgph.0006629","url":"https://doi.org/10.1371/journal.pgph.0006629"}],"status":"frontier","summary":"PMID 42531261 \"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi\" (CC BY, first published 2026-07-30) reports: \"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531248","kind":"claim","label":"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531248"]},"sources":[{"id":"source.frontier.pmid-42531248","title":"Europe PMC record PMID 42531248: Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531248%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355164","title":"doi:10.1371/journal.pone.0355164","url":"https://doi.org/10.1371/journal.pone.0355164"}],"status":"frontier","summary":"PMID 42531248 \"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study\" (CC BY, first published 2026-07-30) reports: \"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531221","kind":"claim","label":"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531221"]},"sources":[{"id":"source.frontier.pmid-42531221","title":"Europe PMC record PMID 42531221: Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531221%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354745","title":"doi:10.1371/journal.pone.0354745","url":"https://doi.org/10.1371/journal.pone.0354745"}],"status":"frontier","summary":"PMID 42531221 \"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids\" (CC BY, first published 2026-07-30) reports: \"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42533345","kind":"claim","label":"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.pmid-42533345"]},"sources":[{"id":"source.frontier.pmid-42533345","title":"Europe PMC record PMID 42533345: Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42533345%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12915-026-02688-3","title":"doi:10.1186/s12915-026-02688-3","url":"https://doi.org/10.1186/s12915-026-02688-3"}],"status":"frontier","summary":"PMID 42533345 \"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes\" (CC BY, first published 2026-07-29) reports: \"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652430","kind":"claim","label":"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.pmid-42652430"]},"sources":[{"id":"source.frontier.pmid-42652430","title":"Europe PMC record PMID 42652430: Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts o","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652430%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/insects17080775","title":"doi:10.3390/insects17080775","url":"https://doi.org/10.3390/insects17080775"}],"status":"frontier","summary":"PMID 42652430 \"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation\" (CC BY, first published 2026-07-27) reports: \"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42507643","kind":"claim","label":"Enhancing missense variant classification in predicted intrinsically disordered regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.pmid-42507643"]},"sources":[{"id":"source.frontier.pmid-42507643","title":"Europe PMC record PMID 42507643: Enhancing missense variant classification in predicted intrinsically disordered regions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42507643%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354365","title":"doi:10.1371/journal.pone.0354365","url":"https://doi.org/10.1371/journal.pone.0354365"}],"status":"frontier","summary":"PMID 42507643 \"Enhancing missense variant classification in predicted intrinsically disordered regions\" (CC BY, first published 2026-07-27) reports: \"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42565205","kind":"claim","label":"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.pmid-42565205"]},"sources":[{"id":"source.frontier.pmid-42565205","title":"Europe PMC record PMID 42565205: The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42565205%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fgene.2026.1822823","title":"doi:10.3389/fgene.2026.1822823","url":"https://doi.org/10.3389/fgene.2026.1822823"}],"status":"frontier","summary":"PMID 42565205 \"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease\" (CC BY, first published 2026-07-24) reports: \"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42497150","kind":"claim","label":"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.pmid-42497150"]},"sources":[{"id":"source.frontier.pmid-42497150","title":"Europe PMC record PMID 42497150: Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cro","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42497150%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0349072","title":"doi:10.1371/journal.pone.0349072","url":"https://doi.org/10.1371/journal.pone.0349072"}],"status":"frontier","summary":"PMID 42497150 \"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study\" (CC BY, first published 2026-07-24) reports: \"The data revealed a high fertility desire (88.9%) among the YWLHIV.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42723771","kind":"claim","label":"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42723771"]},"sources":[{"id":"source.frontier.pmid-42723771","title":"Europe PMC record PMID 42723771: Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42723771%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/openreseurope.23373.2","title":"doi:10.12688/openreseurope.23373.2","url":"https://doi.org/10.12688/openreseurope.23373.2"}],"status":"frontier","summary":"PMID 42723771 \"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment\" (CC BY, first published 2026-07-23) reports: \"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42493198","kind":"claim","label":"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42493198"]},"sources":[{"id":"source.frontier.pmid-42493198","title":"Europe PMC record PMID 42493198: Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42493198%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/openhrt-2026-004136","title":"doi:10.1136/openhrt-2026-004136","url":"https://doi.org/10.1136/openhrt-2026-004136"}],"status":"frontier","summary":"PMID 42493198 \"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial\" (CC BY, first published 2026-07-23) reports: \"We found no interactions for age, sex or education.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42489485","kind":"claim","label":"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42489485"]},"sources":[{"id":"source.frontier.pmid-42489485","title":"Europe PMC record PMID 42489485: AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489485%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/mbio.01295-26","title":"doi:10.1128/mbio.01295-26","url":"https://doi.org/10.1128/mbio.01295-26"}],"status":"frontier","summary":"PMID 42489485 \"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts\" (CC BY, first published 2026-07-23) reports: \"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42485395","kind":"claim","label":"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42485395"]},"sources":[{"id":"source.frontier.pmid-42485395","title":"Europe PMC record PMID 42485395: Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485395%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006877","title":"doi:10.1371/journal.pgph.0006877","url":"https://doi.org/10.1371/journal.pgph.0006877"}],"status":"frontier","summary":"PMID 42485395 \"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024\" (CC BY, first published 2026-07-22) reports: \"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42485283","kind":"claim","label":"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42485283"]},"sources":[{"id":"source.frontier.pmid-42485283","title":"Europe PMC record PMID 42485283: Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485283%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0352857","title":"doi:10.1371/journal.pone.0352857","url":"https://doi.org/10.1371/journal.pone.0352857"}],"status":"frontier","summary":"PMID 42485283 \"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis\" (CC BY, first published 2026-07-22) reports: \"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42484337","kind":"claim","label":"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42484337"]},"sources":[{"id":"source.frontier.pmid-42484337","title":"Europe PMC record PMID 42484337: Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42484337%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00441-26","title":"doi:10.1128/spectrum.00441-26","url":"https://doi.org/10.1128/spectrum.00441-26"}],"status":"frontier","summary":"PMID 42484337 \"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert\" (CC BY, first published 2026-07-22) reports: \"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42553384","kind":"claim","label":"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42553384"]},"sources":[{"id":"source.frontier.pmid-42553384","title":"Europe PMC record PMID 42553384: Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadf","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553384%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/ffunb.2026.1894067","title":"doi:10.3389/ffunb.2026.1894067","url":"https://doi.org/10.3389/ffunb.2026.1894067"}],"status":"frontier","summary":"PMID 42553384 \"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins\" (CC BY, first published 2026-07-21) reports: \"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42553105","kind":"claim","label":"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42553105"]},"sources":[{"id":"source.frontier.pmid-42553105","title":"Europe PMC record PMID 42553105: Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553105%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1858031","title":"doi:10.3389/fneur.2026.1858031","url":"https://doi.org/10.3389/fneur.2026.1858031"}],"status":"frontier","summary":"PMID 42553105 \"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease\" (CC BY, first published 2026-07-21) reports: \"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42480918","kind":"claim","label":"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42480918"]},"sources":[{"id":"source.frontier.pmid-42480918","title":"Europe PMC record PMID 42480918: Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42480918%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3168/jds.2026-28569","title":"doi:10.3168/jds.2026-28569","url":"https://doi.org/10.3168/jds.2026-28569"}],"status":"frontier","summary":"PMID 42480918 \"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation\" (CC BY, first published 2026-07-21) reports: \"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42467705","kind":"claim","label":"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.pmid-42467705"]},"sources":[{"id":"source.frontier.pmid-42467705","title":"Europe PMC record PMID 42467705: Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42467705%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0353117","title":"doi:10.1371/journal.pone.0353117","url":"https://doi.org/10.1371/journal.pone.0353117"}],"status":"frontier","summary":"PMID 42467705 \"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis\" (CC BY, first published 2026-07-17) reports: \"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42534899","kind":"claim","label":"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42534899"]},"sources":[{"id":"source.frontier.pmid-42534899","title":"Europe PMC record PMID 42534899: Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42534899%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1833734","title":"doi:10.3389/fcimb.2026.1833734","url":"https://doi.org/10.3389/fcimb.2026.1833734"}],"status":"frontier","summary":"PMID 42534899 \"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments\" (CC BY, first published 2026-07-16) reports: \"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42462719","kind":"claim","label":"Evolutionary radiation of Polaromonas from mountain glaciers downstream","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42462719"]},"sources":[{"id":"source.frontier.pmid-42462719","title":"Europe PMC record PMID 42462719: Evolutionary radiation of Polaromonas from mountain glaciers downstream","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42462719%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.cub.2026.06.070","title":"doi:10.1016/j.cub.2026.06.070","url":"https://doi.org/10.1016/j.cub.2026.06.070"}],"status":"frontier","summary":"PMID 42462719 \"Evolutionary radiation of Polaromonas from mountain glaciers downstream\" (CC BY, first published 2026-07-16) reports: \"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42461951","kind":"claim","label":"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42461951"]},"sources":[{"id":"source.frontier.pmid-42461951","title":"Europe PMC record PMID 42461951: Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42461951%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012245","title":"doi:10.1371/journal.pgen.1012245","url":"https://doi.org/10.1371/journal.pgen.1012245"}],"status":"frontier","summary":"PMID 42461951 \"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization\" (CC BY, first published 2026-07-16) reports: \"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42529330","kind":"claim","label":"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42529330"]},"sources":[{"id":"source.frontier.pmid-42529330","title":"Europe PMC record PMID 42529330: Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42529330%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1858069","title":"doi:10.3389/fcimb.2026.1858069","url":"https://doi.org/10.3389/fcimb.2026.1858069"}],"status":"frontier","summary":"PMID 42529330 \"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery\" (CC BY, first published 2026-07-15) reports: \"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42458577","kind":"claim","label":"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42458577"]},"sources":[{"id":"source.frontier.pmid-42458577","title":"Europe PMC record PMID 42458577: Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42458577%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13100-026-00411-1","title":"doi:10.1186/s13100-026-00411-1","url":"https://doi.org/10.1186/s13100-026-00411-1"}],"status":"frontier","summary":"PMID 42458577 \"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development\" (CC BY, first published 2026-07-15) reports: \"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42455014","kind":"claim","label":"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42455014"]},"sources":[{"id":"source.frontier.pmid-42455014","title":"Europe PMC record PMID 42455014: Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42455014%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/jb.00023-26","title":"doi:10.1128/jb.00023-26","url":"https://doi.org/10.1128/jb.00023-26"}],"status":"frontier","summary":"PMID 42455014 \"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon\" (CC BY, first published 2026-07-15) reports: \"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42454934","kind":"claim","label":"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42454934"]},"sources":[{"id":"source.frontier.pmid-42454934","title":"Europe PMC record PMID 42454934: MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42454934%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00308-26","title":"doi:10.1128/msystems.00308-26","url":"https://doi.org/10.1128/msystems.00308-26"}],"status":"frontier","summary":"PMID 42454934 \"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes\" (CC BY, first published 2026-07-15) reports: \"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42491728","kind":"claim","label":"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.pmid-42491728"]},"sources":[{"id":"source.frontier.pmid-42491728","title":"Europe PMC record PMID 42491728: Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42491728%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7717/peerj.21488","title":"doi:10.7717/peerj.21488","url":"https://doi.org/10.7717/peerj.21488"}],"status":"frontier","summary":"PMID 42491728 \"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis\" (CC BY, first published 2026-07-14) reports: \"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42516974","kind":"claim","label":"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42516974"]},"sources":[{"id":"source.frontier.pmid-42516974","title":"Europe PMC record PMID 42516974: Silent witnesses: basidiomycota as forensic biomarkers in human decomposition","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42516974%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmicb.2026.1774584","title":"doi:10.3389/fmicb.2026.1774584","url":"https://doi.org/10.3389/fmicb.2026.1774584"}],"status":"frontier","summary":"PMID 42516974 \"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition\" (CC BY, first published 2026-07-13) reports: \"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42441853","kind":"claim","label":"Evolutionary innovation through fusion of sequences from across the tree of life","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42441853"]},"sources":[{"id":"source.frontier.pmid-42441853","title":"Europe PMC record PMID 42441853: Evolutionary innovation through fusion of sequences from across the tree of life","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42441853%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1073/pnas.2602557123","title":"doi:10.1073/pnas.2602557123","url":"https://doi.org/10.1073/pnas.2602557123"}],"status":"frontier","summary":"PMID 42441853 \"Evolutionary innovation through fusion of sequences from across the tree of life\" (CC BY, first published 2026-07-13) reports: \"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42439519","kind":"claim","label":"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42439519"]},"sources":[{"id":"source.frontier.pmid-42439519","title":"Europe PMC record PMID 42439519: Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42439519%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/aem.00728-26","title":"doi:10.1128/aem.00728-26","url":"https://doi.org/10.1128/aem.00728-26"}],"status":"frontier","summary":"PMID 42439519 \"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>\" (CC BY, first published 2026-07-13) reports: \"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42429610","kind":"claim","label":"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-10","source_ids":["source.frontier.pmid-42429610"]},"sources":[{"id":"source.frontier.pmid-42429610","title":"Europe PMC record PMID 42429610: Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42429610%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msphere.00289-26","title":"doi:10.1128/msphere.00289-26","url":"https://doi.org/10.1128/msphere.00289-26"}],"status":"frontier","summary":"PMID 42429610 \"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community\" (CC BY, first published 2026-07-10) reports: \"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42514673","kind":"claim","label":"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-08","source_ids":["source.frontier.pmid-42514673"]},"sources":[{"id":"source.frontier.pmid-42514673","title":"Europe PMC record PMID 42514673: Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42514673%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/vetsci13070663","title":"doi:10.3390/vetsci13070663","url":"https://doi.org/10.3390/vetsci13070663"}],"status":"frontier","summary":"PMID 42514673 \"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract\" (CC BY, first published 2026-07-08) reports: \"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42515727","kind":"claim","label":"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.pmid-42515727"]},"sources":[{"id":"source.frontier.pmid-42515727","title":"Europe PMC record PMID 42515727: Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42515727%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ph19071045","title":"doi:10.3390/ph19071045","url":"https://doi.org/10.3390/ph19071045"}],"status":"frontier","summary":"PMID 42515727 \"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies\" (CC BY, first published 2026-07-07) reports: \"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42405792","kind":"claim","label":"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-06","source_ids":["source.frontier.pmid-42405792"]},"sources":[{"id":"source.frontier.pmid-42405792","title":"Europe PMC record PMID 42405792: Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42405792%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00500-26","title":"doi:10.1128/spectrum.00500-26","url":"https://doi.org/10.1128/spectrum.00500-26"}],"status":"frontier","summary":"PMID 42405792 \"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>\" (CC BY, first published 2026-07-06) reports: \"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42510569","kind":"claim","label":"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-02","source_ids":["source.frontier.pmid-42510569"]},"sources":[{"id":"source.frontier.pmid-42510569","title":"Europe PMC record PMID 42510569: <i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42510569%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antiox15070838","title":"doi:10.3390/antiox15070838","url":"https://doi.org/10.3390/antiox15070838"}],"status":"frontier","summary":"PMID 42510569 \"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function\" (CC BY, first published 2026-07-02) reports: \"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-02106","kind":"claim","label":"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.arxiv-2610-02106"]},"sources":[{"id":"source.frontier.arxiv-2610-02106","title":"arXiv OAI-PMH record arXiv:2610.02106: Densities for scalar-valued BSDEs via unique continuation and backward uniqueness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.02106&metadataPrefix=arXiv"},{"id":"arxiv:2610.02106","title":"arXiv:2610.02106","url":"https://arxiv.org/abs/2610.02106"}],"status":"frontier","summary":"arXiv:2610.02106 \"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness\" (CC BY 4.0, submitted 2026-10-01) reports: \"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-39519","kind":"claim","label":"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.arxiv-2609-39519"]},"sources":[{"id":"source.frontier.arxiv-2609-39519","title":"arXiv OAI-PMH record arXiv:2609.39519: B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39519&metadataPrefix=arXiv"},{"id":"arxiv:2609.39519","title":"arXiv:2609.39519","url":"https://arxiv.org/abs/2609.39519"}],"status":"frontier","summary":"arXiv:2609.39519 \"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics\" (CC BY 4.0, submitted 2026-09-30) reports: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21904","kind":"claim","label":"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.arxiv-2609-21904"]},"sources":[{"id":"source.frontier.arxiv-2609-21904","title":"arXiv OAI-PMH record arXiv:2609.21904: Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21904&metadataPrefix=arXiv"},{"id":"arxiv:2609.21904","title":"arXiv:2609.21904","url":"https://arxiv.org/abs/2609.21904"}],"status":"frontier","summary":"arXiv:2609.21904 \"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model\" (CC BY 4.0, submitted 2026-09-18) reports: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-19386","kind":"claim","label":"Omitted Variable Bias in Difference-in-Differences Designs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.arxiv-2609-19386"]},"sources":[{"id":"source.frontier.arxiv-2609-19386","title":"arXiv OAI-PMH record arXiv:2609.19386: Omitted Variable Bias in Difference-in-Differences Designs","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19386&metadataPrefix=arXiv"},{"id":"arxiv:2609.19386","title":"arXiv:2609.19386","url":"https://arxiv.org/abs/2609.19386"}],"status":"frontier","summary":"arXiv:2609.19386 \"Omitted Variable Bias in Difference-in-Differences Designs\" (CC BY 4.0, submitted 2026-09-16) reports: \"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-13345","kind":"claim","label":"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.arxiv-2609-13345"]},"sources":[{"id":"source.frontier.arxiv-2609-13345","title":"arXiv OAI-PMH record arXiv:2609.13345: Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.13345&metadataPrefix=arXiv"},{"id":"arxiv:2609.13345","title":"arXiv:2609.13345","url":"https://arxiv.org/abs/2609.13345"}],"status":"frontier","summary":"arXiv:2609.13345 \"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data\" (CC BY 4.0, submitted 2026-09-11) reports: \"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-05100","kind":"claim","label":"Layered mixed matrices and reaction networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.arxiv-2609-05100"]},"sources":[{"id":"source.frontier.arxiv-2609-05100","title":"arXiv OAI-PMH record arXiv:2609.05100: Layered mixed matrices and reaction networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05100&metadataPrefix=arXiv"},{"id":"arxiv:2609.05100","title":"arXiv:2609.05100","url":"https://arxiv.org/abs/2609.05100"}],"status":"frontier","summary":"arXiv:2609.05100 \"Layered mixed matrices and reaction networks\" (CC BY 4.0, submitted 2026-09-04) reports: \"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-19170","kind":"claim","label":"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.arxiv-2608-19170"]},"sources":[{"id":"source.frontier.arxiv-2608-19170","title":"arXiv OAI-PMH record arXiv:2608.19170: Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19170&metadataPrefix=arXiv"},{"id":"arxiv:2608.19170","title":"arXiv:2608.19170","url":"https://arxiv.org/abs/2608.19170"}],"status":"frontier","summary":"arXiv:2608.19170 \"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective\" (CC BY 4.0, submitted 2026-08-19) reports: \"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-14134","kind":"claim","label":"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.arxiv-2608-14134"]},"sources":[{"id":"source.frontier.arxiv-2608-14134","title":"arXiv OAI-PMH record arXiv:2608.14134: Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.14134&metadataPrefix=arXiv"},{"id":"arxiv:2608.14134","title":"arXiv:2608.14134","url":"https://arxiv.org/abs/2608.14134"}],"status":"frontier","summary":"arXiv:2608.14134 \"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization\" (CC BY 4.0, submitted 2026-08-14) reports: \"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-06711","kind":"claim","label":"Conditions for Quantum Advantage in AC Power Flow","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.arxiv-2608-06711"]},"sources":[{"id":"source.frontier.arxiv-2608-06711","title":"arXiv OAI-PMH record arXiv:2608.06711: Conditions for Quantum Advantage in AC Power Flow","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.06711&metadataPrefix=arXiv"},{"id":"arxiv:2608.06711","title":"arXiv:2608.06711","url":"https://arxiv.org/abs/2608.06711"}],"status":"frontier","summary":"arXiv:2608.06711 \"Conditions for Quantum Advantage in AC Power Flow\" (CC BY 4.0, submitted 2026-08-07) reports: \"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-04208","kind":"claim","label":"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-04208"]},"sources":[{"id":"source.frontier.arxiv-2608-04208","title":"arXiv OAI-PMH record arXiv:2608.04208: Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04208&metadataPrefix=arXiv"},{"id":"arxiv:2608.04208","title":"arXiv:2608.04208","url":"https://arxiv.org/abs/2608.04208"}],"status":"frontier","summary":"arXiv:2608.04208 \"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests\" (CC BY 4.0, submitted 2026-08-04) reports: \"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-03832","kind":"claim","label":"Reduced-rank Generalized Bilinear Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-03832"]},"sources":[{"id":"source.frontier.arxiv-2608-03832","title":"arXiv OAI-PMH record arXiv:2608.03832: Reduced-rank Generalized Bilinear Models","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03832&metadataPrefix=arXiv"},{"id":"arxiv:2608.03832","title":"arXiv:2608.03832","url":"https://arxiv.org/abs/2608.03832"}],"status":"frontier","summary":"arXiv:2608.03832 \"Reduced-rank Generalized Bilinear Models\" (CC BY 4.0, submitted 2026-08-04) reports: \"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-03192","kind":"claim","label":"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-03192"]},"sources":[{"id":"source.frontier.arxiv-2608-03192","title":"arXiv OAI-PMH record arXiv:2608.03192: The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03192&metadataPrefix=arXiv"},{"id":"arxiv:2608.03192","title":"arXiv:2608.03192","url":"https://arxiv.org/abs/2608.03192"}],"status":"frontier","summary":"arXiv:2608.03192 \"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations\" (CC BY 4.0, submitted 2026-08-04) reports: \"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02799","kind":"claim","label":"A Hyperfinite Framework for Score-Based Generative Modeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.arxiv-2608-02799"]},"sources":[{"id":"source.frontier.arxiv-2608-02799","title":"arXiv OAI-PMH record arXiv:2608.02799: A Hyperfinite Framework for Score-Based Generative Modeling","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02799&metadataPrefix=arXiv"},{"id":"arxiv:2608.02799","title":"arXiv:2608.02799","url":"https://arxiv.org/abs/2608.02799"}],"status":"frontier","summary":"arXiv:2608.02799 \"A Hyperfinite Framework for Score-Based Generative Modeling\" (CC BY 4.0, submitted 2026-08-03) reports: \"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00708","kind":"claim","label":"Hypergraphs on Riemannian manifolds and their double homology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00708"]},"sources":[{"id":"source.frontier.arxiv-2608-00708","title":"arXiv OAI-PMH record arXiv:2608.00708: Hypergraphs on Riemannian manifolds and their double homology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00708&metadataPrefix=arXiv"},{"id":"arxiv:2608.00708","title":"arXiv:2608.00708","url":"https://arxiv.org/abs/2608.00708"}],"status":"frontier","summary":"arXiv:2608.00708 \"Hypergraphs on Riemannian manifolds and their double homology\" (CC BY 4.0, submitted 2026-08-01) reports: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00649","kind":"claim","label":"Empirical optimal transport potentials: fast rates and a functional central limit theorem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00649"]},"sources":[{"id":"source.frontier.arxiv-2608-00649","title":"arXiv OAI-PMH record arXiv:2608.00649: Empirical optimal transport potentials: fast rates and a functional central limit theorem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00649&metadataPrefix=arXiv"},{"id":"arxiv:2608.00649","title":"arXiv:2608.00649","url":"https://arxiv.org/abs/2608.00649"}],"status":"frontier","summary":"arXiv:2608.00649 \"Empirical optimal transport potentials: fast rates and a functional central limit theorem\" (CC BY 4.0, submitted 2026-08-01) reports: \"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00445","kind":"claim","label":"Exact detection threshold of the packing test","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00445"]},"sources":[{"id":"source.frontier.arxiv-2608-00445","title":"arXiv OAI-PMH record arXiv:2608.00445: Exact detection threshold of the packing test","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00445&metadataPrefix=arXiv"},{"id":"arxiv:2608.00445","title":"arXiv:2608.00445","url":"https://arxiv.org/abs/2608.00445"}],"status":"frontier","summary":"arXiv:2608.00445 \"Exact detection threshold of the packing test\" (CC0 1.0, submitted 2026-08-01) reports: \"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29270","kind":"claim","label":"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29270"]},"sources":[{"id":"source.frontier.arxiv-2607-29270","title":"arXiv OAI-PMH record arXiv:2607.29270: Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29270&metadataPrefix=arXiv"},{"id":"arxiv:2607.29270","title":"arXiv:2607.29270","url":"https://arxiv.org/abs/2607.29270"}],"status":"frontier","summary":"arXiv:2607.29270 \"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications\" (CC BY 4.0, submitted 2026-07-31) reports: \"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29131","kind":"claim","label":"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29131"]},"sources":[{"id":"source.frontier.arxiv-2607-29131","title":"arXiv OAI-PMH record arXiv:2607.29131: Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29131&metadataPrefix=arXiv"},{"id":"arxiv:2607.29131","title":"arXiv:2607.29131","url":"https://arxiv.org/abs/2607.29131"}],"status":"frontier","summary":"arXiv:2607.29131 \"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29123","kind":"claim","label":"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29123"]},"sources":[{"id":"source.frontier.arxiv-2607-29123","title":"arXiv OAI-PMH record arXiv:2607.29123: Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29123&metadataPrefix=arXiv"},{"id":"arxiv:2607.29123","title":"arXiv:2607.29123","url":"https://arxiv.org/abs/2607.29123"}],"status":"frontier","summary":"arXiv:2607.29123 \"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control\" (CC BY 4.0, submitted 2026-07-31) reports: \"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29073","kind":"claim","label":"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29073"]},"sources":[{"id":"source.frontier.arxiv-2607-29073","title":"arXiv OAI-PMH record arXiv:2607.29073: On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29073&metadataPrefix=arXiv"},{"id":"arxiv:2607.29073","title":"arXiv:2607.29073","url":"https://arxiv.org/abs/2607.29073"}],"status":"frontier","summary":"arXiv:2607.29073 \"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28919","kind":"claim","label":"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-28919"]},"sources":[{"id":"source.frontier.arxiv-2607-28919","title":"arXiv OAI-PMH record arXiv:2607.28919: Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28919&metadataPrefix=arXiv"},{"id":"arxiv:2607.28919","title":"arXiv:2607.28919","url":"https://arxiv.org/abs/2607.28919"}],"status":"frontier","summary":"arXiv:2607.28919 \"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28080","kind":"claim","label":"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-28080"]},"sources":[{"id":"source.frontier.arxiv-2607-28080","title":"arXiv OAI-PMH record arXiv:2607.28080: On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28080&metadataPrefix=arXiv"},{"id":"arxiv:2607.28080","title":"arXiv:2607.28080","url":"https://arxiv.org/abs/2607.28080"}],"status":"frontier","summary":"arXiv:2607.28080 \"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems\" (CC BY 4.0, submitted 2026-07-31) reports: \"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25783","kind":"claim","label":"Deterministic loading of molecular arrays by microwave-assisted collisions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-25783"]},"sources":[{"id":"source.frontier.arxiv-2607-25783","title":"arXiv OAI-PMH record arXiv:2607.25783: Deterministic loading of molecular arrays by microwave-assisted collisions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25783&metadataPrefix=arXiv"},{"id":"arxiv:2607.25783","title":"arXiv:2607.25783","url":"https://arxiv.org/abs/2607.25783"}],"status":"frontier","summary":"arXiv:2607.25783 \"Deterministic loading of molecular arrays by microwave-assisted collisions\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-11988","kind":"claim","label":"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-11988"]},"sources":[{"id":"source.frontier.arxiv-2607-11988","title":"arXiv OAI-PMH record arXiv:2607.11988: Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.11988&metadataPrefix=arXiv"},{"id":"arxiv:2607.11988","title":"arXiv:2607.11988","url":"https://arxiv.org/abs/2607.11988"}],"status":"frontier","summary":"arXiv:2607.11988 \"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory\" (CC BY 4.0, submitted 2026-07-31) reports: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28893","kind":"claim","label":"Piecewise isometry groups of Euclidean tessellations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28893"]},"sources":[{"id":"source.frontier.arxiv-2607-28893","title":"arXiv OAI-PMH record arXiv:2607.28893: Piecewise isometry groups of Euclidean tessellations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28893&metadataPrefix=arXiv"},{"id":"arxiv:2607.28893","title":"arXiv:2607.28893","url":"https://arxiv.org/abs/2607.28893"}],"status":"frontier","summary":"arXiv:2607.28893 \"Piecewise isometry groups of Euclidean tessellations\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28883","kind":"claim","label":"The VORTEX cavity for the RADES axion haloscope","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28883"]},"sources":[{"id":"source.frontier.arxiv-2607-28883","title":"arXiv OAI-PMH record arXiv:2607.28883: The VORTEX cavity for the RADES axion haloscope","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28883&metadataPrefix=arXiv"},{"id":"arxiv:2607.28883","title":"arXiv:2607.28883","url":"https://arxiv.org/abs/2607.28883"}],"status":"frontier","summary":"arXiv:2607.28883 \"The VORTEX cavity for the RADES axion haloscope\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28746","kind":"claim","label":"From Horizon Microstates to the Black Hole Membrane","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28746"]},"sources":[{"id":"source.frontier.arxiv-2607-28746","title":"arXiv OAI-PMH record arXiv:2607.28746: From Horizon Microstates to the Black Hole Membrane","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28746&metadataPrefix=arXiv"},{"id":"arxiv:2607.28746","title":"arXiv:2607.28746","url":"https://arxiv.org/abs/2607.28746"}],"status":"frontier","summary":"arXiv:2607.28746 \"From Horizon Microstates to the Black Hole Membrane\" (CC BY 4.0, submitted 2026-07-30) reports: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28739","kind":"claim","label":"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28739"]},"sources":[{"id":"source.frontier.arxiv-2607-28739","title":"arXiv OAI-PMH record arXiv:2607.28739: Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28739&metadataPrefix=arXiv"},{"id":"arxiv:2607.28739","title":"arXiv:2607.28739","url":"https://arxiv.org/abs/2607.28739"}],"status":"frontier","summary":"arXiv:2607.28739 \"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28738","kind":"claim","label":"Obstructions to Traversable Wormholes in Einstein-Dirac Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28738"]},"sources":[{"id":"source.frontier.arxiv-2607-28738","title":"arXiv OAI-PMH record arXiv:2607.28738: Obstructions to Traversable Wormholes in Einstein-Dirac Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28738&metadataPrefix=arXiv"},{"id":"arxiv:2607.28738","title":"arXiv:2607.28738","url":"https://arxiv.org/abs/2607.28738"}],"status":"frontier","summary":"arXiv:2607.28738 \"Obstructions to Traversable Wormholes in Einstein-Dirac Theory\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28736","kind":"claim","label":"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28736"]},"sources":[{"id":"source.frontier.arxiv-2607-28736","title":"arXiv OAI-PMH record arXiv:2607.28736: Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28736&metadataPrefix=arXiv"},{"id":"arxiv:2607.28736","title":"arXiv:2607.28736","url":"https://arxiv.org/abs/2607.28736"}],"status":"frontier","summary":"arXiv:2607.28736 \"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28717","kind":"claim","label":"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28717"]},"sources":[{"id":"source.frontier.arxiv-2607-28717","title":"arXiv OAI-PMH record arXiv:2607.28717: Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28717&metadataPrefix=arXiv"},{"id":"arxiv:2607.28717","title":"arXiv:2607.28717","url":"https://arxiv.org/abs/2607.28717"},{"id":"doi:10.3847/1538-4357/ae83b5","title":"doi:10.3847/1538-4357/ae83b5","url":"https://doi.org/10.3847/1538-4357/ae83b5"}],"status":"frontier","summary":"arXiv:2607.28717 \"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets\" (CC BY 4.0, submitted 2026-07-30) reports: \"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28714","kind":"claim","label":"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28714"]},"sources":[{"id":"source.frontier.arxiv-2607-28714","title":"arXiv OAI-PMH record arXiv:2607.28714: Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28714&metadataPrefix=arXiv"},{"id":"arxiv:2607.28714","title":"arXiv:2607.28714","url":"https://arxiv.org/abs/2607.28714"}],"status":"frontier","summary":"arXiv:2607.28714 \"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our analysis reveals significant variations in polarimetric properties tracking the dip.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28690","kind":"claim","label":"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28690"]},"sources":[{"id":"source.frontier.arxiv-2607-28690","title":"arXiv OAI-PMH record arXiv:2607.28690: Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28690&metadataPrefix=arXiv"},{"id":"arxiv:2607.28690","title":"arXiv:2607.28690","url":"https://arxiv.org/abs/2607.28690"},{"id":"doi:10.1016/j.physletb.2026.140569","title":"doi:10.1016/j.physletb.2026.140569","url":"https://doi.org/10.1016/j.physletb.2026.140569"}],"status":"frontier","summary":"arXiv:2607.28690 \"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces\" (CC BY 4.0, submitted 2026-07-30) reports: \"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28604","kind":"claim","label":"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28604"]},"sources":[{"id":"source.frontier.arxiv-2607-28604","title":"arXiv OAI-PMH record arXiv:2607.28604: Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28604&metadataPrefix=arXiv"},{"id":"arxiv:2607.28604","title":"arXiv:2607.28604","url":"https://arxiv.org/abs/2607.28604"}],"status":"frontier","summary":"arXiv:2607.28604 \"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28597","kind":"claim","label":"Nonnuclear Bunce-Deddens algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28597"]},"sources":[{"id":"source.frontier.arxiv-2607-28597","title":"arXiv OAI-PMH record arXiv:2607.28597: Nonnuclear Bunce-Deddens algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28597&metadataPrefix=arXiv"},{"id":"arxiv:2607.28597","title":"arXiv:2607.28597","url":"https://arxiv.org/abs/2607.28597"}],"status":"frontier","summary":"arXiv:2607.28597 \"Nonnuclear Bunce-Deddens algebras\" (CC BY 4.0, submitted 2026-07-30) reports: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28533","kind":"claim","label":"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28533"]},"sources":[{"id":"source.frontier.arxiv-2607-28533","title":"arXiv OAI-PMH record arXiv:2607.28533: Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28533&metadataPrefix=arXiv"},{"id":"arxiv:2607.28533","title":"arXiv:2607.28533","url":"https://arxiv.org/abs/2607.28533"}],"status":"frontier","summary":"arXiv:2607.28533 \"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28524","kind":"claim","label":"Exact chiral symmetry with quantum signal processing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28524"]},"sources":[{"id":"source.frontier.arxiv-2607-28524","title":"arXiv OAI-PMH record arXiv:2607.28524: Exact chiral symmetry with quantum signal processing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28524&metadataPrefix=arXiv"},{"id":"arxiv:2607.28524","title":"arXiv:2607.28524","url":"https://arxiv.org/abs/2607.28524"}],"status":"frontier","summary":"arXiv:2607.28524 \"Exact chiral symmetry with quantum signal processing\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28504","kind":"claim","label":"Spacetime Layout and Logical Compilation of Color Code","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28504"]},"sources":[{"id":"source.frontier.arxiv-2607-28504","title":"arXiv OAI-PMH record arXiv:2607.28504: Spacetime Layout and Logical Compilation of Color Code","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28504&metadataPrefix=arXiv"},{"id":"arxiv:2607.28504","title":"arXiv:2607.28504","url":"https://arxiv.org/abs/2607.28504"}],"status":"frontier","summary":"arXiv:2607.28504 \"Spacetime Layout and Logical Compilation of Color Code\" (CC BY 4.0, submitted 2026-07-30) reports: \"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28491","kind":"claim","label":"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28491"]},"sources":[{"id":"source.frontier.arxiv-2607-28491","title":"arXiv OAI-PMH record arXiv:2607.28491: Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28491&metadataPrefix=arXiv"},{"id":"arxiv:2607.28491","title":"arXiv:2607.28491","url":"https://arxiv.org/abs/2607.28491"}],"status":"frontier","summary":"arXiv:2607.28491 \"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28479","kind":"claim","label":"Mitigating quantum decoherence via global optimal control","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28479"]},"sources":[{"id":"source.frontier.arxiv-2607-28479","title":"arXiv OAI-PMH record arXiv:2607.28479: Mitigating quantum decoherence via global optimal control","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28479&metadataPrefix=arXiv"},{"id":"arxiv:2607.28479","title":"arXiv:2607.28479","url":"https://arxiv.org/abs/2607.28479"}],"status":"frontier","summary":"arXiv:2607.28479 \"Mitigating quantum decoherence via global optimal control\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28471","kind":"claim","label":"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28471"]},"sources":[{"id":"source.frontier.arxiv-2607-28471","title":"arXiv OAI-PMH record arXiv:2607.28471: From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28471&metadataPrefix=arXiv"},{"id":"arxiv:2607.28471","title":"arXiv:2607.28471","url":"https://arxiv.org/abs/2607.28471"}],"status":"frontier","summary":"arXiv:2607.28471 \"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model\" (CC BY 4.0, submitted 2026-07-30) reports: \"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28441","kind":"claim","label":"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28441"]},"sources":[{"id":"source.frontier.arxiv-2607-28441","title":"arXiv OAI-PMH record arXiv:2607.28441: Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28441&metadataPrefix=arXiv"},{"id":"arxiv:2607.28441","title":"arXiv:2607.28441","url":"https://arxiv.org/abs/2607.28441"}],"status":"frontier","summary":"arXiv:2607.28441 \"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28438","kind":"claim","label":"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28438"]},"sources":[{"id":"source.frontier.arxiv-2607-28438","title":"arXiv OAI-PMH record arXiv:2607.28438: Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and ","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28438&metadataPrefix=arXiv"},{"id":"arxiv:2607.28438","title":"arXiv:2607.28438","url":"https://arxiv.org/abs/2607.28438"}],"status":"frontier","summary":"arXiv:2607.28438 \"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology\" (CC BY 4.0, submitted 2026-07-30) reports: \"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28345","kind":"claim","label":"The cycle C9 does not admit uniform mixing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28345"]},"sources":[{"id":"source.frontier.arxiv-2607-28345","title":"arXiv OAI-PMH record arXiv:2607.28345: The cycle C9 does not admit uniform mixing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28345&metadataPrefix=arXiv"},{"id":"arxiv:2607.28345","title":"arXiv:2607.28345","url":"https://arxiv.org/abs/2607.28345"}],"status":"frontier","summary":"arXiv:2607.28345 \"The cycle C9 does not admit uniform mixing\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28173","kind":"claim","label":"Semi-supervised Hopfield model: Theoretical and Numerical results","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28173"]},"sources":[{"id":"source.frontier.arxiv-2607-28173","title":"arXiv OAI-PMH record arXiv:2607.28173: Semi-supervised Hopfield model: Theoretical and Numerical results","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28173&metadataPrefix=arXiv"},{"id":"arxiv:2607.28173","title":"arXiv:2607.28173","url":"https://arxiv.org/abs/2607.28173"}],"status":"frontier","summary":"arXiv:2607.28173 \"Semi-supervised Hopfield model: Theoretical and Numerical results\" (CC BY 4.0, submitted 2026-07-30) reports: \"Using Guerra's interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28168","kind":"claim","label":"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28168"]},"sources":[{"id":"source.frontier.arxiv-2607-28168","title":"arXiv OAI-PMH record arXiv:2607.28168: On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28168&metadataPrefix=arXiv"},{"id":"arxiv:2607.28168","title":"arXiv:2607.28168","url":"https://arxiv.org/abs/2607.28168"}],"status":"frontier","summary":"arXiv:2607.28168 \"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28161","kind":"claim","label":"A Mathematical Framework for Topological Causal Data Analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28161"]},"sources":[{"id":"source.frontier.arxiv-2607-28161","title":"arXiv OAI-PMH record arXiv:2607.28161: A Mathematical Framework for Topological Causal Data Analysis","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28161&metadataPrefix=arXiv"},{"id":"arxiv:2607.28161","title":"arXiv:2607.28161","url":"https://arxiv.org/abs/2607.28161"}],"status":"frontier","summary":"arXiv:2607.28161 \"A Mathematical Framework for Topological Causal Data Analysis\" (CC BY 4.0, submitted 2026-07-30) reports: \"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28140","kind":"claim","label":"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28140"]},"sources":[{"id":"source.frontier.arxiv-2607-28140","title":"arXiv OAI-PMH record arXiv:2607.28140: A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28140&metadataPrefix=arXiv"},{"id":"arxiv:2607.28140","title":"arXiv:2607.28140","url":"https://arxiv.org/abs/2607.28140"},{"id":"doi:10.1051/0004-6361/202660862","title":"doi:10.1051/0004-6361/202660862","url":"https://doi.org/10.1051/0004-6361/202660862"}],"status":"frontier","summary":"arXiv:2607.28140 \"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28095","kind":"claim","label":"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28095"]},"sources":[{"id":"source.frontier.arxiv-2607-28095","title":"arXiv OAI-PMH record arXiv:2607.28095: Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28095&metadataPrefix=arXiv"},{"id":"arxiv:2607.28095","title":"arXiv:2607.28095","url":"https://arxiv.org/abs/2607.28095"}],"status":"frontier","summary":"arXiv:2607.28095 \"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951\" (CC BY 4.0, submitted 2026-07-30) reports: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28021","kind":"claim","label":"The Euler Characteristic Transform from a Convex Geometric Perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28021"]},"sources":[{"id":"source.frontier.arxiv-2607-28021","title":"arXiv OAI-PMH record arXiv:2607.28021: The Euler Characteristic Transform from a Convex Geometric Perspective","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28021&metadataPrefix=arXiv"},{"id":"arxiv:2607.28021","title":"arXiv:2607.28021","url":"https://arxiv.org/abs/2607.28021"}],"status":"frontier","summary":"arXiv:2607.28021 \"The Euler Characteristic Transform from a Convex Geometric Perspective\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27985","kind":"claim","label":"Bridging continuous control and Floquet driving for charging many-body spin chains","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27985"]},"sources":[{"id":"source.frontier.arxiv-2607-27985","title":"arXiv OAI-PMH record arXiv:2607.27985: Bridging continuous control and Floquet driving for charging many-body spin chains","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27985&metadataPrefix=arXiv"},{"id":"arxiv:2607.27985","title":"arXiv:2607.27985","url":"https://arxiv.org/abs/2607.27985"}],"status":"frontier","summary":"arXiv:2607.27985 \"Bridging continuous control and Floquet driving for charging many-body spin chains\" (CC BY 4.0, submitted 2026-07-30) reports: \"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27957","kind":"claim","label":"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27957"]},"sources":[{"id":"source.frontier.arxiv-2607-27957","title":"arXiv OAI-PMH record arXiv:2607.27957: Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27957&metadataPrefix=arXiv"},{"id":"arxiv:2607.27957","title":"arXiv:2607.27957","url":"https://arxiv.org/abs/2607.27957"}],"status":"frontier","summary":"arXiv:2607.27957 \"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography\" (CC BY 4.0, submitted 2026-07-30) reports: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27874","kind":"claim","label":"Non-conformal obstructions to bubble expansion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27874"]},"sources":[{"id":"source.frontier.arxiv-2607-27874","title":"arXiv OAI-PMH record arXiv:2607.27874: Non-conformal obstructions to bubble expansion","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27874&metadataPrefix=arXiv"},{"id":"arxiv:2607.27874","title":"arXiv:2607.27874","url":"https://arxiv.org/abs/2607.27874"}],"status":"frontier","summary":"arXiv:2607.27874 \"Non-conformal obstructions to bubble expansion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We uncover a new set of hydrodynamic obstructions to bubble expansion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27860","kind":"claim","label":"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27860"]},"sources":[{"id":"source.frontier.arxiv-2607-27860","title":"arXiv OAI-PMH record arXiv:2607.27860: Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27860&metadataPrefix=arXiv"},{"id":"arxiv:2607.27860","title":"arXiv:2607.27860","url":"https://arxiv.org/abs/2607.27860"}],"status":"frontier","summary":"arXiv:2607.27860 \"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings indicate that BLR gas density serves as the primary physical driver underlying the \"global\" Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27805","kind":"claim","label":"Chaos in reason: How chain-of-thought LLMs can look for an answer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27805"]},"sources":[{"id":"source.frontier.arxiv-2607-27805","title":"arXiv OAI-PMH record arXiv:2607.27805: Chaos in reason: How chain-of-thought LLMs can look for an answer","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27805&metadataPrefix=arXiv"},{"id":"arxiv:2607.27805","title":"arXiv:2607.27805","url":"https://arxiv.org/abs/2607.27805"}],"status":"frontier","summary":"arXiv:2607.27805 \"Chaos in reason: How chain-of-thought LLMs can look for an answer\" (CC BY 4.0, submitted 2026-07-30) reports: \"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27799","kind":"claim","label":"When do Kernels Admit Characteristic Functions?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27799"]},"sources":[{"id":"source.frontier.arxiv-2607-27799","title":"arXiv OAI-PMH record arXiv:2607.27799: When do Kernels Admit Characteristic Functions?","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27799&metadataPrefix=arXiv"},{"id":"arxiv:2607.27799","title":"arXiv:2607.27799","url":"https://arxiv.org/abs/2607.27799"}],"status":"frontier","summary":"arXiv:2607.27799 \"When do Kernels Admit Characteristic Functions?\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27707","kind":"claim","label":"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27707"]},"sources":[{"id":"source.frontier.arxiv-2607-27707","title":"arXiv OAI-PMH record arXiv:2607.27707: Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27707&metadataPrefix=arXiv"},{"id":"arxiv:2607.27707","title":"arXiv:2607.27707","url":"https://arxiv.org/abs/2607.27707"}],"status":"frontier","summary":"arXiv:2607.27707 \"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27646","kind":"claim","label":"Metric Rigidity in Anchored Sobolev Spaces on Intervals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27646"]},"sources":[{"id":"source.frontier.arxiv-2607-27646","title":"arXiv OAI-PMH record arXiv:2607.27646: Metric Rigidity in Anchored Sobolev Spaces on Intervals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27646&metadataPrefix=arXiv"},{"id":"arxiv:2607.27646","title":"arXiv:2607.27646","url":"https://arxiv.org/abs/2607.27646"}],"status":"frontier","summary":"arXiv:2607.27646 \"Metric Rigidity in Anchored Sobolev Spaces on Intervals\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27629","kind":"claim","label":"Curved Kakeya problems and the projective geometry of paths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27629"]},"sources":[{"id":"source.frontier.arxiv-2607-27629","title":"arXiv OAI-PMH record arXiv:2607.27629: Curved Kakeya problems and the projective geometry of paths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27629&metadataPrefix=arXiv"},{"id":"arxiv:2607.27629","title":"arXiv:2607.27629","url":"https://arxiv.org/abs/2607.27629"}],"status":"frontier","summary":"arXiv:2607.27629 \"Curved Kakeya problems and the projective geometry of paths\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff's hairbrush argument, is equivalent to projective flatness of the associated spray.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27582","kind":"claim","label":"Polynomial maps which are not good for nice recurrence and applications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27582"]},"sources":[{"id":"source.frontier.arxiv-2607-27582","title":"arXiv OAI-PMH record arXiv:2607.27582: Polynomial maps which are not good for nice recurrence and applications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27582&metadataPrefix=arXiv"},{"id":"arxiv:2607.27582","title":"arXiv:2607.27582","url":"https://arxiv.org/abs/2607.27582"}],"status":"frontier","summary":"arXiv:2607.27582 \"Polynomial maps which are not good for nice recurrence and applications\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21030","kind":"claim","label":"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-21030"]},"sources":[{"id":"source.frontier.arxiv-2607-21030","title":"arXiv OAI-PMH record arXiv:2607.21030: Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21030&metadataPrefix=arXiv"},{"id":"arxiv:2607.21030","title":"arXiv:2607.21030","url":"https://arxiv.org/abs/2607.21030"}],"status":"frontier","summary":"arXiv:2607.21030 \"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19220","kind":"claim","label":"Quarkyonic Stars with Strangeness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-19220"]},"sources":[{"id":"source.frontier.arxiv-2607-19220","title":"arXiv OAI-PMH record arXiv:2607.19220: Quarkyonic Stars with Strangeness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19220&metadataPrefix=arXiv"},{"id":"arxiv:2607.19220","title":"arXiv:2607.19220","url":"https://arxiv.org/abs/2607.19220"}],"status":"frontier","summary":"arXiv:2607.19220 \"Quarkyonic Stars with Strangeness\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-12710","kind":"claim","label":"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-12710"]},"sources":[{"id":"source.frontier.arxiv-2607-12710","title":"arXiv OAI-PMH record arXiv:2607.12710: Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12710&metadataPrefix=arXiv"},{"id":"arxiv:2607.12710","title":"arXiv:2607.12710","url":"https://arxiv.org/abs/2607.12710"}],"status":"frontier","summary":"arXiv:2607.12710 \"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-10561","kind":"claim","label":"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-10561"]},"sources":[{"id":"source.frontier.arxiv-2607-10561","title":"arXiv OAI-PMH record arXiv:2607.10561: Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.10561&metadataPrefix=arXiv"},{"id":"arxiv:2607.10561","title":"arXiv:2607.10561","url":"https://arxiv.org/abs/2607.10561"}],"status":"frontier","summary":"arXiv:2607.10561 \"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-03479","kind":"claim","label":"The multilinear forms Cayley graph and the eigenvalue method for tensor codes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-03479"]},"sources":[{"id":"source.frontier.arxiv-2607-03479","title":"arXiv OAI-PMH record arXiv:2607.03479: The multilinear forms Cayley graph and the eigenvalue method for tensor codes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.03479&metadataPrefix=arXiv"},{"id":"arxiv:2607.03479","title":"arXiv:2607.03479","url":"https://arxiv.org/abs/2607.03479"}],"status":"frontier","summary":"arXiv:2607.03479 \"The multilinear forms Cayley graph and the eigenvalue method for tensor codes\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27515","kind":"claim","label":"Unified dark sector approaches to cosmological tensions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27515"]},"sources":[{"id":"source.frontier.arxiv-2607-27515","title":"arXiv OAI-PMH record arXiv:2607.27515: Unified dark sector approaches to cosmological tensions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27515&metadataPrefix=arXiv"},{"id":"arxiv:2607.27515","title":"arXiv:2607.27515","url":"https://arxiv.org/abs/2607.27515"}],"status":"frontier","summary":"arXiv:2607.27515 \"Unified dark sector approaches to cosmological tensions\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27514","kind":"claim","label":"Sample Complexity for the 2-Gromov-Wasserstein Distance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27514"]},"sources":[{"id":"source.frontier.arxiv-2607-27514","title":"arXiv OAI-PMH record arXiv:2607.27514: Sample Complexity for the 2-Gromov-Wasserstein Distance","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27514&metadataPrefix=arXiv"},{"id":"arxiv:2607.27514","title":"arXiv:2607.27514","url":"https://arxiv.org/abs/2607.27514"}],"status":"frontier","summary":"arXiv:2607.27514 \"Sample Complexity for the 2-Gromov-Wasserstein Distance\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27502","kind":"claim","label":"Entropic signatures of the single-impurity Kondo state","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27502"]},"sources":[{"id":"source.frontier.arxiv-2607-27502","title":"arXiv OAI-PMH record arXiv:2607.27502: Entropic signatures of the single-impurity Kondo state","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27502&metadataPrefix=arXiv"},{"id":"arxiv:2607.27502","title":"arXiv:2607.27502","url":"https://arxiv.org/abs/2607.27502"}],"status":"frontier","summary":"arXiv:2607.27502 \"Entropic signatures of the single-impurity Kondo state\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27403","kind":"claim","label":"Handling Missingness and Censoring in Dirichlet Mixture Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27403"]},"sources":[{"id":"source.frontier.arxiv-2607-27403","title":"arXiv OAI-PMH record arXiv:2607.27403: Handling Missingness and Censoring in Dirichlet Mixture Models","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27403&metadataPrefix=arXiv"},{"id":"arxiv:2607.27403","title":"arXiv:2607.27403","url":"https://arxiv.org/abs/2607.27403"}],"status":"frontier","summary":"arXiv:2607.27403 \"Handling Missingness and Censoring in Dirichlet Mixture Models\" (CC BY 4.0, submitted 2026-07-29) reports: \"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27391","kind":"claim","label":"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27391"]},"sources":[{"id":"source.frontier.arxiv-2607-27391","title":"arXiv OAI-PMH record arXiv:2607.27391: Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27391&metadataPrefix=arXiv"},{"id":"arxiv:2607.27391","title":"arXiv:2607.27391","url":"https://arxiv.org/abs/2607.27391"}],"status":"frontier","summary":"arXiv:2607.27391 \"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties\" (CC BY 4.0, submitted 2026-07-29) reports: \"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27388","kind":"claim","label":"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27388"]},"sources":[{"id":"source.frontier.arxiv-2607-27388","title":"arXiv OAI-PMH record arXiv:2607.27388: Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27388&metadataPrefix=arXiv"},{"id":"arxiv:2607.27388","title":"arXiv:2607.27388","url":"https://arxiv.org/abs/2607.27388"}],"status":"frontier","summary":"arXiv:2607.27388 \"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes\" (CC BY 4.0, submitted 2026-07-29) reports: \"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27362","kind":"claim","label":"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27362"]},"sources":[{"id":"source.frontier.arxiv-2607-27362","title":"arXiv OAI-PMH record arXiv:2607.27362: Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27362&metadataPrefix=arXiv"},{"id":"arxiv:2607.27362","title":"arXiv:2607.27362","url":"https://arxiv.org/abs/2607.27362"}],"status":"frontier","summary":"arXiv:2607.27362 \"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27344","kind":"claim","label":"Inflation in unimodular loop quantum cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27344"]},"sources":[{"id":"source.frontier.arxiv-2607-27344","title":"arXiv OAI-PMH record arXiv:2607.27344: Inflation in unimodular loop quantum cosmology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27344&metadataPrefix=arXiv"},{"id":"arxiv:2607.27344","title":"arXiv:2607.27344","url":"https://arxiv.org/abs/2607.27344"}],"status":"frontier","summary":"arXiv:2607.27344 \"Inflation in unimodular loop quantum cosmology\" (CC BY 4.0, submitted 2026-07-29) reports: \"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27334","kind":"claim","label":"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27334"]},"sources":[{"id":"source.frontier.arxiv-2607-27334","title":"arXiv OAI-PMH record arXiv:2607.27334: Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27334&metadataPrefix=arXiv"},{"id":"arxiv:2607.27334","title":"arXiv:2607.27334","url":"https://arxiv.org/abs/2607.27334"}],"status":"frontier","summary":"arXiv:2607.27334 \"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27329","kind":"claim","label":"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27329"]},"sources":[{"id":"source.frontier.arxiv-2607-27329","title":"arXiv OAI-PMH record arXiv:2607.27329: An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27329&metadataPrefix=arXiv"},{"id":"arxiv:2607.27329","title":"arXiv:2607.27329","url":"https://arxiv.org/abs/2607.27329"}],"status":"frontier","summary":"arXiv:2607.27329 \"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27326","kind":"claim","label":"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27326"]},"sources":[{"id":"source.frontier.arxiv-2607-27326","title":"arXiv OAI-PMH record arXiv:2607.27326: Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27326&metadataPrefix=arXiv"},{"id":"arxiv:2607.27326","title":"arXiv:2607.27326","url":"https://arxiv.org/abs/2607.27326"}],"status":"frontier","summary":"arXiv:2607.27326 \"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints\" (CC BY 4.0, submitted 2026-07-29) reports: \"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27312","kind":"claim","label":"Non-linear Evolution of Dark Plasma Subhalos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27312"]},"sources":[{"id":"source.frontier.arxiv-2607-27312","title":"arXiv OAI-PMH record arXiv:2607.27312: Non-linear Evolution of Dark Plasma Subhalos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27312&metadataPrefix=arXiv"},{"id":"arxiv:2607.27312","title":"arXiv:2607.27312","url":"https://arxiv.org/abs/2607.27312"}],"status":"frontier","summary":"arXiv:2607.27312 \"Non-linear Evolution of Dark Plasma Subhalos\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27299","kind":"claim","label":"When trajectory-based bounds fail: information thermodynamics under noisy feedback","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27299"]},"sources":[{"id":"source.frontier.arxiv-2607-27299","title":"arXiv OAI-PMH record arXiv:2607.27299: When trajectory-based bounds fail: information thermodynamics under noisy feedback","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27299&metadataPrefix=arXiv"},{"id":"arxiv:2607.27299","title":"arXiv:2607.27299","url":"https://arxiv.org/abs/2607.27299"}],"status":"frontier","summary":"arXiv:2607.27299 \"When trajectory-based bounds fail: information thermodynamics under noisy feedback\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27181","kind":"claim","label":"Reconfigurable Optical Platform for One-way Quantum Communication Complexity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27181"]},"sources":[{"id":"source.frontier.arxiv-2607-27181","title":"arXiv OAI-PMH record arXiv:2607.27181: Reconfigurable Optical Platform for One-way Quantum Communication Complexity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27181&metadataPrefix=arXiv"},{"id":"arxiv:2607.27181","title":"arXiv:2607.27181","url":"https://arxiv.org/abs/2607.27181"}],"status":"frontier","summary":"arXiv:2607.27181 \"Reconfigurable Optical Platform for One-way Quantum Communication Complexity\" (CC BY 4.0, submitted 2026-07-29) reports: \"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27158","kind":"claim","label":"Outcomes of Grand Unified Symmetry Breaking","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27158"]},"sources":[{"id":"source.frontier.arxiv-2607-27158","title":"arXiv OAI-PMH record arXiv:2607.27158: Outcomes of Grand Unified Symmetry Breaking","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27158&metadataPrefix=arXiv"},{"id":"arxiv:2607.27158","title":"arXiv:2607.27158","url":"https://arxiv.org/abs/2607.27158"}],"status":"frontier","summary":"arXiv:2607.27158 \"Outcomes of Grand Unified Symmetry Breaking\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27129","kind":"claim","label":"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27129"]},"sources":[{"id":"source.frontier.arxiv-2607-27129","title":"arXiv OAI-PMH record arXiv:2607.27129: Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27129&metadataPrefix=arXiv"},{"id":"arxiv:2607.27129","title":"arXiv:2607.27129","url":"https://arxiv.org/abs/2607.27129"}],"status":"frontier","summary":"arXiv:2607.27129 \"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27105","kind":"claim","label":"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27105"]},"sources":[{"id":"source.frontier.arxiv-2607-27105","title":"arXiv OAI-PMH record arXiv:2607.27105: Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27105&metadataPrefix=arXiv"},{"id":"arxiv:2607.27105","title":"arXiv:2607.27105","url":"https://arxiv.org/abs/2607.27105"}],"status":"frontier","summary":"arXiv:2607.27105 \"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach\" (CC BY 4.0, submitted 2026-07-29) reports: \"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27098","kind":"claim","label":"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27098"]},"sources":[{"id":"source.frontier.arxiv-2607-27098","title":"arXiv OAI-PMH record arXiv:2607.27098: Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27098&metadataPrefix=arXiv"},{"id":"arxiv:2607.27098","title":"arXiv:2607.27098","url":"https://arxiv.org/abs/2607.27098"}],"status":"frontier","summary":"arXiv:2607.27098 \"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27062","kind":"claim","label":"PIKS: Universal Physics-Informed Kernel Methods","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27062"]},"sources":[{"id":"source.frontier.arxiv-2607-27062","title":"arXiv OAI-PMH record arXiv:2607.27062: PIKS: Universal Physics-Informed Kernel Methods","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27062&metadataPrefix=arXiv"},{"id":"arxiv:2607.27062","title":"arXiv:2607.27062","url":"https://arxiv.org/abs/2607.27062"}],"status":"frontier","summary":"arXiv:2607.27062 \"PIKS: Universal Physics-Informed Kernel Methods\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27038","kind":"claim","label":"Irreducible non-holonomic modules for rational Cherednik algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27038"]},"sources":[{"id":"source.frontier.arxiv-2607-27038","title":"arXiv OAI-PMH record arXiv:2607.27038: Irreducible non-holonomic modules for rational Cherednik algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27038&metadataPrefix=arXiv"},{"id":"arxiv:2607.27038","title":"arXiv:2607.27038","url":"https://arxiv.org/abs/2607.27038"}],"status":"frontier","summary":"arXiv:2607.27038 \"Irreducible non-holonomic modules for rational Cherednik algebras\" (CC BY 4.0, submitted 2026-07-29) reports: \"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27037","kind":"claim","label":"SNT-Rank: Kronecker Products and Euclidean Distance Matrices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27037"]},"sources":[{"id":"source.frontier.arxiv-2607-27037","title":"arXiv OAI-PMH record arXiv:2607.27037: SNT-Rank: Kronecker Products and Euclidean Distance Matrices","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27037&metadataPrefix=arXiv"},{"id":"arxiv:2607.27037","title":"arXiv:2607.27037","url":"https://arxiv.org/abs/2607.27037"}],"status":"frontier","summary":"arXiv:2607.27037 \"SNT-Rank: Kronecker Products and Euclidean Distance Matrices\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26966","kind":"claim","label":"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26966"]},"sources":[{"id":"source.frontier.arxiv-2607-26966","title":"arXiv OAI-PMH record arXiv:2607.26966: Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26966&metadataPrefix=arXiv"},{"id":"arxiv:2607.26966","title":"arXiv:2607.26966","url":"https://arxiv.org/abs/2607.26966"},{"id":"doi:10.3847/1538-4357/ad701f","title":"doi:10.3847/1538-4357/ad701f","url":"https://doi.org/10.3847/1538-4357/ad701f"}],"status":"frontier","summary":"arXiv:2607.26966 \"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26932","kind":"claim","label":"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26932"]},"sources":[{"id":"source.frontier.arxiv-2607-26932","title":"arXiv OAI-PMH record arXiv:2607.26932: J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26932&metadataPrefix=arXiv"},{"id":"arxiv:2607.26932","title":"arXiv:2607.26932","url":"https://arxiv.org/abs/2607.26932"}],"status":"frontier","summary":"arXiv:2607.26932 \"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26890","kind":"claim","label":"The Lie algebra generated by gradient vector fields","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26890"]},"sources":[{"id":"source.frontier.arxiv-2607-26890","title":"arXiv OAI-PMH record arXiv:2607.26890: The Lie algebra generated by gradient vector fields","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26890&metadataPrefix=arXiv"},{"id":"arxiv:2607.26890","title":"arXiv:2607.26890","url":"https://arxiv.org/abs/2607.26890"}],"status":"frontier","summary":"arXiv:2607.26890 \"The Lie algebra generated by gradient vector fields\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26800","kind":"claim","label":"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26800"]},"sources":[{"id":"source.frontier.arxiv-2607-26800","title":"arXiv OAI-PMH record arXiv:2607.26800: Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26800&metadataPrefix=arXiv"},{"id":"arxiv:2607.26800","title":"arXiv:2607.26800","url":"https://arxiv.org/abs/2607.26800"}],"status":"frontier","summary":"arXiv:2607.26800 \"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26782","kind":"claim","label":"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26782"]},"sources":[{"id":"source.frontier.arxiv-2607-26782","title":"arXiv OAI-PMH record arXiv:2607.26782: Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26782&metadataPrefix=arXiv"},{"id":"arxiv:2607.26782","title":"arXiv:2607.26782","url":"https://arxiv.org/abs/2607.26782"}],"status":"frontier","summary":"arXiv:2607.26782 \"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws\" (CC BY 4.0, submitted 2026-07-29) reports: \"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26677","kind":"claim","label":"A Harmonic-Map Proof of Mostow Rigidity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26677"]},"sources":[{"id":"source.frontier.arxiv-2607-26677","title":"arXiv OAI-PMH record arXiv:2607.26677: A Harmonic-Map Proof of Mostow Rigidity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26677&metadataPrefix=arXiv"},{"id":"arxiv:2607.26677","title":"arXiv:2607.26677","url":"https://arxiv.org/abs/2607.26677"}],"status":"frontier","summary":"arXiv:2607.26677 \"A Harmonic-Map Proof of Mostow Rigidity\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish a sharp pointwise gradient estimate for this lift.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26653","kind":"claim","label":"A new construction of the Riemannian deformation sequence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26653"]},"sources":[{"id":"source.frontier.arxiv-2607-26653","title":"arXiv OAI-PMH record arXiv:2607.26653: A new construction of the Riemannian deformation sequence","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26653&metadataPrefix=arXiv"},{"id":"arxiv:2607.26653","title":"arXiv:2607.26653","url":"https://arxiv.org/abs/2607.26653"}],"status":"frontier","summary":"arXiv:2607.26653 \"A new construction of the Riemannian deformation sequence\" (CC BY 4.0, submitted 2026-07-29) reports: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26508","kind":"claim","label":"An association measure for mixed-type variables","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26508"]},"sources":[{"id":"source.frontier.arxiv-2607-26508","title":"arXiv OAI-PMH record arXiv:2607.26508: An association measure for mixed-type variables","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26508&metadataPrefix=arXiv"},{"id":"arxiv:2607.26508","title":"arXiv:2607.26508","url":"https://arxiv.org/abs/2607.26508"}],"status":"frontier","summary":"arXiv:2607.26508 \"An association measure for mixed-type variables\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the strong consistency and asymptotic normality of the estimator $ξ_n'$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ'$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26484","kind":"claim","label":"d-Spectral Bitopological Spaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26484"]},"sources":[{"id":"source.frontier.arxiv-2607-26484","title":"arXiv OAI-PMH record arXiv:2607.26484: d-Spectral Bitopological Spaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26484&metadataPrefix=arXiv"},{"id":"arxiv:2607.26484","title":"arXiv:2607.26484","url":"https://arxiv.org/abs/2607.26484"}],"status":"frontier","summary":"arXiv:2607.26484 \"d-Spectral Bitopological Spaces\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26433","kind":"claim","label":"Nonlinear quantum Fokker-Planck equation near equilibrium","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26433"]},"sources":[{"id":"source.frontier.arxiv-2607-26433","title":"arXiv OAI-PMH record arXiv:2607.26433: Nonlinear quantum Fokker-Planck equation near equilibrium","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26433&metadataPrefix=arXiv"},{"id":"arxiv:2607.26433","title":"arXiv:2607.26433","url":"https://arxiv.org/abs/2607.26433"}],"status":"frontier","summary":"arXiv:2607.26433 \"Nonlinear quantum Fokker-Planck equation near equilibrium\" (CC BY 4.0, submitted 2026-07-29) reports: \"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26408","kind":"claim","label":"Phase control of multi-photon electron-positron pair creation from vacuum","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26408"]},"sources":[{"id":"source.frontier.arxiv-2607-26408","title":"arXiv OAI-PMH record arXiv:2607.26408: Phase control of multi-photon electron-positron pair creation from vacuum","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26408&metadataPrefix=arXiv"},{"id":"arxiv:2607.26408","title":"arXiv:2607.26408","url":"https://arxiv.org/abs/2607.26408"}],"status":"frontier","summary":"arXiv:2607.26408 \"Phase control of multi-photon electron-positron pair creation from vacuum\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26378","kind":"claim","label":"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26378"]},"sources":[{"id":"source.frontier.arxiv-2607-26378","title":"arXiv OAI-PMH record arXiv:2607.26378: Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26378&metadataPrefix=arXiv"},{"id":"arxiv:2607.26378","title":"arXiv:2607.26378","url":"https://arxiv.org/abs/2607.26378"}],"status":"frontier","summary":"arXiv:2607.26378 \"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26374","kind":"claim","label":"Charged Dirac stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26374"]},"sources":[{"id":"source.frontier.arxiv-2607-26374","title":"arXiv OAI-PMH record arXiv:2607.26374: Charged Dirac stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26374&metadataPrefix=arXiv"},{"id":"arxiv:2607.26374","title":"arXiv:2607.26374","url":"https://arxiv.org/abs/2607.26374"}],"status":"frontier","summary":"arXiv:2607.26374 \"Charged Dirac stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26289","kind":"claim","label":"Scale-dependent universality class crossover in magnetic skyrmion polymers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26289"]},"sources":[{"id":"source.frontier.arxiv-2607-26289","title":"arXiv OAI-PMH record arXiv:2607.26289: Scale-dependent universality class crossover in magnetic skyrmion polymers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26289&metadataPrefix=arXiv"},{"id":"arxiv:2607.26289","title":"arXiv:2607.26289","url":"https://arxiv.org/abs/2607.26289"}],"status":"frontier","summary":"arXiv:2607.26289 \"Scale-dependent universality class crossover in magnetic skyrmion polymers\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26287","kind":"claim","label":"Studying Competing Events with Federated Cumulative Incidence Curves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26287"]},"sources":[{"id":"source.frontier.arxiv-2607-26287","title":"arXiv OAI-PMH record arXiv:2607.26287: Studying Competing Events with Federated Cumulative Incidence Curves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26287&metadataPrefix=arXiv"},{"id":"arxiv:2607.26287","title":"arXiv:2607.26287","url":"https://arxiv.org/abs/2607.26287"}],"status":"frontier","summary":"arXiv:2607.26287 \"Studying Competing Events with Federated Cumulative Incidence Curves\" (CC BY 4.0, submitted 2026-07-28) reports: \"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26281","kind":"claim","label":"Concise $(\\varepsilon,r)$-representations of a path","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26281"]},"sources":[{"id":"source.frontier.arxiv-2607-26281","title":"arXiv OAI-PMH record arXiv:2607.26281: Concise $(\\varepsilon,r)$-representations of a path","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26281&metadataPrefix=arXiv"},{"id":"arxiv:2607.26281","title":"arXiv:2607.26281","url":"https://arxiv.org/abs/2607.26281"}],"status":"frontier","summary":"arXiv:2607.26281 \"Concise $(\\varepsilon,r)$-representations of a path\" (CC BY 4.0, submitted 2026-07-28) reports: \"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26205","kind":"claim","label":"Binary disruptions driven by massive disks around massive black holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26205"]},"sources":[{"id":"source.frontier.arxiv-2607-26205","title":"arXiv OAI-PMH record arXiv:2607.26205: Binary disruptions driven by massive disks around massive black holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26205&metadataPrefix=arXiv"},{"id":"arxiv:2607.26205","title":"arXiv:2607.26205","url":"https://arxiv.org/abs/2607.26205"}],"status":"frontier","summary":"arXiv:2607.26205 \"Binary disruptions driven by massive disks around massive black holes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26193","kind":"claim","label":"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26193"]},"sources":[{"id":"source.frontier.arxiv-2607-26193","title":"arXiv OAI-PMH record arXiv:2607.26193: Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26193&metadataPrefix=arXiv"},{"id":"arxiv:2607.26193","title":"arXiv:2607.26193","url":"https://arxiv.org/abs/2607.26193"}],"status":"frontier","summary":"arXiv:2607.26193 \"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26180","kind":"claim","label":"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26180"]},"sources":[{"id":"source.frontier.arxiv-2607-26180","title":"arXiv OAI-PMH record arXiv:2607.26180: Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26180&metadataPrefix=arXiv"},{"id":"arxiv:2607.26180","title":"arXiv:2607.26180","url":"https://arxiv.org/abs/2607.26180"}],"status":"frontier","summary":"arXiv:2607.26180 \"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26177","kind":"claim","label":"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26177"]},"sources":[{"id":"source.frontier.arxiv-2607-26177","title":"arXiv OAI-PMH record arXiv:2607.26177: How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26177&metadataPrefix=arXiv"},{"id":"arxiv:2607.26177","title":"arXiv:2607.26177","url":"https://arxiv.org/abs/2607.26177"}],"status":"frontier","summary":"arXiv:2607.26177 \"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26151","kind":"claim","label":"Quantum spin-glass criticality in disordered frustrated dimer magnets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26151"]},"sources":[{"id":"source.frontier.arxiv-2607-26151","title":"arXiv OAI-PMH record arXiv:2607.26151: Quantum spin-glass criticality in disordered frustrated dimer magnets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26151&metadataPrefix=arXiv"},{"id":"arxiv:2607.26151","title":"arXiv:2607.26151","url":"https://arxiv.org/abs/2607.26151"}],"status":"frontier","summary":"arXiv:2607.26151 \"Quantum spin-glass criticality in disordered frustrated dimer magnets\" (CC BY 4.0, submitted 2026-07-28) reports: \"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26147","kind":"claim","label":"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26147"]},"sources":[{"id":"source.frontier.arxiv-2607-26147","title":"arXiv OAI-PMH record arXiv:2607.26147: The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26147&metadataPrefix=arXiv"},{"id":"arxiv:2607.26147","title":"arXiv:2607.26147","url":"https://arxiv.org/abs/2607.26147"}],"status":"frontier","summary":"arXiv:2607.26147 \"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity\" (CC BY 4.0, submitted 2026-07-28) reports: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26141","kind":"claim","label":"Light propagation and intensity transport in metric-affine geometry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26141"]},"sources":[{"id":"source.frontier.arxiv-2607-26141","title":"arXiv OAI-PMH record arXiv:2607.26141: Light propagation and intensity transport in metric-affine geometry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26141&metadataPrefix=arXiv"},{"id":"arxiv:2607.26141","title":"arXiv:2607.26141","url":"https://arxiv.org/abs/2607.26141"}],"status":"frontier","summary":"arXiv:2607.26141 \"Light propagation and intensity transport in metric-affine geometry\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26103","kind":"claim","label":"A rigid spherical shell enclosing a degenerate wormhole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26103"]},"sources":[{"id":"source.frontier.arxiv-2607-26103","title":"arXiv OAI-PMH record arXiv:2607.26103: A rigid spherical shell enclosing a degenerate wormhole","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26103&metadataPrefix=arXiv"},{"id":"arxiv:2607.26103","title":"arXiv:2607.26103","url":"https://arxiv.org/abs/2607.26103"}],"status":"frontier","summary":"arXiv:2607.26103 \"A rigid spherical shell enclosing a degenerate wormhole\" (CC BY 4.0, submitted 2026-07-28) reports: \"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26030","kind":"claim","label":"Soft-mode nonlinearities away from ferroelectric phase transition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26030"]},"sources":[{"id":"source.frontier.arxiv-2607-26030","title":"arXiv OAI-PMH record arXiv:2607.26030: Soft-mode nonlinearities away from ferroelectric phase transition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26030&metadataPrefix=arXiv"},{"id":"arxiv:2607.26030","title":"arXiv:2607.26030","url":"https://arxiv.org/abs/2607.26030"}],"status":"frontier","summary":"arXiv:2607.26030 \"Soft-mode nonlinearities away from ferroelectric phase transition\" (CC BY 4.0, submitted 2026-07-28) reports: \"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25977","kind":"claim","label":"The Internal Modal Logic of Forcing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25977"]},"sources":[{"id":"source.frontier.arxiv-2607-25977","title":"arXiv OAI-PMH record arXiv:2607.25977: The Internal Modal Logic of Forcing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25977&metadataPrefix=arXiv"},{"id":"arxiv:2607.25977","title":"arXiv:2607.25977","url":"https://arxiv.org/abs/2607.25977"}],"status":"frontier","summary":"arXiv:2607.25977 \"The Internal Modal Logic of Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25960","kind":"claim","label":"Quantum Steenrod powers and Hamiltonian maps","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25960"]},"sources":[{"id":"source.frontier.arxiv-2607-25960","title":"arXiv OAI-PMH record arXiv:2607.25960: Quantum Steenrod powers and Hamiltonian maps","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25960&metadataPrefix=arXiv"},{"id":"arxiv:2607.25960","title":"arXiv:2607.25960","url":"https://arxiv.org/abs/2607.25960"}],"status":"frontier","summary":"arXiv:2607.25960 \"Quantum Steenrod powers and Hamiltonian maps\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including: 1.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25950","kind":"claim","label":"Weak-form Extended Dynamic Mode Decomposition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25950"]},"sources":[{"id":"source.frontier.arxiv-2607-25950","title":"arXiv OAI-PMH record arXiv:2607.25950: Weak-form Extended Dynamic Mode Decomposition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25950&metadataPrefix=arXiv"},{"id":"arxiv:2607.25950","title":"arXiv:2607.25950","url":"https://arxiv.org/abs/2607.25950"}],"status":"frontier","summary":"arXiv:2607.25950 \"Weak-form Extended Dynamic Mode Decomposition\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25910","kind":"claim","label":"$d$-Translated Unit Sensitive Primes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25910"]},"sources":[{"id":"source.frontier.arxiv-2607-25910","title":"arXiv OAI-PMH record arXiv:2607.25910: $d$-Translated Unit Sensitive Primes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25910&metadataPrefix=arXiv"},{"id":"arxiv:2607.25910","title":"arXiv:2607.25910","url":"https://arxiv.org/abs/2607.25910"}],"status":"frontier","summary":"arXiv:2607.25910 \"$d$-Translated Unit Sensitive Primes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25865","kind":"claim","label":"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25865"]},"sources":[{"id":"source.frontier.arxiv-2607-25865","title":"arXiv OAI-PMH record arXiv:2607.25865: OmniQEC: discovering practical quantum error-correcting codes by an AI scientist","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25865&metadataPrefix=arXiv"},{"id":"arxiv:2607.25865","title":"arXiv:2607.25865","url":"https://arxiv.org/abs/2607.25865"}],"status":"frontier","summary":"arXiv:2607.25865 \"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist\" (CC BY 4.0, submitted 2026-07-28) reports: \"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25772","kind":"claim","label":"Contact Surgery Numbers of the 3-torus","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25772"]},"sources":[{"id":"source.frontier.arxiv-2607-25772","title":"arXiv OAI-PMH record arXiv:2607.25772: Contact Surgery Numbers of the 3-torus","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25772&metadataPrefix=arXiv"},{"id":"arxiv:2607.25772","title":"arXiv:2607.25772","url":"https://arxiv.org/abs/2607.25772"}],"status":"frontier","summary":"arXiv:2607.25772 \"Contact Surgery Numbers of the 3-torus\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25743","kind":"claim","label":"Physical Mechanism of Vacuole Formation in Liquid Droplets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25743"]},"sources":[{"id":"source.frontier.arxiv-2607-25743","title":"arXiv OAI-PMH record arXiv:2607.25743: Physical Mechanism of Vacuole Formation in Liquid Droplets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25743&metadataPrefix=arXiv"},{"id":"arxiv:2607.25743","title":"arXiv:2607.25743","url":"https://arxiv.org/abs/2607.25743"}],"status":"frontier","summary":"arXiv:2607.25743 \"Physical Mechanism of Vacuole Formation in Liquid Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25706","kind":"claim","label":"Categories of tagged lenses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25706"]},"sources":[{"id":"source.frontier.arxiv-2607-25706","title":"arXiv OAI-PMH record arXiv:2607.25706: Categories of tagged lenses","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25706&metadataPrefix=arXiv"},{"id":"arxiv:2607.25706","title":"arXiv:2607.25706","url":"https://arxiv.org/abs/2607.25706"}],"status":"frontier","summary":"arXiv:2607.25706 \"Categories of tagged lenses\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25678","kind":"claim","label":"Engineering a Quantum Thermal Diode with Floquet Driving","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25678"]},"sources":[{"id":"source.frontier.arxiv-2607-25678","title":"arXiv OAI-PMH record arXiv:2607.25678: Engineering a Quantum Thermal Diode with Floquet Driving","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25678&metadataPrefix=arXiv"},{"id":"arxiv:2607.25678","title":"arXiv:2607.25678","url":"https://arxiv.org/abs/2607.25678"}],"status":"frontier","summary":"arXiv:2607.25678 \"Engineering a Quantum Thermal Diode with Floquet Driving\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25644","kind":"claim","label":"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25644"]},"sources":[{"id":"source.frontier.arxiv-2607-25644","title":"arXiv OAI-PMH record arXiv:2607.25644: Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25644&metadataPrefix=arXiv"},{"id":"arxiv:2607.25644","title":"arXiv:2607.25644","url":"https://arxiv.org/abs/2607.25644"}],"status":"frontier","summary":"arXiv:2607.25644 \"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers\" (CC0 1.0, submitted 2026-07-28) reports: \"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25625","kind":"claim","label":"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25625"]},"sources":[{"id":"source.frontier.arxiv-2607-25625","title":"arXiv OAI-PMH record arXiv:2607.25625: Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25625&metadataPrefix=arXiv"},{"id":"arxiv:2607.25625","title":"arXiv:2607.25625","url":"https://arxiv.org/abs/2607.25625"}],"status":"frontier","summary":"arXiv:2607.25625 \"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain\" (CC BY 4.0, submitted 2026-07-28) reports: \"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25621","kind":"claim","label":"A Lusin theorem for nonlocal gradients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25621"]},"sources":[{"id":"source.frontier.arxiv-2607-25621","title":"arXiv OAI-PMH record arXiv:2607.25621: A Lusin theorem for nonlocal gradients","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25621&metadataPrefix=arXiv"},{"id":"arxiv:2607.25621","title":"arXiv:2607.25621","url":"https://arxiv.org/abs/2607.25621"}],"status":"frontier","summary":"arXiv:2607.25621 \"A Lusin theorem for nonlocal gradients\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25610","kind":"claim","label":"Brjuno condition through best approximations and the linearization problem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25610"]},"sources":[{"id":"source.frontier.arxiv-2607-25610","title":"arXiv OAI-PMH record arXiv:2607.25610: Brjuno condition through best approximations and the linearization problem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25610&metadataPrefix=arXiv"},{"id":"arxiv:2607.25610","title":"arXiv:2607.25610","url":"https://arxiv.org/abs/2607.25610"}],"status":"frontier","summary":"arXiv:2607.25610 \"Brjuno condition through best approximations and the linearization problem\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25559","kind":"claim","label":"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25559"]},"sources":[{"id":"source.frontier.arxiv-2607-25559","title":"arXiv OAI-PMH record arXiv:2607.25559: Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25559&metadataPrefix=arXiv"},{"id":"arxiv:2607.25559","title":"arXiv:2607.25559","url":"https://arxiv.org/abs/2607.25559"}],"status":"frontier","summary":"arXiv:2607.25559 \"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25473","kind":"claim","label":"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25473"]},"sources":[{"id":"source.frontier.arxiv-2607-25473","title":"arXiv OAI-PMH record arXiv:2607.25473: Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25473&metadataPrefix=arXiv"},{"id":"arxiv:2607.25473","title":"arXiv:2607.25473","url":"https://arxiv.org/abs/2607.25473"}],"status":"frontier","summary":"arXiv:2607.25473 \"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25460","kind":"claim","label":"Initial algebras from constructive ordinals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25460"]},"sources":[{"id":"source.frontier.arxiv-2607-25460","title":"arXiv OAI-PMH record arXiv:2607.25460: Initial algebras from constructive ordinals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25460&metadataPrefix=arXiv"},{"id":"arxiv:2607.25460","title":"arXiv:2607.25460","url":"https://arxiv.org/abs/2607.25460"}],"status":"frontier","summary":"arXiv:2607.25460 \"Initial algebras from constructive ordinals\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25394","kind":"claim","label":"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25394"]},"sources":[{"id":"source.frontier.arxiv-2607-25394","title":"arXiv OAI-PMH record arXiv:2607.25394: Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25394&metadataPrefix=arXiv"},{"id":"arxiv:2607.25394","title":"arXiv:2607.25394","url":"https://arxiv.org/abs/2607.25394"}],"status":"frontier","summary":"arXiv:2607.25394 \"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals\" (CC BY 4.0, submitted 2026-07-28) reports: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25341","kind":"claim","label":"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25341"]},"sources":[{"id":"source.frontier.arxiv-2607-25341","title":"arXiv OAI-PMH record arXiv:2607.25341: Remote entanglement of massive oscillators via wire-mediated Coulomb interaction","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25341&metadataPrefix=arXiv"},{"id":"arxiv:2607.25341","title":"arXiv:2607.25341","url":"https://arxiv.org/abs/2607.25341"}],"status":"frontier","summary":"arXiv:2607.25341 \"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25252","kind":"claim","label":"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25252"]},"sources":[{"id":"source.frontier.arxiv-2607-25252","title":"arXiv OAI-PMH record arXiv:2607.25252: Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25252&metadataPrefix=arXiv"},{"id":"arxiv:2607.25252","title":"arXiv:2607.25252","url":"https://arxiv.org/abs/2607.25252"}],"status":"frontier","summary":"arXiv:2607.25252 \"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality\" (CC BY 4.0, submitted 2026-07-28) reports: \"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25226","kind":"claim","label":"The quantum electrodynamics for dyons","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25226"]},"sources":[{"id":"source.frontier.arxiv-2607-25226","title":"arXiv OAI-PMH record arXiv:2607.25226: The quantum electrodynamics for dyons","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25226&metadataPrefix=arXiv"},{"id":"arxiv:2607.25226","title":"arXiv:2607.25226","url":"https://arxiv.org/abs/2607.25226"}],"status":"frontier","summary":"arXiv:2607.25226 \"The quantum electrodynamics for dyons\" (CC0 1.0, submitted 2026-07-28) reports: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21883","kind":"claim","label":"Explicit bounds for Buchstab's function","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-21883"]},"sources":[{"id":"source.frontier.arxiv-2607-21883","title":"arXiv OAI-PMH record arXiv:2607.21883: Explicit bounds for Buchstab's function","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21883&metadataPrefix=arXiv"},{"id":"arxiv:2607.21883","title":"arXiv:2607.21883","url":"https://arxiv.org/abs/2607.21883"}],"status":"frontier","summary":"arXiv:2607.21883 \"Explicit bounds for Buchstab's function\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18525","kind":"claim","label":"Regular Ultrametric Skeletons","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-18525"]},"sources":[{"id":"source.frontier.arxiv-2607-18525","title":"arXiv OAI-PMH record arXiv:2607.18525: Regular Ultrametric Skeletons","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18525&metadataPrefix=arXiv"},{"id":"arxiv:2607.18525","title":"arXiv:2607.18525","url":"https://arxiv.org/abs/2607.18525"}],"status":"frontier","summary":"arXiv:2607.18525 \"Regular Ultrametric Skeletons\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-13775","kind":"claim","label":"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-13775"]},"sources":[{"id":"source.frontier.arxiv-2607-13775","title":"arXiv OAI-PMH record arXiv:2607.13775: A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13775&metadataPrefix=arXiv"},{"id":"arxiv:2607.13775","title":"arXiv:2607.13775","url":"https://arxiv.org/abs/2607.13775"}],"status":"frontier","summary":"arXiv:2607.13775 \"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime\" (CC0 1.0, submitted 2026-07-28) reports: \"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-05687","kind":"claim","label":"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-05687"]},"sources":[{"id":"source.frontier.arxiv-2607-05687","title":"arXiv OAI-PMH record arXiv:2607.05687: Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05687&metadataPrefix=arXiv"},{"id":"arxiv:2607.05687","title":"arXiv:2607.05687","url":"https://arxiv.org/abs/2607.05687"}],"status":"frontier","summary":"arXiv:2607.05687 \"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-05485","kind":"claim","label":"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-05485"]},"sources":[{"id":"source.frontier.arxiv-2607-05485","title":"arXiv OAI-PMH record arXiv:2607.05485: An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05485&metadataPrefix=arXiv"},{"id":"arxiv:2607.05485","title":"arXiv:2607.05485","url":"https://arxiv.org/abs/2607.05485"}],"status":"frontier","summary":"arXiv:2607.05485 \"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24988","kind":"claim","label":"Maximal complementarity in the n-qubit Pauli group","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24988"]},"sources":[{"id":"source.frontier.arxiv-2607-24988","title":"arXiv OAI-PMH record arXiv:2607.24988: Maximal complementarity in the n-qubit Pauli group","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24988&metadataPrefix=arXiv"},{"id":"arxiv:2607.24988","title":"arXiv:2607.24988","url":"https://arxiv.org/abs/2607.24988"}],"status":"frontier","summary":"arXiv:2607.24988 \"Maximal complementarity in the n-qubit Pauli group\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24938","kind":"claim","label":"Tidal deformation of an accreting compact object","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24938"]},"sources":[{"id":"source.frontier.arxiv-2607-24938","title":"arXiv OAI-PMH record arXiv:2607.24938: Tidal deformation of an accreting compact object","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24938&metadataPrefix=arXiv"},{"id":"arxiv:2607.24938","title":"arXiv:2607.24938","url":"https://arxiv.org/abs/2607.24938"}],"status":"frontier","summary":"arXiv:2607.24938 \"Tidal deformation of an accreting compact object\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24933","kind":"claim","label":"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24933"]},"sources":[{"id":"source.frontier.arxiv-2607-24933","title":"arXiv OAI-PMH record arXiv:2607.24933: Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24933&metadataPrefix=arXiv"},{"id":"arxiv:2607.24933","title":"arXiv:2607.24933","url":"https://arxiv.org/abs/2607.24933"}],"status":"frontier","summary":"arXiv:2607.24933 \"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24918","kind":"claim","label":"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24918"]},"sources":[{"id":"source.frontier.arxiv-2607-24918","title":"arXiv OAI-PMH record arXiv:2607.24918: Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24918&metadataPrefix=arXiv"},{"id":"arxiv:2607.24918","title":"arXiv:2607.24918","url":"https://arxiv.org/abs/2607.24918"}],"status":"frontier","summary":"arXiv:2607.24918 \"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24705","kind":"claim","label":"Derangetropy Operators","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24705"]},"sources":[{"id":"source.frontier.arxiv-2607-24705","title":"arXiv OAI-PMH record arXiv:2607.24705: Derangetropy Operators","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24705&metadataPrefix=arXiv"},{"id":"arxiv:2607.24705","title":"arXiv:2607.24705","url":"https://arxiv.org/abs/2607.24705"}],"status":"frontier","summary":"arXiv:2607.24705 \"Derangetropy Operators\" (CC BY 4.0, submitted 2026-07-27) reports: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24682","kind":"claim","label":"CP-preserving channels","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24682"]},"sources":[{"id":"source.frontier.arxiv-2607-24682","title":"arXiv OAI-PMH record arXiv:2607.24682: CP-preserving channels","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24682&metadataPrefix=arXiv"},{"id":"arxiv:2607.24682","title":"arXiv:2607.24682","url":"https://arxiv.org/abs/2607.24682"}],"status":"frontier","summary":"arXiv:2607.24682 \"CP-preserving channels\" (CC BY 4.0, submitted 2026-07-27) reports: \"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24654","kind":"claim","label":"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24654"]},"sources":[{"id":"source.frontier.arxiv-2607-24654","title":"arXiv OAI-PMH record arXiv:2607.24654: Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24654&metadataPrefix=arXiv"},{"id":"arxiv:2607.24654","title":"arXiv:2607.24654","url":"https://arxiv.org/abs/2607.24654"}],"status":"frontier","summary":"arXiv:2607.24654 \"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24641","kind":"claim","label":"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24641"]},"sources":[{"id":"source.frontier.arxiv-2607-24641","title":"arXiv OAI-PMH record arXiv:2607.24641: Efficient Topic Model Estimation under Heavy-Tailed Document Lengths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24641&metadataPrefix=arXiv"},{"id":"arxiv:2607.24641","title":"arXiv:2607.24641","url":"https://arxiv.org/abs/2607.24641"}],"status":"frontier","summary":"arXiv:2607.24641 \"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24605","kind":"claim","label":"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24605"]},"sources":[{"id":"source.frontier.arxiv-2607-24605","title":"arXiv OAI-PMH record arXiv:2607.24605: Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24605&metadataPrefix=arXiv"},{"id":"arxiv:2607.24605","title":"arXiv:2607.24605","url":"https://arxiv.org/abs/2607.24605"}],"status":"frontier","summary":"arXiv:2607.24605 \"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24584","kind":"claim","label":"Invisible decay of solar neutrinos at dark matter experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24584"]},"sources":[{"id":"source.frontier.arxiv-2607-24584","title":"arXiv OAI-PMH record arXiv:2607.24584: Invisible decay of solar neutrinos at dark matter experiments","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24584&metadataPrefix=arXiv"},{"id":"arxiv:2607.24584","title":"arXiv:2607.24584","url":"https://arxiv.org/abs/2607.24584"}],"status":"frontier","summary":"arXiv:2607.24584 \"Invisible decay of solar neutrinos at dark matter experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24544","kind":"claim","label":"An Halpha survey of infrared bow-shocks around OB-type stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24544"]},"sources":[{"id":"source.frontier.arxiv-2607-24544","title":"arXiv OAI-PMH record arXiv:2607.24544: An Halpha survey of infrared bow-shocks around OB-type stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24544&metadataPrefix=arXiv"},{"id":"arxiv:2607.24544","title":"arXiv:2607.24544","url":"https://arxiv.org/abs/2607.24544"}],"status":"frontier","summary":"arXiv:2607.24544 \"An Halpha survey of infrared bow-shocks around OB-type stars\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24524","kind":"claim","label":"Light Dark Matter Discovery Potential and Model Selection at LDMX","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24524"]},"sources":[{"id":"source.frontier.arxiv-2607-24524","title":"arXiv OAI-PMH record arXiv:2607.24524: Light Dark Matter Discovery Potential and Model Selection at LDMX","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24524&metadataPrefix=arXiv"},{"id":"arxiv:2607.24524","title":"arXiv:2607.24524","url":"https://arxiv.org/abs/2607.24524"}],"status":"frontier","summary":"arXiv:2607.24524 \"Light Dark Matter Discovery Potential and Model Selection at LDMX\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24489","kind":"claim","label":"Asymptotic areas between powers of sine and cosine curves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24489"]},"sources":[{"id":"source.frontier.arxiv-2607-24489","title":"arXiv OAI-PMH record arXiv:2607.24489: Asymptotic areas between powers of sine and cosine curves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24489&metadataPrefix=arXiv"},{"id":"arxiv:2607.24489","title":"arXiv:2607.24489","url":"https://arxiv.org/abs/2607.24489"}],"status":"frontier","summary":"arXiv:2607.24489 \"Asymptotic areas between powers of sine and cosine curves\" (CC BY 4.0, submitted 2026-07-27) reports: \"Motivated by Dombrowski and Dresden's work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24446","kind":"claim","label":"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24446"]},"sources":[{"id":"source.frontier.arxiv-2607-24446","title":"arXiv OAI-PMH record arXiv:2607.24446: Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24446&metadataPrefix=arXiv"},{"id":"arxiv:2607.24446","title":"arXiv:2607.24446","url":"https://arxiv.org/abs/2607.24446"}],"status":"frontier","summary":"arXiv:2607.24446 \"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24433","kind":"claim","label":"Justification Logic of the Lambda Calculus","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24433"]},"sources":[{"id":"source.frontier.arxiv-2607-24433","title":"arXiv OAI-PMH record arXiv:2607.24433: Justification Logic of the Lambda Calculus","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24433&metadataPrefix=arXiv"},{"id":"arxiv:2607.24433","title":"arXiv:2607.24433","url":"https://arxiv.org/abs/2607.24433"}],"status":"frontier","summary":"arXiv:2607.24433 \"Justification Logic of the Lambda Calculus\" (CC BY 4.0, submitted 2026-07-27) reports: \"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24254","kind":"claim","label":"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24254"]},"sources":[{"id":"source.frontier.arxiv-2607-24254","title":"arXiv OAI-PMH record arXiv:2607.24254: Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24254&metadataPrefix=arXiv"},{"id":"arxiv:2607.24254","title":"arXiv:2607.24254","url":"https://arxiv.org/abs/2607.24254"}],"status":"frontier","summary":"arXiv:2607.24254 \"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes\" (CC BY 4.0, submitted 2026-07-27) reports: \"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24252","kind":"claim","label":"Non-Reciprocal yet Equilibrium Critical Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24252"]},"sources":[{"id":"source.frontier.arxiv-2607-24252","title":"arXiv OAI-PMH record arXiv:2607.24252: Non-Reciprocal yet Equilibrium Critical Dynamics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24252&metadataPrefix=arXiv"},{"id":"arxiv:2607.24252","title":"arXiv:2607.24252","url":"https://arxiv.org/abs/2607.24252"}],"status":"frontier","summary":"arXiv:2607.24252 \"Non-Reciprocal yet Equilibrium Critical Dynamics\" (CC BY 4.0, submitted 2026-07-27) reports: \"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24244","kind":"claim","label":"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24244"]},"sources":[{"id":"source.frontier.arxiv-2607-24244","title":"arXiv OAI-PMH record arXiv:2607.24244: Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24244&metadataPrefix=arXiv"},{"id":"arxiv:2607.24244","title":"arXiv:2607.24244","url":"https://arxiv.org/abs/2607.24244"}],"status":"frontier","summary":"arXiv:2607.24244 \"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance\" (CC BY 4.0, submitted 2026-07-27) reports: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24240","kind":"claim","label":"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24240"]},"sources":[{"id":"source.frontier.arxiv-2607-24240","title":"arXiv OAI-PMH record arXiv:2607.24240: Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24240&metadataPrefix=arXiv"},{"id":"arxiv:2607.24240","title":"arXiv:2607.24240","url":"https://arxiv.org/abs/2607.24240"}],"status":"frontier","summary":"arXiv:2607.24240 \"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24239","kind":"claim","label":"Evolution of dipole-dipole dynamics in cold ammonia collisions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24239"]},"sources":[{"id":"source.frontier.arxiv-2607-24239","title":"arXiv OAI-PMH record arXiv:2607.24239: Evolution of dipole-dipole dynamics in cold ammonia collisions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24239&metadataPrefix=arXiv"},{"id":"arxiv:2607.24239","title":"arXiv:2607.24239","url":"https://arxiv.org/abs/2607.24239"}],"status":"frontier","summary":"arXiv:2607.24239 \"Evolution of dipole-dipole dynamics in cold ammonia collisions\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24212","kind":"claim","label":"Convex Biproducts, Stochastic Matrices and Tape Diagrams","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24212"]},"sources":[{"id":"source.frontier.arxiv-2607-24212","title":"arXiv OAI-PMH record arXiv:2607.24212: Convex Biproducts, Stochastic Matrices and Tape Diagrams","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24212&metadataPrefix=arXiv"},{"id":"arxiv:2607.24212","title":"arXiv:2607.24212","url":"https://arxiv.org/abs/2607.24212"}],"status":"frontier","summary":"arXiv:2607.24212 \"Convex Biproducts, Stochastic Matrices and Tape Diagrams\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24144","kind":"claim","label":"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24144"]},"sources":[{"id":"source.frontier.arxiv-2607-24144","title":"arXiv OAI-PMH record arXiv:2607.24144: Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24144&metadataPrefix=arXiv"},{"id":"arxiv:2607.24144","title":"arXiv:2607.24144","url":"https://arxiv.org/abs/2607.24144"}],"status":"frontier","summary":"arXiv:2607.24144 \"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile\" (CC BY 4.0, submitted 2026-07-27) reports: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24123","kind":"claim","label":"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24123"]},"sources":[{"id":"source.frontier.arxiv-2607-24123","title":"arXiv OAI-PMH record arXiv:2607.24123: Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24123&metadataPrefix=arXiv"},{"id":"arxiv:2607.24123","title":"arXiv:2607.24123","url":"https://arxiv.org/abs/2607.24123"}],"status":"frontier","summary":"arXiv:2607.24123 \"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means\" (CC BY 4.0, submitted 2026-07-27) reports: \"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24091","kind":"claim","label":"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24091"]},"sources":[{"id":"source.frontier.arxiv-2607-24091","title":"arXiv OAI-PMH record arXiv:2607.24091: Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24091&metadataPrefix=arXiv"},{"id":"arxiv:2607.24091","title":"arXiv:2607.24091","url":"https://arxiv.org/abs/2607.24091"}],"status":"frontier","summary":"arXiv:2607.24091 \"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach\" (CC BY 4.0, submitted 2026-07-27) reports: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24078","kind":"claim","label":"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24078"]},"sources":[{"id":"source.frontier.arxiv-2607-24078","title":"arXiv OAI-PMH record arXiv:2607.24078: Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24078&metadataPrefix=arXiv"},{"id":"arxiv:2607.24078","title":"arXiv:2607.24078","url":"https://arxiv.org/abs/2607.24078"}],"status":"frontier","summary":"arXiv:2607.24078 \"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations\" (CC BY 4.0, submitted 2026-07-27) reports: \"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23978","kind":"claim","label":"Non-Hermitian-enhanced quantum sensing in an optical interferometer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-23978"]},"sources":[{"id":"source.frontier.arxiv-2607-23978","title":"arXiv OAI-PMH record arXiv:2607.23978: Non-Hermitian-enhanced quantum sensing in an optical interferometer","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23978&metadataPrefix=arXiv"},{"id":"arxiv:2607.23978","title":"arXiv:2607.23978","url":"https://arxiv.org/abs/2607.23978"}],"status":"frontier","summary":"arXiv:2607.23978 \"Non-Hermitian-enhanced quantum sensing in an optical interferometer\" (CC BY 4.0, submitted 2026-07-27) reports: \"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23956","kind":"claim","label":"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-23956"]},"sources":[{"id":"source.frontier.arxiv-2607-23956","title":"arXiv OAI-PMH record arXiv:2607.23956: Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23956&metadataPrefix=arXiv"},{"id":"arxiv:2607.23956","title":"arXiv:2607.23956","url":"https://arxiv.org/abs/2607.23956"}],"status":"frontier","summary":"arXiv:2607.23956 \"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-12128","kind":"claim","label":"Categorical Tensor-Graph Semantics for Quantum Algorithms","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-12128"]},"sources":[{"id":"source.frontier.arxiv-2607-12128","title":"arXiv OAI-PMH record arXiv:2607.12128: Categorical Tensor-Graph Semantics for Quantum Algorithms","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12128&metadataPrefix=arXiv"},{"id":"arxiv:2607.12128","title":"arXiv:2607.12128","url":"https://arxiv.org/abs/2607.12128"}],"status":"frontier","summary":"arXiv:2607.12128 \"Categorical Tensor-Graph Semantics for Quantum Algorithms\" (CC BY 4.0, submitted 2026-07-27) reports: \"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26084","kind":"claim","label":"Observational Constraints on Emergent Fractional Fractal Cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-26084"]},"sources":[{"id":"source.frontier.arxiv-2607-26084","title":"arXiv OAI-PMH record arXiv:2607.26084: Observational Constraints on Emergent Fractional Fractal Cosmology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26084&metadataPrefix=arXiv"},{"id":"arxiv:2607.26084","title":"arXiv:2607.26084","url":"https://arxiv.org/abs/2607.26084"},{"id":"doi:10.1088/1361-6382/ae8e27","title":"doi:10.1088/1361-6382/ae8e27","url":"https://doi.org/10.1088/1361-6382/ae8e27"}],"status":"frontier","summary":"arXiv:2607.26084 \"Observational Constraints on Emergent Fractional Fractal Cosmology\" (CC BY 4.0, submitted 2026-07-26) reports: \"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23859","kind":"claim","label":"A note on the cohomology of pullback Lie algebroids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23859"]},"sources":[{"id":"source.frontier.arxiv-2607-23859","title":"arXiv OAI-PMH record arXiv:2607.23859: A note on the cohomology of pullback Lie algebroids","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23859&metadataPrefix=arXiv"},{"id":"arxiv:2607.23859","title":"arXiv:2607.23859","url":"https://arxiv.org/abs/2607.23859"}],"status":"frontier","summary":"arXiv:2607.23859 \"A note on the cohomology of pullback Lie algebroids\" (CC BY 4.0, submitted 2026-07-26) reports: \"We also prove the analogous result for holomorphic Lie algebroids.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23814","kind":"claim","label":"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23814"]},"sources":[{"id":"source.frontier.arxiv-2607-23814","title":"arXiv OAI-PMH record arXiv:2607.23814: Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23814&metadataPrefix=arXiv"},{"id":"arxiv:2607.23814","title":"arXiv:2607.23814","url":"https://arxiv.org/abs/2607.23814"}],"status":"frontier","summary":"arXiv:2607.23814 \"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination\" (CC BY 4.0, submitted 2026-07-26) reports: \"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23798","kind":"claim","label":"Interpolation via Generalized Splitting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23798"]},"sources":[{"id":"source.frontier.arxiv-2607-23798","title":"arXiv OAI-PMH record arXiv:2607.23798: Interpolation via Generalized Splitting","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23798&metadataPrefix=arXiv"},{"id":"arxiv:2607.23798","title":"arXiv:2607.23798","url":"https://arxiv.org/abs/2607.23798"}],"status":"frontier","summary":"arXiv:2607.23798 \"Interpolation via Generalized Splitting\" (CC BY 4.0, submitted 2026-07-26) reports: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23596","kind":"claim","label":"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23596"]},"sources":[{"id":"source.frontier.arxiv-2607-23596","title":"arXiv OAI-PMH record arXiv:2607.23596: Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23596&metadataPrefix=arXiv"},{"id":"arxiv:2607.23596","title":"arXiv:2607.23596","url":"https://arxiv.org/abs/2607.23596"}],"status":"frontier","summary":"arXiv:2607.23596 \"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis\" (CC BY 4.0, submitted 2026-07-26) reports: \"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23430","kind":"claim","label":"Dialectica Categories over Heyting Algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23430"]},"sources":[{"id":"source.frontier.arxiv-2607-23430","title":"arXiv OAI-PMH record arXiv:2607.23430: Dialectica Categories over Heyting Algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23430&metadataPrefix=arXiv"},{"id":"arxiv:2607.23430","title":"arXiv:2607.23430","url":"https://arxiv.org/abs/2607.23430"}],"status":"frontier","summary":"arXiv:2607.23430 \"Dialectica Categories over Heyting Algebras\" (CC BY 4.0, submitted 2026-07-26) reports: \"In the case of de Paiva's categorification of Gödel's Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23428","kind":"claim","label":"Pinching rigidity of surfaces with parallel mean curvature vector in spheres","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23428"]},"sources":[{"id":"source.frontier.arxiv-2607-23428","title":"arXiv OAI-PMH record arXiv:2607.23428: Pinching rigidity of surfaces with parallel mean curvature vector in spheres","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23428&metadataPrefix=arXiv"},{"id":"arxiv:2607.23428","title":"arXiv:2607.23428","url":"https://arxiv.org/abs/2607.23428"}],"status":"frontier","summary":"arXiv:2607.23428 \"Pinching rigidity of surfaces with parallel mean curvature vector in spheres\" (CC0 1.0, submitted 2026-07-26) reports: \"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23236","kind":"claim","label":"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23236"]},"sources":[{"id":"source.frontier.arxiv-2607-23236","title":"arXiv OAI-PMH record arXiv:2607.23236: FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23236&metadataPrefix=arXiv"},{"id":"arxiv:2607.23236","title":"arXiv:2607.23236","url":"https://arxiv.org/abs/2607.23236"}],"status":"frontier","summary":"arXiv:2607.23236 \"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos\" (CC BY 4.0, submitted 2026-07-25) reports: \"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23212","kind":"claim","label":"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23212"]},"sources":[{"id":"source.frontier.arxiv-2607-23212","title":"arXiv OAI-PMH record arXiv:2607.23212: Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23212&metadataPrefix=arXiv"},{"id":"arxiv:2607.23212","title":"arXiv:2607.23212","url":"https://arxiv.org/abs/2607.23212"}],"status":"frontier","summary":"arXiv:2607.23212 \"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations\" (CC BY 4.0, submitted 2026-07-25) reports: \"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23192","kind":"claim","label":"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23192"]},"sources":[{"id":"source.frontier.arxiv-2607-23192","title":"arXiv OAI-PMH record arXiv:2607.23192: Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23192&metadataPrefix=arXiv"},{"id":"arxiv:2607.23192","title":"arXiv:2607.23192","url":"https://arxiv.org/abs/2607.23192"}],"status":"frontier","summary":"arXiv:2607.23192 \"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian\" (CC0 1.0, submitted 2026-07-25) reports: \"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22985","kind":"claim","label":"Robust Conformalized Selection with Noisy Responses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-22985"]},"sources":[{"id":"source.frontier.arxiv-2607-22985","title":"arXiv OAI-PMH record arXiv:2607.22985: Robust Conformalized Selection with Noisy Responses","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22985&metadataPrefix=arXiv"},{"id":"arxiv:2607.22985","title":"arXiv:2607.22985","url":"https://arxiv.org/abs/2607.22985"}],"status":"frontier","summary":"arXiv:2607.22985 \"Robust Conformalized Selection with Noisy Responses\" (CC BY 4.0, submitted 2026-07-25) reports: \"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22958","kind":"claim","label":"Quickest Detection with Rough Path Signatures","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22958"]},"sources":[{"id":"source.frontier.arxiv-2607-22958","title":"arXiv OAI-PMH record arXiv:2607.22958: Quickest Detection with Rough Path Signatures","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22958&metadataPrefix=arXiv"},{"id":"arxiv:2607.22958","title":"arXiv:2607.22958","url":"https://arxiv.org/abs/2607.22958"}],"status":"frontier","summary":"arXiv:2607.22958 \"Quickest Detection with Rough Path Signatures\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22920","kind":"claim","label":"Equidistribution of currents under Anosov group actions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22920"]},"sources":[{"id":"source.frontier.arxiv-2607-22920","title":"arXiv OAI-PMH record arXiv:2607.22920: Equidistribution of currents under Anosov group actions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22920&metadataPrefix=arXiv"},{"id":"arxiv:2607.22920","title":"arXiv:2607.22920","url":"https://arxiv.org/abs/2607.22920"}],"status":"frontier","summary":"arXiv:2607.22920 \"Equidistribution of currents under Anosov group actions\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22892","kind":"claim","label":"Mirror Langevin diffusions: Convergence rates and Markov chain approximations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22892"]},"sources":[{"id":"source.frontier.arxiv-2607-22892","title":"arXiv OAI-PMH record arXiv:2607.22892: Mirror Langevin diffusions: Convergence rates and Markov chain approximations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22892&metadataPrefix=arXiv"},{"id":"arxiv:2607.22892","title":"arXiv:2607.22892","url":"https://arxiv.org/abs/2607.22892"}],"status":"frontier","summary":"arXiv:2607.22892 \"Mirror Langevin diffusions: Convergence rates and Markov chain approximations\" (CC BY 4.0, submitted 2026-07-24) reports: \"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22443","kind":"claim","label":"A Human-Augmenting Agentic Workflow for Observational Causal Inference","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22443"]},"sources":[{"id":"source.frontier.arxiv-2607-22443","title":"arXiv OAI-PMH record arXiv:2607.22443: A Human-Augmenting Agentic Workflow for Observational Causal Inference","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22443&metadataPrefix=arXiv"},{"id":"arxiv:2607.22443","title":"arXiv:2607.22443","url":"https://arxiv.org/abs/2607.22443"}],"status":"frontier","summary":"arXiv:2607.22443 \"A Human-Augmenting Agentic Workflow for Observational Causal Inference\" (CC BY 4.0, submitted 2026-07-24) reports: \"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22333","kind":"claim","label":"Collision and non-collision for diffusions on configuration space","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22333"]},"sources":[{"id":"source.frontier.arxiv-2607-22333","title":"arXiv OAI-PMH record arXiv:2607.22333: Collision and non-collision for diffusions on configuration space","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22333&metadataPrefix=arXiv"},{"id":"arxiv:2607.22333","title":"arXiv:2607.22333","url":"https://arxiv.org/abs/2607.22333"}],"status":"frontier","summary":"arXiv:2607.22333 \"Collision and non-collision for diffusions on configuration space\" (CC BY 4.0, submitted 2026-07-24) reports: \"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22284","kind":"claim","label":"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22284"]},"sources":[{"id":"source.frontier.arxiv-2607-22284","title":"arXiv OAI-PMH record arXiv:2607.22284: Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22284&metadataPrefix=arXiv"},{"id":"arxiv:2607.22284","title":"arXiv:2607.22284","url":"https://arxiv.org/abs/2607.22284"}],"status":"frontier","summary":"arXiv:2607.22284 \"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings\" (CC BY 4.0, submitted 2026-07-24) reports: \"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22196","kind":"claim","label":"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22196"]},"sources":[{"id":"source.frontier.arxiv-2607-22196","title":"arXiv OAI-PMH record arXiv:2607.22196: Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22196&metadataPrefix=arXiv"},{"id":"arxiv:2607.22196","title":"arXiv:2607.22196","url":"https://arxiv.org/abs/2607.22196"}],"status":"frontier","summary":"arXiv:2607.22196 \"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations\" (CC BY 4.0, submitted 2026-07-24) reports: \"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22156","kind":"claim","label":"A random matrix approach to lamplighter groups","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22156"]},"sources":[{"id":"source.frontier.arxiv-2607-22156","title":"arXiv OAI-PMH record arXiv:2607.22156: A random matrix approach to lamplighter groups","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22156&metadataPrefix=arXiv"},{"id":"arxiv:2607.22156","title":"arXiv:2607.22156","url":"https://arxiv.org/abs/2607.22156"}],"status":"frontier","summary":"arXiv:2607.22156 \"A random matrix approach to lamplighter groups\" (CC BY 4.0, submitted 2026-07-24) reports: \"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22018","kind":"claim","label":"Unlocking novel topological structures via rough families","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22018"]},"sources":[{"id":"source.frontier.arxiv-2607-22018","title":"arXiv OAI-PMH record arXiv:2607.22018: Unlocking novel topological structures via rough families","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22018&metadataPrefix=arXiv"},{"id":"arxiv:2607.22018","title":"arXiv:2607.22018","url":"https://arxiv.org/abs/2607.22018"}],"status":"frontier","summary":"arXiv:2607.22018 \"Unlocking novel topological structures via rough families\" (CC BY 4.0, submitted 2026-07-24) reports: \"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21892","kind":"claim","label":"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-21892"]},"sources":[{"id":"source.frontier.arxiv-2607-21892","title":"arXiv OAI-PMH record arXiv:2607.21892: A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21892&metadataPrefix=arXiv"},{"id":"arxiv:2607.21892","title":"arXiv:2607.21892","url":"https://arxiv.org/abs/2607.21892"}],"status":"frontier","summary":"arXiv:2607.21892 \"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums\" (CC BY 4.0, submitted 2026-07-24) reports: \"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-16724","kind":"claim","label":"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-16724"]},"sources":[{"id":"source.frontier.arxiv-2607-16724","title":"arXiv OAI-PMH record arXiv:2607.16724: Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16724&metadataPrefix=arXiv"},{"id":"arxiv:2607.16724","title":"arXiv:2607.16724","url":"https://arxiv.org/abs/2607.16724"}],"status":"frontier","summary":"arXiv:2607.16724 \"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers\" (CC BY 4.0, submitted 2026-07-24) reports: \"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-06237","kind":"claim","label":"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-06237"]},"sources":[{"id":"source.frontier.arxiv-2607-06237","title":"arXiv OAI-PMH record arXiv:2607.06237: ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.06237&metadataPrefix=arXiv"},{"id":"arxiv:2607.06237","title":"arXiv:2607.06237","url":"https://arxiv.org/abs/2607.06237"}],"status":"frontier","summary":"arXiv:2607.06237 \"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems\" (CC BY 4.0, submitted 2026-07-24) reports: \"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22751","kind":"claim","label":"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-22751"]},"sources":[{"id":"source.frontier.arxiv-2607-22751","title":"arXiv OAI-PMH record arXiv:2607.22751: Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22751&metadataPrefix=arXiv"},{"id":"arxiv:2607.22751","title":"arXiv:2607.22751","url":"https://arxiv.org/abs/2607.22751"}],"status":"frontier","summary":"arXiv:2607.22751 \"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21474","kind":"claim","label":"Fatness and Flatness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21474"]},"sources":[{"id":"source.frontier.arxiv-2607-21474","title":"arXiv OAI-PMH record arXiv:2607.21474: Fatness and Flatness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21474&metadataPrefix=arXiv"},{"id":"arxiv:2607.21474","title":"arXiv:2607.21474","url":"https://arxiv.org/abs/2607.21474"}],"status":"frontier","summary":"arXiv:2607.21474 \"Fatness and Flatness\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21320","kind":"claim","label":"Post Completeness in Conditional Logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21320"]},"sources":[{"id":"source.frontier.arxiv-2607-21320","title":"arXiv OAI-PMH record arXiv:2607.21320: Post Completeness in Conditional Logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21320&metadataPrefix=arXiv"},{"id":"arxiv:2607.21320","title":"arXiv:2607.21320","url":"https://arxiv.org/abs/2607.21320"}],"status":"frontier","summary":"arXiv:2607.21320 \"Post Completeness in Conditional Logic\" (CC BY 4.0, submitted 2026-07-23) reports: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21191","kind":"claim","label":"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21191"]},"sources":[{"id":"source.frontier.arxiv-2607-21191","title":"arXiv OAI-PMH record arXiv:2607.21191: Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21191&metadataPrefix=arXiv"},{"id":"arxiv:2607.21191","title":"arXiv:2607.21191","url":"https://arxiv.org/abs/2607.21191"},{"id":"doi:10.4204/eptcs.450.12","title":"doi:10.4204/eptcs.450.12","url":"https://doi.org/10.4204/eptcs.450.12"}],"status":"frontier","summary":"arXiv:2607.21191 \"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB\" (CC BY 4.0, submitted 2026-07-23) reports: \"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21167","kind":"claim","label":"Differentiability of the operator norm on $\\ell_p$ spaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21167"]},"sources":[{"id":"source.frontier.arxiv-2607-21167","title":"arXiv OAI-PMH record arXiv:2607.21167: Differentiability of the operator norm on $\\ell_p$ spaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21167&metadataPrefix=arXiv"},{"id":"arxiv:2607.21167","title":"arXiv:2607.21167","url":"https://arxiv.org/abs/2607.21167"},{"id":"doi:10.4153/s0008414x24001135","title":"doi:10.4153/s0008414x24001135","url":"https://doi.org/10.4153/s0008414x24001135"}],"status":"frontier","summary":"arXiv:2607.21167 \"Differentiability of the operator norm on $\\ell_p$ spaces\" (CC BY 4.0, submitted 2026-07-23) reports: \"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21112","kind":"claim","label":"Exact ensemble controllability for neural differential equations via neural interpolation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21112"]},"sources":[{"id":"source.frontier.arxiv-2607-21112","title":"arXiv OAI-PMH record arXiv:2607.21112: Exact ensemble controllability for neural differential equations via neural interpolation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21112&metadataPrefix=arXiv"},{"id":"arxiv:2607.21112","title":"arXiv:2607.21112","url":"https://arxiv.org/abs/2607.21112"}],"status":"frontier","summary":"arXiv:2607.21112 \"Exact ensemble controllability for neural differential equations via neural interpolation\" (CC BY 4.0, submitted 2026-07-23) reports: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20049","kind":"claim","label":"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-20049"]},"sources":[{"id":"source.frontier.arxiv-2607-20049","title":"arXiv OAI-PMH record arXiv:2607.20049: A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20049&metadataPrefix=arXiv"},{"id":"arxiv:2607.20049","title":"arXiv:2607.20049","url":"https://arxiv.org/abs/2607.20049"}],"status":"frontier","summary":"arXiv:2607.20049 \"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots\" (CC BY 4.0, submitted 2026-07-23) reports: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20677","kind":"claim","label":"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20677"]},"sources":[{"id":"source.frontier.arxiv-2607-20677","title":"arXiv OAI-PMH record arXiv:2607.20677: First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20677&metadataPrefix=arXiv"},{"id":"arxiv:2607.20677","title":"arXiv:2607.20677","url":"https://arxiv.org/abs/2607.20677"}],"status":"frontier","summary":"arXiv:2607.20677 \"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20407","kind":"claim","label":"Uncountable Abelian Group C*-algebras Fail the Lifting Property","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20407"]},"sources":[{"id":"source.frontier.arxiv-2607-20407","title":"arXiv OAI-PMH record arXiv:2607.20407: Uncountable Abelian Group C*-algebras Fail the Lifting Property","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20407&metadataPrefix=arXiv"},{"id":"arxiv:2607.20407","title":"arXiv:2607.20407","url":"https://arxiv.org/abs/2607.20407"}],"status":"frontier","summary":"arXiv:2607.20407 \"Uncountable Abelian Group C*-algebras Fail the Lifting Property\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20164","kind":"claim","label":"Law of iterated logarithm for inner functions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20164"]},"sources":[{"id":"source.frontier.arxiv-2607-20164","title":"arXiv OAI-PMH record arXiv:2607.20164: Law of iterated logarithm for inner functions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20164&metadataPrefix=arXiv"},{"id":"arxiv:2607.20164","title":"arXiv:2607.20164","url":"https://arxiv.org/abs/2607.20164"}],"status":"frontier","summary":"arXiv:2607.20164 \"Law of iterated logarithm for inner functions\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20161","kind":"claim","label":"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20161"]},"sources":[{"id":"source.frontier.arxiv-2607-20161","title":"arXiv OAI-PMH record arXiv:2607.20161: Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20161&metadataPrefix=arXiv"},{"id":"arxiv:2607.20161","title":"arXiv:2607.20161","url":"https://arxiv.org/abs/2607.20161"}],"status":"frontier","summary":"arXiv:2607.20161 \"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20098","kind":"claim","label":"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20098"]},"sources":[{"id":"source.frontier.arxiv-2607-20098","title":"arXiv OAI-PMH record arXiv:2607.20098: Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20098&metadataPrefix=arXiv"},{"id":"arxiv:2607.20098","title":"arXiv:2607.20098","url":"https://arxiv.org/abs/2607.20098"}],"status":"frontier","summary":"arXiv:2607.20098 \"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case\" (CC BY 4.0, submitted 2026-07-22) reports: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20063","kind":"claim","label":"Null distance on cosmological spacetimes and monotone convergence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20063"]},"sources":[{"id":"source.frontier.arxiv-2607-20063","title":"arXiv OAI-PMH record arXiv:2607.20063: Null distance on cosmological spacetimes and monotone convergence","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20063&metadataPrefix=arXiv"},{"id":"arxiv:2607.20063","title":"arXiv:2607.20063","url":"https://arxiv.org/abs/2607.20063"}],"status":"frontier","summary":"arXiv:2607.20063 \"Null distance on cosmological spacetimes and monotone convergence\" (CC BY 4.0, submitted 2026-07-22) reports: \"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19946","kind":"claim","label":"The chromatic number of Euclidean space with dense color classes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-19946"]},"sources":[{"id":"source.frontier.arxiv-2607-19946","title":"arXiv OAI-PMH record arXiv:2607.19946: The chromatic number of Euclidean space with dense color classes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19946&metadataPrefix=arXiv"},{"id":"arxiv:2607.19946","title":"arXiv:2607.19946","url":"https://arxiv.org/abs/2607.19946"}],"status":"frontier","summary":"arXiv:2607.19946 \"The chromatic number of Euclidean space with dense color classes\" (CC BY 4.0, submitted 2026-07-22) reports: \"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19654","kind":"claim","label":"Derived representation schemes with arbitrary coefficients and associative smoothness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-19654"]},"sources":[{"id":"source.frontier.arxiv-2607-19654","title":"arXiv OAI-PMH record arXiv:2607.19654: Derived representation schemes with arbitrary coefficients and associative smoothness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19654&metadataPrefix=arXiv"},{"id":"arxiv:2607.19654","title":"arXiv:2607.19654","url":"https://arxiv.org/abs/2607.19654"}],"status":"frontier","summary":"arXiv:2607.19654 \"Derived representation schemes with arbitrary coefficients and associative smoothness\" (CC BY 4.0, submitted 2026-07-22) reports: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-13855","kind":"claim","label":"Inferentialist Game Semantics (Extended Abstract)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-13855"]},"sources":[{"id":"source.frontier.arxiv-2607-13855","title":"arXiv OAI-PMH record arXiv:2607.13855: Inferentialist Game Semantics (Extended Abstract)","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13855&metadataPrefix=arXiv"},{"id":"arxiv:2607.13855","title":"arXiv:2607.13855","url":"https://arxiv.org/abs/2607.13855"}],"status":"frontier","summary":"arXiv:2607.13855 \"Inferentialist Game Semantics (Extended Abstract)\" (CC BY 4.0, submitted 2026-07-22) reports: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19285","kind":"claim","label":"Compactification of the fifth Painlevé foliation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19285"]},"sources":[{"id":"source.frontier.arxiv-2607-19285","title":"arXiv OAI-PMH record arXiv:2607.19285: Compactification of the fifth Painlevé foliation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19285&metadataPrefix=arXiv"},{"id":"arxiv:2607.19285","title":"arXiv:2607.19285","url":"https://arxiv.org/abs/2607.19285"}],"status":"frontier","summary":"arXiv:2607.19285 \"Compactification of the fifth Painlevé foliation\" (CC0 1.0, submitted 2026-07-21) reports: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19272","kind":"claim","label":"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19272"]},"sources":[{"id":"source.frontier.arxiv-2607-19272","title":"arXiv OAI-PMH record arXiv:2607.19272: From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19272&metadataPrefix=arXiv"},{"id":"arxiv:2607.19272","title":"arXiv:2607.19272","url":"https://arxiv.org/abs/2607.19272"}],"status":"frontier","summary":"arXiv:2607.19272 \"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations\" (CC BY 4.0, submitted 2026-07-21) reports: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19233","kind":"claim","label":"Vortex-sheet desingularization for three-dimensional ideal fluids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19233"]},"sources":[{"id":"source.frontier.arxiv-2607-19233","title":"arXiv OAI-PMH record arXiv:2607.19233: Vortex-sheet desingularization for three-dimensional ideal fluids","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19233&metadataPrefix=arXiv"},{"id":"arxiv:2607.19233","title":"arXiv:2607.19233","url":"https://arxiv.org/abs/2607.19233"}],"status":"frontier","summary":"arXiv:2607.19233 \"Vortex-sheet desingularization for three-dimensional ideal fluids\" (CC BY 4.0, submitted 2026-07-21) reports: \"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19188","kind":"claim","label":"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19188"]},"sources":[{"id":"source.frontier.arxiv-2607-19188","title":"arXiv OAI-PMH record arXiv:2607.19188: Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19188&metadataPrefix=arXiv"},{"id":"arxiv:2607.19188","title":"arXiv:2607.19188","url":"https://arxiv.org/abs/2607.19188"}],"status":"frontier","summary":"arXiv:2607.19188 \"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques\" (CC BY 4.0, submitted 2026-07-21) reports: \"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19080","kind":"claim","label":"The Influence Function of Transport-based Quantiles","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19080"]},"sources":[{"id":"source.frontier.arxiv-2607-19080","title":"arXiv OAI-PMH record arXiv:2607.19080: The Influence Function of Transport-based Quantiles","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19080&metadataPrefix=arXiv"},{"id":"arxiv:2607.19080","title":"arXiv:2607.19080","url":"https://arxiv.org/abs/2607.19080"}],"status":"frontier","summary":"arXiv:2607.19080 \"The Influence Function of Transport-based Quantiles\" (CC BY 4.0, submitted 2026-07-21) reports: \"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18942","kind":"claim","label":"Bounded elementary extensions of trees with unbounded paths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-18942"]},"sources":[{"id":"source.frontier.arxiv-2607-18942","title":"arXiv OAI-PMH record arXiv:2607.18942: Bounded elementary extensions of trees with unbounded paths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18942&metadataPrefix=arXiv"},{"id":"arxiv:2607.18942","title":"arXiv:2607.18942","url":"https://arxiv.org/abs/2607.18942"}],"status":"frontier","summary":"arXiv:2607.18942 \"Bounded elementary extensions of trees with unbounded paths\" (CC BY 4.0, submitted 2026-07-21) reports: \"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18781","kind":"claim","label":"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-18781"]},"sources":[{"id":"source.frontier.arxiv-2607-18781","title":"arXiv OAI-PMH record arXiv:2607.18781: Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18781&metadataPrefix=arXiv"},{"id":"arxiv:2607.18781","title":"arXiv:2607.18781","url":"https://arxiv.org/abs/2607.18781"}],"status":"frontier","summary":"arXiv:2607.18781 \"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization\" (CC BY 4.0, submitted 2026-07-21) reports: \"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15029","kind":"claim","label":"Towards realistic large random models of labeled transition systems and their 0-1 laws","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-15029"]},"sources":[{"id":"source.frontier.arxiv-2607-15029","title":"arXiv OAI-PMH record arXiv:2607.15029: Towards realistic large random models of labeled transition systems and their 0-1 laws","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15029&metadataPrefix=arXiv"},{"id":"arxiv:2607.15029","title":"arXiv:2607.15029","url":"https://arxiv.org/abs/2607.15029"}],"status":"frontier","summary":"arXiv:2607.15029 \"Towards realistic large random models of labeled transition systems and their 0-1 laws\" (CC BY 4.0, submitted 2026-07-21) reports: \"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-16747","kind":"claim","label":"More on the Boolean Prime Ideal Theorem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-18","source_ids":["source.frontier.arxiv-2607-16747"]},"sources":[{"id":"source.frontier.arxiv-2607-16747","title":"arXiv OAI-PMH record arXiv:2607.16747: More on the Boolean Prime Ideal Theorem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16747&metadataPrefix=arXiv"},{"id":"arxiv:2607.16747","title":"arXiv:2607.16747","url":"https://arxiv.org/abs/2607.16747"}],"status":"frontier","summary":"arXiv:2607.16747 \"More on the Boolean Prime Ideal Theorem\" (CC BY 4.0, submitted 2026-07-18) reports: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15958","kind":"claim","label":"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.arxiv-2607-15958"]},"sources":[{"id":"source.frontier.arxiv-2607-15958","title":"arXiv OAI-PMH record arXiv:2607.15958: Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15958&metadataPrefix=arXiv"},{"id":"arxiv:2607.15958","title":"arXiv:2607.15958","url":"https://arxiv.org/abs/2607.15958"}],"status":"frontier","summary":"arXiv:2607.15958 \"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle\" (CC BY 4.0, submitted 2026-07-17) reports: \"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15664","kind":"claim","label":"Semantics for the minimal well-determined logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.arxiv-2607-15664"]},"sources":[{"id":"source.frontier.arxiv-2607-15664","title":"arXiv OAI-PMH record arXiv:2607.15664: Semantics for the minimal well-determined logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15664&metadataPrefix=arXiv"},{"id":"arxiv:2607.15664","title":"arXiv:2607.15664","url":"https://arxiv.org/abs/2607.15664"}],"status":"frontier","summary":"arXiv:2607.15664 \"Semantics for the minimal well-determined logic\" (CC0 1.0, submitted 2026-07-17) reports: \"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2604-22459","kind":"claim","label":"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-04-24","source_ids":["source.frontier.arxiv-2604-22459"]},"sources":[{"id":"source.frontier.arxiv-2604-22459","title":"arXiv OAI-PMH record arXiv:2604.22459: Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2604.22459&metadataPrefix=arXiv"},{"id":"arxiv:2604.22459","title":"arXiv:2604.22459","url":"https://arxiv.org/abs/2604.22459"},{"id":"doi:10.24963/kr.2026/41","title":"doi:10.24963/kr.2026/41","url":"https://doi.org/10.24963/kr.2026/41"}],"status":"frontier","summary":"arXiv:2604.22459 \"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic\" (CC BY 4.0, submitted 2026-04-24) reports: \"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ecot-70052","kind":"claim","label":"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-15","source_ids":["source.frontier.doi-10-1111-ecot-70052"]},"sources":[{"id":"source.frontier.doi-10-1111-ecot-70052","title":"Crossref record doi:10.1111/ecot.70052: Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition","url":"https://api.crossref.org/works/10.1111/ecot.70052"},{"id":"doi:10.1111/ecot.70052","title":"doi:10.1111/ecot.70052","url":"https://doi.org/10.1111/ecot.70052"}],"status":"frontier","summary":"doi:10.1111/ecot.70052 \"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition\" (CC BY 4.0, published 2026-10-15) reports: \"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70333","kind":"claim","label":"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-15","source_ids":["source.frontier.doi-10-1002-qj-70333"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70333","title":"Crossref record doi:10.1002/qj.70333: Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022","url":"https://api.crossref.org/works/10.1002/qj.70333"},{"id":"doi:10.1002/qj.70333","title":"doi:10.1002/qj.70333","url":"https://doi.org/10.1002/qj.70333"}],"status":"frontier","summary":"doi:10.1002/qj.70333 \"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022\" (CC BY 4.0, published 2026-10-15) reports: \"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pwat-0000557","kind":"claim","label":"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1371-journal-pwat-0000557"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pwat-0000557","title":"Crossref record doi:10.1371/journal.pwat.0000557: Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon","url":"https://api.crossref.org/works/10.1371/journal.pwat.0000557"},{"id":"doi:10.1371/journal.pwat.0000557","title":"doi:10.1371/journal.pwat.0000557","url":"https://doi.org/10.1371/journal.pwat.0000557"}],"status":"frontier","summary":"doi:10.1371/journal.pwat.0000557 \"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon\" (CC BY 4.0, published 2026-10-14) reports: \"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-medu-70340","kind":"claim","label":"Health equity is the goal of medical education: Implications for assessment validity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1111-medu-70340"]},"sources":[{"id":"source.frontier.doi-10-1111-medu-70340","title":"Crossref record doi:10.1111/medu.70340: Health equity is the goal of medical education: Implications for assessment validity","url":"https://api.crossref.org/works/10.1111/medu.70340"},{"id":"doi:10.1111/medu.70340","title":"doi:10.1111/medu.70340","url":"https://doi.org/10.1111/medu.70340"}],"status":"frontier","summary":"doi:10.1111/medu.70340 \"Health equity is the goal of medical education: Implications for assessment validity\" (CC BY 4.0, published 2026-10-14) reports: \"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124622","kind":"claim","label":"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1029-2026gl124622"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124622","title":"Crossref record doi:10.1029/2026gl124622: Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simu","url":"https://api.crossref.org/works/10.1029/2026gl124622"},{"id":"doi:10.1029/2026gl124622","title":"doi:10.1029/2026gl124622","url":"https://doi.org/10.1029/2026gl124622"}],"status":"frontier","summary":"doi:10.1029/2026gl124622 \"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models\" (CC BY 4.0, published 2026-10-14) reports: \"These findings suggest that flood risk communication under climate warming should distinguish broad climate‐driven tendencies from uncertain local responses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-15351-2373-8456-1235","kind":"claim","label":"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-15351-2373-8456-1235"]},"sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1235","title":"Crossref record doi:10.15351/2373-8456.1235: Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh","url":"https://api.crossref.org/works/10.15351/2373-8456.1235"},{"id":"doi:10.15351/2373-8456.1235","title":"doi:10.15351/2373-8456.1235","url":"https://doi.org/10.15351/2373-8456.1235"}],"status":"frontier","summary":"doi:10.15351/2373-8456.1235 \"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh\" (CC BY 4.0, published 2026-10-13) reports: \"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh’s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-15351-2373-8456-1216","kind":"claim","label":"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-15351-2373-8456-1216"]},"sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1216","title":"Crossref record doi:10.15351/2373-8456.1216: Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review","url":"https://api.crossref.org/works/10.15351/2373-8456.1216"},{"id":"doi:10.15351/2373-8456.1216","title":"doi:10.15351/2373-8456.1216","url":"https://doi.org/10.15351/2373-8456.1216"}],"status":"frontier","summary":"doi:10.15351/2373-8456.1216 \"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review\" (CC BY 4.0, published 2026-10-13) reports: \"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl125301","kind":"claim","label":"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-1029-2026gl125301"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl125301","title":"Crossref record doi:10.1029/2026gl125301: Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands","url":"https://api.crossref.org/works/10.1029/2026gl125301"},{"id":"doi:10.1029/2026gl125301","title":"doi:10.1029/2026gl125301","url":"https://doi.org/10.1029/2026gl125301"}],"status":"frontier","summary":"doi:10.1029/2026gl125301 \"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands\" (CC BY 4.0, published 2026-10-13) reports: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-21425-fob-19-142560","kind":"claim","label":"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-21425-fob-19-142560"]},"sources":[{"id":"source.frontier.doi-10-21425-fob-19-142560","title":"Crossref record doi:10.21425/fob.19.142560: Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas","url":"https://api.crossref.org/works/10.21425/fob.19.142560"},{"id":"doi:10.21425/fob.19.142560","title":"doi:10.21425/fob.19.142560","url":"https://doi.org/10.21425/fob.19.142560"}],"status":"frontier","summary":"doi:10.21425/fob.19.142560 \"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas\" (CC BY 4.0, published 2026-10-12) reports: \"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001044","kind":"claim","label":"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001044"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001044","title":"Crossref record doi:10.1371/journal.pclm.0001044: Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001044"},{"id":"doi:10.1371/journal.pclm.0001044","title":"doi:10.1371/journal.pclm.0001044","url":"https://doi.org/10.1371/journal.pclm.0001044"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001044 \"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)\" (CC BY 4.0, published 2026-10-12) reports: \"We found a decadal warming trend of 0.29°C at both locations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000886","kind":"claim","label":"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000886"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000886","title":"Crossref record doi:10.1371/journal.pclm.0000886: How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000886"},{"id":"doi:10.1371/journal.pclm.0000886","title":"doi:10.1371/journal.pclm.0000886","url":"https://doi.org/10.1371/journal.pclm.0000886"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000886 \"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana\" (CC BY 4.0, published 2026-10-12) reports: \"The findings show that farmers’ education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1075-consl-25020-lia","kind":"claim","label":"When ‘John broke up Mary’ becomes acceptable","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1075-consl-25020-lia"]},"sources":[{"id":"source.frontier.doi-10-1075-consl-25020-lia","title":"Crossref record doi:10.1075/consl.25020.lia: When ‘John broke up Mary’ becomes acceptable","url":"https://api.crossref.org/works/10.1075/consl.25020.lia"},{"id":"doi:10.1075/consl.25020.lia","title":"doi:10.1075/consl.25020.lia","url":"https://doi.org/10.1075/consl.25020.lia"}],"status":"frontier","summary":"doi:10.1075/consl.25020.lia \"When ‘John broke up Mary’ becomes acceptable\" (CC BY 4.0, published 2026-10-12) reports: \"These findings show that argument structure representations can be shaped by usage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-hydro-2026-040","kind":"claim","label":"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-10","source_ids":["source.frontier.doi-10-2166-hydro-2026-040"]},"sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-040","title":"Crossref record doi:10.2166/hydro.2026.040: Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change","url":"https://api.crossref.org/works/10.2166/hydro.2026.040"},{"id":"doi:10.2166/hydro.2026.040","title":"doi:10.2166/hydro.2026.040","url":"https://doi.org/10.2166/hydro.2026.040"}],"status":"frontier","summary":"doi:10.2166/hydro.2026.040 \"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change\" (CC BY 4.0, published 2026-10-10) reports: \"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-lol2-70186","kind":"claim","label":"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.doi-10-1002-lol2-70186"]},"sources":[{"id":"source.frontier.doi-10-1002-lol2-70186","title":"Crossref record doi:10.1002/lol2.70186: Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers","url":"https://api.crossref.org/works/10.1002/lol2.70186"},{"id":"doi:10.1002/lol2.70186","title":"doi:10.1002/lol2.70186","url":"https://doi.org/10.1002/lol2.70186"}],"status":"frontier","summary":"doi:10.1002/lol2.70186 \"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers\" (CC BY 4.0, published 2026-10-09) reports: \"We identify extensive subsurface sediment plumes from marine‐terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment‐core reconstructions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124411","kind":"claim","label":"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.doi-10-1029-2026gl124411"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124411","title":"Crossref record doi:10.1029/2026gl124411: Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing","url":"https://api.crossref.org/works/10.1029/2026gl124411"},{"id":"doi:10.1029/2026gl124411","title":"doi:10.1029/2026gl124411","url":"https://doi.org/10.1029/2026gl124411"}],"status":"frontier","summary":"doi:10.1029/2026gl124411 \"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing\" (CC BY 4.0, published 2026-10-08) reports: \"The results showed that the too‐intense localized precipitation frequently produced in km‐scale models, known as “popcorn‐like” precipitation, weakens as resolution increases.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70629","kind":"claim","label":"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.doi-10-1002-joc-70629"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70629","title":"Crossref record doi:10.1002/joc.70629: Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections","url":"https://api.crossref.org/works/10.1002/joc.70629"},{"id":"doi:10.1002/joc.70629","title":"doi:10.1002/joc.70629","url":"https://doi.org/10.1002/joc.70629"}],"status":"frontier","summary":"doi:10.1002/joc.70629 \"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections\" (CC BY 4.0, published 2026-10-08) reports: \"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4 days/decade), suggesting greater irregularity in the regional precipitation regime.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9566-70277","kind":"claim","label":"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1111-1467-9566-70277"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70277","title":"Crossref record doi:10.1111/1467-9566.70277: The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception","url":"https://api.crossref.org/works/10.1111/1467-9566.70277"},{"id":"doi:10.1111/1467-9566.70277","title":"doi:10.1111/1467-9566.70277","url":"https://doi.org/10.1111/1467-9566.70277"}],"status":"frontier","summary":"doi:10.1111/1467-9566.70277 \"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception\" (CC BY 4.0, published 2026-10-06) reports: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jpln-70129","kind":"claim","label":"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-jpln-70129"]},"sources":[{"id":"source.frontier.doi-10-1002-jpln-70129","title":"Crossref record doi:10.1002/jpln.70129: Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps","url":"https://api.crossref.org/works/10.1002/jpln.70129"},{"id":"doi:10.1002/jpln.70129","title":"doi:10.1002/jpln.70129","url":"https://doi.org/10.1002/jpln.70129"}],"status":"frontier","summary":"doi:10.1002/jpln.70129 \"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps\" (CC BY 4.0, published 2026-10-06) reports: \"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate‐driven water stress.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70613","kind":"claim","label":"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-joc-70613"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70613","title":"Crossref record doi:10.1002/joc.70613: Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia","url":"https://api.crossref.org/works/10.1002/joc.70613"},{"id":"doi:10.1002/joc.70613","title":"doi:10.1002/joc.70613","url":"https://doi.org/10.1002/joc.70613"}],"status":"frontier","summary":"doi:10.1002/joc.70613 \"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia\" (CC BY 4.0, published 2026-10-06) reports: \"These findings demonstrate that dynamical downscaling substantially reduces large‐scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70605","kind":"claim","label":"Climate Change Projections for Mexico in the 21st Century","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-joc-70605"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70605","title":"Crossref record doi:10.1002/joc.70605: Climate Change Projections for Mexico in the 21st Century","url":"https://api.crossref.org/works/10.1002/joc.70605"},{"id":"doi:10.1002/joc.70605","title":"doi:10.1002/joc.70605","url":"https://doi.org/10.1002/joc.70605"}],"status":"frontier","summary":"doi:10.1002/joc.70605 \"Climate Change Projections for Mexico in the 21st Century\" (CC BY 4.0, published 2026-10-06) reports: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3176-arch-2026-2-03","kind":"claim","label":"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-05","source_ids":["source.frontier.doi-10-3176-arch-2026-2-03"]},"sources":[{"id":"source.frontier.doi-10-3176-arch-2026-2-03","title":"Crossref record doi:10.3176/arch.2026.2.03: Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from bird","url":"https://api.crossref.org/works/10.3176/arch.2026.2.03"},{"id":"doi:10.3176/arch.2026.2.03","title":"doi:10.3176/arch.2026.2.03","url":"https://doi.org/10.3176/arch.2026.2.03"}],"status":"frontier","summary":"doi:10.3176/arch.2026.2.03 \"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)\" (CC BY 4.0, published 2026-10-05) reports: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-580","kind":"claim","label":"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.doi-10-2166-wcc-2026-580"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-580","title":"Crossref record doi:10.2166/wcc.2026.580: Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of So","url":"https://api.crossref.org/works/10.2166/wcc.2026.580"},{"id":"doi:10.2166/wcc.2026.580","title":"doi:10.2166/wcc.2026.580","url":"https://doi.org/10.2166/wcc.2026.580"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.580 \"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa\" (CC BY 4.0, published 2026-10-02) reports: \"El Niño seasons were associated with significantly greater concurrent stress (p&lt; 0.001).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ijop-70275","kind":"claim","label":"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.doi-10-1002-ijop-70275"]},"sources":[{"id":"source.frontier.doi-10-1002-ijop-70275","title":"Crossref record doi:10.1002/ijop.70275: To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields","url":"https://api.crossref.org/works/10.1002/ijop.70275"},{"id":"doi:10.1002/ijop.70275","title":"doi:10.1002/ijop.70275","url":"https://doi.org/10.1002/ijop.70275"}],"status":"frontier","summary":"doi:10.1002/ijop.70275 \"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020\" (CC BY 4.0, published 2026-10-02) reports: \"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-popecon-10-e186220","kind":"claim","label":"Well-Being Among Married Couples: The Role of Time Allocation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.doi-10-3897-popecon-10-e186220"]},"sources":[{"id":"source.frontier.doi-10-3897-popecon-10-e186220","title":"Crossref record doi:10.3897/popecon.10.e186220: Well-Being Among Married Couples: The Role of Time Allocation","url":"https://api.crossref.org/works/10.3897/popecon.10.e186220"},{"id":"doi:10.3897/popecon.10.e186220","title":"doi:10.3897/popecon.10.e186220","url":"https://doi.org/10.3897/popecon.10.e186220"}],"status":"frontier","summary":"doi:10.3897/popecon.10.e186220 \"Well-Being Among Married Couples: The Role of Time Allocation\" (CC BY 4.0, published 2026-10-01) reports: \"The results demonstrate a robust and statistically significant relationship between wellbeing and the time‑allocation decisions made by individuals and their partners.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-507","kind":"claim","label":"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.doi-10-2166-wcc-2026-507"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-507","title":"Crossref record doi:10.2166/wcc.2026.507: Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices","url":"https://api.crossref.org/works/10.2166/wcc.2026.507"},{"id":"doi:10.2166/wcc.2026.507","title":"doi:10.2166/wcc.2026.507","url":"https://doi.org/10.2166/wcc.2026.507"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.507 \"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices\" (CC BY 4.0, published 2026-10-01) reports: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e183393","kind":"claim","label":"Stock market reaction to fraud outbreaks in the Indian banking sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e183393"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e183393","title":"Crossref record doi:10.3897/brics-econ.7.e183393: Stock market reaction to fraud outbreaks in the Indian banking sector","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e183393"},{"id":"doi:10.3897/brics-econ.7.e183393","title":"doi:10.3897/brics-econ.7.e183393","url":"https://doi.org/10.3897/brics-econ.7.e183393"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e183393 \"Stock market reaction to fraud outbreaks in the Indian banking sector\" (CC BY 4.0, published 2026-09-30) reports: \"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026785","kind":"claim","label":"Does the listener care? Emotional resonance and connection in the age of algorithmic music","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-38159-ehass-2026785"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026785","title":"Crossref record doi:10.38159/ehass.2026785: Does the listener care? Emotional resonance and connection in the age of algorithmic music","url":"https://api.crossref.org/works/10.38159/ehass.2026785"},{"id":"doi:10.38159/ehass.2026785","title":"doi:10.38159/ehass.2026785","url":"https://doi.org/10.38159/ehass.2026785"}],"status":"frontier","summary":"doi:10.38159/ehass.2026785 \"Does the listener care? Emotional resonance and connection in the age of algorithmic music\" (CC BY 4.0, published 2026-09-30) reports: \"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124090","kind":"claim","label":"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1029-2026gl124090"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124090","title":"Crossref record doi:10.1029/2026gl124090: How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?","url":"https://api.crossref.org/works/10.1029/2026gl124090"},{"id":"doi:10.1029/2026gl124090","title":"doi:10.1029/2026gl124090","url":"https://doi.org/10.1029/2026gl124090"}],"status":"frontier","summary":"doi:10.1029/2026gl124090 \"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?\" (CC BY 4.0, published 2026-09-30) reports: \"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-pei3-70207","kind":"claim","label":"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-pei3-70207"]},"sources":[{"id":"source.frontier.doi-10-1002-pei3-70207","title":"Crossref record doi:10.1002/pei3.70207: Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment","url":"https://api.crossref.org/works/10.1002/pei3.70207"},{"id":"doi:10.1002/pei3.70207","title":"doi:10.1002/pei3.70207","url":"https://doi.org/10.1002/pei3.70207"}],"status":"frontier","summary":"doi:10.1002/pei3.70207 \"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment\" (CC BY 4.0, published 2026-09-30) reports: \"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1°C rise in temperature was associated with a 10% reduction in major staple crop production.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-fea2-70077","kind":"claim","label":"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-fea2-70077"]},"sources":[{"id":"source.frontier.doi-10-1002-fea2-70077","title":"Crossref record doi:10.1002/fea2.70077: Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women","url":"https://api.crossref.org/works/10.1002/fea2.70077"},{"id":"doi:10.1002/fea2.70077","title":"doi:10.1002/fea2.70077","url":"https://doi.org/10.1002/fea2.70077"}],"status":"frontier","summary":"doi:10.1002/fea2.70077 \"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women\" (CC BY 4.0, published 2026-09-30) reports: \"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eet-70146","kind":"claim","label":"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-eet-70146"]},"sources":[{"id":"source.frontier.doi-10-1002-eet-70146","title":"Crossref record doi:10.1002/eet.70146: Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy","url":"https://api.crossref.org/works/10.1002/eet.70146"},{"id":"doi:10.1002/eet.70146","title":"doi:10.1002/eet.70146","url":"https://doi.org/10.1002/eet.70146"}],"status":"frontier","summary":"doi:10.1002/eet.70146 \"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy\" (CC BY 4.0, published 2026-09-30) reports: \"This study examines how three survey‐derived governance role orientations—governmental, civic, and industry‐and‐media orientations—and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate‐related civic participation behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eco-70279","kind":"claim","label":"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-eco-70279"]},"sources":[{"id":"source.frontier.doi-10-1002-eco-70279","title":"Crossref record doi:10.1002/eco.70279: Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests","url":"https://api.crossref.org/works/10.1002/eco.70279"},{"id":"doi:10.1002/eco.70279","title":"doi:10.1002/eco.70279","url":"https://doi.org/10.1002/eco.70279"}],"status":"frontier","summary":"doi:10.1002/eco.70279 \"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests\" (CC BY 4.0, published 2026-09-30) reports: \"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124233","kind":"claim","label":"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1029-2026gl124233"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124233","title":"Crossref record doi:10.1029/2026gl124233: Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change","url":"https://api.crossref.org/works/10.1029/2026gl124233"},{"id":"doi:10.1029/2026gl124233","title":"doi:10.1029/2026gl124233","url":"https://doi.org/10.1029/2026gl124233"}],"status":"frontier","summary":"doi:10.1029/2026gl124233 \"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change\" (CC BY 4.0, published 2026-09-29) reports: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gc013127","kind":"claim","label":"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1029-2026gc013127"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gc013127","title":"Crossref record doi:10.1029/2026gc013127: OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Perm","url":"https://api.crossref.org/works/10.1029/2026gc013127"},{"id":"doi:10.1029/2026gc013127","title":"doi:10.1029/2026gc013127","url":"https://doi.org/10.1029/2026gc013127"}],"status":"frontier","summary":"doi:10.1029/2026gc013127 \"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana\" (CC BY 4.0, published 2026-09-29) reports: \"Together with regional Permian plume‐affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70320","kind":"claim","label":"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1002-qj-70320"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70320","title":"Crossref record doi:10.1002/qj.70320: Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain","url":"https://api.crossref.org/works/10.1002/qj.70320"},{"id":"doi:10.1002/qj.70320","title":"doi:10.1002/qj.70320","url":"https://doi.org/10.1002/qj.70320"}],"status":"frontier","summary":"doi:10.1002/qj.70320 \"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain\" (CC BY 4.0, published 2026-09-29) reports: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","kind":"claim","label":"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-54929-2786-5738-2026-27-09-01"]},"sources":[{"id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","title":"Crossref record doi:10.54929/2786-5738-2026-27-09-01: Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries","url":"https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"},{"id":"doi:10.54929/2786-5738-2026-27-09-01","title":"doi:10.54929/2786-5738-2026-27-09-01","url":"https://doi.org/10.54929/2786-5738-2026-27-09-01"}],"status":"frontier","summary":"doi:10.54929/2786-5738-2026-27-09-01 \"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries\" (CC BY 4.0, published 2026-09-28) reports: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-erats-20261281","kind":"claim","label":"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-38159-erats-20261281"]},"sources":[{"id":"source.frontier.doi-10-38159-erats-20261281","title":"Crossref record doi:10.38159/erats.20261281: Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism","url":"https://api.crossref.org/works/10.38159/erats.20261281"},{"id":"doi:10.38159/erats.20261281","title":"doi:10.38159/erats.20261281","url":"https://doi.org/10.38159/erats.20261281"}],"status":"frontier","summary":"doi:10.38159/erats.20261281 \"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism\" (CC BY 4.0, published 2026-09-28) reports: \"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eco-70277","kind":"claim","label":"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-1002-eco-70277"]},"sources":[{"id":"source.frontier.doi-10-1002-eco-70277","title":"Crossref record doi:10.1002/eco.70277: From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coast","url":"https://api.crossref.org/works/10.1002/eco.70277"},{"id":"doi:10.1002/eco.70277","title":"doi:10.1002/eco.70277","url":"https://doi.org/10.1002/eco.70277"}],"status":"frontier","summary":"doi:10.1002/eco.70277 \"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland\" (CC BY 4.0, published 2026-09-28) reports: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-iroh-70046","kind":"claim","label":"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-27","source_ids":["source.frontier.doi-10-1002-iroh-70046"]},"sources":[{"id":"source.frontier.doi-10-1002-iroh-70046","title":"Crossref record doi:10.1002/iroh.70046: Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir","url":"https://api.crossref.org/works/10.1002/iroh.70046"},{"id":"doi:10.1002/iroh.70046","title":"doi:10.1002/iroh.70046","url":"https://doi.org/10.1002/iroh.70046"}],"status":"frontier","summary":"doi:10.1002/iroh.70046 \"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir\" (CC BY 4.0, published 2026-09-27) reports: \"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-erats-20261284","kind":"claim","label":"The irony of law and faith in corruption","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-26","source_ids":["source.frontier.doi-10-38159-erats-20261284"]},"sources":[{"id":"source.frontier.doi-10-38159-erats-20261284","title":"Crossref record doi:10.38159/erats.20261284: The irony of law and faith in corruption","url":"https://api.crossref.org/works/10.38159/erats.20261284"},{"id":"doi:10.38159/erats.20261284","title":"doi:10.38159/erats.20261284","url":"https://doi.org/10.38159/erats.20261284"}],"status":"frontier","summary":"doi:10.38159/erats.20261284 \"The irony of law and faith in corruption\" (CC BY 4.0, published 2026-09-26) reports: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ruso-70070","kind":"claim","label":"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-26","source_ids":["source.frontier.doi-10-1111-ruso-70070"]},"sources":[{"id":"source.frontier.doi-10-1111-ruso-70070","title":"Crossref record doi:10.1111/ruso.70070: Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities","url":"https://api.crossref.org/works/10.1111/ruso.70070"},{"id":"doi:10.1111/ruso.70070","title":"doi:10.1111/ruso.70070","url":"https://doi.org/10.1111/ruso.70070"}],"status":"frontier","summary":"doi:10.1111/ruso.70070 \"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities\" (CC BY 4.0, published 2026-09-26) reports: \"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural–urban communities and whether gaps with big‐city metros are intensifying.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-200681","kind":"claim","label":"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.doi-10-3897-nhcm-3-200681"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-200681","title":"Crossref record doi:10.3897/nhcm.3.200681: Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study","url":"https://api.crossref.org/works/10.3897/nhcm.3.200681"},{"id":"doi:10.3897/nhcm.3.200681","title":"doi:10.3897/nhcm.3.200681","url":"https://doi.org/10.3897/nhcm.3.200681"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.200681 \"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study\" (CC BY 4.0, published 2026-09-25) reports: \": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001005","kind":"claim","label":"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001005"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001005","title":"Crossref record doi:10.1371/journal.pclm.0001005: Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001005"},{"id":"doi:10.1371/journal.pclm.0001005","title":"doi:10.1371/journal.pclm.0001005","url":"https://doi.org/10.1371/journal.pclm.0001005"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001005 \"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria\" (CC BY 4.0, published 2026-09-24) reports: \"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-moth-70148","kind":"claim","label":"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.doi-10-1111-moth-70148"]},"sources":[{"id":"source.frontier.doi-10-1111-moth-70148","title":"Crossref record doi:10.1111/moth.70148: On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion","url":"https://api.crossref.org/works/10.1111/moth.70148"},{"id":"doi:10.1111/moth.70148","title":"doi:10.1111/moth.70148","url":"https://doi.org/10.1111/moth.70148"}],"status":"frontier","summary":"doi:10.1111/moth.70148 \"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion\" (CC BY 4.0, published 2026-09-24) reports: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-20267724","kind":"claim","label":"Leveraging community partnership: The case of Meraka Cultural Village","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.doi-10-38159-ehass-20267724"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-20267724","title":"Crossref record doi:10.38159/ehass.20267724: Leveraging community partnership: The case of Meraka Cultural Village","url":"https://api.crossref.org/works/10.38159/ehass.20267724"},{"id":"doi:10.38159/ehass.20267724","title":"doi:10.38159/ehass.20267724","url":"https://doi.org/10.38159/ehass.20267724"}],"status":"frontier","summary":"doi:10.38159/ehass.20267724 \"Leveraging community partnership: The case of Meraka Cultural Village\" (CC BY 4.0, published 2026-09-23) reports: \"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124881","kind":"claim","label":"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.doi-10-1029-2026gl124881"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124881","title":"Crossref record doi:10.1029/2026gl124881: Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland","url":"https://api.crossref.org/works/10.1029/2026gl124881"},{"id":"doi:10.1029/2026gl124881","title":"doi:10.1029/2026gl124881","url":"https://doi.org/10.1029/2026gl124881"}],"status":"frontier","summary":"doi:10.1029/2026gl124881 \"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland\" (CC BY 4.0, published 2026-09-23) reports: \"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice–bed interface without spatial interpolation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jh001578","kind":"claim","label":"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.doi-10-1029-2026jh001578"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jh001578","title":"Crossref record doi:10.1029/2026jh001578: Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location","url":"https://api.crossref.org/works/10.1029/2026jh001578"},{"id":"doi:10.1029/2026jh001578","title":"doi:10.1029/2026jh001578","url":"https://doi.org/10.1029/2026jh001578"}],"status":"frontier","summary":"doi:10.1029/2026jh001578 \"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location\" (CC BY 4.0, published 2026-09-21) reports: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-gdj3-70104","kind":"claim","label":"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.doi-10-1002-gdj3-70104"]},"sources":[{"id":"source.frontier.doi-10-1002-gdj3-70104","title":"Crossref record doi:10.1002/gdj3.70104: Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China","url":"https://api.crossref.org/works/10.1002/gdj3.70104"},{"id":"doi:10.1002/gdj3.70104","title":"doi:10.1002/gdj3.70104","url":"https://doi.org/10.1002/gdj3.70104"}],"status":"frontier","summary":"doi:10.1002/gdj3.70104 \"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China\" (CC BY 4.0, published 2026-09-21) reports: \"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1 h.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122610","kind":"claim","label":"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.doi-10-1029-2026gl122610"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122610","title":"Crossref record doi:10.1029/2026gl122610: Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin","url":"https://api.crossref.org/works/10.1029/2026gl122610"},{"id":"doi:10.1029/2026gl122610","title":"doi:10.1029/2026gl122610","url":"https://doi.org/10.1029/2026gl122610"}],"status":"frontier","summary":"doi:10.1029/2026gl122610 \"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin\" (CC BY 4.0, published 2026-09-18) reports: \"These results show that SWOT WSE assimilation improves discharge estimates under real‐world constraints, supporting water management in data‐sparse and transboundary basins globally.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70308","kind":"claim","label":"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.doi-10-1002-qj-70308"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70308","title":"Crossref record doi:10.1002/qj.70308: Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas","url":"https://api.crossref.org/works/10.1002/qj.70308"},{"id":"doi:10.1002/qj.70308","title":"doi:10.1002/qj.70308","url":"https://doi.org/10.1002/qj.70308"}],"status":"frontier","summary":"doi:10.1002/qj.70308 \"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas\" (CC BY 4.0, published 2026-09-17) reports: \"In contrast, the WH‐WD and CH‐WD clusters are associated with upper‐level cyclonic anomalies characteristic of WDs, embedded within broader wave‐train‐like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)–subtropical jet (STJ)–WD pathways.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-55730-1300-0632-4281","kind":"claim","label":"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.doi-10-55730-1300-0632-4281"]},"sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4281","title":"Crossref record doi:10.55730/1300-0632.4281: Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing","url":"https://api.crossref.org/works/10.55730/1300-0632.4281"},{"id":"doi:10.55730/1300-0632.4281","title":"doi:10.55730/1300-0632.4281","url":"https://doi.org/10.55730/1300-0632.4281"}],"status":"frontier","summary":"doi:10.55730/1300-0632.4281 \"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity\" (CC BY 4.0, published 2026-09-16) reports: \"The findings highlight that sliding mode–based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-55730-1300-0632-4275","kind":"claim","label":"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.doi-10-55730-1300-0632-4275"]},"sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4275","title":"Crossref record doi:10.55730/1300-0632.4275: Empowering edge intelligence through reparameterized lightweight transformers and distributed inference","url":"https://api.crossref.org/works/10.55730/1300-0632.4275"},{"id":"doi:10.55730/1300-0632.4275","title":"doi:10.55730/1300-0632.4275","url":"https://doi.org/10.55730/1300-0632.4275"}],"status":"frontier","summary":"doi:10.55730/1300-0632.4275 \"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference\" (CC BY 4.0, published 2026-09-16) reports: \"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eet-70139","kind":"claim","label":"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.doi-10-1002-eet-70139"]},"sources":[{"id":"source.frontier.doi-10-1002-eet-70139","title":"Crossref record doi:10.1002/eet.70139: After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours","url":"https://api.crossref.org/works/10.1002/eet.70139"},{"id":"doi:10.1002/eet.70139","title":"doi:10.1002/eet.70139","url":"https://doi.org/10.1002/eet.70139"}],"status":"frontier","summary":"doi:10.1002/eet.70139 \"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours\" (CC BY 4.0, published 2026-09-14) reports: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jclp-70212","kind":"claim","label":"Distant and Distressed: Interpersonal Problems in Anxiety and Depression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.doi-10-1002-jclp-70212"]},"sources":[{"id":"source.frontier.doi-10-1002-jclp-70212","title":"Crossref record doi:10.1002/jclp.70212: Distant and Distressed: Interpersonal Problems in Anxiety and Depression","url":"https://api.crossref.org/works/10.1002/jclp.70212"},{"id":"doi:10.1002/jclp.70212","title":"doi:10.1002/jclp.70212","url":"https://doi.org/10.1002/jclp.70212"}],"status":"frontier","summary":"doi:10.1002/jclp.70212 \"Distant and Distressed: Interpersonal Problems in Anxiety and Depression\" (CC BY 4.0, published 2026-09-12) reports: \"As predicted, a cold‐submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-12944-cwe-21-2-3","kind":"claim","label":"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.doi-10-12944-cwe-21-2-3"]},"sources":[{"id":"source.frontier.doi-10-12944-cwe-21-2-3","title":"Crossref record doi:10.12944/cwe.21.2.3: Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss","url":"https://api.crossref.org/works/10.12944/cwe.21.2.3"},{"id":"doi:10.12944/cwe.21.2.3","title":"doi:10.12944/cwe.21.2.3","url":"https://doi.org/10.12944/cwe.21.2.3"}],"status":"frontier","summary":"doi:10.12944/cwe.21.2.3 \"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss\" (CC BY 4.0, published 2026-09-10) reports: \"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-bse-71470","kind":"claim","label":"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.doi-10-1002-bse-71470"]},"sources":[{"id":"source.frontier.doi-10-1002-bse-71470","title":"Crossref record doi:10.1002/bse.71470: Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector","url":"https://api.crossref.org/works/10.1002/bse.71470"},{"id":"doi:10.1002/bse.71470","title":"doi:10.1002/bse.71470","url":"https://doi.org/10.1002/bse.71470"}],"status":"frontier","summary":"doi:10.1002/bse.71470 \"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector\" (CC BY 4.0, published 2026-09-09) reports: \"Based on 41 semi‐structured interviews with representatives of 22 logistics companies in the Osnabrück region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource‐rich firms are more adept due to human resource slack, allowing them to process and document climate‐related sensory experiences and undertake anticipatory exercises.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000986","kind":"claim","label":"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000986"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000986","title":"Crossref record doi:10.1371/journal.pclm.0000986: Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000986"},{"id":"doi:10.1371/journal.pclm.0000986","title":"doi:10.1371/journal.pclm.0000986","url":"https://doi.org/10.1371/journal.pclm.0000986"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000986 \"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins\" (CC BY 4.0, published 2026-09-08) reports: \"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1752-1688-70151","kind":"claim","label":"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.doi-10-1111-1752-1688-70151"]},"sources":[{"id":"source.frontier.doi-10-1111-1752-1688-70151","title":"Crossref record doi:10.1111/1752-1688.70151: Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil","url":"https://api.crossref.org/works/10.1111/1752-1688.70151"},{"id":"doi:10.1111/1752-1688.70151","title":"doi:10.1111/1752-1688.70151","url":"https://doi.org/10.1111/1752-1688.70151"}],"status":"frontier","summary":"doi:10.1111/1752-1688.70151 \"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil\" (CC BY 4.0, published 2026-09-07) reports: \"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jade-70048","kind":"claim","label":"A Visual Brainstorming Technique in Character Design: Braindrawing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.doi-10-1111-jade-70048"]},"sources":[{"id":"source.frontier.doi-10-1111-jade-70048","title":"Crossref record doi:10.1111/jade.70048: A Visual Brainstorming Technique in Character Design: Braindrawing","url":"https://api.crossref.org/works/10.1111/jade.70048"},{"id":"doi:10.1111/jade.70048","title":"doi:10.1111/jade.70048","url":"https://doi.org/10.1111/jade.70048"}],"status":"frontier","summary":"doi:10.1111/jade.70048 \"A Visual Brainstorming Technique in Character Design: Braindrawing\" (CC BY 4.0, published 2026-09-05) reports: \"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-lcrp-70059","kind":"claim","label":"Prison victimization and post‐release outcomes: A systematic review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.doi-10-1111-lcrp-70059"]},"sources":[{"id":"source.frontier.doi-10-1111-lcrp-70059","title":"Crossref record doi:10.1111/lcrp.70059: Prison victimization and post‐release outcomes: A systematic review","url":"https://api.crossref.org/works/10.1111/lcrp.70059"},{"id":"doi:10.1111/lcrp.70059","title":"doi:10.1111/lcrp.70059","url":"https://doi.org/10.1111/lcrp.70059"}],"status":"frontier","summary":"doi:10.1111/lcrp.70059 \"Prison victimization and post‐release outcomes: A systematic review\" (CC BY 4.0, published 2026-09-04) reports: \"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-77938","kind":"claim","label":"Load Distributing Metamaterials Via Discrete Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.doi-10-1002-adfm-77938"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-77938","title":"Crossref record doi:10.1002/adfm.77938: Load Distributing Metamaterials Via Discrete Optimization","url":"https://api.crossref.org/works/10.1002/adfm.77938"},{"id":"doi:10.1002/adfm.77938","title":"doi:10.1002/adfm.77938","url":"https://doi.org/10.1002/adfm.77938"}],"status":"frontier","summary":"doi:10.1002/adfm.77938 \"Load Distributing Metamaterials Via Discrete Optimization\" (CC BY 4.0, published 2026-09-04) reports: \"We demonstrate both single‐objective optimization for a prescribed indenter position and a multi‐objective formulation that enforces robust performance across multiple loading locations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e185197","kind":"claim","label":"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e185197"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e185197","title":"Crossref record doi:10.3897/brics-econ.7.e185197: Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e185197"},{"id":"doi:10.3897/brics-econ.7.e185197","title":"doi:10.3897/brics-econ.7.e185197","url":"https://doi.org/10.3897/brics-econ.7.e185197"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e185197 \"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia\" (CC BY 4.0, published 2026-09-03) reports: \"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl125327","kind":"claim","label":"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-1029-2026gl125327"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl125327","title":"Crossref record doi:10.1029/2026gl125327: Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica","url":"https://api.crossref.org/works/10.1029/2026gl125327"},{"id":"doi:10.1029/2026gl125327","title":"doi:10.1029/2026gl125327","url":"https://doi.org/10.1029/2026gl125327"}],"status":"frontier","summary":"doi:10.1029/2026gl125327 \"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica\" (CC BY 4.0, published 2026-09-03) reports: \"Our results show that while a large disturbance event can increase solute inputs and shift the long‐term average dissolved ion concentrations, the overall stream discharge‐concentration relationship may remain chemostatic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70302","kind":"claim","label":"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-1002-qj-70302"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70302","title":"Crossref record doi:10.1002/qj.70302: Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments","url":"https://api.crossref.org/works/10.1002/qj.70302"},{"id":"doi:10.1002/qj.70302","title":"doi:10.1002/qj.70302","url":"https://doi.org/10.1002/qj.70302"}],"status":"frontier","summary":"doi:10.1002/qj.70302 \"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments\" (CC BY 4.0, published 2026-09-03) reports: \"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000930","kind":"claim","label":"Countering climate misinformation with large language models: Evidence from ChatGPT","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000930"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000930","title":"Crossref record doi:10.1371/journal.pclm.0000930: Countering climate misinformation with large language models: Evidence from ChatGPT","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000930"},{"id":"doi:10.1371/journal.pclm.0000930","title":"doi:10.1371/journal.pclm.0000930","url":"https://doi.org/10.1371/journal.pclm.0000930"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000930 \"Countering climate misinformation with large language models: Evidence from ChatGPT\" (CC BY 4.0, published 2026-09-02) reports: \"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsnr-2026-0030","kind":"claim","label":"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1098-rsnr-2026-0030"]},"sources":[{"id":"source.frontier.doi-10-1098-rsnr-2026-0030","title":"Crossref record doi:10.1098/rsnr.2026.0030: Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge","url":"https://api.crossref.org/works/10.1098/rsnr.2026.0030"},{"id":"doi:10.1098/rsnr.2026.0030","title":"doi:10.1098/rsnr.2026.0030","url":"https://doi.org/10.1098/rsnr.2026.0030"}],"status":"frontier","summary":"doi:10.1098/rsnr.2026.0030 \"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge\" (CC BY 4.0, published 2026-09-02) reports: \"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaquín in Mexico City.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-cli2-70062","kind":"claim","label":"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1002-cli2-70062"]},"sources":[{"id":"source.frontier.doi-10-1002-cli2-70062","title":"Crossref record doi:10.1002/cli2.70062: Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and ","url":"https://api.crossref.org/works/10.1002/cli2.70062"},{"id":"doi:10.1002/cli2.70062","title":"doi:10.1002/cli2.70062","url":"https://doi.org/10.1002/cli2.70062"}],"status":"frontier","summary":"doi:10.1002/cli2.70062 \"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin\" (CC BY 4.0, published 2026-09-02) reports: \"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","kind":"claim","label":"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974"]},"sources":[{"id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","title":"Crossref record doi:10.11591/ijeecs.v43.i3.pp965-974: Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning","url":"https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"},{"id":"doi:10.11591/ijeecs.v43.i3.pp965-974","title":"doi:10.11591/ijeecs.v43.i3.pp965-974","url":"https://doi.org/10.11591/ijeecs.v43.i3.pp965-974"}],"status":"frontier","summary":"doi:10.11591/ijeecs.v43.i3.pp965-974 \"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning\" (CC BY 4.0, published 2026-09-01) reports: \"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines—by 5.7% and 8.9%, respectively—while maintaining complete data privacy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70852","kind":"claim","label":"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-1111-ejed-70852"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70852","title":"Crossref record doi:10.1111/ejed.70852: The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts","url":"https://api.crossref.org/works/10.1111/ejed.70852"},{"id":"doi:10.1111/ejed.70852","title":"doi:10.1111/ejed.70852","url":"https://doi.org/10.1111/ejed.70852"}],"status":"frontier","summary":"doi:10.1111/ejed.70852 \"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts\" (CC BY 4.0, published 2026-09-01) reports: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70845","kind":"claim","label":"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-1111-ejed-70845"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70845","title":"Crossref record doi:10.1111/ejed.70845: Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Env","url":"https://api.crossref.org/works/10.1111/ejed.70845"},{"id":"doi:10.1111/ejed.70845","title":"doi:10.1111/ejed.70845","url":"https://doi.org/10.1111/ejed.70845"}],"status":"frontier","summary":"doi:10.1111/ejed.70845 \"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments\" (CC BY 4.0, published 2026-09-01) reports: \"The findings demonstrated that character strengths were positively associated with all three outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001039","kind":"claim","label":"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001039"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001039","title":"Crossref record doi:10.1371/journal.pclm.0001039: From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001039"},{"id":"doi:10.1371/journal.pclm.0001039","title":"doi:10.1371/journal.pclm.0001039","url":"https://doi.org/10.1371/journal.pclm.0001039"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001039 \"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour\" (CC BY 4.0, published 2026-08-31) reports: \"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-nup-70114","kind":"claim","label":"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1111-nup-70114"]},"sources":[{"id":"source.frontier.doi-10-1111-nup-70114","title":"Crossref record doi:10.1111/nup.70114: A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care","url":"https://api.crossref.org/works/10.1111/nup.70114"},{"id":"doi:10.1111/nup.70114","title":"doi:10.1111/nup.70114","url":"https://doi.org/10.1111/nup.70114"}],"status":"frontier","summary":"doi:10.1111/nup.70114 \"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care\" (CC BY 4.0, published 2026-08-31) reports: \"The findings suggest that the morning bed‐bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejss-70414","kind":"claim","label":"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1111-ejss-70414"]},"sources":[{"id":"source.frontier.doi-10-1111-ejss-70414","title":"Crossref record doi:10.1111/ejss.70414: Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices","url":"https://api.crossref.org/works/10.1111/ejss.70414"},{"id":"doi:10.1111/ejss.70414","title":"doi:10.1111/ejss.70414","url":"https://doi.org/10.1111/ejss.70414"}],"status":"frontier","summary":"doi:10.1111/ejss.70414 \"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices\" (CC BY 4.0, published 2026-08-31) reports: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026wr044293","kind":"claim","label":"Morphological State Transitions and Sediment Transport Variability in Braided Rivers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.doi-10-1029-2026wr044293"]},"sources":[{"id":"source.frontier.doi-10-1029-2026wr044293","title":"Crossref record doi:10.1029/2026wr044293: Morphological State Transitions and Sediment Transport Variability in Braided Rivers","url":"https://api.crossref.org/works/10.1029/2026wr044293"},{"id":"doi:10.1029/2026wr044293","title":"doi:10.1029/2026wr044293","url":"https://doi.org/10.1029/2026wr044293"}],"status":"frontier","summary":"doi:10.1029/2026wr044293 \"Morphological State Transitions and Sediment Transport Variability in Braided Rivers\" (CC BY 4.0, published 2026-08-29) reports: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp-70399","kind":"claim","label":"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.doi-10-1002-esp-70399"]},"sources":[{"id":"source.frontier.doi-10-1002-esp-70399","title":"Crossref record doi:10.1002/esp.70399: Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince Will","url":"https://api.crossref.org/works/10.1002/esp.70399"},{"id":"doi:10.1002/esp.70399","title":"doi:10.1002/esp.70399","url":"https://doi.org/10.1002/esp.70399"}],"status":"frontier","summary":"doi:10.1002/esp.70399 \"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska\" (CC BY 4.0, published 2026-08-27) reports: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jqs-70108","kind":"claim","label":"A talus rock glacier in Nantlle Valley, North Wales","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.doi-10-1002-jqs-70108"]},"sources":[{"id":"source.frontier.doi-10-1002-jqs-70108","title":"Crossref record doi:10.1002/jqs.70108: A talus rock glacier in Nantlle Valley, North Wales","url":"https://api.crossref.org/works/10.1002/jqs.70108"},{"id":"doi:10.1002/jqs.70108","title":"doi:10.1002/jqs.70108","url":"https://doi.org/10.1002/jqs.70108"}],"status":"frontier","summary":"doi:10.1002/jqs.70108 \"A talus rock glacier in Nantlle Valley, North Wales\" (CC BY 4.0, published 2026-08-26) reports: \"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small‐scale failure events.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jd046723","kind":"claim","label":"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.doi-10-1029-2026jd046723"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jd046723","title":"Crossref record doi:10.1029/2026jd046723: High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America","url":"https://api.crossref.org/works/10.1029/2026jd046723"},{"id":"doi:10.1029/2026jd046723","title":"doi:10.1029/2026jd046723","url":"https://doi.org/10.1029/2026jd046723"}],"status":"frontier","summary":"doi:10.1029/2026jd046723 \"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America\" (CC BY 4.0, published 2026-08-24) reports: \"H reached 0.43, and the 5 km simulation outperformed the previous 10 km run, highlighting the benefits of improved topographic representation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-msd2-70089","kind":"claim","label":"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.doi-10-1002-msd2-70089"]},"sources":[{"id":"source.frontier.doi-10-1002-msd2-70089","title":"Crossref record doi:10.1002/msd2.70089: Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission","url":"https://api.crossref.org/works/10.1002/msd2.70089"},{"id":"doi:10.1002/msd2.70089","title":"doi:10.1002/msd2.70089","url":"https://doi.org/10.1002/msd2.70089"}],"status":"frontier","summary":"doi:10.1002/msd2.70089 \"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission\" (CC BY 4.0, published 2026-08-24) reports: \"The stability of the controlling system is proved by the Lyapunov stability theory.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70342","kind":"claim","label":"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.doi-10-1111-ijal-70342"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70342","title":"Crossref record doi:10.1111/ijal.70342: Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German C","url":"https://api.crossref.org/works/10.1111/ijal.70342"},{"id":"doi:10.1111/ijal.70342","title":"doi:10.1111/ijal.70342","url":"https://doi.org/10.1111/ijal.70342"}],"status":"frontier","summary":"doi:10.1111/ijal.70342 \"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses\" (CC BY 4.0, published 2026-08-21) reports: \"Analyses supported a process‐consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-cli2-70059","kind":"claim","label":"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.doi-10-1002-cli2-70059"]},"sources":[{"id":"source.frontier.doi-10-1002-cli2-70059","title":"Crossref record doi:10.1002/cli2.70059: Uncertainty Quantification and Attribution for Resilient Infrastructure Systems","url":"https://api.crossref.org/works/10.1002/cli2.70059"},{"id":"doi:10.1002/cli2.70059","title":"doi:10.1002/cli2.70059","url":"https://doi.org/10.1002/cli2.70059"}],"status":"frontier","summary":"doi:10.1002/cli2.70059 \"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems\" (CC BY 4.0, published 2026-08-20) reports: \"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124727","kind":"claim","label":"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.doi-10-1029-2026gl124727"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124727","title":"Crossref record doi:10.1029/2026gl124727: Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change","url":"https://api.crossref.org/works/10.1029/2026gl124727"},{"id":"doi:10.1029/2026gl124727","title":"doi:10.1029/2026gl124727","url":"https://doi.org/10.1029/2026gl124727"}],"status":"frontier","summary":"doi:10.1029/2026gl124727 \"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change\" (CC BY 4.0, published 2026-08-19) reports: \"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000877","kind":"claim","label":"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000877"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000877","title":"Crossref record doi:10.1371/journal.pclm.0000877: The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000877"},{"id":"doi:10.1371/journal.pclm.0000877","title":"doi:10.1371/journal.pclm.0000877","url":"https://doi.org/10.1371/journal.pclm.0000877"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000877 \"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study\" (CC BY 4.0, published 2026-08-18) reports: \"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jmg-70054","kind":"claim","label":"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.doi-10-1111-jmg-70054"]},"sources":[{"id":"source.frontier.doi-10-1111-jmg-70054","title":"Crossref record doi:10.1111/jmg.70054: Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression","url":"https://api.crossref.org/works/10.1111/jmg.70054"},{"id":"doi:10.1111/jmg.70054","title":"doi:10.1111/jmg.70054","url":"https://doi.org/10.1111/jmg.70054"}],"status":"frontier","summary":"doi:10.1111/jmg.70054 \"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression\" (CC BY 4.0, published 2026-08-18) reports: \"We demonstrate that machine learning can decipher complex multi‐elemental relationships in zircon REE data and can be used to classify zircon.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-moth-70134","kind":"claim","label":"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.doi-10-1111-moth-70134"]},"sources":[{"id":"source.frontier.doi-10-1111-moth-70134","title":"Crossref record doi:10.1111/moth.70134: Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano","url":"https://api.crossref.org/works/10.1111/moth.70134"},{"id":"doi:10.1111/moth.70134","title":"doi:10.1111/moth.70134","url":"https://doi.org/10.1111/moth.70134"}],"status":"frontier","summary":"doi:10.1111/moth.70134 \"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano\" (CC BY 4.0, published 2026-08-17) reports: \"This vision is shown to be ‘conjured’ up from what is identified as a distinctive, Black Atlantic way of reading Scripture.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-gwat-70098","kind":"claim","label":"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-15","source_ids":["source.frontier.doi-10-1111-gwat-70098"]},"sources":[{"id":"source.frontier.doi-10-1111-gwat-70098","title":"Crossref record doi:10.1111/gwat.70098: Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange","url":"https://api.crossref.org/works/10.1111/gwat.70098"},{"id":"doi:10.1111/gwat.70098","title":"doi:10.1111/gwat.70098","url":"https://doi.org/10.1111/gwat.70098"}],"status":"frontier","summary":"doi:10.1111/gwat.70098 \"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange\" (CC BY 4.0, published 2026-08-15) reports: \"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream–aquifer exchange and provide a physically based alternative for large‐scale integrated groundwater–surface water modeling.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wp-2026-018","kind":"claim","label":"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.doi-10-2166-wp-2026-018"]},"sources":[{"id":"source.frontier.doi-10-2166-wp-2026-018","title":"Crossref record doi:10.2166/wp.2026.018: A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions","url":"https://api.crossref.org/works/10.2166/wp.2026.018"},{"id":"doi:10.2166/wp.2026.018","title":"doi:10.2166/wp.2026.018","url":"https://doi.org/10.2166/wp.2026.018"}],"status":"frontier","summary":"doi:10.2166/wp.2026.018 \"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions\" (CC BY 4.0, published 2026-08-14) reports: \"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsta-2025-0107","kind":"claim","label":"Merits of geometric algebra applied to cryptography and machine learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.doi-10-1098-rsta-2025-0107"]},"sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0107","title":"Crossref record doi:10.1098/rsta.2025.0107: Merits of geometric algebra applied to cryptography and machine learning","url":"https://api.crossref.org/works/10.1098/rsta.2025.0107"},{"id":"doi:10.1098/rsta.2025.0107","title":"doi:10.1098/rsta.2025.0107","url":"https://doi.org/10.1098/rsta.2025.0107"}],"status":"frontier","summary":"doi:10.1098/rsta.2025.0107 \"Merits of geometric algebra applied to cryptography and machine learning\" (CC BY 4.0, published 2026-08-13) reports: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000931","kind":"claim","label":"Mapping climate-related forest risks: An index-based approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000931"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000931","title":"Crossref record doi:10.1371/journal.pclm.0000931: Mapping climate-related forest risks: An index-based approach","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000931"},{"id":"doi:10.1371/journal.pclm.0000931","title":"doi:10.1371/journal.pclm.0000931","url":"https://doi.org/10.1371/journal.pclm.0000931"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000931 \"Mapping climate-related forest risks: An index-based approach\" (CC BY 4.0, published 2026-08-12) reports: \"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122646","kind":"claim","label":"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1029-2026gl122646"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122646","title":"Crossref record doi:10.1029/2026gl122646: Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land","url":"https://api.crossref.org/works/10.1029/2026gl122646"},{"id":"doi:10.1029/2026gl122646","title":"doi:10.1029/2026gl122646","url":"https://doi.org/10.1029/2026gl122646"}],"status":"frontier","summary":"doi:10.1029/2026gl122646 \"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land\" (CC BY 4.0, published 2026-08-12) reports: \"We analyze near‐coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot/humid extremes on land.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70058","kind":"claim","label":"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1002-ppp-70058"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70058","title":"Crossref record doi:10.1002/ppp.70058: Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape","url":"https://api.crossref.org/works/10.1002/ppp.70058"},{"id":"doi:10.1002/ppp.70058","title":"doi:10.1002/ppp.70058","url":"https://doi.org/10.1002/ppp.70058"}],"status":"frontier","summary":"doi:10.1002/ppp.70058 \"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape\" (CC BY 4.0, published 2026-08-12) reports: \"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jpln-70107","kind":"claim","label":"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1002-jpln-70107"]},"sources":[{"id":"source.frontier.doi-10-1002-jpln-70107","title":"Crossref record doi:10.1002/jpln.70107: The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types","url":"https://api.crossref.org/works/10.1002/jpln.70107"},{"id":"doi:10.1002/jpln.70107","title":"doi:10.1002/jpln.70107","url":"https://doi.org/10.1002/jpln.70107"}],"status":"frontier","summary":"doi:10.1002/jpln.70107 \"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types\" (CC BY 4.0, published 2026-08-12) reports: \": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-187529","kind":"claim","label":"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-3897-nhcm-3-187529"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-187529","title":"Crossref record doi:10.3897/nhcm.3.187529: Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish","url":"https://api.crossref.org/works/10.3897/nhcm.3.187529"},{"id":"doi:10.3897/nhcm.3.187529","title":"doi:10.3897/nhcm.3.187529","url":"https://doi.org/10.3897/nhcm.3.187529"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.187529 \"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish\" (CC BY 4.0, published 2026-08-10) reports: \"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026775","kind":"claim","label":"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-38159-ehass-2026775"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026775","title":"Crossref record doi:10.38159/ehass.2026775: Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis","url":"https://api.crossref.org/works/10.38159/ehass.2026775"},{"id":"doi:10.38159/ehass.2026775","title":"doi:10.38159/ehass.2026775","url":"https://doi.org/10.38159/ehass.2026775"}],"status":"frontier","summary":"doi:10.38159/ehass.2026775 \"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis\" (CC BY 4.0, published 2026-08-10) reports: \"The findings reveal that parodic proverbs perform multiple social and communicative functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026774","kind":"claim","label":"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-38159-ehass-2026774"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026774","title":"Crossref record doi:10.38159/ehass.2026774: Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Pall","url":"https://api.crossref.org/works/10.38159/ehass.2026774"},{"id":"doi:10.38159/ehass.2026774","title":"doi:10.38159/ehass.2026774","url":"https://doi.org/10.38159/ehass.2026774"}],"status":"frontier","summary":"doi:10.38159/ehass.2026774 \"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities\" (CC BY 4.0, published 2026-08-10) reports: \"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-hec-70140","kind":"claim","label":"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-08","source_ids":["source.frontier.doi-10-1002-hec-70140"]},"sources":[{"id":"source.frontier.doi-10-1002-hec-70140","title":"Crossref record doi:10.1002/hec.70140: Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery","url":"https://api.crossref.org/works/10.1002/hec.70140"},{"id":"doi:10.1002/hec.70140","title":"doi:10.1002/hec.70140","url":"https://doi.org/10.1002/hec.70140"}],"status":"frontier","summary":"doi:10.1002/hec.70140 \"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery\" (CC BY 4.0, published 2026-08-08) reports: \"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-tox-70177","kind":"claim","label":"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.doi-10-1002-tox-70177"]},"sources":[{"id":"source.frontier.doi-10-1002-tox-70177","title":"Crossref record doi:10.1002/tox.70177: Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa","url":"https://api.crossref.org/works/10.1002/tox.70177"},{"id":"doi:10.1002/tox.70177","title":"doi:10.1002/tox.70177","url":"https://doi.org/10.1002/tox.70177"}],"status":"frontier","summary":"doi:10.1002/tox.70177 \"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa\" (CC BY 4.0, published 2026-08-07) reports: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-77585","kind":"claim","label":"An Electrowetting Pump","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.doi-10-1002-adfm-77585"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-77585","title":"Crossref record doi:10.1002/adfm.77585: An Electrowetting Pump","url":"https://api.crossref.org/works/10.1002/adfm.77585"},{"id":"doi:10.1002/adfm.77585","title":"doi:10.1002/adfm.77585","url":"https://doi.org/10.1002/adfm.77585"}],"status":"frontier","summary":"doi:10.1002/adfm.77585 \"An Electrowetting Pump\" (CC BY 4.0, published 2026-08-07) reports: \"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9566-70245","kind":"claim","label":"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.doi-10-1111-1467-9566-70245"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70245","title":"Crossref record doi:10.1111/1467-9566.70245: The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal","url":"https://api.crossref.org/works/10.1111/1467-9566.70245"},{"id":"doi:10.1111/1467-9566.70245","title":"doi:10.1111/1467-9566.70245","url":"https://doi.org/10.1111/1467-9566.70245"}],"status":"frontier","summary":"doi:10.1111/1467-9566.70245 \"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal\" (CC BY 4.0, published 2026-08-06) reports: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70337","kind":"claim","label":"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.doi-10-1111-ijal-70337"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70337","title":"Crossref record doi:10.1111/ijal.70337: Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts","url":"https://api.crossref.org/works/10.1111/ijal.70337"},{"id":"doi:10.1111/ijal.70337","title":"doi:10.1111/ijal.70337","url":"https://doi.org/10.1111/ijal.70337"}],"status":"frontier","summary":"doi:10.1111/ijal.70337 \"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts\" (CC BY 4.0, published 2026-08-05) reports: \"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl123821","kind":"claim","label":"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.doi-10-1029-2026gl123821"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl123821","title":"Crossref record doi:10.1029/2026gl123821: Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers","url":"https://api.crossref.org/works/10.1029/2026gl123821"},{"id":"doi:10.1029/2026gl123821","title":"doi:10.1029/2026gl123821","url":"https://doi.org/10.1029/2026gl123821"}],"status":"frontier","summary":"doi:10.1029/2026gl123821 \"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers\" (CC BY 4.0, published 2026-08-05) reports: \"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land‐surface processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70252","kind":"claim","label":"Using microwave imager observations to improve the ocean temperature in a coupled NWP system","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.doi-10-1002-qj-70252"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70252","title":"Crossref record doi:10.1002/qj.70252: Using microwave imager observations to improve the ocean temperature in a coupled NWP system","url":"https://api.crossref.org/works/10.1002/qj.70252"},{"id":"doi:10.1002/qj.70252","title":"doi:10.1002/qj.70252","url":"https://doi.org/10.1002/qj.70252"}],"status":"frontier","summary":"doi:10.1002/qj.70252 \"Using microwave imager observations to improve the ocean temperature in a coupled NWP system\" (CC BY 4.0, published 2026-08-02) reports: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70540","kind":"claim","label":"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.doi-10-1002-joc-70540"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70540","title":"Crossref record doi:10.1002/joc.70540: Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models","url":"https://api.crossref.org/works/10.1002/joc.70540"},{"id":"doi:10.1002/joc.70540","title":"doi:10.1002/joc.70540","url":"https://doi.org/10.1002/joc.70540"}],"status":"frontier","summary":"doi:10.1002/joc.70540 \"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models\" (CC BY 4.0, published 2026-08-02) reports: \"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher‐resolution ensembles within the UKCP18 framework.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-eje-70266","kind":"claim","label":"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.doi-10-1111-eje-70266"]},"sources":[{"id":"source.frontier.doi-10-1111-eje-70266","title":"Crossref record doi:10.1111/eje.70266: Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists","url":"https://api.crossref.org/works/10.1111/eje.70266"},{"id":"doi:10.1111/eje.70266","title":"doi:10.1111/eje.70266","url":"https://doi.org/10.1111/eje.70266"}],"status":"frontier","summary":"doi:10.1111/eje.70266 \"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists\" (CC BY 4.0, published 2026-07-31) reports: \"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ecpo-70064","kind":"claim","label":"Chinese Lending and Sovereign Debt Distress in Developing Countries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.doi-10-1111-ecpo-70064"]},"sources":[{"id":"source.frontier.doi-10-1111-ecpo-70064","title":"Crossref record doi:10.1111/ecpo.70064: Chinese Lending and Sovereign Debt Distress in Developing Countries","url":"https://api.crossref.org/works/10.1111/ecpo.70064"},{"id":"doi:10.1111/ecpo.70064","title":"doi:10.1111/ecpo.70064","url":"https://doi.org/10.1111/ecpo.70064"}],"status":"frontier","summary":"doi:10.1111/ecpo.70064 \"Chinese Lending and Sovereign Debt Distress in Developing Countries\" (CC BY 4.0, published 2026-07-31) reports: \"Employing a within‐between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-beer-70139","kind":"claim","label":"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1111-beer-70139"]},"sources":[{"id":"source.frontier.doi-10-1111-beer-70139","title":"Crossref record doi:10.1111/beer.70139: Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees","url":"https://api.crossref.org/works/10.1111/beer.70139"},{"id":"doi:10.1111/beer.70139","title":"doi:10.1111/beer.70139","url":"https://doi.org/10.1111/beer.70139"}],"status":"frontier","summary":"doi:10.1111/beer.70139 \"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees\" (CC BY 4.0, published 2026-07-30) reports: \"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsta-2025-0029","kind":"claim","label":"The many faces of rotating quantum turbulence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1098-rsta-2025-0029"]},"sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0029","title":"Crossref record doi:10.1098/rsta.2025.0029: The many faces of rotating quantum turbulence","url":"https://api.crossref.org/works/10.1098/rsta.2025.0029"},{"id":"doi:10.1098/rsta.2025.0029","title":"doi:10.1098/rsta.2025.0029","url":"https://doi.org/10.1098/rsta.2025.0029"}],"status":"frontier","summary":"doi:10.1098/rsta.2025.0029 \"The many faces of rotating quantum turbulence\" (CC BY 4.0, published 2026-07-30) reports: \"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124661","kind":"claim","label":"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2026gl124661"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124661","title":"Crossref record doi:10.1029/2026gl124661: How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?","url":"https://api.crossref.org/works/10.1029/2026gl124661"},{"id":"doi:10.1029/2026gl124661","title":"doi:10.1029/2026gl124661","url":"https://doi.org/10.1029/2026gl124661"}],"status":"frontier","summary":"doi:10.1029/2026gl124661 \"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?\" (CC BY 4.0, published 2026-07-30) reports: \"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full‐training‐data baseline model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jc023581","kind":"claim","label":"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2025jc023581"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jc023581","title":"Crossref record doi:10.1029/2025jc023581: Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey","url":"https://api.crossref.org/works/10.1029/2025jc023581"},{"id":"doi:10.1029/2025jc023581","title":"doi:10.1029/2025jc023581","url":"https://doi.org/10.1029/2025jc023581"}],"status":"frontier","summary":"doi:10.1029/2025jc023581 \"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey\" (CC BY 4.0, published 2026-07-30) reports: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jb032632","kind":"claim","label":"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2025jb032632"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jb032632","title":"Crossref record doi:10.1029/2025jb032632: Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series","url":"https://api.crossref.org/works/10.1029/2025jb032632"},{"id":"doi:10.1029/2025jb032632","title":"doi:10.1029/2025jb032632","url":"https://doi.org/10.1029/2025jb032632"}],"status":"frontier","summary":"doi:10.1029/2025jb032632 \"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series\" (CC BY 4.0, published 2026-07-30) reports: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70526","kind":"claim","label":"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.doi-10-1002-joc-70526"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70526","title":"Crossref record doi:10.1002/joc.70526: Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI","url":"https://api.crossref.org/works/10.1002/joc.70526"},{"id":"doi:10.1002/joc.70526","title":"doi:10.1002/joc.70526","url":"https://doi.org/10.1002/joc.70526"}],"status":"frontier","summary":"doi:10.1002/joc.70526 \"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI\" (CC BY 4.0, published 2026-07-28) reports: \"The results reveal a spatially heterogeneous and non‐stationary drought regime across Greece.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-saje-70032","kind":"claim","label":"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.doi-10-1111-saje-70032"]},"sources":[{"id":"source.frontier.doi-10-1111-saje-70032","title":"Crossref record doi:10.1111/saje.70032: The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?","url":"https://api.crossref.org/works/10.1111/saje.70032"},{"id":"doi:10.1111/saje.70032","title":"doi:10.1111/saje.70032","url":"https://doi.org/10.1111/saje.70032"}],"status":"frontier","summary":"doi:10.1111/saje.70032 \"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?\" (CC BY 4.0, published 2026-07-26) reports: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124111","kind":"claim","label":"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.doi-10-1029-2026gl124111"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124111","title":"Crossref record doi:10.1029/2026gl124111: Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation","url":"https://api.crossref.org/works/10.1029/2026gl124111"},{"id":"doi:10.1029/2026gl124111","title":"doi:10.1029/2026gl124111","url":"https://doi.org/10.1029/2026gl124111"}],"status":"frontier","summary":"doi:10.1029/2026gl124111 \"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation\" (CC BY 4.0, published 2026-07-23) reports: \"Using observational data sets and numerical experiments, we demonstrate that this IOD‐ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70772","kind":"claim","label":"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-20","source_ids":["source.frontier.doi-10-1111-ejed-70772"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70772","title":"Crossref record doi:10.1111/ejed.70772: Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential","url":"https://api.crossref.org/works/10.1111/ejed.70772"},{"id":"doi:10.1111/ejed.70772","title":"doi:10.1111/ejed.70772","url":"https://doi.org/10.1111/ejed.70772"}],"status":"frontier","summary":"doi:10.1111/ejed.70772 \"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential\" (CC BY 4.0, published 2026-07-20) reports: \"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem‐solving.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122539","kind":"claim","label":"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-18","source_ids":["source.frontier.doi-10-1029-2026gl122539"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122539","title":"Crossref record doi:10.1029/2026gl122539: SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics","url":"https://api.crossref.org/works/10.1029/2026gl122539"},{"id":"doi:10.1029/2026gl122539","title":"doi:10.1029/2026gl122539","url":"https://doi.org/10.1029/2026gl122539"}],"status":"frontier","summary":"doi:10.1029/2026gl122539 \"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics\" (CC BY 4.0, published 2026-07-18) reports: \"We demonstrate that repeated SWOT high‐rate acquisitions can accurately monitor changes in ice‐shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70310","kind":"claim","label":"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.doi-10-1111-ijal-70310"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70310","title":"Crossref record doi:10.1111/ijal.70310: Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice","url":"https://api.crossref.org/works/10.1111/ijal.70310"},{"id":"doi:10.1111/ijal.70310","title":"doi:10.1111/ijal.70310","url":"https://doi.org/10.1111/ijal.70310"}],"status":"frontier","summary":"doi:10.1111/ijal.70310 \"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice\" (CC BY 4.0, published 2026-07-17) reports: \"The findings indicate that prompting instruction improves communication efficiency, particularly in higher‐complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human–chatbot interaction, alongside a modest, non‐significant advantage in task completion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-76901","kind":"claim","label":"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.doi-10-1002-adfm-76901"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-76901","title":"Crossref record doi:10.1002/adfm.76901: Implantable Ionic Memristors Based on Natural Polymer Heterojunctions","url":"https://api.crossref.org/works/10.1002/adfm.76901"},{"id":"doi:10.1002/adfm.76901","title":"doi:10.1002/adfm.76901","url":"https://doi.org/10.1002/adfm.76901"}],"status":"frontier","summary":"doi:10.1002/adfm.76901 \"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions\" (CC BY 4.0, published 2026-07-17) reports: \"Here, we report a fully biocompatible natural polymer‐based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-nzm2-70056","kind":"claim","label":"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.doi-10-1002-nzm2-70056"]},"sources":[{"id":"source.frontier.doi-10-1002-nzm2-70056","title":"Crossref record doi:10.1002/nzm2.70056: Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand","url":"https://api.crossref.org/works/10.1002/nzm2.70056"},{"id":"doi:10.1002/nzm2.70056","title":"doi:10.1002/nzm2.70056","url":"https://doi.org/10.1002/nzm2.70056"}],"status":"frontier","summary":"doi:10.1002/nzm2.70056 \"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand\" (CC BY 4.0, published 2026-07-16) reports: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1144-jgs2026-026","kind":"claim","label":"Origin of river terraces by isostatic unloading of the lithosphere","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1144-jgs2026-026"]},"sources":[{"id":"source.frontier.doi-10-1144-jgs2026-026","title":"Crossref record doi:10.1144/jgs2026-026: Origin of river terraces by isostatic unloading of the lithosphere","url":"https://api.crossref.org/works/10.1144/jgs2026-026"},{"id":"doi:10.1144/jgs2026-026","title":"doi:10.1144/jgs2026-026","url":"https://doi.org/10.1144/jgs2026-026"}],"status":"frontier","summary":"doi:10.1144/jgs2026-026 \"Origin of river terraces by isostatic unloading of the lithosphere\" (CC BY 4.0, published 2026-07-15) reports: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70766","kind":"claim","label":"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1111-ejed-70766"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70766","title":"Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes","url":"https://api.crossref.org/works/10.1111/ejed.70766"},{"id":"doi:10.1111/ejed.70766","title":"doi:10.1111/ejed.70766","url":"https://doi.org/10.1111/ejed.70766"}],"status":"frontier","summary":"doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-sce-70090","kind":"claim","label":"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1002-sce-70090"]},"sources":[{"id":"source.frontier.doi-10-1002-sce-70090","title":"Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings","url":"https://api.crossref.org/works/10.1002/sce.70090"},{"id":"doi:10.1002/sce.70090","title":"doi:10.1002/sce.70090","url":"https://doi.org/10.1002/sce.70090"}],"status":"frontier","summary":"doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70053","kind":"claim","label":"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.doi-10-1002-ppp-70053"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70053","title":"Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT","url":"https://api.crossref.org/works/10.1002/ppp.70053"},{"id":"doi:10.1002/ppp.70053","title":"doi:10.1002/ppp.70053","url":"https://doi.org/10.1002/ppp.70053"}],"status":"frontier","summary":"doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ese3-70603","kind":"claim","label":"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.doi-10-1002-ese3-70603"]},"sources":[{"id":"source.frontier.doi-10-1002-ese3-70603","title":"Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law","url":"https://api.crossref.org/works/10.1002/ese3.70603"},{"id":"doi:10.1002/ese3.70603","title":"doi:10.1002/ese3.70603","url":"https://doi.org/10.1002/ese3.70603"}],"status":"frontier","summary":"doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd046190","kind":"claim","label":"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.doi-10-1029-2025jd046190"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd046190","title":"Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event","url":"https://api.crossref.org/works/10.1029/2025jd046190"},{"id":"doi:10.1029/2025jd046190","title":"doi:10.1029/2025jd046190","url":"https://doi.org/10.1029/2025jd046190"}],"status":"frontier","summary":"doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121323","kind":"claim","label":"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.doi-10-1029-2025gl121323"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121323","title":"Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years","url":"https://api.crossref.org/works/10.1029/2025gl121323"},{"id":"doi:10.1029/2025gl121323","title":"doi:10.1029/2025gl121323","url":"https://doi.org/10.1029/2025gl121323"}],"status":"frontier","summary":"doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ijfe-70259","kind":"claim","label":"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-12","source_ids":["source.frontier.doi-10-1002-ijfe-70259"]},"sources":[{"id":"source.frontier.doi-10-1002-ijfe-70259","title":"Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data","url":"https://api.crossref.org/works/10.1002/ijfe.70259"},{"id":"doi:10.1002/ijfe.70259","title":"doi:10.1002/ijfe.70259","url":"https://doi.org/10.1002/ijfe.70259"}],"status":"frontier","summary":"doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000696","kind":"claim","label":"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000696"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000696","title":"Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000696"},{"id":"doi:10.1371/journal.pclm.0000696","title":"doi:10.1371/journal.pclm.0000696","url":"https://doi.org/10.1371/journal.pclm.0000696"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-aphw-70185","kind":"claim","label":"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1111-aphw-70185"]},"sources":[{"id":"source.frontier.doi-10-1111-aphw-70185","title":"Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research","url":"https://api.crossref.org/works/10.1111/aphw.70185"},{"id":"doi:10.1111/aphw.70185","title":"doi:10.1111/aphw.70185","url":"https://doi.org/10.1111/aphw.70185"}],"status":"frontier","summary":"doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jh001250","kind":"claim","label":"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1029-2026jh001250"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jh001250","title":"Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network","url":"https://api.crossref.org/works/10.1029/2026jh001250"},{"id":"doi:10.1029/2026jh001250","title":"doi:10.1029/2026jh001250","url":"https://doi.org/10.1029/2026jh001250"}],"status":"frontier","summary":"doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122518","kind":"claim","label":"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1029-2026gl122518"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122518","title":"Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake","url":"https://api.crossref.org/works/10.1029/2026gl122518"},{"id":"doi:10.1029/2026gl122518","title":"doi:10.1029/2026gl122518","url":"https://doi.org/10.1029/2026gl122518"}],"status":"frontier","summary":"doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e172739","kind":"claim","label":"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e172739"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e172739","title":"Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e172739"},{"id":"doi:10.3897/brics-econ.7.e172739","title":"doi:10.3897/brics-econ.7.e172739","url":"https://doi.org/10.3897/brics-econ.7.e172739"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jmg-70045","kind":"claim","label":"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.doi-10-1111-jmg-70045"]},"sources":[{"id":"source.frontier.doi-10-1111-jmg-70045","title":"Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole","url":"https://api.crossref.org/works/10.1111/jmg.70045"},{"id":"doi:10.1111/jmg.70045","title":"doi:10.1111/jmg.70045","url":"https://doi.org/10.1111/jmg.70045"}],"status":"frontier","summary":"doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70049","kind":"claim","label":"Disposition Model for Permafrost Degradation in Mountainous Regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-05","source_ids":["source.frontier.doi-10-1002-ppp-70049"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70049","title":"Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions","url":"https://api.crossref.org/works/10.1002/ppp.70049"},{"id":"doi:10.1002/ppp.70049","title":"doi:10.1002/ppp.70049","url":"https://doi.org/10.1002/ppp.70049"}],"status":"frontier","summary":"doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e162074","kind":"claim","label":"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-03","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e162074"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e162074","title":"Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e162074"},{"id":"doi:10.3897/brics-econ.7.e162074","title":"doi:10.3897/brics-econ.7.e162074","url":"https://doi.org/10.3897/brics-econ.7.e162074"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70289","kind":"claim","label":"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-03","source_ids":["source.frontier.doi-10-1111-ijal-70289"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70289","title":"Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa","url":"https://api.crossref.org/works/10.1111/ijal.70289"},{"id":"doi:10.1111/ijal.70289","title":"doi:10.1111/ijal.70289","url":"https://doi.org/10.1111/ijal.70289"}],"status":"frontier","summary":"doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wpt-2026-383","kind":"claim","label":"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-01","source_ids":["source.frontier.doi-10-2166-wpt-2026-383"]},"sources":[{"id":"source.frontier.doi-10-2166-wpt-2026-383","title":"Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss","url":"https://api.crossref.org/works/10.2166/wpt.2026.383"},{"id":"doi:10.2166/wpt.2026.383","title":"doi:10.2166/wpt.2026.383","url":"https://doi.org/10.2166/wpt.2026.383"}],"status":"frontier","summary":"doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-359","kind":"claim","label":"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-01","source_ids":["source.frontier.doi-10-2166-wcc-2026-359"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-359","title":"Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change","url":"https://api.crossref.org/works/10.2166/wcc.2026.359"},{"id":"doi:10.2166/wcc.2026.359","title":"doi:10.2166/wcc.2026.359","url":"https://doi.org/10.2166/wcc.2026.359"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-66630-sc-2026-0009","kind":"claim","label":"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-66630-sc-2026-0009"]},"sources":[{"id":"source.frontier.doi-10-66630-sc-2026-0009","title":"Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA","url":"https://api.crossref.org/works/10.66630/sc.2026.0009"},{"id":"doi:10.66630/sc.2026.0009","title":"doi:10.66630/sc.2026.0009","url":"https://doi.org/10.66630/sc.2026.0009"}],"status":"frontier","summary":"doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-59588-2961-3094-1247","kind":"claim","label":"Creative Constructions in Asian and World Englishes - And What They Teach Us","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-59588-2961-3094-1247"]},"sources":[{"id":"source.frontier.doi-10-59588-2961-3094-1247","title":"Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us","url":"https://api.crossref.org/works/10.59588/2961-3094.1247"},{"id":"doi:10.59588/2961-3094.1247","title":"doi:10.59588/2961-3094.1247","url":"https://doi.org/10.59588/2961-3094.1247"}],"status":"frontier","summary":"doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-28918-jei-v11i1-2606","kind":"claim","label":"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-28918-jei-v11i1-2606"]},"sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2606","title":"Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2606"},{"id":"doi:10.28918/jei.v11i1.2606","title":"doi:10.28918/jei.v11i1.2606","url":"https://doi.org/10.28918/jei.v11i1.2606"}],"status":"frontier","summary":"doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-28918-jei-v11i1-2601","kind":"claim","label":"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-28918-jei-v11i1-2601"]},"sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2601","title":"Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2601"},{"id":"doi:10.28918/jei.v11i1.2601","title":"doi:10.28918/jei.v11i1.2601","url":"https://doi.org/10.28918/jei.v11i1.2601"}],"status":"frontier","summary":"doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025wr041875","kind":"claim","label":"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-1029-2025wr041875"]},"sources":[{"id":"source.frontier.doi-10-1029-2025wr041875","title":"Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products","url":"https://api.crossref.org/works/10.1029/2025wr041875"},{"id":"doi:10.1029/2025wr041875","title":"doi:10.1029/2025wr041875","url":"https://doi.org/10.1029/2025wr041875"}],"status":"frontier","summary":"doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-006","kind":"claim","label":"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-2166-wcc-2026-006"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-006","title":"Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia","url":"https://api.crossref.org/works/10.2166/wcc.2026.006"},{"id":"doi:10.2166/wcc.2026.006","title":"doi:10.2166/wcc.2026.006","url":"https://doi.org/10.2166/wcc.2026.006"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jb033060","kind":"claim","label":"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-1029-2025jb033060"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jb033060","title":"Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting","url":"https://api.crossref.org/works/10.1029/2025jb033060"},{"id":"doi:10.1029/2025jb033060","title":"doi:10.1029/2025jb033060","url":"https://doi.org/10.1029/2025jb033060"}],"status":"frontier","summary":"doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025ea004610","kind":"claim","label":"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-1029-2025ea004610"]},"sources":[{"id":"source.frontier.doi-10-1029-2025ea004610","title":"Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals","url":"https://api.crossref.org/works/10.1029/2025ea004610"},{"id":"doi:10.1029/2025ea004610","title":"doi:10.1029/2025ea004610","url":"https://doi.org/10.1029/2025ea004610"}],"status":"frontier","summary":"doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122157","kind":"claim","label":"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-26","source_ids":["source.frontier.doi-10-1029-2026gl122157"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122157","title":"Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel","url":"https://api.crossref.org/works/10.1029/2026gl122157"},{"id":"doi:10.1029/2026gl122157","title":"doi:10.1029/2026gl122157","url":"https://doi.org/10.1029/2026gl122157"}],"status":"frontier","summary":"doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp4-70096","kind":"claim","label":"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-25","source_ids":["source.frontier.doi-10-1002-esp4-70096"]},"sources":[{"id":"source.frontier.doi-10-1002-esp4-70096","title":"Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities","url":"https://api.crossref.org/works/10.1002/esp4.70096"},{"id":"doi:10.1002/esp4.70096","title":"doi:10.1002/esp4.70096","url":"https://doi.org/10.1002/esp4.70096"}],"status":"frontier","summary":"doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-bioe-70124","kind":"claim","label":"The Concept of Harm in Medical Ethics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-24","source_ids":["source.frontier.doi-10-1111-bioe-70124"]},"sources":[{"id":"source.frontier.doi-10-1111-bioe-70124","title":"Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics","url":"https://api.crossref.org/works/10.1111/bioe.70124"},{"id":"doi:10.1111/bioe.70124","title":"doi:10.1111/bioe.70124","url":"https://doi.org/10.1111/bioe.70124"}],"status":"frontier","summary":"doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adom-71396","kind":"claim","label":"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-24","source_ids":["source.frontier.doi-10-1002-adom-71396"]},"sources":[{"id":"source.frontier.doi-10-1002-adom-71396","title":"Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles","url":"https://api.crossref.org/works/10.1002/adom.71396"},{"id":"doi:10.1002/adom.71396","title":"doi:10.1002/adom.71396","url":"https://doi.org/10.1002/adom.71396"}],"status":"frontier","summary":"doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ese3-70586","kind":"claim","label":"Influence of Structural and Environmental Parameters on Solar Air Collector Performance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-23","source_ids":["source.frontier.doi-10-1002-ese3-70586"]},"sources":[{"id":"source.frontier.doi-10-1002-ese3-70586","title":"Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance","url":"https://api.crossref.org/works/10.1002/ese3.70586"},{"id":"doi:10.1002/ese3.70586","title":"doi:10.1002/ese3.70586","url":"https://doi.org/10.1002/ese3.70586"}],"status":"frontier","summary":"doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1144-jgs2026-039","kind":"claim","label":"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-22","source_ids":["source.frontier.doi-10-1144-jgs2026-039"]},"sources":[{"id":"source.frontier.doi-10-1144-jgs2026-039","title":"Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study","url":"https://api.crossref.org/works/10.1144/jgs2026-039"},{"id":"doi:10.1144/jgs2026-039","title":"doi:10.1144/jgs2026-039","url":"https://doi.org/10.1144/jgs2026-039"}],"status":"frontier","summary":"doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-hec-70120","kind":"claim","label":"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-22","source_ids":["source.frontier.doi-10-1002-hec-70120"]},"sources":[{"id":"source.frontier.doi-10-1002-hec-70120","title":"Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight","url":"https://api.crossref.org/works/10.1002/hec.70120"},{"id":"doi:10.1002/hec.70120","title":"doi:10.1002/hec.70120","url":"https://doi.org/10.1002/hec.70120"}],"status":"frontier","summary":"doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9477-70049","kind":"claim","label":"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-21","source_ids":["source.frontier.doi-10-1111-1467-9477-70049"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9477-70049","title":"Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics","url":"https://api.crossref.org/works/10.1111/1467-9477.70049"},{"id":"doi:10.1111/1467-9477.70049","title":"doi:10.1111/1467-9477.70049","url":"https://doi.org/10.1111/1467-9477.70049"}],"status":"frontier","summary":"doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-faam-70045","kind":"claim","label":"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-20","source_ids":["source.frontier.doi-10-1111-faam-70045"]},"sources":[{"id":"source.frontier.doi-10-1111-faam-70045","title":"Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context","url":"https://api.crossref.org/works/10.1111/faam.70045"},{"id":"doi:10.1111/faam.70045","title":"doi:10.1111/faam.70045","url":"https://doi.org/10.1111/faam.70045"}],"status":"frontier","summary":"doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-58491-2735-4202-3413","kind":"claim","label":"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-18","source_ids":["source.frontier.doi-10-58491-2735-4202-3413"]},"sources":[{"id":"source.frontier.doi-10-58491-2735-4202-3413","title":"Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL","url":"https://api.crossref.org/works/10.58491/2735-4202.3413"},{"id":"doi:10.58491/2735-4202.3413","title":"doi:10.58491/2735-4202.3413","url":"https://doi.org/10.58491/2735-4202.3413"}],"status":"frontier","summary":"doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121378","kind":"claim","label":"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-16","source_ids":["source.frontier.doi-10-1029-2025gl121378"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121378","title":"Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed","url":"https://api.crossref.org/works/10.1029/2025gl121378"},{"id":"doi:10.1029/2025gl121378","title":"doi:10.1029/2025gl121378","url":"https://doi.org/10.1029/2025gl121378"}],"status":"frontier","summary":"doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-56403-nejesh-v5i2-421","kind":"claim","label":"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-56403-nejesh-v5i2-421"]},"sources":[{"id":"source.frontier.doi-10-56403-nejesh-v5i2-421","title":"Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe","url":"https://api.crossref.org/works/10.56403/nejesh.v5i2.421"},{"id":"doi:10.56403/nejesh.v5i2.421","title":"doi:10.56403/nejesh.v5i2.421","url":"https://doi.org/10.56403/nejesh.v5i2.421"}],"status":"frontier","summary":"doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl123355","kind":"claim","label":"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-1029-2026gl123355"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl123355","title":"Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary","url":"https://api.crossref.org/works/10.1029/2026gl123355"},{"id":"doi:10.1029/2026gl123355","title":"doi:10.1029/2026gl123355","url":"https://doi.org/10.1029/2026gl123355"}],"status":"frontier","summary":"doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121171","kind":"claim","label":"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-1029-2025gl121171"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121171","title":"Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes","url":"https://api.crossref.org/works/10.1029/2025gl121171"},{"id":"doi:10.1029/2025gl121171","title":"doi:10.1029/2025gl121171","url":"https://doi.org/10.1029/2025gl121171"}],"status":"frontier","summary":"doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd044617","kind":"claim","label":"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-10","source_ids":["source.frontier.doi-10-1029-2025jd044617"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd044617","title":"Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou","url":"https://api.crossref.org/works/10.1029/2025jd044617"},{"id":"doi:10.1029/2025jd044617","title":"doi:10.1029/2025jd044617","url":"https://doi.org/10.1029/2025jd044617"}],"status":"frontier","summary":"doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","kind":"claim","label":"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-08","source_ids":["source.frontier.doi-10-22378-he-2026-11-2-218-234"]},"sources":[{"id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","title":"Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ","url":"https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"},{"id":"doi:10.22378/he.2026-11-2.218-234","title":"doi:10.22378/he.2026-11-2.218-234","url":"https://doi.org/10.22378/he.2026-11-2.218-234"}],"status":"frontier","summary":"doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd045718","kind":"claim","label":"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-06","source_ids":["source.frontier.doi-10-1029-2025jd045718"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd045718","title":"Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season","url":"https://api.crossref.org/works/10.1029/2025jd045718"},{"id":"doi:10.1029/2025jd045718","title":"doi:10.1029/2025jd045718","url":"https://doi.org/10.1029/2025jd045718"}],"status":"frontier","summary":"doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122664","kind":"claim","label":"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-04","source_ids":["source.frontier.doi-10-1029-2026gl122664"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122664","title":"Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum","url":"https://api.crossref.org/works/10.1029/2026gl122664"},{"id":"doi:10.1029/2026gl122664","title":"doi:10.1029/2026gl122664","url":"https://doi.org/10.1029/2026gl122664"}],"status":"frontier","summary":"doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ojoa-70022","kind":"claim","label":"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-03","source_ids":["source.frontier.doi-10-1111-ojoa-70022"]},"sources":[{"id":"source.frontier.doi-10-1111-ojoa-70022","title":"Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES","url":"https://api.crossref.org/works/10.1111/ojoa.70022"},{"id":"doi:10.1111/ojoa.70022","title":"doi:10.1111/ojoa.70022","url":"https://doi.org/10.1111/ojoa.70022"}],"status":"frontier","summary":"doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd045965","kind":"claim","label":"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-02","source_ids":["source.frontier.doi-10-1029-2025jd045965"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd045965","title":"Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S","url":"https://api.crossref.org/works/10.1029/2025jd045965"},{"id":"doi:10.1029/2025jd045965","title":"doi:10.1029/2025jd045965","url":"https://doi.org/10.1029/2025jd045965"}],"status":"frontier","summary":"doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jssr-70066","kind":"claim","label":"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-30","source_ids":["source.frontier.doi-10-1111-jssr-70066"]},"sources":[{"id":"source.frontier.doi-10-1111-jssr-70066","title":"Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans","url":"https://api.crossref.org/works/10.1111/jssr.70066"},{"id":"doi:10.1111/jssr.70066","title":"doi:10.1111/jssr.70066","url":"https://doi.org/10.1111/jssr.70066"}],"status":"frontier","summary":"doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025wr042846","kind":"claim","label":"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-30","source_ids":["source.frontier.doi-10-1029-2025wr042846"]},"sources":[{"id":"source.frontier.doi-10-1029-2025wr042846","title":"Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater","url":"https://api.crossref.org/works/10.1029/2025wr042846"},{"id":"doi:10.1029/2025wr042846","title":"doi:10.1029/2025wr042846","url":"https://doi.org/10.1029/2025wr042846"}],"status":"frontier","summary":"doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-jbgs-e185535","kind":"claim","label":"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-29","source_ids":["source.frontier.doi-10-3897-jbgs-e185535"]},"sources":[{"id":"source.frontier.doi-10-3897-jbgs-e185535","title":"Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us","url":"https://api.crossref.org/works/10.3897/jbgs.e185535"},{"id":"doi:10.3897/jbgs.e185535","title":"doi:10.3897/jbgs.e185535","url":"https://doi.org/10.3897/jbgs.e185535"}],"status":"frontier","summary":"doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp4-70082","kind":"claim","label":"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-29","source_ids":["source.frontier.doi-10-1002-esp4-70082"]},"sources":[{"id":"source.frontier.doi-10-1002-esp4-70082","title":"Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand","url":"https://api.crossref.org/works/10.1002/esp4.70082"},{"id":"doi:10.1002/esp4.70082","title":"doi:10.1002/esp4.70082","url":"https://doi.org/10.1002/esp4.70082"}],"status":"frontier","summary":"doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-184711","kind":"claim","label":"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-28","source_ids":["source.frontier.doi-10-3897-nhcm-3-184711"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-184711","title":"Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ","url":"https://api.crossref.org/works/10.3897/nhcm.3.184711"},{"id":"doi:10.3897/nhcm.3.184711","title":"doi:10.3897/nhcm.3.184711","url":"https://doi.org/10.3897/nhcm.3.184711"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gc012776","kind":"claim","label":"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-28","source_ids":["source.frontier.doi-10-1029-2025gc012776"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gc012776","title":"Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ","url":"https://api.crossref.org/works/10.1029/2025gc012776"},{"id":"doi:10.1029/2025gc012776","title":"doi:10.1029/2025gc012776","url":"https://doi.org/10.1029/2025gc012776"}],"status":"frontier","summary":"doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70436","kind":"claim","label":"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-26","source_ids":["source.frontier.doi-10-1002-joc-70436"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70436","title":"Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process","url":"https://api.crossref.org/works/10.1002/joc.70436"},{"id":"doi:10.1002/joc.70436","title":"doi:10.1002/joc.70436","url":"https://doi.org/10.1002/joc.70436"}],"status":"frontier","summary":"doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-hydro-2026-191","kind":"claim","label":"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-23","source_ids":["source.frontier.doi-10-2166-hydro-2026-191"]},"sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-191","title":"Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation","url":"https://api.crossref.org/works/10.2166/hydro.2026.191"},{"id":"doi:10.2166/hydro.2026.191","title":"doi:10.2166/hydro.2026.191","url":"https://doi.org/10.2166/hydro.2026.191"}],"status":"frontier","summary":"doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ojoa-70020","kind":"claim","label":"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-06","source_ids":["source.frontier.doi-10-1111-ojoa-70020"]},"sources":[{"id":"source.frontier.doi-10-1111-ojoa-70020","title":"Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE","url":"https://api.crossref.org/works/10.1111/ojoa.70020"},{"id":"doi:10.1111/ojoa.70020","title":"doi:10.1111/ojoa.70020","url":"https://doi.org/10.1111/ojoa.70020"}],"status":"frontier","summary":"doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-phpr-70116","kind":"claim","label":"Metaethics and the Functions of Moral Language","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-03","source_ids":["source.frontier.doi-10-1111-phpr-70116"]},"sources":[{"id":"source.frontier.doi-10-1111-phpr-70116","title":"Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language","url":"https://api.crossref.org/works/10.1111/phpr.70116"},{"id":"doi:10.1111/phpr.70116","title":"doi:10.1111/phpr.70116","url":"https://doi.org/10.1111/phpr.70116"}],"status":"frontier","summary":"doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"","tags":["frontier","public-result"]}],"protocol":"fog-atlas-display/1","reviews":[{"author":"historical scientific record","date":"1770s–1790s","id":"review.phlogiston.001","kind":"supersession","result":"failed","summary":"Quantitative combustion chemistry and oxygen theory displaced phlogiston as an explanatory account.","target":"claim.phlogiston"},{"author":"historical epidemiology & microbiology","date":"19th century","id":"review.miasma.001","kind":"counterevidence + replacement","result":"failed","summary":"Transmission evidence and identification of pathogens overturned miasma as a general infectious-disease cause.","target":"claim.miasma"},{"author":"nemesis-smoke","date":"2026-10-06","id":"review.smoke.automate.001","kind":"format_check","result":"neutral","sources":[],"summary":"ok","target":"smoke.automate-merge"},{"author":"worker-3","date":"2026-10-06","id":"review.lambda-cdm.dark-energy.20261006","kind":"evidence_review","result":"challenged-not-invalidated","summary":"DESI DR2 BAO combinations strengthened hints of evolving dark energy, while 2026 DESI Lyman-alpha full-shape results shift toward LambdaCDM; the collaboration says the hints may fade or a more complex model may be required. ([desi.lbl.gov](https://www.desi.lbl.gov/2025/03/19/more-than-a-hint-of-evolving-dark-energy-new-results-and-data-from-desi/?utm_source=chatgpt.com))","target":"physical.lambda-cdm"},{"author":"worker-3","date":"2026-10-06","id":"review.w0wa.dark-energy.20261006","kind":"evidence_review","result":"mixed-support-frontier","summary":"DES Y6 reports a 2.2 sigma deviation from a cosmological constant internally, rising to 3.0 sigma with primary CMB information, while its constant-w fit shows no significant preference over LambdaCDM. ([darkenergysurvey.org](https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/?utm_source=chatgpt.com))","target":"physical.w0wa-cdm"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.qg-entanglement-scope.002","kind":"interpretation_scope","result":"neutral","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"summary":"Entanglement alone is not encoded as uniquely establishing quantized gravity.","target":"evidence.classical-gravity-entanglement-2025"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.single-graviton-scope.002","kind":"interpretation_scope","result":"neutral","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"summary":"Single-graviton signatures are encoded as proposed evidence, not an achieved detection.","target":"concept.single-graviton-signature"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.qg-liv-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"summary":"Timing limits constrain specific dispersive models only.","target":"evidence.qg-liv-constraint-2013"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.wimp-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"summary":"Null result constrains tested WIMP parameter space without eliminating dark matter.","target":"evidence.xenonnt-null-2025"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.lz-event-scope.002","kind":"significance_scope","result":"neutral","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"summary":"The recoil-like event is not encoded as a dark-matter discovery; reported global significance remains limited.","target":"evidence.lz-high-energy-event-2026"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.axion-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"summary":"ADMX exclusion is bounded to the cited mass range and assumptions.","target":"evidence.admx-dfsz-exclusion"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.pbh-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"summary":"Microlensing limits cover only the tested PBH mass-abundance region.","target":"evidence.ogle-pbh-constraint"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.fuzzy-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"summary":"Fuzzy-DM bounds depend on astrophysical and thermal-history assumptions.","target":"evidence.fuzzy-dm-lyman-alpha-limit"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.qg-entanglement-scope","kind":"interpretation_scope","result":"neutral","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"summary":"Entanglement alone is not encoded as uniquely proving quantized gravity; scaling remains a candidate discriminator.","target":"evidence.classical-gravity-entanglement-2025"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.wimp-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"summary":"Null excess constrains tested WIMP parameter space and does not eliminate dark matter generally.","target":"evidence.xenonnt-null-2025"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.lz-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"summary":"LZ null result narrows modeled WIMP interactions without resolving dark-matter identity.","target":"evidence.lz-null-2024"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.axion-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"summary":"ADMX exclusion applies to the cited mass range and density assumptions, not all axion parameter space.","target":"evidence.admx-dfsz-exclusion"}],"schema_version":1,"taxonomy":[{"child":"concept.aat.300015650","id":"taxonomy.aat.concept.aat.300015650.concept.aat.300015649","parent":"concept.aat.300015649","type":"narrower"},{"child":"concept.aat.300015667","id":"taxonomy.aat.concept.aat.300015667.concept.aat.300015649","parent":"concept.aat.300015649","type":"narrower"},{"child":"concept.aat.300015692","id":"taxonomy.aat.concept.aat.300015692.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015702","id":"taxonomy.aat.concept.aat.300015702.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015723","id":"taxonomy.aat.concept.aat.300015723.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015727","id":"taxonomy.aat.concept.aat.300015727.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015759","id":"taxonomy.aat.concept.aat.300015759.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300016598","id":"taxonomy.aat.concept.aat.300016598.concept.aat.300108572","parent":"concept.aat.300108572","type":"narrower"},{"child":"concept.aat.300016600","id":"taxonomy.aat.concept.aat.300016600.concept.aat.300108572","parent":"concept.aat.300108572","type":"narrower"},{"child":"concept.aat.300017437","id":"taxonomy.aat.concept.aat.300017437.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300018115","id":"taxonomy.aat.concept.aat.300018115.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300018704","id":"taxonomy.aat.concept.aat.300018704.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019088","id":"taxonomy.aat.concept.aat.300019088.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019104","id":"taxonomy.aat.concept.aat.300019104.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019258","id":"taxonomy.aat.concept.aat.300019258.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019264","id":"taxonomy.aat.concept.aat.300019264.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019267","id":"taxonomy.aat.concept.aat.300019267.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019273","id":"taxonomy.aat.concept.aat.300019273.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300019275","id":"taxonomy.aat.concept.aat.300019275.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300019276","id":"taxonomy.aat.concept.aat.300019276.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019277","id":"taxonomy.aat.concept.aat.300019277.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019278","id":"taxonomy.aat.concept.aat.300019278.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019279","id":"taxonomy.aat.concept.aat.300019279.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300021861","id":"taxonomy.aat.concept.aat.300021861.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300021867","id":"taxonomy.aat.concept.aat.300021867.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300021944","id":"taxonomy.aat.concept.aat.300021944.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300054236","id":"taxonomy.aat.concept.aat.300054236.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300054272","id":"taxonomy.aat.concept.aat.300054272.field.aat.300112920","parent":"field.aat.300112920","type":"narrower"},{"child":"concept.aat.300054274","id":"taxonomy.aat.concept.aat.300054274.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"concept.aat.300054672","id":"taxonomy.aat.concept.aat.300054672.field.aat.300054275","parent":"field.aat.300054275","type":"narrower"},{"child":"concept.aat.300055156","id":"taxonomy.aat.concept.aat.300055156.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055826","id":"taxonomy.aat.concept.aat.300055826.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055829","id":"taxonomy.aat.concept.aat.300055829.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055837","id":"taxonomy.aat.concept.aat.300055837.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055845","id":"taxonomy.aat.concept.aat.300055845.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055945","id":"taxonomy.aat.concept.aat.300055945.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300055946","id":"taxonomy.aat.concept.aat.300055946.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300055947","id":"taxonomy.aat.concept.aat.300055947.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300055963","id":"taxonomy.aat.concept.aat.300055963.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055970","id":"taxonomy.aat.concept.aat.300055970.concept.aat.300055969","parent":"concept.aat.300055969","type":"narrower"},{"child":"concept.aat.300055982","id":"taxonomy.aat.concept.aat.300055982.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300055983","id":"taxonomy.aat.concept.aat.300055983.concept.aat.300056005","parent":"concept.aat.300056005","type":"narrower"},{"child":"concept.aat.300055988","id":"taxonomy.aat.concept.aat.300055988.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055989","id":"taxonomy.aat.concept.aat.300055989.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055990","id":"taxonomy.aat.concept.aat.300055990.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055991","id":"taxonomy.aat.concept.aat.300055991.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300055992","id":"taxonomy.aat.concept.aat.300055992.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055993","id":"taxonomy.aat.concept.aat.300055993.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055995","id":"taxonomy.aat.concept.aat.300055995.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055996","id":"taxonomy.aat.concept.aat.300055996.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055997","id":"taxonomy.aat.concept.aat.300055997.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055998","id":"taxonomy.aat.concept.aat.300055998.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055999","id":"taxonomy.aat.concept.aat.300055999.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056000","id":"taxonomy.aat.concept.aat.300056000.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056002","id":"taxonomy.aat.concept.aat.300056002.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056003","id":"taxonomy.aat.concept.aat.300056003.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300056004","id":"taxonomy.aat.concept.aat.300056004.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300056005","id":"taxonomy.aat.concept.aat.300056005.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300056180","id":"taxonomy.aat.concept.aat.300056180.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300056183","id":"taxonomy.aat.concept.aat.300056183.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300065709","id":"taxonomy.aat.concept.aat.300065709.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300066049","id":"taxonomy.aat.concept.aat.300066049.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300067974","id":"taxonomy.aat.concept.aat.300067974.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300068765","id":"taxonomy.aat.concept.aat.300068765.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300069306","id":"taxonomy.aat.concept.aat.300069306.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300072604","id":"taxonomy.aat.concept.aat.300072604.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300073437","id":"taxonomy.aat.concept.aat.300073437.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300080819","id":"taxonomy.aat.concept.aat.300080819.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300106724","id":"taxonomy.aat.concept.aat.300106724.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300106738","id":"taxonomy.aat.concept.aat.300106738.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106739","id":"taxonomy.aat.concept.aat.300106739.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106745","id":"taxonomy.aat.concept.aat.300106745.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106747","id":"taxonomy.aat.concept.aat.300106747.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300106757","id":"taxonomy.aat.concept.aat.300106757.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300106759","id":"taxonomy.aat.concept.aat.300106759.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300107946","id":"taxonomy.aat.concept.aat.300107946.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300111149","id":"taxonomy.aat.concept.aat.300111149.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300111241","id":"taxonomy.aat.concept.aat.300111241.concept.aat.300021516","parent":"concept.aat.300021516","type":"narrower"},{"child":"concept.aat.300120146","id":"taxonomy.aat.concept.aat.300120146.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300124083","id":"taxonomy.aat.concept.aat.300124083.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300143325","id":"taxonomy.aat.concept.aat.300143325.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300145975","id":"taxonomy.aat.concept.aat.300145975.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300179281","id":"taxonomy.aat.concept.aat.300179281.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300179426","id":"taxonomy.aat.concept.aat.300179426.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300179462","id":"taxonomy.aat.concept.aat.300179462.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300185658","id":"taxonomy.aat.concept.aat.300185658.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300193867","id":"taxonomy.aat.concept.aat.300193867.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300237780","id":"taxonomy.aat.concept.aat.300237780.concept.aat.300179462","parent":"concept.aat.300179462","type":"narrower"},{"child":"concept.aat.300240013","id":"taxonomy.aat.concept.aat.300240013.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300247349","id":"taxonomy.aat.concept.aat.300247349.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300257052","id":"taxonomy.aat.concept.aat.300257052.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300262589","id":"taxonomy.aat.concept.aat.300262589.concept.aat.300262588","parent":"concept.aat.300262588","type":"narrower"},{"child":"concept.aat.300263186","id":"taxonomy.aat.concept.aat.300263186.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264303","id":"taxonomy.aat.concept.aat.300264303.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264304","id":"taxonomy.aat.concept.aat.300264304.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264305","id":"taxonomy.aat.concept.aat.300264305.concept.aat.300264530","parent":"concept.aat.300264530","type":"narrower"},{"child":"concept.aat.300264310","id":"taxonomy.aat.concept.aat.300264310.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264321","id":"taxonomy.aat.concept.aat.300264321.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264322","id":"taxonomy.aat.concept.aat.300264322.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300264335","id":"taxonomy.aat.concept.aat.300264335.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264336","id":"taxonomy.aat.concept.aat.300264336.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264338","id":"taxonomy.aat.concept.aat.300264338.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264356","id":"taxonomy.aat.concept.aat.300264356.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264359","id":"taxonomy.aat.concept.aat.300264359.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264365","id":"taxonomy.aat.concept.aat.300264365.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264384","id":"taxonomy.aat.concept.aat.300264384.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264385","id":"taxonomy.aat.concept.aat.300264385.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264386","id":"taxonomy.aat.concept.aat.300264386.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264429","id":"taxonomy.aat.concept.aat.300264429.concept.aat.300021516","parent":"concept.aat.300021516","type":"narrower"},{"child":"concept.aat.300264475","id":"taxonomy.aat.concept.aat.300264475.concept.aat.300257052","parent":"concept.aat.300257052","type":"narrower"},{"child":"concept.aat.300264482","id":"taxonomy.aat.concept.aat.300264482.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300264486","id":"taxonomy.aat.concept.aat.300264486.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264504","id":"taxonomy.aat.concept.aat.300264504.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300264527","id":"taxonomy.aat.concept.aat.300264527.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264528","id":"taxonomy.aat.concept.aat.300264528.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264529","id":"taxonomy.aat.concept.aat.300264529.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264530","id":"taxonomy.aat.concept.aat.300264530.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264773","id":"taxonomy.aat.concept.aat.300264773.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300264775","id":"taxonomy.aat.concept.aat.300264775.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300265781","id":"taxonomy.aat.concept.aat.300265781.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300265797","id":"taxonomy.aat.concept.aat.300265797.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300266052","id":"taxonomy.aat.concept.aat.300266052.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300266055","id":"taxonomy.aat.concept.aat.300266055.concept.aat.300266054","parent":"concept.aat.300266054","type":"narrower"},{"child":"concept.aat.300266058","id":"taxonomy.aat.concept.aat.300266058.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300266399","id":"taxonomy.aat.concept.aat.300266399.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300266783","id":"taxonomy.aat.concept.aat.300266783.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300310095","id":"taxonomy.aat.concept.aat.300310095.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300310716","id":"taxonomy.aat.concept.aat.300310716.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300310717","id":"taxonomy.aat.concept.aat.300310717.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300310718","id":"taxonomy.aat.concept.aat.300310718.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300310748","id":"taxonomy.aat.concept.aat.300310748.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300379068","id":"taxonomy.aat.concept.aat.300379068.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379085","id":"taxonomy.aat.concept.aat.300379085.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300379123","id":"taxonomy.aat.concept.aat.300379123.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379137","id":"taxonomy.aat.concept.aat.300379137.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300379723","id":"taxonomy.aat.concept.aat.300379723.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379822","id":"taxonomy.aat.concept.aat.300379822.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300379854","id":"taxonomy.aat.concept.aat.300379854.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300380145","id":"taxonomy.aat.concept.aat.300380145.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300380150","id":"taxonomy.aat.concept.aat.300380150.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300386039","id":"taxonomy.aat.concept.aat.300386039.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300386130","id":"taxonomy.aat.concept.aat.300386130.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300386138","id":"taxonomy.aat.concept.aat.300386138.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300386148","id":"taxonomy.aat.concept.aat.300386148.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300387114","id":"taxonomy.aat.concept.aat.300387114.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300387753","id":"taxonomy.aat.concept.aat.300387753.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300391196","id":"taxonomy.aat.concept.aat.300391196.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300391434","id":"taxonomy.aat.concept.aat.300391434.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300391479","id":"taxonomy.aat.concept.aat.300391479.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300393171","id":"taxonomy.aat.concept.aat.300393171.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300395490","id":"taxonomy.aat.concept.aat.300395490.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300403938","id":"taxonomy.aat.concept.aat.300403938.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300403945","id":"taxonomy.aat.concept.aat.300403945.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300403979","id":"taxonomy.aat.concept.aat.300403979.concept.aat.300417578","parent":"concept.aat.300417578","type":"narrower"},{"child":"concept.aat.300404618","id":"taxonomy.aat.concept.aat.300404618.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404619","id":"taxonomy.aat.concept.aat.300404619.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404702","id":"taxonomy.aat.concept.aat.300404702.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404706","id":"taxonomy.aat.concept.aat.300404706.concept.aat.300264486","parent":"concept.aat.300264486","type":"narrower"},{"child":"concept.aat.300404712","id":"taxonomy.aat.concept.aat.300404712.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404756","id":"taxonomy.aat.concept.aat.300404756.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300410257","id":"taxonomy.aat.concept.aat.300410257.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300410285","id":"taxonomy.aat.concept.aat.300410285.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300410287","id":"taxonomy.aat.concept.aat.300410287.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300410316","id":"taxonomy.aat.concept.aat.300410316.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412040","id":"taxonomy.aat.concept.aat.300412040.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412041","id":"taxonomy.aat.concept.aat.300412041.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412084","id":"taxonomy.aat.concept.aat.300412084.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300412108","id":"taxonomy.aat.concept.aat.300412108.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300412116","id":"taxonomy.aat.concept.aat.300412116.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412128","id":"taxonomy.aat.concept.aat.300412128.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412140","id":"taxonomy.aat.concept.aat.300412140.concept.aat.300410316","parent":"concept.aat.300410316","type":"narrower"},{"child":"concept.aat.300412141","id":"taxonomy.aat.concept.aat.300412141.concept.aat.300410316","parent":"concept.aat.300410316","type":"narrower"},{"child":"concept.aat.300417271","id":"taxonomy.aat.concept.aat.300417271.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300417325","id":"taxonomy.aat.concept.aat.300417325.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300417426","id":"taxonomy.aat.concept.aat.300417426.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300435308","id":"taxonomy.aat.concept.aat.300435308.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300435319","id":"taxonomy.aat.concept.aat.300435319.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300438472","id":"taxonomy.aat.concept.aat.300438472.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300438552","id":"taxonomy.aat.concept.aat.300438552.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300438813","id":"taxonomy.aat.concept.aat.300438813.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300444302","id":"taxonomy.aat.concept.aat.300444302.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300444313","id":"taxonomy.aat.concept.aat.300444313.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300444994","id":"taxonomy.aat.concept.aat.300444994.concept.aat.300266481","parent":"concept.aat.300266481","type":"narrower"},{"child":"concept.aat.300446915","id":"taxonomy.aat.concept.aat.300446915.concept.aat.300264530","parent":"concept.aat.300264530","type":"narrower"},{"child":"concept.aat.300447407","id":"taxonomy.aat.concept.aat.300447407.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300449137","id":"taxonomy.aat.concept.aat.300449137.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300451043","id":"taxonomy.aat.concept.aat.300451043.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300451359","id":"taxonomy.aat.concept.aat.300451359.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300451673","id":"taxonomy.aat.concept.aat.300451673.concept.aat.300417616","parent":"concept.aat.300417616","type":"narrower"},{"child":"concept.aat.300457703","id":"taxonomy.aat.concept.aat.300457703.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457715","id":"taxonomy.aat.concept.aat.300457715.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457738","id":"taxonomy.aat.concept.aat.300457738.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457805","id":"taxonomy.aat.concept.aat.300457805.concept.aat.300056005","parent":"concept.aat.300056005","type":"narrower"},{"child":"concept.aat.300458684","id":"taxonomy.aat.concept.aat.300458684.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458696","id":"taxonomy.aat.concept.aat.300458696.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458697","id":"taxonomy.aat.concept.aat.300458697.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458718","id":"taxonomy.aat.concept.aat.300458718.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458936","id":"taxonomy.aat.concept.aat.300458936.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458937","id":"taxonomy.aat.concept.aat.300458937.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458939","id":"taxonomy.aat.concept.aat.300458939.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458945","id":"taxonomy.aat.concept.aat.300458945.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458946","id":"taxonomy.aat.concept.aat.300458946.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"field.aat.300054162","id":"taxonomy.aat.field.aat.300054162.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054233","id":"taxonomy.aat.field.aat.300054233.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054240","id":"taxonomy.aat.field.aat.300054240.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054241","id":"taxonomy.aat.field.aat.300054241.field.aat.300054240","parent":"field.aat.300054240","type":"narrower"},{"child":"field.aat.300054247","id":"taxonomy.aat.field.aat.300054247.field.aat.300054245","parent":"field.aat.300054245","type":"narrower"},{"child":"field.aat.300054248","id":"taxonomy.aat.field.aat.300054248.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054250","id":"taxonomy.aat.field.aat.300054250.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054251","id":"taxonomy.aat.field.aat.300054251.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054254","id":"taxonomy.aat.field.aat.300054254.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300054255","id":"taxonomy.aat.field.aat.300054255.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054256","id":"taxonomy.aat.field.aat.300054256.field.aat.300054245","parent":"field.aat.300054245","type":"narrower"},{"child":"field.aat.300054257","id":"taxonomy.aat.field.aat.300054257.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054258","id":"taxonomy.aat.field.aat.300054258.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054262","id":"taxonomy.aat.field.aat.300054262.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054263","id":"taxonomy.aat.field.aat.300054263.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054264","id":"taxonomy.aat.field.aat.300054264.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054268","id":"taxonomy.aat.field.aat.300054268.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054307","id":"taxonomy.aat.field.aat.300054307.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054308","id":"taxonomy.aat.field.aat.300054308.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054309","id":"taxonomy.aat.field.aat.300054309.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054310","id":"taxonomy.aat.field.aat.300054310.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054311","id":"taxonomy.aat.field.aat.300054311.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054312","id":"taxonomy.aat.field.aat.300054312.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300055987","id":"taxonomy.aat.field.aat.300055987.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"field.aat.300069325","id":"taxonomy.aat.field.aat.300069325.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300080402","id":"taxonomy.aat.field.aat.300080402.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300112920","id":"taxonomy.aat.field.aat.300112920.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300168233","id":"taxonomy.aat.field.aat.300168233.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300174160","id":"taxonomy.aat.field.aat.300174160.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300174173","id":"taxonomy.aat.field.aat.300174173.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300205021","id":"taxonomy.aat.field.aat.300205021.field.aat.300054240","parent":"field.aat.300054240","type":"narrower"},{"child":"field.aat.300258340","id":"taxonomy.aat.field.aat.300258340.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"field.aat.300379540","id":"taxonomy.aat.field.aat.300379540.field.aat.300054233","parent":"field.aat.300054233","type":"narrower"},{"child":"field.aat.300387576","id":"taxonomy.aat.field.aat.300387576.field.aat.300054275","parent":"field.aat.300054275","type":"narrower"},{"child":"field.aat.300389757","id":"taxonomy.aat.field.aat.300389757.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300389758","id":"taxonomy.aat.field.aat.300389758.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"claim.des-y6-weak-evolving-dark-energy-preference-reported","id":"taxonomy.claim.des-y6-weak-evolving-dark-energy-preference-reported.narrower.field.cosmology","parent":"field.cosmology","type":"narrower"},{"child":"claim.fermi-gbm-detection-coverage","id":"taxonomy.claim.fermi-gbm-detection-coverage.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"concept.nist.abtree","id":"taxonomy.concept.nist.abtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.activedatastruc","id":"taxonomy.concept.nist.activedatastruc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.adaptkdtree","id":"taxonomy.concept.nist.adaptkdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.adjacencylistrep","id":"taxonomy.concept.nist.adjacencylistrep.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.array","id":"taxonomy.concept.nist.array.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.assocarray","id":"taxonomy.concept.nist.assocarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.avltree","id":"taxonomy.concept.nist.avltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bag","id":"taxonomy.concept.nist.bag.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedbist","id":"taxonomy.concept.nist.balancedbist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedbitr","id":"taxonomy.concept.nist.balancedbitr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedtree","id":"taxonomy.concept.nist.balancedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bangfile","id":"taxonomy.concept.nist.bangfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bbalphatree","id":"taxonomy.concept.nist.bbalphatree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bdd","id":"taxonomy.concept.nist.bdd.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bdtree","id":"taxonomy.concept.nist.bdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binaryheap","id":"taxonomy.concept.nist.binaryheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarypriorityqueue","id":"taxonomy.concept.nist.binarypriorityqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarysearchtree","id":"taxonomy.concept.nist.binarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarytree","id":"taxonomy.concept.nist.binarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binomialheap","id":"taxonomy.concept.nist.binomialheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bintree","id":"taxonomy.concept.nist.bintree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bitvector","id":"taxonomy.concept.nist.bitvector.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.blindtrie","id":"taxonomy.concept.nist.blindtrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.blockaddressingindex","id":"taxonomy.concept.nist.blockaddressingindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bloomfilter","id":"taxonomy.concept.nist.bloomfilter.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.boundedqueue","id":"taxonomy.concept.nist.boundedqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.boundedstack","id":"taxonomy.concept.nist.boundedstack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bsptree","id":"taxonomy.concept.nist.bsptree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bstartree","id":"taxonomy.concept.nist.bstartree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.btree","id":"taxonomy.concept.nist.btree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.buckettrie","id":"taxonomy.concept.nist.buckettrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.buddytree","id":"taxonomy.concept.nist.buddytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bvtree","id":"taxonomy.concept.nist.bvtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.cactusstack","id":"taxonomy.concept.nist.cactusstack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.calendarqueue","id":"taxonomy.concept.nist.calendarqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.celltree","id":"taxonomy.concept.nist.celltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.chaining","id":"taxonomy.concept.nist.chaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.circularlist","id":"taxonomy.concept.nist.circularlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.circularqueue","id":"taxonomy.concept.nist.circularqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.coalescedchaining","id":"taxonomy.concept.nist.coalescedchaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.codingtree","id":"taxonomy.concept.nist.codingtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.compactdawg","id":"taxonomy.concept.nist.compactdawg.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.compacttrie","id":"taxonomy.concept.nist.compacttrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completebinarytree","id":"taxonomy.concept.nist.completebinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completetree","id":"taxonomy.concept.nist.completetree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.cuckoohashing","id":"taxonomy.concept.nist.cuckoohashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.deque","id":"taxonomy.concept.nist.deque.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dictionary","id":"taxonomy.concept.nist.dictionary.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.digitalsearchtree","id":"taxonomy.concept.nist.digitalsearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.digitaltree","id":"taxonomy.concept.nist.digitaltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directchaining","id":"taxonomy.concept.nist.directchaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directedacyclicwordgraph","id":"taxonomy.concept.nist.directedacyclicwordgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directedgraph","id":"taxonomy.concept.nist.directedgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.discretintrv","id":"taxonomy.concept.nist.discretintrv.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.doubleendpq","id":"taxonomy.concept.nist.doubleendpq.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.doublylinkedlist","id":"taxonomy.concept.nist.doublylinkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dtree","id":"taxonomy.concept.nist.dtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dynamicarray","id":"taxonomy.concept.nist.dynamicarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dynamichashing","id":"taxonomy.concept.nist.dynamichashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.elasticbuckettrie","id":"taxonomy.concept.nist.elasticbuckettrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.excell","id":"taxonomy.concept.nist.excell.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendedbinarytree","id":"taxonomy.concept.nist.extendedbinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendiblehashing","id":"taxonomy.concept.nist.extendiblehashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendkdtree","id":"taxonomy.concept.nist.extendkdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.externalindx","id":"taxonomy.concept.nist.externalindx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.externalmemorydatastr","id":"taxonomy.concept.nist.externalmemorydatastr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fibonacciheap","id":"taxonomy.concept.nist.fibonacciheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fibonaccitree","id":"taxonomy.concept.nist.fibonaccitree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.finitarytree","id":"taxonomy.concept.nist.finitarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.forwardindex","id":"taxonomy.concept.nist.forwardindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fullbinarytree","id":"taxonomy.concept.nist.fullbinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fullinvertedindex","id":"taxonomy.concept.nist.fullinvertedindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.gbdtree","id":"taxonomy.concept.nist.gbdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.graph","id":"taxonomy.concept.nist.graph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.gridfile","id":"taxonomy.concept.nist.gridfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashbelt","id":"taxonomy.concept.nist.hashbelt.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashheap","id":"taxonomy.concept.nist.hashheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashtab","id":"taxonomy.concept.nist.hashtab.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hbtree","id":"taxonomy.concept.nist.hbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heap","id":"taxonomy.concept.nist.heap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heightbalancedbinsrchtree","id":"taxonomy.concept.nist.heightbalancedbinsrchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heightbalancedtree","id":"taxonomy.concept.nist.heightbalancedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.indexfile","id":"taxonomy.concept.nist.indexfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.inversesuffixarray","id":"taxonomy.concept.nist.inversesuffixarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.inversionlist","id":"taxonomy.concept.nist.inversionlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertedfileindex","id":"taxonomy.concept.nist.invertedfileindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertedindex","id":"taxonomy.concept.nist.invertedindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertiblebloomtable","id":"taxonomy.concept.nist.invertiblebloomtable.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.jellyfish","id":"taxonomy.concept.nist.jellyfish.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.k2tree","id":"taxonomy.concept.nist.k2tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.karyheap","id":"taxonomy.concept.nist.karyheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.karytree","id":"taxonomy.concept.nist.karytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.kdbtree","id":"taxonomy.concept.nist.kdbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.kdtree","id":"taxonomy.concept.nist.kdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.leftisttree","id":"taxonomy.concept.nist.leftisttree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linearprobng","id":"taxonomy.concept.nist.linearprobng.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linearquadtr","id":"taxonomy.concept.nist.linearquadtr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linkeddatasignature","id":"taxonomy.concept.nist.linkeddatasignature.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linkedlist","id":"taxonomy.concept.nist.linkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.list","id":"taxonomy.concept.nist.list.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.lowertriangularmatrix","id":"taxonomy.concept.nist.lowertriangularmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.markovchain","id":"taxonomy.concept.nist.markovchain.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.matrix","id":"taxonomy.concept.nist.matrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.merkletree","id":"taxonomy.concept.nist.merkletree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.monotonprioq","id":"taxonomy.concept.nist.monotonprioq.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multigraph","id":"taxonomy.concept.nist.multigraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multilaygrd","id":"taxonomy.concept.nist.multilaygrd.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multisuffixtree","id":"taxonomy.concept.nist.multisuffixtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multiwaytree","id":"taxonomy.concept.nist.multiwaytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.octree","id":"taxonomy.concept.nist.octree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedarry","id":"taxonomy.concept.nist.orderedarry.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedlinkedlist","id":"taxonomy.concept.nist.orderedlinkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedtree","id":"taxonomy.concept.nist.orderedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orthogonallists","id":"taxonomy.concept.nist.orthogonallists.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.pagoda","id":"taxonomy.concept.nist.pagoda.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.passivedatastruc","id":"taxonomy.concept.nist.passivedatastruc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.pile","id":"taxonomy.concept.nist.pile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.plophashing","id":"taxonomy.concept.nist.plophashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.priorityque","id":"taxonomy.concept.nist.priorityque.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ptree","id":"taxonomy.concept.nist.ptree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.quadtrie","id":"taxonomy.concept.nist.quadtrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.queue","id":"taxonomy.concept.nist.queue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.raggedmatrix","id":"taxonomy.concept.nist.raggedmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.randomizedbinarysearchtree","id":"taxonomy.concept.nist.randomizedbinarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rectangmatrx","id":"taxonomy.concept.nist.rectangmatrx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.recursive","id":"taxonomy.concept.nist.recursive.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.redblack","id":"taxonomy.concept.nist.redblack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.relational","id":"taxonomy.concept.nist.relational.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rfile","id":"taxonomy.concept.nist.rfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rightthreadedtree","id":"taxonomy.concept.nist.rightthreadedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rtree","id":"taxonomy.concept.nist.rtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sbbtree","id":"taxonomy.concept.nist.sbbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.searchtree","id":"taxonomy.concept.nist.searchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.selforganizinglist","id":"taxonomy.concept.nist.selforganizinglist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.separatechaining","id":"taxonomy.concept.nist.separatechaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.set","id":"taxonomy.concept.nist.set.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.shadowheap","id":"taxonomy.concept.nist.shadowheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.skdtree","id":"taxonomy.concept.nist.skdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.skiplist","id":"taxonomy.concept.nist.skiplist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sortedarray","id":"taxonomy.concept.nist.sortedarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sortedlist","id":"taxonomy.concept.nist.sortedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sparsematrix","id":"taxonomy.concept.nist.sparsematrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.splaytree","id":"taxonomy.concept.nist.splaytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.squarematrix","id":"taxonomy.concept.nist.squarematrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sstable","id":"taxonomy.concept.nist.sstable.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.stack","id":"taxonomy.concept.nist.stack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.stdigraph","id":"taxonomy.concept.nist.stdigraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.strictlylowertriangmat","id":"taxonomy.concept.nist.strictlylowertriangmat.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.strictlyuppertriangmat","id":"taxonomy.concept.nist.strictlyuppertriangmat.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.string","id":"taxonomy.concept.nist.string.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.suffixarray","id":"taxonomy.concept.nist.suffixarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.suffixtree","id":"taxonomy.concept.nist.suffixtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ternarysearchtree","id":"taxonomy.concept.nist.ternarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.threadedtree","id":"taxonomy.concept.nist.threadedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.treap","id":"taxonomy.concept.nist.treap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.tree","id":"taxonomy.concept.nist.tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.trie","id":"taxonomy.concept.nist.trie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.twingridfl","id":"taxonomy.concept.nist.twingridfl.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.two34tree","id":"taxonomy.concept.nist.two34tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.two3tree","id":"taxonomy.concept.nist.two3tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.twolevgrid","id":"taxonomy.concept.nist.twolevgrid.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ubtree","id":"taxonomy.concept.nist.ubtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.undirectedgraph","id":"taxonomy.concept.nist.undirectedgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.uniformmatrx","id":"taxonomy.concept.nist.uniformmatrx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.unlimitedbranchingtree","id":"taxonomy.concept.nist.unlimitedbranchingtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.uppertriangularmatrix","id":"taxonomy.concept.nist.uppertriangularmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.vanemdeboas","id":"taxonomy.concept.nist.vanemdeboas.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.weakheap","id":"taxonomy.concept.nist.weakheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.zipper","id":"taxonomy.concept.nist.zipper.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"field.quantum-gravity","id":"taxonomy.field.quantum-gravity.narrower.field.physics","parent":"field.physics","type":"narrower"},{"child":"claim.frontier.arxiv-2607-26287","id":"taxonomy.frontier.claim.frontier.arxiv-2607-26287.concept.mesh.d000098407","parent":"concept.mesh.d000098407","type":"narrower"},{"child":"concept.go.go0000128","id":"taxonomy.go.concept.go.go0000128.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0000752","id":"taxonomy.go.concept.go.go0000752.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0000785","id":"taxonomy.go.concept.go.go0000785.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0000920","id":"taxonomy.go.concept.go.go0000920.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001400","id":"taxonomy.go.concept.go.go0001400.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001503","id":"taxonomy.go.concept.go.go0001503.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001650","id":"taxonomy.go.concept.go.go0001650.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001651","id":"taxonomy.go.concept.go.go0001651.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001652","id":"taxonomy.go.concept.go.go0001652.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001750","id":"taxonomy.go.concept.go.go0001750.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001763","id":"taxonomy.go.concept.go.go0001763.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001772","id":"taxonomy.go.concept.go.go0001772.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001775","id":"taxonomy.go.concept.go.go0001775.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001776","id":"taxonomy.go.concept.go.go0001776.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0001816","id":"taxonomy.go.concept.go.go0001816.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001891","id":"taxonomy.go.concept.go.go0001891.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001906","id":"taxonomy.go.concept.go.go0001906.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001917","id":"taxonomy.go.concept.go.go0001917.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0002200","id":"taxonomy.go.concept.go.go0002200.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002252","id":"taxonomy.go.concept.go.go0002252.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002253","id":"taxonomy.go.concept.go.go0002253.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002262","id":"taxonomy.go.concept.go.go0002262.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002339","id":"taxonomy.go.concept.go.go0002339.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002404","id":"taxonomy.go.concept.go.go0002404.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002440","id":"taxonomy.go.concept.go.go0002440.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002507","id":"taxonomy.go.concept.go.go0002507.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002520","id":"taxonomy.go.concept.go.go0002520.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002532","id":"taxonomy.go.concept.go.go0002532.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0003006","id":"taxonomy.go.concept.go.go0003006.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0003008","id":"taxonomy.go.concept.go.go0003008.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0005576","id":"taxonomy.go.concept.go.go0005576.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005630","id":"taxonomy.go.concept.go.go0005630.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005631","id":"taxonomy.go.concept.go.go0005631.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005652","id":"taxonomy.go.concept.go.go0005652.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005654","id":"taxonomy.go.concept.go.go0005654.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005825","id":"taxonomy.go.concept.go.go0005825.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005829","id":"taxonomy.go.concept.go.go0005829.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0006276","id":"taxonomy.go.concept.go.go0006276.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0006457","id":"taxonomy.go.concept.go.go0006457.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0006515","id":"taxonomy.go.concept.go.go0006515.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007017","id":"taxonomy.go.concept.go.go0007017.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007049","id":"taxonomy.go.concept.go.go0007049.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007117","id":"taxonomy.go.concept.go.go0007117.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0007154","id":"taxonomy.go.concept.go.go0007154.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007155","id":"taxonomy.go.concept.go.go0007155.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007165","id":"taxonomy.go.concept.go.go0007165.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007272","id":"taxonomy.go.concept.go.go0007272.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007275","id":"taxonomy.go.concept.go.go0007275.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007340","id":"taxonomy.go.concept.go.go0007340.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0007389","id":"taxonomy.go.concept.go.go0007389.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007566","id":"taxonomy.go.concept.go.go0007566.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0007586","id":"taxonomy.go.concept.go.go0007586.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007623","id":"taxonomy.go.concept.go.go0007623.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0007624","id":"taxonomy.go.concept.go.go0007624.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0008037","id":"taxonomy.go.concept.go.go0008037.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008152","id":"taxonomy.go.concept.go.go0008152.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008219","id":"taxonomy.go.concept.go.go0008219.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008283","id":"taxonomy.go.concept.go.go0008283.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008340","id":"taxonomy.go.concept.go.go0008340.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009292","id":"taxonomy.go.concept.go.go0009292.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0009407","id":"taxonomy.go.concept.go.go0009407.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0009420","id":"taxonomy.go.concept.go.go0009420.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009421","id":"taxonomy.go.concept.go.go0009421.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009422","id":"taxonomy.go.concept.go.go0009422.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009424","id":"taxonomy.go.concept.go.go0009424.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009431","id":"taxonomy.go.concept.go.go0009431.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009433","id":"taxonomy.go.concept.go.go0009433.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009541","id":"taxonomy.go.concept.go.go0009541.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009542","id":"taxonomy.go.concept.go.go0009542.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009561","id":"taxonomy.go.concept.go.go0009561.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009566","id":"taxonomy.go.concept.go.go0009566.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0009574","id":"taxonomy.go.concept.go.go0009574.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009653","id":"taxonomy.go.concept.go.go0009653.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0009791","id":"taxonomy.go.concept.go.go0009791.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009838","id":"taxonomy.go.concept.go.go0009838.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0009845","id":"taxonomy.go.concept.go.go0009845.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009846","id":"taxonomy.go.concept.go.go0009846.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009865","id":"taxonomy.go.concept.go.go0009865.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0010014","id":"taxonomy.go.concept.go.go0010014.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0010022","id":"taxonomy.go.concept.go.go0010022.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010073","id":"taxonomy.go.concept.go.go0010073.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010118","id":"taxonomy.go.concept.go.go0010118.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0010127","id":"taxonomy.go.concept.go.go0010127.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0010162","id":"taxonomy.go.concept.go.go0010162.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010483","id":"taxonomy.go.concept.go.go0010483.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0012505","id":"taxonomy.go.concept.go.go0012505.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0014705","id":"taxonomy.go.concept.go.go0014705.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0014801","id":"taxonomy.go.concept.go.go0014801.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0016037","id":"taxonomy.go.concept.go.go0016037.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0016049","id":"taxonomy.go.concept.go.go0016049.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0016192","id":"taxonomy.go.concept.go.go0016192.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0016203","id":"taxonomy.go.concept.go.go0016203.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0016328","id":"taxonomy.go.concept.go.go0016328.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0019013","id":"taxonomy.go.concept.go.go0019013.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019028","id":"taxonomy.go.concept.go.go0019028.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019033","id":"taxonomy.go.concept.go.go0019033.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019042","id":"taxonomy.go.concept.go.go0019042.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019045","id":"taxonomy.go.concept.go.go0019045.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019046","id":"taxonomy.go.concept.go.go0019046.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019058","id":"taxonomy.go.concept.go.go0019058.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019061","id":"taxonomy.go.concept.go.go0019061.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019068","id":"taxonomy.go.concept.go.go0019068.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019069","id":"taxonomy.go.concept.go.go0019069.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019070","id":"taxonomy.go.concept.go.go0019070.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019072","id":"taxonomy.go.concept.go.go0019072.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019075","id":"taxonomy.go.concept.go.go0019075.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019076","id":"taxonomy.go.concept.go.go0019076.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019079","id":"taxonomy.go.concept.go.go0019079.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019080","id":"taxonomy.go.concept.go.go0019080.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019081","id":"taxonomy.go.concept.go.go0019081.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019082","id":"taxonomy.go.concept.go.go0019082.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019083","id":"taxonomy.go.concept.go.go0019083.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019725","id":"taxonomy.go.concept.go.go0019725.concept.go.go0042592","parent":"concept.go.go0042592","type":"narrower"},{"child":"concept.go.go0019827","id":"taxonomy.go.concept.go.go0019827.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0019835","id":"taxonomy.go.concept.go.go0019835.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0019882","id":"taxonomy.go.concept.go.go0019882.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0019953","id":"taxonomy.go.concept.go.go0019953.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0019954","id":"taxonomy.go.concept.go.go0019954.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0020023","id":"taxonomy.go.concept.go.go0020023.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0020038","id":"taxonomy.go.concept.go.go0020038.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0021700","id":"taxonomy.go.concept.go.go0021700.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0022004","id":"taxonomy.go.concept.go.go0022004.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022005","id":"taxonomy.go.concept.go.go0022005.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022402","id":"taxonomy.go.concept.go.go0022402.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022403","id":"taxonomy.go.concept.go.go0022403.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0022404","id":"taxonomy.go.concept.go.go0022404.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022406","id":"taxonomy.go.concept.go.go0022406.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022412","id":"taxonomy.go.concept.go.go0022412.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022413","id":"taxonomy.go.concept.go.go0022413.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0022601","id":"taxonomy.go.concept.go.go0022601.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0022602","id":"taxonomy.go.concept.go.go0022602.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0022608","id":"taxonomy.go.concept.go.go0022608.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022611","id":"taxonomy.go.concept.go.go0022611.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0030017","id":"taxonomy.go.concept.go.go0030017.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030029","id":"taxonomy.go.concept.go.go0030029.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0030061","id":"taxonomy.go.concept.go.go0030061.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030315","id":"taxonomy.go.concept.go.go0030315.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030427","id":"taxonomy.go.concept.go.go0030427.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030431","id":"taxonomy.go.concept.go.go0030431.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0030447","id":"taxonomy.go.concept.go.go0030447.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0030583","id":"taxonomy.go.concept.go.go0030583.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0030588","id":"taxonomy.go.concept.go.go0030588.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0031128","id":"taxonomy.go.concept.go.go0031128.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0031256","id":"taxonomy.go.concept.go.go0031256.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031257","id":"taxonomy.go.concept.go.go0031257.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031294","id":"taxonomy.go.concept.go.go0031294.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0031424","id":"taxonomy.go.concept.go.go0031424.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0031430","id":"taxonomy.go.concept.go.go0031430.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031672","id":"taxonomy.go.concept.go.go0031672.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031673","id":"taxonomy.go.concept.go.go0031673.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031674","id":"taxonomy.go.concept.go.go0031674.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031987","id":"taxonomy.go.concept.go.go0031987.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0032153","id":"taxonomy.go.concept.go.go0032153.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032178","id":"taxonomy.go.concept.go.go0032178.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032179","id":"taxonomy.go.concept.go.go0032179.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032898","id":"taxonomy.go.concept.go.go0032898.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0033036","id":"taxonomy.go.concept.go.go0033036.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0033058","id":"taxonomy.go.concept.go.go0033058.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0033059","id":"taxonomy.go.concept.go.go0033059.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0033060","id":"taxonomy.go.concept.go.go0033060.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0033774","id":"taxonomy.go.concept.go.go0033774.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0034337","id":"taxonomy.go.concept.go.go0034337.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0034381","id":"taxonomy.go.concept.go.go0034381.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035073","id":"taxonomy.go.concept.go.go0035073.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035074","id":"taxonomy.go.concept.go.go0035074.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035172","id":"taxonomy.go.concept.go.go0035172.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0035212","id":"taxonomy.go.concept.go.go0035212.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0035264","id":"taxonomy.go.concept.go.go0035264.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035265","id":"taxonomy.go.concept.go.go0035265.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035314","id":"taxonomy.go.concept.go.go0035314.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035686","id":"taxonomy.go.concept.go.go0035686.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0035732","id":"taxonomy.go.concept.go.go0035732.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0035749","id":"taxonomy.go.concept.go.go0035749.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0035821","id":"taxonomy.go.concept.go.go0035821.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0035889","id":"taxonomy.go.concept.go.go0035889.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0036166","id":"taxonomy.go.concept.go.go0036166.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0036268","id":"taxonomy.go.concept.go.go0036268.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0036338","id":"taxonomy.go.concept.go.go0036338.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039624","id":"taxonomy.go.concept.go.go0039624.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039625","id":"taxonomy.go.concept.go.go0039625.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039626","id":"taxonomy.go.concept.go.go0039626.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039642","id":"taxonomy.go.concept.go.go0039642.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039663","id":"taxonomy.go.concept.go.go0039663.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039664","id":"taxonomy.go.concept.go.go0039664.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039665","id":"taxonomy.go.concept.go.go0039665.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039674","id":"taxonomy.go.concept.go.go0039674.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039678","id":"taxonomy.go.concept.go.go0039678.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039700","id":"taxonomy.go.concept.go.go0039700.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0042303","id":"taxonomy.go.concept.go.go0042303.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0042330","id":"taxonomy.go.concept.go.go0042330.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0042386","id":"taxonomy.go.concept.go.go0042386.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0042628","id":"taxonomy.go.concept.go.go0042628.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0042641","id":"taxonomy.go.concept.go.go0042641.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0042698","id":"taxonomy.go.concept.go.go0042698.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0042763","id":"taxonomy.go.concept.go.go0042763.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0042995","id":"taxonomy.go.concept.go.go0042995.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043036","id":"taxonomy.go.concept.go.go0043036.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043083","id":"taxonomy.go.concept.go.go0043083.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043203","id":"taxonomy.go.concept.go.go0043203.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043204","id":"taxonomy.go.concept.go.go0043204.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043220","id":"taxonomy.go.concept.go.go0043220.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043226","id":"taxonomy.go.concept.go.go0043226.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043335","id":"taxonomy.go.concept.go.go0043335.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0043476","id":"taxonomy.go.concept.go.go0043476.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0043480","id":"taxonomy.go.concept.go.go0043480.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0043670","id":"taxonomy.go.concept.go.go0043670.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043671","id":"taxonomy.go.concept.go.go0043671.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043672","id":"taxonomy.go.concept.go.go0043672.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043696","id":"taxonomy.go.concept.go.go0043696.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0043934","id":"taxonomy.go.concept.go.go0043934.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0044010","id":"taxonomy.go.concept.go.go0044010.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0044111","id":"taxonomy.go.concept.go.go0044111.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0044232","id":"taxonomy.go.concept.go.go0044232.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0044403","id":"taxonomy.go.concept.go.go0044403.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0044703","id":"taxonomy.go.concept.go.go0044703.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0044706","id":"taxonomy.go.concept.go.go0044706.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0044826","id":"taxonomy.go.concept.go.go0044826.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0044851","id":"taxonomy.go.concept.go.go0044851.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0045056","id":"taxonomy.go.concept.go.go0045056.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0045058","id":"taxonomy.go.concept.go.go0045058.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0045103","id":"taxonomy.go.concept.go.go0045103.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0045171","id":"taxonomy.go.concept.go.go0045171.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0045321","id":"taxonomy.go.concept.go.go0045321.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0045494","id":"taxonomy.go.concept.go.go0045494.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0046727","id":"taxonomy.go.concept.go.go0046727.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0046729","id":"taxonomy.go.concept.go.go0046729.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0046745","id":"taxonomy.go.concept.go.go0046745.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046755","id":"taxonomy.go.concept.go.go0046755.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046784","id":"taxonomy.go.concept.go.go0046784.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046786","id":"taxonomy.go.concept.go.go0046786.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046794","id":"taxonomy.go.concept.go.go0046794.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046807","id":"taxonomy.go.concept.go.go0046807.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046818","id":"taxonomy.go.concept.go.go0046818.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048046","id":"taxonomy.go.concept.go.go0048046.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048066","id":"taxonomy.go.concept.go.go0048066.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0048471","id":"taxonomy.go.concept.go.go0048471.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048489","id":"taxonomy.go.concept.go.go0048489.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048532","id":"taxonomy.go.concept.go.go0048532.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048589","id":"taxonomy.go.concept.go.go0048589.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0048609","id":"taxonomy.go.concept.go.go0048609.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0048646","id":"taxonomy.go.concept.go.go0048646.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048647","id":"taxonomy.go.concept.go.go0048647.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048771","id":"taxonomy.go.concept.go.go0048771.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048856","id":"taxonomy.go.concept.go.go0048856.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048869","id":"taxonomy.go.concept.go.go0048869.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048870","id":"taxonomy.go.concept.go.go0048870.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048871","id":"taxonomy.go.concept.go.go0048871.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048878","id":"taxonomy.go.concept.go.go0048878.concept.go.go0042592","parent":"concept.go.go0042592","type":"narrower"},{"child":"concept.go.go0050817","id":"taxonomy.go.concept.go.go0050817.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0050879","id":"taxonomy.go.concept.go.go0050879.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0050900","id":"taxonomy.go.concept.go.go0050900.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0051301","id":"taxonomy.go.concept.go.go0051301.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0051321","id":"taxonomy.go.concept.go.go0051321.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0051410","id":"taxonomy.go.concept.go.go0051410.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0051640","id":"taxonomy.go.concept.go.go0051640.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0051641","id":"taxonomy.go.concept.go.go0051641.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0051674","id":"taxonomy.go.concept.go.go0051674.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0055036","id":"taxonomy.go.concept.go.go0055036.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0055046","id":"taxonomy.go.concept.go.go0055046.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0055085","id":"taxonomy.go.concept.go.go0055085.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0055127","id":"taxonomy.go.concept.go.go0055127.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0060033","id":"taxonomy.go.concept.go.go0060033.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0060104","id":"taxonomy.go.concept.go.go0060104.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060105","id":"taxonomy.go.concept.go.go0060105.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060108","id":"taxonomy.go.concept.go.go0060108.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060206","id":"taxonomy.go.concept.go.go0060206.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0060352","id":"taxonomy.go.concept.go.go0060352.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0060361","id":"taxonomy.go.concept.go.go0060361.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0060384","id":"taxonomy.go.concept.go.go0060384.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0061687","id":"taxonomy.go.concept.go.go0061687.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0061822","id":"taxonomy.go.concept.go.go0061822.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061823","id":"taxonomy.go.concept.go.go0061823.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061834","id":"taxonomy.go.concept.go.go0061834.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061835","id":"taxonomy.go.concept.go.go0061835.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061842","id":"taxonomy.go.concept.go.go0061842.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0061845","id":"taxonomy.go.concept.go.go0061845.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061919","id":"taxonomy.go.concept.go.go0061919.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0061948","id":"taxonomy.go.concept.go.go0061948.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0070057","id":"taxonomy.go.concept.go.go0070057.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0070701","id":"taxonomy.go.concept.go.go0070701.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0071554","id":"taxonomy.go.concept.go.go0071554.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0071684","id":"taxonomy.go.concept.go.go0071684.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0071722","id":"taxonomy.go.concept.go.go0071722.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0071808","id":"taxonomy.go.concept.go.go0071808.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0071827","id":"taxonomy.go.concept.go.go0071827.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0071840","id":"taxonomy.go.concept.go.go0071840.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0071965","id":"taxonomy.go.concept.go.go0071965.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0072324","id":"taxonomy.go.concept.go.go0072324.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0072690","id":"taxonomy.go.concept.go.go0072690.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0075325","id":"taxonomy.go.concept.go.go0075325.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0075522","id":"taxonomy.go.concept.go.go0075522.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075523","id":"taxonomy.go.concept.go.go0075523.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075524","id":"taxonomy.go.concept.go.go0075524.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075525","id":"taxonomy.go.concept.go.go0075525.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075526","id":"taxonomy.go.concept.go.go0075526.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075527","id":"taxonomy.go.concept.go.go0075527.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0080189","id":"taxonomy.go.concept.go.go0080189.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0080190","id":"taxonomy.go.concept.go.go0080190.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0085036","id":"taxonomy.go.concept.go.go0085036.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090123","id":"taxonomy.go.concept.go.go0090123.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090130","id":"taxonomy.go.concept.go.go0090130.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0090398","id":"taxonomy.go.concept.go.go0090398.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0090405","id":"taxonomy.go.concept.go.go0090405.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090635","id":"taxonomy.go.concept.go.go0090635.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090637","id":"taxonomy.go.concept.go.go0090637.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090644","id":"taxonomy.go.concept.go.go0090644.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0090658","id":"taxonomy.go.concept.go.go0090658.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090692","id":"taxonomy.go.concept.go.go0090692.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090693","id":"taxonomy.go.concept.go.go0090693.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0090713","id":"taxonomy.go.concept.go.go0090713.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0090724","id":"taxonomy.go.concept.go.go0090724.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090725","id":"taxonomy.go.concept.go.go0090725.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090726","id":"taxonomy.go.concept.go.go0090726.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097002","id":"taxonomy.go.concept.go.go0097002.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097047","id":"taxonomy.go.concept.go.go0097047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097120","id":"taxonomy.go.concept.go.go0097120.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0097194","id":"taxonomy.go.concept.go.go0097194.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0097207","id":"taxonomy.go.concept.go.go0097207.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0097242","id":"taxonomy.go.concept.go.go0097242.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0097528","id":"taxonomy.go.concept.go.go0097528.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0097562","id":"taxonomy.go.concept.go.go0097562.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097593","id":"taxonomy.go.concept.go.go0097593.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097594","id":"taxonomy.go.concept.go.go0097594.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097595","id":"taxonomy.go.concept.go.go0097595.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097596","id":"taxonomy.go.concept.go.go0097596.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097614","id":"taxonomy.go.concept.go.go0097614.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097683","id":"taxonomy.go.concept.go.go0097683.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097722","id":"taxonomy.go.concept.go.go0097722.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0097737","id":"taxonomy.go.concept.go.go0097737.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0097751","id":"taxonomy.go.concept.go.go0097751.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0098003","id":"taxonomy.go.concept.go.go0098003.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098004","id":"taxonomy.go.concept.go.go0098004.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098005","id":"taxonomy.go.concept.go.go0098005.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098015","id":"taxonomy.go.concept.go.go0098015.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098021","id":"taxonomy.go.concept.go.go0098021.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098023","id":"taxonomy.go.concept.go.go0098023.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098024","id":"taxonomy.go.concept.go.go0098024.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098025","id":"taxonomy.go.concept.go.go0098025.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098026","id":"taxonomy.go.concept.go.go0098026.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098027","id":"taxonomy.go.concept.go.go0098027.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098028","id":"taxonomy.go.concept.go.go0098028.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098029","id":"taxonomy.go.concept.go.go0098029.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098030","id":"taxonomy.go.concept.go.go0098030.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098031","id":"taxonomy.go.concept.go.go0098031.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098045","id":"taxonomy.go.concept.go.go0098045.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098061","id":"taxonomy.go.concept.go.go0098061.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098669","id":"taxonomy.go.concept.go.go0098669.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098677","id":"taxonomy.go.concept.go.go0098677.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098678","id":"taxonomy.go.concept.go.go0098678.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098689","id":"taxonomy.go.concept.go.go0098689.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098743","id":"taxonomy.go.concept.go.go0098743.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0098843","id":"taxonomy.go.concept.go.go0098843.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0098862","id":"taxonomy.go.concept.go.go0098862.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099009","id":"taxonomy.go.concept.go.go0099009.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0099079","id":"taxonomy.go.concept.go.go0099079.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099086","id":"taxonomy.go.concept.go.go0099086.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099120","id":"taxonomy.go.concept.go.go0099120.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0099522","id":"taxonomy.go.concept.go.go0099522.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0106125","id":"taxonomy.go.concept.go.go0106125.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0106126","id":"taxonomy.go.concept.go.go0106126.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0110134","id":"taxonomy.go.concept.go.go0110134.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0120082","id":"taxonomy.go.concept.go.go0120082.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120102","id":"taxonomy.go.concept.go.go0120102.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120104","id":"taxonomy.go.concept.go.go0120104.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120135","id":"taxonomy.go.concept.go.go0120135.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120212","id":"taxonomy.go.concept.go.go0120212.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120312","id":"taxonomy.go.concept.go.go0120312.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0120318","id":"taxonomy.go.concept.go.go0120318.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0120321","id":"taxonomy.go.concept.go.go0120321.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140029","id":"taxonomy.go.concept.go.go0140029.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140106","id":"taxonomy.go.concept.go.go0140106.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0140253","id":"taxonomy.go.concept.go.go0140253.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140352","id":"taxonomy.go.concept.go.go0140352.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140511","id":"taxonomy.go.concept.go.go0140511.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140547","id":"taxonomy.go.concept.go.go0140547.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0140599","id":"taxonomy.go.concept.go.go0140599.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140725","id":"taxonomy.go.concept.go.go0140725.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0140729","id":"taxonomy.go.concept.go.go0140729.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0140755","id":"taxonomy.go.concept.go.go0140755.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0140918","id":"taxonomy.go.concept.go.go0140918.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0141060","id":"taxonomy.go.concept.go.go0141060.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0150034","id":"taxonomy.go.concept.go.go0150034.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0160266","id":"taxonomy.go.concept.go.go0160266.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0170047","id":"taxonomy.go.concept.go.go0170047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0170062","id":"taxonomy.go.concept.go.go0170062.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go1903046","id":"taxonomy.go.concept.go.go1903046.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go1990047","id":"taxonomy.go.concept.go.go1990047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990110","id":"taxonomy.go.concept.go.go1990110.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go1990277","id":"taxonomy.go.concept.go.go1990277.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go1990636","id":"taxonomy.go.concept.go.go1990636.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go1990717","id":"taxonomy.go.concept.go.go1990717.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990748","id":"taxonomy.go.concept.go.go1990748.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go1990826","id":"taxonomy.go.concept.go.go1990826.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990836","id":"taxonomy.go.concept.go.go1990836.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990900","id":"taxonomy.go.concept.go.go1990900.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go7770056","id":"taxonomy.go.concept.go.go7770056.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go7770129","id":"taxonomy.go.concept.go.go7770129.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.mesh.d000024","id":"taxonomy.mesh.concept.mesh.d000024.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000057","id":"taxonomy.mesh.concept.mesh.d000057.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000066479","id":"taxonomy.mesh.concept.mesh.d000066479.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000066498","id":"taxonomy.mesh.concept.mesh.d000066498.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000066768","id":"taxonomy.mesh.concept.mesh.d000066768.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000067448","id":"taxonomy.mesh.concept.mesh.d000067448.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000067496","id":"taxonomy.mesh.concept.mesh.d000067496.field.mesh.d012068","parent":"field.mesh.d012068","type":"narrower"},{"child":"concept.mesh.d000067551","id":"taxonomy.mesh.concept.mesh.d000067551.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000067656","id":"taxonomy.mesh.concept.mesh.d000067656.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000067657","id":"taxonomy.mesh.concept.mesh.d000067657.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000067896","id":"taxonomy.mesh.concept.mesh.d000067896.concept.mesh.d057217","parent":"concept.mesh.d057217","type":"narrower"},{"child":"concept.mesh.d000068616","id":"taxonomy.mesh.concept.mesh.d000068616.field.mesh.d004995","parent":"field.mesh.d004995","type":"narrower"},{"child":"concept.mesh.d000069457","id":"taxonomy.mesh.concept.mesh.d000069457.concept.mesh.d005544","parent":"concept.mesh.d005544","type":"narrower"},{"child":"concept.mesh.d000069553","id":"taxonomy.mesh.concept.mesh.d000069553.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000069558","id":"taxonomy.mesh.concept.mesh.d000069558.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000069578","id":"taxonomy.mesh.concept.mesh.d000069578.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000070100","id":"taxonomy.mesh.concept.mesh.d000070100.concept.mesh.d017149","parent":"concept.mesh.d017149","type":"narrower"},{"child":"concept.mesh.d000070337","id":"taxonomy.mesh.concept.mesh.d000070337.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d000070586","id":"taxonomy.mesh.concept.mesh.d000070586.concept.mesh.d057766","parent":"concept.mesh.d057766","type":"narrower"},{"child":"concept.mesh.d000070838","id":"taxonomy.mesh.concept.mesh.d000070838.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000071220","id":"taxonomy.mesh.concept.mesh.d000071220.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000072358","id":"taxonomy.mesh.concept.mesh.d000072358.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d000072577","id":"taxonomy.mesh.concept.mesh.d000072577.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d000072698","id":"taxonomy.mesh.concept.mesh.d000072698.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d000073276","id":"taxonomy.mesh.concept.mesh.d000073276.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d000073456","id":"taxonomy.mesh.concept.mesh.d000073456.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000073597","id":"taxonomy.mesh.concept.mesh.d000073597.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000073624","id":"taxonomy.mesh.concept.mesh.d000073624.concept.mesh.d013561","parent":"concept.mesh.d013561","type":"narrower"},{"child":"concept.mesh.d000074439","id":"taxonomy.mesh.concept.mesh.d000074439.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000074440","id":"taxonomy.mesh.concept.mesh.d000074440.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d000074609","id":"taxonomy.mesh.concept.mesh.d000074609.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000075066","id":"taxonomy.mesh.concept.mesh.d000075066.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000075082","id":"taxonomy.mesh.concept.mesh.d000075082.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000075665","id":"taxonomy.mesh.concept.mesh.d000075665.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000075682","id":"taxonomy.mesh.concept.mesh.d000075682.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000075762","id":"taxonomy.mesh.concept.mesh.d000075762.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000075862","id":"taxonomy.mesh.concept.mesh.d000075862.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d000077321","id":"taxonomy.mesh.concept.mesh.d000077321.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000077406","id":"taxonomy.mesh.concept.mesh.d000077406.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d000078002","id":"taxonomy.mesh.concept.mesh.d000078002.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000078332","id":"taxonomy.mesh.concept.mesh.d000078332.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"concept.mesh.d000078382","id":"taxonomy.mesh.concept.mesh.d000078382.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000078625","id":"taxonomy.mesh.concept.mesh.d000078625.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000078682","id":"taxonomy.mesh.concept.mesh.d000078682.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000079263","id":"taxonomy.mesh.concept.mesh.d000079263.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000079426","id":"taxonomy.mesh.concept.mesh.d000079426.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000080105","id":"taxonomy.mesh.concept.mesh.d000080105.concept.mesh.d026684","parent":"concept.mesh.d026684","type":"narrower"},{"child":"concept.mesh.d000080562","id":"taxonomy.mesh.concept.mesh.d000080562.concept.mesh.d004779","parent":"concept.mesh.d004779","type":"narrower"},{"child":"concept.mesh.d000081762","id":"taxonomy.mesh.concept.mesh.d000081762.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000083202","id":"taxonomy.mesh.concept.mesh.d000083202.concept.mesh.d000082742","parent":"concept.mesh.d000082742","type":"narrower"},{"child":"concept.mesh.d000083623","id":"taxonomy.mesh.concept.mesh.d000083623.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000084783","id":"taxonomy.mesh.concept.mesh.d000084783.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000085343","id":"taxonomy.mesh.concept.mesh.d000085343.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000087366","id":"taxonomy.mesh.concept.mesh.d000087366.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000087983","id":"taxonomy.mesh.concept.mesh.d000087983.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d000088562","id":"taxonomy.mesh.concept.mesh.d000088562.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000088724","id":"taxonomy.mesh.concept.mesh.d000088724.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000090082","id":"taxonomy.mesh.concept.mesh.d000090082.concept.mesh.d005544","parent":"concept.mesh.d005544","type":"narrower"},{"child":"concept.mesh.d000090862","id":"taxonomy.mesh.concept.mesh.d000090862.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d000091383","id":"taxonomy.mesh.concept.mesh.d000091383.concept.mesh.d012935","parent":"concept.mesh.d012935","type":"narrower"},{"child":"concept.mesh.d000091682","id":"taxonomy.mesh.concept.mesh.d000091682.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d000091702","id":"taxonomy.mesh.concept.mesh.d000091702.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"concept.mesh.d000092003","id":"taxonomy.mesh.concept.mesh.d000092003.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000092822","id":"taxonomy.mesh.concept.mesh.d000092822.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d000092862","id":"taxonomy.mesh.concept.mesh.d000092862.concept.mesh.d011788","parent":"concept.mesh.d011788","type":"narrower"},{"child":"concept.mesh.d000093742","id":"taxonomy.mesh.concept.mesh.d000093742.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000094408","id":"taxonomy.mesh.concept.mesh.d000094408.concept.mesh.d000082742","parent":"concept.mesh.d000082742","type":"narrower"},{"child":"concept.mesh.d000094505","id":"taxonomy.mesh.concept.mesh.d000094505.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000095026","id":"taxonomy.mesh.concept.mesh.d000095026.concept.mesh.d012935","parent":"concept.mesh.d012935","type":"narrower"},{"child":"concept.mesh.d000096264","id":"taxonomy.mesh.concept.mesh.d000096264.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000097785","id":"taxonomy.mesh.concept.mesh.d000097785.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d000097812","id":"taxonomy.mesh.concept.mesh.d000097812.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000097813","id":"taxonomy.mesh.concept.mesh.d000097813.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000097815","id":"taxonomy.mesh.concept.mesh.d000097815.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000097822","id":"taxonomy.mesh.concept.mesh.d000097822.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"concept.mesh.d000097824","id":"taxonomy.mesh.concept.mesh.d000097824.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000098342","id":"taxonomy.mesh.concept.mesh.d000098342.concept.mesh.d000077321","parent":"concept.mesh.d000077321","type":"narrower"},{"child":"concept.mesh.d000098402","id":"taxonomy.mesh.concept.mesh.d000098402.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.mesh.d000098404","id":"taxonomy.mesh.concept.mesh.d000098404.concept.mesh.d000098406","parent":"concept.mesh.d000098406","type":"narrower"},{"child":"concept.mesh.d000098405","id":"taxonomy.mesh.concept.mesh.d000098405.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098406","id":"taxonomy.mesh.concept.mesh.d000098406.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098407","id":"taxonomy.mesh.concept.mesh.d000098407.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098408","id":"taxonomy.mesh.concept.mesh.d000098408.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098409","id":"taxonomy.mesh.concept.mesh.d000098409.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098410","id":"taxonomy.mesh.concept.mesh.d000098410.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098412","id":"taxonomy.mesh.concept.mesh.d000098412.concept.mesh.d000098411","parent":"concept.mesh.d000098411","type":"narrower"},{"child":"concept.mesh.d000098426","id":"taxonomy.mesh.concept.mesh.d000098426.concept.mesh.d000098435","parent":"concept.mesh.d000098435","type":"narrower"},{"child":"concept.mesh.d000098427","id":"taxonomy.mesh.concept.mesh.d000098427.concept.mesh.d000069558","parent":"concept.mesh.d000069558","type":"narrower"},{"child":"concept.mesh.d000098429","id":"taxonomy.mesh.concept.mesh.d000098429.concept.mesh.d000098435","parent":"concept.mesh.d000098435","type":"narrower"},{"child":"concept.mesh.d000098446","id":"taxonomy.mesh.concept.mesh.d000098446.concept.mesh.d000077321","parent":"concept.mesh.d000077321","type":"narrower"},{"child":"concept.mesh.d000098451","id":"taxonomy.mesh.concept.mesh.d000098451.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"concept.mesh.d000099056","id":"taxonomy.mesh.concept.mesh.d000099056.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000099075","id":"taxonomy.mesh.concept.mesh.d000099075.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000184","id":"taxonomy.mesh.concept.mesh.d000184.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000223","id":"taxonomy.mesh.concept.mesh.d000223.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000294","id":"taxonomy.mesh.concept.mesh.d000294.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000339","id":"taxonomy.mesh.concept.mesh.d000339.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000422","id":"taxonomy.mesh.concept.mesh.d000422.concept.mesh.d009781","parent":"concept.mesh.d009781","type":"narrower"},{"child":"concept.mesh.d000716","id":"taxonomy.mesh.concept.mesh.d000716.concept.mesh.d008488","parent":"concept.mesh.d008488","type":"narrower"},{"child":"concept.mesh.d000785","id":"taxonomy.mesh.concept.mesh.d000785.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000786","id":"taxonomy.mesh.concept.mesh.d000786.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000887","id":"taxonomy.mesh.concept.mesh.d000887.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d001007","id":"taxonomy.mesh.concept.mesh.d001007.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001170","id":"taxonomy.mesh.concept.mesh.d001170.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001290","id":"taxonomy.mesh.concept.mesh.d001290.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d001291","id":"taxonomy.mesh.concept.mesh.d001291.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001292","id":"taxonomy.mesh.concept.mesh.d001292.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001293","id":"taxonomy.mesh.concept.mesh.d001293.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001294","id":"taxonomy.mesh.concept.mesh.d001294.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001296","id":"taxonomy.mesh.concept.mesh.d001296.field.mesh.d018961","parent":"field.mesh.d018961","type":"narrower"},{"child":"concept.mesh.d001331","id":"taxonomy.mesh.concept.mesh.d001331.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d001342","id":"taxonomy.mesh.concept.mesh.d001342.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d001423","id":"taxonomy.mesh.concept.mesh.d001423.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001499","id":"taxonomy.mesh.concept.mesh.d001499.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d001504","id":"taxonomy.mesh.concept.mesh.d001504.field.mesh.d004954","parent":"field.mesh.d004954","type":"narrower"},{"child":"concept.mesh.d001519","id":"taxonomy.mesh.concept.mesh.d001519.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d001522","id":"taxonomy.mesh.concept.mesh.d001522.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d001526","id":"taxonomy.mesh.concept.mesh.d001526.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d001601","id":"taxonomy.mesh.concept.mesh.d001601.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001633","id":"taxonomy.mesh.concept.mesh.d001633.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d001698","id":"taxonomy.mesh.concept.mesh.d001698.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d001721","id":"taxonomy.mesh.concept.mesh.d001721.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d001722","id":"taxonomy.mesh.concept.mesh.d001722.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d001850","id":"taxonomy.mesh.concept.mesh.d001850.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001878","id":"taxonomy.mesh.concept.mesh.d001878.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d001887","id":"taxonomy.mesh.concept.mesh.d001887.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001982","id":"taxonomy.mesh.concept.mesh.d001982.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d002016","id":"taxonomy.mesh.concept.mesh.d002016.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d002410","id":"taxonomy.mesh.concept.mesh.d002410.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d002493","id":"taxonomy.mesh.concept.mesh.d002493.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d002494","id":"taxonomy.mesh.concept.mesh.d002494.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d002616","id":"taxonomy.mesh.concept.mesh.d002616.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d002652","id":"taxonomy.mesh.concept.mesh.d002652.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d002668","id":"taxonomy.mesh.concept.mesh.d002668.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d002835","id":"taxonomy.mesh.concept.mesh.d002835.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d002925","id":"taxonomy.mesh.concept.mesh.d002925.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d002959","id":"taxonomy.mesh.concept.mesh.d002959.concept.mesh.d006078","parent":"concept.mesh.d006078","type":"narrower"},{"child":"concept.mesh.d003141","id":"taxonomy.mesh.concept.mesh.d003141.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d003142","id":"taxonomy.mesh.concept.mesh.d003142.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003148","id":"taxonomy.mesh.concept.mesh.d003148.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d003242","id":"taxonomy.mesh.concept.mesh.d003242.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d003258","id":"taxonomy.mesh.concept.mesh.d003258.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003389","id":"taxonomy.mesh.concept.mesh.d003389.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d003415","id":"taxonomy.mesh.concept.mesh.d003415.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"concept.mesh.d003428","id":"taxonomy.mesh.concept.mesh.d003428.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d003560","id":"taxonomy.mesh.concept.mesh.d003560.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d003617","id":"taxonomy.mesh.concept.mesh.d003617.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003674","id":"taxonomy.mesh.concept.mesh.d003674.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d003709","id":"taxonomy.mesh.concept.mesh.d003709.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d003711","id":"taxonomy.mesh.concept.mesh.d003711.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d003717","id":"taxonomy.mesh.concept.mesh.d003717.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d003863","id":"taxonomy.mesh.concept.mesh.d003863.concept.mesh.d001526","parent":"concept.mesh.d001526","type":"narrower"},{"child":"concept.mesh.d003906","id":"taxonomy.mesh.concept.mesh.d003906.concept.mesh.d059066","parent":"concept.mesh.d059066","type":"narrower"},{"child":"concept.mesh.d004208","id":"taxonomy.mesh.concept.mesh.d004208.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d004311","id":"taxonomy.mesh.concept.mesh.d004311.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d004324","id":"taxonomy.mesh.concept.mesh.d004324.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d004327","id":"taxonomy.mesh.concept.mesh.d004327.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d004644","id":"taxonomy.mesh.concept.mesh.d004644.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d005086","id":"taxonomy.mesh.concept.mesh.d005086.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d005106","id":"taxonomy.mesh.concept.mesh.d005106.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d005201","id":"taxonomy.mesh.concept.mesh.d005201.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d005490","id":"taxonomy.mesh.concept.mesh.d005490.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d005495","id":"taxonomy.mesh.concept.mesh.d005495.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d005544","id":"taxonomy.mesh.concept.mesh.d005544.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d005553","id":"taxonomy.mesh.concept.mesh.d005553.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d005607","id":"taxonomy.mesh.concept.mesh.d005607.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d005789","id":"taxonomy.mesh.concept.mesh.d005789.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d005891","id":"taxonomy.mesh.concept.mesh.d005891.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d006076","id":"taxonomy.mesh.concept.mesh.d006076.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d006077","id":"taxonomy.mesh.concept.mesh.d006077.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d006078","id":"taxonomy.mesh.concept.mesh.d006078.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d006184","id":"taxonomy.mesh.concept.mesh.d006184.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d006222","id":"taxonomy.mesh.concept.mesh.d006222.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d006302","id":"taxonomy.mesh.concept.mesh.d006302.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d006304","id":"taxonomy.mesh.concept.mesh.d006304.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d006331","id":"taxonomy.mesh.concept.mesh.d006331.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d006380","id":"taxonomy.mesh.concept.mesh.d006380.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d006520","id":"taxonomy.mesh.concept.mesh.d006520.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d006665","id":"taxonomy.mesh.concept.mesh.d006665.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d006676","id":"taxonomy.mesh.concept.mesh.d006676.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d006694","id":"taxonomy.mesh.concept.mesh.d006694.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d006708","id":"taxonomy.mesh.concept.mesh.d006708.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d006803","id":"taxonomy.mesh.concept.mesh.d006803.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d006805","id":"taxonomy.mesh.concept.mesh.d006805.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d006808","id":"taxonomy.mesh.concept.mesh.d006808.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d007062","id":"taxonomy.mesh.concept.mesh.d007062.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d007100","id":"taxonomy.mesh.concept.mesh.d007100.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007175","id":"taxonomy.mesh.concept.mesh.d007175.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007266","id":"taxonomy.mesh.concept.mesh.d007266.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007391","id":"taxonomy.mesh.concept.mesh.d007391.concept.mesh.d038622","parent":"concept.mesh.d038622","type":"narrower"},{"child":"concept.mesh.d007514","id":"taxonomy.mesh.concept.mesh.d007514.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d007599","id":"taxonomy.mesh.concept.mesh.d007599.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d007757","id":"taxonomy.mesh.concept.mesh.d007757.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d007818","id":"taxonomy.mesh.concept.mesh.d007818.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d008119","id":"taxonomy.mesh.concept.mesh.d008119.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d008171","id":"taxonomy.mesh.concept.mesh.d008171.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d008328","id":"taxonomy.mesh.concept.mesh.d008328.field.mesh.d006804","parent":"field.mesh.d006804","type":"narrower"},{"child":"concept.mesh.d008488","id":"taxonomy.mesh.concept.mesh.d008488.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d008512","id":"taxonomy.mesh.concept.mesh.d008512.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d008904","id":"taxonomy.mesh.concept.mesh.d008904.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d008921","id":"taxonomy.mesh.concept.mesh.d008921.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d008953","id":"taxonomy.mesh.concept.mesh.d008953.concept.mesh.d008961","parent":"concept.mesh.d008961","type":"narrower"},{"child":"concept.mesh.d008961","id":"taxonomy.mesh.concept.mesh.d008961.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d009014","id":"taxonomy.mesh.concept.mesh.d009014.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d009040","id":"taxonomy.mesh.concept.mesh.d009040.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d009043","id":"taxonomy.mesh.concept.mesh.d009043.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d009111","id":"taxonomy.mesh.concept.mesh.d009111.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d009228","id":"taxonomy.mesh.concept.mesh.d009228.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d009370","id":"taxonomy.mesh.concept.mesh.d009370.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009371","id":"taxonomy.mesh.concept.mesh.d009371.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009374","id":"taxonomy.mesh.concept.mesh.d009374.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009376","id":"taxonomy.mesh.concept.mesh.d009376.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009378","id":"taxonomy.mesh.concept.mesh.d009378.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009381","id":"taxonomy.mesh.concept.mesh.d009381.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009385","id":"taxonomy.mesh.concept.mesh.d009385.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009386","id":"taxonomy.mesh.concept.mesh.d009386.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009421","id":"taxonomy.mesh.concept.mesh.d009421.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009423","id":"taxonomy.mesh.concept.mesh.d009423.concept.mesh.d009371","parent":"concept.mesh.d009371","type":"narrower"},{"child":"concept.mesh.d009461","id":"taxonomy.mesh.concept.mesh.d009461.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009468","id":"taxonomy.mesh.concept.mesh.d009468.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009668","id":"taxonomy.mesh.concept.mesh.d009668.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d009752","id":"taxonomy.mesh.concept.mesh.d009752.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d009781","id":"taxonomy.mesh.concept.mesh.d009781.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d009874","id":"taxonomy.mesh.concept.mesh.d009874.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d009894","id":"taxonomy.mesh.concept.mesh.d009894.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d009949","id":"taxonomy.mesh.concept.mesh.d009949.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d010257","id":"taxonomy.mesh.concept.mesh.d010257.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d010272","id":"taxonomy.mesh.concept.mesh.d010272.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d010467","id":"taxonomy.mesh.concept.mesh.d010467.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d010549","id":"taxonomy.mesh.concept.mesh.d010549.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d010551","id":"taxonomy.mesh.concept.mesh.d010551.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d010995","id":"taxonomy.mesh.concept.mesh.d010995.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d011049","id":"taxonomy.mesh.concept.mesh.d011049.concept.mesh.d057766","parent":"concept.mesh.d057766","type":"narrower"},{"child":"concept.mesh.d011056","id":"taxonomy.mesh.concept.mesh.d011056.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d011155","id":"taxonomy.mesh.concept.mesh.d011155.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d011158","id":"taxonomy.mesh.concept.mesh.d011158.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d011177","id":"taxonomy.mesh.concept.mesh.d011177.concept.mesh.d006078","parent":"concept.mesh.d006078","type":"narrower"},{"child":"concept.mesh.d011230","id":"taxonomy.mesh.concept.mesh.d011230.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d011249","id":"taxonomy.mesh.concept.mesh.d011249.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d011251","id":"taxonomy.mesh.concept.mesh.d011251.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d011252","id":"taxonomy.mesh.concept.mesh.d011252.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d011385","id":"taxonomy.mesh.concept.mesh.d011385.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d011786","id":"taxonomy.mesh.concept.mesh.d011786.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d011788","id":"taxonomy.mesh.concept.mesh.d011788.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d011845","id":"taxonomy.mesh.concept.mesh.d011845.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d011897","id":"taxonomy.mesh.concept.mesh.d011897.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d011908","id":"taxonomy.mesh.concept.mesh.d011908.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012043","id":"taxonomy.mesh.concept.mesh.d012043.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012071","id":"taxonomy.mesh.concept.mesh.d012071.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d012072","id":"taxonomy.mesh.concept.mesh.d012072.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d012094","id":"taxonomy.mesh.concept.mesh.d012094.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012106","id":"taxonomy.mesh.concept.mesh.d012106.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d012107","id":"taxonomy.mesh.concept.mesh.d012107.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d012120","id":"taxonomy.mesh.concept.mesh.d012120.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d012130","id":"taxonomy.mesh.concept.mesh.d012130.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d012141","id":"taxonomy.mesh.concept.mesh.d012141.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d012306","id":"taxonomy.mesh.concept.mesh.d012306.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d012307","id":"taxonomy.mesh.concept.mesh.d012307.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d012309","id":"taxonomy.mesh.concept.mesh.d012309.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012498","id":"taxonomy.mesh.concept.mesh.d012498.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d012653","id":"taxonomy.mesh.concept.mesh.d012653.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012725","id":"taxonomy.mesh.concept.mesh.d012725.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012742","id":"taxonomy.mesh.concept.mesh.d012742.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d012744","id":"taxonomy.mesh.concept.mesh.d012744.concept.mesh.d017678","parent":"concept.mesh.d017678","type":"narrower"},{"child":"concept.mesh.d012874","id":"taxonomy.mesh.concept.mesh.d012874.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d012893","id":"taxonomy.mesh.concept.mesh.d012893.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d012907","id":"taxonomy.mesh.concept.mesh.d012907.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012919","id":"taxonomy.mesh.concept.mesh.d012919.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012935","id":"taxonomy.mesh.concept.mesh.d012935.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d012941","id":"taxonomy.mesh.concept.mesh.d012941.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d012950","id":"taxonomy.mesh.concept.mesh.d012950.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d013037","id":"taxonomy.mesh.concept.mesh.d013037.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013140","id":"taxonomy.mesh.concept.mesh.d013140.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d013219","id":"taxonomy.mesh.concept.mesh.d013219.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d013239","id":"taxonomy.mesh.concept.mesh.d013239.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013240","id":"taxonomy.mesh.concept.mesh.d013240.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d013359","id":"taxonomy.mesh.concept.mesh.d013359.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d013391","id":"taxonomy.mesh.concept.mesh.d013391.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013492","id":"taxonomy.mesh.concept.mesh.d013492.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d013561","id":"taxonomy.mesh.concept.mesh.d013561.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d013598","id":"taxonomy.mesh.concept.mesh.d013598.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d013637","id":"taxonomy.mesh.concept.mesh.d013637.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d013690","id":"taxonomy.mesh.concept.mesh.d013690.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d013695","id":"taxonomy.mesh.concept.mesh.d013695.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d013800","id":"taxonomy.mesh.concept.mesh.d013800.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014039","id":"taxonomy.mesh.concept.mesh.d014039.concept.mesh.d002668","parent":"concept.mesh.d002668","type":"narrower"},{"child":"concept.mesh.d014115","id":"taxonomy.mesh.concept.mesh.d014115.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014552","id":"taxonomy.mesh.concept.mesh.d014552.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014601","id":"taxonomy.mesh.concept.mesh.d014601.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d014652","id":"taxonomy.mesh.concept.mesh.d014652.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d014742","id":"taxonomy.mesh.concept.mesh.d014742.concept.mesh.d016249","parent":"concept.mesh.d016249","type":"narrower"},{"child":"concept.mesh.d014743","id":"taxonomy.mesh.concept.mesh.d014743.concept.mesh.d013637","parent":"concept.mesh.d013637","type":"narrower"},{"child":"concept.mesh.d014754","id":"taxonomy.mesh.concept.mesh.d014754.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014777","id":"taxonomy.mesh.concept.mesh.d014777.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014799","id":"taxonomy.mesh.concept.mesh.d014799.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d014858","id":"taxonomy.mesh.concept.mesh.d014858.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014881","id":"taxonomy.mesh.concept.mesh.d014881.concept.mesh.d012498","parent":"concept.mesh.d012498","type":"narrower"},{"child":"concept.mesh.d014946","id":"taxonomy.mesh.concept.mesh.d014946.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015013","id":"taxonomy.mesh.concept.mesh.d015013.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d015047","id":"taxonomy.mesh.concept.mesh.d015047.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015438","id":"taxonomy.mesh.concept.mesh.d015438.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d015577","id":"taxonomy.mesh.concept.mesh.d015577.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d015619","id":"taxonomy.mesh.concept.mesh.d015619.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d015769","id":"taxonomy.mesh.concept.mesh.d015769.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d015817","id":"taxonomy.mesh.concept.mesh.d015817.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015985","id":"taxonomy.mesh.concept.mesh.d015985.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d016013","id":"taxonomy.mesh.concept.mesh.d016013.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016014","id":"taxonomy.mesh.concept.mesh.d016014.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016015","id":"taxonomy.mesh.concept.mesh.d016015.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016249","id":"taxonomy.mesh.concept.mesh.d016249.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d016265","id":"taxonomy.mesh.concept.mesh.d016265.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d016459","id":"taxonomy.mesh.concept.mesh.d016459.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d016609","id":"taxonomy.mesh.concept.mesh.d016609.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d016709","id":"taxonomy.mesh.concept.mesh.d016709.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d016743","id":"taxonomy.mesh.concept.mesh.d016743.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d017004","id":"taxonomy.mesh.concept.mesh.d017004.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d017063","id":"taxonomy.mesh.concept.mesh.d017063.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d017149","id":"taxonomy.mesh.concept.mesh.d017149.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d017150","id":"taxonomy.mesh.concept.mesh.d017150.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d017169","id":"taxonomy.mesh.concept.mesh.d017169.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d017533","id":"taxonomy.mesh.concept.mesh.d017533.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d017677","id":"taxonomy.mesh.concept.mesh.d017677.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d017678","id":"taxonomy.mesh.concept.mesh.d017678.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d017712","id":"taxonomy.mesh.concept.mesh.d017712.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d017714","id":"taxonomy.mesh.concept.mesh.d017714.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018376","id":"taxonomy.mesh.concept.mesh.d018376.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d018401","id":"taxonomy.mesh.concept.mesh.d018401.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d018461","id":"taxonomy.mesh.concept.mesh.d018461.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018511","id":"taxonomy.mesh.concept.mesh.d018511.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d018581","id":"taxonomy.mesh.concept.mesh.d018581.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d018594","id":"taxonomy.mesh.concept.mesh.d018594.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d018595","id":"taxonomy.mesh.concept.mesh.d018595.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d018596","id":"taxonomy.mesh.concept.mesh.d018596.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d018597","id":"taxonomy.mesh.concept.mesh.d018597.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d018715","id":"taxonomy.mesh.concept.mesh.d018715.concept.mesh.d013690","parent":"concept.mesh.d013690","type":"narrower"},{"child":"concept.mesh.d018805","id":"taxonomy.mesh.concept.mesh.d018805.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018939","id":"taxonomy.mesh.concept.mesh.d018939.field.mesh.d010687","parent":"field.mesh.d010687","type":"narrower"},{"child":"concept.mesh.d019149","id":"taxonomy.mesh.concept.mesh.d019149.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"concept.mesh.d019212","id":"taxonomy.mesh.concept.mesh.d019212.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d019348","id":"taxonomy.mesh.concept.mesh.d019348.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d019352","id":"taxonomy.mesh.concept.mesh.d019352.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d019356","id":"taxonomy.mesh.concept.mesh.d019356.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d019359","id":"taxonomy.mesh.concept.mesh.d019359.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d019364","id":"taxonomy.mesh.concept.mesh.d019364.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d019365","id":"taxonomy.mesh.concept.mesh.d019365.concept.mesh.d013561","parent":"concept.mesh.d013561","type":"narrower"},{"child":"concept.mesh.d019368","id":"taxonomy.mesh.concept.mesh.d019368.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d019369","id":"taxonomy.mesh.concept.mesh.d019369.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d019413","id":"taxonomy.mesh.concept.mesh.d019413.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d019456","id":"taxonomy.mesh.concept.mesh.d019456.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d019513","id":"taxonomy.mesh.concept.mesh.d019513.concept.mesh.d006808","parent":"concept.mesh.d006808","type":"narrower"},{"child":"concept.mesh.d019636","id":"taxonomy.mesh.concept.mesh.d019636.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d019954","id":"taxonomy.mesh.concept.mesh.d019954.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d020196","id":"taxonomy.mesh.concept.mesh.d020196.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020258","id":"taxonomy.mesh.concept.mesh.d020258.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020274","id":"taxonomy.mesh.concept.mesh.d020274.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020650","id":"taxonomy.mesh.concept.mesh.d020650.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d020752","id":"taxonomy.mesh.concept.mesh.d020752.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d021081","id":"taxonomy.mesh.concept.mesh.d021081.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d024803","id":"taxonomy.mesh.concept.mesh.d024803.field.mesh.d020811","parent":"field.mesh.d020811","type":"narrower"},{"child":"concept.mesh.d024861","id":"taxonomy.mesh.concept.mesh.d024861.concept.mesh.d024803","parent":"concept.mesh.d024803","type":"narrower"},{"child":"concept.mesh.d026684","id":"taxonomy.mesh.concept.mesh.d026684.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d026686","id":"taxonomy.mesh.concept.mesh.d026686.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d026688","id":"taxonomy.mesh.concept.mesh.d026688.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d026689","id":"taxonomy.mesh.concept.mesh.d026689.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d026712","id":"taxonomy.mesh.concept.mesh.d026712.concept.mesh.d019369","parent":"concept.mesh.d019369","type":"narrower"},{"child":"concept.mesh.d026724","id":"taxonomy.mesh.concept.mesh.d026724.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028661","id":"taxonomy.mesh.concept.mesh.d028661.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028663","id":"taxonomy.mesh.concept.mesh.d028663.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028681","id":"taxonomy.mesh.concept.mesh.d028681.concept.mesh.d012941","parent":"concept.mesh.d012941","type":"narrower"},{"child":"concept.mesh.d028683","id":"taxonomy.mesh.concept.mesh.d028683.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d028722","id":"taxonomy.mesh.concept.mesh.d028722.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d028723","id":"taxonomy.mesh.concept.mesh.d028723.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028781","id":"taxonomy.mesh.concept.mesh.d028781.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d029181","id":"taxonomy.mesh.concept.mesh.d029181.field.mesh.d012069","parent":"field.mesh.d012069","type":"narrower"},{"child":"concept.mesh.d030141","id":"taxonomy.mesh.concept.mesh.d030141.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d030861","id":"taxonomy.mesh.concept.mesh.d030861.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d031261","id":"taxonomy.mesh.concept.mesh.d031261.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d032764","id":"taxonomy.mesh.concept.mesh.d032764.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d032903","id":"taxonomy.mesh.concept.mesh.d032903.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d033003","id":"taxonomy.mesh.concept.mesh.d033003.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d033041","id":"taxonomy.mesh.concept.mesh.d033041.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d033042","id":"taxonomy.mesh.concept.mesh.d033042.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d033061","id":"taxonomy.mesh.concept.mesh.d033061.concept.mesh.d026724","parent":"concept.mesh.d026724","type":"narrower"},{"child":"concept.mesh.d033302","id":"taxonomy.mesh.concept.mesh.d033302.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d033303","id":"taxonomy.mesh.concept.mesh.d033303.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d033421","id":"taxonomy.mesh.concept.mesh.d033421.concept.mesh.d019369","parent":"concept.mesh.d019369","type":"narrower"},{"child":"concept.mesh.d034161","id":"taxonomy.mesh.concept.mesh.d034161.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d034682","id":"taxonomy.mesh.concept.mesh.d034682.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d034723","id":"taxonomy.mesh.concept.mesh.d034723.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d035061","id":"taxonomy.mesh.concept.mesh.d035061.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d035481","id":"taxonomy.mesh.concept.mesh.d035481.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d035501","id":"taxonomy.mesh.concept.mesh.d035501.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d035621","id":"taxonomy.mesh.concept.mesh.d035621.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d035761","id":"taxonomy.mesh.concept.mesh.d035761.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d035841","id":"taxonomy.mesh.concept.mesh.d035841.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d035843","id":"taxonomy.mesh.concept.mesh.d035843.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d035863","id":"taxonomy.mesh.concept.mesh.d035863.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d036262","id":"taxonomy.mesh.concept.mesh.d036262.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d036281","id":"taxonomy.mesh.concept.mesh.d036281.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d036301","id":"taxonomy.mesh.concept.mesh.d036301.concept.mesh.d036262","parent":"concept.mesh.d036262","type":"narrower"},{"child":"concept.mesh.d038622","id":"taxonomy.mesh.concept.mesh.d038622.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d040242","id":"taxonomy.mesh.concept.mesh.d040242.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d040261","id":"taxonomy.mesh.concept.mesh.d040261.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d040841","id":"taxonomy.mesh.concept.mesh.d040841.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d043762","id":"taxonomy.mesh.concept.mesh.d043762.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d050997","id":"taxonomy.mesh.concept.mesh.d050997.ology.nanotechnology","parent":"ology.nanotechnology","type":"narrower"},{"child":"concept.mesh.d052156","id":"taxonomy.mesh.concept.mesh.d052156.concept.mesh.d020650","parent":"concept.mesh.d020650","type":"narrower"},{"child":"concept.mesh.d053604","id":"taxonomy.mesh.concept.mesh.d053604.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d053821","id":"taxonomy.mesh.concept.mesh.d053821.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d054802","id":"taxonomy.mesh.concept.mesh.d054802.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d055499","id":"taxonomy.mesh.concept.mesh.d055499.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d055809","id":"taxonomy.mesh.concept.mesh.d055809.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d055812","id":"taxonomy.mesh.concept.mesh.d055812.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d055990","id":"taxonomy.mesh.concept.mesh.d055990.field.mesh.d032984","parent":"field.mesh.d032984","type":"narrower"},{"child":"concept.mesh.d056146","id":"taxonomy.mesh.concept.mesh.d056146.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d057005","id":"taxonomy.mesh.concept.mesh.d057005.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d057170","id":"taxonomy.mesh.concept.mesh.d057170.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d057172","id":"taxonomy.mesh.concept.mesh.d057172.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d057185","id":"taxonomy.mesh.concept.mesh.d057185.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d057205","id":"taxonomy.mesh.concept.mesh.d057205.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"concept.mesh.d057212","id":"taxonomy.mesh.concept.mesh.d057212.field.mesh.d032984","parent":"field.mesh.d032984","type":"narrower"},{"child":"concept.mesh.d057217","id":"taxonomy.mesh.concept.mesh.d057217.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d057565","id":"taxonomy.mesh.concept.mesh.d057565.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d057766","id":"taxonomy.mesh.concept.mesh.d057766.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d057905","id":"taxonomy.mesh.concept.mesh.d057905.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d057930","id":"taxonomy.mesh.concept.mesh.d057930.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d058011","id":"taxonomy.mesh.concept.mesh.d058011.concept.mesh.d000098405","parent":"concept.mesh.d000098405","type":"narrower"},{"child":"concept.mesh.d058028","id":"taxonomy.mesh.concept.mesh.d058028.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d058345","id":"taxonomy.mesh.concept.mesh.d058345.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d058433","id":"taxonomy.mesh.concept.mesh.d058433.concept.mesh.d019149","parent":"concept.mesh.d019149","type":"narrower"},{"child":"concept.mesh.d058443","id":"taxonomy.mesh.concept.mesh.d058443.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d058634","id":"taxonomy.mesh.concept.mesh.d058634.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"concept.mesh.d058996","id":"taxonomy.mesh.concept.mesh.d058996.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d058999","id":"taxonomy.mesh.concept.mesh.d058999.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d059021","id":"taxonomy.mesh.concept.mesh.d059021.concept.mesh.d011786","parent":"concept.mesh.d011786","type":"narrower"},{"child":"concept.mesh.d059066","id":"taxonomy.mesh.concept.mesh.d059066.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d059413","id":"taxonomy.mesh.concept.mesh.d059413.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060085","id":"taxonomy.mesh.concept.mesh.d060085.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060326","id":"taxonomy.mesh.concept.mesh.d060326.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"concept.mesh.d060327","id":"taxonomy.mesh.concept.mesh.d060327.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d060388","id":"taxonomy.mesh.concept.mesh.d060388.concept.mesh.d000069553","parent":"concept.mesh.d000069553","type":"narrower"},{"child":"concept.mesh.d060685","id":"taxonomy.mesh.concept.mesh.d060685.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d060737","id":"taxonomy.mesh.concept.mesh.d060737.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060845","id":"taxonomy.mesh.concept.mesh.d060845.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d060846","id":"taxonomy.mesh.concept.mesh.d060846.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"concept.mesh.d060847","id":"taxonomy.mesh.concept.mesh.d060847.concept.mesh.d060846","parent":"concept.mesh.d060846","type":"narrower"},{"child":"concept.mesh.d060986","id":"taxonomy.mesh.concept.mesh.d060986.concept.mesh.d014881","parent":"concept.mesh.d014881","type":"narrower"},{"child":"concept.mesh.d061148","id":"taxonomy.mesh.concept.mesh.d061148.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d061565","id":"taxonomy.mesh.concept.mesh.d061565.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d062028","id":"taxonomy.mesh.concept.mesh.d062028.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"concept.mesh.d062069","id":"taxonomy.mesh.concept.mesh.d062069.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d063369","id":"taxonomy.mesh.concept.mesh.d063369.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d063426","id":"taxonomy.mesh.concept.mesh.d063426.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d063586","id":"taxonomy.mesh.concept.mesh.d063586.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d064226","id":"taxonomy.mesh.concept.mesh.d064226.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d064423","id":"taxonomy.mesh.concept.mesh.d064423.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d064424","id":"taxonomy.mesh.concept.mesh.d064424.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d064890","id":"taxonomy.mesh.concept.mesh.d064890.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d065287","id":"taxonomy.mesh.concept.mesh.d065287.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.mesh.d065840","id":"taxonomy.mesh.concept.mesh.d065840.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d066279","id":"taxonomy.mesh.concept.mesh.d066279.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d066288","id":"taxonomy.mesh.concept.mesh.d066288.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d066296","id":"taxonomy.mesh.concept.mesh.d066296.concept.mesh.d036262","parent":"concept.mesh.d036262","type":"narrower"},{"child":"concept.mesh.d066330","id":"taxonomy.mesh.concept.mesh.d066330.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.astronomy","id":"taxonomy.mesh.field.astronomy.field.physics","parent":"field.physics","type":"narrower"},{"child":"field.mesh.d000066949","id":"taxonomy.mesh.field.mesh.d000066949.concept.mesh.d035841","parent":"concept.mesh.d035841","type":"narrower"},{"child":"field.mesh.d000067568","id":"taxonomy.mesh.field.mesh.d000067568.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000068936","id":"taxonomy.mesh.field.mesh.d000068936.field.mesh.d057285","parent":"field.mesh.d057285","type":"narrower"},{"child":"field.mesh.d000070316","id":"taxonomy.mesh.field.mesh.d000070316.field.mesh.d004635","parent":"field.mesh.d004635","type":"narrower"},{"child":"field.mesh.d000071077","id":"taxonomy.mesh.field.mesh.d000071077.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d000073316","id":"taxonomy.mesh.field.mesh.d000073316.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000073320","id":"taxonomy.mesh.field.mesh.d000073320.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d000074266","id":"taxonomy.mesh.field.mesh.d000074266.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000075863","id":"taxonomy.mesh.field.mesh.d000075863.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d000076227","id":"taxonomy.mesh.field.mesh.d000076227.concept.mesh.d066330","parent":"concept.mesh.d066330","type":"narrower"},{"child":"field.mesh.d000077283","id":"taxonomy.mesh.field.mesh.d000077283.field.psychology","parent":"field.psychology","type":"narrower"},{"child":"field.mesh.d000078782","id":"taxonomy.mesh.field.mesh.d000078782.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000079203","id":"taxonomy.mesh.field.mesh.d000079203.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000079645","id":"taxonomy.mesh.field.mesh.d000079645.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000080029","id":"taxonomy.mesh.field.mesh.d000080029.concept.mesh.d055812","parent":"concept.mesh.d055812","type":"narrower"},{"child":"field.mesh.d000080048","id":"taxonomy.mesh.field.mesh.d000080048.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"field.mesh.d000081230","id":"taxonomy.mesh.field.mesh.d000081230.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d000082222","id":"taxonomy.mesh.field.mesh.d000082222.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000084542","id":"taxonomy.mesh.field.mesh.d000084542.field.mesh.d055095","parent":"field.mesh.d055095","type":"narrower"},{"child":"field.mesh.d000085843","id":"taxonomy.mesh.field.mesh.d000085843.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d000085844","id":"taxonomy.mesh.field.mesh.d000085844.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d000088744","id":"taxonomy.mesh.field.mesh.d000088744.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d000089323","id":"taxonomy.mesh.field.mesh.d000089323.field.mesh.d005853","parent":"field.mesh.d005853","type":"narrower"},{"child":"field.mesh.d000089862","id":"taxonomy.mesh.field.mesh.d000089862.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"field.mesh.d000095024","id":"taxonomy.mesh.field.mesh.d000095024.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d000095763","id":"taxonomy.mesh.field.mesh.d000095763.field.mesh.d000486","parent":"field.mesh.d000486","type":"narrower"},{"child":"field.mesh.d000096725","id":"taxonomy.mesh.field.mesh.d000096725.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d000097562","id":"taxonomy.mesh.field.mesh.d000097562.ology.cardiology","parent":"ology.cardiology","type":"narrower"},{"child":"field.mesh.d000099051","id":"taxonomy.mesh.field.mesh.d000099051.field.mesh.d009326","parent":"field.mesh.d009326","type":"narrower"},{"child":"field.mesh.d000099079","id":"taxonomy.mesh.field.mesh.d000099079.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000295","id":"taxonomy.mesh.field.mesh.d000295.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000296","id":"taxonomy.mesh.field.mesh.d000296.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d000337","id":"taxonomy.mesh.field.mesh.d000337.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000486","id":"taxonomy.mesh.field.mesh.d000486.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000776","id":"taxonomy.mesh.field.mesh.d000776.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d001154","id":"taxonomy.mesh.field.mesh.d001154.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d001255","id":"taxonomy.mesh.field.mesh.d001255.concept.mesh.d009781","parent":"concept.mesh.d009781","type":"narrower"},{"child":"field.mesh.d001524","id":"taxonomy.mesh.field.mesh.d001524.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d001675","id":"taxonomy.mesh.field.mesh.d001675.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d001689","id":"taxonomy.mesh.field.mesh.d001689.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d002665","id":"taxonomy.mesh.field.mesh.d002665.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d002834","id":"taxonomy.mesh.field.mesh.d002834.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"field.mesh.d003107","id":"taxonomy.mesh.field.mesh.d003107.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d003154","id":"taxonomy.mesh.field.mesh.d003154.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d003158","id":"taxonomy.mesh.field.mesh.d003158.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d003416","id":"taxonomy.mesh.field.mesh.d003416.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"field.mesh.d004635","id":"taxonomy.mesh.field.mesh.d004635.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d004954","id":"taxonomy.mesh.field.mesh.d004954.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d004989","id":"taxonomy.mesh.field.mesh.d004989.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"field.mesh.d004990","id":"taxonomy.mesh.field.mesh.d004990.field.mesh.d010685","parent":"field.mesh.d010685","type":"narrower"},{"child":"field.mesh.d004991","id":"taxonomy.mesh.field.mesh.d004991.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d004993","id":"taxonomy.mesh.field.mesh.d004993.field.mesh.d010687","parent":"field.mesh.d010687","type":"narrower"},{"child":"field.mesh.d004995","id":"taxonomy.mesh.field.mesh.d004995.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d005053","id":"taxonomy.mesh.field.mesh.d005053.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d005191","id":"taxonomy.mesh.field.mesh.d005191.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"field.mesh.d005194","id":"taxonomy.mesh.field.mesh.d005194.field.mesh.d058006","parent":"field.mesh.d058006","type":"narrower"},{"child":"field.mesh.d005554","id":"taxonomy.mesh.field.mesh.d005554.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d005555","id":"taxonomy.mesh.field.mesh.d005555.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d005826","id":"taxonomy.mesh.field.mesh.d005826.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d005852","id":"taxonomy.mesh.field.mesh.d005852.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d005853","id":"taxonomy.mesh.field.mesh.d005853.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d006663","id":"taxonomy.mesh.field.mesh.d006663.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d006664","id":"taxonomy.mesh.field.mesh.d006664.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d006666","id":"taxonomy.mesh.field.mesh.d006666.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d006804","id":"taxonomy.mesh.field.mesh.d006804.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"field.mesh.d007120","id":"taxonomy.mesh.field.mesh.d007120.field.mesh.d000486","parent":"field.mesh.d000486","type":"narrower"},{"child":"field.mesh.d007218","id":"taxonomy.mesh.field.mesh.d007218.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d007388","id":"taxonomy.mesh.field.mesh.d007388.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d008091","id":"taxonomy.mesh.field.mesh.d008091.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d008092","id":"taxonomy.mesh.field.mesh.d008092.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008093","id":"taxonomy.mesh.field.mesh.d008093.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008495","id":"taxonomy.mesh.field.mesh.d008495.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d008513","id":"taxonomy.mesh.field.mesh.d008513.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008678","id":"taxonomy.mesh.field.mesh.d008678.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d008887","id":"taxonomy.mesh.field.mesh.d008887.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d008890","id":"taxonomy.mesh.field.mesh.d008890.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d009146","id":"taxonomy.mesh.field.mesh.d009146.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d009229","id":"taxonomy.mesh.field.mesh.d009229.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d009326","id":"taxonomy.mesh.field.mesh.d009326.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d009493","id":"taxonomy.mesh.field.mesh.d009493.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d009683","id":"taxonomy.mesh.field.mesh.d009683.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d009717","id":"taxonomy.mesh.field.mesh.d009717.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"field.mesh.d009774","id":"taxonomy.mesh.field.mesh.d009774.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d009985","id":"taxonomy.mesh.field.mesh.d009985.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d010021","id":"taxonomy.mesh.field.mesh.d010021.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d010036","id":"taxonomy.mesh.field.mesh.d010036.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d010338","id":"taxonomy.mesh.field.mesh.d010338.ology.pathology","parent":"ology.pathology","type":"narrower"},{"child":"field.mesh.d010340","id":"taxonomy.mesh.field.mesh.d010340.ology.pathology","parent":"ology.pathology","type":"narrower"},{"child":"field.mesh.d010372","id":"taxonomy.mesh.field.mesh.d010372.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d010500","id":"taxonomy.mesh.field.mesh.d010500.field.mesh.d010372","parent":"field.mesh.d010372","type":"narrower"},{"child":"field.mesh.d010681","id":"taxonomy.mesh.field.mesh.d010681.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010682","id":"taxonomy.mesh.field.mesh.d010682.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010683","id":"taxonomy.mesh.field.mesh.d010683.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010685","id":"taxonomy.mesh.field.mesh.d010685.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010686","id":"taxonomy.mesh.field.mesh.d010686.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010687","id":"taxonomy.mesh.field.mesh.d010687.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010792","id":"taxonomy.mesh.field.mesh.d010792.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d010810","id":"taxonomy.mesh.field.mesh.d010810.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d011057","id":"taxonomy.mesh.field.mesh.d011057.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"field.mesh.d011157","id":"taxonomy.mesh.field.mesh.d011157.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"field.mesh.d011315","id":"taxonomy.mesh.field.mesh.d011315.field.mesh.d011634","parent":"field.mesh.d011634","type":"narrower"},{"child":"field.mesh.d011316","id":"taxonomy.mesh.field.mesh.d011316.field.mesh.d003158","parent":"field.mesh.d003158","type":"narrower"},{"child":"field.mesh.d011570","id":"taxonomy.mesh.field.mesh.d011570.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d011593","id":"taxonomy.mesh.field.mesh.d011593.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"field.mesh.d011634","id":"taxonomy.mesh.field.mesh.d011634.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d012067","id":"taxonomy.mesh.field.mesh.d012067.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d012068","id":"taxonomy.mesh.field.mesh.d012068.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012069","id":"taxonomy.mesh.field.mesh.d012069.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012070","id":"taxonomy.mesh.field.mesh.d012070.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012371","id":"taxonomy.mesh.field.mesh.d012371.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"field.mesh.d012936","id":"taxonomy.mesh.field.mesh.d012936.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d012962","id":"taxonomy.mesh.field.mesh.d012962.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"field.mesh.d013043","id":"taxonomy.mesh.field.mesh.d013043.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d013178","id":"taxonomy.mesh.field.mesh.d013178.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d013366","id":"taxonomy.mesh.field.mesh.d013366.field.mesh.d009326","parent":"field.mesh.d009326","type":"narrower"},{"child":"field.mesh.d013502","id":"taxonomy.mesh.field.mesh.d013502.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d013518","id":"taxonomy.mesh.field.mesh.d013518.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d013674","id":"taxonomy.mesh.field.mesh.d013674.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013677","id":"taxonomy.mesh.field.mesh.d013677.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013678","id":"taxonomy.mesh.field.mesh.d013678.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013679","id":"taxonomy.mesh.field.mesh.d013679.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013903","id":"taxonomy.mesh.field.mesh.d013903.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d014330","id":"taxonomy.mesh.field.mesh.d014330.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d014686","id":"taxonomy.mesh.field.mesh.d014686.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d014943","id":"taxonomy.mesh.field.mesh.d014943.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d015272","id":"taxonomy.mesh.field.mesh.d015272.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d015510","id":"taxonomy.mesh.field.mesh.d015510.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d015642","id":"taxonomy.mesh.field.mesh.d015642.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d017711","id":"taxonomy.mesh.field.mesh.d017711.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"field.mesh.d017720","id":"taxonomy.mesh.field.mesh.d017720.field.mesh.d062346","parent":"field.mesh.d062346","type":"narrower"},{"child":"field.mesh.d017891","id":"taxonomy.mesh.field.mesh.d017891.ology.pharmacology","parent":"ology.pharmacology","type":"narrower"},{"child":"field.mesh.d018456","id":"taxonomy.mesh.field.mesh.d018456.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d018732","id":"taxonomy.mesh.field.mesh.d018732.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d018787","id":"taxonomy.mesh.field.mesh.d018787.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d018961","id":"taxonomy.mesh.field.mesh.d018961.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d019021","id":"taxonomy.mesh.field.mesh.d019021.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d019317","id":"taxonomy.mesh.field.mesh.d019317.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d019371","id":"taxonomy.mesh.field.mesh.d019371.field.mesh.d062306","parent":"field.mesh.d062306","type":"narrower"},{"child":"field.mesh.d020811","id":"taxonomy.mesh.field.mesh.d020811.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d026690","id":"taxonomy.mesh.field.mesh.d026690.field.mesh.d001675","parent":"field.mesh.d001675","type":"narrower"},{"child":"field.mesh.d028662","id":"taxonomy.mesh.field.mesh.d028662.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d032701","id":"taxonomy.mesh.field.mesh.d032701.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d032984","id":"taxonomy.mesh.field.mesh.d032984.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d040821","id":"taxonomy.mesh.field.mesh.d040821.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"field.mesh.d040861","id":"taxonomy.mesh.field.mesh.d040861.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d044085","id":"taxonomy.mesh.field.mesh.d044085.field.mesh.d055616","parent":"field.mesh.d055616","type":"narrower"},{"child":"field.mesh.d044707","id":"taxonomy.mesh.field.mesh.d044707.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"field.mesh.d044709","id":"taxonomy.mesh.field.mesh.d044709.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d044968","id":"taxonomy.mesh.field.mesh.d044968.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d049429","id":"taxonomy.mesh.field.mesh.d049429.field.mesh.d005554","parent":"field.mesh.d005554","type":"narrower"},{"child":"field.mesh.d049690","id":"taxonomy.mesh.field.mesh.d049690.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049691","id":"taxonomy.mesh.field.mesh.d049691.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049692","id":"taxonomy.mesh.field.mesh.d049692.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049711","id":"taxonomy.mesh.field.mesh.d049711.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d052938","id":"taxonomy.mesh.field.mesh.d052938.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d053593","id":"taxonomy.mesh.field.mesh.d053593.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d053803","id":"taxonomy.mesh.field.mesh.d053803.field.mesh.d005554","parent":"field.mesh.d005554","type":"narrower"},{"child":"field.mesh.d054597","id":"taxonomy.mesh.field.mesh.d054597.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d054849","id":"taxonomy.mesh.field.mesh.d054849.ology.cardiology","parent":"ology.cardiology","type":"narrower"},{"child":"field.mesh.d055048","id":"taxonomy.mesh.field.mesh.d055048.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d055095","id":"taxonomy.mesh.field.mesh.d055095.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"field.mesh.d055416","id":"taxonomy.mesh.field.mesh.d055416.field.mesh.d019317","parent":"field.mesh.d019317","type":"narrower"},{"child":"field.mesh.d055552","id":"taxonomy.mesh.field.mesh.d055552.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d055616","id":"taxonomy.mesh.field.mesh.d055616.concept.mesh.d008904","parent":"concept.mesh.d008904","type":"narrower"},{"child":"field.mesh.d055772","id":"taxonomy.mesh.field.mesh.d055772.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d055813","id":"taxonomy.mesh.field.mesh.d055813.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d056508","id":"taxonomy.mesh.field.mesh.d056508.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d057089","id":"taxonomy.mesh.field.mesh.d057089.field.mesh.d062346","parent":"field.mesh.d062346","type":"narrower"},{"child":"field.mesh.d057236","id":"taxonomy.mesh.field.mesh.d057236.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d057285","id":"taxonomy.mesh.field.mesh.d057285.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d057909","id":"taxonomy.mesh.field.mesh.d057909.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d058006","id":"taxonomy.mesh.field.mesh.d058006.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d058027","id":"taxonomy.mesh.field.mesh.d058027.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d058615","id":"taxonomy.mesh.field.mesh.d058615.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"field.mesh.d060432","id":"taxonomy.mesh.field.mesh.d060432.field.anthropology","parent":"field.anthropology","type":"narrower"},{"child":"field.mesh.d062306","id":"taxonomy.mesh.field.mesh.d062306.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d062346","id":"taxonomy.mesh.field.mesh.d062346.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d063165","id":"taxonomy.mesh.field.mesh.d063165.ology.neurology","parent":"ology.neurology","type":"narrower"},{"child":"field.mesh.d064132","id":"taxonomy.mesh.field.mesh.d064132.field.mesh.d013178","parent":"field.mesh.d013178","type":"narrower"},{"child":"field.mesh.d064416","id":"taxonomy.mesh.field.mesh.d064416.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d064796","id":"taxonomy.mesh.field.mesh.d064796.field.mesh.d013178","parent":"field.mesh.d013178","type":"narrower"},{"child":"field.mesh.d064826","id":"taxonomy.mesh.field.mesh.d064826.ology.hematology","parent":"ology.hematology","type":"narrower"},{"child":"field.mesh.d065126","id":"taxonomy.mesh.field.mesh.d065126.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d066291","id":"taxonomy.mesh.field.mesh.d066291.field.mesh.d008513","parent":"field.mesh.d008513","type":"narrower"},{"child":"field.systems-biology","id":"taxonomy.mesh.field.systems-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.cognitive-psychology","id":"taxonomy.mesh.ology.cognitive-psychology.field.cognitive-science","parent":"field.cognitive-science","type":"narrower"},{"child":"ology.cryobiology","id":"taxonomy.mesh.ology.cryobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.cytology","id":"taxonomy.mesh.ology.cytology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.embryology","id":"taxonomy.mesh.ology.embryology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.ethnology","id":"taxonomy.mesh.ology.ethnology.field.anthropology","parent":"field.anthropology","type":"narrower"},{"child":"ology.genomics","id":"taxonomy.mesh.ology.genomics.field.genetics","parent":"field.genetics","type":"narrower"},{"child":"ology.glycobiology","id":"taxonomy.mesh.ology.glycobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.neurobiology","id":"taxonomy.mesh.ology.neurobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.neuropathology","id":"taxonomy.mesh.ology.neuropathology.ology.neurology","parent":"ology.neurology","type":"narrower"},{"child":"ology.pharmacognosy","id":"taxonomy.mesh.ology.pharmacognosy.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.proteomics","id":"taxonomy.mesh.ology.proteomics.ology.genomics","parent":"ology.genomics","type":"narrower"},{"child":"ology.psychopharmacology","id":"taxonomy.mesh.ology.psychopharmacology.ology.pharmacology","parent":"ology.pharmacology","type":"narrower"},{"child":"ology.rheology","id":"taxonomy.mesh.ology.rheology.field.physics","parent":"field.physics","type":"narrower"},{"child":"ology.sociobiology","id":"taxonomy.mesh.ology.sociobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.teratology","id":"taxonomy.mesh.ology.teratology.ology.embryology","parent":"ology.embryology","type":"narrower"},{"child":"physical.density-functional-theory","id":"taxonomy.mesh.physical.density-functional-theory.physical.nuclear-physics","parent":"physical.nuclear-physics","type":"narrower"},{"child":"physical.nuclear-physics","id":"taxonomy.mesh.physical.nuclear-physics.field.physics","parent":"field.physics","type":"narrower"},{"child":"physical.quantum-mechanics","id":"taxonomy.mesh.physical.quantum-mechanics.physical.nuclear-physics","parent":"physical.nuclear-physics","type":"narrower"},{"child":"method.nist.ackermann","id":"taxonomy.method.nist.ackermann.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.adaptiveheapsort","id":"taxonomy.method.nist.adaptiveheapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.adaptivehuffman","id":"taxonomy.method.nist.adaptivehuffman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.addresscalc","id":"taxonomy.method.nist.addresscalc.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.ahocorasick","id":"taxonomy.method.nist.ahocorasick.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.algorithmfgk","id":"taxonomy.method.nist.algorithmfgk.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.americanflagsort","id":"taxonomy.method.nist.americanflagsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.arithmeticcoding","id":"taxonomy.method.nist.arithmeticcoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.arraymerg","id":"taxonomy.method.nist.arraymerg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balanc2wayms","id":"taxonomy.method.nist.balanc2wayms.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balancedqsrt","id":"taxonomy.method.nist.balancedqsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balanckwayms","id":"taxonomy.method.nist.balanckwayms.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balancmrgsrt","id":"taxonomy.method.nist.balancmrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.baumwelch","id":"taxonomy.method.nist.baumwelch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bbp","id":"taxonomy.method.nist.bbp.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bellmanford","id":"taxonomy.method.nist.bellmanford.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bestfirst","id":"taxonomy.method.nist.bestfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bidirectionalbubblesort","id":"taxonomy.method.nist.bidirectionalbubblesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.binaryinsort","id":"taxonomy.method.nist.binaryinsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.binarysearch","id":"taxonomy.method.nist.binarysearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bingosort","id":"taxonomy.method.nist.bingosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bitonicsort","id":"taxonomy.method.nist.bitonicsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.blindsort","id":"taxonomy.method.nist.blindsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bogosort","id":"taxonomy.method.nist.bogosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bondseqsearch","id":"taxonomy.method.nist.bondseqsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boruvkasalgorithm","id":"taxonomy.method.nist.boruvkasalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boyermoore","id":"taxonomy.method.nist.boyermoore.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boyermoorehorspool","id":"taxonomy.method.nist.boyermoorehorspool.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bozosort","id":"taxonomy.method.nist.bozosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.breadthfirst","id":"taxonomy.method.nist.breadthfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bresenham","id":"taxonomy.method.nist.bresenham.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bruteforcestringsearch","id":"taxonomy.method.nist.bruteforcestringsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bruteforcestrsrchwmismatch","id":"taxonomy.method.nist.bruteforcestrsrchwmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bubblesort","id":"taxonomy.method.nist.bubblesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bucketsort","id":"taxonomy.method.nist.bucketsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.buddysystem","id":"taxonomy.method.nist.buddysystem.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.buildheap","id":"taxonomy.method.nist.buildheap.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.burrowswheelertransform","id":"taxonomy.method.nist.burrowswheelertransform.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.caverphone","id":"taxonomy.method.nist.caverphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.chinesermndr","id":"taxonomy.method.nist.chinesermndr.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.christofides","id":"taxonomy.method.nist.christofides.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.collisionres","id":"taxonomy.method.nist.collisionres.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.combination","id":"taxonomy.method.nist.combination.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.combsort","id":"taxonomy.method.nist.combsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.commentzwalter","id":"taxonomy.method.nist.commentzwalter.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.cordic","id":"taxonomy.method.nist.cordic.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.countingsort","id":"taxonomy.method.nist.countingsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.cyclicredundancycheck","id":"taxonomy.method.nist.cyclicredundancycheck.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dagshortpath","id":"taxonomy.method.nist.dagshortpath.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.depthfirst","id":"taxonomy.method.nist.depthfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.derangement","id":"taxonomy.method.nist.derangement.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.determfinitautsrch","id":"taxonomy.method.nist.determfinitautsrch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.deutschjozsaalgo","id":"taxonomy.method.nist.deutschjozsaalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dijkstraalgo","id":"taxonomy.method.nist.dijkstraalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.diminishingincsort","id":"taxonomy.method.nist.diminishingincsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.distributionsort","id":"taxonomy.method.nist.distributionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.distributivepartitioningsort","id":"taxonomy.method.nist.distributivepartitioningsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doomsday","id":"taxonomy.method.nist.doomsday.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doublehashng","id":"taxonomy.method.nist.doublehashng.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doublemetaphone","id":"taxonomy.method.nist.doublemetaphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dualpivotquicksort","id":"taxonomy.method.nist.dualpivotquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.euclidalgo","id":"taxonomy.method.nist.euclidalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.extendeuclid","id":"taxonomy.method.nist.extendeuclid.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalmemoryalgo","id":"taxonomy.method.nist.externalmemoryalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalmerg","id":"taxonomy.method.nist.externalmerg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalquicksort","id":"taxonomy.method.nist.externalquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fastfouriertransform","id":"taxonomy.method.nist.fastfouriertransform.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fibonacciansearch","id":"taxonomy.method.nist.fibonacciansearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.find","id":"taxonomy.method.nist.find.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.floydwarshall","id":"taxonomy.method.nist.floydwarshall.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fordfulkerson","id":"taxonomy.method.nist.fordfulkerson.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.frequencycounthueristic","id":"taxonomy.method.nist.frequencycounthueristic.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.gnomesort","id":"taxonomy.method.nist.gnomesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.greatestcommondivisor","id":"taxonomy.method.nist.greatestcommondivisor.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hash","id":"taxonomy.method.nist.hash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hashtabdelet","id":"taxonomy.method.nist.hashtabdelet.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.heapify","id":"taxonomy.method.nist.heapify.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.heapsort","id":"taxonomy.method.nist.heapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.histogramsort","id":"taxonomy.method.nist.histogramsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hsadelta","id":"taxonomy.method.nist.hsadelta.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.huffmancoding","id":"taxonomy.method.nist.huffmancoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.idealmerge","id":"taxonomy.method.nist.idealmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.idealrandomshuffle","id":"taxonomy.method.nist.idealrandomshuffle.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.inordertraversal","id":"taxonomy.method.nist.inordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.inplacesort","id":"taxonomy.method.nist.inplacesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.insertionsort","id":"taxonomy.method.nist.insertionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.interpolationsearch","id":"taxonomy.method.nist.interpolationsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.interpsequen","id":"taxonomy.method.nist.interpsequen.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.introspectivesort","id":"taxonomy.method.nist.introspectivesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.j_sort","id":"taxonomy.method.nist.j_sort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jarowinkler","id":"taxonomy.method.nist.jarowinkler.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.johnsonsalgorithm","id":"taxonomy.method.nist.johnsonsalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.johnsontrotter","id":"taxonomy.method.nist.johnsontrotter.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jsort","id":"taxonomy.method.nist.jsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jumpsearch","id":"taxonomy.method.nist.jumpsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karnaughmap","id":"taxonomy.method.nist.karnaughmap.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karprabin","id":"taxonomy.method.nist.karprabin.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karyhuffman","id":"taxonomy.method.nist.karyhuffman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.knuthmorrispratt","id":"taxonomy.method.nist.knuthmorrispratt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.kruskalsalgo","id":"taxonomy.method.nist.kruskalsalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.kwaymergesort","id":"taxonomy.method.nist.kwaymergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.lcfshashing","id":"taxonomy.method.nist.lcfshashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.leftrotation","id":"taxonomy.method.nist.leftrotation.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.lempelzivwelch","id":"taxonomy.method.nist.lempelzivwelch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.levelordertraversal","id":"taxonomy.method.nist.levelordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.linearhash","id":"taxonomy.method.nist.linearhash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.linearsearch","id":"taxonomy.method.nist.linearsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.localitysensitivehashing","id":"taxonomy.method.nist.localitysensitivehashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.luckysort","id":"taxonomy.method.nist.luckysort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.malhotrakumr","id":"taxonomy.method.nist.malhotrakumr.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.mergesort","id":"taxonomy.method.nist.mergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.metaphone","id":"taxonomy.method.nist.metaphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.minimalperfecthash","id":"taxonomy.method.nist.minimalperfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.minimax","id":"taxonomy.method.nist.minimax.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.modelcheckng","id":"taxonomy.method.nist.modelcheckng.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.modifind","id":"taxonomy.method.nist.modifind.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.movefront","id":"taxonomy.method.nist.movefront.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.movetoroot","id":"taxonomy.method.nist.movetoroot.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.multikeyquicksort","id":"taxonomy.method.nist.multikeyquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.multiprefix","id":"taxonomy.method.nist.multiprefix.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.munkresassignment","id":"taxonomy.method.nist.munkresassignment.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.nonbalncmsrt","id":"taxonomy.method.nist.nonbalncmsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.nysiis","id":"taxonomy.method.nist.nysiis.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.openaddressing","id":"taxonomy.method.nist.openaddressing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimalmismatch","id":"taxonomy.method.nist.optimalmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimalpolyphasemergesort","id":"taxonomy.method.nist.optimalpolyphasemergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimpolymrg","id":"taxonomy.method.nist.optimpolymrg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.orderpreservinghuffmancoding","id":"taxonomy.method.nist.orderpreservinghuffmancoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.orderpreservminperfecthash","id":"taxonomy.method.nist.orderpreservminperfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.oscillatingmergesort","id":"taxonomy.method.nist.oscillatingmergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pearsonshash","id":"taxonomy.method.nist.pearsonshash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.perfecthash","id":"taxonomy.method.nist.perfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.perfectshuffle","id":"taxonomy.method.nist.perfectshuffle.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.permutation","id":"taxonomy.method.nist.permutation.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.permutationsort","id":"taxonomy.method.nist.permutationsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pigeonholesort","id":"taxonomy.method.nist.pigeonholesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.polyphmerge","id":"taxonomy.method.nist.polyphmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.polyphmrgsrt","id":"taxonomy.method.nist.polyphmrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.postmansort","id":"taxonomy.method.nist.postmansort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.postordertraversal","id":"taxonomy.method.nist.postordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.preordertraversal","id":"taxonomy.method.nist.preordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.primjarnik","id":"taxonomy.method.nist.primjarnik.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pseudorandomnumbergen","id":"taxonomy.method.nist.pseudorandomnumbergen.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.qsort","id":"taxonomy.method.nist.qsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quadraticprb","id":"taxonomy.method.nist.quadraticprb.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quicksearch","id":"taxonomy.method.nist.quicksearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quicksort","id":"taxonomy.method.nist.quicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.radixsort","id":"taxonomy.method.nist.radixsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.randomizdrnd","id":"taxonomy.method.nist.randomizdrnd.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.randomsearch","id":"taxonomy.method.nist.randomsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rangesort","id":"taxonomy.method.nist.rangesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rapidsort","id":"taxonomy.method.nist.rapidsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.ratcliffobershelp","id":"taxonomy.method.nist.ratcliffobershelp.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rebalance","id":"taxonomy.method.nist.rebalance.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.repeatedsquaring","id":"taxonomy.method.nist.repeatedsquaring.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.reservoirsampling","id":"taxonomy.method.nist.reservoirsampling.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rightrotatn","id":"taxonomy.method.nist.rightrotatn.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.robinhoodhashing","id":"taxonomy.method.nist.robinhoodhashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.scan","id":"taxonomy.method.nist.scan.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.scapegoattree","id":"taxonomy.method.nist.scapegoattree.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.search","id":"taxonomy.method.nist.search.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.secantsearch","id":"taxonomy.method.nist.secantsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.select","id":"taxonomy.method.nist.select.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.selectionsort","id":"taxonomy.method.nist.selectionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.selectmode","id":"taxonomy.method.nist.selectmode.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shadowmerge","id":"taxonomy.method.nist.shadowmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shadowmrgins","id":"taxonomy.method.nist.shadowmrgins.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shannonfano","id":"taxonomy.method.nist.shannonfano.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shellsort","id":"taxonomy.method.nist.shellsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shiftor","id":"taxonomy.method.nist.shiftor.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shufflesort","id":"taxonomy.method.nist.shufflesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.sieve","id":"taxonomy.method.nist.sieve.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.siftup","id":"taxonomy.method.nist.siftup.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.simplemerge","id":"taxonomy.method.nist.simplemerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.simulatedannealing","id":"taxonomy.method.nist.simulatedannealing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smithalgorithm","id":"taxonomy.method.nist.smithalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smithwaterman","id":"taxonomy.method.nist.smithwaterman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smoothsort","id":"taxonomy.method.nist.smoothsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.sort","id":"taxonomy.method.nist.sort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.soundex","id":"taxonomy.method.nist.soundex.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.spaceorderingmethod","id":"taxonomy.method.nist.spaceorderingmethod.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.starencoding","id":"taxonomy.method.nist.starencoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stoogesort","id":"taxonomy.method.nist.stoogesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.strandsort","id":"taxonomy.method.nist.strandsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stringmatchwerror","id":"taxonomy.method.nist.stringmatchwerror.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stringmatchwmismatch","id":"taxonomy.method.nist.stringmatchwmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.strsrch","id":"taxonomy.method.nist.strsrch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stupidsort","id":"taxonomy.method.nist.stupidsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.threewaymsrt","id":"taxonomy.method.nist.threewaymsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.topdownradixsort","id":"taxonomy.method.nist.topdownradixsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.tournament","id":"taxonomy.method.nist.tournament.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.transposeseqsearch","id":"taxonomy.method.nist.transposeseqsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.treesort1","id":"taxonomy.method.nist.treesort1.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.treesort2","id":"taxonomy.method.nist.treesort2.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.tripartition","id":"taxonomy.method.nist.tripartition.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.twoway","id":"taxonomy.method.nist.twoway.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.twowaymrgsrt","id":"taxonomy.method.nist.twowaymrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unbiasedcoinflipalgo","id":"taxonomy.method.nist.unbiasedcoinflipalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.uniformhashn","id":"taxonomy.method.nist.uniformhashn.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unionautoma","id":"taxonomy.method.nist.unionautoma.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unrank","id":"taxonomy.method.nist.unrank.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unshufflsort","id":"taxonomy.method.nist.unshufflsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.viterbialgorithm","id":"taxonomy.method.nist.viterbialgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.vittersalgorithm","id":"taxonomy.method.nist.vittersalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.weakheapsort","id":"taxonomy.method.nist.weakheapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.zellerscongruence","id":"taxonomy.method.nist.zellerscongruence.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.zhutakaoka","id":"taxonomy.method.nist.zhutakaoka.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"physical.astrophysics","id":"taxonomy.physical.astrophysics.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"physical.exoplanet-transit-method","id":"taxonomy.physical.exoplanet-transit-method.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"concept.aat.300015649","id":"taxonomy.place.concept.aat.300015649.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300015690","id":"taxonomy.place.concept.aat.300015690.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300018773","id":"taxonomy.place.concept.aat.300018773.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300018775","id":"taxonomy.place.concept.aat.300018775.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018777","id":"taxonomy.place.concept.aat.300018777.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018778","id":"taxonomy.place.concept.aat.300018778.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018779","id":"taxonomy.place.concept.aat.300018779.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018803","id":"taxonomy.place.concept.aat.300018803.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300054140","id":"taxonomy.place.concept.aat.300054140.concept.aat.300175240","parent":"concept.aat.300175240","type":"narrower"},{"child":"concept.aat.300054154","id":"taxonomy.place.concept.aat.300054154.concept.aat.300175240","parent":"concept.aat.300175240","type":"narrower"},{"child":"concept.aat.300054156","id":"taxonomy.place.concept.aat.300054156.concept.aat.300054154","parent":"concept.aat.300054154","type":"narrower"},{"child":"concept.aat.300054159","id":"taxonomy.place.concept.aat.300054159.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300054171","id":"taxonomy.place.concept.aat.300054171.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300054181","id":"taxonomy.place.concept.aat.300054181.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054183","id":"taxonomy.place.concept.aat.300054183.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054184","id":"taxonomy.place.concept.aat.300054184.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054269","id":"taxonomy.place.concept.aat.300054269.concept.aat.300263250","parent":"concept.aat.300263250","type":"narrower"},{"child":"concept.aat.300054299","id":"taxonomy.place.concept.aat.300054299.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.aat.300054300","id":"taxonomy.place.concept.aat.300054300.concept.aat.300054299","parent":"concept.aat.300054299","type":"narrower"},{"child":"concept.aat.300054302","id":"taxonomy.place.concept.aat.300054302.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054303","id":"taxonomy.place.concept.aat.300054303.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054304","id":"taxonomy.place.concept.aat.300054304.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054305","id":"taxonomy.place.concept.aat.300054305.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054306","id":"taxonomy.place.concept.aat.300054306.concept.aat.300054299","parent":"concept.aat.300054299","type":"narrower"},{"child":"concept.aat.300055938","id":"taxonomy.place.concept.aat.300055938.concept.aat.300055126","parent":"concept.aat.300055126","type":"narrower"},{"child":"concept.aat.300055939","id":"taxonomy.place.concept.aat.300055939.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300055959","id":"taxonomy.place.concept.aat.300055959.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300055980","id":"taxonomy.place.concept.aat.300055980.concept.aat.300055126","parent":"concept.aat.300055126","type":"narrower"},{"child":"concept.aat.300069390","id":"taxonomy.place.concept.aat.300069390.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300108565","id":"taxonomy.place.concept.aat.300108565.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300108572","id":"taxonomy.place.concept.aat.300108572.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300113090","id":"taxonomy.place.concept.aat.300113090.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300116922","id":"taxonomy.place.concept.aat.300116922.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300137365","id":"taxonomy.place.concept.aat.300137365.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.aat.300137410","id":"taxonomy.place.concept.aat.300137410.concept.aat.300137365","parent":"concept.aat.300137365","type":"narrower"},{"child":"concept.aat.300138708","id":"taxonomy.place.concept.aat.300138708.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300145966","id":"taxonomy.place.concept.aat.300145966.concept.aat.300055980","parent":"concept.aat.300055980","type":"narrower"},{"child":"concept.aat.300157724","id":"taxonomy.place.concept.aat.300157724.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300161596","id":"taxonomy.place.concept.aat.300161596.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300163423","id":"taxonomy.place.concept.aat.300163423.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300189645","id":"taxonomy.place.concept.aat.300189645.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300260338","id":"taxonomy.place.concept.aat.300260338.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300262588","id":"taxonomy.place.concept.aat.300262588.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300262640","id":"taxonomy.place.concept.aat.300262640.concept.aat.300266481","parent":"concept.aat.300266481","type":"narrower"},{"child":"concept.aat.300263250","id":"taxonomy.place.concept.aat.300263250.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"concept.aat.300264368","id":"taxonomy.place.concept.aat.300264368.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300266054","id":"taxonomy.place.concept.aat.300266054.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300266367","id":"taxonomy.place.concept.aat.300266367.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300266573","id":"taxonomy.place.concept.aat.300266573.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300311925","id":"taxonomy.place.concept.aat.300311925.concept.aat.300054154","parent":"concept.aat.300054154","type":"narrower"},{"child":"concept.aat.300312347","id":"taxonomy.place.concept.aat.300312347.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.aat.300343751","id":"taxonomy.place.concept.aat.300343751.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300375660","id":"taxonomy.place.concept.aat.300375660.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300386953","id":"taxonomy.place.concept.aat.300386953.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300389795","id":"taxonomy.place.concept.aat.300389795.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300417578","id":"taxonomy.place.concept.aat.300417578.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417580","id":"taxonomy.place.concept.aat.300417580.concept.aat.300417584","parent":"concept.aat.300417584","type":"narrower"},{"child":"concept.aat.300417581","id":"taxonomy.place.concept.aat.300417581.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417584","id":"taxonomy.place.concept.aat.300417584.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417616","id":"taxonomy.place.concept.aat.300417616.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300417661","id":"taxonomy.place.concept.aat.300417661.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300417674","id":"taxonomy.place.concept.aat.300417674.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300417961","id":"taxonomy.place.concept.aat.300417961.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300435123","id":"taxonomy.place.concept.aat.300435123.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435128","id":"taxonomy.place.concept.aat.300435128.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435227","id":"taxonomy.place.concept.aat.300435227.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435243","id":"taxonomy.place.concept.aat.300435243.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300447138","id":"taxonomy.place.concept.aat.300447138.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300457792","id":"taxonomy.place.concept.aat.300457792.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.go.go0006955","id":"taxonomy.place.concept.go.go0006955.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.mesh.d000067495","id":"taxonomy.place.concept.mesh.d000067495.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000073931","id":"taxonomy.place.concept.mesh.d000073931.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000078331","id":"taxonomy.place.concept.mesh.d000078331.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"concept.mesh.d000082742","id":"taxonomy.place.concept.mesh.d000082742.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000086825","id":"taxonomy.place.concept.mesh.d000086825.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d000096442","id":"taxonomy.place.concept.mesh.d000096442.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000098463","id":"taxonomy.place.concept.mesh.d000098463.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d004779","id":"taxonomy.place.concept.mesh.d004779.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d004924","id":"taxonomy.place.concept.mesh.d004924.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d005247","id":"taxonomy.place.concept.mesh.d005247.concept.mesh.d001522","parent":"concept.mesh.d001522","type":"narrower"},{"child":"concept.mesh.d009042","id":"taxonomy.place.concept.mesh.d009042.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d012148","id":"taxonomy.place.concept.mesh.d012148.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d012749","id":"taxonomy.place.concept.mesh.d012749.concept.mesh.d003141","parent":"concept.mesh.d003141","type":"narrower"},{"child":"concept.mesh.d017143","id":"taxonomy.place.concept.mesh.d017143.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d035082","id":"taxonomy.place.concept.mesh.d035082.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d057226","id":"taxonomy.place.concept.mesh.d057226.concept.mesh.d003142","parent":"concept.mesh.d003142","type":"narrower"},{"child":"concept.nist.acyclicgraph","id":"taxonomy.place.concept.nist.acyclicgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.adjacent","id":"taxonomy.place.concept.nist.adjacent.concept.nist.binaryrelation","parent":"concept.nist.binaryrelation","type":"narrower"},{"child":"concept.nist.alternation","id":"taxonomy.place.concept.nist.alternation.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.alternatngtr","id":"taxonomy.place.concept.nist.alternatngtr.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.alterntngpth","id":"taxonomy.place.concept.nist.alterntngpth.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.arborescence","id":"taxonomy.place.concept.nist.arborescence.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.biconnectedgraph","id":"taxonomy.place.concept.nist.biconnectedgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.binaryfunc","id":"taxonomy.place.concept.nist.binaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.binaryrelation","id":"taxonomy.place.concept.nist.binaryrelation.concept.nist.relation","parent":"concept.nist.relation","type":"narrower"},{"child":"concept.nist.bipartgraph","id":"taxonomy.place.concept.nist.bipartgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.bipartmatch","id":"taxonomy.place.concept.nist.bipartmatch.concept.nist.perfectmatch","parent":"concept.nist.perfectmatch","type":"narrower"},{"child":"concept.nist.booleanfnctn","id":"taxonomy.place.concept.nist.booleanfnctn.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.bpp","id":"taxonomy.place.concept.nist.bpp.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.bucket","id":"taxonomy.place.concept.nist.bucket.concept.nist.bag","parent":"concept.nist.bag","type":"narrower"},{"child":"concept.nist.canonical","id":"taxonomy.place.concept.nist.canonical.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.cellprobemodel","id":"taxonomy.place.concept.nist.cellprobemodel.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.cellulartmtn","id":"taxonomy.place.concept.nist.cellulartmtn.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.clique","id":"taxonomy.place.concept.nist.clique.concept.nist.completegraph","parent":"concept.nist.completegraph","type":"narrower"},{"child":"concept.nist.compactdatastruct","id":"taxonomy.place.concept.nist.compactdatastruct.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completegraph","id":"taxonomy.place.concept.nist.completegraph.concept.nist.undirectedgraph","parent":"concept.nist.undirectedgraph","type":"narrower"},{"child":"concept.nist.concurrentdatastructure","id":"taxonomy.place.concept.nist.concurrentdatastructure.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.confluentlypersistdata","id":"taxonomy.place.concept.nist.confluentlypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.connectedgraph","id":"taxonomy.place.concept.nist.connectedgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.constantfunc","id":"taxonomy.place.concept.nist.constantfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.cutvertex","id":"taxonomy.place.concept.nist.cutvertex.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.cycle","id":"taxonomy.place.concept.nist.cycle.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.densegraph","id":"taxonomy.place.concept.nist.densegraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.determfinitstatemach","id":"taxonomy.place.concept.nist.determfinitstatemach.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.dichotomicsearch","id":"taxonomy.place.concept.nist.dichotomicsearch.method.nist.search","parent":"method.nist.search","type":"narrower"},{"child":"concept.nist.directacycgraph","id":"taxonomy.place.concept.nist.directacycgraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.dual","id":"taxonomy.place.concept.nist.dual.concept.nist.planargraph","parent":"concept.nist.planargraph","type":"narrower"},{"child":"concept.nist.eightqueens","id":"taxonomy.place.concept.nist.eightqueens.concept.nist.nqueens","parent":"concept.nist.nqueens","type":"narrower"},{"child":"concept.nist.euclidsteinertree","id":"taxonomy.place.concept.nist.euclidsteinertree.concept.nist.steinertree","parent":"concept.nist.steinertree","type":"narrower"},{"child":"concept.nist.eulercycle","id":"taxonomy.place.concept.nist.eulercycle.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.finitestatemachine","id":"taxonomy.place.concept.nist.finitestatemachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.finitestatetransducer","id":"taxonomy.place.concept.nist.finitestatetransducer.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.freevertex","id":"taxonomy.place.concept.nist.freevertex.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.fullypersistdata","id":"taxonomy.place.concept.nist.fullypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.function","id":"taxonomy.place.concept.nist.function.concept.nist.relation","parent":"concept.nist.relation","type":"narrower"},{"child":"concept.nist.haltingproblem","id":"taxonomy.place.concept.nist.haltingproblem.concept.nist.undecidableproblem","parent":"concept.nist.undecidableproblem","type":"narrower"},{"child":"concept.nist.hamiltoniancycle","id":"taxonomy.place.concept.nist.hamiltoniancycle.concept.nist.cycle","parent":"concept.nist.cycle","type":"narrower"},{"child":"concept.nist.hamiltonianpath","id":"taxonomy.place.concept.nist.hamiltonianpath.concept.nist.simplepath","parent":"concept.nist.simplepath","type":"narrower"},{"child":"concept.nist.kripkestruct","id":"taxonomy.place.concept.nist.kripkestruct.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.kwaymerge","id":"taxonomy.place.concept.nist.kwaymerge.concept.nist.multiwaymerge","parent":"concept.nist.multiwaymerge","type":"narrower"},{"child":"concept.nist.labeledgraph","id":"taxonomy.place.concept.nist.labeledgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.levenshtein","id":"taxonomy.place.concept.nist.levenshtein.method.nist.stringmatchwerror","parent":"method.nist.stringmatchwerror","type":"narrower"},{"child":"concept.nist.littleonotation","id":"taxonomy.place.concept.nist.littleonotation.concept.nist.bigonotation","parent":"concept.nist.bigonotation","type":"narrower"},{"child":"concept.nist.logarithmic","id":"taxonomy.place.concept.nist.logarithmic.concept.nist.sublineartimealgo","parent":"concept.nist.sublineartimealgo","type":"narrower"},{"child":"concept.nist.matchedvertx","id":"taxonomy.place.concept.nist.matchedvertx.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.maxheapprop","id":"taxonomy.place.concept.nist.maxheapprop.concept.nist.heapproperty","parent":"concept.nist.heapproperty","type":"narrower"},{"child":"concept.nist.mealymachine","id":"taxonomy.place.concept.nist.mealymachine.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.minheapprop","id":"taxonomy.place.concept.nist.minheapprop.concept.nist.heapproperty","parent":"concept.nist.heapproperty","type":"narrower"},{"child":"concept.nist.minimumspanningtree","id":"taxonomy.place.concept.nist.minimumspanningtree.concept.nist.spanningtree","parent":"concept.nist.spanningtree","type":"narrower"},{"child":"concept.nist.mooremachine","id":"taxonomy.place.concept.nist.mooremachine.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.naryfunc","id":"taxonomy.place.concept.nist.naryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.nondetermfinitestatemach","id":"taxonomy.place.concept.nist.nondetermfinitestatemach.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.nondetermturingmach","id":"taxonomy.place.concept.nist.nondetermturingmach.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.np","id":"taxonomy.place.concept.nist.np.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.npcomplete","id":"taxonomy.place.concept.nist.npcomplete.concept.nist.np","parent":"concept.nist.np","type":"narrower"},{"child":"concept.nist.nphard","id":"taxonomy.place.concept.nist.nphard.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.oracletur","id":"taxonomy.place.concept.nist.oracletur.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.p","id":"taxonomy.place.concept.nist.p.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.partiallypersistdata","id":"taxonomy.place.concept.nist.partiallypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.perfectbinarytree","id":"taxonomy.place.concept.nist.perfectbinarytree.concept.nist.fullbinarytree","parent":"concept.nist.fullbinarytree","type":"narrower"},{"child":"concept.nist.persistentdatastructure","id":"taxonomy.place.concept.nist.persistentdatastructure.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.phoneticcoding","id":"taxonomy.place.concept.nist.phoneticcoding.method.nist.stringmatchwerror","parent":"method.nist.stringmatchwerror","type":"narrower"},{"child":"concept.nist.planargraph","id":"taxonomy.place.concept.nist.planargraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.planarstrght","id":"taxonomy.place.concept.nist.planarstrght.concept.nist.planargraph","parent":"concept.nist.planargraph","type":"narrower"},{"child":"concept.nist.pointermachn","id":"taxonomy.place.concept.nist.pointermachn.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.poset","id":"taxonomy.place.concept.nist.poset.concept.nist.set","parent":"concept.nist.set","type":"narrower"},{"child":"concept.nist.postscorrespondprob","id":"taxonomy.place.concept.nist.postscorrespondprob.concept.nist.undecidableproblem","parent":"concept.nist.undecidableproblem","type":"narrower"},{"child":"concept.nist.primitiverecursive","id":"taxonomy.place.concept.nist.primitiverecursive.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.probablturng","id":"taxonomy.place.concept.nist.probablturng.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.propersubset","id":"taxonomy.place.concept.nist.propersubset.concept.nist.subset","parent":"concept.nist.subset","type":"narrower"},{"child":"concept.nist.quantumcomputation","id":"taxonomy.place.concept.nist.quantumcomputation.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.randomaccess","id":"taxonomy.place.concept.nist.randomaccess.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.rectilinearsteinertree","id":"taxonomy.place.concept.nist.rectilinearsteinertree.concept.nist.steinertree","parent":"concept.nist.steinertree","type":"narrower"},{"child":"concept.nist.recursivstrc","id":"taxonomy.place.concept.nist.recursivstrc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.restricted","id":"taxonomy.place.concept.nist.restricted.method.nist.distributionsort","parent":"method.nist.distributionsort","type":"narrower"},{"child":"concept.nist.simplepath","id":"taxonomy.place.concept.nist.simplepath.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.simplex","id":"taxonomy.place.concept.nist.simplex.concept.nist.polytope","parent":"concept.nist.polytope","type":"narrower"},{"child":"concept.nist.sparsegraph","id":"taxonomy.place.concept.nist.sparsegraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.statemachine","id":"taxonomy.place.concept.nist.statemachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.steinervertx","id":"taxonomy.place.concept.nist.steinervertx.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.stringmatching","id":"taxonomy.place.concept.nist.stringmatching.method.nist.search","parent":"method.nist.search","type":"narrower"},{"child":"concept.nist.strippacking","id":"taxonomy.place.concept.nist.strippacking.concept.nist.optimization","parent":"concept.nist.optimization","type":"narrower"},{"child":"concept.nist.stronglyconnectedcompo","id":"taxonomy.place.concept.nist.stronglyconnectedcompo.concept.nist.maximallyconnectedcomponent","parent":"concept.nist.maximallyconnectedcomponent","type":"narrower"},{"child":"concept.nist.stronglyconnectedgraph","id":"taxonomy.place.concept.nist.stronglyconnectedgraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.stronglynp","id":"taxonomy.place.concept.nist.stronglynp.concept.nist.nphard","parent":"concept.nist.nphard","type":"narrower"},{"child":"concept.nist.sublineartimealgo","id":"taxonomy.place.concept.nist.sublineartimealgo.concept.nist.polynomialtm","parent":"concept.nist.polynomialtm","type":"narrower"},{"child":"concept.nist.topologicalsort","id":"taxonomy.place.concept.nist.topologicalsort.method.nist.sort","parent":"method.nist.sort","type":"narrower"},{"child":"concept.nist.totalfunc","id":"taxonomy.place.concept.nist.totalfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.travelingsalesman","id":"taxonomy.place.concept.nist.travelingsalesman.concept.nist.hamiltoniancycle","parent":"concept.nist.hamiltoniancycle","type":"narrower"},{"child":"concept.nist.trinaryfunc","id":"taxonomy.place.concept.nist.trinaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.turingmachine","id":"taxonomy.place.concept.nist.turingmachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.unaryfunc","id":"taxonomy.place.concept.nist.unaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.universaltur","id":"taxonomy.place.concept.nist.universaltur.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.vehiclerouting","id":"taxonomy.place.concept.nist.vehiclerouting.concept.nist.optimization","parent":"concept.nist.optimization","type":"narrower"},{"child":"concept.nist.weighteddigraph","id":"taxonomy.place.concept.nist.weighteddigraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.weightedgraph","id":"taxonomy.place.concept.nist.weightedgraph.concept.nist.labeledgraph","parent":"concept.nist.labeledgraph","type":"narrower"},{"child":"field.aat.300054245","id":"taxonomy.place.field.aat.300054245.concept.aat.300137365","parent":"concept.aat.300137365","type":"narrower"},{"child":"field.aat.300054273","id":"taxonomy.place.field.aat.300054273.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300054275","id":"taxonomy.place.field.aat.300054275.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300054280","id":"taxonomy.place.field.aat.300054280.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"field.aat.300054283","id":"taxonomy.place.field.aat.300054283.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300054296","id":"taxonomy.place.field.aat.300054296.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054297","id":"taxonomy.place.field.aat.300054297.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300055944","id":"taxonomy.place.field.aat.300055944.concept.aat.300055939","parent":"concept.aat.300055939","type":"narrower"},{"child":"field.aat.300255715","id":"taxonomy.place.field.aat.300255715.concept.aat.300417581","parent":"concept.aat.300417581","type":"narrower"},{"child":"field.aat.300265672","id":"taxonomy.place.field.aat.300265672.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"field.aat.300265767","id":"taxonomy.place.field.aat.300265767.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300412155","id":"taxonomy.place.field.aat.300412155.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300417579","id":"taxonomy.place.field.aat.300417579.concept.aat.300417584","parent":"concept.aat.300417584","type":"narrower"},{"child":"field.aat.300435151","id":"taxonomy.place.field.aat.300435151.concept.aat.300389795","parent":"concept.aat.300389795","type":"narrower"},{"child":"field.aat.300444364","id":"taxonomy.place.field.aat.300444364.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d032781","id":"taxonomy.place.field.mesh.d032781.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"method.nist.britishmuseum","id":"taxonomy.place.method.nist.britishmuseum.method.nist.exhaustivesearch","parent":"method.nist.exhaustivesearch","type":"narrower"},{"child":"method.nist.collectiverecursion","id":"taxonomy.place.method.nist.collectiverecursion.method.nist.recursion","parent":"method.nist.recursion","type":"narrower"},{"child":"method.nist.easysplithardmerge","id":"taxonomy.place.method.nist.easysplithardmerge.method.nist.divideandconquer","parent":"method.nist.divideandconquer","type":"narrower"},{"child":"method.nist.exhaustivesearch","id":"taxonomy.place.method.nist.exhaustivesearch.method.nist.bruteforce","parent":"method.nist.bruteforce","type":"narrower"},{"child":"method.nist.hardspliteasymerge","id":"taxonomy.place.method.nist.hardspliteasymerge.method.nist.divideandconquer","parent":"method.nist.divideandconquer","type":"narrower"},{"child":"method.nist.lasvegas","id":"taxonomy.place.method.nist.lasvegas.concept.nist.randomizedalgo","parent":"concept.nist.randomizedalgo","type":"narrower"},{"child":"method.nist.montecarlo","id":"taxonomy.place.method.nist.montecarlo.method.nist.heuristic","parent":"method.nist.heuristic","type":"narrower"},{"child":"method.nist.rhoapproxmtn","id":"taxonomy.place.method.nist.rhoapproxmtn.method.nist.approximatin","parent":"method.nist.approximatin","type":"narrower"},{"child":"method.nist.tailrecursion","id":"taxonomy.place.method.nist.tailrecursion.method.nist.recursion","parent":"method.nist.recursion","type":"narrower"},{"child":"ology.andrology","id":"taxonomy.place.ology.andrology.field.mesh.d018456","parent":"field.mesh.d018456","type":"narrower"},{"child":"ology.cardiology","id":"taxonomy.place.ology.cardiology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.dermatology","id":"taxonomy.place.ology.dermatology.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"ology.gastroenterology","id":"taxonomy.place.ology.gastroenterology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.gynecology","id":"taxonomy.place.ology.gynecology.field.mesh.d018456","parent":"field.mesh.d018456","type":"narrower"},{"child":"ology.hematology","id":"taxonomy.place.ology.hematology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.neonatology","id":"taxonomy.place.ology.neonatology.field.mesh.d010372","parent":"field.mesh.d010372","type":"narrower"},{"child":"ology.nephrology","id":"taxonomy.place.ology.nephrology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.ophthalmology","id":"taxonomy.place.ology.ophthalmology.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"ology.photobiology","id":"taxonomy.place.ology.photobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.radiobiology","id":"taxonomy.place.ology.radiobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.radiology","id":"taxonomy.place.ology.radiology.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"ology.rheumatology","id":"taxonomy.place.ology.rheumatology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.thanatology","id":"taxonomy.place.ology.thanatology.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"ology.traumatology","id":"taxonomy.place.ology.traumatology.field.mesh.d000096725","parent":"field.mesh.d000096725","type":"narrower"},{"child":"ology.urology","id":"taxonomy.place.ology.urology.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"concept.usgs.1005","id":"taxonomy.usgs.concept.usgs.1005.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1010","id":"taxonomy.usgs.concept.usgs.1010.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1028","id":"taxonomy.usgs.concept.usgs.1028.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.1034","id":"taxonomy.usgs.concept.usgs.1034.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1035","id":"taxonomy.usgs.concept.usgs.1035.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1036","id":"taxonomy.usgs.concept.usgs.1036.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1072","id":"taxonomy.usgs.concept.usgs.1072.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1078","id":"taxonomy.usgs.concept.usgs.1078.ology.geochemistry","parent":"ology.geochemistry","type":"narrower"},{"child":"concept.usgs.108","id":"taxonomy.usgs.concept.usgs.108.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1080","id":"taxonomy.usgs.concept.usgs.1080.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.1102","id":"taxonomy.usgs.concept.usgs.1102.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1103","id":"taxonomy.usgs.concept.usgs.1103.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1118","id":"taxonomy.usgs.concept.usgs.1118.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.1123","id":"taxonomy.usgs.concept.usgs.1123.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1127","id":"taxonomy.usgs.concept.usgs.1127.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.1129","id":"taxonomy.usgs.concept.usgs.1129.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1145","id":"taxonomy.usgs.concept.usgs.1145.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1199","id":"taxonomy.usgs.concept.usgs.1199.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1286","id":"taxonomy.usgs.concept.usgs.1286.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1298","id":"taxonomy.usgs.concept.usgs.1298.ology.geochemistry","parent":"ology.geochemistry","type":"narrower"},{"child":"concept.usgs.1301","id":"taxonomy.usgs.concept.usgs.1301.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1302","id":"taxonomy.usgs.concept.usgs.1302.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1308","id":"taxonomy.usgs.concept.usgs.1308.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.1312","id":"taxonomy.usgs.concept.usgs.1312.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1346","id":"taxonomy.usgs.concept.usgs.1346.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1347","id":"taxonomy.usgs.concept.usgs.1347.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1355","id":"taxonomy.usgs.concept.usgs.1355.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1356","id":"taxonomy.usgs.concept.usgs.1356.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1367","id":"taxonomy.usgs.concept.usgs.1367.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1368","id":"taxonomy.usgs.concept.usgs.1368.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1369","id":"taxonomy.usgs.concept.usgs.1369.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1370","id":"taxonomy.usgs.concept.usgs.1370.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1622","id":"taxonomy.usgs.concept.usgs.1622.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1626","id":"taxonomy.usgs.concept.usgs.1626.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1627","id":"taxonomy.usgs.concept.usgs.1627.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1628","id":"taxonomy.usgs.concept.usgs.1628.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1630","id":"taxonomy.usgs.concept.usgs.1630.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1635","id":"taxonomy.usgs.concept.usgs.1635.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1638","id":"taxonomy.usgs.concept.usgs.1638.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1640","id":"taxonomy.usgs.concept.usgs.1640.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1642","id":"taxonomy.usgs.concept.usgs.1642.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1649","id":"taxonomy.usgs.concept.usgs.1649.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1652","id":"taxonomy.usgs.concept.usgs.1652.concept.usgs.1634","parent":"concept.usgs.1634","type":"narrower"},{"child":"concept.usgs.1655","id":"taxonomy.usgs.concept.usgs.1655.concept.usgs.1634","parent":"concept.usgs.1634","type":"narrower"},{"child":"concept.usgs.1656","id":"taxonomy.usgs.concept.usgs.1656.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1657","id":"taxonomy.usgs.concept.usgs.1657.concept.usgs.1627","parent":"concept.usgs.1627","type":"narrower"},{"child":"concept.usgs.1662","id":"taxonomy.usgs.concept.usgs.1662.concept.usgs.1627","parent":"concept.usgs.1627","type":"narrower"},{"child":"concept.usgs.1664","id":"taxonomy.usgs.concept.usgs.1664.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1673","id":"taxonomy.usgs.concept.usgs.1673.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.1674","id":"taxonomy.usgs.concept.usgs.1674.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.1675","id":"taxonomy.usgs.concept.usgs.1675.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.168","id":"taxonomy.usgs.concept.usgs.168.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1682","id":"taxonomy.usgs.concept.usgs.1682.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1683","id":"taxonomy.usgs.concept.usgs.1683.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1690","id":"taxonomy.usgs.concept.usgs.1690.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1699","id":"taxonomy.usgs.concept.usgs.1699.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1701","id":"taxonomy.usgs.concept.usgs.1701.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1702","id":"taxonomy.usgs.concept.usgs.1702.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1703","id":"taxonomy.usgs.concept.usgs.1703.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1704","id":"taxonomy.usgs.concept.usgs.1704.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1708","id":"taxonomy.usgs.concept.usgs.1708.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1710","id":"taxonomy.usgs.concept.usgs.1710.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1711","id":"taxonomy.usgs.concept.usgs.1711.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1712","id":"taxonomy.usgs.concept.usgs.1712.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1714","id":"taxonomy.usgs.concept.usgs.1714.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1715","id":"taxonomy.usgs.concept.usgs.1715.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1718","id":"taxonomy.usgs.concept.usgs.1718.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1721","id":"taxonomy.usgs.concept.usgs.1721.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1722","id":"taxonomy.usgs.concept.usgs.1722.concept.usgs.1072","parent":"concept.usgs.1072","type":"narrower"},{"child":"concept.usgs.1731","id":"taxonomy.usgs.concept.usgs.1731.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1736","id":"taxonomy.usgs.concept.usgs.1736.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1741","id":"taxonomy.usgs.concept.usgs.1741.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1751","id":"taxonomy.usgs.concept.usgs.1751.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1799","id":"taxonomy.usgs.concept.usgs.1799.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1800","id":"taxonomy.usgs.concept.usgs.1800.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1801","id":"taxonomy.usgs.concept.usgs.1801.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.1802","id":"taxonomy.usgs.concept.usgs.1802.concept.usgs.1800","parent":"concept.usgs.1800","type":"narrower"},{"child":"concept.usgs.1803","id":"taxonomy.usgs.concept.usgs.1803.concept.usgs.1800","parent":"concept.usgs.1800","type":"narrower"},{"child":"concept.usgs.1804","id":"taxonomy.usgs.concept.usgs.1804.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.196","id":"taxonomy.usgs.concept.usgs.196.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1999","id":"taxonomy.usgs.concept.usgs.1999.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2000","id":"taxonomy.usgs.concept.usgs.2000.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2027","id":"taxonomy.usgs.concept.usgs.2027.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2028","id":"taxonomy.usgs.concept.usgs.2028.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2031","id":"taxonomy.usgs.concept.usgs.2031.field.usgs.626","parent":"field.usgs.626","type":"narrower"},{"child":"concept.usgs.2043","id":"taxonomy.usgs.concept.usgs.2043.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.2058","id":"taxonomy.usgs.concept.usgs.2058.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.2068","id":"taxonomy.usgs.concept.usgs.2068.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2069","id":"taxonomy.usgs.concept.usgs.2069.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2070","id":"taxonomy.usgs.concept.usgs.2070.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2071","id":"taxonomy.usgs.concept.usgs.2071.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2072","id":"taxonomy.usgs.concept.usgs.2072.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2080","id":"taxonomy.usgs.concept.usgs.2080.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2089","id":"taxonomy.usgs.concept.usgs.2089.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.2091","id":"taxonomy.usgs.concept.usgs.2091.field.usgs.2090","parent":"field.usgs.2090","type":"narrower"},{"child":"concept.usgs.211","id":"taxonomy.usgs.concept.usgs.211.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.219","id":"taxonomy.usgs.concept.usgs.219.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.2264","id":"taxonomy.usgs.concept.usgs.2264.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2276","id":"taxonomy.usgs.concept.usgs.2276.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2277","id":"taxonomy.usgs.concept.usgs.2277.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.2279","id":"taxonomy.usgs.concept.usgs.2279.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.2281","id":"taxonomy.usgs.concept.usgs.2281.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.2282","id":"taxonomy.usgs.concept.usgs.2282.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.2290","id":"taxonomy.usgs.concept.usgs.2290.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2291","id":"taxonomy.usgs.concept.usgs.2291.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.2295","id":"taxonomy.usgs.concept.usgs.2295.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.2305","id":"taxonomy.usgs.concept.usgs.2305.concept.usgs.384","parent":"concept.usgs.384","type":"narrower"},{"child":"concept.usgs.248","id":"taxonomy.usgs.concept.usgs.248.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.268","id":"taxonomy.usgs.concept.usgs.268.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.27","id":"taxonomy.usgs.concept.usgs.27.concept.usgs.67","parent":"concept.usgs.67","type":"narrower"},{"child":"concept.usgs.284","id":"taxonomy.usgs.concept.usgs.284.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.292","id":"taxonomy.usgs.concept.usgs.292.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.30","id":"taxonomy.usgs.concept.usgs.30.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.304","id":"taxonomy.usgs.concept.usgs.304.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.308","id":"taxonomy.usgs.concept.usgs.308.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.310","id":"taxonomy.usgs.concept.usgs.310.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.315","id":"taxonomy.usgs.concept.usgs.315.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.353","id":"taxonomy.usgs.concept.usgs.353.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.359","id":"taxonomy.usgs.concept.usgs.359.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.365","id":"taxonomy.usgs.concept.usgs.365.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.384","id":"taxonomy.usgs.concept.usgs.384.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.391","id":"taxonomy.usgs.concept.usgs.391.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.404","id":"taxonomy.usgs.concept.usgs.404.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.411","id":"taxonomy.usgs.concept.usgs.411.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.414","id":"taxonomy.usgs.concept.usgs.414.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.435","id":"taxonomy.usgs.concept.usgs.435.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.440","id":"taxonomy.usgs.concept.usgs.440.field.usgs.470","parent":"field.usgs.470","type":"narrower"},{"child":"concept.usgs.451","id":"taxonomy.usgs.concept.usgs.451.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.452","id":"taxonomy.usgs.concept.usgs.452.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.459","id":"taxonomy.usgs.concept.usgs.459.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.482","id":"taxonomy.usgs.concept.usgs.482.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.501","id":"taxonomy.usgs.concept.usgs.501.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.522","id":"taxonomy.usgs.concept.usgs.522.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.534","id":"taxonomy.usgs.concept.usgs.534.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.562","id":"taxonomy.usgs.concept.usgs.562.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.572","id":"taxonomy.usgs.concept.usgs.572.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.608","id":"taxonomy.usgs.concept.usgs.608.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.624","id":"taxonomy.usgs.concept.usgs.624.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.63","id":"taxonomy.usgs.concept.usgs.63.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.64","id":"taxonomy.usgs.concept.usgs.64.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.65","id":"taxonomy.usgs.concept.usgs.65.concept.usgs.67","parent":"concept.usgs.67","type":"narrower"},{"child":"concept.usgs.66","id":"taxonomy.usgs.concept.usgs.66.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.660","id":"taxonomy.usgs.concept.usgs.660.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.67","id":"taxonomy.usgs.concept.usgs.67.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.677","id":"taxonomy.usgs.concept.usgs.677.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.690","id":"taxonomy.usgs.concept.usgs.690.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.703","id":"taxonomy.usgs.concept.usgs.703.concept.usgs.1298","parent":"concept.usgs.1298","type":"narrower"},{"child":"concept.usgs.725","id":"taxonomy.usgs.concept.usgs.725.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.727","id":"taxonomy.usgs.concept.usgs.727.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.743","id":"taxonomy.usgs.concept.usgs.743.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.745","id":"taxonomy.usgs.concept.usgs.745.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.799","id":"taxonomy.usgs.concept.usgs.799.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.80","id":"taxonomy.usgs.concept.usgs.80.field.usgs.1176","parent":"field.usgs.1176","type":"narrower"},{"child":"concept.usgs.806","id":"taxonomy.usgs.concept.usgs.806.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.816","id":"taxonomy.usgs.concept.usgs.816.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.817","id":"taxonomy.usgs.concept.usgs.817.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.819","id":"taxonomy.usgs.concept.usgs.819.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.823","id":"taxonomy.usgs.concept.usgs.823.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.84","id":"taxonomy.usgs.concept.usgs.84.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.854","id":"taxonomy.usgs.concept.usgs.854.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.858","id":"taxonomy.usgs.concept.usgs.858.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"concept.usgs.88","id":"taxonomy.usgs.concept.usgs.88.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.915","id":"taxonomy.usgs.concept.usgs.915.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.927","id":"taxonomy.usgs.concept.usgs.927.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.93","id":"taxonomy.usgs.concept.usgs.93.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"field.cartography","id":"taxonomy.usgs.field.cartography.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.climatology","id":"taxonomy.usgs.field.climatology.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.ecology","id":"taxonomy.usgs.field.ecology.family.life","parent":"family:life","type":"narrower"},{"child":"field.genetics","id":"taxonomy.usgs.field.genetics.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.geology","id":"taxonomy.usgs.field.geology.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.microbiology","id":"taxonomy.usgs.field.microbiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.molecular-biology","id":"taxonomy.usgs.field.molecular-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.usgs.1025","id":"taxonomy.usgs.field.usgs.1025.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"field.usgs.1081","id":"taxonomy.usgs.field.usgs.1081.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.1117","id":"taxonomy.usgs.field.usgs.1117.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.115","id":"taxonomy.usgs.field.usgs.115.ology.stratigraphy","parent":"ology.stratigraphy","type":"narrower"},{"child":"field.usgs.1176","id":"taxonomy.usgs.field.usgs.1176.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.1267","id":"taxonomy.usgs.field.usgs.1267.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.1678","id":"taxonomy.usgs.field.usgs.1678.ology.hydrology","parent":"ology.hydrology","type":"narrower"},{"child":"field.usgs.1679","id":"taxonomy.usgs.field.usgs.1679.field.usgs.447","parent":"field.usgs.447","type":"narrower"},{"child":"field.usgs.2090","id":"taxonomy.usgs.field.usgs.2090.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.288","id":"taxonomy.usgs.field.usgs.288.field.usgs.455","parent":"field.usgs.455","type":"narrower"},{"child":"field.usgs.312","id":"taxonomy.usgs.field.usgs.312.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.447","id":"taxonomy.usgs.field.usgs.447.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.455","id":"taxonomy.usgs.field.usgs.455.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.470","id":"taxonomy.usgs.field.usgs.470.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.604","id":"taxonomy.usgs.field.usgs.604.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.626","id":"taxonomy.usgs.field.usgs.626.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.668","id":"taxonomy.usgs.field.usgs.668.ology.stratigraphy","parent":"ology.stratigraphy","type":"narrower"},{"child":"field.usgs.68","id":"taxonomy.usgs.field.usgs.68.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.706","id":"taxonomy.usgs.field.usgs.706.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.707","id":"taxonomy.usgs.field.usgs.707.field.usgs.470","parent":"field.usgs.470","type":"narrower"},{"child":"field.usgs.738","id":"taxonomy.usgs.field.usgs.738.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.810","id":"taxonomy.usgs.field.usgs.810.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.818","id":"taxonomy.usgs.field.usgs.818.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.859","id":"taxonomy.usgs.field.usgs.859.field.usgs.818","parent":"field.usgs.818","type":"narrower"},{"child":"field.usgs.862","id":"taxonomy.usgs.field.usgs.862.ology.seismology","parent":"ology.seismology","type":"narrower"},{"child":"ology.bacteriology","id":"taxonomy.usgs.ology.bacteriology.field.microbiology","parent":"field.microbiology","type":"narrower"},{"child":"ology.cell-biology","id":"taxonomy.usgs.ology.cell-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.developmental-biology","id":"taxonomy.usgs.ology.developmental-biology.family.life","parent":"family:life","type":"narrower"},{"child":"ology.entomology","id":"taxonomy.usgs.ology.entomology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.ethology","id":"taxonomy.usgs.ology.ethology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.geochemistry","id":"taxonomy.usgs.ology.geochemistry.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.geochronology","id":"taxonomy.usgs.ology.geochronology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.geomorphology","id":"taxonomy.usgs.ology.geomorphology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.glaciology","id":"taxonomy.usgs.ology.glaciology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.herpetology","id":"taxonomy.usgs.ology.herpetology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.histology","id":"taxonomy.usgs.ology.histology.family.life","parent":"family:life","type":"narrower"},{"child":"ology.hydrogeology","id":"taxonomy.usgs.ology.hydrogeology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.hydrology","id":"taxonomy.usgs.ology.hydrology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.ichthyology","id":"taxonomy.usgs.ology.ichthyology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.immunology","id":"taxonomy.usgs.ology.immunology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.limnology","id":"taxonomy.usgs.ology.limnology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.mammalogy","id":"taxonomy.usgs.ology.mammalogy.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.marine-biology","id":"taxonomy.usgs.ology.marine-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.meteorology","id":"taxonomy.usgs.ology.meteorology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.mineralogy","id":"taxonomy.usgs.ology.mineralogy.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.mycology","id":"taxonomy.usgs.ology.mycology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.ornithology","id":"taxonomy.usgs.ology.ornithology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.paleontology","id":"taxonomy.usgs.ology.paleontology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.parasitology","id":"taxonomy.usgs.ology.parasitology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.petrology","id":"taxonomy.usgs.ology.petrology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.phycology","id":"taxonomy.usgs.ology.phycology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.sedimentology","id":"taxonomy.usgs.ology.sedimentology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.seismology","id":"taxonomy.usgs.ology.seismology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.stratigraphy","id":"taxonomy.usgs.ology.stratigraphy.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.tectonophysics","id":"taxonomy.usgs.ology.tectonophysics.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.virology","id":"taxonomy.usgs.ology.virology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.volcanology","id":"taxonomy.usgs.ology.volcanology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.zoology","id":"taxonomy.usgs.ology.zoology.field.biology","parent":"field.biology","type":"narrower"},{"child":"concept.wikipedia.a-b-testing","id":"taxonomy.wikipedia.concept.wikipedia.a-b-testing.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.a-frame","id":"taxonomy.wikipedia.concept.wikipedia.a-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.a-homotopy-theory","id":"taxonomy.wikipedia.concept.wikipedia.a-homotopy-theory.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.abel-s-summation-formula","id":"taxonomy.wikipedia.concept.wikipedia.abel-s-summation-formula.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.abelian-category","id":"taxonomy.wikipedia.concept.wikipedia.abelian-category.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.abenics","id":"taxonomy.wikipedia.concept.wikipedia.abenics.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.abnormal-grain-growth","id":"taxonomy.wikipedia.concept.wikipedia.abnormal-grain-growth.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.abrams-law","id":"taxonomy.wikipedia.concept.wikipedia.abrams-law.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.abrasive-machining","id":"taxonomy.wikipedia.concept.wikipedia.abrasive-machining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.absolute-continuity","id":"taxonomy.wikipedia.concept.wikipedia.absolute-continuity.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.absolute-neighborhood-retract","id":"taxonomy.wikipedia.concept.wikipedia.absolute-neighborhood-retract.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.absolutely-convex-set","id":"taxonomy.wikipedia.concept.wikipedia.absolutely-convex-set.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.absorption-law","id":"taxonomy.wikipedia.concept.wikipedia.absorption-law.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.abstract-logic","id":"taxonomy.wikipedia.concept.wikipedia.abstract-logic.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.abstract-polytope","id":"taxonomy.wikipedia.concept.wikipedia.abstract-polytope.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.abstract-simplicial-complex","id":"taxonomy.wikipedia.concept.wikipedia.abstract-simplicial-complex.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.abutment","id":"taxonomy.wikipedia.concept.wikipedia.abutment.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.ac-dc-receiver-design","id":"taxonomy.wikipedia.concept.wikipedia.ac-dc-receiver-design.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.access-consciousness","id":"taxonomy.wikipedia.concept.wikipedia.access-consciousness.concept.wikipedia.pseudoscience","parent":"concept.wikipedia.pseudoscience","type":"narrower"},{"child":"concept.wikipedia.acicular-ferrite","id":"taxonomy.wikipedia.concept.wikipedia.acicular-ferrite.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.acid-egg","id":"taxonomy.wikipedia.concept.wikipedia.acid-egg.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.acoustic-emission","id":"taxonomy.wikipedia.concept.wikipedia.acoustic-emission.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.action-angle-coordinates","id":"taxonomy.wikipedia.concept.wikipedia.action-angle-coordinates.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.action-type-approach","id":"taxonomy.wikipedia.concept.wikipedia.action-type-approach.concept.wikipedia.pseudoscience","parent":"concept.wikipedia.pseudoscience","type":"narrower"},{"child":"concept.wikipedia.activated-sludge","id":"taxonomy.wikipedia.concept.wikipedia.activated-sludge.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.active-disturbance-rejection-control","id":"taxonomy.wikipedia.concept.wikipedia.active-disturbance-rejection-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.active-thermography","id":"taxonomy.wikipedia.concept.wikipedia.active-thermography.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.acyclic-model","id":"taxonomy.wikipedia.concept.wikipedia.acyclic-model.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.ad-personam","id":"taxonomy.wikipedia.concept.wikipedia.ad-personam.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.adaptive-beamformer","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-beamformer.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.adaptive-control","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.adaptive-step-size","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-step-size.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.addition-principle","id":"taxonomy.wikipedia.concept.wikipedia.addition-principle.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.additive-identity","id":"taxonomy.wikipedia.concept.wikipedia.additive-identity.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.additive-inverse","id":"taxonomy.wikipedia.concept.wikipedia.additive-inverse.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.additive-process","id":"taxonomy.wikipedia.concept.wikipedia.additive-process.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.addressed-fiber-bragg-structure","id":"taxonomy.wikipedia.concept.wikipedia.addressed-fiber-bragg-structure.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.adjoint-state-method","id":"taxonomy.wikipedia.concept.wikipedia.adjoint-state-method.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.adjugate-matrix","id":"taxonomy.wikipedia.concept.wikipedia.adjugate-matrix.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.adjustable-pressure-limiting-valve","id":"taxonomy.wikipedia.concept.wikipedia.adjustable-pressure-limiting-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.admissible-numbering","id":"taxonomy.wikipedia.concept.wikipedia.admissible-numbering.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.admissible-representation","id":"taxonomy.wikipedia.concept.wikipedia.admissible-representation.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.adomian-decomposition-method","id":"taxonomy.wikipedia.concept.wikipedia.adomian-decomposition-method.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.advance-ratio","id":"taxonomy.wikipedia.concept.wikipedia.advance-ratio.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.advanced-composite-materials-engineering","id":"taxonomy.wikipedia.concept.wikipedia.advanced-composite-materials-engineering.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.advanced-multi-mission-operations-system","id":"taxonomy.wikipedia.concept.wikipedia.advanced-multi-mission-operations-system.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.advanced-process-control","id":"taxonomy.wikipedia.concept.wikipedia.advanced-process-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.advanced-stirling-radioisotope-generator","id":"taxonomy.wikipedia.concept.wikipedia.advanced-stirling-radioisotope-generator.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.aerial-manned-unmanned-teaming","id":"taxonomy.wikipedia.concept.wikipedia.aerial-manned-unmanned-teaming.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.aerodynamic-center","id":"taxonomy.wikipedia.concept.wikipedia.aerodynamic-center.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aeroelasticity","id":"taxonomy.wikipedia.concept.wikipedia.aeroelasticity.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-architecture","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-architecture.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-bearing","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-bearing.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-materials","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-materials.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerostructure","id":"taxonomy.wikipedia.concept.wikipedia.aerostructure.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.affine-arithmetic","id":"taxonomy.wikipedia.concept.wikipedia.affine-arithmetic.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.affine-bundle","id":"taxonomy.wikipedia.concept.wikipedia.affine-bundle.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-connection","id":"taxonomy.wikipedia.concept.wikipedia.affine-connection.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-grassmannian-manifold","id":"taxonomy.wikipedia.concept.wikipedia.affine-grassmannian-manifold.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-lie-algebra","id":"taxonomy.wikipedia.concept.wikipedia.affine-lie-algebra.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.affine-plank-problem","id":"taxonomy.wikipedia.concept.wikipedia.affine-plank-problem.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-space","id":"taxonomy.wikipedia.concept.wikipedia.affine-space.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.affine-sphere","id":"taxonomy.wikipedia.concept.wikipedia.affine-sphere.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-symmetric-group","id":"taxonomy.wikipedia.concept.wikipedia.affine-symmetric-group.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.affinity-laws","id":"taxonomy.wikipedia.concept.wikipedia.affinity-laws.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.affirming-the-consequent","id":"taxonomy.wikipedia.concept.wikipedia.affirming-the-consequent.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.agent-causation","id":"taxonomy.wikipedia.concept.wikipedia.agent-causation.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.agentive-logic","id":"taxonomy.wikipedia.concept.wikipedia.agentive-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.air-bearing","id":"taxonomy.wikipedia.concept.wikipedia.air-bearing.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.air-carbon-arc-cutting","id":"taxonomy.wikipedia.concept.wikipedia.air-carbon-arc-cutting.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.air-cooled-heat-exchanger","id":"taxonomy.wikipedia.concept.wikipedia.air-cooled-heat-exchanger.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.air-data-inertial-reference-unit","id":"taxonomy.wikipedia.concept.wikipedia.air-data-inertial-reference-unit.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.air-fuel-ratio","id":"taxonomy.wikipedia.concept.wikipedia.air-fuel-ratio.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.air-operated-valve","id":"taxonomy.wikipedia.concept.wikipedia.air-operated-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.air-permeability-specific-surface","id":"taxonomy.wikipedia.concept.wikipedia.air-permeability-specific-surface.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.air-pump","id":"taxonomy.wikipedia.concept.wikipedia.air-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.airframe","id":"taxonomy.wikipedia.concept.wikipedia.airframe.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.airlift-pump","id":"taxonomy.wikipedia.concept.wikipedia.airlift-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.alarm-management","id":"taxonomy.wikipedia.concept.wikipedia.alarm-management.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.albertson-index","id":"taxonomy.wikipedia.concept.wikipedia.albertson-index.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.alexander-duality","id":"taxonomy.wikipedia.concept.wikipedia.alexander-duality.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.alexandroff-extension","id":"taxonomy.wikipedia.concept.wikipedia.alexandroff-extension.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.alexandrov-space","id":"taxonomy.wikipedia.concept.wikipedia.alexandrov-space.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.alexandrov-topology","id":"taxonomy.wikipedia.concept.wikipedia.alexandrov-topology.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.algebra-extension","id":"taxonomy.wikipedia.concept.wikipedia.algebra-extension.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.algebra-representation","id":"taxonomy.wikipedia.concept.wikipedia.algebra-representation.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.algebraic-cycle","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-cycle.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-differential-equation","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-differential-equation.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-geometry-and-analytic-geometry.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-interior","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-interior.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.algebraic-k-theory","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-k-theory.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-manifold","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-manifold.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.algebraic-semantics-mathematical-logic","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-semantics-mathematical-logic.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.algebraic-structure","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-structure.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.aliasing","id":"taxonomy.wikipedia.concept.wikipedia.aliasing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.alief-mental-state","id":"taxonomy.wikipedia.concept.wikipedia.alief-mental-state.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.alignments-of-random-points","id":"taxonomy.wikipedia.concept.wikipedia.alignments-of-random-points.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","id":"taxonomy.wikipedia.concept.wikipedia.alkali-metal-thermal-to-electric-converter.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.almost-periodic-function","id":"taxonomy.wikipedia.concept.wikipedia.almost-periodic-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.almost-ring","id":"taxonomy.wikipedia.concept.wikipedia.almost-ring.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.almost-surely","id":"taxonomy.wikipedia.concept.wikipedia.almost-surely.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.alpha-beta-filter","id":"taxonomy.wikipedia.concept.wikipedia.alpha-beta-filter.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.alpha-factor","id":"taxonomy.wikipedia.concept.wikipedia.alpha-factor.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.alternating-current","id":"taxonomy.wikipedia.concept.wikipedia.alternating-current.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.alternating-series","id":"taxonomy.wikipedia.concept.wikipedia.alternating-series.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.ambient-space-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.ambient-space-mathematics.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.ameca-robot","id":"taxonomy.wikipedia.concept.wikipedia.ameca-robot.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.amenable-number","id":"taxonomy.wikipedia.concept.wikipedia.amenable-number.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.amicable-triple","id":"taxonomy.wikipedia.concept.wikipedia.amicable-triple.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.amplifier","id":"taxonomy.wikipedia.concept.wikipedia.amplifier.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.amplitwist","id":"taxonomy.wikipedia.concept.wikipedia.amplitwist.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.anaesthetic-machine","id":"taxonomy.wikipedia.concept.wikipedia.anaesthetic-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.analog-delay-line","id":"taxonomy.wikipedia.concept.wikipedia.analog-delay-line.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.analog-device","id":"taxonomy.wikipedia.concept.wikipedia.analog-device.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analog-front-end","id":"taxonomy.wikipedia.concept.wikipedia.analog-front-end.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analog-signal-processing","id":"taxonomy.wikipedia.concept.wikipedia.analog-signal-processing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.analog-to-digital-converter","id":"taxonomy.wikipedia.concept.wikipedia.analog-to-digital-converter.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analytic-reasoning","id":"taxonomy.wikipedia.concept.wikipedia.analytic-reasoning.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.analytic-semigroup","id":"taxonomy.wikipedia.concept.wikipedia.analytic-semigroup.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.analytic-signal","id":"taxonomy.wikipedia.concept.wikipedia.analytic-signal.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.analytic-synthetic-distinction","id":"taxonomy.wikipedia.concept.wikipedia.analytic-synthetic-distinction.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.analytical-chemistry","id":"taxonomy.wikipedia.concept.wikipedia.analytical-chemistry.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.analytical-hierarchy","id":"taxonomy.wikipedia.concept.wikipedia.analytical-hierarchy.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.anchor-channel","id":"taxonomy.wikipedia.concept.wikipedia.anchor-channel.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.anderson-acceleration","id":"taxonomy.wikipedia.concept.wikipedia.anderson-acceleration.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.andr-quillen-cohomology","id":"taxonomy.wikipedia.concept.wikipedia.andr-quillen-cohomology.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.andronov-pontryagin-criterion","id":"taxonomy.wikipedia.concept.wikipedia.andronov-pontryagin-criterion.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.anecdotal-evidence","id":"taxonomy.wikipedia.concept.wikipedia.anecdotal-evidence.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.angle-bracket-fastener","id":"taxonomy.wikipedia.concept.wikipedia.angle-bracket-fastener.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.angle-of-arrival","id":"taxonomy.wikipedia.concept.wikipedia.angle-of-arrival.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.angular-rate-sensor","id":"taxonomy.wikipedia.concept.wikipedia.angular-rate-sensor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.annealing-materials-science","id":"taxonomy.wikipedia.concept.wikipedia.annealing-materials-science.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.anosov-diffeomorphism","id":"taxonomy.wikipedia.concept.wikipedia.anosov-diffeomorphism.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.anthrobotics","id":"taxonomy.wikipedia.concept.wikipedia.anthrobotics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.anticausal-system","id":"taxonomy.wikipedia.concept.wikipedia.anticausal-system.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.antiholomorphic-function","id":"taxonomy.wikipedia.concept.wikipedia.antiholomorphic-function.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.antiisomorphism","id":"taxonomy.wikipedia.concept.wikipedia.antiisomorphism.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.antimatroid","id":"taxonomy.wikipedia.concept.wikipedia.antimatroid.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.antoine-s-necklace","id":"taxonomy.wikipedia.concept.wikipedia.antoine-s-necklace.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.apodization","id":"taxonomy.wikipedia.concept.wikipedia.apodization.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.appeal-to-the-law","id":"taxonomy.wikipedia.concept.wikipedia.appeal-to-the-law.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.application-layer-framing","id":"taxonomy.wikipedia.concept.wikipedia.application-layer-framing.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.approximate-fibration","id":"taxonomy.wikipedia.concept.wikipedia.approximate-fibration.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.approximate-limit","id":"taxonomy.wikipedia.concept.wikipedia.approximate-limit.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.approximate-measures","id":"taxonomy.wikipedia.concept.wikipedia.approximate-measures.concept.wikipedia.measurement","parent":"concept.wikipedia.measurement","type":"narrower"},{"child":"concept.wikipedia.approximate-tangent-space","id":"taxonomy.wikipedia.concept.wikipedia.approximate-tangent-space.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.approximately-continuous-function","id":"taxonomy.wikipedia.concept.wikipedia.approximately-continuous-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.approximation-error","id":"taxonomy.wikipedia.concept.wikipedia.approximation-error.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.approximation-theory","id":"taxonomy.wikipedia.concept.wikipedia.approximation-theory.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.arbor-milling","id":"taxonomy.wikipedia.concept.wikipedia.arbor-milling.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.arc-length-method","id":"taxonomy.wikipedia.concept.wikipedia.arc-length-method.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.arcadia-engineering","id":"taxonomy.wikipedia.concept.wikipedia.arcadia-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.archard-equation","id":"taxonomy.wikipedia.concept.wikipedia.archard-equation.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.archimedes-screw","id":"taxonomy.wikipedia.concept.wikipedia.archimedes-screw.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.arens-fort-space","id":"taxonomy.wikipedia.concept.wikipedia.arens-fort-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.arf-ring","id":"taxonomy.wikipedia.concept.wikipedia.arf-ring.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.argument-from-incredulity","id":"taxonomy.wikipedia.concept.wikipedia.argument-from-incredulity.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.argument-map","id":"taxonomy.wikipedia.concept.wikipedia.argument-map.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.argumentum-a-fortiori","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-a-fortiori.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.argumentum-ad-baculum","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-ad-baculum.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.argumentum-ad-captandum","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-ad-captandum.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.arithmetic-derivative","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-derivative.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetic-fuchsian-group","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-fuchsian-group.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetic-zeta-function","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-zeta-function.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetical-set","id":"taxonomy.wikipedia.concept.wikipedia.arithmetical-set.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.arity","id":"taxonomy.wikipedia.concept.wikipedia.arity.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.armature-controlled-dc-motor","id":"taxonomy.wikipedia.concept.wikipedia.armature-controlled-dc-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.armature-electrical","id":"taxonomy.wikipedia.concept.wikipedia.armature-electrical.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.arnold-diffusion","id":"taxonomy.wikipedia.concept.wikipedia.arnold-diffusion.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.arnold-invariants","id":"taxonomy.wikipedia.concept.wikipedia.arnold-invariants.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.array-processing","id":"taxonomy.wikipedia.concept.wikipedia.array-processing.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.artifact-centric-business-process-model","id":"taxonomy.wikipedia.concept.wikipedia.artifact-centric-business-process-model.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.artificio-de-juanelo","id":"taxonomy.wikipedia.concept.wikipedia.artificio-de-juanelo.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.artinian-ring","id":"taxonomy.wikipedia.concept.wikipedia.artinian-ring.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.asano-contraction","id":"taxonomy.wikipedia.concept.wikipedia.asano-contraction.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.ascending-chain-condition","id":"taxonomy.wikipedia.concept.wikipedia.ascending-chain-condition.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.asplund-space","id":"taxonomy.wikipedia.concept.wikipedia.asplund-space.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.associative-property","id":"taxonomy.wikipedia.concept.wikipedia.associative-property.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.asymmetric-norm","id":"taxonomy.wikipedia.concept.wikipedia.asymmetric-norm.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.asymptote","id":"taxonomy.wikipedia.concept.wikipedia.asymptote.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.asymptotic-expansion","id":"taxonomy.wikipedia.concept.wikipedia.asymptotic-expansion.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.atlas-topology","id":"taxonomy.wikipedia.concept.wikipedia.atlas-topology.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.attack-time-delay","id":"taxonomy.wikipedia.concept.wikipedia.attack-time-delay.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.attrition-research","id":"taxonomy.wikipedia.concept.wikipedia.attrition-research.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.audio-filter","id":"taxonomy.wikipedia.concept.wikipedia.audio-filter.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.audio-signal-processing","id":"taxonomy.wikipedia.concept.wikipedia.audio-signal-processing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.autocovariance","id":"taxonomy.wikipedia.concept.wikipedia.autocovariance.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.autogenous-welding","id":"taxonomy.wikipedia.concept.wikipedia.autogenous-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.automatic-semigroup","id":"taxonomy.wikipedia.concept.wikipedia.automatic-semigroup.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.automorphism","id":"taxonomy.wikipedia.concept.wikipedia.automorphism.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.autonomous-aircraft","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-aircraft.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.autonomous-circuit","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-circuit.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.autonomous-logistics","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-logistics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.autonomous-system-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-system-mathematics.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.autopen","id":"taxonomy.wikipedia.concept.wikipedia.autopen.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.availability-cascade","id":"taxonomy.wikipedia.concept.wikipedia.availability-cascade.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.average-treatment-effect","id":"taxonomy.wikipedia.concept.wikipedia.average-treatment-effect.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.axial-flow-pump","id":"taxonomy.wikipedia.concept.wikipedia.axial-flow-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.axial-flux-motor","id":"taxonomy.wikipedia.concept.wikipedia.axial-flux-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.axial-piston-pump","id":"taxonomy.wikipedia.concept.wikipedia.axial-piston-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.axiom-of-countability","id":"taxonomy.wikipedia.concept.wikipedia.axiom-of-countability.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.axiomatic-design","id":"taxonomy.wikipedia.concept.wikipedia.axiomatic-design.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","id":"taxonomy.wikipedia.concept.wikipedia.axiomatic-foundations-of-topological-spaces.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.backcasting","id":"taxonomy.wikipedia.concept.wikipedia.backcasting.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.backlash-engineering","id":"taxonomy.wikipedia.concept.wikipedia.backlash-engineering.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.baffle-heat-transfer","id":"taxonomy.wikipedia.concept.wikipedia.baffle-heat-transfer.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.bagel-machine","id":"taxonomy.wikipedia.concept.wikipedia.bagel-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.baire-one-star-function","id":"taxonomy.wikipedia.concept.wikipedia.baire-one-star-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.baire-space-set-theory","id":"taxonomy.wikipedia.concept.wikipedia.baire-space-set-theory.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.baker-clamp","id":"taxonomy.wikipedia.concept.wikipedia.baker-clamp.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.ball-screw","id":"taxonomy.wikipedia.concept.wikipedia.ball-screw.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.ball-valve","id":"taxonomy.wikipedia.concept.wikipedia.ball-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.bandgap-voltage-reference","id":"taxonomy.wikipedia.concept.wikipedia.bandgap-voltage-reference.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.bar-complex","id":"taxonomy.wikipedia.concept.wikipedia.bar-complex.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.barkhausen-stability-criterion","id":"taxonomy.wikipedia.concept.wikipedia.barkhausen-stability-criterion.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.barlow-s-wheel","id":"taxonomy.wikipedia.concept.wikipedia.barlow-s-wheel.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.barn-raising","id":"taxonomy.wikipedia.concept.wikipedia.barn-raising.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.barycentric-coordinate-system","id":"taxonomy.wikipedia.concept.wikipedia.barycentric-coordinate-system.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.barycentric-subdivision","id":"taxonomy.wikipedia.concept.wikipedia.barycentric-subdivision.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.base-50","id":"taxonomy.wikipedia.concept.wikipedia.base-50.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.base-unit-of-measurement","id":"taxonomy.wikipedia.concept.wikipedia.base-unit-of-measurement.concept.wikipedia.measurement","parent":"concept.wikipedia.measurement","type":"narrower"},{"child":"concept.wikipedia.basic-belief","id":"taxonomy.wikipedia.concept.wikipedia.basic-belief.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.basis-function","id":"taxonomy.wikipedia.concept.wikipedia.basis-function.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.basis-linear-algebra","id":"taxonomy.wikipedia.concept.wikipedia.basis-linear-algebra.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.bateman-transform","id":"taxonomy.wikipedia.concept.wikipedia.bateman-transform.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.bating-leather","id":"taxonomy.wikipedia.concept.wikipedia.bating-leather.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.bauschinger-effect","id":"taxonomy.wikipedia.concept.wikipedia.bauschinger-effect.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.bayonet-mount","id":"taxonomy.wikipedia.concept.wikipedia.bayonet-mount.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.beam-bridge","id":"taxonomy.wikipedia.concept.wikipedia.beam-bridge.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.beam-structure","id":"taxonomy.wikipedia.concept.wikipedia.beam-structure.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.beamline","id":"taxonomy.wikipedia.concept.wikipedia.beamline.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.beer-engine","id":"taxonomy.wikipedia.concept.wikipedia.beer-engine.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.beer-tap","id":"taxonomy.wikipedia.concept.wikipedia.beer-tap.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.begging-the-question","id":"taxonomy.wikipedia.concept.wikipedia.begging-the-question.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.behavior-based-robotics","id":"taxonomy.wikipedia.concept.wikipedia.behavior-based-robotics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.behavior-tree","id":"taxonomy.wikipedia.concept.wikipedia.behavior-tree.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.belief-desire-intention-model","id":"taxonomy.wikipedia.concept.wikipedia.belief-desire-intention-model.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.belief-revision","id":"taxonomy.wikipedia.concept.wikipedia.belief-revision.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.bending-moment","id":"taxonomy.wikipedia.concept.wikipedia.bending-moment.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bendix-drive","id":"taxonomy.wikipedia.concept.wikipedia.bendix-drive.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.bergeron-diagram","id":"taxonomy.wikipedia.concept.wikipedia.bergeron-diagram.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.bernstein-polynomial","id":"taxonomy.wikipedia.concept.wikipedia.bernstein-polynomial.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.bernstein-s-constant","id":"taxonomy.wikipedia.concept.wikipedia.bernstein-s-constant.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.bessel-function","id":"taxonomy.wikipedia.concept.wikipedia.bessel-function.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.beta-model","id":"taxonomy.wikipedia.concept.wikipedia.beta-model.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.betavoltaic-device","id":"taxonomy.wikipedia.concept.wikipedia.betavoltaic-device.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.betweenness-problem","id":"taxonomy.wikipedia.concept.wikipedia.betweenness-problem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.bevel-gear","id":"taxonomy.wikipedia.concept.wikipedia.bevel-gear.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.bicircular-matroid","id":"taxonomy.wikipedia.concept.wikipedia.bicircular-matroid.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.bicoherence","id":"taxonomy.wikipedia.concept.wikipedia.bicoherence.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.bicycle-tree","id":"taxonomy.wikipedia.concept.wikipedia.bicycle-tree.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.bifacial-solar-cells","id":"taxonomy.wikipedia.concept.wikipedia.bifacial-solar-cells.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.big-m-method","id":"taxonomy.wikipedia.concept.wikipedia.big-m-method.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.big-stan-drill-rig","id":"taxonomy.wikipedia.concept.wikipedia.big-stan-drill-rig.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.bigdog","id":"taxonomy.wikipedia.concept.wikipedia.bigdog.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.bilge-pump","id":"taxonomy.wikipedia.concept.wikipedia.bilge-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.bill-of-materials","id":"taxonomy.wikipedia.concept.wikipedia.bill-of-materials.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.bill-of-quantities","id":"taxonomy.wikipedia.concept.wikipedia.bill-of-quantities.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.bin-tipper","id":"taxonomy.wikipedia.concept.wikipedia.bin-tipper.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.binder-clip","id":"taxonomy.wikipedia.concept.wikipedia.binder-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bioactive-paper","id":"taxonomy.wikipedia.concept.wikipedia.bioactive-paper.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.biomachining","id":"taxonomy.wikipedia.concept.wikipedia.biomachining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.bipolar-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.bipolar-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.biryukov-equation","id":"taxonomy.wikipedia.concept.wikipedia.biryukov-equation.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.bispectrum","id":"taxonomy.wikipedia.concept.wikipedia.bispectrum.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.bitopological-space","id":"taxonomy.wikipedia.concept.wikipedia.bitopological-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.blackwell-girshick-equation","id":"taxonomy.wikipedia.concept.wikipedia.blackwell-girshick-equation.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.blaschke-sum","id":"taxonomy.wikipedia.concept.wikipedia.blaschke-sum.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.blast-valve","id":"taxonomy.wikipedia.concept.wikipedia.blast-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.blind-men-and-an-elephant","id":"taxonomy.wikipedia.concept.wikipedia.blind-men-and-an-elephant.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.block-and-tackle","id":"taxonomy.wikipedia.concept.wikipedia.block-and-tackle.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.bodenstein-number","id":"taxonomy.wikipedia.concept.wikipedia.bodenstein-number.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.body-on-frame","id":"taxonomy.wikipedia.concept.wikipedia.body-on-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.bogdanov-map","id":"taxonomy.wikipedia.concept.wikipedia.bogdanov-map.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.bolometer","id":"taxonomy.wikipedia.concept.wikipedia.bolometer.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.bolt-snap","id":"taxonomy.wikipedia.concept.wikipedia.bolt-snap.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.boolean-differential-calculus","id":"taxonomy.wikipedia.concept.wikipedia.boolean-differential-calculus.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.boring-manufacturing","id":"taxonomy.wikipedia.concept.wikipedia.boring-manufacturing.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.boundary-topology","id":"taxonomy.wikipedia.concept.wikipedia.boundary-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.bounded-quantifier","id":"taxonomy.wikipedia.concept.wikipedia.bounded-quantifier.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.bounded-variation","id":"taxonomy.wikipedia.concept.wikipedia.bounded-variation.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.bounding-point","id":"taxonomy.wikipedia.concept.wikipedia.bounding-point.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.braced-frame","id":"taxonomy.wikipedia.concept.wikipedia.braced-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.braitenberg-vehicle","id":"taxonomy.wikipedia.concept.wikipedia.braitenberg-vehicle.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.braking-chopper","id":"taxonomy.wikipedia.concept.wikipedia.braking-chopper.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brass-fastener","id":"taxonomy.wikipedia.concept.wikipedia.brass-fastener.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bread-clip","id":"taxonomy.wikipedia.concept.wikipedia.bread-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.breaking-capacity","id":"taxonomy.wikipedia.concept.wikipedia.breaking-capacity.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.breather-surface","id":"taxonomy.wikipedia.concept.wikipedia.breather-surface.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.breech-lock","id":"taxonomy.wikipedia.concept.wikipedia.breech-lock.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bressummer","id":"taxonomy.wikipedia.concept.wikipedia.bressummer.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.bridge-bearing","id":"taxonomy.wikipedia.concept.wikipedia.bridge-bearing.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bridge-strike","id":"taxonomy.wikipedia.concept.wikipedia.bridge-strike.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bridgeland-stability-condition","id":"taxonomy.wikipedia.concept.wikipedia.bridgeland-stability-condition.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.brokaw-bandgap-reference","id":"taxonomy.wikipedia.concept.wikipedia.brokaw-bandgap-reference.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.brooch","id":"taxonomy.wikipedia.concept.wikipedia.brooch.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","id":"taxonomy.wikipedia.concept.wikipedia.brouwer-heyting-kolmogorov-interpretation.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.bruhat-order","id":"taxonomy.wikipedia.concept.wikipedia.bruhat-order.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.brush-electric","id":"taxonomy.wikipedia.concept.wikipedia.brush-electric.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brushed-dc-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.brushed-dc-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brushless-dc-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.brushless-dc-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.bubble-sensor","id":"taxonomy.wikipedia.concept.wikipedia.bubble-sensor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.bulldog-clip","id":"taxonomy.wikipedia.concept.wikipedia.bulldog-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bus-holder","id":"taxonomy.wikipedia.concept.wikipedia.bus-holder.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.busemann-petty-problem","id":"taxonomy.wikipedia.concept.wikipedia.busemann-petty-problem.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.butt-welding","id":"taxonomy.wikipedia.concept.wikipedia.butt-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.butterfly-effect","id":"taxonomy.wikipedia.concept.wikipedia.butterfly-effect.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.butterfly-valve","id":"taxonomy.wikipedia.concept.wikipedia.butterfly-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.buttressed-core","id":"taxonomy.wikipedia.concept.wikipedia.buttressed-core.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.c-dl-g","id":"taxonomy.wikipedia.concept.wikipedia.c-dl-g.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.cagniard-de-hoop-method","id":"taxonomy.wikipedia.concept.wikipedia.cagniard-de-hoop-method.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.calcium-looping","id":"taxonomy.wikipedia.concept.wikipedia.calcium-looping.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.calculus-on-finite-weighted-graphs","id":"taxonomy.wikipedia.concept.wikipedia.calculus-on-finite-weighted-graphs.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.camcon-binary-actuator","id":"taxonomy.wikipedia.concept.wikipedia.camcon-binary-actuator.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.cameleon-protein","id":"taxonomy.wikipedia.concept.wikipedia.cameleon-protein.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.cantilever","id":"taxonomy.wikipedia.concept.wikipedia.cantilever.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.cantor-set","id":"taxonomy.wikipedia.concept.wikipedia.cantor-set.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.cantor-space","id":"taxonomy.wikipedia.concept.wikipedia.cantor-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.cantor-tree","id":"taxonomy.wikipedia.concept.wikipedia.cantor-tree.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.capella-engineering","id":"taxonomy.wikipedia.concept.wikipedia.capella-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.carlyle-circle","id":"taxonomy.wikipedia.concept.wikipedia.carlyle-circle.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.carnot-heat-engine","id":"taxonomy.wikipedia.concept.wikipedia.carnot-heat-engine.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.carr-du-champ-operator","id":"taxonomy.wikipedia.concept.wikipedia.carr-du-champ-operator.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.carrier-grade","id":"taxonomy.wikipedia.concept.wikipedia.carrier-grade.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.cartesian-circle","id":"taxonomy.wikipedia.concept.wikipedia.cartesian-circle.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cask-breather","id":"taxonomy.wikipedia.concept.wikipedia.cask-breather.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.category-mistake","id":"taxonomy.wikipedia.concept.wikipedia.category-mistake.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.category-of-manifolds","id":"taxonomy.wikipedia.concept.wikipedia.category-of-manifolds.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.category-of-markov-kernels","id":"taxonomy.wikipedia.concept.wikipedia.category-of-markov-kernels.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.category-of-measurable-spaces","id":"taxonomy.wikipedia.concept.wikipedia.category-of-measurable-spaces.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.cauchy-principal-value","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-principal-value.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.cauchy-product","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-product.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.cauchy-sequence","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-sequence.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.causal-closure","id":"taxonomy.wikipedia.concept.wikipedia.causal-closure.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.causal-model","id":"taxonomy.wikipedia.concept.wikipedia.causal-model.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.causal-theory-of-reference","id":"taxonomy.wikipedia.concept.wikipedia.causal-theory-of-reference.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.center-algebra","id":"taxonomy.wikipedia.concept.wikipedia.center-algebra.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.centerpoint-geometry","id":"taxonomy.wikipedia.concept.wikipedia.centerpoint-geometry.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.ceramic-engine","id":"taxonomy.wikipedia.concept.wikipedia.ceramic-engine.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.certificate-of-analysis","id":"taxonomy.wikipedia.concept.wikipedia.certificate-of-analysis.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.chain-complex","id":"taxonomy.wikipedia.concept.wikipedia.chain-complex.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.change-management-engineering","id":"taxonomy.wikipedia.concept.wikipedia.change-management-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.change-request","id":"taxonomy.wikipedia.concept.wikipedia.change-request.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.check-valve","id":"taxonomy.wikipedia.concept.wikipedia.check-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.chemical-field-effect-transistor","id":"taxonomy.wikipedia.concept.wikipedia.chemical-field-effect-transistor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.chemical-reaction-engineering","id":"taxonomy.wikipedia.concept.wikipedia.chemical-reaction-engineering.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.chemiresistor","id":"taxonomy.wikipedia.concept.wikipedia.chemiresistor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.chern-simons-theory","id":"taxonomy.wikipedia.concept.wikipedia.chern-simons-theory.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.chern-weil-theory","id":"taxonomy.wikipedia.concept.wikipedia.chern-weil-theory.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.chiplet","id":"taxonomy.wikipedia.concept.wikipedia.chiplet.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.chirp-z-transform","id":"taxonomy.wikipedia.concept.wikipedia.chirp-z-transform.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.chirplet-transform","id":"taxonomy.wikipedia.concept.wikipedia.chirplet-transform.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.church-turing-thesis","id":"taxonomy.wikipedia.concept.wikipedia.church-turing-thesis.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.chv-tal-sankoff-constants","id":"taxonomy.wikipedia.concept.wikipedia.chv-tal-sankoff-constants.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.circuit-topology-electrical","id":"taxonomy.wikipedia.concept.wikipedia.circuit-topology-electrical.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.circuit-total-limitation","id":"taxonomy.wikipedia.concept.wikipedia.circuit-total-limitation.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.circular-definition","id":"taxonomy.wikipedia.concept.wikipedia.circular-definition.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.circular-reasoning","id":"taxonomy.wikipedia.concept.wikipedia.circular-reasoning.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.closure-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.closure-mathematics.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.cluster-algebra","id":"taxonomy.wikipedia.concept.wikipedia.cluster-algebra.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.clutch-delay-valve","id":"taxonomy.wikipedia.concept.wikipedia.clutch-delay-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.cogging-torque","id":"taxonomy.wikipedia.concept.wikipedia.cogging-torque.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.cognitive-dissonance","id":"taxonomy.wikipedia.concept.wikipedia.cognitive-dissonance.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.coherent-extrapolated-volition","id":"taxonomy.wikipedia.concept.wikipedia.coherent-extrapolated-volition.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.coilgun","id":"taxonomy.wikipedia.concept.wikipedia.coilgun.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.coincidence","id":"taxonomy.wikipedia.concept.wikipedia.coincidence.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.cold-metal-transfer","id":"taxonomy.wikipedia.concept.wikipedia.cold-metal-transfer.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.cold-welding","id":"taxonomy.wikipedia.concept.wikipedia.cold-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.collectively-exhaustive-events","id":"taxonomy.wikipedia.concept.wikipedia.collectively-exhaustive-events.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.colloid-thruster","id":"taxonomy.wikipedia.concept.wikipedia.colloid-thruster.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.colonnette","id":"taxonomy.wikipedia.concept.wikipedia.colonnette.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.column","id":"taxonomy.wikipedia.concept.wikipedia.column.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.comb-drive","id":"taxonomy.wikipedia.concept.wikipedia.comb-drive.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.combinatorial-principles","id":"taxonomy.wikipedia.concept.wikipedia.combinatorial-principles.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.common-rail-electricity","id":"taxonomy.wikipedia.concept.wikipedia.common-rail-electricity.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.communal-reinforcement","id":"taxonomy.wikipedia.concept.wikipedia.communal-reinforcement.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.commutator-electric","id":"taxonomy.wikipedia.concept.wikipedia.commutator-electric.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.compact-group","id":"taxonomy.wikipedia.concept.wikipedia.compact-group.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.compossibility","id":"taxonomy.wikipedia.concept.wikipedia.compossibility.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.concurrent-engineering","id":"taxonomy.wikipedia.concept.wikipedia.concurrent-engineering.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.condenser-heat-transfer","id":"taxonomy.wikipedia.concept.wikipedia.condenser-heat-transfer.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.conditional-logic","id":"taxonomy.wikipedia.concept.wikipedia.conditional-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.cone-condition","id":"taxonomy.wikipedia.concept.wikipedia.cone-condition.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.constant-conjunction","id":"taxonomy.wikipedia.concept.wikipedia.constant-conjunction.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.constructive-analysis","id":"taxonomy.wikipedia.concept.wikipedia.constructive-analysis.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.continuous-function","id":"taxonomy.wikipedia.concept.wikipedia.continuous-function.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","id":"taxonomy.wikipedia.concept.wikipedia.contra-principia-negantem-non-est-disputandum.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.control-valve","id":"taxonomy.wikipedia.concept.wikipedia.control-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.convex-curve","id":"taxonomy.wikipedia.concept.wikipedia.convex-curve.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-metric-space","id":"taxonomy.wikipedia.concept.wikipedia.convex-metric-space.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-polygon","id":"taxonomy.wikipedia.concept.wikipedia.convex-polygon.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-set","id":"taxonomy.wikipedia.concept.wikipedia.convex-set.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-space","id":"taxonomy.wikipedia.concept.wikipedia.convex-space.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.copper-loss","id":"taxonomy.wikipedia.concept.wikipedia.copper-loss.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.correlative-based-fallacies","id":"taxonomy.wikipedia.concept.wikipedia.correlative-based-fallacies.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cosmological-argument","id":"taxonomy.wikipedia.concept.wikipedia.cosmological-argument.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.counterbore","id":"taxonomy.wikipedia.concept.wikipedia.counterbore.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.counterfactual-conditional","id":"taxonomy.wikipedia.concept.wikipedia.counterfactual-conditional.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.courtier-s-reply","id":"taxonomy.wikipedia.concept.wikipedia.courtier-s-reply.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cover-time","id":"taxonomy.wikipedia.concept.wikipedia.cover-time.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.cr-maill-re","id":"taxonomy.wikipedia.concept.wikipedia.cr-maill-re.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.credulity","id":"taxonomy.wikipedia.concept.wikipedia.credulity.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.cubicity","id":"taxonomy.wikipedia.concept.wikipedia.cubicity.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.cutting-sequence","id":"taxonomy.wikipedia.concept.wikipedia.cutting-sequence.field.wikipedia.discrete-mathematics","parent":"field.wikipedia.discrete-mathematics","type":"narrower"},{"child":"concept.wikipedia.cutting-tool-machining","id":"taxonomy.wikipedia.concept.wikipedia.cutting-tool-machining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.cutting-tool-material","id":"taxonomy.wikipedia.concept.wikipedia.cutting-tool-material.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.cvcc","id":"taxonomy.wikipedia.concept.wikipedia.cvcc.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.cycloid-gear","id":"taxonomy.wikipedia.concept.wikipedia.cycloid-gear.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.cycloidal-drive","id":"taxonomy.wikipedia.concept.wikipedia.cycloidal-drive.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.deal-grove-model","id":"taxonomy.wikipedia.concept.wikipedia.deal-grove-model.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.defensive-pessimism","id":"taxonomy.wikipedia.concept.wikipedia.defensive-pessimism.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.definition","id":"taxonomy.wikipedia.concept.wikipedia.definition.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.delta-functor","id":"taxonomy.wikipedia.concept.wikipedia.delta-functor.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.delusion","id":"taxonomy.wikipedia.concept.wikipedia.delusion.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.dempster-shafer-theory","id":"taxonomy.wikipedia.concept.wikipedia.dempster-shafer-theory.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.denying-the-antecedent","id":"taxonomy.wikipedia.concept.wikipedia.denying-the-antecedent.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.denying-the-correlative","id":"taxonomy.wikipedia.concept.wikipedia.denying-the-correlative.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.deontic-logic","id":"taxonomy.wikipedia.concept.wikipedia.deontic-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.design-manufacture-service","id":"taxonomy.wikipedia.concept.wikipedia.design-manufacture-service.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.design-of-experiments","id":"taxonomy.wikipedia.concept.wikipedia.design-of-experiments.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.dialectical-logic","id":"taxonomy.wikipedia.concept.wikipedia.dialectical-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.diaphragm-valve","id":"taxonomy.wikipedia.concept.wikipedia.diaphragm-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.dieudonn-plank","id":"taxonomy.wikipedia.concept.wikipedia.dieudonn-plank.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.differential-calculus","id":"taxonomy.wikipedia.concept.wikipedia.differential-calculus.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.differential-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.differential-mathematics.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.differential-mechanical-device","id":"taxonomy.wikipedia.concept.wikipedia.differential-mechanical-device.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.digifold","id":"taxonomy.wikipedia.concept.wikipedia.digifold.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.digital-micromirror-device","id":"taxonomy.wikipedia.concept.wikipedia.digital-micromirror-device.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.dilemma","id":"taxonomy.wikipedia.concept.wikipedia.dilemma.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.diode","id":"taxonomy.wikipedia.concept.wikipedia.diode.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","id":"taxonomy.wikipedia.concept.wikipedia.directed-assembly-of-micro-and-nano-structures.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.dirichlet-average","id":"taxonomy.wikipedia.concept.wikipedia.dirichlet-average.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.discontinuous-group","id":"taxonomy.wikipedia.concept.wikipedia.discontinuous-group.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.discrete-two-point-space","id":"taxonomy.wikipedia.concept.wikipedia.discrete-two-point-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.disquotational-principle","id":"taxonomy.wikipedia.concept.wikipedia.disquotational-principle.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.distinction-bias","id":"taxonomy.wikipedia.concept.wikipedia.distinction-bias.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.distinction-without-a-difference","id":"taxonomy.wikipedia.concept.wikipedia.distinction-without-a-difference.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.distributed-parameter-system","id":"taxonomy.wikipedia.concept.wikipedia.distributed-parameter-system.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.doctrine","id":"taxonomy.wikipedia.concept.wikipedia.doctrine.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.dominance-order","id":"taxonomy.wikipedia.concept.wikipedia.dominance-order.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.double-counting-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.double-counting-fallacy.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.downstream-manufacturing","id":"taxonomy.wikipedia.concept.wikipedia.downstream-manufacturing.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.doxastic-logic","id":"taxonomy.wikipedia.concept.wikipedia.doxastic-logic.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.drill-bit-sizes","id":"taxonomy.wikipedia.concept.wikipedia.drill-bit-sizes.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.drilling","id":"taxonomy.wikipedia.concept.wikipedia.drilling.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.dual-cone-and-polar-cone","id":"taxonomy.wikipedia.concept.wikipedia.dual-cone-and-polar-cone.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.dyadic-cubes","id":"taxonomy.wikipedia.concept.wikipedia.dyadic-cubes.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.dye-and-pry","id":"taxonomy.wikipedia.concept.wikipedia.dye-and-pry.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.ecological-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.ecological-fallacy.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","id":"taxonomy.wikipedia.concept.wikipedia.elastic-and-inelastic-collisions-apparatus.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.electronic-component","id":"taxonomy.wikipedia.concept.wikipedia.electronic-component.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.embedded-instrumentation","id":"taxonomy.wikipedia.concept.wikipedia.embedded-instrumentation.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.end-of-history-illusion","id":"taxonomy.wikipedia.concept.wikipedia.end-of-history-illusion.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.engineering-geology","id":"taxonomy.wikipedia.concept.wikipedia.engineering-geology.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.epicyclic-gearing","id":"taxonomy.wikipedia.concept.wikipedia.epicyclic-gearing.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.ergo-decedo","id":"taxonomy.wikipedia.concept.wikipedia.ergo-decedo.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.euler-spiral","id":"taxonomy.wikipedia.concept.wikipedia.euler-spiral.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.evidentialism","id":"taxonomy.wikipedia.concept.wikipedia.evidentialism.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.excluded-point-topology","id":"taxonomy.wikipedia.concept.wikipedia.excluded-point-topology.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.exercise-machine","id":"taxonomy.wikipedia.concept.wikipedia.exercise-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.existential-graph","id":"taxonomy.wikipedia.concept.wikipedia.existential-graph.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fallacy","id":"taxonomy.wikipedia.concept.wikipedia.fallacy.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fast-growing-hierarchy","id":"taxonomy.wikipedia.concept.wikipedia.fast-growing-hierarchy.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.fastener","id":"taxonomy.wikipedia.concept.wikipedia.fastener.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.field-programmable-gate-array","id":"taxonomy.wikipedia.concept.wikipedia.field-programmable-gate-array.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.fin-field-effect-transistor","id":"taxonomy.wikipedia.concept.wikipedia.fin-field-effect-transistor.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.fitch-notation","id":"taxonomy.wikipedia.concept.wikipedia.fitch-notation.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.floquet-theory","id":"taxonomy.wikipedia.concept.wikipedia.floquet-theory.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.flowability","id":"taxonomy.wikipedia.concept.wikipedia.flowability.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.flue-gas-condensation","id":"taxonomy.wikipedia.concept.wikipedia.flue-gas-condensation.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.formal-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.formal-fallacy.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fort-space","id":"taxonomy.wikipedia.concept.wikipedia.fort-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.four-slide","id":"taxonomy.wikipedia.concept.wikipedia.four-slide.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.fr-chet-manifold","id":"taxonomy.wikipedia.concept.wikipedia.fr-chet-manifold.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.free-choice-inference","id":"taxonomy.wikipedia.concept.wikipedia.free-choice-inference.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.furstenberg-boundary","id":"taxonomy.wikipedia.concept.wikipedia.furstenberg-boundary.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.game-semantics","id":"taxonomy.wikipedia.concept.wikipedia.game-semantics.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.gate-oxide","id":"taxonomy.wikipedia.concept.wikipedia.gate-oxide.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.gear-failure","id":"taxonomy.wikipedia.concept.wikipedia.gear-failure.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.gear-oil","id":"taxonomy.wikipedia.concept.wikipedia.gear-oil.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.gelfand-pair","id":"taxonomy.wikipedia.concept.wikipedia.gelfand-pair.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.gender-of-connectors-and-fasteners","id":"taxonomy.wikipedia.concept.wikipedia.gender-of-connectors-and-fasteners.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.generality-psychology","id":"taxonomy.wikipedia.concept.wikipedia.generality-psychology.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.geological-structure-measurement-by-lidar","id":"taxonomy.wikipedia.concept.wikipedia.geological-structure-measurement-by-lidar.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.geometric-topology-object","id":"taxonomy.wikipedia.concept.wikipedia.geometric-topology-object.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.geometry-of-interaction","id":"taxonomy.wikipedia.concept.wikipedia.geometry-of-interaction.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.ggnmos","id":"taxonomy.wikipedia.concept.wikipedia.ggnmos.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.graph-coloring","id":"taxonomy.wikipedia.concept.wikipedia.graph-coloring.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.group-algebra-of-a-locally-compact-group","id":"taxonomy.wikipedia.concept.wikipedia.group-algebra-of-a-locally-compact-group.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.gunslinger-effect","id":"taxonomy.wikipedia.concept.wikipedia.gunslinger-effect.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.harmonic-tensors","id":"taxonomy.wikipedia.concept.wikipedia.harmonic-tensors.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.heat-sink","id":"taxonomy.wikipedia.concept.wikipedia.heat-sink.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.heater-core","id":"taxonomy.wikipedia.concept.wikipedia.heater-core.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.helix-angle","id":"taxonomy.wikipedia.concept.wikipedia.helix-angle.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.hoist-device","id":"taxonomy.wikipedia.concept.wikipedia.hoist-device.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.hydraulic-cylinder","id":"taxonomy.wikipedia.concept.wikipedia.hydraulic-cylinder.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.infinite-regress","id":"taxonomy.wikipedia.concept.wikipedia.infinite-regress.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.inflatable-packer","id":"taxonomy.wikipedia.concept.wikipedia.inflatable-packer.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.informal-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.informal-fallacy.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.inventor-s-paradox","id":"taxonomy.wikipedia.concept.wikipedia.inventor-s-paradox.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.javelin-argument","id":"taxonomy.wikipedia.concept.wikipedia.javelin-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.linear-actuator","id":"taxonomy.wikipedia.concept.wikipedia.linear-actuator.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.local-skepticism","id":"taxonomy.wikipedia.concept.wikipedia.local-skepticism.concept.wikipedia.skepticism","parent":"concept.wikipedia.skepticism","type":"narrower"},{"child":"concept.wikipedia.logic-of-argumentation","id":"taxonomy.wikipedia.concept.wikipedia.logic-of-argumentation.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.logical-form","id":"taxonomy.wikipedia.concept.wikipedia.logical-form.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.logical-truth","id":"taxonomy.wikipedia.concept.wikipedia.logical-truth.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.loki-s-wager","id":"taxonomy.wikipedia.concept.wikipedia.loki-s-wager.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.moment-statistics","id":"taxonomy.wikipedia.concept.wikipedia.moment-statistics.field.statistics","parent":"field.statistics","type":"narrower"},{"child":"concept.wikipedia.nothing-to-hide-argument","id":"taxonomy.wikipedia.concept.wikipedia.nothing-to-hide-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.objection-argument","id":"taxonomy.wikipedia.concept.wikipedia.objection-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.philosophical-razor","id":"taxonomy.wikipedia.concept.wikipedia.philosophical-razor.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.pregeometry-model-theory","id":"taxonomy.wikipedia.concept.wikipedia.pregeometry-model-theory.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.reasonable-doubt","id":"taxonomy.wikipedia.concept.wikipedia.reasonable-doubt.concept.wikipedia.skepticism","parent":"concept.wikipedia.skepticism","type":"narrower"},{"child":"concept.wikipedia.residue-field","id":"taxonomy.wikipedia.concept.wikipedia.residue-field.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.sat","id":"taxonomy.wikipedia.concept.wikipedia.sat.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.seismic-base-isolation","id":"taxonomy.wikipedia.concept.wikipedia.seismic-base-isolation.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.supergeometry","id":"taxonomy.wikipedia.concept.wikipedia.supergeometry.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.thought-experiment","id":"taxonomy.wikipedia.concept.wikipedia.thought-experiment.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.valve-actuator","id":"taxonomy.wikipedia.concept.wikipedia.valve-actuator.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.vietoris-rips-filtration","id":"taxonomy.wikipedia.concept.wikipedia.vietoris-rips-filtration.field.wikipedia.discrete-mathematics","parent":"field.wikipedia.discrete-mathematics","type":"narrower"},{"child":"concept.wikipedia.welder-certification","id":"taxonomy.wikipedia.concept.wikipedia.welder-certification.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.welder","id":"taxonomy.wikipedia.concept.wikipedia.welder.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"field.wikipedia.algebraic-analysis","id":"taxonomy.wikipedia.field.wikipedia.algebraic-analysis.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"field.wikipedia.algebraic-number-theory","id":"taxonomy.wikipedia.field.wikipedia.algebraic-number-theory.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"field.wikipedia.appert-topology","id":"taxonomy.wikipedia.field.wikipedia.appert-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"field.wikipedia.argumentation-theory","id":"taxonomy.wikipedia.field.wikipedia.argumentation-theory.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"field.wikipedia.arithmetic-combinatorics","id":"taxonomy.wikipedia.field.wikipedia.arithmetic-combinatorics.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"field.wikipedia.arithmetic-dynamics","id":"taxonomy.wikipedia.field.wikipedia.arithmetic-dynamics.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"field.wikipedia.asymptotic-geometry","id":"taxonomy.wikipedia.field.wikipedia.asymptotic-geometry.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"field.wikipedia.biological-systems-engineering","id":"taxonomy.wikipedia.field.wikipedia.biological-systems-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"field.wikipedia.categorical-topology","id":"taxonomy.wikipedia.field.wikipedia.categorical-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"field.wikipedia.chemotronics","id":"taxonomy.wikipedia.field.wikipedia.chemotronics.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"field.wikipedia.computability-theory","id":"taxonomy.wikipedia.field.wikipedia.computability-theory.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"field.wikipedia.consensus-dynamics","id":"taxonomy.wikipedia.field.wikipedia.consensus-dynamics.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"field.wikipedia.convex-analysis","id":"taxonomy.wikipedia.field.wikipedia.convex-analysis.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"field.wikipedia.extremal-combinatorics","id":"taxonomy.wikipedia.field.wikipedia.extremal-combinatorics.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"field.wikipedia.geometric-analysis","id":"taxonomy.wikipedia.field.wikipedia.geometric-analysis.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"field.wikipedia.global-analysis","id":"taxonomy.wikipedia.field.wikipedia.global-analysis.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"field.wikipedia.noncommutative-harmonic-analysis","id":"taxonomy.wikipedia.field.wikipedia.noncommutative-harmonic-analysis.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"field.wikipedia.offshore-geotechnical-engineering","id":"taxonomy.wikipedia.field.wikipedia.offshore-geotechnical-engineering.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"field.wikipedia.projective-differential-geometry","id":"taxonomy.wikipedia.field.wikipedia.projective-differential-geometry.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"question.wikipedia.abc-conjecture","id":"taxonomy.wikipedia.question.wikipedia.abc-conjecture.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"theory.wikipedia.amitsur-levitzki-theorem","id":"taxonomy.wikipedia.theory.wikipedia.amitsur-levitzki-theorem.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"theory.wikipedia.apollonius-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.apollonius-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.auslander-buchsbaum-theorem","id":"taxonomy.wikipedia.theory.wikipedia.auslander-buchsbaum-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","id":"taxonomy.wikipedia.theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"theory.wikipedia.baire-category-theorem","id":"taxonomy.wikipedia.theory.wikipedia.baire-category-theorem.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"theory.wikipedia.beckman-quarles-theorem","id":"taxonomy.wikipedia.theory.wikipedia.beckman-quarles-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.beki-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.beki-s-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.bendixson-dulac-theorem","id":"taxonomy.wikipedia.theory.wikipedia.bendixson-dulac-theorem.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"theory.wikipedia.big-little-big-lemma","id":"taxonomy.wikipedia.theory.wikipedia.big-little-big-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.boolean-prime-ideal-theorem","id":"taxonomy.wikipedia.theory.wikipedia.boolean-prime-ideal-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.borel-cantelli-lemma","id":"taxonomy.wikipedia.theory.wikipedia.borel-cantelli-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.bourbaki-witt-theorem","id":"taxonomy.wikipedia.theory.wikipedia.bourbaki-witt-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.british-flag-theorem","id":"taxonomy.wikipedia.theory.wikipedia.british-flag-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.cantor-bernstein-theorem","id":"taxonomy.wikipedia.theory.wikipedia.cantor-bernstein-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.cantor-s-intersection-theorem","id":"taxonomy.wikipedia.theory.wikipedia.cantor-s-intersection-theorem.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"theory.wikipedia.casey-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.casey-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.cauchy-s-theorem-geometry","id":"taxonomy.wikipedia.theory.wikipedia.cauchy-s-theorem-geometry.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.commandino-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.commandino-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.constant-chord-theorem","id":"taxonomy.wikipedia.theory.wikipedia.constant-chord-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.dehn-s-lemma","id":"taxonomy.wikipedia.theory.wikipedia.dehn-s-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.eilenberg-watts-theorem","id":"taxonomy.wikipedia.theory.wikipedia.eilenberg-watts-theorem.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","id":"taxonomy.wikipedia.theory.wikipedia.gauss-s-lemma-riemannian-geometry.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.hilbert-burch-theorem","id":"taxonomy.wikipedia.theory.wikipedia.hilbert-burch-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"theory.wikipedia.hua-s-lemma","id":"taxonomy.wikipedia.theory.wikipedia.hua-s-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.krull-akizuki-theorem","id":"taxonomy.wikipedia.theory.wikipedia.krull-akizuki-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"}]}
\ No newline at end of file
+{"domains":[{"id":"roots","label":"Foundational human knowledge"},{"id":"formal","label":"Mathematics & formal systems"},{"id":"physical","label":"Physical sciences"},{"id":"earth","label":"Earth & environment"},{"id":"life","label":"Life sciences"},{"id":"health","label":"Medicine & health"},{"id":"social","label":"Human & social sciences"},{"id":"humanities","label":"Humanities & culture"},{"id":"engineering","label":"Engineering & technology"},{"id":"information","label":"Information & cognitive sciences"}],"edges":[{"dependency":"soft","source":"root.material","target":"practice.toolmaking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.toolmaking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.safe-danger","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.time-cycle","target":"practice.fire","type":"enabled"},{"dependency":"soft","source":"root.place","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.cause-effect","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.living-dead","target":"practice.tracking","type":"enabled"},{"dependency":"soft","source":"root.kin-social","target":"practice.oral-tradition","type":"enabled"},{"dependency":"soft","source":"root.quantity","target":"concept.counting","type":"enabled"},{"dependency":"soft","source":"concept.counting","target":"field.geometry","type":"enabled"},{"dependency":"soft","source":"practice.oral-tradition","target":"practice.writing","type":"enabled"},{"dependency":"soft","source":"root.time-cycle","target":"field.astronomy","type":"enabled"},{"dependency":"soft","source":"root.place","target":"field.navigation","type":"enabled"},{"dependency":"soft","source":"field.astronomy","target":"field.navigation","type":"supports"},{"dependency":"soft","source":"root.time-cycle","target":"practice.agriculture","type":"enabled"},{"dependency":"soft","source":"practice.tracking","target":"practice.agriculture","type":"derived_from"},{"dependency":"soft","source":"concept.counting","target":"field.algebra","type":"enabled"},{"dependency":"soft","source":"field.geometry","target":"field.optics","type":"enabled"},{"dependency":"soft","source":"field.navigation","target":"field.cartography","type":"enabled"},{"dependency":"soft","source":"practice.writing","target":"field.logic","type":"enabled"},{"dependency":"soft","source":"field.philosophy","target":"field.logic","type":"related"},{"dependency":"soft","source":"field.logic","target":"method.scientific","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.physics","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.chemistry","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.geology","type":"enabled"},{"dependency":"soft","source":"method.scientific","target":"field.biology","type":"enabled"},{"dependency":"soft","source":"field.geometry","target":"field.physics","type":"enabled"},{"dependency":"soft","source":"field.algebra","target":"field.physics","type":"enabled"},{"dependency":"hard","source":"claim.phlogiston","target":"concept.phlogiston-program","type":"depends_on"},{"dependency":"hard","source":"claim.miasma","target":"practice.miasma-control","type":"depends_on"},{"dependency":"soft","source":"field.biology","target":"claim.evolution","type":"enabled"},{"dependency":"soft","source":"claim.evolution","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.biology","target":"field.ecology","type":"derived_from"},{"dependency":"soft","source":"field.biology","target":"field.microbiology","type":"derived_from"},{"dependency":"soft","source":"field.microbiology","target":"claim.germ-theory","type":"supports"},{"dependency":"soft","source":"claim.germ-theory","target":"claim.miasma","type":"supersedes"},{"dependency":"soft","source":"field.chemistry","target":"field.thermodynamics","type":"enabled"},{"dependency":"soft","source":"field.physics","target":"field.electromagnetism","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.psychology","type":"enabled"},{"dependency":"soft","source":"field.statistics","target":"field.sociology","type":"enabled"},{"dependency":"soft","source":"field.physics","target":"claim.relativity","type":"derived_from"},{"dependency":"soft","source":"field.physics","target":"claim.quantum","type":"derived_from"},{"dependency":"soft","source":"claim.relativity","target":"field.cosmology","type":"enabled"},{"dependency":"soft","source":"field.astronomy","target":"field.cosmology","type":"derived_from"},{"dependency":"soft","source":"field.genetics","target":"field.molecular-biology","type":"enabled"},{"dependency":"soft","source":"field.biology","target":"field.molecular-biology","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.epidemiology","type":"enabled"},{"dependency":"soft","source":"claim.germ-theory","target":"field.epidemiology","type":"enabled"},{"dependency":"soft","source":"field.logic","target":"field.computer-science","type":"enabled"},{"dependency":"soft","source":"field.statistics","target":"field.ai","type":"enabled"},{"dependency":"soft","source":"field.computer-science","target":"field.ai","type":"derived_from"},{"dependency":"soft","source":"field.psychology","target":"field.cognitive-science","type":"derived_from"},{"dependency":"soft","source":"field.neuroscience","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"question.quantum-gravity","type":"enabled"},{"dependency":"soft","source":"claim.relativity","target":"question.quantum-gravity","type":"enabled"},{"dependency":"soft","source":"field.cosmology","target":"question.dark-matter","type":"derived_from"},{"dependency":"soft","source":"field.cosmology","target":"question.dark-energy","type":"derived_from"},{"dependency":"soft","source":"field.molecular-biology","target":"question.origin-life","type":"enabled"},{"dependency":"soft","source":"field.neuroscience","target":"question.consciousness","type":"enabled"},{"dependency":"soft","source":"field.cognitive-science","target":"question.consciousness","type":"enabled"},{"dependency":"soft","source":"field.molecular-biology","target":"question.aging","type":"enabled"},{"dependency":"soft","source":"field.climatology","target":"question.predict-climate","type":"derived_from"},{"dependency":"soft","source":"field.ai","target":"question.general-ai","type":"derived_from"},{"dependency":"soft","source":"field.logic","target":"question.math-foundations","type":"derived_from"},{"dependency":"soft","source":"field.sociology","target":"question.social-prediction","type":"derived_from"},{"dependency":"soft","source":"field.statistics","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.chemistry","target":"field.molecular-biology","type":"related"},{"dependency":"soft","source":"field.physics","target":"field.engineering","type":"related"},{"dependency":"soft","source":"field.computer-science","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"field.ai","target":"field.systems-biology","type":"related"},{"dependency":"soft","source":"field.ecology","target":"field.climatology","type":"related"},{"dependency":"soft","source":"field.anthropology","target":"field.cognitive-science","type":"related"},{"dependency":"soft","source":"field.psychology","target":"field.neuroscience","type":"related"},{"dependency":"soft","source":"field.information-theory","target":"field.genetics","type":"related"},{"dependency":"soft","source":"field.physics","target":"smoke.automate-merge","type":"related"},{"source":"physical.dark-energy","target":"physical.cosmic-acceleration","type":"related"},{"dependency":"hard","source":"physical.lambda-cdm","target":"physical.cosmological-constant-de","type":"depends_on"},{"source":"physical.wcdm","target":"physical.lambda-cdm","type":"refines"},{"source":"physical.w0wa-cdm","target":"physical.wcdm","type":"refines"},{"source":"physical.evolving-dark-energy","target":"physical.w0wa-cdm","type":"related"},{"source":"physical.desi-dr2-bao","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.desi-dr2-bao","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.desi-dr2-lya-fullshape","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.desi-dr2-lya-fullshape","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.lambda-cdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.w0wa-cdm","type":"tests"},{"source":"physical.desi-dr2-bao","target":"physical.bao","type":"derived_from"},{"source":"physical.standard-model-particle-physics","target":"field.physics","type":"derived_from"},{"source":"physical.gravitational-wave-interferometry","target":"field.physics","type":"related"},{"source":"physical.gw150914","target":"physical.gravitational-wave-interferometry","type":"derived_from"},{"source":"physical.gw150914","target":"claim.relativity","type":"supports"},{"source":"physical.si-defining-constants","target":"physical.precision-metrology","type":"related"},{"source":"physical.codata-fundamental-constants","target":"physical.precision-metrology","type":"supports"},{"source":"physical.dark-energy","target":"field.cosmology","type":"related"},{"source":"physical.lambda-cdm","target":"field.cosmology","type":"related"},{"source":"physical.bao","target":"field.cosmology","type":"related"},{"source":"physical.des-y6-dark-energy","target":"physical.wcdm","type":"tests"},{"source":"physical.des-y6-dark-energy","target":"physical.dark-energy","type":"supports"},{"source":"physical.general-relativity","target":"field.physics","type":"related"},{"source":"physical.gravitational-wave-interferometry","target":"physical.general-relativity","type":"tests"},{"source":"physical.gw150914","target":"physical.general-relativity","type":"supports"},{"source":"physical.gw250114","target":"physical.general-relativity","type":"tests"},{"source":"physical.gwtc5-cosmology-gr","target":"physical.general-relativity","type":"tests"},{"source":"physical.gwtc5-cosmology-gr","target":"field.cosmology","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.classical-mechanics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.newtonian-mechanics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.lagrangian-mechanics","type":"related"},{"dependency":"soft","source":"physical.lagrangian-mechanics","target":"physical.hamiltonian-mechanics","type":"related"},{"dependency":"soft","source":"physical.hamiltonian-mechanics","target":"physical.phase-space","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.chaos-theory","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.continuum-mechanics","type":"related"},{"dependency":"soft","source":"physical.continuum-mechanics","target":"physical.fluid-dynamics","type":"related"},{"dependency":"soft","source":"physical.classical-mechanics","target":"physical.classical-wave-theory","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.special-relativity","type":"related"},{"dependency":"soft","source":"physical.special-relativity","target":"physical.lorentz-transformations","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.equivalence-principle","type":"related"},{"dependency":"soft","source":"physical.special-relativity","target":"physical.spacetime","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.black-holes","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.schwarzschild-solution","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.kerr-solution","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-lensing","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-time-dilation","type":"related"},{"dependency":"soft","source":"physical.general-relativity","target":"physical.gravitational-waves","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.thermodynamic-entropy","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.first-law-thermodynamics","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.second-law-thermodynamics","type":"related"},{"dependency":"soft","source":"field.thermodynamics","target":"physical.statistical-mechanics","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.boltzmann-distribution","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.partition-function","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.fluctuation-dissipation","type":"related"},{"dependency":"soft","source":"physical.statistical-mechanics","target":"physical.phase-transitions","type":"related"},{"dependency":"soft","source":"physical.phase-transitions","target":"physical.renormalization-group","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.condensed-matter-physics","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.superconductivity","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.superfluidity","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.bose-einstein-condensate","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.band-theory","type":"related"},{"dependency":"soft","source":"physical.band-theory","target":"physical.semiconductor-physics","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.quantum-hall-effect","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.topological-phases","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.phonons","type":"related"},{"dependency":"soft","source":"physical.condensed-matter-physics","target":"physical.density-functional-theory","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.atomic-physics","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.molecular-physics","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.spectroscopy","type":"related"},{"dependency":"soft","source":"physical.atomic-physics","target":"physical.laser-physics","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.photoelectric-effect","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.compton-scattering","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.quantum-entanglement","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.uncertainty-principle","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.schrodinger-equation","type":"related"},{"dependency":"soft","source":"claim.quantum","target":"physical.quantum-field-theory","type":"related"},{"dependency":"soft","source":"physical.quantum-field-theory","target":"physical.gauge-symmetry","type":"related"},{"dependency":"soft","source":"physical.quantum-field-theory","target":"physical.quantum-electrodynamics","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.quantum-chromodynamics","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.electroweak-theory","type":"related"},{"dependency":"soft","source":"physical.electroweak-theory","target":"physical.spontaneous-symmetry-breaking","type":"related"},{"dependency":"soft","source":"physical.electroweak-theory","target":"physical.higgs-mechanism","type":"related"},{"dependency":"soft","source":"physical.higgs-mechanism","target":"physical.higgs-boson","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.quarks","type":"related"},{"dependency":"soft","source":"physical.standard-model-particle-physics","target":"physical.leptons","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.gluons","type":"related"},{"dependency":"soft","source":"physical.leptons","target":"physical.neutrino-oscillation","type":"related"},{"dependency":"soft","source":"physical.quarks","target":"physical.ckm-matrix","type":"related"},{"dependency":"soft","source":"physical.ckm-matrix","target":"physical.cp-violation","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.proton","type":"related"},{"dependency":"soft","source":"physical.quantum-chromodynamics","target":"physical.neutron","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.nuclear-physics","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-shell-model","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.radioactive-decay","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-fission","type":"related"},{"dependency":"soft","source":"physical.nuclear-physics","target":"physical.nuclear-fusion","type":"related"},{"dependency":"soft","source":"field.physics","target":"physical.plasma-physics","type":"related"},{"dependency":"soft","source":"physical.plasma-physics","target":"physical.magnetohydrodynamics","type":"related"},{"dependency":"soft","source":"field.astronomy","target":"physical.astrophysics","type":"related"},{"dependency":"soft","source":"physical.astrophysics","target":"physical.stellar-evolution","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.hertzsprung-russell-diagram","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.white-dwarfs","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.neutron-stars","type":"related"},{"dependency":"soft","source":"physical.neutron-stars","target":"physical.pulsars","type":"related"},{"dependency":"soft","source":"physical.stellar-evolution","target":"physical.supernovae","type":"related"},{"dependency":"soft","source":"physical.black-holes","target":"physical.accretion-disks","type":"related"},{"dependency":"soft","source":"physical.accretion-disks","target":"physical.active-galactic-nuclei","type":"related"},{"dependency":"soft","source":"field.astronomy","target":"physical.exoplanet-transit-method","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.cosmic-microwave-background","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.inflationary-cosmology","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.big-bang-nucleosynthesis","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.hubble-lemaitre-law","type":"related"},{"dependency":"soft","source":"physical.gravitational-wave-interferometry","target":"physical.gw-standard-sirens","type":"related"},{"dependency":"soft","source":"physical.gravitational-lensing","target":"physical.strong-gravitational-lensing","type":"related"},{"dependency":"soft","source":"physical.gravitational-lensing","target":"physical.weak-gravitational-lensing","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.large-scale-structure","type":"related"},{"dependency":"soft","source":"physical.large-scale-structure","target":"physical.baryon-acoustic-oscillations","type":"related"},{"dependency":"soft","source":"field.cosmology","target":"physical.dark-matter-cosmology","type":"related"},{"source":"physical.quantum-mechanics","target":"field.physics","type":"related"},{"source":"physical.quantum-field-theory","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.standard-model-particle-physics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.higgs-field","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.higgs-boson","target":"physical.higgs-field","type":"supports"},{"source":"physical.electroweak-theory","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quantum-electrodynamics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quantum-chromodynamics","target":"physical.quantum-field-theory","type":"depends_on"},{"source":"physical.quarks","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.leptons","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.neutrinos","target":"physical.leptons","type":"related"},{"source":"physical.gauge-bosons","target":"physical.standard-model-particle-physics","type":"related"},{"source":"physical.gluon","target":"physical.quantum-chromodynamics","type":"related"},{"source":"physical.photon","target":"physical.quantum-electrodynamics","type":"related"},{"source":"physical.w-z-bosons","target":"physical.electroweak-theory","type":"related"},{"source":"physical.top-quark","target":"physical.quarks","type":"related"},{"source":"physical.large-hadron-collider","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.atlas-detector","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.cms-detector","target":"physical.higgs-discovery-2012","type":"enabled"},{"source":"physical.higgs-discovery-2012","target":"physical.higgs-boson","type":"supports"},{"source":"physical.spacetime","target":"physical.general-relativity","type":"related"},{"source":"physical.gravitational-waves","target":"physical.general-relativity","type":"derived_from"},{"source":"physical.black-holes","target":"physical.general-relativity","type":"related"},{"source":"physical.neutron-stars","target":"field.astronomy","type":"related"},{"source":"physical.binary-black-holes","target":"physical.black-holes","type":"related"},{"source":"physical.binary-neutron-stars","target":"physical.neutron-stars","type":"related"},{"source":"physical.ligo","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.virgo","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.kagra","target":"physical.gravitational-wave-interferometry","type":"related"},{"source":"physical.gw150914","target":"physical.ligo","type":"derived_from"},{"source":"physical.gw170817","target":"physical.gravitational-waves","type":"supports"},{"source":"physical.strong-field-gr-tests","target":"physical.general-relativity","type":"tests"},{"source":"field.cosmology","target":"field.astronomy","type":"related"},{"source":"physical.cosmic-expansion","target":"field.cosmology","type":"related"},{"source":"physical.big-bang","target":"physical.cosmic-expansion","type":"related"},{"source":"physical.cosmic-microwave-background","target":"physical.big-bang","type":"supports"},{"source":"physical.cosmic-inflation","target":"physical.big-bang","type":"refines"},{"source":"physical.dark-matter","target":"field.cosmology","type":"related"},{"source":"physical.lambda-cdm","target":"physical.dark-matter","type":"depends_on"},{"source":"physical.gravitational-lensing","target":"physical.dark-matter","type":"tests"},{"source":"physical.large-scale-structure","target":"physical.dark-matter","type":"related"},{"source":"physical.galaxy-clusters","target":"physical.dark-matter","type":"related"},{"source":"physical.primordial-nucleosynthesis","target":"physical.big-bang","type":"supports"},{"source":"physical.desi","target":"physical.desi-dr2-bao","type":"enabled"},{"source":"physical.desi-dr2-bao","target":"physical.desi","type":"derived_from"},{"source":"physical.roman-space-telescope","target":"physical.dark-energy","type":"related"},{"source":"physical.quantum-information-science","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.quantum-entanglement","target":"physical.quantum-mechanics","type":"derived_from"},{"source":"physical.quantum-superposition","target":"physical.quantum-mechanics","type":"derived_from"},{"source":"physical.quantum-computing","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.qubit","target":"physical.quantum-computing","type":"related"},{"source":"physical.trapped-ion-quantum-computing","target":"physical.quantum-computing","type":"refines"},{"source":"physical.quantum-sensing","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.quantum-networking","target":"physical.quantum-information-science","type":"depends_on"},{"source":"physical.atomic-clocks","target":"physical.spectroscopy","type":"related"},{"source":"physical.optical-clocks","target":"physical.atomic-clocks","type":"refines"},{"source":"physical.spectroscopy","target":"field.optics","type":"related"},{"source":"physical.optical-frequency-combs","target":"physical.spectroscopy","type":"enabled"},{"source":"physical.ultracold-atoms","target":"physical.quantum-mechanics","type":"related"},{"source":"physical.quantum-many-body-physics","target":"physical.quantum-mechanics","type":"depends_on"},{"source":"physical.quantum-simulation","target":"physical.quantum-many-body-physics","type":"depends_on"},{"source":"physical.si-system","target":"field.physics","type":"related"},{"source":"physical.si-defining-constants","target":"physical.si-system","type":"supports"},{"source":"physical.speed-of-light-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.planck-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.elementary-charge","target":"physical.si-defining-constants","type":"related"},{"source":"physical.boltzmann-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.avogadro-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.cesium-hyperfine-frequency","target":"physical.si-defining-constants","type":"related"},{"source":"physical.luminous-efficacy-constant","target":"physical.si-defining-constants","type":"related"},{"source":"physical.codata-fundamental-constants","target":"physical.si-defining-constants","type":"supports"},{"source":"field.thermodynamics","target":"field.physics","type":"related"},{"source":"physical.chemistry-webbook","target":"field.chemistry","type":"related"},{"source":"physical.refprop","target":"field.thermodynamics","type":"related"},{"source":"physical.janaf-thermochemical-tables","target":"field.thermodynamics","type":"related"},{"source":"physical.mass-spectral-library","target":"physical.spectroscopy","type":"related"},{"source":"physical.xps-database","target":"physical.spectroscopy","type":"related"},{"source":"physical.thermochemical-data","target":"field.chemistry","type":"related"},{"source":"physical.thermophysical-properties","target":"field.thermodynamics","type":"related"},{"source":"physical.superconductivity","target":"physical.quantum-mechanics","type":"related"},{"source":"physical.spectroscopic-reference-data","target":"physical.spectroscopy","type":"supports"},{"source":"field.quantum-gravity","target":"concept.quantum-nature-of-gravity","type":"related"},{"source":"concept.quantum-nature-of-gravity","target":"concept.gravity-mediated-entanglement","type":"related"},{"source":"method.bmv-entanglement-witness","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"method.mass-superposition-probe","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"concept.quantum-mediator-principle","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"concept.spin-correlation-readout","target":"method.bmv-entanglement-witness","type":"enabled"},{"source":"concept.gravitational-phase-evolution","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"evidence.bmv-proposal-2017","target":"method.bmv-entanglement-witness","type":"supports"},{"source":"theory.classical-gravity-qft-entanglement","target":"concept.gravity-mediated-entanglement","type":"supports"},{"source":"evidence.classical-gravity-entanglement-2025","target":"theory.classical-gravity-qft-entanglement","type":"supports"},{"source":"concept.entanglement-scaling-discriminator","target":"theory.classical-gravity-qft-entanglement","type":"tests"},{"source":"concept.quantum-information-gravity-test","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"method.single-graviton-quantum-sensing","target":"concept.single-graviton-signature","type":"tests"},{"source":"concept.single-graviton-signature","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"field.loop-quantum-gravity","target":"field.quantum-gravity","type":"related"},{"source":"concept.spin-network","target":"field.loop-quantum-gravity","type":"related"},{"source":"concept.discrete-quantum-geometry","target":"concept.spin-network","type":"derived_from"},{"source":"concept.area-operator","target":"concept.discrete-quantum-geometry","type":"supports"},{"source":"concept.volume-operator","target":"concept.discrete-quantum-geometry","type":"supports"},{"source":"method.connection-representation","target":"field.loop-quantum-gravity","type":"enabled"},{"source":"concept.hamiltonian-constraint","target":"field.loop-quantum-gravity","type":"related"},{"source":"theory.ads-cft","target":"field.quantum-gravity","type":"related"},{"source":"concept.holographic-duality","target":"theory.ads-cft","type":"derived_from"},{"source":"concept.large-n-limit","target":"theory.ads-cft","type":"related"},{"source":"theory.asymptotic-safety","target":"field.quantum-gravity","type":"related"},{"source":"method.functional-rg-gravity","target":"theory.asymptotic-safety","type":"enabled"},{"source":"concept.running-newton-constant","target":"method.functional-rg-gravity","type":"derived_from"},{"source":"theory.causal-dynamical-triangulations","target":"field.quantum-gravity","type":"related"},{"source":"method.sum-over-geometries","target":"theory.causal-dynamical-triangulations","type":"enabled"},{"source":"concept.emergent-four-dimensionality","target":"theory.causal-dynamical-triangulations","type":"supports"},{"source":"theory.causal-set","target":"field.quantum-gravity","type":"related"},{"source":"concept.local-finiteness","target":"theory.causal-set","type":"related"},{"source":"concept.causal-partial-order","target":"theory.causal-set","type":"related"},{"source":"concept.minimal-observable-length","target":"field.quantum-gravity","type":"related"},{"source":"theory.generalized-uncertainty-relation","target":"concept.minimal-observable-length","type":"supports"},{"source":"method.minimal-length-hilbert-space","target":"theory.generalized-uncertainty-relation","type":"enabled"},{"source":"concept.lorentz-invariance-violation","target":"field.quantum-gravity","type":"related"},{"source":"method.gamma-ray-burst-dispersion-test","target":"concept.lorentz-invariance-violation","type":"tests"},{"source":"instrument.fermi-lat","target":"method.gamma-ray-burst-dispersion-test","type":"enabled"},{"source":"dataset.grb090510","target":"method.gamma-ray-burst-dispersion-test","type":"enabled"},{"source":"evidence.qg-liv-constraint-2013","target":"concept.lorentz-invariance-violation","type":"tests"},{"source":"field.dark-matter","target":"theory.wimp-dark-matter","type":"related"},{"source":"method.direct-detection","target":"theory.wimp-dark-matter","type":"tests"},{"source":"instrument.xenonnt","target":"method.direct-detection","type":"enabled"},{"source":"dataset.xenonnt-3p1-tonne-year","target":"instrument.xenonnt","type":"derived_from"},{"source":"concept.nuclear-recoil-signal","target":"method.direct-detection","type":"related"},{"source":"concept.spin-independent-cross-section","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.xenonnt-null-2025","target":"theory.wimp-dark-matter","type":"tests"},{"source":"evidence.xenonnt-null-2025","target":"concept.spin-independent-cross-section","type":"refines"},{"source":"instrument.lux-zeplin","target":"method.direct-detection","type":"enabled"},{"source":"dataset.lz-4p2-tonne-year","target":"instrument.lux-zeplin","type":"derived_from"},{"source":"concept.spin-dependent-cross-section","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.lz-null-2024","target":"theory.wimp-dark-matter","type":"tests"},{"source":"evidence.lz-null-2024","target":"concept.spin-dependent-cross-section","type":"refines"},{"source":"concept.wimp-parameter-space","target":"theory.wimp-dark-matter","type":"related"},{"source":"evidence.lz-null-2024","target":"concept.wimp-parameter-space","type":"refines"},{"source":"evidence.xenonnt-null-2025","target":"concept.wimp-parameter-space","type":"refines"},{"source":"evidence.lz-high-energy-event-2026","target":"theory.wimp-dark-matter","type":"tests"},{"source":"concept.look-elsewhere-corrected-significance","target":"evidence.lz-high-energy-event-2026","type":"refines"},{"source":"theory.cosmic-ray-boosted-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.crdm-direct-search","target":"theory.cosmic-ray-boosted-dark-matter","type":"tests"},{"source":"concept.sub-gev-dark-matter","target":"theory.cosmic-ray-boosted-dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"theory.cosmic-ray-boosted-dark-matter","type":"tests"},{"source":"concept.crdm-nucleon-cross-section","target":"theory.cosmic-ray-boosted-dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"concept.crdm-nucleon-cross-section","type":"refines"},{"source":"theory.axion-dark-matter","target":"field.dark-matter","type":"related"},{"source":"instrument.admx","target":"theory.axion-dark-matter","type":"tests"},{"source":"method.axion-haloscope","target":"instrument.admx","type":"enabled"},{"source":"dataset.admx-run1b","target":"instrument.admx","type":"derived_from"},{"source":"theory.dfsz-axion","target":"theory.axion-dark-matter","type":"related"},{"source":"concept.axion-photon-conversion","target":"method.axion-haloscope","type":"enabled"},{"source":"evidence.admx-dfsz-exclusion","target":"theory.dfsz-axion","type":"tests"},{"source":"theory.primordial-black-hole-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.microlensing-dark-matter","target":"theory.primordial-black-hole-dark-matter","type":"tests"},{"source":"dataset.ogle-five-year-events","target":"method.microlensing-dark-matter","type":"enabled"},{"source":"concept.earth-mass-pbh","target":"theory.primordial-black-hole-dark-matter","type":"related"},{"source":"evidence.ogle-pbh-constraint","target":"concept.earth-mass-pbh","type":"tests"},{"source":"theory.fuzzy-dark-matter","target":"field.dark-matter","type":"related"},{"source":"method.lyman-alpha-forest-constraint","target":"theory.fuzzy-dark-matter","type":"tests"},{"source":"dataset.xq100-hires-mike","target":"method.lyman-alpha-forest-constraint","type":"enabled"},{"source":"concept.fuzzy-dm-mass","target":"theory.fuzzy-dark-matter","type":"related"},{"source":"evidence.fuzzy-dm-lyman-alpha-limit","target":"concept.fuzzy-dm-mass","type":"refines"},{"source":"theory.self-interacting-dark-matter","target":"field.dark-matter","type":"related"},{"source":"concept.finite-range-dark-force","target":"theory.self-interacting-dark-matter","type":"related"},{"source":"event.bullet-cluster","target":"theory.self-interacting-dark-matter","type":"tests"},{"source":"method.cluster-offset-constraint","target":"event.bullet-cluster","type":"enabled"},{"source":"concept.dark-matter-self-interaction-cross-section","target":"theory.self-interacting-dark-matter","type":"related"},{"source":"method.cluster-offset-constraint","target":"concept.dark-matter-self-interaction-cross-section","type":"refines"},{"source":"concept.dark-matter-candidate-space","target":"field.dark-matter","type":"related"},{"source":"concept.null-result-constraint","target":"evidence.xenonnt-null-2025","type":"derived_from"},{"source":"concept.null-result-constraint","target":"evidence.lz-null-2024","type":"derived_from"},{"source":"concept.complementary-dark-matter-searches","target":"concept.dark-matter-candidate-space","type":"related"},{"source":"concept.quantum-nature-of-gravity","target":"concept.gravity-mediated-entanglement","type":"tests"},{"source":"concept.entanglement-scaling-discriminator","target":"concept.quantum-nature-of-gravity","type":"tests"},{"source":"concept.spin-network","target":"field.loop-quantum-gravity","type":"enabled"},{"source":"concept.large-n-limit","target":"theory.ads-cft","type":"enabled"},{"source":"concept.local-finiteness","target":"theory.causal-set","type":"enabled"},{"source":"concept.causal-partial-order","target":"theory.causal-set","type":"enabled"},{"source":"evidence.lz-null-2024","target":"concept.spin-independent-cross-section","type":"refines"},{"source":"instrument.lux-zeplin","target":"method.crdm-direct-search","type":"enabled"},{"source":"concept.dfsz-axion","target":"theory.axion-dark-matter","type":"related"},{"source":"evidence.admx-dfsz-exclusion","target":"concept.dfsz-axion","type":"tests"},{"source":"evidence.admx-dfsz-exclusion","target":"theory.axion-dark-matter","type":"refines"},{"source":"concept.ultrashort-microlensing-events","target":"dataset.ogle-five-year-events","type":"derived_from"},{"source":"evidence.fuzzy-dm-lyman-alpha-limit","target":"field.dark-matter","type":"related"},{"source":"evidence.ogle-pbh-constraint","target":"field.dark-matter","type":"related"},{"source":"evidence.admx-dfsz-exclusion","target":"field.dark-matter","type":"related"},{"source":"evidence.lz-crdm-null-2025","target":"field.dark-matter","type":"related"},{"source":"physical.ybco-grain-boundary-orientation-1988","sources":[{"id":"source.dimos-ibm-abstract","url":"https://research.ibm.com/publications/orientation-dependence-of-grain-boundary-critical-currents-in-yba2cu3o7-bicrystals"},{"id":"source.goyal-rabits-1996","url":"https://api.crossref.org/works/10.1063/1.117489"}],"summary":"The measured orientation dependence in YBCO bicrystals supports the importance of biaxial texture addressed by Goyal’s textured-substrate method. This is support for the design rationale, not a replication of tape performance or proof of a direct historical derivation.","target":"engineering.biaxially-textured-ybco-tapes-1996","type":"supports"},{"source":"engineering.tfmc-nint-stack-in-plate","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The TFMC’s implemented NINT winding-pack technology enabled the reported high-field magnet test in that apparatus; this relationship does not assert that every NINT magnet reaches 20.1 T.","target":"physical.tfmc-20-1t-demonstration","type":"enabled"},{"source":"engineering.tfmc-demountable-nanohm-joints","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The internal demountable pancake-to-pancake joints provided low-resistance current transfer between modules of the implemented TFMC stack-in-plate assembly.","target":"engineering.tfmc-nint-stack-in-plate","type":"enabled"},{"source":"physical.tfmc-open-circuit-quench-damage","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The intentional 31.5 kA open-circuit quench tested passive self-protection in the fusion-scale NINT TFMC and produced localized thermal damage in this non-optimized design.","target":"engineering.tfmc-nint-stack-in-plate","type":"tests"},{"source":"physical.tfmc-20-1t-demonstration","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"The reported 20.1 T TFMC demonstration supports representative-scale magnet readiness for the authors’ high-field REBCO fusion pathway. This is component-level support; it does not establish plasma gain or net electricity generation.","target":"physical.high-field-rebco-fusion-pathway","type":"supports"},{"source":"engineering.ybco-y2o3-high-field-wire-2021","sources":[{"id":"source.molodyk-mit-paper","url":"https://eng.s-innovations.ru/upload/iblock/4c4/4c4a3119a03bbb5b8113924ad1324714.pdf"},{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"summary":"Molodyk’s tested high-field industrial YBCO wire supports materials feasibility for high-field REBCO fusion-magnet designs: the TFMC program specifically cites industrial tape performance and volume as enabling large-scale magnets. No supplier-lot identity for every TFMC tape is inferred.","target":"physical.high-field-rebco-fusion-pathway","type":"supports"},{"source":"claim.frontier.pmid-42853148","sources":[{"id":"source.frontier.pmid-42853148","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42853148%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42853148 names Opportunistic Infections: \"Each presented with early-onset combined immunodeficiency characterized by hypo- or agammaglobulinemia and marked susceptibility to opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42842684","sources":[{"id":"source.frontier.pmid-42842684","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42842684%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42842684 names meiotic drive: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","target":"concept.go.go0110134","type":"related"},{"source":"claim.frontier.pmid-42829444","sources":[{"id":"source.frontier.pmid-42829444","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42829444%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42829444 names immune response: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42827305","sources":[{"id":"source.frontier.pmid-42827305","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827305%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827305 names circadian rhythm: \"The Clock (Clk) gene encodes a core transcriptional regulator of circadian rhythms and contains a polymorphic polyglutamine (polyQ) tract whose evolutionary significance remains unclear.\"","target":"concept.go.go0007623","type":"related"},{"source":"claim.frontier.pmid-42826334","sources":[{"id":"source.frontier.pmid-42826334","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42826334%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42826334 names Risk Factors: \"This study investigates the role of cytochrome P450 2C19 (CYP2C19) gene polymorphisms and dyslipidaemic metabolism in ischemic cerebrovascular disease among Mongolian patients, analyzing their interaction with conventional risk factors.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42821620","sources":[{"id":"source.frontier.pmid-42821620","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821620%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821620 names Cross-sectional study: \"Between 2022 and 2024, this cross-sectional study was done in rural and periurban villages of the Ngounié and Moyen-Ogooué provinces of Gabon.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42821607","sources":[{"id":"source.frontier.pmid-42821607","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821607%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821607 names Systems Theory: \"By uncovering scaling behaviors through the integration of complex systems theory and blockchain data analytics, this work provides a principled framework for understanding the underlying mechanisms of decentralized financial systems.\"","target":"concept.mesh.d013598","type":"related"},{"source":"claim.frontier.pmid-42821558","sources":[{"id":"source.frontier.pmid-42821558","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821558%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42821558 names Risk Factors: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42809586","sources":[{"id":"source.frontier.pmid-42809586","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42809586%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42809586 names Proteomics: \"Here we investigated whether ASD-associated gut microbiota could exhibit altered inflammatory molecular outputs by integrating chemistry-driven profiling of fecal lipopolysaccharides (LPS), functional bacterial proteomics, and neuroimmune cellular assays.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42806681","sources":[{"id":"source.frontier.pmid-42806681","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806681%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42806681 names Respiratory Tract Infections: \"This study assessed the impact of CMV-associated lower respiratory tract infections (LRTIs), diagnosed by polymerase chain reaction (PCR) testing of bronchoalveolar lavage fluid (BALF), focusing on coinfections and clinical outcomes.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42806242","sources":[{"id":"source.frontier.pmid-42806242","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806242%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42806242 names Genomics: \"Here, we combine scRNAseq with evolutionary genomics to understand whether certain cell types exhibit faster evolutionary divergence (using their characteristic genes) than other types of cells (using intestine, head kidney, liver and gill tissues from an emerging model organism, the threespine stickleback).\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42755230","sources":[{"id":"source.frontier.pmid-42755230","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755230%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755230 names Genomics: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42814760","sources":[{"id":"source.frontier.pmid-42814760","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814760%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42814760 names Gastroenterology: \"A draft pathway was developed by the study team comprising gastroenterology and infectious disease specialists, followed by an iterative end user-centered design approach.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42814704","sources":[{"id":"source.frontier.pmid-42814704","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814704%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42814704 names Cross-sectional study: \"This large cross-sectional study (556,474 patients) provides detailed age- and sex-specific prevalence estimates of OSA-associated stroke-risk comorbidities.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42811346","sources":[{"id":"source.frontier.pmid-42811346","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811346%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42811346 names Rheumatology: \"A retrospective cohort study included consecutive patients diagnosed with SpA and PsA in 2012-2016 at a single rheumatology center.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42811130","sources":[{"id":"source.frontier.pmid-42811130","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811130%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42811130 names Genomics: \"This study advances the understanding of regulatory evolution following WGD and offers an open resource supporting vertebrate comparative genomics and research applications in salmonid aquaculture and conservation.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42760912","sources":[{"id":"source.frontier.pmid-42760912","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760912%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760912 names Pharmaceutical Research: \"Bee products are rich sources of bioactive flavonoids with potential applications in nutraceutical and pharmaceutical research.\"","target":"concept.mesh.d000071220","type":"related"},{"source":"claim.frontier.pmid-42799489","sources":[{"id":"source.frontier.pmid-42799489","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799489%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799489 names Latent Infection: \"This case illustrates that CTB can manifest as phenotypically diverse and disseminated disease in preterm IVF twins following reactivation of maternal latent infection.\"","target":"concept.mesh.d000085343","type":"related"},{"source":"claim.frontier.pmid-42791331","sources":[{"id":"source.frontier.pmid-42791331","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791331%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42791331 names Risk Factors: \"Children with bilateral HL have a higher proportion of pre-/perinatal risk factors (e.g., hypoxia, artificial ventilation) than children with unilateral HL.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42789524","sources":[{"id":"source.frontier.pmid-42789524","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789524%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42789524 names Emotional Exhaustion: \"Participants described chronic financial hardship, emotional exhaustion, social stigma toward disability, and limited formal and informal support systems as important influences on maternal QoL.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.pmid-42789505","sources":[{"id":"source.frontier.pmid-42789505","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789505%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42789505 names signal transduction: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42784649","sources":[{"id":"source.frontier.pmid-42784649","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784649%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784649 names Consumer Behavior: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42784570","sources":[{"id":"source.frontier.pmid-42784570","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784570%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784570 names Cross-sectional study: \"A cross-sectional study was conducted with 414 randomly selected students using a self-administered questionnaire.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42778666","sources":[{"id":"source.frontier.pmid-42778666","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778666%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778666 names horizontal gene transfer: \"Despite this complex evolutionary history, phylogenetic analyses place core PCWDE functionalities at the base of the Phytophaga (weevils, leaf beetles, and longhorn beetles) and reveal subsequent horizontal gene transfer (HGT) events from various donors during early Phytophaga diversification.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42778332","sources":[{"id":"source.frontier.pmid-42778332","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778332%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778332 names Rheumatology: \"For each patient, yearly Systemic Lupus International Collaborating Clinics/American College of Rheumatology Damage Index (SDI) worsening occasions and average proportion of follow-up spent in LLDAS-5 and LLDAS-7.5 were derived.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42777016","sources":[{"id":"source.frontier.pmid-42777016","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42777016%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42777016 names Cognitive bias: \"Our framework bridges neuroscience, psychology, and collective behavior, enabling empirically testable hypotheses about how cognitive biases propagate from individual cognition to social outcomes in complex environments.\"","target":"concept.wikipedia.cognitive-bias","type":"related"},{"source":"claim.frontier.pmid-42773366","sources":[{"id":"source.frontier.pmid-42773366","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42773366%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42773366 names Quality of Life: \"ADHD symptoms are frequently reported in parents of children with ADHD, however, their prevalence and association with children's mental health and quality of life (QoL) remain poorly understood.\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42794852","sources":[{"id":"source.frontier.pmid-42794852","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794852%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794852 names cellular senescence: \"Rather than resulting from a single pathological event, brain aging involves coordinated changes across multiple biological processes, including neuroinflammation, proteostasis impairment, mitochondrial dysfunction, neurotransmission deficit, cellular senescence, gut microbiota dysbiosis, extracellular vesicle dysregulation, nutrient-sensing disturbances, and metabolic drift.\"","target":"concept.go.go0090398","type":"related"},{"source":"claim.frontier.pmid-42792502","sources":[{"id":"source.frontier.pmid-42792502","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792502%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792502 names Psychological Well-Being: \"Participants were 408 students at a Turkish state university (71.1% women; mean age 21.76 years, SD = 4.20) who completed the Life Goals Scale, distinguishing career, relationship, and body-related goals, together with measures of psychological well-being, psychological distress, cognitive flexibility, physical activity, and nutritional risk.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42766660","sources":[{"id":"source.frontier.pmid-42766660","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766660%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766660 names Ground truth: \"A high-fidelity biventricular electromechanical model of a murine heart was developed using a high-resolution myocardial fiber field obtained via mesoscopic optical imaging, which serves as a reference ground truth.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42766622","sources":[{"id":"source.frontier.pmid-42766622","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766622%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766622 names Consumer Behavior: \"However, many studies overlook contextual factors that directly influence secondhand purchase and mediate the impact of psychological factors on consumer behavior.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42766584","sources":[{"id":"source.frontier.pmid-42766584","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766584%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766584 names Cognitive bias: \"Metacognitive Training for psychosis is an evidence-based psychological intervention targeting cognitive biases associated with psychotic symptoms, but evidence regarding sex-specific treatment effects remain limited.\"","target":"concept.wikipedia.cognitive-bias","type":"related"},{"source":"claim.frontier.pmid-42766546","sources":[{"id":"source.frontier.pmid-42766546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42766546 names Evidence-based practice: \"Multi-professional medication reviews (MPMRs) are structured, collaborative processes designed to optimize medication management and promote evidence-based practice.\"","target":"concept.wikipedia.evidence-based-practice","type":"related"},{"source":"claim.frontier.pmid-42764320","sources":[{"id":"source.frontier.pmid-42764320","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764320%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764320 names Neurosurgery: \"Medical record data of patients with confirmed diagnosis of central neurocytoma who underwent surgical resection at Department of Neurosurgery of \"Ospedale del Mare\" in Naples - Italy, between January and December 2022, were retrospectively reviewed.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42796055","sources":[{"id":"source.frontier.pmid-42796055","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796055%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796055 names Cardiology: \"PubMed/MEDLINE was searched through 12 August 2026 using domain-based search blocks, supplemented by EULAR, GRAPPA, and European Society of Cardiology guidance and citation tracking.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42762163","sources":[{"id":"source.frontier.pmid-42762163","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42762163%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42762163 names horizontal gene transfer: \"Edges represent co-occurrence-based ecological proximity rather than direct physical contacts or confirmed horizontal gene transfer events.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42827649","sources":[{"id":"source.frontier.pmid-42827649","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827649%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827649 names Differential effects: \"This study aimed to examine the differential effects of static and dynamic prompts in stroke patients and healthy controls.\"","target":"concept.wikipedia.differential-effects","type":"related"},{"source":"claim.frontier.pmid-42827524","sources":[{"id":"source.frontier.pmid-42827524","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827524%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42827524 names Resource Allocation: \"This study examined whether individuals use these principles strategically to manage impressions, signaling warmth or competence in resource allocation.\"","target":"concept.mesh.d040841","type":"related"},{"source":"claim.frontier.pmid-42797642","sources":[{"id":"source.frontier.pmid-42797642","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42797642%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42797642 names Vaccine-Preventable Diseases: \"In this scenario, evaluating the immune status against core vaccine-preventable diseases becomes of primary importance to ensure adequate protection in such clinically fragile patients.\"","target":"concept.mesh.d000079263","type":"related"},{"source":"claim.frontier.pmid-42788599","sources":[{"id":"source.frontier.pmid-42788599","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42788599%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42788599 names Central Nervous System Infections: \"Nocardia asiatica is a rare opportunistic pathogen typically associated with pulmonary and central nervous system infections; however, musculoskeletal infections are uncommon.\"","target":"concept.mesh.d002494","type":"related"},{"source":"claim.frontier.pmid-42763478","sources":[{"id":"source.frontier.pmid-42763478","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763478%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763478 names Psychological Well-Being: \"Such memories suggest how psychological well-being during health crises and beyond may be jointly co-constructed by technology and society.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42761607","sources":[{"id":"source.frontier.pmid-42761607","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761607%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761607 names Latent Infection: \"In resource-limited settings, the absence of routine TB screening and restricted timely access to renal biopsy often lead to empirical immunosuppression, which may worsen outcomes by reactivating latent infections.\"","target":"concept.mesh.d000085343","type":"related"},{"source":"claim.frontier.pmid-42760564","sources":[{"id":"source.frontier.pmid-42760564","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760564%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760564 names Neurology: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42758776","sources":[{"id":"source.frontier.pmid-42758776","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758776%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42758776 names Analytic hierarchy: \"A mixed-methods framework is employed, combining literature and secondary data with expert interviews, the Analytic Hierarchy Process (AHP), a multinomial Logit model of freight mode choice, and a SWOT analysis.\"","target":"concept.planetmath.analytichierarchy","type":"related"},{"source":"claim.frontier.pmid-42758734","sources":[{"id":"source.frontier.pmid-42758734","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758734%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42758734 names Age Distribution: \"We analyzed five key characteristics: i) inter-category distribution of citation intents, ii) average number of citation intents per article, iii) age distribution of citation intents, iv) similarity of the age distributions of citation intent, and v) predictability of the number of citation intents.\"","target":"concept.mesh.d017677","type":"related"},{"source":"claim.frontier.pmid-42824361","sources":[{"id":"source.frontier.pmid-42824361","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824361%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824361 names Risk Factors: \"Log-transformed HRV measures were analyzed using multivariable linear regression adjusted for demographic characteristics, vascular and metabolic risk factors, smoking status, and renal function.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42824182","sources":[{"id":"source.frontier.pmid-42824182","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824182%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824182 names Research program: \"The synthesis is based on harmonized outcome measures derived from three prospective 4-week intervention studies conducted within a single research program.\"","target":"concept.wikipedia.research-program","type":"related"},{"source":"claim.frontier.pmid-42824079","sources":[{"id":"source.frontier.pmid-42824079","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824079%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824079 names Psychology, Social: \"This study evaluates the importance of raising public legal awareness in regulating deviant behavior from the perspective of social psychology, using legal socialization theory and planned behavior theory as conceptual frameworks.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.pmid-42823984","sources":[{"id":"source.frontier.pmid-42823984","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823984%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42823984 names Work-Life Balance: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","target":"concept.mesh.d000072358","type":"related"},{"source":"claim.frontier.pmid-42813109","sources":[{"id":"source.frontier.pmid-42813109","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42813109%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42813109 names Social Sciences: \"The longstanding dominance of values rooted in Western, Educated, Industrialized, Rich, and Democratic (WEIRD) societies has increasingly come under scrutiny across the social sciences.\"","target":"field.mesh.d012942","type":"related"},{"source":"claim.frontier.pmid-42796013","sources":[{"id":"source.frontier.pmid-42796013","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796013%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796013 names Rheumatology: \": This retrospective, multicenter, observational cohort study reviewed the medical records of 80 adults with moderate-to-severe SLE who had received at least 6 doses (≥20 weeks) of intravenous anifrolumab 300 mg every 4 weeks as part of routine clinical care at 13 Egyptian tertiary rheumatology centers; medical record review and data extraction were performed between May and July 2026.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42757005","sources":[{"id":"source.frontier.pmid-42757005","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757005%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42757005 names Pathology, Surgical: \"After nondiagnostic radiographic evaluation, esophagogastroduodenoscopy, colonoscopy, and push enteroscopy, anterograde double-balloon enteroscopy revealed an actively bleeding ulcerated midjejunal mass, later measuring 6 cm on surgical pathology, with pathology confirming the diagnosis of metastatic melanoma.\"","target":"field.mesh.d010340","type":"related"},{"source":"claim.frontier.pmid-42752632","sources":[{"id":"source.frontier.pmid-42752632","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42752632%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42752632 names Quality of Life: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42795965","sources":[{"id":"source.frontier.pmid-42795965","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795965%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795965 names Ophthalmology: \"We retrospectively analyzed 17 patients with cytologically confirmed PVRL evaluated at two ophthalmology centers in Bucharest, Romania (2018-2023).\"","target":"ology.ophthalmology","type":"related"},{"source":"claim.frontier.pmid-42795646","sources":[{"id":"source.frontier.pmid-42795646","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795646%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795646 names horizontal gene transfer: \"Correlation analyses revealed associations among TRGs, microbial taxa, and treatment conditions but did not establish direct host-gene relationships or horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42794677","sources":[{"id":"source.frontier.pmid-42794677","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794677%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794677 names Risk Factors: \"Overweight and obesity, frequently accompanied by hyperinsulinemia, are established risk factors for female infertility.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42750388","sources":[{"id":"source.frontier.pmid-42750388","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42750388%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42750388 names Pathology, Molecular: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42749366","sources":[{"id":"source.frontier.pmid-42749366","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749366%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42749366 names Sample Size: \"Results will inform design and sample size of a confirmatory randomised controlled trial to assess effectiveness of the intervention.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42748195","sources":[{"id":"source.frontier.pmid-42748195","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748195%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748195 names Sample Size: \"Overall methodological quality was generally characterized by moderate methodological concerns, most commonly related to limited control of confounding variables, incomplete reporting of measurement validity, and small sample sizes.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42748135","sources":[{"id":"source.frontier.pmid-42748135","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748135%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748135 names Proteomics: \"This study provides a comprehensive framework for integrating transcriptomics and proteomics data and identifies potential gene products that might significantly impact the ability of diverse bacterial pathogens to adapt to hostile infection environments.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42748115","sources":[{"id":"source.frontier.pmid-42748115","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748115%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748115 names Family Structure: \"There is considerable evidence showing that children growing up in two-parent intact families are more academically successful than children from other family structures.\"","target":"concept.mesh.d000092822","type":"related"},{"source":"claim.frontier.pmid-42748081","sources":[{"id":"source.frontier.pmid-42748081","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748081%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748081 names Qualitative Research: \"Reporting adhered to the Consolidated Criteria for Reporting Qualitative Research (COREQ).\"","target":"concept.mesh.d036301","type":"related"},{"source":"claim.frontier.pmid-42748079","sources":[{"id":"source.frontier.pmid-42748079","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748079%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42748079 names Sample Size: \"No significant differences emerged between the two third-person views, possibly due to sample size or dancer background.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42812171","sources":[{"id":"source.frontier.pmid-42812171","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42812171%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42812171 names Serology: \"This case highlights the ultrasonographic \"cerebral gyrus sign\" as a potential imaging clue for breast CE and emphasizes that hydatid disease should be considered in patients from endemic regions presenting with complex breast masses, even with negative serology.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42795945","sources":[{"id":"source.frontier.pmid-42795945","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795945%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795945 names Respiratory Tract Infections: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42768386","sources":[{"id":"source.frontier.pmid-42768386","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768386%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768386 names horizontal gene transfer: \"Shared ARGs between commensal and pathogenic bacteria provided clues to horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42760901","sources":[{"id":"source.frontier.pmid-42760901","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760901%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760901 names Cross-sectional study: \"A cross-sectional study was conducted among 150 MSM and TGW (75 PrEP users and 75 non-users) recruited from two HIV prevention clinics in Chiang Mai, Thailand Depressive symptoms were assessed using the Patient Health Questionnaire-9 (PHQ-9), and suicidal ideation/risk was assessed using the Columbia-Suicide Severity Rating Scale (C-SSRS).\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42746596","sources":[{"id":"source.frontier.pmid-42746596","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746596%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746596 names Genomics: \"Overall, this review provides an integrated conceptual and evidence-based perspective summarizing proposed relationships between genome architecture and phytochemical diversity and outlines future priorities for functional genomics, precision breeding, metabolic engineering, and sustainable utilization of MAPs.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42743377","sources":[{"id":"source.frontier.pmid-42743377","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743377%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743377 names Further research is needed: \"Further research is needed to examine which study characteristics researchers consider most important when assessing a manuscript's quality in peer review.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42743310","sources":[{"id":"source.frontier.pmid-42743310","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743310%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743310 names Grounded Theory: \"This research employs Grounded Theory, a data-driven approach that generates explanations or theories from the data.\"","target":"concept.mesh.d066296","type":"related"},{"source":"claim.frontier.pmid-42743306","sources":[{"id":"source.frontier.pmid-42743306","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743306%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743306 names immune response: \"This convergence in viral immune evasion strategies provides valuable insights into the development of broad-spectrum antiviral therapies and offers new opportunities for enhancing immune responses in therapeutic contexts.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42743204","sources":[{"id":"source.frontier.pmid-42743204","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743204%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743204 names Cross-sectional study: \"This retrospective cross-sectional study quantified labial and lingual alveolar bone thickness and examined whether signed IA-PAMD indicated apical root position within the symphysis.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42743162","sources":[{"id":"source.frontier.pmid-42743162","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743162%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743162 names Ground truth: \"The microscopic images of these stains serve as a ground truth for different machine learning models, which can subsequently learn to detect necrosis from the brightfield image, i.e., without the need for staining.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42743158","sources":[{"id":"source.frontier.pmid-42743158","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743158%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42743158 names Quality of Life: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","target":"concept.mesh.d011788","type":"related"},{"source":"claim.frontier.pmid-42403695","sources":[{"id":"source.frontier.pmid-42403695","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42403695%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42403695 names Empirical evidence: \"It seeks to provide empirical evidence on how cognitive, social, and spiritual factors interact in shaping Muslim consumers' purchasing behavior.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42807220","sources":[{"id":"source.frontier.pmid-42807220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42807220 names Opportunistic Infections: \"Patients with systemic lupus erythematosus (SLE) receiving long-term glucocorticoids and immunosuppressants are at markedly increased risk of opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42807094","sources":[{"id":"source.frontier.pmid-42807094","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807094%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42807094 names Rheumatology: \"A cross-sectional study of 704 adult patients receiving care at the specialized Rheumatology Outpatient Clinic of the Hannover Medical School was conducted.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42795904","sources":[{"id":"source.frontier.pmid-42795904","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795904%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795904 names immune response: \"Collectively, our findings provide a system-level framework describing the associations between dysbiosis-relevant host pathways, CRC-related regulatory networks, and immune responses.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42768354","sources":[{"id":"source.frontier.pmid-42768354","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768354%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768354 names Psychopathology: \"Suicidality among rural women in Bihar cannot be understood solely as an outcome of individual psychopathology.\"","target":"ology.psychopathology","type":"related"},{"source":"claim.frontier.pmid-42746605","sources":[{"id":"source.frontier.pmid-42746605","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746605%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746605 names Respiratory Tract Infections: \"This study compared antibiotic review practices and prescribing patterns among hospitalised patients with respiratory tract infections before and during the pandemic.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42736559","sources":[{"id":"source.frontier.pmid-42736559","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42736559%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42736559 names Obstetrics: \"This qualitative interview study included 20 individuals with a medically documented diagnosis of adenomyosis recruited across three German-speaking countries as well as five specialists in obstetrics and gynecology practicing in Germany.\"","target":"field.mesh.d009774","type":"related"},{"source":"claim.frontier.pmid-42796834","sources":[{"id":"source.frontier.pmid-42796834","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796834%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796834 names seed germination: \"This narrative review synthesizes current insights into nanomaterial uptake pathways, translocation dynamics, and intracellular trafficking from seed germination to reproductive maturity.\"","target":"concept.go.go0009845","type":"related"},{"source":"claim.frontier.pmid-42794013","sources":[{"id":"source.frontier.pmid-42794013","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794013%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794013 names Consumer Behavior: \"This systematic literature review synthesizes research at the intersection of consumer behavior, technological innovation, and food waste.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42731744","sources":[{"id":"source.frontier.pmid-42731744","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42731744%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42731744 names Social Behavior: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","target":"concept.mesh.d012919","type":"related"},{"source":"claim.frontier.pmid-42799291","sources":[{"id":"source.frontier.pmid-42799291","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799291%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799291 names Public Health: \"This phenomenon is attributed to the rarity of pathogens, the lack of recommended antifungal agents, or unrecognized intrinsic drug resistance, which poses a serious threat to clinical management and public health.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42798677","sources":[{"id":"source.frontier.pmid-42798677","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798677%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798677 names Psychological Well-Being: \"Against the backdrop of growing public concern regarding mental health, examining the relationship between arts participation and individual psychological well-being is important for understanding the potential health-related value of sociocultural activities.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42798644","sources":[{"id":"source.frontier.pmid-42798644","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798644%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798644 names Respiratory Tract Infections: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42798637","sources":[{"id":"source.frontier.pmid-42798637","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798637%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798637 names Sample Size: \"However, given the limited sample size and short follow-up of this study, large prospective studies are warranted to confirm these observations.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42798632","sources":[{"id":"source.frontier.pmid-42798632","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798632%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798632 names Sample Size: \"Evidence from this initial population indicated that YWKS therapy was correlated with the treatment-associated modulation of 119 of the 352 identified metabolic markers, while 54 remained in a state of imbalance, suggesting that therapeutic coverage was only partially achieved in this restricted sample size.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42784269","sources":[{"id":"source.frontier.pmid-42784269","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784269%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42784269 names Radiology, Interventional: \"Interventional radiology (IR) has reshaped contemporary management strategies for selected gynecological and obstetric disorders by introducing minimally invasive, organ-sparing therapeutic alternatives to conventional surgical approaches.\"","target":"field.mesh.d015642","type":"related"},{"source":"claim.frontier.pmid-42730235","sources":[{"id":"source.frontier.pmid-42730235","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42730235%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42730235 names Genomics: \"Responses to emerging pest challenges can benefit from insights generated by population genomics techniques, opening up new avenues for research and supporting efforts to quickly tailor management strategies for novel pests.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42729983","sources":[{"id":"source.frontier.pmid-42729983","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729983%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729983 names immune response: \"Temperature-associated markers mapped to loci associated with immune response, lipid metabolism and transmembrane protein genes.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42726890","sources":[{"id":"source.frontier.pmid-42726890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42726890 names Genomics: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42726368","sources":[{"id":"source.frontier.pmid-42726368","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726368%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42726368 names Taxonomy: \"This review critically summarizes evidence linking the Mediterranean diet, gut microbiome, microbial metabolites, and cardiovascular disease risk, with emphasis on the shift from microbial taxonomy to functional pathways, multiomic integration, and translation to precision nutrition.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42793476","sources":[{"id":"source.frontier.pmid-42793476","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42793476%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42793476 names Psycho-Oncology: \"These findings support prospective, multicenter evaluation of integrated psycho-oncology and nutrition-rehabilitation care pathways after upper GI cancer surgery and should not be interpreted as demonstrating a causal treatment effect.\"","target":"field.mesh.d000073320","type":"related"},{"source":"claim.frontier.pmid-42725296","sources":[{"id":"source.frontier.pmid-42725296","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725296%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42725296 names Genomics: \"Additionally, a population genomics analysis was conducted using 7706 high-quality SNPs to assess the genomic structure of captive populations.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42721209","sources":[{"id":"source.frontier.pmid-42721209","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721209%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721209 names Coping Skills: \"Participants completed the Mindful Attention Awareness Scale (MAAS), the Athletic Coping Skills Inventory-28 (ACSI-28), and the Sport Mental Toughness Questionnaire (SMTQ).\"","target":"concept.mesh.d000097813","type":"related"},{"source":"claim.frontier.pmid-42721180","sources":[{"id":"source.frontier.pmid-42721180","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721180%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721180 names Genomics: \"Additionally, we highlight key aspects of the bacterium's genomics, phylogenetics, and physiological interactions with its tsetse host, including influences on host gene expression reproductive physiology, and vector competence.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42721148","sources":[{"id":"source.frontier.pmid-42721148","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721148%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721148 names Psychological Well-Being: \"These findings suggest that the overall configuration of caregivers may be relevant to depression among people with cognitive impairment and highlight the importance of considering care network composition when assessing their psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42721140","sources":[{"id":"source.frontier.pmid-42721140","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721140%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721140 names Psychology, Social: \"The current study aimed to explore the role of religiosity and the social psychology concept of collective narcissism in political behaviour.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.pmid-42721128","sources":[{"id":"source.frontier.pmid-42721128","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721128%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42721128 names Private Sector: \"We conducted five qualitative workshops, with 58 participants from academia, government, public and third sectors, and the private sector.\"","target":"concept.mesh.d017149","type":"related"},{"source":"claim.frontier.pmid-42792412","sources":[{"id":"source.frontier.pmid-42792412","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792412%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792412 names Adaptation, Psychological: \"The IS demonstrated satisfactory psychometric properties for assessing individual differences in insensitivity and may facilitate further research on its role in psychological adaptation and mental health among university students.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.pmid-42780961","sources":[{"id":"source.frontier.pmid-42780961","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780961%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42780961 names Mental Disorders: \"Therapist-guided internet-delivered cognitive behavioural therapy (guided iCBT) is an effective treatment for common mental disorders and has the potential to improve access to care.\"","target":"concept.mesh.d001523","type":"related"},{"source":"claim.frontier.pmid-42780909","sources":[{"id":"source.frontier.pmid-42780909","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780909%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42780909 names Public Health: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42795560","sources":[{"id":"source.frontier.pmid-42795560","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795560%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42795560 names Global Health: \"Tuberculosis (TB) remains a major global health burden, and diabetes mellitus increases the risk of active TB.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42775227","sources":[{"id":"source.frontier.pmid-42775227","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42775227%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42775227 names Psychological Well-Being: \"This integrative narrative review synthesizes current evidence on smartphone use among adolescents, focusing on three primary domains: psychological well-being, cognitive functioning and learning, and emerging policy responses such as school cellphone bans.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42732108","sources":[{"id":"source.frontier.pmid-42732108","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732108%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42732108 names Critical thinking: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","target":"concept.wikipedia.critical-thinking","type":"related"},{"source":"claim.frontier.pmid-42709861","sources":[{"id":"source.frontier.pmid-42709861","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709861%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709861 names immune response: \"We set out to investigate the potential effects of bile acid sequestration on mucosal immune responses and to evaluate how enteric microbial pathogens colonize the small intestine of mice in vivo.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42709851","sources":[{"id":"source.frontier.pmid-42709851","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709851%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709851 names Biomedical Research: \"Furthermore, the feature-selection and integration workflow provides a framework for analysing complex multimodal datasets in future biomedical research.\"","target":"concept.mesh.d035843","type":"related"},{"source":"claim.frontier.pmid-42792025","sources":[{"id":"source.frontier.pmid-42792025","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792025%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792025 names Genomics: \"These studies were complemented with comparative genomics using the complete genome sequences of selected strains.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42769220","sources":[{"id":"source.frontier.pmid-42769220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42769220 names Cross-sectional study: \"This retrospective cross-sectional study included 173 participants who underwent inspiratory thin-section chest CT and post-bronchodilator pulmonary function testing between January 2023 and March 2025.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42769130","sources":[{"id":"source.frontier.pmid-42769130","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769130%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42769130 names Sexual Behavior: \"University prevention and counseling initiatives may benefit from integrating loneliness reduction, emotion-regulation skills, social connectedness, and the non-stigmatizing assessment of problematic sexual behaviors.\"","target":"concept.mesh.d012725","type":"related"},{"source":"claim.frontier.pmid-42739931","sources":[{"id":"source.frontier.pmid-42739931","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739931%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739931 names Endocrinology: \": A retrospective observational study enrolling patients with sporadic NETs was conducted at Federico II University of Naples, Endocrinology Unit, ENETS Center of Excellence.\"","target":"ology.endocrinology","type":"related"},{"source":"claim.frontier.pmid-42739910","sources":[{"id":"source.frontier.pmid-42739910","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739910%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739910 names Cardiovascular Diseases: \"Despite advances in diagnostics, prevention, and therapy, heart failure (HF) remains the leading cause of death among cardiovascular diseases.\"","target":"concept.mesh.d002318","type":"related"},{"source":"claim.frontier.pmid-42738411","sources":[{"id":"source.frontier.pmid-42738411","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42738411%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42738411 names Radiology: \"This retrospective single-center cohort study included 200 consecutive women with histologically confirmed LACC treated with definitive chemoradiation at the Institute of Oncology and Radiology of Serbia.\"","target":"ology.radiology","type":"related"},{"source":"claim.frontier.pmid-42737031","sources":[{"id":"source.frontier.pmid-42737031","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737031%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737031 names Recidivism: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","target":"concept.mesh.d000075665","type":"related"},{"source":"claim.frontier.pmid-42783218","sources":[{"id":"source.frontier.pmid-42783218","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42783218%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42783218 names Gastroenterology: \": This cross-sectional observational study included 80 patients with Crohn's disease or ulcerative colitis receiving maintenance infliximab or adalimumab therapy at a tertiary Gastroenterology Center in Iraq.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42831226","sources":[{"id":"source.frontier.pmid-42831226","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831226%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42831226 names Persistent Infection: \"This case underscores the complexity of distinguishing checkpoint inhibitor-associated HLH from persistent infection.\"","target":"concept.mesh.d000088562","type":"related"},{"source":"claim.frontier.pmid-42831114","sources":[{"id":"source.frontier.pmid-42831114","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831114%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42831114 names Internal Medicine: \"A 64-year-old man with a history of alcohol use disorder was admitted to Internal Medicine with a diagnosis of ischemic stroke in the left middle cerebral artery territory, with new-onset seizures at admission and a self-limited episode of hyperactive delirium.\"","target":"field.mesh.d007388","type":"related"},{"source":"claim.frontier.pmid-42761220","sources":[{"id":"source.frontier.pmid-42761220","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761220%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761220 names Adaptation, Psychological: \"As an important negative emotional response in intelligent technology contexts, AI anxiety may be closely associated with university students' academic motivation and psychological adaptation.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.pmid-42761051","sources":[{"id":"source.frontier.pmid-42761051","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761051%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761051 names Global Health: \"Heatstroke is an emerging global health concern, particularly among the elderly.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42761040","sources":[{"id":"source.frontier.pmid-42761040","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761040%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761040 names Taxonomy: \"Ecological analyses were performed to assess the effects of host taxonomy and environment on virome composition.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42739854","sources":[{"id":"source.frontier.pmid-42739854","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739854%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739854 names Global Health: \"Inflammatory bowel diseases (IBDs) are an increasingly important global health problem, yet Central Asia remains underrepresented in international IBD data.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42698113","sources":[{"id":"source.frontier.pmid-42698113","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698113%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42698113 names Neurology: \"Our findings highlight the need for individualized, multidisciplinary management and clear, structured transition pathways from paediatric to adult neurology services.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42830983","sources":[{"id":"source.frontier.pmid-42830983","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42830983%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42830983 names Serology: \"However, positive viral serology or viremia may lead to diagnostic anchoring and delay the identification of underlying malignant disorders.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42757226","sources":[{"id":"source.frontier.pmid-42757226","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757226%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42757226 names Further research is needed: \"While the results underscore the potential value of integrating lifestyle medicine into clinical care, particularly by targeting sleep and substance use, further research is needed to elucidate the causal mechanisms underlying the interplay between BPD and multimorbidity.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42756514","sources":[{"id":"source.frontier.pmid-42756514","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42756514%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42756514 names Global Health: \"We conducted a retrospective cohort study using TriNetX, a global health research network comprising clinical data from real-world settings.\"","target":"field.mesh.d014943","type":"related"},{"source":"claim.frontier.pmid-42755864","sources":[{"id":"source.frontier.pmid-42755864","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755864%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755864 names immune response: \"Immune responses were heterogeneous and depended on the experimental context.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42755797","sources":[{"id":"source.frontier.pmid-42755797","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755797%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755797 names Cross-sectional study: \"A cross-sectional study was conducted in 925 asymptomatic adults aged ≥18 years undergoing routine cardiovascular health evaluations.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42755627","sources":[{"id":"source.frontier.pmid-42755627","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755627%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755627 names Pathology, Molecular: \"Under the American College of Medical Genetics and Genomics (ACMG) and the Association for Molecular Pathology (AMP) framework, it was classified as pathogenic on the basis of PVS1 and PS2.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42755626","sources":[{"id":"source.frontier.pmid-42755626","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755626%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42755626 names Control Groups: \"Clinical indications for cranial MRI and PFO-related examinations in both groups included headache/migraine, dizziness, cryptogenic stroke/TIA, and other neurological symptoms, with distributions balanced between the PFO and control groups through the matching process.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42796692","sources":[{"id":"source.frontier.pmid-42796692","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796692%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796692 names Cardiology: \"The 2023 European Society of Cardiology Guidelines now formally endorse POAT for selected patients fulfilling strict criteria.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42688919","sources":[{"id":"source.frontier.pmid-42688919","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688919%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42688919 names Serology: \"was positive in blood despite negative IgG serology and isolated IgM positivity, raising concern for potentially misleading serological findings.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42688865","sources":[{"id":"source.frontier.pmid-42688865","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688865%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42688865 names Serology: \"In addition, pre-ASCT celiac serology and HLA-DQ2/DQ8 typing were unavailable.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42687189","sources":[{"id":"source.frontier.pmid-42687189","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687189%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42687189 names Neurology: \"This retrospective cohort study included pwALS meeting the Gold Coast criteria who were treated at the Department of Neurology of the Medical University of Vienna between January 2009 and July 2023.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42685061","sources":[{"id":"source.frontier.pmid-42685061","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42685061%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42685061 names Lung Diseases: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","target":"concept.mesh.d008171","type":"related"},{"source":"claim.frontier.pmid-42825005","sources":[{"id":"source.frontier.pmid-42825005","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42825005%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42825005 names Serology: \"serology prompted readmission, and TAVI was ultimately deferred after the diagnosis was confirmed.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42823403","sources":[{"id":"source.frontier.pmid-42823403","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823403%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42823403 names Risk Factors: \"This study examines the incidence, risk factors, and trends of esophageal cancer by histological and anatomical subtypes, with stratification by sex and age across different countries, using GLOBOCAN 2022 estimates, Cancer Incidence in Five Continents data, and country-level socioeconomic, lifestyle, and metabolic risk-factor indicators.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42818964","sources":[{"id":"source.frontier.pmid-42818964","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42818964%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42818964 names Nephrology: \"Cross sectional retrospective study conducted at nephrology department of National Institute of Child Health from January 2016 to December 2020.\"","target":"ology.nephrology","type":"related"},{"source":"claim.frontier.pmid-42803191","sources":[{"id":"source.frontier.pmid-42803191","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42803191%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42803191 names Genomics: \"Therefore, most eukaryotic genome assemblies in public databases lack gene annotations reducing their value for evolutionary and functional genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42802368","sources":[{"id":"source.frontier.pmid-42802368","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42802368%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42802368 names Family Structure: \"Multivariable logistic regression models with robust standard errors were estimated, adjusting for socio-economic position, family structure, parental mental health, parenting behaviour difficulties, child health, childcare hours, labour status, survey year and non-linear child age effects.\"","target":"concept.mesh.d000092822","type":"related"},{"source":"claim.frontier.pmid-42798137","sources":[{"id":"source.frontier.pmid-42798137","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798137%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798137 names Genomics: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42798110","sources":[{"id":"source.frontier.pmid-42798110","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798110%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42798110 names Colorectal Surgery: \"The rate of easy intraoperative identification during laparoscopic colorectal surgery was 88.7% (103/116).\"","target":"field.mesh.d003107","type":"related"},{"source":"claim.frontier.pmid-42782937","sources":[{"id":"source.frontier.pmid-42782937","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42782937%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42782937 names Sample Size: \"However, the extremely small sample size precludes establishing clinical superiority over standard collagen membranes or spontaneous healing.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42776569","sources":[{"id":"source.frontier.pmid-42776569","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42776569%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42776569 names cell death: \"We quantified infected-cell frequency, intracellular bacterial burden dynamics, cell death and host transcriptome by RNA-seq.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42768698","sources":[{"id":"source.frontier.pmid-42768698","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768698%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42768698 names Genomics: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42760703","sources":[{"id":"source.frontier.pmid-42760703","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760703%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42760703 names Marital Status: \"As a result, the multivariate test of significance demonstrates that parents' marital status, monthly income, and the presence or absence of intimate friends all have a significant influence on student substance abuse and depression.\"","target":"concept.mesh.d017533","type":"related"},{"source":"claim.frontier.pmid-42746056","sources":[{"id":"source.frontier.pmid-42746056","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746056%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746056 names Serology: \"The diagnosis was based mainly on the clinical course and electrophysiological findings, supported by serology and CSF analysis.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42745765","sources":[{"id":"source.frontier.pmid-42745765","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42745765%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42745765 names Cross-sectional study: \"This cross-sectional study evaluated fecal samples from 51 reproductive-age, non-menopausal women living in Puerto Rico, including 41 with PMOS, diagnosed following the Rotterdam criteria, and 10 healthy controls.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42742452","sources":[{"id":"source.frontier.pmid-42742452","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42742452%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42742452 names Histology: \"I seeds intraperitoneally in mice and assessed colonic damage via histology, TUNEL staining, cytokine assays, and tight‑junction protein measurements.\"","target":"ology.histology","type":"related"},{"source":"claim.frontier.pmid-42737913","sources":[{"id":"source.frontier.pmid-42737913","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737913%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737913 names Genomics: \"In this study, we used comparative genomics methods to systematically analyze the evolutionary characteristics of glucose metabolism-related genes in the Chinese longsnout catfish, focusing on gene family evolution, patterns of expansion and contraction, and selective pressures.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42709467","sources":[{"id":"source.frontier.pmid-42709467","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709467%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42709467 names Rheumatology: \"Evidence from dedicated rheumatology cohorts on the clinical spectrum, severity, treatment, and outcomes of rheumatic irAEs (rh-irAEs) remains limited.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42708953","sources":[{"id":"source.frontier.pmid-42708953","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42708953%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42708953 names cellular homeostasis: \"Cellular homeostasis was preserved through H+ replenishment via multiple energy-converting complexes and K+ influx to maintain cation-proton balance.\"","target":"concept.go.go0019725","type":"related"},{"source":"claim.frontier.pmid-42706664","sources":[{"id":"source.frontier.pmid-42706664","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42706664%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42706664 names Psychological Well-Being: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42687444","sources":[{"id":"source.frontier.pmid-42687444","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687444%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42687444 names Psychological Well-Being: \"This exploratory, cross-sectional study examined associations among psychological well-being, engagement in leisure activities associated with cognitive reserve, and cognitive performance in older community dwellers (older adults living independently) in Spain.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42670810","sources":[{"id":"source.frontier.pmid-42670810","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42670810%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42670810 names Control Groups: \"However, these results should be interpreted cautiously because systemic insulin resistance markers were not significantly improved, and additional control groups are required to clarify ANA-12-specific and vehicle-related effects.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42663084","sources":[{"id":"source.frontier.pmid-42663084","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42663084%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42663084 names organ growth: \"Here, we investigate the geographic variation in reproductive organ growth in the self-fertilising species Arabidopsis thaliana, where the loss of pollinator dependence is predicted to favour reduced floral investment through resource reallocation.\"","target":"concept.go.go0035265","type":"related"},{"source":"claim.frontier.pmid-42657789","sources":[{"id":"source.frontier.pmid-42657789","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657789%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42657789 names protein quality control: \"Furthermore, this nuclear compensatory response extends to systems governing mitochondrial homeostasis, including protein quality control and RNA degradation and stabilization.\"","target":"concept.go.go0006515","type":"related"},{"source":"claim.frontier.pmid-42657744","sources":[{"id":"source.frontier.pmid-42657744","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657744%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42657744 names horizontal gene transfer: \"Horizontal gene transfer (HGT) can accelerate plant adaptation, but the evolutionary fate of newly acquired nuclear genes is often unclear.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42530440","sources":[{"id":"source.frontier.pmid-42530440","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42530440%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42530440 names Genomics: \"Collectively, these 'omics datasets will facilitate: (i) comparative genomics studies of endosymbiont evolution, (ii) evolve-and-resequence experiments, (iii) genome-scale metabolic modeling studies, and (iv) identification of targets for genetic modification experiments and biotechnological applications.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42522920","sources":[{"id":"source.frontier.pmid-42522920","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42522920%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42522920 names metabolic process: \"Comparative genomic analyses further identified 680 species-specific orthogroups enriched in hormone signaling, metabolic processes, and stress-responsive pathways, among which several LIK1-like genes may contribute to environmental adaptation.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42379141","sources":[{"id":"source.frontier.pmid-42379141","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42379141%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42379141 names Social Behavior: \"Since depression and other psychiatric disorders often lead to impairments in social behavior (e.g., social avoidance), the present study examined the effects of psilocin on social avoidance behavior in mice subjected to chronic social defeat stress (CSDS), a widely used model that closely models human psychosocial stress.\"","target":"concept.mesh.d012919","type":"related"},{"source":"claim.frontier.pmid-42372111","sources":[{"id":"source.frontier.pmid-42372111","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42372111%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42372111 names Genomics: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42231562","sources":[{"id":"source.frontier.pmid-42231562","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42231562%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42231562 names Restless Legs Syndrome: \"The purpose of the THRIVE study is to evaluate the outcomes of patients receiving tonic motor activation (TOMAC) for treatment of refractory restless legs syndrome (RLS) in real-world clinical practice.\"","target":"concept.mesh.d012148","type":"related"},{"source":"claim.frontier.pmid-42824002","sources":[{"id":"source.frontier.pmid-42824002","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824002%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42824002 names Urinary Tract Infections: \"In immunocompromised patients, including kidney transplant recipients receiving immunosuppressive therapy, urinary retention may predispose patients to secondary urinary tract infections such as pyelonephritis.\"","target":"concept.mesh.d014552","type":"related"},{"source":"claim.frontier.pmid-42820092","sources":[{"id":"source.frontier.pmid-42820092","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42820092%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42820092 names Pediatrics: \"Background Do-not-resuscitate (DNR) orders in pediatrics are frequently analyzed as static outcomes, although they emerge through a longitudinal process shaped by evolving illness trajectories and repeated clinical encounters.\"","target":"field.mesh.d010372","type":"related"},{"source":"claim.frontier.pmid-42741165","sources":[{"id":"source.frontier.pmid-42741165","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741165%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42741165 names signal transduction: \"In contrast, the gut microbiota in the NJT group was associated with such functions as cell recognition, signal transduction, and immune response.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42729934","sources":[{"id":"source.frontier.pmid-42729934","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729934%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729934 names Cardiology: \"This was a retrospective population-based cohort study of patients diagnosed with CCS at cardiology clinics in Uppsala Region, Sweden, between 2012 and 2020.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42674467","sources":[{"id":"source.frontier.pmid-42674467","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42674467%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42674467 names Public Health: \"Stroke is the main public health problem in Brazil.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42672060","sources":[{"id":"source.frontier.pmid-42672060","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42672060%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42672060 names Cross-sectional study: \"A cross-sectional study was performed with 436 undergraduate medical and non-medical students from eight districts of Bangladesh from September 2023 to July 2025 to encompass diversity throughout academic cycles and guarantee wider geographic representation, using an online structured questionnaire.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42796271","sources":[{"id":"source.frontier.pmid-42796271","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796271%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42796271 names Cardio-Oncology: \": A targeted narrative search of PubMed/MEDLINE, Google Scholar, ClinicalTrials.gov, regulatory product information, and oncology/cardio-oncology guidance was performed and updated on 24 August 2026.\"","target":"field.mesh.d000097562","type":"related"},{"source":"claim.frontier.pmid-42791987","sources":[{"id":"source.frontier.pmid-42791987","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791987%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42791987 names Cardiology: \"The distribution across the medical units was 51.9% infectious disease (n = 467), 19.8% geriatric ward (n = 178), 18.5% cardiology (n = 166), and 9.8% other wards (n = 88).\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42668719","sources":[{"id":"source.frontier.pmid-42668719","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42668719%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42668719 names Serology: \"serology became negative.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42792321","sources":[{"id":"source.frontier.pmid-42792321","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792321%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42792321 names Consumer Behavior: \"Employees increasingly experience blurred boundaries between work and private life, yet little is known about how workplace experiences influence consumer behavior beyond the workplace.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42781606","sources":[{"id":"source.frontier.pmid-42781606","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781606%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781606 names Psychological Well-Being: \"Academic procrastination undermines students' academic performance and psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42729546","sources":[{"id":"source.frontier.pmid-42729546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729546 names Sample Size: \"However, interpretation is limited by small sample sizes, methodological heterogeneity, short follow-up periods, and insufficient characterization of the investigational products.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42729309","sources":[{"id":"source.frontier.pmid-42729309","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729309%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42729309 names Psychological Well-Being: \"Effective crime prevention communication is a cornerstone of urban public health and psychological well-being.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42665853","sources":[{"id":"source.frontier.pmid-42665853","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42665853%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42665853 names Neurology: \"We retrospectively identified all adult patients with status epilepticus (SE) admitted to the Department of Neurology, University Hospital Marburg, Germany, between 2011 and 2023.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42664264","sources":[{"id":"source.frontier.pmid-42664264","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42664264%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42664264 names horizontal gene transfer: \"Bacterial genomes are remarkably dynamic, shaped by horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42661611","sources":[{"id":"source.frontier.pmid-42661611","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661611%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661611 names Palliative Medicine: \"The survey was also distributed to 4500 members of the American Academy of Hospice and Palliative Medicine.\"","target":"field.mesh.d065126","type":"related"},{"source":"claim.frontier.pmid-42724033","sources":[{"id":"source.frontier.pmid-42724033","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42724033%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42724033 names Consumer Behavior: \"In this context, consumer behavior plays a key role, as food choices are shaped not only by economic factors but also by social and psychological dimensions, including identity.\"","target":"concept.mesh.d003258","type":"related"},{"source":"claim.frontier.pmid-42684341","sources":[{"id":"source.frontier.pmid-42684341","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42684341%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42684341 names Empirical evidence: \"However, empirical evidence on the impact of zone 0 regarding procedural skill acquisition and retention remains limited.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42661048","sources":[{"id":"source.frontier.pmid-42661048","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661048%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661048 names horizontal gene transfer: \"Aeromonas spp. are critical aquatic pathogens affecting global aquaculture and human health, yet their taxonomy is frequently confounded by persistent horizontal gene transfer and high recombination rates.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42658813","sources":[{"id":"source.frontier.pmid-42658813","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42658813%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42658813 names Further research is needed: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42799507","sources":[{"id":"source.frontier.pmid-42799507","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799507%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42799507 names Emergency Medicine: \"Reducing diagnostic delays will require educating clinicians who may encounter patients suffering from CH, including those in primary care, emergency medicine, pain management, neurology, otolaryngology, and dentistry.\"","target":"field.mesh.d004635","type":"related"},{"source":"claim.frontier.pmid-42786167","sources":[{"id":"source.frontier.pmid-42786167","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42786167%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42786167 names Risk Factors: \"Our study positions the retinal age gap as a biologically relevant and sex-specific phenotype associated with multiple aging-related diseases and outcomes beyond conventional risk factors, including chronological age.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42719160","sources":[{"id":"source.frontier.pmid-42719160","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719160%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719160 names Psychological Well-Being: \"College students face significant challenges in their physical and psychological well-being, potentially affecting their perception of social status.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42719051","sources":[{"id":"source.frontier.pmid-42719051","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719051%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719051 names immune response: \"Finally, stress response and persistence mechanisms enable subpopulations of parasites to enter dormant, persister-like states characterized by reduced metabolic activity and slowed proliferation, thereby evading both host immune responses and chemotherapeutic agents.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42719040","sources":[{"id":"source.frontier.pmid-42719040","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719040%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42719040 names Psychological Well-Being: \"In conclusion, the implementation of psychological training programs is essential to improve referees' distress tolerance and emotional coping strategies, optimizing both their performance and psychological well-being in the professional domain.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42718586","sources":[{"id":"source.frontier.pmid-42718586","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42718586%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42718586 names Sample Size: \"These should be interpreted as exploratory given the sample size and group imbalance.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42739550","sources":[{"id":"source.frontier.pmid-42739550","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739550%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42739550 names Neurosurgery: \"We performed a retrospective single-institution cohort study of 85 patients younger than 18 years with histologically confirmed medulloblastoma who underwent surgical treatment at the Neurosurgery Unit of Bagdasar-Arseni Emergency Hospital.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42737509","sources":[{"id":"source.frontier.pmid-42737509","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737509%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737509 names tissue remodeling: \"Diabetes mellitus and periodontitis are bidirectionally associated chronic disorders linked through metabolic dysregulation, host inflammation, microbial dysbiosis, and impaired tissue remodeling.\"","target":"concept.go.go0048771","type":"related"},{"source":"claim.frontier.pmid-42737499","sources":[{"id":"source.frontier.pmid-42737499","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737499%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737499 names cell adhesion: \"RNA sequencing revealed substantial transcriptional reprogramming following SsEV treatment, with enrichment analyses indicating the suppression of pathways associated with cell adhesion, extracellular matrix remodeling, lipid metabolism, and particularly Notch signaling.\"","target":"concept.go.go0007155","type":"related"},{"source":"claim.frontier.pmid-42713496","sources":[{"id":"source.frontier.pmid-42713496","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42713496%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42713496 names Precision Medicine: \"This review outlines the fundamental theories, clinical characteristics, diagnostic modalities, therapeutic strategies, and future research directions concerning HTG-AP, with a particular emphasis on recent advancements in molecular biology, precision medicine, and therapeutic technologies.\"","target":"field.mesh.d057285","type":"related"},{"source":"claim.frontier.pmid-42712360","sources":[{"id":"source.frontier.pmid-42712360","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42712360%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42712360 names Obstetrics: \"This prospective observational cohort study was conducted in the Department of Obstetrics and Gynecology at GSVM Medical College, Kanpur, India, between 2023 and 2024.\"","target":"field.mesh.d009774","type":"related"},{"source":"claim.frontier.pmid-42637891","sources":[{"id":"source.frontier.pmid-42637891","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637891%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42637891 names Pathology, Molecular: \"Recent advances in molecular pathology have significantly improved risk stratification in rhabdomyosarcoma, particularly through the identification of FOXO1 fusion status as a key prognostic marker.\"","target":"field.mesh.d057089","type":"related"},{"source":"claim.frontier.pmid-42816488","sources":[{"id":"source.frontier.pmid-42816488","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42816488%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42816488 names cell death: \"-dependent cell death, a hallmark of the hypersensitive response.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42781598","sources":[{"id":"source.frontier.pmid-42781598","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781598%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781598 names Gastroenterology: \"Nephrology and gastroenterology were consulted.\"","target":"ology.gastroenterology","type":"related"},{"source":"claim.frontier.pmid-42781208","sources":[{"id":"source.frontier.pmid-42781208","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781208%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42781208 names Public Health: \"With epidemic TSA (ETSA) events predicted to increase in frequency and severity as climate change progresses, it is more crucial than ever to identify those children most at risk so that appropriate public health education, parent and family education, and conservative management can be initiated.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42737882","sources":[{"id":"source.frontier.pmid-42737882","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737882%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737882 names immune response: \"The major histocompatibility complex (MHC) represents a critical genetic locus that orchestrates adaptive immune responses through antigen presentation and T cell activation, characterized by exceptional polymorphism and species-specific diversity.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42707529","sources":[{"id":"source.frontier.pmid-42707529","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707529%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42707529 names Emotional Exhaustion: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.pmid-42707216","sources":[{"id":"source.frontier.pmid-42707216","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707216%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42707216 names Ophthalmology: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","target":"ology.ophthalmology","type":"related"},{"source":"claim.frontier.pmid-42637977","sources":[{"id":"source.frontier.pmid-42637977","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637977%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42637977 names Ground truth: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42636257","sources":[{"id":"source.frontier.pmid-42636257","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42636257%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42636257 names Genomics: \"Here, using comparative genomics, we analyzed gene lengths in the bacterial domain and revealed a non-neutral distribution of gene lengths across leading and lagging strands.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42635434","sources":[{"id":"source.frontier.pmid-42635434","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42635434%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42635434 names horizontal gene transfer: \"Since prophages are mobile genetic elements that can move between bacteria, they are also an important vehicle for horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42634019","sources":[{"id":"source.frontier.pmid-42634019","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42634019%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42634019 names Microbiology: \"These results underscore the strong potential of this model to enhance MALDI-TOF-based classification frameworks in clinical microbiology and biodefense applications.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42794146","sources":[{"id":"source.frontier.pmid-42794146","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794146%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42794146 names Bone Diseases, Infectious: \"Osteomyelitis is a rare but increasingly recognized manifestation, particularly in children, and may closely mimic malignant or other infectious bone diseases.\"","target":"concept.mesh.d001850","type":"related"},{"source":"claim.frontier.pmid-42737450","sources":[{"id":"source.frontier.pmid-42737450","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737450%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42737450 names Lung Diseases: \"Progressive pulmonary fibrosis (PPF) comprises interstitial lung diseases characterized by progressive fibrosis and lung function decline.\"","target":"concept.mesh.d008171","type":"related"},{"source":"claim.frontier.pmid-42778576","sources":[{"id":"source.frontier.pmid-42778576","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778576%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42778576 names Research program: \"Here we integrate multi-year Fitbit activity data from the All of Us Research Program with clinical biomarker-derived PhenoAge from 2,222 participants (8,447 person-years).\"","target":"concept.wikipedia.research-program","type":"related"},{"source":"claim.frontier.pmid-42728936","sources":[{"id":"source.frontier.pmid-42728936","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728936%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728936 names Empirical evidence: \"Our study provides new empirical evidence of how land management shapes biodiversity and informs strategies for enhancing soil health and ecosystem potential resilience.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42764930","sources":[{"id":"source.frontier.pmid-42764930","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764930%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764930 names Rheumatology: \"The patient fulfilled the 2019 European Alliance of Associations for Rheumatology/American College of Rheumatology (EULAR/ACR) classification criteria for SLE.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42698454","sources":[{"id":"source.frontier.pmid-42698454","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698454%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42698454 names Marital Status: \"Fully adjusted models controlled for age, sex, grade, residence, family economic status, parental marital status, dormitory relationship, classmate relationship, academic pressure, and physical activity frequency.\"","target":"concept.mesh.d017533","type":"related"},{"source":"claim.frontier.pmid-42653506","sources":[{"id":"source.frontier.pmid-42653506","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42653506%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42653506 names cell cycle: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42627947","sources":[{"id":"source.frontier.pmid-42627947","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627947%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627947 names Integrative Medicine: \"In addition, we will exploratorily assess whether this intervention further impacts decisions regarding the initiation or use of other complementary and integrative medicine (CIM) therapies within the first 3 months following surgery.\"","target":"field.mesh.d055048","type":"related"},{"source":"claim.frontier.pmid-42627158","sources":[{"id":"source.frontier.pmid-42627158","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627158%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627158 names Proteomics: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42764822","sources":[{"id":"source.frontier.pmid-42764822","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764822%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42764822 names Public Health: \"Zoonotic sporotrichosis caused by Sporothrix brasiliensis has emerged as a major public health problem in Brazil, with a growing burden of cutaneous sequelae.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42763617","sources":[{"id":"source.frontier.pmid-42763617","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763617%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763617 names Central Nervous System Infections: \"is a rare zoonotic pathogen that only occasionally causes invasive central nervous system infections in humans.\"","target":"concept.mesh.d002494","type":"related"},{"source":"claim.frontier.pmid-42694918","sources":[{"id":"source.frontier.pmid-42694918","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694918%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42694918 names Social Sciences: \"Grounded in reflexive engagement with RAP-Proches - a participatory action research project examining violence in the context of mental illness and family caregiving in Québec, Canada -, and drawing on peer-reviewed literature across psychiatry, psychology, public health, and social sciences, we seek to transform mental health research and services by proposing a reconceptualization of violence in mental health using Johan Galtung's framework of personal, structural, and cultural violence.\"","target":"field.mesh.d012942","type":"related"},{"source":"claim.frontier.pmid-42694103","sources":[{"id":"source.frontier.pmid-42694103","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694103%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42694103 names Empirical evidence: \"As digital learning environments increasingly incorporate artificial intelligence, empirical evidence regarding the educational effectiveness of AI-powered digital avatars remains limited and methodologically heterogeneous.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42689273","sources":[{"id":"source.frontier.pmid-42689273","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689273%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42689273 names Control Groups: \"Unsupervised principal component analysis (PCA) revealed minimal biological variation between the CBD-treated and control groups.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42627223","sources":[{"id":"source.frontier.pmid-42627223","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627223%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42627223 names Sociology, Medical: \"Adopting a socioecological and structural epistemic approach, this viewpoint synthesizes empirical findings from communication psychology, medical sociology, and digital infodemiology, and the MEDF is explicitly positioned relative to established health communication frameworks, including the i-frame and s-frame distinction (individual-level vs system-level intervention targets) and socioecological infodemic models, with each construct's novelty defined in relation to adjacent concepts in prior literature.\"","target":"field.mesh.d012962","type":"related"},{"source":"claim.frontier.pmid-42626349","sources":[{"id":"source.frontier.pmid-42626349","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42626349%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42626349 names Neurology: \"Although neurology and cardiac rhythm improved with high-dose methylprednisolone and pacemaker insertion, the patient developed hepatitis and acute kidney injury (AKI) during steroid tapering, which resolved with re-escalation.\"","target":"ology.neurology","type":"related"},{"source":"claim.frontier.pmid-42344430","sources":[{"id":"source.frontier.pmid-42344430","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42344430%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42344430 names Open science: \"Discourses of 'Open Science' have been criticised for privileging the quantitative and positivist methodologies of science, technology, engineering and mathematics (STEM) research at the expense of qualitative, interpretive, critical-theoretical, practice-based, and other forms of research more common in the arts, humanities and social sciences (AHSS).\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42761991","sources":[{"id":"source.frontier.pmid-42761991","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761991%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42761991 names Serology: \"immunoglobulin M (IgM) serology, and leptospirosis was diagnosed using modified Faine's criteria.\"","target":"ology.serology","type":"related"},{"source":"claim.frontier.pmid-42749735","sources":[{"id":"source.frontier.pmid-42749735","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749735%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42749735 names Risk Factors: \"In the brain, lipid droplets in glial cells, including astrocytes, have been implicated in Alzheimer's disease, but how genetic risk factors influence their composition and turnover remains poorly understood.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42728923","sources":[{"id":"source.frontier.pmid-42728923","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728923%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728923 names Cross-sectional study: \"Because this cross-sectional study used teacher-reported measures, the findings indicate associations rather than causal effects.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42689122","sources":[{"id":"source.frontier.pmid-42689122","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689122%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42689122 names Public Health: \"These findings underscore the critical need to develop resilient cancer care systems that can maintain essential services during future public health crises.\"","target":"field.mesh.d011634","type":"related"},{"source":"claim.frontier.pmid-42654288","sources":[{"id":"source.frontier.pmid-42654288","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42654288%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42654288 names Health Status: \"Higher life satisfaction was associated with greater Mediterranean lifestyle adherence, better subjective sleep quality, higher social participation, higher education, marital or cohabiting status, and better self-reported health status (β ≈ 0.06-0.18).\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.pmid-42651394","sources":[{"id":"source.frontier.pmid-42651394","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651394%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42651394 names Psychological Well-Being: \": Positive psychological constructs such as psychological well-being, resilience, subjective vitality, and mental toughness are fundamental to students' emotional adjustment and overall development.\"","target":"concept.mesh.d000092862","type":"related"},{"source":"claim.frontier.pmid-42646326","sources":[{"id":"source.frontier.pmid-42646326","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42646326%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42646326 names Histology: \"Body weight was monitored in both dams and offspring, and liver histology was assessed by hematoxylin and eosin staining.\"","target":"ology.histology","type":"related"},{"source":"claim.frontier.pmid-42616741","sources":[{"id":"source.frontier.pmid-42616741","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616741%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42616741 names Harm Reduction: \"While grounded in the context of Aotearoa New Zealand, this study offers insights for adapting and implementing alcohol harm reduction interventions in diverse settings, particularly those seeking to integrate decolonising and anti-racist principles.\"","target":"concept.mesh.d040261","type":"related"},{"source":"claim.frontier.pmid-42616230","sources":[{"id":"source.frontier.pmid-42616230","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616230%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42616230 names Neurosurgery: \"Prior antibiotic use (53%), intravascular catheterization (31%), and neurosurgery (22%) were common risk factors.\"","target":"field.mesh.d009493","type":"related"},{"source":"claim.frontier.pmid-42682491","sources":[{"id":"source.frontier.pmid-42682491","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42682491%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42682491 names Rheumatology: \"Diagnostic classification followed the Peripheral Nerve Society 2010 criteria and the 2022 American College of Rheumatology/European Alliance of Associations for Rheumatology classification criteria for systemic vasculitides.\"","target":"ology.rheumatology","type":"related"},{"source":"claim.frontier.pmid-42650730","sources":[{"id":"source.frontier.pmid-42650730","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42650730%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42650730 names Molecular Epidemiology: \"Our findings suggest that a history of COVID-19 was associated with the risk factor profile, recurrence rate and the molecular epidemiology of CDI, rather than with a more severe clinical course or worse prognosis.\"","target":"field.mesh.d017720","type":"related"},{"source":"claim.frontier.pmid-42612575","sources":[{"id":"source.frontier.pmid-42612575","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42612575%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42612575 names Cardiovascular Diseases: \"These data suggest that clinically actionable individualized treatment selection is feasible in PAH with relevance to other complex cardiovascular diseases.\"","target":"concept.mesh.d002318","type":"related"},{"source":"claim.frontier.pmid-42611865","sources":[{"id":"source.frontier.pmid-42611865","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42611865%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42611865 names Sample Size: \"However, as our sample size was small, these findings must be considered with caution and should not be interpreted as predictive.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42751534","sources":[{"id":"source.frontier.pmid-42751534","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42751534%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42751534 names Opportunistic Infections: \"Nodal KS without cutaneous involvement is an uncommon and potentially underrecognized presentation that may mimic HIV-associated lymphoma, disseminated opportunistic infections, and HHV-8-associated multicentric Castleman disease.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42676491","sources":[{"id":"source.frontier.pmid-42676491","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42676491%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42676491 names Cross-sectional study: \"This registry-based cross-sectional study analyzed phase III/IV immunotherapy RCTs from ClinicalTrials.gov.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42652751","sources":[{"id":"source.frontier.pmid-42652751","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652751%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652751 names Dermatology: \"For each domain, the review outlines brief, commonly used screening instruments that may be feasible in routine dermatology.\"","target":"ology.dermatology","type":"related"},{"source":"claim.frontier.pmid-42609599","sources":[{"id":"source.frontier.pmid-42609599","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42609599%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42609599 names Dermatology: \"Following intensive multidisciplinary intervention involving vascular surgery, nephrology, and dermatology, the progression of the disease was successfully halted.\"","target":"ology.dermatology","type":"related"},{"source":"claim.frontier.pmid-42746465","sources":[{"id":"source.frontier.pmid-42746465","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746465%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746465 names Urinary Tract Infections: \"Associated risk factors and comorbidities included diabetes mellitus, chronic kidney disease, intravenous drug use, and preceding urinary tract infections.\"","target":"concept.mesh.d014552","type":"related"},{"source":"claim.frontier.pmid-42746333","sources":[{"id":"source.frontier.pmid-42746333","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746333%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42746333 names Gynecology: \"The final diagnosis was uterine adenosarcoma with sarcomatous overgrowth, International Federation of Gynecology and Obstetrics stage IC.\"","target":"ology.gynecology","type":"related"},{"source":"claim.frontier.pmid-42741475","sources":[{"id":"source.frontier.pmid-42741475","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741475%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42741475 names Thoracic Surgery: \"Early recognition, alongside continued exclusion of infection, may reduce diagnostic delay and the need for extensive thoracic surgery.\"","target":"field.mesh.d013903","type":"related"},{"source":"claim.frontier.pmid-42728996","sources":[{"id":"source.frontier.pmid-42728996","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728996%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728996 names Qualitative Research: \"This study adopts a qualitative research design based on the analysis of secondary data, including official ASEAN documents, academic literature, and case studies.\"","target":"concept.mesh.d036301","type":"related"},{"source":"claim.frontier.pmid-42666182","sources":[{"id":"source.frontier.pmid-42666182","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42666182%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42666182 names Cardiology: \"Follow-up TEE showed persistent moderate mitral regurgitation without the previously observed abnormal echogenic lesion, and the patient was discharged in improved condition with oral antibiotics and arranged cardiology follow-up.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42599952","sources":[{"id":"source.frontier.pmid-42599952","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599952%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599952 names Risk Factors: \"A clear understanding of local Shigella epidemiology and risk factors is essential for guiding control strategies and vaccine introduction.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42599899","sources":[{"id":"source.frontier.pmid-42599899","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599899%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599899 names Research Design: \"The study employed a quantitative, non-experimental, cross-sectional research design to examine those factors.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42599850","sources":[{"id":"source.frontier.pmid-42599850","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599850%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42599850 names Open science: \"The protocol has been preregistered on the Open Science Framework (OSF Registries, available at: https://doi.org/10.17605/OSF.IO/92FPE).\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42732322","sources":[{"id":"source.frontier.pmid-42732322","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732322%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42732322 names Thoracic Surgery: \"Chest wall NF is rare and typically occurs following thoracic surgery or penetrating trauma.\"","target":"field.mesh.d013903","type":"related"},{"source":"claim.frontier.pmid-42661822","sources":[{"id":"source.frontier.pmid-42661822","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661822%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661822 names Endocrinology: \"Multidisciplinary collaboration among trauma, vascular, endocrinology, and radiology teams is crucial for optimal management of such complex cases.\"","target":"ology.endocrinology","type":"related"},{"source":"claim.frontier.pmid-42661658","sources":[{"id":"source.frontier.pmid-42661658","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661658%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42661658 names immune response: \"Transcriptomic analysis showed broad changes in immune-related programs, particularly those associated with antigen presentation, adaptive immune responses, pro-inflammatory signaling, chemokine and cytokine activity, and mucosal immune regulation.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42652200","sources":[{"id":"source.frontier.pmid-42652200","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652200%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652200 names Nuclear Medicine: \"Candidacy was determined by consensus of two nuclear medicine physicians using VISION-like criteria.\"","target":"field.mesh.d009683","type":"related"},{"source":"claim.frontier.pmid-42595314","sources":[{"id":"source.frontier.pmid-42595314","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42595314%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42595314 names Psychiatry: \"We retrospectively analyzed medical records of 29 patients diagnosed with FND at the Somatic Disorders Outpatient Unit (SOMA) of the Institute of Psychiatry of Hospital das Clínicas, Universidade de São Paulo (IPq-HCFMUSP).\"","target":"field.mesh.d011570","type":"related"},{"source":"claim.frontier.pmid-42594273","sources":[{"id":"source.frontier.pmid-42594273","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42594273%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42594273 names Sample Size: \"The target sample size was 375 participants, with 95 participants in the control group and 140 participants in each of the initial intervention groups, which will allow the study to detect changes of 0.35 SD (approximately 30 minutes per day) in sedentary time and 0.41 SD (approximately 4 points) in HEI score between the control and intervention groups (combined).\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42763558","sources":[{"id":"source.frontier.pmid-42763558","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763558%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42763558 names Focal Infection: \"Clinical syndromes were categorized into 4 mutually exclusive categories, namely bloodstream infection, central nervous system infection, pregnancy-associated infection, and other focal infections.\"","target":"concept.mesh.d005490","type":"related"},{"source":"claim.frontier.pmid-42733890","sources":[{"id":"source.frontier.pmid-42733890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42733890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42733890 names Otolaryngology: \"pneumonia prophylaxis and multidisciplinary rheumatology, otolaryngology, pulmonology, and nephrology follow-up.\"","target":"field.mesh.d010036","type":"related"},{"source":"claim.frontier.pmid-42656672","sources":[{"id":"source.frontier.pmid-42656672","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656672%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656672 names Respiratory Tract Infections: \"Mucolytic agents are widely used in respiratory diseases such as chronic obstructive pulmonary disease (COPD), asthma, and upper respiratory tract infections (URTIs).\"","target":"concept.mesh.d012141","type":"related"},{"source":"claim.frontier.pmid-42656481","sources":[{"id":"source.frontier.pmid-42656481","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656481%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656481 names Psychiatry: \"This case suggests that, at the interface between psychiatry and somatic medicine, diagnostic overshadowing, anchoring bias, and fragmented care may jointly contribute to delayed recognition of systemic amyloidosis, particularly cardiac amyloidosis.\"","target":"field.mesh.d011570","type":"related"},{"source":"claim.frontier.pmid-42656460","sources":[{"id":"source.frontier.pmid-42656460","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656460%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42656460 names cell motility: \"induced a strong pro-inflammatory epithelial response associated with IL-17, TNF, and NF-κB signaling, extracellular matrix remodeling, and increased cell motility.\"","target":"concept.go.go0048870","type":"related"},{"source":"claim.frontier.pmid-42585261","sources":[{"id":"source.frontier.pmid-42585261","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585261%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42585261 names Genomics: \"The software is open-source, cross-platform, and freely available at https://pypi.org/project/revolutionhtl/, providing a robust solution for large-scale evolutionary analyses in comparative genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42585188","sources":[{"id":"source.frontier.pmid-42585188","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585188%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42585188 names immune response: \"In terms of immune responses, no significant difference was found in IEL subsets at day 7 between litter groups.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42584423","sources":[{"id":"source.frontier.pmid-42584423","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42584423%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42584423 names Proteomics: \"We critically appraise four common pitfalls-overinterpreting correlation as causation, relegating proteomics to corroborating transcriptomics, incomplete microbiome-host integration lacking environmental context, and systematic neglect of metabolic fluxomics-and show how exposomics and fluxomics add necessary causal and dynamic dimensions.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42725211","sources":[{"id":"source.frontier.pmid-42725211","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725211%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42725211 names Cardiology: \"As the patient remained neurologically intact, a multidisciplinary team involving microbiology, radiology, cardiology, and spinal surgery agreed on conservative management with prolonged intravenous flucloxacillin.\"","target":"ology.cardiology","type":"related"},{"source":"claim.frontier.pmid-42649901","sources":[{"id":"source.frontier.pmid-42649901","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42649901%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42649901 names Precision Medicine: \"Recent advances in molecular profiling have revealed actionable therapeutic targets and created new opportunities for precision medicine.\"","target":"field.mesh.d057285","type":"related"},{"source":"claim.frontier.pmid-42644024","sources":[{"id":"source.frontier.pmid-42644024","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42644024%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42644024 names Opportunistic Infections: \"While autoimmunity is the leading cause of PAP in adults, the majority of pediatric cases occur secondary to immunodeficiency and opportunistic infections.\"","target":"concept.mesh.d009894","type":"related"},{"source":"claim.frontier.pmid-42578673","sources":[{"id":"source.frontier.pmid-42578673","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578673%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42578673 names cytokine production: \"cytokine production.\"","target":"concept.go.go0001816","type":"related"},{"source":"claim.frontier.pmid-42578670","sources":[{"id":"source.frontier.pmid-42578670","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578670%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42578670 names Control Groups: \"We generated 350 non-redundant high-quality metagenome-assembled genomes (MAGs) by binning and conducted comparisons between the depression and control groups.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42651890","sources":[{"id":"source.frontier.pmid-42651890","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651890%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42651890 names cell growth: \"Pathways related to cell growth and motility were more abundant in the GP group, while the GC was enriched in amino acid metabolism and membrane-associated processes.\"","target":"concept.go.go0016049","type":"related"},{"source":"claim.frontier.pmid-42639105","sources":[{"id":"source.frontier.pmid-42639105","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42639105%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42639105 names immune response: \"The diversification of membrane lipids has shaped key membrane functions, including signaling, membrane protein regulation, and immune responses, and may also have driven organismal evolution.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42638898","sources":[{"id":"source.frontier.pmid-42638898","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42638898%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42638898 names immune response: \"Recent studies highlight a complex interaction between the gut microbiome and host mitochondrial dynamics in the modulation of immune responses as well as susceptibility to infectious and inflammatory pathologies.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42577546","sources":[{"id":"source.frontier.pmid-42577546","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42577546%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42577546 names immune response: \"Immune responses varied across clusters, with distinct gene and cytokine expression patterns.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42728921","sources":[{"id":"source.frontier.pmid-42728921","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728921%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42728921 names Empirical evidence: \"Furthermore, the present study adds new contexts to the previous ones by adding workplace contexts and adds empirical evidence within the context of the UAE.\"","target":"concept.wikipedia.empirical-evidence","type":"related"},{"source":"claim.frontier.pmid-42630507","sources":[{"id":"source.frontier.pmid-42630507","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42630507%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42630507 names immune system development: \"The gut microbiota plays a critical role in immune system development.\"","target":"concept.go.go0002520","type":"related"},{"source":"claim.frontier.pmid-42571083","sources":[{"id":"source.frontier.pmid-42571083","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42571083%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42571083 names cell cycle: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42566407","sources":[{"id":"source.frontier.pmid-42566407","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42566407%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42566407 names Cross-sectional study: \"This cross-sectional study analysed digitized dental casts from 60 males and 60 females.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42588195","sources":[{"id":"source.frontier.pmid-42588195","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42588195%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42588195 names Causal inference: \"Because of the uncontrolled study design, causal inferences regarding treatment effects cannot be made, and these findings should be considered hypothesis-generating.\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42560943","sources":[{"id":"source.frontier.pmid-42560943","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560943%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560943 names Research Design: \"A quantitative research design was adopted using a structured 5-point Likert scale survey questionnaire was completed by 480 Gen Z customers of consumer electronics retailers in Sri Lanka.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42560043","sources":[{"id":"source.frontier.pmid-42560043","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560043%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560043 names Proteomics: \", and used differential proteomics to identify functions upregulated specifically when bacteria are grown on maize roots.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42569382","sources":[{"id":"source.frontier.pmid-42569382","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42569382%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42569382 names Cross-sectional study: \"In this cross-sectional study, the top 100 videos for each Chinese search term ('passive smoking' and 'secondhand smoking') were retrieved from Bilibili and Douyin on 10 June 2026.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42554464","sources":[{"id":"source.frontier.pmid-42554464","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42554464%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42554464 names Proteomics: \"Quantitative proteomics indicated that the fitness burden extends beyond flagellar components, with protein-abundance changes across metabolism, stress responses, and signaling.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42528383","sources":[{"id":"source.frontier.pmid-42528383","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42528383%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42528383 names horizontal gene transfer: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42589669","sources":[{"id":"source.frontier.pmid-42589669","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42589669%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42589669 names developmental process: \"BRI1-EMS-SUPPRESSOR 1 (BES1)/BRASSINAZOLE-RESISTANT 1 (BZR1) transcription factors serve as core regulators of brassinosteroid (BR) signal in seed plants, where they control diverse developmental processes, including cell elongation, vascular development, and environmental responses; however, their evolutionary trajectory and functional diversification in early-diverging land plants remain poorly characterized.\"","target":"concept.go.go0032502","type":"related"},{"source":"claim.frontier.pmid-42590131","sources":[{"id":"source.frontier.pmid-42590131","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42590131%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42590131 names Sample Size: \"Further prospective studies with larger sample sizes are warranted.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42545021","sources":[{"id":"source.frontier.pmid-42545021","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42545021%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42545021 names Microbiology: \"This review incorporates flower ecology, microbiology, and pollination biology, and points out how flowers act as microbial gateways between the aboveground and belowground parts of plants, and how flowers remain underappreciated for their role in systemic interaction between plants and microbes.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42549006","sources":[{"id":"source.frontier.pmid-42549006","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42549006%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42549006 names immune response: \"This bacteria-fungi-phage consortium synergistically modulates host immune responses, fostering chronic inflammation and tissue destruction.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42606346","sources":[{"id":"source.frontier.pmid-42606346","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42606346%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42606346 names cell cycle: \"Genes associated with phenotypic differentiation along the urbanization gradient were part of many different pathways including signal transmission, cell cycle and DNA repair.\"","target":"concept.go.go0007049","type":"related"},{"source":"claim.frontier.pmid-42560857","sources":[{"id":"source.frontier.pmid-42560857","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560857%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42560857 names Risk Factors: \"To assess the long-term effects of teleprehabilitation on modifiable risk factors and quality of life up to 1 year following elective cardiac surgery.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42550924","sources":[{"id":"source.frontier.pmid-42550924","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42550924%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42550924 names reproductive process: \"Methionine synthases (MetEs) are essential for plant metabolism and are highly expressed during reproductive processes.\"","target":"concept.go.go0022414","type":"related"},{"source":"claim.frontier.pmid-42520407","sources":[{"id":"source.frontier.pmid-42520407","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42520407%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42520407 names Cell biology: \"Here, we have sequenced a contiguous genome of Spirogyra pratensis, the eponymous representative of Spirogyrales and a classical model system for evolutionary cell biology in the green lineage.\"","target":"ology.cell-biology","type":"related"},{"source":"claim.frontier.pmid-42489250","sources":[{"id":"source.frontier.pmid-42489250","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489250%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42489250 names cell death: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42470282","sources":[{"id":"source.frontier.pmid-42470282","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42470282%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42470282 names developmental process: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","target":"concept.go.go0032502","type":"related"},{"source":"claim.frontier.pmid-42538349","sources":[{"id":"source.frontier.pmid-42538349","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42538349%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42538349 names Causal inference: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42536671","sources":[{"id":"source.frontier.pmid-42536671","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42536671%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42536671 names Causal inference: \"NLCD uses these techniques to extend the statistical tests in an existing linear causal discovery method called the Causal Inference Test (CIT).\"","target":"concept.wikipedia.causal-inference","type":"related"},{"source":"claim.frontier.pmid-42597521","sources":[{"id":"source.frontier.pmid-42597521","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42597521%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42597521 names Research Design: \"We used an implementation research design with a mixed methods approach.\"","target":"concept.mesh.d012107","type":"related"},{"source":"claim.frontier.pmid-42531275","sources":[{"id":"source.frontier.pmid-42531275","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531275%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531275 names Further research is needed: \"Given the exploratory nature of this single-center study, further research is needed to assess the transferability of these findings to other maternity care settings in Lebanon.\"","target":"concept.wikipedia.further-research-is-needed","type":"related"},{"source":"claim.frontier.pmid-42531267","sources":[{"id":"source.frontier.pmid-42531267","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531267%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531267 names Risk Factors: \"We aimed to estimate the prevalence and investigate patterns of multimorbidity in a rural population in India and examine their associations with four common behavioural risk factors (BRFs): daily drinking, tobacco consumption, physical inactivity, and poor sleep.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42531261","sources":[{"id":"source.frontier.pmid-42531261","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531261%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531261 names Cross-sectional study: \"We conducted a mixed-methods retrospective cross-sectional study at Neno District Hospital and Lisungwi Community Hospital.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42531248","sources":[{"id":"source.frontier.pmid-42531248","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531248%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531248 names Cross-sectional study: \"This cross-sectional study used pooled 2023-2024 National Health Interview Survey Adult Sample data.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42531221","sources":[{"id":"source.frontier.pmid-42531221","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531221%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42531221 names Risk Factors: \"This study aimed to assess the prevalence and specific risk factors for suicidal ideation (SI) in PWUO, as well as their use of and barriers to accessing mental health services.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42533345","sources":[{"id":"source.frontier.pmid-42533345","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42533345%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42533345 names metabolic process: \"Root transcriptome profiling identified extensive differential expression associated with microbial perception, signaling, defense, and metabolic processes.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42652430","sources":[{"id":"source.frontier.pmid-42652430","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652430%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42652430 names immune response: \"proliferation), correlating with enhanced plant immune responses.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42507643","sources":[{"id":"source.frontier.pmid-42507643","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42507643%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42507643 names Ground truth: \"Using ClinVar variant classifications as ground truth, AlphaMissense, EVE, and ESM1b were the highest scoring unsupervised in silico missense predictors for IDR variants.\"","target":"concept.wikipedia.ground-truth","type":"related"},{"source":"claim.frontier.pmid-42565205","sources":[{"id":"source.frontier.pmid-42565205","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42565205%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42565205 names Sample Size: \"Given the moderate sample size and lack of adjustment for key confounders, the findings should be considered exploratory and require confirmation in larger, well-controlled studies.\"","target":"concept.mesh.d018401","type":"related"},{"source":"claim.frontier.pmid-42497150","sources":[{"id":"source.frontier.pmid-42497150","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42497150%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42497150 names Cross-sectional study: \"In a cross-sectional study design, we collected data from YWLHIV attending antiretroviral therapy (ART) clinics in northern Uganda between November 2022 and April 2023.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42723771","sources":[{"id":"source.frontier.pmid-42723771","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42723771%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42723771 names Open science: \"The criteria were examined to assess their alignment with the four core commitments of the Agreement and the inclusion of Open Science principles.\"","target":"concept.wikipedia.open-science","type":"related"},{"source":"claim.frontier.pmid-42493198","sources":[{"id":"source.frontier.pmid-42493198","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42493198%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42493198 names Control Groups: \"We used ordinal regression to compare the lifestyle index in the intervention and control groups at the 3-year follow-up, with adjustments for baseline levels of lifestyle index, age, sex and education.\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42489485","sources":[{"id":"source.frontier.pmid-42489485","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489485%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42489485 names Proteomics: \"Together, these findings reveal that ruminococcal cellulosomes are far more prevalent and diverse than previously appreciated and demonstrate the power of structural proteomics to uncover deeply divergent functional systems in the gut microbiome.IMPORTANCEPlant cell wall polysaccharides are a major dietary carbon source, yet their degradation relies on rare, highly specialized microbial enzyme assemblies known as cellulosomes, which have long been considered uncommon in the human gut.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42485395","sources":[{"id":"source.frontier.pmid-42485395","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485395%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42485395 names Risk Factors: \"Risk factors were surveyed, and BLLs were tested with LeadCare II analyzers.\"","target":"concept.mesh.d012307","type":"related"},{"source":"claim.frontier.pmid-42485283","sources":[{"id":"source.frontier.pmid-42485283","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485283%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42485283 names Cross-sectional study: \"A cross-sectional study was conducted with 544 consecutively recruited these hypertensive patients from two tertiary hospitals in China between July 15 and November 15, 2024.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42484337","sources":[{"id":"source.frontier.pmid-42484337","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42484337%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42484337 names Microbiology: \"This work contributes to the field of applied microbiology by expanding the understanding of how environmentally adapted bacteria can serve as biological alternatives to chemical inputs in agroecosystems.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42553384","sources":[{"id":"source.frontier.pmid-42553384","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553384%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42553384 names Genomics: \"using an integrated framework combining structural modeling, comparative genomics, and transcriptomic datasets spanning multiple developmental stages.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42553105","sources":[{"id":"source.frontier.pmid-42553105","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553105%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42553105 names Control Groups: \"Age-matched control groups included ten young wild type (WT) mice (9 males and 1 female) and fourteen aged WT mice (7 males and 7 females).\"","target":"concept.mesh.d035061","type":"related"},{"source":"claim.frontier.pmid-42480918","sources":[{"id":"source.frontier.pmid-42480918","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42480918%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42480918 names transcytosis: \"In study 2, expression of genes associated with SIgA synthesis and transcytosis was evaluated in salivary glands, reticulum, rumen, and small intestine of mature cows.\"","target":"concept.go.go0045056","type":"related"},{"source":"claim.frontier.pmid-42467705","sources":[{"id":"source.frontier.pmid-42467705","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42467705%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42467705 names Cross-sectional study: \"A community-based cross-sectional study was conducted among a weighted sample of 140,054 young women in SSA using recent demographic and health survey data.\"","target":"concept.wikipedia.cross-sectional-study","type":"related"},{"source":"claim.frontier.pmid-42534899","sources":[{"id":"source.frontier.pmid-42534899","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42534899%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42534899 names metabolic process: \"Genome-inferred functional analyses revealed that the predominant metabolic processes included the biosynthesis of nucleic acids, amino acids, organic anions, and vitamins.\"","target":"concept.go.go0008152","type":"related"},{"source":"claim.frontier.pmid-42462719","sources":[{"id":"source.frontier.pmid-42462719","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42462719%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42462719 names horizontal gene transfer: \"These transitions were likely marked by extensive horizontal gene transfer and gene loss, with mobile genetic elements such as plasmids and prophages playing key roles in genomic diversification.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42461951","sources":[{"id":"source.frontier.pmid-42461951","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42461951%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42461951 names cell death: \"Within the NRC (NLR Required for Cell Death) network in Asterids, sensor NLRs detect pathogen presence but require NRC helpers for signaling and to confer immunity.\"","target":"concept.go.go0008219","type":"related"},{"source":"claim.frontier.pmid-42529330","sources":[{"id":"source.frontier.pmid-42529330","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42529330%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42529330 names Proteomics: \"Conjunctival swabs and tear samples were collected for 16S rRNA gene sequencing (V3-V4 region) and label-free quantitative proteomics, respectively.\"","target":"ology.proteomics","type":"related"},{"source":"claim.frontier.pmid-42458577","sources":[{"id":"source.frontier.pmid-42458577","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42458577%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42458577 names Genomics: \"This study aimed to systematically investigate the evolutionary dynamics of TEs in sika deer genome and to elucidate their potential regulatory functions in the development of antler by integrating comparative and functional genomics approaches.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42455014","sources":[{"id":"source.frontier.pmid-42455014","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42455014%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42455014 names horizontal gene transfer: \"operon was distributed via horizontal gene transfer, likely providing cell adaptation to diverse environmental niches through regulation of processes beyond color acclimation.IMPORTANCEThe ability to accurately sense and integrate multiple environmental cues is fundamental to bacterial behavior and survival.\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42454934","sources":[{"id":"source.frontier.pmid-42454934","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42454934%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42454934 names Microbiology: \"Quantifying the abundance and activity of bacteria within populations and communities is fundamental to systems microbiology and microbiome research.\"","target":"field.microbiology","type":"related"},{"source":"claim.frontier.pmid-42491728","sources":[{"id":"source.frontier.pmid-42491728","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42491728%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42491728 names Genomics: \"To elucidate the strain diversity of the targeted community, we isolated strains from ES CRC patient faecal samples and employed comparative genomics.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42516974","sources":[{"id":"source.frontier.pmid-42516974","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42516974%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42516974 names Mycology: \"Although forensic mycology has primarily focused on microscale Ascomycota and successional patterns, this review emphasizes the underexplored potential of macroscopic Basidiomycota as biomarkers in decomposition ecology.\"","target":"ology.mycology","type":"related"},{"source":"claim.frontier.pmid-42441853","sources":[{"id":"source.frontier.pmid-42441853","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42441853%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42441853 names horizontal gene transfer: \"Novel genes arise through multiple mechanisms, including gene duplication, gene fusion, and horizontal gene transfer (HGT).\"","target":"concept.go.go0009292","type":"related"},{"source":"claim.frontier.pmid-42439519","sources":[{"id":"source.frontier.pmid-42439519","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42439519%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42439519 names Genomics: \"To enable functional genomics in this organism, we developed an inducible genome-engineering platform that leverages its endogenous Type II-A CRISPR-Cas9 system.\"","target":"ology.genomics","type":"related"},{"source":"claim.frontier.pmid-42429610","sources":[{"id":"source.frontier.pmid-42429610","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42429610%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42429610 names mucus layer: \"Although dietary and host-derived nutrient availability play a key role in shaping microbial ecology and interaction patterns, the dynamics of these interactions within the mucus layer remain poorly understood.\"","target":"concept.go.go0070701","type":"related"},{"source":"claim.frontier.pmid-42514673","sources":[{"id":"source.frontier.pmid-42514673","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42514673%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42514673 names signal transduction: \"Integrated transcriptome, metabolome, and microbiome analysis showed that the gut microbiota and host transcriptomic changes may participate in systemic metabolic regulation by modulating amino acid metabolism, lipid signal transduction, nucleotide metabolism, and vitamin B6-related metabolic pathways.\"","target":"concept.go.go0007165","type":"related"},{"source":"claim.frontier.pmid-42515727","sources":[{"id":"source.frontier.pmid-42515727","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42515727%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42515727 names immune response: \"Growing evidence supports a relevant contributory role for the gut microbiota as both a mediator and a modulator of NSAID-induced toxicity, affecting epithelial barrier function, oxidative stress, immune responses, and bile acid metabolism.\"","target":"concept.go.go0006955","type":"related"},{"source":"claim.frontier.pmid-42405792","sources":[{"id":"source.frontier.pmid-42405792","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42405792%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42405792 names Taxonomy: \"taxonomy, reveals the distribution and evolutionary history of flagellar and type III secretion systems (T3SS), and identifies two distinct Hrp2/Hrc2-class T3SS types within the genus.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.pmid-42510569","sources":[{"id":"source.frontier.pmid-42510569","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42510569%20AND%20SRC:MED&resultType=core&format=json"}],"summary":"The retained abstract of PMID 42510569 names Taxonomy: \"taxonomy and phylogeny, genomic and karyotypic evolution, reproductive and life history strategies, abiotic stress responses, ecosystem functions, and bioresource potential within a cross-scale framework.\"","target":"field.taxonomy","type":"related"},{"source":"claim.frontier.arxiv-2610-02106","sources":[{"id":"source.frontier.arxiv-2610-02106","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.02106&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.02106 names Differential equation: \"We give sufficient conditions ensuring that, at every fixed positive time, the scalar backward component of a Markovian forward-backward stochastic differential equation with multidimensional forward process admits a density with respect to Lebesgue measure.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2609-39519","sources":[{"id":"source.frontier.arxiv-2609-39519","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39519&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.39519 names Nonlinear Dynamics: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","target":"field.mesh.d017711","type":"related"},{"source":"claim.frontier.arxiv-2609-21904","sources":[{"id":"source.frontier.arxiv-2609-21904","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21904&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21904 names Differential equation: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2609-19386","sources":[{"id":"source.frontier.arxiv-2609-19386","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19386&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.19386 names Machine Learning Algorithms: \"Finally, we provide flexible and efficient statistical inference methods for the bounds on ATT, which can leverage modern machine learning algorithms for estimation.\"","target":"concept.mesh.d000098435","type":"related"},{"source":"claim.frontier.arxiv-2609-13345","sources":[{"id":"source.frontier.arxiv-2609-13345","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.13345&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.13345 names Machine Learning: \"Probabilistic forecasting is central to decision-making under uncertainty, yet its methodological landscape has become increasingly fragmented across temporal and spatiotemporal forecasting, statistical modeling, machine learning, and deep generative modeling.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2609-05100","sources":[{"id":"source.frontier.arxiv-2609-05100","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05100&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.05100 names Order ideal: \"We identify the lattice of buffering structures with the lattice of order ideals of the block poset of the combinatorial canonical form of the associated layered mixed matrix.\"","target":"concept.planetmath.orderideal","type":"related"},{"source":"claim.frontier.arxiv-2608-19170","sources":[{"id":"source.frontier.arxiv-2608-19170","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19170&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.19170 names Differential equation: \"This article introduces a numerical optimal control framework for minmax constrained density control for a class of noisy linear parabolic partial differential equations (PDEs), in particular the noisy heat equation.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2608-14134","sources":[{"id":"source.frontier.arxiv-2608-14134","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.14134&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.14134 names Quantum computing: \"The authors present a rigorous empirical evaluation of three distinct optimization paradigms for institutional factor portfolio construction: an entropy-based photonic quantum annealer (Dirac-3, Quantum Computing Inc.), a commercial mixed-integer programming solver (Gurobi), and a model-free deep reinforcement learning agent (SAC).\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2608-06711","sources":[{"id":"source.frontier.arxiv-2608-06711","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.06711&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.06711 names Quantum computing: \"This paper aims to contextualize the requirements for Quantum Computing (QC) algorithms to achieve a quantum advantage in solving the alternating current power flow (ACPF) problem, with a focus on runtime complexity.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2608-04208","sources":[{"id":"source.frontier.arxiv-2608-04208","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04208&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.04208 names Machine Learning: \"Methods: We applied causal forests, a non-parametric causal machine learning method, to 802,935 trip records from the 2017 and 2022 waves of the National Household Travel Survey.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-03832","sources":[{"id":"source.frontier.arxiv-2608-03832","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03832&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.03832 names Dimensionality Reduction: \"Dimensionality reduction and effect estimation are central tasks in the analysis of high-dimensional data such as in genomics.\"","target":"concept.mesh.d000098405","type":"related"},{"source":"claim.frontier.arxiv-2608-03192","sources":[{"id":"source.frontier.arxiv-2608-03192","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03192&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.03192 names Machine Learning: \"We gathered 100486 racing laps for the years 2021-2025 using the FastF1 API, built a compound-specific physics correction for Dirty Air to account for fuel and tyre wear, and evaluated the change introduced by the 2022 regulation using both OLS regression with clustered standard errors and Causal Forest Double/Debiased Machine Learning.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-02799","sources":[{"id":"source.frontier.arxiv-2608-02799","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02799&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02799 names Differential equation: \"Score-based diffusion models are typically formulated using continuous-time stochastic differential equations and measure-theoretic stochastic calculus.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2608-00708","sources":[{"id":"source.frontier.arxiv-2608-00708","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00708&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00708 names Canonical projection: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","target":"concept.planetmath.canonicalprojection","type":"related"},{"source":"claim.frontier.arxiv-2608-00649","sources":[{"id":"source.frontier.arxiv-2608-00649","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00649&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00649 names Machine Learning: \"Optimal transport potentials are fundamental objects in statistics, economics, and machine learning: their gradients generate optimal transport maps, while the potentials themselves act as location-dependent dual prices and sensitivity variables.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2608-00445","sources":[{"id":"source.frontier.arxiv-2608-00445","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00445&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00445 names Inner product: \"We show that the limiting scalings of the largest squared inner product undergo a discontinuous phase transition in the Watson model, whereas no analogous phenomenon occurs in the FvML model.\"","target":"concept.planetmath.innerproduct","type":"related"},{"source":"claim.frontier.arxiv-2607-29270","sources":[{"id":"source.frontier.arxiv-2607-29270","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29270&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29270 names Zero divisor: \"This representation gives a direct definition of the Moore--Penrose inverse and clarifies the treatment of nonzero zero divisors.\"","target":"concept.planetmath.zerodivisor","type":"related"},{"source":"claim.frontier.arxiv-2607-29131","sources":[{"id":"source.frontier.arxiv-2607-29131","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29131&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29131 names Cosmic microwave background: \"We further confront the model with recent H$α$ observations of dwarf galaxies, together with constraints from the cosmic microwave background, diffuse gamma rays, direct detection and collider searches.\"","target":"physical.cosmic-microwave-background","type":"related"},{"source":"claim.frontier.arxiv-2607-29123","sources":[{"id":"source.frontier.arxiv-2607-29123","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29123&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29123 names Quantum computing: \"Silicon-based donor flip-flop qubits offer a promising path toward scalable, fault-tolerant quantum computing by combining the long coherence times of nuclear spins with fast, fully electrical control and long-range dipole-dipole coupling between qubits.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-29073","sources":[{"id":"source.frontier.arxiv-2607-29073","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29073&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.29073 names Quantum mechanics: \"Classically, using fewer than $n$ distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as $\\big\\lceil \\sqrt{n}\\big\\rceil$ levels per particle [\\href{https://doi.org/10.1103/yhyv-xnwq}{PRL {\\bf 135}, 260603 (2025)}].\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28919","sources":[{"id":"source.frontier.arxiv-2607-28919","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28919&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28919 names Magnetohydrodynamics: \"We present 32 general relativistic radiation magnetohydrodynamics simulations of super-Eddington magnetically arrested disks onto stellar-mass black holes, varying mass ($M_{\\rm BH}= 5, 15, 30\\,M_{\\odot}$), spin ($a=0,0.9$), and accretion rate ($\\dot{M}_{\\rm acc} \\approx 1-2000\\,\\dot{M}_{\\rm Edd}$).\"","target":"physical.magnetohydrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-28080","sources":[{"id":"source.frontier.arxiv-2607-28080","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28080&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28080 names Machine Learning: \"EOMR is compared to the most complete set of state-of-the-art tools from the Artificial Intelligence (AI) and Machine Learning (ML) that is available to the author, on the very challenging problems from chaotic and fluid dynamics: (i) on predicting the Lorenz-96 systems dynamics in strongly- and very-strongly chaotic regimes (with forcing parameter being $F=8$ and $F=12$, respectively); and, (ii) on a data from the Hasegawa-Wakatani model on the edge of the tokamak plasma.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-25783","sources":[{"id":"source.frontier.arxiv-2607-25783","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25783&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25783 names Quantum simulation: \"Molecular tweezer arrays offer great prospects for quantum simulation, sensing, and computing, and would benefit from methods that enhance loading efficiency.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-11988","sources":[{"id":"source.frontier.arxiv-2607-11988","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.11988&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.11988 names Newtonian mechanics: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","target":"physical.newtonian-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28893","sources":[{"id":"source.frontier.arxiv-2607-28893","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28893&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28893 names Euclidean space: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-28883","sources":[{"id":"source.frontier.arxiv-2607-28883","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28883&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28883 names Axion haloscope: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","target":"method.axion-haloscope","type":"related"},{"source":"claim.frontier.arxiv-2607-28746","sources":[{"id":"source.frontier.arxiv-2607-28746","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28746&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28746 names Quantum mechanics: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-28739","sources":[{"id":"source.frontier.arxiv-2607-28739","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28739&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28739 names Dark energy: \"Methods: Volunteers visually inspected colour images of late-type galaxies from the Dark Energy Camera Legacy Survey, from a sample of 49,703 galaxies selected within $4 \\times R_{500}$ of clusters and groups, restricted to galaxies brighter than 19th magnitude in the g and r bands, and with a minimum half-light radius of 2 arcseconds, to aid classification.\"","target":"physical.dark-energy","type":"related"},{"source":"claim.frontier.arxiv-2607-28738","sources":[{"id":"source.frontier.arxiv-2607-28738","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28738&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28738 names General relativity: \"Traversable wormholes are among the most striking hypothetical solutions of general relativity, but every such geometry requires matter that violates the averaged null energy condition (ANEC).\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-28736","sources":[{"id":"source.frontier.arxiv-2607-28736","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28736&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28736 names White dwarfs: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","target":"physical.white-dwarfs","type":"related"},{"source":"claim.frontier.arxiv-2607-28717","sources":[{"id":"source.frontier.arxiv-2607-28717","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28717&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28717 names Astrophysics: \"Using Modules for Experiments in Stellar Astrophysics (MESA) models, we simulate an engulfed planet inspiraling into an AGB star, and allow the planet to accrete mass via Bondi-Hoyle-Lyttleton accretion.\"","target":"physical.astrophysics","type":"related"},{"source":"claim.frontier.arxiv-2607-28714","sources":[{"id":"source.frontier.arxiv-2607-28714","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28714&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28714 names Accretion disks: \"The obtained results highlight the crucial role of X-ray polarimetric data to unveil the geometry of the extended scattering environment surrounding the accretion disks, advancing our understanding of neutron star low-mass X-ray binaries.\"","target":"physical.accretion-disks","type":"related"},{"source":"claim.frontier.arxiv-2607-28690","sources":[{"id":"source.frontier.arxiv-2607-28690","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28690&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28690 names Thermodynamic entropy: \"The resulting Euler--Lagrange equation exhibits a structural correspondence with semiclassical generalized entropy functionals, while maintaining a purely geometric interpretation distinct from thermodynamic entropy in the sense of Perelman's $W$-functional.\"","target":"physical.thermodynamic-entropy","type":"related"},{"source":"claim.frontier.arxiv-2607-28604","sources":[{"id":"source.frontier.arxiv-2607-28604","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28604&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28604 names Fuzzy dark matter: \"In this work, we present a physics-informed generative U-Net framework for fuzzy dark matter (FDM) that addresses two complementary tasks: (i) the evolution of cosmological fields from initial conditions to an arbitrary cosmological scale factor and (ii) the super-resolution of FDM simulations at a specified cosmological scale factor.\"","target":"theory.fuzzy-dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-28597","sources":[{"id":"source.frontier.arxiv-2607-28597","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28597&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28597 names Positive element: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","target":"concept.planetmath.positiveelement","type":"related"},{"source":"claim.frontier.arxiv-2607-28533","sources":[{"id":"source.frontier.arxiv-2607-28533","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28533&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28533 names Ultracold atoms: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","target":"physical.ultracold-atoms","type":"related"},{"source":"claim.frontier.arxiv-2607-28524","sources":[{"id":"source.frontier.arxiv-2607-28524","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28524&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28524 names Quantum simulation: \"Quantum simulations of Dirac fermions with exact chiral symmetry are thus nearly free: applying the overlap Hamiltonian costs only a factor logarithmic in $ε_e$ more than the Wilson-Dirac Hamiltonian.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-28504","sources":[{"id":"source.frontier.arxiv-2607-28504","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28504&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28504 names Quantum computing: \"Fault-tolerant quantum computing requires system-level coordination of logical primitives.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-28491","sources":[{"id":"source.frontier.arxiv-2607-28491","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28491&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28491 names Density functional theory: \"Using density functional theory and Wannier functions, we study the symmetry-protected topology of bulk RG, drumhead surface state (DSS) of semi-infinite RG surface, and the IQG condition for thick RG slabs.\"","target":"physical.density-functional-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-28479","sources":[{"id":"source.frontier.arxiv-2607-28479","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28479&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28479 names Quantum computing: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-28471","sources":[{"id":"source.frontier.arxiv-2607-28471","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28471&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28471 names Renormalization group: \"We present a self-contained numerical study of the one-dimensional transverse-field Ising model (TFIM), tracing its ground-state entanglement structure from exact diagonalization at small system size (L=8,14,20) through density-matrix renormalization group (DMRG) calculations up to L=100.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-28441","sources":[{"id":"source.frontier.arxiv-2607-28441","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28441&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28441 names Density functional theory: \"To understand the origin of this behavior, density functional theory (DFT) calculations were performed.\"","target":"physical.density-functional-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-28438","sources":[{"id":"source.frontier.arxiv-2607-28438","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28438&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28438 names Binary neutron stars: \"We estimate the number of multi-messenger detections from binary neutron stars (BNS) with the Einstein Telescope (ET) and Cosmic Explorer (CE), and project the resulting constraints on the equation of state (EOS), BNS mass distribution, and cosmology via joint hierarchical Bayesian inference.\"","target":"physical.binary-neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-28345","sources":[{"id":"source.frontier.arxiv-2607-28345","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28345&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28345 names Algebraic geometry: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","target":"concept.planetmath.algebraicgeometry","type":"related"},{"source":"claim.frontier.arxiv-2607-28173","sources":[{"id":"source.frontier.arxiv-2607-28173","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28173&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28173 names Thermodynamics: \"Finally, we prove that the quenched pressure is convex in λ, so thermodynamics cannot select an interior mixture: λis therefore a learning hyperparameter.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-28168","sources":[{"id":"source.frontier.arxiv-2607-28168","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28168&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28168 names Invariant subspace: \"Mathematical proofs guarantee immunity to invariant subspaces and structural dilation, validated by extensive numerical evaluations across diverse topologies.\"","target":"concept.planetmath.invariantsubspace","type":"related"},{"source":"claim.frontier.arxiv-2607-28161","sources":[{"id":"source.frontier.arxiv-2607-28161","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28161&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28161 names Data Analysis: \"We introduce \\emph{Topological Causal Data Analysis} (TCDA), a framework separating the observation space, causal-model class, topological representation, and causal query.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-28140","sources":[{"id":"source.frontier.arxiv-2607-28140","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28140&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28140 names Large-scale structure: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-28095","sources":[{"id":"source.frontier.arxiv-2607-28095","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28095&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28095 names Dark matter: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-28021","sources":[{"id":"source.frontier.arxiv-2607-28021","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28021&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28021 names Data Analysis: \"By examining the relationship between the support function of convex geometry and the Euler Characteristic Transform (ECT) of topological data analysis, we develop new tools and suggest variations on some common ECT pipelines.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-27985","sources":[{"id":"source.frontier.arxiv-2607-27985","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27985&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27985 names Thermodynamics: \"Recent advances in quantum information and quantum thermodynamics have reshaped the understanding of energy storage at the microscopic scale, paving the way toward protocols for storing and transferring energy in quantum devices.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27957","sources":[{"id":"source.frontier.arxiv-2607-27957","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27957&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27957 names Quantum entanglement: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-27874","sources":[{"id":"source.frontier.arxiv-2607-27874","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27874&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27874 names Phase transitions: \"We investigate the hydrodynamics of expanding bubbles in first-order phase transitions with non-conformal thermodynamics.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-27860","sources":[{"id":"source.frontier.arxiv-2607-27860","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27860&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27860 names Active galactic nuclei: \"The Baldwin effect --- the inverse correlation between the equivalent width of emission lines and the continuum luminosity in active galactic nuclei (AGNs) --- has been known for nearly five decades, yet its physical origin remains poorly understood.\"","target":"physical.active-galactic-nuclei","type":"related"},{"source":"claim.frontier.arxiv-2607-27805","sources":[{"id":"source.frontier.arxiv-2607-27805","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27805&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27805 names Chaos theory: \"In this work, we apply the tools of nonlinear dynamics and chaos theory to LLMs.\"","target":"physical.chaos-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-27799","sources":[{"id":"source.frontier.arxiv-2607-27799","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27799&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27799 names Invariant subspace: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","target":"concept.planetmath.invariantsubspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27707","sources":[{"id":"source.frontier.arxiv-2607-27707","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27707&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27707 names Thermodynamics: \"We investigate the horizon structure, constrained thermodynamics, and geodesic properties of an effective Kerr-like black hole in a non-commutative background.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27646","sources":[{"id":"source.frontier.arxiv-2607-27646","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27646&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27646 names Isomorphism: \"Every such isometry extends uniquely to a complex-linear isometric order isomorphism, for which we obtain a coordinate representation.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-27629","sources":[{"id":"source.frontier.arxiv-2607-27629","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27629&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27629 names Incidence structure: \"We characterize when the incidence structure underlying Wolff's hairbrush argument persists.\"","target":"concept.planetmath.incidencestructure","type":"related"},{"source":"claim.frontier.arxiv-2607-27582","sources":[{"id":"source.frontier.arxiv-2607-27582","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27582&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27582 names Abelian group: \"This disproves a conjecture of Bergelson and McCutcheon (c. 2000), which predicted that for any countably infinite abelian groups $H$ and $G$, every polynomial map $p:H\\to G$ with $p(0_H)=0_G$ is good for nice recurrence.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-21030","sources":[{"id":"source.frontier.arxiv-2607-21030","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21030&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21030 names Quantum entanglement: \"This construction provides a concrete realization of how complex bulk geometry may emerge from timelike entanglement, extending the familiar idea that spacetime geometry is encoded in quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-19220","sources":[{"id":"source.frontier.arxiv-2607-19220","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19220&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19220 names Neutron stars: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","target":"physical.neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-12710","sources":[{"id":"source.frontier.arxiv-2607-12710","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12710&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.12710 names Quantum entanglement: \"Heating usually destroys quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-10561","sources":[{"id":"source.frontier.arxiv-2607-10561","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.10561&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.10561 names Quantum mechanics: \"We develop a microscopic quantum membrane paradigm from the matrix quantum mechanics of black holes [1].\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-03479","sources":[{"id":"source.frontier.arxiv-2607-03479","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.03479&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.03479 names Graph theory: \"The connections between graph theory, and more generally association schemes, and coding theory were established by Delsarte for the Hamming metric and rank-metric codes.\"","target":"concept.planetmath.graphtheory","type":"related"},{"source":"claim.frontier.arxiv-2607-27515","sources":[{"id":"source.frontier.arxiv-2607-27515","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27515&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27515 names Dark matter: \"We present an analytical study of minimal mass-varying dark matter models, in which a single scalar field controls the dark matter mass, focusing on their utility in simultaneously addressing multiple cosmological tensions.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27514","sources":[{"id":"source.frontier.arxiv-2607-27514","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27514&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27514 names Euclidean space: \"In this paper, we study the sample complexity of the empirical plug-in estimator for the $2$-Gromov-Wasserstein distance $D_2$ between compactly supported probability measures on Euclidean spaces.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27502","sources":[{"id":"source.frontier.arxiv-2607-27502","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27502&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27502 names Renormalization group: \"Plotting $dN/dT$ against the simultaneously measured occupation $N$ reveals an asymmetric lineshape with its peak shifted to $N>1/2$---a hallmark of Kondo screening---that weakens with increasing temperature and is qualitatively reproduced by numerical renormalization group (NRG) calculations, with a small but persistent offset to lower occupation relative to the theory.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-27403","sources":[{"id":"source.frontier.arxiv-2607-27403","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27403&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27403 names Data Analysis: \"Incomplete compositional data analysis faces a fundamental limitation: likelihood-based methods for compositional models generally require fully observed compositions, making it difficult to accommodate missing or censored proportions directly on the simplex.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-27391","sources":[{"id":"source.frontier.arxiv-2607-27391","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27391&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27391 names Stellar evolution: \"We investigate the impact of uncertainties in binary stellar evolution on the formation efficiency and cosmological merger rate of BNS systems.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-27388","sources":[{"id":"source.frontier.arxiv-2607-27388","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27388&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27388 names Thermodynamics: \"Together, these results establish a bits-per-area principle linking black-hole thermodynamics, information geometry, and quantum information in the HBAR framework.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27362","sources":[{"id":"source.frontier.arxiv-2607-27362","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27362&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27362 names Lorentz transformations: \"We illustrate this mechanism with a space-time-modulated wire medium, described through Lorentz transformations and quasi-static homogenization.\"","target":"physical.lorentz-transformations","type":"related"},{"source":"claim.frontier.arxiv-2607-27344","sources":[{"id":"source.frontier.arxiv-2607-27344","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27344&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27344 names Loop quantum gravity: \"We review the unimodular version of loop quantum cosmology and comment on possible connections to full (unimodular) loop quantum gravity.\"","target":"field.loop-quantum-gravity","type":"related"},{"source":"claim.frontier.arxiv-2607-27334","sources":[{"id":"source.frontier.arxiv-2607-27334","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27334&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27334 names Higgs boson: \"We present next-to-next-to-leading order (NNLO) QCD predictions for Higgs boson pair production in association with a weak gauge boson, $pp \\to Vhh$ with $V=W^\\pm,Z$, in effective field theory descriptions of new physics.\"","target":"physical.higgs-boson","type":"related"},{"source":"claim.frontier.arxiv-2607-27329","sources":[{"id":"source.frontier.arxiv-2607-27329","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27329&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27329 names Black holes: \"Quasars are luminous objects that provide insights into the physics and evolution of supermassive black holes (SMBHs) and their accretion flows, galaxy evolution, and even cosmology.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-27326","sources":[{"id":"source.frontier.arxiv-2607-27326","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27326&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27326 names Dark matter: \"Dwarf galaxies provide excellent targets to search for signals of dark matter annihilation or decay.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27312","sources":[{"id":"source.frontier.arxiv-2607-27312","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27312&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27312 names Dark matter: \"Dark matter that self interacts through long-range forces exhibits coherent, collective effects that are absent in short-range interactions.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-27299","sources":[{"id":"source.frontier.arxiv-2607-27299","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27299&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27299 names Thermodynamics: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-27181","sources":[{"id":"source.frontier.arxiv-2607-27181","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27181&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27181 names Quantum information science: \"Demonstrating a practical quantum advantage remains a central goal in quantum information science.\"","target":"physical.quantum-information-science","type":"related"},{"source":"claim.frontier.arxiv-2607-27158","sources":[{"id":"source.frontier.arxiv-2607-27158","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27158&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27158 names Black holes: \"The interactions of walls and monopoles leads to novel processes such as the absorption of monopoles on walls, production of monopoles when domain walls annihilate, collapse of walls with magnetic charge that can, with gravity taken into account, produce magnetically charged black holes, and production of a stochastic gravitational wave background from biased domain walls.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-27129","sources":[{"id":"source.frontier.arxiv-2607-27129","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27129&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27129 names General relativity: \"In general relativity, the motion of a test mass around a rotating black hole is described by Kerr geodesics.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-27105","sources":[{"id":"source.frontier.arxiv-2607-27105","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27105&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27105 names Machine Learning Algorithms: \"The algorithm maintains its high performance in this general setting, demonstrating its versatility, robustness across varying seizure morphologies, and potential to complement machine learning algorithms.\"","target":"concept.mesh.d000098435","type":"related"},{"source":"claim.frontier.arxiv-2607-27098","sources":[{"id":"source.frontier.arxiv-2607-27098","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27098&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27098 names Metric space: \"This paper investigates the relationship between coding theory and extremal combinatorics by representing codes in general metric spaces as independent sets in proximity graphs.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-27062","sources":[{"id":"source.frontier.arxiv-2607-27062","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27062&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27062 names Machine Learning: \"Physics-informed machine learning incorporates physical principles --often expressed via differential operators-- into data-driven models.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-27038","sources":[{"id":"source.frontier.arxiv-2607-27038","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27038&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27038 names Differential operator: \"We prove that for every complex reflection group $G$ and every $n \\geq 2$ the ring of invariant differential operators $A_n(\\mathbb{K})^G$ has irreducible non-holonomic modules of Gelfand-Kirillov dimension $2n-1$, and we exhibit such modules explicitly.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-27037","sources":[{"id":"source.frontier.arxiv-2607-27037","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27037&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.27037 names Linear algebra: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","target":"concept.planetmath.linearalgebra","type":"related"},{"source":"claim.frontier.arxiv-2607-26966","sources":[{"id":"source.frontier.arxiv-2607-26966","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26966&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26966 names Stellar evolution: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-26932","sources":[{"id":"source.frontier.arxiv-2607-26932","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26932&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26932 names Large-scale structure: \"Photometric surveys offer a powerful way to map the large-scale structure of the Universe, but their redshift errors complicate the identification of cosmic voids, challenging studies of their environmental effect on galaxy properties.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-26890","sources":[{"id":"source.frontier.arxiv-2607-26890","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26890&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26890 names Vector field: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-26800","sources":[{"id":"source.frontier.arxiv-2607-26800","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26800&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26800 names Neutron stars: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","target":"physical.neutron-stars","type":"related"},{"source":"claim.frontier.arxiv-2607-26782","sources":[{"id":"source.frontier.arxiv-2607-26782","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26782&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26782 names Differential equation: \"The approach developed in this paper should be useful for solving other nonlinear partial differential equations involving similar difficulties.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-26677","sources":[{"id":"source.frontier.arxiv-2607-26677","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26677&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26677 names Isomorphism: \"Given an isomorphism between the fundamental groups of two compact hyperbolic manifolds of dimension at least three, we consider the associated equivariant harmonic lift.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-26653","sources":[{"id":"source.frontier.arxiv-2607-26653","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26653&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26653 names Differential operator: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-26508","sources":[{"id":"source.frontier.arxiv-2607-26508","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26508&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26508 names Data Analysis: \"Quantifying the association between a real-valued variable and a categorical variable is a fundamental task in data analysis.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-26484","sources":[{"id":"source.frontier.arxiv-2607-26484","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26484&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26484 names Open set: \"A d-spectral space is a compact, d-sober bitopological space such that both open set lattices are coherent frames, where d-sobriety is the bitopological notion of sobriety due to Jung and Moshier.\"","target":"concept.planetmath.openset","type":"related"},{"source":"claim.frontier.arxiv-2607-26433","sources":[{"id":"source.frontier.arxiv-2607-26433","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26433&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26433 names Distribution function: \"In contrast to quantum Fokker--Planck equations with prescribed diffusion and friction coefficients, the macroscopic quantities are nonlinear functionals of the distribution function.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-26408","sources":[{"id":"source.frontier.arxiv-2607-26408","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26408&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26408 names Quantum field theory: \"We investigate the creation of electron-positron pairs by two spatiotemporally inhomogeneous electric fields with a relative phase, employing computational quantum field theory.\"","target":"physical.quantum-field-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-26378","sources":[{"id":"source.frontier.arxiv-2607-26378","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26378&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26378 names Absolute value: \"Every essential edge has strictly larger coefficient, in absolute value, than every non-essential edge in the harmonic representative, and the absolute values of the coefficients of all essential edges are equal.\"","target":"concept.planetmath.absolutevalue","type":"related"},{"source":"claim.frontier.arxiv-2607-26374","sources":[{"id":"source.frontier.arxiv-2607-26374","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26374&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26374 names General relativity: \"In this work we solve the coupled Einstein-Dirac-Maxwell (EDM) system for static spherically symmetric configurations of two fermions in a singlet spinor state within the $3+1$ formalism of general relativity.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-26289","sources":[{"id":"source.frontier.arxiv-2607-26289","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26289&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26289 names Statistical mechanics: \"Dipolar magnetic skyrmions can assemble into chains with alternating helicity that act as one-dimensional polymers, yet their statistical mechanics violates the universal harmonic scaling observed in actin, DNA, and microtubules.\"","target":"physical.statistical-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-26281","sources":[{"id":"source.frontier.arxiv-2607-26281","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26281&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26281 names Differential equation: \"We ask the question of which such representation takes up the least amount of memory, measured as number of real values needed to store the truncated log-signature, subject to the constraint of it being able to approximate solutions to linear controlled differential equations (CDEs) $\\mathrm{d} Y = AY \\mathrm{d} X$ with $|A| \\leq r$ at accuracy at least $\\varepsilon$.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-26205","sources":[{"id":"source.frontier.arxiv-2607-26205","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26205&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26205 names Accretion disks: \"Accretion disks around massive black holes (MBHs) in galactic nuclei can contain significant mass, in which case their non-spherical potentials exert significant torques on single and binary stars orbiting the MBHs.\"","target":"physical.accretion-disks","type":"related"},{"source":"claim.frontier.arxiv-2607-26193","sources":[{"id":"source.frontier.arxiv-2607-26193","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26193&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26193 names Cosmic expansion: \"Furthermore, this approach robustly constrains the cosmic expansion history throughout the post-reionization era of the Universe and, unlike conventional standard sirens, simultaneously probes the large scale distribution of matter perturbations, achieving relative uncertainties of approximately 1.3% on the total matter density $Ω_\\mathrm{m}$ and 1.6% on the late-time clustering amplitude $σ_8$.\"","target":"physical.cosmic-expansion","type":"related"},{"source":"claim.frontier.arxiv-2607-26180","sources":[{"id":"source.frontier.arxiv-2607-26180","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26180&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26180 names Baryon acoustic oscillations: \"These oscillations could in principle bias distance measurements derived from Baryon Acoustic Oscillations (BAO), a key science driver of post-reionization 21 cm intensity mapping.\"","target":"physical.bao","type":"related"},{"source":"claim.frontier.arxiv-2607-26177","sources":[{"id":"source.frontier.arxiv-2607-26177","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26177&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26177 names Black holes: \"The active black holes uncovered by JWST in the early Universe are highly abundant and seemingly overmassive with respect to local scaling relations, challenging standard models of black hole formation and growth.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-26151","sources":[{"id":"source.frontier.arxiv-2607-26151","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26151&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26151 names Phase transitions: \"We study quantum phase transitions of Mott insulators between spin-glass and featureless paramagnetic phases.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-26147","sources":[{"id":"source.frontier.arxiv-2607-26147","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26147&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26147 names Stellar evolution: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","target":"physical.stellar-evolution","type":"related"},{"source":"claim.frontier.arxiv-2607-26141","sources":[{"id":"source.frontier.arxiv-2607-26141","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26141&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26141 names Electromagnetism: \"We study electromagnetic wave propagation in metric--affine geometries, where torsion and non-metricity may be present and the coupling between electromagnetism and spacetime is no longer unique.\"","target":"field.electromagnetism","type":"related"},{"source":"claim.frontier.arxiv-2607-26103","sources":[{"id":"source.frontier.arxiv-2607-26103","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26103&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26103 names General relativity: \"A static configuration consisting of a rigid spherical shell enclosing a degenerate Schwarzschild Klinkhamer wormhole is investigated in general relativity.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-26030","sources":[{"id":"source.frontier.arxiv-2607-26030","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26030&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26030 names Phase transitions: \"The interplay between ionic and electronic subsystems dictates the behavior of structural phase transitions in polar dielectrics, a coupling mediated by soft optical phonon modes.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25977","sources":[{"id":"source.frontier.arxiv-2607-25977","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25977&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25977 names Kripke semantics: \"We connect modal set theory with Boolean-valued models by developing an \\emph{internal} Kripke semantics for modal formulas whose atomic propositions are set-theoretic sentences.\"","target":"concept.planetmath.kripkesemantics","type":"related"},{"source":"claim.frontier.arxiv-2607-25960","sources":[{"id":"source.frontier.arxiv-2607-25960","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25960&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25960 names Isomorphism: \"The proofs rely on a systematic application of the integral Hamiltonian Floer theory package developed by the first and fourth author, a Künneth isomorphism in equivariant Floer homology, and new quantitative analysis of quantum power maps, which is of independent interest.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-25950","sources":[{"id":"source.frontier.arxiv-2607-25950","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25950&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25950 names Differential equation: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-25910","sources":[{"id":"source.frontier.arxiv-2607-25910","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25910&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25910 names Composite number: \"A nonnegative integer $n$ is $d$-translated unit sensitive when appending $d$ zeros to the right of the number and changing the unit digit to any possible unit digit (so long as the resulting number is not $n$) results in a composite number.\"","target":"concept.planetmath.compositenumber","type":"related"},{"source":"claim.frontier.arxiv-2607-25865","sources":[{"id":"source.frontier.arxiv-2607-25865","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25865&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25865 names Quantum computing: \"Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-25772","sources":[{"id":"source.frontier.arxiv-2607-25772","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25772&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25772 names Homology: \"On a side note, using Legendrian surgery and the ruling invariant, we show that the total symplectic homology of Stein fillings of $(\\mathbb{T}^3, ξ_1)$ is non-zero.\"","target":"concept.planetmath.homology","type":"related"},{"source":"claim.frontier.arxiv-2607-25743","sources":[{"id":"source.frontier.arxiv-2607-25743","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25743&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25743 names Thermodynamics: \"Using non-equilibrium thermodynamics, we develop a theoretical framework that identifies the physicochemical conditions controlling whether vacuoles form and how big vacuoles can become.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25706","sources":[{"id":"source.frontier.arxiv-2607-25706","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25706&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25706 names Monoidal category: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","target":"concept.planetmath.monoidalcategory","type":"related"},{"source":"claim.frontier.arxiv-2607-25678","sources":[{"id":"source.frontier.arxiv-2607-25678","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25678&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25678 names Thermodynamics: \"Controlling heat flow in small quantum systems is a central goal of quantum thermodynamics and nanoscale transport.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25644","sources":[{"id":"source.frontier.arxiv-2607-25644","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25644&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25644 names Vector field: \"As applications, we prove uniqueness of the tangent space at infinity for Kähler-Ricci shrinkers with bounded scalar curvature and Euclidean volume growth whose soliton vector field generates an $S^1$-action, and for all four-dimensional Ricci shrinkers with bounded scalar curvature.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25625","sources":[{"id":"source.frontier.arxiv-2607-25625","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25625&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25625 names Renormalization group: \"Infinite-system density-matrix renormalization group simulations built on these masses reproduce the master formula.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-25621","sources":[{"id":"source.frontier.arxiv-2607-25621","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25621&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25621 names Vector field: \"We extend the celebrated result of Alberti, stating that Borel vector fields coincide with gradients of $C^1$-functions outside of a set of arbitrary small measure.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25610","sources":[{"id":"source.frontier.arxiv-2607-25610","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25610&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25610 names Vector field: \"We consider the classical analytic linearization problem for vector fields on the torus $\\mathbb{T}^d$ close to a constant vector field $ω$.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-25559","sources":[{"id":"source.frontier.arxiv-2607-25559","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25559&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25559 names Phase transitions: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25473","sources":[{"id":"source.frontier.arxiv-2607-25473","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25473&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25473 names Partition function: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","target":"physical.partition-function","type":"related"},{"source":"claim.frontier.arxiv-2607-25460","sources":[{"id":"source.frontier.arxiv-2607-25460","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25460&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25460 names Transfinite recursion: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","target":"theory.planetmath.transfiniterecursion","type":"related"},{"source":"claim.frontier.arxiv-2607-25394","sources":[{"id":"source.frontier.arxiv-2607-25394","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25394&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25394 names Phase transitions: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-25341","sources":[{"id":"source.frontier.arxiv-2607-25341","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25341&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25341 names Quantum electrodynamics: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","target":"physical.quantum-electrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-25252","sources":[{"id":"source.frontier.arxiv-2607-25252","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25252&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25252 names Differentiable function: \"The objective mapping of the problem involves finitely many functions, with each one being the sum of a continuously differentiable function and a convex function that is proper and closed.\"","target":"concept.planetmath.differentiablefunction","type":"related"},{"source":"claim.frontier.arxiv-2607-25226","sources":[{"id":"source.frontier.arxiv-2607-25226","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25226&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25226 names Quantum electrodynamics: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","target":"physical.quantum-electrodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-21883","sources":[{"id":"source.frontier.arxiv-2607-21883","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21883&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21883 names Differential equation: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-18525","sources":[{"id":"source.frontier.arxiv-2607-18525","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18525&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18525 names Metric space: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-13775","sources":[{"id":"source.frontier.arxiv-2607-13775","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13775&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.13775 names Wave equation: \"The Dirac current provides the fundamental energy identity, while quantitative spacetime estimates are obtained from the wave equation arising from the squared Dirac operator.\"","target":"concept.planetmath.waveequation","type":"related"},{"source":"claim.frontier.arxiv-2607-05687","sources":[{"id":"source.frontier.arxiv-2607-05687","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05687&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.05687 names Vector field: \"Exploiting the underlying geometric structure, we reformulate the problem as an infinite-dimensional control-affine system in Fourier variables and analyze the Lie algebra generated by the controlled vector fields.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-05485","sources":[{"id":"source.frontier.arxiv-2607-05485","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05485&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.05485 names Quantum field theory: \"In this paper we will examine if nonlocal quantum field theory will suffer from the fermion doubling pathology.\"","target":"physical.quantum-field-theory","type":"related"},{"source":"claim.frontier.arxiv-2607-24988","sources":[{"id":"source.frontier.arxiv-2607-24988","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24988&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24988 names Quantum mechanics: \"Observables in quantum mechanics are generally complementary, that is, they reveal mutually incompatible pieces of information about a given system.\"","target":"physical.quantum-mechanics","type":"related"},{"source":"claim.frontier.arxiv-2607-24938","sources":[{"id":"source.frontier.arxiv-2607-24938","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24938&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24938 names Black holes: \"These findings highlight that environmental effects can seriously impact tidal signatures, while still permitting, under suitable conditions, the distinguishability of horizonless compact objects from black holes in gravitational-wave observations.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-24933","sources":[{"id":"source.frontier.arxiv-2607-24933","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24933&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24933 names Sub-GeV dark matter: \"Using numerical calculations of the 1D structure factor, we also obtain quantitative validation of using an incoherent approximation to compute sub-GeV dark matter scattering in realistic 3D crystals.\"","target":"concept.sub-gev-dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24918","sources":[{"id":"source.frontier.arxiv-2607-24918","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24918&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24918 names Neutrino oscillation: \"Incorporating the long-range potential into supernova neutrino oscillations, we simulate the corresponding signal in the Deep Underground Neutrino Experiment (DUNE) using a realistic detector response of its 40 kt Liquid Argon Time Projection Chamber.\"","target":"physical.neutrino-oscillation","type":"related"},{"source":"claim.frontier.arxiv-2607-24705","sources":[{"id":"source.frontier.arxiv-2607-24705","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24705&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24705 names Distribution function: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-24682","sources":[{"id":"source.frontier.arxiv-2607-24682","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24682&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24682 names Quantum entanglement: \"Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement.\"","target":"physical.quantum-entanglement","type":"related"},{"source":"claim.frontier.arxiv-2607-24654","sources":[{"id":"source.frontier.arxiv-2607-24654","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24654&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24654 names General relativity: \"In addition, we derive an explicit analytical expression in commutative General Relativity for the residual radial velocity generated by the Weber--Wheeler pulse at large radial distances in the perturbative regime.\"","target":"physical.general-relativity","type":"related"},{"source":"claim.frontier.arxiv-2607-24641","sources":[{"id":"source.frontier.arxiv-2607-24641","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24641&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24641 names Machine Learning: \"This work furthers the recent interest in adapting machine learning methods to the study of multivariate extremes.\"","target":"concept.mesh.d000069550","type":"related"},{"source":"claim.frontier.arxiv-2607-24605","sources":[{"id":"source.frontier.arxiv-2607-24605","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24605&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24605 names Cosmic microwave background: \"Cosmic microwave background (CMB) experiments use simulations of instrumental systematic effects to ensure high-fidelity measurements of cosmological parameters.\"","target":"physical.cosmic-microwave-background","type":"related"},{"source":"claim.frontier.arxiv-2607-24584","sources":[{"id":"source.frontier.arxiv-2607-24584","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24584&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24584 names Dark matter: \"In this work we present the first constraint on invisible solar-neutrino decay using coherent elastic neutrino-nucleus scattering, recently observed in dark matter direct detection experiments.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24544","sources":[{"id":"source.frontier.arxiv-2607-24544","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24544&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24544 names Large-scale structure: \"The Halpha and IR morphologies generally trace the same large-scale structures, although most of the IR arcs lie slightly closer to the star and appear broader than their optical counterparts.\"","target":"physical.large-scale-structure","type":"related"},{"source":"claim.frontier.arxiv-2607-24524","sources":[{"id":"source.frontier.arxiv-2607-24524","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24524&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24524 names Dark matter: \"Light dark matter (DM) is a compelling scenario for the observed relic abundance, with accelerator-based searches as a powerful discovery strategy.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24489","sources":[{"id":"source.frontier.arxiv-2607-24489","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24489&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24489 names Absolute value: \"The key technique is to locate the zeros of the integrands explicitly, which allows removal of the absolute value and reduces the problem to evaluating limits of telescoping trigonometric sums via asymptotic analysis.\"","target":"concept.planetmath.absolutevalue","type":"related"},{"source":"claim.frontier.arxiv-2607-24446","sources":[{"id":"source.frontier.arxiv-2607-24446","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24446&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24446 names Dark matter: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24433","sources":[{"id":"source.frontier.arxiv-2607-24433","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24433&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24433 names Propositional logic: \"The simply typed λ-calculus is a model of computation where typed terms correspond to proofs of intuitionistic propositional logic (IPL) via the Curry-Howard correspondence.\"","target":"concept.planetmath.propositionallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-24254","sources":[{"id":"source.frontier.arxiv-2607-24254","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24254&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24254 names Black holes: \"Finally, we introduce a compact, 3-parameter thermodynamic state-space diagnostic that tracks the continuous evolution of regular black holes from classical thermal evaporation to cold remnant lock, offering a quantitative framework for quantum-gravity phenomenology.\"","target":"physical.black-holes","type":"related"},{"source":"claim.frontier.arxiv-2607-24252","sources":[{"id":"source.frontier.arxiv-2607-24252","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24252&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24252 names Renormalization group: \"In the present work, we perform a field-theoretic renormalization group (RG) analysis of the dynamics of two non-reciprocally coupled $n$-vector order parameters possessing a $U(n)$ symmetry, generalizing previous results to order parameters with multiple components, a feature that has been shown to generate novel non-equilibrium critical behavior in certain non-reciprocal systems.\"","target":"physical.renormalization-group","type":"related"},{"source":"claim.frontier.arxiv-2607-24244","sources":[{"id":"source.frontier.arxiv-2607-24244","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24244&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24244 names Quantum computing: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-24240","sources":[{"id":"source.frontier.arxiv-2607-24240","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24240&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24240 names Atomic clocks: \"Ultimately, such compact, stable, and frequency-tunable visible light sources are key for integrated optical atomic clocks and underwater lidar application.\"","target":"physical.atomic-clocks","type":"related"},{"source":"claim.frontier.arxiv-2607-24239","sources":[{"id":"source.frontier.arxiv-2607-24239","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24239&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24239 names Quantum simulation: \"Cold polar molecules offer fascinating prospects for ultracold chemistry and quantum physics, including new platforms for quantum simulation or computation.\"","target":"physical.quantum-simulation","type":"related"},{"source":"claim.frontier.arxiv-2607-24212","sources":[{"id":"source.frontier.arxiv-2607-24212","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24212&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24212 names Isomorphism: \"We exploit this connection to establish an isomorphism that underpins probabilistic tape diagrams, a graphical formalism for bimonoidal (also known as rig) categories, and we demonstrate its effectiveness by providing a complete axiomatisation of probabilistic Boolean circuits.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-24144","sources":[{"id":"source.frontier.arxiv-2607-24144","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24144&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24144 names Dark matter: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","target":"physical.dark-matter","type":"related"},{"source":"claim.frontier.arxiv-2607-24123","sources":[{"id":"source.frontier.arxiv-2607-24123","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24123&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24123 names Real number: \"We determine the optimal constants in inequalities comparing the differences of the quadratic, arithmetic, and harmonic means of $n$ nonnegative real numbers.\"","target":"concept.planetmath.realnumber","type":"related"},{"source":"claim.frontier.arxiv-2607-24091","sources":[{"id":"source.frontier.arxiv-2607-24091","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24091&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24091 names Gravitational lensing: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","target":"physical.gravitational-lensing","type":"related"},{"source":"claim.frontier.arxiv-2607-24078","sources":[{"id":"source.frontier.arxiv-2607-24078","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24078&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24078 names Thermodynamics: \"The theoretical foundation of combining external nonequilibrium thermodynamics, the nonequilibrium statistical operator method, and stochastic first passage time thermodynamics are explored.\"","target":"field.thermodynamics","type":"related"},{"source":"claim.frontier.arxiv-2607-23978","sources":[{"id":"source.frontier.arxiv-2607-23978","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23978&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23978 names Quantum sensing: \"Our results provide an experimental route to non-Hermitian observable readout and clarify its operational meaning in quantum sensing.\"","target":"physical.quantum-sensing","type":"related"},{"source":"claim.frontier.arxiv-2607-23956","sources":[{"id":"source.frontier.arxiv-2607-23956","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23956&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23956 names Phase transitions: \"The dynamics are analyzed within the biorthogonal framework using the concept of dynamical quantum phase transitions (DQPTs).\"","target":"physical.phase-transitions","type":"related"},{"source":"claim.frontier.arxiv-2607-12128","sources":[{"id":"source.frontier.arxiv-2607-12128","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12128&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.12128 names Quantum computing: \"This paper investigates foundational quantum computing protocols from the intuitive perspective of categorical tensor-graph semantics within the category \\textbf{FHilb}.\"","target":"physical.quantum-computing","type":"related"},{"source":"claim.frontier.arxiv-2607-26084","sources":[{"id":"source.frontier.arxiv-2607-26084","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26084&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26084 names Big Bang nucleosynthesis: \"We consider three combinations of datasets: (i) late-time (LT) observations including PantheonPlus Type Ia supernovae, $H(z)$ measurements, and growth-rate measurements $fσ_8$; (ii) LT combined with DESI DR2 BAO and Big Bang nucleosynthesis (BBN); and (iii) LT combined with DESI DR2 BAO and CMB distance priors.\"","target":"physical.big-bang-nucleosynthesis","type":"related"},{"source":"claim.frontier.arxiv-2607-23859","sources":[{"id":"source.frontier.arxiv-2607-23859","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23859&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23859 names Isomorphism: \"We give a direct differential-geometric proof of a result of Crainic on the cohomology of pullbacks of Lie algebroids under surjective submersions: If the fibers are connected and have vanishing cohomology through degree $n$, pullback with coefficients in any representation is an isomorphism through degree $n$ and is injective in degree $n+1$.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-23814","sources":[{"id":"source.frontier.arxiv-2607-23814","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23814&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23814 names Differential equation: \"Tensor-train (TT) representations have emerged as an effective framework for mitigating the curse of dimensionality in the numerical solution of high-dimensional tensor differential equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-23798","sources":[{"id":"source.frontier.arxiv-2607-23798","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23798&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23798 names Modal logic: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-23596","sources":[{"id":"source.frontier.arxiv-2607-23596","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23596&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23596 names Euclidean space: \"As networks consist of vertices and edges that do not naturally reside in Euclidean space, the direct application of conventional statistical methodologies, such as the computation of means and covariances, principal component analysis, and hypothesis testing, to samples of networks is not straightforward.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-23430","sources":[{"id":"source.frontier.arxiv-2607-23430","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23430&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23430 names Axiom of choice: \"Along the way we obtain results particular to this algebraic setting: an embedding lacking an evident adjoint in de Paiva's general construction acquires a definable one here; a single Dialectica tensor validates contraction in the intuitionistic construction D yet refutes it in the classical variant G; and, over ZF, the poset reflection PD(Set) collapses onto the four-element algebra PD(2) exactly when the Axiom of Choice holds.\"","target":"concept.planetmath.axiomofchoice","type":"related"},{"source":"claim.frontier.arxiv-2607-23428","sources":[{"id":"source.frontier.arxiv-2607-23428","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23428&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23428 names Vector field: \"Let $h$ be the second fundamental form, let $\\mathbf{H}$ be the mean curvature vector field, and set $\\tilde h=h-\\mathbf{H}g$ and $\\tilde S=|\\tilde h|^2=|h|^2-2H^2$, where $H=|\\mathbf{H}|$ and $g$ is the induced Riemannian metric on the surface $M$.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-23236","sources":[{"id":"source.frontier.arxiv-2607-23236","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23236&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23236 names Federated Learning: \"Federated learning has achieved considerable success for predictive modelling, yet federated descriptive analytics remains largely unexplored.\"","target":"concept.mesh.d000098407","type":"related"},{"source":"claim.frontier.arxiv-2607-23212","sources":[{"id":"source.frontier.arxiv-2607-23212","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23212&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23212 names Bilinear form: \"The analysis is based on a cross-space Lipschitz condition for the nonlinear operator, which accommodates the nonsmooth, gradient-dependent nonlinearities of these flame-propagation models, and on continuity moduli quantifying the parameter dependence of the bilinear form and of the nonlinearity.\"","target":"concept.planetmath.bilinearform","type":"related"},{"source":"claim.frontier.arxiv-2607-23192","sources":[{"id":"source.frontier.arxiv-2607-23192","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23192&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.23192 names Differential equation: \"The proposed framework provides a natural generalization of Vector Diffusion Maps to differential forms of arbitrary degree and establishes a practical foundation for the numerical approximation of geometric partial differential equations directly from point cloud data.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22985","sources":[{"id":"source.frontier.arxiv-2607-22985","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22985&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22985 names Large Language Models: \"Conformalized selection has been widely applied to select high-quality candidates from large datasets with rigorous uncertainty quantification, such as reliable labeling, drug discovery, and the alignment of large language models.\"","target":"concept.mesh.d000098342","type":"related"},{"source":"claim.frontier.arxiv-2607-22958","sources":[{"id":"source.frontier.arxiv-2607-22958","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22958&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22958 names Linear functional: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","target":"concept.planetmath.linearfunctional","type":"related"},{"source":"claim.frontier.arxiv-2607-22920","sources":[{"id":"source.frontier.arxiv-2607-22920","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22920&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22920 names Limit point: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","target":"concept.planetmath.limitpoint","type":"related"},{"source":"claim.frontier.arxiv-2607-22892","sources":[{"id":"source.frontier.arxiv-2607-22892","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22892&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22892 names Convex function: \"Given a strongly convex function $u$, equip $R^d$ with a Riemannian metric given by the Hessian $\\nabla^2 u$.\"","target":"concept.planetmath.convexfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-22443","sources":[{"id":"source.frontier.arxiv-2607-22443","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22443&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22443 names Data Analysis: \"Data analysis agents are becoming increasingly common tools for applied and scientific research.\"","target":"concept.mesh.d000078332","type":"related"},{"source":"claim.frontier.arxiv-2607-22333","sources":[{"id":"source.frontier.arxiv-2607-22333","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22333&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22333 names Differential equation: \"Our main results are model-independent in the sense that no determinantal or Pfaffian structure, prescribed interaction potential, or explicit labelled stochastic differential equation is required.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22284","sources":[{"id":"source.frontier.arxiv-2607-22284","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22284&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22284 names Isomorphism: \"This paper is the first in a series devoted to the classification of automorphisms and isomorphisms of twisted Chevalley groups over commutative rings.\"","target":"concept.planetmath.isomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-22196","sources":[{"id":"source.frontier.arxiv-2607-22196","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22196&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22196 names Axiom of choice: \"We study finiteness classes arising from Ramsey-theoretic principles in set theory without the Axiom of Choice.\"","target":"concept.planetmath.axiomofchoice","type":"related"},{"source":"claim.frontier.arxiv-2607-22156","sources":[{"id":"source.frontier.arxiv-2607-22156","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22156&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22156 names Abelian group: \"Let $Λ$ be a finitely generated abelian group and $Γ=\\mathbb Z^{*d}$, we study the Cayley graph of the wreath product $G=Λ\\wrΓ$ with natural set of generators and their inverse $S$.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-22018","sources":[{"id":"source.frontier.arxiv-2607-22018","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22018&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22018 names Homeomorphism: \"As a consequence, we generate a new topology, termed rough topology, as well as rough homeomorphism.\"","target":"concept.planetmath.homeomorphism","type":"related"},{"source":"claim.frontier.arxiv-2607-21892","sources":[{"id":"source.frontier.arxiv-2607-21892","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21892&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21892 names Abelian group: \"The notion of the factorial extends to abelian groups under the group operation and any permutation of the elements of the group.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-16724","sources":[{"id":"source.frontier.arxiv-2607-16724","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16724&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.16724 names Multiplication operator: \"Fourier transfer gives exact Sobolev, Schatten-class, compactness, and trace-class thresholds for sandwiched Wick multiplication operators on $\\mathbb{T}^{D}$, together with sharp Fourier--Galerkin rates and approximation-number decay.\"","target":"concept.planetmath.multiplicationoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-06237","sources":[{"id":"source.frontier.arxiv-2607-06237","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.06237&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.06237 names Differential equation: \"Inverse problems governed by partial differential equations are difficult when observations are sparse and the unknown coefficient field contains both large- and small-scale structures.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-22751","sources":[{"id":"source.frontier.arxiv-2607-22751","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22751&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22751 names Differential operator: \"We study a family of symmetric orthogonal polynomials on the unit triangle associated with the weight \\[ w_{α,γ,κ}(x,y) = (xy)^α(1-x-y)^γ|x-y|^{2κ+1}, \\quad α,γ,κ>-1,\\quad α+κ>-\\frac32. \\] We construct the corresponding monic symmetric orthogonal basis on the simplex chamber and prove that its elements are eigenfunctions of a formally self-adjoint second-order differential operator \\(\\mathcal D_1^{α,γ,κ}\\).\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-21474","sources":[{"id":"source.frontier.arxiv-2607-21474","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21474&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21474 names Metric space: \"Fat minors are the metric analog of graph minors that are tailored to the analysis of metric (edge-weighted) graphs and, more generally, metric spaces having a suitable notion of shortest paths.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-21320","sources":[{"id":"source.frontier.arxiv-2607-21320","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21320&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21320 names Conditional logic: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","target":"concept.wikipedia.conditional-logic","type":"related"},{"source":"claim.frontier.arxiv-2607-21191","sources":[{"id":"source.frontier.arxiv-2607-21191","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21191&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21191 names Set theory: \"Event-B is a formal method rooted in predicate logic and set theory.\"","target":"concept.planetmath.settheory","type":"related"},{"source":"claim.frontier.arxiv-2607-21167","sources":[{"id":"source.frontier.arxiv-2607-21167","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21167&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21167 names Operator norm: \"Applying this result, we will show that the Frechet differentiability and the Gateaux differentiability of the norm of bounded linear operators on $\\ell_p$ spaces coincide, extending a known theorem regarding the operator norm on Hilbert spaces.\"","target":"concept.planetmath.operatornorm","type":"related"},{"source":"claim.frontier.arxiv-2607-21112","sources":[{"id":"source.frontier.arxiv-2607-21112","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21112&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.21112 names Differential equation: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","target":"concept.planetmath.differentialequation","type":"related"},{"source":"claim.frontier.arxiv-2607-20049","sources":[{"id":"source.frontier.arxiv-2607-20049","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20049&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20049 names Jacobian matrix: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","target":"concept.planetmath.jacobianmatrix","type":"related"},{"source":"claim.frontier.arxiv-2607-20677","sources":[{"id":"source.frontier.arxiv-2607-20677","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20677&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20677 names Metric space: \"We develop tools for the analysis and implementation of explicit first-order methods for minimizing functions in uniformly convex metric spaces.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-20407","sources":[{"id":"source.frontier.arxiv-2607-20407","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20407&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20407 names Abelian group: \"Consequently, for every uncountable discrete abelian group $G$, the nuclear algebra $C^*(G)$ has the local lifting property (LLP) but fails the LP.\"","target":"concept.planetmath.abeliangroup","type":"related"},{"source":"claim.frontier.arxiv-2607-20164","sources":[{"id":"source.frontier.arxiv-2607-20164","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20164&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20164 names Limit point: \"We also identify the full set of subsequential limit points at the LIL scale.\"","target":"concept.planetmath.limitpoint","type":"related"},{"source":"claim.frontier.arxiv-2607-20161","sources":[{"id":"source.frontier.arxiv-2607-20161","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20161&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20161 names Vector bundle: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","target":"concept.planetmath.vectorbundle","type":"related"},{"source":"claim.frontier.arxiv-2607-20098","sources":[{"id":"source.frontier.arxiv-2607-20098","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20098&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20098 names Distribution function: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-20063","sources":[{"id":"source.frontier.arxiv-2607-20063","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20063&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.20063 names Metric space: \"We then study monotone sequences with a uniform upper bound on the spatial diameter, obtaining uniform convergence of the null distances, as well as convergence of the associated timed metric spaces in the future developed Gromov-Hausdorff sense.\"","target":"concept.planetmath.metricspace","type":"related"},{"source":"claim.frontier.arxiv-2607-19946","sources":[{"id":"source.frontier.arxiv-2607-19946","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19946&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19946 names Euclidean space: \"In this note we construct colorings of Euclidean space $\\mathbb{R}^n$ with finitely many colors such that any two points at unit distance have different colors and, in addition, each color class is dense in $\\mathbb{R}^n$.\"","target":"concept.planetmath.euclideanspace","type":"related"},{"source":"claim.frontier.arxiv-2607-19654","sources":[{"id":"source.frontier.arxiv-2607-19654","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19654&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19654 names Homology: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","target":"concept.planetmath.homology","type":"related"},{"source":"claim.frontier.arxiv-2607-13855","sources":[{"id":"source.frontier.arxiv-2607-13855","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13855&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.13855 names Propositional logic: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","target":"concept.planetmath.propositionallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-19285","sources":[{"id":"source.frontier.arxiv-2607-19285","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19285&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19285 names Vector field: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-19272","sources":[{"id":"source.frontier.arxiv-2607-19272","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19272&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19272 names Differential operator: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-19233","sources":[{"id":"source.frontier.arxiv-2607-19233","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19233&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19233 names Vector field: \"The proof hinges on the study of vorticities defined in terms of a time-dependent foliation by almost parallel surfaces and of divergence-free vector fields tangent to these surfaces.\"","target":"concept.planetmath.vectorfield","type":"related"},{"source":"claim.frontier.arxiv-2607-19188","sources":[{"id":"source.frontier.arxiv-2607-19188","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19188&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19188 names Differential operator: \"In order to handle the mixed deterministic-stochastic structure of the equation and the degeneracy of the differential operator, we propose a semi-implicit Milstein finite difference scheme for the numerical solution.\"","target":"concept.planetmath.differentialoperator","type":"related"},{"source":"claim.frontier.arxiv-2607-19080","sources":[{"id":"source.frontier.arxiv-2607-19080","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19080&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.19080 names Distribution function: \"For fixed $z\\in\\operatorname{int}(Ω_μ)$, it remains bounded when $\\mathbf{F}_P(x_0)$ stays away from $z$, where $\\mathbf{F}_P=\\mathbf{Q}_P^{-1}$ is the transport-based distribution function, but diverges as $x_0\\to\\mathbf{Q}_P(z)$, equivalently as $\\mathbf{F}_P(x_0)\\to z$.\"","target":"concept.planetmath.distributionfunction","type":"related"},{"source":"claim.frontier.arxiv-2607-18942","sources":[{"id":"source.frontier.arxiv-2607-18942","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18942&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18942 names Linearly ordered: \"A tree is called bounded when each of its paths (i.e. maximal linearly ordered subsets) contains a greatest element.\"","target":"concept.planetmath.linearlyordered","type":"related"},{"source":"claim.frontier.arxiv-2607-18781","sources":[{"id":"source.frontier.arxiv-2607-18781","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18781&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.18781 names Directional derivative: \"This paper presents a comprehensive analysis of directional derivatives and error bounds for the merit function $θ(x)=\\sup_{a\\in A}\\bigl(-Δ_C(F(x)-F(a))\\bigr)$ associated with the vector optimization problem $\\operatorname{Min}_C\\{F(x):x\\in A\\}$, where $Δ_C$ is the oriented distance function.\"","target":"concept.planetmath.directionalderivative","type":"related"},{"source":"claim.frontier.arxiv-2607-15029","sources":[{"id":"source.frontier.arxiv-2607-15029","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15029&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15029 names Modal logic: \"Model checking is the automated verification of properties (specified in some modal logic) in labeled transition systems (LTSs); it is an essential tool in ensuring software systems function as intended.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.arxiv-2607-16747","sources":[{"id":"source.frontier.arxiv-2607-16747","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16747&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.16747 names Set theory: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","target":"concept.planetmath.settheory","type":"related"},{"source":"claim.frontier.arxiv-2607-15958","sources":[{"id":"source.frontier.arxiv-2607-15958","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15958&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15958 names Model theory: \"We extend the proof-theoretic treatment of uniform bound extraction from normed structures axiomatized in positive bounded logic [Advances in Mathematics, 290:503-551, 2016] (as developed for the model theory of Banach spaces) to the more general setting of abstract metric structures, including discrete structures viewed as classical first-order models.\"","target":"concept.planetmath.modeltheory","type":"related"},{"source":"claim.frontier.arxiv-2607-15664","sources":[{"id":"source.frontier.arxiv-2607-15664","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15664&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.15664 names Logical connective: \"This extension of the notion of interpreting logical connectives in a matrix allows for the correct determination of the truth of formulas in the language with conjunction and implication.\"","target":"concept.planetmath.logicalconnective","type":"related"},{"source":"claim.frontier.arxiv-2604-22459","sources":[{"id":"source.frontier.arxiv-2604-22459","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2604.22459&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2604.22459 names Modal logic: \"We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge.\"","target":"concept.planetmath.modallogic","type":"related"},{"source":"claim.frontier.doi-10-1111-ecot-70052","sources":[{"id":"source.frontier.doi-10-1111-ecot-70052","url":"https://api.crossref.org/works/10.1111/ecot.70052"}],"summary":"The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70333","sources":[{"id":"source.frontier.doi-10-1002-qj-70333","url":"https://api.crossref.org/works/10.1002/qj.70333"}],"summary":"The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pwat-0000557","sources":[{"id":"source.frontier.doi-10-1371-journal-pwat-0000557","url":"https://api.crossref.org/works/10.1371/journal.pwat.0000557"}],"summary":"The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"","target":"concept.usgs.30","type":"related"},{"source":"claim.frontier.doi-10-1111-medu-70340","sources":[{"id":"source.frontier.doi-10-1111-medu-70340","url":"https://api.crossref.org/works/10.1111/medu.70340"}],"summary":"The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"","target":"concept.mesh.d000091682","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124622","sources":[{"id":"source.frontier.doi-10-1029-2026gl124622","url":"https://api.crossref.org/works/10.1029/2026gl124622"}],"summary":"The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-15351-2373-8456-1235","sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1235","url":"https://api.crossref.org/works/10.15351/2373-8456.1235"}],"summary":"The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-15351-2373-8456-1216","sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1216","url":"https://api.crossref.org/works/10.15351/2373-8456.1216"}],"summary":"The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl125301","sources":[{"id":"source.frontier.doi-10-1029-2026gl125301","url":"https://api.crossref.org/works/10.1029/2026gl125301"}],"summary":"The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","target":"field.usgs.1678","type":"related"},{"source":"claim.frontier.doi-10-21425-fob-19-142560","sources":[{"id":"source.frontier.doi-10-21425-fob-19-142560","url":"https://api.crossref.org/works/10.21425/fob.19.142560"}],"summary":"The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001044","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001044","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001044"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"","target":"concept.usgs.1312","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000886","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000886","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000886"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1075-consl-25020-lia","sources":[{"id":"source.frontier.doi-10-1075-consl-25020-lia","url":"https://api.crossref.org/works/10.1075/consl.25020.lia"}],"summary":"The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"","target":"field.aat.300054256","type":"related"},{"source":"claim.frontier.doi-10-2166-hydro-2026-040","sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-040","url":"https://api.crossref.org/works/10.2166/hydro.2026.040"}],"summary":"The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-lol2-70186","sources":[{"id":"source.frontier.doi-10-1002-lol2-70186","url":"https://api.crossref.org/works/10.1002/lol2.70186"}],"summary":"The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124411","sources":[{"id":"source.frontier.doi-10-1029-2026gl124411","url":"https://api.crossref.org/works/10.1029/2026gl124411"}],"summary":"The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70629","sources":[{"id":"source.frontier.doi-10-1002-joc-70629","url":"https://api.crossref.org/works/10.1002/joc.70629"}],"summary":"The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9566-70277","sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70277","url":"https://api.crossref.org/works/10.1111/1467-9566.70277"}],"summary":"The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1002-jpln-70129","sources":[{"id":"source.frontier.doi-10-1002-jpln-70129","url":"https://api.crossref.org/works/10.1002/jpln.70129"}],"summary":"The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70613","sources":[{"id":"source.frontier.doi-10-1002-joc-70613","url":"https://api.crossref.org/works/10.1002/joc.70613"}],"summary":"The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70605","sources":[{"id":"source.frontier.doi-10-1002-joc-70605","url":"https://api.crossref.org/works/10.1002/joc.70605"}],"summary":"The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-3176-arch-2026-2-03","sources":[{"id":"source.frontier.doi-10-3176-arch-2026-2-03","url":"https://api.crossref.org/works/10.3176/arch.2026.2.03"}],"summary":"The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","target":"concept.aat.300019278","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-580","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-580","url":"https://api.crossref.org/works/10.2166/wcc.2026.580"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"","target":"concept.usgs.27","type":"related"},{"source":"claim.frontier.doi-10-1002-ijop-70275","sources":[{"id":"source.frontier.doi-10-1002-ijop-70275","url":"https://api.crossref.org/works/10.1002/ijop.70275"}],"summary":"The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"","target":"field.mesh.d011593","type":"related"},{"source":"claim.frontier.doi-10-3897-popecon-10-e186220","sources":[{"id":"source.frontier.doi-10-3897-popecon-10-e186220","url":"https://api.crossref.org/works/10.3897/popecon.10.e186220"}],"summary":"The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-507","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-507","url":"https://api.crossref.org/works/10.2166/wcc.2026.507"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","target":"concept.usgs.27","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e183393","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e183393","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e183393"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"","target":"concept.mesh.d017149","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026785","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026785","url":"https://api.crossref.org/works/10.38159/ehass.2026785"}],"summary":"The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"","target":"field.aat.300054240","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124090","sources":[{"id":"source.frontier.doi-10-1029-2026gl124090","url":"https://api.crossref.org/works/10.1029/2026gl124090"}],"summary":"The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-pei3-70207","sources":[{"id":"source.frontier.doi-10-1002-pei3-70207","url":"https://api.crossref.org/works/10.1002/pei3.70207"}],"summary":"The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-fea2-70077","sources":[{"id":"source.frontier.doi-10-1002-fea2-70077","url":"https://api.crossref.org/works/10.1002/fea2.70077"}],"summary":"The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"","target":"field.anthropology","type":"related"},{"source":"claim.frontier.doi-10-1002-eet-70146","sources":[{"id":"source.frontier.doi-10-1002-eet-70146","url":"https://api.crossref.org/works/10.1002/eet.70146"}],"summary":"The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-eco-70279","sources":[{"id":"source.frontier.doi-10-1002-eco-70279","url":"https://api.crossref.org/works/10.1002/eco.70279"}],"summary":"The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"","target":"ology.hydrology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124233","sources":[{"id":"source.frontier.doi-10-1029-2026gl124233","url":"https://api.crossref.org/works/10.1029/2026gl124233"}],"summary":"The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gc013127","sources":[{"id":"source.frontier.doi-10-1029-2026gc013127","url":"https://api.crossref.org/works/10.1029/2026gc013127"}],"summary":"The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"","target":"concept.usgs.727","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70320","sources":[{"id":"source.frontier.doi-10-1002-qj-70320","url":"https://api.crossref.org/works/10.1002/qj.70320"}],"summary":"The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","sources":[{"id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","url":"https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"}],"summary":"The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-38159-erats-20261281","sources":[{"id":"source.frontier.doi-10-38159-erats-20261281","url":"https://api.crossref.org/works/10.38159/erats.20261281"}],"summary":"The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"","target":"concept.aat.300060368","type":"related"},{"source":"claim.frontier.doi-10-1002-eco-70277","sources":[{"id":"source.frontier.doi-10-1002-eco-70277","url":"https://api.crossref.org/works/10.1002/eco.70277"}],"summary":"The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1002-iroh-70046","sources":[{"id":"source.frontier.doi-10-1002-iroh-70046","url":"https://api.crossref.org/works/10.1002/iroh.70046"}],"summary":"The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-38159-erats-20261284","sources":[{"id":"source.frontier.doi-10-38159-erats-20261284","url":"https://api.crossref.org/works/10.38159/erats.20261284"}],"summary":"The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","target":"concept.aat.300069306","type":"related"},{"source":"claim.frontier.doi-10-1111-ruso-70070","sources":[{"id":"source.frontier.doi-10-1111-ruso-70070","url":"https://api.crossref.org/works/10.1111/ruso.70070"}],"summary":"The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-200681","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-200681","url":"https://api.crossref.org/works/10.3897/nhcm.3.200681"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001005","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001005","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001005"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-moth-70148","sources":[{"id":"source.frontier.doi-10-1111-moth-70148","url":"https://api.crossref.org/works/10.1111/moth.70148"}],"summary":"The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","target":"field.mesh.d008678","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-20267724","sources":[{"id":"source.frontier.doi-10-38159-ehass-20267724","url":"https://api.crossref.org/works/10.38159/ehass.20267724"}],"summary":"The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"","target":"field.aat.300054288","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124881","sources":[{"id":"source.frontier.doi-10-1029-2026gl124881","url":"https://api.crossref.org/works/10.1029/2026gl124881"}],"summary":"The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jh001578","sources":[{"id":"source.frontier.doi-10-1029-2026jh001578","url":"https://api.crossref.org/works/10.1029/2026jh001578"}],"summary":"The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","target":"ology.seismology","type":"related"},{"source":"claim.frontier.doi-10-1002-gdj3-70104","sources":[{"id":"source.frontier.doi-10-1002-gdj3-70104","url":"https://api.crossref.org/works/10.1002/gdj3.70104"}],"summary":"The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"","target":"ology.meteorology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122610","sources":[{"id":"source.frontier.doi-10-1029-2026gl122610","url":"https://api.crossref.org/works/10.1029/2026gl122610"}],"summary":"The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70308","sources":[{"id":"source.frontier.doi-10-1002-qj-70308","url":"https://api.crossref.org/works/10.1002/qj.70308"}],"summary":"The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-55730-1300-0632-4281","sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4281","url":"https://api.crossref.org/works/10.55730/1300-0632.4281"}],"summary":"The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-55730-1300-0632-4275","sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4275","url":"https://api.crossref.org/works/10.55730/1300-0632.4275"}],"summary":"The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-1002-eet-70139","sources":[{"id":"source.frontier.doi-10-1002-eet-70139","url":"https://api.crossref.org/works/10.1002/eet.70139"}],"summary":"The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-jclp-70212","sources":[{"id":"source.frontier.doi-10-1002-jclp-70212","url":"https://api.crossref.org/works/10.1002/jclp.70212"}],"summary":"The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"","target":"ology.psychopathology","type":"related"},{"source":"claim.frontier.doi-10-12944-cwe-21-2-3","sources":[{"id":"source.frontier.doi-10-12944-cwe-21-2-3","url":"https://api.crossref.org/works/10.12944/cwe.21.2.3"}],"summary":"The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1002-bse-71470","sources":[{"id":"source.frontier.doi-10-1002-bse-71470","url":"https://api.crossref.org/works/10.1002/bse.71470"}],"summary":"The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000986","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000986","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000986"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-1752-1688-70151","sources":[{"id":"source.frontier.doi-10-1111-1752-1688-70151","url":"https://api.crossref.org/works/10.1111/1752-1688.70151"}],"summary":"The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-jade-70048","sources":[{"id":"source.frontier.doi-10-1111-jade-70048","url":"https://api.crossref.org/works/10.1111/jade.70048"}],"summary":"The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"","target":"concept.aat.300054181","type":"related"},{"source":"claim.frontier.doi-10-1111-lcrp-70059","sources":[{"id":"source.frontier.doi-10-1111-lcrp-70059","url":"https://api.crossref.org/works/10.1111/lcrp.70059"}],"summary":"The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"","target":"concept.mesh.d000075665","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-77938","sources":[{"id":"source.frontier.doi-10-1002-adfm-77938","url":"https://api.crossref.org/works/10.1002/adfm.77938"}],"summary":"The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"","target":"field.mesh.d000076227","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e185197","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e185197","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e185197"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"","target":"concept.mesh.d000070586","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl125327","sources":[{"id":"source.frontier.doi-10-1029-2026gl125327","url":"https://api.crossref.org/works/10.1029/2026gl125327"}],"summary":"The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"","target":"concept.usgs.1298","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70302","sources":[{"id":"source.frontier.doi-10-1002-qj-70302","url":"https://api.crossref.org/works/10.1002/qj.70302"}],"summary":"The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000930","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000930","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000930"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1098-rsnr-2026-0030","sources":[{"id":"source.frontier.doi-10-1098-rsnr-2026-0030","url":"https://api.crossref.org/works/10.1098/rsnr.2026.0030"}],"summary":"The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"","target":"concept.aat.300016617","type":"related"},{"source":"claim.frontier.doi-10-1002-cli2-70062","sources":[{"id":"source.frontier.doi-10-1002-cli2-70062","url":"https://api.crossref.org/works/10.1002/cli2.70062"}],"summary":"The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","sources":[{"id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","url":"https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"}],"summary":"The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70852","sources":[{"id":"source.frontier.doi-10-1111-ejed-70852","url":"https://api.crossref.org/works/10.1111/ejed.70852"}],"summary":"The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","target":"concept.mesh.d000097815","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70845","sources":[{"id":"source.frontier.doi-10-1111-ejed-70845","url":"https://api.crossref.org/works/10.1111/ejed.70845"}],"summary":"The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"","target":"concept.mesh.d000223","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0001039","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001039","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001039"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-nup-70114","sources":[{"id":"source.frontier.doi-10-1111-nup-70114","url":"https://api.crossref.org/works/10.1111/nup.70114"}],"summary":"The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"","target":"field.aat.300054297","type":"related"},{"source":"claim.frontier.doi-10-1111-ejss-70414","sources":[{"id":"source.frontier.doi-10-1111-ejss-70414","url":"https://api.crossref.org/works/10.1111/ejss.70414"}],"summary":"The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","target":"concept.usgs.1731","type":"related"},{"source":"claim.frontier.doi-10-1029-2026wr044293","sources":[{"id":"source.frontier.doi-10-1029-2026wr044293","url":"https://api.crossref.org/works/10.1029/2026wr044293"}],"summary":"The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp-70399","sources":[{"id":"source.frontier.doi-10-1002-esp-70399","url":"https://api.crossref.org/works/10.1002/esp.70399"}],"summary":"The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-jqs-70108","sources":[{"id":"source.frontier.doi-10-1002-jqs-70108","url":"https://api.crossref.org/works/10.1002/jqs.70108"}],"summary":"The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"","target":"ology.sedimentology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jd046723","sources":[{"id":"source.frontier.doi-10-1029-2026jd046723","url":"https://api.crossref.org/works/10.1029/2026jd046723"}],"summary":"The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-msd2-70089","sources":[{"id":"source.frontier.doi-10-1002-msd2-70089","url":"https://api.crossref.org/works/10.1002/msd2.70089"}],"summary":"The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"","target":"concept.eia.electric-energy","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70342","sources":[{"id":"source.frontier.doi-10-1111-ijal-70342","url":"https://api.crossref.org/works/10.1111/ijal.70342"}],"summary":"The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"","target":"field.aat.300054263","type":"related"},{"source":"claim.frontier.doi-10-1002-cli2-70059","sources":[{"id":"source.frontier.doi-10-1002-cli2-70059","url":"https://api.crossref.org/works/10.1002/cli2.70059"}],"summary":"The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124727","sources":[{"id":"source.frontier.doi-10-1029-2026gl124727","url":"https://api.crossref.org/works/10.1029/2026gl124727"}],"summary":"The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000877","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000877","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000877"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1111-jmg-70054","sources":[{"id":"source.frontier.doi-10-1111-jmg-70054","url":"https://api.crossref.org/works/10.1111/jmg.70054"}],"summary":"The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"","target":"concept.usgs.1145","type":"related"},{"source":"claim.frontier.doi-10-1111-moth-70134","sources":[{"id":"source.frontier.doi-10-1111-moth-70134","url":"https://api.crossref.org/works/10.1111/moth.70134"}],"summary":"The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"","target":"concept.mesh.d006808","type":"related"},{"source":"claim.frontier.doi-10-1111-gwat-70098","sources":[{"id":"source.frontier.doi-10-1111-gwat-70098","url":"https://api.crossref.org/works/10.1111/gwat.70098"}],"summary":"The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-2166-wp-2026-018","sources":[{"id":"source.frontier.doi-10-2166-wp-2026-018","url":"https://api.crossref.org/works/10.2166/wp.2026.018"}],"summary":"The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1098-rsta-2025-0107","sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0107","url":"https://api.crossref.org/works/10.1098/rsta.2025.0107"}],"summary":"The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","target":"field.aat.300389758","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000931","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000931","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000931"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"","target":"concept.usgs.168","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122646","sources":[{"id":"source.frontier.doi-10-1029-2026gl122646","url":"https://api.crossref.org/works/10.1029/2026gl122646"}],"summary":"The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70058","sources":[{"id":"source.frontier.doi-10-1002-ppp-70058","url":"https://api.crossref.org/works/10.1002/ppp.70058"}],"summary":"The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1002-jpln-70107","sources":[{"id":"source.frontier.doi-10-1002-jpln-70107","url":"https://api.crossref.org/works/10.1002/jpln.70107"}],"summary":"The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"","target":"ology.mineralogy","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-187529","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-187529","url":"https://api.crossref.org/works/10.3897/nhcm.3.187529"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026775","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026775","url":"https://api.crossref.org/works/10.38159/ehass.2026775"}],"summary":"The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"","target":"field.aat.300054255","type":"related"},{"source":"claim.frontier.doi-10-38159-ehass-2026774","sources":[{"id":"source.frontier.doi-10-38159-ehass-2026774","url":"https://api.crossref.org/works/10.38159/ehass.2026774"}],"summary":"The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"","target":"concept.aat.300262706","type":"related"},{"source":"claim.frontier.doi-10-1002-hec-70140","sources":[{"id":"source.frontier.doi-10-1002-hec-70140","url":"https://api.crossref.org/works/10.1002/hec.70140"}],"summary":"The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"","target":"concept.mesh.d006304","type":"related"},{"source":"claim.frontier.doi-10-1002-tox-70177","sources":[{"id":"source.frontier.doi-10-1002-tox-70177","url":"https://api.crossref.org/works/10.1002/tox.70177"}],"summary":"The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","target":"concept.usgs.435","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-77585","sources":[{"id":"source.frontier.doi-10-1002-adfm-77585","url":"https://api.crossref.org/works/10.1002/adfm.77585"}],"summary":"The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"","target":"field.mesh.d044085","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9566-70245","sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70245","url":"https://api.crossref.org/works/10.1111/1467-9566.70245"}],"summary":"The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70337","sources":[{"id":"source.frontier.doi-10-1111-ijal-70337","url":"https://api.crossref.org/works/10.1111/ijal.70337"}],"summary":"The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"","target":"field.aat.300054255","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl123821","sources":[{"id":"source.frontier.doi-10-1029-2026gl123821","url":"https://api.crossref.org/works/10.1029/2026gl123821"}],"summary":"The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"","target":"concept.usgs.2028","type":"related"},{"source":"claim.frontier.doi-10-1002-qj-70252","sources":[{"id":"source.frontier.doi-10-1002-qj-70252","url":"https://api.crossref.org/works/10.1002/qj.70252"}],"summary":"The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70540","sources":[{"id":"source.frontier.doi-10-1002-joc-70540","url":"https://api.crossref.org/works/10.1002/joc.70540"}],"summary":"The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-1111-eje-70266","sources":[{"id":"source.frontier.doi-10-1111-eje-70266","url":"https://api.crossref.org/works/10.1111/eje.70266"}],"summary":"The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1111-ecpo-70064","sources":[{"id":"source.frontier.doi-10-1111-ecpo-70064","url":"https://api.crossref.org/works/10.1111/ecpo.70064"}],"summary":"The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1111-beer-70139","sources":[{"id":"source.frontier.doi-10-1111-beer-70139","url":"https://api.crossref.org/works/10.1111/beer.70139"}],"summary":"The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"","target":"concept.mesh.d012941","type":"related"},{"source":"claim.frontier.doi-10-1098-rsta-2025-0029","sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0029","url":"https://api.crossref.org/works/10.1098/rsta.2025.0029"}],"summary":"The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"","target":"field.aat.300054297","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124661","sources":[{"id":"source.frontier.doi-10-1029-2026gl124661","url":"https://api.crossref.org/works/10.1029/2026gl124661"}],"summary":"The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jc023581","sources":[{"id":"source.frontier.doi-10-1029-2025jc023581","url":"https://api.crossref.org/works/10.1029/2025jc023581"}],"summary":"The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jb032632","sources":[{"id":"source.frontier.doi-10-1029-2025jb032632","url":"https://api.crossref.org/works/10.1029/2025jb032632"}],"summary":"The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","target":"field.navigation","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70526","sources":[{"id":"source.frontier.doi-10-1002-joc-70526","url":"https://api.crossref.org/works/10.1002/joc.70526"}],"summary":"The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1111-saje-70032","sources":[{"id":"source.frontier.doi-10-1111-saje-70032","url":"https://api.crossref.org/works/10.1111/saje.70032"}],"summary":"The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl124111","sources":[{"id":"source.frontier.doi-10-1029-2026gl124111","url":"https://api.crossref.org/works/10.1029/2026gl124111"}],"summary":"The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"","target":"concept.usgs.819","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70772","sources":[{"id":"source.frontier.doi-10-1111-ejed-70772","url":"https://api.crossref.org/works/10.1111/ejed.70772"}],"summary":"The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"","target":"concept.mesh.d000097822","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122539","sources":[{"id":"source.frontier.doi-10-1029-2026gl122539","url":"https://api.crossref.org/works/10.1029/2026gl122539"}],"summary":"The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70310","sources":[{"id":"source.frontier.doi-10-1111-ijal-70310","url":"https://api.crossref.org/works/10.1111/ijal.70310"}],"summary":"The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"","target":"field.aat.300054264","type":"related"},{"source":"claim.frontier.doi-10-1002-adfm-76901","sources":[{"id":"source.frontier.doi-10-1002-adfm-76901","url":"https://api.crossref.org/works/10.1002/adfm.76901"}],"summary":"The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"","target":"concept.mesh.d001698","type":"related"},{"source":"claim.frontier.doi-10-1002-nzm2-70056","sources":[{"id":"source.frontier.doi-10-1002-nzm2-70056","url":"https://api.crossref.org/works/10.1002/nzm2.70056"}],"summary":"The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","target":"concept.usgs.1731","type":"related"},{"source":"claim.frontier.doi-10-1144-jgs2026-026","sources":[{"id":"source.frontier.doi-10-1144-jgs2026-026","url":"https://api.crossref.org/works/10.1144/jgs2026-026"}],"summary":"The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1111-ejed-70766","sources":[{"id":"source.frontier.doi-10-1111-ejed-70766","url":"https://api.crossref.org/works/10.1111/ejed.70766"}],"summary":"The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1002-sce-70090","sources":[{"id":"source.frontier.doi-10-1002-sce-70090","url":"https://api.crossref.org/works/10.1002/sce.70090"}],"summary":"The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"","target":"concept.mesh.d000080562","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70053","sources":[{"id":"source.frontier.doi-10-1002-ppp-70053","url":"https://api.crossref.org/works/10.1002/ppp.70053"}],"summary":"The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1002-ese3-70603","sources":[{"id":"source.frontier.doi-10-1002-ese3-70603","url":"https://api.crossref.org/works/10.1002/ese3.70603"}],"summary":"The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"","target":"concept.eia.coal-mine","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd046190","sources":[{"id":"source.frontier.doi-10-1029-2025jd046190","url":"https://api.crossref.org/works/10.1029/2025jd046190"}],"summary":"The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"","target":"concept.usgs.65","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121323","sources":[{"id":"source.frontier.doi-10-1029-2025gl121323","url":"https://api.crossref.org/works/10.1029/2025gl121323"}],"summary":"The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"","target":"concept.usgs.93","type":"related"},{"source":"claim.frontier.doi-10-1002-ijfe-70259","sources":[{"id":"source.frontier.doi-10-1002-ijfe-70259","url":"https://api.crossref.org/works/10.1002/ijfe.70259"}],"summary":"The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"","target":"concept.mesh.d057217","type":"related"},{"source":"claim.frontier.doi-10-1371-journal-pclm-0000696","sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000696","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000696"}],"summary":"The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1111-aphw-70185","sources":[{"id":"source.frontier.doi-10-1111-aphw-70185","url":"https://api.crossref.org/works/10.1111/aphw.70185"}],"summary":"The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"","target":"concept.mesh.d000091682","type":"related"},{"source":"claim.frontier.doi-10-1029-2026jh001250","sources":[{"id":"source.frontier.doi-10-1029-2026jh001250","url":"https://api.crossref.org/works/10.1029/2026jh001250"}],"summary":"The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122518","sources":[{"id":"source.frontier.doi-10-1029-2026gl122518","url":"https://api.crossref.org/works/10.1029/2026gl122518"}],"summary":"The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e172739","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e172739","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e172739"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-1111-jmg-70045","sources":[{"id":"source.frontier.doi-10-1111-jmg-70045","url":"https://api.crossref.org/works/10.1111/jmg.70045"}],"summary":"The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"","target":"ology.geochronology","type":"related"},{"source":"claim.frontier.doi-10-1002-ppp-70049","sources":[{"id":"source.frontier.doi-10-1002-ppp-70049","url":"https://api.crossref.org/works/10.1002/ppp.70049"}],"summary":"The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"","target":"concept.usgs.1199","type":"related"},{"source":"claim.frontier.doi-10-3897-brics-econ-7-e162074","sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e162074","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e162074"}],"summary":"The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.doi-10-1111-ijal-70289","sources":[{"id":"source.frontier.doi-10-1111-ijal-70289","url":"https://api.crossref.org/works/10.1111/ijal.70289"}],"summary":"The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"","target":"concept.aat.300262706","type":"related"},{"source":"claim.frontier.doi-10-2166-wpt-2026-383","sources":[{"id":"source.frontier.doi-10-2166-wpt-2026-383","url":"https://api.crossref.org/works/10.2166/wpt.2026.383"}],"summary":"The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-359","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-359","url":"https://api.crossref.org/works/10.2166/wcc.2026.359"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"","target":"ology.hydrology","type":"related"},{"source":"claim.frontier.doi-10-66630-sc-2026-0009","sources":[{"id":"source.frontier.doi-10-66630-sc-2026-0009","url":"https://api.crossref.org/works/10.66630/sc.2026.0009"}],"summary":"The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-59588-2961-3094-1247","sources":[{"id":"source.frontier.doi-10-59588-2961-3094-1247","url":"https://api.crossref.org/works/10.59588/2961-3094.1247"}],"summary":"The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"","target":"field.aat.300054245","type":"related"},{"source":"claim.frontier.doi-10-28918-jei-v11i1-2606","sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2606","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2606"}],"summary":"The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"","target":"field.aat.300054254","type":"related"},{"source":"claim.frontier.doi-10-28918-jei-v11i1-2601","sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2601","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2601"}],"summary":"The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"","target":"concept.mesh.d012941","type":"related"},{"source":"claim.frontier.doi-10-1029-2025wr041875","sources":[{"id":"source.frontier.doi-10-1029-2025wr041875","url":"https://api.crossref.org/works/10.1029/2025wr041875"}],"summary":"The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-2166-wcc-2026-006","sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-006","url":"https://api.crossref.org/works/10.2166/wcc.2026.006"}],"summary":"The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jb033060","sources":[{"id":"source.frontier.doi-10-1029-2025jb033060","url":"https://api.crossref.org/works/10.1029/2025jb033060"}],"summary":"The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","target":"field.usgs.1176","type":"related"},{"source":"claim.frontier.doi-10-1029-2025ea004610","sources":[{"id":"source.frontier.doi-10-1029-2025ea004610","url":"https://api.crossref.org/works/10.1029/2025ea004610"}],"summary":"The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"","target":"field.usgs.68","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122157","sources":[{"id":"source.frontier.doi-10-1029-2026gl122157","url":"https://api.crossref.org/works/10.1029/2026gl122157"}],"summary":"The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp4-70096","sources":[{"id":"source.frontier.doi-10-1002-esp4-70096","url":"https://api.crossref.org/works/10.1002/esp4.70096"}],"summary":"The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"","target":"field.navigation","type":"related"},{"source":"claim.frontier.doi-10-1111-bioe-70124","sources":[{"id":"source.frontier.doi-10-1111-bioe-70124","url":"https://api.crossref.org/works/10.1111/bioe.70124"}],"summary":"The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"","target":"field.mesh.d026690","type":"related"},{"source":"claim.frontier.doi-10-1002-adom-71396","sources":[{"id":"source.frontier.doi-10-1002-adom-71396","url":"https://api.crossref.org/works/10.1002/adom.71396"}],"summary":"The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","target":"field.mesh.d044085","type":"related"},{"source":"claim.frontier.doi-10-1002-ese3-70586","sources":[{"id":"source.frontier.doi-10-1002-ese3-70586","url":"https://api.crossref.org/works/10.1002/ese3.70586"}],"summary":"The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"","target":"concept.eia.air-collector","type":"related"},{"source":"claim.frontier.doi-10-1144-jgs2026-039","sources":[{"id":"source.frontier.doi-10-1144-jgs2026-039","url":"https://api.crossref.org/works/10.1144/jgs2026-039"}],"summary":"The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","target":"ology.stratigraphy","type":"related"},{"source":"claim.frontier.doi-10-1002-hec-70120","sources":[{"id":"source.frontier.doi-10-1002-hec-70120","url":"https://api.crossref.org/works/10.1002/hec.70120"}],"summary":"The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"","target":"concept.mesh.d057185","type":"related"},{"source":"claim.frontier.doi-10-1111-1467-9477-70049","sources":[{"id":"source.frontier.doi-10-1111-1467-9477-70049","url":"https://api.crossref.org/works/10.1111/1467-9477.70049"}],"summary":"The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.doi-10-1111-faam-70045","sources":[{"id":"source.frontier.doi-10-1111-faam-70045","url":"https://api.crossref.org/works/10.1111/faam.70045"}],"summary":"The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"","target":"concept.mesh.d003906","type":"related"},{"source":"claim.frontier.doi-10-58491-2735-4202-3413","sources":[{"id":"source.frontier.doi-10-58491-2735-4202-3413","url":"https://api.crossref.org/works/10.58491/2735-4202.3413"}],"summary":"The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"","target":"concept.eia.leading-edge","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121378","sources":[{"id":"source.frontier.doi-10-1029-2025gl121378","url":"https://api.crossref.org/works/10.1029/2025gl121378"}],"summary":"The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-56403-nejesh-v5i2-421","sources":[{"id":"source.frontier.doi-10-56403-nejesh-v5i2-421","url":"https://api.crossref.org/works/10.56403/nejesh.v5i2.421"}],"summary":"The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","target":"field.aat.300054280","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl123355","sources":[{"id":"source.frontier.doi-10-1029-2026gl123355","url":"https://api.crossref.org/works/10.1029/2026gl123355"}],"summary":"The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"","target":"concept.usgs.677","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gl121171","sources":[{"id":"source.frontier.doi-10-1029-2025gl121171","url":"https://api.crossref.org/works/10.1029/2025gl121171"}],"summary":"The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"","target":"concept.usgs.2277","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd044617","sources":[{"id":"source.frontier.doi-10-1029-2025jd044617","url":"https://api.crossref.org/works/10.1029/2025jd044617"}],"summary":"The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","sources":[{"id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","url":"https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"}],"summary":"The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"","target":"field.mesh.d049691","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd045718","sources":[{"id":"source.frontier.doi-10-1029-2025jd045718","url":"https://api.crossref.org/works/10.1029/2025jd045718"}],"summary":"The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"","target":"field.climatology","type":"related"},{"source":"claim.frontier.doi-10-1029-2026gl122664","sources":[{"id":"source.frontier.doi-10-1029-2026gl122664","url":"https://api.crossref.org/works/10.1029/2026gl122664"}],"summary":"The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"","target":"field.usgs.1678","type":"related"},{"source":"claim.frontier.doi-10-1111-ojoa-70022","sources":[{"id":"source.frontier.doi-10-1111-ojoa-70022","url":"https://api.crossref.org/works/10.1111/ojoa.70022"}],"summary":"The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"","target":"concept.aat.300016586","type":"related"},{"source":"claim.frontier.doi-10-1029-2025jd045965","sources":[{"id":"source.frontier.doi-10-1029-2025jd045965","url":"https://api.crossref.org/works/10.1029/2025jd045965"}],"summary":"The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"","target":"concept.usgs.64","type":"related"},{"source":"claim.frontier.doi-10-1111-jssr-70066","sources":[{"id":"source.frontier.doi-10-1111-jssr-70066","url":"https://api.crossref.org/works/10.1111/jssr.70066"}],"summary":"The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"","target":"concept.mesh.d033303","type":"related"},{"source":"claim.frontier.doi-10-1029-2025wr042846","sources":[{"id":"source.frontier.doi-10-1029-2025wr042846","url":"https://api.crossref.org/works/10.1029/2025wr042846"}],"summary":"The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"","target":"concept.usgs.1298","type":"related"},{"source":"claim.frontier.doi-10-3897-jbgs-e185535","sources":[{"id":"source.frontier.doi-10-3897-jbgs-e185535","url":"https://api.crossref.org/works/10.3897/jbgs.e185535"}],"summary":"The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"","target":"concept.usgs.1034","type":"related"},{"source":"claim.frontier.doi-10-1002-esp4-70082","sources":[{"id":"source.frontier.doi-10-1002-esp4-70082","url":"https://api.crossref.org/works/10.1002/esp4.70082"}],"summary":"The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"","target":"ology.stratigraphy","type":"related"},{"source":"claim.frontier.doi-10-3897-nhcm-3-184711","sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-184711","url":"https://api.crossref.org/works/10.3897/nhcm.3.184711"}],"summary":"The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"","target":"field.mesh.d019021","type":"related"},{"source":"claim.frontier.doi-10-1029-2025gc012776","sources":[{"id":"source.frontier.doi-10-1029-2025gc012776","url":"https://api.crossref.org/works/10.1029/2025gc012776"}],"summary":"The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"","target":"concept.usgs.562","type":"related"},{"source":"claim.frontier.doi-10-1002-joc-70436","sources":[{"id":"source.frontier.doi-10-1002-joc-70436","url":"https://api.crossref.org/works/10.1002/joc.70436"}],"summary":"The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"","target":"concept.usgs.1308","type":"related"},{"source":"claim.frontier.doi-10-2166-hydro-2026-191","sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-191","url":"https://api.crossref.org/works/10.2166/hydro.2026.191"}],"summary":"The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"","target":"concept.usgs.2027","type":"related"},{"source":"claim.frontier.doi-10-1111-ojoa-70020","sources":[{"id":"source.frontier.doi-10-1111-ojoa-70020","url":"https://api.crossref.org/works/10.1111/ojoa.70020"}],"summary":"The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"","target":"concept.aat.300019275","type":"related"},{"source":"claim.frontier.doi-10-1111-phpr-70116","sources":[{"id":"source.frontier.doi-10-1111-phpr-70116","url":"https://api.crossref.org/works/10.1111/phpr.70116"}],"summary":"The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"","target":"field.aat.300054245","type":"related"},{"source":"claim.frontier.arxiv-2610-21653","sources":[{"id":"source.frontier.arxiv-2610-21653","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"","target":"concept.nist.performance","type":"related"},{"source":"claim.frontier.arxiv-2610-19722","sources":[{"id":"source.frontier.arxiv-2610-19722","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"","target":"concept.nist.linearprobng","type":"related"},{"source":"claim.frontier.arxiv-2610-19515","sources":[{"id":"source.frontier.arxiv-2610-19515","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2610-19137","sources":[{"id":"source.frontier.arxiv-2610-19137","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"","target":"concept.eia.carbon-intensity","type":"related"},{"source":"claim.frontier.arxiv-2610-17295","sources":[{"id":"source.frontier.arxiv-2610-17295","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"","target":"method.nist.dynamicprog","type":"related"},{"source":"claim.frontier.arxiv-2610-16273","sources":[{"id":"source.frontier.arxiv-2610-16273","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2610-16259","sources":[{"id":"source.frontier.arxiv-2610-16259","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"","target":"field.information-theory","type":"related"},{"source":"claim.frontier.arxiv-2610-15072","sources":[{"id":"source.frontier.arxiv-2610-15072","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2610-15052","sources":[{"id":"source.frontier.arxiv-2610-15052","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"","target":"method.nist.simulatedannealing","type":"related"},{"source":"claim.frontier.arxiv-2610-13424","sources":[{"id":"source.frontier.arxiv-2610-13424","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"","target":"concept.nist.optimalsoltn","type":"related"},{"source":"claim.frontier.arxiv-2610-13402","sources":[{"id":"source.frontier.arxiv-2610-13402","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"","target":"field.information-theory","type":"related"},{"source":"claim.frontier.arxiv-2610-12779","sources":[{"id":"source.frontier.arxiv-2610-12779","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"","target":"concept.nist.stronglyconnectedcompo","type":"related"},{"source":"claim.frontier.arxiv-2610-12604","sources":[{"id":"source.frontier.arxiv-2610-12604","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2610-12592","sources":[{"id":"source.frontier.arxiv-2610-12592","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2610-12038","sources":[{"id":"source.frontier.arxiv-2610-12038","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"","target":"concept.nist.binarytree","type":"related"},{"source":"claim.frontier.arxiv-2610-11869","sources":[{"id":"source.frontier.arxiv-2610-11869","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"","target":"concept.nist.objective","type":"related"},{"source":"claim.frontier.arxiv-2610-11359","sources":[{"id":"source.frontier.arxiv-2610-11359","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2610-04959","sources":[{"id":"source.frontier.arxiv-2610-04959","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"","target":"concept.nist.flownetwork","type":"related"},{"source":"claim.frontier.arxiv-2610-09266","sources":[{"id":"source.frontier.arxiv-2610-09266","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"","target":"concept.nist.optimalsoltn","type":"related"},{"source":"claim.frontier.arxiv-2610-09080","sources":[{"id":"source.frontier.arxiv-2610-09080","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"","target":"method.nist.exhaustivesearch","type":"related"},{"source":"claim.frontier.arxiv-2610-09010","sources":[{"id":"source.frontier.arxiv-2610-09010","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2610-08744","sources":[{"id":"source.frontier.arxiv-2610-08744","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"","target":"method.nist.exhaustivesearch","type":"related"},{"source":"claim.frontier.arxiv-2610-07616","sources":[{"id":"source.frontier.arxiv-2610-07616","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"","target":"method.nist.randomsearch","type":"related"},{"source":"claim.frontier.arxiv-2610-07307","sources":[{"id":"source.frontier.arxiv-2610-07307","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"","target":"concept.nist.prisonersdilemma","type":"related"},{"source":"claim.frontier.arxiv-2610-06601","sources":[{"id":"source.frontier.arxiv-2610-06601","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"","target":"method.nist.dynamicprog","type":"related"},{"source":"claim.frontier.arxiv-2610-04776","sources":[{"id":"source.frontier.arxiv-2610-04776","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"","target":"method.nist.exhaustivesearch","type":"related"},{"source":"claim.frontier.arxiv-2610-04697","sources":[{"id":"source.frontier.arxiv-2610-04697","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2610-04662","sources":[{"id":"source.frontier.arxiv-2610-04662","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"","target":"concept.nist.temporllogic","type":"related"},{"source":"claim.frontier.arxiv-2610-04630","sources":[{"id":"source.frontier.arxiv-2610-04630","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.arxiv-2610-04242","sources":[{"id":"source.frontier.arxiv-2610-04242","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"","target":"concept.nist.markovchain","type":"related"},{"source":"claim.frontier.arxiv-2610-06918","sources":[{"id":"source.frontier.arxiv-2610-06918","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2610-03964","sources":[{"id":"source.frontier.arxiv-2610-03964","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2610-03008","sources":[{"id":"source.frontier.arxiv-2610-03008","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"","target":"field.cognitive-science","type":"related"},{"source":"claim.frontier.arxiv-2609-39776","sources":[{"id":"source.frontier.arxiv-2609-39776","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-21813","sources":[{"id":"source.frontier.arxiv-2609-21813","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"","target":"concept.nist.probesequenc","type":"related"},{"source":"claim.frontier.arxiv-2609-36354","sources":[{"id":"source.frontier.arxiv-2609-36354","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-35424","sources":[{"id":"source.frontier.arxiv-2609-35424","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-35246","sources":[{"id":"source.frontier.arxiv-2609-35246","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"","target":"concept.eia.distribution-system","type":"related"},{"source":"claim.frontier.arxiv-2609-32315","sources":[{"id":"source.frontier.arxiv-2609-32315","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2609-29972","sources":[{"id":"source.frontier.arxiv-2609-29972","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"","target":"concept.mesh.d000088562","type":"related"},{"source":"claim.frontier.arxiv-2609-29832","sources":[{"id":"source.frontier.arxiv-2609-29832","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"","target":"concept.eia.motor-speed","type":"related"},{"source":"claim.frontier.arxiv-2609-28815","sources":[{"id":"source.frontier.arxiv-2609-28815","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-26924","sources":[{"id":"source.frontier.arxiv-2609-26924","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-25847","sources":[{"id":"source.frontier.arxiv-2609-25847","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.arxiv-2609-25701","sources":[{"id":"source.frontier.arxiv-2609-25701","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"","target":"concept.nist.polynomialtm","type":"related"},{"source":"claim.frontier.arxiv-2609-25437","sources":[{"id":"source.frontier.arxiv-2609-25437","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"","target":"concept.eia.electricity-generation","type":"related"},{"source":"claim.frontier.arxiv-2609-05763","sources":[{"id":"source.frontier.arxiv-2609-05763","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"","target":"concept.eia.electric-vehicle-ev","type":"related"},{"source":"claim.frontier.arxiv-2609-23703","sources":[{"id":"source.frontier.arxiv-2609-23703","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"","target":"field.computer-science","type":"related"},{"source":"claim.frontier.arxiv-2609-23199","sources":[{"id":"source.frontier.arxiv-2609-23199","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-23085","sources":[{"id":"source.frontier.arxiv-2609-23085","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.arxiv-2609-22775","sources":[{"id":"source.frontier.arxiv-2609-22775","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-22615","sources":[{"id":"source.frontier.arxiv-2609-22615","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"","target":"method.nist.chinesermndr","type":"related"},{"source":"claim.frontier.arxiv-2609-21966","sources":[{"id":"source.frontier.arxiv-2609-21966","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-21270","sources":[{"id":"source.frontier.arxiv-2609-21270","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-21093","sources":[{"id":"source.frontier.arxiv-2609-21093","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"","target":"concept.nist.markovchain","type":"related"},{"source":"claim.frontier.arxiv-2609-21057","sources":[{"id":"source.frontier.arxiv-2609-21057","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-19468","sources":[{"id":"source.frontier.arxiv-2609-19468","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-18467","sources":[{"id":"source.frontier.arxiv-2609-18467","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-17042","sources":[{"id":"source.frontier.arxiv-2609-17042","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2609-16899","sources":[{"id":"source.frontier.arxiv-2609-16899","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"","target":"concept.eia.electric-vehicle-ev","type":"related"},{"source":"claim.frontier.arxiv-2609-16353","sources":[{"id":"source.frontier.arxiv-2609-16353","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-16258","sources":[{"id":"source.frontier.arxiv-2609-16258","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-05749","sources":[{"id":"source.frontier.arxiv-2609-05749","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-14022","sources":[{"id":"source.frontier.arxiv-2609-14022","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2609-12866","sources":[{"id":"source.frontier.arxiv-2609-12866","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-12486","sources":[{"id":"source.frontier.arxiv-2609-12486","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"","target":"concept.nist.decisionproblem","type":"related"},{"source":"claim.frontier.arxiv-2609-12016","sources":[{"id":"source.frontier.arxiv-2609-12016","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-11530","sources":[{"id":"source.frontier.arxiv-2609-11530","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2609-08218","sources":[{"id":"source.frontier.arxiv-2609-08218","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2609-06163","sources":[{"id":"source.frontier.arxiv-2609-06163","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2609-06066","sources":[{"id":"source.frontier.arxiv-2609-06066","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"","target":"concept.nist.performance","type":"related"},{"source":"claim.frontier.arxiv-2609-02071","sources":[{"id":"source.frontier.arxiv-2609-02071","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-31034","sources":[{"id":"source.frontier.arxiv-2608-31034","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2608-28387","sources":[{"id":"source.frontier.arxiv-2608-28387","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.arxiv-2608-27536","sources":[{"id":"source.frontier.arxiv-2608-27536","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"","target":"concept.nist.prisonersdilemma","type":"related"},{"source":"claim.frontier.arxiv-2608-26093","sources":[{"id":"source.frontier.arxiv-2608-26093","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"","target":"concept.nist.stronglynp","type":"related"},{"source":"claim.frontier.arxiv-2608-24219","sources":[{"id":"source.frontier.arxiv-2608-24219","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-23972","sources":[{"id":"source.frontier.arxiv-2608-23972","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"","target":"concept.nist.temporllogic","type":"related"},{"source":"claim.frontier.arxiv-2608-21764","sources":[{"id":"source.frontier.arxiv-2608-21764","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2608-21020","sources":[{"id":"source.frontier.arxiv-2608-21020","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-20723","sources":[{"id":"source.frontier.arxiv-2608-20723","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2608-19416","sources":[{"id":"source.frontier.arxiv-2608-19416","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-18396","sources":[{"id":"source.frontier.arxiv-2608-18396","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"","target":"method.nist.exhaustivesearch","type":"related"},{"source":"claim.frontier.arxiv-2608-18060","sources":[{"id":"source.frontier.arxiv-2608-18060","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"","target":"concept.nist.temporllogic","type":"related"},{"source":"claim.frontier.arxiv-2608-16290","sources":[{"id":"source.frontier.arxiv-2608-16290","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-12037","sources":[{"id":"source.frontier.arxiv-2608-12037","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-11929","sources":[{"id":"source.frontier.arxiv-2608-11929","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"","target":"concept.eia.compressor-station","type":"related"},{"source":"claim.frontier.arxiv-2608-11175","sources":[{"id":"source.frontier.arxiv-2608-11175","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-10825","sources":[{"id":"source.frontier.arxiv-2608-10825","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"","target":"concept.eia.electric-vehicle-ev","type":"related"},{"source":"claim.frontier.arxiv-2608-08151","sources":[{"id":"source.frontier.arxiv-2608-08151","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"","target":"method.nist.dynamicprog","type":"related"},{"source":"claim.frontier.arxiv-2608-10254","sources":[{"id":"source.frontier.arxiv-2608-10254","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"","target":"method.nist.modelcheckng","type":"related"},{"source":"claim.frontier.arxiv-2608-08599","sources":[{"id":"source.frontier.arxiv-2608-08599","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-12398","sources":[{"id":"source.frontier.arxiv-2608-12398","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"","target":"ology.psycholinguistics","type":"related"},{"source":"claim.frontier.arxiv-2608-07289","sources":[{"id":"source.frontier.arxiv-2608-07289","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"","target":"concept.nist.formalmethod","type":"related"},{"source":"claim.frontier.arxiv-2608-05481","sources":[{"id":"source.frontier.arxiv-2608-05481","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"","target":"field.neuroscience","type":"related"},{"source":"claim.frontier.arxiv-2608-05348","sources":[{"id":"source.frontier.arxiv-2608-05348","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-12393","sources":[{"id":"source.frontier.arxiv-2608-12393","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2608-04227","sources":[{"id":"source.frontier.arxiv-2608-04227","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"","target":"method.nist.fastfouriertransform","type":"related"},{"source":"claim.frontier.arxiv-2608-04133","sources":[{"id":"source.frontier.arxiv-2608-04133","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"","target":"concept.nist.globaloptimum","type":"related"},{"source":"claim.frontier.arxiv-2608-03967","sources":[{"id":"source.frontier.arxiv-2608-03967","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"","target":"concept.nist.flownetwork","type":"related"},{"source":"claim.frontier.arxiv-2608-02978","sources":[{"id":"source.frontier.arxiv-2608-02978","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-02976","sources":[{"id":"source.frontier.arxiv-2608-02976","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2608-02244","sources":[{"id":"source.frontier.arxiv-2608-02244","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-02079","sources":[{"id":"source.frontier.arxiv-2608-02079","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2608-01220","sources":[{"id":"source.frontier.arxiv-2608-01220","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"","target":"concept.nist.objective","type":"related"},{"source":"claim.frontier.arxiv-2608-00959","sources":[{"id":"source.frontier.arxiv-2608-00959","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"","target":"concept.nist.optimization","type":"related"},{"source":"claim.frontier.arxiv-2607-17248","sources":[{"id":"source.frontier.arxiv-2607-17248","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"","target":"concept.eia.fuel-cell","type":"related"},{"source":"claim.frontier.arxiv-2607-14144","sources":[{"id":"source.frontier.arxiv-2607-14144","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"","target":"concept.nist.lowerbound","type":"related"},{"source":"claim.frontier.arxiv-2607-28833","sources":[{"id":"source.frontier.arxiv-2607-28833","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2607-28780","sources":[{"id":"source.frontier.arxiv-2607-28780","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2607-28276","sources":[{"id":"source.frontier.arxiv-2607-28276","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"","target":"field.ai","type":"related"},{"source":"claim.frontier.arxiv-2607-28185","sources":[{"id":"source.frontier.arxiv-2607-28185","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"","target":"concept.nist.markovchain","type":"related"},{"source":"claim.frontier.arxiv-2607-26209","sources":[{"id":"source.frontier.arxiv-2607-26209","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"","target":"concept.eia.energy-consumption","type":"related"},{"source":"claim.frontier.arxiv-2607-25526","sources":[{"id":"source.frontier.arxiv-2607-25526","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"","target":"field.mesh.d011057","type":"related"},{"source":"claim.frontier.arxiv-2607-25081","sources":[{"id":"source.frontier.arxiv-2607-25081","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"","target":"concept.mesh.d006803","type":"related"},{"source":"claim.frontier.arxiv-2607-24423","sources":[{"id":"source.frontier.arxiv-2607-24423","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"","target":"concept.eia.electric-vehicle-ev","type":"related"},{"source":"claim.frontier.arxiv-2607-24360","sources":[{"id":"source.frontier.arxiv-2607-24360","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"","target":"concept.mesh.d000067656","type":"related"},{"source":"claim.frontier.arxiv-2607-22049","sources":[{"id":"source.frontier.arxiv-2607-22049","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"}],"summary":"The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"","target":"concept.mesh.d007391","type":"related"}],"eras":[{"id":"origins","label":"Deep prehistory"},{"id":"agrarian","label":"Agrarian & literate worlds"},{"id":"classical","label":"Classical → medieval"},{"id":"early-modern","label":"Early modern"},{"id":"industrial-modern","label":"Industrial modernity"},{"id":"twentieth","label":"20th century"},{"id":"frontier","label":"Current frontier"},{"id":"undated","label":"Chronology unresolved"}],"identities":[],"input_sha256":"5613fd93250772910ca6340ddc47f2f150ab61c1ebc52c2a5ebfca620ee67add","meta":{"completeness":"seed-not-exhaustive","created":"2026-10-04","description":"Living temporal dependency graph of human knowledge. Seed graph designed for continuous expansion and provenance review.","runtime_ology_registry":"data/ologies.tsv","title":"Fog of Knowledge","version":"0.1.0"},"node_support":{"claim.andrology.asrm-infertility-supplement-evidence-gap":[{"id":"assert.claim.andrology.asrm-infertility-supplement-evidence-gap","scope":{"assumptions":"The assessment concerns improving male fertility outcomes with the supplements described.","population":"Men attempting conception who are offered vitamins, antioxidants or nutritional supplement formulations.","quantifiers":null,"time":"Evidence assessment in the retained guideline; no claim about subsequent trials.","uncertainty":"Absence of clear reliable supportive evidence is not proof that every supplement is ineffective or harmful.","units":null},"statement":"The AUA/ASRM guideline reports that clear, reliable evidence is lacking for supplements offered to men attempting conception and describes their value for improving fertility outcomes as questionable.","support":[{"end":18413,"quote":"There are no clear, reliable data to support use of the variety of supplements (vitamins, antioxidants, nutritional supplement formulations) that have been offered to men attempting conception. Current data suggest that they are likely not harmful, but they are of questionable value in improving fertility outcomes.","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":18097}],"target_id":"claim.andrology.asrm-infertility-supplement-evidence-gap","target_kind":"node","target_sha256":"8a123b65983fb333d2a4370c9da90a1f85cf682718c0c34bab8c7cc840a4c582"}],"claim.andrology.asrm-male-infertility-etiology-knowledge-gap":[{"id":"assert.claim.andrology.asrm-male-infertility-etiology-knowledge-gap","scope":{"assumptions":"Historical statement of the authors' research assessment, not a claim that no causes were known or that the same gap remains unchanged today.","population":"The causes of male infertility, including genetic explanations, as discussed by the guideline authors.","quantifiers":null,"time":"At the time of the retained guideline's assessment.","uncertainty":"The source gives a qualitative assessment, not a quantified fraction of unexplained cases.","units":null},"statement":"In its future-directions discussion, the AUA/ASRM guideline states that the causes of male infertility, including their genetic basis, had been only superficially explained at the time of the guideline.","support":[{"end":27958,"quote":"The causes of male infertility, including their genetic basis, have only been superficially explained at this time.","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":27843}],"target_id":"claim.andrology.asrm-male-infertility-etiology-knowledge-gap","target_kind":"node","target_sha256":"be86ef8d870fcaff5c2fa9d600c6799dcfa4b01c6aaed0e60b5fdd99af274dbc"}],"claim.andrology.asrm-microtese-noa-recommendation":[{"id":"assert.claim.andrology.asrm-microtese-noa-recommendation","scope":{"assumptions":"Procedure selection within the AUA/ASRM male-infertility guideline.","population":"Men with non-obstructive azoospermia undergoing sperm retrieval.","quantifiers":null,"time":null,"uncertainty":"Moderate recommendation; Evidence Level Grade C. This is not a guarantee of successful sperm retrieval.","units":null},"statement":"The AUA/ASRM guideline recommends microdissection testicular sperm extraction for men with non-obstructive azoospermia undergoing sperm retrieval, assigning a moderate recommendation with Grade C evidence.","support":[{"end":8379,"quote":"For men with NOA undergoing sperm retrieval, microdissection testicular sperm extraction (TESE) should be performed. (Moderate Recommendation; Evidence Level: Grade C)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":8212}],"target_id":"claim.andrology.asrm-microtese-noa-recommendation","target_kind":"node","target_sha256":"ec966d998639f7977fa5e70ed9f19061d5279e972cc77aa2047b3f3bd407bfed"}],"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment":[{"id":"assert.claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","scope":{"assumptions":"Multiple specimens are preferred when possible, not represented as universally feasible or necessary.","population":"Men facing gonadotoxic therapy or other cancer treatment that may affect fertility.","quantifiers":"Multiple specimens when possible.","time":"Before commencement of the relevant treatment.","uncertainty":"Expert Opinion classification; no guaranteed future fertility outcome is asserted.","units":null},"statement":"The AUA/ASRM guideline advises clinicians to encourage sperm banking, preferably multiple specimens when possible, before gonadotoxic therapy or other cancer treatment that may affect male fertility; it classifies this as expert opinion.","support":[{"end":19983,"quote":"Clinicians should encourage men to bank sperm, preferably multiple specimens when possible, prior to commencement of gonadotoxic therapy or other cancer treatment that may affect fertility in men. (Expert Opinion)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":19770}],"target_id":"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","target_kind":"node","target_sha256":"21c95d8b25e789e5bf27d3a7dd77cc641e47bbe46bde04abf3876a37e4ae174b"}],"claim.andrology.asrm-testosterone-monotherapy-fertility":[{"id":"assert.claim.andrology.asrm-testosterone-monotherapy-fertility","scope":{"assumptions":"Refers specifically to testosterone monotherapy, not every possible treatment for low testosterone.","population":"Males interested in current or future fertility.","quantifiers":null,"time":"Current or future reproductive intentions as specified by the guideline.","uncertainty":"Classified as a Clinical Principle by the guideline, not as a quantified randomized treatment effect.","units":null},"statement":"The AUA/ASRM guideline states that testosterone monotherapy should not be prescribed to a male interested in current or future fertility, identifying this recommendation as a clinical principle.","support":[{"end":13244,"quote":"For the male interested in current or future fertility, testosterone monotherapy should not be prescribed. (Clinical Principle)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":13117}],"target_id":"claim.andrology.asrm-testosterone-monotherapy-fertility","target_kind":"node","target_sha256":"9846285040ea78b2f9d402ef7bfc7b4d2aa4a82224640b3773a3fb6c539a9924"}],"claim.andrology.asrm-varicocelectomy-indications":[{"id":"assert.claim.andrology.asrm-varicocelectomy-indications","scope":{"assumptions":"A guideline recommendation for consideration of surgery under the stated selection criteria.","population":"Men attempting to conceive with palpable varicoceles, infertility and abnormal semen parameters, excluding azoospermic men.","quantifiers":null,"time":null,"uncertainty":"Moderate recommendation; Evidence Level Grade B. Does not guarantee improved fertility or apply to nonpalpable varicoceles or azoospermic men.","units":null},"statement":"The AUA/ASRM guideline recommends considering surgical varicocelectomy for men attempting conception who have palpable varicoceles, infertility and abnormal semen parameters, except azoospermic men; it labels this a moderate recommendation supported by Grade B evidence.","support":[{"end":5530,"quote":"Surgical varicocelectomy should be considered in men attempting to conceive, who have palpable varicocele(s), infertility, and abnormal semen parameters, except for azoospermic men.(Moderate Recommendation; Evidence Level: Grade B)","source_id":"src.andrology.asrm-male-infertility-part2-2021","source_sha256":"62447c5c4d012e99f9d03fdf2e3079f0841f01c5a843e3377f8cf7479150bba0","start":5299}],"target_id":"claim.andrology.asrm-varicocelectomy-indications","target_kind":"node","target_sha256":"3fe991a8c06ef4c6af13ab8bc98c0f6193de986e5079339dbd8eab59c6cae708"}],"claim.andrology.endocrine-hypogonadism-diagnostic-criteria":[{"id":"assert.claim.andrology.endocrine-hypogonadism-diagnostic-criteria","scope":{"assumptions":"The diagnosis requires both the stated clinical findings and the stated biochemical findings under the guideline.","population":"Men evaluated for testosterone deficiency and hypogonadism.","quantifiers":"Symptoms and signs together with unequivocally and consistently low serum testosterone.","time":null,"uncertainty":"This is a guideline criterion, not evidence that one symptom or one low measurement is independently sufficient.","units":null},"statement":"The Endocrine Society guideline recommends diagnosing hypogonadism only in men with compatible symptoms and signs and unequivocally and consistently low serum testosterone concentrations.","support":[{"end":4570,"quote":"Recommends making a diagnosis of hypogonadism  only in men with symptoms and signs consistent with testosterone (T) deficiency  and unequivocally and consistently low serum T concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":4380}],"target_id":"claim.andrology.endocrine-hypogonadism-diagnostic-criteria","target_kind":"node","target_sha256":"502087b75d7643ba67d1efa8f06f11412076e2a2de20374423ffcc66a1c4dca6"}],"claim.andrology.endocrine-no-routine-population-screening":[{"id":"assert.claim.andrology.endocrine-no-routine-population-screening","scope":{"assumptions":"The restriction concerns routine population screening, not all testing for suspected hypogonadism.","population":"Men in the general population, as distinguished from patients undergoing clinically indicated evaluation.","quantifiers":"Routine screening of the general male population.","time":null,"uncertainty":"This is the cited guideline's recommendation and does not establish that diagnostic testing is inappropriate for symptomatic patients.","units":null},"statement":"The Endocrine Society guideline recommends against routine screening of men in the general population for hypogonadism.","support":[{"end":5535,"quote":"We recommend against routine screening of men in the general population for hypogonadism.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":5446}],"target_id":"claim.andrology.endocrine-no-routine-population-screening","target_kind":"node","target_sha256":"ddceddceb1ba12c07c072791474541258f9fcc6149708b902ff368e0b7d875e1"}],"claim.andrology.endocrine-primary-secondary-hypogonadism":[{"id":"assert.claim.andrology.endocrine-primary-secondary-hypogonadism","scope":{"assumptions":"Distinguishes primary testicular dysfunction from secondary pituitary-hypothalamic dysfunction using the specified serum hormones.","population":"Men with hypogonadism undergoing evaluation of its origin.","quantifiers":null,"time":null,"uncertainty":"The recommendation concerns diagnostic differentiation; it does not state that those measurements alone determine every underlying etiology.","units":null},"statement":"For men with hypogonadism, the Endocrine Society guideline recommends measuring serum luteinizing hormone and follicle-stimulating hormone concentrations to distinguish primary testicular from secondary pituitary-hypothalamic hypogonadism.","support":[{"end":5776,"quote":"In men who have hypogonadism, we recommend distinguishing between primary (testicular) and secondary (pituitary–hypothalamic) hypogonadism by measuring serum luteinizing hormone and follicle stimulating hormone concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":5550}],"target_id":"claim.andrology.endocrine-primary-secondary-hypogonadism","target_kind":"node","target_sha256":"ee5fe2eba1eab5629b25a5d6f981cc689ef04ffaa30eb8a2aa48083ff881d211"}],"claim.andrology.endocrine-repeat-morning-testosterone":[{"id":"assert.claim.andrology.endocrine-repeat-morning-testosterone","scope":{"assumptions":"Refers to diagnostic confirmation, not routine hormone monitoring of the general population.","population":"Men undergoing diagnostic confirmation of hypogonadism.","quantifiers":"Repeat the morning fasting total testosterone measurement.","time":"Morning fasting measurement, repeated for confirmation.","uncertainty":"A recommended diagnostic procedure, not a guarantee that a repeated value establishes the diagnosis in isolation.","units":null},"statement":"The Endocrine Society guideline recommends confirming hypogonadism by repeating measurement of morning fasting total testosterone concentrations.","support":[{"end":4856,"quote":"Recommend confirming the diagnosis by  repeating the measurement of morning fasting total T concentrations.","source_id":"src.andrology.endocrine-hypogonadism-2018","source_sha256":"2afc740dc9576d2fe9e2d1630dd8f7428f53ad37dfe832a8c5a0839db70304d2","start":4749}],"target_id":"claim.andrology.endocrine-repeat-morning-testosterone","target_kind":"node","target_sha256":"8ea9bf3ad0354b8c86ce2806a3f30d8d759964c434bdf4b6c412eeba310b6433"}],"claim.andrology.who-semen-analysis-clinical-research-uses":[{"id":"assert.claim.andrology.who-semen-analysis-clinical-research-uses","scope":{"assumptions":"The source says semen analysis may be useful, not that it independently determines fertility in every individual.","population":"Clinical and research examination of human semen in the contexts described by WHO.","quantifiers":null,"time":"During and following male fertility regulation and other interventions, where monitoring is undertaken.","uncertainty":"Utility is presented as a possible application rather than a guaranteed diagnostic or predictive result.","units":null},"statement":"The WHO semen manual states that semen analysis may be useful for investigating male fertility status and monitoring spermatogenesis during and following male fertility regulation and other interventions, in clinical and research settings.","support":[{"end":3248,"quote":"Semen analysis may be useful in both clinical and research settings, for investigating male fertility status as well as monitoring spermatogenesis during and following male fertility regulation and other interventions.","source_id":"src.andrology.who-semen-manual-2021","source_sha256":"88f0e5e804e7f8d22ec0fdb7591fb7dec46b22f6ad384c149268983bf7f9f348","start":3030}],"target_id":"claim.andrology.who-semen-analysis-clinical-research-uses","target_kind":"node","target_sha256":"155240297e3a5d810bfb100276975d74bab817021cfe4f8ea622a14b0c299cfa"}],"claim.andrology.who-semen-manual-procedures":[{"id":"assert.claim.andrology.who-semen-manual-procedures","scope":{"assumptions":"Description of the WHO sixth-edition manual, not an independently measured clinical outcome.","population":"Human semen examined or processed in laboratory settings.","quantifiers":null,"time":null,"uncertainty":"The captured publication page establishes the manual's stated scope, not the validation of every individual protocol.","units":null},"statement":"The WHO sixth-edition semen manual describes procedures and methods for laboratory examination and processing of human semen.","support":[{"end":2938,"quote":"The sixth edition of the WHO Manual for the Laboratory Examination and Processing of Human Semen is a reference document for procedures and methods for the laboratory examination and processing of human semen, which are intended to maintain and sustain","source_id":"src.andrology.who-semen-manual-2021","source_sha256":"88f0e5e804e7f8d22ec0fdb7591fb7dec46b22f6ad384c149268983bf7f9f348","start":2686}],"target_id":"claim.andrology.who-semen-manual-procedures","target_kind":"node","target_sha256":"bb570fb99049b35c0ab8e480659b90201a2b4800bfefbaec080490e3cb5eb1df"}],"claim.anytime.choe-ramdas-adjust-then-combine":[{"id":"assert.claim.anytime.choe-ramdas-adjust-then-combine","scope":{"assumptions":"Use suitable adjusters for the same null","population":"E-processes across filtrations","quantifiers":"Logarithmic cost","time":"Preprint revised 2026","uncertainty":"No numerical cost constants in abstract","units":"e-processes"},"statement":"Choe and Ramdas report an adjust-then-combine procedure lifting e-processes across filtrations, with a logarithmic validity-recovery cost.","support":[{"end":1380,"quote":"We establish that a class of functions called adjusters can lift arbitrary e-processes across filtrations. The result yields a generally applicable \"adjust-then-combine\" procedure","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":1201},{"end":1910,"quote":"Second, when we coarsen the filtration to construct an e-process, there is a logarithmic cost to recovering validity in the original filtration.","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":1766}],"target_id":"claim.anytime.choe-ramdas-adjust-then-combine","target_kind":"node","target_sha256":"90f595158b943c426cfce125a50e9af269626792ba25d1d7b6df6c7660dd8f0c"}],"claim.anytime.choe-ramdas-coarse-fine-incompatibility":[{"id":"assert.claim.anytime.choe-ramdas-coarse-fine-incompatibility","scope":{"assumptions":"Distinct information filtrations","population":"E-processes for the same null","quantifiers":"Coarse-to-fine invalidity","time":"Preprint revised 2026","uncertainty":"No proof details in abstract","units":"e-processes"},"statement":"Choe and Ramdas report that e-process validity in a coarser filtration does not automatically hold in a finer filtration, preventing unadjusted averaging across them.","support":[{"end":1074,"quote":"Although e-processes in the same filtration can be combined effortlessly (by averaging), e-processes in different filtrations cannot because their validity in a coarser filtration does not translate to a finer filtration.","source_id":"src.anytime.choe-ramdas-filtrations-2026","source_sha256":"0ef31821863b269b21cb500e67de7964ac481a70da76e2ec0d82ba1d5c70c4f4","start":853}],"target_id":"claim.anytime.choe-ramdas-coarse-fine-incompatibility","target_kind":"node","target_sha256":"c4b27edcb8fd7bc16536bb6e7f66c2e57bcc3f0da2db4e3f7f40bce99f2c0e2e"}],"claim.anytime.confidence-sequences-uniform-coverage":[{"id":"assert.claim.anytime.confidence-sequences-uniform-coverage","scope":{"assumptions":"Guarantees require the authors' stated conditions","population":"Nonparametric sequential settings","quantifiers":"Time-uniform","time":"Unbounded time horizon","uncertainty":"Coverage level not given in abstract","units":"confidence intervals"},"statement":"Howard et al. report constructing shrinking confidence sequences with time-uniform, nonasymptotic coverage under nonparametric conditions.","support":[{"end":885,"quote":"A confidence sequence is a sequence of confidence intervals that is uniformly valid over an unbounded time horizon. Our work develops confidence sequences whose widths go to zero, with nonasymptotic coverage guarantees under nonparametric conditions.","source_id":"src.anytime.howard-confidence-sequences-2021","source_sha256":"a3a7fe7f13d5fee97834657a3157582a1ccd466ea2a006f725ecfaa866f4de70","start":635}],"target_id":"claim.anytime.confidence-sequences-uniform-coverage","target_kind":"node","target_sha256":"68ca37e18f082737b556793e432eeab98dd6ba9b86ba952317ab39b7a78c3d67"}],"claim.anytime.dwork-adaptive-holdout-validation":[{"id":"assert.claim.anytime.dwork-adaptive-holdout-validation","scope":{"assumptions":"Guarantee applies to specified algorithm","population":"Adaptive holdout analyses","quantifiers":"Many adaptively chosen hypotheses","time":"2015 manuscript","uncertainty":"No parameters provided in abstract","units":"validation accuracy"},"statement":"Dwork et al. report that adaptive holdout reuse risks overfitting and propose an algorithm to validate many adaptively chosen hypotheses while avoiding that overfitting.","support":[{"end":1733,"quote":"Reusing a holdout set adaptively multiple times can easily lead to overfitting to the holdout set itself. We give an algorithm that enables the validation of a large number of adaptively chosen hypotheses, while provably avoiding overfitting.","source_id":"src.anytime.dwork-adaptive-generalization-2015","source_sha256":"1ca96eefcac22e1d18e02f4cab3bf73533e9061fe95cf3c15884d0b396cee0c1","start":1491}],"target_id":"claim.anytime.dwork-adaptive-holdout-validation","target_kind":"node","target_sha256":"b9a4f4b788ce62902a2d852f5bff9d4bce8496d5e9fa5f56c092e6f265f7d136"}],"claim.anytime.lee-lasso-postselection-conditioning":[{"id":"assert.claim.anytime.lee-lasso-postselection-conditioning","scope":{"assumptions":"Condition on selection event","population":"Lasso model selection","quantifiers":"Selected coefficients","time":"2016 publication","uncertainty":"Model requirements omitted from abstract","units":"confidence intervals"},"statement":"Lee et al. report selection-conditional inference for lasso-selected coefficients, including confidence intervals and tests.","support":[{"end":1030,"quote":"At the core of our framework is a result that characterizes the distribution of a post-selection estimator conditioned on the selection event. We specialize the approach to model selection by the lasso to form valid confidence intervals for the selected coefficients and test whether all relevant variables have been included in the model.","source_id":"src.anytime.lee-post-selection-2016","source_sha256":"d02318cea41f7bc410b7be95e8925005873e69ff757d81a3c7a29760581d56d9","start":691}],"target_id":"claim.anytime.lee-lasso-postselection-conditioning","target_kind":"node","target_sha256":"c02d1818fe6d0af2be4cdb645f5dfe9c30b866ee513d9669f565c1d004ffb8fe"}],"claim.anytime.ramdas-admissible-martingale-necessity":[{"id":"assert.claim.anytime.ramdas-admissible-martingale-necessity","scope":{"assumptions":"Specific definition of admissibility","population":"Anytime-valid sequential procedures","quantifiers":"All admissible in authors' framework","time":"Preprint revised 2022","uncertainty":"Proof not captured in abstract","units":"martingales"},"statement":"Ramdas et al. report that all admissible confidence sequences, p-processes and e-processes rely on nonnegative martingales under their formal admissibility definition.","support":[{"end":1305,"quote":"Our central contribution is to show that nonnegative martingales are also universal","source_id":"src.anytime.ramdas-admissible-2022","source_sha256":"059c9e0694a6689b085f6290fff48ed5004d0fb30caa7c0c14f77b1f7744876a","start":1222},{"end":1504,"quote":"we show that all admissible constructions of confidence sequences, p-processes, or e-processes must necessarily utilize nonnegative martingales.","source_id":"src.anytime.ramdas-admissible-2022","source_sha256":"059c9e0694a6689b085f6290fff48ed5004d0fb30caa7c0c14f77b1f7744876a","start":1360}],"target_id":"claim.anytime.ramdas-admissible-martingale-necessity","target_kind":"node","target_sha256":"d914813e55f79b2bf9b53bd577d283b6b564a87e9f6ef852333dca5f550784fa"}],"claim.anytime.vovk-wang-averaging-evalues":[{"id":"assert.claim.anytime.vovk-wang-averaging-evalues","scope":{"assumptions":"Inputs must be valid e-values for the same null","population":"Tests of a common null hypothesis","quantifiers":"Arithmetic averaging","time":"2021 publication","uncertainty":"Dependence and construction details not in abstract","units":"e-values"},"statement":"Vovk and Wang report that multiple e-values for one hypothesis can be merged by averaging them.","support":[{"end":1089,"quote":"We demonstrate that e-values are often mathematically more tractable; in particular, in multiple testing of a single hypothesis, e-values can be merged simply by averaging them. This allows us to develop efficient procedures using e-values for testing multiple hypotheses.","source_id":"src.anytime.vovk-wang-e-calibration-2021","source_sha256":"879e46bc1ebfd4150e21283c1255bf3d0a5593c5a2ffe73a33349ba9ba0ecf0d","start":817}],"target_id":"claim.anytime.vovk-wang-averaging-evalues","target_kind":"node","target_sha256":"dbe39d2a0723ed43752401ee1d344963195f3360b406c40ba5149094de058dce"}],"claim.anytime.waudbysmith-bounded-means-betting":[{"id":"assert.claim.anytime.waudbysmith-bounded-means-betting","scope":{"assumptions":"Composite nonnegative martingale construction","population":"Bounded observations","quantifiers":"With and without replacement","time":"Preprint revised 2022","uncertainty":"Exact validity conditions not given in abstract","units":"bounded mean"},"statement":"Waudby-Smith and Ramdas report martingale-based confidence intervals and time-uniform sequences for bounded means, including sampling without replacement and adaptation to unknown variance.","support":[{"end":748,"quote":"This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations.","source_id":"src.anytime.waudbysmith-betting-means-2023","source_sha256":"78cf6be8614989ddaff9f65b49d547885c19dff3101dfff5a841a4dc2e280f6a","start":578},{"end":1212,"quote":"At its heart, it is based on a class of composite nonnegative martingales, with strong connections to testing by betting and the method of mixtures. We show how to extend these ideas to sampling without replacement, another heavily studied problem. In all cases, our bounds are adaptive to the unknown variance","source_id":"src.anytime.waudbysmith-betting-means-2023","source_sha256":"78cf6be8614989ddaff9f65b49d547885c19dff3101dfff5a841a4dc2e280f6a","start":902}],"target_id":"claim.anytime.waudbysmith-bounded-means-betting","target_kind":"node","target_sha256":"ef6a6872a68401634ed0b146bb3e1b28c668d7f5c8feddba67931dc42159580b"}],"claim.anytime.xu-ramdas-elond-arbitrary-dependence":[{"id":"assert.claim.anytime.xu-ramdas-elond-arbitrary-dependence","scope":{"assumptions":"Requires procedure-compatible valid e-values","population":"Sequential hypothesis tests","quantifiers":"Arbitrary dependence","time":"2024 publication","uncertainty":"No quantitative FDR threshold in abstract","units":"FDR"},"statement":"Xu and Ramdas report e-LOND control of online false discovery rate under arbitrary, possibly unknown, dependence.","support":[{"end":1095,"quote":"Our algorithm, e-LOND, provides FDR control under arbitrary, possibly unknown, dependence.","source_id":"src.anytime.xu-ramdas-elond-2024","source_sha256":"724c751d6e68fc207fcd973b8a3a286a276eced35ceed65213972cf1900b42b5","start":1005}],"target_id":"claim.anytime.xu-ramdas-elond-arbitrary-dependence","target_kind":"node","target_sha256":"675742d5169d7f9a2f4f71db47ffacf9df5a791a68c5c96e52e3597753d0284d"}],"claim.assyriology.cdli-p000005-metadata":[{"id":"assertion.assyriology.cdli-p000005-metadata","scope":{"assumptions":"Cataloguing and provenience metadata assigned by CDLI","population":"CDLI artifact P000005 / VAT 15153","quantifiers":"One excavated clay tablet","time":"Uruk IV period attribution, ca. 3350–3200 BC; not an exact writing date","uncertainty":"Language listed as undetermined; period is an attribution rather than a secure year of manufacture","units":"BC"},"statement":"CDLI catalogs P000005 (museum number VAT 15153) as a clay lexical tablet from Uruk (modern Warka), assigned to Uruk IV (ca. 3350–3200 BC), held in the Vorderasiatisches Museum, Berlin, with language undetermined.","support":[{"end":724,"quote":"Lexical tablet excavated in Uruk (mod. Warka), dated to the Uruk IV (ca. 3350-3200 BC) period and now kept in Vorderasiatisches Museum, Berlin, Germany","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":573},{"end":1187,"quote":"Museum Number\nVAT 15153\nPeriod\nUruk IV (ca. 3350-3200 BC)\nProvenience\nUruk (mod. Warka)\nArtifact Type\nTablet\nMaterial(s)\nClay\nGenre / Subgenre(s)\nLexical\n(Archaic Lu2 A (witness))\nLanguage(s)\nUndetermined","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":983}],"target_id":"claim.assyriology.cdli-p000005-metadata","target_kind":"node","target_sha256":"986b3e906be93423451d495874d1e3dbf608c8616eb113e492263d8b557eec44"}],"claim.assyriology.cdli-p000005-transliteration":[{"id":"assertion.assyriology.cdli-p000005-transliteration","scope":{"assumptions":"Modern scholarly transliteration and CDLI editorial composite assignment","population":"Obverse column 1 of the single artifact P000005 and its CDLI composite witness record","quantifiers":"Three transcribed column-one entries; one composite witness relation","time":"Tablet attributed to Uruk IV (ca. 3350–3200 BC)","uncertainty":"The # and ? signs reflect editorial readings; remainder of column is broken; witness status does not imply textual copying direction","units":null},"statement":"CDLI transcribes P000005 obverse column 1 as 1(N01) with ESZDA#, KAB, and DI@t?, marks the remainder broken, and lists the tablet as a witness to the Archaic Lu2 A composite P464118.","support":[{"end":1415,"quote":"column 1\n1. 1(N01) , ESZDA#\n2. 1(N01) , KAB\n3. 1(N01) , DI@t?\nrest broken","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":1342},{"end":2118,"quote":"This artifact is a witness to the following composite(s):\nComposite\nComposite Number\nScore\nCDLI Lexical 000002 (Archaic Lu2 A) composite (P464118)","source_id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","source_sha256":"88afc4ccd9e6f5b3656204d2e149242f9341c3d26c43519abd446cdeaa65c9b6","start":1972}],"target_id":"claim.assyriology.cdli-p000005-transliteration","target_kind":"node","target_sha256":"3b137d0d13083e353544f750730f9f30091a768be24017978f4555fecc799403"}],"claim.assyriology.etcsl-huwawa-versions":[{"id":"assertion.assyriology.etcsl-huwawa-versions","scope":{"assumptions":"Version labels, numbers and resource availability as listed by the ETCSL editors","population":"Two composition-version entries in the ETCSL catalogue","quantifiers":"Two version-specific catalogue entries","time":null,"uncertainty":"Neither relative chronology nor copying/manuscript descent is established by the index","units":null},"statement":"ETCSL catalogs Gilgameš and Ḫuwawa as separate Version A (1.8.1.5) and Version B (1.8.1.5.1) entries, each offering transliteration and translation; those entries alone establish no copying direction or relative date.","support":[{"end":2761,"quote":"1.8.1.5.1 Gilgameš and Ḫuwawa (Version B):\ntransliteration\n|\ntranslation","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":2689},{"end":2832,"quote":"1.8.1.5 Gilgameš and Ḫuwawa (Version A):\ntransliteration\n|\ntranslation","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":2762}],"target_id":"claim.assyriology.etcsl-huwawa-versions","target_kind":"node","target_sha256":"cc6f37d4bb964a47ff93ccebfcdd6677434c7a20979f32bb7558fc1f6db0d382"}],"claim.assyriology.etcsl-ur-iii-ob-catalogues":[{"id":"assertion.assyriology.etcsl-ur-iii-ob-catalogues","scope":{"assumptions":"The index provides catalogue names and the presence of transliterations, not full historical reconstruction","population":"Three separate catalogue listings N1, N2 and B1 within the ETCSL index","quantifiers":"Three separate catalogue entries with differing period/provenience descriptions","time":"Ur III and Old Babylonian labels assigned in the index; no individual absolute manuscript dates established here","uncertainty":"B1 provenience is explicitly possible; no genealogical or copying relationship is claimed","units":null},"statement":"ETCSL separately lists an Ur III catalogue from Nibru (N1), an Old Babylonian catalogue from Nibru (N2), and an Old Babylonian catalogue possibly from Zimbir (B1); these listings do not themselves establish a transmission path among the catalogues.","support":[{"end":175,"quote":"0.1.1 Ur III catalogue from Nibru (N1):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":120},{"end":281,"quote":"0.2.01 OB catalogue from Nibru (N2):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":229},{"end":608,"quote":"0.2.07 OB catalogue possibly from Zimbir (B1):\ntransliteration","source_id":"src.assyriology.etcsl-sumerian-literary-corpus","source_sha256":"02302b42ff441c2aad9fbeb7a33f3d8f8bcffd0f83804f314d9fcafb0dc31ac5","start":546}],"target_id":"claim.assyriology.etcsl-ur-iii-ob-catalogues","target_kind":"node","target_sha256":"be35d758996510c002fa8e18434a2b5eca9b0c9020447b815f53b7365922cad2"}],"claim.assyriology.rinap015-hezekiah-jerusalem":[{"id":"assertion.assyriology.rinap015-hezekiah-jerusalem","scope":{"assumptions":"English edition and restored/translated first-person royal narration","population":"Hezekiah-in-Jerusalem passage in royal inscription Sennacherib 015, column iv","quantifiers":"One attributed confinement claim","time":"Inscription catalogued written ca. 704–681 BC; not necessarily the campaign date","uncertainty":"Royal self-report may be partisan and alone does not verify military consequences independently","units":"BC"},"statement":"In RINAP Sennacherib 015, the first-person royal narrator claims to have confined Hezekiah in Jerusalem like a bird in a cage; this records an inscriptional claim rather than independent proof of the campaign outcome.","support":[{"end":21765,"quote":"(iv 18)\nAs\nfor\nhim\n(\nHezekiah\n)\n,\nI\nconfined\nhim\ninside\nthe\ncity\nJerusalem\n,\nhis\nroyal\ncity\n,\nlike\na\nbird\nin\na\ncage\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":21648},{"end":431,"quote":"Details\nprism\nNeo-Assyrian\nWritten ca. 704-681\nKuyunjik (Nineveh)\nRoyal Inscription\nSennacherib","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":336}],"target_id":"claim.assyriology.rinap015-hezekiah-jerusalem","target_kind":"node","target_sha256":"a7337e588edc6766dbf9f3019ecd334af4cacb6a8d22760f1df167533c206978"}],"claim.assyriology.rinap015-nineveh-orchards-canal":[{"id":"assertion.assyriology.rinap015-nineveh-orchards-canal","scope":{"assumptions":"English translation of the inscription; editorial restorations retained and original pānu unit unconverted","population":"Orchard-expansion and canal passage of royal inscription Sennacherib 015, column viii","quantifiers":"Plots of two pānu each, without verified total number of plots","time":"Inscription catalogued written ca. 704–681 BC; reported works undated within this excerpt","uncertainty":"Royal construction report is not independently verified; cutting action and portions of the route are reconstructed","units":"pānu (ancient unit, no modern conversion asserted)"},"statement":"In column viii of RINAP Sennacherib 015, the royal narrator reports dividing upstream meadowland into plots of two pānu for Nineveh’s citizens and cutting a canal from near Kisiri toward Nineveh’s plain; parts of the canal construction and route appear in brackets as editorial restorations.","support":[{"end":54914,"quote":"(viii 8'b)\nFor\nthe\nexpansion\nof\norchards\n,\nI\nsubdivided\nthe\nmeadowland\nupstream\nof\nthe\ncity\ninto\nplots\nof\ntwo\npānu\neach\nfor\nthe\ncitizens\nof\nNineveh\nand\nI\nhanded\n(\nthem\n)\nover\nto\nthem\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":54730},{"end":55127,"quote":"To\nmake\n(\nthose\n)\n[\nplan\n]\nted\nareas\nluxuriant\n,\n(\nviii\n15´\n)\n[\nI\ncut\nwith\n]\niron\n[\npi\n]\ncks\n[\na\n]\ncanal\n[\nstraight\nthrough\n]\nmountain\nand\nvalley\n,\nfrom\nthe\nborder\nof\nthe\ncity\nKisiri\n[\nto\nthe\n]\nplain\nof\nNineveh\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":54915}],"target_id":"claim.assyriology.rinap015-nineveh-orchards-canal","target_kind":"node","target_sha256":"743e464a348baa05ded73e0dcf33a5a15cc86492c6751fbe24733a97ac965c48"}],"claim.assyriology.rinap015-tebilti-river":[{"id":"assertion.assyriology.rinap015-tebilti-river","scope":{"assumptions":"Editorial translation of royal first-person narration, including bracketed reconstructed words","population":"Tebilti River construction passage of royal inscription Sennacherib 015, column vi","quantifiers":"One river-management assertion","time":"Inscription catalogued written ca. 704–681 BC; construction date not directly established","uncertainty":"The text is a royal claim and restoration-dependent; no independent archaeological demonstration","units":null},"statement":"In column vi of RINAP Sennacherib 015, the royal narrator reports changing the Tebilti River’s course, repairing erosion damage, and directing its outflow, with several portions of the translation editorially restored.","support":[{"end":35830,"quote":"(vi 1)\n[\nI\ntore\ndown\n]\nthat\nsmall\npalace\nin\nits\nentirety\n,\n[\nthen\n]\nI\nchan\n[\nged\n]\nthe\ncourse\nof\nthe\nTebilti\nRiver\n,\nrepaired\n(\nthe\neffects\nof\n)\nthe\nerosion\n,\nand\ndirected\n[\nits\n]\nout\n[\nflow\n]\n.","source_id":"src.assyriology.rinap-sennacherib-015","source_sha256":"c6b880a61c72682a830fe551b1e3cf373318f3437c537808d80819ac06da02ff","start":35636}],"target_id":"claim.assyriology.rinap015-tebilti-river","target_kind":"node","target_sha256":"ae4384aeeaadf45fab0b5e1f95601b737567cea99a47e0866a45d9e5a4fa9065"}],"claim.assyriology.saa001-metadata":[{"id":"assertion.assyriology.saa001-metadata","scope":{"assumptions":"Oracc/SAAo editorial catalogue identifiers, archive provenance and recipient restoration","population":"SAA 01 001 / P224485 administrative-letter record","quantifiers":"One letter, with catalogue cross-identifiers","time":"Reign attribution Sargon II (721–705 BC); catalogue says Dated: no","uncertainty":"Archive is find context rather than composition place; final signs of recipient name are restored; no specific date established","units":"BC"},"statement":"SAAo catalogs SAA 01 001 (CDLI P224485; primary publication NL 039) as a Neo-Assyrian clay administrative letter from the Northwest Palace archive at Nimrud, attributed to Sargon II’s reign (721–705 BC) but explicitly undated, with sender the king and addressee Aššur-šarru-u[ṣur].","support":[{"end":1105,"quote":"SAA 01 001\nCDLI\nP224485\nCollection no.: IM 064156\nExcavation no.: ND 02759\nPrimary publication(s): NL 039","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1000},{"end":1480,"quote":"Provenience: Nimrud (Kalhu) (Pleiades ID:\n894019\n)\nArchive: 006 - Northwest Palace, Room ZT 4\nLanguage: Akkadian (Neo-Assyrian)\nGenre: Administrative Letter\nObject type: tablet\nMaterial: clay\nScript: Neo-Assyrian\nDate\nPeriod: Neo-Assyrian\nReign: Sargon II (721–705 BC)\nDated: no\nSender Information\nSender: the king\nLocation: Royal Court\nRecipient: Aššur-šarru-u[ṣur]","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1114}],"target_id":"claim.assyriology.saa001-metadata","target_kind":"node","target_sha256":"0f7257d029e2dd4b090935bf529895ca28a3748a165727e015a40c987e90b3d8"}],"claim.assyriology.saa001-midas-messenger":[{"id":"assertion.assyriology.saa001-midas-messenger","scope":{"assumptions":"SAAo English editorial translation with bracketed restoration of [of]","population":"Reported communication quoted in SAA 01 001 and ensuing royal response","quantifiers":"14 men of Que reported","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Messenger report nested within quoted earlier letter and alliance characterized by royal narrator; not externally corroborated here","units":"men"},"statement":"In SAA 01 001 the royal writer quotes an earlier report that a messenger [of] Midas brought 14 men of Que previously sent by Urik to Urarṭu and declares that the Phrygian became an ally; these are reported statements in the letter, not independent verification of either event.","support":[{"end":2297,"quote":"(3)\nAs\nto\nwhat\nyou\nwrote\nto\nme\n: \"\nA\nmessenger\n[\nof\n]\nMidas\nthe\nPhrygian\nhas\ncome\nto\nme\n,\nbringing\nme\n14\nmen\nof\nQue\nwhom\nUrik\nhad\nsent\nto\nUrarṭu\nas\nan\nembassy\n\"\n—\nthis\nis\nextremely\ngood\n!\nMy\ngods\nAššur\n,\nŠamaš\n,\nBel\nand\nNabû\nhave\nnow\ntaken\naction\n,\nand\nwithout\na\nbattle\n[\nor\nany\n]\nthing\n,\nthe\nPhrygian\nhas\ngiven\nus\nhis\nword\nand\nbecome\nour\nally\n!","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":1952}],"target_id":"claim.assyriology.saa001-midas-messenger","target_kind":"node","target_sha256":"98a2d458afc9a40dc5034b47848276abc6300568b4bd624255373560f76fb802"}],"claim.assyriology.saa001-phrygian-contact":[{"id":"assertion.assyriology.saa001-phrygian-contact","scope":{"assumptions":"Translated direct command in the letter, framed after an earlier quoted communication","population":"Royal instructions to addressee in SAA 01 001","quantifiers":"One instruction passage","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Subsequent action and correspondence are not documented by this extract","units":null},"statement":"SAA 01 001 directs its recipient not to withdraw a messenger from the Phrygian, to write amicably, and to monitor news about him; the instruction does not establish that the recipient complied.","support":[{"end":3189,"quote":"I\nam\nnow\nwriting\nto\n(\ntell\n)\nyou\nthat\nyou\nshould\nnot\ncut\noff\nyour\nmessenger\nfrom\nthe\nPhrygian's\npresence\n.\nWrite\nto\nhim\nin\nfriendly\nterms\nand\nconstantly\nlisten\nto\nnews\nabout\nhim\n,\nuntil\nI\nhave\nmore\ntime\n.","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":2985}],"target_id":"claim.assyriology.saa001-phrygian-contact","target_kind":"node","target_sha256":"a6c6a7fd32972df68b464a81a97f7140dfd0c89cd37c2505babf6dbbc5ebc4ac"}],"claim.assyriology.saa001-tabal-strategy":[{"id":"assertion.assyriology.saa001-tabal-strategy","scope":{"assumptions":"SAAo edited translation of a royal directive, with ellipsis preceding the proposed strategy","population":"Proposed political strategy against the kings of Tabal in SAA 01 001","quantifiers":"Two proposed directions of pressure","time":"Reign attribution Sargon II (721–705 BC); letter undated","uncertainty":"Not proof of Phrygian participation, military implementation or conquest","units":null},"statement":"In SAA 01 001 the royal writer proposes that the recipient pressure the kings of Tabal from one side while the Phrygian does so from the other; the source includes an ellipsis and does not confirm that the plan occurred.","support":[{"end":7780,"quote":"now\nthat\nthe\nPhrygian\nhas\nmade\npeace\nwith\nus\nand\n...,\nwhat\ncan\nall\nthe\nkings\nof\nTabal\ndo\nhenceforth\n?\nYou\nwill\npress\nthem\nfrom\nthis\nside\nand\nthe\nPhrygian\nfrom\nthat\nside\nso\nthat\n(\nin\nno\ntime\n)\nyou\nwill\nsnap\nyour\nbelt\non\nthem\n.","source_id":"src.assyriology.saao-sargon-midas-letter","source_sha256":"95b6b4d84393d750d7fabfe67e4ce49a8583171b6c8278e485c1b01f35a6004a","start":7555}],"target_id":"claim.assyriology.saa001-tabal-strategy","target_kind":"node","target_sha256":"915e8d093a5d5c2a07078fab9e7faa65a078b29b11d53d066c5d03b09e11ae35"}],"claim.astrometeorology.aratus-crescent-horn-signs":[{"id":"assertion.claim.astrometeorology.aratus-crescent-horn-signs","scope":{"assumptions":"Third and fourth nights, horn shapes, colors, and orientations","population":"Weather omens in the Moon's early waxing crescent","quantifiers":"Third/fourth night; qualitative weather categories","time":null,"uncertainty":"Textual forecast tradition, without modern evidence of predictive reliability","units":null},"statement":"In Phaenomena, Aratus presents the shape and color of the Moon's horns on the third and fourth nights as signs for calm, wind, rain and storms, including directional winds linked to horn orientation.","support":[{"end":47085,"quote":"If she is slender and\n        clear about the third day, she heralds calm: if slender and very ruddy, wind; but if thick and with blunted\n        horns she show but a feeble light on the third and fourth night, her beams are blunted by the South wind or\n        imminent rain. If on the third night neither horn nod forward or lean backward, if vertical they curve their\n        tips on either side, winds from the West will follow that night. But if still with vertical crescent she bring\n        the fourth day too, she gives warning of gathering storm. If her upper horn nod forward, expect thou the North\n        wind, but if it lean backward, the South.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":46427}],"target_id":"claim.astrometeorology.aratus-crescent-horn-signs","target_kind":"node","target_sha256":"5201958fcc68f1691a4a877462a36e08ba405aac6ea94a069baf4c9aa8c0e9a2"}],"claim.astrometeorology.aratus-manger-ass-stars":[{"id":"assertion.claim.astrometeorology.aratus-manger-ass-stars","scope":{"assumptions":"Visibility under a clear sky and asymmetric dimming of the two stars","population":"The Manger and flanking Asses as described by Aratus","quantifiers":"Two flanking stars; directional qualitative forecast","time":null,"uncertainty":"Apparent star changes are treated as weather omens, without evidence here of forecast accuracy","units":null},"statement":"Aratus states that a darkening or vanishing Manger in Cancer signals rain or storms, and that relative dimming of the northern or southern Ass star can indicate a southerly or northerly wind.","support":[{"end":53166,"quote":"On a sudden, when all the sky is clear, the Manger wholly disappears,\n        while the stars that go on either side seem nearer drawn to one another: not slight then is the storm with which\n        the fields are deluged. If the Manger darken and both stars remain unaltered, they herald rain. But if the Ass\n        to the North of the Manger shine feebly through a faint mist, while the Southern Ass is gleaming bright, expect\n        wind from the South: but if in turn the Southern Ass is cloudy and the Northern bright, watch for the North\n        wind.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":52607}],"target_id":"claim.astrometeorology.aratus-manger-ass-stars","target_kind":"node","target_sha256":"d5ee5e74123c84d120fc7ea321bab25bf94b6db8a3fe149b0de56b905efaf201"}],"claim.astrometeorology.aratus-seabird-wind-signs":[{"id":"assertion.claim.astrometeorology.aratus-seabird-wind-signs","scope":{"assumptions":"Herons, storm petrels, wild ducks and gulls in the described conditions","population":"Behavioral wind and gale signs in Phaenomena","quantifiers":"Several named bird types; qualitative gale forecasts","time":null,"uncertainty":"Ancient observational attribution; no controlled predictive test","units":null},"statement":"Aratus describes a heron flying landward from the sea with cries, storm petrels turning toward winds, and ducks or gulls beating wings on shore as signs preceding gales.","support":[{"end":53712,"quote":"[913] When, too, the heron in disordered flight comes landward from he sea with many a scream, he is precursor\n        of the gale at sea. Anon, too, the stormy petrels when the flit in calm, move in companies to face the coming\n        winds. Oft before a gale the wild ducks or sea-wheeling gulls beat their wings on the shore, or a cloud is\n        lengthwise resting on the mountain peaks.","source_id":"src.astrometeorology.aratus-phaenomena-weather-signs","source_sha256":"aae2505aef6b05fd1f0ebc3eb0bb5c22e7f6adb8af18c73cfcf3d6567f8bc4af","start":53319}],"target_id":"claim.astrometeorology.aratus-seabird-wind-signs","target_kind":"node","target_sha256":"324865472dbdacd26630bc3e6bd7673cd0e539e1a1a9405e64c873b841547ecf"}],"claim.astrometeorology.ptolemy-fixed-star-appearances":[{"id":"assertion.claim.astrometeorology.ptolemy-fixed-star-appearances","scope":{"assumptions":"Bright fixed stars rising or setting with respect to the Sun","population":"Daily weather changes described by Ptolemy","quantifiers":"Daily intensifications; no quantitative validation","time":null,"uncertainty":"Historical causal attribution only; no demonstrated physical mechanism","units":null},"statement":"In Tetrabiblos II.12, Ptolemy attributes day-by-day intensification of weather qualities chiefly to appearances of bright fixed stars at their morning or evening rising or setting relative to the Sun.","support":[{"end":10766,"quote":"The day by day intensifications of these particular qualities are brought about\np99\nchiefly when the more brilliant and powerful of the fixed stars make appearances, matutine or vespertine, at rising or setting, with respect to the sun.","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":10530}],"target_id":"claim.astrometeorology.ptolemy-fixed-star-appearances","target_kind":"node","target_sha256":"3cd05f8bed278f583105c4cc82c06b0a978d9e636c30dd9a6a1a7823cc9902d8"}],"claim.astrometeorology.ptolemy-lunar-halo-omens":[{"id":"assertion.claim.astrometeorology.ptolemy-lunar-halo-omens","scope":{"assumptions":"Single clear fading halo versus multiple, colored or broken halos","population":"Lunar halo appearances in Ptolemy's weather-sign discussion","quantifiers":"One halo versus two or three; no quantified predictive performance","time":null,"uncertainty":"Author-attributed omen interpretations; no demonstrated diagnostic accuracy","units":null},"statement":"In Tetrabiblos II.13, Ptolemy treats a single clear fading lunar halo as a fair-weather sign and multiple or differently colored and shaped lunar halos as signs of storms or winds.","support":[{"end":13599,"quote":"We must also observe the halos around the moon. For if there is one, and this is clear, and gradually fading, it signifies fair weather; if there are two or three, storms; if they are yellowish, and broken, as it were, storms accompanied by heavy winds;","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":13346}],"target_id":"claim.astrometeorology.ptolemy-lunar-halo-omens","target_kind":"node","target_sha256":"82d97c26daa80df7e694912230fbd3901950c5ad8256535ac677af545b49182e"}],"claim.astrometeorology.ptolemy-seasonal-syzygies":[{"id":"assertion.claim.astrometeorology.ptolemy-seasonal-syzygies","scope":{"assumptions":"Four equinoctial and solstitial starting points; new and full moons preceding them","population":"Seasonal forecasts in Ptolemy's proposed procedure","quantifiers":"Four seasons; no measured predictive accuracy","time":null,"uncertainty":"Historical weather-forecasting proposal, not a tested prediction law","units":null},"statement":"In Tetrabiblos II.10, Ptolemy proposes using new- and full-moon syzygies preceding the four equinoctial and solstitial starting points to conjecture seasonal conditions for spring, summer, autumn and winter.","support":[{"end":3079,"quote":"It seems more proper and natural to me, however, to employ the four starting-points for investigations which deal with the year, observing the syzygies\np199\nof the sun and moon at new and full moon which most nearly precede them, and among these in particular the conjunctions at which eclipses take place, so that from the starting-point in Aries we may conjecture what the spring will be like,\np93\nfrom that in Cancer the summer, from that in Libra the autumn, and from that in Capricorn the winter.","source_id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","source_sha256":"681919163809517e92566c57824c8db3ccf1f97eb5c1f43ad4de899675ec3b40","start":2578}],"target_id":"claim.astrometeorology.ptolemy-seasonal-syzygies","target_kind":"node","target_sha256":"3274aeeb00424d501723425d82df7380fcf322e8b4b5150a5e051d816b6c594e"}],"claim.astrometeorology.theophrastus-ant-eggs-rain-signs":[{"id":"assertion.claim.astrometeorology.theophrastus-ant-eggs-rain-signs","scope":{"assumptions":"Movement up from a hollow place versus downward","population":"Ants' egg transport as an attributed sign of weather","quantifiers":"Two movement directions; qualitative rain/fair outcome","time":null,"uncertainty":"Historical forecast claim without verified prediction accuracy","units":null},"statement":"Theophrastus treats ants moving their eggs from hollow anthills to higher ground as a sign of rain and moving them down as a sign of fair weather.","support":[{"end":11783,"quote":"It is a sign of rain if ants⁠\n38\nin a hollow place carry their eggs up from the ant-hill to the high ground, a sign of fair weather if they carry them down.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":11627}],"target_id":"claim.astrometeorology.theophrastus-ant-eggs-rain-signs","target_kind":"node","target_sha256":"8fdc59b5f519a8842fe42f4938dda39ffbeb95dd8a9cba602fae0791f30b9e7b"}],"claim.astrometeorology.theophrastus-local-cloud-conditions":[{"id":"assertion.claim.astrometeorology.theophrastus-local-cloud-conditions","scope":{"assumptions":"Mountains, valleys, coastal terrain, wind shifts, locally informed observation","population":"Local weather signs in mountain-and-valley regions","quantifiers":"Region-specific, with no universal forecast probability","time":null,"uncertainty":"Textual description and recommendation without a controlled prediction study","units":null},"statement":"Theophrastus says mountainous and coastal terrain affects cloud movements when winds change and advises attending to local conditions and knowledgeable local observers when interpreting weather signs.","support":[{"end":2387,"quote":"Of the remaining signs some belong specially to all such lands as contain high mountains and valleys, specially where such mountains extend down to the sea: for, when the winds begin to blow, the clouds are thrown against such places, and, when the winds\np393\nchange, the clouds also change⁠\n2\nand take a contrary direction, and, as they become laden with moisture, they settle down in the hollows because of their weight. Wherefore good heed must be taken to the local conditions of the region in which one is placed. It is indeed always possible to find such an observer, and the signs learnt from such persons are the most trustworthy.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":1749}],"target_id":"claim.astrometeorology.theophrastus-local-cloud-conditions","target_kind":"node","target_sha256":"360723eecc58227d554a16f123662a13d085c6ee6af72724819a1b69e2c67641"}],"claim.astrometeorology.theophrastus-red-sky-three-days":[{"id":"assertion.claim.astrometeorology.theophrastus-red-sky-three-days","scope":{"assumptions":"Reddish dawn versus red sky at sunset","population":"Dawn and sunset color observations in the described weather lore","quantifiers":"Within three days or earlier; comparative certainty only","time":null,"uncertainty":"Claimed forecast interval and comparative certainty are textual, not empirically established probabilities","units":null},"statement":"Theophrastus describes a reddish sky before sunrise as a rain sign for the same day or within three days, and a red sunset sky as a similar but less certain sign.","support":[{"end":5755,"quote":"Now the signs of rain appear to be as follows: most unmistakable is that which occurs at dawn, when the sky has a reddish appearance before sunrise; for this usually indicates rain within three days, if not on that very day. Other signs point the same way: thus a red sky at sunset indicates rain within three days, if not before, though less certainly than a red sky at dawn.","source_id":"src.astrometeorology.theophrastus-weather-signs","source_sha256":"b010cabc6f136b1f72de9248fcfa8eb851f16d1fb3bedc6e7a17cb6785136ea5","start":5379}],"target_id":"claim.astrometeorology.theophrastus-red-sky-three-days","target_kind":"node","target_sha256":"f128f53d17826c5e21145dabded9332aeffcb93aa7cf959098d781d29062715f"}],"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","scope":{"assumptions":"Exploration is a level or score affecting spatial movement and social attraction, not itself defined as the probability of exploring; scrounging probability governs tactic selection.","population":"Simulated agents in a spatial producer-scrounger foraging game","quantifiers":"Both traits continuous and evolvable; no fixed producer/scrounger or fast/slow types were imposed initially.","time":"2012 publication; tactics alternated within foraging rounds and genetic traits evolved across rounds","uncertainty":"Computational model rather than direct animal observation; outcomes depend on implemented spatial and selection assumptions.","units":"Dimensionless exploration level and scrounging probability, each on [0,1]"},"statement":"Kurvers and colleagues modeled group foraging with a spatially explicit genetic algorithm whose simulated agents could alternate between producing and scrounging; the exploration level and the probability of scrounging were distinct, evolving continuous traits each ranging from 0 to 1.","support":[{"end":10342,"quote":"Here we incorporated travel times for scroungers and allowed individuals to play a mixed strategy by alternating between producer and scrounger within rounds. Importantly, we did not start with\na priori\ndifferences between individuals by introducing fast and slow explorers in the model, or by assigning fixed foraging strategies (either producing, or scrounging) to individuals. Both the level of exploration and the scrounging probability were on a continuous scale (0–1) and were allowed to evolve (i.e., not fixed).","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":9823},{"end":16773,"quote":"An individual’s strategy was encoded in a 2-locus real-valued chromosome, with locus 1 coding for the probability of scrounging P\nS_I\nand locus 2 coding for the value of exploration E\nI\n. Both loci ranged from 0 to 1","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":16557}],"target_id":"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","target_kind":"node","target_sha256":"6abdf737c508fa9692ac553efe3014439cacbe876ee48bff759fe619132af983"}],"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","scope":{"assumptions":"Intra-run convergence is distinct from variation across different simulation environments.","population":"Populations of simulated agents within individual evolutionary runs under a fixed environmental parameter combination","quantifiers":"Within a given run, rather than all runs or populations universally.","time":"2012 simulation runs","uncertainty":"No observed within-run stable coexistence under modeled conditions does not preclude it in real animals or different models.","units":"Qualitative evolutionary outcome for simulated exploration level"},"statement":"In the Kurvers evolutionary simulations, populations within a given environmental run approached one exploration optimum rather than retaining a stable coexistence of distinct explorer personality types.","support":[{"end":29270,"quote":"Within each run populations evolved towards monomorphism where a single optimal level of exploration characterized all the individuals in the population (\nText S2\n). We found thus no evidence for a stable co-existence of different (personality) types within one population submitted to a given assortment of environmental conditions.","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":28937}],"target_id":"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","target_kind":"node","target_sha256":"4389c51309b84e330fdadc65e43d60472ae672090b7a84b80b81a58611c6477e"}],"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","scope":{"assumptions":"Effect conditional on richness for scrounging; exploration denotes evolved movement tendency, not a probability of exploring.","population":"Spatial genetic-algorithm producer-scrounger simulations with varying food-patch density and richness","quantifiers":"Density effect on scrounging only for low/intermediate richness, not high richness.","time":"2012 model runs; evolved outcomes averaged over the last 10 rounds","uncertainty":"Model-specific result; no estimated universal response for natural animals.","units":"Qualitative direction of simulated evolved exploration levels and scrounging probabilities"},"statement":"In the Kurvers producer-scrounger simulations, increasing food-patch density favored higher exploration; it also reduced scrounging at low or intermediate patch richness, but this reduction disappeared at high patch richness.","support":[{"end":21030,"quote":"An increase in patch density led to an increase in exploration and a reduction in scrounging, but the latter only under conditions of low/intermediate patch richness. An increase in patch richness resulted in increased scrounging, but there was no effect on exploration levels.","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":20753}],"target_id":"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","target_kind":"node","target_sha256":"74e32b32118c87e4a614e73b731853302619130192b18b1baea84feb73f0697b"}],"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012":[{"id":"assertion.claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","scope":{"assumptions":"Patch richness refers to the number of food items per patch rather than patch density; fast/slow explorers refer to trait values.","population":"Spatial genetic-algorithm simulated foragers, across modeled exploration levels","quantifiers":"Richness effect on scrounging at both fast and slow exploration values; no observed effect on exploration.","time":"2012 simulation outcomes","uncertainty":"Null richness effect on exploration pertains to investigated simulation settings, not all ecological environments.","units":"Qualitative evolved scrounging probability and exploration level"},"statement":"In the Kurvers producer-scrounger simulations, richer food patches increased evolved scrounging propensities among both fast and slow explorers, while patch richness showed no effect on evolved exploration.","support":[{"end":20600,"quote":"An increase in patch richness resulted in an increased scrounging, both for fast and slow explorers individuals (\nFig. 1\n). There was, however, no effect of patch richness on exploration (","source_id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","source_sha256":"06fc932e055d700b2745ca8554bf1856674ec25a9675bf87870f353f5bb8de7b","start":20412}],"target_id":"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","target_kind":"node","target_sha256":"bd361ddee9de13b411f98f9fbf6bb1a73f010beef2f1b43421710faaf94a9547"}],"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","scope":{"assumptions":"Conditional modeled association; adult helpers older than two years and juveniles were excluded from age-versus-experience analysis due to confounding.","population":"Wild meerkat scorpion feeds by eligible subadult (6–12 months) and adult-yearling (1–2 years) helpers","quantifiers":"Older eligible helpers versus younger; prior pup-care experience nonsignificant after age adjustment.","time":"Field observations reported in 2008","uncertainty":"Failure to detect an experience association does not prove absence of an effect; age and prior experience covary.","units":"Qualitative provisioning propensity and statistical significance"},"statement":"In Thornton’s meerkat scorpion-provisioning analysis, older eligible helpers were more likely to give pups intact scorpions, whereas prior experience with earlier foraging litters showed no statistically significant association after controlling for helper age.","support":[{"end":19534,"quote":"The older helpers were more likely to provision pups with intact scorpions (\nfigure 2\n), and there was a non-significant trend for the probability of provisioning dead scorpions to decline with helper age (\ntable 1\n).","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":19317},{"end":19716,"quote":"However, controlling for helper age and other significant variables, I found no evidence that experienced helpers provisioned scorpions in a different way to inexperienced helpers (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":19535}],"target_id":"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","target_kind":"node","target_sha256":"e059557e4f795d4b2a07383c1b25491c5c19b12cae1788ce58cd5cfda884ccd1"}],"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","scope":{"assumptions":"Linear mixed-model associations adjusted for prey, pup and group covariates; the proximity measure is a second helper within 2 m, not overall group size.","population":"6,148 wild meerkat pup feeding observations in the monitoring-time study","quantifiers":"Declines with increasing litter size and rainfall and if another helper is present within 2 m.","time":"Field observations reported in 2008; rainfall totaled over the preceding 30 days","uncertainty":"Observational effects do not identify causal mechanisms for rainfall or helper proximity.","units":"Log monitoring duration based on seconds; rainfall in millimeters over preceding 30 days"},"statement":"In Thornton’s meerkat feeding observations, pup monitoring duration decreased with larger litter size, higher recent rainfall, and the presence of another helper within two metres.","support":[{"end":23178,"quote":"Finally, monitoring time declined with increasing litter size and rainfall, and when another helper was present within 2 m (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":23054}],"target_id":"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","target_kind":"node","target_sha256":"65db8da3b86351801a507acf66897334ce5a3e57ce13b216211a2382d73ad222"}],"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","scope":{"assumptions":"Monitoring included attention to pups handling prey and time retrieving escaped prey; log-duration mixed model.","population":"6,148 observed feeds by wild meerkat helpers to pups; varied prey types","quantifiers":"Prey mobility and size increase duration; increasing pup age decreases duration.","time":"Field observations reported in 2008","uncertainty":"Observational correlations; no demonstrated experimental effect on learning or survival.","units":"Monitoring duration measured in seconds, modeled on a log scale; qualitative directions"},"statement":"For 6,148 observed meerkat pup feeds, helpers spent longer monitoring pups when provisioned prey was moving or larger and spent less time monitoring as pups grew older.","support":[{"end":22848,"quote":"The duration of monitoring following pup feeds was also affected by prey, pup, helper and group characteristics, as well as by recent rainfall. Monitoring duration was greater if the prey item was moving and larger in size and declined as pups grew older (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":22592}],"target_id":"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","target_kind":"node","target_sha256":"9df9098beccdf1603feae93190baf9fdb96f3bd37ce9d20a125f8f7518002ee5"}],"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","scope":{"assumptions":"Binomial generalized linear mixed-model associations of age with prey-state provisioning.","population":"Scorpion-feeding events in wild meerkats, among the 1,070-feed prey-state analysis","quantifiers":"Age-related association conditional on other statistically significant terms.","time":"Field observations reported in 2008","uncertainty":"Not randomized pup-age assignment or proof that provisioning caused learning.","units":"Qualitative direction of scorpion-provisioning probabilities"},"statement":"In Thornton’s wild meerkat scorpion-feeding analysis, older pups were less likely to receive dead or disabled scorpions and more likely to receive intact scorpions, adjusting for significant modeled covariates.","support":[{"end":19184,"quote":"The probability that a scorpion would be fed dead or disabled declined with pup age, while the probability that the item would be fed intact increased, controlling for other significant terms in the model (","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":18978}],"target_id":"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","target_kind":"node","target_sha256":"d62a4213cf5f558a975a1da8dd233a3f92a221c0565d97ef8ce323df44e4fd7f"}],"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008":[{"id":"assertion.claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","scope":{"assumptions":"Scorpion-only feed-state analysis is distinct from the larger prey-monitoring analysis.","population":"Observed wild meerkat helpers and pups; two differently scoped and potentially overlapping sets of feeding events","quantifiers":"1,070/347/339/137/15 provisioning-state; 6,148/300/244/65/13 monitoring-time.","time":"2003–2006 field observations reported in 2008","uncertainty":"Observational samples; repeated events from the same animals and groups; not independent experimental subjects.","units":"Counts of feeds, helpers, pups, litters, and groups"},"statement":"Thornton analyzed 1,070 scorpion feeds by 347 meerkat helpers to 339 pups from 137 litters in 15 groups for prey-provisioning state, and recorded monitoring times for 6,148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","support":[{"end":17171,"quote":"Final analyses were conducted on 1070 feeds by 347 helpers to 339 pups from 137 litters in 15 groups.","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":17070},{"end":17617,"quote":"In total, I collected accurate monitoring times for 6148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","source_id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","source_sha256":"b26a238ce7ece43889d103bb915cb5cfbff8886977a2e1efde7d9227ff971713","start":17498}],"target_id":"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","target_kind":"node","target_sha256":"cad982db4e8ca33fc018e53115c092a5b5efc92119539888108dff7bbeb5ede6"}],"claim.bose-2017-gravitational-entanglement-proposal-reported":[{"id":"assertion.bose-2017-gravitational-entanglement-proposal-reported-v2","scope":{"assumptions":"The proposed arrangement relies on gravitationally induced phase evolution between the test masses, with sufficient separation to keep Casimir-Polder forces at bay. Detectable entanglement is a prediction within the proposed setup, not a reported measurement.","population":"Two micron-size test masses in adjacent matter-wave interferometers, as described in the proposal by Bose and collaborators.","quantifiers":"The prediction is limited to the two-mass interferometric arrangement described in the paper. No universal assertion about all gravitational interactions or all proposed gravity tests is made.","time":"The paper was submitted on 19 July 2017. This date identifies the proposal's publication history and does not establish the date of an experimental observation or its current frontier standing.","uncertainty":"The retained source presents a theoretical proposal and predicted test outcome. It does not report that the experiment was performed, that the entanglement was observed, or that gravity's quantum nature was experimentally established. Status reported attributes the proposal to its authors; era undated leaves atlas chronology unresolved; frontier false makes no claim about current research leadership.","units":null},"statement":"Bose and collaborators proposed a test in which gravitationally induced phase evolution between two micron-size test masses in adjacent matter-wave interferometers could produce detectable entanglement, with the masses separated sufficiently to keep Casimir-Polder forces at bay.","support":[{"end":310,"quote":"Authors:\nSougato Bose","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":289},{"end":233,"quote":"[Submitted on 19 Jul 2017]","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":207},{"end":1121,"quote":"Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":991},{"end":1409,"quote":"We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":1122}],"target_id":"claim.bose-2017-gravitational-entanglement-proposal-reported","target_kind":"node","target_sha256":"565135eeb68def2242b5651da7e41fb899a4aed9246439f5fd25c0fcfd8ead96"}],"claim.category-theory.batanin-ainfinity-tensor":[{"id":"assertion.claim.category-theory.batanin-ainfinity-tensor","scope":{"assumptions":"The construction given within the authors’ framework","population":"A-infinity algebras in the cited higher-operad paper","quantifiers":"A tensor product construction, without a uniqueness claim","time":null,"uncertainty":"The retained abstract does not spell out the construction or identify all its technical conditions","units":null},"statement":"Batanin, Cisinski, and Weber state that their paper gives a construction of a tensor product of A-infinity algebras.","support":[{"end":1383,"quote":"give the construction of a tensor product of A-infinity algebras.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":1318}],"target_id":"claim.category-theory.batanin-ainfinity-tensor","target_kind":"node","target_sha256":"ae93e7bc889aa21de69a4c2eac51d71610319c5b31c66085528678ccc9e5bc3a"}],"claim.category-theory.batanin-ekmann-hilton-braided-2cats":[{"id":"assertion.claim.category-theory.batanin-ekmann-hilton-braided-2cats","scope":{"assumptions":"The authors’ described applications of the higher-operad framework","population":"Braided monoidal 2-categories in the authors’ proposed framework","quantifiers":"One reported result","time":null,"uncertainty":"The retained abstract does not specify the theorem statement or proof hypotheses; spelling follows the source","units":null},"statement":"Batanin, Cisinski, and Weber report obtaining an “Ekmann-Hilton” result for braided monoidal 2-categories as an application of their higher-operad framework.","support":[{"end":1312,"quote":"we obtain an \"Ekmann-Hilton\" result for braided monoidal 2-categories","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":1243}],"target_id":"claim.category-theory.batanin-ekmann-hilton-braided-2cats","target_kind":"node","target_sha256":"81a4065fa127cb374fb98c90139fa990623718b83525b57eaaf9d21d1b2d5faa"}],"claim.category-theory.batanin-gray-crans-inclusion":[{"id":"assertion.claim.category-theory.batanin-gray-crans-inclusion","scope":{"assumptions":"Within the authors’ higher-operad framework","population":"The resulting globular-operad-based theory described in the cited paper","quantifiers":"Both named tensor products","time":null,"uncertainty":"The abstract does not establish the constructions’ generality outside the specified settings","units":null},"statement":"Batanin, Cisinski, and Weber state that their resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product of Gray categories.","support":[{"end":957,"quote":"The resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product [12] of Gray categories.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":834}],"target_id":"claim.category-theory.batanin-gray-crans-inclusion","target_kind":"node","target_sha256":"93bfe0bf804ad121fe916d02ef68bc482363ff7b6d189b78bd2761a00866b6ca"}],"claim.category-theory.batanin-gray-generalization-open-problem":[{"id":"assertion.claim.category-theory.batanin-gray-generalization-open-problem","scope":{"assumptions":"Historical characterization by the paper’s authors","population":"Systematic constructions of higher-dimensional analogues of the Gray tensor product","quantifiers":"One of the open problems, without an exclusivity claim","time":"2009 source submission","uncertainty":"Open-problem characterization is historical; the retained abstract cannot establish whether it remains open in 2026","units":null},"statement":"Batanin, Cisinski, and Weber describe the systematic construction of higher-dimensional analogues of the Gray tensor product as an open problem in higher category theory in their 2009-submitted paper.","support":[{"end":730,"quote":"One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product.","source_id":"src.category-theory.batanin-cisinski-weber-higher-operads","source_sha256":"dfb62e2613f51e5a3b2f91474be9a92b0aa64bc7d1878b9715681a8d9916edd8","start":585}],"target_id":"claim.category-theory.batanin-gray-generalization-open-problem","target_kind":"node","target_sha256":"b1232209e0be63852f023c3305b64872f604461ad129430773e3a9ca338ce611"}],"claim.category-theory.fong-spivak-seven-applied-sketches":[{"id":"assertion.claim.category-theory.fong-spivak-seven-applied-sketches","scope":{"assumptions":"The examples and structures are presented as lists of examples, without one-to-one correspondence","population":"Pedagogical examples and categorical structures in the cited book","quantifiers":"Seven sketches; the named examples are nonexhaustive","time":null,"uncertainty":"The captured abstract does not identify the precise pairing within each sketch or prove an application result","units":null},"statement":"Fong and Spivak describe seven instructional sketches pairing examples including databases, electric circuits, and dynamical systems with categorical structures including adjoint functors, enriched categories, and toposes.","support":[{"end":1053,"quote":"The tour takes place over seven sketches, each pairing an evocative application, such as databases, electric circuits, or dynamical systems, with the exploration of a categorical structure, such as adjoint functors, enriched categories, or toposes.","source_id":"src.category-theory.fong-spivak-seven-sketches","source_sha256":"8ce9f9ccad18f3513d2ae63ad4efc86d2cd17d210a7798344b297d837a9a8ea5","start":805}],"target_id":"claim.category-theory.fong-spivak-seven-applied-sketches","target_kind":"node","target_sha256":"3d422fcb5024a78677c6305db976f01be3b47c9af78713c7c3a5ed96e698869c"}],"claim.category-theory.leinster-universal-properties-approaches":[{"id":"assertion.claim.category-theory.leinster-universal-properties-approaches","scope":{"assumptions":"An author-authored summary of textbook organization, not a full proof of equivalence","population":"Presentation of universal properties in the cited introductory textbook","quantifiers":"Three approaches are explicitly listed","time":null,"uncertainty":"The retained abstract states the chapter organization, not formal hypotheses or proofs","units":null},"statement":"Leinster describes his introductory category theory textbook as presenting universal properties through adjoint functors, representable functors, and limits, with a final chapter tying the three approaches together.","support":[{"end":912,"quote":"After a chapter introducing the basic definitions, separate chapters present three ways of expressing universal properties: via adjoint functors, representable functors, and limits. A final chapter ties the three together.","source_id":"src.category-theory.leinster-basic-category-theory","source_sha256":"34ff236e04c05a46e91fa7f3dfe8702e9ffb5b6870dd99678aaa4ceff2d8387f","start":690}],"target_id":"claim.category-theory.leinster-universal-properties-approaches","target_kind":"node","target_sha256":"a3ce43474cd0794d338fec295b52c08842ed9c3304d97ef819eda6d635c79124"}],"claim.category-theory.spivak-programming-types-bridge":[{"id":"assertion.claim.category-theory.spivak-programming-types-bridge","scope":{"assumptions":"Spivak’s proposed categorical connection","population":"Database schemas and category of types for a functional programming language","quantifiers":"A database and a functional programming language","time":null,"uncertainty":"The source does not name a specific programming language or demonstrate deployment","units":null},"statement":"Spivak describes connecting a database to a functional programming language by introducing a functorial connection between the database schema and the language’s category of types.","support":[{"end":1105,"quote":"We also show how to connect a database and a functional programming language by introducing a functorial connection between the schema and the category of types for that language.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":926}],"target_id":"claim.category-theory.spivak-programming-types-bridge","target_kind":"node","target_sha256":"c1cc62aa92339d076dc86d3311001fd56b44b1f05266b42bdd497e544a89fa8b"}],"claim.category-theory.spivak-query-expressiveness":[{"id":"assertion.claim.category-theory.spivak-query-expressiveness","scope":{"assumptions":"The author’s definition and properties of the three data-migration functors","population":"Conjunctive and disjunctive queries as discussed in the categorical database proposal","quantifiers":"The two specified query classes","time":null,"uncertainty":"No performance, SQL coverage, completeness beyond stated query classes, or widespread deployment is claimed","units":null},"statement":"Spivak states that his three data-migration functors can be used in place of conjunctive and disjunctive queries within the paper’s database framework.","support":[{"end":925,"quote":"and can be used in place of conjunctive and disjunctive queries.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":861}],"target_id":"claim.category-theory.spivak-query-expressiveness","target_kind":"node","target_sha256":"15cb1839a0fe960157275ad27883c0bdfa23af027088d0b7b11d87cae2a64104"}],"claim.category-theory.spivak-relational-operations":[{"id":"assertion.claim.category-theory.spivak-relational-operations","scope":{"assumptions":"The three functors introduced for schema morphisms","population":"Relational operations across tables in the categorical database framework","quantifiers":"Across all tables simultaneously as claimed by the author","time":null,"uncertainty":"The abstract reports expressive functionality, not performance or implementation results","units":null},"statement":"Spivak reports that the three data-migration functors parameterize projections, unions, and joins across all tables simultaneously in the categorical database formulation.","support":[{"end":860,"quote":"These functors parameterize projections, unions, and joins over all tables simultaneously","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":771}],"target_id":"claim.category-theory.spivak-relational-operations","target_kind":"node","target_sha256":"376979e14df2fa605a8931e6965073ac2a00ec61fb7cc6aabdd5c5081b93373b"}],"claim.category-theory.spivak-schema-category-instance-functor":[{"id":"assertion.claim.category-theory.spivak-schema-category-instance-functor","scope":{"assumptions":"The paper-specific categorical database formalism","population":"Schemas and instances in Spivak’s proposed categorical database language","quantifiers":"A database schema; an instance","time":null,"uncertainty":"No assertion that every deployed database has this representation or that it is unique","units":null},"statement":"Spivak proposes a database definition language in which a database schema is a small category and an instance is a set-valued functor on that schema.","support":[{"end":622,"quote":"In this paper we present a simple database definition language: that of categories and functors. A database schema is a small category and an instance is a set-valued functor on it.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":441}],"target_id":"claim.category-theory.spivak-schema-category-instance-functor","target_kind":"node","target_sha256":"4239e41d4c4802393c76c421b48f54ece3d48fddf1a45d6685409799dc9f4e6e"}],"claim.category-theory.spivak-three-migration-functors":[{"id":"assertion.claim.category-theory.spivak-three-migration-functors","scope":{"assumptions":"Database schema morphisms in the author’s categorical formulation","population":"Schema morphisms and database instances in the proposed model","quantifiers":"Three distinct functors are reported","time":null,"uncertainty":"The abstract does not specify the full formal conditions or constructions","units":null},"statement":"Within Spivak’s category-and-functor database model, morphisms of schemas induce three data-migration functors that translate instances between schemas in canonical ways.","support":[{"end":770,"quote":"We show that morphisms of schemas induce three \"data migration functors\", which translate instances from one schema to the other in canonical ways.","source_id":"src.category-theory.spivak-functorial-data-migration","source_sha256":"95ada705c6d14229aa808c67f9cc0f55058abd7b10ed8dd8c034d473df35f771","start":623}],"target_id":"claim.category-theory.spivak-three-migration-functors","target_kind":"node","target_sha256":"75166568be2ede07e77336abc066abdeb21a82d08605a3453e6008cbc3de3ece"}],"claim.citation.alce-eli5":[{"id":"assert.citation.alce-eli5","scope":{"assumptions":"Applies to the paper’s tested systems and citation-support metric","population":"Models evaluated on the ELI5 dataset within ALCE","quantifiers":"50% of evaluated cases for even the best models","time":null,"uncertainty":null,"units":"percent"},"statement":"Gao et al. (2023) report that even the best models in their ELI5 evaluation lacked complete citation support 50% of the time.","support":[{"end":2929,"quote":"on the ELI5 dataset, even the best models lack complete citation support 50% of the time.","source_id":"src.citation.alce-gao-2023","source_sha256":"07b919b26ad93d2ab9a5162c0d5d15407e68d3ef3d3ed2c519a4012e0d6c1045","start":2840}],"target_id":"claim.citation.alce-eli5","target_kind":"node","target_sha256":"f98424e34c70bc31782ccb251ff475ee0ed2066043f7df373c49bd020bc232dc"}],"claim.citation.alce-metrics":[{"id":"assert.citation.alce-metrics","scope":{"assumptions":"Authors report correlation without a numerical coefficient in the retained abstract","population":"ALCE question-answering and citation evaluations","quantifiers":"three evaluation dimensions","time":null,"uncertainty":null,"units":null},"statement":"Gao et al. (2023) report that ALCE uses automatic metrics for fluency, correctness, and citation quality and that these metrics correlate strongly with human judgments.","support":[{"end":2687,"quote":"We develop automatic metrics along three dimensions—fluency, correctness, and citation quality—and demonstrate their strong correlation with human judgements.","source_id":"src.citation.alce-gao-2023","source_sha256":"07b919b26ad93d2ab9a5162c0d5d15407e68d3ef3d3ed2c519a4012e0d6c1045","start":2529}],"target_id":"claim.citation.alce-metrics","target_kind":"node","target_sha256":"ed55e1663a77a54545548ef0f1350e35af11245e6bf60e589e1a655b1ad5c82e"}],"claim.citation.claimbench-limits":[{"id":"assert.citation.claimbench-limits","scope":{"assumptions":"Limited to study tasks, prompts and tested models","population":"Six LLMs and over 300 claim-evidence pairs across research domains","quantifiers":"more than 300 pairs","time":null,"uncertainty":null,"units":"claim-evidence pairs"},"statement":"Javaji et al. (2025) report substantial limitations in processing scientific claim-evidence relationships when evaluating six LLMs on more than 300 claim-evidence pairs across multiple research domains.","support":[{"end":2733,"quote":"We systematically compare three approaches which are inspired by divide and conquer approaches, across six diverse LLMs, highlighting model-specific strengths and weaknesses in scientific comprehension.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":2531},{"end":2916,"quote":"Through evaluation involving over 300 claim-evidence pairs across multiple research domains, we reveal significant limitations in LLMs’ ability to process complex scientific content.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":2734}],"target_id":"claim.citation.claimbench-limits","target_kind":"node","target_sha256":"f13fd9c7b1f652b47e98db925631ea7492171be344af88503262ea67d213d3e8"}],"claim.citation.claimbench-prompting":[{"id":"assert.citation.claimbench-prompting","scope":{"assumptions":"Comparison under the tested prompting procedures","population":"Models and claim-evidence tasks in CLAIM-BENCH","quantifiers":"improvement and higher computational cost","time":null,"uncertainty":null,"units":null},"statement":"Javaji et al. (2025) report that three-pass and one-by-one prompting improve LLM claim-to-evidence linking in their evaluations, with increased computational cost.","support":[{"end":3330,"quote":"Furthermore, strategically designed three-pass and one-by-one prompting approaches significantly improve LLMs’ abilities to accurately link dispersed evidence with claims, although this comes at increased computational cost.","source_id":"src.citation.claimbench-javaji-2025","source_sha256":"cc2d854dcc0065fc2289f3067b8803f1887a5fd95e99684f0e331041ff666eb8","start":3106}],"target_id":"claim.citation.claimbench-prompting","target_kind":"node","target_sha256":"ed14f1c891684b2619fb3fc7e6e0214114c9918c2919ddd6c63b6460b704458c"}],"claim.citation.contextcite-method":[{"id":"assert.citation.contextcite-method","scope":{"assumptions":"Method introduced in the paper; the retained abstract does not establish complete causal identification of internal mechanisms","population":"Generated statements and supplied context in the authors’ attribution setting","quantifiers":"method proposal","time":null,"uncertainty":null,"units":null},"statement":"Cohen-Wang et al. (2024) introduce ContextCite as a scalable method for attributing generated statements to supplied context, designed to operate on top of existing language models.","support":[{"end":849,"quote":"We then present ContextCite, a simple and scalable method for context attribution that can be applied on top of any existing language model.","source_id":"src.citation.contextcite-cohenwang-2024","source_sha256":"c339c49a83f1d7c7174f5d97837b52ef8f72a4d73902aa19684bbaed69d75daa","start":709}],"target_id":"claim.citation.contextcite-method","target_kind":"node","target_sha256":"5844a3b3e89dd054764412cb4177f49760586619b3007084b4a1dbe5e5ad6097"}],"claim.citation.contextdpo-gain":[{"id":"assert.citation.contextdpo-gain","scope":{"assumptions":"Baseline, scoring metric, and study conditions determine percentage improvements; detailed settings not present in retained abstract","population":"Popular open-source language models tested by the authors","quantifiers":"reported 35% to 280% improvement","time":null,"uncertainty":null,"units":"percent"},"statement":"Bi et al. (2025) report Context-DPO context-faithfulness improvements of 35% to 280% on popular open-source models in their experiments.","support":[{"end":2868,"quote":"Extensive experiments demonstrate that our Context-DPO significantly improves context-faithfulness, achieving 35% to 280% improvements on popular open-source models.","source_id":"src.citation.contextdpo-bi-2025","source_sha256":"051b06a5dbe9f9062c7fd899aa12579ae79ffc120a99aff77c942ff6d88e46db","start":2703}],"target_id":"claim.citation.contextdpo-gain","target_kind":"node","target_sha256":"b074d97eb1ee2ffb9d2fc80b2d1b8f3213903a6da76d49a09f1a09dc17efeab8"}],"claim.citation.contextprior-task":[{"id":"assert.citation.contextprior-task","scope":{"assumptions":"Proposed evaluation task; assessing internal knowledge does not prove direct observation of model knowledge use","population":"Context-Prior Augmented Citation Generation task","quantifiers":"five metrics over three aspects","time":null,"uncertainty":null,"units":"evaluation metrics"},"statement":"Shen et al. (2025) introduce a citation-generation task considering external context and internal model knowledge, evaluated with five metrics addressing helpfulness, citation faithfulness, and trustworthiness.","support":[{"end":2531,"quote":"requiring models to generate citations considering both external and internal knowledge while providing trustworthy references, with 5 evaluation metrics focusing on 3 aspects: answer helpfulness, citation faithfulness, and trustworthiness.","source_id":"src.citation.contextprior-shen-2025","source_sha256":"518eea16b8d667108d9155c586c27e7e5273e036541aec3f8efada0c4c0275d1","start":2291}],"target_id":"claim.citation.contextprior-task","target_kind":"node","target_sha256":"a9a27333a4b986dbd19ea8cb3310acdf93593169be1051182ed4720b7b10d941"}],"claim.citation.counterfactual-eval":[{"id":"assert.citation.counterfactual-eval","scope":{"assumptions":"Authors’ methodological argument, without quantitative validation in the retained abstract","population":"Autoregressive language models in the authors’ proposed evaluation","quantifiers":"methodological limitation and proposal","time":null,"uncertainty":null,"units":null},"statement":"Kamahi et al. (2024) argue that removing or corrupting input tokens creates out-of-distribution inputs for autoregressive language models and propose fluent in-distribution counterfactuals for evaluating attribution methods.","support":[{"end":2523,"quote":"Most faithfulness evaluation techniques corrupt or remove input tokens deemed important by a particular attribution (feature importance) method and observe the resulting change in the model’s output.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2324},{"end":2672,"quote":"However, for autoregressive language models, this approach creates out-of-distribution inputs due to their next-token prediction training objective.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2524},{"end":2950,"quote":"Our technique generates fluent, in-distribution counterfactuals, making the evaluation protocol more reliable.","source_id":"src.citation.counterfactual-kamahi-2024","source_sha256":"727f937535584299c0023e058424748f017b8e8b36ca3b780548e5f4b320ef45","start":2840}],"target_id":"claim.citation.counterfactual-eval","target_kind":"node","target_sha256":"914805d4391d74c29e2270e404380cb3f28cba70db97045f3241462d199c53a9"}],"claim.citation.faithfulrag-conflict":[{"id":"assert.citation.faithfulrag-conflict","scope":{"assumptions":"Proposed algorithmic strategy; retained abstract does not establish external replication","population":"Retrieval-augmented language-model generation with knowledge conflict","quantifiers":"framework proposal","time":null,"uncertainty":null,"units":null},"statement":"Zhang et al. (2025) propose FaithfulRAG, which identifies fact-level conflicts between retrieved context and model knowledge and uses a self-thinking process before generating responses.","support":[{"end":2430,"quote":"This issue is particularly severe in cases of knowledge conflict, where the retrieved context conflicts with the model’s parametric knowledge.","source_id":"src.citation.faithfulrag-zhang-2025","source_sha256":"d7d4f77a15d7e0991cdfafbe0a6309e4aa0002d2f20759d8f3445add7d836ad2","start":2288},{"end":3210,"quote":"Specifically, FaithfulRAG identifies conflicting knowledge at the fact level and designs a self-thinking process, allowing LLMs to reason about and integrate conflicting facts before generating responses.","source_id":"src.citation.faithfulrag-zhang-2025","source_sha256":"d7d4f77a15d7e0991cdfafbe0a6309e4aa0002d2f20759d8f3445add7d836ad2","start":3006}],"target_id":"claim.citation.faithfulrag-conflict","target_kind":"node","target_sha256":"c0620bfef9a19464205f39e808cd75cad88094d46c83ba409f8b521ac3ae86ef"}],"claim.citation.finegrained-labels":[{"id":"assert.citation.finegrained-labels","scope":{"assumptions":"Three-category support classification defined by study design","population":"Generated-text citations evaluated in the comparative framework","quantifiers":"three categories","time":null,"uncertainty":null,"units":"categorical support level"},"statement":"Zhang et al. (2024) propose evaluating citation faithfulness metrics against three support levels: full, partial, and no support.","support":[{"end":2792,"quote":"we propose a comparative evaluation framework that assesses the metric effectiveness in distinguishing citations between three-category support levels: full, partial, and no support.","source_id":"src.citation.finegrained-zhang-2024","source_sha256":"4d91c9fea74783c28975ba4813982935621849edd327470c88ca8630c2a82611","start":2610}],"target_id":"claim.citation.finegrained-labels","target_kind":"node","target_sha256":"f86f5255392cc3aaab09ef6e778f95162acdd8b0d28ffc4a8a96f343f6a860da"}],"claim.citation.finegrained-metrics":[{"id":"assert.citation.finegrained-metrics","scope":{"assumptions":"Limited to the evaluations performed in this paper","population":"Metrics and evaluations in the authors’ comparative framework","quantifiers":"no single metric consistently excels","time":null,"uncertainty":null,"units":null},"statement":"Zhang et al. (2024) report that no single citation-faithfulness metric consistently performs best across their fine-grained evaluations.","support":[{"end":3110,"quote":"Our results show no single metric consistently excels across all evaluations, revealing the complexity of assessing fine-grained support.","source_id":"src.citation.finegrained-zhang-2024","source_sha256":"4d91c9fea74783c28975ba4813982935621849edd327470c88ca8630c2a82611","start":2973}],"target_id":"claim.citation.finegrained-metrics","target_kind":"node","target_sha256":"99655de7004ffbcfbacfe29cdc7e1ded36fde4041df592e1ed5dd4ea88d38647"}],"claim.citation.mirage-attribution":[{"id":"assert.citation.mirage-attribution","scope":{"assumptions":"Saliency-based attribution is a method, not proof of complete causal dependence","population":"Retrieval-augmented question-answering systems in the authors’ method","quantifiers":"method proposal","time":null,"uncertainty":null,"units":null},"statement":"Qi et al. (2024) describe MIRAGE as identifying context-sensitive answer tokens and attributing them to retrieved documents using saliency methods.","support":[{"end":2712,"quote":"MIRAGE detects context-sensitive answer tokens and pairs them with retrieved documents contributing to their prediction via saliency methods.","source_id":"src.citation.mirage-qi-2024","source_sha256":"05445789343607d347d73895c439110f5208cb44c6e904f71e4d0695e0765d71","start":2571}],"target_id":"claim.citation.mirage-attribution","target_kind":"node","target_sha256":"801b5f5fa8889b30f4c19e4fb0ed282ac36e5ce18e18b5076808688ec14aa1ea"}],"claim.des-y6-weak-evolving-dark-energy-preference-reported":[{"id":"assert.claim.des-y6-weak-evolving-dark-energy-preference-reported.v1","scope":{"assumptions":"The analysis assumes a time-dependent dark-energy equation of state and uses the probe combinations and omission tests described by the DES Collaboration.","population":"The dark-energy probe combinations analyzed in the full six-year Dark Energy Survey study described by the retained source.","quantifiers":"Restricted to the analyzed probe combinations in the retained source; the reported deviation significance spans 2.3 to 3.2 sigma across the stated leave-one-probe-out tests.","time":"The retained source reports the full six-year Dark Energy Survey analysis; atlas chronology is left unresolved under era=undated.","uncertainty":"The collaboration explicitly describes the result as a weak preference; the represented claim does not assert discovery of evolving dark energy or falsification of a cosmological constant.","units":"sigma significance"},"statement":"The DES Collaboration reported that its analyzed probe combinations supported a weak preference for evolving dark energy, with the significance of deviation from a cosmological constant ranging from 2.3 to 3.2 sigma when individual probes were left out.","support":[{"end":4499,"quote":"We systematically investigate the impact of leaving out each one of the probes and find that the significance of the deviation from a cosmological constant ranges from 2.3 to 3.2$\\sigma$, with best-fit parameters consistently in the region $w_0 >-1$ and $w_a <0$.","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":4236},{"end":4783,"quote":"These results support the weak preference for evolving dark energy reported by several recent cosmological analyses.","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":4667},{"end":5103,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.physical.des-y6-dynamical-dark-energy-2026","source_sha256":"c208671b1ff6ccbb46d32a1df04d13ee75656911dd59977ec3ab80b707e0ebf6","start":5041}],"target_id":"claim.des-y6-weak-evolving-dark-energy-preference-reported","target_kind":"node","target_sha256":"a0427585bb444d1f3c2eb4d59d00020ceedca3c4b9dc07c428e988a653cf0c95"}],"claim.desi-dr2-bao-consistency-reported":[{"id":"assert.claim.desi-dr2-bao-consistency-reported-v4","scope":{"assumptions":"Consistency and matching are attributed only to the DESI Collaboration's stated comparisons in the retained source; the supernova comparison is limited to the same redshift range.","population":"DESI DR2 BAO results and their reported comparisons with DESI DR1, SDSS, and recent supernova compilations over the same redshift range.","quantifiers":"Restricted to the reported DESI DR2 comparisons with DESI DR1 and SDSS and to the stated supernova distance-redshift relationship over the same redshift range.","time":"The reported DESI DR2 BAO measurements are based on three years of operation. Atlas chronological placement remains unresolved under era=undated.","uncertainty":"This source-attributed comparison does not assert agreement among all cosmological datasets, establish a unique cosmological model, resolve the nature of dark energy, or claim current-frontier standing.","units":null},"statement":"The retained DESI DR2 source reports that its BAO results are consistent with DESI DR1 and SDSS, and that their distance-redshift relationship matches recent supernova compilations over the same redshift range.","support":[{"end":3594,"quote":"We present baryon acoustic oscillation (BAO) measurements from more than 14 million galaxies and quasars drawn from the Dark Energy Spectroscopic Instrument (DESI) Data Release 2 (DR2), based on three years of operation.","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3374},{"end":3923,"quote":"The DR2 BAO results are consistent with DESI DR1 and SDSS, and their distance-redshift relationship matches those from recent compilations of supernovae (SNe) over the same redshift range.","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3735},{"end":5524,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.de.desi-dr2-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":5462}],"target_id":"claim.desi-dr2-bao-consistency-reported","target_kind":"node","target_sha256":"92676e2c79966b53dde93157e4ec4cfc396dc0a2e302132081dabf0558879292"}],"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported":[{"id":"assert.claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported.v1","scope":{"assumptions":"The statement is conditional on the DESI DR2 BAO cosmological analysis and its comparison with CMB-determined parameters described by the collaboration.","population":"The DESI DR2 baryon acoustic oscillation measurements and the cosmological parameter comparison described in the retained source.","quantifiers":"Restricted to the reported DESI DR2 BAO results and the stated 2.3-sigma BAO-CMB parameter tension.","time":"The retained source reports DESI DR2 results based on three years of operation; atlas chronology is left unresolved under era=undated.","uncertainty":"The source characterizes the tension as mild and does not establish that flat LambdaCDM is falsified or that a dynamical-dark-energy interpretation is uniquely correct.","units":"sigma significance"},"statement":"DESI reported that its DR2 BAO results were well described by a flat LambdaCDM model while the parameters preferred by BAO were in mild 2.3-sigma tension with those determined from the CMB.","support":[{"end":4236,"quote":"The results are well described by a flat $\\Lambda$CDM model, but the parameters preferred by BAO are in mild, $2.3\\sigma$ tension with those determined from the cosmic microwave background (CMB), although the DESI results are consistent with the acoustic angular scale $\\theta_*$ that is well-measured by Planck.","source_id":"src.physical.desi-dr2-dark-energy-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":3924},{"end":5524,"quote":"Subjects:\nCosmology and Nongalactic Astrophysics (astro-ph.CO)","source_id":"src.physical.desi-dr2-dark-energy-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":5462}],"target_id":"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported","target_kind":"node","target_sha256":"fd2026dbb9e169a007f8e03adb7be01d402116a38b3f8f37bfbbbae4f4b44a18"}],"claim.experimental-method.nist-balanced-blocks":[{"id":"assertion.experimental-method.nist-balanced-blocks","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST definition of blocking","quantifiers":"Equal counts at nuisance-factor levels","time":null,"uncertainty":"Applies to its balanced design description.","units":null},"statement":"NIST defines a blocking factor by equal occurrence of each primary-factor level at each nuisance-factor level.","support":[{"end":1661,"quote":"A nuisance factor is used as a blocking factor if every level of\nthe primary factor occurs the same number of times with each level of\nthe nuisance factor","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1507}],"target_id":"claim.experimental-method.nist-balanced-blocks","target_kind":"node","target_sha256":"939df796b5484febfad96017716733236b22cecd4a4a177b397dcd93d8e110f9"}],"claim.experimental-method.nist-controlled-blocking":[{"id":"assertion.experimental-method.nist-controlled-blocking","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST randomized block design","quantifiers":"Within each block","time":null,"uncertainty":"Applicable to controllable nuisance factors.","units":null},"statement":"NIST describes blocking as holding nuisance factors constant inside homogeneous blocks while varying the factor of interest.","support":[{"end":1258,"quote":"The basic concept\nis to create homogeneous blocks in which the nuisance factors are held\nconstant and the factor of interest is allowed to vary.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1114}],"target_id":"claim.experimental-method.nist-controlled-blocking","target_kind":"node","target_sha256":"48d5b635b456c89fbdb7564f416445bb25bec8828316779f749ac1c22bf96fc1"}],"claim.experimental-method.nist-randomization":[{"id":"assertion.experimental-method.nist-randomization","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST design guidance","quantifiers":"A few important factors; remaining factors","time":null,"uncertainty":"Recommendation, not a universal measured effect.","units":null},"statement":"NIST recommends blocking important nuisance variables and randomizing to reduce contamination by remaining nuisance variables.","support":[{"end":2113,"quote":"Blocking is used to remove the effects of a few of the most important\nnuisance variables.  Randomization is then used to reduce the\ncontaminating effects of the remaining nuisance variables.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":1923}],"target_id":"claim.experimental-method.nist-randomization","target_kind":"node","target_sha256":"51acefcb18f12cc093e1fe46cac6b8caaa07e2ff3379450cf21747752ce45556"}],"claim.experimental-method.nist-wafer-example":[{"id":"assertion.experimental-method.nist-wafer-example","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NIST illustrative semiconductor experiment","quantifiers":"4 dosages; 3 furnace runs","time":null,"uncertainty":"Proposed allocation, not an observed result.","units":"wafers; furnace runs"},"statement":"NIST illustrates a hypothetical design putting four wafers with different dosages in each of three furnace runs.","support":[{"end":4525,"quote":"The blocked way to run this\nexperiment, assuming you can convince manufacturing to let you put four\nexperimental wafers in a furnace run, would be to put four wafers with\ndifferent dosages in each of three furnace runs.  The only randomization\nwould be choosing which of the three wafers with dosage 1 would go into\nfurnace run 1, and similarly for the wafers with dosages 2, 3 and 4.","source_id":"src.experimental-method.nist-randomized-block-designs","source_sha256":"d3cc82aed5a37b78dba4a7e98d990828ce0e4e8181f198d79bed52ac1899eaa4","start":4141}],"target_id":"claim.experimental-method.nist-wafer-example","target_kind":"node","target_sha256":"4bbea5d1564649eb93865121c14c0d58dc1a7bce093902bcd1156652a62526de"}],"claim.experimental-method.nosek-all-results":[{"id":"assertion.experimental-method.nosek-all-results","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Research-program methodology discussion","quantifiers":"All planned outcomes","time":"2018","uncertainty":"No universal effect-size estimate.","units":null},"statement":"Nosek et al. argue that reporting all planned outcomes matters because preregistration alone cannot eliminate multiple-comparison and selective-reporting problems.","support":[{"end":32609,"quote":"Not only is it essential that the analysis plan be defined blind to the research outcomes, all outcomes of that analysis plan must be reported to avoid the problem of selective reporting.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":32422},{"end":33069,"quote":"Preregistration does not eliminate the challenge of multiple comparisons or selective reporting across studies, but it does make it possible to effectively correct for multiple comparisons with full reporting.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":32860}],"target_id":"claim.experimental-method.nosek-all-results","target_kind":"node","target_sha256":"280fa2c9423a3f04ced87f2196d7ec6522bb887ce9c77133b9f5bf595fd1a15a"}],"claim.experimental-method.nosek-decisiontree":[{"id":"assertion.experimental-method.nosek-decisiontree","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Hypothetical stopping-rule example","quantifiers":"Threshold <0.05","time":"2018","uncertainty":"Hypothetical risk, not observed misuse frequency.","units":"p-value"},"statement":"Nosek et al. warn that preregistered decision trees can still embed bias, such as stopping after achieving p < 0.05.","support":[{"end":25701,"quote":"However, it is possible to preregister biases into decision trees. For example, one could preregister testing a sequence of exclusion rules and stopping when one achieves\nP\n< 0.05. On the positive side, this misbehavior is highly detectable; on the negative side, it invalidates the diagnosticity of statistical inference. Preregistration does not eliminate the possibility of poor statistical practices, but it does make them detectable.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":25263}],"target_id":"claim.experimental-method.nosek-decisiontree","target_kind":"node","target_sha256":"de1eb72185bf2b64e2bd15564dc57b4e07398f052115c9278df575089815744b"}],"claim.experimental-method.nosek-forking":[{"id":"assertion.experimental-method.nosek-forking","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"NHST postdiction in the 2018 article","quantifiers":"No prevalence estimate","time":"2018","uncertainty":"Methodological warning, not a measured prevalence.","units":null},"statement":"Nosek et al. warn that postdictive NHST analyses may yield p-values of unknown diagnosticity.","support":[{"end":15186,"quote":"This leaves the observed\nP\nvalues with unknown diagnosticity, rendering them uninterpretable. In other words, NHST cannot be used with confidence for postdiction.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":15024}],"target_id":"claim.experimental-method.nosek-forking","target_kind":"node","target_sha256":"428b80f917ac0ecff563095e7e5e22e72875455bc1acef4ffd92c41b90246d5e"}],"claim.experimental-method.nosek-holdout":[{"id":"assertion.experimental-method.nosek-holdout","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Proposed blinded holdout strategy","quantifiers":"Two data partitions","time":"2018","uncertainty":"Requires genuine holdout blinding.","units":null},"statement":"Nosek et al. describe splitting a dataset, sealing the holdout and preregistering exploration-derived predictions before unsealing it.","support":[{"end":35744,"quote":"In a process known as cross-validation, the dataset is split in two.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":35676},{"end":36067,"quote":"Sealing a dataset and preregistering the outcomes of the discovery process before unsealing converts postdictions from the initial dataset to predictions for the holdout dataset.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":35889}],"target_id":"claim.experimental-method.nosek-holdout","target_kind":"node","target_sha256":"57c01e6254ee5852e96aefbbee24dfbab8690d207cc3b970d97b09851c075750"}],"claim.experimental-method.nosek-preexisting":[{"id":"assertion.experimental-method.nosek-preexisting","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Preexisting datasets in the 2018 article","quantifiers":"Conditional on blinding","time":"2018","uncertainty":"Risk varies with knowledge of prior observations.","units":null},"statement":"Nosek et al. explain that tests of predictions using preexisting data depend on blinded analysis decisions, which face risks when data have already been observed.","support":[{"end":27103,"quote":"The extent to which testing predictions is possible on preexisting data depends on whether decisions about the analysis plan are blind to the data.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":26956},{"end":27473,"quote":"However, once the data have been observed, there are inevitable risks for blinding.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":27390}],"target_id":"claim.experimental-method.nosek-preexisting","target_kind":"node","target_sha256":"0736e5318e4fe920a4c02bc169d72bb499cc31d3fab260245a7e22b66c1deef8"}],"claim.experimental-method.nosek-prereg-evidence":[{"id":"assertion.experimental-method.nosek-prereg-evidence","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Authors' 2018 evidence assessment","quantifiers":"Evidence assessment as of 2018","time":"2018","uncertainty":"Time-bound; says nothing about later studies.","units":null},"statement":"Nosek et al. (2018) report theoretical and correlational support for preregistration but insufficient experimental evidence of a reproducibility advantage.","support":[{"end":18160,"quote":"We say “in principle” because the case for preregistration is theoretically strong as a matter of inductive inference and empirically bolstered by some correlational evidence. However, there is not yet sufficient experimental evidence establishing its superiority for reproducibility.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":17876}],"target_id":"claim.experimental-method.nosek-prereg-evidence","target_kind":"node","target_sha256":"e78745768c9278d8762845476c5c924dd24d6c3726694c02b103932ac3a241f1"}],"claim.experimental-method.nosek-preregistration":[{"id":"assertion.experimental-method.nosek-preregistration","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"2018 preregistration article","quantifiers":"Before observing outcomes","time":"2018","uncertainty":"Definition, not a measured outcome.","units":null},"statement":"Nosek et al. (2018) define analysis preregistration as committing to analytic steps without prior knowledge of outcomes.","support":[{"end":17102,"quote":"Preregistration of an analysis plan is committing to analytic steps without advance knowledge of the research outcomes.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":16983}],"target_id":"claim.experimental-method.nosek-preregistration","target_kind":"node","target_sha256":"bc563358a29c028dafcf2fcb8559994c62e0c1f5d0f43ce2a47aa98eb9d8db67"}],"claim.experimental-method.nosek-registered-reports":[{"id":"assertion.experimental-method.nosek-registered-reports","scope":{"assumptions":"Source-attributed, not independently established as universal.","population":"Registered Reports editorial process in 2018","quantifiers":"Two review stages","time":"2018","uncertainty":"Described workflow, not universal journal policy.","units":null},"statement":"Nosek et al. describe Registered Reports as pre-outcome methodological peer review with in-principle acceptance, followed by review of execution and adherence.","support":[{"end":44123,"quote":"With Registered Reports, authors submit their research question and methodology to the journal for peer review before observing the outcomes of the research. If reviewers agree that the question is sufficiently important and the methodology to test it is of sufficiently high quality, then the paper is given in-principle acceptance.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":43790},{"end":44394,"quote":"At second-stage review, reviewers do not evaluate the perceived importance of the outcomes. Rather, they evaluate the quality of study execution and adherence to the preregistered plan.","source_id":"src.experimental-method.nosek-preregistration-2018","source_sha256":"19c6a097a0aeed56ed4975e22c0a73313037d949c459127c15d73e8cae2d8da4","start":44209}],"target_id":"claim.experimental-method.nosek-registered-reports","target_kind":"node","target_sha256":"b81478338f5f842bcb612bc71e70912e909580e35472a3b70893c6a267f61229"}],"claim.fermi-gbm-detection-coverage":[{"id":"assertion.fermi-gbm-detection-coverage","scope":{"assumptions":"The instrument configuration and approximate annual detection rate are taken from NASA's description.","population":"Fermi Gamma-ray Burst Monitor instrumentation and its reported gamma-ray burst detections","quantifiers":"12 sodium iodide detectors and 2 bismuth germinate detectors","time":"Period represented by the NASA source; no explicit annual reference interval in the excerpt","uncertainty":"Approximately 240 detections per year; the passage does not establish a current 2026 operational rate.","units":"14 detectors; approximately 240 bursts/year; 8 keV to 40 MeV"},"statement":"NASA describes the Fermi Gamma-ray Burst Monitor as having 14 detectors covering the unobscured sky, detecting approximately 240 gamma-ray bursts per year across an energy range of 8 keV to 40 MeV.","support":[{"end":3476,"quote":"The Gamma-ray Burst Monitor (GBM) has 14 detectors (12 lower-energy sodium iodide crystal scintillators, 2 higher-energy bismuth germinate scintillators) that together cover the full unocculted sky and detect ~240 bursts per year with spectral coverage from 8 keV - 40 MeV.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":3203}],"target_id":"claim.fermi-gbm-detection-coverage","target_kind":"node","target_sha256":"c19349843671a7cf8e60fa0e8b193e5f9051d5dfd4b9a86616c4ddc266806fe0"}],"claim.frontier.arxiv-2604-22459":[{"id":"assertion.claim.frontier.arxiv-2604-22459","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2604.22459","quantifiers":"Only what the quoted sentence states","time":"2026-04-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2604.22459 \"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic\" (CC BY 4.0, submitted 2026-04-24) reports: \"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.\"","support":[{"end":2454,"quote":"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":2343},{"end":989,"quote":"<created>2026-04-24</created>","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":960},{"end":1635,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2604-22459","source_sha256":"173488d58fba165919934a7f90e73df98eb14a3ae979893ac91c75503bfe84dd","start":1573}],"target_id":"claim.frontier.arxiv-2604-22459","target_kind":"node","target_sha256":"2902e92b6a0141b15413a099e2358d571f74da41017d125410afe02fc8feefd5"}],"claim.frontier.arxiv-2607-03479":[{"id":"assertion.claim.frontier.arxiv-2607-03479","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.03479","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.03479 \"The multilinear forms Cayley graph and the eigenvalue method for tensor codes\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.\"","support":[{"end":2905,"quote":"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":2723},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":1048},{"end":2025,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-03479","source_sha256":"89036bf280ebfcfb3c23eae8cb8a422d0071fc2508a76957fa4ef6402150fd9b","start":1963}],"target_id":"claim.frontier.arxiv-2607-03479","target_kind":"node","target_sha256":"b0c03a5126d1b2c3feb93b2092dd4bcf890b25f87ecf045c0d97e20c9e6ab7b4"}],"claim.frontier.arxiv-2607-05485":[{"id":"assertion.claim.frontier.arxiv-2607-05485","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.05485","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.05485 \"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.\"","support":[{"end":2194,"quote":"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":2102},{"end":1088,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":1059},{"end":1967,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-05485","source_sha256":"a4496c8be0b45ff9ace75f3240f606130a1c1b68034a13182a24191464d8c7a9","start":1905}],"target_id":"claim.frontier.arxiv-2607-05485","target_kind":"node","target_sha256":"44b95790ed2e8f4eee9b599f1a63fdabff9040e3da919d49c6caa4f3c6e5fe3b"}],"claim.frontier.arxiv-2607-05687":[{"id":"assertion.claim.frontier.arxiv-2607-05687","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.05687","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.05687 \"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.\"","support":[{"end":2572,"quote":"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":2368},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":1008},{"end":1943,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-05687","source_sha256":"bf3c82433fca995df053226ab6e4868d4298d780d052b86b03b73de0a33aee18","start":1881}],"target_id":"claim.frontier.arxiv-2607-05687","target_kind":"node","target_sha256":"c3bbe5126f3550eeaeabc47ca3b89fed690b213772890cc080fb807832eeb1fb"}],"claim.frontier.arxiv-2607-06237":[{"id":"assertion.claim.frontier.arxiv-2607-06237","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.06237","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.06237 \"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems\" (CC BY 4.0, submitted 2026-07-24) reports: \"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.\"","support":[{"end":3574,"quote":"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":3416},{"end":1033,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":1004},{"end":1829,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-06237","source_sha256":"9e562e4fb9e595f8efc8cbda61ba547895f54f7183448cd1c65a3847254cacd2","start":1767}],"target_id":"claim.frontier.arxiv-2607-06237","target_kind":"node","target_sha256":"97e291662c0b134cbd315a1e93621558c10ba6a8c05fea30327497589417222e"}],"claim.frontier.arxiv-2607-10561":[{"id":"assertion.claim.frontier.arxiv-2607-10561","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.10561","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.10561 \"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.\"","support":[{"end":2187,"quote":"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1993},{"end":1140,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1111},{"end":1734,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-10561","source_sha256":"ca8cb99e219df475d2378981dfc4b33ed3a486435ceb404ca1dfbbdf07aa0a5d","start":1672}],"target_id":"claim.frontier.arxiv-2607-10561","target_kind":"node","target_sha256":"5974c639bde750e056090e12c0792f4f1ff0564f5eb34480df4a23bf7fc8998b"}],"claim.frontier.arxiv-2607-11988":[{"id":"assertion.claim.frontier.arxiv-2607-11988","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.11988","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.11988 \"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory\" (CC BY 4.0, submitted 2026-07-31) reports: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","support":[{"end":2073,"quote":"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1881},{"end":1173,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1144},{"end":1679,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-11988","source_sha256":"eb67c8adb666e277e8b66c930d67d8490fba012629be0c5f2dd1b1e44bba281a","start":1617}],"target_id":"claim.frontier.arxiv-2607-11988","target_kind":"node","target_sha256":"b30c08878e6d2f9dfbe1bb6d430a58f13d85ad84867f2534340f1b6ef1a99a09"}],"claim.frontier.arxiv-2607-12128":[{"id":"assertion.claim.frontier.arxiv-2607-12128","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.12128","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.12128 \"Categorical Tensor-Graph Semantics for Quantum Algorithms\" (CC BY 4.0, submitted 2026-07-27) reports: \"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.\"","support":[{"end":3031,"quote":"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":2932},{"end":1132,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":1103},{"end":2087,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-12128","source_sha256":"030d9b3f91ff1274dc4176442e1c70b96fad2d296f6fb362bb4e21c88ce8308f","start":2025}],"target_id":"claim.frontier.arxiv-2607-12128","target_kind":"node","target_sha256":"760d4551719f2933a8791651dc8981172a51955a7cc76155fdb6df27403273a1"}],"claim.frontier.arxiv-2607-12710":[{"id":"assertion.claim.frontier.arxiv-2607-12710","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.12710","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.12710 \"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.\"","support":[{"end":1761,"quote":"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1606},{"end":1055,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1026},{"end":1536,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-12710","source_sha256":"a9d981af7190b43678b572edb1fa4a0ead41d6d005289bf3f4e3e3cffd0a73ac","start":1474}],"target_id":"claim.frontier.arxiv-2607-12710","target_kind":"node","target_sha256":"95763969701fe9f39dc29ab62142d132b58ac56e963b03c2146c27deea5b9745"}],"claim.frontier.arxiv-2607-13775":[{"id":"assertion.claim.frontier.arxiv-2607-13775","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.13775","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.13775 \"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime\" (CC0 1.0, submitted 2026-07-28) reports: \"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.\"","support":[{"end":2694,"quote":"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":2502},{"end":1084,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":1055},{"end":1719,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-13775","source_sha256":"8d9e6dd0a45750dfbbead227263aa6d6956496772e2b0fa71e69e18c25f8c90d","start":1651}],"target_id":"claim.frontier.arxiv-2607-13775","target_kind":"node","target_sha256":"0a7c2babd9cb8e6cf28aa15bbe63e55f41355b126932388466bc84dcb3877073"}],"claim.frontier.arxiv-2607-13855":[{"id":"assertion.claim.frontier.arxiv-2607-13855","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.13855","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.13855 \"Inferentialist Game Semantics (Extended Abstract)\" (CC BY 4.0, submitted 2026-07-22) reports: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","support":[{"end":2961,"quote":"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":2746},{"end":1033,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":1004},{"end":1780,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-13855","source_sha256":"6a0aa2acbb9c72d61ab3c3dc800403e48c29e51a1aa7b9e5a5d567edfb69bec4","start":1718}],"target_id":"claim.frontier.arxiv-2607-13855","target_kind":"node","target_sha256":"63bd9f7cb7fe0e014bdb927b6a643d6b39dff8de8cd7e9769a686bc4b95e64b4"}],"claim.frontier.arxiv-2607-14144":[{"id":"assertion.claim.frontier.arxiv-2607-14144","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.14144","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"","support":[{"end":3703,"quote":"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.","source_id":"source.frontier.arxiv-2607-14144","source_sha256":"9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f","start":3465},{"end":1073,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-14144","source_sha256":"9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f","start":1044},{"end":2449,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-14144","source_sha256":"9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f","start":2387}],"target_id":"claim.frontier.arxiv-2607-14144","target_kind":"node","target_sha256":"ec328db9ea9fa05f78e82e06ffa78077eea48cf02291ed634c20ee162f41cd4f"}],"claim.frontier.arxiv-2607-15029":[{"id":"assertion.claim.frontier.arxiv-2607-15029","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15029","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15029 \"Towards realistic large random models of labeled transition systems and their 0-1 laws\" (CC BY 4.0, submitted 2026-07-21) reports: \"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).\"","support":[{"end":2622,"quote":"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":2398},{"end":1077,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":1048},{"end":1562,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-15029","source_sha256":"067982ff6bbf92dbc4285db2eae287a17552b22fc577729bfa89bb4fda0a494d","start":1500}],"target_id":"claim.frontier.arxiv-2607-15029","target_kind":"node","target_sha256":"d2a09d9bce87ded6cd9d6ef864df336eac85311751b2a3489aeb191d767ce429"}],"claim.frontier.arxiv-2607-15664":[{"id":"assertion.claim.frontier.arxiv-2607-15664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15664","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15664 \"Semantics for the minimal well-determined logic\" (CC0 1.0, submitted 2026-07-17) reports: \"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.\"","support":[{"end":2715,"quote":"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":2519},{"end":993,"quote":"<created>2026-07-17</created>","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":964},{"end":1573,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-15664","source_sha256":"26bb8b5253272ac6fca1329c968af5f62b8628151f6fd9a5bc3a44b5e448761c","start":1505}],"target_id":"claim.frontier.arxiv-2607-15664","target_kind":"node","target_sha256":"dd478979ad1495825c4c4005ae4d3fc4baad13746d78dd80909e4a208c27eb4b"}],"claim.frontier.arxiv-2607-15958":[{"id":"assertion.claim.frontier.arxiv-2607-15958","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.15958","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.15958 \"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle\" (CC BY 4.0, submitted 2026-07-17) reports: \"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.\"","support":[{"end":2552,"quote":"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":2314},{"end":993,"quote":"<created>2026-07-17</created>","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":964},{"end":1935,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-15958","source_sha256":"7c5e7ed5557c65b1f7ea291598300bf5cddeb7129989c837bcabcaf209a7747b","start":1873}],"target_id":"claim.frontier.arxiv-2607-15958","target_kind":"node","target_sha256":"99a8429220fc68f6f5c8c691060184437510c7b27fe78be042b3a41f86e2b9cb"}],"claim.frontier.arxiv-2607-16724":[{"id":"assertion.claim.frontier.arxiv-2607-16724","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.16724","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.16724 \"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers\" (CC BY 4.0, submitted 2026-07-24) reports: \"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.\"","support":[{"end":2953,"quote":"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":2770},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":964},{"end":1522,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-16724","source_sha256":"ce8e1fda8e9710a0eefaa9babdbc034384444490c1f66ddb9d6ad4f50a465855","start":1460}],"target_id":"claim.frontier.arxiv-2607-16724","target_kind":"node","target_sha256":"5b0e117ec7b7d8613093df4524d8ec78b3eaa525dc35ef42f38483aec6233c8e"}],"claim.frontier.arxiv-2607-16747":[{"id":"assertion.claim.frontier.arxiv-2607-16747","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.16747","quantifiers":"Only what the quoted sentence states","time":"2026-07-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.16747 \"More on the Boolean Prime Ideal Theorem\" (CC BY 4.0, submitted 2026-07-18) reports: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","support":[{"end":1792,"quote":"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":1627},{"end":993,"quote":"<created>2026-07-18</created>","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":964},{"end":1604,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-16747","source_sha256":"5822a3a08064c6d2692f7a902f871c3c10ad4ef72f0f0fc55f412f9283e3f773","start":1542}],"target_id":"claim.frontier.arxiv-2607-16747","target_kind":"node","target_sha256":"76c0c4f006004b63dd18d2532f3eeae251b7ead0eab61f56d845afc3bcb304e7"}],"claim.frontier.arxiv-2607-17248":[{"id":"assertion.claim.frontier.arxiv-2607-17248","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.17248","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"","support":[{"end":3897,"quote":"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.","source_id":"source.frontier.arxiv-2607-17248","source_sha256":"634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029","start":3687},{"end":1033,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-17248","source_sha256":"634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029","start":1004},{"end":2270,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-17248","source_sha256":"634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029","start":2208}],"target_id":"claim.frontier.arxiv-2607-17248","target_kind":"node","target_sha256":"1fdd859155a6a88a26146ead48d0b0144682e4825cf11c0b2bbee433a92a3008"}],"claim.frontier.arxiv-2607-18525":[{"id":"assertion.claim.frontier.arxiv-2607-18525","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18525","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18525 \"Regular Ultrametric Skeletons\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","support":[{"end":2043,"quote":"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":1811},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":964},{"end":1514,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18525","source_sha256":"00829fff296e6a36dc9dc7830de35099d92d3cbe9f838172cb823ca223066fa3","start":1452}],"target_id":"claim.frontier.arxiv-2607-18525","target_kind":"node","target_sha256":"d10a1cbce5f15a9631ea81f36a44b790dced8a854ce2bc77cb7d719c3651cd19"}],"claim.frontier.arxiv-2607-18781":[{"id":"assertion.claim.frontier.arxiv-2607-18781","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18781","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18781 \"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization\" (CC BY 4.0, submitted 2026-07-21) reports: \"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.\"","support":[{"end":2657,"quote":"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":2455},{"end":993,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":964},{"end":1504,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18781","source_sha256":"2bb7e02ef78ec18018e779a00be78266e507828e65303a100e4757ecfd80c0d1","start":1442}],"target_id":"claim.frontier.arxiv-2607-18781","target_kind":"node","target_sha256":"6555d5385ffe3e08c74e69d4d9adc8305db5541b263e78df7f83f1cff7f96f13"}],"claim.frontier.arxiv-2607-18942":[{"id":"assertion.claim.frontier.arxiv-2607-18942","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.18942","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.18942 \"Bounded elementary extensions of trees with unbounded paths\" (CC BY 4.0, submitted 2026-07-21) reports: \"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.\"","support":[{"end":2313,"quote":"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":2175},{"end":1033,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":1004},{"end":1582,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-18942","source_sha256":"b2a81414b693333ac56367a8e9195186baa96e8d5af993f44f937b0d8828d305","start":1520}],"target_id":"claim.frontier.arxiv-2607-18942","target_kind":"node","target_sha256":"2234a3e297d4ac9435ba3f211e832985a042719225bf03aa9d9371e53789a186"}],"claim.frontier.arxiv-2607-19080":[{"id":"assertion.claim.frontier.arxiv-2607-19080","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19080","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19080 \"The Influence Function of Transport-based Quantiles\" (CC BY 4.0, submitted 2026-07-21) reports: \"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.\"","support":[{"end":2571,"quote":"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":2304},{"end":1081,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":1052},{"end":1983,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19080","source_sha256":"88cddd8ef891cc6fd85183ddfed22fa965dbbc77f0f77622f10676b1e7466fc7","start":1921}],"target_id":"claim.frontier.arxiv-2607-19080","target_kind":"node","target_sha256":"cd9ae3ea6c2485d738685127c5340155d369ae077889af33aec1b527875d055d"}],"claim.frontier.arxiv-2607-19188":[{"id":"assertion.claim.frontier.arxiv-2607-19188","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19188","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19188 \"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques\" (CC BY 4.0, submitted 2026-07-21) reports: \"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.\"","support":[{"end":2514,"quote":"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":2273},{"end":1077,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":1048},{"end":1775,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19188","source_sha256":"b70198e4ccf0e42c47a69c53fb2f8bd3af6e5825020e6a72a67dbcf1d4c8c9e8","start":1713}],"target_id":"claim.frontier.arxiv-2607-19188","target_kind":"node","target_sha256":"3e47aff17c8ad4abb2928717e41554da3859e5bb7454302eed68ebd082c22143"}],"claim.frontier.arxiv-2607-19220":[{"id":"assertion.claim.frontier.arxiv-2607-19220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19220","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19220 \"Quarkyonic Stars with Strangeness\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","support":[{"end":3235,"quote":"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":2973},{"end":1140,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":1111},{"end":2415,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19220","source_sha256":"0ec42af8a6b15f27b22d88062e4c85bf88709ab3090175d3172decf661711a59","start":2353}],"target_id":"claim.frontier.arxiv-2607-19220","target_kind":"node","target_sha256":"842fdf205e0d891e44a403e4a27aa6a4787255be4fa30700cdd652348320c679"}],"claim.frontier.arxiv-2607-19233":[{"id":"assertion.claim.frontier.arxiv-2607-19233","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19233","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19233 \"Vortex-sheet desingularization for three-dimensional ideal fluids\" (CC BY 4.0, submitted 2026-07-21) reports: \"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.\"","support":[{"end":1920,"quote":"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":1815},{"end":993,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":964},{"end":1792,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19233","source_sha256":"e55b91afe11d49e2dd69f6dd745c96e2cc9bdcab665767f9e3821e45db70c0df","start":1730}],"target_id":"claim.frontier.arxiv-2607-19233","target_kind":"node","target_sha256":"4e92a4b625dc94bb33c85c028d394b917ba0e1b6f3c3454e7788370a18a420de"}],"claim.frontier.arxiv-2607-19272":[{"id":"assertion.claim.frontier.arxiv-2607-19272","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19272","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19272 \"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations\" (CC BY 4.0, submitted 2026-07-21) reports: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","support":[{"end":2213,"quote":"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":2039},{"end":1037,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":1008},{"end":1815,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19272","source_sha256":"21f594388310766c92ad60507d25ebcf4b8d8a0763cf5ee62ae54bb864c810fe","start":1753}],"target_id":"claim.frontier.arxiv-2607-19272","target_kind":"node","target_sha256":"c4503e90dca7d56af25048e8e725f9757a3b0b31cfe61d2b94738c4f725792ca"}],"claim.frontier.arxiv-2607-19285":[{"id":"assertion.claim.frontier.arxiv-2607-19285","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19285","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19285 \"Compactification of the fifth Painlevé foliation\" (CC0 1.0, submitted 2026-07-21) reports: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","support":[{"end":1824,"quote":"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1670},{"end":1040,"quote":"<created>2026-07-21</created>","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1011},{"end":1478,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-19285","source_sha256":"0970f00b2f039bc3cc2e90a6186d1c1bb4ddb980b50ac3ee739b042a47ee11b1","start":1410}],"target_id":"claim.frontier.arxiv-2607-19285","target_kind":"node","target_sha256":"9fd730782670feb80201b45fc0bd5cf8b405d499af0d924b02074f970ceec403"}],"claim.frontier.arxiv-2607-19654":[{"id":"assertion.claim.frontier.arxiv-2607-19654","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19654","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19654 \"Derived representation schemes with arbitrary coefficients and associative smoothness\" (CC BY 4.0, submitted 2026-07-22) reports: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","support":[{"end":1946,"quote":"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1793},{"end":1125,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1096},{"end":1646,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19654","source_sha256":"a3edecc91136ecaeb42d0b32c7c7b089534453aada3a845f7450705a83e93663","start":1584}],"target_id":"claim.frontier.arxiv-2607-19654","target_kind":"node","target_sha256":"65e8359441c6583c82ae7dbb71d80427dfe53f01c289f37424e74d75520ed916"}],"claim.frontier.arxiv-2607-19946":[{"id":"assertion.claim.frontier.arxiv-2607-19946","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.19946","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.19946 \"The chromatic number of Euclidean space with dense color classes\" (CC BY 4.0, submitted 2026-07-22) reports: \"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.\"","support":[{"end":2159,"quote":"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":1986},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":964},{"end":1676,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-19946","source_sha256":"426fbd9ac56d1660d419f596bffbbab024d5ec183a2ef8661230b5a1ba27b906","start":1614}],"target_id":"claim.frontier.arxiv-2607-19946","target_kind":"node","target_sha256":"8e7e6ebeddf6a929ed8dfc3f8c254a33878b0a2560077756181ea3e4203ea524"}],"claim.frontier.arxiv-2607-20049":[{"id":"assertion.claim.frontier.arxiv-2607-20049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20049","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20049 \"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots\" (CC BY 4.0, submitted 2026-07-23) reports: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","support":[{"end":2074,"quote":"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1913},{"end":1081,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1052},{"end":1720,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20049","source_sha256":"a66d8499e06bb3e910cd7c3c136d0e55e6630d1a30b0c107879fd5c9c3473ec3","start":1658}],"target_id":"claim.frontier.arxiv-2607-20049","target_kind":"node","target_sha256":"397193d7fe7728ad2e4b2c92654aa47153d96a4ec1d0a9ed2dadfe6b30de0567"}],"claim.frontier.arxiv-2607-20063":[{"id":"assertion.claim.frontier.arxiv-2607-20063","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20063","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20063 \"Null distance on cosmological spacetimes and monotone convergence\" (CC BY 4.0, submitted 2026-07-22) reports: \"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.\"","support":[{"end":3072,"quote":"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":2793},{"end":1082,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":1053},{"end":1799,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20063","source_sha256":"39fc0edec9dbbdce33195a36c4bdca10d894d5a36ffd2fe8622103f773fdb250","start":1737}],"target_id":"claim.frontier.arxiv-2607-20063","target_kind":"node","target_sha256":"2e9b374060183c4b50bfb7654f26144b958654955494fb2f1d538ffe59832272"}],"claim.frontier.arxiv-2607-20098":[{"id":"assertion.claim.frontier.arxiv-2607-20098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20098","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20098 \"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case\" (CC BY 4.0, submitted 2026-07-22) reports: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","support":[{"end":2396,"quote":"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":2174},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":964},{"end":1716,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20098","source_sha256":"d6f547a1ffa4052c7e1233d031f67d88b2b766da209d3c70ed1853a23ba80b68","start":1654}],"target_id":"claim.frontier.arxiv-2607-20098","target_kind":"node","target_sha256":"95a2cedfa4bbef948da1e9bf7ecb53d192171b4f85d8db62a76a6c3c188cf7f2"}],"claim.frontier.arxiv-2607-20161":[{"id":"assertion.claim.frontier.arxiv-2607-20161","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20161","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20161 \"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","support":[{"end":2459,"quote":"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":2202},{"end":1037,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":1008},{"end":1776,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20161","source_sha256":"aa4b62c65c20c825d3974aaffe6cf5d74ea68798a67d674b0ad75a0005afce25","start":1714}],"target_id":"claim.frontier.arxiv-2607-20161","target_kind":"node","target_sha256":"37243d0b45af27f371cd8245ac4a80162765a48b5bcb0043b8c826106cf99fbb"}],"claim.frontier.arxiv-2607-20164":[{"id":"assertion.claim.frontier.arxiv-2607-20164","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20164","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20164 \"Law of iterated logarithm for inner functions\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.\"","support":[{"end":2133,"quote":"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":2007},{"end":1081,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":1052},{"end":1779,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20164","source_sha256":"ee46a45031f2e1ef6955e983d14447cdc605ef156356502be5cfcbf8f4d3d693","start":1717}],"target_id":"claim.frontier.arxiv-2607-20164","target_kind":"node","target_sha256":"b3ea214f162911c11b50b0e7fefcbb0d835156b5ab25fb4ac8b61a245bf1c683"}],"claim.frontier.arxiv-2607-20407":[{"id":"assertion.claim.frontier.arxiv-2607-20407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20407","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20407 \"Uncountable Abelian Group C*-algebras Fail the Lifting Property\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.\"","support":[{"end":1691,"quote":"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":1551},{"end":993,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":964},{"end":1528,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20407","source_sha256":"d5a0418160fb4b7a519976c83ebca5840c71eac3d7aff64ff6c670753ab375c3","start":1466}],"target_id":"claim.frontier.arxiv-2607-20407","target_kind":"node","target_sha256":"7aab736c3ac77815c528df639644b2b030053ea6272aefa6f29feb86dbdb0684"}],"claim.frontier.arxiv-2607-20677":[{"id":"assertion.claim.frontier.arxiv-2607-20677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.20677","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.20677 \"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.\"","support":[{"end":2499,"quote":"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":2389},{"end":1037,"quote":"<created>2026-07-22</created>","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":1008},{"end":1966,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-20677","source_sha256":"fd1d72de66822642044567620d70128d7a3a73c87f48219f225b73564e598069","start":1904}],"target_id":"claim.frontier.arxiv-2607-20677","target_kind":"node","target_sha256":"872f7f5041897e6a7164798829a30b9a8636066ce8c9b7a48fb4c960c944a406"}],"claim.frontier.arxiv-2607-21030":[{"id":"assertion.claim.frontier.arxiv-2607-21030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21030","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21030 \"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.\"","support":[{"end":2817,"quote":"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":2626},{"end":1040,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":1011},{"end":1617,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21030","source_sha256":"46f3a79ca6265b398c35a01a6c9cb7f0a0f4b08133e51185cd6c27d3bf5b6bb2","start":1555}],"target_id":"claim.frontier.arxiv-2607-21030","target_kind":"node","target_sha256":"db7b0f685b5d642ab59ba8803ce0ab3ec989fe330a5d76651c868b7701842d39"}],"claim.frontier.arxiv-2607-21112":[{"id":"assertion.claim.frontier.arxiv-2607-21112","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21112","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21112 \"Exact ensemble controllability for neural differential equations via neural interpolation\" (CC BY 4.0, submitted 2026-07-23) reports: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","support":[{"end":2459,"quote":"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":2262},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":964},{"end":1496,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21112","source_sha256":"4270d98ab5d8d1a10c28a9388b5e88a32d1ec27ed2f83c71269cf4d77c36bb2d","start":1434}],"target_id":"claim.frontier.arxiv-2607-21112","target_kind":"node","target_sha256":"bb581fa14e3776f72cf3f47386c6ecf41404ef6e69f1e8ae464405a9a760ae07"}],"claim.frontier.arxiv-2607-21167":[{"id":"assertion.claim.frontier.arxiv-2607-21167","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21167","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21167 \"Differentiability of the operator norm on $\\ell_p$ spaces\" (CC BY 4.0, submitted 2026-07-23) reports: \"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.\"","support":[{"end":2078,"quote":"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":1878},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":964},{"end":1698,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21167","source_sha256":"a425b29be8df6d088db6290feb0f575bac52be974dcfa0f46b05894afa8e532a","start":1636}],"target_id":"claim.frontier.arxiv-2607-21167","target_kind":"node","target_sha256":"a6448373cb227147b49a7dee1938f1e18c49cd6698bc317d3a33570558ccc02f"}],"claim.frontier.arxiv-2607-21191":[{"id":"assertion.claim.frontier.arxiv-2607-21191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21191","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21191 \"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB\" (CC BY 4.0, submitted 2026-07-23) reports: \"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.\"","support":[{"end":2408,"quote":"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":2265},{"end":1069,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":1040},{"end":2059,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21191","source_sha256":"f21598def2c2e2b6fdf7d89ade6671a13c8d611dd54052c5b209b22a3ab2b0af","start":1997}],"target_id":"claim.frontier.arxiv-2607-21191","target_kind":"node","target_sha256":"f779c4aa6df40c68ba966415b2dbc3960be0fc8f23bb2a6200c1028da550ac86"}],"claim.frontier.arxiv-2607-21320":[{"id":"assertion.claim.frontier.arxiv-2607-21320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21320","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21320 \"Post Completeness in Conditional Logic\" (CC BY 4.0, submitted 2026-07-23) reports: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","support":[{"end":1925,"quote":"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson&#39;s embedding theorems.","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":1778},{"end":993,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":964},{"end":1556,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21320","source_sha256":"8e4732c181e963a1759082cab90b8264a802926df796b3ff211c0314bda0d97e","start":1494}],"target_id":"claim.frontier.arxiv-2607-21320","target_kind":"node","target_sha256":"be5d3d11ab87db938fecda54dd4be67b03090dc1d58a717043e76a08ce3c56a9"}],"claim.frontier.arxiv-2607-21474":[{"id":"assertion.claim.frontier.arxiv-2607-21474","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21474","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21474 \"Fatness and Flatness\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.\"","support":[{"end":4007,"quote":"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":3835},{"end":1117,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":1088},{"end":2244,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21474","source_sha256":"9e30db6b7858e56351065b6c85dbd59cba58246a0b686b13f86b2527fd009e0c","start":2182}],"target_id":"claim.frontier.arxiv-2607-21474","target_kind":"node","target_sha256":"57d9e8d22aa49efc4913e6df7737b066b45494ce975ca331cab2bcb7e2422d16"}],"claim.frontier.arxiv-2607-21883":[{"id":"assertion.claim.frontier.arxiv-2607-21883","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21883","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21883 \"Explicit bounds for Buchstab's function\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","support":[{"end":1803,"quote":"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":1638},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":964},{"end":1516,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21883","source_sha256":"01286af6d89216cf02fb059b5ad330445a3e29da5ebf61d7de7b4aff15d76ab9","start":1454}],"target_id":"claim.frontier.arxiv-2607-21883","target_kind":"node","target_sha256":"093a307166ed4dc5eabc47df867fdc837a639de20b5f552065742ec3623bfd14"}],"claim.frontier.arxiv-2607-21892":[{"id":"assertion.claim.frontier.arxiv-2607-21892","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.21892","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.21892 \"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums\" (CC BY 4.0, submitted 2026-07-24) reports: \"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.\"","support":[{"end":2310,"quote":"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":2198},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":964},{"end":1676,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-21892","source_sha256":"a134792a463506a7355a5da1399f3d0c3d515ef1099a1471444a40bd81b636ba","start":1614}],"target_id":"claim.frontier.arxiv-2607-21892","target_kind":"node","target_sha256":"f8be03d3fc8b8a38a35cbf85fa9a157d7f4ae7984b12978b108d97048122e5a4"}],"claim.frontier.arxiv-2607-22018":[{"id":"assertion.claim.frontier.arxiv-2607-22018","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22018","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22018 \"Unlocking novel topological structures via rough families\" (CC BY 4.0, submitted 2026-07-24) reports: \"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.\"","support":[{"end":2313,"quote":"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":2196},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":964},{"end":1844,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22018","source_sha256":"4fb9ad38a7b759ea35395d24f9200afa095f3b86b5fa28b1cb8eebfaab9160e0","start":1782}],"target_id":"claim.frontier.arxiv-2607-22018","target_kind":"node","target_sha256":"50b90aa26728855b899f13050a3c2ce09c6a7a0c377e7a5f29787f4ee63fae7b"}],"claim.frontier.arxiv-2607-22049":[{"id":"assertion.claim.frontier.arxiv-2607-22049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22049","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"","support":[{"end":3171,"quote":"Together, we show that ELSA is not only about mitigating risks.","source_id":"source.frontier.arxiv-2607-22049","source_sha256":"5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259","start":3108},{"end":1003,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22049","source_sha256":"5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259","start":974},{"end":1745,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22049","source_sha256":"5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259","start":1683}],"target_id":"claim.frontier.arxiv-2607-22049","target_kind":"node","target_sha256":"787438a2a1978d18fca62f04ba9b03c152778f7a805b0e6417fe10473cd97bbe"}],"claim.frontier.arxiv-2607-22156":[{"id":"assertion.claim.frontier.arxiv-2607-22156","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22156","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22156 \"A random matrix approach to lamplighter groups\" (CC BY 4.0, submitted 2026-07-24) reports: \"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.\"","support":[{"end":1876,"quote":"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1771},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1008},{"end":1566,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22156","source_sha256":"5ea0aba3ec0d2451072de6a7a2ebfe3acb2eec4f564f0001892195b5e81b27a2","start":1504}],"target_id":"claim.frontier.arxiv-2607-22156","target_kind":"node","target_sha256":"40ee72500f24a292d917bf2b1bdbc4395ef98d6158c3b0d71356b249ad6303b2"}],"claim.frontier.arxiv-2607-22196":[{"id":"assertion.claim.frontier.arxiv-2607-22196","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22196","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22196 \"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations\" (CC BY 4.0, submitted 2026-07-24) reports: \"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.\"","support":[{"end":2618,"quote":"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":2324},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":964},{"end":1532,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22196","source_sha256":"eb1a7b11042a1287a13c78324a1f1970d61745503176559fa128a0f7088f7ed8","start":1470}],"target_id":"claim.frontier.arxiv-2607-22196","target_kind":"node","target_sha256":"cc8572aa88ba48f6685776522745c2e1311c6f8d9ff2caa7dea5b49bb316a163"}],"claim.frontier.arxiv-2607-22284":[{"id":"assertion.claim.frontier.arxiv-2607-22284","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22284","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22284 \"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings\" (CC BY 4.0, submitted 2026-07-24) reports: \"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.\"","support":[{"end":2055,"quote":"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":1877},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":964},{"end":1702,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22284","source_sha256":"f13ce632d31e784dbcf17eb158490e7b41cd37db002cebe18f7c6ce4919bf548","start":1640}],"target_id":"claim.frontier.arxiv-2607-22284","target_kind":"node","target_sha256":"5af1b40f4fae6bbc3d21defc33ddefc8c5b505b5cdd59fb06d5d8f31c38f2602"}],"claim.frontier.arxiv-2607-22333":[{"id":"assertion.claim.frontier.arxiv-2607-22333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22333","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22333 \"Collision and non-collision for diffusions on configuration space\" (CC BY 4.0, submitted 2026-07-24) reports: \"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.\"","support":[{"end":2613,"quote":"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":2419},{"end":1084,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":1055},{"end":1694,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22333","source_sha256":"d07d35afcfb21d62de50bb79c1d95331ee4c61ee5c8354d8aaef746c8d26e100","start":1632}],"target_id":"claim.frontier.arxiv-2607-22333","target_kind":"node","target_sha256":"990ada369a52479af0b5b9926dd4f5fa540e27397c8608b8f4a4a2feb7d7af70"}],"claim.frontier.arxiv-2607-22443":[{"id":"assertion.claim.frontier.arxiv-2607-22443","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22443","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22443 \"A Human-Augmenting Agentic Workflow for Observational Causal Inference\" (CC BY 4.0, submitted 2026-07-24) reports: \"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.\"","support":[{"end":3558,"quote":"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":3279},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":1008},{"end":2086,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22443","source_sha256":"c9d61c44282795f78d318c538a8e90f76e943e3b0effcc6b1561619d60b49f7f","start":2024}],"target_id":"claim.frontier.arxiv-2607-22443","target_kind":"node","target_sha256":"8d38267c90e400886b6bbdf0d4e1dd68de8046ca411f3d9f5284c6acb2a879d2"}],"claim.frontier.arxiv-2607-22751":[{"id":"assertion.claim.frontier.arxiv-2607-22751","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22751","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22751 \"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.\"","support":[{"end":2447,"quote":"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":2318},{"end":1081,"quote":"<created>2026-07-23</created>","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":1052},{"end":1752,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22751","source_sha256":"e03ec586c487fad085c30dfacc6c9c938522977c49cfbed75bc6182522636e35","start":1690}],"target_id":"claim.frontier.arxiv-2607-22751","target_kind":"node","target_sha256":"a5af08d6019b2a0c9702c065e3a7a55d4be473c9aef38b6f6bad1e7f71317798"}],"claim.frontier.arxiv-2607-22892":[{"id":"assertion.claim.frontier.arxiv-2607-22892","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22892","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22892 \"Mirror Langevin diffusions: Convergence rates and Markov chain approximations\" (CC BY 4.0, submitted 2026-07-24) reports: \"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.\"","support":[{"end":3146,"quote":"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":2995},{"end":1037,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":1008},{"end":1892,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22892","source_sha256":"aaea624445cf7a6761b020abb80650f3cf890fd1120b3a6cff07ce1e9366caa7","start":1830}],"target_id":"claim.frontier.arxiv-2607-22892","target_kind":"node","target_sha256":"0cd2b4d3f140663b7f1751ff5284508e5c04f7d16099019b2fb01324f2cd3a05"}],"claim.frontier.arxiv-2607-22920":[{"id":"assertion.claim.frontier.arxiv-2607-22920","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22920","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22920 \"Equidistribution of currents under Anosov group actions\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","support":[{"end":2669,"quote":"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":2319},{"end":993,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":964},{"end":1981,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22920","source_sha256":"d027f25268ca8ce8b73a0237a71c784cdf5ac741c6a93f84cd8e8cbdcb0cacfb","start":1919}],"target_id":"claim.frontier.arxiv-2607-22920","target_kind":"node","target_sha256":"d6ac4dd5d3977d9c2a82989dd7b6da9c80f22c7a3fa8f020ff1bfdd64f86df2c"}],"claim.frontier.arxiv-2607-22958":[{"id":"assertion.claim.frontier.arxiv-2607-22958","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22958","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22958 \"Quickest Detection with Rough Path Signatures\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","support":[{"end":2421,"quote":"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":2159},{"end":1165,"quote":"<created>2026-07-24</created>","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":1136},{"end":1770,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22958","source_sha256":"643ec0f02b4d33a87719fe54794da265b072c1894ce15fab2db1692b3a6c4c5c","start":1708}],"target_id":"claim.frontier.arxiv-2607-22958","target_kind":"node","target_sha256":"5e14917911579a9495795cee25826f0ac5a6d41074c56ee60119061c6262fa9f"}],"claim.frontier.arxiv-2607-22985":[{"id":"assertion.claim.frontier.arxiv-2607-22985","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.22985","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.22985 \"Robust Conformalized Selection with Noisy Responses\" (CC BY 4.0, submitted 2026-07-25) reports: \"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.\"","support":[{"end":2498,"quote":"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":2325},{"end":1077,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":1048},{"end":1812,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-22985","source_sha256":"93e0749b349fc461f0c10a9f76b905d1cfc7984cf0fa87e950697c9befcebfcc","start":1750}],"target_id":"claim.frontier.arxiv-2607-22985","target_kind":"node","target_sha256":"090d52e8fbff1e55c9d76f65753234830d0657687ce614190803966439244a4a"}],"claim.frontier.arxiv-2607-23192":[{"id":"assertion.claim.frontier.arxiv-2607-23192","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23192","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23192 \"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian\" (CC0 1.0, submitted 2026-07-25) reports: \"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.\"","support":[{"end":3007,"quote":"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":2795},{"end":1073,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":1044},{"end":1782,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-23192","source_sha256":"4034e86c54794c8f3d03da87e48c6fd13233386b447208707262acff4d644474","start":1714}],"target_id":"claim.frontier.arxiv-2607-23192","target_kind":"node","target_sha256":"e2af9f32003a8ccc7e08fc9da58df0185021906be2d654e6b9ab88582e7424ea"}],"claim.frontier.arxiv-2607-23212":[{"id":"assertion.claim.frontier.arxiv-2607-23212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23212","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23212 \"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations\" (CC BY 4.0, submitted 2026-07-25) reports: \"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.\"","support":[{"end":3100,"quote":"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":2803},{"end":1033,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":1004},{"end":1936,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23212","source_sha256":"af98978eca2e7c3a0212738d5771a753590d9fc71c08542b9472efbc636045fd","start":1874}],"target_id":"claim.frontier.arxiv-2607-23212","target_kind":"node","target_sha256":"6ce450af91b48a24e6dd70b20a2ba0b392e5cdb3e5740653d6a95353f2506126"}],"claim.frontier.arxiv-2607-23236":[{"id":"assertion.claim.frontier.arxiv-2607-23236","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23236","quantifiers":"Only what the quoted sentence states","time":"2026-07-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23236 \"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos\" (CC BY 4.0, submitted 2026-07-25) reports: \"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.\"","support":[{"end":3232,"quote":"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":3064},{"end":1073,"quote":"<created>2026-07-25</created>","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":1044},{"end":1911,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23236","source_sha256":"3295445a18fb08a4cd3dd90dec06b983570edf03cee3833546adfad1de48a11b","start":1849}],"target_id":"claim.frontier.arxiv-2607-23236","target_kind":"node","target_sha256":"c2a0ce43363d4f982d631fa47170e9088354dc236399e184974667565d561464"}],"claim.frontier.arxiv-2607-23428":[{"id":"assertion.claim.frontier.arxiv-2607-23428","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23428","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23428 \"Pinching rigidity of surfaces with parallel mean curvature vector in spheres\" (CC0 1.0, submitted 2026-07-26) reports: \"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.\"","support":[{"end":2466,"quote":"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":2323},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":964},{"end":1865,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-23428","source_sha256":"b3e3692f7100328f8844e2c1a6a0ab6a65daea8d4eaf3a436bcc89bd3ad2d438","start":1797}],"target_id":"claim.frontier.arxiv-2607-23428","target_kind":"node","target_sha256":"76b9ed1b7b2aa5b8f371ae0bfc80788e542452d34eb794b3c5ab55d97a99adc9"}],"claim.frontier.arxiv-2607-23430":[{"id":"assertion.claim.frontier.arxiv-2607-23430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23430","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23430 \"Dialectica Categories over Heyting Algebras\" (CC BY 4.0, submitted 2026-07-26) reports: \"In the case of de Paiva's categorification of Gödel's Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.\"","support":[{"end":2493,"quote":"In the case of de Paiva&#39;s categorification of Gödel&#39;s Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":2240},{"end":1077,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":1048},{"end":2029,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23430","source_sha256":"c99a2661871f677669debd718dc7ea176238ec7fa41c7ad0cbfdfe2668bdf7b3","start":1967}],"target_id":"claim.frontier.arxiv-2607-23430","target_kind":"node","target_sha256":"a4d3312e62a879fa40c682f8b17d266c0278ca5ac16271c3c9febfde206e7bae"}],"claim.frontier.arxiv-2607-23596":[{"id":"assertion.claim.frontier.arxiv-2607-23596","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23596","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23596 \"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis\" (CC BY 4.0, submitted 2026-07-26) reports: \"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.\"","support":[{"end":3288,"quote":"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":3112},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":964},{"end":1767,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23596","source_sha256":"36f1dd1e22428458923677e18fa240ef3d7240d4a75b609c89b7a904a42e1555","start":1705}],"target_id":"claim.frontier.arxiv-2607-23596","target_kind":"node","target_sha256":"63c593c654e703a4fe6ffb1921345b4011fadf6f0a6c6264ce1164a30dd1cf72"}],"claim.frontier.arxiv-2607-23798":[{"id":"assertion.claim.frontier.arxiv-2607-23798","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23798","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23798 \"Interpolation via Generalized Splitting\" (CC BY 4.0, submitted 2026-07-26) reports: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","support":[{"end":2010,"quote":"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":1897},{"end":989,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":960},{"end":1403,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23798","source_sha256":"effda3f558480489009b65cf9f07ff545e7b87c6f6d4842319ca9aae6228d46f","start":1341}],"target_id":"claim.frontier.arxiv-2607-23798","target_kind":"node","target_sha256":"08a6715612c3a7599673bc39f044cb69dd5dec61223538e13f69448291a899f7"}],"claim.frontier.arxiv-2607-23814":[{"id":"assertion.claim.frontier.arxiv-2607-23814","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23814","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23814 \"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination\" (CC BY 4.0, submitted 2026-07-26) reports: \"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.\"","support":[{"end":3485,"quote":"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":3170},{"end":1033,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":1004},{"end":1675,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23814","source_sha256":"622a2cd8c008fe325f1b1987b7f7da5a2a03e4b7b13112f2159e7ae247f50830","start":1613}],"target_id":"claim.frontier.arxiv-2607-23814","target_kind":"node","target_sha256":"2b848862d57afdbdfb6de1ea9a77338f5b157a98d29fac98e2898b32fc66883c"}],"claim.frontier.arxiv-2607-23859":[{"id":"assertion.claim.frontier.arxiv-2607-23859","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23859","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23859 \"A note on the cohomology of pullback Lie algebroids\" (CC BY 4.0, submitted 2026-07-26) reports: \"We also prove the analogous result for holomorphic Lie algebroids.\"","support":[{"end":2130,"quote":"We also prove the analogous result for holomorphic Lie algebroids.","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":2064},{"end":993,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":964},{"end":1496,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23859","source_sha256":"a084ccc95d345bc4a6d7c37508961b8e71cfd82dde78f4941e75cc579142b279","start":1434}],"target_id":"claim.frontier.arxiv-2607-23859","target_kind":"node","target_sha256":"4e1d96520931da3c707f6dd265e5fdae68831dfbff1a560f6983956446dadad1"}],"claim.frontier.arxiv-2607-23956":[{"id":"assertion.claim.frontier.arxiv-2607-23956","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23956","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23956 \"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.\"","support":[{"end":2429,"quote":"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":2264},{"end":1101,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":1072},{"end":2062,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23956","source_sha256":"d9714fde84747b4c14e5e513bbf2fc68c23c327a3f1760a2e7e25edbf70df22a","start":2000}],"target_id":"claim.frontier.arxiv-2607-23956","target_kind":"node","target_sha256":"4f5e6a89556e749d27057cececa33c7a68f1c3ba6e45020149c96aa7e01c83d0"}],"claim.frontier.arxiv-2607-23978":[{"id":"assertion.claim.frontier.arxiv-2607-23978","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.23978","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.23978 \"Non-Hermitian-enhanced quantum sensing in an optical interferometer\" (CC BY 4.0, submitted 2026-07-27) reports: \"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.\"","support":[{"end":2862,"quote":"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":2736},{"end":997,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":968},{"end":2075,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-23978","source_sha256":"cd5357deba6e5f6ee0082b250ae533eb5baa3794d9d3bda2a881fcdb4b6e51b4","start":2013}],"target_id":"claim.frontier.arxiv-2607-23978","target_kind":"node","target_sha256":"913e1797a9b9ee56c22246c9138570f2279784bff4d3177fc3da3538b9a384e1"}],"claim.frontier.arxiv-2607-24078":[{"id":"assertion.claim.frontier.arxiv-2607-24078","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24078","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24078 \"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations\" (CC BY 4.0, submitted 2026-07-27) reports: \"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.\"","support":[{"end":2046,"quote":"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1847},{"end":1062,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1033},{"end":1633,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24078","source_sha256":"f37ee3ef6fb2229e1e13889a056328d1cf38848308c6327505ae14cc6249b80a","start":1571}],"target_id":"claim.frontier.arxiv-2607-24078","target_kind":"node","target_sha256":"5181dc3ea0ad933a6ef8f339f9d952c52f01fd3899ff2e9c2c7325127b224daf"}],"claim.frontier.arxiv-2607-24091":[{"id":"assertion.claim.frontier.arxiv-2607-24091","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24091","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24091 \"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach\" (CC BY 4.0, submitted 2026-07-27) reports: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","support":[{"end":3055,"quote":"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":2661},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":965},{"end":1801,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24091","source_sha256":"938a7309bb45345075cedeedc0cc6a87b40910996a902ce92517c9e120afeebe","start":1739}],"target_id":"claim.frontier.arxiv-2607-24091","target_kind":"node","target_sha256":"3f4471f3e1a60025f3df7b4c95bd57f3ffd208b8079f24ef92525831eb51a32e"}],"claim.frontier.arxiv-2607-24123":[{"id":"assertion.claim.frontier.arxiv-2607-24123","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24123","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24123 \"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means\" (CC BY 4.0, submitted 2026-07-27) reports: \"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.\"","support":[{"end":2206,"quote":"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":2051},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":964},{"end":1869,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24123","source_sha256":"8cecb1b7bd724f0049a931ea6900192e7aa157513325d62cac3b1430684c3374","start":1807}],"target_id":"claim.frontier.arxiv-2607-24123","target_kind":"node","target_sha256":"022cb14556d553b4157f3a59d1c8601b41ad3e3a65280734947c0ccbc3ce9bad"}],"claim.frontier.arxiv-2607-24144":[{"id":"assertion.claim.frontier.arxiv-2607-24144","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24144","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24144 \"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile\" (CC BY 4.0, submitted 2026-07-27) reports: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","support":[{"end":3589,"quote":"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":3349},{"end":1040,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":1011},{"end":2106,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24144","source_sha256":"4a55a17fcc08b2c7a3205b2ec8968e70f8d74f12a3c4b03df1bc75ae550c46c5","start":2044}],"target_id":"claim.frontier.arxiv-2607-24144","target_kind":"node","target_sha256":"2d5f7e94bd18579fab6fa029fbc5e84f7d4ab147089389ade3fbc51b5c9bb9b4"}],"claim.frontier.arxiv-2607-24212":[{"id":"assertion.claim.frontier.arxiv-2607-24212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24212","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24212 \"Convex Biproducts, Stochastic Matrices and Tape Diagrams\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.\"","support":[{"end":2207,"quote":"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1958},{"end":1033,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1004},{"end":1630,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24212","source_sha256":"6f37178436b0a8df740b15ccd831200dbd59f887d3c4b9f4a6c97807bcfc99c0","start":1568}],"target_id":"claim.frontier.arxiv-2607-24212","target_kind":"node","target_sha256":"0c0fb650b1b7941e560f32f5fa00bada9a991c84244451051c7344e9d659f9b9"}],"claim.frontier.arxiv-2607-24239":[{"id":"assertion.claim.frontier.arxiv-2607-24239","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24239","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24239 \"Evolution of dipole-dipole dynamics in cold ammonia collisions\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.\"","support":[{"end":3181,"quote":"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":3007},{"end":1059,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":1030},{"end":2511,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24239","source_sha256":"70ee340db96a0f7a61fa1e6a79077072a62fafc7658586efe88122cd00aac917","start":2449}],"target_id":"claim.frontier.arxiv-2607-24239","target_kind":"node","target_sha256":"606aec2d1684207bddcf378acf94dd0224bb2a1457194df8079dbf2edcdaf999"}],"claim.frontier.arxiv-2607-24240":[{"id":"assertion.claim.frontier.arxiv-2607-24240","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24240","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24240 \"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.\"","support":[{"end":2612,"quote":"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":2398},{"end":1003,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":974},{"end":2375,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24240","source_sha256":"b37d0982508dc6015e311d1c9e5976a7c9319fbb173e41e05fd5854956802da2","start":2313}],"target_id":"claim.frontier.arxiv-2607-24240","target_kind":"node","target_sha256":"9622ae46dd2443a282a363add20ef223ad49932c60819f97262adb9b6b8609be"}],"claim.frontier.arxiv-2607-24244":[{"id":"assertion.claim.frontier.arxiv-2607-24244","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24244","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24244 \"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance\" (CC BY 4.0, submitted 2026-07-27) reports: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","support":[{"end":4817,"quote":"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":4602},{"end":1006,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":977},{"end":2877,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24244","source_sha256":"d8d6c7384c33af568d848e103e4f0d99e3ee9571ebab1e96722acb3ac36a8483","start":2815}],"target_id":"claim.frontier.arxiv-2607-24244","target_kind":"node","target_sha256":"dc7f07ef3ce421f3853aae01b16b99d19900496083512444e5e3a9bbfc1328ae"}],"claim.frontier.arxiv-2607-24252":[{"id":"assertion.claim.frontier.arxiv-2607-24252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24252","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24252 \"Non-Reciprocal yet Equilibrium Critical Dynamics\" (CC BY 4.0, submitted 2026-07-27) reports: \"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.\"","support":[{"end":2683,"quote":"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":2378},{"end":1007,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":978},{"end":1437,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24252","source_sha256":"8721c5aa717f784aff25b5a0dfce08b1e9391ae21f77820944f3480e8d2176df","start":1375}],"target_id":"claim.frontier.arxiv-2607-24252","target_kind":"node","target_sha256":"717d8a292a7019c16c24bc1336a54b5b961af28c71caeed9965156dfa07416ba"}],"claim.frontier.arxiv-2607-24254":[{"id":"assertion.claim.frontier.arxiv-2607-24254","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24254","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24254 \"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes\" (CC BY 4.0, submitted 2026-07-27) reports: \"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.\"","support":[{"end":2196,"quote":"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":1976},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":965},{"end":1953,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24254","source_sha256":"15169ccda8a9cff40760f91db49b5dae90219acfef884de12451a189e3f5ddc8","start":1891}],"target_id":"claim.frontier.arxiv-2607-24254","target_kind":"node","target_sha256":"4022b38137485e7d76ee932556907db703bb70d55ea1dc5a6cbf9c6bfd46f6d8"}],"claim.frontier.arxiv-2607-24360":[{"id":"assertion.claim.frontier.arxiv-2607-24360","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24360","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"","support":[{"end":2630,"quote":"Our findings reveal that manipulative narratives dominate when early spreaders hold them.","source_id":"source.frontier.arxiv-2607-24360","source_sha256":"aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586","start":2541},{"end":1029,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24360","source_sha256":"aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586","start":1000},{"end":1968,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24360","source_sha256":"aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586","start":1906}],"target_id":"claim.frontier.arxiv-2607-24360","target_kind":"node","target_sha256":"ac1a6108041d1dd66eec9657ec654795b49ceb849592c814f1eafa5968d0c712"}],"claim.frontier.arxiv-2607-24423":[{"id":"assertion.claim.frontier.arxiv-2607-24423","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24423","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"","support":[{"end":4197,"quote":"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.","source_id":"source.frontier.arxiv-2607-24423","source_sha256":"a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1","start":4038},{"end":1087,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24423","source_sha256":"a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1","start":1058},{"end":2419,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24423","source_sha256":"a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1","start":2357}],"target_id":"claim.frontier.arxiv-2607-24423","target_kind":"node","target_sha256":"6dca6dc937e903d46d9bc8faf05ead44eeca3c790d69a1881a0251f46e3d7186"}],"claim.frontier.arxiv-2607-24433":[{"id":"assertion.claim.frontier.arxiv-2607-24433","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24433","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24433 \"Justification Logic of the Lambda Calculus\" (CC BY 4.0, submitted 2026-07-27) reports: \"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.\"","support":[{"end":2836,"quote":"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":2651},{"end":1033,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":1004},{"end":1609,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24433","source_sha256":"689d0c7267008c60f2d23d36dc94e4e7399e433b2055375eea7010f86c619c44","start":1547}],"target_id":"claim.frontier.arxiv-2607-24433","target_kind":"node","target_sha256":"4c6e1367fda66138bc72d4636b4d57ecea219e63b427dfbab7e4a411e3bad34b"}],"claim.frontier.arxiv-2607-24446":[{"id":"assertion.claim.frontier.arxiv-2607-24446","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24446","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24446 \"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","support":[{"end":2364,"quote":"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":2153},{"end":995,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":966},{"end":1669,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24446","source_sha256":"ab6cea5f486dcd0329920e7da2285ad49f6263d80423be1eefb07029f2b802c3","start":1607}],"target_id":"claim.frontier.arxiv-2607-24446","target_kind":"node","target_sha256":"b4be956edc655ac707660c3768d03b9ecdddd52920ca76cb8f72a248f9244023"}],"claim.frontier.arxiv-2607-24489":[{"id":"assertion.claim.frontier.arxiv-2607-24489","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24489","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24489 \"Asymptotic areas between powers of sine and cosine curves\" (CC BY 4.0, submitted 2026-07-27) reports: \"Motivated by Dombrowski and Dresden's work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.\"","support":[{"end":1960,"quote":"Motivated by Dombrowski and Dresden&#39;s work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":1703},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":964},{"end":1680,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24489","source_sha256":"91b9e7bdb2077a63874ed23becaf2d7b222de162d5f8320a6029697615b246ee","start":1618}],"target_id":"claim.frontier.arxiv-2607-24489","target_kind":"node","target_sha256":"cb31454a7a86673e55ed1a98b7647bf99ed3fceec478faf2f17941159ab77344"}],"claim.frontier.arxiv-2607-24524":[{"id":"assertion.claim.frontier.arxiv-2607-24524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24524","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24524 \"Light Dark Matter Discovery Potential and Model Selection at LDMX\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.\"","support":[{"end":2855,"quote":"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":2617},{"end":1041,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":1012},{"end":1991,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24524","source_sha256":"8a70c135285e77a33603c7521eee8ba62a3073f08e146a52be9cd8fe27a20934","start":1929}],"target_id":"claim.frontier.arxiv-2607-24524","target_kind":"node","target_sha256":"7a9f3d819e7d73023764b16051ffeb379676bb597df4f85878a6d0558f83a57c"}],"claim.frontier.arxiv-2607-24544":[{"id":"assertion.claim.frontier.arxiv-2607-24544","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24544","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24544 \"An Halpha survey of infrared bow-shocks around OB-type stars\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.\"","support":[{"end":3625,"quote":"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":3461},{"end":1000,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":971},{"end":2308,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24544","source_sha256":"944452433e4c302b1056cccafc62ae9bb7c4accadcf0b6449268a0f5db8f4e15","start":2246}],"target_id":"claim.frontier.arxiv-2607-24544","target_kind":"node","target_sha256":"165afb7399a0b5644e80f019d2360f3f720ae91ac7de70d62685140d10107a86"}],"claim.frontier.arxiv-2607-24584":[{"id":"assertion.claim.frontier.arxiv-2607-24584","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24584","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24584 \"Invisible decay of solar neutrinos at dark matter experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.\"","support":[{"end":3780,"quote":"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":3463},{"end":995,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":966},{"end":2431,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24584","source_sha256":"f6eb19714d44a3f431ee111af5bdb215188c9971ef7a88e84407ddf6cf3c09e6","start":2369}],"target_id":"claim.frontier.arxiv-2607-24584","target_kind":"node","target_sha256":"2ab2d0001f15966b647f989663421321b6a74f2d8cb2e3479c7b9396179c082b"}],"claim.frontier.arxiv-2607-24605":[{"id":"assertion.claim.frontier.arxiv-2607-24605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24605","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24605 \"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.\"","support":[{"end":3094,"quote":"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":2946},{"end":1000,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":971},{"end":2092,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24605","source_sha256":"2085f2de729668a3ac7a35c8ca93378754a8f9b25b632f950d84c273ceab9229","start":2030}],"target_id":"claim.frontier.arxiv-2607-24605","target_kind":"node","target_sha256":"65d08faea575b80470f8a1cf1a6cd8566383fc6e9f2550e039a4d2651a5ff11b"}],"claim.frontier.arxiv-2607-24641":[{"id":"assertion.claim.frontier.arxiv-2607-24641","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24641","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24641 \"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.\"","support":[{"end":2096,"quote":"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":1974},{"end":993,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":964},{"end":1588,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24641","source_sha256":"743e853ffaa2dc9f14a147dbc988e437dd0300aa4fa3f2db0ec0f68bf45ec7a6","start":1526}],"target_id":"claim.frontier.arxiv-2607-24641","target_kind":"node","target_sha256":"0e98badcf015147c067e71b3464d9ac0ea451836e577d33dd6502bd0d307d4d8"}],"claim.frontier.arxiv-2607-24654":[{"id":"assertion.claim.frontier.arxiv-2607-24654","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24654","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24654 \"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.\"","support":[{"end":2594,"quote":"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":2383},{"end":994,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":965},{"end":1946,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24654","source_sha256":"a47435aa17ef2880de86639fd3e9fb832170fef42309e0787bcea0fbc3afc3c9","start":1884}],"target_id":"claim.frontier.arxiv-2607-24654","target_kind":"node","target_sha256":"173ac730ebcea5d466ece80d2b8a8d46a5b0610ab6bae06cc4e72d3524fd278d"}],"claim.frontier.arxiv-2607-24682":[{"id":"assertion.claim.frontier.arxiv-2607-24682","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24682","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24682 \"CP-preserving channels\" (CC BY 4.0, submitted 2026-07-27) reports: \"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.\"","support":[{"end":2733,"quote":"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":2595},{"end":1088,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":1059},{"end":1883,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24682","source_sha256":"45a37756cc72dde0829853abd2935e9b91d7bd4065a4f5ed660d5baec260c219","start":1821}],"target_id":"claim.frontier.arxiv-2607-24682","target_kind":"node","target_sha256":"001dd3c1cb8c84f6a441ec3d5badbeaf970a3fa4c7faaf197133220192163eff"}],"claim.frontier.arxiv-2607-24705":[{"id":"assertion.claim.frontier.arxiv-2607-24705","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24705","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24705 \"Derangetropy Operators\" (CC BY 4.0, submitted 2026-07-27) reports: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","support":[{"end":2611,"quote":"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":2026},{"end":1260,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":1231},{"end":1856,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24705","source_sha256":"854019903bc4e2317961687cdd5e5c91c1c20dd920ec68f10e7c2f9c3dc89f37","start":1794}],"target_id":"claim.frontier.arxiv-2607-24705","target_kind":"node","target_sha256":"eabadab70c74b2c549388551ca7efdaa0141eca6a65b0fe39f82d09e417e5a28"}],"claim.frontier.arxiv-2607-24918":[{"id":"assertion.claim.frontier.arxiv-2607-24918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24918","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24918 \"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.\"","support":[{"end":2747,"quote":"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":2553},{"end":1046,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":1017},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24918","source_sha256":"88d618f03090ec3a1b3aa99a0758f65ba46e77d7c585c8dd775e9be1079295b6","start":1864}],"target_id":"claim.frontier.arxiv-2607-24918","target_kind":"node","target_sha256":"b801bc9d35711b4b2d668e4e8840ab8319fe473c7d6d68e125fb47d5272b4a6b"}],"claim.frontier.arxiv-2607-24933":[{"id":"assertion.claim.frontier.arxiv-2607-24933","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24933","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24933 \"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.\"","support":[{"end":2465,"quote":"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":2313},{"end":1041,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":1012},{"end":1800,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24933","source_sha256":"6f5c327080bc6c692dc30b35a85d1b580fe5815f3ab0e463a587e840aee48fbb","start":1738}],"target_id":"claim.frontier.arxiv-2607-24933","target_kind":"node","target_sha256":"df1cef78171694add6ba59acee1901479940e3d509cea9f5cde9fd9bb5f95957"}],"claim.frontier.arxiv-2607-24938":[{"id":"assertion.claim.frontier.arxiv-2607-24938","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24938","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24938 \"Tidal deformation of an accreting compact object\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.\"","support":[{"end":2976,"quote":"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":2761},{"end":1045,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":1016},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24938","source_sha256":"8169336fef462fa2d8a47f28d25804cb6a971bf4c93a0ef4e5d9e61fe0cd2120","start":1944}],"target_id":"claim.frontier.arxiv-2607-24938","target_kind":"node","target_sha256":"d7b6cb71ee37c333b036823b067c3521b4e555e7b0cbe533d0d0b36f240a880f"}],"claim.frontier.arxiv-2607-24988":[{"id":"assertion.claim.frontier.arxiv-2607-24988","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.24988","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.24988 \"Maximal complementarity in the n-qubit Pauli group\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.\"","support":[{"end":3278,"quote":"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":2851},{"end":1088,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":1059},{"end":2058,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-24988","source_sha256":"277edcbc32ff38c8c94c5292cf1e4829f1228cb3bc9e2002073a3988e2fc9852","start":1996}],"target_id":"claim.frontier.arxiv-2607-24988","target_kind":"node","target_sha256":"3993ccb04243c747a7c18cf614f17fce2230fd29592c54db823ba75d0f2f050a"}],"claim.frontier.arxiv-2607-25081":[{"id":"assertion.claim.frontier.arxiv-2607-25081","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25081","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"","support":[{"end":2866,"quote":"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.","source_id":"source.frontier.arxiv-2607-25081","source_sha256":"112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee","start":2630},{"end":1003,"quote":"<created>2026-07-27</created>","source_id":"source.frontier.arxiv-2607-25081","source_sha256":"112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee","start":974},{"end":1750,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25081","source_sha256":"112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee","start":1688}],"target_id":"claim.frontier.arxiv-2607-25081","target_kind":"node","target_sha256":"b90de23cd11d00beb480dd4d7586292f01aad28b48fec4b4505bfb13cc4c9563"}],"claim.frontier.arxiv-2607-25226":[{"id":"assertion.claim.frontier.arxiv-2607-25226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25226","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25226 \"The quantum electrodynamics for dyons\" (CC0 1.0, submitted 2026-07-28) reports: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","support":[{"end":2553,"quote":"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960&#39;s seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":2194},{"end":1223,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":1194},{"end":2171,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-25226","source_sha256":"bf239d85372f588d700084360b676988e1c93177e7eeec39dff99a4484efeeaf","start":2103}],"target_id":"claim.frontier.arxiv-2607-25226","target_kind":"node","target_sha256":"5c8c5a658e6abd66b9457e9c7b1cb8686f36dd23847ad501ee147932a07c7375"}],"claim.frontier.arxiv-2607-25252":[{"id":"assertion.claim.frontier.arxiv-2607-25252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25252","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25252 \"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality\" (CC BY 4.0, submitted 2026-07-28) reports: \"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.\"","support":[{"end":2716,"quote":"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":2586},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":964},{"end":1937,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25252","source_sha256":"abecf0f942ecdd717958437302f119b37c58bf1e12b6d0a9a0fd437bac7d2e6c","start":1875}],"target_id":"claim.frontier.arxiv-2607-25252","target_kind":"node","target_sha256":"ed9158c78838791ce49937831f871b92cd11c26b6b14cc328953f99b71efa75c"}],"claim.frontier.arxiv-2607-25341":[{"id":"assertion.claim.frontier.arxiv-2607-25341","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25341","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25341 \"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","support":[{"end":2221,"quote":"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":1997},{"end":997,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":968},{"end":1819,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25341","source_sha256":"fdeb49cb250b1c34869b7a7ecf311d8e40216f5cbc0edb99a30df1b2c2c40242","start":1757}],"target_id":"claim.frontier.arxiv-2607-25341","target_kind":"node","target_sha256":"e75f29ae8e0581b135bd20dab6c4fde041215fbb0710d36548e691414da9f803"}],"claim.frontier.arxiv-2607-25394":[{"id":"assertion.claim.frontier.arxiv-2607-25394","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25394","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25394 \"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals\" (CC BY 4.0, submitted 2026-07-28) reports: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","support":[{"end":2982,"quote":"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":2835},{"end":1003,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":974},{"end":2525,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25394","source_sha256":"038da7ee84c0c021d3d5156dd523fe8863e40fe564da1b9cc56a2e91b1a6b012","start":2463}],"target_id":"claim.frontier.arxiv-2607-25394","target_kind":"node","target_sha256":"55bc54af6bfada63f7f5bf7c093b2cd9cdfa6bf1ac35365ada372ec417ba9df2"}],"claim.frontier.arxiv-2607-25460":[{"id":"assertion.claim.frontier.arxiv-2607-25460","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25460","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25460 \"Initial algebras from constructive ordinals\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","support":[{"end":1624,"quote":"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":1507},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":964},{"end":1484,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25460","source_sha256":"e456fc93d965697b2eb8727956d140f2e776943ecc90c2277551e9dbd98d07fa","start":1422}],"target_id":"claim.frontier.arxiv-2607-25460","target_kind":"node","target_sha256":"f3231f69f15069f1a46f005cd845d32727d566dae4bcf80011ca7444894c5697"}],"claim.frontier.arxiv-2607-25473":[{"id":"assertion.claim.frontier.arxiv-2607-25473","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25473","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25473 \"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","support":[{"end":2501,"quote":"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":2249},{"end":1041,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":1012},{"end":1985,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25473","source_sha256":"3057f848388f8a658d99ec5e7e3961141ea97995bf689edf90e4a4de7d652eb6","start":1923}],"target_id":"claim.frontier.arxiv-2607-25473","target_kind":"node","target_sha256":"362fde8a10e8b2b8b11cd950644355ac82459e24fb39ebd3da794bf28a0994bb"}],"claim.frontier.arxiv-2607-25526":[{"id":"assertion.claim.frontier.arxiv-2607-25526","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25526","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"","support":[{"end":2808,"quote":"The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.","source_id":"source.frontier.arxiv-2607-25526","source_sha256":"342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d","start":2524},{"end":989,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25526","source_sha256":"342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d","start":960},{"end":1459,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25526","source_sha256":"342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d","start":1397}],"target_id":"claim.frontier.arxiv-2607-25526","target_kind":"node","target_sha256":"b1164cfef081634e80f58056041e08056c9b83bbad91b3a6f82cf28548ddcc2b"}],"claim.frontier.arxiv-2607-25559":[{"id":"assertion.claim.frontier.arxiv-2607-25559","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25559","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25559 \"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","support":[{"end":2366,"quote":"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":2150},{"end":1002,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":973},{"end":1618,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25559","source_sha256":"a775400af843bba19a39058a6a584f36ed13ca926e67a2ce4c0bb313d6b44c23","start":1556}],"target_id":"claim.frontier.arxiv-2607-25559","target_kind":"node","target_sha256":"05cd5ff7d4c006373726071257e42815e38a0ae16d3d6742a4f91234f5620d68"}],"claim.frontier.arxiv-2607-25610":[{"id":"assertion.claim.frontier.arxiv-2607-25610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25610","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25610 \"Brjuno condition through best approximations and the linearization problem\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.\"","support":[{"end":2876,"quote":"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":2675},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":964},{"end":2106,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25610","source_sha256":"10aee26918cfeb590cdbc7e9beb830482f738964d121b7a3db0511657279fb32","start":2044}],"target_id":"claim.frontier.arxiv-2607-25610","target_kind":"node","target_sha256":"8318e561089caa6aedc52f09964b5ae1b00ed5652ff13c7af9ca854b27d9043c"}],"claim.frontier.arxiv-2607-25621":[{"id":"assertion.claim.frontier.arxiv-2607-25621","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25621","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25621 \"A Lusin theorem for nonlocal gradients\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.\"","support":[{"end":1754,"quote":"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":1647},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":964},{"end":1459,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25621","source_sha256":"75416291b43498dbc1cc2353c042fed703f96b6c470d5a1331cc1e21aa5d57e4","start":1397}],"target_id":"claim.frontier.arxiv-2607-25621","target_kind":"node","target_sha256":"ea33721d8c024991054885657cc9f2d8aa02c81fdce9e9621cfa22eaf3f878da"}],"claim.frontier.arxiv-2607-25625":[{"id":"assertion.claim.frontier.arxiv-2607-25625","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25625","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25625 \"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain\" (CC BY 4.0, submitted 2026-07-28) reports: \"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.\"","support":[{"end":2263,"quote":"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":2081},{"end":1101,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":1072},{"end":1680,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25625","source_sha256":"567b2373fe098d2ac79e16b137b61b6e03b809abe7900e74b7794901ec08decb","start":1618}],"target_id":"claim.frontier.arxiv-2607-25625","target_kind":"node","target_sha256":"1b926e5fb942e4378140656d622e107a9a50c46a26ef8ee33b2de89e0c40662e"}],"claim.frontier.arxiv-2607-25644":[{"id":"assertion.claim.frontier.arxiv-2607-25644","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25644","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25644 \"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers\" (CC0 1.0, submitted 2026-07-28) reports: \"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.\"","support":[{"end":2098,"quote":"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":1847},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":964},{"end":1675,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-25644","source_sha256":"fac1f0f3387ba4eb98d9ba808cb1b6483df4e364ad4162c2f69ee058d3f37363","start":1607}],"target_id":"claim.frontier.arxiv-2607-25644","target_kind":"node","target_sha256":"5835e20de1a2e098812d8ead892652a717b8531cf6727cd1a6d0b89d34bcdcbc"}],"claim.frontier.arxiv-2607-25678":[{"id":"assertion.claim.frontier.arxiv-2607-25678","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25678","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25678 \"Engineering a Quantum Thermal Diode with Floquet Driving\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.\"","support":[{"end":2312,"quote":"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":2126},{"end":997,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":968},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25678","source_sha256":"6bb126f3735ff7469012dfd16814fea48f2bbf9f8126bc8a9e0c2fd9d7df1af2","start":1755}],"target_id":"claim.frontier.arxiv-2607-25678","target_kind":"node","target_sha256":"1eacad386c24081676b659a27ffbde000764af0a8f382b9bff7424d8edda5eb9"}],"claim.frontier.arxiv-2607-25706":[{"id":"assertion.claim.frontier.arxiv-2607-25706","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25706","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25706 \"Categories of tagged lenses\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","support":[{"end":1717,"quote":"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":1562},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":964},{"end":1392,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25706","source_sha256":"e72ce152b4da349d8457809065cae6573819ba0c86cfcefff8e4f8f19374b7fe","start":1330}],"target_id":"claim.frontier.arxiv-2607-25706","target_kind":"node","target_sha256":"aeb44eecbdc9c280dbad29c49de3a9ced76f2ae9f58cc937330723a5bc28b62e"}],"claim.frontier.arxiv-2607-25743":[{"id":"assertion.claim.frontier.arxiv-2607-25743","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25743","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25743 \"Physical Mechanism of Vacuole Formation in Liquid Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.\"","support":[{"end":2893,"quote":"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":2775},{"end":1056,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":1027},{"end":2335,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25743","source_sha256":"0a5b6e18efca9a9ee666b492e20bcd5c1f770d93bde59082ebb8d875de8ac678","start":2273}],"target_id":"claim.frontier.arxiv-2607-25743","target_kind":"node","target_sha256":"4e21e15134dd7174ae7f60b2377a773e07c28603004812b6f724e478a9329c77"}],"claim.frontier.arxiv-2607-25772":[{"id":"assertion.claim.frontier.arxiv-2607-25772","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25772","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25772 \"Contact Surgery Numbers of the 3-torus\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.\"","support":[{"end":2078,"quote":"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1846},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1008},{"end":1751,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25772","source_sha256":"503f8fd04465564452b1c04f1b6d9291fde7410867f25b0d2deb8bf6e7163865","start":1689}],"target_id":"claim.frontier.arxiv-2607-25772","target_kind":"node","target_sha256":"9b210c4bf76475e0a92b50f18fc34bdf82e1288bab313d26dae0699e6c29b7d2"}],"claim.frontier.arxiv-2607-25783":[{"id":"assertion.claim.frontier.arxiv-2607-25783","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25783","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25783 \"Deterministic loading of molecular arrays by microwave-assisted collisions\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.\"","support":[{"end":2874,"quote":"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":2639},{"end":1165,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":1136},{"end":2275,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25783","source_sha256":"379422dcee9d0744246e52363a99a996357c0077c19f1e6c1eb776579afcd1ac","start":2213}],"target_id":"claim.frontier.arxiv-2607-25783","target_kind":"node","target_sha256":"84171262a8572e9d1358fb160d29a7d0ac5cd71a0f28441864d63973b2aa92b1"}],"claim.frontier.arxiv-2607-25865":[{"id":"assertion.claim.frontier.arxiv-2607-25865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25865","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25865 \"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist\" (CC BY 4.0, submitted 2026-07-28) reports: \"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.\"","support":[{"end":4083,"quote":"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":3816},{"end":1077,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":1048},{"end":2638,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25865","source_sha256":"f1cf9832de2990ab43a67bdb54c4c9ce19e49f44ba4387397665ecb42188c63f","start":2576}],"target_id":"claim.frontier.arxiv-2607-25865","target_kind":"node","target_sha256":"29445bc6c61c12a615ef2362cb94aa0e4dc3ea8d50e7d3e02f310f318848e614"}],"claim.frontier.arxiv-2607-25910":[{"id":"assertion.claim.frontier.arxiv-2607-25910","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25910","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25910 \"$d$-Translated Unit Sensitive Primes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.\"","support":[{"end":2009,"quote":"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":1880},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":964},{"end":1615,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25910","source_sha256":"347e0dfaae2027c11d33e75667c3362b19eb4234e4130f71e7021c77228c7dab","start":1553}],"target_id":"claim.frontier.arxiv-2607-25910","target_kind":"node","target_sha256":"1a05d43338bd8805f4b7ae139256b779743a9af225ad0ebbebda6cc52672c099"}],"claim.frontier.arxiv-2607-25950":[{"id":"assertion.claim.frontier.arxiv-2607-25950","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25950","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25950 \"Weak-form Extended Dynamic Mode Decomposition\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","support":[{"end":1922,"quote":"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":1740},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":964},{"end":1613,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25950","source_sha256":"80982247c69b27a3b26b77389604ed28d67251aa09114cb955947f2a8bc3010d","start":1551}],"target_id":"claim.frontier.arxiv-2607-25950","target_kind":"node","target_sha256":"d5736fdee0bd974ed95ec6d95eb80282e1d805b84f99c75026bddd3bc968432f"}],"claim.frontier.arxiv-2607-25960":[{"id":"assertion.claim.frontier.arxiv-2607-25960","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25960","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25960 \"Quantum Steenrod powers and Hamiltonian maps\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including: 1.\"","support":[{"end":2136,"quote":"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including:\n  1.","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":2014},{"end":1037,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":1008},{"end":1991,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25960","source_sha256":"0609314d8759f60b91c091ecc20c5022b6c00fa677c3d94c0f6ae7d43d655d77","start":1929}],"target_id":"claim.frontier.arxiv-2607-25960","target_kind":"node","target_sha256":"bfcfb846ed194b0812ca98a4e8e78c431e2b56cb9623419d0002bab3cefbd33b"}],"claim.frontier.arxiv-2607-25977":[{"id":"assertion.claim.frontier.arxiv-2607-25977","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.25977","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.25977 \"The Internal Modal Logic of Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.\"","support":[{"end":2870,"quote":"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":2609},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":964},{"end":1712,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-25977","source_sha256":"f326fa713c92a0a33c16eff39164d6464cda1009286c25358acd6a24abf25879","start":1650}],"target_id":"claim.frontier.arxiv-2607-25977","target_kind":"node","target_sha256":"359ca5637261d57dc3c0fc09c8a92896477f57fcbed5fc24533ca359cc0f1737"}],"claim.frontier.arxiv-2607-26030":[{"id":"assertion.claim.frontier.arxiv-2607-26030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26030","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26030 \"Soft-mode nonlinearities away from ferroelectric phase transition\" (CC BY 4.0, submitted 2026-07-28) reports: \"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.\"","support":[{"end":3534,"quote":"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":3391},{"end":1006,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":977},{"end":2200,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26030","source_sha256":"5782964d397b37f538369171d9d1c965f450d6b168122101fd1976907c646a21","start":2138}],"target_id":"claim.frontier.arxiv-2607-26030","target_kind":"node","target_sha256":"2c3e66ecd2967b0846f45cc0966978618a05d951b066e7529c89355a9f4d0ea2"}],"claim.frontier.arxiv-2607-26084":[{"id":"assertion.claim.frontier.arxiv-2607-26084","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26084","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26084 \"Observational Constraints on Emergent Fractional Fractal Cosmology\" (CC BY 4.0, submitted 2026-07-26) reports: \"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.\"","support":[{"end":3247,"quote":"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":3057},{"end":1045,"quote":"<created>2026-07-26</created>","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":1016},{"end":1978,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26084","source_sha256":"1efb545f10f506aa046693d8fbed050e69c5701712e1d7d369f94258d2ec4223","start":1916}],"target_id":"claim.frontier.arxiv-2607-26084","target_kind":"node","target_sha256":"dcb5e7dbdd588371f1dcce560ce34afa6256578c92a8fde47f76a28ec12da943"}],"claim.frontier.arxiv-2607-26103":[{"id":"assertion.claim.frontier.arxiv-2607-26103","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26103","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26103 \"A rigid spherical shell enclosing a degenerate wormhole\" (CC BY 4.0, submitted 2026-07-28) reports: \"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.\"","support":[{"end":2161,"quote":"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":1916},{"end":994,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":965},{"end":1514,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26103","source_sha256":"77c2db5da617773cc98975c61d060ff9d0126e6f4f22287a86824a1b52df0161","start":1452}],"target_id":"claim.frontier.arxiv-2607-26103","target_kind":"node","target_sha256":"90de20352ef72bcd8a80e84790fc5d00313a050bfb383f9625123ef8fc9be832"}],"claim.frontier.arxiv-2607-26141":[{"id":"assertion.claim.frontier.arxiv-2607-26141","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26141","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26141 \"Light propagation and intensity transport in metric-affine geometry\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.\"","support":[{"end":2958,"quote":"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":2705},{"end":994,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":965},{"end":1993,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26141","source_sha256":"86c6c4aa3352e1c15568fe66cd52e933431cb515a5fcd3629d3b2d1e3fb142fb","start":1931}],"target_id":"claim.frontier.arxiv-2607-26141","target_kind":"node","target_sha256":"1bf609d459086e5019058403f0fa2c7ccbff3342bbdc3fda559017392154a14e"}],"claim.frontier.arxiv-2607-26147":[{"id":"assertion.claim.frontier.arxiv-2607-26147","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26147","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26147 \"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity\" (CC BY 4.0, submitted 2026-07-28) reports: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","support":[{"end":3932,"quote":"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":3683},{"end":1051,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":1022},{"end":2989,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26147","source_sha256":"253c11e87db1c7d667cb7fdde222b19ce23a80eb45a1372b7adde9140c12d1d4","start":2927}],"target_id":"claim.frontier.arxiv-2607-26147","target_kind":"node","target_sha256":"924d3389266211bcfcdc2ffb61911776052c435b93db64e1523ba37c55333701"}],"claim.frontier.arxiv-2607-26151":[{"id":"assertion.claim.frontier.arxiv-2607-26151","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26151","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26151 \"Quantum spin-glass criticality in disordered frustrated dimer magnets\" (CC BY 4.0, submitted 2026-07-28) reports: \"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.\"","support":[{"end":2931,"quote":"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":2661},{"end":1059,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":1030},{"end":1745,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26151","source_sha256":"2ccd6bd1397b8ee30f003b35f0704b6ac095ac807e84df06d0c44dac5dd1f067","start":1683}],"target_id":"claim.frontier.arxiv-2607-26151","target_kind":"node","target_sha256":"e948e92998a2d9d3fb6e021897341667e3c1fe8bf844319bacb130329d9ca9be"}],"claim.frontier.arxiv-2607-26177":[{"id":"assertion.claim.frontier.arxiv-2607-26177","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26177","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26177 \"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.\"","support":[{"end":4839,"quote":"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":4632},{"end":1051,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":1022},{"end":3632,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26177","source_sha256":"7f52ed77cf0aa835fbff16a27300f5b18676c8114f5a48bfdbca8684428f0aa5","start":3570}],"target_id":"claim.frontier.arxiv-2607-26177","target_kind":"node","target_sha256":"f47246320b8c81db9a8043206a5d940e38ad2e4a004d7fe36ff264de73c77967"}],"claim.frontier.arxiv-2607-26180":[{"id":"assertion.claim.frontier.arxiv-2607-26180","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26180","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26180 \"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.\"","support":[{"end":2678,"quote":"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":2511},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":971},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26180","source_sha256":"5efe1e9880fbf861514bf422d7b2a2d45af43b38c3e487ca314c9d5bf25f702d","start":1755}],"target_id":"claim.frontier.arxiv-2607-26180","target_kind":"node","target_sha256":"d26b77ceaa71482af10b8efd851f32f2f448abae72f418b98859521a4f37be70"}],"claim.frontier.arxiv-2607-26193":[{"id":"assertion.claim.frontier.arxiv-2607-26193","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26193","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26193 \"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.\"","support":[{"end":3882,"quote":"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":3661},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":971},{"end":3068,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26193","source_sha256":"43e05d123accf014ee80e5126fdd00821a1487c47faf312ded3c615b2af37554","start":3006}],"target_id":"claim.frontier.arxiv-2607-26193","target_kind":"node","target_sha256":"476f120a2a35bf2cd26a28ba50bb42b7b20ffd26a96a1e532da7ba81512f581c"}],"claim.frontier.arxiv-2607-26205":[{"id":"assertion.claim.frontier.arxiv-2607-26205","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26205","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26205 \"Binary disruptions driven by massive disks around massive black holes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.\"","support":[{"end":2294,"quote":"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":2137},{"end":1000,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":971},{"end":1597,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26205","source_sha256":"9ddfa366090bf332da0ea790b194e744c72c8f04cca0f4dd09b958ea724f271d","start":1535}],"target_id":"claim.frontier.arxiv-2607-26205","target_kind":"node","target_sha256":"82d273ad2dfad49236650fcbe59a6838921fd659d4bacc9a9cfa77eb96047910"}],"claim.frontier.arxiv-2607-26209":[{"id":"assertion.claim.frontier.arxiv-2607-26209","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26209","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"","support":[{"end":4137,"quote":"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.","source_id":"source.frontier.arxiv-2607-26209","source_sha256":"80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9","start":3820},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26209","source_sha256":"80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9","start":964},{"end":2494,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26209","source_sha256":"80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9","start":2432}],"target_id":"claim.frontier.arxiv-2607-26209","target_kind":"node","target_sha256":"3e3a639fce49c30240c8dffe2bfbb6757086c8e52e57f7cffe603d63d38d7ec3"}],"claim.frontier.arxiv-2607-26281":[{"id":"assertion.claim.frontier.arxiv-2607-26281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26281","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26281 \"Concise $(\\varepsilon,r)$-representations of a path\" (CC BY 4.0, submitted 2026-07-28) reports: \"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.\"","support":[{"end":3626,"quote":"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":3475},{"end":1077,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":1048},{"end":1894,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26281","source_sha256":"6b66b70939ca371bc84b8ee2ddb33a4e4c533974aa3d909c3acd398c024c21d7","start":1832}],"target_id":"claim.frontier.arxiv-2607-26281","target_kind":"node","target_sha256":"02c70e0d132daec18b3fa5d43016bbed6018e7e0dfeb17afeefea815105868c8"}],"claim.frontier.arxiv-2607-26287":[{"id":"assertion.claim.frontier.arxiv-2607-26287","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26287","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26287 \"Studying Competing Events with Federated Cumulative Incidence Curves\" (CC BY 4.0, submitted 2026-07-28) reports: \"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.\"","support":[{"end":4043,"quote":"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":3757},{"end":993,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":964},{"end":2510,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26287","source_sha256":"e0a8d0a29dc437bc19579b42ebe72c492a3150ffbee0f88aae15a6dddf6314d0","start":2448}],"target_id":"claim.frontier.arxiv-2607-26287","target_kind":"node","target_sha256":"f99cae5b6df4877d4b4c78997da39c6862ba8bc6e71a587437a78ad34cdcb0ef"}],"claim.frontier.arxiv-2607-26289":[{"id":"assertion.claim.frontier.arxiv-2607-26289","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26289","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26289 \"Scale-dependent universality class crossover in magnetic skyrmion polymers\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.\"","support":[{"end":2841,"quote":"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":2620},{"end":1117,"quote":"<created>2026-07-28</created>","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":1088},{"end":1958,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26289","source_sha256":"25a5b2a384a145d5c00c00e2f0432d33aa4b6b75cc1d4ff94caa1cd837f5c1c5","start":1896}],"target_id":"claim.frontier.arxiv-2607-26289","target_kind":"node","target_sha256":"ac487d0f9e3739a6670e0dec93b217421d3aa39a3e6f67b2695a0117ec5f70f3"}],"claim.frontier.arxiv-2607-26374":[{"id":"assertion.claim.frontier.arxiv-2607-26374","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26374","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26374 \"Charged Dirac stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.\"","support":[{"end":2145,"quote":"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":1839},{"end":994,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":965},{"end":1606,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26374","source_sha256":"c755807c84a1f817972a9472ff01402264e5bdb1b54604885062d1f919ebc109","start":1544}],"target_id":"claim.frontier.arxiv-2607-26374","target_kind":"node","target_sha256":"c22ba501dbf04823a0c38b59063a13f9525ae937e1122dd16f5a33e99326c941"}],"claim.frontier.arxiv-2607-26378":[{"id":"assertion.claim.frontier.arxiv-2607-26378","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26378","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26378 \"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.\"","support":[{"end":2590,"quote":"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":2458},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":1008},{"end":1929,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26378","source_sha256":"a9844859a67f0b5361c7695763460f84b629b3ed03d267e83a0bd08e4ba15ca4","start":1867}],"target_id":"claim.frontier.arxiv-2607-26378","target_kind":"node","target_sha256":"f1e2160e0a1e26c0dec672071f9b6f775b74ba59c2fb657283dcb97d39091614"}],"claim.frontier.arxiv-2607-26408":[{"id":"assertion.claim.frontier.arxiv-2607-26408","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26408","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26408 \"Phase control of multi-photon electron-positron pair creation from vacuum\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.\"","support":[{"end":2511,"quote":"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":2386},{"end":1005,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":976},{"end":2185,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26408","source_sha256":"e273583fb5a97ec5a308fb952578cd289a678cf0846a99780587b630959161f6","start":2123}],"target_id":"claim.frontier.arxiv-2607-26408","target_kind":"node","target_sha256":"582d7524ba1ecb7b26deed804ab8be76dde50cb2133cb826e6276b45ee7f5fa3"}],"claim.frontier.arxiv-2607-26433":[{"id":"assertion.claim.frontier.arxiv-2607-26433","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26433","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26433 \"Nonlinear quantum Fokker-Planck equation near equilibrium\" (CC BY 4.0, submitted 2026-07-29) reports: \"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.\"","support":[{"end":2533,"quote":"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":2365},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":964},{"end":1771,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26433","source_sha256":"df9b9172b6cbb8bfd7b890ae07a21dc932362aee1b9a225f0ba9b10072c5db9b","start":1709}],"target_id":"claim.frontier.arxiv-2607-26433","target_kind":"node","target_sha256":"eac5ad605c4a1782fdcf6b826a51278cff8bc312ea3ff02a4e08e41cd79f6710"}],"claim.frontier.arxiv-2607-26484":[{"id":"assertion.claim.frontier.arxiv-2607-26484","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26484","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26484 \"d-Spectral Bitopological Spaces\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.\"","support":[{"end":2155,"quote":"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":1999},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":964},{"end":1633,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26484","source_sha256":"5c8ab7d0316882fa682961dd256145ef9f93605806d35366e221926a11428664","start":1571}],"target_id":"claim.frontier.arxiv-2607-26484","target_kind":"node","target_sha256":"7dd662f7ac051247f248b9022e01f6cb646c4fec7b1cd8e7e1e4162b47fce86c"}],"claim.frontier.arxiv-2607-26508":[{"id":"assertion.claim.frontier.arxiv-2607-26508","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26508","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26508 \"An association measure for mixed-type variables\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the strong consistency and asymptotic normality of the estimator $ξ_n'$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ'$.\"","support":[{"end":3087,"quote":"We establish the strong consistency and asymptotic normality of the estimator $ξ_n&#39;$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ&#39;$.","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":2840},{"end":1081,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":1052},{"end":1994,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26508","source_sha256":"01b24f744b0a17c8d950850e936a87de4a0b970c3f70051ccceae5e25f55e710","start":1932}],"target_id":"claim.frontier.arxiv-2607-26508","target_kind":"node","target_sha256":"48e98026d88275a21e41d85600ec983462cfa4c09e85f269e9310758171e253e"}],"claim.frontier.arxiv-2607-26653":[{"id":"assertion.claim.frontier.arxiv-2607-26653","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26653","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26653 \"A new construction of the Riemannian deformation sequence\" (CC BY 4.0, submitted 2026-07-29) reports: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","support":[{"end":1771,"quote":"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":1605},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":964},{"end":1582,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26653","source_sha256":"2ca0f602b45bff793fc3addaea8084f5e38610de85f6e0b5aa0096519fe38734","start":1520}],"target_id":"claim.frontier.arxiv-2607-26653","target_kind":"node","target_sha256":"9ba7fb7021241a8d77d23e81f1ce9df2636f800e69c2b59bc95b081308b64c2b"}],"claim.frontier.arxiv-2607-26677":[{"id":"assertion.claim.frontier.arxiv-2607-26677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26677","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26677 \"A Harmonic-Map Proof of Mostow Rigidity\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish a sharp pointwise gradient estimate for this lift.\"","support":[{"end":1658,"quote":"We establish a sharp pointwise gradient estimate for this lift.","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":1595},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":964},{"end":1401,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26677","source_sha256":"a70f6a4056ec2c8ce3c2468b3d1e92a2a833fe76dfb4f569aa9f2b6c5989a658","start":1339}],"target_id":"claim.frontier.arxiv-2607-26677","target_kind":"node","target_sha256":"92e949e8b030b888f10861f5db2b483b3b21ef19a8ab3f52923b4330bc192646"}],"claim.frontier.arxiv-2607-26782":[{"id":"assertion.claim.frontier.arxiv-2607-26782","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26782","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26782 \"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws\" (CC BY 4.0, submitted 2026-07-29) reports: \"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.\"","support":[{"end":2958,"quote":"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":2723},{"end":1182,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":1153},{"end":2354,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26782","source_sha256":"1995c9ff4bb88663b0cb9c58fcf60167499d51d10a5f1081dc2229b1115111fe","start":2292}],"target_id":"claim.frontier.arxiv-2607-26782","target_kind":"node","target_sha256":"0c49b780a1dba2ec9494effd505d23bcb3a5d765f8a18e4cc64509a44469f8ec"}],"claim.frontier.arxiv-2607-26800":[{"id":"assertion.claim.frontier.arxiv-2607-26800","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26800","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26800 \"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","support":[{"end":3583,"quote":"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":3294},{"end":996,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":967},{"end":1863,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26800","source_sha256":"4c0d7a5303a1b7a3131c85bd6bc299c3f0cb4166d84b927942ebd9d33beb5724","start":1801}],"target_id":"claim.frontier.arxiv-2607-26800","target_kind":"node","target_sha256":"35b77d96b17347b03d3cffb6daa067de3c3d29fcdbdb2abf79f559dd9f632529"}],"claim.frontier.arxiv-2607-26890":[{"id":"assertion.claim.frontier.arxiv-2607-26890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26890","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26890 \"The Lie algebra generated by gradient vector fields\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","support":[{"end":2095,"quote":"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1958},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1008},{"end":1832,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26890","source_sha256":"66f681c931f86b5ccf4fbb53aecd43da621528403ad8208e9f39d8784cc496c0","start":1770}],"target_id":"claim.frontier.arxiv-2607-26890","target_kind":"node","target_sha256":"dff606171154a0629ce6719f8723a751ab803ede3cdf401e85505d5182d479cb"}],"claim.frontier.arxiv-2607-26932":[{"id":"assertion.claim.frontier.arxiv-2607-26932","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26932","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26932 \"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.\"","support":[{"end":8776,"quote":"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":8565},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":971},{"end":6930,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26932","source_sha256":"45a2813bfe179714ef6904a78d120a818bd9103262f0398a3994aba2bd04fe2b","start":6868}],"target_id":"claim.frontier.arxiv-2607-26932","target_kind":"node","target_sha256":"e2cf96620895331163ab5d4a9b90bd6a93481698c365704ca44fd331d316b635"}],"claim.frontier.arxiv-2607-26966":[{"id":"assertion.claim.frontier.arxiv-2607-26966","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.26966","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.26966 \"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","support":[{"end":2974,"quote":"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":2749},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":971},{"end":1859,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-26966","source_sha256":"813584c0f3a2efd94a477ec3f51e7b09fc40dfb47b45347e936e2e2b7d3a1b19","start":1797}],"target_id":"claim.frontier.arxiv-2607-26966","target_kind":"node","target_sha256":"8fa2d1c94261407c01c381a62df92b4d43bac53e18a282b9fd69630533abe02f"}],"claim.frontier.arxiv-2607-27037":[{"id":"assertion.claim.frontier.arxiv-2607-27037","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27037","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27037 \"SNT-Rank: Kronecker Products and Euclidean Distance Matrices\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","support":[{"end":2372,"quote":"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":2177},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":964},{"end":1649,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27037","source_sha256":"8cf8337c3c29b6773f766b38d09ebe74e659ad9a02dcae47210a9deb42065dd3","start":1587}],"target_id":"claim.frontier.arxiv-2607-27037","target_kind":"node","target_sha256":"6420c97b07d59c2264181b8e83dca1e86a422c0ea62564a43b10c8e4e3710445"}],"claim.frontier.arxiv-2607-27038":[{"id":"assertion.claim.frontier.arxiv-2607-27038","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27038","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27038 \"Irreducible non-holonomic modules for rational Cherednik algebras\" (CC BY 4.0, submitted 2026-07-29) reports: \"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.\"","support":[{"end":2490,"quote":"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":2308},{"end":993,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":964},{"end":1641,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27038","source_sha256":"1a4bd55e60d6f594d5b95c7d30de47521369774a758c81e7ab2de6106e1c882f","start":1579}],"target_id":"claim.frontier.arxiv-2607-27038","target_kind":"node","target_sha256":"6e2d1aa11a59e9908345352dee0ddf120986d6e5ca8d106581a09b76dded1bee"}],"claim.frontier.arxiv-2607-27062":[{"id":"assertion.claim.frontier.arxiv-2607-27062","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27062","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27062 \"PIKS: Universal Physics-Informed Kernel Methods\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.\"","support":[{"end":2974,"quote":"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":2740},{"end":1033,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":1004},{"end":1932,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27062","source_sha256":"c064ea4e5291af1a15baac2f853f48dd0687574b41068a81698e90238a12e64f","start":1870}],"target_id":"claim.frontier.arxiv-2607-27062","target_kind":"node","target_sha256":"6278f9976da6f3f8f647c5ce42fac408e42f1ede3966d79f45576caff4a65d9d"}],"claim.frontier.arxiv-2607-27098":[{"id":"assertion.claim.frontier.arxiv-2607-27098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27098","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27098 \"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.\"","support":[{"end":2549,"quote":"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":2390},{"end":1077,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":1048},{"end":1845,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27098","source_sha256":"c54cc9aab4487b14dd3e9fb0d1f538024453859e065519f2c5fae146150d9475","start":1783}],"target_id":"claim.frontier.arxiv-2607-27098","target_kind":"node","target_sha256":"da9307a1886d8ae7b4f08f97cb24dd5ce447312a13fac68cb2154ed2b169aee1"}],"claim.frontier.arxiv-2607-27105":[{"id":"assertion.claim.frontier.arxiv-2607-27105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27105","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27105 \"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach\" (CC BY 4.0, submitted 2026-07-29) reports: \"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.\"","support":[{"end":3410,"quote":"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":3293},{"end":1033,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":1004},{"end":2439,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27105","source_sha256":"224af9576eb2a882390dff27ed3ccfddb5ceebd4ced51cb6c77639685ec2b7fc","start":2377}],"target_id":"claim.frontier.arxiv-2607-27105","target_kind":"node","target_sha256":"be3a7cf12fff0676290338287de39d11d13c575ef6bdfa15c1394cbe849b7f20"}],"claim.frontier.arxiv-2607-27129":[{"id":"assertion.claim.frontier.arxiv-2607-27129","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27129","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27129 \"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.\"","support":[{"end":2318,"quote":"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":2101},{"end":994,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":965},{"end":1540,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27129","source_sha256":"579f4d6055e687a66665e086524988d1783b859448214432dbd4c73244859c1b","start":1478}],"target_id":"claim.frontier.arxiv-2607-27129","target_kind":"node","target_sha256":"440565e08d9a497ae57138bcb8c12e75a0790ad4766d4944c1707ab4c75c9b04"}],"claim.frontier.arxiv-2607-27158":[{"id":"assertion.claim.frontier.arxiv-2607-27158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27158","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27158 \"Outcomes of Grand Unified Symmetry Breaking\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.\"","support":[{"end":2164,"quote":"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":2051},{"end":1092,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":1063},{"end":1939,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27158","source_sha256":"81f22c652ff4467e72ef8afe39d000d7cf65d77c871d86023e1b244bdae06fc5","start":1877}],"target_id":"claim.frontier.arxiv-2607-27158","target_kind":"node","target_sha256":"75e7deba3bc3a6ecd612838205d91ac2d9589b6d7db45099b6f3efc91c98bddf"}],"claim.frontier.arxiv-2607-27181":[{"id":"assertion.claim.frontier.arxiv-2607-27181","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27181","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27181 \"Reconfigurable Optical Platform for One-way Quantum Communication Complexity\" (CC BY 4.0, submitted 2026-07-29) reports: \"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.\"","support":[{"end":2924,"quote":"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":2645},{"end":997,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":968},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27181","source_sha256":"c1a353fc9cc6cfeb74c38625ea67fab2f3a984c8765301434568681e0fc66869","start":1944}],"target_id":"claim.frontier.arxiv-2607-27181","target_kind":"node","target_sha256":"8e0835abded869ebf41e98ca2aa511ed845b5fa47e2623d6a60dd4440b95249e"}],"claim.frontier.arxiv-2607-27299":[{"id":"assertion.claim.frontier.arxiv-2607-27299","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27299","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27299 \"When trajectory-based bounds fail: information thermodynamics under noisy feedback\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","support":[{"end":3320,"quote":"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":3076},{"end":1064,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":1035},{"end":1910,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27299","source_sha256":"c2624e39f4494c88f52e32d4d9f282e9084049f8191ceee7b9a9b5c81c853237","start":1848}],"target_id":"claim.frontier.arxiv-2607-27299","target_kind":"node","target_sha256":"24c679f5e51642532e3c34cfcc402270d5618f11ec586febb149ddb3f0fd9d00"}],"claim.frontier.arxiv-2607-27312":[{"id":"assertion.claim.frontier.arxiv-2607-27312","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27312","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27312 \"Non-linear Evolution of Dark Plasma Subhalos\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.\"","support":[{"end":3125,"quote":"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":2925},{"end":1102,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":1073},{"end":2128,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27312","source_sha256":"9fe885601a735e1a1a0e6045a1f3fbb647a8d9ae7a4bf2c85037fb73277b1699","start":2066}],"target_id":"claim.frontier.arxiv-2607-27312","target_kind":"node","target_sha256":"b0400e6f53297467ba95aeb3c4ff4aadb4811e5074c68e6504b81889178055c9"}],"claim.frontier.arxiv-2607-27326":[{"id":"assertion.claim.frontier.arxiv-2607-27326","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27326","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27326 \"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints\" (CC BY 4.0, submitted 2026-07-29) reports: \"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.\"","support":[{"end":3886,"quote":"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":3676},{"end":1097,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":1068},{"end":2359,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27326","source_sha256":"ba6049578c3b38ac6ec95801f8de52ed1a55bbb9ddc33e97e4ba952352bdec15","start":2297}],"target_id":"claim.frontier.arxiv-2607-27326","target_kind":"node","target_sha256":"86ff7a8db9f175b4cf7fb65526e81491910b2c2031b07549b7ac38f3b02b17e2"}],"claim.frontier.arxiv-2607-27329":[{"id":"assertion.claim.frontier.arxiv-2607-27329","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27329","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27329 \"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.\"","support":[{"end":6990,"quote":"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":6701},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":971},{"end":5265,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27329","source_sha256":"05df240de258310d547033b2c20de3bccef207febc92be2eb8e744eb3dc9ede1","start":5203}],"target_id":"claim.frontier.arxiv-2607-27329","target_kind":"node","target_sha256":"63bbd01ca720ae74f4bdfb8a6903d944d520601a62b56f420814b48847791b56"}],"claim.frontier.arxiv-2607-27334":[{"id":"assertion.claim.frontier.arxiv-2607-27334","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27334","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27334 \"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.\"","support":[{"end":2990,"quote":"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":2855},{"end":1041,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":1012},{"end":1884,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27334","source_sha256":"bc7c726d4b6b8cf588186c4477f1a591c8f8bdac07c1d0a654342de18e4ca198","start":1822}],"target_id":"claim.frontier.arxiv-2607-27334","target_kind":"node","target_sha256":"fb528015dbfb5bdbd39cc7873e68dafe5ef045a1d9ab2abca0a2631ea6ddcb83"}],"claim.frontier.arxiv-2607-27344":[{"id":"assertion.claim.frontier.arxiv-2607-27344","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27344","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27344 \"Inflation in unimodular loop quantum cosmology\" (CC BY 4.0, submitted 2026-07-29) reports: \"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.\"","support":[{"end":2598,"quote":"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":2416},{"end":1091,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":1062},{"end":1798,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27344","source_sha256":"5ce8fa55116d602ede40ce7955c353ec9afcfd41354a70c1e1a86f8685a67aea","start":1736}],"target_id":"claim.frontier.arxiv-2607-27344","target_kind":"node","target_sha256":"1ea06e808f659bfac0bd8af60b86c45c0d7d4562afa9b62974d9c3ae7c06f279"}],"claim.frontier.arxiv-2607-27362":[{"id":"assertion.claim.frontier.arxiv-2607-27362","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27362","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27362 \"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.\"","support":[{"end":2502,"quote":"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":2347},{"end":1003,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":974},{"end":1952,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27362","source_sha256":"3509213639f2034d797775c38eb7045c6483f1597c0e794982b58c4735d2724c","start":1890}],"target_id":"claim.frontier.arxiv-2607-27362","target_kind":"node","target_sha256":"0c94f7d912a3661b0e5dbfb592d9096425cba8e17a9f838347d73dbff4601258"}],"claim.frontier.arxiv-2607-27388":[{"id":"assertion.claim.frontier.arxiv-2607-27388","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27388","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27388 \"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes\" (CC BY 4.0, submitted 2026-07-29) reports: \"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.\"","support":[{"end":2711,"quote":"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":2497},{"end":1088,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":1059},{"end":2231,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27388","source_sha256":"bb7cc27498256059937cf28899d0222246a289c304796dd8c22dc13f14aa442e","start":2169}],"target_id":"claim.frontier.arxiv-2607-27388","target_kind":"node","target_sha256":"8f8bbfa9a400fd8eb7693cad28abb11d7e4488dd5ca990d6c87399c1ddb3f8f1"}],"claim.frontier.arxiv-2607-27391":[{"id":"assertion.claim.frontier.arxiv-2607-27391","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27391","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27391 \"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties\" (CC BY 4.0, submitted 2026-07-29) reports: \"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.\"","support":[{"end":2591,"quote":"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":2445},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":971},{"end":1686,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27391","source_sha256":"13b6106067ea3f7a1c4e1684aaf3a146a155a6adaaa766d5943d3169c015e347","start":1624}],"target_id":"claim.frontier.arxiv-2607-27391","target_kind":"node","target_sha256":"bcf74d97ead0b3ded34232e0d5cf2f40d00b63b4d7012a026b7d24768b8d7e1d"}],"claim.frontier.arxiv-2607-27403":[{"id":"assertion.claim.frontier.arxiv-2607-27403","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27403","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27403 \"Handling Missingness and Censoring in Dirichlet Mixture Models\" (CC BY 4.0, submitted 2026-07-29) reports: \"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.\"","support":[{"end":3401,"quote":"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":3165},{"end":1037,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":1008},{"end":2001,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27403","source_sha256":"60ab4c8748c7799b130d1be8e1acbf6c189da02941eb6e0eebbb98cdcc12a33a","start":1939}],"target_id":"claim.frontier.arxiv-2607-27403","target_kind":"node","target_sha256":"ceeafa4b16be9b23215943668b1107821fa91a708227844f9d72f94e4ef1ad45"}],"claim.frontier.arxiv-2607-27502":[{"id":"assertion.claim.frontier.arxiv-2607-27502","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27502","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27502 \"Entropic signatures of the single-impurity Kondo state\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.\"","support":[{"end":3462,"quote":"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":3163},{"end":1006,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":977},{"end":2955,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27502","source_sha256":"9d46284a4e7d6fb6bc5b8598ce32d8da2e64d2d6f6148e0a7111e8bec6061d17","start":2893}],"target_id":"claim.frontier.arxiv-2607-27502","target_kind":"node","target_sha256":"a1b99449982edd48eb934d991380c3595df61d6e3bdd92c4598878b26a0253e8"}],"claim.frontier.arxiv-2607-27514":[{"id":"assertion.claim.frontier.arxiv-2607-27514","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27514","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27514 \"Sample Complexity for the 2-Gromov-Wasserstein Distance\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.\"","support":[{"end":2646,"quote":"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":2403},{"end":1081,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":1052},{"end":1965,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27514","source_sha256":"440ad1d65b9840d0ab9e52ca3d46f25bfccd15fcb398826d5d39d432145f05aa","start":1903}],"target_id":"claim.frontier.arxiv-2607-27514","target_kind":"node","target_sha256":"8d665e87a1b16d123e36f7f5f42d4d2115c5234ad993a527b9f88071e799ed6b"}],"claim.frontier.arxiv-2607-27515":[{"id":"assertion.claim.frontier.arxiv-2607-27515","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27515","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27515 \"Unified dark sector approaches to cosmological tensions\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.\"","support":[{"end":2253,"quote":"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":1892},{"end":1000,"quote":"<created>2026-07-29</created>","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":971},{"end":1645,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27515","source_sha256":"3291fff19c82a1dbe90924a35f3cdaf0871d295b2a0db912ce812dcccce87fab","start":1583}],"target_id":"claim.frontier.arxiv-2607-27515","target_kind":"node","target_sha256":"74f9ae17ec49bc8df87dcaf09a746f793d6439c0944a8fa464cc1fb8b2f4a8af"}],"claim.frontier.arxiv-2607-27582":[{"id":"assertion.claim.frontier.arxiv-2607-27582","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27582","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27582 \"Polynomial maps which are not good for nice recurrence and applications\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.\"","support":[{"end":2039,"quote":"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":1751},{"end":993,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":964},{"end":1573,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27582","source_sha256":"6d32a9243d0f25e409a50a6dd9cc0467e99a80371d7d15b5fa6b45f305f71870","start":1511}],"target_id":"claim.frontier.arxiv-2607-27582","target_kind":"node","target_sha256":"e8e68d6b0df12301db9661c2496713721b7628a4788dad9a65a41d879cbde2bf"}],"claim.frontier.arxiv-2607-27629":[{"id":"assertion.claim.frontier.arxiv-2607-27629","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27629","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27629 \"Curved Kakeya problems and the projective geometry of paths\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff's hairbrush argument, is equivalent to projective flatness of the associated spray.\"","support":[{"end":2872,"quote":"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff&#39;s hairbrush argument, is equivalent to projective flatness of the associated spray.","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":2686},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":1008},{"end":2154,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27629","source_sha256":"62a2801958a32017de50fca36fe1bfc9a493ed49c62055d085810a0b176cd436","start":2092}],"target_id":"claim.frontier.arxiv-2607-27629","target_kind":"node","target_sha256":"2e003ad7a246ef42aed817d476f4214b1c7a9333208a0378c35256229b0795b3"}],"claim.frontier.arxiv-2607-27646":[{"id":"assertion.claim.frontier.arxiv-2607-27646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27646","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27646 \"Metric Rigidity in Anchored Sobolev Spaces on Intervals\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.\"","support":[{"end":1943,"quote":"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":1811},{"end":993,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":964},{"end":1469,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-27646","source_sha256":"8a40cb18bec3504efcd07d89b134ef7ecc92a54653d1df2c635da9c991ae3309","start":1401}],"target_id":"claim.frontier.arxiv-2607-27646","target_kind":"node","target_sha256":"851d653d95093b2eb660f58138b505c08f583d0ac9d00be9f5a67690c7fb9c47"}],"claim.frontier.arxiv-2607-27707":[{"id":"assertion.claim.frontier.arxiv-2607-27707","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27707","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27707 \"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.\"","support":[{"end":3207,"quote":"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":2998},{"end":994,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":965},{"end":2114,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27707","source_sha256":"eb6e73bd886b6e8dbedca6ea5a96f07a84a60fe3594ad0647e45d65d53e52ef5","start":2052}],"target_id":"claim.frontier.arxiv-2607-27707","target_kind":"node","target_sha256":"eb9757e7f1d323afcd0564351b8547c5038397ac44f3f380bccfd73aa80e6e23"}],"claim.frontier.arxiv-2607-27799":[{"id":"assertion.claim.frontier.arxiv-2607-27799","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27799","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27799 \"When do Kernels Admit Characteristic Functions?\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","support":[{"end":2269,"quote":"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":2133},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":1008},{"end":1915,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27799","source_sha256":"731372bca7f4899b5e56ae49da85fd23233a741dc5853aa0cbbcbcad459c6a3e","start":1853}],"target_id":"claim.frontier.arxiv-2607-27799","target_kind":"node","target_sha256":"40064e0c61635f96e3d80ea26f1a42036686ace1fee24202642cccf220c6d54c"}],"claim.frontier.arxiv-2607-27805":[{"id":"assertion.claim.frontier.arxiv-2607-27805","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27805","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27805 \"Chaos in reason: How chain-of-thought LLMs can look for an answer\" (CC BY 4.0, submitted 2026-07-30) reports: \"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.\"","support":[{"end":2447,"quote":"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":2115},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":1022},{"end":1861,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27805","source_sha256":"63be4a623068445de0e33ff03f27c59265a55c2f5a939d8a259fd76d0b2daf42","start":1799}],"target_id":"claim.frontier.arxiv-2607-27805","target_kind":"node","target_sha256":"99615f83b8d6c1dd752bbb8878461ebb53fb60418ca622a598ee5d4628d14d72"}],"claim.frontier.arxiv-2607-27860":[{"id":"assertion.claim.frontier.arxiv-2607-27860","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27860","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27860 \"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings indicate that BLR gas density serves as the primary physical driver underlying the \"global\" Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.\"","support":[{"end":4507,"quote":"Our findings indicate that BLR gas density serves as the primary physical driver underlying the &#34;global&#34; Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":4252},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":971},{"end":3088,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27860","source_sha256":"0ca619897d44e1109e5c635a017c45960a78b9f906c9e6e6a6c551f5a797cfc9","start":3026}],"target_id":"claim.frontier.arxiv-2607-27860","target_kind":"node","target_sha256":"02c8184a383eaf1e244fc3544fcccc432fb2b6e36c22a640df192d98754145aa"}],"claim.frontier.arxiv-2607-27874":[{"id":"assertion.claim.frontier.arxiv-2607-27874","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27874","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27874 \"Non-conformal obstructions to bubble expansion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We uncover a new set of hydrodynamic obstructions to bubble expansion.\"","support":[{"end":2426,"quote":"We uncover a new set of hydrodynamic obstructions to bubble expansion.","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":2356},{"end":1137,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":1108},{"end":1959,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27874","source_sha256":"d5fa1c6000b2188c2bc0ca22c47087c38d8a3f47f6d180bc1e4d6a724bbec77c","start":1897}],"target_id":"claim.frontier.arxiv-2607-27874","target_kind":"node","target_sha256":"b6a11b8fea91f0e0f83577b6fcdd5decbe0e0e1eb40eddbbf071b0a87c45c2b2"}],"claim.frontier.arxiv-2607-27957":[{"id":"assertion.claim.frontier.arxiv-2607-27957","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27957","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27957 \"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography\" (CC BY 4.0, submitted 2026-07-30) reports: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","support":[{"end":2046,"quote":"We establish an exponential communication advantage enabled by multipartite quantum entanglement.","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":1949},{"end":997,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":968},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27957","source_sha256":"7819eb229c5b87b77bf347a31ed5f53dc75a45fb1c4e8b876a53e3d3c5803ef3","start":1864}],"target_id":"claim.frontier.arxiv-2607-27957","target_kind":"node","target_sha256":"5febb37ad9946baf5896ff0e908bdd269245f60035c411c3824934c85fb49482"}],"claim.frontier.arxiv-2607-27985":[{"id":"assertion.claim.frontier.arxiv-2607-27985","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.27985","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.27985 \"Bridging continuous control and Floquet driving for charging many-body spin chains\" (CC BY 4.0, submitted 2026-07-30) reports: \"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.\"","support":[{"end":3032,"quote":"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":2858},{"end":1156,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":1127},{"end":2217,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-27985","source_sha256":"4e21fb3abcfb88cff1e36d5f27f71cc1b2006fa8d67c11a6170949abe41acc6f","start":2155}],"target_id":"claim.frontier.arxiv-2607-27985","target_kind":"node","target_sha256":"8caf76a0b6a6a11a0a96ca9e9987b5de7720cef317b8ccdb4f3b934cf85662d0"}],"claim.frontier.arxiv-2607-28021":[{"id":"assertion.claim.frontier.arxiv-2607-28021","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28021","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28021 \"The Euler Characteristic Transform from a Convex Geometric Perspective\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.\"","support":[{"end":2575,"quote":"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":2390},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":1048},{"end":1732,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28021","source_sha256":"e290d9509be4ca2abff73ef3e5275cc14819cb56d0b6e4f18ac6c5fbf4567088","start":1670}],"target_id":"claim.frontier.arxiv-2607-28021","target_kind":"node","target_sha256":"f037b90b35960faea0dbbb35dd6808319438235370f7746d79ab40d1665c7fd8"}],"claim.frontier.arxiv-2607-28080":[{"id":"assertion.claim.frontier.arxiv-2607-28080","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28080","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28080 \"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems\" (CC BY 4.0, submitted 2026-07-31) reports: \"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.\"","support":[{"end":1990,"quote":"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1806},{"end":1073,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1044},{"end":1561,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28080","source_sha256":"540c69f3f4056916a2a9d4f1f9deecfa82d5d0e5b81811fb840657e14981606f","start":1499}],"target_id":"claim.frontier.arxiv-2607-28080","target_kind":"node","target_sha256":"fffc6292f0311238ff6128844cd4406163e04ef943f623c4fb8ba517092c6809"}],"claim.frontier.arxiv-2607-28095":[{"id":"assertion.claim.frontier.arxiv-2607-28095","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28095","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28095 \"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951\" (CC BY 4.0, submitted 2026-07-30) reports: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","support":[{"end":1981,"quote":"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":1843},{"end":995,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":966},{"end":1820,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28095","source_sha256":"0a6e711f1b3c6c27cf21c34c74a4eb1278330682dbf4618926aa685a0240b71f","start":1758}],"target_id":"claim.frontier.arxiv-2607-28095","target_kind":"node","target_sha256":"87d7d995e2f2af4bba03d46eee4c1738d7456de015fdf34551437075d1263dc6"}],"claim.frontier.arxiv-2607-28140":[{"id":"assertion.claim.frontier.arxiv-2607-28140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28140","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28140 \"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","support":[{"end":4572,"quote":"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":4441},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":1022},{"end":3114,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28140","source_sha256":"e82b3b5677b2e7b72b3eab749e64104383bbdf446f25eda321604a9c529b6f49","start":3052}],"target_id":"claim.frontier.arxiv-2607-28140","target_kind":"node","target_sha256":"9c58e7d41ab764d46e3af5fb7dca619b1a7f41eba8ca6b47cbe1b603d4ecb9d3"}],"claim.frontier.arxiv-2607-28161":[{"id":"assertion.claim.frontier.arxiv-2607-28161","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28161","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28161 \"A Mathematical Framework for Topological Causal Data Analysis\" (CC BY 4.0, submitted 2026-07-30) reports: \"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.\"","support":[{"end":2826,"quote":"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":2676},{"end":1125,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":1096},{"end":1805,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28161","source_sha256":"3df6880a72fb7c1f216e6637e7e578cdfbe7e5cce72cbddc5c6184974278f700","start":1743}],"target_id":"claim.frontier.arxiv-2607-28161","target_kind":"node","target_sha256":"9c254f11581d6100885bab74dac158d01cc3004076424298bb40e49a756b04b7"}],"claim.frontier.arxiv-2607-28168":[{"id":"assertion.claim.frontier.arxiv-2607-28168","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28168","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28168 \"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.\"","support":[{"end":2012,"quote":"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1867},{"end":1077,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1048},{"end":1589,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28168","source_sha256":"f2ceaebff0418c846db2b1c7893bcb6d6adeaf3d45dabbf1a10bf5a9dafc8753","start":1527}],"target_id":"claim.frontier.arxiv-2607-28168","target_kind":"node","target_sha256":"a658682e794029d130d306b92c23614394e69d4c5a6ac6580b45be5b96b09800"}],"claim.frontier.arxiv-2607-28173":[{"id":"assertion.claim.frontier.arxiv-2607-28173","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28173","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28173 \"Semi-supervised Hopfield model: Theoretical and Numerical results\" (CC BY 4.0, submitted 2026-07-30) reports: \"Using Guerra's interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.\"","support":[{"end":2980,"quote":"Using Guerra&#39;s interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":2727},{"end":1004,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":975},{"end":1754,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28173","source_sha256":"13127d67ea68e4870d2b4d04c4a79e6bce79c3ebeebfd3fa81f464a987e12921","start":1692}],"target_id":"claim.frontier.arxiv-2607-28173","target_kind":"node","target_sha256":"da66c71e614ef5dd61b18c706becbd35d43c64d8222317c66e91b693d3e552f6"}],"claim.frontier.arxiv-2607-28185":[{"id":"assertion.claim.frontier.arxiv-2607-28185","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28185","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"","support":[{"end":2430,"quote":"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.","source_id":"source.frontier.arxiv-2607-28185","source_sha256":"873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8","start":2222},{"end":1113,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28185","source_sha256":"873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8","start":1084},{"end":1608,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28185","source_sha256":"873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8","start":1546}],"target_id":"claim.frontier.arxiv-2607-28185","target_kind":"node","target_sha256":"a0573ef8da233252c54dad14f56441cb2288d5e671d3bc72be6b13962e66f133"}],"claim.frontier.arxiv-2607-28224":[{"id":"assertion.claim.frontier.arxiv-2607-28224","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28224","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"","support":[{"end":2801,"quote":"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.","source_id":"source.frontier.arxiv-2607-28224","source_sha256":"385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31","start":2490},{"end":993,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28224","source_sha256":"385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31","start":964},{"end":1903,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28224","source_sha256":"385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31","start":1841}],"target_id":"claim.frontier.arxiv-2607-28224","target_kind":"node","target_sha256":"08bcee38ef32f755fbc0c8ad1f648310879b82d5496957dc1d1e9cbf160b4c07"}],"claim.frontier.arxiv-2607-28276":[{"id":"assertion.claim.frontier.arxiv-2607-28276","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28276","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"","support":[{"end":3360,"quote":"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.","source_id":"source.frontier.arxiv-2607-28276","source_sha256":"83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408","start":3122},{"end":1161,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28276","source_sha256":"83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408","start":1132},{"end":1921,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28276","source_sha256":"83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408","start":1859}],"target_id":"claim.frontier.arxiv-2607-28276","target_kind":"node","target_sha256":"e438ccf59a58e083b4cde740d8989d36e9ddbfe612bf00269fc14b9c764e9108"}],"claim.frontier.arxiv-2607-28345":[{"id":"assertion.claim.frontier.arxiv-2607-28345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28345","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28345 \"The cycle C9 does not admit uniform mixing\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","support":[{"end":2070,"quote":"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1900},{"end":1041,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1012},{"end":1819,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28345","source_sha256":"bc19c8d29085b41df7d2a5abec17b9b989b415d02d3b4a3a46b2fbe8819a7797","start":1757}],"target_id":"claim.frontier.arxiv-2607-28345","target_kind":"node","target_sha256":"3e2cf53185038cf71d657facc6c40cc9487133becd0db16ad222c4f4c64d607e"}],"claim.frontier.arxiv-2607-28438":[{"id":"assertion.claim.frontier.arxiv-2607-28438","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28438","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28438 \"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology\" (CC BY 4.0, submitted 2026-07-30) reports: \"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.\"","support":[{"end":4675,"quote":"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":4412},{"end":1098,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":1069},{"end":2796,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28438","source_sha256":"24d4cdc7c8b301ae8ab5e31693d536d900f4442cfdf623d31ecec68bfba86177","start":2734}],"target_id":"claim.frontier.arxiv-2607-28438","target_kind":"node","target_sha256":"b8ce99cbe0652fa472bc9589631fa7e62ccd5a3bfaee9965d65d479def0c6ad0"}],"claim.frontier.arxiv-2607-28441":[{"id":"assertion.claim.frontier.arxiv-2607-28441","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28441","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28441 \"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.\"","support":[{"end":3177,"quote":"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":3048},{"end":1063,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":1034},{"end":2908,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28441","source_sha256":"f99f1992cda7eaefb5665d08e7f538035327397c40ba2279215884b331880b1d","start":2846}],"target_id":"claim.frontier.arxiv-2607-28441","target_kind":"node","target_sha256":"a2403589095fcde979f5ca253b69442352028595dedf3280448f96c69545f3af"}],"claim.frontier.arxiv-2607-28471":[{"id":"assertion.claim.frontier.arxiv-2607-28471","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28471","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28471 \"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model\" (CC BY 4.0, submitted 2026-07-30) reports: \"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.\"","support":[{"end":2174,"quote":"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":1858},{"end":1004,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":975},{"end":1545,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28471","source_sha256":"50fe46318305cde9f8eee03050f7ba490edf1251039da698f0f90302d86a4c24","start":1483}],"target_id":"claim.frontier.arxiv-2607-28471","target_kind":"node","target_sha256":"4d65add9d1a652622288cdbb251ed1d754d2ce5ddd939538c425fb2bf7684b25"}],"claim.frontier.arxiv-2607-28479":[{"id":"assertion.claim.frontier.arxiv-2607-28479","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28479","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28479 \"Mitigating quantum decoherence via global optimal control\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","support":[{"end":2588,"quote":"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":2353},{"end":1054,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":1025},{"end":2330,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2607-28479","source_sha256":"f50a75e8b19276102e3eee59f3248f9ec05eeb0c12f39589eaba70f6919f4524","start":2262}],"target_id":"claim.frontier.arxiv-2607-28479","target_kind":"node","target_sha256":"be5180441008a7ade05fea1460a32e1f2cbbd0c81ed2ad46288e08540662d86a"}],"claim.frontier.arxiv-2607-28491":[{"id":"assertion.claim.frontier.arxiv-2607-28491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28491","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28491 \"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.\"","support":[{"end":2313,"quote":"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":2148},{"end":1006,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":977},{"end":1533,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28491","source_sha256":"7f457d39c74ce17c64aadc4c1eac4a0ad3d5f674abd8b476bba1a88c0a59b040","start":1471}],"target_id":"claim.frontier.arxiv-2607-28491","target_kind":"node","target_sha256":"26a76ce6d80a2aaa14d76e8725098c1c859296ce39ebfedb46d40ffa61a73805"}],"claim.frontier.arxiv-2607-28504":[{"id":"assertion.claim.frontier.arxiv-2607-28504","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28504","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28504 \"Spacetime Layout and Logical Compilation of Color Code\" (CC BY 4.0, submitted 2026-07-30) reports: \"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.\"","support":[{"end":1834,"quote":"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":1681},{"end":997,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":968},{"end":1567,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28504","source_sha256":"34dae123ede5c6893bbc0da167d81ce2229ab3c44d2c5412878e0a9e83fcbd24","start":1505}],"target_id":"claim.frontier.arxiv-2607-28504","target_kind":"node","target_sha256":"ff1ac951d9ed4aecfa94ee757facca1d01417019039b2c65ca31a6a1c009df6f"}],"claim.frontier.arxiv-2607-28524":[{"id":"assertion.claim.frontier.arxiv-2607-28524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28524","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28524 \"Exact chiral symmetry with quantum signal processing\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.\"","support":[{"end":2832,"quote":"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":2588},{"end":1091,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":1062},{"end":2087,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28524","source_sha256":"fd45c2d6bbce7335d83ce2f9991a8abeae0383c41141b8d6f2202ede64341ed5","start":2025}],"target_id":"claim.frontier.arxiv-2607-28524","target_kind":"node","target_sha256":"3b8ce9e72aa71a1e155f84e0d5c27aea4cbe0fe65f72e7baacdecfccab393ee0"}],"claim.frontier.arxiv-2607-28533":[{"id":"assertion.claim.frontier.arxiv-2607-28533","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28533","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28533 \"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","support":[{"end":2517,"quote":"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":2308},{"end":1062,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":1033},{"end":1870,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28533","source_sha256":"2ea03e70993ab377d2482d012db006d03de1f3178bdb9e32874fd7375f13ab93","start":1808}],"target_id":"claim.frontier.arxiv-2607-28533","target_kind":"node","target_sha256":"c1b1780ec5d82a44b14c1d005bacf5e739b0dcd7863ad0302d15b4ac571e8c1a"}],"claim.frontier.arxiv-2607-28597":[{"id":"assertion.claim.frontier.arxiv-2607-28597","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28597","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28597 \"Nonnuclear Bunce-Deddens algebras\" (CC BY 4.0, submitted 2026-07-30) reports: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","support":[{"end":2109,"quote":"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1908},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1008},{"end":1575,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28597","source_sha256":"3f37670723f1f4757610eb0b99a74107431452e1908b0ee7dd6bbb9ddd24bfa6","start":1513}],"target_id":"claim.frontier.arxiv-2607-28597","target_kind":"node","target_sha256":"071654c5deecf1957f82740c3fc8eb53489f4f39c41d46441f521e2ef05b84ac"}],"claim.frontier.arxiv-2607-28604":[{"id":"assertion.claim.frontier.arxiv-2607-28604","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28604","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28604 \"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.\"","support":[{"end":2924,"quote":"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":2721},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":971},{"end":1882,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28604","source_sha256":"bb976771f2fa94a5397e003c6bcbeb222ae2ab53b6fbdc60453151aad32ebb14","start":1820}],"target_id":"claim.frontier.arxiv-2607-28604","target_kind":"node","target_sha256":"036ad19aae6d25034450ee483989f781c3c592f4abf7fdbdadbb5d106800cbf0"}],"claim.frontier.arxiv-2607-28690":[{"id":"assertion.claim.frontier.arxiv-2607-28690","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28690","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28690 \"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces\" (CC BY 4.0, submitted 2026-07-30) reports: \"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.\"","support":[{"end":3124,"quote":"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":2930},{"end":1003,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":974},{"end":1669,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28690","source_sha256":"86d45228102a0b6658816784faee609473744699ffda1d1526e6fb85c599afb1","start":1607}],"target_id":"claim.frontier.arxiv-2607-28690","target_kind":"node","target_sha256":"9a658a83f4c23f5a8ffbab78661bdcd78e072d6650375bc9f096d3621a702f42"}],"claim.frontier.arxiv-2607-28714":[{"id":"assertion.claim.frontier.arxiv-2607-28714","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28714","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28714 \"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our analysis reveals significant variations in polarimetric properties tracking the dip.\"","support":[{"end":4899,"quote":"Our analysis reveals significant variations in polarimetric properties tracking the dip.","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":4811},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":971},{"end":4426,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28714","source_sha256":"f2d2d4b3d31e2c20418934bc9303b78d7c50bc6267576512adf7ba45f91efb7f","start":4364}],"target_id":"claim.frontier.arxiv-2607-28714","target_kind":"node","target_sha256":"d965eaa9d8f201577617ac8b5370674482bfc09144d278bd158d3869e08411ae"}],"claim.frontier.arxiv-2607-28717":[{"id":"assertion.claim.frontier.arxiv-2607-28717","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28717","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28717 \"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets\" (CC BY 4.0, submitted 2026-07-30) reports: \"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.\"","support":[{"end":3782,"quote":"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":3566},{"end":1051,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":1022},{"end":2610,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28717","source_sha256":"8120472187b24e28a3d5cf2ada0d3be0d250acb9be1a6316e81c9a5b546d2f4a","start":2548}],"target_id":"claim.frontier.arxiv-2607-28717","target_kind":"node","target_sha256":"77875b340d08e67e2a93fafc6745f094351d6383ad58c0048fc97df8639d5898"}],"claim.frontier.arxiv-2607-28736":[{"id":"assertion.claim.frontier.arxiv-2607-28736","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28736","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28736 \"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","support":[{"end":3244,"quote":"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":2961},{"end":1102,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":1073},{"end":2145,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28736","source_sha256":"4e29b79312ac9ea2d347ad09c336c3cd2c1eb8472aa8c2ff31db7904d8706599","start":2083}],"target_id":"claim.frontier.arxiv-2607-28736","target_kind":"node","target_sha256":"3e792c3213e1d05553aafbb815c36d86bae6ccdf00c1099f3acd7db2a2b2e4f2"}],"claim.frontier.arxiv-2607-28738":[{"id":"assertion.claim.frontier.arxiv-2607-28738","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28738","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28738 \"Obstructions to Traversable Wormholes in Einstein-Dirac Theory\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.\"","support":[{"end":2265,"quote":"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":2074},{"end":994,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":965},{"end":1487,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28738","source_sha256":"7960d4754b48484eff458d6947e57ab460fde888cbcf85740b1096252f558d46","start":1425}],"target_id":"claim.frontier.arxiv-2607-28738","target_kind":"node","target_sha256":"98a901bd013b2ad114cb8a9c1c4e8c8fba8824aab7af2091fa749a87b3125440"}],"claim.frontier.arxiv-2607-28739":[{"id":"assertion.claim.frontier.arxiv-2607-28739","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28739","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28739 \"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.\"","support":[{"end":4908,"quote":"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":4724},{"end":1000,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":971},{"end":3753,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28739","source_sha256":"b01f0df6d0a583f5157e4e1dba921b789f61e82e7378105a35258bde119f9875","start":3691}],"target_id":"claim.frontier.arxiv-2607-28739","target_kind":"node","target_sha256":"5737a6f2e286968f45bf9100c8eb3dc7976c48e9714769595b8b8ce38d616947"}],"claim.frontier.arxiv-2607-28746":[{"id":"assertion.claim.frontier.arxiv-2607-28746","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28746","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28746 \"From Horizon Microstates to the Black Hole Membrane\" (CC BY 4.0, submitted 2026-07-30) reports: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","support":[{"end":1777,"quote":"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1687},{"end":1086,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1057},{"end":1574,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28746","source_sha256":"3c718800b9f5822765f54f2744483ef78e38182a9d41ed244d3cd9ecaa53d814","start":1512}],"target_id":"claim.frontier.arxiv-2607-28746","target_kind":"node","target_sha256":"c72613e586ac06150904fdbd28656eefda4042f35ce6e7e2819a54abe89214f0"}],"claim.frontier.arxiv-2607-28780":[{"id":"assertion.claim.frontier.arxiv-2607-28780","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28780","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"","support":[{"end":3206,"quote":"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.","source_id":"source.frontier.arxiv-2607-28780","source_sha256":"500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d","start":3025},{"end":1119,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28780","source_sha256":"500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d","start":1090},{"end":1942,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28780","source_sha256":"500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d","start":1880}],"target_id":"claim.frontier.arxiv-2607-28780","target_kind":"node","target_sha256":"f1b29633f5a9da54579e1b85dd2d21ca4f70cb73d2eb8aab5d92ae9010191d47"}],"claim.frontier.arxiv-2607-28833":[{"id":"assertion.claim.frontier.arxiv-2607-28833","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28833","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"","support":[{"end":3066,"quote":"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.","source_id":"source.frontier.arxiv-2607-28833","source_sha256":"45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776","start":2903},{"end":1033,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28833","source_sha256":"45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776","start":1004},{"end":2156,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28833","source_sha256":"45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776","start":2094}],"target_id":"claim.frontier.arxiv-2607-28833","target_kind":"node","target_sha256":"2f1fc64b249d57aed7c4731d7d0f33bcf58db73a2d62c06759ae838acca89ccf"}],"claim.frontier.arxiv-2607-28883":[{"id":"assertion.claim.frontier.arxiv-2607-28883","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28883","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28883 \"The VORTEX cavity for the RADES axion haloscope\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","support":[{"end":2741,"quote":"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":2502},{"end":1050,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":1021},{"end":2281,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28883","source_sha256":"61feb8079a071b8a1bf2f56536c40e3c32757e72fc411791ee43e847375f5b92","start":2219}],"target_id":"claim.frontier.arxiv-2607-28883","target_kind":"node","target_sha256":"b3a9405f110630017bdc76652d4bf11e6f52206a10455a4493e822e81c56ef67"}],"claim.frontier.arxiv-2607-28893":[{"id":"assertion.claim.frontier.arxiv-2607-28893","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28893","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28893 \"Piecewise isometry groups of Euclidean tessellations\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","support":[{"end":2471,"quote":"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":2229},{"end":1037,"quote":"<created>2026-07-30</created>","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":1008},{"end":1817,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28893","source_sha256":"38b0b5b8be0dbc5372265c79098cc43e6e8c49b9beb7ee2150dc88ce5979d015","start":1755}],"target_id":"claim.frontier.arxiv-2607-28893","target_kind":"node","target_sha256":"1f1510aea931c42c6454768e3094d4f080ed1518a859e367a23bb02c05d8cde2"}],"claim.frontier.arxiv-2607-28919":[{"id":"assertion.claim.frontier.arxiv-2607-28919","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.28919","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.28919 \"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.\"","support":[{"end":3267,"quote":"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":3085},{"end":1000,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":971},{"end":2602,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-28919","source_sha256":"b34ac9c600fb962e2a4d4f1f9ce48b8747c7a6462c1ac77fb647cff655f98e32","start":2540}],"target_id":"claim.frontier.arxiv-2607-28919","target_kind":"node","target_sha256":"934232ee2bd37831760d1e98eefc57334c939b3d559bfb049cbd80ae1cfaf74e"}],"claim.frontier.arxiv-2607-29073":[{"id":"assertion.claim.frontier.arxiv-2607-29073","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29073","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29073 \"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.\"","support":[{"end":3387,"quote":"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":3258},{"end":997,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":968},{"end":2744,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29073","source_sha256":"a8759fc203b691a37a50941b9900bf2211493ca0f34f636c814199c8b12309ea","start":2682}],"target_id":"claim.frontier.arxiv-2607-29073","target_kind":"node","target_sha256":"2e0132025e74994feddd75b265a5efa7c4017fbaf9a4b24a80f478ca0555d89e"}],"claim.frontier.arxiv-2607-29123":[{"id":"assertion.claim.frontier.arxiv-2607-29123","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29123","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29123 \"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control\" (CC BY 4.0, submitted 2026-07-31) reports: \"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.\"","support":[{"end":3741,"quote":"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":3500},{"end":997,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":968},{"end":2025,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29123","source_sha256":"5025871939ac8f3f03da75cf234447b5ec93238767a7cc48df2bb68a7aa91242","start":1963}],"target_id":"claim.frontier.arxiv-2607-29123","target_kind":"node","target_sha256":"c201d621d0f9dabbb785194f256a28c5d7101e102443cd84d1588b8c11083e61"}],"claim.frontier.arxiv-2607-29131":[{"id":"assertion.claim.frontier.arxiv-2607-29131","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29131","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29131 \"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.\"","support":[{"end":2648,"quote":"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":2354},{"end":995,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":966},{"end":1926,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29131","source_sha256":"9ce8f782863e4c0de172e9a7085db4bfedb0ce1e265e81309bb73877208a6905","start":1864}],"target_id":"claim.frontier.arxiv-2607-29131","target_kind":"node","target_sha256":"c51af67854ad770652cb436958636bd792a8d4bd6f4e406dcb1560d25f244f09"}],"claim.frontier.arxiv-2607-29270":[{"id":"assertion.claim.frontier.arxiv-2607-29270","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2607.29270","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2607.29270 \"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications\" (CC BY 4.0, submitted 2026-07-31) reports: \"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.\"","support":[{"end":2509,"quote":"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":2302},{"end":1033,"quote":"<created>2026-07-31</created>","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":1004},{"end":1832,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2607-29270","source_sha256":"3a2c60bcc257e8ea06087ea1629d63ffe1634133dc1816670f8f46fbc7dcf8b8","start":1770}],"target_id":"claim.frontier.arxiv-2607-29270","target_kind":"node","target_sha256":"de55d26538b9e15457e9fac048cb6462afe4830569b59e1727bd9f2f44f7a245"}],"claim.frontier.arxiv-2608-00445":[{"id":"assertion.claim.frontier.arxiv-2608-00445","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00445","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00445 \"Exact detection threshold of the packing test\" (CC0 1.0, submitted 2026-08-01) reports: \"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.\"","support":[{"end":1717,"quote":"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1489},{"end":1037,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1008},{"end":1466,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2608-00445","source_sha256":"2a5997e258f444e62df155115fc2ed8cc565cfb225d5517456262f3e694c99f0","start":1398}],"target_id":"claim.frontier.arxiv-2608-00445","target_kind":"node","target_sha256":"481a7fd6920ffabcc7faf6f183539f0bda56f89fd4aa3d6599701810bab52b61"}],"claim.frontier.arxiv-2608-00649":[{"id":"assertion.claim.frontier.arxiv-2608-00649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00649","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00649 \"Empirical optimal transport potentials: fast rates and a functional central limit theorem\" (CC BY 4.0, submitted 2026-08-01) reports: \"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.\"","support":[{"end":3285,"quote":"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":3134},{"end":1037,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":1008},{"end":1866,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-00649","source_sha256":"ee3e63aa602abf1fe5ec395bf1b2c4ba6601c90dbb6945899327fb288e775e92","start":1804}],"target_id":"claim.frontier.arxiv-2608-00649","target_kind":"node","target_sha256":"2535ec7e2ffd1b35b99c60209f71aa59120843a074e5d3575b1ffec32b9de9d7"}],"claim.frontier.arxiv-2608-00708":[{"id":"assertion.claim.frontier.arxiv-2608-00708","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00708","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00708 \"Hypergraphs on Riemannian manifolds and their double homology\" (CC BY 4.0, submitted 2026-08-01) reports: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","support":[{"end":1960,"quote":"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":1653},{"end":993,"quote":"<created>2026-08-01</created>","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":964},{"end":1468,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-00708","source_sha256":"c4498b1d37818f8862b4960fe4ecc5a50bd67b96bcd8cb45e64ca5818db61f90","start":1406}],"target_id":"claim.frontier.arxiv-2608-00708","target_kind":"node","target_sha256":"9a0dfb1a95664707f405a250d5d558b76eb0a8080348d20156ff6be43c1af670"}],"claim.frontier.arxiv-2608-00959":[{"id":"assertion.claim.frontier.arxiv-2608-00959","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.00959","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"","support":[{"end":2971,"quote":"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.","source_id":"source.frontier.arxiv-2608-00959","source_sha256":"7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc","start":2679},{"end":1113,"quote":"<created>2026-08-02</created>","source_id":"source.frontier.arxiv-2608-00959","source_sha256":"7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc","start":1084},{"end":1630,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-00959","source_sha256":"7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc","start":1568}],"target_id":"claim.frontier.arxiv-2608-00959","target_kind":"node","target_sha256":"cc8190458a87f0e09885708954ef5b3680081f57bbec918a8304c0c9ee54184b"}],"claim.frontier.arxiv-2608-01220":[{"id":"assertion.claim.frontier.arxiv-2608-01220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.01220","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"","support":[{"end":3720,"quote":"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.","source_id":"source.frontier.arxiv-2608-01220","source_sha256":"01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268","start":3591},{"end":1161,"quote":"<created>2026-08-02</created>","source_id":"source.frontier.arxiv-2608-01220","source_sha256":"01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268","start":1132},{"end":2346,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-01220","source_sha256":"01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268","start":2284}],"target_id":"claim.frontier.arxiv-2608-01220","target_kind":"node","target_sha256":"08d4f16884ff34ab2eb12519ccb18c619e1ba2fe06807158df2e88270c1f2f55"}],"claim.frontier.arxiv-2608-02079":[{"id":"assertion.claim.frontier.arxiv-2608-02079","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02079","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"","support":[{"end":3557,"quote":"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.","source_id":"source.frontier.arxiv-2608-02079","source_sha256":"8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e","start":3323},{"end":1073,"quote":"<created>2026-08-03</created>","source_id":"source.frontier.arxiv-2608-02079","source_sha256":"8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e","start":1044},{"end":2177,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02079","source_sha256":"8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e","start":2115}],"target_id":"claim.frontier.arxiv-2608-02079","target_kind":"node","target_sha256":"e5edce4b2315fc743cc869cec2fcf60f4f81e4a54521ae777cd88be9a6cffbf7"}],"claim.frontier.arxiv-2608-02244":[{"id":"assertion.claim.frontier.arxiv-2608-02244","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02244","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"","support":[{"end":2669,"quote":"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.","source_id":"source.frontier.arxiv-2608-02244","source_sha256":"c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65","start":2593},{"end":1073,"quote":"<created>2026-08-03</created>","source_id":"source.frontier.arxiv-2608-02244","source_sha256":"c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65","start":1044},{"end":1683,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02244","source_sha256":"c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65","start":1621}],"target_id":"claim.frontier.arxiv-2608-02244","target_kind":"node","target_sha256":"743c5add749989b4464633c90f8aa6a9adf0fc57455492446d7ccec1d222118f"}],"claim.frontier.arxiv-2608-02799":[{"id":"assertion.claim.frontier.arxiv-2608-02799","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02799","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02799 \"A Hyperfinite Framework for Score-Based Generative Modeling\" (CC BY 4.0, submitted 2026-08-03) reports: \"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.\"","support":[{"end":2077,"quote":"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1885},{"end":1117,"quote":"<created>2026-08-03</created>","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1088},{"end":1576,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02799","source_sha256":"1680fe3ba1198f8c7b23a8b46645cc262d31768c9e4a7f0e6bf3d2629e8a39ef","start":1514}],"target_id":"claim.frontier.arxiv-2608-02799","target_kind":"node","target_sha256":"5aa63fc180e758460bfa662f32349c6521faf4a27d5f4bff60cabbdfac96224b"}],"claim.frontier.arxiv-2608-02976":[{"id":"assertion.claim.frontier.arxiv-2608-02976","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02976","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"","support":[{"end":3372,"quote":"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.","source_id":"source.frontier.arxiv-2608-02976","source_sha256":"09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1","start":3184},{"end":1033,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-02976","source_sha256":"09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1","start":1004},{"end":1818,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02976","source_sha256":"09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1","start":1756}],"target_id":"claim.frontier.arxiv-2608-02976","target_kind":"node","target_sha256":"e0208edca4e1ed4f60e4c5b38ac6d2cd08b8361bf4f4752b24f2cf751c3ff74f"}],"claim.frontier.arxiv-2608-02978":[{"id":"assertion.claim.frontier.arxiv-2608-02978","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.02978","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"","support":[{"end":2826,"quote":"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.","source_id":"source.frontier.arxiv-2608-02978","source_sha256":"d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f","start":2628},{"end":1033,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-02978","source_sha256":"d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f","start":1004},{"end":1669,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-02978","source_sha256":"d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f","start":1607}],"target_id":"claim.frontier.arxiv-2608-02978","target_kind":"node","target_sha256":"c7d8752a652edf07a25e8b05fbbc1a79f33691ddb4a36f189b5ac9a3bb13ec41"}],"claim.frontier.arxiv-2608-03192":[{"id":"assertion.claim.frontier.arxiv-2608-03192","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.03192","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.03192 \"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations\" (CC BY 4.0, submitted 2026-08-04) reports: \"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.\"","support":[{"end":3254,"quote":"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":2984},{"end":1037,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":1008},{"end":1696,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-03192","source_sha256":"18e7cc2271ac231a16fb479689147d44f9aa174671c035f96cad84f92dbbc350","start":1634}],"target_id":"claim.frontier.arxiv-2608-03192","target_kind":"node","target_sha256":"f6af3e54909d02eb7630b17b080796c56618da1aa9b40a0ef3710565f6ae2b36"}],"claim.frontier.arxiv-2608-03832":[{"id":"assertion.claim.frontier.arxiv-2608-03832","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.03832","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.03832 \"Reduced-rank Generalized Bilinear Models\" (CC BY 4.0, submitted 2026-08-04) reports: \"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.\"","support":[{"end":2439,"quote":"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":2169},{"end":993,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":964},{"end":1564,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-03832","source_sha256":"3d86c9b7529f62f2e0ffdbfe35176d8c695078f164666cc514d1294829d84f97","start":1502}],"target_id":"claim.frontier.arxiv-2608-03832","target_kind":"node","target_sha256":"8fe09e9a705ce0eaf87c894445ab35be4ea345d0478a0c217a5351ff0e00f1da"}],"claim.frontier.arxiv-2608-03967":[{"id":"assertion.claim.frontier.arxiv-2608-03967","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.03967","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"","support":[{"end":2389,"quote":"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.","source_id":"source.frontier.arxiv-2608-03967","source_sha256":"bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55","start":2055},{"end":1033,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-03967","source_sha256":"bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55","start":1004},{"end":1675,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-03967","source_sha256":"bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55","start":1613}],"target_id":"claim.frontier.arxiv-2608-03967","target_kind":"node","target_sha256":"bcb8b2bbdc627943ea3d1fd487e21f2b1b9fc41c5c5eb532aa10e78e6b85a376"}],"claim.frontier.arxiv-2608-04133":[{"id":"assertion.claim.frontier.arxiv-2608-04133","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.04133","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"","support":[{"end":2953,"quote":"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.","source_id":"source.frontier.arxiv-2608-04133","source_sha256":"c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb","start":2710},{"end":1077,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-04133","source_sha256":"c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb","start":1048},{"end":2347,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-04133","source_sha256":"c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb","start":2285}],"target_id":"claim.frontier.arxiv-2608-04133","target_kind":"node","target_sha256":"6bc0ecdfe554d2bede0800c6ab81b1503c9bf856154d8540a2454bd4edc0e51a"}],"claim.frontier.arxiv-2608-04208":[{"id":"assertion.claim.frontier.arxiv-2608-04208","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.04208","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.04208 \"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests\" (CC BY 4.0, submitted 2026-08-04) reports: \"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.\"","support":[{"end":2355,"quote":"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":2183},{"end":1081,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":1052},{"end":2001,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-04208","source_sha256":"5bc2319c285b67bf52cc944a64eb68cf17ce4ed5e4206b6861ee16a7d011f671","start":1939}],"target_id":"claim.frontier.arxiv-2608-04208","target_kind":"node","target_sha256":"94f452a8cc248d71a71db4ef1077d3dd5fafad26c267c23e74dc588d40ad2bcc"}],"claim.frontier.arxiv-2608-04227":[{"id":"assertion.claim.frontier.arxiv-2608-04227","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.04227","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"","support":[{"end":2703,"quote":"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.","source_id":"source.frontier.arxiv-2608-04227","source_sha256":"abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb","start":2523},{"end":1033,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-04227","source_sha256":"abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb","start":1004},{"end":1816,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-04227","source_sha256":"abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb","start":1754}],"target_id":"claim.frontier.arxiv-2608-04227","target_kind":"node","target_sha256":"b23bb78dd5b45e70a53acecdd6d09f2bb9ec9afd212936fc0f602d06affb8e07"}],"claim.frontier.arxiv-2608-05348":[{"id":"assertion.claim.frontier.arxiv-2608-05348","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.05348","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"","support":[{"end":2796,"quote":"In both cases, TSDM significantly outperforms existing scheduling policies.","source_id":"source.frontier.arxiv-2608-05348","source_sha256":"54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4","start":2721},{"end":1033,"quote":"<created>2026-08-05</created>","source_id":"source.frontier.arxiv-2608-05348","source_sha256":"54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4","start":1004},{"end":1653,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-05348","source_sha256":"54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4","start":1591}],"target_id":"claim.frontier.arxiv-2608-05348","target_kind":"node","target_sha256":"7fb323d587831f4c9c942c8de1ec0b5513ec729f3d747cd868de16aa413f6f15"}],"claim.frontier.arxiv-2608-05481":[{"id":"assertion.claim.frontier.arxiv-2608-05481","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.05481","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"","support":[{"end":3056,"quote":"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.","source_id":"source.frontier.arxiv-2608-05481","source_sha256":"a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c","start":2885},{"end":995,"quote":"<created>2026-08-06</created>","source_id":"source.frontier.arxiv-2608-05481","source_sha256":"a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c","start":966},{"end":2071,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-05481","source_sha256":"a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c","start":2009}],"target_id":"claim.frontier.arxiv-2608-05481","target_kind":"node","target_sha256":"c9a402016800f9b54db71f8fb34ca5a81251c460b4ed4c9f832e334bc1c7027a"}],"claim.frontier.arxiv-2608-06711":[{"id":"assertion.claim.frontier.arxiv-2608-06711","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.06711","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.06711 \"Conditions for Quantum Advantage in AC Power Flow\" (CC BY 4.0, submitted 2026-08-07) reports: \"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.\"","support":[{"end":2370,"quote":"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":2223},{"end":1081,"quote":"<created>2026-08-07</created>","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":1052},{"end":1983,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-06711","source_sha256":"620b48be6955a446eea752007c283cd95c88eb00ba26323551d30775355c83d4","start":1921}],"target_id":"claim.frontier.arxiv-2608-06711","target_kind":"node","target_sha256":"5855fd3085a0f97cb9e0e3cfe61fcf30ffb4b2d391e11998233482ecd972a43e"}],"claim.frontier.arxiv-2608-07289":[{"id":"assertion.claim.frontier.arxiv-2608-07289","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.07289","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"","support":[{"end":4481,"quote":"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.","source_id":"source.frontier.arxiv-2608-07289","source_sha256":"cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3","start":4289},{"end":1113,"quote":"<created>2026-08-07</created>","source_id":"source.frontier.arxiv-2608-07289","source_sha256":"cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3","start":1084},{"end":2527,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-07289","source_sha256":"cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3","start":2465}],"target_id":"claim.frontier.arxiv-2608-07289","target_kind":"node","target_sha256":"1fbadbe0683aaa090614e2b25ef1e6624b9ce0d9cc932895cff294653261dc43"}],"claim.frontier.arxiv-2608-08151":[{"id":"assertion.claim.frontier.arxiv-2608-08151","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.08151","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"","support":[{"end":3414,"quote":"These results show that reference orbit geometry is an important part of defensive cislunar mission design.","source_id":"source.frontier.arxiv-2608-08151","source_sha256":"be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121","start":3307},{"end":1033,"quote":"<created>2026-08-11</created>","source_id":"source.frontier.arxiv-2608-08151","source_sha256":"be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121","start":1004},{"end":2147,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-08151","source_sha256":"be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121","start":2085}],"target_id":"claim.frontier.arxiv-2608-08151","target_kind":"node","target_sha256":"418f661b816ee96760c776caffdcaddbb0731fcad8c70c1726fd8506afc6d9eb"}],"claim.frontier.arxiv-2608-08599":[{"id":"assertion.claim.frontier.arxiv-2608-08599","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.08599","quantifiers":"Only what the quoted sentence states","time":"2026-08-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"","support":[{"end":3044,"quote":"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.","source_id":"source.frontier.arxiv-2608-08599","source_sha256":"6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d","start":2857},{"end":993,"quote":"<created>2026-08-09</created>","source_id":"source.frontier.arxiv-2608-08599","source_sha256":"6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d","start":964},{"end":1942,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-08599","source_sha256":"6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d","start":1880}],"target_id":"claim.frontier.arxiv-2608-08599","target_kind":"node","target_sha256":"bbf18907cd43f8752bbfdc399422ce23594c15350b056f40983a7fc667f3e7b0"}],"claim.frontier.arxiv-2608-10254":[{"id":"assertion.claim.frontier.arxiv-2608-10254","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.10254","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"","support":[{"end":3638,"quote":"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.","source_id":"source.frontier.arxiv-2608-10254","source_sha256":"818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61","start":3476},{"end":1073,"quote":"<created>2026-08-10</created>","source_id":"source.frontier.arxiv-2608-10254","source_sha256":"818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61","start":1044},{"end":2146,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-10254","source_sha256":"818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61","start":2084}],"target_id":"claim.frontier.arxiv-2608-10254","target_kind":"node","target_sha256":"e6111919699867aae8824c063308a9fdf7c5dcfff8b9e00b91f43edb777f17c2"}],"claim.frontier.arxiv-2608-10825":[{"id":"assertion.claim.frontier.arxiv-2608-10825","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.10825","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"","support":[{"end":2641,"quote":"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.","source_id":"source.frontier.arxiv-2608-10825","source_sha256":"cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab","start":2517},{"end":1033,"quote":"<created>2026-08-11</created>","source_id":"source.frontier.arxiv-2608-10825","source_sha256":"cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab","start":1004},{"end":2131,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-10825","source_sha256":"cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab","start":2069}],"target_id":"claim.frontier.arxiv-2608-10825","target_kind":"node","target_sha256":"5b6cad2caad586b624a67aaccd674490521eda4a47b8857ffa06714a2eb1153f"}],"claim.frontier.arxiv-2608-11175":[{"id":"assertion.claim.frontier.arxiv-2608-11175","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.11175","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"","support":[{"end":3022,"quote":"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.","source_id":"source.frontier.arxiv-2608-11175","source_sha256":"9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7","start":2849},{"end":1073,"quote":"<created>2026-08-11</created>","source_id":"source.frontier.arxiv-2608-11175","source_sha256":"9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7","start":1044},{"end":1930,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-11175","source_sha256":"9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7","start":1868}],"target_id":"claim.frontier.arxiv-2608-11175","target_kind":"node","target_sha256":"61a3b6758674c089ff292933f056a52824662e5a8d2f8681f7488ce616290b83"}],"claim.frontier.arxiv-2608-11929":[{"id":"assertion.claim.frontier.arxiv-2608-11929","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.11929","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"","support":[{"end":2855,"quote":"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.","source_id":"source.frontier.arxiv-2608-11929","source_sha256":"9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c","start":2725},{"end":1033,"quote":"<created>2026-08-12</created>","source_id":"source.frontier.arxiv-2608-11929","source_sha256":"9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c","start":1004},{"end":1800,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-11929","source_sha256":"9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c","start":1738}],"target_id":"claim.frontier.arxiv-2608-11929","target_kind":"node","target_sha256":"88c54a9768888234ddab15fee435818a796534a6bc0452a14c336224d174f46f"}],"claim.frontier.arxiv-2608-12037":[{"id":"assertion.claim.frontier.arxiv-2608-12037","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.12037","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"","support":[{"end":3333,"quote":"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.","source_id":"source.frontier.arxiv-2608-12037","source_sha256":"911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c","start":3116},{"end":1073,"quote":"<created>2026-08-12</created>","source_id":"source.frontier.arxiv-2608-12037","source_sha256":"911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c","start":1044},{"end":2292,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-12037","source_sha256":"911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c","start":2230}],"target_id":"claim.frontier.arxiv-2608-12037","target_kind":"node","target_sha256":"f9a5d11f4ca15ccecff427fcc92faa1557867617cf2a0098fac1982eb91b24c1"}],"claim.frontier.arxiv-2608-12393":[{"id":"assertion.claim.frontier.arxiv-2608-12393","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.12393","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"","support":[{"end":2556,"quote":"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.","source_id":"source.frontier.arxiv-2608-12393","source_sha256":"b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249","start":2361},{"end":995,"quote":"<created>2026-08-04</created>","source_id":"source.frontier.arxiv-2608-12393","source_sha256":"b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249","start":966},{"end":1561,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-12393","source_sha256":"b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249","start":1499}],"target_id":"claim.frontier.arxiv-2608-12393","target_kind":"node","target_sha256":"67d9855cccf7e4f46b446c253650ec227fdbfb9d85750e956c614588ac64ebfb"}],"claim.frontier.arxiv-2608-12398":[{"id":"assertion.claim.frontier.arxiv-2608-12398","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.12398","quantifiers":"Only what the quoted sentence states","time":"2026-08-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"","support":[{"end":3064,"quote":"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.","source_id":"source.frontier.arxiv-2608-12398","source_sha256":"71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87","start":2620},{"end":1035,"quote":"<created>2026-08-08</created>","source_id":"source.frontier.arxiv-2608-12398","source_sha256":"71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87","start":1006},{"end":1565,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-12398","source_sha256":"71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87","start":1503}],"target_id":"claim.frontier.arxiv-2608-12398","target_kind":"node","target_sha256":"f702c66c52e59efcce94160d673b356d4692ff4cc2e87570e5a2864d7956fa1e"}],"claim.frontier.arxiv-2608-14134":[{"id":"assertion.claim.frontier.arxiv-2608-14134","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.14134","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.14134 \"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization\" (CC BY 4.0, submitted 2026-08-14) reports: \"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.\"","support":[{"end":2713,"quote":"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":2441},{"end":1043,"quote":"<created>2026-08-14</created>","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":1014},{"end":1827,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-14134","source_sha256":"38079a801466d680d7f508a71c53e0aeb938f435bb243e26cd5e0690f6252923","start":1765}],"target_id":"claim.frontier.arxiv-2608-14134","target_kind":"node","target_sha256":"6c01ab4e708a9863ca23be95fdbb6722a752a446a36140911af6137473faf259"}],"claim.frontier.arxiv-2608-16290":[{"id":"assertion.claim.frontier.arxiv-2608-16290","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.16290","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"","support":[{"end":2576,"quote":"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).","source_id":"source.frontier.arxiv-2608-16290","source_sha256":"33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb","start":2394},{"end":993,"quote":"<created>2026-08-17</created>","source_id":"source.frontier.arxiv-2608-16290","source_sha256":"33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb","start":964},{"end":1876,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-16290","source_sha256":"33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb","start":1814}],"target_id":"claim.frontier.arxiv-2608-16290","target_kind":"node","target_sha256":"4fe1ecbb34884d2d9f3c8e7b47b3c34d0385c84822822c2db70e7765b8387f76"}],"claim.frontier.arxiv-2608-18060":[{"id":"assertion.claim.frontier.arxiv-2608-18060","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.18060","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"","support":[{"end":2304,"quote":"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.","source_id":"source.frontier.arxiv-2608-18060","source_sha256":"3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77","start":2133},{"end":1033,"quote":"<created>2026-08-18</created>","source_id":"source.frontier.arxiv-2608-18060","source_sha256":"3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77","start":1004},{"end":1953,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-18060","source_sha256":"3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77","start":1891}],"target_id":"claim.frontier.arxiv-2608-18060","target_kind":"node","target_sha256":"2b63e910a14d93725ef45ef1b13b0eb28ca103821e3489d92cdf0d2d5d6047e5"}],"claim.frontier.arxiv-2608-18396":[{"id":"assertion.claim.frontier.arxiv-2608-18396","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.18396","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"","support":[{"end":3393,"quote":"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.","source_id":"source.frontier.arxiv-2608-18396","source_sha256":"7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45","start":3192},{"end":1033,"quote":"<created>2026-08-18</created>","source_id":"source.frontier.arxiv-2608-18396","source_sha256":"7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45","start":1004},{"end":2284,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-18396","source_sha256":"7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45","start":2222}],"target_id":"claim.frontier.arxiv-2608-18396","target_kind":"node","target_sha256":"4230aa909bd349a12725da9500e49d54790d908f75fe72e2e5a0d245a9b10ebc"}],"claim.frontier.arxiv-2608-19170":[{"id":"assertion.claim.frontier.arxiv-2608-19170","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.19170","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.19170 \"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective\" (CC BY 4.0, submitted 2026-08-19) reports: \"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.\"","support":[{"end":3400,"quote":"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":3101},{"end":1077,"quote":"<created>2026-08-19</created>","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":1048},{"end":2200,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-19170","source_sha256":"acc98d449aa2cccd3dff352a3a140d71ed6ba772f017df3f9c72439d62d95d9d","start":2138}],"target_id":"claim.frontier.arxiv-2608-19170","target_kind":"node","target_sha256":"d1533e2f019c87bea123cecd0ee7da01d73d5464e068e7f3c4298e7afe487dfc"}],"claim.frontier.arxiv-2608-19416":[{"id":"assertion.claim.frontier.arxiv-2608-19416","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.19416","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"","support":[{"end":3331,"quote":"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.","source_id":"source.frontier.arxiv-2608-19416","source_sha256":"cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84","start":3100},{"end":993,"quote":"<created>2026-08-19</created>","source_id":"source.frontier.arxiv-2608-19416","source_sha256":"cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84","start":964},{"end":2018,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-19416","source_sha256":"cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84","start":1956}],"target_id":"claim.frontier.arxiv-2608-19416","target_kind":"node","target_sha256":"d8889c499e52fd77720c142cb996ad430a20bddda827cc20d73b92099d872058"}],"claim.frontier.arxiv-2608-20723":[{"id":"assertion.claim.frontier.arxiv-2608-20723","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.20723","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"","support":[{"end":2726,"quote":"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.","source_id":"source.frontier.arxiv-2608-20723","source_sha256":"d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718","start":2440},{"end":1035,"quote":"<created>2026-08-21</created>","source_id":"source.frontier.arxiv-2608-20723","source_sha256":"d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718","start":1006},{"end":1470,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-20723","source_sha256":"d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718","start":1408}],"target_id":"claim.frontier.arxiv-2608-20723","target_kind":"node","target_sha256":"21b5d82da39fbfd3204bb12044e33b8beab6817bfdb1dadb65fe180b87d13fff"}],"claim.frontier.arxiv-2608-21020":[{"id":"assertion.claim.frontier.arxiv-2608-21020","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.21020","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"","support":[{"end":2699,"quote":"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.","source_id":"source.frontier.arxiv-2608-21020","source_sha256":"02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e","start":2574},{"end":993,"quote":"<created>2026-08-21</created>","source_id":"source.frontier.arxiv-2608-21020","source_sha256":"02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e","start":964},{"end":1903,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-21020","source_sha256":"02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e","start":1841}],"target_id":"claim.frontier.arxiv-2608-21020","target_kind":"node","target_sha256":"4a98426444f281136895acd6e36e2811a1b5fd9b30e99d03b0fd39e10f09efc3"}],"claim.frontier.arxiv-2608-21764":[{"id":"assertion.claim.frontier.arxiv-2608-21764","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.21764","quantifiers":"Only what the quoted sentence states","time":"2026-08-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"","support":[{"end":4113,"quote":"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.","source_id":"source.frontier.arxiv-2608-21764","source_sha256":"0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0","start":3898},{"end":1073,"quote":"<created>2026-08-22</created>","source_id":"source.frontier.arxiv-2608-21764","source_sha256":"0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0","start":1044},{"end":2321,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-21764","source_sha256":"0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0","start":2259}],"target_id":"claim.frontier.arxiv-2608-21764","target_kind":"node","target_sha256":"bbca19c1f8cb4c2b7006f9ca2cea484fefedad6b5e602ae8830f9741e4e3e7de"}],"claim.frontier.arxiv-2608-23972":[{"id":"assertion.claim.frontier.arxiv-2608-23972","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.23972","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"","support":[{"end":3405,"quote":"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.","source_id":"source.frontier.arxiv-2608-23972","source_sha256":"b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48","start":3189},{"end":1073,"quote":"<created>2026-08-25</created>","source_id":"source.frontier.arxiv-2608-23972","source_sha256":"b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48","start":1044},{"end":2450,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-23972","source_sha256":"b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48","start":2388}],"target_id":"claim.frontier.arxiv-2608-23972","target_kind":"node","target_sha256":"2f4e8209d8fab0d2f13b2da9f1793dd68549b9ff6995792b8c8d9926e2d25ad2"}],"claim.frontier.arxiv-2608-24219":[{"id":"assertion.claim.frontier.arxiv-2608-24219","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.24219","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"","support":[{"end":2538,"quote":"We also find that attractive faces are more prototypical in both shape and latent space.","source_id":"source.frontier.arxiv-2608-24219","source_sha256":"f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173","start":2450},{"end":1035,"quote":"<created>2026-08-25</created>","source_id":"source.frontier.arxiv-2608-24219","source_sha256":"f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173","start":1006},{"end":1737,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-24219","source_sha256":"f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173","start":1675}],"target_id":"claim.frontier.arxiv-2608-24219","target_kind":"node","target_sha256":"822853ae1bd10336e56f0bb36069f737aea135aaf8f7ec4f5bfb5cfab0bb7ed4"}],"claim.frontier.arxiv-2608-26093":[{"id":"assertion.claim.frontier.arxiv-2608-26093","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.26093","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"","support":[{"end":2481,"quote":"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.","source_id":"source.frontier.arxiv-2608-26093","source_sha256":"c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8","start":2385},{"end":1157,"quote":"<created>2026-08-26</created>","source_id":"source.frontier.arxiv-2608-26093","source_sha256":"c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8","start":1128},{"end":2183,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-26093","source_sha256":"c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8","start":2121}],"target_id":"claim.frontier.arxiv-2608-26093","target_kind":"node","target_sha256":"bc56588a8d495fccbfa72e7ed6c6a57dbf51cf4fec8551bf0607c7e60c3556bb"}],"claim.frontier.arxiv-2608-27536":[{"id":"assertion.claim.frontier.arxiv-2608-27536","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.27536","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"","support":[{"end":2483,"quote":"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.","source_id":"source.frontier.arxiv-2608-27536","source_sha256":"527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d","start":2291},{"end":1033,"quote":"<created>2026-08-27</created>","source_id":"source.frontier.arxiv-2608-27536","source_sha256":"527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d","start":1004},{"end":2118,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-27536","source_sha256":"527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d","start":2056}],"target_id":"claim.frontier.arxiv-2608-27536","target_kind":"node","target_sha256":"27bcb430fa3c83f7a7d1398d207348ef0a72dd0d9aef4475517ece783e174ba0"}],"claim.frontier.arxiv-2608-28387":[{"id":"assertion.claim.frontier.arxiv-2608-28387","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.28387","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"","support":[{"end":3297,"quote":"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.","source_id":"source.frontier.arxiv-2608-28387","source_sha256":"29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44","start":2895},{"end":1035,"quote":"<created>2026-08-28</created>","source_id":"source.frontier.arxiv-2608-28387","source_sha256":"29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44","start":1006},{"end":2151,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-28387","source_sha256":"29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44","start":2089}],"target_id":"claim.frontier.arxiv-2608-28387","target_kind":"node","target_sha256":"6b07394df7c72280fcb7cc78d2d8826e8f36f255599684ae336b3116e2138c15"}],"claim.frontier.arxiv-2608-31034":[{"id":"assertion.claim.frontier.arxiv-2608-31034","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2608.31034","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"","support":[{"end":3336,"quote":"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.","source_id":"source.frontier.arxiv-2608-31034","source_sha256":"c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37","start":3083},{"end":993,"quote":"<created>2026-08-31</created>","source_id":"source.frontier.arxiv-2608-31034","source_sha256":"c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37","start":964},{"end":2203,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2608-31034","source_sha256":"c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37","start":2141}],"target_id":"claim.frontier.arxiv-2608-31034","target_kind":"node","target_sha256":"ec0bd10015ab5dca339cb414086f312a1612f4b6f53ac333f77f67b8a91388df"}],"claim.frontier.arxiv-2609-02071":[{"id":"assertion.claim.frontier.arxiv-2609-02071","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.02071","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"","support":[{"end":3018,"quote":"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.","source_id":"source.frontier.arxiv-2609-02071","source_sha256":"fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff","start":2834},{"end":1077,"quote":"<created>2026-09-02</created>","source_id":"source.frontier.arxiv-2609-02071","source_sha256":"fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff","start":1048},{"end":1680,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-02071","source_sha256":"fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff","start":1618}],"target_id":"claim.frontier.arxiv-2609-02071","target_kind":"node","target_sha256":"039e2ea49be10d4d3da82b47e1b5c6f61e412d8559c04b850256203485307c30"}],"claim.frontier.arxiv-2609-05100":[{"id":"assertion.claim.frontier.arxiv-2609-05100","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.05100","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.05100 \"Layered mixed matrices and reaction networks\" (CC BY 4.0, submitted 2026-09-04) reports: \"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.\"","support":[{"end":2529,"quote":"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":2331},{"end":1083,"quote":"<created>2026-09-04</created>","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":1054},{"end":1873,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-05100","source_sha256":"d2af57ad3a6b5706912657aa3dbc133a4aa6859300510a6857b1e5b1fdf9da09","start":1811}],"target_id":"claim.frontier.arxiv-2609-05100","target_kind":"node","target_sha256":"71ee9b4a59f1c039ae93fc00db3ea32311df2dc51848ca5cd569a3cc0e38ff78"}],"claim.frontier.arxiv-2609-05749":[{"id":"assertion.claim.frontier.arxiv-2609-05749","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.05749","quantifiers":"Only what the quoted sentence states","time":"2026-09-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"","support":[{"end":3037,"quote":"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.","source_id":"source.frontier.arxiv-2609-05749","source_sha256":"a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6","start":2829},{"end":1113,"quote":"<created>2026-09-13</created>","source_id":"source.frontier.arxiv-2609-05749","source_sha256":"a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6","start":1084},{"end":2010,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-05749","source_sha256":"a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6","start":1948}],"target_id":"claim.frontier.arxiv-2609-05749","target_kind":"node","target_sha256":"8c190861d210e319ded5562e3121eac7e3ea8ecbcf32bfe9f737fbde3b1e8287"}],"claim.frontier.arxiv-2609-05763":[{"id":"assertion.claim.frontier.arxiv-2609-05763","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.05763","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"","support":[{"end":3379,"quote":"We demonstrate this versatility across three applications.","source_id":"source.frontier.arxiv-2609-05763","source_sha256":"923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896","start":3321},{"end":1033,"quote":"<created>2026-09-21</created>","source_id":"source.frontier.arxiv-2609-05763","source_sha256":"923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896","start":1004},{"end":2526,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-05763","source_sha256":"923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896","start":2464}],"target_id":"claim.frontier.arxiv-2609-05763","target_kind":"node","target_sha256":"6a40b680ba9f871e726982e0df10ac8d16f87732cfb9e4dfe28adad7ca5bde57"}],"claim.frontier.arxiv-2609-06066":[{"id":"assertion.claim.frontier.arxiv-2609-06066","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.06066","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"","support":[{"end":2747,"quote":"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.","source_id":"source.frontier.arxiv-2609-06066","source_sha256":"69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe","start":2581},{"end":993,"quote":"<created>2026-09-05</created>","source_id":"source.frontier.arxiv-2609-06066","source_sha256":"69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe","start":964},{"end":1759,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-06066","source_sha256":"69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe","start":1697}],"target_id":"claim.frontier.arxiv-2609-06066","target_kind":"node","target_sha256":"b4d6e7484b0f2f26120741889f7e2dce8b232b445f2f4f797fbf407e287cba12"}],"claim.frontier.arxiv-2609-06163":[{"id":"assertion.claim.frontier.arxiv-2609-06163","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.06163","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"","support":[{"end":2809,"quote":"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.","source_id":"source.frontier.arxiv-2609-06163","source_sha256":"c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61","start":2673},{"end":1033,"quote":"<created>2026-09-05</created>","source_id":"source.frontier.arxiv-2609-06163","source_sha256":"c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61","start":1004},{"end":1715,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-06163","source_sha256":"c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61","start":1653}],"target_id":"claim.frontier.arxiv-2609-06163","target_kind":"node","target_sha256":"6ce239788a388f3ed75f291462aa025883af7db4c61e81f88db58c5851a04201"}],"claim.frontier.arxiv-2609-08218":[{"id":"assertion.claim.frontier.arxiv-2609-08218","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.08218","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"","support":[{"end":2959,"quote":"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.","source_id":"source.frontier.arxiv-2609-08218","source_sha256":"a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e","start":2845},{"end":1033,"quote":"<created>2026-09-09</created>","source_id":"source.frontier.arxiv-2609-08218","source_sha256":"a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e","start":1004},{"end":1648,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-08218","source_sha256":"a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e","start":1586}],"target_id":"claim.frontier.arxiv-2609-08218","target_kind":"node","target_sha256":"e64e423c33260e0218665ec9cc382917080218f7f2bb40857cce80d0ea6736f4"}],"claim.frontier.arxiv-2609-11530":[{"id":"assertion.claim.frontier.arxiv-2609-11530","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.11530","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"","support":[{"end":3650,"quote":"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.","source_id":"source.frontier.arxiv-2609-11530","source_sha256":"89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8","start":3454},{"end":995,"quote":"<created>2026-09-10</created>","source_id":"source.frontier.arxiv-2609-11530","source_sha256":"89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8","start":966},{"end":2209,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-11530","source_sha256":"89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8","start":2147}],"target_id":"claim.frontier.arxiv-2609-11530","target_kind":"node","target_sha256":"f6ced05713c8c792ff8a98644885b116b83444ed35c3596967af6642dba86227"}],"claim.frontier.arxiv-2609-12016":[{"id":"assertion.claim.frontier.arxiv-2609-12016","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.12016","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"","support":[{"end":2870,"quote":"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.","source_id":"source.frontier.arxiv-2609-12016","source_sha256":"e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af","start":2518},{"end":1073,"quote":"<created>2026-09-10</created>","source_id":"source.frontier.arxiv-2609-12016","source_sha256":"e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af","start":1044},{"end":2078,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-12016","source_sha256":"e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af","start":2016}],"target_id":"claim.frontier.arxiv-2609-12016","target_kind":"node","target_sha256":"1407a2a40fe480f7757cb800d33da002b2148b04b8adf7e3aa6991aed0928205"}],"claim.frontier.arxiv-2609-12486":[{"id":"assertion.claim.frontier.arxiv-2609-12486","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.12486","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"","support":[{"end":2642,"quote":"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.","source_id":"source.frontier.arxiv-2609-12486","source_sha256":"bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8","start":2338},{"end":1157,"quote":"<created>2026-09-11</created>","source_id":"source.frontier.arxiv-2609-12486","source_sha256":"bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8","start":1128},{"end":1887,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-12486","source_sha256":"bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8","start":1825}],"target_id":"claim.frontier.arxiv-2609-12486","target_kind":"node","target_sha256":"4a8ebb64b931d95b0c5218130b7195bea59b74a1b7b9182f4541a29da18615ae"}],"claim.frontier.arxiv-2609-12866":[{"id":"assertion.claim.frontier.arxiv-2609-12866","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.12866","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"","support":[{"end":2599,"quote":"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).","source_id":"source.frontier.arxiv-2609-12866","source_sha256":"e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f","start":2445},{"end":993,"quote":"<created>2026-09-11</created>","source_id":"source.frontier.arxiv-2609-12866","source_sha256":"e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f","start":964},{"end":1898,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-12866","source_sha256":"e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f","start":1836}],"target_id":"claim.frontier.arxiv-2609-12866","target_kind":"node","target_sha256":"6fb5d07ac292366f14bd618e81b15c716cf7d1f4890cb3390114c1caf547cab9"}],"claim.frontier.arxiv-2609-13345":[{"id":"assertion.claim.frontier.arxiv-2609-13345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.13345","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.13345 \"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data\" (CC BY 4.0, submitted 2026-09-11) reports: \"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.\"","support":[{"end":3114,"quote":"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":2868},{"end":1121,"quote":"<created>2026-09-11</created>","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":1092},{"end":2079,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-13345","source_sha256":"b5342c8fd023c8b97bfcc3d9be692f36cb0415a188a0b6aedc25d4d8a2ef0d31","start":2017}],"target_id":"claim.frontier.arxiv-2609-13345","target_kind":"node","target_sha256":"2f360f3f349b774217c6e767666d7e256196481350c13cc7be45090f586e1e45"}],"claim.frontier.arxiv-2609-14022":[{"id":"assertion.claim.frontier.arxiv-2609-14022","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.14022","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"","support":[{"end":5211,"quote":"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.","source_id":"source.frontier.arxiv-2609-14022","source_sha256":"dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25","start":4982},{"end":1033,"quote":"<created>2026-09-12</created>","source_id":"source.frontier.arxiv-2609-14022","source_sha256":"dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25","start":1004},{"end":3688,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-14022","source_sha256":"dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25","start":3626}],"target_id":"claim.frontier.arxiv-2609-14022","target_kind":"node","target_sha256":"1e7b0c229b300ae0c765be5e9dff4ce547e888afe590ae9a25063c587f663e1a"}],"claim.frontier.arxiv-2609-16258":[{"id":"assertion.claim.frontier.arxiv-2609-16258","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.16258","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"","support":[{"end":2131,"quote":"Does AI outperform all techniques, or only some, and how is this changing?","source_id":"source.frontier.arxiv-2609-16258","source_sha256":"dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a","start":2057},{"end":1159,"quote":"<created>2026-09-14</created>","source_id":"source.frontier.arxiv-2609-16258","source_sha256":"dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a","start":1130},{"end":1890,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-16258","source_sha256":"dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a","start":1828}],"target_id":"claim.frontier.arxiv-2609-16258","target_kind":"node","target_sha256":"b63a96fb3fedb2f5e089b9841b38da80f9f1e2f5c871752d9028b4f41e475324"}],"claim.frontier.arxiv-2609-16353":[{"id":"assertion.claim.frontier.arxiv-2609-16353","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.16353","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"","support":[{"end":2477,"quote":"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.","source_id":"source.frontier.arxiv-2609-16353","source_sha256":"6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61","start":2333},{"end":1077,"quote":"<created>2026-09-14</created>","source_id":"source.frontier.arxiv-2609-16353","source_sha256":"6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61","start":1048},{"end":1870,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-16353","source_sha256":"6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61","start":1808}],"target_id":"claim.frontier.arxiv-2609-16353","target_kind":"node","target_sha256":"308626710d74f0f311a0557985dbae09d96b47474e6736bea1f5cacf744f1aef"}],"claim.frontier.arxiv-2609-16899":[{"id":"assertion.claim.frontier.arxiv-2609-16899","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.16899","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"","support":[{"end":3229,"quote":"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.","source_id":"source.frontier.arxiv-2609-16899","source_sha256":"ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952","start":3034},{"end":1033,"quote":"<created>2026-09-15</created>","source_id":"source.frontier.arxiv-2609-16899","source_sha256":"ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952","start":1004},{"end":2156,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-16899","source_sha256":"ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952","start":2094}],"target_id":"claim.frontier.arxiv-2609-16899","target_kind":"node","target_sha256":"439daac35e888b0458f5f4a8499371b529122e2c736647b8ca92d11a1613044d"}],"claim.frontier.arxiv-2609-17042":[{"id":"assertion.claim.frontier.arxiv-2609-17042","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.17042","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"","support":[{"end":2950,"quote":"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.","source_id":"source.frontier.arxiv-2609-17042","source_sha256":"e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779","start":2732},{"end":1075,"quote":"<created>2026-09-15</created>","source_id":"source.frontier.arxiv-2609-17042","source_sha256":"e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779","start":1046},{"end":1830,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-17042","source_sha256":"e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779","start":1768}],"target_id":"claim.frontier.arxiv-2609-17042","target_kind":"node","target_sha256":"dfd363fcf52796128cbf35327a99ab3b4afd63931a94569aa3641633dee4b997"}],"claim.frontier.arxiv-2609-18467":[{"id":"assertion.claim.frontier.arxiv-2609-18467","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.18467","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"","support":[{"end":2880,"quote":"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.","source_id":"source.frontier.arxiv-2609-18467","source_sha256":"cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63","start":2727},{"end":993,"quote":"<created>2026-09-16</created>","source_id":"source.frontier.arxiv-2609-18467","source_sha256":"cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63","start":964},{"end":2227,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-18467","source_sha256":"cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63","start":2165}],"target_id":"claim.frontier.arxiv-2609-18467","target_kind":"node","target_sha256":"8673127090530ef79c91ce67d21a0961a0d2324c28977595f997b55b436942ba"}],"claim.frontier.arxiv-2609-19386":[{"id":"assertion.claim.frontier.arxiv-2609-19386","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.19386","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.19386 \"Omitted Variable Bias in Difference-in-Differences Designs\" (CC BY 4.0, submitted 2026-09-16) reports: \"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.\"","support":[{"end":2723,"quote":"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":2350},{"end":1037,"quote":"<created>2026-09-16</created>","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":1008},{"end":1988,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-19386","source_sha256":"dde2082255fe54988fece4ef9d4cad491cbe889eadfba4640a6b218d2668b938","start":1926}],"target_id":"claim.frontier.arxiv-2609-19386","target_kind":"node","target_sha256":"e8c1bc8de0395c581648b92fc418ee61dd2476fea6c1d366414d1d13515f6367"}],"claim.frontier.arxiv-2609-19468":[{"id":"assertion.claim.frontier.arxiv-2609-19468","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.19468","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"","support":[{"end":3331,"quote":"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.","source_id":"source.frontier.arxiv-2609-19468","source_sha256":"7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8","start":3226},{"end":993,"quote":"<created>2026-09-16</created>","source_id":"source.frontier.arxiv-2609-19468","source_sha256":"7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8","start":964},{"end":2805,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-19468","source_sha256":"7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8","start":2743}],"target_id":"claim.frontier.arxiv-2609-19468","target_kind":"node","target_sha256":"20b06709a97ffe2fdd32187dbe5ad19e3076dfb72acae2020827f39ef0798c20"}],"claim.frontier.arxiv-2609-21057":[{"id":"assertion.claim.frontier.arxiv-2609-21057","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21057","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"","support":[{"end":2620,"quote":"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.","source_id":"source.frontier.arxiv-2609-21057","source_sha256":"ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085","start":2183},{"end":1157,"quote":"<created>2026-09-17</created>","source_id":"source.frontier.arxiv-2609-21057","source_sha256":"ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085","start":1128},{"end":1799,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21057","source_sha256":"ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085","start":1737}],"target_id":"claim.frontier.arxiv-2609-21057","target_kind":"node","target_sha256":"76b88ca69cb60353712208a82ce03a82e0b5852dd6c7719bb1c49ff1ce79fb05"}],"claim.frontier.arxiv-2609-21093":[{"id":"assertion.claim.frontier.arxiv-2609-21093","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21093","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"","support":[{"end":2783,"quote":"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.","source_id":"source.frontier.arxiv-2609-21093","source_sha256":"88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757","start":2652},{"end":1033,"quote":"<created>2026-09-17</created>","source_id":"source.frontier.arxiv-2609-21093","source_sha256":"88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757","start":1004},{"end":1808,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21093","source_sha256":"88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757","start":1746}],"target_id":"claim.frontier.arxiv-2609-21093","target_kind":"node","target_sha256":"c465663045ae0609766765a49d317b4f82250daed86724d16e1649eebe41769d"}],"claim.frontier.arxiv-2609-21270":[{"id":"assertion.claim.frontier.arxiv-2609-21270","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21270","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"","support":[{"end":2428,"quote":"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.","source_id":"source.frontier.arxiv-2609-21270","source_sha256":"a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5","start":2195},{"end":1033,"quote":"<created>2026-09-18</created>","source_id":"source.frontier.arxiv-2609-21270","source_sha256":"a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5","start":1004},{"end":1791,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21270","source_sha256":"a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5","start":1729}],"target_id":"claim.frontier.arxiv-2609-21270","target_kind":"node","target_sha256":"bb3a30fcfa51c5f286b0277f756e51a7e111aab8ca4073cc47185278d8028337"}],"claim.frontier.arxiv-2609-21813":[{"id":"assertion.claim.frontier.arxiv-2609-21813","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21813","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"","support":[{"end":2393,"quote":"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.","source_id":"source.frontier.arxiv-2609-21813","source_sha256":"0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b","start":2229},{"end":1077,"quote":"<created>2026-09-30</created>","source_id":"source.frontier.arxiv-2609-21813","source_sha256":"0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b","start":1048},{"end":1686,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21813","source_sha256":"0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b","start":1624}],"target_id":"claim.frontier.arxiv-2609-21813","target_kind":"node","target_sha256":"701c399df4bf5ba66633b67a1c373086e8b2ccb139fac358011ef3d905dd3e37"}],"claim.frontier.arxiv-2609-21904":[{"id":"assertion.claim.frontier.arxiv-2609-21904","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21904","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21904 \"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model\" (CC BY 4.0, submitted 2026-09-18) reports: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","support":[{"end":2577,"quote":"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":2431},{"end":1039,"quote":"<created>2026-09-18</created>","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":1010},{"end":2006,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21904","source_sha256":"e347207ebb28cf45453dde50a96a9070f3eace44897b2636f03d7e3244b39bc2","start":1944}],"target_id":"claim.frontier.arxiv-2609-21904","target_kind":"node","target_sha256":"d9aab030a07e0df2f3ed41f7494771bb4ba6436ca61f59b3d5d0b7b28f36adc7"}],"claim.frontier.arxiv-2609-21966":[{"id":"assertion.claim.frontier.arxiv-2609-21966","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.21966","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"","support":[{"end":2979,"quote":"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.","source_id":"source.frontier.arxiv-2609-21966","source_sha256":"075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff","start":2811},{"end":1073,"quote":"<created>2026-09-18</created>","source_id":"source.frontier.arxiv-2609-21966","source_sha256":"075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff","start":1044},{"end":2222,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-21966","source_sha256":"075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff","start":2160}],"target_id":"claim.frontier.arxiv-2609-21966","target_kind":"node","target_sha256":"f97feec8b76ab0a8ba0b3049af47cafa32d05e103c02e20b5b5868d3dcef11d0"}],"claim.frontier.arxiv-2609-22615":[{"id":"assertion.claim.frontier.arxiv-2609-22615","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.22615","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"","support":[{"end":2503,"quote":"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.","source_id":"source.frontier.arxiv-2609-22615","source_sha256":"f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c","start":2224},{"end":993,"quote":"<created>2026-09-18</created>","source_id":"source.frontier.arxiv-2609-22615","source_sha256":"f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c","start":964},{"end":1631,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-22615","source_sha256":"f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c","start":1569}],"target_id":"claim.frontier.arxiv-2609-22615","target_kind":"node","target_sha256":"96738d113de264b828a57dd20f4476b9cc89a4e1ac4f698ad231439ee857f97b"}],"claim.frontier.arxiv-2609-22775":[{"id":"assertion.claim.frontier.arxiv-2609-22775","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.22775","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"","support":[{"end":3291,"quote":"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).","source_id":"source.frontier.arxiv-2609-22775","source_sha256":"66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03","start":3092},{"end":1073,"quote":"<created>2026-09-19</created>","source_id":"source.frontier.arxiv-2609-22775","source_sha256":"66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03","start":1044},{"end":1728,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-22775","source_sha256":"66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03","start":1666}],"target_id":"claim.frontier.arxiv-2609-22775","target_kind":"node","target_sha256":"4af32e824e726799b88d3216d8168d9d745e823b6eb705b4ca7606c9c4ac565f"}],"claim.frontier.arxiv-2609-23085":[{"id":"assertion.claim.frontier.arxiv-2609-23085","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.23085","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"","support":[{"end":3861,"quote":"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.","source_id":"source.frontier.arxiv-2609-23085","source_sha256":"4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5","start":3663},{"end":1153,"quote":"<created>2026-09-19</created>","source_id":"source.frontier.arxiv-2609-23085","source_sha256":"4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5","start":1124},{"end":2459,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-23085","source_sha256":"4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5","start":2397}],"target_id":"claim.frontier.arxiv-2609-23085","target_kind":"node","target_sha256":"0c2b03d9b7f61908e4930255a68a278b4aa830f5d46eacdb1a95676e0f2acb18"}],"claim.frontier.arxiv-2609-23199":[{"id":"assertion.claim.frontier.arxiv-2609-23199","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.23199","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"","support":[{"end":2856,"quote":"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.","source_id":"source.frontier.arxiv-2609-23199","source_sha256":"51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1","start":2628},{"end":993,"quote":"<created>2026-09-19</created>","source_id":"source.frontier.arxiv-2609-23199","source_sha256":"51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1","start":964},{"end":1808,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-23199","source_sha256":"51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1","start":1746}],"target_id":"claim.frontier.arxiv-2609-23199","target_kind":"node","target_sha256":"e33b811b9a06eb8c266b3d181f31b1bbd885f0a6b8669ef714027ffd48a18bda"}],"claim.frontier.arxiv-2609-23703":[{"id":"assertion.claim.frontier.arxiv-2609-23703","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.23703","quantifiers":"Only what the quoted sentence states","time":"2026-09-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"","support":[{"end":3400,"quote":"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.","source_id":"source.frontier.arxiv-2609-23703","source_sha256":"d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f","start":3105},{"end":1075,"quote":"<created>2026-09-20</created>","source_id":"source.frontier.arxiv-2609-23703","source_sha256":"d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f","start":1046},{"end":1693,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-23703","source_sha256":"d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f","start":1631}],"target_id":"claim.frontier.arxiv-2609-23703","target_kind":"node","target_sha256":"f6b5b72f02708a4ab71cec431bb431e6a28df2a8992b4bdb1fe0b549f41af299"}],"claim.frontier.arxiv-2609-25437":[{"id":"assertion.claim.frontier.arxiv-2609-25437","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.25437","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"","support":[{"end":3921,"quote":"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.","source_id":"source.frontier.arxiv-2609-25437","source_sha256":"13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4","start":3733},{"end":1113,"quote":"<created>2026-09-21</created>","source_id":"source.frontier.arxiv-2609-25437","source_sha256":"13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4","start":1084},{"end":2014,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-25437","source_sha256":"13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4","start":1952}],"target_id":"claim.frontier.arxiv-2609-25437","target_kind":"node","target_sha256":"04be0752464c1a2727c2499358978e64e3bb76280ab524b9d80244fc454dc4c9"}],"claim.frontier.arxiv-2609-25701":[{"id":"assertion.claim.frontier.arxiv-2609-25701","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.25701","quantifiers":"Only what the quoted sentence states","time":"2026-09-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"","support":[{"end":2600,"quote":"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.","source_id":"source.frontier.arxiv-2609-25701","source_sha256":"05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59","start":2284},{"end":1113,"quote":"<created>2026-09-22</created>","source_id":"source.frontier.arxiv-2609-25701","source_sha256":"05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59","start":1084},{"end":1769,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-25701","source_sha256":"05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59","start":1707}],"target_id":"claim.frontier.arxiv-2609-25701","target_kind":"node","target_sha256":"265421a5a50e797df47c4041c93dc6fdd177388afa0791402b77b6bfa37bf770"}],"claim.frontier.arxiv-2609-25847":[{"id":"assertion.claim.frontier.arxiv-2609-25847","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.25847","quantifiers":"Only what the quoted sentence states","time":"2026-09-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"","support":[{"end":3070,"quote":"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.","source_id":"source.frontier.arxiv-2609-25847","source_sha256":"d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19","start":2853},{"end":993,"quote":"<created>2026-09-22</created>","source_id":"source.frontier.arxiv-2609-25847","source_sha256":"d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19","start":964},{"end":1828,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-25847","source_sha256":"d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19","start":1766}],"target_id":"claim.frontier.arxiv-2609-25847","target_kind":"node","target_sha256":"566241ea9065d5143c4a5829ca9dc1676bd4ada68203d32244bc0b8944f6905b"}],"claim.frontier.arxiv-2609-26924":[{"id":"assertion.claim.frontier.arxiv-2609-26924","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.26924","quantifiers":"Only what the quoted sentence states","time":"2026-09-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"","support":[{"end":15159,"quote":"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.","source_id":"source.frontier.arxiv-2609-26924","source_sha256":"2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d","start":14927},{"end":1033,"quote":"<created>2026-09-22</created>","source_id":"source.frontier.arxiv-2609-26924","source_sha256":"2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d","start":1004},{"end":14015,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-26924","source_sha256":"2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d","start":13953}],"target_id":"claim.frontier.arxiv-2609-26924","target_kind":"node","target_sha256":"2d9829e5b9835a2a33215722f146f2c3edd09aa838289952022c96436b4d46d8"}],"claim.frontier.arxiv-2609-28815":[{"id":"assertion.claim.frontier.arxiv-2609-28815","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.28815","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"","support":[{"end":3156,"quote":"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.","source_id":"source.frontier.arxiv-2609-28815","source_sha256":"f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa","start":2932},{"end":993,"quote":"<created>2026-09-23</created>","source_id":"source.frontier.arxiv-2609-28815","source_sha256":"f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa","start":964},{"end":1731,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-28815","source_sha256":"f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa","start":1669}],"target_id":"claim.frontier.arxiv-2609-28815","target_kind":"node","target_sha256":"dbae9cf820fccc9f22815306f186c61c6bf424abe78f92c8149f93288fa29ade"}],"claim.frontier.arxiv-2609-29832":[{"id":"assertion.claim.frontier.arxiv-2609-29832","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.29832","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"","support":[{"end":3075,"quote":"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.","source_id":"source.frontier.arxiv-2609-29832","source_sha256":"c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde","start":2930},{"end":1073,"quote":"<created>2026-09-24</created>","source_id":"source.frontier.arxiv-2609-29832","source_sha256":"c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde","start":1044},{"end":2006,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2609-29832","source_sha256":"c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde","start":1938}],"target_id":"claim.frontier.arxiv-2609-29832","target_kind":"node","target_sha256":"273391aa4a119164f559f1e6a1a3018edf1e24fe952fc25820514f35c726c8d5"}],"claim.frontier.arxiv-2609-29972":[{"id":"assertion.claim.frontier.arxiv-2609-29972","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.29972","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"","support":[{"end":2345,"quote":"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.","source_id":"source.frontier.arxiv-2609-29972","source_sha256":"60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c","start":2123},{"end":1095,"quote":"<created>2026-09-24</created>","source_id":"source.frontier.arxiv-2609-29972","source_sha256":"60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c","start":1066},{"end":1757,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-29972","source_sha256":"60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c","start":1695}],"target_id":"claim.frontier.arxiv-2609-29972","target_kind":"node","target_sha256":"497b2f901d364e26b1b7b7625363b0dc6d2c9c25cd3d406cf9787b1bb0296d0d"}],"claim.frontier.arxiv-2609-32315":[{"id":"assertion.claim.frontier.arxiv-2609-32315","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.32315","quantifiers":"Only what the quoted sentence states","time":"2026-09-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"","support":[{"end":3300,"quote":"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.","source_id":"source.frontier.arxiv-2609-32315","source_sha256":"2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a","start":3174},{"end":995,"quote":"<created>2026-09-26</created>","source_id":"source.frontier.arxiv-2609-32315","source_sha256":"2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a","start":966},{"end":2215,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-32315","source_sha256":"2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a","start":2153}],"target_id":"claim.frontier.arxiv-2609-32315","target_kind":"node","target_sha256":"3393b4bfa9a7dbb8b378cab5ff0700aac12523f0eda8237fe96df690f99204e0"}],"claim.frontier.arxiv-2609-35246":[{"id":"assertion.claim.frontier.arxiv-2609-35246","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.35246","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"","support":[{"end":4010,"quote":"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.","source_id":"source.frontier.arxiv-2609-35246","source_sha256":"94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d","start":3694},{"end":1033,"quote":"<created>2026-09-28</created>","source_id":"source.frontier.arxiv-2609-35246","source_sha256":"94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d","start":1004},{"end":2092,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-35246","source_sha256":"94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d","start":2030}],"target_id":"claim.frontier.arxiv-2609-35246","target_kind":"node","target_sha256":"4c04841c92f6f2515c5aa9702bcfa24b0ae6a83779590a3c32cfa9518565faf6"}],"claim.frontier.arxiv-2609-35424":[{"id":"assertion.claim.frontier.arxiv-2609-35424","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.35424","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"","support":[{"end":3063,"quote":"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.","source_id":"source.frontier.arxiv-2609-35424","source_sha256":"c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5","start":2767},{"end":1033,"quote":"<created>2026-09-28</created>","source_id":"source.frontier.arxiv-2609-35424","source_sha256":"c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5","start":1004},{"end":1967,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-35424","source_sha256":"c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5","start":1905}],"target_id":"claim.frontier.arxiv-2609-35424","target_kind":"node","target_sha256":"dae5b28a82fd4127b8cfa1a390f0d58fc4a3915961ee8a83656d2511f46f86a8"}],"claim.frontier.arxiv-2609-36354":[{"id":"assertion.claim.frontier.arxiv-2609-36354","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.36354","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"","support":[{"end":3686,"quote":"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.","source_id":"source.frontier.arxiv-2609-36354","source_sha256":"38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524","start":3238},{"end":1115,"quote":"<created>2026-09-28</created>","source_id":"source.frontier.arxiv-2609-36354","source_sha256":"38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524","start":1086},{"end":2180,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-36354","source_sha256":"38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524","start":2118}],"target_id":"claim.frontier.arxiv-2609-36354","target_kind":"node","target_sha256":"ba2ba64d0bba4952934bb82ab0a6eec38988f094b32a07557fd48b32ddcd515f"}],"claim.frontier.arxiv-2609-39519":[{"id":"assertion.claim.frontier.arxiv-2609-39519","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.39519","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.39519 \"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics\" (CC BY 4.0, submitted 2026-09-30) reports: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","support":[{"end":3271,"quote":"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":3050},{"end":1138,"quote":"<created>2026-09-30</created>","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":1109},{"end":1886,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-39519","source_sha256":"9cfd8a6ce32ae28f97703946862cd2f5b57202f49dea095c7b051142a55bac3d","start":1824}],"target_id":"claim.frontier.arxiv-2609-39519","target_kind":"node","target_sha256":"f55d8e4e72aac5489d6b5ef9d6c06d79d2abb13401c031c683fb4555dff98f5e"}],"claim.frontier.arxiv-2609-39776":[{"id":"assertion.claim.frontier.arxiv-2609-39776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2609.39776","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"","support":[{"end":3439,"quote":"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.","source_id":"source.frontier.arxiv-2609-39776","source_sha256":"aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67","start":3297},{"end":1117,"quote":"<created>2026-09-30</created>","source_id":"source.frontier.arxiv-2609-39776","source_sha256":"aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67","start":1088},{"end":2223,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2609-39776","source_sha256":"aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67","start":2161}],"target_id":"claim.frontier.arxiv-2609-39776","target_kind":"node","target_sha256":"6ecd150266bfd4751ab0c41ef9a2daa5502de52896dba3cd913c50f3047a175b"}],"claim.frontier.arxiv-2610-02106":[{"id":"assertion.claim.frontier.arxiv-2610-02106","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.02106","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.02106 \"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness\" (CC BY 4.0, submitted 2026-10-01) reports: \"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.\"","support":[{"end":3217,"quote":"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":2994},{"end":1083,"quote":"<created>2026-10-01</created>","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":1054},{"end":1845,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-02106","source_sha256":"63896dc06fffda0d8708901433525fee2b9efb7664096503af3165e72514e2b3","start":1783}],"target_id":"claim.frontier.arxiv-2610-02106","target_kind":"node","target_sha256":"e271fa12c40b66084c7d0f6cdf8958ffb3d0fb6b95c27047d7ad3b487a942bcb"}],"claim.frontier.arxiv-2610-03008":[{"id":"assertion.claim.frontier.arxiv-2610-03008","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.03008","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"","support":[{"end":2864,"quote":"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.","source_id":"source.frontier.arxiv-2610-03008","source_sha256":"46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc","start":2639},{"end":1075,"quote":"<created>2026-10-02</created>","source_id":"source.frontier.arxiv-2610-03008","source_sha256":"46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc","start":1046},{"end":2123,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-03008","source_sha256":"46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc","start":2061}],"target_id":"claim.frontier.arxiv-2610-03008","target_kind":"node","target_sha256":"82399c21be648fb96cb4a208fbf66536ea122a2350cb2dcdc8b0860c695b5db4"}],"claim.frontier.arxiv-2610-03964":[{"id":"assertion.claim.frontier.arxiv-2610-03964","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.03964","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"","support":[{"end":3263,"quote":"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.","source_id":"source.frontier.arxiv-2610-03964","source_sha256":"e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192","start":3120},{"end":1033,"quote":"<created>2026-10-02</created>","source_id":"source.frontier.arxiv-2610-03964","source_sha256":"e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192","start":1004},{"end":2030,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-03964","source_sha256":"e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192","start":1968}],"target_id":"claim.frontier.arxiv-2610-03964","target_kind":"node","target_sha256":"db85dd871996d11690e4d572551d14de38bf3210d3196fecc9ae0da5eb44ddd8"}],"claim.frontier.arxiv-2610-04242":[{"id":"assertion.claim.frontier.arxiv-2610-04242","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04242","quantifiers":"Only what the quoted sentence states","time":"2026-10-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"","support":[{"end":2942,"quote":"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.","source_id":"source.frontier.arxiv-2610-04242","source_sha256":"4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f","start":2726},{"end":1033,"quote":"<created>2026-10-03</created>","source_id":"source.frontier.arxiv-2610-04242","source_sha256":"4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f","start":1004},{"end":2132,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04242","source_sha256":"4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f","start":2070}],"target_id":"claim.frontier.arxiv-2610-04242","target_kind":"node","target_sha256":"a9a0ffb810b154d47ba126e2ae200c97999c6308914a1190664cddc15f0e5acb"}],"claim.frontier.arxiv-2610-04630":[{"id":"assertion.claim.frontier.arxiv-2610-04630","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04630","quantifiers":"Only what the quoted sentence states","time":"2026-10-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"","support":[{"end":3940,"quote":"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.","source_id":"source.frontier.arxiv-2610-04630","source_sha256":"bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f","start":3708},{"end":993,"quote":"<created>2026-10-03</created>","source_id":"source.frontier.arxiv-2610-04630","source_sha256":"bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f","start":964},{"end":2027,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04630","source_sha256":"bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f","start":1965}],"target_id":"claim.frontier.arxiv-2610-04630","target_kind":"node","target_sha256":"55024c472b37b3c38ae899c1bfe3976e3d6a17e3bce51137a4015acebeba897a"}],"claim.frontier.arxiv-2610-04662":[{"id":"assertion.claim.frontier.arxiv-2610-04662","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04662","quantifiers":"Only what the quoted sentence states","time":"2026-10-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"","support":[{"end":3488,"quote":"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.","source_id":"source.frontier.arxiv-2610-04662","source_sha256":"85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3","start":3237},{"end":1073,"quote":"<created>2026-10-03</created>","source_id":"source.frontier.arxiv-2610-04662","source_sha256":"85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3","start":1044},{"end":2047,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04662","source_sha256":"85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3","start":1985}],"target_id":"claim.frontier.arxiv-2610-04662","target_kind":"node","target_sha256":"1197384dd2bdaeaa27e6a1e2d3d7a19447d2b4c296430bce44eb7b8692631fb3"}],"claim.frontier.arxiv-2610-04697":[{"id":"assertion.claim.frontier.arxiv-2610-04697","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04697","quantifiers":"Only what the quoted sentence states","time":"2026-10-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"","support":[{"end":2526,"quote":"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.","source_id":"source.frontier.arxiv-2610-04697","source_sha256":"c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af","start":2238},{"end":995,"quote":"<created>2026-10-03</created>","source_id":"source.frontier.arxiv-2610-04697","source_sha256":"c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af","start":966},{"end":1609,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04697","source_sha256":"c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af","start":1547}],"target_id":"claim.frontier.arxiv-2610-04697","target_kind":"node","target_sha256":"ba68b962702ca2a36672b8439d35ccfa89a80b48aeef8b95aed892c80911b788"}],"claim.frontier.arxiv-2610-04776":[{"id":"assertion.claim.frontier.arxiv-2610-04776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04776","quantifiers":"Only what the quoted sentence states","time":"2026-10-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"","support":[{"end":3505,"quote":"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.","source_id":"source.frontier.arxiv-2610-04776","source_sha256":"65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3","start":3268},{"end":1201,"quote":"<created>2026-10-03</created>","source_id":"source.frontier.arxiv-2610-04776","source_sha256":"65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3","start":1172},{"end":2239,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04776","source_sha256":"65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3","start":2177}],"target_id":"claim.frontier.arxiv-2610-04776","target_kind":"node","target_sha256":"51232f01e536c301d3c9507922fd51d0207c8f39dc571ceff9df1974cca740c2"}],"claim.frontier.arxiv-2610-04959":[{"id":"assertion.claim.frontier.arxiv-2610-04959","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.04959","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"","support":[{"end":4313,"quote":"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.","source_id":"source.frontier.arxiv-2610-04959","source_sha256":"1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee","start":4051},{"end":1035,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-04959","source_sha256":"1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee","start":1006},{"end":2544,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-04959","source_sha256":"1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee","start":2482}],"target_id":"claim.frontier.arxiv-2610-04959","target_kind":"node","target_sha256":"60803abde49981b3e9b515f13c3ec84a0dd2b7a33767e4841de7fa7eb61e4153"}],"claim.frontier.arxiv-2610-06601":[{"id":"assertion.claim.frontier.arxiv-2610-06601","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.06601","quantifiers":"Only what the quoted sentence states","time":"2026-10-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"","support":[{"end":3598,"quote":"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.","source_id":"source.frontier.arxiv-2610-06601","source_sha256":"db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353","start":3235},{"end":1033,"quote":"<created>2026-10-05</created>","source_id":"source.frontier.arxiv-2610-06601","source_sha256":"db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353","start":1004},{"end":1939,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-06601","source_sha256":"db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353","start":1877}],"target_id":"claim.frontier.arxiv-2610-06601","target_kind":"node","target_sha256":"e08ebb0c4834db59eeadb6300fd9ea46ee16d77838acbe39e48dff4b98eeb018"}],"claim.frontier.arxiv-2610-06918":[{"id":"assertion.claim.frontier.arxiv-2610-06918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.06918","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"","support":[{"end":2562,"quote":"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.","source_id":"source.frontier.arxiv-2610-06918","source_sha256":"843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123","start":2363},{"end":1073,"quote":"<created>2026-10-02</created>","source_id":"source.frontier.arxiv-2610-06918","source_sha256":"843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123","start":1044},{"end":1690,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-06918","source_sha256":"843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123","start":1628}],"target_id":"claim.frontier.arxiv-2610-06918","target_kind":"node","target_sha256":"8264a8cd0ed245884f4313ac000543134882ef2c91953504f5ca8c09b00c19c5"}],"claim.frontier.arxiv-2610-07307":[{"id":"assertion.claim.frontier.arxiv-2610-07307","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.07307","quantifiers":"Only what the quoted sentence states","time":"2026-10-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"","support":[{"end":3029,"quote":"We also derive a step-size condition for implementing the method in discrete time.","source_id":"source.frontier.arxiv-2610-07307","source_sha256":"80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029","start":2947},{"end":1073,"quote":"<created>2026-10-05</created>","source_id":"source.frontier.arxiv-2610-07307","source_sha256":"80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029","start":1044},{"end":2041,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-07307","source_sha256":"80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029","start":1979}],"target_id":"claim.frontier.arxiv-2610-07307","target_kind":"node","target_sha256":"e717ce32d00a85ef8fa8159b789a4cdbe0f6b9a395412689002cb57f96b7c736"}],"claim.frontier.arxiv-2610-07616":[{"id":"assertion.claim.frontier.arxiv-2610-07616","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.07616","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"","support":[{"end":2165,"quote":"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.","source_id":"source.frontier.arxiv-2610-07616","source_sha256":"78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58","start":2055},{"end":1073,"quote":"<created>2026-10-06</created>","source_id":"source.frontier.arxiv-2610-07616","source_sha256":"78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58","start":1044},{"end":1617,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-07616","source_sha256":"78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58","start":1555}],"target_id":"claim.frontier.arxiv-2610-07616","target_kind":"node","target_sha256":"d6f577c6e767b6a3d5dff779e57b0cec93ec5198c9c36efaaf2dbeb35c1ae950"}],"claim.frontier.arxiv-2610-08744":[{"id":"assertion.claim.frontier.arxiv-2610-08744","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.08744","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"","support":[{"end":3062,"quote":"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.","source_id":"source.frontier.arxiv-2610-08744","source_sha256":"0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14","start":2897},{"end":993,"quote":"<created>2026-10-06</created>","source_id":"source.frontier.arxiv-2610-08744","source_sha256":"0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14","start":964},{"end":1748,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-08744","source_sha256":"0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14","start":1686}],"target_id":"claim.frontier.arxiv-2610-08744","target_kind":"node","target_sha256":"d94b8ceb803f23d37998dc793883f64d4110c56a071339d7f27d629ce51cd53a"}],"claim.frontier.arxiv-2610-09010":[{"id":"assertion.claim.frontier.arxiv-2610-09010","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.09010","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"","support":[{"end":3580,"quote":"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.","source_id":"source.frontier.arxiv-2610-09010","source_sha256":"0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed","start":3388},{"end":993,"quote":"<created>2026-10-06</created>","source_id":"source.frontier.arxiv-2610-09010","source_sha256":"0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed","start":964},{"end":1744,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-09010","source_sha256":"0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed","start":1682}],"target_id":"claim.frontier.arxiv-2610-09010","target_kind":"node","target_sha256":"c01171a7378737c5492419b63a6668029115d5d11b8913c81e55b38fab25e949"}],"claim.frontier.arxiv-2610-09080":[{"id":"assertion.claim.frontier.arxiv-2610-09080","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.09080","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"","support":[{"end":2912,"quote":"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.","source_id":"source.frontier.arxiv-2610-09080","source_sha256":"1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316","start":2657},{"end":993,"quote":"<created>2026-10-06</created>","source_id":"source.frontier.arxiv-2610-09080","source_sha256":"1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316","start":964},{"end":1746,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-09080","source_sha256":"1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316","start":1684}],"target_id":"claim.frontier.arxiv-2610-09080","target_kind":"node","target_sha256":"0c3a9ae37aecef4ef7a9939bb97f945686dce9d6fe36f0350d4fb9fcc35badb5"}],"claim.frontier.arxiv-2610-09266":[{"id":"assertion.claim.frontier.arxiv-2610-09266","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.09266","quantifiers":"Only what the quoted sentence states","time":"2026-10-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"","support":[{"end":3543,"quote":"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.","source_id":"source.frontier.arxiv-2610-09266","source_sha256":"cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed","start":3311},{"end":1033,"quote":"<created>2026-10-07</created>","source_id":"source.frontier.arxiv-2610-09266","source_sha256":"cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed","start":1004},{"end":1974,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-09266","source_sha256":"cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed","start":1912}],"target_id":"claim.frontier.arxiv-2610-09266","target_kind":"node","target_sha256":"fdd9b401372df0dbb49a1d2bf4e09b6e34a692866c08d6774d7fb696ee261765"}],"claim.frontier.arxiv-2610-11359":[{"id":"assertion.claim.frontier.arxiv-2610-11359","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.11359","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"","support":[{"end":3264,"quote":"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.","source_id":"source.frontier.arxiv-2610-11359","source_sha256":"f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42","start":3094},{"end":993,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-11359","source_sha256":"f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42","start":964},{"end":2019,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-11359","source_sha256":"f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42","start":1957}],"target_id":"claim.frontier.arxiv-2610-11359","target_kind":"node","target_sha256":"ef2bb7a5097b6ae986fc47841ce396d2c9fbe30195e3e73a5fec64050fafdee9"}],"claim.frontier.arxiv-2610-11869":[{"id":"assertion.claim.frontier.arxiv-2610-11869","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.11869","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"","support":[{"end":3083,"quote":"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.","source_id":"source.frontier.arxiv-2610-11869","source_sha256":"6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f","start":2919},{"end":1249,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-11869","source_sha256":"6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f","start":1220},{"end":2113,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-11869","source_sha256":"6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f","start":2051}],"target_id":"claim.frontier.arxiv-2610-11869","target_kind":"node","target_sha256":"104824c9bc6d60ddd5a41780eb1897630158af4f1439f0be39b07494895010f7"}],"claim.frontier.arxiv-2610-12038":[{"id":"assertion.claim.frontier.arxiv-2610-12038","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.12038","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"","support":[{"end":2617,"quote":"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.","source_id":"source.frontier.arxiv-2610-12038","source_sha256":"a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2","start":2437},{"end":993,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-12038","source_sha256":"a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2","start":964},{"end":1836,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-12038","source_sha256":"a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2","start":1774}],"target_id":"claim.frontier.arxiv-2610-12038","target_kind":"node","target_sha256":"ec13f9f86b5c1bc03a718e7b995a3a59562425a615d9fa13d6020ef08ccfcab7"}],"claim.frontier.arxiv-2610-12592":[{"id":"assertion.claim.frontier.arxiv-2610-12592","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.12592","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"","support":[{"end":3239,"quote":"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.","source_id":"source.frontier.arxiv-2610-12592","source_sha256":"bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d","start":3102},{"end":993,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-12592","source_sha256":"bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d","start":964},{"end":2089,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2610-12592","source_sha256":"bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d","start":2021}],"target_id":"claim.frontier.arxiv-2610-12592","target_kind":"node","target_sha256":"8380fa2096717d776a89ef4c3ad492c5fed1d514dae0765acccecf4507522cd3"}],"claim.frontier.arxiv-2610-12604":[{"id":"assertion.claim.frontier.arxiv-2610-12604","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.12604","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"","support":[{"end":2368,"quote":"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.","source_id":"source.frontier.arxiv-2610-12604","source_sha256":"eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0","start":2287},{"end":993,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-12604","source_sha256":"eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0","start":964},{"end":1777,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2610-12604","source_sha256":"eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0","start":1709}],"target_id":"claim.frontier.arxiv-2610-12604","target_kind":"node","target_sha256":"6dcaef89852aeb2edfb2adc04ae2c4909e6411ad977b12fa8f8ec8c436befca5"}],"claim.frontier.arxiv-2610-12779":[{"id":"assertion.claim.frontier.arxiv-2610-12779","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.12779","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"","support":[{"end":2854,"quote":"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.","source_id":"source.frontier.arxiv-2610-12779","source_sha256":"364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa","start":2510},{"end":1073,"quote":"<created>2026-10-08</created>","source_id":"source.frontier.arxiv-2610-12779","source_sha256":"364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa","start":1044},{"end":1607,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-12779","source_sha256":"364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa","start":1545}],"target_id":"claim.frontier.arxiv-2610-12779","target_kind":"node","target_sha256":"0a200f89117c4ea885fb92d9afa96d2e7d7d182295a3692c61b89e36f100518d"}],"claim.frontier.arxiv-2610-13402":[{"id":"assertion.claim.frontier.arxiv-2610-13402","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.13402","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"","support":[{"end":2808,"quote":"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.","source_id":"source.frontier.arxiv-2610-13402","source_sha256":"3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496","start":2666},{"end":1077,"quote":"<created>2026-10-09</created>","source_id":"source.frontier.arxiv-2610-13402","source_sha256":"3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496","start":1048},{"end":1985,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-13402","source_sha256":"3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496","start":1923}],"target_id":"claim.frontier.arxiv-2610-13402","target_kind":"node","target_sha256":"e285ae55ff03e8b9e1b4ca3e9b041f363f37f4f7dcf5a5393adb43323c720b49"}],"claim.frontier.arxiv-2610-13424":[{"id":"assertion.claim.frontier.arxiv-2610-13424","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.13424","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"","support":[{"end":2322,"quote":"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.","source_id":"source.frontier.arxiv-2610-13424","source_sha256":"22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989","start":2131},{"end":1077,"quote":"<created>2026-10-09</created>","source_id":"source.frontier.arxiv-2610-13424","source_sha256":"22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989","start":1048},{"end":1672,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-13424","source_sha256":"22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989","start":1610}],"target_id":"claim.frontier.arxiv-2610-13424","target_kind":"node","target_sha256":"7fd68d524cf3d375403bd0389a9102fcd5b849bc87b65345f29ff6b9520bbcf8"}],"claim.frontier.arxiv-2610-15052":[{"id":"assertion.claim.frontier.arxiv-2610-15052","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.15052","quantifiers":"Only what the quoted sentence states","time":"2026-10-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"","support":[{"end":2572,"quote":"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.","source_id":"source.frontier.arxiv-2610-15052","source_sha256":"3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc","start":2427},{"end":1033,"quote":"<created>2026-10-10</created>","source_id":"source.frontier.arxiv-2610-15052","source_sha256":"3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc","start":1004},{"end":1570,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-15052","source_sha256":"3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc","start":1508}],"target_id":"claim.frontier.arxiv-2610-15052","target_kind":"node","target_sha256":"0e3a409e37368e61d1934fb7914817e87920ade4bb52f91410543bd22aa7049e"}],"claim.frontier.arxiv-2610-15072":[{"id":"assertion.claim.frontier.arxiv-2610-15072","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.15072","quantifiers":"Only what the quoted sentence states","time":"2026-10-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"","support":[{"end":3498,"quote":"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.","source_id":"source.frontier.arxiv-2610-15072","source_sha256":"3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008","start":3330},{"end":1157,"quote":"<created>2026-10-10</created>","source_id":"source.frontier.arxiv-2610-15072","source_sha256":"3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008","start":1128},{"end":2422,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-15072","source_sha256":"3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008","start":2360}],"target_id":"claim.frontier.arxiv-2610-15072","target_kind":"node","target_sha256":"2202e4fba0fef0adbfffb5263a7bc935d004b4ed16d72bdb11fb868e0884f957"}],"claim.frontier.arxiv-2610-15934":[{"id":"assertion.claim.frontier.arxiv-2610-15934","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.15934","quantifiers":"Only what the quoted sentence states","time":"2026-10-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"","support":[{"end":2854,"quote":"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.","source_id":"source.frontier.arxiv-2610-15934","source_sha256":"6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098","start":2614},{"end":1073,"quote":"<created>2026-10-11</created>","source_id":"source.frontier.arxiv-2610-15934","source_sha256":"6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098","start":1044},{"end":1744,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-15934","source_sha256":"6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098","start":1682}],"target_id":"claim.frontier.arxiv-2610-15934","target_kind":"node","target_sha256":"db269a5e349cef256a5d35a3cc98311c81e5233fbb732f72a56f62b5d01bfd00"}],"claim.frontier.arxiv-2610-16259":[{"id":"assertion.claim.frontier.arxiv-2610-16259","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.16259","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"","support":[{"end":2688,"quote":"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.","source_id":"source.frontier.arxiv-2610-16259","source_sha256":"f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e","start":2552},{"end":993,"quote":"<created>2026-10-12</created>","source_id":"source.frontier.arxiv-2610-16259","source_sha256":"f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e","start":964},{"end":1938,"quote":"<license>http://creativecommons.org/publicdomain/zero/1.0/</license>","source_id":"source.frontier.arxiv-2610-16259","source_sha256":"f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e","start":1870}],"target_id":"claim.frontier.arxiv-2610-16259","target_kind":"node","target_sha256":"49058552123e75c929a955f283eca0a07258c3e78ac13caca148d8134b204663"}],"claim.frontier.arxiv-2610-16273":[{"id":"assertion.claim.frontier.arxiv-2610-16273","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.16273","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"","support":[{"end":2750,"quote":"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.","source_id":"source.frontier.arxiv-2610-16273","source_sha256":"5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09","start":2282},{"end":1073,"quote":"<created>2026-10-12</created>","source_id":"source.frontier.arxiv-2610-16273","source_sha256":"5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09","start":1044},{"end":1903,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-16273","source_sha256":"5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09","start":1841}],"target_id":"claim.frontier.arxiv-2610-16273","target_kind":"node","target_sha256":"abec13a7138c2ba0031c3c27d7bf86d76d14145eaf07fe0459c331a693ca2367"}],"claim.frontier.arxiv-2610-17295":[{"id":"assertion.claim.frontier.arxiv-2610-17295","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.17295","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"","support":[{"end":3370,"quote":"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.","source_id":"source.frontier.arxiv-2610-17295","source_sha256":"79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94","start":3067},{"end":1033,"quote":"<created>2026-10-12</created>","source_id":"source.frontier.arxiv-2610-17295","source_sha256":"79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94","start":1004},{"end":2341,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-17295","source_sha256":"79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94","start":2279}],"target_id":"claim.frontier.arxiv-2610-17295","target_kind":"node","target_sha256":"258d145622ca057cff6f93b00ad958c34febb57b99ce8bf0ce7bdff897f7d141"}],"claim.frontier.arxiv-2610-19137":[{"id":"assertion.claim.frontier.arxiv-2610-19137","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.19137","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"","support":[{"end":2673,"quote":"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.","source_id":"source.frontier.arxiv-2610-19137","source_sha256":"fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68","start":2510},{"end":993,"quote":"<created>2026-10-13</created>","source_id":"source.frontier.arxiv-2610-19137","source_sha256":"fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68","start":964},{"end":2086,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-19137","source_sha256":"fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68","start":2024}],"target_id":"claim.frontier.arxiv-2610-19137","target_kind":"node","target_sha256":"09401a3ea268f6e991bb1235be758edaaf9a7fedc97c1f65562d42e1ff71dba4"}],"claim.frontier.arxiv-2610-19515":[{"id":"assertion.claim.frontier.arxiv-2610-19515","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.19515","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"","support":[{"end":3283,"quote":"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.","source_id":"source.frontier.arxiv-2610-19515","source_sha256":"8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d","start":3158},{"end":1033,"quote":"<created>2026-10-14</created>","source_id":"source.frontier.arxiv-2610-19515","source_sha256":"8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d","start":1004},{"end":2132,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-19515","source_sha256":"8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d","start":2070}],"target_id":"claim.frontier.arxiv-2610-19515","target_kind":"node","target_sha256":"bc36f7c70ac332a0c225156aca2db0261613a4c3ebe26917c84bbe0d333ade50"}],"claim.frontier.arxiv-2610-19722":[{"id":"assertion.claim.frontier.arxiv-2610-19722","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.19722","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"","support":[{"end":3276,"quote":"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.","source_id":"source.frontier.arxiv-2610-19722","source_sha256":"0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b","start":3012},{"end":1073,"quote":"<created>2026-10-14</created>","source_id":"source.frontier.arxiv-2610-19722","source_sha256":"0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b","start":1044},{"end":1825,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-19722","source_sha256":"0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b","start":1763}],"target_id":"claim.frontier.arxiv-2610-19722","target_kind":"node","target_sha256":"a8dd47064ed088694cb7ee9d06a2648af1e7b0d1fbe824decab526d1ca8f81a9"}],"claim.frontier.arxiv-2610-21653":[{"id":"assertion.claim.frontier.arxiv-2610-21653","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in arXiv:2610.21653","quantifiers":"Only what the quoted sentence states","time":"2026-10-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"","support":[{"end":2833,"quote":"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.","source_id":"source.frontier.arxiv-2610-21653","source_sha256":"8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026","start":2482},{"end":1077,"quote":"<created>2026-10-15</created>","source_id":"source.frontier.arxiv-2610-21653","source_sha256":"8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026","start":1048},{"end":2141,"quote":"<license>http://creativecommons.org/licenses/by/4.0/</license>","source_id":"source.frontier.arxiv-2610-21653","source_sha256":"8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026","start":2079}],"target_id":"claim.frontier.arxiv-2610-21653","target_kind":"node","target_sha256":"d10e242f57d4e8911cbb6626598c479b5d9fb04da16b40c1d106c5afd59a72d9"}],"claim.frontier.doi-10-1002-adfm-76901":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-76901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.76901","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.76901 \"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions\" (CC BY 4.0, published 2026-07-17) reports: \"Here, we report a fully biocompatible natural polymer‐based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.\"","support":[{"end":2397,"quote":"Here, we report a fully biocompatible natural polymer\\u2010based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":2211},{"end":14732,"quote":"\"published\":{\"date-parts\":[[2026,7,17]]}","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":14692},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-76901","source_sha256":"01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e","start":386}],"target_id":"claim.frontier.doi-10-1002-adfm-76901","target_kind":"node","target_sha256":"cc0312da0fb70263d40c3873bef61fdc3b3f9bcd82ae3f3f468fbef900e0efa4"}],"claim.frontier.doi-10-1002-adfm-77585":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-77585","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.77585","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.77585 \"An Electrowetting Pump\" (CC BY 4.0, published 2026-08-07) reports: \"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.\"","support":[{"end":2436,"quote":"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":2311},{"end":9322,"quote":"\"published\":{\"date-parts\":[[2026,8,7]]}","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":9283},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-77585","source_sha256":"e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4","start":407}],"target_id":"claim.frontier.doi-10-1002-adfm-77585","target_kind":"node","target_sha256":"9ad0029131f34b9ceaa77f3a8f33ab62e9a216dad09469f2708c7bbe5db7f51b"}],"claim.frontier.doi-10-1002-adfm-77938":[{"id":"assertion.claim.frontier.doi-10-1002-adfm-77938","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adfm.77938","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adfm.77938 \"Load Distributing Metamaterials Via Discrete Optimization\" (CC BY 4.0, published 2026-09-04) reports: \"We demonstrate both single‐objective optimization for a prescribed indenter position and a multi‐objective formulation that enforces robust performance across multiple loading locations.\"","support":[{"end":3243,"quote":"We demonstrate both single\\u2010objective optimization for a prescribed indenter position and a multi\\u2010objective formulation that enforces robust performance across multiple loading locations.","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":3047},{"end":10111,"quote":"\"published\":{\"date-parts\":[[2026,9,4]]}","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":10072},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adfm-77938","source_sha256":"4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9","start":398}],"target_id":"claim.frontier.doi-10-1002-adfm-77938","target_kind":"node","target_sha256":"ecbe1c0119aa9beb49bb472fc414e94a9232147524a41f685b61df459d57f266"}],"claim.frontier.doi-10-1002-adom-71396":[{"id":"assertion.claim.frontier.doi-10-1002-adom-71396","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/adom.71396","quantifiers":"Only what the quoted sentence states","time":"2026-06-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","support":[{"end":2133,"quote":"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics.","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":1885},{"end":8142,"quote":"\"published\":{\"date-parts\":[[2026,6,24]]}","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":8102},{"end":456,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-adom-71396","source_sha256":"1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc","start":399}],"target_id":"claim.frontier.doi-10-1002-adom-71396","target_kind":"node","target_sha256":"7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea"}],"claim.frontier.doi-10-1002-bse-71470":[{"id":"assertion.claim.frontier.doi-10-1002-bse-71470","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/bse.71470","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/bse.71470 \"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector\" (CC BY 4.0, published 2026-09-09) reports: \"Based on 41 semi‐structured interviews with representatives of 22 logistics companies in the Osnabrück region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource‐rich firms are more adept due to human resource slack, allowing them to process and document climate‐related sensory experiences and undertake anticipatory exercises.\"","support":[{"end":2112,"quote":"Based on 41 semi\\u2010structured interviews with representatives of 22 logistics companies in the Osnabr\\u00fcck region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource\\u2010rich firms are more adept due to human resource slack, allowing them to process and document climate\\u2010related sensory experiences and undertake anticipatory exercises.","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":1714},{"end":18933,"quote":"\"published\":{\"date-parts\":[[2026,9,9]]}","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":18894},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-bse-71470","source_sha256":"01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482","start":395}],"target_id":"claim.frontier.doi-10-1002-bse-71470","target_kind":"node","target_sha256":"99f8f40d2f518f635ee207ed4e3fba7f4588b9070378efd9f377833a5cf7daba"}],"claim.frontier.doi-10-1002-cli2-70059":[{"id":"assertion.claim.frontier.doi-10-1002-cli2-70059","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/cli2.70059","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/cli2.70059 \"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems\" (CC BY 4.0, published 2026-08-20) reports: \"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).\"","support":[{"end":2720,"quote":"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":2444},{"end":26978,"quote":"\"published\":{\"date-parts\":[[2026,8,20]]}","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":26938},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-cli2-70059","source_sha256":"5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9","start":408}],"target_id":"claim.frontier.doi-10-1002-cli2-70059","target_kind":"node","target_sha256":"e1b471abf38ce27c8149ecb1e4569ed4ca277c53e045fa673b318e0f628a27f9"}],"claim.frontier.doi-10-1002-cli2-70062":[{"id":"assertion.claim.frontier.doi-10-1002-cli2-70062","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/cli2.70062","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/cli2.70062 \"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin\" (CC BY 4.0, published 2026-09-02) reports: \"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.\"","support":[{"end":3378,"quote":"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":3249},{"end":24344,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":24305},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-cli2-70062","source_sha256":"dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf","start":407}],"target_id":"claim.frontier.doi-10-1002-cli2-70062","target_kind":"node","target_sha256":"97b20c7b152e3c3498f9307f9cd70cc4fc781535496db6ca824273d0640507d8"}],"claim.frontier.doi-10-1002-eco-70277":[{"id":"assertion.claim.frontier.doi-10-1002-eco-70277","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eco.70277","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eco.70277 \"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland\" (CC BY 4.0, published 2026-09-28) reports: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","support":[{"end":2697,"quote":"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post\\u2010treatment, relative to an untreated watershed, and (3) ET decreased by 90\\u2009mm in the post treatment year for the treated watershed.","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":2283},{"end":25166,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":25126},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eco-70277","source_sha256":"6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607","start":397}],"target_id":"claim.frontier.doi-10-1002-eco-70277","target_kind":"node","target_sha256":"932d496ffc8bba319734c20d8eb9e41e733da81a9ae1d43dec6405e09d5dbdc7"}],"claim.frontier.doi-10-1002-eco-70279":[{"id":"assertion.claim.frontier.doi-10-1002-eco-70279","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eco.70279","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eco.70279 \"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests\" (CC BY 4.0, published 2026-09-30) reports: \"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.\"","support":[{"end":2072,"quote":"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":1954},{"end":25944,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":25904},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eco-70279","source_sha256":"4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c","start":397}],"target_id":"claim.frontier.doi-10-1002-eco-70279","target_kind":"node","target_sha256":"23af879371e74778a932bdcf86a5fcdae9a05278f15e12a59bdad6a33129bc75"}],"claim.frontier.doi-10-1002-eet-70139":[{"id":"assertion.claim.frontier.doi-10-1002-eet-70139","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eet.70139","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eet.70139 \"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours\" (CC BY 4.0, published 2026-09-14) reports: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","support":[{"end":2639,"quote":"We show that assembly members were more concerned about climate change and were more likely to engage in climate\\u2010conscious consumption habits following CAUK than before the assembly.","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":2452},{"end":16767,"quote":"\"published\":{\"date-parts\":[[2026,9,14]]}","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":16727},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eet-70139","source_sha256":"3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7","start":396}],"target_id":"claim.frontier.doi-10-1002-eet-70139","target_kind":"node","target_sha256":"e42f5af90a591ea76fd929813fb2a101f6b708a61553844e4d425148719ef4e8"}],"claim.frontier.doi-10-1002-eet-70146":[{"id":"assertion.claim.frontier.doi-10-1002-eet-70146","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/eet.70146","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/eet.70146 \"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy\" (CC BY 4.0, published 2026-09-30) reports: \"This study examines how three survey‐derived governance role orientations—governmental, civic, and industry‐and‐media orientations—and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate‐related civic participation behavior.\"","support":[{"end":1575,"quote":"This study examines how three survey\\u2010derived governance role orientations\\u2014governmental, civic, and industry\\u2010and\\u2010media orientations\\u2014and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate\\u2010related civic participation behavior.","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":1231},{"end":7717,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":7677},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-eet-70146","source_sha256":"0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e","start":385}],"target_id":"claim.frontier.doi-10-1002-eet-70146","target_kind":"node","target_sha256":"89ca0ddd58ec8af408cc3a57606875c8d864099fc124cd4e52120fa7daba6e69"}],"claim.frontier.doi-10-1002-ese3-70586":[{"id":"assertion.claim.frontier.doi-10-1002-ese3-70586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ese3.70586","quantifiers":"Only what the quoted sentence states","time":"2026-06-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"","support":[{"end":1699,"quote":"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":1553},{"end":9350,"quote":"\"published\":{\"date-parts\":[[2026,6,23]]}","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":9310},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ese3-70586","source_sha256":"e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18","start":408}],"target_id":"claim.frontier.doi-10-1002-ese3-70586","target_kind":"node","target_sha256":"3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144"}],"claim.frontier.doi-10-1002-ese3-70603":[{"id":"assertion.claim.frontier.doi-10-1002-ese3-70603","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ese3.70603","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"","support":[{"end":2198,"quote":"The results indicate that under the conditions set in this study, the fault stick\\u2010slip reaches a critical state when the fault pillar support pressure peaks.","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":2036},{"end":13269,"quote":"\"published\":{\"date-parts\":[[2026,7,14]]}","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":13229},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ese3-70603","source_sha256":"008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49","start":408}],"target_id":"claim.frontier.doi-10-1002-ese3-70603","target_kind":"node","target_sha256":"e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a"}],"claim.frontier.doi-10-1002-esp-70399":[{"id":"assertion.claim.frontier.doi-10-1002-esp-70399","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp.70399","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp.70399 \"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska\" (CC BY 4.0, published 2026-08-27) reports: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","support":[{"end":2204,"quote":"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co\\u2010seismic damage.","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":1932},{"end":17653,"quote":"\"published\":{\"date-parts\":[[2026,8,27]]}","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":17613},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp-70399","source_sha256":"0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19","start":398}],"target_id":"claim.frontier.doi-10-1002-esp-70399","target_kind":"node","target_sha256":"d276aea75a93573515ec73a9f1bb8b483caa5dd00dae4490ab112c7a2edaee3f"}],"claim.frontier.doi-10-1002-esp4-70082":[{"id":"assertion.claim.frontier.doi-10-1002-esp4-70082","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp4.70082","quantifiers":"Only what the quoted sentence states","time":"2026-05-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"","support":[{"end":2543,"quote":"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface\\u2010to\\u2010borehole transfer functions consistent with 1D assumptions.","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":2168},{"end":10883,"quote":"\"published\":{\"date-parts\":[[2026,5,29]]}","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":10843},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp4-70082","source_sha256":"b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4","start":408}],"target_id":"claim.frontier.doi-10-1002-esp4-70082","target_kind":"node","target_sha256":"15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912"}],"claim.frontier.doi-10-1002-esp4-70096":[{"id":"assertion.claim.frontier.doi-10-1002-esp4-70096","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/esp4.70096","quantifiers":"Only what the quoted sentence states","time":"2026-06-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"","support":[{"end":2303,"quote":"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":2142},{"end":11088,"quote":"\"published\":{\"date-parts\":[[2026,6,25]]}","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":11048},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-esp4-70096","source_sha256":"b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731","start":408}],"target_id":"claim.frontier.doi-10-1002-esp4-70096","target_kind":"node","target_sha256":"5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2"}],"claim.frontier.doi-10-1002-fea2-70077":[{"id":"assertion.claim.frontier.doi-10-1002-fea2-70077","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/fea2.70077","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/fea2.70077 \"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women\" (CC BY 4.0, published 2026-09-30) reports: \"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.\"","support":[{"end":1614,"quote":"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":1409},{"end":12158,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":12118},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-fea2-70077","source_sha256":"3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b","start":385}],"target_id":"claim.frontier.doi-10-1002-fea2-70077","target_kind":"node","target_sha256":"00a3f58f94358f52d1e397868c353d4f68fc570c98987e0769690dc1bc93bf0d"}],"claim.frontier.doi-10-1002-gdj3-70104":[{"id":"assertion.claim.frontier.doi-10-1002-gdj3-70104","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/gdj3.70104","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/gdj3.70104 \"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China\" (CC BY 4.0, published 2026-09-21) reports: \"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1 h.\"","support":[{"end":2159,"quote":"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1\\u2009h.","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":2018},{"end":13314,"quote":"\"published\":{\"date-parts\":[[2026,9,21]]}","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":13274},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-gdj3-70104","source_sha256":"42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5","start":398}],"target_id":"claim.frontier.doi-10-1002-gdj3-70104","target_kind":"node","target_sha256":"0ea9efcdb5d7f7cae91f70c5f75b9ea3cf67c1a8ef09518e933f4175c15a0973"}],"claim.frontier.doi-10-1002-hec-70120":[{"id":"assertion.claim.frontier.doi-10-1002-hec-70120","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/hec.70120","quantifiers":"Only what the quoted sentence states","time":"2026-06-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"","support":[{"end":1327,"quote":"Using 2009\\u20132019 Behavioral Risk Factor Surveillance System data and a two\\u2010way fixed\\u2010effects difference\\u2010in\\u2010differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":1073},{"end":14101,"quote":"\"published\":{\"date-parts\":[[2026,6,22]]}","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":14061},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-hec-70120","source_sha256":"577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134","start":397}],"target_id":"claim.frontier.doi-10-1002-hec-70120","target_kind":"node","target_sha256":"06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715"}],"claim.frontier.doi-10-1002-hec-70140":[{"id":"assertion.claim.frontier.doi-10-1002-hec-70140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/hec.70140","quantifiers":"Only what the quoted sentence states","time":"2026-08-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/hec.70140 \"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery\" (CC BY 4.0, published 2026-08-08) reports: \"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.\"","support":[{"end":2344,"quote":"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":2126},{"end":12515,"quote":"\"published\":{\"date-parts\":[[2026,8,8]]}","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":12476},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-hec-70140","source_sha256":"cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326","start":397}],"target_id":"claim.frontier.doi-10-1002-hec-70140","target_kind":"node","target_sha256":"362c8742b04f7b46ac64a409263ac52f8d2510ccab52e734c440a20b65d50781"}],"claim.frontier.doi-10-1002-ijfe-70259":[{"id":"assertion.claim.frontier.doi-10-1002-ijfe-70259","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ijfe.70259","quantifiers":"Only what the quoted sentence states","time":"2026-07-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"","support":[{"end":1540,"quote":"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":1065},{"end":13844,"quote":"\"published\":{\"date-parts\":[[2026,7,12]]}","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":13804},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ijfe-70259","source_sha256":"2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475","start":395}],"target_id":"claim.frontier.doi-10-1002-ijfe-70259","target_kind":"node","target_sha256":"4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9"}],"claim.frontier.doi-10-1002-ijop-70275":[{"id":"assertion.claim.frontier.doi-10-1002-ijop-70275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ijop.70275","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ijop.70275 \"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020\" (CC BY 4.0, published 2026-10-02) reports: \"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.\"","support":[{"end":1971,"quote":"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":1754},{"end":8166,"quote":"\"published\":{\"date-parts\":[[2026,10,2]]}","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":8126},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ijop-70275","source_sha256":"daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1","start":397}],"target_id":"claim.frontier.doi-10-1002-ijop-70275","target_kind":"node","target_sha256":"8e9f43b3daab1bb74b6712f04d7c38700f3040e429d218368d71b9c931568a53"}],"claim.frontier.doi-10-1002-iroh-70046":[{"id":"assertion.claim.frontier.doi-10-1002-iroh-70046","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/iroh.70046","quantifiers":"Only what the quoted sentence states","time":"2026-09-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/iroh.70046 \"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir\" (CC BY 4.0, published 2026-09-27) reports: \"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.\"","support":[{"end":5241,"quote":"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":5126},{"end":19326,"quote":"\"published\":{\"date-parts\":[[2026,9,27]]}","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":19286},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-iroh-70046","source_sha256":"760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884","start":397}],"target_id":"claim.frontier.doi-10-1002-iroh-70046","target_kind":"node","target_sha256":"fb87d188bb97aa410ae1b72a1aded942e7039c590781b39f5497fc8be7f0d390"}],"claim.frontier.doi-10-1002-jclp-70212":[{"id":"assertion.claim.frontier.doi-10-1002-jclp-70212","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jclp.70212","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jclp.70212 \"Distant and Distressed: Interpersonal Problems in Anxiety and Depression\" (CC BY 4.0, published 2026-09-12) reports: \"As predicted, a cold‐submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.\"","support":[{"end":2859,"quote":"As predicted, a cold\\u2010submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":2722},{"end":13003,"quote":"\"published\":{\"date-parts\":[[2026,9,12]]}","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":12963},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jclp-70212","source_sha256":"33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89","start":396}],"target_id":"claim.frontier.doi-10-1002-jclp-70212","target_kind":"node","target_sha256":"47d977b3ddf6d692aaf1d2aa0d195cdd39520a1994076a85336d4daeffbec240"}],"claim.frontier.doi-10-1002-joc-70436":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70436","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70436","quantifiers":"Only what the quoted sentence states","time":"2026-05-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"","support":[{"end":2199,"quote":"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":2020},{"end":12801,"quote":"\"published\":{\"date-parts\":[[2026,5,26]]}","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":12761},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70436","source_sha256":"4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8","start":409}],"target_id":"claim.frontier.doi-10-1002-joc-70436","target_kind":"node","target_sha256":"af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a"}],"claim.frontier.doi-10-1002-joc-70526":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70526","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70526","quantifiers":"Only what the quoted sentence states","time":"2026-07-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70526 \"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI\" (CC BY 4.0, published 2026-07-28) reports: \"The results reveal a spatially heterogeneous and non‐stationary drought regime across Greece.\"","support":[{"end":1892,"quote":"The results reveal a spatially heterogeneous and non\\u2010stationary drought regime across Greece.","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":1794},{"end":11966,"quote":"\"published\":{\"date-parts\":[[2026,7,28]]}","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":11926},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70526","source_sha256":"0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b","start":386}],"target_id":"claim.frontier.doi-10-1002-joc-70526","target_kind":"node","target_sha256":"386007d2450ca9b0bf6898dede90d1f16698fcae96c58a46c3935532f08764ce"}],"claim.frontier.doi-10-1002-joc-70540":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70540","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70540","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70540 \"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models\" (CC BY 4.0, published 2026-08-02) reports: \"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher‐resolution ensembles within the UKCP18 framework.\"","support":[{"end":3169,"quote":"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher\\u2010resolution ensembles within the UKCP18 framework.","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":2866},{"end":10138,"quote":"\"published\":{\"date-parts\":[[2026,8,2]]}","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":10099},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70540","source_sha256":"75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311","start":384}],"target_id":"claim.frontier.doi-10-1002-joc-70540","target_kind":"node","target_sha256":"d876068aefa7381aa2f986142c22efcbafe2993bbbf4713b88261bc077c983d8"}],"claim.frontier.doi-10-1002-joc-70605":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70605","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70605 \"Climate Change Projections for Mexico in the 21st Century\" (CC BY 4.0, published 2026-10-06) reports: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","support":[{"end":3297,"quote":"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":3060},{"end":11273,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":11233},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70605","source_sha256":"fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70605","target_kind":"node","target_sha256":"f969e55d7c3e65b0676f9835895931ab3d6471800d5488f68cb1597f9fb7117b"}],"claim.frontier.doi-10-1002-joc-70613":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70613","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70613","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70613 \"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia\" (CC BY 4.0, published 2026-10-06) reports: \"These findings demonstrate that dynamical downscaling substantially reduces large‐scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.\"","support":[{"end":3508,"quote":"These findings demonstrate that dynamical downscaling substantially reduces large\\u2010scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":3264},{"end":31075,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":31035},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70613","source_sha256":"a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70613","target_kind":"node","target_sha256":"5ae2bb018f8d4930b105adbef2018ddeb2c471bb66c6a7454e3f0ae271790bab"}],"claim.frontier.doi-10-1002-joc-70629":[{"id":"assertion.claim.frontier.doi-10-1002-joc-70629","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/joc.70629","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/joc.70629 \"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections\" (CC BY 4.0, published 2026-10-08) reports: \"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4 days/decade), suggesting greater irregularity in the regional precipitation regime.\"","support":[{"end":2875,"quote":"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4\\u2009days\\/decade), suggesting greater irregularity in the regional precipitation regime.","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":2670},{"end":19083,"quote":"\"published\":{\"date-parts\":[[2026,10,8]]}","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":19043},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-joc-70629","source_sha256":"df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778","start":385}],"target_id":"claim.frontier.doi-10-1002-joc-70629","target_kind":"node","target_sha256":"07388bfa91d146b7ee6a7175ac28f177abcbe1486d17a5754798edda9c6f9c13"}],"claim.frontier.doi-10-1002-jpln-70107":[{"id":"assertion.claim.frontier.doi-10-1002-jpln-70107","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jpln.70107","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jpln.70107 \"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types\" (CC BY 4.0, published 2026-08-12) reports: \": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.\"","support":[{"end":3512,"quote":": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":3311},{"end":7483,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":7443},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jpln-70107","source_sha256":"dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c","start":396}],"target_id":"claim.frontier.doi-10-1002-jpln-70107","target_kind":"node","target_sha256":"7caec28a5f79904fabf4c5acb9a7e00d8efc698de019e19b5f0672048665f6b1"}],"claim.frontier.doi-10-1002-jpln-70129":[{"id":"assertion.claim.frontier.doi-10-1002-jpln-70129","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jpln.70129","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jpln.70129 \"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps\" (CC BY 4.0, published 2026-10-06) reports: \"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate‐driven water stress.\"","support":[{"end":3677,"quote":"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate\\u2010driven water stress.","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":3557},{"end":14046,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":14006},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jpln-70129","source_sha256":"c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022","start":385}],"target_id":"claim.frontier.doi-10-1002-jpln-70129","target_kind":"node","target_sha256":"3f5813936443ab3880eb08ee6845a959024d90004dd31b164dccb6450ad90ca1"}],"claim.frontier.doi-10-1002-jqs-70108":[{"id":"assertion.claim.frontier.doi-10-1002-jqs-70108","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/jqs.70108","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/jqs.70108 \"A talus rock glacier in Nantlle Valley, North Wales\" (CC BY 4.0, published 2026-08-26) reports: \"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small‐scale failure events.\"","support":[{"end":1840,"quote":"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small\\u2010scale failure events.","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":1670},{"end":22867,"quote":"\"published\":{\"date-parts\":[[2026,8,26]]}","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":22827},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-jqs-70108","source_sha256":"85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345","start":396}],"target_id":"claim.frontier.doi-10-1002-jqs-70108","target_kind":"node","target_sha256":"03f0b2421318c13287ed8b988e030e79730a9d2f7b6f57b7d4f7be42f609ec38"}],"claim.frontier.doi-10-1002-lol2-70186":[{"id":"assertion.claim.frontier.doi-10-1002-lol2-70186","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/lol2.70186","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/lol2.70186 \"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers\" (CC BY 4.0, published 2026-10-09) reports: \"We identify extensive subsurface sediment plumes from marine‐terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment‐core reconstructions.\"","support":[{"end":2131,"quote":"We identify extensive subsurface sediment plumes from marine\\u2010terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment\\u2010core reconstructions.","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":1924},{"end":8671,"quote":"\"published\":{\"date-parts\":[[2026,10,9]]}","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":8631},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-lol2-70186","source_sha256":"0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18","start":397}],"target_id":"claim.frontier.doi-10-1002-lol2-70186","target_kind":"node","target_sha256":"ed4a7c3ee5de681986a3ae5f899173ec642ef8662f832b596144e7ccf408e1e3"}],"claim.frontier.doi-10-1002-msd2-70089":[{"id":"assertion.claim.frontier.doi-10-1002-msd2-70089","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/msd2.70089","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/msd2.70089 \"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission\" (CC BY 4.0, published 2026-08-24) reports: \"The stability of the controlling system is proved by the Lyapunov stability theory.\"","support":[{"end":2699,"quote":"The stability of the controlling system is proved by the Lyapunov stability theory.","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":2616},{"end":14462,"quote":"\"published\":{\"date-parts\":[[2026,8,24]]}","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":14422},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-msd2-70089","source_sha256":"611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85","start":396}],"target_id":"claim.frontier.doi-10-1002-msd2-70089","target_kind":"node","target_sha256":"ff896932e901389d4c8cf6a95c5346b4586402514c2f4df84fa7968efe070f7f"}],"claim.frontier.doi-10-1002-nzm2-70056":[{"id":"assertion.claim.frontier.doi-10-1002-nzm2-70056","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/nzm2.70056","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/nzm2.70056 \"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand\" (CC BY 4.0, published 2026-07-16) reports: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","support":[{"end":1874,"quote":"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":1641},{"end":15282,"quote":"\"published\":{\"date-parts\":[[2026,7,16]]}","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":15242},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-nzm2-70056","source_sha256":"9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340","start":397}],"target_id":"claim.frontier.doi-10-1002-nzm2-70056","target_kind":"node","target_sha256":"b2c84605c03023188bb6bfae04fbadd0d0f396b6a28e669be64f79cf6cc431bf"}],"claim.frontier.doi-10-1002-pei3-70207":[{"id":"assertion.claim.frontier.doi-10-1002-pei3-70207","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/pei3.70207","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/pei3.70207 \"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment\" (CC BY 4.0, published 2026-09-30) reports: \"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1°C rise in temperature was associated with a 10% reduction in major staple crop production.\"","support":[{"end":2405,"quote":"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1\\u00b0C rise in temperature was associated with a 10% reduction in major staple crop production.","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":2172},{"end":43482,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":43442},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-pei3-70207","source_sha256":"a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb","start":398}],"target_id":"claim.frontier.doi-10-1002-pei3-70207","target_kind":"node","target_sha256":"f6d7126485d10cb3fbc702ba0aba310b5fcc9fa3b8bfceef62d1ab470ecf9015"}],"claim.frontier.doi-10-1002-ppp-70049":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70049","quantifiers":"Only what the quoted sentence states","time":"2026-07-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"","support":[{"end":2897,"quote":"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium\\u2010range weather prediction ensembles are used to drive the model.","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":2697},{"end":17580,"quote":"\"published\":{\"date-parts\":[[2026,7,5]]}","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":17541},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70049","source_sha256":"ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70049","target_kind":"node","target_sha256":"7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9"}],"claim.frontier.doi-10-1002-ppp-70053":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70053","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70053","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"","support":[{"end":2255,"quote":"The results suggest that the 5\\u2009m tall dome\\u2010shaped palsa contains permafrost up to 20\\u2010m\\u2010thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower\\u2010relief areas on the palsa.","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":2025},{"end":11852,"quote":"\"published\":{\"date-parts\":[[2026,7,14]]}","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":11812},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70053","source_sha256":"49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70053","target_kind":"node","target_sha256":"20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5"}],"claim.frontier.doi-10-1002-ppp-70058":[{"id":"assertion.claim.frontier.doi-10-1002-ppp-70058","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/ppp.70058","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/ppp.70058 \"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape\" (CC BY 4.0, published 2026-08-12) reports: \"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.\"","support":[{"end":3719,"quote":"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":3440},{"end":14731,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":14691},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-ppp-70058","source_sha256":"167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd","start":397}],"target_id":"claim.frontier.doi-10-1002-ppp-70058","target_kind":"node","target_sha256":"7d164c252922852307aecf82cdf3d51384bbd769b8656def08e486f5e3fa01f6"}],"claim.frontier.doi-10-1002-qj-70252":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70252","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70252","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70252 \"Using microwave imager observations to improve the ocean temperature in a coupled NWP system\" (CC BY 4.0, published 2026-08-02) reports: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","support":[{"end":2009,"quote":"It is shown that these skin temperature estimates improve the fit of the short\\u2010range forecast ocean temperature profiles to Array for Real\\u2010Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":1736},{"end":11765,"quote":"\"published\":{\"date-parts\":[[2026,8,2]]}","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":11726},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70252","source_sha256":"9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd","start":384}],"target_id":"claim.frontier.doi-10-1002-qj-70252","target_kind":"node","target_sha256":"0d2ec90d7c004965336849e7dc4a9cca620c05fb97297819be281f3398bd44c3"}],"claim.frontier.doi-10-1002-qj-70302":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70302","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70302","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70302 \"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments\" (CC BY 4.0, published 2026-09-03) reports: \"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.\"","support":[{"end":3273,"quote":"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":3131},{"end":10119,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":10080},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70302","source_sha256":"6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a","start":394}],"target_id":"claim.frontier.doi-10-1002-qj-70302","target_kind":"node","target_sha256":"a5daec029c63e95a1c3f0a85b4676dcac7ad1366bb714d865261bc3cc1af294c"}],"claim.frontier.doi-10-1002-qj-70308":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70308","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70308","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70308 \"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas\" (CC BY 4.0, published 2026-09-17) reports: \"In contrast, the WH‐WD and CH‐WD clusters are associated with upper‐level cyclonic anomalies characteristic of WDs, embedded within broader wave‐train‐like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)–subtropical jet (STJ)–WD pathways.\"","support":[{"end":2553,"quote":"In contrast, the WH\\u2010WD and CH\\u2010WD clusters are associated with upper\\u2010level cyclonic anomalies characteristic of WDs, embedded within broader wave\\u2010train\\u2010like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)\\u2013subtropical jet (STJ)\\u2013WD pathways.","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":2228},{"end":22106,"quote":"\"published\":{\"date-parts\":[[2026,9,17]]}","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":22066},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70308","source_sha256":"ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2","start":386}],"target_id":"claim.frontier.doi-10-1002-qj-70308","target_kind":"node","target_sha256":"0fa42e72c19a4c09d0231d49d041f0b7ae1cd295ff1f5960b6fc6736461d54c2"}],"claim.frontier.doi-10-1002-qj-70320":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70320","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70320 \"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain\" (CC BY 4.0, published 2026-09-29) reports: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","support":[{"end":1825,"quote":"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":1679},{"end":9942,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":9902},{"end":442,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70320","source_sha256":"76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136","start":385}],"target_id":"claim.frontier.doi-10-1002-qj-70320","target_kind":"node","target_sha256":"5f923eb3d0e3c0730ba2550114be65407656d8a42918dfb55a22e1d9b2ccf8eb"}],"claim.frontier.doi-10-1002-qj-70333":[{"id":"assertion.claim.frontier.doi-10-1002-qj-70333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/qj.70333","quantifiers":"Only what the quoted sentence states","time":"2026-10-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/qj.70333 \"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022\" (CC BY 4.0, published 2026-10-15) reports: \"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.\"","support":[{"end":2973,"quote":"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":2818},{"end":15280,"quote":"\"published\":{\"date-parts\":[[2026,10,15]]}","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":15239},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-qj-70333","source_sha256":"51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64","start":387}],"target_id":"claim.frontier.doi-10-1002-qj-70333","target_kind":"node","target_sha256":"0d872817b56073a0487518b3bc1ce9d91303a7a2b95c379f932c4b829e96d01c"}],"claim.frontier.doi-10-1002-sce-70090":[{"id":"assertion.claim.frontier.doi-10-1002-sce-70090","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/sce.70090","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"","support":[{"end":2079,"quote":"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":1981},{"end":25346,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":25306},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-sce-70090","source_sha256":"d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936","start":398}],"target_id":"claim.frontier.doi-10-1002-sce-70090","target_kind":"node","target_sha256":"7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc"}],"claim.frontier.doi-10-1002-tox-70177":[{"id":"assertion.claim.frontier.doi-10-1002-tox-70177","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1002/tox.70177","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1002/tox.70177 \"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa\" (CC BY 4.0, published 2026-08-07) reports: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","support":[{"end":3653,"quote":"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water\\u2010quality management, and underscore the need for continued monitoring to support effective water\\u2010resource management.","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":3409},{"end":16967,"quote":"\"published\":{\"date-parts\":[[2026,8,7]]}","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":16928},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1002-tox-70177","source_sha256":"1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229","start":394}],"target_id":"claim.frontier.doi-10-1002-tox-70177","target_kind":"node","target_sha256":"91b5eba28359f7aee9e6a4a07e2f1450da71689334ace373f0ec6a8bf1de7e61"}],"claim.frontier.doi-10-1029-2025ea004610":[{"id":"assertion.claim.frontier.doi-10-1029-2025ea004610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025ea004610","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"","support":[{"end":1921,"quote":"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":1745},{"end":9952,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":9912},{"end":491,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025ea004610","source_sha256":"5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d","start":434}],"target_id":"claim.frontier.doi-10-1029-2025ea004610","target_kind":"node","target_sha256":"3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c"}],"claim.frontier.doi-10-1029-2025gc012776":[{"id":"assertion.claim.frontier.doi-10-1029-2025gc012776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gc012776","quantifiers":"Only what the quoted sentence states","time":"2026-05-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"","support":[{"end":1428,"quote":"We show the first results of sidescan\\u2010sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":1295},{"end":13083,"quote":"\"published\":{\"date-parts\":[[2026,5,28]]}","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":13043},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gc012776","source_sha256":"ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf","start":424}],"target_id":"claim.frontier.doi-10-1029-2025gc012776","target_kind":"node","target_sha256":"be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96"}],"claim.frontier.doi-10-1029-2025gl121171":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121171","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121171","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"","support":[{"end":2602,"quote":"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top\\u2010down estimates of the terrestrial carbon sink.","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":2451},{"end":12705,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":12665},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121171","source_sha256":"d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121171","target_kind":"node","target_sha256":"34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89"}],"claim.frontier.doi-10-1029-2025gl121323":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121323","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121323","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"","support":[{"end":2230,"quote":"Here we report Fe concentrations and isotopic compositions from a Fe\\u2010Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":2082},{"end":15200,"quote":"\"published\":{\"date-parts\":[[2026,7,13]]}","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":15160},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121323","source_sha256":"557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121323","target_kind":"node","target_sha256":"e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7"}],"claim.frontier.doi-10-1029-2025gl121378":[{"id":"assertion.claim.frontier.doi-10-1029-2025gl121378","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025gl121378","quantifiers":"Only what the quoted sentence states","time":"2026-06-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"","support":[{"end":2659,"quote":"These findings highlight the utility of dv\\/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater\\u2013vegetation interactions, and supporting ecohydrological research and water management in semi\\u2010arid snowmelt systems.","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":2343},{"end":13355,"quote":"\"published\":{\"date-parts\":[[2026,6,16]]}","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":13315},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025gl121378","source_sha256":"b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd","start":436}],"target_id":"claim.frontier.doi-10-1029-2025gl121378","target_kind":"node","target_sha256":"f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385"}],"claim.frontier.doi-10-1029-2025jb032632":[{"id":"assertion.claim.frontier.doi-10-1029-2025jb032632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jb032632","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jb032632 \"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series\" (CC BY 4.0, published 2026-07-30) reports: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","support":[{"end":2532,"quote":"In a comparison with Global Navigation Satellite System\\u2010derived measurements of deformation, our approach dramatically outperforms a state\\u2010of\\u2010the\\u2010art correction method based on a weather model, reducing root\\u2010mean\\u2010square error by  (0.006\\u00a0m vs. 0.017\\u00a0m).","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":2240},{"end":10181,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":10141},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jb032632","source_sha256":"3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f","start":435}],"target_id":"claim.frontier.doi-10-1029-2025jb032632","target_kind":"node","target_sha256":"9f96cf8c93c7db4cb362f8cde4c9b887b6f5cd22c7b9a7255263f2d6a9def062"}],"claim.frontier.doi-10-1029-2025jb033060":[{"id":"assertion.claim.frontier.doi-10-1029-2025jb033060","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jb033060","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","support":[{"end":2398,"quote":"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":2183},{"end":17528,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":17488},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jb033060","source_sha256":"276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c","start":424}],"target_id":"claim.frontier.doi-10-1029-2025jb033060","target_kind":"node","target_sha256":"707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840"}],"claim.frontier.doi-10-1029-2025jc023581":[{"id":"assertion.claim.frontier.doi-10-1029-2025jc023581","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jc023581","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jc023581 \"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey\" (CC BY 4.0, published 2026-07-30) reports: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","support":[{"end":2059,"quote":"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":1920},{"end":18335,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":18295},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jc023581","source_sha256":"0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737","start":426}],"target_id":"claim.frontier.doi-10-1029-2025jc023581","target_kind":"node","target_sha256":"297c72011a9be269947e359261441d96b665b9afac0cc13f4b710a1272afc2f5"}],"claim.frontier.doi-10-1029-2025jd044617":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd044617","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd044617","quantifiers":"Only what the quoted sentence states","time":"2026-06-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"","support":[{"end":1917,"quote":"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper\\u2010level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":1646},{"end":14772,"quote":"\"published\":{\"date-parts\":[[2026,6,10]]}","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":14732},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd044617","source_sha256":"7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725","start":426}],"target_id":"claim.frontier.doi-10-1029-2025jd044617","target_kind":"node","target_sha256":"0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9"}],"claim.frontier.doi-10-1029-2025jd045718":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd045718","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd045718","quantifiers":"Only what the quoted sentence states","time":"2026-06-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"","support":[{"end":2165,"quote":"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":1844},{"end":11142,"quote":"\"published\":{\"date-parts\":[[2026,6,6]]}","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":11103},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd045718","source_sha256":"f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d","start":425}],"target_id":"claim.frontier.doi-10-1029-2025jd045718","target_kind":"node","target_sha256":"36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7"}],"claim.frontier.doi-10-1029-2025jd045965":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd045965","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd045965","quantifiers":"Only what the quoted sentence states","time":"2026-06-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"","support":[{"end":3253,"quote":"These findings suggest that future dust transport to high\\u2010elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":3071},{"end":16788,"quote":"\"published\":{\"date-parts\":[[2026,6,2]]}","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":16749},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd045965","source_sha256":"3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881","start":425}],"target_id":"claim.frontier.doi-10-1029-2025jd045965","target_kind":"node","target_sha256":"a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7"}],"claim.frontier.doi-10-1029-2025jd046190":[{"id":"assertion.claim.frontier.doi-10-1029-2025jd046190","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025jd046190","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"","support":[{"end":3449,"quote":"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution\\u2010dependent, and the plume rise model still fails to reproduce the highest observed plume heights.","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":3240},{"end":13259,"quote":"\"published\":{\"date-parts\":[[2026,7,13]]}","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":13219},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025jd046190","source_sha256":"371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18","start":436}],"target_id":"claim.frontier.doi-10-1029-2025jd046190","target_kind":"node","target_sha256":"e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8"}],"claim.frontier.doi-10-1029-2025wr041875":[{"id":"assertion.claim.frontier.doi-10-1029-2025wr041875","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025wr041875","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"","support":[{"end":2590,"quote":"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":2380},{"end":9034,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":8994},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025wr041875","source_sha256":"e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc","start":435}],"target_id":"claim.frontier.doi-10-1029-2025wr041875","target_kind":"node","target_sha256":"9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9"}],"claim.frontier.doi-10-1029-2025wr042846":[{"id":"assertion.claim.frontier.doi-10-1029-2025wr042846","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2025wr042846","quantifiers":"Only what the quoted sentence states","time":"2026-05-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"","support":[{"end":2504,"quote":"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":2317},{"end":22905,"quote":"\"published\":{\"date-parts\":[[2026,5,30]]}","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":22865},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2025wr042846","source_sha256":"04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034","start":425}],"target_id":"claim.frontier.doi-10-1029-2025wr042846","target_kind":"node","target_sha256":"cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86"}],"claim.frontier.doi-10-1029-2026gc013127":[{"id":"assertion.claim.frontier.doi-10-1029-2026gc013127","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gc013127","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gc013127 \"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana\" (CC BY 4.0, published 2026-09-29) reports: \"Together with regional Permian plume‐affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.\"","support":[{"end":3392,"quote":"Together with regional Permian plume\\u2010affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":3135},{"end":25404,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":25364},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gc013127","source_sha256":"0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gc013127","target_kind":"node","target_sha256":"df6bf646bb406fc1b577ed3edf05d6bea2c933a7385138811808492a8c675c3c"}],"claim.frontier.doi-10-1029-2026gl122157":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122157","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122157","quantifiers":"Only what the quoted sentence states","time":"2026-06-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"","support":[{"end":1992,"quote":"These observations indicate substantial coarse sediment retention within an active near\\u2010terminus subglacial channel, potentially weakening short\\u2010term correspondence between coarse subglacial transport and proglacial sediment export.","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":1750},{"end":9999,"quote":"\"published\":{\"date-parts\":[[2026,6,26]]}","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":9959},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122157","source_sha256":"bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl122157","target_kind":"node","target_sha256":"aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284"}],"claim.frontier.doi-10-1029-2026gl122518":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122518","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122518","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"","support":[{"end":2909,"quote":"These results indicate that half\\u2010space assumptions capture the first\\u2010order rupture characteristics but can introduce significant bias in detailed rupture processes.","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":2735},{"end":12044,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":12005},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122518","source_sha256":"27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl122518","target_kind":"node","target_sha256":"d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516"}],"claim.frontier.doi-10-1029-2026gl122539":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122539","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122539","quantifiers":"Only what the quoted sentence states","time":"2026-07-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122539 \"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics\" (CC BY 4.0, published 2026-07-18) reports: \"We demonstrate that repeated SWOT high‐rate acquisitions can accurately monitor changes in ice‐shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.\"","support":[{"end":1897,"quote":"We demonstrate that repeated SWOT high\\u2010rate acquisitions can accurately monitor changes in ice\\u2010shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":1586},{"end":17945,"quote":"\"published\":{\"date-parts\":[[2026,7,18]]}","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":17905},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122539","source_sha256":"da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl122539","target_kind":"node","target_sha256":"cfcba1e3e5b3628586a03c6d9ee36c942e9f5279c6880df3a59ceb7c3dce02b1"}],"claim.frontier.doi-10-1029-2026gl122610":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122610","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122610 \"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin\" (CC BY 4.0, published 2026-09-18) reports: \"These results show that SWOT WSE assimilation improves discharge estimates under real‐world constraints, supporting water management in data‐sparse and transboundary basins globally.\"","support":[{"end":2215,"quote":"These results show that SWOT WSE assimilation improves discharge estimates under real\\u2010world constraints, supporting water management in data\\u2010sparse and transboundary basins globally.","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":2023},{"end":12427,"quote":"\"published\":{\"date-parts\":[[2026,9,18]]}","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":12387},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122610","source_sha256":"7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl122610","target_kind":"node","target_sha256":"27aacbd05e369f29387cd7a2e4eea82b687c2a65ed4b89232758ab785d137863"}],"claim.frontier.doi-10-1029-2026gl122646":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122646","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122646 \"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land\" (CC BY 4.0, published 2026-08-12) reports: \"We analyze near‐coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot/humid extremes on land.\"","support":[{"end":1630,"quote":"We analyze near\\u2010coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat\\/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot\\/humid extremes on land.","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":1271},{"end":10945,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":10905},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122646","source_sha256":"e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl122646","target_kind":"node","target_sha256":"fadfbea70e81d9bc9708a79769da09a9a6afc6c1acf07dc54498420e51a2759f"}],"claim.frontier.doi-10-1029-2026gl122664":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl122664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl122664","quantifiers":"Only what the quoted sentence states","time":"2026-06-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"","support":[{"end":2456,"quote":"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake\\u2010river science and water management.","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":2288},{"end":12140,"quote":"\"published\":{\"date-parts\":[[2026,6,4]]}","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":12101},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl122664","source_sha256":"70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477","start":435}],"target_id":"claim.frontier.doi-10-1029-2026gl122664","target_kind":"node","target_sha256":"f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af"}],"claim.frontier.doi-10-1029-2026gl123355":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl123355","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl123355","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"","support":[{"end":1831,"quote":"We report a rare quiet\\u2010time observation by NOAA\\u201018 spacecraft flying nearly along the electron isotropy boundary (IBe).","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":1702},{"end":10971,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":10931},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl123355","source_sha256":"89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl123355","target_kind":"node","target_sha256":"88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34"}],"claim.frontier.doi-10-1029-2026gl123821":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl123821","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl123821","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl123821 \"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers\" (CC BY 4.0, published 2026-08-05) reports: \"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land‐surface processes.\"","support":[{"end":2317,"quote":"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land\\u2010surface processes.","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":2173},{"end":15666,"quote":"\"published\":{\"date-parts\":[[2026,8,5]]}","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":15627},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl123821","source_sha256":"c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9","start":424}],"target_id":"claim.frontier.doi-10-1029-2026gl123821","target_kind":"node","target_sha256":"7dbc92b200702547607024be1de7289f698d5298da3a9d788be3946ac22d3c7c"}],"claim.frontier.doi-10-1029-2026gl124090":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124090","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124090","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124090 \"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?\" (CC BY 4.0, published 2026-09-30) reports: \"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.\"","support":[{"end":2235,"quote":"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":2070},{"end":9931,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":9891},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124090","source_sha256":"4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124090","target_kind":"node","target_sha256":"ff8032e649311f9d6684fed35770e8d72d39748fdd2007c2a4447279d30f7694"}],"claim.frontier.doi-10-1029-2026gl124111":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124111","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124111","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124111 \"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation\" (CC BY 4.0, published 2026-07-23) reports: \"Using observational data sets and numerical experiments, we demonstrate that this IOD‐ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).\"","support":[{"end":3242,"quote":"Using observational data sets and numerical experiments, we demonstrate that this IOD\\u2010ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":3011},{"end":16538,"quote":"\"published\":{\"date-parts\":[[2026,7,23]]}","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":16498},{"end":493,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124111","source_sha256":"2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545","start":436}],"target_id":"claim.frontier.doi-10-1029-2026gl124111","target_kind":"node","target_sha256":"2a1cb84b35a71dc359e79efc288b4dbeda7c9449cbc9b9cb1687eb81774bcf30"}],"claim.frontier.doi-10-1029-2026gl124233":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124233","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124233","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124233 \"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change\" (CC BY 4.0, published 2026-09-29) reports: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","support":[{"end":2259,"quote":"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":2024},{"end":11285,"quote":"\"published\":{\"date-parts\":[[2026,9,29]]}","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":11245},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124233","source_sha256":"3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124233","target_kind":"node","target_sha256":"c990db21bb02ac6e1f64fbb7c329e9c84dd0175e1b37292bfaffe5bd873886dd"}],"claim.frontier.doi-10-1029-2026gl124411":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124411","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124411","quantifiers":"Only what the quoted sentence states","time":"2026-10-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124411 \"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing\" (CC BY 4.0, published 2026-10-08) reports: \"The results showed that the too‐intense localized precipitation frequently produced in km‐scale models, known as “popcorn‐like” precipitation, weakens as resolution increases.\"","support":[{"end":2555,"quote":"The results showed that the too\\u2010intense localized precipitation frequently produced in km\\u2010scale models, known as \\u201cpopcorn\\u2010like\\u201d precipitation, weakens as resolution increases.","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":2355},{"end":12607,"quote":"\"published\":{\"date-parts\":[[2026,10,8]]}","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":12567},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124411","source_sha256":"551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124411","target_kind":"node","target_sha256":"4cd1070aee40475dd6d06e6ab0fadb7be7d587e75c98038196ec75776733f3e7"}],"claim.frontier.doi-10-1029-2026gl124622":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124622","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124622","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124622 \"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models\" (CC BY 4.0, published 2026-10-14) reports: \"These findings suggest that flood risk communication under climate warming should distinguish broad climate‐driven tendencies from uncertain local responses.\"","support":[{"end":3363,"quote":"These findings suggest that flood risk communication under climate warming should distinguish broad climate\\u2010driven tendencies from uncertain local responses.","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":3201},{"end":12366,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":12325},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124622","source_sha256":"7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416","start":427}],"target_id":"claim.frontier.doi-10-1029-2026gl124622","target_kind":"node","target_sha256":"54435a5873a0dae64e7d1d0aebed146e0326f931218584537aa411be511d4864"}],"claim.frontier.doi-10-1029-2026gl124661":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124661","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124661","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124661 \"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?\" (CC BY 4.0, published 2026-07-30) reports: \"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full‐training‐data baseline model.\"","support":[{"end":1804,"quote":"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full\\u2010training\\u2010data baseline model.","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":1639},{"end":8650,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":8610},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124661","source_sha256":"0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl124661","target_kind":"node","target_sha256":"120d5021d1bf0c3ec0ee755ea9a89d44105671c38b4d7733c01a4e1bb93fc16f"}],"claim.frontier.doi-10-1029-2026gl124727":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124727","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124727","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124727 \"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change\" (CC BY 4.0, published 2026-08-19) reports: \"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.\"","support":[{"end":1525,"quote":"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":1374},{"end":13472,"quote":"\"published\":{\"date-parts\":[[2026,8,19]]}","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":13432},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124727","source_sha256":"a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a","start":425}],"target_id":"claim.frontier.doi-10-1029-2026gl124727","target_kind":"node","target_sha256":"ccfb2a129ee24b3a6489612d9b84d81407c90375f31b065a6dee4a3e0227a471"}],"claim.frontier.doi-10-1029-2026gl124881":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl124881","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl124881","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl124881 \"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland\" (CC BY 4.0, published 2026-09-23) reports: \"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice–bed interface without spatial interpolation.\"","support":[{"end":1846,"quote":"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice\\u2013bed interface without spatial interpolation.","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":1655},{"end":13178,"quote":"\"published\":{\"date-parts\":[[2026,9,23]]}","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":13138},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl124881","source_sha256":"b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f","start":426}],"target_id":"claim.frontier.doi-10-1029-2026gl124881","target_kind":"node","target_sha256":"0e805f7ff2cf9b4e84fc48accb8792ba130588942398377add6a0f1421798a2d"}],"claim.frontier.doi-10-1029-2026gl125301":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl125301","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl125301","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl125301 \"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands\" (CC BY 4.0, published 2026-10-13) reports: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","support":[{"end":2777,"quote":"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":2549},{"end":12996,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":12955},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl125301","source_sha256":"f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757","start":427}],"target_id":"claim.frontier.doi-10-1029-2026gl125301","target_kind":"node","target_sha256":"d19887697cf45eb1d4573ba253ec980e43f5eed329f166e5b1327be08d2d11cb"}],"claim.frontier.doi-10-1029-2026gl125327":[{"id":"assertion.claim.frontier.doi-10-1029-2026gl125327","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026gl125327","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026gl125327 \"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica\" (CC BY 4.0, published 2026-09-03) reports: \"Our results show that while a large disturbance event can increase solute inputs and shift the long‐term average dissolved ion concentrations, the overall stream discharge‐concentration relationship may remain chemostatic.\"","support":[{"end":2731,"quote":"Our results show that while a large disturbance event can increase solute inputs and shift the long\\u2010term average dissolved ion concentrations, the overall stream discharge\\u2010concentration relationship may remain chemostatic.","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":2499},{"end":9887,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":9848},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026gl125327","source_sha256":"c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36","start":424}],"target_id":"claim.frontier.doi-10-1029-2026gl125327","target_kind":"node","target_sha256":"f67886ee0901f383640fdc6af4bd815f1a88f81b0adfb7291f11b96fb8eb2b13"}],"claim.frontier.doi-10-1029-2026jd046723":[{"id":"assertion.claim.frontier.doi-10-1029-2026jd046723","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jd046723","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jd046723 \"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America\" (CC BY 4.0, published 2026-08-24) reports: \"H reached 0.43, and the 5 km simulation outperformed the previous 10 km run, highlighting the benefits of improved topographic representation.\"","support":[{"end":3383,"quote":"H reached 0.43, and the 5\\u00a0km simulation outperformed the previous 10\\u00a0km run, highlighting the benefits of improved topographic representation.","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":3231},{"end":16340,"quote":"\"published\":{\"date-parts\":[[2026,8,24]]}","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":16300},{"end":483,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jd046723","source_sha256":"53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516","start":426}],"target_id":"claim.frontier.doi-10-1029-2026jd046723","target_kind":"node","target_sha256":"2aafd4fd3b0ca6a291ba91ec36a3cc652e3de78e1953febae44e5d2c5135d560"}],"claim.frontier.doi-10-1029-2026jh001250":[{"id":"assertion.claim.frontier.doi-10-1029-2026jh001250","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jh001250","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"","support":[{"end":2556,"quote":"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":2352},{"end":18202,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":18163},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jh001250","source_sha256":"571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc","start":424}],"target_id":"claim.frontier.doi-10-1029-2026jh001250","target_kind":"node","target_sha256":"d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882"}],"claim.frontier.doi-10-1029-2026jh001578":[{"id":"assertion.claim.frontier.doi-10-1029-2026jh001578","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026jh001578","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026jh001578 \"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location\" (CC BY 4.0, published 2026-09-21) reports: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","support":[{"end":2913,"quote":"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data\\u2010driven approaches to rapid earthquake characterization.","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":2719},{"end":19188,"quote":"\"published\":{\"date-parts\":[[2026,9,21]]}","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":19148},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026jh001578","source_sha256":"6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4","start":424}],"target_id":"claim.frontier.doi-10-1029-2026jh001578","target_kind":"node","target_sha256":"6139790797c0d1ae8499bfc6f7b9bc51463294b1600010c991c30d6cdecc8204"}],"claim.frontier.doi-10-1029-2026wr044293":[{"id":"assertion.claim.frontier.doi-10-1029-2026wr044293","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1029/2026wr044293","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1029/2026wr044293 \"Morphological State Transitions and Sediment Transport Variability in Braided Rivers\" (CC BY 4.0, published 2026-08-29) reports: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","support":[{"end":1667,"quote":"Here we show that the temporal variability of sediment transport results from switching\\u00a0between a finite set of recurrent morphological configurations.","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":1511},{"end":10834,"quote":"\"published\":{\"date-parts\":[[2026,8,29]]}","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":10794},{"end":482,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1029-2026wr044293","source_sha256":"3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b","start":425}],"target_id":"claim.frontier.doi-10-1029-2026wr044293","target_kind":"node","target_sha256":"1e49be6aa2ba28ac291c0db268f9d900f4aeac4652b5dcf0eb6f819b84d3629a"}],"claim.frontier.doi-10-1075-consl-25020-lia":[{"id":"assertion.claim.frontier.doi-10-1075-consl-25020-lia","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1075/consl.25020.lia","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1075/consl.25020.lia \"When ‘John broke up Mary’ becomes acceptable\" (CC BY 4.0, published 2026-10-12) reports: \"These findings show that argument structure representations can be shaped by usage.\"","support":[{"end":2062,"quote":"These findings show that argument structure representations can be shaped by usage.","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":1979},{"end":9594,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":9553},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1075-consl-25020-lia","source_sha256":"5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8","start":423}],"target_id":"claim.frontier.doi-10-1075-consl-25020-lia","target_kind":"node","target_sha256":"cb466f2887c76ab0f65c645be4f04d8d5628017f8509b150fa17e138dd5c1e4d"}],"claim.frontier.doi-10-1098-rsnr-2026-0030":[{"id":"assertion.claim.frontier.doi-10-1098-rsnr-2026-0030","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsnr.2026.0030","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsnr.2026.0030 \"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge\" (CC BY 4.0, published 2026-09-02) reports: \"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaquín in Mexico City.\"","support":[{"end":1401,"quote":"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaqu\\u00edn in Mexico City.","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":1180},{"end":5718,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":5679},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsnr-2026-0030","source_sha256":"a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e","start":395}],"target_id":"claim.frontier.doi-10-1098-rsnr-2026-0030","target_kind":"node","target_sha256":"2ff5646876dd7cf0504f4ee7aa5df12a5827f0108f5ed6bd8022022f0fde215d"}],"claim.frontier.doi-10-1098-rsta-2025-0029":[{"id":"assertion.claim.frontier.doi-10-1098-rsta-2025-0029","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsta.2025.0029","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsta.2025.0029 \"The many faces of rotating quantum turbulence\" (CC BY 4.0, published 2026-07-30) reports: \"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.\"","support":[{"end":1786,"quote":"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":1620},{"end":29574,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":29534},{"end":470,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsta-2025-0029","source_sha256":"2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e","start":413}],"target_id":"claim.frontier.doi-10-1098-rsta-2025-0029","target_kind":"node","target_sha256":"af8ac57849b011cf7ad6e60ef5b4f7f43180db05f33d14383df76270acf25e10"}],"claim.frontier.doi-10-1098-rsta-2025-0107":[{"id":"assertion.claim.frontier.doi-10-1098-rsta-2025-0107","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1098/rsta.2025.0107","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1098/rsta.2025.0107 \"Merits of geometric algebra applied to cryptography and machine learning\" (CC BY 4.0, published 2026-08-13) reports: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","support":[{"end":1891,"quote":"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":1569},{"end":9149,"quote":"\"published\":{\"date-parts\":[[2026,8,13]]}","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":9109},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1098-rsta-2025-0107","source_sha256":"e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b","start":423}],"target_id":"claim.frontier.doi-10-1098-rsta-2025-0107","target_kind":"node","target_sha256":"5ba11b8db55e335857acd07bc179ac0daf52cde3500ebe8524756b4dd5d7fcea"}],"claim.frontier.doi-10-1111-1467-9477-70049":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9477-70049","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9477.70049","quantifiers":"Only what the quoted sentence states","time":"2026-06-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","support":[{"end":2414,"quote":"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":2081},{"end":9386,"quote":"\"published\":{\"date-parts\":[[2026,6,21]]}","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":9346},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9477-70049","source_sha256":"8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab","start":408}],"target_id":"claim.frontier.doi-10-1111-1467-9477-70049","target_kind":"node","target_sha256":"7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193"}],"claim.frontier.doi-10-1111-1467-9566-70245":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9566-70245","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9566.70245","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9566.70245 \"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal\" (CC BY 4.0, published 2026-08-06) reports: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","support":[{"end":2770,"quote":"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":2494},{"end":9623,"quote":"\"published\":{\"date-parts\":[[2026,8,6]]}","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":9584},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9566-70245","source_sha256":"76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b","start":396}],"target_id":"claim.frontier.doi-10-1111-1467-9566-70245","target_kind":"node","target_sha256":"c5cf402730750a47a7a770312509f9b93a556d2c14e47636d91809efc715bb7e"}],"claim.frontier.doi-10-1111-1467-9566-70277":[{"id":"assertion.claim.frontier.doi-10-1111-1467-9566-70277","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1467-9566.70277","quantifiers":"Only what the quoted sentence states","time":"2026-10-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1467-9566.70277 \"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception\" (CC BY 4.0, published 2026-10-06) reports: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","support":[{"end":2660,"quote":"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis\\/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de\\u2010animation or embrace legal ambiguity.","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":2196},{"end":10547,"quote":"\"published\":{\"date-parts\":[[2026,10,6]]}","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":10507},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1467-9566-70277","source_sha256":"c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5","start":398}],"target_id":"claim.frontier.doi-10-1111-1467-9566-70277","target_kind":"node","target_sha256":"8b84360c3005120ef6218b79707ddae1550335e913b7e5f1c386fce38285274a"}],"claim.frontier.doi-10-1111-1752-1688-70151":[{"id":"assertion.claim.frontier.doi-10-1111-1752-1688-70151","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/1752-1688.70151","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/1752-1688.70151 \"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil\" (CC BY 4.0, published 2026-09-07) reports: \"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.\"","support":[{"end":3272,"quote":"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":3134},{"end":12341,"quote":"\"published\":{\"date-parts\":[[2026,9,7]]}","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":12302},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-1752-1688-70151","source_sha256":"e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f","start":406}],"target_id":"claim.frontier.doi-10-1111-1752-1688-70151","target_kind":"node","target_sha256":"7813c951684e4468892f37bc30c7bcde11e8f6c335ae6ff6c22e74ee2ca96f9e"}],"claim.frontier.doi-10-1111-aphw-70185":[{"id":"assertion.claim.frontier.doi-10-1111-aphw-70185","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/aphw.70185","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"","support":[{"end":3045,"quote":"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":2859},{"end":14397,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":14358},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-aphw-70185","source_sha256":"f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b","start":396}],"target_id":"claim.frontier.doi-10-1111-aphw-70185","target_kind":"node","target_sha256":"ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a"}],"claim.frontier.doi-10-1111-beer-70139":[{"id":"assertion.claim.frontier.doi-10-1111-beer-70139","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/beer.70139","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/beer.70139 \"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees\" (CC BY 4.0, published 2026-07-30) reports: \"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.\"","support":[{"end":1541,"quote":"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":1353},{"end":18500,"quote":"\"published\":{\"date-parts\":[[2026,7,30]]}","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":18460},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-beer-70139","source_sha256":"82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339","start":387}],"target_id":"claim.frontier.doi-10-1111-beer-70139","target_kind":"node","target_sha256":"91fb84abd87d634139d456232d28bb71e3a86475bb7f25045429ddad58f58980"}],"claim.frontier.doi-10-1111-bioe-70124":[{"id":"assertion.claim.frontier.doi-10-1111-bioe-70124","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/bioe.70124","quantifiers":"Only what the quoted sentence states","time":"2026-06-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"","support":[{"end":1729,"quote":"By applying three prevailing theoretical\\u2010philosophical frameworks\\u2014the counterfactual, temporal, and non\\u2010comparative accounts of harm\\u2014to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":1404},{"end":9754,"quote":"\"published\":{\"date-parts\":[[2026,6,24]]}","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":9714},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-bioe-70124","source_sha256":"26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8","start":397}],"target_id":"claim.frontier.doi-10-1111-bioe-70124","target_kind":"node","target_sha256":"46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9"}],"claim.frontier.doi-10-1111-ecot-70052":[{"id":"assertion.claim.frontier.doi-10-1111-ecot-70052","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ecot.70052","quantifiers":"Only what the quoted sentence states","time":"2026-10-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ecot.70052 \"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition\" (CC BY 4.0, published 2026-10-15) reports: \"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.\"","support":[{"end":2182,"quote":"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":2002},{"end":11400,"quote":"\"published\":{\"date-parts\":[[2026,10,15]]}","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":11359},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ecot-70052","source_sha256":"284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d","start":387}],"target_id":"claim.frontier.doi-10-1111-ecot-70052","target_kind":"node","target_sha256":"c899742980882616404009a6abec94408aca042dd1f705b2bc1e086745fd64fd"}],"claim.frontier.doi-10-1111-ecpo-70064":[{"id":"assertion.claim.frontier.doi-10-1111-ecpo-70064","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ecpo.70064","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ecpo.70064 \"Chinese Lending and Sovereign Debt Distress in Developing Countries\" (CC BY 4.0, published 2026-07-31) reports: \"Employing a within‐between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.\"","support":[{"end":1621,"quote":"Employing a within\\u2010between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":1432},{"end":23249,"quote":"\"published\":{\"date-parts\":[[2026,7,31]]}","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":23209},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ecpo-70064","source_sha256":"94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79","start":386}],"target_id":"claim.frontier.doi-10-1111-ecpo-70064","target_kind":"node","target_sha256":"5c628e321072d92bdddb037299368d574089a8d7b72ec2196ef5dd56a257863e"}],"claim.frontier.doi-10-1111-eje-70266":[{"id":"assertion.claim.frontier.doi-10-1111-eje-70266","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/eje.70266","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/eje.70266 \"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists\" (CC BY 4.0, published 2026-07-31) reports: \"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.\"","support":[{"end":2716,"quote":"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":2569},{"end":8653,"quote":"\"published\":{\"date-parts\":[[2026,7,31]]}","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":8613},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-eje-70266","source_sha256":"57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779","start":386}],"target_id":"claim.frontier.doi-10-1111-eje-70266","target_kind":"node","target_sha256":"886110cc7d95f58e26c930ac1620956e8bbdb97b1d6e95fd32272d8079037f9e"}],"claim.frontier.doi-10-1111-ejed-70766":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70766","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70766","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"","support":[{"end":2788,"quote":"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":2563},{"end":15816,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":15776},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70766","source_sha256":"bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6","start":409}],"target_id":"claim.frontier.doi-10-1111-ejed-70766","target_kind":"node","target_sha256":"a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76"}],"claim.frontier.doi-10-1111-ejed-70772":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70772","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70772","quantifiers":"Only what the quoted sentence states","time":"2026-07-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70772 \"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential\" (CC BY 4.0, published 2026-07-20) reports: \"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem‐solving.\"","support":[{"end":1323,"quote":"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem\\u2010solving.","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":1156},{"end":11925,"quote":"\"published\":{\"date-parts\":[[2026,7,20]]}","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":11885},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70772","source_sha256":"e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f","start":408}],"target_id":"claim.frontier.doi-10-1111-ejed-70772","target_kind":"node","target_sha256":"d675549ea9aba2caed1ba6424bf137c7eb27b2f03345674048d66a4464686fea"}],"claim.frontier.doi-10-1111-ejed-70845":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70845","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70845","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70845 \"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments\" (CC BY 4.0, published 2026-09-01) reports: \"The findings demonstrated that character strengths were positively associated with all three outcomes.\"","support":[{"end":2688,"quote":"The findings demonstrated that character strengths were positively associated with all three outcomes.","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":2586},{"end":12300,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":12261},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70845","source_sha256":"1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f","start":406}],"target_id":"claim.frontier.doi-10-1111-ejed-70845","target_kind":"node","target_sha256":"0459d52dae6202048453674e7539748a055598fb81529c684a178d4d2db99f99"}],"claim.frontier.doi-10-1111-ejed-70852":[{"id":"assertion.claim.frontier.doi-10-1111-ejed-70852","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejed.70852","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejed.70852 \"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts\" (CC BY 4.0, published 2026-09-01) reports: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","support":[{"end":1749,"quote":"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":1643},{"end":13256,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":13217},{"end":463,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejed-70852","source_sha256":"bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20","start":406}],"target_id":"claim.frontier.doi-10-1111-ejed-70852","target_kind":"node","target_sha256":"b3b4981ebf949347576690949e4efd1d5542f13e78b7c6e4065e519cc15b6b3d"}],"claim.frontier.doi-10-1111-ejss-70414":[{"id":"assertion.claim.frontier.doi-10-1111-ejss-70414","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ejss.70414","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ejss.70414 \"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices\" (CC BY 4.0, published 2026-08-31) reports: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","support":[{"end":4706,"quote":"These findings highlight that intensification, more than the organic\\u2010versus\\u2010conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil\\u2010conservation practices.","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":4335},{"end":18343,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":18303},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ejss-70414","source_sha256":"ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771","start":398}],"target_id":"claim.frontier.doi-10-1111-ejss-70414","target_kind":"node","target_sha256":"8eef2c4640458267cf61bf03f9e388380f4ae6e0dd4347de4b3f94c80ab7de3f"}],"claim.frontier.doi-10-1111-faam-70045":[{"id":"assertion.claim.frontier.doi-10-1111-faam-70045","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/faam.70045","quantifiers":"Only what the quoted sentence states","time":"2026-06-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"","support":[{"end":2317,"quote":"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":2131},{"end":29187,"quote":"\"published\":{\"date-parts\":[[2026,6,20]]}","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":29147},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-faam-70045","source_sha256":"baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162","start":386}],"target_id":"claim.frontier.doi-10-1111-faam-70045","target_kind":"node","target_sha256":"347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b"}],"claim.frontier.doi-10-1111-gwat-70098":[{"id":"assertion.claim.frontier.doi-10-1111-gwat-70098","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/gwat.70098","quantifiers":"Only what the quoted sentence states","time":"2026-08-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/gwat.70098 \"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange\" (CC BY 4.0, published 2026-08-15) reports: \"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream–aquifer exchange and provide a physically based alternative for large‐scale integrated groundwater–surface water modeling.\"","support":[{"end":3449,"quote":"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream\\u2013aquifer exchange and provide a physically based alternative for large\\u2010scale integrated groundwater\\u2013surface water modeling.","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":3204},{"end":16755,"quote":"\"published\":{\"date-parts\":[[2026,8,15]]}","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":16715},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-gwat-70098","source_sha256":"32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152","start":408}],"target_id":"claim.frontier.doi-10-1111-gwat-70098","target_kind":"node","target_sha256":"e2ffb61f8a859e8fd1c96ac98ba01be951bdbd3b4599753effa3c1d768cc8997"}],"claim.frontier.doi-10-1111-ijal-70289":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70289","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70289","quantifiers":"Only what the quoted sentence states","time":"2026-07-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"","support":[{"end":1550,"quote":"The findings reveal a core tension in participant perceptions.","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":1488},{"end":9770,"quote":"\"published\":{\"date-parts\":[[2026,7,3]]}","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":9731},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70289","source_sha256":"fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834","start":395}],"target_id":"claim.frontier.doi-10-1111-ijal-70289","target_kind":"node","target_sha256":"a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8"}],"claim.frontier.doi-10-1111-ijal-70310":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70310","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70310","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70310 \"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice\" (CC BY 4.0, published 2026-07-17) reports: \"The findings indicate that prompting instruction improves communication efficiency, particularly in higher‐complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human–chatbot interaction, alongside a modest, non‐significant advantage in task completion.\"","support":[{"end":1966,"quote":"The findings indicate that prompting instruction improves communication efficiency, particularly in higher\\u2010complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human\\u2013chatbot interaction, alongside a modest, non\\u2010significant advantage in task completion.","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":1644},{"end":8460,"quote":"\"published\":{\"date-parts\":[[2026,7,17]]}","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":8420},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70310","source_sha256":"e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193","start":386}],"target_id":"claim.frontier.doi-10-1111-ijal-70310","target_kind":"node","target_sha256":"4ef02a5db4578cdf194c74cc9a04dfab974b3606687b0380cfac34f80e7617a0"}],"claim.frontier.doi-10-1111-ijal-70337":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70337","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70337","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70337 \"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts\" (CC BY 4.0, published 2026-08-05) reports: \"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.\"","support":[{"end":1978,"quote":"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":1512},{"end":9942,"quote":"\"published\":{\"date-parts\":[[2026,8,5]]}","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":9903},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70337","source_sha256":"1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668","start":394}],"target_id":"claim.frontier.doi-10-1111-ijal-70337","target_kind":"node","target_sha256":"b9767987c6cf8eb732a1e22870bbd60b688b5ea2d37c1c2d4aaeb6a4e403ae27"}],"claim.frontier.doi-10-1111-ijal-70342":[{"id":"assertion.claim.frontier.doi-10-1111-ijal-70342","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ijal.70342","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ijal.70342 \"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses\" (CC BY 4.0, published 2026-08-21) reports: \"Analyses supported a process‐consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.\"","support":[{"end":2439,"quote":"Analyses supported a process\\u2010consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":2254},{"end":10461,"quote":"\"published\":{\"date-parts\":[[2026,8,21]]}","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":10421},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ijal-70342","source_sha256":"c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987","start":395}],"target_id":"claim.frontier.doi-10-1111-ijal-70342","target_kind":"node","target_sha256":"5283976eb7325f6d975165df6ee495c112422ee0887368d701ca64f3c5add006"}],"claim.frontier.doi-10-1111-jade-70048":[{"id":"assertion.claim.frontier.doi-10-1111-jade-70048","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jade.70048","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jade.70048 \"A Visual Brainstorming Technique in Character Design: Braindrawing\" (CC BY 4.0, published 2026-09-05) reports: \"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.\"","support":[{"end":1715,"quote":"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":1550},{"end":8021,"quote":"\"published\":{\"date-parts\":[[2026,9,5]]}","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":7982},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jade-70048","source_sha256":"06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59","start":394}],"target_id":"claim.frontier.doi-10-1111-jade-70048","target_kind":"node","target_sha256":"709b81bab1516c34a8944c0aceacb59f4abf8b6aba2d6b5e258558ffa0709287"}],"claim.frontier.doi-10-1111-jmg-70045":[{"id":"assertion.claim.frontier.doi-10-1111-jmg-70045","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jmg.70045","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"","support":[{"end":2742,"quote":"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":2517},{"end":24441,"quote":"\"published\":{\"date-parts\":[[2026,7,7]]}","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":24402},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jmg-70045","source_sha256":"fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a","start":397}],"target_id":"claim.frontier.doi-10-1111-jmg-70045","target_kind":"node","target_sha256":"0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658"}],"claim.frontier.doi-10-1111-jmg-70054":[{"id":"assertion.claim.frontier.doi-10-1111-jmg-70054","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jmg.70054","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jmg.70054 \"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression\" (CC BY 4.0, published 2026-08-18) reports: \"We demonstrate that machine learning can decipher complex multi‐elemental relationships in zircon REE data and can be used to classify zircon.\"","support":[{"end":3172,"quote":"We demonstrate that machine learning can decipher complex multi\\u2010elemental relationships in zircon REE data and can be used to classify zircon.","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":3025},{"end":12437,"quote":"\"published\":{\"date-parts\":[[2026,8,18]]}","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":12397},{"end":443,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jmg-70054","source_sha256":"0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508","start":386}],"target_id":"claim.frontier.doi-10-1111-jmg-70054","target_kind":"node","target_sha256":"ab0ca5c7d8215f36b3f96d07add1bff628181ad03380f3da260c5990532d5b1a"}],"claim.frontier.doi-10-1111-jssr-70066":[{"id":"assertion.claim.frontier.doi-10-1111-jssr-70066","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/jssr.70066","quantifiers":"Only what the quoted sentence states","time":"2026-05-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"","support":[{"end":1579,"quote":"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":1384},{"end":9167,"quote":"\"published\":{\"date-parts\":[[2026,5,30]]}","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":9127},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-jssr-70066","source_sha256":"4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5","start":408}],"target_id":"claim.frontier.doi-10-1111-jssr-70066","target_kind":"node","target_sha256":"fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f"}],"claim.frontier.doi-10-1111-lcrp-70059":[{"id":"assertion.claim.frontier.doi-10-1111-lcrp-70059","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/lcrp.70059","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/lcrp.70059 \"Prison victimization and post‐release outcomes: A systematic review\" (CC BY 4.0, published 2026-09-04) reports: \"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.\"","support":[{"end":3052,"quote":"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":2904},{"end":13862,"quote":"\"published\":{\"date-parts\":[[2026,9,4]]}","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":13823},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-lcrp-70059","source_sha256":"bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3","start":394}],"target_id":"claim.frontier.doi-10-1111-lcrp-70059","target_kind":"node","target_sha256":"8a2d4bb62d0d43292879ca744d344b526c57050d5ea1c9fe4fade2b00167deda"}],"claim.frontier.doi-10-1111-medu-70340":[{"id":"assertion.claim.frontier.doi-10-1111-medu-70340","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/medu.70340","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/medu.70340 \"Health equity is the goal of medical education: Implications for assessment validity\" (CC BY 4.0, published 2026-10-14) reports: \"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.\"","support":[{"end":2691,"quote":"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":2464},{"end":13791,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":13750},{"end":444,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-medu-70340","source_sha256":"1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda","start":387}],"target_id":"claim.frontier.doi-10-1111-medu-70340","target_kind":"node","target_sha256":"bb1ad60f76ca539f0eaddce73315fda163fc3cbd2a166cf3283d6f6ea6f0ff96"}],"claim.frontier.doi-10-1111-moth-70134":[{"id":"assertion.claim.frontier.doi-10-1111-moth-70134","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/moth.70134","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/moth.70134 \"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano\" (CC BY 4.0, published 2026-08-17) reports: \"This vision is shown to be ‘conjured’ up from what is identified as a distinctive, Black Atlantic way of reading Scripture.\"","support":[{"end":1820,"quote":"This vision is shown to be \\u2018conjured\\u2019 up from what is identified as a distinctive, Black Atlantic way of reading Scripture.","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":1687},{"end":4310,"quote":"\"published\":{\"date-parts\":[[2026,8,17]]}","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":4270},{"end":452,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-moth-70134","source_sha256":"d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe","start":395}],"target_id":"claim.frontier.doi-10-1111-moth-70134","target_kind":"node","target_sha256":"e00e11ab51837f0489465957e0e78c86c32bfb903c7034ba5b478ce4610c693b"}],"claim.frontier.doi-10-1111-moth-70148":[{"id":"assertion.claim.frontier.doi-10-1111-moth-70148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/moth.70148","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/moth.70148 \"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion\" (CC BY 4.0, published 2026-09-24) reports: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","support":[{"end":1202,"quote":"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":1089},{"end":3891,"quote":"\"published\":{\"date-parts\":[[2026,9,24]]}","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":3851},{"end":441,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-moth-70148","source_sha256":"7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2","start":384}],"target_id":"claim.frontier.doi-10-1111-moth-70148","target_kind":"node","target_sha256":"59a080cf2527877e5c33e0b5a87ee37803dbac66af884c55be3b875773bb2066"}],"claim.frontier.doi-10-1111-nup-70114":[{"id":"assertion.claim.frontier.doi-10-1111-nup-70114","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/nup.70114","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/nup.70114 \"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care\" (CC BY 4.0, published 2026-08-31) reports: \"The findings suggest that the morning bed‐bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.\"","support":[{"end":2680,"quote":"The findings suggest that the morning bed\\u2010bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":2391},{"end":13851,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":13811},{"end":465,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-nup-70114","source_sha256":"dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74","start":408}],"target_id":"claim.frontier.doi-10-1111-nup-70114","target_kind":"node","target_sha256":"39e7e583ad91c899535afc9090d9e424881b8963e31f8aa53980c2f4542a5382"}],"claim.frontier.doi-10-1111-ojoa-70020":[{"id":"assertion.claim.frontier.doi-10-1111-ojoa-70020","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ojoa.70020","quantifiers":"Only what the quoted sentence states","time":"2026-05-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"","support":[{"end":1298,"quote":"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":1173},{"end":12542,"quote":"\"published\":{\"date-parts\":[[2026,5,6]]}","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":12503},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ojoa-70020","source_sha256":"add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f","start":396}],"target_id":"claim.frontier.doi-10-1111-ojoa-70020","target_kind":"node","target_sha256":"a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec"}],"claim.frontier.doi-10-1111-ojoa-70022":[{"id":"assertion.claim.frontier.doi-10-1111-ojoa-70022","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ojoa.70022","quantifiers":"Only what the quoted sentence states","time":"2026-06-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"","support":[{"end":1812,"quote":"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":1589},{"end":18425,"quote":"\"published\":{\"date-parts\":[[2026,6,3]]}","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":18386},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ojoa-70022","source_sha256":"62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb","start":396}],"target_id":"claim.frontier.doi-10-1111-ojoa-70022","target_kind":"node","target_sha256":"4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9"}],"claim.frontier.doi-10-1111-phpr-70116":[{"id":"assertion.claim.frontier.doi-10-1111-phpr-70116","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/phpr.70116","quantifiers":"Only what the quoted sentence states","time":"2026-05-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"","support":[{"end":1669,"quote":"This analysis shows how multiple functions come to be layered up through different grammatical forms.","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":1568},{"end":9549,"quote":"\"published\":{\"date-parts\":[[2026,5,3]]}","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":9510},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-phpr-70116","source_sha256":"aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a","start":396}],"target_id":"claim.frontier.doi-10-1111-phpr-70116","target_kind":"node","target_sha256":"1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442"}],"claim.frontier.doi-10-1111-ruso-70070":[{"id":"assertion.claim.frontier.doi-10-1111-ruso-70070","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/ruso.70070","quantifiers":"Only what the quoted sentence states","time":"2026-09-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/ruso.70070 \"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities\" (CC BY 4.0, published 2026-09-26) reports: \"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural–urban communities and whether gaps with big‐city metros are intensifying.\"","support":[{"end":2657,"quote":"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural\\u2013urban communities and whether gaps with big\\u2010city metros are intensifying.","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":2447},{"end":14589,"quote":"\"published\":{\"date-parts\":[[2026,9,26]]}","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":14549},{"end":454,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-ruso-70070","source_sha256":"73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47","start":397}],"target_id":"claim.frontier.doi-10-1111-ruso-70070","target_kind":"node","target_sha256":"746a1fc813452f4bc12e782e380e8cb1e83267ca7592751d3276202a85c343dd"}],"claim.frontier.doi-10-1111-saje-70032":[{"id":"assertion.claim.frontier.doi-10-1111-saje-70032","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1111/saje.70032","quantifiers":"Only what the quoted sentence states","time":"2026-07-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1111/saje.70032 \"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?\" (CC BY 4.0, published 2026-07-26) reports: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","support":[{"end":1237,"quote":"We find that digitalisation has a nonlinear effect on corruption and on human development.","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":1147},{"end":12881,"quote":"\"published\":{\"date-parts\":[[2026,7,26]]}","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":12841},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1111-saje-70032","source_sha256":"2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2","start":398}],"target_id":"claim.frontier.doi-10-1111-saje-70032","target_kind":"node","target_sha256":"14cd64b8681589ba4d64ef37712305269d9789c187279de679c9903d596ed6ba"}],"claim.frontier.doi-10-1144-jgs2026-026":[{"id":"assertion.claim.frontier.doi-10-1144-jgs2026-026","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1144/jgs2026-026","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1144/jgs2026-026 \"Origin of river terraces by isostatic unloading of the lithosphere\" (CC BY 4.0, published 2026-07-15) reports: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","support":[{"end":1466,"quote":"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":1141},{"end":16130,"quote":"\"published\":{\"date-parts\":[[2026,7,15]]}","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":16090},{"end":479,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1144-jgs2026-026","source_sha256":"fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f","start":422}],"target_id":"claim.frontier.doi-10-1144-jgs2026-026","target_kind":"node","target_sha256":"1eec10139d7c5d26a48547b08664aa1d560353ae3c24910f217caf8287ef4f06"}],"claim.frontier.doi-10-1144-jgs2026-039":[{"id":"assertion.claim.frontier.doi-10-1144-jgs2026-039","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1144/jgs2026-039","quantifiers":"Only what the quoted sentence states","time":"2026-06-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","support":[{"end":2167,"quote":"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":2040},{"end":53164,"quote":"\"published\":{\"date-parts\":[[2026,6,22]]}","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":53124},{"end":488,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1144-jgs2026-039","source_sha256":"8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75","start":431}],"target_id":"claim.frontier.doi-10-1144-jgs2026-039","target_kind":"node","target_sha256":"a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714"}],"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974":[{"id":"assertion.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.11591/ijeecs.v43.i3.pp965-974","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.11591/ijeecs.v43.i3.pp965-974 \"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning\" (CC BY 4.0, published 2026-09-01) reports: \"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines—by 5.7% and 8.9%, respectively—while maintaining complete data privacy.\"","support":[{"end":2140,"quote":"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines\\u2014by 5.7% and 8.9%, respectively\\u2014while maintaining complete data privacy.","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":1929},{"end":4161,"quote":"\"published\":{\"date-parts\":[[2026,9,1]]}","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":4122},{"end":511,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","source_sha256":"51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a","start":454}],"target_id":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","target_kind":"node","target_sha256":"167968c5487a3a2d63809c9215eca013a58046b5c50a978e376a64e79cddbc11"}],"claim.frontier.doi-10-12944-cwe-21-2-3":[{"id":"assertion.claim.frontier.doi-10-12944-cwe-21-2-3","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.12944/cwe.21.2.3","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.12944/cwe.21.2.3 \"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss\" (CC BY 4.0, published 2026-09-10) reports: \"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.\"","support":[{"end":1886,"quote":"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":1709},{"end":16717,"quote":"\"published\":{\"date-parts\":[[2026,9,10]]}","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":16677},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-12944-cwe-21-2-3","source_sha256":"502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49","start":427}],"target_id":"claim.frontier.doi-10-12944-cwe-21-2-3","target_kind":"node","target_sha256":"946573dec97981d8f200d79bdffcda3a25c83c8d70b786bfa1e6081090c36178"}],"claim.frontier.doi-10-1371-journal-pclm-0000696":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000696","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000696","quantifiers":"Only what the quoted sentence states","time":"2026-07-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"","support":[{"end":2007,"quote":"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":1779},{"end":20031,"quote":"\"published\":{\"date-parts\":[[2026,7,9]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":19992},{"end":480,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000696","source_sha256":"1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c","start":423}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000696","target_kind":"node","target_sha256":"b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a"}],"claim.frontier.doi-10-1371-journal-pclm-0000877":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000877","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000877","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000877 \"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study\" (CC BY 4.0, published 2026-08-18) reports: \"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.\"","support":[{"end":3039,"quote":"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":2889},{"end":15200,"quote":"\"published\":{\"date-parts\":[[2026,8,18]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":15160},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000877","source_sha256":"a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000877","target_kind":"node","target_sha256":"26e943260c3bb22a338102bf11c4c229e76b1d019299973bff0eda218edaaa59"}],"claim.frontier.doi-10-1371-journal-pclm-0000886":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000886","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000886","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000886 \"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana\" (CC BY 4.0, published 2026-10-12) reports: \"The findings show that farmers’ education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.\"","support":[{"end":1420,"quote":"The findings show that farmers\\u2019 education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":1237},{"end":22428,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":22387},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000886","source_sha256":"bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000886","target_kind":"node","target_sha256":"c9838c9666550a04a54d9f52056b1f085e9469af4b418c7c39cfdcf3e95f80c2"}],"claim.frontier.doi-10-1371-journal-pclm-0000930":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000930","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000930","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000930 \"Countering climate misinformation with large language models: Evidence from ChatGPT\" (CC BY 4.0, published 2026-09-02) reports: \"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.\"","support":[{"end":1974,"quote":"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":1764},{"end":20080,"quote":"\"published\":{\"date-parts\":[[2026,9,2]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":20041},{"end":490,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000930","source_sha256":"ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881","start":433}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000930","target_kind":"node","target_sha256":"4391670001d55393deb190b39b125c10a5d03a4c148885c1713016e1de39eed9"}],"claim.frontier.doi-10-1371-journal-pclm-0000931":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000931","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000931","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000931 \"Mapping climate-related forest risks: An index-based approach\" (CC BY 4.0, published 2026-08-12) reports: \"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.\"","support":[{"end":2625,"quote":"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":2394},{"end":26980,"quote":"\"published\":{\"date-parts\":[[2026,8,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":26940},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000931","source_sha256":"876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000931","target_kind":"node","target_sha256":"f074240df47721dc6bfbdc383c4ece688c9bd5dbf3a76847bc4e637d043b6408"}],"claim.frontier.doi-10-1371-journal-pclm-0000986":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0000986","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0000986","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0000986 \"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins\" (CC BY 4.0, published 2026-09-08) reports: \"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.\"","support":[{"end":3138,"quote":"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":2826},{"end":17908,"quote":"\"published\":{\"date-parts\":[[2026,9,8]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":17869},{"end":490,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0000986","source_sha256":"f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32","start":433}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0000986","target_kind":"node","target_sha256":"05cae79791020ebe011272a629f57fadd9175883f2f54963e1851e140c2fde7e"}],"claim.frontier.doi-10-1371-journal-pclm-0001005":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001005","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001005 \"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria\" (CC BY 4.0, published 2026-09-24) reports: \"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.\"","support":[{"end":1996,"quote":"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":1881},{"end":21607,"quote":"\"published\":{\"date-parts\":[[2026,9,24]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":21567},{"end":481,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001005","source_sha256":"893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb","start":424}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001005","target_kind":"node","target_sha256":"22c95cb1e3ffd0ece2d730ec4a4bfd8b35f8d1250ef94abce79123983e19f32b"}],"claim.frontier.doi-10-1371-journal-pclm-0001039":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001039","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001039","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001039 \"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour\" (CC BY 4.0, published 2026-08-31) reports: \"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.\"","support":[{"end":2515,"quote":"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":2158},{"end":33762,"quote":"\"published\":{\"date-parts\":[[2026,8,31]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":33722},{"end":492,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001039","source_sha256":"621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6","start":435}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001039","target_kind":"node","target_sha256":"1797f28da9e635c78885a5292ba375fd9b05fa57bec163eeb7ad582da96e5b7f"}],"claim.frontier.doi-10-1371-journal-pclm-0001044":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pclm-0001044","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pclm.0001044","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pclm.0001044 \"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)\" (CC BY 4.0, published 2026-10-12) reports: \"We found a decadal warming trend of 0.29°C at both locations.\"","support":[{"end":2536,"quote":"We found a decadal warming trend of 0.29\\u00b0C at both locations.","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":2470},{"end":25758,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":25717},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pclm-0001044","source_sha256":"29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pclm-0001044","target_kind":"node","target_sha256":"f020444798aafbba9657c13abf36e5e7c1c64342c3f6d77e5c0abff16072a051"}],"claim.frontier.doi-10-1371-journal-pwat-0000557":[{"id":"assertion.claim.frontier.doi-10-1371-journal-pwat-0000557","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.1371/journal.pwat.0000557","quantifiers":"Only what the quoted sentence states","time":"2026-10-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.1371/journal.pwat.0000557 \"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon\" (CC BY 4.0, published 2026-10-14) reports: \"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.\"","support":[{"end":2410,"quote":"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":2276},{"end":16153,"quote":"\"published\":{\"date-parts\":[[2026,10,14]]}","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":16112},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-1371-journal-pwat-0000557","source_sha256":"f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3","start":427}],"target_id":"claim.frontier.doi-10-1371-journal-pwat-0000557","target_kind":"node","target_sha256":"acfd84fb6f4873de8802a73f2217016c75d4c458af05a657ce165e0cbc4a3e69"}],"claim.frontier.doi-10-15351-2373-8456-1216":[{"id":"assertion.claim.frontier.doi-10-15351-2373-8456-1216","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.15351/2373-8456.1216","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.15351/2373-8456.1216 \"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review\" (CC BY 4.0, published 2026-10-13) reports: \"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.\"","support":[{"end":1759,"quote":"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":1646},{"end":4056,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":4015},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-15351-2373-8456-1216","source_sha256":"ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0","start":420}],"target_id":"claim.frontier.doi-10-15351-2373-8456-1216","target_kind":"node","target_sha256":"40afce297647ad12205133127c3319b158fd1df3ee3886e812a0ea0efe63d9fa"}],"claim.frontier.doi-10-15351-2373-8456-1235":[{"id":"assertion.claim.frontier.doi-10-15351-2373-8456-1235","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.15351/2373-8456.1235","quantifiers":"Only what the quoted sentence states","time":"2026-10-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.15351/2373-8456.1235 \"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh\" (CC BY 4.0, published 2026-10-13) reports: \"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh’s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.\"","support":[{"end":2246,"quote":"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh\\u2019s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":2002},{"end":3545,"quote":"\"published\":{\"date-parts\":[[2026,10,13]]}","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":3504},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-15351-2373-8456-1235","source_sha256":"5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87","start":420}],"target_id":"claim.frontier.doi-10-15351-2373-8456-1235","target_kind":"node","target_sha256":"8a4aee6e2d44b62fa0465aa821d46866d28889942e6aed85c22555321eacd664"}],"claim.frontier.doi-10-21425-fob-19-142560":[{"id":"assertion.claim.frontier.doi-10-21425-fob-19-142560","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.21425/fob.19.142560","quantifiers":"Only what the quoted sentence states","time":"2026-10-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.21425/fob.19.142560 \"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas\" (CC BY 4.0, published 2026-10-12) reports: \"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.\"","support":[{"end":1716,"quote":"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":1472},{"end":28606,"quote":"\"published\":{\"date-parts\":[[2026,10,12]]}","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":28565},{"end":458,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-21425-fob-19-142560","source_sha256":"29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260","start":401}],"target_id":"claim.frontier.doi-10-21425-fob-19-142560","target_kind":"node","target_sha256":"cf17d8f389e5875801d8f5cf2ce79502a98179aa447f0df28b5ed7b1e5ebf093"}],"claim.frontier.doi-10-2166-hydro-2026-040":[{"id":"assertion.claim.frontier.doi-10-2166-hydro-2026-040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/hydro.2026.040","quantifiers":"Only what the quoted sentence states","time":"2026-10-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/hydro.2026.040 \"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change\" (CC BY 4.0, published 2026-10-10) reports: \"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.\"","support":[{"end":2520,"quote":"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":2244},{"end":24596,"quote":"\"published\":{\"date-parts\":[[2026,10,10]]}","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":24555},{"end":453,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-hydro-2026-040","source_sha256":"dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a","start":396}],"target_id":"claim.frontier.doi-10-2166-hydro-2026-040","target_kind":"node","target_sha256":"b1d5eb93f830b9db9de13c37903d40a49fd2241fcc77b157811712804ad5c3ac"}],"claim.frontier.doi-10-2166-hydro-2026-191":[{"id":"assertion.claim.frontier.doi-10-2166-hydro-2026-191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/hydro.2026.191","quantifiers":"Only what the quoted sentence states","time":"2026-05-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"","support":[{"end":2504,"quote":"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":2414},{"end":30729,"quote":"\"published\":{\"date-parts\":[[2026,5,23]]}","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":30689},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-hydro-2026-191","source_sha256":"154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6","start":407}],"target_id":"claim.frontier.doi-10-2166-hydro-2026-191","target_kind":"node","target_sha256":"3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6"}],"claim.frontier.doi-10-2166-wcc-2026-006":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-006","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.006","quantifiers":"Only what the quoted sentence states","time":"2026-06-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"","support":[{"end":2035,"quote":"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":1836},{"end":29361,"quote":"\"published\":{\"date-parts\":[[2026,6,27]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":29321},{"end":462,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-006","source_sha256":"ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54","start":405}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-006","target_kind":"node","target_sha256":"8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9"}],"claim.frontier.doi-10-2166-wcc-2026-359":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-359","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.359","quantifiers":"Only what the quoted sentence states","time":"2026-07-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"","support":[{"end":3446,"quote":"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":3256},{"end":34196,"quote":"\"published\":{\"date-parts\":[[2026,7,1]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":34157},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-359","source_sha256":"030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467","start":407}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-359","target_kind":"node","target_sha256":"22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe"}],"claim.frontier.doi-10-2166-wcc-2026-507":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.507","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.507 \"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices\" (CC BY 4.0, published 2026-10-01) reports: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","support":[{"end":1686,"quote":"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 \\u00b0C and an increase of 1.6 \\u00b0C over the study period (Sen\\u2019s slope: +0.036 \\u00b0C\\/year).","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":1476},{"end":18467,"quote":"\"published\":{\"date-parts\":[[2026,10,1]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":18427},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-507","source_sha256":"501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2","start":394}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-507","target_kind":"node","target_sha256":"150fad11eb2e58a265d6665b1f952ef191f154aa3847e5e54c38454da52997cc"}],"claim.frontier.doi-10-2166-wcc-2026-580":[{"id":"assertion.claim.frontier.doi-10-2166-wcc-2026-580","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wcc.2026.580","quantifiers":"Only what the quoted sentence states","time":"2026-10-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wcc.2026.580 \"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa\" (CC BY 4.0, published 2026-10-02) reports: \"El Niño seasons were associated with significantly greater concurrent stress (p&lt; 0.001).\"","support":[{"end":2135,"quote":"El Ni\\u00f1o seasons were associated with significantly greater concurrent stress (p&amp;lt; 0.001).","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":2035},{"end":22098,"quote":"\"published\":{\"date-parts\":[[2026,10,2]]}","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":22058},{"end":451,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wcc-2026-580","source_sha256":"c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c","start":394}],"target_id":"claim.frontier.doi-10-2166-wcc-2026-580","target_kind":"node","target_sha256":"a2f38d5d973db76df05f11e9a92569f1f8c2a4aa4275eab073df4cfc645305b6"}],"claim.frontier.doi-10-2166-wp-2026-018":[{"id":"assertion.claim.frontier.doi-10-2166-wp-2026-018","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wp.2026.018","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wp.2026.018 \"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions\" (CC BY 4.0, published 2026-08-14) reports: \"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.\"","support":[{"end":4692,"quote":"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":4456},{"end":16492,"quote":"\"published\":{\"date-parts\":[[2026,8,14]]}","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":16452},{"end":464,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wp-2026-018","source_sha256":"f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2","start":407}],"target_id":"claim.frontier.doi-10-2166-wp-2026-018","target_kind":"node","target_sha256":"616e659f6173f6f9e1ee396a74524d5cda67304b01ed57a91f6c2cdf8cbfc3fa"}],"claim.frontier.doi-10-2166-wpt-2026-383":[{"id":"assertion.claim.frontier.doi-10-2166-wpt-2026-383","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.2166/wpt.2026.383","quantifiers":"Only what the quoted sentence states","time":"2026-07-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"","support":[{"end":1738,"quote":"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":1632},{"end":22204,"quote":"\"published\":{\"date-parts\":[[2026,7,1]]}","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":22165},{"end":474,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-2166-wpt-2026-383","source_sha256":"93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54","start":417}],"target_id":"claim.frontier.doi-10-2166-wpt-2026-383","target_kind":"node","target_sha256":"704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614"}],"claim.frontier.doi-10-22378-he-2026-11-2-218-234":[{"id":"assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.22378/he.2026-11-2.218-234","quantifiers":"Only what the quoted sentence states","time":"2026-06-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"","support":[{"end":1761,"quote":"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":1613},{"end":15020,"quote":"\"published\":{\"date-parts\":[[2026,6,8]]}","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":14981},{"end":485,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","source_sha256":"adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06","start":428}],"target_id":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","target_kind":"node","target_sha256":"6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6"}],"claim.frontier.doi-10-28918-jei-v11i1-2601":[{"id":"assertion.claim.frontier.doi-10-28918-jei-v11i1-2601","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.28918/jei.v11i1.2601","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"","support":[{"end":1945,"quote":"The findings reveal that integrating digital platforms into pesantren education significantly enhances students\\u2019 technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":1711},{"end":5846,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":5806},{"end":487,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-28918-jei-v11i1-2601","source_sha256":"a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e","start":430}],"target_id":"claim.frontier.doi-10-28918-jei-v11i1-2601","target_kind":"node","target_sha256":"4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00"}],"claim.frontier.doi-10-28918-jei-v11i1-2606":[{"id":"assertion.claim.frontier.doi-10-28918-jei-v11i1-2606","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.28918/jei.v11i1.2606","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"","support":[{"end":1642,"quote":"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassu\\u1e6d, taw\\u0101zun, tas\\u0101mu\\u1e25, and i'tid\\u0101l.","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":1389},{"end":4410,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":4370},{"end":487,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-28918-jei-v11i1-2606","source_sha256":"479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8","start":430}],"target_id":"claim.frontier.doi-10-28918-jei-v11i1-2606","target_kind":"node","target_sha256":"892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d"}],"claim.frontier.doi-10-3176-arch-2026-2-03":[{"id":"assertion.claim.frontier.doi-10-3176-arch-2026-2-03","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3176/arch.2026.2.03","quantifiers":"Only what the quoted sentence states","time":"2026-10-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3176/arch.2026.2.03 \"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)\" (CC BY 4.0, published 2026-10-05) reports: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","support":[{"end":1483,"quote":"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep\\/goats forming the basis of animal husbandry.","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":1323},{"end":37137,"quote":"\"published\":{\"date-parts\":[[2026,10,5]]}","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":37097},{"end":485,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3176-arch-2026-2-03","source_sha256":"cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95","start":428}],"target_id":"claim.frontier.doi-10-3176-arch-2026-2-03","target_kind":"node","target_sha256":"2495efad9f9a77db5bf334eea5bd7e3697fddf6aee3e0bae571c91368a1a9e7c"}],"claim.frontier.doi-10-38159-ehass-20267724":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-20267724","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.20267724","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.20267724 \"Leveraging community partnership: The case of Meraka Cultural Village\" (CC BY 4.0, published 2026-09-23) reports: \"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.\"","support":[{"end":1675,"quote":"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":1423},{"end":32749,"quote":"\"published\":{\"date-parts\":[[2026,9,23]]}","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":32709},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-20267724","source_sha256":"33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820","start":416}],"target_id":"claim.frontier.doi-10-38159-ehass-20267724","target_kind":"node","target_sha256":"413fb72410ec625ca9ca098fe999385c3c9624ba042c7845822e788da8fcb41d"}],"claim.frontier.doi-10-38159-ehass-2026774":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026774","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026774","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026774 \"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities\" (CC BY 4.0, published 2026-08-10) reports: \"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.\"","support":[{"end":1841,"quote":"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":1732},{"end":12938,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":12898},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026774","source_sha256":"7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6","start":427}],"target_id":"claim.frontier.doi-10-38159-ehass-2026774","target_kind":"node","target_sha256":"d6f10658405d185f8e1681f66c1e1593e6be20e81f983de94605620f57a82977"}],"claim.frontier.doi-10-38159-ehass-2026775":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026775","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026775","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026775 \"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis\" (CC BY 4.0, published 2026-08-10) reports: \"The findings reveal that parodic proverbs perform multiple social and communicative functions.\"","support":[{"end":1398,"quote":"The findings reveal that parodic proverbs perform multiple social and communicative functions.","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":1304},{"end":8404,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":8364},{"end":484,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026775","source_sha256":"f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b","start":427}],"target_id":"claim.frontier.doi-10-38159-ehass-2026775","target_kind":"node","target_sha256":"77d8fd44d1d49ddc371b70a5e78fd7f56fd6e50f44b0074910bab18bc99cf9eb"}],"claim.frontier.doi-10-38159-ehass-2026785":[{"id":"assertion.claim.frontier.doi-10-38159-ehass-2026785","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/ehass.2026785","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/ehass.2026785 \"Does the listener care? Emotional resonance and connection in the age of algorithmic music\" (CC BY 4.0, published 2026-09-30) reports: \"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.\"","support":[{"end":2126,"quote":"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":1948},{"end":14182,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":14142},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-ehass-2026785","source_sha256":"72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a","start":416}],"target_id":"claim.frontier.doi-10-38159-ehass-2026785","target_kind":"node","target_sha256":"aeb97dadafba774c077aa5a3d076f944d7fed8e7a8641eb17d04508753123883"}],"claim.frontier.doi-10-38159-erats-20261281":[{"id":"assertion.claim.frontier.doi-10-38159-erats-20261281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/erats.20261281","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/erats.20261281 \"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism\" (CC BY 4.0, published 2026-09-28) reports: \"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.\"","support":[{"end":1087,"quote":"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":974},{"end":16315,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":16275},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-erats-20261281","source_sha256":"d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a","start":416}],"target_id":"claim.frontier.doi-10-38159-erats-20261281","target_kind":"node","target_sha256":"a073a252ea3c9d4507d0d7f9530801416fe69b7dab0e22f6dafc4730cd13a867"}],"claim.frontier.doi-10-38159-erats-20261284":[{"id":"assertion.claim.frontier.doi-10-38159-erats-20261284","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.38159/erats.20261284","quantifiers":"Only what the quoted sentence states","time":"2026-09-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.38159/erats.20261284 \"The irony of law and faith in corruption\" (CC BY 4.0, published 2026-09-26) reports: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","support":[{"end":1118,"quote":"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":964},{"end":10815,"quote":"\"published\":{\"date-parts\":[[2026,9,26]]}","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":10775},{"end":473,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-38159-erats-20261284","source_sha256":"fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6","start":416}],"target_id":"claim.frontier.doi-10-38159-erats-20261284","target_kind":"node","target_sha256":"15126bb3d4b80e72fb46ff22060bdca616c4bc847566be7945e5ab1c88619af3"}],"claim.frontier.doi-10-3897-brics-econ-7-e162074":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e162074","quantifiers":"Only what the quoted sentence states","time":"2026-07-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","support":[{"end":1322,"quote":"The results reveal a stable long-term equilibrium between investment in human development and economic growth.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":1212},{"end":9193,"quote":"\"published\":{\"date-parts\":[[2026,7,3]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":9154},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e162074","source_sha256":"bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c","start":409}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e162074","target_kind":"node","target_sha256":"b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb"}],"claim.frontier.doi-10-3897-brics-econ-7-e172739":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e172739","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"","support":[{"end":1101,"quote":"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":904},{"end":10446,"quote":"\"published\":{\"date-parts\":[[2026,7,7]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":10407},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e172739","source_sha256":"71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1","start":410}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e172739","target_kind":"node","target_sha256":"6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263"}],"claim.frontier.doi-10-3897-brics-econ-7-e183393":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e183393","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e183393","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e183393 \"Stock market reaction to fraud outbreaks in the Indian banking sector\" (CC BY 4.0, published 2026-09-30) reports: \"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.\"","support":[{"end":1625,"quote":"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":1492},{"end":6907,"quote":"\"published\":{\"date-parts\":[[2026,9,30]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":6867},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e183393","source_sha256":"f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029","start":410}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e183393","target_kind":"node","target_sha256":"458f34a98afbe1278fb0922f2f52872afd9354a4432e893b2bfd2c2c18a63cc1"}],"claim.frontier.doi-10-3897-brics-econ-7-e185197":[{"id":"assertion.claim.frontier.doi-10-3897-brics-econ-7-e185197","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/brics-econ.7.e185197","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/brics-econ.7.e185197 \"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia\" (CC BY 4.0, published 2026-09-03) reports: \"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.\"","support":[{"end":4231,"quote":"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":4069},{"end":22438,"quote":"\"published\":{\"date-parts\":[[2026,9,3]]}","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":22399},{"end":477,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-brics-econ-7-e185197","source_sha256":"90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453","start":420}],"target_id":"claim.frontier.doi-10-3897-brics-econ-7-e185197","target_kind":"node","target_sha256":"97eab97ad1625a070380fca8217d3192b4737f1f7eb018a5e4a780691e00db9f"}],"claim.frontier.doi-10-3897-jbgs-e185535":[{"id":"assertion.claim.frontier.doi-10-3897-jbgs-e185535","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/jbgs.e185535","quantifiers":"Only what the quoted sentence states","time":"2026-05-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"","support":[{"end":1399,"quote":"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":1297},{"end":4325,"quote":"\"published\":{\"date-parts\":[[2026,5,29]]}","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":4285},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-jbgs-e185535","source_sha256":"13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8","start":398}],"target_id":"claim.frontier.doi-10-3897-jbgs-e185535","target_kind":"node","target_sha256":"84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f"}],"claim.frontier.doi-10-3897-nhcm-3-184711":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-184711","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.184711","quantifiers":"Only what the quoted sentence states","time":"2026-05-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"","support":[{"end":1837,"quote":"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":1658},{"end":41775,"quote":"\"published\":{\"date-parts\":[[2026,5,28]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":41735},{"end":457,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-184711","source_sha256":"344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a","start":400}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-184711","target_kind":"node","target_sha256":"94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2"}],"claim.frontier.doi-10-3897-nhcm-3-187529":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-187529","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.187529","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.187529 \"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish\" (CC BY 4.0, published 2026-08-10) reports: \"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.\"","support":[{"end":1912,"quote":"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":1738},{"end":11126,"quote":"\"published\":{\"date-parts\":[[2026,8,10]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":11086},{"end":466,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-187529","source_sha256":"badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c","start":409}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-187529","target_kind":"node","target_sha256":"f995881565f05db0b212c013e45536465d5c82362c442a2a37f9b5c553d65459"}],"claim.frontier.doi-10-3897-nhcm-3-200681":[{"id":"assertion.claim.frontier.doi-10-3897-nhcm-3-200681","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/nhcm.3.200681","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/nhcm.3.200681 \"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study\" (CC BY 4.0, published 2026-09-25) reports: \": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.\"","support":[{"end":2758,"quote":": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":2548},{"end":7756,"quote":"\"published\":{\"date-parts\":[[2026,9,25]]}","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":7716},{"end":455,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-nhcm-3-200681","source_sha256":"53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566","start":398}],"target_id":"claim.frontier.doi-10-3897-nhcm-3-200681","target_kind":"node","target_sha256":"a4c954c03c3dc0424d87d0f8b842eff9fc895bef3f503ddb3beb01736694d49b"}],"claim.frontier.doi-10-3897-popecon-10-e186220":[{"id":"assertion.claim.frontier.doi-10-3897-popecon-10-e186220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.3897/popecon.10.e186220","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.3897/popecon.10.e186220 \"Well-Being Among Married Couples: The Role of Time Allocation\" (CC BY 4.0, published 2026-10-01) reports: \"The results demonstrate a robust and statistically significant relationship between wellbeing and the time‑allocation decisions made by individuals and their partners.\"","support":[{"end":1785,"quote":"The results demonstrate a robust and statistically significant relationship between wellbeing and the time\\u2011allocation decisions made by individuals and their partners.","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":1613},{"end":7229,"quote":"\"published\":{\"date-parts\":[[2026,10,1]]}","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":7189},{"end":467,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-3897-popecon-10-e186220","source_sha256":"7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282","start":410}],"target_id":"claim.frontier.doi-10-3897-popecon-10-e186220","target_kind":"node","target_sha256":"03dfad1db21ae9317989100b6d225ff2460bb5e9cb429523270d194fa91a7925"}],"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01":[{"id":"assertion.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.54929/2786-5738-2026-27-09-01","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.54929/2786-5738-2026-27-09-01 \"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries\" (CC BY 4.0, published 2026-09-28) reports: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","support":[{"end":1080,"quote":"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":892},{"end":11426,"quote":"\"published\":{\"date-parts\":[[2026,9,28]]}","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":11386},{"end":542,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","source_sha256":"8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905","start":485}],"target_id":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","target_kind":"node","target_sha256":"6e2955f97e76639fbd05e444881a97014480f5ef5a67398572dc2150383e1ee6"}],"claim.frontier.doi-10-55730-1300-0632-4275":[{"id":"assertion.claim.frontier.doi-10-55730-1300-0632-4275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.55730/1300-0632.4275","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.55730/1300-0632.4275 \"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference\" (CC BY 4.0, published 2026-09-16) reports: \"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.\"","support":[{"end":2004,"quote":"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":1756},{"end":13868,"quote":"\"published\":{\"date-parts\":[[2026,9,16]]}","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":13828},{"end":553,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-55730-1300-0632-4275","source_sha256":"500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f","start":496}],"target_id":"claim.frontier.doi-10-55730-1300-0632-4275","target_kind":"node","target_sha256":"4a8892407dae357550fbfdbd86a9e01ae61c3705d15da7e7c42abd73cd2f0ad4"}],"claim.frontier.doi-10-55730-1300-0632-4281":[{"id":"assertion.claim.frontier.doi-10-55730-1300-0632-4281","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.55730/1300-0632.4281","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.55730/1300-0632.4281 \"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity\" (CC BY 4.0, published 2026-09-16) reports: \"The findings highlight that sliding mode–based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.\"","support":[{"end":2297,"quote":"The findings highlight that sliding mode\\u2013based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":2131},{"end":14782,"quote":"\"published\":{\"date-parts\":[[2026,9,16]]}","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":14742},{"end":553,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-55730-1300-0632-4281","source_sha256":"5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b","start":496}],"target_id":"claim.frontier.doi-10-55730-1300-0632-4281","target_kind":"node","target_sha256":"1021403cc9e13bde2e0326d54d3fe51e56aeae42a0ee408feaed5809172cc998"}],"claim.frontier.doi-10-56403-nejesh-v5i2-421":[{"id":"assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.56403/nejesh.v5i2.421","quantifiers":"Only what the quoted sentence states","time":"2026-06-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","support":[{"end":1329,"quote":"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":1118},{"end":9536,"quote":"\"published\":{\"date-parts\":[[2026,6,11]]}","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":9496},{"end":523,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-56403-nejesh-v5i2-421","source_sha256":"7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda","start":466}],"target_id":"claim.frontier.doi-10-56403-nejesh-v5i2-421","target_kind":"node","target_sha256":"5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2"}],"claim.frontier.doi-10-58491-2735-4202-3413":[{"id":"assertion.claim.frontier.doi-10-58491-2735-4202-3413","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.58491/2735-4202.3413","quantifiers":"Only what the quoted sentence states","time":"2026-06-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"","support":[{"end":1458,"quote":"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12\\u00b0 to nearly 28\\u00b0.","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":1306},{"end":3278,"quote":"\"published\":{\"date-parts\":[[2026,6,18]]}","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":3238},{"end":468,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-58491-2735-4202-3413","source_sha256":"dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb","start":411}],"target_id":"claim.frontier.doi-10-58491-2735-4202-3413","target_kind":"node","target_sha256":"cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f"}],"claim.frontier.doi-10-59588-2961-3094-1247":[{"id":"assertion.claim.frontier.doi-10-59588-2961-3094-1247","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.59588/2961-3094.1247","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"","support":[{"end":2477,"quote":"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":2189},{"end":3911,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":3871},{"end":471,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-59588-2961-3094-1247","source_sha256":"d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef","start":414}],"target_id":"claim.frontier.doi-10-59588-2961-3094-1247","target_kind":"node","target_sha256":"92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17"}],"claim.frontier.doi-10-66630-sc-2026-0009":[{"id":"assertion.claim.frontier.doi-10-66630-sc-2026-0009","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in doi:10.66630/sc.2026.0009","quantifiers":"Only what the quoted sentence states","time":"2026-06-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"","support":[{"end":1913,"quote":"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":1567},{"end":7134,"quote":"\"published\":{\"date-parts\":[[2026,6,30]]}","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":7094},{"end":495,"quote":"\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\"","source_id":"source.frontier.doi-10-66630-sc-2026-0009","source_sha256":"6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210","start":438}],"target_id":"claim.frontier.doi-10-66630-sc-2026-0009","target_kind":"node","target_sha256":"5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec"}],"claim.frontier.pmid-42231562":[{"id":"assertion.claim.frontier.pmid-42231562","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42231562","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42231562 \"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study\" (CC BY, first published 2026-09-01) reports: \"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.\"","support":[{"end":6144,"quote":"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":6027},{"end":8830,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":8795},{"end":8571,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42231562","source_sha256":"0308a5738d0ef46c7e969ba5d4fe006a1345bf1eef2c42ca5b1e9957db890ea1","start":8554}],"target_id":"claim.frontier.pmid-42231562","target_kind":"node","target_sha256":"dfb98820f054aef0a581be722e6aa819d652a0608afdd1c6b56b0e1d868b673d"}],"claim.frontier.pmid-42344430":[{"id":"assertion.claim.frontier.pmid-42344430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42344430","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42344430 \"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'\" (CC BY, first published 2026-08-20) reports: \"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.\"","support":[{"end":3710,"quote":"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":3532},{"end":6266,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":6231},{"end":5972,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42344430","source_sha256":"5adf4e5b2858cb25ca85b49bc1bcac338366c40a5bbc674a11a5bb3a09bc0abc","start":5955}],"target_id":"claim.frontier.pmid-42344430","target_kind":"node","target_sha256":"d4e30da9d4e568746c806c1c0cd8a1a3b0b2232391bb0f59bc3ed510e58dc45e"}],"claim.frontier.pmid-42372111":[{"id":"assertion.claim.frontier.pmid-42372111","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42372111","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42372111 \"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication\" (CC BY, first published 2026-09-01) reports: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","support":[{"end":5255,"quote":"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":4985},{"end":7982,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":7947},{"end":7722,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42372111","source_sha256":"463a82ea9a96db6a7184beb33a082e21933edcc805c0be6a460cdb6b765801cc","start":7705}],"target_id":"claim.frontier.pmid-42372111","target_kind":"node","target_sha256":"5cfce4cbd15ef7f5334e8847561926511b0bc03372741abdea05a754cd524803"}],"claim.frontier.pmid-42379141":[{"id":"assertion.claim.frontier.pmid-42379141","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42379141","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42379141 \"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress\" (CC BY, first published 2026-09-01) reports: \"Furthermore, we found that this effect is mediated by 5-HT2AR activation.\"","support":[{"end":4892,"quote":"Furthermore, we found that this effect is mediated by 5-HT2AR activation.","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":4819},{"end":10214,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":10179},{"end":10009,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42379141","source_sha256":"2b35fd7837f8507ce30ecbabd18e58fcd97814a80efbf713a36418c2d9cc5ade","start":9992}],"target_id":"claim.frontier.pmid-42379141","target_kind":"node","target_sha256":"9fe475cf4cdf99f368eb98a9ec68e3b6a4a49ec612d54ce35b1d5faf8c7484c2"}],"claim.frontier.pmid-42403695":[{"id":"assertion.claim.frontier.pmid-42403695","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42403695","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42403695 \"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity\" (CC BY, first published 2026-09-15) reports: \"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.\"","support":[{"end":2840,"quote":"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":2691},{"end":6128,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":6093},{"end":5834,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42403695","source_sha256":"44070aebbeaed4ddb3562d0c19ec08a193ab62abf1daf9819ad8b86447dbdf9d","start":5817}],"target_id":"claim.frontier.pmid-42403695","target_kind":"node","target_sha256":"8bac6af4cb301399b6bb9e75582e23feba316e96150e69ec09fe87c8f1c6583f"}],"claim.frontier.pmid-42405792":[{"id":"assertion.claim.frontier.pmid-42405792","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42405792","quantifiers":"Only what the quoted sentence states","time":"2026-07-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42405792 \"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>\" (CC BY, first published 2026-07-06) reports: \"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.\"","support":[{"end":3360,"quote":"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":3202},{"end":8930,"quote":"\"firstPublicationDate\":\"2026-07-06\"","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":8895},{"end":8599,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42405792","source_sha256":"34611d157d7c9422133089aa84dc1f92f9541d4905fd3a4c26c9f88bf632c5b0","start":8582}],"target_id":"claim.frontier.pmid-42405792","target_kind":"node","target_sha256":"26dfb5f9b28e176b7f9f953936758231db308c009eac4317dede4ebb75e5d7ad"}],"claim.frontier.pmid-42429610":[{"id":"assertion.claim.frontier.pmid-42429610","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42429610","quantifiers":"Only what the quoted sentence states","time":"2026-07-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42429610 \"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community\" (CC BY, first published 2026-07-10) reports: \"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.\"","support":[{"end":5955,"quote":"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":5835},{"end":10161,"quote":"\"firstPublicationDate\":\"2026-07-10\"","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":10126},{"end":9867,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42429610","source_sha256":"3e6c1917e96baa7494fbce8b197f709ffb951f178184bdafdde53f3af9ab7b3c","start":9850}],"target_id":"claim.frontier.pmid-42429610","target_kind":"node","target_sha256":"1c2a558aa8eec5d76532c2fd35a7ce07eb09867f8ad2f8d084bbc9994abd6cd4"}],"claim.frontier.pmid-42439519":[{"id":"assertion.claim.frontier.pmid-42439519","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42439519","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42439519 \"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>\" (CC BY, first published 2026-07-13) reports: \"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.\"","support":[{"end":4009,"quote":"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":3838},{"end":7478,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":7443},{"end":7232,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42439519","source_sha256":"dca8e67dfd03820867d30f4453e384777c69d6cda0fb12aab4dfed979a6a7341","start":7215}],"target_id":"claim.frontier.pmid-42439519","target_kind":"node","target_sha256":"5646759f3095e7a05bc4d4ae5d145022976c47e41d82e959a8f6fb0e8759dbd7"}],"claim.frontier.pmid-42441853":[{"id":"assertion.claim.frontier.pmid-42441853","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42441853","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42441853 \"Evolutionary innovation through fusion of sequences from across the tree of life\" (CC BY, first published 2026-07-13) reports: \"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.\"","support":[{"end":5403,"quote":"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":5235},{"end":9266,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":9231},{"end":8972,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42441853","source_sha256":"1025b39b10fe2e2ddfeaef156914cb6d1789c76bcb7c6daaf5e7154f5a61314a","start":8955}],"target_id":"claim.frontier.pmid-42441853","target_kind":"node","target_sha256":"c78324b1a1297308bfad68bf3b547a402ff14666d47195b76d478cfa5fb2b781"}],"claim.frontier.pmid-42454934":[{"id":"assertion.claim.frontier.pmid-42454934","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42454934","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42454934 \"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes\" (CC BY, first published 2026-07-15) reports: \"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.\"","support":[{"end":3427,"quote":"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":3311},{"end":7774,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":7739},{"end":7470,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42454934","source_sha256":"6d4d1e6817a24344e229675ed1f626ebf7f558079dbbd9957821c6c5cc9bcb02","start":7453}],"target_id":"claim.frontier.pmid-42454934","target_kind":"node","target_sha256":"c1f9483e91a352cb5947cd1976c85e225e2eff15ba2865c1d9ce4644329ba5cc"}],"claim.frontier.pmid-42455014":[{"id":"assertion.claim.frontier.pmid-42455014","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42455014","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42455014 \"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon\" (CC BY, first published 2026-07-15) reports: \"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.\"","support":[{"end":3813,"quote":"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":3630},{"end":8649,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":8614},{"end":8403,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42455014","source_sha256":"e8bf7a8ea532e9411566de71d8f4141071410f7a2f771b8024e2fa619e1cab6c","start":8386}],"target_id":"claim.frontier.pmid-42455014","target_kind":"node","target_sha256":"0f542c76252c04d709651f4e7be53b617de2504132c073645528844bac5306ce"}],"claim.frontier.pmid-42458577":[{"id":"assertion.claim.frontier.pmid-42458577","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42458577","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42458577 \"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development\" (CC BY, first published 2026-07-15) reports: \"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.\"","support":[{"end":5179,"quote":"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":4905},{"end":6655,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":6620},{"end":6361,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42458577","source_sha256":"1a5a7845885cc9d86bff22415684399689ec33d2ba5b3267aa266e174a2dfa29","start":6344}],"target_id":"claim.frontier.pmid-42458577","target_kind":"node","target_sha256":"33118cb48ffae62454c7f2ffd03e62763b56c219235964dd41da8941a124eed1"}],"claim.frontier.pmid-42461951":[{"id":"assertion.claim.frontier.pmid-42461951","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42461951","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42461951 \"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization\" (CC BY, first published 2026-07-16) reports: \"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.\"","support":[{"end":5365,"quote":"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":5271},{"end":9628,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":9593},{"end":9334,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42461951","source_sha256":"dc9047bddcdc99f58b437b33da932f3c4db13ce9ca3259cbde880605be014dc3","start":9317}],"target_id":"claim.frontier.pmid-42461951","target_kind":"node","target_sha256":"aae68c97d680b34d01f7860b88badb7f450425873d1db4a6fe84421787f99cff"}],"claim.frontier.pmid-42462719":[{"id":"assertion.claim.frontier.pmid-42462719","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42462719","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42462719 \"Evolutionary radiation of Polaromonas from mountain glaciers downstream\" (CC BY, first published 2026-07-16) reports: \"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.\"","support":[{"end":5049,"quote":"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":4683},{"end":7191,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":7156},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42462719","source_sha256":"76bc1ac8651bd0a34fa7d8ae64c7232b824d26c4634d3898fa868c2eefe3ee30","start":6928}],"target_id":"claim.frontier.pmid-42462719","target_kind":"node","target_sha256":"e2a2eaff425bceb731a720e72b3f15ce7313309f783085f054af4ad2e03b642e"}],"claim.frontier.pmid-42467705":[{"id":"assertion.claim.frontier.pmid-42467705","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42467705","quantifiers":"Only what the quoted sentence states","time":"2026-07-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42467705 \"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis\" (CC BY, first published 2026-07-17) reports: \"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.\"","support":[{"end":4400,"quote":"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":4222},{"end":7656,"quote":"\"firstPublicationDate\":\"2026-07-17\"","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":7621},{"end":7362,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42467705","source_sha256":"68dfc1b4ce363b5cf7d257f69df61612dcc5c33b14f57d57fdc07494da27d155","start":7345}],"target_id":"claim.frontier.pmid-42467705","target_kind":"node","target_sha256":"2e721cf18f5723e334ed6f400cb8e2b8c61295a2a356339e2cabbd23097ae817"}],"claim.frontier.pmid-42470282":[{"id":"assertion.claim.frontier.pmid-42470282","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42470282","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42470282 \"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues\" (CC BY, first published 2026-08-01) reports: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","support":[{"end":2087,"quote":"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":1908},{"end":5458,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":5423},{"end":5253,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42470282","source_sha256":"b0b07ba3a9d22a0a974548566c5af43255fc716845e004cfcccf4350a6116309","start":5236}],"target_id":"claim.frontier.pmid-42470282","target_kind":"node","target_sha256":"1aa0c6ba4f4f38c4d5e0b66cb7fded8f0fbcf353109c23e24cdccb9f83e377a8"}],"claim.frontier.pmid-42480918":[{"id":"assertion.claim.frontier.pmid-42480918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42480918","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42480918 \"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation\" (CC BY, first published 2026-07-21) reports: \"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.\"","support":[{"end":3683,"quote":"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":3430},{"end":6551,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":6516},{"end":6305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42480918","source_sha256":"fc8f9ec2bc6a766c1eb931294b8b9623711407fbd2f3bb3dd6d3d072b1657efc","start":6288}],"target_id":"claim.frontier.pmid-42480918","target_kind":"node","target_sha256":"de9700b211583145504ed65af3ded7732dfd5753930058cd96f0f5068269b264"}],"claim.frontier.pmid-42484337":[{"id":"assertion.claim.frontier.pmid-42484337","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42484337","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42484337 \"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert\" (CC BY, first published 2026-07-22) reports: \"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.\"","support":[{"end":4397,"quote":"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":4098},{"end":7753,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":7718},{"end":7446,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42484337","source_sha256":"5d1e32a41b8d4606733d77898abc32fbf2113a2a6bd514fd3b032976487839c5","start":7429}],"target_id":"claim.frontier.pmid-42484337","target_kind":"node","target_sha256":"6012b517cdae71b57bcc8ac919f1c6ff394ffaacbfe4e61ebad1b0924f3c45e5"}],"claim.frontier.pmid-42485283":[{"id":"assertion.claim.frontier.pmid-42485283","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42485283","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42485283 \"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis\" (CC BY, first published 2026-07-22) reports: \"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.\"","support":[{"end":4299,"quote":"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":4060},{"end":7447,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":7412},{"end":7153,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42485283","source_sha256":"52497b3d5fa38101ab0ac73dc6d20f5f0971594c24e59c002d8a820485153189","start":7136}],"target_id":"claim.frontier.pmid-42485283","target_kind":"node","target_sha256":"9f29531dbaf7d96343bdbe3c5278746bf58aea7b7cdd6ed6b1c3ede746d08186"}],"claim.frontier.pmid-42485395":[{"id":"assertion.claim.frontier.pmid-42485395","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42485395","quantifiers":"Only what the quoted sentence states","time":"2026-07-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42485395 \"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024\" (CC BY, first published 2026-07-22) reports: \"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).\"","support":[{"end":5519,"quote":"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":5365},{"end":7527,"quote":"\"firstPublicationDate\":\"2026-07-22\"","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":7492},{"end":7233,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42485395","source_sha256":"1e89a1a1d6a78e8b2f8128b53e7857f565b0bbbd0b0e48f3d8b992f0156d9034","start":7216}],"target_id":"claim.frontier.pmid-42485395","target_kind":"node","target_sha256":"3bee0cfe709461068502d0c55cf85c6f7b1a5176e782a650b44f0321d4b24baa"}],"claim.frontier.pmid-42489250":[{"id":"assertion.claim.frontier.pmid-42489250","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42489250","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42489250 \"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex\" (CC BY, first published 2026-08-01) reports: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","support":[{"end":2364,"quote":"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":2241},{"end":6279,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":6244},{"end":6020,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42489250","source_sha256":"69da560f926c31d373fde602c9e97c6a95b7d14ea78a8d01b9b7bc59f7ff5a43","start":6003}],"target_id":"claim.frontier.pmid-42489250","target_kind":"node","target_sha256":"8bf23d5afb8e45de0826777410cc32fd6991b94810ea244324bc255d48a70eb4"}],"claim.frontier.pmid-42489485":[{"id":"assertion.claim.frontier.pmid-42489485","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42489485","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42489485 \"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts\" (CC BY, first published 2026-07-23) reports: \"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.\"","support":[{"end":5355,"quote":"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":5201},{"end":11795,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":11760},{"end":11488,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42489485","source_sha256":"58d306039b83bafc9f0ca73d241d1af40b61f57d73f80846b1421f03d2dd55e5","start":11471}],"target_id":"claim.frontier.pmid-42489485","target_kind":"node","target_sha256":"300ccb01e288e6359dd8eba9db353ffe13e0a9c3c587b21730783f85a5e59cb1"}],"claim.frontier.pmid-42491728":[{"id":"assertion.claim.frontier.pmid-42491728","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42491728","quantifiers":"Only what the quoted sentence states","time":"2026-07-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42491728 \"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis\" (CC BY, first published 2026-07-14) reports: \"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.\"","support":[{"end":4620,"quote":"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":4535},{"end":9040,"quote":"\"firstPublicationDate\":\"2026-07-14\"","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":9005},{"end":8720,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42491728","source_sha256":"27687f1daa033c2114bb084447d125235d0ea38055412dbe3a4c60a947672ebd","start":8703}],"target_id":"claim.frontier.pmid-42491728","target_kind":"node","target_sha256":"196dd677805071426f6e8b0d2a07d270a8c79fc3bbecc0411d7d36ac703f8065"}],"claim.frontier.pmid-42493198":[{"id":"assertion.claim.frontier.pmid-42493198","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42493198","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42493198 \"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial\" (CC BY, first published 2026-07-23) reports: \"We found no interactions for age, sex or education.\"","support":[{"end":5641,"quote":"We found no interactions for age, sex or education.","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":5590},{"end":10340,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":10305},{"end":10046,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42493198","source_sha256":"4fba18a26a83a02057b41fff8d5dc2d896364efb3a83c02961d8cb70e1ea8d95","start":10029}],"target_id":"claim.frontier.pmid-42493198","target_kind":"node","target_sha256":"62904dce12307788981b559f3f10a734e397b91e1673ba8385a1aa3a443ee41a"}],"claim.frontier.pmid-42497150":[{"id":"assertion.claim.frontier.pmid-42497150","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42497150","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42497150 \"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study\" (CC BY, first published 2026-07-24) reports: \"The data revealed a high fertility desire (88.9%) among the YWLHIV.\"","support":[{"end":4993,"quote":"The data revealed a high fertility desire (88.9%) among the YWLHIV.","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":4926},{"end":9029,"quote":"\"firstPublicationDate\":\"2026-07-24\"","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":8994},{"end":8735,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42497150","source_sha256":"a8610ca68f24f87e0f45d7109a9585e62c4412c1fa99945fdf0ed1dc400ad45a","start":8718}],"target_id":"claim.frontier.pmid-42497150","target_kind":"node","target_sha256":"20bb11e1da426b4d6898da06a3cc2c78df8546f1ff124c83d36f29a7fcc2daa8"}],"claim.frontier.pmid-42507643":[{"id":"assertion.claim.frontier.pmid-42507643","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42507643","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42507643 \"Enhancing missense variant classification in predicted intrinsically disordered regions\" (CC BY, first published 2026-07-27) reports: \"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.\"","support":[{"end":3452,"quote":"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":3267},{"end":5716,"quote":"\"firstPublicationDate\":\"2026-07-27\"","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":5681},{"end":5470,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42507643","source_sha256":"2c0d59edf11778f993778fa49e53c03b4fe15a92a3ed182f11c46b696eb79d23","start":5453}],"target_id":"claim.frontier.pmid-42507643","target_kind":"node","target_sha256":"59a586e2b3cb6a51bac09936b70194a97248314decd5ab60cf47d303b38657d4"}],"claim.frontier.pmid-42510569":[{"id":"assertion.claim.frontier.pmid-42510569","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42510569","quantifiers":"Only what the quoted sentence states","time":"2026-07-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42510569 \"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function\" (CC BY, first published 2026-07-02) reports: \"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.\"","support":[{"end":4717,"quote":"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":4506},{"end":6321,"quote":"\"firstPublicationDate\":\"2026-07-02\"","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":6286},{"end":6027,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42510569","source_sha256":"253780a698146c25ed84cdadc03a986828dbb8003b1e01944932d39f6f7930a8","start":6010}],"target_id":"claim.frontier.pmid-42510569","target_kind":"node","target_sha256":"41e36f51d2a00f087ee9a199b988cafe76523d1a2ed01b500536cdfd190e41ad"}],"claim.frontier.pmid-42514673":[{"id":"assertion.claim.frontier.pmid-42514673","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42514673","quantifiers":"Only what the quoted sentence states","time":"2026-07-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42514673 \"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract\" (CC BY, first published 2026-07-08) reports: \"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.\"","support":[{"end":6388,"quote":"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":6111},{"end":7972,"quote":"\"firstPublicationDate\":\"2026-07-08\"","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":7937},{"end":7679,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42514673","source_sha256":"6477f2e2e93f56ce62f3e57a9b5af557f6c78fb7aa57600cdc01909b8cb919e2","start":7662}],"target_id":"claim.frontier.pmid-42514673","target_kind":"node","target_sha256":"0076237f950e79e40094d80194dc7065574c0ab0f4e015c5735ae598e4d51b75"}],"claim.frontier.pmid-42515727":[{"id":"assertion.claim.frontier.pmid-42515727","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42515727","quantifiers":"Only what the quoted sentence states","time":"2026-07-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42515727 \"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies\" (CC BY, first published 2026-07-07) reports: \"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.\"","support":[{"end":5740,"quote":"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":5649},{"end":8886,"quote":"\"firstPublicationDate\":\"2026-07-07\"","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":8851},{"end":8592,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42515727","source_sha256":"edaf4274b078ad5c9767c677d52a067a6429e7945ef8209d8bd36051b9a15462","start":8575}],"target_id":"claim.frontier.pmid-42515727","target_kind":"node","target_sha256":"27768081a9eed39e0dd63c27c6438a5f490a810814cb43e5175a100d769a9c77"}],"claim.frontier.pmid-42516974":[{"id":"assertion.claim.frontier.pmid-42516974","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42516974","quantifiers":"Only what the quoted sentence states","time":"2026-07-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42516974 \"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition\" (CC BY, first published 2026-07-13) reports: \"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.\"","support":[{"end":6416,"quote":"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":6140},{"end":9599,"quote":"\"firstPublicationDate\":\"2026-07-13\"","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":9564},{"end":9305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42516974","source_sha256":"45d3a50c1c00d846ad2900a0ee96eba18ac6d83623a5d5006d370b47bdd5e898","start":9288}],"target_id":"claim.frontier.pmid-42516974","target_kind":"node","target_sha256":"51dceb9962cd1db61d65a5d85f4632ad363d5eade9b8631b7192cc213d4f476b"}],"claim.frontier.pmid-42520407":[{"id":"assertion.claim.frontier.pmid-42520407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42520407","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42520407 \"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology\" (CC BY, first published 2026-08-01) reports: \"Our data highlight the activation of quiescence and homeostatic programs.\"","support":[{"end":13967,"quote":"Our data highlight the activation of quiescence and homeostatic programs.","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":13894},{"end":17866,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":17831},{"end":17587,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42520407","source_sha256":"fec9d4f1d1f7a12948afeed697b683e82c45654132008ba225791f030708aed3","start":17570}],"target_id":"claim.frontier.pmid-42520407","target_kind":"node","target_sha256":"3ff79ddbcadb12914b6bea2be70b56c078eb0f4f2850cf4a55cb05c61e76f405"}],"claim.frontier.pmid-42522920":[{"id":"assertion.claim.frontier.pmid-42522920","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42522920","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42522920 \"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families\" (CC BY, first published 2026-09-01) reports: \"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.\"","support":[{"end":4348,"quote":"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":4261},{"end":7203,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":7168},{"end":6998,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42522920","source_sha256":"5d392ee47c8c0809f94fbed9b12f1ac029afa0743da8f1735961c8868593270d","start":6981}],"target_id":"claim.frontier.pmid-42522920","target_kind":"node","target_sha256":"3f0a0db8b06d2f0f8ca0225d378578b364e4acd31a8a8c2fab3397e6ad22bf02"}],"claim.frontier.pmid-42528383":[{"id":"assertion.claim.frontier.pmid-42528383","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42528383","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42528383 \"The mycobacterial selenocysteine machinery: presence and expression\" (CC BY, first published 2026-08-05) reports: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","support":[{"end":2952,"quote":"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":2794},{"end":7416,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":7381},{"end":7170,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42528383","source_sha256":"7335fd53680ee950f9527666ab045eb9983ddb895c88e4cbf9a4b515e1f9ab90","start":7153}],"target_id":"claim.frontier.pmid-42528383","target_kind":"node","target_sha256":"d0cb7054510c3596c76d05b7545bc4a3ea50269633ec61c76abc4ecd85a722f0"}],"claim.frontier.pmid-42529330":[{"id":"assertion.claim.frontier.pmid-42529330","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42529330","quantifiers":"Only what the quoted sentence states","time":"2026-07-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42529330 \"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery\" (CC BY, first published 2026-07-15) reports: \"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.\"","support":[{"end":4168,"quote":"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":3942},{"end":8092,"quote":"\"firstPublicationDate\":\"2026-07-15\"","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":8057},{"end":7846,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42529330","source_sha256":"08b676922d9579b8d231232d686b4bcc4907457dd572fa108d4269792e89f07d","start":7829}],"target_id":"claim.frontier.pmid-42529330","target_kind":"node","target_sha256":"7068ee765e8640953d67241e39e05b36e5b722e1649c863afbe9e5223611296b"}],"claim.frontier.pmid-42530440":[{"id":"assertion.claim.frontier.pmid-42530440","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42530440","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42530440 \"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b\" (CC BY, first published 2026-09-01) reports: \"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.\"","support":[{"end":4715,"quote":"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":4590},{"end":7908,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":7873},{"end":7634,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42530440","source_sha256":"9e43dfdc009fec120941f62c6023ebdb34e17f148e8494514ffa6b2d3ca5de6d","start":7617}],"target_id":"claim.frontier.pmid-42530440","target_kind":"node","target_sha256":"1443008e52b6f81c11ae9bf55d4c53d08253ebc6e8df449a514bfbd8189388d5"}],"claim.frontier.pmid-42531221":[{"id":"assertion.claim.frontier.pmid-42531221","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531221","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531221 \"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids\" (CC BY, first published 2026-07-30) reports: \"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.\"","support":[{"end":5818,"quote":"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":5629},{"end":10449,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":10414},{"end":10155,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531221","source_sha256":"917d42a8f799054a15ee65f3b0145d0fece7dc166acc38cdb3f6e241760e0276","start":10138}],"target_id":"claim.frontier.pmid-42531221","target_kind":"node","target_sha256":"ad8da4c41c1bd9abd47d6062d21913647ed256423bea837dfd491d5f8638b41a"}],"claim.frontier.pmid-42531248":[{"id":"assertion.claim.frontier.pmid-42531248","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531248","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531248 \"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study\" (CC BY, first published 2026-07-30) reports: \"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.\"","support":[{"end":4671,"quote":"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":4453},{"end":7548,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":7513},{"end":7302,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531248","source_sha256":"4a47db164a7ff3d47ec03b18cf2fa01ab5fadbffa403541b1daf37af7d722dcc","start":7285}],"target_id":"claim.frontier.pmid-42531248","target_kind":"node","target_sha256":"8960a1ac3b603353807a33706fc71559f25557f6fa6b0102070b07cbc7cbf7fd"}],"claim.frontier.pmid-42531261":[{"id":"assertion.claim.frontier.pmid-42531261","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531261","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531261 \"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi\" (CC BY, first published 2026-07-30) reports: \"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.\"","support":[{"end":6757,"quote":"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":6613},{"end":8330,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":8295},{"end":8036,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531261","source_sha256":"1fc1122499e301685249a28fa248492f651a9eebb34eb915ac4579799a936bec","start":8019}],"target_id":"claim.frontier.pmid-42531261","target_kind":"node","target_sha256":"944e48f7363613bc774c594e35e3689a7dfd203c230be3b27519de018d7022bf"}],"claim.frontier.pmid-42531267":[{"id":"assertion.claim.frontier.pmid-42531267","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531267","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531267 \"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)\" (CC BY, first published 2026-07-30) reports: \"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.\"","support":[{"end":8651,"quote":"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":8387},{"end":10518,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":10483},{"end":10272,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531267","source_sha256":"54f0ab249eb8fad1a15b24403bbaa42606eb00066d8fb20a1be9ad9e80a06824","start":10255}],"target_id":"claim.frontier.pmid-42531267","target_kind":"node","target_sha256":"899ecd6eb810440067b2be54697d357bf6ef72911496b6700a34abb74e0c321b"}],"claim.frontier.pmid-42531275":[{"id":"assertion.claim.frontier.pmid-42531275","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42531275","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42531275 \"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting\" (CC BY, first published 2026-07-30) reports: \"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.\"","support":[{"end":3876,"quote":"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":3698},{"end":6563,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":6528},{"end":6317,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42531275","source_sha256":"30d64e4d00b3c8a55c17b2006f07e5392f64882fd7b400d2d235546afa2be883","start":6300}],"target_id":"claim.frontier.pmid-42531275","target_kind":"node","target_sha256":"811517c21c4998faab5183046f03141a231651751750925e22b150246aaa8cc8"}],"claim.frontier.pmid-42533345":[{"id":"assertion.claim.frontier.pmid-42533345","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42533345","quantifiers":"Only what the quoted sentence states","time":"2026-07-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42533345 \"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes\" (CC BY, first published 2026-07-29) reports: \"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.\"","support":[{"end":4665,"quote":"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":4456},{"end":7647,"quote":"\"firstPublicationDate\":\"2026-07-29\"","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":7612},{"end":7353,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42533345","source_sha256":"4eb78bb40aeb64cc1052e8f7484702bd491eada73bbc0cdf3e955bd22c2170ce","start":7336}],"target_id":"claim.frontier.pmid-42533345","target_kind":"node","target_sha256":"f2e247302a31e1db20b0d8ec80e6862c58a6d833f3ba2c66edb6acfb327fd8e7"}],"claim.frontier.pmid-42534899":[{"id":"assertion.claim.frontier.pmid-42534899","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42534899","quantifiers":"Only what the quoted sentence states","time":"2026-07-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42534899 \"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments\" (CC BY, first published 2026-07-16) reports: \"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.\"","support":[{"end":6389,"quote":"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":6118},{"end":11881,"quote":"\"firstPublicationDate\":\"2026-07-16\"","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":11846},{"end":11574,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42534899","source_sha256":"e9399167f3b5616c6fdc16dbbb2c228d571da5b1c2b9582352c44931b473737f","start":11557}],"target_id":"claim.frontier.pmid-42534899","target_kind":"node","target_sha256":"20c4240b43d86593a9205e297aab1949a13dc7572bd0bfc5611c8ddcd46cfb57"}],"claim.frontier.pmid-42536671":[{"id":"assertion.claim.frontier.pmid-42536671","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42536671","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42536671 \"NLCD: A method to discover nonlinear causal relations among genes\" (CC BY, first published 2026-07-31) reports: \"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).\"","support":[{"end":3591,"quote":"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":3211},{"end":7109,"quote":"\"firstPublicationDate\":\"2026-07-31\"","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":7074},{"end":6809,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42536671","source_sha256":"fbb3bc466f9469b85b4d72668e98445922d6b571bfdb4f0a42d11a114d206631","start":6792}],"target_id":"claim.frontier.pmid-42536671","target_kind":"node","target_sha256":"6754ccb2b98a798f91af1a0f4a56ea248f06bf4ae800fbd01436b70d15f3286f"}],"claim.frontier.pmid-42538349":[{"id":"assertion.claim.frontier.pmid-42538349","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42538349","quantifiers":"Only what the quoted sentence states","time":"2026-07-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42538349 \"Global trade responses to shark finning regulations\" (CC BY, first published 2026-07-31) reports: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","support":[{"end":5496,"quote":"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":5294},{"end":8366,"quote":"\"firstPublicationDate\":\"2026-07-31\"","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":8331},{"end":8072,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42538349","source_sha256":"f6e4c114a88fc8f347364ba14672546badbb2f2a87758fc21c45af8b6641f730","start":8055}],"target_id":"claim.frontier.pmid-42538349","target_kind":"node","target_sha256":"e9b556054e60be6b1472ad2e7c1bf64d4d3f063f7d49b324b0f14b9e63714875"}],"claim.frontier.pmid-42545021":[{"id":"assertion.claim.frontier.pmid-42545021","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42545021","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42545021 \"Diversity and sources of floral microbial communities\" (CC BY, first published 2026-08-03) reports: \"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.\"","support":[{"end":3369,"quote":"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":3238},{"end":6600,"quote":"\"firstPublicationDate\":\"2026-08-03\"","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":6565},{"end":6354,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42545021","source_sha256":"56b8efdd68327ec24f64fc33d6560df8ff389cb61e30426966acacd0416b5fd8","start":6337}],"target_id":"claim.frontier.pmid-42545021","target_kind":"node","target_sha256":"acea25936281e7a3c041303942d514d80ed5adb9fdadf6d2dfe50492b8a13852"}],"claim.frontier.pmid-42549006":[{"id":"assertion.claim.frontier.pmid-42549006","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42549006","quantifiers":"Only what the quoted sentence states","time":"2026-08-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42549006 \"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis\" (CC BY, first published 2026-08-02) reports: \"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.\"","support":[{"end":3350,"quote":"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":3249},{"end":5613,"quote":"\"firstPublicationDate\":\"2026-08-02\"","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":5578},{"end":5319,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42549006","source_sha256":"a8dd8f32bfaf18c2c01d3e396a7a654ce372c349ed676ef144de4540566b1525","start":5302}],"target_id":"claim.frontier.pmid-42549006","target_kind":"node","target_sha256":"36ea6226c2d4515f61f474b5ec36e276758c69f0f4ba844363b83ed426fbb8f4"}],"claim.frontier.pmid-42550924":[{"id":"assertion.claim.frontier.pmid-42550924","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42550924","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42550924 \"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination\" (CC BY, first published 2026-08-01) reports: \"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.\"","support":[{"end":9306,"quote":"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":9091},{"end":14254,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":14219},{"end":13988,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42550924","source_sha256":"29b309e7b1a2963ecae3c9901325228926041d865457cc75ee67034bad7f126c","start":13971}],"target_id":"claim.frontier.pmid-42550924","target_kind":"node","target_sha256":"ab540160ab4b50f0743d4f89900efce44922d3249f5f9e8a6c279851e560cf1e"}],"claim.frontier.pmid-42553105":[{"id":"assertion.claim.frontier.pmid-42553105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42553105","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42553105 \"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease\" (CC BY, first published 2026-07-21) reports: \"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.\"","support":[{"end":5284,"quote":"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":5168},{"end":7004,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":6969},{"end":6710,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42553105","source_sha256":"60af09b642b088274a8079be664fb78730b7828f70ccd7bec919245da3c64640","start":6693}],"target_id":"claim.frontier.pmid-42553105","target_kind":"node","target_sha256":"65d15e29296eeb7ce3e664404ace976ff0e0ba4768ddf658a32667b3e4913572"}],"claim.frontier.pmid-42553384":[{"id":"assertion.claim.frontier.pmid-42553384","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42553384","quantifiers":"Only what the quoted sentence states","time":"2026-07-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42553384 \"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins\" (CC BY, first published 2026-07-21) reports: \"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.\"","support":[{"end":5939,"quote":"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":5756},{"end":8335,"quote":"\"firstPublicationDate\":\"2026-07-21\"","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":8300},{"end":8011,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42553384","source_sha256":"2b75ef34c65350582d9219753c66ac13238866ee6d0be17c955d5525d66d2253","start":7994}],"target_id":"claim.frontier.pmid-42553384","target_kind":"node","target_sha256":"e533fd993aac998fb80072f63ba6c3384456fb4437955e960dc9c4a14f69641c"}],"claim.frontier.pmid-42554464":[{"id":"assertion.claim.frontier.pmid-42554464","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42554464","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42554464 \"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>\" (CC BY, first published 2026-08-05) reports: \"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.\"","support":[{"end":5339,"quote":"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":5243},{"end":12007,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":11972},{"end":11713,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42554464","source_sha256":"614c8775901096e02a3bad482b81685db5f5809bff72f6cfa7189d9690958411","start":11696}],"target_id":"claim.frontier.pmid-42554464","target_kind":"node","target_sha256":"c05377952db40addb5bafa58d64ed9be6294bf8937be1acfa015817983a8b69d"}],"claim.frontier.pmid-42560043":[{"id":"assertion.claim.frontier.pmid-42560043","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560043","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560043 \"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots\" (CC BY, first published 2026-08-06) reports: \"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.\"","support":[{"end":5564,"quote":"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":5127},{"end":9699,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":9664},{"end":9453,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560043","source_sha256":"d14ef500d9dc1feacf8e41fe0270f67fee0520fb8c5d3319090cc94fd5aba651","start":9436}],"target_id":"claim.frontier.pmid-42560043","target_kind":"node","target_sha256":"3253072cf4ece2ce0d2c527aeeaaaa026551690ced864d425542e4f9741ffde5"}],"claim.frontier.pmid-42560857":[{"id":"assertion.claim.frontier.pmid-42560857","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560857","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560857 \"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery\" (CC BY, first published 2026-08-01) reports: \"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.\"","support":[{"end":4738,"quote":"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":4547},{"end":8207,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":8172},{"end":7948,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560857","source_sha256":"f28de46dacc8ea5ad25d1e5c9c10982f15610688a182a3fe4a044432ce5d3df0","start":7931}],"target_id":"claim.frontier.pmid-42560857","target_kind":"node","target_sha256":"02668f00e5a5a5663bec0aa3a9d6c05a007739a115a01cfd69ec964b9a0ab5a5"}],"claim.frontier.pmid-42560943":[{"id":"assertion.claim.frontier.pmid-42560943","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42560943","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42560943 \"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model\" (CC BY, first published 2026-08-06) reports: \"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.\"","support":[{"end":4147,"quote":"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":3956},{"end":6896,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":6861},{"end":6602,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42560943","source_sha256":"bed64e7a1330d94f4aa40363de6389ad019281a0c81c196689fa6147f523ea61","start":6585}],"target_id":"claim.frontier.pmid-42560943","target_kind":"node","target_sha256":"a1b592b6208a5118318e2e6f63013da04a6374ba136aa81fc39bdafe3d3dd024"}],"claim.frontier.pmid-42565205":[{"id":"assertion.claim.frontier.pmid-42565205","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42565205","quantifiers":"Only what the quoted sentence states","time":"2026-07-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42565205 \"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease\" (CC BY, first published 2026-07-24) reports: \"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.\"","support":[{"end":3128,"quote":"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":2982},{"end":6007,"quote":"\"firstPublicationDate\":\"2026-07-24\"","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":5972},{"end":5704,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42565205","source_sha256":"967b724ba79a4db99f44d0754488d9b26bf34f34828908a17d11ac6684d60eb9","start":5687}],"target_id":"claim.frontier.pmid-42565205","target_kind":"node","target_sha256":"0908c254600dd40f6091684c6ff72ceaead68e48bf4829c6c1fbd0b6d43c2e08"}],"claim.frontier.pmid-42566407":[{"id":"assertion.claim.frontier.pmid-42566407","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42566407","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42566407 \"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study\" (CC BY, first published 2026-08-07) reports: \"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.\"","support":[{"end":4706,"quote":"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":4513},{"end":6984,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":6949},{"end":6690,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42566407","source_sha256":"3f1bd186043d24e5e6c5d6d8ebf0f62e7a7cf4712dd60ee2411edc1340376bd9","start":6673}],"target_id":"claim.frontier.pmid-42566407","target_kind":"node","target_sha256":"99123498b35f2a9280749c12332e2344cae4e9f49f0eee4c688538ed7fe91466"}],"claim.frontier.pmid-42569382":[{"id":"assertion.claim.frontier.pmid-42569382","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42569382","quantifiers":"Only what the quoted sentence states","time":"2026-08-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42569382 \"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study\" (CC BY, first published 2026-08-05) reports: \"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.\"","support":[{"end":2000,"quote":"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":1871},{"end":5416,"quote":"\"firstPublicationDate\":\"2026-08-05\"","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":5381},{"end":5122,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42569382","source_sha256":"ddfa411258db3b85678a3cc43a9f27c9a64dc5d5dc62cef70661c89b1cbd0f7e","start":5105}],"target_id":"claim.frontier.pmid-42569382","target_kind":"node","target_sha256":"6acb811040b5dd609e3fae7ab0c5aefcd3b75a7dbe699e5550e32330d1ca12ea"}],"claim.frontier.pmid-42571083":[{"id":"assertion.claim.frontier.pmid-42571083","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42571083","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42571083 \"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations\" (CC BY, first published 2026-08-07) reports: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","support":[{"end":3733,"quote":"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":3543},{"end":5774,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":5739},{"end":5480,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42571083","source_sha256":"8d335af206590e5909a0655514594316f3ff38b5f666df3338debcde7aa7df22","start":5463}],"target_id":"claim.frontier.pmid-42571083","target_kind":"node","target_sha256":"2da1179dc8b8ef02c3e1fbf900f666d546be46c2a97a0ce494363175e2a97312"}],"claim.frontier.pmid-42577546":[{"id":"assertion.claim.frontier.pmid-42577546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42577546","quantifiers":"Only what the quoted sentence states","time":"2026-08-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42577546 \"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection\" (CC BY, first published 2026-08-09) reports: \"Cluster C3 was associated with poor prognosis and reduced survival.\"","support":[{"end":4571,"quote":"Cluster C3 was associated with poor prognosis and reduced survival.","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":4504},{"end":6447,"quote":"\"firstPublicationDate\":\"2026-08-09\"","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":6412},{"end":6201,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42577546","source_sha256":"16a5746ac7d41ea33ab23a95332d068760deef0e4b8579d20e28515f31663288","start":6184}],"target_id":"claim.frontier.pmid-42577546","target_kind":"node","target_sha256":"5ebbb5abe1355463d772f0405b34905164e3fbd9775283e5b1923b07dd145dc3"}],"claim.frontier.pmid-42578670":[{"id":"assertion.claim.frontier.pmid-42578670","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42578670","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42578670 \"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis\" (CC BY, first published 2026-08-11) reports: \"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.\"","support":[{"end":5953,"quote":"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":5816},{"end":8900,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":8865},{"end":8606,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42578670","source_sha256":"5360d22a6bde9d7c6bd2d42798aaf82999adcc3b3a0fa5d8d79d4ecff5474b21","start":8589}],"target_id":"claim.frontier.pmid-42578670","target_kind":"node","target_sha256":"5e37cc476cb5de840031ff8258e84100dc78bfec9d076e96160d63b04154f7bf"}],"claim.frontier.pmid-42578673":[{"id":"assertion.claim.frontier.pmid-42578673","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42578673","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42578673 \"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use\" (CC BY, first published 2026-08-11) reports: \"A balanced microbiome is associated with favorable health outcomes.\"","support":[{"end":4873,"quote":"A balanced microbiome is associated with favorable health outcomes.","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":4806},{"end":11797,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":11762},{"end":11551,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42578673","source_sha256":"f321f11957e438dbc54bac632ec45d2b32d01d606a5b6dd9e2d2dcb077d08705","start":11534}],"target_id":"claim.frontier.pmid-42578673","target_kind":"node","target_sha256":"c3ef2dedf2f1a45a6e05f3db3f5e9081e5a721f2d8be7b7356f1335ca7e03943"}],"claim.frontier.pmid-42584423":[{"id":"assertion.claim.frontier.pmid-42584423","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42584423","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42584423 \"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation\" (CC BY, first published 2026-08-12) reports: \"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.\"","support":[{"end":3778,"quote":"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":3548},{"end":7855,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":7820},{"end":7549,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42584423","source_sha256":"44562283b7cc476f9d9f9f62ad48656dc8443718a8945e13a4dd7d537871a663","start":7532}],"target_id":"claim.frontier.pmid-42584423","target_kind":"node","target_sha256":"350cae1bb8aa28e7452eba0710ffa6e9348d186d71d6888cbded95a5b9556afc"}],"claim.frontier.pmid-42585188":[{"id":"assertion.claim.frontier.pmid-42585188","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42585188","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42585188 \"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens\" (CC BY, first published 2026-08-12) reports: \"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.\"","support":[{"end":4375,"quote":"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":4204},{"end":6995,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":6960},{"end":6749,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42585188","source_sha256":"8cf9c5ba0445ea9d4dc47fd9fad84814aea794901188316af270b367248991b3","start":6732}],"target_id":"claim.frontier.pmid-42585188","target_kind":"node","target_sha256":"4d7db3f922426451e54612059212781743c2464464e07d631682da3c6feddffb"}],"claim.frontier.pmid-42585261":[{"id":"assertion.claim.frontier.pmid-42585261","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42585261","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42585261 \"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories\" (CC BY, first published 2026-08-12) reports: \"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.\"","support":[{"end":5965,"quote":"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":5703},{"end":8707,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":8672},{"end":8461,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42585261","source_sha256":"8c9b6c63a3bba020ddfd2f9197ce98e363beeb8ff6fb6138f84126a6a307b35d","start":8444}],"target_id":"claim.frontier.pmid-42585261","target_kind":"node","target_sha256":"a883e42068f102d1226b789c87b5a33994ab479faf9fab92e3ff5a94aa8822af"}],"claim.frontier.pmid-42588195":[{"id":"assertion.claim.frontier.pmid-42588195","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42588195","quantifiers":"Only what the quoted sentence states","time":"2026-08-06","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42588195 \"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study\" (CC BY, first published 2026-08-06) reports: \"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.\"","support":[{"end":6968,"quote":"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":6799},{"end":11457,"quote":"\"firstPublicationDate\":\"2026-08-06\"","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":11422},{"end":11163,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42588195","source_sha256":"1b02bf3d823c99f62575ceefaa99ab2c5ffc0cfed2ed39a93aa17662db63b396","start":11146}],"target_id":"claim.frontier.pmid-42588195","target_kind":"node","target_sha256":"1e38baecaf60b65444fdddd8229de925530d7bc8184f6192bfacf00af8968ff7"}],"claim.frontier.pmid-42589669":[{"id":"assertion.claim.frontier.pmid-42589669","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42589669","quantifiers":"Only what the quoted sentence states","time":"2026-08-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42589669 \"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes\" (CC BY, first published 2026-08-04) reports: \"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.\"","support":[{"end":8208,"quote":"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":7991},{"end":12276,"quote":"\"firstPublicationDate\":\"2026-08-04\"","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":12241},{"end":12030,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42589669","source_sha256":"fa60f93dd06be9a41b7900ecde91af2f5aeafae963e866b9463e61a6cc7da022","start":12013}],"target_id":"claim.frontier.pmid-42589669","target_kind":"node","target_sha256":"05b0aad2ca3982979bfcb4dce0ad76d2656a002c2d73cfe57a61172c389520d3"}],"claim.frontier.pmid-42590131":[{"id":"assertion.claim.frontier.pmid-42590131","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42590131","quantifiers":"Only what the quoted sentence states","time":"2026-08-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42590131 \"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study\" (CC BY, first published 2026-08-03) reports: \": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.\"","support":[{"end":3754,"quote":": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":3566},{"end":7152,"quote":"\"firstPublicationDate\":\"2026-08-03\"","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":7117},{"end":6906,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42590131","source_sha256":"15fa5fc681c7f0ad23ce0c70c07afe961bb5b15f553b2b49a40874ff0588f148","start":6889}],"target_id":"claim.frontier.pmid-42590131","target_kind":"node","target_sha256":"517c3bcbe17e0bab4b0534e559adae8852e3b83639c3e32fef0354469832b460"}],"claim.frontier.pmid-42594273":[{"id":"assertion.claim.frontier.pmid-42594273","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42594273","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42594273 \"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer\" (CC BY, first published 2026-08-13) reports: \"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.\"","support":[{"end":9971,"quote":"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":9744},{"end":14159,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":14124},{"end":13851,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42594273","source_sha256":"117c3143e3b6f7b2108ea1b76fa96a6813904b7dc93debc7ba3e6432b0d8e785","start":13834}],"target_id":"claim.frontier.pmid-42594273","target_kind":"node","target_sha256":"fe7b8228851eda23c73274d9be312e046718e68147345be7563cd941cf9e9f20"}],"claim.frontier.pmid-42595314":[{"id":"assertion.claim.frontier.pmid-42595314","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42595314","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42595314 \"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort\" (CC BY, first published 2026-08-13) reports: \"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.\"","support":[{"end":5321,"quote":"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":5138},{"end":7518,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":7483},{"end":7272,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42595314","source_sha256":"065de79e2ad34ac78db186bcb63335ae76ee6cd0b7005afade29016ea4c409ed","start":7255}],"target_id":"claim.frontier.pmid-42595314","target_kind":"node","target_sha256":"e178a7e5dd46cc45c6d65b0aaa93a72e4fbc765be4aa5bbce307e55884892ddc"}],"claim.frontier.pmid-42597521":[{"id":"assertion.claim.frontier.pmid-42597521","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42597521","quantifiers":"Only what the quoted sentence states","time":"2026-07-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42597521 \"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study\" (CC BY, first published 2026-07-30) reports: \"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.\"","support":[{"end":5807,"quote":"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":5634},{"end":7221,"quote":"\"firstPublicationDate\":\"2026-07-30\"","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":7186},{"end":6927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42597521","source_sha256":"1269d3657c898d0e582a68900f7140677fe950e79f42f2d37b41cb85b5660edc","start":6910}],"target_id":"claim.frontier.pmid-42597521","target_kind":"node","target_sha256":"24ebcb0926ff33a57a282813c5be6dd0eee7bd46c3edfaaff6ea88fedc3a2630"}],"claim.frontier.pmid-42599850":[{"id":"assertion.claim.frontier.pmid-42599850","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599850","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599850 \"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol\" (CC BY, first published 2026-08-14) reports: \"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.\"","support":[{"end":2787,"quote":"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":2653},{"end":5455,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":5420},{"end":5161,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599850","source_sha256":"9bf996136b3e33d0e9a2141b940702e85ce11bf5d193ea6723a22b503b8580d5","start":5144}],"target_id":"claim.frontier.pmid-42599850","target_kind":"node","target_sha256":"1f6eb2daf212bee703fad68ab953ea314032a4efac63fa22a4a2250eb24cf295"}],"claim.frontier.pmid-42599899":[{"id":"assertion.claim.frontier.pmid-42599899","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599899","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599899 \"Determinants of instructional leadership: A survey of public secondary schools\" (CC BY, first published 2026-08-14) reports: \"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.\"","support":[{"end":3854,"quote":"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":3591},{"end":5991,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":5956},{"end":5697,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599899","source_sha256":"aed014f3d9ea6effc0c1f816cccf40f7c4803446e95e58224d3cb8c478f4e244","start":5680}],"target_id":"claim.frontier.pmid-42599899","target_kind":"node","target_sha256":"82337163f99edff5fb1922b59d2c945fe31cc8782352cfbe882c4918e254b62f"}],"claim.frontier.pmid-42599952":[{"id":"assertion.claim.frontier.pmid-42599952","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42599952","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42599952 \"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study\" (CC BY, first published 2026-08-14) reports: \"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.\"","support":[{"end":6537,"quote":"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":6309},{"end":9822,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":9787},{"end":9528,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42599952","source_sha256":"5d63005675e269e9bed84ab98d00023115427e508e0ec8aad504dc8dd42e33b1","start":9511}],"target_id":"claim.frontier.pmid-42599952","target_kind":"node","target_sha256":"cb30f6ed57a1902ea6566767fac0200d5650649909a328a13b74beacc4b19e18"}],"claim.frontier.pmid-42606346":[{"id":"assertion.claim.frontier.pmid-42606346","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42606346","quantifiers":"Only what the quoted sentence states","time":"2026-08-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42606346 \"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect\" (CC BY, first published 2026-08-01) reports: \"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.\"","support":[{"end":2641,"quote":"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":2481},{"end":5930,"quote":"\"firstPublicationDate\":\"2026-08-01\"","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":5895},{"end":5670,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42606346","source_sha256":"c7f2425b066cb5a197e5033b3e282689a00994deda49c4c2af0ee38e5ee7bf97","start":5653}],"target_id":"claim.frontier.pmid-42606346","target_kind":"node","target_sha256":"0569d065533bcf7de4b62b4db6de60378efdb832ac468a17521aa9de886852a5"}],"claim.frontier.pmid-42609599":[{"id":"assertion.claim.frontier.pmid-42609599","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42609599","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42609599 \"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report\" (CC BY, first published 2026-08-17) reports: \"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.\"","support":[{"end":2335,"quote":"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":2122},{"end":4976,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":4941},{"end":4730,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42609599","source_sha256":"664dc7023c474277e5514c3ba73ef03e361e7e32e54d061b13827e7cebb8c513","start":4713}],"target_id":"claim.frontier.pmid-42609599","target_kind":"node","target_sha256":"7a85472e093e5f1b7afda87925cb7ab106c97e2cdd4206f04e83b5a6dda1e688"}],"claim.frontier.pmid-42611865":[{"id":"assertion.claim.frontier.pmid-42611865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42611865","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42611865 \"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease\" (CC BY, first published 2026-08-18) reports: \"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.\"","support":[{"end":6260,"quote":"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":6033},{"end":9071,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":9036},{"end":8760,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42611865","source_sha256":"c6cab79ce5880ed2d103546a8267d303df24fe81dd55ec55dc7d7b3a9701ea1d","start":8743}],"target_id":"claim.frontier.pmid-42611865","target_kind":"node","target_sha256":"1d9d8df890c270e4de70293dcc7142c68a0b30ecc4ed7c0b7f4c9b5962f9c635"}],"claim.frontier.pmid-42612575":[{"id":"assertion.claim.frontier.pmid-42612575","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42612575","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42612575 \"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response\" (CC BY, first published 2026-08-18) reports: \"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.\"","support":[{"end":5100,"quote":"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":4899},{"end":6933,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":6898},{"end":6639,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42612575","source_sha256":"74547557f2268744784be559fbe0b21f08acbacc3d3c518475967ae117674a47","start":6622}],"target_id":"claim.frontier.pmid-42612575","target_kind":"node","target_sha256":"d16bedf1a7595f1569b9fdb5b6c644d2c880f75484d4823d216291864b1802bb"}],"claim.frontier.pmid-42616230":[{"id":"assertion.claim.frontier.pmid-42616230","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42616230","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42616230 \"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases\" (CC BY, first published 2026-08-19) reports: \"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.\"","support":[{"end":7836,"quote":"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":7602},{"end":11638,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":11603},{"end":11344,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42616230","source_sha256":"78b154c5d2b440d7435ba31a096c469c5cc7b29e7b296690146a41cb3b6db8bf","start":11327}],"target_id":"claim.frontier.pmid-42616230","target_kind":"node","target_sha256":"33ee3432f835163e782e5a50f867be17bfd7100ea4d52bf9de662249072628d8"}],"claim.frontier.pmid-42616741":[{"id":"assertion.claim.frontier.pmid-42616741","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42616741","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42616741 \"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff\" (CC BY, first published 2026-08-19) reports: \"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.\"","support":[{"end":5310,"quote":"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":5141},{"end":6842,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":6807},{"end":6548,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42616741","source_sha256":"38bb2e8a5522001e23187cc45be948cd24ec2257bc8d102b3dd105bc1e4bfe9b","start":6531}],"target_id":"claim.frontier.pmid-42616741","target_kind":"node","target_sha256":"0b4ff6023d3fb70d86afdab3057e8f7629dc9ea64fd846a8bc8880016f010e27"}],"claim.frontier.pmid-42626349":[{"id":"assertion.claim.frontier.pmid-42626349","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42626349","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42626349 \"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events\" (CC BY, first published 2026-08-20) reports: \"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.\"","support":[{"end":2145,"quote":"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":2009},{"end":4505,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":4470},{"end":4259,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42626349","source_sha256":"97b197608b2de87228e0ff675fb0fbf0e5738d19f1d38613965d5a4997bed49b","start":4242}],"target_id":"claim.frontier.pmid-42626349","target_kind":"node","target_sha256":"0fc4a61006fbd64ea1482496e77fc26f6810dabdc34516ae42c5af62a5337ec4"}],"claim.frontier.pmid-42627158":[{"id":"assertion.claim.frontier.pmid-42627158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627158","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627158 \"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium\" (CC BY, first published 2026-08-21) reports: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","support":[{"end":3139,"quote":"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":2916},{"end":7958,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":7923},{"end":7651,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627158","source_sha256":"0abfa6cd410b7221afe709ecb1d08a838474911686a25568ad368853fbeafde3","start":7634}],"target_id":"claim.frontier.pmid-42627158","target_kind":"node","target_sha256":"225d8c35f4192181e564eea76e1b59ddd5ca5aae5e57f7533842a429ff3fee41"}],"claim.frontier.pmid-42627223":[{"id":"assertion.claim.frontier.pmid-42627223","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627223","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627223 \"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint\" (CC BY, first published 2026-08-20) reports: \"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.\"","support":[{"end":4128,"quote":"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":3794},{"end":6597,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":6562},{"end":6303,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627223","source_sha256":"9557732027dfa590b0d02abd867a018e99d7b2933d268b24f22f990234009ac2","start":6286}],"target_id":"claim.frontier.pmid-42627223","target_kind":"node","target_sha256":"b0067149bb8dd747a69cece365f9672bcfde4f7ecbdcbfc9cac1c23fee648ab0"}],"claim.frontier.pmid-42627947":[{"id":"assertion.claim.frontier.pmid-42627947","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42627947","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42627947 \"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial\" (CC BY, first published 2026-08-21) reports: \"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.\"","support":[{"end":4722,"quote":"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":4454},{"end":10595,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":10560},{"end":10295,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42627947","source_sha256":"d2770ddd3bc084adac6da92426b97794d406f2be0547f4111af6755de8c7256e","start":10278}],"target_id":"claim.frontier.pmid-42627947","target_kind":"node","target_sha256":"41b31cd510c72a1618a94c2855b434fac56b67e60927f7f313dd60c85165dcd7"}],"claim.frontier.pmid-42630507":[{"id":"assertion.claim.frontier.pmid-42630507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42630507","quantifiers":"Only what the quoted sentence states","time":"2026-08-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42630507 \"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming\" (CC BY, first published 2026-08-07) reports: \"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.\"","support":[{"end":4690,"quote":"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":4501},{"end":8132,"quote":"\"firstPublicationDate\":\"2026-08-07\"","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":8097},{"end":7825,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42630507","source_sha256":"4c8e0764d68125968bcbda5654eb754def8c8ea08e182227600aa8fd63318519","start":7808}],"target_id":"claim.frontier.pmid-42630507","target_kind":"node","target_sha256":"457a71cb8b029ed2e824f8b954bfd5354742842b14eaf55c3805129b1388a1b1"}],"claim.frontier.pmid-42634019":[{"id":"assertion.claim.frontier.pmid-42634019","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42634019","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42634019 \"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence\" (CC BY, first published 2026-08-24) reports: \"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.\"","support":[{"end":4489,"quote":"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":4196},{"end":7833,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":7798},{"end":7587,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42634019","source_sha256":"b2470465ea5b60a7a546599eddbd166d368c746526ccf608b88a0bf937f49011","start":7570}],"target_id":"claim.frontier.pmid-42634019","target_kind":"node","target_sha256":"57121252ee440d9fa9aa64ba91c593fe819e4c391abd60a23d078c66ca035850"}],"claim.frontier.pmid-42635434":[{"id":"assertion.claim.frontier.pmid-42635434","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42635434","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42635434 \"Species-specific prophage induction by ciprofloxacin in human gut metagenomes\" (CC BY, first published 2026-08-24) reports: \"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.\"","support":[{"end":3434,"quote":"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":3310},{"end":9011,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":8976},{"end":8765,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42635434","source_sha256":"f17ec600f885b85636a797851f91a72e7d5a6b24a7d5e96861d6922744ae8d70","start":8748}],"target_id":"claim.frontier.pmid-42635434","target_kind":"node","target_sha256":"55931dda8d50d6cefa8b7b6bd1b1b73ba372114022e89373887a1ad736fca159"}],"claim.frontier.pmid-42636257":[{"id":"assertion.claim.frontier.pmid-42636257","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42636257","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42636257 \"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria\" (CC BY, first published 2026-08-24) reports: \"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.\"","support":[{"end":4473,"quote":"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":4200},{"end":7995,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":7960},{"end":7749,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42636257","source_sha256":"2cdb9d10147f4e9dfbbf2a9baefd37929aa518a09941bad6fdaef0ad97aec3bc","start":7732}],"target_id":"claim.frontier.pmid-42636257","target_kind":"node","target_sha256":"ae9744c7b84f83f0a7bf1b4ec157b1c82eeae43c46c009d22ce2cb097315d939"}],"claim.frontier.pmid-42637891":[{"id":"assertion.claim.frontier.pmid-42637891","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42637891","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42637891 \"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches\" (CC BY, first published 2026-08-25) reports: \"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.\"","support":[{"end":4830,"quote":"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":4614},{"end":8013,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":7978},{"end":7719,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42637891","source_sha256":"3004a121426e98bcbcf75d0e11cd856d591e4018110ccd01082d4375148d3ebe","start":7702}],"target_id":"claim.frontier.pmid-42637891","target_kind":"node","target_sha256":"568657959fe5e2e88254fa678437ebb4474a3d4df699b810d83124a3f5b5883c"}],"claim.frontier.pmid-42637977":[{"id":"assertion.claim.frontier.pmid-42637977","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42637977","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42637977 \"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering\" (CC BY, first published 2026-08-24) reports: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","support":[{"end":13154,"quote":"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":12923},{"end":17291,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":17256},{"end":16991,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42637977","source_sha256":"cc9b18e2f677e780965224ebdd17cafdb5e542f17122c0e3e946b5fde5cf2ab9","start":16974}],"target_id":"claim.frontier.pmid-42637977","target_kind":"node","target_sha256":"901beb3bd7563bb6b240e03bd25e888af4fb820d655c85643ef404097077c15c"}],"claim.frontier.pmid-42638898":[{"id":"assertion.claim.frontier.pmid-42638898","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42638898","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42638898 \"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation\" (CC BY, first published 2026-08-10) reports: \"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.\"","support":[{"end":4502,"quote":"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":4250},{"end":8963,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":8928},{"end":8669,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42638898","source_sha256":"9bdad6ec7456265884601d391862131e287dd2e3055c83e6e581a1d1be42a67a","start":8652}],"target_id":"claim.frontier.pmid-42638898","target_kind":"node","target_sha256":"593a2af4eb5be70cb655307b20fb11f5da3ce472b5c706b2e1a14de3f8d08541"}],"claim.frontier.pmid-42639105":[{"id":"assertion.claim.frontier.pmid-42639105","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42639105","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42639105 \"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity\" (CC BY, first published 2026-08-10) reports: \"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.\"","support":[{"end":2716,"quote":"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":2564},{"end":5532,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":5497},{"end":5286,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42639105","source_sha256":"65099ea3cef3abdcb7eeefe351d4e2cb0b40d75b9c1070f69fa46f3d372689aa","start":5269}],"target_id":"claim.frontier.pmid-42639105","target_kind":"node","target_sha256":"921a3d28987c792a964cf3eb577a3455e2c88f93f21bcc3c43025e65e7b4a4f2"}],"claim.frontier.pmid-42644024":[{"id":"assertion.claim.frontier.pmid-42644024","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42644024","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42644024 \"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.\"","support":[{"end":4382,"quote":"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":4267},{"end":7240,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":7205},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42644024","source_sha256":"44714a82e19f8d81bea58bb6eaefe9f0abfc146439608c9e41a306a2eb2c06fe","start":6928}],"target_id":"claim.frontier.pmid-42644024","target_kind":"node","target_sha256":"b9a4af3ac9215e678bbe212c7e0ece8d0b3c7924d5bc05fe21c502ef9e756388"}],"claim.frontier.pmid-42646326":[{"id":"assertion.claim.frontier.pmid-42646326","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42646326","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42646326 \"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model\" (CC BY, first published 2026-08-19) reports: \"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.\"","support":[{"end":8367,"quote":"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":8155},{"end":12333,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":12298},{"end":12039,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42646326","source_sha256":"a93a1323a94d5e518d6cf6490623a30e868890ef016432dd9cc550cb8a209173","start":12022}],"target_id":"claim.frontier.pmid-42646326","target_kind":"node","target_sha256":"4fb37afae896dc3b463d320f5e72ed8d2b30addb451f6228b9f93d8c18baa127"}],"claim.frontier.pmid-42649901":[{"id":"assertion.claim.frontier.pmid-42649901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42649901","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42649901 \"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions\" (CC BY, first published 2026-08-11) reports: \"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.\"","support":[{"end":2190,"quote":"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":2007},{"end":6419,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":6384},{"end":6119,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42649901","source_sha256":"b6be2410316b08b1403058ab817c05b7c4781867cd0548224a39ed6590229617","start":6102}],"target_id":"claim.frontier.pmid-42649901","target_kind":"node","target_sha256":"2a892878334761690a2c134f1ea0a2507f00dec7c78eee4e4c5ff2092dbc6f58"}],"claim.frontier.pmid-42650730":[{"id":"assertion.claim.frontier.pmid-42650730","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42650730","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42650730 \"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection\" (CC BY, first published 2026-08-18) reports: \"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.\"","support":[{"end":3225,"quote":"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":2987},{"end":6450,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":6415},{"end":6156,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42650730","source_sha256":"a894e22435ea4b868dfd8824bf28318882ce45b6a80bc5e54f2992394a33613d","start":6139}],"target_id":"claim.frontier.pmid-42650730","target_kind":"node","target_sha256":"8f5335f25e0b4d13371c28956cb373a8c828ab78a577ef15de10a22ae32c95e6"}],"claim.frontier.pmid-42651394":[{"id":"assertion.claim.frontier.pmid-42651394","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42651394","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42651394 \"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide\" (CC BY, first published 2026-08-19) reports: \"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.\"","support":[{"end":5021,"quote":"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":4824},{"end":7379,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":7344},{"end":7085,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42651394","source_sha256":"e621ba97838d947cba3126aef945cde5c41e0c06c9665a3276a5e2b174a62cb7","start":7068}],"target_id":"claim.frontier.pmid-42651394","target_kind":"node","target_sha256":"08fb2a975f4b291d14d919fad513b00b2d2b8f8d638df82dea9fb43bf02321be"}],"claim.frontier.pmid-42651890":[{"id":"assertion.claim.frontier.pmid-42651890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42651890","quantifiers":"Only what the quoted sentence states","time":"2026-08-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42651890 \"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats\" (CC BY, first published 2026-08-10) reports: \"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.\"","support":[{"end":5020,"quote":"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":4841},{"end":6541,"quote":"\"firstPublicationDate\":\"2026-08-10\"","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":6506},{"end":6240,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42651890","source_sha256":"6213fe83bc6a62a291f7e984638e2b8bfc3a3c7e1cc9cda01b961d177a7ebce2","start":6223}],"target_id":"claim.frontier.pmid-42651890","target_kind":"node","target_sha256":"7f0b6093ad9e615e071c92d156720af49b84912119ccf13aeff9bab79e4df31d"}],"claim.frontier.pmid-42652200":[{"id":"assertion.claim.frontier.pmid-42652200","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652200","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652200 \"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer\" (CC BY, first published 2026-08-13) reports: \"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).\"","support":[{"end":9568,"quote":"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":9404},{"end":11938,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":11903},{"end":11644,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652200","source_sha256":"d82e81facc67bca633c568a48d4bb7091638dbff6398e0e8bd253a95588fc485","start":11627}],"target_id":"claim.frontier.pmid-42652200","target_kind":"node","target_sha256":"048f9436ec8c550431b4326ff662a795d38c01104348f26c1c28b04dc2cc36fb"}],"claim.frontier.pmid-42652430":[{"id":"assertion.claim.frontier.pmid-42652430","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652430","quantifiers":"Only what the quoted sentence states","time":"2026-07-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652430 \"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation\" (CC BY, first published 2026-07-27) reports: \"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.\"","support":[{"end":3742,"quote":"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":3616},{"end":5520,"quote":"\"firstPublicationDate\":\"2026-07-27\"","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":5485},{"end":5220,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652430","source_sha256":"24a9dcf4c599aced004cc5368d9c3bdc6aaa5b9b81cc86e1ba31270933274b72","start":5203}],"target_id":"claim.frontier.pmid-42652430","target_kind":"node","target_sha256":"efc8707d1866a3f19137e739426ee40018fdc3a26110ddec131a514a2d050e31"}],"claim.frontier.pmid-42652751":[{"id":"assertion.claim.frontier.pmid-42652751","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42652751","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42652751 \"Psychological Factors to Consider in Treating Patients with Acne Vulgaris\" (CC BY, first published 2026-08-17) reports: \"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.\"","support":[{"end":4179,"quote":"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":3936},{"end":6674,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":6639},{"end":6380,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42652751","source_sha256":"1e880eeeb89387bec806813a86a419788400fc8e2769bcbab4e4ac87d2d9adf4","start":6363}],"target_id":"claim.frontier.pmid-42652751","target_kind":"node","target_sha256":"68105e08e69cb479a842e5886ecd74c477e75e7aafc447e18bd22b5592865ec1"}],"claim.frontier.pmid-42653506":[{"id":"assertion.claim.frontier.pmid-42653506","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42653506","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42653506 \"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features\" (CC BY, first published 2026-08-21) reports: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","support":[{"end":5215,"quote":"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":5096},{"end":8175,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":8140},{"end":7929,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42653506","source_sha256":"fa54d1c452c53274555a59b7e7032be860f5298df8fc0384e062b3c2215ee6b4","start":7912}],"target_id":"claim.frontier.pmid-42653506","target_kind":"node","target_sha256":"0d30d6564668f354c7ea1b22ee2d50ed5cee914a15c309606e142b0be1699265"}],"claim.frontier.pmid-42654288":[{"id":"assertion.claim.frontier.pmid-42654288","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42654288","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42654288 \"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey\" (CC BY, first published 2026-08-19) reports: \"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.\"","support":[{"end":10815,"quote":"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":10672},{"end":17704,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":17669},{"end":17410,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42654288","source_sha256":"81818154d44364d48f2cd0a4dd21ad9177d3713cd26a50f1e7f15200988cb23d","start":17393}],"target_id":"claim.frontier.pmid-42654288","target_kind":"node","target_sha256":"7ff5227c16060b7c1ccdff9e013d9f6d73480fe280c5e4e9b3e1a9fd6156f96e"}],"claim.frontier.pmid-42656460":[{"id":"assertion.claim.frontier.pmid-42656460","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656460","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656460 \"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming\" (CC BY, first published 2026-08-12) reports: \"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.\"","support":[{"end":5886,"quote":"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":5724},{"end":9132,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":9097},{"end":8838,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656460","source_sha256":"26ca2c1b962ad1a31d2f3e20ddcbb17b36199981afc003373b8f20653ee17bc5","start":8821}],"target_id":"claim.frontier.pmid-42656460","target_kind":"node","target_sha256":"7dd660048f53cbcdde7fb15e863bc2324b1b52a9b7feda7f7f58e6dab5a10a7d"}],"claim.frontier.pmid-42656481":[{"id":"assertion.claim.frontier.pmid-42656481","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656481","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656481 \"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis\" (CC BY, first published 2026-08-12) reports: \"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.\"","support":[{"end":2518,"quote":"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":2409},{"end":5136,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":5101},{"end":4890,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656481","source_sha256":"854eed73f64bf980a3dae5e8fbf1830257e11b30726194870c10e52cbfc1df02","start":4873}],"target_id":"claim.frontier.pmid-42656481","target_kind":"node","target_sha256":"fed81a774c6d3c318fb1a26db35b7e211499abafeb5008bd0f9768a1e2fc4c77"}],"claim.frontier.pmid-42656672":[{"id":"assertion.claim.frontier.pmid-42656672","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42656672","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42656672 \"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population\" (CC BY, first published 2026-08-12) reports: \"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.\"","support":[{"end":3592,"quote":"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":3448},{"end":5746,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":5711},{"end":5452,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42656672","source_sha256":"7f87a07cdeb06494097e8ba4cdac567c9576f881b935b06a4414b80279d01777","start":5435}],"target_id":"claim.frontier.pmid-42656672","target_kind":"node","target_sha256":"14ed024a54055c55f7fb1f1d6880c419c2c609f01da5890ec767ebd1082d2de2"}],"claim.frontier.pmid-42657744":[{"id":"assertion.claim.frontier.pmid-42657744","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42657744","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42657744 \"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species\" (CC BY, first published 2026-09-01) reports: \"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.\"","support":[{"end":5983,"quote":"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":5817},{"end":8285,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":8250},{"end":8005,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42657744","source_sha256":"4f80e6f3568eaa55355fe94f3253bb6b910c5ce14ac1ba8494004b6f36d940ca","start":7988}],"target_id":"claim.frontier.pmid-42657744","target_kind":"node","target_sha256":"1b8c1a42a83155083f78145565d8a21d5e74dcbc589938e3dcf39850a3d09682"}],"claim.frontier.pmid-42657789":[{"id":"assertion.claim.frontier.pmid-42657789","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42657789","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42657789 \"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies\" (CC BY, first published 2026-09-01) reports: \"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.\"","support":[{"end":3278,"quote":"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":3163},{"end":7298,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":7263},{"end":7093,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42657789","source_sha256":"9511865a60352ce651795ed87d8fed66c850ff944c499591648a425ed0724ff8","start":7076}],"target_id":"claim.frontier.pmid-42657789","target_kind":"node","target_sha256":"0dd24f66f7a18fc8d0fd3d8e5f9d9034b9b3986ab9156227257c0c6d502fbe78"}],"claim.frontier.pmid-42658813":[{"id":"assertion.claim.frontier.pmid-42658813","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42658813","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42658813 \"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops\" (CC BY, first published 2026-08-27) reports: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","support":[{"end":4850,"quote":"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":4477},{"end":8296,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":8261},{"end":8002,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42658813","source_sha256":"0c779680eff31f3c50a091b3f951ae91f6ba4079e6ff8e9293b5303ff81d772d","start":7985}],"target_id":"claim.frontier.pmid-42658813","target_kind":"node","target_sha256":"f02df9d5d0ff05b917a3076d5bd387f3d89cd065fd816f82f2f0f7ccad539d14"}],"claim.frontier.pmid-42661048":[{"id":"assertion.claim.frontier.pmid-42661048","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661048","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661048 \"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST\" (CC BY, first published 2026-08-27) reports: \"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.\"","support":[{"end":3325,"quote":"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":3137},{"end":6567,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":6532},{"end":6273,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661048","source_sha256":"fca12cfdcf6b4fcd5dbcc8485b6ce0d545621990f8ebb7f40b59fa86118f252a","start":6256}],"target_id":"claim.frontier.pmid-42661048","target_kind":"node","target_sha256":"b4af8327d236afffb71e6697a3b91dc3bca355ea8f23ae7db17e9905700e28b7"}],"claim.frontier.pmid-42661611":[{"id":"assertion.claim.frontier.pmid-42661611","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661611","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661611 \"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy\" (CC BY, first published 2026-08-28) reports: \"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.\"","support":[{"end":4905,"quote":"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":4696},{"end":6936,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":6901},{"end":6644,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661611","source_sha256":"f44411e920993a39cdae1c8f7f81f76b97eae598fd3bb1c8a0b92e0dd1577c8b","start":6627}],"target_id":"claim.frontier.pmid-42661611","target_kind":"node","target_sha256":"c63463543242712b381bb63da12efac889f4d94a3d5b3a651984ff0419cc6b64"}],"claim.frontier.pmid-42661658":[{"id":"assertion.claim.frontier.pmid-42661658","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661658","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661658 \"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa\" (CC BY, first published 2026-08-13) reports: \"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.\"","support":[{"end":3829,"quote":"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":3651},{"end":9994,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":9959},{"end":9748,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661658","source_sha256":"fa38a1c15372b5d038a9acb008c72155b05152f059f4eadd7235a6900210117a","start":9731}],"target_id":"claim.frontier.pmid-42661658","target_kind":"node","target_sha256":"5ee78e849b2d266b9fa943884e386dc62145df106e7a0eb8fdc6154bae2a22f4"}],"claim.frontier.pmid-42661822":[{"id":"assertion.claim.frontier.pmid-42661822","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42661822","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42661822 \"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome\" (CC BY, first published 2026-08-13) reports: \"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.\"","support":[{"end":3383,"quote":"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":3134},{"end":6891,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":6856},{"end":6597,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42661822","source_sha256":"e3a30a239b04bad227ba38f140c3476c5086fc049b0af34019230b9e8c09a7b2","start":6580}],"target_id":"claim.frontier.pmid-42661822","target_kind":"node","target_sha256":"5d0ca139f6dd118c3d0a58b890b2c32d27c4144e3236416d58989e47c81baa1d"}],"claim.frontier.pmid-42663084":[{"id":"assertion.claim.frontier.pmid-42663084","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42663084","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42663084 \"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution\" (CC BY, first published 2026-09-01) reports: \"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.\"","support":[{"end":5645,"quote":"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":5457},{"end":9068,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":9033},{"end":8815,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42663084","source_sha256":"7381f633642606a7ea08e1aa4c60c9d550e7b1be5f3fbf615392243caf35c480","start":8798}],"target_id":"claim.frontier.pmid-42663084","target_kind":"node","target_sha256":"62f3fb9572b78b5d7795f3351598f029f9044545c1db0eee94864db6f8c88729"}],"claim.frontier.pmid-42664264":[{"id":"assertion.claim.frontier.pmid-42664264","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42664264","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42664264 \"Ecological theory sheds light on plasmid diversity and dynamics\" (CC BY, first published 2026-08-28) reports: \"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.\"","support":[{"end":4028,"quote":"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":3827},{"end":6708,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":6673},{"end":6414,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42664264","source_sha256":"5d625c823186f638880cc0c8813f0e594e3789fb972e5ac6018fab827819eb39","start":6397}],"target_id":"claim.frontier.pmid-42664264","target_kind":"node","target_sha256":"48bfcd759005b33d22421275300fd9aeea5ca2278f65af86ff36627ddd277e42"}],"claim.frontier.pmid-42665853":[{"id":"assertion.claim.frontier.pmid-42665853","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42665853","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42665853 \"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort\" (CC BY, first published 2026-08-28) reports: \"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.\"","support":[{"end":7803,"quote":"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":7645},{"end":9318,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":9283},{"end":9024,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42665853","source_sha256":"fad7fec05d6664441c1a5102a61cf73e46fa2bbe3b42df05156d0c046ce320c5","start":9007}],"target_id":"claim.frontier.pmid-42665853","target_kind":"node","target_sha256":"cdf661d9bd6df4705ca434e1b306cf4a5ae8fce204430c01e4f662a8eed97340"}],"claim.frontier.pmid-42666182":[{"id":"assertion.claim.frontier.pmid-42666182","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42666182","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42666182 \"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report\" (CC BY, first published 2026-08-14) reports: \"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.\"","support":[{"end":2160,"quote":"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":1993},{"end":5310,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":5275},{"end":5016,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42666182","source_sha256":"220fb6bf7ab683b321787e85099da72e7f526bad9837addd6ed934729ae32b1a","start":4999}],"target_id":"claim.frontier.pmid-42666182","target_kind":"node","target_sha256":"a5224f81d9d67cabbc1ef26c7f1854fa7ecec2eddf09c70cf6a70f0929600a8e"}],"claim.frontier.pmid-42668719":[{"id":"assertion.claim.frontier.pmid-42668719","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42668719","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42668719 \"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient\" (CC BY, first published 2026-08-29) reports: \"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.\"","support":[{"end":8007,"quote":"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":7888},{"end":10274,"quote":"\"firstPublicationDate\":\"2026-08-29\"","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":10239},{"end":9980,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42668719","source_sha256":"19ee208ae5a9747172e159911d9cf745b8926070dc39feb26cec573c28c07c8c","start":9963}],"target_id":"claim.frontier.pmid-42668719","target_kind":"node","target_sha256":"f5c06142a7cb8cc934fd4b8a2005811f8eca397d68fad77705753823a248c9a1"}],"claim.frontier.pmid-42670810":[{"id":"assertion.claim.frontier.pmid-42670810","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42670810","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42670810 \"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance\" (CC BY, first published 2026-09-01) reports: \"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.\"","support":[{"end":4483,"quote":"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":4213},{"end":8528,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":8493},{"end":8275,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42670810","source_sha256":"08d263d8fd4535bae69a0e849135957568c60699491d58576c4a9742de44220c","start":8258}],"target_id":"claim.frontier.pmid-42670810","target_kind":"node","target_sha256":"adfad24a21b074342dfbb6c5b0b6753e8bc54ca5606887da36370346fa94b925"}],"claim.frontier.pmid-42672060":[{"id":"assertion.claim.frontier.pmid-42672060","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42672060","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42672060 \"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh\" (CC BY, first published 2026-08-31) reports: \"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.\"","support":[{"end":7185,"quote":"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":6965},{"end":10664,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":10629},{"end":10370,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42672060","source_sha256":"1feb84b73b3aa8506be6771c7d66a5ff3ff3f5e053341ddd1353f711ebbd7ae8","start":10353}],"target_id":"claim.frontier.pmid-42672060","target_kind":"node","target_sha256":"f507a8df8037f00b666d2546737dfc30453c659dab33e8d2e0710349dee61539"}],"claim.frontier.pmid-42674467":[{"id":"assertion.claim.frontier.pmid-42674467","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42674467","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42674467 \"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil\" (CC BY, first published 2026-08-31) reports: \"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).\"","support":[{"end":6928,"quote":"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":6664},{"end":9856,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":9821},{"end":9610,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42674467","source_sha256":"1eb4542d73c84fca3856b5cb6203d79f0ca987a7d61d9cffbdaf60efc8d7d767","start":9593}],"target_id":"claim.frontier.pmid-42674467","target_kind":"node","target_sha256":"5b0cdc877ed6777b592b424051085306c886f4722cfdc4e198444fc593eae40f"}],"claim.frontier.pmid-42676491":[{"id":"assertion.claim.frontier.pmid-42676491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42676491","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42676491 \"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis\" (CC BY, first published 2026-08-17) reports: \"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.\"","support":[{"end":5375,"quote":"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":5245},{"end":7655,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":7620},{"end":7409,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42676491","source_sha256":"2214c18ae91264aec7b12ceca7575443df12efe21fdc194ac1c198d6e882894d","start":7392}],"target_id":"claim.frontier.pmid-42676491","target_kind":"node","target_sha256":"0f84a3d65d990b9be0297bf2422d1bd17cc397783ff54042eb64fead9e1a50ff"}],"claim.frontier.pmid-42682491":[{"id":"assertion.claim.frontier.pmid-42682491","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42682491","quantifiers":"Only what the quoted sentence states","time":"2026-08-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42682491 \"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort\" (CC BY, first published 2026-08-18) reports: \"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.\"","support":[{"end":3950,"quote":"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":3854},{"end":6672,"quote":"\"firstPublicationDate\":\"2026-08-18\"","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":6637},{"end":6426,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42682491","source_sha256":"ff7bf16f2e503eb0c9b7dbaf9b8fff2e148471e20fbeba78a209f920b3765ee6","start":6409}],"target_id":"claim.frontier.pmid-42682491","target_kind":"node","target_sha256":"ea970fcb44afe2511d0f5f90efaf90d91995c36f7c1908a2f30da753ee1795d5"}],"claim.frontier.pmid-42684341":[{"id":"assertion.claim.frontier.pmid-42684341","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42684341","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42684341 \"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial\" (CC BY, first published 2026-08-27) reports: \"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.\"","support":[{"end":5250,"quote":"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":5031},{"end":8630,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":8595},{"end":8336,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42684341","source_sha256":"ec4bbd323256f6f75ce7596f875e308527d8672ea75265ab3f079d63da38cd4f","start":8319}],"target_id":"claim.frontier.pmid-42684341","target_kind":"node","target_sha256":"849a0970789a650cf0dfee957024e054f13be03a6b63a43eb8ddf51abd2138b5"}],"claim.frontier.pmid-42685061":[{"id":"assertion.claim.frontier.pmid-42685061","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42685061","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42685061 \"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study\" (CC BY, first published 2026-09-02) reports: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","support":[{"end":2922,"quote":"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":2817},{"end":8306,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":8271},{"end":8012,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42685061","source_sha256":"93ed8f60920cf58c593c7406d672555c9e17657dcf8a66bef76712f5ef1c94bb","start":7995}],"target_id":"claim.frontier.pmid-42685061","target_kind":"node","target_sha256":"e26894e7946baf5d7e4352f40eac122475ff554eb416687fdc4856f546a7a099"}],"claim.frontier.pmid-42687189":[{"id":"assertion.claim.frontier.pmid-42687189","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42687189","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42687189 \"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis\" (CC BY, first published 2026-09-02) reports: \"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.\"","support":[{"end":10138,"quote":"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":9931},{"end":11475,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":11440},{"end":11229,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42687189","source_sha256":"f81d5ec5c38d7697d55830c311ea24d83de18c11f05e1e871d2a462d54a5cc18","start":11212}],"target_id":"claim.frontier.pmid-42687189","target_kind":"node","target_sha256":"b035f1d18b32ec1b52b8c8af12da8729ebf719f79ec8050925a2f911a374ed19"}],"claim.frontier.pmid-42687444":[{"id":"assertion.claim.frontier.pmid-42687444","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42687444","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42687444 \"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain\" (CC BY, first published 2026-09-01) reports: \"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.\"","support":[{"end":2904,"quote":"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":2751},{"end":8763,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":8728},{"end":8558,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42687444","source_sha256":"c3a1f573e8c54e70db468dacf3e97ee684e4dbe323dbea62f917cec9eec3ac51","start":8541}],"target_id":"claim.frontier.pmid-42687444","target_kind":"node","target_sha256":"a171010845e74d19cddcd9bae1fc8b03b348bf9788fae0f7b0e8f0ffeba8e1e7"}],"claim.frontier.pmid-42688865":[{"id":"assertion.claim.frontier.pmid-42688865","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42688865","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42688865 \"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review\" (CC BY, first published 2026-09-02) reports: \"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.\"","support":[{"end":2647,"quote":"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":2438},{"end":5348,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":5313},{"end":5054,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42688865","source_sha256":"de2591bca95af393999e3296ae740d8554f5348428959d383040a404f6f4a3e0","start":5037}],"target_id":"claim.frontier.pmid-42688865","target_kind":"node","target_sha256":"006dee8315aa41a88939b189180a249875162b00eaacb39d8da5aee29070716e"}],"claim.frontier.pmid-42688919":[{"id":"assertion.claim.frontier.pmid-42688919","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42688919","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42688919 \"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report\" (CC BY, first published 2026-09-02) reports: \"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.\"","support":[{"end":3800,"quote":"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":3585},{"end":6340,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":6305},{"end":6094,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42688919","source_sha256":"687fd41af3cabe0c5c80924fc6f62185c5bc80b04456522c9570aaf5e61044ab","start":6077}],"target_id":"claim.frontier.pmid-42688919","target_kind":"node","target_sha256":"5acd8d6fe7a7a64c1bfc507a3ff63f0cad3fd250e992aff7fc9b24b357687efd"}],"claim.frontier.pmid-42689122":[{"id":"assertion.claim.frontier.pmid-42689122","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42689122","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42689122 \"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes\" (CC BY, first published 2026-08-19) reports: \"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.\"","support":[{"end":5199,"quote":"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":5001},{"end":7221,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":7186},{"end":6927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42689122","source_sha256":"a38ef3b37e9bdcf6bd54bbcad0ceceed1edc25236a2e6ec16f966dfa579fd747","start":6910}],"target_id":"claim.frontier.pmid-42689122","target_kind":"node","target_sha256":"4727bb4433f4805220824c25037ddbf2d4dc5dd11ddbd6add5ed152d4f13811e"}],"claim.frontier.pmid-42689273":[{"id":"assertion.claim.frontier.pmid-42689273","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42689273","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42689273 \"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice\" (CC BY, first published 2026-08-20) reports: \"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.\"","support":[{"end":3465,"quote":"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":3333},{"end":5300,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":5265},{"end":5006,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42689273","source_sha256":"b0200c8e72a836afd8732e8885811d5538104838241ccc48437c82a705dd73c6","start":4989}],"target_id":"claim.frontier.pmid-42689273","target_kind":"node","target_sha256":"bc9ff6f4f9618108717cbae7564ebeffd1c879badade57800380496304b2c893"}],"claim.frontier.pmid-42694103":[{"id":"assertion.claim.frontier.pmid-42694103","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42694103","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42694103 \"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load\" (CC BY, first published 2026-08-20) reports: \"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.\"","support":[{"end":4332,"quote":"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":4120},{"end":5971,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":5936},{"end":5677,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42694103","source_sha256":"84765e33d26b66753710b36de453b195bba2e18737c51f3b864bc3b05a00ef39","start":5660}],"target_id":"claim.frontier.pmid-42694103","target_kind":"node","target_sha256":"d2f79a00e357a47c5b360b2062cafda4173bbc638bc4af8bba90d7af8c6369d7"}],"claim.frontier.pmid-42694918":[{"id":"assertion.claim.frontier.pmid-42694918","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42694918","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42694918 \"\"What about that violence?\" Transforming the discourse on violence in mental health research and services\" (CC BY, first published 2026-08-20) reports: \"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.\"","support":[{"end":5958,"quote":"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":5781},{"end":7371,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":7336},{"end":7077,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42694918","source_sha256":"91723a0d8ad515586a9c9648192709df57bd029ed9cae08d1debc7d25d5686fa","start":7060}],"target_id":"claim.frontier.pmid-42694918","target_kind":"node","target_sha256":"290e7ce236e20b940cfbc559f2eb512693c3e8b1213f958ab7f284d58c185da4"}],"claim.frontier.pmid-42698113":[{"id":"assertion.claim.frontier.pmid-42698113","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42698113","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42698113 \"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre\" (CC BY, first published 2026-09-04) reports: \"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.\"","support":[{"end":6360,"quote":"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":6245},{"end":8063,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":8028},{"end":7769,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42698113","source_sha256":"c085ae0cd25d1e342c165381ea536ddd776f9baa8ad613f31f9d4fb936df0d57","start":7752}],"target_id":"claim.frontier.pmid-42698113","target_kind":"node","target_sha256":"02f6df8f91e5d72a3ecca6f8324026fac5abe1a8d08fceab26d16c84cfaaaeb7"}],"claim.frontier.pmid-42698454":[{"id":"assertion.claim.frontier.pmid-42698454","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42698454","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42698454 \"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem\" (CC BY, first published 2026-08-21) reports: \"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.\"","support":[{"end":2149,"quote":"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":1958},{"end":6173,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":6138},{"end":5879,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42698454","source_sha256":"a25eb99be08f34ee1f17f451cc1c8010270bda7577d552acb01fdb6b69c2375c","start":5862}],"target_id":"claim.frontier.pmid-42698454","target_kind":"node","target_sha256":"08fec85e961070ed564996179acfa18762dbfa162922200d56af1cd8b70353ae"}],"claim.frontier.pmid-42706664":[{"id":"assertion.claim.frontier.pmid-42706664","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42706664","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42706664 \"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness\" (CC BY, first published 2026-09-01) reports: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","support":[{"end":2427,"quote":"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":2185},{"end":5551,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":5516},{"end":5298,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42706664","source_sha256":"9ec25540c66c549086ed04a25ada9f11ba2745911159eaef43bbb4abbf45a0a7","start":5281}],"target_id":"claim.frontier.pmid-42706664","target_kind":"node","target_sha256":"f92ec5360a7c795cf30b1d769911b48d1b79348f27525c8c59c7856ef8f12d86"}],"claim.frontier.pmid-42707216":[{"id":"assertion.claim.frontier.pmid-42707216","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42707216","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42707216 \"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases\" (CC BY, first published 2026-08-24) reports: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","support":[{"end":2394,"quote":"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":2306},{"end":4621,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":4586},{"end":4375,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42707216","source_sha256":"7655efd1ff7345f2ea5b1c03c625f8d036e2dd58177007c9985911c1f866964f","start":4358}],"target_id":"claim.frontier.pmid-42707216","target_kind":"node","target_sha256":"486daf4ba4d7e6c9bbc3df6ec7fdc89195e7fa33d6afee241a738430cf333020"}],"claim.frontier.pmid-42707529":[{"id":"assertion.claim.frontier.pmid-42707529","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42707529","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42707529 \"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case\" (CC BY, first published 2026-08-24) reports: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","support":[{"end":3392,"quote":"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":3054},{"end":5221,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":5186},{"end":4927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42707529","source_sha256":"8ed2d86b28c8826da3edb4e56e4f9c722ef74467e1c9862c0aabe43bca0acf30","start":4910}],"target_id":"claim.frontier.pmid-42707529","target_kind":"node","target_sha256":"ba7d2ace937dcd39df910f24b73ec174f630fe5eca203980a2013594dd28ec46"}],"claim.frontier.pmid-42708953":[{"id":"assertion.claim.frontier.pmid-42708953","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42708953","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42708953 \"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress\" (CC BY, first published 2026-09-01) reports: \"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.\"","support":[{"end":5849,"quote":"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":5623},{"end":7723,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":7688},{"end":7464,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42708953","source_sha256":"e097f669212127db712c5ef9a567bb2cda3a2f604d9d5ec136e1c6841647c3cf","start":7447}],"target_id":"claim.frontier.pmid-42708953","target_kind":"node","target_sha256":"57199be867646b12d5242e0ede9f21998c57641c5cdf07252f1c80c3f285d4ca"}],"claim.frontier.pmid-42709467":[{"id":"assertion.claim.frontier.pmid-42709467","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709467","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709467 \"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort\" (CC BY, first published 2026-09-01) reports: \"Male sex was associated with treatment escalation.\"","support":[{"end":8194,"quote":"Male sex was associated with treatment escalation.","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":8144},{"end":9519,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":9484},{"end":9314,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709467","source_sha256":"8530b325deb692f90c6addc1dee305d13ce8d244faec80084e7cf99f6d362294","start":9297}],"target_id":"claim.frontier.pmid-42709467","target_kind":"node","target_sha256":"20ad9c86d35dbad1d37621d8719ed2def65a798c17011c8bb4c3a9156c76452d"}],"claim.frontier.pmid-42709851":[{"id":"assertion.claim.frontier.pmid-42709851","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709851","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709851 \"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study\" (CC BY, first published 2026-09-08) reports: \"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.\"","support":[{"end":8109,"quote":"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":7904},{"end":12158,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":12123},{"end":11864,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709851","source_sha256":"feb442c6530d2ce95e5d92c21fef18d7a5ef61b97cc5df17bf523fc5c5c3371c","start":11847}],"target_id":"claim.frontier.pmid-42709851","target_kind":"node","target_sha256":"395147dbc61b63f6803a9d0ec05ed2f3a6fe7350c840b28c184776b516a25428"}],"claim.frontier.pmid-42709861":[{"id":"assertion.claim.frontier.pmid-42709861","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42709861","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42709861 \"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection\" (CC BY, first published 2026-09-08) reports: \"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.\"","support":[{"end":5058,"quote":"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":4905},{"end":9082,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":9047},{"end":8788,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42709861","source_sha256":"f968b019e820daf1afca8bf7da365aa1a9675a5c0bcedd4488168c15125d4ba9","start":8771}],"target_id":"claim.frontier.pmid-42709861","target_kind":"node","target_sha256":"7c41715491a008e83f6166c579107c6ace5075c6f1e5570dc9ecb535932f04ad"}],"claim.frontier.pmid-42712360":[{"id":"assertion.claim.frontier.pmid-42712360","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42712360","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42712360 \"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain\" (CC BY, first published 2026-08-25) reports: \"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.\"","support":[{"end":4643,"quote":"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":4302},{"end":8431,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":8396},{"end":8137,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42712360","source_sha256":"3a9257a605a648c54df12bc2974999410eb314122ad6795ff62285e674e256ab","start":8120}],"target_id":"claim.frontier.pmid-42712360","target_kind":"node","target_sha256":"6d95de8e09af43295134585f16f1b6117c0297d8cda5a6592a7b7a5ddc2e8b8a"}],"claim.frontier.pmid-42713496":[{"id":"assertion.claim.frontier.pmid-42713496","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42713496","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42713496 \"Research advances in hypertriglyceridemia-induced acute pancreatitis\" (CC BY, first published 2026-08-25) reports: \"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.\"","support":[{"end":1760,"quote":"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":1526},{"end":4734,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":4699},{"end":4440,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42713496","source_sha256":"0a2c7c8b188dbc121574a36ee0c49bc54066d27a9751db1898583e92e7cb353e","start":4423}],"target_id":"claim.frontier.pmid-42713496","target_kind":"node","target_sha256":"05c354c6074a2fe3a1fea06a7ad061429762b48c58056a98f0ffb45eafebf090"}],"claim.frontier.pmid-42718586":[{"id":"assertion.claim.frontier.pmid-42718586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42718586","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42718586 \"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma\" (CC BY, first published 2026-08-26) reports: \"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.\"","support":[{"end":4267,"quote":"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":4135},{"end":10170,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":10135},{"end":9876,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42718586","source_sha256":"afe4085925a426ae9e36d42a93721ad48a330e743621c9e0a0bdaf97cd2d6dde","start":9859}],"target_id":"claim.frontier.pmid-42718586","target_kind":"node","target_sha256":"8c1363d25511eaba65af410c3dc6313ecc8e816667f0eb7426f4dc7a62903803"}],"claim.frontier.pmid-42719040":[{"id":"assertion.claim.frontier.pmid-42719040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719040","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719040 \"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance\" (CC BY, first published 2026-08-26) reports: \"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.\"","support":[{"end":2751,"quote":"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":2575},{"end":4758,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":4723},{"end":4464,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719040","source_sha256":"dc90be0186eb39ae4744893ab576f484ec7afd56333d75cc6dae3a17c4c1103a","start":4447}],"target_id":"claim.frontier.pmid-42719040","target_kind":"node","target_sha256":"518bb8e53a17f714632258cd79bea8723b1167626ed26faaf1e90c440d4ae0a2"}],"claim.frontier.pmid-42719051":[{"id":"assertion.claim.frontier.pmid-42719051","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719051","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719051 \"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives\" (CC BY, first published 2026-08-26) reports: \"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.\"","support":[{"end":3549,"quote":"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":3400},{"end":5415,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":5380},{"end":5121,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719051","source_sha256":"8f3db6f34484096ed26f5bd5898697ae364db70e53c033e292157e71c8d5ddc1","start":5104}],"target_id":"claim.frontier.pmid-42719051","target_kind":"node","target_sha256":"69399443261734a8ad78045d143caef31e83d3f6dde2d7d036da5fea3071bea5"}],"claim.frontier.pmid-42719160":[{"id":"assertion.claim.frontier.pmid-42719160","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42719160","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42719160 \"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students\" (CC BY, first published 2026-08-26) reports: \"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.\"","support":[{"end":3746,"quote":"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":3529},{"end":5186,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":5151},{"end":4892,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42719160","source_sha256":"b906b3f5795e754d23cac49b5c5eabf879cb089b700a231edcfecad225396c1d","start":4875}],"target_id":"claim.frontier.pmid-42719160","target_kind":"node","target_sha256":"b3cef8608b30adea0f8f5cb6a5fa45392ae356a1d7f529fa7a99b69c437a63bd"}],"claim.frontier.pmid-42721128":[{"id":"assertion.claim.frontier.pmid-42721128","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721128","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721128 \"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops\" (CC BY, first published 2026-09-10) reports: \"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.\"","support":[{"end":4920,"quote":"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":4696},{"end":6848,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":6813},{"end":6554,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721128","source_sha256":"2320d154a1b42d27e45c6ed34a59b5d6e2e72208b0289b5ced3f28ec1d97d031","start":6537}],"target_id":"claim.frontier.pmid-42721128","target_kind":"node","target_sha256":"e5c16bd8ff13d31d0ef7b86b01bc6f1cd106fe481c245ec1cb52160859bdac84"}],"claim.frontier.pmid-42721140":[{"id":"assertion.claim.frontier.pmid-42721140","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721140","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721140 \"Grey voters and populist voting. The role of religiosity and national collective narcissism\" (CC BY, first published 2026-09-10) reports: \"We also found religious faith to be a stronger predictor of populist voting than religious practice.\"","support":[{"end":2596,"quote":"We also found religious faith to be a stronger predictor of populist voting than religious practice.","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":2496},{"end":4532,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":4497},{"end":4238,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721140","source_sha256":"0e706d895aea08e709cfbd823f6d8a6d0f68cd941a351cf8fc0d7f2bd2df1f2f","start":4221}],"target_id":"claim.frontier.pmid-42721140","target_kind":"node","target_sha256":"c64549fd4b637a1e156df5eec0de50d44898af2e8eec74667d772c61a1efda52"}],"claim.frontier.pmid-42721148":[{"id":"assertion.claim.frontier.pmid-42721148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721148","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721148 \"Care network types and depression among people with cognitive impairment: A latent class analysis\" (CC BY, first published 2026-09-10) reports: \"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.\"","support":[{"end":3556,"quote":"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":3359},{"end":6505,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":6470},{"end":6211,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721148","source_sha256":"df219efc54bc469e1d37245632a9fcfaafcbc5d3b2b42208ecab5cbd0e6b98b8","start":6194}],"target_id":"claim.frontier.pmid-42721148","target_kind":"node","target_sha256":"b41ff092077845ff46a7a11d7817b3b237fa78daed3a76b90800670a2567b9fe"}],"claim.frontier.pmid-42721180":[{"id":"assertion.claim.frontier.pmid-42721180","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721180","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721180 \"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis\" (CC BY, first published 2026-09-10) reports: \"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.\"","support":[{"end":5025,"quote":"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":4718},{"end":8372,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":8337},{"end":8126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721180","source_sha256":"4d1ec209ac4f767e3471066e2fe1878bb026daf5f1dcf13dcefdf97396773cb7","start":8109}],"target_id":"claim.frontier.pmid-42721180","target_kind":"node","target_sha256":"e5b3cc471a1a78aa6a5b9570e0e6b4b087913b42ddcdb62221632d5f021b46c8"}],"claim.frontier.pmid-42721209":[{"id":"assertion.claim.frontier.pmid-42721209","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42721209","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42721209 \"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study\" (CC BY, first published 2026-09-10) reports: \"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.\"","support":[{"end":3155,"quote":"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":2933},{"end":5642,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":5607},{"end":5348,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42721209","source_sha256":"d47fcc489c1defbb9e98611924e9dc47412e95b10560f70d491b111e984b7d45","start":5331}],"target_id":"claim.frontier.pmid-42721209","target_kind":"node","target_sha256":"163389a73dda55a8db61fb0b59999e3cff8ea046b874764a72bf24baa178b3f7"}],"claim.frontier.pmid-42723771":[{"id":"assertion.claim.frontier.pmid-42723771","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42723771","quantifiers":"Only what the quoted sentence states","time":"2026-07-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42723771 \"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment\" (CC BY, first published 2026-07-23) reports: \"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.\"","support":[{"end":4025,"quote":"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":3896},{"end":6007,"quote":"\"firstPublicationDate\":\"2026-07-23\"","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":5972},{"end":5713,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42723771","source_sha256":"ec0076e166c220e2997766e261a645d918f6659c28a3068ff45f247bace8b1d1","start":5696}],"target_id":"claim.frontier.pmid-42723771","target_kind":"node","target_sha256":"d2ecbb765c3e7b74c62f93e9459a4ecd5336dc0f2b6f0a9ba571127b9117b174"}],"claim.frontier.pmid-42724033":[{"id":"assertion.claim.frontier.pmid-42724033","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42724033","quantifiers":"Only what the quoted sentence states","time":"2026-08-27","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42724033 \"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance\" (CC BY, first published 2026-08-27) reports: \"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.\"","support":[{"end":3326,"quote":"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":3150},{"end":5372,"quote":"\"firstPublicationDate\":\"2026-08-27\"","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":5337},{"end":5126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42724033","source_sha256":"b243446906d94e0e95e4212f44ddcfbc2188da4a31c45ca7823be0a1254a908f","start":5109}],"target_id":"claim.frontier.pmid-42724033","target_kind":"node","target_sha256":"5c8ef1175657c521182b6337d373610665f8c0885c6527f44cbbdec1385a968a"}],"claim.frontier.pmid-42725211":[{"id":"assertion.claim.frontier.pmid-42725211","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42725211","quantifiers":"Only what the quoted sentence states","time":"2026-08-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42725211 \"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.\"","support":[{"end":2065,"quote":"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":1920},{"end":4939,"quote":"\"firstPublicationDate\":\"2026-08-11\"","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":4904},{"end":4693,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42725211","source_sha256":"3c5c541d8a2655e174f1b2c323b94cce1cb4923a1398784507b5abe9d3d5e55a","start":4676}],"target_id":"claim.frontier.pmid-42725211","target_kind":"node","target_sha256":"e68d39f3fcf654a202f4536e15750c093535f8948a7f1e39793f3629e8bc5a31"}],"claim.frontier.pmid-42725296":[{"id":"assertion.claim.frontier.pmid-42725296","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42725296","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42725296 \"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia\" (CC BY, first published 2026-09-10) reports: \"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.\"","support":[{"end":5113,"quote":"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":4992},{"end":7174,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":7139},{"end":6868,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42725296","source_sha256":"dd9b2d442a64ba8301f798c62d761a016a816a8be04ba4c172733104cc662209","start":6851}],"target_id":"claim.frontier.pmid-42725296","target_kind":"node","target_sha256":"7c5d4a1f693b2590ff9b5614a3f60c17add4d0fa2d2f50d18fbf9217ab5d2904"}],"claim.frontier.pmid-42726368":[{"id":"assertion.claim.frontier.pmid-42726368","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42726368","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42726368 \"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk\" (CC BY, first published 2026-09-11) reports: \"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.\"","support":[{"end":7373,"quote":"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":7120},{"end":10562,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":10527},{"end":10268,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42726368","source_sha256":"60c0483f59a9a748122b7c720b029688ccf72a1c2b571d67ad7e7b98abdc0549","start":10251}],"target_id":"claim.frontier.pmid-42726368","target_kind":"node","target_sha256":"ec8ca6c6eb23ee5d097a6bc758b0f26e8ba8d2d001d231d24284c97e97c15d79"}],"claim.frontier.pmid-42726890":[{"id":"assertion.claim.frontier.pmid-42726890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42726890","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42726890 \"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex\" (CC BY, first published 2026-09-11) reports: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","support":[{"end":3832,"quote":"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":3517},{"end":7087,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":7052},{"end":6841,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42726890","source_sha256":"f4c7c560ad96860ba7d8195c035498efff0c501c27c564019fcffd6777d683af","start":6824}],"target_id":"claim.frontier.pmid-42726890","target_kind":"node","target_sha256":"2632e28ba45a92c1b8a5434f2fc17a6465e11c575897f556063357692429b4f5"}],"claim.frontier.pmid-42728921":[{"id":"assertion.claim.frontier.pmid-42728921","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728921","quantifiers":"Only what the quoted sentence states","time":"2026-08-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728921 \"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector\" (CC BY, first published 2026-08-08) reports: \"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.\"","support":[{"end":3616,"quote":"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":3266},{"end":6536,"quote":"\"firstPublicationDate\":\"2026-08-08\"","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":6501},{"end":6242,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728921","source_sha256":"8a88c11b9828d891142434111034986c46533606fb9b0dd0aadf6ea791bb4853","start":6225}],"target_id":"claim.frontier.pmid-42728921","target_kind":"node","target_sha256":"d7f203f06a31c0115e6f3165e458a203e2403a167e36a9435fc6935df6f08d95"}],"claim.frontier.pmid-42728923":[{"id":"assertion.claim.frontier.pmid-42728923","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728923","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728923 \"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education\" (CC BY, first published 2026-08-19) reports: \"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.\"","support":[{"end":3804,"quote":"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":3675},{"end":6540,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":6505},{"end":6246,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728923","source_sha256":"6d9533b9f4630a187029a499af8fb510f872233a10127342e30aff0f9054907d","start":6229}],"target_id":"claim.frontier.pmid-42728923","target_kind":"node","target_sha256":"1cdd7398d3f95c84e9e86260acf694013eacda74b5f73964f28680cef906ea93"}],"claim.frontier.pmid-42728936":[{"id":"assertion.claim.frontier.pmid-42728936","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728936","quantifiers":"Only what the quoted sentence states","time":"2026-08-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728936 \"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas\" (CC BY, first published 2026-08-22) reports: \"Our results reveal that fungal and bacterial communities responded differently to land-use management.\"","support":[{"end":5198,"quote":"Our results reveal that fungal and bacterial communities responded differently to land-use management.","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":5096},{"end":7495,"quote":"\"firstPublicationDate\":\"2026-08-22\"","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":7460},{"end":7201,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728936","source_sha256":"dcf89437a36a33e4e841ea8d5f4b3eb6912767868ab79c7f7bde07b6e1229f3e","start":7184}],"target_id":"claim.frontier.pmid-42728936","target_kind":"node","target_sha256":"271fb79224ea70486766d050272db423fed6de898988487f5d2f7d960b885d30"}],"claim.frontier.pmid-42728996":[{"id":"assertion.claim.frontier.pmid-42728996","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42728996","quantifiers":"Only what the quoted sentence states","time":"2026-08-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42728996 \"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy\" (CC BY, first published 2026-08-14) reports: \"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.\"","support":[{"end":3215,"quote":"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":3046},{"end":5932,"quote":"\"firstPublicationDate\":\"2026-08-14\"","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":5897},{"end":5638,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42728996","source_sha256":"f4d04b831c2dd9f7c9ed9050d81ad1da660ea04b727f7306b107e3a3d8538b28","start":5621}],"target_id":"claim.frontier.pmid-42728996","target_kind":"node","target_sha256":"a40e80accc20afda4cc8c753638e2d9a42eed4fce5c561269d5a1c397e01a551"}],"claim.frontier.pmid-42729309":[{"id":"assertion.claim.frontier.pmid-42729309","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729309","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729309 \"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety\" (CC BY, first published 2026-08-28) reports: \"The results reveal a significant spatial divergence in information perception.\"","support":[{"end":2504,"quote":"The results reveal a significant spatial divergence in information perception.","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":2426},{"end":6499,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":6464},{"end":6253,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729309","source_sha256":"ce04a575af31e00131736c469671b94b96bd63ba94fa017fd705d0e81490de4b","start":6236}],"target_id":"claim.frontier.pmid-42729309","target_kind":"node","target_sha256":"91194a5b6d8b72739bc385e4d7193ff2921b8d460dfeb3cbad18b22d970659e2"}],"claim.frontier.pmid-42729546":[{"id":"assertion.claim.frontier.pmid-42729546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729546","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729546 \"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy\" (CC BY, first published 2026-08-28) reports: \"preparations or TQ was associated with improvements in clinical periodontal outcome measures.\"","support":[{"end":3640,"quote":"preparations or TQ was associated with improvements in clinical periodontal outcome measures.","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":3547},{"end":6055,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":6020},{"end":5761,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729546","source_sha256":"e10a539bb1ceffe3a1422c9a0503900befc46ebb0d1a09a341bd3f04cb478fd5","start":5744}],"target_id":"claim.frontier.pmid-42729546","target_kind":"node","target_sha256":"3f42ceba417fc081f5bf51bb03a44971c3c99425892749c186102e831ffed6c1"}],"claim.frontier.pmid-42729934":[{"id":"assertion.claim.frontier.pmid-42729934","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729934","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729934 \"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome\" (CC BY, first published 2026-08-31) reports: \"These findings highlight the need for systematic strategies in primary care to improve management in CCS.\"","support":[{"end":5607,"quote":"These findings highlight the need for systematic strategies in primary care to improve management in CCS.","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":5502},{"end":8037,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":8002},{"end":7743,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729934","source_sha256":"dc5886503d50754b2d4e38423a8c0b0e539916a1ea63dcb4b9c82b3c32cac284","start":7726}],"target_id":"claim.frontier.pmid-42729934","target_kind":"node","target_sha256":"fb26700cbc121cf3f180fd287c328421d4397060ff2f1e848a15d911afb3f568"}],"claim.frontier.pmid-42729983":[{"id":"assertion.claim.frontier.pmid-42729983","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42729983","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42729983 \"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations\" (CC BY, first published 2026-09-11) reports: \"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.\"","support":[{"end":4779,"quote":"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":4609},{"end":6129,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":6094},{"end":5835,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42729983","source_sha256":"7eb77bbe59f86932d81febef83cee6b0810de7b4b4ee4f3c1440447cd127fd07","start":5818}],"target_id":"claim.frontier.pmid-42729983","target_kind":"node","target_sha256":"ae97ef5999a12b6d727054db7d2e76647d0b5ba067d87bbacc158eee17619648"}],"claim.frontier.pmid-42730235":[{"id":"assertion.claim.frontier.pmid-42730235","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42730235","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42730235 \"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex\" (CC BY, first published 2026-09-11) reports: \"Together, these results suggest a potential pest complex where previously only one species was in focus.\"","support":[{"end":4516,"quote":"Together, these results suggest a potential pest complex where previously only one species was in focus.","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":4412},{"end":6317,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":6282},{"end":6008,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42730235","source_sha256":"08e72fd8a7de3d8315680e0b1df3cb2cd5ecf6cffbee35bcf5fe0591314ff022","start":5991}],"target_id":"claim.frontier.pmid-42730235","target_kind":"node","target_sha256":"2669d15db9e207df115acde85eb7d0cc18084fa4431f7edbaa4bf6abc3faa23f"}],"claim.frontier.pmid-42731744":[{"id":"assertion.claim.frontier.pmid-42731744","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42731744","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42731744 \"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation\" (CC BY, first published 2026-09-12) reports: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","support":[{"end":2776,"quote":"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":2511},{"end":5032,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":4997},{"end":4786,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42731744","source_sha256":"ee25cbebc4c19047357054f48c536736c135b019eb96232bdc36b032fda71a72","start":4769}],"target_id":"claim.frontier.pmid-42731744","target_kind":"node","target_sha256":"04b118b89656c354c73d896cfb5f5ddce20f5eb56358d2ddf55a87e0413862bc"}],"claim.frontier.pmid-42732108":[{"id":"assertion.claim.frontier.pmid-42732108","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42732108","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42732108 \"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations\" (CC BY, first published 2026-09-08) reports: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","support":[{"end":5217,"quote":"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":5075},{"end":8403,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":8368},{"end":8109,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42732108","source_sha256":"c25438f76c73e50024bfb16f7839c4f993ab6de9a2ff91859b036d554f40dad1","start":8092}],"target_id":"claim.frontier.pmid-42732108","target_kind":"node","target_sha256":"468911e0f73238ab87c7f5c22e31d0268389c633c5b68e887f5859a1835e9e66"}],"claim.frontier.pmid-42732322":[{"id":"assertion.claim.frontier.pmid-42732322","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42732322","quantifiers":"Only what the quoted sentence states","time":"2026-08-13","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42732322 \"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report\" (CC BY, first published 2026-08-13) reports: \"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.\"","support":[{"end":1889,"quote":"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":1709},{"end":4257,"quote":"\"firstPublicationDate\":\"2026-08-13\"","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":4222},{"end":3963,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42732322","source_sha256":"27538bd5413106d0e9c68df41c27d50624e869c20aa3546359335eb4a1e6c82f","start":3946}],"target_id":"claim.frontier.pmid-42732322","target_kind":"node","target_sha256":"9c6b77c18d7204353320e081b532d15279fb67dfb1f0d53971469c2230ccdab8"}],"claim.frontier.pmid-42733890":[{"id":"assertion.claim.frontier.pmid-42733890","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42733890","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42733890 \"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction\" (CC BY, first published 2026-08-12) reports: \"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.\"","support":[{"end":4165,"quote":"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":3883},{"end":6556,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":6521},{"end":6310,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42733890","source_sha256":"dba75a3de07d4d973a05343b3be6f364e83f543e4c7d0ca09f73186eb47f37ee","start":6293}],"target_id":"claim.frontier.pmid-42733890","target_kind":"node","target_sha256":"424cfad5b5b694a240aefa0432f76609b0c7e5cef676f920a0ea3bae9e849310"}],"claim.frontier.pmid-42736559":[{"id":"assertion.claim.frontier.pmid-42736559","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42736559","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42736559 \"Living with adenomyosis and involuntary childlessness: a qualitative interview study\" (CC BY, first published 2026-09-14) reports: \"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.\"","support":[{"end":4544,"quote":"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":4243},{"end":7150,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":7115},{"end":6856,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42736559","source_sha256":"6d98ad6d599f55dceb53b763f19e74f57005dd72804c7e253d7e3acab8f4fa15","start":6839}],"target_id":"claim.frontier.pmid-42736559","target_kind":"node","target_sha256":"347403499c53824b82dfe675d062734ed166a3fc5131a29af981bd30aa0c5447"}],"claim.frontier.pmid-42737031":[{"id":"assertion.claim.frontier.pmid-42737031","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737031","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737031 \"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study\" (CC BY, first published 2026-09-07) reports: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","support":[{"end":2760,"quote":"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":2518},{"end":6250,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":6215},{"end":5956,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737031","source_sha256":"2aed4d610ebe84ca234e9ff735be81ad4ec7fb511657d577911dc620975e4149","start":5939}],"target_id":"claim.frontier.pmid-42737031","target_kind":"node","target_sha256":"202296fde9fab99bf76e9441383a6780197c0ba1272aecc168e1171690f01ad7"}],"claim.frontier.pmid-42737450":[{"id":"assertion.claim.frontier.pmid-42737450","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737450","quantifiers":"Only what the quoted sentence states","time":"2026-08-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737450 \"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis\" (CC BY, first published 2026-08-23) reports: \"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.\"","support":[{"end":7876,"quote":"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":7731},{"end":12697,"quote":"\"firstPublicationDate\":\"2026-08-23\"","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":12662},{"end":12451,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737450","source_sha256":"e5cc6df22b8e8e0360e2687a0ae0e1bfca88987ea918fab62e56427a05eaa177","start":12434}],"target_id":"claim.frontier.pmid-42737450","target_kind":"node","target_sha256":"441bf231cac781e8999bec0166a3f518d226313437748a6d74028be61bf400e8"}],"claim.frontier.pmid-42737499":[{"id":"assertion.claim.frontier.pmid-42737499","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737499","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737499 \"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling\" (CC BY, first published 2026-08-25) reports: \"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.\"","support":[{"end":4669,"quote":"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":4400},{"end":8522,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":8487},{"end":8228,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737499","source_sha256":"5ddec45463275ed311449ae19721751e2b41f3b691eb3c8e6ee74377ddc869e9","start":8211}],"target_id":"claim.frontier.pmid-42737499","target_kind":"node","target_sha256":"23aaf4a4bce6c940567e8e3ccc6552e2e0e5ff56fc490db73f4fb58d1f251bb1"}],"claim.frontier.pmid-42737509":[{"id":"assertion.claim.frontier.pmid-42737509","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737509","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737509 \"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities\" (CC BY, first published 2026-08-25) reports: \"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.\"","support":[{"end":2642,"quote":"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":2237},{"end":6438,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":6403},{"end":6192,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737509","source_sha256":"41423291f567cecb50169cccdd4c673d152df329d81234d4b8b4edc266102667","start":6175}],"target_id":"claim.frontier.pmid-42737509","target_kind":"node","target_sha256":"18f998221fcbbe4aabc4af7beaab8153e28b28150853b6b6258c64bb7eee56cb"}],"claim.frontier.pmid-42737882":[{"id":"assertion.claim.frontier.pmid-42737882","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737882","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737882 \"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance\" (CC BY, first published 2026-08-24) reports: \"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.\"","support":[{"end":4006,"quote":"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":3790},{"end":6182,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":6147},{"end":5888,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737882","source_sha256":"a3e9cc8f74f97165a52ac2ac4e249614f62298608e83ec782c0b2e55cb759342","start":5871}],"target_id":"claim.frontier.pmid-42737882","target_kind":"node","target_sha256":"d9d6ace3ec4a03c76138b16d42191f528c22c27c8edf483cac59cb78d6885a0c"}],"claim.frontier.pmid-42737913":[{"id":"assertion.claim.frontier.pmid-42737913","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42737913","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42737913 \"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>\" (CC BY, first published 2026-09-01) reports: \"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.\"","support":[{"end":4753,"quote":"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":4640},{"end":7936,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":7901},{"end":7632,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42737913","source_sha256":"60a6fa5ca1ab9e672e3e3035c86183bc11453449de91eadb1128b3eec6f03085","start":7615}],"target_id":"claim.frontier.pmid-42737913","target_kind":"node","target_sha256":"dfc14866ca846ea758fdc69d1812966a6ba8d2727682853c9f993dec8d302257"}],"claim.frontier.pmid-42738411":[{"id":"assertion.claim.frontier.pmid-42738411","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42738411","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42738411 \"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia\" (CC BY, first published 2026-09-07) reports: \"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.\"","support":[{"end":6957,"quote":"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":6773},{"end":9052,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":9017},{"end":8758,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42738411","source_sha256":"9d8cb742fbd1f5ab11051a3fd3d4f6431598bb878a51bf1ac2d22f59a3bd753f","start":8741}],"target_id":"claim.frontier.pmid-42738411","target_kind":"node","target_sha256":"387a225d0bb767d7b51be3b905e476bf1ae40a95ccf45560498182f9ab3ed251"}],"claim.frontier.pmid-42739550":[{"id":"assertion.claim.frontier.pmid-42739550","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739550","quantifiers":"Only what the quoted sentence states","time":"2026-08-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739550 \"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study\" (CC BY, first published 2026-08-25) reports: \"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.\"","support":[{"end":2165,"quote":"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":1861},{"end":5981,"quote":"\"firstPublicationDate\":\"2026-08-25\"","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":5946},{"end":5687,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739550","source_sha256":"cfa4b663bb179a48c5478884bb1dce61d55ebd8c00fbc1ca5266e8686da2c4c0","start":5670}],"target_id":"claim.frontier.pmid-42739550","target_kind":"node","target_sha256":"30a03b5a07b5b969bf6c056eb69ad10023ff2eb8a6ea9c32a9c5fb69fd463cf1"}],"claim.frontier.pmid-42739854":[{"id":"assertion.claim.frontier.pmid-42739854","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739854","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739854 \"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry\" (CC BY, first published 2026-09-04) reports: \"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).\"","support":[{"end":10146,"quote":"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":9766},{"end":12609,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":12574},{"end":12315,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739854","source_sha256":"f75eb45db55f636c200e27354765d3df217e0c3c2fbec3aa423cef77d4bd3e0f","start":12298}],"target_id":"claim.frontier.pmid-42739854","target_kind":"node","target_sha256":"38b7d21cb54b90dba89d8ced19726c68a96e2c535ca1b451ae0327e5dc382640"}],"claim.frontier.pmid-42739910":[{"id":"assertion.claim.frontier.pmid-42739910","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739910","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739910 \"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support\" (CC BY, first published 2026-09-07) reports: \"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.\"","support":[{"end":4174,"quote":"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":4038},{"end":5765,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":5730},{"end":5519,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739910","source_sha256":"7de8a180a41eee70e233a94644e35a13fa9767f44de8021d9a8f23f025c29aa9","start":5502}],"target_id":"claim.frontier.pmid-42739910","target_kind":"node","target_sha256":"b2fbbc86d21df1a0a65b13e31e644a277f82d45014544bc12ca6890162e50880"}],"claim.frontier.pmid-42739931":[{"id":"assertion.claim.frontier.pmid-42739931","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42739931","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42739931 \"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs\" (CC BY, first published 2026-09-07) reports: \": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.\"","support":[{"end":6085,"quote":": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":5974},{"end":8015,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":7980},{"end":7721,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42739931","source_sha256":"45f37e1df02caa1a3c09b632efdca2a88a36ab3c78797437b8dfd8c2870e5919","start":7704}],"target_id":"claim.frontier.pmid-42739931","target_kind":"node","target_sha256":"c1986d6fa7584e5ca717ce6c357002091dbbde0afb116408bffa2937712093df"}],"claim.frontier.pmid-42741165":[{"id":"assertion.claim.frontier.pmid-42741165","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42741165","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42741165 \"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China\" (CC BY, first published 2026-08-31) reports: \"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.\"","support":[{"end":3747,"quote":"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":3590},{"end":7260,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":7225},{"end":6959,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42741165","source_sha256":"d0ea1c7381af6efea10dea4ebfa9c9e36aab2e2c0f9b047134dba72dd930204f","start":6942}],"target_id":"claim.frontier.pmid-42741165","target_kind":"node","target_sha256":"5338485b9563fc0b4de27b267bfb07f9f06d7fe351053e385be8727eab4cb4d7"}],"claim.frontier.pmid-42741475":[{"id":"assertion.claim.frontier.pmid-42741475","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42741475","quantifiers":"Only what the quoted sentence states","time":"2026-08-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42741475 \"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung\" (CC BY, first published 2026-08-15) reports: \"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.\"","support":[{"end":2761,"quote":"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":2571},{"end":5409,"quote":"\"firstPublicationDate\":\"2026-08-15\"","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":5374},{"end":5115,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42741475","source_sha256":"09dc3e9d3b0e02e079c36e746d38a3f0884ca2e248f7fd203dff68354d210eb4","start":5098}],"target_id":"claim.frontier.pmid-42741475","target_kind":"node","target_sha256":"d98fd40bf4e30075b95c818db370bff07f7721f8561fa6fcd9d9c06bb588ab1f"}],"claim.frontier.pmid-42742452":[{"id":"assertion.claim.frontier.pmid-42742452","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42742452","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42742452 \"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation\" (CC BY, first published 2026-09-01) reports: \"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.\"","support":[{"end":5426,"quote":"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":5271},{"end":9586,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":9551},{"end":9333,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42742452","source_sha256":"fee71313dcdb416d24265f0fd3c1f7a695a7b7546f8a8fe5ae85e0352fd6906d","start":9316}],"target_id":"claim.frontier.pmid-42742452","target_kind":"node","target_sha256":"5075e8ec271873e69ad05ab00cd5c924b8351d49b455039a3bd0380b03a39803"}],"claim.frontier.pmid-42743158":[{"id":"assertion.claim.frontier.pmid-42743158","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743158","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743158 \"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease\" (CC BY, first published 2026-09-15) reports: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","support":[{"end":2504,"quote":"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":2306},{"end":6950,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":6915},{"end":6704,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743158","source_sha256":"19d98d81f74207be4a360ff35357fb25446c7dcfe2069167bc8b9117d12806c8","start":6687}],"target_id":"claim.frontier.pmid-42743158","target_kind":"node","target_sha256":"3eb20fe224c1723d4b1bb81efe6fff663cdcdfb142f3ee3375173d512b54d56e"}],"claim.frontier.pmid-42743162":[{"id":"assertion.claim.frontier.pmid-42743162","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743162","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743162 \"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids\" (CC BY, first published 2026-09-15) reports: \"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.\"","support":[{"end":3089,"quote":"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":2935},{"end":6173,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":6138},{"end":5927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743162","source_sha256":"998947aea3d1037a420a61e9a69209ff78f20ea18dd0e5597c50afbf3b6253ae","start":5910}],"target_id":"claim.frontier.pmid-42743162","target_kind":"node","target_sha256":"cbc9d40947decc24bb57a4c1ff52c43e391499b78eb773f3985ff886c82c7c0a"}],"claim.frontier.pmid-42743204":[{"id":"assertion.claim.frontier.pmid-42743204","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743204","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743204 \"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study\" (CC BY, first published 2026-09-15) reports: \"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).\"","support":[{"end":3647,"quote":"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":3363},{"end":6713,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":6678},{"end":6419,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743204","source_sha256":"06791385a7fe1315a6a910fe2aeb51f5efc06f75b96636b215bf30493b4ed32f","start":6402}],"target_id":"claim.frontier.pmid-42743204","target_kind":"node","target_sha256":"bbdc5d42f634de433a85a1c81dee0971a3692471eeacdcadac5e4b54dce8e0e5"}],"claim.frontier.pmid-42743306":[{"id":"assertion.claim.frontier.pmid-42743306","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743306","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743306 \"Convergent evolution of viral nucleases targeting cyclic dinucleotides\" (CC BY, first published 2026-09-15) reports: \"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.\"","support":[{"end":2563,"quote":"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":2470},{"end":6009,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":5974},{"end":5763,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743306","source_sha256":"7ffadf7024f2a86fc07497262fb196bf802853481cded6b95fd23b87137f8bc0","start":5746}],"target_id":"claim.frontier.pmid-42743306","target_kind":"node","target_sha256":"cd365f72114d8f592e55b4f6f49b52a2c0db983562f3164a09b2aac95932199d"}],"claim.frontier.pmid-42743310":[{"id":"assertion.claim.frontier.pmid-42743310","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743310","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743310 \"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis\" (CC BY, first published 2026-09-15) reports: \"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.\"","support":[{"end":2524,"quote":"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":2393},{"end":5102,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":5067},{"end":4856,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743310","source_sha256":"01b49e270d59d780745a6163705d182429950efe13c320081d5d4d009f4c5e71","start":4839}],"target_id":"claim.frontier.pmid-42743310","target_kind":"node","target_sha256":"74487a0239bbba9fe27d0b2db8903f8313d73e47e2244277ec4799bbbadc6584"}],"claim.frontier.pmid-42743377":[{"id":"assertion.claim.frontier.pmid-42743377","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42743377","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42743377 \"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology\" (CC BY, first published 2026-09-15) reports: \"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.\"","support":[{"end":2413,"quote":"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":2160},{"end":5715,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":5680},{"end":5469,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42743377","source_sha256":"fe4d6e1062afc3b7bee22a5ed122585137e807ac54ec546087ce5304b7d27329","start":5452}],"target_id":"claim.frontier.pmid-42743377","target_kind":"node","target_sha256":"a722ec044a3fe9235551f5c479cc88304b9e598e10305bc0c1a5908ab9763891"}],"claim.frontier.pmid-42745765":[{"id":"assertion.claim.frontier.pmid-42745765","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42745765","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42745765 \"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome\" (CC BY, first published 2026-09-01) reports: \"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.\"","support":[{"end":5035,"quote":"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":4814},{"end":8240,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":8205},{"end":7946,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42745765","source_sha256":"9c39f01c7bc2ea1bd1e938e49328d4441967e0e7c3e723fcc4e037151a095343","start":7929}],"target_id":"claim.frontier.pmid-42745765","target_kind":"node","target_sha256":"33daa60aad1a28c80bfdabf539db7a725cf12101a4a77acf4abdaa041b596173"}],"claim.frontier.pmid-42746056":[{"id":"assertion.claim.frontier.pmid-42746056","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746056","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746056 \"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework\" (CC BY, first published 2026-09-01) reports: \"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.\"","support":[{"end":1887,"quote":"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":1785},{"end":7398,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":7363},{"end":7152,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746056","source_sha256":"755c79fc78eaa80a8c08c68ed91116ee7efb67b1a5159a8df8e552c53b074258","start":7135}],"target_id":"claim.frontier.pmid-42746056","target_kind":"node","target_sha256":"d46f43bb44e84651fca7f73dabb744143f38f0728fcfa10b32bebb200d336b48"}],"claim.frontier.pmid-42746333":[{"id":"assertion.claim.frontier.pmid-42746333","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746333","quantifiers":"Only what the quoted sentence states","time":"2026-08-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746333 \"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp\" (CC BY, first published 2026-08-16) reports: \"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.\"","support":[{"end":2589,"quote":"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":2429},{"end":5497,"quote":"\"firstPublicationDate\":\"2026-08-16\"","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":5462},{"end":5251,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746333","source_sha256":"8bc57adceefd1422a7f9e48427b9b7947bdfe239c831498c3b3a7ac2dc9a9d75","start":5234}],"target_id":"claim.frontier.pmid-42746333","target_kind":"node","target_sha256":"e22f13bc2ae921e4c725f64dacaf8e4edad139d58fa1cf9c025debc408ac1364"}],"claim.frontier.pmid-42746465":[{"id":"assertion.claim.frontier.pmid-42746465","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746465","quantifiers":"Only what the quoted sentence states","time":"2026-08-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746465 \"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta\" (CC BY, first published 2026-08-16) reports: \"The condition was associated with prolonged hospital stay and substantial infectious complications.\"","support":[{"end":4748,"quote":"The condition was associated with prolonged hospital stay and substantial infectious complications.","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":4649},{"end":6165,"quote":"\"firstPublicationDate\":\"2026-08-16\"","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":6130},{"end":5919,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746465","source_sha256":"89976665919a5e157dcd239e734798f31eb2aff2d61ed3dcb49a540756d00add","start":5902}],"target_id":"claim.frontier.pmid-42746465","target_kind":"node","target_sha256":"91400bc09e629fa39797ef5ccb748f7cfc17b8cfe701e79d47b86255c193c5a4"}],"claim.frontier.pmid-42746596":[{"id":"assertion.claim.frontier.pmid-42746596","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746596","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746596 \"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity\" (CC BY, first published 2026-09-15) reports: \"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.\"","support":[{"end":5771,"quote":"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":5634},{"end":8119,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":8084},{"end":7873,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746596","source_sha256":"8e7f859f9a1c6915e5a12c28bffcdc04bfabc4c62146d7f3ccc64586a53107df","start":7856}],"target_id":"claim.frontier.pmid-42746596","target_kind":"node","target_sha256":"eb938a4dc3ed050f2c07f43ca989184b0e82e8c7fbfe0ab6b0102f21aae2b64f"}],"claim.frontier.pmid-42746605":[{"id":"assertion.claim.frontier.pmid-42746605","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42746605","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42746605 \"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study\" (CC BY, first published 2026-09-14) reports: \"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.\"","support":[{"end":4421,"quote":"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":4163},{"end":5870,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":5835},{"end":5624,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42746605","source_sha256":"c70e992539e5b3beb13641731135c39b7e711a12a525cf76fb497bf63d71a12e","start":5607}],"target_id":"claim.frontier.pmid-42746605","target_kind":"node","target_sha256":"040c4b60c09b29a47fa956491c8e118956bc2f5fbb227fd4bd87e8c0aaba104e"}],"claim.frontier.pmid-42748079":[{"id":"assertion.claim.frontier.pmid-42748079","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748079","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748079 \"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise\" (CC BY, first published 2026-09-16) reports: \"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.\"","support":[{"end":5996,"quote":"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":5849},{"end":8563,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":8528},{"end":8317,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748079","source_sha256":"3a23f37d02f6a84d397b6128d4cdcbb8c7a923f14fa3ac72f3d20bd6d071c2a7","start":8300}],"target_id":"claim.frontier.pmid-42748079","target_kind":"node","target_sha256":"89eefd1c1808ecb98a0cfef871fcf3d658df6af7c5e1fb12d2a8ea191e72d4b0"}],"claim.frontier.pmid-42748081":[{"id":"assertion.claim.frontier.pmid-42748081","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748081","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748081 \"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement\" (CC BY, first published 2026-09-16) reports: \"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.\"","support":[{"end":6428,"quote":"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":6184},{"end":8699,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":8664},{"end":8453,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748081","source_sha256":"d98477bbfc357e38c61cc30d9c0886d2397bc410bd8fa51578d9e00bf9ccb321","start":8436}],"target_id":"claim.frontier.pmid-42748081","target_kind":"node","target_sha256":"457d1c5a25df90822be75bd1bdf38cd9c2f33ab0803991ff931e5fefae5a4412"}],"claim.frontier.pmid-42748115":[{"id":"assertion.claim.frontier.pmid-42748115","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748115","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748115 \"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement\" (CC BY, first published 2026-09-16) reports: \"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.\"","support":[{"end":3598,"quote":"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":3220},{"end":6508,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":6473},{"end":6214,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748115","source_sha256":"c1ad6d25b85e5f947a471a35c303cabdbe0433581d73f9cd21d2cb21720b54dc","start":6197}],"target_id":"claim.frontier.pmid-42748115","target_kind":"node","target_sha256":"5038977c58094a9e5309c0770b14ab182cd05ed694958818d655acc004f124a4"}],"claim.frontier.pmid-42748135":[{"id":"assertion.claim.frontier.pmid-42748135","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748135","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748135 \"Bacterial stress responses lower mRNA-protein level correlations\" (CC BY, first published 2026-09-16) reports: \"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.\"","support":[{"end":6294,"quote":"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":6075},{"end":9942,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":9907},{"end":9633,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748135","source_sha256":"a3871a84513532588111d63ce31396b32cc00ea38de5a3408cc1ee4d1acf465b","start":9616}],"target_id":"claim.frontier.pmid-42748135","target_kind":"node","target_sha256":"935a1004e7e1a2096d593da1f91cb417e280df3418d74ae84f22158f9593d066"}],"claim.frontier.pmid-42748195":[{"id":"assertion.claim.frontier.pmid-42748195","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42748195","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42748195 \"Mathematical skills in deaf and hard-of-hearing children: A systematic review\" (CC BY, first published 2026-09-16) reports: \"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.\"","support":[{"end":7752,"quote":"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":7602},{"end":10078,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":10043},{"end":9784,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42748195","source_sha256":"2ecee413803a552d87e095dc60d05da4d0e0937b854b2e25330ccf4143cb1336","start":9767}],"target_id":"claim.frontier.pmid-42748195","target_kind":"node","target_sha256":"866798ce0479ae591edeb8a4260ef72d8fba8c607b6fdcf23b4866c705a93007"}],"claim.frontier.pmid-42749366":[{"id":"assertion.claim.frontier.pmid-42749366","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42749366","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42749366 \"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study\" (CC BY, first published 2026-09-16) reports: \"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.\"","support":[{"end":3184,"quote":"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":3013},{"end":7949,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":7914},{"end":7703,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42749366","source_sha256":"b95d2aa9cb66dfd1c44c05d9016d59fed10698f8d89ee8e69077fee00bc5f45a","start":7686}],"target_id":"claim.frontier.pmid-42749366","target_kind":"node","target_sha256":"2e813060129967780b60aa35ae49eafa586ebb444db9eccce56f358622667749"}],"claim.frontier.pmid-42749735":[{"id":"assertion.claim.frontier.pmid-42749735","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42749735","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42749735 \"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics\" (CC BY, first published 2026-08-19) reports: \"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.\"","support":[{"end":8445,"quote":"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":8285},{"end":13646,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":13611},{"end":13348,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42749735","source_sha256":"c0dfc9b594235aaae4f40254669c5d76211436b45b0e9a79044a6a3430fc84bd","start":13331}],"target_id":"claim.frontier.pmid-42749735","target_kind":"node","target_sha256":"56c2baa881b7ed05248aa8a6477553857b00011c99b4aa60b626c2ffa43b0944"}],"claim.frontier.pmid-42750388":[{"id":"assertion.claim.frontier.pmid-42750388","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42750388","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42750388 \"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation\" (CC BY, first published 2026-09-16) reports: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","support":[{"end":5809,"quote":"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":5724},{"end":7662,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":7627},{"end":7400,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42750388","source_sha256":"3956e45cd0cb742397d791acfb224cc00fe162da1c7fe657fb58d12015450153","start":7383}],"target_id":"claim.frontier.pmid-42750388","target_kind":"node","target_sha256":"e1b4e63ca29469bae96bde993048eb3fb7c5a0ed0eb1dc549c011417e7472874"}],"claim.frontier.pmid-42751534":[{"id":"assertion.claim.frontier.pmid-42751534","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42751534","quantifiers":"Only what the quoted sentence states","time":"2026-08-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42751534 \"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement\" (CC BY, first published 2026-08-17) reports: \"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.\"","support":[{"end":3569,"quote":"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":3306},{"end":7378,"quote":"\"firstPublicationDate\":\"2026-08-17\"","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":7343},{"end":7132,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42751534","source_sha256":"7b83765a7a246a1d2a3861fa4bbbd2eb137f10f1c70d94296f5e63a5fe4007b4","start":7115}],"target_id":"claim.frontier.pmid-42751534","target_kind":"node","target_sha256":"b4a4071e995732a2c6e7a8e45c77588f1b2221ef426338fe5e814db435fee077"}],"claim.frontier.pmid-42752632":[{"id":"assertion.claim.frontier.pmid-42752632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42752632","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42752632 \"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital\" (CC BY, first published 2026-09-17) reports: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","support":[{"end":3673,"quote":"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":3465},{"end":5844,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":5809},{"end":5598,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42752632","source_sha256":"d94425775770a2a3ef717324e82c82bd10f3f3229a7158bcef50895e5b640dea","start":5581}],"target_id":"claim.frontier.pmid-42752632","target_kind":"node","target_sha256":"c468a4fa1be69840ae2e74bb1803727c97a98540019301829a57585016bbc799"}],"claim.frontier.pmid-42755230":[{"id":"assertion.claim.frontier.pmid-42755230","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755230","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755230 \"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges\" (CC BY, first published 2026-10-01) reports: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","support":[{"end":5688,"quote":"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":5475},{"end":7904,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":7869},{"end":7652,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755230","source_sha256":"b5ac9b4e1b45ea108f53df8c7b71a6a279748382f4bbd46aeb6c8d8c35d3b767","start":7635}],"target_id":"claim.frontier.pmid-42755230","target_kind":"node","target_sha256":"0dbc015a2e0816b528be91d9659f4cac632715c43417044bfd84e6d6e4e37ef4"}],"claim.frontier.pmid-42755626":[{"id":"assertion.claim.frontier.pmid-42755626","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755626","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755626 \"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study\" (CC BY, first published 2026-09-03) reports: \"These findings suggest that PFO diameter may be associated with WMH severity in young adults.\"","support":[{"end":5352,"quote":"These findings suggest that PFO diameter may be associated with WMH severity in young adults.","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":5259},{"end":8143,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":8108},{"end":7897,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755626","source_sha256":"bb881309713933fae704848e37b2c5010fd5615965f899a97ba15ee43f7aa0d0","start":7880}],"target_id":"claim.frontier.pmid-42755626","target_kind":"node","target_sha256":"07622133a415b1ff2b27b3fe91cb14b5838d8ff4f0704253f897c23cfd92b23e"}],"claim.frontier.pmid-42755627":[{"id":"assertion.claim.frontier.pmid-42755627","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755627","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755627 \"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.\"","support":[{"end":3387,"quote":"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":3273},{"end":6272,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":6237},{"end":6026,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755627","source_sha256":"cab36cab746144749896643378dd8defede35af5c0515ff7116e4ad5f57aadd9","start":6009}],"target_id":"claim.frontier.pmid-42755627","target_kind":"node","target_sha256":"ecbb2c5285f7f44d92071887dd798984c2a01d389fdbcf4b4836ebad4a1fda90"}],"claim.frontier.pmid-42755797":[{"id":"assertion.claim.frontier.pmid-42755797","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755797","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755797 \"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults\" (CC BY, first published 2026-09-03) reports: \"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.\"","support":[{"end":6866,"quote":"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":6735},{"end":8529,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":8494},{"end":8235,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755797","source_sha256":"7a58a83c977b65e86a4ebdc232932e8a1cf6d1df825dd93acbcbaac3c52c7040","start":8218}],"target_id":"claim.frontier.pmid-42755797","target_kind":"node","target_sha256":"3286ec053e09ba901b8d143d41589f760d422c7cad2654534a34472b822856d8"}],"claim.frontier.pmid-42755864":[{"id":"assertion.claim.frontier.pmid-42755864","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42755864","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42755864 \"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity\" (CC BY, first published 2026-09-03) reports: \", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.\"","support":[{"end":4893,"quote":", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":4703},{"end":9175,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":9140},{"end":8929,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42755864","source_sha256":"c5e897eb2083193b8de10ee7a400a92492b696d0b41227a018d268ea4e2b80c0","start":8912}],"target_id":"claim.frontier.pmid-42755864","target_kind":"node","target_sha256":"271f04940a0bbb2eee5eb8ae53750acc8889ced52c97d07c3a5bded3f5af93f7"}],"claim.frontier.pmid-42756514":[{"id":"assertion.claim.frontier.pmid-42756514","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42756514","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42756514 \"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform\" (CC BY, first published 2026-09-03) reports: \"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).\"","support":[{"end":5956,"quote":"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":5752},{"end":8606,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":8571},{"end":8312,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42756514","source_sha256":"9124895ce16d743e446926a4c259b7471868271c8f6c06cfc241c6c59e68472b","start":8295}],"target_id":"claim.frontier.pmid-42756514","target_kind":"node","target_sha256":"386eb5ca3ff1018f10f7b7d927fe53b5756ffced962a2879d7983b339dce4d37"}],"claim.frontier.pmid-42757005":[{"id":"assertion.claim.frontier.pmid-42757005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42757005","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42757005 \"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge\" (CC BY, first published 2026-09-17) reports: \"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.\"","support":[{"end":3207,"quote":"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":2932},{"end":4909,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":4874},{"end":4615,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42757005","source_sha256":"f6d36ff70f207eba4a49bf0b17a9199a45212c23fbf48424f7f6445d5ddc92fc","start":4598}],"target_id":"claim.frontier.pmid-42757005","target_kind":"node","target_sha256":"6420cf6ebab955bc8bbe835c9aa9f7e5feceac3a6c8affe6ebf045b7cef075a5"}],"claim.frontier.pmid-42757226":[{"id":"assertion.claim.frontier.pmid-42757226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42757226","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42757226 \"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls\" (CC BY, first published 2026-09-03) reports: \"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.\"","support":[{"end":3448,"quote":"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":3233},{"end":5070,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":5035},{"end":4824,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42757226","source_sha256":"4e47d08e7f04f123981d323f008e82b58035f86460d2356d223bdaff71e8edc4","start":4807}],"target_id":"claim.frontier.pmid-42757226","target_kind":"node","target_sha256":"3e9e0fc8147c85cbf19a0791eff850be6a4c966a682e60ee8074039c1822e61d"}],"claim.frontier.pmid-42758734":[{"id":"assertion.claim.frontier.pmid-42758734","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42758734","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42758734 \"A data-driven comparative analysis on citation intents across scientific disciplines\" (CC BY, first published 2026-09-18) reports: \"We found out that there are significant differences in all five characteristics across different research disciplines.\"","support":[{"end":2662,"quote":"We found out that there are significant differences in all five characteristics across different research disciplines.","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":2544},{"end":5166,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":5131},{"end":4920,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42758734","source_sha256":"7070d44334a74d6e6e8b87e800a955b8d7c377269f935782f8433158869dc119","start":4903}],"target_id":"claim.frontier.pmid-42758734","target_kind":"node","target_sha256":"17e6995fd8d523b1bcdcd30237e68fca8fcad65bba113b6f1f6e0f3999f6c735"}],"claim.frontier.pmid-42758776":[{"id":"assertion.claim.frontier.pmid-42758776","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42758776","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42758776 \"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province\" (CC BY, first published 2026-09-18) reports: \"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.\"","support":[{"end":2876,"quote":"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":2642},{"end":4902,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":4867},{"end":4608,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42758776","source_sha256":"34e51f89901e9315d04e888c0940a5f3ffcc0e0167b298df8f0867317e8b1a54","start":4591}],"target_id":"claim.frontier.pmid-42758776","target_kind":"node","target_sha256":"a7768885d9efa8f9dd57f72f93f9796d3eeef21b45bbbc00af7aa6d4cb3fc552"}],"claim.frontier.pmid-42760564":[{"id":"assertion.claim.frontier.pmid-42760564","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760564","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760564 \"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report\" (CC BY, first published 2026-09-18) reports: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","support":[{"end":3364,"quote":"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":3125},{"end":7131,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":7096},{"end":6885,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760564","source_sha256":"6b2bb7748f54a8744ac781fac09f0c1659f1f45aa7fa4609920820887d6d5d2e","start":6868}],"target_id":"claim.frontier.pmid-42760564","target_kind":"node","target_sha256":"ad31cdb2703184b78a8fa5bc5d25bdfccf46638d1cb9c0b5b7f3c28f1596855e"}],"claim.frontier.pmid-42760703":[{"id":"assertion.claim.frontier.pmid-42760703","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760703","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760703 \"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression\" (CC BY, first published 2026-09-01) reports: \"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.\"","support":[{"end":2852,"quote":"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":2606},{"end":6338,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":6303},{"end":6133,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760703","source_sha256":"0255d01c72503b294720e5ebed96b9ab9bcc83e5359106265056cda90d37b361","start":6116}],"target_id":"claim.frontier.pmid-42760703","target_kind":"node","target_sha256":"638f73f7f8de6d59ab6561ebf38708bbc0b894456310927dcbd222c2a63bc4eb"}],"claim.frontier.pmid-42760901":[{"id":"assertion.claim.frontier.pmid-42760901","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760901","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760901 \"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand\" (CC BY, first published 2026-09-15) reports: \"Experience of discrimination was associated with higher depression scores.\"","support":[{"end":4952,"quote":"Experience of discrimination was associated with higher depression scores.","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":4878},{"end":8162,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":8127},{"end":7916,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760901","source_sha256":"c40ebdd66b0656d1ab83bbd595927d83386970aa245cf8f8a9c8278f03bd9079","start":7899}],"target_id":"claim.frontier.pmid-42760901","target_kind":"node","target_sha256":"6c02f7d3ee4443b9691cb07904a2d61668a75e0dad7ee69e87f1cf6933301e48"}],"claim.frontier.pmid-42760912":[{"id":"assertion.claim.frontier.pmid-42760912","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42760912","quantifiers":"Only what the quoted sentence states","time":"2026-09-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42760912 \"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations\" (CC BY, first published 2026-09-28) reports: \"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.\"","support":[{"end":5117,"quote":"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":4943},{"end":9003,"quote":"\"firstPublicationDate\":\"2026-09-28\"","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":8968},{"end":8709,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42760912","source_sha256":"6e95a348e8a072c84ca4505f6159c86fcccbfd2b5c36be2c18afcfad7a94f1e5","start":8692}],"target_id":"claim.frontier.pmid-42760912","target_kind":"node","target_sha256":"8a5c892a956df62b8e6c44aeb8a074180057efa8407d4f621ab8ddcf375497a8"}],"claim.frontier.pmid-42761040":[{"id":"assertion.claim.frontier.pmid-42761040","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761040","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761040 \"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil\" (CC BY, first published 2026-09-04) reports: \"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.\"","support":[{"end":7011,"quote":"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":6726},{"end":9814,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":9779},{"end":9568,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761040","source_sha256":"3f1a225ab404a0b98e309207a760dc99e13d6cce98d6f749475750515d709416","start":9551}],"target_id":"claim.frontier.pmid-42761040","target_kind":"node","target_sha256":"b3530e7a53fe39b427de4144bf4b67e6931449e0ff14cd390575abd40009e46c"}],"claim.frontier.pmid-42761051":[{"id":"assertion.claim.frontier.pmid-42761051","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761051","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761051 \"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims\" (CC BY, first published 2026-09-04) reports: \"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.\"","support":[{"end":8240,"quote":"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":8076},{"end":9615,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":9580},{"end":9369,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761051","source_sha256":"30ed095483657575153015be154daf21e29e45dd9b54a54a77961f8cc8e25e4e","start":9352}],"target_id":"claim.frontier.pmid-42761051","target_kind":"node","target_sha256":"9f9dc4b7bdcf6dcae5de4004da3a2b7a91ab8f12a5d907c429de2d4931cfa8d7"}],"claim.frontier.pmid-42761220":[{"id":"assertion.claim.frontier.pmid-42761220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761220","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761220 \"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender\" (CC BY, first published 2026-09-04) reports: \"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.\"","support":[{"end":3880,"quote":"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":3728},{"end":5444,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":5409},{"end":5150,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761220","source_sha256":"6f44db2d9ca2266543e607988ce658fe23e542709160fe8405a66b889a27f6d8","start":5133}],"target_id":"claim.frontier.pmid-42761220","target_kind":"node","target_sha256":"6e2024e749da6c6e4b77c277145e5dd66430e224627a15a361f1b39b454aed6f"}],"claim.frontier.pmid-42761607":[{"id":"assertion.claim.frontier.pmid-42761607","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761607","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761607 \"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia\" (CC BY, first published 2026-09-18) reports: \"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).\"","support":[{"end":3342,"quote":"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":3181},{"end":6023,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":5988},{"end":5729,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761607","source_sha256":"6b47a0e016f0089ea166a6079134170bcef615db3a80e6914fc81630a688ec10","start":5712}],"target_id":"claim.frontier.pmid-42761607","target_kind":"node","target_sha256":"56aa32129e24f7fa2b9d31c252779ba94e606898b8c1d3782e5c8ed5d74ed03c"}],"claim.frontier.pmid-42761991":[{"id":"assertion.claim.frontier.pmid-42761991","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42761991","quantifiers":"Only what the quoted sentence states","time":"2026-08-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42761991 \"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report\" (CC BY, first published 2026-08-19) reports: \"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.\"","support":[{"end":2009,"quote":"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":1805},{"end":3868,"quote":"\"firstPublicationDate\":\"2026-08-19\"","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":3833},{"end":3574,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42761991","source_sha256":"f636dc2fee89cb7f9c9a8527d3bbce50c333b078ff550c6b74663d016a15b977","start":3557}],"target_id":"claim.frontier.pmid-42761991","target_kind":"node","target_sha256":"b5ba381d0ddde131b0b116845d17db2132b18b418b0e60c8765798eb552f4b2b"}],"claim.frontier.pmid-42762163":[{"id":"assertion.claim.frontier.pmid-42762163","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42762163","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42762163 \"A network dynamical simulation model for the study of antibiotic resistance in microbial communities\" (CC BY, first published 2026-09-19) reports: \"Our results show that network structure strongly modulates resistance dynamics.\"","support":[{"end":4063,"quote":"Our results show that network structure strongly modulates resistance dynamics.","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":3984},{"end":6990,"quote":"\"firstPublicationDate\":\"2026-09-19\"","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":6955},{"end":6744,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42762163","source_sha256":"e88d4934952c2423232ac090f1a143ebb1a94501bf45b8c286a5a68341d44245","start":6727}],"target_id":"claim.frontier.pmid-42762163","target_kind":"node","target_sha256":"bf122e39205e8ed720ff00f11f1c2bdd6892eef40238342d603c97384cb2c78b"}],"claim.frontier.pmid-42763478":[{"id":"assertion.claim.frontier.pmid-42763478","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763478","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763478 \"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic\" (CC BY, first published 2026-09-18) reports: \"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.\"","support":[{"end":3224,"quote":"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":3006},{"end":5947,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":5912},{"end":5701,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763478","source_sha256":"0642934a252cd95163deb7b0f0cd5c3feb889251bec8ee204c7e66dce98dc614","start":5684}],"target_id":"claim.frontier.pmid-42763478","target_kind":"node","target_sha256":"e34e906d4589e4d32dbf416b8994404415b186c089b33b0972491e3a0dc83460"}],"claim.frontier.pmid-42763558":[{"id":"assertion.claim.frontier.pmid-42763558","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763558","quantifiers":"Only what the quoted sentence states","time":"2026-08-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763558 \"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center\" (CC BY, first published 2026-08-12) reports: \"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.\"","support":[{"end":2652,"quote":"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":2454},{"end":5717,"quote":"\"firstPublicationDate\":\"2026-08-12\"","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":5682},{"end":5471,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763558","source_sha256":"a6407777507e21b1ee873a58fb8b0ef419a88f775d6c51a996dd4a6d4d519c9c","start":5454}],"target_id":"claim.frontier.pmid-42763558","target_kind":"node","target_sha256":"103d90f877557544724d2b786f53fed4bb52150edab7e99043f0567f4231f6f0"}],"claim.frontier.pmid-42763617":[{"id":"assertion.claim.frontier.pmid-42763617","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42763617","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42763617 \"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult\" (CC BY, first published 2026-08-20) reports: \"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.\"","support":[{"end":3939,"quote":"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":3788},{"end":6117,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":6082},{"end":5871,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42763617","source_sha256":"174b40190f6b27be315d8be3c0a7f1f59593b7be89a4d494a73dcfd3f171a26d","start":5854}],"target_id":"claim.frontier.pmid-42763617","target_kind":"node","target_sha256":"8ae276aee04a0cf19b288c259147ceb5d1b8063f1ca1cf5e66a9982e0281f1a1"}],"claim.frontier.pmid-42764320":[{"id":"assertion.claim.frontier.pmid-42764320","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764320","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764320 \"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned\" (CC BY, first published 2026-09-21) reports: \"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.\"","support":[{"end":5048,"quote":"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":4946},{"end":8086,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":8051},{"end":7840,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764320","source_sha256":"7938fe5f717439d356bd602704998bf3c9240b28672c84e32844e5be40bc1c9b","start":7823}],"target_id":"claim.frontier.pmid-42764320","target_kind":"node","target_sha256":"93172fc364f76e46d471963b2452f6a38c5b0a1f94ee996941822f9fcfa95b42"}],"claim.frontier.pmid-42764822":[{"id":"assertion.claim.frontier.pmid-42764822","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764822","quantifiers":"Only what the quoted sentence states","time":"2026-08-20","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764822 \"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations\" (CC BY, first published 2026-08-20) reports: \"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.\"","support":[{"end":4128,"quote":"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":3850},{"end":5839,"quote":"\"firstPublicationDate\":\"2026-08-20\"","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":5804},{"end":5593,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764822","source_sha256":"f564634acd41e612859ecaede746689773d5db4a84ac456ec84a422b83815b90","start":5576}],"target_id":"claim.frontier.pmid-42764822","target_kind":"node","target_sha256":"1eae1f6fa20db095a99e1757843da8fc07d2c192ba07470bd1d645a24419d253"}],"claim.frontier.pmid-42764930":[{"id":"assertion.claim.frontier.pmid-42764930","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42764930","quantifiers":"Only what the quoted sentence states","time":"2026-08-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42764930 \"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit\" (CC BY, first published 2026-08-21) reports: \"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).\"","support":[{"end":2674,"quote":"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":2486},{"end":5275,"quote":"\"firstPublicationDate\":\"2026-08-21\"","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":5240},{"end":4981,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42764930","source_sha256":"3025001f3a22952e15fab3f1d8a617c73b0cad1d2041a49a25426d6157d6b54d","start":4964}],"target_id":"claim.frontier.pmid-42764930","target_kind":"node","target_sha256":"48fbdfbe3bf2fac12f6ece1dec03d0d9f6ab5f3fe77337748d05c3539d21ee07"}],"claim.frontier.pmid-42766546":[{"id":"assertion.claim.frontier.pmid-42766546","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766546","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766546 \"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry\" (CC BY, first published 2026-09-21) reports: \"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).\"","support":[{"end":4211,"quote":"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":4039},{"end":7649,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":7614},{"end":7355,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766546","source_sha256":"ee35859012ab15810371dfc49ec69734582cddfd7f58cedd45b153170e554dba","start":7338}],"target_id":"claim.frontier.pmid-42766546","target_kind":"node","target_sha256":"5d07402b6b63bb0e231349506c711d55b2ba35d8ed905fe97166c748ed61e48b"}],"claim.frontier.pmid-42766584":[{"id":"assertion.claim.frontier.pmid-42766584","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766584","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766584 \"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database\" (CC BY, first published 2026-09-21) reports: \"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.\"","support":[{"end":5733,"quote":"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":5566},{"end":8744,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":8709},{"end":8498,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766584","source_sha256":"6b25ff3e8b88cf93ce4d6cb50f3049cb8412bde27cbf9e9e3159521be302717c","start":8481}],"target_id":"claim.frontier.pmid-42766584","target_kind":"node","target_sha256":"94583cc13a882a87938504ab634be12e7e9f751dd0c3c4fe0a8f2a534f8022db"}],"claim.frontier.pmid-42766622":[{"id":"assertion.claim.frontier.pmid-42766622","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766622","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766622 \"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model\" (CC BY, first published 2026-09-21) reports: \"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.\"","support":[{"end":2566,"quote":"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":2401},{"end":5344,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":5309},{"end":5098,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766622","source_sha256":"f9f0a1253636c11c9001385a0d0c424486b30c93bb06b621eafdeae2815d2e44","start":5081}],"target_id":"claim.frontier.pmid-42766622","target_kind":"node","target_sha256":"38bdf578700de9cd024bb18eab2e72c7c5e9e483393d8d7de8fb4579a84be20e"}],"claim.frontier.pmid-42766660":[{"id":"assertion.claim.frontier.pmid-42766660","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42766660","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42766660 \"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart\" (CC BY, first published 2026-09-21) reports: \"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.\"","support":[{"end":5089,"quote":"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":4853},{"end":8754,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":8719},{"end":8460,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42766660","source_sha256":"7e23d0fdff56ea6474af61bca00ef8e28367369b3a70796b28310eadf6b423eb","start":8443}],"target_id":"claim.frontier.pmid-42766660","target_kind":"node","target_sha256":"7d90c252de7f8e22fa9014d0c2eb537bcfb8037347db13f5e7215d789ca05e75"}],"claim.frontier.pmid-42768354":[{"id":"assertion.claim.frontier.pmid-42768354","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768354","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768354 \"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency\" (CC BY, first published 2026-09-14) reports: \"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.\"","support":[{"end":5995,"quote":"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":5725},{"end":8405,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":8370},{"end":8159,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768354","source_sha256":"ff3c60291e24ff7dc3578c9c17f53094f66de65ff3a3a7222e812d67ca2bd0ab","start":8142}],"target_id":"claim.frontier.pmid-42768354","target_kind":"node","target_sha256":"511131e0cfb5869df054e2636ac7dfaaef1f5ede64215b55379f62cb77b554fc"}],"claim.frontier.pmid-42768386":[{"id":"assertion.claim.frontier.pmid-42768386","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768386","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768386 \"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations\" (CC BY, first published 2026-09-15) reports: \"Our analysis revealed variation in the gut resistome across population groups and countries.\"","support":[{"end":2780,"quote":"Our analysis revealed variation in the gut resistome across population groups and countries.","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":2688},{"end":5343,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":5308},{"end":5097,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768386","source_sha256":"53ff67cf47270e877c69d869c04944829e9ec1b93816e3fbd9a47306820d636a","start":5080}],"target_id":"claim.frontier.pmid-42768386","target_kind":"node","target_sha256":"2fc3942a3e408a656b3a6aed3adcf43ecb4d31bcb3cd80f6ccd9994ff6e556bd"}],"claim.frontier.pmid-42768698":[{"id":"assertion.claim.frontier.pmid-42768698","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42768698","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42768698 \"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish\" (CC BY, first published 2026-09-01) reports: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","support":[{"end":4145,"quote":"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":3932},{"end":6693,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":6658},{"end":6488,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42768698","source_sha256":"b56112105a9ba2cc77490d7d6f02484b9e8f2f17fa4ef894fe1b2af9b1c70831","start":6471}],"target_id":"claim.frontier.pmid-42768698","target_kind":"node","target_sha256":"d16f815221a9f8f9955bc3064cb052814b4576afbef8ec09cf7e2d7259cde90b"}],"claim.frontier.pmid-42769130":[{"id":"assertion.claim.frontier.pmid-42769130","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42769130","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42769130 \"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis\" (CC BY, first published 2026-09-07) reports: \"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.\"","support":[{"end":4486,"quote":"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":4310},{"end":6319,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":6284},{"end":6073,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42769130","source_sha256":"f3ffcd989e031da68ffc1ac0b4ab49848c66a73051db54f76c310ab9a9a3528a","start":6056}],"target_id":"claim.frontier.pmid-42769130","target_kind":"node","target_sha256":"560b996eb2c8d1c2d6925713fe4d93a89605ee3e95cee5fdffb114697c7cad8f"}],"claim.frontier.pmid-42769220":[{"id":"assertion.claim.frontier.pmid-42769220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42769220","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42769220 \"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD\" (CC BY, first published 2026-09-07) reports: \"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.\"","support":[{"end":7096,"quote":"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":6981},{"end":8869,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":8834},{"end":8623,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42769220","source_sha256":"a8602803bacd2b660285ad4be165cabc3dca468e40c3fcd221e5183df8c48c4a","start":8606}],"target_id":"claim.frontier.pmid-42769220","target_kind":"node","target_sha256":"8f786db61c9a61bc1b6494764fa3bb3e2b65649ece729dbce4efe50248d4171c"}],"claim.frontier.pmid-42773366":[{"id":"assertion.claim.frontier.pmid-42773366","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42773366","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42773366 \"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)\" (CC BY, first published 2026-09-23) reports: \"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).\"","support":[{"end":5727,"quote":"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":5623},{"end":9426,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":9391},{"end":9180,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42773366","source_sha256":"c3637375eaa985015c6bb6e9f3e06a1280d276e775c173dca8577c1634f65768","start":9163}],"target_id":"claim.frontier.pmid-42773366","target_kind":"node","target_sha256":"86297ab4334c2016726a388e55888e23cc24efbb35730f5f8d1b5dac42a16d16"}],"claim.frontier.pmid-42775227":[{"id":"assertion.claim.frontier.pmid-42775227","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42775227","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42775227 \"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions\" (CC BY, first published 2026-09-08) reports: \"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.\"","support":[{"end":2705,"quote":"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":2417},{"end":4974,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":4939},{"end":4728,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42775227","source_sha256":"30e6421cd352975d99000d317dc3dff4babf333d1bc132a6990038d033cf22c5","start":4711}],"target_id":"claim.frontier.pmid-42775227","target_kind":"node","target_sha256":"875b55614ce3b1cc013df0876b1fdf2eb9ead0d6be2af2f5c3724fde3743c2a1"}],"claim.frontier.pmid-42776569":[{"id":"assertion.claim.frontier.pmid-42776569","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42776569","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42776569 \"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>\" (CC BY, first published 2026-09-01) reports: \"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.\"","support":[{"end":4122,"quote":"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":3959},{"end":7302,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":7267},{"end":7097,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42776569","source_sha256":"62c77a854c17ac2581a10e6c697e4ba5ad940dacd95adb4b0b3017c0381a2610","start":7080}],"target_id":"claim.frontier.pmid-42776569","target_kind":"node","target_sha256":"5e9bd15f7986cdf1d179e8236101e374642c017396cca740094f6836bc2fa97a"}],"claim.frontier.pmid-42777016":[{"id":"assertion.claim.frontier.pmid-42777016","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42777016","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42777016 \"Deterministic dynamics of distributional multi-agent reinforcement learning\" (CC BY, first published 2026-09-23) reports: \"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.\"","support":[{"end":3237,"quote":"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":3124},{"end":6137,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":6102},{"end":5891,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42777016","source_sha256":"c0845c2c684f32851784c2e2c7991d7bc7eddd2e94470c6c19fcea2aa427b671","start":5874}],"target_id":"claim.frontier.pmid-42777016","target_kind":"node","target_sha256":"18005dc6614749cedf971a21f41139ad28c6367fb2c3a6c1ebedcedccb99225e"}],"claim.frontier.pmid-42778332":[{"id":"assertion.claim.frontier.pmid-42778332","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778332","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778332 \"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual\" (CC BY, first published 2026-09-23) reports: \"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.\"","support":[{"end":4105,"quote":"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":3887},{"end":7195,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":7160},{"end":6949,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778332","source_sha256":"448f200878011e3faa936708d6a37ec32ed913dd91c5def482b373da9cf4fdf3","start":6932}],"target_id":"claim.frontier.pmid-42778332","target_kind":"node","target_sha256":"7856b2d851f599958901ce42a11146477f7cee917537188f36b16eeb41a80e7e"}],"claim.frontier.pmid-42778576":[{"id":"assertion.claim.frontier.pmid-42778576","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778576","quantifiers":"Only what the quoted sentence states","time":"2026-08-22","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778576 \"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables\" (CC BY, first published 2026-08-22) reports: \"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.\"","support":[{"end":2176,"quote":"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":2003},{"end":5284,"quote":"\"firstPublicationDate\":\"2026-08-22\"","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":5249},{"end":4990,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778576","source_sha256":"6478e7d93abc95085c8b69555e2a622dc7c9a3892dd2659902f95a012af638bc","start":4973}],"target_id":"claim.frontier.pmid-42778576","target_kind":"node","target_sha256":"6d90a47fec2c97d443d6f6e22dfe11947613df8cb703f425b799f6f6957d4f0a"}],"claim.frontier.pmid-42778666":[{"id":"assertion.claim.frontier.pmid-42778666","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42778666","quantifiers":"Only what the quoted sentence states","time":"2026-09-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42778666 \"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils\" (CC BY, first published 2026-09-23) reports: \"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.\"","support":[{"end":4745,"quote":"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":4604},{"end":7408,"quote":"\"firstPublicationDate\":\"2026-09-23\"","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":7373},{"end":7114,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42778666","source_sha256":"361c6a885e26ece6c17b94427b7712f64ddca24587b880da34d9ab7acc886f3e","start":7097}],"target_id":"claim.frontier.pmid-42778666","target_kind":"node","target_sha256":"75b23dfb58f9613ccf2866bfed9e16f7cff1f68c45f63c1803cb89a52563f18b"}],"claim.frontier.pmid-42780909":[{"id":"assertion.claim.frontier.pmid-42780909","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42780909","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42780909 \"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes\" (CC BY, first published 2026-09-09) reports: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","support":[{"end":4951,"quote":"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":4660},{"end":7885,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":7850},{"end":7591,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42780909","source_sha256":"ce48554fafc4b953beb4c94481eaf2d0abaaaa36df8877450ba730a0bb54d0c2","start":7574}],"target_id":"claim.frontier.pmid-42780909","target_kind":"node","target_sha256":"a922344b9decc15b2452871095e11c27995b8dfec6ab986dd1ef2eb3fcfcb32f"}],"claim.frontier.pmid-42780961":[{"id":"assertion.claim.frontier.pmid-42780961","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42780961","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42780961 \"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives\" (CC BY, first published 2026-09-09) reports: \"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.\"","support":[{"end":4684,"quote":"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":4474},{"end":6423,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":6388},{"end":6129,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42780961","source_sha256":"c4776b32fe3fba16b98ee97c807931e4ed5d35f29ab8042784502a36bdf2d125","start":6112}],"target_id":"claim.frontier.pmid-42780961","target_kind":"node","target_sha256":"26cd411f87e038e94c33206749e7f8620e1d9c7a23a5a74d0ebbb5b6764a377e"}],"claim.frontier.pmid-42781208":[{"id":"assertion.claim.frontier.pmid-42781208","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781208","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781208 \"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients\" (CC BY, first published 2026-08-24) reports: \"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.\"","support":[{"end":2826,"quote":"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":2634},{"end":4570,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":4535},{"end":4324,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781208","source_sha256":"c0dd6f422b2493e305f2467f6dfaa09039601b1c45513caa56da649cb54545ec","start":4307}],"target_id":"claim.frontier.pmid-42781208","target_kind":"node","target_sha256":"7f9ca90b2d53ac3cf6549f56d9197c82bf11367d8fe5c996acb2c28bfdde4dfe"}],"claim.frontier.pmid-42781598":[{"id":"assertion.claim.frontier.pmid-42781598","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781598","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781598 \"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report\" (CC BY, first published 2026-08-24) reports: \"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.\"","support":[{"end":2730,"quote":"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":2576},{"end":6037,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":6002},{"end":5743,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781598","source_sha256":"d0205bf0ba1c95f6e97d1613c4667dc915838e420976cb72fbd63a7b7ab42d9e","start":5726}],"target_id":"claim.frontier.pmid-42781598","target_kind":"node","target_sha256":"80f140584aee1955c692a949f7573e397ef512df6ec6952c15478e83f8884fd0"}],"claim.frontier.pmid-42781606":[{"id":"assertion.claim.frontier.pmid-42781606","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42781606","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42781606 \"From Distraction to Delay: Unpacking Academic Procrastination\" (CC BY, first published 2026-08-28) reports: \"These findings highlight the combined role of personal and cognitive factors in academic procrastination.\"","support":[{"end":3127,"quote":"These findings highlight the combined role of personal and cognitive factors in academic procrastination.","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":3022},{"end":4755,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":4720},{"end":4461,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42781606","source_sha256":"878ea969f45d5d2299ac785fb349978ae07da1ee95326aa02d55a475736b9625","start":4444}],"target_id":"claim.frontier.pmid-42781606","target_kind":"node","target_sha256":"9645e4eff4e196a2374ab4c0da701b9af86a2c42069b38dbdba414f583d9928f"}],"claim.frontier.pmid-42782937":[{"id":"assertion.claim.frontier.pmid-42782937","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42782937","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42782937 \"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing\" (CC BY, first published 2026-09-01) reports: \"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.\"","support":[{"end":4840,"quote":"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":4662},{"end":6638,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":6603},{"end":6392,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42782937","source_sha256":"0ac711a6fd39f1ec963f53704b2d3b7bf2e8ac3ebe0127295d78b872581523a8","start":6375}],"target_id":"claim.frontier.pmid-42782937","target_kind":"node","target_sha256":"6c61e750208a558dd0f7f9ccc00c6c0dfe8bd2cf27aff7ca1d5cdb321fb063de"}],"claim.frontier.pmid-42783218":[{"id":"assertion.claim.frontier.pmid-42783218","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42783218","quantifiers":"Only what the quoted sentence states","time":"2026-09-05","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42783218 \"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study\" (CC BY, first published 2026-09-05) reports: \": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.\"","support":[{"end":3322,"quote":": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":3168},{"end":4924,"quote":"\"firstPublicationDate\":\"2026-09-05\"","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":4889},{"end":4678,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42783218","source_sha256":"546754ff6afa5b1aa743634ad158fc853f8beb9ccb8d86efb186f9eb76796a4d","start":4661}],"target_id":"claim.frontier.pmid-42783218","target_kind":"node","target_sha256":"3e4ecf846702399e377cdd5f3fd3462784080c8f451c88096784b77876c2f34a"}],"claim.frontier.pmid-42784269":[{"id":"assertion.claim.frontier.pmid-42784269","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784269","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784269 \"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions\" (CC BY, first published 2026-09-11) reports: \"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.\"","support":[{"end":5903,"quote":"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":5618},{"end":10257,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":10222},{"end":10011,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784269","source_sha256":"57e8cdac77987bbd3ef42e4a06a73ba7365c2c0eb3956d9488705695e4d60a4d","start":9994}],"target_id":"claim.frontier.pmid-42784269","target_kind":"node","target_sha256":"9e26b5208db041f9f2c4cb289141916557a2141813f10f25c3eec635f6718f52"}],"claim.frontier.pmid-42784570":[{"id":"assertion.claim.frontier.pmid-42784570","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784570","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784570 \"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia\" (CC BY, first published 2026-09-24) reports: \"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.\"","support":[{"end":3746,"quote":"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":3523},{"end":4970,"quote":"\"firstPublicationDate\":\"2026-09-24\"","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":4935},{"end":4724,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784570","source_sha256":"748170ec6b1445059ae6c2daa05cc069b54d87693e8ce27fc6175690234a12d9","start":4707}],"target_id":"claim.frontier.pmid-42784570","target_kind":"node","target_sha256":"f9bd7be52f579657c9af38ab494577931f5b0ecb89e7c026127a3982a1572b6b"}],"claim.frontier.pmid-42784649":[{"id":"assertion.claim.frontier.pmid-42784649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42784649","quantifiers":"Only what the quoted sentence states","time":"2026-09-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42784649 \"Negative emotions concentrate while positive emotions diffuse in football fan rivalries\" (CC BY, first published 2026-09-24) reports: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","support":[{"end":2955,"quote":"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":2778},{"end":4560,"quote":"\"firstPublicationDate\":\"2026-09-24\"","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":4525},{"end":4314,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42784649","source_sha256":"e0b4a3d4847f79e2950ba1372ebfdebf35bfda3195e7595346e3685e44e5eb27","start":4297}],"target_id":"claim.frontier.pmid-42784649","target_kind":"node","target_sha256":"bc3d8f87cca3c82b1784bc888c0ffd9d0fe2a411898b6c1324ebb5857f74dc72"}],"claim.frontier.pmid-42786167":[{"id":"assertion.claim.frontier.pmid-42786167","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42786167","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42786167 \"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures\" (CC BY, first published 2026-08-26) reports: \"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.\"","support":[{"end":8513,"quote":"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":8266},{"end":12121,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":12086},{"end":11811,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42786167","source_sha256":"29352f602f416b23e41cbcae47225d9de6a159a70a2b796851376f4ac416275c","start":11794}],"target_id":"claim.frontier.pmid-42786167","target_kind":"node","target_sha256":"8789568b14767e7b7247f1f35a858df0046d5cb492883ac41c5fb65f5c523902"}],"claim.frontier.pmid-42788599":[{"id":"assertion.claim.frontier.pmid-42788599","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42788599","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42788599 \"Septic arthritis caused by Nocardia asiatica: a case report and narrative review\" (CC BY, first published 2026-09-18) reports: \"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.\"","support":[{"end":1681,"quote":"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":1519},{"end":4920,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":4885},{"end":4674,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42788599","source_sha256":"e3bad360d126c9210947f14b451c27151802bc3599e4036a83fb1e3e0533d6fe","start":4657}],"target_id":"claim.frontier.pmid-42788599","target_kind":"node","target_sha256":"3d4479c4e8ff5d0aefb6b7f2d01a16d5f70984729e70be52dfbfbe96dd355680"}],"claim.frontier.pmid-42789505":[{"id":"assertion.claim.frontier.pmid-42789505","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42789505","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42789505 \"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system\" (CC BY, first published 2026-09-25) reports: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","support":[{"end":4227,"quote":"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":4007},{"end":7052,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":7017},{"end":6806,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42789505","source_sha256":"aec1b93a13031efe085bdc172cbbb4e070a5b86df9cffebef9c2b5f49a7a671b","start":6789}],"target_id":"claim.frontier.pmid-42789505","target_kind":"node","target_sha256":"15845e75aa7b54e679b79e1dcc8d74987c056a1cf81aee32a728f7bbb984a85e"}],"claim.frontier.pmid-42789524":[{"id":"assertion.claim.frontier.pmid-42789524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42789524","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42789524 \"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study\" (CC BY, first published 2026-09-25) reports: \"Problem-focused and emotion-focused coping strategies were associated with better QoL.\"","support":[{"end":2596,"quote":"Problem-focused and emotion-focused coping strategies were associated with better QoL.","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":2510},{"end":6434,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":6399},{"end":6188,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42789524","source_sha256":"ce9945e2b6b5bd56f0e67f4959b38df6884c7a238c985c6f8271cc1c360d587b","start":6171}],"target_id":"claim.frontier.pmid-42789524","target_kind":"node","target_sha256":"52589004a59b47135df7d96875da52a16f7508df6507a39df8acd7d50f6d2728"}],"claim.frontier.pmid-42791331":[{"id":"assertion.claim.frontier.pmid-42791331","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42791331","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42791331 \"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort\" (CC BY, first published 2026-09-25) reports: \"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.\"","support":[{"end":4649,"quote":"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":4504},{"end":7092,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":7057},{"end":6846,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42791331","source_sha256":"cdb8e45d29874c4a834065d9bed57f7630f5a7f9f3c36c77aa5c8e0c1addb86f","start":6829}],"target_id":"claim.frontier.pmid-42791331","target_kind":"node","target_sha256":"3b2a5bc8bb9fc122d069d502853f8e9941271793aafb3c8631c3fc00448dbe14"}],"claim.frontier.pmid-42791987":[{"id":"assertion.claim.frontier.pmid-42791987","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42791987","quantifiers":"Only what the quoted sentence states","time":"2026-08-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42791987 \"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients\" (CC BY, first published 2026-08-29) reports: \"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.\"","support":[{"end":3412,"quote":"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":3150},{"end":6130,"quote":"\"firstPublicationDate\":\"2026-08-29\"","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":6095},{"end":5836,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42791987","source_sha256":"7b5d1cd3094e981c576efc87200547ac2acafb60abdaf03cd5a98125793b7dd1","start":5819}],"target_id":"claim.frontier.pmid-42791987","target_kind":"node","target_sha256":"1cc1334be3a0116a3573d9601fe1ed6ceba75b15d19fe127555eeb0d5d2413fd"}],"claim.frontier.pmid-42792025":[{"id":"assertion.claim.frontier.pmid-42792025","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792025","quantifiers":"Only what the quoted sentence states","time":"2026-09-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792025 \"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens\" (CC BY, first published 2026-09-07) reports: \": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.\"","support":[{"end":8331,"quote":": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":8042},{"end":10201,"quote":"\"firstPublicationDate\":\"2026-09-07\"","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":10166},{"end":9907,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792025","source_sha256":"32646e00a015bbfcac57cb46ce91e207dba514e923e363e2313e2a5e52e240b9","start":9890}],"target_id":"claim.frontier.pmid-42792025","target_kind":"node","target_sha256":"44c12dc7e8e0501bce8efea810856c0019bcc8a4ab49931bc73ff883df0e8643"}],"claim.frontier.pmid-42792321":[{"id":"assertion.claim.frontier.pmid-42792321","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792321","quantifiers":"Only what the quoted sentence states","time":"2026-08-28","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792321 \"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior\" (CC BY, first published 2026-08-28) reports: \"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.\"","support":[{"end":2898,"quote":"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":2579},{"end":5633,"quote":"\"firstPublicationDate\":\"2026-08-28\"","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":5598},{"end":5387,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792321","source_sha256":"ff0eb05d739bc89d93a552503d40b6b0c3893b3da732568787df14709a639b84","start":5370}],"target_id":"claim.frontier.pmid-42792321","target_kind":"node","target_sha256":"7d26809e0ef742234566bd7cca38f7ae113df27e21723fdaac340ec354aa85e7"}],"claim.frontier.pmid-42792412":[{"id":"assertion.claim.frontier.pmid-42792412","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792412","quantifiers":"Only what the quoted sentence states","time":"2026-09-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792412 \"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students\" (CC BY, first published 2026-09-09) reports: \"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.\"","support":[{"end":4047,"quote":"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":3822},{"end":5722,"quote":"\"firstPublicationDate\":\"2026-09-09\"","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":5687},{"end":5476,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792412","source_sha256":"898da0197e91b4b58c6cc3da7b9c637f155e4e14cec8a72ebe7fd83c57f77eea","start":5459}],"target_id":"claim.frontier.pmid-42792412","target_kind":"node","target_sha256":"1c8179c74b627ff1629ab2a0a74ce7255dd4bde215f5d7c49aa022d293db8cca"}],"claim.frontier.pmid-42792502":[{"id":"assertion.claim.frontier.pmid-42792502","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42792502","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42792502 \"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students\" (CC BY, first published 2026-09-21) reports: \"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).\"","support":[{"end":2350,"quote":"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":2151},{"end":4553,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":4518},{"end":4259,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42792502","source_sha256":"186b00cb7bcaca5f2efdedbaaa4af16a1d39d8975509aff580392094022d8982","start":4242}],"target_id":"claim.frontier.pmid-42792502","target_kind":"node","target_sha256":"110dbb052f436b65e06b0ba3935796cf97fed682cefdcfc1c6d2c9070ab3f101"}],"claim.frontier.pmid-42793476":[{"id":"assertion.claim.frontier.pmid-42793476","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42793476","quantifiers":"Only what the quoted sentence states","time":"2026-09-10","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42793476 \"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study\" (CC BY, first published 2026-09-10) reports: \"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.\"","support":[{"end":4054,"quote":"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":3729},{"end":5705,"quote":"\"firstPublicationDate\":\"2026-09-10\"","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":5670},{"end":5459,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42793476","source_sha256":"eec084bb1ae824ceb819cce5a344254cc937c2b46cc1f5994da90f261f813ddd","start":5442}],"target_id":"claim.frontier.pmid-42793476","target_kind":"node","target_sha256":"5b215f8f8a18ca204ce48a5f50b201d575868953e931a29243c403216e4839f3"}],"claim.frontier.pmid-42794013":[{"id":"assertion.claim.frontier.pmid-42794013","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794013","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794013 \"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review\" (CC BY, first published 2026-09-12) reports: \"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.\"","support":[{"end":4520,"quote":"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":4272},{"end":6188,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":6153},{"end":5942,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794013","source_sha256":"713a50261d41dcd66c81ccd090614d79e3307da9ee3f9faf40720d6695e2c28c","start":5925}],"target_id":"claim.frontier.pmid-42794013","target_kind":"node","target_sha256":"80e3f4a07f7d28ca78b72bc4131f69916a8c511063cf7f5e54d7432e791d60b4"}],"claim.frontier.pmid-42794146":[{"id":"assertion.claim.frontier.pmid-42794146","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794146","quantifiers":"Only what the quoted sentence states","time":"2026-08-23","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794146 \"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor\" (CC BY, first published 2026-08-23) reports: \": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.\"","support":[{"end":4192,"quote":": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":3995},{"end":7205,"quote":"\"firstPublicationDate\":\"2026-08-23\"","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":7170},{"end":6959,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794146","source_sha256":"f604b549e19f37674ab3d8130ea8af0b1073620d78a7dd09f248245d0eb90631","start":6942}],"target_id":"claim.frontier.pmid-42794146","target_kind":"node","target_sha256":"321e8ea6feb2db1df6faff25168b8783ffa281779cc3a6a4e1571d29ad17e531"}],"claim.frontier.pmid-42794677":[{"id":"assertion.claim.frontier.pmid-42794677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794677","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794677 \"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling\" (CC BY, first published 2026-09-16) reports: \"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.\"","support":[{"end":4387,"quote":"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":4194},{"end":8682,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":8647},{"end":8388,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794677","source_sha256":"2b7bcef981131b364ac11d5117561234f3e82d411ae407f022b19bbec23ce327","start":8371}],"target_id":"claim.frontier.pmid-42794677","target_kind":"node","target_sha256":"80cf075f5a95d02eab8fdfee025710d00178e68b62852637b7475c822ad66708"}],"claim.frontier.pmid-42794852":[{"id":"assertion.claim.frontier.pmid-42794852","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42794852","quantifiers":"Only what the quoted sentence states","time":"2026-09-21","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42794852 \"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology\" (CC BY, first published 2026-09-21) reports: \"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.\"","support":[{"end":2833,"quote":"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":2700},{"end":7239,"quote":"\"firstPublicationDate\":\"2026-09-21\"","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":7204},{"end":6945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42794852","source_sha256":"fc90df67447c09b59358063dc9e22a1896134b4536fd1fa54fd8b7d71839c1d6","start":6928}],"target_id":"claim.frontier.pmid-42794852","target_kind":"node","target_sha256":"38e0ab7090717e65b5719f362dd279cee5f15d3e9fac27c8d4c424908730bbe6"}],"claim.frontier.pmid-42795560":[{"id":"assertion.claim.frontier.pmid-42795560","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795560","quantifiers":"Only what the quoted sentence states","time":"2026-09-08","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795560 \"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study\" (CC BY, first published 2026-09-08) reports: \"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).\"","support":[{"end":6270,"quote":"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":6038},{"end":8137,"quote":"\"firstPublicationDate\":\"2026-09-08\"","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":8102},{"end":7843,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795560","source_sha256":"883e68f977663b522a6e2e9ef6866c983012da3fecc33a71b43a152c51e44668","start":7826}],"target_id":"claim.frontier.pmid-42795560","target_kind":"node","target_sha256":"d196f82f6d514cb255365c3832b905eee167485d0482f045a42929590cd39333"}],"claim.frontier.pmid-42795646":[{"id":"assertion.claim.frontier.pmid-42795646","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795646","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795646 \"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes\" (CC BY, first published 2026-09-16) reports: \"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.\"","support":[{"end":3910,"quote":"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":3783},{"end":5559,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":5524},{"end":5313,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795646","source_sha256":"b4da5e73f14656238837a316495c7f22c039de14a6d66ff2c6a27c2e4c597861","start":5296}],"target_id":"claim.frontier.pmid-42795646","target_kind":"node","target_sha256":"97e66b6445d72b236dfcad0e483dba8b0f191aaa99546a9263dbc8211c51923d"}],"claim.frontier.pmid-42795904":[{"id":"assertion.claim.frontier.pmid-42795904","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795904","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795904 \"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer\" (CC BY, first published 2026-09-14) reports: \"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.\"","support":[{"end":4340,"quote":"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":4123},{"end":6398,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":6363},{"end":6076,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795904","source_sha256":"8c98c10c8125e895fdf15fb4a4802942519402a60e7cc3c7f99f723f5c897728","start":6059}],"target_id":"claim.frontier.pmid-42795904","target_kind":"node","target_sha256":"160414011ac188e4a8db894a437906c57994d1b981f168c1448dd7f3ec9d71b7"}],"claim.frontier.pmid-42795945":[{"id":"assertion.claim.frontier.pmid-42795945","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795945","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795945 \"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study\" (CC BY, first published 2026-09-15) reports: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","support":[{"end":3699,"quote":": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":3487},{"end":7229,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":7194},{"end":6935,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795945","source_sha256":"80c0f673987ebe93d675ae95052e461c9d3b160bbba7966beac4b32e9141be52","start":6918}],"target_id":"claim.frontier.pmid-42795945","target_kind":"node","target_sha256":"8d0392e293f252f02590dbacbb38fc3bc3637f823cc4912aa040cadbe2ddd648"}],"claim.frontier.pmid-42795965":[{"id":"assertion.claim.frontier.pmid-42795965","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42795965","quantifiers":"Only what the quoted sentence states","time":"2026-09-16","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42795965 \"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study\" (CC BY, first published 2026-09-16) reports: \"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.\"","support":[{"end":7413,"quote":"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":7262},{"end":9098,"quote":"\"firstPublicationDate\":\"2026-09-16\"","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":9063},{"end":8804,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42795965","source_sha256":"245c5256f18c97af5d1811284c60593249ae19f2f986979e9e81f115570fb312","start":8787}],"target_id":"claim.frontier.pmid-42795965","target_kind":"node","target_sha256":"413c17fe9b3b12a945a1debf5a06fce461669ffce31f9188fac163d56ca6ca77"}],"claim.frontier.pmid-42796013":[{"id":"assertion.claim.frontier.pmid-42796013","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796013","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796013 \"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study\" (CC BY, first published 2026-09-17) reports: \": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.\"","support":[{"end":9598,"quote":": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":9345},{"end":11011,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":10976},{"end":10717,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796013","source_sha256":"73f106b3a393c79bee59127226a1310a3631401a16b5388d5c69eeb5062437f0","start":10700}],"target_id":"claim.frontier.pmid-42796013","target_kind":"node","target_sha256":"0bd4d8704511cb91e011a8069f1527b8248256f9675a0fac217a30b0e8ddac4c"}],"claim.frontier.pmid-42796055":[{"id":"assertion.claim.frontier.pmid-42796055","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796055","quantifiers":"Only what the quoted sentence states","time":"2026-09-19","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796055 \"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention\" (CC BY, first published 2026-09-19) reports: \"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.\"","support":[{"end":4807,"quote":"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":4603},{"end":8189,"quote":"\"firstPublicationDate\":\"2026-09-19\"","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":8154},{"end":7943,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796055","source_sha256":"40521121c85a68cf962d47746b5902273c18b3f3227e216db3d17068c08638c4","start":7926}],"target_id":"claim.frontier.pmid-42796055","target_kind":"node","target_sha256":"25baec8bc78d2ac1a188cad2d55d01c72f46a5bf1cc645bd6ad827f329157748"}],"claim.frontier.pmid-42796271":[{"id":"assertion.claim.frontier.pmid-42796271","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796271","quantifiers":"Only what the quoted sentence states","time":"2026-08-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796271 \"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review\" (CC BY, first published 2026-08-30) reports: \"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.\"","support":[{"end":4805,"quote":"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":4523},{"end":9439,"quote":"\"firstPublicationDate\":\"2026-08-30\"","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":9404},{"end":9145,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796271","source_sha256":"fc0fdda467d7ba339fe48594ddbcba106c36aca843b688d2fabfbe35dbaad6e5","start":9128}],"target_id":"claim.frontier.pmid-42796271","target_kind":"node","target_sha256":"57c45b4633893feee7845804f202e48e0a5d5bf1885abb4a7289ec13ead34842"}],"claim.frontier.pmid-42796692":[{"id":"assertion.claim.frontier.pmid-42796692","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796692","quantifiers":"Only what the quoted sentence states","time":"2026-09-02","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796692 \"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines\" (CC BY, first published 2026-09-02) reports: \"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.\"","support":[{"end":1922,"quote":"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":1835},{"end":6798,"quote":"\"firstPublicationDate\":\"2026-09-02\"","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":6763},{"end":6504,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796692","source_sha256":"b4df9b286f5c377346bc534adaf0b2f5f29c193cdb5271ded1c46f9fc41b7c13","start":6487}],"target_id":"claim.frontier.pmid-42796692","target_kind":"node","target_sha256":"b40c4f506b182b460b64d80fbb7257e61fb48b96f1ed7715999b0dd29f979a76"}],"claim.frontier.pmid-42796834":[{"id":"assertion.claim.frontier.pmid-42796834","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42796834","quantifiers":"Only what the quoted sentence states","time":"2026-09-12","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42796834 \"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling\" (CC BY, first published 2026-09-12) reports: \"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.\"","support":[{"end":4228,"quote":"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":3948},{"end":6734,"quote":"\"firstPublicationDate\":\"2026-09-12\"","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":6699},{"end":6440,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42796834","source_sha256":"a6bc0de06b3dd56ab7dae6817e7c485dba32345a48229f2d7beec7401ea6cad8","start":6423}],"target_id":"claim.frontier.pmid-42796834","target_kind":"node","target_sha256":"f1e61554a931f073853bc966422fa5fa076e0a91792e38275cf4dc2ae6acf98a"}],"claim.frontier.pmid-42797642":[{"id":"assertion.claim.frontier.pmid-42797642","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42797642","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42797642 \"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?\" (CC BY, first published 2026-09-18) reports: \": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.\"","support":[{"end":4652,"quote":": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":4237},{"end":6022,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":5987},{"end":5776,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42797642","source_sha256":"b9d0f313ffaa2fb7482df1795a2afc2e5e0773fb916540170687eb71fcc0c98e","start":5759}],"target_id":"claim.frontier.pmid-42797642","target_kind":"node","target_sha256":"84d2079b4d9be7a3813d3aa992e844238b8841d7559827e3d4a028883dd61773"}],"claim.frontier.pmid-42798110":[{"id":"assertion.claim.frontier.pmid-42798110","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798110","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798110 \"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery\" (CC BY, first published 2026-09-01) reports: \"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.\"","support":[{"end":4058,"quote":"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":3960},{"end":6298,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":6263},{"end":6093,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798110","source_sha256":"82b2c42b1e0dd07503b7def9f77f4a4113adf53aea802481029d4680374793f7","start":6076}],"target_id":"claim.frontier.pmid-42798110","target_kind":"node","target_sha256":"1ac6a92f2eec7f9d1f971e8de49a9aaecbd3177fe1dffaa19126455e9e7f37f8"}],"claim.frontier.pmid-42798137":[{"id":"assertion.claim.frontier.pmid-42798137","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798137","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798137 \"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest\" (CC BY, first published 2026-09-01) reports: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","support":[{"end":4392,"quote":"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":4098},{"end":7085,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":7050},{"end":6821,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798137","source_sha256":"5081b3e19950c19b75b21375083579b5b902009cba9bf520dad645550d229db9","start":6804}],"target_id":"claim.frontier.pmid-42798137","target_kind":"node","target_sha256":"1cddafad339cf44d3b12f13c96eb892364883ac4586373f356f933a18ce6ad8a"}],"claim.frontier.pmid-42798632":[{"id":"assertion.claim.frontier.pmid-42798632","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798632","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798632 \"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients\" (CC BY, first published 2026-09-11) reports: \"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.\"","support":[{"end":7699,"quote":"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":7538},{"end":9372,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":9337},{"end":9126,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798632","source_sha256":"7c6085874d583d8ebc0a914554fa76bf98fe7e9f60ef52209fa458f90dc0c51b","start":9109}],"target_id":"claim.frontier.pmid-42798632","target_kind":"node","target_sha256":"f48d5b985c3a81e267e22f634fffccbb52a67f5f7750efa0c8ebc39f50c2800c"}],"claim.frontier.pmid-42798637":[{"id":"assertion.claim.frontier.pmid-42798637","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798637","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798637 \"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone\" (CC BY, first published 2026-09-11) reports: \"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.\"","support":[{"end":4830,"quote":"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":4586},{"end":8242,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":8207},{"end":7996,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798637","source_sha256":"21ecf28d45f2a6c3a2a1fcabd8025b4695154d12e5e961956c81dd2491d69f4b","start":7979}],"target_id":"claim.frontier.pmid-42798637","target_kind":"node","target_sha256":"1ecf65ae30ff562b30d25821bc1f4b352f87d2eeb6e9ab4a9a6e4a47e0294d0c"}],"claim.frontier.pmid-42798644":[{"id":"assertion.claim.frontier.pmid-42798644","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798644","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798644 \"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review\" (CC BY, first published 2026-09-11) reports: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","support":[{"end":3371,"quote":"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":3193},{"end":4766,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":4731},{"end":4520,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798644","source_sha256":"0528e35ed45a060e5c9cde07b10ab4d3776cdd67869803013c441002f125ceea","start":4503}],"target_id":"claim.frontier.pmid-42798644","target_kind":"node","target_sha256":"a881e2dd158a497c4ab73ab6dcf117f664e7e1f18b4591e357fb331aabfd6f74"}],"claim.frontier.pmid-42798677":[{"id":"assertion.claim.frontier.pmid-42798677","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42798677","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42798677 \"Arts participation and mental health: evidence from the Chinese general social survey\" (CC BY, first published 2026-09-11) reports: \"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.\"","support":[{"end":2201,"quote":"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":1963},{"end":4173,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":4138},{"end":3927,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42798677","source_sha256":"2fd8177d72dc3c0204ed5efc0f856750f7f025404baa358bbfce03922a2ad3b3","start":3910}],"target_id":"claim.frontier.pmid-42798677","target_kind":"node","target_sha256":"908bac5c74b417267ced6974f10a97f734bdec053b9da7aac7eaa7814bea6e28"}],"claim.frontier.pmid-42799291":[{"id":"assertion.claim.frontier.pmid-42799291","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799291","quantifiers":"Only what the quoted sentence states","time":"2026-09-11","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799291 \"A review on clinical cases of rare mold infections and their antifungal treatment strategies\" (CC BY, first published 2026-09-11) reports: \"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.\"","support":[{"end":3650,"quote":"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":3471},{"end":6068,"quote":"\"firstPublicationDate\":\"2026-09-11\"","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":6033},{"end":5822,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799291","source_sha256":"9ba2d6d84429957ae4baefd23821f3b07a77347d3686f2262acf86c80dbfeb56","start":5805}],"target_id":"claim.frontier.pmid-42799291","target_kind":"node","target_sha256":"84dcf6802f43ecca9e650c3daa34679b74a4c59a19b8a21856e0d57a5889cc4b"}],"claim.frontier.pmid-42799489":[{"id":"assertion.claim.frontier.pmid-42799489","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799489","quantifiers":"Only what the quoted sentence states","time":"2026-09-25","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799489 \"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review\" (CC BY, first published 2026-09-25) reports: \"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.\"","support":[{"end":4814,"quote":"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":4616},{"end":6366,"quote":"\"firstPublicationDate\":\"2026-09-25\"","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":6331},{"end":6120,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799489","source_sha256":"a366b21e84d4ad52697d2621029a22214957e262bd417536409e1802ab413a51","start":6103}],"target_id":"claim.frontier.pmid-42799489","target_kind":"node","target_sha256":"a339627a20c8e4d51a6dd51da606e4646b7785107d49ffcc2f5010f93e391a15"}],"claim.frontier.pmid-42799507":[{"id":"assertion.claim.frontier.pmid-42799507","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42799507","quantifiers":"Only what the quoted sentence states","time":"2026-08-26","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42799507 \"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays\" (CC BY, first published 2026-08-26) reports: \"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.\"","support":[{"end":2054,"quote":"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":1759},{"end":4579,"quote":"\"firstPublicationDate\":\"2026-08-26\"","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":4544},{"end":4333,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42799507","source_sha256":"4b24dd4d2e2d33603132c9297193ebe1017ed10e0895ac6f7b7c31f37d78e095","start":4316}],"target_id":"claim.frontier.pmid-42799507","target_kind":"node","target_sha256":"a675bc3908e986f4c1ddf3f6fb147ec0d7fa5312fdfd07b9dfc81f43e8ce6c04"}],"claim.frontier.pmid-42802368":[{"id":"assertion.claim.frontier.pmid-42802368","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42802368","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42802368 \"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany\" (CC BY, first published 2026-09-01) reports: \"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.\"","support":[{"end":4377,"quote":"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":4211},{"end":7909,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":7874},{"end":7656,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42802368","source_sha256":"83818ccc8f92617415b2f978bd2fbffabf84089842a94b626be9ddc6cdcb5ee5","start":7639}],"target_id":"claim.frontier.pmid-42802368","target_kind":"node","target_sha256":"55bd5e132de6231d972cbfec108822dc2424f8ff76a3a75ebba0aaa8c1c2b8bb"}],"claim.frontier.pmid-42803191":[{"id":"assertion.claim.frontier.pmid-42803191","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42803191","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42803191 \"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly\" (CC BY, first published 2026-09-01) reports: \"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.\"","support":[{"end":5086,"quote":"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":4818},{"end":7905,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":7870},{"end":7632,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42803191","source_sha256":"b017c2c289d0321fefc24641751b1da074fcd10ea54084394b10b40ce3d44814","start":7615}],"target_id":"claim.frontier.pmid-42803191","target_kind":"node","target_sha256":"87db77cb1e7e772a0ff96b90c6b12a858076503615359552c2aec4d487d13f2f"}],"claim.frontier.pmid-42806242":[{"id":"assertion.claim.frontier.pmid-42806242","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42806242","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42806242 \"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback\" (CC BY, first published 2026-10-01) reports: \"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.\"","support":[{"end":7331,"quote":"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":7136},{"end":10361,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":10326},{"end":10083,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42806242","source_sha256":"200c276fc5fde3c55a140ddaba2d7d30fce666a8bb55e4ae95b8f20e1597c987","start":10066}],"target_id":"claim.frontier.pmid-42806242","target_kind":"node","target_sha256":"463a630e59c16c7d7a3366c3a43a17c1264e96bc188f5422a573e57c81d8a2ba"}],"claim.frontier.pmid-42806681":[{"id":"assertion.claim.frontier.pmid-42806681","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42806681","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42806681 \"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients\" (CC BY, first published 2026-10-01) reports: \"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].\"","support":[{"end":6635,"quote":"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":6379},{"end":10769,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":10734},{"end":10516,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42806681","source_sha256":"4391a3c86756ed53b18c4f78f96c723063b6ba8ea5673b3fa7ca7308ad2752f0","start":10499}],"target_id":"claim.frontier.pmid-42806681","target_kind":"node","target_sha256":"9a53b0df481173d0f84fc75acfa20739cd9f66f237d1903ffe408db633a10454"}],"claim.frontier.pmid-42807094":[{"id":"assertion.claim.frontier.pmid-42807094","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42807094","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42807094 \"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases\" (CC BY, first published 2026-09-14) reports: \"Our findings highlight an association between alcohol consumption and low BMD.\"","support":[{"end":4453,"quote":"Our findings highlight an association between alcohol consumption and low BMD.","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":4375},{"end":5991,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":5956},{"end":5745,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42807094","source_sha256":"877ddc65cd4c2ce00cb8ed036de45677d9358f990d2aa712c59fd6008a9b9766","start":5728}],"target_id":"claim.frontier.pmid-42807094","target_kind":"node","target_sha256":"d31c8c4608643d257a5e86a09802e4bb492e2a6d99084474fd3963512f9118a8"}],"claim.frontier.pmid-42807220":[{"id":"assertion.claim.frontier.pmid-42807220","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42807220","quantifiers":"Only what the quoted sentence states","time":"2026-09-14","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42807220 \"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review\" (CC BY, first published 2026-09-14) reports: \"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.\"","support":[{"end":5476,"quote":"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":5216},{"end":7664,"quote":"\"firstPublicationDate\":\"2026-09-14\"","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":7629},{"end":7418,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42807220","source_sha256":"e825342e44b7f41ae8d3c8f5891dc3379722d6d1810a8a92f71c71d3047281fa","start":7401}],"target_id":"claim.frontier.pmid-42807220","target_kind":"node","target_sha256":"9a1e4b00b5a750beffc068d085b34dd2170ee6ead925197bbeeb9697be44ef43"}],"claim.frontier.pmid-42809586":[{"id":"assertion.claim.frontier.pmid-42809586","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42809586","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42809586 \"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling\" (CC BY, first published 2026-10-01) reports: \"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.\"","support":[{"end":6184,"quote":"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":5891},{"end":9793,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":9758},{"end":9540,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42809586","source_sha256":"1d1c21c05e9f81856b0c9680d88ca3293dc19f6f4d894fb8dc8171b8fe6ae39b","start":9523}],"target_id":"claim.frontier.pmid-42809586","target_kind":"node","target_sha256":"3c2da6aec3fce0e022be79c4236a713e2d791b47c83c94615ba92776b5b00b8f"}],"claim.frontier.pmid-42811130":[{"id":"assertion.claim.frontier.pmid-42811130","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42811130","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42811130 \"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids\" (CC BY, first published 2026-09-29) reports: \"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.\"","support":[{"end":13170,"quote":"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":13000},{"end":16615,"quote":"\"firstPublicationDate\":\"2026-09-29\"","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":16580},{"end":16305,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42811130","source_sha256":"05bc6111c350b7785c13fb33e69f64675aab8fa0d39edca1cbb8c9525e201306","start":16288}],"target_id":"claim.frontier.pmid-42811130","target_kind":"node","target_sha256":"680f9d4a94d692036b817d2f72aa608aad81231e71401fa26def512360b87790"}],"claim.frontier.pmid-42811346":[{"id":"assertion.claim.frontier.pmid-42811346","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42811346","quantifiers":"Only what the quoted sentence states","time":"2026-09-29","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42811346 \"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis\" (CC BY, first published 2026-09-29) reports: \"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.\"","support":[{"end":4425,"quote":"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":4257},{"end":5969,"quote":"\"firstPublicationDate\":\"2026-09-29\"","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":5934},{"end":5723,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42811346","source_sha256":"fcc11285938f5baae983717a6bcd531bce5074602d7ac02cf10dd04a1b4e52e4","start":5706}],"target_id":"claim.frontier.pmid-42811346","target_kind":"node","target_sha256":"ba745cae07f12fbc2b6364683176fa6fd70c2787ef9f7fba42f40ada8ddf4f4d"}],"claim.frontier.pmid-42812171":[{"id":"assertion.claim.frontier.pmid-42812171","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42812171","quantifiers":"Only what the quoted sentence states","time":"2026-09-15","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42812171 \"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report\" (CC BY, first published 2026-09-15) reports: \"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.\"","support":[{"end":2281,"quote":"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":2199},{"end":4577,"quote":"\"firstPublicationDate\":\"2026-09-15\"","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":4542},{"end":4283,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42812171","source_sha256":"fe3e82492cf904a9f37ebbfcff5d6a997968e8f31a0b8e44551c8847e3dd7064","start":4266}],"target_id":"claim.frontier.pmid-42812171","target_kind":"node","target_sha256":"bfb26bb52e835a3c326b8beacbceea05f6d9580412a760f697e8989c3ba03d37"}],"claim.frontier.pmid-42813109":[{"id":"assertion.claim.frontier.pmid-42813109","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42813109","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42813109 \"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis\" (CC BY, first published 2026-09-17) reports: \"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.\"","support":[{"end":3182,"quote":"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":3016},{"end":5077,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":5042},{"end":4831,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42813109","source_sha256":"e8da1358ffdf79c3605360efe8275689d8ad717df94d70afb6d3ad645937b60f","start":4814}],"target_id":"claim.frontier.pmid-42813109","target_kind":"node","target_sha256":"78bd27b5f7d76018b2933fb98dbf4e1f9fbb3d6f41a285b38466b7c71ff0b296"}],"claim.frontier.pmid-42814704":[{"id":"assertion.claim.frontier.pmid-42814704","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42814704","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42814704 \"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study\" (CC BY, first published 2026-09-30) reports: \"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.\"","support":[{"end":4610,"quote":"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":4398},{"end":7309,"quote":"\"firstPublicationDate\":\"2026-09-30\"","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":7274},{"end":7063,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42814704","source_sha256":"cd711cca037567dc74d36b1c0feefdfdf1bb02dbb1970c2f90b38115e2a407e2","start":7046}],"target_id":"claim.frontier.pmid-42814704","target_kind":"node","target_sha256":"dc169ded9f5242d24ef811bad8e27a03386154712b6286d331fd25888d63d130"}],"claim.frontier.pmid-42814760":[{"id":"assertion.claim.frontier.pmid-42814760","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42814760","quantifiers":"Only what the quoted sentence states","time":"2026-09-30","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42814760 \"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study\" (CC BY, first published 2026-09-30) reports: \"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.\"","support":[{"end":8247,"quote":"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":8101},{"end":10070,"quote":"\"firstPublicationDate\":\"2026-09-30\"","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":10035},{"end":9824,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42814760","source_sha256":"d87717e507f9ab72e6f7a2bb6666ab8ff275ab6966c9be5c1cdd47963f961042","start":9807}],"target_id":"claim.frontier.pmid-42814760","target_kind":"node","target_sha256":"b1c16611b8a80eec2bfd14658c56533a80319b6d0f17cc657bc7df274853be3d"}],"claim.frontier.pmid-42816488":[{"id":"assertion.claim.frontier.pmid-42816488","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42816488","quantifiers":"Only what the quoted sentence states","time":"2026-08-24","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42816488 \"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat\" (CC BY, first published 2026-08-24) reports: \"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.\"","support":[{"end":11724,"quote":"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":11517},{"end":16281,"quote":"\"firstPublicationDate\":\"2026-08-24\"","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":16246},{"end":16035,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42816488","source_sha256":"387669b271fb9b79cb40384cd642038488a7ef6f223a1fef6e2d03dedbf7df8d","start":16018}],"target_id":"claim.frontier.pmid-42816488","target_kind":"node","target_sha256":"4a98dcc07b6694edae7a377c3c1f5a2b301429da094359b952a8f9ed783bf3e7"}],"claim.frontier.pmid-42818964":[{"id":"assertion.claim.frontier.pmid-42818964","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42818964","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42818964 \"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience\" (CC BY, first published 2026-09-01) reports: \"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.\"","support":[{"end":4173,"quote":"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":4044},{"end":5864,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":5829},{"end":5659,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42818964","source_sha256":"376e8e5f77d5581bf46d3cc4bf29e49fbddd4cc40a4bcb7693b1645677b6759a","start":5642}],"target_id":"claim.frontier.pmid-42818964","target_kind":"node","target_sha256":"8a039963ae8ba30e88080de9557b87aa8f4388f2363d2f3f3af0b6c7e1a36f1a"}],"claim.frontier.pmid-42820092":[{"id":"assertion.claim.frontier.pmid-42820092","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42820092","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42820092 \"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study\" (CC BY, first published 2026-08-31) reports: \"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).\"","support":[{"end":3703,"quote":"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":3499},{"end":5898,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":5863},{"end":5652,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42820092","source_sha256":"519788986cc9dee5b31fb3a703518ef1079f785348b7713b308e86f1c21b03f0","start":5635}],"target_id":"claim.frontier.pmid-42820092","target_kind":"node","target_sha256":"d59eb9d8f8eb021b1e05f8c6ceb37b49e84cb6e388f21a784fd44ddccabebd5f"}],"claim.frontier.pmid-42821558":[{"id":"assertion.claim.frontier.pmid-42821558","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821558","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821558 \"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors\" (CC BY, first published 2026-10-01) reports: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","support":[{"end":4510,"quote":"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":4231},{"end":8243,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":8208},{"end":7997,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821558","source_sha256":"3d89d2212406deae2ca4d58dfdba7bc508dba176d8a885654dd2011e89702a23","start":7980}],"target_id":"claim.frontier.pmid-42821558","target_kind":"node","target_sha256":"ccbf61f4993814ff0a4ac9040bc452c51d5d2cde0bf8056d8efe1d1adbc9c000"}],"claim.frontier.pmid-42821607":[{"id":"assertion.claim.frontier.pmid-42821607","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821607","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821607 \"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network\" (CC BY, first published 2026-10-01) reports: \"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.\"","support":[{"end":3392,"quote":"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":3124},{"end":6578,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":6543},{"end":6332,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821607","source_sha256":"e92000e74373fd4c416040e2b44a9df099657491df024d25a9be9a246250c5b9","start":6315}],"target_id":"claim.frontier.pmid-42821607","target_kind":"node","target_sha256":"a4bebba0bb0c78f7def8662af6eaef665217d4dd7495a88ba905f4ca62cb0378"}],"claim.frontier.pmid-42821620":[{"id":"assertion.claim.frontier.pmid-42821620","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42821620","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42821620 \"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2\" (CC BY, first published 2026-10-01) reports: \"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.\"","support":[{"end":8199,"quote":"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":8082},{"end":11239,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":11204},{"end":11025,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42821620","source_sha256":"af8e8494e8121689b5ed3e693ff5322606a50658b1380554c34ff27ac34032c1","start":11008}],"target_id":"claim.frontier.pmid-42821620","target_kind":"node","target_sha256":"c4ed9036362b9e66edf89cef088b1147e3a98e55e7fc7227447b474b7fba11ee"}],"claim.frontier.pmid-42823403":[{"id":"assertion.claim.frontier.pmid-42823403","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42823403","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42823403 \"Global incidence of esophageal cancer by histological and anatomical subtypes\" (CC BY, first published 2026-09-01) reports: \"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).\"","support":[{"end":6785,"quote":"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":6427},{"end":10154,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":10119},{"end":9908,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42823403","source_sha256":"14da27534ee1767ffbff593f53d09228095e0bd68d3112158560c057dde95fb5","start":9891}],"target_id":"claim.frontier.pmid-42823403","target_kind":"node","target_sha256":"d0c2a4755cccae151199a29b5ec43036e1e908c41cd9dfcfc7e297f489d8f5ce"}],"claim.frontier.pmid-42823984":[{"id":"assertion.claim.frontier.pmid-42823984","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42823984","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42823984 \"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment\" (CC BY, first published 2026-09-17) reports: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","support":[{"end":2554,"quote":"The findings indicate a strong negative association between perceived work-life balance and silent resignation.","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":2443},{"end":4679,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":4644},{"end":4433,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42823984","source_sha256":"02ec76d7ee502ff5125b6d7196b25b1d3eaa5ed58dccc5b0d0def33485ea5686","start":4416}],"target_id":"claim.frontier.pmid-42823984","target_kind":"node","target_sha256":"cfebdc786afa9fbfffba11e6e95e54932541a1d03e17301cb4c46df816a5efab"}],"claim.frontier.pmid-42824002":[{"id":"assertion.claim.frontier.pmid-42824002","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824002","quantifiers":"Only what the quoted sentence states","time":"2026-08-31","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824002 \"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock\" (CC BY, first published 2026-08-31) reports: \"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.\"","support":[{"end":2720,"quote":"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":2539},{"end":5069,"quote":"\"firstPublicationDate\":\"2026-08-31\"","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":5034},{"end":4823,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824002","source_sha256":"6b473554b08ef4561a50c7720186b46bce61796d5c88a920c98968cac947472c","start":4806}],"target_id":"claim.frontier.pmid-42824002","target_kind":"node","target_sha256":"75e01a36c4f1b515df659fba206cc6e469cd03aafba484a53ffa13868e1b05dc"}],"claim.frontier.pmid-42824079":[{"id":"assertion.claim.frontier.pmid-42824079","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824079","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824079 \"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education\" (CC BY, first published 2026-09-17) reports: \"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.\"","support":[{"end":3248,"quote":"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":3017},{"end":4605,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":4570},{"end":4359,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824079","source_sha256":"66a458675627e0d9b02f5920b724766cc5f8b1897069eaca22a7bc8063d69548","start":4342}],"target_id":"claim.frontier.pmid-42824079","target_kind":"node","target_sha256":"c191258a393dfcbe8cbde53af35a0a235580ef424542b1c0ddbe0edb8896a892"}],"claim.frontier.pmid-42824182":[{"id":"assertion.claim.frontier.pmid-42824182","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824182","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824182 \"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence\" (CC BY, first published 2026-09-17) reports: \"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.\"","support":[{"end":3356,"quote":"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":3060},{"end":5191,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":5156},{"end":4945,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824182","source_sha256":"b6dce8e4963b4a0b11536e002e015702e0698a17858286af422af2d65aef6591","start":4928}],"target_id":"claim.frontier.pmid-42824182","target_kind":"node","target_sha256":"cf336adb252df80b6ebe1dd2ca3577780b6917a9f5d124de15bc973279bf0fa8"}],"claim.frontier.pmid-42824361":[{"id":"assertion.claim.frontier.pmid-42824361","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42824361","quantifiers":"Only what the quoted sentence states","time":"2026-09-17","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42824361 \"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study\" (CC BY, first published 2026-09-17) reports: \"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.\"","support":[{"end":5491,"quote":"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":5382},{"end":8095,"quote":"\"firstPublicationDate\":\"2026-09-17\"","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":8060},{"end":7849,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42824361","source_sha256":"0d59d7a302632dff847f69dd0b9bb7a7b234a189cef75d0b417ecf90bdbe5e63","start":7832}],"target_id":"claim.frontier.pmid-42824361","target_kind":"node","target_sha256":"ad4dc3634f1db5baa9cdddc87eb981dcd9212e52f92672449b24e9a0d35ab735"}],"claim.frontier.pmid-42825005":[{"id":"assertion.claim.frontier.pmid-42825005","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42825005","quantifiers":"Only what the quoted sentence states","time":"2026-09-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42825005 \"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors\" (CC BY, first published 2026-09-01) reports: \"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).\"","support":[{"end":2437,"quote":"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":2274},{"end":5582,"quote":"\"firstPublicationDate\":\"2026-09-01\"","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":5547},{"end":5336,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42825005","source_sha256":"a98c8b98a4d9335df510a67af30afbbcf888e3914e6974e0a2d85c3447a1a8ba","start":5319}],"target_id":"claim.frontier.pmid-42825005","target_kind":"node","target_sha256":"c24a0aaf6f5abf3ee3d1d7b5ed8b1c49126ac994d66286b5673a9ff45082249d"}],"claim.frontier.pmid-42826334":[{"id":"assertion.claim.frontier.pmid-42826334","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42826334","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42826334 \"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study\" (CC BY, first published 2026-10-01) reports: \"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.\"","support":[{"end":5419,"quote":"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":5213},{"end":8858,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":8823},{"end":8605,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42826334","source_sha256":"424c59be5e22904954d251ef662886cf3dfd9231af4dbc0db1a109cf83144c6c","start":8588}],"target_id":"claim.frontier.pmid-42826334","target_kind":"node","target_sha256":"884a18b54be9a0e3646262c39d37390c59567995eb408e3bc2b2335ee668cbda"}],"claim.frontier.pmid-42827305":[{"id":"assertion.claim.frontier.pmid-42827305","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827305","quantifiers":"Only what the quoted sentence states","time":"2026-10-01","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827305 \"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties\" (CC BY, first published 2026-10-01) reports: \"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.\"","support":[{"end":3075,"quote":"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":2735},{"end":7285,"quote":"\"firstPublicationDate\":\"2026-10-01\"","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":7250},{"end":7080,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827305","source_sha256":"a95507cdf4a37c0001564a9f5e1138f45350f414f0c1dd418a8a77b5ae99a3a3","start":7063}],"target_id":"claim.frontier.pmid-42827305","target_kind":"node","target_sha256":"368911c2ccbfdbe4087c35c1320f42404ece848ddbad490693580c1bac95e3e2"}],"claim.frontier.pmid-42827524":[{"id":"assertion.claim.frontier.pmid-42827524","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827524","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827524 \"Impression management in distributive justice: balancing fairness and social perception\" (CC BY, first published 2026-09-18) reports: \"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.\"","support":[{"end":2549,"quote":"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":2304},{"end":4397,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":4362},{"end":4103,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827524","source_sha256":"71e86c32bfb98ecc655acf0bb558c435761a4470550c33c809b2015bcd8d5cdc","start":4086}],"target_id":"claim.frontier.pmid-42827524","target_kind":"node","target_sha256":"e901e4d54d113b4a93e361f019e540f7fe8c9e64398668dbea8a3ea5a6a93a39"}],"claim.frontier.pmid-42827649":[{"id":"assertion.claim.frontier.pmid-42827649","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42827649","quantifiers":"Only what the quoted sentence states","time":"2026-09-18","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42827649 \"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke\" (CC BY, first published 2026-09-18) reports: \"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.\"","support":[{"end":4306,"quote":"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":3973},{"end":7744,"quote":"\"firstPublicationDate\":\"2026-09-18\"","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":7709},{"end":7498,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42827649","source_sha256":"e12862d249553b425a1f108e368fe774d31caa2b3f2deb8940f962b938fc2ec1","start":7481}],"target_id":"claim.frontier.pmid-42827649","target_kind":"node","target_sha256":"80b28d2f8c10ee9bc6f5aa77219010a8d1b5158fc2bf5eaea021ff450842b977"}],"claim.frontier.pmid-42829444":[{"id":"assertion.claim.frontier.pmid-42829444","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42829444","quantifiers":"Only what the quoted sentence states","time":"2026-10-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42829444 \"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection\" (CC BY, first published 2026-10-04) reports: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","support":[{"end":6196,"quote":"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":5971},{"end":7756,"quote":"\"firstPublicationDate\":\"2026-10-04\"","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":7721},{"end":7459,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42829444","source_sha256":"45f21d083744a7adf88e1ef754e384fff5194b167117752e8c8c7d36bfc1dc76","start":7442}],"target_id":"claim.frontier.pmid-42829444","target_kind":"node","target_sha256":"1e43045d5f9ccd7f3921e0e5c217b1f67a79d04a25bd809540e66a61187c219f"}],"claim.frontier.pmid-42830983":[{"id":"assertion.claim.frontier.pmid-42830983","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42830983","quantifiers":"Only what the quoted sentence states","time":"2026-09-03","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42830983 \"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.\"","support":[{"end":2282,"quote":"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":2171},{"end":4901,"quote":"\"firstPublicationDate\":\"2026-09-03\"","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":4866},{"end":4655,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42830983","source_sha256":"840a7c14d81ec87afaa43c9596e3f4c3a11c3f005e20bd893ca14572155b1af1","start":4638}],"target_id":"claim.frontier.pmid-42830983","target_kind":"node","target_sha256":"53aade5163e4e3bd96f2b21ec648a8b6d7e98c4352f6f457a1a473cbfcd00307"}],"claim.frontier.pmid-42831114":[{"id":"assertion.claim.frontier.pmid-42831114","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42831114","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42831114 \"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis\" (CC BY, first published 2026-09-04) reports: \"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.\"","support":[{"end":2150,"quote":"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":1963},{"end":5466,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":5431},{"end":5220,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42831114","source_sha256":"f3ba838bbc3537323a232bef9a71f89dfd468dae763d1e6dd4f2c93b6c043017","start":5203}],"target_id":"claim.frontier.pmid-42831114","target_kind":"node","target_sha256":"381ba5288b97beb539b9b17593902070585729316401bc9ea19e449a922578c5"}],"claim.frontier.pmid-42831226":[{"id":"assertion.claim.frontier.pmid-42831226","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42831226","quantifiers":"Only what the quoted sentence states","time":"2026-09-04","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42831226 \"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge\" (CC BY, first published 2026-09-04) reports: \"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.\"","support":[{"end":1890,"quote":"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":1689},{"end":4928,"quote":"\"firstPublicationDate\":\"2026-09-04\"","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":4893},{"end":4682,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42831226","source_sha256":"9ef2638a614a030d0c89f12417cb99322787855f2a3a860936a969c8e54bbe98","start":4665}],"target_id":"claim.frontier.pmid-42831226","target_kind":"node","target_sha256":"9992d079019e7c49707837a86610550735c28b39cad1542ec465f4ea861f3e46"}],"claim.frontier.pmid-42842684":[{"id":"assertion.claim.frontier.pmid-42842684","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42842684","quantifiers":"Only what the quoted sentence states","time":"2026-10-07","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42842684 \"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>\" (CC BY, first published 2026-10-07) reports: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","support":[{"end":5660,"quote":"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":5532},{"end":9208,"quote":"\"firstPublicationDate\":\"2026-10-07\"","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":9173},{"end":8962,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42842684","source_sha256":"c70078a8625da6ee0fb5278e2dc50806fbfdce56c0ce335483aeab73a0801da3","start":8945}],"target_id":"claim.frontier.pmid-42842684","target_kind":"node","target_sha256":"7ea1fde213fffdcbe9c18161473c1dbe68bd0b17b0578b3129729f32db1cbbb8"}],"claim.frontier.pmid-42853148":[{"id":"assertion.claim.frontier.pmid-42853148","scope":{"assumptions":"Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed","population":"The study reported in PMID 42853148","quantifiers":"Only what the quoted sentence states","time":"2026-10-09","uncertainty":"Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)","units":null},"statement":"PMID 42853148 \"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes\" (CC BY, first published 2026-10-09) reports: \"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.\"","support":[{"end":11099,"quote":"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":10983},{"end":13486,"quote":"\"firstPublicationDate\":\"2026-10-09\"","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":13451},{"end":13240,"quote":"\"license\":\"cc by\"","source_id":"source.frontier.pmid-42853148","source_sha256":"09634e69a868ae8512362bba19736318ad76bf608ce9b95b749537c164a54aba","start":13223}],"target_id":"claim.frontier.pmid-42853148","target_kind":"node","target_sha256":"c049cf702e82cf69563e7e90f402a45a81de0424d21a86323b59b7dc8c843a99"}],"claim.geobiology.basalt-glass-biofilm-redox-stress-2018":[{"id":"assertion.claim.geobiology.basalt-glass-biofilm-redox-stress-2018","scope":{"assumptions":"Comparison of stressed Fe(II)-rich and unstressed Fe(III)-rich glass surfaces","population":"Synthetic basaltic glasses with contrasted residual-stress and Fe redox conditions in B. fungorum colonization experiments","quantifiers":"Dense coverage in the first tested glass condition; sparse in the contrasted glass condition","time":"Laboratory colonization assays, publication date 2018","uncertainty":"Joint contrast does not individually isolate stress or Fe oxidation state as sole cause","units":null},"statement":"The 2018 colonization assays reported dense biofilm on stressed Fe(II)-rich basalt glasses, versus sparse colonization on unstressed Fe(III)-rich glasses.","support":[{"end":5089,"quote":"In colonization experiments, basaltic glasses with residual stress and high Fe(II) content were intensely covered with a cellular biofilm. In contrast, glasses with high Fe(III) content and no residual stress were sparsely colonized.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4856}],"target_id":"claim.geobiology.basalt-glass-biofilm-redox-stress-2018","target_kind":"node","target_sha256":"deef783557453dbc0e1ec7939a2d06d475d3bd686fc920afa0bd6ba4ec51231d"}],"claim.geobiology.basalt-glass-stress-feii-release-2018":[{"id":"assertion.claim.geobiology.basalt-glass-stress-feii-release-2018","scope":{"assumptions":"Assays varied Fe redox state and glass residual stress","population":"Synthetic basaltic glasses of differing Fe oxidation states and residual stress exposed to B. fungorum in laboratory colonization assays","quantifiers":"Increase across tested residual stress and Fe(II) conditions","time":"Laboratory colonization assays, publication date 2018","uncertainty":"Reported correlation in tested glasses; factors are varied together in this summary and cannot be treated as separately isolated universal effects","units":null},"statement":"In biotic laboratory colonization assays using synthetic basaltic glasses, dissolved major-element concentrations increased with greater residual stress and Fe(II) content.","support":[{"end":4047,"quote":"Additionally, colonization experiments with synthetic basaltic glasses of different Fe redox states and residual stresses were performed to evaluate their influence on microbial activity and surface attachment of cells.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":3828},{"end":4476,"quote":"The concentration of dissolved major elements in solution in biotic colonization experiments with synthetic basaltic glasses increased with increasing residual stress and Fe(II) content.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4290}],"target_id":"claim.geobiology.basalt-glass-stress-feii-release-2018","target_kind":"node","target_sha256":"fdbdc29a0350c54ec40e4e9b8a1ad276bcc19f6c94565da7586c0af420e812f7"}],"claim.geobiology.basalt-nutrient-depletion-dissolution-2018":[{"id":"assertion.claim.geobiology.basalt-nutrient-depletion-dissolution-2018","scope":{"assumptions":"Batch incubation with added glucose, prescribed growth medium and abiotic comparisons","population":"HSDP2 Hawaiian drill-core basalt incubated with one species, B. fungorum, compared to abiotic controls","quantifiers":"Exceeded controls only when the rock sample assay was nutrient depleted","time":"Laboratory incubation assays, publication date 2018","uncertainty":"Assay-specific and conditioned on nutrient depletion; not a field-wide or seawater claim","units":null},"statement":"In laboratory incubations of HSDP2 drill-core basalt with Burkholderia fungorum, release of Fe and other major elements exceeded abiotic controls only for nutrient-depleted rock-sample assays.","support":[{"end":3568,"quote":"The interaction of a single bacterial species (\nBurkholderia fungorum\n) with basaltic rocks from the ICDP HSDP2 drill core and synthetic basaltic glasses was investigated in batch laboratory experiments","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":3366},{"end":4289,"quote":"In biotic incubation experiments bacterial growth was observed and the release of Fe and other major elements from drill core basaltic rocks to solution exceeded that of abiotic controls only when the rock sample assay was nutrient depleted.","source_id":"src.geobiology.microbial-basalt-alteration-2018","source_sha256":"4d619a13120865bab4822724c4f96dac847ffe35a4eed02339457d39d67a3382","start":4048}],"target_id":"claim.geobiology.basalt-nutrient-depletion-dissolution-2018","target_kind":"node","target_sha256":"224db821b7cc5d64c35e9059fd286e38b939cae2c9bc4568fc04e04c08b7a25e"}],"claim.geobiology.dresser-barite-hot-spring-pools-2017":[{"id":"assertion.claim.geobiology.dresser-barite-hot-spring-pools-2017","scope":{"assumptions":"Geometric and stratigraphic association with inferred surface sinter and collapsed sediments","population":"Some large barite masses associated with upper hydrothermal feeder veins in DFc1","quantifiers":"At least some, not all, masses","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Proposed reinterpretation of at least some masses; no claim applying to all barite occurrences","units":null},"statement":"The authors propose that at least some large Dresser barite masses at hydrothermal vein tips are mineralized remnants of terrestrial hot-spring pools and shallow hydrothermal plumbing.","support":[{"end":22924,"quote":"However, new observations suggest that at least some of these barite masses represent the mineralized remnants of terrestrial hot spring pools and associated shallow subsurface hydrothermal plumbing.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":22725},{"end":25063,"quote":"These barite masses occur at the uppermost tips of hydrothermal feeder veins along faults (that is, hydrothermal fluid conduits), and some are found immediately beneath overlying strata with known geyserite and siliceous sinter deposits.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":24826}],"target_id":"claim.geobiology.dresser-barite-hot-spring-pools-2017","target_kind":"node","target_sha256":"b4fb648194f2b22cb8b7be8d723db448ae1f3d53988bd38c276228ba558b0db6"}],"claim.geobiology.dresser-bubbles-eps-2017":[{"id":"assertion.claim.geobiology.dresser-bubbles-eps-2017","scope":{"assumptions":"Interpretation from microstructure and analogy to exopolymeric substance (EPS) in hot-spring mats","population":"Circular to sub-circular inclusions in Dresser columnar–botryoidal inferred geyserite at locality 16N","quantifiers":"Numerous structures of approximately 200 µm diameter","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Both bubble identity and EPS preservation are interpreted; source of gas unresolved","units":"µm"},"statement":"The authors interpret roughly 200 µm circular structures in Dresser geyserite as gas bubbles likely trapped in microbial EPS, while leaving thermal-fluid versus metabolic gas origin unresolved.","support":[{"end":26645,"quote":"Contained within these horizons are numerous circular to sub-circular structures, ∼200 μm in diameter, filled by microquartz and barite, but lined with fine-grained anatase and internal anatase crystal splays that fan inwards from the margins towards the centre of the structures","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":26366},{"end":29669,"quote":"Therefore, regardless of whether the Dresser bubbles were derived from degassing of thermal fluids or represent metabolic gas derivatives, preservation likely occurred almost immediately, through entrapment in microbial EPS.","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":29445}],"target_id":"claim.geobiology.dresser-bubbles-eps-2017","target_kind":"node","target_sha256":"ca60c900f43a608899e7388634fd357488ac924ec8b3969dc3f478c5edc0027e"}],"claim.geobiology.dresser-geyserite-localities-2017":[{"id":"assertion.claim.geobiology.dresser-geyserite-localities-2017","scope":{"assumptions":"Geological, textural and mineralogical comparisons with modern hot-spring deposits","population":"Three sampled DFc1 localities in the Dresser Formation, Pilbara Craton","quantifiers":"Three localities separated by approximately 2 km","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Interpretation by paper authors, not independent confirmation of biological origin","units":"km"},"statement":"Djokic and colleagues interpret microlaminated siliceous rocks at three Dresser Formation DFc1 localities, approximately 2 km apart, as geyserite.","support":[{"end":10891,"quote":"Distinctive microlaminated siliceous rocks observed at three DFc1 localities, ∼2 km apart, are interpreted here as geyserite","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":10767}],"target_id":"claim.geobiology.dresser-geyserite-localities-2017","target_kind":"node","target_sha256":"0005aaa2bc8e30b96de41590ba1c0b00598b8199b49713cef017b261ec0568b9"}],"claim.geobiology.dresser-palisade-fabric-2017":[{"id":"assertion.claim.geobiology.dresser-palisade-fabric-2017","scope":{"assumptions":"Analogy between bedding-normal recrystallized quartz fabric and modern silicified microbial filament textures","population":"Selected thin laminae in the Dresser locality 1S sinter-terracette unit","quantifiers":"Some laminae; crystals described as 230 µm high","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Source offers a suggested biogenic analogy, not direct identification of original filaments","units":"µm"},"statement":"The authors suggest that bedding-normal quartz crystals in Dresser sinter terracettes are analogous to recrystallized microbial palisade fabric formed by silicified filaments.","support":[{"end":30699,"quote":"In addition, within the unit of sinter terracettes, some thin laminae display vertically aligned quartz crystals (230 μm high) that wrap around the curved hinge of the convex ridges","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":30518},{"end":31675,"quote":"Therefore, these vertically aligned quartz crystals are suggested as analogous to recrystallized microbial palisade fabric formed through silicification of microbial filaments oriented perpendicular to bedding surfaces on mid- to distal-apron hot spring terraces","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":31413}],"target_id":"claim.geobiology.dresser-palisade-fabric-2017","target_kind":"node","target_sha256":"3426db41fd66e527d6e1a36fb5ae9b0a95bbed66f97f3529abc30f4e24e2ccc5"}],"claim.geobiology.dresser-sinter-terracettes-2017":[{"id":"assertion.claim.geobiology.dresser-sinter-terracettes-2017","scope":{"assumptions":"Resemblance in primary porosity and microtextures to younger hot-spring terracettes","population":"Stratiform geyserite and overlying siliceous ridge unit at Dresser locality 1S","quantifiers":"3 cm thick unit; ridges approximately 1 cm across and under 2 cm high","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Analogue-based interpretation, not direct proof of microbial construction","units":"cm"},"statement":"At Dresser locality 1S, the authors interpret convex siliceous ridges above stratiform geyserite as resembling mid- to distal-apron hot-spring sinter terracettes.","support":[{"end":21631,"quote":"stratiform geyserite is overlain by a 3 cm thick unit composed of siliceous, millimetre-thin laminae that form ∼1 cm diameter, low-amplitude (<2 cm), asymmetrical convex ridges","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":21455},{"end":22075,"quote":"The convex laminae in cross-section resemble sinter terracettes (smaller-scale subsets within sinter terraces) from the mid- to distal-apron facies of hot springs, displaying the primary porosity and microtextures comparable with more recent, microbially derived examples","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":21804}],"target_id":"claim.geobiology.dresser-sinter-terracettes-2017","target_kind":"node","target_sha256":"b8750257f1a4694fbb9cac10e86050fea8d99ded01e0e031d638e7e40a6e7dd4"}],"claim.geobiology.dresser-stromatolites-locality-24s-2017":[{"id":"assertion.claim.geobiology.dresser-stromatolites-locality-24s-2017","scope":{"assumptions":"Interpretation of sediment onlap and internal stromatolitic textures","population":"Dresser locality 24S stromatolitic laminates interbedded with inferred geyserite rip-up clasts","quantifiers":"Site-specific occurrence","time":"ca. 3.48 Ga Dresser Formation","uncertainty":"Microbial origin is an interpretation described as consistent with, not uniquely proved by, the structures","units":null},"statement":"At Dresser locality 24S, geyserite rip-up clasts occur among domical and conical stromatolitic laminates; their internal laminae and sediment onlap are described as consistent with microbial origin.","support":[{"end":31905,"quote":"geyserite rip-up clasts found interbedded with elongate domical and conical stromatolitic laminates","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":31806},{"end":32285,"quote":"Onlapping by these tuffaceous sediments and the irregular internal laminae with faint palimpsest microfabrics within these stromatolites are consistent with a microbial origin","source_id":"src.geobiology.dresser-hot-springs-2017","source_sha256":"be657e5d942b497b5a5e0cd55628e208841c3bc3b205927150605be95ee0567d","start":32110}],"target_id":"claim.geobiology.dresser-stromatolites-locality-24s-2017","target_kind":"node","target_sha256":"05290b3372396d9d687d87e8461d236e3ff3456193bae45e45a79fd6d270731b"}],"claim.geobiology.dresser-vesicle-organic-carbon-2018":[{"id":"assertion.claim.geobiology.dresser-vesicle-organic-carbon-2018","scope":{"assumptions":"Reported kerogen association in correlative microscopy observations","population":"Volcanic-glass microstructures in the sampled Dresser Formation thin sections","quantifiers":"Much of altered glass; some individual vesicles; multiple vesicles within some laminae","time":"approximately 3.48 Ga geological material","uncertainty":"Association does not establish biological origin of the vesicles or the carbon","units":null},"statement":"In the studied Dresser volcanic-glass microstructures, organic kerogenous material accompanies altered glass, with some vesicles lined or filled by carbon and organic-rich laminae enveloping multiple vesicles.","support":[{"end":4031,"quote":"Organic kerogenous material is associated with much of the altered volcanic glass; variable quantities of organic carbon line or fill the insides of some individual vesicles, while relatively large, tufted organic-rich laminae envelop multiple vesicles.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3778}],"target_id":"claim.geobiology.dresser-vesicle-organic-carbon-2018","target_kind":"node","target_sha256":"3d2b4f77b68ffb459f893cdd241f8f3ffe70b34b9c8fde0e96d7438d30ab2cc2"}],"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018":[{"id":"assertion.claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","scope":{"assumptions":"Correlative microscopy and comparisons of size distributions, wall ultrastructure and chemistry","population":"The microstructure suite examined in the sampled Dresser Formation material","quantifiers":"Studied suite, not all putative Archean microfossils","time":"approximately 3.48 Ga geological material","uncertainty":"Abiogenic interpretation of these samples only; does not reclassify other Archean structures","units":null},"statement":"A 2018 study interprets spheroidal-to-lenticular Dresser microstructures resembling Archean microfossils as silicified and pyritized vesicular volcanic glass based on size, wall ultrastructure and chemistry.","support":[{"end":3525,"quote":"Here, we describe a new suite of spheroidal to lenticular microstructures that morphologically resemble some previously reported Archean microfossils.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3375},{"end":3777,"quote":"Correlative microscopy shows that these objects have a size distribution, wall ultrastructure, and chemistry that are incompatible with a microfossil origin and instead are interpreted as pyritized and silicified fragments of vesicular volcanic glass.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":3526}],"target_id":"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","target_kind":"node","target_sha256":"28c8e83e5287945fece64dc7714b530e77240468e4b81f3dbb3f2e83cfffd0c5"}],"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018":[{"id":"assertion.claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","scope":{"assumptions":"Extrapolation from alteration and morphology of studied volcanic-glass microstructures","population":"Hypothetical reworked or isolated microstructures of the same type as studied Dresser vesicular glass","quantifiers":"May prove problematic; nanoscale inspection conditional on such cases","time":null,"uncertainty":"Conditional methodological warning; no claim that all isolated candidate microfossils are abiotic","units":null},"statement":"The Dresser pseudo-fossil study cautions that isolated reworked silicified volcanic vesicles can adsorb carbon and become pyritized, complicating early-life identification; nanoscale wall analysis may be required to exclude biogenicity.","support":[{"end":4625,"quote":"However, reworked, isolated, and silicified microstructures of this type may prove particularly problematic in early or extraterrestrial life studies since they adsorb carbon onto their surfaces and are readily pyritized","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":4405},{"end":4811,"quote":"In those cases, nanoscale analysis of wall ultrastructure would be required to firmly exclude a biological origin.","source_id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","source_sha256":"99b261ac121994caefd597030ac4c220224966d3caa12286b9e8ebf2ab99c120","start":4697}],"target_id":"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","target_kind":"node","target_sha256":"ef9d3ac0f517d5b524a36335a7f95469264661620522290551eb365404841206"}],"claim.grace.cv-drought-depletion-2006-2010":[{"id":"assertion.grace.cv-drought-depletion-2006-2010","scope":{"assumptions":"GRACE groundwater residual estimates, not direct aquifer-only observations","limitations":"The comparison with modeled earlier drought periods is not temporally matched independent confirmation.","population":"California Central Valley","quantifiers":"6–8 km³/year and 24–34 km³ during specified drought interval","time":"April 2006–March 2010","uncertainty":"Reported depletion ranges","units":"km³/year; km³"},"statement":"Scanlon and colleagues report GRACE-derived Central Valley groundwater depletion of 6–8 km³ per year, totaling 24–34 km³, between April 2006 and March 2010.","support":[{"end":29796,"quote":"In the CV, GWS depletion during the late 2000s drought calculated from GRACE data (6–8 km\n3\n/y totaling 24–34 km\n3\nfrom April 2006 to March 2010)","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29651}],"target_id":"claim.grace.cv-drought-depletion-2006-2010","target_kind":"node","target_sha256":"d348afae71a445128df383490cdefe8a1926cec1235d65dcd93119d77dbe25e1"}],"claim.grace.cv-historical-depletion-2003":[{"id":"assertion.grace.cv-historical-depletion-2003","scope":{"assumptions":"Historical hydrologic model estimates","limitations":"Model-derived historical estimates, not direct satellite measurements.","population":"California Central Valley groundwater aquifer","quantifiers":"Approximately 140 km³ total","time":"1860s–2003, with separately modeled subperiods","uncertainty":null,"units":"km³"},"statement":"Scanlon and colleagues report an estimated 140 km³ of Central Valley groundwater depletion from the 1860s through 2003, comprising 60 km³ before 1961 and 80 km³ during 1962–2003, based on groundwater models.","support":[{"end":12736,"quote":"Likewise, in the CV, groundwater depletion was estimated to be ∼140 km\n3\nfrom models [60 km\n3\nfrom the 1860s to 1961 (\nFig. 1\nB\n) and 80 km\n3\nfrom 1962 to 2003]","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":12576}],"target_id":"claim.grace.cv-historical-depletion-2003","target_kind":"node","target_sha256":"dad083b2ec5593f5d47a3f2e39767c03472f930e43e26b41eec54243c96802b8"}],"claim.grace.cvhm2-simulation-period":[{"id":"assertion.grace.cvhm2-simulation-period","scope":{"assumptions":"MODFLOW-OWHM integrated hydrologic simulation","limitations":"Simulation and observational calibration do not automatically establish independent corroboration of GRACE groundwater estimates.","population":"California Central Valley","quantifiers":"USGS model description","time":"April 1961–September 2019","uncertainty":null,"units":"Monthly model timestep"},"statement":"USGS describes Central Valley Hydrologic Model version 2 as using MODFLOW-OWHM to simulate groundwater and surface-water flow, irrigation, land subsidence and associated processes monthly from April 1961 through September 2019.","support":[{"end":5124,"quote":"In addition, the model utilizes a specialized version of MODFLOW called the MODFLOW-One-Water Hydrologic Flow Model (MODFLOW-OWHM) to simulate groundwater and surface-water flow, irrigated agriculture, land subsidence, and other key processes in the Central Valley monthly for April 1961 through September 2019.","source_id":"src.grace.centralvalley.usgs-cvhm2-model-data","source_sha256":"f40769ef7b0af90919837f4aa4a44eac03fdcfa79cbd875f5f23da9005e03228","start":4813}],"target_id":"claim.grace.cvhm2-simulation-period","target_kind":"node","target_sha256":"0056de4ec02c740ae3329b5992bb86160bcd9ddd631cb0902982aa163fa3d4a6"}],"claim.grace.groundwater-residual-method":[{"id":"assertion.grace.groundwater-residual-method","scope":{"assumptions":"Snow storage, reservoir storage and soil-moisture estimates from additional monitoring or models","limitations":"GRACE does not independently measure groundwater alone; subtraction uncertainty remains.","population":"GRACE terrestrial water storage observations","quantifiers":"Regional groundwater residual method","time":null,"uncertainty":null,"units":null},"statement":"Scanlon and colleagues describe deriving groundwater storage changes from GRACE total water storage by subtracting snow, reservoir surface-water and modeled soil-moisture storage changes.","support":[{"end":29463,"quote":"GRACE measures changes in total water storage, which are used to estimate changes in groundwater storage (GWS) by subtracting changes in storage in snow (snow water equivalent) from the Snow Data Assimilation System, surface water from reservoir monitoring, and soil moisture derived from Global Land Data Assimilation System models","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29131}],"target_id":"claim.grace.groundwater-residual-method","target_kind":"node","target_sha256":"5c9615e937dabff40be4f47afa901a52068d0a83635764d8bef2b546b82b8eeb"}],"claim.grace.hp-bayesian-downscaling-2026":[{"id":"assertion.grace.hp-bayesian-downscaling-2026","scope":{"assumptions":"Bayesian hierarchical model jointly incorporating satellite, well and covariate data","limitations":"Joint data assimilation does not serve as an independent test of satellite-well agreement. Retained source is a preprint abstract.","population":"High Plains aquifer; GRACE and NGWMN observations","quantifiers":"Author-reported method and analysis interval","time":"2002–2022","uncertainty":"Numerical validation uncertainties not provided in retained abstract","units":null},"statement":"Pakrashi, Haran and Zuidema describe combining GRACE satellite measurements, groundwater-well observations and covariates using a Bayesian hierarchical framework to estimate High Plains groundwater variations over 2002–2022.","support":[{"end":1387,"quote":"In this paper, we develop a downscaling framework for the satellite data that integrates the two sources and covariates using a Bayesian hierarchical framework.","source_id":"src.grace.highplains.pakrashi-2026-downscaling","source_sha256":"e9b5eeb097be1a9421c53967e6d45e9fa00e715b95527fbe7f2c14a9cdfd03aa","start":1227},{"end":2018,"quote":"Our approach yields high-resolution estimates of groundwater variations across the HPA from 2002--2022.","source_id":"src.grace.highplains.pakrashi-2026-downscaling","source_sha256":"e9b5eeb097be1a9421c53967e6d45e9fa00e715b95527fbe7f2c14a9cdfd03aa","start":1915}],"target_id":"claim.grace.hp-bayesian-downscaling-2026","target_kind":"node","target_sha256":"a9d3e847b91e23520d5dcbe21adbf3ef79c7df1cab0540a168a1264a1443919b"}],"claim.grace.hp-historical-depletion-2007":[{"id":"assertion.grace.hp-historical-depletion-2007","scope":{"assumptions":"Well-derived groundwater storage conversion","limitations":"Different observation period from GRACE; does not independently establish satellite agreement.","population":"High Plains aquifer; 3,600 groundwater wells","quantifiers":"Approximately 330 km³; one reported regional estimate","time":"Predevelopment, approximately 1950s, to 2007","uncertainty":null,"units":"km³"},"statement":"Scanlon and colleagues report approximately 330 km³ of High Plains groundwater depletion from predevelopment in the 1950s through 2007, based on groundwater levels from 3,600 wells.","support":[{"end":12432,"quote":"Groundwater has been depleted by ∼330 km\n3\nin the HP aquifer on the basis of groundwater level data from 3,600 wells from predevelopment (∼1950s) to 2007","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":12279}],"target_id":"claim.grace.hp-historical-depletion-2007","target_kind":"node","target_sha256":"42143a8b4e3cc5d06c1bd1a579ee6b7d72503714c23639fdcf52d186d9fab1b6"}],"claim.grace.hp-satellite-well-correlation":[{"id":"assertion.grace.hp-satellite-well-correlation","scope":{"assumptions":"GRACE storage-component subtraction and conversion of well levels to groundwater storage","limitations":"Correlation is not full independent validation of storage trends or absolute depletion volumes; underlying cited comparisons require separate examination.","population":"High Plains aquifer; approximately 1,000 monitoring wells","quantifiers":"Reported r² range 0.7–0.8","time":null,"uncertainty":"Confidence interval not supplied in retained passage","units":"r², dimensionless"},"statement":"Scanlon and colleagues report r² values of 0.7–0.8 between GRACE-derived groundwater storage changes and estimates from monitoring approximately 1,000 High Plains wells.","support":[{"end":29637,"quote":"In the HP, estimated GWS changes from GRACE data are highly correlated with those from detailed groundwater level monitoring data (∼1,000 wells,\nr\n2\nfrom 0.7 to 0.8)","source_id":"src.grace.aquifers.scanlon-2012-sustainability","source_sha256":"c3e0c4297f6b361c398848ce26dd93e24b84d7be305b584849d2cd6e5464e057","start":29472}],"target_id":"claim.grace.hp-satellite-well-correlation","target_kind":"node","target_sha256":"0131fe7e707db0750bb27279fa9b8a86cfe9c0d551b3d43fe67ba6cb1446f9c0"}],"claim.grace.hp-usgs-recovery-2017-2019":[{"id":"assertion.grace.hp-usgs-recovery-2017-2019","scope":{"assumptions":"Area-weighted groundwater monitoring and recoverable-storage calculations","limitations":"Short-term net recovery does not erase longer-term depletion or establish recovery in every region.","population":"High Plains aquifer","quantifiers":"Aquifer-wide mean and net storage change","time":"2017–2019","uncertainty":null,"units":"feet; million acre-feet"},"statement":"McGuire and Strauch report a High Plains aquifer area-weighted average water-level rise of 0.1 foot and an estimated increase of 1.6 million acre-feet of recoverable groundwater storage during 2017–2019.","support":[{"end":45654,"quote":"The area-weighted, average water-level change for the aquifer for the 2017 to 2019\n                     period was a rise of 0.1 ft","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":45523},{"end":48630,"quote":"Recoverable water in storage from 2017 to 2019 rose 1.6 Macre-ft overall; changes","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":48549}],"target_id":"claim.grace.hp-usgs-recovery-2017-2019","target_kind":"node","target_sha256":"4d01a87326d1e62b8fd71a46dd5252e0ae1172c3b7594f5458e10bde0ac2c847"}],"claim.grace.hp-usgs-specific-yield":[{"id":"assertion.grace.hp-usgs-specific-yield","scope":{"assumptions":"Mapped specific-yield polygons and area-weighted aggregation","limitations":"Specific yield is a conversion factor; different spatial assignments affect inferred recoverable storage.","population":"Mapped High Plains aquifer, excluding areas of little or no saturated thickness","quantifiers":"15.1% aquifer mean; 8.1–18.5% range of state means","time":"Specific-yield values applied in the USGS storage calculations","uncertainty":null,"units":"percent"},"statement":"The USGS High Plains report gives an area-weighted mean specific yield of 15.1% for the aquifer excluding areas of little or no saturated thickness, with state means ranging from 8.1% in Wyoming to 18.5% in Oklahoma.","support":[{"end":37582,"quote":"The area-weighted, average specific yield of the aquifer, not including the areas\n                     of little or no saturated thickness, is 15.1 percent overall for the aquifer; area-weighted,\n                     average specific yield by State ranges from 8.1 percent in Wyoming to 18.5 percent\n                     in Oklahoma","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":37250}],"target_id":"claim.grace.hp-usgs-specific-yield","target_kind":"node","target_sha256":"022378bd52a7bac544f55cd35df9a67bb046e8f5144c7e197ae47325db8c37d0"}],"claim.grace.hp-usgs-storage-2019":[{"id":"assertion.grace.hp-usgs-storage-2019","scope":{"assumptions":"Recoverable storage calculated from water-level mapping and specific-yield assumptions","limitations":"Not a GRACE-only measurement; estimates depend on storage-conversion assumptions.","population":"High Plains aquifer","quantifiers":"Aquifer-wide estimates","time":"Predevelopment, about 1950, to 2019","uncertainty":null,"units":"billion and million acre-feet; percent"},"statement":"McGuire and Strauch estimate that the High Plains aquifer contained approximately 2.91 billion acre-feet of recoverable groundwater in 2019, representing a decline of 286.4 million acre-feet, about 10%, since predevelopment.","support":[{"end":53475,"quote":"Recoverable water in storage in 2019 was about 2.91 billion acre-feet overall, which\n                  was a decline of about 286.4 million acre-feet (Macre-ft) (about 10 percent) since\n                  predevelopment.","source_id":"src.grace.highplains.usgs-mcguire-strauch-2024","source_sha256":"ea7f9d85759a234e700fd2b4e50328b391ad9b13db51fbd5b32400b451e04591","start":53256}],"target_id":"claim.grace.hp-usgs-storage-2019","target_kind":"node","target_sha256":"6374066c1f5a9475b5a27faff39d907e92b69860c0dfcb74106f3bc20f24ec86"}],"claim.grace.jpl-mascon-gridding-v02":[{"id":"assertion.grace.jpl-mascon-gridding-v02","scope":{"assumptions":"Mass-inversion solution mapped to a finer regular grid","limitations":"A 0.5-degree output grid does not imply independent 0.5-degree spatial resolving power.","population":"JPL GRACE/GRACE-FO RL06M v02 mascon product","quantifiers":"Product description","time":null,"uncertainty":null,"units":"4,551 mascons; degrees"},"statement":"NASA JPL describes its GRACE/GRACE-FO RL06M v02 solution as 4,551 relatively independent surface-mass estimates derived using an equal-area 3-degree mascon grid, subsequently mapped onto a 0.5-degree latitude-longitude grid.","support":[{"end":4092,"quote":"The complete Mascon solution consists of 4,551 relatively independent estimates of surface mass change that have been derived using an equal-area 3-degree grid of individual mascons. The final solutions are then mapped into 0.5-degree regular lat-lon grid.","source_id":"src.grace.jpl-rl06m-v02-documentation","source_sha256":"8c8ad24663bb581a757cf2a9d62ce7b7f9da2779670a6924c08e99a19e7b9110","start":3836}],"target_id":"claim.grace.jpl-mascon-gridding-v02","target_kind":"node","target_sha256":"5da684609303079de8b9439c55b5120256d0cd4a49b3af93ff999c2cb745adcf"}],"claim.grb090510-energy-dispersion-constraint":[{"id":"assertion.grb090510-energy-dispersion-constraint","scope":{"assumptions":"Interpretation of arrival timing as a constraint on energy-dependent photon propagation","population":"High- and low-energy gamma rays associated with GRB 090510","quantifiers":"Gamma rays from one specified burst","time":"GRB 090510 observation","uncertainty":"The NASA passage gives a qualitative strong constraint, without a numerical bound on a dispersion coefficient or accounting for emission-time uncertainty.","units":"Arrival separation less than 1 second; propagation distance approximately 7 billion light-years"},"statement":"NASA reports that GRB 090510 placed a strong constraint on variation of light speed with photon energy, with high- and low-energy gamma rays arriving within one second after traveling approximately seven billion light-years.","support":[{"end":3872,"quote":"GRB090510 placed a strong constraint on variation of the speed of light with energy. High- and low-energy gamma rays arrived within 1 second after traveling 7 billion light years.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":3693}],"target_id":"claim.grb090510-energy-dispersion-constraint","target_kind":"node","target_sha256":"f993fc3a086000e373020c6c06d5eabcb0d875b77ce7bf746fdefa995038be1d"}],"claim.grb090510-energy-separated-photon-arrivals":[{"id":"assertion.grb090510-energy-separated-photon-arrivals","scope":{"assumptions":"Photon propagation and arrival comparison as described by NASA","population":"Two photons detected from gamma-ray burst GRB 090510","quantifiers":"Two selected photons from one burst","time":"GRB 090510 observation; precise detection timestamp not established by the cited passage","uncertainty":"Near-simultaneous arrival is reported without an exact time difference in this supporting passage.","units":"Energy ratio approximately 1000000; propagation distance greater than 7.3 billion light-years"},"statement":"NASA reports that two photons from GRB 090510, differing in energy by a factor of one million, arrived at Fermi nearly simultaneously after traveling more than 7.3 billion light-years.","support":[{"end":3085,"quote":"Fermi-LAT was able to test this using photons from the bright GRB 090510. Two of the photons, one a million times more energetic than the other, traveled over 7.3 billion light-years before arriving at the telescope, arriving at nearly the same time, thus demonstrating that Lorentz invariance holds strong.","source_id":"place-physical-005","source_sha256":"c92ff0c8cfdfcde2ab156f2edd52b0c8f0a0ab6b907a091e95475110f840f64d","start":2778}],"target_id":"claim.grb090510-energy-separated-photon-arrivals","target_kind":"node","target_sha256":"3802c1037d55f0e926d34b6231d55d7bc9fd35cb2694a2366107c1bb24051bc5"}],"claim.happy-code-flm-experimental-test":[{"id":"assertion.happy-code-flm-experimental-test","scope":{"assumptions":"The experimental confirmation is claimed within the implemented model, rather than for physical quantum gravity generally.","population":"A toy holographic duality implemented as the HaPPY quantum error-correcting code on a trapped-ion quantum computer","quantifiers":"One reported model implementation","time":null,"uncertainty":"Author-reported experimental result; independent replication and generalization are not established by the supplied excerpt.","units":null},"statement":"The authors report experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in a trapped-ion implementation of the HaPPY holographic code.","support":[{"end":1600,"quote":"Here, we implement a toy model of this duality called the HaPPY code, a quantum error-correcting code in the form of a tensor network with hyperbolic entanglement patterns, on a trapped-ion quantum computer. We present the first experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in this model - a key test of the holographic correspondence.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1240}],"target_id":"claim.happy-code-flm-experimental-test","target_kind":"node","target_sha256":"11b90856dd14784449fac4abbdc8732a2d42c792a229cc4fab1056621c498ebb"}],"claim.happy-code-magic-entropic-precursors":[{"id":"assertion.happy-code-magic-entropic-precursors","scope":{"assumptions":"Non-stabilizerness, also called magic, is introduced into the implemented code.","population":"The reported holographic-code experiment","quantifiers":"One reported experimental construction","time":null,"uncertainty":"Entropic precursors are reported; direct observation of emergent physical gravity is not established.","units":null},"statement":"The authors report observing entropic precursors expected of emergent gravity after introducing non-stabilizerness into their holographic-code model.","support":[{"end":1715,"quote":"We then enrich it with non-stabilizerness, or magic, and observe entropic precursors expected of emergent gravity.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1601}],"target_id":"claim.happy-code-magic-entropic-precursors","target_kind":"node","target_sha256":"ef2a063225a0b48bcf5fa4e6404864483dba1a0baeb1fce6e042643406cb7927"}],"claim.holographic-code-wormhole-entropic-behavior":[{"id":"assertion.holographic-code-wormhole-entropic-behavior","scope":{"assumptions":"The resemblance concerns entropic behavior within the code.","population":"A quantum-code construction studied in the reported experiment","quantifiers":"One reported code construction","time":null,"uncertainty":"The authors describe reminiscent entropic behavior, without establishing a physical wormhole.","units":null},"statement":"The authors report constructing and measuring a quantum code whose entropic behavior resembles that of a highly quantum wormhole.","support":[{"end":1836,"quote":"Finally, we present and measure a code construction whose entropic behavior is reminiscent of a highly quantum wormhole.","source_id":"place-physical-002","source_sha256":"71b9d8f0d112e15b9dddac700aee010000e0db753eacaf98f84166603f9fe73c","start":1716}],"target_id":"claim.holographic-code-wormhole-entropic-behavior","target_kind":"node","target_sha256":"3c1ded91ef4dac837481138304e57c8e2d710a30701b3123d53f571407b158e3"}],"claim.longcontext.babilong-20-reasoning-tasks":[{"id":"assertion.claim.longcontext.babilong-20-reasoning-tasks","scope":{"assumptions":"Scattered target facts across long natural text","population":"Synthetic reasoning tasks of the BABILong benchmark","quantifiers":"20 tasks; five named examples of reasoning types","time":"2024 reported benchmark","uncertainty":"Benchmark tasks are distinct from operational proof of general reasoning or exact context use","units":"Tasks"},"statement":"BABILong introduces 20 tasks involving fact chaining, induction, deduction, counting and lists or sets, designed to require reasoning over facts distributed through very long natural-language documents.","support":[{"end":1280,"quote":"To bridge this gap, we introduce the BABILong benchmark, designed to test language models' ability to reason across facts distributed in extremely long documents. BABILong includes a diverse set of 20 reasoning tasks, including fact chaining, simple induction, deduction, counting, and handling lists/sets.","source_id":"src.longcontext.kuratov-babilong-2024","source_sha256":"0b8a5b1e2518df6ba3e35331a7b446489ebef12b827f8194307288be3bf1fb3c","start":974}],"target_id":"claim.longcontext.babilong-20-reasoning-tasks","target_kind":"node","target_sha256":"ae081b3226992054572b39840b65bc091fb4453b1c48916d330037f99f394d5a"}],"claim.longcontext.helmet-niah-vs-downstream":[{"id":"assertion.claim.longcontext.helmet-niah-vs-downstream","scope":{"assumptions":"Comparative benchmark correlations and predictive value are empirical author reports","population":"59 long-context language models studied in HELMET","quantifiers":"59 models; two named findings","time":"2025 paper version","uncertainty":"Correlation magnitudes and individual model identities are not given in the selected excerpt","units":"Models; category correlations"},"statement":"In a study of 59 long-context models, the HELMET authors report that synthetic needle-in-a-haystack scores do not reliably predict downstream performance and that their different application-centered task categories have low correlations.","support":[{"end":2073,"quote":"Through a comprehensive study of 59 LCLMs, we find that (1) synthetic tasks like NIAH do not reliably predict downstream performance; (2) the diverse categories in HELMET exhibit distinct trends and low correlations with each other;","source_id":"src.longcontext.yen-helmet-2025","source_sha256":"046e3a0166c8f73f23321107b7f33bec803ea33bb2165d0d2ab9a254c6515dbe","start":1841}],"target_id":"claim.longcontext.helmet-niah-vs-downstream","target_kind":"node","target_sha256":"cfa26560724993d5618463510330d28adba5a3d2d7ab47bc8009b9f0857b497c"}],"claim.longcontext.infinitybench-over100k":[{"id":"assertion.claim.longcontext.infinitybench-over100k","scope":{"assumptions":"Source HTML text extraction omits math-styled name at two locations; benchmark identity comes from source title; report describes planned demands, not demonstrated impossibility of partial retrieval","population":"InfinityBench evaluated long-input benchmark tasks","quantifiers":"Average length >100K tokens","time":"2024 ACL publication","uncertainty":"The abstract does not list task counts or model scores; phrase first is author priority claim not independently established","units":"Tokens; averaged data length"},"statement":"The 2024 InfinityBench paper describes a benchmark with average data length above 100K tokens and a mix of synthetic and realistic English and Chinese tasks intended to require long-distance dependencies rather than retrieval of isolated passages.","support":[{"end":2552,"quote":"In this paper, we propose , the first LLM benchmark featuring an average data length surpassing 100K tokens.","source_id":"src.longcontext.zhang-infinitybench-2024","source_sha256":"492f728709e4dbb69a9b6f2b64965970b2a6650cc9cbf364d82d1293bd70ee18","start":2444},{"end":2830,"quote":"The tasks in are designed to require an understanding of long dependencies in contexts and make simply retrieving a limited number of passages from contexts not sufficient for these tasks.","source_id":"src.longcontext.zhang-infinitybench-2024","source_sha256":"492f728709e4dbb69a9b6f2b64965970b2a6650cc9cbf364d82d1293bd70ee18","start":2642}],"target_id":"claim.longcontext.infinitybench-over100k","target_kind":"node","target_sha256":"10b5938f17fbea91d77a6212bc0387414317d0ac05a6adf760da6cdc629401b2"}],"claim.longcontext.liu-relevant-position":[{"id":"assertion.claim.longcontext.liu-relevant-position","scope":{"assumptions":"Task-specific positional evaluation, not a universal behavior of all models","population":"Language models evaluated in the Lost in the Middle paper","quantifiers":"Two evaluated tasks; start/end versus middle","time":"Research reported in the 2023 arXiv revision","uncertainty":"Often, not always; no numerical effect size or current-model result established by the excerpt","units":"Relative task performance"},"statement":"Liu and colleagues report that models evaluated on multi-document question answering and key-value retrieval often performed best when relevant information occurred at the start or end of a long input, with marked degradation for middle positions.","support":[{"end":1088,"quote":"We analyze the performance of language models on two tasks that require identifying relevant information in their input contexts: multi-document question answering and key-value retrieval.","source_id":"src.longcontext.liu-lost-middle-2024","source_sha256":"9be1db75f75a4327cdfe474c1703ea26020c52f2e2c14c0b6175fde4a4370692","start":900},{"end":1579,"quote":"In particular, we observe that performance is often highest when relevant information occurs at the beginning or end of the input context, and significantly degrades when models must access relevant information in the middle of long contexts, even for explicitly long-context models.","source_id":"src.longcontext.liu-lost-middle-2024","source_sha256":"9be1db75f75a4327cdfe474c1703ea26020c52f2e2c14c0b6175fde4a4370692","start":1296}],"target_id":"claim.longcontext.liu-relevant-position","target_kind":"node","target_sha256":"60f7a0b3573a78915c1ff3cd05e8ea752707481997ffbf0fb658e175a789d3df"}],"claim.longcontext.longbench-original-design":[{"id":"assertion.claim.longcontext.longbench-original-design","scope":{"assumptions":"English and Chinese lengths use different units and should not be directly compared","population":"Datasets selected for original LongBench","quantifiers":"21 datasets; 6 categories; 6711 English words; 13386 Chinese characters","time":"2024 ACL publication","uncertainty":"Reported averages are not maximum supported context lengths and do not establish benchmark score reliability","units":"Datasets; task categories; words; characters"},"statement":"The original LongBench authors report 21 datasets in six task categories in English and Chinese, with average input lengths of 6,711 English words and 13,386 Chinese characters.","support":[{"end":2841,"quote":"LongBench comprises 21 datasets across 6 task categories in both English and Chinese, with an average length of 6,711 words (English) and 13,386 characters (Chinese).","source_id":"src.longcontext.bai-longbench-2024","source_sha256":"cfac7a68d6fabd15919c439b72608ffb3c6c86b5c3078503cb9f6a554731d18b","start":2675}],"target_id":"claim.longcontext.longbench-original-design","target_kind":"node","target_sha256":"53711a51b60b144c8a94511d19a3f93bf1bd42a07eefe5619c72cfca7782abfd"}],"claim.longcontext.longbench-v2-design":[{"id":"assertion.claim.longcontext.longbench-v2-design","scope":{"assumptions":"Context lengths are words, not model tokens; questions are multiple-choice","population":"LongBench v2 question set","quantifiers":"503 questions; 8k to 2M words; 6 categories","time":"2025 benchmark publication","uncertainty":"The abstract does not establish that every evaluated model processed the entire 2-million-word range","units":"Questions; context words; categories"},"statement":"The LongBench v2 authors describe 503 multiple-choice questions with source contexts from 8,000 to 2 million words spanning six categories, including multi-document questions and code-repository understanding.","support":[{"end":2522,"quote":"LongBench v2 consists of 503 challenging multiple-choice questions, with contexts ranging from 8k to 2M words, across six major task categories: single-document QA, multi-document QA, long in-context learning, long-dialogue history understanding, code repository understanding, and long structured data understanding.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2205}],"target_id":"claim.longcontext.longbench-v2-design","target_kind":"node","target_sha256":"b8a427f5b8e3d2bbdf7d66674d3e791a73c5ccbd5fe0f31d08a80920d4803304"}],"claim.longcontext.longbench-v2-score-comparison":[{"id":"assertion.claim.longcontext.longbench-v2-score-comparison","scope":{"assumptions":"Direct-answer model and reasoning-enabled o1-preview used distinct response settings; not evidence of universal superiority","population":"Human experts and evaluated models on the LongBench v2 multiple-choice test","quantifiers":"Experts 53.7%; direct-answer 50.1%; o1-preview 57.7%; 15-minute human limit","time":"2025 benchmark; expert limit 15 minutes","uncertainty":"Reported accuracies are task-specific; the human constraint and model reasoning procedures limit direct equivalence","units":"Accuracy percentages; minutes"},"statement":"The LongBench v2 authors report 53.7% human-expert accuracy with a 15-minute limit, 50.1% for the strongest directly answering model, and 57.7% for o1-preview using longer reasoning under their reported evaluation.","support":[{"end":2851,"quote":"We employ both automated and manual review processes to maintain high quality and difficulty, resulting in human experts achieving only 53.7% accuracy under a 15-minute time constraint.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2666},{"end":3094,"quote":"Our evaluation reveals that the best-performing model, when directly answers the questions, achieves only 50.1% accuracy. In contrast, the o1-preview model, which includes longer reasoning, achieves 57.7%, surpassing the human baseline by 4%.","source_id":"src.longcontext.bai-longbench-v2-2025","source_sha256":"721ead7bec44a2139d889bfc69e652ad185458380127f78f71c94c105940091e","start":2852}],"target_id":"claim.longcontext.longbench-v2-score-comparison","target_kind":"node","target_sha256":"65d06582bd666279770a9273afdddae57502fc67f3b467ef2378a37b1d203ca9"}],"claim.longcontext.longcite-citation-pipeline":[{"id":"assertion.claim.longcontext.longcite-citation-pipeline","scope":{"assumptions":"Sentence-level citation generation is not by itself verified attribution fidelity in every response","population":"LongCite source-described QA pipeline and its two trained models","quantifiers":"LongCite-45k; LongCite-8B; LongCite-9B","time":"2024 research manuscript","uncertainty":"Source describes its claimed result; no independent verification or current-model comparison inferred","units":"Training-set name; model names"},"statement":"The LongCite authors propose a Coarse-to-Fine pipeline producing long-context question-answer pairs with sentence-level citations and report using its LongCite-45k training data to train LongCite-8B and LongCite-9B.","support":[{"end":1905,"quote":"To this end, we propose CoF (Coarse to Fine), a novel pipeline that utilizes off-the-shelf LLMs to automatically generate long-context QA instances with precise sentence-level citations, and leverage this pipeline to construct LongCite-45k, a large-scale SFT dataset for LQAC. Finally, we train LongCite-8B and LongCite-9B using the LongCite-45k dataset, successfully enabling their generation of accurate responses and fine-grained sentence-level citations in a single output.","source_id":"src.longcontext.zhang-longcite-2024","source_sha256":"58e1b8678416aa174246e7797dd5e56b8d173a13892b431f6a54b485cf473b06","start":1428}],"target_id":"claim.longcontext.longcite-citation-pipeline","target_kind":"node","target_sha256":"e448452a911a9127733b7c57fc769b4e98e4d9884088988b9065a0205375fa90"}],"claim.longcontext.nolima-32k-degradation":[{"id":"assertion.claim.longcontext.nolima-32k-degradation","scope":{"assumptions":"Below 50% means relative to each model’s own short-context performance, not below 50 percentage points in absolute accuracy","population":"13 models selected for the NoLiMa benchmark; GPT-4o among evaluated models","quantifiers":"13 models; 11 below half baseline; GPT-4o 99.3% to 69.7%","time":"2025 evaluation; short context under 1K tokens compared with 32K tokens","uncertainty":"Result applies to tested model versions and NoLiMa tasks; no statement about all uses of GPT-4o","units":"Tokens; accuracy percentage; baseline ratio"},"statement":"In NoLiMa evaluations of 13 models claiming at least 128K-token support, 11 performed at under half their short-context baseline at 32K; the reported GPT-4o score dropped from 99.3% at short context to 69.7% at 32K.","support":[{"end":1288,"quote":"We evaluate 13 popular LLMs that claim to support contexts of at least 128K tokens.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":1205},{"end":1618,"quote":"At 32K, for instance, 11 models drop below 50% of their strong short-length baselines. Even GPT-4o, one of the top-performing exceptions, experiences a reduction from an almost-perfect baseline of 99.3% to 69.7%.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":1406}],"target_id":"claim.longcontext.nolima-32k-degradation","target_kind":"node","target_sha256":"b4efc7ad4a182ad14fc2a59fa4671f94e7b8734247a91d785f1892ffc131cc7f"}],"claim.longcontext.nolima-nonliteral-retrieval":[{"id":"assertion.claim.longcontext.nolima-nonliteral-retrieval","scope":{"assumptions":"Needles are designed with minimal question-passage lexical overlap","population":"Long-context language models evaluated by NoLiMa","quantifiers":"No universal performance quantifier","time":"2025 benchmark publication","uncertainty":"Minimal lexical overlap is a benchmark design property, not an assertion that lexical information is entirely absent","units":"Words and retrieval instances"},"statement":"The NoLiMa authors introduce a needle-retrieval benchmark in which questions and relevant text have minimal lexical overlap, requiring latent associations rather than straightforward literal matching to locate evidence.","support":[{"end":1204,"quote":"To address this, we introduce NoLiMa, a benchmark extending NIAH with a carefully designed needle set, where questions and needles have minimal lexical overlap, requiring models to infer latent associations to locate the needle within the haystack.","source_id":"src.longcontext.modarressi-nolima-2025","source_sha256":"7c4ab45423a8628efbdc6f7c11851b1fc3b31443d1c8115b25d3e0ee7a5827f7","start":956}],"target_id":"claim.longcontext.nolima-nonliteral-retrieval","target_kind":"node","target_sha256":"1cb653431a83dbe5c1a3a6c9c2bd57f80615f37234098f0e5be2decd945c4124"}],"claim.longcontext.ruler-32k-performance":[{"id":"assertion.claim.longcontext.ruler-32k-performance","scope":{"assumptions":"Satisfactory refers to the paper’s benchmark criterion, not an independently specified universal standard","population":"17 models assessed by RULER","quantifiers":"17 models; 32K tokens; approximately half","time":"2024 evaluation; 32K-token test length","uncertainty":"The excerpt does not give per-model scores, error bars or applicability to later models","units":"Models; tokens; fraction"},"statement":"In the RULER authors’ evaluation of 17 long-context models advertised for at least 32K tokens, almost all declined on RULER as input length grew, and the authors reported only about half maintained satisfactory performance at 32K, despite nearly perfect results on vanilla needle retrieval.","support":[{"end":1868,"quote":"We evaluate 17 long-context LMs with 13 representative tasks in RULER. Despite achieving nearly perfect accuracy in the vanilla NIAH test, almost all models exhibit large performance drops as the context length increases. While these models all claim context sizes of 32K tokens or greater, only half of them can maintain satisfactory performance at the length of 32K.","source_id":"src.longcontext.hsieh-ruler-2024","source_sha256":"2c01e359903ca57f0e4698e579eaf3790261ca503a34f8522ee8a55f7b955092","start":1500}],"target_id":"claim.longcontext.ruler-32k-performance","target_kind":"node","target_sha256":"5830bead6d5ffa2661398b1da12b4ae642347e1ce4cff5b0856be9d6b8d1f4d0"}],"claim.longcontext.ruler-task-design":[{"id":"assertion.claim.longcontext.ruler-task-design","scope":{"assumptions":"Synthetic tasks, configurable lengths and complexities","population":"17 long-context language models","quantifiers":"17 models; 13 representative tasks","time":"2024 RULER evaluation","uncertainty":"Benchmark design is not a guarantee of coverage of all real applications","units":"Models and tasks"},"statement":"The RULER paper describes a configurable synthetic long-context benchmark extending needle-in-a-haystack retrieval with different needle types and counts, plus multi-hop tracing and aggregation; it evaluates 17 language models on 13 representative tasks.","support":[{"end":1570,"quote":"RULER expands upon the vanilla NIAH test to encompass variations with diverse types and quantities of needles. Moreover, RULER introduces new task categories multi-hop tracing and aggregation to test behaviors beyond searching from context. We evaluate 17 long-context LMs with 13 representative tasks in RULER.","source_id":"src.longcontext.hsieh-ruler-2024","source_sha256":"2c01e359903ca57f0e4698e579eaf3790261ca503a34f8522ee8a55f7b955092","start":1259}],"target_id":"claim.longcontext.ruler-task-design","target_kind":"node","target_sha256":"87719f57f0b477616c5e026c2267271ff7ae343451eac80f2a50395c0f0211ee"}],"claim.ltee.cit-plus-cit-plus-plus-timing":[{"id":"assertion.ltee.cit-plus-cit-plus-plus-timing","scope":{"assumptions":"Historical timeline recounted by Leon et al. from earlier LTEE studies; distinction between rudimentary Cit+ and refined Cit++.","population":"One of twelve LTEE E. coli populations, Ara−3","quantifiers":"One population; two stages","time":"31,500 to 33,000 generations","uncertainty":"No assertion that the first cell carrying Cit+ was directly observed or that changes occurred in the other eleven populations.","units":"generations"},"statement":"Leon et al. (2018) describe emergence of citrate utilization in the Ara−3 LTEE population after 31,500 generations and descendants fully exploiting citrate by 33,000 generations.","support":[{"end":9280,"quote":"After 31,500 generations, a mutant in one of the LTEE populations, designated Ara\n−\n3, evolved the ability to utilize citrate as a carbon source. Descendants of this mutant that were able to fully exploit this additional carbon source evolved by 33,000 generations and dominated thereafter","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":8991}],"target_id":"claim.ltee.cit-plus-cit-plus-plus-timing","target_kind":"node","target_sha256":"c75d631b3a7e6c8eb10166bafa922b933d4136ecb0730f19c2b72f7d63eb00b3"}],"claim.ltee.citT-ancestor-1p0-fitness":[{"id":"assertion.ltee.citT-ancestor-1p0-fitness","scope":{"assumptions":"Knock-in mimic of evolved activation, not spontaneous appearance of the authentic tandem duplication in ancestor.","population":"Ancestral REL606 LTEE E. coli with P_rnk-citT chromosomal knock-in versus null cassette","quantifiers":"1.0% fitness advantage; one-tailed P=0.033; n=12","time":"Ancestral genetic background; assays reported 2018","uncertainty":"Effect near assay resolution; authors explicitly describe relatively weak support.","units":"relative fitness percent; P-value; observations n"},"statement":"Leon et al. (2018) measured a 1.0% fitness advantage for the engineered Cit+ activation in ancestral LTEE strain REL606, with weak statistical support (one-tailed P = 0.033; n = 12).","support":[{"end":21818,"quote":"We found a slight fitness benefit of 1.0% for the Cit\n+\nmutation (\nFig 1B\n). This effect size is near the limit for the smallest differences that can be distinguished in these types of competitive fitness assays, resulting in relatively weak support for the hypothesis that there was any fitness advantage at all for the REL606 variant with the P\nrnk\n-citT\nmodule relative to the one with the null module (one-tailed\nt\n-test,\nP\n= 0.033,\nn\n= 12).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":21373}],"target_id":"claim.ltee.citT-ancestor-1p0-fitness","target_kind":"node","target_sha256":"353c9cc143f2b3c0ea9514a2c53e23aacbb6d56dc62dbe3edccb8bc20d8b080e"}],"claim.ltee.citT-anti-potentiation-23clones":[{"id":"assertion.ltee.citT-anti-potentiation-23clones","scope":{"assumptions":"The 23 are sampled isolates, not all LTEE genotypes or all twelve populations.","population":"23 additional evolved pre-Cit+ LTEE Ara−3 clones assayed with citT activation and control cassettes","quantifiers":"11/23 strains disadvantage; 5 strains greater than 20% disadvantage","time":"Strains sampled at multiple pre-Cit+ generations; tests reported 2018","uncertainty":"Fitness reduction depends on genetic background; one-tailed bootstrap tests P<0.05 for reported comparisons.","units":"relative fitness percent; strains"},"statement":"Leon et al. (2018) reported that activating citT reduced competitive fitness in 11 of 23 tested evolved pre-Cit+ clones, including five with reductions greater than 20%.","support":[{"end":26917,"quote":"Unexpectedly, the Cit\n−\nvariant outcompeted the Cit\n+\nvariant for the 11 remaining strains of the 23 we tested (one-tailed bootstrap test,\nP\n< 0.05). The actualizing step needed for subsequently evolving full citrate utilization (Cit\n++\n) would have been effectively blocked if it occurred in these strain backgrounds; they are ‘anti-potentiated’. For five of these strains, activating\ncitT\nexpression was extremely detrimental, decreasing competitive fitness by >20% (one-tailed bootstrap test,\nP\n< 0.05).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":26411}],"target_id":"claim.ltee.citT-anti-potentiation-23clones","target_kind":"node","target_sha256":"d6892dc0661677149c776185c4ff7d8a9883f266122a85d67fd836a57fa7c941"}],"claim.ltee.citT-duplication-2p2-fitness":[{"id":"assertion.ltee.citT-duplication-2p2-fitness","scope":{"assumptions":"Competitive co-culture, controlled neutral arabinose-marker variants; duplication differs between compared strains.","population":"ZDB564 and its ZDB706 revertant in direct DM-medium competition","quantifiers":"2.2% advantage; two marker-direction variants","time":"Earliest Cit+ isolate ZDB564 from generation 31,500; tests reported in 2018","uncertainty":"The paper describes a small measured advantage for these strains, not a general advantage in all genetic backgrounds.","units":"relative fitness, percent"},"statement":"Leon et al. (2018) measured a 2.2% competitive fitness advantage associated with the citT-activating duplication by comparing early Cit+ isolate ZDB564 with its Cit− revertant ZDB706.","support":[{"end":18162,"quote":"When competing ZDB564 and ZDB706, we found a slight fitness advantage of 2.2% for the presence of the\ncitT\n-activating duplication in ZDB564","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":18022}],"target_id":"claim.ltee.citT-duplication-2p2-fitness","target_kind":"node","target_sha256":"b2635835c8e66b438b71de422d72a9cc226f12b13f5d2bc33867332a351beda2"}],"claim.ltee.citT-ecological-potentiation-test":[{"id":"assertion.ltee.citT-ecological-potentiation-test","scope":{"assumptions":"Cit+ and Cit− variants started equally and together formed about 1% of population mixture; comparison with direct variant competitions.","population":"Engineered Cit+ and Cit− variants of ZDB706 in a background of the full generation-31,000 Ara−3 LTEE population","quantifiers":"0.9% fitness advantage; ~1% initial fraction; P=0.053","time":"31,000-generation frozen population sample; 2018 tests","uncertainty":"The authors report marginal difference from pairwise competition (two-tailed P=0.053), not a definitive exclusion of all ecological effects.","units":"relative fitness percent; P-value; frequency percent"},"statement":"Leon et al. (2018) measured a 0.9% Cit+ fitness advantage when competing engineered ZDB706 variants at low frequency within the generation-31,000 LTEE population and reported no support for an ecological-potentiation advantage.","support":[{"end":23950,"quote":"The Cit\n+\nand Cit\n−\nvariants were mixed together equally and added such that they comprised ~1% of the cells in a mixture with the evolved population sample.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":23793},{"end":24267,"quote":"In this context, the Cit\n+\nstrain had a 0.9% fitness advantage over the Cit\n−\nstrain, which was less than and only marginally different from the result when the two strains were competed versus one another normally (two-tailed\nt\n-test,\nP\n= 0.053). Thus, we find no support for the ecological potentiation hypothesis.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":23951}],"target_id":"claim.ltee.citT-ecological-potentiation-test","target_kind":"node","target_sha256":"3a9067178ee05c55c823a19bf5d1c3b88223aac893671e1e4e272cfdaa983dbd"}],"claim.ltee.citT-phylo-negative-group":[{"id":"assertion.ltee.citT-phylo-negative-group","scope":{"assumptions":"Fitness effect pooled in a phylogenetically selected group; private mutations and uncertain changes on the ancestral line limit attribution.","population":"Phylogenetically grouped pre-Cit+ Ara−3 isolates ZDB425, ZDB458, and ZDB464","quantifiers":"Group estimate −5.4%, interval [−7.2%, −3.6%]","time":"Intermediate lineage samples, including generation 10,000 ZDB425 and generation 20,000 ZDB458","uncertainty":"Authors do not rule out additional changes in fitness effect during the 10,000–20,000-generation interval.","units":"relative fitness percent"},"statement":"Leon et al. (2018) estimated a −5.4% fitness effect (interval −7.2% to −3.6%) for citT activation in the intermediate pre-Cit+ lineage group represented by ZDB425, ZDB458 and ZDB464.","support":[{"end":33218,"quote":"It was deleterious to evolve Cit\n+\nin an earlier, intermediate set of isolates composed of ZDB425, ZDB458, and ZDB464 with an estimated fitness effect of –5.4% [–7.2%, –3.6%].","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":33043},{"end":33598,"quote":"ZDB425 at 10,000 generations and ZDB458 at 20,000 generations have only one and two ‘private’ mutations not shared with the main pre-Cit\n+\nlineage, respectively, though we cannot rule out that other changes in the impact of\ncitT\nactivation may have occurred on the main line of descent within this interval.","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":33291}],"target_id":"claim.ltee.citT-phylo-negative-group","target_kind":"node","target_sha256":"2e0de14c025974dc0d55fa3a7939f747b486949d47e36a6d85437257e7e58d11"}],"claim.ltee.citT-phylo-positive-group":[{"id":"assertion.ltee.citT-phylo-positive-group","scope":{"assumptions":"Fitness impact of activating citT in a specified related group, not a whole-population estimate.","population":"Late pre-Cit+ Ara−3 lineage group including ZDB19, ZDB13, and the ZDB706 reference background","quantifiers":"Group estimate +2.4%, 95% interval [+1.4%, +3.4%]","time":"As early as 29,000 generations; assays reported in 2018","uncertainty":"Positive group estimate does not establish causal genetic variants or guarantee the evolutionary success of a Cit+ lineage.","units":"relative fitness percent"},"statement":"Leon et al. (2018) estimated a +2.4% fitness effect (95% interval +1.4% to +3.4%) in a later fully potentiated pre-Cit+ lineage group containing ZDB19 and ZDB13 from as early as 29,000 generations.","support":[{"end":32543,"quote":"Proceeding backward in the tree from the earliest known Cit\n+\nisolate (ZDB564), two earlier clones (ZDB19 and ZDB13) from as early as 29,000 generations are as fully potentiated as the key Cit\n−\nrevertant (ZDB706). The overall fitness effect of evolving Cit\n+\nin this group was +2.4% [+1.4%, +3.4%] (95% confidence interval).","source_id":"src.ltee.leon-adaptive-potential-2018","source_sha256":"613477f3d4a016a7d28b630cb752f67200eaa83aa6f5e1e5a5c6f8f8c0f9f4c4","start":32218}],"target_id":"claim.ltee.citT-phylo-positive-group","target_kind":"node","target_sha256":"a0bb715b4c76e8d464540c79cfae21e55e1c2433be870e4a4bf6b0059c38d8d3"}],"claim.ltee.turner-citminus-50k-reinvasion":[{"id":"assertion.ltee.turner-citminus-50k-reinvasion","scope":{"assumptions":"Invasion refers to tested archived mixed culture and the added clone; low and high inoculation conditions were averaged.","population":"Generation-43,000 Cit− clone added to frozen generation-50,000 Cit+ whole-population sample under LTEE competition conditions","quantifiers":"3 × 10^5 cells/mL; about 10-fold lower; mean across two starting densities","time":"Seven-day invasion assay; 50,000-generation resident population","uncertainty":"Observed coexistence in short assay does not prove permanent ecological coexistence or identify the extinction cause.","units":"cells/mL; generations; days"},"statement":"Turner et al. (2015) observed that a generation-43,000 Cit− clone reinvaded the generation-50,000 Ara−3 population, reaching about 3 × 10^5 cells/mL, roughly an order of magnitude below final Cit− densities in the other treatments.","support":[{"end":28960,"quote":"When added to the 50,000-generation population—more than 6,000 generations after the extinction of the Cit\n−\nlineage—the 43,000-generation Cit\n−\nclone could still invade the Cit\n+\npopulation (\nFig 2A\n). However, the final Cit\n−\npopulation size was an order of magnitude lower (3 x 10\n5\ncells per mL, mean of high and low initial density treatments) than the final density of Cit\n−\ncells in any other treatment (\nFig 2B\n).","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":28539}],"target_id":"claim.ltee.turner-citminus-50k-reinvasion","target_kind":"node","target_sha256":"a51518604b1c1d62acdc0bd0c6cf28b47bde4a370db8ac880893bc7a5a503810"}],"claim.ltee.turner-citminus-detection-loss":[{"id":"assertion.ltee.turner-citminus-detection-loss","scope":{"assumptions":"PCR and colony phenotype assays applied to sampled material; disappearance inferred from detection limits.","population":"Frozen Ara−3 LTEE samples surveyed by genotype-specific PCR and phenotypic colony screens","quantifiers":"Presence through 43,500; absence detected from 44,000","time":"43,500 to 44,000 generations and later archived samples","uncertainty":"Absence of detectable signal is not a guarantee that no Cit− cell survived anywhere below assay sensitivity.","units":"generations"},"statement":"Turner et al. (2015) detected the Ara−3 Cit− genotype and phenotype through 43,500 LTEE generations but not in samples from 44,000 generations onward.","support":[{"end":24279,"quote":"The PCR assay for the presence of the Cit\n−\ngenotype produced clear bands of the expected size at all time points up to and including 43,500 generations (\nFig 1\n). At 44,000 generations and beyond, we did not observe any amplification. Phenotypic screens also indicated that the Cit\n−\nlineage went extinct between 43,500 and 44,000 generations. Cit\n−\ncells were detected through 43,500 generations in all cultures, but not at any later time point.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":23832}],"target_id":"claim.ltee.turner-citminus-detection-loss","target_kind":"node","target_sha256":"9400cb1dbe97035859bf6239b374430beb43158f010ebf5d559231f6dd7f8f63"}],"claim.ltee.turner-citminus-replay-survival":[{"id":"assertion.ltee.turner-citminus-replay-survival","scope":{"assumptions":"Standard LTEE conditions and genotype-specific PCR; frozen source populations may not reproduce any unrecorded environment perturbation.","population":"40 independently propagated Ara−3 replay cultures from frozen generation-43,500 and generation-40,000 populations; one additional from 43,000","quantifiers":"20+20 replays without Cit− loss; one 2,500-generation extension","time":"500 replay generations in each of 40 populations; 2,500 in one additional replay","uncertainty":"Zero extinctions in replays challenges repeatability under those conditions, not all hypothetical competitive-exclusion mechanisms.","units":"replicate populations; generations"},"statement":"Turner et al. (2015) found Cit− persistence in all 20 replay populations from generation 43,500 and all 20 from generation 40,000 after 500 generations, plus one generation-43,000 replay propagated for 2,500 generations.","support":[{"end":26428,"quote":"Twenty replicate populations founded from the 43,500-generation population sample evolved for 500 generations under the standard LTEE conditions. PCR assays showed that the Cit\n−\nclade persisted in all 20 cases through the end of the experiment. The Cit\n−\nlineage also persisted in all 20 control populations founded from the 40,000-generation population sample, and in the population founded from the 43,000-generation population sample that evolved for 2,500 generations.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":25955}],"target_id":"claim.ltee.turner-citminus-replay-survival","target_kind":"node","target_sha256":"80160e3db32a41ebff49b76f9fe131d5e3ce3ea32e760fade105957ac13ae0ee"}],"claim.ltee.turner-extinction-cause-unresolved":[{"id":"assertion.ltee.turner-extinction-cause-unresolved","scope":{"assumptions":"Reasoning combines failed replay repeatability, reinvasion, population-size argument, and hypothetical perturbation, not direct observation of a catastrophe.","population":"Ara−3 Cit− ecological lineage extinction between generation 43,500 and 44,000","quantifiers":"One lineage extinction; possible rare event","time":"Authors’ 2015 interpretation of extinction and replay results","uncertainty":"Environmental shock, soap residue, or water problem are hypotheses, not established mechanisms; complex alternatives discussed in paper are not proven impossible.","units":"generations"},"statement":"Turner et al. (2015) stated that the Ara−3 Cit− lineage extinction cause remained unknown, rejected their initial ongoing Cit+ adaptation explanation, and proposed an unidentified rare perturbation as a possible cause rather than an observed event.","support":[{"end":34095,"quote":"The cause of the Cit\n−\nlineage’s extinction remains unknown. We have rejected our initial hypothesis that on-going adaptation of the Cit\n+\nbacteria caused the extinction. A purely stochastic extinction of the Cit\n−\nlineage is also extremely unlikely.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":33845},{"end":35828,"quote":"We propose, therefore, that the cause of the Cit\n−\nextinction was a “random catastrophe”, that is, a large, rare event that reduced the size of the Ara–3 population as a whole or, at least, the Cit\n−\nlineage within it. We do not know the nature of this random catastrophe, but it could have been some unusual variation in laboratory conditions, such as soap residue in a flask or a problem with the deionized water used to make the culture medium.","source_id":"src.ltee.turner-extinction-replay-2015","source_sha256":"571094f9407f212dbf28a825a97ccce5b77736d6b340ae370229068566de8cc2","start":35381}],"target_id":"claim.ltee.turner-extinction-cause-unresolved","target_kind":"node","target_sha256":"a146e7f0095489bb39f2e424b14182f7a23f867d7786dd26615cb2739eb6e5e9"}],"claim.lz-4p2ty-background-consistency":[{"id":"assert.claim.lz-4p2ty-background-consistency.rev3","scope":{"assumptions":"The null-excess statement is conditional on the collaboration's analyzed data and expected-background model after removal of artificial signal-like events injected to mitigate analyzer bias.","population":"The data set analyzed in the specific LUX-ZEPLIN WIMP dark-matter search described by the retained source.","quantifiers":"The reported analysis used 4.2+-0.1 tonne-years from 280 live days, and the no-excess conclusion is restricted to the analyzed data relative to expected backgrounds.","time":"The reported analysis used a total exposure of 4.2+-0.1 tonne-years from 280 live days of LZ operation; atlas chronology remains unresolved under era=undated.","uncertainty":"This is a source-attributed null-excess result for the reported analysis. It does not establish that WIMPs do not exist, exclude all WIMP parameter space, resolve the nature of dark matter, or make any present-frontier claim.","units":"tonne-years and live days"},"statement":"In the LUX-ZEPLIN 4.2 tonne-year WIMP dark-matter search, the collaboration reported no evidence for an excess over expected backgrounds after removing artificial signal-like events injected to mitigate analyzer bias.","support":[{"end":446,"quote":"Title:\nDark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":346},{"end":4047,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new.","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":4482,"quote":"After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds.","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4321},{"end":4965,"quote":"Subjects:\nHigh Energy Physics - Experiment (hep-ex)","source_id":"src.dm.lz-2024","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4914}],"target_id":"claim.lz-4p2ty-background-consistency","target_kind":"node","target_sha256":"0a08f48825211834bb4adc7a6b7fd5f83137691e522a8bd807afee4d83c25ea9"}],"claim.lz-4p2ty-no-excess-reported":[{"id":"assertion.lz-4p2ty-no-excess-reported-v4","scope":{"assumptions":null,"population":"The analyzed data set in the LUX-ZEPLIN WIMP dark-matter search described by the retained source.","quantifiers":"Restricted to the reported 4.2 tonne-year LUX-ZEPLIN WIMP search and its reported comparison with expected backgrounds.","time":null,"uncertainty":"No evidence for an excess over expected backgrounds is represented only for this reported analysis; no broader conclusion about the existence or nature of dark matter is represented.","units":"tonne-years"},"statement":"In its 4.2 tonne-year WIMP dark-matter search, LUX-ZEPLIN reported no evidence for an excess over expected backgrounds after removal of artificial signal-like events injected to mitigate analyzer bias.","support":[{"end":446,"quote":"Title:\nDark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":346},{"end":3888,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber.","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":4482,"quote":"After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds.","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4321},{"end":4965,"quote":"Subjects:\nHigh Energy Physics - Experiment (hep-ex)","source_id":"src-dm-lz-4p2ty","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":4914}],"target_id":"claim.lz-4p2ty-no-excess-reported","target_kind":"node","target_sha256":"ebb141f1420b4b8326ff0c2e7a41baa590d57fd96aae4d00ee0f8a19c1e0e288"}],"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025":[{"id":"assertion.claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","scope":{"assumptions":"The two limits are conditional on alternative cosmological dark-energy parametrizations; not BAO-only data.","population":"DESI DR2 BAO and external CMB combination","quantifiers":"0.064 eV (ΛCDM) and 0.16 eV (w0wa)","time":"2025 DESI DR2 analysis","uncertainty":"Neither 95% upper limit is a direct mass observation or a universal model-independent upper bound.","units":"eV; 95% upper limit"},"statement":"The DESI DR2 analysis reported a 95% upper limit Σmν<0.064 eV for DESI BAO plus CMB under ΛCDM, versus Σmν<0.16 eV under a time-evolving w0wa dark-energy model using the same stated combination.","support":[{"end":5024,"quote":"From the combination of DESI and CMB we derive 95% upper limits on the sum of neutrino masses, finding $\\sum m_\\nu<0.064$ eV assuming $\\Lambda$CDM and $\\sum m_\\nu<0.16$ eV in the $w_0w_a$ model.","source_id":"src.neutrino.desi-dr2-bao-cosmology-2025","source_sha256":"aaec6a572b0bc71659c8d5d91ca9e17d987e6fb51518b5cecf14f127c8200148","start":4830}],"target_id":"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","target_kind":"node","target_sha256":"278cafce74ac3b1161f4904e8c6a8a3ac780d6751fd375d49dc59f957df9db87"}],"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025":[{"id":"assertion.claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","scope":{"assumptions":"Feldman-Cousins and Bayesian effective-parameter results are distinct statistical constructions; effective negative density is an analysis device, not physical negative neutrino mass.","population":"DESI DR2 BAO combined with external Planck and ACT CMB datasets as analyzed in this study","quantifiers":"Σmν<0.053 eV (95% Feldman-Cousins); 3σ effective-parameter tension","time":"2025 analysis","uncertainty":"Claimed tension depends on model assumptions, priors and treatment of boundaries; source itself mentions possible systematics and evolving dark energy.","units":"eV; confidence percentage; sigma"},"statement":"The DESI DR2 neutrino-constraints analysis reported a Feldman-Cousins 95% bound Σmν<0.053 eV after correcting for the zero-mass boundary, below the oscillation-inferred lower limit, and a separate effective-mass parametrization yielding 3σ tension under its analysis assumptions.","support":[{"end":3905,"quote":"However, we determine using frequentist and Bayesian methods that our constraints are in tension with the lower limits derived from neutrino oscillations. Correcting for the physical boundary at zero mass, we report a 95% Feldman-Cousins upper limit of $\\sum m_\\nu<0.053$ eV, breaching the lower limit from neutrino oscillations. Considering a more general Bayesian analysis with an effective cosmological neutrino mass parameter, $\\sum m_{\\nu,\\rm{eff}}$, that allows for negative energy densities and removes unsatisfactory prior weight effects, we derive constraints that are in $3\\sigma$ tension with the same oscillation limit.","source_id":"src.neutrino.desi-dr2-neutrino-constraints-2025","source_sha256":"ca6759d2fd6ba1b88e0bac9d225b3802a32560d0a588b646dcaf13ef7bac7730","start":3274}],"target_id":"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","target_kind":"node","target_sha256":"eb3d73244cf45a26fce9e6309aed9a101597515c05e54829d0a7e2c30abeea4c"}],"claim.neutrino.isocurvature-hierarchy-prior-2026":[{"id":"assertion.claim.neutrino.isocurvature-hierarchy-prior-2026","scope":{"assumptions":"The 0.052 eV bound is conditional on an unconstrained-from-below-by-oscillation mass prior; the 0.092 eV bound reflects a hierarchy-informed prior.","population":"Joint CMB-SPA, DESI DR2 BAO and DES Year 5 supernova analysis","quantifiers":"initial 95% limit 0.052 eV, oscillation floor 0.05878 eV, revised 95% upper limit 0.092 eV","time":"2026 paper, comparing alternative neutrino mass-sum priors","uncertainty":"The paper's prior analysis does not show that the mass sum is physically negative or establish neutrino hierarchy from cosmology.","units":"eV"},"statement":"The 2026 cosmological isocurvature analysis reported that its purely adiabatic ΛCDM upper limit of 0.052 eV lay below the oscillation-implied normal-ordering minimum of 0.05878 eV because of a statistical prior extending to zero, while a hierarchy-informed prior raised the reported upper limit to 0.092 eV.","support":[{"end":2330,"quote":"Notably, the adiabatic $\\Lambda$CDM limit of $0.052$ eV lies below the minimum sum required by the normal neutrino mass hierarchy ($0.05878$ eV), indicating that this bound is an artifact of the statistical prior extending to zero. Imposing a physically motivated hierarchy-informed prior raises the limit to $< 0.092$ eV. Our results demonstrate that current data show no evidence for NDI modes and that the inferred neutrino mass upper limit is robust against this extension, but a definitive, model-independent bound requires addressing prior dependencies and dark energy uncertainties.","source_id":"src.neutrino.desi-isocurvature-mass-priors-2026","source_sha256":"5bc1d8b96976d5da08b59bd5ede3eb1ab72eb9fab3580ffe32cfd19895e6a83c","start":1741}],"target_id":"claim.neutrino.isocurvature-hierarchy-prior-2026","target_kind":"node","target_sha256":"2126f75821160c4ff22509f2c3f884c9b002ac8767fb0eaf99b3876f5296b3ee"}],"claim.neutrino.isocurvature-mass-limits-2026":[{"id":"assertion.claim.neutrino.isocurvature-mass-limits-2026","scope":{"assumptions":"The comparison changes initial-condition assumptions within each dark-energy model; these are model/prior-dependent posterior limits.","population":"Joint Planck 2018, ACT DR6, SPT-3G CMB; DESI DR2 BAO; DES Year 5 supernovae","quantifiers":"ΛCDM <0.052 vs <0.057 eV; CPL <0.111 vs <0.115 eV","time":"2026 paper under two cosmological model assumptions","uncertainty":"The sub-oscillation-minimum ΛCDM bound can arise from a prior extending to zero and is not a model-independent exclusion of normal ordering.","units":"eV; 95% upper bound"},"statement":"A 2026 joint CMB, DESI DR2 and supernova analysis reported that allowing a neutrino-density isocurvature mode shifted its 95% neutrino mass-sum limits from 0.052 to 0.057 eV under ΛCDM and 0.111 to 0.115 eV under dynamical dark energy, without detecting the isocurvature mode.","support":[{"end":1538,"quote":"Within the $\\Lambda$CDM model, the 95\\% upper limit weakens only marginally from $\\sum m_\\nu < 0.052$ eV (purely adiabatic) to $< 0.057$ eV (including NDI), with the NDI amplitude consistent with zero. In the CPL dynamical dark energy model, the adiabatic limit is $< 0.111$ eV, shifting to $< 0.115$ eV with NDI, yet the isocurvature mode remains undetected.","source_id":"src.neutrino.desi-isocurvature-mass-priors-2026","source_sha256":"5bc1d8b96976d5da08b59bd5ede3eb1ab72eb9fab3580ffe32cfd19895e6a83c","start":1179}],"target_id":"claim.neutrino.isocurvature-mass-limits-2026","target_kind":"node","target_sha256":"cceccad5bb753cb83066e584534ba83ca1c9ad5dd7e7694ab5d59ff2a142aab9"}],"claim.neutrino.juno-accelerator-ordering-indication-2026":[{"id":"assertion.claim.neutrino.juno-accelerator-ordering-indication-2026","scope":{"assumptions":"Frequentist significance and Bayesian evidence reflect different inferential procedures and the cited combination; these are not reactor-only results.","population":"JUNO reactor data combined with external long-baseline accelerator constraints","quantifiers":"at least 2.1σ one-sided; Bayes factor 10.18","time":"September 2026 report","uncertainty":"An indication is not a definitive ordering determination; the Bayes factor depends on likelihood/prior choices not detailed in the retained abstract.","units":"sigma; dimensionless Bayes factor"},"statement":"The September 2026 JUNO collaboration reported that incorporating long-baseline accelerator constraints on Δm31² favored normal over inverted neutrino mass ordering with one-sided significance of at least 2.1σ across CP-violating phases and a Bayesian Bayes factor of 10.18.","support":[{"end":2020,"quote":"Incorporating constraints on $\\Delta m^2_{31}$ from long-baseline accelerator neutrino experiments into our analysis favored normal ordering over inverted ordering, with a one-sided significance of at least $2.1\\sigma$ across all possible CP-violating phases; a Bayesian analysis yielded a Bayes factor of 10.18 in favor of normal ordering.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":1680}],"target_id":"claim.neutrino.juno-accelerator-ordering-indication-2026","target_kind":"node","target_sha256":"8915cb012b86aecf3127df475d2ea4bf6f3e8a8686f1629762590880d525d6a2"}],"claim.neutrino.juno-data-splittings-2026":[{"id":"assertion.claim.neutrino.juno-data-splittings-2026","scope":{"assumptions":"The fitted atmospheric splitting is conditional on the chosen mass ordering and external Daya Bay constraint; the sample is not an independent determination of ordering.","population":"JUNO inverse-beta-decay candidate sample","quantifiers":"8,294 candidates; Δm31² = +2.509 (+0.027/-0.025) ×10^-3 eV² NO; -2.482 (+0.025/-0.026) ×10^-3 eV² IO","time":"207.2 live days, as reported in September 2026","uncertainty":"Oscillation-parameter fits and event counts do not establish the absolute neutrino mass or conclusive ordering.","units":"days; km; counts; eV^2"},"statement":"The September 2026 JUNO analysis reported 8,294 inverse-beta-decay candidates in 207.2 live days at an average 52.5 km reactor baseline and obtained different fitted atmospheric mass splittings under normal and inverted ordering using a Daya Bay constraint.","support":[{"end":1402,"quote":"The analysis is based on 207.2 live days of data, comprising 8,294 inverse beta-decay candidates collected at an average reactor baseline of 52.5 km. A world-leading precision of approximately 1% was achieved for the atmospheric neutrino mass splitting $\\Delta m^2_{31}$, with $\\Delta m^2_{31}=+2.509^{+0.027}_{-0.025}\\times10^{-3}\\,\\mathrm{eV}^2$ for normal ordering and $\\Delta m^2_{31}=-2.482^{+0.025}_{-0.026}\\times10^{-3}\\,\\mathrm{eV}^2$ for inverted ordering, using the Daya Bay constraint in the fit to resolve the correct physical minimum under each mass-ordering hypothesis.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":819}],"target_id":"claim.neutrino.juno-data-splittings-2026","target_kind":"node","target_sha256":"fab249e029cbb5a18ea61f64b6f76f8715b9a2258203274a2d265737a03598a9"}],"claim.neutrino.juno-solar-parameters-2026":[{"id":"assertion.claim.neutrino.juno-solar-parameters-2026","scope":{"assumptions":"Oscillation parameters are fitted within the model used by the collaboration; relative precision is as reported in the abstract.","population":"JUNO reactor-antineutrino oscillation measurement","quantifiers":"0.3036±0.0064; (7.388±0.078)×10^-5 eV²; relative 2.1% and 1.1%","time":"September 2026 report of 207.2-live-day analysis","uncertainty":"These are not absolute neutrino-mass estimates, and the reported uncertainties should not be recast as independently validated accuracy.","units":"dimensionless sin²θ12; eV²"},"statement":"The September 2026 JUNO analysis reported sin²θ12=0.3036±0.0064 and Δm21²=(7.388±0.078)×10^-5 eV², with stated relative precisions of 2.1% and 1.1%, respectively.","support":[{"end":1679,"quote":"We further improved the world's most precise measurements of the solar oscillation parameters, obtaining $\\sin^2\\theta_{12}=0.3036\\pm0.0064$ and $\\Delta m^2_{21}=(7.388\\pm0.078)\\times10^{-5}\\,\\mathrm{eV}^2$, corresponding to relative precisions of 2.1% and 1.1%, respectively.","source_id":"src.neutrino.juno-ordering-207d-2026","source_sha256":"f29096ab4406799ddc78903998af93afc424dd655e6c3f780545a33df84c4f2a","start":1403}],"target_id":"claim.neutrino.juno-solar-parameters-2026","target_kind":"node","target_sha256":"26e1f5c1b9ff9edbd39b25215c9587dbdad6ac755af6eb3a9571e03422f95952"}],"claim.neutrino.kamlandzen-half-life-2024":[{"id":"assertion.claim.neutrino.kamlandzen-half-life-2024","scope":{"assumptions":"The exposure is from KamLAND-Zen 800; the half-life limit uses a combination with the previous phase rather than just that exposure.","population":"KamLAND-Zen 800 xenon-136 data and preceding KamLAND-Zen phase","quantifiers":"745 kg enriched xenon; 2.1 tonne-years Xe-136; T1/2^0ν >3.8×10^26 yr (90% CL)","time":"Full dataset in arXiv report first submitted 2024, revised 2026","uncertainty":"A nondetection bounds the assumed decay channel; it does not demonstrate zero neutrino mass or Dirac nature.","units":"kg enriched Xe; tonne-years ^136Xe; years; 90% CL"},"statement":"The KamLAND-Zen full-dataset search with 745 kg enriched xenon and 2.1 tonne-years of xenon-136 exposure, combined with its previous phase, reported a 90%-confidence lower bound on the neutrinoless double-beta half-life of 3.8×10^26 years.","support":[{"end":2124,"quote":"We present a search for neutrinoless double-beta ($0\\nu\\beta\\beta$) decay of $^{136}$Xe using the full \\mbox{KamLAND-Zen 800} dataset with 745\\,kg of enriched xenon, corresponding to an exposure of $2.1$\\,ton\\,yr of $^{136}$Xe. This updated search benefits from a more than twofold increase in exposure, recovery of photo-sensor gain, and reduced background from muon-induced spallation of xenon. Combining with the search in the previous KamLAND-Zen phase, we obtain a lower limit for the $0\\nu\\beta\\beta$ decay half-life of $T_{1/2}^{0\\nu} > 3.8 \\times 10^{26}$\\,yr at 90\\% C.L., a factor of 1.7 improvement over the previous limit.","source_id":"src.neutrino.kamlandzen-complete-2024","source_sha256":"afccf49d3b787214c789322748f3268ed802b833d816cf5024b84de212c3c216","start":1490}],"target_id":"claim.neutrino.kamlandzen-half-life-2024","target_kind":"node","target_sha256":"aa6185d1206808ff8ea12d5c18212a6b1035a38715d96d3c06d00747261651b7"}],"claim.neutrino.kamlandzen-majorana-translation-2024":[{"id":"assertion.claim.neutrino.kamlandzen-majorana-translation-2024","scope":{"assumptions":"Translation assumes a neutrinoless-decay interpretation and chosen nuclear matrix elements; it is not direct kinematic neutrino-mass spectroscopy.","population":"KamLAND-Zen xenon-136 neutrinoless double-beta decay interpretation","quantifiers":"upper limits 28–122 meV","time":"Abstract of 2024 submission, as revised March 2026","uncertainty":"The mass range varies by nuclear modeling; nondetection does not establish whether neutrinos are Majorana or Dirac.","units":"meV; model-dependent inferred effective mass"},"statement":"The KamLAND-Zen full-dataset report translated its neutrinoless xenon-136 double-beta half-life constraint into effective Majorana neutrino-mass upper limits ranging from 28 to 122 meV using phenomenological nuclear matrix-element calculations.","support":[{"end":2285,"quote":"The corresponding upper limits on the effective Majorana neutrino mass are in the range 28--122\\,meV using phenomenological nuclear matrix element calculations.","source_id":"src.neutrino.kamlandzen-complete-2024","source_sha256":"afccf49d3b787214c789322748f3268ed802b833d816cf5024b84de212c3c216","start":2125}],"target_id":"claim.neutrino.kamlandzen-majorana-translation-2024","target_kind":"node","target_sha256":"1dccac696b4f8f3b94ae9b47c29117fae08ce569c670e008a2c2786f797fa975"}],"claim.neutrino.katrin-endpoint-bound-259d":[{"id":"assertion.claim.neutrino.katrin-endpoint-bound-259d","scope":{"assumptions":"A negative unconstrained best-fit squared-mass parameter is a statistical fit result, not a physical negative neutrino mass; effective kinematic mass differs from the cosmological sum.","population":"KATRIN tritium beta-decay endpoint spectrum","quantifiers":"best-fit mν²=-0.14 (+0.13/-0.15) eV²; mν<0.45 eV at 90% CL; 36 million electrons","time":"First five neutrino-mass campaigns totaling 259 measurement days; report submitted 2024 and published 2025","uncertainty":"No positive absolute-mass measurement follows from the upper limit; systematics/background modeled in analysis and not fully auditable from captured abstract.","units":"eV²; eV; electrons; days; confidence level"},"statement":"KATRIN reported a fitted squared effective electron-antineutrino mass of -0.14 (+0.13/-0.15) eV² from five tritium beta-decay campaigns and an effective-mass upper limit of 0.45 eV at 90% confidence using 259 measurement days and 36 million electrons.","support":[{"end":3472,"quote":"Based on the first five neutrino-mass measurement campaigns, we derive a best-fit value of $m_\\nu^{2} = {-0.14^{+0.13}_{-0.15}}~\\mathrm{eV^2}$, resulting in an upper limit of $m_\\nu < {0.45}~\\mathrm{eV}$ at 90 % confidence level. With six times the statistics of previous data sets, amounting to 36 million electrons collected in 259 measurement days, a substantial reduction of the background level and improved systematic uncertainties, this result tightens KATRIN's previous bound by a factor of almost two.","source_id":"src.neutrino.katrin-259days-mass-2024","source_sha256":"f919827559943755f4f6b64ef18f8a25c8195b2af99ed4c5aeb9ba6a68254c2e","start":2962}],"target_id":"claim.neutrino.katrin-endpoint-bound-259d","target_kind":"node","target_sha256":"b4b8f481e1beaf7bb29caedbb295795fe860e39ca45d8cb0c47a0b9628184e6b"}],"claim.neutrino.planck-bao-mass-sum-2018":[{"id":"assertion.claim.neutrino.planck-bao-mass-sum-2018","scope":{"assumptions":"Cosmological mass-sum inference assumes base ΛCDM and a specified CMB-plus-BAO data combination; upper limits are quoted at 95%.","population":"Cosmological Planck CMB constraints combined with BAO","quantifiers":"Σmν<0.12 eV","time":"Planck 2018 results, abstract of version revised August 2021","uncertainty":"Cannot be interpreted as a direct laboratory neutrino-mass measurement or model-independent limit.","units":"eV; 95% confidence"},"statement":"The Planck 2018 cosmological-parameter analysis reported Σmν<0.12 eV as a 95% upper limit when combined with baryon acoustic oscillation data in its base spatially flat ΛCDM framework.","support":[{"end":4720,"quote":"Combining with BAO we constrain the effective extra relativistic degrees of freedom to be $N_{\\rm eff} = 2.99\\pm 0.17$, and the neutrino mass is tightly constrained to $\\sum m_\\nu< 0.12$eV.","source_id":"src.neutrino.planck-2018-cosmological-parameters","source_sha256":"52f0d5028072a74112be4f3840fab6034f649af14651b3083e6839dfe07dfd0e","start":4531}],"target_id":"claim.neutrino.planck-bao-mass-sum-2018","target_kind":"node","target_sha256":"c67d8d80f235402a28fb7a6c96876af03a0afdc4fb1e76f7a360fcd7cb3a6745"}],"claim.neutrino.planck-prior-ordering-dependence-2019":[{"id":"assertion.claim.neutrino.planck-prior-ordering-dependence-2019","scope":{"assumptions":"Mass hierarchy scenarios impose different mass-sum prior distributions; this is reanalysis, not new independent Planck data.","population":"Cosmological reanalysis of Planck 2018 and specified BAO surveys","quantifiers":"<0.12 degenerate; <0.15 normal; <0.17 inverted eV","time":"2019 report using existing public data","uncertainty":"Values depend on chosen cosmological model and priors, not proof of a mass ordering or inconsistency.","units":"eV; 95% confidence"},"statement":"A Bayesian reanalysis using Planck 2018 CMB plus BOSS DR12, MGS and 6dFGS BAO data reported 95%-confidence neutrino mass-sum limits of 0.12 eV (degenerate masses), 0.15 eV (normal ordering) and 0.17 eV (inverted ordering), attributing their differences to mass-sum priors.","support":[{"end":1359,"quote":"In the minimal $\\Lambda\\textrm{CDM}+\\sum m_{\\nu}$ model with most recent CMB data from Planck 2018 TT,TE,EE, lowE, and lensing; and BAO data from BOSS DR12, MGS, and 6dFGS, we find that at 95\\% C.L. the bounds are: $\\sum m_{\\nu}<0.12$ eV (degenerate), $\\sum m_{\\nu}<0.15$ eV (normal), $\\sum m_{\\nu}<0.17$ eV (inverted). The bounds vary across the different mass orderings due to different priors on $\\sum m_{\\nu}$.","source_id":"src.neutrino.planck-ordering-prior-analysis-2019","source_sha256":"6c50f2ea8a5a92e78db686079a553dbd366d052faed49f0183c5a2056df92449","start":945}],"target_id":"claim.neutrino.planck-prior-ordering-dependence-2019","target_kind":"node","target_sha256":"c3f6f7fec9a7befd9f3d60e1e9fee2adeea1980018a4040140ae116d101397c4"}],"claim.shoes-cepheid-sn-h0-baseline":[{"id":"assert.claim.shoes-cepheid-sn-h0-baseline","scope":{"assumptions":null,"population":"The Cepheid-SN sample analyzed by SH0ES.","quantifiers":"H0=73.04+-1.04 km/s/Mpc","time":null,"uncertainty":"The reported value includes systematics.","units":"km/s/Mpc"},"statement":"The SH0ES analysis reports a baseline Cepheid-SN H0 result of 73.04+-1.04 km/s/Mpc, including systematics.","support":[{"end":2539,"quote":"Our baseline result from the Cepheid-SN sample is H0=73.04+-1.04 km/s/Mpc, which includes systematics and lies near the median of all analysis variants.","source_id":"src-shoes-2112.04510","source_sha256":"74fb661710b934e031f55ff43d685f91c3826fef58e86652e1c334a8fff21a05","start":2387}],"target_id":"claim.shoes-cepheid-sn-h0-baseline","target_kind":"node","target_sha256":"c9876c61085e679f684e7bf6a3e073e9f638f2b875249178fa2573995acf71db"}],"concept.aat.300015647":[{"id":"assertion.concept.aat.300015647","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"African (general, continental cultures) as defined in the captured Getty AAT record 300015647","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African (general, continental cultures) as: Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","support":[{"end":576,"quote":"Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","source_id":"getty-aat.300015647","source_sha256":"2ec3626deb0c99d77082899dd32d65179a7794bac9d263c245ac329ffd9d78ab","start":441}],"target_id":"concept.aat.300015647","target_kind":"node","target_sha256":"80348c5aa535e9c87905e27bd4e317bd7d680fb5766011d97c1c0e993531fe1d"}],"concept.aat.300015649":[{"id":"assertion.concept.aat.300015649","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric African as defined in the captured Getty AAT record 300015649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric African as: Cultures and styles from the prehistoric era in Africa.","support":[{"end":517,"quote":"Cultures and styles from the prehistoric era in Africa.","source_id":"getty-aat.300015649","source_sha256":"167f880872da01d82e1aec50ec8c27b37165fa74a7fddad0cb2734326738e109","start":462}],"target_id":"concept.aat.300015649","target_kind":"node","target_sha256":"18016638b151a4ac6690d262fc36d1536aecc2754798804bd96ee966df5cb3e6"}],"concept.aat.300015650":[{"id":"assertion.concept.aat.300015650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric North African periods as defined in the captured Getty AAT record 300015650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric North African periods as: Periods related to prehistoric North African cultures.","support":[{"end":512,"quote":"Periods related to prehistoric North African cultures.","source_id":"getty-aat.300015650","source_sha256":"69febc61a910ce488993349bf5553337728a4ebb4859ba10da3e5fb7f09998da","start":458}],"target_id":"concept.aat.300015650","target_kind":"node","target_sha256":"3add409f4cb3eb8832e74f5867118ec6b2eee73d4a3b0acb227423b0129a9338"}],"concept.aat.300015667":[{"id":"assertion.concept.aat.300015667","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric Sub-Saharan African periods as defined in the captured Getty AAT record 300015667","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric Sub-Saharan African periods as: Periods related to prehistoric Sub-Saharan African cultures.","support":[{"end":524,"quote":"Periods related to prehistoric Sub-Saharan African cultures.","source_id":"getty-aat.300015667","source_sha256":"9894ca9b4251a8165ddb3348ec6f8016ce50bc9dc83a9d5a50f50767281eea2f","start":464}],"target_id":"concept.aat.300015667","target_kind":"node","target_sha256":"f5089be5aa0242188e9e5347926a9f324e99d450c1cf98f0c7273a505256b1e0"}],"concept.aat.300015690":[{"id":"assertion.concept.aat.300015690","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient African as defined in the captured Getty AAT record 300015690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient African as: Cultures and styles of Africa in ancient times.","support":[{"end":505,"quote":"Cultures and styles of Africa in ancient times.","source_id":"getty-aat.300015690","source_sha256":"450ba8f4901cea095473a92a16eededad0ad75c82f30421a961e42118fdd51ec","start":458}],"target_id":"concept.aat.300015690","target_kind":"node","target_sha256":"34b18c7c0ad44edeab0449e27068a7a4b2ed2cbfa9b75fa58eadfb5049308593"}],"concept.aat.300015692":[{"id":"assertion.concept.aat.300015692","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Central African as defined in the captured Getty AAT record 300015692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Central African as: Cultures and styles of Central Africa in ancient times.","support":[{"end":499,"quote":"Cultures and styles of Central Africa in ancient times.","source_id":"getty-aat.300015692","source_sha256":"19d2efe684a8fd19195cbf47b2054ddb8f4904907d7dd95bb44773d0f2bd1eca","start":444}],"target_id":"concept.aat.300015692","target_kind":"node","target_sha256":"b5649976e1b850c692fbd7584d06b2c8344fb0fa30ddce89e1804dc6c4c866c4"}],"concept.aat.300015702":[{"id":"assertion.concept.aat.300015702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ancient East African as defined in the captured Getty AAT record 300015702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ancient East African as: Cultures and styles of East Africa in ancient times.","support":[{"end":493,"quote":"Cultures and styles of East Africa in ancient times.","source_id":"getty-aat.300015702","source_sha256":"6d8c0365ffedba1633b07023aa5c15dcb7b142beae80048de1da7cd27b512205","start":441}],"target_id":"concept.aat.300015702","target_kind":"node","target_sha256":"273ccacc9c68dd7625dd9827d6bfcbfe0964405feafa78a58ec6b7553df93cd4"}],"concept.aat.300015723":[{"id":"assertion.concept.aat.300015723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient North African as defined in the captured Getty AAT record 300015723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient North African as: Styles and cultures of North Africa in ancient times.","support":[{"end":495,"quote":"Styles and cultures of North Africa in ancient times.","source_id":"getty-aat.300015723","source_sha256":"ca6dd05e9ce0f964032f11decf6609ed85324a5c158ffa9ae927059cc3ef0963","start":442}],"target_id":"concept.aat.300015723","target_kind":"node","target_sha256":"21b5ac94b1c674eedbfbc2b5ec5f557903f38ed247bfe0052d973a30982b7fcd"}],"concept.aat.300015727":[{"id":"assertion.concept.aat.300015727","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Southern African as defined in the captured Getty AAT record 300015727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Southern African as: Cultures and styles of southern Africa in ancient times.","support":[{"end":501,"quote":"Cultures and styles of southern Africa in ancient times.","source_id":"getty-aat.300015727","source_sha256":"32bde60ae9570d284b677a11a1a8eb711bae9beb8186fdff397859d63c01c2a6","start":445}],"target_id":"concept.aat.300015727","target_kind":"node","target_sha256":"dd0fa76e5e458e80cbb7ac4a6a96dc5a100a3892955d012345d52cb99e602e61"}],"concept.aat.300015759":[{"id":"assertion.concept.aat.300015759","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient West African as defined in the captured Getty AAT record 300015759","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient West African as: Cultures and styles of West Africa in ancient times.","support":[{"end":493,"quote":"Cultures and styles of West Africa in ancient times.","source_id":"getty-aat.300015759","source_sha256":"17cb004c095bc5d9fabba004f726b6bb2dae5cb3acc99e2d1535e4e4c1aafbc3","start":441}],"target_id":"concept.aat.300015759","target_kind":"node","target_sha256":"be521c21cdcd3bf619b901015a81a09020555deafb314bfcbbb84337ce7e7257"}],"concept.aat.300016434":[{"id":"assertion.concept.aat.300016434","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eastern African as defined in the captured Getty AAT record 300016434","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eastern African as: Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","support":[{"end":663,"quote":"Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","source_id":"getty-aat.300016434","source_sha256":"899f41cf38927b17fcce05f830829e7a4b55e742bbd8bbd3d3aad6c311d9a795","start":466}],"target_id":"concept.aat.300016434","target_kind":"node","target_sha256":"3b24294a5a4824f94551022f255f33dbaccce9709c70162a6d7f49506055b7d0"}],"concept.aat.300016538":[{"id":"assertion.concept.aat.300016538","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Southern African as defined in the captured Getty AAT record 300016538","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Southern African as: Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","support":[{"end":789,"quote":"Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","source_id":"getty-aat.300016538","source_sha256":"d8db7e95a9d5f9ff4f117f43061e97529a00468508b003047be3d7c3881e1d1c","start":467}],"target_id":"concept.aat.300016538","target_kind":"node","target_sha256":"e07496f19e91f0a5dd7e0e95b16016876ed736cafe6826a61a1ce644d55cc744"}],"concept.aat.300016586":[{"id":"assertion.concept.aat.300016586","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"North African as defined in the captured Getty AAT record 300016586","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","support":[{"end":566,"quote":"Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","source_id":"getty-aat.300016586","source_sha256":"5ab820c8299adc4a4506352fa70c238ac6d44a55d6f4bfa1952b699f1f717e2c","start":464}],"target_id":"concept.aat.300016586","target_kind":"node","target_sha256":"788305d3906d48d5b290f6458b0f056bc24443cc26ccb0f5de797e82c493e316"}],"concept.aat.300016598":[{"id":"assertion.concept.aat.300016598","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pole Style as defined in the captured Getty AAT record 300016598","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pole Style as: Style of African sculpture, typically elongated, severe, and abstract-looking.","support":[{"end":518,"quote":"Style of African sculpture, typically elongated, severe, and abstract-looking.","source_id":"getty-aat.300016598","source_sha256":"0b330563bd1a488507e2efbd4010729f2fc2cc1613892d83b93e890add69d864","start":440}],"target_id":"concept.aat.300016598","target_kind":"node","target_sha256":"e5b439fdf81358e27adbfafdfc1e6a7ff4e91dad89c4218bb85ac37d9ed64bee"}],"concept.aat.300016600":[{"id":"assertion.concept.aat.300016600","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Round Style as defined in the captured Getty AAT record 300016600","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Round Style as: Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","support":[{"end":608,"quote":"Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","source_id":"getty-aat.300016600","source_sha256":"0d0561174ff464cd9a2f0686339a1eb866a1dda18ca1ad39785ddf9bfbff891f","start":441}],"target_id":"concept.aat.300016600","target_kind":"node","target_sha256":"714304b5319e25741c812c7ff6226e07174f543d151474f50a93e7490abae267"}],"concept.aat.300016617":[{"id":"assertion.concept.aat.300016617","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"The Americas as defined in the captured Getty AAT record 300016617","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.","support":[{"end":485,"quote":"Refers to a style region encompassing North, Central and South America.","source_id":"getty-aat.300016617","source_sha256":"9847538c442bcb1ce67afbd1a48cc3303857c93d3d5323033e62a537f6366f35","start":414}],"target_id":"concept.aat.300016617","target_kind":"node","target_sha256":"5b9da19f89fbf057710aedec341f339edaac7db56af3f5442da3cb826ec83449"}],"concept.aat.300017437":[{"id":"assertion.concept.aat.300017437","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Native American as defined in the captured Getty AAT record 300017437","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Native American as: Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis. For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","support":[{"end":964,"quote":"Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis.  For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","source_id":"getty-aat.300017437","source_sha256":"da456339c29f293ddf6d5188596921b17ce440c51cd9580fc99cb45e662963f9","start":431}],"target_id":"concept.aat.300017437","target_kind":"node","target_sha256":"261a8433990642becc387ff3b8d01b7fd1cf53a0d71fdc686a42ba8d898d5250"}],"concept.aat.300018115":[{"id":"assertion.concept.aat.300018115","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern American as defined in the captured Getty AAT record 300018115","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern American as: Styles, periods, cultures, and movements of America in modern times.","support":[{"end":500,"quote":"Styles, periods, cultures, and movements of  America in modern times.","source_id":"getty-aat.300018115","source_sha256":"6aa1dc8c75a40fca0329b7e7d77e2a22e73cc1c7a9cf01728d62fe7a5b087c99","start":431}],"target_id":"concept.aat.300018115","target_kind":"node","target_sha256":"37dc08f199df2d9f7ba00d80816f039a6e52929bf62ae355c18f71f48247a928"}],"concept.aat.300018279":[{"id":"assertion.concept.aat.300018279","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Asian as defined in the captured Getty AAT record 300018279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Asian as: Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","support":[{"end":705,"quote":"Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","source_id":"getty-aat.300018279","source_sha256":"ab232c54bc206c34be82fe89cf5508c138dc4b570eea2f5558c20c7ac9014528","start":407}],"target_id":"concept.aat.300018279","target_kind":"node","target_sha256":"21ba97ae4569df00f71f03e3280bdd0ef81ce4d4adf30fbc217f84d19eaaad6a"}],"concept.aat.300018704":[{"id":"assertion.concept.aat.300018704","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indonesian as defined in the captured Getty AAT record 300018704","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indonesian as: Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","support":[{"end":1320,"quote":"Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","source_id":"getty-aat.300018704","source_sha256":"b8595cca9cfc8b61bfd04db42f7a9902de6866ed84f9c655a111f8c3189ff36e","start":397}],"target_id":"concept.aat.300018704","target_kind":"node","target_sha256":"b4f222662568f35948ffb9f6b249b9ef78fc2470fd216ea626297ebbad281dee"}],"concept.aat.300018773":[{"id":"assertion.concept.aat.300018773","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"Siberian (culture or style) as defined in the captured Getty AAT record 300018773","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Siberian (culture or style) as: Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","support":[{"end":682,"quote":"Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","source_id":"getty-aat.300018773","source_sha256":"aba4b77ce9256425bd93c4eae183c7b63f900b62045055f854e5276f4bb1b283","start":436}],"target_id":"concept.aat.300018773","target_kind":"node","target_sha256":"454e88431e7695215c7807502545b53e7b996d0762580859cdd067e18e7ad63f"}],"concept.aat.300018775":[{"id":"assertion.concept.aat.300018775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Afanasievo as defined in the captured Getty AAT record 300018775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Afanasievo as: Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE. Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","support":[{"end":792,"quote":"Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE.  Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","source_id":"getty-aat.300018775","source_sha256":"85d97e4bd3dbda320d6faee11a9e6ee2d38dc2dae6bc228f1062b1b862d9190d","start":409}],"target_id":"concept.aat.300018775","target_kind":"node","target_sha256":"7d76dc3e473c1ed8c36a2c97f832b3be0667d3e46a0db27e76042fdc67a33a78"}],"concept.aat.300018777":[{"id":"assertion.concept.aat.300018777","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Okunev as defined in the captured Getty AAT record 300018777","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Okunev as: Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","support":[{"end":644,"quote":"Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","source_id":"getty-aat.300018777","source_sha256":"d873fdf63e5dcf1b21db7dbb8c8bb2731deeb4118fba0689286f6ccdd7aa7411","start":405}],"target_id":"concept.aat.300018777","target_kind":"node","target_sha256":"05070b44cbf72e4908aeef3fb404f3ae03993f423cccd9a9cf5cc052c8d74403"}],"concept.aat.300018778":[{"id":"assertion.concept.aat.300018778","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Andronovo as defined in the captured Getty AAT record 300018778","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Andronovo as: Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","support":[{"end":719,"quote":"Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","source_id":"getty-aat.300018778","source_sha256":"e3726d94b33565d32b058e7e36879a3c8330cae9088cbeae9a1d10d3b65d93ad","start":408}],"target_id":"concept.aat.300018778","target_kind":"node","target_sha256":"5c0df28d4a7eb49e7f8b7b369a7e0f9e252cd712b6070c15813f204bbeaf5ec7"}],"concept.aat.300018779":[{"id":"assertion.concept.aat.300018779","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Karasuk as defined in the captured Getty AAT record 300018779","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Karasuk as: Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","support":[{"end":732,"quote":"Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","source_id":"getty-aat.300018779","source_sha256":"593d79645a3b0635731e91353b5151026491014fbd37edf012a9d969da81c4d0","start":406}],"target_id":"concept.aat.300018779","target_kind":"node","target_sha256":"a1f0868c397448dfc080fd95df742151d70de1ed3d8c89728358dd5aa26741e5"}],"concept.aat.300018803":[{"id":"assertion.concept.aat.300018803","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Altai as defined in the captured Getty AAT record 300018803","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Altai as: Style and culture of the mountain range running along border shared by China and Mongolia.","support":[{"end":494,"quote":"Style and culture of the mountain range running along border shared by China and Mongolia.","source_id":"getty-aat.300018803","source_sha256":"d8d77dcfbcfe7195f9e6e8207da0f636dee3db37701e240e78a2bdc739d0ade4","start":404}],"target_id":"concept.aat.300018803","target_kind":"node","target_sha256":"5e865f19239fa6bef75d10bd6b530ad05d736041ed3a7fed199f8ee8d9382da6"}],"concept.aat.300019068":[{"id":"assertion.concept.aat.300019068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sri Lankan as defined in the captured Getty AAT record 300019068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sri Lankan as: Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","support":[{"end":667,"quote":"Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","source_id":"getty-aat.300019068","source_sha256":"920e59d2c8cdb75f8f90fd178abf4a02351fe55ddf946b3a8d500862c6942716","start":393}],"target_id":"concept.aat.300019068","target_kind":"node","target_sha256":"6421c11895835950b0bdedd5846f890b228addb62dfa71b687b1306401f3f702"}],"concept.aat.300019088":[{"id":"assertion.concept.aat.300019088","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burmese as defined in the captured Getty AAT record 300019088","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burmese as: Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","support":[{"end":766,"quote":"Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","source_id":"getty-aat.300019088","source_sha256":"a2824a109be5022ceb32d1b01299ab7c451a0d48b005942537cee66ea67e65b2","start":394}],"target_id":"concept.aat.300019088","target_kind":"node","target_sha256":"b7a61eb139f63d529961de4e73cdb71bfded04a1b5cc3ccc9fec9b674f988d21"}],"concept.aat.300019104":[{"id":"assertion.concept.aat.300019104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cambodian as defined in the captured Getty AAT record 300019104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cambodian as: Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","support":[{"end":764,"quote":"Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","source_id":"getty-aat.300019104","source_sha256":"7ab6b53b698a96c9e4cc73e9fbcb2007b6c054e2d4cb810cf3a122cc5f91c34f","start":396}],"target_id":"concept.aat.300019104","target_kind":"node","target_sha256":"ea84786f9598202d5d2b01796175114b32ae91cab3fbd3a5f87c14fd8682dad0"}],"concept.aat.300019255":[{"id":"assertion.concept.aat.300019255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Western World as defined in the captured Getty AAT record 300019255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Western World as: Refers to a style region encompassing the Mediterranean and the Occident.","support":[{"end":494,"quote":"Refers to a style region encompassing the Mediterranean and the Occident.","source_id":"getty-aat.300019255","source_sha256":"f17b7134905e97073c0eefb8fd01b1652e8b96b7c3de07d6261892429ca4fc2c","start":421}],"target_id":"concept.aat.300019255","target_kind":"node","target_sha256":"d39015f4985ea639a4fce4a6f46d267021040c2ff96af91a2655b0b6aa760605"}],"concept.aat.300019257":[{"id":"assertion.concept.aat.300019257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prehistoric as defined in the captured Getty AAT record 300019257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prehistoric as: Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","support":[{"end":630,"quote":"Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","source_id":"getty-aat.300019257","source_sha256":"b4618af89654884a5be327c89267fba40b271fc8a410abc9960c7a1ae90ca334","start":418}],"target_id":"concept.aat.300019257","target_kind":"node","target_sha256":"bfbf84883eca5565ddaa54c23eba12f2b771986664f0caa85025642794a766c5"}],"concept.aat.300019258":[{"id":"assertion.concept.aat.300019258","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Paleolithic as defined in the captured Getty AAT record 300019258","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Paleolithic as: Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves. Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","support":[{"end":954,"quote":"Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves.  Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","source_id":"getty-aat.300019258","source_sha256":"65b625c3c8690c2e016dfe675d2211455ffbb5f5d0cda2d9e07dd28f4f34f942","start":403}],"target_id":"concept.aat.300019258","target_kind":"node","target_sha256":"2e9414a1fb7c545f524812d6e0383160975dcdc5cfe8941d2a621f341f94ea64"}],"concept.aat.300019264":[{"id":"assertion.concept.aat.300019264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mesolithic as defined in the captured Getty AAT record 300019264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mesolithic as: Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","support":[{"end":1251,"quote":"Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","source_id":"getty-aat.300019264","source_sha256":"3ad1c696d6ca523999f23a2e55e113f9979b4c4ece36a76d1e2145772b63335d","start":402}],"target_id":"concept.aat.300019264","target_kind":"node","target_sha256":"bb9aa118a82c752d515df95e4551ae9e4867193dff171481736eba0ddacf447f"}],"concept.aat.300019267":[{"id":"assertion.concept.aat.300019267","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neolithic as defined in the captured Getty AAT record 300019267","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neolithic as: Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","support":[{"end":958,"quote":"Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","source_id":"getty-aat.300019267","source_sha256":"b6f5c9afc4b5e1587d9d87894a87419dcfc5152759c99122a4d9f8244c10e1e1","start":401}],"target_id":"concept.aat.300019267","target_kind":"node","target_sha256":"cb9b3cb007199b318bdea7fbedcac0d47fa678817a130d8939aa4a295eb5fa64"}],"concept.aat.300019273":[{"id":"assertion.concept.aat.300019273","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Chalcolithic as defined in the captured Getty AAT record 300019273","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Chalcolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","support":[{"end":1065,"quote":"Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","source_id":"getty-aat.300019273","source_sha256":"4407e6a125f19e0c680465fbce3ad38f07071c450671c0f91388cf02bcb88b3b","start":439}],"target_id":"concept.aat.300019273","target_kind":"node","target_sha256":"fc1665741ea944e833ffc6a23fa4d85c3a96642ab670b57b39273a36fc0ec6a9"}],"concept.aat.300019275":[{"id":"assertion.concept.aat.300019275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Bronze Age as defined in the captured Getty AAT record 300019275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","support":[{"end":1040,"quote":"Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons.  It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe.  There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","source_id":"getty-aat.300019275","source_sha256":"7bd5b1f9a9aef0029b37d0d6be705bf5eca26abb9d9a8fc93436ee93aaa95df7","start":435}],"target_id":"concept.aat.300019275","target_kind":"node","target_sha256":"749f7d35c5d27f9e0585710c847aecbbfeb7c4f3f1ef0f62398e7a01894d2e79"}],"concept.aat.300019276":[{"id":"assertion.concept.aat.300019276","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Bronze Age as defined in the captured Getty AAT record 300019276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Bronze Age as: Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","support":[{"end":937,"quote":"Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","source_id":"getty-aat.300019276","source_sha256":"83b3c510807642edf2d0d2717fc8fe0b13c9ee38d6f106074263a5decf343bd2","start":409}],"target_id":"concept.aat.300019276","target_kind":"node","target_sha256":"6b4a79ea0909a342d540f6d4a4280e88df077af48f97eeb6bf36f1d4543d833e"}],"concept.aat.300019277":[{"id":"assertion.concept.aat.300019277","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Bronze Age as defined in the captured Getty AAT record 300019277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Bronze Age as: Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","support":[{"end":809,"quote":"Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","source_id":"getty-aat.300019277","source_sha256":"cb338ba4bcb9074b765796b590edf2f1218b120e52a9fcc27554238aa869aa1c","start":410}],"target_id":"concept.aat.300019277","target_kind":"node","target_sha256":"89dd60b8757eedc2662683c6363d3bba61a8d997dd33ba00ea453fb711bbf61d"}],"concept.aat.300019278":[{"id":"assertion.concept.aat.300019278","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Bronze Age as defined in the captured Getty AAT record 300019278","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","support":[{"end":825,"quote":"Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","source_id":"getty-aat.300019278","source_sha256":"82afa15316ebf455f870f7119004b886717fe87acf6223b51a9a28a3ed8272fa","start":408}],"target_id":"concept.aat.300019278","target_kind":"node","target_sha256":"cfe9388dc5280e8e4cbf449f7cc54eab7012794aca13ef12137880f2c9096293"}],"concept.aat.300019279":[{"id":"assertion.concept.aat.300019279","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Iron Age as defined in the captured Getty AAT record 300019279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Iron Age as: Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements. It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","support":[{"end":1063,"quote":"Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836.  Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements.  It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","source_id":"getty-aat.300019279","source_sha256":"7bdec4edb2231203676846ee83849f4dfc339df9dbfbce910bab6376cb5de912","start":433}],"target_id":"concept.aat.300019279","target_kind":"node","target_sha256":"0bc353ee5f83c19fecb7df6c58d14ac8765b44dd2f115c3bc963252780cfd08e"}],"concept.aat.300019280":[{"id":"assertion.concept.aat.300019280","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protohistoric as defined in the captured Getty AAT record 300019280","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines protohistoric as: Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","support":[{"end":635,"quote":"Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","source_id":"getty-aat.300019280","source_sha256":"94bd2dc4aedd072a970b8ba5f1f3cb1a662e589a886994d2ba18f743569cd1ad","start":420}],"target_id":"concept.aat.300019280","target_kind":"node","target_sha256":"f5f34a441b39c12b43179948fa6301134c0ca58ef9b0648d372fa91c3f5979c3"}],"concept.aat.300020656":[{"id":"assertion.concept.aat.300020656","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"European as defined in the captured Getty AAT record 300020656","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines European as: Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","support":[{"end":662,"quote":"Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","source_id":"getty-aat.300020656","source_sha256":"e577f8791b759f0e97066f7fa4b5205c6fccaa24b38c4de965b8c0cbc3e68e8d","start":410}],"target_id":"concept.aat.300020656","target_kind":"node","target_sha256":"203e8d80c8892c543683a9048d6b82dd58a61fef4bf55a07cb8a681597364cea"}],"concept.aat.300021516":[{"id":"assertion.concept.aat.300021516","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Islamic World, The as defined in the captured Getty AAT record 300021516","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Islamic World, The as: Refers to a style region encompassing the regions where Islam is prevalent.","support":[{"end":495,"quote":"Refers to a style region encompassing the regions where Islam is prevalent.","source_id":"getty-aat.300021516","source_sha256":"8b9c114ca0527de5a476655257a328ba6f9624f0f8deb710380b701fa712f753","start":420}],"target_id":"concept.aat.300021516","target_kind":"node","target_sha256":"23768936c1ddc62fdb3c25f322738f3298b4f64286fae9fcd9557883fe1a55bf"}],"concept.aat.300021854":[{"id":"assertion.concept.aat.300021854","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic as defined in the captured Getty AAT record 300021854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic as: Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","support":[{"end":603,"quote":"Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","source_id":"getty-aat.300021854","source_sha256":"72a53a5b4b7766d25f22673f868a29f56aaa19a93c7315c1252c47bd1a835255","start":409}],"target_id":"concept.aat.300021854","target_kind":"node","target_sha256":"48b3f9287e6221ced013ddad42ce544c125ea7ecb063784d3f618b240e736bd2"}],"concept.aat.300021861":[{"id":"assertion.concept.aat.300021861","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Australian as defined in the captured Getty AAT record 300021861","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Australian as: Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","support":[{"end":656,"quote":"Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","source_id":"getty-aat.300021861","source_sha256":"35a31f72c3215e202ea1f93aeb1fbdd6f94fbf534b497c4e3b701e211266423c","start":421}],"target_id":"concept.aat.300021861","target_kind":"node","target_sha256":"62a9862b7186f059773dc00a1a19442df976cb584d3c8ffc29c5d4bf04a8921d"}],"concept.aat.300021867":[{"id":"assertion.concept.aat.300021867","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Melanesian as defined in the captured Getty AAT record 300021867","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Melanesian as: Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","support":[{"end":638,"quote":"Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","source_id":"getty-aat.300021867","source_sha256":"1a97d4c97de7a84d96916c7f153a03d2a4e8ac7c256ecd5484b62fc914894a8d","start":421}],"target_id":"concept.aat.300021867","target_kind":"node","target_sha256":"64a3565defef0e157bf156714c4ff5f2474e0ce5f06377a280778c0c23f7ca58"}],"concept.aat.300021944":[{"id":"assertion.concept.aat.300021944","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Polynesian as defined in the captured Getty AAT record 300021944","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Polynesian as: Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","support":[{"end":957,"quote":"Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","source_id":"getty-aat.300021944","source_sha256":"a8bd5d02a7b782b3458e33f13021329835c452c1fceac915140beaffb856df8c","start":421}],"target_id":"concept.aat.300021944","target_kind":"node","target_sha256":"90d41ae1f8aaebd09e221766dde4dc76e522586081ad0cf228c6e04e4227f660"}],"concept.aat.300022208":[{"id":"assertion.concept.aat.300022208","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Postmodern as defined in the captured Getty AAT record 300022208","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Postmodern as: Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","support":[{"end":1865,"quote":"Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","source_id":"getty-aat.300022208","source_sha256":"c562c803b5df56a666d68f999ca644c0e7d2b60afb1c0ffc77d64895d107ec19","start":460}],"target_id":"concept.aat.300022208","target_kind":"node","target_sha256":"5a6b1c613979bff3a2736efb085fb421abf1fb27f81a3d69497c37c529feae26"}],"concept.aat.300054140":[{"id":"assertion.concept.aat.300054140","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"performing arts (discipline) as defined in the captured Getty AAT record 300054140","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines performing arts (discipline) as: Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","support":[{"end":630,"quote":"Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","source_id":"getty-aat.300054140","source_sha256":"22181850b676388711e4e0c358d6ef943bf7a1bf2995d499171e6a7e98ec6e53","start":441}],"target_id":"concept.aat.300054140","target_kind":"node","target_sha256":"b5f31ed342620c214964ea83b2e1f54a1405fd6e292eec385b7ebc3ce1f187cb"}],"concept.aat.300054146":[{"id":"assertion.concept.aat.300054146","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"music (performing arts genre) as defined in the captured Getty AAT record 300054146","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music (performing arts genre) as: Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","support":[{"end":716,"quote":"Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","source_id":"getty-aat.300054146","source_sha256":"8f52b3cdc6872fdc932cd9b90d8077ca534bf09e5c9c0addc821f22685f06c10","start":467}],"target_id":"concept.aat.300054146","target_kind":"node","target_sha256":"86345d37dc813994a290cdd42baa3ad878f08aedc0851de9404717fb3e92ea01"}],"concept.aat.300054154":[{"id":"assertion.concept.aat.300054154","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"visual arts (discipline) as defined in the captured Getty AAT record 300054154","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines visual arts (discipline) as: Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","support":[{"end":722,"quote":"Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","source_id":"getty-aat.300054154","source_sha256":"6b8ef950980a6f9ee211d1fd435458423c45d70eccb971d2f20462356d14fc02","start":437}],"target_id":"concept.aat.300054154","target_kind":"node","target_sha256":"e5dbd3e4eba67839496d2b2c67a36b98674eef421155ad7a5314d97155288403"}],"concept.aat.300054156":[{"id":"assertion.concept.aat.300054156","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"architecture (discipline) as defined in the captured Getty AAT record 300054156","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architecture (discipline) as: The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations. For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","support":[{"end":753,"quote":"The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations.  For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","source_id":"getty-aat.300054156","source_sha256":"3130164c1916031a02a8e89cb685d4d6c0090d34c7d3a15fdba797407908b4a0","start":432}],"target_id":"concept.aat.300054156","target_kind":"node","target_sha256":"13f12ba2e43dec566cd879c50f4ac2a8295c6353a24b2711bb76c63191afe168"}],"concept.aat.300054159":[{"id":"assertion.concept.aat.300054159","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"naval architecture as defined in the captured Getty AAT record 300054159","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines naval architecture as: Art or science of designing and building ships and other waterborne craft.","support":[{"end":501,"quote":"Art or science of designing and building ships and other waterborne craft.","source_id":"getty-aat.300054159","source_sha256":"84e9c5006b2b13b25f7b7d74b00ddff86dcee107504fc1ff436b34a1737e7f03","start":427}],"target_id":"concept.aat.300054159","target_kind":"node","target_sha256":"1dfb6fdcca2acd926ab3aac4321b302446f69c13e61f085f5600666b4af21eba"}],"concept.aat.300054171":[{"id":"assertion.concept.aat.300054171","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"design (discipline) as defined in the captured Getty AAT record 300054171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines design (discipline) as: Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","support":[{"end":575,"quote":"Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","source_id":"getty-aat.300054171","source_sha256":"c76250c38c17f37eeb87cef16e0cae0af7f16ff1d02a3f351b0573075577f1e0","start":433}],"target_id":"concept.aat.300054171","target_kind":"node","target_sha256":"ee8a693c79ff8793d270974cc0949e7592a3175591980dfcdbc39d3e11991b0d"}],"concept.aat.300054181":[{"id":"assertion.concept.aat.300054181","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"graphic design as defined in the captured Getty AAT record 300054181","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","support":[{"end":732,"quote":"The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","source_id":"getty-aat.300054181","source_sha256":"759b697c8a8294e91d62b6c667a3a04b2e6178e93c2d7831f5336910a5dd7c33","start":417}],"target_id":"concept.aat.300054181","target_kind":"node","target_sha256":"6914920cbf19d4291c8b48a6978059f1f3955e3b9c1f890656f10a4a967a3bef"}],"concept.aat.300054183":[{"id":"assertion.concept.aat.300054183","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"industrial design as defined in the captured Getty AAT record 300054183","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines industrial design as: The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","support":[{"end":536,"quote":"The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","source_id":"getty-aat.300054183","source_sha256":"430024b8320a603eb7f8e0f106e0f4855bd45ef35ca8cb4d04102390f2f3156e","start":420}],"target_id":"concept.aat.300054183","target_kind":"node","target_sha256":"1d5a590b3d3600c9dbdcb7037020a6aba82abb3dbfae2c8a5b1f4df30b0708d5"}],"concept.aat.300054184":[{"id":"assertion.concept.aat.300054184","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"interior design as defined in the captured Getty AAT record 300054184","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines interior design as: Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","support":[{"end":1036,"quote":"Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","source_id":"getty-aat.300054184","source_sha256":"ca4720fe0751662f84360d4c01fee409be632fc3f4ee470e8af7ea4d730afc34","start":418}],"target_id":"concept.aat.300054184","target_kind":"node","target_sha256":"f9a943d873069ca8997f8a5aa5bb51226e0f112686d951f50db76098dc3fe32d"}],"concept.aat.300054232":[{"id":"assertion.concept.aat.300054232","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"arts-related disciplines as defined in the captured Getty AAT record 300054232","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arts-related disciplines as: Branches of learning devoted to the arts.","support":[{"end":465,"quote":"Branches of learning devoted to the arts.","source_id":"getty-aat.300054232","source_sha256":"62206abba6a80791c9aa0e1ca0c9783f3761d219250f2146a942183246da1163","start":424}],"target_id":"concept.aat.300054232","target_kind":"node","target_sha256":"81f9a40a8bc525b8ca461c87dffd3edcad0eeb9737a63beacfb6de87e09157bd"}],"concept.aat.300054236":[{"id":"assertion.concept.aat.300054236","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art therapy as defined in the captured Getty AAT record 300054236","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art therapy as: Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","support":[{"end":710,"quote":"Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","source_id":"getty-aat.300054236","source_sha256":"150b469b086a6a60c3cfdf8bb60f0c62e4bb9c0ff5adc82c1d6349cffe6a8d52","start":425}],"target_id":"concept.aat.300054236","target_kind":"node","target_sha256":"cc9b94b6e70fa023e8e625b695fe273e8d4560f8d00f4d4c06c0539a6eae96db"}],"concept.aat.300054269":[{"id":"assertion.concept.aat.300054269","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"syntax as defined in the captured Getty AAT record 300054269","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines syntax as: That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","support":[{"end":597,"quote":"That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","source_id":"getty-aat.300054269","source_sha256":"0ee25c3be069b7661846725ee526575f2767d38b891db45cd76d420a3fd0bc9e","start":409}],"target_id":"concept.aat.300054269","target_kind":"node","target_sha256":"a5e2dc011164a5f120cefaac4a572cfec60e5f8d51d9ea939725cd3f219497a5"}],"concept.aat.300054272":[{"id":"assertion.concept.aat.300054272","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"toponymy as defined in the captured Getty AAT record 300054272","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines toponymy as: Etymological study of the place-names of a region or language.","support":[{"end":470,"quote":"Etymological study of the place-names of a region or language.","source_id":"getty-aat.300054272","source_sha256":"b162efd0cad53a1a05247d23db3ba73349608157f1799ac91d2854c7d355868d","start":408}],"target_id":"concept.aat.300054272","target_kind":"node","target_sha256":"56cd2829bf52169de2ae0acbff801d40d6e21e0b312e4d156a01b645b0f77594"}],"concept.aat.300054274":[{"id":"assertion.concept.aat.300054274","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"comparative literature as defined in the captured Getty AAT record 300054274","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines comparative literature as: The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two literatures.","support":[{"end":609,"quote":"The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two  literatures.","source_id":"getty-aat.300054274","source_sha256":"9859334c59ad470462293a3cfdc2e68e0ab763c07eb450a2919a6f193003cbb9","start":408}],"target_id":"concept.aat.300054274","target_kind":"node","target_sha256":"68281aabd365af543ff9dc9304faeac2d911cc635590d83331d9ac720f645696"}],"concept.aat.300054299":[{"id":"assertion.concept.aat.300054299","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<religion and related disciplines> as defined in the captured Getty AAT record 300054299","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <religion and related disciplines> as: The discipline of religion and closely related disciplines.","support":[{"end":483,"quote":"The discipline of religion and closely related disciplines.","source_id":"getty-aat.300054299","source_sha256":"edfd4e5a8de4a30c69f608e7f6b30c676b846d102094f320f7553d547e74d2cb","start":424}],"target_id":"concept.aat.300054299","target_kind":"node","target_sha256":"5e025370f89df592158faf4308212bd1b79d405de9704c4d0d48b25251dd81bd"}],"concept.aat.300054300":[{"id":"assertion.concept.aat.300054300","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"religion (discipline) as defined in the captured Getty AAT record 300054300","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religion (discipline) as: Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","support":[{"end":544,"quote":"Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","source_id":"getty-aat.300054300","source_sha256":"d292170a9c59b95b6c7a6f2d6966ff55602fe4512ee1608709557b0258504d62","start":425}],"target_id":"concept.aat.300054300","target_kind":"node","target_sha256":"2f1c78d28493d67dcd41a79b9057989d159b0e429734d822642fa2a048a916f1"}],"concept.aat.300054302":[{"id":"assertion.concept.aat.300054302","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"comparative religion as defined in the captured Getty AAT record 300054302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines comparative religion as: Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","support":[{"end":914,"quote":"Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","source_id":"getty-aat.300054302","source_sha256":"c88154f11683615a6ded09714d2195dc61b2572035b0526c8fdc3d0b6dee871e","start":435}],"target_id":"concept.aat.300054302","target_kind":"node","target_sha256":"e749c6f2402284307e5df362385b4abb1e1d2d4758e72e7064406bc7ab154789"}],"concept.aat.300054303":[{"id":"assertion.concept.aat.300054303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophy of religion as defined in the captured Getty AAT record 300054303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophy of religion as: The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","support":[{"end":623,"quote":"The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","source_id":"getty-aat.300054303","source_sha256":"351aa7e94930bf1b69e4effe559357eacd232034515bf572bdad969cd86dfb31","start":437}],"target_id":"concept.aat.300054303","target_kind":"node","target_sha256":"49214031ddd2cf1336f0ef2503c9c1eb37e8a80c8a46f357167e164fc4da14f6"}],"concept.aat.300054304":[{"id":"assertion.concept.aat.300054304","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"psychology of religion as defined in the captured Getty AAT record 300054304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines psychology of religion as: Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","support":[{"end":577,"quote":"Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","source_id":"getty-aat.300054304","source_sha256":"5f7711f837f22bc21eb343b3cda96aad1babd6a91b08fa8f87153ac4268702e8","start":437}],"target_id":"concept.aat.300054304","target_kind":"node","target_sha256":"2240af14f16dea0338835011175e6fe36a6863ede10ef83b7cb3fd17bec7b576"}],"concept.aat.300054305":[{"id":"assertion.concept.aat.300054305","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sociology of religion as defined in the captured Getty AAT record 300054305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sociology of religion as: Study of religion using the sociological method of approach.","support":[{"end":496,"quote":"Study of religion using the sociological method of approach.","source_id":"getty-aat.300054305","source_sha256":"bd6c6326ec25c7b7857247f4b376f94825e31ed0cd082a830cf77b820d551ee8","start":436}],"target_id":"concept.aat.300054305","target_kind":"node","target_sha256":"a3536982b8c47d50be78be0c0cbb20b57f25368f441615971f6de4242f5a342e"}],"concept.aat.300054306":[{"id":"assertion.concept.aat.300054306","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religion-related disciplines as defined in the captured Getty AAT record 300054306","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religion-related disciplines as: Branches of learning devoted to religion.","support":[{"end":473,"quote":"Branches of learning devoted to religion.","source_id":"getty-aat.300054306","source_sha256":"22afde011e7ba258fce550711c6ee6cb091d8bcbce144ae998de8745bc03ab1b","start":432}],"target_id":"concept.aat.300054306","target_kind":"node","target_sha256":"f8a0e252047047464379bb011595e0f0837a68884f63f9d42b40fa1fa7576ac8"}],"concept.aat.300054672":[{"id":"assertion.concept.aat.300054672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museum administration as defined in the captured Getty AAT record 300054672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museum administration as: The study and practice of the administration of museums.","support":[{"end":456,"quote":"The study and practice of the administration of museums.","source_id":"getty-aat.300054672","source_sha256":"24fbb6c3a1b2d5f9a283afd7d3fdee34df2a90606b8e82c026485006bbe731c2","start":400}],"target_id":"concept.aat.300054672","target_kind":"node","target_sha256":"aed82efa38c90e4a0f84b41aa3a4b928cab4e42426641f9a76203cec6d77e208"}],"concept.aat.300055126":[{"id":"assertion.concept.aat.300055126","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"Associated Concepts as defined in the captured Getty AAT record 300055126","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Associated Concepts as: The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","support":[{"end":1184,"quote":"The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","source_id":"getty-aat.300055126","source_sha256":"c84931c6af9ce5b52587cc7c6361627b42e3c393317e85c7f465a3bdd6aee3e4","start":364}],"target_id":"concept.aat.300055126","target_kind":"node","target_sha256":"2cdcfc3203302300f3ea61aa35f26a0ac7e6b2b6c34b128d2268e47921b1b9c0"}],"concept.aat.300055156":[{"id":"assertion.concept.aat.300055156","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"empathy as defined in the captured Getty AAT record 300055156","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines empathy as: The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","support":[{"end":518,"quote":"The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","source_id":"getty-aat.300055156","source_sha256":"94f9778c7339e5dad271b48d3ae1a35eea7eb44ecbc5fb636817bd2ae7f448de","start":411}],"target_id":"concept.aat.300055156","target_kind":"node","target_sha256":"a74515d1db185dc2e6841cbe37746a76fb66f4f37919718b6ea9e96494175e6a"}],"concept.aat.300055826":[{"id":"assertion.concept.aat.300055826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mimesis as defined in the captured Getty AAT record 300055826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines mimesis as: Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","support":[{"end":508,"quote":"Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","source_id":"getty-aat.300055826","source_sha256":"78817aa0ea56d3eda46e5462beb177e309647b55909a9a2daed8d52ce95f9bfc","start":411}],"target_id":"concept.aat.300055826","target_kind":"node","target_sha256":"3d5bde483c123143992df4fa5702fcfb683cf368d34ae77d9670fe65613a32e4"}],"concept.aat.300055829":[{"id":"assertion.concept.aat.300055829","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Picturesque, the as defined in the captured Getty AAT record 300055829","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Picturesque, the as: Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","support":[{"end":774,"quote":"Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","source_id":"getty-aat.300055829","source_sha256":"9cbc360770154a3456868184d95c216ec9cb435bfa3831a8fd661f8bc3960467","start":420}],"target_id":"concept.aat.300055829","target_kind":"node","target_sha256":"2677a12b09d3b314a954d0e7616ec9c029e5eba7ef57aa63cd33a1758a0dbc2f"}],"concept.aat.300055837":[{"id":"assertion.concept.aat.300055837","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sublime, the as defined in the captured Getty AAT record 300055837","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sublime, the as: The conception or expression of awe-inspiring grandeur in a work of art.","support":[{"end":488,"quote":"The conception or expression of awe-inspiring grandeur in a work of art.","source_id":"getty-aat.300055837","source_sha256":"00520609536328669107fe08cdb0866f2d7c0d0caad6ab21224e69fa8ab8d345","start":416}],"target_id":"concept.aat.300055837","target_kind":"node","target_sha256":"4444bab1e82ab96371052d10b6ffa78ffc21c16b45db5c199ef9beec8a9c1db2"}],"concept.aat.300055845":[{"id":"assertion.concept.aat.300055845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ugliness as defined in the captured Getty AAT record 300055845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ugliness as: That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","support":[{"end":602,"quote":"That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","source_id":"getty-aat.300055845","source_sha256":"386e94963c0ea949f1096f1eb699be217b8791b64988af04f613b2da6a9d627b","start":412}],"target_id":"concept.aat.300055845","target_kind":"node","target_sha256":"19360cfb801d2942192c07fba00214ad639e4f0b34949238ce2cd3d2c56995da"}],"concept.aat.300055938":[{"id":"assertion.concept.aat.300055938","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophical concepts as defined in the captured Getty AAT record 300055938","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophical concepts as: Concepts related to knowledge, learning, and scholarship.","support":[{"end":439,"quote":"Concepts related to knowledge, learning, and scholarship.","source_id":"getty-aat.300055938","source_sha256":"952c76077fdd368972c603d530a9cbb4498e29d6d5d509444cb5cf9e0a1ecfb6","start":382}],"target_id":"concept.aat.300055938","target_kind":"node","target_sha256":"06aa6d2368d1e345a3f97d4ac9c5ce196571d92ae91a8ae3ee8941dac8bc011f"}],"concept.aat.300055939":[{"id":"assertion.concept.aat.300055939","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"ethics (philosophical concept) as defined in the captured Getty AAT record 300055939","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ethics (philosophical concept) as: System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","support":[{"end":723,"quote":"System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","source_id":"getty-aat.300055939","source_sha256":"ad3cc5efeeda438a497e3005f6b282040cb4a75af313b5083442f3faa4c779b1","start":414}],"target_id":"concept.aat.300055939","target_kind":"node","target_sha256":"e625ecd51ba32dafd7af421efcb6836cbc80d509793ec139c6332b68c69cb490"}],"concept.aat.300055945":[{"id":"assertion.concept.aat.300055945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metaphysical concepts as defined in the captured Getty AAT record 300055945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines metaphysical concepts as: Philosophical concepts that deal with the nature of reality.","support":[{"end":465,"quote":"Philosophical concepts that deal with the nature of reality.","source_id":"getty-aat.300055945","source_sha256":"d3b9a1e3676c13d8a146d18f1db45ad022db5eb830a733e115e5918af722a86f","start":405}],"target_id":"concept.aat.300055945","target_kind":"node","target_sha256":"9746b31f3d243c164be1f933d2e00e981206da8bd40fe78e5a73e594a48ca715"}],"concept.aat.300055946":[{"id":"assertion.concept.aat.300055946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dialectic as defined in the captured Getty AAT record 300055946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dialectic as: Originally in ancient Greece, a form of logical argumentation proceeding by question and answer. In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","support":[{"end":764,"quote":"Originally in ancient Greece, a form of logical argumentation proceeding by question and answer.  In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","source_id":"getty-aat.300055946","source_sha256":"076b25c310b23730c084f6940c3cc7c286623e40ee3d4c5ac469d3ec5e11ed5f","start":416}],"target_id":"concept.aat.300055946","target_kind":"node","target_sha256":"b3987d900ec9c4ecc7071e2f3a32ee614ab3cd764a798ff565d5dbc54de9ec41"}],"concept.aat.300055947":[{"id":"assertion.concept.aat.300055947","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"supernatural as defined in the captured Getty AAT record 300055947","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines supernatural as: Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","support":[{"end":648,"quote":"Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","source_id":"getty-aat.300055947","source_sha256":"bb20b25f557b2e88fc963bf17adaf70e7d0f5dc3770c4fe8e4ad72583f5b6b99","start":419}],"target_id":"concept.aat.300055947","target_kind":"node","target_sha256":"d09154f61a258a6cc8ee7b84f16d9fdfeb1f9d84318677248a45f7c80d8bc279"}],"concept.aat.300055956":[{"id":"assertion.concept.aat.300055956","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropomorphism as defined in the captured Getty AAT record 300055956","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropomorphism as: Interpretation of what is not human in terms of human characteristics.","support":[{"end":511,"quote":"Interpretation of what is not human in terms of human characteristics.","source_id":"getty-aat.300055956","source_sha256":"ae17710e6f761de1a3fe15de1bf376a413c5058d7922fec2d11ebf07185f3ac1","start":441}],"target_id":"concept.aat.300055956","target_kind":"node","target_sha256":"701667994cba467406c290e836ae160e32b012d58b49b976a77e83490aac0de1"}],"concept.aat.300055957":[{"id":"assertion.concept.aat.300055957","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Aristotelianism as defined in the captured Getty AAT record 300055957","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Aristotelianism as: Philosophy incorporating essential features of the thinking of Aristotle.","support":[{"end":513,"quote":"Philosophy incorporating essential features of the thinking of Aristotle.","source_id":"getty-aat.300055957","source_sha256":"b0185208f85eca1719cd2ee26107c9c738e5f371386cb4bab0a83009bfc7356a","start":440}],"target_id":"concept.aat.300055957","target_kind":"node","target_sha256":"9eb42aa6a801aa0725a11a34237e0de6c6c62a987960e15a73a37c4cbf4ac21d"}],"concept.aat.300055959":[{"id":"assertion.concept.aat.300055959","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"determinism as defined in the captured Getty AAT record 300055959","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines determinism as: Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","support":[{"end":971,"quote":"Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","source_id":"getty-aat.300055959","source_sha256":"7de5dbe73cd69a74d78e7774d3a1c8dd646e5e3f61472345563f5e0964adef01","start":436}],"target_id":"concept.aat.300055959","target_kind":"node","target_sha256":"c108af14c9dd155d678f0cf3ddfb3c4aed4c7dcff5a91dd9d7a6286df2d0f088"}],"concept.aat.300055963":[{"id":"assertion.concept.aat.300055963","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gnosticism as defined in the captured Getty AAT record 300055963","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gnosticism as: Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","support":[{"end":973,"quote":"Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","source_id":"getty-aat.300055963","source_sha256":"415d4dd5dd9220f696211fbfa9a8934a905c6e55a6bd8adddf5427a7f7178d6a","start":416}],"target_id":"concept.aat.300055963","target_kind":"node","target_sha256":"2cbf1088da3001b267ff09bff85ba2f00976eb1210924111c4922508a9769ebc"}],"concept.aat.300055966":[{"id":"assertion.concept.aat.300055966","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"individualism as defined in the captured Getty AAT record 300055966","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines individualism as: The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","support":[{"end":566,"quote":"The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","source_id":"getty-aat.300055966","source_sha256":"e8444a872dceefb37b5166a5818eabd0ca604972d7b8f2a7645520332bc1b011","start":438}],"target_id":"concept.aat.300055966","target_kind":"node","target_sha256":"fa453afe5b42ef7b4d1c0b2541ce6fd6e6ee71a8f6f7f70f615394160cbea82d"}],"concept.aat.300055969":[{"id":"assertion.concept.aat.300055969","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Platonism as defined in the captured Getty AAT record 300055969","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Platonism as: Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","support":[{"end":793,"quote":"Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","source_id":"getty-aat.300055969","source_sha256":"f6c9a33ad535aba1661543a416a7bbf02fad543271067e39647a712aa48bac73","start":434}],"target_id":"concept.aat.300055969","target_kind":"node","target_sha256":"7d2ccdb0acbf757b640be83a8e723ece79ce4984107538ad7af16abbed042247"}],"concept.aat.300055970":[{"id":"assertion.concept.aat.300055970","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neo-Platonism as defined in the captured Getty AAT record 300055970","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neo-Platonism as: Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","support":[{"end":1051,"quote":"Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","source_id":"getty-aat.300055970","source_sha256":"6685d57314ea721c4fd6f7f548027bb321c71ba7311657a5e3cb0ba8518ed4c8","start":429}],"target_id":"concept.aat.300055970","target_kind":"node","target_sha256":"5fd9226c475c17a50fa4094a07037b88ec97f21b47ac7771491fb4eeda45d905"}],"concept.aat.300055971":[{"id":"assertion.concept.aat.300055971","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"positivism as defined in the captured Getty AAT record 300055971","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines positivism as: The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","support":[{"end":614,"quote":"The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","source_id":"getty-aat.300055971","source_sha256":"a3ce6478679acf847f735e7db72cb2235fac182f32376bba66bb41e7df033dce","start":435}],"target_id":"concept.aat.300055971","target_kind":"node","target_sha256":"fca709044a64b1c810b92b7fcb52be40f64c0d3f6c1af52a24ec1ec25cd25611"}],"concept.aat.300055972":[{"id":"assertion.concept.aat.300055972","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pragmatism as defined in the captured Getty AAT record 300055972","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pragmatism as: Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","support":[{"end":874,"quote":"Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","source_id":"getty-aat.300055972","source_sha256":"85fca034f58d9444e504c2c8e7d05af71581ed5a4f9ca92dd415e744a58a5df7","start":435}],"target_id":"concept.aat.300055972","target_kind":"node","target_sha256":"bca858223d00a1b088d30d79d7c90bccce9855c36b96a534f1746f70c209f5b4"}],"concept.aat.300055974":[{"id":"assertion.concept.aat.300055974","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"scholasticism as defined in the captured Getty AAT record 300055974","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines scholasticism as: The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","support":[{"end":896,"quote":"The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","source_id":"getty-aat.300055974","source_sha256":"9b1a8203eb5e90339eed434372bfa345998eb6c06065aa89ca7e54ad8bc8e9b6","start":438}],"target_id":"concept.aat.300055974","target_kind":"node","target_sha256":"3c9529e3c50c708c9980ff3736a2149e6c623b8d13f2159b0bd9c2f9e616b399"}],"concept.aat.300055977":[{"id":"assertion.concept.aat.300055977","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stoicism as defined in the captured Getty AAT record 300055977","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines stoicism as: A philosophical movement that flourished in Greek and Roman antiquity. Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","support":[{"end":838,"quote":"A philosophical movement that flourished in Greek and Roman antiquity.  Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","source_id":"getty-aat.300055977","source_sha256":"6fe691164a06459e09279db6ae983958d5cf7df7d1adbf1197d4140d2c44287f","start":433}],"target_id":"concept.aat.300055977","target_kind":"node","target_sha256":"875ce36a4077d016a172cd45dd1823338fe5c7c549e2de40ec48e7c20ea41149"}],"concept.aat.300055978":[{"id":"assertion.concept.aat.300055978","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transcendentalism as defined in the captured Getty AAT record 300055978","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines transcendentalism as: A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","support":[{"end":941,"quote":"A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","source_id":"getty-aat.300055978","source_sha256":"08cf54bbc377ac55a1b07872e68b8a9f11bdc8a5e7ea9f40942ed21d381891ef","start":442}],"target_id":"concept.aat.300055978","target_kind":"node","target_sha256":"83c960efdba3142c0887bb8240f6f134dea78d241b6aeb18e678e2f63cd4c93b"}],"concept.aat.300055979":[{"id":"assertion.concept.aat.300055979","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"utilitarianism as defined in the captured Getty AAT record 300055979","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines utilitarianism as: Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","support":[{"end":585,"quote":"Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","source_id":"getty-aat.300055979","source_sha256":"080b66a58a7b2793fbeccb8e135bd44f39a3a9f171c41ee92b3113ce96cf7411","start":439}],"target_id":"concept.aat.300055979","target_kind":"node","target_sha256":"27b8ad5cef48adf4b04647c740cf5562ae80cec26c98f58f59da980736e374b3"}],"concept.aat.300055980":[{"id":"assertion.concept.aat.300055980","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<religions and religious concepts> as defined in the captured Getty AAT record 300055980","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <religions and religious concepts> as: Religions and concepts related to religions.","support":[{"end":441,"quote":"Religions and concepts related to religions.","source_id":"getty-aat.300055980","source_sha256":"dbc083a1c116051884da57421c75bf22c7b0ef3ff7cdd6b66fb8671673c4e179","start":397}],"target_id":"concept.aat.300055980","target_kind":"node","target_sha256":"dac6d8a665eca444f451f8759583f1ba3708bb3cf8f5c308287a262d28a08785"}],"concept.aat.300055982":[{"id":"assertion.concept.aat.300055982","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"faith as defined in the captured Getty AAT record 300055982","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines faith as: Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","support":[{"end":525,"quote":"Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","source_id":"getty-aat.300055982","source_sha256":"d6300107b01f71a672b213dadf24776a75b9fa4896e326b4a80474964bc6c3e7","start":409}],"target_id":"concept.aat.300055982","target_kind":"node","target_sha256":"3821dab07ec78a15c92a6cc1b513a42d3891b7687532347ac80ed62167d86e39"}],"concept.aat.300055983":[{"id":"assertion.concept.aat.300055983","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"liturgy as defined in the captured Getty AAT record 300055983","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines liturgy as: Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","support":[{"end":718,"quote":"Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","source_id":"getty-aat.300055983","source_sha256":"07a518025b8e5ac125e6a8416b2ecfa395f278e3bba89ad0f93e37aed0a4ccfc","start":400}],"target_id":"concept.aat.300055983","target_kind":"node","target_sha256":"02fdfa5c755851bbe093736ac407dcf752375a41f233f46f14f4df190d8f7cf6"}],"concept.aat.300055988":[{"id":"assertion.concept.aat.300055988","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Adoptionism as defined in the captured Getty AAT record 300055988","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Adoptionism as: Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","support":[{"end":521,"quote":"Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","source_id":"getty-aat.300055988","source_sha256":"ea81d1750f36647920edf724b2e7fad6d06559c66adb00512bfe2071dc68e3a8","start":417}],"target_id":"concept.aat.300055988","target_kind":"node","target_sha256":"b427aa621a594f0a6587c8f57ee8c6c02339bae2d2f25797ebce6cf5ae29114a"}],"concept.aat.300055989":[{"id":"assertion.concept.aat.300055989","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"agnosticism as defined in the captured Getty AAT record 300055989","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines agnosticism as: Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","support":[{"end":576,"quote":"Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","source_id":"getty-aat.300055989","source_sha256":"ca0c8970de8ba41bad279e8e182193bad1162ba3016552d9b40b9d98056b2298","start":417}],"target_id":"concept.aat.300055989","target_kind":"node","target_sha256":"6e673d07f62a620d21869c0b75a30ad290e0d0b02d08edcf77904c4372323e1c"}],"concept.aat.300055990":[{"id":"assertion.concept.aat.300055990","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"atheism as defined in the captured Getty AAT record 300055990","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines atheism as: Doctrine that there is neither God nor any other deity.","support":[{"end":468,"quote":"Doctrine that there is neither God nor any other deity.","source_id":"getty-aat.300055990","source_sha256":"2311062180555f8ddc6896dbb9f6898e47b2de1b61fe24cb7a490e0adb1c1dee","start":413}],"target_id":"concept.aat.300055990","target_kind":"node","target_sha256":"26128684c84f5ec877317ac21a343fc351f98dfd544bdf9614396431879307c7"}],"concept.aat.300055991":[{"id":"assertion.concept.aat.300055991","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monasticism as defined in the captured Getty AAT record 300055991","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monasticism as: A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","support":[{"end":1247,"quote":"A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","source_id":"getty-aat.300055991","source_sha256":"1158aad52deb37cfd08a681f742aa2d3f030b5294c3c01e528118cb90ce3d649","start":427}],"target_id":"concept.aat.300055991","target_kind":"node","target_sha256":"6d21a3689cccc77ac1d3ff6de71533db66f72da2306ac89460645c77e0569871"}],"concept.aat.300055992":[{"id":"assertion.concept.aat.300055992","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monotheism as defined in the captured Getty AAT record 300055992","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monotheism as: The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","support":[{"end":839,"quote":"The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","source_id":"getty-aat.300055992","source_sha256":"8c944215e1cbda38cf26bea8a730dbce663d9801c3be12d06f13032b6b69cf92","start":416}],"target_id":"concept.aat.300055992","target_kind":"node","target_sha256":"7c4a2244f07c7f03150ffbd28fd91fd6ba749e86e96d0f023bd83174710703fc"}],"concept.aat.300055993":[{"id":"assertion.concept.aat.300055993","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paganism as defined in the captured Getty AAT record 300055993","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paganism as: Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","support":[{"end":693,"quote":"Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","source_id":"getty-aat.300055993","source_sha256":"1ec6b97505c505cd31e3ed179fad893fcef4bf8cc898aa835d2fde85f8667151","start":414}],"target_id":"concept.aat.300055993","target_kind":"node","target_sha256":"174981c140c12f4fb2fc67ea3c013eaee81dc9878a0f530b893f1f0cf99d741b"}],"concept.aat.300055995":[{"id":"assertion.concept.aat.300055995","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pantheism as defined in the captured Getty AAT record 300055995","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pantheism as: Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","support":[{"end":648,"quote":"Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","source_id":"getty-aat.300055995","source_sha256":"f575a4729578aaad3506b366427a5d17fc672f03b173b37b61ad1d1cf8931d94","start":415}],"target_id":"concept.aat.300055995","target_kind":"node","target_sha256":"596b234d3a5627e396daeb461c28c95d0fb7998c9b4123cfded00233eabd3b8e"}],"concept.aat.300055996":[{"id":"assertion.concept.aat.300055996","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pietism as defined in the captured Getty AAT record 300055996","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pietism as: A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","support":[{"end":749,"quote":"A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","source_id":"getty-aat.300055996","source_sha256":"26739972eace93125497babf8140e9ad2f3e18d5860af7700fb0452a9d4ce7a9","start":413}],"target_id":"concept.aat.300055996","target_kind":"node","target_sha256":"d4d0c13fa5b935a6f0e63b7e8d205f6c4ef06d432606f29d4e5f1ac4ec9a77ff"}],"concept.aat.300055997":[{"id":"assertion.concept.aat.300055997","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"polytheism as defined in the captured Getty AAT record 300055997","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines polytheism as: The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","support":[{"end":595,"quote":"The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","source_id":"getty-aat.300055997","source_sha256":"ddb4e545deac29e8860dc2ac3434faff4aea37880fb5037b39d2bdb7ef398e2c","start":416}],"target_id":"concept.aat.300055997","target_kind":"node","target_sha256":"b21ac6c05641ee6ae1b6762b94237ac2caeb639e49d22d2ab3221b0930636780"}],"concept.aat.300055998":[{"id":"assertion.concept.aat.300055998","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"quietism as defined in the captured Getty AAT record 300055998","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines quietism as: Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","support":[{"end":768,"quote":"Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","source_id":"getty-aat.300055998","source_sha256":"27efea7e9c97b518d69f5030967bdb0ffbd2cca061cdfeb3d40d87fbe3c153f6","start":414}],"target_id":"concept.aat.300055998","target_kind":"node","target_sha256":"ba464d7c62da2a56938f66cd146d629c45a013840f5faa5261d257ead63bec78"}],"concept.aat.300055999":[{"id":"assertion.concept.aat.300055999","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"shamanism as defined in the captured Getty AAT record 300055999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines shamanism as: Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","support":[{"end":839,"quote":"Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","source_id":"getty-aat.300055999","source_sha256":"8df7fe96a7ffd957b4555c4d237b8afc7a49a7eb5184de96729c72843fe83295","start":415}],"target_id":"concept.aat.300055999","target_kind":"node","target_sha256":"ee7bf6240a3486fad4748ba33a71ed732e59383d1a5506ccea0fa2d124540906"}],"concept.aat.300056000":[{"id":"assertion.concept.aat.300056000","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theosophy as defined in the captured Getty AAT record 300056000","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theosophy as: Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","support":[{"end":589,"quote":"Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","source_id":"getty-aat.300056000","source_sha256":"cfdbad698001ece520479bc2d61ae2023ad37bb8543eb7a8f42305f24042c4ef","start":415}],"target_id":"concept.aat.300056000","target_kind":"node","target_sha256":"257e3115bb567cf093a4d99f96cc9abc56215941da816ad186d9f70eb0cbb4c7"}],"concept.aat.300056002":[{"id":"assertion.concept.aat.300056002","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"totemism as defined in the captured Getty AAT record 300056002","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines totemism as: Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","support":[{"end":648,"quote":"Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","source_id":"getty-aat.300056002","source_sha256":"290e315f2457083a245350cc350f3199b1ff2f50e2270bd41eae851f41df1723","start":414}],"target_id":"concept.aat.300056002","target_kind":"node","target_sha256":"ce8dbcc9b3894070c19c38928733c18e7bb4810dedb2f3768009d0ced509dbd4"}],"concept.aat.300056003":[{"id":"assertion.concept.aat.300056003","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"salvation as defined in the captured Getty AAT record 300056003","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines salvation as: The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","support":[{"end":780,"quote":"The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","source_id":"getty-aat.300056003","source_sha256":"1d3c1351ca12852518d4c37d058d3a80ec7d98a2a0ed9c50136a6199a091291d","start":413}],"target_id":"concept.aat.300056003","target_kind":"node","target_sha256":"8a58d954138f3594a6ae93fe67abb7644d00983ec1a6564fb62bd81b44673a5f"}],"concept.aat.300056004":[{"id":"assertion.concept.aat.300056004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theophany as defined in the captured Getty AAT record 300056004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theophany as: The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","support":[{"end":506,"quote":"The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","source_id":"getty-aat.300056004","source_sha256":"5db648ce07ac681b763766d85ae8e12e79b247bca97724a407cef7bf3ae94708","start":413}],"target_id":"concept.aat.300056004","target_kind":"node","target_sha256":"a690e5293ba36a4654aaa07c1f79f8cc7a55c6e42f0be7a3311b95729011c7ed"}],"concept.aat.300056005":[{"id":"assertion.concept.aat.300056005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"worship as defined in the captured Getty AAT record 300056005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines worship as: The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","support":[{"end":570,"quote":"The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","source_id":"getty-aat.300056005","source_sha256":"dd51555ba731cf7697172c547c0c4e08623dbb72910c872b6e90661eb596165d","start":423}],"target_id":"concept.aat.300056005","target_kind":"node","target_sha256":"e5a7ff3bf57114c9e49588b565e8a27e185d260df2948241481b4d0ed0c928ee"}],"concept.aat.300056180":[{"id":"assertion.concept.aat.300056180","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"grandeur as defined in the captured Getty AAT record 300056180","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines grandeur as: The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","support":[{"end":511,"quote":"The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","source_id":"getty-aat.300056180","source_sha256":"8ae12e18760daa5ca9cfa28ac0c510db3b9eef01295e8d1387eb3df541bb49e3","start":412}],"target_id":"concept.aat.300056180","target_kind":"node","target_sha256":"7673f7aec1423bb2e0d0904fffd6abd7b059c53b4976159988c26208dbeb518f"}],"concept.aat.300056183":[{"id":"assertion.concept.aat.300056183","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"significant form as defined in the captured Getty AAT record 300056183","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines significant form as: Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","support":[{"end":553,"quote":"Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","source_id":"getty-aat.300056183","source_sha256":"cd985b656b4bfe3c9745d18e5eaad178bc1061df38245cf5f98c75b8fcdf484c","start":420}],"target_id":"concept.aat.300056183","target_kind":"node","target_sha256":"8095df1d71c941dbf04a45be420eb361a29a6b7383280eef82f8822b28d87b03"}],"concept.aat.300056261":[{"id":"assertion.concept.aat.300056261","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dualism as defined in the captured Getty AAT record 300056261","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dualism as: Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","support":[{"end":549,"quote":"Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","source_id":"getty-aat.300056261","source_sha256":"5e169da60851e8f8e376f9159f32de7baa39d9d4687d3c3af336bb0354233dd9","start":432}],"target_id":"concept.aat.300056261","target_kind":"node","target_sha256":"f04cd397af0dca4fca30acc43e3fd62b263eff3f4281a69f07e1a4f874783c60"}],"concept.aat.300060368":[{"id":"assertion.concept.aat.300060368","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"syncretism as defined in the captured Getty AAT record 300060368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","support":[{"end":525,"quote":"Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","source_id":"getty-aat.300060368","source_sha256":"3456e3e702ab2fc8812eee67e58054f845bc7d6ce846616a47c3da297a1e7fae","start":435}],"target_id":"concept.aat.300060368","target_kind":"node","target_sha256":"d88fc0c92b2731cef268f13c141bae80074ac803c25ba4e58a7ba4864c9d7ed6"}],"concept.aat.300065709":[{"id":"assertion.concept.aat.300065709","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stigmatization as defined in the captured Getty AAT record 300065709","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines stigmatization as: The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","support":[{"end":640,"quote":"The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","source_id":"getty-aat.300065709","source_sha256":"2c3c95256a32cf1a1f80da3d553af543d9a1509924455429aa77b32c9471cbcf","start":428}],"target_id":"concept.aat.300065709","target_kind":"node","target_sha256":"73c1aea6f9c4d44cd30d2ca04a3a2e12525b405207817fbaaba3467c9d67d62a"}],"concept.aat.300065758":[{"id":"assertion.concept.aat.300065758","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Minimal as defined in the captured Getty AAT record 300065758","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Minimal as: A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","support":[{"end":1201,"quote":"A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","source_id":"getty-aat.300065758","source_sha256":"853114fcf852df339228c5216a0bdf0dbaf30ce46908056a7f664a547e7eb02b","start":457}],"target_id":"concept.aat.300065758","target_kind":"node","target_sha256":"47dc51a4a432805b1fe7571bcb576cdfea25dbade2510b492c39908dc708f06a"}],"concept.aat.300066049":[{"id":"assertion.concept.aat.300066049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immaculate conception as defined in the captured Getty AAT record 300066049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines immaculate conception as: The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","support":[{"end":736,"quote":"The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","source_id":"getty-aat.300066049","source_sha256":"4f7b6626727d5b27c131ea67e93720128e557c40000b23a3c89e9e04489996ec","start":435}],"target_id":"concept.aat.300066049","target_kind":"node","target_sha256":"ea8255508b075a0d9dd08456354d7ce286c0fcfebde71780b44474a1af579125"}],"concept.aat.300067974":[{"id":"assertion.concept.aat.300067974","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"millenarianism as defined in the captured Getty AAT record 300067974","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines millenarianism as: Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","support":[{"end":1076,"quote":"Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","source_id":"getty-aat.300067974","source_sha256":"668c91d4513fb6ee53c8acde2874ab7624459ad410588bbe25f5dbc31b0a0627","start":420}],"target_id":"concept.aat.300067974","target_kind":"node","target_sha256":"fad4955e26cb1148ee7a548472b65e384c339a81087d6c17b6972f2be7453c76"}],"concept.aat.300068765":[{"id":"assertion.concept.aat.300068765","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"truth as defined in the captured Getty AAT record 300068765","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines truth as: A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","support":[{"end":509,"quote":"A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","source_id":"getty-aat.300068765","source_sha256":"e7a74ce2420b4ec9c1ce89f0cd24c05cb6a98a358400077033073da13729fac1","start":389}],"target_id":"concept.aat.300068765","target_kind":"node","target_sha256":"09e358bb1f4380778d4da503e5bc35a324824536a465725f07e28716c193aea2"}],"concept.aat.300069306":[{"id":"assertion.concept.aat.300069306","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ideal, the as defined in the captured Getty AAT record 300069306","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","support":[{"end":987,"quote":"The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","source_id":"getty-aat.300069306","source_sha256":"30ef8a6969a32a4a1a23055ee251111d7121692ece8db25c3099f8865e94c1f8","start":414}],"target_id":"concept.aat.300069306","target_kind":"node","target_sha256":"2ad509faabd3f60681fb4ca84f3201f790c67bf074de70666b2376e05a51650d"}],"concept.aat.300069390":[{"id":"assertion.concept.aat.300069390","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"participatory design as defined in the captured Getty AAT record 300069390","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines participatory design as: Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","support":[{"end":544,"quote":"Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","source_id":"getty-aat.300069390","source_sha256":"9737c84854f3457cb09f741f57418e186f426d9c9afce91da417659c34155aa2","start":423}],"target_id":"concept.aat.300069390","target_kind":"node","target_sha256":"d0285a4c7f6120a8ccffdbfe53ffb943a3cb683be0e549cc58151d6d5f6b8b4b"}],"concept.aat.300070431":[{"id":"assertion.concept.aat.300070431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nihilism as defined in the captured Getty AAT record 300070431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nihilism as: Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","support":[{"end":529,"quote":"Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","source_id":"getty-aat.300070431","source_sha256":"bda57d9c53941f893f0917361962a9d5948611a4ff490b8ab3db6625599c5ace","start":433}],"target_id":"concept.aat.300070431","target_kind":"node","target_sha256":"604b3edce178cd14206f8e75418a81b470c424d4f1862af7301218a2cc98d8e6"}],"concept.aat.300070544":[{"id":"assertion.concept.aat.300070544","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nominalism as defined in the captured Getty AAT record 300070544","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nominalism as: Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","support":[{"end":648,"quote":"Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","source_id":"getty-aat.300070544","source_sha256":"7b3fe3d6c5f878df999b8bd08aca26d77399f1402b37a691d7a21c5deef22858","start":435}],"target_id":"concept.aat.300070544","target_kind":"node","target_sha256":"896cd1fae35c2d385a6c1045358cf3d9ffb1a44d9e0c193f2bca64d19839040f"}],"concept.aat.300072604":[{"id":"assertion.concept.aat.300072604","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"animism as defined in the captured Getty AAT record 300072604","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines animism as: Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","support":[{"end":720,"quote":"Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","source_id":"getty-aat.300072604","source_sha256":"8ff9252b204ada66643c1ec090c0e100e9cd8f858a274d77f211173a84be6cc4","start":413}],"target_id":"concept.aat.300072604","target_kind":"node","target_sha256":"b5c3ac8fe8e36f7aa3d2ffd0c85b1756ec81ebeb5ed41d8a4ef450d928d472a5"}],"concept.aat.300073437":[{"id":"assertion.concept.aat.300073437","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reincarnation as defined in the captured Getty AAT record 300073437","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines reincarnation as: The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","support":[{"end":713,"quote":"The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","source_id":"getty-aat.300073437","source_sha256":"bf0f902bdbdce5e7678e82df2db15a4ffe8e4bb8f30e0def797f1e6ee42bd7dc","start":417}],"target_id":"concept.aat.300073437","target_kind":"node","target_sha256":"553120b8ba6893e06ac65c6b797ce5dec04b985f3b756185465f39eeb59973e0"}],"concept.aat.300080819":[{"id":"assertion.concept.aat.300080819","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Latin American as defined in the captured Getty AAT record 300080819","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Latin American as: In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","support":[{"end":745,"quote":"In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","source_id":"getty-aat.300080819","source_sha256":"572df0112d0c68532f5df017a4c9a0c4dc2ccbebc165948da58023faee65ff96","start":430}],"target_id":"concept.aat.300080819","target_kind":"node","target_sha256":"c790ac8e6d8339628781195cb2052155eae959ad150b7edcfe9379dc0263fb65"}],"concept.aat.300106711":[{"id":"assertion.concept.aat.300106711","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ancient as defined in the captured Getty AAT record 300106711","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ancient as: In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","support":[{"end":699,"quote":"In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","source_id":"getty-aat.300106711","source_sha256":"0f511be0d8601bdfdeb0f947e3c6ae20b62fe1e3287bb9bc23737b5881343510","start":414}],"target_id":"concept.aat.300106711","target_kind":"node","target_sha256":"7ec2e782f2796e5b6425110cfc36d2dbcb8374c597a80f3ba43cb1d69a0a9b04"}],"concept.aat.300106723":[{"id":"assertion.concept.aat.300106723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"three-age system as defined in the captured Getty AAT record 300106723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines three-age system as: Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","support":[{"end":517,"quote":"Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","source_id":"getty-aat.300106723","source_sha256":"bd4dade8db4d9e7381cefb183d2475531555269d9c91a256ed0f17bfd5827830","start":423}],"target_id":"concept.aat.300106723","target_kind":"node","target_sha256":"56e151c0b62117f93181146ca56f5a90fa9778822437e02ff6c14fdd4493d9a7"}],"concept.aat.300106724":[{"id":"assertion.concept.aat.300106724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Stone Age as defined in the captured Getty AAT record 300106724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Stone Age as: Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","support":[{"end":1012,"quote":"Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","source_id":"getty-aat.300106724","source_sha256":"6f5ecb90af2016e3220f9ddb9b827b9dc4ca2fd890ddfe17ad88bcde65c0eb64","start":434}],"target_id":"concept.aat.300106724","target_kind":"node","target_sha256":"b54063e9a9b5aafa7e16a9113604abebdcbc29c44ff26be914b971b0f2eae020"}],"concept.aat.300106738":[{"id":"assertion.concept.aat.300106738","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Iron Age as defined in the captured Getty AAT record 300106738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Iron Age as: Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","support":[{"end":622,"quote":"Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","source_id":"getty-aat.300106738","source_sha256":"36ff78ba56c22a5e5d63482e81a02282e6dada83320f73f87417995fd37808f2","start":405}],"target_id":"concept.aat.300106738","target_kind":"node","target_sha256":"e8c5cf95dbd6bc38369d3e6f0ad86c33a7394f7ff60e66eadce79f28bdb5bfd4"}],"concept.aat.300106739":[{"id":"assertion.concept.aat.300106739","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Iron Age as defined in the captured Getty AAT record 300106739","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Iron Age as: Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","support":[{"end":528,"quote":"Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","source_id":"getty-aat.300106739","source_sha256":"b487d6d0347f8364b8147183587e2fe7cab7b4ed749bf7ddce0472e1e8469131","start":406}],"target_id":"concept.aat.300106739","target_kind":"node","target_sha256":"2d741d5f2ac0a7bb2defcbf38205cf2b433d76ac08380995e4a49b1e68d81f64"}],"concept.aat.300106745":[{"id":"assertion.concept.aat.300106745","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Iron Age as defined in the captured Getty AAT record 300106745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Iron Age as: Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","support":[{"end":545,"quote":"Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","source_id":"getty-aat.300106745","source_sha256":"7ccc46712d2078099e929785a2e95c16094a6267d59ce331afd5567e81a2058c","start":404}],"target_id":"concept.aat.300106745","target_kind":"node","target_sha256":"35ee47971d9bc75a7f22c09e26d3ce7d7f81564e38bd76dfde7ffbb76e4d2820"}],"concept.aat.300106747":[{"id":"assertion.concept.aat.300106747","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transitional periods Stone Age to Bronze Age as defined in the captured Getty AAT record 300106747","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines transitional periods Stone Age to Bronze Age as: Transitional periods related to Stone Age to Bronze Age cultures.","support":[{"end":534,"quote":"Transitional periods related to Stone Age to Bronze Age cultures.","source_id":"getty-aat.300106747","source_sha256":"18f9c308d3a1e5d369e02f737ec0041fc37b451792d5dec259e6078494a2c819","start":469}],"target_id":"concept.aat.300106747","target_kind":"node","target_sha256":"123762a21e42138926142d565f3bf314ccf7ea993baa5e2dbf805e7efc783629"}],"concept.aat.300106757":[{"id":"assertion.concept.aat.300106757","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eneolithic as defined in the captured Getty AAT record 300106757","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eneolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","support":[{"end":1012,"quote":"Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","source_id":"getty-aat.300106757","source_sha256":"6f1a8ca7e5c1924db92b81c6e2a3aaa92abb5df4aa06e7c67150faa4685a4d74","start":437}],"target_id":"concept.aat.300106757","target_kind":"node","target_sha256":"4eead10379e703efbe4aeaf004a73d978dad77861fee15cf8e702ce1d7ea3c96"}],"concept.aat.300106759":[{"id":"assertion.concept.aat.300106759","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Final Neolithic as defined in the captured Getty AAT record 300106759","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Final Neolithic as: Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","support":[{"end":701,"quote":"Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","source_id":"getty-aat.300106759","source_sha256":"67584712b9848a5c9ea4c98a357a71c90fc4bd658691c6851c2357ea59e30d51","start":442}],"target_id":"concept.aat.300106759","target_kind":"node","target_sha256":"1c2a17353bb956a0b14b5292dc938572a9ec90e434000ba10b952989f24c1066"}],"concept.aat.300107946":[{"id":"assertion.concept.aat.300107946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"American regions as defined in the captured Getty AAT record 300107946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines American regions as: Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","support":[{"end":574,"quote":"Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","source_id":"getty-aat.300107946","source_sha256":"4e50934309a52095f34c78a273339286620dc8343ca04ed5e20e95cc7d225aa2","start":432}],"target_id":"concept.aat.300107946","target_kind":"node","target_sha256":"d14a34924e858de197e456ac58e9b97e221a04c9227d993a0b2107a2b3d2938e"}],"concept.aat.300108565":[{"id":"assertion.concept.aat.300108565","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Colonial African as defined in the captured Getty AAT record 300108565","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Colonial African as: Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","support":[{"end":551,"quote":"Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","source_id":"getty-aat.300108565","source_sha256":"d0f4a44d1e6d4d2ee25e4c26c77092448a8033796515ab179c9504bc447d830b","start":459}],"target_id":"concept.aat.300108565","target_kind":"node","target_sha256":"5c5def0fbb0794e592de47ec50014c3c95e163e59494326da19e9d02c02a6042"}],"concept.aat.300108572":[{"id":"assertion.concept.aat.300108572","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"African sculpture styles as defined in the captured Getty AAT record 300108572","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African sculpture styles as: Sculpture styles belonging to African cultures.","support":[{"end":514,"quote":"Sculpture styles belonging to African cultures.","source_id":"getty-aat.300108572","source_sha256":"b0e82c7abe1294a51f6cef9aedbfa7378465cff6c88666e4366b829d808d0e85","start":467}],"target_id":"concept.aat.300108572","target_kind":"node","target_sha256":"0b49e343d88f2d705e5c6876cb9eea260a4ed37ed91a130e4ac9524d1a49015d"}],"concept.aat.300111149":[{"id":"assertion.concept.aat.300111149","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"European regions as defined in the captured Getty AAT record 300111149","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines European regions as: Used to describe styles of the regions of Europe.","support":[{"end":477,"quote":"Used to describe styles of the regions of Europe.","source_id":"getty-aat.300111149","source_sha256":"5b735d50197cffa3fe8c38ac31d6e57f5b75ada68f632ac8774a7f085cf31960","start":428}],"target_id":"concept.aat.300111149","target_kind":"node","target_sha256":"ff503c8c6b97c758d6f2d8c5d6db26f3b4b01ce5b1be4b587032f82ecd3f9a5b"}],"concept.aat.300111241":[{"id":"assertion.concept.aat.300111241","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Saracenic as defined in the captured Getty AAT record 300111241","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Saracenic as: Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","support":[{"end":941,"quote":"Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","source_id":"getty-aat.300111241","source_sha256":"b9f730d3803b08618e38f69e891996dd77d34a5768f41f65ae64b4208b103de3","start":431}],"target_id":"concept.aat.300111241","target_kind":"node","target_sha256":"5d5f26f3209cd0165f47a87eae70f64993bf8020a4430fc9bcfc881b668a0d46"}],"concept.aat.300113090":[{"id":"assertion.concept.aat.300113090","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tashtyk as defined in the captured Getty AAT record 300113090","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tashtyk as: Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","support":[{"end":704,"quote":"Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","source_id":"getty-aat.300113090","source_sha256":"5e725c70521cdd803ff22db943fea5ab47ab3d623cc22c967786459c4380ce3f","start":406}],"target_id":"concept.aat.300113090","target_kind":"node","target_sha256":"a0225d9c5ef1f8756bf8e8098c729889e7268cfa10942cc55c8497d058ec2013"}],"concept.aat.300116922":[{"id":"assertion.concept.aat.300116922","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Siberian Arctic Native styles as defined in the captured Getty AAT record 300116922","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Siberian Arctic Native styles as: Styles belonging to Siberian Arctic Native cultures.","support":[{"end":480,"quote":"Styles belonging to Siberian Arctic Native cultures.","source_id":"getty-aat.300116922","source_sha256":"1d0942d4a55e7730e98a8ff7b997f6036a5b62431c72cd5ebd361cf0a252ac18","start":428}],"target_id":"concept.aat.300116922","target_kind":"node","target_sha256":"b7f895af5856a8ff69f83ed5baed5ff3fd7371c3edd020ceec6817f8e2f60479"}],"concept.aat.300120146":[{"id":"assertion.concept.aat.300120146","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Southeast Asian as defined in the captured Getty AAT record 300120146","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Southeast Asian as: Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","support":[{"end":1373,"quote":"Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","source_id":"getty-aat.300120146","source_sha256":"3f4f67222cd32f43e70c83bb80a2b99272fa9d3aceeb495f0e2ec4392a72ebbe","start":424}],"target_id":"concept.aat.300120146","target_kind":"node","target_sha256":"077218ea263025eac4a49c460c5e6c33b7bf0b83262b43e96e07a560ea4edc0e"}],"concept.aat.300124083":[{"id":"assertion.concept.aat.300124083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"aesthetic concepts as defined in the captured Getty AAT record 300124083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines aesthetic concepts as: Concepts related to perception of what is ideal or beautiful.","support":[{"end":463,"quote":"Concepts related to perception of what is ideal or beautiful.","source_id":"getty-aat.300124083","source_sha256":"97a560d2f41f9e5dfcf6b433182eed4b29645866c347c64dfa85c363c85fb592","start":402}],"target_id":"concept.aat.300124083","target_kind":"node","target_sha256":"55018e1e5156787218fcc5b459ccee2b035df2737cc0c7f6eccf64be403788d0"}],"concept.aat.300137365":[{"id":"assertion.concept.aat.300137365","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"<linguistics and related disciplines> as defined in the captured Getty AAT record 300137365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines <linguistics and related disciplines> as: The discipline of linguistics and other disciplines related to it.","support":[{"end":493,"quote":"The discipline of linguistics and other disciplines related to it.","source_id":"getty-aat.300137365","source_sha256":"23d0150270bbb9e3b911eb293eb7253d3c9231fd4a3911a3dfb2cdb3b6f1ee47","start":427}],"target_id":"concept.aat.300137365","target_kind":"node","target_sha256":"c57936ccc8b49116aacb82ebd7303429bd31760ce10b0cc30f5763b14713c13b"}],"concept.aat.300137410":[{"id":"assertion.concept.aat.300137410","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"linguistics-related disciplines as defined in the captured Getty AAT record 300137410","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines linguistics-related disciplines as: Branches of learning and professions related to linguistics.","support":[{"end":498,"quote":"Branches of learning and professions related to linguistics.","source_id":"getty-aat.300137410","source_sha256":"2d83bba4e32241d33683dcf9bc5b41652139fe0dc3cf32e11abd34c3d6cad581","start":438}],"target_id":"concept.aat.300137410","target_kind":"node","target_sha256":"d0d7867c57acfed167338cbf172bed07cf687fc8a76742f1633cb9c47bdd2266"}],"concept.aat.300138708":[{"id":"assertion.concept.aat.300138708","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fashion design as defined in the captured Getty AAT record 300138708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fashion design as: Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\" For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","support":[{"end":888,"quote":"Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\"  For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","source_id":"getty-aat.300138708","source_sha256":"f468a104b04f4bec878832d16b7fc72e4af5d8c62a905a327a499a303053eee7","start":417}],"target_id":"concept.aat.300138708","target_kind":"node","target_sha256":"983114e62660ddc2bbeca904130c6f6574c6bd185e39a9f690925d5ddce59c29"}],"concept.aat.300143325":[{"id":"assertion.concept.aat.300143325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hasidism as defined in the captured Getty AAT record 300143325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hasidism as: Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","support":[{"end":924,"quote":"Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","source_id":"getty-aat.300143325","source_sha256":"777cb2d6aeb4335176596338f1e0f5c53ac4eadd1da5dc8d37c2713c59060e40","start":414}],"target_id":"concept.aat.300143325","target_kind":"node","target_sha256":"8ddf1001e0dc63313a614df58ac125ac25875a00ab3a45c1693cf0082ecc8cd4"}],"concept.aat.300145966":[{"id":"assertion.concept.aat.300145966","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious concepts as defined in the captured Getty AAT record 300145966","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious concepts as: Ideas and notions that are fundamentally religious.","support":[{"end":465,"quote":"Ideas and notions that are fundamentally religious.","source_id":"getty-aat.300145966","source_sha256":"d5bbe2d5b49f996528ee9304304745121798acc54febccbd37bac27148ae1f32","start":414}],"target_id":"concept.aat.300145966","target_kind":"node","target_sha256":"5fdb9966a7c09c7b3c8496332091167a5d81ee26dfe5ac12d7f601b25bae6fd5"}],"concept.aat.300145975":[{"id":"assertion.concept.aat.300145975","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"doctrinal concepts as defined in the captured Getty AAT record 300145975","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines doctrinal concepts as: Religious concepts related to doctrine.","support":[{"end":473,"quote":"Religious concepts related to doctrine.","source_id":"getty-aat.300145975","source_sha256":"31cc365e10e0a9916eb418423352397e2885e680c9ee0101905536b55f24dc06","start":434}],"target_id":"concept.aat.300145975","target_kind":"node","target_sha256":"a72a21b251e248ca17d10d794c893aefbb3f7d477b62073b3e58d904361cd527"}],"concept.aat.300157724":[{"id":"assertion.concept.aat.300157724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropology of religion as defined in the captured Getty AAT record 300157724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropology of religion as: Study of religion using the methods and theories of anthropology.","support":[{"end":504,"quote":"Study of religion using the methods and theories of anthropology.","source_id":"getty-aat.300157724","source_sha256":"5548693da01cf801f975201fc9b377d1932f7d863452990be505c7f9095b0977","start":439}],"target_id":"concept.aat.300157724","target_kind":"node","target_sha256":"58d79a8aafbc7bfe64f73de26c74387bc5223b839dd7a540ae76e147f3d62c8d"}],"concept.aat.300161596":[{"id":"assertion.concept.aat.300161596","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"interior decoration as defined in the captured Getty AAT record 300161596","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines interior decoration as: The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","support":[{"end":589,"quote":"The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","source_id":"getty-aat.300161596","source_sha256":"947eabc9d1be35fb88368adde67383f93acbc495b3da3f7b91ac02f846a60318","start":422}],"target_id":"concept.aat.300161596","target_kind":"node","target_sha256":"6759c8c824d76d0f4d50e1f87257e56bb40de0ad6b38a549e5fb7bb0873a5718"}],"concept.aat.300163423":[{"id":"assertion.concept.aat.300163423","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"costume design as defined in the captured Getty AAT record 300163423","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines costume design as: Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","support":[{"end":706,"quote":"Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","source_id":"getty-aat.300163423","source_sha256":"bc24b930f6be1174201d943bfe2e83efdd6ce9ec2a584b88730b12f6f6419de2","start":417}],"target_id":"concept.aat.300163423","target_kind":"node","target_sha256":"c424b800f576ba82c78cf82769e2e6ceaff7b8ad8b7cfbfe96dd43baca201b3b"}],"concept.aat.300175240":[{"id":"assertion.concept.aat.300175240","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"arts (broad discipline) as defined in the captured Getty AAT record 300175240","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arts (broad discipline) as: Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","support":[{"end":609,"quote":"Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","source_id":"getty-aat.300175240","source_sha256":"e245d1fca4085c89df0796d071d556974e2fa1a52f0b73213edb232b653f25a0","start":423}],"target_id":"concept.aat.300175240","target_kind":"node","target_sha256":"82da19bf5706cb2de4890c591154b4391646e217565f25acc21675a756720897"}],"concept.aat.300178907":[{"id":"assertion.concept.aat.300178907","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"holism as defined in the captured Getty AAT record 300178907","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines holism as: Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","support":[{"end":558,"quote":"Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","source_id":"getty-aat.300178907","source_sha256":"955d9ee97e3d6e5bb55d589f5a69a51aa763702feb8d5dcc8b51c11e04f7b2f1","start":431}],"target_id":"concept.aat.300178907","target_kind":"node","target_sha256":"16d724d5c18d001a95b5a379766261bac2316a1034a8f26daedaa82e12dcbdea"}],"concept.aat.300179281":[{"id":"assertion.concept.aat.300179281","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"imperfection as defined in the captured Getty AAT record 300179281","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines imperfection as: The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","support":[{"end":523,"quote":"The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","source_id":"getty-aat.300179281","source_sha256":"a904c27b3992008a4851bcc619c2db40ef7aff777161a8f7fd328e61cead8013","start":416}],"target_id":"concept.aat.300179281","target_kind":"node","target_sha256":"572bdbb0242b9ce052ce9a12e56241d6644b3fef078b29fe0286ffc2324a015b"}],"concept.aat.300179426":[{"id":"assertion.concept.aat.300179426","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perfection as defined in the captured Getty AAT record 300179426","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines perfection as: The state, quality, or condition of being accurate, complete, without defect and/or delightful.","support":[{"end":509,"quote":"The state, quality, or condition of being accurate, complete, without defect and/or delightful.","source_id":"getty-aat.300179426","source_sha256":"85ae6b60a549c47e0e1cf108d78008bdbdc5ceeb938e66ebb4b2636cf90d77af","start":414}],"target_id":"concept.aat.300179426","target_kind":"node","target_sha256":"de3bca75262334ee57d893f859bf88918bb8c1d5c6b6b8a48f1eae6dbf62b167"}],"concept.aat.300179462":[{"id":"assertion.concept.aat.300179462","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"quality as defined in the captured Getty AAT record 300179462","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines quality as: Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","support":[{"end":687,"quote":"Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","source_id":"getty-aat.300179462","source_sha256":"82a62700d54d9d8c5a39169c16373536d47fa842b1c7f8613ee617e289293cd3","start":411}],"target_id":"concept.aat.300179462","target_kind":"node","target_sha256":"0f05efbb59a652a0418631f524649670f5d6315068ba295d42de95dcde126c03"}],"concept.aat.300185658":[{"id":"assertion.concept.aat.300185658","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"heaven as defined in the captured Getty AAT record 300185658","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines heaven as: Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","support":[{"end":554,"quote":"Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","source_id":"getty-aat.300185658","source_sha256":"1b4ab74ae4db13d9cc92804989124d452ee36dd137a566c567f2292f9babe952","start":410}],"target_id":"concept.aat.300185658","target_kind":"node","target_sha256":"58cf1acc869d69d68722354e3ee66e52b5bc7e752452d8aee85aa8e297103598"}],"concept.aat.300189645":[{"id":"assertion.concept.aat.300189645","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"urban design as defined in the captured Getty AAT record 300189645","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines urban design as: The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","support":[{"end":877,"quote":"The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","source_id":"getty-aat.300189645","source_sha256":"2465d7cdceef459d52d02cbeb0b9ac378a2e7c991484cbf5677ae40ad1c185f4","start":421}],"target_id":"concept.aat.300189645","target_kind":"node","target_sha256":"57e5ce50e38a241ab755ef2868ef4ed8713375299718c9177f637375e24512ea"}],"concept.aat.300190210":[{"id":"assertion.concept.aat.300190210","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"globalism as defined in the captured Getty AAT record 300190210","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines globalism as: The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","support":[{"end":805,"quote":"The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","source_id":"getty-aat.300190210","source_sha256":"1b19e1275f8fc00b22e0c91a3211c8e9423afaa9642261db163cc950f0823280","start":434}],"target_id":"concept.aat.300190210","target_kind":"node","target_sha256":"41a0fe156d06db655eda57c08893020f21b0afff242fe7a9ae623d65ee79ee43"}],"concept.aat.300193867":[{"id":"assertion.concept.aat.300193867","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"West Asian as defined in the captured Getty AAT record 300193867","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines West Asian as: Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","support":[{"end":610,"quote":"Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","source_id":"getty-aat.300193867","source_sha256":"6c1ee6808380ed270b97f2268c230cc73dd1cc3f45c05e78fd9adcf8d255a933","start":419}],"target_id":"concept.aat.300193867","target_kind":"node","target_sha256":"6eac77ac1f5bd29299ba29776d58424c5b22afe6a348408ff3c007bf0b6ae0aa"}],"concept.aat.300201023":[{"id":"assertion.concept.aat.300201023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myths as defined in the captured Getty AAT record 300201023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines myths as: Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","support":[{"end":725,"quote":"Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","source_id":"getty-aat.300201023","source_sha256":"f9b7d0ee410654d04288dafcd11c4354f84231e403abf5247bf0b429766f9222","start":422}],"target_id":"concept.aat.300201023","target_kind":"node","target_sha256":"58629b040017f7a2c41ab266245f014b53cd932de0edd90e004d82e88f2a909c"}],"concept.aat.300233660":[{"id":"assertion.concept.aat.300233660","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pluralism as defined in the captured Getty AAT record 300233660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pluralism as: Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","support":[{"end":776,"quote":"Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","source_id":"getty-aat.300233660","source_sha256":"2df60a4df68c61170fa82eb4537a8d326e17518a7f2fd99397ac9a54a2aca789","start":434}],"target_id":"concept.aat.300233660","target_kind":"node","target_sha256":"8a5522c812c519ada7dc8f888eabcf09c835120393158a929c7fd7f1a57e24b7"}],"concept.aat.300237780":[{"id":"assertion.concept.aat.300237780","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"image quality as defined in the captured Getty AAT record 300237780","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines image quality as: Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","support":[{"end":553,"quote":"Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","source_id":"getty-aat.300237780","source_sha256":"63311253de0669c5c1c2c8fb82c88065d486752851399cc6e4ee7598a9a29712","start":406}],"target_id":"concept.aat.300237780","target_kind":"node","target_sha256":"626c45bbffb063d3a73b29249defe326dcb61e1081d678f089df576f615fedcb"}],"concept.aat.300240013":[{"id":"assertion.concept.aat.300240013","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hmong as defined in the captured Getty AAT record 300240013","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hmong as: Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","support":[{"end":1325,"quote":"Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","source_id":"getty-aat.300240013","source_sha256":"295e9b4a37ab49f62308b5cd7927a486fa0f193360f561a5c5a4710131fcb5c6","start":392}],"target_id":"concept.aat.300240013","target_kind":"node","target_sha256":"94558c9dfdb61190e34d85ba96f86a59772339664adcf54c73976e46ae80fb44"}],"concept.aat.300244546":[{"id":"assertion.concept.aat.300244546","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"West Turkestani as defined in the captured Getty AAT record 300244546","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines West Turkestani as: Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","support":[{"end":564,"quote":"Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","source_id":"getty-aat.300244546","source_sha256":"5c288f0f85403a2a9c10a2259306bf2fe25398e703a98805f0c621322240e95b","start":400}],"target_id":"concept.aat.300244546","target_kind":"node","target_sha256":"849244f7aabd1cbe42153a77ab598870a20ca5ae13dc8740c7bfe6a85a790423"}],"concept.aat.300245255":[{"id":"assertion.concept.aat.300245255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Moroccan as defined in the captured Getty AAT record 300245255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Moroccan as: Style and culture of the nation of Morocco or its historical counterparts.","support":[{"end":521,"quote":"Style and culture of the nation of Morocco or its historical counterparts.","source_id":"getty-aat.300245255","source_sha256":"86dac1b4a1ffe7305db63aee0b6a7a123122ea2734f998405d6a87a2a9060821","start":447}],"target_id":"concept.aat.300245255","target_kind":"node","target_sha256":"4c9741ba6d59f2640339f0f3661aa58c0a49221d319dbf1636dd1b2430e0f3b2"}],"concept.aat.300247349":[{"id":"assertion.concept.aat.300247349","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chaos as defined in the captured Getty AAT record 300247349","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines chaos as: The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","support":[{"end":679,"quote":"The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","source_id":"getty-aat.300247349","source_sha256":"31f96e368f9595b3d60da8fdf7d5c257b78910d657c7f3b4f5d1acfd019424ed","start":412}],"target_id":"concept.aat.300247349","target_kind":"node","target_sha256":"53176e769542a93e2adcfa03308bfafbc2a04b6165dd517e9c51e56cbbfb2c53"}],"concept.aat.300257052":[{"id":"assertion.concept.aat.300257052","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"identity as defined in the captured Getty AAT record 300257052","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines identity as: Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","support":[{"end":572,"quote":"Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","source_id":"getty-aat.300257052","source_sha256":"c1d424f832cd2400c143459e77d685e0a1c16c0d3db8d85b1d73cbfa03027b38","start":415}],"target_id":"concept.aat.300257052","target_kind":"node","target_sha256":"6a8355d7860f3b5fd277f6a8d1d3ef2c6186a214cb4a2f116dd238d9970206e8"}],"concept.aat.300260338":[{"id":"assertion.concept.aat.300260338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paper engineering as defined in the captured Getty AAT record 300260338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paper engineering as: Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","support":[{"end":585,"quote":"Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","source_id":"getty-aat.300260338","source_sha256":"77eada6aa59aa97b29d28535eae3fc307abfa17f2ee8d8dd5600f0fb326d3d3f","start":420}],"target_id":"concept.aat.300260338","target_kind":"node","target_sha256":"f5b049131eac3abe5f29a52ea90eb0d3fa7346f9575c684f245f250bf6bec9d0"}],"concept.aat.300262583":[{"id":"assertion.concept.aat.300262583","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Senegalese as defined in the captured Getty AAT record 300262583","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Senegalese as: Style and culture of the people of Senegal.","support":[{"end":492,"quote":"Style and culture of the people of Senegal.","source_id":"getty-aat.300262583","source_sha256":"c677480f334556ba7c6bbad158ca4f60c6a83ff394cade9f75472e79047ed299","start":449}],"target_id":"concept.aat.300262583","target_kind":"node","target_sha256":"5b1ebeda01a4589cd7498bbb40d51b2a7b341997ddd401b1ea006af7cdda087f"}],"concept.aat.300262588":[{"id":"assertion.concept.aat.300262588","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern African as defined in the captured Getty AAT record 300262588","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern African as: Styles and cultures belonging to modern Africa, generally from the 19th century and later.","support":[{"end":547,"quote":"Styles and cultures belonging to modern Africa, generally from the 19th century and later.","source_id":"getty-aat.300262588","source_sha256":"8dc1f13f8dc063df3c7cc3d4861f3e6aa867e3554efa004f539d1f04d52d6259","start":457}],"target_id":"concept.aat.300262588","target_kind":"node","target_sha256":"2f0e56ef0bcb9072773f86331501665ee726501ea29a20a0bf00567fc84dc668"}],"concept.aat.300262589":[{"id":"assertion.concept.aat.300262589","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modern East African as defined in the captured Getty AAT record 300262589","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines modern East African as: Styles and culture belonging to modern East Africa.","support":[{"end":490,"quote":"Styles and culture belonging to modern East Africa.","source_id":"getty-aat.300262589","source_sha256":"0321801ccb42b48bcd4af9adad9ca96e221501997f484cc827db557f08474181","start":439}],"target_id":"concept.aat.300262589","target_kind":"node","target_sha256":"2300257bdf1852e626a0185c5930f5d9970620f3eb9509c3247db45749fd1eaf"}],"concept.aat.300262631":[{"id":"assertion.concept.aat.300262631","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rwandese as defined in the captured Getty AAT record 300262631","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rwandese as: The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","support":[{"end":588,"quote":"The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","source_id":"getty-aat.300262631","source_sha256":"cfc47cf938a57b6aa44fc8e40dbfcece83463f002c43ccd73da71a0ab0c6db48","start":447}],"target_id":"concept.aat.300262631","target_kind":"node","target_sha256":"bad5a2d75a140e38080c99f564f5794c1e9915c447cf3362644605a78e60aace"}],"concept.aat.300262632":[{"id":"assertion.concept.aat.300262632","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Seychellois as defined in the captured Getty AAT record 300262632","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Seychellois as: Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","support":[{"end":574,"quote":"Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","source_id":"getty-aat.300262632","source_sha256":"12bb68c13cd154f76a185c59dcec99246c16c3d800fac7400ee3959f14df23bb","start":450}],"target_id":"concept.aat.300262632","target_kind":"node","target_sha256":"30714c6728f9000354721273c941a870b193055c1bb39f859535f1467d0eed9e"}],"concept.aat.300262633":[{"id":"assertion.concept.aat.300262633","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sierra Leonean as defined in the captured Getty AAT record 300262633","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sierra Leonean as: Style and culture of the nation of Sierra Leone.","support":[{"end":501,"quote":"Style and culture of the nation of Sierra Leone.","source_id":"getty-aat.300262633","source_sha256":"fb1b304e89c4e60b037e7fb56d64f4af32816468fdf513a81928a0594c6422c5","start":453}],"target_id":"concept.aat.300262633","target_kind":"node","target_sha256":"d3c3c0ec438261235d5f23863c81ea11e57d19cb3feadec2c0043b85bd885db6"}],"concept.aat.300262634":[{"id":"assertion.concept.aat.300262634","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sao Tomean as defined in the captured Getty AAT record 300262634","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sao Tomean as: Style and culture of the nation of São Tomé and Príncipe.","support":[{"end":506,"quote":"Style and culture of the nation of São Tomé and Príncipe.","source_id":"getty-aat.300262634","source_sha256":"9bf1760ddda28f5c4c2e4fe080fae61bf973854cbf727212c85561ea788ff222","start":449}],"target_id":"concept.aat.300262634","target_kind":"node","target_sha256":"1a19afb08c4b95aefe4acdce18d33b05c3d4024722d868e6f5b8af2e5c91184c"}],"concept.aat.300262638":[{"id":"assertion.concept.aat.300262638","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Djiboutian as defined in the captured Getty AAT record 300262638","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Djiboutian as: Style and culture of the nation of Dijbouti.","support":[{"end":493,"quote":"Style and culture of the nation of Dijbouti.","source_id":"getty-aat.300262638","source_sha256":"976c28c3d730b068b8f424aee6c481d64565b6e888f6a9dac163f629acf90c6d","start":449}],"target_id":"concept.aat.300262638","target_kind":"node","target_sha256":"ec87bb40fae62845a59c2e997def234fca75712f690a3a506c79238a1d07e32e"}],"concept.aat.300262640":[{"id":"assertion.concept.aat.300262640","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Libyan as defined in the captured Getty AAT record 300262640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Libyan as: Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","support":[{"end":564,"quote":"Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","source_id":"getty-aat.300262640","source_sha256":"348fa62410544f6188a765099ed3c91b7d629e6101739fe66e8ef0c5318165bd","start":445}],"target_id":"concept.aat.300262640","target_kind":"node","target_sha256":"726d2c571a8f7e8a02bffd6e651e57463d3f38a6d2d3f1c2081d2612a24fbf63"}],"concept.aat.300262641":[{"id":"assertion.concept.aat.300262641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Malawian as defined in the captured Getty AAT record 300262641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Malawian as: Style and culture of people of the nation of Malawi.","support":[{"end":499,"quote":"Style and culture of people of the nation of Malawi.","source_id":"getty-aat.300262641","source_sha256":"99f48b037e1af82783e248d10c0083a58caed40482e98e2512f1174d5fe1f9ca","start":447}],"target_id":"concept.aat.300262641","target_kind":"node","target_sha256":"5927406cf851b160ab76a0775d46142b9d2bec5e704265513a3917835d7fa361"}],"concept.aat.300262644":[{"id":"assertion.concept.aat.300262644","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Equatorial Guinean as defined in the captured Getty AAT record 300262644","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Equatorial Guinean as: Style and culture of the people of Equatorial Guinea.","support":[{"end":510,"quote":"Style and culture of the people of Equatorial Guinea.","source_id":"getty-aat.300262644","source_sha256":"60e9394a6c2df67354213ee4ea34b32a597f5687f8ddd6e7f5a0406770fabf55","start":457}],"target_id":"concept.aat.300262644","target_kind":"node","target_sha256":"4de66723396ab49e3fd8f4a89429ba2fca87814e2d6f53b63869bb4548e6a72b"}],"concept.aat.300262645":[{"id":"assertion.concept.aat.300262645","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eritrean as defined in the captured Getty AAT record 300262645","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eritrean as: Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","support":[{"end":574,"quote":"Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","source_id":"getty-aat.300262645","source_sha256":"bde3ec475a88f8d077073c42c4b39792b1fa7848962376269a314a0be43cc95a","start":447}],"target_id":"concept.aat.300262645","target_kind":"node","target_sha256":"9372e5ff2276ea3533afdd8a6c8f34387388cb271c945461148484678b6be966"}],"concept.aat.300262648":[{"id":"assertion.concept.aat.300262648","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gabonese as defined in the captured Getty AAT record 300262648","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gabonese as: Style and culture of the inhabitants of the nation of Gabon.","support":[{"end":507,"quote":"Style and culture of the inhabitants of the nation of Gabon.","source_id":"getty-aat.300262648","source_sha256":"4f8b242e2e73308ab3f9774b334ad62eb42d71f7e697d2d8b561caa23e73b719","start":447}],"target_id":"concept.aat.300262648","target_kind":"node","target_sha256":"978e2b71cf6e4fdc9b772847bd85ed62a6b83d4a4e65872a101c43768bc34e6e"}],"concept.aat.300262649":[{"id":"assertion.concept.aat.300262649","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Gambian as defined in the captured Getty AAT record 300262649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Gambian as: Style and culture of inhabitants of the nation of Gambia.","support":[{"end":503,"quote":"Style and culture of inhabitants of the nation of Gambia.","source_id":"getty-aat.300262649","source_sha256":"05699f71d4a1a6dae7f1484b4a7026a4677efcc8b58f21a19096b79b0cd0f28b","start":446}],"target_id":"concept.aat.300262649","target_kind":"node","target_sha256":"e1e468c94fe5a992d948369eae8154211f4213bc6b5af1dc19f16b151b5ab37b"}],"concept.aat.300262650":[{"id":"assertion.concept.aat.300262650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Guinean as defined in the captured Getty AAT record 300262650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Guinean as: Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","support":[{"end":690,"quote":"Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","source_id":"getty-aat.300262650","source_sha256":"a9c558397e56b90203fe4203d79418c48e98d1df07d36513592da5f18bc33466","start":446}],"target_id":"concept.aat.300262650","target_kind":"node","target_sha256":"ef11008d65020f937996e1accd05a5afbb474eb71ae2e7698472c66ea7eb7ce5"}],"concept.aat.300262651":[{"id":"assertion.concept.aat.300262651","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ghanaian as defined in the captured Getty AAT record 300262651","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ghanaian as: Style and culture of the people of the nation of Ghana.","support":[{"end":502,"quote":"Style and culture of the people of the nation of Ghana.","source_id":"getty-aat.300262651","source_sha256":"687684c3e09bf5fb190ead175300f54ede816000b94930b43f2047a3b7529079","start":447}],"target_id":"concept.aat.300262651","target_kind":"node","target_sha256":"245642367be35e4743cfb2eb19d7ba4352947b37ecb842fe4219bfebafdbc8c9"}],"concept.aat.300262652":[{"id":"assertion.concept.aat.300262652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Guinea-Bissauan as defined in the captured Getty AAT record 300262652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Guinea-Bissauan as: Style and culture of the people from Guinea-Bissau.","support":[{"end":505,"quote":"Style and culture of the people from Guinea-Bissau.","source_id":"getty-aat.300262652","source_sha256":"084ea275807876b0b082024e632bb2fb9d3a28c867a3e2074ff8b509e23d1dcd","start":454}],"target_id":"concept.aat.300262652","target_kind":"node","target_sha256":"8c55a4ca44067fb4d485498ebb83797827c1ebb67cc08b0d96ca274b710c00c9"}],"concept.aat.300262653":[{"id":"assertion.concept.aat.300262653","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ivorian as defined in the captured Getty AAT record 300262653","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ivorian as: Style and culture of the Ivory Coast.","support":[{"end":483,"quote":"Style and culture of the Ivory Coast.","source_id":"getty-aat.300262653","source_sha256":"fb4310284ce14f66702dc7a37497c7b31fef61ffdd247c2707ab4abc4ad14aea","start":446}],"target_id":"concept.aat.300262653","target_kind":"node","target_sha256":"453185514d394c29435abceec57260f84e2d615ae3c8efae6f95729a40b6b795"}],"concept.aat.300262654":[{"id":"assertion.concept.aat.300262654","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kenyan as defined in the captured Getty AAT record 300262654","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kenyan as: Style and culture of Kenya.","support":[{"end":472,"quote":"Style and culture of Kenya.","source_id":"getty-aat.300262654","source_sha256":"eef2dcfd9df94d7c2260554f815be9ee1bdae1f5ffb6c6eca4453457495c2ba2","start":445}],"target_id":"concept.aat.300262654","target_kind":"node","target_sha256":"bb2bb64b459e86afc72d80b419c1fc9e53dd2efc1baa793dfb9f6db638bfc8a5"}],"concept.aat.300262655":[{"id":"assertion.concept.aat.300262655","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Lesotho as defined in the captured Getty AAT record 300262655","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Lesotho as: Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","support":[{"end":527,"quote":"Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","source_id":"getty-aat.300262655","source_sha256":"c757a81dc56f86bf5e75c1aee50e76d2e364d1a78f86922fb678cba934269e46","start":446}],"target_id":"concept.aat.300262655","target_kind":"node","target_sha256":"b76ce663e9a1a544cb538a9932c46ec956f9c713b6f7dcebec1d7958b6db3d98"}],"concept.aat.300262698":[{"id":"assertion.concept.aat.300262698","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Sudanese as defined in the captured Getty AAT record 300262698","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Sudanese as: Style and culture of the people of the Sudan.","support":[{"end":492,"quote":"Style and culture of the people of the Sudan.","source_id":"getty-aat.300262698","source_sha256":"1fa50ad044cd472c979f4eddc5b725e121ee22b2bd82b68bcdbb08f66e1bb5ee","start":447}],"target_id":"concept.aat.300262698","target_kind":"node","target_sha256":"c051e0d8a910cf289f7e0a18a9f6120a93f097c9d029e93396769fc962308010"}],"concept.aat.300262699":[{"id":"assertion.concept.aat.300262699","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Algerian as defined in the captured Getty AAT record 300262699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Algerian as: Style and culture of the people of Algeria or Algiers, in northern Africa.","support":[{"end":521,"quote":"Style and culture of the people of Algeria or Algiers, in northern Africa.","source_id":"getty-aat.300262699","source_sha256":"3b674427153cbfba79e8479f310ac8c8318848335c8dd2c2afa355a7ee239e04","start":447}],"target_id":"concept.aat.300262699","target_kind":"node","target_sha256":"3bb9d7c1ba1555471d35180858ba66ef0a1cc6e8340424f6f4b1032d0a89c925"}],"concept.aat.300262700":[{"id":"assertion.concept.aat.300262700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Angolan as defined in the captured Getty AAT record 300262700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Angolan as: Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","support":[{"end":554,"quote":"Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","source_id":"getty-aat.300262700","source_sha256":"ca5d7aac00e2fc82268fe984dd30b914902b128fbd9fe5db5e010691bd5f6f2e","start":446}],"target_id":"concept.aat.300262700","target_kind":"node","target_sha256":"4a69dd2c53bb91d58bcaac4d879417068a4ee8bf778c3dbe7f6136acfc6fdaf1"}],"concept.aat.300262701":[{"id":"assertion.concept.aat.300262701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cape Verdean as defined in the captured Getty AAT record 300262701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cape Verdean as: Style and culture of the people of Cape Verde.","support":[{"end":497,"quote":"Style and culture of the people of Cape Verde.","source_id":"getty-aat.300262701","source_sha256":"4e7fae3a1e8831a95499520aa9428e8f230839e742d7747899465a0d302c451b","start":451}],"target_id":"concept.aat.300262701","target_kind":"node","target_sha256":"38c12be9c57c430a0598486ea74410f927c744beb6eb1188311697758c6f6ee3"}],"concept.aat.300262702":[{"id":"assertion.concept.aat.300262702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burkina Faso as defined in the captured Getty AAT record 300262702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burkina Faso as: Style and culture of the people of Burkina Faso.","support":[{"end":499,"quote":"Style and culture of the people of Burkina Faso.","source_id":"getty-aat.300262702","source_sha256":"46911c3105ec1ff70774deb8b23e4d4e4d6c861707f52890bb0bc6fc7b8970ff","start":451}],"target_id":"concept.aat.300262702","target_kind":"node","target_sha256":"5117c4b28d3663ff162efe24a0cfd7a2a98870d7d17858cb839642517abe221f"}],"concept.aat.300262703":[{"id":"assertion.concept.aat.300262703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Burundi as defined in the captured Getty AAT record 300262703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Burundi as: Style and culture of the people of Burundi.","support":[{"end":489,"quote":"Style and culture of the people of Burundi.","source_id":"getty-aat.300262703","source_sha256":"ac745da7f0f58234287ac6efa06508500a630273a13d96eaad37bf2acf67c373","start":446}],"target_id":"concept.aat.300262703","target_kind":"node","target_sha256":"97d7f28576812036170f4b0c51f708657d340068283dd3f708a00700c31a3e3b"}],"concept.aat.300262705":[{"id":"assertion.concept.aat.300262705","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Somalian as defined in the captured Getty AAT record 300262705","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Somalian as: General national designation of the nation of Somalia, the Somali Democratic Republic.","support":[{"end":533,"quote":"General national designation of the nation of Somalia, the Somali Democratic Republic.","source_id":"getty-aat.300262705","source_sha256":"9fcef4e9606d084b6f40421bebde05ae8c99b33ea54c52389d1b3f4a1caa1e24","start":447}],"target_id":"concept.aat.300262705","target_kind":"node","target_sha256":"001c2d6a49168a4ef083a4ee906091b4c9d06f09f960fe575bc432a75a8b46e6"}],"concept.aat.300262706":[{"id":"assertion.concept.aat.300262706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"South African as defined in the captured Getty AAT record 300262706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.","support":[{"end":500,"quote":"Style and culture of the people of South Africa.","source_id":"getty-aat.300262706","source_sha256":"786431750b7db042f63cdeb33b85395e3b1fec5ee1e7aa4734e8f6677e0c3b86","start":452}],"target_id":"concept.aat.300262706","target_kind":"node","target_sha256":"d95ebbc4e5d415404630d8211aa362cff5ddca3dd1438ca26f0391356ce82b39"}],"concept.aat.300262707":[{"id":"assertion.concept.aat.300262707","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tanzanian as defined in the captured Getty AAT record 300262707","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tanzanian as: Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","support":[{"end":577,"quote":"Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","source_id":"getty-aat.300262707","source_sha256":"261b0fa509b4f4c4dc23a76046a49e7ddd5870cef68acc06e2ffc7e00c6aae49","start":448}],"target_id":"concept.aat.300262707","target_kind":"node","target_sha256":"54540565850268f4cf476a58c7ccbafa5e4038fd3eddcebd7356bd1e3083991c"}],"concept.aat.300262708":[{"id":"assertion.concept.aat.300262708","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Chadian as defined in the captured Getty AAT record 300262708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Chadian as: Style or culture of the nation of Chad.","support":[{"end":485,"quote":"Style or culture of the nation of Chad.","source_id":"getty-aat.300262708","source_sha256":"e61329e6d443e48b592aae748c8c11c91730809f3e488be2af907b76b36edcfa","start":446}],"target_id":"concept.aat.300262708","target_kind":"node","target_sha256":"f65a7e243bc0dbe7708cd536cd9ce947e9b008b9af7317cfb7c038254d81636b"}],"concept.aat.300262709":[{"id":"assertion.concept.aat.300262709","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Togolese as defined in the captured Getty AAT record 300262709","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Togolese as: Nationality, style, or culture of the West African state of Togo (formerly Togoland).","support":[{"end":532,"quote":"Nationality, style, or culture of the West African state of Togo (formerly Togoland).","source_id":"getty-aat.300262709","source_sha256":"69da49e81b94000dfa294f027b168e04c2f9771c3f2102bbd9d458ba8a02448d","start":447}],"target_id":"concept.aat.300262709","target_kind":"node","target_sha256":"4330a020b6deb5ef3a610ec9cfeea958d8b790de2dea2cf1d3d76510a36509af"}],"concept.aat.300262723":[{"id":"assertion.concept.aat.300262723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mauritian as defined in the captured Getty AAT record 300262723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mauritian as: The style and culture of the island of Mauritius in the Indian Ocean.","support":[{"end":517,"quote":"The style and culture of the island of Mauritius in the Indian Ocean.","source_id":"getty-aat.300262723","source_sha256":"0711fc782bf0cf3264a2840c5b86458d90ff6fe8d849894e6f9ab5a10e98a655","start":448}],"target_id":"concept.aat.300262723","target_kind":"node","target_sha256":"8b4666d27a041c0aad0d765ed9c9844130bd37aaefb489981df2c4194c2a43c0"}],"concept.aat.300262724":[{"id":"assertion.concept.aat.300262724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mahoran as defined in the captured Getty AAT record 300262724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mahoran as: Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","support":[{"end":545,"quote":"Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","source_id":"getty-aat.300262724","source_sha256":"28eaa7b498b9086bb7bd45a7e75278d27a4840a6f6fbd921dd41b164a8582893","start":446}],"target_id":"concept.aat.300262724","target_kind":"node","target_sha256":"9e2596d9b5b43105ae6d1c228b936ac0fd44da2729fc13bf5312dde5043030bd"}],"concept.aat.300262725":[{"id":"assertion.concept.aat.300262725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mozambican as defined in the captured Getty AAT record 300262725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mozambican as: Style and culture of the nation of Mozambique.","support":[{"end":495,"quote":"Style and culture of the nation of Mozambique.","source_id":"getty-aat.300262725","source_sha256":"5e1a5e197f3edd8c29de2cc75f29b88ba630b645cb9c08fdcc9879f1d9207819","start":449}],"target_id":"concept.aat.300262725","target_kind":"node","target_sha256":"8aa1d35ec62d5d1ed3402db1254ebe62a6ef98fc8042e9c83ee9bb0f0e7f0f54"}],"concept.aat.300262726":[{"id":"assertion.concept.aat.300262726","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Namibian as defined in the captured Getty AAT record 300262726","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Namibian as: Style and culture of the people of the nation of Namibia or of the Namib desert.","support":[{"end":527,"quote":"Style and culture of the people of the nation of Namibia or of the Namib desert.","source_id":"getty-aat.300262726","source_sha256":"7917615d42b7d149e950a3f9a21d8e420ba73579f2c674db65745cda90d9afbc","start":447}],"target_id":"concept.aat.300262726","target_kind":"node","target_sha256":"c489bd395321f79db72298b815b0b68ca37c5f8e3e37631ef0b121009d599870"}],"concept.aat.300262992":[{"id":"assertion.concept.aat.300262992","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cameroonian as defined in the captured Getty AAT record 300262992","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cameroonian as: Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","support":[{"end":547,"quote":"Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","source_id":"getty-aat.300262992","source_sha256":"6ac7110018964953116855cbd7d55bb44e7566611c57f615c9ae74233fdfa039","start":450}],"target_id":"concept.aat.300262992","target_kind":"node","target_sha256":"c809a259bd56593219f13d359992e0d2d93436a1d3b14ab5c6790ad86b1ede2b"}],"concept.aat.300262993":[{"id":"assertion.concept.aat.300262993","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Beninese as defined in the captured Getty AAT record 300262993","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Beninese as: Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","support":[{"end":615,"quote":"Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","source_id":"getty-aat.300262993","source_sha256":"5709849bcb7810d240ca329c4b6118e89921ce3e9c8cf2d6c971fa83660307bd","start":447}],"target_id":"concept.aat.300262993","target_kind":"node","target_sha256":"c8c101ecedde26557dc7f23427214da6138333ccd8da42972ade3ba30e1a7ddd"}],"concept.aat.300263186":[{"id":"assertion.concept.aat.300263186","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biblical as defined in the captured Getty AAT record 300263186","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines biblical as: Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","support":[{"end":532,"quote":"Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","source_id":"getty-aat.300263186","source_sha256":"d83a3ee774bd1f0cb1bcdac87967c90972f4a4b6a2b14d4361fd335eadfcb19e","start":424}],"target_id":"concept.aat.300263186","target_kind":"node","target_sha256":"a6018fd4242f4712ec9d3687b9a30bd5425c139b3c5a11411c9a7f2f8955d9d6"}],"concept.aat.300263250":[{"id":"assertion.concept.aat.300263250","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"grammar (discipline) as defined in the captured Getty AAT record 300263250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines grammar (discipline) as: The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","support":[{"end":570,"quote":"The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","source_id":"getty-aat.300263250","source_sha256":"380459c5ded74bd614c131652b90604ac3679fca0b79fcead59d2dc406e76976","start":414}],"target_id":"concept.aat.300263250","target_kind":"node","target_sha256":"de1a18159dfb12650fc6a91a70eeca2f4008b306f8cfce32e337ab2ba298b2b3"}],"concept.aat.300263699":[{"id":"assertion.concept.aat.300263699","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ugandan as defined in the captured Getty AAT record 300263699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ugandan as: The style and culture of the central African State, Uganda.","support":[{"end":505,"quote":"The style and culture of the central African State, Uganda.","source_id":"getty-aat.300263699","source_sha256":"165a35ec34e70ea3c8af6ea7488d5f673fdee043edb9d59c8608b2e77a474ad5","start":446}],"target_id":"concept.aat.300263699","target_kind":"node","target_sha256":"eaca1c095b248303cd389b230e626443e09481df254b8081f00ac6dd7d064229"}],"concept.aat.300263700":[{"id":"assertion.concept.aat.300263700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Zambian as defined in the captured Getty AAT record 300263700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Zambian as: The style and culture of the south central African country, Zambia (formerly Northern Rhodesia).","support":[{"end":543,"quote":"The style and culture of  the south central African country, Zambia (formerly Northern Rhodesia).","source_id":"getty-aat.300263700","source_sha256":"3a5fa764ba7df57910351abe8c079bcb5f5845b8a56737cd9c2f1e48f6bea268","start":446}],"target_id":"concept.aat.300263700","target_kind":"node","target_sha256":"f11a711469682f8c0a436d71ccf638aeab4d215042de719dc042b2c64efb2e29"}],"concept.aat.300263701":[{"id":"assertion.concept.aat.300263701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Zimbabwean as defined in the captured Getty AAT record 300263701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Zimbabwean as: The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","support":[{"end":529,"quote":"The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","source_id":"getty-aat.300263701","source_sha256":"e21a8a7b4e0e635dbfcf30c6808a60adf2fdd06d777c8d5875cdb279af90875c","start":449}],"target_id":"concept.aat.300263701","target_kind":"node","target_sha256":"bba8931712ffcc6182d218e12505ce7452540942345f25f91cdb3c51c109df2f"}],"concept.aat.300264088":[{"id":"assertion.concept.aat.300264088","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Styles and Periods Facet as defined in the captured Getty AAT record 300264088","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Styles and Periods Facet as: Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","support":[{"end":595,"quote":"Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","source_id":"getty-aat.300264088","source_sha256":"e38e624ed93ac33f5e8e016d0b51ae0968baf05eb9d8aa59bb77a91d23de42e0","start":343}],"target_id":"concept.aat.300264088","target_kind":"node","target_sha256":"c5e6921a816238bcc9b9277542eda3e1bae8c8284543661c1afd6e93a666a446"}],"concept.aat.300264303":[{"id":"assertion.concept.aat.300264303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"absolution as defined in the captured Getty AAT record 300264303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines absolution as: A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","support":[{"end":689,"quote":"A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","source_id":"getty-aat.300264303","source_sha256":"3e80640ab4572672d6efd14e911c967eb7f1a6e349347b777cd482ab044affcb","start":414}],"target_id":"concept.aat.300264303","target_kind":"node","target_sha256":"e09fc24b87d5eebde826ec103a717522097dbb857c59a2207792d79aefbdd685"}],"concept.aat.300264304":[{"id":"assertion.concept.aat.300264304","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"afterlife as defined in the captured Getty AAT record 300264304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines afterlife as: The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","support":[{"end":554,"quote":"The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","source_id":"getty-aat.300264304","source_sha256":"d71a85f77b7b893d76ff80dde284b273c7df3273baef4f79a7e16a0519446e5b","start":413}],"target_id":"concept.aat.300264304","target_kind":"node","target_sha256":"1ddf32c57128eacf22baaabd07ebeaed6fd66d83217efda2a1558a0f56b2ca0c"}],"concept.aat.300264305":[{"id":"assertion.concept.aat.300264305","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ahimsa as defined in the captured Getty AAT record 300264305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ahimsa as: Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","support":[{"end":848,"quote":"Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","source_id":"getty-aat.300264305","source_sha256":"f16053a553cb81912fe1f57a878145ca51cb11e19fc7d4972c535e88f0aa2983","start":415}],"target_id":"concept.aat.300264305","target_kind":"node","target_sha256":"675999eea9d67662adea5801dfd6eefc515a6ef5b7d9d9aa5b90af8167262525"}],"concept.aat.300264310":[{"id":"assertion.concept.aat.300264310","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dreaming, the as defined in the captured Getty AAT record 300264310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dreaming, the as: A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","support":[{"end":1253,"quote":"A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","source_id":"getty-aat.300264310","source_sha256":"09b8add09f9e3b3fb0c972ab7ff4fdb8c1f7a9fd128fc791fd7d24ff3c287dad","start":429}],"target_id":"concept.aat.300264310","target_kind":"node","target_sha256":"d0ddda2fbfdb9c3534a53d317bc99d80d472562ba538a97effc2da03c9f43f5c"}],"concept.aat.300264321":[{"id":"assertion.concept.aat.300264321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ascension as defined in the captured Getty AAT record 300264321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ascension as: The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","support":[{"end":648,"quote":"The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","source_id":"getty-aat.300264321","source_sha256":"b94b70c7dac782ad11c56c508b8344e35eda6c9bfc1fcf9cccd59253a131f985","start":413}],"target_id":"concept.aat.300264321","target_kind":"node","target_sha256":"569cc6adbb5b83ccf8fce6b704b6f8d5f6cc6bf62ed65263d2c71d895ca02ebe"}],"concept.aat.300264322":[{"id":"assertion.concept.aat.300264322","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"asceticism as defined in the captured Getty AAT record 300264322","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines asceticism as: Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","support":[{"end":769,"quote":"Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","source_id":"getty-aat.300264322","source_sha256":"faa39e376092f13edcecdaa817b61212afe0478f4539f7d790c43c0887dc7ae4","start":416}],"target_id":"concept.aat.300264322","target_kind":"node","target_sha256":"f98b17c9b9805fd03c9bd8059edadaeb52111d4746acbfd439adb49ce883a4d0"}],"concept.aat.300264335":[{"id":"assertion.concept.aat.300264335","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"auspicia as defined in the captured Getty AAT record 300264335","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines auspicia as: In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","support":[{"end":829,"quote":"In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","source_id":"getty-aat.300264335","source_sha256":"6802ddb7b20e2a1d6e39501d91cae67deb7f91c2da3cbda9ced7ca7ddf027a50","start":424}],"target_id":"concept.aat.300264335","target_kind":"node","target_sha256":"9ef186cee039b50da618bbc6133edc64b9cd8a27f0f5b8ad8a56434ad3d325a6"}],"concept.aat.300264336":[{"id":"assertion.concept.aat.300264336","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"avatara as defined in the captured Getty AAT record 300264336","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines avatara as: Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","support":[{"end":1208,"quote":"Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","source_id":"getty-aat.300264336","source_sha256":"85cb68c776ee98e526637546556147c7056201dce9f8b565fef5c7e79907a76b","start":417}],"target_id":"concept.aat.300264336","target_kind":"node","target_sha256":"34e9201fd8568fd3b3ad4386d005662310d177f561d2a3a64f44b4bace7d210d"}],"concept.aat.300264338":[{"id":"assertion.concept.aat.300264338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bardo as defined in the captured Getty AAT record 300264338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bardo as: In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","support":[{"end":588,"quote":"In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","source_id":"getty-aat.300264338","source_sha256":"8868e36ba4c2d4477ba9895bcb93ac1d73428b965d22a704e906b590c115ae46","start":418}],"target_id":"concept.aat.300264338","target_kind":"node","target_sha256":"80bea22c121f99d6cce25c349ce3cfe96b7d6301c3f4fc92660e69de002f78c9"}],"concept.aat.300264356":[{"id":"assertion.concept.aat.300264356","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bhakti as defined in the captured Getty AAT record 300264356","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bhakti as: In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","support":[{"end":819,"quote":"In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","source_id":"getty-aat.300264356","source_sha256":"41ce946dc5f33f6cd40bead70de789b01cdf1b307cbe027e98a65e7461c2af60","start":416}],"target_id":"concept.aat.300264356","target_kind":"node","target_sha256":"3d234517812a7dae78bbdbb86f91460fadd84eebc7cebf9c3bd4dde830988ba8"}],"concept.aat.300264359":[{"id":"assertion.concept.aat.300264359","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"blasphemy as defined in the captured Getty AAT record 300264359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines blasphemy as: An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","support":[{"end":573,"quote":"An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","source_id":"getty-aat.300264359","source_sha256":"7a15369977b6cbf5f7057906aa215e29c1c5446abfa92f2785fa680a9f842435","start":425}],"target_id":"concept.aat.300264359","target_kind":"node","target_sha256":"57ff3bd805d783c3cff96bc07b6f2a32461e3520543dbe8eef726e720fdc0d9f"}],"concept.aat.300264365":[{"id":"assertion.concept.aat.300264365","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"samsara as defined in the captured Getty AAT record 300264365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines samsara as: The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","support":[{"end":742,"quote":"The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","source_id":"getty-aat.300264365","source_sha256":"8d6f430d549a16a4e4733e93d860c1db700a70e3afb8dc8ed28aa511e5fab796","start":417}],"target_id":"concept.aat.300264365","target_kind":"node","target_sha256":"8271f6c94c3f3e13761567d09704edc0ed7cb37208a81fc7b79a9979fc55e9a1"}],"concept.aat.300264368":[{"id":"assertion.concept.aat.300264368","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Augustinianism as defined in the captured Getty AAT record 300264368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Augustinianism as: Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern. Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","support":[{"end":1442,"quote":"Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern.  Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","source_id":"getty-aat.300264368","source_sha256":"48814d04ce837a0087aea9840882f4a1c435fa964bc8c814cf7a7ab1e20da618","start":439}],"target_id":"concept.aat.300264368","target_kind":"node","target_sha256":"e148a5cf1f4c050451b5761972c67bb5c2975933f6285fe5fc12c78aee0fdbdb"}],"concept.aat.300264384":[{"id":"assertion.concept.aat.300264384","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dharma as defined in the captured Getty AAT record 300264384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dharma as: Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","support":[{"end":1694,"quote":"Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","source_id":"getty-aat.300264384","source_sha256":"898cc404827f16def3b35513416518cc282783497df3ecaa8bddace19256f2f5","start":419}],"target_id":"concept.aat.300264384","target_kind":"node","target_sha256":"297cf6df9e31ffcedecfe9713ba2aed06271759481c59b5d3991b34aadc84c62"}],"concept.aat.300264385":[{"id":"assertion.concept.aat.300264385","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"moksha as defined in the captured Getty AAT record 300264385","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines moksha as: In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","support":[{"end":1045,"quote":"In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","source_id":"getty-aat.300264385","source_sha256":"5446d7d2f0b41d8e0f448b2015549472eaf2f94a9fec5726e220b013691be834","start":416}],"target_id":"concept.aat.300264385","target_kind":"node","target_sha256":"eea96fc09d2438d15f5fc6570fe31fa52414004738ac2f60a2e0fc2c26008805"}],"concept.aat.300264386":[{"id":"assertion.concept.aat.300264386","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"trimurti as defined in the captured Getty AAT record 300264386","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines trimurti as: Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","support":[{"end":876,"quote":"Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","source_id":"getty-aat.300264386","source_sha256":"a9cf9905fbff5e264bc45df1934368ddfc8a91c73da86de286d8d9afe8918fb1","start":418}],"target_id":"concept.aat.300264386","target_kind":"node","target_sha256":"5d100725274e4515db344e23ac2ea5a79d51b9c0cc0d7bf15673f0d9bc92900c"}],"concept.aat.300264429":[{"id":"assertion.concept.aat.300264429","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pre-Islamic as defined in the captured Getty AAT record 300264429","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pre-Islamic as: Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","support":[{"end":945,"quote":"Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","source_id":"getty-aat.300264429","source_sha256":"165e4f6951cd2723247997f7bda8cab599d19f2e0ffe308e12aaee5b44e8d212","start":433}],"target_id":"concept.aat.300264429","target_kind":"node","target_sha256":"a555aa1ae439725d1877672b63e1b62c61a2626b92f3b0f8be64dcb471493757"}],"concept.aat.300264475":[{"id":"assertion.concept.aat.300264475","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"group identity as defined in the captured Getty AAT record 300264475","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines group identity as: An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","support":[{"end":672,"quote":"An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","source_id":"getty-aat.300264475","source_sha256":"8578ed6972de1a162ec59e768a80698b7175a31067a94f8bfa797c9cdcbc66f1","start":411}],"target_id":"concept.aat.300264475","target_kind":"node","target_sha256":"0323ab616702f03fac8e5f47ababf279c56dff537d0c139fb74431e86ff127ca"}],"concept.aat.300264482":[{"id":"assertion.concept.aat.300264482","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"consubstantiation as defined in the captured Getty AAT record 300264482","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines consubstantiation as: The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","support":[{"end":844,"quote":"The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","source_id":"getty-aat.300264482","source_sha256":"8fd09846f42928e197561ade5eb2b07999a60fa03883f3fe3314195330d2587e","start":431}],"target_id":"concept.aat.300264482","target_kind":"node","target_sha256":"200b5e3940d2fb1d8c5083eda6bf5cb0a83ace1dea9180c8b3a7acfb760da932"}],"concept.aat.300264486":[{"id":"assertion.concept.aat.300264486","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nirvana as defined in the captured Getty AAT record 300264486","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines nirvana as: Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","support":[{"end":896,"quote":"Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","source_id":"getty-aat.300264486","source_sha256":"cb535e328f32596db5e407db8987584eb9faf84c8bfb3e1b49400d359801ce74","start":420}],"target_id":"concept.aat.300264486","target_kind":"node","target_sha256":"9021e02199367e8ed41996e386b7353417b13ee2d190ec34243db611377d25c2"}],"concept.aat.300264504":[{"id":"assertion.concept.aat.300264504","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Deism as defined in the captured Getty AAT record 300264504","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Deism as: Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","support":[{"end":1505,"quote":"Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","source_id":"getty-aat.300264504","source_sha256":"33f5d068be5c8ab900d999de09f8f127ecc75105aa9535f79209e1e5df60957d","start":411}],"target_id":"concept.aat.300264504","target_kind":"node","target_sha256":"164a68bc6bb834bb579cb36ec4a749df63cb785a7b4a3c3ec55d5e01d9a7aa23"}],"concept.aat.300264527":[{"id":"assertion.concept.aat.300264527","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hindu doctrinal concepts as defined in the captured Getty AAT record 300264527","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hindu doctrinal concepts as: Concepts related to the doctrine of Hinduism.","support":[{"end":473,"quote":"Concepts related to the doctrine of Hinduism.","source_id":"getty-aat.300264527","source_sha256":"e6e33765190936454b973c717396079fa1a80866b42f15ffe100ad9f05ff52ec","start":428}],"target_id":"concept.aat.300264527","target_kind":"node","target_sha256":"57e5ba8ed1258353dad648144b36645315c813c9c9b6c1bb214066fdb8ddfe05"}],"concept.aat.300264528":[{"id":"assertion.concept.aat.300264528","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Christian doctrinal concepts as defined in the captured Getty AAT record 300264528","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Christian doctrinal concepts as: Concepts related to the doctrine of Christianity.","support":[{"end":481,"quote":"Concepts related to the doctrine of Christianity.","source_id":"getty-aat.300264528","source_sha256":"56c658e41e7e69780dcb10051f4608b96a3e493723c9372776a7dc595a1bfdfb","start":432}],"target_id":"concept.aat.300264528","target_kind":"node","target_sha256":"e31864bc073a0e8b485227304406140a557c85b62468aac7917e61495275826b"}],"concept.aat.300264529":[{"id":"assertion.concept.aat.300264529","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Buddhist doctrinal concepts as defined in the captured Getty AAT record 300264529","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Buddhist doctrinal concepts as: Concepts related to the doctrine of Buddhism.","support":[{"end":476,"quote":"Concepts related to the doctrine of Buddhism.","source_id":"getty-aat.300264529","source_sha256":"e624ca41d672af1d04f6bca111a0e9a51861db8c728907e8ac6fcb49db190025","start":431}],"target_id":"concept.aat.300264529","target_kind":"node","target_sha256":"59ec2c3feecf698cde1f328b9b6c0797e3aff669cb059a09597160681461105c"}],"concept.aat.300264530":[{"id":"assertion.concept.aat.300264530","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Jain doctrinal concepts as defined in the captured Getty AAT record 300264530","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Jain doctrinal concepts as: Concepts related to the doctrine of Jainism.","support":[{"end":471,"quote":"Concepts related to the doctrine of Jainism.","source_id":"getty-aat.300264530","source_sha256":"529921c024964451ccf61b6d4569bc94f64509f9122a5bd41c57d66d8c944110","start":427}],"target_id":"concept.aat.300264530","target_kind":"node","target_sha256":"b1affde1802285a648b6a45ac1e7f9ae430eae28dd992600867e58232d11e2d9"}],"concept.aat.300264773":[{"id":"assertion.concept.aat.300264773","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic sculpture styles as defined in the captured Getty AAT record 300264773","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic sculpture styles as: Sculpture styles belonging to Oceanic cultures.","support":[{"end":482,"quote":"Sculpture styles belonging to Oceanic cultures.","source_id":"getty-aat.300264773","source_sha256":"3b57b6f38560e60f3b89c7985722628cfa2effab418dc73b7156e4ced72ad5c4","start":435}],"target_id":"concept.aat.300264773","target_kind":"node","target_sha256":"b7446309314d9a4d4308534782463a6183fcba933e1410a2957b36767156fd56"}],"concept.aat.300264775":[{"id":"assertion.concept.aat.300264775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Oceanic ceramic styles as defined in the captured Getty AAT record 300264775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Oceanic ceramic styles as: Ceramic styles belonging to Oceanic cultures.","support":[{"end":478,"quote":"Ceramic styles belonging to Oceanic cultures.","source_id":"getty-aat.300264775","source_sha256":"1c98bda7503aa9840ba9df049f3ae6862f446723dfa5bf0da7f0f98d9ed835c8","start":433}],"target_id":"concept.aat.300264775","target_kind":"node","target_sha256":"34fe8b187b3d2927c633b2499dbba9df1ebd0fbacbc90970cca4da7be3722819"}],"concept.aat.300264906":[{"id":"assertion.concept.aat.300264906","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Malian as defined in the captured Getty AAT record 300264906","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Malian as: Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","support":[{"end":586,"quote":"Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","source_id":"getty-aat.300264906","source_sha256":"524843ee626c7a4df242de8d10ce03333008045fc0ab345b677a04b79881c80f","start":445}],"target_id":"concept.aat.300264906","target_kind":"node","target_sha256":"099f65e67b57efaa3b6ffa5cddca6883230134ebccc4c834407c20694b7d71af"}],"concept.aat.300265479":[{"id":"assertion.concept.aat.300265479","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rasquachismo as defined in the captured Getty AAT record 300265479","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rasquachismo as: Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","support":[{"end":640,"quote":"Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","source_id":"getty-aat.300265479","source_sha256":"dda669ac376bfc2ee5db9d808b385c9fe087f22b336cbcd28755aa7a56b4c242","start":437}],"target_id":"concept.aat.300265479","target_kind":"node","target_sha256":"0fd3e8eea228d908537fe1c2589e78ebf9a338a2833bd4cd1ad75c0fb065b2ce"}],"concept.aat.300265781":[{"id":"assertion.concept.aat.300265781","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"presence as defined in the captured Getty AAT record 300265781","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines presence as: Concept regarding the condition of being present in front of, or in the same place with a person or thing.","support":[{"end":521,"quote":"Concept regarding the condition of being present in front of, or in the same place with a person or thing.","source_id":"getty-aat.300265781","source_sha256":"a6c4c0b1a09d9f769c6b2a5f992af7fa33b7f12a959e8d8315d7dbca6e344d34","start":415}],"target_id":"concept.aat.300265781","target_kind":"node","target_sha256":"44534d6da55e5b141009c3e8874b290bf941c5827093ed4a54f931c090684ab6"}],"concept.aat.300265797":[{"id":"assertion.concept.aat.300265797","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"divine light as defined in the captured Getty AAT record 300265797","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines divine light as: Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","support":[{"end":664,"quote":"Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","source_id":"getty-aat.300265797","source_sha256":"bad12821be1eaa8e5e7996e1f4cdb82dbf8d1b527b48aa9a770d28bb04232902","start":416}],"target_id":"concept.aat.300265797","target_kind":"node","target_sha256":"a2a5fe24cc1d87eaba0e47e1b92466d2f830eea8ef943e6b043cea7ff9220063"}],"concept.aat.300266052":[{"id":"assertion.concept.aat.300266052","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musique concrète as defined in the captured Getty AAT record 300266052","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musique concrète as: Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","support":[{"end":1288,"quote":"Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","source_id":"getty-aat.300266052","source_sha256":"7f5dcade8d0854b76dc74c5adbebd4b10bac448247f156d006022da3dbbedc18","start":429}],"target_id":"concept.aat.300266052","target_kind":"node","target_sha256":"842af417b0aa8129242300adb77c1c5d7058e8092b6e1400cc3f8ac53a00e7fa"}],"concept.aat.300266054":[{"id":"assertion.concept.aat.300266054","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"serial music as defined in the captured Getty AAT record 300266054","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines serial music as: A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","support":[{"end":575,"quote":"A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","source_id":"getty-aat.300266054","source_sha256":"3c9cfc1aaf7d42b18c893952d4db00dc11d91f2dc400b229d594a36d6ab16e26","start":437}],"target_id":"concept.aat.300266054","target_kind":"node","target_sha256":"98a040ba8d2114f03023e2dd4180a5d0fc45d58624938fb1e9e96b3fb695e74b"}],"concept.aat.300266055":[{"id":"assertion.concept.aat.300266055","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"twelve-tone music as defined in the captured Getty AAT record 300266055","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines twelve-tone music as: A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","support":[{"end":683,"quote":"A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","source_id":"getty-aat.300266055","source_sha256":"b299f359d7ede0f1276629bd20db80e169d51f8276a4430ac7bcefffa9fe3f8d","start":426}],"target_id":"concept.aat.300266055","target_kind":"node","target_sha256":"0d6d82343a74b2db142df25f2e3848cdc0ec6daaaa6f15e35e23355ef247df5f"}],"concept.aat.300266058":[{"id":"assertion.concept.aat.300266058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Monothelitism as defined in the captured Getty AAT record 300266058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Monothelitism as: Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","support":[{"end":843,"quote":"Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","source_id":"getty-aat.300266058","source_sha256":"8afe90f9bbec732978a10f4fbfcf969188e979d60b56b01c24ccf59aa3a46502","start":419}],"target_id":"concept.aat.300266058","target_kind":"node","target_sha256":"29b9e835e4d5c733c9559606653df275615c13e19078ce649e2a0195d242fb82"}],"concept.aat.300266367":[{"id":"assertion.concept.aat.300266367","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"jazz as defined in the captured Getty AAT record 300266367","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines jazz as: Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","support":[{"end":910,"quote":"Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","source_id":"getty-aat.300266367","source_sha256":"bf623b9cb6620e456c85da4ed30eb525b1f68e7168b806c870c410ddf59ce29c","start":429}],"target_id":"concept.aat.300266367","target_kind":"node","target_sha256":"f9f7e6a816a63de537e9767d8b52a9b5bd5c6e6bbaf177c7e33d0adde3f58e52"}],"concept.aat.300266399":[{"id":"assertion.concept.aat.300266399","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neo-Symbolist as defined in the captured Getty AAT record 300266399","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neo-Symbolist as: Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","support":[{"end":660,"quote":"Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","source_id":"getty-aat.300266399","source_sha256":"2bc50c7f097d9515e181fd4ab0ed0f2ee4659d98c97811445dcc826733814adb","start":423}],"target_id":"concept.aat.300266399","target_kind":"node","target_sha256":"93a647f75c4053e4186fe51529d12d6420ff7f5c5db16b6ffae349307b97d6cf"}],"concept.aat.300266481":[{"id":"assertion.concept.aat.300266481","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Middle Eastern as defined in the captured Getty AAT record 300266481","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Middle Eastern as: Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","support":[{"end":619,"quote":"Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","source_id":"getty-aat.300266481","source_sha256":"8f09279f3a7169ec48a3b6c20707a05e78621046fc1298390fa1a896d4b1c31d","start":416}],"target_id":"concept.aat.300266481","target_kind":"node","target_sha256":"52646567b34e37ab6e3cd00369a5da8135006af5bc4d159f43d3920b6fc975da"}],"concept.aat.300266490":[{"id":"assertion.concept.aat.300266490","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hip-hop as defined in the captured Getty AAT record 300266490","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hip-hop as: Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","support":[{"end":842,"quote":"Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","source_id":"getty-aat.300266490","source_sha256":"ba5df72f97bf8367fc745341207af1999b401e1c9344cf75f4ca4e34339d9c9f","start":457}],"target_id":"concept.aat.300266490","target_kind":"node","target_sha256":"cc6ff499406e862267e5ca759af263c68da3f2e666b592b9040210dbf608f7ee"}],"concept.aat.300266573":[{"id":"assertion.concept.aat.300266573","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"electronic music as defined in the captured Getty AAT record 300266573","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines electronic music as: Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","support":[{"end":952,"quote":"Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","source_id":"getty-aat.300266573","source_sha256":"80de8db46a1329e02b4ed7784321bd516d5c6b414995e0b7dadcc07df0f67871","start":441}],"target_id":"concept.aat.300266573","target_kind":"node","target_sha256":"0f747f8b04e6fbec1fccfacc6a1f8aece238f942ffc25c58c1de81f41df9637d"}],"concept.aat.300266744":[{"id":"assertion.concept.aat.300266744","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"space age as defined in the captured Getty AAT record 300266744","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines space age as: Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","support":[{"end":939,"quote":"Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","source_id":"getty-aat.300266744","source_sha256":"8fefe373bd83ef539297d9c60352e4ec1c3fe6b2bcd9c2ddcdf4beba40b767a9","start":459}],"target_id":"concept.aat.300266744","target_kind":"node","target_sha256":"e9dba79b76b1b2932f71c30952ad09527197cf50def6644e55eb9984cf1aef3c"}],"concept.aat.300266783":[{"id":"assertion.concept.aat.300266783","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granular synthesis as defined in the captured Getty AAT record 300266783","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines granular synthesis as: A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","support":[{"end":609,"quote":"A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","source_id":"getty-aat.300266783","source_sha256":"7c256e30b356b12d4eb7cb5a428e71d935b7bd0d5448f71c832b9fd8c81882aa","start":431}],"target_id":"concept.aat.300266783","target_kind":"node","target_sha256":"13a48d8e8a059199e8c1759fa73b98e5ccf5ccf81cea294e8f14851b6551a13e"}],"concept.aat.300266840":[{"id":"assertion.concept.aat.300266840","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pakistani as defined in the captured Getty AAT record 300266840","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pakistani as: Refers to the style and culture of modern Pakistan.","support":[{"end":443,"quote":"Refers to the style and culture of modern Pakistan.","source_id":"getty-aat.300266840","source_sha256":"e4933bf2a88cd163c8edd37d825264cbe8814cb4a6497ca5e217b9310272674b","start":392}],"target_id":"concept.aat.300266840","target_kind":"node","target_sha256":"42c25e368b48de3ee8bcbcc8825c0c060594d47451bcd61a57089b47b002e83c"}],"concept.aat.300310095":[{"id":"assertion.concept.aat.300310095","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"satori as defined in the captured Getty AAT record 300310095","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines satori as: In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","support":[{"end":573,"quote":"In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","source_id":"getty-aat.300310095","source_sha256":"ffe1bba9651aff8fabf7ef285cf6bc710e9260992e32ae8c0e7c535ceb46cb2b","start":419}],"target_id":"concept.aat.300310095","target_kind":"node","target_sha256":"3ebb1d2677fe74533025e6e1b8cab253300a3b39e0d256724238467a33429543"}],"concept.aat.300310539":[{"id":"assertion.concept.aat.300310539","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"shabby chic as defined in the captured Getty AAT record 300310539","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines shabby chic as: A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","support":[{"end":821,"quote":"A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","source_id":"getty-aat.300310539","source_sha256":"3733459ac5139ca1cab8ebe67f86d46f9c6202736f6897482d738b11c8f2c42b","start":411}],"target_id":"concept.aat.300310539","target_kind":"node","target_sha256":"28e0197e7e3ce3463068da9dfcfd7298bbcb7c74acf33737ad9eed5b2441f16f"}],"concept.aat.300310544":[{"id":"assertion.concept.aat.300310544","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"period style as defined in the captured Getty AAT record 300310544","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines period style as: Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","support":[{"end":726,"quote":"Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","source_id":"getty-aat.300310544","source_sha256":"a59820604aa2adacce011a149170ae0d6d5d3fc6a10f7be99c8096570ff19792","start":412}],"target_id":"concept.aat.300310544","target_kind":"node","target_sha256":"0420d0676012e663fa562f4af36b3210671edd49264afeda7473652ab95fe4ae"}],"concept.aat.300310716":[{"id":"assertion.concept.aat.300310716","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mappō as defined in the captured Getty AAT record 300310716","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines mappō as: The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","support":[{"end":983,"quote":"The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","source_id":"getty-aat.300310716","source_sha256":"93690df5a5b8bbb6672483292cc172506923f022ceed35ed0fb514e2eadf9d42","start":418}],"target_id":"concept.aat.300310716","target_kind":"node","target_sha256":"0522b8794034c686e2fe1a01e0033c97081dbc46ad7b6b3215653d1aca654556"}],"concept.aat.300310717":[{"id":"assertion.concept.aat.300310717","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"wabi as defined in the captured Getty AAT record 300310717","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines wabi as: An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","support":[{"end":1031,"quote":"An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","source_id":"getty-aat.300310717","source_sha256":"614e6b73543e1c0af5d167cd1ae5c39d091b56483ac1133df871e5304ec92566","start":408}],"target_id":"concept.aat.300310717","target_kind":"node","target_sha256":"0710e9d9d0bbaf0f7ebdafc407d6f67cc294fdb2402f8e48c028fc8451387e16"}],"concept.aat.300310718":[{"id":"assertion.concept.aat.300310718","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sabi as defined in the captured Getty AAT record 300310718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sabi as: Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","support":[{"end":695,"quote":"Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","source_id":"getty-aat.300310718","source_sha256":"a8fb7b2ae44dbc9e1f2eddaf34cbaa98adef2b16598526e43214881bfc3be435","start":408}],"target_id":"concept.aat.300310718","target_kind":"node","target_sha256":"085deb3ec5f43f48f3a87fe10d4f8ddcd39cc491fec9eda83987b4020f69b35b"}],"concept.aat.300310748":[{"id":"assertion.concept.aat.300310748","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"monolatry as defined in the captured Getty AAT record 300310748","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines monolatry as: The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","support":[{"end":619,"quote":"The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","source_id":"getty-aat.300310748","source_sha256":"1e480a189e47f5b4f1e74d4bfb04b872304a3a7fabb27d481452300aeebd54b9","start":415}],"target_id":"concept.aat.300310748","target_kind":"node","target_sha256":"487f5e5a0f7aae2ed207ce214b523f4a006cd8c1d31f9e31a7fd74148b4c50dc"}],"concept.aat.300311925":[{"id":"assertion.concept.aat.300311925","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plastic arts as defined in the captured Getty AAT record 300311925","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines plastic arts as: In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","support":[{"end":721,"quote":"In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","source_id":"getty-aat.300311925","source_sha256":"14bccafb3c9b172da80f2cc024f879f6cfd53a409abcba83235ed02d95dbfb2d","start":419}],"target_id":"concept.aat.300311925","target_kind":"node","target_sha256":"010cca991d4aa4d50287408e83fe49a6a1de7bcdcd792b74f8271d04c936ec47"}],"concept.aat.300312134":[{"id":"assertion.concept.aat.300312134","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Abyssinian as defined in the captured Getty AAT record 300312134","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Abyssinian as: Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","support":[{"end":739,"quote":"Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","source_id":"getty-aat.300312134","source_sha256":"d61f2a6df4b2bbd4e110a7a81632f668a0f8520c2152d9452201967839e55910","start":449}],"target_id":"concept.aat.300312134","target_kind":"node","target_sha256":"46d5286d5939841547f1cd6d3456e39bafd1a8761bfc5703312c859b4c9a6a91"}],"concept.aat.300312275":[{"id":"assertion.concept.aat.300312275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"old-fashioned as defined in the captured Getty AAT record 300312275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines old-fashioned as: A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","support":[{"end":1004,"quote":"A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","source_id":"getty-aat.300312275","source_sha256":"e3239e56deaf8d8601cae77f13f12129b62d64d0f97225758d26518cf5658ee1","start":413}],"target_id":"concept.aat.300312275","target_kind":"node","target_sha256":"f2827a53161f1b6f3be51a685170166c2e5d764dc429e85efebcd95d038eda05"}],"concept.aat.300312347":[{"id":"assertion.concept.aat.300312347","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"philosophy of art as defined in the captured Getty AAT record 300312347","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines philosophy of art as: The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","support":[{"end":575,"quote":"The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","source_id":"getty-aat.300312347","source_sha256":"fc0a7bd4af14f8302825dcc2c7841be0f016d50438e5eb4d205447c4180a80bb","start":397}],"target_id":"concept.aat.300312347","target_kind":"node","target_sha256":"8cfd3452ba16d8126eae32cfabe9fe6e5f0eb4bf0e0a19ecec6395ca083a4219"}],"concept.aat.300343751":[{"id":"assertion.concept.aat.300343751","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"automotive design as defined in the captured Getty AAT record 300343751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines automotive design as: Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","support":[{"end":628,"quote":"Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","source_id":"getty-aat.300343751","source_sha256":"bde39df25c799ffeb22cb87b4528a8837f1ba45a2aa069c976db53984315cf2b","start":420}],"target_id":"concept.aat.300343751","target_kind":"node","target_sha256":"fe5396315b58ee01928c1851f13ee0af7cec5c78a22bd99e0c4a96d3c15a907a"}],"concept.aat.300375152":[{"id":"assertion.concept.aat.300375152","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Maure as defined in the captured Getty AAT record 300375152","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Maure as: Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","support":[{"end":741,"quote":"Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","source_id":"getty-aat.300375152","source_sha256":"4a8465e3f73906407e0e4eef261cb945d88ec0fb724c0c76009a302557383dac","start":444}],"target_id":"concept.aat.300375152","target_kind":"node","target_sha256":"0c307b9a93b5a232555340297a616e730dbdae2fb9c64feb1af674bef2965072"}],"concept.aat.300375660":[{"id":"assertion.concept.aat.300375660","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Web design as defined in the captured Getty AAT record 300375660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Web design as: Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","support":[{"end":525,"quote":"Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","source_id":"getty-aat.300375660","source_sha256":"751968e2f5d68c5161dbde93a7b06eaea37dc1dc579d061bdac88b9d1fbe9dd8","start":413}],"target_id":"concept.aat.300375660","target_kind":"node","target_sha256":"79b3f35e2e36892571157c66adaeaf1b7051b7ec3d186e1c40922728a39b29a3"}],"concept.aat.300379068":[{"id":"assertion.concept.aat.300379068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vengeance as defined in the captured Getty AAT record 300379068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vengeance as: The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","support":[{"end":501,"quote":"The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","source_id":"getty-aat.300379068","source_sha256":"817916bba374cb1f679e361b596d0c746d71bb3debcbc4c6ca788d82fdc80790","start":393}],"target_id":"concept.aat.300379068","target_kind":"node","target_sha256":"1906acf44f6bec5accdc1ad67d75c6293f4b0e536a2e5ecce02ea1dc478eb456"}],"concept.aat.300379085":[{"id":"assertion.concept.aat.300379085","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"redemption as defined in the captured Getty AAT record 300379085","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines redemption as: Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","support":[{"end":613,"quote":"Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","source_id":"getty-aat.300379085","source_sha256":"a2c86e4f47c9a94d5b63459c4ec3f8a35f896b6efe112d5d2ff54e383182bcb8","start":414}],"target_id":"concept.aat.300379085","target_kind":"node","target_sha256":"1f51b1505a3d436ea3b01f04323ebfbd5a805e80d28d16b1b9d3271055e890d4"}],"concept.aat.300379123":[{"id":"assertion.concept.aat.300379123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"betrayal as defined in the captured Getty AAT record 300379123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines betrayal as: Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","support":[{"end":606,"quote":"Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","source_id":"getty-aat.300379123","source_sha256":"b60c4d4f2f36126d909c95723df93021324fcd80f3899b26b96d4aa0a1e9988a","start":392}],"target_id":"concept.aat.300379123","target_kind":"node","target_sha256":"3d176267619ff1102fe0c195ce70998c66739b14e0030f8ee24ef4e365c80f95"}],"concept.aat.300379137":[{"id":"assertion.concept.aat.300379137","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"heresy as defined in the captured Getty AAT record 300379137","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines heresy as: Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","support":[{"end":575,"quote":"Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","source_id":"getty-aat.300379137","source_sha256":"eb57e472596a7dbb7005f911077c7f9afde9c6b5c16da027c097ed50d55787de","start":422}],"target_id":"concept.aat.300379137","target_kind":"node","target_sha256":"8c7dd816d62e454fca80f0661b6544a0d27d40aaa045d6dbfcd324cd5c52de4f"}],"concept.aat.300379723":[{"id":"assertion.concept.aat.300379723","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hope as defined in the captured Getty AAT record 300379723","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hope as: The expectation of something desired.","support":[{"end":425,"quote":"The expectation of something desired.","source_id":"getty-aat.300379723","source_sha256":"5f8e82f965bc61bf48d2eb037aab7097342b8b44441bafd568d8a47321743b6b","start":388}],"target_id":"concept.aat.300379723","target_kind":"node","target_sha256":"aa63ddadfac0d0e6bb95e0a47301406b9c908e850c517e1c180c2da3fe92e7d6"}],"concept.aat.300379822":[{"id":"assertion.concept.aat.300379822","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"purgatory as defined in the captured Getty AAT record 300379822","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines purgatory as: State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","support":[{"end":738,"quote":"State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as  a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","source_id":"getty-aat.300379822","source_sha256":"e1d7a67bfcb6982531c99b69ef4ffaf13a4e93a74a894e43bc86678dd376bbcc","start":413}],"target_id":"concept.aat.300379822","target_kind":"node","target_sha256":"696b16beec7446744270ae325daae438a498b2ee56df05e446e94f421a70142d"}],"concept.aat.300379854":[{"id":"assertion.concept.aat.300379854","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient European as defined in the captured Getty AAT record 300379854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient European as: Styles, periods, and cultures of ancient Europe.","support":[{"end":476,"quote":"Styles, periods, and cultures of ancient Europe.","source_id":"getty-aat.300379854","source_sha256":"4d8093235ee19edbadb077fabffd622e51dbf0e5176beca14696a37060b8550a","start":428}],"target_id":"concept.aat.300379854","target_kind":"node","target_sha256":"d7c00409000f76c1b20f60d9ba9516620b0fef262c6247e20081b69d238920e3"}],"concept.aat.300380145":[{"id":"assertion.concept.aat.300380145","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cultism as defined in the captured Getty AAT record 300380145","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cultism as: Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","support":[{"end":594,"quote":"Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","source_id":"getty-aat.300380145","source_sha256":"38d24790c03bba5950998aa5788fab9225afae7512f31e084bea035e7adb93b9","start":423}],"target_id":"concept.aat.300380145","target_kind":"node","target_sha256":"794e9a7a8596647e80c43581f2ef8b02f02ac64906b2dac4a6e5d4679218e3ef"}],"concept.aat.300380150":[{"id":"assertion.concept.aat.300380150","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"wisdom as defined in the captured Getty AAT record 300380150","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines wisdom as: Accumulated learning and soundness of judgment in the choice of means and ends.","support":[{"end":470,"quote":"Accumulated  learning and soundness of judgment in the choice of means and ends.","source_id":"getty-aat.300380150","source_sha256":"e1d368310a3a29a153927627de17e4390b35c274ff25e55aaa00b747b13e37fc","start":390}],"target_id":"concept.aat.300380150","target_kind":"node","target_sha256":"88cb89620b19422e38f9a724372a0484c1ca8a83ba8807fedbacab0fc7e1120e"}],"concept.aat.300385955":[{"id":"assertion.concept.aat.300385955","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Antarctic as defined in the captured Getty AAT record 300385955","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Antarctic as: Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","support":[{"end":675,"quote":"Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","source_id":"getty-aat.300385955","source_sha256":"f8caae5716bab77a306898b2d6ce989863906f0b892f598dfdc708427d11154c","start":411}],"target_id":"concept.aat.300385955","target_kind":"node","target_sha256":"64b9550969ec232bcd4bd4d4d91a9fadebc047799239c5ddf1962b645b06b936"}],"concept.aat.300385968":[{"id":"assertion.concept.aat.300385968","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Bangladeshi as defined in the captured Getty AAT record 300385968","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Bangladeshi as: The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","support":[{"end":503,"quote":"The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","source_id":"getty-aat.300385968","source_sha256":"3c6d6c111b26a60daeaee5e42e463aa310d63dda65d7aa7c4ccf29df081b83c9","start":394}],"target_id":"concept.aat.300385968","target_kind":"node","target_sha256":"a1d40265ce14d9c0495400a74db25c5fe31d0e7cd736bdcb3b0d49d03b6f8d8c"}],"concept.aat.300386039":[{"id":"assertion.concept.aat.300386039","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bhūmi as defined in the captured Getty AAT record 300386039","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bhūmi as: The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","support":[{"end":509,"quote":"The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","source_id":"getty-aat.300386039","source_sha256":"f8b727324dbf15e311e89337abee6774b71e7251717ff5de1c88ee38d4902ba5","start":418}],"target_id":"concept.aat.300386039","target_kind":"node","target_sha256":"3c2b309af551dc48153e85450572d0b75c2fb6e3b831bcbe4f4434bdab6bfa64"}],"concept.aat.300386130":[{"id":"assertion.concept.aat.300386130","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hellenic as defined in the captured Getty AAT record 300386130","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hellenic as: The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","support":[{"end":582,"quote":"The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","source_id":"getty-aat.300386130","source_sha256":"1868d0ab8f59c425e7cae885e5933af1d793691bf4505cd8aecd861c707e4f07","start":420}],"target_id":"concept.aat.300386130","target_kind":"node","target_sha256":"d473efce51e10f6536bb815e460fcf1df366d46b1f60f2a1bd6bfede2235703e"}],"concept.aat.300386138":[{"id":"assertion.concept.aat.300386138","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hispanic as defined in the captured Getty AAT record 300386138","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hispanic as: Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","support":[{"end":621,"quote":"Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","source_id":"getty-aat.300386138","source_sha256":"e3f6333991fc609c7cb96f3b97791ade652993bb739599d9a6d776de73c2801c","start":424}],"target_id":"concept.aat.300386138","target_kind":"node","target_sha256":"9219f56aa301f1e59634ebad0af1be71e06ae9668f05d2b0035d1d6effae8d5a"}],"concept.aat.300386148":[{"id":"assertion.concept.aat.300386148","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indochinese as defined in the captured Getty AAT record 300386148","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indochinese as: Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","support":[{"end":560,"quote":"Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","source_id":"getty-aat.300386148","source_sha256":"7caf85fe10c29b502ef1d790fcca03ee20593b939475139a324f2d3944f68dfb","start":398}],"target_id":"concept.aat.300386148","target_kind":"node","target_sha256":"1700c3b5d4711d7441adbb049c9c9a26733417d5d99e699ede6c070ee08ab753"}],"concept.aat.300386510":[{"id":"assertion.concept.aat.300386510","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Reunionese as defined in the captured Getty AAT record 300386510","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Reunionese as: Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","support":[{"end":550,"quote":"Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","source_id":"getty-aat.300386510","source_sha256":"d1b737a2e69f891601ecb678d86c231b8ad5dcb4e9dd6c16c889f2acf7e7d505","start":449}],"target_id":"concept.aat.300386510","target_kind":"node","target_sha256":"7168d6514a9d2de09a7e3520b2cb1bf354e75e5749ac2482ccb2f740d0530c32"}],"concept.aat.300386512":[{"id":"assertion.concept.aat.300386512","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rhodesian as defined in the captured Getty AAT record 300386512","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rhodesian as: Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","support":[{"end":583,"quote":"Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","source_id":"getty-aat.300386512","source_sha256":"5b2f48f28ee1926deb4b7bc97c896ddaa1fceee72a98c1106a86126b9735ea80","start":448}],"target_id":"concept.aat.300386512","target_kind":"node","target_sha256":"c24e43369ab88d2864d27c474630e74b9248a718d68511e2447b35ce0da94df2"}],"concept.aat.300386517":[{"id":"assertion.concept.aat.300386517","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Rwandan as defined in the captured Getty AAT record 300386517","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Rwandan as: Nationality, style, and culture of Rwanda, in central-eastern Africa.","support":[{"end":515,"quote":"Nationality, style, and culture of Rwanda, in central-eastern Africa.","source_id":"getty-aat.300386517","source_sha256":"a74e99cbaebfeadcd35380c39df6ad7bfe1eb35265c9772ea72de67b6e08e441","start":446}],"target_id":"concept.aat.300386517","target_kind":"node","target_sha256":"5c1f573139539cb525aecb67e9e1a61b2d7d4bcd2706acc7ec64f8ba0d444b95"}],"concept.aat.300386542":[{"id":"assertion.concept.aat.300386542","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Taiwanese as defined in the captured Getty AAT record 300386542","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Taiwanese as: Nationality, styles, or culture of Taiwan, East Asia.","support":[{"end":444,"quote":"Nationality, styles, or culture of Taiwan, East Asia.","source_id":"getty-aat.300386542","source_sha256":"5ce1e81399f30933e74ba91c16fb7b977088a5299d69db7359a993193d23963e","start":391}],"target_id":"concept.aat.300386542","target_kind":"node","target_sha256":"1243b51c128efc10ee6010f5c8db9b2585cff717ad6087f874d2e0a5ef1f7902"}],"concept.aat.300386953":[{"id":"assertion.concept.aat.300386953","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tungus as defined in the captured Getty AAT record 300386953","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tungus as: Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","support":[{"end":594,"quote":"Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","source_id":"getty-aat.300386953","source_sha256":"19d27660bcea6cd22fc4009442ad2e28f1b9c869300847357c180511b759f3e8","start":405}],"target_id":"concept.aat.300386953","target_kind":"node","target_sha256":"1765ac0511608633929e949955541f38229f4cc978dc8d5177b0e61763956523"}],"concept.aat.300387114":[{"id":"assertion.concept.aat.300387114","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient American as defined in the captured Getty AAT record 300387114","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient American as: General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","support":[{"end":614,"quote":"General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","source_id":"getty-aat.300387114","source_sha256":"ccb2c8af97f35934f301c053da86903273e91801923befd9421b62ecd36a2445","start":432}],"target_id":"concept.aat.300387114","target_kind":"node","target_sha256":"afac1b539b92aee3c49bc058ae5fa5de3b676be884ed2ef1e8e748f4f9965633"}],"concept.aat.300387734":[{"id":"assertion.concept.aat.300387734","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Turkestani as defined in the captured Getty AAT record 300387734","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Turkestani as: Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","support":[{"end":500,"quote":"Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","source_id":"getty-aat.300387734","source_sha256":"220506778ec25bbea46b793f453c64076a35fa0b050b9ebde82b4e06abf7c1e5","start":395}],"target_id":"concept.aat.300387734","target_kind":"node","target_sha256":"bad2cfef4b60c84e094acfdb462e20c285b6347c2c36d6385552e57255d52084"}],"concept.aat.300387753":[{"id":"assertion.concept.aat.300387753","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Early Netherlandish as defined in the captured Getty AAT record 300387753","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Early Netherlandish as: The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","support":[{"end":543,"quote":"The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","source_id":"getty-aat.300387753","source_sha256":"fe194e444af0e271be1a86b686b9adff98a8abc1a1f0b7f3a1c166d33ffe9e4a","start":431}],"target_id":"concept.aat.300387753","target_kind":"node","target_sha256":"b6026231b47e1418516987781c5eafa24ae064d966cea27781a22916c680a970"}],"concept.aat.300389795":[{"id":"assertion.concept.aat.300389795","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"photography (discipline) as defined in the captured Getty AAT record 300389795","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines photography (discipline) as: The dedicated practice of making photographs as an applied art.","support":[{"end":501,"quote":"The dedicated practice of making photographs as an applied art.","source_id":"getty-aat.300389795","source_sha256":"1db74d87eb9dd43d1361972aee7cd63dfaa27aa833d8d52b742235369a845fdc","start":438}],"target_id":"concept.aat.300389795","target_kind":"node","target_sha256":"e3b8c10d31cb85338b7622f66e55b38cb8c7aafbcb1c1f6ae5f9d875e79cf75d"}],"concept.aat.300391196":[{"id":"assertion.concept.aat.300391196","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"arhats as defined in the captured Getty AAT record 300391196","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines arhats as: Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","support":[{"end":662,"quote":"Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","source_id":"getty-aat.300391196","source_sha256":"b3a6406c2fe0212720da3cec180353a483f4998def5b98c39b4de42b3563c7a3","start":445}],"target_id":"concept.aat.300391196","target_kind":"node","target_sha256":"3a3bf7c0833bce22073cbd2bbb7dcdfadac24fed0b7dd1d173b07fa9ac79d83e"}],"concept.aat.300391250":[{"id":"assertion.concept.aat.300391250","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"geologic time scale as defined in the captured Getty AAT record 300391250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines geologic time scale as: An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","support":[{"end":570,"quote":"An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","source_id":"getty-aat.300391250","source_sha256":"1a1075f1d96b75e417aad840f7d72ff57ec1b0d63601c329ae5aa774d0643d09","start":426}],"target_id":"concept.aat.300391250","target_kind":"node","target_sha256":"228f342b64a6bcacb546f95341e0c14ed3103f88da71900694872e2e841ddf3c"}],"concept.aat.300391392":[{"id":"assertion.concept.aat.300391392","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pre-colonial as defined in the captured Getty AAT record 300391392","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pre-colonial as: General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","support":[{"end":606,"quote":"General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","source_id":"getty-aat.300391392","source_sha256":"566db63c72a2163cc0b163063edd110e65e326736b86e85fae51df5d3cff9ed4","start":412}],"target_id":"concept.aat.300391392","target_kind":"node","target_sha256":"43a9ec247427fabdeb7d501fdda03da31400c81a98a34aa84e464e410929bb35"}],"concept.aat.300391434":[{"id":"assertion.concept.aat.300391434","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ancient Asian as defined in the captured Getty AAT record 300391434","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ancient Asian as: Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","support":[{"end":592,"quote":"Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","source_id":"getty-aat.300391434","source_sha256":"452b2e8f301e904f85291fbf2aa309f37440810d364bfcca3592ca2649626bbe","start":422}],"target_id":"concept.aat.300391434","target_kind":"node","target_sha256":"455d331e457d8f91a657b86d7d9b8681e65c775e102720ae577df653a8473d24"}],"concept.aat.300391475":[{"id":"assertion.concept.aat.300391475","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Archean as defined in the captured Getty AAT record 300391475","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Archean as: On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","support":[{"end":669,"quote":"On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","source_id":"getty-aat.300391475","source_sha256":"e6c19085e6b212bccd3c6bef1706c27f3189d5b1d2ccc46fbf9fd5a1bafba88e","start":404}],"target_id":"concept.aat.300391475","target_kind":"node","target_sha256":"8659ae85db860cd0a4a65d97aa9745cdefbfc9476298295636b07fa8e6b57b64"}],"concept.aat.300391479":[{"id":"assertion.concept.aat.300391479","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dian jing as defined in the captured Getty AAT record 300391479","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dian jing as: Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","support":[{"end":800,"quote":"Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","source_id":"getty-aat.300391479","source_sha256":"a4b1780964c93628a11162b12bb9dee5214031be839febaba698679b1abe86cd","start":413}],"target_id":"concept.aat.300391479","target_kind":"node","target_sha256":"b940d8f45abf18475705bc773359c2f13e6935e09fdb8b9ad623fb1b40630e6f"}],"concept.aat.300391505":[{"id":"assertion.concept.aat.300391505","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Neozoic as defined in the captured Getty AAT record 300391505","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Neozoic as: An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","support":[{"end":500,"quote":"An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","source_id":"getty-aat.300391505","source_sha256":"c3378283008cc5b38f341c4ce7143b168c46d7715db2e41af200426ab2a8df32","start":404}],"target_id":"concept.aat.300391505","target_kind":"node","target_sha256":"9b79f1b2e60d7f330e09142bae45c62ff46b38419da7408453f3416d81b50d4d"}],"concept.aat.300393171":[{"id":"assertion.concept.aat.300393171","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"computer music as defined in the captured Getty AAT record 300393171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines computer music as: Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","support":[{"end":620,"quote":"Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","source_id":"getty-aat.300393171","source_sha256":"4b690c53cd7eb3e129970a89c5c39f3c783346da913b2ca188dd20f1838ac8a0","start":427}],"target_id":"concept.aat.300393171","target_kind":"node","target_sha256":"3864805317db79953155ff3e135944ece7920dcc2f645c25b3c31715b325f78e"}],"concept.aat.300395490":[{"id":"assertion.concept.aat.300395490","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Holy Roman Imperial as defined in the captured Getty AAT record 300395490","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Holy Roman Imperial as: The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","support":[{"end":610,"quote":"The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","source_id":"getty-aat.300395490","source_sha256":"cdeffd078c2b7cd190ebf9e0d074bf8e9277547b7f3c0a137ed403eff12f8ead","start":431}],"target_id":"concept.aat.300395490","target_kind":"node","target_sha256":"c01c4d1fd18ff585b830a83147d52b99cccab1d99db0eb2acd5a3ef9a7e59934"}],"concept.aat.300403938":[{"id":"assertion.concept.aat.300403938","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hutsul as defined in the captured Getty AAT record 300403938","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hutsul as: Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","support":[{"end":527,"quote":"Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","source_id":"getty-aat.300403938","source_sha256":"0eab2bafdd0a150934c9710ffa0a15c7809ed489f0a5b643699d6a58fb1d0858","start":418}],"target_id":"concept.aat.300403938","target_kind":"node","target_sha256":"d175caca91fbbed85e4b6cac5ce2444206cc72149f5a3f1058d882874b2ecdb8"}],"concept.aat.300403945":[{"id":"assertion.concept.aat.300403945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Eolithic as defined in the captured Getty AAT record 300403945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Eolithic as: The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","support":[{"end":545,"quote":"The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","source_id":"getty-aat.300403945","source_sha256":"ee7c07ddd598f5f458daa7ee0acf2a8925de80f7484bc9b9e4f8a98d8c4e9334","start":400}],"target_id":"concept.aat.300403945","target_kind":"node","target_sha256":"9c8b75ca1125d9efc0883ef1a768a8d0f14abb06c9af324b9bfa713d7a899d47"}],"concept.aat.300403979":[{"id":"assertion.concept.aat.300403979","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dramaturgy as defined in the captured Getty AAT record 300403979","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dramaturgy as: Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","support":[{"end":874,"quote":"Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","source_id":"getty-aat.300403979","source_sha256":"34ba2b8c03decc23f4c23f17beae99542bc3bd75bd9b1d87653e789678c83c28","start":410}],"target_id":"concept.aat.300403979","target_kind":"node","target_sha256":"8138ab377b7bdac145322d589b3c3f20381d2d419bfd5e9fde9a30f45bba5e1f"}],"concept.aat.300404618":[{"id":"assertion.concept.aat.300404618","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pure land as defined in the captured Getty AAT record 300404618","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pure land as: In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","support":[{"end":603,"quote":"In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","source_id":"getty-aat.300404618","source_sha256":"c7de65d3b42eba583debd1bf6624f7bf4099fe5687eb3070e2e62e9292e06f98","start":422}],"target_id":"concept.aat.300404618","target_kind":"node","target_sha256":"1befbbedf105af42e0ecbe930a4ce094c8ffeb0b64fb29d7d599eba90dbfeff5"}],"concept.aat.300404619":[{"id":"assertion.concept.aat.300404619","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"buddha field as defined in the captured Getty AAT record 300404619","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines buddha field as: In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","support":[{"end":584,"quote":"In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","source_id":"getty-aat.300404619","source_sha256":"44594aea6546b7a287bb5c27da5776791cbfa6e28a3919e659af9280948221a3","start":425}],"target_id":"concept.aat.300404619","target_kind":"node","target_sha256":"80c31346c9c5f8a26c3473ddd53336dab445a33fb629df67618cfc00384596db"}],"concept.aat.300404625":[{"id":"assertion.concept.aat.300404625","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"absurdism as defined in the captured Getty AAT record 300404625","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines absurdism as: A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","support":[{"end":590,"quote":"A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","source_id":"getty-aat.300404625","source_sha256":"e19f52dd8a6d06a7cf010d00f8cdd6f6feb51655994af97ee7b8d43efe5f8cbe","start":434}],"target_id":"concept.aat.300404625","target_kind":"node","target_sha256":"aef88e0658689ecc400cebccef10fae13b6e0887cc9b54118c991e28beef7dd5"}],"concept.aat.300404702":[{"id":"assertion.concept.aat.300404702","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"karma as defined in the captured Getty AAT record 300404702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines karma as: The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","support":[{"end":789,"quote":"The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","source_id":"getty-aat.300404702","source_sha256":"5a373b991baa6b2d6666138f431bb157597ab3906345f43396977f3fb95f2d68","start":418}],"target_id":"concept.aat.300404702","target_kind":"node","target_sha256":"de8faefdf41cffdbf084161585d53ec2ba4a65d1f1521f130d278d76406e6326"}],"concept.aat.300404706":[{"id":"assertion.concept.aat.300404706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"parinirvāṇa as defined in the captured Getty AAT record 300404706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines parinirvāṇa as: In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","support":[{"end":647,"quote":"In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","source_id":"getty-aat.300404706","source_sha256":"6a8edb222eccdc2c22f6d8cb86974060001ec930afbe73a2b5691e4ffca2ff84","start":413}],"target_id":"concept.aat.300404706","target_kind":"node","target_sha256":"4b3c8e961039858891d134c0a16b3411730d6367ccf1d45566391176cf083dd7"}],"concept.aat.300404712":[{"id":"assertion.concept.aat.300404712","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"uṣṇīsạ as defined in the captured Getty AAT record 300404712","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines uṣṇīsạ as: Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","support":[{"end":562,"quote":"Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","source_id":"getty-aat.300404712","source_sha256":"4e49f37956dcaf3f64797b400aab020223cfe6b57193b010d190ce2942462863","start":445}],"target_id":"concept.aat.300404712","target_kind":"node","target_sha256":"7b6341f645c31c22799454a3949db164f7437d798f4316233b85b236a11e9d4e"}],"concept.aat.300404756":[{"id":"assertion.concept.aat.300404756","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"gates of hell as defined in the captured Getty AAT record 300404756","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines gates of hell as: Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","support":[{"end":670,"quote":"Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","source_id":"getty-aat.300404756","source_sha256":"72900a108df267d70fb99a9934c2d725b8595a5023b19086123467e193500356","start":417}],"target_id":"concept.aat.300404756","target_kind":"node","target_sha256":"1bf2a33e04e0faa1b0bd29318743a08ece13132afdca49efee7885e8c6f49917"}],"concept.aat.300404787":[{"id":"assertion.concept.aat.300404787","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Indic as defined in the captured Getty AAT record 300404787","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Indic as: Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","support":[{"end":816,"quote":"Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","source_id":"getty-aat.300404787","source_sha256":"9a1badd5f0eaf64f406f52563b8b6cf1d4e75085476e76c03a73c9cffc7c93c0","start":388}],"target_id":"concept.aat.300404787","target_kind":"node","target_sha256":"d0bf6e414bd750156bb5d53ad63f0d70b5623348190bd6755cff9fe39866e629"}],"concept.aat.300404836":[{"id":"assertion.concept.aat.300404836","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Archaeological Style as defined in the captured Getty AAT record 300404836","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Archaeological Style as: Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","support":[{"end":628,"quote":"Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","source_id":"getty-aat.300404836","source_sha256":"b3eb2b3c8080879671e30f3cad164f65156fa1545d91edb4532e953650705430","start":427}],"target_id":"concept.aat.300404836","target_kind":"node","target_sha256":"1629aee8b4ee815b6795a1dc4457ddbc1ca184339f7171831998e137550ab073"}],"concept.aat.300410257":[{"id":"assertion.concept.aat.300410257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kachin as defined in the captured Getty AAT record 300410257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kachin as: Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","support":[{"end":573,"quote":"Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","source_id":"getty-aat.300410257","source_sha256":"baad02e2f7f3e48a1d68758abc3a2e1c9fb40929592f3d4f9b55e0ada1c114b7","start":393}],"target_id":"concept.aat.300410257","target_kind":"node","target_sha256":"365c07341851f63376520ce8d095587f1df5ddb507c5d6403d9500355b9627fc"}],"concept.aat.300410285":[{"id":"assertion.concept.aat.300410285","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"evil as defined in the captured Getty AAT record 300410285","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines evil as: The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","support":[{"end":500,"quote":"The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","source_id":"getty-aat.300410285","source_sha256":"615f97eb3215f0578eb3550d5db86d7937750feb725d85b2041ab1ee4a4be3d2","start":388}],"target_id":"concept.aat.300410285","target_kind":"node","target_sha256":"3b7668c47599c6c8db6da48ec5a17481a71470b22f6f4ac06b79c8c8b73482de"}],"concept.aat.300410287":[{"id":"assertion.concept.aat.300410287","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fortitude as defined in the captured Getty AAT record 300410287","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fortitude as: Moral strength or courage, unyielding courage, endurance of pain or adversity.","support":[{"end":471,"quote":"Moral strength or courage, unyielding courage, endurance of pain or adversity.","source_id":"getty-aat.300410287","source_sha256":"71b74deb613acd2bdb8febe488a826d22cd4b9790fe0f5216f4e1de50099bfd2","start":393}],"target_id":"concept.aat.300410287","target_kind":"node","target_sha256":"57ee48254bc4c709d02247e593e59478ab46d749455c8308c1869ca8ea4ef5fd"}],"concept.aat.300410316":[{"id":"assertion.concept.aat.300410316","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fortune as defined in the captured Getty AAT record 300410316","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fortune as: Chance or luck, when regarded as a cause of events and changes in human affairs.","support":[{"end":471,"quote":"Chance or luck, when regarded as a cause of events and changes in human affairs.","source_id":"getty-aat.300410316","source_sha256":"043b473f50e1ba9b49b9829669e1b7489e57d3af0273fdbb6fefedea4e4cb67f","start":391}],"target_id":"concept.aat.300410316","target_kind":"node","target_sha256":"a46c6ee759ce2522010c68c05da5e4dcbb676732dcf0e404302951d57377be7d"}],"concept.aat.300412040":[{"id":"assertion.concept.aat.300412040","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cosmos as defined in the captured Getty AAT record 300412040","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cosmos as: An ordered and harmonious system that comprises the world or universe.","support":[{"end":460,"quote":"An ordered and harmonious system that comprises the world or universe.","source_id":"getty-aat.300412040","source_sha256":"75a4c4ac137ec76d65500c92485044bcb9460257ba2f76d93557ce0792b60e88","start":390}],"target_id":"concept.aat.300412040","target_kind":"node","target_sha256":"4e31a1f70428e6d7bd13120059b261e965b8278cfa0fee128e307ff1bd137da7"}],"concept.aat.300412041":[{"id":"assertion.concept.aat.300412041","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"world as defined in the captured Getty AAT record 300412041","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines world as: The state or realm of existence, particularly of the physical.","support":[{"end":451,"quote":"The state or realm of existence, particularly of the physical.","source_id":"getty-aat.300412041","source_sha256":"60bc900b2060c57640b972108e5dbfcc3797856879d58ada20e9d97128faf2f5","start":389}],"target_id":"concept.aat.300412041","target_kind":"node","target_sha256":"5249f36d0e638ea062d9e34c3457c8866702dbb2ea2842acc30f57ab1539c69d"}],"concept.aat.300412084":[{"id":"assertion.concept.aat.300412084","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"eternity as defined in the captured Getty AAT record 300412084","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines eternity as: Infinite time, which has neither beginning nor end.","support":[{"end":463,"quote":"Infinite time, which has neither beginning nor end.","source_id":"getty-aat.300412084","source_sha256":"ae0881fe1e29dc430c786438597daa77fad299255d4f0d0537ab63108f44a430","start":412}],"target_id":"concept.aat.300412084","target_kind":"node","target_sha256":"c460821715f9c3e1ec127dd64111c8c6d1267df81eae5cacb0632885e04000a6"}],"concept.aat.300412108":[{"id":"assertion.concept.aat.300412108","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rabbinical as defined in the captured Getty AAT record 300412108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rabbinical as: Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","support":[{"end":515,"quote":"Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","source_id":"getty-aat.300412108","source_sha256":"a211ff4cfb9a8070918f869156bdbb6e006842bcb18851f9aab5d701392553ea","start":426}],"target_id":"concept.aat.300412108","target_kind":"node","target_sha256":"cbb10a90b301760480982646b9e7f16727599cb838cae0193c060edf2fe7a51a"}],"concept.aat.300412116":[{"id":"assertion.concept.aat.300412116","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prudence as defined in the captured Getty AAT record 300412116","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines prudence as: Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","support":[{"end":553,"quote":"Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","source_id":"getty-aat.300412116","source_sha256":"a9e864ab126c76f436037d066b26593025c15724669d2d6bd149fb83de24bbcc","start":392}],"target_id":"concept.aat.300412116","target_kind":"node","target_sha256":"f797f4c2769ed46d9993dacfa0e27c97f24962b7a66b6da6571a957c1a4a9e91"}],"concept.aat.300412128":[{"id":"assertion.concept.aat.300412128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"inventiveness as defined in the captured Getty AAT record 300412128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines inventiveness as: The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","support":[{"end":520,"quote":"The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","source_id":"getty-aat.300412128","source_sha256":"6bc52fbbec2822341b15e8b09ebd55f0d480f8a59a8a35ce2afbb07302e6b944","start":397}],"target_id":"concept.aat.300412128","target_kind":"node","target_sha256":"12361457f0c44b05662b67d2cf75385f43d70ff019919d45da18ce4f8522a959"}],"concept.aat.300412140":[{"id":"assertion.concept.aat.300412140","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"good luck as defined in the captured Getty AAT record 300412140","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines good luck as: A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","support":[{"end":594,"quote":"A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","source_id":"getty-aat.300412140","source_sha256":"b5f75b6427c55d85b596e9c9ece9a2bdbd5dea4372168298cba17dbf515eaa9d","start":402}],"target_id":"concept.aat.300412140","target_kind":"node","target_sha256":"496b4f0cd54fdf45b9486fbd21cf6eafe631177f505d14ff009232e804f9bfe9"}],"concept.aat.300412141":[{"id":"assertion.concept.aat.300412141","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bad luck as defined in the captured Getty AAT record 300412141","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bad luck as: A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","support":[{"end":532,"quote":"A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","source_id":"getty-aat.300412141","source_sha256":"9fc393ce26b22335b52bf2c17f3743e274bef80c946d1a75a934b64ba2d8730b","start":401}],"target_id":"concept.aat.300412141","target_kind":"node","target_sha256":"f475c3174f1563909691b81cdd1af5c71e568b8254cae76ed2376276b8f207ee"}],"concept.aat.300417271":[{"id":"assertion.concept.aat.300417271","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"divine judgment as defined in the captured Getty AAT record 300417271","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines divine judgment as: Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","support":[{"end":596,"quote":"Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","source_id":"getty-aat.300417271","source_sha256":"50bfcc22e12b6e7ae1f741ceb18b57411554613cdf1cc0a1d96699342da1278c","start":431}],"target_id":"concept.aat.300417271","target_kind":"node","target_sha256":"b0cd141b08677fa72f1d58e1e7860ea99b24b856cd94286ce4c1c81df6386190"}],"concept.aat.300417325":[{"id":"assertion.concept.aat.300417325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"survival as defined in the captured Getty AAT record 300417325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines survival as: The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","support":[{"end":686,"quote":"The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","source_id":"getty-aat.300417325","source_sha256":"8f49da7a5265e895d63c51dd67272d35096ba98db4c44a211655e7c781d67e52","start":392}],"target_id":"concept.aat.300417325","target_kind":"node","target_sha256":"17c54dbfbd792d292c658ebc805c356abe5611a7c953d0a7bfa4cbb2f60f17cc"}],"concept.aat.300417426":[{"id":"assertion.concept.aat.300417426","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"morality as defined in the captured Getty AAT record 300417426","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines morality as: Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","support":[{"end":594,"quote":"Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","source_id":"getty-aat.300417426","source_sha256":"dbc777f2f6ded998169b8ba9b1b089177c6fe928f4e12c140cdc25a43bfbafa3","start":392}],"target_id":"concept.aat.300417426","target_kind":"node","target_sha256":"c344f2d693f28eb725fb8a0de66e39405cf69f154a5cf6cbdddb490767240bf4"}],"concept.aat.300417578":[{"id":"assertion.concept.aat.300417578","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theater arts as defined in the captured Getty AAT record 300417578","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theater arts as: Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","support":[{"end":636,"quote":"Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","source_id":"getty-aat.300417578","source_sha256":"f1dc8599aa2cb75a65dea8bbf8ae60b7a7adcab32a390ec785712c321abd9971","start":423}],"target_id":"concept.aat.300417578","target_kind":"node","target_sha256":"e923c97cc9f72c01e89b4b5b33bcc478a6ab552f667372e9f72f396c9001ce2d"}],"concept.aat.300417580":[{"id":"assertion.concept.aat.300417580","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vocal arts as defined in the captured Getty AAT record 300417580","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vocal arts as: Discipline involving the study of singing and other vocal expressions, including performance.","support":[{"end":509,"quote":"Discipline involving the study of singing and other vocal expressions, including performance.","source_id":"getty-aat.300417580","source_sha256":"09425fa609609ba2eecd48c09fecc1fa749255275f798711a084c2525234b474","start":416}],"target_id":"concept.aat.300417580","target_kind":"node","target_sha256":"f5c3dae04dee37f17ac4a4c19305274b4faee89b316a482e649c94c5ea5370a0"}],"concept.aat.300417581":[{"id":"assertion.concept.aat.300417581","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"dance (discipline) as defined in the captured Getty AAT record 300417581","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dance (discipline) as: Discipline involving the study of dancing and movement, including performance.","support":[{"end":507,"quote":"Discipline involving the study of dancing and movement, including performance.","source_id":"getty-aat.300417581","source_sha256":"8ab27d8f5dd9592e3a95c6c39669cfb3631acfceb7cbc9dd57a4f4efef1b1498","start":429}],"target_id":"concept.aat.300417581","target_kind":"node","target_sha256":"110b0c39e148b83790551898056a4a0d22511a858e9e6fce654c9a17bd4a6d5a"}],"concept.aat.300417584":[{"id":"assertion.concept.aat.300417584","scope":{"assumptions":"Attributed controlled-vocabulary definition; added as a source-hierarchy intermediate for navigation","population":"music (discipline) as defined in the captured Getty AAT record 300417584","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music (discipline) as: The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","support":[{"end":679,"quote":"The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","source_id":"getty-aat.300417584","source_sha256":"ff9beda6f7e0fee3f5c8989efc7b28bb843367fce4e97646c15c62f363954b9a","start":429}],"target_id":"concept.aat.300417584","target_kind":"node","target_sha256":"20b9d4db89931113f4a10f3b9d717dc25c19150ee4ae7158e08d41cfba830528"}],"concept.aat.300417616":[{"id":"assertion.concept.aat.300417616","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musical theater as defined in the captured Getty AAT record 300417616","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musical theater as: Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","support":[{"end":528,"quote":"Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","source_id":"getty-aat.300417616","source_sha256":"2c01b13fb2ab6ac12eab6df21087489d2fad3d51cba3f90419eda881949715a5","start":440}],"target_id":"concept.aat.300417616","target_kind":"node","target_sha256":"c4d238b66b68d94feec6f9ba74ca7902f3412a12a3b14cbd4315473e463bb6fd"}],"concept.aat.300417661":[{"id":"assertion.concept.aat.300417661","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"garden design as defined in the captured Getty AAT record 300417661","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines garden design as: Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","support":[{"end":954,"quote":"Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","source_id":"getty-aat.300417661","source_sha256":"74e6d973f74986fb5dbac1214dfb5d3573cf95177a00b1e5e64b482b8e58d728","start":416}],"target_id":"concept.aat.300417661","target_kind":"node","target_sha256":"7f6cd074cb7c3a6194770dbcb9a078658d902b4e4eb1c25abc25523ad460ee5e"}],"concept.aat.300417674":[{"id":"assertion.concept.aat.300417674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"African diaspora as defined in the captured Getty AAT record 300417674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines African diaspora as: Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","support":[{"end":682,"quote":"Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","source_id":"getty-aat.300417674","source_sha256":"ae5807558900b73264315e6d50b22b99b430a63f7161cfd0f42fdc581e13a2c6","start":459}],"target_id":"concept.aat.300417674","target_kind":"node","target_sha256":"89c6d5238ac73991ed6eb49afa668ddde0b5f5355a73f9b939989946ca8ccf16"}],"concept.aat.300417961":[{"id":"assertion.concept.aat.300417961","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rhythm and blues as defined in the captured Getty AAT record 300417961","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines rhythm and blues as: Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","support":[{"end":726,"quote":"Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","source_id":"getty-aat.300417961","source_sha256":"a69b5dc82648c771bb8d6fb0cc765c4fa18ac305c3e21a5a88c2c044303099b9","start":441}],"target_id":"concept.aat.300417961","target_kind":"node","target_sha256":"ad9b8c32063334833f4e2932b62525023664aa63a340c58033563cdde4761e06"}],"concept.aat.300435123":[{"id":"assertion.concept.aat.300435123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"jewelry design as defined in the captured Getty AAT record 300435123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines jewelry design as: Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","support":[{"end":527,"quote":"Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","source_id":"getty-aat.300435123","source_sha256":"ead2459a00550f4576e799021b6ddaa9f0aac71150ffab857caa5b7a813cb924","start":417}],"target_id":"concept.aat.300435123","target_kind":"node","target_sha256":"656794096063c1f204b259000d1397d64098cdc5ebff7b88e6cbf73c05d18470"}],"concept.aat.300435128":[{"id":"assertion.concept.aat.300435128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"set design as defined in the captured Getty AAT record 300435128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines set design as: The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","support":[{"end":578,"quote":"The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","source_id":"getty-aat.300435128","source_sha256":"552ff88a62b350b5d689a7af110b6e7b6a9a0d7c4f0378a9a5491fd233c66a69","start":413}],"target_id":"concept.aat.300435128","target_kind":"node","target_sha256":"4ed76e7cf03346da7b3286b3985e842ce8269ee115fd2e29db938f1da8b3b5de"}],"concept.aat.300435227":[{"id":"assertion.concept.aat.300435227","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"furniture design as defined in the captured Getty AAT record 300435227","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines furniture design as: Practice and discipline of designing furniture.","support":[{"end":466,"quote":"Practice and discipline of designing furniture.","source_id":"getty-aat.300435227","source_sha256":"276191996744979c79e57d8b058dd1c9282f67650d218ac9b72165bb7cc35ac4","start":419}],"target_id":"concept.aat.300435227","target_kind":"node","target_sha256":"77712d6b04d0e0a29504d9bafa082fefc71d108e001724898e745ff9f6e869c2"}],"concept.aat.300435243":[{"id":"assertion.concept.aat.300435243","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"textile design as defined in the captured Getty AAT record 300435243","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines textile design as: Practice and discipline of designing textiles.","support":[{"end":463,"quote":"Practice and discipline of designing textiles.","source_id":"getty-aat.300435243","source_sha256":"637adcefaab307bc2e6921405ddc159168c1c843a638dfcdf1d5a823edcc7d4d","start":417}],"target_id":"concept.aat.300435243","target_kind":"node","target_sha256":"5519c7cfaa9aea485135bc9249882fdce34d7445e71ff83e6063eb7761e95a8d"}],"concept.aat.300435308":[{"id":"assertion.concept.aat.300435308","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fate as defined in the captured Getty AAT record 300435308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines fate as: The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","support":[{"end":582,"quote":"The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","source_id":"getty-aat.300435308","source_sha256":"4503ae982470ebb6171a6e86f754486e2bb0c1063063f144792b8f053a3a2948","start":388}],"target_id":"concept.aat.300435308","target_kind":"node","target_sha256":"7a492275c73555e56b5455d195666c44ad241e948bdbcdf04540ff8f2a2b2100"}],"concept.aat.300435319":[{"id":"assertion.concept.aat.300435319","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"apotheosis as defined in the captured Getty AAT record 300435319","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines apotheosis as: Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","support":[{"end":516,"quote":"Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","source_id":"getty-aat.300435319","source_sha256":"10489e57bf26e782765db026b662ca819b5eac7ed247b8948fb1b511d001e0b9","start":414}],"target_id":"concept.aat.300435319","target_kind":"node","target_sha256":"0a6f4d2a96157b16806e8fe83dc68df8e17b528e38c3e4539d9f977679fc52c5"}],"concept.aat.300438472":[{"id":"assertion.concept.aat.300438472","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hózhó as defined in the captured Getty AAT record 300438472","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hózhó as: Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","support":[{"end":959,"quote":"Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","source_id":"getty-aat.300438472","source_sha256":"22f2371706dcba97cdff68dd438c551fde9caf06fcc4e66b3377cbc66d454a21","start":389}],"target_id":"concept.aat.300438472","target_kind":"node","target_sha256":"282910b12bf36fdde94bb98c06be70cd3616ed102d881b8659f90222cb8222e8"}],"concept.aat.300438552":[{"id":"assertion.concept.aat.300438552","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dhyana as defined in the captured Getty AAT record 300438552","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines dhyana as: In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","support":[{"end":516,"quote":"In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","source_id":"getty-aat.300438552","source_sha256":"daa30f1084b151c8e691316184a4bb505e3291f093427336aedbe4042c7cc390","start":419}],"target_id":"concept.aat.300438552","target_kind":"node","target_sha256":"e57f344f668468ffa073bbad70c45bc66f992a2517e0cdec5fac129066e044d4"}],"concept.aat.300438813":[{"id":"assertion.concept.aat.300438813","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Australasian as defined in the captured Getty AAT record 300438813","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Australasian as: The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","support":[{"end":531,"quote":"The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","source_id":"getty-aat.300438813","source_sha256":"d5d0d536fc68f5a034ff8e3da9e7d13723f0d1a4b2f46bfda7022538a237e558","start":423}],"target_id":"concept.aat.300438813","target_kind":"node","target_sha256":"c599d8d80c4f6e189e2d664937efe95f526738faa69e6f943352ba3cd709d9fb"}],"concept.aat.300443463":[{"id":"assertion.concept.aat.300443463","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Glacial as defined in the captured Getty AAT record 300443463","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Glacial as: Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","support":[{"end":588,"quote":"Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","source_id":"getty-aat.300443463","source_sha256":"8637b1861f9db3ee12c95d730588fa2a6c677f6d9ac2cf45543d14ca8be2e46e","start":419}],"target_id":"concept.aat.300443463","target_kind":"node","target_sha256":"b3b52a1540b455b81b479657a37f0abe388fc318e1c01f9a92a53e81e0f03e9b"}],"concept.aat.300444301":[{"id":"assertion.concept.aat.300444301","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Global as defined in the captured Getty AAT record 300444301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Global as: Styles, periods, and cultures that cross boundaries of multiple nations and regions.","support":[{"end":492,"quote":"Styles, periods, and cultures that cross boundaries of multiple nations and regions.","source_id":"getty-aat.300444301","source_sha256":"8f0cf2ba82b57023cf7ca5bbc99262cfeb9a43deeb510e8b2e91cad02c2c0f93","start":408}],"target_id":"concept.aat.300444301","target_kind":"node","target_sha256":"6ebceab7f47beb22a04b2b527ac19f66ab8ad62fa43bd727a33bcc79923d07e0"}],"concept.aat.300444302":[{"id":"assertion.concept.aat.300444302","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dutch Colonial Revival as defined in the captured Getty AAT record 300444302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dutch Colonial Revival as: Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","support":[{"end":553,"quote":"Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","source_id":"getty-aat.300444302","source_sha256":"90547b913b508ae23db70b888a76f7460a6d24372b0fbe4541e67a539aea4688","start":432}],"target_id":"concept.aat.300444302","target_kind":"node","target_sha256":"ad75db3e78dd8c9923948e5cc29097c6d4f60f9d69da9f9b52817fea2440f18c"}],"concept.aat.300444311":[{"id":"assertion.concept.aat.300444311","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plantation house style as defined in the captured Getty AAT record 300444311","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines plantation house style as: Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","support":[{"end":702,"quote":"Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","source_id":"getty-aat.300444311","source_sha256":"821f8cb10ee26274f28d1b441e44ba4556cccc3364b5719034abce46fed22450","start":422}],"target_id":"concept.aat.300444311","target_kind":"node","target_sha256":"16bebe3f35ffbebc362112770c102d4c6377f76c53c88126984448945b60757a"}],"concept.aat.300444313":[{"id":"assertion.concept.aat.300444313","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Late Modernism as defined in the captured Getty AAT record 300444313","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Late Modernism as: General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","support":[{"end":539,"quote":"General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","source_id":"getty-aat.300444313","source_sha256":"5888953a7276b929e37ca436d524b97b7e3d6960c9a5746256a9a30aa1ded499","start":424}],"target_id":"concept.aat.300444313","target_kind":"node","target_sha256":"f951be946366b7b0862011ab34b51c9d27dfc7cc42c46cfb843ec18cb652cf52"}],"concept.aat.300444321":[{"id":"assertion.concept.aat.300444321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Post-1945 as defined in the captured Getty AAT record 300444321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Post-1945 as: General term for styles and periods from post-1945.","support":[{"end":510,"quote":"General term for styles and periods from post-1945.","source_id":"getty-aat.300444321","source_sha256":"efa3db868ec0e3c94ce10891f2b5e64431f00e1af12395093e5f7465363834a4","start":459}],"target_id":"concept.aat.300444321","target_kind":"node","target_sha256":"e02d9b55e79e16154dff9be0d1bdd14026ae731de5e2c1a51fb0c1c68de4b32c"}],"concept.aat.300444342":[{"id":"assertion.concept.aat.300444342","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"amalgam style as defined in the captured Getty AAT record 300444342","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines amalgam style as: Style that combines recognizable elements of two or more defined styles.","support":[{"end":492,"quote":"Style that combines recognizable elements of two or more defined styles.","source_id":"getty-aat.300444342","source_sha256":"0a0d8aa5bfe9897a2acf2f49faa1e73cb0b8af0b502536b639480c10c1e5bf0a","start":420}],"target_id":"concept.aat.300444342","target_kind":"node","target_sha256":"68009c470cdfc94e0a3404625f955c73265dbc6ea67bba73ab11cacf1080a4ff"}],"concept.aat.300444345":[{"id":"assertion.concept.aat.300444345","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ranch style as defined in the captured Getty AAT record 300444345","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ranch style as: Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","support":[{"end":543,"quote":"Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","source_id":"getty-aat.300444345","source_sha256":"fa9bb6ed631f1e06ea851de00b52b63d65d4854ae8790904673c2c16253280cc","start":411}],"target_id":"concept.aat.300444345","target_kind":"node","target_sha256":"a29b25720d0cca993fa2a57dc290be95d87859b5ad93ed6bce0bb0320917d033"}],"concept.aat.300444354":[{"id":"assertion.concept.aat.300444354","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bungalow style as defined in the captured Getty AAT record 300444354","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines bungalow style as: Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","support":[{"end":619,"quote":"Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","source_id":"getty-aat.300444354","source_sha256":"fbbfbc34e0ced558a7833669cabb992b6107a19cce1a01c7ebef3ab401b9ce07","start":414}],"target_id":"concept.aat.300444354","target_kind":"node","target_sha256":"a5e47d081319b83d2f25b905781dd2a8549a8af189664da5465eb02747d44e6f"}],"concept.aat.300444901":[{"id":"assertion.concept.aat.300444901","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"military style as defined in the captured Getty AAT record 300444901","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines military style as: Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","support":[{"end":522,"quote":"Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","source_id":"getty-aat.300444901","source_sha256":"f29dac6c21738992be787315831b52b5f592590a9569d447af2d3eca1e8a6726","start":414}],"target_id":"concept.aat.300444901","target_kind":"node","target_sha256":"c7ea9e19195beb1f77a0d3c6d2eac55d1a8ce0c75dedeb614fe342bd488f8f17"}],"concept.aat.300444994":[{"id":"assertion.concept.aat.300444994","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Kingdom of Jerusalem as defined in the captured Getty AAT record 300444994","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Kingdom of Jerusalem as: Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","support":[{"end":558,"quote":"Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","source_id":"getty-aat.300444994","source_sha256":"b28b79a942dc4477fdcf7469bc9737afc59f967a198115afb9744fd736e1a140","start":438}],"target_id":"concept.aat.300444994","target_kind":"node","target_sha256":"c15e227b4e0dc0e2564bf823f64de352c202ff3bf527b881b293adc9faabb75f"}],"concept.aat.300444999":[{"id":"assertion.concept.aat.300444999","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Post-Colonial as defined in the captured Getty AAT record 300444999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Post-Colonial as: Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","support":[{"end":705,"quote":"Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","source_id":"getty-aat.300444999","source_sha256":"a6cd0d9ff95ce568f1faeafc29174f87b868d28115f43e31ec6295622a5a7973","start":420}],"target_id":"concept.aat.300444999","target_kind":"node","target_sha256":"e6477dcdf30c015881bd38018637f8bc67843b40cc5237e81e04d489d5d5f5be"}],"concept.aat.300446915":[{"id":"assertion.concept.aat.300446915","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cāraṇa as defined in the captured Getty AAT record 300446915","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cāraṇa as: In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","support":[{"end":547,"quote":"In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","source_id":"getty-aat.300446915","source_sha256":"aeda69b19a0ea442d3359047e43353b51e23bf7b21671dbef12f0d1f7a1c7550","start":415}],"target_id":"concept.aat.300446915","target_kind":"node","target_sha256":"85b5ce587edc4940f78d15c053c0281e4f6a28dfa6113a9f23366adb2af47ee5"}],"concept.aat.300447138":[{"id":"assertion.concept.aat.300447138","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vāstuvidyā as defined in the captured Getty AAT record 300447138","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines vāstuvidyā as: In Indian architecture, a science of building, architecture.","support":[{"end":479,"quote":"In Indian architecture, a science of building, architecture.","source_id":"getty-aat.300447138","source_sha256":"5c73544aa22faed0ed885ba28753fc5535fd3c60704b3bc498d8c1ea997620b8","start":419}],"target_id":"concept.aat.300447138","target_kind":"node","target_sha256":"1135f1bf4b50eeec37cf834fa7221be3c0d9db22b49eb8acdd7aaed113f52b51"}],"concept.aat.300447407":[{"id":"assertion.concept.aat.300447407","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pañcadēvōpāsanā as defined in the captured Getty AAT record 300447407","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pañcadēvōpāsanā as: Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","support":[{"end":493,"quote":"Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","source_id":"getty-aat.300447407","source_sha256":"364f4a2e47bf1a81b72c7127377cbe00ed774edc0a5aa4308c7d68eaafaff830","start":425}],"target_id":"concept.aat.300447407","target_kind":"node","target_sha256":"ecab22180ed262b930e96839d7cbd69501404947b91e9db1c69c17aa01c6dab3"}],"concept.aat.300449137":[{"id":"assertion.concept.aat.300449137","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ignorance as defined in the captured Getty AAT record 300449137","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ignorance as: The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","support":[{"end":495,"quote":"The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","source_id":"getty-aat.300449137","source_sha256":"1976b2354f24f593123c844b44bf12128757edf92d4a739b46143b8f5433228b","start":393}],"target_id":"concept.aat.300449137","target_kind":"node","target_sha256":"1076476b58f838ddd59c9df2d873ce30e1dff989f48187f7d8305d26b5e32f51"}],"concept.aat.300451043":[{"id":"assertion.concept.aat.300451043","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"private devotion as defined in the captured Getty AAT record 300451043","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines private devotion as: The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","support":[{"end":617,"quote":"The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","source_id":"getty-aat.300451043","source_sha256":"0a8f73efe1a313190079bac0659de794dd03032c3507a1e05342c32b527907d3","start":432}],"target_id":"concept.aat.300451043","target_kind":"node","target_sha256":"cba2078a4e1b2295761210cbb0585a0b86c778f7283b44bd4695ee41dd82c57c"}],"concept.aat.300451359":[{"id":"assertion.concept.aat.300451359","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immortality as defined in the captured Getty AAT record 300451359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines immortality as: In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","support":[{"end":613,"quote":"In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","source_id":"getty-aat.300451359","source_sha256":"b219db849815bc11600077407e745e63ac9a7993d4cb313b8efd05d400a7bc15","start":395}],"target_id":"concept.aat.300451359","target_kind":"node","target_sha256":"1736ae8453cc04577f80676b1740574b479bf2729819b8735557eadded137eb8"}],"concept.aat.300451673":[{"id":"assertion.concept.aat.300451673","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Noh as defined in the captured Getty AAT record 300451673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Noh as: Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","support":[{"end":799,"quote":"Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","source_id":"getty-aat.300451673","source_sha256":"9337f1dc556d122d34e5dd0e2cdef4f344ec697dff2a824f13f886afcfb9fdf7","start":415}],"target_id":"concept.aat.300451673","target_kind":"node","target_sha256":"e8ead6f91a6c6bb3114dc9c76abae89a12808962a892b1830508c0b7bdd97fd0"}],"concept.aat.300457703":[{"id":"assertion.concept.aat.300457703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Ibero-American as defined in the captured Getty AAT record 300457703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Ibero-American as: It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","support":[{"end":860,"quote":"It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","source_id":"getty-aat.300457703","source_sha256":"cac7d0e8b2e86348c087f860c9675526039b8001df80c6800c47cdf92748f73f","start":430}],"target_id":"concept.aat.300457703","target_kind":"node","target_sha256":"bffefe36de812816d3ddadf30e371a588c9c2cec1068ddac569337b633351cff"}],"concept.aat.300457715":[{"id":"assertion.concept.aat.300457715","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Pan-American as defined in the captured Getty AAT record 300457715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Pan-American as: Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","support":[{"end":968,"quote":"Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","source_id":"getty-aat.300457715","source_sha256":"09d1a4b3e25c6461432b8806c35fb421bbbc23d66d4e373812f1734f2f9c588b","start":428}],"target_id":"concept.aat.300457715","target_kind":"node","target_sha256":"cff9547c543ec3f1428b5420c04ec47a887994072666163999d635d8a0611083"}],"concept.aat.300457738":[{"id":"assertion.concept.aat.300457738","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Hispanic-American as defined in the captured Getty AAT record 300457738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Hispanic-American as: Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","support":[{"end":756,"quote":"Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","source_id":"getty-aat.300457738","source_sha256":"b83965cae9c61c5b1d45f31892b98094f90a924f9031bc0ae79464cedf6b7074","start":433}],"target_id":"concept.aat.300457738","target_kind":"node","target_sha256":"d6a23cb50411b3cc54eb1011fd33ac49c6523287dbc7aa711238241fea3ed0be"}],"concept.aat.300457792":[{"id":"assertion.concept.aat.300457792","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"communication design as defined in the captured Getty AAT record 300457792","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines communication design as: Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","support":[{"end":1041,"quote":"Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","source_id":"getty-aat.300457792","source_sha256":"73d29522e7f29af4647489ce0859413599d1f9bf3285cb1d01124a2f801edcbb","start":423}],"target_id":"concept.aat.300457792","target_kind":"node","target_sha256":"0395a1230b28f783c1acdde128e3214651cf6e49ad4d3f1c688f69f992ab17c9"}],"concept.aat.300457805":[{"id":"assertion.concept.aat.300457805","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hagiolatry as defined in the captured Getty AAT record 300457805","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines hagiolatry as: The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","support":[{"end":556,"quote":"The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","source_id":"getty-aat.300457805","source_sha256":"8e0a6d7f62544058eec5ee238c96c8b3bed9169f888359372216de08ebae8e48","start":403}],"target_id":"concept.aat.300457805","target_kind":"node","target_sha256":"deb390d0c2e72e4c9d54e0f74cdf477bc430bdd768715ece4afbef59dd58871b"}],"concept.aat.300458684":[{"id":"assertion.concept.aat.300458684","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mazahuahcan as defined in the captured Getty AAT record 300458684","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mazahuahcan as: Refers to the conception of the west.","support":[{"end":452,"quote":"Refers to the conception of the west.","source_id":"getty-aat.300458684","source_sha256":"14d08f8d9f1b33fed1070ab24363889cab36e7da2f785a32efb063ce3edb0582","start":415}],"target_id":"concept.aat.300458684","target_kind":"node","target_sha256":"13be6a8744497a853a6b8b598d46e0ddf287df93adea9f300eb55ce9180a0ff8"}],"concept.aat.300458696":[{"id":"assertion.concept.aat.300458696","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Mictlampan as defined in the captured Getty AAT record 300458696","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Mictlampan as: Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","support":[{"end":540,"quote":"Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","source_id":"getty-aat.300458696","source_sha256":"52d647f6f0e40142dc85362e0546798843f7101793d2d5a9a40fe53bc26d27b7","start":414}],"target_id":"concept.aat.300458696","target_kind":"node","target_sha256":"aec2821a0d1096941a7074dd59007ec0bfd2bbb11fa3ed4c500f0fa276d3f85d"}],"concept.aat.300458697":[{"id":"assertion.concept.aat.300458697","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Tlalocan as defined in the captured Getty AAT record 300458697","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Tlalocan as: In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","support":[{"end":502,"quote":"In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","source_id":"getty-aat.300458697","source_sha256":"6306d7f5f66c8befa8d8a05349ba1a839454989dde98a2a8c909767861007185","start":412}],"target_id":"concept.aat.300458697","target_kind":"node","target_sha256":"55459bfe3dc1014ffebbe8bac03102e6394efd0df53f1faa487ed62bfcce36cb"}],"concept.aat.300458718":[{"id":"assertion.concept.aat.300458718","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Cihuatlampan as defined in the captured Getty AAT record 300458718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Cihuatlampan as: Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","support":[{"end":548,"quote":"Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","source_id":"getty-aat.300458718","source_sha256":"db9eb4440ad21933e4c3d36c5f6060e9964a093ccf620050b22a9380246eadf3","start":416}],"target_id":"concept.aat.300458718","target_kind":"node","target_sha256":"ed572187b6a316cf9aa33f13241b651ce670b89f8a350bc5644f9f53da1fe72e"}],"concept.aat.300458936":[{"id":"assertion.concept.aat.300458936","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Jarai as defined in the captured Getty AAT record 300458936","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Jarai as: The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","support":[{"end":1140,"quote":"The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","source_id":"getty-aat.300458936","source_sha256":"dd66ebf07d457951e3dd43cae580aea930ac27f01c0f73b27ad343d9c075af7d","start":392}],"target_id":"concept.aat.300458936","target_kind":"node","target_sha256":"22315d88b9b25d558e27779ffc1d66defdd1d5f095b0d93c9eda444c1bd94bc1"}],"concept.aat.300458937":[{"id":"assertion.concept.aat.300458937","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Brao as defined in the captured Getty AAT record 300458937","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Brao as: The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","support":[{"end":1209,"quote":"The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","source_id":"getty-aat.300458937","source_sha256":"320b0bed4ea653a560828d896b53a5edd926d726d35a534914a3184674bacc14","start":391}],"target_id":"concept.aat.300458937","target_kind":"node","target_sha256":"70a83fb9ab5e5a2db0f004a88b3f67c1a79008fda6b57c3bb6ad67de064ba974"}],"concept.aat.300458939":[{"id":"assertion.concept.aat.300458939","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Dayak as defined in the captured Getty AAT record 300458939","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Dayak as: The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","support":[{"end":996,"quote":"The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","source_id":"getty-aat.300458939","source_sha256":"fedf68f785a3433fa21e3f4dd5ac68536a61970e674b63e81991246b2ed3872d","start":392}],"target_id":"concept.aat.300458939","target_kind":"node","target_sha256":"6370ac3c40205a633dee7fa2cffa040d401b3e0a6c881db5c65147fb646631a9"}],"concept.aat.300458945":[{"id":"assertion.concept.aat.300458945","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Akha as defined in the captured Getty AAT record 300458945","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Akha as: The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","support":[{"end":903,"quote":"The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","source_id":"getty-aat.300458945","source_sha256":"ac258b394002b11bf5c737b84c2dc20973d84fe9ba71040a33c743279900fca7","start":391}],"target_id":"concept.aat.300458945","target_kind":"node","target_sha256":"274c0479e30c6bfd89acf501c96fe5bbf8454a932449a0a0ef2c739dd24eb568"}],"concept.aat.300458946":[{"id":"assertion.concept.aat.300458946","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Batak as defined in the captured Getty AAT record 300458946","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Batak as: The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","support":[{"end":1052,"quote":"The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","source_id":"getty-aat.300458946","source_sha256":"1a64efcb05bdb9d2c1b9096a26d9b36afc5c14560ab6326b3b20cdd5143ac209","start":392}],"target_id":"concept.aat.300458946","target_kind":"node","target_sha256":"ff9420adede23212d5fc6a210df3382393b499cb1f181aa285399c0a98208a90"}],"concept.aat.300458960":[{"id":"assertion.concept.aat.300458960","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Assamese as defined in the captured Getty AAT record 300458960","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Assamese as: The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","support":[{"end":1088,"quote":"The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","source_id":"getty-aat.300458960","source_sha256":"d1abff4470f1187ced11a3e2a5591963d11ee50d52774b3b5e688a6840f21017","start":391}],"target_id":"concept.aat.300458960","target_kind":"node","target_sha256":"d5b3eb1aac5ea88d5af8c1c20fa31154d1e7ae34abcbd21a2cf99fc995b5b688"}],"concept.aat.300458962":[{"id":"assertion.concept.aat.300458962","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Magars as defined in the captured Getty AAT record 300458962","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines Magars as: The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","support":[{"end":1108,"quote":"The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","source_id":"getty-aat.300458962","source_sha256":"b43da8e6e1d71f3e10ae2af58adbf3c5be3843985fa2fa5268f247eac014eb67","start":389}],"target_id":"concept.aat.300458962","target_kind":"node","target_sha256":"2a24f5e05fdbd7e21890593a39980ff52d1fbd31bd6adbb5ba69e0092d45e62e"}],"concept.axion-photon-conversion":[{"id":"assertion.complete.concept.axion-photon-conversion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX paper describes inverse Primakoff conversion: a static magnetic field provides a channel for an axion to convert into a photon, whose resulting power can be resonantly enhanced in a microwave cavity. This is the proposed detection mechanism, not an observed axion signal.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"concept.axion-photon-conversion","target_kind":"node","target_sha256":"e0414c7563fb747f702b8baa8d2527e3a9073332be91eedde8a23dbb7ef068de"}],"concept.complementary-dark-matter-searches":[{"id":"assertion.complete.concept.complementary-dark-matter-searches","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ and ADMX analyses test different proposed dark-matter signals: WIMP-induced xenon nuclear recoils and axion signals in a strong-field microwave cavity, respectively. Their exclusions apply under their separate stated assumptions.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.complementary-dark-matter-searches","target_kind":"node","target_sha256":"e3a4b756f2f92afa434e9f2270d0f4a56f2081ccd75d3e28010d0a69e849e949"}],"concept.crdm-nucleon-cross-section":[{"id":"assertion.complete.concept.crdm-nucleon-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Interaction parameter constrained for boosted dark matter.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"concept.crdm-nucleon-cross-section","target_kind":"node","target_sha256":"358e11de13545b8fa87a43beec34aacb25ee076e80681e3cd54df261238aad2d"}],"concept.dark-matter-candidate-space":[{"id":"assertion.complete.concept.dark-matter-candidate-space","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited analyses investigate different proposed dark-matter candidates: WIMPs in LZ nuclear-recoil searches, axions in ADMX, primordial black holes in OGLE microlensing, ultralight bosons in Lyman-alpha data, and self-interacting models in cluster studies. This is a comparison of those cited targets, not a complete list of possibilities.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744},{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706},{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782},{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"concept.dark-matter-candidate-space","target_kind":"node","target_sha256":"25b756bc25a0fd4fd62e2732f528da21fa90b21204ad2a8af54e1c1cbca3b98f"}],"concept.dark-matter-self-interaction-cross-section":[{"id":"assertion.complete.concept.dark-matter-self-interaction-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In the Tulin–Yu review, the dark-matter scattering cross section, often expressed per unit particle mass, is a parameter constrained conditionally by astrophysical observations, including merging clusters. The relevant bounds depend on interaction and velocity assumptions.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":27165,"quote":"where\nm\nm\nis the DM particle mass, while\nσ\n,\nv\nrel\n\\sigma,v_{\\rm rel}\nare the cross section and relative velocity, respectively, for scattering. Within the central region of a typical dwarf galaxy, we have\nρ\ndm\n∼\n0.1\n​\nM\n⊙\n/\npc\n3\n\\rho_{\\rm dm}\\sim 0.1\\;{\\rm\\,M}_{\\odot}/{\\rm pc}^{3}\nand\nv\nrel\n∼\n50\n​\nkm\n/\ns\nv_{\\rm rel}\\sim 50\\;{\\rm km/s}\n[\n96\n]\n. Therefore, the cross section per unit mass must be at least\nσ\n/\nm\n∼\n1\n​\ncm\n2\n/\ng\n≈\n2\n×\n10\n−\n24\n​\ncm\n2\n/\nGeV\n\\sigma/m\\sim 1\\;{\\rm cm^{2}/g}\\approx 2\\times 10^{-24}\\;{\\rm cm^{2}/GeV}\n(2)\nto have an effect on the halo, corresponding to at least one scattering per particle over 10 Gyr galactic timescales. For\nσ\n/\nm\n∼\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\sim 1\\;{\\rm cm^{2}/g}\n, the mean free path of DM particles is larger than the core radii (Knudsen number larger than unity) and heat conduction is effective in the inner halo. Provided\nσ\n/\nm\n\\sigma/m\nis not dramatically larger than this value,\nR\nscat\nR_{\\rm scat}\nis negligible during the early Universe when structure forms.\n4\n4\n4\nAlthough self-interactions may be active in the\nvery\nearly Universe, long before matter-radiation equality, they rapidly fall out of equilibrium due to the Hubble dilution and redshifting of DM particles.\nTherefore SIDM retains the success of large-scale structure formation from\nΛ\n\\Lambda\nCDM, affecting structure at late times and only on small scales in the dense inner regions of halos.\nCored density profiles lead to shallower rotation curves for dwarf and LSB spiral galaxies at small radii, in accord with observations, while cores in satellite galaxies ameliorate the too-big-to-fail problem by reducing the predicted stellar line-of-sight velocity dispersion for the largest subhalos. If\nσ\n/\nm\n\\sigma/m\nis fixed as in Eq. (\n2\n), the effect of self-interactions on the halo scales approximately in a self-similar fashion, and larger halos, such as those for massive elliptical galaxies and clusters, may be impacted by self-interactions at proportionally larger radii.\nIn principle, self-interactions can also affect substructure, reducing the subhalo mass function to solve the missing satellites problem. SIDM subhalos are prone to tidal disruption, being less concentrated than their CDM counterparts, as well as evaporation due to ram pressure stripping from the host halo\n[\n92\n]\n. However, this mechanism requires a too-large cross section that is excluded for reasons we discuss in §\nIII\n.\nThe effect of self-interactions on DM halos has been borne out through N-body simulations. Soon after Spergel & Steinhardt’s proposal, a first wave of SIDM simulations was performed\n[\n97\n,\n98\n,\n99\n,\n100\n,\n101\n,\n102\n,\n103\n]\n. In conjunction with these simulations, a number of constraints on SIDM emerged, the most stringent of which were strong lensing measurements of the ellipticity and central density of cluster MS2137-23\n[\n104\n,\n105\n]\n. These studies limited the cross section to be below\n0.1\n​\ncm\n2\n/\ng\n0.1\\;{\\rm cm^{2}/g}\n, which excludes self-interactions at a level to explain small scale issues in galaxies. The Bullet Cluster provides additional evidence for the collisionless nature of DM, requiring\nσ\n/\nm\n≲\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\lesssim 1\\;{\\rm cm^{2}/g}\n[\n106\n]\n. Although ad hoc velocity dependencies were put forth to evade these constraints\n[\n101\n,\n107\n,\n108\n,\n103\n]\n, SIDM largely fell into disfavor in light of these difficulties.\nMore recently, new N-body simulations for SIDM, with dramatically higher resolution and halo statistics, have revived DM self-interactions\n[\n109\n,\n94\n,\n95\n,\n110\n,\n111\n,\n112\n,\n113\n,\n114\n]\n. Many of the constraints from larger scales are much weaker than previously thought\n[\n94\n,\n95\n]\n. In particular, constraints based on ellipticity have been overestimated: self-interactions do not erase triaxiality as effectively as previously supposed, and moreover, an observed ellipticity has contributions along the line-of-sight from regions outside the core where the halo remains triaxial\n[\n95\n]\n. The conclusion is that\nσ\n/\nm\n∼\n0.5\n−\n1\n​\ncm\n2\n/\ng\n\\sigma/m\\sim 0.5-1\\;{\\rm cm^{2}/g}\ncan solve the core-cusp and TBTF issues on small scales, while remaining approximately consistent with other astrophysical constraints on larger scales\n[\n94\n,\n95\n,\n110\n,\n111\n]\n. However, more recent studies based on stacked merging clusters\n[\n115\n]\nand stellar kinematics within cluster cores\n[\n116\n]\nsuggest some tension with these values. Viable SIDM models are preferred to have a scattering cross section with a mild velocity-dependence from dwarf to cluster scales. We discuss these issues in further detail in §\nIII\n.\nOn the theory side, a new semi-analytical SIDM halo model has been developed based on the Jeans equation\n[\n117\n,\n116\n,\n118\n]\n. It can reproduce the simulation results for SIDM profiles within 10–20% while being much cheaper computationally. Discussed in §\nIV\n, this approach provides insight for understanding the baryonic influence on SIDM halo properties\n[\n117\n]\n, testing SIDM models from dwarf to cluster scales\n[\n116\n]\n, and addressing the diversity in rotation curves\n[\n118\n]\n.\nFurthermore, there has been important progress in particle physics models for SIDM. Both numerical and analytical methods have been developed to accurately calculate the cross section for SIDM models involving the Yukawa\n[\n119\n,\n120\n,\n121\n]\nor atomic interactions\n[\n122\n,\n123\n]\n. These studies make it possible to map astrophysical constraints on\nσ\n/\nm\n\\sigma/m\nto the particle model parameters, such as the DM and mediator masses and coupling constant. In addition, an effective theory approach has been proposed in parametrizing SIDM models with a set of variables that are directly correlated with astrophysical observations\n[\n124\n,\n125\n]\n.\nPositive observations\nσ\n/\nm\n\\sigma/m\nv\nrel\nv_{\\rm rel}\nObservation\nRefs.\nCores in spiral galaxies\n≳\n1\n​\ncm\n2\n/\ng\n\\gtrsim 1\\;{\\rm cm^{2}/g}\n30\n−\n200\n​\nkm\n/\ns\n30-200\\;{\\rm km/s}\nRotation curves\n[\n102\n,\n116\n]\n(dwarf/LSB galaxies)\nToo-big-to-fail problem\nMilky Way\n≳\n0.6\n​\ncm\n2\n/\ng\n\\gtrsim 0.6\\;{\\rm cm^{2}/g}\n50\n​\nkm\n/\ns\n50\\;{\\rm km/s}\nStellar dispersion\n[\n110\n]\nLocal Group\n≳\n0.5\n​\ncm\n2\n/\ng\n\\gtrsim 0.5\\;{\\rm cm^{2}/g}\n50\n​\nkm\n/\ns\n50\\;{\\rm km/s}\nStellar dispersion\n[\n111\n]\nCores in clusters\n∼\n0.1\n​\ncm\n2\n/\ng\n\\sim 0.1\\;{\\rm cm^{2}/g}\n1500\n​\nkm\n/\ns\n1500\\;{\\rm km/s}\nStellar dispersion, lensing\n[\n116\n,\n126\n]\nAbell 3827 subhalo merger\n∼\n1.5\n​\ncm\n2\n/\ng\n\\sim 1.5\\;{\\rm cm^{2}/g}\n1500\n​\nkm\n/\ns\n1500\\;{\\rm km/s}\nDM-galaxy offset\n[\n127\n]\nAbell 520 cluster merger\n∼\n1\n​\ncm\n2\n/\ng\n\\sim 1\\;{\\rm cm^{2}/g}\n2000\n−\n3000\n​\nkm\n/\ns\n2000-3000\\;{\\rm km/s}\nDM-galaxy offset\n[\n128\n,\n129\n,\n130\n]\nConstraints\nHalo shapes/ellipticity\n≲\n1\n​\ncm\n2\n/\ng\n\\lesssim 1\\;{\\rm cm^{2}/g}\n1300\n​\nkm\n/\ns\n1300\\;{\\rm km/s}\nCluster lensing surveys\n[\n95\n]\nSubstructure mergers\n≲\n2\n​\ncm\n2\n/\ng\n\\lesssim 2\\;{\\rm cm^{2}/g}\n∼\n500\n−\n4000\n​\nkm\n/\ns\n\\sim 500-4000\\;{\\rm km/s}\nDM-galaxy offset\n[\n115\n,\n131\n]\nMerging clusters\n≲\nfew\n​\ncm\n2\n/\ng\n\\lesssim{\\rm few}\\;{\\rm cm^{2}/g}\n2000\n−\n4000\n​\nkm\n/\ns\n2000-4000\\;{\\rm km/s}\nPost-merger halo survival\nTable\n2\n(Scattering depth\nτ\n<\n1\n\\tau<1\n)\nBullet Cluster\n≲\n0.7\n​\ncm\n2\n/\ng\n\\lesssim 0.7\\;{\\rm cm^{2}/g}\n4000\n​\nkm\n/\ns\n4000\\;{\\rm km/s}\nMass-to-light ratio\n[\n106\n]\nTable 1:\nSummary of positive observations and constraints on self-interaction cross section per DM mass. Italicized observations are based on\nsingle individual systems\n, while the rest are derived from sets of multiple systems. Limits quoted, which assume constant\nσ\n/\nm\n\\sigma/m\n, may be interpreted as a function of collisional velocity\nv\nrel\nv_{\\rm rel}\nprovided\nσ\n/\nm\n\\sigma/m\nis not steeply velocity-dependent. References noted here are limited to those containing quoted self-interaction cross section values. Further references, including original studies of observations, are cited in the corresponding sections below.\n","source_id":"completion-source.ad17fd11e99deb1b05e1","source_sha256":"8bdce0ad6d58c30f930151a1a29a4f1e4ea52cdae80414d203093f36970ac9e3","start":19388}],"target_id":"concept.dark-matter-self-interaction-cross-section","target_kind":"node","target_sha256":"0093730b620a9fcdc2a38b8d0702f4a7dba05e8cd900c10243344ce61b48d2de"}],"concept.dfsz-axion":[{"id":"assertion.complete.concept.dfsz-axion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX Run 1B paper describes the DFSZ model as an axion-experiment benchmark characterized by axion-photon coupling. This existing record is retained separately pending an explicit identity review of the other DFSZ record.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"concept.dfsz-axion","target_kind":"node","target_sha256":"b6ae971fcce91ef508f3ebbd7798ed702a000bf07656ef2ef5ccdf4cd1c6f6a2"}],"concept.earth-mass-pbh":[{"id":"assertion.complete.concept.earth-mass-pbh","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited analysis finds that an Earth-mass primordial-black-hole population could reproduce six ultrashort OGLE events if its dark-matter fraction is at the percent level. It presents this as a conditional interpretation alongside free-floating planets.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"concept.earth-mass-pbh","target_kind":"node","target_sha256":"952f449a1a814830b26675f266c731a0cd3f2e1d82388846d79e060a8b882422"}],"concept.eia.adjustable-speed-drives":[{"id":"assertion.concept.eia.adjustable-speed-drives","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Adjustable speed drives as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Adjustable speed drives as: Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","support":[{"end":5792,"quote":"Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":5584}],"target_id":"concept.eia.adjustable-speed-drives","target_kind":"node","target_sha256":"8f63d0d3e046116bfad6c0ce0e965230072c75680ae4bd458fcd6f3653a603f0"}],"concept.eia.adjusted-electricity":[{"id":"assertion.concept.eia.adjusted-electricity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Adjusted electricity as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Adjusted electricity as: A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","support":[{"end":6184,"quote":"A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":5815}],"target_id":"concept.eia.adjusted-electricity","target_kind":"node","target_sha256":"42be97b46b764745bd6bd24156e96155c93b1b51c2e056470f514985fa23e623"}],"concept.eia.aftermarket-converted-vehicle":[{"id":"assertion.concept.eia.aftermarket-converted-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Aftermarket converted vehicle as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Aftermarket converted vehicle as: A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","support":[{"end":8506,"quote":"A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":8357}],"target_id":"concept.eia.aftermarket-converted-vehicle","target_kind":"node","target_sha256":"ef374afb2cb2880366db71b78a7f0e2cd0731e80a335c9bce21763dffa31c158"}],"concept.eia.agglomerating-character":[{"id":"assertion.concept.eia.agglomerating-character","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Agglomerating character as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Agglomerating character as: Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","support":[{"end":9190,"quote":"Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":8799}],"target_id":"concept.eia.agglomerating-character","target_kind":"node","target_sha256":"d04d75d520053302823c79211a1e152719133108ea7ac4ee8f074789ca69919f"}],"concept.eia.air-cleaner":[{"id":"assertion.concept.eia.air-cleaner","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air cleaner as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air cleaner as: A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","support":[{"end":10572,"quote":"A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10357}],"target_id":"concept.eia.air-cleaner","target_kind":"node","target_sha256":"1ed901ccd125e1c5bf7dcbac18e9b3ff6bf4b601a2d5553b195e4947297df7e8"}],"concept.eia.air-collector":[{"id":"assertion.concept.eia.air-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air collector as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","support":[{"end":10705,"quote":"A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10588}],"target_id":"concept.eia.air-collector","target_kind":"node","target_sha256":"817845d511f42b134040663ef85508313a7ffa48b56621db7b93387298616abc"}],"concept.eia.air-conditioning":[{"id":"assertion.concept.eia.air-conditioning","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air conditioning as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air conditioning as: Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","support":[{"end":10980,"quote":"Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":10724}],"target_id":"concept.eia.air-conditioning","target_kind":"node","target_sha256":"414486e683d216bc875e98a0f24e28781d228fdfdfb243df46b5cf9d083c1171"}],"concept.eia.air-pollution-abatement-equipment":[{"id":"assertion.concept.eia.air-pollution-abatement-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Air pollution abatement equipment as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Air pollution abatement equipment as: Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","support":[{"end":12204,"quote":"Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":11814}],"target_id":"concept.eia.air-pollution-abatement-equipment","target_kind":"node","target_sha256":"ce13025d190ad8f37f3078ef92efb558025c0de41245aac4985a7baee24a1063"}],"concept.eia.alkylation":[{"id":"assertion.concept.eia.alkylation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alkylation as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alkylation as: A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","support":[{"end":13059,"quote":"A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":12673}],"target_id":"concept.eia.alkylation","target_kind":"node","target_sha256":"f9b92e13acca56fd1955202f3f20664f0da7745493b2edd2e35719d001326726"}],"concept.eia.alternating-current-ac":[{"id":"assertion.concept.eia.alternating-current-ac","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alternating current (AC) as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alternating current (AC) as: An electric current that reverses its direction at regularly recurring intervals.","support":[{"end":13608,"quote":"An electric current that reverses its direction at regularly recurring intervals.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":13527}],"target_id":"concept.eia.alternating-current-ac","target_kind":"node","target_sha256":"68c2e95740fa0cdffc75046fc9df780beccd9e666b73d97f4785b476ad801788"}],"concept.eia.alternative-fuel-vehicle-afv":[{"id":"assertion.concept.eia.alternative-fuel-vehicle-afv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Alternative fuel vehicle (AFV) as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Alternative fuel vehicle (AFV) as: A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","support":[{"end":14891,"quote":"A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":14561}],"target_id":"concept.eia.alternative-fuel-vehicle-afv","target_kind":"node","target_sha256":"19efcffc4b32ccd94b4e8c86fc4187a2b629ee1145ef6eb3d4120f5896fea3ba"}],"concept.eia.amorphous-silicon":[{"id":"assertion.concept.eia.amorphous-silicon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Amorphous silicon as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Amorphous silicon as: An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","support":[{"end":16948,"quote":"An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":16664}],"target_id":"concept.eia.amorphous-silicon","target_kind":"node","target_sha256":"5668cef9e13207e5bc960c4f6796dbc39ab5db6c9e157211a6136ce0a415e80a"}],"concept.eia.ampere":[{"id":"assertion.concept.eia.ampere","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ampere as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ampere as: The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","support":[{"end":17815,"quote":"The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":17700}],"target_id":"concept.eia.ampere","target_kind":"node","target_sha256":"785cacdb24e6a8e90972edaec4f2d35efe389a74063628f4798009fe75a5cafc"}],"concept.eia.apparent-power":[{"id":"assertion.concept.eia.apparent-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Apparent power as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Apparent power as: The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power. It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA). See","support":[{"end":22321,"quote":"The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power.  It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA).  See","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":22093}],"target_id":"concept.eia.apparent-power","target_kind":"node","target_sha256":"bba2ece9e67483a95bf5ac92b2d6e1aead5c9545da1d614239b90f26c5986211"}],"concept.eia.appliance":[{"id":"assertion.concept.eia.appliance","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Appliance as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Appliance as: A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","support":[{"end":22943,"quote":"A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":22371}],"target_id":"concept.eia.appliance","target_kind":"node","target_sha256":"7854daec1e7724dbcb078ac2d43bf2323c74cb5c2b6a06b11c6060c1ec6e0dcb"}],"concept.eia.asphalt":[{"id":"assertion.concept.eia.asphalt","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Asphalt as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Asphalt as: A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","support":[{"end":25798,"quote":"A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":25346}],"target_id":"concept.eia.asphalt","target_kind":"node","target_sha256":"d42a2b9bb80f072fdd11e56383ceb617cee9e913836f1361e78f9ad8ddcc01e8"}],"concept.eia.atmospheric-crude-oil-distillation":[{"id":"assertion.concept.eia.atmospheric-crude-oil-distillation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Atmospheric crude oil distillation as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Atmospheric crude oil distillation as: The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","support":[{"end":28131,"quote":"The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":27859}],"target_id":"concept.eia.atmospheric-crude-oil-distillation","target_kind":"node","target_sha256":"40e598f8dc7ee817d8d19abc1c57ce5c27ae776baf1ca57cac242eefec78eeff"}],"concept.eia.auger-mine":[{"id":"assertion.concept.eia.auger-mine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Auger mine as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Auger mine as: A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","support":[{"end":28316,"quote":"A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28144}],"target_id":"concept.eia.auger-mine","target_kind":"node","target_sha256":"fff5d26d567a8d981701ec39a2175acf614c3b1d7b3e89f9d6db02d5e686bbc4"}],"concept.eia.automatic-set-back-or-clock-thermostat":[{"id":"assertion.concept.eia.automatic-set-back-or-clock-thermostat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Automatic set-back or clock thermostat as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Automatic set-back or clock thermostat as: A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","support":[{"end":28614,"quote":"A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28508}],"target_id":"concept.eia.automatic-set-back-or-clock-thermostat","target_kind":"node","target_sha256":"920e0d61a461ee3e64bfe9fe2ce1fe0eab10b1987a741dffdfdb4fd2d2d093e5"}],"concept.eia.auxiliary-generator":[{"id":"assertion.concept.eia.auxiliary-generator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Auxiliary generator as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Auxiliary generator as: A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","support":[{"end":29378,"quote":"A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":28995}],"target_id":"concept.eia.auxiliary-generator","target_kind":"node","target_sha256":"165bb42636646c31ca270861051a708982d04b8816d5e797a22552b69aca6b38"}],"concept.eia.azimuth-angle":[{"id":"assertion.concept.eia.azimuth-angle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Azimuth angle as defined in the captured EIA glossary page A","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Azimuth angle as: The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","support":[{"end":33674,"quote":"The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","source_id":"eia-glossary.A","source_sha256":"5098a9d0e38cfdaa557a23e23065439bab6267417a2d9ba7d3ab72d557d0ce29","start":33543}],"target_id":"concept.eia.azimuth-angle","target_kind":"node","target_sha256":"31700191a4111d22cc6563aa719fe75a597bb6770872488fd98456f96bdfa7b4"}],"concept.eia.backup-fuel":[{"id":"assertion.concept.eia.backup-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Backup fuel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Backup fuel as: In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","support":[{"end":813,"quote":"In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":632}],"target_id":"concept.eia.backup-fuel","target_kind":"node","target_sha256":"e068b43e2df6ca0cf0e5770aa02bf1f320b32ad43ccacf70cbaf9c3fb12bb60b"}],"concept.eia.backup-power":[{"id":"assertion.concept.eia.backup-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Backup power as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Backup power as: Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","support":[{"end":1109,"quote":"Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":999}],"target_id":"concept.eia.backup-power","target_kind":"node","target_sha256":"1be79488e2aeef87684af918b1c3e84a39f63eef249a57244aa9a91dc243b337"}],"concept.eia.barrel":[{"id":"assertion.concept.eia.barrel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrel as: A unit of volume equal to 42 U.S. gallons.","support":[{"end":2126,"quote":"A unit of volume equal to 42 U.S. gallons.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":2084}],"target_id":"concept.eia.barrel","target_kind":"node","target_sha256":"13b68653a19fdc7d8c3a225b3ac22e5ca07fd41b4e279105f37cfcd40619ddc1"}],"concept.eia.barrels-per-calendar-day":[{"id":"assertion.concept.eia.barrels-per-calendar-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrels per calendar day as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrels per calendar day as: The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","support":[{"end":2423,"quote":"The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":2153}],"target_id":"concept.eia.barrels-per-calendar-day","target_kind":"node","target_sha256":"c9657c1de407b79b21df8ab0d958cece3ffbd605c31a66c3e4def1a128b5fd69"}],"concept.eia.barrels-per-stream-day":[{"id":"assertion.concept.eia.barrels-per-stream-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Barrels per stream day as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Barrels per stream day as: The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","support":[{"end":3518,"quote":"The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":3304}],"target_id":"concept.eia.barrels-per-stream-day","target_kind":"node","target_sha256":"ab431ea243c3862a04630d2cae29ad6ace051a0fe2f9661213ae7b8fe4f53491"}],"concept.eia.base-load-capacity":[{"id":"assertion.concept.eia.base-load-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Base load capacity as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Base load capacity as: The generating equipment normally operated to serve loads on an around-the-clock basis.","support":[{"end":4173,"quote":"The generating equipment normally operated to serve loads on an around-the-clock basis.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":4086}],"target_id":"concept.eia.base-load-capacity","target_kind":"node","target_sha256":"e8b6f9a9a52f3ed687092b88cae42ff5cb90adc4ad54e6bd4b20a6670c69435e"}],"concept.eia.baseboard-heater":[{"id":"assertion.concept.eia.baseboard-heater","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Baseboard heater as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Baseboard heater as: As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","support":[{"end":5507,"quote":"As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":5184}],"target_id":"concept.eia.baseboard-heater","target_kind":"node","target_sha256":"8b678ff74c244e3b2ce7b4a018568025c06996363f6daf23875718c9bc820ef8"}],"concept.eia.battery-electric-vehicle-bev":[{"id":"assertion.concept.eia.battery-electric-vehicle-bev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Battery electric vehicle (BEV) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Battery electric vehicle (BEV) as: An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","support":[{"end":5793,"quote":"An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":5540}],"target_id":"concept.eia.battery-electric-vehicle-bev","target_kind":"node","target_sha256":"47b5bbe1d2abb43c8ef2da46047149d953f46253bfa58bfaf96001741a0ac641"}],"concept.eia.bi-fuel-vehicle":[{"id":"assertion.concept.eia.bi-fuel-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bi-fuel vehicle as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bi-fuel vehicle as: A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","support":[{"end":6354,"quote":"A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":6226}],"target_id":"concept.eia.bi-fuel-vehicle","target_kind":"node","target_sha256":"da2af34a3b167bb0740e915865fea2befab7b07ee1ba7166ffdd9721d7ad3d7c"}],"concept.eia.bituminous-coal":[{"id":"assertion.concept.eia.bituminous-coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bituminous coal as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bituminous coal as: A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","support":[{"end":10493,"quote":"A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":9791}],"target_id":"concept.eia.bituminous-coal","target_kind":"node","target_sha256":"5ea58059930612e6166e17918154677f87d25f043d97926c229e77a553067f06"}],"concept.eia.black-liquor":[{"id":"assertion.concept.eia.black-liquor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Black liquor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Black liquor as: A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","support":[{"end":10854,"quote":"A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":10508}],"target_id":"concept.eia.black-liquor","target_kind":"node","target_sha256":"8a699399a151008867c306a8eb0dec33348ec7f2d2a38a8d72b89778b9bcd366"}],"concept.eia.blast-furnace":[{"id":"assertion.concept.eia.blast-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blast furnace as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blast furnace as: A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","support":[{"end":11126,"quote":"A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11048}],"target_id":"concept.eia.blast-furnace","target_kind":"node","target_sha256":"1b9162148ca5931c53371b382f6ca76231a12c25d9d378a02794dfb5616e56eb"}],"concept.eia.blast-furnace-gas":[{"id":"assertion.concept.eia.blast-furnace-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blast-furnace gas as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blast-furnace gas as: The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","support":[{"end":11309,"quote":"The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11146}],"target_id":"concept.eia.blast-furnace-gas","target_kind":"node","target_sha256":"201fb03308423e213026e485934fc6e380017e01f19466d498fcf7c793ff39c4"}],"concept.eia.blending-plant":[{"id":"assertion.concept.eia.blending-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Blending plant as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Blending plant as: A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","support":[{"end":11559,"quote":"A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11388}],"target_id":"concept.eia.blending-plant","target_kind":"node","target_sha256":"a520f7cae6c4b3ea82b62fda589afcdf7257ed7675c5c17d0b3b02d17aad9c79"}],"concept.eia.boiler":[{"id":"assertion.concept.eia.boiler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiler as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiler as: A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","support":[{"end":12230,"quote":"A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":11895}],"target_id":"concept.eia.boiler","target_kind":"node","target_sha256":"5ee0fa2a03e71269a1e088870b52cdcc7d4fdec601e0469215b4e2b1e7e3aab0"}],"concept.eia.boiler-fuel":[{"id":"assertion.concept.eia.boiler-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiler fuel as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiler fuel as: An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","support":[{"end":12432,"quote":"An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":12244}],"target_id":"concept.eia.boiler-fuel","target_kind":"node","target_sha256":"ecf114011fb08728b72b240f09719c0ae236d26620cfa33ec4c3d55aa1cebc5f"}],"concept.eia.boiling-water-reactor-bwr":[{"id":"assertion.concept.eia.boiling-water-reactor-bwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Boiling-water reactor (BWR) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Boiling-water reactor (BWR) as: A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","support":[{"end":12628,"quote":"A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":12462}],"target_id":"concept.eia.boiling-water-reactor-bwr","target_kind":"node","target_sha256":"4744a5d07b65c0c27d945d90ddfbc2bb07c8b2493eaf7e5e9df828b5930e42f8"}],"concept.eia.bottled-gas-lpg-or-propane":[{"id":"assertion.concept.eia.bottled-gas-lpg-or-propane","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottled gas, LPG, or propane as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottled gas, LPG, or propane as: Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","support":[{"end":14028,"quote":"Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":13823}],"target_id":"concept.eia.bottled-gas-lpg-or-propane","target_kind":"node","target_sha256":"08df0b337c4aa4300e286170612631bb49629989b274a8b04c0b7f9707937742"}],"concept.eia.bottom-ash":[{"id":"assertion.concept.eia.bottom-ash","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottom ash as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottom ash as: Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","support":[{"end":14150,"quote":"Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":14041}],"target_id":"concept.eia.bottom-ash","target_kind":"node","target_sha256":"f1f1eceaecea1c89193dd9c2244a47e43eaba07fe4330f96b8127fcb4d4c1e43"}],"concept.eia.bottoming-cycle":[{"id":"assertion.concept.eia.bottoming-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bottoming cycle as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bottoming cycle as: A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","support":[{"end":14556,"quote":"A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":14411}],"target_id":"concept.eia.bottoming-cycle","target_kind":"node","target_sha256":"8503e55812109600e95d52d9c55083595a0744a85583187565a6e9efd85e77b7"}],"concept.eia.breeder-reactor":[{"id":"assertion.concept.eia.breeder-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Breeder reactor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Breeder reactor as: A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","support":[{"end":15424,"quote":"A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15171}],"target_id":"concept.eia.breeder-reactor","target_kind":"node","target_sha256":"3db82c9593774a25d463b3e950855d8656e6cabcf3e743718df3a855809e044d"}],"concept.eia.british-thermal-unit":[{"id":"assertion.concept.eia.british-thermal-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"British thermal unit as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines British thermal unit as: The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","support":[{"end":15849,"quote":"The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15647}],"target_id":"concept.eia.british-thermal-unit","target_kind":"node","target_sha256":"18cafbebc80f00fc78c7c0cdb732b4478f09f97452d9ddeab92245824c905221"}],"concept.eia.btu-conversion-factor":[{"id":"assertion.concept.eia.btu-conversion-factor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Btu conversion factor as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Btu conversion factor as: A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","support":[{"end":16214,"quote":"A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":15925}],"target_id":"concept.eia.btu-conversion-factor","target_kind":"node","target_sha256":"c0a7662825d0af320bd0171b4bea7efde4826e54deeab03e0a898612eb0ea15f"}],"concept.eia.built-in-electric-units":[{"id":"assertion.concept.eia.built-in-electric-units","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Built-in electric units as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Built-in electric units as: An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","support":[{"end":18544,"quote":"An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":18247}],"target_id":"concept.eia.built-in-electric-units","target_kind":"node","target_sha256":"994e64f85baadec948324ba77cdef5036a932efaea5ad4f3a7bfd4b204e8e71c"}],"concept.eia.bulk-station":[{"id":"assertion.concept.eia.bulk-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bulk station as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bulk station as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","support":[{"end":19159,"quote":"A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":18952}],"target_id":"concept.eia.bulk-station","target_kind":"node","target_sha256":"0a03c9a43d16e0f88b2a3a7aadc6cd15e7d4925a95d925c56865b9351d3f8168"}],"concept.eia.bulk-terminal":[{"id":"assertion.concept.eia.bulk-terminal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bulk terminal as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bulk terminal as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","support":[{"end":19388,"quote":"A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":19175}],"target_id":"concept.eia.bulk-terminal","target_kind":"node","target_sha256":"f243e4fd060e6b79e46e17e5643eed171cae382c23cf3a33ccfb3bb6cdbb603d"}],"concept.eia.bundled-utility-service-electric":[{"id":"assertion.concept.eia.bundled-utility-service-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bundled utility service (electric) as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bundled utility service (electric) as: A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","support":[{"end":19572,"quote":"A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":19425}],"target_id":"concept.eia.bundled-utility-service-electric","target_kind":"node","target_sha256":"d29e682dbcdd71c3cd344f46b35ae447421a5c50bc5f0535d241e7a1b448a09b"}],"concept.eia.burnup":[{"id":"assertion.concept.eia.burnup","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Burnup as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Burnup as: Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","support":[{"end":20473,"quote":"Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":20292}],"target_id":"concept.eia.burnup","target_kind":"node","target_sha256":"98372bfc8825c1aa8d4364d72626b198c5036a97ab60db02399b3b47eba24b5e"}],"concept.eia.bus":[{"id":"assertion.concept.eia.bus","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Bus as defined in the captured EIA glossary page B","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Bus as: An electrical conductor that serves as a common connection for two or more electrical circuits.","support":[{"end":20574,"quote":"An electrical conductor that serves as a common connection for two or more electrical circuits.","source_id":"eia-glossary.B","source_sha256":"6c892ff7d3400529d8c277f428a71f9a3aa9a8c616b26472d0d190b2f8f183f8","start":20479}],"target_id":"concept.eia.bus","target_kind":"node","target_sha256":"d05c36241292ed27eb10969f2d44f05439539e5ade1922b0caf4de3e4f1bfc93"}],"concept.eia.calcination":[{"id":"assertion.concept.eia.calcination","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Calcination as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Calcination as: A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","support":[{"end":933,"quote":"A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":753}],"target_id":"concept.eia.calcination","target_kind":"node","target_sha256":"c75f4514d8ad94ea169328fc69afad7305ce53e7c337853c2ca031b1a00b38af"}],"concept.eia.calcium-sulfite":[{"id":"assertion.concept.eia.calcium-sulfite","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Calcium sulfite as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Calcium sulfite as: A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","support":[{"end":1204,"quote":"A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":1093}],"target_id":"concept.eia.calcium-sulfite","target_kind":"node","target_sha256":"34179d6e2962a4e274e1a00cb17f43e42f3e937b510d1d3af38cdf899ea75a01"}],"concept.eia.canadian-deuterium-uranium-reactor-candu":[{"id":"assertion.concept.eia.canadian-deuterium-uranium-reactor-candu","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Canadian deuterium uranium reactor (CANDU) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Canadian deuterium uranium reactor (CANDU) as: Uses heavy water or deuterium oxide (D","support":[{"end":1287,"quote":"Uses heavy water or deuterium oxide (D","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":1249}],"target_id":"concept.eia.canadian-deuterium-uranium-reactor-candu","target_kind":"node","target_sha256":"bba71bbecf5fbe5f425f77346b5b45c0001ed7afb5ee2ab9dcdf5e3bd1a464f1"}],"concept.eia.capacity-purchased":[{"id":"assertion.concept.eia.capacity-purchased","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Capacity (purchased) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Capacity (purchased) as: The amount of energy and capacity available for purchase from outside the system.","support":[{"end":2572,"quote":"The amount of energy and capacity available for purchase from outside the system.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":2491}],"target_id":"concept.eia.capacity-purchased","target_kind":"node","target_sha256":"cf446be0544f1fc54cefac7ee7a99583bf6e5ce0f21aedc2c140e9ebc6a1d224"}],"concept.eia.carbon-intensity":[{"id":"assertion.concept.eia.carbon-intensity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Carbon intensity as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Carbon intensity as: The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","support":[{"end":6467,"quote":"The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":6028}],"target_id":"concept.eia.carbon-intensity","target_kind":"node","target_sha256":"92da29dbd252699af45178a6404a40d71cdeb1fd4135702ab527a025d93e8620"}],"concept.eia.carburetor":[{"id":"assertion.concept.eia.carburetor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Carburetor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Carburetor as: A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","support":[{"end":7670,"quote":"A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":7349}],"target_id":"concept.eia.carburetor","target_kind":"node","target_sha256":"183cb614c368300e563138706da32b6216330f571f27eb5e9749b48532957c55"}],"concept.eia.casinghead-gas-or-oil-well-gas":[{"id":"assertion.concept.eia.casinghead-gas-or-oil-well-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Casinghead gas (or oil well gas) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Casinghead gas (or oil well gas) as: Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","support":[{"end":8356,"quote":"Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8243}],"target_id":"concept.eia.casinghead-gas-or-oil-well-gas","target_kind":"node","target_sha256":"3cbc9d6d7a6e1d20d50058d22e4a1ef3c0d2b792daf15c43e04d5cfd89dbb1f2"}],"concept.eia.cast-silicon":[{"id":"assertion.concept.eia.cast-silicon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cast silicon as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cast silicon as: Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","support":[{"end":8917,"quote":"Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8371}],"target_id":"concept.eia.cast-silicon","target_kind":"node","target_sha256":"4cf3acef21130592c68c30996427f3ea0763e6f13da0fa864a01b3758f6f3e7b"}],"concept.eia.catalytic-converter":[{"id":"assertion.concept.eia.catalytic-converter","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic converter as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic converter as: A device containing a catalyst for converting automobile exhaust into mostly harmless products.","support":[{"end":9080,"quote":"A device containing a catalyst for converting automobile exhaust into mostly harmless products.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":8985}],"target_id":"concept.eia.catalytic-converter","target_kind":"node","target_sha256":"868fc6a7297d16f05fd23d3d72d8dac4d917f8d1e6a30e08a4e1a224f8c25c34"}],"concept.eia.catalytic-cracking":[{"id":"assertion.concept.eia.catalytic-cracking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic cracking as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","support":[{"end":9443,"quote":"The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":9101}],"target_id":"concept.eia.catalytic-cracking","target_kind":"node","target_sha256":"05c25ff34d26419468db982bd76fabf03421663adadb0d1e0f3b226c2ba36005"}],"concept.eia.catalytic-hydrotreating":[{"id":"assertion.concept.eia.catalytic-hydrotreating","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Catalytic hydrotreating as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Catalytic hydrotreating as: A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","support":[{"end":10458,"quote":"A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":9875}],"target_id":"concept.eia.catalytic-hydrotreating","target_kind":"node","target_sha256":"310510f48f5090cef19552276a35c13ff206daf7e33c68bbfb2dd6a81b5ccaa8"}],"concept.eia.cells-to-oem-non-pv":[{"id":"assertion.concept.eia.cells-to-oem-non-pv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cells to OEM (non-PV) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cells to OEM (non-PV) as: Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","support":[{"end":11511,"quote":"Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":11393}],"target_id":"concept.eia.cells-to-oem-non-pv","target_kind":"node","target_sha256":"d6772f00c562378c2497a3295860032e4bdece2bf1edd836a1a58c69f05b56b2"}],"concept.eia.central-chiller":[{"id":"assertion.concept.eia.central-chiller","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central chiller as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central chiller as: Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","support":[{"end":15205,"quote":"Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":14695}],"target_id":"concept.eia.central-chiller","target_kind":"node","target_sha256":"afc52d45e2d32c26a23176579fedb745a289e5f3fcfdeff4cba8c8a8570ae193"}],"concept.eia.central-cooling":[{"id":"assertion.concept.eia.central-cooling","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central cooling as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central cooling as: Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","support":[{"end":15387,"quote":"Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15223}],"target_id":"concept.eia.central-cooling","target_kind":"node","target_sha256":"bdb9f1709e790ac3bc8386ca3144f937e6ea935cc504cfcb8c255ef85641b650"}],"concept.eia.central-physical-plant":[{"id":"assertion.concept.eia.central-physical-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central physical plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central physical plant as: A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","support":[{"end":15844,"quote":"A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15412}],"target_id":"concept.eia.central-physical-plant","target_kind":"node","target_sha256":"d3112041abbf3c65ce7391ab1fc1d9ad54801ec7b300cbdf8536b471fe94c45a"}],"concept.eia.central-warm-air-furnace":[{"id":"assertion.concept.eia.central-warm-air-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Central warm air furnace as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Central warm air furnace as: A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","support":[{"end":16461,"quote":"A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":15871}],"target_id":"concept.eia.central-warm-air-furnace","target_kind":"node","target_sha256":"55d6968e861bfe1bb337cb868aff3eaf900ab436a7621e8055cd5282411b7fb6"}],"concept.eia.centralized-water-heating-system":[{"id":"assertion.concept.eia.centralized-water-heating-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Centralized water heating system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Centralized water heating system as: Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","support":[{"end":16743,"quote":"Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":16496}],"target_id":"concept.eia.centralized-water-heating-system","target_kind":"node","target_sha256":"94e3af785e6a5f6beb67607a3d4f3091c76a7ec520eecad587c44c5e4b96fccf"}],"concept.eia.chemical-separation":[{"id":"assertion.concept.eia.chemical-separation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Chemical separation as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Chemical separation as: A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","support":[{"end":18858,"quote":"A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":18639}],"target_id":"concept.eia.chemical-separation","target_kind":"node","target_sha256":"11a73e80a30eae9c05177efa100a30dfee0788487c22317c9a2f398bf5d7fafb"}],"concept.eia.christmas-tree":[{"id":"assertion.concept.eia.christmas-tree","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Christmas tree as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Christmas tree as: The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","support":[{"end":19206,"quote":"The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":19094}],"target_id":"concept.eia.christmas-tree","target_kind":"node","target_sha256":"b24094adee8ba76fa1442193bd91efa371629ff7702d9bc9256122b8ca012e4f"}],"concept.eia.circuit-mile":[{"id":"assertion.concept.eia.circuit-mile","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Circuit-mile as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Circuit-mile as: The total length in miles of separate circuits regardless of the number of conductors used per circuit.","support":[{"end":20238,"quote":"The total length in miles of separate circuits regardless of the number of conductors used per circuit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":20135}],"target_id":"concept.eia.circuit-mile","target_kind":"node","target_sha256":"199e61ea48546ca8bd4466e8294c76d71d393d9b939c1e7537c177829e9bdcb0"}],"concept.eia.clinker":[{"id":"assertion.concept.eia.clinker","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Clinker as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Clinker as: Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","support":[{"end":21687,"quote":"Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":21474}],"target_id":"concept.eia.clinker","target_kind":"node","target_sha256":"84f232c0b1d61d9cd01a17d9de2f6b002f3d08fd8c0e7be50028bfd3a69c5934"}],"concept.eia.coal":[{"id":"assertion.concept.eia.coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal as: A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","support":[{"end":22766,"quote":"A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":22417}],"target_id":"concept.eia.coal","target_kind":"node","target_sha256":"155ef5c9b7d48cabfb827d3e4d6359013631a05ed2ffc839b853ca9b1275b2cc"}],"concept.eia.coal-blending":[{"id":"assertion.concept.eia.coal-blending","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal Blending as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal Blending as: The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","support":[{"end":25225,"quote":"The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":25085}],"target_id":"concept.eia.coal-blending","target_kind":"node","target_sha256":"59a9c71494e5116e4e8dfff8082fbb8f34dee7ce1811a013002749af668aa6d2"}],"concept.eia.coal-briquets":[{"id":"assertion.concept.eia.coal-briquets","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal briquets as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal briquets as: Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","support":[{"end":25669,"quote":"Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":25241}],"target_id":"concept.eia.coal-briquets","target_kind":"node","target_sha256":"c56df13e2401887addbac84d8c6fa1fd586c83066ac32c7e348c3d5dadff02c9"}],"concept.eia.coal-gasification":[{"id":"assertion.concept.eia.coal-gasification","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal gasification as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal gasification as: The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","support":[{"end":28847,"quote":"The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":28517}],"target_id":"concept.eia.coal-gasification","target_kind":"node","target_sha256":"0076192bc059fc964b737b880e1a0afbdf09028a2d0ef596bc0ad0a659a83c2c"}],"concept.eia.coal-liquefaction":[{"id":"assertion.concept.eia.coal-liquefaction","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal liquefaction as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal liquefaction as: A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","support":[{"end":31110,"quote":"A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":30991}],"target_id":"concept.eia.coal-liquefaction","target_kind":"node","target_sha256":"eb55eb960004a633aea53885871756072ebcd0e5489d154b3d68adf6027d2ce7"}],"concept.eia.coal-mine":[{"id":"assertion.concept.eia.coal-mine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal mine as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","support":[{"end":31416,"quote":"An industrial operation for extracting coal from the ground.  Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":31122}],"target_id":"concept.eia.coal-mine","target_kind":"node","target_sha256":"1fcaea0f0c0088b124048648011af72b1e98895549783d88278a356c6d15cab8"}],"concept.eia.coal-synfuel":[{"id":"assertion.concept.eia.coal-synfuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coal synfuel as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coal synfuel as: Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","support":[{"end":37728,"quote":"Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":37525}],"target_id":"concept.eia.coal-synfuel","target_kind":"node","target_sha256":"8f8e7a38a8f683f4cb7b32aa74abe6075fd6fe2d064f0f5b5e3a87ed481f6bbc"}],"concept.eia.coalbed-methane-well-gas":[{"id":"assertion.concept.eia.coalbed-methane-well-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coalbed Methane Well Gas as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coalbed Methane Well Gas as: Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","support":[{"end":42889,"quote":"Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":42734}],"target_id":"concept.eia.coalbed-methane-well-gas","target_kind":"node","target_sha256":"14e774573b1f79ebde676bd1621d1d6d98702570fa5b06bcc1d2a222da0ad119"}],"concept.eia.cofiring":[{"id":"assertion.concept.eia.cofiring","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cofiring as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cofiring as: The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","support":[{"end":43310,"quote":"The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":43217}],"target_id":"concept.eia.cofiring","target_kind":"node","target_sha256":"ab2adbd81e38e679c40ebb6050c4bca09281246e13aadce3af853812fc4c098f"}],"concept.eia.cogeneration-system":[{"id":"assertion.concept.eia.cogeneration-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cogeneration system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cogeneration system as: A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","support":[{"end":43609,"quote":"A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":43478}],"target_id":"concept.eia.cogeneration-system","target_kind":"node","target_sha256":"990ac22ea5e2d78bf615990902b0070fbefff7b50e2696fdeaad44931a1ff470"}],"concept.eia.coke-battery":[{"id":"assertion.concept.eia.coke-battery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke Battery as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke Battery as: A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","support":[{"end":45258,"quote":"A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":45169}],"target_id":"concept.eia.coke-battery","target_kind":"node","target_sha256":"6ca328477c66b07e8413481b7ccec267cca4bb1efa21ce4240a540a10c9c3640"}],"concept.eia.coke-coal":[{"id":"assertion.concept.eia.coke-coal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke (coal) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke (coal) as: A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","support":[{"end":44860,"quote":"A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":44414}],"target_id":"concept.eia.coke-coal","target_kind":"node","target_sha256":"2c3fa61e749cc93e4b9de07df09ffdb0ecfc6a4dab58e787eda699b548f79949"}],"concept.eia.coke-oven":[{"id":"assertion.concept.eia.coke-oven","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Coke Oven as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Coke Oven as: A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar. The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke. Coke is primarily used in steel production. There are two types of coke ovens: (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles. During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","support":[{"end":46479,"quote":"A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar.  The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke.  Coke is primarily used in steel production.  There are two types of coke ovens:  (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles.  During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":45645}],"target_id":"concept.eia.coke-oven","target_kind":"node","target_sha256":"585ab97ff8a970941ff210d2d6f74b89b859638233d4c356a9f354f6a17892ff"}],"concept.eia.combined-cycle":[{"id":"assertion.concept.eia.combined-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined cycle as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined cycle as: An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","support":[{"end":48447,"quote":"An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":48068}],"target_id":"concept.eia.combined-cycle","target_kind":"node","target_sha256":"3c390b65dd196e100b03a868af5771b83df1146b078c609fe6065e09d707a815"}],"concept.eia.combined-cycle-unit":[{"id":"assertion.concept.eia.combined-cycle-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined cycle unit as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined cycle unit as: An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","support":[{"end":48688,"quote":"An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":48469}],"target_id":"concept.eia.combined-cycle-unit","target_kind":"node","target_sha256":"78a499eb253e349c9d68326a6899bba2cb9395c65ee514d3a95b54190a4aba44"}],"concept.eia.combined-heat-and-power-chp-plant":[{"id":"assertion.concept.eia.combined-heat-and-power-chp-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined-heat-and-power (CHP) plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined-heat-and-power (CHP) plant as: A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","support":[{"end":50187,"quote":"A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49750}],"target_id":"concept.eia.combined-heat-and-power-chp-plant","target_kind":"node","target_sha256":"bb17846adb013b7f84a3e738c26ddb72e89a333ea38710d92e70a79862bbf198"}],"concept.eia.combined-hydroelectric-plant":[{"id":"assertion.concept.eia.combined-hydroelectric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined hydroelectric plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined hydroelectric plant as: A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","support":[{"end":49562,"quote":"A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49461}],"target_id":"concept.eia.combined-hydroelectric-plant","target_kind":"node","target_sha256":"a5743f869523f74b165a36f8b5e0d87b3be958b791497f56b417c992f52b4cba"}],"concept.eia.combined-pumped-storage-plant":[{"id":"assertion.concept.eia.combined-pumped-storage-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combined pumped-storage plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combined pumped-storage plant as: A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","support":[{"end":49712,"quote":"A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":49594}],"target_id":"concept.eia.combined-pumped-storage-plant","target_kind":"node","target_sha256":"9043711c2a894163ec92b01be8540a6e32ffcbebe6845339596e0e2381907402"}],"concept.eia.combustion-chamber":[{"id":"assertion.concept.eia.combustion-chamber","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Combustion chamber as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Combustion chamber as: An enclosed vessel in which chemical oxidation of fuel occurs.","support":[{"end":50350,"quote":"An enclosed vessel in which chemical oxidation of fuel occurs.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50288}],"target_id":"concept.eia.combustion-chamber","target_kind":"node","target_sha256":"f73756054d4831bc869a16f3bc4fc64545d54e59757f2160264708bb82caae75"}],"concept.eia.commercial-facility":[{"id":"assertion.concept.eia.commercial-facility","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Commercial facility as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Commercial facility as: An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","support":[{"end":50964,"quote":"An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50723}],"target_id":"concept.eia.commercial-facility","target_kind":"node","target_sha256":"10c55754d79be15af39858700a959192361eac1e3b259bcb430c96e2127369ad"}],"concept.eia.commercial-operation-nuclear":[{"id":"assertion.concept.eia.commercial-operation-nuclear","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Commercial operation (nuclear) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Commercial operation (nuclear) as: The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","support":[{"end":51318,"quote":"The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":50997}],"target_id":"concept.eia.commercial-operation-nuclear","target_kind":"node","target_sha256":"8b71ea3f4d9f6909645682d8165a9438ffe08776c39e13ab4846b922e38b923a"}],"concept.eia.completion-oil-gas-production":[{"id":"assertion.concept.eia.completion-oil-gas-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Completion (oil/gas production) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Completion (oil/gas production) as: The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","support":[{"end":56506,"quote":"The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":56067}],"target_id":"concept.eia.completion-oil-gas-production","target_kind":"node","target_sha256":"2387b1e23b0b3261592c6122c89867d24267d88a78e65a03420a31c0334223b1"}],"concept.eia.compressor-station":[{"id":"assertion.concept.eia.compressor-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Compressor station as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Compressor station as: Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","support":[{"end":57460,"quote":"Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57314}],"target_id":"concept.eia.compressor-station","target_kind":"node","target_sha256":"6124e72d70e435f3a7979dfc731dbb5ad5fbd9299fc3b6849b718f4bdb71c34f"}],"concept.eia.concentrating-solar-power-or-solar-thermal-power-system":[{"id":"assertion.concept.eia.concentrating-solar-power-or-solar-thermal-power-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Concentrating solar power or solar thermal power system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Concentrating solar power or solar thermal power system as: A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","support":[{"end":57696,"quote":"A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57518}],"target_id":"concept.eia.concentrating-solar-power-or-solar-thermal-power-system","target_kind":"node","target_sha256":"24a458639df93731f27d81ad957a0b598ff39bda10af86c5edd49280aca4df7d"}],"concept.eia.concentrator":[{"id":"assertion.concept.eia.concentrator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Concentrator as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Concentrator as: A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","support":[{"end":58113,"quote":"A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":57926}],"target_id":"concept.eia.concentrator","target_kind":"node","target_sha256":"9d54b7aa0a73e745e1a9f99efa3789ccd1113ee0231c7a88a3d2786e86e9e96b"}],"concept.eia.condenser-cooling-water":[{"id":"assertion.concept.eia.condenser-cooling-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Condenser cooling water as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Condenser cooling water as: A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","support":[{"end":59195,"quote":"A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":58876}],"target_id":"concept.eia.condenser-cooling-water","target_kind":"node","target_sha256":"2cbbe7ff2453c83bbc9e54b4edb69cbb3606dfe12665f8479db9807f7547da02"}],"concept.eia.conductor":[{"id":"assertion.concept.eia.conductor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conductor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conductor as: Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","support":[{"end":59528,"quote":"Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":59363}],"target_id":"concept.eia.conductor","target_kind":"node","target_sha256":"8edb1464ca2c439ee43251c108c29e40bec73e03cf0ba2e6097929e22c5ee7ca"}],"concept.eia.construction-pipeline-of-a-nuclear-reactor":[{"id":"assertion.concept.eia.construction-pipeline-of-a-nuclear-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Construction pipeline (of a nuclear reactor) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Construction pipeline (of a nuclear reactor) as: The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","support":[{"end":63398,"quote":"The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":62993}],"target_id":"concept.eia.construction-pipeline-of-a-nuclear-reactor","target_kind":"node","target_sha256":"8bfbb588a42a5e0e283b7f0cb1a42bd16987ce333c8f666306b101cb527f18d4"}],"concept.eia.construction-work-in-progress-cwip":[{"id":"assertion.concept.eia.construction-work-in-progress-cwip","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Construction work in progress (CWIP) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Construction work in progress (CWIP) as: The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","support":[{"end":63606,"quote":"The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":63437}],"target_id":"concept.eia.construction-work-in-progress-cwip","target_kind":"node","target_sha256":"b12891c1ca3569376f7024f778e81044b4010ada523e71832ac99f514a7c5b80"}],"concept.eia.continuous-mining":[{"id":"assertion.concept.eia.continuous-mining","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Continuous mining as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Continuous mining as: A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","support":[{"end":65686,"quote":"A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":65530}],"target_id":"concept.eia.continuous-mining","target_kind":"node","target_sha256":"c556658ee9aee9bf2bcc24b0ac6efbbf3a6b666ce75a909872b23545b4bff224"}],"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob":[{"id":"assertion.concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional blendstock for oxygenate blending (CBOB) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional blendstock for oxygenate blending (CBOB) as: Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","support":[{"end":67785,"quote":"Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":67664}],"target_id":"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","target_kind":"node","target_sha256":"a2879ce9f59bea528771cc9cf8d666112753dd9cb8207af6f85c084b99a19cf8"}],"concept.eia.conventional-fuel-ethanol":[{"id":"assertion.concept.eia.conventional-fuel-ethanol","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional fuel ethanol as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional fuel ethanol as: Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","support":[{"end":67933,"quote":"Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":67813}],"target_id":"concept.eia.conventional-fuel-ethanol","target_kind":"node","target_sha256":"d6e3ef75c40c370aea721b271df7bfab1178c25bfc7016947a2ec82786e3a4e3"}],"concept.eia.conventional-gasoline":[{"id":"assertion.concept.eia.conventional-gasoline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional gasoline as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional gasoline as: Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","support":[{"end":68426,"quote":"Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68214}],"target_id":"concept.eia.conventional-gasoline","target_kind":"node","target_sha256":"7ab7828320f84b741010fe4ca48b655a371c6315b8c40d56c30a7fa6f4a4b1ab"}],"concept.eia.conventional-hydroelectric-plant":[{"id":"assertion.concept.eia.conventional-hydroelectric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional hydroelectric plant as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional hydroelectric plant as: A plant in which all of the power is produced from natural streamflow as regulated by available storage.","support":[{"end":68565,"quote":"A plant in which all of the power is produced from natural streamflow as regulated by available storage.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68461}],"target_id":"concept.eia.conventional-hydroelectric-plant","target_kind":"node","target_sha256":"3e4fd2fa8e0b497474415eb6d1423f3419915f116303c6cf10f1e3cdf54a1ea4"}],"concept.eia.conventional-mill-uranium":[{"id":"assertion.concept.eia.conventional-mill-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional mill (uranium) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional mill (uranium) as: A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","support":[{"end":68843,"quote":"A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":68595}],"target_id":"concept.eia.conventional-mill-uranium","target_kind":"node","target_sha256":"24a2086edac2accad7f3098044148655e74f8561c97797be379d08b038ce2eaa"}],"concept.eia.conventional-oil-and-natural-gas-production":[{"id":"assertion.concept.eia.conventional-oil-and-natural-gas-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conventional oil and natural gas production as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conventional oil and natural gas production as: Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","support":[{"end":69329,"quote":"Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69130}],"target_id":"concept.eia.conventional-oil-and-natural-gas-production","target_kind":"node","target_sha256":"bd42f7ff3d869be75a95a82ee3ed028522eaba7093298c6255798fb24d020b12"}],"concept.eia.conversion-factor":[{"id":"assertion.concept.eia.conversion-factor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Conversion factor as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Conversion factor as: A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons). (See","support":[{"end":69608,"quote":"A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons).  (See","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69442}],"target_id":"concept.eia.conversion-factor","target_kind":"node","target_sha256":"1c44638b9a39ff42eb372024b8ddc5cf290d3a3ca55fa2ba110757075c8bed78"}],"concept.eia.converted-alternative-fuel-vehicle":[{"id":"assertion.concept.eia.converted-alternative-fuel-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Converted (alternative-fuel) vehicle as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Converted (alternative-fuel) vehicle as: A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","support":[{"end":69969,"quote":"A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":69808}],"target_id":"concept.eia.converted-alternative-fuel-vehicle","target_kind":"node","target_sha256":"1cfee0a8da7bddba23433a68147e272ff541d7edbb8c2fdd221dc48583dfdd4d"}],"concept.eia.cooling-system":[{"id":"assertion.concept.eia.cooling-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cooling system as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cooling system as: An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","support":[{"end":71132,"quote":"An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":70990}],"target_id":"concept.eia.cooling-system","target_kind":"node","target_sha256":"bf8b7011c871b4563060381cac24507048fa657e42e7cb786b9a99dabdb2a311"}],"concept.eia.crude-oil-input":[{"id":"assertion.concept.eia.crude-oil-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil input as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil input as: The total crude oil put into processing units at refineries.","support":[{"end":79677,"quote":"The total crude oil put into processing units at refineries.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":79617}],"target_id":"concept.eia.crude-oil-input","target_kind":"node","target_sha256":"9c01882767ad583a85a4d8ebf869c31e5ee5a093c157de9f1fe77b070014af4f"}],"concept.eia.crude-oil-qualities":[{"id":"assertion.concept.eia.crude-oil-qualities","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil qualities as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil qualities as: Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","support":[{"end":81738,"quote":"Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":81599}],"target_id":"concept.eia.crude-oil-qualities","target_kind":"node","target_sha256":"25ad6b4650725091905c5768aad1c142fe991ba303fab2f21954cea87d376134"}],"concept.eia.crude-oil-refinery-input":[{"id":"assertion.concept.eia.crude-oil-refinery-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Crude oil refinery input as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Crude oil refinery input as: The total crude oil put into processing units at refineries.","support":[{"end":81825,"quote":"The total crude oil put into processing units at refineries.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":81765}],"target_id":"concept.eia.crude-oil-refinery-input","target_kind":"node","target_sha256":"8a9cfd21b2ebab05f507feb5ee91ab92b08a81f25781a334a7c108cb6a6ca289"}],"concept.eia.current-electric":[{"id":"assertion.concept.eia.current-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Current (electric) as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Current (electric) as: A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","support":[{"end":83989,"quote":"A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":83866}],"target_id":"concept.eia.current-electric","target_kind":"node","target_sha256":"afe580b24ccfe14f4920caefee00749255517d5158598b14c4ad080b4a8a6e63"}],"concept.eia.cycle-reactor-history":[{"id":"assertion.concept.eia.cycle-reactor-history","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Cycle/reactor history as defined in the captured EIA glossary page C","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Cycle/reactor history as: A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","support":[{"end":86648,"quote":"A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","source_id":"eia-glossary.C","source_sha256":"f5dae09d6a568bc70a0599dc9c75b8467f9e16ed97267c3857f6ed6ebf75dbc3","start":86504}],"target_id":"concept.eia.cycle-reactor-history","target_kind":"node","target_sha256":"c7541297964b1a088aaff1c7012da62e7ffa6d2f6e102b96b0b1a839197130a2"}],"concept.eia.daylighting-controls":[{"id":"assertion.concept.eia.daylighting-controls","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Daylighting controls as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Daylighting controls as: A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","support":[{"end":1424,"quote":"A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":1232}],"target_id":"concept.eia.daylighting-controls","target_kind":"node","target_sha256":"8fb46c59a6bfa970290a6eaeb7ec644ed54016fc94b36ed7b443721c855aec10"}],"concept.eia.decontamination":[{"id":"assertion.concept.eia.decontamination","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Decontamination as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Decontamination as: Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","support":[{"end":1927,"quote":"Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":1832}],"target_id":"concept.eia.decontamination","target_kind":"node","target_sha256":"577ec7b89aed6c37e11c63253f3eb2d9c834944c60d435411ffdbd33f4f3ab32"}],"concept.eia.dedicated-vehicle":[{"id":"assertion.concept.eia.dedicated-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dedicated vehicle as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dedicated vehicle as: A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","support":[{"end":3086,"quote":"A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":2884}],"target_id":"concept.eia.dedicated-vehicle","target_kind":"node","target_sha256":"006c85a1704186d4724cda60a4c95c9055eca271b86f710f8337e7194b963a55"}],"concept.eia.deepest-total-depth":[{"id":"assertion.concept.eia.deepest-total-depth","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Deepest total depth as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Deepest total depth as: The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","support":[{"end":3419,"quote":"The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":3108}],"target_id":"concept.eia.deepest-total-depth","target_kind":"node","target_sha256":"d340bb007b7536dfa762d3f2e27a3d806718e96da9be884fc9f47ea5c6de0dba"}],"concept.eia.degasification-system":[{"id":"assertion.concept.eia.degasification-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Degasification system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Degasification system as: The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","support":[{"end":4381,"quote":"The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":4130}],"target_id":"concept.eia.degasification-system","target_kind":"node","target_sha256":"56b9b72b48260772958737252edede5c3cef115492ebdbe0135a87f4a7791e4a"}],"concept.eia.delayed-coking":[{"id":"assertion.concept.eia.delayed-coking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Delayed coking as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Delayed coking as: A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","support":[{"end":5057,"quote":"A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":4664}],"target_id":"concept.eia.delayed-coking","target_kind":"node","target_sha256":"e6dd26c04bf7f16533ad7e79d2bad403f29806befab207f48af79d1a6d5cfb63"}],"concept.eia.deliveries-electric":[{"id":"assertion.concept.eia.deliveries-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Deliveries (electric) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Deliveries (electric) as: Energy generated by one system and delivered to another system through one or more transmission lines.","support":[{"end":6604,"quote":"Energy generated by one system and delivered to another system through one or more transmission lines.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":6502}],"target_id":"concept.eia.deliveries-electric","target_kind":"node","target_sha256":"577577c288f57651a1ca304cfaaae16f0e68d12f16fcdc81839ed0f57d6df5a0"}],"concept.eia.denaturant":[{"id":"assertion.concept.eia.denaturant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Denaturant as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Denaturant as: Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption. Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant. See","support":[{"end":11763,"quote":"Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption.  Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant.  See","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":11493}],"target_id":"concept.eia.denaturant","target_kind":"node","target_sha256":"e1893a27f4c718a16a2d58baa9d7b895760ab72cd2f68d636b555188c4cfd537"}],"concept.eia.denatured":[{"id":"assertion.concept.eia.denatured","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Denatured as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Denatured as: Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","support":[{"end":12107,"quote":"Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":11827}],"target_id":"concept.eia.denatured","target_kind":"node","target_sha256":"2f1f7b86b5e4b4907612e8b58d4bd1a98f88e0783a9ef8485440bffbe7d3d7cc"}],"concept.eia.dependable-capacity":[{"id":"assertion.concept.eia.dependable-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dependable capacity as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dependable capacity as: The load-carrying ability of a station or system under adverse conditions for a specified period of time.","support":[{"end":12511,"quote":"The load-carrying ability of a station or system under adverse conditions for a specified period of time.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":12406}],"target_id":"concept.eia.dependable-capacity","target_kind":"node","target_sha256":"fba210c6cbd96952ca5e055cb3c1b2bdb31f38f7c69bb6c719fa51fdc29458b9"}],"concept.eia.depleted-storage-field":[{"id":"assertion.concept.eia.depleted-storage-field","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Depleted storage field as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Depleted storage field as: A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","support":[{"end":12799,"quote":"A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":12689}],"target_id":"concept.eia.depleted-storage-field","target_kind":"node","target_sha256":"ac20710849e90ce4a825f69efd47791687e64eaaf4e5946a64f0810b10ad65ad"}],"concept.eia.depth-of-deepest-production":[{"id":"assertion.concept.eia.depth-of-deepest-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Depth of deepest production as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Depth of deepest production as: The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","support":[{"end":15628,"quote":"The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":15417}],"target_id":"concept.eia.depth-of-deepest-production","target_kind":"node","target_sha256":"c233f99061daececa0c34c9a9e07d8942afd5c84fac67ba2f664a7380a919da9"}],"concept.eia.design-electrical-rating-capacity-net":[{"id":"assertion.concept.eia.design-electrical-rating-capacity-net","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Design electrical rating (capacity) net as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Design electrical rating (capacity) net as: The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","support":[{"end":16447,"quote":"The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":16334}],"target_id":"concept.eia.design-electrical-rating-capacity-net","target_kind":"node","target_sha256":"58a67c8f17d5ad3e0da337c2871c12df90e5c8fc8d8ba572032772b774fbbec8"}],"concept.eia.design-head":[{"id":"assertion.concept.eia.design-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Design head as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Design head as: The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","support":[{"end":16709,"quote":"The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":16461}],"target_id":"concept.eia.design-head","target_kind":"node","target_sha256":"2d9a8c674faf2618e3625d871b7e906bb9fa444d45d7c03ba64a4ab32dee0898"}],"concept.eia.development-well":[{"id":"assertion.concept.eia.development-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Development well as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Development well as: A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","support":[{"end":19013,"quote":"A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":18870}],"target_id":"concept.eia.development-well","target_kind":"node","target_sha256":"03b14ab04f8531ea18316de284bb592f9f93c5217904a98788239759622d9417"}],"concept.eia.diesel-electric-plant":[{"id":"assertion.concept.eia.diesel-electric-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel-electric plant as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel-electric plant as: A generating station that uses diesel engines to drive its electric generators.","support":[{"end":19917,"quote":"A generating station that uses diesel engines to drive its electric generators.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19838}],"target_id":"concept.eia.diesel-electric-plant","target_kind":"node","target_sha256":"ef9dfa68ff90a46d527453edbf8fc7c4844ea333de34d1ab891f13db6a2b9043"}],"concept.eia.diesel-fuel":[{"id":"assertion.concept.eia.diesel-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel fuel as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel fuel as: A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","support":[{"end":19256,"quote":"A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19027}],"target_id":"concept.eia.diesel-fuel","target_kind":"node","target_sha256":"fd042d0e1c693913a30dea3838621cf402c52e6f3d815fc4879a1449f49f8c2d"}],"concept.eia.diesel-fuel-system":[{"id":"assertion.concept.eia.diesel-fuel-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diesel fuel system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diesel fuel system as: Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","support":[{"end":19814,"quote":"Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19277}],"target_id":"concept.eia.diesel-fuel-system","target_kind":"node","target_sha256":"d069ff3b3bfade25240523e26274537a221b7c599a892456a4999b72bcfa827e"}],"concept.eia.diffusive-transport":[{"id":"assertion.concept.eia.diffusive-transport","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Diffusive transport as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Diffusive transport as: The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","support":[{"end":20066,"quote":"The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":19939}],"target_id":"concept.eia.diffusive-transport","target_kind":"node","target_sha256":"5098c7703cef6c08f6b863b00d8f2284426c3eca166c45e35e31b00121845fe6"}],"concept.eia.direct-electricity-load-control":[{"id":"assertion.concept.eia.direct-electricity-load-control","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Direct electricity load control as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Direct electricity load control as: The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","support":[{"end":21455,"quote":"The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":21190}],"target_id":"concept.eia.direct-electricity-load-control","target_kind":"node","target_sha256":"a9e521ce5b33c9b16226f2145582639f853c49ee3aa3c99af4909d5552ae9075"}],"concept.eia.direct-load-control":[{"id":"assertion.concept.eia.direct-load-control","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Direct load control as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Direct load control as: This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","support":[{"end":22111,"quote":"This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":21822}],"target_id":"concept.eia.direct-load-control","target_kind":"node","target_sha256":"bdc9260fea63c70fb56a3a3a690e5983da109fb2813a7e1d259b73959905657d"}],"concept.eia.directional-deviated-well":[{"id":"assertion.concept.eia.directional-deviated-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Directional (deviated) well as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Directional (deviated) well as: A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","support":[{"end":24287,"quote":"A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":24140}],"target_id":"concept.eia.directional-deviated-well","target_kind":"node","target_sha256":"5854bdf0cb5bc7016056886b4bff3b9317b97a7dad4d941e4d8450c3a9111f70"}],"concept.eia.discharged-fuel":[{"id":"assertion.concept.eia.discharged-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Discharged fuel as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Discharged fuel as: Irradiated fuel removed from a nuclear reactor during refueling. Also see","support":[{"end":24378,"quote":"Irradiated fuel removed from a nuclear reactor during refueling. Also see","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":24305}],"target_id":"concept.eia.discharged-fuel","target_kind":"node","target_sha256":"dfb1c4fc60939f074c679596711c21be4589bec29f91b532d10b746494a998a2"}],"concept.eia.distillate-fuel-oil":[{"id":"assertion.concept.eia.distillate-fuel-oil","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distillate fuel oil as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distillate fuel oil as: A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","support":[{"end":26288,"quote":"A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":25787}],"target_id":"concept.eia.distillate-fuel-oil","target_kind":"node","target_sha256":"9eec1eb933b4cb42fdcff424d270d03d188d1d9c223900d3c64b73f4abb892b2"}],"concept.eia.distillation-unit-atmospheric":[{"id":"assertion.concept.eia.distillation-unit-atmospheric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distillation unit (atmospheric) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distillation unit (atmospheric) as: The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","support":[{"end":29097,"quote":"The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":28525}],"target_id":"concept.eia.distillation-unit-atmospheric","target_kind":"node","target_sha256":"80d22028913c817f4cf27a0d788576d62bae19b0ca55ab15333f45cabc335eae"}],"concept.eia.distributed-generator":[{"id":"assertion.concept.eia.distributed-generator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distributed generator as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distributed generator as: A generator that is located close to the particular load that it is intended to serve. General, but non-exclusive, characteristics of these generators include: an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","support":[{"end":29418,"quote":"A generator that is located close to the particular load that it is intended to serve.  General, but non-exclusive, characteristics of these generators include:  an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":29121}],"target_id":"concept.eia.distributed-generator","target_kind":"node","target_sha256":"2f145b960644235f38930e5dcca6b7119aed2eb6608bed9ba79ea55495b57f4e"}],"concept.eia.distributed-point-of-use-water-heating-system":[{"id":"assertion.concept.eia.distributed-point-of-use-water-heating-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distributed/point-of-use water-heating system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distributed/point-of-use water-heating system as: A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","support":[{"end":29791,"quote":"A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":29466}],"target_id":"concept.eia.distributed-point-of-use-water-heating-system","target_kind":"node","target_sha256":"a78baf07a6a64b2bc236ae0db9eb7ae978012dc622bb8d34339dbf927b29f5a6"}],"concept.eia.distribution-system":[{"id":"assertion.concept.eia.distribution-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Distribution system as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Distribution system as: The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","support":[{"end":30415,"quote":"The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":30283}],"target_id":"concept.eia.distribution-system","target_kind":"node","target_sha256":"6c19b03e55fec31d38e3da5d81a162d870efe469c083b54c0256e9ffab81ff5d"}],"concept.eia.district-chilled-water":[{"id":"assertion.concept.eia.district-chilled-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District chilled water as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District chilled water as: Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","support":[{"end":31028,"quote":"Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":30665}],"target_id":"concept.eia.district-chilled-water","target_kind":"node","target_sha256":"d4c5d67e4c574ee7473cd92eb236959a86c5937cbfc7b042994ca99a4b7786e7"}],"concept.eia.district-energy":[{"id":"assertion.concept.eia.district-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District energy as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District energy as: Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","support":[{"end":31411,"quote":"Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":31046}],"target_id":"concept.eia.district-energy","target_kind":"node","target_sha256":"47018d8fec36dccec4e157f9daf1ed5c73d540a043fb3dea3bb97ea04d673a7c"}],"concept.eia.district-heat":[{"id":"assertion.concept.eia.district-heat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"District heat as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines District heat as: Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","support":[{"end":31779,"quote":"Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":31427}],"target_id":"concept.eia.district-heat","target_kind":"node","target_sha256":"98e40d641b141dc069f744339a8c227c9c791ab279d4dcb7d695c20253d9f4f3"}],"concept.eia.double-circuit-line":[{"id":"assertion.concept.eia.double-circuit-line","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Double circuit line as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Double circuit line as: A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","support":[{"end":34545,"quote":"A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":34398}],"target_id":"concept.eia.double-circuit-line","target_kind":"node","target_sha256":"73a9a35e8e8f6975ecc70eb240cba35067ce408932f2a1bb0efa520aedd3dafd"}],"concept.eia.dry-bottom-boiler":[{"id":"assertion.concept.eia.dry-bottom-boiler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dry bottom boiler as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dry bottom boiler as: No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","support":[{"end":37208,"quote":"No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":36916}],"target_id":"concept.eia.dry-bottom-boiler","target_kind":"node","target_sha256":"afad8f75dd5ad4d5816e4d480a9ecf412fad94672a1746b67b0e845844506907"}],"concept.eia.dry-hole":[{"id":"assertion.concept.eia.dry-hole","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dry hole as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dry hole as: An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","support":[{"end":37416,"quote":"An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":37250}],"target_id":"concept.eia.dry-hole","target_kind":"node","target_sha256":"2610b895cf7da92d3073c53d2ab030216744cd21bc5d8cbea5458da1471b1e94"}],"concept.eia.dual-fired-unit":[{"id":"assertion.concept.eia.dual-fired-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual-fired unit as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual-fired unit as: A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","support":[{"end":40042,"quote":"A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39816}],"target_id":"concept.eia.dual-fired-unit","target_kind":"node","target_sha256":"1616b694e37abf0cc58222b5667cb49b36a335a7389d8fd089568d2f6ce32fc3"}],"concept.eia.dual-fuel-vehicle-1":[{"id":"assertion.concept.eia.dual-fuel-vehicle-1","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual fuel vehicle (1) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (1) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","support":[{"end":39416,"quote":"A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39188}],"target_id":"concept.eia.dual-fuel-vehicle-1","target_kind":"node","target_sha256":"c5b4a789ab4f9dcda3e520762014fe8c168a52d61313358420dc42f0975240f8"}],"concept.eia.dual-fuel-vehicle-2":[{"id":"assertion.concept.eia.dual-fuel-vehicle-2","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dual fuel vehicle (2) as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (2) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","support":[{"end":39798,"quote":"A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":39440}],"target_id":"concept.eia.dual-fuel-vehicle-2","target_kind":"node","target_sha256":"88ec665e538ef6d46dfd944b381290b2d6a43bf02d8940456448383492894ef2"}],"concept.eia.dump-energy":[{"id":"assertion.concept.eia.dump-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Dump energy as defined in the captured EIA glossary page D","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Dump energy as: Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","support":[{"end":40220,"quote":"Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","source_id":"eia-glossary.D","source_sha256":"f497fb2d02f7364c7f6c8fbaca020698c8fc4a827498ff312fd8551b1fae2e0a","start":40056}],"target_id":"concept.eia.dump-energy","target_kind":"node","target_sha256":"24556c8d2b177ee87fd5bb3c146fe2579c01dbd16b7f18713b01ad0fbcc10cef"}],"concept.eia.electric-energy":[{"id":"assertion.concept.eia.electric-energy","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric energy as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","support":[{"end":2301,"quote":"The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":2178}],"target_id":"concept.eia.electric-energy","target_kind":"node","target_sha256":"5066fdb13b383ce99884d20cea17e3b6f126e71e1a809676732c742d57a835b2"}],"concept.eia.electric-plant-physical":[{"id":"assertion.concept.eia.electric-plant-physical","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric plant (physical) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric plant (physical) as: A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","support":[{"end":4618,"quote":"A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":4457}],"target_id":"concept.eia.electric-plant-physical","target_kind":"node","target_sha256":"847a37abbb73109ce76e9c6bebb4ab8e39d9a8a43f8a78cfe77ac8d317f57a34"}],"concept.eia.electric-power-plant":[{"id":"assertion.concept.eia.electric-power-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric power plant as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric power plant as: A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","support":[{"end":6115,"quote":"A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":5955}],"target_id":"concept.eia.electric-power-plant","target_kind":"node","target_sha256":"78fb2ffe662c3358891945c1174e27fbc8767fc8f0e7d78e50df0b0993eb1647"}],"concept.eia.electric-pump-for-well-water":[{"id":"assertion.concept.eia.electric-pump-for-well-water","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric pump for well water as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric pump for well water as: This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","support":[{"end":7145,"quote":"This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":6942}],"target_id":"concept.eia.electric-pump-for-well-water","target_kind":"node","target_sha256":"6304e1e9883b03fd57288c74a661e4efffd733e2f90b1a2ed6f63ef0c5c78321"}],"concept.eia.electric-system-loss":[{"id":"assertion.concept.eia.electric-system-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric system loss as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric system loss as: Total energy loss from all causes for an electric utility.","support":[{"end":7616,"quote":"Total energy loss from all causes for an electric utility.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":7558}],"target_id":"concept.eia.electric-system-loss","target_kind":"node","target_sha256":"f1561e47506bcc722465d26969c9f34f1400b81d9a72fe5ff68f75b1d4824c07"}],"concept.eia.electric-system-reliability":[{"id":"assertion.concept.eia.electric-system-reliability","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric system reliability as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric system reliability as: The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","support":[{"end":8351,"quote":"The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":7646}],"target_id":"concept.eia.electric-system-reliability","target_kind":"node","target_sha256":"685d33f4c150a9a3672ccbadd27b077840037bfe8b31b84c32d6812f833ca2c3"}],"concept.eia.electric-vehicle-ev":[{"id":"assertion.concept.eia.electric-vehicle-ev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric vehicle (EV) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric vehicle (EV) as: A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","support":[{"end":10547,"quote":"A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10174}],"target_id":"concept.eia.electric-vehicle-ev","target_kind":"node","target_sha256":"410bd2528fc2ab09b9042b0a8945aad7ab0035d00e7d59b72fe8db88c16b0f32"}],"concept.eia.electric-zone":[{"id":"assertion.concept.eia.electric-zone","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electric zone as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electric zone as: A portion of the grid controlled by the independent system operator.","support":[{"end":10631,"quote":"A portion of the grid controlled by the independent system operator.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10563}],"target_id":"concept.eia.electric-zone","target_kind":"node","target_sha256":"6ca3f8edd8e20bc6c43c1d989d6c2e93dc44f566b2bcb29a8f167fa4505645b4"}],"concept.eia.electrical-system-energy-losses":[{"id":"assertion.concept.eia.electrical-system-energy-losses","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electrical system energy losses as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electrical system energy losses as: The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","support":[{"end":10797,"quote":"The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":10665}],"target_id":"concept.eia.electrical-system-energy-losses","target_kind":"node","target_sha256":"b0094f0d610ea7ff6a9d17e568d185c245bb9db589cb671d0368dde853df3c10"}],"concept.eia.electricity-generation":[{"id":"assertion.concept.eia.electricity-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electricity generation as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electricity generation as: The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","support":[{"end":11932,"quote":"The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":11746}],"target_id":"concept.eia.electricity-generation","target_kind":"node","target_sha256":"cafa06c47a033230297024e00ff500ac3bea87263dcd89036915a82f721e6442"}],"concept.eia.electricity-only-plant":[{"id":"assertion.concept.eia.electricity-only-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Electricity-only plant as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Electricity-only plant as: A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","support":[{"end":13023,"quote":"A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":12932}],"target_id":"concept.eia.electricity-only-plant","target_kind":"node","target_sha256":"69acdf5f48f69c0c374d47a860da20fa25fbd5e9c2617fe6b18142f30f474d9f"}],"concept.eia.elution":[{"id":"assertion.concept.eia.elution","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Elution as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Elution as: The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","support":[{"end":13522,"quote":"The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":13398}],"target_id":"concept.eia.elution","target_kind":"node","target_sha256":"b95cc1d6b34c2f49c63bc9db2d2851c5e888901c2d9aa644ec8992258f547932"}],"concept.eia.emissions-coefficient":[{"id":"assertion.concept.eia.emissions-coefficient","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Emissions coefficient as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Emissions coefficient as: A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","support":[{"end":14346,"quote":"A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":14157}],"target_id":"concept.eia.emissions-coefficient","target_kind":"node","target_sha256":"b4a07b23eb49aab721796219f2480c29550b8510718a99eb99e94ba67bb94ff2"}],"concept.eia.energy-consumption":[{"id":"assertion.concept.eia.energy-consumption","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy consumption as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","support":[{"end":17489,"quote":"The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":17388}],"target_id":"concept.eia.energy-consumption","target_kind":"node","target_sha256":"827a3353edcebd277d319675584eb9ba48b95c5b97e5000b8971b274bacb9edb"}],"concept.eia.energy-deliveries":[{"id":"assertion.concept.eia.energy-deliveries","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy deliveries as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy deliveries as: Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","support":[{"end":17628,"quote":"Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":17509}],"target_id":"concept.eia.energy-deliveries","target_kind":"node","target_sha256":"522a04103818791f86296bcbba5158567e0f869fb8d0302c195c0318192afa21"}],"concept.eia.energy-management-and-control-system-emcs":[{"id":"assertion.concept.eia.energy-management-and-control-system-emcs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Energy management and control system(EMCS) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Energy management and control system(EMCS) as: An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","support":[{"end":22745,"quote":"An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":22394}],"target_id":"concept.eia.energy-management-and-control-system-emcs","target_kind":"node","target_sha256":"2c796b54b4be1bb8b897da6575837772a6da07ae9df88baf6198dca76047b53a"}],"concept.eia.engine-size":[{"id":"assertion.concept.eia.engine-size","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Engine size as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Engine size as: The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","support":[{"end":26723,"quote":"The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":26419}],"target_id":"concept.eia.engine-size","target_kind":"node","target_sha256":"e203ecf910962fd02ee7e2de051d20088fe187559f54635c1f4facd2c587ff65"}],"concept.eia.enrichment-tails-assay":[{"id":"assertion.concept.eia.enrichment-tails-assay","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Enrichment tails assay as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Enrichment tails assay as: A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","support":[{"end":27874,"quote":"A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":27162}],"target_id":"concept.eia.enrichment-tails-assay","target_kind":"node","target_sha256":"db51942b1b23b1568d1b4a77f1dbfd17ab8fa0b8fb98de35f47ceda1495a535a"}],"concept.eia.environmental-restoration":[{"id":"assertion.concept.eia.environmental-restoration","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Environmental restoration as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Environmental restoration as: Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","support":[{"end":29082,"quote":"Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":28771}],"target_id":"concept.eia.environmental-restoration","target_kind":"node","target_sha256":"3e0739ecc10f08689b7ed975c9d5233b69407e50b830a88d8a83acdba5048d67"}],"concept.eia.epa-certification":[{"id":"assertion.concept.eia.epa-certification","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"EPA certification as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines EPA certification as: A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","support":[{"end":29640,"quote":"A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":29472}],"target_id":"concept.eia.epa-certification","target_kind":"node","target_sha256":"cb121e7a9fcfb0ef2473cf99877b1455c88dd697d06f7ad8a9538e5499b5e489"}],"concept.eia.equilibrium-cycle":[{"id":"assertion.concept.eia.equilibrium-cycle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Equilibrium cycle as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Equilibrium cycle as: An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","support":[{"end":30072,"quote":"An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":29871}],"target_id":"concept.eia.equilibrium-cycle","target_kind":"node","target_sha256":"9a7c64ab2c2b9ed86134152a1f05c2fe555795e3696631da1d6e35e95d880221"}],"concept.eia.evacuated-tube-collector":[{"id":"assertion.concept.eia.evacuated-tube-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Evacuated-tube collector as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Evacuated-tube collector as: A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","support":[{"end":33606,"quote":"A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":33449}],"target_id":"concept.eia.evacuated-tube-collector","target_kind":"node","target_sha256":"7c1ca6dca982f9aeebf4e093c555ceea0f301d96117d519f23f940feb81f0781"}],"concept.eia.evaporative-cooler-swamp-cooler":[{"id":"assertion.concept.eia.evaporative-cooler-swamp-cooler","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Evaporative cooler (swamp cooler) as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Evaporative cooler (swamp cooler) as: An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","support":[{"end":33989,"quote":"An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":33841}],"target_id":"concept.eia.evaporative-cooler-swamp-cooler","target_kind":"node","target_sha256":"03340675eeae67f77901b6ddd2085fa892f244d50dc1fbcd1b71212552e828f6"}],"concept.eia.exploratory-well":[{"id":"assertion.concept.eia.exploratory-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Exploratory well as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Exploratory well as: A hole drilled a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","support":[{"end":37471,"quote":"A hole drilled\t\t  a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":37197}],"target_id":"concept.eia.exploratory-well","target_kind":"node","target_sha256":"ec8e898df77b95be7071a9316cf1235dda26675b218d6afa6f5d306f0d4c89f2"}],"concept.eia.extraction-loss":[{"id":"assertion.concept.eia.extraction-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Extraction loss as defined in the captured EIA glossary page E","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Extraction loss as: The extraction of gas plant liquids constituents such as","support":[{"end":38574,"quote":"The extraction of gas plant liquids constituents such as","source_id":"eia-glossary.E","source_sha256":"8295411725a9f4f528b8ff4e60266168576aa7a621575fe4c6d78398661bb6fa","start":38518}],"target_id":"concept.eia.extraction-loss","target_kind":"node","target_sha256":"c89aee8a30b1c7b8cb3e6624de7842ecded8c52afbe50f6c32da3908fe1f2c63"}],"concept.eia.fast-breeder-reactor-fbr":[{"id":"assertion.concept.eia.fast-breeder-reactor-fbr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fast breeder reactor (FBR) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fast breeder reactor (FBR) as: A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","support":[{"end":4260,"quote":"A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":3919}],"target_id":"concept.eia.fast-breeder-reactor-fbr","target_kind":"node","target_sha256":"e7502b6a2faa3679972945e59ab71d0838dadf3213dfb64e0c308af8cb5cf50a"}],"concept.eia.fission":[{"id":"assertion.concept.eia.fission","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fission as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fission as: The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","support":[{"end":14228,"quote":"The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":14011}],"target_id":"concept.eia.fission","target_kind":"node","target_sha256":"dd75d37bee40e1b3039096c97b4222f0c68f5808598a1096e4cb4d71e695efe3"}],"concept.eia.fixed-carbon":[{"id":"assertion.concept.eia.fixed-carbon","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fixed carbon as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fixed carbon as: The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","support":[{"end":15178,"quote":"The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":14885}],"target_id":"concept.eia.fixed-carbon","target_kind":"node","target_sha256":"439e8f86e8f7076f4f4bd21a17c0d08a742add6a52d37798a1055052f33e2785"}],"concept.eia.flat-plate-pumped":[{"id":"assertion.concept.eia.flat-plate-pumped","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flat plate pumped as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flat plate pumped as: A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium predominant use is in water-heating applications.","support":[{"end":17282,"quote":"A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium\t\t predominant use is in water-heating applications.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":17035}],"target_id":"concept.eia.flat-plate-pumped","target_kind":"node","target_sha256":"cb674112d1594256d1a573cd9d84a3732cb08d068e245acb7608a97137473fd0"}],"concept.eia.floating-storage-regasification-unit-fsru":[{"id":"assertion.concept.eia.floating-storage-regasification-unit-fsru","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Floating Storage Regasification Unit (FSRU) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Floating Storage Regasification Unit (FSRU) as: A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","support":[{"end":18665,"quote":"A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":18453}],"target_id":"concept.eia.floating-storage-regasification-unit-fsru","target_kind":"node","target_sha256":"7d916525b67c793c128ac1bfb482f59f300b507a129298b3d902d55e88d96479"}],"concept.eia.floor-wall-or-pipeless-furnace":[{"id":"assertion.concept.eia.floor-wall-or-pipeless-furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Floor, wall, or pipeless furnace as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Floor, wall, or pipeless furnace as: Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","support":[{"end":20018,"quote":"Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":19375}],"target_id":"concept.eia.floor-wall-or-pipeless-furnace","target_kind":"node","target_sha256":"900bd4063177e4834d4fb980240e98ba00da1a6cbd309c917f024e6863bdfcb7"}],"concept.eia.flue-gas-desulfurization":[{"id":"assertion.concept.eia.flue-gas-desulfurization","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue gas desulfurization as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue gas desulfurization as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","support":[{"end":20555,"quote":"Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20354}],"target_id":"concept.eia.flue-gas-desulfurization","target_kind":"node","target_sha256":"e4fed45639feaad620e42013857f1e9f088466313097c13afd8fb397521ed443"}],"concept.eia.flue-gas-desulfurization-unit-scrubber":[{"id":"assertion.concept.eia.flue-gas-desulfurization-unit-scrubber","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue-gas desulfurization unit (scrubber) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue-gas desulfurization unit (scrubber) as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","support":[{"end":20772,"quote":"Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20598}],"target_id":"concept.eia.flue-gas-desulfurization-unit-scrubber","target_kind":"node","target_sha256":"be6cc9d48440358aaa0da625875d61375c91f6ab745a5f9d9cb8ce8fa29b8800"}],"concept.eia.flue-gas-particulate-collector":[{"id":"assertion.concept.eia.flue-gas-particulate-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Flue-gas particulate collector as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Flue-gas particulate collector as: Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","support":[{"end":21058,"quote":"Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":20805}],"target_id":"concept.eia.flue-gas-particulate-collector","target_kind":"node","target_sha256":"30dc0091737c38c4c7b416d6d3ad286a4cef9ad59c3de278afe390befe3f3f47"}],"concept.eia.fluid-catalytic-cracking":[{"id":"assertion.concept.eia.fluid-catalytic-cracking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fluid catalytic cracking as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fluid catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","support":[{"end":21427,"quote":"The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":21085}],"target_id":"concept.eia.fluid-catalytic-cracking","target_kind":"node","target_sha256":"8eb98ff598bda593f9b0050fc69bc605e31c7f18cdc62e4a2ce90bc1c37978b1"}],"concept.eia.fluid-coking":[{"id":"assertion.concept.eia.fluid-coking","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fluid coking as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fluid coking as: A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","support":[{"end":21607,"quote":"A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":21442}],"target_id":"concept.eia.fluid-coking","target_kind":"node","target_sha256":"e1417d3c322c8c0a96318e9f799c7b74f366031f2e85d438cc0c9b5af7fd4349"}],"concept.eia.fly-ash":[{"id":"assertion.concept.eia.fly-ash","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fly ash as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fly ash as: Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","support":[{"end":23760,"quote":"Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":23530}],"target_id":"concept.eia.fly-ash","target_kind":"node","target_sha256":"c823ea23ab3427cc47b34d97b27f3dbf14a628b1a2494d9660d48fd110c23225"}],"concept.eia.forced-outage":[{"id":"assertion.concept.eia.forced-outage","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Forced outage as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Forced outage as: The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","support":[{"end":24718,"quote":"The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":24520}],"target_id":"concept.eia.forced-outage","target_kind":"node","target_sha256":"78f43ce0a0528d1e708d891172bf50e64540280ef476f91cfa744ae418e15281"}],"concept.eia.fossil-fuel-plant":[{"id":"assertion.concept.eia.fossil-fuel-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fossil fuel plant as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fossil fuel plant as: A plant using coal, petroleum, or gas as its source of energy.","support":[{"end":29545,"quote":"A plant using coal, petroleum, or gas as its source of energy.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29483}],"target_id":"concept.eia.fossil-fuel-plant","target_kind":"node","target_sha256":"14361a318071406ff8748f0d21fd339f900b2e6b9c44d6e973c52bc874ccc67a"}],"concept.eia.fossil-fuel-steam-electric-power-plant":[{"id":"assertion.concept.eia.fossil-fuel-steam-electric-power-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fossil fuel steam-electric power plant as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fossil fuel steam-electric power plant as: An electricity generation plant in which the","support":[{"end":29630,"quote":"An electricity generation plant in which the","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29586}],"target_id":"concept.eia.fossil-fuel-steam-electric-power-plant","target_kind":"node","target_sha256":"fdd8556fed944296a3a1f2eefd600da1a936f02f174f1a0046b4c5aa855b1374"}],"concept.eia.foundry-coke":[{"id":"assertion.concept.eia.foundry-coke","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Foundry coke as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Foundry coke as: This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","support":[{"end":30118,"quote":"This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":29837}],"target_id":"concept.eia.foundry-coke","target_kind":"node","target_sha256":"2d45adaaed46b597f6c96ca9e3baf6151aa334c60517c662a663ec008e3f1c1c"}],"concept.eia.fractionation":[{"id":"assertion.concept.eia.fractionation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fractionation as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fractionation as: The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","support":[{"end":30327,"quote":"The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":30164}],"target_id":"concept.eia.fractionation","target_kind":"node","target_sha256":"0cf8a4e7bdcd59819d9d19638fb0e81f68d67fc0e894a71efc9fdd3cda56b58e"}],"concept.eia.fresh-feed-input":[{"id":"assertion.concept.eia.fresh-feed-input","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fresh feed input as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fresh feed input as: Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","support":[{"end":31935,"quote":"Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":31692}],"target_id":"concept.eia.fresh-feed-input","target_kind":"node","target_sha256":"714664e4c9075571e2d190fbfa0b93a6a2f0da5a151a079335b80ecee207e03b"}],"concept.eia.fresh-feeds":[{"id":"assertion.concept.eia.fresh-feeds","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fresh feeds as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fresh feeds as: Crude oil or petroleum distillates that are being fed to processing units for the first time.","support":[{"end":32386,"quote":"Crude oil or petroleum distillates that are being fed to processing units for the first time.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":32293}],"target_id":"concept.eia.fresh-feeds","target_kind":"node","target_sha256":"4d1a301a701667003ddec408868a849f337b9c4999acca2b30302ed66aef062f"}],"concept.eia.fuel-cell":[{"id":"assertion.concept.eia.fuel-cell","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel cell as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel cell as: A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","support":[{"end":32767,"quote":"A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":32664}],"target_id":"concept.eia.fuel-cell","target_kind":"node","target_sha256":"c04bf2ed026e174d8c13afb5e6937f6f04c3a6f2f170f4336949e100fc55b0c1"}],"concept.eia.fuel-cell-electric-vehicle-fcev":[{"id":"assertion.concept.eia.fuel-cell-electric-vehicle-fcev","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel cell electric vehicle (FCEV) as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel cell electric vehicle (FCEV) as: An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","support":[{"end":33274,"quote":"An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":33117}],"target_id":"concept.eia.fuel-cell-electric-vehicle-fcev","target_kind":"node","target_sha256":"8932515bbd383fb1d979ebe408a2652d6bfc48ca2a40a662d87396865e663246"}],"concept.eia.fuel-injection":[{"id":"assertion.concept.eia.fuel-injection","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuel injection as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuel injection as: A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","support":[{"end":35896,"quote":"A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":35341}],"target_id":"concept.eia.fuel-injection","target_kind":"node","target_sha256":"ac2cdc1907235af954f862afa25d47636958a7f3e450513e534c5f98c4876ca8"}],"concept.eia.fuels-solvent-deasphalting":[{"id":"assertion.concept.eia.fuels-solvent-deasphalting","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fuels solvent deasphalting as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fuels solvent deasphalting as: A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","support":[{"end":38259,"quote":"A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38084}],"target_id":"concept.eia.fuels-solvent-deasphalting","target_kind":"node","target_sha256":"7b9d274020fa714ae768f3ab0ead3ed82ff4b00dbad8c19fa5aaa7751ebe9669"}],"concept.eia.fugitive-emissions":[{"id":"assertion.concept.eia.fugitive-emissions","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Fugitive emissions as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Fugitive emissions as: Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","support":[{"end":38377,"quote":"Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38280}],"target_id":"concept.eia.fugitive-emissions","target_kind":"node","target_sha256":"97271d9cd3d63c5442d07bc3fbe8745961cca414dad804a7f2a8d38d44448ba8"}],"concept.eia.full-power-day":[{"id":"assertion.concept.eia.full-power-day","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Full power day as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Full power day as: The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","support":[{"end":38702,"quote":"The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38511}],"target_id":"concept.eia.full-power-day","target_kind":"node","target_sha256":"7f624c7868f9fe35378207b4dc4d5f2fb7543b042e0ed830ed4cae90cc4dba14"}],"concept.eia.full-power-operation":[{"id":"assertion.concept.eia.full-power-operation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Full power operation as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Full power operation as: Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","support":[{"end":38835,"quote":"Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":38725}],"target_id":"concept.eia.full-power-operation","target_kind":"node","target_sha256":"5855351be8b6089821baa55c3fe78d7b5d924323cfc08f32f3368610ea879684"}],"concept.eia.furnace":[{"id":"assertion.concept.eia.furnace","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Furnace as defined in the captured EIA glossary page F","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Furnace as: The part of a boiler or warm-air space-heating plant in which combustion takes place.","support":[{"end":39315,"quote":"The part of a boiler or warm-air space-heating plant in which combustion takes place.","source_id":"eia-glossary.F","source_sha256":"27beb9d997152919bb858daca5a5d7caf16a4d1359856ea0eab312e6fc4afeda","start":39230}],"target_id":"concept.eia.furnace","target_kind":"node","target_sha256":"6d61b041ab1936f0dfca8a3ae7548993c7bebb5c82041bc345652c7b75e934f2"}],"concept.eia.gas-cooled-fast-breeder-reactor-gcfb":[{"id":"assertion.concept.eia.gas-cooled-fast-breeder-reactor-gcfb","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas cooled fast breeder reactor (GCFB) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas cooled fast breeder reactor (GCFB) as: A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","support":[{"end":1015,"quote":"A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":936}],"target_id":"concept.eia.gas-cooled-fast-breeder-reactor-gcfb","target_kind":"node","target_sha256":"f78d43379ae96a1ef118f0e8aea78534ab7c0ebbf77c37e6aac262dace21a713"}],"concept.eia.gas-to-liquids-gtl":[{"id":"assertion.concept.eia.gas-to-liquids-gtl","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas to liquids (GTL) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas to liquids (GTL) as: A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","support":[{"end":1983,"quote":"A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":1836}],"target_id":"concept.eia.gas-to-liquids-gtl","target_kind":"node","target_sha256":"bf2751eb28a7b99b9ef74ef98ee23ef2623a014c783fa16e7f4265523dcc089b"}],"concept.eia.gas-turbine-plant":[{"id":"assertion.concept.eia.gas-turbine-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas turbine plant as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas turbine plant as: A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","support":[{"end":2329,"quote":"A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2003}],"target_id":"concept.eia.gas-turbine-plant","target_kind":"node","target_sha256":"97cf8aefcdea64e7b62a1f2241cb5458b82f1042ba14ad9c27bde9eb98ad8d66"}],"concept.eia.gas-well":[{"id":"assertion.concept.eia.gas-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas well as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas well as: A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","support":[{"end":2495,"quote":"A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2340}],"target_id":"concept.eia.gas-well","target_kind":"node","target_sha256":"2393d601b89802f11fe7222844c99c8f5b5fffeff5bdabd3e9fd477123491f5a"}],"concept.eia.gas-well-productivity":[{"id":"assertion.concept.eia.gas-well-productivity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gas well productivity as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gas well productivity as: Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","support":[{"end":2710,"quote":"Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2519}],"target_id":"concept.eia.gas-well-productivity","target_kind":"node","target_sha256":"edc9de49fde6efe04eab2cfed53fee178c32a050ac3f59803982ccb588d0936e"}],"concept.eia.gasohol":[{"id":"assertion.concept.eia.gasohol","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasohol as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasohol as: A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","support":[{"end":3086,"quote":"A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":2916}],"target_id":"concept.eia.gasohol","target_kind":"node","target_sha256":"f247280ab1f873697ef78d7479be4d4d52dde001272418b15fd0be34ed26d7ea"}],"concept.eia.gasoline-blending-components":[{"id":"assertion.concept.eia.gasoline-blending-components","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasoline blending components as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasoline blending components as: Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","support":[{"end":3500,"quote":"Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":3256}],"target_id":"concept.eia.gasoline-blending-components","target_kind":"node","target_sha256":"ab079472f6d35de03ea7d3bf55f0bb7b8fa986231b80eec1a4bb85c453abff4a"}],"concept.eia.gasoline-motor-leaded":[{"id":"assertion.concept.eia.gasoline-motor-leaded","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gasoline motor, (leaded) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gasoline motor, (leaded) as: Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","support":[{"end":4937,"quote":"Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":4556}],"target_id":"concept.eia.gasoline-motor-leaded","target_kind":"node","target_sha256":"fcc4abb300fa0af3b088b2fe2742cc6f88a648bd411723afe4d05c739f36fd53"}],"concept.eia.gate-station":[{"id":"assertion.concept.eia.gate-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gate station as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gate station as: Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","support":[{"end":5485,"quote":"Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":5296}],"target_id":"concept.eia.gate-station","target_kind":"node","target_sha256":"ae8e99d53f3e8ca35a27dd230761a7a17d4a5426d5827c65f9f0747d1138d34c"}],"concept.eia.generating-station":[{"id":"assertion.concept.eia.generating-station","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generating station as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generating station as: A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","support":[{"end":6311,"quote":"A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6164}],"target_id":"concept.eia.generating-station","target_kind":"node","target_sha256":"376f6f5836196a981e27fad282f726f88605cd9b46e7b64f447a201fd6c96a4f"}],"concept.eia.generating-unit":[{"id":"assertion.concept.eia.generating-unit","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generating unit as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generating unit as: Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","support":[{"end":6488,"quote":"Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6329}],"target_id":"concept.eia.generating-unit","target_kind":"node","target_sha256":"3ffa96a9231de80fbbe26df08d88673c1935b73f83858ac07e13ac1815fa6948"}],"concept.eia.generator-capacity":[{"id":"assertion.concept.eia.generator-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generator capacity as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generator capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","support":[{"end":7008,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":6865}],"target_id":"concept.eia.generator-capacity","target_kind":"node","target_sha256":"fa99ab963d3e12059edac68c274f3f66d58a3486da15ceb48d426c69f5a6b522"}],"concept.eia.generator-nameplate-capacity-installed":[{"id":"assertion.concept.eia.generator-nameplate-capacity-installed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Generator nameplate capacity (installed) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Generator nameplate capacity (installed) as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","support":[{"end":7364,"quote":"The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":7051}],"target_id":"concept.eia.generator-nameplate-capacity-installed","target_kind":"node","target_sha256":"1bab87182ff21e042c42e1ab79a5933b437f344b6e2c5ce2376b96e5868e2607"}],"concept.eia.geologic-sequestration":[{"id":"assertion.concept.eia.geologic-sequestration","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Geologic sequestration as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Geologic sequestration as: A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","support":[{"end":8403,"quote":"A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":8188}],"target_id":"concept.eia.geologic-sequestration","target_kind":"node","target_sha256":"3397e86d1e9756ef39c98a0336068f7dbea6bd97e7cfd2f59118c1720f9a5bfb"}],"concept.eia.geothermal-plant":[{"id":"assertion.concept.eia.geothermal-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Geothermal plant as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Geothermal plant as: A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","support":[{"end":9373,"quote":"A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":9190}],"target_id":"concept.eia.geothermal-plant","target_kind":"node","target_sha256":"04db16c49b5118e7316616df0ac8a019a8bbffc864cc78fe934273989c990387"}],"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month":[{"id":"assertion.concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross additions to construction work in progress for the month as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross additions to construction work in progress for the month as: This amount should include the monthly gross additions for an electric plant in the process of construction.","support":[{"end":12741,"quote":"This amount should include the monthly gross additions for an electric plant in the process of construction.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":12633}],"target_id":"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","target_kind":"node","target_sha256":"6e3c5aec4631b8aa44b119946d31a7f8dec092288b6f21fb2e7f1ae4080370be"}],"concept.eia.gross-gas-withdrawal":[{"id":"assertion.concept.eia.gross-gas-withdrawal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross gas withdrawal as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross gas withdrawal as: The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","support":[{"end":14475,"quote":"The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":14358}],"target_id":"concept.eia.gross-gas-withdrawal","target_kind":"node","target_sha256":"d50e4a98a2565d64b83ef3adf4342171067b3d6509ce3e442ab1ea51b5f664dd"}],"concept.eia.gross-inputs":[{"id":"assertion.concept.eia.gross-inputs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross inputs as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross inputs as: The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","support":[{"end":15408,"quote":"The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":15296}],"target_id":"concept.eia.gross-inputs","target_kind":"node","target_sha256":"e64b76c8b86a68fc0a9997af92c39716846a6094966972b1437f494d24ca505a"}],"concept.eia.gross-vehicle-weight-rating-gvwr":[{"id":"assertion.concept.eia.gross-vehicle-weight-rating-gvwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Gross vehicle weight rating (GVWR) as defined in the captured EIA glossary page G","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Gross vehicle weight rating (GVWR) as: Vehicle weight plus carrying capacity.","support":[{"end":15828,"quote":"Vehicle weight plus carrying capacity.","source_id":"eia-glossary.G","source_sha256":"2dfe6b9a0a771c2bc185d71853f2547263a4f1c522a6ad4eca800a699ff335ee","start":15790}],"target_id":"concept.eia.gross-vehicle-weight-rating-gvwr","target_kind":"node","target_sha256":"de148f9b990a6360c13155812112cb4e0d5acda683aaadd13f6a03e3a88e6378"}],"concept.eia.heat-content":[{"id":"assertion.concept.eia.heat-content","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat content as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat content as: The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam). The amount of heat energy is commonly expressed in British thermal units (Btu). Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process). The Energy Information Administration typically uses gross heat content values.","support":[{"end":2778,"quote":"The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam).  The amount of heat energy is commonly expressed in British thermal units (Btu).  Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process).  The Energy Information Administration typically uses gross heat content values.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":1998}],"target_id":"concept.eia.heat-content","target_kind":"node","target_sha256":"30daf1012205eb40ae6685f38992c5190cdb160e07bb9d5fb511bdd392654c32"}],"concept.eia.heat-pump":[{"id":"assertion.concept.eia.heat-pump","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump as: Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","support":[{"end":3151,"quote":"Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":2790}],"target_id":"concept.eia.heat-pump","target_kind":"node","target_sha256":"a910a57fb1ea3cbc5245ce849064a8e4b27ed8e80157416459c6ac8902d81fa9"}],"concept.eia.heat-pump-air-source":[{"id":"assertion.concept.eia.heat-pump-air-source","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump (air source) as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump (air source) as: An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","support":[{"end":3638,"quote":"An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":3176}],"target_id":"concept.eia.heat-pump-air-source","target_kind":"node","target_sha256":"3708442d3ee7e5fa077f3c67afd3599005af46df1a366bbd41e07aa1e52bd017"}],"concept.eia.heat-pump-geothermal":[{"id":"assertion.concept.eia.heat-pump-geothermal","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heat pump (geothermal) as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heat pump (geothermal) as: A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","support":[{"end":4059,"quote":"A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":3663}],"target_id":"concept.eia.heat-pump-geothermal","target_kind":"node","target_sha256":"da90ba3476630b5a70408cf88cbb2a216842c5985455c61b2e3eb08b1aa6a139"}],"concept.eia.heating-value":[{"id":"assertion.concept.eia.heating-value","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heating value as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heating value as: Heating value: A measure of the energy content of the physical unit of any combustible fuel. For a fuller discussion of","support":[{"end":7572,"quote":"Heating value: A measure of the energy content of the physical unit of any combustible fuel.  For a fuller discussion of","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":7452}],"target_id":"concept.eia.heating-value","target_kind":"node","target_sha256":"37cd7f564678a1c37b0910a4e04372e32acdfe2abf3f715406aaefa7d2bba11d"}],"concept.eia.heavy-water-moderated-reactor":[{"id":"assertion.concept.eia.heavy-water-moderated-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heavy-water-moderated reactor as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heavy-water-moderated reactor as: A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","support":[{"end":8935,"quote":"A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":8769}],"target_id":"concept.eia.heavy-water-moderated-reactor","target_kind":"node","target_sha256":"0df40245b2c899c279b6cb2ef9d7594132d1bd6e5bb540f5e8e87562a298d887"}],"concept.eia.heliostat":[{"id":"assertion.concept.eia.heliostat","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Heliostat as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Heliostat as: A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","support":[{"end":9507,"quote":"A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":9248}],"target_id":"concept.eia.heliostat","target_kind":"node","target_sha256":"25bc35c97b1d9da04bdbce27af17bdd48bc8f4c84a791b2b6f050a354208e6e3"}],"concept.eia.high-efficiency-ballast":[{"id":"assertion.concept.eia.high-efficiency-ballast","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"High efficiency ballast as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines High efficiency ballast as: A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","support":[{"end":10201,"quote":"A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":9784}],"target_id":"concept.eia.high-efficiency-ballast","target_kind":"node","target_sha256":"1b36eaa94a540191b3cd2870fcb5a2358fc4524b1e0ddc87c1dac8eaf008f8bf"}],"concept.eia.high-temperature-collector":[{"id":"assertion.concept.eia.high-temperature-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"High-temperature collector as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines High-temperature collector as: A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","support":[{"end":10979,"quote":"A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":10880}],"target_id":"concept.eia.high-temperature-collector","target_kind":"node","target_sha256":"7a2322a5b8988db87f9a93d983664e762af17fdadcb4e3c20ab617e75efb8c02"}],"concept.eia.horizontal-axis-wind-turbine":[{"id":"assertion.concept.eia.horizontal-axis-wind-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Horizontal axis wind turbine as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Horizontal axis wind turbine as: The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","support":[{"end":12058,"quote":"The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":11960}],"target_id":"concept.eia.horizontal-axis-wind-turbine","target_kind":"node","target_sha256":"8c0ce301e4cc99dfa9da0f28b4ceba5565890e446bad8ad25e93b35e88c8fe55"}],"concept.eia.horsepower":[{"id":"assertion.concept.eia.horsepower","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Horsepower as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Horsepower as: A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","support":[{"end":12404,"quote":"A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":12298}],"target_id":"concept.eia.horsepower","target_kind":"node","target_sha256":"5753286082cd2c36ad1f78c0d9b3324df09071bc0e86dd327ebd5ac4221151f1"}],"concept.eia.hours-under-load":[{"id":"assertion.concept.eia.hours-under-load","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hours under load as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hours under load as: The hours the boiler is operating to drive the generator producing electricity.","support":[{"end":13339,"quote":"The hours the boiler is operating to drive the generator producing electricity.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":13260}],"target_id":"concept.eia.hours-under-load","target_kind":"node","target_sha256":"df95ad192af05807c77f16b79aa9576f83eed8bf9be46e62db7d4aa1c87bef2b"}],"concept.eia.htgr":[{"id":"assertion.concept.eia.htgr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HTGR as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HTGR as: High Temperature Gas-cooled Reactor","support":[{"end":14549,"quote":"High Temperature Gas-cooled Reactor","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14514}],"target_id":"concept.eia.htgr","target_kind":"node","target_sha256":"17095501a2bb5797562ee0b10c80a4d84417c9428e4cd450696dac0fb0c89597"}],"concept.eia.hub-height":[{"id":"assertion.concept.eia.hub-height","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hub height as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hub height as: In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","support":[{"end":14655,"quote":"In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14562}],"target_id":"concept.eia.hub-height","target_kind":"node","target_sha256":"995a0f1cfbf437b9d617470ec8cdfc714f7a84220b87ae0aecf9d47093ce1dc3"}],"concept.eia.humidifier":[{"id":"assertion.concept.eia.humidifier","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Humidifier as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Humidifier as: A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","support":[{"end":14819,"quote":"A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":14668}],"target_id":"concept.eia.humidifier","target_kind":"node","target_sha256":"bcba181b7dc9141d769dfe3880e535e50c90a626c83eb0add57249cc75560822"}],"concept.eia.hvac":[{"id":"assertion.concept.eia.hvac","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HVAC as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HVAC as: An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","support":[{"end":15140,"quote":"An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":15010}],"target_id":"concept.eia.hvac","target_kind":"node","target_sha256":"b334c182f1bc7cbe900989762736f4ddea05d02ef882c6974c3c62edfbf9d261"}],"concept.eia.hvac-conservation-feature":[{"id":"assertion.concept.eia.hvac-conservation-feature","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"HVAC conservation feature as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines HVAC conservation feature as: A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","support":[{"end":15287,"quote":"A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":15168}],"target_id":"concept.eia.hvac-conservation-feature","target_kind":"node","target_sha256":"402ece4cabb07a1b4cb88a4189eba96a0da361fd84324be08da3a83f1706c9f9"}],"concept.eia.hybrid-transmission-line":[{"id":"assertion.concept.eia.hybrid-transmission-line","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hybrid transmission line as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hybrid transmission line as: A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","support":[{"end":16171,"quote":"A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16035}],"target_id":"concept.eia.hybrid-transmission-line","target_kind":"node","target_sha256":"a8fec158218c20fc6d0d23758d5261b18cd499eb90247152eed0492540d49b92"}],"concept.eia.hydraulic-fracturing":[{"id":"assertion.concept.eia.hydraulic-fracturing","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hydraulic fracturing as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hydraulic fracturing as: A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open. Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used. The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used. Hydraulic fracturing is common in low-permeability formations.","support":[{"end":16881,"quote":"A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open.  Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used.  The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used.  Hydraulic fracturing is common in low-permeability formations.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16194}],"target_id":"concept.eia.hydraulic-fracturing","target_kind":"node","target_sha256":"6979c44cb49f3b37a83a689e42cb780adccc4f9c2214b2c929f6a1d0fd85199c"}],"concept.eia.hydraulic-head":[{"id":"assertion.concept.eia.hydraulic-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Hydraulic head as defined in the captured EIA glossary page H","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Hydraulic head as: The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","support":[{"end":17072,"quote":"The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","source_id":"eia-glossary.H","source_sha256":"b039f29cb17384a7f53a4f50833e889840b969f81c498741c0d774ba8dc93d14","start":16898}],"target_id":"concept.eia.hydraulic-head","target_kind":"node","target_sha256":"f12968bf619393080ee8ed6be92348c367d422425f058570fb52670e5be9736b"}],"concept.eia.improved-recovery":[{"id":"assertion.concept.eia.improved-recovery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Improved recovery as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Improved recovery as: Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","support":[{"end":3133,"quote":"Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":2981}],"target_id":"concept.eia.improved-recovery","target_kind":"node","target_sha256":"357bb412abbfeb189649ad35375134d00134a210a7115ea15b1b50c55de66362"}],"concept.eia.incandescent-lamp":[{"id":"assertion.concept.eia.incandescent-lamp","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Incandescent lamp as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Incandescent lamp as: A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","support":[{"end":4815,"quote":"A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":4345}],"target_id":"concept.eia.incandescent-lamp","target_kind":"node","target_sha256":"a1acb78d6478d64ffda1229c38e0f0ab8e5dc447adbcd2a28563faee252d7edf"}],"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs":[{"id":"assertion.concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Incandescent light bulbs, including regular or energy-efficient light bulbs as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Incandescent light bulbs, including regular or energy-efficient light bulbs as: An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","support":[{"end":5974,"quote":"An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles\t\t bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":4893}],"target_id":"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","target_kind":"node","target_sha256":"ee6ddaf4fee6676e65f006813857a78419ebe2acd7dbdc8ff64a20b0b61e7bea"}],"concept.eia.independent-system-operator-iso":[{"id":"assertion.concept.eia.independent-system-operator-iso","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Independent system operator (ISO) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Independent system operator (ISO) as: An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","support":[{"end":7965,"quote":"An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":7782}],"target_id":"concept.eia.independent-system-operator-iso","target_kind":"node","target_sha256":"54c248abf77e0718ed44a7cf03ebc26520f187a60d14681f1abbb5a9fd942409"}],"concept.eia.initial-operation":[{"id":"assertion.concept.eia.initial-operation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Initial operation as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Initial operation as: First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","support":[{"end":13325,"quote":"First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":13152}],"target_id":"concept.eia.initial-operation","target_kind":"node","target_sha256":"12b408e7f393ed5c60d0c1875a718365c1d48beba1d1744be3c672d6027e77ba"}],"concept.eia.insulator":[{"id":"assertion.concept.eia.insulator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Insulator as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Insulator as: A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","support":[{"end":15931,"quote":"A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":15652}],"target_id":"concept.eia.insulator","target_kind":"node","target_sha256":"298c403918d50fd74069b931a70254c7ceb9640af99a88bbf835b85d527b84a7"}],"concept.eia.integral-collector-storage-ics":[{"id":"assertion.concept.eia.integral-collector-storage-ics","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integral collector storage (ICS) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integral collector storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","support":[{"end":16483,"quote":"A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16380}],"target_id":"concept.eia.integral-collector-storage-ics","target_kind":"node","target_sha256":"39a5b00ffb3cd71c3b3be1375ab95ea97531874d8ccf7e800dbb24acac79a564"}],"concept.eia.integrated-demand":[{"id":"assertion.concept.eia.integrated-demand","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integrated demand as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integrated demand as: The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","support":[{"end":16676,"quote":"The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16503}],"target_id":"concept.eia.integrated-demand","target_kind":"node","target_sha256":"0910eb411c212d97735430fb077265102e3af9590ae7c21a02b69201ac5d7ca9"}],"concept.eia.integrated-gasification-combined-cycle-technology":[{"id":"assertion.concept.eia.integrated-gasification-combined-cycle-technology","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Integrated gasification-combined cycle technology as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Integrated gasification-combined cycle technology as: Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","support":[{"end":17130,"quote":"Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":16728}],"target_id":"concept.eia.integrated-gasification-combined-cycle-technology","target_kind":"node","target_sha256":"01b07815dc57beee1e39a9314eaeb3a946e1dd0268468d1a9928fc8159e9f38f"}],"concept.eia.interconnected-system":[{"id":"assertion.concept.eia.interconnected-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interconnected system as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interconnected system as: A system consisting of two or more individual power systems normally operating with connecting tie lines.","support":[{"end":18837,"quote":"A system consisting of two or more individual power systems normally operating with connecting tie lines.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":18732}],"target_id":"concept.eia.interconnected-system","target_kind":"node","target_sha256":"1a38e0f11f30672b81d35da2c007a1dea536239f2e64e71bf36d98646c59e35a"}],"concept.eia.intermediate-grade-gasoline":[{"id":"assertion.concept.eia.intermediate-grade-gasoline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermediate grade gasoline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermediate grade gasoline as: A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","support":[{"end":20682,"quote":"A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20473}],"target_id":"concept.eia.intermediate-grade-gasoline","target_kind":"node","target_sha256":"2d3ee16d8bb01fb3e986fb03e77c3e67a47a3986cce77f9c9de99f3f2c41c598"}],"concept.eia.intermediate-load-electric-system":[{"id":"assertion.concept.eia.intermediate-load-electric-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermediate load (electric system) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermediate load (electric system) as: The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","support":[{"end":20885,"quote":"The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20720}],"target_id":"concept.eia.intermediate-load-electric-system","target_kind":"node","target_sha256":"a58559722554662f0d39292864d726d2dbbbf0ed37f9e69a256b30d5e6552630"}],"concept.eia.intermittent-electric-generator-or-intermittent-resource":[{"id":"assertion.concept.eia.intermittent-electric-generator-or-intermittent-resource","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intermittent electric generator or intermittent resource as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intermittent electric generator or intermittent resource as: An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","support":[{"end":21324,"quote":"An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":20944}],"target_id":"concept.eia.intermittent-electric-generator-or-intermittent-resource","target_kind":"node","target_sha256":"23cecca50b30cd379661690fdcd7fe59a77ccc83d1bb3ee3de71b800b9ac2abf"}],"concept.eia.internal-collector-storage-ics":[{"id":"assertion.concept.eia.internal-collector-storage-ics","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal Collector Storage (ICS) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal Collector Storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","support":[{"end":21453,"quote":"A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21359}],"target_id":"concept.eia.internal-collector-storage-ics","target_kind":"node","target_sha256":"022d8f136e66b1dd29d672a7c1ea951aced836795a3bedcaa0bc103bc3a8fc92"}],"concept.eia.internal-combustion-engine-ice":[{"id":"assertion.concept.eia.internal-combustion-engine-ice","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal combustion engine (ICE) as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal combustion engine (ICE) as: Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","support":[{"end":21625,"quote":"Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21488}],"target_id":"concept.eia.internal-combustion-engine-ice","target_kind":"node","target_sha256":"532d131b37ac9c80537ad1b21e2f88858e6eb899cdd7987ed0a342c8eb36eb3c"}],"concept.eia.internal-combustion-plant":[{"id":"assertion.concept.eia.internal-combustion-plant","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Internal combustion plant as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Internal combustion plant as: A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","support":[{"end":22073,"quote":"A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":21653}],"target_id":"concept.eia.internal-combustion-plant","target_kind":"node","target_sha256":"7dbfa90173501c55ffc210de77182cac5da8efa89326434cf97b163da99b5989"}],"concept.eia.interruptible-load":[{"id":"assertion.concept.eia.interruptible-load","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interruptible load as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interruptible load as: This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","support":[{"end":22749,"quote":"This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":22361}],"target_id":"concept.eia.interruptible-load","target_kind":"node","target_sha256":"aa6b05642cb8dff11811643768f7148e7193aa4032d4dff092a5455564d2ec33"}],"concept.eia.interstate-pipeline":[{"id":"assertion.concept.eia.interstate-pipeline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Interstate pipeline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Interstate pipeline as: Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","support":[{"end":24000,"quote":"Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":23850}],"target_id":"concept.eia.interstate-pipeline","target_kind":"node","target_sha256":"5ba30ee3436758d96c4c6b7320882d734300344d4bbba343b164bd8968f1fe98"}],"concept.eia.intrastate-pipeline":[{"id":"assertion.concept.eia.intrastate-pipeline","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Intrastate pipeline as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Intrastate pipeline as: Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","support":[{"end":25272,"quote":"Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":24968}],"target_id":"concept.eia.intrastate-pipeline","target_kind":"node","target_sha256":"431d8d5284955174e284c10404a7a71f4badf512eb9d5cbf4e413a838d2a67b0"}],"concept.eia.ion-exchange":[{"id":"assertion.concept.eia.ion-exchange","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ion exchange as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ion exchange as: Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","support":[{"end":26463,"quote":"Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":26195}],"target_id":"concept.eia.ion-exchange","target_kind":"node","target_sha256":"13c433551e8a0c83aeea8fc9e7c73ff517099e4651b75be2c76089b332175647"}],"concept.eia.irradiated-nuclear-fuel":[{"id":"assertion.concept.eia.irradiated-nuclear-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Irradiated nuclear fuel as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Irradiated nuclear fuel as: Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","support":[{"end":27043,"quote":"Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":26956}],"target_id":"concept.eia.irradiated-nuclear-fuel","target_kind":"node","target_sha256":"1a125d5cf06cb317c9d08f0d79e496b8c54597565553792db1494e29d5a6b718"}],"concept.eia.isomerization":[{"id":"assertion.concept.eia.isomerization","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Isomerization as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Isomerization as: A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","support":[{"end":27949,"quote":"A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":27754}],"target_id":"concept.eia.isomerization","target_kind":"node","target_sha256":"2a9856581662062e6422cc575d4fdc0930821e5839371f9093e277b50d881118"}],"concept.eia.isopach":[{"id":"assertion.concept.eia.isopach","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Isopach as defined in the captured EIA glossary page I","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Isopach as: A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","support":[{"end":28203,"quote":"A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","source_id":"eia-glossary.I","source_sha256":"bb576f15676bedd773e8cff886a3a5437d735eb1c1da93e6e95d3f7f675454a9","start":28105}],"target_id":"concept.eia.isopach","target_kind":"node","target_sha256":"cfe47036cf512e4da77f1612062a849d13f74e190aedea2180651f8bdd4082f1"}],"concept.eia.jacket":[{"id":"assertion.concept.eia.jacket","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Jacket as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Jacket as: The enclosure on a water heater, furnace, or boiler.","support":[{"end":545,"quote":"The enclosure on a water heater, furnace, or boiler.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":493}],"target_id":"concept.eia.jacket","target_kind":"node","target_sha256":"8bc871b33194c7697a5f8761f06c2bb89a9f85ca72a8d32267244f533634fe84"}],"concept.eia.joint-use-facility":[{"id":"assertion.concept.eia.joint-use-facility","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Joint-use facility as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Joint-use facility as: A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","support":[{"end":1170,"quote":"A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":1048}],"target_id":"concept.eia.joint-use-facility","target_kind":"node","target_sha256":"bbad8d8b5e5091d45439dd4027a3f43aa7c7576d750fcdfaeef6662f7873fe1c"}],"concept.eia.joule-j":[{"id":"assertion.concept.eia.joule-j","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Joule (J) as defined in the captured EIA glossary page J","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Joule (J) as: The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","support":[{"end":1422,"quote":"The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","source_id":"eia-glossary.J","source_sha256":"87863bd0a2daaee92ba0a51ad5f0352bfa5f1eb8d90c0b5ce3f62b5c1d7c605f","start":1182}],"target_id":"concept.eia.joule-j","target_kind":"node","target_sha256":"f9c0bfb804ef389585507e653db5d68d307170623152d5c7bf50c7259a30fcfc"}],"concept.eia.kaplan-turbine":[{"id":"assertion.concept.eia.kaplan-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kaplan turbine as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kaplan turbine as: A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","support":[{"end":653,"quote":"A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":501}],"target_id":"concept.eia.kaplan-turbine","target_kind":"node","target_sha256":"bc89024e8c840ab878ac4e8544f6b46d4604fa6a2d82274c548b78d0a858d04b"}],"concept.eia.kerogen":[{"id":"assertion.concept.eia.kerogen","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kerogen as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kerogen as: Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents. Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments. Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","support":[{"end":968,"quote":"Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents.  Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments.  Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":663}],"target_id":"concept.eia.kerogen","target_kind":"node","target_sha256":"687052d996f495366d4ca712f657c0d4815eebdb9a1697d426c2e01c9e1fcecf"}],"concept.eia.kerosene":[{"id":"assertion.concept.eia.kerosene","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kerosene as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kerosene as: A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","support":[{"end":1599,"quote":"A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":979}],"target_id":"concept.eia.kerosene","target_kind":"node","target_sha256":"035d05283b274ddcb861337531159a80f9d794ecfe11ec1c6d1fdc232754489a"}],"concept.eia.kilovolt-ampere-kva":[{"id":"assertion.concept.eia.kilovolt-ampere-kva","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kilovolt-Ampere (kVa) as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kilovolt-Ampere (kVa) as: A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","support":[{"end":2487,"quote":"A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":2357}],"target_id":"concept.eia.kilovolt-ampere-kva","target_kind":"node","target_sha256":"718aca2ab07d6224e360abd17f810887cc55c27b3463a1bafd3d89999049ba60"}],"concept.eia.kilowatthour-kwh":[{"id":"assertion.concept.eia.kilowatthour-kwh","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Kilowatthour (kWh) as defined in the captured EIA glossary page K","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Kilowatthour (kWh) as: A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","support":[{"end":2772,"quote":"A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","source_id":"eia-glossary.K","source_sha256":"0063d9cc752b940f6149a33650080e5e53fa8ee2c6c02f30e4c5b1521b7607fc","start":2609}],"target_id":"concept.eia.kilowatthour-kwh","target_kind":"node","target_sha256":"8e5c528fc655abfb8bdf621c79e3b79e2e606ae3b8d22ec9aa31fcf6e035b043"}],"concept.eia.landfill-gas":[{"id":"assertion.concept.eia.landfill-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Landfill gas as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Landfill gas as: Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content). The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","support":[{"end":1754,"quote":"Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content).  The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":1197}],"target_id":"concept.eia.landfill-gas","target_kind":"node","target_sha256":"f785c572b764fc771ac0b952d57bc991f073766805db7515847fe40f7e96f9ae"}],"concept.eia.large-scale-solar":[{"id":"assertion.concept.eia.large-scale-solar","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Large-scale solar as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Large-scale solar as: Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","support":[{"end":2188,"quote":"Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":2087}],"target_id":"concept.eia.large-scale-solar","target_kind":"node","target_sha256":"c769003cff89aade881911c946bafcaf8ffd6cd1d7db353041f6eee982a6da0f"}],"concept.eia.lead-acid-battery":[{"id":"assertion.concept.eia.lead-acid-battery","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lead acid battery as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lead acid battery as: An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","support":[{"end":2650,"quote":"An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":2540}],"target_id":"concept.eia.lead-acid-battery","target_kind":"node","target_sha256":"68d68f0c502449e4829d752096ee7f35bb04052390a90f613a7dd73e772b9a3b"}],"concept.eia.leading-edge":[{"id":"assertion.concept.eia.leading-edge","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Leading edge as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","support":[{"end":3300,"quote":"In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":3171}],"target_id":"concept.eia.leading-edge","target_kind":"node","target_sha256":"1045576217fdaaf48a99b0bc463b3d91ade2433b59f0419423c17a2d2eda6ddf"}],"concept.eia.life-extension":[{"id":"assertion.concept.eia.life-extension","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Life extension as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Life extension as: Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","support":[{"end":6740,"quote":"Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":6473}],"target_id":"concept.eia.life-extension","target_kind":"node","target_sha256":"fd92050348a116f0eb30427916043e29154bbe252f9ae5104c071b02eb5c2c70"}],"concept.eia.lift":[{"id":"assertion.concept.eia.lift","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lift as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lift as: The force that pulls a wind turbine blade, as opposed to drag.","support":[{"end":6809,"quote":"The force that pulls a wind turbine blade, as opposed to drag.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":6747}],"target_id":"concept.eia.lift","target_kind":"node","target_sha256":"9aced2e254acd091a5968a809791b7afe7a44b9f071fe0bc0163e66327d2480e"}],"concept.eia.light-water-reactor-lwr":[{"id":"assertion.concept.eia.light-water-reactor-lwr","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Light water reactor (LWR) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Light water reactor (LWR) as: A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","support":[{"end":7996,"quote":"A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":7885}],"target_id":"concept.eia.light-water-reactor-lwr","target_kind":"node","target_sha256":"727cf87452bdf645346822483276ad516027ad513d4920e0c4193414013b4558"}],"concept.eia.lighting-conservation-feature":[{"id":"assertion.concept.eia.lighting-conservation-feature","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lighting conservation feature as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lighting conservation feature as: A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","support":[{"end":8244,"quote":"A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":8141}],"target_id":"concept.eia.lighting-conservation-feature","target_kind":"node","target_sha256":"de4ed6fd18b2144d668f8a756cc1769608fa0ee914b4bf311a54934511ccfe91"}],"concept.eia.lighting-equipment":[{"id":"assertion.concept.eia.lighting-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lighting equipment as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lighting equipment as: These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","support":[{"end":8983,"quote":"These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":8788}],"target_id":"concept.eia.lighting-equipment","target_kind":"node","target_sha256":"a9d3272e82e5ac820d9e9511458dec582448469739ddc8842856d2d7788a3da0"}],"concept.eia.liquid-collector":[{"id":"assertion.concept.eia.liquid-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Liquid collector as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Liquid collector as: A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","support":[{"end":11457,"quote":"A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":11317}],"target_id":"concept.eia.liquid-collector","target_kind":"node","target_sha256":"f7a54aee7c45bd76a55e6c2ec4a6ca5976dc90a5d321d5c7d84041dafa54db80"}],"concept.eia.liquid-metal-fast-breeder-reactor":[{"id":"assertion.concept.eia.liquid-metal-fast-breeder-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Liquid metal fast breeder reactor as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Liquid metal fast breeder reactor as: A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","support":[{"end":11905,"quote":"A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":11809}],"target_id":"concept.eia.liquid-metal-fast-breeder-reactor","target_kind":"node","target_sha256":"45dee7a6ec00ddcbb4fad1ec99252429cbd354cfc1e38bba3eea424b08a7ff9c"}],"concept.eia.load-loss-3-hours":[{"id":"assertion.concept.eia.load-loss-3-hours","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load loss (3 hours) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load loss (3 hours) as: Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","support":[{"end":13994,"quote":"Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":13741}],"target_id":"concept.eia.load-loss-3-hours","target_kind":"node","target_sha256":"01f841f4e38f84707034095b00bde32bec50347fa9f9c10115c9c4b1938bd553"}],"concept.eia.load-management-technique":[{"id":"assertion.concept.eia.load-management-technique","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load management technique as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load management technique as: Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","support":[{"end":14297,"quote":"Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":14022}],"target_id":"concept.eia.load-management-technique","target_kind":"node","target_sha256":"11e26154161a81b2596b651d63006b5549279383e7644ccfe2bf94761e559a03"}],"concept.eia.load-on-equipment":[{"id":"assertion.concept.eia.load-on-equipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Load on equipment as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Load on equipment as: One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","support":[{"end":14578,"quote":"One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":14317}],"target_id":"concept.eia.load-on-equipment","target_kind":"node","target_sha256":"e2ff11d698e1a8ba914f5a85456e84578bb4ca3522f2e7bbcbc860574ea6f9c9"}],"concept.eia.longwall-mining":[{"id":"assertion.concept.eia.longwall-mining","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Longwall mining as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Longwall mining as: An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","support":[{"end":18504,"quote":"An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":17607}],"target_id":"concept.eia.longwall-mining","target_kind":"node","target_sha256":"991599ec46629e6ee38712312588476ae07d9834027755cdfdfd9d73e195f9d7"}],"concept.eia.low-power-testing":[{"id":"assertion.concept.eia.low-power-testing","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Low power testing as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Low power testing as: The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","support":[{"end":20622,"quote":"The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":20385}],"target_id":"concept.eia.low-power-testing","target_kind":"node","target_sha256":"7ee6cf7afb7499dcad37532de819ddbff337f8ea635e06e8219b32bd5dbfc256"}],"concept.eia.lubricants":[{"id":"assertion.concept.eia.lubricants","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lubricants as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lubricants as: Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","support":[{"end":22090,"quote":"Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":21707}],"target_id":"concept.eia.lubricants","target_kind":"node","target_sha256":"33fe6219803df1abb3f84438824fc07bc76096089252feae96b341b1bc61ecb9"}],"concept.eia.lumens-watt-lpw":[{"id":"assertion.concept.eia.lumens-watt-lpw","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Lumens/Watt (lpw) as defined in the captured EIA glossary page L","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Lumens/Watt (lpw) as: A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","support":[{"end":22585,"quote":"A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","source_id":"eia-glossary.L","source_sha256":"5fe17d4e78614b8dbba2734d8088791ba63391a3dcdaa173b6c5966fa27537eb","start":22427}],"target_id":"concept.eia.lumens-watt-lpw","target_kind":"node","target_sha256":"370a46e95d43b19477904a12bce00d0319030ce06d4ed1dd8fbcfeca887b7cb4"}],"concept.eia.machine-drive-motors":[{"id":"assertion.concept.eia.machine-drive-motors","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Machine drive (motors) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Machine drive (motors) as: The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","support":[{"end":875,"quote":"The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":521}],"target_id":"concept.eia.machine-drive-motors","target_kind":"node","target_sha256":"5ca6076c432a85564600aaa2ce9d637069edbd24b3fec7e8050252751005ff05"}],"concept.eia.main-heating-fuel":[{"id":"assertion.concept.eia.main-heating-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Main heating fuel as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Main heating fuel as: The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","support":[{"end":2261,"quote":"The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":1710}],"target_id":"concept.eia.main-heating-fuel","target_kind":"node","target_sha256":"87213b090c8b32e1c85ea27b09e51bff4fd2d5cfdcb986310bc36c95ee045165"}],"concept.eia.mains":[{"id":"assertion.concept.eia.mains","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mains as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mains as: A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","support":[{"end":2416,"quote":"A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":2269}],"target_id":"concept.eia.mains","target_kind":"node","target_sha256":"a31496a534082d164f5a882664440e2784d9f667b3ceb0d675ea37f1ed7dddbb"}],"concept.eia.manufactured-gas":[{"id":"assertion.concept.eia.manufactured-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Manufactured gas as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Manufactured gas as: A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","support":[{"end":6765,"quote":"A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":6459}],"target_id":"concept.eia.manufactured-gas","target_kind":"node","target_sha256":"06caa710f62ed3aa7e7a7680d661e0e6eb490b6418b63c2e518820e60ccd6b9b"}],"concept.eia.marketed-production":[{"id":"assertion.concept.eia.marketed-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Marketed production as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Marketed production as: Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","support":[{"end":10261,"quote":"Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":10033}],"target_id":"concept.eia.marketed-production","target_kind":"node","target_sha256":"1badfe013217f4bab0e6d5d5b75a2452c72f299f72bccfdaf9ac5ecb9d731f58"}],"concept.eia.maximum-dependable-capacity-net":[{"id":"assertion.concept.eia.maximum-dependable-capacity-net","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Maximum dependable capacity, net as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Maximum dependable capacity, net as: The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","support":[{"end":11777,"quote":"The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":11609}],"target_id":"concept.eia.maximum-dependable-capacity-net","target_kind":"node","target_sha256":"9de9f3de961048a017f2fb3eb03462df8a6035e5b38182b8508bf7375841bd8a"}],"concept.eia.maximum-generator-nameplate-capacity":[{"id":"assertion.concept.eia.maximum-generator-nameplate-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Maximum generator nameplate capacity as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Maximum generator nameplate capacity as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","support":[{"end":12398,"quote":"The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":12242}],"target_id":"concept.eia.maximum-generator-nameplate-capacity","target_kind":"node","target_sha256":"8d06d83639c64da43e4901fce9abbf634c385592391e9b1d9b2a8a8a4f48a90c"}],"concept.eia.mean-power-output-of-a-wind-turbine":[{"id":"assertion.concept.eia.mean-power-output-of-a-wind-turbine","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mean power output (of a wind turbine) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mean power output (of a wind turbine) as: The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","support":[{"end":13302,"quote":"The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":13173}],"target_id":"concept.eia.mean-power-output-of-a-wind-turbine","target_kind":"node","target_sha256":"5ea5824635e4d92960116ab0e106d57e7c89af7a18159ead5e23d438892b2560"}],"concept.eia.medium-temperature-collector":[{"id":"assertion.concept.eia.medium-temperature-collector","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Medium-temperature collector as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Medium-temperature collector as: A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","support":[{"end":16483,"quote":"A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":16075}],"target_id":"concept.eia.medium-temperature-collector","target_kind":"node","target_sha256":"40aca8eaa8fc61254a925e129b73b8c68d8b579949cf1efc9c3f5f7426e43a33"}],"concept.eia.microgroove":[{"id":"assertion.concept.eia.microgroove","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Microgroove as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Microgroove as: A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","support":[{"end":23090,"quote":"A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":22981}],"target_id":"concept.eia.microgroove","target_kind":"node","target_sha256":"b43796853508c9716130790b62eb55fe77b773d7a726d8f8aa21a6052665c269"}],"concept.eia.micrometer-or-micron":[{"id":"assertion.concept.eia.micrometer-or-micron","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Micrometer (or Micron) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Micrometer (or Micron) as: One-millionth of a meter. It can also be expressed as 10-6 meter.","support":[{"end":23180,"quote":"One-millionth of a meter. It can also be expressed as 10-6 meter.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":23115}],"target_id":"concept.eia.micrometer-or-micron","target_kind":"node","target_sha256":"8541c161a03ca0895327389280ae5c7027f534c33a46491083058ec95c4a5f05"}],"concept.eia.mill-feed":[{"id":"assertion.concept.eia.mill-feed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mill feed as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mill feed as: Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","support":[{"end":24956,"quote":"Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":24878}],"target_id":"concept.eia.mill-feed","target_kind":"node","target_sha256":"90ba0561dd603ca1d26b5be55fe93b0311322c7ebf4be75a3659ef485a0e0fbf"}],"concept.eia.milling-of-uranium":[{"id":"assertion.concept.eia.milling-of-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Milling of uranium as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Milling of uranium as: The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","support":[{"end":25420,"quote":"The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":25250}],"target_id":"concept.eia.milling-of-uranium","target_kind":"node","target_sha256":"818c21039d3d61043ed562839ecff147e4113c5c18f9eebb0d4ce6f5a2f56dfe"}],"concept.eia.mineral-matter-free-basis":[{"id":"assertion.concept.eia.mineral-matter-free-basis","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Mineral-matter-free basis as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Mineral-matter-free basis as: Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","support":[{"end":27624,"quote":"Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":27061}],"target_id":"concept.eia.mineral-matter-free-basis","target_kind":"node","target_sha256":"aada16f2be0245d174a6925c2fe11691af830dbe49cf4e4aa67203058e932ada"}],"concept.eia.minority-carrier":[{"id":"assertion.concept.eia.minority-carrier","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Minority carrier as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Minority carrier as: A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","support":[{"end":28418,"quote":"A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":28175}],"target_id":"concept.eia.minority-carrier","target_kind":"node","target_sha256":"0ed5b475deadb569c460677cb1cf73d5899f79d754b2630fd36d2e49ecf8ee44"}],"concept.eia.moderator":[{"id":"assertion.concept.eia.moderator","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Moderator as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Moderator as: A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","support":[{"end":29753,"quote":"A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":29586}],"target_id":"concept.eia.moderator","target_kind":"node","target_sha256":"fbeef39f4c1703aa4fb1fd034fa7a83e83a4945cbc252fb52f9de12146f2c374"}],"concept.eia.motor-gasoline-blending":[{"id":"assertion.concept.eia.motor-gasoline-blending","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor gasoline blending as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor gasoline blending as: Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","support":[{"end":32878,"quote":"Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":32441}],"target_id":"concept.eia.motor-gasoline-blending","target_kind":"node","target_sha256":"2db3704197d0b9cc12d546059dd3c8cf624e8d6f83997489de0a11df60b290bb"}],"concept.eia.motor-gasoline-finished":[{"id":"assertion.concept.eia.motor-gasoline-finished","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor gasoline (finished) as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor gasoline (finished) as: A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","support":[{"end":32415,"quote":"A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":31642}],"target_id":"concept.eia.motor-gasoline-finished","target_kind":"node","target_sha256":"2dd7cc74f2dad903087021ffa43bc24772cf7818a10d8df1474903bf277973d0"}],"concept.eia.motor-speed":[{"id":"assertion.concept.eia.motor-speed","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Motor speed as defined in the captured EIA glossary page M","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Motor speed as: The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","support":[{"end":33478,"quote":"The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","source_id":"eia-glossary.M","source_sha256":"956aa9bfc612dc3064977c01626f558ce5320a43805f8a1e1c4c4e43df4cf769","start":33373}],"target_id":"concept.eia.motor-speed","target_kind":"node","target_sha256":"92085871fcad3e6979c39ebac75bb8fbf714c6ed3c292c2b84f3d5f1044df1a0"}],"concept.eia.name-plate":[{"id":"assertion.concept.eia.name-plate","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Name plate as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Name plate as: A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","support":[{"end":1067,"quote":"A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":871}],"target_id":"concept.eia.name-plate","target_kind":"node","target_sha256":"a5f103a0929dbe7dc1ea8971d9f277570f144506015bd7d07b8d7781b307ef18"}],"concept.eia.naphtha-type-jet-fuel":[{"id":"assertion.concept.eia.naphtha-type-jet-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Naphtha-type jet fuel as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Naphtha-type jet fuel as: A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","support":[{"end":1900,"quote":"A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":1400}],"target_id":"concept.eia.naphtha-type-jet-fuel","target_kind":"node","target_sha256":"c2391f6f5c947de22a4147208ea9ec2e29cff69804da6875ec153a9458703adc"}],"concept.eia.naphthas":[{"id":"assertion.concept.eia.naphthas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Naphthas as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Naphthas as: Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","support":[{"end":2179,"quote":"Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":1936}],"target_id":"concept.eia.naphthas","target_kind":"node","target_sha256":"3e1280be793b534127ea2ccef21e41065488e31790457a397dc8a33c901c4e8f"}],"concept.eia.native-gas":[{"id":"assertion.concept.eia.native-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Native gas as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Native gas as: Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","support":[{"end":4364,"quote":"Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":4229}],"target_id":"concept.eia.native-gas","target_kind":"node","target_sha256":"c81740f9d9bca031b9b21e4e128d29f2b93809c8cf7eae315472dcd055112584"}],"concept.eia.natural-gas-marketed-production":[{"id":"assertion.concept.eia.natural-gas-marketed-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas marketed production as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas marketed production as: Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","support":[{"end":6306,"quote":"Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":6102}],"target_id":"concept.eia.natural-gas-marketed-production","target_kind":"node","target_sha256":"7411cb246b5dc925887c6bd95eca031012c189a6a089b1e12217d17d6ad000b0"}],"concept.eia.natural-gas-plant-liquids-ngpl":[{"id":"assertion.concept.eia.natural-gas-plant-liquids-ngpl","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas plant liquids (NGPL) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) as: Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","support":[{"end":7116,"quote":"Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":6965}],"target_id":"concept.eia.natural-gas-plant-liquids-ngpl","target_kind":"node","target_sha256":"bef9198e33833f7a95ba0aebf150297d327d4d55081ae92a8810aa1e5eef0883"}],"concept.eia.natural-gas-plant-liquids-ngpl-production":[{"id":"assertion.concept.eia.natural-gas-plant-liquids-ngpl-production","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural gas plant liquids (NGPL) production as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) production as: The extraction of gas plant liquids constituents such as","support":[{"end":7557,"quote":"The extraction of gas plant liquids constituents such as","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":7501}],"target_id":"concept.eia.natural-gas-plant-liquids-ngpl-production","target_kind":"node","target_sha256":"000bc548caed2b06ffa8b45133cd09ffc2c49df7451808a56c0abd27b00015dc"}],"concept.eia.natural-reservoir-pressure":[{"id":"assertion.concept.eia.natural-reservoir-pressure","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural reservoir pressure as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural reservoir pressure as: The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","support":[{"end":10378,"quote":"The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":9943}],"target_id":"concept.eia.natural-reservoir-pressure","target_kind":"node","target_sha256":"826f37d726de52011d23f27c545f319c4db8210793e64857d8b8fb7cfd1e2ce2"}],"concept.eia.natural-streamflow":[{"id":"assertion.concept.eia.natural-streamflow","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Natural streamflow as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Natural streamflow as: The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","support":[{"end":10595,"quote":"The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":10399}],"target_id":"concept.eia.natural-streamflow","target_kind":"node","target_sha256":"20f3c748accf28b406f86b5395b7413567eae1db4865333239877e9991d8cf21"}],"concept.eia.net-cell-shipments":[{"id":"assertion.concept.eia.net-cell-shipments","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net cell shipments as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net cell shipments as: Represents the difference between cell shipments and cell purchases.","support":[{"end":11500,"quote":"Represents the difference between cell shipments and cell purchases.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":11432}],"target_id":"concept.eia.net-cell-shipments","target_kind":"node","target_sha256":"1d8c1b981c3fcc6ad0452ce8390c8e9ebe01e4d6da4f90ab96207748bd2cb963"}],"concept.eia.net-energy-for-load-electric":[{"id":"assertion.concept.eia.net-energy-for-load-electric","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net energy for load (electric) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net energy for load (electric) as: Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","support":[{"end":11972,"quote":"Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":11686}],"target_id":"concept.eia.net-energy-for-load-electric","target_kind":"node","target_sha256":"daf2088aa3cb7dc137c828aee6c90fca30277b927cd09292c9b6cf9a977ea4a1"}],"concept.eia.net-energy-for-system":[{"id":"assertion.concept.eia.net-energy-for-system","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net energy for system as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net energy for system as: The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","support":[{"end":12138,"quote":"The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12012}],"target_id":"concept.eia.net-energy-for-system","target_kind":"node","target_sha256":"49fec075cb615a2d59a5a0254aa3f392ce2aa342c73bf03b33bef00178a3a4bc"}],"concept.eia.net-generation":[{"id":"assertion.concept.eia.net-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net generation as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net generation as: The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","support":[{"end":12436,"quote":"The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12155}],"target_id":"concept.eia.net-generation","target_kind":"node","target_sha256":"fad882e57074e2be22c263e63bf1f92764a67896aa3ed80ef2ed1c99f648a773"}],"concept.eia.net-head":[{"id":"assertion.concept.eia.net-head","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net head as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net head as: The gross head minus all hydraulic losses except those chargeable to the turbine.","support":[{"end":12528,"quote":"The gross head minus all hydraulic losses except those chargeable to the turbine.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":12447}],"target_id":"concept.eia.net-head","target_kind":"node","target_sha256":"52453b54135b52180cdc8075c7f0e899e00bb0fca230c6cc11f0d12c70265620"}],"concept.eia.net-module-shipments":[{"id":"assertion.concept.eia.net-module-shipments","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net module shipments as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net module shipments as: Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","support":[{"end":13750,"quote":"Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":13600}],"target_id":"concept.eia.net-module-shipments","target_kind":"node","target_sha256":"b457612113af19499cfa3e3714bb14d66f76f4104613645c9dfd3d2e8ae14752"}],"concept.eia.net-photovoltaic-module-shipment":[{"id":"assertion.concept.eia.net-photovoltaic-module-shipment","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net photovoltaic module shipment as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net photovoltaic module shipment as: The difference between photovoltaic module shipments and photovoltaic module purchases.","support":[{"end":13943,"quote":"The difference between photovoltaic module shipments and photovoltaic module purchases.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":13856}],"target_id":"concept.eia.net-photovoltaic-module-shipment","target_kind":"node","target_sha256":"69a336d54443045dae627030e2b4480d73264629ce097de7e576287c2d767061"}],"concept.eia.net-summer-capacity":[{"id":"assertion.concept.eia.net-summer-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net summer capacity as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net summer capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.) This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","support":[{"end":14898,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.)  This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":14570}],"target_id":"concept.eia.net-summer-capacity","target_kind":"node","target_sha256":"ab2ba461c45ca37591293468d23d9ab2d3ccff84e5e120e6e65f75f74da97237"}],"concept.eia.net-winter-capacity":[{"id":"assertion.concept.eia.net-winter-capacity","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Net winter capacity as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Net winter capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28). This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","support":[{"end":15251,"quote":"The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28).  This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":14920}],"target_id":"concept.eia.net-winter-capacity","target_kind":"node","target_sha256":"220f328353ac31950cbc82fe013f050527c8c27b8737378bd33f842a2aebe92c"}],"concept.eia.no-6-residual-fuel-oil":[{"id":"assertion.concept.eia.no-6-residual-fuel-oil","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"No. 6 Residual fuel oil as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines No. 6 Residual fuel oil as: Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes. See","support":[{"end":19896,"quote":"Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes.  See","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":19749}],"target_id":"concept.eia.no-6-residual-fuel-oil","target_kind":"node","target_sha256":"77f3c0cd6827fea654acdf47eb7d92bfe2920c6e448695572e614aaf5822c6ad"}],"concept.eia.noload-loss":[{"id":"assertion.concept.eia.noload-loss","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Noload loss as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Noload loss as: Power and energy lost by an electric system when not operating under demand.","support":[{"end":20651,"quote":"Power and energy lost by an electric system when not operating under demand.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":20575}],"target_id":"concept.eia.noload-loss","target_kind":"node","target_sha256":"45cc1acfa15f49bc694ee3dab369faf3a137b056052c99540c671fb360203b26"}],"concept.eia.nonconventional-plant-uranium":[{"id":"assertion.concept.eia.nonconventional-plant-uranium","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonconventional plant (uranium) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonconventional plant (uranium) as: A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","support":[{"end":23553,"quote":"A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23252}],"target_id":"concept.eia.nonconventional-plant-uranium","target_kind":"node","target_sha256":"3af45404d9ef9abe91af270a8024f3ce507b9cb7805f512d172a72f732fce2f1"}],"concept.eia.nondedicated-vehicle":[{"id":"assertion.concept.eia.nondedicated-vehicle","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nondedicated vehicle as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nondedicated vehicle as: A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","support":[{"end":23673,"quote":"A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23576}],"target_id":"concept.eia.nondedicated-vehicle","target_kind":"node","target_sha256":"23ae9b00147559afdb983ed31caff53c773a0eccde3272149165b939cccab4aa"}],"concept.eia.nonfuel-components":[{"id":"assertion.concept.eia.nonfuel-components","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonfuel components as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonfuel components as: Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","support":[{"end":24109,"quote":"Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":23827}],"target_id":"concept.eia.nonfuel-components","target_kind":"node","target_sha256":"554942efba53f34c532d31d010e8bfd6cadad2cab192473d930f5fe8ee84ec68"}],"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv":[{"id":"assertion.concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nonroad alternative fuel vehicle (nonroad AFV) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nonroad alternative fuel vehicle (nonroad AFV) as: An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","support":[{"end":26281,"quote":"An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":25823}],"target_id":"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","target_kind":"node","target_sha256":"52714b598ca1b7fee54cd0e295880bf98db87bcf17607ed54df356b5c8ed7d24"}],"concept.eia.north-american-electric-reliability-corporation-nerc":[{"id":"assertion.concept.eia.north-american-electric-reliability-corporation-nerc","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"North American Electric Reliability Corporation (NERC) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines North American Electric Reliability Corporation (NERC) as: A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","support":[{"end":27995,"quote":"A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":27554}],"target_id":"concept.eia.north-american-electric-reliability-corporation-nerc","target_kind":"node","target_sha256":"d999780a014889df5676cee1d659b315b77a1578d749e152a2550082098bd288"}],"concept.eia.nuclear-electric-power-nuclear-power":[{"id":"assertion.concept.eia.nuclear-electric-power-nuclear-power","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear electric power (nuclear power) as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear electric power (nuclear power) as: Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","support":[{"end":28566,"quote":"Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28456}],"target_id":"concept.eia.nuclear-electric-power-nuclear-power","target_kind":"node","target_sha256":"8c70c435bd826440be78f0d0c03b557841f2586394c2ac1b950d16e922742d8f"}],"concept.eia.nuclear-fuel":[{"id":"assertion.concept.eia.nuclear-fuel","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear fuel as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear fuel as: Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","support":[{"end":28798,"quote":"Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28581}],"target_id":"concept.eia.nuclear-fuel","target_kind":"node","target_sha256":"71e1bbc067d231e88e71a7d5b491e3210668a6aae3ca71452558413797fe3a0a"}],"concept.eia.nuclear-reactor":[{"id":"assertion.concept.eia.nuclear-reactor","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Nuclear reactor as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Nuclear reactor as: An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","support":[{"end":29248,"quote":"An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":28816}],"target_id":"concept.eia.nuclear-reactor","target_kind":"node","target_sha256":"bee1805d8b20f27215922399f1230dbb41dfda0cc5a734dafb59b8ad15973efa"}],"concept.eia.number-of-mining-operations":[{"id":"assertion.concept.eia.number-of-mining-operations","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Number of mining operations as defined in the captured EIA glossary page N","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Number of mining operations as: The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","support":[{"end":30140,"quote":"The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","source_id":"eia-glossary.N","source_sha256":"eb0f655d2b41463358a20f4b86189f0d7abdedf96aeb299dbdd48670c86fb3b0","start":29648}],"target_id":"concept.eia.number-of-mining-operations","target_kind":"node","target_sha256":"e69dd15466fcde5c5c47234e28c30c8b981573d04ae867f8d4d1f1b7466539dd"}],"concept.eia.ocean-thermal-energy-conversion-otec":[{"id":"assertion.concept.eia.ocean-thermal-energy-conversion-otec","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ocean thermal energy conversion (OTEC) as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ocean thermal energy conversion (OTEC) as: The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","support":[{"end":1206,"quote":"The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":881}],"target_id":"concept.eia.ocean-thermal-energy-conversion-otec","target_kind":"node","target_sha256":"779541445a5f9726eb3eba489c7ce12f501c5e1cea391f92d72ccf9cf408fd0a"}],"concept.eia.octane":[{"id":"assertion.concept.eia.octane","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Octane as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Octane as: A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","support":[{"end":1371,"quote":"A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1250}],"target_id":"concept.eia.octane","target_kind":"node","target_sha256":"acd94bfbed9ae22485b8c4cbc24cc69160ce800ea096ff0fdf0fe814c91be611"}],"concept.eia.octane-rating":[{"id":"assertion.concept.eia.octane-rating","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Octane rating as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Octane rating as: A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","support":[{"end":1804,"quote":"A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1387}],"target_id":"concept.eia.octane-rating","target_kind":"node","target_sha256":"554a863f5a75de86e4308d2fe16fa4403b513f69c2f7b8973b4d53cd01e0570b"}],"concept.eia.off-hours-equipment-reduction":[{"id":"assertion.concept.eia.off-hours-equipment-reduction","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off-hours equipment reduction as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off-hours equipment reduction as: A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","support":[{"end":2917,"quote":"A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":2705}],"target_id":"concept.eia.off-hours-equipment-reduction","target_kind":"node","target_sha256":"170de890c80885e9a32c023a23ca52156fc0896e833d4d94adf5129f18462383"}],"concept.eia.off-peak":[{"id":"assertion.concept.eia.off-peak","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off peak as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off peak as: Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","support":[{"end":2101,"quote":"Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":1927}],"target_id":"concept.eia.off-peak","target_kind":"node","target_sha256":"6c7cbaf781ecca87fd7a97b8a8a72fc1402dd7cdb9d064ae00d58316d0bb6043"}],"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation":[{"id":"assertion.concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Off-site produced energy for heat, power, and electricity generation as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Off-site produced energy for heat, power, and electricity generation as: This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","support":[{"end":3208,"quote":"This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":2988}],"target_id":"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","target_kind":"node","target_sha256":"ccef3fbac0d48b61d42dac7298e1b29739b52e1aa53ee16e37671068828816c8"}],"concept.eia.ohm":[{"id":"assertion.concept.eia.ohm","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Ohm as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Ohm as: A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","support":[{"end":4573,"quote":"A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":4408}],"target_id":"concept.eia.ohm","target_kind":"node","target_sha256":"14dc996387bed245a011dd4b66a44db15d662d40bcfeb01b060aefc16b9d6c82"}],"concept.eia.oil-well":[{"id":"assertion.concept.eia.oil-well","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Oil well as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Oil well as: A well completed for the production of crude oil from at least one oil zone or reservoir.","support":[{"end":6450,"quote":"A well completed for the production of crude oil from at least one oil zone or reservoir.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":6361}],"target_id":"concept.eia.oil-well","target_kind":"node","target_sha256":"52db08d313e6bc6c000cd8d1f8b70f7eda72e0c98960003bf2f4494f4c0f9482"}],"concept.eia.oil-well-casing-head-gas":[{"id":"assertion.concept.eia.oil-well-casing-head-gas","scope":{"assumptions":"Attributed U.S. government glossary definition; not an original research or historical-priority claim","population":"Oil well (casing head) gas as defined in the captured EIA glossary page O","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"The U.S. Energy Information Administration glossary defines Oil well (casing head) gas as: Associated and dissolved gas produced along with crude oil from oil completions.","support":[{"end":6559,"quote":"Associated and dissolved gas produced along with crude oil from oil completions.","source_id":"eia-glossary.O","source_sha256":"ede86bba579400f889fe44deb1590798e806856e1b3350593b62dc889580f029","start":6479}],"target_id":"concept.eia.oil-well-casing-head-gas","target_kind":"node","target_sha256":"6e1d9f6062582e9f2122c6502680606909d9d9082b4f6dfacf324802bd6fda40"}],"concept.finite-range-dark-force":[{"id":"assertion.complete.concept.finite-range-dark-force","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Intermediate-range self-interaction between dark-matter particles.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"concept.finite-range-dark-force","target_kind":"node","target_sha256":"615e5353cd7bb2e26096ddfb002e8b9c8c4ad2bb4a1142fcf26d53b3ffeb987e"}],"concept.fuzzy-dm-mass":[{"id":"assertion.complete.concept.fuzzy-dm-mass","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited Lyman-alpha analysis constrains the particle mass of extremely light bosonic dark-matter models, with lower limits that depend on assumptions about the intergalactic medium's thermal history.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"concept.fuzzy-dm-mass","target_kind":"node","target_sha256":"72935ccc56ccf234d5327abd8713baefc9f1b9536757613a296fb7992cf870df"}],"concept.go.go0000128":[{"id":"assertion.concept.go.go0000128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"flocculation as defined in the captured Gene Ontology term GO:0000128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines flocculation as: The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","support":[{"end":239,"quote":"The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","source_id":"quickgo.go_0000128","source_sha256":"133831b7d8cd4fae016821dd728adc8687bc3dd1ba072266e42ff87699e11f9e","start":111}],"target_id":"concept.go.go0000128","target_kind":"node","target_sha256":"91db7f279ea73ba0ad2e8f9e5b4ff37de7a501c6b5c186742a33606aef26c18f"}],"concept.go.go0000752":[{"id":"assertion.concept.go.go0000752","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"agglutination involved in conjugation with cellular fusion as defined in the captured Gene Ontology term GO:0000752","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines agglutination involved in conjugation with cellular fusion as: The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","support":[{"end":392,"quote":"The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","source_id":"quickgo.go_0000752","source_sha256":"fbfad18084bb49acd2198182d236061960de05db427a8a8ea574880d31d55c91","start":157}],"target_id":"concept.go.go0000752","target_kind":"node","target_sha256":"4baa410b2b0d043eae1df21352dd2aad4a331ec37936450e4447de77d69ecb09"}],"concept.go.go0000785":[{"id":"assertion.concept.go.go0000785","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chromatin as defined in the captured Gene Ontology term GO:0000785","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chromatin as: The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","support":[{"end":204,"quote":"The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","source_id":"quickgo.go_0000785","source_sha256":"3323470904d6724bcf8a14ebcc109592708836cd0d7340c6258724b18e43651d","start":108}],"target_id":"concept.go.go0000785","target_kind":"node","target_sha256":"423c19d1f79d61a0ee8b4240dad23aa40d8642165bcbe10fa8e89aca932e445f"}],"concept.go.go0000920":[{"id":"assertion.concept.go.go0000920","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"septum digestion after cytokinesis as defined in the captured Gene Ontology term GO:0000920","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines septum digestion after cytokinesis as: The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","support":[{"end":286,"quote":"The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","source_id":"quickgo.go_0000920","source_sha256":"c5dff0ead6c521764be1c028788cfc608bdc3ba76e317141eba4a43ddd21a0fa","start":133}],"target_id":"concept.go.go0000920","target_kind":"node","target_sha256":"22246ca0c72d910aac3d48f29002f9ac4a87f496f379463ae654a178f164e5d7"}],"concept.go.go0001400":[{"id":"assertion.concept.go.go0001400","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mating projection base as defined in the captured Gene Ontology term GO:0001400","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating projection base as: The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","support":[{"end":237,"quote":"The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","source_id":"quickgo.go_0001400","source_sha256":"7bfdf865c6e055bd089fcdcfeeeaf071d857c19f5cd8b09473a1df274a2b6905","start":121}],"target_id":"concept.go.go0001400","target_kind":"node","target_sha256":"069db0c222d2b37fa7b9562d159bdf7a5fb51df87668c8f5584d85ef6c36c70d"}],"concept.go.go0001503":[{"id":"assertion.concept.go.go0001503","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ossification as defined in the captured Gene Ontology term GO:0001503","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ossification as: The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","support":[{"end":239,"quote":"The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","source_id":"quickgo.go_0001503","source_sha256":"88151678dae21158303aa07252c3078a61db63a7f7bfacf7ba294242b8bac6b3","start":111}],"target_id":"concept.go.go0001503","target_kind":"node","target_sha256":"05dc5cebb47b3207b39fc641b9391ff81535fc8675e88bd66d0a43df3f52c392"}],"concept.go.go0001650":[{"id":"assertion.concept.go.go0001650","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fibrillar center as defined in the captured Gene Ontology term GO:0001650","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fibrillar center as: A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","support":[{"end":367,"quote":"A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","source_id":"quickgo.go_0001650","source_sha256":"023f5bde3b0c4cf590e6914ed0ac4d7b7ebfe849d8edd94b9a476b6eba6a6e10","start":115}],"target_id":"concept.go.go0001650","target_kind":"node","target_sha256":"bfaccad00cfe4dd146b6ad38b57b81b55cd3c9ce14d2893bda8cebceb9e93252"}],"concept.go.go0001651":[{"id":"assertion.concept.go.go0001651","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dense fibrillar component as defined in the captured Gene Ontology term GO:0001651","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense fibrillar component as: A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","support":[{"end":250,"quote":"A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","source_id":"quickgo.go_0001651","source_sha256":"4269b3d3ff6f781e3733ab91b8a6975ddfda7338aa0923cda829322b3f17ebfd","start":124}],"target_id":"concept.go.go0001651","target_kind":"node","target_sha256":"3725eeaba33e988cfbfd5fdee83c1ac9f1c9c89e91aa3cd85529315648de1481"}],"concept.go.go0001652":[{"id":"assertion.concept.go.go0001652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granular component as defined in the captured Gene Ontology term GO:0001652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines granular component as: A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","support":[{"end":235,"quote":"A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","source_id":"quickgo.go_0001652","source_sha256":"ebade7eab3e5a304590c8651a5254c63deb7217402c4395ef49c6dd89ed09073","start":117}],"target_id":"concept.go.go0001652","target_kind":"node","target_sha256":"61582e7ad34e7c154e796cadb2bae156028e047bd7cf9696b940035a706c9e0d"}],"concept.go.go0001750":[{"id":"assertion.concept.go.go0001750","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor outer segment as defined in the captured Gene Ontology term GO:0001750","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor outer segment as: The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","support":[{"end":251,"quote":"The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","source_id":"quickgo.go_0001750","source_sha256":"e7857a98cf7afc637573c39f55f84a97c64ad2ce8bc4f5ade9019dc79a3944b9","start":126}],"target_id":"concept.go.go0001750","target_kind":"node","target_sha256":"f843024a0ebb2e48fe1597aafc43cb0085be613d1c8cd1a8fbbabc5e599a651c"}],"concept.go.go0001763":[{"id":"assertion.concept.go.go0001763","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"morphogenesis of a branching structure as defined in the captured Gene Ontology term GO:0001763","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines morphogenesis of a branching structure as: The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","support":[{"end":388,"quote":"The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","source_id":"quickgo.go_0001763","source_sha256":"4dd3e26ed7f3fb3de0b24699fb091bf0285eb36f2cb317ab687f33d07eb05bc0","start":137}],"target_id":"concept.go.go0001763","target_kind":"node","target_sha256":"cb9754620c2580762370bf1d7ae29c492757c7e231c2ef63af4bb4d465cea835"}],"concept.go.go0001772":[{"id":"assertion.concept.go.go0001772","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immunological synapse as defined in the captured Gene Ontology term GO:0001772","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological synapse as: An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","support":[{"end":618,"quote":"An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","source_id":"quickgo.go_0001772","source_sha256":"78f77ad5cc8f1ea1baf603246abd38d921605f4782cace5f9c3a0446ea6a1a97","start":120}],"target_id":"concept.go.go0001772","target_kind":"node","target_sha256":"de23431e8291ef36da26d1da6605bdfdda8ee848a9aa3ce6f131e78d178b3d30"}],"concept.go.go0001775":[{"id":"assertion.concept.go.go0001775","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell activation as defined in the captured Gene Ontology term GO:0001775","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell activation as: A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","support":[{"end":288,"quote":"A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","source_id":"quickgo.go_0001775","source_sha256":"45b9b77cbfaa684e854e5cc920ce91bb82a8187a4e3dbb50b7ebf226ba5c0c5d","start":114}],"target_id":"concept.go.go0001775","target_kind":"node","target_sha256":"be3c5e78d685736933c823870393f75466a601f749282702b45d59e54f2552dc"}],"concept.go.go0001776":[{"id":"assertion.concept.go.go0001776","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte homeostasis as defined in the captured Gene Ontology term GO:0001776","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte homeostasis as: The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","support":[{"end":368,"quote":"The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","source_id":"quickgo.go_0001776","source_sha256":"4857f76462593e533728efcb882534e3ae7c6210a08434634cc1629cc0e5bebb","start":120}],"target_id":"concept.go.go0001776","target_kind":"node","target_sha256":"c9ac8db1197229f6f36bbb81bd2d6b2173c4476200654814ac3e7e84d70ff1b8"}],"concept.go.go0001816":[{"id":"assertion.concept.go.go0001816","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytokine production as defined in the captured Gene Ontology term GO:0001816","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytokine production as: The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":281,"quote":"The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0001816","source_sha256":"a2fec123a21d81fb16c8a880281c263583b91e86d191a905273d781a1267dbf8","start":118}],"target_id":"concept.go.go0001816","target_kind":"node","target_sha256":"c39950d769598e76876272aa28b749d788074ce936e52eecec235ba64311f4ff"}],"concept.go.go0001891":[{"id":"assertion.concept.go.go0001891","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phagocytic cup as defined in the captured Gene Ontology term GO:0001891","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines phagocytic cup as: An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","support":[{"end":267,"quote":"An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","source_id":"quickgo.go_0001891","source_sha256":"be6f4be79946f1f892c390d21b135d3ee273887279be37394d8eef719e9d476b","start":113}],"target_id":"concept.go.go0001891","target_kind":"node","target_sha256":"2be1756e620f87f5ffbe7429bf15dd25e3feabc0c490c08e49c411de8fb40f54"}],"concept.go.go0001906":[{"id":"assertion.concept.go.go0001906","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell killing as defined in the captured Gene Ontology term GO:0001906","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell killing as: Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","support":[{"end":421,"quote":"Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","source_id":"quickgo.go_0001906","source_sha256":"a9c4157bb8e02a81ca3ba22a8150234c6e4d63578d8e9f6f6fa5876b06f48a5c","start":111}],"target_id":"concept.go.go0001906","target_kind":"node","target_sha256":"059526c4ca333952608076a7aa5334cb0d43e152135256176eac8472bd3974b7"}],"concept.go.go0001917":[{"id":"assertion.concept.go.go0001917","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor inner segment as defined in the captured Gene Ontology term GO:0001917","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor inner segment as: The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","support":[{"end":308,"quote":"The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","source_id":"quickgo.go_0001917","source_sha256":"3d0fd703a785ddde53f3d0746342cbd0fff9a4e7e16ca6113f14d4545c05d37f","start":126}],"target_id":"concept.go.go0001917","target_kind":"node","target_sha256":"6a30bfc5c43509ee2f5e204d20d7562705df4f47e8a48d74c71a0eb2ace47107"}],"concept.go.go0002200":[{"id":"assertion.concept.go.go0002200","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"somatic diversification of immune receptors as defined in the captured Gene Ontology term GO:0002200","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines somatic diversification of immune receptors as: The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","support":[{"end":277,"quote":"The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","source_id":"quickgo.go_0002200","source_sha256":"caa0a4ea00df074c831c4c9f4420e26e9d7e58471f5e71c66e448459b277afb6","start":142}],"target_id":"concept.go.go0002200","target_kind":"node","target_sha256":"6cf7b927fcad092c7f9bc5b85de5a00902de4051c96eab155a80a664a3cb8aa8"}],"concept.go.go0002252":[{"id":"assertion.concept.go.go0002252","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune effector process as defined in the captured Gene Ontology term GO:0002252","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune effector process as: Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","support":[{"end":264,"quote":"Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","source_id":"quickgo.go_0002252","source_sha256":"0ed0b3e6161ce29b143403894bd347fa82aec82ac7fcad1c19772e45d9277020","start":122}],"target_id":"concept.go.go0002252","target_kind":"node","target_sha256":"6931aeb0b31a2e397de5b78e24f8f3d786f310662542c607802cad199dfa4102"}],"concept.go.go0002253":[{"id":"assertion.concept.go.go0002253","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"activation of immune response as defined in the captured Gene Ontology term GO:0002253","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines activation of immune response as: Any process that initiates an immune response.","support":[{"end":174,"quote":"Any process that initiates an immune response.","source_id":"quickgo.go_0002253","source_sha256":"96651db579a723eb33c663789fe80a1a1d45d5a3e94d53f8c25b2b67c7d89f00","start":128}],"target_id":"concept.go.go0002253","target_kind":"node","target_sha256":"a18c076c66532e6dbf2cd58284ff8367636450748f59b3f3ce230ae3ea3d0f1e"}],"concept.go.go0002262":[{"id":"assertion.concept.go.go0002262","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myeloid cell homeostasis as defined in the captured Gene Ontology term GO:0002262","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myeloid cell homeostasis as: The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","support":[{"end":340,"quote":"The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","source_id":"quickgo.go_0002262","source_sha256":"ebfc5516c2e27e059c24c7960bbcce80a8dcf8bb68898087709ec6b35c7e5203","start":123}],"target_id":"concept.go.go0002262","target_kind":"node","target_sha256":"969489fcf0492836c55f9749cc48156d89f3bfa6577ca936c45b48e437392ac2"}],"concept.go.go0002339":[{"id":"assertion.concept.go.go0002339","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"B cell selection as defined in the captured Gene Ontology term GO:0002339","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines B cell selection as: The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","support":[{"end":263,"quote":"The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","source_id":"quickgo.go_0002339","source_sha256":"93c1172cf54d69c2d788746914f5597de46feaff2a0739344e08f0dbba465847","start":115}],"target_id":"concept.go.go0002339","target_kind":"node","target_sha256":"c6b146465a623cb25760a02712165943e14e8c6be6f42c41143068820e2144b7"}],"concept.go.go0002376":[{"id":"assertion.concept.go.go0002376","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune system process as defined in the captured Gene Ontology term GO:0002376","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system process as: Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","support":[{"end":285,"quote":"Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","source_id":"quickgo.go_0002376","source_sha256":"b61888bc91aea1d3c452427cad9a1f026706796a6fb665bdca5e31f1f827e0de","start":120}],"target_id":"concept.go.go0002376","target_kind":"node","target_sha256":"d87fe0923bd9079fefe464b4221527e2afe8e31be2476fa7181b4a4481e19194"}],"concept.go.go0002404":[{"id":"assertion.concept.go.go0002404","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"antigen sampling in mucosal-associated lymphoid tissue as defined in the captured Gene Ontology term GO:0002404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen sampling in mucosal-associated lymphoid tissue as: The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","support":[{"end":284,"quote":"The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","source_id":"quickgo.go_0002404","source_sha256":"41dcda14ccacbf5cf652a54bd9e55897c8c9a7480158d0593b0dccbc12391a76","start":153}],"target_id":"concept.go.go0002404","target_kind":"node","target_sha256":"a324048649163e04e799524cf0b9aa53b8240d2ee18299fe5d868e80d274ed9c"}],"concept.go.go0002440":[{"id":"assertion.concept.go.go0002440","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"production of molecular mediator of immune response as defined in the captured Gene Ontology term GO:0002440","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator of immune response as: The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":295,"quote":"The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0002440","source_sha256":"4e5dc358afc8e2d7d9ca92743e95936f18bb00687a698982a14cfa31d17b299a","start":150}],"target_id":"concept.go.go0002440","target_kind":"node","target_sha256":"9f02fa5df331a1836de265ec829653628e5216414afd44652d5b5d84bf3cc07a"}],"concept.go.go0002507":[{"id":"assertion.concept.go.go0002507","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tolerance induction as defined in the captured Gene Ontology term GO:0002507","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tolerance induction as: A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","support":[{"end":369,"quote":"A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","source_id":"quickgo.go_0002507","source_sha256":"975334330913935447fe8ac791bcc56c8c8adeac54be33a8059ebe87ee30d6ea","start":118}],"target_id":"concept.go.go0002507","target_kind":"node","target_sha256":"3ecbb5d5ad56d197822156b26fce07804e3fb619a6c3eecd0336d6c323fd1bf6"}],"concept.go.go0002520":[{"id":"assertion.concept.go.go0002520","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune system development as defined in the captured Gene Ontology term GO:0002520","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system development as: The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","support":[{"end":507,"quote":"The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","source_id":"quickgo.go_0002520","source_sha256":"6a1797d8dd55730315ba548df939e66eefbc361dcfefddcbc8b68d37824f8c59","start":124}],"target_id":"concept.go.go0002520","target_kind":"node","target_sha256":"8a246772cad1ba5b71189f4ef27e359c81510e3d4df0d69a85afffaf60b699fd"}],"concept.go.go0002532":[{"id":"assertion.concept.go.go0002532","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"production of molecular mediator involved in inflammatory response as defined in the captured Gene Ontology term GO:0002532","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator involved in inflammatory response as: The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","support":[{"end":351,"quote":"The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","source_id":"quickgo.go_0002532","source_sha256":"9ca39ac49372ec0da4804fdbff317bfef9e0a6531ff5310190d5e7c43b2dd161","start":165}],"target_id":"concept.go.go0002532","target_kind":"node","target_sha256":"16c38ce8c1b349d9e6faf7b8075077e9d6e0344f69e8a96c686f3fffa1bf250e"}],"concept.go.go0003006":[{"id":"assertion.concept.go.go0003006","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental process involved in reproduction as defined in the captured Gene Ontology term GO:0003006","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process involved in reproduction as: A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","support":[{"end":320,"quote":"A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","source_id":"quickgo.go_0003006","source_sha256":"915e429e719890a103ac9c04cdce740c4e3df1b599e6f6899c34ab45c57dc808","start":145}],"target_id":"concept.go.go0003006","target_kind":"node","target_sha256":"f6c137f0ee554f1e8f9d01634594af6ed6c49681dd63ce23c4a23641bb48ad9b"}],"concept.go.go0003008":[{"id":"assertion.concept.go.go0003008","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"system process as defined in the captured Gene Ontology term GO:0003008","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines system process as: A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","support":[{"end":355,"quote":"A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","source_id":"quickgo.go_0003008","source_sha256":"f61081792fc4229c13c71ce9513da7618f734476706c63109b1aa6bf2e0d4e79","start":113}],"target_id":"concept.go.go0003008","target_kind":"node","target_sha256":"3c6b9833a8b8ee6da23161bd9459494bcc7c0ccab444800190a80f8792619297"}],"concept.go.go0005576":[{"id":"assertion.concept.go.go0005576","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extracellular region as defined in the captured Gene Ontology term GO:0005576","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular region as: The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","support":[{"end":381,"quote":"The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","source_id":"quickgo.go_0005576","source_sha256":"1a5bc80b1690033f9e769eac2dfa341411ff3c983c7e3b3121e68923bf5e1173","start":119}],"target_id":"concept.go.go0005576","target_kind":"node","target_sha256":"74a05cf05864e4ca125b790e44a01cba09435ae49bd37577da639d4a5cfbdcb0"}],"concept.go.go0005630":[{"id":"assertion.concept.go.go0005630","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dityrosine layer of spore wall as defined in the captured Gene Ontology term GO:0005630","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dityrosine layer of spore wall as: The outermost layer of the spore wall, as described in Saccharomyces.","support":[{"end":198,"quote":"The outermost layer of the spore wall, as described in Saccharomyces.","source_id":"quickgo.go_0005630","source_sha256":"73f37b2c9f4e8caae28ff2eba0e5895f662e51be6c122a57ca0f376cacf298f1","start":129}],"target_id":"concept.go.go0005630","target_kind":"node","target_sha256":"72b43eb17964c55e8fbed9f189a5d7154b653b4d86a588c83989e2ceaf49c45e"}],"concept.go.go0005631":[{"id":"assertion.concept.go.go0005631","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chitosan layer of spore wall as defined in the captured Gene Ontology term GO:0005631","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chitosan layer of spore wall as: The second outermost layer of the spore wall, as described in Saccharomyces.","support":[{"end":203,"quote":"The second outermost layer of the spore wall, as described in Saccharomyces.","source_id":"quickgo.go_0005631","source_sha256":"742f8a446cecd184ddde0cc46a96b2921c8844a61b19d17220f918f00fbfd73e","start":127}],"target_id":"concept.go.go0005631","target_kind":"node","target_sha256":"d92c308df788774804516ba24ae460662445ce701091346d96cea2ad1fd3e359"}],"concept.go.go0005652":[{"id":"assertion.concept.go.go0005652","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nuclear lamina as defined in the captured Gene Ontology term GO:0005652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear lamina as: The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","support":[{"end":616,"quote":"The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","source_id":"quickgo.go_0005652","source_sha256":"a248198282d8b57e2f32a6aa521373f7a68a0b4ebdeb8b502352718c2f9caa06","start":113}],"target_id":"concept.go.go0005652","target_kind":"node","target_sha256":"e173783cbe7cb4050c109e69fd7155e50d8dcfababb5e87dbae8775ae06bdec1"}],"concept.go.go0005654":[{"id":"assertion.concept.go.go0005654","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nucleoplasm as defined in the captured Gene Ontology term GO:0005654","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasm as: That part of the nuclear content other than the chromosomes or the nucleolus.","support":[{"end":187,"quote":"That part of the nuclear content other than the chromosomes or the nucleolus.","source_id":"quickgo.go_0005654","source_sha256":"1c79b7b646130368e28482eb70e8a44e70bbd59312e47d12c64bc1dea098ea96","start":110}],"target_id":"concept.go.go0005654","target_kind":"node","target_sha256":"44b850892af1961e78f2018fcc330ab111a057348a6d31c351415c13a25943e0"}],"concept.go.go0005825":[{"id":"assertion.concept.go.go0005825","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"half bridge of spindle pole body as defined in the captured Gene Ontology term GO:0005825","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines half bridge of spindle pole body as: Structure adjacent to the plaques of the spindle pole body.","support":[{"end":190,"quote":"Structure adjacent to the plaques of the spindle pole body.","source_id":"quickgo.go_0005825","source_sha256":"030b2d54f76c8faa514067bf97645c96dca2b726cb68ceb8d73ea90229a92caf","start":131}],"target_id":"concept.go.go0005825","target_kind":"node","target_sha256":"7412b26df3454aba112d2e8cc01000d35dd579827734c97043f0a0afaa096f6c"}],"concept.go.go0005829":[{"id":"assertion.concept.go.go0005829","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytosol as defined in the captured Gene Ontology term GO:0005829","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosol as: The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","support":[{"end":240,"quote":"The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","source_id":"quickgo.go_0005829","source_sha256":"a1826f9605f4082b76143c0a6f7d92e3e743c498bda07e56e04d9db0bf2aef5c","start":106}],"target_id":"concept.go.go0005829","target_kind":"node","target_sha256":"9233d1545b9c77548faec0d37d291fc0ef7d84191fcf6380f78ff86fe0687de2"}],"concept.go.go0006276":[{"id":"assertion.concept.go.go0006276","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasmid maintenance as defined in the captured Gene Ontology term GO:0006276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasmid maintenance as: The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","support":[{"end":279,"quote":"The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","source_id":"quickgo.go_0006276","source_sha256":"e33daf065ad720a74d44377bbe00509380d3d3dc749987b12b0ce86f16a8653a","start":118}],"target_id":"concept.go.go0006276","target_kind":"node","target_sha256":"e0b9787b7d1c962003014fc187170982d1ac348a4361c18efb3cd8b6f61fdc96"}],"concept.go.go0006457":[{"id":"assertion.concept.go.go0006457","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein folding as defined in the captured Gene Ontology term GO:0006457","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein folding as: The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","support":[{"end":271,"quote":"The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","source_id":"quickgo.go_0006457","source_sha256":"deb133d5183ee042e3da3553bdc59d07ebc4f29d3c8f1aa41e74001e14335811","start":114}],"target_id":"concept.go.go0006457","target_kind":"node","target_sha256":"0e1ab1fe22951f2c7b27e902208961dbeee4b43511de910ba954646ec82d8942"}],"concept.go.go0006515":[{"id":"assertion.concept.go.go0006515","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein quality control as defined in the captured Gene Ontology term GO:0006515","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein quality control as: The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","support":[{"end":385,"quote":"The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","source_id":"quickgo.go_0006515","source_sha256":"1eb6d9113147d9f7c0af499f408cfb15dece9fd5d55148618b1710d36bf93781","start":122}],"target_id":"concept.go.go0006515","target_kind":"node","target_sha256":"59f75392b2321204ca75574fbdcb2c20a9a5f28a36b6c686949a2ba1062fb6ec"}],"concept.go.go0006955":[{"id":"assertion.concept.go.go0006955","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immune response as defined in the captured Gene Ontology term GO:0006955","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune response as: Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","support":[{"end":240,"quote":"Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","source_id":"quickgo.go_0006955","source_sha256":"9471658faa59d6d352a73660f12af97d315286fb1fa4416046c19105f62466f1","start":114}],"target_id":"concept.go.go0006955","target_kind":"node","target_sha256":"659e325aef18dd829f1c7eb4d37297fd1c11d081b6a3bf5cdfd02015068447b5"}],"concept.go.go0007017":[{"id":"assertion.concept.go.go0007017","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microtubule-based process as defined in the captured Gene Ontology term GO:0007017","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule-based process as: Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","support":[{"end":287,"quote":"Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","source_id":"quickgo.go_0007017","source_sha256":"efba1cfaf785cc5740950a940979931d7a1da929d46b2fa0d1d8f481f588a5fc","start":124}],"target_id":"concept.go.go0007017","target_kind":"node","target_sha256":"6535fe210df6aa6fb5a10d86266b2dea4e37ddce8194a0b2452571df52de6056"}],"concept.go.go0007049":[{"id":"assertion.concept.go.go0007049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle as defined in the captured Gene Ontology term GO:0007049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle as: The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","support":[{"end":505,"quote":"The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","source_id":"quickgo.go_0007049","source_sha256":"8b8e871b3da14205b3b4e173f419ebf955756e7a6babdf2f960f37208aa4a798","start":109}],"target_id":"concept.go.go0007049","target_kind":"node","target_sha256":"84b57f0594f0840ba0aa45c21f4ba4b8f13d5bade1c906ab77bcc2bb9d2f23b0"}],"concept.go.go0007117":[{"id":"assertion.concept.go.go0007117","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"budding cell bud growth as defined in the captured Gene Ontology term GO:0007117","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines budding cell bud growth as: The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","support":[{"end":320,"quote":"The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","source_id":"quickgo.go_0007117","source_sha256":"cf43c9cb0e7d99173233610bf3980d4a4843dabad34c984a449ed23c3449035a","start":122}],"target_id":"concept.go.go0007117","target_kind":"node","target_sha256":"d69f9c91d193bc9459fb423d3a48abd9f2522db4b913a55611dd75f39d746585"}],"concept.go.go0007154":[{"id":"assertion.concept.go.go0007154","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell communication as defined in the captured Gene Ontology term GO:0007154","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell communication as: Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","support":[{"end":387,"quote":"Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","source_id":"quickgo.go_0007154","source_sha256":"a6538c8bb6e7242c43cf738b306743681f9e7445e34ba86c23bf61784ae13ff5","start":117}],"target_id":"concept.go.go0007154","target_kind":"node","target_sha256":"d4ce6e59a8b4a4d882b77dcd958ebc378b7cac29801dcc8771e1183f538e864c"}],"concept.go.go0007155":[{"id":"assertion.concept.go.go0007155","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell adhesion as defined in the captured Gene Ontology term GO:0007155","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion as: The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","support":[{"end":253,"quote":"The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","source_id":"quickgo.go_0007155","source_sha256":"31ee4cac91af2e2e80ee53a8a6a288c9433ff83e865d4a9c9267e043fc0a343c","start":112}],"target_id":"concept.go.go0007155","target_kind":"node","target_sha256":"403155940783e98ceea6bf9e53b149ec428bcff441fca794da2546dc09153baa"}],"concept.go.go0007165":[{"id":"assertion.concept.go.go0007165","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"signal transduction as defined in the captured Gene Ontology term GO:0007165","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines signal transduction as: The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","support":[{"end":885,"quote":"The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","source_id":"quickgo.go_0007165","source_sha256":"dac929861fbd68dc33b198d4d4ad5db35c0762fc70e366a0b081dd3abafbd596","start":118}],"target_id":"concept.go.go0007165","target_kind":"node","target_sha256":"a8c46d3e39b5b71bb61a679f7b6732925f5ecf9ba23f2ffe1576083fe66f204e"}],"concept.go.go0007272":[{"id":"assertion.concept.go.go0007272","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ensheathment of neurons as defined in the captured Gene Ontology term GO:0007272","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ensheathment of neurons as: The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","support":[{"end":296,"quote":"The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","source_id":"quickgo.go_0007272","source_sha256":"e957c9ae7478f77ba2ba82628eca1de8a149c85631bc2b1a8765b40c4db02c55","start":122}],"target_id":"concept.go.go0007272","target_kind":"node","target_sha256":"ce901b8500b3b43cd4364893bed5beccdd9bae4f3a4f552134990c838dd67cd8"}],"concept.go.go0007275":[{"id":"assertion.concept.go.go0007275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism development as defined in the captured Gene Ontology term GO:0007275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism development as: The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","support":[{"end":363,"quote":"The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","source_id":"quickgo.go_0007275","source_sha256":"d48f7800ade299d58ac277ccc9d2bf34438c6e9474592dfd442c331bf675a9fe","start":133}],"target_id":"concept.go.go0007275","target_kind":"node","target_sha256":"e8b78c94125726754c123a3b80af0e28c96f7eb3c2df37e70c026b0000afe8c9"}],"concept.go.go0007340":[{"id":"assertion.concept.go.go0007340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acrosome reaction as defined in the captured Gene Ontology term GO:0007340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acrosome reaction as: The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","support":[{"end":428,"quote":"The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","source_id":"quickgo.go_0007340","source_sha256":"9935cea7223098c44191a4dc44bff3dd5340df8e93b1b6a6fa834e8dfb494cde","start":116}],"target_id":"concept.go.go0007340","target_kind":"node","target_sha256":"4c8cf3231cf8d5dc2545fffda08acf07c41d4db40a1f96225fc6c1e0018ab71d"}],"concept.go.go0007389":[{"id":"assertion.concept.go.go0007389","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pattern specification process as defined in the captured Gene Ontology term GO:0007389","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pattern specification process as: Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","support":[{"end":299,"quote":"Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","source_id":"quickgo.go_0007389","source_sha256":"63fb7cd5a8ca46808ba372c95d5ccf3ec57e81d412d13a9c56e8900b36d9f4d9","start":128}],"target_id":"concept.go.go0007389","target_kind":"node","target_sha256":"032c016b52e8e9984e4ca4222c9a7f37fab23c622b23443eaa4d71f252fa68e8"}],"concept.go.go0007566":[{"id":"assertion.concept.go.go0007566","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"embryo implantation as defined in the captured Gene Ontology term GO:0007566","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines embryo implantation as: Attachment of the blastocyst to the uterine lining.","support":[{"end":169,"quote":"Attachment of the blastocyst to the uterine lining.","source_id":"quickgo.go_0007566","source_sha256":"55cd9055141539cd1fdcae8cef590b51d3cb69aec70b2a2c625515351ab7b792","start":118}],"target_id":"concept.go.go0007566","target_kind":"node","target_sha256":"62e19a181cf7a00428e3bd5ff09c97790050573546d1dd0ad211ad90ae0ef31a"}],"concept.go.go0007586":[{"id":"assertion.concept.go.go0007586","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"digestion as defined in the captured Gene Ontology term GO:0007586","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines digestion as: The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","support":[{"end":316,"quote":"The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","source_id":"quickgo.go_0007586","source_sha256":"d9ff5fec1a6cb1d789df4d4548888fa897298354ef9eb6ddc77b10bc75dc25d2","start":108}],"target_id":"concept.go.go0007586","target_kind":"node","target_sha256":"f1446564cce7ed902a16cc4e935a2f95c433b0024d5263502b3e70aba46467aa"}],"concept.go.go0007623":[{"id":"assertion.concept.go.go0007623","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"circadian rhythm as defined in the captured Gene Ontology term GO:0007623","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines circadian rhythm as: Any biological process in an organism that recurs with a regularity of approximately 24 hours.","support":[{"end":209,"quote":"Any biological process in an organism that recurs with a regularity of approximately 24 hours.","source_id":"quickgo.go_0007623","source_sha256":"8f4e5cd2a10550079c41ebe9d577c897c6d32190d0b796b4848baea7be237172","start":115}],"target_id":"concept.go.go0007623","target_kind":"node","target_sha256":"9bea45ba5338fed25ba94caa1472ea04052bb52cf23eeb9943c7631fd2d778a9"}],"concept.go.go0007624":[{"id":"assertion.concept.go.go0007624","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ultradian rhythm as defined in the captured Gene Ontology term GO:0007624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ultradian rhythm as: The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","support":[{"end":227,"quote":"The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","source_id":"quickgo.go_0007624","source_sha256":"8593049eac461738f7cfb60e776c95367013ecd5ac01a6bbf9d98555f84ef7d6","start":115}],"target_id":"concept.go.go0007624","target_kind":"node","target_sha256":"38f3608986071aed7f4640d53028e90794e6f2719b7c314adbd333a894fb9f53"}],"concept.go.go0008037":[{"id":"assertion.concept.go.go0008037","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell recognition as defined in the captured Gene Ontology term GO:0008037","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell recognition as: The process in which a cell in an organism interprets its surroundings.","support":[{"end":186,"quote":"The process in which a cell in an organism interprets its surroundings.","source_id":"quickgo.go_0008037","source_sha256":"98f81e6bc07d8bc46557a8e12a7c3715601b936a9317ff6ac076ff44c3355729","start":115}],"target_id":"concept.go.go0008037","target_kind":"node","target_sha256":"0a67653f7c6abf5e5bc679855bf6f75f4f5415f57e5ab445984032097feab409"}],"concept.go.go0008152":[{"id":"assertion.concept.go.go0008152","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metabolic process as defined in the captured Gene Ontology term GO:0008152","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines metabolic process as: A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","support":[{"end":498,"quote":"A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well  macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","source_id":"quickgo.go_0008152","source_sha256":"c573fc911e654d958aca908731dfc89e2d990dbd2866cfba3c4d4ac907acc8d9","start":116}],"target_id":"concept.go.go0008152","target_kind":"node","target_sha256":"ccfaf5aa79abdb1a66d29552d86df29219d285bd89a1eb775e166fd2326f052d"}],"concept.go.go0008219":[{"id":"assertion.concept.go.go0008219","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell death as defined in the captured Gene Ontology term GO:0008219","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell death as: Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","support":[{"end":786,"quote":"Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","source_id":"quickgo.go_0008219","source_sha256":"654739e23b44a6ac847da4419b23d8cf6e73a5f553f787b2e32fd02d299ab835","start":109}],"target_id":"concept.go.go0008219","target_kind":"node","target_sha256":"73815e1476759ca9f421adde1791fde42f02202efb46015f961769de33f4c820"}],"concept.go.go0008283":[{"id":"assertion.concept.go.go0008283","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell population proliferation as defined in the captured Gene Ontology term GO:0008283","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell population proliferation as: The multiplication or reproduction of cells, resulting in the expansion of a cell population.","support":[{"end":221,"quote":"The multiplication or reproduction of cells, resulting in the expansion of a cell population.","source_id":"quickgo.go_0008283","source_sha256":"99d52aaeaf8812f470059b0ad98a0f2e57051c73d937a6b46ab29b91e5c716a9","start":128}],"target_id":"concept.go.go0008283","target_kind":"node","target_sha256":"825ace3f623f24ce56aaa6eca77461526beff3e18170edd9dd5abbb3ac2d9c4f"}],"concept.go.go0008340":[{"id":"assertion.concept.go.go0008340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"determination of adult lifespan as defined in the captured Gene Ontology term GO:0008340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines determination of adult lifespan as: The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","support":[{"end":220,"quote":"The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","source_id":"quickgo.go_0008340","source_sha256":"7853ad1069ca9544e2aa2e52516d0ad6405ecc51794d267e0c356deae68fd066","start":130}],"target_id":"concept.go.go0008340","target_kind":"node","target_sha256":"07e883c8669e2d6c370e9a8585bf22d5eaafc1eea96428a606be0b181c10b95a"}],"concept.go.go0009292":[{"id":"assertion.concept.go.go0009292","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"horizontal gene transfer as defined in the captured Gene Ontology term GO:0009292","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines horizontal gene transfer as: The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","support":[{"end":259,"quote":"The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","source_id":"quickgo.go_0009292","source_sha256":"2bdc02348b358cc502b9e5e6d1250116f3ad52c16dc00dec7f7f8e222ca7c134","start":123}],"target_id":"concept.go.go0009292","target_kind":"node","target_sha256":"3748dbb12c8e5b8a4f87de65f8389a6d495165c0f40267bcecc4c4c678e64a17"}],"concept.go.go0009407":[{"id":"assertion.concept.go.go0009407","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"toxin catabolic process as defined in the captured Gene Ontology term GO:0009407","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines toxin catabolic process as: The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","support":[{"end":360,"quote":"The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","source_id":"quickgo.go_0009407","source_sha256":"58c964b721ea86627c9cb4dcd073376d909060ccb728e6444f079857fad69df1","start":122}],"target_id":"concept.go.go0009407","target_kind":"node","target_sha256":"a57592cbd80fd1b05bbc29755b328019af4b85c030792fd48e10d937713eb633"}],"concept.go.go0009420":[{"id":"assertion.concept.go.go0009420","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum filament as defined in the captured Gene Ontology term GO:0009420","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament as: The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","support":[{"end":247,"quote":"The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","source_id":"quickgo.go_0009420","source_sha256":"6129cab9f1deef8ad1b4da6adeca7a66e37eb3a5c41c9504e185a8bcec1e80a7","start":132}],"target_id":"concept.go.go0009420","target_kind":"node","target_sha256":"3af42b93fc2fe2836f58527a3637ef52dd161ff96691d34ec0b05004d6f1b488"}],"concept.go.go0009421":[{"id":"assertion.concept.go.go0009421","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum filament cap as defined in the captured Gene Ontology term GO:0009421","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament cap as: The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","support":[{"end":223,"quote":"The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","source_id":"quickgo.go_0009421","source_sha256":"5acf6a3dee878ab40207a1a5b6f03b5e603dd919fac38629253a62663afe6837","start":136}],"target_id":"concept.go.go0009421","target_kind":"node","target_sha256":"480b28b8c091ee2278862ae9295b32d3c28799161b5362849a9bfe63465beda2"}],"concept.go.go0009422":[{"id":"assertion.concept.go.go0009422","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum hook-filament junction as defined in the captured Gene Ontology term GO:0009422","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook-filament junction as: The region of the bacterial-type flagellum where the hook and filament meet.","support":[{"end":222,"quote":"The region of the bacterial-type flagellum where the hook and filament meet.","source_id":"quickgo.go_0009422","source_sha256":"5c3f6601cdb52383381475d8ce358dd1a78eb131f9f4ebef4c4e3e22c1d7ff9b","start":146}],"target_id":"concept.go.go0009422","target_kind":"node","target_sha256":"b8289911a1a86080b1f5d0a3d7b958896fefe6b69ae12b4ab699969ebe1c5d1f"}],"concept.go.go0009424":[{"id":"assertion.concept.go.go0009424","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum hook as defined in the captured Gene Ontology term GO:0009424","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook as: The portion of the bacterial-type flagellum that connects the filament to the basal body.","support":[{"end":217,"quote":"The portion of the bacterial-type flagellum that connects the filament to the basal body.","source_id":"quickgo.go_0009424","source_sha256":"c02dc500674b4169f3248825fcfec4b5c404871023b01c20ab023d876f7896da","start":128}],"target_id":"concept.go.go0009424","target_kind":"node","target_sha256":"0800e8e3ec203182888cf26707e3fc4c3d0a5267b1b3b82c135eefd7420f7185"}],"concept.go.go0009431":[{"id":"assertion.concept.go.go0009431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum basal body, MS ring as defined in the captured Gene Ontology term GO:0009431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, MS ring as: One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","support":[{"end":282,"quote":"One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","source_id":"quickgo.go_0009431","source_sha256":"e37ef4fce4fa4e2350dc3f75aed84573b0a255645631469b932ede1c6fd00794","start":143}],"target_id":"concept.go.go0009431","target_kind":"node","target_sha256":"a6e5cafa29d3c7d10b3a6ef459dd1791701cf5e59a227ad1be620761629ac6f6"}],"concept.go.go0009433":[{"id":"assertion.concept.go.go0009433","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum basal body, C ring as defined in the captured Gene Ontology term GO:0009433","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, C ring as: Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","support":[{"end":436,"quote":"Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","source_id":"quickgo.go_0009433","source_sha256":"5f75fcc2454f210682a3a8ef797079fd5c841b70f79fcff8460f10619df82ee4","start":142}],"target_id":"concept.go.go0009433","target_kind":"node","target_sha256":"fdde6fd99ff3a62f5c93e54eb30e25ad9cbb83f281227d1f711083eee6765d1e"}],"concept.go.go0009541":[{"id":"assertion.concept.go.go0009541","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"etioplast prolamellar body as defined in the captured Gene Ontology term GO:0009541","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines etioplast prolamellar body as: A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","support":[{"end":542,"quote":"A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","source_id":"quickgo.go_0009541","source_sha256":"1886a026d618bb9dac4783e6bf86d7fce7772ad80f201c4717a698c3f124ecbc","start":125}],"target_id":"concept.go.go0009541","target_kind":"node","target_sha256":"416d417f96b7a19c9065bbd98247e204d24352b630d96d5c6bdadb3ae6ef7207"}],"concept.go.go0009542":[{"id":"assertion.concept.go.go0009542","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"granum as defined in the captured Gene Ontology term GO:0009542","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines granum as: Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","support":[{"end":288,"quote":"Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","source_id":"quickgo.go_0009542","source_sha256":"8d8c19b428f21c46e1d87a0c9ab209d5b7851ef8ae204a092240497510022d13","start":105}],"target_id":"concept.go.go0009542","target_kind":"node","target_sha256":"cd03d4d1217af28fb1f5d7bcbf4f9071adaeeaefce4de273f83b0013a9cbcb68"}],"concept.go.go0009561":[{"id":"assertion.concept.go.go0009561","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"megagametogenesis as defined in the captured Gene Ontology term GO:0009561","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines megagametogenesis as: The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","support":[{"end":907,"quote":"The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","source_id":"quickgo.go_0009561","source_sha256":"0788fcb0ac46e3282190997440e819a1675a981278defe80fd566f08641a8b32","start":116}],"target_id":"concept.go.go0009561","target_kind":"node","target_sha256":"acc6194909375c8783895b519ab47d2d153139417492e0323fe53389277fd925"}],"concept.go.go0009566":[{"id":"assertion.concept.go.go0009566","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fertilization as defined in the captured Gene Ontology term GO:0009566","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fertilization as: The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","support":[{"end":295,"quote":"The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","source_id":"quickgo.go_0009566","source_sha256":"31d4b89d19b4da59ca48467753d45c056646687b41bfb416a930ac75a5fab453","start":112}],"target_id":"concept.go.go0009566","target_kind":"node","target_sha256":"0bd1393572c324706d54ff5abf001e4cdacf8091c1b19395924a4945357467eb"}],"concept.go.go0009574":[{"id":"assertion.concept.go.go0009574","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"preprophase band as defined in the captured Gene Ontology term GO:0009574","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines preprophase band as: A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","support":[{"end":543,"quote":"A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","source_id":"quickgo.go_0009574","source_sha256":"7add76bf9b33d554bd7f1bf8ae611f35653ed042e0f69cf71c2ebb71b506c5c4","start":115}],"target_id":"concept.go.go0009574","target_kind":"node","target_sha256":"8a40d2d5af70718b7a5f3ed4221a60088c210404256bd1f833333efd6b55e315"}],"concept.go.go0009653":[{"id":"assertion.concept.go.go0009653","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure morphogenesis as defined in the captured Gene Ontology term GO:0009653","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure morphogenesis as: The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","support":[{"end":252,"quote":"The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","source_id":"quickgo.go_0009653","source_sha256":"c85860ce1fd28acfac44cab6b090fd7b0d90ff78216f5a4c3bfa4a6ace521dd7","start":133}],"target_id":"concept.go.go0009653","target_kind":"node","target_sha256":"098c124d47a0d9e20428679fa8bb14892aea6b623da052a947b72798eff21119"}],"concept.go.go0009791":[{"id":"assertion.concept.go.go0009791","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"post-embryonic development as defined in the captured Gene Ontology term GO:0009791","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines post-embryonic development as: The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","support":[{"end":302,"quote":"The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","source_id":"quickgo.go_0009791","source_sha256":"f38972e2e334873ccc1108d16838b2467d7f9288e9d2ec973c43da130e4b2473","start":125}],"target_id":"concept.go.go0009791","target_kind":"node","target_sha256":"38195893d388ab1f6107a7340065ba50e9f95fd0c3be9ca2b39e3058c25d1b04"}],"concept.go.go0009838":[{"id":"assertion.concept.go.go0009838","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"abscission as defined in the captured Gene Ontology term GO:0009838","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines abscission as: The controlled shedding of a body part.","support":[{"end":148,"quote":"The controlled shedding of a body part.","source_id":"quickgo.go_0009838","source_sha256":"d53d33258f36e097af90743a9039c68040537ec6fcfccadcd2a3215a51d83289","start":109}],"target_id":"concept.go.go0009838","target_kind":"node","target_sha256":"ecccd4f0db0d891c3d04c06c7684e4851d8b9f7b5d2e6e7efb4dc24fa3b52e3d"}],"concept.go.go0009845":[{"id":"assertion.concept.go.go0009845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"seed germination as defined in the captured Gene Ontology term GO:0009845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed germination as: The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","support":[{"end":280,"quote":"The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","source_id":"quickgo.go_0009845","source_sha256":"35698f1020596189a3aeed5799766e08bde35de4953d065dbc96218a5d9136eb","start":115}],"target_id":"concept.go.go0009845","target_kind":"node","target_sha256":"29506a00f712f10fc3a1b44e371f2981ce9fbc79ca9d9694743ab521086fb2f1"}],"concept.go.go0009846":[{"id":"assertion.concept.go.go0009846","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen germination as defined in the captured Gene Ontology term GO:0009846","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen germination as: The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","support":[{"end":311,"quote":"The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","source_id":"quickgo.go_0009846","source_sha256":"8183e88573c437d97c95c4d12a6a6521c4f55e332ae3711e06171c4cf0f3620f","start":117}],"target_id":"concept.go.go0009846","target_kind":"node","target_sha256":"f0d56d79cf7f231945228b4b68d07e85f51d89bfb331f7471d878aa744b8f671"}],"concept.go.go0009865":[{"id":"assertion.concept.go.go0009865","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen tube adhesion as defined in the captured Gene Ontology term GO:0009865","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube adhesion as: The process in which the pollen tube adheres to cells of the stigma and style.","support":[{"end":197,"quote":"The process in which the pollen tube adheres to cells of the stigma and style.","source_id":"quickgo.go_0009865","source_sha256":"c1ba567c6de60ce563a44d77390f2c1593263bb48b2312bd93a8fce71f64c972","start":119}],"target_id":"concept.go.go0009865","target_kind":"node","target_sha256":"7dd8f6d9820eec68605bdfaa6a45fcffbc1ac300423d7600f892c46fc255d569"}],"concept.go.go0009987":[{"id":"assertion.concept.go.go0009987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular process as defined in the captured Gene Ontology term GO:0009987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process as: Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","support":[{"end":317,"quote":"Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","source_id":"quickgo.go_0009987","source_sha256":"035db34413527c31f9b4ddcfe3da88349b511356abd9b0ac3f5b85ee8beb8b68","start":115}],"target_id":"concept.go.go0009987","target_kind":"node","target_sha256":"620bdea69b7bd959dfcdb1940f6db24bd965a4592f3c3d0bd0c47247dab6b01b"}],"concept.go.go0010014":[{"id":"assertion.concept.go.go0010014","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem initiation as defined in the captured Gene Ontology term GO:0010014","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem initiation as: Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","support":[{"end":374,"quote":"Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","source_id":"quickgo.go_0010014","source_sha256":"223d244fea99b4f8997328f86dacdf6c5ae732551d774cfe415feeebafe6f37c","start":118}],"target_id":"concept.go.go0010014","target_kind":"node","target_sha256":"14c3a222201006db6e8fae980bb8ea64f589fb120e86e99fbf6cb118efb49f41"}],"concept.go.go0010022":[{"id":"assertion.concept.go.go0010022","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem determinacy as defined in the captured Gene Ontology term GO:0010022","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem determinacy as: The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","support":[{"end":255,"quote":"The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","source_id":"quickgo.go_0010022","source_sha256":"1c8f4e5b593becf0cc00b42fb4716099d4a4181eacce53a3900d38d58a907e58","start":119}],"target_id":"concept.go.go0010022","target_kind":"node","target_sha256":"0e31512058c4e99296ae58317486068b67dda94c3877e86fc508ea0f71243e60"}],"concept.go.go0010073":[{"id":"assertion.concept.go.go0010073","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meristem maintenance as defined in the captured Gene Ontology term GO:0010073","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem maintenance as: Any process involved in maintaining the identity, size and shape of a meristem.","support":[{"end":198,"quote":"Any process involved in maintaining the identity, size and shape of a meristem.","source_id":"quickgo.go_0010073","source_sha256":"246d9920878c2297f19813a50a44e5b907e3e9be4dcfbdb08a71e480b73a8b44","start":119}],"target_id":"concept.go.go0010073","target_kind":"node","target_sha256":"2a4ea396171bb078a4242b4a8ede2dc8750b0ce5579a16dbe3ff7bf46a73a7eb"}],"concept.go.go0010118":[{"id":"assertion.concept.go.go0010118","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stomatal movement as defined in the captured Gene Ontology term GO:0010118","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines stomatal movement as: The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","support":[{"end":306,"quote":"The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","source_id":"quickgo.go_0010118","source_sha256":"e684666238c2d0578d0b470b5ab3690a5ae438c7224549e022f67d7788f50c5d","start":116}],"target_id":"concept.go.go0010118","target_kind":"node","target_sha256":"0acbaaa680fd25d9e1532dd5064811914368be3aea41a53006be2be1afb0fc0d"}],"concept.go.go0010127":[{"id":"assertion.concept.go.go0010127","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mycothiol-dependent detoxification as defined in the captured Gene Ontology term GO:0010127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mycothiol-dependent detoxification as: The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","support":[{"end":317,"quote":"The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","source_id":"quickgo.go_0010127","source_sha256":"774cfe8611d0a65f2bc1089bf58143ab1a8e824b7506d66954ed8b360e4feb59","start":133}],"target_id":"concept.go.go0010127","target_kind":"node","target_sha256":"8712dd099a0bce2bd7151be897559c266bceb66b3dfbb2c67e043bb52d39813a"}],"concept.go.go0010162":[{"id":"assertion.concept.go.go0010162","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"seed dormancy process as defined in the captured Gene Ontology term GO:0010162","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","support":[{"end":510,"quote":"A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","source_id":"quickgo.go_0010162","source_sha256":"ca39e5096ccf7a26da74089ca1f2defff2032dff92fe149bfa3ad5d957822e65","start":120}],"target_id":"concept.go.go0010162","target_kind":"node","target_sha256":"0a892c294bc7fa715ff3031e49b7a549dd582957d4301cc9480f6fa050335a75"}],"concept.go.go0010483":[{"id":"assertion.concept.go.go0010483","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pollen tube reception as defined in the captured Gene Ontology term GO:0010483","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube reception as: An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","support":[{"end":361,"quote":"An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","source_id":"quickgo.go_0010483","source_sha256":"c983ea09648ddd7bd11710b4f3f9358071526be5e26f91e75fb3b8f96e8ad23c","start":120}],"target_id":"concept.go.go0010483","target_kind":"node","target_sha256":"8d56dbb1fba4760f55385b312fb5ee80de2e726b4fa8454c68ba7512fd83cd45"}],"concept.go.go0012505":[{"id":"assertion.concept.go.go0012505","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"endomembrane system as defined in the captured Gene Ontology term GO:0012505","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines endomembrane system as: A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","support":[{"end":428,"quote":"A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","source_id":"quickgo.go_0012505","source_sha256":"d98c87d0ab4ad805143a5ad65c76e660c2cbcfac521469ed8e0d6dc13d308ab4","start":118}],"target_id":"concept.go.go0012505","target_kind":"node","target_sha256":"d9d93581d42c215240a0682b9147fc8ef05352f05a79002e6ada455f70e1224c"}],"concept.go.go0014705":[{"id":"assertion.concept.go.go0014705","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"C zone as defined in the captured Gene Ontology term GO:0014705","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines C zone as: A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","support":[{"end":270,"quote":"A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","source_id":"quickgo.go_0014705","source_sha256":"a7abb9f2a722b2259c69dc759529c9fe087dbea5fe455daec4b56a38d92d99f2","start":105}],"target_id":"concept.go.go0014705","target_kind":"node","target_sha256":"1340b4c9ce035deaf72caa952acf96a6fde4d17f84d27a5f07f8c86d09850ec7"}],"concept.go.go0014801":[{"id":"assertion.concept.go.go0014801","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"longitudinal sarcoplasmic reticulum as defined in the captured Gene Ontology term GO:0014801","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines longitudinal sarcoplasmic reticulum as: The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","support":[{"end":248,"quote":"The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","source_id":"quickgo.go_0014801","source_sha256":"334991fc68beab2a40f49985265b46d06fd06dd000f46b7e246a4d771bbf304b","start":134}],"target_id":"concept.go.go0014801","target_kind":"node","target_sha256":"e0138f7e7c251a64214dff46fff773cd2d7713cbb35916052cb2804e571f5d3c"}],"concept.go.go0016032":[{"id":"assertion.concept.go.go0016032","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral process as defined in the captured Gene Ontology term GO:0016032","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral process as: A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","support":[{"end":473,"quote":"A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","source_id":"quickgo.go_0016032","source_sha256":"effd102888e9fceff7fbbeb8889d6529f2a4ac20e068b1060fb2304373e1e270","start":112}],"target_id":"concept.go.go0016032","target_kind":"node","target_sha256":"65e2e84a3f3d9efc7503414cc0d135035ea63dd6d0feb5e9a0f9077996112c49"}],"concept.go.go0016037":[{"id":"assertion.concept.go.go0016037","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"light absorption as defined in the captured Gene Ontology term GO:0016037","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines light absorption as: The reception of a photon by a cell.","support":[{"end":151,"quote":"The reception of a photon by a cell.","source_id":"quickgo.go_0016037","source_sha256":"efe9903b25d9e22c3ace3f4c653443a841fa435dac77f7607efcd5ae76a5d013","start":115}],"target_id":"concept.go.go0016037","target_kind":"node","target_sha256":"86fa5c8b689787cab8d32a48e838a307c22c829af32715170c5cf4917380f6e2"}],"concept.go.go0016049":[{"id":"assertion.concept.go.go0016049","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell growth as defined in the captured Gene Ontology term GO:0016049","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell growth as: The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","support":[{"end":262,"quote":"The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","source_id":"quickgo.go_0016049","source_sha256":"7105897a34c204fce30ddf94b3906f9cb68405b454b75f7a7b5c9529ac723e2d","start":110}],"target_id":"concept.go.go0016049","target_kind":"node","target_sha256":"deeaf96f26bc5b62d35bf59671bc5f567966aa188ac6e518534c6d3f5e30f374"}],"concept.go.go0016192":[{"id":"assertion.concept.go.go0016192","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vesicle-mediated transport as defined in the captured Gene Ontology term GO:0016192","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines vesicle-mediated transport as: A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","support":[{"end":508,"quote":"A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","source_id":"quickgo.go_0016192","source_sha256":"9c63708b412f5011ed66af3a3b828b135e731165d99655989a7d765d9cad93e5","start":125}],"target_id":"concept.go.go0016192","target_kind":"node","target_sha256":"30e607221c0f08d6f05f77bbc3c6cc6b713ac4a40459afe297801179c6d7b331"}],"concept.go.go0016203":[{"id":"assertion.concept.go.go0016203","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"muscle attachment as defined in the captured Gene Ontology term GO:0016203","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle attachment as: The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","support":[{"end":220,"quote":"The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","source_id":"quickgo.go_0016203","source_sha256":"2197297cf9a34c82fdd12281365b7bd94f05b83395f670c145916f27bc56ed6e","start":116}],"target_id":"concept.go.go0016203","target_kind":"node","target_sha256":"e5580c7da25f4439342d5e19e9baad545921e8c1cd7f88dcd221d3afc6ef56e1"}],"concept.go.go0016328":[{"id":"assertion.concept.go.go0016328","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lateral plasma membrane as defined in the captured Gene Ontology term GO:0016328","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral plasma membrane as: The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","support":[{"end":307,"quote":"The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","source_id":"quickgo.go_0016328","source_sha256":"934b3f1d81a289cd6252de6d185c99ca65110ee00cece71d8b94ca78e843788f","start":122}],"target_id":"concept.go.go0016328","target_kind":"node","target_sha256":"bc52317993a079e0d9f1f5935f96b9101213f94abe6d3d30736f4591ebd2c335"}],"concept.go.go0019013":[{"id":"assertion.concept.go.go0019013","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral nucleocapsid as defined in the captured Gene Ontology term GO:0019013","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral nucleocapsid as: The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","support":[{"end":219,"quote":"The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","source_id":"quickgo.go_0019013","source_sha256":"d3614e55a444b568b29a7e376368f97dd7f0c3a890734bb2c2c0827b41cd014c","start":117}],"target_id":"concept.go.go0019013","target_kind":"node","target_sha256":"81e78e626eb6175d0a9c5566f1adc3ad4b85c0a415c3a44bf9b5bf5b12e71aea"}],"concept.go.go0019028":[{"id":"assertion.concept.go.go0019028","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid as defined in the captured Gene Ontology term GO:0019028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid as: The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","support":[{"end":260,"quote":"The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","source_id":"quickgo.go_0019028","source_sha256":"50dc1e906b6737a321f926c21df5145dff2791327c341cc0e5c7f045a6af239f","start":111}],"target_id":"concept.go.go0019028","target_kind":"node","target_sha256":"fdf63366de1d6ca4536577be3cabf6f1d318071eab9bd4f9a4d0e4a4748b4d35"}],"concept.go.go0019033":[{"id":"assertion.concept.go.go0019033","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tegument as defined in the captured Gene Ontology term GO:0019033","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tegument as: A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","support":[{"end":233,"quote":"A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","source_id":"quickgo.go_0019033","source_sha256":"7abf201fb1d23a690b03875b8bdffd0266ff745e7625233b1d1c2574f10eba00","start":113}],"target_id":"concept.go.go0019033","target_kind":"node","target_sha256":"bf7accadb7a2da670fe572a51c32f7980bc4418c813787264d8ec19c020155df"}],"concept.go.go0019042":[{"id":"assertion.concept.go.go0019042","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral latency as defined in the captured Gene Ontology term GO:0019042","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral latency as: The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","support":[{"end":301,"quote":"The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","source_id":"quickgo.go_0019042","source_sha256":"4cfbd3210223fed94c982cb09ba22856734c924c32466476e9a7cdbb50b5b755","start":112}],"target_id":"concept.go.go0019042","target_kind":"node","target_sha256":"9e4afb5b9796ab01b42c5d748fe7d6f64a70c4030fac355d20d42b846b884c4d"}],"concept.go.go0019045":[{"id":"assertion.concept.go.go0019045","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"latent virus replication as defined in the captured Gene Ontology term GO:0019045","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines latent virus replication as: Any process required for latent viral replication in a cell.","support":[{"end":183,"quote":"Any process required for latent viral replication in a cell.","source_id":"quickgo.go_0019045","source_sha256":"f8cf43cdc0a4efa2fd7bcea0edf5f405c24b5c8b9220669559b573a86055e3f7","start":123}],"target_id":"concept.go.go0019045","target_kind":"node","target_sha256":"adcd19831e1e56818585ead1d222887086e869fd957ba7c9be13eaa7227732c5"}],"concept.go.go0019046":[{"id":"assertion.concept.go.go0019046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"release from viral latency as defined in the captured Gene Ontology term GO:0019046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines release from viral latency as: The process by which a virus begins to replicate following a latency replication decision (switch).","support":[{"end":224,"quote":"The process by which a virus begins to replicate following a latency replication decision (switch).","source_id":"quickgo.go_0019046","source_sha256":"55f7977af8cfab47d190bc10a177dbd7d698cc4f42a9d34fc11d9bcb573ce768","start":125}],"target_id":"concept.go.go0019046","target_kind":"node","target_sha256":"f7702d37997951c4dc50ce5958c5680eb9f265dc6774842e2e82cd20c04ca33c"}],"concept.go.go0019058":[{"id":"assertion.concept.go.go0019058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral life cycle as defined in the captured Gene Ontology term GO:0019058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral life cycle as: A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","support":[{"end":395,"quote":"A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","source_id":"quickgo.go_0019058","source_sha256":"d892b000e03d16fb6868f1560a176e05e86a49ebe0beda77f866efd3c27d1e12","start":115}],"target_id":"concept.go.go0019058","target_kind":"node","target_sha256":"2384688d79d70bf950cca77a54fca0867a4157a2274b7fdd76825d048959c327"}],"concept.go.go0019061":[{"id":"assertion.concept.go.go0019061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"uncoating of virus as defined in the captured Gene Ontology term GO:0019061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines uncoating of virus as: The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","support":[{"end":237,"quote":"The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","source_id":"quickgo.go_0019061","source_sha256":"e8430a39caa3256c14418c2fb474c54e1172b2eac938d1b535e9c6520b7f0393","start":117}],"target_id":"concept.go.go0019061","target_kind":"node","target_sha256":"a455efc0fc37bc951f15e5b6ec70a4ea98d15974c938ec08d964e0e120161663"}],"concept.go.go0019068":[{"id":"assertion.concept.go.go0019068","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion assembly as defined in the captured Gene Ontology term GO:0019068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion assembly as: A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","support":[{"end":327,"quote":"A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","source_id":"quickgo.go_0019068","source_sha256":"d26f2ce549676a29bedabc4024f17ef6d1d48c45a67dcad8fe6b0b65742cb8c9","start":114}],"target_id":"concept.go.go0019068","target_kind":"node","target_sha256":"edf5b61610b3e65af0471c22a97704e659487c7cc9071ba847c370930625cb1a"}],"concept.go.go0019069":[{"id":"assertion.concept.go.go0019069","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid assembly as defined in the captured Gene Ontology term GO:0019069","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid assembly as: The assembly of a virus capsid from its protein subunits.","support":[{"end":177,"quote":"The assembly of a virus capsid from its protein subunits.","source_id":"quickgo.go_0019069","source_sha256":"016099cf3f0a53ecb05f22bfb62d24342206e7b72a9a598a7387ede39beb9080","start":120}],"target_id":"concept.go.go0019069","target_kind":"node","target_sha256":"edbaf52757b2384fb5fd13943c830bebe865356ea6046ca4bfba52cd91a27f71"}],"concept.go.go0019070":[{"id":"assertion.concept.go.go0019070","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome maturation as defined in the captured Gene Ontology term GO:0019070","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome maturation as: The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","support":[{"end":400,"quote":"The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","source_id":"quickgo.go_0019070","source_sha256":"c4e881c98455515618604994b330bb5c5097c7d2a1e1bbec9221596faa542595","start":122}],"target_id":"concept.go.go0019070","target_kind":"node","target_sha256":"191d246ea7cbb1c96b3692d4d7d59f967e62883793ee4123acd373f41123888e"}],"concept.go.go0019072":[{"id":"assertion.concept.go.go0019072","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome packaging as defined in the captured Gene Ontology term GO:0019072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome packaging as: The encapsulation of the viral genome within the capsid.","support":[{"end":177,"quote":"The encapsulation of the viral genome within the capsid.","source_id":"quickgo.go_0019072","source_sha256":"3808a81a8401db27b4b65c2be7c5128b0bedcf39e579b265d5deb74b9278c306","start":121}],"target_id":"concept.go.go0019072","target_kind":"node","target_sha256":"c14ec73b6fa2a5137d7554ac1d38191a5887439403fd6d1433857b36f5948921"}],"concept.go.go0019075":[{"id":"assertion.concept.go.go0019075","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus maturation as defined in the captured Gene Ontology term GO:0019075","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus maturation as: The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","support":[{"end":391,"quote":"The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","source_id":"quickgo.go_0019075","source_sha256":"507997dee60af01bf1f4ebd0fa42b6d1a5d5e4a2d203dbe430fd269c490a0eef","start":115}],"target_id":"concept.go.go0019075","target_kind":"node","target_sha256":"cb454f09fccfb46a1db6d3a2c7d76953a6426bdf1d6960edf08a0d4608bf8f8f"}],"concept.go.go0019076":[{"id":"assertion.concept.go.go0019076","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral release from host cell as defined in the captured Gene Ontology term GO:0019076","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral release from host cell as: The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","support":[{"end":265,"quote":"The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","source_id":"quickgo.go_0019076","source_sha256":"641c29272176a2494f25fc3b3028c323ca8ff73baed189076ade1341a40947e3","start":127}],"target_id":"concept.go.go0019076","target_kind":"node","target_sha256":"99dbfa78f05e1296ed659053993163543ebca2677dbdb29ffbc438393b8951e0"}],"concept.go.go0019079":[{"id":"assertion.concept.go.go0019079","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome replication as defined in the captured Gene Ontology term GO:0019079","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome replication as: Any process involved directly in viral genome replication, including viral nucleotide metabolism.","support":[{"end":220,"quote":"Any process involved directly in viral genome replication, including viral nucleotide metabolism.","source_id":"quickgo.go_0019079","source_sha256":"af510cd89fbc4e92263fba2ab11df31c85bfff394a1e575b0d51480d43be1f91","start":123}],"target_id":"concept.go.go0019079","target_kind":"node","target_sha256":"ac4dafdbd9425374349773df79f358549b08006c3bbed26609f1769416613114"}],"concept.go.go0019080":[{"id":"assertion.concept.go.go0019080","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral gene expression as defined in the captured Gene Ontology term GO:0019080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral gene expression as: A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","support":[{"end":324,"quote":"A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","source_id":"quickgo.go_0019080","source_sha256":"52b8be163f6ff0044943fee540446d220afbf9f376dee7104687ed13ed6fb46e","start":120}],"target_id":"concept.go.go0019080","target_kind":"node","target_sha256":"5d1a222d059f954dde84f46f4c240d636c4f5d6dc8b67af7f0011d0813ce93d7"}],"concept.go.go0019081":[{"id":"assertion.concept.go.go0019081","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translation as defined in the captured Gene Ontology term GO:0019081","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translation as: A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","support":[{"end":214,"quote":"A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","source_id":"quickgo.go_0019081","source_sha256":"4cc78af9a397ab86250078cab59a810fb7ed65115c27f48f91264c6382fee86a","start":116}],"target_id":"concept.go.go0019081","target_kind":"node","target_sha256":"c31d7bcc131cdbf5592723f5c391c4faff6e9a7f91ca4a300c4140ac412e40c2"}],"concept.go.go0019082":[{"id":"assertion.concept.go.go0019082","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral protein processing as defined in the captured Gene Ontology term GO:0019082","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral protein processing as: Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","support":[{"end":229,"quote":"Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","source_id":"quickgo.go_0019082","source_sha256":"997ff6bd45b9d0a587daad0380c3248b4d0312f7ab1fe30f0c0176d5febd29e3","start":123}],"target_id":"concept.go.go0019082","target_kind":"node","target_sha256":"6cb0d8fcf2b232fc01a98a7a295dc2ad261ca2b3a886c7e5561b430c8bbf6b15"}],"concept.go.go0019083":[{"id":"assertion.concept.go.go0019083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral transcription as defined in the captured Gene Ontology term GO:0019083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral transcription as: The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","support":[{"end":218,"quote":"The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","source_id":"quickgo.go_0019083","source_sha256":"9ed357e09982299dc8759246e7719a1cb6ca07f07a6d752260c496a5adc56065","start":118}],"target_id":"concept.go.go0019083","target_kind":"node","target_sha256":"a468d7ed8e0b542f0ab19600cc9826458bba7da7f1057500d8fc036573affb74"}],"concept.go.go0019725":[{"id":"assertion.concept.go.go0019725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular homeostasis as defined in the captured Gene Ontology term GO:0019725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the cell.","support":[{"end":212,"quote":"Any process involved in the maintenance of an internal steady state at the level of the cell.","source_id":"quickgo.go_0019725","source_sha256":"d10833e3804ae62740f4e8b9c2f2839a355849a313da6c36f0efccbe023d75eb","start":119}],"target_id":"concept.go.go0019725","target_kind":"node","target_sha256":"af82b1e86fb8777c3d8b6537af7358abe9f1e52fa6efaa1960f5e41955c52d69"}],"concept.go.go0019827":[{"id":"assertion.concept.go.go0019827","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"stem cell population maintenance as defined in the captured Gene Ontology term GO:0019827","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines stem cell population maintenance as: The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","support":[{"end":556,"quote":"The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","source_id":"quickgo.go_0019827","source_sha256":"14ab0d65bc3d6627ea276c06b5775be4a48e55ce8b7ea428c0118e0f2e56fbf4","start":131}],"target_id":"concept.go.go0019827","target_kind":"node","target_sha256":"99276079742a18a6824d49ff48ec5d3c43e9cbfdfe4e388c9f5da1ddeac7d57c"}],"concept.go.go0019835":[{"id":"assertion.concept.go.go0019835","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytolysis as defined in the captured Gene Ontology term GO:0019835","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytolysis as: The rupture of cell membranes and the loss of cytoplasm.","support":[{"end":164,"quote":"The rupture of cell membranes and the loss of cytoplasm.","source_id":"quickgo.go_0019835","source_sha256":"faf9a1f0049a29297e501b24d9e04b4a9984471e1ac1f4ba4eba650838e9252d","start":108}],"target_id":"concept.go.go0019835","target_kind":"node","target_sha256":"a193025dd30aedc43f176f09cdee9431fb555d1e37b8bad5e1983dd1a1087d3e"}],"concept.go.go0019882":[{"id":"assertion.concept.go.go0019882","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"antigen processing and presentation as defined in the captured Gene Ontology term GO:0019882","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen processing and presentation as: The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","support":[{"end":282,"quote":"The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","source_id":"quickgo.go_0019882","source_sha256":"e24268811bd730ba335253ee50dead701600a2198a0c4eb67018372c9c497c54","start":134}],"target_id":"concept.go.go0019882","target_kind":"node","target_sha256":"e4f06722f4844a26fed10799aaef077ce82123abf8eab672c561f891c36f3482"}],"concept.go.go0019953":[{"id":"assertion.concept.go.go0019953","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sexual reproduction as defined in the captured Gene Ontology term GO:0019953","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sexual reproduction as: A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","support":[{"end":404,"quote":"A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","source_id":"quickgo.go_0019953","source_sha256":"baaf1094d7542eac2fe373530fc3b9f103b91d33ab09cfa52317dd1ea655a909","start":118}],"target_id":"concept.go.go0019953","target_kind":"node","target_sha256":"08171f321e25c4e2349a668cf863adac1da00b55a36f99f99475ef8646980e17"}],"concept.go.go0019954":[{"id":"assertion.concept.go.go0019954","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"asexual reproduction as defined in the captured Gene Ontology term GO:0019954","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines asexual reproduction as: A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","support":[{"end":276,"quote":"A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","source_id":"quickgo.go_0019954","source_sha256":"9f080490bb4ff5c467c4b0667fe65dd9cfe4b1d28841b5c94f4ee8e0e81a1345","start":119}],"target_id":"concept.go.go0019954","target_kind":"node","target_sha256":"148423e1d2b0aa1de2903a49873d8c9272b5f052dac62dda9f638f4979454d84"}],"concept.go.go0020023":[{"id":"assertion.concept.go.go0020023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"kinetoplast as defined in the captured Gene Ontology term GO:0020023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines kinetoplast as: A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","support":[{"end":281,"quote":"A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","source_id":"quickgo.go_0020023","source_sha256":"e3658484c8a1cdd28f6d7d7cf3b0bba8ef56dccc68a54a9a6490bf73326c1f12","start":110}],"target_id":"concept.go.go0020023","target_kind":"node","target_sha256":"6bd116cd068d7a4f261d0aad873b8fe157607073dbfad469e1d00078a4c59cdb"}],"concept.go.go0020038":[{"id":"assertion.concept.go.go0020038","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"subpellicular network as defined in the captured Gene Ontology term GO:0020038","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines subpellicular network as: A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","support":[{"end":269,"quote":"A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","source_id":"quickgo.go_0020038","source_sha256":"46a3af899b1092e0c11d5c2a3c21e0a3f8eb5c76e6d821ec5133d0abbf72036f","start":120}],"target_id":"concept.go.go0020038","target_kind":"node","target_sha256":"6243454a693f3ae79fc949ccc6a1472c4418b9680b7025fb74f6d379fa47ce52"}],"concept.go.go0021700":[{"id":"assertion.concept.go.go0021700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental maturation as defined in the captured Gene Ontology term GO:0021700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental maturation as: A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","support":[{"end":303,"quote":"A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","source_id":"quickgo.go_0021700","source_sha256":"11b2881394056638aaed8b5fafc641aa88c8a3af2e6590b9ad7f43bff15c9a6a","start":123}],"target_id":"concept.go.go0021700","target_kind":"node","target_sha256":"7c1f87a8873e82233b09c11941a36d493821d2b5edfe2d8ab97b6676d9f6ad84"}],"concept.go.go0022004":[{"id":"assertion.concept.go.go0022004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"midbrain-hindbrain boundary maturation during brain development as defined in the captured Gene Ontology term GO:0022004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during brain development as: A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","support":[{"end":611,"quote":"A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","source_id":"quickgo.go_0022004","source_sha256":"32fd16851789fbde9ab7926c03526a4b054f55fbfa6aa5e5d997842946eb0892","start":162}],"target_id":"concept.go.go0022004","target_kind":"node","target_sha256":"f6640e124b79d326334b8ad933cfedf1ad80bbea965a677d0f48a9e0e24d2512"}],"concept.go.go0022005":[{"id":"assertion.concept.go.go0022005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"midbrain-hindbrain boundary maturation during neural plate development as defined in the captured Gene Ontology term GO:0022005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during neural plate development as: A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","support":[{"end":619,"quote":"A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","source_id":"quickgo.go_0022005","source_sha256":"c62a6ec281c305be0b8d92cd8987bea3d3632d21c35c74ae4370da32f3c0ba5d","start":169}],"target_id":"concept.go.go0022005","target_kind":"node","target_sha256":"c4a2db3b4316ca3905df46e5edc4f34ab4aed3e58a51b5c9c11b0c6570b8abf4"}],"concept.go.go0022402":[{"id":"assertion.concept.go.go0022402","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle process as defined in the captured Gene Ontology term GO:0022402","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle process as: The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","support":[{"end":230,"quote":"The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","source_id":"quickgo.go_0022402","source_sha256":"16af245d3b83164fc2799db60ffbebba50761fb3073ff76d3f71ec697f78e80a","start":117}],"target_id":"concept.go.go0022402","target_kind":"node","target_sha256":"57b839215f13993b600c2879c93467d9209f986fc839234a19d1ae2941abc93a"}],"concept.go.go0022403":[{"id":"assertion.concept.go.go0022403","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell cycle phase as defined in the captured Gene Ontology term GO:0022403","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle phase as: One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","support":[{"end":286,"quote":"One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","source_id":"quickgo.go_0022403","source_sha256":"3533721a51cfebb45adff4b46172e55069d43240f1be4c7e9c7b59d0f112c472","start":115}],"target_id":"concept.go.go0022403","target_kind":"node","target_sha256":"4d3f55d555f230020b28adbf6154e7ccae84358c314524e0dfefa79a6f0c6db2"}],"concept.go.go0022404":[{"id":"assertion.concept.go.go0022404","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"molting cycle process as defined in the captured Gene Ontology term GO:0022404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle process as: A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","support":[{"end":270,"quote":"A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","source_id":"quickgo.go_0022404","source_sha256":"595300bed6828a8785fc2bfdfa5ac939118874dda7ea977601d2a40fa4ea81ed","start":120}],"target_id":"concept.go.go0022404","target_kind":"node","target_sha256":"dbd572b3e9efda9bb91c7e9637fc90ae48aa4d5c494830d023827fb7718f8182"}],"concept.go.go0022406":[{"id":"assertion.concept.go.go0022406","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"membrane docking as defined in the captured Gene Ontology term GO:0022406","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane docking as: The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","support":[{"end":266,"quote":"The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","source_id":"quickgo.go_0022406","source_sha256":"4050a7152961cbb7116b5ecd6c83e19bc0ef3e83fbd69ed9d5521900709dc2aa","start":115}],"target_id":"concept.go.go0022406","target_kind":"node","target_sha256":"bc15d770f965ebc29e8fa29746f22b0ab07b8988e9db0bf6a396c1bad36a1d31"}],"concept.go.go0022412":[{"id":"assertion.concept.go.go0022412","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular process involved in reproduction in multicellular organism as defined in the captured Gene Ontology term GO:0022412","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process involved in reproduction in multicellular organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","support":[{"end":284,"quote":"A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","source_id":"quickgo.go_0022412","source_sha256":"3f9cf7d4b47a8a6614e6f391365ad545c6b48747dd0233836a3eef2efee53658","start":166}],"target_id":"concept.go.go0022412","target_kind":"node","target_sha256":"d4b5f85f9d12ab24857c9c0c525102ab3042c1a7a9c0f1b7f935f9af801c5739"}],"concept.go.go0022413":[{"id":"assertion.concept.go.go0022413","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive process in single-celled organism as defined in the captured Gene Ontology term GO:0022413","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process in single-celled organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","support":[{"end":263,"quote":"A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","source_id":"quickgo.go_0022413","source_sha256":"0879aac3c6529291a39d47609315d02d826e5f1fd664739702a1b5f5c79e9399","start":145}],"target_id":"concept.go.go0022413","target_kind":"node","target_sha256":"e02c32c0bcf8e07448733fcaabd0cacd1334b588010a5f468effdfc6bdefc2c7"}],"concept.go.go0022414":[{"id":"assertion.concept.go.go0022414","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive process as defined in the captured Gene Ontology term GO:0022414","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process as: A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","support":[{"end":332,"quote":"A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","source_id":"quickgo.go_0022414","source_sha256":"8354396a535d60d65598d8a148c5b9281d990b3092f8a2b2e37c0131daab21d9","start":119}],"target_id":"concept.go.go0022414","target_kind":"node","target_sha256":"8edc2b002cec7d67d437f16489d07765547010914f8de53e1d1403e4745f5896"}],"concept.go.go0022601":[{"id":"assertion.concept.go.go0022601","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"menstrual cycle phase as defined in the captured Gene Ontology term GO:0022601","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines menstrual cycle phase as: The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","support":[{"end":380,"quote":"The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","source_id":"quickgo.go_0022601","source_sha256":"736080f609cb67033512c9c66d3f1a31beb92c59051def06c31a448834e71ca3","start":120}],"target_id":"concept.go.go0022601","target_kind":"node","target_sha256":"55d4b454240ec0de34cc1e6809c01f0fddd2f6adf7395384f59872c9f55abc58"}],"concept.go.go0022602":[{"id":"assertion.concept.go.go0022602","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ovulation cycle process as defined in the captured Gene Ontology term GO:0022602","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle process as: A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","support":[{"end":290,"quote":"A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","source_id":"quickgo.go_0022602","source_sha256":"89d43a82bbb51502a90114935fb0fe60a4bc76caa6d00b00644d23f47b11e834","start":122}],"target_id":"concept.go.go0022602","target_kind":"node","target_sha256":"0d73391b63a37dee0d4a904c3ea666060e5a2fa77b7d76c96dd6c6e340af2033"}],"concept.go.go0022608":[{"id":"assertion.concept.go.go0022608","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism adhesion as defined in the captured Gene Ontology term GO:0022608","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism adhesion as: The attachment of a multicellular organism to a substrate or other organism.","support":[{"end":206,"quote":"The attachment of a multicellular organism to a substrate or other organism.","source_id":"quickgo.go_0022608","source_sha256":"b37c50a642526730a35ba865c7bd06f484b5206b48b72d69d6fa0bdcacc5ee3b","start":130}],"target_id":"concept.go.go0022608","target_kind":"node","target_sha256":"d22ced37f0234b47a4e7dfddd0e0dc8c0e860f3e959801f08ed060e263a79a5f"}],"concept.go.go0022611":[{"id":"assertion.concept.go.go0022611","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dormancy process as defined in the captured Gene Ontology term GO:0022611","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dormancy process as: A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","support":[{"end":317,"quote":"A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","source_id":"quickgo.go_0022611","source_sha256":"638c677e0072dc1505a08bfe7e1910f5abf04583343f72e336294c0db692060e","start":115}],"target_id":"concept.go.go0022611","target_kind":"node","target_sha256":"706bb5851cabd99768f4e302e1319efc041f2b83491875a5fce00707c40acfe9"}],"concept.go.go0030017":[{"id":"assertion.concept.go.go0030017","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sarcomere as defined in the captured Gene Ontology term GO:0030017","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sarcomere as: The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","support":[{"end":250,"quote":"The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","source_id":"quickgo.go_0030017","source_sha256":"2a4288a49f408185eaddb81635df029f5e2f909ccb7c967bb027ce9bef29763e","start":108}],"target_id":"concept.go.go0030017","target_kind":"node","target_sha256":"a1f4c23bdc698cb77d1023fca5903863ba93a6dc5cabe7d97c8b181be2c70be0"}],"concept.go.go0030029":[{"id":"assertion.concept.go.go0030029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin filament-based process as defined in the captured Gene Ontology term GO:0030029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament-based process as: Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","support":[{"end":287,"quote":"Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","source_id":"quickgo.go_0030029","source_sha256":"a64648f83e5ea21c56e17a02ce26c0c5b89fe364c9b30594e978acd51a4745c7","start":127}],"target_id":"concept.go.go0030029","target_kind":"node","target_sha256":"e80eabbcf09afc27e4581c6469db73e43751e14a906b80ab376dbfb50390a8cd"}],"concept.go.go0030061":[{"id":"assertion.concept.go.go0030061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial crista as defined in the captured Gene Ontology term GO:0030061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial crista as: Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","support":[{"end":517,"quote":"Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","source_id":"quickgo.go_0030061","source_sha256":"15ad0cb2118814529b672212d7cf29b8f333e24f8420eb7d077e283d5a309918","start":119}],"target_id":"concept.go.go0030061","target_kind":"node","target_sha256":"5c89e7551ed6af855766e8180196d231586b5c25554f68ceb12b36ee4b962007"}],"concept.go.go0030315":[{"id":"assertion.concept.go.go0030315","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"T-tubule as defined in the captured Gene Ontology term GO:0030315","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines T-tubule as: Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","support":[{"end":301,"quote":"Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","source_id":"quickgo.go_0030315","source_sha256":"652acd5316ca10721add1aff5170d22e5e583c38018f687ddd37665c0e80545f","start":107}],"target_id":"concept.go.go0030315","target_kind":"node","target_sha256":"79cb71432d7bb632bd0cab79cc906c2a386950a1f0f5fcd3bf3249dc7e03e3e1"}],"concept.go.go0030427":[{"id":"assertion.concept.go.go0030427","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"site of polarized growth as defined in the captured Gene Ontology term GO:0030427","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines site of polarized growth as: Any part of a cell where non-isotropic growth takes place.","support":[{"end":181,"quote":"Any part of a cell where non-isotropic growth takes place.","source_id":"quickgo.go_0030427","source_sha256":"159b5413b79f7c85f45c69316e7a3cf6283e3c3ed345fe0f1df14af2d21a789a","start":123}],"target_id":"concept.go.go0030427","target_kind":"node","target_sha256":"60a834c9b0689c4d25d3dbe8f806948c773b7f70d7cafaccd8bc8b80c5346949"}],"concept.go.go0030431":[{"id":"assertion.concept.go.go0030431","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sleep as defined in the captured Gene Ontology term GO:0030431","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sleep as: Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","support":[{"end":393,"quote":"Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","source_id":"quickgo.go_0030431","source_sha256":"860d17fdcb7d8cad48db5eb8ae2b017254e1d88c794402f0577fffac36a399a6","start":104}],"target_id":"concept.go.go0030431","target_kind":"node","target_sha256":"4fc83f5108856132994e6a677f23664b5bdba094df803a097908b99e04ecdeb0"}],"concept.go.go0030447":[{"id":"assertion.concept.go.go0030447","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"filamentous growth as defined in the captured Gene Ontology term GO:0030447","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines filamentous growth as: The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","support":[{"end":263,"quote":"The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","source_id":"quickgo.go_0030447","source_sha256":"88a93aaa5f0606e21b5cdb141c95e7312c48ed320fd89b5fba94e1c8f61ebc0d","start":117}],"target_id":"concept.go.go0030447","target_kind":"node","target_sha256":"c02a6a0ebc9d5c96e313547f4b1270b3e8157e57a36cde0e04bbea67ed432cbb"}],"concept.go.go0030583":[{"id":"assertion.concept.go.go0030583","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myxococcal fruiting body development as defined in the captured Gene Ontology term GO:0030583","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myxococcal fruiting body development as: The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","support":[{"end":425,"quote":"The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","source_id":"quickgo.go_0030583","source_sha256":"8570f11b4ca28b746e308118d80ea57a2c070a55da95b3375ca7cfea7fbe3a39","start":135}],"target_id":"concept.go.go0030583","target_kind":"node","target_sha256":"b80f83d5b1e7f772f6158f685ea53491b982651c339fea978a759eb01dc262c1"}],"concept.go.go0030588":[{"id":"assertion.concept.go.go0030588","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pseudocleavage as defined in the captured Gene Ontology term GO:0030588","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pseudocleavage as: Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","support":[{"end":245,"quote":"Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","source_id":"quickgo.go_0030588","source_sha256":"d97e3b5b52ecf4280f05989ce1b516728784503056b62eac89d729e483bcac6e","start":113}],"target_id":"concept.go.go0030588","target_kind":"node","target_sha256":"61ef16a7d58a5702009fb005fd9599b3443aaf4e0997e7fd811bc266922ea70d"}],"concept.go.go0031128":[{"id":"assertion.concept.go.go0031128","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental induction as defined in the captured Gene Ontology term GO:0031128","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental induction as: A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","support":[{"end":300,"quote":"A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","source_id":"quickgo.go_0031128","source_sha256":"e4ce3efcdb04a922b600f652a059be51bc52b1b030a91a05d6394cbfc6ef0249","start":122}],"target_id":"concept.go.go0031128","target_kind":"node","target_sha256":"1e519fdbb7634dc9d82557c8aef35be983c28941f436b084b3c3dd1ec3af4143"}],"concept.go.go0031256":[{"id":"assertion.concept.go.go0031256","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leading edge membrane as defined in the captured Gene Ontology term GO:0031256","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leading edge membrane as: The portion of the plasma membrane surrounding the leading edge of a motile cell.","support":[{"end":201,"quote":"The portion of the plasma membrane surrounding the leading edge of a motile cell.","source_id":"quickgo.go_0031256","source_sha256":"b69fd9c88d1cacd44f684addc73f1a4edc001e5dab233663b5d36fdc09ef1423","start":120}],"target_id":"concept.go.go0031256","target_kind":"node","target_sha256":"b82dc8948fd8ddae4a6642c44ed22dd6a85029e7ba2d263f194656dd980051e8"}],"concept.go.go0031257":[{"id":"assertion.concept.go.go0031257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell trailing edge membrane as defined in the captured Gene Ontology term GO:0031257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell trailing edge membrane as: The portion of the plasma membrane surrounding the trailing edge of a motile cell.","support":[{"end":208,"quote":"The portion of the plasma membrane surrounding the trailing edge of a motile cell.","source_id":"quickgo.go_0031257","source_sha256":"1330ad13f8ab2863e71e106ded8de9ebf7b116dd2ef09adfee7a41e2ea848ef0","start":126}],"target_id":"concept.go.go0031257","target_kind":"node","target_sha256":"3a34a0d3151adc4db6d6526ff66085a05df08ff618db1cd4a5805c27150b2493"}],"concept.go.go0031294":[{"id":"assertion.concept.go.go0031294","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lymphocyte costimulation as defined in the captured Gene Ontology term GO:0031294","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lymphocyte costimulation as: The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","support":[{"end":321,"quote":"The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","source_id":"quickgo.go_0031294","source_sha256":"2eca28d986921c353935df8450d9a26d2ff5ac4ec1c81ab3c500364c7aa105f4","start":123}],"target_id":"concept.go.go0031294","target_kind":"node","target_sha256":"369e3a15f6dd60f85e0ae8f879c51f4f999471c90bf0a42837ab76e6e8197cf4"}],"concept.go.go0031424":[{"id":"assertion.concept.go.go0031424","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"keratinization as defined in the captured Gene Ontology term GO:0031424","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines keratinization as: The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","support":[{"end":317,"quote":"The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","source_id":"quickgo.go_0031424","source_sha256":"5b157d1ba7796738a39d094bdeb956c92158eef384487b7c29849c292a55df4d","start":113}],"target_id":"concept.go.go0031424","target_kind":"node","target_sha256":"891718b0766e499269f067f235efa41a8190f15fe869d82151e7f9e20ec199fb"}],"concept.go.go0031430":[{"id":"assertion.concept.go.go0031430","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"M band as defined in the captured Gene Ontology term GO:0031430","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines M band as: The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","support":[{"end":294,"quote":"The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","source_id":"quickgo.go_0031430","source_sha256":"732f566be73d9f083ba26ed43072e76f9be435702c3bcc22a2813ee963146650","start":105}],"target_id":"concept.go.go0031430","target_kind":"node","target_sha256":"0f095915024051ffe3b0c121fbfd75d2b5b633d7dc8d3d0206e4e529cc8a2e1e"}],"concept.go.go0031672":[{"id":"assertion.concept.go.go0031672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"A band as defined in the captured Gene Ontology term GO:0031672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines A band as: The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","support":[{"end":270,"quote":"The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","source_id":"quickgo.go_0031672","source_sha256":"458138e9571dc395cab34ff2353023f82423f19f71fb66940bda276cedb432bb","start":105}],"target_id":"concept.go.go0031672","target_kind":"node","target_sha256":"71947d29ade2da4c4a4dc63d2c33fbb3d6dc1154b615150d57096796e6551166"}],"concept.go.go0031673":[{"id":"assertion.concept.go.go0031673","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"H zone as defined in the captured Gene Ontology term GO:0031673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines H zone as: A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","support":[{"end":324,"quote":"A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","source_id":"quickgo.go_0031673","source_sha256":"0ffafc0dd2a54b79b757ae056488d5b928e8374c0b7b5465a69e7ced67e486e6","start":105}],"target_id":"concept.go.go0031673","target_kind":"node","target_sha256":"9ce00fc599c7012c67b0630d229b566e49ec142f549871874bcae894515d5983"}],"concept.go.go0031674":[{"id":"assertion.concept.go.go0031674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"I band as defined in the captured Gene Ontology term GO:0031674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines I band as: A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","support":[{"end":397,"quote":"A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","source_id":"quickgo.go_0031674","source_sha256":"32d0849a814f4781ff68eceee29397ea0c0de61aa3c05f4cca88ea3e0347e9b9","start":105}],"target_id":"concept.go.go0031674","target_kind":"node","target_sha256":"61983f9fedec27d7210ad62b50571b23213ece99385fdf049a3388921d0dbabf"}],"concept.go.go0031987":[{"id":"assertion.concept.go.go0031987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"locomotion involved in locomotory behavior as defined in the captured Gene Ontology term GO:0031987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion involved in locomotory behavior as: Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","support":[{"end":302,"quote":"Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","source_id":"quickgo.go_0031987","source_sha256":"4162d006845f1efbe89f520f1e25d57d3543cd3676f3f40b650ac6ff21ab15f4","start":141}],"target_id":"concept.go.go0031987","target_kind":"node","target_sha256":"77159784f65862929809e97db17924144180419257551fbcaadfe0140004641f"}],"concept.go.go0032153":[{"id":"assertion.concept.go.go0032153","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell division site as defined in the captured Gene Ontology term GO:0032153","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division site as: The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","support":[{"end":577,"quote":"The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","source_id":"quickgo.go_0032153","source_sha256":"85450ebf677ec6d27b418081908a092fcaf21246c104dfa20e9f9cb0386e90f5","start":117}],"target_id":"concept.go.go0032153","target_kind":"node","target_sha256":"e04f2de446b7463b98f04d580f5bf16cb6b60a8d27dc37b10d6165c8580f6771"}],"concept.go.go0032178":[{"id":"assertion.concept.go.go0032178","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"medial membrane band as defined in the captured Gene Ontology term GO:0032178","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines medial membrane band as: A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","support":[{"end":299,"quote":"A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","source_id":"quickgo.go_0032178","source_sha256":"f69fcef35a64df1f1e7e67abff1a8b0b49d91fa69e6aa0ce0e2d0354484b9aec","start":119}],"target_id":"concept.go.go0032178","target_kind":"node","target_sha256":"ca4d67cda06373c3b73961f7f978f9c6cce2adb4adcf16c6d45c8776960dce16"}],"concept.go.go0032179":[{"id":"assertion.concept.go.go0032179","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"germ tube as defined in the captured Gene Ontology term GO:0032179","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines germ tube as: The slender tubular outgrowth first produced by most spores in germination.","support":[{"end":183,"quote":"The slender tubular outgrowth first produced by most spores in germination.","source_id":"quickgo.go_0032179","source_sha256":"af05fad39a13e71ccd36af87736bc49d2bed0757ec9f608547b2a15ad56c2532","start":108}],"target_id":"concept.go.go0032179","target_kind":"node","target_sha256":"81ccb15c60923e3cda51118ea511aa7a71e369ad0926b9d1f5d9332e2eda7c5d"}],"concept.go.go0032501":[{"id":"assertion.concept.go.go0032501","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal process as defined in the captured Gene Ontology term GO:0032501","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal process as: Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","support":[{"end":233,"quote":"Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","source_id":"quickgo.go_0032501","source_sha256":"d065a406966e25e5a52eac43462bf605ef36b25f7a8d6a93f66b745248a29677","start":131}],"target_id":"concept.go.go0032501","target_kind":"node","target_sha256":"f70ea5ea5b9f76efc479f6a7ab5f1554acdb25c0e2d77dba63a4d89680069e1a"}],"concept.go.go0032502":[{"id":"assertion.concept.go.go0032502","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental process as defined in the captured Gene Ontology term GO:0032502","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process as: A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","support":[{"end":370,"quote":"A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","source_id":"quickgo.go_0032502","source_sha256":"1b82569be25d3908d975524cf196a64796d1c0de16008ad48fc705ca64c62b78","start":120}],"target_id":"concept.go.go0032502","target_kind":"node","target_sha256":"448ac521034021004c2fa7b1863eb3664c4e848e0889239be681399b592fdf85"}],"concept.go.go0032898":[{"id":"assertion.concept.go.go0032898","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"neurotrophin production as defined in the captured Gene Ontology term GO:0032898","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines neurotrophin production as: The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","support":[{"end":407,"quote":"The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","source_id":"quickgo.go_0032898","source_sha256":"fefe3aae5b64d0d7f5d70ee86e198349cc3cfc1cdab08bdddc7bc7039e2d6d90","start":122}],"target_id":"concept.go.go0032898","target_kind":"node","target_sha256":"dfd9407e3385084c3538c561af4b412a3d9d7b5c2626114c2dbe1edc9b68499b"}],"concept.go.go0032991":[{"id":"assertion.concept.go.go0032991","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein-containing complex as defined in the captured Gene Ontology term GO:0032991","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein-containing complex as: A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","support":[{"end":318,"quote":"A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","source_id":"quickgo.go_0032991","source_sha256":"9b847228d0ab1b6ed860d8732ce2db86df19147057b4bb63a04fdc6dc344667d","start":125}],"target_id":"concept.go.go0032991","target_kind":"node","target_sha256":"33f543452b99fdd4051f3944d76bbfcdbf943fd170e51d010b6a013f2b3ba1e6"}],"concept.go.go0033036":[{"id":"assertion.concept.go.go0033036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"macromolecule localization as defined in the captured Gene Ontology term GO:0033036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines macromolecule localization as: Any process in which a macromolecule is transported to, or maintained in, a specific location.","support":[{"end":219,"quote":"Any process in which a macromolecule is transported to, or maintained in, a specific location.","source_id":"quickgo.go_0033036","source_sha256":"0c562833c65fd1d8786e6a6d8f82b6feb9ec870c7c324d797084f95d5b6b6d31","start":125}],"target_id":"concept.go.go0033036","target_kind":"node","target_sha256":"ad3712a66fecc2c6359a7427c492e7caa1cde6071df46fe099c72d30538f7cd0"}],"concept.go.go0033058":[{"id":"assertion.concept.go.go0033058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"directional locomotion as defined in the captured Gene Ontology term GO:0033058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines directional locomotion as: Self-propelled movement of a cell or organism from one location to another along an axis.","support":[{"end":210,"quote":"Self-propelled movement of a cell or organism from one location to another along an axis.","source_id":"quickgo.go_0033058","source_sha256":"2ac810d0dfb2eaae3bb3e9ffd35f8d6ed9e4ed7dc9fbeec3cb7b8aa9f195b9c2","start":121}],"target_id":"concept.go.go0033058","target_kind":"node","target_sha256":"d0b6dd7cff7a99124748d219c98724728eec6e990cc218b4981ff3bdd9bfa80e"}],"concept.go.go0033059":[{"id":"assertion.concept.go.go0033059","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular pigmentation as defined in the captured Gene Ontology term GO:0033059","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular pigmentation as: The deposition or aggregation of coloring matter in a cell.","support":[{"end":179,"quote":"The deposition or aggregation of coloring matter in a cell.","source_id":"quickgo.go_0033059","source_sha256":"7b49565f53fa2f48e9d3d625047a047bb33b954cbaa0796ff55f66ae9f87d8b1","start":120}],"target_id":"concept.go.go0033059","target_kind":"node","target_sha256":"041ef11a8337a54a1621dd132fc604b39bc5ae04eb273fc8d5d83e09b136304d"}],"concept.go.go0033060":[{"id":"assertion.concept.go.go0033060","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ocellus pigmentation as defined in the captured Gene Ontology term GO:0033060","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ocellus pigmentation as: The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","support":[{"end":231,"quote":"The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","source_id":"quickgo.go_0033060","source_sha256":"b74e9df6cce4299218eb853b83dfbe9647b10c6f5dfaaf12d99cefd1ecd83355","start":119}],"target_id":"concept.go.go0033060","target_kind":"node","target_sha256":"18bb1fb0e12894dbf88f955f56f5be22049f25c63ecc2145b33f75bfaa0ea60b"}],"concept.go.go0033774":[{"id":"assertion.concept.go.go0033774","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"basal labyrinth as defined in the captured Gene Ontology term GO:0033774","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines basal labyrinth as: A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","support":[{"end":271,"quote":"A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","source_id":"quickgo.go_0033774","source_sha256":"83c9ae02c9b38739d40b7cf41ca13941f1c689fbbf6b8e908b91fda8d0275b4d","start":114}],"target_id":"concept.go.go0033774","target_kind":"node","target_sha256":"8a2bfe50102fca88fd933371711c106c92de98a5b837a905b29ebd004fcdb097"}],"concept.go.go0034337":[{"id":"assertion.concept.go.go0034337","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"RNA folding as defined in the captured Gene Ontology term GO:0034337","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines RNA folding as: The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","support":[{"end":241,"quote":"The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","source_id":"quickgo.go_0034337","source_sha256":"1796163907838c57cde9143c1856bb37dab52af4b69cd132b7fdda66e33890d7","start":110}],"target_id":"concept.go.go0034337","target_kind":"node","target_sha256":"489d0490000be96970ac7105ada547784c19dcabb9295134c726d0f19e421cfd"}],"concept.go.go0034381":[{"id":"assertion.concept.go.go0034381","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasma lipoprotein particle clearance as defined in the captured Gene Ontology term GO:0034381","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle clearance as: The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","support":[{"end":275,"quote":"The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","source_id":"quickgo.go_0034381","source_sha256":"64aa7c738387332c2a43d17563829e4b663e5b9c1b710579d8027a0f05748d23","start":136}],"target_id":"concept.go.go0034381","target_kind":"node","target_sha256":"01d42178c58cb7c91aa33c21b0bf010a818ec5f836667d8384e8a5cc14019399"}],"concept.go.go0035073":[{"id":"assertion.concept.go.go0035073","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pupariation as defined in the captured Gene Ontology term GO:0035073","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupariation as: The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","support":[{"end":317,"quote":"The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","source_id":"quickgo.go_0035073","source_sha256":"39a577398194ec2b779b4bd407327909af72a223c530f604262128e772d97b29","start":110}],"target_id":"concept.go.go0035073","target_kind":"node","target_sha256":"cb20741a9b7cd8e0cd8a9b621a675258dbbdd68ad23cec3936cb9865f232845f"}],"concept.go.go0035074":[{"id":"assertion.concept.go.go0035074","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pupation as defined in the captured Gene Ontology term GO:0035074","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupation as: The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","support":[{"end":297,"quote":"The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","source_id":"quickgo.go_0035074","source_sha256":"8db26ddc996f0cbf64b763a710db3ab9054d20b540ca8e54c835bbd2068126fd","start":107}],"target_id":"concept.go.go0035074","target_kind":"node","target_sha256":"dd96e51d338a1e9701c77555fbe8305c32d2074dccb0b65f49ee5490962447ff"}],"concept.go.go0035172":[{"id":"assertion.concept.go.go0035172","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hemocyte proliferation as defined in the captured Gene Ontology term GO:0035172","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte proliferation as: The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","support":[{"end":442,"quote":"The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","source_id":"quickgo.go_0035172","source_sha256":"3afd6fbc8f3ef3de20a0b97d7765902b469c3094a97073a180a06136b61a7c8b","start":121}],"target_id":"concept.go.go0035172","target_kind":"node","target_sha256":"27f0e555ec94a4753b2deff96a0d2a778112455b0efe766dc7b6c3b8ec5139df"}],"concept.go.go0035212":[{"id":"assertion.concept.go.go0035212","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell competition in a multicellular organism as defined in the captured Gene Ontology term GO:0035212","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell competition in a multicellular organism as: Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","support":[{"end":309,"quote":"Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","source_id":"quickgo.go_0035212","source_sha256":"ffa7b1c96808e4ce233855bdb88f9202f4aac1cb7f279b9f966d2eb157607b05","start":143}],"target_id":"concept.go.go0035212","target_kind":"node","target_sha256":"b04c3502bb7ff6b34d8b418d61455960330032a0908c972bc17d6de2d5e6fa50"}],"concept.go.go0035264":[{"id":"assertion.concept.go.go0035264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organism growth as defined in the captured Gene Ontology term GO:0035264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism growth as: The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","support":[{"end":220,"quote":"The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","source_id":"quickgo.go_0035264","source_sha256":"577b8a260cb3945067a0536785635682d91e8db77f145a7387c994b0167c4e21","start":128}],"target_id":"concept.go.go0035264","target_kind":"node","target_sha256":"23bf0ffefb058906358f770c4377a896326f735e0d3c2ccd3040414a8a534a2b"}],"concept.go.go0035265":[{"id":"assertion.concept.go.go0035265","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organ growth as defined in the captured Gene Ontology term GO:0035265","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organ growth as: The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","support":[{"end":330,"quote":"The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","source_id":"quickgo.go_0035265","source_sha256":"bd3063e7b69eb90fbb86df388cbfe457145a7956a938f71492de8cfd7efa12ae","start":111}],"target_id":"concept.go.go0035265","target_kind":"node","target_sha256":"010ee688918c48dfacf7fb59a7f8cbe94c73994c2a95e00c2b88f37bd8ff8787"}],"concept.go.go0035314":[{"id":"assertion.concept.go.go0035314","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"scab formation as defined in the captured Gene Ontology term GO:0035314","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines scab formation as: Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","support":[{"end":308,"quote":"Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","source_id":"quickgo.go_0035314","source_sha256":"ce9e9455164d885be3d556ce298cac5aa630ea7ef8958daf71c0f5df8ff363c0","start":113}],"target_id":"concept.go.go0035314","target_kind":"node","target_sha256":"cbf30eecf448c59813c49531f703f62005ea0f42f8c49a3f169668f3267f9195"}],"concept.go.go0035686":[{"id":"assertion.concept.go.go0035686","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm fibrous sheath as defined in the captured Gene Ontology term GO:0035686","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm fibrous sheath as: A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","support":[{"end":493,"quote":"A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","source_id":"quickgo.go_0035686","source_sha256":"965563cf1f68c7c910cf7767b4e8e78cbd2ba57da41b4108661f8be803da9538","start":119}],"target_id":"concept.go.go0035686","target_kind":"node","target_sha256":"47a0270a7eda624a8a805685ab1e1f50876011ce7824fd2dcaaad4b1b29e3b16"}],"concept.go.go0035732":[{"id":"assertion.concept.go.go0035732","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nitric oxide storage as defined in the captured Gene Ontology term GO:0035732","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nitric oxide storage as: The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","support":[{"end":356,"quote":"The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","source_id":"quickgo.go_0035732","source_sha256":"97aa9116c4c7ece8d6dd0312656d542fef5fd05b3a9907b48294398116d7e7ba","start":119}],"target_id":"concept.go.go0035732","target_kind":"node","target_sha256":"94a05f9b9bea52623257b914e32bdb953bca3bf7f4a4a5cf24764ec43ad6c0fd"}],"concept.go.go0035749":[{"id":"assertion.concept.go.go0035749","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"myelin sheath adaxonal region as defined in the captured Gene Ontology term GO:0035749","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines myelin sheath adaxonal region as: The region of the myelin sheath nearest to the axon.","support":[{"end":180,"quote":"The region of the myelin sheath nearest to the axon.","source_id":"quickgo.go_0035749","source_sha256":"d54885ab719c47613ba88ef31e71810f9926267e1cd10e7dadba4b63d10a1a41","start":128}],"target_id":"concept.go.go0035749","target_kind":"node","target_sha256":"1d49434cd5d49ffc10e405dd6d6b0a83a7489ad950f2dc916569a0f7d9d45085"}],"concept.go.go0035821":[{"id":"assertion.concept.go.go0035821","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"modulation of process of another organism as defined in the captured Gene Ontology term GO:0035821","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines modulation of process of another organism as: A process in which an organism effects a change in a biological process in another organism.","support":[{"end":232,"quote":"A process in which an organism effects a change in a biological process in another organism.","source_id":"quickgo.go_0035821","source_sha256":"e3895bf1645221847999fa04b6125df7d45f37e8074095f90822a5fc934fefc6","start":140}],"target_id":"concept.go.go0035821","target_kind":"node","target_sha256":"7fc6d5c596592d5a65cf93bf680d803487de215f2f56f6b92568cc143be21c09"}],"concept.go.go0035889":[{"id":"assertion.concept.go.go0035889","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"otolith tethering as defined in the captured Gene Ontology term GO:0035889","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines otolith tethering as: The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","support":[{"end":205,"quote":"The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","source_id":"quickgo.go_0035889","source_sha256":"0a5ede1d25dbd58bac7ba80f3e027b210064a00d763fc288026d1e183cbb20c2","start":116}],"target_id":"concept.go.go0035889","target_kind":"node","target_sha256":"d6a8dd695f00a22547d579bdb946a11b93d431050e2d46160b31f0a56f95898e"}],"concept.go.go0036166":[{"id":"assertion.concept.go.go0036166","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phenotypic switching as defined in the captured Gene Ontology term GO:0036166","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines phenotypic switching as: A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","support":[{"end":618,"quote":"A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","source_id":"quickgo.go_0036166","source_sha256":"cdec9a058453c2a44af29b5e921893cbf842903a6d97147eaa6929833524a4b0","start":119}],"target_id":"concept.go.go0036166","target_kind":"node","target_sha256":"6c205657f9b6535582a35cbc6ada09df821b750c9c918ef0e951d64c61df9328"}],"concept.go.go0036268":[{"id":"assertion.concept.go.go0036268","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"swimming as defined in the captured Gene Ontology term GO:0036268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines swimming as: Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","support":[{"end":228,"quote":"Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","source_id":"quickgo.go_0036268","source_sha256":"5d50739c894aafbd1165e9acd7dbe7674292ec0ad4faf391ac955ddcc5d09405","start":107}],"target_id":"concept.go.go0036268","target_kind":"node","target_sha256":"8a56c687da97ec67dbdc41212642959fb4d37e7d21c91bdf602a9acdcb08fd76"}],"concept.go.go0036338":[{"id":"assertion.concept.go.go0036338","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral membrane as defined in the captured Gene Ontology term GO:0036338","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral membrane as: The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","support":[{"end":201,"quote":"The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","source_id":"quickgo.go_0036338","source_sha256":"6f344dd1965195bbeac7898a0f870427835182f2c1c88cfe758db7e7271d84a9","start":113}],"target_id":"concept.go.go0036338","target_kind":"node","target_sha256":"966ce8e7c44b0cca531b4f372333b2c693d4e34cbd58b1a213e1ff49e5ae1404"}],"concept.go.go0039624":[{"id":"assertion.concept.go.go0039624","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral outer capsid as defined in the captured Gene Ontology term GO:0039624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral outer capsid as: The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","support":[{"end":248,"quote":"The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","source_id":"quickgo.go_0039624","source_sha256":"4bc31e384d55441147aa0dbbda04a0afefe15d97a0cb8de5b1fab1ed5de8b443","start":117}],"target_id":"concept.go.go0039624","target_kind":"node","target_sha256":"bf3396fa2298ece26f7838ed6b9190a1392bb0863353e4836bec134ebba879de"}],"concept.go.go0039625":[{"id":"assertion.concept.go.go0039625","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral inner capsid as defined in the captured Gene Ontology term GO:0039625","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral inner capsid as: The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","support":[{"end":248,"quote":"The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","source_id":"quickgo.go_0039625","source_sha256":"7877813dea8bdcc48e620650f426452fa5034e19329e8f56295f788d24f5594c","start":117}],"target_id":"concept.go.go0039625","target_kind":"node","target_sha256":"7f3d01d72128033d84c803e702546bff803d2a4b17a61d24e04aee5e9c3c501b"}],"concept.go.go0039626":[{"id":"assertion.concept.go.go0039626","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral intermediate capsid as defined in the captured Gene Ontology term GO:0039626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral intermediate capsid as: The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","support":[{"end":242,"quote":"The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","source_id":"quickgo.go_0039626","source_sha256":"42c8334ea6889d846e504969e03b7a34ed0a7f6005172d2050baf9d1d106d3f2","start":124}],"target_id":"concept.go.go0039626","target_kind":"node","target_sha256":"13f1c87bf2f6f4236f94e7bb92efba67a30d86768c4eee2118be487dcc240fee"}],"concept.go.go0039642":[{"id":"assertion.concept.go.go0039642","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion nucleoid as defined in the captured Gene Ontology term GO:0039642","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion nucleoid as: The region of a virion in which the nucleic acid is confined.","support":[{"end":175,"quote":"The region of a virion in which the nucleic acid is confined.","source_id":"quickgo.go_0039642","source_sha256":"1aad3b2db8f859b4c09aaf6989952310f1166f50e3915a8a7a8e7858a6770812","start":114}],"target_id":"concept.go.go0039642","target_kind":"node","target_sha256":"aacf5e73f29553a964dbb3e3f591d277d0870c169b202aba8afb79e0abb0b667"}],"concept.go.go0039663":[{"id":"assertion.concept.go.go0039663","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"membrane fusion involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039663","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane fusion involved in viral entry into host cell as: Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","support":[{"end":313,"quote":"Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","source_id":"quickgo.go_0039663","source_sha256":"de0128a75a380babb7b2a0c60a9ae2c6c456c1b2dcac08b109fef1ba925db9d9","start":153}],"target_id":"concept.go.go0039663","target_kind":"node","target_sha256":"279758f4f09b3e8db459402d42535b6465bb7b9335c5cf3343c5396a440562ec"}],"concept.go.go0039664":[{"id":"assertion.concept.go.go0039664","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysis of host organelle involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039664","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysis of host organelle involved in viral entry into host cell as: The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","support":[{"end":439,"quote":"The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","source_id":"quickgo.go_0039664","source_sha256":"51ce6ce3e960e1823b252799dd757f8408f3a76f609751393436fb0912b2478d","start":161}],"target_id":"concept.go.go0039664","target_kind":"node","target_sha256":"fde59d81b83db7c7dbaa2ad57a85974239ec3e3ce549198f0e99dc91e00ede8e"}],"concept.go.go0039665":[{"id":"assertion.concept.go.go0039665","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"permeabilization of host organelle membrane involved in viral entry into host cell as defined in the captured Gene Ontology term GO:0039665","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines permeabilization of host organelle membrane involved in viral entry into host cell as: Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","support":[{"end":440,"quote":"Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","source_id":"quickgo.go_0039665","source_sha256":"c256b424581b0d1ae55c4483423ea43e4154e3f100fde7f08ecc78343974fa15","start":181}],"target_id":"concept.go.go0039665","target_kind":"node","target_sha256":"3f54f40a3cb7d31b4e6b9658406dd8b6925e24e14a76b11d5df6967c31179423"}],"concept.go.go0039674":[{"id":"assertion.concept.go.go0039674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"exit of virus from host cell nucleus as defined in the captured Gene Ontology term GO:0039674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines exit of virus from host cell nucleus as: The directed movement of the viral genome or a viral particle out of the host cell nucleus.","support":[{"end":226,"quote":"The directed movement of the viral genome or a viral particle out of the host cell nucleus.","source_id":"quickgo.go_0039674","source_sha256":"e6af6e197afe070b2fed5bf1ce60f60cb8630cc02a7304b940f178398c3cd226","start":135}],"target_id":"concept.go.go0039674","target_kind":"node","target_sha256":"5c8feee36fd8c997d495b9f3298eadc14f4939410b9c5dae83a82cbe0f569262"}],"concept.go.go0039678":[{"id":"assertion.concept.go.go0039678","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"symbiont genome ejection through host cell envelope as defined in the captured Gene Ontology term GO:0039678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines symbiont genome ejection through host cell envelope as: Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","support":[{"end":490,"quote":"Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","source_id":"quickgo.go_0039678","source_sha256":"a8c1840fde778631683e7088b85beed9198bc84e153ecf566635343d01ffb1e9","start":150}],"target_id":"concept.go.go0039678","target_kind":"node","target_sha256":"a63ee2f5d0f32ccf2d5bb23653b5f304b633f7eb742cc29d99bd14bb39e2d983"}],"concept.go.go0039700":[{"id":"assertion.concept.go.go0039700","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"fusion of viral membrane with host outer nuclear membrane as defined in the captured Gene Ontology term GO:0039700","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines fusion of viral membrane with host outer nuclear membrane as: Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","support":[{"end":481,"quote":"Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","source_id":"quickgo.go_0039700","source_sha256":"02231b93f2edc2066f4ef7111a01d5fed019b9b64ee8592c1541a7fdc20f3062","start":156}],"target_id":"concept.go.go0039700","target_kind":"node","target_sha256":"56eb958b0d9ba9276e2b2c23f782fc5eb4828a4e23246b938361fa0cdbf055e2"}],"concept.go.go0040007":[{"id":"assertion.concept.go.go0040007","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"growth as defined in the captured Gene Ontology term GO:0040007","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines growth as: The increase in size or mass of an entire organism, a part of an organism or a cell.","support":[{"end":189,"quote":"The increase in size or mass of an entire organism, a part of an organism or a cell.","source_id":"quickgo.go_0040007","source_sha256":"1055bdec88503c4ff1d346e54248db8f181802335e9eaf84d0359c1c74b0b2bd","start":105}],"target_id":"concept.go.go0040007","target_kind":"node","target_sha256":"f5d5878c85cca8e6c084de373628040ac1558cc4779bf5d707b2c9722b41bcb5"}],"concept.go.go0040011":[{"id":"assertion.concept.go.go0040011","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"locomotion as defined in the captured Gene Ontology term GO:0040011","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion as: Self-propelled movement of a cell or organism from one location to another.","support":[{"end":184,"quote":"Self-propelled movement of a cell or organism from one location to another.","source_id":"quickgo.go_0040011","source_sha256":"38956be9dd63fd7788ab95b180e9e67c91902d7aaab86983fc4613a8be21f328","start":109}],"target_id":"concept.go.go0040011","target_kind":"node","target_sha256":"865fb16e30e5c1e3b188ad7d5111580ee04b71af30eb1b40262eb17d242729e7"}],"concept.go.go0042303":[{"id":"assertion.concept.go.go0042303","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"molting cycle as defined in the captured Gene Ontology term GO:0042303","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle as: The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","support":[{"end":220,"quote":"The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","source_id":"quickgo.go_0042303","source_sha256":"11d44d145ed23d0adb48bd3406b6370e381de1ba78af1e6c988c29f9706db54c","start":112}],"target_id":"concept.go.go0042303","target_kind":"node","target_sha256":"fe49adee98abe00547990cc622a6ec40a9389b03adec9b7e7594468329a6f8a6"}],"concept.go.go0042330":[{"id":"assertion.concept.go.go0042330","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"taxis as defined in the captured Gene Ontology term GO:0042330","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines taxis as: The directed movement of a motile cell or organism in response to an external stimulus.","support":[{"end":191,"quote":"The directed movement of a motile cell or organism in response to an external stimulus.","source_id":"quickgo.go_0042330","source_sha256":"4b1088eee93e56ec8fcf48ac49dd1a0ecf398f3aecfb52f1a623a0993c10897e","start":104}],"target_id":"concept.go.go0042330","target_kind":"node","target_sha256":"668ea301529c08e41c7d2d5e908e3d393f07d7606e3be62a84570e1595709147"}],"concept.go.go0042386":[{"id":"assertion.concept.go.go0042386","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hemocyte differentiation as defined in the captured Gene Ontology term GO:0042386","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte differentiation as: The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","support":[{"end":448,"quote":"The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","source_id":"quickgo.go_0042386","source_sha256":"516fbe6e1c7bed42f3c49c41c096cebd82a9ea04337bf3b3cc1be632f05d9926","start":123}],"target_id":"concept.go.go0042386","target_kind":"node","target_sha256":"82c1a8661e8cef7bca3e4ad57b9d66c50aadf3cb21500b05cac78c6b15b49d9c"}],"concept.go.go0042592":[{"id":"assertion.concept.go.go0042592","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"homeostatic process as defined in the captured Gene Ontology term GO:0042592","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines homeostatic process as: Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","support":[{"end":312,"quote":"Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","source_id":"quickgo.go_0042592","source_sha256":"81938e703ef7d857e1679838084f76bdba8aeca5a0b78c85f7638716e81eb176","start":118}],"target_id":"concept.go.go0042592","target_kind":"node","target_sha256":"761921a1a0ca01ce374794b74618aca6c93234ca7adcd78ef02b4204450241fd"}],"concept.go.go0042628":[{"id":"assertion.concept.go.go0042628","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mating plug formation as defined in the captured Gene Ontology term GO:0042628","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating plug formation as: The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","support":[{"end":316,"quote":"The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","source_id":"quickgo.go_0042628","source_sha256":"24bfa0857613736a9ee83cebbf0953ab6a285f336cbc3e3bad5766552ff71db3","start":120}],"target_id":"concept.go.go0042628","target_kind":"node","target_sha256":"c2f43c3c084d81349df2dedbd74fbc13a47ba379cc3b2e32c686281125ecf6ce"}],"concept.go.go0042641":[{"id":"assertion.concept.go.go0042641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actomyosin as defined in the captured Gene Ontology term GO:0042641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actomyosin as: Any complex of actin, myosin, and accessory proteins.","support":[{"end":162,"quote":"Any complex of actin, myosin, and accessory proteins.","source_id":"quickgo.go_0042641","source_sha256":"d41bd1882b78b09d940488e3730f264a5ac09e27decca48c534cf666ca440eae","start":109}],"target_id":"concept.go.go0042641","target_kind":"node","target_sha256":"f0282089ce2124226aec4ee727987b268909086ef2bf1ea2afad63f14d7e3b9d"}],"concept.go.go0042698":[{"id":"assertion.concept.go.go0042698","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ovulation cycle as defined in the captured Gene Ontology term GO:0042698","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle as: The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","support":[{"end":268,"quote":"The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","source_id":"quickgo.go_0042698","source_sha256":"25b53c5691597dc11bd24957e21e66b13c71d247d2a8351cb94742d36a074e4d","start":114}],"target_id":"concept.go.go0042698","target_kind":"node","target_sha256":"7a53c0572b5a630ff014ee555ddadf8ba70721c648f610c776226606a2522da0"}],"concept.go.go0042763":[{"id":"assertion.concept.go.go0042763","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intracellular immature spore as defined in the captured Gene Ontology term GO:0042763","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intracellular immature spore as: A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","support":[{"end":413,"quote":"A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","source_id":"quickgo.go_0042763","source_sha256":"1a79fd31182fd54a3baddbdb3b8d593b2fc92ce753892e8424eb9e0a9c2ca879","start":127}],"target_id":"concept.go.go0042763","target_kind":"node","target_sha256":"2ae06f84aec6f53b8c3419b3f788ba59d14a907f4fed0d5f4961a8ecede11d21"}],"concept.go.go0042995":[{"id":"assertion.concept.go.go0042995","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell projection as defined in the captured Gene Ontology term GO:0042995","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell projection as: A prolongation or process extending from a cell, e.g. a flagellum or axon.","support":[{"end":188,"quote":"A prolongation or process extending from a cell, e.g. a flagellum or axon.","source_id":"quickgo.go_0042995","source_sha256":"6007707cff42a4620b0e14e1a772ea03df3469f1131417aa598da565a9f2737a","start":114}],"target_id":"concept.go.go0042995","target_kind":"node","target_sha256":"18e763f69c58fb0469529a1ae0f74c93b0b40c03137df0dcc482809a0117cda6"}],"concept.go.go0043036":[{"id":"assertion.concept.go.go0043036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"starch grain as defined in the captured Gene Ontology term GO:0043036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines starch grain as: Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","support":[{"end":351,"quote":"Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","source_id":"quickgo.go_0043036","source_sha256":"15ffb96ce564a574f2d220f5ea65e0557d9fcdcfa63ff3e4297b6cd795636097","start":111}],"target_id":"concept.go.go0043036","target_kind":"node","target_sha256":"cc895bf69a12496e713bf46cbb94172cce4446c26215960dc8bc977355685fc7"}],"concept.go.go0043083":[{"id":"assertion.concept.go.go0043083","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptic cleft as defined in the captured Gene Ontology term GO:0043083","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic cleft as: The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","support":[{"end":227,"quote":"The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","source_id":"quickgo.go_0043083","source_sha256":"2928e7ddd8916fde65223b3a4b9d56eef234b4e505000566306ac55150cf6831","start":113}],"target_id":"concept.go.go0043083","target_kind":"node","target_sha256":"4f650fff9afcf63edd166e036a6898656b4957dc719be30c020fdc94ab492491"}],"concept.go.go0043203":[{"id":"assertion.concept.go.go0043203","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axon hillock as defined in the captured Gene Ontology term GO:0043203","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines axon hillock as: Portion of the neuronal cell soma from which the axon originates.","support":[{"end":176,"quote":"Portion of the neuronal cell soma from which the axon originates.","source_id":"quickgo.go_0043203","source_sha256":"1dc4ef7a59cb88c61f0bd13b344ec3ae26f2dfcc9f98885404ad75ebaa7d7e69","start":111}],"target_id":"concept.go.go0043203","target_kind":"node","target_sha256":"078be83c5042948c9c412c6449abeb5665efd53ee962427297ff7bcdf8c0297c"}],"concept.go.go0043204":[{"id":"assertion.concept.go.go0043204","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perikaryon as defined in the captured Gene Ontology term GO:0043204","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines perikaryon as: The portion of the cell soma (neuronal cell body) that excludes the nucleus.","support":[{"end":185,"quote":"The portion of the cell soma (neuronal cell body) that excludes the nucleus.","source_id":"quickgo.go_0043204","source_sha256":"12c0b03702eb49aede39f3c55fa81ecada03f0ec75697b0774f3f3823a9cf08e","start":109}],"target_id":"concept.go.go0043204","target_kind":"node","target_sha256":"7ded4d606013441722736c74adc314efc8f5d2bbf581af0cd7d7d78b9d68587d"}],"concept.go.go0043220":[{"id":"assertion.concept.go.go0043220","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"Schmidt-Lanterman incisure as defined in the captured Gene Ontology term GO:0043220","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines Schmidt-Lanterman incisure as: Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","support":[{"end":492,"quote":"Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","source_id":"quickgo.go_0043220","source_sha256":"65a50dda4a0a1058397544c5ac35d72c8912c61493afd796c02d22fca174e32b","start":125}],"target_id":"concept.go.go0043220","target_kind":"node","target_sha256":"ca73bb45b8fd64c77ded21311e6791e25298fe9ff075692421bb943d0d84f5d7"}],"concept.go.go0043226":[{"id":"assertion.concept.go.go0043226","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle as defined in the captured Gene Ontology term GO:0043226","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle as: Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","support":[{"end":364,"quote":"Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","source_id":"quickgo.go_0043226","source_sha256":"f3f37dba9b46174c75e79e32a721837308a534695ef9e2cb5e931b907f0f58d4","start":108}],"target_id":"concept.go.go0043226","target_kind":"node","target_sha256":"cb52a01c6fe71b810e424c44ebdea3ec6cdfcbe5d26136a604ad98788beca873"}],"concept.go.go0043335":[{"id":"assertion.concept.go.go0043335","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"protein unfolding as defined in the captured Gene Ontology term GO:0043335","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein unfolding as: The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","support":[{"end":288,"quote":"The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","source_id":"quickgo.go_0043335","source_sha256":"00b5c9f05041f503de4e9481b85d0296c767e50f1637d379eafbf91c4819e321","start":116}],"target_id":"concept.go.go0043335","target_kind":"node","target_sha256":"e669129f738eaf546f54f854cad7fb477af90203c8bfed77b4a245185c8ce389"}],"concept.go.go0043473":[{"id":"assertion.concept.go.go0043473","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigmentation as defined in the captured Gene Ontology term GO:0043473","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigmentation as: The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","support":[{"end":234,"quote":"The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","source_id":"quickgo.go_0043473","source_sha256":"1f4612bc319f483b330523bc797d9fe0964aa73d4ea4b5cd14eff47416bda396","start":111}],"target_id":"concept.go.go0043473","target_kind":"node","target_sha256":"3b214cf55db83309729c8b34f9a7b94245ff1ec4ac61ca55546970f1918b52be"}],"concept.go.go0043476":[{"id":"assertion.concept.go.go0043476","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigment accumulation as defined in the captured Gene Ontology term GO:0043476","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation as: The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","support":[{"end":259,"quote":"The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","source_id":"quickgo.go_0043476","source_sha256":"dbfb37142115ad4e8d083c9992fd0ae07e30423900973add141c5bccaeef0de8","start":119}],"target_id":"concept.go.go0043476","target_kind":"node","target_sha256":"1f6289f9f60f7be9b7fd0ddf11c5d1897107be9cd6985f9f2fc9ed14740b8d43"}],"concept.go.go0043480":[{"id":"assertion.concept.go.go0043480","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pigment accumulation in tissues as defined in the captured Gene Ontology term GO:0043480","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation in tissues as: The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","support":[{"end":249,"quote":"The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","source_id":"quickgo.go_0043480","source_sha256":"278fa6c933d6b69398c0ce88664580b1e0d4923cb5c103a5b68557e7f1633bdd","start":130}],"target_id":"concept.go.go0043480","target_kind":"node","target_sha256":"cd5ab3f97a4b9a346cce25eba0d6e34acff71cad6a4fbd3a85cb0e97ef04efeb"}],"concept.go.go0043500":[{"id":"assertion.concept.go.go0043500","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"muscle adaptation as defined in the captured Gene Ontology term GO:0043500","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle adaptation as: A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","support":[{"end":564,"quote":"A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","source_id":"quickgo.go_0043500","source_sha256":"ea79e28950beb597058b0924231d7d30cbf8cde134cefb4c13c109bbfa5109ab","start":116}],"target_id":"concept.go.go0043500","target_kind":"node","target_sha256":"5e4010b2bb086c45722b802e49870121b1fafbe8b3388de654a3fd693c79f52f"}],"concept.go.go0043670":[{"id":"assertion.concept.go.go0043670","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"foot layer as defined in the captured Gene Ontology term GO:0043670","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines foot layer as: The inner layer of the ectexine.","support":[{"end":141,"quote":"The inner layer of the ectexine.","source_id":"quickgo.go_0043670","source_sha256":"2e790bfea57c7c37e4d5e5050073789fa2d343559bbfe0a0df5843c88216aabe","start":109}],"target_id":"concept.go.go0043670","target_kind":"node","target_sha256":"27307ebdd764d6f2b5cf187d4a532f3bb78f94c57692fcc38bc8fe75f60a77f4"}],"concept.go.go0043671":[{"id":"assertion.concept.go.go0043671","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"endexine as defined in the captured Gene Ontology term GO:0043671","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines endexine as: The inner part of the exine, which stains.","support":[{"end":149,"quote":"The inner part of the exine, which stains.","source_id":"quickgo.go_0043671","source_sha256":"18314252e84ed863dd771ba397d998f2f6b1e6ac90b52fc8ef8d4749a185809e","start":107}],"target_id":"concept.go.go0043671","target_kind":"node","target_sha256":"37732160400ea3b92d5c39741c95c28f6b08e387540983e96d4818cf26940d24"}],"concept.go.go0043672":[{"id":"assertion.concept.go.go0043672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nexine as defined in the captured Gene Ontology term GO:0043672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nexine as: The inner, non-sculptured part of the exine which lies below the sexine.","support":[{"end":177,"quote":"The inner, non-sculptured part of the exine which lies below the sexine.","source_id":"quickgo.go_0043672","source_sha256":"91f9d3a4d7c228d52ba1d293bc582779e4d2cd174729b121005c82d7a5f6b031","start":105}],"target_id":"concept.go.go0043672","target_kind":"node","target_sha256":"2e9ecc920bc29722d7aa48ceb59bac564dc481c67e06df03deb85071a86f5b68"}],"concept.go.go0043696":[{"id":"assertion.concept.go.go0043696","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dedifferentiation as defined in the captured Gene Ontology term GO:0043696","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dedifferentiation as: The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","support":[{"end":434,"quote":"The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","source_id":"quickgo.go_0043696","source_sha256":"6946c65c8dca514211621043e7b07461bf67a311e1e44628390cb2f41dc9368e","start":116}],"target_id":"concept.go.go0043696","target_kind":"node","target_sha256":"9e26bfde981b72f5ef6c833231a6b71e8a90c40719d919851abaa4c653bbb0e1"}],"concept.go.go0043934":[{"id":"assertion.concept.go.go0043934","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sporulation as defined in the captured Gene Ontology term GO:0043934","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sporulation as: The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","support":[{"end":397,"quote":"The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","source_id":"quickgo.go_0043934","source_sha256":"6049fd624413746c6a83bb6c4427d714f39bfd700fab9a69be744a70ea92a5de","start":110}],"target_id":"concept.go.go0043934","target_kind":"node","target_sha256":"f6f9357cb4d33958d60b0f4f912a1f4072f21859894cb5954965f790056329c7"}],"concept.go.go0044010":[{"id":"assertion.concept.go.go0044010","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"single-species biofilm formation as defined in the captured Gene Ontology term GO:0044010","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-species biofilm formation as: A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","support":[{"end":434,"quote":"A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","source_id":"quickgo.go_0044010","source_sha256":"51abedd86391931e84b4ecf80ae8dfd7372df2b2281fc25c0d5997009f5fe849","start":131}],"target_id":"concept.go.go0044010","target_kind":"node","target_sha256":"f7b9a2a372466c7a887e6b2fa950db595ec91327d531357a60e792041edef870"}],"concept.go.go0044111":[{"id":"assertion.concept.go.go0044111","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"formation of structure involved in a symbiotic process as defined in the captured Gene Ontology term GO:0044111","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines formation of structure involved in a symbiotic process as: The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","support":[{"end":290,"quote":"The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","source_id":"quickgo.go_0044111","source_sha256":"56ae00f9ab947177e342d0da4dfc40d697d2c9981f2feceefbe04f8bc4301303","start":153}],"target_id":"concept.go.go0044111","target_kind":"node","target_sha256":"bdd5eaf7d3cce5a7b6189094e90df27f9ca8a086f0c495589b0d7be81c732a90"}],"concept.go.go0044232":[{"id":"assertion.concept.go.go0044232","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle membrane contact site as defined in the captured Gene Ontology term GO:0044232","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle membrane contact site as: A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","support":[{"end":546,"quote":"A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","source_id":"quickgo.go_0044232","source_sha256":"0e65f2024b10f01303127b34153c7eb296d97a94eca73564d837bd3b1b97cded","start":130}],"target_id":"concept.go.go0044232","target_kind":"node","target_sha256":"ac8a06b9f9c124f8f78ecd0fbbf57fad5407ae39f1884b0cb292d8de46e9e3cb"}],"concept.go.go0044403":[{"id":"assertion.concept.go.go0044403","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in symbiotic interaction as defined in the captured Gene Ontology term GO:0044403","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in symbiotic interaction as: A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","support":[{"end":1149,"quote":"A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","source_id":"quickgo.go_0044403","source_sha256":"8fe4290ea8152974eac457ebddb17762fca1342e5bd4a6243de2b13812aa85ba","start":151}],"target_id":"concept.go.go0044403","target_kind":"node","target_sha256":"33ea22d24249ad4ae648daf4060dac665509aebb4c0f61dc2e90a35708bc5a8b"}],"concept.go.go0044419":[{"id":"assertion.concept.go.go0044419","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in interspecies interaction between organisms as defined in the captured Gene Ontology term GO:0044419","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in interspecies interaction between organisms as: Any process evolved to enable an interaction with an organism of a different species.","support":[{"end":257,"quote":"Any process evolved to enable an interaction with an organism of a different species.","source_id":"quickgo.go_0044419","source_sha256":"caaa7131c55b1b92707c39250f60feefaaba158d94dfc9add6eac3f9dc1eaccb","start":172}],"target_id":"concept.go.go0044419","target_kind":"node","target_sha256":"a087d29129d0d203fb631bb040431cea520fecfb83c2aa86dd39a9ec00f6c0f4"}],"concept.go.go0044423":[{"id":"assertion.concept.go.go0044423","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion component as defined in the captured Gene Ontology term GO:0044423","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion component as: Any constituent part of a virion, a complete fully infectious extracellular virus particle.","support":[{"end":206,"quote":"Any constituent part of a virion, a complete fully infectious extracellular virus particle.","source_id":"quickgo.go_0044423","source_sha256":"fccd05e9c8f4dc9d2004cff636cc638d253f7fe7725c521ed7cbc9fa8a03b53b","start":115}],"target_id":"concept.go.go0044423","target_kind":"node","target_sha256":"e940147924a5700450e7109982783591b2f92820b5012365b11016cefa04aad2"}],"concept.go.go0044703":[{"id":"assertion.concept.go.go0044703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multi-organism reproductive process as defined in the captured Gene Ontology term GO:0044703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-organism reproductive process as: A biological process that directly contributes to the process of producing new individuals, involving another organism.","support":[{"end":253,"quote":"A biological process that directly contributes to the process of producing new individuals, involving another organism.","source_id":"quickgo.go_0044703","source_sha256":"bab436f05098a96c49ff4879f016accff8aa32aec283b1976599e7b043bf313b","start":134}],"target_id":"concept.go.go0044703","target_kind":"node","target_sha256":"ff5fd1bf35e48eed952d6248b699a01e52efb162560b6ff08cef2e72d95a0157"}],"concept.go.go0044706":[{"id":"assertion.concept.go.go0044706","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multi-multicellular organism process as defined in the captured Gene Ontology term GO:0044706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-multicellular organism process as: A multicellular organism process which involves another multicellular organism of the same or different species.","support":[{"end":247,"quote":"A multicellular organism process which involves another multicellular organism of the same or different species.","source_id":"quickgo.go_0044706","source_sha256":"985ed1585563c317059450944bad63ac86cf3f6d901d48a6a8647c73550e3259","start":135}],"target_id":"concept.go.go0044706","target_kind":"node","target_sha256":"0dc87f780bd87220306fa752e0bf28293fc593654a33a610142b3481ab632985"}],"concept.go.go0044826":[{"id":"assertion.concept.go.go0044826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome integration into host DNA as defined in the captured Gene Ontology term GO:0044826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome integration into host DNA as: The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","support":[{"end":426,"quote":"The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","source_id":"quickgo.go_0044826","source_sha256":"61a28e0e468721b2357d9b3a6ee715a36d88bc90361c0793913dd1b6d2b6d768","start":137}],"target_id":"concept.go.go0044826","target_kind":"node","target_sha256":"902e467b2583af5626a376caba74ab19be67713f716f69d9bdea8bdee2d02621"}],"concept.go.go0044848":[{"id":"assertion.concept.go.go0044848","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological phase as defined in the captured Gene Ontology term GO:0044848","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological phase as: A distinct period or stage in a biological process or cycle.","support":[{"end":175,"quote":"A distinct period or stage in a biological process or cycle.","source_id":"quickgo.go_0044848","source_sha256":"e99b0f41df15604031dd95bdf676d95c72ebaeb31f0ed6b9c3bae024dae3e7a2","start":115}],"target_id":"concept.go.go0044848","target_kind":"node","target_sha256":"2db11b8ead808983900d6677d44103d1df5121a7c82a6ba87724d874a2e00e74"}],"concept.go.go0044851":[{"id":"assertion.concept.go.go0044851","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hair cycle phase as defined in the captured Gene Ontology term GO:0044851","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hair cycle phase as: The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","support":[{"end":411,"quote":"The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","source_id":"quickgo.go_0044851","source_sha256":"0900721e388e48ca7365a0ebd51d981bf3641e097b8d2db44e19b4a92366d229","start":115}],"target_id":"concept.go.go0044851","target_kind":"node","target_sha256":"9bb53836da524b8db0128018e427678e453fbbedb210c6d7408f05ba6e63f33d"}],"concept.go.go0045056":[{"id":"assertion.concept.go.go0045056","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transcytosis as defined in the captured Gene Ontology term GO:0045056","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transcytosis as: The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","support":[{"end":239,"quote":"The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","source_id":"quickgo.go_0045056","source_sha256":"349c64eeefc59a0b2a2ecab1c3f45e220b231f35cb052168c61f39ab980d2020","start":111}],"target_id":"concept.go.go0045056","target_kind":"node","target_sha256":"d3e519e0ec7a470b8549a5f5e6aafbe3f5639a3f8d0838e98c535828d4dba82f"}],"concept.go.go0045058":[{"id":"assertion.concept.go.go0045058","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"T cell selection as defined in the captured Gene Ontology term GO:0045058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines T cell selection as: The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","support":[{"end":290,"quote":"The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","source_id":"quickgo.go_0045058","source_sha256":"8a86da2ab9312e0208da072acef43d99b99171b4ac78f7f92bad3329212bb8a9","start":115}],"target_id":"concept.go.go0045058","target_kind":"node","target_sha256":"6af61b40c105cd813df225c05b48035a5dd4508f9bbc0274a043f05bef7f9df5"}],"concept.go.go0045103":[{"id":"assertion.concept.go.go0045103","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intermediate filament-based process as defined in the captured Gene Ontology term GO:0045103","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intermediate filament-based process as: Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","support":[{"end":317,"quote":"Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","source_id":"quickgo.go_0045103","source_sha256":"62019d810d4cd532025e4977dc52d090c577c03d758e2597898e8e54d294f79e","start":134}],"target_id":"concept.go.go0045103","target_kind":"node","target_sha256":"227d9cf41c7cc6fa20c14d86fa225570d71fd367834ff9a75a471fc9cc669397"}],"concept.go.go0045171":[{"id":"assertion.concept.go.go0045171","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"intercellular bridge as defined in the captured Gene Ontology term GO:0045171","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines intercellular bridge as: A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","support":[{"end":452,"quote":"A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","source_id":"quickgo.go_0045171","source_sha256":"4314e57de486ac71fed9304d4504e713abfff2b1834271cb3b14ba1ffc7bddf6","start":119}],"target_id":"concept.go.go0045171","target_kind":"node","target_sha256":"b98645f196c68ee911e291aad61b114ac95c9de4cc915d834163c3f86d03b889"}],"concept.go.go0045321":[{"id":"assertion.concept.go.go0045321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte activation as defined in the captured Gene Ontology term GO:0045321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte activation as: A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","support":[{"end":271,"quote":"A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","source_id":"quickgo.go_0045321","source_sha256":"059b55b75ee8d1c760538996a7adef73254da5dc79a4385e373bf1bff2988b03","start":119}],"target_id":"concept.go.go0045321","target_kind":"node","target_sha256":"003109cd97ae2e4217a56aa9383c25de1f7fe8d0d51669c5ae964347b4a60067"}],"concept.go.go0045494":[{"id":"assertion.concept.go.go0045494","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"photoreceptor cell maintenance as defined in the captured Gene Ontology term GO:0045494","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor cell maintenance as: Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","support":[{"end":242,"quote":"Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","source_id":"quickgo.go_0045494","source_sha256":"4b22d298ae411cf4fc8449c04268d6442801bba0a1b1b5982cd5c9a375308540","start":129}],"target_id":"concept.go.go0045494","target_kind":"node","target_sha256":"78393e3148741e41b4d90a34ef1e101af20017648f0fdca2c02d73f495382624"}],"concept.go.go0046727":[{"id":"assertion.concept.go.go0046727","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"capsomere as defined in the captured Gene Ontology term GO:0046727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines capsomere as: Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","support":[{"end":203,"quote":"Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","source_id":"quickgo.go_0046727","source_sha256":"2d334c684e7d03a0571bb1ebb0e7f60b256098edad023a25e239d6551f27f5b0","start":108}],"target_id":"concept.go.go0046727","target_kind":"node","target_sha256":"044680338dfde052a7cb36560725d3069210f4731df50d03a755794b86d4e7db"}],"concept.go.go0046729":[{"id":"assertion.concept.go.go0046729","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral procapsid as defined in the captured Gene Ontology term GO:0046729","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral procapsid as: A stable empty viral capsid produced during the assembly of viruses.","support":[{"end":182,"quote":"A stable empty viral capsid produced during the assembly of viruses.","source_id":"quickgo.go_0046729","source_sha256":"71e580733df434d61eb73afcf00d9e7544ac9e971e0733337cccd7527c1f0a0e","start":114}],"target_id":"concept.go.go0046729","target_kind":"node","target_sha256":"af91d57b959848a11d0ffa8cbda1b1d2fad13398d71ec472473a2dcd68a53b60"}],"concept.go.go0046745":[{"id":"assertion.concept.go.go0046745","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid secondary envelopment as defined in the captured Gene Ontology term GO:0046745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid secondary envelopment as: The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","support":[{"end":252,"quote":"The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","source_id":"quickgo.go_0046745","source_sha256":"5984ccdd4d17615a4ac57c1690c03d208f77695219d82dc4597f35a5e6c8c76e","start":133}],"target_id":"concept.go.go0046745","target_kind":"node","target_sha256":"9dc931c0f523cc8c570d788e142c6e128fab38138384aec49f77b2474a1ab496"}],"concept.go.go0046755":[{"id":"assertion.concept.go.go0046755","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral budding as defined in the captured Gene Ontology term GO:0046755","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral budding as: A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","support":[{"end":595,"quote":"A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","source_id":"quickgo.go_0046755","source_sha256":"91ea57770672eae1450a916976ad3132ce9acd3aff6b2a342d706154b243ea44","start":112}],"target_id":"concept.go.go0046755","target_kind":"node","target_sha256":"99ad2942616258efdead28fc24ba4e2a6b31716e5ff61bd842d3d0c74536a7a3"}],"concept.go.go0046784":[{"id":"assertion.concept.go.go0046784","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral mRNA export from host cell nucleus as defined in the captured Gene Ontology term GO:0046784","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral mRNA export from host cell nucleus as: The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","support":[{"end":241,"quote":"The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","source_id":"quickgo.go_0046784","source_sha256":"47c106c59edb42af81464fb41a3904fa51a2f01f31b715cbd3d26ecfb28f91f2","start":139}],"target_id":"concept.go.go0046784","target_kind":"node","target_sha256":"c2eb945c1f7ed83c5e8bd501686dc3d7bca294a92c16005befc3712d14e69b07"}],"concept.go.go0046786":[{"id":"assertion.concept.go.go0046786","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral replication complex formation and maintenance as defined in the captured Gene Ontology term GO:0046786","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral replication complex formation and maintenance as: The process of organizing and assembling viral replication proteins in preparation for viral replication.","support":[{"end":255,"quote":"The process of organizing and assembling viral replication proteins in preparation for viral replication.","source_id":"quickgo.go_0046786","source_sha256":"e632bbdd9c27eb8da14f90e6e2230d561d75ef929214f0e7da67a5ba1cb0b42a","start":150}],"target_id":"concept.go.go0046786","target_kind":"node","target_sha256":"47359025dd3b584274c5487e36ffe83ec42ef19573583c49101c578765abd419"}],"concept.go.go0046794":[{"id":"assertion.concept.go.go0046794","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transport of virus as defined in the captured Gene Ontology term GO:0046794","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transport of virus as: The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","support":[{"end":207,"quote":"The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","source_id":"quickgo.go_0046794","source_sha256":"d2f27561a33597dd82c8d646f73957d8b7c7df92c80731c37c65a65bdd093cc9","start":117}],"target_id":"concept.go.go0046794","target_kind":"node","target_sha256":"aadb31d8404610dc37567021a87ee334ef48dc9713a325af89729e7e7ff35f3b"}],"concept.go.go0046807":[{"id":"assertion.concept.go.go0046807","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral scaffold assembly and maintenance as defined in the captured Gene Ontology term GO:0046807","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral scaffold assembly and maintenance as: The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","support":[{"end":234,"quote":"The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","source_id":"quickgo.go_0046807","source_sha256":"743e88d4685e0a9efe093adf34a280740cfd9b032f1edf6c01e3a862d2199c3b","start":138}],"target_id":"concept.go.go0046807","target_kind":"node","target_sha256":"1b77a29415ea29b9b5a3b09d7f199fc2bf641e81fec14e681a3c5ef09d6a6078"}],"concept.go.go0046818":[{"id":"assertion.concept.go.go0046818","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dense nuclear body as defined in the captured Gene Ontology term GO:0046818","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense nuclear body as: A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","support":[{"end":295,"quote":"A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","source_id":"quickgo.go_0046818","source_sha256":"23e1b2d0ec304fbc4ac1e7926e7c996eb66713a9df74449d1fa8bc371148055f","start":117}],"target_id":"concept.go.go0046818","target_kind":"node","target_sha256":"8eacd71403f0abb6c1aebbdab20783881de0f12f487b803a751a0098f30aa52c"}],"concept.go.go0048046":[{"id":"assertion.concept.go.go0048046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"apoplast as defined in the captured Gene Ontology term GO:0048046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines apoplast as: The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","support":[{"end":502,"quote":"The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","source_id":"quickgo.go_0048046","source_sha256":"8e0c5caf8efd6fe637b0c75dbaea4482698d8b80db5ed824c2951742279000cf","start":107}],"target_id":"concept.go.go0048046","target_kind":"node","target_sha256":"c5a4afa597b9b95f9f5bc21e359d8454876a1c27e3e19e5aec24dc63caec16c7"}],"concept.go.go0048066":[{"id":"assertion.concept.go.go0048066","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental pigmentation as defined in the captured Gene Ontology term GO:0048066","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental pigmentation as: The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","support":[{"end":232,"quote":"The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","source_id":"quickgo.go_0048066","source_sha256":"ea2a06c6f70324e1ffd15ad92d39de2f087d221546a2e67ad9bac6e68a139196","start":125}],"target_id":"concept.go.go0048066","target_kind":"node","target_sha256":"f48526c4e466d4e26d0ed0771dc0305e02795d42dad2d61c279f22c28ea8b534"}],"concept.go.go0048471":[{"id":"assertion.concept.go.go0048471","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"perinuclear region of cytoplasm as defined in the captured Gene Ontology term GO:0048471","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines perinuclear region of cytoplasm as: Cytoplasm situated near, or occurring around, the nucleus.","support":[{"end":188,"quote":"Cytoplasm situated near, or occurring around, the nucleus.","source_id":"quickgo.go_0048471","source_sha256":"fe4aab30375c0b84df8fb92ac42d0b569d8cb3031e01733cc15acfde3c3906c4","start":130}],"target_id":"concept.go.go0048471","target_kind":"node","target_sha256":"8082df25b5daa1c9d3c8a0c16b8f29e443412cf3ba4f0562a834edb904ddfd5f"}],"concept.go.go0048489":[{"id":"assertion.concept.go.go0048489","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptic vesicle transport as defined in the captured Gene Ontology term GO:0048489","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic vesicle transport as: The directed movement of synaptic vesicles.","support":[{"end":168,"quote":"The directed movement of synaptic vesicles.","source_id":"quickgo.go_0048489","source_sha256":"2b3ba9b1a7b0abe430f7882b867ac5e34e18b3bd3a8da31452a26cc053ff4734","start":125}],"target_id":"concept.go.go0048489","target_kind":"node","target_sha256":"094bf982fa8914313620501410c76282249a7f20efa04ba3c0cb5b9561bf1806"}],"concept.go.go0048511":[{"id":"assertion.concept.go.go0048511","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"rhythmic process as defined in the captured Gene Ontology term GO:0048511","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines rhythmic process as: Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","support":[{"end":215,"quote":"Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","source_id":"quickgo.go_0048511","source_sha256":"da6b8872db87126c73b7237f2fff971754b59819b535b60e0cc3d52f7e4c792a","start":115}],"target_id":"concept.go.go0048511","target_kind":"node","target_sha256":"fb8cf81ca1b45ec85337b34ea0676fe853bd3f4d8c60e6bafbe5e2f630b4abb0"}],"concept.go.go0048532":[{"id":"assertion.concept.go.go0048532","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure arrangement as defined in the captured Gene Ontology term GO:0048532","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure arrangement as: The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":401,"quote":"The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048532","source_sha256":"50e9a88096661593bb0ef698e0642b3b5bebc56cfee567849765fe5894000aa5","start":131}],"target_id":"concept.go.go0048532","target_kind":"node","target_sha256":"754811886f23889b0797f5515b235da4d1a723a22ae673d88c35e03ca565e2a1"}],"concept.go.go0048589":[{"id":"assertion.concept.go.go0048589","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"developmental growth as defined in the captured Gene Ontology term GO:0048589","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental growth as: The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","support":[{"end":339,"quote":"The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","source_id":"quickgo.go_0048589","source_sha256":"4b77bda5106353dfa3e162ece62d8ebdf9814cbb8855658b85702bfbd7a26d94","start":119}],"target_id":"concept.go.go0048589","target_kind":"node","target_sha256":"f9fd953146dffedf36d02134afdb542f640b918e67518243c5689414cb0050ea"}],"concept.go.go0048609":[{"id":"assertion.concept.go.go0048609","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal reproductive process as defined in the captured Gene Ontology term GO:0048609","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal reproductive process as: The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","support":[{"end":343,"quote":"The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","source_id":"quickgo.go_0048609","source_sha256":"0e33c1e15ee32189774c078deeb9d9e82660a2d3d9cab68432250fcc61c37d41","start":144}],"target_id":"concept.go.go0048609","target_kind":"node","target_sha256":"78d1a812af5a31063d071b416e2cba2e08e6a9e804045a48f6305f7123f1fcb1"}],"concept.go.go0048646":[{"id":"assertion.concept.go.go0048646","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure formation involved in morphogenesis as defined in the captured Gene Ontology term GO:0048646","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure formation involved in morphogenesis as: The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":638,"quote":"The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048646","source_sha256":"fe1a7d3ae98284d3302d2407e0fbc2d82e1e0a476b01105afb020df2bb91e5aa","start":155}],"target_id":"concept.go.go0048646","target_kind":"node","target_sha256":"015ebe4b30d46b31bac8d596f358b43fea2234328597cb77564de330aaacbe26"}],"concept.go.go0048647":[{"id":"assertion.concept.go.go0048647","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"polyphenic determination as defined in the captured Gene Ontology term GO:0048647","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines polyphenic determination as: The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","support":[{"end":346,"quote":"The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","source_id":"quickgo.go_0048647","source_sha256":"2ddaef8210c1f1e8edb3e490cb15b8b19f55036bce4e7150c91ac90cd55d969a","start":123}],"target_id":"concept.go.go0048647","target_kind":"node","target_sha256":"28ab932c056dfadb62c0e329dbdf1dd7d050c99f7a5d7df64bc46a13bad64adc"}],"concept.go.go0048771":[{"id":"assertion.concept.go.go0048771","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tissue remodeling as defined in the captured Gene Ontology term GO:0048771","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue remodeling as: The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","support":[{"end":345,"quote":"The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","source_id":"quickgo.go_0048771","source_sha256":"6306d3f7c52887b646291b6db9eefc23a6dec622d9014eb431018f64da228c3b","start":116}],"target_id":"concept.go.go0048771","target_kind":"node","target_sha256":"b2a21f72a115d61f10bfc5e1c0af89c5828986cf0400b3a6f49e88a2ec5eab76"}],"concept.go.go0048856":[{"id":"assertion.concept.go.go0048856","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure development as defined in the captured Gene Ontology term GO:0048856","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure development as: The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","support":[{"end":630,"quote":"The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","source_id":"quickgo.go_0048856","source_sha256":"351e5ac4b7d63ca322502ff1c1fcbd5d95ee2d0c4d0dc2461ee3c2624ede5754","start":131}],"target_id":"concept.go.go0048856","target_kind":"node","target_sha256":"1ff418e70a78ff2da50a2247a2440fbd9bfc4b6f067edd945fc386c6b0908a9e"}],"concept.go.go0048869":[{"id":"assertion.concept.go.go0048869","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular developmental process as defined in the captured Gene Ontology term GO:0048869","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular developmental process as: A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","support":[{"end":259,"quote":"A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","source_id":"quickgo.go_0048869","source_sha256":"c25beaf02b4c0134dcb19d0439d5c8f5885f18909d7a3f21fdcd78d22ca0b459","start":129}],"target_id":"concept.go.go0048869","target_kind":"node","target_sha256":"d0291577c3b589c97a21f686a6c8ee5e200a73dd2fd1a17d62c6fa011b02e693"}],"concept.go.go0048870":[{"id":"assertion.concept.go.go0048870","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell motility as defined in the captured Gene Ontology term GO:0048870","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell motility as: Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","support":[{"end":253,"quote":"Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","source_id":"quickgo.go_0048870","source_sha256":"cd480c211a9d10763d93c57a8a4efc33026527e7b10e1bcbdec5e5e85e22abb6","start":112}],"target_id":"concept.go.go0048870","target_kind":"node","target_sha256":"5fd0d3fbff4e47519d3a8851b7cc77c91143c72bfdf1233bc0f891ca03c3cad3"}],"concept.go.go0048871":[{"id":"assertion.concept.go.go0048871","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal-level homeostasis as defined in the captured Gene Ontology term GO:0048871","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","support":[{"end":252,"quote":"Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","source_id":"quickgo.go_0048871","source_sha256":"b14ca830aaf89b1286ff06d28c492ada566fb076b61b2ad28563b8baacbe52c1","start":141}],"target_id":"concept.go.go0048871","target_kind":"node","target_sha256":"4d14c1a42b8e9367ade24b54481c3e56d098b729cf841b95ff55d058ae068090"}],"concept.go.go0048878":[{"id":"assertion.concept.go.go0048878","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"chemical homeostasis as defined in the captured Gene Ontology term GO:0048878","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines chemical homeostasis as: Any biological process involved in the maintenance of an internal steady state of a chemical.","support":[{"end":212,"quote":"Any biological process involved in the maintenance of an internal steady state of a chemical.","source_id":"quickgo.go_0048878","source_sha256":"41b84c168e4ef635f12f6ed6933e4488ea14fcc9921188d35cbfa443026876f3","start":119}],"target_id":"concept.go.go0048878","target_kind":"node","target_sha256":"5d3b6068451fea7c6c0f4d9fe2605d307f2851abdedff049c617e4bc57dd66db"}],"concept.go.go0050817":[{"id":"assertion.concept.go.go0050817","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"coagulation as defined in the captured Gene Ontology term GO:0050817","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines coagulation as: The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","support":[{"end":203,"quote":"The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","source_id":"quickgo.go_0050817","source_sha256":"f415cc80c390dd54f46b58e4b20b6af903645bf8a59de3b5cc03e67e27c99681","start":110}],"target_id":"concept.go.go0050817","target_kind":"node","target_sha256":"75150b3618fba1e91396725b62b92e853d29407b5211698e7f51d73f83bde4c6"}],"concept.go.go0050879":[{"id":"assertion.concept.go.go0050879","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal movement as defined in the captured Gene Ontology term GO:0050879","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal movement as: Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","support":[{"end":270,"quote":"Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","source_id":"quickgo.go_0050879","source_sha256":"24bcd2079c5b1858e6781c271f3182e286edcecc6cca7547ceceb89d31759887","start":132}],"target_id":"concept.go.go0050879","target_kind":"node","target_sha256":"324cf3d36ea99d69f17710c6b0b12218cf7f655f8c30e37e9d6f42e46926361c"}],"concept.go.go0050900":[{"id":"assertion.concept.go.go0050900","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"leukocyte migration as defined in the captured Gene Ontology term GO:0050900","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte migration as: The movement of a leukocyte within or between different tissues and organs of the body.","support":[{"end":205,"quote":"The movement of a leukocyte within or between different tissues and organs of the body.","source_id":"quickgo.go_0050900","source_sha256":"4d215ce417fd9f27169c775ae8fcb0b3ec1f071dc7f4e7498035bec1c9205921","start":118}],"target_id":"concept.go.go0050900","target_kind":"node","target_sha256":"f9c790a01e43751e39d33ace7a545d88f99281562b942aee8725ea2a84be99f2"}],"concept.go.go0051179":[{"id":"assertion.concept.go.go0051179","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"localization as defined in the captured Gene Ontology term GO:0051179","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization as: Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","support":[{"end":378,"quote":"Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","source_id":"quickgo.go_0051179","source_sha256":"6b4088f726c151c21a046fe14a74a453d624aa42c95ee179d9f587197aec8c13","start":111}],"target_id":"concept.go.go0051179","target_kind":"node","target_sha256":"52239215dfa725c763d1c6278b4bb1551092664b9065b3215a537dd6fdc97b92"}],"concept.go.go0051301":[{"id":"assertion.concept.go.go0051301","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell division as defined in the captured Gene Ontology term GO:0051301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division as: The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","support":[{"end":334,"quote":"The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","source_id":"quickgo.go_0051301","source_sha256":"50a454a0aa35155dd4a33f2cfe4aefb4888e0ca8a9573b86e80708ac7d055039","start":112}],"target_id":"concept.go.go0051301","target_kind":"node","target_sha256":"875afeb195578358d97d157d0f84e999058dead738816346b1567fb5108647c9"}],"concept.go.go0051321":[{"id":"assertion.concept.go.go0051321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic cell cycle as defined in the captured Gene Ontology term GO:0051321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle as: Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","support":[{"end":323,"quote":"Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","source_id":"quickgo.go_0051321","source_sha256":"71cb5dcea8612577eec3ba94377457263bdfc26a52367ba9b0ff2e08e6ae3143","start":117}],"target_id":"concept.go.go0051321","target_kind":"node","target_sha256":"f380fed8bb1fe5f59252f7c8035be1a942c06fa3dd924ba7dadb1c4c0524aba3"}],"concept.go.go0051410":[{"id":"assertion.concept.go.go0051410","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of nitrogen compound as defined in the captured Gene Ontology term GO:0051410","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of nitrogen compound as: Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","support":[{"end":317,"quote":"Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","source_id":"quickgo.go_0051410","source_sha256":"583f859b293ffd3b75062d38ddf4f051e086b26172122d113d3fc135a81fc9ce","start":134}],"target_id":"concept.go.go0051410","target_kind":"node","target_sha256":"9c311a2b6433a08ca95c8b1aca84b48b7682c6f2f2a10426130431bfae80a9cb"}],"concept.go.go0051606":[{"id":"assertion.concept.go.go0051606","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detection of stimulus as defined in the captured Gene Ontology term GO:0051606","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detection of stimulus as: The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","support":[{"end":233,"quote":"The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","source_id":"quickgo.go_0051606","source_sha256":"9b9722de9b50522102dc2fe420ce406ea76a662412de526dc63cf93e6322e33d","start":120}],"target_id":"concept.go.go0051606","target_kind":"node","target_sha256":"a40677522536ea14063ba38c2e2a05acb2f65efcf16f49d76bc7c93e6193b4f2"}],"concept.go.go0051640":[{"id":"assertion.concept.go.go0051640","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organelle localization as defined in the captured Gene Ontology term GO:0051640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle localization as: Any process in which an organelle is transported to, and/or maintained in, a specific location.","support":[{"end":216,"quote":"Any process in which an organelle is transported to, and/or maintained in, a specific location.","source_id":"quickgo.go_0051640","source_sha256":"e8a8ab49f58a0c42728fd06634178ce58e949ceffa2d4b611af7cd963ff0572f","start":121}],"target_id":"concept.go.go0051640","target_kind":"node","target_sha256":"af29fff2d57cbc901302906dbda89b906a7bb6a2b26347ba15e9b0293f6eea15"}],"concept.go.go0051641":[{"id":"assertion.concept.go.go0051641","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular localization as defined in the captured Gene Ontology term GO:0051641","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular localization as: A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","support":[{"end":390,"quote":"A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","source_id":"quickgo.go_0051641","source_sha256":"8a535b4adfb2383b8c1cac934675bff8047f566dfc1d59eba83c6364e9b5fa5b","start":120}],"target_id":"concept.go.go0051641","target_kind":"node","target_sha256":"d3fb8c91239bf69b88337016ebe574c3363becdfc170f0352adafc73f18f4a81"}],"concept.go.go0051674":[{"id":"assertion.concept.go.go0051674","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"localization of cell as defined in the captured Gene Ontology term GO:0051674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization of cell as: Any process in which a cell is transported to, and/or maintained in, a specific location.","support":[{"end":208,"quote":"Any process in which a cell is transported to, and/or maintained in, a specific location.","source_id":"quickgo.go_0051674","source_sha256":"7a482bd94b9ba8f820001913f316a6546a0ddf2a00c221190d6a665ed9f9ac49","start":119}],"target_id":"concept.go.go0051674","target_kind":"node","target_sha256":"f9458c45f2ea18ebd69bf2053131ee4ae72b344a769cd34a654d809c002e6763"}],"concept.go.go0051703":[{"id":"assertion.concept.go.go0051703","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological process involved in intraspecies interaction between organisms as defined in the captured Gene Ontology term GO:0051703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in intraspecies interaction between organisms as: Any process in which an organism has an effect on an organism of the same species.","support":[{"end":254,"quote":"Any process in which an organism has an effect on an organism of the same species.","source_id":"quickgo.go_0051703","source_sha256":"9c8ff04287872c87d0b91fef2ad5e541cffb600237032355ddf10973ff6e2ae7","start":172}],"target_id":"concept.go.go0051703","target_kind":"node","target_sha256":"4dd800e9801162f2d94c940ca5650d6c8f48eff9fbd5fda54891b60b3ba71b29"}],"concept.go.go0055036":[{"id":"assertion.concept.go.go0055036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion membrane as defined in the captured Gene Ontology term GO:0055036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion membrane as: The lipid bilayer surrounding a virion.","support":[{"end":153,"quote":"The lipid bilayer surrounding a virion.","source_id":"quickgo.go_0055036","source_sha256":"aef4e57f5e7b057ddf231647e2d4c4d68a383114bf82f4d9e8741dd691cf8e50","start":114}],"target_id":"concept.go.go0055036","target_kind":"node","target_sha256":"640f84ae520c1a7160f388bb35faf1062259e71b71f1b02e95e8bef06f07162e"}],"concept.go.go0055046":[{"id":"assertion.concept.go.go0055046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microgametogenesis as defined in the captured Gene Ontology term GO:0055046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microgametogenesis as: The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","support":[{"end":263,"quote":"The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","source_id":"quickgo.go_0055046","source_sha256":"d277c1d36a4b5f9c76a77c5da5438c34f375f42be0f11c3ad5b00c57323138cd","start":117}],"target_id":"concept.go.go0055046","target_kind":"node","target_sha256":"013812919ee455dca392fc16ead59da4619597bbc173dec2ddc59fc274422473"}],"concept.go.go0055085":[{"id":"assertion.concept.go.go0055085","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"transmembrane transport as defined in the captured Gene Ontology term GO:0055085","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines transmembrane transport as: The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","support":[{"end":232,"quote":"The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","source_id":"quickgo.go_0055085","source_sha256":"b6374482e2d6ff11edbd661d2a90eb2255fd80de1fae380e376a65dd31b6d990","start":122}],"target_id":"concept.go.go0055085","target_kind":"node","target_sha256":"b41968d2ddefbf9192bdd181e447c9bff438c851adbfdccc68a93faf9039cfa2"}],"concept.go.go0055127":[{"id":"assertion.concept.go.go0055127","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"vibrational conductance of sound to the inner ear as defined in the captured Gene Ontology term GO:0055127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines vibrational conductance of sound to the inner ear as: The transmission of vibrations via ossicles to the inner ear.","support":[{"end":209,"quote":"The transmission of vibrations via ossicles to the inner ear.","source_id":"quickgo.go_0055127","source_sha256":"a57d60c35d1f7dd1d9268a2b06302ea46c55a24398163c9aeca379d85b893e53","start":148}],"target_id":"concept.go.go0055127","target_kind":"node","target_sha256":"c0a7fd4c33717195ea39f105ddaa69d775e7e4e4111246e3be92c803f86298ae"}],"concept.go.go0060033":[{"id":"assertion.concept.go.go0060033","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anatomical structure regression as defined in the captured Gene Ontology term GO:0060033","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure regression as: The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","support":[{"end":238,"quote":"The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","source_id":"quickgo.go_0060033","source_sha256":"f35b2812bd6da03429658a390c2306a6416c3665ae1dec02e339b367248cfc03","start":130}],"target_id":"concept.go.go0060033","target_kind":"node","target_sha256":"f505a891b0268f2e2129c4496b0afb6d9fca617e2a617e63ca8c7285a9520c78"}],"concept.go.go0060104":[{"id":"assertion.concept.go.go0060104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"surface coat of collagen and cuticulin-based cuticle extracellular matrix as defined in the captured Gene Ontology term GO:0060104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines surface coat of collagen and cuticulin-based cuticle extracellular matrix as: An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","support":[{"end":657,"quote":"An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","source_id":"quickgo.go_0060104","source_sha256":"9f066cab9270818418d00b8cdfe0af13ff69083c9f48683ca8eee04fc43d831f","start":172}],"target_id":"concept.go.go0060104","target_kind":"node","target_sha256":"19557d78d01b88cfa1b02161b3cbac0d8dc9d26ec87f7b466a877684668d06e2"}],"concept.go.go0060105":[{"id":"assertion.concept.go.go0060105","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"epicuticle of collagen and cuticulin-based cuticle extracellular matrix as defined in the captured Gene Ontology term GO:0060105","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines epicuticle of collagen and cuticulin-based cuticle extracellular matrix as: A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","support":[{"end":329,"quote":"A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","source_id":"quickgo.go_0060105","source_sha256":"096b968c14cf9108dd548c6ca012d582cc10588f7ce6772d860432c85382a9fe","start":170}],"target_id":"concept.go.go0060105","target_kind":"node","target_sha256":"04da904f206093d2773a9dc81505760c83f825ed3754811f9b4a6f50d451259a"}],"concept.go.go0060108":[{"id":"assertion.concept.go.go0060108","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"annular furrow extracellular matrix as defined in the captured Gene Ontology term GO:0060108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines annular furrow extracellular matrix as: The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","support":[{"end":534,"quote":"The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","source_id":"quickgo.go_0060108","source_sha256":"aa6f5ab2c02279341471c9707d0e0085329048c7f97eeb0a9c537e459fb7177e","start":134}],"target_id":"concept.go.go0060108","target_kind":"node","target_sha256":"34d86a7821e7992d35cd9eacf7d569072088008d433c114864f631f0d89433d3"}],"concept.go.go0060206":[{"id":"assertion.concept.go.go0060206","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"estrous cycle phase as defined in the captured Gene Ontology term GO:0060206","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines estrous cycle phase as: The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","support":[{"end":378,"quote":"The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","source_id":"quickgo.go_0060206","source_sha256":"70875862099b2efdaa6ce4688f4f238846c228ea242c569938f4fcfd2a386e64","start":118}],"target_id":"concept.go.go0060206","target_kind":"node","target_sha256":"7a0e8a04d0bc01c596766282e142b5d181ad8a130dd4b74d5e513f51f2a895a5"}],"concept.go.go0060352":[{"id":"assertion.concept.go.go0060352","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell adhesion molecule production as defined in the captured Gene Ontology term GO:0060352","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion molecule production as: The appearance of a cell adhesion molecule due to biosynthesis or secretion.","support":[{"end":208,"quote":"The appearance of a cell adhesion molecule due to biosynthesis or secretion.","source_id":"quickgo.go_0060352","source_sha256":"2c52110a924988a20adfd090e1d9e34718f75d71f82e7b0655270f145b1f180b","start":132}],"target_id":"concept.go.go0060352","target_kind":"node","target_sha256":"bfb30b9cadec19dc1a057070a575d422af582a58ff8891d372d06592eb08c088"}],"concept.go.go0060361":[{"id":"assertion.concept.go.go0060361","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"flight as defined in the captured Gene Ontology term GO:0060361","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines flight as: Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","support":[{"end":231,"quote":"Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","source_id":"quickgo.go_0060361","source_sha256":"d4378df7f3d7e381bf525f25d5cecdcbd04013e40e7463cd01a272f2b34251cc","start":105}],"target_id":"concept.go.go0060361","target_kind":"node","target_sha256":"22b4144e97309f543ff82be668b7602563463311d2cd0f4a1927879a6fe8c396"}],"concept.go.go0060384":[{"id":"assertion.concept.go.go0060384","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"innervation as defined in the captured Gene Ontology term GO:0060384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines innervation as: The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","support":[{"end":215,"quote":"The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","source_id":"quickgo.go_0060384","source_sha256":"309a955abb15fadc910d4b2b3ab9e1b20aded50ac461dbb9aca7a8517141c709","start":110}],"target_id":"concept.go.go0060384","target_kind":"node","target_sha256":"38e8e1a3c380720cd9aef5999eda28c5ed9db28a686c5eb945acdcdbab1dc646"}],"concept.go.go0061687":[{"id":"assertion.concept.go.go0061687","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of inorganic compound as defined in the captured Gene Ontology term GO:0061687","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of inorganic compound as: Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","support":[{"end":363,"quote":"Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","source_id":"quickgo.go_0061687","source_sha256":"6ecaa276b580db17b53298710e22b8db565aefef52be5d74c507c410ca2a0b87","start":135}],"target_id":"concept.go.go0061687","target_kind":"node","target_sha256":"e168c68bccf103598ee1f8be7c513fa8ce1e2a442e15e5b80ccfa894530866b9"}],"concept.go.go0061822":[{"id":"assertion.concept.go.go0061822","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary cap as defined in the captured Gene Ontology term GO:0061822","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary cap as: An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","support":[{"end":627,"quote":"An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","source_id":"quickgo.go_0061822","source_sha256":"71561981bf7a55a7795f81848a6a676bdf1f46714917a95b9921c27e577b10f2","start":110}],"target_id":"concept.go.go0061822","target_kind":"node","target_sha256":"3ff0809f3bfb8168aa7a14c90c05c63d5422e93c65d7babbd217dcaae5ee2256"}],"concept.go.go0061823":[{"id":"assertion.concept.go.go0061823","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ring centriole as defined in the captured Gene Ontology term GO:0061823","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ring centriole as: A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","support":[{"end":367,"quote":"A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","source_id":"quickgo.go_0061823","source_sha256":"a4794b37ef15885eaea81499d053842a5112aa2dd217102cfc5203cf466e34ae","start":113}],"target_id":"concept.go.go0061823","target_kind":"node","target_sha256":"70ed66f468311b704abd5e62ef80bb36d125ad45b074131708bc00bbc406373a"}],"concept.go.go0061834":[{"id":"assertion.concept.go.go0061834","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin filament branch point as defined in the captured Gene Ontology term GO:0061834","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament branch point as: The part of an actin filament where the structure forks.","support":[{"end":182,"quote":"The part of an actin filament where the structure forks.","source_id":"quickgo.go_0061834","source_sha256":"acc6a71dfe2403b36c2dde564d938341807d48ec5403e8dd4e532cb6f7641f2a","start":126}],"target_id":"concept.go.go0061834","target_kind":"node","target_sha256":"abd65a7b23101f23d610a6e0007854534558ea737983ef98531ebb8cc4ada114"}],"concept.go.go0061835":[{"id":"assertion.concept.go.go0061835","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral surface of cell as defined in the captured Gene Ontology term GO:0061835","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral surface of cell as: The surface of a migrating cell that is in contact with the substratum or cell layer.","support":[{"end":207,"quote":"The surface of a migrating cell that is in contact with the substratum or cell layer.","source_id":"quickgo.go_0061835","source_sha256":"10c908c0b7c9dcc713c614ae0f0dbb4e5842a8a8c4806ce017f0234bc13153f3","start":122}],"target_id":"concept.go.go0061835","target_kind":"node","target_sha256":"4b3ed585f3924c77e23b18fd5fa95265d195a6def0853d888c6ce96bdaf6adf0"}],"concept.go.go0061842":[{"id":"assertion.concept.go.go0061842","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"microtubule organizing center localization as defined in the captured Gene Ontology term GO:0061842","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule organizing center localization as: Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","support":[{"end":273,"quote":"Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","source_id":"quickgo.go_0061842","source_sha256":"6faa50860b9dd17794d7f485ed55600c97e8d8769c2654e8d4fd307f42aa2446","start":141}],"target_id":"concept.go.go0061842","target_kind":"node","target_sha256":"8fcdab61460c48d24f6ad624f3d7a0d8944cb560c4ef4e704791ec8a5d4ebce1"}],"concept.go.go0061845":[{"id":"assertion.concept.go.go0061845","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"neuron projection branch point as defined in the captured Gene Ontology term GO:0061845","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines neuron projection branch point as: The location where a secondary projection arises from a neuron projection.","support":[{"end":203,"quote":"The location where a secondary projection arises from a neuron projection.","source_id":"quickgo.go_0061845","source_sha256":"cba09f4ef0bcca9264982c4ba9ab03c5aa09f97f295a9b9d6b9abafbd9b339b4","start":129}],"target_id":"concept.go.go0061845","target_kind":"node","target_sha256":"7b5f0cb632c7d25faf7eebf3821296205054d08f19efdfdec1d3026f18f8252a"}],"concept.go.go0061919":[{"id":"assertion.concept.go.go0061919","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"process utilizing autophagic mechanism as defined in the captured Gene Ontology term GO:0061919","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines process utilizing autophagic mechanism as: A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","support":[{"end":534,"quote":"A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","source_id":"quickgo.go_0061919","source_sha256":"ab7bb5de104beb3aca78e3c729c37a5e7b25c50223da1409970f90bc6d58c037","start":137}],"target_id":"concept.go.go0061919","target_kind":"node","target_sha256":"bfa8b54308da4219874f0283a7b4de4484fdc8d47fe0e3d1b75f66e56df2263e"}],"concept.go.go0061948":[{"id":"assertion.concept.go.go0061948","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"premature acrosome loss as defined in the captured Gene Ontology term GO:0061948","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines premature acrosome loss as: The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","support":[{"end":402,"quote":"The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","source_id":"quickgo.go_0061948","source_sha256":"c389fd9694b6bcd359b7d6357bcc1b66004dcdc62907bf78bb5b771aba7dd74a","start":122}],"target_id":"concept.go.go0061948","target_kind":"node","target_sha256":"7761d28ea038548a275bcaee9e8412344114b098f29c1fad298da3adf833f0fd"}],"concept.go.go0065007":[{"id":"assertion.concept.go.go0065007","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biological regulation as defined in the captured Gene Ontology term GO:0065007","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological regulation as: Any process that modulates a measurable attribute of any biological process, quality or function.","support":[{"end":217,"quote":"Any process that modulates a measurable attribute of any biological process, quality or function.","source_id":"quickgo.go_0065007","source_sha256":"2ef6bd104993da5ff5f0fb549bf36f84aa64c82fcba51268e2bb813d36770e67","start":120}],"target_id":"concept.go.go0065007","target_kind":"node","target_sha256":"ce369192884061a3efd44fd353c7fd9513f6315c6e024660977500c7ff6f92e1"}],"concept.go.go0070057":[{"id":"assertion.concept.go.go0070057","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"prospore membrane spindle pole body attachment site as defined in the captured Gene Ontology term GO:0070057","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines prospore membrane spindle pole body attachment site as: The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","support":[{"end":325,"quote":"The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","source_id":"quickgo.go_0070057","source_sha256":"3444a532248997cd2b1c8319053674ee598909ccbe9d9423bd555259a81d4432","start":150}],"target_id":"concept.go.go0070057","target_kind":"node","target_sha256":"3d72164c64414c469f883f0f7e19f813cd6b0875919cd0a1247681014fcb10b6"}],"concept.go.go0070701":[{"id":"assertion.concept.go.go0070701","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mucus layer as defined in the captured Gene Ontology term GO:0070701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mucus layer as: An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","support":[{"end":498,"quote":"An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","source_id":"quickgo.go_0070701","source_sha256":"74a76a9714d0f63c263215fe0bd90a5aaf9e997c7dec60bb4974e953cef68624","start":110}],"target_id":"concept.go.go0070701","target_kind":"node","target_sha256":"0e03666325115b8db0f525e8ddfe99422d745c42c635b5a1ba739a83515c2330"}],"concept.go.go0071554":[{"id":"assertion.concept.go.go0071554","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell wall organization or biogenesis as defined in the captured Gene Ontology term GO:0071554","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell wall organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","support":[{"end":283,"quote":"A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","source_id":"quickgo.go_0071554","source_sha256":"6eefc70a1f08136fe8d0f713917dda55b2c93fa099cff760b6256ab1bb0732a8","start":135}],"target_id":"concept.go.go0071554","target_kind":"node","target_sha256":"58c95905e9adcab28967a8bde46d96d43e785d0bf11fd07dd74bdc635aca2562"}],"concept.go.go0071684":[{"id":"assertion.concept.go.go0071684","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organism emergence from protective structure as defined in the captured Gene Ontology term GO:0071684","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines organism emergence from protective structure as: The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","support":[{"end":266,"quote":"The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","source_id":"quickgo.go_0071684","source_sha256":"534ae6fa43678ba1a9538a7fd15d09edee3cac4361cdbd6eaa65b0825b424a58","start":143}],"target_id":"concept.go.go0071684","target_kind":"node","target_sha256":"7992138c6029b5383cf867133531d79460896411f026f4a5bc6d599d67ab09c1"}],"concept.go.go0071722":[{"id":"assertion.concept.go.go0071722","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of arsenic-containing substance as defined in the captured Gene Ontology term GO:0071722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of arsenic-containing substance as: Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","support":[{"end":449,"quote":"Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","source_id":"quickgo.go_0071722","source_sha256":"c133897cf80ad2cd1d7cf1dd75e45e43264d5acaa1a2b2853a12b0b55eb8bb73","start":145}],"target_id":"concept.go.go0071722","target_kind":"node","target_sha256":"0c0634d4e6764b4fcb3ed95efcd478db7846b415f16dfdb9df146c2e36b155d1"}],"concept.go.go0071808":[{"id":"assertion.concept.go.go0071808","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"satellite fibril as defined in the captured Gene Ontology term GO:0071808","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines satellite fibril as: An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","support":[{"end":315,"quote":"An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","source_id":"quickgo.go_0071808","source_sha256":"8f4bf0fcad17d903364cae23b20dd1e9e9f14011a0d63f535f47fad8e37c60c3","start":115}],"target_id":"concept.go.go0071808","target_kind":"node","target_sha256":"dc083f96097d4dae93d4617afe9fd88bad2b5d0e99a2372a4d6252ef70966869"}],"concept.go.go0071827":[{"id":"assertion.concept.go.go0071827","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plasma lipoprotein particle organization as defined in the captured Gene Ontology term GO:0071827","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle organization as: A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","support":[{"end":495,"quote":"A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","source_id":"quickgo.go_0071827","source_sha256":"5be3a9ea94d8ea47f55d939a53bdad95c05ac93ffbe539f5077571207aff3f8a","start":139}],"target_id":"concept.go.go0071827","target_kind":"node","target_sha256":"cd4a9fea54f9954326c8e7d0bab207dabb7a99e04908cf8f9a7fdd6468588726"}],"concept.go.go0071840":[{"id":"assertion.concept.go.go0071840","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular component organization or biogenesis as defined in the captured Gene Ontology term GO:0071840","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular component organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","support":[{"end":301,"quote":"A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","source_id":"quickgo.go_0071840","source_sha256":"5342172ffbd0eb6279adaf8860aeb61ea8b797360906a8096b56796dc746a866","start":144}],"target_id":"concept.go.go0071840","target_kind":"node","target_sha256":"008d145b7b3f0e12f09689d7018971f8b94a60186236d736e070fb911b6cbda8"}],"concept.go.go0071965":[{"id":"assertion.concept.go.go0071965","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal locomotion as defined in the captured Gene Ontology term GO:0071965","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal locomotion as: Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","support":[{"end":260,"quote":"Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","source_id":"quickgo.go_0071965","source_sha256":"d4d428e4173e4dda47d52526391bd57d0d02386f41eb47c4452a9a51d0ac30ba","start":134}],"target_id":"concept.go.go0071965","target_kind":"node","target_sha256":"3f705bfe1342b0bb96c2b439023a20c5866a6f68e6999b149d39c07d09d864f7"}],"concept.go.go0072324":[{"id":"assertion.concept.go.go0072324","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ascus epiplasm as defined in the captured Gene Ontology term GO:0072324","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ascus epiplasm as: Ascus cytoplasm that is not packaged into ascospores.","support":[{"end":166,"quote":"Ascus cytoplasm that is not packaged into ascospores.","source_id":"quickgo.go_0072324","source_sha256":"9d7fa4c158f23ade2c19aa94dd9be51f1419dbcbf040b70db19929c5e3ca1d8f","start":113}],"target_id":"concept.go.go0072324","target_kind":"node","target_sha256":"908df9ed83aa2cf92a2c9d1a753d748b254178edabb618caa9e4c242f2bbbd29"}],"concept.go.go0072690":[{"id":"assertion.concept.go.go0072690","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"single-celled organism vegetative growth phase as defined in the captured Gene Ontology term GO:0072690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-celled organism vegetative growth phase as: A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","support":[{"end":267,"quote":"A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","source_id":"quickgo.go_0072690","source_sha256":"a973f3e684991de38ab9d9f81ce42fb50b30ce5ae25d2a88c829c13c73b8e11e","start":145}],"target_id":"concept.go.go0072690","target_kind":"node","target_sha256":"a64d272ddf27b72279eb76548b6622105a8e8ec21822a08fbf3daa0c19000dae"}],"concept.go.go0075325":[{"id":"assertion.concept.go.go0075325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spore dispersal as defined in the captured Gene Ontology term GO:0075325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore dispersal as: Any process in which an organism disseminates its spores.","support":[{"end":171,"quote":"Any process in which an organism disseminates its spores.","source_id":"quickgo.go_0075325","source_sha256":"d38956556ca58bcb5dcf6a2cdb635275218a633bb0edfde7326e8235783486df","start":114}],"target_id":"concept.go.go0075325","target_kind":"node","target_sha256":"90e248b60937556a6122e6a53b48904fa72f787c31d284b8543a04faee51ef29"}],"concept.go.go0075522":[{"id":"assertion.concept.go.go0075522","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"IRES-dependent viral translational initiation as defined in the captured Gene Ontology term GO:0075522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines IRES-dependent viral translational initiation as: Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","support":[{"end":414,"quote":"Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","source_id":"quickgo.go_0075522","source_sha256":"83e7daf5ae46d8741bfde8bed95f444721eeb5ccb5b416d0fc0fa764a22a3889","start":144}],"target_id":"concept.go.go0075522","target_kind":"node","target_sha256":"a8f48c3b99b55b0ad2e93712fc2290dc8dae909aea630b96e3f4a74db98d1239"}],"concept.go.go0075523":[{"id":"assertion.concept.go.go0075523","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translational frameshifting as defined in the captured Gene Ontology term GO:0075523","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational frameshifting as: A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","support":[{"end":405,"quote":"A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","source_id":"quickgo.go_0075523","source_sha256":"0a1e6f15717f7a15d46279ccb000d2a1145d01660e8ced7486fc50e0bb92ef21","start":132}],"target_id":"concept.go.go0075523","target_kind":"node","target_sha256":"0d6b7ffc95dab7d3bf8b6e9106f97d1a37c09754435a54e10b9f8cc5c682b772"}],"concept.go.go0075524":[{"id":"assertion.concept.go.go0075524","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ribosomal skipping as defined in the captured Gene Ontology term GO:0075524","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ribosomal skipping as: A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","support":[{"end":356,"quote":"A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","source_id":"quickgo.go_0075524","source_sha256":"501658c57f7feebe519107e99fe7be519f65d2f38d31e846790d20b49782274c","start":117}],"target_id":"concept.go.go0075524","target_kind":"node","target_sha256":"2266eb080665dfaef9c19b78ac2395c75837145cccd49921b8cc52d54150b623"}],"concept.go.go0075525":[{"id":"assertion.concept.go.go0075525","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral translational termination-reinitiation as defined in the captured Gene Ontology term GO:0075525","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational termination-reinitiation as: A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","support":[{"end":504,"quote":"A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","source_id":"quickgo.go_0075525","source_sha256":"72ae4983c013c1eaf763610a4ea82ea4f2b3f2b5335ca4b2695ebf7b99f0360d","start":143}],"target_id":"concept.go.go0075525","target_kind":"node","target_sha256":"6c0b7ebf03c5d6f93ac7d4997d9a881b44eb34289759c2bb833396c638fda09e"}],"concept.go.go0075526":[{"id":"assertion.concept.go.go0075526","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cap snatching as defined in the captured Gene Ontology term GO:0075526","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cap snatching as: A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","support":[{"end":475,"quote":"A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","source_id":"quickgo.go_0075526","source_sha256":"578a015ae9912cf2e8dfc71630be438c1a8664b850349eac3cbcccd7932b8b39","start":112}],"target_id":"concept.go.go0075526","target_kind":"node","target_sha256":"fb89d95e812e985f6902d3e19cebf598483115f460341eb8e016ff29617a7c99"}],"concept.go.go0075527":[{"id":"assertion.concept.go.go0075527","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral RNA editing as defined in the captured Gene Ontology term GO:0075527","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral RNA editing as: The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","support":[{"end":439,"quote":"The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","source_id":"quickgo.go_0075527","source_sha256":"fba36201986594931512163cef56a28332c807d40df781b5e4affdbec5c0c062","start":116}],"target_id":"concept.go.go0075527","target_kind":"node","target_sha256":"d3bbe4e84333804229a0b1520e1a63bad81523a69bc48071c2637c2b67264fb9"}],"concept.go.go0080189":[{"id":"assertion.concept.go.go0080189","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"primary growth as defined in the captured Gene Ontology term GO:0080189","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines primary growth as: Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","support":[{"end":228,"quote":"Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","source_id":"quickgo.go_0080189","source_sha256":"c0518728da1287d05df178461a04edccf4945fa075c9220257ccaa12ed96334c","start":113}],"target_id":"concept.go.go0080189","target_kind":"node","target_sha256":"5e6acf7f0890d5b2d42075e05477994573f76f4c061e4ff1bdc8703ba1eaf237"}],"concept.go.go0080190":[{"id":"assertion.concept.go.go0080190","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lateral growth as defined in the captured Gene Ontology term GO:0080190","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral growth as: Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","support":[{"end":197,"quote":"Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","source_id":"quickgo.go_0080190","source_sha256":"c71ea12ec9dd23c38299f66a86a07d24b3dd54c03f775b12ae54ec336d19d646","start":113}],"target_id":"concept.go.go0080190","target_kind":"node","target_sha256":"fd5aa744eadec5c5a620edce0561329ee9449df82d2a1c04e424577e232addac"}],"concept.go.go0085036":[{"id":"assertion.concept.go.go0085036","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extrahaustorial matrix as defined in the captured Gene Ontology term GO:0085036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extrahaustorial matrix as: The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","support":[{"end":213,"quote":"The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","source_id":"quickgo.go_0085036","source_sha256":"111a5cf532ca16d6d033c0e02cd55a988b07faec78db73b5fdabef0828c06898","start":121}],"target_id":"concept.go.go0085036","target_kind":"node","target_sha256":"c1816f7a3d57e923981c2e1f3770ebbc1259ec76f5d89faf550c64fdbdcdc8ea"}],"concept.go.go0090123":[{"id":"assertion.concept.go.go0090123","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysosomal glycocalyx as defined in the captured Gene Ontology term GO:0090123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal glycocalyx as: The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","support":[{"end":277,"quote":"The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","source_id":"quickgo.go_0090123","source_sha256":"26418e4d688999acd574b2f4b15a6278f51da0b6928db3f6eda0a264ea51f8cc","start":119}],"target_id":"concept.go.go0090123","target_kind":"node","target_sha256":"aff94bce67afee4cacdb17abbcbe06b60b0bde4a4f3e9b0490075213239cde63"}],"concept.go.go0090130":[{"id":"assertion.concept.go.go0090130","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"tissue migration as defined in the captured Gene Ontology term GO:0090130","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue migration as: The process in which the population of cells that make up a tissue undergo directed movement.","support":[{"end":208,"quote":"The process in which the population of cells that make up a tissue undergo directed movement.","source_id":"quickgo.go_0090130","source_sha256":"932e9c64c4fbe643ec0efa6c120fc6571baa34b2514c9c86096b866df2cf5f29","start":115}],"target_id":"concept.go.go0090130","target_kind":"node","target_sha256":"54901d0269449155d5be8dba15fb9f531a980b86b1ca967b0c2c73893b277003"}],"concept.go.go0090398":[{"id":"assertion.concept.go.go0090398","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular senescence as defined in the captured Gene Ontology term GO:0090398","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular senescence as: A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","support":[{"end":269,"quote":"A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","source_id":"quickgo.go_0090398","source_sha256":"36579ec872f4feba012ce5a47e8b3f47a0d17b9850b4e5febbd67cc14b1ce881","start":118}],"target_id":"concept.go.go0090398","target_kind":"node","target_sha256":"caf31c1dc7eb21301095ff88807eb31fbb9ac644a55a77a23eb11ddcb5f743cb"}],"concept.go.go0090405":[{"id":"assertion.concept.go.go0090405","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"unicellular trichome branch as defined in the captured Gene Ontology term GO:0090405","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines unicellular trichome branch as: A cell projection part that is a branch of a unicellular trichome.","support":[{"end":192,"quote":"A cell projection part that is a branch of a unicellular trichome.","source_id":"quickgo.go_0090405","source_sha256":"f040ff4d8c6b10c29f1c81fabd6f74aa2fa720ca2b2fdba25f83d3bb4dc0a346","start":126}],"target_id":"concept.go.go0090405","target_kind":"node","target_sha256":"a1f6757122cbaf9f772ac0de6d20baf234ff77e1f5fd70000460899295ff21dc"}],"concept.go.go0090635":[{"id":"assertion.concept.go.go0090635","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"extracellular core region of desmosome as defined in the captured Gene Ontology term GO:0090635","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular core region of desmosome as: The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","support":[{"end":306,"quote":"The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","source_id":"quickgo.go_0090635","source_sha256":"f5a078372421af65038ab8c8e1eea0f2a1fa4af9d5bf1349863edc0b8bebc138","start":137}],"target_id":"concept.go.go0090635","target_kind":"node","target_sha256":"dbdeee4ecbfc1ee4fbdc49e6e0d288092a6b7fe530625666101a4c7f029cfb1d"}],"concept.go.go0090637":[{"id":"assertion.concept.go.go0090637","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"inner dense plaque of desmosome as defined in the captured Gene Ontology term GO:0090637","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines inner dense plaque of desmosome as: The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","support":[{"end":315,"quote":"The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","source_id":"quickgo.go_0090637","source_sha256":"ce770f5460a6ab75d42171aa28157432b4e7e17233e9b186eb294aee0f225e81","start":130}],"target_id":"concept.go.go0090637","target_kind":"node","target_sha256":"b110647704fe09b9c8ce8390affd1d8089257299f32a6690b3a080e68f807756"}],"concept.go.go0090644":[{"id":"assertion.concept.go.go0090644","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"age-related resistance as defined in the captured Gene Ontology term GO:0090644","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines age-related resistance as: An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","support":[{"end":492,"quote":"An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","source_id":"quickgo.go_0090644","source_sha256":"6bb061bf2246b55fed92a4cab3f31c6249de0f46735c327b3a60d05e2daf7a16","start":121}],"target_id":"concept.go.go0090644","target_kind":"node","target_sha256":"543836228987099fa63c20a2849a2980ead40b8033587858d32b1f3618652e56"}],"concept.go.go0090658":[{"id":"assertion.concept.go.go0090658","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cone matrix sheath as defined in the captured Gene Ontology term GO:0090658","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cone matrix sheath as: A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","support":[{"end":293,"quote":"A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","source_id":"quickgo.go_0090658","source_sha256":"d9e345ae12e72b0653e0f95da0d857099893a29b00a19e1b0a02c6948a90c3d6","start":117}],"target_id":"concept.go.go0090658","target_kind":"node","target_sha256":"bd26de2c019b443017446ad3edb2f2b0ff6bf20ffc04fc31ed4fd6c5fa8c0135"}],"concept.go.go0090692":[{"id":"assertion.concept.go.go0090692","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial membrane scission site as defined in the captured Gene Ontology term GO:0090692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial membrane scission site as: The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","support":[{"end":308,"quote":"The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","source_id":"quickgo.go_0090692","source_sha256":"0fd90ad8aaebf0986505eb0409d5d5700719f64678d3484b357f20bcf27425ad","start":135}],"target_id":"concept.go.go0090692","target_kind":"node","target_sha256":"e56833c0aecd0ea3d375a71d7e1688889415577fda8e43f66412fdae75c5fb44"}],"concept.go.go0090693":[{"id":"assertion.concept.go.go0090693","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"plant organ senescence as defined in the captured Gene Ontology term GO:0090693","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines plant organ senescence as: A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","support":[{"end":322,"quote":"A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","source_id":"quickgo.go_0090693","source_sha256":"b2356d1374d953754f57e871407a6e252acc392685864e471d65053928de5dc1","start":121}],"target_id":"concept.go.go0090693","target_kind":"node","target_sha256":"734f39135d33a4746f316165d6b70ccaa9d3a4b934d1fdccaf4965c21314a61f"}],"concept.go.go0090713":[{"id":"assertion.concept.go.go0090713","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"immunological memory process as defined in the captured Gene Ontology term GO:0090713","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological memory process as: Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","support":[{"end":289,"quote":"Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","source_id":"quickgo.go_0090713","source_sha256":"81d91f431ce3a7158395852f25020c375958e42e044429d59c60bac7be5f0724","start":127}],"target_id":"concept.go.go0090713","target_kind":"node","target_sha256":"150a12d8dec121ff2f8a320ee1ede4f54c6d7005a519f07c4ddadda7bff5e1bd"}],"concept.go.go0090724":[{"id":"assertion.concept.go.go0090724","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"central region of growth cone as defined in the captured Gene Ontology term GO:0090724","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines central region of growth cone as: The center of the migrating motile tip of a growing nerve cell axon or dendrite.","support":[{"end":208,"quote":"The center of the migrating motile tip of a growing nerve cell axon or dendrite.","source_id":"quickgo.go_0090724","source_sha256":"8098f8eb3e8ed32f81f8f47c7156d883d79f0ce127bd576cfd760d92af51e16b","start":128}],"target_id":"concept.go.go0090724","target_kind":"node","target_sha256":"d672181f35b2963e5597ea56e60015492c28f668535fdd358e5e547b34ada794"}],"concept.go.go0090725":[{"id":"assertion.concept.go.go0090725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"peripheral region of growth cone as defined in the captured Gene Ontology term GO:0090725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines peripheral region of growth cone as: The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","support":[{"end":236,"quote":"The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","source_id":"quickgo.go_0090725","source_sha256":"7bb2e0406aec755ec8a511ce980483ba63ecdfb51a815f50118d10f70552b7c9","start":131}],"target_id":"concept.go.go0090725","target_kind":"node","target_sha256":"9cec034883deb334dcca73a6b4a9077e83f1025bf1770199268f908e1d312b7d"}],"concept.go.go0090726":[{"id":"assertion.concept.go.go0090726","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cortical dynamic polarity patch as defined in the captured Gene Ontology term GO:0090726","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cortical dynamic polarity patch as: A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","support":[{"end":450,"quote":"A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","source_id":"quickgo.go_0090726","source_sha256":"d6f78c3e2eaf55b9d45f7b87f0e03febb90ae9d75fe35474f59c6722e83cf960","start":130}],"target_id":"concept.go.go0090726","target_kind":"node","target_sha256":"10ab64cf417219694fde26aaae8fb65641fbacba4ffb193b65ed34779312ec7b"}],"concept.go.go0097002":[{"id":"assertion.concept.go.go0097002","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitochondrial inner boundary membrane as defined in the captured Gene Ontology term GO:0097002","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial inner boundary membrane as: The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","support":[{"end":289,"quote":"The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","source_id":"quickgo.go_0097002","source_sha256":"61778db4b20e109c49591752e2843e94f964873c77b25bc9e7c3b0e6222e22d3","start":136}],"target_id":"concept.go.go0097002","target_kind":"node","target_sha256":"17df13b61b1ba40cac637d3aea5fd8c3969aaf04d66dd94c84298c04d320049d"}],"concept.go.go0097047":[{"id":"assertion.concept.go.go0097047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"DNA replication termination region as defined in the captured Gene Ontology term GO:0097047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines DNA replication termination region as: A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","support":[{"end":255,"quote":"A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","source_id":"quickgo.go_0097047","source_sha256":"9aaf8e98432e0a7d3b58e9b3c3af56c3b110da88b8fe841d9ed2dc48ec3bf34e","start":133}],"target_id":"concept.go.go0097047","target_kind":"node","target_sha256":"654c0c3f638fc1c2e692b0789dac17823aff5c354cc828af6da2995b60bb1f51"}],"concept.go.go0097120":[{"id":"assertion.concept.go.go0097120","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"receptor localization to synapse as defined in the captured Gene Ontology term GO:0097120","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines receptor localization to synapse as: Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","support":[{"end":314,"quote":"Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","source_id":"quickgo.go_0097120","source_sha256":"fbf617e4aa923deb95fe44eedbc7670d537c4de2441641d53d1f13131a9a7e7b","start":131}],"target_id":"concept.go.go0097120","target_kind":"node","target_sha256":"20a49cac01105eec7a357a00011f680a7c0912b1b9e79c47256aa4e93ab3f9eb"}],"concept.go.go0097194":[{"id":"assertion.concept.go.go0097194","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"execution phase of apoptosis as defined in the captured Gene Ontology term GO:0097194","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of apoptosis as: A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","support":[{"end":643,"quote":"A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","source_id":"quickgo.go_0097194","source_sha256":"60e1dcce7ef95e7ba6230625e3119c231f572579c588f283afcea4c4b14a0f1f","start":127}],"target_id":"concept.go.go0097194","target_kind":"node","target_sha256":"a4baa00f38d3eda148b9ccb25deb96e043be7c0f21e3e2ea2bb689b7024e76b9"}],"concept.go.go0097207":[{"id":"assertion.concept.go.go0097207","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bud dormancy process as defined in the captured Gene Ontology term GO:0097207","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bud dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","support":[{"end":504,"quote":"A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","source_id":"quickgo.go_0097207","source_sha256":"54a63c4994d103a3488a4e29c56851182a0aca3e66aef65a166b9b4c654dfe94","start":119}],"target_id":"concept.go.go0097207","target_kind":"node","target_sha256":"d1b2b92db62d78ff65247f3453bad7fbfd3d335b88117504084d32a77467e217"}],"concept.go.go0097242":[{"id":"assertion.concept.go.go0097242","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"amyloid-beta clearance as defined in the captured Gene Ontology term GO:0097242","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines amyloid-beta clearance as: The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","support":[{"end":246,"quote":"The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","source_id":"quickgo.go_0097242","source_sha256":"92dca002843929618f2f3039034d944505b1ad9a3831514051a32fc811bf91fd","start":121}],"target_id":"concept.go.go0097242","target_kind":"node","target_sha256":"53c51f9dda9c275ac27709ff7ef880ef435d32f4149e6095fa36bb1f45730aa3"}],"concept.go.go0097528":[{"id":"assertion.concept.go.go0097528","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"execution phase of necroptosis as defined in the captured Gene Ontology term GO:0097528","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of necroptosis as: A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","support":[{"end":671,"quote":"A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","source_id":"quickgo.go_0097528","source_sha256":"e877a485212308e5cb5437af22140a8a5e61ec5044cffb1aeaf01f586cc00562","start":129}],"target_id":"concept.go.go0097528","target_kind":"node","target_sha256":"69756edd5704f082f3e58160105a55e61a19e0d46c9b37eb9021816525dca0c7"}],"concept.go.go0097562":[{"id":"assertion.concept.go.go0097562","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"left lateral basal body pair as defined in the captured Gene Ontology term GO:0097562","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines left lateral basal body pair as: Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","support":[{"end":329,"quote":"Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","source_id":"quickgo.go_0097562","source_sha256":"5df605beef2115f946ab7de6f13deb4af6645a5e74648fbd0ece1b2a47b92dd8","start":127}],"target_id":"concept.go.go0097562","target_kind":"node","target_sha256":"c952b23b203dd2d43c39b82a2e0bf7a559bb0e04e902f71876a937d2f065e461"}],"concept.go.go0097593":[{"id":"assertion.concept.go.go0097593","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc microtubule array as defined in the captured Gene Ontology term GO:0097593","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc microtubule array as: A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","support":[{"end":396,"quote":"A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","source_id":"quickgo.go_0097593","source_sha256":"9e6423264e99d7803a0f38b4006e402f9f801835712fcea1d39653d496b1f5cd","start":129}],"target_id":"concept.go.go0097593","target_kind":"node","target_sha256":"a2abcc4edb7f8f67384afe30d6327bebebfd44aa4499217ad738d6d885d13b35"}],"concept.go.go0097594":[{"id":"assertion.concept.go.go0097594","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc dorsal microribbon as defined in the captured Gene Ontology term GO:0097594","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc dorsal microribbon as: Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","support":[{"end":559,"quote":"Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","source_id":"quickgo.go_0097594","source_sha256":"491987ac02d40ddf2e5ae4b996e506800a5c2af5717c5ae32a0941963e44db87","start":130}],"target_id":"concept.go.go0097594","target_kind":"node","target_sha256":"8cf0acc677160317deb7f7b13a79a884d461c91829bc2e4d8b89f7c2da0afb12"}],"concept.go.go0097595":[{"id":"assertion.concept.go.go0097595","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc crossbridge as defined in the captured Gene Ontology term GO:0097595","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc crossbridge as: Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","support":[{"end":291,"quote":"Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","source_id":"quickgo.go_0097595","source_sha256":"6fb3d47ed852309fc393769fb73e79a6f102785e36b1964d00226dd173b10f71","start":123}],"target_id":"concept.go.go0097595","target_kind":"node","target_sha256":"c480278079bd039374ee9cb39edb517d3576dbf815d195346ce36b2b0f7fad83"}],"concept.go.go0097596":[{"id":"assertion.concept.go.go0097596","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ventral disc supernumerary microtubule array as defined in the captured Gene Ontology term GO:0097596","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc supernumerary microtubule array as: A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","support":[{"end":303,"quote":"A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","source_id":"quickgo.go_0097596","source_sha256":"671f868ac579dc22dceaf16849f8840f6c955324fa2eaacd74234f441557f1a9","start":143}],"target_id":"concept.go.go0097596","target_kind":"node","target_sha256":"6957234a32c6c1e8a416733619a7e8d64a1244435c3cdc504b0c3eb9f4d7c032"}],"concept.go.go0097614":[{"id":"assertion.concept.go.go0097614","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dinoflagellate hypocone as defined in the captured Gene Ontology term GO:0097614","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate hypocone as: The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","support":[{"end":293,"quote":"The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","source_id":"quickgo.go_0097614","source_sha256":"e77f35c34b886e5febadc78a4c8a661f7cd381b499b5df2874f851bf0849e2df","start":122}],"target_id":"concept.go.go0097614","target_kind":"node","target_sha256":"85e4922c2600e2346cce5f9392dbefc27364362786a6686974ef38a7b1c3a0fe"}],"concept.go.go0097683":[{"id":"assertion.concept.go.go0097683","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"dinoflagellate apex as defined in the captured Gene Ontology term GO:0097683","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate apex as: The anterior most point of a dinoflagellate epicone.","support":[{"end":170,"quote":"The anterior most point of a dinoflagellate epicone.","source_id":"quickgo.go_0097683","source_sha256":"4eec81dc89e4581fdcccc1c1385040d7fcd1d8c975da39d94ebb3bc7109a2b57","start":118}],"target_id":"concept.go.go0097683","target_kind":"node","target_sha256":"8dfbb88a77d0fd74a1b10a4f31d559a6a57599ae0e478801f0fd24dac696436e"}],"concept.go.go0097722":[{"id":"assertion.concept.go.go0097722","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm motility as defined in the captured Gene Ontology term GO:0097722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm motility as: Any process involved in the controlled movement of a sperm cell.","support":[{"end":177,"quote":"Any process involved in the controlled movement of a sperm cell.","source_id":"quickgo.go_0097722","source_sha256":"ced5a3c24f182cf9df97c3296b8a275c938b4b0cd1c0c549a7ba0344afaa5e0b","start":113}],"target_id":"concept.go.go0097722","target_kind":"node","target_sha256":"725ca8f6546fffd188e04eed5a4f5835e3191dcf85f4a48441d2bef3bb92544a"}],"concept.go.go0097737":[{"id":"assertion.concept.go.go0097737","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acquisition of mycelium reproductive competence as defined in the captured Gene Ontology term GO:0097737","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of mycelium reproductive competence as: A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","support":[{"end":327,"quote":"A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","source_id":"quickgo.go_0097737","source_sha256":"79a2c7249fd67a7a169e08f08a79928cfbfa07b7d87576c86b4d2aee453e4aa8","start":146}],"target_id":"concept.go.go0097737","target_kind":"node","target_sha256":"9094eebd35c30e05052fed459aa5f24fe38ca8d2a745536596cc6999b9688ecc"}],"concept.go.go0097751":[{"id":"assertion.concept.go.go0097751","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spore-bearing structure formation as defined in the captured Gene Ontology term GO:0097751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore-bearing structure formation as: The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","support":[{"end":263,"quote":"The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","source_id":"quickgo.go_0097751","source_sha256":"8c3db0fa62473394ba7d92d4fdd549b642c34e0e59819945ff27de31387589fb","start":132}],"target_id":"concept.go.go0097751","target_kind":"node","target_sha256":"d418741ee6622cdee222d9ad86801b688ad4eb8efec270d1923f4e5662c3b527"}],"concept.go.go0098003":[{"id":"assertion.concept.go.go0098003","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tail assembly as defined in the captured Gene Ontology term GO:0098003","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tail assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail.","support":[{"end":212,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus tail.","source_id":"quickgo.go_0098003","source_sha256":"27f725be9432af172a39d69cc2bdc1ceeb534ccb71972c435e3b9f81657848f5","start":118}],"target_id":"concept.go.go0098003","target_kind":"node","target_sha256":"070d2b10e8b2e2c991f20c616bac29424a11ef8ef5dc257e0119f7e3dbcd139c"}],"concept.go.go0098004":[{"id":"assertion.concept.go.go0098004","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail fiber assembly as defined in the captured Gene Ontology term GO:0098004","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail fiber assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","support":[{"end":224,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","source_id":"quickgo.go_0098004","source_sha256":"3a135a8980cc4973fcd33c4215477eed80f913b2389bf51ecddb14600092e247","start":124}],"target_id":"concept.go.go0098004","target_kind":"node","target_sha256":"c0246a7593e25ce8e0dededd9764a6a6a6b6f9102f52af1e68ee9cf207ff8e09"}],"concept.go.go0098005":[{"id":"assertion.concept.go.go0098005","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral head-tail joining as defined in the captured Gene Ontology term GO:0098005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral head-tail joining as: Process by which virus heads and tails are attached to each other.","support":[{"end":188,"quote":"Process by which virus heads and tails are attached to each other.","source_id":"quickgo.go_0098005","source_sha256":"b7ce7f1991b1e12580161b50027324a86da95d7f20c2b8cb303fea7651063374","start":122}],"target_id":"concept.go.go0098005","target_kind":"node","target_sha256":"591391719f5bd98cfad55e6569baf424f8cc3a51cd8c01e19f20b6341eb77ead"}],"concept.go.go0098015":[{"id":"assertion.concept.go.go0098015","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail as defined in the captured Gene Ontology term GO:0098015","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail as: Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","support":[{"end":236,"quote":"Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","source_id":"quickgo.go_0098015","source_sha256":"0b68654ffa5e881c3719587152e39ff4b9f3382d437464d3eb9c3b7d7084c808","start":109}],"target_id":"concept.go.go0098015","target_kind":"node","target_sha256":"09317d5357cf566355158fbf1f8b3ca387fd7584cb5b83254fa6eb7254bcb831"}],"concept.go.go0098021":[{"id":"assertion.concept.go.go0098021","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid, decoration as defined in the captured Gene Ontology term GO:0098021","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, decoration as: Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","support":[{"end":274,"quote":"Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","source_id":"quickgo.go_0098021","source_sha256":"649927c2f608192eff8f492c2e4b052671d4233f9751274d2611a1d582de5b6c","start":123}],"target_id":"concept.go.go0098021","target_kind":"node","target_sha256":"98ff17cf5bdce7ff0a796e5624f4c918e2aba88842479d1686f130b6b831ebf6"}],"concept.go.go0098023":[{"id":"assertion.concept.go.go0098023","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, tip as defined in the captured Gene Ontology term GO:0098023","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tip as: The basal end of the virus tail, which is used by the virus to attach to the host cell.","support":[{"end":201,"quote":"The basal end of the virus tail, which is used by the virus to attach to the host cell.","source_id":"quickgo.go_0098023","source_sha256":"787598e89112e9990392c4550b4a092a0b476bfef50494b955d9de42c88b155d","start":114}],"target_id":"concept.go.go0098023","target_kind":"node","target_sha256":"5fbccd6467169fd970ab477cf8b3c60109dd474524ee24db955d5c29729cdbbf"}],"concept.go.go0098024":[{"id":"assertion.concept.go.go0098024","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, fiber as defined in the captured Gene Ontology term GO:0098024","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, fiber as: The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","support":[{"end":205,"quote":"The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","source_id":"quickgo.go_0098024","source_sha256":"6a440cfee0c1b6dbec64ff155829415867c7747b7e392691a11324dbfc0285a7","start":116}],"target_id":"concept.go.go0098024","target_kind":"node","target_sha256":"c42a86a785142ecf6a2e0b3900b23fd259a32562bbff6326654066b774f5417d"}],"concept.go.go0098025":[{"id":"assertion.concept.go.go0098025","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, baseplate as defined in the captured Gene Ontology term GO:0098025","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, baseplate as: Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","support":[{"end":236,"quote":"Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","source_id":"quickgo.go_0098025","source_sha256":"9e81e37f9b5c2dc9fe2516292b11112ab002726a12c32fb556df53b44c5e9572","start":120}],"target_id":"concept.go.go0098025","target_kind":"node","target_sha256":"c800978f8ea97997a18dade35b1fc76d12bb11ab671452162af18bba42e66b9e"}],"concept.go.go0098026":[{"id":"assertion.concept.go.go0098026","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, tube as defined in the captured Gene Ontology term GO:0098026","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tube as: The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","support":[{"end":238,"quote":"The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","source_id":"quickgo.go_0098026","source_sha256":"2df12f7543899ab593c148ed704c4554201994f2af774a8414b9c88d2ba0ba9e","start":115}],"target_id":"concept.go.go0098026","target_kind":"node","target_sha256":"f504f4899798acd66d0c17d6fe91515647abfd8a70fe7a11a898a7f2e4c9f472"}],"concept.go.go0098027":[{"id":"assertion.concept.go.go0098027","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, sheath as defined in the captured Gene Ontology term GO:0098027","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, sheath as: The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","support":[{"end":254,"quote":"The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","source_id":"quickgo.go_0098027","source_sha256":"8f875ea45b26d6c4d522d74b992d3ab8c0564ea9e911fc075b4835f2024cb381","start":117}],"target_id":"concept.go.go0098027","target_kind":"node","target_sha256":"02d0f8654e333694754ba207cca5851cd4949526bf2f534e2d1de07d5e3dd701"}],"concept.go.go0098028":[{"id":"assertion.concept.go.go0098028","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus tail, shaft as defined in the captured Gene Ontology term GO:0098028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, shaft as: The tube of the non-contractile tails of some viruses.","support":[{"end":170,"quote":"The tube of the non-contractile tails of some viruses.","source_id":"quickgo.go_0098028","source_sha256":"26cff83aa940b3aa40b4eabfa043e844a496f7b3a5079af8f02288e7fe86a309","start":116}],"target_id":"concept.go.go0098028","target_kind":"node","target_sha256":"5c2a3bacb570d8cddc6f6b7441ce0cf8f642efca59475a423569f4378be3aa65"}],"concept.go.go0098029":[{"id":"assertion.concept.go.go0098029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, spike as defined in the captured Gene Ontology term GO:0098029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, spike as: A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","support":[{"end":231,"quote":"A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","source_id":"quickgo.go_0098029","source_sha256":"9f9459c3e5df4bb0a0f9e20e701bc6e8807a6da4cacb0920e46708fac8c6ff59","start":130}],"target_id":"concept.go.go0098029","target_kind":"node","target_sha256":"2f719400e0234524e194c86eee8db7f037e960e901e678e5c73e341542af57bc"}],"concept.go.go0098030":[{"id":"assertion.concept.go.go0098030","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, neck as defined in the captured Gene Ontology term GO:0098030","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, neck as: A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","support":[{"end":250,"quote":"A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","source_id":"quickgo.go_0098030","source_sha256":"49803f3ca15c7a162cb1dd8e97524e2d14a6ce08d63b44367aef1ac6d87d5ae8","start":129}],"target_id":"concept.go.go0098030","target_kind":"node","target_sha256":"6b4a08c3e5a8f3cf5b65324a160d38f138d595fa946d70abd03f2213ce2cbfa9"}],"concept.go.go0098031":[{"id":"assertion.concept.go.go0098031","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"icosahedral viral capsid, collar as defined in the captured Gene Ontology term GO:0098031","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, collar as: A small disk located at the base of some icosahedral virus capsids.","support":[{"end":198,"quote":"A small disk located at the base of some icosahedral virus capsids.","source_id":"quickgo.go_0098031","source_sha256":"97ed9bbf5a897e0e64dd9cf8311022b9ce7d266647521d9c61f3fbe63fc6e45e","start":131}],"target_id":"concept.go.go0098031","target_kind":"node","target_sha256":"4c0292a3088219bc854237c47d4dfc95c92dd922fdb7620f1112f84cd9f05a9f"}],"concept.go.go0098045":[{"id":"assertion.concept.go.go0098045","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus baseplate assembly as defined in the captured Gene Ontology term GO:0098045","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus baseplate assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","support":[{"end":222,"quote":"The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","source_id":"quickgo.go_0098045","source_sha256":"0e921c37d190e4cd6583cd38acc937a4b98d2dc595d2372ec04cbb5a6d9cb75d","start":123}],"target_id":"concept.go.go0098045","target_kind":"node","target_sha256":"288e8848e48d087e5572da72fc5ab67b0e713eea103325a85c4a924ffb4d2032"}],"concept.go.go0098061":[{"id":"assertion.concept.go.go0098061","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral capsid, internal space as defined in the captured Gene Ontology term GO:0098061","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, internal space as: The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","support":[{"end":247,"quote":"The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","source_id":"quickgo.go_0098061","source_sha256":"9778a8a1dfafc5e26ea75d622a9df6fedb289f496381bc0fe56039c3866f78dd","start":127}],"target_id":"concept.go.go0098061","target_kind":"node","target_sha256":"440f48d8ba772a0d69c0859962c52058e64668f254fec7f68054e97cbc3e1e32"}],"concept.go.go0098669":[{"id":"assertion.concept.go.go0098669","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"superinfection exclusion as defined in the captured Gene Ontology term GO:0098669","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines superinfection exclusion as: The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","support":[{"end":350,"quote":"The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","source_id":"quickgo.go_0098669","source_sha256":"69ea5ccfc982103f3521e19e9ac6d9a4e77e557f9e007d665fac18b4a8c568fe","start":123}],"target_id":"concept.go.go0098669","target_kind":"node","target_sha256":"a3c85f8c85f5791324d9d7702d912855a7a926fcb0e041cfe199494e95444b04"}],"concept.go.go0098677":[{"id":"assertion.concept.go.go0098677","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virion maturation as defined in the captured Gene Ontology term GO:0098677","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion maturation as: Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","support":[{"end":372,"quote":"Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","source_id":"quickgo.go_0098677","source_sha256":"fba7a5341084fbbfe08ea93c1632a4628956d57326366f24c4601266a741a006","start":116}],"target_id":"concept.go.go0098677","target_kind":"node","target_sha256":"f21994f877467414112b637620faed19f0b8926da5b7bd0b383046a64ddafd0b"}],"concept.go.go0098678":[{"id":"assertion.concept.go.go0098678","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral tropism switching as defined in the captured Gene Ontology term GO:0098678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tropism switching as: A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","support":[{"end":312,"quote":"A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","source_id":"quickgo.go_0098678","source_sha256":"9a75035b2cb814b5eb59dc5b5a751c976f0fbea0b5b41c356a82cb7de78717af","start":122}],"target_id":"concept.go.go0098678","target_kind":"node","target_sha256":"b27281e125b5d3a2b81dd2633d27d8b875e63de9818e86827f170f0b340fb05a"}],"concept.go.go0098689":[{"id":"assertion.concept.go.go0098689","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"latency-replication decision as defined in the captured Gene Ontology term GO:0098689","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines latency-replication decision as: The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","support":[{"end":444,"quote":"The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","source_id":"quickgo.go_0098689","source_sha256":"2b4b9a2a227682029eb919ee0ec6ff780ec47f660adc3bdc648e29d77b51d4da","start":127}],"target_id":"concept.go.go0098689","target_kind":"node","target_sha256":"4d5d225c99a9870fe2567b05603c4133cd20e7e49b1ecc096ae60b0dc964c238"}],"concept.go.go0098743":[{"id":"assertion.concept.go.go0098743","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell aggregation as defined in the captured Gene Ontology term GO:0098743","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell aggregation as: The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","support":[{"end":357,"quote":"The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","source_id":"quickgo.go_0098743","source_sha256":"8142d8fddca5ccaebabf8747479ed4830c9d5cdac9e97aadce4d41f3195b2f3e","start":115}],"target_id":"concept.go.go0098743","target_kind":"node","target_sha256":"daa3bee154f3b7f8fedbad917dfcef08262100d76f43b2a0251d4452b122ec49"}],"concept.go.go0098754":[{"id":"assertion.concept.go.go0098754","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification as defined in the captured Gene Ontology term GO:0098754","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification as: Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","support":[{"end":348,"quote":"Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","source_id":"quickgo.go_0098754","source_sha256":"96bc3c6602ebcb0b8d37232ec2126fa6a204a671c33ce914894d5fe49eeaee35","start":113}],"target_id":"concept.go.go0098754","target_kind":"node","target_sha256":"3f5c71bb72d4c646e5b0f77a163aecb86c44aac9bc34d04069ff095da19ddad8"}],"concept.go.go0098843":[{"id":"assertion.concept.go.go0098843","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"postsynaptic endocytic zone as defined in the captured Gene Ontology term GO:0098843","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines postsynaptic endocytic zone as: A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","support":[{"end":291,"quote":"A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","source_id":"quickgo.go_0098843","source_sha256":"b439c5f1c132dc642ca0525aa3dc6a99c1b006d3e69d6f83ece79c9e1bb1dbc4","start":126}],"target_id":"concept.go.go0098843","target_kind":"node","target_sha256":"0291d9b2968a272ce53221b3f81327bc0eac55b1a0316478ad7235a9fd799004"}],"concept.go.go0098862":[{"id":"assertion.concept.go.go0098862","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cluster of actin-based cell projections as defined in the captured Gene Ontology term GO:0098862","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cluster of actin-based cell projections as: A cell part consisting of multiple, closely packed actin-based cell projections.","support":[{"end":218,"quote":"A cell part consisting of multiple, closely packed actin-based cell projections.","source_id":"quickgo.go_0098862","source_sha256":"a782165171d7f546a55d7779a5661ec268b5e15d8ac0c4565d5a9844e1e89061","start":138}],"target_id":"concept.go.go0098862","target_kind":"node","target_sha256":"726b9b475b8e73f1512c6a4fb9016d2934cd39a85d4e6eb278a21be9c66fa697"}],"concept.go.go0099009":[{"id":"assertion.concept.go.go0099009","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"viral genome circularization as defined in the captured Gene Ontology term GO:0099009","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome circularization as: The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","support":[{"end":578,"quote":"The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","source_id":"quickgo.go_0099009","source_sha256":"f186b0867d82c71d8c2b0eeaaef778c48a04b35e2b2d8448c56ae2d40ba0451e","start":127}],"target_id":"concept.go.go0099009","target_kind":"node","target_sha256":"50be01caeeda6cd43f88c4ea242982fe20647c644f80bd11c537074967747198"}],"concept.go.go0099079":[{"id":"assertion.concept.go.go0099079","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"actin body as defined in the captured Gene Ontology term GO:0099079","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin body as: An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","support":[{"end":436,"quote":"An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","source_id":"quickgo.go_0099079","source_sha256":"673ebccf05bb91629e74afe69a0e22628e61399aeffcd7b21cea355c0316fe11","start":109}],"target_id":"concept.go.go0099079","target_kind":"node","target_sha256":"c831f6ded84ded5d45357d33970c6e3170d99bf03f944f2ae91b3fccd98d03b7"}],"concept.go.go0099086":[{"id":"assertion.concept.go.go0099086","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"synaptonemal structure as defined in the captured Gene Ontology term GO:0099086","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptonemal structure as: A proteinaceous scaffold found between homologous chromosomes during meiosis.","support":[{"end":198,"quote":"A proteinaceous scaffold found between homologous chromosomes during meiosis.","source_id":"quickgo.go_0099086","source_sha256":"c246967bcada69d0fede2ee886732832f5048128fef524b59e01262b9bf56a0a","start":121}],"target_id":"concept.go.go0099086","target_kind":"node","target_sha256":"6e33c37edebdb093a6463c5b309fc8d4b6049965c126404ac9bf785348a7275f"}],"concept.go.go0099120":[{"id":"assertion.concept.go.go0099120","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"socially cooperative development as defined in the captured Gene Ontology term GO:0099120","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines socially cooperative development as: The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","support":[{"end":521,"quote":"The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","source_id":"quickgo.go_0099120","source_sha256":"dd176739be797108a9c03baa00c05d427adf6fc0de55af2fc7994474c35c1936","start":131}],"target_id":"concept.go.go0099120","target_kind":"node","target_sha256":"a6de8a2d73b1c592dfeaa9429935115bda08b80a61e9e02205a0adc5a57ec216"}],"concept.go.go0099522":[{"id":"assertion.concept.go.go0099522","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cytosolic region as defined in the captured Gene Ontology term GO:0099522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosolic region as: Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","support":[{"end":215,"quote":"Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","source_id":"quickgo.go_0099522","source_sha256":"4974a16f48dea7d9b7a7a2b3df58e13f3a8f46e158168b940a35928fae969631","start":115}],"target_id":"concept.go.go0099522","target_kind":"node","target_sha256":"0918d030c040f3746aba0a2552935dfc115bf4d0f11e648492ca5d5798f5ff2d"}],"concept.go.go0106125":[{"id":"assertion.concept.go.go0106125","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reservosome matrix as defined in the captured Gene Ontology term GO:0106125","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome matrix as: A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","support":[{"end":209,"quote":"A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","source_id":"quickgo.go_0106125","source_sha256":"366fd42ee08df9064317b284b5ea46bd8ca73e1b0499f6eb6ca5ebc4371533e3","start":117}],"target_id":"concept.go.go0106125","target_kind":"node","target_sha256":"529eb224bf87b0cc322a4f7afcff141650326b4054f1fff827a2dc1ba966001c"}],"concept.go.go0106126":[{"id":"assertion.concept.go.go0106126","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reservosome membrane as defined in the captured Gene Ontology term GO:0106126","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome membrane as: The lipid bilayer surrounding a reservosome.","support":[{"end":163,"quote":"The lipid bilayer surrounding a reservosome.","source_id":"quickgo.go_0106126","source_sha256":"d3d6bcee6e1cdabfafaf7e797f0bf7d8dddba6ed4eba913825c172ddc60cce19","start":119}],"target_id":"concept.go.go0106126","target_kind":"node","target_sha256":"f3e636c56e3708155dfe72e6d6f694a5a32f9dad268c5976fa02f3574c6b80df"}],"concept.go.go0110134":[{"id":"assertion.concept.go.go0110134","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic drive as defined in the captured Gene Ontology term GO:0110134","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic drive as: A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","support":[{"end":512,"quote":"A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","source_id":"quickgo.go_0110134","source_sha256":"622def39608aded07521a3d2f278e538fd708ff3d73b9052e09635b289e75049","start":112}],"target_id":"concept.go.go0110134","target_kind":"node","target_sha256":"fd279fc0be0327fbdfcdb8a89ff4b8c03b3af6407bf4296cf582c63af5a6f312"}],"concept.go.go0110165":[{"id":"assertion.concept.go.go0110165","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular anatomical structure as defined in the captured Gene Ontology term GO:0110165","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular anatomical structure as: A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","support":[{"end":411,"quote":"A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","source_id":"quickgo.go_0110165","source_sha256":"2c54ec8478a9b47a70c11fcf7894db8a48ff25cbff8c6890d27aad42c4adbd19","start":128}],"target_id":"concept.go.go0110165","target_kind":"node","target_sha256":"26d98a6361683b1945d6de306fea679b98c661b3de3c44b04b21a2cf3d189b00"}],"concept.go.go0120082":[{"id":"assertion.concept.go.go0120082","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"smooth endoplasmic reticulum cisterna as defined in the captured Gene Ontology term GO:0120082","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines smooth endoplasmic reticulum cisterna as: A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","support":[{"end":258,"quote":"A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","source_id":"quickgo.go_0120082","source_sha256":"0b1c15f3753422acd3f31ebcf9c9c18bcaa8e2a17fe2931ee9858ec757bc1db0","start":136}],"target_id":"concept.go.go0120082","target_kind":"node","target_sha256":"0575a6eb80ae5234e58c0345547841ff8d8fe2fe6ab8b29629d85a1e799f9ea3"}],"concept.go.go0120102":[{"id":"assertion.concept.go.go0120102","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"bacterial-type flagellum secretion apparatus as defined in the captured Gene Ontology term GO:0120102","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum secretion apparatus as: A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","support":[{"end":566,"quote":"A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","source_id":"quickgo.go_0120102","source_sha256":"5f1f1bb1eb27003c98aaf249d55f0039b3dbe7923c201209cb6711878a753cf5","start":143}],"target_id":"concept.go.go0120102","target_kind":"node","target_sha256":"7edbdb18c75fdfbd08cc075686236feae935c86a419035e30d19db2983d0b61c"}],"concept.go.go0120104":[{"id":"assertion.concept.go.go0120104","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic actomyosin contractile ring, proximal layer as defined in the captured Gene Ontology term GO:0120104","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic actomyosin contractile ring, proximal layer as: The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","support":[{"end":267,"quote":"The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","source_id":"quickgo.go_0120104","source_sha256":"d9ac41bf215e32d99677ef91a4bcfde554c81af2efae17c6aa3633035e72fd7a","start":150}],"target_id":"concept.go.go0120104","target_kind":"node","target_sha256":"39b44c24efee1f9612f3a75364e18c3afd5d7e32939d907b1f9ae99b9d384b69"}],"concept.go.go0120135":[{"id":"assertion.concept.go.go0120135","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"distal portion of axoneme as defined in the captured Gene Ontology term GO:0120135","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal portion of axoneme as: The portion of the axoneme that is close to the tip of the cilium.","support":[{"end":190,"quote":"The portion of the axoneme that is close to the tip of the cilium.","source_id":"quickgo.go_0120135","source_sha256":"2539189376d3cd08aeaea1f1192fb6e124a3d21792a6a2a7ce1257f5fb3a1215","start":124}],"target_id":"concept.go.go0120135","target_kind":"node","target_sha256":"6a6af5a426cbe9f004f0d64559d43fc6d10239741fa423d2547b290fbfd5dd5a"}],"concept.go.go0120212":[{"id":"assertion.concept.go.go0120212","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sperm head-tail coupling apparatus as defined in the captured Gene Ontology term GO:0120212","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm head-tail coupling apparatus as: A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","support":[{"end":293,"quote":"A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","source_id":"quickgo.go_0120212","source_sha256":"aa1e6c3235028fa698d4595a9d1e3ddcf6725aefb0670ab1d6993aa60949c643","start":133}],"target_id":"concept.go.go0120212","target_kind":"node","target_sha256":"c254d18e014a71fd5f0efe4ad4a5bfe046930f9f621ddd09183c64130381ff71"}],"concept.go.go0120312":[{"id":"assertion.concept.go.go0120312","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary basal body segregation as defined in the captured Gene Ontology term GO:0120312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary basal body segregation as: The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","support":[{"end":430,"quote":"The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","source_id":"quickgo.go_0120312","source_sha256":"df84e12742f0d132a8021c9d8dfc820ed1af9162f3de8a87efebc4f5ad90b054","start":129}],"target_id":"concept.go.go0120312","target_kind":"node","target_sha256":"a9fcdc2c512a3f03b6a27baf0cb666a855250d900e417422d9c315fdb624a71f"}],"concept.go.go0120318":[{"id":"assertion.concept.go.go0120318","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"olfactory sociosexual communication as defined in the captured Gene Ontology term GO:0120318","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines olfactory sociosexual communication as: The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","support":[{"end":419,"quote":"The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","source_id":"quickgo.go_0120318","source_sha256":"c38729445b1d24c0b802fcd0410e03fbb56d14c307a33704e0d9d981b04a4e3b","start":134}],"target_id":"concept.go.go0120318","target_kind":"node","target_sha256":"288127ca68f1ac7294d4dbdc89dd737f4a94fa2403827379e06693634f041265"}],"concept.go.go0120321":[{"id":"assertion.concept.go.go0120321","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nuclear envelope adjacent to nuclear pore complex as defined in the captured Gene Ontology term GO:0120321","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear envelope adjacent to nuclear pore complex as: The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","support":[{"end":237,"quote":"The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","source_id":"quickgo.go_0120321","source_sha256":"165fd2302031b9324ea97312753415c041d5bb1c4144cd557640b94aae8535b0","start":148}],"target_id":"concept.go.go0120321","target_kind":"node","target_sha256":"06eaa0257d3e0f3eaf4bd92322b11b9877d840c9c55dd9e943eec1e485e94505"}],"concept.go.go0140029":[{"id":"assertion.concept.go.go0140029","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"exocytic process as defined in the captured Gene Ontology term GO:0140029","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines exocytic process as: The cellular processes that contribute to exocytosis.","support":[{"end":168,"quote":"The cellular processes that contribute to exocytosis.","source_id":"quickgo.go_0140029","source_sha256":"00a10a720271f5214b0e5ed9b5b37317e44cdce3f3aff320559a687ec19db089","start":115}],"target_id":"concept.go.go0140029","target_kind":"node","target_sha256":"22b20342e750704c7be48f19f8c9d2f33ce196acf8d733cbf08628a45e77f86a"}],"concept.go.go0140106":[{"id":"assertion.concept.go.go0140106","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"hematophagy as defined in the captured Gene Ontology term GO:0140106","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines hematophagy as: A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","support":[{"end":481,"quote":"A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","source_id":"quickgo.go_0140106","source_sha256":"2ae0936dde03a6c679ee824186575764fe4392f666d0ce3e4df26a8ccd90a7d5","start":110}],"target_id":"concept.go.go0140106","target_kind":"node","target_sha256":"aee0585cddb59177f8c7e70d156d31e7a2f090c92bebbf5cb6d4d9afc6744c7d"}],"concept.go.go0140253":[{"id":"assertion.concept.go.go0140253","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cell-cell fusion as defined in the captured Gene Ontology term GO:0140253","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell-cell fusion as: A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","support":[{"end":358,"quote":"A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","source_id":"quickgo.go_0140253","source_sha256":"0e754320bfc9b0f8432b11315925054a0a01ff8190c73eefc73719263bb0e867","start":115}],"target_id":"concept.go.go0140253","target_kind":"node","target_sha256":"0b65ef76f328432519800aafc4f3f74c2fc487a5e342e592973c1336d2ae6a9a"}],"concept.go.go0140352":[{"id":"assertion.concept.go.go0140352","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"export from cell as defined in the captured Gene Ontology term GO:0140352","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines export from cell as: The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","support":[{"end":273,"quote":"The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","source_id":"quickgo.go_0140352","source_sha256":"115eb6b28adc6d33ec24cd50337b5976291f1cbb5b5045962f1a131c0f8804d7","start":115}],"target_id":"concept.go.go0140352","target_kind":"node","target_sha256":"a4c2e441d457253410170f4f87186c71ca4366ab1a3056535f459638137679f0"}],"concept.go.go0140511":[{"id":"assertion.concept.go.go0140511","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic nuclear bridge stalk as defined in the captured Gene Ontology term GO:0140511","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge stalk as: Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","support":[{"end":312,"quote":"Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","source_id":"quickgo.go_0140511","source_sha256":"3b9016c7879ef6ec80e2082924025591e7d0089dd1c074e97573ab629e45dee2","start":127}],"target_id":"concept.go.go0140511","target_kind":"node","target_sha256":"1d25a34e2c50da518485cd02e09f5f116ef597190c5bb5d498d7275c7b1e7ab7"}],"concept.go.go0140547":[{"id":"assertion.concept.go.go0140547","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"acquisition of seed longevity as defined in the captured Gene Ontology term GO:0140547","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of seed longevity as: The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","support":[{"end":494,"quote":"The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","source_id":"quickgo.go_0140547","source_sha256":"15c6ba2b80ecdb30a4a3b6cb1017a79144735ec4d958ce18886150de8ed1c28c","start":128}],"target_id":"concept.go.go0140547","target_kind":"node","target_sha256":"94e36c78119ef2004cbb137a5fd3ef58bd435bde789757ef2afd847a28b53f41"}],"concept.go.go0140599":[{"id":"assertion.concept.go.go0140599","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"mitotic nuclear bridge midzone membrane domain as defined in the captured Gene Ontology term GO:0140599","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge midzone membrane domain as: A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","support":[{"end":293,"quote":"A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","source_id":"quickgo.go_0140599","source_sha256":"b0cd43c4de9602f62238ca72601619e39d3ffcb9fd2116be6dfb46d552e10a06","start":145}],"target_id":"concept.go.go0140599","target_kind":"node","target_sha256":"382b7e00c90b37d64fb2e73a0415c6c8e2aae5595c74493cc41aee37c946b823"}],"concept.go.go0140725":[{"id":"assertion.concept.go.go0140725","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of free heme as defined in the captured Gene Ontology term GO:0140725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of free heme as: Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","support":[{"end":319,"quote":"Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","source_id":"quickgo.go_0140725","source_sha256":"58269d185f9ed24b95d0a7fee5eae8f7e7d55a5477b4559fb027e5ba8a472769","start":126}],"target_id":"concept.go.go0140725","target_kind":"node","target_sha256":"8c8c4f8fb70c2f6a5adde16a5063834af966228a9ea43a08bf422cc27aa49818"}],"concept.go.go0140729":[{"id":"assertion.concept.go.go0140729","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"detoxification of endogenously produced metabolite as defined in the captured Gene Ontology term GO:0140729","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of endogenously produced metabolite as: A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","support":[{"end":387,"quote":"A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","source_id":"quickgo.go_0140729","source_sha256":"dd3504cc30eb33a4fa357b80a377d28b6b3f0f4cbef442f3121c37aad9c9f52c","start":149}],"target_id":"concept.go.go0140729","target_kind":"node","target_sha256":"ad0e88aba8f35d1c77ecd8e82b9d4c71ba7ed659f6206d316449df6515f29f6d"}],"concept.go.go0140755":[{"id":"assertion.concept.go.go0140755","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reorganization of host cellular membranes to establish sites of replication as defined in the captured Gene Ontology term GO:0140755","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reorganization of host cellular membranes to establish sites of replication as: A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","support":[{"end":377,"quote":"A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","source_id":"quickgo.go_0140755","source_sha256":"1200f2763e9219793667502c65220b6d9e81977c7a30206ec5f5236dad610c56","start":174}],"target_id":"concept.go.go0140755","target_kind":"node","target_sha256":"a0cb1b19bb04f232b294642e93e796fc85a7cd389a8601fad5b3a42957ba0be3"}],"concept.go.go0140918":[{"id":"assertion.concept.go.go0140918","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"centrosomal core as defined in the captured Gene Ontology term GO:0140918","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines centrosomal core as: The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","support":[{"end":345,"quote":"The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","source_id":"quickgo.go_0140918","source_sha256":"3383c60a1e25c882eb71bf6a90f0bd74f2ee9b652b066a33d4983d159fa9c4f7","start":115}],"target_id":"concept.go.go0140918","target_kind":"node","target_sha256":"a3401c576c339f6bd96ee0ae9b8c23e48a4a8af600a238ec613be9690c742cac"}],"concept.go.go0141060":[{"id":"assertion.concept.go.go0141060","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"disruption of anatomical structure in another organism as defined in the captured Gene Ontology term GO:0141060","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines disruption of anatomical structure in another organism as: The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","support":[{"end":276,"quote":"The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","source_id":"quickgo.go_0141060","source_sha256":"77cfd7be56a2625d89501884471ecffc65f49c003f63420935ae5d541416a0e5","start":153}],"target_id":"concept.go.go0141060","target_kind":"node","target_sha256":"4181202d8070eb2fab7d22ce983b216bc3ddac6523a369d7edf4a8234d669b47"}],"concept.go.go0150034":[{"id":"assertion.concept.go.go0150034","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"distal axon as defined in the captured Gene Ontology term GO:0150034","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal axon as: That part of an axon close to and including the growth cone or the axon terminus.","support":[{"end":191,"quote":"That part of an axon close to and including the growth cone or the axon terminus.","source_id":"quickgo.go_0150034","source_sha256":"ee166d4fa6500f772b17cf542ccbcbc4f0cb8997ba3664fc0b2b7e9803827502","start":110}],"target_id":"concept.go.go0150034","target_kind":"node","target_sha256":"1abd67c7971f7767bdc96bfcf8022ac7eb8f1b9babc6579fa1723d2552661f5c"}],"concept.go.go0160266":[{"id":"assertion.concept.go.go0160266","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anestrus phase as defined in the captured Gene Ontology term GO:0160266","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines anestrus phase as: A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","support":[{"end":410,"quote":"A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","source_id":"quickgo.go_0160266","source_sha256":"a92d2fce9d45b6ce243cb7519a9dae14676f8e6c838078d55a9977e6bf08b61c","start":113}],"target_id":"concept.go.go0160266","target_kind":"node","target_sha256":"bb1e97d0ab32f0ec568c027667310182511637a462d64d9e2393379000afc0a6"}],"concept.go.go0170047":[{"id":"assertion.concept.go.go0170047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"virus-like capsid as defined in the captured Gene Ontology term GO:0170047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus-like capsid as: A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","support":[{"end":512,"quote":"A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","source_id":"quickgo.go_0170047","source_sha256":"9ebd6be3dd11597c08af85f51b9c4c5a92b3a0320e28be08000de9058908f3c5","start":116}],"target_id":"concept.go.go0170047","target_kind":"node","target_sha256":"3e1058325dc891b4367d106a25a0ec2ead66d08a792c525cfe12319c8634cab8"}],"concept.go.go0170062":[{"id":"assertion.concept.go.go0170062","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nutrient storage as defined in the captured Gene Ontology term GO:0170062","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nutrient storage as: The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","support":[{"end":386,"quote":"The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","source_id":"quickgo.go_0170062","source_sha256":"6bc73afefd616853e3625b42de2aef0aa8e870f12a4fe0c125351e42d4b670b5","start":115}],"target_id":"concept.go.go0170062","target_kind":"node","target_sha256":"4a6fbcd3fe9995cb77d1fc7c3ead1f1a0daee6b0d744cc2922efb02b8e5ed355"}],"concept.go.go1903046":[{"id":"assertion.concept.go.go1903046","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"meiotic cell cycle process as defined in the captured Gene Ontology term GO:1903046","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle process as: A process that is part of the meiotic cell cycle.","support":[{"end":174,"quote":"A process that is part of the meiotic cell cycle.","source_id":"quickgo.go_1903046","source_sha256":"4d6d8beced2221204d88af7d8eb28cd05d20cd26988e0b59553b9eb46b7236eb","start":125}],"target_id":"concept.go.go1903046","target_kind":"node","target_sha256":"785237e6f8436c5ed2e4231e298e39280f2ab6669b0451c16987077bfe6bf2cc"}],"concept.go.go1990047":[{"id":"assertion.concept.go.go1990047","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spindle matrix as defined in the captured Gene Ontology term GO:1990047","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spindle matrix as: A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","support":[{"end":271,"quote":"A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","source_id":"quickgo.go_1990047","source_sha256":"bda166eb21e2f8b312a47d0b2a0458ce006a62aefbbd427c566c30f80732a827","start":113}],"target_id":"concept.go.go1990047","target_kind":"node","target_sha256":"96088c4b2b11b59687ef880e28667eeaeb84aab033d64f2dc0d40e03dbef1f95"}],"concept.go.go1990110":[{"id":"assertion.concept.go.go1990110","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"callus formation as defined in the captured Gene Ontology term GO:1990110","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines callus formation as: The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","support":[{"end":390,"quote":"The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","source_id":"quickgo.go_1990110","source_sha256":"0dbfcc4988efcda7a5427bebaf376348658b86eab56265abb0f5d5bd8aeb6797","start":115}],"target_id":"concept.go.go1990110","target_kind":"node","target_sha256":"3afd53a3b9a9847bcab263a6af6904746dfb65ab33ffc8422b97bb627b081464"}],"concept.go.go1990277":[{"id":"assertion.concept.go.go1990277","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"parasexual reproduction with cellular fusion as defined in the captured Gene Ontology term GO:1990277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines parasexual reproduction with cellular fusion as: A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","support":[{"end":263,"quote":"A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","source_id":"quickgo.go_1990277","source_sha256":"ef7be952e751a68bc6d969000ce513b228550d6e68637c5a534e1153b04b91a7","start":143}],"target_id":"concept.go.go1990277","target_kind":"node","target_sha256":"ff89d69ae0d685b25a0e42f7fd38d2633f940d4e429cbe0d7cf65228a3697bb1"}],"concept.go.go1990636":[{"id":"assertion.concept.go.go1990636","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"reproductive senescence as defined in the captured Gene Ontology term GO:1990636","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive senescence as: A life cycle stage during which the reproductive capacity and fitness of an organism declines.","support":[{"end":216,"quote":"A life cycle stage during which the reproductive capacity and fitness of an organism declines.","source_id":"quickgo.go_1990636","source_sha256":"b056bfc4ad8fa0afa95f82c48be2a16b75084a9061dbec503d45cf3d0078166b","start":122}],"target_id":"concept.go.go1990636","target_kind":"node","target_sha256":"b9c782afc825f9034e907b6202aac42bd0781cb677e9d3c16e6c332767b5f35a"}],"concept.go.go1990717":[{"id":"assertion.concept.go.go1990717","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axonemal central bridge as defined in the captured Gene Ontology term GO:1990717","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines axonemal central bridge as: Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","support":[{"end":265,"quote":"Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","source_id":"quickgo.go_1990717","source_sha256":"37aefa0b3b11e120f924fa26f2b57fc50ccf001ebd91b49acbaa0b20da936409","start":122}],"target_id":"concept.go.go1990717","target_kind":"node","target_sha256":"cfe9376916ce8f3bf2558dcc83d4e49733a030d823ac61d6214e1a5bb314fceb"}],"concept.go.go1990748":[{"id":"assertion.concept.go.go1990748","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cellular detoxification as defined in the captured Gene Ontology term GO:1990748","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular detoxification as: Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","support":[{"end":391,"quote":"Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","source_id":"quickgo.go_1990748","source_sha256":"44f76fa4f23992b7a4d7325247d6c09ba05ade83591dc160b097ef33616e2c43","start":122}],"target_id":"concept.go.go1990748","target_kind":"node","target_sha256":"47a1633f06ddd774bbc27cf4f7032856d7547c90a6424930b823c6bd2b933a74"}],"concept.go.go1990826":[{"id":"assertion.concept.go.go1990826","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"nucleoplasmic periphery of the nuclear pore complex as defined in the captured Gene Ontology term GO:1990826","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasmic periphery of the nuclear pore complex as: Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","support":[{"end":231,"quote":"Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","source_id":"quickgo.go_1990826","source_sha256":"868c5c562d7e48fdb580a2d10afdbbcfa743abcb8dd985a0fb59a7aeb29250b1","start":150}],"target_id":"concept.go.go1990826","target_kind":"node","target_sha256":"0950e75ff7fcbb7289bc1a5248f3ef1d1953313c2439592322caa8fc50849cc0"}],"concept.go.go1990836":[{"id":"assertion.concept.go.go1990836","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"lysosomal matrix as defined in the captured Gene Ontology term GO:1990836","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal matrix as: A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","support":[{"end":241,"quote":"A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","source_id":"quickgo.go_1990836","source_sha256":"b312282ddeb2314c1c4d11cf1c289869ebd7890787a7fd86312d8f1656ebd62b","start":115}],"target_id":"concept.go.go1990836","target_kind":"node","target_sha256":"6edf791e19d7897303a8d86e370a5ac740bd3acc1edde2919a29768d4cd782e4"}],"concept.go.go1990900":[{"id":"assertion.concept.go.go1990900","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ciliary pocket collar as defined in the captured Gene Ontology term GO:1990900","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary pocket collar as: A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","support":[{"end":355,"quote":"A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","source_id":"quickgo.go_1990900","source_sha256":"e2089cf1abebe84e67a9179048d9f990f3a36daca3d885c10e46a8bc99b7d58b","start":120}],"target_id":"concept.go.go1990900","target_kind":"node","target_sha256":"8500a7bd1f12528161c9dd571ebf012839b3b1311c941923192ae7ddd56e97e4"}],"concept.go.go7770056":[{"id":"assertion.concept.go.go7770056","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"multicellular organismal-level extracellular fluid acidification as defined in the captured Gene Ontology term GO:7770056","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level extracellular fluid acidification as: Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","support":[{"end":309,"quote":"Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","source_id":"quickgo.go_7770056","source_sha256":"77fee1c44c6a979e4bcf0e1506b1c878fd619f1450c66689aa702af5aed80fe0","start":163}],"target_id":"concept.go.go7770056","target_kind":"node","target_sha256":"53ba6bb85030c1cb7ed41b1800475eaf45752d6b5c2ae9ad4eb16bad5a94e242"}],"concept.go.go7770129":[{"id":"assertion.concept.go.go7770129","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"spermatid residual body as defined in the captured Gene Ontology term GO:7770129","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Gene Ontology (via EMBL-EBI QuickGO) defines spermatid residual body as: A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","support":[{"end":667,"quote":"A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","source_id":"quickgo.go_7770129","source_sha256":"090dbefcee1ee05c0b5de49ed683f3b6ba5f7ec0dbdeaa2b4ca92c9a7427cda6","start":122}],"target_id":"concept.go.go7770129","target_kind":"node","target_sha256":"b0f774502e2dbda094c94755365e64299b50dad1d6b3ae4d6405fc11dc2096dd"}],"concept.gravitational-phase-evolution":[{"id":"assertion.complete.concept.gravitational-phase-evolution","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gravity-induced relative phase can entangle masses.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.gravitational-phase-evolution","target_kind":"node","target_sha256":"74b1155e3f51de1f3b694c96d2148c86cf6a84cca2e4aad39f3dd8df4231bb63"}],"concept.gravity-mediated-entanglement":[{"id":"assertion.complete.concept.gravity-mediated-entanglement","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Entanglement generated through gravity.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.gravity-mediated-entanglement","target_kind":"node","target_sha256":"c7619569bc3ed8998e4ca852b8fd952301075ed6d88d526af262cb9e4ed6ec28"}],"concept.holographic-duality":[{"id":"assertion.complete.concept.holographic-duality","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In the cited AdS/CFT proposal, particular M/string-theory compactifications on Anti-de Sitter spacetimes are conjectured to be dual to conformal field theories. This record describes that proposal, without asserting a universal duality.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"concept.holographic-duality","target_kind":"node","target_sha256":"ccf70373f970b2b0ce0a0e2ddc32e663a103009e8be1f58d5fcc2fb8dc819711"}],"concept.large-n-limit":[{"id":"assertion.complete.concept.large-n-limit","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: In Maldacena's construction, the large-N limit of certain conformal field theories contains a sector describing supergravity on products of Anti-de Sitter spaces and compact manifolds.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"concept.large-n-limit","target_kind":"node","target_sha256":"7663dc53b3fcd4d06e25225a51fc7aeb27ce4642fcc1e6796bb2442634519188"}],"concept.lorentz-invariance-violation":[{"id":"assertion.complete.concept.lorentz-invariance-violation","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Energy-dependent photon propagation in some QG models.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"concept.lorentz-invariance-violation","target_kind":"node","target_sha256":"0a8d6e2c38f233396acddcd933151b609577107463803d970f7433e50e987513"}],"concept.mesh.d000024":[{"id":"assertion.concept.mesh.d000024","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Abortion, Illegal as described in the captured NLM MeSH descriptor D000024","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Abortion, Illegal as: Illegal termination of pregnancy.","support":[{"end":520,"quote":"Illegal termination of pregnancy.","source_id":"nlm-mesh.d000024","source_sha256":"a8ff40325ab8839a7c6a14d95f0bedebe6dfda09daeb91f2a907f21253b58e07","start":487}],"target_id":"concept.mesh.d000024","target_kind":"node","target_sha256":"aeb4f12de6fbe2ed3ce0f7e0a95ccf47a33eaceb78094fc8d45da9fda0b5f001"}],"concept.mesh.d000057":[{"id":"assertion.concept.mesh.d000057","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Accident Proneness as described in the captured NLM MeSH descriptor D000057","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Accident Proneness as: Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","support":[{"end":468,"quote":"Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","source_id":"nlm-mesh.d000057","source_sha256":"308034b533e8349f9cd59c33dc359175cef60b5f0941d989e5f42338600576c1","start":352}],"target_id":"concept.mesh.d000057","target_kind":"node","target_sha256":"4d2122a35fd96a278c40dbae0f14c2b5b0d1ea3069e6bd3aa3e46225600f3274"}],"concept.mesh.d000066479":[{"id":"assertion.concept.mesh.d000066479","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Criminal Behavior as described in the captured NLM MeSH descriptor D000066479","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Criminal Behavior as: Conduct leading to commission of unlawful acts.","support":[{"end":403,"quote":"Conduct leading to commission of unlawful acts.","source_id":"nlm-mesh.d000066479","source_sha256":"91143c2606644581af22414104b6ddfb16716bf7c07559e73716a387b38ffe31","start":356}],"target_id":"concept.mesh.d000066479","target_kind":"node","target_sha256":"4f890c56118f7f3c44c66b1fb9b4b7ce47f64694c1d723e46bbb7384ad7c30f5"}],"concept.mesh.d000066498":[{"id":"assertion.concept.mesh.d000066498","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotional Adjustment as described in the captured NLM MeSH descriptor D000066498","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotional Adjustment as: Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","support":[{"end":487,"quote":"Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","source_id":"nlm-mesh.d000066498","source_sha256":"1c1eaacf86e27a0845f7b8d11c5b83d20287b19ce62efabd0949abe6c428defa","start":382}],"target_id":"concept.mesh.d000066498","target_kind":"node","target_sha256":"32a00ff15d7e9c87cb62beb0076acc6fc98b3c65bf5671b79580eec7c73d57ce"}],"concept.mesh.d000066768":[{"id":"assertion.concept.mesh.d000066768","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Rehabilitation Research as described in the captured NLM MeSH descriptor D000066768","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Rehabilitation Research as: Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of REHABILITATION .","support":[{"end":512,"quote":"Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of\nREHABILITATION\n.","source_id":"nlm-mesh.d000066768","source_sha256":"04401a4af5cc028a5170b8d7c6d5aed0f8e2f95b96f9dae46f638df1438cadd7","start":376}],"target_id":"concept.mesh.d000066768","target_kind":"node","target_sha256":"c6a6c0e462f6c4f5ad11d6026622e82a8e24cac246bb2b9b29f7ca396501feb1"}],"concept.mesh.d000067448":[{"id":"assertion.concept.mesh.d000067448","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Defamation as described in the captured NLM MeSH descriptor D000067448","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Defamation as: Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","support":[{"end":497,"quote":"Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","source_id":"nlm-mesh.d000067448","source_sha256":"46fc3778b86c2317904915b4354cdfe304946fac10c192cb24462eb72ef09fad","start":366}],"target_id":"concept.mesh.d000067448","target_kind":"node","target_sha256":"bd51c7c15163b0e3bbdc6f60fff80948bb7cac6df53d4d29f9289fa2e3c3151a"}],"concept.mesh.d000067495":[{"id":"assertion.concept.mesh.d000067495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Healthcare Failure Mode and Effect Analysis as described in the captured NLM MeSH descriptor D000067495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Healthcare Failure Mode and Effect Analysis as: Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","support":[{"end":638,"quote":"Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","source_id":"nlm-mesh.d000067495","source_sha256":"b1e8a4fffa311b0cfd2be2c4294597d6c10cc28d2ebc25799c739f0982268681","start":528}],"target_id":"concept.mesh.d000067495","target_kind":"node","target_sha256":"ba588913e05b0230d69c90b8de0972715b2d9bb9ccf8820bf93a219705cbb4f9"}],"concept.mesh.d000067496":[{"id":"assertion.concept.mesh.d000067496","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spirit Possession as described in the captured NLM MeSH descriptor D000067496","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spirit Possession as: The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","support":[{"end":627,"quote":"The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","source_id":"nlm-mesh.d000067496","source_sha256":"945685dbb5cf3da98ccc6c8d3481f7927f71dc564f5a7b371ce665abdb878f12","start":360}],"target_id":"concept.mesh.d000067496","target_kind":"node","target_sha256":"48c9df29210e45b807ca552f62ca28086e9a9305f9e4077840256837f9b4f9e2"}],"concept.mesh.d000067551":[{"id":"assertion.concept.mesh.d000067551","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Diplomacy as described in the captured NLM MeSH descriptor D000067551","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Diplomacy as: The art and practice of conducting negotiations between people, nations or other parties such as organizations.","support":[{"end":491,"quote":"The art and practice of conducting negotiations between people, nations or other parties such as organizations.","source_id":"nlm-mesh.d000067551","source_sha256":"ae70d0136783a0b0b8cf0b4cf7c72908cd7c582c45c018aab32b65ba00f92355","start":380}],"target_id":"concept.mesh.d000067551","target_kind":"node","target_sha256":"48fa9474009cb5f88838e61d28143b7bd0a45bc23cd4508ae6c3152744dca3ce"}],"concept.mesh.d000067656":[{"id":"assertion.concept.mesh.d000067656","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optimism as described in the captured NLM MeSH descriptor D000067656","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optimism as: Mental attitude that interprets life events as generally being positive.","support":[{"end":410,"quote":"Mental attitude that interprets life events as generally being positive.","source_id":"nlm-mesh.d000067656","source_sha256":"f6679c211c6575ac7a731f3b0e384d26389b1e22edec1380bca9afe74e1b31fc","start":338}],"target_id":"concept.mesh.d000067656","target_kind":"node","target_sha256":"31f24323c50b7838d3bb7653de1bf3ea35e38f57bcf00046b531d43af9201d9d"}],"concept.mesh.d000067657":[{"id":"assertion.concept.mesh.d000067657","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pessimism as described in the captured NLM MeSH descriptor D000067657","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pessimism as: Mental attitude that interprets life events as generally being negative.","support":[{"end":412,"quote":"Mental attitude that interprets life events as generally being negative.","source_id":"nlm-mesh.d000067657","source_sha256":"7b43497ef1329394babf1d62b5c64e073b810c7d21a325c724ba4649816743ba","start":340}],"target_id":"concept.mesh.d000067657","target_kind":"node","target_sha256":"a6f084bd1417edde8ee8ec9bfb474ee3854b6df988947589b642283d2c1625a0"}],"concept.mesh.d000067896":[{"id":"assertion.concept.mesh.d000067896","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Industrial Development as described in the captured NLM MeSH descriptor D000067896","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Industrial Development as: Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and COMMERCE .","support":[{"end":518,"quote":"Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and\nCOMMERCE\n.","source_id":"nlm-mesh.d000067896","source_sha256":"0d84b5e003a0f75f3eda0317bfb59769113388deb8124cc7431728c82501e0f6","start":382}],"target_id":"concept.mesh.d000067896","target_kind":"node","target_sha256":"5712cc7cf5dbb8ff31da6f29d079595448864d26ef05341276bfdd385df0607d"}],"concept.mesh.d000068616":[{"id":"assertion.concept.mesh.d000068616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Professionalism as described in the captured NLM MeSH descriptor D000068616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Professionalism as: The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","support":[{"end":486,"quote":"The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","source_id":"nlm-mesh.d000068616","source_sha256":"41fc6567c33bb58d274ce0fb976303db847a280ef953fc5d5dc54843b236fbf6","start":380}],"target_id":"concept.mesh.d000068616","target_kind":"node","target_sha256":"028035ed9651313e4216263e83f592430e0764815d22076986e5acf157a3fef8"}],"concept.mesh.d000069457":[{"id":"assertion.concept.mesh.d000069457","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Forecast as described in the captured NLM MeSH descriptor D000069457","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Forecast as: Estimates of projected population.","support":[{"end":406,"quote":"Estimates of projected population.","source_id":"nlm-mesh.d000069457","source_sha256":"0d00b13e3f066be53058e3a30394d3117aa33917f1fb84e975cf966bba60b6df","start":372}],"target_id":"concept.mesh.d000069457","target_kind":"node","target_sha256":"5bb4001c5035d0bb5f89729ee4f0f89a85f7a9d2f814d5f74cb5d55cfdbacd63"}],"concept.mesh.d000069550":[{"id":"assertion.concept.mesh.d000069550","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Machine Learning as described in the captured NLM MeSH descriptor D000069550","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Machine Learning as: A type of ARTIFICIAL INTELLIGENCE that enable COMPUTERS to independently initiate and execute LEARNING when exposed to new data.","support":[{"end":506,"quote":"A type of\nARTIFICIAL INTELLIGENCE\nthat enable\nCOMPUTERS\nto independently initiate and execute\nLEARNING\nwhen exposed to new data.","source_id":"nlm-mesh.d000069550","source_sha256":"ca81e9be6c809ff656c0163cc73e6d10e8e59e70c5eec0dab00dbdc3e424c0bb","start":378}],"target_id":"concept.mesh.d000069550","target_kind":"node","target_sha256":"c122d68ded3ca88dcc92bf64b65a141d8980deb38cc50fbfd5a9e82b2f26489d"}],"concept.mesh.d000069553":[{"id":"assertion.concept.mesh.d000069553","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Supervised Machine Learning as described in the captured NLM MeSH descriptor D000069553","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Supervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","support":[{"end":559,"quote":"A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","source_id":"nlm-mesh.d000069553","source_sha256":"5442609462d2df10fd330eaafc9cec3a8b483adb123031d28090369f95f9db3d","start":408}],"target_id":"concept.mesh.d000069553","target_kind":"node","target_sha256":"990546062150b9754b770f2410279a31fba11f646d8912a5eed46d42bd5a3f2d"}],"concept.mesh.d000069558":[{"id":"assertion.concept.mesh.d000069558","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Unsupervised Machine Learning as described in the captured NLM MeSH descriptor D000069558","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Unsupervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","support":[{"end":565,"quote":"A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","source_id":"nlm-mesh.d000069558","source_sha256":"17ade356c88b51b6643cae19dba254b6cdcc602ee033e5ae77cb6c3cda454db7","start":412}],"target_id":"concept.mesh.d000069558","target_kind":"node","target_sha256":"a54332789d05195d578d46b3ea0ced4b45add6118d3c18b4a6e822986d077222"}],"concept.mesh.d000069578":[{"id":"assertion.concept.mesh.d000069578","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Waterborne Diseases as described in the captured NLM MeSH descriptor D000069578","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Waterborne Diseases as: Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","support":[{"end":576,"quote":"Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","source_id":"nlm-mesh.d000069578","source_sha256":"f846193fd148e10111428b2876061c6bc20fb44c5aeb3f387064a5b6c716b203","start":356}],"target_id":"concept.mesh.d000069578","target_kind":"node","target_sha256":"be4cc9e448391f53e8563505c88740c9c1776b778e7d036b4cf81a8e394699f7"}],"concept.mesh.d000070100":[{"id":"assertion.concept.mesh.d000070100","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Informal Sector as described in the captured NLM MeSH descriptor D000070100","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Informal Sector as: A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations; skills acquired outside of the formal sector; and unregulated markets.","support":[{"end":565,"quote":"A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations;  skills acquired outside of the formal sector; and unregulated markets.","source_id":"nlm-mesh.d000070100","source_sha256":"4fc3bd2a6a85627e1abf588720b3ff2d4f7c45dcdbb0b2239d41f7f9c0b76ff5","start":352}],"target_id":"concept.mesh.d000070100","target_kind":"node","target_sha256":"6f0c1eccd66f569a8b867a55385dddfe243168054daded9f27e64e0dcd34bc6e"}],"concept.mesh.d000070337":[{"id":"assertion.concept.mesh.d000070337","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Expropriation as described in the captured NLM MeSH descriptor D000070337","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Expropriation as: Taking of goods, property, or right of use by GOVERNMENT or others.","support":[{"end":415,"quote":"Taking of goods, property, or right of use by\nGOVERNMENT\nor others.","source_id":"nlm-mesh.d000070337","source_sha256":"f0d894c4258648baea1ece05a1d931ec6cec9c4e59ddabdfe58280dc56e11a6d","start":348}],"target_id":"concept.mesh.d000070337","target_kind":"node","target_sha256":"9392164576b7a88a238382f20d89f1b4f8fce651f227fccba2928c69174f10e6"}],"concept.mesh.d000070586":[{"id":"assertion.concept.mesh.d000070586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fiscal Policy as described in the captured NLM MeSH descriptor D000070586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.","support":[{"end":413,"quote":"Use of government spending and taxation to influence the economy.","source_id":"nlm-mesh.d000070586","source_sha256":"8b0a8b8d3847b4b8599fb1930dbc7221e390200c858d68d3e6b7a1cf9339634e","start":348}],"target_id":"concept.mesh.d000070586","target_kind":"node","target_sha256":"450a9c7d3639a009407bc54857bfd6b2d178ca2788be854f73a1252af40a57e2"}],"concept.mesh.d000070838":[{"id":"assertion.concept.mesh.d000070838","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmacy Research as described in the captured NLM MeSH descriptor D000070838","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmacy Research as: RESEARCH activity focused on PHARMACY .","support":[{"end":608,"quote":"RESEARCH\nactivity focused on\nPHARMACY\n.","source_id":"nlm-mesh.d000070838","source_sha256":"3ebda2521dfc48a4b6f009b61a832b71e74b37d6fcc5a1493e297fd493978418","start":569}],"target_id":"concept.mesh.d000070838","target_kind":"node","target_sha256":"50b8b2f15bc6c29c0d763a1024f67431bed3c3df1bf9cb60a5079c68d37fbf3b"}],"concept.mesh.d000071220":[{"id":"assertion.concept.mesh.d000071220","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmaceutical Research as described in the captured NLM MeSH descriptor D000071220","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmaceutical Research as: RESEARCH activity focused on pharmaceutical products and services.","support":[{"end":647,"quote":"RESEARCH\nactivity focused on pharmaceutical products and services.","source_id":"nlm-mesh.d000071220","source_sha256":"f4828817f0ff71637f12ec9018a2c03331484a59d319c9111340844cd5eaceb4","start":581}],"target_id":"concept.mesh.d000071220","target_kind":"node","target_sha256":"a7652272aebcea9a048cc65da4a1bbf18691e7bc391839990919b2500b61c644"}],"concept.mesh.d000072358":[{"id":"assertion.concept.mesh.d000072358","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Work-Life Balance as described in the captured NLM MeSH descriptor D000072358","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Work-Life Balance as: Complex ongoing balance between a person's working life and private life.","support":[{"end":461,"quote":"Complex ongoing balance between a person's working life and private life.","source_id":"nlm-mesh.d000072358","source_sha256":"4b08e88ecf231aa6bcf28a920ce0675ceb777c4f6a673f51bfff005aefaff4bf","start":388}],"target_id":"concept.mesh.d000072358","target_kind":"node","target_sha256":"dfd6ab990dfe113931654fc4265f1fc3dcbed1f0ae3fee1053d6c63c65a7d20d"}],"concept.mesh.d000072577":[{"id":"assertion.concept.mesh.d000072577","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Status as described in the captured NLM MeSH descriptor D000072577","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Status as: A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","support":[{"end":501,"quote":"A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","source_id":"nlm-mesh.d000072577","source_sha256":"c729b4794a4d78088ff5475d811d308135a9d4d743a451e8a6a501d1f525f414","start":370}],"target_id":"concept.mesh.d000072577","target_kind":"node","target_sha256":"f334669d44e96ba331c1f49f266ded65d8044ce38cfb63d7760692eaccb106dc"}],"concept.mesh.d000072698":[{"id":"assertion.concept.mesh.d000072698","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Apartheid as described in the captured NLM MeSH descriptor D000072698","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Apartheid as: A former political system in SOUTH AFRICA which enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","support":[{"end":563,"quote":"A former political system in\nSOUTH AFRICA\nwhich enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","source_id":"nlm-mesh.d000072698","source_sha256":"8d2b87243c023caff883c8bdde37f1502698f03449d8098b8803ce52db21db53","start":364}],"target_id":"concept.mesh.d000072698","target_kind":"node","target_sha256":"26ca10b8892e4ade2149213da4390666c1bc3ea7cb9e38dd4da2cf1b8a10121f"}],"concept.mesh.d000073276":[{"id":"assertion.concept.mesh.d000073276","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Spatial Interaction as described in the captured NLM MeSH descriptor D000073276","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Spatial Interaction as: Estimates of the flow of people, material or information between locations in geographic space.","support":[{"end":475,"quote":"Estimates of the flow of people, material or information between locations in geographic space.","source_id":"nlm-mesh.d000073276","source_sha256":"c86c479e1fc37541c051521a49dfb70b120c48688fedb5d28f8859bf66d48c25","start":380}],"target_id":"concept.mesh.d000073276","target_kind":"node","target_sha256":"4ee96523eed8a780a55e5cd944c90269a655f525663e8cf6cb9a1bc4f7e1b61b"}],"concept.mesh.d000073456":[{"id":"assertion.concept.mesh.d000073456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multitasking Behavior as described in the captured NLM MeSH descriptor D000073456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multitasking Behavior as: Simultaneous task performance, or switching between tasks in a concentrated period of time.","support":[{"end":455,"quote":"Simultaneous task performance, or switching between tasks in a concentrated period of time.","source_id":"nlm-mesh.d000073456","source_sha256":"7cf667f64ea8f8273826347167a308fbec2293ed6f84e7d77da03eeb90a1e387","start":364}],"target_id":"concept.mesh.d000073456","target_kind":"node","target_sha256":"1b04c073ecbb3f6daa764ea827a8e01247153c57aa4615c12a7f56e98dfe0796"}],"concept.mesh.d000073597":[{"id":"assertion.concept.mesh.d000073597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stakeholder Participation as described in the captured NLM MeSH descriptor D000073597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stakeholder Participation as: A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","support":[{"end":545,"quote":"A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","source_id":"nlm-mesh.d000073597","source_sha256":"ed40f2e52cad4bae69992418e35caac13caaa22eeee9da9981cf3bba2cad41ac","start":380}],"target_id":"concept.mesh.d000073597","target_kind":"node","target_sha256":"d2553dbc57a0f0fe8b24bcad91c67ae8dbdc57ee51e223f084b18840360b23f6"}],"concept.mesh.d000073624":[{"id":"assertion.concept.mesh.d000073624","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Symbolic Interactionism as described in the captured NLM MeSH descriptor D000073624","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Symbolic Interactionism as: Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","support":[{"end":591,"quote":"Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","source_id":"nlm-mesh.d000073624","source_sha256":"1a1cbf2775d0be08b33ccf364181f64dc83a8a9c08ff3f49b03a22eddacddb96","start":384}],"target_id":"concept.mesh.d000073624","target_kind":"node","target_sha256":"f917af2610a4898f229984e4d525c9758ed3b96fe9654e3c72ecea35346faf85"}],"concept.mesh.d000073931":[{"id":"assertion.concept.mesh.d000073931","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adverse Outcome Pathways as described in the captured NLM MeSH descriptor D000073931","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adverse Outcome Pathways as: Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","support":[{"end":619,"quote":"Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","source_id":"nlm-mesh.d000073931","source_sha256":"145f5a18b6a3747a9394593f2657727f3c4b1d76fd9e3631524262f50e36c7f7","start":442}],"target_id":"concept.mesh.d000073931","target_kind":"node","target_sha256":"c3804e58cc39ea955a51ca7f3315e2dd6b34d6a6f69a40f803fd31a59ad2b97a"}],"concept.mesh.d000074439":[{"id":"assertion.concept.mesh.d000074439","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Political Activism as described in the captured NLM MeSH descriptor D000074439","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Political Activism as: Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","support":[{"end":489,"quote":"Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","source_id":"nlm-mesh.d000074439","source_sha256":"ff5a5d0f91403c7be9a1bc98c3e4b233d6e7514289655a1a5086d31ddc91925f","start":358}],"target_id":"concept.mesh.d000074439","target_kind":"node","target_sha256":"1e182a7f7e8a4a0b5927b3a1be6a23a7179f1d96d9e8c39d8dcb239237bc79fd"}],"concept.mesh.d000074440":[{"id":"assertion.concept.mesh.d000074440","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fascism as described in the captured NLM MeSH descriptor D000074440","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fascism as: Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","support":[{"end":707,"quote":"Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","source_id":"nlm-mesh.d000074440","source_sha256":"c8931b3bff40658e2fc1835afacef49f1969b8b3fc76c4b88d913129c2fa5f34","start":336}],"target_id":"concept.mesh.d000074440","target_kind":"node","target_sha256":"827267a8e544ddc8437f1b5f2af0c43a786ef913db09d9a7a107239ebf165bfd"}],"concept.mesh.d000074609":[{"id":"assertion.concept.mesh.d000074609","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Marijuana Use as described in the captured NLM MeSH descriptor D000074609","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Marijuana Use as: Medicinal or recreational utilization of MARIJUANA .","support":[{"end":412,"quote":"Medicinal or recreational utilization of\nMARIJUANA\n.","source_id":"nlm-mesh.d000074609","source_sha256":"5559364ff3643a4b9e6b5f10af376d29f168be31cc095a7f0f41fc41437dfa8a","start":360}],"target_id":"concept.mesh.d000074609","target_kind":"node","target_sha256":"9b9062e430b57eecd183010744013daeb1dbfc3612b3d1237bc203ecf7bd1abb"}],"concept.mesh.d000075066":[{"id":"assertion.concept.mesh.d000075066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Body Packing as described in the captured NLM MeSH descriptor D000075066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Body Packing as: Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of DRUG SMUGGLING or to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","support":[{"end":583,"quote":"Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of\nDRUG SMUGGLING\nor to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","source_id":"nlm-mesh.d000075066","source_sha256":"d1753218ca05e494f2e9f6c0f190821585e8ac3d34c4b1168d08dcac94d5089b","start":370}],"target_id":"concept.mesh.d000075066","target_kind":"node","target_sha256":"adc3c92787aaa3221125b74c76f24f3e08b1d53ba923f07b377ccdb540070bad"}],"concept.mesh.d000075082":[{"id":"assertion.concept.mesh.d000075082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Proof of Concept Study as described in the captured NLM MeSH descriptor D000075082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Proof of Concept Study as: An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","support":[{"end":564,"quote":"An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","source_id":"nlm-mesh.d000075082","source_sha256":"47e01926d91cc3417d811958d08ecdc4c7bed4bb25f9f4293299bdf629ec5664","start":370}],"target_id":"concept.mesh.d000075082","target_kind":"node","target_sha256":"b68adccd5ca10c0b37ddc5f6166e25eb99215c285f31a2b8a23d582365ec0683"}],"concept.mesh.d000075665":[{"id":"assertion.concept.mesh.d000075665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Recidivism as described in the captured NLM MeSH descriptor D000075665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Recidivism as: Repeated criminal behavior.","support":[{"end":389,"quote":"Repeated criminal behavior.","source_id":"nlm-mesh.d000075665","source_sha256":"6d21367113eee162ccf3a143f3faf2d8114e35bd43f35307245741226ed04c2d","start":362}],"target_id":"concept.mesh.d000075665","target_kind":"node","target_sha256":"004a8660ead21cb198abe20050b50de28ff0cfcb823da437c4a59658b1d9d0c3"}],"concept.mesh.d000075682":[{"id":"assertion.concept.mesh.d000075682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Procrastination as described in the captured NLM MeSH descriptor D000075682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Procrastination as: The deferment of actions or tasks to a later time, or to infinity.","support":[{"end":430,"quote":"The deferment of actions or tasks to a later time, or to infinity.","source_id":"nlm-mesh.d000075682","source_sha256":"f9827994a16912c4f793a4d3d08aa53a90e95a4935925fef0619a37892846710","start":364}],"target_id":"concept.mesh.d000075682","target_kind":"node","target_sha256":"5b0c219d92179fcb98b1460667b8443846abe081e9a1fb4d990d2ea03cc4288c"}],"concept.mesh.d000075762":[{"id":"assertion.concept.mesh.d000075762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Interdisciplinary Research as described in the captured NLM MeSH descriptor D000075762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Interdisciplinary Research as: Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","support":[{"end":536,"quote":"Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","source_id":"nlm-mesh.d000075762","source_sha256":"3121ef2015b2f08aaa8468f9367d7b1d2c4d3b2613a8794eac5178bedd4919d4","start":378}],"target_id":"concept.mesh.d000075762","target_kind":"node","target_sha256":"2f233af0cf135ad71ffc92a9ee4f9d4c65f11c63be3d8f952708c5a3a1ca007e"}],"concept.mesh.d000075862":[{"id":"assertion.concept.mesh.d000075862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science in the Arts as described in the captured NLM MeSH descriptor D000075862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science in the Arts as: Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","support":[{"end":550,"quote":"Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","source_id":"nlm-mesh.d000075862","source_sha256":"15c9f173fdf2cc80d02bc203b295f2932e060cd06d45ac58fccc92d1d16f97e2","start":441}],"target_id":"concept.mesh.d000075862","target_kind":"node","target_sha256":"03132e36748a31642379040e46103a69ea0647c628fb4521340d7eec05d06c7f"}],"concept.mesh.d000077272":[{"id":"assertion.concept.mesh.d000077272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Latent Class Analysis as described in the captured NLM MeSH descriptor D000077272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Latent Class Analysis as: A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","support":[{"end":839,"quote":"A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","source_id":"nlm-mesh.d000077272","source_sha256":"35192b1b5489cedce26bc9120c26e759916c27683ba7bd44c3a1d8e5914a3380","start":448}],"target_id":"concept.mesh.d000077272","target_kind":"node","target_sha256":"9ee80a43f34451a2419c159f1db3a8c2d5dbf63929032a4dded7c26af750ba25"}],"concept.mesh.d000077321":[{"id":"assertion.concept.mesh.d000077321","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Deep Learning as described in the captured NLM MeSH descriptor D000077321","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Deep Learning as: Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific ALGORITHMS , to build and train neural network models.","support":[{"end":647,"quote":"Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific\nALGORITHMS\n, to build and train neural network models.","source_id":"nlm-mesh.d000077321","source_sha256":"1671be23b74507737684056aa20b6554de9fb254fe2998140b6e4fd5d0ff4f44","start":416}],"target_id":"concept.mesh.d000077321","target_kind":"node","target_sha256":"757d3ac392c907d94c5d983b6cfceaa9ad474bf2cf1b07e4a54d569423f69944"}],"concept.mesh.d000077406":[{"id":"assertion.concept.mesh.d000077406","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Pharmacy as described in the captured NLM MeSH descriptor D000077406","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Pharmacy as: Study of the origins and development of the field of PHARMACY .","support":[{"end":423,"quote":"Study of the origins and development of the field of\nPHARMACY\n.","source_id":"nlm-mesh.d000077406","source_sha256":"6711684cd4c89a38797321e1706393bc66dde81f3920548c6f3b555db4af8a37","start":360}],"target_id":"concept.mesh.d000077406","target_kind":"node","target_sha256":"88ea81d7fe7db3edf9eb395fd59991db55e543f745a2400cae0f201042e6d617"}],"concept.mesh.d000078002":[{"id":"assertion.concept.mesh.d000078002","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Posttraumatic Growth, Psychological as described in the captured NLM MeSH descriptor D000078002","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Posttraumatic Growth, Psychological as: Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","support":[{"end":502,"quote":"Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","source_id":"nlm-mesh.d000078002","source_sha256":"04f95544488cf38f4a0cda80fe9ced200d977410da079c9dfcfaf4e1dd9374b1","start":400}],"target_id":"concept.mesh.d000078002","target_kind":"node","target_sha256":"5c4fe0c11aecf64dda252e558690f4be82117f5e36ac4510d0fba5fbeef38256"}],"concept.mesh.d000078331":[{"id":"assertion.concept.mesh.d000078331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Correlation of Data as described in the captured NLM MeSH descriptor D000078331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Correlation of Data as: Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","support":[{"end":555,"quote":"Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","source_id":"nlm-mesh.d000078331","source_sha256":"1662237e853d52f2ec8f374efd9a2f2228be4263e1a4956b6a6bfe348df5efd8","start":364}],"target_id":"concept.mesh.d000078331","target_kind":"node","target_sha256":"e0bf0a763f3b691061ed11b4ecd8719a9f698e0e4a51c100d68514b0f6d81b73"}],"concept.mesh.d000078332":[{"id":"assertion.concept.mesh.d000078332","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Data Analysis as described in the captured NLM MeSH descriptor D000078332","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Data Analysis as: Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","support":[{"end":519,"quote":"Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","source_id":"nlm-mesh.d000078332","source_sha256":"ef27978313ce68b4f2d4a076a2819c6484b523245f505acc9e574f3e511252bd","start":348}],"target_id":"concept.mesh.d000078332","target_kind":"node","target_sha256":"472a62527b65dd0cb2580f2b5724f4191a446b7e93cff0a4aae4922fd45790f1"}],"concept.mesh.d000078382":[{"id":"assertion.concept.mesh.d000078382","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disgust as described in the captured NLM MeSH descriptor D000078382","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disgust as: A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","support":[{"end":426,"quote":"A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","source_id":"nlm-mesh.d000078382","source_sha256":"b60ba126eaa375518524bb9489bcc76abdf2fa5479edca3c0b9c2cda9e0dc73a","start":336}],"target_id":"concept.mesh.d000078382","target_kind":"node","target_sha256":"06512cfe386bd36905e6d242ae98f5236a528b9cbc28435cd36c6df89e0e0a73"}],"concept.mesh.d000078625":[{"id":"assertion.concept.mesh.d000078625","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Euthanasia, Involuntary as described in the captured NLM MeSH descriptor D000078625","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Euthanasia, Involuntary as: The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially PERSONS WITH DISABILITIES , without INFORMED CONSENT , despite the MENTAL COMPETENCY of the person to give consent.","support":[{"end":691,"quote":"The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially\nPERSONS WITH DISABILITIES\n, without\nINFORMED CONSENT\n, despite the\nMENTAL COMPETENCY\nof the person to give consent.","source_id":"nlm-mesh.d000078625","source_sha256":"cd44514f6d9cf5766d1d006814e96aee6135280be9dbdac6ea86844a3d46cb0f","start":453}],"target_id":"concept.mesh.d000078625","target_kind":"node","target_sha256":"f7bcce344cbae1a4729879f84d6a6e4292df38f2e28828b0b051275e51850179"}],"concept.mesh.d000078682":[{"id":"assertion.concept.mesh.d000078682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respect as described in the captured NLM MeSH descriptor D000078682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respect as: A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","support":[{"end":503,"quote":"A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","source_id":"nlm-mesh.d000078682","source_sha256":"8442c305a3c34b152ac44b155a02a99b370f17e02e68b00bc128b2fe2269e871","start":336}],"target_id":"concept.mesh.d000078682","target_kind":"node","target_sha256":"82169399bd57b6c47367f3841ed43f4a03c6a7988eb19f8ed143274136d37883"}],"concept.mesh.d000079263":[{"id":"assertion.concept.mesh.d000079263","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vaccine-Preventable Diseases as described in the captured NLM MeSH descriptor D000079263","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vaccine-Preventable Diseases as: Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","support":[{"end":511,"quote":"Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","source_id":"nlm-mesh.d000079263","source_sha256":"8bddbd23e5f8616e79bcbd4622a5ec40bd2e78f39569ba853a82d14c522f7875","start":374}],"target_id":"concept.mesh.d000079263","target_kind":"node","target_sha256":"5483d34546f170ba39ade9b61ee9e8dcfd7658f21b96e8f35c5f8d2bed75a83d"}],"concept.mesh.d000079426":[{"id":"assertion.concept.mesh.d000079426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vector Borne Diseases as described in the captured NLM MeSH descriptor D000079426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vector Borne Diseases as: Infectious diseases transmitted by DISEASE VECTORS .","support":[{"end":464,"quote":"Infectious diseases transmitted by\nDISEASE VECTORS\n.","source_id":"nlm-mesh.d000079426","source_sha256":"f7d0a91005929408c4017aae9e6bd3ba715de331f1c370e01f5429f1f4c2134f","start":412}],"target_id":"concept.mesh.d000079426","target_kind":"node","target_sha256":"6739befb8c62707c0053e6e5c851472daef6d735b0e34bb9aa5bbe1cc77dd37b"}],"concept.mesh.d000080105":[{"id":"assertion.concept.mesh.d000080105","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Relational Autonomy as described in the captured NLM MeSH descriptor D000080105","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Relational Autonomy as: The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","support":[{"end":700,"quote":"The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","source_id":"nlm-mesh.d000080105","source_sha256":"e388b09653a3c41a6d5c83f4c1c53f75a1adfaaf5e22c2b95c0982d73fbf0f72","start":396}],"target_id":"concept.mesh.d000080105","target_kind":"node","target_sha256":"e18102081029fd35ddd78c41252a043d325c18b81156abe16eae45255ebeae25"}],"concept.mesh.d000080562":[{"id":"assertion.concept.mesh.d000080562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Universal Design as described in the captured NLM MeSH descriptor D000080562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","support":[{"end":539,"quote":"The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","source_id":"nlm-mesh.d000080562","source_sha256":"cf163b4d84d907e1a882241d6f438df42ab4e192abe103174c78100a6c0a0668","start":386}],"target_id":"concept.mesh.d000080562","target_kind":"node","target_sha256":"f066b5076c89ddfd2be673469178fc3ae56dad0c7a6862e25cfa729319cf639e"}],"concept.mesh.d000081762":[{"id":"assertion.concept.mesh.d000081762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human-Animal Interaction as described in the captured NLM MeSH descriptor D000081762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human-Animal Interaction as: Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","support":[{"end":660,"quote":"Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","source_id":"nlm-mesh.d000081762","source_sha256":"48a0b25bbc7e361a9f30e6c44f29a5d236218d544c1aea5bae6d7852c1cd4626","start":370}],"target_id":"concept.mesh.d000081762","target_kind":"node","target_sha256":"76c5f7152c5c9a0f4bfd53d774a402d486018111f0317dd109dca2078a6ab55e"}],"concept.mesh.d000082742":[{"id":"assertion.concept.mesh.d000082742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Heart Disease Risk Factors as described in the captured NLM MeSH descriptor D000082742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Heart Disease Risk Factors as: Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with HEART DISEASES .","support":[{"end":670,"quote":"Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with\nHEART DISEASES\n.","source_id":"nlm-mesh.d000082742","source_sha256":"6e40ef5646399630da87ad391d3a0f43f25822b61693278ed6cb1ae6c38cc6bc","start":502}],"target_id":"concept.mesh.d000082742","target_kind":"node","target_sha256":"d5464ebda6c98377bfad024cdf08b5d0cf3e8b8672ac85f3986e968d965711dd"}],"concept.mesh.d000083202":[{"id":"assertion.concept.mesh.d000083202","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiometabolic Risk Factors as described in the captured NLM MeSH descriptor D000083202","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiometabolic Risk Factors as: A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence, is known to be associated with CARDIOVASCULAR DISEASES and TYPE 2 DIABETES MELLITUS .","support":[{"end":782,"quote":"A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence,  is known to be associated with\nCARDIOVASCULAR DISEASES\nand\nTYPE 2 DIABETES MELLITUS\n.","source_id":"nlm-mesh.d000083202","source_sha256":"418b077d024fd2c00d765b15de843cee6d4a12d3ba999c6bb0a9c698c7065360","start":526}],"target_id":"concept.mesh.d000083202","target_kind":"node","target_sha256":"ba3cf83554e735f4fc71b75e4accd48c8e43bb617fa45916f15cab191a76fbc1"}],"concept.mesh.d000083623":[{"id":"assertion.concept.mesh.d000083623","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychosocial Functioning as described in the captured NLM MeSH descriptor D000083623","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychosocial Functioning as: Level of and variations in social and emotional activity or behaviors.","support":[{"end":480,"quote":"Level of and variations in social and emotional activity or behaviors.","source_id":"nlm-mesh.d000083623","source_sha256":"3895891430e71f42c27269e6d220bb818e9f188caff048b8c33f6a9bd4ad03a0","start":410}],"target_id":"concept.mesh.d000083623","target_kind":"node","target_sha256":"7a1fb6a642b5e7dd8502d8ec70acd17f20a28513b8a1b2dbfd322654b3ca71bc"}],"concept.mesh.d000084783":[{"id":"assertion.concept.mesh.d000084783","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Recreational Drug Use as described in the captured NLM MeSH descriptor D000084783","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Recreational Drug Use as: Occasional or habitual non-prescribed, not health-related use of substances.","support":[{"end":440,"quote":"Occasional or habitual non-prescribed, not health-related use of substances.","source_id":"nlm-mesh.d000084783","source_sha256":"0aaf8acf6e217765ed04680f18e6f182c4fa81b36ba56332626cabca787d03bb","start":364}],"target_id":"concept.mesh.d000084783","target_kind":"node","target_sha256":"d04a36a624f18c95c7a853558f632aefd8563db47b9de03964a169b22cff4867"}],"concept.mesh.d000085343":[{"id":"assertion.concept.mesh.d000085343","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Latent Infection as described in the captured NLM MeSH descriptor D000085343","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Latent Infection as: Delayed infection of the host by a dormant or inactive pathogen.","support":[{"end":414,"quote":"Delayed infection of the host by a dormant or inactive pathogen.","source_id":"nlm-mesh.d000085343","source_sha256":"54952f646b68d33a3ff4f4e777773423bf333fca2fbbce22305d562910030039","start":350}],"target_id":"concept.mesh.d000085343","target_kind":"node","target_sha256":"8cf27a9625d9a86c78dc2d436350f8f2f574eb7892ee5cd2a0e3143892b16a53"}],"concept.mesh.d000086825":[{"id":"assertion.concept.mesh.d000086825","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"User-Centered Design as described in the captured NLM MeSH descriptor D000086825","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes User-Centered Design as: Design process using input from users regarding systems, devices, or software.","support":[{"end":472,"quote":"Design process using input from users regarding systems, devices, or software.","source_id":"nlm-mesh.d000086825","source_sha256":"b465341abce0ba88bb5eab649f99e1dee98cd39c359002643cb97f82b597271a","start":394}],"target_id":"concept.mesh.d000086825","target_kind":"node","target_sha256":"7f1b134f314df95d64104889c2be766e2fe59146fe25765c4ed44a2905a0e74a"}],"concept.mesh.d000087366":[{"id":"assertion.concept.mesh.d000087366","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Information Avoidance as described in the captured NLM MeSH descriptor D000087366","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Information Avoidance as: Choosing to not obtain knowledge even if having the information could be to one's benefit.","support":[{"end":454,"quote":"Choosing to not obtain knowledge even if having the information could be to one's benefit.","source_id":"nlm-mesh.d000087366","source_sha256":"0bbec95857d183abc799e7f98852379817584774ee4e5cc1f27405abc5be8d0b","start":364}],"target_id":"concept.mesh.d000087366","target_kind":"node","target_sha256":"ece342678a16363f67c3663ee05dd1cc4260fb24a0ecb100ca394e9246595e12"}],"concept.mesh.d000087983":[{"id":"assertion.concept.mesh.d000087983","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sound Recordings as described in the captured NLM MeSH descriptor D000087983","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sound Recordings as: The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","support":[{"end":527,"quote":"The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","source_id":"nlm-mesh.d000087983","source_sha256":"8024d45db4851ad9151266896183928b2b33e526b3c186d75d6fd2d85d94243b","start":398}],"target_id":"concept.mesh.d000087983","target_kind":"node","target_sha256":"84f1c312d4f1ed8be48489c284431cf997992030b1563f0edf076d8e9ce30e56"}],"concept.mesh.d000088562":[{"id":"assertion.concept.mesh.d000088562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Persistent Infection as described in the captured NLM MeSH descriptor D000088562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Persistent Infection as: Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections. LATENT INFECTIONS are infections in which manifestation of clinical symptoms appear later.","support":[{"end":829,"quote":"Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections.\nLATENT INFECTIONS\nare infections in which manifestation of clinical symptoms appear later.","source_id":"nlm-mesh.d000088562","source_sha256":"7c56e918f68e2994a4bf2ee04c4cb7c75202730fbb590754f2a58f15971f2902","start":420}],"target_id":"concept.mesh.d000088562","target_kind":"node","target_sha256":"634fc612070273af04a439e4796e9b8f00bc7d94412a91e0888b4acf172d3568"}],"concept.mesh.d000088724":[{"id":"assertion.concept.mesh.d000088724","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environmentalism as described in the captured NLM MeSH descriptor D000088724","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environmentalism as: Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","support":[{"end":535,"quote":"Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","source_id":"nlm-mesh.d000088724","source_sha256":"b92fdff2be1560d044e881163cba176a6f21052df8addbda26df87b2d58d5da3","start":366}],"target_id":"concept.mesh.d000088724","target_kind":"node","target_sha256":"3bebb3e72dd1febde4d71ca16bbee96d53bce7373f8633e3511a5f662c6baf0e"}],"concept.mesh.d000089682":[{"id":"assertion.concept.mesh.d000089682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cellular Automata as described in the captured NLM MeSH descriptor D000089682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cellular Automata as: Space-oriented dynamic modeling ALGORITHMS acting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","support":[{"end":642,"quote":"Space-oriented dynamic modeling\nALGORITHMS\nacting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","source_id":"nlm-mesh.d000089682","source_sha256":"8b97317450cfebde73e036b3f16e3456696feea58ee4466c3a7cf494b1256dac","start":388}],"target_id":"concept.mesh.d000089682","target_kind":"node","target_sha256":"0f08f9228bd17a160ac80a83c651febc9ed6b6039311ac5a1a6ffaa1c85c1a41"}],"concept.mesh.d000090042":[{"id":"assertion.concept.mesh.d000090042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sentiment Analysis as described in the captured NLM MeSH descriptor D000090042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sentiment Analysis as: A data mining technique in which subjective information such as sentiments, OPINIONS , and attitudes are extracted and analyzed from data.","support":[{"end":564,"quote":"A data mining technique in which subjective information such as sentiments,\nOPINIONS\n, and attitudes are extracted and analyzed from data.","source_id":"nlm-mesh.d000090042","source_sha256":"a2acb551458728c12c4854de52b6d6bc6bb00762342a491bcafde7248c480dbd","start":426}],"target_id":"concept.mesh.d000090042","target_kind":"node","target_sha256":"d07406236f82b283dfd087431a2f3804398a24c02efa6c9a6be56422f5922c01"}],"concept.mesh.d000090082":[{"id":"assertion.concept.mesh.d000090082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Climate Models as described in the captured NLM MeSH descriptor D000090082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Climate Models as: Computer representations that simulate or predict the behavior or activity of WEATHER systems, processes, or phenomena.","support":[{"end":481,"quote":"Computer representations that simulate or predict the behavior or activity of\nWEATHER\nsystems, processes, or phenomena.","source_id":"nlm-mesh.d000090082","source_sha256":"49cbac78e2b022b875e94a9fe4bf2cc9de0cb6ef203e9dace94c8fd4ff58f979","start":362}],"target_id":"concept.mesh.d000090082","target_kind":"node","target_sha256":"da99c9fcd6050fcb74080de14e63e6b5ee1eaf9188f586a934b6e07186478fe7"}],"concept.mesh.d000090862":[{"id":"assertion.concept.mesh.d000090862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuroinflammatory Diseases as described in the captured NLM MeSH descriptor D000090862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuroinflammatory Diseases as: Diseases characterized by inflammation of the nervous tissue.","support":[{"end":499,"quote":"Diseases characterized by inflammation of the nervous tissue.","source_id":"nlm-mesh.d000090862","source_sha256":"46e25aff163cfb1fb3f194a8ae74e8d626d76b2fd24a6841b94e8c84674d5e7c","start":438}],"target_id":"concept.mesh.d000090862","target_kind":"node","target_sha256":"4e3b580d71e24c8f562a38f4cb713f6383e0ee0d3406afb5d6ddca1f8b56b20d"}],"concept.mesh.d000091383":[{"id":"assertion.concept.mesh.d000091383","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environmental Justice as described in the captured NLM MeSH descriptor D000091383","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environmental Justice as: The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","support":[{"end":792,"quote":"The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","source_id":"nlm-mesh.d000091383","source_sha256":"21f1503b0fc37b8aa87a516004e0f3c4ce668c0c3846be3b745db85227b8e892","start":494}],"target_id":"concept.mesh.d000091383","target_kind":"node","target_sha256":"7aa9a2f15debf2ba882a1fa6754b6c7414082e6317280540c05714efc38d80e7"}],"concept.mesh.d000091682":[{"id":"assertion.concept.mesh.d000091682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Inequities as described in the captured NLM MeSH descriptor D000091682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","support":[{"end":815,"quote":"Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","source_id":"nlm-mesh.d000091682","source_sha256":"583521896dad86a2dd2adf54ed256cb9aef6998a7e29e831bf6243246dc06e6e","start":433}],"target_id":"concept.mesh.d000091682","target_kind":"node","target_sha256":"dda00a165f1adbd303a3ce69ec9d9928cbc3956082ee9898c918f49972b70ad2"}],"concept.mesh.d000091702":[{"id":"assertion.concept.mesh.d000091702","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intersectional Framework as described in the captured NLM MeSH descriptor D000091702","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intersectional Framework as: Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","support":[{"end":651,"quote":"Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","source_id":"nlm-mesh.d000091702","source_sha256":"f4591b9f293108dd8c820ab21e7cdf104d4a9f0eed346e0ad89410d9c25f76dd","start":493}],"target_id":"concept.mesh.d000091702","target_kind":"node","target_sha256":"ab85922314a476c7fefea900aff560cc775d334d4063fd4a1e5366cae1073676"}],"concept.mesh.d000092003":[{"id":"assertion.concept.mesh.d000092003","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Artificial Life as described in the captured NLM MeSH descriptor D000092003","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Artificial Life as: Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","support":[{"end":614,"quote":"Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","source_id":"nlm-mesh.d000092003","source_sha256":"324f347010caaecfe73da683a3ac4131c8abcd5cf009e04b9bcbfd75333a7849","start":376}],"target_id":"concept.mesh.d000092003","target_kind":"node","target_sha256":"bb7ce7208103139be4f363c2a6b34a054f691c93962473e322eba013fce5d093"}],"concept.mesh.d000092822":[{"id":"assertion.concept.mesh.d000092822","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Structure as described in the captured NLM MeSH descriptor D000092822","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Structure as: Structural nature of relationships among members of a household typically in reference to a MINOR residing in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","support":[{"end":801,"quote":"Structural nature of relationships among members of a household typically in reference to a\nMINOR\nresiding in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","source_id":"nlm-mesh.d000092822","source_sha256":"be375a21a95222cdc95dd239c1d36e5876869e9ba7d188b1907c26322caddc8f","start":474}],"target_id":"concept.mesh.d000092822","target_kind":"node","target_sha256":"555d3242df9d8dedeafaece7571ca827bf7fa7bca90ccb04d40053ce14915092"}],"concept.mesh.d000092862":[{"id":"assertion.concept.mesh.d000092862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychological Well-Being as described in the captured NLM MeSH descriptor D000092862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychological Well-Being as: Condition of existence, or state of awareness, in which psychological needs are satisfied","support":[{"end":523,"quote":"Condition of existence, or state of awareness, in which psychological needs are satisfied","source_id":"nlm-mesh.d000092862","source_sha256":"c00d8f90ef1958b42094c9f09ce94e7c34a5d5060eb39afd43cad2e9924ea394","start":434}],"target_id":"concept.mesh.d000092862","target_kind":"node","target_sha256":"5778fc31856c6dd99619c853d61ead6c860165104bb1b2ecb88ec8cf9da4dfed"}],"concept.mesh.d000093742":[{"id":"assertion.concept.mesh.d000093742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Breakthrough Infections as described in the captured NLM MeSH descriptor D000093742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Breakthrough Infections as: Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","support":[{"end":506,"quote":"Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","source_id":"nlm-mesh.d000093742","source_sha256":"8bc1d9d33d104075338e511e2e8d6ddb56c6ce84132662819c3d31b6cb2ecc7b","start":380}],"target_id":"concept.mesh.d000093742","target_kind":"node","target_sha256":"da59e84d10bc80dc0608ce9d978167b9601d4d7e2b0466e713db929300d00336"}],"concept.mesh.d000094408":[{"id":"assertion.concept.mesh.d000094408","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Obesity Paradox as described in the captured NLM MeSH descriptor D000094408","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Obesity Paradox as: An observation that high BODY MASS INDEX is sometimes associated with lower CARDIOVASCULAR DISEASE mortality in certain population, e.g., ELDERLY .","support":[{"end":647,"quote":"An observation that high\nBODY MASS INDEX\nis sometimes associated with lower\nCARDIOVASCULAR DISEASE\nmortality in certain population, e.g.,\nELDERLY\n.","source_id":"nlm-mesh.d000094408","source_sha256":"7b675693736c8927b6cf9b49131180369f0f78a3f4150831d09b7530604d8227","start":500}],"target_id":"concept.mesh.d000094408","target_kind":"node","target_sha256":"64ae903fdf98d88150aec737d2701d51e82bf45ad5431540c857b6b3308d3381"}],"concept.mesh.d000094505":[{"id":"assertion.concept.mesh.d000094505","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence Gaps as described in the captured NLM MeSH descriptor D000094505","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence Gaps as: Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","support":[{"end":654,"quote":"Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","source_id":"nlm-mesh.d000094505","source_sha256":"1c8a38511819f92f57ed6fcbb11e638f41749fe31f2fe5d83a87dcd9f48c348c","start":454}],"target_id":"concept.mesh.d000094505","target_kind":"node","target_sha256":"7d6848e2970198856cb51531096e46d4ccbd53aa46e41b3816be325d74427ae2"}],"concept.mesh.d000095026":[{"id":"assertion.concept.mesh.d000095026","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Antiracism as described in the captured NLM MeSH descriptor D000095026","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Antiracism as: Beliefs, actions or intentions, and policies that oppose RACISM or discrimination based on RACE .","support":[{"end":520,"quote":"Beliefs, actions or intentions, and policies that oppose\nRACISM\nor discrimination  based on\nRACE\n.","source_id":"nlm-mesh.d000095026","source_sha256":"b59de366181e7927655d127afeec59542552a6b43d1d2055200e1c772e03e619","start":422}],"target_id":"concept.mesh.d000095026","target_kind":"node","target_sha256":"60026cfa9f8369773841a533cc80eb84f554db990c6deff304266ebce775cb2d"}],"concept.mesh.d000096264":[{"id":"assertion.concept.mesh.d000096264","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Voting as described in the captured NLM MeSH descriptor D000096264","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Voting as: Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","support":[{"end":499,"quote":"Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","source_id":"nlm-mesh.d000096264","source_sha256":"bf9c311921fc2f8b064ac7eb8b267507ae6d2c27725b6e6e683fb2122cae61b9","start":334}],"target_id":"concept.mesh.d000096264","target_kind":"node","target_sha256":"ebc0922d82eeda477fcc7d1a2d1d037847f75ee5e2ef6f93a5b61c46a4591a56"}],"concept.mesh.d000096442":[{"id":"assertion.concept.mesh.d000096442","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Risk Score as described in the captured NLM MeSH descriptor D000096442","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Risk Score as: Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","support":[{"end":745,"quote":"Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","source_id":"nlm-mesh.d000096442","source_sha256":"434e124cbf3e56b14740c2e04d0b48ffa03009870d71059058727a0b5031fcf9","start":478}],"target_id":"concept.mesh.d000096442","target_kind":"node","target_sha256":"9a846225b80e80cfb5238cf8590a258139446d3c6ed7c38f37603cf9d4ed82fd"}],"concept.mesh.d000097785":[{"id":"assertion.concept.mesh.d000097785","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Imaging as described in the captured NLM MeSH descriptor D000097785","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Imaging as: The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes FORENSIC MEDICINE platforms such as X-RAYS ; CT XRAY; and MRI.","support":[{"end":553,"quote":"The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes\nFORENSIC MEDICINE\nplatforms such as\nX-RAYS\n; CT XRAY; and MRI.","source_id":"nlm-mesh.d000097785","source_sha256":"dc9ca48d1a8544b4328b0587b6fcdc2076acae2bd4a0b55820483a9c215a6146","start":374}],"target_id":"concept.mesh.d000097785","target_kind":"node","target_sha256":"9e5c976a50c17fa8e3a03d896dacb74748dbd3d04724a1d2da7a347d36c9aadf"}],"concept.mesh.d000097812":[{"id":"assertion.concept.mesh.d000097812","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychological Growth as described in the captured NLM MeSH descriptor D000097812","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychological Growth as: A process of actively learning and adapting to new ways to function following a challenging life crisis.","support":[{"end":466,"quote":"A process of actively learning and adapting to new ways to function following a challenging life crisis.","source_id":"nlm-mesh.d000097812","source_sha256":"0388a903b541434c7e84f548ada4340f072fef5f2124f6fca4e556479fc5add9","start":362}],"target_id":"concept.mesh.d000097812","target_kind":"node","target_sha256":"26d264da0ac06d5d1fc4cc8a6e94d511d0d3100df49124e82497d52472d578cb"}],"concept.mesh.d000097813":[{"id":"assertion.concept.mesh.d000097813","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Coping Skills as described in the captured NLM MeSH descriptor D000097813","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Coping Skills as: Various techniques for actively managing a stressful event or situation.","support":[{"end":436,"quote":"Various techniques for actively managing a stressful event or situation.","source_id":"nlm-mesh.d000097813","source_sha256":"f0aa0059f76df44b670744d7d6c97929978667af0c4d4c6bb10281044a8d451d","start":364}],"target_id":"concept.mesh.d000097813","target_kind":"node","target_sha256":"95a04f3fa0fbc37a39379f60800f4db967d5abfafbab51cd86113ac09a4f8bfd"}],"concept.mesh.d000097815":[{"id":"assertion.concept.mesh.d000097815","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotional Exhaustion as described in the captured NLM MeSH descriptor D000097815","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.","support":[{"end":470,"quote":"A state of feeling emotionally overextended and drained.","source_id":"nlm-mesh.d000097815","source_sha256":"791254849ca04936978d9b48d22a9bf862330041f6b226cedcf8a64d83e5cc2f","start":414}],"target_id":"concept.mesh.d000097815","target_kind":"node","target_sha256":"c92ff66c66e105dc3c5c7668486f7b19788e0ec72c51cf8657d82e332cb694f6"}],"concept.mesh.d000097822":[{"id":"assertion.concept.mesh.d000097822","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Media Exposure as described in the captured NLM MeSH descriptor D000097822","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","support":[{"end":473,"quote":"The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","source_id":"nlm-mesh.d000097822","source_sha256":"91de9cf0c597fdbed9c8addffea32a413c83b7ebd83c5a0734310ab08d711c9f","start":386}],"target_id":"concept.mesh.d000097822","target_kind":"node","target_sha256":"fd4de71dc1461890c9e20d95a123d9b1f2f5af4f87fc6048192039f0e8239150"}],"concept.mesh.d000097824":[{"id":"assertion.concept.mesh.d000097824","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Neglect as described in the captured NLM MeSH descriptor D000097824","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Neglect as: Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is PROFESSIONAL NEGLIGENCE .","support":[{"end":594,"quote":"Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is\nPROFESSIONAL NEGLIGENCE\n.","source_id":"nlm-mesh.d000097824","source_sha256":"49cbb4aca801dc6b52e22d6bfe7c0ab978a7828157594a68baea81fbe3a48d0b","start":376}],"target_id":"concept.mesh.d000097824","target_kind":"node","target_sha256":"343a08723f9f046c2346752110c14eebcff2274f6bcbf4364b1730f8cc7f86f1"}],"concept.mesh.d000098342":[{"id":"assertion.concept.mesh.d000098342","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Large Language Models as described in the captured NLM MeSH descriptor D000098342","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Large Language Models as: Computational designs that apply DEEP LEARNING methods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","support":[{"end":609,"quote":"Computational designs that apply\nDEEP LEARNING\nmethods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","source_id":"nlm-mesh.d000098342","source_sha256":"bc7d8623d55afa278846de105d5a4f2aed2b4221096d4b9f53e58d293e81a0ca","start":460}],"target_id":"concept.mesh.d000098342","target_kind":"node","target_sha256":"75f754bd7168ffe404ace937bef3b5ff324f02c006151e95f226e95196afee7d"}],"concept.mesh.d000098402":[{"id":"assertion.concept.mesh.d000098402","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autonomous Robots as described in the captured NLM MeSH descriptor D000098402","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autonomous Robots as: Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","support":[{"end":685,"quote":"Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","source_id":"nlm-mesh.d000098402","source_sha256":"46b33d383e9b6879fde153195cbff72547b69994415323140023c08dccce142d","start":408}],"target_id":"concept.mesh.d000098402","target_kind":"node","target_sha256":"19cfe218eef56774f096566fb2aad9331231f53a928ee5c5ec3b71a8eccbb990"}],"concept.mesh.d000098403":[{"id":"assertion.concept.mesh.d000098403","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intelligent Systems as described in the captured NLM MeSH descriptor D000098403","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intelligent Systems as: Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","support":[{"end":499,"quote":"Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","source_id":"nlm-mesh.d000098403","source_sha256":"75cd3ff61d2b5df304dcd4bb6992036e9cc2335053b5bca9dd2dab380768e9fa","start":384}],"target_id":"concept.mesh.d000098403","target_kind":"node","target_sha256":"3dda01a4e59a370c78938ad29b119ed9078acf7284aa42ca437fed439d7a7016"}],"concept.mesh.d000098404":[{"id":"assertion.concept.mesh.d000098404","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Boosting Machine Learning Algorithms as described in the captured NLM MeSH descriptor D000098404","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Boosting Machine Learning Algorithms as: A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","support":[{"end":700,"quote":"A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","source_id":"nlm-mesh.d000098404","source_sha256":"1a77d1cde666b44e6fdd2f3214f640b88895b1821826d95c4d35721080f2c4a3","start":462}],"target_id":"concept.mesh.d000098404","target_kind":"node","target_sha256":"b32ab7f751b812d8c2336d47d097f651a2418cb9f2747686bd8a9123e142c101"}],"concept.mesh.d000098405":[{"id":"assertion.concept.mesh.d000098405","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Dimensionality Reduction as described in the captured NLM MeSH descriptor D000098405","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Dimensionality Reduction as: A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","support":[{"end":639,"quote":"A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","source_id":"nlm-mesh.d000098405","source_sha256":"19fe5183e0c60a42d8e34771f58895b5221d3fc9c3ee0d349c300aeb82cf950a","start":446}],"target_id":"concept.mesh.d000098405","target_kind":"node","target_sha256":"c8c7e8ce812df4a6e21fcf9d4479dafac0abe2921d91182d8c329dbd9b789d61"}],"concept.mesh.d000098406":[{"id":"assertion.concept.mesh.d000098406","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ensemble Learning as described in the captured NLM MeSH descriptor D000098406","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ensemble Learning as: A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","support":[{"end":601,"quote":"A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","source_id":"nlm-mesh.d000098406","source_sha256":"96463cae87220a8d434f9f18a6fe2139a758702b700497d6892e70cc3e5a8b40","start":388}],"target_id":"concept.mesh.d000098406","target_kind":"node","target_sha256":"cfcdc288146ee552459cb62e0f31e71157187d3addfb124a995ae2136c11a8d2"}],"concept.mesh.d000098407":[{"id":"assertion.concept.mesh.d000098407","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Federated Learning as described in the captured NLM MeSH descriptor D000098407","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Federated Learning as: A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","support":[{"end":682,"quote":"A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","source_id":"nlm-mesh.d000098407","source_sha256":"19f4f8988adad6c1e6a39c18dbfef832f5edc789b63e7d97e9c4ad6b9e861f15","start":390}],"target_id":"concept.mesh.d000098407","target_kind":"node","target_sha256":"a4cfb0eda637f231640b04cc6ada0a8932e1620a7625efbbb62988ec6edafd2a"}],"concept.mesh.d000098408":[{"id":"assertion.concept.mesh.d000098408","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reinforcement Machine Learning as described in the captured NLM MeSH descriptor D000098408","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reinforcement Machine Learning as: A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","support":[{"end":616,"quote":"A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","source_id":"nlm-mesh.d000098408","source_sha256":"a02d4b29799593aa51eb848bf2f17734fa257d6e73c204bbbb4ac58167fc7b07","start":414}],"target_id":"concept.mesh.d000098408","target_kind":"node","target_sha256":"4c38b05b4a48342a4df8bae49450fbf9d2c6f8d4733cfe2cdb6b21b182168fd8"}],"concept.mesh.d000098409":[{"id":"assertion.concept.mesh.d000098409","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Representation Machine Learning as described in the captured NLM MeSH descriptor D000098409","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Representation Machine Learning as: A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","support":[{"end":708,"quote":"A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","source_id":"nlm-mesh.d000098409","source_sha256":"747eaf3f0ca8ba244adb335f20c888e7c05f093a73ba869097730b423aae998b","start":416}],"target_id":"concept.mesh.d000098409","target_kind":"node","target_sha256":"eed086f1435b940cc449a914e764707d806b73e35a91db1fd505b37a63c2b261"}],"concept.mesh.d000098410":[{"id":"assertion.concept.mesh.d000098410","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Transfer Machine Learning as described in the captured NLM MeSH descriptor D000098410","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Transfer Machine Learning as: Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","support":[{"end":649,"quote":"Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","source_id":"nlm-mesh.d000098410","source_sha256":"e30c2f4ba6c759a77b795fdf071b6b282d0b29a3fb09ba0ec66d67b704c5b440","start":467}],"target_id":"concept.mesh.d000098410","target_kind":"node","target_sha256":"77809fd04ec9161ce4f8bebf1027af99506876013ba70c9db68c7f62a75dcc3d"}],"concept.mesh.d000098411":[{"id":"assertion.concept.mesh.d000098411","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prediction Methods, Machine as described in the captured NLM MeSH descriptor D000098411","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prediction Methods, Machine as: Methods of making prediction about a new measurement based on calculations of previous data.","support":[{"end":492,"quote":"Methods of making prediction about a new measurement based on calculations of previous data.","source_id":"nlm-mesh.d000098411","source_sha256":"b5ec69ef3e38561fdcfde845a520aa287372c1dd1c33c55aed6ef478320ceef7","start":400}],"target_id":"concept.mesh.d000098411","target_kind":"node","target_sha256":"66a35e6371bb8a6703bc157aba4e8c9c8caf79e21a6be97c8ec80d34cf56463d"}],"concept.mesh.d000098412":[{"id":"assertion.concept.mesh.d000098412","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Predictive Learning Models as described in the captured NLM MeSH descriptor D000098412","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Predictive Learning Models as: Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","support":[{"end":559,"quote":"Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","source_id":"nlm-mesh.d000098412","source_sha256":"be93db02526e2e4e5294a6d7381c851a0ebf13af7a3d5464b9e116cf09bcc97b","start":422}],"target_id":"concept.mesh.d000098412","target_kind":"node","target_sha256":"45abe7478838083f2bdb5d8a7a0585af2bc750199942cfe4fbf4eb7b4bc698c0"}],"concept.mesh.d000098413":[{"id":"assertion.concept.mesh.d000098413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Particle Swarm Optimization as described in the captured NLM MeSH descriptor D000098413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Particle Swarm Optimization as: A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","support":[{"end":673,"quote":"A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","source_id":"nlm-mesh.d000098413","source_sha256":"e25369c3b65a387e5c5a2ec10a082454176475d48f76c098bdffa686012716d7","start":428}],"target_id":"concept.mesh.d000098413","target_kind":"node","target_sha256":"d31cc2baf198345f95bd9aeb9233bf331b8c7f1ef1ca5c72c945101aea05c633"}],"concept.mesh.d000098414":[{"id":"assertion.concept.mesh.d000098414","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pattern Analysis, Machine as described in the captured NLM MeSH descriptor D000098414","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pattern Analysis, Machine as: The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","support":[{"end":642,"quote":"The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","source_id":"nlm-mesh.d000098414","source_sha256":"44c1c1cc35b9fb1fb6dfc31bffb5566eab250c9f44dcb1104fe0ad1482e033d0","start":471}],"target_id":"concept.mesh.d000098414","target_kind":"node","target_sha256":"e20390a106e6636ac5cb631315bc7259c668f13a7254403f0bebdb634022acd7"}],"concept.mesh.d000098426":[{"id":"assertion.concept.mesh.d000098426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adaptive Algorithms as described in the captured NLM MeSH descriptor D000098426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adaptive Algorithms as: Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","support":[{"end":533,"quote":"Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","source_id":"nlm-mesh.d000098426","source_sha256":"c0637bd5a7f5e3a8a3fa4e85f840f942d757fb22ffbe97959c5983f7d2434535","start":400}],"target_id":"concept.mesh.d000098426","target_kind":"node","target_sha256":"2de8ffa27a7fce12c4d9600c545c1e36a2fea8aa957d5338bd74fce3934b100e"}],"concept.mesh.d000098427":[{"id":"assertion.concept.mesh.d000098427","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Generative Adversarial Networks as described in the captured NLM MeSH descriptor D000098427","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Generative Adversarial Networks as: An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","support":[{"end":755,"quote":"An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","source_id":"nlm-mesh.d000098427","source_sha256":"92f0e5e385504d687948284784750d03ec262254d9db7486b6101a869d32d6d6","start":460}],"target_id":"concept.mesh.d000098427","target_kind":"node","target_sha256":"3148df724c4d6ec508775e285205538a34f534afdbb934acb7b5251aa28c8eb2"}],"concept.mesh.d000098428":[{"id":"assertion.concept.mesh.d000098428","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Backtracking Algorithms as described in the captured NLM MeSH descriptor D000098428","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Backtracking Algorithms as: A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","support":[{"end":560,"quote":"A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","source_id":"nlm-mesh.d000098428","source_sha256":"76aa605cc92d8d830a03c89025edcf2ed2d4db5d7436e7f7ebae8ae9af95fd7a","start":384}],"target_id":"concept.mesh.d000098428","target_kind":"node","target_sha256":"096cfca1ec8cdb6b88f33449fac8991b3ae1a245543aea84f72ec90e0cbd370c"}],"concept.mesh.d000098429":[{"id":"assertion.concept.mesh.d000098429","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Classification Algorithms as described in the captured NLM MeSH descriptor D000098429","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Classification Algorithms as: A class of algorithms that predicts into which category an observation belongs based on training data.","support":[{"end":498,"quote":"A class of algorithms that predicts into which category an observation belongs based on training data.","source_id":"nlm-mesh.d000098429","source_sha256":"828e22dd496fc50a5c6a0bb3b6e852835b3f368e6cc3424f427e088c0b336c68","start":396}],"target_id":"concept.mesh.d000098429","target_kind":"node","target_sha256":"51d7299e15098e69ec41085987b0b114104a61bb89f7d3d1e995f946cd078b86"}],"concept.mesh.d000098430":[{"id":"assertion.concept.mesh.d000098430","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Clustering Algorithms as described in the captured NLM MeSH descriptor D000098430","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Clustering Algorithms as: Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","support":[{"end":575,"quote":"Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","source_id":"nlm-mesh.d000098430","source_sha256":"901eff5fbbc775dae9e86a09564d18dd393d1bd906e35e874b3548454d7b23db","start":380}],"target_id":"concept.mesh.d000098430","target_kind":"node","target_sha256":"12f2dcca0b7a4076e91de09e31a32ecb5665da5586a6d2bee2f01e214b005c17"}],"concept.mesh.d000098431":[{"id":"assertion.concept.mesh.d000098431","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Compression Algorithms as described in the captured NLM MeSH descriptor D000098431","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Compression Algorithms as: A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","support":[{"end":533,"quote":"A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","source_id":"nlm-mesh.d000098431","source_sha256":"35f0eba00b61795902ceb06b686340b6dfe8a5dd0dc8ee71ba315ad9f933c62f","start":382}],"target_id":"concept.mesh.d000098431","target_kind":"node","target_sha256":"4722238f324dc338faf20bbcbbf88903fa68cd77b02d54f983fe3153106c9808"}],"concept.mesh.d000098432":[{"id":"assertion.concept.mesh.d000098432","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Detection Algorithms as described in the captured NLM MeSH descriptor D000098432","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Detection Algorithms as: Algorithms designed to find or localize the objects in images and assign the objects (affordances).","support":[{"end":477,"quote":"Algorithms designed to find or localize the objects in images and assign the objects (affordances).","source_id":"nlm-mesh.d000098432","source_sha256":"164750652f47ffc8594f27df73c2ca1210fb02f5daf73cbba10b7a369004a93d","start":378}],"target_id":"concept.mesh.d000098432","target_kind":"node","target_sha256":"419a77ccd6fa19d769cc8347ca471e12f5c180892bc604407734c507dd0700fa"}],"concept.mesh.d000098434":[{"id":"assertion.concept.mesh.d000098434","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Algorithms as described in the captured NLM MeSH descriptor D000098434","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Algorithms as: Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by NATURAL SELECTION . They are commonly used to generate solutions for optimization problems.","support":[{"end":635,"quote":"Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by\nNATURAL SELECTION\n. They are commonly used to generate solutions for optimization problems.","source_id":"nlm-mesh.d000098434","source_sha256":"38371f35c328927188955b1b8656298ef5a6da88e280e4cc35b00a8be4cd72d7","start":374}],"target_id":"concept.mesh.d000098434","target_kind":"node","target_sha256":"a5c07f628c48b0e17a59b2bda50d85699db8ed1e7be42275725c84ffb3ad55bc"}],"concept.mesh.d000098435":[{"id":"assertion.concept.mesh.d000098435","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Machine Learning Algorithms as described in the captured NLM MeSH descriptor D000098435","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Machine Learning Algorithms as: A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","support":[{"end":536,"quote":"A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","source_id":"nlm-mesh.d000098435","source_sha256":"6c62c82d3623c8a6a77796358ba3323f1fa38d5c14ee758de795ee93ce6b54a6","start":392}],"target_id":"concept.mesh.d000098435","target_kind":"node","target_sha256":"8d0f95c932517fc17f5938a3b0528c1547b130029c298cba75b80cfa38c783a7"}],"concept.mesh.d000098436":[{"id":"assertion.concept.mesh.d000098436","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Parallel Algorithms as described in the captured NLM MeSH descriptor D000098436","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Parallel Algorithms as: Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","support":[{"end":544,"quote":"Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","source_id":"nlm-mesh.d000098436","source_sha256":"7a86baffee0eb8c3ee4830df2fa51e2ef7ef191ec2059b085f7802524fe096bd","start":376}],"target_id":"concept.mesh.d000098436","target_kind":"node","target_sha256":"75c30470c5378bdad4027c0ea48afd73de79b9124490ba18ecf046bd0ac3651f"}],"concept.mesh.d000098437":[{"id":"assertion.concept.mesh.d000098437","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prediction Algorithms as described in the captured NLM MeSH descriptor D000098437","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prediction Algorithms as: A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","support":[{"end":541,"quote":"A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","source_id":"nlm-mesh.d000098437","source_sha256":"f5069c6f6ea328a189a91fc39107e81465e30fae82ddb2558d46ff2057619375","start":380}],"target_id":"concept.mesh.d000098437","target_kind":"node","target_sha256":"fa6a0e9a8700eeb91d6bfa757ec2af3f3d4ac9d872624ea550f326b56c1e171b"}],"concept.mesh.d000098446":[{"id":"assertion.concept.mesh.d000098446","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autoencoder as described in the captured NLM MeSH descriptor D000098446","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autoencoder as: An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images, DIMENSIONALITY REDUCTION and feature extraction.","support":[{"end":808,"quote":"An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images,\nDIMENSIONALITY REDUCTION\nand feature extraction.","source_id":"nlm-mesh.d000098446","source_sha256":"cf3921986197bc2080caf2a33d829a6220c344ba1ffb5cb9cfd85c4366cce3f7","start":508}],"target_id":"concept.mesh.d000098446","target_kind":"node","target_sha256":"ebcd77b385f650bbbee0b9c5d480bd627ffd53f5049915b2ceddb98d7b000345"}],"concept.mesh.d000098451":[{"id":"assertion.concept.mesh.d000098451","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multiple-Instance Learning Algorithms as described in the captured NLM MeSH descriptor D000098451","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multiple-Instance Learning Algorithms as: Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","support":[{"end":626,"quote":"Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","source_id":"nlm-mesh.d000098451","source_sha256":"1c3c091bf01982c45c11ba7bc4e61dddb393565ad0e8e56064ba3bd9a3887a34","start":480}],"target_id":"concept.mesh.d000098451","target_kind":"node","target_sha256":"c97bbc074560bbfec5bf1341a89b8b7ed7036c6d80966fcd5883bf60309b4ed9"}],"concept.mesh.d000098463":[{"id":"assertion.concept.mesh.d000098463","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Dilemmas as described in the captured NLM MeSH descriptor D000098463","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Dilemmas as: Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","support":[{"end":629,"quote":"Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","source_id":"nlm-mesh.d000098463","source_sha256":"b658de09ab51712d2a3e1262c83970ed81a7f5b29f410795f287bd3cb8e5a762","start":370}],"target_id":"concept.mesh.d000098463","target_kind":"node","target_sha256":"cb1634305e7700a35e9c0352356aa173185e2ae100ceb6a5d4b58b2759c5cdf5"}],"concept.mesh.d000099056":[{"id":"assertion.concept.mesh.d000099056","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Outcome Expectations as described in the captured NLM MeSH descriptor D000099056","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Outcome Expectations as: Believed or anticipated consequences of a person’s behavior.","support":[{"end":418,"quote":"Believed or anticipated consequences of a person’s behavior.","source_id":"nlm-mesh.d000099056","source_sha256":"014fd24836c415e0e99b5001626d16a4c4f91f688177fe1bfb5c7ea09ee2176c","start":358}],"target_id":"concept.mesh.d000099056","target_kind":"node","target_sha256":"8ba5e104eb99a0682260fc46b61788f2f8291fcb15ca9769984fe56ead2a5c9d"}],"concept.mesh.d000099075":[{"id":"assertion.concept.mesh.d000099075","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Politicization as described in the captured NLM MeSH descriptor D000099075","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Politicization as: Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","support":[{"end":537,"quote":"Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","source_id":"nlm-mesh.d000099075","source_sha256":"0132c19e2f6e2296dad162189f3f3e76a9f511141af36b63849d845042c7003d","start":350}],"target_id":"concept.mesh.d000099075","target_kind":"node","target_sha256":"b33c1fa318e4c1ea5508017c26c0abd8ae02756a6cdfbacabc1a74b9c399e344"}],"concept.mesh.d000184":[{"id":"assertion.concept.mesh.d000184","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Acting Out as described in the captured NLM MeSH descriptor D000184","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Acting Out as: Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","support":[{"end":443,"quote":"Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","source_id":"nlm-mesh.d000184","source_sha256":"801e695a43d73458df27317ee60ae64c5c434251287eb1635dc28cbc13e5df33","start":336}],"target_id":"concept.mesh.d000184","target_kind":"node","target_sha256":"d68b0b212e7c9128c0aa3486be4e59fb47915b17e25b13c7d438e015211119c9"}],"concept.mesh.d000223":[{"id":"assertion.concept.mesh.d000223","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adaptation, Psychological as described in the captured NLM MeSH descriptor D000223","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","support":[{"end":561,"quote":"A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","source_id":"nlm-mesh.d000223","source_sha256":"b1912950b3e990e295a6a913bdd1ee8778fc934e0c3c4c143ec5cffde529fe90","start":388}],"target_id":"concept.mesh.d000223","target_kind":"node","target_sha256":"d2099a44211886c6cd26f62c176ad92fa1b06d813eaf18bca702c7f01611274b"}],"concept.mesh.d000294":[{"id":"assertion.concept.mesh.d000294","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Behavior as described in the captured NLM MeSH descriptor D000294","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Behavior as: Any observable response or action of an adolescent.","support":[{"end":443,"quote":"Any observable response or action of an adolescent.","source_id":"nlm-mesh.d000294","source_sha256":"ae0e238ff79ab3da3ac74df40aa4579184bd7f40245246eedb0f3f9b37b5d3f1","start":392}],"target_id":"concept.mesh.d000294","target_kind":"node","target_sha256":"677e092e3ad6ea132b1014de3b06ca4332d245b770cf8d618451544527a5d4ee"}],"concept.mesh.d000339":[{"id":"assertion.concept.mesh.d000339","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Affect as described in the captured NLM MeSH descriptor D000339","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Affect as: The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","support":[{"end":558,"quote":"The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","source_id":"nlm-mesh.d000339","source_sha256":"991b1be4d0eca443e9f8026e59495f00802c17a16fe34cd46e0f34768940ae04","start":328}],"target_id":"concept.mesh.d000339","target_kind":"node","target_sha256":"98eae7742d214a6863f62537196bd25a28787906b0f6a30a62a43c02475d4803"}],"concept.mesh.d000422":[{"id":"assertion.concept.mesh.d000422","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Alchemy as described in the captured NLM MeSH descriptor D000422","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Alchemy as: Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","support":[{"end":487,"quote":"Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","source_id":"nlm-mesh.d000422","source_sha256":"f9d737dea83e8f9524fe62129604b1deb7e1b06022b20ffa60e70c2e150bb88e","start":351}],"target_id":"concept.mesh.d000422","target_kind":"node","target_sha256":"f8154957312a4358391b7ad131372b556dee1e3c213d081a94dccf7777ee87e5"}],"concept.mesh.d000716":[{"id":"assertion.concept.mesh.d000716","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anatomy, Artistic as described in the captured NLM MeSH descriptor D000716","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anatomy, Artistic as: The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","support":[{"end":625,"quote":"The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","source_id":"nlm-mesh.d000716","source_sha256":"05a3c484fccc637d6747510b9b44ecf87903ede338e1c52ef2e8704afe60f2d1","start":511}],"target_id":"concept.mesh.d000716","target_kind":"node","target_sha256":"ae590a8ed9dfe2d4f9695cb7de41129976fe8152ece63706c6b3052f68c46992"}],"concept.mesh.d000785":[{"id":"assertion.concept.mesh.d000785","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Aneurysm, Infected as described in the captured NLM MeSH descriptor D000785","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Aneurysm, Infected as: Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","support":[{"end":740,"quote":"Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","source_id":"nlm-mesh.d000785","source_sha256":"969637c6643084273c2e8c559a1732ae732ed03f5decf7dd0a158a42f42ad9b9","start":610}],"target_id":"concept.mesh.d000785","target_kind":"node","target_sha256":"37ab5b11f38a2316a86754026681be38418d86bc921319eee4c57ddc03cdca70"}],"concept.mesh.d000786":[{"id":"assertion.concept.mesh.d000786","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anger as described in the captured NLM MeSH descriptor D000786","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anger as: A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","support":[{"end":450,"quote":"A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","source_id":"nlm-mesh.d000786","source_sha256":"007d6ce4d256ae3391763e97733599a08b57625bea7f863c7d6b2023f5c1843c","start":352}],"target_id":"concept.mesh.d000786","target_kind":"node","target_sha256":"cd1248e3e2069d2ac7b174426ca112550d7d5db79cbf1a9b85656306e2a76edf"}],"concept.mesh.d000887":[{"id":"assertion.concept.mesh.d000887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anthroposophy as described in the captured NLM MeSH descriptor D000887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anthroposophy as: Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","support":[{"end":563,"quote":"Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","source_id":"nlm-mesh.d000887","source_sha256":"95bbd4e99da52692432551255ceadaa4f54ace924107434182da7d838ce0e5eb","start":354}],"target_id":"concept.mesh.d000887","target_kind":"node","target_sha256":"df80fdf594422a58aa35b028557ef43d17247f2fbfef9e8ffece315d088bd89f"}],"concept.mesh.d001007":[{"id":"assertion.concept.mesh.d001007","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anxiety as described in the captured NLM MeSH descriptor D001007","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anxiety as: Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with ANXIETY DISORDERS .","support":[{"end":533,"quote":"Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with\nANXIETY DISORDERS\n.","source_id":"nlm-mesh.d001007","source_sha256":"44a2f5cf78d999db2fee45857138e2f4b8a9e4605fef702e55d0d2b923958e9f","start":420}],"target_id":"concept.mesh.d001007","target_kind":"node","target_sha256":"aa29b37330aacc368a2a0f6c1075a4819e1a61f171d6a28261442ae8ed31397d"}],"concept.mesh.d001170":[{"id":"assertion.concept.mesh.d001170","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Arthritis, Infectious as described in the captured NLM MeSH descriptor D001170","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Arthritis, Infectious as: Arthritis caused by BACTERIA ; RICKETTSIA ; MYCOPLASMA ; VIRUSES ; FUNGI ; or PARASITES .","support":[{"end":525,"quote":"Arthritis caused by\nBACTERIA\n;\nRICKETTSIA\n;\nMYCOPLASMA\n;\nVIRUSES\n;\nFUNGI\n; or\nPARASITES\n.","source_id":"nlm-mesh.d001170","source_sha256":"1c23bca3cef58b7ace919411c4665f3a8edac577d969e1083c88227ff123e68d","start":436}],"target_id":"concept.mesh.d001170","target_kind":"node","target_sha256":"1586ae3fcbee9192b6818d083e1fa2ef7b121c70a1b023896b2029e0222eafb3"}],"concept.mesh.d001290":[{"id":"assertion.concept.mesh.d001290","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude as described in the captured NLM MeSH descriptor D001290","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude as: An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","support":[{"end":571,"quote":"An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","source_id":"nlm-mesh.d001290","source_sha256":"c03d05183621a9a54d5a8fd2be44a1c6bb039558f1ffeb8337c986f93a8ec6bc","start":328}],"target_id":"concept.mesh.d001290","target_kind":"node","target_sha256":"9737b1c3e656f5f496153185b64a7c71130da892f57615d7993cbc924d32266d"}],"concept.mesh.d001291":[{"id":"assertion.concept.mesh.d001291","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude of Health Personnel as described in the captured NLM MeSH descriptor D001291","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude of Health Personnel as: Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","support":[{"end":487,"quote":"Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","source_id":"nlm-mesh.d001291","source_sha256":"07c7e19b5b69b43fc569dee21b304add2d3d01661c391cf9403cdbc94c2db3a0","start":384}],"target_id":"concept.mesh.d001291","target_kind":"node","target_sha256":"78f3ca557a4375fb76298fa3277ac7355d9794de88ce0b4495a37357c8b69ee1"}],"concept.mesh.d001292":[{"id":"assertion.concept.mesh.d001292","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Computers as described in the captured NLM MeSH descriptor D001292","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Computers as: The attitude and behavior associated with an individual using the computer.","support":[{"end":462,"quote":"The attitude and behavior associated with an individual using the computer.","source_id":"nlm-mesh.d001292","source_sha256":"f5c2855ac7147417646aeb0c199f4de576b806ff3d0b9e25f9d4857a96294902","start":387}],"target_id":"concept.mesh.d001292","target_kind":"node","target_sha256":"193f3c0e589e6a11e228b5fb222b3f42ae97f00ef18072bbbd990fbd184a2682"}],"concept.mesh.d001293":[{"id":"assertion.concept.mesh.d001293","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Death as described in the captured NLM MeSH descriptor D001293","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Death as: Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","support":[{"end":496,"quote":"Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","source_id":"nlm-mesh.d001293","source_sha256":"6f89d3982ac8152fd5e8d05f8b1dddd65d14ed1c4dab75f7d4ff388f6de69f60","start":362}],"target_id":"concept.mesh.d001293","target_kind":"node","target_sha256":"9b16d1210cd4ab7e5c4f68271d4db0436acbe15794ed454ea6e4eb46ac1fda87"}],"concept.mesh.d001294":[{"id":"assertion.concept.mesh.d001294","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Attitude to Health as described in the captured NLM MeSH descriptor D001294","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Attitude to Health as: Public attitudes toward health, disease, and the medical care system.","support":[{"end":473,"quote":"Public attitudes toward health, disease, and the medical care system.","source_id":"nlm-mesh.d001294","source_sha256":"2e84140dccbeadeb0a2970c406387001568cce7e66c4aed4a59e9f7da184b0b2","start":404}],"target_id":"concept.mesh.d001294","target_kind":"node","target_sha256":"f441f2b50f36ab17da1c96ada6f71eec0331f58f7681d51b9bd4986cdc5d70ec"}],"concept.mesh.d001296":[{"id":"assertion.concept.mesh.d001296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Audiovisual Aids as described in the captured NLM MeSH descriptor D001296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Audiovisual Aids as: Auditory and visual instructional materials.","support":[{"end":464,"quote":"Auditory and visual instructional materials.","source_id":"nlm-mesh.d001296","source_sha256":"ec68bbb3a0e3ce563f145520435fa71e39bff7c622ec9d0ee5e5911b5378df79","start":420}],"target_id":"concept.mesh.d001296","target_kind":"node","target_sha256":"0ff8e06f84bb62102f20fe157eb28bdc2037124400b4a58fbee7b7f53e8d7179"}],"concept.mesh.d001331":[{"id":"assertion.concept.mesh.d001331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Automation as described in the captured NLM MeSH descriptor D001331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Automation as: Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","support":[{"end":737,"quote":"Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","source_id":"nlm-mesh.d001331","source_sha256":"647e78575aa356fde5f319196f1b622d230200aee70e2c59320a6fba8d20bbe0","start":526}],"target_id":"concept.mesh.d001331","target_kind":"node","target_sha256":"ab367afeb94a96e355b973e69ec2b996b55565eded4815247b906c48447f421c"}],"concept.mesh.d001342":[{"id":"assertion.concept.mesh.d001342","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autonomic Nervous System Diseases as described in the captured NLM MeSH descriptor D001342","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autonomic Nervous System Diseases as: Diseases of the AUTONOMIC NERVOUS SYSTEM , including sympathetic, parasympathetic, and enteric nervous systems.","support":[{"end":489,"quote":"Diseases of the\nAUTONOMIC NERVOUS SYSTEM\n, including sympathetic, parasympathetic, and enteric nervous systems.","source_id":"nlm-mesh.d001342","source_sha256":"409fb9e934ac042d302d43dbce0a7a4ba599312bceb4bec075ba5768a167d5b3","start":378}],"target_id":"concept.mesh.d001342","target_kind":"node","target_sha256":"c062328773f2a266b172b97707bb102eb1d6bafbec69e1d78934bc523541cf38"}],"concept.mesh.d001423":[{"id":"assertion.concept.mesh.d001423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bacterial Infections and Mycoses as described in the captured NLM MeSH descriptor D001423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bacterial Infections and Mycoses as: Infections caused by bacteria and fungi, general, specified, or unspecified.","support":[{"end":526,"quote":"Infections caused by bacteria and fungi, general, specified, or unspecified.","source_id":"nlm-mesh.d001423","source_sha256":"d075f7199a94cfcff2a3a5bd6b9361b9411c2ca81b5e90be95292fbd2a624d9c","start":450}],"target_id":"concept.mesh.d001423","target_kind":"node","target_sha256":"5fd0d62f40e28fc065d9ea84a7e6e47b2732ce541c05b0e40daf3352272cefa7"}],"concept.mesh.d001499":[{"id":"assertion.concept.mesh.d001499","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bayes Theorem as described in the captured NLM MeSH descriptor D001499","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bayes Theorem as: A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","support":[{"end":925,"quote":"A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","source_id":"nlm-mesh.d001499","source_sha256":"52aabdf87b3885fe25324b19a87ad9401df1f66bde631a9565a0a06c7bff3b2d","start":425}],"target_id":"concept.mesh.d001499","target_kind":"node","target_sha256":"1f5142987d7fa7a670bb560736f15d353dfedc862683bfa3f11a0f76606ee604"}],"concept.mesh.d001504":[{"id":"assertion.concept.mesh.d001504","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beauty as described in the captured NLM MeSH descriptor D001504","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beauty as: Characteristics or attributes of persons or things which elicit pleasurable feelings.","support":[{"end":437,"quote":"Characteristics or attributes of persons or things which elicit pleasurable feelings.","source_id":"nlm-mesh.d001504","source_sha256":"9619fbb4571d2cbff669e762ea2cab619a7fb04a21e167d1ea3bd76a960751dd","start":352}],"target_id":"concept.mesh.d001504","target_kind":"node","target_sha256":"e20d739efe4af6b4a65465f30cf109f6fb7d68ebcda3dbb55b4dcefb34e19c4d"}],"concept.mesh.d001519":[{"id":"assertion.concept.mesh.d001519","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior as described in the captured NLM MeSH descriptor D001519","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior as: The observable response of a man or animal to a situation.","support":[{"end":486,"quote":"The observable response of a man or animal to a situation.","source_id":"nlm-mesh.d001519","source_sha256":"544fb0f573467216cef709527a053bc77a5dccf5aefdb7f6025bedac2762a54a","start":428}],"target_id":"concept.mesh.d001519","target_kind":"node","target_sha256":"887ae33110b5c9c9de59c0948530af348dc211219cb64c4cf6b7d5cdf3129ca4"}],"concept.mesh.d001520":[{"id":"assertion.concept.mesh.d001520","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior and Behavior Mechanisms as described in the captured NLM MeSH descriptor D001520","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior and Behavior Mechanisms as: The observable response made to a situation and the unconscious processes underlying it.","support":[{"end":534,"quote":"The observable response made to a situation and the unconscious processes underlying it.","source_id":"nlm-mesh.d001520","source_sha256":"e0576f1ccd90651d5a77d510de066266fb02a5b8949ae2c8b6d4f11987b4e803","start":446}],"target_id":"concept.mesh.d001520","target_kind":"node","target_sha256":"30a082b23122a38c2ed9045613f5642d6111fabe1891096130f762828640fa39"}],"concept.mesh.d001522":[{"id":"assertion.concept.mesh.d001522","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavior, Animal as described in the captured NLM MeSH descriptor D001522","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavior, Animal as: The observable response an animal makes to any situation.","support":[{"end":405,"quote":"The observable response an animal makes to any situation.","source_id":"nlm-mesh.d001522","source_sha256":"0656670da4122498130fe710e59ba78fd298a2701db45b43d6b7fee92584bd79","start":348}],"target_id":"concept.mesh.d001522","target_kind":"node","target_sha256":"0bd3044817ec69dab1b752b035463ddb8ae0c52ad64709dfbba660cba14b66e3"}],"concept.mesh.d001523":[{"id":"assertion.concept.mesh.d001523","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mental Disorders as described in the captured NLM MeSH descriptor D001523","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mental Disorders as: Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","support":[{"end":548,"quote":"Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","source_id":"nlm-mesh.d001523","source_sha256":"14284364e15f31787965dc2d09571dfe5777319b374993c3f4d101efb057b675","start":340}],"target_id":"concept.mesh.d001523","target_kind":"node","target_sha256":"3ab4582ea0549f0619f8bb2ec9d3647b897b8471b8485aec2cf16df5f0cf4be9"}],"concept.mesh.d001526":[{"id":"assertion.concept.mesh.d001526","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Symptoms as described in the captured NLM MeSH descriptor D001526","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Symptoms as: Observable manifestations of impaired psychological functioning.","support":[{"end":500,"quote":"Observable manifestations of impaired psychological functioning.","source_id":"nlm-mesh.d001526","source_sha256":"648255fab4f81dc4366ff2abaca5cc3ed8429d105e7988cec78b8958ce3ebc7d","start":436}],"target_id":"concept.mesh.d001526","target_kind":"node","target_sha256":"a995d1c5c8403c739deed2a3d93b1fcc99079fea0d4f079caf7d82c3b09d4a4a"}],"concept.mesh.d001601":[{"id":"assertion.concept.mesh.d001601","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bereavement as described in the captured NLM MeSH descriptor D001601","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bereavement as: Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","support":[{"end":473,"quote":"Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","source_id":"nlm-mesh.d001601","source_sha256":"f182fba35d7fb3d8dd0d4784cf73224309f68b49b7bb9aeb4d12646623d5d2f3","start":364}],"target_id":"concept.mesh.d001601","target_kind":"node","target_sha256":"c8d3616f33fd7eecda31ee14a0806bd593427bf6de721ffce67ab514513ac911"}],"concept.mesh.d001633":[{"id":"assertion.concept.mesh.d001633","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bible as described in the captured NLM MeSH descriptor D001633","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bible as: The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","support":[{"end":613,"quote":"The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","source_id":"nlm-mesh.d001633","source_sha256":"c367097da4131a74e650f4c2d69c07a049ddb4200f82badcfba5709d8605d30b","start":490}],"target_id":"concept.mesh.d001633","target_kind":"node","target_sha256":"5290cafc17727e4e5879fc506bcf39fa8c03c69c059475b3d120873ab336fa8a"}],"concept.mesh.d001698":[{"id":"assertion.concept.mesh.d001698","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Engineering as described in the captured NLM MeSH descriptor D001698","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.","support":[{"end":470,"quote":"Application of principles and practices of engineering science to biomedical research and health care.","source_id":"nlm-mesh.d001698","source_sha256":"b79db4463bd9192894ad85b3f37c816de172b7d70dc8e021962dcc1e4f64dccf","start":368}],"target_id":"concept.mesh.d001698","target_kind":"node","target_sha256":"55085ebf11bd7fc16b31e58b00b27ed0cf00dbb9c0f1ba7fd80a5ff89ee50182"}],"concept.mesh.d001721":[{"id":"assertion.concept.mesh.d001721","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Birth Intervals as described in the captured NLM MeSH descriptor D001721","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Birth Intervals as: The lengths of intervals between births to women in the population.","support":[{"end":506,"quote":"The lengths of intervals between births to women in the population.","source_id":"nlm-mesh.d001721","source_sha256":"cdca6e1e49f49f931506fcbdc3bc609a0b8a25ccaf5b8879c5f05cbd795c07fd","start":439}],"target_id":"concept.mesh.d001721","target_kind":"node","target_sha256":"e9ebb9b92308aa832da476927e4fc5242ea199855f2b20c8907dc3867234324e"}],"concept.mesh.d001722":[{"id":"assertion.concept.mesh.d001722","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Birth Order as described in the captured NLM MeSH descriptor D001722","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Birth Order as: The sequence in which children are born into the family.","support":[{"end":468,"quote":"The sequence in which children are born into the family.","source_id":"nlm-mesh.d001722","source_sha256":"14082088dcdf3dc7beffa0135a9956c006102d542fbb0310ea65bd738b3acac9","start":412}],"target_id":"concept.mesh.d001722","target_kind":"node","target_sha256":"3af86b33dad8c4bba59090c3c9a82a644147fe40149f5009b5085ed73f6e827a"}],"concept.mesh.d001850":[{"id":"assertion.concept.mesh.d001850","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bone Diseases, Infectious as described in the captured NLM MeSH descriptor D001850","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bone Diseases, Infectious as: Bone diseases caused by pathogenic microorganisms.","support":[{"end":539,"quote":"Bone diseases caused by pathogenic microorganisms.","source_id":"nlm-mesh.d001850","source_sha256":"8e4af238b2783d60d139c310d58dcc3a1912716d5f4b12be1e00cf52a7ea900e","start":489}],"target_id":"concept.mesh.d001850","target_kind":"node","target_sha256":"e1f8f5ab65186ffda4487de6e9fcc4cff27224d4eb42672312459d11f7bf1d1d"}],"concept.mesh.d001878":[{"id":"assertion.concept.mesh.d001878","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Books, Illustrated as described in the captured NLM MeSH descriptor D001878","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Books, Illustrated as: Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","support":[{"end":813,"quote":"Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","source_id":"nlm-mesh.d001878","source_sha256":"59ec76233d2f9aa27163694b37318ce7ac1374f1de874117ac1a8b6dea90dcdd","start":533}],"target_id":"concept.mesh.d001878","target_kind":"node","target_sha256":"feb9fee2084cca0876671478756e6a6009999669b8720be278599a50c2ab2c66"}],"concept.mesh.d001887":[{"id":"assertion.concept.mesh.d001887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Boredom as described in the captured NLM MeSH descriptor D001887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Boredom as: A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","support":[{"end":462,"quote":"A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","source_id":"nlm-mesh.d001887","source_sha256":"33ddce1190efda10b901b657e4c4a8b8c1026c946c47fe43a45e742157e59b43","start":330}],"target_id":"concept.mesh.d001887","target_kind":"node","target_sha256":"5519a915edd194e948ccdd6fbe87b50f90f3981d29b1cb799f88fe6eed7e2ba0"}],"concept.mesh.d001982":[{"id":"assertion.concept.mesh.d001982","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bronchial Diseases as described in the captured NLM MeSH descriptor D001982","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bronchial Diseases as: Diseases involving the BRONCHI .","support":[{"end":425,"quote":"Diseases involving the\nBRONCHI\n.","source_id":"nlm-mesh.d001982","source_sha256":"63065524d6b5e9e76b7ab8ea943a19f67cad46c46bdcfa3c543ec5cf148f1c4f","start":393}],"target_id":"concept.mesh.d001982","target_kind":"node","target_sha256":"19b28cba22bb246cf9366c46c40bb3236a0a20c257a81776718e673fdbae8110"}],"concept.mesh.d002016":[{"id":"assertion.concept.mesh.d002016","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Buddhism as described in the captured NLM MeSH descriptor D002016","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Buddhism as: The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","support":[{"end":566,"quote":"The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","source_id":"nlm-mesh.d002016","source_sha256":"8724d2ddec952752e95946b1cb39d8bd33729ce7a06a83a570275d09504257d9","start":373}],"target_id":"concept.mesh.d002016","target_kind":"node","target_sha256":"c4ecb3286a83e5940660149d38f34e49f8201f30d431cefac3c87a56a4366522"}],"concept.mesh.d002318":[{"id":"assertion.concept.mesh.d002318","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Diseases as described in the captured NLM MeSH descriptor D002318","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Diseases as: Pathological conditions involving the CARDIOVASCULAR SYSTEM including the HEART ; the BLOOD VESSELS ; or the PERICARDIUM .","support":[{"end":513,"quote":"Pathological conditions involving the\nCARDIOVASCULAR SYSTEM\nincluding the\nHEART\n; the\nBLOOD VESSELS\n; or the\nPERICARDIUM\n.","source_id":"nlm-mesh.d002318","source_sha256":"7ecc7ed239acc6cf854a7bbf545ec974cceefa1f35803b374694a5c59176568b","start":391}],"target_id":"concept.mesh.d002318","target_kind":"node","target_sha256":"35cf2b36cabc1c3a7c0e987dfa397e4cd21dafba8a1f1da735d21f78a969a0c8"}],"concept.mesh.d002410":[{"id":"assertion.concept.mesh.d002410","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catholicism as described in the captured NLM MeSH descriptor D002410","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catholicism as: The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","support":[{"end":774,"quote":"The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","source_id":"nlm-mesh.d002410","source_sha256":"a290383b07edd1b2d92b6394506353c56c92a090431e292a372a7e95a5ddca64","start":383}],"target_id":"concept.mesh.d002410","target_kind":"node","target_sha256":"0cea2f509c9486a4e268eac663921410396b3d75bcb2759a07e3326202d770fe"}],"concept.mesh.d002493":[{"id":"assertion.concept.mesh.d002493","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Central Nervous System Diseases as described in the captured NLM MeSH descriptor D002493","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Central Nervous System Diseases as: Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","support":[{"end":563,"quote":"Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","source_id":"nlm-mesh.d002493","source_sha256":"9c5c7b8eaff8ad49e96335c0f08fae1a61565208b081cb02b58656c9f0cc91b9","start":426}],"target_id":"concept.mesh.d002493","target_kind":"node","target_sha256":"877cd8781d75a83bd1bfb71e921bbf2db54e02cad69c7540280ff85813a21896"}],"concept.mesh.d002494":[{"id":"assertion.concept.mesh.d002494","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Central Nervous System Infections as described in the captured NLM MeSH descriptor D002494","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Central Nervous System Infections as: Pathogenic infections of the brain, spinal cord, and meninges. DNA VIRUS INFECTIONS ; RNA VIRUS INFECTIONS ; BACTERIAL INFECTIONS ; MYCOPLASMA INFECTIONS ; SPIROCHAETALES INFECTIONS ; fungal infections; PROTOZOAN INFECTIONS ; HELMINTHIASIS ; and PRION DISEASES may involve the central nervous system as a primary or secondary process.","support":[{"end":833,"quote":"Pathogenic infections of the brain, spinal cord, and meninges.\nDNA VIRUS INFECTIONS\n;\nRNA VIRUS INFECTIONS\n;\nBACTERIAL INFECTIONS\n;\nMYCOPLASMA INFECTIONS\n;\nSPIROCHAETALES INFECTIONS\n; fungal infections;\nPROTOZOAN INFECTIONS\n;\nHELMINTHIASIS\n; and\nPRION DISEASES\nmay involve the central nervous system as a primary or secondary process.","source_id":"nlm-mesh.d002494","source_sha256":"7e949be890be708ad49412db0fbc9756e68a125835a86e66f472d59f3302e0ca","start":499}],"target_id":"concept.mesh.d002494","target_kind":"node","target_sha256":"78b58377a6910c4c726c58d32f5e9859b8bb3d833cad8d07e95a4ba273017890"}],"concept.mesh.d002616":[{"id":"assertion.concept.mesh.d002616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chemical Engineering as described in the captured NLM MeSH descriptor D002616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chemical Engineering as: Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","support":[{"end":503,"quote":"Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","source_id":"nlm-mesh.d002616","source_sha256":"837adb7b8b71c9aedc69bde943b92b7506df6307be269381512461137938acc6","start":356}],"target_id":"concept.mesh.d002616","target_kind":"node","target_sha256":"6bc9bc5e8a90b141d0e8ed7ebf4c874fd45cfc0a4abc16cb9f207f369f3b6ca3"}],"concept.mesh.d002652":[{"id":"assertion.concept.mesh.d002652","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Behavior as described in the captured NLM MeSH descriptor D002652","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Behavior as: Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months, INFANT BEHAVIOR is available.","support":[{"end":586,"quote":"Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months,\nINFANT BEHAVIOR\nis available.","source_id":"nlm-mesh.d002652","source_sha256":"3c6214f3f91a3dc43bf73c51d66ccf7389d22314ae9d7a480602c30e78b773e6","start":423}],"target_id":"concept.mesh.d002652","target_kind":"node","target_sha256":"96624e6ce86a3366c58e7f5dd21428fa55d10f6efc1c175739d5d6ebe95274a3"}],"concept.mesh.d002668":[{"id":"assertion.concept.mesh.d002668","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Rearing as described in the captured NLM MeSH descriptor D002668","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Rearing as: The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from PARENTING in that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","support":[{"end":1013,"quote":"The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from\nPARENTING\nin that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","source_id":"nlm-mesh.d002668","source_sha256":"64a4682c63da89f868e36924b592f7ac87295dfaf99812d24ff202128d77129c","start":547}],"target_id":"concept.mesh.d002668","target_kind":"node","target_sha256":"629f4d0ce0539c6924b99a95c35bfc0857fa6368e6e4284a820b99a8ef7106f3"}],"concept.mesh.d002835":[{"id":"assertion.concept.mesh.d002835","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Christianity as described in the captured NLM MeSH descriptor D002835","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Christianity as: The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","support":[{"end":693,"quote":"The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","source_id":"nlm-mesh.d002835","source_sha256":"e4af20e63d0ec8574492179f93565fa70f1abbab0c499dd04bc0c6d701a29a03","start":377}],"target_id":"concept.mesh.d002835","target_kind":"node","target_sha256":"6216dbdef975a2628261904a15d5baa6be12bc3ed0b458dde3673778d2a2bbea"}],"concept.mesh.d002925":[{"id":"assertion.concept.mesh.d002925","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ciliary Motility Disorders as described in the captured NLM MeSH descriptor D002925","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ciliary Motility Disorders as: Conditions caused by abnormal CILIA movement in the body, usually causing KARTAGENER SYNDROME , chronic respiratory disorders, chronic SINUSITIS , and chronic OTITIS . Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme DYNEIN arms.","support":[{"end":708,"quote":"Conditions caused by abnormal\nCILIA\nmovement in the body, usually causing\nKARTAGENER SYNDROME\n, chronic respiratory disorders, chronic\nSINUSITIS\n, and chronic\nOTITIS\n. Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme\nDYNEIN\narms.","source_id":"nlm-mesh.d002925","source_sha256":"dddbb15948c8c55caa3b7fb24a22c64c728fbf9d83853bb0ddffc3b176fff289","start":408}],"target_id":"concept.mesh.d002925","target_kind":"node","target_sha256":"85dc4abfb956c9091b9f9da80145a90032e19d0e2e5ae063ac53d94a44e6aa30"}],"concept.mesh.d002959":[{"id":"assertion.concept.mesh.d002959","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Civil Defense as described in the captured NLM MeSH descriptor D002959","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Civil Defense as: Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","support":[{"end":480,"quote":"Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","source_id":"nlm-mesh.d002959","source_sha256":"542c664b18b99971e932f499dc330d0de559dd29bebc1740b021a0ed1d204ea0","start":342}],"target_id":"concept.mesh.d002959","target_kind":"node","target_sha256":"bc234dbb99fcd0950aff0af48d5df5a879ad93d485eeb7c4acbc5adf024b689e"}],"concept.mesh.d003141":[{"id":"assertion.concept.mesh.d003141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communicable Diseases as described in the captured NLM MeSH descriptor D003141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communicable Diseases as: An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","support":[{"end":700,"quote":"An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","source_id":"nlm-mesh.d003141","source_sha256":"76a508571cfc08932ca3a3ce423061ecc35bcd871e89c0ae7f4a05b18dbfbe6c","start":429}],"target_id":"concept.mesh.d003141","target_kind":"node","target_sha256":"954326a39c26ce502d70f5216a1a336d120597be1b23e352e9f3df359a3ff82b"}],"concept.mesh.d003142":[{"id":"assertion.concept.mesh.d003142","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communication as described in the captured NLM MeSH descriptor D003142","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communication as: The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","support":[{"end":540,"quote":"The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","source_id":"nlm-mesh.d003142","source_sha256":"f6373041d39b8c566d938645b0a4908f7007ca9cbe8dde4df595880d1b5102d4","start":449}],"target_id":"concept.mesh.d003142","target_kind":"node","target_sha256":"5772c6d8171986138b6d880d93685d29b234aab161029928676bf9f794b12868"}],"concept.mesh.d003148":[{"id":"assertion.concept.mesh.d003148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Communism as described in the captured NLM MeSH descriptor D003148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Communism as: A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","support":[{"end":545,"quote":"A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","source_id":"nlm-mesh.d003148","source_sha256":"10c4c924408afcd5868d69bfe47faf70c4f785af3e557cd6cafe69b83d1f12f0","start":371}],"target_id":"concept.mesh.d003148","target_kind":"node","target_sha256":"af17c40a9397e31a4afbc5eb02064e49be02fbdcb7a9ed2b5a0c1752a1cc3208"}],"concept.mesh.d003242":[{"id":"assertion.concept.mesh.d003242","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Conscience as described in the captured NLM MeSH descriptor D003242","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Conscience as: The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","support":[{"end":477,"quote":"The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","source_id":"nlm-mesh.d003242","source_sha256":"0fdcf80f208b18bab58b04a3ea73f6baff414a3f76cc57a6c32863ebc1dcc5ae","start":356}],"target_id":"concept.mesh.d003242","target_kind":"node","target_sha256":"3998ea277987748d49d486463705fecd555f80d5dcd19e83e2278a4dfe4b4a53"}],"concept.mesh.d003258":[{"id":"assertion.concept.mesh.d003258","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Consumer Behavior as described in the captured NLM MeSH descriptor D003258","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Consumer Behavior as: Behavior associated with the procurement of goods, services, or experiences.","support":[{"end":426,"quote":"Behavior associated with the procurement of goods, services, or experiences.","source_id":"nlm-mesh.d003258","source_sha256":"e0027f1349b8a6b9fb702cd05eb0af57df79e5cdf2b437d6c2a171c0f7c80300","start":350}],"target_id":"concept.mesh.d003258","target_kind":"node","target_sha256":"52b775db3db9bf9d2eb503f58a5395a5af4e69399dac11edce0bcc3dcdbf26f7"}],"concept.mesh.d003389":[{"id":"assertion.concept.mesh.d003389","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cranial Nerve Diseases as described in the captured NLM MeSH descriptor D003389","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cranial Nerve Diseases as: Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","support":[{"end":619,"quote":"Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","source_id":"nlm-mesh.d003389","source_sha256":"ecf622bb39a90934fd3523f40fc42a9679bf70867523df4d4833a550c15d077b","start":408}],"target_id":"concept.mesh.d003389","target_kind":"node","target_sha256":"64374b8a7a039a9c069815a3ede5b60f4293f3b892ba4470f7a284728bd5d7d9"}],"concept.mesh.d003415":[{"id":"assertion.concept.mesh.d003415","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Crime as described in the captured NLM MeSH descriptor D003415","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Crime as: A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","support":[{"end":670,"quote":"A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","source_id":"nlm-mesh.d003415","source_sha256":"d27780cd2fa0236579f290aeea67bbd1654dfd681f106407c082d67c2cd884cf","start":379}],"target_id":"concept.mesh.d003415","target_kind":"node","target_sha256":"711fa8f693a3923f7fb208354ebc81503e2c9555e2a4741bb41739accfe0c211"}],"concept.mesh.d003428":[{"id":"assertion.concept.mesh.d003428","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cross Infection as described in the captured NLM MeSH descriptor D003428","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cross Infection as: Any infection which a patient contracts in a health-care institution.","support":[{"end":584,"quote":"Any infection which a patient contracts in a health-care institution.","source_id":"nlm-mesh.d003428","source_sha256":"86a984d77d89418fa96f3a9aca2002869678c237134ff69ce5bed4ff1d19c3cc","start":515}],"target_id":"concept.mesh.d003428","target_kind":"node","target_sha256":"95241079e6230b10c62ae007962b27ae6ba567e3a664c3f876ba07e1d21fd06a"}],"concept.mesh.d003560":[{"id":"assertion.concept.mesh.d003560","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cysts as described in the captured NLM MeSH descriptor D003560","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cysts as: Any fluid-filled closed cavity or sac that is lined by an EPITHELIUM . Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","support":[{"end":740,"quote":"Any fluid-filled closed cavity or sac that is lined by an\nEPITHELIUM\n. Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","source_id":"nlm-mesh.d003560","source_sha256":"6c8bacd985142003079d509b110662dc65249659a57fec41eb5b590fd06bef4b","start":597}],"target_id":"concept.mesh.d003560","target_kind":"node","target_sha256":"4c70fbe7d3b2fa3bef04585cc9427f4467893dfa5da430151e7d15c0a8d8ba6b"}],"concept.mesh.d003617":[{"id":"assertion.concept.mesh.d003617","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Dangerous Behavior as described in the captured NLM MeSH descriptor D003617","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Dangerous Behavior as: Actions which have a high risk of being harmful or injurious to oneself or others.","support":[{"end":472,"quote":"Actions which have a high risk of being harmful or injurious to oneself or others.","source_id":"nlm-mesh.d003617","source_sha256":"018b39e80dab5bf7fec26836dce398fcb3aaf01d3b9fd762318db11087c8a0f1","start":390}],"target_id":"concept.mesh.d003617","target_kind":"node","target_sha256":"51f6b4362d2da41e7c533b6aca796a430687e0011fe71852612376c3c80a8814"}],"concept.mesh.d003674":[{"id":"assertion.concept.mesh.d003674","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Defense Mechanisms as described in the captured NLM MeSH descriptor D003674","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Defense Mechanisms as: Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","support":[{"end":588,"quote":"Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","source_id":"nlm-mesh.d003674","source_sha256":"b03086833c1e403872108acee7c1627724beb1e29aec21a1dbf3c6c6149a5874","start":348}],"target_id":"concept.mesh.d003674","target_kind":"node","target_sha256":"506ded95e3b939714351ad57ebf3f14fbdf4e11188c7d599032d1434fe7e8cca"}],"concept.mesh.d003709":[{"id":"assertion.concept.mesh.d003709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Democracy as described in the captured NLM MeSH descriptor D003709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Democracy as: A system of government in which there is free and equal participation by the people in the political decision-making process.","support":[{"end":459,"quote":"A system of government in which there is free and equal participation by the people in the political decision-making process.","source_id":"nlm-mesh.d003709","source_sha256":"a35ceea3c2147f8a63e1f532f501f43e8b33fd80fdb3e60b7f4b9efc9d679c5b","start":334}],"target_id":"concept.mesh.d003709","target_kind":"node","target_sha256":"e639f8f19777f7d80c4c98b18380c503561f4bed750dc1cacd248a6fe77cc02f"}],"concept.mesh.d003711":[{"id":"assertion.concept.mesh.d003711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Demyelinating Diseases as described in the captured NLM MeSH descriptor D003711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Demyelinating Diseases as: Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","support":[{"end":456,"quote":"Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","source_id":"nlm-mesh.d003711","source_sha256":"2c0621b58ee88bd2ffd6a44dbdc174065fb98ac0e487ee9581017f0ba36e4d24","start":356}],"target_id":"concept.mesh.d003711","target_kind":"node","target_sha256":"59f1d30c4114df15c0b6f5892003328b1c9cbcae047c1e3298d0d04e118bf2b4"}],"concept.mesh.d003717":[{"id":"assertion.concept.mesh.d003717","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Denial, Psychological as described in the captured NLM MeSH descriptor D003717","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Denial, Psychological as: Refusal to admit the truth or reality of a situation or experience.","support":[{"end":425,"quote":"Refusal to admit the truth or reality of a situation or experience.","source_id":"nlm-mesh.d003717","source_sha256":"60483197c1c535651376589e7c5cbd85cdae100d8195c8cfda0da3eb7a5457e1","start":358}],"target_id":"concept.mesh.d003717","target_kind":"node","target_sha256":"041428ecfec50d66731891c8f5032c923972851f1691d660b71dc677b0801378"}],"concept.mesh.d003863":[{"id":"assertion.concept.mesh.d003863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Depression as described in the captured NLM MeSH descriptor D003863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Depression as: Depressive states usually of moderate intensity in contrast with MAJOR DEPRESSIVE DISORDER present in neurotic and psychotic disorders.","support":[{"end":754,"quote":"Depressive states usually of moderate intensity in contrast with\nMAJOR DEPRESSIVE DISORDER\npresent in neurotic and psychotic disorders.","source_id":"nlm-mesh.d003863","source_sha256":"30d388d994482e457a204dcda800b954fa367912ad8d4f9359f95cc8db2b3f49","start":619}],"target_id":"concept.mesh.d003863","target_kind":"node","target_sha256":"28c1df9377ea709db8f98dd5a7aef83429359657b9d29674cec5fba3dc36c2fd"}],"concept.mesh.d003906":[{"id":"assertion.concept.mesh.d003906","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Developing Countries as described in the captured NLM MeSH descriptor D003906","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","support":[{"end":754,"quote":"Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","source_id":"nlm-mesh.d003906","source_sha256":"f13a2cbd72d582e179f05fff4e73713a10caf209fa6d7b5888319488cab31919","start":458}],"target_id":"concept.mesh.d003906","target_kind":"node","target_sha256":"260b1dbcda3b82ac2bc4f066e9f4362243467cf7b0e0d9124486891febbc81dd"}],"concept.mesh.d004066":[{"id":"assertion.concept.mesh.d004066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Digestive System Diseases as described in the captured NLM MeSH descriptor D004066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Digestive System Diseases as: Diseases in any part of the GASTROINTESTINAL TRACT or the accessory organs ( LIVER ; BILIARY TRACT ; PANCREAS ).","support":[{"end":675,"quote":"Diseases in any part of the\nGASTROINTESTINAL TRACT\nor the accessory organs (\nLIVER\n;\nBILIARY TRACT\n;\nPANCREAS\n).","source_id":"nlm-mesh.d004066","source_sha256":"a102ead7a519ef18a744b4f56ba67642e1b57748c476fd35c7e0789d1e2602ea","start":563}],"target_id":"concept.mesh.d004066","target_kind":"node","target_sha256":"0b63151fafd37a3a6bf110bb0453baabb1c666c740d1da03811eed593fc97995"}],"concept.mesh.d004208":[{"id":"assertion.concept.mesh.d004208","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Displacement, Psychological as described in the captured NLM MeSH descriptor D004208","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Displacement, Psychological as: The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","support":[{"end":524,"quote":"The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","source_id":"nlm-mesh.d004208","source_sha256":"5a8962260b48161fa8522fe9b5e7a2f74065fe9ec39a7c99a27bdac5ad733628","start":370}],"target_id":"concept.mesh.d004208","target_kind":"node","target_sha256":"6cfc7b1741009e0d5ead24da583d5fe0f74a6db857dbf8c08d9b5bb270566f1c"}],"concept.mesh.d004311":[{"id":"assertion.concept.mesh.d004311","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Double-Blind Method as described in the captured NLM MeSH descriptor D004311","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Double-Blind Method as: A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","support":[{"end":770,"quote":"A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","source_id":"nlm-mesh.d004311","source_sha256":"a9ad6cc2c0d0d5aec77a38a7011dc86ff780af1680b3472626470b070fbec1c2","start":615}],"target_id":"concept.mesh.d004311","target_kind":"node","target_sha256":"356cf4d0bc5a44cf41a8a8c16f96f5ffda7592e786fedfad25cbb58e009f6c7e"}],"concept.mesh.d004324":[{"id":"assertion.concept.mesh.d004324","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drama as described in the captured NLM MeSH descriptor D004324","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drama as: A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":690,"quote":"A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d004324","source_sha256":"bc88d24d4456813b5b08aaa023efabfbbfe4e64c1e8a29126828ba33ea767d67","start":449}],"target_id":"concept.mesh.d004324","target_kind":"node","target_sha256":"150e3321d9b47b34d99a4ab762b6b7ff2915114a6e488c5f66bac682c4d4b606"}],"concept.mesh.d004327":[{"id":"assertion.concept.mesh.d004327","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drinking Behavior as described in the captured NLM MeSH descriptor D004327","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drinking Behavior as: Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","support":[{"end":632,"quote":"Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","source_id":"nlm-mesh.d004327","source_sha256":"c7ed0f0fafb43f33b04323973e93eb58fd2766347810fa23f4c7d3b98f76425e","start":464}],"target_id":"concept.mesh.d004327","target_kind":"node","target_sha256":"b12e2c166a74d960a3ad7927e938fb092468bc7344592dd4020c8ca0aa67927c"}],"concept.mesh.d004644":[{"id":"assertion.concept.mesh.d004644","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emotions as described in the captured NLM MeSH descriptor D004644","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emotions as: Those affective states which can be experienced and have arousing and motivational properties.","support":[{"end":448,"quote":"Those affective states which can be experienced and have arousing and motivational properties.","source_id":"nlm-mesh.d004644","source_sha256":"1a3e4945f2c0d64f7355ec35b1d0c5a20e8fe5f7770d0cc1de8cd4368d3f0d66","start":354}],"target_id":"concept.mesh.d004644","target_kind":"node","target_sha256":"8f52358a6120d4f8103595f4c11468093a969f989cb5f84fb1d9331823cfdcce"}],"concept.mesh.d004700":[{"id":"assertion.concept.mesh.d004700","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Endocrine System Diseases as described in the captured NLM MeSH descriptor D004700","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Endocrine System Diseases as: Pathological processes of the ENDOCRINE GLANDS , and diseases resulting from abnormal level of available HORMONES .","support":[{"end":590,"quote":"Pathological processes of the\nENDOCRINE GLANDS\n, and diseases resulting from abnormal level of available\nHORMONES\n.","source_id":"nlm-mesh.d004700","source_sha256":"9e82732719fb06ecd3d0c6edbcd8b4c658ba9e9e722285bb0feee0baafa3b19a","start":475}],"target_id":"concept.mesh.d004700","target_kind":"node","target_sha256":"1abcf8c7fb14eed1776deaa3fad2c67f091874a9cf412a86a0b486d3c3f83f4e"}],"concept.mesh.d004738":[{"id":"assertion.concept.mesh.d004738","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Engineering as described in the captured NLM MeSH descriptor D004738","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Engineering as: The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","support":[{"end":432,"quote":"The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","source_id":"nlm-mesh.d004738","source_sha256":"1db0201164722ca34fbfcca6e6da8987ed61734bf5a21ec67c6c1302ac7ed99a","start":334}],"target_id":"concept.mesh.d004738","target_kind":"node","target_sha256":"f7997f85548f6a9b89d1347c7bb2b6d3e543f1b8fb92e8ae9f0abeb6b2c4bb22"}],"concept.mesh.d004779":[{"id":"assertion.concept.mesh.d004779","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Environment Design as described in the captured NLM MeSH descriptor D004779","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Environment Design as: The structuring of the environment to permit or promote specific patterns of behavior.","support":[{"end":462,"quote":"The structuring of the environment to permit or promote specific patterns of behavior.","source_id":"nlm-mesh.d004779","source_sha256":"a0eddb1639a34e9f63b47be7f4252baed1733bf966ee1283e763330fb17ddeae","start":376}],"target_id":"concept.mesh.d004779","target_kind":"node","target_sha256":"d937ddd6f64bb67e515b3d98362443c74bea7534f61b8b2083c131032b10e546"}],"concept.mesh.d004924":[{"id":"assertion.concept.mesh.d004924","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Escape Reaction as described in the captured NLM MeSH descriptor D004924","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Escape Reaction as: Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","support":[{"end":583,"quote":"Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","source_id":"nlm-mesh.d004924","source_sha256":"5388749d5e09211d24ef440122b6cdecfd1e6d6b511f33c25f53cbd0fc34bb5f","start":460}],"target_id":"concept.mesh.d004924","target_kind":"node","target_sha256":"d0b89303b2bd66053c06a703de4b55b50d088804b334209ac54698deb0b4977a"}],"concept.mesh.d005086":[{"id":"assertion.concept.mesh.d005086","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Existentialism as described in the captured NLM MeSH descriptor D005086","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Existentialism as: Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","support":[{"end":792,"quote":"Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","source_id":"nlm-mesh.d005086","source_sha256":"3f239e52de9e3071a821ebf2a82896e345fd8e3b2184f7fd3aa37ff8d33586d3","start":356}],"target_id":"concept.mesh.d005086","target_kind":"node","target_sha256":"57bbbbc248562937357b643fbea1b2f24f140ae00fb583ef918c7fc94870aaf8"}],"concept.mesh.d005106":[{"id":"assertion.concept.mesh.d005106","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Exploratory Behavior as described in the captured NLM MeSH descriptor D005106","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Exploratory Behavior as: The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","support":[{"end":527,"quote":"The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","source_id":"nlm-mesh.d005106","source_sha256":"2887ab4c887eae2c07d3169fa6635ccca484505353608da18e132dca10c030b4","start":394}],"target_id":"concept.mesh.d005106","target_kind":"node","target_sha256":"9bfd81544f8fec776fe8bbd3c28c6bf5053f8c177631fd5f45f83146353eeb9b"}],"concept.mesh.d005201":[{"id":"assertion.concept.mesh.d005201","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fantasy as described in the captured NLM MeSH descriptor D005201","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fantasy as: An imagined sequence of events or mental images, e.g., daydreams.","support":[{"end":415,"quote":"An imagined sequence of events or mental images, e.g., daydreams.","source_id":"nlm-mesh.d005201","source_sha256":"f3544b72b39c6e62eba3e9f87574299270d2eba27f4eea3d67749e32eb74de42","start":350}],"target_id":"concept.mesh.d005201","target_kind":"node","target_sha256":"21c00a4443a9739d1d497bec2f331bf0b41c5b8939520c93202802b4817b19fc"}],"concept.mesh.d005247":[{"id":"assertion.concept.mesh.d005247","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feeding Behavior as described in the captured NLM MeSH descriptor D005247","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feeding Behavior as: Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","support":[{"end":773,"quote":"Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","source_id":"nlm-mesh.d005247","source_sha256":"e2bce8a047b89d57fab4a04931f308e730977c601855e01feeace1fa5c0d21b4","start":640}],"target_id":"concept.mesh.d005247","target_kind":"node","target_sha256":"1305c8a7ffcc67a3ef9205b412b89266cb43228a97ea7c7d29c7eb31730dd8af"}],"concept.mesh.d005490":[{"id":"assertion.concept.mesh.d005490","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Focal Infection as described in the captured NLM MeSH descriptor D005490","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Focal Infection as: An infection at a specific location that may spread to another region of the body.","support":[{"end":532,"quote":"An infection at a specific location that may spread to another region of the body.","source_id":"nlm-mesh.d005490","source_sha256":"b47be12109914a5a7e1028e662d77c88b66c9538e6a00be7645ec8154bffa133","start":450}],"target_id":"concept.mesh.d005490","target_kind":"node","target_sha256":"57b5c610d2665c09c2ddce6af32e3c6d8e3aa66b5c065417e4bb42a31156247d"}],"concept.mesh.d005495":[{"id":"assertion.concept.mesh.d005495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Folklore as described in the captured NLM MeSH descriptor D005495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Folklore as: The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","support":[{"end":465,"quote":"The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","source_id":"nlm-mesh.d005495","source_sha256":"c5d07c9d061ebb7c599db41ccd89e5658517323f7c522afcd5df52b118fe9f51","start":352}],"target_id":"concept.mesh.d005495","target_kind":"node","target_sha256":"c9f3df1a276a80ba6059dbdce16c1a7c5db6936842673344e300dd073af841af"}],"concept.mesh.d005544":[{"id":"assertion.concept.mesh.d005544","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forecasting as described in the captured NLM MeSH descriptor D005544","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forecasting as: The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","support":[{"end":694,"quote":"The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","source_id":"nlm-mesh.d005544","source_sha256":"ed66672bfe690c2b4020763c8fb37c1735c599c5032cf36b396483d5e4a50686","start":486}],"target_id":"concept.mesh.d005544","target_kind":"node","target_sha256":"f6b02387f71b34173299dac4f60b5be505a8944bbd22a6a6022464aae298bda2"}],"concept.mesh.d005553":[{"id":"assertion.concept.mesh.d005553","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Dentistry as described in the captured NLM MeSH descriptor D005553","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Dentistry as: The application of dental knowledge to questions of law.","support":[{"end":556,"quote":"The application of dental knowledge to questions of law.","source_id":"nlm-mesh.d005553","source_sha256":"8f5c28d560310e230940c71ceaba042ad4f3e758fb42cb9e6a8fdccf06f6e04f","start":500}],"target_id":"concept.mesh.d005553","target_kind":"node","target_sha256":"f6348359abba6f596f96de24d1d5502af281cbb88cf09f0085deda86d6fe65ce"}],"concept.mesh.d005607":[{"id":"assertion.concept.mesh.d005607","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fraud as described in the captured NLM MeSH descriptor D005607","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fraud as: Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","support":[{"end":564,"quote":"Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","source_id":"nlm-mesh.d005607","source_sha256":"9d3a504bc9fa63b8d5fa9766ea957a69212da25d59f37fd55af704ebb2426958","start":464}],"target_id":"concept.mesh.d005607","target_kind":"node","target_sha256":"1c1b7f253fa50f98c969b743e611b6853cf4b774cafa1f729f63b07b1e98be94"}],"concept.mesh.d005789":[{"id":"assertion.concept.mesh.d005789","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genealogy and Heraldry as described in the captured NLM MeSH descriptor D005789","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genealogy and Heraldry as: Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","support":[{"end":551,"quote":"Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","source_id":"nlm-mesh.d005789","source_sha256":"a10c98f50e3518301e452b4b480a3b225dabac3cce4dfd44e95f9473f795ebc0","start":422}],"target_id":"concept.mesh.d005789","target_kind":"node","target_sha256":"eafacef7545a54ab1571411deecf0b61331fc429986a1f66317a05629de3d9b5"}],"concept.mesh.d005891":[{"id":"assertion.concept.mesh.d005891","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Gingivitis as described in the captured NLM MeSH descriptor D005891","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Gingivitis as: Inflammation of gum tissue ( GINGIVA ) without loss of connective tissue.","support":[{"end":425,"quote":"Inflammation of gum tissue (\nGINGIVA\n) without loss of connective tissue.","source_id":"nlm-mesh.d005891","source_sha256":"275e734aab2b8fdf03815ecc999215af383136687223d0dbc67b7520685529dd","start":352}],"target_id":"concept.mesh.d005891","target_kind":"node","target_sha256":"38e6cf100d485d92e31df8045f83be7ae9be8fc78909aab8693f48a31b07bbb6"}],"concept.mesh.d006076":[{"id":"assertion.concept.mesh.d006076","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government as described in the captured NLM MeSH descriptor D006076","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government as: The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","support":[{"end":521,"quote":"The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","source_id":"nlm-mesh.d006076","source_sha256":"6cd9de2cb4e90d2fd431bb985141dd4f3acf4ec464eec72a85bf5f4067c0a869","start":380}],"target_id":"concept.mesh.d006076","target_kind":"node","target_sha256":"9e4f1f19a82bc41945d1af6baad45b9efe2baf2ff04fdce54bb670a56d2612be"}],"concept.mesh.d006077":[{"id":"assertion.concept.mesh.d006077","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government Agencies as described in the captured NLM MeSH descriptor D006077","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government Agencies as: Administrative units of government responsible for policy making and management of governmental activities.","support":[{"end":570,"quote":"Administrative units of government responsible for policy making and management of governmental activities.","source_id":"nlm-mesh.d006077","source_sha256":"ae57ed06ebfc7ad9b2f86e483aa560a6a8799c05be42a47e4d532cc50122253e","start":463}],"target_id":"concept.mesh.d006077","target_kind":"node","target_sha256":"89192da8431d0f5b1d2439d1bc6cff371c6ecadc17dd2005435678d06fb25ec4"}],"concept.mesh.d006078":[{"id":"assertion.concept.mesh.d006078","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Government Programs as described in the captured NLM MeSH descriptor D006078","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Government Programs as: Programs and activities sponsored or administered by local, state, or national governments.","support":[{"end":558,"quote":"Programs and activities sponsored or administered by local, state, or national governments.","source_id":"nlm-mesh.d006078","source_sha256":"94c73e658bbebae8788c054fefd2eb33b8d59a28e728b115244ea0df128889e1","start":467}],"target_id":"concept.mesh.d006078","target_kind":"node","target_sha256":"13fa748b29e0abb16d58af98a2f83e9d30230ac7130bd0ea79131bafcd0813eb"}],"concept.mesh.d006184":[{"id":"assertion.concept.mesh.d006184","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Habits as described in the captured NLM MeSH descriptor D006184","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Habits as: Acquired or learned responses which are regularly manifested.","support":[{"end":536,"quote":"Acquired or learned responses which are regularly manifested.","source_id":"nlm-mesh.d006184","source_sha256":"d7d7ae2c60449de331faf7e4efa93751d75e12d04aa74125a577e841f2d17828","start":475}],"target_id":"concept.mesh.d006184","target_kind":"node","target_sha256":"a17b387b0b1e9fd892178e967914a3c1aa87b5064c3fc52c7b48bc1787d1e121"}],"concept.mesh.d006222":[{"id":"assertion.concept.mesh.d006222","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hamartoma as described in the captured NLM MeSH descriptor D006222","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hamartoma as: A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","support":[{"end":544,"quote":"A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","source_id":"nlm-mesh.d006222","source_sha256":"80295cc5bf6c31589903f32302dbf46ac8e0b53a14b0af546da2b7f6bbe0d203","start":405}],"target_id":"concept.mesh.d006222","target_kind":"node","target_sha256":"b3e5473af1d7943037a936160b5ef6aa5160001dc26b66d4a2984066199d181c"}],"concept.mesh.d006302":[{"id":"assertion.concept.mesh.d006302","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Services Research as described in the captured NLM MeSH descriptor D006302","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Services Research as: The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","support":[{"end":794,"quote":"The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","source_id":"nlm-mesh.d006302","source_sha256":"7ed2b7661cb614af8e3c662663c378ae92713182408bd6798b74e61bc3113d60","start":392}],"target_id":"concept.mesh.d006302","target_kind":"node","target_sha256":"59622b1e9f0fef50adbb440f874d5f97259a020645e77a214aa0fe21f18e39c6"}],"concept.mesh.d006304":[{"id":"assertion.concept.mesh.d006304","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Status as described in the captured NLM MeSH descriptor D006304","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","support":[{"end":507,"quote":"The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","source_id":"nlm-mesh.d006304","source_sha256":"8b83df928e2399496d2aef3b441acc58862722544ec937c7b3403f31dc552fe3","start":374}],"target_id":"concept.mesh.d006304","target_kind":"node","target_sha256":"8d9deac234c0d56553429433673cfc34ab76e5c99edec907bf177e5fed7175d3"}],"concept.mesh.d006331":[{"id":"assertion.concept.mesh.d006331","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Heart Diseases as described in the captured NLM MeSH descriptor D006331","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Heart Diseases as: Pathological conditions involving the HEART including its structural and functional abnormalities.","support":[{"end":438,"quote":"Pathological conditions involving the\nHEART\nincluding its structural and functional abnormalities.","source_id":"nlm-mesh.d006331","source_sha256":"81cffe3a2a7f19f9a26003bd90dda2ca6b30324f6fdca08638965d09a6bb662c","start":340}],"target_id":"concept.mesh.d006331","target_kind":"node","target_sha256":"43b71e25caf2d899a142bd1ce2bd7f663b94ba007c068ab1969f53cea37b4cd3"}],"concept.mesh.d006380":[{"id":"assertion.concept.mesh.d006380","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Helplessness, Learned as described in the captured NLM MeSH descriptor D006380","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Helplessness, Learned as: Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","support":[{"end":827,"quote":"Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","source_id":"nlm-mesh.d006380","source_sha256":"eaed75f11eecf0f64244b10c652cfc93a6f9edf66abdfced85cf9f7d9a86a5d6","start":374}],"target_id":"concept.mesh.d006380","target_kind":"node","target_sha256":"f9b961ebad6e249da1b17042375b7fe234861af9bb7914c7aa90a4e310765b8f"}],"concept.mesh.d006425":[{"id":"assertion.concept.mesh.d006425","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hemic and Lymphatic Diseases as described in the captured NLM MeSH descriptor D006425","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hemic and Lymphatic Diseases as: Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g., ERYTHROCYTE AGGREGATION, INTRAVASCULAR ) and chemical components (e.g., BLOOD PROTEIN DISORDERS ); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","support":[{"end":764,"quote":"Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g.,\nERYTHROCYTE AGGREGATION, INTRAVASCULAR\n) and chemical components (e.g.,\nBLOOD PROTEIN DISORDERS\n); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","source_id":"nlm-mesh.d006425","source_sha256":"ce31f048f2a1e0ba43f8cadce90f2f1b3e09826184d3caaffba1781d921068f5","start":438}],"target_id":"concept.mesh.d006425","target_kind":"node","target_sha256":"b3ed3da8900118426f1ef4cab15eced42ecac5ff44f8288d9c53d6118a8136e2"}],"concept.mesh.d006520":[{"id":"assertion.concept.mesh.d006520","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hepatitis, Animal as described in the captured NLM MeSH descriptor D006520","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hepatitis, Animal as: INFLAMMATION of the LIVER in non-human animals.","support":[{"end":755,"quote":"INFLAMMATION\nof the\nLIVER\nin non-human animals.","source_id":"nlm-mesh.d006520","source_sha256":"bd4e034db8ad656a05928e406bacce571e22bbaf8feaad4e90350c501fc21503","start":708}],"target_id":"concept.mesh.d006520","target_kind":"node","target_sha256":"820d7280f0da2c71a460890e162b9eeea47ebe6e9d35765d5c00275d005b5283"}],"concept.mesh.d006665":[{"id":"assertion.concept.mesh.d006665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Dentistry as described in the captured NLM MeSH descriptor D006665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Dentistry as: Study of past events and development in the field of DENTISTRY .","support":[{"end":526,"quote":"Study of past events and development in the field of\nDENTISTRY\n.","source_id":"nlm-mesh.d006665","source_sha256":"9383aa3e5f7384d5a40e75154f4921def7b29c4ec3e36848d2f37e76d2ca503e","start":462}],"target_id":"concept.mesh.d006665","target_kind":"node","target_sha256":"b8a609da6d22ba750955602d49c8de3cde130e76c8cc110ba5890886030df40d"}],"concept.mesh.d006676":[{"id":"assertion.concept.mesh.d006676","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Nursing as described in the captured NLM MeSH descriptor D006676","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Nursing as: Study of past events and development in the field of Nursing.","support":[{"end":517,"quote":"Study of past events and development in the field of Nursing.","source_id":"nlm-mesh.d006676","source_sha256":"8206b5587b80824d325d9551271156642f32985345a7c4de126ef26d75402eba","start":456}],"target_id":"concept.mesh.d006676","target_kind":"node","target_sha256":"253b8a95e0d34c2cc92f52fbf4e3eed1650e1a8fbeebe29713ac51266b3f5094"}],"concept.mesh.d006694":[{"id":"assertion.concept.mesh.d006694","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Holistic Health as described in the captured NLM MeSH descriptor D006694","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Holistic Health as: Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","support":[{"end":578,"quote":"Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","source_id":"nlm-mesh.d006694","source_sha256":"75731c80471f548c2e128b7825dfe3969e02214e9565938fea8f87aca3893b5f","start":445}],"target_id":"concept.mesh.d006694","target_kind":"node","target_sha256":"b457e2c3227f3c586d52a82af49ac68365cd167ba88a8b1657fe30b24ef2112a"}],"concept.mesh.d006708":[{"id":"assertion.concept.mesh.d006708","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Homicide as described in the captured NLM MeSH descriptor D006708","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Homicide as: The killing of one person by another.","support":[{"end":389,"quote":"The killing of one person by another.","source_id":"nlm-mesh.d006708","source_sha256":"567a210540373efdff1f0b8bd1f4d6bf07decab9e0bb0236cdc49ba4b9451335","start":352}],"target_id":"concept.mesh.d006708","target_kind":"node","target_sha256":"c385d4f91271d3b1d0736f618d67efcae581ea3d42808d872ddc7cb058bf7757"}],"concept.mesh.d006803":[{"id":"assertion.concept.mesh.d006803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Development as described in the captured NLM MeSH descriptor D006803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","support":[{"end":487,"quote":"Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","source_id":"nlm-mesh.d006803","source_sha256":"504440dbd5ae7f6c0367d11cf791ae0cad5d8738692397ba4b01a339ffd79d91","start":358}],"target_id":"concept.mesh.d006803","target_kind":"node","target_sha256":"b7f8f9a519750126dd8fecc4585e694f7238e72a710480b0aab6454caa5421f1"}],"concept.mesh.d006805":[{"id":"assertion.concept.mesh.d006805","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Experimentation as described in the captured NLM MeSH descriptor D006805","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Experimentation as: The use of humans as investigational subjects.","support":[{"end":629,"quote":"The use of humans as investigational subjects.","source_id":"nlm-mesh.d006805","source_sha256":"68a148cae6999294f9b8321532f5a364fd65a7ba000f781e9e323707aa22c2c6","start":583}],"target_id":"concept.mesh.d006805","target_kind":"node","target_sha256":"2d22f2854873e7805b47afa253c4659c697a246c1adfe73ece18edfe257411c4"}],"concept.mesh.d006808":[{"id":"assertion.concept.mesh.d006808","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humanism as described in the captured NLM MeSH descriptor D006808","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","support":[{"end":503,"quote":"An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","source_id":"nlm-mesh.d006808","source_sha256":"39a29c5af7ec4e9b18d34cc9a3c5cbc3e3355fc7c0115772f1557b1bc59721f1","start":352}],"target_id":"concept.mesh.d006808","target_kind":"node","target_sha256":"f204673a68c274f12e1c2f1d3d2a388dbbead2d14cfe5d99be2fe5ec3f3bf1fd"}],"concept.mesh.d006809":[{"id":"assertion.concept.mesh.d006809","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humanities as described in the captured NLM MeSH descriptor D006809","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humanities as: Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","support":[{"end":507,"quote":"Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","source_id":"nlm-mesh.d006809","source_sha256":"02303a53c628a48ef2a871e3907014588494760810dd68d43086c1b4e11bded9","start":328}],"target_id":"concept.mesh.d006809","target_kind":"node","target_sha256":"80f5880a2052bc47c428d6ad98657a4aa071eb0486285f7039c63b2f7d16c2d9"}],"concept.mesh.d007062":[{"id":"assertion.concept.mesh.d007062","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Identification, Psychological as described in the captured NLM MeSH descriptor D007062","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Identification, Psychological as: A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","support":[{"end":661,"quote":"A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","source_id":"nlm-mesh.d007062","source_sha256":"4b79983c699d946e848ac83ff92e24b5369a4a7f9d7e8064a0304e5b9bc6658d","start":390}],"target_id":"concept.mesh.d007062","target_kind":"node","target_sha256":"57508d135d5290e59d696c2fa709dd168fb01a081cb2991a38f2e8b4fd6f507c"}],"concept.mesh.d007100":[{"id":"assertion.concept.mesh.d007100","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Imitative Behavior as described in the captured NLM MeSH descriptor D007100","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Imitative Behavior as: The mimicking of the behavior of one individual by another.","support":[{"end":437,"quote":"The mimicking of the behavior of one individual by another.","source_id":"nlm-mesh.d007100","source_sha256":"c0158db6f86b92ed053a028fb147827d77654c073a5ee9627316a3e578458d39","start":378}],"target_id":"concept.mesh.d007100","target_kind":"node","target_sha256":"9c0824216af1e2247b23d5e57592ed47a7bc2f87fa394651c7f8a6b018c75ea7"}],"concept.mesh.d007154":[{"id":"assertion.concept.mesh.d007154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immune System Diseases as described in the captured NLM MeSH descriptor D007154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immune System Diseases as: Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","support":[{"end":507,"quote":"Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","source_id":"nlm-mesh.d007154","source_sha256":"17a73af538219010e9fe75c643eb080ab7f2033a401d2e7043f7e798e2da2fbf","start":404}],"target_id":"concept.mesh.d007154","target_kind":"node","target_sha256":"1452ac5884bc4922a29825a31e6b576991a7fbca8163eaf0369af48a45aa1359"}],"concept.mesh.d007175":[{"id":"assertion.concept.mesh.d007175","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Impulsive Behavior as described in the captured NLM MeSH descriptor D007175","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Impulsive Behavior as: An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","support":[{"end":461,"quote":"An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","source_id":"nlm-mesh.d007175","source_sha256":"70a242392e9e220902b3194dfa8e9243f8deba50da1d2144fabbbdf45d7dd0b4","start":352}],"target_id":"concept.mesh.d007175","target_kind":"node","target_sha256":"7614e1aa0c82d853a3da2370362ea87ce756b16523dd2c36546a9c04e9c908e2"}],"concept.mesh.d007239":[{"id":"assertion.concept.mesh.d007239","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Infections as described in the captured NLM MeSH descriptor D007239","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Infections as: Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","support":[{"end":548,"quote":"Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","source_id":"nlm-mesh.d007239","source_sha256":"a95e76ebdec17a887a796768a0bc7b6c6ef46a7f17f815e26fc74f440e021ff1","start":417}],"target_id":"concept.mesh.d007239","target_kind":"node","target_sha256":"404287bbb20407ce8761d898f2ae32361b1fc8d882157f0152958fc951acc29b"}],"concept.mesh.d007266":[{"id":"assertion.concept.mesh.d007266","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Inhibition, Psychological as described in the captured NLM MeSH descriptor D007266","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Inhibition, Psychological as: The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","support":[{"end":622,"quote":"The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","source_id":"nlm-mesh.d007266","source_sha256":"dc0fa92cb3cad944056dbb7ec28ecd8d7a19ed6a3c0aa271710470d3e813793d","start":424}],"target_id":"concept.mesh.d007266","target_kind":"node","target_sha256":"0bb914d9b622ba1ef8bb500b7b8f2408ab14427f391c9830922009304baca0ba"}],"concept.mesh.d007391":[{"id":"assertion.concept.mesh.d007391","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"International Cooperation as described in the captured NLM MeSH descriptor D007391","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes International Cooperation as: The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","support":[{"end":635,"quote":"The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","source_id":"nlm-mesh.d007391","source_sha256":"924f625e66585ed9871615c483f1b9202ca7122085edf2a7e69344d18899b36e","start":514}],"target_id":"concept.mesh.d007391","target_kind":"node","target_sha256":"2d1a096c9502afd9a18d05718c991070fbff36829a0fcea5d98c344ebe4504ce"}],"concept.mesh.d007514":[{"id":"assertion.concept.mesh.d007514","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Islam as described in the captured NLM MeSH descriptor D007514","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Islam as: A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","support":[{"end":462,"quote":"A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","source_id":"nlm-mesh.d007514","source_sha256":"3e9e23992347a96c1bbd5ff717f1c3242531249d7644c8b0d0e6215845694dcc","start":378}],"target_id":"concept.mesh.d007514","target_kind":"node","target_sha256":"e4fdef3ea84af9360bbfb7e191a8240cf1a961001588236f531c4c6d93927693"}],"concept.mesh.d007599":[{"id":"assertion.concept.mesh.d007599","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Judaism as described in the captured NLM MeSH descriptor D007599","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Judaism as: The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","support":[{"end":502,"quote":"The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","source_id":"nlm-mesh.d007599","source_sha256":"4230870030e7c05e21eb25c62c73b812490670399ce6d93b3bceb6743cccd1f8","start":408}],"target_id":"concept.mesh.d007599","target_kind":"node","target_sha256":"ddb14d282c4bd3197645fe9b0f607f6cf9cff7ffd6986824fc68863ed669f444"}],"concept.mesh.d007757":[{"id":"assertion.concept.mesh.d007757","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laboratory Infection as described in the captured NLM MeSH descriptor D007757","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laboratory Infection as: Accidentally acquired infection in laboratory workers.","support":[{"end":528,"quote":"Accidentally acquired infection in laboratory workers.","source_id":"nlm-mesh.d007757","source_sha256":"99bd9301eb6c4de3b191a00f09be71ff6737d4424c108d47b9794f9fdfed43bf","start":474}],"target_id":"concept.mesh.d007757","target_kind":"node","target_sha256":"8525b320f5f5da683ec99a3c88bf2e19a16e0cc10993a743bf0bd4ad0cea6e95"}],"concept.mesh.d007818":[{"id":"assertion.concept.mesh.d007818","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laryngeal Diseases as described in the captured NLM MeSH descriptor D007818","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laryngeal Diseases as: Pathological processes involving any part of the LARYNX which coordinates many functions such as voice production, breathing, swallowing, and coughing.","support":[{"end":552,"quote":"Pathological processes involving any part of the\nLARYNX\nwhich coordinates many functions such as voice production, breathing, swallowing, and coughing.","source_id":"nlm-mesh.d007818","source_sha256":"05194e351732ef20f18cfe204d6c47be9c84ec245e055acf3546250d4f176581","start":401}],"target_id":"concept.mesh.d007818","target_kind":"node","target_sha256":"e08ca59d9fb7dc788513085c0ea8577b111eb77729e56788c164a71e7e3624fb"}],"concept.mesh.d008119":[{"id":"assertion.concept.mesh.d008119","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Lobbying as described in the captured NLM MeSH descriptor D008119","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Lobbying as: A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","support":[{"end":505,"quote":"A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","source_id":"nlm-mesh.d008119","source_sha256":"196a4e8a3768700d2dc017c2a9a55329fb627ee40d30ae8e765a8e1a41a076f7","start":332}],"target_id":"concept.mesh.d008119","target_kind":"node","target_sha256":"7ca92a3f560aeaeff4f49ccda1643614c8b54d6107e0b4ad02272f533ec9b1e2"}],"concept.mesh.d008171":[{"id":"assertion.concept.mesh.d008171","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Lung Diseases as described in the captured NLM MeSH descriptor D008171","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Lung Diseases as: Pathological processes involving any part of the LUNG .","support":[{"end":504,"quote":"Pathological processes involving any part of the\nLUNG\n.","source_id":"nlm-mesh.d008171","source_sha256":"d6f5a4a73edbfe2ce38f3798ab4fd621435aa8275a44bd8a5072a45b61313ded","start":449}],"target_id":"concept.mesh.d008171","target_kind":"node","target_sha256":"76496654e1a762420659d424f3474bc6e29e05d4a992729d9252e0d1180ebfbf"}],"concept.mesh.d008328":[{"id":"assertion.concept.mesh.d008328","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Man-Machine Systems as described in the captured NLM MeSH descriptor D008328","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Man-Machine Systems as: A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","support":[{"end":577,"quote":"A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","source_id":"nlm-mesh.d008328","source_sha256":"6073012aaf066cefea4a731e3ee7041ee1426726a6f1633b3d90a18804025c95","start":455}],"target_id":"concept.mesh.d008328","target_kind":"node","target_sha256":"474952400016d35f3b21e31f920b25e065f3707d6187295cc246024e9f3f12cb"}],"concept.mesh.d008488":[{"id":"assertion.concept.mesh.d008488","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Illustration as described in the captured NLM MeSH descriptor D008488","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Illustration as: The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","support":[{"end":836,"quote":"The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","source_id":"nlm-mesh.d008488","source_sha256":"57d4e42d6d401c785604463e71536eab32324a979d07f54b505359bbc2da3244","start":611}],"target_id":"concept.mesh.d008488","target_kind":"node","target_sha256":"acde97a0f3d5da05eb6891913d52d89a7635a944ce7e41afc5e75025ffb2167b"}],"concept.mesh.d008512":[{"id":"assertion.concept.mesh.d008512","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine in the Arts as described in the captured NLM MeSH descriptor D008512","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine in the Arts as: Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","support":[{"end":540,"quote":"Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","source_id":"nlm-mesh.d008512","source_sha256":"fce9174a651a5b44a41970d1d259dbeeb260db5aecc20ddd0f486cb46f054927","start":434}],"target_id":"concept.mesh.d008512","target_kind":"node","target_sha256":"8529855dbe0c705c58a779eaff10ac4f848e2df0181ecc9edfb10d26f70e3adc"}],"concept.mesh.d008904":[{"id":"assertion.concept.mesh.d008904","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Miniaturization as described in the captured NLM MeSH descriptor D008904","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Miniaturization as: The design or construction of objects greatly reduced in scale.","support":[{"end":409,"quote":"The design or construction of objects greatly reduced in scale.","source_id":"nlm-mesh.d008904","source_sha256":"ed26463c876eac6f5e826b95f7f1bbdd4d245e2b87dfa06737da324af12557e1","start":346}],"target_id":"concept.mesh.d008904","target_kind":"node","target_sha256":"edc06d7cee3959d2b89653825bf597915b07129f20c00ca56657960f757c2b9e"}],"concept.mesh.d008921":[{"id":"assertion.concept.mesh.d008921","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religious Missions as described in the captured NLM MeSH descriptor D008921","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religious Missions as: Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","support":[{"end":625,"quote":"Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","source_id":"nlm-mesh.d008921","source_sha256":"1d160f20f3844f0e495682c57827d1f399289f0f1ad581242e848d3d21e00af8","start":432}],"target_id":"concept.mesh.d008921","target_kind":"node","target_sha256":"59b34d9b4a0789ac635237bdf082dd10bf288bc13bca9ecfdd7767c30a0f781d"}],"concept.mesh.d008953":[{"id":"assertion.concept.mesh.d008953","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Anatomic as described in the captured NLM MeSH descriptor D008953","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Anatomic as: Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","support":[{"end":543,"quote":"Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","source_id":"nlm-mesh.d008953","source_sha256":"ff0e65f7430a6c7be42b60cdeb0da1b0ab7d52b722ccc57f09b2919f87fffed5","start":388}],"target_id":"concept.mesh.d008953","target_kind":"node","target_sha256":"ae0b6b47c1a68f949e858b9254d9a196e77f8497e8bfec8d177b13e71dd6dfb5"}],"concept.mesh.d008961":[{"id":"assertion.concept.mesh.d008961","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Structural as described in the captured NLM MeSH descriptor D008961","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Structural as: A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":541,"quote":"A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d008961","source_sha256":"418670802ea23de50feab6a042e0162325645da0dd5cb9f9df63e18b2b6ab78a","start":384}],"target_id":"concept.mesh.d008961","target_kind":"node","target_sha256":"f9f532cdb9dcf34b348fa17e60ce0bf287de28a8695b20144a33c4d0e6aba2f4"}],"concept.mesh.d009014":[{"id":"assertion.concept.mesh.d009014","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Morals as described in the captured NLM MeSH descriptor D009014","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Morals as: Standards of conduct that distinguish right from wrong.","support":[{"end":395,"quote":"Standards of conduct that distinguish right from wrong.","source_id":"nlm-mesh.d009014","source_sha256":"a67120d82a9013f0ce9ff46307f3a0e843e7e6ecc7f4ddf3301070de4eb76b11","start":340}],"target_id":"concept.mesh.d009014","target_kind":"node","target_sha256":"0cc086bb377776132bb27e11702fed741464ab352376fe28932911fa6999dc00"}],"concept.mesh.d009040":[{"id":"assertion.concept.mesh.d009040","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motion Pictures as described in the captured NLM MeSH descriptor D009040","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motion Pictures as: The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","support":[{"end":640,"quote":"The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","source_id":"nlm-mesh.d009040","source_sha256":"1983fc30e4c7092693d8be0bdc5782e8fc32d08e17be146c544b495bfc972c9c","start":533}],"target_id":"concept.mesh.d009040","target_kind":"node","target_sha256":"79866710adc45f7dcf080b6ba41f517cd519c41b4694b3930998196e410594d1"}],"concept.mesh.d009042":[{"id":"assertion.concept.mesh.d009042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motivation as described in the captured NLM MeSH descriptor D009042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motivation as: Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","support":[{"end":550,"quote":"Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","source_id":"nlm-mesh.d009042","source_sha256":"13d3262333474c160cc63f5f68567e66f10d28f4397f80446fa95e82908367f3","start":378}],"target_id":"concept.mesh.d009042","target_kind":"node","target_sha256":"942a0427a91ee9a7b3776cb4ca409be0de7f8dc0ccd8432f2779200dd16308ab"}],"concept.mesh.d009043":[{"id":"assertion.concept.mesh.d009043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Motor Activity as described in the captured NLM MeSH descriptor D009043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Motor Activity as: Body movements of a human or an animal as a behavioral phenomenon.","support":[{"end":537,"quote":"Body movements of a human or an animal as a behavioral phenomenon.","source_id":"nlm-mesh.d009043","source_sha256":"8264c913846f846785c6d2a9b7b34c176233777c2501b78bbbf3e091c14b997a","start":471}],"target_id":"concept.mesh.d009043","target_kind":"node","target_sha256":"766348eb42732db692525cafa08b6cc443321d4b2699dfc86ec432c0b7315116"}],"concept.mesh.d009111":[{"id":"assertion.concept.mesh.d009111","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Local Government as described in the captured NLM MeSH descriptor D009111","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Local Government as: Smallest political subdivisions within a country at which general governmental functions are carried-out.","support":[{"end":498,"quote":"Smallest political subdivisions within a country at which general governmental functions are carried-out.","source_id":"nlm-mesh.d009111","source_sha256":"71de485a305dfd4f1fb560039e934c9267e0cafc65d388fd4951134e7de36781","start":393}],"target_id":"concept.mesh.d009111","target_kind":"node","target_sha256":"8f66eda2327bc4c99926016384a4909c74696813bd78506fb67aa8bb010eb6f8"}],"concept.mesh.d009140":[{"id":"assertion.concept.mesh.d009140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Musculoskeletal Diseases as described in the captured NLM MeSH descriptor D009140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Musculoskeletal Diseases as: Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","support":[{"end":565,"quote":"Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","source_id":"nlm-mesh.d009140","source_sha256":"5c42512926737aff00a3bac718983c347866572b762db6b9e47bb8e3a4eef389","start":431}],"target_id":"concept.mesh.d009140","target_kind":"node","target_sha256":"c6a934fd24eec4deb9ca9a46e14a6359434e5d568484d8c7b07d2e78c4b85d8e"}],"concept.mesh.d009228":[{"id":"assertion.concept.mesh.d009228","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mysticism as described in the captured NLM MeSH descriptor D009228","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mysticism as: A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","support":[{"end":499,"quote":"A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","source_id":"nlm-mesh.d009228","source_sha256":"c8b631a5d28012577cc8b6f91c8080d8fe55187977901dcc16f1e2d216eed2bc","start":379}],"target_id":"concept.mesh.d009228","target_kind":"node","target_sha256":"5167356609d00889a0b6de62688e4ec750c07a72d2319f6458b89f9061b24539"}],"concept.mesh.d009369":[{"id":"assertion.concept.mesh.d009369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms as described in the captured NLM MeSH descriptor D009369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms as: New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","support":[{"end":653,"quote":"New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","source_id":"nlm-mesh.d009369","source_sha256":"9398564d5b89bde06ccde32a3abd9b98340504d46c003e294068b1ec2dd6faa2","start":486}],"target_id":"concept.mesh.d009369","target_kind":"node","target_sha256":"d50dc5f2d1f8bc4ab6f203c23c5119aa9ede709b94575a8cafafa89759a705c7"}],"concept.mesh.d009370":[{"id":"assertion.concept.mesh.d009370","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms by Histologic Type as described in the captured NLM MeSH descriptor D009370","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms by Histologic Type as: A collective term for the various histological types of NEOPLASMS . It is more likely to be used by searchers than by indexers and catalogers.","support":[{"end":584,"quote":"A collective term for the various histological types of\nNEOPLASMS\n. It is more likely to be used by searchers than by indexers and catalogers.","source_id":"nlm-mesh.d009370","source_sha256":"e6d22cff1ab11cd51b2f7ef99d74281c7201d048e722a366efc37b25f90cb9d5","start":442}],"target_id":"concept.mesh.d009370","target_kind":"node","target_sha256":"edc1c89375c2d3304f7caa4559017ce69853b7a6beb98455357a7f02f96169fe"}],"concept.mesh.d009371":[{"id":"assertion.concept.mesh.d009371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms by Site as described in the captured NLM MeSH descriptor D009371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms by Site as: A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as BRAIN NEOPLASMS ; DUODENAL NEOPLASMS ; LIVER NEOPLASMS ; etc.","support":[{"end":574,"quote":"A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as\nBRAIN NEOPLASMS\n;\nDUODENAL NEOPLASMS\n;\nLIVER NEOPLASMS\n; etc.","source_id":"nlm-mesh.d009371","source_sha256":"d8ed9a73f5a64d553402bdea5a78fe6e1cb9105346440d71cea0fb33f2e95b84","start":420}],"target_id":"concept.mesh.d009371","target_kind":"node","target_sha256":"2b9c3366a2379bdd95e8050ca06accfd34308d526fed47479cdac95f653c2e45"}],"concept.mesh.d009374":[{"id":"assertion.concept.mesh.d009374","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Experimental as described in the captured NLM MeSH descriptor D009374","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Experimental as: Experimentally induced new abnormal growth of TISSUES in animals to provide models for studying human neoplasms.","support":[{"end":665,"quote":"Experimentally induced new abnormal growth of\nTISSUES\nin animals to provide models for studying human neoplasms.","source_id":"nlm-mesh.d009374","source_sha256":"1bee40eee8386dd1a48a3ed4b6d37564817b718d0b2e068c23031a76458272e8","start":553}],"target_id":"concept.mesh.d009374","target_kind":"node","target_sha256":"9fb4081ae2a84457a872d34bd09ef855fbe42d900b3f83762e0aa1bfbc45b9d5"}],"concept.mesh.d009376":[{"id":"assertion.concept.mesh.d009376","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Hormone-Dependent as described in the captured NLM MeSH descriptor D009376","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Hormone-Dependent as: Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","support":[{"end":707,"quote":"Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","source_id":"nlm-mesh.d009376","source_sha256":"2e9535ced22f8c658df59f1ef1e0bfaff90658a60c8cfa64fdd4456e1ac15d20","start":531}],"target_id":"concept.mesh.d009376","target_kind":"node","target_sha256":"ed3c504a350f320b0ba810958e214c9e712e7d6affedb8ed6a63b738c8abc25a"}],"concept.mesh.d009378":[{"id":"assertion.concept.mesh.d009378","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Multiple Primary as described in the captured NLM MeSH descriptor D009378","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Multiple Primary as: Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","support":[{"end":1107,"quote":"Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","source_id":"nlm-mesh.d009378","source_sha256":"9c39f088f12a738ac7eeb48e98b980941c19911876655d850f4a478007ba49ae","start":897}],"target_id":"concept.mesh.d009378","target_kind":"node","target_sha256":"946567394a4f79461913b102be00272a39e75c70c7b942986f146ebf36ff4111"}],"concept.mesh.d009381":[{"id":"assertion.concept.mesh.d009381","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Radiation-Induced as described in the captured NLM MeSH descriptor D009381","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Radiation-Induced as: Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","support":[{"end":589,"quote":"Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","source_id":"nlm-mesh.d009381","source_sha256":"e28a97bc122c81d8f266fa31e15f04e1ce9996b5ef5cee458d8273826cab80ba","start":496}],"target_id":"concept.mesh.d009381","target_kind":"node","target_sha256":"eaf1cd442d346c11352915385c8f6a63ecc95d822c012ac3edc89c23ba62bfb6"}],"concept.mesh.d009385":[{"id":"assertion.concept.mesh.d009385","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplastic Processes as described in the captured NLM MeSH descriptor D009385","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplastic Processes as: The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","support":[{"end":534,"quote":"The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","source_id":"nlm-mesh.d009385","source_sha256":"ea3ea9a117d3731127c3053c2b2325fef733247fa2bafa9b268450fc2d337929","start":416}],"target_id":"concept.mesh.d009385","target_kind":"node","target_sha256":"9df1e64f95abf473e60aeca3b3bb37b2205eaba7a0f7d5ee632d1e680a2a2b5b"}],"concept.mesh.d009386":[{"id":"assertion.concept.mesh.d009386","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplastic Syndromes, Hereditary as described in the captured NLM MeSH descriptor D009386","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplastic Syndromes, Hereditary as: The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","support":[{"end":1003,"quote":"The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","source_id":"nlm-mesh.d009386","source_sha256":"add0122ccd3ac653991490694bb288062cc861cb42d0253d3e6e9887d4ef96f3","start":496}],"target_id":"concept.mesh.d009386","target_kind":"node","target_sha256":"ff2387295a2eacd854f8e3d17d13544fc0cf9d9b4d2cd3ac1de6c067710ffd52"}],"concept.mesh.d009421":[{"id":"assertion.concept.mesh.d009421","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Malformations as described in the captured NLM MeSH descriptor D009421","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Malformations as: Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","support":[{"end":622,"quote":"Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","source_id":"nlm-mesh.d009421","source_sha256":"f04a5dc22bedd15f398924554a56cefaf1fce8f2e89757c2f06399f5c09a93be","start":503}],"target_id":"concept.mesh.d009421","target_kind":"node","target_sha256":"5ef044429aae913ed768a286406b00d90b2a51dec155e8a5c84cbe0ac25b7a65"}],"concept.mesh.d009422":[{"id":"assertion.concept.mesh.d009422","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Diseases as described in the captured NLM MeSH descriptor D009422","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Diseases as: Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","support":[{"end":866,"quote":"Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","source_id":"nlm-mesh.d009422","source_sha256":"2e327d46ab72bd2337953add6b4e94ff3e3d51255f743807bc66cda29dc3d077","start":651}],"target_id":"concept.mesh.d009422","target_kind":"node","target_sha256":"26c486b706da90e3057222e10cfa40008bda7c4298b5d6b9817092ccaa99593a"}],"concept.mesh.d009423":[{"id":"assertion.concept.mesh.d009423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nervous System Neoplasms as described in the captured NLM MeSH descriptor D009423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nervous System Neoplasms as: Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","support":[{"end":801,"quote":"Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","source_id":"nlm-mesh.d009423","source_sha256":"ed83a9e2110063a04549fb99c5c85b8026f5672c3a2a43dcaa8a6d4515cd2148","start":555}],"target_id":"concept.mesh.d009423","target_kind":"node","target_sha256":"f1d17d2379fd553415c955c5e88e5b4d82b4e94dbf34fa3bc0bccbe88dcacb79"}],"concept.mesh.d009461":[{"id":"assertion.concept.mesh.d009461","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurologic Manifestations as described in the captured NLM MeSH descriptor D009461","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurologic Manifestations as: Clinical signs and symptoms caused by nervous system injury or dysfunction.","support":[{"end":556,"quote":"Clinical signs and symptoms caused by nervous system injury or dysfunction.","source_id":"nlm-mesh.d009461","source_sha256":"f2fbdbb3f84b8e2ddac1439b1fce4fbbb5fc5f3d4fb9313472c21adfee0d83cc","start":481}],"target_id":"concept.mesh.d009461","target_kind":"node","target_sha256":"bf2b1d695e9b71bcb84a534efbe34c256d2de34e56f5b8305d4ed2cda6cde695"}],"concept.mesh.d009468":[{"id":"assertion.concept.mesh.d009468","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuromuscular Diseases as described in the captured NLM MeSH descriptor D009468","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuromuscular Diseases as: A general term encompassing lower MOTOR NEURON DISEASE ; PERIPHERAL NERVOUS SYSTEM DISEASES ; and certain MUSCULAR DISEASES . Manifestations include MUSCLE WEAKNESS ; FASCICULATION ; muscle ATROPHY ; SPASM ; MYOKYMIA ; MUSCLE HYPERTONIA , myalgias, and MUSCLE HYPOTONIA .","support":[{"end":750,"quote":"A general term encompassing lower\nMOTOR NEURON DISEASE\n;\nPERIPHERAL NERVOUS SYSTEM DISEASES\n; and certain\nMUSCULAR DISEASES\n. Manifestations include\nMUSCLE WEAKNESS\n;\nFASCICULATION\n; muscle\nATROPHY\n;\nSPASM\n;\nMYOKYMIA\n;\nMUSCLE HYPERTONIA\n, myalgias, and\nMUSCLE HYPOTONIA\n.","source_id":"nlm-mesh.d009468","source_sha256":"7aaccbcdc17267b35238e3a91ee835823a083ecc217be6fc406af5f7703afb3f","start":479}],"target_id":"concept.mesh.d009468","target_kind":"node","target_sha256":"1059998918e2d69a89dc80f530ed6d427face1348a60b37ad6341ee0c04d7d8e"}],"concept.mesh.d009668":[{"id":"assertion.concept.mesh.d009668","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nose Diseases as described in the captured NLM MeSH descriptor D009668","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nose Diseases as: Disorders of the nose, general or unspecified.","support":[{"end":435,"quote":"Disorders of the nose, general or unspecified.","source_id":"nlm-mesh.d009668","source_sha256":"b0a09724d9c1dd828fd139ad2cf5bb39ea0c1c8671fa588a9ba91f2cd5adb452","start":389}],"target_id":"concept.mesh.d009668","target_kind":"node","target_sha256":"be063b3a0b5d910ac1bdf5bffcbb2b70261b9d10e2946f9bedcf5f6c4ef15bde"}],"concept.mesh.d009752":[{"id":"assertion.concept.mesh.d009752","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nutritional Status as described in the captured NLM MeSH descriptor D009752","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nutritional Status as: State of the body in relation to the consumption and utilization of nutrients.","support":[{"end":518,"quote":"State of the body in relation to the consumption and utilization of nutrients.","source_id":"nlm-mesh.d009752","source_sha256":"4332c219ce767111e0b43dfb31bfc85368d1c4fc4496edcbfec4885ae76c1f0b","start":440}],"target_id":"concept.mesh.d009752","target_kind":"node","target_sha256":"7a34655a3a1372f6d1abe785f62d17bea2f25aca8a7766adefb2226af570e535"}],"concept.mesh.d009781":[{"id":"assertion.concept.mesh.d009781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Occultism as described in the captured NLM MeSH descriptor D009781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Occultism as: The belief in or study of practices and knowledge of magical, mystical, or supernatural powers. ALCHEMY , astrology, and many RELIGIOUS PHILOSOPHIES are based upon occult principles.","support":[{"end":512,"quote":"The belief in or study of practices and knowledge of magical, mystical, or supernatural powers.\nALCHEMY\n, astrology, and many\nRELIGIOUS PHILOSOPHIES\nare based upon occult principles.","source_id":"nlm-mesh.d009781","source_sha256":"c8f3bc46e36c8187fe1dc67c31e7c9948be1559a665c6e38191cfecccacf9ec6","start":330}],"target_id":"concept.mesh.d009781","target_kind":"node","target_sha256":"5f9e57fa7f15174382bf559b6bfc80114903440694bdab609583b299b23a8a2c"}],"concept.mesh.d009874":[{"id":"assertion.concept.mesh.d009874","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Operations Research as described in the captured NLM MeSH descriptor D009874","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Operations Research as: A group of techniques developed to apply scientific methods and tools to solve the problems of DECISION MAKING in complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting GOALS and makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","support":[{"end":736,"quote":"A group of techniques developed to apply scientific methods and tools to solve the problems of\nDECISION MAKING\nin complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting\nGOALS\nand makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","source_id":"nlm-mesh.d009874","source_sha256":"b119f0b88574b5991690f6d81d813e438e0fe03b0f560502bf710ce98937b2ea","start":370}],"target_id":"concept.mesh.d009874","target_kind":"node","target_sha256":"f4d77d79a44bf83df5022b7adbb0d9aeb87cbda7b569713f15382a49e20a73be"}],"concept.mesh.d009894":[{"id":"assertion.concept.mesh.d009894","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Opportunistic Infections as described in the captured NLM MeSH descriptor D009894","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Opportunistic Infections as: An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","support":[{"end":739,"quote":"An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","source_id":"nlm-mesh.d009894","source_sha256":"6c520fc1718a529d093a3ab627be3a818dd1ab53fcd2431296398f39f291b6a6","start":622}],"target_id":"concept.mesh.d009894","target_kind":"node","target_sha256":"9b9ed3d14037d1b5251c3eed28a04d456f1c5d943516302f68b644f256629515"}],"concept.mesh.d009949":[{"id":"assertion.concept.mesh.d009949","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orientation as described in the captured NLM MeSH descriptor D009949","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orientation as: Awareness of oneself in relation to time, place and person.","support":[{"end":435,"quote":"Awareness of oneself in relation to time, place and person.","source_id":"nlm-mesh.d009949","source_sha256":"11d39116fea91ce0aa29ec9500ca6f687e99bfeae2485ceb44a8913f30db3c45","start":376}],"target_id":"concept.mesh.d009949","target_kind":"node","target_sha256":"3e3655c5ddfd572ca01c20671f1fec044b854713627853c06c27e7b758b38c6f"}],"concept.mesh.d010257":[{"id":"assertion.concept.mesh.d010257","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Paraneoplastic Syndromes as described in the captured NLM MeSH descriptor D010257","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Paraneoplastic Syndromes as: In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","support":[{"end":532,"quote":"In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","source_id":"nlm-mesh.d010257","source_sha256":"f9676346366a5f3de2c4f5b65052394cfdebcc17cd459c162ce25188f5ed1583","start":360}],"target_id":"concept.mesh.d010257","target_kind":"node","target_sha256":"99d8cb904487ba0a2a9d23df4af61eb3f344e65df09ae441fbb108803f4ac0a4"}],"concept.mesh.d010272":[{"id":"assertion.concept.mesh.d010272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Parasitic Diseases as described in the captured NLM MeSH descriptor D010272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Parasitic Diseases as: Infections or infestations with PARASITES . They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","support":[{"end":672,"quote":"Infections or infestations with\nPARASITES\n. They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","source_id":"nlm-mesh.d010272","source_sha256":"91d2488c6b68444df182caafc02556575a7d768e00a50499851db6be0877f30d","start":510}],"target_id":"concept.mesh.d010272","target_kind":"node","target_sha256":"94096ded9ccfdac99d30a350eec6303d5cfcc3e66e23be175fc6e691c615aee9"}],"concept.mesh.d010467":[{"id":"assertion.concept.mesh.d010467","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perceptual Defense as described in the captured NLM MeSH descriptor D010467","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perceptual Defense as: Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","support":[{"end":560,"quote":"Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","source_id":"nlm-mesh.d010467","source_sha256":"8e2cf63332757a60871943157d373f9a3a4234451f77859ab8bd252d9f74a1a0","start":352}],"target_id":"concept.mesh.d010467","target_kind":"node","target_sha256":"e9087caeaa1ca5bb13d0c070efa423ed2ccae5c5a782cd4c23758a68314e0911"}],"concept.mesh.d010549":[{"id":"assertion.concept.mesh.d010549","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personal Satisfaction as described in the captured NLM MeSH descriptor D010549","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personal Satisfaction as: The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","support":[{"end":474,"quote":"The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","source_id":"nlm-mesh.d010549","source_sha256":"a95012f41c90c63e5ea0b1967098b4c970b9062dc59793123203072017880d78","start":358}],"target_id":"concept.mesh.d010549","target_kind":"node","target_sha256":"ecf46b47a83cbe2bd0057b999406f8682d90167f8f2ae10877fde95932078772"}],"concept.mesh.d010551":[{"id":"assertion.concept.mesh.d010551","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personality as described in the captured NLM MeSH descriptor D010551","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personality as: Behavior-response patterns that characterize the individual.","support":[{"end":394,"quote":"Behavior-response patterns that characterize the individual.","source_id":"nlm-mesh.d010551","source_sha256":"ac816bc3bcb6b607c2834e0c462bee047bec961ff94258bab2fc8c91433aa66d","start":334}],"target_id":"concept.mesh.d010551","target_kind":"node","target_sha256":"d7e56bbcf5d1c68a98e7b4950052e22b35e647bdbd0cd164f76333a5ccdf7bbd"}],"concept.mesh.d010995":[{"id":"assertion.concept.mesh.d010995","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pleural Diseases as described in the captured NLM MeSH descriptor D010995","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pleural Diseases as: Diseases involving the PLEURA .","support":[{"end":418,"quote":"Diseases involving the\nPLEURA\n.","source_id":"nlm-mesh.d010995","source_sha256":"a4c1f90952bf0aeba4340cab25641aff6b8ab453ccfaceb84058279bcc04f577","start":387}],"target_id":"concept.mesh.d010995","target_kind":"node","target_sha256":"99f4b463400b72bb93ba9935bfc5018effb4b7767287c0110e02c98a4520f741"}],"concept.mesh.d011049":[{"id":"assertion.concept.mesh.d011049","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Control Policies as described in the captured NLM MeSH descriptor D011049","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Control Policies as: Decisions for determining and guiding present and future objectives from among alternatives.","support":[{"end":622,"quote":"Decisions for determining and guiding present and future objectives from among alternatives.","source_id":"nlm-mesh.d011049","source_sha256":"b0d9cce0326e9aa5c4e008c3221ece3d9d8c87001772899522b6175ab0afa134","start":530}],"target_id":"concept.mesh.d011049","target_kind":"node","target_sha256":"d58b1c16e017ef40e2c765d356e2c53583c154a202ae2ccf745e11db1f909518"}],"concept.mesh.d011056":[{"id":"assertion.concept.mesh.d011056","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Political Systems as described in the captured NLM MeSH descriptor D011056","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Political Systems as: The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","support":[{"end":515,"quote":"The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","source_id":"nlm-mesh.d011056","source_sha256":"0431be76a4e48b1d1a247c9b199f654a58b4bdf3b01eee2b68d4fa961476c7cb","start":370}],"target_id":"concept.mesh.d011056","target_kind":"node","target_sha256":"493a71f8c83d25bf6ed276398846ff4239bd693587eb7bcb02732a4b872d4a42"}],"concept.mesh.d011155":[{"id":"assertion.concept.mesh.d011155","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Control as described in the captured NLM MeSH descriptor D011155","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Control as: Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","support":[{"end":622,"quote":"Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","source_id":"nlm-mesh.d011155","source_sha256":"2baddb04f01f8731810d70eaf0b21844f5b645d3e20f77246580fa3ca3d5bd56","start":512}],"target_id":"concept.mesh.d011155","target_kind":"node","target_sha256":"8a4bf11482e565b6e3519d648d7e4575556ee7c8d6f81f4eb34376a58068f2a7"}],"concept.mesh.d011158":[{"id":"assertion.concept.mesh.d011158","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Growth as described in the captured NLM MeSH descriptor D011158","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Growth as: Increase, over a specific period of time, in the number of individuals living in a country or region.","support":[{"end":527,"quote":"Increase, over a specific period of time, in the number of individuals living in a country or region.","source_id":"nlm-mesh.d011158","source_sha256":"7e0023f87f31e021c275da84106090dc449a0d7a01bb3bd0e1abe4004a5a9ce3","start":426}],"target_id":"concept.mesh.d011158","target_kind":"node","target_sha256":"27ed8c80327b9ac6372de3a2cfa8cabf4c6c5bc3c4813fe6ef23f3658f1ab836"}],"concept.mesh.d011177":[{"id":"assertion.concept.mesh.d011177","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Postal Service as described in the captured NLM MeSH descriptor D011177","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Postal Service as: The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","support":[{"end":490,"quote":"The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","source_id":"nlm-mesh.d011177","source_sha256":"4f81deee9f527bb6204ad5a323e46f48c2dceb19e3dac3a3c6772493d273a142","start":344}],"target_id":"concept.mesh.d011177","target_kind":"node","target_sha256":"8794d86da1b263a93394912d9383a5dc8decf8e43afbb600a448fb8706287857"}],"concept.mesh.d011230":[{"id":"assertion.concept.mesh.d011230","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precancerous Conditions as described in the captured NLM MeSH descriptor D011230","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precancerous Conditions as: Pathological conditions that tend eventually to become malignant.","support":[{"end":551,"quote":"Pathological conditions that tend eventually to become malignant.","source_id":"nlm-mesh.d011230","source_sha256":"eaf0575619a25497d53f2c474c54337c57e8612165b9ad28d3f05a0e2d091c94","start":486}],"target_id":"concept.mesh.d011230","target_kind":"node","target_sha256":"f8a6e3cdb752f0fcce27bc2d2523b97f3e71b43380c9195cac663a15b694c2fe"}],"concept.mesh.d011249":[{"id":"assertion.concept.mesh.d011249","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Cardiovascular as described in the captured NLM MeSH descriptor D011249","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Cardiovascular as: The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow FERTILIZATION and it may or may not have a deleterious effect on the pregnant woman or FETUS .","support":[{"end":779,"quote":"The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow\nFERTILIZATION\nand it may or may not have a deleterious effect on the pregnant woman or\nFETUS\n.","source_id":"nlm-mesh.d011249","source_sha256":"6c6bf720c6720c7ddfcdb71352eaeed2a3e7541e7e9a4b9ce2d545c936a92251","start":590}],"target_id":"concept.mesh.d011249","target_kind":"node","target_sha256":"4693a73bea129a7d0c28c80a55097ffc4542f89711f18aadf90fe86869ff7a33"}],"concept.mesh.d011251":[{"id":"assertion.concept.mesh.d011251","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Infectious as described in the captured NLM MeSH descriptor D011251","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Infectious as: The co-occurrence of pregnancy and an INFECTION . The infection may precede or follow FERTILIZATION .","support":[{"end":648,"quote":"The co-occurrence of pregnancy and an\nINFECTION\n. The infection may precede or follow\nFERTILIZATION\n.","source_id":"nlm-mesh.d011251","source_sha256":"0658865c769bf6a35365b86f84ac4e1968c735abb6fa241d62cdde59fca8c27a","start":547}],"target_id":"concept.mesh.d011251","target_kind":"node","target_sha256":"56ebaabdec1be792a34f107558598e7ee7cc3258412e247a1202b74fac7cd2e3"}],"concept.mesh.d011252":[{"id":"assertion.concept.mesh.d011252","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pregnancy Complications, Neoplastic as described in the captured NLM MeSH descriptor D011252","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pregnancy Complications, Neoplastic as: The co-occurrence of pregnancy and NEOPLASMS . The neoplastic disease may precede or follow FERTILIZATION .","support":[{"end":678,"quote":"The co-occurrence of pregnancy and\nNEOPLASMS\n. The neoplastic disease may precede or follow\nFERTILIZATION\n.","source_id":"nlm-mesh.d011252","source_sha256":"b532b275081ab79d924d20390d37ce3b1f36a91fb19c448c50c4730801abc23f","start":571}],"target_id":"concept.mesh.d011252","target_kind":"node","target_sha256":"396db8490abad4757cd68ee14c957e1451ea971c91115c2d6e30f891488d3aca"}],"concept.mesh.d011336":[{"id":"assertion.concept.mesh.d011336","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Probability as described in the captured NLM MeSH descriptor D011336","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Probability as: The study of chance processes or the relative frequency characterizing a chance process.","support":[{"end":707,"quote":"The study of chance processes or the relative frequency characterizing a chance process.","source_id":"nlm-mesh.d011336","source_sha256":"c68307e92bd84d0c45588b54a5a60513b2b9d906b233fe44239fbf32e4251224","start":619}],"target_id":"concept.mesh.d011336","target_kind":"node","target_sha256":"56a3d3161590e1e58ff83c23bc4559d98d66c3bfe9248988da77b9e4863f6e09"}],"concept.mesh.d011385":[{"id":"assertion.concept.mesh.d011385","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Projection as described in the captured NLM MeSH descriptor D011385","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Projection as: A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","support":[{"end":490,"quote":"A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","source_id":"nlm-mesh.d011385","source_sha256":"6a9869127d5888865d6f43190601d42f0a32415be3ea6753500e3fc351dab5ac","start":336}],"target_id":"concept.mesh.d011385","target_kind":"node","target_sha256":"649f0d83a761835179237f82f9975aee912c2de71e0d54af95e362d75f4b928b"}],"concept.mesh.d011786":[{"id":"assertion.concept.mesh.d011786","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality Control as described in the captured NLM MeSH descriptor D011786","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality Control as: A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","support":[{"end":582,"quote":"A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d011786","source_sha256":"50a1b06fc9164b86e74abf7666331b4d72f749d5af24d5557be135ed2232ff21","start":346}],"target_id":"concept.mesh.d011786","target_kind":"node","target_sha256":"f667658025ed8217b9b03dfca6bf6c345b98241a25a9b584cde6f6dbfdcef929"}],"concept.mesh.d011788":[{"id":"assertion.concept.mesh.d011788","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality of Life as described in the captured NLM MeSH descriptor D011788","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality of Life as: A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","support":[{"end":560,"quote":"A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","source_id":"nlm-mesh.d011788","source_sha256":"a3fe6fec06d7760e8d154b7ed62133ef016ee7e9fd9fa2df1202a853322cee2d","start":382}],"target_id":"concept.mesh.d011788","target_kind":"node","target_sha256":"2322437aa1f2abef821426cc12712bb29596e34a11e14e0a10fdb7cedc07c0aa"}],"concept.mesh.d011845":[{"id":"assertion.concept.mesh.d011845","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radio as described in the captured NLM MeSH descriptor D011845","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radio as: The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","support":[{"end":642,"quote":"The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","source_id":"nlm-mesh.d011845","source_sha256":"e7ea4815b1a540ea7cc4951a500dfa86bd97b4de141636ccc2f9311fb94b70de","start":398}],"target_id":"concept.mesh.d011845","target_kind":"node","target_sha256":"78c9051992a7c4c3ed2ff0ad69879fc2a06de223791508c8bbf736b673b6ba20"}],"concept.mesh.d011897":[{"id":"assertion.concept.mesh.d011897","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Random Allocation as described in the captured NLM MeSH descriptor D011897","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Random Allocation as: A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","support":[{"end":830,"quote":"A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","source_id":"nlm-mesh.d011897","source_sha256":"c6c193348e4af187f8947ec4b9a65681ae397616cd94b0dabcd20d96f218dbcc","start":575}],"target_id":"concept.mesh.d011897","target_kind":"node","target_sha256":"10c9193c093d47f983e16c1b85d81fa7a4d86265fe653d294e7146f1b56d4fef"}],"concept.mesh.d011908":[{"id":"assertion.concept.mesh.d011908","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Rationalization as described in the captured NLM MeSH descriptor D011908","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Rationalization as: A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","support":[{"end":575,"quote":"A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","source_id":"nlm-mesh.d011908","source_sha256":"0388249768828c95e09a5a6242e47f2ae82b8525bfb6b50d20618c3ac6fb2d94","start":367}],"target_id":"concept.mesh.d011908","target_kind":"node","target_sha256":"b2b9ed895ff6406a698e2bcaf9d8a7ebaab68c067bf48986cd240e7635d09b50"}],"concept.mesh.d012043":[{"id":"assertion.concept.mesh.d012043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Regression, Psychology as described in the captured NLM MeSH descriptor D012043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Regression, Psychology as: A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","support":[{"end":667,"quote":"A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","source_id":"nlm-mesh.d012043","source_sha256":"ad0dd4dc516739f0ece07b96f15c64ad157b2764851fca75cc65576f30e9e3e6","start":414}],"target_id":"concept.mesh.d012043","target_kind":"node","target_sha256":"20b688da6f6617ee11ea2ae2007e0aaaae90daa88aa575a3759a0a8f22af30d0"}],"concept.mesh.d012071":[{"id":"assertion.concept.mesh.d012071","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Sex as described in the captured NLM MeSH descriptor D012071","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Sex as: The interrelationship of religion and sexual practices and beliefs.","support":[{"end":415,"quote":"The interrelationship of religion and sexual practices and beliefs.","source_id":"nlm-mesh.d012071","source_sha256":"cc0b8ed4f22f47a8d983e288427ca38f044b1117600fec481d4d5158a8daaa84","start":348}],"target_id":"concept.mesh.d012071","target_kind":"node","target_sha256":"a92d60640f4d60e9a989df0c528ba8c79b106eea437bf4f5efc247a533125384"}],"concept.mesh.d012072":[{"id":"assertion.concept.mesh.d012072","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religious Philosophies as described in the captured NLM MeSH descriptor D012072","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religious Philosophies as: Sets of beliefs on the nature of the universe or Man.","support":[{"end":465,"quote":"Sets of beliefs on the nature of the universe or Man.","source_id":"nlm-mesh.d012072","source_sha256":"9e8bf0c582465331fa653d592aa8a83f446ab736058ff161311366dcdfc52d14","start":412}],"target_id":"concept.mesh.d012072","target_kind":"node","target_sha256":"952ec9c893ffde3c1500a82711fc276e01a28fd61a44786ade6341c3ff652e19"}],"concept.mesh.d012094":[{"id":"assertion.concept.mesh.d012094","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Repression, Psychology as described in the captured NLM MeSH descriptor D012094","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Repression, Psychology as: The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","support":[{"end":491,"quote":"The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","source_id":"nlm-mesh.d012094","source_sha256":"01a4164b631c9a16a24390d4ec8b87c872f56d6eca5bc8bbf88eff42967c08b5","start":360}],"target_id":"concept.mesh.d012094","target_kind":"node","target_sha256":"8e56d54f35ee4fa042dfac9ee2d2630e175eafd948dfb306a296ba247f208963"}],"concept.mesh.d012106":[{"id":"assertion.concept.mesh.d012106","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research as described in the captured NLM MeSH descriptor D012106","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research as: Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","support":[{"end":863,"quote":"Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","source_id":"nlm-mesh.d012106","source_sha256":"87531e3d8129c6943d37aec640b3009b5b9d73a6325944fd0cc52e99a9dff200","start":529}],"target_id":"concept.mesh.d012106","target_kind":"node","target_sha256":"6a26d41ef44440ea9b5ef853a3e263f5811c8803a783150adcef88b661fcc2ce"}],"concept.mesh.d012107":[{"id":"assertion.concept.mesh.d012107","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research Design as described in the captured NLM MeSH descriptor D012107","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research Design as: A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","support":[{"end":521,"quote":"A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","source_id":"nlm-mesh.d012107","source_sha256":"ae2fbb2c9c85a658b5574aed59bb8ef1a35c2cdafdd48c877b1802a7cbf3571b","start":362}],"target_id":"concept.mesh.d012107","target_kind":"node","target_sha256":"15386ed70d8931ca1f42d4c4ae2ecd09366d9cb4239f3bcda31dbd48700ce91b"}],"concept.mesh.d012120":[{"id":"assertion.concept.mesh.d012120","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiration Disorders as described in the captured NLM MeSH descriptor D012120","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiration Disorders as: Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","support":[{"end":519,"quote":"Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","source_id":"nlm-mesh.d012120","source_sha256":"5742ef200c565bd2c4f20678954b9aa2c866956bb7d1e7d9ff5ff8d1dd0f80db","start":406}],"target_id":"concept.mesh.d012120","target_kind":"node","target_sha256":"65007bdb7804c2b3e754afde7a6c33626c5d26c749b11040f9fef33876020b88"}],"concept.mesh.d012130":[{"id":"assertion.concept.mesh.d012130","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Hypersensitivity as described in the captured NLM MeSH descriptor D012130","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Hypersensitivity as: A form of hypersensitivity affecting the respiratory tract. It includes ASTHMA and RHINITIS, ALLERGIC, SEASONAL .","support":[{"end":530,"quote":"A form of hypersensitivity affecting the respiratory tract. It includes\nASTHMA\nand\nRHINITIS, ALLERGIC, SEASONAL\n.","source_id":"nlm-mesh.d012130","source_sha256":"ca158ee60a332f6f65b9d3a6cdea8285ee348ef14d5815d1a635636fa7213fe7","start":417}],"target_id":"concept.mesh.d012130","target_kind":"node","target_sha256":"16cbcbc5f736c7a1daefa2f4dd328dc8a65d8046b3096ae600c9369084cb8be6"}],"concept.mesh.d012140":[{"id":"assertion.concept.mesh.d012140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Tract Diseases as described in the captured NLM MeSH descriptor D012140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Tract Diseases as: Diseases involving the RESPIRATORY SYSTEM .","support":[{"end":455,"quote":"Diseases involving the\nRESPIRATORY SYSTEM\n.","source_id":"nlm-mesh.d012140","source_sha256":"306452ce0e219fb270dca8fcba029ed3bcde4894b2cc3eae486d8b4f00599f96","start":412}],"target_id":"concept.mesh.d012140","target_kind":"node","target_sha256":"7db77345d7b35219ea4f7be89bfaa76ee68e953260e0d7607f898e954ad15501"}],"concept.mesh.d012141":[{"id":"assertion.concept.mesh.d012141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory Tract Infections as described in the captured NLM MeSH descriptor D012141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory Tract Infections as: Invasion of the host RESPIRATORY SYSTEM by microorganisms, usually leading to pathological processes or diseases.","support":[{"end":526,"quote":"Invasion of the host\nRESPIRATORY SYSTEM\nby microorganisms, usually leading to pathological processes or diseases.","source_id":"nlm-mesh.d012141","source_sha256":"467426761ff0ab2a074d8ca4aad125728b0f1dc453c28399210718dfdeaa1553","start":413}],"target_id":"concept.mesh.d012141","target_kind":"node","target_sha256":"741964e4910242b46fde49e2569ee1cb25b43bcb804663f5256470cb7adba774"}],"concept.mesh.d012148":[{"id":"assertion.concept.mesh.d012148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Restless Legs Syndrome as described in the captured NLM MeSH descriptor D012148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Restless Legs Syndrome as: A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","support":[{"end":728,"quote":"A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","source_id":"nlm-mesh.d012148","source_sha256":"cd49686901132e6cf9d8e768dbf8c3e1d2c1a20ad133a74dd5895ad26616944a","start":562}],"target_id":"concept.mesh.d012148","target_kind":"node","target_sha256":"92255d41ffe6329e3a6ed53c57ba7756bf253a556e8198098eacddc8100e7ecf"}],"concept.mesh.d012306":[{"id":"assertion.concept.mesh.d012306","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk as described in the captured NLM MeSH descriptor D012306","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk as: The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","support":[{"end":609,"quote":"The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","source_id":"nlm-mesh.d012306","source_sha256":"9b0c786bf181b186ad65ea0e7a8d44a0450734d47f5e7dcebadf25e585e32c16","start":476}],"target_id":"concept.mesh.d012306","target_kind":"node","target_sha256":"fc868c20ab438e72a7c580125286bf0f08d0c51fe36481c4d697347703adddad"}],"concept.mesh.d012307":[{"id":"assertion.concept.mesh.d012307","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk Factors as described in the captured NLM MeSH descriptor D012307","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk Factors as: An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","support":[{"end":951,"quote":"An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","source_id":"nlm-mesh.d012307","source_sha256":"e986275878f10030f5534a292fcd9ed18a560ca3778a31e39575accbe1171bb4","start":714}],"target_id":"concept.mesh.d012307","target_kind":"node","target_sha256":"5a4c4cf67c952c3b3dd40b049d092c47190fc46051f3909da1fb74ec3b823ec9"}],"concept.mesh.d012309":[{"id":"assertion.concept.mesh.d012309","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk-Taking as described in the captured NLM MeSH descriptor D012309","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk-Taking as: Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","support":[{"end":622,"quote":"Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","source_id":"nlm-mesh.d012309","source_sha256":"0715a0b6cc5e2f182c4f2c4db3d0d17f092adca490aeb639adcff759ba9763f5","start":338}],"target_id":"concept.mesh.d012309","target_kind":"node","target_sha256":"b14575e33a0c3f5645880e858473d51985e182c62ab775df1d64efd5fdf3a707"}],"concept.mesh.d012498":[{"id":"assertion.concept.mesh.d012498","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sanitary Engineering as described in the captured NLM MeSH descriptor D012498","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sanitary Engineering as: A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","support":[{"end":585,"quote":"A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","source_id":"nlm-mesh.d012498","source_sha256":"a8749973d84e5e53f29b4bacae78e342127151ea31e74a081932b06aaabd101b","start":408}],"target_id":"concept.mesh.d012498","target_kind":"node","target_sha256":"e2b1ade3792009b530197acc24dcd09bafb7ae9075186f82baaa65af9f8dd7e8"}],"concept.mesh.d012653":[{"id":"assertion.concept.mesh.d012653","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Self Stimulation as described in the captured NLM MeSH descriptor D012653","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Self Stimulation as: The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","support":[{"end":671,"quote":"The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","source_id":"nlm-mesh.d012653","source_sha256":"1993c5d80d6163615e90e1127be3e82a62fdb1b64b7d13199331df359338abd8","start":386}],"target_id":"concept.mesh.d012653","target_kind":"node","target_sha256":"4274077a0e6838dbb885ee5a74e2c6db727fe87d206da1d46beadb3e6892b5ae"}],"concept.mesh.d012725":[{"id":"assertion.concept.mesh.d012725","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sexual Behavior as described in the captured NLM MeSH descriptor D012725","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sexual Behavior as: Sexual activities of humans.","support":[{"end":518,"quote":"Sexual activities of humans.","source_id":"nlm-mesh.d012725","source_sha256":"eebb803ce4c2bd7fa38702618b79a323399bdc1e54269deaf239d1c0e3f1375f","start":490}],"target_id":"concept.mesh.d012725","target_kind":"node","target_sha256":"4a50311b1a52a1c41efb6c451c6a98f268d4de91a7cc17a75c3779a492cc4cda"}],"concept.mesh.d012742":[{"id":"assertion.concept.mesh.d012742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Offenses as described in the captured NLM MeSH descriptor D012742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Offenses as: Any violation of established legal or moral codes in respect to sexual behavior.","support":[{"end":424,"quote":"Any violation of established legal or moral codes in respect to sexual behavior.","source_id":"nlm-mesh.d012742","source_sha256":"29b3962f09b3484ddef4795322caed474712df17a9a39c42ae6810757ec97cc9","start":344}],"target_id":"concept.mesh.d012742","target_kind":"node","target_sha256":"33829b147bee1dee48f08333883fb6b55823e34006c93f5d181c67bc54caae8c"}],"concept.mesh.d012744":[{"id":"assertion.concept.mesh.d012744","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Ratio as described in the captured NLM MeSH descriptor D012744","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Ratio as: The number of males per 100 females.","support":[{"end":422,"quote":"The number of males per 100 females.","source_id":"nlm-mesh.d012744","source_sha256":"71956c7f623cfa4f8a38b7382b02b22aa6495af3fa01b41ae8f9fbc649ae39d4","start":386}],"target_id":"concept.mesh.d012744","target_kind":"node","target_sha256":"7c77292d44ebfc5e577f74c333bc09482ed661b52bd46bcdca8ebfa484b11728"}],"concept.mesh.d012749":[{"id":"assertion.concept.mesh.d012749","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sexually Transmitted Diseases as described in the captured NLM MeSH descriptor D012749","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sexually Transmitted Diseases as: Diseases due to or propagated by sexual contact.","support":[{"end":514,"quote":"Diseases due to or propagated by sexual contact.","source_id":"nlm-mesh.d012749","source_sha256":"3c801aef9b2cf9ed99ce8b95afeb5e644e7888df57da3f7555b4d000f9b2ab01","start":466}],"target_id":"concept.mesh.d012749","target_kind":"node","target_sha256":"3258f6fd40217a1aefc684b3be93700b1e7fa30d1e8bef13e45840b3fcdfafe6"}],"concept.mesh.d012874":[{"id":"assertion.concept.mesh.d012874","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Skin Diseases, Infectious as described in the captured NLM MeSH descriptor D012874","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Skin Diseases, Infectious as: Skin diseases caused by bacteria, fungi, parasites, or viruses.","support":[{"end":579,"quote":"Skin diseases caused by bacteria, fungi, parasites, or viruses.","source_id":"nlm-mesh.d012874","source_sha256":"654a72e3ded7401d00b2298f498ab16755a02eb6789e8267b73272f2f62f8bef","start":516}],"target_id":"concept.mesh.d012874","target_kind":"node","target_sha256":"69e4f203de7a0c6b360e86a057a2405f7b08c07f6c2f88d7a42788c92e8944d8"}],"concept.mesh.d012893":[{"id":"assertion.concept.mesh.d012893","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sleep Wake Disorders as described in the captured NLM MeSH descriptor D012893","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sleep Wake Disorders as: Abnormal sleep-wake schedule or pattern associated with the CIRCADIAN RHYTHM which affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","support":[{"end":558,"quote":"Abnormal sleep-wake schedule or pattern associated with the\nCIRCADIAN RHYTHM\nwhich affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","source_id":"nlm-mesh.d012893","source_sha256":"adbc07672047c3c087280dd3ede229193de139d0c20509b1fb16662cb6d3d3a3","start":376}],"target_id":"concept.mesh.d012893","target_kind":"node","target_sha256":"89c6b7ca189f4b0f9b904e8de4d305072929966dd4095fe650820bb29c405fa5"}],"concept.mesh.d012907":[{"id":"assertion.concept.mesh.d012907","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Smoking as described in the captured NLM MeSH descriptor D012907","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Smoking as: Willful or deliberate act of inhaling and exhaling SMOKE from burning substances or agents held by hand.","support":[{"end":736,"quote":"Willful or deliberate act of inhaling and exhaling\nSMOKE\nfrom burning substances or agents held by hand.","source_id":"nlm-mesh.d012907","source_sha256":"16227790fd20b743f468c8818d1323f7824b776c2b751f33ea93f2625bfab89c","start":632}],"target_id":"concept.mesh.d012907","target_kind":"node","target_sha256":"117c304f3e13c071c0c5f27a7236d385911dca1dffbfce6541ff19d64a59a132"}],"concept.mesh.d012919":[{"id":"assertion.concept.mesh.d012919","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Behavior as described in the captured NLM MeSH descriptor D012919","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Behavior as: Any behavior caused by or affecting another individual or group usually of the same species.","support":[{"end":464,"quote":"Any behavior caused by or affecting another individual or group usually of the same species.","source_id":"nlm-mesh.d012919","source_sha256":"f44d8ecceaf6060a9e38611e05c177e65cfffa68588bc6c29c62ef51dd38770b","start":372}],"target_id":"concept.mesh.d012919","target_kind":"node","target_sha256":"04f14cc0b4af60c892ca0dcae90f980dd521cf2740a1f6e68e3e698fd1a3c06d"}],"concept.mesh.d012935":[{"id":"assertion.concept.mesh.d012935","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Justice as described in the captured NLM MeSH descriptor D012935","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Justice as: An interactive process whereby members of a community are concerned for the equality and rights of all.","support":[{"end":559,"quote":"An interactive process whereby members of a community are concerned for the equality and rights of all.","source_id":"nlm-mesh.d012935","source_sha256":"3e05ac82162b0ff33503093f08260bde855969ab9cae0bd4331976de8670c93f","start":456}],"target_id":"concept.mesh.d012935","target_kind":"node","target_sha256":"da464977d8c10600e1d61e2dc4faec3e549316aa23021dc4c4449ab45410c502"}],"concept.mesh.d012941":[{"id":"assertion.concept.mesh.d012941","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Responsibility as described in the captured NLM MeSH descriptor D012941","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","support":[{"end":474,"quote":"The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","source_id":"nlm-mesh.d012941","source_sha256":"ae1d9d88f3f74f99695ab60f1116643b0f27cbb58162e9c035ebd75abb9d9d27","start":378}],"target_id":"concept.mesh.d012941","target_kind":"node","target_sha256":"300e00ef20940beb66ce7b1180eac26154aea8dfa98c4413e7f3e8cb33ff6994"}],"concept.mesh.d012950":[{"id":"assertion.concept.mesh.d012950","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Socialism as described in the captured NLM MeSH descriptor D012950","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Socialism as: A system of government in which means of production and distribution of goods are controlled by the state.","support":[{"end":507,"quote":"A system of government in which means of production and distribution of goods are controlled by the state.","source_id":"nlm-mesh.d012950","source_sha256":"38bd51a7a319fc945a1879ff847ec02043a2000b93cd861f3de3f8d83a9db31d","start":401}],"target_id":"concept.mesh.d012950","target_kind":"node","target_sha256":"88068a2ce436388d7583827aebdb217c1c53c6384e8aab2347fb3199e6cf43ea"}],"concept.mesh.d013037":[{"id":"assertion.concept.mesh.d013037","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spatial Behavior as described in the captured NLM MeSH descriptor D013037","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spatial Behavior as: Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","support":[{"end":534,"quote":"Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","source_id":"nlm-mesh.d013037","source_sha256":"859767715118b17aabea5ab1f79e9ce9abc8e7584cf46c7e776af7cfa436451d","start":374}],"target_id":"concept.mesh.d013037","target_kind":"node","target_sha256":"bb1859c681492028575289108efa05ca358d6fa13eba6e4b7751037713d7c2cf"}],"concept.mesh.d013140":[{"id":"assertion.concept.mesh.d013140","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spiritualism as described in the captured NLM MeSH descriptor D013140","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spiritualism as: Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","support":[{"end":568,"quote":"Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","source_id":"nlm-mesh.d013140","source_sha256":"fd466929d4cdc15d45cc63d82565e7206a22fa3a26e06ae7f2bd8dc971eb00e1","start":443}],"target_id":"concept.mesh.d013140","target_kind":"node","target_sha256":"9a08fcb2f5c89dc56597e0889a55785886501ed91f2ad12a743330d94a63c702"}],"concept.mesh.d013219":[{"id":"assertion.concept.mesh.d013219","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"State Government as described in the captured NLM MeSH descriptor D013219","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes State Government as: The level of governmental organization and function below that of the national or country-wide government.","support":[{"end":535,"quote":"The level of governmental organization and function below that of the national or country-wide government.","source_id":"nlm-mesh.d013219","source_sha256":"3d8ecff40a219d2c58aaf62c253336b99aa35239a93ecdf6ffa1e54be3cce29c","start":429}],"target_id":"concept.mesh.d013219","target_kind":"node","target_sha256":"83a104e4f37277273509f8827a7436f8ae50b9c852e56f980be1a6b72cac4e67"}],"concept.mesh.d013239":[{"id":"assertion.concept.mesh.d013239","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereotyped Behavior as described in the captured NLM MeSH descriptor D013239","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereotyped Behavior as: Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","support":[{"end":509,"quote":"Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","source_id":"nlm-mesh.d013239","source_sha256":"57062c4db3736306642d22b0f13026912633ccb90a84207667a574d02cf92df3","start":382}],"target_id":"concept.mesh.d013239","target_kind":"node","target_sha256":"8fc8d885646c7351e833d9c2dfd28b50a47c3ee3429b633f11162def73ea953d"}],"concept.mesh.d013240":[{"id":"assertion.concept.mesh.d013240","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereotyping as described in the captured NLM MeSH descriptor D013240","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereotyping as: An oversimplified perception or conception especially of persons, social groups, etc.","support":[{"end":578,"quote":"An oversimplified perception or conception especially of persons, social groups, etc.","source_id":"nlm-mesh.d013240","source_sha256":"22d9cbcd70b6756c1b451baad510df1e76b5548c009303082c78e51e6af3b57c","start":493}],"target_id":"concept.mesh.d013240","target_kind":"node","target_sha256":"c56915b4be45f0dcb2e0330c34851fce8bc6d07886b1be164bf641dd39cbaf39"}],"concept.mesh.d013359":[{"id":"assertion.concept.mesh.d013359","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sublimation, Psychological as described in the captured NLM MeSH descriptor D013359","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sublimation, Psychological as: A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","support":[{"end":568,"quote":"A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","source_id":"nlm-mesh.d013359","source_sha256":"3ebe948a006e87cf9c824ef5eb0564604c15fd96f0cfa0f41b47802910725736","start":368}],"target_id":"concept.mesh.d013359","target_kind":"node","target_sha256":"ab8efca265f64dc5960e40b63a6cb861862e41a1db3cff017bc1d4cf8044adb4"}],"concept.mesh.d013391":[{"id":"assertion.concept.mesh.d013391","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sucking Behavior as described in the captured NLM MeSH descriptor D013391","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sucking Behavior as: Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","support":[{"end":581,"quote":"Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","source_id":"nlm-mesh.d013391","source_sha256":"ae77d15e6dd2a2adbd75c7b8e54612730b328bf7773b8cf56afab02fecac1eb8","start":374}],"target_id":"concept.mesh.d013391","target_kind":"node","target_sha256":"eef3d8e1a501a32d7e401aa42ae58aa1be203f1c49b8cb8d76ecc7c97edd69da"}],"concept.mesh.d013492":[{"id":"assertion.concept.mesh.d013492","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Suppuration as described in the captured NLM MeSH descriptor D013492","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Suppuration as: A pathologic process consisting in the formation of pus.","support":[{"end":458,"quote":"A pathologic process consisting in the formation of pus.","source_id":"nlm-mesh.d013492","source_sha256":"b68555c0f4caa9edbd78ab9722cccf95e4a5ed8910396afdee701b29ba714184","start":402}],"target_id":"concept.mesh.d013492","target_kind":"node","target_sha256":"bd3faa0b51d5c3c71ba7a9c76cc19fddd824a08f9a205dcc4922185e658e9aa7"}],"concept.mesh.d013561":[{"id":"assertion.concept.mesh.d013561","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Symbolism as described in the captured NLM MeSH descriptor D013561","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Symbolism as: A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","support":[{"end":797,"quote":"A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","source_id":"nlm-mesh.d013561","source_sha256":"d1beadf4d533cf5cc47929129a771be240e4c03e21f9f3778d87a44214caa4a0","start":586}],"target_id":"concept.mesh.d013561","target_kind":"node","target_sha256":"8af8e48c62cadaa0439aa82e3f7aa8a1dd62d1a1f9c97341f3aad1ac83338ca4"}],"concept.mesh.d013598":[{"id":"assertion.concept.mesh.d013598","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Systems Theory as described in the captured NLM MeSH descriptor D013598","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Systems Theory as: Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","support":[{"end":653,"quote":"Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","source_id":"nlm-mesh.d013598","source_sha256":"754408a694fb0c495ddb95071ebda725a5da8e8889c9815b758b081ea808cc04","start":344}],"target_id":"concept.mesh.d013598","target_kind":"node","target_sha256":"bd9f22824d7ca4467e0fca293dbdb88a2e4ef1d2ff9b0a15fcbdd40c88485583"}],"concept.mesh.d013637":[{"id":"assertion.concept.mesh.d013637","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tape Recording as described in the captured NLM MeSH descriptor D013637","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tape Recording as: Recording of information on magnetic or punched paper tape.","support":[{"end":461,"quote":"Recording of information on magnetic or punched paper tape.","source_id":"nlm-mesh.d013637","source_sha256":"c957986719f1c3db108ddf8c918b5c1885f4b6281dec3255edc3a3cdfe8e258f","start":402}],"target_id":"concept.mesh.d013637","target_kind":"node","target_sha256":"5fa94fa9b7c91012e144b5c413024315779b383eea991bb632a080fe1ca1cee9"}],"concept.mesh.d013690":[{"id":"assertion.concept.mesh.d013690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Television as described in the captured NLM MeSH descriptor D013690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Television as: The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","support":[{"end":833,"quote":"The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","source_id":"nlm-mesh.d013690","source_sha256":"6a646c69b59fcca6989f3d877d83051f482105634e111ae3c91b61aa2c3d8240","start":503}],"target_id":"concept.mesh.d013690","target_kind":"node","target_sha256":"c071746d463aecae617348f74d36cc0f7994179c9accece10455a1cab2823899"}],"concept.mesh.d013695":[{"id":"assertion.concept.mesh.d013695","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Temperance as described in the captured NLM MeSH descriptor D013695","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Temperance as: Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","support":[{"end":499,"quote":"Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","source_id":"nlm-mesh.d013695","source_sha256":"d90a25c21caec13e8d1b406a2f76da4ce8b03a15bdc9d63f41ae808d637bb4e3","start":380}],"target_id":"concept.mesh.d013695","target_kind":"node","target_sha256":"7cc29f4f90207693b1b535b978af528af7f13e97c72e62176f66ac84cf04fc6b"}],"concept.mesh.d013800":[{"id":"assertion.concept.mesh.d013800","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Theft as described in the captured NLM MeSH descriptor D013800","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Theft as: Unlawful act of taking property.","support":[{"end":382,"quote":"Unlawful act of taking property.","source_id":"nlm-mesh.d013800","source_sha256":"a9e333a7b18983a12524c2364fe588b0a31cee085fcaaa694c6fceeb6d3dfdde","start":350}],"target_id":"concept.mesh.d013800","target_kind":"node","target_sha256":"d4da3ee23221586b031c9e72b6723800f763c14bb42535a81a41fb7b143fc2fd"}],"concept.mesh.d014039":[{"id":"assertion.concept.mesh.d014039","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Toilet Training as described in the captured NLM MeSH descriptor D014039","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Toilet Training as: Conditioning to defecate and urinate in culturally acceptable places.","support":[{"end":415,"quote":"Conditioning to defecate and urinate in culturally acceptable places.","source_id":"nlm-mesh.d014039","source_sha256":"a2b6cb08cf8754bf7ad7a15a97ce4ab27b4b08110446e0adb4e4e7fef0be8bba","start":346}],"target_id":"concept.mesh.d014039","target_kind":"node","target_sha256":"9b54d8b2ca43f90a84271ff5c27686901b1319b20b98051d4515c457c75464ef"}],"concept.mesh.d014115":[{"id":"assertion.concept.mesh.d014115","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Toxemia as described in the captured NLM MeSH descriptor D014115","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Toxemia as: A condition produced by the presence of toxins or other harmful substances in the BLOOD .","support":[{"end":415,"quote":"A condition produced by the presence of toxins or other harmful substances in the\nBLOOD\n.","source_id":"nlm-mesh.d014115","source_sha256":"0e2af9719f1a7de35fd5dbf5e21a9a09d4c462413bb7857a9395fadd18143301","start":326}],"target_id":"concept.mesh.d014115","target_kind":"node","target_sha256":"46acad0d5246774dbea49f3db5aeea1542e5a4bee4ecb07e6f2d54d45174257d"}],"concept.mesh.d014552":[{"id":"assertion.concept.mesh.d014552","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Urinary Tract Infections as described in the captured NLM MeSH descriptor D014552","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Urinary Tract Infections as: Inflammatory responses of the epithelium of the URINARY TRACT to microbial invasions. They are often bacterial infections with associated BACTERIURIA and PYURIA .","support":[{"end":681,"quote":"Inflammatory responses of the epithelium of the\nURINARY TRACT\nto microbial invasions. They are often bacterial infections with associated\nBACTERIURIA\nand\nPYURIA\n.","source_id":"nlm-mesh.d014552","source_sha256":"9e148e61c9357e10c9a0ca530d529c67c9ebd50afec0fb566114f1a453c4f956","start":519}],"target_id":"concept.mesh.d014552","target_kind":"node","target_sha256":"9117b70277f3727358483a3e94c0985f9b3e3a36b714f0e62f0c4f969b105fe0"}],"concept.mesh.d014601":[{"id":"assertion.concept.mesh.d014601","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Utopias as described in the captured NLM MeSH descriptor D014601","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Utopias as: Ideal perfection especially in laws, government, and social conditions.","support":[{"end":401,"quote":"Ideal perfection especially in laws, government, and social conditions.","source_id":"nlm-mesh.d014601","source_sha256":"0eeb933cb27797f1e921a6fe6790525401c13a99e945132158097be0e5528d9d","start":330}],"target_id":"concept.mesh.d014601","target_kind":"node","target_sha256":"8841c3b20d0b8bdaee4631f480a4cd67d76b0d60e35b6dbf3ff12bc769b1e407"}],"concept.mesh.d014652":[{"id":"assertion.concept.mesh.d014652","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vascular Diseases as described in the captured NLM MeSH descriptor D014652","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vascular Diseases as: Pathological processes involving any of the BLOOD VESSELS in the cardiac or peripheral circulation. They include diseases of ARTERIES ; VEINS ; and rest of the vasculature system in the body.","support":[{"end":775,"quote":"Pathological processes involving any of the\nBLOOD VESSELS\nin the cardiac or peripheral circulation. They include diseases of\nARTERIES\n;\nVEINS\n; and rest of the vasculature system in the body.","source_id":"nlm-mesh.d014652","source_sha256":"4a62c6d1c5d0e1833582df2094e697e6e9d7c379fbb79b8b4c0a77842715417e","start":584}],"target_id":"concept.mesh.d014652","target_kind":"node","target_sha256":"7e7380224bdea1d85faf7a9931ef6d368e5f361c5707547f08769dd3555f9f41"}],"concept.mesh.d014742":[{"id":"assertion.concept.mesh.d014742","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Videodisc Recording as described in the captured NLM MeSH descriptor D014742","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Videodisc Recording as: The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","support":[{"end":674,"quote":"The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","source_id":"nlm-mesh.d014742","source_sha256":"aa045675bacf90dc2d7a1370bfd110d6130a4fe1d4c8c882a7da61d1c3debd21","start":560}],"target_id":"concept.mesh.d014742","target_kind":"node","target_sha256":"677273be8a141bd5d97d26c46ca5d5f7cec93b63ab5d5b1795ac1c22cc984345"}],"concept.mesh.d014743":[{"id":"assertion.concept.mesh.d014743","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Videotape Recording as described in the captured NLM MeSH descriptor D014743","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Videotape Recording as: Recording of visual and sometimes sound signals on magnetic tape.","support":[{"end":641,"quote":"Recording of visual and sometimes sound signals on magnetic tape.","source_id":"nlm-mesh.d014743","source_sha256":"fcd02b90f6bd5b0c2d02ef32aca34f4f938eea9cf511e8339cf8b7e9abd404df","start":576}],"target_id":"concept.mesh.d014743","target_kind":"node","target_sha256":"093b3600c5f149e4689dfcead07f656c751ff0d2363f5f29d09b88063c05ce44"}],"concept.mesh.d014754":[{"id":"assertion.concept.mesh.d014754","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Violence as described in the captured NLM MeSH descriptor D014754","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Violence as: Use of physical force causing or intent to cause harm, injury or abuse.","support":[{"end":423,"quote":"Use of physical force causing or intent to cause harm, injury or abuse.","source_id":"nlm-mesh.d014754","source_sha256":"1228cd0155018af3f10f1acbc1aa8b71450ed1568cf66329e2136de418e95312","start":352}],"target_id":"concept.mesh.d014754","target_kind":"node","target_sha256":"e912e095ecb171a1f256bcfea1b40a3f70fab382cceee783ed6ddd233f4ee6ff"}],"concept.mesh.d014777":[{"id":"assertion.concept.mesh.d014777","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Virus Diseases as described in the captured NLM MeSH descriptor D014777","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Virus Diseases as: A general term for diseases caused by viruses.","support":[{"end":423,"quote":"A general term for diseases caused by viruses.","source_id":"nlm-mesh.d014777","source_sha256":"0f1c4a43332695813bdab3a3a951ad0574e003784593e2391b5079c1333ea213","start":377}],"target_id":"concept.mesh.d014777","target_kind":"node","target_sha256":"20c89e4ad7fc8a95ad487756fb07c6aae7fe883782c7f9feaf29f0afc953ae3c"}],"concept.mesh.d014799":[{"id":"assertion.concept.mesh.d014799","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vitalism as described in the captured NLM MeSH descriptor D014799","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vitalism as: The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","support":[{"end":1107,"quote":"The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","source_id":"nlm-mesh.d014799","source_sha256":"6c8454abaaa9c100738ba516a5d319b4f814a2e9ee925fcf284fd3eb420b8c40","start":332}],"target_id":"concept.mesh.d014799","target_kind":"node","target_sha256":"5dc62037401ff179595af7aee70a4ab4e4b150fb2c9552ae66380204f9afac5c"}],"concept.mesh.d014858":[{"id":"assertion.concept.mesh.d014858","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"War Crimes as described in the captured NLM MeSH descriptor D014858","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes War Crimes as: Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","support":[{"end":491,"quote":"Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","source_id":"nlm-mesh.d014858","source_sha256":"04470bd2296cc1ab0aadc36667a3d1b6a6d6eee0a5febc77af5bdc0c08144c8c","start":364}],"target_id":"concept.mesh.d014858","target_kind":"node","target_sha256":"fdd09a1cffaa362f00c431c6e0b9a88abb7c5d02bdd43f0306301bcf7019571d"}],"concept.mesh.d014881":[{"id":"assertion.concept.mesh.d014881","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Water Supply as described in the captured NLM MeSH descriptor D014881","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Water Supply as: Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","support":[{"end":634,"quote":"Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","source_id":"nlm-mesh.d014881","source_sha256":"b4e59b65a306a1c916adf16d071806c7f444328dbffa09098685110ae7eaf61b","start":442}],"target_id":"concept.mesh.d014881","target_kind":"node","target_sha256":"c666989c1d6eec6bc85c0d70f7425825a4b35996ae24b6b8917766c654f343d3"}],"concept.mesh.d014946":[{"id":"assertion.concept.mesh.d014946","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wound Infection as described in the captured NLM MeSH descriptor D014946","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wound Infection as: Invasion of a wound by pathogenic microorganisms.","support":[{"end":442,"quote":"Invasion of a wound by pathogenic microorganisms.","source_id":"nlm-mesh.d014946","source_sha256":"3661c55ce0968675d7441f796d3bf75281669fca7e2378b631f8a06f93cd6ced","start":393}],"target_id":"concept.mesh.d014946","target_kind":"node","target_sha256":"0fdbe3d51603fdb8af33e6f1b44846529a03e515f3488fa1cbb51cafb961d067"}],"concept.mesh.d014947":[{"id":"assertion.concept.mesh.d014947","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wounds and Injuries as described in the captured NLM MeSH descriptor D014947","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wounds and Injuries as: Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","support":[{"end":575,"quote":"Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","source_id":"nlm-mesh.d014947","source_sha256":"3c807848e9b1082cc2f6ecb832a6f7f278e55cbddd9314d144f8ed5823cca4bd","start":439}],"target_id":"concept.mesh.d014947","target_kind":"node","target_sha256":"5d6a4d365cb4ad1104f8d366b5e94744be41aab935f6a64b5f19239bf2e19d76"}],"concept.mesh.d015013":[{"id":"assertion.concept.mesh.d015013","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Yoga as described in the captured NLM MeSH descriptor D015013","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Yoga as: A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","support":[{"end":808,"quote":"A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","source_id":"nlm-mesh.d015013","source_sha256":"0b7e88c7b49bb5e5feb9244db1a4904b3b283439edaf9924b9947e1875bc8ad5","start":417}],"target_id":"concept.mesh.d015013","target_kind":"node","target_sha256":"883799578468f2e951f1f07100d055a79dcd2eb1b26940c410320cc82cc14499"}],"concept.mesh.d015047":[{"id":"assertion.concept.mesh.d015047","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Zoonoses as described in the captured NLM MeSH descriptor D015047","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Zoonoses as: Diseases of non-human animals that may be transmitted to HUMANS or may be transmitted from humans to non-human animals.","support":[{"end":628,"quote":"Diseases of non-human animals that may be transmitted to\nHUMANS\nor may be transmitted from humans to non-human animals.","source_id":"nlm-mesh.d015047","source_sha256":"7ff0501e892d4125531a35facca9b86bf8b5dbb077e0e142dead0a09eda66322","start":509}],"target_id":"concept.mesh.d015047","target_kind":"node","target_sha256":"2531998e9acb53b24d8f18ec3a78923a9476d21c42d2e49da5b1c46b6848288f"}],"concept.mesh.d015233":[{"id":"assertion.concept.mesh.d015233","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Models, Statistical as described in the captured NLM MeSH descriptor D015233","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Models, Statistical as: Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","support":[{"end":691,"quote":"Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","source_id":"nlm-mesh.d015233","source_sha256":"7a4bb8d939a38432162df15e9954eea5824c6ed011e602e01b14087d40190d95","start":410}],"target_id":"concept.mesh.d015233","target_kind":"node","target_sha256":"293b658f6e2863d9a8bcea7abde27e5e049dc34a7d92ef10027e22340131e370"}],"concept.mesh.d015438":[{"id":"assertion.concept.mesh.d015438","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Behavior as described in the captured NLM MeSH descriptor D015438","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Behavior as: Combination of HEALTH KNOWLEDGE, ATTITUDES, PRACTICE which underlie actions taken by individuals regarding their health.","support":[{"end":466,"quote":"Combination of\nHEALTH KNOWLEDGE, ATTITUDES, PRACTICE\nwhich underlie actions taken by individuals regarding their health.","source_id":"nlm-mesh.d015438","source_sha256":"c1e6a829596005c482a2ddd8e6ec49a76138b4351cf206c54d1fa8203dd08f17","start":346}],"target_id":"concept.mesh.d015438","target_kind":"node","target_sha256":"2d460aecc026c67f9672863d221e408a5d6fe27d7d063dfb3f0f1d5fc92c0c5e"}],"concept.mesh.d015577":[{"id":"assertion.concept.mesh.d015577","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatric Assessment as described in the captured NLM MeSH descriptor D015577","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatric Assessment as: Evaluation of the level of physical, physiological, or mental functioning in the older population group.","support":[{"end":560,"quote":"Evaluation of the level of physical, physiological, or mental functioning in the older population group.","source_id":"nlm-mesh.d015577","source_sha256":"8b7937a2b358f49efdecf70241c464ab36d70ad0d61359da8898f41f0b515266","start":456}],"target_id":"concept.mesh.d015577","target_kind":"node","target_sha256":"4c08dadcc625eb8eeeae9fa1ba16e8ec88cd706e27e08fd180b480c420460565"}],"concept.mesh.d015619":[{"id":"assertion.concept.mesh.d015619","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Respiratory System Abnormalities as described in the captured NLM MeSH descriptor D015619","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Respiratory System Abnormalities as: Congenital structural abnormalities of the respiratory system.","support":[{"end":575,"quote":"Congenital structural abnormalities of the respiratory system.","source_id":"nlm-mesh.d015619","source_sha256":"5e5b5da4bf2848ac41618676b7df544f4c17adb2f30f59cba10c2329b44c3d21","start":513}],"target_id":"concept.mesh.d015619","target_kind":"node","target_sha256":"0805fa0c0c15fb96a81e4f40f988ece50174f40e33cca2822471ea981819d8fb"}],"concept.mesh.d015769":[{"id":"assertion.concept.mesh.d015769","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Granuloma, Respiratory Tract as described in the captured NLM MeSH descriptor D015769","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Granuloma, Respiratory Tract as: Granulomatous disorders affecting one or more sites in the respiratory tract.","support":[{"end":461,"quote":"Granulomatous disorders affecting one or more sites in the respiratory tract.","source_id":"nlm-mesh.d015769","source_sha256":"586502221a1a758f1eec429a90922414b52d56dab5808ee0f3f4f71bd779b153","start":384}],"target_id":"concept.mesh.d015769","target_kind":"node","target_sha256":"4add56160c11a7ae8ab063b9e6f54982daa82022fcc95c98ac861286376c28c1"}],"concept.mesh.d015817":[{"id":"assertion.concept.mesh.d015817","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eye Infections as described in the captured NLM MeSH descriptor D015817","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eye Infections as: Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","support":[{"end":596,"quote":"Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","source_id":"nlm-mesh.d015817","source_sha256":"4d3553d38f2e71a4c4f15bc4a8d963fef1bc143ad890fcfa5708486f7b50ea6c","start":394}],"target_id":"concept.mesh.d015817","target_kind":"node","target_sha256":"12655c6f46ef77d2cd4d533282cc6f56479767d3f2bd59a6625cab80e1ed8a80"}],"concept.mesh.d015984":[{"id":"assertion.concept.mesh.d015984","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Causality as described in the captured NLM MeSH descriptor D015984","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Causality as: The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","support":[{"end":899,"quote":"The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","source_id":"nlm-mesh.d015984","source_sha256":"051190e1af34bfd7ee7e95569b96899a8bd8ff58e104344efe87a49bce90a01e","start":522}],"target_id":"concept.mesh.d015984","target_kind":"node","target_sha256":"d95b9058e92a093419feda2a80ae5690dab1fe1a83c1d5b5e95358aac48b78cd"}],"concept.mesh.d015985":[{"id":"assertion.concept.mesh.d015985","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precipitating Factors as described in the captured NLM MeSH descriptor D015985","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precipitating Factors as: Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","support":[{"end":864,"quote":"Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","source_id":"nlm-mesh.d015985","source_sha256":"f0d6c58ec811e9aff8c9a08fc1c4f896e06217501ba2a256ef40871fa7be5e13","start":476}],"target_id":"concept.mesh.d015985","target_kind":"node","target_sha256":"4036b0fd9568fa520a38ce7ca625186f2783badeab636cff0cd6e8f85ea461af"}],"concept.mesh.d016013":[{"id":"assertion.concept.mesh.d016013","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Likelihood Functions as described in the captured NLM MeSH descriptor D016013","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Likelihood Functions as: Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","support":[{"end":793,"quote":"Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","source_id":"nlm-mesh.d016013","source_sha256":"dc819be1e885310bc038a2e72370af9d40917486c2252983bf886bc12b1efdbc","start":519}],"target_id":"concept.mesh.d016013","target_kind":"node","target_sha256":"72316acff270403f05b8135b2f72b14098abdcae7fe663aea38d85d22a4539be"}],"concept.mesh.d016014":[{"id":"assertion.concept.mesh.d016014","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Linear Models as described in the captured NLM MeSH descriptor D016014","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Linear Models as: Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","support":[{"end":690,"quote":"Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","source_id":"nlm-mesh.d016014","source_sha256":"dbb0ca6a4546f586a426e662ba421984c22f639a7086a3a5d5a82f910e6a2477","start":505}],"target_id":"concept.mesh.d016014","target_kind":"node","target_sha256":"4f9208447a5dfcfe47ccb4becab3b1d13af0561667d4a97a6b55abae7ed1ba30"}],"concept.mesh.d016015":[{"id":"assertion.concept.mesh.d016015","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Logistic Models as described in the captured NLM MeSH descriptor D016015","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Logistic Models as: Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","support":[{"end":955,"quote":"Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","source_id":"nlm-mesh.d016015","source_sha256":"0a915438f1d7defb0c756341c1ab4170af166b92e61f0bde89719488bcfd43f6","start":589}],"target_id":"concept.mesh.d016015","target_kind":"node","target_sha256":"513f5b651b87843de5e9e89b48db636642de8dc9992f5180a831d51554fcb264"}],"concept.mesh.d016249":[{"id":"assertion.concept.mesh.d016249","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optical Storage Devices as described in the captured NLM MeSH descriptor D016249","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optical Storage Devices as: A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","support":[{"end":669,"quote":"A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","source_id":"nlm-mesh.d016249","source_sha256":"81519b74f083c0330a9c2ec7b567df07a504e29539e558520c404e1e1bda20bc","start":422}],"target_id":"concept.mesh.d016249","target_kind":"node","target_sha256":"bb8300b8cf42db6954bd7c37422e412a5f46e5a944ffcb778720b1f50409b9ab"}],"concept.mesh.d016265":[{"id":"assertion.concept.mesh.d016265","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Conflict of Interest as described in the captured NLM MeSH descriptor D016265","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Conflict of Interest as: A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","support":[{"end":741,"quote":"A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","source_id":"nlm-mesh.d016265","source_sha256":"9a5c9620bb1103f8f4ab3164469dada2631ab3baab710f31daa1db717c5c32a1","start":376}],"target_id":"concept.mesh.d016265","target_kind":"node","target_sha256":"c9b5bed2420db18b59d7b3e8a98c601c2251818f99e19b363c80ffa233b1055c"}],"concept.mesh.d016459":[{"id":"assertion.concept.mesh.d016459","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prosthesis-Related Infections as described in the captured NLM MeSH descriptor D016459","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prosthesis-Related Infections as: Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","support":[{"end":759,"quote":"Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","source_id":"nlm-mesh.d016459","source_sha256":"83b5701defeb677b04195ff701845e699e59ed5fc6315ac28bcee7fc88f88931","start":569}],"target_id":"concept.mesh.d016459","target_kind":"node","target_sha256":"7a01d2423467b4b6d47a3ed3f15d873fbcb778beece5dd476d22d8bfd2f0f09c"}],"concept.mesh.d016609":[{"id":"assertion.concept.mesh.d016609","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Second Primary as described in the captured NLM MeSH descriptor D016609","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Second Primary as: Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","support":[{"end":1311,"quote":"Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","source_id":"nlm-mesh.d016609","source_sha256":"a492e0cd1c2f63f4756bf60b9c5b55575bfd09c6921a24668549babae66a720d","start":836}],"target_id":"concept.mesh.d016609","target_kind":"node","target_sha256":"55524ada603e213eb629fe419755f53a36fd83be75f63386be003aa6ccd999c5"}],"concept.mesh.d016709":[{"id":"assertion.concept.mesh.d016709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Yin-Yang as described in the captured NLM MeSH descriptor D016709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Yin-Yang as: In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","support":[{"end":1186,"quote":"In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","source_id":"nlm-mesh.d016709","source_sha256":"66713cd88924c4bc53e616294b8c54a54c07ca7e8f28c306c3e1c5a9d22a246b","start":488}],"target_id":"concept.mesh.d016709","target_kind":"node","target_sha256":"5dadf374c808165521961c0fb0c372329a85b6bbfa8ab3fd0881a62fd542a632"}],"concept.mesh.d016743":[{"id":"assertion.concept.mesh.d016743","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mental Competency as described in the captured NLM MeSH descriptor D016743","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mental Competency as: The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","support":[{"end":697,"quote":"The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","source_id":"nlm-mesh.d016743","source_sha256":"d81e2d972fc0380979449450a39387ee26fb1f0707433d4fb19d16035548e4d8","start":564}],"target_id":"concept.mesh.d016743","target_kind":"node","target_sha256":"2af7237dcda83f8ae4f0d25fc48041b749b8425677deca9cacf443db25a3b2cc"}],"concept.mesh.d017004":[{"id":"assertion.concept.mesh.d017004","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Codependency, Psychological as described in the captured NLM MeSH descriptor D017004","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Codependency, Psychological as: A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","support":[{"end":481,"quote":"A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","source_id":"nlm-mesh.d017004","source_sha256":"42bee99debc3107336e595d44e7143d0001421266595ceb1468eb96a348f7b1f","start":370}],"target_id":"concept.mesh.d017004","target_kind":"node","target_sha256":"db28cd87e220b6589ede0bba80a9b90b495367fb7d9acf82a3c485b73fa284a8"}],"concept.mesh.d017063":[{"id":"assertion.concept.mesh.d017063","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Outcome Assessment, Health Care as described in the captured NLM MeSH descriptor D017063","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Outcome Assessment, Health Care as: Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","support":[{"end":928,"quote":"Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","source_id":"nlm-mesh.d017063","source_sha256":"41fe37665eb9fb7aefbe8f8db306f305e60133ffc6c7384a17da66363b911f4c","start":633}],"target_id":"concept.mesh.d017063","target_kind":"node","target_sha256":"fdac575e3f3a9e0603e7771713665f66ccd7eadd02706e6eb9cb5ade590f2b29"}],"concept.mesh.d017143":[{"id":"assertion.concept.mesh.d017143","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fuzzy Logic as described in the captured NLM MeSH descriptor D017143","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fuzzy Logic as: Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","support":[{"end":738,"quote":"Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","source_id":"nlm-mesh.d017143","source_sha256":"bfcde8e143d3b5ec7b6c62624dc8c792ae1e4a63427ade614f3d6110f9b41529","start":374}],"target_id":"concept.mesh.d017143","target_kind":"node","target_sha256":"a947de38d1b4f80e2c8b63508eac729b7f90d9cd4891ce41468db7c903446086"}],"concept.mesh.d017149":[{"id":"assertion.concept.mesh.d017149","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Private Sector as described in the captured NLM MeSH descriptor D017149","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","support":[{"end":596,"quote":"That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","source_id":"nlm-mesh.d017149","source_sha256":"11d32d456149e495e6ab26b2c77d27025f776138761dcc1e21c9465e0fa2c25e","start":438}],"target_id":"concept.mesh.d017149","target_kind":"node","target_sha256":"07d3390cec527b9b5ac76ab7f8ac654c77510e727c1e442442faf1fe2fd5e608"}],"concept.mesh.d017150":[{"id":"assertion.concept.mesh.d017150","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Public Sector as described in the captured NLM MeSH descriptor D017150","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Public Sector as: The area of a nation's economy that is tax-supported and under government control.","support":[{"end":517,"quote":"The area of a nation's economy that is tax-supported and under government control.","source_id":"nlm-mesh.d017150","source_sha256":"8c888f9327fd0b128f9735dbb0795f21d454a0115aa24bca6e6018ade4045770","start":435}],"target_id":"concept.mesh.d017150","target_kind":"node","target_sha256":"bb674304c1f8a842c3cb37bb151f2102f5bd0f6563ab4c3ee43a4ccd9325f731"}],"concept.mesh.d017169":[{"id":"assertion.concept.mesh.d017169","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neoplasms, Post-Traumatic as described in the captured NLM MeSH descriptor D017169","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neoplasms, Post-Traumatic as: Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","support":[{"end":539,"quote":"Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","source_id":"nlm-mesh.d017169","source_sha256":"0d11e708529c853b2a555b4ad4c81a56d6cb472cccf979e7e05374a8a555b8f4","start":438}],"target_id":"concept.mesh.d017169","target_kind":"node","target_sha256":"dbf5002c7e9dc4f46e05e249dacdfa4db0c85ff08210faf1dfa421800332fb99"}],"concept.mesh.d017533":[{"id":"assertion.concept.mesh.d017533","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Marital Status as described in the captured NLM MeSH descriptor D017533","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Marital Status as: A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness ( SINGLE PERSON ), etc.","support":[{"end":716,"quote":"A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness (\nSINGLE PERSON\n), etc.","source_id":"nlm-mesh.d017533","source_sha256":"8a6a6372c1a3533308854e577fcee34ff2d4b7ff20b9164f86e8f363686e14e9","start":583}],"target_id":"concept.mesh.d017533","target_kind":"node","target_sha256":"b2a6276e929e7d815e8bf937ab4cc8bdbbec6754a2001ee9aaa936e87cce31e0"}],"concept.mesh.d017677":[{"id":"assertion.concept.mesh.d017677","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Age Distribution as described in the captured NLM MeSH descriptor D017677","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Age Distribution as: The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","support":[{"end":737,"quote":"The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","source_id":"nlm-mesh.d017677","source_sha256":"be66664dfad1833fed8eb0bbced9b488e9da423902b25a9ec953b69349578edb","start":452}],"target_id":"concept.mesh.d017677","target_kind":"node","target_sha256":"6570009549d9461cd987864a214a5a4e47a0ed0f8080d65bd9c6a1de97425634"}],"concept.mesh.d017678":[{"id":"assertion.concept.mesh.d017678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sex Distribution as described in the captured NLM MeSH descriptor D017678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sex Distribution as: The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","support":[{"end":739,"quote":"The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","source_id":"nlm-mesh.d017678","source_sha256":"b833b36b39893b05043a28e8021b09d2f9a5b601f922a26bf90c406a08a8797b","start":452}],"target_id":"concept.mesh.d017678","target_kind":"node","target_sha256":"b7621a05042e6387e72b606dc4d1762f0e33244955135c35e08a92a72b34849e"}],"concept.mesh.d017712":[{"id":"assertion.concept.mesh.d017712","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Peer Review, Research as described in the captured NLM MeSH descriptor D017712","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Peer Review, Research as: The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","support":[{"end":771,"quote":"The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","source_id":"nlm-mesh.d017712","source_sha256":"4e12c4ffe63c246f66fdc50ebf9651bd3a637d4d8ac24167e6236e372c629a8b","start":446}],"target_id":"concept.mesh.d017712","target_kind":"node","target_sha256":"948e590034d8291ffd23bfa1a9a5ade88fd88496ab1daa448cd35c895bdcb0a6"}],"concept.mesh.d017714":[{"id":"assertion.concept.mesh.d017714","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community-Acquired Infections as described in the captured NLM MeSH descriptor D017714","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community-Acquired Infections as: Any infection acquired in the community, that is, contrasted with those acquired in a health care facility ( CROSS INFECTION ). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","support":[{"end":869,"quote":"Any infection acquired in the community, that is, contrasted with those acquired in a health care facility (\nCROSS INFECTION\n). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","source_id":"nlm-mesh.d017714","source_sha256":"a8f68af21897015f69c858fe005103aa886be91b9be613f3729b075bcece825f","start":543}],"target_id":"concept.mesh.d017714","target_kind":"node","target_sha256":"a21d3e37f0a71a2f7a656924446de547f6a013adab2ed2c39e2d42ec14f89c58"}],"concept.mesh.d018376":[{"id":"assertion.concept.mesh.d018376","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Abnormalities as described in the captured NLM MeSH descriptor D018376","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Abnormalities as: Congenital, inherited, or acquired anomalies of the CARDIOVASCULAR SYSTEM , including the HEART and BLOOD VESSELS .","support":[{"end":630,"quote":"Congenital, inherited, or acquired anomalies of the\nCARDIOVASCULAR SYSTEM\n, including the\nHEART\nand\nBLOOD VESSELS\n.","source_id":"nlm-mesh.d018376","source_sha256":"5b2c511b206eddac6c37fbebea42fc7bfc18243e3f4b8106c3328bd0f456eda0","start":515}],"target_id":"concept.mesh.d018376","target_kind":"node","target_sha256":"e682198456d99d9ba94f49a765a8bfc2b16497c5a82e96ff2a60ea3e04a63ca0"}],"concept.mesh.d018401":[{"id":"assertion.concept.mesh.d018401","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sample Size as described in the captured NLM MeSH descriptor D018401","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sample Size as: The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","support":[{"end":802,"quote":"The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","source_id":"nlm-mesh.d018401","source_sha256":"04ac382c2a9d51766614ada8600a568e4f23a74d8e912c9accedac8aafdd6fb5","start":508}],"target_id":"concept.mesh.d018401","target_kind":"node","target_sha256":"f9be95644312ff9ee12fde528cc89caffe1e0903c4e9d4c3f7b6242691768c0b"}],"concept.mesh.d018461":[{"id":"assertion.concept.mesh.d018461","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Soft Tissue Infections as described in the captured NLM MeSH descriptor D018461","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Soft Tissue Infections as: Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","support":[{"end":972,"quote":"Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","source_id":"nlm-mesh.d018461","source_sha256":"d90a090e254af6558158529410c05e49e92c64c4230257f65d760db6ce6a8044","start":460}],"target_id":"concept.mesh.d018461","target_kind":"node","target_sha256":"cb9e6db40d0b50d10e5711d38b5b905aa5bb89857ed4bbce4521aa3c15081d8f"}],"concept.mesh.d018511":[{"id":"assertion.concept.mesh.d018511","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Systems Integration as described in the captured NLM MeSH descriptor D018511","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Systems Integration as: The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","support":[{"end":579,"quote":"The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","source_id":"nlm-mesh.d018511","source_sha256":"40fe7232079c9e97cf68eedc29ba4f8d9383a12a2f299945385dce076d43536f","start":366}],"target_id":"concept.mesh.d018511","target_kind":"node","target_sha256":"375f3fe2bbeec196e485bb37e864c3449871fd029eb0080bd207bd11ac8329f7"}],"concept.mesh.d018581":[{"id":"assertion.concept.mesh.d018581","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology Transfer as described in the captured NLM MeSH descriptor D018581","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology Transfer as: Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","support":[{"end":855,"quote":"Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","source_id":"nlm-mesh.d018581","source_sha256":"de5f4d14c251e0c391c6639c3b66609f242cad2b122f0e97ef3e044f2b2fbb37","start":370}],"target_id":"concept.mesh.d018581","target_kind":"node","target_sha256":"2ced3cd889e4ffafb1db8b23f077b6151a909f9017224f9066de9629ee59f60f"}],"concept.mesh.d018594":[{"id":"assertion.concept.mesh.d018594","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Body as described in the captured NLM MeSH descriptor D018594","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Body as: The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","support":[{"end":722,"quote":"The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d018594","source_sha256":"ef56a524a7584b113f328926656c8618a5419334a212266ef2d1cd8d26f5aba7","start":463}],"target_id":"concept.mesh.d018594","target_kind":"node","target_sha256":"84bd374ca9ab6a5bfc741c6ca88f8d26f593ad3f079655f60ddc35769e424c0d"}],"concept.mesh.d018595":[{"id":"assertion.concept.mesh.d018595","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Colonialism as described in the captured NLM MeSH descriptor D018595","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Colonialism as: The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","support":[{"end":801,"quote":"The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d018595","source_sha256":"6b8a7cfbf776e39961be5dba0b19337e522b24c0ea3489ff7a6a059665f536f2","start":380}],"target_id":"concept.mesh.d018595","target_kind":"node","target_sha256":"d3c0427540357b9df3107512cc6a5636b8d4e311a19244fe130048c330c84e3c"}],"concept.mesh.d018596":[{"id":"assertion.concept.mesh.d018596","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hinduism as described in the captured NLM MeSH descriptor D018596","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hinduism as: A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","support":[{"end":781,"quote":"A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","source_id":"nlm-mesh.d018596","source_sha256":"0f9f31bac3ff1cc382db4a06c629834c46ad7ff49ea51d000c48f74ee5dfe341","start":373}],"target_id":"concept.mesh.d018596","target_kind":"node","target_sha256":"042b25d39a3ffd46062cb7bb23a1d047e903bb5a139bd6ffa04a03a105b5811e"}],"concept.mesh.d018597":[{"id":"assertion.concept.mesh.d018597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Saints as described in the captured NLM MeSH descriptor D018597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Saints as: Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","support":[{"end":658,"quote":"Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","source_id":"nlm-mesh.d018597","source_sha256":"43bcc3daaf51d66e3870758e7fd61070bf658f328da4e3d52f536fff8039e813","start":468}],"target_id":"concept.mesh.d018597","target_kind":"node","target_sha256":"cf1edec667de4fc4be714641d08a6798dfc66ba6a37628b0ec8597986c4337bc"}],"concept.mesh.d018715":[{"id":"assertion.concept.mesh.d018715","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microscopy, Video as described in the captured NLM MeSH descriptor D018715","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microscopy, Video as: Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in TELEPATHOLOGY .","support":[{"end":637,"quote":"Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in\nTELEPATHOLOGY\n.","source_id":"nlm-mesh.d018715","source_sha256":"cb64ac71c08c22c21675bf0df911199fecbfd8a94a1892bbbe766f3eafcdece6","start":461}],"target_id":"concept.mesh.d018715","target_kind":"node","target_sha256":"8459f6062fbd80c3758de7fd1c054f8f9bb273015cbd5b162758191d76ae902e"}],"concept.mesh.d018805":[{"id":"assertion.concept.mesh.d018805","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sepsis as described in the captured NLM MeSH descriptor D018805","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sepsis as: Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by HYPOTENSION despite adequate fluid infusion, it is called SEPTIC SHOCK .","support":[{"end":736,"quote":"Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by\nHYPOTENSION\ndespite adequate fluid infusion, it is called\nSEPTIC SHOCK\n.","source_id":"nlm-mesh.d018805","source_sha256":"38618eee0cd694e4ece1e6627f891e2f570e7107b97859dd79219a1347324f09","start":433}],"target_id":"concept.mesh.d018805","target_kind":"node","target_sha256":"e59964344d7d671712a76d43b7786be9e8249b2d29d8e850ad3045ccd21cfa8b"}],"concept.mesh.d018939":[{"id":"assertion.concept.mesh.d018939","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Holistic Nursing as described in the captured NLM MeSH descriptor D018939","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Holistic Nursing as: A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","support":[{"end":731,"quote":"A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","source_id":"nlm-mesh.d018939","source_sha256":"37e1b5026cf6455dbcebee07a0e2c214b5379f0ea3fd1ec2150048e5aeb56500","start":384}],"target_id":"concept.mesh.d018939","target_kind":"node","target_sha256":"bcd1ccec3063f530d2b956c06443e3e33cc261ae7a9781515b3a1e4983a0da88"}],"concept.mesh.d019149":[{"id":"assertion.concept.mesh.d019149","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioreactors as described in the captured NLM MeSH descriptor D019149","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioreactors as: Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","support":[{"end":701,"quote":"Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","source_id":"nlm-mesh.d019149","source_sha256":"d754453309506c8db66dde858b3b212680ebd8da3bd6deab67ef078bfcfd3015","start":350}],"target_id":"concept.mesh.d019149","target_kind":"node","target_sha256":"690550c7c76ce47855adb68769c2848815632484e39052936b94779683982f25"}],"concept.mesh.d019212":[{"id":"assertion.concept.mesh.d019212","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multimedia as described in the captured NLM MeSH descriptor D019212","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multimedia as: Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","support":[{"end":675,"quote":"Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","source_id":"nlm-mesh.d019212","source_sha256":"55538be03ffb898c11a99ab9441f027a20766a8e0db744857ce49e40cac6b4a4","start":495}],"target_id":"concept.mesh.d019212","target_kind":"node","target_sha256":"7310a256d13dfca606fc1dd5d443e6c4558e4659d13fec37dadf19e575d49eb1"}],"concept.mesh.d019348":[{"id":"assertion.concept.mesh.d019348","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Empiricism as described in the captured NLM MeSH descriptor D019348","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Empiricism as: One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":1180,"quote":"One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019348","source_sha256":"772e3d46932c2a14cbe60d22363ae0d3fa406ed1670ee40f5d0855a808b713cb","start":340}],"target_id":"concept.mesh.d019348","target_kind":"node","target_sha256":"226baa128a6f07f0969b23abbebdd0926fe607322383cc0a3590144b16a5bc14"}],"concept.mesh.d019352":[{"id":"assertion.concept.mesh.d019352","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Censuses as described in the captured NLM MeSH descriptor D019352","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Censuses as: Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","support":[{"end":1108,"quote":"Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","source_id":"nlm-mesh.d019352","source_sha256":"9826f7f79961f655b6d6f577b933cb24964916081f158c3bf6258ac39bc8c3ac","start":420}],"target_id":"concept.mesh.d019352","target_kind":"node","target_sha256":"4ee3be37cddc798a42fdd64d187e20864135cede20523de1e5964d09b5ddf583"}],"concept.mesh.d019356":[{"id":"assertion.concept.mesh.d019356","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Grave Robbing as described in the captured NLM MeSH descriptor D019356","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Grave Robbing as: Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","support":[{"end":911,"quote":"Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","source_id":"nlm-mesh.d019356","source_sha256":"40f5635692116957eaacf79ace1334f5b1ec1dcf90a89b9cd940ec1ca2e9e8dd","start":433}],"target_id":"concept.mesh.d019356","target_kind":"node","target_sha256":"48dc9ef85b2818ac7bcf5f427d2ddd9894a6d51742d3735b0d9fa8a654883bb4"}],"concept.mesh.d019359":[{"id":"assertion.concept.mesh.d019359","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Knowledge as described in the captured NLM MeSH descriptor D019359","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Knowledge as: The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","support":[{"end":823,"quote":"The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","source_id":"nlm-mesh.d019359","source_sha256":"3b8b795f1b62cc759cbcd8723538c90b8ee3343d1c71fc1035b38fcd1b8beb3f","start":663}],"target_id":"concept.mesh.d019359","target_kind":"node","target_sha256":"85fa239229172448ad1853a569a365ca9315609824d5b5ec81e39a0bcc44eb20"}],"concept.mesh.d019364":[{"id":"assertion.concept.mesh.d019364","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Humoralism as described in the captured NLM MeSH descriptor D019364","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Humoralism as: An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","support":[{"end":515,"quote":"An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","source_id":"nlm-mesh.d019364","source_sha256":"0e33099787af675d0c39cb09e0220f22c464cfe474bec867309bd667ed3152f9","start":340}],"target_id":"concept.mesh.d019364","target_kind":"node","target_sha256":"fc64af52923f8b884e4ef3b4608f2ce6b815c19bbf814335ec80cc889aba1e80"}],"concept.mesh.d019365":[{"id":"assertion.concept.mesh.d019365","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metaphor as described in the captured NLM MeSH descriptor D019365","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metaphor as: The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","support":[{"end":796,"quote":"The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","source_id":"nlm-mesh.d019365","source_sha256":"c45bf11c549422bb8415d53040be916d47e91bada869f0627cffa4a41fee22d8","start":404}],"target_id":"concept.mesh.d019365","target_kind":"node","target_sha256":"4933922e8ec3c591a9b204ba60e4b5b1bbb17e48ce11728fde914b4a8a77e649"}],"concept.mesh.d019368":[{"id":"assertion.concept.mesh.d019368","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nature as described in the captured NLM MeSH descriptor D019368","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nature as: The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":758,"quote":"The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019368","source_sha256":"93844a2e3ec32dd176b5002c3c6f1cee83493ec50bc81476e22d92a052f5897a","start":529}],"target_id":"concept.mesh.d019368","target_kind":"node","target_sha256":"29fb2f4ad7ff6299334f4ca2aee8dc8b00f93afccf7629f29408d0964bc4d85e"}],"concept.mesh.d019369":[{"id":"assertion.concept.mesh.d019369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Life as described in the captured NLM MeSH descriptor D019369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Life as: The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":848,"quote":"The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019369","source_sha256":"f6a2da185a53cfa11214e925464f1dc0a629b5173ca0b795e0eda04b8f4ac4fe","start":324}],"target_id":"concept.mesh.d019369","target_kind":"node","target_sha256":"c53cef83b2c8804a5d4707611be6b61a5828c7d624623feaf4cd1da179d7f9ee"}],"concept.mesh.d019413":[{"id":"assertion.concept.mesh.d019413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Qi as described in the captured NLM MeSH descriptor D019413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Qi as: The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","support":[{"end":973,"quote":"The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","source_id":"nlm-mesh.d019413","source_sha256":"eb59e00517d3d38347aea00b116814657bc56818c96bb9ecee12d04a5aeb74a9","start":382}],"target_id":"concept.mesh.d019413","target_kind":"node","target_sha256":"f6a52efa3c5fbe571e5e5375c48230771019b0efb09c61eee75582a25797b7a4"}],"concept.mesh.d019456":[{"id":"assertion.concept.mesh.d019456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Health Transition as described in the captured NLM MeSH descriptor D019456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Health Transition as: Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","support":[{"end":1156,"quote":"Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","source_id":"nlm-mesh.d019456","source_sha256":"77b5e538a4f196a506fc6740b8113f26ea97d702770070474c8d9e43bf169471","start":478}],"target_id":"concept.mesh.d019456","target_kind":"node","target_sha256":"e5a7f7469f0d18788f334a0f2128d26cb6ce7cbd1d944a125c40a36316b109c7"}],"concept.mesh.d019513":[{"id":"assertion.concept.mesh.d019513","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feminism as described in the captured NLM MeSH descriptor D019513","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feminism as: The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","support":[{"end":543,"quote":"The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","source_id":"nlm-mesh.d019513","source_sha256":"d0bc7c1d9351499c04cd2a396ce245bd658fe20abe2b74f0efbe83bc1e9be2b7","start":364}],"target_id":"concept.mesh.d019513","target_kind":"node","target_sha256":"614ce4d87a6bb00903e99eb6cf5d153d7d589ebf1e9c468bd94d80f6d907b637"}],"concept.mesh.d019636":[{"id":"assertion.concept.mesh.d019636","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurodegenerative Diseases as described in the captured NLM MeSH descriptor D019636","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurodegenerative Diseases as: Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","support":[{"end":702,"quote":"Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","source_id":"nlm-mesh.d019636","source_sha256":"39286b297e5eb67a2d510e2184a2a2a016099c89def59816b272bac6668fac6d","start":486}],"target_id":"concept.mesh.d019636","target_kind":"node","target_sha256":"ad9c3ada71714eda34406ad42f2d83a8a6bb350502740e6d731a3991c61c642d"}],"concept.mesh.d019954":[{"id":"assertion.concept.mesh.d019954","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurobehavioral Manifestations as described in the captured NLM MeSH descriptor D019954","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurobehavioral Manifestations as: Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","support":[{"end":669,"quote":"Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","source_id":"nlm-mesh.d019954","source_sha256":"230fab51794b5d63a024e0a4b9ad64212550075f0ce429d5932e3f86075ca6dc","start":433}],"target_id":"concept.mesh.d019954","target_kind":"node","target_sha256":"3e939ea61442bc0e1ae0de2fc1e9b487cd37d58a570dd502bcae21174bd5f913"}],"concept.mesh.d020196":[{"id":"assertion.concept.mesh.d020196","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Trauma, Nervous System as described in the captured NLM MeSH descriptor D020196","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Trauma, Nervous System as: Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","support":[{"end":620,"quote":"Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","source_id":"nlm-mesh.d020196","source_sha256":"2db1895013b71852dc309bf2adda0d9a08da61e6220e45b7abe19456a6842855","start":446}],"target_id":"concept.mesh.d020196","target_kind":"node","target_sha256":"5cd0afe79f8a27a810f0c25c9cb99ebdf740d8a9a42d308fda39d94369e56570"}],"concept.mesh.d020258":[{"id":"assertion.concept.mesh.d020258","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurotoxicity Syndromes as described in the captured NLM MeSH descriptor D020258","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurotoxicity Syndromes as: Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","support":[{"end":581,"quote":"Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","source_id":"nlm-mesh.d020258","source_sha256":"d876b8094e385054b0032c131d6962039043f400af0a6234a1b400294f43574e","start":370}],"target_id":"concept.mesh.d020258","target_kind":"node","target_sha256":"e61bcbd75e435aafffe593f9d245a09ba3f72a7cdf995759f945281fe654000e"}],"concept.mesh.d020274":[{"id":"assertion.concept.mesh.d020274","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Autoimmune Diseases of the Nervous System as described in the captured NLM MeSH descriptor D020274","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Autoimmune Diseases of the Nervous System as: Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g., MULTIPLE SCLEROSIS ) or the peripheral nervous system (e.g., GUILLAIN-BARRE SYNDROME ).","support":[{"end":748,"quote":"Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g.,\nMULTIPLE SCLEROSIS\n) or the peripheral nervous system (e.g.,\nGUILLAIN-BARRE SYNDROME\n).","source_id":"nlm-mesh.d020274","source_sha256":"8b0bc605ea655d29cfd94a864702efa6c87e704688ef01f9cb31d263406863ea","start":406}],"target_id":"concept.mesh.d020274","target_kind":"node","target_sha256":"045baf4eac5943bb1390448c765fcfedf5315e41c6e52a9dcc43d24ed28a8c9a"}],"concept.mesh.d020650":[{"id":"assertion.concept.mesh.d020650","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Combinatorial Chemistry Techniques as described in the captured NLM MeSH descriptor D020650","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Combinatorial Chemistry Techniques as: A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","support":[{"end":565,"quote":"A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","source_id":"nlm-mesh.d020650","source_sha256":"711c4e8c5e22edfa2a39044601cc8a2fa393e5a2f6ba19aa3bd03db273db527e","start":404}],"target_id":"concept.mesh.d020650","target_kind":"node","target_sha256":"2fe0b330808be5b771e0542110ee77228b2f549a008c816f698f50df9083f652"}],"concept.mesh.d020752":[{"id":"assertion.concept.mesh.d020752","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurocutaneous Syndromes as described in the captured NLM MeSH descriptor D020752","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurocutaneous Syndromes as: A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","support":[{"end":660,"quote":"A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","source_id":"nlm-mesh.d020752","source_sha256":"48bb45bd74512d9bb70691055085308ada78fb9414b4bd6d64b0b3cc0ec970e0","start":522}],"target_id":"concept.mesh.d020752","target_kind":"node","target_sha256":"a3720b952c4c2f17bb062c4ccd7eb0fe10b32f579357752a68accb43fab1a6bf"}],"concept.mesh.d021081":[{"id":"assertion.concept.mesh.d021081","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chronobiology Disorders as described in the captured NLM MeSH descriptor D021081","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chronobiology Disorders as: Disruptions of the rhythmic cycle of bodily functions or activities.","support":[{"end":426,"quote":"Disruptions of the rhythmic cycle of bodily functions or activities.","source_id":"nlm-mesh.d021081","source_sha256":"8adc893f4b3f8c9f4d21deb26abcfdee0f9094de601b13ba28d49a853b4e05bc","start":358}],"target_id":"concept.mesh.d021081","target_kind":"node","target_sha256":"1fb4bccf2d5ef1d6ff0a5d89c0579bb7b59c0a2c40fd7bc29e9259eeb6fb4370"}],"concept.mesh.d024803":[{"id":"assertion.concept.mesh.d024803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Enhancement as described in the captured NLM MeSH descriptor D024803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Enhancement as: The use of technology-based interventions to improve functional capacities rather than to treat disease.","support":[{"end":480,"quote":"The use of technology-based interventions to improve functional capacities rather than to treat disease.","source_id":"nlm-mesh.d024803","source_sha256":"c8168416acf1bc833bbfaef01465293827ea4feb4037a86b29b45a97f0929af6","start":376}],"target_id":"concept.mesh.d024803","target_kind":"node","target_sha256":"a0154c928d196fcffb5f068066a5e0f10e1c5e396df981fa3e6078ebd4836e8e"}],"concept.mesh.d024861":[{"id":"assertion.concept.mesh.d024861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Enhancement as described in the captured NLM MeSH descriptor D024861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Enhancement as: The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","support":[{"end":564,"quote":"The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","source_id":"nlm-mesh.d024861","source_sha256":"0082884b277d0128a9809d07c005ad97917d3eb3ab8a152aa54cfa26f26e4064","start":454}],"target_id":"concept.mesh.d024861","target_kind":"node","target_sha256":"4e1282ab39ff25d620b24b035577dad05edeb2343032000c6aab706844cd73b4"}],"concept.mesh.d026684":[{"id":"assertion.concept.mesh.d026684","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personal Autonomy as described in the captured NLM MeSH descriptor D026684","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personal Autonomy as: Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","support":[{"end":588,"quote":"Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026684","source_sha256":"fde71ea5f860a2107cbe703fc2631bf5c8eda9ecf7dbd65eecf371a7dbdb31fa","start":430}],"target_id":"concept.mesh.d026684","target_kind":"node","target_sha256":"12f45d9f9dab0e49f2c6c897099d1685bb99fa289e8b781eed81567a1a6e4a7d"}],"concept.mesh.d026686":[{"id":"assertion.concept.mesh.d026686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beneficence as described in the captured NLM MeSH descriptor D026686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beneficence as: The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of BENEFICENCE requires producing net benefit over harm. (Bioethics Thesaurus)","support":[{"end":598,"quote":"The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of\nBENEFICENCE\nrequires producing net benefit over harm. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026686","source_sha256":"34b8fb4abf330dd9a0ef23867d71bc4f1318cd76fcc62ae714813cafee158609","start":366}],"target_id":"concept.mesh.d026686","target_kind":"node","target_sha256":"7d9a8261c6ffc4383f2769dbdbbbda0a8b1530d1790cd460aefa37f89f7ddb91"}],"concept.mesh.d026688":[{"id":"assertion.concept.mesh.d026688","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioethical Issues as described in the captured NLM MeSH descriptor D026688","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioethical Issues as: Clusters of topics that fall within the domain of BIOETHICS , the field of study concerned with value questions that arise in biomedicine and health care delivery.","support":[{"end":793,"quote":"Clusters of topics that fall within the domain of\nBIOETHICS\n, the field of study concerned with value questions that arise in biomedicine and health care delivery.","source_id":"nlm-mesh.d026688","source_sha256":"47bbd7acc5d4655f6aa7c7df44c30f831954052df63d07ad25fbac60ee90e492","start":630}],"target_id":"concept.mesh.d026688","target_kind":"node","target_sha256":"1400a89a8ab80fa643d133d7dcacaf6475a6ff33563385c9532672bf7c391361"}],"concept.mesh.d026689":[{"id":"assertion.concept.mesh.d026689","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Analysis as described in the captured NLM MeSH descriptor D026689","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Analysis as: The use of systematic methods of ethical examination, such as CASUISTRY or ETHICAL THEORY , in reasoning about moral problems.","support":[{"end":494,"quote":"The use of systematic methods of ethical examination, such as\nCASUISTRY\nor\nETHICAL THEORY\n, in reasoning about moral problems.","source_id":"nlm-mesh.d026689","source_sha256":"68aa1c16b6ea21514eb08a2c32ada3a92bbbf79ada578e2435368bf9d732f85f","start":368}],"target_id":"concept.mesh.d026689","target_kind":"node","target_sha256":"3d2dc8606402351f412648cc7b561e73ca52f595db5dbf834a10ed21cdedd6e8"}],"concept.mesh.d026712":[{"id":"assertion.concept.mesh.d026712","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Value of Life as described in the captured NLM MeSH descriptor D026712","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Value of Life as: The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","support":[{"end":512,"quote":"The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026712","source_sha256":"2cbf0e198ba735bfbef49897fb03338854e23d191d4e3baa8bb6ef3ea6dac920","start":437}],"target_id":"concept.mesh.d026712","target_kind":"node","target_sha256":"f87c6eeecd8373331a5c3de8cc3bc92938540c06e42e7a0e83757df1fb0d68eb"}],"concept.mesh.d026724":[{"id":"assertion.concept.mesh.d026724","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Review as described in the captured NLM MeSH descriptor D026724","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Review as: A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee ( CLINICAL ETHICS COMMITTEES or RESEARCH ETHICS COMMITTEES ), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist ( ETHICISTS ).","support":[{"end":721,"quote":"A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee (\nCLINICAL ETHICS COMMITTEES\nor\nRESEARCH ETHICS COMMITTEES\n), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist (\nETHICISTS\n).","source_id":"nlm-mesh.d026724","source_sha256":"930532554990107e04c0da2c8f2ced4b302f6dba636f61379806ea4fe03fa982","start":364}],"target_id":"concept.mesh.d026724","target_kind":"node","target_sha256":"0f417eb5021eb6f7c3e2edbbd4ec5f4ffa6ab90681445f759482c0807e4370d9"}],"concept.mesh.d028661":[{"id":"assertion.concept.mesh.d028661","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Complicity as described in the captured NLM MeSH descriptor D028661","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Complicity as: Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","support":[{"end":577,"quote":"Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","source_id":"nlm-mesh.d028661","source_sha256":"14354e1f6319fa78a2bf7b8de8dc7630181d6e461fd3b99148f1383e1f6dfe11","start":356}],"target_id":"concept.mesh.d028661","target_kind":"node","target_sha256":"6562c1bbff44a793ed0902dca3280fd2bddaf9c63c910e93591593104c52a8fd"}],"concept.mesh.d028663":[{"id":"assertion.concept.mesh.d028663","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Theory as described in the captured NLM MeSH descriptor D028663","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Theory as: A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","support":[{"end":602,"quote":"A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","source_id":"nlm-mesh.d028663","source_sha256":"cfd266c3c9a74bfb797ae10c828765be7b7accd8904e4df677802d4ad875204c","start":364}],"target_id":"concept.mesh.d028663","target_kind":"node","target_sha256":"457d576923e5414fdda292288a4b61c3f606c84440a13ebb176783383cf00d00"}],"concept.mesh.d028681":[{"id":"assertion.concept.mesh.d028681","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Obligations as described in the captured NLM MeSH descriptor D028681","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Obligations as: Duties that are based in ETHICS , rather than in law.","support":[{"end":431,"quote":"Duties that are based in\nETHICS\n, rather than in law.","source_id":"nlm-mesh.d028681","source_sha256":"1c9efff1ad8b2842fbc37e293945d1966c71b66d9e7f53a98511619275b60c00","start":378}],"target_id":"concept.mesh.d028681","target_kind":"node","target_sha256":"049e1c7876ab9eab4c89fa0b9de524e11d6738bea296bf8afee6e5f24e145f7c"}],"concept.mesh.d028683":[{"id":"assertion.concept.mesh.d028683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"National Socialism as described in the captured NLM MeSH descriptor D028683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes National Socialism as: The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","support":[{"end":708,"quote":"The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","source_id":"nlm-mesh.d028683","source_sha256":"e7066c54a9f107b45bc0e8515f5b247e5263ae82d2862048b9f8aceda15a36b6","start":376}],"target_id":"concept.mesh.d028683","target_kind":"node","target_sha256":"7f4c3c1ccdde25c5820629b4d810f149448a2bc9dfa1863122265d6c6f318050"}],"concept.mesh.d028722":[{"id":"assertion.concept.mesh.d028722","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Virtues as described in the captured NLM MeSH descriptor D028722","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Virtues as: Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","support":[{"end":499,"quote":"Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","source_id":"nlm-mesh.d028722","source_sha256":"1818fe2f99454fe1663d8feafec056a211aff607c56f10cfb1ce28a563f1e369","start":413}],"target_id":"concept.mesh.d028722","target_kind":"node","target_sha256":"1fd2a65482e0e4bff938e70257f12bc90e7222206870ca9b5555d6b780879770"}],"concept.mesh.d028723":[{"id":"assertion.concept.mesh.d028723","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Personhood as described in the captured NLM MeSH descriptor D028723","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Personhood as: The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","support":[{"end":727,"quote":"The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","source_id":"nlm-mesh.d028723","source_sha256":"b6f43f20dbb4d0b69d754b774928d2d97a440990de36109d4fdd36207c7fc4e2","start":401}],"target_id":"concept.mesh.d028723","target_kind":"node","target_sha256":"22c069ba94003de38a940dcc7adcc85b5771d9571e4ea41d7671fe3b54b0fbd9"}],"concept.mesh.d028781":[{"id":"assertion.concept.mesh.d028781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethical Relativism as described in the captured NLM MeSH descriptor D028781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethical Relativism as: The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","support":[{"end":578,"quote":"The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","source_id":"nlm-mesh.d028781","source_sha256":"7479553a5b84fe45c5e9302e06904765e2642468e21e8232d0e035e339736d83","start":372}],"target_id":"concept.mesh.d028781","target_kind":"node","target_sha256":"26937f88457f6619e82e5c5075434d657a445a5737dbf46a3781dac81ed542b4"}],"concept.mesh.d029181":[{"id":"assertion.concept.mesh.d029181","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Spirituality as described in the captured NLM MeSH descriptor D029181","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Spirituality as: Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","support":[{"end":569,"quote":"Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","source_id":"nlm-mesh.d029181","source_sha256":"f8704726c11d17cc20c55b2bb90304539ad1be9c192a3fba15192122f1fb4917","start":356}],"target_id":"concept.mesh.d029181","target_kind":"node","target_sha256":"86bed22eb2e4b2608b76a1692ea28aef433953afff1d6215315abc8017790160"}],"concept.mesh.d030141":[{"id":"assertion.concept.mesh.d030141","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Feedback, Psychological as described in the captured NLM MeSH descriptor D030141","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Feedback, Psychological as: A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","support":[{"end":611,"quote":"A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","source_id":"nlm-mesh.d030141","source_sha256":"f514264f8c05ba6236ca4209d821474d99419ae8e53d579b642d643fa6b21e1f","start":427}],"target_id":"concept.mesh.d030141","target_kind":"node","target_sha256":"4fabef827b73389bc279109269f39b1b9ccb39a4bde7d6fb7928ec6330cd6a03"}],"concept.mesh.d030861":[{"id":"assertion.concept.mesh.d030861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Capitalism as described in the captured NLM MeSH descriptor D030861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Capitalism as: A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":664,"quote":"A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d030861","source_sha256":"bc8e78c6a8d2486b02f0bcc981909f03d0688ba7f38a2445613fb07a5a609500","start":372}],"target_id":"concept.mesh.d030861","target_kind":"node","target_sha256":"4f87fd2ab2d41c9d66623e81feb6c61d157ff5b43831e565e22579f2c8821888"}],"concept.mesh.d031261":[{"id":"assertion.concept.mesh.d031261","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Poult Enteritis Mortality Syndrome as described in the captured NLM MeSH descriptor D031261","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Poult Enteritis Mortality Syndrome as: An acute, transmissible, infectious disease associated with high MORTALITY and MORBIDITY in young turkeys (poults). It is characterized by DIARRHEA ; ANOREXIA ; growth depression, and immune dysfunction. The cause is unknown but astroviruses ( AVASTROVIRUS ) and coronaviruses ( CORONAVIRUS, TURKEY ) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","support":[{"end":867,"quote":"An acute, transmissible, infectious disease associated with high\nMORTALITY\nand\nMORBIDITY\nin young turkeys (poults). It is characterized by\nDIARRHEA\n;\nANOREXIA\n; growth depression, and immune dysfunction. The cause is unknown but astroviruses (\nAVASTROVIRUS\n) and coronaviruses (\nCORONAVIRUS, TURKEY\n) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","source_id":"nlm-mesh.d031261","source_sha256":"71fa45054dddda22d1089e3b5c57f7e5c44967db683a1bb99b1ac3c6d4ef15c3","start":434}],"target_id":"concept.mesh.d031261","target_kind":"node","target_sha256":"1679be129bfbc2ad8dd90ef68ea875bc1902aa0a2a01de8f0ae56f7d23dff5e9"}],"concept.mesh.d032764":[{"id":"assertion.concept.mesh.d032764","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Casuistry as described in the captured NLM MeSH descriptor D032764","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Casuistry as: A method of ETHICAL ANALYSIS that emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","support":[{"end":766,"quote":"A method of\nETHICAL ANALYSIS\nthat emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","source_id":"nlm-mesh.d032764","source_sha256":"851e4d693c5c0f2d6ed52366b109861e1c7a688d1c4c0e52ede74e60c63f8a5b","start":470}],"target_id":"concept.mesh.d032764","target_kind":"node","target_sha256":"5b8f9206cee43d66a553e7c2b3b8563b6e3c5697cde631b346d8cffd3e207433"}],"concept.mesh.d032903":[{"id":"assertion.concept.mesh.d032903","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Confucianism as described in the captured NLM MeSH descriptor D032903","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Confucianism as: A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","support":[{"end":539,"quote":"A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","source_id":"nlm-mesh.d032903","source_sha256":"c16063ff0946eae36732154b587c3e1b72d0adeec813936d3f459b298b222346","start":344}],"target_id":"concept.mesh.d032903","target_kind":"node","target_sha256":"0ef3ad703a99154f13bab603835b0dac2f340ef8694276e4091543eeb2abc4a7"}],"concept.mesh.d033003":[{"id":"assertion.concept.mesh.d033003","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eastern Orthodoxy as described in the captured NLM MeSH descriptor D033003","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eastern Orthodoxy as: The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","support":[{"end":738,"quote":"The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","source_id":"nlm-mesh.d033003","source_sha256":"dd328af64bd01cc2e7290e1d895c2897a049b4d1335fb07c8806d44e2e02635d","start":391}],"target_id":"concept.mesh.d033003","target_kind":"node","target_sha256":"1d4f917682423aa69e8403bc9841c2182605b78af19f8e57b656a9302d5a035e"}],"concept.mesh.d033041":[{"id":"assertion.concept.mesh.d033041","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Embryo Research as described in the captured NLM MeSH descriptor D033041","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Embryo Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","support":[{"end":1006,"quote":"Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","source_id":"nlm-mesh.d033041","source_sha256":"80b5cf1857c906d8cfa0d0e394a76ee6cf1a70d21138ad849ee4a9a768cbed27","start":656}],"target_id":"concept.mesh.d033041","target_kind":"node","target_sha256":"902f306e2a408b63f71817b4e47de49f3ba3655caa45fd0168ef22ed890e6866"}],"concept.mesh.d033042":[{"id":"assertion.concept.mesh.d033042","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Fetal Research as described in the captured NLM MeSH descriptor D033042","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Fetal Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","support":[{"end":848,"quote":"Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","source_id":"nlm-mesh.d033042","source_sha256":"4df239fa54984e17b9152d3de3a77bea262c5bffdcc408efe5dd04ee8998570f","start":583}],"target_id":"concept.mesh.d033042","target_kind":"node","target_sha256":"2bf2f096f7230bef18d087a5714629b85bdf1e89d6dec4768bc67130f91f20d9"}],"concept.mesh.d033061":[{"id":"assertion.concept.mesh.d033061","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics Consultation as described in the captured NLM MeSH descriptor D033061","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics Consultation as: Services provided by an individual ethicist ( ETHICISTS ) or an ethics team or committee ( ETHICS COMMITTEES, CLINICAL ) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","support":[{"end":730,"quote":"Services provided by an individual ethicist (\nETHICISTS\n) or an ethics team or committee (\nETHICS COMMITTEES, CLINICAL\n) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","source_id":"nlm-mesh.d033061","source_sha256":"7712d942ad6b58dbc195b325e82906aa0f419f3051acf68199ee5c7aa5fde6b8","start":402}],"target_id":"concept.mesh.d033061","target_kind":"node","target_sha256":"be8bf5994eb9a610617c5e3b524d8bb2e43e9df0e38b384d9ce6addc7ad9845d"}],"concept.mesh.d033302":[{"id":"assertion.concept.mesh.d033302","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Postmodernism as described in the captured NLM MeSH descriptor D033302","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Postmodernism as: A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","support":[{"end":649,"quote":"A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","source_id":"nlm-mesh.d033302","source_sha256":"637a3c42153147857a1431a4d4647905ba7c74376393b609d4ff5860b992e0e0","start":342}],"target_id":"concept.mesh.d033302","target_kind":"node","target_sha256":"ecc8739cf52a89cb9fdb7e5cc3157370528cfb12caecee9315cd58b4eaf2e17e"}],"concept.mesh.d033303":[{"id":"assertion.concept.mesh.d033303","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Protestantism as described in the captured NLM MeSH descriptor D033303","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","support":[{"end":683,"quote":"The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","source_id":"nlm-mesh.d033303","source_sha256":"4ac7f6dee1b1b33f93ddd38809d3c1e7e5a519d73c1f02fa9c83faefcacf3a48","start":383}],"target_id":"concept.mesh.d033303","target_kind":"node","target_sha256":"a907391e30262814b883f9802c00e0a1bbef59a904f0fe57011a66cf4f78570b"}],"concept.mesh.d033421":[{"id":"assertion.concept.mesh.d033421","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Beginning of Human Life as described in the captured NLM MeSH descriptor D033421","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Beginning of Human Life as: The point at which religious ensoulment or PERSONHOOD is considered to begin.","support":[{"end":583,"quote":"The point at which religious ensoulment or\nPERSONHOOD\nis considered to begin.","source_id":"nlm-mesh.d033421","source_sha256":"27a3e3d33d623e35d301be9dd597af07d3d345213b7c241ad6aa2ff6ddfd1760","start":506}],"target_id":"concept.mesh.d033421","target_kind":"node","target_sha256":"b0069f7c9718d635e0b47c6b870018a71353b6b0f8f9ebffd123aee8db677fa4"}],"concept.mesh.d034161":[{"id":"assertion.concept.mesh.d034161","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pelvic Infection as described in the captured NLM MeSH descriptor D034161","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pelvic Infection as: Infection involving the tissues or organs in the PELVIS .","support":[{"end":401,"quote":"Infection involving the tissues or organs in the\nPELVIS\n.","source_id":"nlm-mesh.d034161","source_sha256":"345d721c853be7a307686d5f0dda4b6a25bfbcd0043146cab32d9b7b2b0960ef","start":344}],"target_id":"concept.mesh.d034161","target_kind":"node","target_sha256":"59af46e49691a87b124d35d153ee615939ed219c0fcb702d0ae219fb94167e74"}],"concept.mesh.d034682":[{"id":"assertion.concept.mesh.d034682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Church of Jesus Christ of Latter-day Saints as described in the captured NLM MeSH descriptor D034682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Church of Jesus Christ of Latter-day Saints as: A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":625,"quote":"A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d034682","source_sha256":"e0021447e8c18ffa6c5d389ac56c0be70cf3a675b593a5aa88def69914a3246d","start":442}],"target_id":"concept.mesh.d034682","target_kind":"node","target_sha256":"7943e8c377dd7e0ce7282a40da61a0ad6f2e6ad2fc5165c6c9bd379e31003d5f"}],"concept.mesh.d034723":[{"id":"assertion.concept.mesh.d034723","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Double Effect Principle as described in the captured NLM MeSH descriptor D034723","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Double Effect Principle as: Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","support":[{"end":983,"quote":"Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","source_id":"nlm-mesh.d034723","source_sha256":"d2a73efe3527ec161aed8d9f3136b546360178d0b67a4dc33307e8f63728106c","start":442}],"target_id":"concept.mesh.d034723","target_kind":"node","target_sha256":"2a5b438e3ad82e6e78a96d2a2fd871de3b7ba4e32fb1ac7251e50079e02bb7aa"}],"concept.mesh.d035061":[{"id":"assertion.concept.mesh.d035061","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Control Groups as described in the captured NLM MeSH descriptor D035061","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Control Groups as: Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","support":[{"end":688,"quote":"Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","source_id":"nlm-mesh.d035061","source_sha256":"d5f9c728b7433742ce2348704ab9b1102136a7297bc8093f215ea4c973990447","start":496}],"target_id":"concept.mesh.d035061","target_kind":"node","target_sha256":"a7a7011bd3a8c6dbc843e9d5ad60cd25166a97a4704a106e3b3c717f27bb1058"}],"concept.mesh.d035082":[{"id":"assertion.concept.mesh.d035082","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Federal Government as described in the captured NLM MeSH descriptor D035082","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Federal Government as: The level of governmental organization and function at the national or country-wide level.","support":[{"end":671,"quote":"The level of governmental organization and function at the national or country-wide level.","source_id":"nlm-mesh.d035082","source_sha256":"9fb7622abf6b3ef1cdfb2741ca470226a5edad88df24e44680f50307437c5328","start":581}],"target_id":"concept.mesh.d035082","target_kind":"node","target_sha256":"34cdbcb8bccef85db26636ccf8c6ba48e9aaf6463bb1d5feb759f1dd44c0febe"}],"concept.mesh.d035481":[{"id":"assertion.concept.mesh.d035481","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Retrospective Moral Judgment as described in the captured NLM MeSH descriptor D035481","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Retrospective Moral Judgment as: The application of current standards of morality to past actions, institutions, or persons.","support":[{"end":491,"quote":"The application of current standards of morality to past actions, institutions, or persons.","source_id":"nlm-mesh.d035481","source_sha256":"6b1e6ed429bef2c8feafd155a7072ee0af136e1ab44100a15ff10eb0d2dbb4d5","start":400}],"target_id":"concept.mesh.d035481","target_kind":"node","target_sha256":"3ab24f72c99e76246a40c0f2c053b7bde765aab8dea61ff8ff99d2e4ab6e7faf"}],"concept.mesh.d035501":[{"id":"assertion.concept.mesh.d035501","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Uncertainty as described in the captured NLM MeSH descriptor D035501","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Uncertainty as: The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","support":[{"end":528,"quote":"The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","source_id":"nlm-mesh.d035501","source_sha256":"8f21d54e679e684215a78034e13a7687693244940afa0128a5f3f2c9e506796c","start":426}],"target_id":"concept.mesh.d035501","target_kind":"node","target_sha256":"7165feb6cac475a2bfbae4b1f0b99b47bd4d9a32fe44a4e27e4f89e37c09c576"}],"concept.mesh.d035621":[{"id":"assertion.concept.mesh.d035621","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Secularism as described in the captured NLM MeSH descriptor D035621","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Secularism as: Indifference to, or rejection of, RELIGION or religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":475,"quote":"Indifference to, or rejection of,\nRELIGION\nor religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d035621","source_sha256":"2c2681b2e28ae6677a8641f8335b9a847da52852b3cac57fc36299af5ea460b0","start":348}],"target_id":"concept.mesh.d035621","target_kind":"node","target_sha256":"2842bf619835ad7f3d9f77deb73e85efd55dae3ea8d7d1db308b30733c727c31"}],"concept.mesh.d035761":[{"id":"assertion.concept.mesh.d035761","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wedge Argument as described in the captured NLM MeSH descriptor D035761","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wedge Argument as: An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","support":[{"end":568,"quote":"An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","source_id":"nlm-mesh.d035761","source_sha256":"8e50e02711130f52bc563a75e8b596dcf969cd2f0c87ac58a893adb466066f21","start":372}],"target_id":"concept.mesh.d035761","target_kind":"node","target_sha256":"3d2d672ec72dc4cc7c7a010583a85e4473738e925547d577885546acc1538b8c"}],"concept.mesh.d035841":[{"id":"assertion.concept.mesh.d035841","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Research as described in the captured NLM MeSH descriptor D035841","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Research as: Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","support":[{"end":758,"quote":"Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","source_id":"nlm-mesh.d035841","source_sha256":"830fab033b47f1496e63029516cf309d51854f7f89ce3006ec79a0c1ebed1dcb","start":530}],"target_id":"concept.mesh.d035841","target_kind":"node","target_sha256":"96911b507744886d40fbdafde4a6ec1b0ac1856d90f1e7c5ba84dd3e71b6518a"}],"concept.mesh.d035843":[{"id":"assertion.concept.mesh.d035843","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Research as described in the captured NLM MeSH descriptor D035843","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Research as: Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","support":[{"end":618,"quote":"Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","source_id":"nlm-mesh.d035843","source_sha256":"7b6ed351ccf66ccf1b44bcc8b34d0542a4b280a16504e833558a1f403de6a52e","start":507}],"target_id":"concept.mesh.d035843","target_kind":"node","target_sha256":"4ae1559d08aac800960c344eefdc376cd02128e535fdd3cf08f64f2cf735943a"}],"concept.mesh.d035863":[{"id":"assertion.concept.mesh.d035863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Moral Development as described in the captured NLM MeSH descriptor D035863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Moral Development as: The process by which individuals internalize standards of right and wrong conduct.","support":[{"end":468,"quote":"The process by which individuals internalize standards of right and wrong conduct.","source_id":"nlm-mesh.d035863","source_sha256":"fbacab836ea15256c637b3b41f3aad13afa93b41fe91f2710357cf10f9bb0ec7","start":386}],"target_id":"concept.mesh.d035863","target_kind":"node","target_sha256":"4a5f6be860838a1a193c14dad71fbd92184b9147d6af626fd20205a6266c7d30"}],"concept.mesh.d036262":[{"id":"assertion.concept.mesh.d036262","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Empirical Research as described in the captured NLM MeSH descriptor D036262","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Empirical Research as: The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","support":[{"end":527,"quote":"The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","source_id":"nlm-mesh.d036262","source_sha256":"915e1149322183f83a4adce604de8ad80cfd64ff2562ae867d29af70e4fa22a2","start":356}],"target_id":"concept.mesh.d036262","target_kind":"node","target_sha256":"87da95153ffa501bbfcb2517c59395ec70b56116fafeb404b32e43d1dbe11133"}],"concept.mesh.d036281":[{"id":"assertion.concept.mesh.d036281","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetic Research as described in the captured NLM MeSH descriptor D036281","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetic Research as: Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","support":[{"end":640,"quote":"Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","source_id":"nlm-mesh.d036281","source_sha256":"5b2b9475b3727768f877e624e8446ed5f7e94ebe1e86145f783e97cce98b1eee","start":525}],"target_id":"concept.mesh.d036281","target_kind":"node","target_sha256":"6b58e4d3693b097b4aca32b5ab5d7e25e833fc1d171ce1ea1f6f2f7bc368d9f2"}],"concept.mesh.d036301":[{"id":"assertion.concept.mesh.d036301","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Qualitative Research as described in the captured NLM MeSH descriptor D036301","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Qualitative Research as: Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","support":[{"end":722,"quote":"Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","source_id":"nlm-mesh.d036301","source_sha256":"7b421b197a76ace4a77f156201e9e3366ee250c7a8cefa01067eb8d4d0183508","start":441}],"target_id":"concept.mesh.d036301","target_kind":"node","target_sha256":"632bfc282b3437159b887707b7a8f5ba0d2630e16961bcad6850ed7f9a80bcf2"}],"concept.mesh.d038622":[{"id":"assertion.concept.mesh.d038622","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Internationality as described in the captured NLM MeSH descriptor D038622","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Internationality as: The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","support":[{"end":516,"quote":"The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d038622","source_sha256":"aa2f0bf2f996830d528cd44a89544512b9f95dba5a4f7c2f85e714f94fdf2a29","start":392}],"target_id":"concept.mesh.d038622","target_kind":"node","target_sha256":"3652563c8358aeec77b4d613b8de6c6b44d6c8db4c9df9c57e81b766c6a15d0b"}],"concept.mesh.d040242":[{"id":"assertion.concept.mesh.d040242","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Risk Reduction Behavior as described in the captured NLM MeSH descriptor D040242","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Risk Reduction Behavior as: Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","support":[{"end":454,"quote":"Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","source_id":"nlm-mesh.d040242","source_sha256":"fb0692f20c68e781c208effda343158f49a323a970ba11735db88ce5cbbd2b2a","start":362}],"target_id":"concept.mesh.d040242","target_kind":"node","target_sha256":"b5d925b64be31f10310795888bb0af9c7d5bab87bc77a1cd1a96f1e1ee16b4a9"}],"concept.mesh.d040261":[{"id":"assertion.concept.mesh.d040261","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Harm Reduction as described in the captured NLM MeSH descriptor D040261","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Harm Reduction as: The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","support":[{"end":569,"quote":"The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","source_id":"nlm-mesh.d040261","source_sha256":"bb72a391f392d764f284a77e4c9f3a190c51107ce6c7263633900530f19825a0","start":344}],"target_id":"concept.mesh.d040261","target_kind":"node","target_sha256":"d143d952b7e72543fbdecad86ce25619adcb1c115fe05641b5460d068957eb91"}],"concept.mesh.d040841":[{"id":"assertion.concept.mesh.d040841","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Resource Allocation as described in the captured NLM MeSH descriptor D040841","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Resource Allocation as: Societal or individual decisions about the equitable distribution of available resources.","support":[{"end":706,"quote":"Societal or individual decisions about the equitable distribution of available resources.","source_id":"nlm-mesh.d040841","source_sha256":"67b303e5a34cb41d3ed82f6a711d5ef8cd0e88039dfed3980f3336506270e84e","start":617}],"target_id":"concept.mesh.d040841","target_kind":"node","target_sha256":"6af284026f894b5053d7498c904651ccbb74b5513107833d70d90d0b664c5ef0"}],"concept.mesh.d043762":[{"id":"assertion.concept.mesh.d043762","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Behavior as described in the captured NLM MeSH descriptor D043762","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Behavior as: Human behavior or decision related to REPRODUCTION .","support":[{"end":505,"quote":"Human behavior or decision related to\nREPRODUCTION\n.","source_id":"nlm-mesh.d043762","source_sha256":"f41b15f222d5a42832f90cdd4c1b4b8619d41064c5ab22ca9994508dad52637d","start":453}],"target_id":"concept.mesh.d043762","target_kind":"node","target_sha256":"3fae4034da8841be5f43c0dea366f5f6fe576da3933129d99e737a849db4d4b4"}],"concept.mesh.d050997":[{"id":"assertion.concept.mesh.d050997","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nanomedicine as described in the captured NLM MeSH descriptor D050997","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nanomedicine as: The branch of medicine concerned with the application of NANOTECHNOLOGY to the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and NANOSTRUCTURES . (From Freitas Jr., Nanomedicine, vol 1, 1999).","support":[{"end":706,"quote":"The branch of medicine concerned with the application of\nNANOTECHNOLOGY\nto the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and\nNANOSTRUCTURES\n. (From Freitas Jr., Nanomedicine, vol 1, 1999).","source_id":"nlm-mesh.d050997","source_sha256":"6288ac23452940f959f42e46247ed94c56846784f390f47863fd4fac3d5b0b2d","start":380}],"target_id":"concept.mesh.d050997","target_kind":"node","target_sha256":"34fc18e11e7732ad8793604ea1be0e40336dbec8774ceb1c2e50d08cc2d04e44"}],"concept.mesh.d052156":[{"id":"assertion.concept.mesh.d052156","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"SELEX Aptamer Technique as described in the captured NLM MeSH descriptor D052156","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes SELEX Aptamer Technique as: A method of generating a large library of randomized nucleotides and selecting NUCLEOTIDE APTAMERS by iterative rounds of in vitro selection. A modified procedure substitutes AMINO ACIDS in place of NUCLEOTIDES to make PEPTIDE APTAMERS .","support":[{"end":627,"quote":"A method of generating a large library of randomized nucleotides and selecting\nNUCLEOTIDE APTAMERS\nby iterative rounds of in vitro selection. A modified procedure substitutes\nAMINO ACIDS\nin place of\nNUCLEOTIDES\nto make\nPEPTIDE APTAMERS\n.","source_id":"nlm-mesh.d052156","source_sha256":"e1c3629376c470492ab028f332d979e12678bde0a2aa0301e07e9b50a691a270","start":390}],"target_id":"concept.mesh.d052156","target_kind":"node","target_sha256":"4d09f04e0f5cf9b76e3314fe4bc0048d6a5f755356e33a9d635dce30c5a7f1b5"}],"concept.mesh.d053604":[{"id":"assertion.concept.mesh.d053604","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Nursing as described in the captured NLM MeSH descriptor D053604","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Nursing as: The application of NURSING knowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","support":[{"end":690,"quote":"The application of\nNURSING\nknowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","source_id":"nlm-mesh.d053604","source_sha256":"5205806f5b70726d2459b6962f778da3cb62162b3d51481b3e77e4e78bea99d1","start":368}],"target_id":"concept.mesh.d053604","target_kind":"node","target_sha256":"0cc2ebbf4814f0269f36e50fb00ff02797d2fef9cffb80552b0a41172673a723"}],"concept.mesh.d053821":[{"id":"assertion.concept.mesh.d053821","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiovascular Infections as described in the captured NLM MeSH descriptor D053821","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiovascular Infections as: Pathological conditions of the CARDIOVASCULAR SYSTEM caused by infections.","support":[{"end":444,"quote":"Pathological conditions of the\nCARDIOVASCULAR SYSTEM\ncaused by infections.","source_id":"nlm-mesh.d053821","source_sha256":"20e2d3f7ce5dda96708f0a8b2fde49889cfc9e7260dd05758e4c09e7d2958f62","start":370}],"target_id":"concept.mesh.d053821","target_kind":"node","target_sha256":"e6660be17683d306ad0185b7f895f563c1590b2be7744d759a2d825d9bde64d9"}],"concept.mesh.d054802":[{"id":"assertion.concept.mesh.d054802","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Imprinting as described in the captured NLM MeSH descriptor D054802","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Imprinting as: A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for MOLECULARLY IMPRINTED POLYMERS (MIPs) include separations, assays and biosensors, and catalysis.","support":[{"end":661,"quote":"A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for\nMOLECULARLY IMPRINTED POLYMERS\n(MIPs) include separations, assays and biosensors, and catalysis.","source_id":"nlm-mesh.d054802","source_sha256":"308a7e7145eb060fbc49645f499a32ef5cc5d6f00936c48a1e9ba34f74b78d2b","start":426}],"target_id":"concept.mesh.d054802","target_kind":"node","target_sha256":"f238c0d704a62f74ee67da19b7a707ad4f7503a419dbacb3f57237d26134bd39"}],"concept.mesh.d055499":[{"id":"assertion.concept.mesh.d055499","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catheter-Related Infections as described in the captured NLM MeSH descriptor D055499","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catheter-Related Infections as: Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","support":[{"end":630,"quote":"Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","source_id":"nlm-mesh.d055499","source_sha256":"74996f300e4255dac46227013887a48ef83626afe0251e08f4e869459f41b7dc","start":422}],"target_id":"concept.mesh.d055499","target_kind":"node","target_sha256":"92262db3c4525d034c7d42c3c45102030a50a7189dfd84232353dde02795b8a1"}],"concept.mesh.d055809":[{"id":"assertion.concept.mesh.d055809","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Illness Behavior as described in the captured NLM MeSH descriptor D055809","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Illness Behavior as: Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of APPETITE or LIBIDO ; disinterest in ACTIVITIES OF DAILY LIVING ; or withdrawal from social interaction.","support":[{"end":557,"quote":"Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of\nAPPETITE\nor\nLIBIDO\n; disinterest in\nACTIVITIES OF DAILY LIVING\n; or withdrawal from social interaction.","source_id":"nlm-mesh.d055809","source_sha256":"cce52566df70fd819984b9d30a2404668fe2881cbcc41024d200ee82d802f1f6","start":348}],"target_id":"concept.mesh.d055809","target_kind":"node","target_sha256":"96b82581f81e00e71028ee250ca98657e129abed3569964c3031d7a2d1a67422"}],"concept.mesh.d055812":[{"id":"assertion.concept.mesh.d055812","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community-Based Participatory Research as described in the captured NLM MeSH descriptor D055812","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community-Based Participatory Research as: Collaborative process of research involving researchers and community representatives.","support":[{"end":494,"quote":"Collaborative process of research involving researchers and community representatives.","source_id":"nlm-mesh.d055812","source_sha256":"1fde2dcd5f99decbbf986e11e5043774373c705a1052b4fd553b2db8c303e423","start":408}],"target_id":"concept.mesh.d055812","target_kind":"node","target_sha256":"23e1c4afd86ebdb70926a00e4841d685a98957808089dc0a62ce57176783057e"}],"concept.mesh.d055990":[{"id":"assertion.concept.mesh.d055990","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Therapeutic Misconception as described in the captured NLM MeSH descriptor D055990","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Therapeutic Misconception as: Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","support":[{"end":549,"quote":"Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","source_id":"nlm-mesh.d055990","source_sha256":"b2cecc7ecf504b37a2cb2e6f62f82505a8fdb092cb7c4fe77e3fb15c5dbedc7a","start":418}],"target_id":"concept.mesh.d055990","target_kind":"node","target_sha256":"d8f24aa5fa1f57412a103f3b046cb2073c9589bcb8fcff98313697a73b66ccb5"}],"concept.mesh.d056146":[{"id":"assertion.concept.mesh.d056146","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Corpse Dismemberment as described in the captured NLM MeSH descriptor D056146","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Corpse Dismemberment as: Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","support":[{"end":481,"quote":"Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","source_id":"nlm-mesh.d056146","source_sha256":"b5dc679bbc22a0065cc826ad646437a555e89d2b51957d1a3842c20c24b03775","start":392}],"target_id":"concept.mesh.d056146","target_kind":"node","target_sha256":"3d71f6007b95ffcceeadfbce974a8eef19198b218a493df904f2d862c067d396"}],"concept.mesh.d057005":[{"id":"assertion.concept.mesh.d057005","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioengineering as described in the captured NLM MeSH descriptor D057005","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioengineering as: The application of engineering principles and methods to living organisms or biological systems.","support":[{"end":440,"quote":"The application of engineering principles and methods to living organisms or biological systems.","source_id":"nlm-mesh.d057005","source_sha256":"9586fb5c76f0201a43428100f36d49e7b7acd223dc943b344eafa92c81980093","start":344}],"target_id":"concept.mesh.d057005","target_kind":"node","target_sha256":"16e29b6a272900b60c2db3a02d92214895e8dde53f485ce470a5ac591d4af514"}],"concept.mesh.d057170":[{"id":"assertion.concept.mesh.d057170","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Translational Research, Biomedical as described in the captured NLM MeSH descriptor D057170","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Translational Research, Biomedical as: The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","support":[{"end":911,"quote":"The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","source_id":"nlm-mesh.d057170","source_sha256":"7aee00095c41121fddeefa87199f1dfc1b4fd0126e7e7580d99c9697dc9e7b83","start":640}],"target_id":"concept.mesh.d057170","target_kind":"node","target_sha256":"ce2719b6c8cbc9a434a8512ef0e65dccfa151c5acf86655611c9f599c592f14c"}],"concept.mesh.d057172":[{"id":"assertion.concept.mesh.d057172","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Economic Recession as described in the captured NLM MeSH descriptor D057172","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Economic Recession as: Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","support":[{"end":666,"quote":"Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","source_id":"nlm-mesh.d057172","source_sha256":"d3ef7facb98ccac75cbf66a9d498ce02e1be650a5b8b6925fef0cd5af185bec5","start":352}],"target_id":"concept.mesh.d057172","target_kind":"node","target_sha256":"69d57199d0afd19fd88b642d0af328f0c12f5edd71fb3e33368827237dfc27cb"}],"concept.mesh.d057185":[{"id":"assertion.concept.mesh.d057185","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sedentary Behavior as described in the captured NLM MeSH descriptor D057185","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .","support":[{"end":490,"quote":"Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining\nPOSTURE\n.","source_id":"nlm-mesh.d057185","source_sha256":"42cec1fe2a9ceb2d945eb0172f29c6736205cb41efc376983cd9b97ce542bc30","start":368}],"target_id":"concept.mesh.d057185","target_kind":"node","target_sha256":"9ced8dd29a679e4a4436397a2e0cf2754375c6f9f344ace2a8ba75cd5e82c427"}],"concept.mesh.d057205":[{"id":"assertion.concept.mesh.d057205","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Automation, Laboratory as described in the captured NLM MeSH descriptor D057205","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Automation, Laboratory as: Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","support":[{"end":478,"quote":"Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","source_id":"nlm-mesh.d057205","source_sha256":"fdc951b67c4505f8a8a6ac3c388c323ad2e6347d734f80abada9c1bbcc5566bb","start":372}],"target_id":"concept.mesh.d057205","target_kind":"node","target_sha256":"c63924906acfd7f6a5c4318bf031794319ad70b135df06ae055c760e2ee339a2"}],"concept.mesh.d057212":[{"id":"assertion.concept.mesh.d057212","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Therapeutic Equipoise as described in the captured NLM MeSH descriptor D057212","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Therapeutic Equipoise as: Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","support":[{"end":574,"quote":"Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","source_id":"nlm-mesh.d057212","source_sha256":"4034f20b13a175f5d6a6f4d96bb1682e2b53c7285111be6858ff19cdd667a163","start":442}],"target_id":"concept.mesh.d057212","target_kind":"node","target_sha256":"63158da077b2e4ebc11e6450a90e29fba118107075ca4b81531db4c6448eff35"}],"concept.mesh.d057217":[{"id":"assertion.concept.mesh.d057217","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Economic Development as described in the captured NLM MeSH descriptor D057217","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","support":[{"end":476,"quote":"Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","source_id":"nlm-mesh.d057217","source_sha256":"9b6fb627a341835e2179776ea66113dffffffaa02cbbb20d0e04983765b58493","start":368}],"target_id":"concept.mesh.d057217","target_kind":"node","target_sha256":"62dd83afb192ec283277368a72f1faded4585ed8032a664704b1f9a78d266ee9"}],"concept.mesh.d057226":[{"id":"assertion.concept.mesh.d057226","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Information Seeking Behavior as described in the captured NLM MeSH descriptor D057226","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Information Seeking Behavior as: How information is gathered in personal, academic or work environments and the resources used.","support":[{"end":494,"quote":"How information is gathered in personal, academic or work environments and the resources used.","source_id":"nlm-mesh.d057226","source_sha256":"c7f6b948ff307b308d12ca1eb787b4a9ff7b0f1b4cb26c989816e056ee265fb3","start":400}],"target_id":"concept.mesh.d057226","target_kind":"node","target_sha256":"7c6001a87eae675b8ec224ce16eb13f643deb567ff689ef623556cdee10aa6fb"}],"concept.mesh.d057565":[{"id":"assertion.concept.mesh.d057565","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Apathy as described in the captured NLM MeSH descriptor D057565","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Apathy as: Lack of emotion or emotional expression; a disorder of motivation that persists over time.","support":[{"end":418,"quote":"Lack of emotion or emotional expression; a disorder of motivation that persists over time.","source_id":"nlm-mesh.d057565","source_sha256":"76442309a705faeb91c13771d0c337238c6d2547724501c689d8a2e08bcf154a","start":328}],"target_id":"concept.mesh.d057565","target_kind":"node","target_sha256":"474ab7a7337aa1ca17e6906ca23b044be7ae0bbcc3938e1570875e7f33717527"}],"concept.mesh.d057766":[{"id":"assertion.concept.mesh.d057766","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Policy as described in the captured NLM MeSH descriptor D057766","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Policy as: A course or method of action selected to guide and determine present and future decisions.","support":[{"end":422,"quote":"A course or method of action selected to guide and determine present and future decisions.","source_id":"nlm-mesh.d057766","source_sha256":"7ab457527ebc956ab3fe52ccbcde23e58b663b5091983ebcec8df7ae30814a7c","start":332}],"target_id":"concept.mesh.d057766","target_kind":"node","target_sha256":"429f951ffa1ffc86dcce4d83bd40e84b815eddf57f4b1d9ba61548da4da0b1b7"}],"concept.mesh.d057905":[{"id":"assertion.concept.mesh.d057905","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stem Cell Research as described in the captured NLM MeSH descriptor D057905","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stem Cell Research as: Experimentation on STEM CELLS and on the use of stem cells.","support":[{"end":756,"quote":"Experimentation on\nSTEM CELLS\nand on the use of stem cells.","source_id":"nlm-mesh.d057905","source_sha256":"30c3db80bfd4e10dcbc516dd673a7297ef8baef0e3a7857eee1927f9c8470948","start":697}],"target_id":"concept.mesh.d057905","target_kind":"node","target_sha256":"815b89d8a73f59d77bfed511519a3226def45c648a47aa9f0808dd25f03a37e6"}],"concept.mesh.d057930":[{"id":"assertion.concept.mesh.d057930","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Click Chemistry as described in the captured NLM MeSH descriptor D057930","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Click Chemistry as: Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with COMBINATORIAL CHEMISTRY TECHNIQUES , it is used for the synthesis of new compounds and combinatorial libraries.","support":[{"end":752,"quote":"Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with\nCOMBINATORIAL CHEMISTRY TECHNIQUES\n, it is used for the synthesis of new compounds and combinatorial libraries.","source_id":"nlm-mesh.d057930","source_sha256":"0bfc9c628743f6f309230e234effdde6b4089137c824c39c4aa574598db068cc","start":366}],"target_id":"concept.mesh.d057930","target_kind":"node","target_sha256":"ed3d3e525ffbb5fbd02e2bc15fb605bdc4b21dd6119ecfac5562315d7aea7a8a"}],"concept.mesh.d058011":[{"id":"assertion.concept.mesh.d058011","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Multifactor Dimensionality Reduction as described in the captured NLM MeSH descriptor D058011","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Multifactor Dimensionality Reduction as: A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","support":[{"end":645,"quote":"A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","source_id":"nlm-mesh.d058011","source_sha256":"624fab765d28ac4ae773a210a7718baa57eab54ad7c9fb584f65b06aae9bb834","start":528}],"target_id":"concept.mesh.d058011","target_kind":"node","target_sha256":"a82c4be910c6fef170b5234a8e2f63d2b125df3d6de8c5b418562d7ca6b1ab02"}],"concept.mesh.d058028":[{"id":"assertion.concept.mesh.d058028","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Research Report as described in the captured NLM MeSH descriptor D058028","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Research Report as: Detailed account or statement or formal record of data resulting from empirical inquiry.","support":[{"end":458,"quote":"Detailed account or statement or formal record of data resulting from empirical inquiry.","source_id":"nlm-mesh.d058028","source_sha256":"aa1663feb71cfa097bba910d98371bf959599434df8b0aaeba68aeb6787d87c1","start":370}],"target_id":"concept.mesh.d058028","target_kind":"node","target_sha256":"753648ae5ba0a08016c07061cb3707b7e86982d08dd8b72705c9b69f96f7e2ac"}],"concept.mesh.d058345":[{"id":"assertion.concept.mesh.d058345","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Asymptomatic Infections as described in the captured NLM MeSH descriptor D058345","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Asymptomatic Infections as: Infections that do not exhibit symptoms.","support":[{"end":418,"quote":"Infections that do not exhibit symptoms.","source_id":"nlm-mesh.d058345","source_sha256":"ce736e3b612873b9a0558deece81b7041823381c7c6070a3ceff098ae837b94a","start":378}],"target_id":"concept.mesh.d058345","target_kind":"node","target_sha256":"9d1d8063e69bc13e741cc938d07dfbbfda99efeb4cb19d9b09ea25f8dee7f432"}],"concept.mesh.d058433":[{"id":"assertion.concept.mesh.d058433","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Photobioreactors as described in the captured NLM MeSH descriptor D058433","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Photobioreactors as: Devices for generating biological products that use light as the energy source. They are used for controlled BIOMASS production such as growing cyanobacteria, mosses, or algae.","support":[{"end":544,"quote":"Devices for generating biological products that use light as the energy source. They are used for controlled\nBIOMASS\nproduction such as growing cyanobacteria, mosses, or algae.","source_id":"nlm-mesh.d058433","source_sha256":"3a0728642cfc7f765d43dc278c38426174bb8dd92e1f994edf28e9598fcb6394","start":368}],"target_id":"concept.mesh.d058433","target_kind":"node","target_sha256":"763327dd48a37fc2b1163976915acae0cf0bd5b9f69191789d8f91e855268687"}],"concept.mesh.d058443":[{"id":"assertion.concept.mesh.d058443","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Catastrophization as described in the captured NLM MeSH descriptor D058443","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Catastrophization as: Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","support":[{"end":518,"quote":"Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","source_id":"nlm-mesh.d058443","source_sha256":"3a8782bde7dcea59603eda5b8f02c34b85c1cc33f77f3a12c36856a9c75c1951","start":366}],"target_id":"concept.mesh.d058443","target_kind":"node","target_sha256":"686285577fe75bd8e9ddcbf18835f2fa29c62b61aa17ce9b9acee68d9937a767"}],"concept.mesh.d058634":[{"id":"assertion.concept.mesh.d058634","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Farming as described in the captured NLM MeSH descriptor D058634","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Farming as: The large scale production of pharmaceutically important and commercially valuable RECOMBINANT PROTEINS .","support":[{"end":459,"quote":"The large scale production of pharmaceutically important and commercially valuable\nRECOMBINANT PROTEINS\n.","source_id":"nlm-mesh.d058634","source_sha256":"aac5d8c31a45c31da3900250400ae7484534c60f78563a2d9be35bc53c521930","start":354}],"target_id":"concept.mesh.d058634","target_kind":"node","target_sha256":"fbf331d7986b2c8f377e61277dfe2a9b4956e44e908e63fc0f8bf8bfbab58566"}],"concept.mesh.d058996":[{"id":"assertion.concept.mesh.d058996","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Quality Improvement as described in the captured NLM MeSH descriptor D058996","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Quality Improvement as: The attainment or process of attaining a new level of performance or quality.","support":[{"end":443,"quote":"The attainment or process of attaining a new level of performance or quality.","source_id":"nlm-mesh.d058996","source_sha256":"57e40c804193ee3e05875ab1a9a7ffb7431f2f607bea9c78419d20d9a9faff87","start":366}],"target_id":"concept.mesh.d058996","target_kind":"node","target_sha256":"8c819a56dab2f6f880f10f9227d4bbcf034ba65c0ef5d25f3700601f4e340799"}],"concept.mesh.d058999":[{"id":"assertion.concept.mesh.d058999","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drug-Seeking Behavior as described in the captured NLM MeSH descriptor D058999","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drug-Seeking Behavior as: Activities performed to obtain licit or illicit substances.","support":[{"end":417,"quote":"Activities performed to obtain licit or illicit substances.","source_id":"nlm-mesh.d058999","source_sha256":"ab622ccf91f3e9027977ebdd49683ed1c574858b008538f8361f4584c2674f6e","start":358}],"target_id":"concept.mesh.d058999","target_kind":"node","target_sha256":"0b911d47107bd479771e754adbe023d01bc73f60442d3f2585976bb6cd51de36"}],"concept.mesh.d059021":[{"id":"assertion.concept.mesh.d059021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Laboratory Proficiency Testing as described in the captured NLM MeSH descriptor D059021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Laboratory Proficiency Testing as: Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","support":[{"end":617,"quote":"Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","source_id":"nlm-mesh.d059021","source_sha256":"50edae871bc4792e0b885fe9f11c01d8a2985e5aae06767892bbc47f76fcd072","start":396}],"target_id":"concept.mesh.d059021","target_kind":"node","target_sha256":"fa2c65275122de8eeaf137add8b490056f4900d9ad36e0412ecd2f2442cd9e5e"}],"concept.mesh.d059066":[{"id":"assertion.concept.mesh.d059066","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Gross Domestic Product as described in the captured NLM MeSH descriptor D059066","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Gross Domestic Product as: Value of all final goods and services produced in a country in one year.","support":[{"end":432,"quote":"Value of all final goods and services produced in a country in one year.","source_id":"nlm-mesh.d059066","source_sha256":"f177c166e2e218837f3490875b7cd0b1f55dc260e186965ba2e6254249a0b491","start":360}],"target_id":"concept.mesh.d059066","target_kind":"node","target_sha256":"40887628ca31654b8fda1561d76a5bf3881bff8357a4b755c6672e2822c2f135"}],"concept.mesh.d059413":[{"id":"assertion.concept.mesh.d059413","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Intraabdominal Infections as described in the captured NLM MeSH descriptor D059413","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Intraabdominal Infections as: Infection within the PERITONEAL CAVITY. A frequent cause is an ANASTOMOTIC LEAK following surgery.","support":[{"end":460,"quote":"Infection within the PERITONEAL CAVITY. A frequent cause is an\nANASTOMOTIC LEAK\nfollowing surgery.","source_id":"nlm-mesh.d059413","source_sha256":"c36195d41eb58adbc102086a127ae11b4d2faca68acbcbdfdf509ff569a97f5d","start":362}],"target_id":"concept.mesh.d059413","target_kind":"node","target_sha256":"f9bd5e378a5c77e4ac7137206aea26e14b14948e162b03cf7d77ec2f62c24fd4"}],"concept.mesh.d060085":[{"id":"assertion.concept.mesh.d060085","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Coinfection as described in the captured NLM MeSH descriptor D060085","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Coinfection as: Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","support":[{"end":579,"quote":"Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","source_id":"nlm-mesh.d060085","source_sha256":"e248efca59d043e58e790c52f3694fb818fa33896af64ec028faf46b8eba35f0","start":394}],"target_id":"concept.mesh.d060085","target_kind":"node","target_sha256":"b9ce43d78390e838a0841651671f34c62b96134f59b9a023e1574445a7a496af"}],"concept.mesh.d060326":[{"id":"assertion.concept.mesh.d060326","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Chemistry Techniques, Synthetic as described in the captured NLM MeSH descriptor D060326","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Chemistry Techniques, Synthetic as: Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","support":[{"end":547,"quote":"Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","source_id":"nlm-mesh.d060326","source_sha256":"611ffdfcc6dd513ccd58de28ff4693a956092bfd0be9103b2524178d94b4994d","start":390}],"target_id":"concept.mesh.d060326","target_kind":"node","target_sha256":"4b400aeea0a754609ef021c27d1d54336604312350d9a444edc6139754ff6a9b"}],"concept.mesh.d060327":[{"id":"assertion.concept.mesh.d060327","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Solid-Phase Synthesis Techniques as described in the captured NLM MeSH descriptor D060327","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Solid-Phase Synthesis Techniques as: Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","support":[{"end":862,"quote":"Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","source_id":"nlm-mesh.d060327","source_sha256":"e35efa241c1894a1573dcfa34584abcaa691c22398720d13ec2b01402d894115","start":400}],"target_id":"concept.mesh.d060327","target_kind":"node","target_sha256":"eda28f3072d16d4a9cc45d01f80aa14be801988c6ae68318848be95b13cdd3fc"}],"concept.mesh.d060388":[{"id":"assertion.concept.mesh.d060388","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Support Vector Machine as described in the captured NLM MeSH descriptor D060388","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Support Vector Machine as: SUPERVISED MACHINE LEARNING algorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","support":[{"end":837,"quote":"SUPERVISED MACHINE LEARNING\nalgorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","source_id":"nlm-mesh.d060388","source_sha256":"384a44a89012aeb36ab4907066c5a39eadad3a895ac9506898b427499e20b7fe","start":400}],"target_id":"concept.mesh.d060388","target_kind":"node","target_sha256":"c60743c0f94fa225b949134ea5de867e23e77813bfac9b3614216cc30ad76874"}],"concept.mesh.d060685":[{"id":"assertion.concept.mesh.d060685","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sense of Coherence as described in the captured NLM MeSH descriptor D060685","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sense of Coherence as: A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","support":[{"end":558,"quote":"A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","source_id":"nlm-mesh.d060685","source_sha256":"20b602a1a99de407036ea20e4c5e9ea359b5d5ea731838319e198967e4068ee1","start":372}],"target_id":"concept.mesh.d060685","target_kind":"node","target_sha256":"fd5c6917680e0b5465d4e670c8440e2d38e64d6dcd6fe11584395d8030c2e81f"}],"concept.mesh.d060737":[{"id":"assertion.concept.mesh.d060737","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Tract Infections as described in the captured NLM MeSH descriptor D060737","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Tract Infections as: Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","support":[{"end":571,"quote":"Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","source_id":"nlm-mesh.d060737","source_sha256":"0f9febb8583d0158969561554b941c172a8467bf84454eef5135e416cb807e90","start":438}],"target_id":"concept.mesh.d060737","target_kind":"node","target_sha256":"1433ca455ecb92b270094fe5f17b4b339a0fe1b8e83837c1248c403c0aa600f7"}],"concept.mesh.d060845":[{"id":"assertion.concept.mesh.d060845","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hoarding as described in the captured NLM MeSH descriptor D060845","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hoarding as: A persistent difficulty discarding or parting with possessions.","support":[{"end":443,"quote":"A persistent difficulty discarding or parting with possessions.","source_id":"nlm-mesh.d060845","source_sha256":"b6a1db8b02d024309fa877414618c7e1a46cdc63bed382f37ce9d38df5a44691","start":380}],"target_id":"concept.mesh.d060845","target_kind":"node","target_sha256":"dc7d09618db73fb6920cf39ad2ef15c1bc34c339e9d4749fc70be3a338213278"}],"concept.mesh.d060846":[{"id":"assertion.concept.mesh.d060846","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cell Engineering as described in the captured NLM MeSH descriptor D060846","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cell Engineering as: Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules ( METABOLIC ENGINEERING ), for generation of tissue structures and organs in vitro ( TISSUE ENGINEERING ), or for other BIOENGINEERING research objectives.","support":[{"end":659,"quote":"Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules (\nMETABOLIC ENGINEERING\n), for generation of tissue structures and organs in vitro (\nTISSUE ENGINEERING\n), or for other\nBIOENGINEERING\nresearch objectives.","source_id":"nlm-mesh.d060846","source_sha256":"1890961c09afac5a9dbcea681c808f745ccaf82dc0730d410efdc5775e198274","start":368}],"target_id":"concept.mesh.d060846","target_kind":"node","target_sha256":"f644344d6c20729aec0ab9e95faf235af30ac3a600ab86dfd957a20c6d0ce5bb"}],"concept.mesh.d060847":[{"id":"assertion.concept.mesh.d060847","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metabolic Engineering as described in the captured NLM MeSH descriptor D060847","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metabolic Engineering as: Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as BIOREACTORS .","support":[{"end":548,"quote":"Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as\nBIOREACTORS\n.","source_id":"nlm-mesh.d060847","source_sha256":"da7b7d55470f345c2a01e06fb3cb8f2d0e8c5f4f4fd284af7638810e6cf58869","start":402}],"target_id":"concept.mesh.d060847","target_kind":"node","target_sha256":"15c3ba29bb03b9c9def9a49f61aa515af763e4a4e0011158c93b2f69ee443bc2"}],"concept.mesh.d060986":[{"id":"assertion.concept.mesh.d060986","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Water Wells as described in the captured NLM MeSH descriptor D060986","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Water Wells as: Constructions built to access underground water.","support":[{"end":394,"quote":"Constructions built to access underground water.","source_id":"nlm-mesh.d060986","source_sha256":"eb48bb1b40a54ffde7d954d0a8c77733277708e5f2b11f9629b1718efe82744a","start":346}],"target_id":"concept.mesh.d060986","target_kind":"node","target_sha256":"45773a977f0eaaf574933999d591d95f2490d14caa428bcfa64efa6f2ed12531"}],"concept.mesh.d061148":[{"id":"assertion.concept.mesh.d061148","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hygiene Hypothesis as described in the captured NLM MeSH descriptor D061148","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hygiene Hypothesis as: The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and AUTOIMMUNE DISEASES .","support":[{"end":622,"quote":"The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and\nAUTOIMMUNE DISEASES\n.","source_id":"nlm-mesh.d061148","source_sha256":"ee5009f947681a341958560011ae533e174a55832f4a96069304fc0c9d06599f","start":356}],"target_id":"concept.mesh.d061148","target_kind":"node","target_sha256":"c9d2f1cfb48d4a7662a625342aa5bee76846f641ae7d538f2a5c6f3baa286a63"}],"concept.mesh.d061565":[{"id":"assertion.concept.mesh.d061565","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cycloaddition Reaction as described in the captured NLM MeSH descriptor D061565","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cycloaddition Reaction as: Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","support":[{"end":483,"quote":"Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","source_id":"nlm-mesh.d061565","source_sha256":"3939fcfeff1dcc9c9efde032b24853f3a7e024c040cebf42b49096bdea9b0148","start":380}],"target_id":"concept.mesh.d061565","target_kind":"node","target_sha256":"d2145f4e328f815508c6cf78209f1b1db8614d30744446d043a154f13678c291"}],"concept.mesh.d062028":[{"id":"assertion.concept.mesh.d062028","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioprinting as described in the captured NLM MeSH descriptor D062028","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioprinting as: A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as MICROCHIP ANALYTICAL DEVICES , cell microarrays, or three dimensional anatomical structures.","support":[{"end":592,"quote":"A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as\nMICROCHIP ANALYTICAL DEVICES\n, cell microarrays, or three dimensional anatomical structures.","source_id":"nlm-mesh.d062028","source_sha256":"261b4818872957d7f03826299e171eca370e2096cc72124033de62c565b30e18","start":350}],"target_id":"concept.mesh.d062028","target_kind":"node","target_sha256":"93cdf2b44a0685110002daa8d27d6eaf719bdfdde2e53cce58caf5917f942906"}],"concept.mesh.d062069":[{"id":"assertion.concept.mesh.d062069","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Inventions as described in the captured NLM MeSH descriptor D062069","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Inventions as: A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","support":[{"end":446,"quote":"A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","source_id":"nlm-mesh.d062069","source_sha256":"1f098e1380f8bfa6a115162cd5a3fbaeb2be23b53f08fdfe807b999fae117aab","start":336}],"target_id":"concept.mesh.d062069","target_kind":"node","target_sha256":"e090b68698c48be98b9c52f1d4d45d60d0b280070441af22d0384ae0a560c4ac"}],"concept.mesh.d063369":[{"id":"assertion.concept.mesh.d063369","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Knowledge Discovery as described in the captured NLM MeSH descriptor D063369","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Knowledge Discovery as: A process that searches for hidden and important connections among information or results.","support":[{"end":476,"quote":"A process that searches for hidden and important connections among information or results.","source_id":"nlm-mesh.d063369","source_sha256":"e20869b03a4365f66e076a8fab5ecd6a0e602deabc1bf89da31e62f4c5261df2","start":386}],"target_id":"concept.mesh.d063369","target_kind":"node","target_sha256":"0ee94f74c9a92f6fe8dccb77ebce8ce4b51e1bf8bb428dd71118ef23c832f297"}],"concept.mesh.d063426":[{"id":"assertion.concept.mesh.d063426","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Migration as described in the captured NLM MeSH descriptor D063426","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Migration as: Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","support":[{"end":589,"quote":"Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","source_id":"nlm-mesh.d063426","source_sha256":"e3bb99fd0e6504611b9cec9cde8125bf895d784fe91f35d8b18822652a416a8b","start":487}],"target_id":"concept.mesh.d063426","target_kind":"node","target_sha256":"d4490da199b72582f5486dc69b475b6b6e90cfa6bea8e42bf4442435d7f023dd"}],"concept.mesh.d063586":[{"id":"assertion.concept.mesh.d063586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Validity, Research as described in the captured NLM MeSH descriptor D063586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Validity, Research as: Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","support":[{"end":681,"quote":"Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","source_id":"nlm-mesh.d063586","source_sha256":"58ccb071ffdfcf795719c9a30725f9bdcb8a7e922167c8461ab77fb1f7bc76de","start":370}],"target_id":"concept.mesh.d063586","target_kind":"node","target_sha256":"a1cbfa5c158c036dae4e3d1350fe3a74d100ecf29c79aadba6ab057c7fa52761"}],"concept.mesh.d064226":[{"id":"assertion.concept.mesh.d064226","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Prescription Drug Diversion as described in the captured NLM MeSH descriptor D064226","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Prescription Drug Diversion as: The transfer of prescription drugs from legal to illegal distribution and marketing networks.","support":[{"end":487,"quote":"The transfer of prescription drugs from legal to illegal distribution and marketing networks.","source_id":"nlm-mesh.d064226","source_sha256":"883829aeae2d80ba1a0215ed4d183615e0cee49865f8a2b994029941a3b52360","start":394}],"target_id":"concept.mesh.d064226","target_kind":"node","target_sha256":"8dcaa4119b5c80f874b9e5bc9d84ff2cd085ea35db069add6c246c0bd617a50d"}],"concept.mesh.d064423":[{"id":"assertion.concept.mesh.d064423","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Drug Trafficking as described in the captured NLM MeSH descriptor D064423","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Drug Trafficking as: The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","support":[{"end":496,"quote":"The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","source_id":"nlm-mesh.d064423","source_sha256":"583e0b93838adcb6278ef3c8da429bb8c2905994a3728467cd4ead24e2104cd4","start":372}],"target_id":"concept.mesh.d064423","target_kind":"node","target_sha256":"f204928b333adcb096e909369d60071e80fa8ec0680bedb282def7c510a76eb5"}],"concept.mesh.d064424":[{"id":"assertion.concept.mesh.d064424","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tobacco Use as described in the captured NLM MeSH descriptor D064424","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tobacco Use as: Use of TOBACCO (Nicotiana tabacum L) and TOBACCO PRODUCTS .","support":[{"end":397,"quote":"Use of TOBACCO (Nicotiana tabacum L) and\nTOBACCO PRODUCTS\n.","source_id":"nlm-mesh.d064424","source_sha256":"b5322b7ba694c34aeb578ca055557ca3c84188d7594bd086b4d0def79a5888c4","start":338}],"target_id":"concept.mesh.d064424","target_kind":"node","target_sha256":"181562b18c1b879b5266511b106e68d24dc42ea60c3c3ccc4718f63c4e14a859"}],"concept.mesh.d064890":[{"id":"assertion.concept.mesh.d064890","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Determinants of Health as described in the captured NLM MeSH descriptor D064890","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Determinants of Health as: The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","support":[{"end":685,"quote":"The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","source_id":"nlm-mesh.d064890","source_sha256":"c62b8869ad2d927c371222d27c809f778da0ebb6c0830de2cad101057a480d9d","start":406}],"target_id":"concept.mesh.d064890","target_kind":"node","target_sha256":"47fc7ae65b7217c026c3abb154be5698ea1dbdc1ced9bcd6f0e5b8d08697db92"}],"concept.mesh.d065287":[{"id":"assertion.concept.mesh.d065287","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Robotic Surgical Procedures as described in the captured NLM MeSH descriptor D065287","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Robotic Surgical Procedures as: Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","support":[{"end":554,"quote":"Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","source_id":"nlm-mesh.d065287","source_sha256":"4ed57db9abd5ea896549d29cfc7ff078be4570a004da661905620af44669779b","start":390}],"target_id":"concept.mesh.d065287","target_kind":"node","target_sha256":"e3ab824793545262230281062f9b9acb7c1846cca6857fae283ae5d041228f0c"}],"concept.mesh.d065840":[{"id":"assertion.concept.mesh.d065840","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Protective Factors as described in the captured NLM MeSH descriptor D065840","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Protective Factors as: An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","support":[{"end":803,"quote":"An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","source_id":"nlm-mesh.d065840","source_sha256":"a0aece48dcca712330cf98953734c478aa2c10762ce115fe45dc068ef387b89e","start":530}],"target_id":"concept.mesh.d065840","target_kind":"node","target_sha256":"5d94bf8d0759034c3527e9032852419c2a1a7bd70c07774d94d540e309551595"}],"concept.mesh.d066279":[{"id":"assertion.concept.mesh.d066279","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Courage as described in the captured NLM MeSH descriptor D066279","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Courage as: State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","support":[{"end":431,"quote":"State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","source_id":"nlm-mesh.d066279","source_sha256":"69eaed1f42d6fe72449457b2063a01fc0e1d38287145230981703bbad56e12a3","start":330}],"target_id":"concept.mesh.d066279","target_kind":"node","target_sha256":"b428a5d01f58ffef1e1dd500c8af076df9bf38590143f9753b3a13b4ab655cae"}],"concept.mesh.d066288":[{"id":"assertion.concept.mesh.d066288","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Romanticism as described in the captured NLM MeSH descriptor D066288","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Romanticism as: The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","support":[{"end":562,"quote":"The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","source_id":"nlm-mesh.d066288","source_sha256":"e1f693005d19dd361e29e346eee1e2e5b3bd96a694c32a2fa5c7ed2756253806","start":334}],"target_id":"concept.mesh.d066288","target_kind":"node","target_sha256":"ed2486b1c1ee2652b086262a7e89c8b6dacc3bbaa9fc1580b9086e270fe04afa"}],"concept.mesh.d066296":[{"id":"assertion.concept.mesh.d066296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Grounded Theory as described in the captured NLM MeSH descriptor D066296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Grounded Theory as: The generation of theories from analysis of empirical data.","support":[{"end":413,"quote":"The generation of theories from analysis of empirical data.","source_id":"nlm-mesh.d066296","source_sha256":"762fe19cf00bb44ee67bca3293742c90edd9828ea67485e448e40809f9a87249","start":354}],"target_id":"concept.mesh.d066296","target_kind":"node","target_sha256":"ef9602057f97e83659531c1c90fe7c2af168d82bdcb5e8666019736bfdcbd4f9"}],"concept.mesh.d066330":[{"id":"assertion.concept.mesh.d066330","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Printing, Three-Dimensional as described in the captured NLM MeSH descriptor D066330","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Printing, Three-Dimensional as: Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","support":[{"end":576,"quote":"Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","source_id":"nlm-mesh.d066330","source_sha256":"2dfcd70d769eb1a037bf33765da81d6280f50e5792f990c0e2608fb5620f03b6","start":410}],"target_id":"concept.mesh.d066330","target_kind":"node","target_sha256":"1f5f20707b75bb39443d5cc1dd19ea3fbdc51bcdb728bfe44a8671b07ba94111"}],"concept.nist.absolute":[{"id":"assertion.concept.nist.absolute","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines absolute performance guarantee as: An approximation algorithm will return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","support":[{"end":210,"quote":"An\napproximation algorithm\nwill return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","source_id":"nist-dads.absolute","source_sha256":"c58462d56f7ee57ff0d385e769989a80620dc4ae18d6c57617a553fbe78e436d","start":87}],"target_id":"concept.nist.absolute","target_kind":"node","target_sha256":"b533b70c80f5847b612623fbe821f9e87303ddb34c8e40ec2f037d763281cd22"}],"concept.nist.abstractdatatype":[{"id":"assertion.concept.nist.abstractdatatype","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines abstract data type as: A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT.","support":[{"end":203,"quote":"A set of data values and associated operations that are precisely specified independent of any particular implementation.\nAlso known as\nADT.","source_id":"nist-dads.abstractdatatype","source_sha256":"960b51c9c3e01e940cc5262ffa7e4c1826f99b0d94e377b0ed88a78a13ee0ee0","start":63}],"target_id":"concept.nist.abstractdatatype","target_kind":"node","target_sha256":"2a542e714b616e5502a8360817f98f700cb43782eef570c3ca146e4483b9273d"}],"concept.nist.abtree":[{"id":"assertion.concept.nist.abtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines (a,b)-tree as: A search tree with the restrictions that all leaves are at the same depth and all internal nodes have between a and b children , where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root may have as few as 2 children.","support":[{"end":276,"quote":"A\nsearch tree\nwith the restrictions that all\nleaves\nare at the same\ndepth\nand all\ninternal nodes\nhave between a and b\nchildren\n, where a and b are integers such that  2 ≤ a ≤ (b+1)/2.   The\nroot\nmay have as few as 2 children.","source_id":"nist-dads.abtree","source_sha256":"c7e1a0b1bbd03846acb7d6dfb3623a4bb8ec61a0ca0b24504ba612f9d724a5df","start":51}],"target_id":"concept.nist.abtree","target_kind":"node","target_sha256":"210f56cab769d7919edac7ee502386f6c2a6f8162cdd2ef8c21ed5e7e088b44c"}],"concept.nist.acceptingstt":[{"id":"assertion.concept.nist.acceptingstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines accepting state as: If a finite state machine finishes an input string and is in an accepting state , the string is accepted or considered to be valid.","support":[{"end":188,"quote":"If a\nfinite state machine\nfinishes an input string and is in an accepting\nstate\n, the string is accepted or considered to be valid.","source_id":"nist-dads.acceptingstt","source_sha256":"4c493f187d5cc2ffffa03f8b8b734e7134a9f880fb153511093857ce641f3ca7","start":57}],"target_id":"concept.nist.acceptingstt","target_kind":"node","target_sha256":"708af0a9efb4bb5218a0204085e7bfd7ed5bef5e980e91670d9b95d35d8b989b"}],"concept.nist.activedatastruc":[{"id":"assertion.concept.nist.activedatastruc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines active data structure as: A data structure with an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure. Also known as functional data structure.","support":[{"end":281,"quote":"A\ndata structure\nwith an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure.\nAlso known as\nfunctional data structure.","source_id":"nist-dads.activedatastruc","source_sha256":"daa502751b752a06e5465359794e44a24f6fbc760f1875ec2d30f56b78980f7b","start":73}],"target_id":"concept.nist.activedatastruc","target_kind":"node","target_sha256":"8f06f5ae8c7d5d7b5d4d634fdb47dc66c37550c7f762465d510f5e3fea13240c"}],"concept.nist.acyclicgraph":[{"id":"assertion.concept.nist.acyclicgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines acyclic graph as: A graph with no path that starts and ends at the same vertex .","support":[{"end":115,"quote":"A\ngraph\nwith no\npath\nthat starts and ends at the same\nvertex\n.","source_id":"nist-dads.acyclicgraph","source_sha256":"a2b836ec3e806883c9c3bd75cc9b58cadfc1ec90a01e23862a933d3141c4c869","start":53}],"target_id":"concept.nist.acyclicgraph","target_kind":"node","target_sha256":"89ab8142fe45ad01d3e3bf4526611f886e072acf7a421efd6f0f5d3ea594d3f3"}],"concept.nist.adaptivesort":[{"id":"assertion.concept.nist.adaptivesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive sort as: A sorting algorithm that can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","support":[{"end":226,"quote":"A\nsorting algorithm\nthat can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","source_id":"nist-dads.adaptivesort","source_sha256":"b63b6ce0bf5fa2012320b132231a0769ee0cb681091d41b85379422f8385fd75","start":53}],"target_id":"concept.nist.adaptivesort","target_kind":"node","target_sha256":"d7e184ca268a95eb1e324c9cc815446064f9f0dd7c39d7c97819157840662474"}],"concept.nist.adaptkdtree":[{"id":"assertion.concept.nist.adaptkdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive k-d tree as: A tree for multidimensional points where successive levels may be split along different dimensions.","support":[{"end":164,"quote":"A\ntree\nfor multidimensional points where successive levels may be split along different dimensions.","source_id":"nist-dads.adaptkdtree","source_sha256":"ea1d115780aaf076c84a7215b94fcc3e54e308c969c7c4b6396d9ca05bae62a2","start":65}],"target_id":"concept.nist.adaptkdtree","target_kind":"node","target_sha256":"a42bded3f438f5e818c4659f20a78594cce845e6f10f86c9c42136e04c5c7de9"}],"concept.nist.adjacencylistrep":[{"id":"assertion.concept.nist.adjacencylistrep","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adjacency-list representation as: A representation of a directed graph with n vertices using an array of n lists of vertices. List i contains vertex j if there is an edge from vertex i to vertex j. A weighted graph may be represented with a list of vertex/weight pairs. An undirected graph may be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","support":[{"end":449,"quote":"A representation of a\ndirected graph\nwith n\nvertices\nusing an\narray\nof n\nlists\nof vertices.  List i contains vertex j if there is an\nedge\nfrom vertex i to vertex j.  A\nweighted graph\nmay be represented with a list of vertex/weight pairs.  An\nundirected graph\nmay be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","source_id":"nist-dads.adjacencylistrep","source_sha256":"004313f778e86d1590c7a75cf20ea3abf444231948307687cc68a93f13c32c47","start":89}],"target_id":"concept.nist.adjacencylistrep","target_kind":"node","target_sha256":"180b904afbecb0b44c7c9d459b8abb98e12bb83ae241b36f43544536c399b1a2"}],"concept.nist.adjacent":[{"id":"assertion.concept.nist.adjacent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adjacent as: Two vertices of a graph are adjacent if there is an edge between them. Two edges of a graph are adjacent if they connect the same vertex.","support":[{"end":181,"quote":"Two\nvertices\nof a\ngraph\nare adjacent if there is an\nedge\nbetween them.  Two\nedges\nof a graph are adjacent if they connect the same vertex.","source_id":"nist-dads.adjacent","source_sha256":"ce75b66ee12881f2cf1993603ef5aeb7ed39ba6595e34465f7ad9f1b43baf792","start":43}],"target_id":"concept.nist.adjacent","target_kind":"node","target_sha256":"9ef48e088bb22c1709c15ad0c32d7b640e789a15a4762d42a530ea44368ba594"}],"concept.nist.adversary":[{"id":"assertion.concept.nist.adversary","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adversary as: A theoretical agent that uses information about the past moves of an on-line algorithm to choose inputs that force the worst-case cost of the algorithm.","support":[{"end":197,"quote":"A theoretical agent that uses information about the past moves of an\non-line algorithm\nto choose inputs that force the\nworst-case cost\nof the algorithm.","source_id":"nist-dads.adversary","source_sha256":"31df449b8519ac4d5600eabcf3cb96d7c50760ce3b13fc5be1619a98ad42bc96","start":45}],"target_id":"concept.nist.adversary","target_kind":"node","target_sha256":"3135bc8b5e6cdf3c69d2ec692f0556cd3b797b0691bf0cc058243c73be424650"}],"concept.nist.algorithm":[{"id":"assertion.concept.nist.algorithm","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines algorithm as: A computable set of steps to achieve a desired result.","support":[{"end":99,"quote":"A computable set of steps to achieve a desired result.","source_id":"nist-dads.algorithm","source_sha256":"e6601ea9aeb187c5995724ea3805c998d6acbe21ad2ac76b812af396f2f72727","start":45}],"target_id":"concept.nist.algorithm","target_kind":"node","target_sha256":"4e4fcce64da262a0d9801f7c3b9426a60faa711f350a170413c0db14b92efc80"}],"concept.nist.allpairsshortestpath":[{"id":"assertion.concept.nist.allpairsshortestpath","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines all pairs shortest path as: Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph .","support":[{"end":189,"quote":"Find the weight (or length) of the\nshortest paths\nbetween all pairs of\nvertices\nin a\nweighted, directed graph\n.","source_id":"nist-dads.allpairsshortestpath","source_sha256":"d3af414d844118a52915b9ad3b83906bb70e59b49ed9cba73a0a874f49e1138a","start":78}],"target_id":"concept.nist.allpairsshortestpath","target_kind":"node","target_sha256":"c07b3c8d7d5848b939ff960c9aa794273edad39f7257b87caed66e305c743806"}],"concept.nist.allsimplepaths":[{"id":"assertion.concept.nist.allsimplepaths","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines all simple paths as: Find all simple paths from a starting vertex ( source ) to a destination vertex ( sink ) in a directed graph . In an undirected graph , find all simple paths between two vertices.","support":[{"end":244,"quote":"Find all\nsimple paths\nfrom a starting\nvertex\n(\nsource\n) to a destination vertex (\nsink\n) in a\ndirected graph\n.  In an\nundirected graph\n, find all simple paths between two vertices.","source_id":"nist-dads.allsimplepaths","source_sha256":"f17e34da07fa69cded3fce078057f3e1280936d4706bb2d52f622f35e23855ea","start":64}],"target_id":"concept.nist.allsimplepaths","target_kind":"node","target_sha256":"e10e0e01f8f331c83ef3c89ee442316506389d3059233ba069ffb8c302f32c4d"}],"concept.nist.alphabet":[{"id":"assertion.concept.nist.alphabet","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alphabet as: The set of all possible symbols in an application. For instance, input characters used by a finite state machine , letters making up strings in a language , or symbols in a pattern element . In some cases, an alphabet may be infinite.","support":[{"end":278,"quote":"The set of all possible symbols in an application.  For instance, input characters used by a\nfinite state machine\n, letters making up strings in a\nlanguage\n, or symbols in a\npattern element\n. In some cases, an alphabet may be infinite.","source_id":"nist-dads.alphabet","source_sha256":"46fb84897c911d25475b0b86d7613a3cc3d4a309b14f07fe2faf7606db394d26","start":43}],"target_id":"concept.nist.alphabet","target_kind":"node","target_sha256":"6ec9de81d261cd4ba2385138a8eaafe021d0cadbe36dfa75b16384425b11e261"}],"concept.nist.alternation":[{"id":"assertion.concept.nist.alternation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternation as: A model of computation proposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR. The definition of accepting computation is adjusted accordingly.","support":[{"end":237,"quote":"A\nmodel of computation\nproposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR.  The definition of accepting computation is adjusted accordingly.","source_id":"nist-dads.alternation","source_sha256":"ee444cc474348712d777f010fd927cf32b5d55feb5762e89ffc874eb972d10c4","start":49}],"target_id":"concept.nist.alternation","target_kind":"node","target_sha256":"a3b9d8ef97ebad57eb0f0d28838240d671103d35f8da500b88b2b6a27558f109"}],"concept.nist.alternatngtr":[{"id":"assertion.concept.nist.alternatngtr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternating Turing machine as: A nondeterministic Turing machine having universal states , from which the machine accepts only if all possible moves out of that state lead to acceptance.","support":[{"end":234,"quote":"A\nnondeterministic Turing machine\nhaving\nuniversal states\n, from which the machine accepts only if all possible moves out of that state lead to acceptance.","source_id":"nist-dads.alternatngtr","source_sha256":"d5a275ed02ac1a1ed26cb5a9f42b9bbff6caa2614fb10ba7c271b08a056f7ef2","start":79}],"target_id":"concept.nist.alternatngtr","target_kind":"node","target_sha256":"23bbea8916bc90d108bc5fc343d70fd5cbf15ee1d1555e281b0c3efee9627138"}],"concept.nist.alterntngpth":[{"id":"assertion.concept.nist.alterntngpth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines alternating path as: A path with alternating free and matched edges.","support":[{"end":106,"quote":"A\npath\nwith alternating\nfree\nand\nmatched\nedges.","source_id":"nist-dads.alterntngpth","source_sha256":"31a416d31aa1ca52796b9e99f3c0c3b5a98a5b143e4110ad70c3a9cadf83b2bc","start":59}],"target_id":"concept.nist.alterntngpth","target_kind":"node","target_sha256":"f1b3f0ec344e753b76ed5237de226cf0ec78ae4110e2ff1eb87006bc7c35347f"}],"concept.nist.amortizdcost":[{"id":"assertion.concept.nist.amortizdcost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines amortized cost as: The theoretical speed of a given set of operations. It is O(f(n)) when the execution time of the worst case of all sequences of n operations never exceeds O(n*f(n)).","support":[{"end":221,"quote":"The theoretical speed of a given set of operations.  It is\nO(f(n))\nwhen the execution time of the\nworst case\nof all sequences of\nn\noperations never exceeds O(n*f(n)).","source_id":"nist-dads.amortizdcost","source_sha256":"8c5802ed82227eecd5d3f0f6f7577c8d2e57d135f2152e517baf0838ebc57458","start":55}],"target_id":"concept.nist.amortizdcost","target_kind":"node","target_sha256":"b8c9283e1d31dd8b8b92219b63791ce8eae2698b91104ee8910a4548370065cd"}],"concept.nist.ancestor":[{"id":"assertion.concept.nist.ancestor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ancestor as: A parent of a node in a tree , the parent of the parent, etc.","support":[{"end":104,"quote":"A\nparent\nof a\nnode\nin a\ntree\n, the parent of the parent, etc.","source_id":"nist-dads.ancestor","source_sha256":"4a6497422ee3ebb8886cfa56f34502b2fcaaa7277e89f411d48a350e59d2e2ac","start":43}],"target_id":"concept.nist.ancestor","target_kind":"node","target_sha256":"ea0acf256ddd9c9977f42ddec662a2a620a3dfa3a8a3af00287fc8819175385d"}],"concept.nist.and":[{"id":"assertion.concept.nist.and","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines and as: Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","support":[{"end":97,"quote":"Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","source_id":"nist-dads.and","source_sha256":"bed8b060829f9f950b0299670aa43506b6f39011bcfddbe73cb659909d52e88c","start":33}],"target_id":"concept.nist.and","target_kind":"node","target_sha256":"646d9fe644a927d2b35a979f0a2fe87e898cf30d17f58ee254b502a03268d3a6"}],"concept.nist.ansi":[{"id":"assertion.concept.nist.ansi","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ANSI as: American National Standards Institute.","support":[{"end":73,"quote":"American National Standards Institute.","source_id":"nist-dads.ansi","source_sha256":"d1f429e2b64ef1df485ff3ee5dddb0b25d7f3de06af067db65607e5fffc37c16","start":35}],"target_id":"concept.nist.ansi","target_kind":"node","target_sha256":"9cd13698bf2b57317585a825ddb7767d3f1049238197bf24a5e1a4131e19bd46"}],"concept.nist.antichain":[{"id":"assertion.concept.nist.antichain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines antichain as: A subset of mutually incomparable elements in a poset .","support":[{"end":100,"quote":"A subset of mutually incomparable elements in a\nposet\n.","source_id":"nist-dads.antichain","source_sha256":"928977e5193bc608c21ea93e01ffb79aca419d70834f3058a95c73136cfabe4e","start":45}],"target_id":"concept.nist.antichain","target_kind":"node","target_sha256":"a3ffcdf4d18562929de16de21e80150af35229ee1c582acd87fbda3b02b9ab24"}],"concept.nist.antisymmetric":[{"id":"assertion.concept.nist.antisymmetric","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines antisymmetric as: A binary relation R for which a R b and b R a implies a = b.","support":[{"end":113,"quote":"A\nbinary relation\nR for which a R b and b R a implies a = b.","source_id":"nist-dads.antisymmetric","source_sha256":"54d9d41adb44556a698411b49eade36301ca3c9c0844bdbd298869c939ff7cd0","start":53}],"target_id":"concept.nist.antisymmetric","target_kind":"node","target_sha256":"70f13ec28fa99e38e4c4ae8d69b55d02603d2c24affc6177780554b736e888de"}],"concept.nist.arborescence":[{"id":"assertion.concept.nist.arborescence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines arborescence as: Informally, a directed tree .","support":[{"end":80,"quote":"Informally, a\ndirected\ntree\n.","source_id":"nist-dads.arborescence","source_sha256":"042ac18e97ce4951e30d80dd0138fbe7000bb810d0ab71ca606256e67c931bbf","start":51}],"target_id":"concept.nist.arborescence","target_kind":"node","target_sha256":"85e22d143b52a875619fba2abeed597f997f19e11ac102c179c7750262ffa75e"}],"concept.nist.array":[{"id":"assertion.concept.nist.array","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines array as: An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and get(i, A), where i is a numeric index, v is a value, and A is an array. The operations may be defined with axiomatic semantics as follows. new() returns an array get(i, set(i, v, A)) = v get(i, set(j, v, A)) = get(i, A) if i ≠ j Compare this with a dictionary using integers as keys. If the contents of a new array are set to some implicit initial value v i , we could add the following rule for get. get(i, new()) = v i Typically arrays have a fixed size and use either 0-based indexing or 1-based indexing . Fixed initial size and 0-based indexing may incorporated as follows. new(s) returns an array, which has a size s size(new(s)) = s size(set(i, v, A)) = size(A) get(i, set(i, v, A)) = v if 0 ≤ i < size(A) get(i, set(j, v, A)) = get(i, A) if i ≠ j One-based or other indexing may be defined similarly.","support":[{"end":1052,"quote":"An assemblage of items that are randomly accessible by integers, the index.\nFormal Definition:\nIgnoring size an array may be seen as an\nabstract data type\nwith the operations new(), set(i, v, A), and get(i, A),  where i is a numeric index, v is a value, and A is an array.  The operations may be defined with\naxiomatic semantics\nas follows.\nnew() returns an array\nget(i, set(i, v, A)) = v\nget(i, set(j, v, A)) = get(i, A) if i ≠ j\nCompare this with a\ndictionary\nusing integers as keys.\nIf the contents of a new array are set to some implicit initial value v\ni\n, we could add the following rule for get.\nget(i, new()) = v\ni\nTypically arrays have a fixed size and use either\n0-based indexing\nor\n1-based indexing\n.  Fixed initial size and 0-based indexing may incorporated as follows.\nnew(s) returns an array, which has a size s\nsize(new(s)) = s\nsize(set(i, v, A)) = size(A)\nget(i, set(i, v, A)) = v if 0 ≤ i < size(A)\nget(i, set(j, v, A)) = get(i, A) if i ≠ j\nOne-based or other indexing may be defined similarly.","source_id":"nist-dads.array","source_sha256":"69bfbed7c5701823671c2797166f8b2ca58d071f3602d59c8816b6d3bedf76c7","start":41}],"target_id":"concept.nist.array","target_kind":"node","target_sha256":"801c27b3ecf8878e563b195ce5cad0d80d0e0664b0651acc808cd232cc05353d"}],"concept.nist.arrayindex":[{"id":"assertion.concept.nist.arrayindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array index as: The location of an item in an array .","support":[{"end":86,"quote":"The location of an item in an\narray\n.","source_id":"nist-dads.arrayindex","source_sha256":"5268fbeb35d8237761632f281dcad8323e0a6b9a11db890d837b04c1c0cd35a8","start":49}],"target_id":"concept.nist.arrayindex","target_kind":"node","target_sha256":"314ae9d1022a86cdb2862ea60a9fae0a9a96222d6b366db5f6b7dd64271bfbb3"}],"concept.nist.arraysearch":[{"id":"assertion.concept.nist.arraysearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array search as: Find an element in an array . Various algorithms exist which require more or less structure in the array elements or implementation.","support":[{"end":189,"quote":"Find an element in an\narray\n.  Various algorithms exist which require more or less structure in the array elements or implementation.","source_id":"nist-dads.arraysearch","source_sha256":"c006ad182d4e5fc7ff5366bee728b220b84e4320a792197c1d21b91bd6762843","start":56}],"target_id":"concept.nist.arraysearch","target_kind":"node","target_sha256":"223487387d5adcf91c9e16b4e5c824fed764e733df0ded1187bed7c4e55c9950"}],"concept.nist.assignment":[{"id":"assertion.concept.nist.assignment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines assignment problem as: The problem of finding a maximum (or minimum) weight matching in a weighted , bipartite graph . Also known as marriage problem.","support":[{"end":195,"quote":"The problem of finding a maximum (or minimum) weight\nmatching\nin a\nweighted\n,\nbipartite graph\n.\nAlso known as\nmarriage problem.","source_id":"nist-dads.assignment","source_sha256":"ed93b8a09219cb7163ba0105cad8403b1c927c1e4318be1a694531982d2c35c6","start":68}],"target_id":"concept.nist.assignment","target_kind":"node","target_sha256":"b45f3872d0ce6f0855cd0f550e30e9cbe601886d3401401de02848ad214a146e"}],"concept.nist.assocarray":[{"id":"assertion.concept.nist.assocarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines associative array as: A collection of items that are randomly accessible by a key , often a string .","support":[{"end":143,"quote":"A collection of items that are randomly accessible by a\nkey\n, often a\nstring\n.","source_id":"nist-dads.assocarray","source_sha256":"bdc8fd0bd8b12ec0af9f792621081132a2a4d24ed48e3623dc5314ebfb376153","start":65}],"target_id":"concept.nist.assocarray","target_kind":"node","target_sha256":"ae29fa6293fa9ed9bb6578f465308f238da8092cfd2cbddb206e639b20cd530d"}],"concept.nist.associative":[{"id":"assertion.concept.nist.associative","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines associative as: A function where f(A, f(B, C)) = f(f(A, B), C).","support":[{"end":96,"quote":"A function where f(A, f(B, C)) = f(f(A, B), C).","source_id":"nist-dads.associative","source_sha256":"2382b2f945369327999e0ec28290f3d571a9f4134408d226755dab17b2b9a33a","start":49}],"target_id":"concept.nist.associative","target_kind":"node","target_sha256":"3663db5f4c01134c8c729b7ddea0b2538d3be4b1775d4f997bef9b87094c1c34"}],"concept.nist.asymptoticbound":[{"id":"assertion.concept.nist.asymptoticbound","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines asymptotic bound as: A curve representing the limit of a function. That is, the distance between a function and the curve tends to zero. The function may or may not intersect the bounding curve.","support":[{"end":234,"quote":"A curve representing the limit of a function.  That is, the distance between a function and the curve tends to zero.  The function may or may not intersect the bounding curve.","source_id":"nist-dads.asymptoticbound","source_sha256":"8ee29cf93ee35fd049c429bedced31c2f064106ef3b7f3fab74e363c81bb9650","start":59}],"target_id":"concept.nist.asymptoticbound","target_kind":"node","target_sha256":"7da18d59a724ce24c61c972fce26c708b535d013cc8c27ce68e0bc7b2420acc3"}],"concept.nist.asymptoticspacecomplexity":[{"id":"assertion.concept.nist.asymptoticspacecomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines asymptotic space complexity as: The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","support":[{"end":237,"quote":"The limiting behavior of the use of memory space of an\nalgorithm\nwhen the size of the problem goes to infinity.  This is usually denoted in\nbig-O notation\n.","source_id":"nist-dads.asymptoticspacecomplexity","source_sha256":"e23ccc597631a57b5e924517109fcd7ea6b5ba38a51d7bb004b28ccaa5ef0d92","start":81}],"target_id":"concept.nist.asymptoticspacecomplexity","target_kind":"node","target_sha256":"5b9613325cfd439bdddf8c6e8c0c558d14b7aa28756fb85b214dff48659f0266"}],"concept.nist.asymptotictimecomplexity":[{"id":"assertion.concept.nist.asymptotictimecomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines asymptotic time complexity as: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","support":[{"end":230,"quote":"The limiting behavior of the execution time of an\nalgorithm\nwhen the size of the problem goes to infinity.  This is usually denoted in\nbig-O notation\n.","source_id":"nist-dads.asymptotictimecomplexity","source_sha256":"8de4dc5e6cec52621c474b3aad78356545979a6f40eacec3d32737c990a14a53","start":79}],"target_id":"concept.nist.asymptotictimecomplexity","target_kind":"node","target_sha256":"5abd1c3dc057343f596ee58024ed16917f019f9d7f8ed948d45a090bcb94b3ee"}],"concept.nist.augmentngpth":[{"id":"assertion.concept.nist.augmentngpth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines augmenting path as: A path with alternating free and matched edges that begins and ends with free vertices . Used to augment (improve or increase) a matching or flow .","support":[{"end":204,"quote":"A\npath\nwith alternating\nfree\nand\nmatched\nedges that begins and ends with\nfree vertices\n. Used to augment (improve or increase) a\nmatching\nor\nflow\n.","source_id":"nist-dads.augmentngpth","source_sha256":"7d40b64394067e5d17f22ec536b4c1fef0a95d23b72ffe27d7d972d4554fdbb2","start":57}],"target_id":"concept.nist.augmentngpth","target_kind":"node","target_sha256":"371bfe3ba5f6891625e55f350b337a26ec6b67ef540a726dfd309edcad4f0c94"}],"concept.nist.averagecase":[{"id":"assertion.concept.nist.averagecase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines average case as: Having to do with the mathematical average of all cases.","support":[{"end":107,"quote":"Having to do with the mathematical average of all cases.","source_id":"nist-dads.averagecase","source_sha256":"35d001e9fed6608ee0f78aa76362fa9b03e57a8d367e65a6d086ff8085553dd1","start":51}],"target_id":"concept.nist.averagecase","target_kind":"node","target_sha256":"dbe70714203050ae53d4657031c9501318b2e6ae4a10a5ee105547c73ec01791"}],"concept.nist.averagecasecost":[{"id":"assertion.concept.nist.averagecasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines average-case cost as: The sum of costs of an algorithm over all possible inputs divided by the number of possible inputs.","support":[{"end":160,"quote":"The sum of costs of an\nalgorithm\nover all possible inputs divided by the number of possible inputs.","source_id":"nist-dads.averagecasecost","source_sha256":"88548372eac96dd201f601e98f56f734e3e82e3df84310788bd0faa80e4353ff","start":61}],"target_id":"concept.nist.averagecasecost","target_kind":"node","target_sha256":"1969f3953bdf29a557f7e3a6fd274e188d68c2cc13f408a6066eeeed62071e06"}],"concept.nist.avltree":[{"id":"assertion.concept.nist.avltree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines AVL tree as: A balanced binary search tree where the height of the two subtrees ( children ) of a node differs by at most one. Look-up, insertion, and deletion are O(log n) , where n is the number of nodes in the tree.","support":[{"end":252,"quote":"A\nbalanced\nbinary search tree\nwhere the\nheight\nof the two subtrees (\nchildren\n) of a node differs by at most one. Look-up, insertion, and deletion are\nO(log n)\n, where n is the number of\nnodes\nin the tree.","source_id":"nist-dads.avltree","source_sha256":"b0b99a1d255f125df958de2097b12a6f62b211da04bfd9101ebae53d39d831c4","start":47}],"target_id":"concept.nist.avltree","target_kind":"node","target_sha256":"9f4d936546dd37e5365b64acc568769c16bd1138512550ac2b031285916c30be"}],"concept.nist.axiomaticsemantics":[{"id":"assertion.concept.nist.axiomaticsemantics","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines axiomatic semantics as: Defining the behavior of an abstract data type with axioms.","support":[{"end":124,"quote":"Defining the behavior of an\nabstract data type\nwith axioms.","source_id":"nist-dads.axiomaticsemantics","source_sha256":"5081e223651984635ca8834f9eb4889a83b22dbbbcba9bb346f2990b233814ac","start":65}],"target_id":"concept.nist.axiomaticsemantics","target_kind":"node","target_sha256":"8e6d4bdd609985c762476880e02823e27af13247c356dc991e077eb07ada2a0d"}],"concept.nist.bag":[{"id":"assertion.concept.nist.bag","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bag as: An unordered collection of values that may have duplicates. Formal Definition: A bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with axiomatic semantics as follows. new() returns a bag numberIn(v, new()) = 0 numberIn(v, add(v, B)) = 1 + numberIn(v, B) numberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u remove(v, new()) = new() remove(v, add(v, B)) = B remove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u where B is a bag and u and v are elements. The predicate isEmpty(B) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, B)) = false Also known as multi-set.","support":[{"end":772,"quote":"An unordered collection of values that may have duplicates.\nFormal Definition:\nA bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with\naxiomatic semantics\nas follows.\nnew() returns a bag\nnumberIn(v, new()) = 0\nnumberIn(v, add(v, B)) = 1 + numberIn(v, B)\nnumberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u\nremove(v, new()) = new()\nremove(v, add(v, B)) = B\nremove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u\nwhere B is a bag and u and v are elements.\nThe\npredicate\nisEmpty(B) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(add(v, B)) = false\nAlso known as\nmulti-set.","source_id":"nist-dads.bag","source_sha256":"ee6444c90b834c612da8e343598ed1307cd42e360fb65bd701e968683108d442","start":37}],"target_id":"concept.nist.bag","target_kind":"node","target_sha256":"1b88a554da84531630b583b51b39dca3a92404638558b3805b7aafdfb826796c"}],"concept.nist.balance":[{"id":"assertion.concept.nist.balance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balance as: The (weight) balance of a tree is the number of leaves of the left subtree of a tree, denoted |T l |, divided by the total number of leaves of the tree. Formally, ρ(T) = |T l |/|T|. Also known as root balance.","support":[{"end":252,"quote":"The (weight) balance of a tree is the number of\nleaves\nof the left subtree of a tree, denoted |T\nl\n|, divided by the total number of leaves of the tree.  Formally, ρ(T)  = |T\nl\n|/|T|.\nAlso known as\nroot balance.","source_id":"nist-dads.balance","source_sha256":"7ee958ec370acabf981f3ddb996ce7ca93e343c8fa136c8a34db366ec3def35b","start":41}],"target_id":"concept.nist.balance","target_kind":"node","target_sha256":"faeb580626d02525a38644434c1259819b33f3036ee49969a97172d094f78b11"}],"concept.nist.balancedbist":[{"id":"assertion.concept.nist.balancedbist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced binary search tree as: A binary search tree that is balanced .","support":[{"end":124,"quote":"A\nbinary search tree\nthat is\nbalanced\n.","source_id":"nist-dads.balancedbist","source_sha256":"baa8f5753846b586cdf0d59a832ff3e23be9474ecde8514505de67482948c632","start":85}],"target_id":"concept.nist.balancedbist","target_kind":"node","target_sha256":"bdf8e38d433af8e0637e221d28d6b2136b0336c8ac1f797a1ba052126e647e40"}],"concept.nist.balancedbitr":[{"id":"assertion.concept.nist.balancedbitr","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines balanced binary tree as: A binary tree where no leaf is more than a certain amount farther from the root than any other. After inserting or deleting a node , the tree may rebalanced with rotations .","support":[{"end":245,"quote":"A\nbinary tree\nwhere no\nleaf\nis more than a certain amount farther from the\nroot\nthan any other.  After inserting or deleting a\nnode\n, the tree may rebalanced with\nrotations\n.","source_id":"nist-dads.balancedbitr","source_sha256":"1e790d8f01ee968fa5a14d3403616c6aca67537a5e39e5c89fe91cf4660f20a7","start":71}],"target_id":"concept.nist.balancedbitr","target_kind":"node","target_sha256":"ed4cfb0f56e304685494cead5d8b640f58fac118d8e4d870480380ac19f2e9d6"}],"concept.nist.balancedtree":[{"id":"assertion.concept.nist.balancedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced tree as: A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","support":[{"end":261,"quote":"A\ntree\nwhere no\nleaf\nis much farther away from the\nroot\nthan any other leaf.  Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","source_id":"nist-dads.balancedtree","source_sha256":"985a05da920669f899b2147e3d1ef926b4cb3b95a419f7b420c3e84532211ec0","start":57}],"target_id":"concept.nist.balancedtree","target_kind":"node","target_sha256":"7371773e310bf4e7b65a9f0aaa622dc2f57e31573e4dd2766e6e21ea25a9d7eb"}],"concept.nist.bangfile":[{"id":"assertion.concept.nist.bangfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BANG file as: A balanced and nested grid (BANG) file is a point access method that divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Cells may intersect, and points may be distributed between them.","support":[{"end":276,"quote":"A balanced and nested grid (BANG) file is a\npoint access method\nthat divides space into a nonperiodic grid.  Each spatial dimension is divided by a\nlinear hash\n.  Cells may intersect, and points may be distributed between them.","source_id":"nist-dads.bangfile","source_sha256":"49ba11675f98bb810ef9912738bc9968e8b6b5fe92d2b4e3ec61ab22dcc0fac5","start":49}],"target_id":"concept.nist.bangfile","target_kind":"node","target_sha256":"2f84a3839346cefcf8639056baf66b1c117d807d9ba78425483f92ea182f4946"}],"concept.nist.bbalphatree":[{"id":"assertion.concept.nist.bbalphatree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BB(α) tree as: A binary tree where the balance of every subtree, ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α. Also known as weight-balanced tree.","support":[{"end":179,"quote":"A\nbinary tree\nwhere the\nbalance\nof every subtree,  ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α.\nAlso known as\nweight-balanced tree.","source_id":"nist-dads.bbalphatree","source_sha256":"e7401f3b873f0c06fac0630b0442d2b884e3b0445ecb9afd0494cb5eb5526420","start":55}],"target_id":"concept.nist.bbalphatree","target_kind":"node","target_sha256":"32c9c9ee70e852667afa985955487dc82fbdb3c85cf600f3b3b9913f62e283a5"}],"concept.nist.bdd":[{"id":"assertion.concept.nist.bdd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BDD as: A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","support":[{"end":174,"quote":"A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","source_id":"nist-dads.bdd","source_sha256":"b665238c6741acb4e5832456bf5ded0c86a64dd78a67096e9f4dea87ea673454","start":37}],"target_id":"concept.nist.bdd","target_kind":"node","target_sha256":"028b3455240f4772f6f4a7b2a63302bcb898a5e5714dc4d263852e1f03d229db"}],"concept.nist.bdtree":[{"id":"assertion.concept.nist.bdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BD-tree as: A binary tree that organizes multidimensional points by splitting off regular subintervals.","support":[{"end":136,"quote":"A\nbinary tree\nthat organizes multidimensional points by splitting off regular subintervals.","source_id":"nist-dads.bdtree","source_sha256":"4c84db90751e4ec2816172cf99b31065e9f86390e773795cb3154becba92d975","start":45}],"target_id":"concept.nist.bdtree","target_kind":"node","target_sha256":"55511acf456f3276cf8ecea2182d21cf84fa6abfef7667799732c253661863ae"}],"concept.nist.bestcase":[{"id":"assertion.concept.nist.bestcase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best case as: (1) The situation or input for which an algorithm or data structure takes the least time or resources. (2) Having to do with this situation or input.","support":[{"end":194,"quote":"(1) The situation or input for which an\nalgorithm\nor\ndata structure\ntakes the least time or resources. (2) Having to do with this situation or input.","source_id":"nist-dads.bestcase","source_sha256":"047fc80e2d09389390657422c024410ff1005dbe71104db1152c2799048dd98f","start":45}],"target_id":"concept.nist.bestcase","target_kind":"node","target_sha256":"ed84138684035c9124ba0cb444603a97a8cbebb203c572074cbe70bfc5de50c8"}],"concept.nist.bestcasecost":[{"id":"assertion.concept.nist.bestcasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best-case cost as: The minimum cost to process an input sequence. Also known as optimal cost.","support":[{"end":129,"quote":"The minimum cost to process an input sequence.\nAlso known as\noptimal cost.","source_id":"nist-dads.bestcasecost","source_sha256":"72d7bab9376ec83e9753dbcc0ee09150d383686afc856db490d3b0a5d79322f5","start":55}],"target_id":"concept.nist.bestcasecost","target_kind":"node","target_sha256":"4d1c5aaf65676d659b78cd60363d5355c9c4c5e89be245d65fe5d118c82a7e5c"}],"concept.nist.biconnectedcomponent":[{"id":"assertion.concept.nist.biconnectedcomponent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines biconnected component as: A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex .","support":[{"end":208,"quote":"A maximal subset of\nedges\nof a\nconnected graph\nsuch that the corresponding induced subgraph cannot be disconnected by deleting any\nvertex\n.","source_id":"nist-dads.biconnectedcomponent","source_sha256":"96901f4f26cada3f33e993b61f466a5b568301c49f6474ac77955913e1a14582","start":69}],"target_id":"concept.nist.biconnectedcomponent","target_kind":"node","target_sha256":"01ca97ec420bf4d47581ca4d31c5a1d64f0b35e47c520193b91f423235becac0"}],"concept.nist.biconnectedgraph":[{"id":"assertion.concept.nist.biconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines biconnected graph as: A connected graph that is not broken into disconnected pieces by deleting any single vertex (and incident edges ).","support":[{"end":175,"quote":"A\nconnected graph\nthat is not broken into disconnected pieces by deleting any single\nvertex\n(and incident\nedges\n).","source_id":"nist-dads.biconnectedgraph","source_sha256":"4f06a085f901f9f6195656cf4855f13ab2d4b165f014eef65f9110f206b7c831","start":61}],"target_id":"concept.nist.biconnectedgraph","target_kind":"node","target_sha256":"8df09e15ce2e5be33a97f49e19736f99e1a4c0733f1966714d74770951c47be0"}],"concept.nist.bigonotation":[{"id":"assertion.concept.nist.bigonotation","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines big-O notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n). The notation is read, \"f of n is big oh of g of n\". Formal Definition: f(n) = O(g(n)) means there are positive constants c and k, such that 0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n. Also known as O, asymptotic upper bound.","support":[{"end":612,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n).     The notation is read, \"f of n is big oh of g of n\".\nFormal Definition:\nf(n) = O(g(n)) means there are positive constants c and k, such that  0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n.\nAlso known as\nO, asymptotic upper bound.","source_id":"nist-dads.bigonotation","source_sha256":"2f0cb01df3f8c0c2021fc4291f3f48e12509f010077d67528950f45332616ca8","start":55}],"target_id":"concept.nist.bigonotation","target_kind":"node","target_sha256":"4c80b72e53ccd9b921998435626df565e8a4fc332000100c7844d6fe8405d43f"}],"concept.nist.binaryfunc":[{"id":"assertion.concept.nist.binaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary function as: A function with two arguments.","support":[{"end":87,"quote":"A\nfunction\nwith two arguments.","source_id":"nist-dads.binaryfunc","source_sha256":"c2579d87ab9f72a2e2fcdbd2ac6cb8eb70f1c5990d72918a6c385fb5d4a6d4f6","start":57}],"target_id":"concept.nist.binaryfunc","target_kind":"node","target_sha256":"be5fe9ceb3f2d98a3ef34b1fef0a26cc9266e191bf73f0d1f9d31ad92fcd1e51"}],"concept.nist.binaryheap":[{"id":"assertion.concept.nist.binaryheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary heap as: A complete binary tree where every node has a key more extreme (greater or less) than or equal to the key of its parent .","support":[{"end":174,"quote":"A\ncomplete binary tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than or equal to the key of its\nparent\n.","source_id":"nist-dads.binaryheap","source_sha256":"861a125cb6a5836bf6afb24204c429ae50e15df1cc008248cafb6c44ac7f2a6e","start":53}],"target_id":"concept.nist.binaryheap","target_kind":"node","target_sha256":"2fe0fb78b89a00ff9b499fec7e5310ca014b97ef5785fc06614eaab3e1f95cce"}],"concept.nist.binarypriorityqueue":[{"id":"assertion.concept.nist.binarypriorityqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary priority queue as: A priority queue implemented with a binary tree having the following restrictions: The key of a node is greater than keys of its children , i.e., it has the heap property . If the right subtree is not empty, the left subtree is not empty. If there are both left and right children, the left child's key is greater than the right child's key.","support":[{"end":414,"quote":"A\npriority queue\nimplemented with a\nbinary tree\nhaving the following restrictions:\nThe\nkey\nof a\nnode\nis greater than keys of its\nchildren\n, i.e., it has the\nheap property\n.\nIf the right\nsubtree\nis not empty, the left subtree is not empty.\nIf there are both left and right children, the left child's key is greater than the right child's key.","source_id":"nist-dads.binarypriorityqueue","source_sha256":"2591e6795134e6a3a8978fa660a7ff4d84337266868539dd93b6f4c9380b07b7","start":73}],"target_id":"concept.nist.binarypriorityqueue","target_kind":"node","target_sha256":"dde087e659cd432e21d71ad84322e6982708bca19b4e3adf6a6e8f91498f9bb9"}],"concept.nist.binaryrelation":[{"id":"assertion.concept.nist.binaryrelation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary relation as: A relation between exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an edge to) for vertices of a graph .","support":[{"end":240,"quote":"A\nrelation\nbetween exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an\nedge\nto) for\nvertices\nof a\ngraph\n.","source_id":"nist-dads.binaryrelation","source_sha256":"f703dcf360db3a37493dff54544669c2c63829ffbdad1084c5ab6adf50c01010","start":57}],"target_id":"concept.nist.binaryrelation","target_kind":"node","target_sha256":"0f0ecb49e0b1acd21ed2328f3a7e1700804d923c2dc84389c63590f562ce1f44"}],"concept.nist.binarysearchtree":[{"id":"assertion.concept.nist.binarysearchtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary search tree as: A binary tree where every node's left subtree has keys less than the node's key, and every right subtree has keys greater than the node's key.","support":[{"end":209,"quote":"A\nbinary tree\nwhere every\nnode's\nleft\nsubtree\nhas\nkeys\nless than the node's key, and every right subtree has keys greater than the node's key.","source_id":"nist-dads.binarysearchtree","source_sha256":"aff36eb9abb3b83838628591edca1e88ac1ed5d045a8ffa5eb43668a165e41bb","start":67}],"target_id":"concept.nist.binarysearchtree","target_kind":"node","target_sha256":"8ab723b4841c3aac5f610266ba6842b0a8784c5c662189a3248ce01e392467f0"}],"concept.nist.binarytree":[{"id":"assertion.concept.nist.binarytree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary tree as: A tree with at most two children for each node . Formal Definition: A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree. Also known as dyadic tree.","support":[{"end":254,"quote":"A\ntree\nwith at most two\nchildren\nfor each\nnode\n.\nFormal Definition:\nA binary tree either\nis empty (no nodes), or\nhas a\nroot\nnode, a left binary tree, and a right binary tree.\nAlso known as\ndyadic tree.","source_id":"nist-dads.binarytree","source_sha256":"b31629abe43a911ab2d8aeb5603d384cfc29e0afd4dddf8c5709b1f2e9787237","start":53}],"target_id":"concept.nist.binarytree","target_kind":"node","target_sha256":"9e4580ff8cbc61844d22667e94167d1c54eb8118d53576da3b875ad190a977eb"}],"concept.nist.binomialheap":[{"id":"assertion.concept.nist.binomialheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binomial heap as: A heap made of a forest of binomial trees with the heap property numbered k=0, 1, 2, …, n, each containing either 0 or 2 k nodes . Each tree is formed by linking two of its predecessors, by joining one at the root of the other. The operations of insert a value, decrease a value, delete a value, and merge or join ( meld ) two queues take O(log n) time. The find minimum operation is a constant Θ(1) .","support":[{"end":460,"quote":"A\nheap\nmade of a\nforest\nof\nbinomial trees\nwith the\nheap property\nnumbered k=0, 1, 2, …, n, each containing either 0 or 2\nk\nnodes\n. Each tree is formed by linking two of its predecessors, by joining one at the\nroot\nof the other.  The operations of insert a value, decrease a value, delete a value, and merge or join (\nmeld\n) two queues take\nO(log n)\ntime.  The find minimum operation is a constant\nΘ(1)\n.","source_id":"nist-dads.binomialheap","source_sha256":"d1eb18ca83685f3da3fb02b85abd92956d6d7505e279c6caa577822782ce9a6d","start":57}],"target_id":"concept.nist.binomialheap","target_kind":"node","target_sha256":"aef24503937a90949e1b6c1a660ea0398d3e4024f7d44db95ed0ebffaa010a99"}],"concept.nist.binpacking":[{"id":"assertion.concept.nist.binpacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bin packing problem as: Determine how to put the most objects in the least number of fixed space bins. More formally, find a partition and assignment of a set of objects such that a constraint is satisfied or an objective function is minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","support":[{"end":447,"quote":"Determine how to put the most objects in the least number of fixed space bins.  More formally, find a\npartition\nand assignment of a\nset\nof objects such that a constraint is satisfied or an\nobjective function\nis minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","source_id":"nist-dads.binpacking","source_sha256":"4a8b6cd8cf99136f27526b2b895e1b5254bc07483e251044877ed5083bcf97fc","start":70}],"target_id":"concept.nist.binpacking","target_kind":"node","target_sha256":"5c841483c50be669ff6cd193b11dfafacd2acd048896649768cad76b80cf5b75"}],"concept.nist.bintree":[{"id":"assertion.concept.nist.bintree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bintree as: A regular decomposition k-d tree for region data.","support":[{"end":94,"quote":"A\nregular decomposition\nk-d tree\nfor region data.","source_id":"nist-dads.bintree","source_sha256":"e568a8a89c75f54496e5319a7f258daf2d0f98caffbbb1a9595ec8fe6c9dc4d8","start":45}],"target_id":"concept.nist.bintree","target_kind":"node","target_sha256":"b4cda3ed467172429f4c9c2768f68b2fab0f4a51a32a078a9b908ef6effa26de"}],"concept.nist.bipartgraph":[{"id":"assertion.concept.nist.bipartgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bipartite graph as: An undirected graph where vertices can be partition ed into two sets such that no edge connects vertices in the same set.","support":[{"end":178,"quote":"An\nundirected graph\nwhere\nvertices\ncan be\npartition\ned into two sets such that no\nedge\nconnects vertices in the same set.","source_id":"nist-dads.bipartgraph","source_sha256":"c6872cf89e019db12ba781d012202a6af0633da3c2c525da2b32ecc6b61d36b8","start":57}],"target_id":"concept.nist.bipartgraph","target_kind":"node","target_sha256":"a2687513aaab1289574e1925939c984e7d065786094843d7b1f53e59038764bb"}],"concept.nist.bipartmatch":[{"id":"assertion.concept.nist.bipartmatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bipartite matching as: (1) A perfect matching between vertices of a bipartite graph , that is, a subgraph that pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching. Also known as maximum bipartite matching.","support":[{"end":286,"quote":"(1) A\nperfect matching\nbetween\nvertices\nof a\nbipartite graph\n, that is, a\nsubgraph\nthat pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching.\nAlso known as\nmaximum bipartite matching.","source_id":"nist-dads.bipartmatch","source_sha256":"bb59f88f2a03dd447be6bb609adb0fd13b3b1fb64124a15c13576e467a068fca","start":63}],"target_id":"concept.nist.bipartmatch","target_kind":"node","target_sha256":"79d9670c169fa459c33c8e67b8a94950588b3e372cb8a4233509edc5bdd22424"}],"concept.nist.bitvector":[{"id":"assertion.concept.nist.bitvector","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bit vector as: An array of bits.","support":[{"end":68,"quote":"An\narray\nof bits.","source_id":"nist-dads.bitvector","source_sha256":"cd60ac92fae201761e8cbb4416a432891074029ee78c1263258da21170796b63","start":51}],"target_id":"concept.nist.bitvector","target_kind":"node","target_sha256":"969746c8763bd6689c9830f7b1a3bc2dfeb328665c5ad7152ae5f8b11b298648"}],"concept.nist.blindtrie":[{"id":"assertion.concept.nist.blindtrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blind trie as: A specialized Patricia tree whose internal nodes store only an integer, k, which is the length of the common prefix of the strings in the children . Equivalently, the strings first differ in the (k+1) st character.","support":[{"end":266,"quote":"A specialized\nPatricia tree\nwhose\ninternal nodes\nstore only an integer, k, which is the length of the common\nprefix\nof the strings in the\nchildren\n.  Equivalently, the strings first differ in the (k+1)\nst\ncharacter.","source_id":"nist-dads.blindtrie","source_sha256":"57f0216d701a9828d067de6bb1a40dbe0f64287f6747fd5ea0d6fff7ec81f6b7","start":51}],"target_id":"concept.nist.blindtrie","target_kind":"node","target_sha256":"c579e5c312604f468604ecd25b514ca7a46f3a87cb0a6c65f99d9a63c36ea6f3"}],"concept.nist.block":[{"id":"assertion.concept.nist.block","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines block as: (1) A number of items which are handled together for efficiency. (2) A sequence of don't care symbols.","support":[{"end":139,"quote":"(1) A number of items which are handled together for efficiency. (2) A sequence of\ndon't care\nsymbols.","source_id":"nist-dads.block","source_sha256":"2fa567ae9ecacc234dfdf3fe0bd434c71426d12f9d5afe581ecaa59f48ba0b45","start":37}],"target_id":"concept.nist.block","target_kind":"node","target_sha256":"89658d93ef56652ab8811749effe247bd096a91fede02f6c7efb29913675181d"}],"concept.nist.blockaddressingindex":[{"id":"assertion.concept.nist.blockaddressingindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines block addressing index as: An inverted index that includes the block , or general location, within texts, in addition to the text in which the word appears.","support":[{"end":204,"quote":"An\ninverted index\nthat includes the\nblock\n, or general location, within texts, in addition to the text in which the word appears.","source_id":"nist-dads.blockaddressingindex","source_sha256":"45116a86dc8f9cdb3f3276e77153db39b9aaa222011bec41243daff789dcc711","start":75}],"target_id":"concept.nist.blockaddressingindex","target_kind":"node","target_sha256":"bd8ea4303f60c50b47f5f52aca6c8fdf91da0ab69a7e34542fc4fe3beac20a50"}],"concept.nist.blockingflow":[{"id":"assertion.concept.nist.blockingflow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blocking flow as: A flow function in which any directed path from the source to the sink contains a saturated edge .","support":[{"end":151,"quote":"A\nflow function\nin which any directed\npath\nfrom the\nsource\nto the\nsink\ncontains a\nsaturated edge\n.","source_id":"nist-dads.blockingflow","source_sha256":"a07c80e302438080e9ebf105fefcc274b7506badec27d9ee04547bd6cfae86ea","start":53}],"target_id":"concept.nist.blockingflow","target_kind":"node","target_sha256":"b28e2260ee34fb74d2bd20d550c54b965a7d2c6317077ee0e371907e24a689fb"}],"concept.nist.bloomfilter":[{"id":"assertion.concept.nist.bloomfilter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bloom filter as: A data structure with a probabilistic algorithm to quickly test membership in a large set using multiple hash functions into a single array of bits.","support":[{"end":204,"quote":"A data structure with a\nprobabilistic algorithm\nto quickly test membership in a  large set using multiple\nhash functions\ninto a single\narray\nof bits.","source_id":"nist-dads.bloomfilter","source_sha256":"c130b821d3bdc58056c0f8f39e9e72b698d0c651e87c940513c2c4cb4cfccb01","start":55}],"target_id":"concept.nist.bloomfilter","target_kind":"node","target_sha256":"cb0d5e577e36b9b4058507c6c62752895817072707ef3f6ac50853d9cd2c1ea0"}],"concept.nist.blossom":[{"id":"assertion.concept.nist.blossom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blossom as: An odd length cycle which appears during a matching algorithm on general graphs .","support":[{"end":122,"quote":"An odd length\ncycle\nwhich appears during a\nmatching\nalgorithm on general\ngraphs\n.","source_id":"nist-dads.blossom","source_sha256":"b1a617ea6c002b69a38e4f1e2998c4c8e38b988f31926fe5a0db3d6ac708decb","start":41}],"target_id":"concept.nist.blossom","target_kind":"node","target_sha256":"cc1b472159ebbc59c29d1239baad05624a5ef3d66fab7b875946d35229d8a309"}],"concept.nist.boolean":[{"id":"assertion.concept.nist.boolean","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean as: (1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations and , or , and not . (2) In mathematics, entities from an algebra equivalent to intersection , union , and complement over subsets of a given set .","support":[{"end":311,"quote":"(1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations\nand\n,\nor\n, and\nnot\n. (2) In mathematics, entities from an algebra equivalent to\nintersection\n,\nunion\n, and\ncomplement\nover\nsubsets\nof a given\nset\n.","source_id":"nist-dads.boolean","source_sha256":"7dc11d682b023b875c6da02fdd98a2c9d78e340b13f2906d996e3d09b15f336e","start":41}],"target_id":"concept.nist.boolean","target_kind":"node","target_sha256":"1b3722d4c88e8346baf7ef62dd4629a0290de90513bc1a5db0bfb25bdcddda93"}],"concept.nist.booleanexpr":[{"id":"assertion.concept.nist.booleanexpr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean expression as: An expression consisting solely of boolean variables and values and boolean operations, such as and , or , not , implies , etc.","support":[{"end":190,"quote":"An expression consisting solely of boolean variables and values and boolean operations, such as\nand\n,\nor\n,\nnot\n,\nimplies\n, etc.","source_id":"nist-dads.booleanexpr","source_sha256":"fe01f5ad633fb1a4cd1385a90bac5d2abf1bcfb50e0eb0e20bfeef040bfafa1c","start":63}],"target_id":"concept.nist.booleanexpr","target_kind":"node","target_sha256":"f794a19fd36ec958c09320953d68843f970d6a21277a3226e836d72dcb1f07b7"}],"concept.nist.booleanfnctn":[{"id":"assertion.concept.nist.booleanfnctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boolean function as: A function whose range is {0, 1}. It can be understood to evaluate the truth or falsity of each element of its domain .","support":[{"end":179,"quote":"A\nfunction\nwhose\nrange\nis {0, 1}.  It can be understood to evaluate the truth or falsity of each element of its\ndomain\n.","source_id":"nist-dads.booleanfnctn","source_sha256":"02f35623edc3c1da8f3f82056d0b8a650431fc0ec1ace526a81e13b0d0bcbbed","start":59}],"target_id":"concept.nist.booleanfnctn","target_kind":"node","target_sha256":"779b57e1489ccab48bf1f912ff47ff734321e213d4f5a1473c283174bbd8cfc9"}],"concept.nist.border":[{"id":"assertion.concept.nist.border","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines border as: A string v which is both a prefix and a suffix of another string u. String v is the border of u if it is the longest proper border of u.","support":[{"end":176,"quote":"A\nstring\nv which is both a\nprefix\nand a\nsuffix\nof another string u.  String v is the border of u if it is the longest\nproper\nborder of u.","source_id":"nist-dads.border","source_sha256":"f8185c257ea5b51b8eb78b740c2e7ae97e9a805490e9ffaa215c5aeeb59b0ccc","start":39}],"target_id":"concept.nist.border","target_kind":"node","target_sha256":"d96dcdab84b9744a19a0e44b9843e2d39218bc025cd9727b60150c9acbc9da5a"}],"concept.nist.bottlenecktravelingsales":[{"id":"assertion.concept.nist.bottlenecktravelingsales","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bottleneck traveling salesman as: Find a tour where no edge is more costly than some (bottleneck) amount.","support":[{"end":161,"quote":"Find a\ntour\nwhere no edge is more costly than some (bottleneck) amount.","source_id":"nist-dads.bottlenecktravelingsales","source_sha256":"1c82c7efe51136a7b5cbe4b65a6293cf687fb6c67f13224e4dab3b3be6848a06","start":90}],"target_id":"concept.nist.bottlenecktravelingsales","target_kind":"node","target_sha256":"6cd1218e7bf9402901a355ab6ebb533902d2aa334e592cc9bdcab1681dbff217"}],"concept.nist.boundarybasd":[{"id":"assertion.concept.nist.boundarybasd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines boundary-based representation as: A representation of a region that is based on its boundary.","support":[{"end":144,"quote":"A representation of a region that is based on its boundary.","source_id":"nist-dads.boundarybasd","source_sha256":"499485b972195785ac4bb96c60c32af3c37837f323d15157304403d575fbf938","start":85}],"target_id":"concept.nist.boundarybasd","target_kind":"node","target_sha256":"290374ce94f4452c1e5d405746e7ef467e6830cda167f24c19975ef68dbcc7a9"}],"concept.nist.boundedqueue":[{"id":"assertion.concept.nist.boundedqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bounded queue as: A queue limited to a fixed number of items.","support":[{"end":100,"quote":"A\nqueue\nlimited to a fixed number of items.","source_id":"nist-dads.boundedqueue","source_sha256":"f1eba58f364107d0ab154455034506f08428db78b88e3722c0188c9db576a498","start":57}],"target_id":"concept.nist.boundedqueue","target_kind":"node","target_sha256":"9afa1b7e1e984b17dbba5722c7c60a677050d24a0ac91cb308657a4d40baaedd"}],"concept.nist.boundedstack":[{"id":"assertion.concept.nist.boundedstack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bounded stack as: A stack limited to a fixed number of items.","support":[{"end":100,"quote":"A\nstack\nlimited to a fixed number of items.","source_id":"nist-dads.boundedstack","source_sha256":"61c51aafb62c9d6f395848504bb049452cba78b0ca593cb8fa3f4c08a50cb7c1","start":57}],"target_id":"concept.nist.boundedstack","target_kind":"node","target_sha256":"f6b9dac040e2f6dbfcca02f30ea7867efed8695b83ad6bd0505e8a3a50a8fb93"}],"concept.nist.bpp":[{"id":"assertion.concept.nist.bpp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \" B ounded error P robability in P olynomial\" time. Also known as bounded error probability in polynomial time.","support":[{"end":340,"quote":"The class of\nlanguages\nfor which a membership computation by a\nprobabilistic Turing machine\nhalts in\npolynomial time\nwith the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \"\nB\nounded error\nP\nrobability in\nP\nolynomial\" time.\nAlso known as\nbounded error probability in polynomial time.","source_id":"nist-dads.bpp","source_sha256":"d4820a888f524e660cdae179d7bbe772a8e7a6b10d189da580bae30ba60bf4a3","start":33}],"target_id":"concept.nist.bpp","target_kind":"node","target_sha256":"1bf3e9c0195017146345de5367351d4758fcb7fd806c54ac89d3950b2c0490ad"}],"concept.nist.bradfordslaw":[{"id":"assertion.concept.nist.bradfordslaw","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bradford's law as: Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals. The number of journals is 1:n:n².","support":[{"end":300,"quote":"Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals.  The number of journals is 1:n:n².","source_id":"nist-dads.bradfordslaw","source_sha256":"b1c28d638496ccd66219bf00960a4e65dabdf485df080cc3eefb5ecfa05a55e2","start":55}],"target_id":"concept.nist.bradfordslaw","target_kind":"node","target_sha256":"c9acba2c82e4eafcf1959b883108848b618d127358de3c884616d0a784cf2b3c"}],"concept.nist.bridge":[{"id":"assertion.concept.nist.bridge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bridge as: An edge of a connected graph whose removal would make the graph unconnected.","support":[{"end":115,"quote":"An\nedge\nof a\nconnected graph\nwhose removal would make the graph unconnected.","source_id":"nist-dads.bridge","source_sha256":"1abafd9ecfc12d01509b830164521c0193965f4f0da5b51f9edb2934099f69a8","start":39}],"target_id":"concept.nist.bridge","target_kind":"node","target_sha256":"1e106b11c5a5c2bfeff278873dfdcc965c5d54304b680b9e2b7c4d43a0200560"}],"concept.nist.bsptree":[{"id":"assertion.concept.nist.bsptree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BSP-tree as: A binary space partitioning (BSP) tree is a binary tree for multidimensional points where successive levels are split by arbitrary hyperplanes.","support":[{"end":190,"quote":"A binary space partitioning (BSP) tree is a\nbinary tree\nfor multidimensional points where successive levels are split by arbitrary hyperplanes.","source_id":"nist-dads.bsptree","source_sha256":"a79cb2f4cb1c2818ee37ed74b019088355f04af93c639d2ed69f868abbdb763c","start":47}],"target_id":"concept.nist.bsptree","target_kind":"node","target_sha256":"bc241947c679cca0d4c100478fb87b1a56bd3fe32b06f8ce0c69b0e4082d65f7"}],"concept.nist.bstartree":[{"id":"assertion.concept.nist.bstartree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines B*-tree as: A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.","support":[{"end":172,"quote":"A\nB-tree\nin which\nnodes\nare kept 2/3 full by redistributing\nkeys\nto fill two\nchild\nnodes, then splitting them into three nodes.","source_id":"nist-dads.bstartree","source_sha256":"c488d345d98ebecdc292098d47ddeecbdd5bcf8fefbcfcf265232f17b38dc7c2","start":45}],"target_id":"concept.nist.bstartree","target_kind":"node","target_sha256":"147a2be4c4423ca5705f506f29ff96ee59256065954d42642c592578984b422c"}],"concept.nist.btree":[{"id":"assertion.concept.nist.btree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines B-tree as: A balanced search tree in which every node has between ⌈ m/2⌉ and m children , where m>1 is a fixed integer. m is the order . The root may have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the height , and hence the number of accesses, can be kept small, say one or two, by picking a large m. Also known as balanced multiway tree.","support":[{"end":429,"quote":"A\nbalanced\nsearch tree\nin which every\nnode\nhas between ⌈ m/2⌉ and m\nchildren\n, where m>1 is a fixed integer.  m is the\norder\n.  The\nroot\nmay have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the\nheight\n, and hence the number of accesses, can be kept small, say one or two, by picking a large m.\nAlso known as\nbalanced multiway tree.","source_id":"nist-dads.btree","source_sha256":"825abd14ac32c0105c00455a70771c917ec7ef43e0f01bbcc06f1dc124ddea51","start":43}],"target_id":"concept.nist.btree","target_kind":"node","target_sha256":"ac048aba35b62115e962caa4e5f047c604e2d6234f34752af128cabe80b9d5de"}],"concept.nist.bucket":[{"id":"assertion.concept.nist.bucket","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucket as: An area of storage where items with a common property are stored. Typically tree data structures and sort algorithms use many buckets, one for each group of items. Usually buckets are kept on disk.","support":[{"end":237,"quote":"An area of storage where items with a common property are stored. Typically\ntree\ndata structures and\nsort\nalgorithms use many buckets, one for each group of items.  Usually buckets are kept on disk.","source_id":"nist-dads.bucket","source_sha256":"eaae708ef50cc14a37f91b98428546e77b165176a2f249c01c3d47c0f65210cc","start":39}],"target_id":"concept.nist.bucket","target_kind":"node","target_sha256":"9180f428f8d8ba70dc4d367660fc2cb23ec3b3af90f6592920d757e1a9c30133"}],"concept.nist.bucketmeth":[{"id":"assertion.concept.nist.bucketmeth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucketing method as: Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","support":[{"end":337,"quote":"Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","source_id":"nist-dads.bucketmeth","source_sha256":"6bcb8d871d72103db6def47829976bb374ae7c292b731d8249ed1b4cbeb49425","start":59}],"target_id":"concept.nist.bucketmeth","target_kind":"node","target_sha256":"ba4b856698193363293bd6451c1f599eaf53f13ab253bad16fcc46fdfcbb8c85"}],"concept.nist.buckettrie":[{"id":"assertion.concept.nist.buckettrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bucket trie as: A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.","support":[{"end":170,"quote":"A variant of a\ntrie\nin which\nleaf\nnodes are\nbuckets\nwhich hold up to k strings.  Usually implies fixed sized buckets.","source_id":"nist-dads.buckettrie","source_sha256":"f96b4612236b5d3825afd6ca7f45c80c0c0a6dcfece358dd14cd8111c613c7b9","start":53}],"target_id":"concept.nist.buckettrie","target_kind":"node","target_sha256":"220a7c2beb2dad46cd7aef82b3550e190b57c41b489fcc1544c9819b11410297"}],"concept.nist.buddytree":[{"id":"assertion.concept.nist.buddytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines buddy tree as: A point access method which splits multidimensional space in different dimensions at each level. It also keeps a minimum bounding box of points accessible by each node.","support":[{"end":220,"quote":"A\npoint access method\nwhich splits multidimensional space in different dimensions at each level.  It also keeps a\nminimum bounding box\nof points accessible by each node.","source_id":"nist-dads.buddytree","source_sha256":"6b2bc30babd297dd9f656f06e79257cfcf25f73f8ecc50f595a32e925ff5e2db","start":51}],"target_id":"concept.nist.buddytree","target_kind":"node","target_sha256":"1cee6cb768c921ca57e645dc24e6c0fb2977d1649b61166780fecaff8b691ed7"}],"concept.nist.busybeaver":[{"id":"assertion.concept.nist.busybeaver","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines busy beaver as: (1) A Turing machine with a small number of states that halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps. (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","support":[{"end":370,"quote":"(1) A\nTuring machine\nwith a small number of\nstates\nthat halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps.  (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","source_id":"nist-dads.busybeaver","source_sha256":"d536a3b9393bdee35d5ef0e4c14318e469b74d94e9ccde57b8a4ac2db6553eb1","start":54}],"target_id":"concept.nist.busybeaver","target_kind":"node","target_sha256":"c890e3ce72ff9066a4970dcf389c8d6abb998adf7a39799f438454c4ff57da58"}],"concept.nist.bvtree":[{"id":"assertion.concept.nist.bvtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BV-tree as: A conceptual idea which generalizes B-trees to multiple dimensions. BV-trees are not balanced, and searching may require backtracking .","support":[{"end":181,"quote":"A conceptual idea which generalizes\nB-trees\nto multiple dimensions.  BV-trees are not balanced, and searching may require\nbacktracking\n.","source_id":"nist-dads.bvtree","source_sha256":"efc5192022c06c1c70d95c926f7a2d756eff2e33d519526e46ec1dd154bb0a04","start":45}],"target_id":"concept.nist.bvtree","target_kind":"node","target_sha256":"74c8bda5c0e0bf8f3c47ba0fcf330584e8da654203305b2bcf47c5e39e44bb5c"}],"concept.nist.byzantine":[{"id":"assertion.concept.nist.byzantine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Byzantine generals as: The problem of reaching a consensus among distributed units if some of them give misleading answers. To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making algorithm should the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","support":[{"end":583,"quote":"The problem of reaching a consensus among distributed units if some of them give misleading answers.  To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making\nalgorithm\nshould the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","source_id":"nist-dads.byzantine","source_sha256":"0b3b3708759a90cd2699641b08aed6c413f38636f6dbea8ec0edebe4d9e608d0","start":68}],"target_id":"concept.nist.byzantine","target_kind":"node","target_sha256":"237dd7620b8440136691f1e48a47bc78fe86340b71942f59cd58e3b6cfba67ab"}],"concept.nist.cactusstack":[{"id":"assertion.concept.nist.cactusstack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cactus stack as: A variant of stack in which one other cactus stack may be attached to the top. An attached stack is called a \"branch.\" When a branch becomes empty, it is removed. Pop is not allowed if there is a branch. A branch is only accessible through the original reference; it is not accessible through the stack. Formal Definition: The operations new to this variant of stack, branch(S, T) and notch(v), may be defined with axiomatic semantics as follows. top(branch(S, T)) = top(S) notch(new()) = false notch(push(v, S)) = false notch(branch(S, T)) = true Also known as saguaro stack.","support":[{"end":635,"quote":"A variant of\nstack\nin which one other cactus stack may be attached to the top.  An attached stack is called a \"branch.\"  When a branch becomes empty, it is removed.  Pop is not allowed if there is a branch.  A branch is only accessible through the original reference; it is not accessible through the stack.\nFormal Definition:\nThe operations new to this variant of stack, branch(S, T) and notch(v), may be defined with\naxiomatic semantics\nas follows.\ntop(branch(S, T)) = top(S)\nnotch(new()) = false\nnotch(push(v, S)) = false\nnotch(branch(S, T)) = true\nAlso known as\nsaguaro stack.","source_id":"nist-dads.cactusstack","source_sha256":"deb49227e54775fd0b4f539b1cb8506ab1302558f48aed1d40c78781d4d4b1f8","start":55}],"target_id":"concept.nist.cactusstack","target_kind":"node","target_sha256":"983ac8111e96099f473a46029bd54539ebc0c487e848c0eb0cceff57500dc045"}],"concept.nist.calcucommsys":[{"id":"assertion.concept.nist.calcucommsys","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Calculus of Communicating Systems as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. Commonly known as CCS.","support":[{"end":199,"quote":"Robin Milner's algebraic theory to formalize the notion of concurrent computation.  Commonly known as CCS.","source_id":"nist-dads.calcucommsys","source_sha256":"3912e027d5180addf468a94efc93455d3f765a02f06dfe3310a5f9d417c1c73f","start":93}],"target_id":"concept.nist.calcucommsys","target_kind":"node","target_sha256":"bedbb7ca96174c004bd2b0843db0a3795f49f53a0ff54ce426f94f0b4772e2a2"}],"concept.nist.calendarqueue":[{"id":"assertion.concept.nist.calendarqueue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines calendar queue as: A fast priority queue implementation having N buckets each with width w, or covering w time. An item with priority p more than current goes in bucket (p/w)%N. Choose N and w to have few items in each bucket. Keep items sorted within buckets. Double or halve N and change w if the number of items grows or shrinks a lot.","support":[{"end":383,"quote":"A fast\npriority queue\nimplementation having N buckets each with width w, or covering w time.  An item with priority p more than current goes in bucket (p/w)%N.   Choose N and w to have few items in each bucket.  Keep items sorted within buckets.  Double or halve N and change w if the number of items grows or shrinks a lot.","source_id":"nist-dads.calendarqueue","source_sha256":"8d6d675b12c8d0de8578e454a5eb4c35e90d4b6a2eb7694045234c05d8cd4af1","start":59}],"target_id":"concept.nist.calendarqueue","target_kind":"node","target_sha256":"4254c3ece2dbb11d5c6e61f18d3195e18f90172f2dd7f19eee85c4d4696d010e"}],"concept.nist.candidate":[{"id":"assertion.concept.nist.candidate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines candidate consistency testing as: The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","support":[{"end":206,"quote":"The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","source_id":"nist-dads.candidate","source_sha256":"39e251afbdc60492dc3f3ee4a4609ad64b924dc9d45aa109688497b2cf0fc7ad","start":85}],"target_id":"concept.nist.candidate","target_kind":"node","target_sha256":"2346ec33a32d1bb51849d66fdffc9ef70b615a91c132356434411e4ef60ad2ad"}],"concept.nist.candidateverification":[{"id":"assertion.concept.nist.candidateverification","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines candidate verification as: The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","support":[{"end":172,"quote":"The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","source_id":"nist-dads.candidateverification","source_sha256":"15134d726578335224d9de2ded92a80d6cfde70fb4e70abf8f4bc126e30cd73f","start":71}],"target_id":"concept.nist.candidateverification","target_kind":"node","target_sha256":"0ee8c2a72f78e6843e2e7518fd4755a052eab2051821a0eeecc67e7cdf1154b3"}],"concept.nist.canonical":[{"id":"assertion.concept.nist.canonical","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines canonical complexity class as: One of the classes defined by logarithmic , polynomial , and exponential bounds on time and space, for deterministic and nondeterministic machines. These classify most of the important computational problems.","support":[{"end":288,"quote":"One of the classes defined by\nlogarithmic\n,\npolynomial\n, and\nexponential\nbounds on time and space, for deterministic and nondeterministic machines.  These classify most of the important computational problems.","source_id":"nist-dads.canonical","source_sha256":"508132473ff660f6cd64990bb4b841c10e107e26aa5953fd0cf61817b81a4faa","start":79}],"target_id":"concept.nist.canonical","target_kind":"node","target_sha256":"f8b7a3b8060f659d20880636e792c20c63c8580f6818217410df72d6ff6a8155"}],"concept.nist.capacifacloc":[{"id":"assertion.concept.nist.capacifacloc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacitated facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance objective function and no supply supports too many demand points.","support":[{"end":317,"quote":"Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance\nobjective function\nand no supply supports too many demand points.","source_id":"nist-dads.capacifacloc","source_sha256":"cdaf9126fc5d73c3eb634970b7ae48cbc8677a7ee58b2490bf41903f65009611","start":90}],"target_id":"concept.nist.capacifacloc","target_kind":"node","target_sha256":"bcd82ace420a8adc608b66525178d94341fadf67d51c426c24d8cf063596f179"}],"concept.nist.capacity":[{"id":"assertion.concept.nist.capacity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacity as: The maximum flow that may be sent through an edge or a vertex .","support":[{"end":106,"quote":"The maximum flow that may be sent through an\nedge\nor a\nvertex\n.","source_id":"nist-dads.capacity","source_sha256":"0b7f339cf5b0363245bb13c7e703a749c90d4c8bd6fcf06241861b5efb129f7b","start":43}],"target_id":"concept.nist.capacity","target_kind":"node","target_sha256":"7fc79d355dd77d677e1197e1bb7b5fd458f9635891055a8f92ebd5565c780251"}],"concept.nist.capacitycstr":[{"id":"assertion.concept.nist.capacitycstr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines capacity constraint as: The property that the flow on every edge of a flow network is no more than the edge's capacity . More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","support":[{"end":261,"quote":"The property that the flow on every\nedge\nof a\nflow network\nis no more than the edge's\ncapacity\n.  More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","source_id":"nist-dads.capacitycstr","source_sha256":"75f6c4a14ee328cfeda28cc091a718b61bc181ea8130c64b61b0f11871777e68","start":65}],"target_id":"concept.nist.capacitycstr","target_kind":"node","target_sha256":"d5b19dc011d1e923f452120786c18319331a67f4617c8a6e47ab5a454acd1691"}],"concept.nist.ccs":[{"id":"assertion.concept.nist.ccs","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CCS as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. An acronym for Calculus of Communicating Systems.","support":[{"end":166,"quote":"Robin Milner's algebraic theory to formalize the notion of concurrent computation.  An acronym for Calculus of Communicating Systems.","source_id":"nist-dads.ccs","source_sha256":"9ffcf4bfffb0a97016ca02191da5b2a6b854d9adcec7c832d1ee0085e5be122e","start":33}],"target_id":"concept.nist.ccs","target_kind":"node","target_sha256":"9991f240c46f9b1db43e307af35636c4199d2940fcffee3081c5c90e6e189053"}],"concept.nist.cellprobemodel":[{"id":"assertion.concept.nist.cellprobemodel","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cell probe model as: A model of computation where the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size. All other computations are not counted and are considered to be free.","support":[{"end":290,"quote":"A\nmodel of computation\nwhere the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size.  All other computations are not counted and are considered to be free.","source_id":"nist-dads.cellprobemodel","source_sha256":"4d48b9bcea8bf416e71a8e9e5084c81c307526f0a94d25b2bfb00ff6f7ea85b1","start":59}],"target_id":"concept.nist.cellprobemodel","target_kind":"node","target_sha256":"ad194c892f2a841c1e5490a755e2be7fb323c916fe901103226e5c9e2c0622b0"}],"concept.nist.celltree":[{"id":"assertion.concept.nist.celltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cell tree as: A spatial access method where successive levels are split by arbitrary hyperplanes. Concave objects are decomposed into convex pieces. Each convex piece is indexed in every cell which it overlaps.","support":[{"end":247,"quote":"A\nspatial access method\nwhere successive levels are split by arbitrary hyperplanes.  Concave objects are decomposed into convex pieces.  Each convex piece is indexed in every cell which it overlaps.","source_id":"nist-dads.celltree","source_sha256":"d12cc300762883155ac35e85eeff0b76eedd82e2dfc4ee05a2b90e703f8cf459","start":49}],"target_id":"concept.nist.celltree","target_kind":"node","target_sha256":"0b99643c73fad40c89e459dfd484831176f3cacae0eab284ef3c1a6c746fdc88"}],"concept.nist.cellulartmtn":[{"id":"assertion.concept.nist.cellulartmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cellular automaton as: Usually a two-dimensional organization of simple finite state machines whose next state depends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","support":[{"end":371,"quote":"Usually a\ntwo-dimensional\norganization of simple\nfinite state machines\nwhose next\nstate\ndepends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","source_id":"nist-dads.cellulartmtn","source_sha256":"5d73333eb1ffc1855df81389715a88a518a8004b0e1716916e792ef1ae7ec340","start":63}],"target_id":"concept.nist.cellulartmtn","target_kind":"node","target_sha256":"4a5df3010a723579a8ad5e3541d5a136fb7a7e837360df26fba8546ad82922e6"}],"concept.nist.centroid":[{"id":"assertion.concept.nist.centroid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines centroid as: The center of gravity or center of mass of an object.","support":[{"end":96,"quote":"The center of gravity or center of mass of an object.","source_id":"nist-dads.centroid","source_sha256":"64eaf8395527b2ddfe7fd5d17261eee2a12cad4e2e702d1bd5d457c6b036e95b","start":43}],"target_id":"concept.nist.centroid","target_kind":"node","target_sha256":"71471e049fe994880bab14f577cf9840a138731f3b2fe699b73d42d3f9c7f84e"}],"concept.nist.certificate":[{"id":"assertion.concept.nist.certificate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines certificate as: (1) Extra information so the correctness of an answer to a decision problem can be quickly checked. (2) For any graph property P and graph G, a certificate for G is a graph G' such that G has property P if and only if G' has the property.","support":[{"end":288,"quote":"(1) Extra information so the correctness of an answer to a\ndecision problem\ncan be quickly checked.  (2) For any graph property\nP\nand\ngraph\nG, a certificate for G is a graph G' such that G has property\nP\nif and only if G' has the property.","source_id":"nist-dads.certificate","source_sha256":"5e0172b0cd754228b3e0a138be0929f501fbd709723f85ae81a32f1bfb6ae211","start":49}],"target_id":"concept.nist.certificate","target_kind":"node","target_sha256":"e01a82a6ab3f5ee68ef6e52cbad63c6751ef7cee8efe9b50ec3c6c82af7c0d01"}],"concept.nist.chain":[{"id":"assertion.concept.nist.chain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chain as: A set with a total order .","support":[{"end":63,"quote":"A\nset\nwith a\ntotal order\n.","source_id":"nist-dads.chain","source_sha256":"f582ca1d528f359ba336bc63fe31aec640639824211b158bf434e01918c88b2e","start":37}],"target_id":"concept.nist.chain","target_kind":"node","target_sha256":"c97ba85cc695ed2f0bcc9eca621c0289b3e4c25528746cc1510effe7247ce0f9"}],"concept.nist.chaining":[{"id":"assertion.concept.nist.chaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chaining as: A class of collision resolution schemes in which linked lists handle collisions in a hash table . The two main subclasses are separate chaining , where lists are outside the table, and coalesced chaining , where the lists are within the table.","support":[{"end":291,"quote":"A class of\ncollision resolution schemes\nin which\nlinked lists\nhandle\ncollisions\nin a\nhash table\n.  The two main subclasses are\nseparate chaining\n, where lists are outside the table, and\ncoalesced chaining\n, where the lists are within the table.","source_id":"nist-dads.chaining","source_sha256":"f3af18f63ae39895f3a1d527d1258a03d554bb16a2329814686a9b74b6dc1c11","start":47}],"target_id":"concept.nist.chaining","target_kind":"node","target_sha256":"faa02b3ccc7c52b5c26177658878af6687c9d82004b5b7f1336ce07abb325ffb"}],"concept.nist.child":[{"id":"assertion.concept.nist.child","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines child as: A node of a tree referred to by a parent node. See the figure at tree . Every node, except the root , is the child of some parent.","support":[{"end":169,"quote":"A\nnode\nof a\ntree\nreferred to by a\nparent\nnode.  See the figure at\ntree\n.  Every node, except the\nroot\n, is the child of some parent.","source_id":"nist-dads.child","source_sha256":"ac05717364862e672ef97a2871327a4d981d49fe0334b5db0c07b20bd076d2c0","start":37}],"target_id":"concept.nist.child","target_kind":"node","target_sha256":"552843be98abeeef5acae2d5bb6e1fe703d9f14c6570b359d445e6cdfd3dab1e"}],"concept.nist.chinesepostman":[{"id":"assertion.concept.nist.chinesepostman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Chinese postman problem as: Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete .","support":[{"end":248,"quote":"Find a minimum length closed\nwalk\nthat traverses each\nedge\nat least once.  Finding an optimal solution in a graph with both\ndirected\nand\nundirected\nedges is\nNP-complete\n.","source_id":"nist-dads.chinesepostman","source_sha256":"303ec4e3f7f2e13c84bac0b3ab726d82e47d6ccf46feef9cec8431ebf301f519","start":78}],"target_id":"concept.nist.chinesepostman","target_kind":"node","target_sha256":"a7c6b074c35c89c284acb3e3c2104f389261a023ecda73e5c2a4c60df9bc84de"}],"concept.nist.chromatcnmbr":[{"id":"assertion.concept.nist.chromatcnmbr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chromatic number as: The minimum number of colors needed to color the vertices of a graph such that no two adjacent vertices have the same color.","support":[{"end":183,"quote":"The minimum number of colors needed to color the\nvertices\nof a\ngraph\nsuch that no two\nadjacent\nvertices have the same color.","source_id":"nist-dads.chromatcnmbr","source_sha256":"1ac1c57df36b622f598be5d609ad67c0891bad207cd9b7bd66bb5f97cf79d252","start":59}],"target_id":"concept.nist.chromatcnmbr","target_kind":"node","target_sha256":"70528932e93ea90333b2e6b4be471e82520918c95d35bb0fd40e7644f18bf770"}],"concept.nist.chromaticndx":[{"id":"assertion.concept.nist.chromaticndx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines chromatic index as: The minimum number of colors needed to color the edges of a graph .","support":[{"end":124,"quote":"The minimum number of colors needed to color the\nedges\nof a\ngraph\n.","source_id":"nist-dads.chromaticndx","source_sha256":"690db6ba3dd7dedfe8026718762a96541c8a50945f5e2a1267284949b27d38d6","start":57}],"target_id":"concept.nist.chromaticndx","target_kind":"node","target_sha256":"3bb1ca0ae85340000a590264be6a9de859f4f05057da30b951cfd811f32baebc"}],"concept.nist.circuit":[{"id":"assertion.concept.nist.circuit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines circuit as: (1) An acyclic network of inputs, logic gates, and outputs. Contrasted with a Turing machine , it has no memory. (2) A cycle in a graph .","support":[{"end":179,"quote":"(1) An\nacyclic\nnetwork of inputs, logic gates, and outputs.  Contrasted with a\nTuring machine\n, it has no memory. (2) A\ncycle\nin a\ngraph\n.","source_id":"nist-dads.circuit","source_sha256":"5c435c53d3a56f31be4b3817ab54da17dd16eadade7759f24984072f3bc54853","start":41}],"target_id":"concept.nist.circuit","target_kind":"node","target_sha256":"0ddfa76c70bcb138aa2a7f678ca0986cfe5c5b69c58e508b62319275d9b23ad1"}],"concept.nist.circuitcomplexity":[{"id":"assertion.concept.nist.circuitcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines circuit complexity as: The study of the size, depth, and other attributes of circuits that decide specified languages or compute specified functions.","support":[{"end":189,"quote":"The study of the size, depth, and other attributes of\ncircuits\nthat decide specified languages or compute specified functions.","source_id":"nist-dads.circuitcomplexity","source_sha256":"16d0d15d03af910536783ac928cecbbcb684a67caee217eb077f0d6cd012c19e","start":63}],"target_id":"concept.nist.circuitcomplexity","target_kind":"node","target_sha256":"0f3bef7a6ecdda9ab3ec5669c8e2d4ecf4b9a94fffb259cfb85c8fbc4767e108"}],"concept.nist.circularlist":[{"id":"assertion.concept.nist.circularlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines circular list as: A variant of a linked list in which the nominal tail is linked to the head . The entire list may be accessed starting at any item and following links until one comes to the starting item again.","support":[{"end":251,"quote":"A variant of a\nlinked list\nin which the nominal\ntail\nis linked to the\nhead\n.  The entire list may be accessed starting at any item and following\nlinks\nuntil one comes to the starting item again.","source_id":"nist-dads.circularlist","source_sha256":"d9f5652453b57017b967395e5d9a9e34d375c3ed4e8af8259a8faec985b3e5dc","start":57}],"target_id":"concept.nist.circularlist","target_kind":"node","target_sha256":"ce2082290b4545ecb392d7f99570adb09bff89f194ee6aa1a975125fd30fcdca"}],"concept.nist.circularqueue":[{"id":"assertion.concept.nist.circularqueue","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines circular queue as: An implementation of a bounded queue using an array .","support":[{"end":112,"quote":"An implementation of a\nbounded queue\nusing an\narray\n.","source_id":"nist-dads.circularqueue","source_sha256":"c0bebf3f9a0f6603640db84205affe91c7c172ed9b3ac83761d4a844e0da070f","start":59}],"target_id":"concept.nist.circularqueue","target_kind":"node","target_sha256":"9628fd89c74a8d53b74c0d89320505f3411e79d89148d6911575f8d6ba6e0341"}],"concept.nist.clique":[{"id":"assertion.concept.nist.clique","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clique as: A set of vertices in an undirected graph in which there is an edge between every pair of vertices. In other words, a subgraph that is complete .","support":[{"end":183,"quote":"A set of\nvertices\nin an\nundirected graph\nin which there is an\nedge\nbetween every pair of vertices. In other words, a subgraph that is\ncomplete\n.","source_id":"nist-dads.clique","source_sha256":"7a876f684b461b08129615bb3d515a5b4ee39d6e567631cffefa31c49b7bb6ca","start":39}],"target_id":"concept.nist.clique","target_kind":"node","target_sha256":"be070b7e9d198fe96abbe5d7c024cfc902da9aedd0c6002753506d74572ba498"}],"concept.nist.cliqueproblm":[{"id":"assertion.concept.nist.cliqueproblm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clique problem as: Find the largest clique in an undirected graph .","support":[{"end":108,"quote":"Find the largest\nclique\nin an\nundirected graph\n.","source_id":"nist-dads.cliqueproblm","source_sha256":"6972a06b8e22293e5034b4c4490e78b3dcd436a29d6639b4703ddd94d0e7bfef","start":60}],"target_id":"concept.nist.cliqueproblm","target_kind":"node","target_sha256":"94307fb02cca7b885d4056584daf2530074d2d4b4eda9b4eb011a79437f1eec2"}],"concept.nist.clustering":[{"id":"assertion.concept.nist.clustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clustering as: The tendency for entries in a hash table using open addressing to be stored together, even when the table has ample empty space to spread them out.","support":[{"end":194,"quote":"The tendency for entries in a\nhash table\nusing\nopen addressing\nto be stored together, even when the table has ample empty space to spread them out.","source_id":"nist-dads.clustering","source_sha256":"532d08a4b37f05159c83eb8698a4fcf77542401196b4a724204875419eea946c","start":47}],"target_id":"concept.nist.clustering","target_kind":"node","target_sha256":"f254318eb5277ade76f9d75a91e8b17505915825038b88b86ad14032b8c37c20"}],"concept.nist.clusteringfree":[{"id":"assertion.concept.nist.clusteringfree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines clustering free as: When a collision resolution scheme spreads out entries in a hash table .","support":[{"end":129,"quote":"When a\ncollision resolution scheme\nspreads out entries in a\nhash table\n.","source_id":"nist-dads.clusteringfree","source_sha256":"f4f01ac56553d8573181aa9065a50a1b39e67ff8cfa055499cf91d7bd80fc8df","start":57}],"target_id":"concept.nist.clusteringfree","target_kind":"node","target_sha256":"8ec3722c471143e0f19f403038dccfcd5ada12c8d8364c5687a8a980eeacd932"}],"concept.nist.coalescedchaining":[{"id":"assertion.concept.nist.coalescedchaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coalesced chaining as: A scheme in which linked lists within the hash table handle collisions . An item that collides is put in the next empty place in the array and added to the end of a list embedded in the array items. Any open addressing method to compute possible new positions may be used to find the \"next\" empty place.","support":[{"end":372,"quote":"A scheme in which\nlinked lists\nwithin the\nhash table\nhandle\ncollisions\n.  An item that collides is put in the next empty place in the array and added to the end of a\nlist\nembedded in the array items.  Any\nopen addressing\nmethod to compute possible new positions may be used to find the \"next\" empty place.","source_id":"nist-dads.coalescedchaining","source_sha256":"ea29ba9f0b2f83e23b0965bbcaf7fc12f434c36fbe13d63f65a56880674177d6","start":67}],"target_id":"concept.nist.coalescedchaining","target_kind":"node","target_sha256":"4adaf961f33e28bf0bf0198573dfa93a1384c8818082ea49e2d2366ccf7ffbe1"}],"concept.nist.coarsening":[{"id":"assertion.concept.nist.coarsening","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coarsening as: To alter a problem, typically restricting it to a less complex feasible region or objective function , so that the resulting problem can be efficiently solved, usually by dynamic programming .","support":[{"end":239,"quote":"To alter a problem, typically restricting it to a less complex\nfeasible region\nor\nobjective function\n, so that the resulting problem can be efficiently solved, usually by\ndynamic programming\n.","source_id":"nist-dads.coarsening","source_sha256":"63146b4289497676b68eb41423c273821517cd2be71e383495cc565829d0f213","start":47}],"target_id":"concept.nist.coarsening","target_kind":"node","target_sha256":"84667eb159f197b3ba83fe61d2de689941f2f8b9d1a243d2f166b0d1dec9dc2d"}],"concept.nist.codeword":[{"id":"assertion.concept.nist.codeword","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines codeword as: Sequence of bits of a code corresponding to a symbol.","support":[{"end":96,"quote":"Sequence of bits of a code corresponding to a symbol.","source_id":"nist-dads.codeword","source_sha256":"0824d7609e4a64f1bff7df5dfe80b57ca316e447a69c96364b308f5249dff4c3","start":43}],"target_id":"concept.nist.codeword","target_kind":"node","target_sha256":"776397c1d6f99425acf80e16b8e094db16450ac74c9a60eeb95a6128b7fcc6ac"}],"concept.nist.codingtree":[{"id":"assertion.concept.nist.codingtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines coding tree as: A full binary tree that represents a coding, such as produced by Huffman coding . Each leaf is an encoded symbol. The path from the root to a leaf is its codeword.","support":[{"end":218,"quote":"A\nfull binary tree\nthat represents a coding, such as produced by\nHuffman coding\n.  Each\nleaf\nis an encoded symbol.  The\npath\nfrom the\nroot\nto a leaf is its codeword.","source_id":"nist-dads.codingtree","source_sha256":"63b990b3b273e12a707d49f008ae90cc6db8813c4128e29212393d97b9679518","start":53}],"target_id":"concept.nist.codingtree","target_kind":"node","target_sha256":"8c8836d3fae0adbdf3cbe3a0f4013d2997d3aa5aa7d0153355b4252c847721c7"}],"concept.nist.collatzproblem":[{"id":"assertion.concept.nist.collatzproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Collatz problem as: Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","support":[{"end":213,"quote":"Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","source_id":"nist-dads.collatzproblem","source_sha256":"127e9fe114d16db16f1be0a54fc899e488e32f95332b54f6d65a740330796be9","start":62}],"target_id":"concept.nist.collatzproblem","target_kind":"node","target_sha256":"84bb242f691716b1f7f998afa6cc9d5d58c7a00c4efd24f25f6f1e5a896f9e68"}],"concept.nist.collision":[{"id":"assertion.concept.nist.collision","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collision as: When two or more items should be kept in the same location, especially in hash tables , that is, when two or more different keys hash to the same value.","support":[{"end":197,"quote":"When two or more items should be kept in the same location, especially in\nhash tables\n, that is, when two or more different\nkeys\nhash\nto the same value.","source_id":"nist-dads.collision","source_sha256":"e531f11fc8476f5ca49ffa81687e10c7129b7e1e7bf16d4cdc48e58e1db3bbba","start":45}],"target_id":"concept.nist.collision","target_kind":"node","target_sha256":"41eb97f2a909a8bc181ab42d76b68661e9e1cb20c918a4379d1df3bfd27e9d0a"}],"concept.nist.communseqpro":[{"id":"assertion.concept.nist.communseqpro","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Communicating Sequential Processes as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. Commonly known as CSP.","support":[{"end":203,"quote":"C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation.  Commonly known as CSP.","source_id":"nist-dads.communseqpro","source_sha256":"02a81461b5014b004138f32398a7b01fb1ad54ac17b0b5c10a704f7148d3b805","start":95}],"target_id":"concept.nist.communseqpro","target_kind":"node","target_sha256":"f3ba991707b94806b767101019a4ff9ba15c30d3eb3a9b22492f554cabdaaa63"}],"concept.nist.commutative":[{"id":"assertion.concept.nist.commutative","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines commutative as: A function where f(A, B) = f(B, A).","support":[{"end":84,"quote":"A function where f(A, B) = f(B, A).","source_id":"nist-dads.commutative","source_sha256":"caeb94b2dd8bbc1f632e0825ae2674dfaa6feb1c4294a0e6478e773c9e8c3fab","start":49}],"target_id":"concept.nist.commutative","target_kind":"node","target_sha256":"44c6f59d0cc0335f35917cb75d32ade7e36502afb98dbe25ccfbee8c605d32c7"}],"concept.nist.compactdatastruct":[{"id":"assertion.concept.nist.compactdatastruct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact data structure as: A data structure that needs far less space and allows efficient access without decompression.","support":[{"end":164,"quote":"A\ndata structure\nthat needs far less space and allows efficient access without decompression.","source_id":"nist-dads.compactdatastruct","source_sha256":"11170a432ff5e56adeb4c6a220ed790f2fef3e4cc2a5692f896c4b02c3a59b46","start":71}],"target_id":"concept.nist.compactdatastruct","target_kind":"node","target_sha256":"b6271a0c7949ae7bf03e6ab880a1295f3174fd29591642e6c789121d2f82a060"}],"concept.nist.compactdawg":[{"id":"assertion.concept.nist.compactdawg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact DAWG as: A directed acyclic word graph (DAWG) representing the suffixes of a given string in which each edge is labeled with the longest possible string. The strings along a path from the root to a node are the substring which the node represents.","support":[{"end":294,"quote":"A\ndirected acyclic\nword graph (DAWG) representing the\nsuffixes\nof a given\nstring\nin which each\nedge\nis labeled with the longest possible string.  The strings along a\npath\nfrom the\nroot\nto a\nnode\nare the\nsubstring\nwhich the\nnode\nrepresents.","source_id":"nist-dads.compactdawg","source_sha256":"66010fc268532b238db35c2acd953d16de58d6f6078154b232a8db20e6be839a","start":55}],"target_id":"concept.nist.compactdawg","target_kind":"node","target_sha256":"e4f65dffc7737a8d08761b79e2074ab6a1d6f02f2e11352e2d214a9c9aa75d75"}],"concept.nist.compacttrie":[{"id":"assertion.concept.nist.compacttrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compact trie as: A trie in which nonbranching subtrees leading to leaf nodes are cut off.","support":[{"end":127,"quote":"A\ntrie\nin which nonbranching subtrees leading to\nleaf\nnodes are cut off.","source_id":"nist-dads.compacttrie","source_sha256":"34faf87d452a97d9ece6826639c4b3f8db64b456d842496e85b5f0599f24d25b","start":55}],"target_id":"concept.nist.compacttrie","target_kind":"node","target_sha256":"8efd91e1ac10b7bc2cc993232978885d011f3df6a5061ee8ccfc7e82d279f92e"}],"concept.nist.comparisnsrt":[{"id":"assertion.concept.nist.comparisnsrt","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines comparison sort as: Any sort algorithm using comparisons between keys , and nothing else about the keys, to arrange items in a predetermined order. An alternative is a restricted universe sort such as counting sort or bucket sort .","support":[{"end":269,"quote":"Any\nsort\nalgorithm using comparisons between\nkeys\n, and nothing else about the keys, to arrange items in a predetermined order.  An alternative is a\nrestricted universe sort\nsuch as\ncounting sort\nor\nbucket sort\n.","source_id":"nist-dads.comparisnsrt","source_sha256":"1ed3cfd1ae15f4f921467eda7306be0f937c3343abefc492f39e4e24c61671ad","start":57}],"target_id":"concept.nist.comparisnsrt","target_kind":"node","target_sha256":"0e3b900f46f8ef23a5b13ed8d7fad31e5622460b53423b2337b4f77576496a37"}],"concept.nist.competitiveanalysis":[{"id":"assertion.concept.nist.competitiveanalysis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines competitive analysis as: An analysis in which the performance of an on-line algorithm is compared to the best that could have been achieved if all the inputs had been known in advance.","support":[{"end":226,"quote":"An analysis in which the performance of an\non-line algorithm\nis compared to the best that could have been achieved if all the inputs had been known in advance.","source_id":"nist-dads.competitiveanalysis","source_sha256":"ae295873ad8fa34de41b22a3660a47806f9fc7039c0915b2f92c2f1bd4c2b3ad","start":67}],"target_id":"concept.nist.competitiveanalysis","target_kind":"node","target_sha256":"ae42fe584bc467256fa7668df335b34e6c23a75f641f776a59ad61a874cc6af4"}],"concept.nist.competitivrt":[{"id":"assertion.concept.nist.competitivrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines competitive ratio as: The worst case of the ratio between the cost incurred by an on-line algorithm and the best-case cost .","support":[{"end":163,"quote":"The\nworst case\nof the ratio between the cost incurred by an\non-line algorithm\nand the\nbest-case cost\n.","source_id":"nist-dads.competitivrt","source_sha256":"95dfc9d44cd160353deb97e795bac68ec4cf75163884536bff33944aeae78f2d","start":61}],"target_id":"concept.nist.competitivrt","target_kind":"node","target_sha256":"c9dda9cce19370c3b11f603097347a224eb233991b93417de5d249618136c139"}],"concept.nist.complement":[{"id":"assertion.concept.nist.complement","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complement as: (1) Of a boolean , 0 if 1, or 1 if 0. See not . (2) Of a set A, a set having all the members which are in the universe , but not in A.","support":[{"end":183,"quote":"(1) Of a\nboolean\n, 0 if 1, or 1 if 0.  See\nnot\n.  (2) Of a\nset\nA, a set having all the members which are in the\nuniverse\n, but not in A.","source_id":"nist-dads.complement","source_sha256":"38091fb54fefc5809581375527729aded5d6d50063495247dad903f6dcf6e639","start":47}],"target_id":"concept.nist.complement","target_kind":"node","target_sha256":"76550f030ec5b185561ec5ef22d77f5da1582e3f065c742d694eb1d890d3ef9b"}],"concept.nist.completebinarytree":[{"id":"assertion.concept.nist.completebinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complete binary tree as: A binary tree in which every level (depth), except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible.","support":[{"end":245,"quote":"A\nbinary tree\nin which every\nlevel\n(depth), except possibly the deepest, is completely filled.  At depth n, the\nheight\nof the tree, all\nnodes\nmust be as far left as possible.","source_id":"nist-dads.completebinarytree","source_sha256":"eddff42d46193570d031d16204c3922bc2d8b9eac95df9266195aaddbc6d3b74","start":71}],"target_id":"concept.nist.completebinarytree","target_kind":"node","target_sha256":"7c2e7a776b47aeaf0872ef808bbf767ec4ca8d24616cdcc9ad468f90763813a6"}],"concept.nist.completegraph":[{"id":"assertion.concept.nist.completegraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines complete graph as: An undirected graph with an edge between every pair of vertices .","support":[{"end":120,"quote":"An\nundirected graph\nwith an\nedge\nbetween every pair of\nvertices\n.","source_id":"nist-dads.completegraph","source_sha256":"598a2cc31e9af6e904ce41811644a5492c30483db2b8e13ab2ed535ac01bfa4d","start":55}],"target_id":"concept.nist.completegraph","target_kind":"node","target_sha256":"5374b9773559064b23e4443ccc8101d9a7e3056ee31c184193d3e5c5ea2011c0"}],"concept.nist.completetree":[{"id":"assertion.concept.nist.completetree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complete tree as: A tree in which every level , except possibly the deepest, is entirely filled. At depth n, the height of the tree, all nodes are as far left as possible.","support":[{"end":211,"quote":"A\ntree\nin which every\nlevel\n, except possibly the deepest, is entirely filled.  At\ndepth\nn, the\nheight\nof the tree, all\nnodes\nare as far left as possible.","source_id":"nist-dads.completetree","source_sha256":"b9e3308b3f72298b68a0324866571867729c865ff19c88b4270033084f21ceeb","start":57}],"target_id":"concept.nist.completetree","target_kind":"node","target_sha256":"b338be0e522f51c134bea02c2ae6e3b4ebef4dcfd4bf07caaf59b6f033054cc3"}],"concept.nist.complexity":[{"id":"assertion.concept.nist.complexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complexity as: The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an algorithm .","support":[{"end":185,"quote":"The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an\nalgorithm\n.","source_id":"nist-dads.complexity","source_sha256":"38a875a6bd9d82bfd3d38257939c3df23cccfcda951027a28b73a106ad7f1687","start":47}],"target_id":"concept.nist.complexity","target_kind":"node","target_sha256":"1d067b94f1e47053f252bc51b2da38848a938dfacb0a3cfce7a3a5081a42b3f5"}],"concept.nist.complexityclass":[{"id":"assertion.concept.nist.complexityclass","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines complexity class as: Any of a set of computational problems with the same bounds ( Θ(n) ) on time and space, for deterministic and nondeterministic machines.","support":[{"end":195,"quote":"Any of a set of computational problems with the same bounds (\nΘ(n)\n) on time and space, for deterministic and nondeterministic machines.","source_id":"nist-dads.complexityclass","source_sha256":"f4c30ba8c5dfbf849dd95394473cfab1199926d139f6b877debe424643023d6d","start":59}],"target_id":"concept.nist.complexityclass","target_kind":"node","target_sha256":"3f186f3c06ed05119f3b81f0316279c4ed6194542ecf6956010539f1f1009e6d"}],"concept.nist.compoundalgorithm":[{"id":"assertion.concept.nist.compoundalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines compound algorithm as: An algorithm in which one or more of the computable steps is a call to execute another algorithm.","support":[{"end":160,"quote":"An\nalgorithm\nin which one or more of the computable steps is a call to execute another algorithm.","source_id":"nist-dads.compoundalgorithm","source_sha256":"f990c636213b26381892beb6ed5da234ec583516217cfd6ab0a79d1d0c5cd41f","start":63}],"target_id":"concept.nist.compoundalgorithm","target_kind":"node","target_sha256":"08e22bbb1bde5d21af1b416ac2e71a00d838ac256b9c93c2cf7204d73cb01d61"}],"concept.nist.computable":[{"id":"assertion.concept.nist.computable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines computable as: A function that can be computed by an algorithm --- equivalently, by a Turing machine .","support":[{"end":134,"quote":"A\nfunction\nthat can be computed by an\nalgorithm\n--- equivalently, by a\nTuring machine\n.","source_id":"nist-dads.computable","source_sha256":"0007ea23e232d0447076e22ca306ca0d1c18779c9037bfbc921575f5dc787bd8","start":47}],"target_id":"concept.nist.computable","target_kind":"node","target_sha256":"ac683645fe9f73095de13d84e60afbda63f5a46dd83328ebd1067dfff4e18019"}],"concept.nist.concurrentdatastructure":[{"id":"assertion.concept.nist.concurrentdatastructure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent data structure as: A data structure designed to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","support":[{"end":220,"quote":"A\ndata structure\ndesigned to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","source_id":"nist-dads.concurrentdatastructure","source_sha256":"570da39670b5de2406eaa57ca098d76ebc739f877a98941c05a63a3f3be433bb","start":77}],"target_id":"concept.nist.concurrentdatastructure","target_kind":"node","target_sha256":"d8f82027583d4ac72b6a6e872d4bcca019b6553836cc23e6da02027beee5b209"}],"concept.nist.concurrentreadconwrt":[{"id":"assertion.concept.nist.concurrentreadconwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent read, concurrent write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location. Also known as CRCW.","support":[{"end":298,"quote":"A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location.\nAlso known as\nCRCW.","source_id":"nist-dads.concurrentreadconwrt","source_sha256":"fdecabdb67e64f846421cba075aaafbb5ea4f1dd77369351984e3cb54840e130","start":93}],"target_id":"concept.nist.concurrentreadconwrt","target_kind":"node","target_sha256":"ef25735c1370418eb4661745d951983ce5ba6d8651b5328ad255dce9e72f0838"}],"concept.nist.concurrentreadexcluwrt":[{"id":"assertion.concept.nist.concurrentreadexcluwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent read, exclusive write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time. Also known as CREW.","support":[{"end":291,"quote":"A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time.\nAlso known as\nCREW.","source_id":"nist-dads.concurrentreadexcluwrt","source_sha256":"0d671dca0c3836cc538a1e47224c54d48fcfe9adf70c8050e5590f5c292f2f3e","start":91}],"target_id":"concept.nist.concurrentreadexcluwrt","target_kind":"node","target_sha256":"bd449ff1fc0cd0d6b5b1072684da0b4ef4e28722ce0f6bf936365cd681a4437c"}],"concept.nist.concurrntflw":[{"id":"assertion.concept.nist.concurrntflw","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines concurrent flow as: A multi-commodity flow in which the same fraction of the demand of each commodity is satisfied.","support":[{"end":152,"quote":"A\nmulti-commodity flow\nin which the same fraction of the demand of each commodity is satisfied.","source_id":"nist-dads.concurrntflw","source_sha256":"335bd17302482580a7544d79caaefda5276fc3306165475d7feef1cfbfd0bb71","start":57}],"target_id":"concept.nist.concurrntflw","target_kind":"node","target_sha256":"8e7f0d36236a7b63556fa16a2a2502f7cb1c7dcfb05ede20d47336b3cc007e89"}],"concept.nist.confluentlypersistdata":[{"id":"assertion.concept.nist.confluentlypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines confluently persistent data structure as: A fully persistent data structure that allows meld or merge operations to combine two different versions.","support":[{"end":206,"quote":"A fully\npersistent data structure\nthat allows meld or merge operations to combine two different versions.","source_id":"nist-dads.confluentlypersistdata","source_sha256":"1112cdbbe68f3f0f4deec52eff1a3f4c480490fa13da94ef0846ae528213fbdf","start":101}],"target_id":"concept.nist.confluentlypersistdata","target_kind":"node","target_sha256":"421cfabe13317bd422eb34150fcf5217b9c870294e32dd737860ecf3374b78cc"}],"concept.nist.conjunction":[{"id":"assertion.concept.nist.conjunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines conjunction as: The boolean and function.","support":[{"end":74,"quote":"The boolean\nand\nfunction.","source_id":"nist-dads.conjunction","source_sha256":"7cca97bbb5f3ca023ec13715b2ce6ecfdbe1870d7c592380a85922609fa8d32f","start":49}],"target_id":"concept.nist.conjunction","target_kind":"node","target_sha256":"d8c451b4ea5b88c9dee4b5448f2c39ee4e431bd73b8656c29cc245f8627eff8e"}],"concept.nist.connectedcomponents":[{"id":"assertion.concept.nist.connectedcomponents","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines connected components as: The set of maximally connected components of an undirected graph .","support":[{"end":133,"quote":"The\nset\nof\nmaximally connected components\nof an\nundirected graph\n.","source_id":"nist-dads.connectedcomponents","source_sha256":"5f5f4a196cfcc4148ea9c35b657130e7057723228a205b1220725371dced113e","start":67}],"target_id":"concept.nist.connectedcomponents","target_kind":"node","target_sha256":"0a43ca0fdc2669611ff28844fd7f4f5525b7f0b0e6403780ffe66a8f58f6dc85"}],"concept.nist.connectedgraph":[{"id":"assertion.concept.nist.connectedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines connected graph as: An undirected graph that has a path between every pair of vertices .","support":[{"end":125,"quote":"An\nundirected graph\nthat has a\npath\nbetween every pair of\nvertices\n.","source_id":"nist-dads.connectedgraph","source_sha256":"8008f37fe8e1dc935f9ead1c9b10110769738ac29b22d83e8a62b3c031e068f3","start":57}],"target_id":"concept.nist.connectedgraph","target_kind":"node","target_sha256":"8e696504dae60645f54fcc2295239e41cb0734644f0db9bc32425d7c05c1fbc2"}],"concept.nist.constantfunc":[{"id":"assertion.concept.nist.constantfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines constant function as: A function that always gives the same value.","support":[{"end":105,"quote":"A\nfunction\nthat always gives the same value.","source_id":"nist-dads.constantfunc","source_sha256":"dbb3327308a09b033010090592c0f50793ac01783b65b25496216c45248bd330","start":61}],"target_id":"concept.nist.constantfunc","target_kind":"node","target_sha256":"2d84153b4150187e5f28ae09f7d74b88a0458a4f6c454de867c6f15e6164df99"}],"concept.nist.cookreductin":[{"id":"assertion.concept.nist.cookreductin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Cook reduction as: A reduction computed by a deterministic polynomial time oracle Turing machine .","support":[{"end":134,"quote":"A\nreduction\ncomputed by a deterministic\npolynomial time\noracle Turing machine\n.","source_id":"nist-dads.cookreductin","source_sha256":"126139087680f4faa7156a76c3147b54ad85e0e9fa3e200fffed6bd16abb3a9e","start":55}],"target_id":"concept.nist.cookreductin","target_kind":"node","target_sha256":"8d723160be9bfb4f17ad9a400724f3e3f448a2b1efcba4b12d66e08bd098b111"}],"concept.nist.cookstheorem":[{"id":"assertion.concept.nist.cookstheorem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Cook's theorem as: The language SAT of satisfiable Boolean formulas is NP-complete .","support":[{"end":120,"quote":"The language SAT of satisfiable Boolean formulas is\nNP-complete\n.","source_id":"nist-dads.cookstheorem","source_sha256":"17763d089619e80fafbb2a171dca6a71762e61ca7a455226da23bbd08446deb2","start":55}],"target_id":"concept.nist.cookstheorem","target_kind":"node","target_sha256":"baae8fcc934144f5cfeb3c86366fdf51ecafc9a6c2f3a621e5e327678e71b20c"}],"concept.nist.covering":[{"id":"assertion.concept.nist.covering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines covering as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","support":[{"end":171,"quote":"Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","source_id":"nist-dads.covering","source_sha256":"6b006c0284cbae373a73f47cd0da38ddd2d41c29c0ef39edf0f8dae85f57d863","start":43}],"target_id":"concept.nist.covering","target_kind":"node","target_sha256":"1dd5021d8536ec9416587893b0ab066e8627c2eca86f319c7e2a65729dfd7d0a"}],"concept.nist.criticalpath":[{"id":"assertion.concept.nist.criticalpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines critical path problem as: Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices .","support":[{"end":204,"quote":"Find the longest\npath\nfrom any\nsource\nto any\nsinks\nin a\ndirected acyclic graph\nwhich has weights, or numeric values, on\nvertices\n.","source_id":"nist-dads.criticalpath","source_sha256":"4eeea091b0b8a522d05c1290f0e4ca2a59625f7e7d17ad202b72f70342e8149f","start":74}],"target_id":"concept.nist.criticalpath","target_kind":"node","target_sha256":"23b33fbd68570d88292d3b3cde195b0f726c5df0cbc37e2235ad921d4d5c6a3d"}],"concept.nist.csp":[{"id":"assertion.concept.nist.csp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CSP as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. An acronym for Communicating Sequential Processes.","support":[{"end":169,"quote":"C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation.  An acronym for Communicating Sequential Processes.","source_id":"nist-dads.csp","source_sha256":"91ecf279b67a9981ea7f5413edd19040f7a80a2f918895b373e57016a0c5855c","start":33}],"target_id":"concept.nist.csp","target_kind":"node","target_sha256":"0a8223638e48b9493b1cdc0d1fd5ccc0dce8b676321df644d07cb84b2d8cda46"}],"concept.nist.ctl":[{"id":"assertion.concept.nist.ctl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CTL as: A propositional, branching-time temporal logic for which formulas can be checked in linear time. An acronym for Computation Tree Logic.","support":[{"end":170,"quote":"A propositional, branching-time temporal logic for which formulas can be checked in\nlinear\ntime.  An acronym for Computation  Tree Logic.","source_id":"nist-dads.ctl","source_sha256":"1f3d78ac33116197df2933c2f6a89bb5908080577796797c5dc46e0553a968ad","start":33}],"target_id":"concept.nist.ctl","target_kind":"node","target_sha256":"b31c03c96d617dbdd9dfbfe9093796bc1b737764df0d13bc6b443f73c8350919"}],"concept.nist.cuckoohashing":[{"id":"assertion.concept.nist.cuckoohashing","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines cuckoo hashing as: A dictionary implemented with two hash tables , T 1 and T 2 , and two different hash functions , h 1 and h 2 . Each key , k, is either in T 1 [h 1 (k)] or T 2 [h 2 (k)]. A new key , k, is stored in T 1 [h 1 (k)]. If that location is already occupied by another key, l, the other key is moved to T 2 [h 2 (l)]. Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed. For tables that are a bit less than half full and with carefully chosen universal hashing functions, performance is good. A key is deleted by removing it from a table.","support":[{"end":719,"quote":"A\ndictionary\nimplemented with two\nhash tables\n, T\n1\nand T\n2\n, and two different\nhash functions\n, h\n1\nand h\n2\n.  Each\nkey\n, k, is either in T\n1\n[h\n1\n(k)] or T\n2\n[h\n2\n(k)].  A new\nkey\n, k, is stored in T\n1\n[h\n1\n(k)].  If that location is already occupied by another key, l, the other key is moved to T\n2\n[h\n2\n(l)].  Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed.  For tables that are a bit less than half full and with carefully chosen\nuniversal hashing\nfunctions, performance is good.  A key is deleted by removing it from a table.","source_id":"nist-dads.cuckoohashing","source_sha256":"08250f3781e94dc4aa1928c1f02c950a6113fc8cfe40b19977715ff5373e2274","start":59}],"target_id":"concept.nist.cuckoohashing","target_kind":"node","target_sha256":"1a8af5c99954a3731595432a777342d789f21ea10d71f3374d9edaab42028de6"}],"concept.nist.cut":[{"id":"assertion.concept.nist.cut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cut as: A nonempty, proper subset of vertices of a graph .","support":[{"end":83,"quote":"A nonempty,\nproper subset\nof\nvertices\nof a\ngraph\n.","source_id":"nist-dads.cut","source_sha256":"729c8818f4719af73016240de31187e4ef84c23cf24eb30dc9e87262421cc0ec","start":33}],"target_id":"concept.nist.cut","target_kind":"node","target_sha256":"d549c214ed93771d2a596c44f31591d0456a172c2c45ae8cf08f80dae5f6807e"}],"concept.nist.cuttingplane":[{"id":"assertion.concept.nist.cuttingplane","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cutting plane as: A valid inequality for an integer polyhedron that separates the polyhedron from a given point outside it.","support":[{"end":158,"quote":"A valid inequality for an\ninteger polyhedron\nthat separates the polyhedron from a given point outside it.","source_id":"nist-dads.cuttingplane","source_sha256":"7e92349a62e89cbb07da5ea45c9de311d5412c9eb5aa9d3bcfc91900a4dd50de","start":53}],"target_id":"concept.nist.cuttingplane","target_kind":"node","target_sha256":"0edf69b6b1e3d825192cfc9539c8b9eb35e185e74c96902b0addd6273bb9a864"}],"concept.nist.cuttingstock":[{"id":"assertion.concept.nist.cuttingstock","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cutting stock problem as: Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem . It is NP-complete .","support":[{"end":255,"quote":"Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles.  This is a\ntwo-dimensional\nvariant of the\nbin packing problem\n.  It is\nNP-complete\n.","source_id":"nist-dads.cuttingstock","source_sha256":"afc4e9f5ca3b310efa895ffe10e72382e0eecb9b051c559d76bd8155326007e1","start":74}],"target_id":"concept.nist.cuttingstock","target_kind":"node","target_sha256":"c874e3115b8d37d5ceb84faf0507318d7751b96e3155e8d5155db3324a5556d0"}],"concept.nist.cutvertex":[{"id":"assertion.concept.nist.cutvertex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cut vertex as: A vertex whose deletion along with incident edges results in a graph with more components than the original graph. Also known as articulation point.","support":[{"end":195,"quote":"A\nvertex\nwhose deletion along with incident\nedges\nresults in a\ngraph\nwith more components than the original graph.\nAlso known as\narticulation point.","source_id":"nist-dads.cutvertex","source_sha256":"616b87f8dd30ecf0613f82f2b46385a38173c2ab1de96310a5781932596b534e","start":47}],"target_id":"concept.nist.cutvertex","target_kind":"node","target_sha256":"d445a9b8a0179d381cee1f6831470a7ecadc170a6e1500d9509450bb069a4635"}],"concept.nist.cycle":[{"id":"assertion.concept.nist.cycle","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines cycle as: A path that starts and ends at the same vertex and includes at least one edge .","support":[{"end":116,"quote":"A\npath\nthat starts and ends at the same\nvertex\nand includes at least one\nedge\n.","source_id":"nist-dads.cycle","source_sha256":"948e2444191ab96d7451252afd9bdd74e463c4c62e7881495396aadd19e5fe0a","start":37}],"target_id":"concept.nist.cycle","target_kind":"node","target_sha256":"bb7745b5cfd0ed66fbf4b358c481e1552a957b8ea2a9dccf9fbeefcfb5138574"}],"concept.nist.dadjacent":[{"id":"assertion.concept.nist.dadjacent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines D-adjacent as: An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","support":[{"end":156,"quote":"An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","source_id":"nist-dads.dadjacent","source_sha256":"c1860bfcf24ef9d607c9c8fccebf60e3a9c677a041dc843cfbb1081002b32e03","start":47}],"target_id":"concept.nist.dadjacent","target_kind":"node","target_sha256":"c9e0c906b3e0e43eb2c128d6c2f46a4da81a11b3c6c17cb36a4d18a0430e99ad"}],"concept.nist.datastructure":[{"id":"assertion.concept.nist.datastructure","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines data structure as: An organization of information, usually in memory, for better algorithm efficiency , such as queue , stack , linked list , heap , dictionary , and tree , or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree .","support":[{"end":371,"quote":"An organization of information, usually in memory, for better\nalgorithm\nefficiency\n, such as\nqueue\n,\nstack\n,\nlinked list\n,\nheap\n,\ndictionary\n, and\ntree\n, or conceptual unity, such as the name and address of a person.  It may include redundant information, such as length of the\nlist\nor number of\nnodes\nin a\nsubtree\n.","source_id":"nist-dads.datastructure","source_sha256":"a3179d5702ce2790bb2c0d52e5d4c32da237e36963373628c433177946e4e047","start":55}],"target_id":"concept.nist.datastructure","target_kind":"node","target_sha256":"ae053448ccb03f25a41664390e108d312f9f9f828afb892547c38bd27c117698"}],"concept.nist.decidablelanguage":[{"id":"assertion.concept.nist.decidablelanguage","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decidable language as: A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps --- equivalently, can be recognized by a Turing machine that halts for all inputs. Also known as recursive language, totally decidable language.","support":[{"end":323,"quote":"A language for which membership can be decided by an\nalgorithm\nthat halts on all inputs in a finite number of steps --- equivalently, can be recognized by a\nTuring machine\nthat halts for all inputs.\nAlso known as\nrecursive language, totally decidable language.","source_id":"nist-dads.decidablelanguage","source_sha256":"b6f672810917caa1f2846f04e08196557771ae1b86d31ce955222bf4cc82a642","start":63}],"target_id":"concept.nist.decidablelanguage","target_kind":"node","target_sha256":"4387332bd30cf64e697deebb6c5be55acec191f5d4dc89a2b141f6aee9b61331"}],"concept.nist.decidableproblem":[{"id":"assertion.concept.nist.decidableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decidable problem as: A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language . Also known as totally decidable problem, algorithmically solvable, recursively solvable.","support":[{"end":315,"quote":"A\ndecision problem\nthat can be solved by an\nalgorithm\nthat halts on all inputs in a finite number of steps.  The associated language is called a\ndecidable language\n.\nAlso known as\ntotally decidable problem, algorithmically solvable, recursively solvable.","source_id":"nist-dads.decidableproblem","source_sha256":"9baf40fbbbe0d37aefadbd54bd4c703cd9826059a616b606e483c323c70f0cf9","start":61}],"target_id":"concept.nist.decidableproblem","target_kind":"node","target_sha256":"c0e0c9be72899e0f3e608dcd0ed6420b52f10300053ffe0da26b984e3757308f"}],"concept.nist.decisionproblem":[{"id":"assertion.concept.nist.decisionproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decision problem as: A problem with a \"yes\" or \"no\" answer. Equivalently, a function whose range is two values, such as {0,1}.","support":[{"end":165,"quote":"A problem with a \"yes\" or \"no\" answer.  Equivalently, a\nfunction\nwhose\nrange\nis two values, such as {0,1}.","source_id":"nist-dads.decisionproblem","source_sha256":"655506206b7a607a03dbaa794796cd58c75af845dace17d2aee1521f4d8af820","start":59}],"target_id":"concept.nist.decisionproblem","target_kind":"node","target_sha256":"7bcff9336973c9b9703e98ef80759eeb1e9b553274b5ed0ef389793589ed2153"}],"concept.nist.decomposable":[{"id":"assertion.concept.nist.decomposable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines decomposable searching problem as: A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem. More formally a problem with a query Q is decomposable given if there exists an efficiently computable associative and commutative binary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","support":[{"end":481,"quote":"A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem.  More formally a problem with a query Q is decomposable given if there exists an efficiently computable\nassociative\nand\ncommutative\nbinary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","source_id":"nist-dads.decomposable","source_sha256":"8d7dda6aaf6bb8796790de2c694bc2f723c94436a055cc53c182ceb15806a16c","start":87}],"target_id":"concept.nist.decomposable","target_kind":"node","target_sha256":"e36799cc643280780a4e82c12325bd12f8f0571d5baddcf911891cea82bc2a6c"}],"concept.nist.degree":[{"id":"assertion.concept.nist.degree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines degree as: (1) Of a vertex , the number of edges connected to it. (2) Of a graph , the maximum degree of any vertex. (3) Of a tree node , the number of child nodes it has.","support":[{"end":200,"quote":"(1) Of a\nvertex\n, the number of\nedges\nconnected to it.  (2) Of a\ngraph\n, the maximum degree of any vertex. (3) Of a\ntree\nnode\n, the number of\nchild\nnodes it has.","source_id":"nist-dads.degree","source_sha256":"531e01c842d9e01293a96d39425f434f04ab02b2392878f9f3d174f45e154559","start":39}],"target_id":"concept.nist.degree","target_kind":"node","target_sha256":"a3ee088cb10e1da94f2b584e957f54672351e7d046f799769cecdbc39e78596d"}],"concept.nist.densegraph":[{"id":"assertion.concept.nist.densegraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dense graph as: A graph in which the number of edges is close to the possible number of edges.","support":[{"end":127,"quote":"A\ngraph\nin which the number of\nedges\nis close to the possible number of edges.","source_id":"nist-dads.densegraph","source_sha256":"64363c9172417e09772ac202726e8ef6cf78636787695ea27c293fc2bf6c6d3e","start":49}],"target_id":"concept.nist.densegraph","target_kind":"node","target_sha256":"702d1449773121aded90ba0edc7bba15b10663fcbc7416ac0a73055423347d5a"}],"concept.nist.depoissonization":[{"id":"assertion.concept.nist.depoissonization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines depoissonization as: To interpret a solution to a poisson model in the original model after poissonization .","support":[{"end":146,"quote":"To interpret a solution to a poisson model in the original model after\npoissonization\n.","source_id":"nist-dads.depoissonization","source_sha256":"0e1f575e6951fff6f10ed86aa28665a585206ee814b4d3a344501b103319b2d3","start":59}],"target_id":"concept.nist.depoissonization","target_kind":"node","target_sha256":"7fbb3ea4da380395e7843859c2ffb6ad6b1606c0cccf3e6cc008ed44723789c3"}],"concept.nist.depth":[{"id":"assertion.concept.nist.depth","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines depth as: Of a node , the distance from the node to the root of the tree . Formal Definition: The depth of the root is 0. The depth of a node is one plus the depth of its parent .","support":[{"end":207,"quote":"Of a\nnode\n, the distance from the node to the\nroot\nof the\ntree\n.\nFormal Definition:\nThe depth of the root is 0.  The depth of a node is one plus the depth of its\nparent\n.","source_id":"nist-dads.depth","source_sha256":"806771516d8fae5c20041644eb311e24d9932e66757fa18edebbae1f9f811213","start":37}],"target_id":"concept.nist.depth","target_kind":"node","target_sha256":"e6a3774d9a4c7b39d2fbbff44204e0e563789c4f1974bb451b42001e1e766be9"}],"concept.nist.deque":[{"id":"assertion.concept.nist.deque","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines deque as: A data structure in which items may be added to or deleted from the head or the tail . Also known as doubly-ended queue.","support":[{"end":161,"quote":"A data structure in which items may be added to or deleted from the\nhead\nor the\ntail\n.\nAlso known as\ndoubly-ended queue.","source_id":"nist-dads.deque","source_sha256":"e94eb13f3876119dd1aefc2e8fc55493dc8354933bbfcb5ba25b7d72c8aaaf79","start":41}],"target_id":"concept.nist.deque","target_kind":"node","target_sha256":"a453f20487455d066b485c73fdff0bfba82d2241974aceea76d53ffe7c4b9c6d"}],"concept.nist.descendant":[{"id":"assertion.concept.nist.descendant","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines descendant as: A child of a node in a tree , any of the children of the children, etc.","support":[{"end":118,"quote":"A\nchild\nof a\nnode\nin a\ntree\n, any of the children of the children, etc.","source_id":"nist-dads.descendant","source_sha256":"9302c6cf85e5fc5760d5cc8782a3c25823864e1b1e29ea5b2439bff94e3043e0","start":47}],"target_id":"concept.nist.descendant","target_kind":"node","target_sha256":"b09f57a595d7d86436b17d19ca5d091abbeb596d0529edcd1ae2b29736a5cbd5"}],"concept.nist.determfinitstatemach":[{"id":"assertion.concept.nist.determfinitstatemach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines deterministic finite state machine as: A finite state machine with at most one transition for each symbol and state . Also known as DFA, deterministic finite automaton.","support":[{"end":224,"quote":"A\nfinite state machine\nwith at most one transition for each symbol and\nstate\n.\nAlso known as\nDFA, deterministic finite automaton.","source_id":"nist-dads.determfinitstatemach","source_sha256":"d794b7c71a4370db1afa6e3dc59d24cd3bc3c8863da51faf92eea922eb316441","start":95}],"target_id":"concept.nist.determfinitstatemach","target_kind":"node","target_sha256":"2700c7e36d44e6c91cc1d363a02525290f93f533caa04eaca3d84ff2faa41724"}],"concept.nist.determfinittreeautom":[{"id":"assertion.concept.nist.determfinittreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic finite tree automaton as: A deterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as DFTA.","support":[{"end":418,"quote":"A\ndeterministic finite state machine\nthat accepts\nfinitary trees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The acceptance condition is modified accordingly.\nAlso known as\nDFTA.","source_id":"nist-dads.determfinittreeautom","source_sha256":"c4176ecc2e10ace22c7da47a6e5aa9c6c69596c087417893627e55c17eb6e56d","start":97}],"target_id":"concept.nist.determfinittreeautom","target_kind":"node","target_sha256":"2fd6fb427c19d3763b3d75cd89639fcb973857e05247da9baf4a324968783ea3"}],"concept.nist.deterministc":[{"id":"assertion.concept.nist.deterministc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic as: Permitting at most one next move at any step in a computation.","support":[{"end":115,"quote":"Permitting at most one next move at any step in a computation.","source_id":"nist-dads.deterministc","source_sha256":"68f08f081c249f951ec8a6cfbed17486bfd22eb41c32ade9109ec942113c2bea","start":53}],"target_id":"concept.nist.deterministc","target_kind":"node","target_sha256":"b850156fd2f144a2024d24660c463fecb16cff2bf8b56941ca313a6a7150155c"}],"concept.nist.determtreeautom":[{"id":"assertion.concept.nist.determtreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic tree automaton as: A deterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","support":[{"end":432,"quote":"A\ndeterministic finite state machine\nthat accepts infinite\ntrees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The expressive power of such automata varies depending on the acceptance conditions of the trees.","source_id":"nist-dads.determtreeautom","source_sha256":"0839fa356b372eb14ad8dd178b2790e7c701d87e2ae95222458783299a0a0155","start":83}],"target_id":"concept.nist.determtreeautom","target_kind":"node","target_sha256":"036c0e271d1e76d3d3465c2cf6874dfb7f92becb6dd3d769268af4f6dd459a88"}],"concept.nist.dfsforest":[{"id":"assertion.concept.nist.dfsforest","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines DFS forest as: A rooted forest formed by depth-first search .","support":[{"end":93,"quote":"A rooted\nforest\nformed by\ndepth-first search\n.","source_id":"nist-dads.dfsforest","source_sha256":"dda31b3bff97b400e370b502d95463824708f90e2b22792aff6ac05660563f87","start":47}],"target_id":"concept.nist.dfsforest","target_kind":"node","target_sha256":"8bc1ac64107305937766d5df78b81e69e67a9a91b79e88ea0b5a90fc3c71530f"}],"concept.nist.diagonaliztn":[{"id":"assertion.concept.nist.diagonaliztn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diagonalization as: A proof technique for showing that a given language does not belong to a given complexity class, used in many separation theorems .","support":[{"end":188,"quote":"A proof technique for showing that a given\nlanguage\ndoes not belong to a given\ncomplexity\nclass, used in many\nseparation theorems\n.","source_id":"nist-dads.diagonaliztn","source_sha256":"e292b46806510cd8d2cf50fb4de8c6eed42c5b9984dee0104276848eadb7d259","start":57}],"target_id":"concept.nist.diagonaliztn","target_kind":"node","target_sha256":"7339faa770118c495e162655032a50e667042437ffeab8d53eff8c0eb6ca420d"}],"concept.nist.diameter":[{"id":"assertion.concept.nist.diameter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diameter as: The maximum of the distances between all possible pairs of vertices of a graph .","support":[{"end":123,"quote":"The maximum of the distances between all possible pairs of\nvertices\nof a\ngraph\n.","source_id":"nist-dads.diameter","source_sha256":"8cde6ae2957f2ea4a34692ae6240af30b47bd2aa28158fa472f02ae7aa7a6910","start":43}],"target_id":"concept.nist.diameter","target_kind":"node","target_sha256":"283b425bd774d2d08da205a3c891adfebe561466b26ac571b993bece3c64f70a"}],"concept.nist.dichotomicsearch":[{"id":"assertion.concept.nist.dichotomicsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dichotomic search as: Search by selecting between two distinct alternatives (dichotomies) at each step.","support":[{"end":142,"quote":"Search by selecting between two distinct alternatives (dichotomies) at each step.","source_id":"nist-dads.dichotomicsearch","source_sha256":"1f0fb363311d15659520193588bc216cbc3dde4a4ea0a602dfe2d48a0ef124f1","start":61}],"target_id":"concept.nist.dichotomicsearch","target_kind":"node","target_sha256":"8df5ecf1c2a082aea6ca9f8b7dd671d560e950bc8b8b9eab9a126fffa5afd564"}],"concept.nist.dictionary":[{"id":"assertion.concept.nist.dictionary","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dictionary as: An abstract data type storing items, or values. A value is accessed by an associated key . Basic operations are new, insert, find and delete. Formal Definition: The operations new(), insert(k, v, D), and find(k, D) may be defined with axiomatic semantics as follows. new() returns a dictionary find(k, insert(k, v, D)) = v find(k, insert(j, v, D)) = find(k, D) if k ≠ j where k and j are keys, v is a value, and D is a dictionary. The modifier function delete(k, D) may be defined as follows. delete(k, new()) = new() delete(k, insert(k, v, D)) = delete(k, D) delete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j If we want find to be a total function , we could define find(k, new()) using a special value: fail . This only changes the return type of find. find(k, new()) = fail Also known as association list, map, property list.","support":[{"end":896,"quote":"An\nabstract data type\nstoring items, or values.  A value is accessed by an associated\nkey\n. Basic operations are new, insert, find and delete.\nFormal Definition:\nThe operations new(), insert(k, v, D), and find(k, D) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a dictionary\nfind(k, insert(k, v, D)) = v\nfind(k, insert(j, v, D)) = find(k, D) if k ≠ j\nwhere k and j are keys, v is a value, and D is a dictionary.\nThe modifier function delete(k, D) may be defined as follows.\ndelete(k, new()) = new()\ndelete(k, insert(k, v, D)) = delete(k, D)\ndelete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j\nIf we want find to be a\ntotal function\n, we could define  find(k, new()) using a special value:\nfail\n. This only changes the return type of find.\nfind(k, new()) =\nfail\nAlso known as\nassociation list, map, property list.","source_id":"nist-dads.dictionary","source_sha256":"cc3e036afdfd1c94475781009b160dcbcba0384f3c802633c29a212df630fe25","start":51}],"target_id":"concept.nist.dictionary","target_kind":"node","target_sha256":"5ce72105df0f2e925ca286011c0058b862760ad1be238eb22529a23725bffdf4"}],"concept.nist.difference":[{"id":"assertion.concept.nist.difference","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines difference as: The difference of set A minus set B is a set having all the members which are in A, but not in B.","support":[{"end":144,"quote":"The difference of\nset\nA minus set B is a set having all the members which are in A, but not in B.","source_id":"nist-dads.difference","source_sha256":"e2cc5602eab4858363242acdf797eaa93550b771c317d00ea2b6f1a10eb83ed9","start":47}],"target_id":"concept.nist.difference","target_kind":"node","target_sha256":"0b1405cb10a96d26881f72f3ce39829cca5ebdda7495275039c299183d8d5f6e"}],"concept.nist.digitalsearchtree":[{"id":"assertion.concept.nist.digitalsearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines digital search tree as: A trie which stores the strings in internal nodes , so there is no need for extra leaf nodes to store the strings.","support":[{"end":183,"quote":"A\ntrie\nwhich stores the\nstrings\nin\ninternal nodes\n, so there is no need for extra\nleaf\nnodes to store the strings.","source_id":"nist-dads.digitalsearchtree","source_sha256":"ebd58d05b3fac6c129593a6a3cb9ed8f092995a92a63e4a4ea8b01ab3f59d09e","start":69}],"target_id":"concept.nist.digitalsearchtree","target_kind":"node","target_sha256":"c2285ab66c2196eda5db972aa6a2a91853ac5e454927333c577cfa0881450b02"}],"concept.nist.digitaltree":[{"id":"assertion.concept.nist.digitaltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines digital tree as: A tree for storing strings in which nodes are organized by substrings common to two or more strings.","support":[{"end":155,"quote":"A\ntree\nfor storing\nstrings\nin which\nnodes\nare organized by\nsubstrings\ncommon to two or more strings.","source_id":"nist-dads.digitaltree","source_sha256":"c474c227e76c37b0f38b4017c51e4f2b0fe2d49a44eb76bfb4da2b0d6fcbd99b","start":55}],"target_id":"concept.nist.digitaltree","target_kind":"node","target_sha256":"cf6fca2734317921fc91bb62396e443a61280771d26dace312e4a7681735b124"}],"concept.nist.diningphilos":[{"id":"assertion.concept.nist.diningphilos","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dining philosophers as: Suppose a number of philosophers surround a dining table. Adjacent philosophers share one fork. They spend time thinking or trying to eat. A philosopher must have both the fork on the left and the fork on the right to eat. Clearly adjacent philosophers cannot eat at the same time. The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","support":[{"end":453,"quote":"Suppose a number of philosophers surround a dining table.   Adjacent philosophers share one fork.   They spend time thinking or trying to eat.   A philosopher must have both the fork on the left and the fork on the right to eat.  Clearly adjacent philosophers cannot eat at the same time.  The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","source_id":"nist-dads.diningphilos","source_sha256":"543ec714a8ba7d84459aa02c5526bd0df9be0ef37d83c36e66e10d36ce38d2ed","start":70}],"target_id":"concept.nist.diningphilos","target_kind":"node","target_sha256":"0101409871ae1741721ea1163a259e4b47f98f87b01397cf9772fe3075729b1a"}],"concept.nist.directacycgraph":[{"id":"assertion.concept.nist.directacycgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines directed acyclic graph as: A directed graph with no path that starts and ends at the same vertex . Also known as DAG, acyclic directed graph, oriented acyclic graph.","support":[{"end":209,"quote":"A\ndirected graph\nwith no\npath\nthat starts and ends at the same\nvertex\n.\nAlso known as\nDAG, acyclic directed graph, oriented acyclic graph.","source_id":"nist-dads.directacycgraph","source_sha256":"fc132b88085dcc4b7ffde81733ee2f56648fda146b73ef06a176e7ec25c800d4","start":71}],"target_id":"concept.nist.directacycgraph","target_kind":"node","target_sha256":"51de4a139ca897434a7f314e98d2f60921e1297037c885bcef2e608d98d08480"}],"concept.nist.directchaining":[{"id":"assertion.concept.nist.directchaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines direct chaining as: A collision resolution scheme in which the hash table is an array of links to lists . Each list holds all the items with the same hash value.","support":[{"end":202,"quote":"A\ncollision resolution scheme\nin which the\nhash table\nis an\narray\nof\nlinks\nto\nlists\n. Each list holds all the items with the same hash value.","source_id":"nist-dads.directchaining","source_sha256":"bd7e779c7eb47122405828eac9a0ca2adeee1d2c4d0916c5470ede3f482264c1","start":61}],"target_id":"concept.nist.directchaining","target_kind":"node","target_sha256":"49946b49cbeafca8560680f2d61afc0ee8697e10032abf402bb5f0550e8972ff"}],"concept.nist.directedacyclicwordgraph":[{"id":"assertion.concept.nist.directedacyclicwordgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines directed acyclic word graph as: (1) A directed acyclic graph representing the suffixes of a given string in which each edge is labeled with a character. The characters along a path from the root to a node are the substring which the node represents. (2) A finite state machine that recognizes a set of words. Also known as DAWG.","support":[{"end":382,"quote":"(1) A\ndirected acyclic graph\nrepresenting the\nsuffixes\nof a given\nstring\nin which each\nedge\nis labeled with a character.  The characters along a\npath\nfrom the\nroot\nto a\nnode\nare the\nsubstring\nwhich the\nnode\nrepresents. (2) A\nfinite state machine\nthat recognizes a set of words.\nAlso known as\nDAWG.","source_id":"nist-dads.directedacyclicwordgraph","source_sha256":"e1349b16c1fa6fa0b15cb0c186aa2dca13017fd19ecf2810b99eea3e568660e2","start":85}],"target_id":"concept.nist.directedacyclicwordgraph","target_kind":"node","target_sha256":"88879fbe9affb98e855ddca3213a9bb22ada211ea04ae2bcb58cc432e6690aab"}],"concept.nist.directedgraph":[{"id":"assertion.concept.nist.directedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines directed graph as: A graph whose edges are ordered pairs of vertices . That is, each edge can be followed from one vertex to another vertex. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}. Also known as digraph, oriented graph.","support":[{"end":474,"quote":"A\ngraph\nwhose\nedges\nare\nordered\npairs of\nvertices\n.  That is, each edge can be followed from one vertex to another vertex.\nFormal Definition:\nA graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}.  If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n, that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}.\nAlso known as\ndigraph, oriented graph.","source_id":"nist-dads.directedgraph","source_sha256":"9fd184fffc095c760fd303be8c17e9315069c49bd05d9afad9332da4e0f58a49","start":59}],"target_id":"concept.nist.directedgraph","target_kind":"node","target_sha256":"f36b6b923e3127bc56213d16f7dd6e0c83360983f760a762402352472c6edfe8"}],"concept.nist.discretintrv":[{"id":"assertion.concept.nist.discretintrv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines discrete interval encoding tree as: A binary search tree that stores consecutive values as intervals. Also known as diet.","support":[{"end":178,"quote":"A\nbinary search tree\nthat stores consecutive values as intervals.\nAlso known as\ndiet.","source_id":"nist-dads.discretintrv","source_sha256":"653e8031db1675dbe4367fe8be936d7515b8d002622cfe3c3426b7b1ee121d68","start":93}],"target_id":"concept.nist.discretintrv","target_kind":"node","target_sha256":"035b3aebdb7cc0ce97400a74e126cc59b58e60548d840d314375874d584f62ac"}],"concept.nist.discretpcntr":[{"id":"assertion.concept.nist.discretpcntr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines discrete p-center as: A facility location problem in which the supply points must be a subset of demand points.","support":[{"end":155,"quote":"A\nfacility location\nproblem in which the supply points must be a subset of demand points.","source_id":"nist-dads.discretpcntr","source_sha256":"45fb3571a34f062bc667d1c384b866e4b9bdff336909d3db71ca9fd6f5b1d736","start":66}],"target_id":"concept.nist.discretpcntr","target_kind":"node","target_sha256":"6fbe8b5ffd06b4c330e07ed01c6276e450c7d17482d75e663c4b8f04c9e853c8"}],"concept.nist.disjointset":[{"id":"assertion.concept.nist.disjointset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines disjoint set as: A set whose members do not overlap, are not duplicated, etc.","support":[{"end":111,"quote":"A\nset\nwhose members do not overlap, are not duplicated, etc.","source_id":"nist-dads.disjointset","source_sha256":"86100ba61008acfa598b4b1f6a23fb032a9a8e600589a08ce1adcd4a870157fd","start":51}],"target_id":"concept.nist.disjointset","target_kind":"node","target_sha256":"33de2d135495eb22b73113270b561135a5e8a867b1368508a1980267a9b74882"}],"concept.nist.disjunction":[{"id":"assertion.concept.nist.disjunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines disjunction as: The boolean or function.","support":[{"end":73,"quote":"The boolean\nor\nfunction.","source_id":"nist-dads.disjunction","source_sha256":"4573ddb99b52f75dba40d52f745698ca404905961de3187b7e991624ce807ca3","start":49}],"target_id":"concept.nist.disjunction","target_kind":"node","target_sha256":"1ccfb8d2082155f5c4fcd4e6e76c101db5c6149d7863416d6818460d8b86cb47"}],"concept.nist.distributionalcomplex":[{"id":"assertion.concept.nist.distributionalcomplex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distributional complexity as: The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs.","support":[{"end":211,"quote":"The expected running time of the best possible\ndeterministic algorithm\nover the worst possible probability distribution on the inputs.","source_id":"nist-dads.distributionalcomplex","source_sha256":"128133aa9b64b6879f663795860e7122bda4bfe1cd172b40e20c4636cf4464f8","start":77}],"target_id":"concept.nist.distributionalcomplex","target_kind":"node","target_sha256":"27af84fed758fc65a9b372d50ad6523cb185b0477c7006f49b5b47fe7ec0bb4e"}],"concept.nist.domain":[{"id":"assertion.concept.nist.domain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines domain as: (1) The inputs for which a function or relation is defined. For instance, 0 is not in the domain of reciprocal (1/x). (2) The possible values of a variable.","support":[{"end":196,"quote":"(1) The inputs for which a\nfunction\nor\nrelation\nis defined. For instance, 0 is not in the domain of reciprocal (1/x).  (2) The possible values of a variable.","source_id":"nist-dads.domain","source_sha256":"2a566c1c6fefcc53f5d34ba43cab6bed09153d747f2f0ff3cd9d9a8f7496475d","start":39}],"target_id":"concept.nist.domain","target_kind":"node","target_sha256":"47db7d4180c9bfe6c455010571e9db04f8ce65f505aa774fb2e02d6ae9152a0e"}],"concept.nist.dontcare":[{"id":"assertion.concept.nist.dontcare","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines don't care as: A special symbol which matches any other symbol of a given alphabet .","support":[{"end":116,"quote":"A special symbol which matches any other symbol of a given\nalphabet\n.","source_id":"nist-dads.dontcare","source_sha256":"5324fe0ed31fe1ec243f01f6f570bcb2d858f0a692cdb01d2a2567ed6ee475d3","start":47}],"target_id":"concept.nist.dontcare","target_kind":"node","target_sha256":"c5e482399be63d7d8ee0ed662b35a8f299924512dd06fae50ea77f55a397e64c"}],"concept.nist.doubleendpq":[{"id":"assertion.concept.nist.doubleendpq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines double-ended priority queue as: A priority queue which simultaneously keeps track of the maximum and minimum keys , and supports operations efficiently on either extreme (minimum or maximum).","support":[{"end":244,"quote":"A\npriority queue\nwhich simultaneously keeps track of the maximum and minimum\nkeys\n, and supports operations efficiently on either extreme (minimum or maximum).","source_id":"nist-dads.doubleendpq","source_sha256":"3a3b63acc1e0b0532c83bab7e5ae1ae52bfeb36b316d312e4d2f6d6da60df6f0","start":85}],"target_id":"concept.nist.doubleendpq","target_kind":"node","target_sha256":"2e70254bc3a21c7720cdbaf47667309c440ca4dcfc555b24892233899d4cacec"}],"concept.nist.doublylinkedlist":[{"id":"assertion.concept.nist.doublylinkedlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines doubly linked list as: A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time. Also known as two-way linked list, symmetrically linked list.","support":[{"end":336,"quote":"A variant of a\nlinked list\nin which each item has a\nlink\nto the previous item as well as the next.  This allows easily accessing list items backward as well as forward and deleting any item in constant time.\nAlso known as\ntwo-way linked list, symmetrically linked list.","source_id":"nist-dads.doublylinkedlist","source_sha256":"b822c310ebbfb3886d7194412cb1b8538ee9b226b3f88c6c1134efd9e409afee","start":67}],"target_id":"concept.nist.doublylinkedlist","target_kind":"node","target_sha256":"8383ec6eaf4db2a45946e5161f8e65085fe5e261535533da689f8dbd669c22fb"}],"concept.nist.dtree":[{"id":"assertion.concept.nist.dtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines D-tree as: (1) A BB(α) tree where the weights are the number of searches down that path. (2) A height-balanced binary tree that divides regions along their boundaries to serve as a spatial access method .","support":[{"end":238,"quote":"(1) A\nBB(α) tree\nwhere the weights are the number of searches down that path.   (2) A\nheight-balanced\nbinary tree\nthat divides regions along their boundaries to serve as a\nspatial access method\n.","source_id":"nist-dads.dtree","source_sha256":"08469b755ea5e231a2990e740c96a05c7bbbb7428a933e5411592ccd61c813a8","start":43}],"target_id":"concept.nist.dtree","target_kind":"node","target_sha256":"f5613beea15ac7c7b22a419516eb1b207de24ea0c027f256b322e162e9e96b7b"}],"concept.nist.dual":[{"id":"assertion.concept.nist.dual","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dual as: The dual of a planar graph , G, is a graph with a vertex for each region in G and an edge between vertices for each pair of adjacent regions. The new edge crosses the edge in G which is the boundary between the adjacent regions.","support":[{"end":264,"quote":"The dual of a\nplanar graph\n, G, is a\ngraph\nwith a\nvertex\nfor each region in G and an\nedge\nbetween vertices for each pair of adjacent regions.  The new edge crosses the edge in G which is the boundary between the adjacent regions.","source_id":"nist-dads.dual","source_sha256":"2381f4394c3fe51e8e8157dbfac8ac22b3c533959aba989d3d4ea0baa0aeae62","start":35}],"target_id":"concept.nist.dual","target_kind":"node","target_sha256":"0ae84528c2bb14bb27f80ee0c1a6494afb81b53715570c9075dd03408a3b0e2f"}],"concept.nist.dutchnationalflag":[{"id":"assertion.concept.nist.dutchnationalflag","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Dutch national flag as: Rearrange elements in an array into three groups: bottom, middle, and top. One algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom. The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes. At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top. If it belongs in the bottom, swap it with the element just above the bottom. If it is in the middle, leave it. Update the appropriate index. Complexity is Θ(n) moves and examinations.","support":[{"end":762,"quote":"Rearrange elements in an\narray\ninto three groups: bottom, middle, and top.\nOne algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom.  The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes.  At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top.  If it belongs in the bottom, swap it with the element just above the bottom.  If it is in the middle, leave it.  Update the appropriate index. Complexity is\nΘ(n)\nmoves and examinations.","source_id":"nist-dads.dutchnationalflag","source_sha256":"00786e98a5a6397d7ae8f70d4c416bf2cf95622fb0fa2d5f749901b7f7f62987","start":70}],"target_id":"concept.nist.dutchnationalflag","target_kind":"node","target_sha256":"99fbcbdf75230fde22b284edf8a6bb8628bec90a7f74430e68bc7005dcc820a4"}],"concept.nist.dynamic":[{"id":"assertion.concept.nist.dynamic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic as: When the problem domain may change, e.g., there may be insertions and deletions.","support":[{"end":121,"quote":"When the problem domain may change, e.g., there may be insertions and deletions.","source_id":"nist-dads.dynamic","source_sha256":"8d87072668c419d3085f7a0ce312f8d5ab0a7df6981403f652d857152ea4fff4","start":41}],"target_id":"concept.nist.dynamic","target_kind":"node","target_sha256":"5fb02831273237f48dea23e0c6ba4c0efb1ed65800bd8e458973bee02580637c"}],"concept.nist.dynamicarray":[{"id":"assertion.concept.nist.dynamicarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic array as: An array whose size may change over time. Items are not only added or removed, but memory used changes, too.","support":[{"end":166,"quote":"An\narray\nwhose size may change over time.  Items are not only added or removed, but memory used changes, too.","source_id":"nist-dads.dynamicarray","source_sha256":"bebbb1a329a6f65c42f2984a4d7867dfe48894ab08b4eb6b4986aae9d87041d4","start":57}],"target_id":"concept.nist.dynamicarray","target_kind":"node","target_sha256":"03d87d85a8fcdaea16d03f68b31a9fd5bf36f731818ef2c6923e4743655b8e7b"}],"concept.nist.dynamichashing":[{"id":"assertion.concept.nist.dynamichashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamic hashing as: A hash table that grows to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.","support":[{"end":241,"quote":"A\nhash table\nthat grows to handle more items.  The associated\nhash function\nmust change as the table grows.  Some schemes may shrink the table to save space when items are deleted.","source_id":"nist-dads.dynamichashing","source_sha256":"058f18cf5257245a61720d02175044fce70eef8d5be7619f775891c92cc14bb0","start":61}],"target_id":"concept.nist.dynamichashing","target_kind":"node","target_sha256":"2daf9659c46c4aa9c22bebe8ae6c919d14a9ac2cd2243c6accebe99aaca3198e"}],"concept.nist.edge":[{"id":"assertion.concept.nist.edge","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines edge as: A connection between two vertices of a graph . In a weighted graph , each edge has an number, called a \"weight\". In a directed graph , an edge goes from one vertex, the source , to another, the target , and hence makes connection in only one direction. Also known as arc.","support":[{"end":308,"quote":"A connection between two\nvertices\nof a\ngraph\n.  In a\nweighted graph\n, each edge has an number, called a \"weight\".  In a\ndirected graph\n, an edge goes from one vertex, the\nsource\n, to another, the\ntarget\n, and hence makes connection in only one direction.\nAlso known as\narc.","source_id":"nist-dads.edge","source_sha256":"f95951d7c3b890f321e438c56f0e7761015ba4566acf54e355593e453c1baaea","start":35}],"target_id":"concept.nist.edge","target_kind":"node","target_sha256":"aef517818a44524e89c7cd7190b50c1cd94b946ae50ac7a423b23e88bd8a8b88"}],"concept.nist.edgecoloring":[{"id":"assertion.concept.nist.edgecoloring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge coloring as: An assignment of colors (or any distinct marks) to the edges of a graph . A coloring is a proper coloring if no two adjacent edges have the same color.","support":[{"end":205,"quote":"An assignment of colors (or any distinct marks) to the\nedges\nof a\ngraph\n.  A coloring is a\nproper coloring\nif no two\nadjacent\nedges have the same color.","source_id":"nist-dads.edgecoloring","source_sha256":"f61ed30aa5995e4fb226eb7003e0dbe6e856430e9e61095daa415b53159ffc4b","start":53}],"target_id":"concept.nist.edgecoloring","target_kind":"node","target_sha256":"f72f7484a1d9e99159c890d9e92e25094c20ad7aba3aa190d6e936c6b594c879"}],"concept.nist.edgeconnectivity":[{"id":"assertion.concept.nist.edgeconnectivity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge connectivity as: (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","support":[{"end":274,"quote":"(1) The smallest number of\nedges\nwhose deletion will cause a\nconnected graph\nto not be connected.  (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","source_id":"nist-dads.edgeconnectivity","source_sha256":"c2b77eda72fc496a56db9851f3a180b1776c257262c20946c19927b212ed4cfc","start":61}],"target_id":"concept.nist.edgeconnectivity","target_kind":"node","target_sha256":"d02a2f4f4f203f8a119fd73f41b9da9c863ef6bc9d9641a496896880ac1dfd09"}],"concept.nist.edgecrossing":[{"id":"assertion.concept.nist.edgecrossing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edge crossing as: Two different edges cross in a graph drawing if their geometric representations intersect. The number of crossings in a graph drawing is the number of pairs of edges which cross.","support":[{"end":232,"quote":"Two different\nedges\ncross in a\ngraph drawing\nif their geometric representations intersect.  The number of crossings in a graph drawing is the number of pairs of edges which cross.","source_id":"nist-dads.edgecrossing","source_sha256":"9c05a16f9fecfb8372d5062f09a8fe5e92fcf374ed5f66a4e1a6274201d9ec2e","start":53}],"target_id":"concept.nist.edgecrossing","target_kind":"node","target_sha256":"274f8db0c33edaea7f40d36ac2c73d12f91ac4fc58429e27ca8b471cb31cf7c6"}],"concept.nist.editoperation":[{"id":"assertion.concept.nist.editoperation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edit operation as: On a string , the operation of deletion, insertion, or substitution performed on a single symbol. On a tree , the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a child , the insertion of a new node followed by the reassignment of some arcs departing from the parent of the new node, or the substitution of the label of one of the nodes with another label. Each edit operation may have an associated nonnegative real number representing its cost.","support":[{"end":563,"quote":"On a\nstring\n, the operation of deletion, insertion, or substitution performed on a single symbol.  On a\ntree\n, the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a\nchild\n, the insertion of a new node followed by the reassignment of some\narcs\ndeparting from the parent of the new node, or the substitution of the label of one of the nodes with another label.  Each edit operation may have an associated nonnegative real number representing its cost.","source_id":"nist-dads.editoperation","source_sha256":"ac0d77d8a88340de27dc664a7105205e6d869fd532719574510844f742b5202d","start":55}],"target_id":"concept.nist.editoperation","target_kind":"node","target_sha256":"f1217c2432a42329def056fc903c9ba5db86184455a7f1455679dda011caddbc"}],"concept.nist.editscript":[{"id":"assertion.concept.nist.editscript","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines edit script as: A sequence of viable edit operations on a string or tree .","support":[{"end":107,"quote":"A sequence of viable\nedit operations\non a\nstring\nor\ntree\n.","source_id":"nist-dads.editscript","source_sha256":"d3114932ecab3b31e221492cc06caabd9cb8d3beb49a9dc3883e51bab4e46ca2","start":49}],"target_id":"concept.nist.editscript","target_kind":"node","target_sha256":"cb6459aec658a824ad23276a5c2c3ecf0c6c66b394c4e1653fd5619f5a7c7b4a"}],"concept.nist.efficiency":[{"id":"assertion.concept.nist.efficiency","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines efficiency as: The resources an algorithm used to find an answer. It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","support":[{"end":280,"quote":"The resources an\nalgorithm\nused to find an answer.  It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","source_id":"nist-dads.efficiency","source_sha256":"d918cc5c8a975068d058d72f14a6c96774c00aa1393a29e5bdf5efbec74f0dda","start":47}],"target_id":"concept.nist.efficiency","target_kind":"node","target_sha256":"3c0ccc22d7accc6a56fccd05d275e935234a75632a9becf2a234c791b45b2d4a"}],"concept.nist.eightqueens":[{"id":"assertion.concept.nist.eightqueens","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 8 queens as: Place eight chess queens on an 8 × 8 board such that no queen can attack another. Efficiently find all possible placements.","support":[{"end":172,"quote":"Place eight chess queens on an 8 × 8 board such that no queen can attack another.  Efficiently find all possible placements.","source_id":"nist-dads.eightqueens","source_sha256":"1e793ef6dab2eb08d9185c9ca703787d0a4e9a80aff1f5770ff24335c01c0372","start":48}],"target_id":"concept.nist.eightqueens","target_kind":"node","target_sha256":"42165a45c62af37bb4ee42982cf435740d307e33b1fa526d80b173206de7168b"}],"concept.nist.elasticbuckettrie":[{"id":"assertion.concept.nist.elasticbuckettrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines elastic-bucket trie as: A variant of a bucket trie in which each leaf node for n strings is a bucket allocated to hold exactly n strings.","support":[{"end":182,"quote":"A variant of a\nbucket trie\nin which each\nleaf\nnode for n strings is a\nbucket\nallocated to hold exactly n strings.","source_id":"nist-dads.elasticbuckettrie","source_sha256":"d8a05f683c598c398b84cceb0e0f7a07647e709dcb0be811e5615f734f2eaeed","start":69}],"target_id":"concept.nist.elasticbuckettrie","target_kind":"node","target_sha256":"e5fbf4b7383e03453fd0a3ead565902b9f6c1051036bee283ef39205fa71cf91"}],"concept.nist.elementnqnss":[{"id":"assertion.concept.nist.elementnqnss","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines element uniqueness as: The problem of determining if there are duplicates in a set of numbers.","support":[{"end":139,"quote":"The problem of determining if there are duplicates in a\nset\nof numbers.","source_id":"nist-dads.elementnqnss","source_sha256":"94b52523d33846c78eb1fe0ee5101079147f6464618d257ad25a8bed06de0713","start":68}],"target_id":"concept.nist.elementnqnss","target_kind":"node","target_sha256":"e69bbfb7c260636c2e2c9ab88e4c5ae1ed79457a5cc0da57aac77f851c40e84d"}],"concept.nist.endofstring":[{"id":"assertion.concept.nist.endofstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines end-of-string as: A special character indicating the end of a string .","support":[{"end":105,"quote":"A special character indicating the end of a\nstring\n.","source_id":"nist-dads.endofstring","source_sha256":"aa2927c0af1ae12b911e93f504c55878ec84266e62881758fdb5bf3c6290209e","start":53}],"target_id":"concept.nist.endofstring","target_kind":"node","target_sha256":"7c0447947bd7c01629d6f3566f71796f7e176a7ee61214af023fa51a8cf35a38"}],"concept.nist.euclidntrvls":[{"id":"assertion.concept.nist.euclidntrvls","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euclidean traveling salesman problem as: Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point.","support":[{"end":245,"quote":"Find a\npath\nof minimum\nEuclidean distance\nbetween points in a plane which includes each point exactly once and returns to its starting point.","source_id":"nist-dads.euclidntrvls","source_sha256":"77cd64cc6239689a9aa8442a73a9dea1c86e321e631ad6ffa1fc84bf0f7b3e15","start":104}],"target_id":"concept.nist.euclidntrvls","target_kind":"node","target_sha256":"53022f83e2b6a2681106af77beac2c9d7311364183c6c1bc0be6b2d2015d1596"}],"concept.nist.euclidsteinertree":[{"id":"assertion.concept.nist.euclidsteinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euclidean Steiner tree as: A tree of minimum Euclidean distance connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","support":[{"end":258,"quote":"A tree of minimum\nEuclidean distance\nconnecting a set of points, called\nterminals\n, in the plane.  This tree may include points other than the terminals, which are called\nSteiner points\n.","source_id":"nist-dads.euclidsteinertree","source_sha256":"d575bff4ea9a40bb44fa51d4da8565897bb3a34a28914dc992a558ff09ef1a59","start":71}],"target_id":"concept.nist.euclidsteinertree","target_kind":"node","target_sha256":"ad14545437700775caddd219057b9890db64d1ef67227f4b9447285d5482b974"}],"concept.nist.eulercycle":[{"id":"assertion.concept.nist.eulercycle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euler cycle as: A path through a graph which starts and ends at the same vertex and includes every edge exactly once. Also known as Eulerian path, Königsberg bridges problem.","support":[{"end":207,"quote":"A\npath\nthrough a\ngraph\nwhich starts and ends at the same\nvertex\nand includes every\nedge\nexactly once.\nAlso known as\nEulerian path, Königsberg bridges problem.","source_id":"nist-dads.eulercycle","source_sha256":"395559e6a6f506cc92d8c5713f9fcd53dabcfa0463b033220c9d94115028b237","start":49}],"target_id":"concept.nist.eulercycle","target_kind":"node","target_sha256":"d299816eedc5e17a85b1358080379d6244e01893586753c3d9b41d788a9c911e"}],"concept.nist.euleriangrph":[{"id":"assertion.concept.nist.euleriangrph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Eulerian graph as: A graph that has an Euler cycle .","support":[{"end":88,"quote":"A\ngraph\nthat has an\nEuler cycle\n.","source_id":"nist-dads.euleriangrph","source_sha256":"76e59d8d4838801a12578e5809d656261dca66d07acb160705ddb87b622ec684","start":55}],"target_id":"concept.nist.euleriangrph","target_kind":"node","target_sha256":"7dae918d9a121f75e618e0ed70e9668998bd6eb49b309f4fa92ac2b9291ea087"}],"concept.nist.eulersformula":[{"id":"assertion.concept.nist.eulersformula","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Euler's formula as: For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","support":[{"end":185,"quote":"For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","source_id":"nist-dads.eulersformula","source_sha256":"a79b39b7e5b4092302d4af23f8dcb98a4d4caa47ed6cfcd073db2029f0b03117","start":57}],"target_id":"concept.nist.eulersformula","target_kind":"node","target_sha256":"2a7020cbe79d0becc1ddddb78635afc2a69e67cab351611110ed849ea6a191cf"}],"concept.nist.excell":[{"id":"assertion.concept.nist.excell","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines EXCELL as: A point access method using a dynamic multidimensional array .","support":[{"end":105,"quote":"A\npoint access method\nusing a dynamic multidimensional\narray\n.","source_id":"nist-dads.excell","source_sha256":"f3950d4c93f2d5d8caa09f6ecaca7aaf0cc7e981b349f46f833433ccc5f05b29","start":43}],"target_id":"concept.nist.excell","target_kind":"node","target_sha256":"fdea8d06a9791b41c1eb88a8a03b1382060749b8ecd4700bcab3a20902b1cae3"}],"concept.nist.exclusivereadconwrt":[{"id":"assertion.concept.nist.exclusivereadconwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines exclusive read, concurrent write as: A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location. Also known as ERCW.","support":[{"end":291,"quote":"A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location.\nAlso known as\nERCW.","source_id":"nist-dads.exclusivereadconwrt","source_sha256":"baca4651f8fee9ec07b02964a811c267b5d1aeacb55403f67ba579d052f032a6","start":91}],"target_id":"concept.nist.exclusivereadconwrt","target_kind":"node","target_sha256":"76e1d018d5c50f1f21800cbba4b51f7b4d2efb746431d4ebe973fe5075ee8cc4"}],"concept.nist.exclusivereadexcluwrt":[{"id":"assertion.concept.nist.exclusivereadexcluwrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines exclusive read, exclusive write as: A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time. Also known as EREW.","support":[{"end":284,"quote":"A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time.\nAlso known as\nEREW.","source_id":"nist-dads.exclusivereadexcluwrt","source_sha256":"5b9c7f097234863bcb8631bdadc5752c4dd6fa0e9ed3d454b78a4cc87b1ae3f1","start":89}],"target_id":"concept.nist.exclusivereadexcluwrt","target_kind":"node","target_sha256":"a7c0043dd956187ce4090dddd8510494a678844a47917a2cecaa8f3969ba1f5b"}],"concept.nist.existentlstt":[{"id":"assertion.concept.nist.existentlstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines existential state as: A state in a nondeterministic Turing machine from which the machine accepts if any move leads to acceptance.","support":[{"end":169,"quote":"A state in a\nnondeterministic Turing machine\nfrom which the machine accepts if any move leads to acceptance.","source_id":"nist-dads.existentlstt","source_sha256":"b53c6e580548be35599e18aa72588980fe03d73ad0b0f161a521dbd1249cf753","start":61}],"target_id":"concept.nist.existentlstt","target_kind":"node","target_sha256":"f22688a6bcedd53b32490f5f3ad40ef2c0620c95cfb835ded13bc7cba0eb961a"}],"concept.nist.extendedbinarytree":[{"id":"assertion.concept.nist.extendedbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended binary tree as: A binary tree with special nodes replacing every null subtree. Every regular node has two children , and every special node has no children.","support":[{"end":212,"quote":"A\nbinary tree\nwith special\nnodes\nreplacing every\nnull\nsubtree.  Every regular node has two\nchildren\n, and every special node has no children.","source_id":"nist-dads.extendedbinarytree","source_sha256":"64476136bec4a084fc21927753b40c53a17cd9609adf7ede65ac9cf650611026","start":71}],"target_id":"concept.nist.extendedbinarytree","target_kind":"node","target_sha256":"7c4ab7ea353470ac5d88da03b965881164f894b21771aa764ded181b535bc6a1"}],"concept.nist.extendiblehashing":[{"id":"assertion.concept.nist.extendiblehashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extendible hashing as: A hash table in which the hash function is the last few bits of the key and the table refers to buckets . Table entries with the same final bits may use the same bucket. If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size. If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","support":[{"end":465,"quote":"A\nhash table\nin which the\nhash function\nis the last few bits of the\nkey\nand the table refers to\nbuckets\n.  Table entries with the same final bits may use the same bucket.  If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size.  If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","source_id":"nist-dads.extendiblehashing","source_sha256":"fc564903109bc91cd2946396e5d9c6f4c3018e3ebd4970f1186d22c08d001175","start":67}],"target_id":"concept.nist.extendiblehashing","target_kind":"node","target_sha256":"7c409b1e21e81a75f6ce5933735c190e02b44e373dfc447a8948589a864261b4"}],"concept.nist.extendkdtree":[{"id":"assertion.concept.nist.extendkdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended k-d tree as: A spatial access method where successive levels are split along different dimensions into nonoverlapping cells. Objects are indexed in all cells they intersect.","support":[{"end":226,"quote":"A\nspatial access method\nwhere successive levels are split along different dimensions into nonoverlapping cells.  Objects are indexed in all cells they intersect.","source_id":"nist-dads.extendkdtree","source_sha256":"3fdb98b348d6965f2bf4185aece53da22dfeaa519b46c3b50cc719fcb3f7e432","start":65}],"target_id":"concept.nist.extendkdtree","target_kind":"node","target_sha256":"b2a0c5203005d1efa585926cd54b691e4e8abf242735a71f5e31b560f775c701"}],"concept.nist.externalindx":[{"id":"assertion.concept.nist.externalindx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external index as: An auxiliary data structure added to a main data structure to improve operations, such as a search on a secondary key .","support":[{"end":178,"quote":"An auxiliary data structure added to a main data structure to improve operations, such as a\nsearch\non a secondary\nkey\n.","source_id":"nist-dads.externalindx","source_sha256":"efcc84a32a89e758ffc8e23bbc164a25d380f9a8552da3f424a1cdf634142bce","start":59}],"target_id":"concept.nist.externalindx","target_kind":"node","target_sha256":"9bc0e513f7b7d6f50f34c5f0fc5f5d5bcffd3dabda488d710fcb2918d299b4b7"}],"concept.nist.externalmemorydatastr":[{"id":"assertion.concept.nist.externalmemorydatastr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external memory data structure as: A data structure that is efficient even when accessing most of the data is very slow, such as, on a disk.","support":[{"end":196,"quote":"A\ndata structure\nthat is efficient even when accessing most of the data is very slow, such as, on a disk.","source_id":"nist-dads.externalmemorydatastr","source_sha256":"232858b56910135bf1fb67067090d6425fe1fce5d7d5659b1be0b537b494e1e2","start":91}],"target_id":"concept.nist.externalmemorydatastr","target_kind":"node","target_sha256":"e4622dbcd83d0003d2c11ed7424631a176179db9ee3b64102ae4d8cde3355887"}],"concept.nist.externalsort":[{"id":"assertion.concept.nist.externalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines external sort as: Any sort algorithm that uses external memory, such as tape or disk, during the sort. Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","support":[{"end":305,"quote":"Any\nsort\nalgorithm that uses external memory, such as tape or disk, during the sort.  Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","source_id":"nist-dads.externalsort","source_sha256":"55d6b1a58549e7ecb1dfd53d2e2fcf63ce1b79c2aaaee550e7d50a8e75fb1151","start":53}],"target_id":"concept.nist.externalsort","target_kind":"node","target_sha256":"47c07ed7388a1e975a85ec44f2c1727fc07d5fba781ccbd16b4159665ed7b870"}],"concept.nist.extremal":[{"id":"assertion.concept.nist.extremal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extremal as: Some of the entries of the auxiliary array used in a string matching algorithm. An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","support":[{"end":210,"quote":"Some of the entries of the auxiliary array used in a\nstring matching\nalgorithm.  An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","source_id":"nist-dads.extremal","source_sha256":"bb73171df50d96477035d4fc3d7db40295c4dfe79fe68b527e32fc781fecce82","start":43}],"target_id":"concept.nist.extremal","target_kind":"node","target_sha256":"83cd094b32e7ec91383ea94ac17697680ffce433d79f63ffe9b883494c0dde78"}],"concept.nist.extremepoint":[{"id":"assertion.concept.nist.extremepoint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extreme point as: A corner point of a polyhedron . More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","support":[{"end":194,"quote":"A corner point of a\npolyhedron\n.  More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","source_id":"nist-dads.extremepoint","source_sha256":"f7cc4cca486a18026a46bf72f92bc83ca057ce0275371ae52948e0f2e41a106b","start":53}],"target_id":"concept.nist.extremepoint","target_kind":"node","target_sha256":"63d7f3caa84beeeb3e927c634f91c41e6d84455ca59e482abc14de026dd5d202"}],"concept.nist.facilityloc":[{"id":"assertion.concept.nist.facilityloc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance objective function . The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","support":[{"end":431,"quote":"Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance\nobjective function\n. The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","source_id":"nist-dads.facilityloc","source_sha256":"2c73e9db783d4077cc4f9a1f456969be84328f318126416ca51801f946a8ed88","start":66}],"target_id":"concept.nist.facilityloc","target_kind":"node","target_sha256":"7f3354b8131d5d7cc31f36d6c6faf07da7dc0f7c02ab860e4f38d75059525092"}],"concept.nist.feasibleregn":[{"id":"assertion.concept.nist.feasibleregn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feasible region as: The set of all possible solutions of an optimization problem .","support":[{"end":119,"quote":"The\nset\nof all possible solutions of an\noptimization problem\n.","source_id":"nist-dads.feasibleregn","source_sha256":"68683b888fd16222249a1cf04927eea6b518540e8ced137a8bf18329eaf34e55","start":57}],"target_id":"concept.nist.feasibleregn","target_kind":"node","target_sha256":"61d87e2399d763fad0b7344eb7c47588e1fbd0de627b51dcd59abafb22090ba0"}],"concept.nist.feasiblesltn":[{"id":"assertion.concept.nist.feasiblesltn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feasible solution as: Any element of the feasible region of an optimization problem .","support":[{"end":124,"quote":"Any element of the\nfeasible region\nof an\noptimization problem\n.","source_id":"nist-dads.feasiblesltn","source_sha256":"0517af75c221b92805011fc7148b6f7cce34a6cf8c80863c1f39430d355f4a50","start":61}],"target_id":"concept.nist.feasiblesltn","target_kind":"node","target_sha256":"440d95d141cdeb966a45f44ff3e0a337a2597b4653e4c317ad419ae97258af9c"}],"concept.nist.feedbackedgeset":[{"id":"assertion.concept.nist.feedbackedgeset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feedback edge set as: The smallest set of edges whose deletion results in an acyclic graph .","support":[{"end":131,"quote":"The smallest\nset\nof\nedges\nwhose deletion results in an\nacyclic graph\n.","source_id":"nist-dads.feedbackedgeset","source_sha256":"67609d2b2a71f31d2a18f56750cfff90bd043376f82365bbcc77cfe2ca7ee58d","start":61}],"target_id":"concept.nist.feedbackedgeset","target_kind":"node","target_sha256":"fb8839153d35c530291fc5f79f8c5fbde973657e1f8a7593716a4ab1c1e5ea0a"}],"concept.nist.feedbackvertexset":[{"id":"assertion.concept.nist.feedbackvertexset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines feedback vertex set as: The smallest set of vertices whose deletion results in an acyclic graph .","support":[{"end":138,"quote":"The smallest\nset\nof\nvertices\nwhose deletion results in an\nacyclic graph\n.","source_id":"nist-dads.feedbackvertexset","source_sha256":"071a146c91c3c74f683d8ebb014d0c54a6fffebfe961aafa9410ac57bbc9641a","start":65}],"target_id":"concept.nist.feedbackvertexset","target_kind":"node","target_sha256":"92837dc3b4d8725524fb08bcca58742080d687aa94b796bedee76210aa2f95ea"}],"concept.nist.fibonacciheap":[{"id":"assertion.concept.nist.fibonacciheap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Fibonacci heap as: A heap made of a forest of trees . The amortized cost of the operations create, insert a value, decrease a value, find minimum, and merge or join ( meld ) two heaps, is a constant Θ(1) . The delete operation takes O(log n) .","support":[{"end":285,"quote":"A\nheap\nmade of a\nforest\nof\ntrees\n.  The\namortized cost\nof the operations create, insert a value, decrease a value, find minimum, and merge or join (\nmeld\n) two heaps, is a constant\nΘ(1)\n.  The delete operation takes\nO(log n)\n.","source_id":"nist-dads.fibonacciheap","source_sha256":"610beb2ac26b81c97a7cc813ce0215514ba162ce84ce0fa100763aaa009085af","start":59}],"target_id":"concept.nist.fibonacciheap","target_kind":"node","target_sha256":"541c02cb38ca5238d575555e55a7f60b89744428d367516d16aeed5e75ccd11e"}],"concept.nist.fibonaccitree":[{"id":"assertion.concept.nist.fibonaccitree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Fibonacci tree as: A variant of a binary tree where a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2. An order 0 Fibonacci tree has no nodes , and an order 1 tree has 1 node.","support":[{"end":255,"quote":"A variant of a\nbinary tree\nwhere a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2.  An order 0 Fibonacci tree has no\nnodes\n, and an order 1 tree has 1 node.","source_id":"nist-dads.fibonaccitree","source_sha256":"14c4da10b4c2cd742455d1902fb1db8decb570ce0729783ff010e0b0455f6734","start":59}],"target_id":"concept.nist.fibonaccitree","target_kind":"node","target_sha256":"40ff85dd6d16b9fff774545c31e9ce9bb59b87c0569ba97147c3bf5458512ce5"}],"concept.nist.finitarytree":[{"id":"assertion.concept.nist.finitarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines finitary tree as: A tree with a finite number of children at every node .","support":[{"end":112,"quote":"A\ntree\nwith a finite number of\nchildren\nat every\nnode\n.","source_id":"nist-dads.finitarytree","source_sha256":"f1862b2e470339d25d7d180bb828be8c51616951e38c768db1ae6a73a9ebad73","start":57}],"target_id":"concept.nist.finitarytree","target_kind":"node","target_sha256":"9acd529764ba81355f1e559ea193135010a0f223b4340922b17bc9edc27013bf"}],"concept.nist.finitestatemachine":[{"id":"assertion.concept.nist.finitestatemachine","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines finite state machine as: A model of computation consisting of a set of states , a start state , an input alphabet , and a transition function that maps input symbols and current states to a next state . Computation begins in the start state with an input string. It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions ( Mealy machine ) or states ( Moore machine ), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state ( nondeterministic finite state machine ), one or more states designated as accepting states ( recognizer ), etc. Also known as finite state automaton.","support":[{"end":800,"quote":"A\nmodel of computation\nconsisting of a set of\nstates\n, a\nstart state\n, an input\nalphabet\n, and a\ntransition function\nthat maps input symbols and current states to a\nnext state\n. Computation begins in the start state with an input string.  It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions (\nMealy machine\n) or states (\nMoore machine\n), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state (\nnondeterministic finite state machine\n), one or more states designated as\naccepting states\n(\nrecognizer\n), etc.\nAlso known as\nfinite state automaton.","source_id":"nist-dads.finitestatemachine","source_sha256":"d9bb803f66f7f32cf883d80607bf602162ac8b0b34fa93ccdc0cc66cf772b015","start":67}],"target_id":"concept.nist.finitestatemachine","target_kind":"node","target_sha256":"3c50e32f68a17914860ef20bbea67d9f220d152ae645c0cfecf1b230a87fdaad"}],"concept.nist.finitestatetransducer":[{"id":"assertion.concept.nist.finitestatetransducer","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines finite state transducer as: A finite state machine specifically with a read-only input and a write-only output. The input and output cannot be reread or changed.","support":[{"end":207,"quote":"A\nfinite state machine\nspecifically with a read-only input and a write-only output.  The input and output cannot be reread or changed.","source_id":"nist-dads.finitestatetransducer","source_sha256":"334341c777b605dc5e995c5e440cbde69a2e420504de6fe10f9548de894ac71d","start":73}],"target_id":"concept.nist.finitestatetransducer","target_kind":"node","target_sha256":"c0ee1eb5e90925b7c09e3723132a23e997c5b63e5418c09ddb13cf1142a86ad4"}],"concept.nist.firstinfrstt":[{"id":"assertion.concept.nist.firstinfrstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines first-in, first-out as: A policy that items are processed in order of arrival. A queue implements this.","support":[{"end":145,"quote":"A policy that items are processed in order of arrival.  A\nqueue\nimplements this.","source_id":"nist-dads.firstinfrstt","source_sha256":"51c64c582a19cdf3f12d72b90906b527cb9fed75da7cf5b0bef0fe6afc6195e2","start":65}],"target_id":"concept.nist.firstinfrstt","target_kind":"node","target_sha256":"79f8ba5ee2ab2959539c14e7ae59e9754cef73e640d4f9b91ea64358f82764f8"}],"concept.nist.fixedgrdmthd":[{"id":"assertion.concept.nist.fixedgrdmthd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fixed-grid method as: Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","support":[{"end":234,"quote":"Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","source_id":"nist-dads.fixedgrdmthd","source_sha256":"ca619315703e9d6b9c31188fc98cc9ed9fa1d47d6bb12971ab17d6710d738485","start":61}],"target_id":"concept.nist.fixedgrdmthd","target_kind":"node","target_sha256":"01cf7068e32ef3c94b669779fd04216da25725adf96d1c82e324abc466e0f6ea"}],"concept.nist.flow":[{"id":"assertion.concept.nist.flow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow as: A measure of the maximum weight along paths in a weighted, directed graph .","support":[{"end":110,"quote":"A measure of the maximum weight along\npaths\nin a\nweighted, directed graph\n.","source_id":"nist-dads.flow","source_sha256":"4fe4394cb88f0e9a27d595921395352f3231bfb870eec56607f0c78386069dfe","start":35}],"target_id":"concept.nist.flow","target_kind":"node","target_sha256":"843a207f8c1250fef33ff19ddb929a3cd4193d85e29160719af48c8616738bfd"}],"concept.nist.flowconsrvtn":[{"id":"assertion.concept.nist.flowconsrvtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow conservation as: The property that no vertex , except the source and sink , of a flow network creates or stores flow. More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","support":[{"end":252,"quote":"The property that no\nvertex\n, except the\nsource\nand\nsink\n, of a\nflow network\ncreates or stores flow.  More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","source_id":"nist-dads.flowconsrvtn","source_sha256":"ddcef55770c66947c806375302d04eef558d5841810f59561294cd33a4d5ccda","start":61}],"target_id":"concept.nist.flowconsrvtn","target_kind":"node","target_sha256":"99718c320c2bd6c80256c28744875ca4984a8dd245d1d6d58f0074669d76840b"}],"concept.nist.flowfunction":[{"id":"assertion.concept.nist.flowfunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow function as: An assignment of flow values to the edges of a flow network that satisfies flow conservation , skew symmetry , and capacity constraints . Also known as network flow.","support":[{"end":218,"quote":"An assignment of flow values to the\nedges\nof a\nflow network\nthat satisfies\nflow conservation\n,\nskew symmetry\n, and\ncapacity constraints\n.\nAlso known as\nnetwork flow.","source_id":"nist-dads.flowfunction","source_sha256":"ffc8e935bcc98b50a4d315d6b0ec5ecbe2ed54fd8ec3e77afe9209b03068ab51","start":53}],"target_id":"concept.nist.flowfunction","target_kind":"node","target_sha256":"97f3a284e2c56554de9bc2711e0d13cb8558581665ab85baa7524ac68b925366"}],"concept.nist.flownetwork":[{"id":"assertion.concept.nist.flownetwork","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines flow network as: A weighted , directed graph with two specially marked nodes, the source s and the sink t, and a capacity function that maps edges to positive real numbers, u: E |→ ℜ + .","support":[{"end":220,"quote":"A\nweighted\n,\ndirected graph\nwith two specially marked nodes, the\nsource\ns and the\nsink\nt, and a\ncapacity\nfunction that maps\nedges\nto positive real numbers, u: E |→ ℜ\n+\n.","source_id":"nist-dads.flownetwork","source_sha256":"852d2c9ed9ff83bde5f6188d9b9a099baedf4a92458cb75bc0b48fae40466118","start":51}],"target_id":"concept.nist.flownetwork","target_kind":"node","target_sha256":"c1e5b362960c72b3218aaa73aebd4b4c30942f86701d47173a11e029fbbd6f00"}],"concept.nist.forest":[{"id":"assertion.concept.nist.forest","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forest as: A collection of one or more trees . Formal Definition: An undirected , acyclic graph .","support":[{"end":125,"quote":"A collection of one or more\ntrees\n.\nFormal Definition:\nAn\nundirected\n,\nacyclic graph\n.","source_id":"nist-dads.forest","source_sha256":"99e804470cc60455d89a1cac7b86539ac6a5af0ce12403b5c873283fe28e19cc","start":39}],"target_id":"concept.nist.forest","target_kind":"node","target_sha256":"08a54c3a56473e5fa07e73a1c7dcf05bc15c0c2182c27ffba89cd81f6affefd5"}],"concept.nist.forestedit":[{"id":"assertion.concept.nist.forestedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forest editing problem as: The problem of finding an edit script of minimum cost which transforms a given forest into another given forest.","support":[{"end":183,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\nforest\ninto another given forest.","source_id":"nist-dads.forestedit","source_sha256":"147e36035bfae9b252b23e4519b9db42be4b5cd26975e66a0cdc112ad8925efd","start":71}],"target_id":"concept.nist.forestedit","target_kind":"node","target_sha256":"aea6421c984d298786660fc4866f74541ae0df7172a387e6058e8a00f2260282"}],"concept.nist.formalmethod":[{"id":"assertion.concept.nist.formalmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines formal methods as: A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","support":[{"end":226,"quote":"A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","source_id":"nist-dads.formalmethod","source_sha256":"9ed8eb1e3d3178b609a2e010088fc858e2ee0ff4873e824d0901a1931d60de02","start":55}],"target_id":"concept.nist.formalmethod","target_kind":"node","target_sha256":"2db5628be0a64d612019d37ca1721e0a905867491daf6741696ce72079363521"}],"concept.nist.formalverf":[{"id":"assertion.concept.nist.formalverf","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines formal verification as: Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments. This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","support":[{"end":377,"quote":"Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments.  This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","source_id":"nist-dads.formalverf","source_sha256":"daa467642913765b9a6f17242ac6e40aff2dbfe7b98efe79a25c2b4c8839b58d","start":65}],"target_id":"concept.nist.formalverf","target_kind":"node","target_sha256":"dc0296cd3809d19c9d0cff0091fb57670cfcfae53f1ab78d968f9cd7c3532d54"}],"concept.nist.forwardindex":[{"id":"assertion.concept.nist.forwardindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines forward index as: An index into a set of texts . This is usually created as the first step to making an inverted index .","support":[{"end":160,"quote":"An index into a set of\ntexts\n.  This is usually created as the first step to making an\ninverted index\n.","source_id":"nist-dads.forwardindex","source_sha256":"b9575d58668ad1dd26381cac96b39b9b39ec417f102d5e064aac5bc4d267496d","start":57}],"target_id":"concept.nist.forwardindex","target_kind":"node","target_sha256":"5ea191fb6a137db4b73e7c505badd195896e032e621c9ece5775cc01c0d20b36"}],"concept.nist.fractional":[{"id":"assertion.concept.nist.fractional","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fractional solution as: Typically, a solution to a relaxation of an optimization problem .","support":[{"end":131,"quote":"Typically, a solution to a\nrelaxation\nof an\noptimization problem\n.","source_id":"nist-dads.fractional","source_sha256":"cfaf7dae83ce27f2456b74a7b4d5daf6b278cf3ccded4b1b29e4bf854a3cb56e","start":65}],"target_id":"concept.nist.fractional","target_kind":"node","target_sha256":"2c8885bd5ab671d89ed9aff1e9453b4f67c4a8e9ad6830a0f054ddc88f17387a"}],"concept.nist.fractionalknapsack":[{"id":"assertion.concept.nist.fractionalknapsack","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fractional knapsack problem as: Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of materials, a greedy algorithm finds the optimum. Take as much as possible of the material that is most valuable per unit volume. If there is still room, take as much as possible of the next most valuable material. Continue until the knapsack is full. Also known as continuous knapsack problem.","support":[{"end":577,"quote":"Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume.  Since we may take pieces (fractions) of materials, a\ngreedy algorithm\nfinds the optimum.  Take as much as possible of the material that is most valuable per unit volume.  If there is still room, take as much as possible of the next most valuable material.  Continue until the knapsack is full.\nAlso known as\ncontinuous knapsack problem.","source_id":"nist-dads.fractionalknapsack","source_sha256":"96269774579da6ac03f14eab4da0641e39e0c4c7613268a15aa631654b17eb37","start":86}],"target_id":"concept.nist.fractionalknapsack","target_kind":"node","target_sha256":"c958626a00032d079bc63d7d2c0c95f16ce3434795b9b50057323707d3f424e2"}],"concept.nist.freeedge":[{"id":"assertion.concept.nist.freeedge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free edge as: An edge which is not in a matching .","support":[{"end":81,"quote":"An\nedge\nwhich is not in a\nmatching\n.","source_id":"nist-dads.freeedge","source_sha256":"0cbede7db018a342e372a66e034b7c45d26ae3f1eb15bcaee260149716746295","start":45}],"target_id":"concept.nist.freeedge","target_kind":"node","target_sha256":"10e55f808a782da21d7fb999d90c55c30bd4c86030a2f3c64679a15538f3363b"}],"concept.nist.freetree":[{"id":"assertion.concept.nist.freetree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free tree as: A connected , acyclic , undirected graph .","support":[{"end":87,"quote":"A\nconnected\n,\nacyclic\n,\nundirected graph\n.","source_id":"nist-dads.freetree","source_sha256":"482afc2713c584f6593bf008b89bb285fc6192d218bac9c0520fd8e5ff41253f","start":45}],"target_id":"concept.nist.freetree","target_kind":"node","target_sha256":"4ba15da575d54b331f7d0552d120eb98b2af39f5680280fc5b34f0129140f078"}],"concept.nist.freevertex":[{"id":"assertion.concept.nist.freevertex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines free vertex as: A vertex not on a matched edge in a matching , or, one which has not been matched.","support":[{"end":131,"quote":"A\nvertex\nnot on a\nmatched edge\nin a\nmatching\n, or, one which has not been matched.","source_id":"nist-dads.freevertex","source_sha256":"0ab7fbb4fde8deac1d906d6d4064c1f6766e6a079342fbbf54fd0e91e386f012","start":49}],"target_id":"concept.nist.freevertex","target_kind":"node","target_sha256":"508ffa29013bd7450eacf3075cfb45f0d4a9350323d96b4077fb8677cef1d980"}],"concept.nist.fullbinarytree":[{"id":"assertion.concept.nist.fullbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines full binary tree as: A binary tree in which each node has exactly zero or two children . Also known as proper binary tree.","support":[{"end":164,"quote":"A\nbinary tree\nin which each\nnode\nhas exactly zero or two\nchildren\n.\nAlso known as\nproper binary tree.","source_id":"nist-dads.fullbinarytree","source_sha256":"59c736857d433098a0cbbc69b64c50939f4c7c56f7d8280dd89e6fba6e0f2421","start":63}],"target_id":"concept.nist.fullbinarytree","target_kind":"node","target_sha256":"a01917f77712798fbcf0f15ee6a7a1249604eb44d9d5584eb930762e672eb0b0"}],"concept.nist.fullinvertedindex":[{"id":"assertion.concept.nist.fullinvertedindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines full inverted index as: An inverted index that includes the exact location within texts, in addition to the text in which the word appears.","support":[{"end":184,"quote":"An\ninverted index\nthat includes the exact location within texts, in addition to the text in which the word appears.","source_id":"nist-dads.fullinvertedindex","source_sha256":"6be76eeea23db4958c9d3b721950a81f3ceaf818e801146ab171dd27c60073f4","start":69}],"target_id":"concept.nist.fullinvertedindex","target_kind":"node","target_sha256":"445cbe4afbdae47a6350e60421623341621b944b5c7bdf2f977ccc3421de581a"}],"concept.nist.fullydynamic":[{"id":"assertion.concept.nist.fullydynamic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully dynamic graph problem as: Problem where the update operations include unrestricted insertions and deletions of edges .","support":[{"end":173,"quote":"Problem where the update operations include unrestricted insertions and deletions of\nedges\n.","source_id":"nist-dads.fullydynamic","source_sha256":"6c1f24a69345ee6153f9c7d3b26b8161c2a7e30a8001b55f07186dbcfe1ef318","start":81}],"target_id":"concept.nist.fullydynamic","target_kind":"node","target_sha256":"0892c1d4021d6182a223efe7fbcd060bb9c15c52d94e309b642f8822778591d9"}],"concept.nist.fullypersistdata":[{"id":"assertion.concept.nist.fullypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully persistent data structure as: A persistent data structure that allows updates to all versions, previous and latest.","support":[{"end":174,"quote":"A\npersistent data structure\nthat allows updates to all versions, previous and latest.","source_id":"nist-dads.fullypersistdata","source_sha256":"a03b9b597f1ce78c55bcff98e4d36b7b2e8b997235c77a4abd6bc078be79e135","start":89}],"target_id":"concept.nist.fullypersistdata","target_kind":"node","target_sha256":"a64148e2a8171c6ad9ca0020210013ae605b8de526cbdd0a5d94a5c47337629d"}],"concept.nist.function":[{"id":"assertion.concept.nist.function","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines function as: (1) A computation which takes some arguments or inputs and yields an output. Any particular input yields the same output every time. More formally, a mapping from each element in the domain to an element in the range . (2) A subroutine which returns a value.","support":[{"end":304,"quote":"(1) A computation which takes some arguments or inputs and yields an output.  Any particular input yields the same output every time.  More formally, a mapping from each element in the\ndomain\nto an element in the\nrange\n.  (2) A subroutine which returns a value.","source_id":"nist-dads.function","source_sha256":"3e48512c2ab9dc97adf628c45a8566dc6be250c5f22de9c26239619e29fceda5","start":43}],"target_id":"concept.nist.function","target_kind":"node","target_sha256":"d1bd965537408d0851c169bc82257905dbf27611d67449e7eeb8c72f4d28e3e6"}],"concept.nist.gbdtree":[{"id":"assertion.concept.nist.gbdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines GBD-tree as: A generalized BD-tree , hence the name, which stores spatially extended objects as a hierarchy of minimum bounding boxes . It is a balanced multiway tree which serves as a spatial access method .","support":[{"end":244,"quote":"A generalized\nBD-tree\n, hence the name, which stores spatially extended objects as a hierarchy  of\nminimum bounding boxes\n.  It is a balanced multiway tree which serves as a\nspatial access method\n.","source_id":"nist-dads.gbdtree","source_sha256":"bd3dbf8aeb379ea7d5416a5779e7325e80c55d9fd0c3eb880a8eebfa9ccf93fe","start":47}],"target_id":"concept.nist.gbdtree","target_kind":"node","target_sha256":"14d886a9f5417806027b48a668344fd6346ebd50003c7eccec4ef4a936fddc5e"}],"concept.nist.geometricopt":[{"id":"assertion.concept.nist.geometricopt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines geometric optimization problem as: An optimization problem induced by a collection of geometric objects.","support":[{"end":156,"quote":"An\noptimization problem\ninduced by a collection of geometric objects.","source_id":"nist-dads.geometricopt","source_sha256":"dd94d9c5d5c1434efdb8f7a990df4baba9a6413752d3daf0fd89d8e952ad7259","start":87}],"target_id":"concept.nist.geometricopt","target_kind":"node","target_sha256":"0a206afddbdf8ff17b83ea22db586b8c4faa58a78fe46569e90c1c1aaa4a47b0"}],"concept.nist.globaloptimum":[{"id":"assertion.concept.nist.globaloptimum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines global optimum as: The best possible solution to a problem.","support":[{"end":95,"quote":"The best possible solution to a problem.","source_id":"nist-dads.globaloptimum","source_sha256":"a36ff5943cdfd2e913fcc876fcc559eb11d82c2261aa6f590f1a1761c4484e5c","start":55}],"target_id":"concept.nist.globaloptimum","target_kind":"node","target_sha256":"46402dfadf897aae42e64372676c5f00a53a98b6f0f623aa340cc0fb3d5f5452"}],"concept.nist.graph":[{"id":"assertion.concept.nist.graph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines graph as: A set of items connected by edges . Each item is called a vertex or node . Formally, a graph is a set of vertices and a binary relation between vertices, adjacency. Formal Definition: A graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is symmetric , or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow self-loops , adjacency is irreflexive .","support":[{"end":594,"quote":"A set of items connected by\nedges\n.  Each item is called a\nvertex\nor\nnode\n.  Formally, a graph is a\nset\nof vertices and a\nbinary relation\nbetween vertices, adjacency.\nFormal Definition:\nA graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is\nsymmetric\n, or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n.","source_id":"nist-dads.graph","source_sha256":"f8640c0a5038ec364d37f157c2059a307aaf0fa359dd306a30d76c791079b55d","start":41}],"target_id":"concept.nist.graph","target_kind":"node","target_sha256":"e7c7df91664ec6182e10ac82e673e0de066eafe14390b2009200816f40b99f6f"}],"concept.nist.graphconcen":[{"id":"assertion.concept.nist.graphconcen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph concentration as: Contracting a graph by removing a subset of the vertices .","support":[{"end":123,"quote":"Contracting a\ngraph\nby removing a subset of the\nvertices\n.","source_id":"nist-dads.graphconcen","source_sha256":"764560fbf6660a1518ffb93b6fdb17026dec7ac8835fb7ba3e3f4bcfd0bb50d6","start":65}],"target_id":"concept.nist.graphconcen","target_kind":"node","target_sha256":"c371305e70c88eca7d34da913177232d11f2010121c97ed5faa99accb2b9bf09"}],"concept.nist.graphdrawing":[{"id":"assertion.concept.nist.graphdrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph drawing as: The problem of representing a graph in a plane \"neatly,\" for instance with a minimum number of edge crossings .","support":[{"end":169,"quote":"The problem of representing a\ngraph\nin a plane \"neatly,\" for instance with a minimum number of\nedge crossings\n.","source_id":"nist-dads.graphdrawing","source_sha256":"70834f6f91394d32ebe5424e840d36a2c2dc09d4ef1b67ec1064d231f7ed69f4","start":58}],"target_id":"concept.nist.graphdrawing","target_kind":"node","target_sha256":"4d2c10145c26cdcf33c67107ee1f18c2a756ff3fc171c0056197ad9edd43bd28"}],"concept.nist.graphisomrph":[{"id":"assertion.concept.nist.graphisomrph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph isomorphism as: Determine if two graphs are isomorphic .","support":[{"end":106,"quote":"Determine if two\ngraphs\nare\nisomorphic\n.","source_id":"nist-dads.graphisomrph","source_sha256":"a783850cd266bbf061d7c275027724a7a61ef8ed9085ed140d26390b8bcc9e51","start":66}],"target_id":"concept.nist.graphisomrph","target_kind":"node","target_sha256":"6a1a2a95e7307183d3a8be59aa4a3cbfff0d34dfe914fda58c16c5ddf664998c"}],"concept.nist.graphpartition":[{"id":"assertion.concept.nist.graphpartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines graph partition as: Partition the vertices while keeping the cost of spanning edges low.","support":[{"end":130,"quote":"Partition\nthe\nvertices\nwhile keeping the cost of spanning\nedges\nlow.","source_id":"nist-dads.graphpartition","source_sha256":"3cfeac926bee4537091575a1843d5f94140df9c01c25320ebe38b515cb78ae5b","start":62}],"target_id":"concept.nist.graphpartition","target_kind":"node","target_sha256":"f9fbe260c8e525d426819822334cb27a0423b8389aacdf0f895805e1c52df7f8"}],"concept.nist.griddrawing":[{"id":"assertion.concept.nist.griddrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines grid drawing as: A graph drawing in which each vertex is represented by a point with integer coordinates.","support":[{"end":139,"quote":"A\ngraph drawing\nin which each\nvertex\nis represented by a point with integer coordinates.","source_id":"nist-dads.griddrawing","source_sha256":"ca1775f228c407ba35e361baba9dc1df0b49d6197669fbaae5305cfa8c03010d","start":51}],"target_id":"concept.nist.griddrawing","target_kind":"node","target_sha256":"7154c7d94d50f21c778f427e6f52ec0aac57c582df1eea3f4c5ac219b20fce01"}],"concept.nist.gridfile":[{"id":"assertion.concept.nist.gridfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines grid file as: A point access method which splits space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Small sets of points are referred to by one or more cells of the grid.","support":[{"end":240,"quote":"A\npoint access method\nwhich splits space into a nonperiodic grid.  Each spatial dimension is divided by a\nlinear hash\n.  Small sets of points are referred to by one or more cells of the grid.","source_id":"nist-dads.gridfile","source_sha256":"80bb48ecd9eca8eafa2dbcc12c2204ca93cc19317bd87a760380a51de7cb47de","start":49}],"target_id":"concept.nist.gridfile","target_kind":"node","target_sha256":"9ac8e6b5416e9b32fb41626cf3a8aa31b06df190003455ec829b352ef5e587c7"}],"concept.nist.haltingproblem":[{"id":"assertion.concept.nist.haltingproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines halting problem as: Is there an algorithm to determine whether any arbitrary program halts? Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although heuristic or partial solutions are possible.","support":[{"end":335,"quote":"Is there an\nalgorithm\nto determine whether any arbitrary program halts?  Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although\nheuristic\nor partial solutions are possible.","source_id":"nist-dads.haltingproblem","source_sha256":"8960aa888162b4a9428e3868ac8ffd0ad66eadce962ed62bab9b4dd76898b6f6","start":62}],"target_id":"concept.nist.haltingproblem","target_kind":"node","target_sha256":"0b4fa316e032a027d3df625cd4adc0d970e2f13718e07b505b82830f511c4164"}],"concept.nist.hamiltoniancycle":[{"id":"assertion.concept.nist.hamiltoniancycle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hamiltonian cycle as: A path through a graph that starts and ends at the same vertex and includes every other vertex exactly once. Also known as tour.","support":[{"end":189,"quote":"A\npath\nthrough a\ngraph\nthat starts and ends at the same\nvertex\nand includes every other vertex exactly once.\nAlso known as\ntour.","source_id":"nist-dads.hamiltoniancycle","source_sha256":"87631238cd86c40471ede50aadf8435fa8fd72bd0c3620d37d7395941d2679c9","start":61}],"target_id":"concept.nist.hamiltoniancycle","target_kind":"node","target_sha256":"b7b4a3040faea5ce8cc5153cbc914f4fdebaf8b4010b9fbadf8642d6454d34d7"}],"concept.nist.hamiltonianpath":[{"id":"assertion.concept.nist.hamiltonianpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hamiltonian path as: A simple path through a graph that includes every vertex in the graph.","support":[{"end":129,"quote":"A\nsimple path\nthrough a\ngraph\nthat includes every vertex in the graph.","source_id":"nist-dads.hamiltonianpath","source_sha256":"452f2fc95acb285ff925a92ac18e02f43733563a679d5e47b7a9391a43f5f3f8","start":59}],"target_id":"concept.nist.hamiltonianpath","target_kind":"node","target_sha256":"cec35f9f2af5981e2df939f04567a5ad6992d052f5ace165303c2d627a959e64"}],"concept.nist.hashbelt":[{"id":"assertion.concept.nist.hashbelt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hashbelt as: Use a short list or array of hash tables to implement a hash table with aging to expire items. To expire items, add a new table at the head of the list and drop the oldest table, along with its contents. To find an item, search all the tables.","support":[{"end":292,"quote":"Use a short\nlist\nor\narray\nof\nhash tables\nto implement a hash table with aging to expire items.  To expire items, add a new table at the\nhead\nof the list and drop the oldest table, along with its contents.  To find an item, search all the tables.","source_id":"nist-dads.hashbelt","source_sha256":"b1a9818c3ffec1fc875f15272280e5bf96969d00353844dd90f2c58059a08627","start":47}],"target_id":"concept.nist.hashbelt","target_kind":"node","target_sha256":"44d7e3bb6a38db7629675eb36ab0b098dcdfbbb158847c44b705760f753aa873"}],"concept.nist.hashheap":[{"id":"assertion.concept.nist.hashheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hash heap as: An efficient implementation of a priority queue . The linear hash function monotonically maps keys to buckets , and each bucket is a heap .","support":[{"end":189,"quote":"An efficient implementation of a\npriority queue\n.  The\nlinear hash\nfunction monotonically maps keys to\nbuckets\n, and each bucket is a\nheap\n.","source_id":"nist-dads.hashheap","source_sha256":"71cd9087e0bd5eabefccadd47ea0550b4f1b7cb2f9de4f57c0e00425a4420a69","start":49}],"target_id":"concept.nist.hashheap","target_kind":"node","target_sha256":"4a2fc1cd07fc7fbdaf0a2f0a41b13d9043e416090fef42a7b3fca08b6c2bb505"}],"concept.nist.hashtab":[{"id":"assertion.concept.nist.hashtab","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines hash table as: A dictionary in which keys are mapped to array positions by hash functions . Having the keys of more than one item map to the same position is called a collision . There are many collision resolution schemes , but they may be divided into open addressing , chaining , and keeping one special overflow area. Perfect hashing avoids collisions, but may be time-consuming to create. Also known as scatter storage.","support":[{"end":461,"quote":"A\ndictionary\nin which\nkeys\nare mapped to\narray\npositions by\nhash functions\n.  Having the\nkeys\nof more than one item map to the same position is called a\ncollision\n. There are many\ncollision resolution schemes\n, but they may be divided into\nopen addressing\n,\nchaining\n, and keeping one special overflow area.\nPerfect hashing\navoids collisions, but may be time-consuming to create.\nAlso known as\nscatter storage.","source_id":"nist-dads.hashtab","source_sha256":"6a3a65e426ae840cca0723d999fba31e3a24dabdb874a34e2f33a3412197dbd7","start":51}],"target_id":"concept.nist.hashtab","target_kind":"node","target_sha256":"1fc91d91a216db73b154a18a1ff2d1d8d8eeb0220b4d7c398a0a7801780bdecd"}],"concept.nist.hausdorffdst":[{"id":"assertion.concept.nist.hausdorffdst","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Hausdorff distance as: A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max a∈ P min b∈ Q d(a,b), max a∈ Q min b∈ P d(a,b)} where d(·,·) is the distance metric, usually the Euclidean distance .","support":[{"end":284,"quote":"A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max\na∈ P\nmin\nb∈ Q\nd(a,b), max\na∈ Q\nmin\nb∈ P\nd(a,b)} where d(·,·) is the distance metric, usually the\nEuclidean distance\n.","source_id":"nist-dads.hausdorffdst","source_sha256":"ef12026c8fa115d7b4360832291cb29e84bc5b3c76a002b8f4fe534666dbfd0e","start":63}],"target_id":"concept.nist.hausdorffdst","target_kind":"node","target_sha256":"23d24ea961a817aa1c97e9daa22961363770cb9a0febb343e95e262eb445a217"}],"concept.nist.hbtree":[{"id":"assertion.concept.nist.hbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hB-tree as: A point access method which uses k-d trees to organize the space, but partitions as excluded intervals, like the BANG file . Searching is like in a k-d-B-tree .","support":[{"end":206,"quote":"A\npoint access method\nwhich uses\nk-d trees\nto organize the space, but partitions as excluded intervals, like the\nBANG file\n.  Searching is like in a\nk-d-B-tree\n.","source_id":"nist-dads.hbtree","source_sha256":"d19876a2b23782a66ce886161884be3206e64bf4848ee8d602a01de29a33b0d5","start":45}],"target_id":"concept.nist.hbtree","target_kind":"node","target_sha256":"50361ce73ad2366ff848a334f6916636ae30c0c607f64fcbad470f671168e5c9"}],"concept.nist.head":[{"id":"assertion.concept.nist.head","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines head as: The first item of a list .","support":[{"end":61,"quote":"The first item of a\nlist\n.","source_id":"nist-dads.head","source_sha256":"66bc07992ed31f8b3abc2696c2cdc366bf37e82bbf363ed193e0691e8f6c56cd","start":35}],"target_id":"concept.nist.head","target_kind":"node","target_sha256":"26e0db5a85920bed9d57751d94bf30bb6871e6e6a70c452772c42fae40fc037e"}],"concept.nist.heap":[{"id":"assertion.concept.nist.heap","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines heap as: A complete tree where every node has a key more extreme (greater or less) than or equal to the key of its parent . Usually understood to be a binary heap .","support":[{"end":194,"quote":"A\ncomplete tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than or equal to the key of its\nparent\n. Usually understood to be a\nbinary heap\n.","source_id":"nist-dads.heap","source_sha256":"bd88f90f73f23ffcb2a38301fe9738ce58a84dd31f1dacb29438ccc62d953951","start":39}],"target_id":"concept.nist.heap","target_kind":"node","target_sha256":"64d24dd7801f67d76986e89499412bd1eec08cca9ad894ab800f1483afd4ceb6"}],"concept.nist.heapproperty":[{"id":"assertion.concept.nist.heapproperty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heap property as: Each node in a tree has a key which is more extreme (greater or less) than or equal to the key of its parent .","support":[{"end":163,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is more extreme (greater or less) than or equal to the key of its\nparent\n.","source_id":"nist-dads.heapproperty","source_sha256":"2b17e233642fa859356abf7ef364c6e389e549de2303b575fab44104e56d68c3","start":53}],"target_id":"concept.nist.heapproperty","target_kind":"node","target_sha256":"8b4e29ca54dd9b49f91de6aaa617615cdc93b7830fc884c8a367fbf1fb8099ee"}],"concept.nist.height":[{"id":"assertion.concept.nist.height","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height as: The maximum distance of any node from the root . If a tree has only one node (the root), the height is zero. The height of an empty tree is not defined.","support":[{"end":193,"quote":"The maximum distance of any\nnode\nfrom the\nroot\n. If a tree has only one node (the root), the height is zero.   The height of an empty tree is not defined.","source_id":"nist-dads.height","source_sha256":"c75850a5ebceaa3755e699fff0936c2612a1f6697a2290232d23438dc941387d","start":39}],"target_id":"concept.nist.height","target_kind":"node","target_sha256":"01a954a7a61391a11c8b342927923f553e9a233f57f8632a4e6ed77275315065"}],"concept.nist.heightbalancedbinsrchtree":[{"id":"assertion.concept.nist.heightbalancedbinsrchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height-balanced binary search tree as: A height-balanced tree which is also a binary search tree . It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree.","support":[{"end":268,"quote":"A\nheight-balanced tree\nwhich is also a\nbinary search tree\n. It supports membership, insert, and delete operations in time\nlogarithmic\nin the number of\nnodes\nin the tree.","source_id":"nist-dads.heightbalancedbinsrchtree","source_sha256":"318eecf4d1b6bc2cbf0d5038773e60d6a84018eb8c979780448709def2e0711e","start":99}],"target_id":"concept.nist.heightbalancedbinsrchtree","target_kind":"node","target_sha256":"36621ab927f88e28b553fb19036ae934514d6b785bbfef2a6a358762efcfabeb"}],"concept.nist.heightbalancedtree":[{"id":"assertion.concept.nist.heightbalancedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines height-balanced tree as: A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced.","support":[{"end":207,"quote":"A tree whose\nsubtrees\ndiffer in\nheight\nby no more than one and the subtrees are height-balanced, too.  An empty tree is height-balanced.","source_id":"nist-dads.heightbalancedtree","source_sha256":"cf1c7dc85633c0b8609d6873742ad54d25944d4670c5e779b4873967563230c1","start":71}],"target_id":"concept.nist.heightbalancedtree","target_kind":"node","target_sha256":"91441616a9e0db9a5905ec7c742a8ea1b8923f7f8bf90e269c0f8e85fdeb98a7"}],"concept.nist.homeomorphic":[{"id":"assertion.concept.nist.homeomorphic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines homeomorphic as: Two graphs are homeomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges .","support":[{"end":160,"quote":"Two\ngraphs\nare homeomorphic if they can be made\nisomorphic\nby inserting new\nvertices\nof\ndegree\n2 into\nedges\n.","source_id":"nist-dads.homeomorphic","source_sha256":"83bb0591a12592193d6cdba97f1f0801d4cbf262e08c2cc15167c3d93c7405de","start":51}],"target_id":"concept.nist.homeomorphic","target_kind":"node","target_sha256":"1ac0a2fde679ea1b6b76792cd1b097bb2974cae607caddb0afc7351a87bc5566"}],"concept.nist.horizontalvismap":[{"id":"assertion.concept.nist.horizontalvismap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines horizontal visibility map as: A partition of the plane into regions by drawing a horizontal straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be horizontally visible from p.","support":[{"end":328,"quote":"A partition of the plane into regions by drawing a horizontal straight line through each\nvertex\np of a planar straight-line\ngraph\nuntil it intersects an\nedge\ne of the graph or extends to infinity.  The edge e is said to be horizontally visible from p.","source_id":"nist-dads.horizontalvismap","source_sha256":"d73e2cd208d5a341f04b09e8dbc232c7af5671a2f1d8b79e01d2760cd3df7f94","start":77}],"target_id":"concept.nist.horizontalvismap","target_kind":"node","target_sha256":"897fc3b43d924dabdbdffc417ea7209abd4310a8964db0cd30525e598c516f4b"}],"concept.nist.hybridalgorithm":[{"id":"assertion.concept.nist.hybridalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hybrid algorithm as: Any algorithm composed of simpler algorithms.","support":[{"end":104,"quote":"Any algorithm composed of simpler algorithms.","source_id":"nist-dads.hybridalgorithm","source_sha256":"50b7111621dcdb6818368378359e96cba3a20851ab0ca48ccb3d1c564a092370","start":59}],"target_id":"concept.nist.hybridalgorithm","target_kind":"node","target_sha256":"2149d20c12d911abab2f2811173fb33b17a3eecff33513c0272bbea9092f57f9"}],"concept.nist.hyperedge":[{"id":"assertion.concept.nist.hyperedge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hyperedge as: A connection between any number of vertices of a hypergraph . Formal Definition: A hyperedge is a set of vertices of a hypergraph.","support":[{"end":175,"quote":"A connection between any number of\nvertices\nof a\nhypergraph\n.\nFormal Definition:\nA hyperedge is a\nset\nof vertices of a hypergraph.","source_id":"nist-dads.hyperedge","source_sha256":"a2f70c7e140e555b748e0355cb56a72f2ec44bcd0f3720280d61f836e74f4b78","start":45}],"target_id":"concept.nist.hyperedge","target_kind":"node","target_sha256":"054608f23fff0da2a28cddf8d0c89f3b4af3d9caaa7554fefeeaaa15acaa10de"}],"concept.nist.implication":[{"id":"assertion.concept.nist.implication","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines implication as: The boolean implies function.","support":[{"end":78,"quote":"The boolean\nimplies\nfunction.","source_id":"nist-dads.implication","source_sha256":"0131ef5caee89fc51e9c4cb896c68a47982639330fc08e6a5503c28fb7e55558","start":49}],"target_id":"concept.nist.implication","target_kind":"node","target_sha256":"b7d6baf52469d686542c2956d890c340690c6cc02de14cc6e5436731f6a52ae6"}],"concept.nist.implies":[{"id":"assertion.concept.nist.implies","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines implies as: Implication: 0 → 0 = 1, 0 → 1 = 1, 1 → 0 = 0, 1 → 1 = 1.","support":[{"end":98,"quote":"Implication: 0 → 0 = 1, 0 → 1 = 1,  1 → 0 = 0, 1 → 1 = 1.","source_id":"nist-dads.implies","source_sha256":"da343c2e9d2e472a3ecfb67c4e66983e1c2b03080cd79d1147b3d006dd6f8fde","start":41}],"target_id":"concept.nist.implies","target_kind":"node","target_sha256":"fcc02af0b7e317bac7a0b839ccb58579aa13fd4cc0e978757f9abe2fac7188e0"}],"concept.nist.incompressbl":[{"id":"assertion.concept.nist.incompressbl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines incompressible string as: A string whose Kolmogorov complexity equals its length, so that it has no shorter encodings.","support":[{"end":161,"quote":"A\nstring\nwhose\nKolmogorov complexity\nequals its length, so that it has no shorter encodings.","source_id":"nist-dads.incompressbl","source_sha256":"3610cfe43bd93d28169f97d08e5d189742acf18947e6b2b15426e8233d8813b3","start":69}],"target_id":"concept.nist.incompressbl","target_kind":"node","target_sha256":"f2d293c75e74ddc83a7b5090e3ec42fed676299235c04e063d981b44398be0fa"}],"concept.nist.indegree":[{"id":"assertion.concept.nist.indegree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines in-degree as: The number of edges coming into a vertex in a directed graph .","support":[{"end":107,"quote":"The number of\nedges\ncoming into a\nvertex\nin a\ndirected graph\n.","source_id":"nist-dads.indegree","source_sha256":"6213b3b13345c9e70095c0d7ceefc4a67d7a6fcec5649d27ea499d4fdd5ed5f2","start":45}],"target_id":"concept.nist.indegree","target_kind":"node","target_sha256":"f0fef4277f3ca30d061c868c760818b4aa127acdc791a477ea11b77479783482"}],"concept.nist.independentset":[{"id":"assertion.concept.nist.independentset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them.","support":[{"end":152,"quote":"A set of\nvertices\nin a\ngraph\nsuch that for any pair of vertices, there is no\nedge\nbetween them.","source_id":"nist-dads.independentset","source_sha256":"d587d6b19cb682ff575cbb13626501598891fb0c1bfd1a8eda6dcef380fc0945","start":57}],"target_id":"concept.nist.independentset","target_kind":"node","target_sha256":"c0fa16db6bbb95ce2d55cfec00b46f3b00792cbdb9b2c20c316dba98fcedddd0"}],"concept.nist.indexfile":[{"id":"assertion.concept.nist.indexfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines index file as: A file which stores keys and an index into another file. The index file may have additional structure, e.g., be a B-tree .","support":[{"end":174,"quote":"A file which stores\nkeys\nand an index into another file.  The index file may have additional structure, e.g., be a\nB-tree\n.","source_id":"nist-dads.indexfile","source_sha256":"687f16570728444f79a0e37195ee1ac439f81d321118b7af27821d26090ba230","start":51}],"target_id":"concept.nist.indexfile","target_kind":"node","target_sha256":"09d56325e16e725a45769965a65bf0b608d51cf40f09dd238186877ccd78dccd"}],"concept.nist.information":[{"id":"assertion.concept.nist.information","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines information theoretic bound as: lower bounds on the execution of a computation based on the rate at which information can be accumulated.","support":[{"end":186,"quote":"lower bounds\non the execution of a computation based on the rate at which information can be accumulated.","source_id":"nist-dads.information","source_sha256":"ebdde44572bc6b7272d6fe7d6f175d37dc2c9ebb2ed9408937ff1d89fb4925cf","start":81}],"target_id":"concept.nist.information","target_kind":"node","target_sha256":"7d787f97d0693117b8116763d573b44b6d0eb5c5376455c298bfeac3d758ab6b"}],"concept.nist.integer":[{"id":"assertion.concept.nist.integer","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer polyhedron as: A polyhedron , all of whose extreme points are integer valued.","support":[{"end":125,"quote":"A\npolyhedron\n, all of whose\nextreme points\nare integer valued.","source_id":"nist-dads.integer","source_sha256":"c51b61e271028e2b1e72d9cfc99dfe06143f346f4e5aed6bd5058d0d7bd2a684","start":63}],"target_id":"concept.nist.integer","target_kind":"node","target_sha256":"00b9b9a073379f6e702c7d6248f274980d4b1bbda765824bb3b4dff09e67e1fd"}],"concept.nist.integerliner":[{"id":"assertion.concept.nist.integerliner","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer linear program as: A linear program with additional constraints that all of the variables must take on integer values. Solving such problems is NP-hard .","support":[{"end":206,"quote":"A\nlinear program\nwith additional constraints that all of the variables must take on integer values.  Solving such problems is\nNP-hard\n.","source_id":"nist-dads.integerliner","source_sha256":"9762357649d2a5de611cd375493a36f27e5a34a1a694191926818b351ee9f47d","start":71}],"target_id":"concept.nist.integerliner","target_kind":"node","target_sha256":"a6dd83e499e11b2014c1469c69cc1984d1431db7b727f0ad46451849ff43e651"}],"concept.nist.integermulti":[{"id":"assertion.concept.nist.integermulti","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines integer multi-commodity flow as: A multi-commodity flow in which the flow of each commodity through each edge must take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","support":[{"end":305,"quote":"A\nmulti-commodity flow\nin which the flow of each commodity through each\nedge\nmust take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","source_id":"nist-dads.integermulti","source_sha256":"ec2ec5ac599d43335170fafca6f5b8d1b31cd832cda866639f39e7c9971b46e3","start":83}],"target_id":"concept.nist.integermulti","target_kind":"node","target_sha256":"a556c276dbda2cf37f684a799658c4d523c574856cd8e9378c0c830c1e6d71b1"}],"concept.nist.interactvprf":[{"id":"assertion.concept.nist.interactvprf","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interactive proof system as: A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a string x in a given language , often with the goal of revealing no further details about this knowledge. The prover(s) and verifier are formally defined as probabilistic Turing machines with special \"interaction tapes\" for exchanging messages.","support":[{"end":490,"quote":"A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a\nstring\nx in a given\nlanguage\n, often with the goal of revealing no further details about this knowledge.  The prover(s) and verifier are formally defined as\nprobabilistic Turing machines\nwith special \"interaction tapes\" for exchanging messages.","source_id":"nist-dads.interactvprf","source_sha256":"2d07c67b893fdab5196f674ad3597e8df4ac9dc90db5df628efe314b179ae258","start":75}],"target_id":"concept.nist.interactvprf","target_kind":"node","target_sha256":"f6b4fdd64d82d8bf2b5b3192107e921fdfddca00f7d53da339a26cd719e4ade6"}],"concept.nist.interiorbasd":[{"id":"assertion.concept.nist.interiorbasd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interior-based representation as: A representation of a region that is based on its interior (i.e., the cells that compose it).","support":[{"end":178,"quote":"A representation of a region that is based on its interior (i.e., the cells that compose it).","source_id":"nist-dads.interiorbasd","source_sha256":"6fa92fd15a554a0ca69d3c6c94a5578ebd5c2d155e894f606e66a9306e341e05","start":85}],"target_id":"concept.nist.interiorbasd","target_kind":"node","target_sha256":"3fe1a22a0a515b4862b3e29160302e61a47cf6d04c22424121d4ebef986418f2"}],"concept.nist.internalnode":[{"id":"assertion.concept.nist.internalnode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines internal node as: A node of a tree that has one or more child nodes, equivalently, one that is not a leaf . Also known as nonterminal node.","support":[{"end":174,"quote":"A\nnode\nof a\ntree\nthat has one or more\nchild\nnodes, equivalently, one that is not a\nleaf\n.\nAlso known as\nnonterminal node.","source_id":"nist-dads.internalnode","source_sha256":"77f0e44aff1294485cf1cffe0c80bd5ce56d8ec302d4d10a343a651d6f1d10fe","start":53}],"target_id":"concept.nist.internalnode","target_kind":"node","target_sha256":"6e4d01b7c8f75c843334c4cfb008853c51bf73cc8a3ea480e1cf485cf568ce22"}],"concept.nist.internalsort":[{"id":"assertion.concept.nist.internalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines internal sort as: Any sort algorithm which uses exclusively main memory during the sort. This assumes high-speed random access to all memory.","support":[{"end":177,"quote":"Any\nsort\nalgorithm which uses exclusively main memory during the sort.  This assumes high-speed random access to all memory.","source_id":"nist-dads.internalsort","source_sha256":"48eebcc0960aef2fd48cdf9b24fd2897e6b3113f79c35ed16c777bc6af4a69b5","start":53}],"target_id":"concept.nist.internalsort","target_kind":"node","target_sha256":"2378efd757733eaf8225b3db8f83d933adb56a5eb394488df48d3386e5adb055"}],"concept.nist.intersection":[{"id":"assertion.concept.nist.intersection","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines intersection as: The intersection of two sets is a set having those members which are in both sets.","support":[{"end":133,"quote":"The intersection of two\nsets\nis a set having those members which are in both sets.","source_id":"nist-dads.intersection","source_sha256":"092bbd4fe8fb244c2f3f3ae5505936719b4b28a225f1e906b4dda2998c5453da","start":51}],"target_id":"concept.nist.intersection","target_kind":"node","target_sha256":"662bec65257a7c4d228ff07a441b42419dc471a1d23b940e9e3b2bde68176c0c"}],"concept.nist.intractable":[{"id":"assertion.concept.nist.intractable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines intractable as: A problem for which no algorithm can exist which computes all instances of it in polynomial time .","support":[{"end":147,"quote":"A problem for which no\nalgorithm\ncan exist which computes all instances of it in\npolynomial time\n.","source_id":"nist-dads.intractable","source_sha256":"5d05c6dcff3e8ca3c9e658abe3750d5da4ef94fc39f765795001f0b886980f27","start":49}],"target_id":"concept.nist.intractable","target_kind":"node","target_sha256":"91511c7429eaa81ac2c810c9e5d2a2c376b85fa11d720dc5f086258f4eae6d9b"}],"concept.nist.inversesuffixarray":[{"id":"assertion.concept.nist.inversesuffixarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverse suffix array as: For each position in a string , the inverse suffix array has its index in the string's suffix array . Formal Definition: Given a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","support":[{"end":292,"quote":"For each position in a\nstring\n, the inverse suffix\narray\nhas its index in the string's\nsuffix array\n.\nFormal Definition:\nGiven a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","source_id":"nist-dads.inversesuffixarray","source_sha256":"1f5ab927596211085192ff45931f6d1202108dd06fa0dca7b34024dfed809487","start":71}],"target_id":"concept.nist.inversesuffixarray","target_kind":"node","target_sha256":"0cb2cd68b6d3c70810423a61070eca4fef760071b0c44ebcccad5f3ea12eeb2c"}],"concept.nist.inversionlist":[{"id":"assertion.concept.nist.inversionlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inversion list as: A set of non-overlapping numeric ranges, stored in an array in increasing order. Items in odd indexes begin ranges, and items in even indexes are the first number after the ends. Use a form of binary search to determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set. If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","support":[{"end":492,"quote":"A set of non-overlapping numeric ranges, stored in an\narray\nin increasing order.  Items in odd indexes begin ranges, and items in even indexes are the first number after the ends.\nUse a form of\nbinary search\nto determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set.  If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","source_id":"nist-dads.inversionlist","source_sha256":"90eeb438de29784c600016e7176de8001b00ea84224e01c8dca6c67ec5353d2f","start":59}],"target_id":"concept.nist.inversionlist","target_kind":"node","target_sha256":"8059044f54bae3e87626bca2a148961a64b577aaa4e6f57fdcc041e9d0181eb7"}],"concept.nist.invertedfileindex":[{"id":"assertion.concept.nist.invertedfileindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverted file index as: An inverted index that only indicates the text in which a word appears, not where the word appears within the text.","support":[{"end":184,"quote":"An\ninverted index\nthat only indicates the text in which a word appears, not where the word appears within the text.","source_id":"nist-dads.invertedfileindex","source_sha256":"bf076b12a71d9c58e58e77d2d8cc3c6754410b20ae296aa3a6418367dbab406e","start":69}],"target_id":"concept.nist.invertedfileindex","target_kind":"node","target_sha256":"e167f232532b5e233588b25e929783f410c2125fa26f9e85db3146e03442dd8c"}],"concept.nist.invertedindex":[{"id":"assertion.concept.nist.invertedindex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines inverted index as: An index into a set of texts of the words in the texts. The index is accessed by some search method. Each index entry gives the word and a list of texts, possibly with locations within the text, where the word occurs.","support":[{"end":278,"quote":"An index into a set of\ntexts\nof the words in the texts. The index is accessed by some\nsearch\nmethod. Each index entry gives the  word and a list of texts, possibly with locations  within the text, where the word occurs.","source_id":"nist-dads.invertedindex","source_sha256":"31afd704ce6ca2ab9438a36ae29a5aae2ab9797eaf44326d46caad1bd147603d","start":59}],"target_id":"concept.nist.invertedindex","target_kind":"node","target_sha256":"add14d8c23443731f623a1b33552e8e4c05405068e1d212d0766d21aedc04d1a"}],"concept.nist.invertiblebloomtable":[{"id":"assertion.concept.nist.invertiblebloomtable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines invertible Bloom lookup table as: Algorithms and an array of cells to store key/value pairs. Each cell has a count of how many pairs are mapped to the cell, the sum of the keys mapped to it, and the sum of the values mapped to it. Using k hash functions , each pair is mapped to T[h 1 (k)], T[h 2 (k)], ..., T[h k (k)]. Also known as IBLT.","support":[{"end":395,"quote":"Algorithms and an\narray\nof cells to store key/value pairs. Each cell has a\ncount\nof how many pairs are mapped to the cell, the\nsum\nof the keys mapped to it, and the\nsum\nof the values mapped to it.  Using k\nhash functions\n, each pair is mapped to T[h\n1\n(k)], T[h\n2\n(k)], ..., T[h\nk\n(k)].\nAlso known as\nIBLT.","source_id":"nist-dads.invertiblebloomtable","source_sha256":"4ad8d0d60d1f8524725bda8d60e5ea2777198fbd896a6fae39250ae70d06e5ea","start":89}],"target_id":"concept.nist.invertiblebloomtable","target_kind":"node","target_sha256":"211b9a3f897d968e68787c87450e5953b96acb3f501a51b3acaed72eef57943a"}],"concept.nist.irreflexive":[{"id":"assertion.concept.nist.irreflexive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines irreflexive as: A binary relation R for which there is no element a such that a R a.","support":[{"end":117,"quote":"A\nbinary relation\nR for which there is no element a such that a R a.","source_id":"nist-dads.irreflexive","source_sha256":"418007841f2ffa035280181b8bfe3389361eee70824a46f86330f9742db0e75c","start":49}],"target_id":"concept.nist.irreflexive","target_kind":"node","target_sha256":"5f9d04ee2c19e26429503addef6f8710d41eb01c4494a2127cad51473edb0afe"}],"concept.nist.isomorphic":[{"id":"assertion.concept.nist.isomorphic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines isomorphic as: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","support":[{"end":282,"quote":"Two\ngraphs\nare isomorphic if there  is a one-to-one correspondence between their\nvertices\nand there is an\nedge\nbetween two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","source_id":"nist-dads.isomorphic","source_sha256":"f3108939851e89497877471084ce06ec1c4f4f646c239c35797034325a035081","start":47}],"target_id":"concept.nist.isomorphic","target_kind":"node","target_sha256":"5af75bdb691ffbcf33aba60082b67a276eea41a5601299c18fc2b78a57781c1c"}],"concept.nist.jellyfish":[{"id":"assertion.concept.nist.jellyfish","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines jelly-fish as: A theoretical data structure for n items. It starts with a balanced binary search tree of about √(n) nodes. The leaf nodes lead to \"tentacles\" or linked lists , each of about √(n) nodes.","support":[{"end":241,"quote":"A theoretical data structure for n items. It starts with a\nbalanced binary search tree\nof about  √(n) nodes.   The\nleaf\nnodes lead to \"tentacles\" or\nlinked lists\n, each of about  √(n) nodes.","source_id":"nist-dads.jellyfish","source_sha256":"26d10bef7e1e6692bf57ceebad87595022ab02f35086136fc9fc8469e680d4ee","start":51}],"target_id":"concept.nist.jellyfish","target_kind":"node","target_sha256":"3bd995133c2c8e7ba4cf8d1251103a031d9597a7a2ecf39f8218597d16497731"}],"concept.nist.k2tree":[{"id":"assertion.concept.nist.k2tree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k²-tree as: A compact representation of a sparse directed graph . It requires 1 to 3 bits per edge. Many access functions, like successor(s), predecessor(s), and range (all links from a range of vertices to another range of vertices), have very efficient implementations.","support":[{"end":306,"quote":"A\ncompact\nrepresentation of a sparse\ndirected graph\n.  It requires 1 to 3\nbits\nper edge.  Many access functions, like successor(s), predecessor(s), and range (all links from a range of\nvertices\nto another range of vertices), have very efficient implementations.","source_id":"nist-dads.k2tree","source_sha256":"2901ab587c77c9c4085222ece8193cadfe5f75bbc8a17936e0d6bf3ad79156d0","start":45}],"target_id":"concept.nist.k2tree","target_kind":"node","target_sha256":"bf63c1755c026a3fd0c614ddb19a5189cd2d6b3e8c5a0fb66cafcb50d99fa433"}],"concept.nist.karpreductin":[{"id":"assertion.concept.nist.karpreductin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karp reduction as: A reduction given by a polynomial time computable transformation function.","support":[{"end":129,"quote":"A\nreduction\ngiven by a\npolynomial\ntime\ncomputable\ntransformation function.","source_id":"nist-dads.karpreductin","source_sha256":"437a5b62760959fbbac5130d0d420630ecbd4951a95ffae152250ca594c38c7f","start":55}],"target_id":"concept.nist.karpreductin","target_kind":"node","target_sha256":"42f5a880c7ce65ea04354d8cac31a8c115d5bdef85a761c19193853a8a622b3d"}],"concept.nist.karyheap":[{"id":"assertion.concept.nist.karyheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary heap as: A complete tree where every node has a key more extreme (greater or less) than the key of its parent . Each node has k or fewer children .","support":[{"end":190,"quote":"A\ncomplete tree\nwhere every\nnode\nhas a\nkey\nmore extreme (greater or less) than the key of its\nparent\n.  Each node has\nk\nor fewer\nchildren\n.","source_id":"nist-dads.karyheap","source_sha256":"5acc68a36c5b657cf9926f936e4424102ad5ebb026aa21877cdf27d8d54608c8","start":51}],"target_id":"concept.nist.karyheap","target_kind":"node","target_sha256":"0a9b6b468e62a709e4d8fefd6a334c5a1d5cc02b8f8bea52677395988627a21b"}],"concept.nist.karytree":[{"id":"assertion.concept.nist.karytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary tree as: A tree with no more than k children for each node . Also known as k-way tree.","support":[{"end":128,"quote":"A\ntree\nwith no more than\nk\nchildren\nfor each\nnode\n.\nAlso known as\nk-way tree.","source_id":"nist-dads.karytree","source_sha256":"2badcdefad6943df46f3e1d7205941a7f3a651f195a9071e059debcc7e266ba3","start":51}],"target_id":"concept.nist.karytree","target_kind":"node","target_sha256":"e5078a6e0940336f835276851f17ef9f411528bfd888354d0bc3faf615bd0574"}],"concept.nist.kcoloring":[{"id":"assertion.concept.nist.kcoloring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-coloring as: 1) The assignment of k colors (or any distinct marks) to the vertices of a graph . 2) The assignment of k colors to the edges of a graph . A coloring is a proper coloring if no two adjacent vertices or edges have the same color.","support":[{"end":275,"quote":"1) The assignment of\nk\ncolors (or any distinct marks) to the\nvertices\nof a\ngraph\n. 2) The assignment of\nk\ncolors to the\nedges\nof a\ngraph\n.\nA coloring is a\nproper coloring\nif no two\nadjacent\nvertices or edges have the same color.","source_id":"nist-dads.kcoloring","source_sha256":"1dd56a98a9589d69a25659dc87d7b05c14f04131d04e51a52d4d0131cf882db6","start":47}],"target_id":"concept.nist.kcoloring","target_kind":"node","target_sha256":"b3618b23713313be50ba62b376e0db429c44cd363ebb28a51d61d8462d8b360c"}],"concept.nist.kconnectedgraph":[{"id":"assertion.concept.nist.kconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-connected graph as: A connected graph such that deleting any k-1 vertices (and incident edges ) results in a graph that is still connected.","support":[{"end":180,"quote":"A\nconnected graph\nsuch that deleting any k-1\nvertices\n(and incident\nedges\n) results in a graph that is still connected.","source_id":"nist-dads.kconnectedgraph","source_sha256":"202e109e77d8b5e3c339df2711ce74915ed59c33fd1b57c663285220d8091e8d","start":61}],"target_id":"concept.nist.kconnectedgraph","target_kind":"node","target_sha256":"93c39dc170dc764abc581ae1ffec0be654aadba936edbee9fa607d95d8f747ce"}],"concept.nist.kdbtree":[{"id":"assertion.concept.nist.kdbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-d-B-tree as: A data structure which splits multidimensional spaces like an adaptive k-d tree , but balances the resulting tree like a B-tree .","support":[{"end":180,"quote":"A data structure which splits multidimensional spaces like an\nadaptive k-d tree\n, but balances the resulting tree like a\nB-tree\n.","source_id":"nist-dads.kdbtree","source_sha256":"a2428745d3482fa1221204d707693d03605aa7e1c1aee31b56b122395fa2eb76","start":51}],"target_id":"concept.nist.kdbtree","target_kind":"node","target_sha256":"86c5ae1836f9fb462f7f0031b781d585e577c4bc3ab71bcbcd1eefcbceb48474"}],"concept.nist.kdimensional":[{"id":"assertion.concept.nist.kdimensional","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-dimensional as: (1) Dealing with or restricted to a space where location can be completely described with exactly k orthogonal axes. (2) Dealing with a space of any number of dimensions.","support":[{"end":224,"quote":"(1) Dealing with or restricted to a space where location can be completely described with exactly\nk\northogonal axes.  (2) Dealing with a space of any number of dimensions.","source_id":"nist-dads.kdimensional","source_sha256":"ff41724b62c86c01067d255dba4c67e67b41b9bedcf228dab1015c763c36bf11","start":53}],"target_id":"concept.nist.kdimensional","target_kind":"node","target_sha256":"3623ec53a03551345d2e397456e1503ae7c41c324c89a5ebcd2637481bb092ef"}],"concept.nist.kdominant":[{"id":"assertion.concept.nist.kdominant","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines K-dominant match as: A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","support":[{"end":179,"quote":"A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","source_id":"nist-dads.kdominant","source_sha256":"e03e41166eae50188c9e91f40f2d3c1f187cd4de346aad777e06a684afc31394","start":59}],"target_id":"concept.nist.kdominant","target_kind":"node","target_sha256":"3347d9205c41203a9e89b314db24f6067e3151050debacf8c927c3f127ee9fba"}],"concept.nist.kdtree":[{"id":"assertion.concept.nist.kdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-d tree as: A multidimensional search tree for points in k dimensional space. Levels of the tree are split along successive dimensions at the points.","support":[{"end":185,"quote":"A multidimensional\nsearch tree\nfor points in k dimensional space.  Levels of the tree are split along successive dimensions at the points.","source_id":"nist-dads.kdtree","source_sha256":"ada3b981b8e57ddd9bb010e657fac2f862355fd201d78cba853ff0c3faed0cf4","start":47}],"target_id":"concept.nist.kdtree","target_kind":"node","target_sha256":"de9a36dc57d31fc94b9cd4a6fa18e70548f7fde73ab71c9c1b740b619019506b"}],"concept.nist.key":[{"id":"assertion.concept.nist.key","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines key as: The part of a group of data by which it is sorted, indexed, cross referenced, etc.","support":[{"end":115,"quote":"The part of a group of data by which it is sorted, indexed, cross referenced, etc.","source_id":"nist-dads.key","source_sha256":"a446b2814201c57c89e6fe10d6c8476ae89923d68d20e096056831b2ebe8107d","start":33}],"target_id":"concept.nist.key","target_kind":"node","target_sha256":"f798d783539eb985688e45abd48f60774ed73533d72c514a260016fadbcc9fa4"}],"concept.nist.knightstour":[{"id":"assertion.concept.nist.knightstour","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines knight's tour as: A series of moves of a chess knight that visits all squares on the board exactly once.","support":[{"end":144,"quote":"A series of moves of a chess knight that visits all squares on the board exactly once.","source_id":"nist-dads.knightstour","source_sha256":"83fc994e66fc93ec09db078888c645fd00ceff0344aa1378f870654bde685ca2","start":58}],"target_id":"concept.nist.knightstour","target_kind":"node","target_sha256":"5d325c9a9dfcf47ed141ab36e59cf275d35e8287efffc744c841a67a9c6e2f8f"}],"concept.nist.kolmogorov":[{"id":"assertion.concept.nist.kolmogorov","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Kolmogorov complexity as: The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine .","support":[{"end":277,"quote":"The minimum number of bits into which a\nstring\ncan be compressed without losing information.  This is defined with respect to a fixed, but universal decompression scheme, given by a\nuniversal Turing machine\n.","source_id":"nist-dads.kolmogorov","source_sha256":"5bf22ea54dda192517a786d0a180eb7c7f2eccb467cb38530b32f2ed57f73406","start":69}],"target_id":"concept.nist.kolmogorov","target_kind":"node","target_sha256":"5caaab7f6439e54eadfa3311041e7671d0760090e1e11998063658681a22141c"}],"concept.nist.kripkestruct":[{"id":"assertion.concept.nist.kripkestruct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Kripke structure as: A nondeterministic finite state machine whose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","support":[{"end":249,"quote":"A\nnondeterministic finite state machine\nwhose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","source_id":"nist-dads.kripkestruct","source_sha256":"ef65992a4fc5ca0053025f2d3e0432073dd4245cd50dca250d4992114ba21752","start":59}],"target_id":"concept.nist.kripkestruct","target_kind":"node","target_sha256":"f84c151a0d6699c3e86ae7a2b39e191a10b75c3a79491a0af3c2fc4cb2c1e6b5"}],"concept.nist.kwaymerge":[{"id":"assertion.concept.nist.kwaymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-way merge as: Combine k sorted data streams into a single sorted stream.","support":[{"end":107,"quote":"Combine\nk\nsorted data streams into a single sorted stream.","source_id":"nist-dads.kwaymerge","source_sha256":"eaedaaf3211de7d8228bd544e3850adb48375d87bdcc244f9896cfaf720f4cab","start":49}],"target_id":"concept.nist.kwaymerge","target_kind":"node","target_sha256":"bb6633f3b7df5010b08383c70e7cb670131839045c846942e687781fe64036c2"}],"concept.nist.labeledgraph":[{"id":"assertion.concept.nist.labeledgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines labeled graph as: A graph which has labels associated with each edge or each vertex .","support":[{"end":120,"quote":"A\ngraph\nwhich has labels associated with each\nedge\nor each\nvertex\n.","source_id":"nist-dads.labeledgraph","source_sha256":"90ced6154c2edeb17ee24d17cb773a41fa17c0dfb66b18930c8b67e612096230","start":53}],"target_id":"concept.nist.labeledgraph","target_kind":"node","target_sha256":"d02df349ed05c915dcf0fc9378071ad02257d12d1ab16461420a40089e4e9800"}],"concept.nist.language":[{"id":"assertion.concept.nist.language","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines language as: A set of strings over some fixed alphabet . A characterization of inputs which may or may not be solved by algorithms . Also known as formal language.","support":[{"end":194,"quote":"A set of strings over some fixed\nalphabet\n.  A characterization of inputs which may or may not be solved by\nalgorithms\n.\nAlso known as\nformal language.","source_id":"nist-dads.language","source_sha256":"bf01ffacc6e4ab42805439d355856778070785fbb689833228425da231fff32f","start":43}],"target_id":"concept.nist.language","target_kind":"node","target_sha256":"10e332299fbc45dbca580eae6c8024daf70d4a6f7d3cd1d06d96ef9932f7d78c"}],"concept.nist.lastfirstout":[{"id":"assertion.concept.nist.lastfirstout","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines last-in, first-out as: A policy that the most recently arrived item is processed first. A stack implements this.","support":[{"end":152,"quote":"A policy that the most recently arrived item is processed first. A\nstack\nimplements this.","source_id":"nist-dads.lastfirstout","source_sha256":"9f2bc3ba221c51c46168cdf323e8d4837f50039a787ef7fc0e0111b85034d536","start":63}],"target_id":"concept.nist.lastfirstout","target_kind":"node","target_sha256":"00a9cf3c428b59368bf81985d18959ea0811445d01250b62a54ade4b107cf7a0"}],"concept.nist.lattice":[{"id":"assertion.concept.nist.lattice","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lattice as: A point lattice generated by taking integer linear combinations of a set of basis vectors.","support":[{"end":131,"quote":"A point lattice generated by taking integer linear combinations of a set of basis vectors.","source_id":"nist-dads.lattice","source_sha256":"6009c2abf6fe3e186d7077dd6fc83dd79e4f4b16d8b99bacf6c53f7b99aacb21","start":41}],"target_id":"concept.nist.lattice","target_kind":"node","target_sha256":"2f25ef64000442d639f0bbeeeaa0dee062199488ac841c187824e978364d4c88"}],"concept.nist.lcs":[{"id":"assertion.concept.nist.lcs","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines LCS as: Either longest common subsequence or longest common substring .","support":[{"end":101,"quote":"Either\nlongest common subsequence\nor\nlongest common substring\n.","source_id":"nist-dads.lcs","source_sha256":"7cc885115d0bb173ee21910ba28c277767b366c87b02ddc63012eb5923151069","start":38}],"target_id":"concept.nist.lcs","target_kind":"node","target_sha256":"7634a85a47c6e479ae8bce0ef97eb4097ce81e3d2644b15997f554a9d83eee33"}],"concept.nist.leaf":[{"id":"assertion.concept.nist.leaf","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines leaf as: A node in a tree without any children . See the figure at tree . Also known as external node, terminal node.","support":[{"end":143,"quote":"A\nnode\nin a\ntree\nwithout any\nchildren\n. See the figure at\ntree\n.\nAlso known as\nexternal node, terminal node.","source_id":"nist-dads.leaf","source_sha256":"7074960a1f02dbbfc15da6304c262cfb74dfccada52497e88ae3bcc9023d0297","start":35}],"target_id":"concept.nist.leaf","target_kind":"node","target_sha256":"efc0a7cd4ff74bf482ecf396a358f6df84a6939dd39afffa63dd30f98f55b1f5"}],"concept.nist.leastcommonmultiple":[{"id":"assertion.concept.nist.leastcommonmultiple","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines least common multiple as: The least integer which is a multiple of given integers. For instance, LCM(6, 10) = 30. Also known as LCM.","support":[{"end":176,"quote":"The least integer which is a multiple of given integers.  For instance, LCM(6, 10) = 30.\nAlso known as\nLCM.","source_id":"nist-dads.leastcommonmultiple","source_sha256":"aec2185bd2727868ee7ccbf9886fb433fa7d2c0fc2cd3ef1aa410ab54b17f92e","start":69}],"target_id":"concept.nist.leastcommonmultiple","target_kind":"node","target_sha256":"1e048cb55705d01b8a90beac3aa1754019049ad6198b907af9f25965c228bb68"}],"concept.nist.leftisttree":[{"id":"assertion.concept.nist.leftisttree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines leftist tree as: A priority queue implemented with a variant of a binary tree . Every node has a count which is the distance to the nearest leaf . In addition to the heap property , leftist trees are kept so the right descendant of each node has the shorter distance to a leaf.","support":[{"end":317,"quote":"A\npriority queue\nimplemented with a variant of a\nbinary tree\n.  Every\nnode\nhas a count which is the distance to the nearest\nleaf\n.  In addition to the\nheap property\n, leftist trees are kept so the right\ndescendant\nof each node has the shorter distance to a leaf.","source_id":"nist-dads.leftisttree","source_sha256":"45bb2d286eafdf4578dc94c5445c0c112564fc7b5193f4568f82af8f64609ae0","start":55}],"target_id":"concept.nist.leftisttree","target_kind":"node","target_sha256":"64b891262b7798e5f7bc09a7d36be85e70d29182bc2e584fa6b547a51874b14f"}],"concept.nist.letteromega":[{"id":"assertion.concept.nist.letteromega","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines omega as: The Greek letter written as ω (see ω(n) ) or Ω (see Ω(n) ).","support":[{"end":97,"quote":"The Greek letter written as  ω (see\nω(n)\n) or Ω (see\nΩ(n)\n).","source_id":"nist-dads.letteromega","source_sha256":"e21ee7b65cacce68020a87e27fc598dbcc908408ffa082b5fcdd20c1b10f166f","start":37}],"target_id":"concept.nist.letteromega","target_kind":"node","target_sha256":"cce67be8c2d115ae7f8855a66474292075bf9c5526389815836360f375ed1242"}],"concept.nist.level":[{"id":"assertion.concept.nist.level","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines level as: (1) All the nodes of a tree with the same depth . (2) Of a node, the depth.","support":[{"end":112,"quote":"(1) All the\nnodes\nof a\ntree\nwith the same\ndepth\n. (2) Of a node, the depth.","source_id":"nist-dads.level","source_sha256":"a6109abe0dcc82c685be02ff92adcf0f40af5ab1cba8ffe96211dcf551b3de25","start":37}],"target_id":"concept.nist.level","target_kind":"node","target_sha256":"86e6cf15b4f7a1cf88756e63b4735b43ee0dde6c87b2adb797d278f10eb68f32"}],"concept.nist.levenshtein":[{"id":"assertion.concept.nist.levenshtein","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Levenshtein distance as: (1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n are the lengths of the strings. Also known as edit distance.","support":[{"end":328,"quote":"(1) The smallest number of insertions, deletions, and substitutions required to change one\nstring\nor\ntree\ninto another.  (2) A\nΘ(m × n)\nalgorithm to compute the distance between strings, where m and n are the lengths of the strings.\nAlso known as\nedit distance.","source_id":"nist-dads.levenshtein","source_sha256":"6d5d8bd9c4cb8b207ccf8d95277acf2ca6dea841d29306fee9eeedc18d6395fd","start":67}],"target_id":"concept.nist.levenshtein","target_kind":"node","target_sha256":"89f728eebd00a0784566f87432ceac4ee8f501ceb97e245231ef74daaf12d17f"}],"concept.nist.lexicgrphcl":[{"id":"assertion.concept.nist.lexicgrphcl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lexicographical order as: Alphabetical or \"dictionary\" order.","support":[{"end":104,"quote":"Alphabetical or \"dictionary\" order.","source_id":"nist-dads.lexicgrphcl","source_sha256":"52e6bb72d8f745c711dc7911bb149f74939679f429b10706b96d8021b5a1d730","start":69}],"target_id":"concept.nist.lexicgrphcl","target_kind":"node","target_sha256":"7420d588554a62bfe4137ec8a5b5a497f346bcabede9fdb3634529290e0f40b6"}],"concept.nist.linearprobng":[{"id":"assertion.concept.nist.linearprobng","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linear probing as: A hash table in which a collision is resolved by putting the item in the next empty place in the array following the occupied place. Even with a moderate load factor , primary clustering tends to slow retrieval.","support":[{"end":271,"quote":"A\nhash table\nin which a\ncollision\nis resolved by putting the item in the next empty place in the array following the occupied place.  Even with a moderate\nload factor\n,\nprimary clustering\ntends to slow retrieval.","source_id":"nist-dads.linearprobng","source_sha256":"2ec435398daf338b69f968eb8b119210c48f7c0d328b2fb76eaa6124f353ed07","start":59}],"target_id":"concept.nist.linearprobng","target_kind":"node","target_sha256":"44028a01d5b05de795208a16dc64c8fddd6ecc130a946e373b69aee3d48c9f18"}],"concept.nist.linearquadtr":[{"id":"assertion.concept.nist.linearquadtr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linear quadtree as: A quadtree implemented as a single array of nodes .","support":[{"end":112,"quote":"A\nquadtree\nimplemented as a single\narray\nof\nnodes\n.","source_id":"nist-dads.linearquadtr","source_sha256":"da83d731dad614bd397ae2646b5d18589281c02332e3b605bd6ae6f6d5feb3d7","start":61}],"target_id":"concept.nist.linearquadtr","target_kind":"node","target_sha256":"46305325a83714bb4abd59a87e52e2d5eda3ba366f806da577056c42f89f0e84"}],"concept.nist.link":[{"id":"assertion.concept.nist.link","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines link as: A reference, pointer, or access handle to another part of the data structure. Often, a memory address.","support":[{"end":138,"quote":"A reference, pointer, or access handle to another part of the data structure.  Often, a memory address.","source_id":"nist-dads.link","source_sha256":"e3724fcfb6cb1c6114b154a25a0233e127f0d5f9906687201ae9ac880084bbca","start":35}],"target_id":"concept.nist.link","target_kind":"node","target_sha256":"4f58faa45c74f076870d54c7fc63d375581ec6f14c9f94d8d0fbffc09627fa46"}],"concept.nist.linkeddatasignature":[{"id":"assertion.concept.nist.linkeddatasignature","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linked data signature as: A digital signature, and information to verify it, for linked data. Also known as LDS.","support":[{"end":159,"quote":"A digital signature, and information to verify it, for linked data.\nAlso known as\nLDS.","source_id":"nist-dads.linkeddatasignature","source_sha256":"6bd94d9ff4d97f4116c9ef9bab0d0dc0b3a691c528d7aef325cd61fd74f42360","start":73}],"target_id":"concept.nist.linkeddatasignature","target_kind":"node","target_sha256":"5cea20d069d712a55875f37fb3afe3f1398df9fd910cc4fbb5b204876430556d"}],"concept.nist.linkedlist":[{"id":"assertion.concept.nist.linkedlist","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linked list as: A list implemented by each item having a link to the next item. Also known as singly linked list.","support":[{"end":150,"quote":"A\nlist\nimplemented by each item having a\nlink\nto the next item.\nAlso known as\nsingly linked list.","source_id":"nist-dads.linkedlist","source_sha256":"cf7b38d6ca17d27f22512cd359264d81edbdb3f880f05aa07a77ea2d36cb6a0b","start":53}],"target_id":"concept.nist.linkedlist","target_kind":"node","target_sha256":"2976f86a878e63543d8af374d506d8ac6fb25d18ff1806f4990ae2a2a8183e13"}],"concept.nist.list":[{"id":"assertion.concept.nist.list","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines list as: A collection of items accessible one after another beginning at the head and ending at the tail .","support":[{"end":136,"quote":"A collection of items accessible one after another beginning at the\nhead\nand ending at the\ntail\n.","source_id":"nist-dads.list","source_sha256":"70b84a3c95f548c2bd50cd5c4a85f521ed3e7250bca55b97c1c070a2e040d3d5","start":39}],"target_id":"concept.nist.list","target_kind":"node","target_sha256":"7c6041a606b0a6ea1e6fe7db8e681b6f71e74955e018b787b12db0cdc6d8f1bb"}],"concept.nist.listcontrctn":[{"id":"assertion.concept.nist.listcontrctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines list contraction as: Contracting a list by removing some of the items.","support":[{"end":108,"quote":"Contracting a\nlist\nby removing some of the items.","source_id":"nist-dads.listcontrctn","source_sha256":"07d49b7ee76ce4fc173670f15d80e673a3a4167b3242b1236fbe9e8d52ae91af","start":59}],"target_id":"concept.nist.listcontrctn","target_kind":"node","target_sha256":"2424c25369ea33eaa8b5d2a454c127b229594573bc2c91ceeca4ae46a6910ab7"}],"concept.nist.littleonotation":[{"id":"assertion.concept.nist.littleonotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines little-o notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity. The notation is read, \"f of n is little oh of g of n\". Formal Definition: f(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","support":[{"end":576,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity.   The notation is read, \"f of n is little oh of g of n\".\nFormal Definition:\nf(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","source_id":"nist-dads.littleonotation","source_sha256":"fdcf70e91721abd5051c74fce5e1f42cb304288fc2b60bd72137af44a8b1d879","start":61}],"target_id":"concept.nist.littleonotation","target_kind":"node","target_sha256":"eec9f2885dd386ece24e02ff2fb005e603cad317539b0e7c5abf10676bc3b36c"}],"concept.nist.loadfactor":[{"id":"assertion.concept.nist.loadfactor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines load factor as: The number of elements in a hash table divided by the number of slots. Usually written α (alpha).","support":[{"end":147,"quote":"The number of elements in a\nhash table\ndivided by the number of slots.  Usually written α (alpha).","source_id":"nist-dads.loadfactor","source_sha256":"c5a7736071033de9895fc2f8f689aa98100c73ddc3646d4fc0e5c06b1ae46d5d","start":49}],"target_id":"concept.nist.loadfactor","target_kind":"node","target_sha256":"90b8faf7fb2f4d87f821fdeae0f35cc332d66bab88916fb4b3241242657a066b"}],"concept.nist.localalgnmnt":[{"id":"assertion.concept.nist.localalgnmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines local alignment as: The detection of local similarities among two or more strings .","support":[{"end":120,"quote":"The detection of local similarities among two or more\nstrings\n.","source_id":"nist-dads.localalgnmnt","source_sha256":"c3003823a321447fd88a7344e8bcc5c9372156ee68526991de21164d96a8cb46","start":57}],"target_id":"concept.nist.localalgnmnt","target_kind":"node","target_sha256":"5f98051ee6bff01df98952047bbd330fb90cbc41178de902094a3af8e070d87a"}],"concept.nist.localoptimum":[{"id":"assertion.concept.nist.localoptimum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines local optimum as: A solution to a problem that is better than all other solutions that are slightly different, but worse than the global optimum .","support":[{"end":181,"quote":"A solution to a problem that is better than all other solutions that are slightly different, but worse than the\nglobal optimum\n.","source_id":"nist-dads.localoptimum","source_sha256":"86db8a3c44ba48bad70604c6bd10bde0b2a6ff8a2e9161c626dc0ad26ee0e161","start":53}],"target_id":"concept.nist.localoptimum","target_kind":"node","target_sha256":"30dda942fd995b45d3234598b744244667156a3d839efa47349490e3c16ea7b8"}],"concept.nist.logarithmic":[{"id":"assertion.concept.nist.logarithmic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines logarithmic as: (1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n. More formally m(n) = O(log n) . (3) Sometimes imprecisely used to mean polylogarithmic .","support":[{"end":392,"quote":"(1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n.  More formally m(n) =\nO(log n)\n. (3) Sometimes imprecisely used to mean\npolylogarithmic\n.","source_id":"nist-dads.logarithmic","source_sha256":"f4ce71e471aa9fbd2bec25e06e17ad2d4d540b74187b95ed60ca78e778666b21","start":49}],"target_id":"concept.nist.logarithmic","target_kind":"node","target_sha256":"54616fac61cf77461623aca592689fc01f55e22b05314deb67b6a43f49b85d21"}],"concept.nist.longestcommonsubsequence":[{"id":"assertion.concept.nist.longestcommonsubsequence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines longest common subsequence as: The problem of finding a maximum length (or maximum weight) subsequence of two or more strings . Also known as heaviest common subsequence.","support":[{"end":223,"quote":"The problem of finding a maximum length (or maximum weight)\nsubsequence\nof two or more\nstrings\n.\nAlso known as\nheaviest common subsequence.","source_id":"nist-dads.longestcommonsubsequence","source_sha256":"677b30ace5cc76d2d192bf39c9516a70cd8a65e69c331e395be86e05f0f16307","start":84}],"target_id":"concept.nist.longestcommonsubsequence","target_kind":"node","target_sha256":"f4a5a91da3b3b7656444c25b77c43153d9534feb2f3cd26e06a934465838c88a"}],"concept.nist.longestcommonsubstring":[{"id":"assertion.concept.nist.longestcommonsubstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines longest common substring as: Find the longest substring of two or more strings .","support":[{"end":131,"quote":"Find the longest\nsubstring\nof two or more\nstrings\n.","source_id":"nist-dads.longestcommonsubstring","source_sha256":"faf782869ead7215af10cee077b48d88253509104fd59010a7a19ca20424641a","start":80}],"target_id":"concept.nist.longestcommonsubstring","target_kind":"node","target_sha256":"28dcbddbcf3eccfb314e4e597e55411762ac82d784e2c6baf845753a87a6eaba"}],"concept.nist.lowerbound":[{"id":"assertion.concept.nist.lowerbound","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lower bound as: A function or growth rate below which solving a problem is impossible.","support":[{"end":119,"quote":"A function or growth rate below which solving a problem is impossible.","source_id":"nist-dads.lowerbound","source_sha256":"cfe486fa13d5e1ecc63bf91ca0502afb0a97fef2d7eeecd3c4d174cafae8a679","start":49}],"target_id":"concept.nist.lowerbound","target_kind":"node","target_sha256":"f168542c1441d01e74bc3faa1a8537fe23829d6a7e907f6958bf9b8fd14667c0"}],"concept.nist.lowertriangularmatrix":[{"id":"assertion.concept.nist.lowertriangularmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lower triangular matrix as: A matrix that is only defined at (i,j) when i ≥ j.","support":[{"end":127,"quote":"A\nmatrix\nthat is only defined at (i,j) when i ≥ j.","source_id":"nist-dads.lowertriangularmatrix","source_sha256":"b67c65ccd4dd4018744127a78fbecc8b2ac89c02caa79f3c140ccc1f16dc6fdf","start":77}],"target_id":"concept.nist.lowertriangularmatrix","target_kind":"node","target_sha256":"06930a45b4a111397420c7704d09c736ca8b7617e50d0853e45914667ea9627d"}],"concept.nist.lowestcommon":[{"id":"assertion.concept.nist.lowestcommon","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lowest common ancestor as: The deepest node in a tree that is an ancestor of two given leaves .","support":[{"end":139,"quote":"The deepest\nnode\nin a\ntree\nthat is an\nancestor\nof two given\nleaves\n.","source_id":"nist-dads.lowestcommon","source_sha256":"f0674845ac44d75af4e9e2506773efcd86b287cd55e3f82ae9b0aeae596aa36f","start":71}],"target_id":"concept.nist.lowestcommon","target_kind":"node","target_sha256":"4577dc264d16c7d64ceb5e373bf835ff2dd2f3773cd5b49638236da54867e9c7"}],"concept.nist.lreduction":[{"id":"assertion.concept.nist.lreduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines l-reduction as: A Karp reduction that preserves approximation properties of optimization problems .","support":[{"end":132,"quote":"A\nKarp reduction\nthat preserves approximation properties of\noptimization problems\n.","source_id":"nist-dads.lreduction","source_sha256":"fa52e414822d70b6d06461a304fe50f5bda915e8cc6a6e552b2b04cbaf777ef4","start":49}],"target_id":"concept.nist.lreduction","target_kind":"node","target_sha256":"492be58adff04b28134ee156f1ba324511b3518d811965e0ad86fc6476880580"}],"concept.nist.manhattandistance":[{"id":"assertion.concept.nist.manhattandistance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Manhattan distance as: The distance between two points measured along axes at right angles. In a plane with p 1 at (x 1 , y 1 ) and p 2 at (x 2 , y 2 ), it is |x 1 - x 2 | + |y 1 - y 2 |.","support":[{"end":228,"quote":"The distance between two points measured along axes at right angles. In a plane with p\n1\nat (x\n1\n, y\n1\n) and p\n2\nat (x\n2\n, y\n2\n), it is  |x\n1\n- x\n2\n| + |y\n1\n- y\n2\n|.","source_id":"nist-dads.manhattandistance","source_sha256":"11e07fe97c16ef33ecf5f261d0f0c349d4b4da986c72dc76fb7f3c51752b1943","start":63}],"target_id":"concept.nist.manhattandistance","target_kind":"node","target_sha256":"51c4198cda073ae512ce74e6e7b49d0683206389fa56b78537e8ae79d6b8d819"}],"concept.nist.manyonerdctn":[{"id":"assertion.concept.nist.manyonerdctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines many-one reduction as: A reduction that maps an instance of one problem into an equivalent instance of another problem.","support":[{"end":159,"quote":"A reduction that maps an instance of one problem into an equivalent instance of another problem.","source_id":"nist-dads.manyonerdctn","source_sha256":"b265caf509b4bc63d57b6c0f17235076c328a9e3f890820c2cd6eb18bd3f623f","start":63}],"target_id":"concept.nist.manyonerdctn","target_kind":"node","target_sha256":"5a2c1a9168615a75e3c5ef97716c1dfd0c7d8b3be9fabd95fca50b4ac219b56d"}],"concept.nist.markovchain":[{"id":"assertion.concept.nist.markovchain","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Markov chain as: A finite state machine with probabilities for each transition, that is, a probability that the next state is s j given that the current state is s i .","support":[{"end":205,"quote":"A\nfinite state machine\nwith probabilities for each transition, that is, a probability that the next state is s\nj\ngiven that the current state is s\ni\n.","source_id":"nist-dads.markovchain","source_sha256":"0d36af6004e8549c2526f7328fd5f8d44f8c23a0fdc41cacfe91e5d3dfb8f2e4","start":55}],"target_id":"concept.nist.markovchain","target_kind":"node","target_sha256":"a238b60eb9f214f03e302db30f185ccda19ca6abf6b49e4b7d5274db570f531e"}],"concept.nist.mastertheorm":[{"id":"assertion.concept.nist.mastertheorm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Master theorem as: A theorem giving a solution in asymptotic terms for recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","support":[{"end":236,"quote":"A theorem giving a solution in asymptotic terms for\nrecurrence relations\nof the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","source_id":"nist-dads.mastertheorm","source_sha256":"57ec0ea4df4b66f03a2142643fb14dd97e2c37eeadb97ed951975242dc46c544","start":55}],"target_id":"concept.nist.mastertheorm","target_kind":"node","target_sha256":"615906a6423bd5d8b564abcbff5740120952ff51e2de7d7b2f4bc3ed24bf7994"}],"concept.nist.matchededge":[{"id":"assertion.concept.nist.matchededge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matched edge as: An edge which is in a matching .","support":[{"end":83,"quote":"An\nedge\nwhich is in a\nmatching\n.","source_id":"nist-dads.matchededge","source_sha256":"5fd14e5b1cf66e06d0c9e2e04a4bee93d7946b7bfd8b50efa4a4842951460c9f","start":51}],"target_id":"concept.nist.matchededge","target_kind":"node","target_sha256":"c9d1643c5d1032ef1781c286a8ba31dad590ef0d78fafdd5f4d8b7b662c565c4"}],"concept.nist.matchedvertx":[{"id":"assertion.concept.nist.matchedvertx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matched vertex as: A vertex on an matched edge in a matching , or, one which has been matched.","support":[{"end":130,"quote":"A\nvertex\non an\nmatched edge\nin a\nmatching\n, or, one which has been matched.","source_id":"nist-dads.matchedvertx","source_sha256":"6edff5c24745493dec051e0bbd3aae222cb1f64947679be3bad9df543525b150","start":55}],"target_id":"concept.nist.matchedvertx","target_kind":"node","target_sha256":"0e15dbd48996fcc5a16f33fb3c5d5d65d6c4554305c2a8e4a9a6fc8618e699e1"}],"concept.nist.matching":[{"id":"assertion.concept.nist.matching","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matching as: (1) A subgraph in which every vertex has a degree at most one. In other words, no two edges share a common vertex. (2) The problem of finding such a subgraph.","support":[{"end":204,"quote":"(1) A\nsubgraph\nin which every\nvertex\nhas a\ndegree\nat most one.  In other words, no two\nedges\nshare a common vertex.   (2) The problem of finding such a subgraph.","source_id":"nist-dads.matching","source_sha256":"93023883c3810dc4f3efa4d8557434e15728b31d2cfc291afbff451a553c158f","start":43}],"target_id":"concept.nist.matching","target_kind":"node","target_sha256":"6c49c8c4e12fc6b5dea68912cc787f4c2a21080bff2640a54c1c4f883e9ad266"}],"concept.nist.matrix":[{"id":"assertion.concept.nist.matrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matrix as: A two-dimensional array. By convention, the first index is the row, and the second index is the column.","support":[{"end":147,"quote":"A two-dimensional array.  By convention, the first index is the row, and the second index is the column.","source_id":"nist-dads.matrix","source_sha256":"94d449f02adb8c93359ad0785d9eb0170640565017dbb1a348f39684a862e850","start":43}],"target_id":"concept.nist.matrix","target_kind":"node","target_sha256":"5b5e0fedaeb642e58d8f6d6de8f6effb0b6849fc0c26d3d3e830c7a5833f8adb"}],"concept.nist.matrxchnmltp":[{"id":"assertion.concept.nist.matrxchnmltp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines matrix-chain multiplication problem as: Given a sequence of matrices such that any matrix may be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum number of arithmetic operations. One may use dynamic programming to find the best association.","support":[{"end":366,"quote":"Given a sequence of matrices such that any\nmatrix\nmay be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum  number of arithmetic operations.  One may use\ndynamic programming\nto find the best association.","source_id":"nist-dads.matrxchnmltp","source_sha256":"1700d06220f19ebb935abfe3e5e7b3599c394e3d6aa83fb3ca9212b6a0b6038e","start":102}],"target_id":"concept.nist.matrxchnmltp","target_kind":"node","target_sha256":"e235d907a8dd56ee9609bedf63f271ad50de31d995c74bfa87c8643e26fae189"}],"concept.nist.maxheapprop":[{"id":"assertion.concept.nist.maxheapprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines max-heap property as: Each node in a tree has a key which is less than or equal to the key of its parent .","support":[{"end":145,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is less than or equal to the key of its\nparent\n.","source_id":"nist-dads.maxheapprop","source_sha256":"ba0267a727d4578a3065940d079adb652e0b5698b824cc9db33c788c46c86a59","start":61}],"target_id":"concept.nist.maxheapprop","target_kind":"node","target_sha256":"02399bfc8d778549ce2cd5c5a5b85875c222be1084c153665fc873a03b853d6a"}],"concept.nist.maximalindependentset":[{"id":"assertion.concept.nist.maximalindependentset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximal independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them and such that no more vertices can be added and it still be an independent set .","support":[{"end":253,"quote":"A set of\nvertices\nin a\ngraph\nsuch that for any pair of vertices, there is no\nedge\nbetween them and such that no more vertices can be added and it still be an\nindependent set\n.","source_id":"nist-dads.maximalindependentset","source_sha256":"d7ab52d07122fc3e8997011c02214602a796769a0e9e427c54e7c7904f02d09d","start":78}],"target_id":"concept.nist.maximalindependentset","target_kind":"node","target_sha256":"3479004d3ab3adc9d8d47123e386a1c9799c5cfda8960eff3c54d1b5505ed2f3"}],"concept.nist.maximallyconnectedcomponent":[{"id":"assertion.concept.nist.maximallyconnectedcomponent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximally connected component as: A connected subgraph of a graph to which no vertex can be added and it still be connected. Formal Definition: Given a graph G=(V, E), a subgraph S=(V', E') is a maximally connected component if S is connected , and for all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","support":[{"end":389,"quote":"A\nconnected\nsubgraph\nof a\ngraph\nto which no\nvertex\ncan be added and it still be connected.\nFormal Definition:\nGiven a\ngraph\nG=(V, E), a\nsubgraph\nS=(V', E') is a maximally connected component if\nS is\nconnected\n, and\nfor all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","source_id":"nist-dads.maximallyconnectedcomponent","source_sha256":"dac44d4e6eaa8f01128c703020486af37b3b81005934e3f2d9a6888bf293af22","start":85}],"target_id":"concept.nist.maximallyconnectedcomponent","target_kind":"node","target_sha256":"cd416b26d10c296d7f614e9a06c38d472a241370ae894555bcab548aa760f664"}],"concept.nist.maximumflow":[{"id":"assertion.concept.nist.maximumflow","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines maximum-flow problem as: The problem of finding the maximum flow between any two vertices of a directed graph . Also known as network flow problem.","support":[{"end":194,"quote":"The problem of finding the maximum\nflow\nbetween any two\nvertices\nof a\ndirected graph\n.\nAlso known as\nnetwork flow problem.","source_id":"nist-dads.maximumflow","source_sha256":"2900d8a91e1be09e837ae15b46c8d39b7a0f4657971596a46c8bd5152d63c924","start":72}],"target_id":"concept.nist.maximumflow","target_kind":"node","target_sha256":"8166b88335ddd7f2c3e58995b52a84f0e621179202d8d75b33bca857ed3cc291"}],"concept.nist.mealymachine":[{"id":"assertion.concept.nist.mealymachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Mealy machine as: A finite state machine which produces an output for each transition .","support":[{"end":122,"quote":"A\nfinite state machine\nwhich produces an output for each\ntransition\n.","source_id":"nist-dads.mealymachine","source_sha256":"589d62191e5338dcddbf1661bbeb2b83c81f931eebdb518265a27660ea3b447e","start":53}],"target_id":"concept.nist.mealymachine","target_kind":"node","target_sha256":"12b7d9d31ab01f4d6573bf03edd08ef4b80107fb210a811f67088a904f5f2984"}],"concept.nist.mean":[{"id":"assertion.concept.nist.mean","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mean as: The (arithmetic) mean of some values is the sum of all values divided by the number of values.","support":[{"end":129,"quote":"The (arithmetic) mean of some values is the sum of all values divided by the number of values.","source_id":"nist-dads.mean","source_sha256":"c1cb1b760150686ef7b123b039955cbcc08b6897be19edfe7399198c2e59ccdb","start":35}],"target_id":"concept.nist.mean","target_kind":"node","target_sha256":"c82c35ed003de2f46abd0d44947bbe661e4a6f57cf3015a2187f5687121b353b"}],"concept.nist.median":[{"id":"assertion.concept.nist.median","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines median as: The value that has an equal number of values greater and less than it. For an even number of values, it is the mean of the two middle values.","support":[{"end":181,"quote":"The value that has an equal number of values greater and less than it.  For an even number of values, it is the\nmean\nof the two middle values.","source_id":"nist-dads.median","source_sha256":"0f7f61b7b67d66e6bd29d78061ec81608ca381eb79c55c7c0fe1c166ef209e27","start":39}],"target_id":"concept.nist.median","target_kind":"node","target_sha256":"c58a5dd2e64776a07d3a8ace441dc6dd24e9eb382444f1a3b29acb2cc4678dab"}],"concept.nist.meld":[{"id":"assertion.concept.nist.meld","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines meld as: Joining several data structures with particular properties into one large data structure having those properties. For instance, some priority queue implementations support the operation of joining two priority queues into a larger one.","support":[{"end":271,"quote":"Joining several data structures with particular properties into one large data structure having those properties.  For instance, some\npriority queue\nimplementations support the operation of joining two priority queues into a larger one.","source_id":"nist-dads.meld","source_sha256":"9dbe966d1a887d88b423a57dba3500aafcab8e85bea38267901ed23996d6c8f2","start":35}],"target_id":"concept.nist.meld","target_kind":"node","target_sha256":"662082ac6a9073bbfa8fbb60aff444b363f2dd48801bc969192347217f0a79aa"}],"concept.nist.merkletree":[{"id":"assertion.concept.nist.merkletree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Merkle tree as: A tree (usually a binary tree ) in which each internal node has a hash of all the information in the leaf nodes under it. Specifically, each internal node has a hash of the information in its children . Each leaf has a hash of the block of information it represents. All leaf nodes are at the same depth . All nodes are as far left as possible. To add a block (leaf) to a full tree, a new root is created with the old root as its left child. Its right child is a degenerate tree (only left subtrees) all the way to the leaf level. Also known as hash tree.","support":[{"end":613,"quote":"A\ntree\n(usually a\nbinary tree\n) in which each\ninternal node\nhas a\nhash\nof all the information in the\nleaf\nnodes under it.  Specifically, each internal node has a hash of the information in its\nchildren\n.  Each leaf has a hash of the block of information it represents.  All leaf nodes are at the same\ndepth\n.  All nodes are as far left as possible.\nTo add a block (leaf) to a\nfull\ntree, a new\nroot\nis created with the old root as its left child.  Its right child is a degenerate tree (only left subtrees) all the way to the leaf level.\nAlso known as\nhash tree.","source_id":"nist-dads.merkletree","source_sha256":"ad38aed7d0ee957ae9818731e56e6058b517207dcb9264b924272bf44840f352","start":53}],"target_id":"concept.nist.merkletree","target_kind":"node","target_sha256":"fd59154dd8262d1fc4582b7ec0499e64436b06fc9de2999bbbc748946faf8909"}],"concept.nist.midrange":[{"id":"assertion.concept.nist.midrange","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines midrange as: The sum of the minimum and maximum values, divided by two.","support":[{"end":101,"quote":"The sum of the minimum and maximum values, divided by two.","source_id":"nist-dads.midrange","source_sha256":"597ff1b081f4bb89cc8c5a5d9365df3996ebd102d4b531934c64f976a8faa3f4","start":43}],"target_id":"concept.nist.midrange","target_kind":"node","target_sha256":"2ea0f6a9a811b29ab839ca38503959b4599c4511bcb87a6e4a2d7356a58f7a4a"}],"concept.nist.minheapprop":[{"id":"assertion.concept.nist.minheapprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines min-heap property as: Each node in a tree has a key which is greater than or equal to the key of its parent .","support":[{"end":148,"quote":"Each\nnode\nin a\ntree\nhas a\nkey\nwhich is greater than or equal to the key of its\nparent\n.","source_id":"nist-dads.minheapprop","source_sha256":"d9ca97445be1be81071530e45101e2c59095972c08a771c71e8d7fb927f47bc5","start":61}],"target_id":"concept.nist.minheapprop","target_kind":"node","target_sha256":"5aeb6eb9b3329c321bb2bf05eb0293ce5146ab95ba2ba52fbf7948d052a38e04"}],"concept.nist.minimumboundingbox":[{"id":"assertion.concept.nist.minimumboundingbox","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum bounding box as: The smallest rectangle completely enclosing a set of points. Also known as MBB.","support":[{"end":146,"quote":"The smallest rectangle completely enclosing a set of points.\nAlso known as\nMBB.","source_id":"nist-dads.minimumboundingbox","source_sha256":"5ee6c28ac50d2fc78c76b08ed8b4901a0c735f4579ff665c68b806d7849f2c2d","start":67}],"target_id":"concept.nist.minimumboundingbox","target_kind":"node","target_sha256":"25220426decadc1be42c227f20b4e8c6051f297dc85a6fb0c814b58e0af20f2e"}],"concept.nist.minimumcut":[{"id":"assertion.concept.nist.minimumcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum cut as: The smallest set of edges in an undirected graph which separate two distinct vertices . That is, every path between them includes some member of the set.","support":[{"end":203,"quote":"The smallest set of\nedges\nin an\nundirected graph\nwhich separate two distinct\nvertices\n.  That is, every\npath\nbetween them includes some member of the set.","source_id":"nist-dads.minimumcut","source_sha256":"930df7dd08dbf21a609af38820d1ecc89dba914261c74b99eda90e9f90ff8ac7","start":49}],"target_id":"concept.nist.minimumcut","target_kind":"node","target_sha256":"67fa67ea9d0f0c4e5faee22824a611c9ac86fb491f1a4743c741fee6b6665410"}],"concept.nist.minimumspanningtree":[{"id":"assertion.concept.nist.minimumspanningtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines minimum spanning tree as: A minimum-weight tree in a weighted graph which contains all of the graph's vertices . Also known as MST, shortest spanning tree, SST.","support":[{"end":203,"quote":"A minimum-weight\ntree\nin a\nweighted graph\nwhich contains all of the graph's\nvertices\n.\nAlso known as\nMST, shortest spanning tree, SST.","source_id":"nist-dads.minimumspanningtree","source_sha256":"d91d8ee99a445199c48a4e03089f3a439bc3d8d470c10206c1b8639c228e771e","start":69}],"target_id":"concept.nist.minimumspanningtree","target_kind":"node","target_sha256":"5e22d2a79504fc3b503386a811e893546724bc602661d992f192343cc52272c7"}],"concept.nist.minvertexcut":[{"id":"assertion.concept.nist.minvertexcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimum vertex cut as: The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut .","support":[{"end":226,"quote":"The smallest set of\nvertices\nin an\nundirected graph\nwhich separate two distinct vertices.  That is, every\npath\nbetween them passes through some member of the\ncut\n.","source_id":"nist-dads.minvertexcut","source_sha256":"854d079e58a61c695acd8121dd4bfde85c4e3f1605461860c3f54c4a216afb98","start":63}],"target_id":"concept.nist.minvertexcut","target_kind":"node","target_sha256":"508077a0b8196e2201aae92618f9b4e830b6468c07ebb4eb6b8a7e0bd71d3067"}],"concept.nist.mixedinteger":[{"id":"assertion.concept.nist.mixedinteger","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mixed integer linear program as: A linear program with additional constraints that some of the variables must take on integer values. Solving such problems is NP-hard .","support":[{"end":219,"quote":"A\nlinear program\nwith additional constraints that some of the variables must take on integer values.  Solving such problems is\nNP-hard\n.","source_id":"nist-dads.mixedinteger","source_sha256":"207a430342947a0d89a2ca402bb52ddeef87aa954e89ec5ebd8f3e51dd862367","start":83}],"target_id":"concept.nist.mixedinteger","target_kind":"node","target_sha256":"736d6af842295ab1d0a8b1bf583bbbd26699c4c71e484ea2104b403962c41f38"}],"concept.nist.mode":[{"id":"assertion.concept.nist.mode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines mode as: The value that occurs most often. If no value is repeated, there is no mode. If more than one value occurs with the same greatest frequency, each value is a mode.","support":[{"end":199,"quote":"The value that occurs most often.  If no value is repeated, there is no mode.  If more than one value occurs with the same greatest frequency, each value is a mode.","source_id":"nist-dads.mode","source_sha256":"099a09321579eac9db821cf69bd25afa45a453292aa1f3e0f0c25e986b46663d","start":35}],"target_id":"concept.nist.mode","target_kind":"node","target_sha256":"e8695009129c389202dd60c09df05c3c919ade86037f708151efbba7460565c5"}],"concept.nist.modelofcomputation":[{"id":"assertion.concept.nist.modelofcomputation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines model of computation as: A formal, abstract definition of a computer. Using a model one can more easily analyze the intrinsic execution time or memory space of an algorithm while ignoring many implementation issues. There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","support":[{"end":440,"quote":"A formal, abstract definition of a computer.  Using a model one can more easily analyze the intrinsic execution time or memory space of an\nalgorithm\nwhile ignoring many implementation issues.  There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","source_id":"nist-dads.modelofcomputation","source_sha256":"0bf6481096e485301c74891a5778e75d7ac5da71409ce5016ff5700147990cfb","start":67}],"target_id":"concept.nist.modelofcomputation","target_kind":"node","target_sha256":"0802c703a4e470e669736f1f08511f859c522a9a2a9554af86eeb105bc304617"}],"concept.nist.monotonicallydecreasing":[{"id":"assertion.concept.nist.monotonicallydecreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotonically decreasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≥ f(y).","support":[{"end":183,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x ≤ y implies f(x) ≥ f(y).","source_id":"nist-dads.monotonicallydecreasing","source_sha256":"41937cd96584c62e288e3fad7ab5e39a95a2faa4ff6afc1af7dbf0c126d92b01","start":75}],"target_id":"concept.nist.monotonicallydecreasing","target_kind":"node","target_sha256":"0e89b7dcb0e10ca9d4df5d0bd2ba254f7a22939650f18dabb60b55d3361ce293"}],"concept.nist.monotonicallyincreasing":[{"id":"assertion.concept.nist.monotonicallyincreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotonically increasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≤ f(y).","support":[{"end":183,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x ≤ y implies f(x) ≤ f(y).","source_id":"nist-dads.monotonicallyincreasing","source_sha256":"eb64e9378f3c6391d24b23fc1a325410cf526a95f8b657c9dc6fbf0952609182","start":75}],"target_id":"concept.nist.monotonicallyincreasing","target_kind":"node","target_sha256":"3a2d3d7d07dade5eda04b6778f27eec63487221d2ae59dc216761c2e968ed99f"}],"concept.nist.monotonprioq":[{"id":"assertion.concept.nist.monotonprioq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines monotone priority queue as: A priority queue in which a key being inserted is never higher in priority than a previously deleted node.","support":[{"end":183,"quote":"A\npriority queue\nin which a\nkey\nbeing inserted is never higher in priority than a previously deleted node.","source_id":"nist-dads.monotonprioq","source_sha256":"82aa02fb93ff8e9227d8193cd9bf0263229d440e40ac7b88ecef10c3679ca4d9","start":77}],"target_id":"concept.nist.monotonprioq","target_kind":"node","target_sha256":"f5bf07790dc19cfdd2f4f476c2319bd404b0f330e0d5f08523ed8950f95bf75e"}],"concept.nist.mooremachine":[{"id":"assertion.concept.nist.mooremachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Moore machine as: A finite state machine that produces an output for each state .","support":[{"end":116,"quote":"A\nfinite state machine\nthat produces an output for each\nstate\n.","source_id":"nist-dads.mooremachine","source_sha256":"562f32bcb2fda88ffef52d8bc2e7f63da1c6b1acfe5088010b723b2f0ead6fb3","start":53}],"target_id":"concept.nist.mooremachine","target_kind":"node","target_sha256":"eb6b35e7115e631e22d65a2d2c79209b78ddef140a71137d0ae694760403074d"}],"concept.nist.multicommdty":[{"id":"assertion.concept.nist.multicommdty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multi-commodity flow as: A maximum-flow problem involving multiple commodities, in which each commodity has an associated demand and source - sink pairs.","support":[{"end":195,"quote":"A\nmaximum-flow problem\ninvolving multiple commodities, in which each commodity has an associated demand and\nsource\n-\nsink\npairs.","source_id":"nist-dads.multicommdty","source_sha256":"ddb7a13c19f2cb4c8a3c2c548453e7b77390787a4f8c9879a990b9a34dc914c7","start":67}],"target_id":"concept.nist.multicommdty","target_kind":"node","target_sha256":"ac8b5020f311436779eeb39d6f47eb708fda3dbafba9e2e469c58b4af0348b87"}],"concept.nist.multigraph":[{"id":"assertion.concept.nist.multigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multigraph as: A graph whose edges are unordered pairs of vertices , and the same pair of vertices can be connected by multiple edges. Formal Definition: Same as graph, but E is a bag of edges, not a set .","support":[{"end":241,"quote":"A\ngraph\nwhose\nedges\nare unordered pairs of\nvertices\n, and the same pair of vertices can be connected by multiple edges.\nFormal Definition:\nSame as graph, but E is a\nbag\nof edges, not a\nset\n.","source_id":"nist-dads.multigraph","source_sha256":"0e552e6954dccaf248620968159a3bc0e4db0188704f250f13b117bdf633e744","start":51}],"target_id":"concept.nist.multigraph","target_kind":"node","target_sha256":"16fe5c0408c0a3b968d189f519e7b69f905e0f5750b2e775be240892d317b069"}],"concept.nist.multilaygrd":[{"id":"assertion.concept.nist.multilaygrd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multilayer grid file as: A spatial access method which is two or more simultaneous grid files . Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","support":[{"end":234,"quote":"A\nspatial access method\nwhich is two or more simultaneous\ngrid files\n.  Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","source_id":"nist-dads.multilaygrd","source_sha256":"04f603f6aa88587201c8fc578ac362a3d011ae469e1b5c681a842fcbb02745e7","start":71}],"target_id":"concept.nist.multilaygrd","target_kind":"node","target_sha256":"e0a36874d839bd4ddc06156f2b21d2628f2282488a4a955358e4708ec4f140c4"}],"concept.nist.multiprocssr":[{"id":"assertion.concept.nist.multiprocssr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiprocessor model as: A model of parallel computation based on a set of communicating sequential processors.","support":[{"end":153,"quote":"A\nmodel of parallel computation\nbased on a set of communicating sequential processors.","source_id":"nist-dads.multiprocssr","source_sha256":"9ec73b5bbfa3400462357b77c1e7c9ff7092f5e6f54b1c2f1e3a26811b593e9e","start":67}],"target_id":"concept.nist.multiprocssr","target_kind":"node","target_sha256":"80228e06313df0795e38087fc9a4f2f71005ced8c92ab9d946a9abd44646b400"}],"concept.nist.multisuffixtree":[{"id":"assertion.concept.nist.multisuffixtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multi suffix tree as: A suffix tree extended to multiple strings by concatenating the strings .","support":[{"end":138,"quote":"A\nsuffix tree\nextended to multiple\nstrings\nby concatenating the\nstrings\n.","source_id":"nist-dads.multisuffixtree","source_sha256":"0a4d4ed349cf432143a28dc4e9d8425e8409ed1663b4c30f5647c0fb2ee58306","start":65}],"target_id":"concept.nist.multisuffixtree","target_kind":"node","target_sha256":"de1402eb39d84a823c9c56d91b1149aa533890fb1feca4a3c1270c5aa6bf8eb1"}],"concept.nist.multiwaydecision":[{"id":"assertion.concept.nist.multiwaydecision","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway decision as: A decision which has more than two results. For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","support":[{"end":237,"quote":"A decision which has more than two results.  For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","source_id":"nist-dads.multiwaydecision","source_sha256":"e116d829809a5671a9e70068111a607c8764ed011d78abb9425fce5e639eb068","start":61}],"target_id":"concept.nist.multiwaydecision","target_kind":"node","target_sha256":"d598dbfac46fbf81d657e56d5413ca03ee0bd3f574eead92748036326099a41f"}],"concept.nist.multiwaymerge":[{"id":"assertion.concept.nist.multiwaymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway merge as: Combine more than two sorted data streams into a single sorted stream.","support":[{"end":125,"quote":"Combine more than two sorted data streams into a single sorted stream.","source_id":"nist-dads.multiwaymerge","source_sha256":"34f0db9713b3cbdf08d4a808ede9a6888ed13a1781062954444ea9ec67334d30","start":55}],"target_id":"concept.nist.multiwaymerge","target_kind":"node","target_sha256":"9e137cb3179f82e8cb5f37bb8af654115b8c8ea193f1d2b49d3289e6422c6c40"}],"concept.nist.multiwaytree":[{"id":"assertion.concept.nist.multiwaytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiway tree as: A tree with any number of children for each node .","support":[{"end":107,"quote":"A\ntree\nwith any number of\nchildren\nfor each\nnode\n.","source_id":"nist-dads.multiwaytree","source_sha256":"bd22ba364e2fe8de4c49d3a31d7e978cb4d533ded1a28ff436dfd5961114eb5e","start":57}],"target_id":"concept.nist.multiwaytree","target_kind":"node","target_sha256":"ea7b32656ab66df2f16881d65ec4cee59e02e22628051371dab8588dfad0ec1d"}],"concept.nist.nand":[{"id":"assertion.concept.nist.nand","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nand as: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","support":[{"end":111,"quote":"Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","source_id":"nist-dads.nand","source_sha256":"bcbc573e662261847ba353c387f72d38f03a0b5e638ee9257167c4be2d3c8fd2","start":35}],"target_id":"concept.nist.nand","target_kind":"node","target_sha256":"67828dc527b5f17eb05aa5e0528cbc9fb25f2a59e51b1e9740b8b005e3198f78"}],"concept.nist.naryfunc":[{"id":"assertion.concept.nist.naryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines n-ary function as: (1) A function with exactly n arguments. (2) A function which takes any number of arguments, or a variable number of arguments.","support":[{"end":183,"quote":"(1) A\nfunction\nwith exactly n arguments.  (2) A function which takes any number of arguments, or a variable number of arguments.","source_id":"nist-dads.naryfunc","source_sha256":"cc3b9e50480c92de367de15b1807be49425a22d81c25f0472623f0054898aa48","start":55}],"target_id":"concept.nist.naryfunc","target_kind":"node","target_sha256":"d247ffce0e95b8265124a5c85ed977d899a0dafb374390c3df64cb81f5596136"}],"concept.nist.nearestneighbor":[{"id":"assertion.concept.nist.nearestneighbor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nearest neighbor as: Find the point (rectangle, line, etc.) that is closest to another point.","support":[{"end":136,"quote":"Find the point (rectangle, line, etc.) that is closest to another point.","source_id":"nist-dads.nearestneighbor","source_sha256":"a25ca8f52c9cb4fbcc72504663e5f51ef2b52989a6825fd269006eb040323fee","start":64}],"target_id":"concept.nist.nearestneighbor","target_kind":"node","target_sha256":"82e73bdd78346ee28fa6acd6e0cf96904c706e4df6a183e1bb79a9fe3878c563"}],"concept.nist.negation":[{"id":"assertion.concept.nist.negation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines negation as: The negation of 0 is 1; the negation of 1 is 0.","support":[{"end":90,"quote":"The negation of 0 is 1; the negation of 1 is 0.","source_id":"nist-dads.negation","source_sha256":"c0741462fc602bcf19c4b7aa9a39c2b055752edf815ed795438f18eaf870303b","start":43}],"target_id":"concept.nist.negation","target_kind":"node","target_sha256":"950cb4e2592faa9d0e923b6d465323354128b67ec9cba19692a8b856f84839ac"}],"concept.nist.nextstate":[{"id":"assertion.concept.nist.nextstate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines next state as: The state immediately following the current state, defined by the transition function of a finite state machine and the input.","support":[{"end":173,"quote":"The\nstate\nimmediately following the current state, defined by the\ntransition function\nof a\nfinite state machine\nand the input.","source_id":"nist-dads.nextstate","source_sha256":"15e4ac94bac1d1963fb0acd3395b54b414f33fddb94ad5b62eb16c7f1f76caef","start":47}],"target_id":"concept.nist.nextstate","target_kind":"node","target_sha256":"3da12d35439dd405674adebd03a4e00b0c8de7dae664104237328d8ef2e5611b"}],"concept.nist.nist":[{"id":"assertion.concept.nist.nist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NIST as: The United States National Institute of Standards and Technology.","support":[{"end":100,"quote":"The United States National Institute of Standards and Technology.","source_id":"nist-dads.nist","source_sha256":"1663faa72caaeefae6400b5dc13678399c336763f58c2100233df123673642bf","start":35}],"target_id":"concept.nist.nist","target_kind":"node","target_sha256":"359d06b1b22cc36eeb31d6ce01564ddda178e0b3cee2edbd7d18d159f77046b4"}],"concept.nist.node":[{"id":"assertion.concept.nist.node","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines node as: (1) A unit of reference in a data structure. Also called a vertex in graphs and trees . (2) A collection of information which must be kept at a single memory location.","support":[{"end":203,"quote":"(1) A unit of reference in a data structure.  Also called a\nvertex\nin\ngraphs\nand\ntrees\n. (2) A collection of information which must be kept at a single memory location.","source_id":"nist-dads.node","source_sha256":"2825d103eca8f407d2084c70e8719c2f221b5c1d4b15327ad44e536e789774e0","start":35}],"target_id":"concept.nist.node","target_kind":"node","target_sha256":"ae6359b70a3921527ebc3edb9b7c5122bb1e55af51e3ccdc2f23fe84ef294131"}],"concept.nist.nondetermfinitestatemach":[{"id":"assertion.concept.nist.nondetermfinitestatemach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines nondeterministic finite state machine as: A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states . The transition function also may map the null symbol (no input symbol needed) and states to next states. Also known as NFA, nondeterministic finite automaton.","support":[{"end":383,"quote":"A\nfinite state machine\nwhose\ntransition function\nmaps inputs symbols and\nstates\nto a (possibly empty) set of\nnext states\n.  The transition function also may map the null symbol (no input symbol needed) and states to next states.\nAlso known as\nNFA, nondeterministic finite automaton.","source_id":"nist-dads.nondetermfinitestatemach","source_sha256":"a1606792343304569699a32cf0df60f8467f1f49c59a225cc9183c7a77eceb8e","start":101}],"target_id":"concept.nist.nondetermfinitestatemach","target_kind":"node","target_sha256":"eb33469cf0d2ec0943a89d0d6faa61399d8750bdc7481258e30b62071ef6e784"}],"concept.nist.nondetermfinitetreeautom":[{"id":"assertion.concept.nist.nondetermfinitetreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic finite tree automaton as: A nondeterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as NFTA.","support":[{"end":427,"quote":"A\nnondeterministic finite state machine\nthat accepts\nfinitary trees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The acceptance condition is modified accordingly.\nAlso known as\nNFTA.","source_id":"nist-dads.nondetermfinitetreeautom","source_sha256":"0b04ed0e0cf208c4d43fe1478eeeea889178fbf110bf4a0c685cf6afa7fcb592","start":103}],"target_id":"concept.nist.nondetermfinitetreeautom","target_kind":"node","target_sha256":"70f7f193278e8a8b8f8b4f1a17fa7c4555bbe3a13787398f18bab8891854d93d"}],"concept.nist.nondeterministic":[{"id":"assertion.concept.nist.nondeterministic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic as: Permitting more than one choice of next move at some step in a computation.","support":[{"end":134,"quote":"Permitting more than one choice of next move at some step in a computation.","source_id":"nist-dads.nondeterministic","source_sha256":"03ab4d63aa97083da3cd6280b55435e9f97019f695f2bccc98b4cd245b47979c","start":59}],"target_id":"concept.nist.nondeterministic","target_kind":"node","target_sha256":"a777b8065e7d160a8ba846b13a9f5764abeabcf90dcdbca7624dea2143d3954a"}],"concept.nist.nondetermtreeautom":[{"id":"assertion.concept.nist.nondetermtreeautom","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic tree automaton as: A nondeterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","support":[{"end":441,"quote":"A\nnondeterministic finite state machine\nthat accepts infinite\ntrees\nrather than just\nstrings\n.  The tree\nnodes\nare marked with the letters of the\nalphabet\nof the automaton, and the transition function encodes the\nnext states\nfor each branch of the tree.  The expressive power of such automata varies depending on the acceptance conditions of the trees.","source_id":"nist-dads.nondetermtreeautom","source_sha256":"0712c223bae13dffe2316b1feec47b59bbcc5eb0b297822989cd2a603c353a24","start":89}],"target_id":"concept.nist.nondetermtreeautom","target_kind":"node","target_sha256":"42d4dc79c597e6be012bfeabb2ac14f24021898927c3b4eee1a47c9f3874700c"}],"concept.nist.nondetermturingmach":[{"id":"assertion.concept.nist.nondetermturingmach","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines nondeterministic Turing machine as: A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance.","support":[{"end":277,"quote":"A\nTuring machine\nwhich has more than one\nnext state\nfor some combinations of contents of the current cell and current state.  An input is accepted if any move sequence leads to acceptance.","source_id":"nist-dads.nondetermturingmach","source_sha256":"a3d26e34c03a7a225aee5a253a9da8af4e3acb0547a6a91dfd520e10ecfc4d9a","start":89}],"target_id":"concept.nist.nondetermturingmach","target_kind":"node","target_sha256":"1884d4e9c000726ae43b2b507a12580115a7da9d37990e1fb91642c1ff154c17"}],"concept.nist.nor":[{"id":"assertion.concept.nist.nor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nor as: Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","support":[{"end":105,"quote":"Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","source_id":"nist-dads.nor","source_sha256":"71c8c1c64ba9f111bc4a44098c8af9d70556f7f1134d878f373750ae20470025","start":33}],"target_id":"concept.nist.nor","target_kind":"node","target_sha256":"52f0f08525a3fccbe24c98feaaf4bd9f6852c9999545d5899965ddd76fc333aa"}],"concept.nist.not":[{"id":"assertion.concept.nist.not","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines not as: Negation: NOT 0 = 1, NOT 1 = 0. Also known as complement .","support":[{"end":92,"quote":"Negation: NOT 0 = 1, NOT 1 = 0.  Also known as\ncomplement\n.","source_id":"nist-dads.not","source_sha256":"7fa34cb1b9b9a9305fd6c27981a7dc5422bacba215411542a698f0b8fdc38da8","start":33}],"target_id":"concept.nist.not","target_kind":"node","target_sha256":"74cb24cb7972b2dd9a1bb5bb23aea64df4991d926f11fdd35a0ba200796e7bed"}],"concept.nist.np":[{"id":"assertion.concept.nist.np","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP as: The complexity class of decision problems for which answers can be checked by an algorithm whose run time is polynomial in the size of the input. Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly. \"NP\" is the class that a N ondeterministic Turing machine accepts in P olynomial time. Also known as nondeterministic polynomial time.","support":[{"end":446,"quote":"The\ncomplexity class\nof\ndecision problems\nfor which answers can be checked by an algorithm whose run time is\npolynomial\nin the size of the input.  Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly.  \"NP\" is the class that a\nN\nondeterministic Turing machine\naccepts in\nP\nolynomial time.\nAlso known as\nnondeterministic polynomial time.","source_id":"nist-dads.np","source_sha256":"f4c82d1acbe3db745b5033af1481775d53292063dd8da54c5b9f60988393178d","start":31}],"target_id":"concept.nist.np","target_kind":"node","target_sha256":"c50bf62fb15aebd0a87d75f4628175f3cfa3218c83de58add4399eb615f26d04"}],"concept.nist.npcomplete":[{"id":"assertion.concept.nist.npcomplete","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines NP-complete as: The complexity class of decision problems for which answers can be checked for correctness, given a certificate , by an algorithm whose run time is polynomial in the size of the input (that is, it is NP ) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","support":[{"end":487,"quote":"The\ncomplexity class\nof\ndecision problems\nfor which answers can be checked for correctness, given a\ncertificate\n, by an algorithm whose run time is\npolynomial\nin the size of the input (that is, it is\nNP\n) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","source_id":"nist-dads.npcomplete","source_sha256":"01fc07f4179ca202dc10491849bd9cd969373c648ae7e5aa954e20d469667008","start":49}],"target_id":"concept.nist.npcomplete","target_kind":"node","target_sha256":"cfec4bd3bc5318ebb3cece6383fc98e9697d275eef6e3ff7f266f67ad2a01041"}],"concept.nist.npcompltlngg":[{"id":"assertion.concept.nist.npcompltlngg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP-complete language as: A language in NP such that every language in NP can be reduced to it in polynomial time .","support":[{"end":156,"quote":"A language in\nNP\nsuch that every language in NP can be reduced to it in\npolynomial time\n.","source_id":"nist-dads.npcompltlngg","source_sha256":"c4950cddc866411bdc487dbdf1058c93668b10f0bb103cfe70413f4763e5389a","start":67}],"target_id":"concept.nist.npcompltlngg","target_kind":"node","target_sha256":"d530f7380f9e4cf678d0f5da05fd39d3108ee27fc5bb8f8a6ddc059d7fb38d21"}],"concept.nist.nphard":[{"id":"assertion.concept.nist.nphard","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NP-hard as: The complexity class of decision problems that are intrinsically harder than those that can be solved by a nondeterministic Turing machine in polynomial time . When a decision version of a combinatorial optimization problem is proved to belong to the class of NP-complete problems, then the optimization version is NP-hard.","support":[{"end":366,"quote":"The\ncomplexity class\nof\ndecision problems\nthat are intrinsically harder than those that can be solved by a\nnondeterministic Turing machine\nin\npolynomial time\n.  When a decision version of a combinatorial\noptimization problem\nis proved to belong to the class of\nNP-complete\nproblems,  then the optimization version is NP-hard.","source_id":"nist-dads.nphard","source_sha256":"43a9a98b981a6267ace3aef695f30d0733653be225d572eada6fade7d8590f0f","start":41}],"target_id":"concept.nist.nphard","target_kind":"node","target_sha256":"5ba05c07a83279ad5ec5dbf57f93ff011af62139e0fb591cbb9c1700cf6ce997"}],"concept.nist.nqueens":[{"id":"assertion.concept.nist.nqueens","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines n queens as: Place n chess queens on an n × n board such that no queen can attack another. Efficiently find all possible placements.","support":[{"end":168,"quote":"Place n chess queens on an n × n board such that no queen can attack another.  Efficiently find all possible placements.","source_id":"nist-dads.nqueens","source_sha256":"2c10986dc3a63dd82f3e5f2fb1a11ab41ba5f80729a3fd4c8580e9b883a96e58","start":48}],"target_id":"concept.nist.nqueens","target_kind":"node","target_sha256":"aeb6c8c07d9fcfa91117d212e39e2b059b2b8208b4847c56e9f91a9c051e260f"}],"concept.nist.nulltree":[{"id":"assertion.concept.nist.nulltree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines null tree as: (1) A tree which is empty. (2) A tree whose leaf nodes all have a null value.","support":[{"end":123,"quote":"(1) A\ntree\nwhich is empty.  (2) A tree whose\nleaf\nnodes all have a null value.","source_id":"nist-dads.nulltree","source_sha256":"d9c18fd3b8134d817629d5362d7b903a702e0ce7b41f74bbe0a07f3ced9f5b78","start":45}],"target_id":"concept.nist.nulltree","target_kind":"node","target_sha256":"45aa62c56d64bf11c911f11cc2d4029cc7114d8ec59f0333ea8ab86256606e4e"}],"concept.nist.objective":[{"id":"assertion.concept.nist.objective","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines objective function as: A function associated with an optimization problem which determines how good a solution is, for instance, the total cost of edges in a solution to a traveling salesman problem.","support":[{"end":239,"quote":"A function associated with an\noptimization problem\nwhich determines how good a solution is, for instance, the total cost of\nedges\nin a solution to a\ntraveling salesman\nproblem.","source_id":"nist-dads.objective","source_sha256":"9b77da1e757754f00b0e55a3815b46f3902b878db8ce7424b3fb5ec3ed55057a","start":63}],"target_id":"concept.nist.objective","target_kind":"node","target_sha256":"73b03bc27b2d53f60bdcb562e12df8778f2d69d2808069872ac010c336aa3074"}],"concept.nist.obliviousalgorithm":[{"id":"assertion.concept.nist.obliviousalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oblivious algorithm as: An algorithm whose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","support":[{"end":194,"quote":"An\nalgorithm\nwhose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","source_id":"nist-dads.obliviousalgorithm","source_sha256":"557b37031e932cef3a63809b6d4c48255a1cb9a74bd43dff6dcf6abf2f3898cd","start":65}],"target_id":"concept.nist.obliviousalgorithm","target_kind":"node","target_sha256":"1bfb56729bdd3206f69ef6f1ffdc58c9ebc9ccfa4eee4458c147a8a1587acd13"}],"concept.nist.occurrence":[{"id":"assertion.concept.nist.occurrence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines occurrence as: A string v occurs in a string u if v is a substring of u.","support":[{"end":104,"quote":"A\nstring\nv occurs in a string u if v is a\nsubstring\nof u.","source_id":"nist-dads.occurrence","source_sha256":"7ab0bee379cecee1d871c1fdecf16105399cfd962d6474e6475ba3265390896f","start":47}],"target_id":"concept.nist.occurrence","target_kind":"node","target_sha256":"84639cb2a06e225208e65b4929d869d0d6dfbd3a8cb2b4f099c5d8c31e5795ee"}],"concept.nist.octree":[{"id":"assertion.concept.nist.octree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines octree as: A tree to index three dimensions. Each node has either eight children or no children.","support":[{"end":129,"quote":"A\ntree\nto index three dimensions.  Each node has either eight\nchildren\nor no children.","source_id":"nist-dads.octree","source_sha256":"bf3cabed4ead1f1472421ed5014062e7891ce57160fa48688d2fed4d8a88b25f","start":43}],"target_id":"concept.nist.octree","target_kind":"node","target_sha256":"ee100ebd6d8f1405cbfb550d9ce37b45fe9e1b2ee71104f14a62a39a04f7117c"}],"concept.nist.offline":[{"id":"assertion.concept.nist.offline","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines off-line algorithm as: An algorithm which is given the entire sequence of inputs in advance.","support":[{"end":132,"quote":"An algorithm which is given the entire sequence of inputs in advance.","source_id":"nist-dads.offline","source_sha256":"4bcdb6970442fe388bfcf3bd48b0cf01f0cc5d536b0acb21e1e7c22fa1dd8448","start":63}],"target_id":"concept.nist.offline","target_kind":"node","target_sha256":"2b6c823b4e096d8a8dc112bbb8b1e7fb135b0489c61e208599f52aa3cb48e695"}],"concept.nist.offset":[{"id":"assertion.concept.nist.offset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines offset as: The distance from the beginning of a string to the end of a segment in that string.","support":[{"end":122,"quote":"The distance from the beginning of a\nstring\nto the end of a\nsegment\nin that string.","source_id":"nist-dads.offset","source_sha256":"59c952ca2fcddeecc1725c66813180c38798e18f3e58b85d4e0e3eb1e15e4e7d","start":39}],"target_id":"concept.nist.offset","target_kind":"node","target_sha256":"a189666a284e9f726fa546055790f2a81af1169e9da5efe6f087f8932d5c98f3"}],"concept.nist.omega":[{"id":"assertion.concept.nist.omega","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ω as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity. Formal Definition: f(n) = ω (g(n)) means that for any positive constant c, there exists a constant k, such that 0 ≤ cg(n) < f(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","support":[{"end":516,"quote":"A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity.\nFormal Definition:\nf(n) = ω (g(n)) means that for any positive constant c,  there exists a constant k, such that  0 ≤ cg(n) < f(n) for all  n ≥ k. The value of k must not depend on n, but may depend on c.","source_id":"nist-dads.omega","source_sha256":"e3564ca1e5fe296c5e6b665769d8af13d4e44cc1ea41eae454028e9bd6efac0a","start":33}],"target_id":"concept.nist.omega","target_kind":"node","target_sha256":"994014b5d5abe19cdff4bccde2e205e385febcb346d517aacd63d19b00457b9f"}],"concept.nist.omicron":[{"id":"assertion.concept.nist.omicron","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines omicron as: The Greek letter written as \"o\" (see little-o notation ) or \"O\" (see big-O notation ).","support":[{"end":127,"quote":"The Greek letter written as \"o\" (see\nlittle-o notation\n) or \"O\" (see\nbig-O notation\n).","source_id":"nist-dads.omicron","source_sha256":"0a8d390353bc593beffa78081d1c80e38c19044eeb12c06797277a37dac6277d","start":41}],"target_id":"concept.nist.omicron","target_kind":"node","target_sha256":"282de7d3abf9bc27dea1f9416bcc35ab9b682d22358c0040ff1e197020542a8c"}],"concept.nist.onebasedindexing":[{"id":"assertion.concept.nist.onebasedindexing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 1-based indexing as: Indexing (an array ) beginning with 1.","support":[{"end":97,"quote":"Indexing (an\narray\n) beginning with 1.","source_id":"nist-dads.onebasedindexing","source_sha256":"0b7e4cc03faa6bd9e2625a4b0f0cd51bcc9e2d3a7a370f91f1e56afde22b5d64","start":59}],"target_id":"concept.nist.onebasedindexing","target_kind":"node","target_sha256":"ede727c7b4ff07e8bb3f08fafd9dac1ba3728471e2e542a76456647bbdadb268"}],"concept.nist.onedimensnal":[{"id":"assertion.concept.nist.onedimensnal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines one-dimensional as: Dealing with or restricted to a line. An organization where location can be completely described with exactly one axis.","support":[{"end":177,"quote":"Dealing with or restricted to a line.  An organization where location can be completely described with exactly one axis.","source_id":"nist-dads.onedimensnal","source_sha256":"3f1f07134aa801b85c9166345e494ed966f51fe3e6d310ad09020371433fa2cd","start":57}],"target_id":"concept.nist.onedimensnal","target_kind":"node","target_sha256":"e47f17b3e67f2833791888acd9d8f799aca97838a4daad64c2683261a57b2091"}],"concept.nist.online":[{"id":"assertion.concept.nist.online","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines on-line algorithm as: An algorithm that must process each input in turn, without detailed knowledge of future inputs.","support":[{"end":156,"quote":"An algorithm that must process each input in turn, without detailed knowledge of future inputs.","source_id":"nist-dads.online","source_sha256":"7c4b8905cf77499fe0e9c00d6e83b6c8a7bda475a36c53f8bb6a1c7fa6571e7f","start":61}],"target_id":"concept.nist.online","target_kind":"node","target_sha256":"96036ace2d1c0a1b99b30464ca0e26048cd17d8a0d89f86efa03197f775105ea"}],"concept.nist.optimal":[{"id":"assertion.concept.nist.optimal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal as: (1) A solution to an optimization problem which has the minimum (or maximum) value of the objective function . (2) The time, space, resource, etc. complexity of an algorithm which matches the best known lower bound of a problem.","support":[{"end":270,"quote":"(1) A solution to an\noptimization problem\nwhich has the minimum (or maximum) value of the\nobjective function\n.  (2) The time, space, resource, etc.\ncomplexity\nof an\nalgorithm\nwhich matches the best known\nlower bound\nof a problem.","source_id":"nist-dads.optimal","source_sha256":"53df69d59eb036b0cb8ab8121966a06d3bc602b48f03d9dd90a6390eac062e00","start":41}],"target_id":"concept.nist.optimal","target_kind":"node","target_sha256":"566d817dd282e965a035aa5ab269688dc54920b26b9ba33b932a74a4081fbb23"}],"concept.nist.optimalsoltn":[{"id":"assertion.concept.nist.optimalsoltn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal solution as: A solution to an optimization problem which minimizes (or maximizes) the objective function .","support":[{"end":152,"quote":"A solution to an\noptimization problem\nwhich minimizes (or maximizes) the\nobjective function\n.","source_id":"nist-dads.optimalsoltn","source_sha256":"850977c061bce97a561a4e3c86e06f22ca902bdbb2dea51075455517addfb625","start":59}],"target_id":"concept.nist.optimalsoltn","target_kind":"node","target_sha256":"3b2022e8705376fc96df5c811d6bb9bccf237307231d7c63afd8d453a32d8753"}],"concept.nist.optimalvalue":[{"id":"assertion.concept.nist.optimalvalue","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal value as: The minimum (or maximum) value of the objective function over the feasible region of an optimization problem .","support":[{"end":163,"quote":"The minimum (or maximum) value of the\nobjective function\nover the\nfeasible region\nof an\noptimization problem\n.","source_id":"nist-dads.optimalvalue","source_sha256":"069b15d70eb21804fae79d98efa7cbd36caebc0fd076ee1566d0a4f80627050e","start":53}],"target_id":"concept.nist.optimalvalue","target_kind":"node","target_sha256":"8d87aca90907012a0b819003916686c68f17a3bc3c029c4e5e0b6953827df5e5"}],"concept.nist.optimization":[{"id":"assertion.concept.nist.optimization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimization problem as: A computational problem in which the object is to find the best of all possible solutions. More formally, find a solution in the feasible region which has the minimum (or maximum) value of the objective function .","support":[{"end":281,"quote":"A computational problem in which the object is to find the best of all possible solutions.  More formally, find a solution in the\nfeasible region\nwhich has the minimum (or maximum) value of the\nobjective function\n.","source_id":"nist-dads.optimization","source_sha256":"710ecf45d0b3ec367e675a75517f3961d39d91257506e9f8ea1ee5b6a76abf94","start":67}],"target_id":"concept.nist.optimization","target_kind":"node","target_sha256":"86cba4c2b70e42d47544bab9fc36f6ab2008bb5a1cf793ded2efe62012a35865"}],"concept.nist.optimtriangulation":[{"id":"assertion.concept.nist.optimtriangulation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal triangulation problem as: Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes O(n log n) time.","support":[{"end":215,"quote":"Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes\nO(n log n)\ntime.","source_id":"nist-dads.optimtriangulation","source_sha256":"4175a7dc51af3e461b072e7a34502ce386b2bfb3ac01c6c27cb2becf01620c7b","start":90}],"target_id":"concept.nist.optimtriangulation","target_kind":"node","target_sha256":"b553313367042e1c4e893504a78c152baee70379d2ed094950be62f387bad616"}],"concept.nist.or":[{"id":"assertion.concept.nist.or","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines or as: Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1. Also known as inclusive or.","support":[{"end":119,"quote":"Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1.\nAlso known as\ninclusive or.","source_id":"nist-dads.or","source_sha256":"9c397633ac04ca2112329c5b077b37d250f2a6b4cdc8917d78a703a607dfae4a","start":31}],"target_id":"concept.nist.or","target_kind":"node","target_sha256":"9788d194a3db47f13821e2e3b84ae464daa7c2493c735eaa84841f3337a1e6b5"}],"concept.nist.oracleset":[{"id":"assertion.concept.nist.oracleset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle set as: A predetermined set of tapes used by an oracle Turing machine to make decisions otherwise not feasibled.","support":[{"end":151,"quote":"A predetermined set of tapes used by an\noracle Turing machine\nto make decisions otherwise not feasibled.","source_id":"nist-dads.oracleset","source_sha256":"673d1153db17899b09cefeec0c4de839b3747e44d1899e95f1fa12cf8e56fea1","start":47}],"target_id":"concept.nist.oracleset","target_kind":"node","target_sha256":"a149b128c974fa5d08fcb3a6e0f328903f6041344362dba2298ae0e5886f19c2"}],"concept.nist.oracletape":[{"id":"assertion.concept.nist.oracletape","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle tape as: An extra tape used by an oracle Turing machine to make decisions otherwise not feasible.","support":[{"end":137,"quote":"An extra tape used by an\noracle Turing machine\nto make decisions otherwise not feasible.","source_id":"nist-dads.oracletape","source_sha256":"1cbd51c6b3f694cccfd274ffe3fd0f694caf7f28e688fee799ea411e6c7ffa3c","start":49}],"target_id":"concept.nist.oracletape","target_kind":"node","target_sha256":"8b65d2a31df7d4b684bc6bdeffaf3b2903394457c9007d2e8bb0d2640093ffe5"}],"concept.nist.oracletur":[{"id":"assertion.concept.nist.oracletur","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oracle Turing machine as: A Turing machine with an extra oracle tape and three extra states q ? , q y , q n . When the machine enters q ? , control goes to state q y if the oracle tape content is in the oracle set ; otherwise control goes to state q n .","support":[{"end":297,"quote":"A\nTuring machine\nwith an extra\noracle tape\nand three extra states q\n?\n, q\ny\n, q\nn\n.  When the machine enters q\n?\n, control goes to state q\ny\nif the oracle tape content is in the\noracle set\n; otherwise control goes to state q\nn\n.","source_id":"nist-dads.oracletur","source_sha256":"281e093a4b69249e0748fd6cce89c3da10b1565da6b26f4f51c4f757d0a48c82","start":69}],"target_id":"concept.nist.oracletur","target_kind":"node","target_sha256":"bf4e63b343185d9885e9432e29dd347e0ab18da9b36f395cceb1637fc4f09bc1"}],"concept.nist.order":[{"id":"assertion.concept.nist.order","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order as: (1) The height of a tree . (2) The number of children of the root of a binomial tree . (3) The maximum number of children of nodes in a B-tree . (4) The number of data streams, usually denoted ω, in a multiway merge .","support":[{"end":256,"quote":"(1) The\nheight\nof a\ntree\n.   (2) The number of\nchildren\nof the\nroot\nof a\nbinomial tree\n. (3) The maximum number of children of\nnodes\nin a\nB-tree\n. (4) The number of data streams, usually denoted ω, in a\nmultiway merge\n.","source_id":"nist-dads.order","source_sha256":"9124a99e5f73f10179f510ac91cf26808db1e2f7d6a16ae277d47ddf3a2f0ecd","start":37}],"target_id":"concept.nist.order","target_kind":"node","target_sha256":"f14ee74a14b4223699d97eda973c885ab22c742a298448124343999f80dc3079"}],"concept.nist.orderedarry":[{"id":"assertion.concept.nist.orderedarry","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered array as: An array whose items have some order. Usually, it means a sorted array , but may mean not fully ordered, for example, all values less than the median are in the first half.","support":[{"end":230,"quote":"An\narray\nwhose items have some order.  Usually, it means a\nsorted array\n, but may mean not fully ordered, for example, all values less than the\nmedian\nare in the first half.","source_id":"nist-dads.orderedarry","source_sha256":"98a4998d968d9c94ac2d82711322d1a3ef76eb21dfd7ccbfdcb8af43ea8d9bd6","start":57}],"target_id":"concept.nist.orderedarry","target_kind":"node","target_sha256":"a470e0a5d42a5422cde3736a0c0d54ce0db8f2fbbd4396821d0794ecd8d97bca"}],"concept.nist.orderedlinkedlist":[{"id":"assertion.concept.nist.orderedlinkedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered linked list as: A linked list whose items are kept in some order.","support":[{"end":118,"quote":"A\nlinked list\nwhose items are kept in some order.","source_id":"nist-dads.orderedlinkedlist","source_sha256":"7186333e471776dacda59238d3966aec024b2f5f8569789e7610c0deb8fa3b17","start":69}],"target_id":"concept.nist.orderedlinkedlist","target_kind":"node","target_sha256":"5bec7bb077f3f20b543407464234ce6b1276a2db33ba184704915e6592177fe5"}],"concept.nist.orderedtree":[{"id":"assertion.concept.nist.orderedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ordered tree as: A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.","support":[{"end":172,"quote":"A\ntree\nwhere the\nchildren\nof every\nnode\nare ordered, that is, there is a first child, second child, third child, etc.","source_id":"nist-dads.orderedtree","source_sha256":"1b204f1a7ae2d9083fc6607c7f60eb5ee4cc1b0656a7e6c809914956a3949928","start":55}],"target_id":"concept.nist.orderedtree","target_kind":"node","target_sha256":"e7b8a13ee3235d80ab6a21c316af5b63133f7376b80f2278c1dd46ab5a0dbf06"}],"concept.nist.orthogonaldrawing":[{"id":"assertion.concept.nist.orthogonaldrawing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonal drawing as: A graph drawing in which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","support":[{"end":183,"quote":"A\ngraph drawing\nin which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","source_id":"nist-dads.orthogonaldrawing","source_sha256":"109589b40988bec437ab3fb87bafadfd1326d17c56946d7f2164ab501a22ffe2","start":63}],"target_id":"concept.nist.orthogonaldrawing","target_kind":"node","target_sha256":"6eced1a6bf85b6468d788aa661b463a1d419b97fced3a1ad4c9c237eb829f617"}],"concept.nist.orthogonallists":[{"id":"assertion.concept.nist.orthogonallists","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonal lists as: Lists that share items, but are structurally independent.","support":[{"end":120,"quote":"Lists\nthat share items, but are structurally independent.","source_id":"nist-dads.orthogonallists","source_sha256":"90936cd45e0bf8aad4fc2fb73e73d1c5283e923a3ca0d6e00ef72b1d3610273a","start":63}],"target_id":"concept.nist.orthogonallists","target_kind":"node","target_sha256":"2fb23f55d420b2b8df7f18f8cc9fe043909f82e4255b5f373350917dd787a5b1"}],"concept.nist.orthogoncnvx":[{"id":"assertion.concept.nist.orthogoncnvx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines orthogonally convex rectilinear polygon as: A rectilinear polygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","support":[{"end":224,"quote":"A\nrectilinear\npolygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","source_id":"nist-dads.orthogoncnvx","source_sha256":"580d955d8c2f38cf93b6e8a1345c314c72e59cf28451fff6f567a99044c24921","start":105}],"target_id":"concept.nist.orthogoncnvx","target_kind":"node","target_sha256":"ed893c3bf8ea3be51b228f3d4129419187385d83a620e92cfd42af32be20274b"}],"concept.nist.outdegree":[{"id":"assertion.concept.nist.outdegree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines out-degree as: The number of edges going out of a vertex in a directed graph .","support":[{"end":110,"quote":"The number of\nedges\ngoing out of a\nvertex\nin a\ndirected graph\n.","source_id":"nist-dads.outdegree","source_sha256":"29b10f711533ed9f2fd0ff4eaae58ecbd6f2430fa9b416d6f8a5f294f6ad70e6","start":47}],"target_id":"concept.nist.outdegree","target_kind":"node","target_sha256":"579810debcefb92f3bf6ba96c7c0d12e7785fac22c356107b79364d07199cdd6"}],"concept.nist.p":[{"id":"assertion.concept.nist.p","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines P as: The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time .","support":[{"end":138,"quote":"The\ncomplexity class\nof languages that can be accepted by a deterministic\nTuring machine\nin\npolynomial time\n.","source_id":"nist-dads.p","source_sha256":"6fe00ca23395b54d8b3f936a474cdd122c9bcf4a784e4a9b0fd3bc858a05feec","start":29}],"target_id":"concept.nist.p","target_kind":"node","target_sha256":"5602ddadcc10e5e63119ba4b46f562033d4ca36a744776aa26b99b3bc5485793"}],"concept.nist.packing":[{"id":"assertion.concept.nist.packing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines packing as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","support":[{"end":162,"quote":"Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","source_id":"nist-dads.packing","source_sha256":"ccb2c5e99e6705a7db857b72ae9c0dc0f678112a678d6f71a781d3652fdc896b","start":41}],"target_id":"concept.nist.packing","target_kind":"node","target_sha256":"964c38a25b5fe459b09bd17974f082d98e2eccb2d37728f7a9ddcdf2b2ef4252"}],"concept.nist.paddingrgmnt":[{"id":"assertion.concept.nist.paddingrgmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines padding argument as: A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","support":[{"end":224,"quote":"A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","source_id":"nist-dads.paddingrgmnt","source_sha256":"7717fc75166f144549787f050e60dc21ce54750ac9b3a18b7298eb8856ceaeae","start":59}],"target_id":"concept.nist.paddingrgmnt","target_kind":"node","target_sha256":"e0bd837934e39e1c2c1bf785c4ddb2748fbbd8bb8be6b744fbe48fc8564eb69b"}],"concept.nist.pagoda":[{"id":"assertion.concept.nist.pagoda","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pagoda as: A priority queue implemented with a variant of a binary tree . The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child ) or rightmost (if it is a left child) descendant leaf . The basic operation is merge or meld , which maintains the heap property . An element is inserted by merging it as a singleton. The root is removed by merging its right and left children. Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","support":[{"end":596,"quote":"A\npriority queue\nimplemented with a variant of a\nbinary tree\n.  The\nroot\npoints to its children, as in a binary tree.  Every other\nnode\npoints back to its\nparent\nand down to its leftmost (if it is a right\nchild\n) or rightmost (if it is a left child)\ndescendant\nleaf\n.  The basic operation is merge or\nmeld\n, which maintains  the\nheap property\n.  An element is inserted by merging it as a singleton.  The\nroot\nis removed by merging its right and left children.  Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","source_id":"nist-dads.pagoda","source_sha256":"3cd82e5be6c92b2c80f99974a0534e2b5a43e94136fd1c8ff0976806a8758eff","start":43}],"target_id":"concept.nist.pagoda","target_kind":"node","target_sha256":"eafb0cac0f9741c185fee73383e44a4ffbb3a03d52c49bfcf45f8f81572ecf00"}],"concept.nist.parallel":[{"id":"assertion.concept.nist.parallel","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parallel computation thesis as: Sequential space is a polynomial of parallel time.","support":[{"end":131,"quote":"Sequential space is a\npolynomial\nof parallel time.","source_id":"nist-dads.parallel","source_sha256":"7ee636d93ace5a7f2fc7373b1012cedc316d35ed4ce87b2f4c84eb7058581ea6","start":81}],"target_id":"concept.nist.parallel","target_kind":"node","target_sha256":"339b9ecd5c3b87c1799c74a4f5d858bd9c2e21cffb9cfcd4b993afae587eb5c1"}],"concept.nist.parallelrandomaccessmachine":[{"id":"assertion.concept.nist.parallelrandomaccessmachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parallel random-access machine as: A shared memory model of computation , where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time. Also known as PRAM.","support":[{"end":279,"quote":"A\nshared memory\nmodel of computation\n, where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time.\nAlso known as\nPRAM.","source_id":"nist-dads.parallelrandomaccessmachine","source_sha256":"83d99410a75330434cb1c50841fab6d0be7c573decdaa439610afa8171aca63c","start":87}],"target_id":"concept.nist.parallelrandomaccessmachine","target_kind":"node","target_sha256":"6b8c221cd39336ec86e9e3362949da715b2672a90a3ba7c171aef614e33d3878"}],"concept.nist.parent":[{"id":"assertion.concept.nist.parent","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines parent as: Of a node : the tree node conceptually above or closer to the root than the node and which has a link to the node. See the figure at tree .","support":[{"end":179,"quote":"Of a\nnode\n: the\ntree\nnode conceptually above or closer to the\nroot\nthan the node and which has a\nlink\nto the node.  See the figure at\ntree\n.","source_id":"nist-dads.parent","source_sha256":"5d35086abcde029056d8c479c92138fefad6faad01cacdd665a4998808a41fae","start":39}],"target_id":"concept.nist.parent","target_kind":"node","target_sha256":"e32ef30ab0016cf23f42bf7cc2fb634c6a08e65458211f83096eca915c0e74bb"}],"concept.nist.partialfunct":[{"id":"assertion.concept.nist.partialfunct","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial function as: A function which is not defined for some inputs of the right type, that is, for some of a domain . For instance, division is a partial function since division by 0 is undefined (on the Reals).","support":[{"end":252,"quote":"A\nfunction\nwhich is not defined for some inputs of the right type, that is, for some of a\ndomain\n.  For instance, division is a partial function since division by 0 is undefined (on the Reals).","source_id":"nist-dads.partialfunct","source_sha256":"fb13dd7540112d80e94fd24cebbbe75d5f0a5422460107833b3a0a512ad01197","start":59}],"target_id":"concept.nist.partialfunct","target_kind":"node","target_sha256":"dd6fb7a409c204de8e1ddacb18e71cfbc97c10cb8076689ada81dcfba33afdaf"}],"concept.nist.partiallydecidableprob":[{"id":"assertion.concept.nist.partiallydecidableprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially decidable problem as: One whose associated language is a recursively enumerable language . Equivalently, there exists an algorithm that halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","support":[{"end":351,"quote":"One whose associated\nlanguage\nis a\nrecursively enumerable language\n.  Equivalently, there exists an\nalgorithm\nthat halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","source_id":"nist-dads.partiallydecidableprob","source_sha256":"f149ae12ddc8558315735d53a542067c48f5ddc9fea1cab0dfa5d93a99774b95","start":81}],"target_id":"concept.nist.partiallydecidableprob","target_kind":"node","target_sha256":"0b800f1d0d8efcb42eac28347aa353c7d8749c0549d0afb341521a3d65e877d3"}],"concept.nist.partiallydynamicgraph":[{"id":"assertion.concept.nist.partiallydynamicgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially dynamic graph problem as: Problem where the update operations include either edge insertions (incremental) or deletions (decremental).","support":[{"end":197,"quote":"Problem where the update operations include either\nedge\ninsertions (incremental) or deletions (decremental).","source_id":"nist-dads.partiallydynamicgraph","source_sha256":"ec2e91d4bd1f1b4456af1fcacb1d72cc597c837d91c8a069f8661d92fd0d2072","start":89}],"target_id":"concept.nist.partiallydynamicgraph","target_kind":"node","target_sha256":"c1959c2074ba68b755b1aba3e6a400e9dce6ed6bd6413b8ef83669fa10525534"}],"concept.nist.partiallypersistdata":[{"id":"assertion.concept.nist.partiallypersistdata","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partially persistent data structure as: A persistent data structure that allows updates to the latest version only.","support":[{"end":172,"quote":"A\npersistent data structure\nthat allows updates to the latest version only.","source_id":"nist-dads.partiallypersistdata","source_sha256":"009078e421ae5932256c9a0fc91a5faf237070a432b49f71e76df3a677505108","start":97}],"target_id":"concept.nist.partiallypersistdata","target_kind":"node","target_sha256":"49b1caecb7cffdc1ce0de1a89e1a77eabfc0c7783ad4928a6e7ef9bd77bba644"}],"concept.nist.partialorder":[{"id":"assertion.concept.nist.partialorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial order as: An order defined for some, but not necessarily all, pairs of items. For instance, the sets {a, b} and {a, c, d} are subsets of {a, b, c, d}, but neither is a subset of the other. So \"subset of\" is a partial order on sets. Formal Definition: A partial order is a binary relation that is reflexive , transitive , and antisymmetric .","support":[{"end":386,"quote":"An order defined for some, but not necessarily all, pairs of items.  For instance, the\nsets\n{a, b} and {a, c, d} are\nsubsets\nof {a, b, c, d}, but neither is a subset of the other.  So  \"subset of\" is a partial order on sets.\nFormal Definition:\nA partial order is a\nbinary relation\nthat is\nreflexive\n,\ntransitive\n, and\nantisymmetric\n.","source_id":"nist-dads.partialorder","source_sha256":"1dcae29844b617795fa27021ddeb61fa705bb12269a5c71b818de1a772761f0c","start":53}],"target_id":"concept.nist.partialorder","target_kind":"node","target_sha256":"d4603fb7aa2b38ff3ba8a35432958485f12bf1c86592d0a92626939e1808c62f"}],"concept.nist.partialrcrsv":[{"id":"assertion.concept.nist.partialrcrsv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines partial recursive function as: A function computed by a Turing machine that need not halt for all inputs.","support":[{"end":153,"quote":"A\nfunction\ncomputed by a\nTuring machine\nthat need not halt for all inputs.","source_id":"nist-dads.partialrcrsv","source_sha256":"acaeebcd2f802f2235c1dbba5a6e720c706b33f566c218657447029a8ba5973d","start":79}],"target_id":"concept.nist.partialrcrsv","target_kind":"node","target_sha256":"e0a01c231ecd3833099c1f54cd0a3b8e66ffbcc1661db3f8a2415ebb4e5c546e"}],"concept.nist.passivedatastruc":[{"id":"assertion.concept.nist.passivedatastruc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines passive data structure as: A data structure that is only changed by external threads or processes, in contrast to an active data structure .","support":[{"end":188,"quote":"A\ndata structure\nthat is only changed by external threads or processes, in contrast to an\nactive data structure\n.","source_id":"nist-dads.passivedatastruc","source_sha256":"736de7201a9fbd1cba7fb10ebf48459c2e49728e147f6106c922301969d7fb18","start":75}],"target_id":"concept.nist.passivedatastruc","target_kind":"node","target_sha256":"2c2ffffe036aa5dc27b6879069c6353aca415039a09675059dd359307a719f68"}],"concept.nist.path":[{"id":"assertion.concept.nist.path","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines path as: A list of vertices of a graph where each vertex has an edge between it and the next vertex.","support":[{"end":126,"quote":"A list of\nvertices\nof a\ngraph\nwhere each vertex has an\nedge\nbetween it and the next vertex.","source_id":"nist-dads.path","source_sha256":"7e950b3c91dea7f3f28931c2b7be5f8984391458769fd8ddf1f509ee9b582abf","start":35}],"target_id":"concept.nist.path","target_kind":"node","target_sha256":"f947430f8897c7e3bddf1777f0f64b25aab78a2335dcdc8098703ca16425c864"}],"concept.nist.pathsystem":[{"id":"assertion.concept.nist.pathsystem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines path system problem as: For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","support":[{"end":300,"quote":"For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible\nvertex\nin S.  A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","source_id":"nist-dads.pathsystem","source_sha256":"7f8957cc78e0d683af4e36d08fb2c969f96e42d86393173083fbc5f011b03c56","start":70}],"target_id":"concept.nist.pathsystem","target_kind":"node","target_sha256":"56c91956d471f648a8895ea68dcd941a5bf5c8195344511fcf7943e423b5702e"}],"concept.nist.pattern":[{"id":"assertion.concept.nist.pattern","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pattern as: A finite number of strings that are searched for in texts .","support":[{"end":100,"quote":"A finite number of\nstrings\nthat are searched for in\ntexts\n.","source_id":"nist-dads.pattern","source_sha256":"fc6818a79ffaa951598ae9c335ae1348fb6b37ce3c98fdaa6e7b1a0446215408","start":41}],"target_id":"concept.nist.pattern","target_kind":"node","target_sha256":"ae8dd9a672632f421096b39216b1b50aeeea61f73e0e77835765e3086a66c5ed"}],"concept.nist.patternelmnt":[{"id":"assertion.concept.nist.patternelmnt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pattern element as: A positive (negative) pattern element is a \"partial wild card\" presented as a subset of the alphabet Σ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","support":[{"end":270,"quote":"A positive (negative)\npattern\nelement is a \"partial wild card\" presented as a subset of the\nalphabet\nΣ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","source_id":"nist-dads.patternelmnt","source_sha256":"a8ab5dca3f60971f2863b8f4cebd83d6836418d939449a3c9f219a24a4d188cb","start":57}],"target_id":"concept.nist.patternelmnt","target_kind":"node","target_sha256":"0aa7054b7bf165c48e1381694c8d81189d9820f9614f9b6430a721ab38579073"}],"concept.nist.perfectbinarytree":[{"id":"assertion.concept.nist.perfectbinarytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect binary tree as: A binary tree with all leaf nodes at the same depth . All internal nodes have degree 2.","support":[{"end":152,"quote":"A\nbinary tree\nwith all\nleaf\nnodes\nat the same\ndepth\n. All\ninternal nodes\nhave\ndegree\n2.","source_id":"nist-dads.perfectbinarytree","source_sha256":"6e9e0bdfabad4e02def4bc2e0f8286b058c33af35a058b3c6754b7ba408ab366","start":65}],"target_id":"concept.nist.perfectbinarytree","target_kind":"node","target_sha256":"8158068f959f0c37b02ffd1c35d329fc89dd7d5082659e9e936b49a625bf3a38"}],"concept.nist.perfectmatch":[{"id":"assertion.concept.nist.perfectmatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect matching as: A matching , or subset of edges without common vertices , of a connected graph that touches all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex.","support":[{"end":250,"quote":"A\nmatching\n, or subset of\nedges\nwithout common\nvertices\n, of a\nconnected graph\nthat touches all vertices exactly once.  A graph with an odd number of vertices is allowed one unmatched vertex.","source_id":"nist-dads.perfectmatch","source_sha256":"d7547a9afcfba475888acf51eb0da431154249aed51d6bee50e13616fdd9d8be","start":59}],"target_id":"concept.nist.perfectmatch","target_kind":"node","target_sha256":"bc655873472316dd5ee2d2af728df3abe96555e510cea59eb892232138b57a94"}],"concept.nist.performance":[{"id":"assertion.concept.nist.performance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines performance guarantee as: An expression of the most the result of an approximation algorithm may depart from the optimal solution .","support":[{"end":174,"quote":"An expression of the most the result of an\napproximation algorithm\nmay depart from the\noptimal solution\n.","source_id":"nist-dads.performance","source_sha256":"d8d64964f67d4c56e44788fc65d0b32f51416beb1bdfa83d42d0c2e3f2e97213","start":69}],"target_id":"concept.nist.performance","target_kind":"node","target_sha256":"e85a9c43da295ca8c6b78f2dc0009d4ddab1782efcbe582ab34a9e280ab07473"}],"concept.nist.persistentdatastructure":[{"id":"assertion.concept.nist.persistentdatastructure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines persistent data structure as: A data structure that preserves its old versions, that is, previous versions may be queried in addition to the latest version.","support":[{"end":203,"quote":"A\ndata structure\nthat preserves its old versions, that is, previous versions may be queried in addition to the latest version.","source_id":"nist-dads.persistentdatastructure","source_sha256":"1b9c18b284dca0141ec1aa7e8faaac7c784dacb1f16aa76450928d1d064e4052","start":77}],"target_id":"concept.nist.persistentdatastructure","target_kind":"node","target_sha256":"c9a6064e748899ae3ab9af61ae63c737292c18e0be92abd784f01fd1e6fb4c69"}],"concept.nist.phoneticcoding":[{"id":"assertion.concept.nist.phoneticcoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines phonetic coding as: Code a string based on how it is pronounced.","support":[{"end":106,"quote":"Code a\nstring\nbased on how it is pronounced.","source_id":"nist-dads.phoneticcoding","source_sha256":"ad89a179edce6ee17dc5c513f6397d67d96cf7fc02869ed49d91e7cf4404d7de","start":62}],"target_id":"concept.nist.phoneticcoding","target_kind":"node","target_sha256":"149177096e8650cc0b3db158d3cae4035b64d2db78399bd48f0db3751e25d34a"}],"concept.nist.pile":[{"id":"assertion.concept.nist.pile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pile as: An ordered deque , that is, items may only be added to or removed from the head or the tail . An item is added to the head if it is smaller than the current head. An item is added to the tail if it is greater than the current tail. Items are never inserted into the middle, rather, an additional pile may be created.","support":[{"end":359,"quote":"An ordered\ndeque\n, that is, items may only be added  to or removed from the\nhead\nor the\ntail\n. An item is added to the\nhead\nif it is smaller than the current head.  An item is added to the\ntail\nif it is greater than the current tail.  Items are never inserted into the  middle, rather, an additional pile may be created.","source_id":"nist-dads.pile","source_sha256":"f41923a8486059a8963c1ac276b8c56c71c5b650d4ac72153957b3233109f8b9","start":39}],"target_id":"concept.nist.pile","target_kind":"node","target_sha256":"af4786f49932712c05481321baf77c8357a3d207c477b203e46591f4a53ddcf7"}],"concept.nist.planargraph":[{"id":"assertion.concept.nist.planargraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planar graph as: A graph that can be drawn in the plane with no crossing edges .","support":[{"end":115,"quote":"A\ngraph\nthat can be drawn in the plane with no  crossing\nedges\n.","source_id":"nist-dads.planargraph","source_sha256":"137d4bee51f34dd142dd22bdf87fac8cfa558a8ab1a654ca216e537740db69e8","start":51}],"target_id":"concept.nist.planargraph","target_kind":"node","target_sha256":"25e63ea49b83560fb30efbe544e0bef21a99a28fe61b1cafe3e161afdec460d1"}],"concept.nist.planarization":[{"id":"assertion.concept.nist.planarization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planarization as: The process of transforming a graph into a planar graph . More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing vertices ). In both cases, the aim of planarization is minimize the number of edge removals or replacements.","support":[{"end":404,"quote":"The process of transforming a\ngraph\ninto a\nplanar graph\n. More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing\nvertices\n).  In both cases, the aim of planarization is minimize the number of edge removals or replacements.","source_id":"nist-dads.planarization","source_sha256":"f373a7dded13a27ff27327645b0ee06e05ae2e4b624e18c3c16674975077f801","start":53}],"target_id":"concept.nist.planarization","target_kind":"node","target_sha256":"9a89f66d58bfbd640d42e0ded1bffd5181b78dd2c5cbf416496a664a285b3e5e"}],"concept.nist.planarstrght":[{"id":"assertion.concept.nist.planarstrght","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines planar straight-line graph as: A graph that can be embedded in the plane without crossings in which every edge in the graph is a straight line segment. It is sometimes referred to as planar subdivision or map.","support":[{"end":258,"quote":"A\ngraph\nthat can be embedded in the plane without crossings in which every\nedge\nin the graph is a straight line segment.  It is sometimes referred to as planar subdivision or map.","source_id":"nist-dads.planarstrght","source_sha256":"df701645883841790d8ece083a2519377d9b32cbbe8ca4b199e6fc261dd9d3cb","start":79}],"target_id":"concept.nist.planarstrght","target_kind":"node","target_sha256":"1eab6f0797786de164263ede52b8db655c89e0b9355708e3f18ee6e925efc84d"}],"concept.nist.plophashing":[{"id":"assertion.concept.nist.plophashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines PLOP-hashing as: Piecewise linear order-preserving (PLOP) hashing is a spatial access method which splits space into a nonperiodic grid. Each spatial dimension is divided by nodes of a binary tree . Object are stored in the grid cell of their centroid .","support":[{"end":293,"quote":"Piecewise linear order-preserving (PLOP) hashing is a\nspatial access method\nwhich splits space into a nonperiodic grid.  Each spatial dimension is divided by nodes of a\nbinary tree\n.  Object are stored in the grid cell of their\ncentroid\n.","source_id":"nist-dads.plophashing","source_sha256":"a1bfa62bcc1d36c82f2c40cc2c1b1651db84994beb61ea4dda669b163cc5bc60","start":55}],"target_id":"concept.nist.plophashing","target_kind":"node","target_sha256":"a9e2d249f6fa11655e3421abaabdb8ee22873bdbd7cf9e0372fbf9cc8d7771a9"}],"concept.nist.pointaccessmethod":[{"id":"assertion.concept.nist.pointaccessmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines point access method as: A data structure and associated algorithms primarily to search for points defined in multidimensional space. Also known as PAM.","support":[{"end":192,"quote":"A data structure and associated algorithms primarily to search for points defined in multidimensional space.\nAlso known as\nPAM.","source_id":"nist-dads.pointaccessmethod","source_sha256":"1a58d1d7224f1883d53f53421cad2ba5d4627df34821df3efaf7d6b0454469fb","start":65}],"target_id":"concept.nist.pointaccessmethod","target_kind":"node","target_sha256":"79c07dad90032cdbd67b58ed1d50418a767ad9fe65b07e71c12a841ae1f5dfe1"}],"concept.nist.pointerjumping":[{"id":"assertion.concept.nist.pointerjumping","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pointer jumping as: In a linked structure, replacing a pointer with the pointer it points to. Used for various algorithms on lists and trees . Also known as recursive doubling, shortcutting.","support":[{"end":228,"quote":"In a linked structure, replacing a pointer with the pointer it points to.  Used for various algorithms on\nlists\nand\ntrees\n.\nAlso known as\nrecursive doubling, shortcutting.","source_id":"nist-dads.pointerjumping","source_sha256":"fbf033193f6f5a7309c868e01e0375a5ba7e6d29b92f0c9938a500f230be15c8","start":57}],"target_id":"concept.nist.pointerjumping","target_kind":"node","target_sha256":"0f94b1fd93da3cd86f1e274402b14bfe1c6b5b569bbe3e3257c803f5fdf26015"}],"concept.nist.pointermachn":[{"id":"assertion.concept.nist.pointermachn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pointer machine as: A model of computation whose memory consists of an unbounded collection of registers, or records, connected by pointers. Each register may contain an arbitrary amount of additional information. No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","support":[{"end":375,"quote":"A\nmodel of computation\nwhose memory consists of an unbounded collection of registers, or records, connected by pointers.  Each register may contain an arbitrary amount of additional information.  No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","source_id":"nist-dads.pointermachn","source_sha256":"045a20b62318624b43702f95aabe2f88bb9e9c30fbd4e3d03a5157f2575b4316","start":57}],"target_id":"concept.nist.pointermachn","target_kind":"node","target_sha256":"d31bdd214f818ab83c8a5b8b54238432530071fbed28e3de9cfc817317921cc0"}],"concept.nist.poissonizatn":[{"id":"assertion.concept.nist.poissonizatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines poissonization as: To replace a deterministic input by poisson process, changing the model into a poisson model. A solution to the poisson model must be interpreted in the original model.","support":[{"end":224,"quote":"To replace a deterministic input by poisson process, changing the model into a poisson model.  A solution to the poisson model must be interpreted in the original model.","source_id":"nist-dads.poissonizatn","source_sha256":"1f4bc28d35d6e93f985345768498fb6947d88d5657ebcefacd7f5474ffed489c","start":55}],"target_id":"concept.nist.poissonizatn","target_kind":"node","target_sha256":"aac024642a6ace573ed23eda4bd2ad935d219a90009977edcc1433ad15155c93"}],"concept.nist.polychotomy":[{"id":"assertion.concept.nist.polychotomy","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polychotomy as: Division into many distinct classifications.","support":[{"end":93,"quote":"Division into many distinct classifications.","source_id":"nist-dads.polychotomy","source_sha256":"723d91521f9686607f857d04ebe295b1ba43db6485b06eacbeeae15de9aa85cf","start":49}],"target_id":"concept.nist.polychotomy","target_kind":"node","target_sha256":"fe62e3bafe44557f673d02c63968d5458fb44f8db4a2194855649be1bb5e0f42"}],"concept.nist.polynomhier":[{"id":"assertion.concept.nist.polynomhier","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial hierarchy as: The classes of languages accepted by k- alternating Turing machines , over all k≥ 0 and with initial state existential or universal. The bottom level (k=0) is the class P . The next level (k=1) comprises NP and co- NP .","support":[{"end":288,"quote":"The classes of\nlanguages\naccepted by k-\nalternating Turing machines\n, over all k≥ 0 and with initial state existential or universal.  The bottom level (k=0) is the class\nP\n.  The next level (k=1) comprises\nNP\nand co-\nNP\n.","source_id":"nist-dads.polynomhier","source_sha256":"fbc519035cebfc7ee94dcbc2f44146ada9790cda89ad14a0bd38e968f4fb5bd2","start":67}],"target_id":"concept.nist.polynomhier","target_kind":"node","target_sha256":"96b477aa2f202d1790c01242c5140d9cfd4eda45d752455848a4592082eabef8"}],"concept.nist.polynomialtm":[{"id":"assertion.concept.nist.polynomialtm","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines polynomial time as: When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(n k ) where k is a constant.","support":[{"end":218,"quote":"When the execution time of a computation, m(n), is no more than a\npolynomial\nfunction of the problem size, n. More formally m(n) =\nO(n\nk\n)\nwhere k is a constant.","source_id":"nist-dads.polynomialtm","source_sha256":"f236641add6fcfd4e3b053381d4ca2fd83e7198e60381b9e24f7f6351b3808ff","start":57}],"target_id":"concept.nist.polynomialtm","target_kind":"node","target_sha256":"49f3cb88e7e8ea0850a02aaddbcceb26345bd1499c3c93a4ca1ffabb627b0bec"}],"concept.nist.polynomtredc":[{"id":"assertion.concept.nist.polynomtredc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial-time reduction as: A transformation of one problem into another which is computable in polynomial time .","support":[{"end":162,"quote":"A transformation of one problem into another which is\ncomputable\nin\npolynomial time\n.","source_id":"nist-dads.polynomtredc","source_sha256":"7d5ca3d983408b1aaf4430ea521e0f144c58f4b026cd7547fac114b4da5c1b22","start":77}],"target_id":"concept.nist.polynomtredc","target_kind":"node","target_sha256":"bfc6fcd6df5d23082b2ac562a8361d63db333ae61f58b8fb0f92d6f3f59b83cf"}],"concept.nist.polytope":[{"id":"assertion.concept.nist.polytope","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polytope as: A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides. A generalization of polyhedron.","support":[{"end":197,"quote":"A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides.  A generalization of polyhedron.","source_id":"nist-dads.polytope","source_sha256":"db3b1b58f0fd8046166bb2e1c267c3d7816884a61836a6d3a973eab751485f4b","start":43}],"target_id":"concept.nist.polytope","target_kind":"node","target_sha256":"671131596b5c18f0a226c7e834cbfab728f8974345fe702d88195f5bff82380b"}],"concept.nist.poset":[{"id":"assertion.concept.nist.poset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines poset as: A set the elements of which are subject to a partial order . Also known as partially ordered set.","support":[{"end":134,"quote":"A\nset\nthe elements of which are subject to a\npartial order\n.\nAlso known as\npartially ordered set.","source_id":"nist-dads.poset","source_sha256":"fd94e25679d3186af2b75293b5117cb917ad8cf46d6fed9f34814a1c014022d9","start":37}],"target_id":"concept.nist.poset","target_kind":"node","target_sha256":"a65693096527c7ee9443a63a6d88292ccf057e57cb7287e92a2535e9cbd1c742"}],"concept.nist.postscorrespondprob":[{"id":"assertion.concept.nist.postscorrespondprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Post's correspondence problem as: Given a set of pairs of strings , find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem . Also known as PCP.","support":[{"end":325,"quote":"Given a\nset\nof pairs of\nstrings\n, find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an\nundecidable problem\n.\nAlso known as\nPCP.","source_id":"nist-dads.postscorrespondprob","source_sha256":"5ab151bc6ec5298ddbe9395d19cc31d16ee9fb726cc56f27d86c07705725bc0b","start":90}],"target_id":"concept.nist.postscorrespondprob","target_kind":"node","target_sha256":"2225f67581498c5ef887a13951f4b466b901fcd9f87e39c11caa43cdb04fbf1d"}],"concept.nist.potentialfnc":[{"id":"assertion.concept.nist.potentialfnc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines potential function as: A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","support":[{"end":171,"quote":"A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","source_id":"nist-dads.potentialfnc","source_sha256":"d99ac7a0e5e6167e9056d228442b5103cccbc5c09117554fe50052bf4a2f422f","start":63}],"target_id":"concept.nist.potentialfnc","target_kind":"node","target_sha256":"0f864adc35467132e3c6f9d240edc12c8d641317da8ef6d1cb84757ff7656878"}],"concept.nist.predicate":[{"id":"assertion.concept.nist.predicate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines predicate as: A function that returns true or false. Conceptually it tests for a condition.","support":[{"end":123,"quote":"A\nfunction\nthat returns true or false.  Conceptually it tests for a condition.","source_id":"nist-dads.predicate","source_sha256":"4180543f7fe07f2bc859f2a06ef583e77a5a24a70eab99e9c1a21f6e9756329d","start":45}],"target_id":"concept.nist.predicate","target_kind":"node","target_sha256":"dc3c2500265197f55a15deb3cffbe76df46ccdf48df96c8b48d2e8e823239d36"}],"concept.nist.prefix":[{"id":"assertion.concept.nist.prefix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prefix as: The beginning characters of a string . More formally a string v∈Σ * is a prefix of a string u∈Σ * if u=vu' for some string u'∈Σ * .","support":[{"end":171,"quote":"The beginning characters of a\nstring\n.  More formally a string v∈Σ\n*\nis a prefix of a string u∈Σ\n*\nif u=vu' for some string u'∈Σ\n*\n.","source_id":"nist-dads.prefix","source_sha256":"353994db3398f0d18d29d70c1afc88b11f9fec092303a9db69439971e1fd3a66","start":39}],"target_id":"concept.nist.prefix","target_kind":"node","target_sha256":"2472a4990602aec96ba019a84773d9e63470997d1a908f11a7b8c903086d1953"}],"concept.nist.prefixcode":[{"id":"assertion.concept.nist.prefixcode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prefix code as: Set of words such that no word of the set is a prefix of another word in the set. A prefix code may be represented by a coding tree .","support":[{"end":183,"quote":"Set of words such that no word of the set is a\nprefix\nof another word in the set.  A prefix code may be represented by a\ncoding tree\n.","source_id":"nist-dads.prefixcode","source_sha256":"fe5fcb44378501e74df30761311bef6a4f0a5894dc7cd3249a9277020ecfc395","start":49}],"target_id":"concept.nist.prefixcode","target_kind":"node","target_sha256":"e0a0818fa14466abfe7e414eea7e188eed31fb44961a723310b565c0049b171f"}],"concept.nist.primaryclustering":[{"id":"assertion.concept.nist.primaryclustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primary clustering as: The tendency for some collision resolution schemes to create long runs of filled slots near the hash function position of keys .","support":[{"end":191,"quote":"The tendency for some\ncollision resolution schemes\nto create long runs of filled slots near the\nhash function\nposition of\nkeys\n.","source_id":"nist-dads.primaryclustering","source_sha256":"932b8a1ededf644f1a321db9dd1821ce584d7fe9c69c114222c89ce8504e5c74","start":63}],"target_id":"concept.nist.primaryclustering","target_kind":"node","target_sha256":"2415694e59844969ab020d5d3ba27efc8dbec9b4d7d5b5efbf768e8ea3d5f8b4"}],"concept.nist.primitivealgorithm":[{"id":"assertion.concept.nist.primitivealgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primitive algorithm as: An algorithm in which all the computable steps are basic operations.","support":[{"end":133,"quote":"An\nalgorithm\nin which all the computable steps are basic operations.","source_id":"nist-dads.primitivealgorithm","source_sha256":"beec33cccff47c100cf5714fc1a7ec7ae972d9e0177ff702bb0f6e6b87356c90","start":65}],"target_id":"concept.nist.primitivealgorithm","target_kind":"node","target_sha256":"5ae67eb29afd64b41c3c668fe82ad308077976d43138bf9bd36915488e474080"}],"concept.nist.primitiverecursive":[{"id":"assertion.concept.nist.primitiverecursive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines primitive recursive as: A total function that can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","support":[{"end":190,"quote":"A\ntotal function\nthat can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","source_id":"nist-dads.primitiverecursive","source_sha256":"4f274e8c0c73b494fda2595c806795045f89c6a3d8fb9ea002dd401446c0846b","start":65}],"target_id":"concept.nist.primitiverecursive","target_kind":"node","target_sha256":"0cd292d01cc2479c11578e3e4ba15f44d8a787e2fb50d8e78d5b697d48a9af45"}],"concept.nist.principle":[{"id":"assertion.concept.nist.principle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines principle of optimality as: In some optimization problems , components of a globally optimal solution are themselves globally optimal.","support":[{"end":179,"quote":"In some\noptimization problems\n, components of a globally optimal solution are themselves globally optimal.","source_id":"nist-dads.principle","source_sha256":"fd77f37583e5f07cd0e6b40df7d758724677aafd1a4ce14f95d1f69f5691be8e","start":73}],"target_id":"concept.nist.principle","target_kind":"node","target_sha256":"daf25c2b43e92b6f37a7cefecd1da63a6444e4226e071e833ea096e9bacc7403"}],"concept.nist.priorityque":[{"id":"assertion.concept.nist.priorityque","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines priority queue as: An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues ( meld ), delete an arbitrary item, and increase the priority of a item (decrease-key). Formal Definition: The operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with axiomatic semantics as follows. new() returns a priority queue min(insert(v, new())) = v dm(insert(v, new())) = new() min(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then v else min(insert(w, PQ)) dm(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then insert(w, PQ) else insert(v, dm(insert(w, PQ))) where PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","support":[{"end":1016,"quote":"An\nabstract data type\nto efficiently support finding the item with the highest priority across a series of operations.  The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum).  Some implementations also efficiently support join two priority queues (\nmeld\n), delete an arbitrary item, and increase the priority of a item (decrease-key).\nFormal Definition:\nThe operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a priority queue\nmin(insert(v, new())) = v\ndm(insert(v, new())) = new()\nmin(insert(v, insert(w, PQ))) = if priority(v) < \tpriority(min(insert(w, PQ))) then v else  \tmin(insert(w, PQ))\ndm(insert(v, insert(w, PQ))) = if priority(v) < \tpriority(min(insert(w, PQ))) then insert(w, PQ) \telse insert(v, dm(insert(w, PQ)))\nwhere PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","source_id":"nist-dads.priorityque","source_sha256":"32105ba757774ba6e94aa5875b4f3309c371e43ed73b48214d52b2de1dbd3cec","start":59}],"target_id":"concept.nist.priorityque","target_kind":"node","target_sha256":"64dc7ff90f11da34d7b31f5764fad9941cd1f8ea5b8a509caecb58dc1f048fc5"}],"concept.nist.prisonersdilemma":[{"id":"assertion.concept.nist.prisonersdilemma","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prisoner's dilemma as: Two prisoners are questioned separately about a crime they committed. Each may give evidence against the other or may say nothing. If both say nothing, they get a minor reprimand and go free because of lack of evidence. If one gives evidence and the other says nothing, the first goes free and the second is severely punished. If both give evidence, both are severely punished. The overall (globally) best strategy is for both to say nothing. However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome. In general, a situation where local optimization leads to the worst possible outcome globally.","support":[{"end":767,"quote":"Two prisoners are questioned separately about a crime they committed.  Each may give evidence against the other or may say nothing.  If both say nothing, they get a minor reprimand and go free because of lack of evidence.  If one gives evidence and the other says nothing, the first goes free and the second is severely punished.  If both give evidence, both are severely punished.  The overall (globally) best strategy is for both to say nothing.  However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome.\nIn general, a situation where\nlocal optimization\nleads to the worst possible outcome globally.","source_id":"nist-dads.prisonersdilemma","source_sha256":"db4be664b2e56cf04fcdfdc25a5f592e482806eccad6bed75d0bb828cc3f3e25","start":68}],"target_id":"concept.nist.prisonersdilemma","target_kind":"node","target_sha256":"3ac90a6495c968f2b4c6dc940a950ef5a326b1f90c0f80636731799e6d05bb63"}],"concept.nist.probabilisticallycheckableproof":[{"id":"assertion.concept.nist.probabilisticallycheckableproof","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistically checkable proof as: An interactive proof system in which provers follow a fixed strategy, that is, one not affected by any messages from the verifier. The prover's strategy for a given instance x of a decision problem can be represented by a finite oracle language B x , which constitutes a proof of the correct answer for x.","support":[{"end":399,"quote":"An\ninteractive proof system\nin which provers follow a fixed strategy, that is, one not affected by any messages from the verifier.  The prover's strategy for a given instance x of a\ndecision problem\ncan be represented by a finite oracle language B\nx\n, which constitutes a proof of the correct answer for x.","source_id":"nist-dads.probabilisticallycheckableproof","source_sha256":"47146be5a4e006b62a438f38f940997acf07b7b3a541a6e1afee341f1941969c","start":93}],"target_id":"concept.nist.probabilisticallycheckableproof","target_kind":"node","target_sha256":"f385e7ad697601704c8115c25c09a9c1f718dfcd16b41bf8c93914ab26276bcf"}],"concept.nist.probablalgo":[{"id":"assertion.concept.nist.probablalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistic algorithm as: Any algorithm that works for all practical purposes but has a theoretical chance of being wrong.","support":[{"end":169,"quote":"Any\nalgorithm\nthat works for all practical purposes but has a theoretical chance of being wrong.","source_id":"nist-dads.probablalgo","source_sha256":"da194e5bf89401e3c58804bdb83b989990678a8ef05368d2ef6c2997d72b609b","start":73}],"target_id":"concept.nist.probablalgo","target_kind":"node","target_sha256":"7d30993a58650fb0ce5c823e998a4689ca37000806c4e4177037f17bdddc3192"}],"concept.nist.probablturng":[{"id":"assertion.concept.nist.probablturng","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probabilistic Turing machine as: A Turing machine in which some transitions are random choices among finitely many alternatives.","support":[{"end":178,"quote":"A\nTuring machine\nin which some transitions are random choices among finitely many alternatives.","source_id":"nist-dads.probablturng","source_sha256":"6bac07546f16ff443aeb49d259157df5299fcaf9cf19702bc08ced4e28a2ba6b","start":83}],"target_id":"concept.nist.probablturng","target_kind":"node","target_sha256":"451f780596120ebfe4f34f388b0b4721e8cbc38fca47a17766b82efa5d3fa1a5"}],"concept.nist.probesequenc":[{"id":"assertion.concept.nist.probesequenc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines probe sequence as: The list of locations which a method for open addressing produces as alternatives in case of a collision .","support":[{"end":161,"quote":"The list of locations which a method for\nopen addressing\nproduces as alternatives in case of a\ncollision\n.","source_id":"nist-dads.probesequenc","source_sha256":"f4740292eb436ca677a1678e6bc1dbf05284b6d2153adaa76ca301145287a427","start":55}],"target_id":"concept.nist.probesequenc","target_kind":"node","target_sha256":"bd0de7c77cd5180d819f035834255c224ef303ed33214dfe78543b4176f8a0a4"}],"concept.nist.procedure":[{"id":"assertion.concept.nist.procedure","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines procedure as: A subroutine which does not return a value.","support":[{"end":88,"quote":"A subroutine which does not return a value.","source_id":"nist-dads.procedure","source_sha256":"efd46638cd0f05856c4a4f08dffb59de87d3adf879e07c9af51197f156fb14da","start":45}],"target_id":"concept.nist.procedure","target_kind":"node","target_sha256":"c5f316a1783858445fcab47c28abe7ea670315201572d47920be1d3c93189ed6"}],"concept.nist.processalgbr":[{"id":"assertion.concept.nist.processalgbr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines process algebra as: An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS .","support":[{"end":161,"quote":"An algebraic theory to formalize the notion of concurrent computation, best exemplified in\nCSP\nand\nCCS\n.","source_id":"nist-dads.processalgbr","source_sha256":"306419616a58ff3f5130ef5c871b1f3daa41122860ddb1352c009283c13a6528","start":57}],"target_id":"concept.nist.processalgbr","target_kind":"node","target_sha256":"f2a9855afde1278d1999becc8ad27256aa1b2a49ff85a7a582060ba04997582f"}],"concept.nist.proper":[{"id":"assertion.concept.nist.proper","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper as: (1) A subunit of a unit is not equal to the unit itself. For instance, a proper substring is not the whole string , a proper subset is not the whole set , a proper subgraph is not the whole graph , etc. (2) According to a rule, as in proper coloring .","support":[{"end":292,"quote":"(1) A subunit of a unit is not equal to the unit itself.  For instance, a proper\nsubstring\nis not the whole\nstring\n, a proper\nsubset\nis not the whole\nset\n, a proper\nsubgraph\nis not the whole\ngraph\n, etc.  (2) According to a rule, as in\nproper coloring\n.","source_id":"nist-dads.proper","source_sha256":"ef8f6b7c4591892b236f26848f81b1c9ff1d5f11465d09a3ccd78a2ed1c9a8b3","start":39}],"target_id":"concept.nist.proper","target_kind":"node","target_sha256":"163f9b6e255ff0318c77886481ee8083e1387aed594bdfd7eeab38e27c21b8f7"}],"concept.nist.propercolor":[{"id":"assertion.concept.nist.propercolor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper coloring as: A vertex coloring or edge coloring of a graph in which no two adjacent vertices or edges have the same color.","support":[{"end":166,"quote":"A\nvertex coloring\nor\nedge coloring\nof a graph in which no two\nadjacent\nvertices\nor\nedges\nhave the same color.","source_id":"nist-dads.propercolor","source_sha256":"037546304242a2789d3135c1e9c7c6e5942b14c9874875c0ab319f17a033f1c1","start":57}],"target_id":"concept.nist.propercolor","target_kind":"node","target_sha256":"874e36d360f15774e2eba2983f392d24e46e202f11e4cbaa7cc4b744a4d16683"}],"concept.nist.propersubset":[{"id":"assertion.concept.nist.propersubset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines proper subset as: A set S 2 is a proper subset of another set S 1 if every element in S 2 is in S 1 and S 1 has some elements which are not in S 2 .","support":[{"end":183,"quote":"A\nset\nS\n2\nis a proper subset of another set S\n1\nif every element in S\n2\nis in S\n1\nand S\n1\nhas some elements which are not in S\n2\n.","source_id":"nist-dads.propersubset","source_sha256":"dbfaacf3605b1ad2c0245ea2b1a4d9396458f2ea805502927fb361f26ff8bd3b","start":53}],"target_id":"concept.nist.propersubset","target_kind":"node","target_sha256":"cadd8007071d9d6a3673569726f45f0e8b3b98f5a3c61dda478ed4c87d51b2eb"}],"concept.nist.ptree":[{"id":"assertion.concept.nist.ptree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines P-tree as: (1) A spatial access method that defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel. Space is split by hierarchically nested polytopes (multidimensional boxes with nonrectangular sides). The R-tree is a special case that has no additional hyperplanes. (2) A spatial access method that splits space by hierarchically nested polytopes. The R-tree is a special case in which all polytopes are boxes.","support":[{"end":488,"quote":"(1) A\nspatial access method\nthat defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel.  Space is split by hierarchically nested\npolytopes\n(multidimensional boxes with nonrectangular sides).  The\nR-tree\nis a special case that has no additional hyperplanes. (2) A\nspatial access method\nthat splits space by hierarchically nested polytopes. The\nR-tree\nis a special case in which all polytopes are boxes.","source_id":"nist-dads.ptree","source_sha256":"8c88ab2f5d707d00c395c63edf12d976b71b92cc04d187dc4645826a60621436","start":43}],"target_id":"concept.nist.ptree","target_kind":"node","target_sha256":"b6198ba9cc165b4e3b7a47161c8694fd97584c0b0af21ce03e75853587cf55d9"}],"concept.nist.purelyfnctnl":[{"id":"assertion.concept.nist.purelyfnctnl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines purely functional language as: A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","support":[{"end":350,"quote":"A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","source_id":"nist-dads.purelyfnctnl","source_sha256":"d8ce4f6d6aae379c9d5917badb11b68467d6360f058bcbc7de943b79bfd156bc","start":79}],"target_id":"concept.nist.purelyfnctnl","target_kind":"node","target_sha256":"e21396b73c4cc783e6a67e812cd3a62b93757b0752c3870d81507c7e14b0de3c"}],"concept.nist.pushdownautm":[{"id":"assertion.concept.nist.pushdownautm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pushdown automaton as: A restricted Turing machine where the tape acts as a pushdown store (or stack , where only the latest element can be read), with an extra one-way read-only input tape. Also known as PDA.","support":[{"end":249,"quote":"A restricted\nTuring machine\nwhere the tape acts as a pushdown store (or\nstack\n, where only the latest element can be read), with an extra one-way read-only input tape.\nAlso known as\nPDA.","source_id":"nist-dads.pushdownautm","source_sha256":"26061d8fc2755aa3a3700f0298e80bcc2eb1f0e0caa6a77c9aa2343d84056f65","start":63}],"target_id":"concept.nist.pushdownautm","target_kind":"node","target_sha256":"19aff45822d54ec5dd63f22fc94970aad8808feedea9ec05f0fb61bd78c94fde"}],"concept.nist.quadtrie":[{"id":"assertion.concept.nist.quadtrie","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quad trie as: A tree in which each node is split according to some subset of the key , typically a character.","support":[{"end":144,"quote":"A\ntree\nin which each\nnode\nis split according to some subset of the\nkey\n, typically a character.","source_id":"nist-dads.quadtrie","source_sha256":"909279489e3e681c44f0a31445499923398d2610ca646ad6d8228aa7be891911","start":49}],"target_id":"concept.nist.quadtrie","target_kind":"node","target_sha256":"3493d9408dafb6e92c7fe48071d2217930c1de6a99ae15f5dde505a5fc057544"}],"concept.nist.quantumcomputation":[{"id":"assertion.concept.nist.quantumcomputation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quantum computation as: Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","support":[{"end":201,"quote":"Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","source_id":"nist-dads.quantumcomputation","source_sha256":"0cea7d93bc76fcf6c1a94d1c0ac443c15478924ad76cd67b77ca8efdfeab445a","start":65}],"target_id":"concept.nist.quantumcomputation","target_kind":"node","target_sha256":"b2bd8ce292fc5dfe8d8d695292533236e16c1f313a1d9571fbbcc206bd83b60f"}],"concept.nist.queue":[{"id":"assertion.concept.nist.queue","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines queue as: A collection of items in which only the earliest added item may be accessed. Basic operations are add (to the tail ) or enqueue and delete (from the head ) or dequeue. Delete returns the item removed. Also known as \"first-in, first-out\" or FIFO. Formal Definition: It is convenient to define delete or dequeue in terms of remove and a new operation, front. The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with axiomatic semantics as follows. new() returns a queue front(add(v, new())) = v remove(add(v, new())) = new() front(add(v, add(w, Q))) = front(add(w, Q)) remove(add(v, add(w, Q))) = add(v, remove(add(w, Q))) where Q is a queue and v and w are values. Also known as FIFO.","support":[{"end":749,"quote":"A collection of items in which only the earliest added item may be accessed.  Basic operations are add (to the\ntail\n) or enqueue and delete (from the\nhead\n) or dequeue.  Delete returns the item removed.  Also known as \"first-in, first-out\" or FIFO.\nFormal Definition:\nIt is convenient to define delete or dequeue in terms of remove and a new operation, front.   The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a queue\nfront(add(v, new())) = v\nremove(add(v, new())) = new()\nfront(add(v, add(w, Q))) = front(add(w, Q))\nremove(add(v, add(w, Q))) = add(v, remove(add(w, Q)))\nwhere Q is a queue and v and w are values.\nAlso known as\nFIFO.","source_id":"nist-dads.queue","source_sha256":"c4ff1a7da89f0695f7ed8662c7f96c7a99b7e2243007f26975a75cc80f608967","start":41}],"target_id":"concept.nist.queue","target_kind":"node","target_sha256":"d33ee304dccb53a8688acc1f9abff2df1c81193d60b3be5f64005d6aaa94246e"}],"concept.nist.raggedmatrix":[{"id":"assertion.concept.nist.raggedmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ragged matrix as: A matrix having irregular numbers of items in each row.","support":[{"end":112,"quote":"A\nmatrix\nhaving irregular numbers of items in each row.","source_id":"nist-dads.raggedmatrix","source_sha256":"c378a72523e25ebd276e2899c37267ca624c695e9e28ca7621b8928e62403a68","start":57}],"target_id":"concept.nist.raggedmatrix","target_kind":"node","target_sha256":"4e45859ec00caabcb8f73765211cd10991ff1bfb54904358bf0ad9f1d01a2d36"}],"concept.nist.randomaccess":[{"id":"assertion.concept.nist.randomaccess","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random access machine as: A model of computation whose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","support":[{"end":281,"quote":"A\nmodel of computation\nwhose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","source_id":"nist-dads.randomaccess","source_sha256":"299ed7dc0709ede682fb8232688b97ce58b56690d714d8c4447b6a13bd8a5a5d","start":69}],"target_id":"concept.nist.randomaccess","target_kind":"node","target_sha256":"667fa695a4a31091ea448b0d46315a766715dae85002d236334378465c868c6e"}],"concept.nist.randomizedalgo":[{"id":"assertion.concept.nist.randomizedalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized algorithm as: An algorithm that makes random (or pseudorandom) choices.","support":[{"end":124,"quote":"An\nalgorithm\nthat makes random (or pseudorandom) choices.","source_id":"nist-dads.randomizedalgo","source_sha256":"11c645eb3713fb700639f0be7992b50d6ea98f16915ac2c4a82dbacd70680dcd","start":67}],"target_id":"concept.nist.randomizedalgo","target_kind":"node","target_sha256":"a4c6c8cffb55a60e40adcc55902f85a1ac27dad614e39993fc73cee840ad6d5a"}],"concept.nist.randomizedbinarysearchtree":[{"id":"assertion.concept.nist.randomizedbinarysearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized binary search tree as: A binary search tree in which nodes have a randomly assigned priority. Updates keep priorities in heap order instead of keeping balance information and doing rebalance operations. Also known as cartesian tree, RBST.","support":[{"end":305,"quote":"A\nbinary search tree\nin which\nnodes\nhave a randomly assigned priority.  Updates keep priorities in\nheap\norder instead of keeping\nbalance\ninformation and doing\nrebalance\noperations.\nAlso known as\ncartesian tree, RBST.","source_id":"nist-dads.randomizedbinarysearchtree","source_sha256":"cf5a29c36329a29705a3fe39ccb954adac44ef2722e7dcda1754444b5c7e48e9","start":89}],"target_id":"concept.nist.randomizedbinarysearchtree","target_kind":"node","target_sha256":"601c1f9a74feb7264b315b4c9c5c4dd203c23a2d7dfa34339f5085d1afda1821"}],"concept.nist.randomizedcomplexity":[{"id":"assertion.concept.nist.randomizedcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized complexity as: The expected running time of the best possible randomized algorithm over the worst input.","support":[{"end":158,"quote":"The expected running time of the best possible\nrandomized algorithm\nover the worst input.","source_id":"nist-dads.randomizedcomplexity","source_sha256":"b430e9d69d4e55d3238b668325d13407e6091fd262c992be2ed9824c79e3fd81","start":69}],"target_id":"concept.nist.randomizedcomplexity","target_kind":"node","target_sha256":"597371392d8f5fa1af0a8b7ad9aeb9c0417a718a994fb15e638517d2c94fe206"}],"concept.nist.range":[{"id":"assertion.concept.nist.range","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines range as: The possible results of a function or relation . For instance, the range of cosine is [-1,+1].","support":[{"end":132,"quote":"The possible results of a\nfunction\nor\nrelation\n.  For instance, the range of cosine is [-1,+1].","source_id":"nist-dads.range","source_sha256":"6b91baf644a9a135100ab7024bb48531644b5c43e8a46d233a098c1c622a1278","start":37}],"target_id":"concept.nist.range","target_kind":"node","target_sha256":"4684d7b43db14e6c6833460b908ad34879a5fef78653256e617428ea95e7e431"}],"concept.nist.rank":[{"id":"assertion.concept.nist.rank","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rank as: For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","support":[{"end":142,"quote":"For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","source_id":"nist-dads.rank","source_sha256":"a29a967d5972b1a7611f6c6d9f90c2ac24f27c63ea3e008c1d1c71d2a3c46368","start":35}],"target_id":"concept.nist.rank","target_kind":"node","target_sha256":"bf31c4f30c539d1899b6b3777bbd73aece7b4bc9ee61cc182e4ce7923e868960"}],"concept.nist.reachable":[{"id":"assertion.concept.nist.reachable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reachable as: A vertex v is reachable from another vertex u if there is a path of any length from u to v. Also known as reachability.","support":[{"end":164,"quote":"A\nvertex\nv is reachable from another vertex u if there is a\npath\nof any length from u to v.\nAlso known as\nreachability.","source_id":"nist-dads.reachable","source_sha256":"8f71d5fd22d20adc260bfe73baa296c9578024e65f59686956141be43a8da2a4","start":45}],"target_id":"concept.nist.reachable","target_kind":"node","target_sha256":"d606a285d7a904825a1e49c7480a8ac72b9ece50d55b8945f94812483ab85ac1"}],"concept.nist.recognizer":[{"id":"assertion.concept.nist.recognizer","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recognizer as: A finite state machine with one or more states designated as accepting states . An input string is accepted if there is a path from the start state to an accepting state.","support":[{"end":218,"quote":"A\nfinite state machine\nwith one or more\nstates\ndesignated as\naccepting states\n.  An input string is\naccepted\nif there is a\npath\nfrom the\nstart state\nto an accepting state.","source_id":"nist-dads.recognizer","source_sha256":"830ce0720f5c2885f764fb4204808cb171d8d80357e954ba1d2582a77857523a","start":47}],"target_id":"concept.nist.recognizer","target_kind":"node","target_sha256":"55bde2eb8a8d7f202256541539dedf8af0fcd58306ec3f4f0048eb872c89fd09"}],"concept.nist.rectangmatrx":[{"id":"assertion.concept.nist.rectangmatrx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectangular matrix as: An n × m matrix , or, one whose size may not be the same in both dimensions.","support":[{"end":143,"quote":"An n × m\nmatrix\n, or, one whose size may not be the same in both dimensions.","source_id":"nist-dads.rectangmatrx","source_sha256":"e44e6b2b67492f4e319f20d6cdddeae73667f4d03dca0f03a464031ec4b1198e","start":67}],"target_id":"concept.nist.rectangmatrx","target_kind":"node","target_sha256":"e9a23fbe7522df0f5d5d1488c497ceb2d8be86aa9c1d56814a6b2d853627297a"}],"concept.nist.rectilinear":[{"id":"assertion.concept.nist.rectilinear","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectilinear as: Distance, paths, lines, etc. which are always parallel to axes at right angles. For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","support":[{"end":218,"quote":"Distance, paths, lines, etc. which are always parallel to axes at right angles.  For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","source_id":"nist-dads.rectilinear","source_sha256":"433f899586a7d269634c72fb5dff26958db284060180662c53d5cbde91a4a0af","start":49}],"target_id":"concept.nist.rectilinear","target_kind":"node","target_sha256":"a2249eedc16db122a5c308885267ed54f1800f25c8a2df1d13b9e305ed2b5ee3"}],"concept.nist.rectilinearsteinertree":[{"id":"assertion.concept.nist.rectilinearsteinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rectilinear Steiner tree as: A minimum-length rectilinear tree connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","support":[{"end":259,"quote":"A minimum-length\nrectilinear\ntree connecting a set of points, called\nterminals\n, in the plane.  This tree may include points other than the terminals, which are called\nSteiner points\n.","source_id":"nist-dads.rectilinearsteinertree","source_sha256":"8c8b465ab0590f42ddf9746c5f5ab4163bb0f6d2e68ef3cf8621cf1bb2460b2c","start":75}],"target_id":"concept.nist.rectilinearsteinertree","target_kind":"node","target_sha256":"918521c1f4ee0597aea9eb4f890cfece69bb5f969af7a16f8657060d76d0c586"}],"concept.nist.recurrence":[{"id":"assertion.concept.nist.recurrence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recurrence relation as: The specification of a sequence of values in terms of earlier values in the sequence and base values. Also known as recurrence equations.","support":[{"end":202,"quote":"The specification of a sequence of values in terms of earlier values in the sequence and base values.\nAlso known as\nrecurrence equations.","source_id":"nist-dads.recurrence","source_sha256":"99c86473df9b6a6a12f20ad586f12f24e0be0d7e1b0b1bbd7cf92fa81070f856","start":65}],"target_id":"concept.nist.recurrence","target_kind":"node","target_sha256":"5d52e24abd56ca2c3af2655baa1059577cf1f3f7d272b5b9b13c0266dd1b3968"}],"concept.nist.recursiontree":[{"id":"assertion.concept.nist.recursiontree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursion tree as: A method to analyze the complexity of an algorithm by diagramming the recursive function calls. Formal Definition: A recursion tree T(p) of degree p is either (i) null or (ii) has p children which are recursion trees.","support":[{"end":272,"quote":"A method to analyze the\ncomplexity\nof an\nalgorithm\nby diagramming the\nrecursive\nfunction calls.\nFormal Definition:\nA recursion tree T(p) of degree p is either (i)\nnull\nor (ii) has p\nchildren\nwhich are recursion trees.","source_id":"nist-dads.recursiontree","source_sha256":"925a91b0e84e742f4339a3b32337b392e33c44e7041421eb334da6f0457514bc","start":55}],"target_id":"concept.nist.recursiontree","target_kind":"node","target_sha256":"b5e9a91c14c74db33f45fc6e326799f251ee0f01ba201d374009c21cb1fc484c"}],"concept.nist.recursiontrm":[{"id":"assertion.concept.nist.recursiontrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursion termination as: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.","support":[{"end":179,"quote":"The point when conditions are met and a\nrecursive\nalgorithm ceases calling itself and begins to return values.","source_id":"nist-dads.recursiontrm","source_sha256":"986c4af38a1a754fcacca9266783ec435185e28298c168d289572b0465ce423c","start":69}],"target_id":"concept.nist.recursiontrm","target_kind":"node","target_sha256":"3f70a3ff57dd0d294d9a1c3d4650de518cc999aaa8a7c39bb658af076a0f49cc"}],"concept.nist.recursive":[{"id":"assertion.concept.nist.recursive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursive as: (1) A data structure that is partially composed of other instances of the data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements. (2) An algorithm in which functions might call themselves. For instance, quicksort or heapify .","support":[{"end":363,"quote":"(1) A data structure that is partially composed of other instances of the data structure.  For instance, a\ntree\nis composed of smaller trees (\nsubtrees\n) and\nleaf\nnodes\n, and a\nlist\nmay  have other lists as elements.  (2) An\nalgorithm\nin which functions might call themselves.  For instance,\nquicksort\nor\nheapify\n.","source_id":"nist-dads.recursive","source_sha256":"76c9ad8661aecb1338e32b8ab23d9033a980b828a95689e85401885f6abd3dc4","start":49}],"target_id":"concept.nist.recursive","target_kind":"node","target_sha256":"cd30dfc0b697e5bac0d51c0d98e3a0798bcd9c8f90533ecd931fb7434c3262ec"}],"concept.nist.recursivelyenumerablelang":[{"id":"assertion.concept.nist.recursivelyenumerablelang","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursively enumerable language as: A language accepted by a Turing machine .","support":[{"end":130,"quote":"A\nlanguage\naccepted by a\nTuring machine\n.","source_id":"nist-dads.recursivelyenumerablelang","source_sha256":"386138f985b4489033ec603e6ffd501521199cf473b33ee62524eed1c97e178a","start":89}],"target_id":"concept.nist.recursivelyenumerablelang","target_kind":"node","target_sha256":"d86cb4eaa04699ba28869906299a582215a24c72b793d9fae0a4a9b193645797"}],"concept.nist.recursivstrc":[{"id":"assertion.concept.nist.recursivstrc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines recursive data structure as: A data structure that is partially composed of smaller or simpler instances of the same data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements.","support":[{"end":304,"quote":"A\ndata structure\nthat is partially composed of smaller or simpler instances of the same data structure.  For instance, a\ntree\nis composed of smaller trees (\nsubtrees\n) and\nleaf\nnodes\n, and a\nlist\nmay have other lists as elements.","source_id":"nist-dads.recursivstrc","source_sha256":"45212c7e35167642ea559954f09e42aa558885063f954d0e45278c7b6b6854d5","start":75}],"target_id":"concept.nist.recursivstrc","target_kind":"node","target_sha256":"52097c303b6a987627183d81b12478290fe5d352c1050cf4116b25f3c4729a1c"}],"concept.nist.redblack":[{"id":"assertion.concept.nist.redblack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines red-black tree as: A nearly-balanced tree that uses an extra bit per node to maintain balance. No leaf is more than twice as far from the root as any other. Formal Definition: A red-black tree with n internal nodes has height at most 2log 2 (n+1). Also known as symmetric binary B-tree.","support":[{"end":327,"quote":"A nearly-balanced\ntree\nthat uses an extra bit per\nnode\nto maintain balance.  No\nleaf\nis more than twice as far from the\nroot\nas any other.\nFormal Definition:\nA red-black tree with n internal nodes has\nheight\nat most 2log\n2\n(n+1).\nAlso known as\nsymmetric binary B-tree.","source_id":"nist-dads.redblack","source_sha256":"36e40a62493ff1322fcabc1792be92210904dfe3b3faf9728f8f525557cc0cf0","start":59}],"target_id":"concept.nist.redblack","target_kind":"node","target_sha256":"48447e0258618b4a8521d6507e8c1259ae4b1e941b3bfdb6a78a10b5b67ac92f"}],"concept.nist.reducedbasis":[{"id":"assertion.concept.nist.reducedbasis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reduced basis as: A basis for a lattice that is nearly orthogonal.","support":[{"end":101,"quote":"A basis for a\nlattice\nthat is nearly orthogonal.","source_id":"nist-dads.reducedbasis","source_sha256":"bc14a84e41e71b5004e5821ff1e3906516cfd26b8d3790f6a8f8af66f820f576","start":53}],"target_id":"concept.nist.reducedbasis","target_kind":"node","target_sha256":"97b41e19e71d8ec6f19efd400a31a881b030dbf9f12227bca496ee34461995b5"}],"concept.nist.reduction":[{"id":"assertion.concept.nist.reduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reduction as: A computable transformation of one problem into another.","support":[{"end":101,"quote":"A\ncomputable\ntransformation of one problem into another.","source_id":"nist-dads.reduction","source_sha256":"8dcfc31135321f140c57ca99e021db990e594c440cb906c4a2873a38181172e0","start":45}],"target_id":"concept.nist.reduction","target_kind":"node","target_sha256":"7c8ca8734b823278bca663231a0d1f4dc599dc05b9484febfa7d4129e2c2b8c5"}],"concept.nist.reflexive":[{"id":"assertion.concept.nist.reflexive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reflexive as: A binary relation R for which a R a for all a.","support":[{"end":91,"quote":"A\nbinary relation\nR for which a R a for all a.","source_id":"nist-dads.reflexive","source_sha256":"b8e49f3c942f55be8a2f1d069b0e4ac7b54382949f4decd215224ed3622b789c","start":45}],"target_id":"concept.nist.reflexive","target_kind":"node","target_sha256":"4d242fd719c5e2388a197bba85cf2cc31e39975152dc2eb5f0491ff306fe0fec"}],"concept.nist.regular":[{"id":"assertion.concept.nist.regular","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines regular decomposition as: A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","support":[{"end":244,"quote":"A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","source_id":"nist-dads.regular","source_sha256":"d482dcdaf862622e2ec6019e44c19c8dcdfc2540637cddd91d69bf156675ed0e","start":69}],"target_id":"concept.nist.regular","target_kind":"node","target_sha256":"2aa12528bc044dba9ffdbe7c9ca6f2fd7e25338b1ec6b2e81b9ae6b26b5cbe0c"}],"concept.nist.relation":[{"id":"assertion.concept.nist.relation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relation as: A computation which takes some inputs and yields an output. Any particular input may yield different outputs at different times. Formally, a mapping from each element in the domain to one or more elements in the range .","support":[{"end":263,"quote":"A computation which takes some inputs and yields an output.  Any particular input may yield different outputs at different times. Formally, a mapping from each element in the\ndomain\nto one or more elements in the\nrange\n.","source_id":"nist-dads.relation","source_sha256":"fb9076fca055b7101e7054e1028fd5adc7f7cb3a8baf7ecd122bf706e1fa321e","start":43}],"target_id":"concept.nist.relation","target_kind":"node","target_sha256":"a7ad7bb3c06c9485d162d0f2b4fd5aa657003ddebe97579efdfdaca051e5bb22"}],"concept.nist.relational":[{"id":"assertion.concept.nist.relational","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relational structure as: The counterpart in formal logic of a data structure or class instance in the object-oriented sense. Examples are strings , directed graphs , and undirected graphs . Sets of relational structures generalize the notion of languages as sets of strings.","support":[{"end":322,"quote":"The counterpart in formal logic of a data structure or class instance in the object-oriented sense.  Examples are\nstrings\n,\ndirected graphs\n, and\nundirected graphs\n.  Sets of relational structures generalize the notion of\nlanguages\nas\nsets\nof strings.","source_id":"nist-dads.relational","source_sha256":"16d0fcfabfa3df28d5142ba8eefffa1796bd79fc6c86a1aa5f7d9fefe515d1f0","start":71}],"target_id":"concept.nist.relational","target_kind":"node","target_sha256":"cf16fe5c3f449432f85840b276233a190d8d7f12d7337987c1b5cdc5d57b0b6f"}],"concept.nist.relativeperformguar":[{"id":"assertion.concept.nist.relativeperformguar","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relative performance guarantee as: The maximum ratio by which the result of a ρ-approximation algorithm may depart from the optimal solution . Also known as performance ratio.","support":[{"end":227,"quote":"The maximum ratio by which the result of a\nρ-approximation algorithm\nmay depart from the\noptimal solution\n.\nAlso known as\nperformance ratio.","source_id":"nist-dads.relativeperformguar","source_sha256":"2029a854a9e47fae694a9303649bce94123bcd7ff97457913bc749087ce75873","start":87}],"target_id":"concept.nist.relativeperformguar","target_kind":"node","target_sha256":"6f51dd801931399d99fa9b7ff0dc5ad19d8653f8fb202d5714f1014ba43d56d0"}],"concept.nist.relaxation":[{"id":"assertion.concept.nist.relaxation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relaxation as: An optimization problem with an enlarged feasible region (and extended objective function ) compared with an original optimization problem. Typically, the relaxation is considerably easier to solve than the original.","support":[{"end":264,"quote":"An\noptimization problem\nwith an enlarged\nfeasible region\n(and extended\nobjective function\n) compared with an original optimization problem.  Typically, the relaxation is considerably easier to solve than the original.","source_id":"nist-dads.relaxation","source_sha256":"eaf877f30c8827b4557060bc0d65815a7533f100cfa5853cb2df13e3e194ba06","start":47}],"target_id":"concept.nist.relaxation","target_kind":"node","target_sha256":"ddba2f287da9117ac2e10cf04659bf66c587b65ac4eff02221042ddae7b10c49"}],"concept.nist.relaxedbalance":[{"id":"assertion.concept.nist.relaxedbalance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines relaxed balance as: When rebalancing a search tree is independent of updating the tree.","support":[{"end":124,"quote":"When\nrebalancing\na\nsearch tree\nis independent of updating the tree.","source_id":"nist-dads.relaxedbalance","source_sha256":"3f310ac6d7d3720bc6915e96ae5ab9e7eadb2026e414e60afd717f9795742660","start":57}],"target_id":"concept.nist.relaxedbalance","target_kind":"node","target_sha256":"3cf96513d3c0883fea03fd8b22cac937ae519271bc14340669244fdd00380531"}],"concept.nist.rescalable":[{"id":"assertion.concept.nist.rescalable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rescalable as: An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the objective function for the second instance is (element-wise) λ times the objective function of the first instance. For such problems, the best one can hope for is a relative performance guarantee , not an absolute performance guarantee .","support":[{"end":440,"quote":"An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the\nobjective function\nfor the second instance is (element-wise) λ times the objective function of the first instance.  For such problems, the best one can hope for is a\nrelative performance guarantee\n, not an\nabsolute performance guarantee\n.","source_id":"nist-dads.rescalable","source_sha256":"47817ff7e9799a87b7347525bf5c41dfe6d5c46e958c7a5946e7d17657e77d16","start":47}],"target_id":"concept.nist.rescalable","target_kind":"node","target_sha256":"ac57bba6382fe7690aa68f976728505d6fd4349b511c30ce6e563c48e81189c8"}],"concept.nist.restricted":[{"id":"assertion.concept.nist.restricted","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines restricted universe sort as: A sort algorithm that operates on the basis that the keys are members of a restricted set of values. They may not require comparisons of keys to perform the sorting.","support":[{"end":241,"quote":"A\nsort\nalgorithm that operates on the basis that the\nkeys\nare members of a restricted set of values.  They may not require comparisons of keys to perform the sorting.","source_id":"nist-dads.restricted","source_sha256":"7196892288b8aa163758c6e81086c07f85447cd0050e1044f63a1fddebb0295f","start":75}],"target_id":"concept.nist.restricted","target_kind":"node","target_sha256":"ddf945516510feca8afff6c6baa5f2dcb8a0c03389d1974b6db89a890ce88225"}],"concept.nist.rfile":[{"id":"assertion.concept.nist.rfile","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines R-file as: A spatial access method which divides space into a hierarchically of nested boxes. Objects are indexed in the lowest cell which completely contains them.","support":[{"end":197,"quote":"A\nspatial access method\nwhich divides space into a hierarchically of nested boxes.  Objects are indexed in the lowest cell which completely contains them.","source_id":"nist-dads.rfile","source_sha256":"8a682d10c6cf6e6e02672076df3763ba1b96bde6c465ca80cccdb3f151b7cf8e","start":43}],"target_id":"concept.nist.rfile","target_kind":"node","target_sha256":"1b22db05d3272c118be0acd27d618b006a318a36024b2321de1cad40cad41ec7"}],"concept.nist.ricesmethod":[{"id":"assertion.concept.nist.ricesmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Rice's method as: A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","support":[{"end":164,"quote":"A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","source_id":"nist-dads.ricesmethod","source_sha256":"fb0e1307e876ddc8706cecff149dff8581cb6db2458049fefcde053cd17d8658","start":53}],"target_id":"concept.nist.ricesmethod","target_kind":"node","target_sha256":"5a3e63b6ec7215d1b4151cd5bda4977834d697fbfe568885cc3fafb1d32e9df6"}],"concept.nist.rightthreadedtree":[{"id":"assertion.concept.nist.rightthreadedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines right-threaded tree as: A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.","support":[{"end":185,"quote":"A variant of a\nthreaded tree\nin which only the right thread, i.e.\nlink\nto the successor, of each\nnode\nis maintained.","source_id":"nist-dads.rightthreadedtree","source_sha256":"7a2bfa8fa6d382203ca61ef5e3e311956a4045b96d32ee4fff780fb5c26ddbea","start":69}],"target_id":"concept.nist.rightthreadedtree","target_kind":"node","target_sha256":"a958d8097117f79e4ed760cc7768a039df5576aaf5b49f88af6c5779b5000d2b"}],"concept.nist.root":[{"id":"assertion.concept.nist.root","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines root as: The distinguished initial or fundamental item of a tree . The only item which has no parent . See the figure at tree .","support":[{"end":153,"quote":"The distinguished initial or fundamental item of a\ntree\n. The only item which has no\nparent\n. See the figure at\ntree\n.","source_id":"nist-dads.root","source_sha256":"a84705ca8087450fb735197553f6aef29e069858984bd587e808e1769e60d488","start":35}],"target_id":"concept.nist.root","target_kind":"node","target_sha256":"71b5906ebef4ddba274d87ad6a0a04d3fe658e56eef3e59b0aa853b519c04df7"}],"concept.nist.rootedtree":[{"id":"assertion.concept.nist.rootedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rooted tree as: A tree in which one node is designated as the root . Also known as oriented tree.","support":[{"end":130,"quote":"A\ntree\nin which one\nnode\nis designated as the\nroot\n.\nAlso known as\noriented tree.","source_id":"nist-dads.rootedtree","source_sha256":"a713f12102614a67d04817b631487a91d46ece84758b833c2f285bad3b40ab06","start":49}],"target_id":"concept.nist.rootedtree","target_kind":"node","target_sha256":"a956d47bc57494212a3d5e826e0ac2aa144637a9cc3c90ba5ebbbce8eaf8bbd5"}],"concept.nist.rotation":[{"id":"assertion.concept.nist.rotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rotation as: To switch children and parents among two or three adjacent nodes to restore balance to a tree .","support":[{"end":138,"quote":"To switch\nchildren\nand\nparents\namong two or three adjacent\nnodes\nto restore\nbalance\nto a\ntree\n.","source_id":"nist-dads.rotation","source_sha256":"9159b7850298a8521811e9b9e8ef02c50d339d96e91f26b6d943cf15ee880995","start":43}],"target_id":"concept.nist.rotation","target_kind":"node","target_sha256":"5df4fdeb3ed36f2857b920c76884d5334ac481d39f84227ded789f248849d910"}],"concept.nist.rp":[{"id":"assertion.concept.nist.rp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines RP as: The class of languages for which membership can be determined in polynomial time by a probabilistic Turing machine with no false acceptances and less than half false rejections. \"RP\" means \" R andomized P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that accepts or rejects any string in polynomial time . If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2. Also known as randomized polynomial time.","support":[{"end":517,"quote":"The class of\nlanguages\nfor which membership can be determined in\npolynomial time\nby a\nprobabilistic Turing machine\nwith no false acceptances and less than half false rejections.  \"RP\" means \"\nR\nandomized\nP\nolynomial\" time.\nFormal Definition:\nFor a language, S, there exists a\nprobabilistic Turing machine\n, M, that\naccepts\nor rejects any string in\npolynomial time\n.  If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2.\nAlso known as\nrandomized polynomial time.","source_id":"nist-dads.rp","source_sha256":"f721c38b148967aabda43c1ed9389a8e0383d2424f9e776481fb8532c45a84e5","start":31}],"target_id":"concept.nist.rp","target_kind":"node","target_sha256":"33d8e2794a02c1a1564a1faef70bffdf59c9d68e9751929b529cc8040aa52ead"}],"concept.nist.rtree":[{"id":"assertion.concept.nist.rtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines R-tree as: (1) A spatial access method that splits space with hierarchically nested, and possibly overlapping, boxes. The tree is height-balanced. (2) A recursion tree .","support":[{"end":202,"quote":"(1) A\nspatial access method\nthat splits space with hierarchically nested, and possibly overlapping, boxes.  The tree is height-balanced. (2) A\nrecursion tree\n.","source_id":"nist-dads.rtree","source_sha256":"7c356c0cf7461ff71672460ee2621c5f6c9294241f465711117ab608a87891b2","start":43}],"target_id":"concept.nist.rtree","target_kind":"node","target_sha256":"3fb20cdd2267e61414231fcf499e6ca574bb46812b149f9f35adeb1b61421a9a"}],"concept.nist.runtime":[{"id":"assertion.concept.nist.runtime","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines run time as: (1) The amount of time needed to execute an algorithm . (2) The time when a compiled program is executing, versus compile time.","support":[{"end":170,"quote":"(1) The amount of time needed to execute an\nalgorithm\n. (2) The time when a compiled program is executing, versus compile time.","source_id":"nist-dads.runtime","source_sha256":"bc2127bd0d9d87d7cb06109bbabc9527685b19c70577d9c9f1bf45da56cfa4b9","start":43}],"target_id":"concept.nist.runtime","target_kind":"node","target_sha256":"8282982cea5bbb76cb56a5b3f5a2de4d5778529f282f7db9a7ff9a6339a385c7"}],"concept.nist.saturatededge":[{"id":"assertion.concept.nist.saturatededge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines saturated edge as: An edge in a flow network which has the maximum possible flow.","support":[{"end":117,"quote":"An\nedge\nin a\nflow network\nwhich has the maximum possible flow.","source_id":"nist-dads.saturatededge","source_sha256":"35a1286f06514dd754d14143487542fda0bd410a766fc82672993a3b2b2e28d8","start":55}],"target_id":"concept.nist.saturatededge","target_kind":"node","target_sha256":"62ca34c9bfb0ac2b02d5b36319f68391f7c434f464ca1b993f3f2f3fc2df36c6"}],"concept.nist.sbbtree":[{"id":"assertion.concept.nist.sbbtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines SBB tree as: A symmetric binary B-tree. Now known as a red-black tree .","support":[{"end":106,"quote":"A symmetric binary B-tree.  Now known as a\nred-black tree\n.","source_id":"nist-dads.sbbtree","source_sha256":"020f5df94f5e27a2b03775c47c5963dc92321c541e06bb627526f1e1e592f935","start":47}],"target_id":"concept.nist.sbbtree","target_kind":"node","target_sha256":"1aaa65b74adcb5f328b0c8102389e796f30ed16d5ecfe541c1003b149071c909"}],"concept.nist.searchtree":[{"id":"assertion.concept.nist.searchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines search tree as: A tree where every subtree of a node has keys less than any other subtree of the node to its right. The keys in a node are conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","support":[{"end":309,"quote":"A\ntree\nwhere every\nsubtree\nof a\nnode\nhas\nkeys\nless than any other subtree of the node to its right.  The keys in a\nnode\nare conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","source_id":"nist-dads.searchtree","source_sha256":"9d64e84433f575fc36700b4e1ffbc5b42ef54dd08c09a4228f76e533e9f9a1ec","start":53}],"target_id":"concept.nist.searchtree","target_kind":"node","target_sha256":"414c0e8ae1991d095627e28e835a8f8ea64be81b25c1870adf425340990c50d1"}],"concept.nist.searchtrprop":[{"id":"assertion.concept.nist.searchtrprop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines search tree property as: When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child.","support":[{"end":185,"quote":"When the key of every\nnode\nof a\nbinary tree\nis larger than the key of its left\nchild\nand smaller than its right child.","source_id":"nist-dads.searchtrprop","source_sha256":"3a74eb3d03c5292186abbe63ced6553b05cffcc014b32a29221d53b91ee6a900","start":67}],"target_id":"concept.nist.searchtrprop","target_kind":"node","target_sha256":"3b824410f5872678ef48eb379d452389d01fdee9af94506c612dc32fcb902c7e"}],"concept.nist.secondaryclustering":[{"id":"assertion.concept.nist.secondaryclustering","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines secondary clustering as: The tendency for some collision resolution schemes to create long run of filled slots away from a key hash position, e.g., along the probe sequence .","support":[{"end":216,"quote":"The tendency for some\ncollision resolution schemes\nto create long run of filled slots away from a\nkey\nhash\nposition, e.g., along the\nprobe sequence\n.","source_id":"nist-dads.secondaryclustering","source_sha256":"6b17786c58066fd11d05e8f333eaccd2a693ab597edcbfa5ac65d97f610e009e","start":67}],"target_id":"concept.nist.secondaryclustering","target_kind":"node","target_sha256":"22ea1def30f14030867d7ff8ac7fbab3642529567ef61ffb96a92f018890bb7f"}],"concept.nist.segment":[{"id":"assertion.concept.nist.segment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines segment as: (1) The substring of a pattern delimited by two don't cares or one don't care and beginning or end of the pattern. (2) A substring .","support":[{"end":174,"quote":"(1) The\nsubstring\nof a\npattern\ndelimited by two\ndon't cares\nor one don't care and beginning or end of the pattern.  (2) A\nsubstring\n.","source_id":"nist-dads.segment","source_sha256":"535908fd9c3e8f5da276dab093c2b967c69ef318b7094500e63ad463ecb10275","start":41}],"target_id":"concept.nist.segment","target_kind":"node","target_sha256":"69f2ead929ec24c447ee6bfc3ac59115a6f13c448b48295799d3fe1dff8525fd"}],"concept.nist.selectandpartition":[{"id":"assertion.concept.nist.selectandpartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines select and partition as: Given an array A of n elements and a positive integer k ≤ n, find the k th smallest element of A and partition the array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","support":[{"end":244,"quote":"Given an\narray\nA of n elements and a positive integer k ≤ n, find the k\nth\nsmallest element of A and\npartition\nthe array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","source_id":"nist-dads.selectandpartition","source_sha256":"4b43ed02e52fb6e0982e989c83e051a892fe7999434b2b02082be80c2d87c9cd","start":72}],"target_id":"concept.nist.selectandpartition","target_kind":"node","target_sha256":"0da7b5dc0a4848735cf2666565db00470beffbab54ab3da3c5625f415992203e"}],"concept.nist.selfloop":[{"id":"assertion.concept.nist.selfloop","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines self-loop as: An edge of a graph which starts and ends at the same vertex .","support":[{"end":106,"quote":"An\nedge\nof a\ngraph\nwhich starts and ends at the same\nvertex\n.","source_id":"nist-dads.selfloop","source_sha256":"e0b6b96dd2061131cc588d9832f3b52bc1ecf78cc7dd2ec97e8e577f75ceeb3a","start":45}],"target_id":"concept.nist.selfloop","target_kind":"node","target_sha256":"6b1934a7280a61ca161208ae4b8ae689a73055a231cf9016cfb789995860db25"}],"concept.nist.selforganizinglist":[{"id":"assertion.concept.nist.selforganizinglist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines self-organizing list as: A list that reorders the elements based on some self-organizing heuristic [Wikipedia] to improve average access time.","support":[{"end":188,"quote":"A\nlist\nthat reorders the elements based on some\nself-organizing heuristic [Wikipedia]\nto improve average access time.","source_id":"nist-dads.selforganizinglist","source_sha256":"2d045ceee5ef18709c2e0055bc02d3eb167a84e28aeaffb38755975e9ab7dc53","start":71}],"target_id":"concept.nist.selforganizinglist","target_kind":"node","target_sha256":"70b53d84ec7ebe46f8b378653b4f050c97e0014b2f3636ba586c683794b6021e"}],"concept.nist.semidefinite":[{"id":"assertion.concept.nist.semidefinite","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines semidefinite programming as: A generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix.","support":[{"end":198,"quote":"A generalization of a\nlinear program\nin which any subset of the variables may be constrained to form a semidefinite matrix.","source_id":"nist-dads.semidefinite","source_sha256":"a5050e6dd63523882244b3d005e1fb044ac362364194db9dca1ae4a33ff6641b","start":75}],"target_id":"concept.nist.semidefinite","target_kind":"node","target_sha256":"08a64e5ee7635e45e94563812bd3dc1a7858948117fdcd34afe3e7eb1dc7b962"}],"concept.nist.separatechaining":[{"id":"assertion.concept.nist.separatechaining","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines separate chaining as: A scheme in which each position in the hash table has a list to handle collisions . Each position may be just a link to the list ( direct chaining ) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list. Also known as external chaining.","support":[{"end":394,"quote":"A scheme in which each position in the\nhash table\nhas a\nlist\nto handle\ncollisions\n.  Each position may be just a\nlink\nto the list (\ndirect chaining\n) or may be an item and a link, essentially, the\nhead\nof a list. In the latter, one item is in the table, and other colliding items are in the list.\nAlso known as\nexternal chaining.","source_id":"nist-dads.separatechaining","source_sha256":"56ca57d8896e3fdf64ff345c17771235bec7c3feebbf7d6e7c6c39d18a430251","start":65}],"target_id":"concept.nist.separatechaining","target_kind":"node","target_sha256":"e2be721cbcc02a468bb6cae6d1d66ead7d8b9725cae8542cc546b251254ac387"}],"concept.nist.separatnthrm":[{"id":"assertion.concept.nist.separatnthrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines separation theorem as: A theorem showing that two complexity classes are distinct. Most separation theorems have been proved by diagonalization .","support":[{"end":185,"quote":"A theorem showing that two\ncomplexity classes\nare distinct. Most separation theorems have been proved by\ndiagonalization\n.","source_id":"nist-dads.separatnthrm","source_sha256":"9615361196735796b1491e9301a20b27e2f4b5b02a513128db0cd000bace44c5","start":63}],"target_id":"concept.nist.separatnthrm","target_kind":"node","target_sha256":"fe6ad253628c979df29395677868732c24eac19b2bd034e368ada21ee791027c"}],"concept.nist.set":[{"id":"assertion.concept.nist.set","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines set as: An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a universe , (2) either each element is a member of the set or it is not, and (3) the elements are unordered. Formal Definition: As an abstract data type , a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with axiomatic semantics as follows. new() returns a set isIn(v, new()) = false isIn(v, add(v, S)) = true isIn(v, add(u, S)) = isIn(v , S) if v ≠ u remove(v, new()) = new() remove(v, add(v, S)) = remove(v, S) remove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u where S is a set and u and v are elements. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, S)) = false","support":[{"end":952,"quote":"An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a\nuniverse\n, (2) either each element is a\nmember\nof the set or it is not, and (3) the elements are unordered.\nFormal Definition:\nAs an\nabstract data type\n, a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with\naxiomatic semantics\nas follows.\nnew() returns a set\nisIn(v, new()) = false\nisIn(v, add(v, S)) = true\nisIn(v, add(u, S)) = isIn(v , S) if v ≠ u\nremove(v, new()) = new()\nremove(v, add(v, S)) = remove(v, S)\nremove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u\nwhere S is a set and u and v are elements.\nThe\npredicate\nisEmpty(S) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(add(v, S)) = false","source_id":"nist-dads.set","source_sha256":"1ca0df0af76538a11d49c4d26da2bbec44800022ca4f6f4dfac484195cb83bd7","start":37}],"target_id":"concept.nist.set","target_kind":"node","target_sha256":"8d2029237284ab2e1ae1d797df0da33b394ef97b672aed67087fb4a07307395c"}],"concept.nist.setpacking":[{"id":"assertion.concept.nist.setpacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines set packing as: An optimization problem to find the largest number of mutually disjoint subsets that cover a given set of sets .","support":[{"end":166,"quote":"An\noptimization problem\nto find\tthe largest number of mutually\ndisjoint\nsubsets\nthat cover a given set of\nsets\n.","source_id":"nist-dads.setpacking","source_sha256":"ec7f921a43a606eb04b8b4ebd66da519dc7d75dd317f4e0c850ce54310786168","start":54}],"target_id":"concept.nist.setpacking","target_kind":"node","target_sha256":"5905c1262420147cdbbac5242762c23c2d995e6dcc3551d553ae7daa087e75da"}],"concept.nist.shadowheap":[{"id":"assertion.concept.nist.shadowheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow heap as: A heap , implemented in an array , adjacent to an unordered table. The shadow is the table nodes and all their (recursive) parents , by array index, in the heap.","support":[{"end":215,"quote":"A\nheap\n, implemented in an\narray\n, adjacent to an unordered table.  The\nshadow\nis the table\nnodes\nand all their (recursive)\nparents\n, by array index, in the heap.","source_id":"nist-dads.shadowheap","source_sha256":"547ddac337837596f68ba2c4f9cb4db083fc2706b11f3cb815ed648e02f6cb53","start":53}],"target_id":"concept.nist.shadowheap","target_kind":"node","target_sha256":"f69f05a40a6be51ef8746987f5657014b333aff6f2595cc8643ef68fced07671"}],"concept.nist.sharedmemory":[{"id":"assertion.concept.nist.sharedmemory","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shared memory as: All processors have the same global image of (and access to) all of the memory.","support":[{"end":132,"quote":"All processors have the same global image of (and access to) all of the memory.","source_id":"nist-dads.sharedmemory","source_sha256":"d9d37832f42868bf17d7a571c3b6c47afe9075eddd0f7237e51b87405ff91f33","start":53}],"target_id":"concept.nist.sharedmemory","target_kind":"node","target_sha256":"70bf2afdf43dcc9adc6235e38d2d53b1cd9f0d497d98cfc970442ec8898de4d9"}],"concept.nist.shortestcommonsuperseq":[{"id":"assertion.concept.nist.shortestcommonsuperseq","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shortest common supersequence as: Find the shortest string that contains two or more strings as subsequences .","support":[{"end":166,"quote":"Find the shortest string that contains two or more\nstrings\nas\nsubsequences\n.","source_id":"nist-dads.shortestcommonsuperseq","source_sha256":"06821437c618b2974599764eb50063e8c1a0506dd7c3c80237c843ab1ed9cfef","start":90}],"target_id":"concept.nist.shortestcommonsuperseq","target_kind":"node","target_sha256":"d7d8cc832c6e1b90c6fbd5cc99f9e5256f881d4acfcb8033fc641f2101f22572"}],"concept.nist.shortestcommonsuperstring":[{"id":"assertion.concept.nist.shortestcommonsuperstring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shortest common superstring as: Find the shortest string that contains two or more strings as substrings .","support":[{"end":160,"quote":"Find the shortest string that contains two or more\nstrings\nas\nsubstrings\n.","source_id":"nist-dads.shortestcommonsuperstring","source_sha256":"05bef6362e095076280c15fabe8392e1e2529ed02458c5e8d229d9587c4499eb","start":86}],"target_id":"concept.nist.shortestcommonsuperstring","target_kind":"node","target_sha256":"612ecdccea36691bc14165d5b81898c2df211077490fa7928537383f4c5ef60c"}],"concept.nist.sibling":[{"id":"assertion.concept.nist.sibling","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sibling as: A node in a tree that has the same parent as another node is its sibling.","support":[{"end":114,"quote":"A\nnode\nin a\ntree\nthat has the same\nparent\nas another node is its sibling.","source_id":"nist-dads.sibling","source_sha256":"4a2ec5da16c135a75a92eaabcef92d478742e37fd6746765b878c429273e171c","start":41}],"target_id":"concept.nist.sibling","target_kind":"node","target_sha256":"03f16adbb1153d33e77e5f458f987f23f9dcfc897d16e6201c8d4d2075b01766"}],"concept.nist.signature":[{"id":"assertion.concept.nist.signature","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines signature as: The types or domains , and order, in some representations, of inputs to and outputs from a function .","support":[{"end":146,"quote":"The types or\ndomains\n, and order, in some representations, of inputs to and outputs from a\nfunction\n.","source_id":"nist-dads.signature","source_sha256":"0f15cb4d4d5b4620b2a8f595ccbf2990e2aca7dfc2ae7c0aceeb74df3137f592","start":45}],"target_id":"concept.nist.signature","target_kind":"node","target_sha256":"f9aa280cdef9b7f53a29f96a6e1f644c6ca91a2e1e428b07881931ecd97a5773"}],"concept.nist.sim":[{"id":"assertion.concept.nist.sim","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ∼ as: (1) Proportional to. (2) Asymptotically equal to. A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means lim x → ∞ f(x)/g(x) = 1.","support":[{"end":375,"quote":"(1) Proportional to.  (2) Asymptotically equal to.  A theoretical measure of the execution of an\nalgorithm\n, usually the time or memory needed, given the problem size n, which is usually the number of items.  Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means  lim\nx → ∞\nf(x)/g(x) = 1.","source_id":"nist-dads.sim","source_sha256":"23d7904e867e2563b3d9aa3708c3d8d9e654933a079df0a42474832519a0ee4a","start":31}],"target_id":"concept.nist.sim","target_kind":"node","target_sha256":"2c13f5f1ea15424708ce45cdb0531c451e9d8258e3f0a6a5c08943752b81a93a"}],"concept.nist.simplepath":[{"id":"assertion.concept.nist.simplepath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple path as: A path that repeats no vertex , except that the first and last may be the same vertex.","support":[{"end":135,"quote":"A\npath\nthat repeats no\nvertex\n, except that the first and last may be the same vertex.","source_id":"nist-dads.simplepath","source_sha256":"f9e9afbce15edabc77f58b0202789c730c440135c5fb3e2f46feb423ad4075bb","start":49}],"target_id":"concept.nist.simplepath","target_kind":"node","target_sha256":"4e178dca7b0c8d8bf494ac6ce15d819bc65d5f7821c2242e6b3e29011b782ff8"}],"concept.nist.simpleuniformhashing":[{"id":"assertion.concept.nist.simpleuniformhashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple uniform hashing as: The assumption or goal that items are equally likely to hash to any value.","support":[{"end":145,"quote":"The assumption or goal that items are equally likely to\nhash\nto any value.","source_id":"nist-dads.simpleuniformhashing","source_sha256":"80e0baba7a88db982a1968863e743ae781b1a6f0edb02c1f476084b9490e2c48","start":71}],"target_id":"concept.nist.simpleuniformhashing","target_kind":"node","target_sha256":"15e5a126a9132689a7e2192df3f2c164cf4a5bb391d6e4d81059279c3b782a6e"}],"concept.nist.simplex":[{"id":"assertion.concept.nist.simplex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simplex as: The simplest N-dimensional polytope . The generalization of a triangle (2D) or tetrahedron (3D).","support":[{"end":138,"quote":"The simplest N-dimensional\npolytope\n.  The generalization of a triangle (2D) or tetrahedron (3D).","source_id":"nist-dads.simplex","source_sha256":"b482cf22e58f364acf42717e268fc54876cf9fcfbe7f35b04085b77af7ffe05d","start":41}],"target_id":"concept.nist.simplex","target_kind":"node","target_sha256":"f0526900bcc0b35d2ef7e7f8236eddaa68c5783b11c6b2a1ae65868a83a1ba8f"}],"concept.nist.simulatnthrm":[{"id":"assertion.concept.nist.simulatnthrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simulation theorem as: One kind of computation can be simulated by another kind within stated complexity bounds. Most known containment or equality relationships between complexity classes were proved this way.","support":[{"end":251,"quote":"One kind of computation can be simulated by another kind within stated complexity bounds.  Most known containment or equality relationships between\ncomplexity classes\nwere proved this way.","source_id":"nist-dads.simulatnthrm","source_sha256":"da3b10b220ab35d2d4181084eca00530c2409b66122e50069598cc016bf53d7a","start":63}],"target_id":"concept.nist.simulatnthrm","target_kind":"node","target_sha256":"7ca4f8a7020696f4bb21ee7803ce720e79f513b2cf0cbd1e51c2bca217cc898a"}],"concept.nist.singledestshortestpath":[{"id":"assertion.concept.nist.singledestshortestpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single-destination shortest-path problem as: Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.","support":[{"end":215,"quote":"Find the shortest\npath\nfrom each\nvertex\nin a\nweighted, directed graph\nto a specific destination vertex.","source_id":"nist-dads.singledestshortestpath","source_sha256":"d09b9ee5da3480d32d6aa96da8a1f7849c843445687e6c36dfb6adf40bd39d62","start":112}],"target_id":"concept.nist.singledestshortestpath","target_kind":"node","target_sha256":"ffda4e12198deb5c26830129e5d84b316a94b5d6da7ce123c6f66491265a7fc5"}],"concept.nist.singleprogrm":[{"id":"assertion.concept.nist.singleprogrm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single program multiple data as: The dominant style of parallel programming, where all processors use the same program, though each has its own data. Also known as SPMD.","support":[{"end":219,"quote":"The dominant style of parallel programming, where all processors use the same program, though each has its own data.\nAlso known as\nSPMD.","source_id":"nist-dads.singleprogrm","source_sha256":"43308eb5b047b5ad2d1100eceff8154df8b76c99cc4e9a9fe2f2363bc1cfc72e","start":83}],"target_id":"concept.nist.singleprogrm","target_kind":"node","target_sha256":"a356849fdab902f464cc137dcc48c2b2563a4a1db47fe17651af3f1ab184330e"}],"concept.nist.singlesourceshortestpath":[{"id":"assertion.concept.nist.singlesourceshortestpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines single-source shortest-path problem as: Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph . Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.","support":[{"end":323,"quote":"Find the\nshortest paths\nfrom a specific\nsource\nvertex\nto every other vertex in a\nweighted, directed graph\n.\nDijkstra's algorithm\nsolves this if all weights are nonnegative.  The\nBellman-Ford algorithm\nhandles any weights.","source_id":"nist-dads.singlesourceshortestpath","source_sha256":"f37198b076cb61a7772e2bfacffc6e3910cc3a5d64979483afe8024647640ef3","start":102}],"target_id":"concept.nist.singlesourceshortestpath","target_kind":"node","target_sha256":"709f383cbbdfc982c1f17ac4aaee3d3611735412c5c8f546975e9eb45ca1058e"}],"concept.nist.singularity":[{"id":"assertion.concept.nist.singularity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines singularity analysis as: A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","support":[{"end":161,"quote":"A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","source_id":"nist-dads.singularity","source_sha256":"dfb949b54f126059a918e5f70d6091231a0696cb6e69a6c09c76cd09af4e6e59","start":67}],"target_id":"concept.nist.singularity","target_kind":"node","target_sha256":"2e8b5e14f136481531c17c3bb37f423505f6a8498f349f82cace2429b1202cba"}],"concept.nist.sink":[{"id":"assertion.concept.nist.sink","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sink as: A vertex of a directed graph with no outgoing edges . More formally, a vertex with with out-degree 0.","support":[{"end":137,"quote":"A\nvertex\nof a\ndirected graph\nwith no outgoing\nedges\n.  More formally, a vertex with with\nout-degree\n0.","source_id":"nist-dads.sink","source_sha256":"097a46075c74c879f195c138dab5300ca8aac52c3deb5fb2d6869940fd5f9eff","start":35}],"target_id":"concept.nist.sink","target_kind":"node","target_sha256":"897c354b7ec7a762780fd674e753834e8868b285167667f7637d00f38ec1674d"}],"concept.nist.skdtree":[{"id":"assertion.concept.nist.skdtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skd-tree as: The spatial k-d tree is a spatial access method where successive levels are split along different dimensions. Objects are indexed by their centroid , and the minimum bounding box of objects in a node are stored in the node.","support":[{"end":271,"quote":"The spatial\nk-d tree\nis a\nspatial access method\nwhere successive levels are split along different dimensions.  Objects are indexed by their\ncentroid\n, and the\nminimum bounding box\nof objects in a node are stored in the node.","source_id":"nist-dads.skdtree","source_sha256":"796531a23b2494b193b38e38ce43b0f87cc9f5e6b7c77bb235e5f5f84168a83f","start":47}],"target_id":"concept.nist.skdtree","target_kind":"node","target_sha256":"ac5d1bcbae6e9a266c63fdb070f5e4e3a70334b7860e6e53d8307d5990154eec"}],"concept.nist.skewsymmetry":[{"id":"assertion.concept.nist.skewsymmetry","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skew symmetry as: The property that the flow is the same amount, but reversed direction, starting from either vertex of every edge of a flow network . More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","support":[{"end":278,"quote":"The property that the flow is the same amount, but reversed direction, starting from either\nvertex\nof every\nedge\nof a\nflow network\n.  More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","source_id":"nist-dads.skewsymmetry","source_sha256":"8aaac7c23c3a52d8fa4d7e94011a9dbdf7fde30a79e99f6e611673b1954088b6","start":53}],"target_id":"concept.nist.skewsymmetry","target_kind":"node","target_sha256":"67eaa3636b6c2625d1253b0c08359c580d3dd773b92e224d763e3a3d702b8e49"}],"concept.nist.skiplist":[{"id":"assertion.concept.nist.skiplist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines skip list as: A randomized variant of an ordered linked list with additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels. With enough levels, searching is O(log n) .","support":[{"end":486,"quote":"A\nrandomized\nvariant of an\nordered linked list\nwith additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels.  With enough levels, searching is\nO(log n)\n.","source_id":"nist-dads.skiplist","source_sha256":"16c9af16a3efabe361660a07f8f98e6f02eedb78de3ff83154ccb26d180b252e","start":49}],"target_id":"concept.nist.skiplist","target_kind":"node","target_sha256":"8c6fc4ef9cd13336778c30d5173ee4e39c50a1a7896175b1ad9bdcd5b2f037f1"}],"concept.nist.solvable":[{"id":"assertion.concept.nist.solvable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines solvable as: A computational problem that can be solved by a Turing machine . The problem may have a nonbinary output.","support":[{"end":149,"quote":"A computational problem that can be solved by a\nTuring machine\n.  The problem may have a nonbinary output.","source_id":"nist-dads.solvable","source_sha256":"d9dfb04304c7de5591db131df96a14d1a794ac9725398d08da087ab464bd2e9a","start":43}],"target_id":"concept.nist.solvable","target_kind":"node","target_sha256":"73742125cd2ace46dcc82f63bfaa95d7a9af1adac7cb5925cf5569795927819b"}],"concept.nist.sortedarray":[{"id":"assertion.concept.nist.sortedarray","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sorted array as: An array whose items are kept sorted, often so searching is faster.","support":[{"end":122,"quote":"An\narray\nwhose items are kept sorted, often so searching is faster.","source_id":"nist-dads.sortedarray","source_sha256":"4041dfedb5bd694abea218604849e92133a2b47278bb1abc5937465c0ee11922","start":55}],"target_id":"concept.nist.sortedarray","target_kind":"node","target_sha256":"b9e3cf88ce167f5fa49289f8330f0ab134a0a9c2cc77721ce81b43e3dba36c39"}],"concept.nist.sortedlist":[{"id":"assertion.concept.nist.sortedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sorted list as: A list whose items are kept sorted.","support":[{"end":88,"quote":"A\nlist\nwhose items are kept sorted.","source_id":"nist-dads.sortedlist","source_sha256":"f7429d7e7782fadb544a6cbafdba50edbba865ce741905d438b793f1820474e4","start":53}],"target_id":"concept.nist.sortedlist","target_kind":"node","target_sha256":"464360f92195112101003ad2eae357aa6d1a41f61d4e7cf3581d4ee7a0cf7efb"}],"concept.nist.source":[{"id":"assertion.concept.nist.source","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines source as: (1) A vertex of a directed graph with no incoming edges . More formally, a vertex with in-degree 0. (2) The vertex from which an edge of a directed graph leaves.","support":[{"end":201,"quote":"(1) A\nvertex\nof a\ndirected graph\nwith no incoming\nedges\n.  More formally, a vertex with\nin-degree\n0. (2) The vertex from which an\nedge\nof a\ndirected graph\nleaves.","source_id":"nist-dads.source","source_sha256":"0554b9145427da1baa7d7bf2bb2a2e63766fa3a7fa27a41590f96e13baa28d9f","start":39}],"target_id":"concept.nist.source","target_kind":"node","target_sha256":"ede4667264ab51096347b7395e3c8e470e9c02787af9417cb46bb2fe17311402"}],"concept.nist.space":[{"id":"assertion.concept.nist.space","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines space-constructible function as: A function s(n) that gives the actual space used by some Turing machine on all inputs of length n.","support":[{"end":181,"quote":"A function s(n) that gives the actual space used by some\nTuring machine\non all inputs of length n.","source_id":"nist-dads.space","source_sha256":"8944a8a5837b3f307d93b60a924e802c3574d92444989eff4f98429b6a530ab5","start":83}],"target_id":"concept.nist.space","target_kind":"node","target_sha256":"b7818d19cb5542f62507812c4156a8a424790541e0429c9441a6c7076cb78520"}],"concept.nist.spanningtree":[{"id":"assertion.concept.nist.spanningtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines spanning tree as: A connected , acyclic subgraph containing all the vertices of a graph .","support":[{"end":124,"quote":"A\nconnected\n,\nacyclic\nsubgraph containing all the\nvertices\nof a\ngraph\n.","source_id":"nist-dads.spanningtree","source_sha256":"0bdeb1927e8a42264b30cb824c2e174143d46dbd07a067777838c65259ea0371","start":53}],"target_id":"concept.nist.spanningtree","target_kind":"node","target_sha256":"27270ee64e3f6dfeb2baf5f09a4db4b1022987c61cf68cc07298ad3ba220746e"}],"concept.nist.sparsegraph":[{"id":"assertion.concept.nist.sparsegraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparse graph as: A graph in which the number of edges is much less than the possible number of edges.","support":[{"end":135,"quote":"A\ngraph\nin which the number of\nedges\nis much less than the possible number of edges.","source_id":"nist-dads.sparsegraph","source_sha256":"04b4f7b92ec5c52cfc4dab20d416f87e40b3c614e282c27ce57c9f086418cd6a","start":51}],"target_id":"concept.nist.sparsegraph","target_kind":"node","target_sha256":"e699e566cecb2e07852557fe6816157471e00171ef7832b761c5934b69d2aa2e"}],"concept.nist.sparsematrix":[{"id":"assertion.concept.nist.sparsematrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparse matrix as: A matrix that has relatively few non-zero (or \"interesting\") entries. It may be represented in much less than n × m space.","support":[{"end":180,"quote":"A\nmatrix\nthat has relatively few non-zero (or \"interesting\") entries.  It may be represented in much less than n × m space.","source_id":"nist-dads.sparsematrix","source_sha256":"56f610d5e057389b629f3fb313434219e8487c14d2283d09bb7b5a12908a0ee6","start":57}],"target_id":"concept.nist.sparsematrix","target_kind":"node","target_sha256":"2690a722f77230e5d16e458d0c8fd3a3f8772c4f75ec4957504bf4d980e5c061"}],"concept.nist.sparsity":[{"id":"assertion.concept.nist.sparsity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparsity as: Instances of the longest common subsequence problem in which the number of matches is small compared to the product of the lengths of the input strings.","support":[{"end":195,"quote":"Instances of the\nlongest common subsequence\nproblem in which the number of matches is small compared to the product of the lengths of the input strings.","source_id":"nist-dads.sparsity","source_sha256":"d08f900b3c9763edf72b4733e7a5dde85333d9acb858f83968fcd5ce941b7403","start":43}],"target_id":"concept.nist.sparsity","target_kind":"node","target_sha256":"21065ac98215c9e7fe724dd01107ada2c7c2906dd9ea771787df5456fb509a3c"}],"concept.nist.spatialaccessmethod":[{"id":"assertion.concept.nist.spatialaccessmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines spatial access method as: A data structure to search for lines, polygons, etc. Also known as SAM.","support":[{"end":140,"quote":"A data structure to search for lines, polygons, etc.\nAlso known as\nSAM.","source_id":"nist-dads.spatialaccessmethod","source_sha256":"f0679665ab34efc4a3f691d316fedf4bcfcf9790f611264c37813b158b1edd72","start":69}],"target_id":"concept.nist.spatialaccessmethod","target_kind":"node","target_sha256":"955660d3cf887f67b8d40c91dc8c871b021b9ad6bb3c25c8f006e78fd4a48bd9"}],"concept.nist.splaytree":[{"id":"assertion.concept.nist.splaytree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines splay tree as: A binary search tree in which operations that access nodes restructure the tree.","support":[{"end":131,"quote":"A\nbinary search tree\nin which operations that access\nnodes\nrestructure the tree.","source_id":"nist-dads.splaytree","source_sha256":"be110a518b69e645163abcb439f65601c55b4bef9e094770e6ec383297f3168c","start":51}],"target_id":"concept.nist.splaytree","target_kind":"node","target_sha256":"cc07f0d2b4b3a4d5078a358b0ef319f93b8d6be998b5e103ca515b67d962d491"}],"concept.nist.squarematrix":[{"id":"assertion.concept.nist.squarematrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines square matrix as: A n × n matrix , i.e., one whose size is the same in both dimensions.","support":[{"end":126,"quote":"A n × n\nmatrix\n, i.e., one whose size is the same in both dimensions.","source_id":"nist-dads.squarematrix","source_sha256":"ccfd97be3175efd16100f1390e7000d2dfe7f9b1946806b250d17ae156ea20d4","start":57}],"target_id":"concept.nist.squarematrix","target_kind":"node","target_sha256":"914e5639efe237f4731dd28eda35908b7302e3eca86ba817cddc33e2e76c5bfe"}],"concept.nist.sstable":[{"id":"assertion.concept.nist.sstable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines SSTable as: An immutable dictionary stored on disk. Values are far larger than keys. Keys and values are in key-order in a \"data block\". Ordered keys are in an \"index block\", where each key has an offset into its location in the data block. Also known as sorted-string table.","support":[{"end":312,"quote":"An immutable\ndictionary\nstored on disk.  Values are far larger than keys.  Keys and values are in key-order in a \"data block\".   Ordered keys are in an \"index block\", where each key has an offset into its location in the data block.\nAlso known as\nsorted-string table.","source_id":"nist-dads.sstable","source_sha256":"b73e5fbe48929f2e36352c216033cf6353e5f3d1e0e71e9e443ccda630933069","start":45}],"target_id":"concept.nist.sstable","target_kind":"node","target_sha256":"2d71d14bac2bccd71c34e1f38ec36df7f5d26e293a3b7cd270e0ba8fcb82db27"}],"concept.nist.stable":[{"id":"assertion.concept.nist.stable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stable as: An algorithm where the relative order upon input of items with equal keys is always preserved in the output. Usually a sort algorithm.","support":[{"end":174,"quote":"An\nalgorithm\nwhere the relative order upon input of items with equal\nkeys\nis always preserved in the output.  Usually a\nsort\nalgorithm.","source_id":"nist-dads.stable","source_sha256":"c718d3f125767b815a8f0f53d244b9c852a30afcbab9a760a65dc73e183138eb","start":39}],"target_id":"concept.nist.stable","target_kind":"node","target_sha256":"f104491c7165d389bfead1fd3a80f81b7d877d332117bf1acddc9925fe3bbecf"}],"concept.nist.stack":[{"id":"assertion.concept.nist.stack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines stack as: A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO. Formal Definition: The operations new(), push(v, S), top(S), and popoff(S) may be defined with axiomatic semantics as follows. new() returns a stack popoff(push(v, S)) = S top(push(v, S)) = v where S is a stack and v is a value. The pop operation is a combination of top, to return the top value, and popoff, to remove the top value. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(push(v, S)) = false Also known as LIFO.","support":[{"end":765,"quote":"A collection of items in which only the most recently added item may be removed.  The latest added item is at the top.  Basic operations are push and pop.  Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO.\nFormal Definition:\nThe operations new(), push(v, S), top(S), and popoff(S) may be defined with\naxiomatic semantics\nas follows.\nnew() returns a stack\npopoff(push(v, S)) = S\ntop(push(v, S)) = v\nwhere S is a stack and v is a value.  The pop operation is a combination of top, to return the top value, and popoff, to remove the top value.\nThe\npredicate\nisEmpty(S) may be defined with the following additional axioms.\nisEmpty(new()) = true\nisEmpty(push(v, S)) = false\nAlso known as\nLIFO.","source_id":"nist-dads.stack","source_sha256":"5920b06174b0e5bc4e641b5166f24b39eb344a94d29194f7865573065c0fded0","start":41}],"target_id":"concept.nist.stack","target_kind":"node","target_sha256":"d23906e478a86fd4851f6168069e5fa2b744bc55f6ce5673c746fc9e0fce21cd"}],"concept.nist.stacktree":[{"id":"assertion.concept.nist.stacktree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stack tree as: A binary tree where no node , except the root , has more than one non- leaf child .","support":[{"end":130,"quote":"A\nbinary tree\nwhere no\nnode\n, except the\nroot\n, has more than one non-\nleaf\nchild\n.","source_id":"nist-dads.stacktree","source_sha256":"c827a9c0bcac04656a9abce25632af6a28c2f61fcd5c7103b7c4954e862631ad","start":47}],"target_id":"concept.nist.stacktree","target_kind":"node","target_sha256":"85b9c905d03e12f369f9e83aac83c3b1768cd279e1d5631ea9f0015e05cf1ec6"}],"concept.nist.starshaped":[{"id":"assertion.concept.nist.starshaped","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines star-shaped polygon as: A polygon P in which there exists an interior point p such that all the boundary points of P are visible from p.","support":[{"end":177,"quote":"A polygon P in which there exists an interior point p such that all the boundary points of P are\nvisible\nfrom p.","source_id":"nist-dads.starshaped","source_sha256":"e06f4c7ae3a6d16e088b25551177bacfaa32e323a02f46a28f26649f1f1ff8aa","start":65}],"target_id":"concept.nist.starshaped","target_kind":"node","target_sha256":"b3d1fa9ada34c1a5266a8ef832a99a97aad82e573341155a9095943ce20451ac"}],"concept.nist.startstate":[{"id":"assertion.concept.nist.startstate","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines start state as: An initial state or condition of a finite state machine or Turing machine . Informally, how the memory is initially set.","support":[{"end":170,"quote":"An initial\nstate\nor condition of a\nfinite state machine\nor\nTuring machine\n.  Informally, how the memory is initially set.","source_id":"nist-dads.startstate","source_sha256":"278c81cde024531a572bf3e5f4b1aecaee72d6954195aec69dcabedcc9bafd6b","start":49}],"target_id":"concept.nist.startstate","target_kind":"node","target_sha256":"3a3c7b29105badb41dc9283ef82a3baa217704f2965bc121461f1856e6415e7f"}],"concept.nist.state":[{"id":"assertion.concept.nist.state","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines state as: The condition of a finite state machine or Turing machine at a certain time. Informally, the content of memory.","support":[{"end":149,"quote":"The condition of a\nfinite state machine\nor\nTuring machine\nat a certain time.  Informally, the content of memory.","source_id":"nist-dads.state","source_sha256":"d609e6edafd98d484b24d1c811254a201380da5c964d8d09bd283ded982620d5","start":37}],"target_id":"concept.nist.state","target_kind":"node","target_sha256":"7b301963a0d69916a0e37328bea71f14b100a406f9261bac977e7e14b53aed73"}],"concept.nist.statemachine":[{"id":"assertion.concept.nist.statemachine","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines state machine as: A model of computation consisting of a (possibly infinite) set of states , a set of start states , an input alphabet , and a transition function which maps input symbols and current states to a next state . Usually understood to be a finite state machine .","support":[{"end":310,"quote":"A\nmodel of computation\nconsisting of a (possibly infinite) set of\nstates\n, a set of\nstart states\n, an input\nalphabet\n, and a\ntransition function\nwhich maps input symbols and current states to a\nnext state\n.  Usually understood to be a\nfinite state machine\n.","source_id":"nist-dads.statemachine","source_sha256":"b2488d1340f05d9791fb8f0d62ae2857adf07f1e8b7e4fb76717f775e4709021","start":53}],"target_id":"concept.nist.statemachine","target_kind":"node","target_sha256":"8ce759e42bc18267981f216f8329316f59479c09b357fdb78a5df49a15ee8b6b"}],"concept.nist.static":[{"id":"assertion.concept.nist.static","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines static as: When the problem domain does not change.","support":[{"end":79,"quote":"When the problem domain does not change.","source_id":"nist-dads.static","source_sha256":"e85da3b32a8d13f6cdeb2e20955926e410cf21117359cef7307a0b80bd410e28","start":39}],"target_id":"concept.nist.static","target_kind":"node","target_sha256":"a9f9ddf270d63fd8ea24e991db0d5dca65e3ddcdcd14609048e55ce2492bc6c7"}],"concept.nist.stcut":[{"id":"assertion.concept.nist.stcut","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines s-t cut as: A partitioning of the vertices of a flow network into S and T such that the source is in S and the sink is in T.","support":[{"end":153,"quote":"A partitioning of the\nvertices\nof a\nflow network\ninto S and T such that the\nsource\nis in S and the\nsink\nis in T.","source_id":"nist-dads.stcut","source_sha256":"5810d4caab8aa5081928b7b0d2f97651c992692b6a5e58aa62896ed6d1f56ef7","start":41}],"target_id":"concept.nist.stcut","target_kind":"node","target_sha256":"3598d5c6f3a32b5b2752fb4e8277f49a9cdfa4dc99b6a4c6660988f178ccdec3"}],"concept.nist.stdigraph":[{"id":"assertion.concept.nist.stdigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines st-digraph as: A directed acyclic graph with two specially marked nodes, the source s and the sink t.","support":[{"end":137,"quote":"A\ndirected acyclic graph\nwith two specially marked nodes, the\nsource\ns and the\nsink\nt.","source_id":"nist-dads.stdigraph","source_sha256":"8612a5150149d0dfccf0975f5851fa42222f5718b57de3d6f035658d78bbda14","start":51}],"target_id":"concept.nist.stdigraph","target_kind":"node","target_sha256":"5770c0dcee53ff4b799a3e54cab2416f22458dc8e7ce61bc7582e2d4f8962e6d"}],"concept.nist.steinerpoint":[{"id":"assertion.concept.nist.steinerpoint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner point as: (1) A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree . (2) A point with a particular geometric relation to a triangle.","support":[{"end":235,"quote":"(1) A point that is not part of the input set of points, for instance, a point computed to construct a\nSteiner tree\n.  (2) A point with a particular geometric relation to a triangle.","source_id":"nist-dads.steinerpoint","source_sha256":"1ce8f0db4b5073bd1e6626c3b9734f5dfc92969e6735fabbd8b3775bfb4e4d93","start":53}],"target_id":"concept.nist.steinerpoint","target_kind":"node","target_sha256":"75f9e23424ebb1b9407cf7c8e59d671c7622a5448ad6141ec0bc23e0e0fce5f2"}],"concept.nist.steinerratio":[{"id":"assertion.concept.nist.steinerratio","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner ratio as: For a given variant of the Steiner tree problem, the maximum possible ratio of the length of a minimum spanning tree of a set of terminals to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).","support":[{"end":288,"quote":"For a given variant of the\nSteiner tree\nproblem, the maximum possible ratio of the length of a\nminimum spanning tree\nof a set of\nterminals\nto the length of an optimal Steiner tree of the same set of terminals.  Usually written ρ (rho).","source_id":"nist-dads.steinerratio","source_sha256":"c15c1645fdd807ef43af411f290a4da7b5774f90c9af59cb9da0287ea2731bd1","start":53}],"target_id":"concept.nist.steinerratio","target_kind":"node","target_sha256":"89f84b4569327ca02e9079f9e3dc477a776e24c9c6650db83394a9df033fd5d1"}],"concept.nist.steinertree":[{"id":"assertion.concept.nist.steinertree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner tree as: A minimum-weight tree connecting a designated set of vertices , called terminals , in an undirected , weighted graph or points in a space. The tree may include non-terminals, which are called Steiner vertices or Steiner points .","support":[{"end":279,"quote":"A minimum-weight\ntree\nconnecting a designated set of\nvertices\n, called\nterminals\n, in an\nundirected\n,\nweighted graph\nor points in a space. The tree may include non-terminals, which are called\nSteiner vertices\nor\nSteiner points\n.","source_id":"nist-dads.steinertree","source_sha256":"b2a7562a159067ac4546c17640798740c621c66dc5b245aca22f51bb80980fbf","start":51}],"target_id":"concept.nist.steinertree","target_kind":"node","target_sha256":"5af539a864c09b450d41ef08c1422e1b50d9b1eb2081779fe87ce030545a91ab"}],"concept.nist.steinervertx":[{"id":"assertion.concept.nist.steinervertx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Steiner vertex as: A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree .","support":[{"end":168,"quote":"A point that is not part of the input set of points, for instance, a point computed to construct a\nSteiner tree\n.","source_id":"nist-dads.steinervertx","source_sha256":"b55afc57ac8ee1d2a578bc483937e4007f771fd322b0b715feaaaa055c5acb7b","start":55}],"target_id":"concept.nist.steinervertx","target_kind":"node","target_sha256":"16da3757d150ab2cd1671e1569be827b2d1c6d308d5084342cf6d5916955e0ea"}],"concept.nist.straightline":[{"id":"assertion.concept.nist.straightline","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines straight-line drawing as: A graph drawing in which each edge is represented by a straight line segment.","support":[{"end":146,"quote":"A\ngraph drawing\nin which each edge is represented by a straight line segment.","source_id":"nist-dads.straightline","source_sha256":"a8d00a8ebd540918d5d822a14ec161806c1303b4fa63bad70a50eef5bdbe510f","start":69}],"target_id":"concept.nist.straightline","target_kind":"node","target_sha256":"ed6fb8bafa33b72f781a3f8a0e916945debbf6ff7936a108616f22aef9cc7f66"}],"concept.nist.strictlydecreasing":[{"id":"assertion.concept.nist.strictlydecreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly decreasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) > f(y).","support":[{"end":173,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x < y implies f(x) > f(y).","source_id":"nist-dads.strictlydecreasing","source_sha256":"93890673b8dc373127a1d21f6b8ab3b9a7e8c95af453ad480a4231a9f95e32be","start":65}],"target_id":"concept.nist.strictlydecreasing","target_kind":"node","target_sha256":"8d13c1401b2e40cd70e7e521a4bc581b11be50234f22a2206bfc8b1dc39bcdb0"}],"concept.nist.strictlyincreasing":[{"id":"assertion.concept.nist.strictlyincreasing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly increasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) < f(y).","support":[{"end":173,"quote":"A\nfunction\nfrom a\npartially ordered\ndomain\nto a partially ordered\nrange\nsuch that x < y implies f(x) < f(y).","source_id":"nist-dads.strictlyincreasing","source_sha256":"269397b1edf1461b35fa0f2d9b59b2a305d17e19501b772e8933a83d95fcf3db","start":65}],"target_id":"concept.nist.strictlyincreasing","target_kind":"node","target_sha256":"cd5f0505f2d40d2a11983b30d4f6cf717645f6ec40d5cc92ccf72e6cfa91261e"}],"concept.nist.strictlylowertriangmat":[{"id":"assertion.concept.nist.strictlylowertriangmat","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly lower triangular matrix as: A matrix that is only defined at (i,j) when i > j.","support":[{"end":145,"quote":"A\nmatrix\nthat is only defined at (i,j) when i > j.","source_id":"nist-dads.strictlylowertriangmat","source_sha256":"64dc59acb4f0d2362f985ab6326e2c5fa6a0d31f47623ec057d1c4b9b4bcd69c","start":95}],"target_id":"concept.nist.strictlylowertriangmat","target_kind":"node","target_sha256":"e60a6f6e93e7a0ee7aa732569612154815ffcc28021ab162fdac0a866dfa7943"}],"concept.nist.strictlyuppertriangmat":[{"id":"assertion.concept.nist.strictlyuppertriangmat","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strictly upper triangular matrix as: A matrix that is only defined at (i,j) when i < j.","support":[{"end":145,"quote":"A\nmatrix\nthat is only defined at (i,j) when i < j.","source_id":"nist-dads.strictlyuppertriangmat","source_sha256":"3211a27a6d58312b7591b39d9982a04702f1cbf5b1659bc56275329896afb95e","start":95}],"target_id":"concept.nist.strictlyuppertriangmat","target_kind":"node","target_sha256":"89ea6ad747a688e6d3704ad62254b4b32461fd0bf7669abc2ad901aca53d41a4"}],"concept.nist.string":[{"id":"assertion.concept.nist.string","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string as: A list of characters, usually implemented as an array . Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","support":[{"end":237,"quote":"A list of characters, usually implemented as an\narray\n. Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","source_id":"nist-dads.string","source_sha256":"5e556b9ff9ac3bee2c23b14fe788a85adbafd5e1d7f75046de8c86d07bc0857b","start":43}],"target_id":"concept.nist.string","target_kind":"node","target_sha256":"7b294c9178c517122b3ae3f1a2234e47417571ac31a4215f93afb442679f58ca"}],"concept.nist.stringedit":[{"id":"assertion.concept.nist.stringedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string editing problem as: The problem of finding an edit script of minimum cost which transforms a given string into another given string.","support":[{"end":183,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\nstring\ninto another given string.","source_id":"nist-dads.stringedit","source_sha256":"51f9ed056f5e581f6d8e6557c043b339650322e74baee2731228a54231065140","start":71}],"target_id":"concept.nist.stringedit","target_kind":"node","target_sha256":"c79d5dec4788c2c261d39cc8f59aae28b2d09426a81f07e78cf1aeca7e56c901"}],"concept.nist.stringmatching":[{"id":"assertion.concept.nist.stringmatching","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines string matching as: The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching. Also known as exact string matching, string searching, text searching.","support":[{"end":291,"quote":"The problem of finding occurrence(s) of a\npattern\nstring  within another\nstring\nor body of text.  There are many different\nalgorithms\nfor efficient searching.\nAlso known as\nexact string matching, string searching, text searching.","source_id":"nist-dads.stringmatching","source_sha256":"6d351eda09fd804d45084a8f92a0957cd6240243a2021b68d0d35901b4c220a3","start":62}],"target_id":"concept.nist.stringmatching","target_kind":"node","target_sha256":"ab707c4ea9323037c26f424efd226b91b202935ab68ebf3d66c967772dd43472"}],"concept.nist.strippacking":[{"id":"assertion.concept.nist.strippacking","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strip packing as: Pack a set of rectangles into a strip of width 1 to minimize the height used. Rectangles may not overlap or be rotated. Without loss of generality, the height of rectangles is at most 1. This is NP-hard .","support":[{"end":265,"quote":"Pack a\nset\nof rectangles into a strip of width 1 to minimize the height used.  Rectangles may not overlap or be rotated.  Without loss of generality, the height of rectangles is at most 1.  This is\nNP-hard\n.","source_id":"nist-dads.strippacking","source_sha256":"a1a81d523390f58f3746bc0502ae49a83f1db4138a875d5f38e0e404b502f416","start":58}],"target_id":"concept.nist.strippacking","target_kind":"node","target_sha256":"3c6e23a1de1117a407b841f7d75c97ab098b1c0c3da74363e95a578324c86bd5"}],"concept.nist.stronglyconnectedcompo":[{"id":"assertion.concept.nist.stronglyconnectedcompo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly connected component as: A strongly connected subgraph , S, of a directed graph , D, such that no vertex of D can be added to S and it still be strongly connected. Informally, a maximal subgraph in which every vertex is reachable from every other vertex.","support":[{"end":313,"quote":"A\nstrongly connected\nsubgraph\n, S, of a\ndirected graph\n, D, such that no\nvertex\nof D can be added to S and it still be strongly connected.  Informally, a maximal subgraph in which every vertex is\nreachable\nfrom every other vertex.","source_id":"nist-dads.stronglyconnectedcompo","source_sha256":"49745b61e5ee1b19449df4aa05104bd1af252af18acd2dca428f9ad4efa46209","start":83}],"target_id":"concept.nist.stronglyconnectedcompo","target_kind":"node","target_sha256":"732f40175be7adb06234d38e2c6de1472b336e98fdbc488b6ea95852e49c8561"}],"concept.nist.stronglyconnectedgraph":[{"id":"assertion.concept.nist.stronglyconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly connected graph as: A directed graph that has a path from each vertex to every other vertex. Formal Definition: A directed graph D=(V, E) such that for all pairs of vertices u, v ∈ V, there is a path from u to v and from v to u.","support":[{"end":283,"quote":"A\ndirected graph\nthat has a\npath\nfrom each\nvertex\nto every other vertex.\nFormal Definition:\nA\ndirected graph\nD=(V, E) such that for all pairs of\nvertices\nu, v ∈ V, there is a\npath\nfrom u to v and from v to u.","source_id":"nist-dads.stronglyconnectedgraph","source_sha256":"7f3006c64712d50ea60aeaff887790b1d8cca79e219b5a7db1e0ac0aa5d0fa27","start":75}],"target_id":"concept.nist.stronglyconnectedgraph","target_kind":"node","target_sha256":"8e1b6c19d53e7514ac12e2577413aca8e6e147cf271f9f9781a139fa0c7f1946"}],"concept.nist.stronglynp":[{"id":"assertion.concept.nist.stronglynp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strongly NP-hard as: The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.","support":[{"end":218,"quote":"The\ncomplexity class\nof\ndecision problems\nwhich are still\nNP-hard\neven when all numbers in the input are bounded by some\npolynomial\nin the length of the input.","source_id":"nist-dads.stronglynp","source_sha256":"4bc63dee099414e3256c4628c636eb7498f82bca193ff51e25f7da723d109b2b","start":59}],"target_id":"concept.nist.stronglynp","target_kind":"node","target_sha256":"48ee90bd9ad758a26f9001d2ad6b4e845e3af0bb0377cd850690c21ca01a12f3"}],"concept.nist.subadditive":[{"id":"assertion.concept.nist.subadditive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subadditive ergodic theorem as: If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","support":[{"end":195,"quote":"If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","source_id":"nist-dads.subadditive","source_sha256":"8095cd830e2d756cc340dd933e0e591ac401d28e9ce66b2f584f12fa16374715","start":81}],"target_id":"concept.nist.subadditive","target_kind":"node","target_sha256":"29f5e734c1f4c8b0fcf8541b12a0cc2c1d1fbae1ba0cbc10f62c669eeca01748"}],"concept.nist.subgraph":[{"id":"assertion.concept.nist.subgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subgraph as: A graph whose vertices and edges are subsets of another graph . Formal Definition: A graph G'=(V', E') is a subgraph of another graph G=(V, E) iff V'⊆ V, and E'⊆ E ∧ ( (v 1 , v 2 )∈ E' → v 1 , v 2 ∈ V').","support":[{"end":251,"quote":"A\ngraph\nwhose\nvertices\nand\nedges\nare\nsubsets\nof another\ngraph\n.\nFormal Definition:\nA\ngraph\nG'=(V', E') is a subgraph of another graph  G=(V, E) iff\nV'⊆ V, and\nE'⊆ E ∧ ( (v\n1\n, v\n2\n)∈ E'     → v\n1\n, v\n2\n∈ V').","source_id":"nist-dads.subgraph","source_sha256":"915924bb5bff5567cbbae23ca786f860df4e80041afd58ae964d690e6e468e41","start":43}],"target_id":"concept.nist.subgraph","target_kind":"node","target_sha256":"58c807e58a5b15fe23426739fe6a628e20a80373fa3ed7f7ecf5bbf86f384baa"}],"concept.nist.subgraphiso":[{"id":"assertion.concept.nist.subgraphiso","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subgraph isomorphism as: Decide if there is a subgraph of one graph which is isomorphic to another graph.","support":[{"end":152,"quote":"Decide if there is a\nsubgraph\nof one\ngraph\nwhich is\nisomorphic\nto another graph.","source_id":"nist-dads.subgraphiso","source_sha256":"580a66a7a1c9e63e2a6e580f2c91c7867b98b486e7b95eb822bb1ddd5a44158e","start":72}],"target_id":"concept.nist.subgraphiso","target_kind":"node","target_sha256":"05c97a99d016d8b6b56b865b41f95065fc45f72e5ba784aa77fe6eeb83d3492f"}],"concept.nist.sublineartimealgo":[{"id":"assertion.concept.nist.sublineartimealgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sublinear time algorithm as: A algorithm whose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","support":[{"end":218,"quote":"A\nalgorithm\nwhose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","source_id":"nist-dads.sublineartimealgo","source_sha256":"fc5ae351bddbf749268787bda46e1c8be1ce04d67efc38666d87340fad781167","start":75}],"target_id":"concept.nist.sublineartimealgo","target_kind":"node","target_sha256":"5816f717b7fc5a9aae6686bcf7bc833bb24b8bed79b522328d505145d9f88bad"}],"concept.nist.subsequence":[{"id":"assertion.concept.nist.subsequence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subsequence as: Any string that can be obtained by deleting zero or more symbols from a given string.","support":[{"end":134,"quote":"Any\nstring\nthat can be obtained by deleting zero or more symbols from a given string.","source_id":"nist-dads.subsequence","source_sha256":"4343f545bb3f721ea83c26080af6886d608b3b4e344cc897d45685862debbd3a","start":49}],"target_id":"concept.nist.subsequence","target_kind":"node","target_sha256":"1a5ea767c2cd805943e6acae06195e0329e970b4463f58a6acba08ed246d944e"}],"concept.nist.subset":[{"id":"assertion.concept.nist.subset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subset as: A set S 1 is a subset of another set S 2 if every element in S 1 is in S 2 . S 2 may have exactly the same elements as S 1 . Formal Definition: S 1 ⊆ S 2 iff ∀ s, s ∈ S 1 → s ∈ S 2 .","support":[{"end":222,"quote":"A\nset\nS\n1\nis a subset of another set S\n2\nif every element in S\n1\nis in S\n2\n.  S\n2\nmay have exactly the same elements as S\n1\n.\nFormal Definition:\nS\n1\n⊆ S\n2\niff ∀ s, s ∈ S\n1\n→ s ∈ S\n2\n.","source_id":"nist-dads.subset","source_sha256":"373f891a081701de107908471de9da030457ff8d9f1188068a00706920e221c5","start":39}],"target_id":"concept.nist.subset","target_kind":"node","target_sha256":"6781ab4d2e55a66e78446aae400e683a9891c2692e84ae6dbb175db39003a502"}],"concept.nist.substring":[{"id":"assertion.concept.nist.substring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines substring as: A string v is a substring of a string u if u=u′ vu″ for some prefix u′ and suffix u″. Also known as factor.","support":[{"end":153,"quote":"A\nstring\nv is a substring of a string u if u=u′ vu″  for some\nprefix\nu′ and\nsuffix\nu″.\nAlso known as\nfactor.","source_id":"nist-dads.substring","source_sha256":"25d65dd9af96fc0b42a82add16755dcbf6e822207b644e65e42f33f23dd321a3","start":45}],"target_id":"concept.nist.substring","target_kind":"node","target_sha256":"16ceecf9c447cf00a72996260a61fbc201d6a23db93c6411a9b5faa4507dba32"}],"concept.nist.subtree":[{"id":"assertion.concept.nist.subtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines subtree as: The tree which is a child of a node .","support":[{"end":78,"quote":"The\ntree\nwhich is a\nchild\nof a\nnode\n.","source_id":"nist-dads.subtree","source_sha256":"036626093720c969c0af84aab987dca727816c0409dfae02a8eebf5b16ccb06d","start":41}],"target_id":"concept.nist.subtree","target_kind":"node","target_sha256":"e07a97c79a5871c8f3e187c4de30b9ed67b684bc7505f9fb3316331fb609e50c"}],"concept.nist.suffix":[{"id":"assertion.concept.nist.suffix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines suffix as: The end characters of a string . More formally a string v is a suffix of a string u if u=u'v for some string u'.","support":[{"end":152,"quote":"The end characters of a\nstring\n.  More formally a string v is a suffix of a string u if u=u'v for some string u'.","source_id":"nist-dads.suffix","source_sha256":"e0ce77ae87708273da3294f459d66c8a7cb6569a6bed1b58071865af4cd7286b","start":39}],"target_id":"concept.nist.suffix","target_kind":"node","target_sha256":"7e0916ad9a33bc065fbb54339fc0f23ca7e004f5e1fa1cc0158f3052fb9956ba"}],"concept.nist.suffixarray":[{"id":"assertion.concept.nist.suffixarray","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines suffix array as: An array of all starting positions of suffixes of a string arranged in lexicographical order . This allows a binary search or fast substring search.","support":[{"end":203,"quote":"An\narray\nof all starting positions of\nsuffixes\nof a\nstring\narranged in\nlexicographical order\n. This allows a\nbinary search\nor fast substring search.","source_id":"nist-dads.suffixarray","source_sha256":"b910231752c35dcf7e023fdaea60ac0bc3c9eab79ac614577105e22d7add36e4","start":55}],"target_id":"concept.nist.suffixarray","target_kind":"node","target_sha256":"26b5b19b787decc5aaf2438c03ceecd8928c3ce081c4695f5e2fa8936631ec64"}],"concept.nist.suffixautmtn":[{"id":"assertion.concept.nist.suffixautmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines suffix automaton as: The smallest automaton accepting all suffixes of a string . The states form a directed acyclic word graph or DAWG.","support":[{"end":174,"quote":"The smallest\nautomaton\naccepting all\nsuffixes\nof a\nstring\n.  The states form a\ndirected acyclic word graph\nor DAWG.","source_id":"nist-dads.suffixautmtn","source_sha256":"b0656175cf425e959c55fe435b68921ac203aa9e3d5f25f32bf7141a25bd2956","start":59}],"target_id":"concept.nist.suffixautmtn","target_kind":"node","target_sha256":"7e2b04a13db3cdac36481e334325eb8cff7cab283ec80c8f84d7631b7bb324be"}],"concept.nist.suffixtree":[{"id":"assertion.concept.nist.suffixtree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines suffix tree as: A compact representation of a trie corresponding to the suffixes of a given string where all nodes with one child are merged with their parents .","support":[{"end":198,"quote":"A compact representation of a\ntrie\ncorresponding to the\nsuffixes\nof a given\nstring\nwhere all\nnodes\nwith one\nchild\nare merged with their\nparents\n.","source_id":"nist-dads.suffixtree","source_sha256":"8d22807b787c41fa02742b1d5b9d4bc1dde5d02c9141e9b57d317db91c13ca16","start":53}],"target_id":"concept.nist.suffixtree","target_kind":"node","target_sha256":"db90f87ba29c5b3beb7c1f766560b0473f05c2ff1cb3b375cafe2b9d8f317b0f"}],"concept.nist.superimposedcode":[{"id":"assertion.concept.nist.superimposedcode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines superimposed code as: A set of bit vectors such that no vector is a subset of a bitwise or of a small number of others.","support":[{"end":158,"quote":"A set of bit vectors such that no vector is a subset of a bitwise\nor\nof a small number of others.","source_id":"nist-dads.superimposedcode","source_sha256":"d031d1dc262149d6ccc729a4c342f5e0b7daf1894d5b78c06d7512481a86e523","start":61}],"target_id":"concept.nist.superimposedcode","target_kind":"node","target_sha256":"16196eb3563fce0b78b143c2d997d28478c7161e4bd561655412997c54eba1fe"}],"concept.nist.superset":[{"id":"assertion.concept.nist.superset","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines superset as: A set S 1 is a superset of another set S 2 if every element in S 2 is in S 1 . S 1 may have elements which are not in S 2 .","support":[{"end":167,"quote":"A\nset\nS\n1\nis a superset of another set S\n2\nif every element in S\n2\nis in S\n1\n.  S\n1\nmay have elements which are not in S\n2\n.","source_id":"nist-dads.superset","source_sha256":"1de5814676b33efb19c0d70d2575ca045f604f9c6ff5fc1fc483a3e079e5a1e1","start":43}],"target_id":"concept.nist.superset","target_kind":"node","target_sha256":"b52c3521dd8eddea47567028bd351732ef2da58d04d903f05d69ae92f138554d"}],"concept.nist.supersink":[{"id":"assertion.concept.nist.supersink","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines supersink as: A vertex of a directed graph which is reachable from all other vertices.","support":[{"end":117,"quote":"A\nvertex\nof a\ndirected graph\nwhich is\nreachable\nfrom all other vertices.","source_id":"nist-dads.supersink","source_sha256":"dc651b99fb2c3cb3f81143c5bffdf726fb3d507e4143a3e84d4afc6f31f5d57d","start":45}],"target_id":"concept.nist.supersink","target_kind":"node","target_sha256":"f6cb9a0be1787746c20a171d982bb3e5991b43489785b4ab9ddd5f29e65eaf2c"}],"concept.nist.supersource":[{"id":"assertion.concept.nist.supersource","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines supersource as: A vertex of a directed graph from which all other vertices are reachable .","support":[{"end":123,"quote":"A\nvertex\nof a\ndirected graph\nfrom which all other vertices are\nreachable\n.","source_id":"nist-dads.supersource","source_sha256":"8cf1eedd81819e1d653ce456863aa63be603e758b9a7e67ddecb2aac14fe906d","start":49}],"target_id":"concept.nist.supersource","target_kind":"node","target_sha256":"47c1a67de9957600afd57bcb8ef85c4462731068e63d2a169ed935c4a966d516"}],"concept.nist.symmetric":[{"id":"assertion.concept.nist.symmetric","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetric as: A binary relation R for which a R b implies b R a.","support":[{"end":95,"quote":"A\nbinary relation\nR for which a R b implies b R a.","source_id":"nist-dads.symmetric","source_sha256":"a1b3197a5cff6402bacc2072eddfdb76fe87b3f28a0659f7ffb4740b50d26e29","start":45}],"target_id":"concept.nist.symmetric","target_kind":"node","target_sha256":"98d561f2c18ab40b27e68ff8626d5b72764cc9f988ae0971d3a2a6418f374b61"}],"concept.nist.symmetricsetdiff":[{"id":"assertion.concept.nist.symmetricsetdiff","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetric set difference as: Members which are in either set , but not in both. That is, for sets A and B, it is (A - B) ∪ (B - A).","support":[{"end":178,"quote":"Members which are in either\nset\n, but not in both.  That is, for sets A and B, it is (A - B) ∪ (B - A).","source_id":"nist-dads.symmetricsetdiff","source_sha256":"97dabde245408a637f3304ef32578767d09f999d8346688bb378590b136033a8","start":75}],"target_id":"concept.nist.symmetricsetdiff","target_kind":"node","target_sha256":"a6819046644d5350ab17443230a33865b5dc1ed7cbad70a79b89e0dcd60e6ebb"}],"concept.nist.tail":[{"id":"assertion.concept.nist.tail","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tail as: (1) The last item of a list . (2) All but the first item of a list; the list following the head.","support":[{"end":131,"quote":"(1) The last item of a\nlist\n. (2) All but the first item of a list; the list following the head.","source_id":"nist-dads.tail","source_sha256":"ddb37d4056abeae715cae1a0288bcd250d436526db2cfce79af430eaa4e72bd1","start":35}],"target_id":"concept.nist.tail","target_kind":"node","target_sha256":"41785ce20a7d1e70a09ea3320e412996a283d854b2390dbed5e4ca1bc2bb44f4"}],"concept.nist.target":[{"id":"assertion.concept.nist.target","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines target as: The vertex which an edge of a directed graph enters.","support":[{"end":91,"quote":"The\nvertex\nwhich an\nedge\nof a\ndirected graph\nenters.","source_id":"nist-dads.target","source_sha256":"895f5dcaa98a071e10af7bbd04c09cbad51beb130c3849862b8824fda638d680","start":39}],"target_id":"concept.nist.target","target_kind":"node","target_sha256":"b422b474d515c303affaeee361af1a9ef4704e4b5f8101dc2f1e79add3014831"}],"concept.nist.temporllogic":[{"id":"assertion.concept.nist.temporllogic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines temporal logic as: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification .","support":[{"end":310,"quote":"A logic with a notion of time included.  The formulas can express facts about past, present, and future states.  The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in\nformal verification\n.","source_id":"nist-dads.temporllogic","source_sha256":"e5af4d08c3ef5a927a63073e9d85bcca7d832173586f0729d08974ea2ea1f1ca","start":55}],"target_id":"concept.nist.temporllogic","target_kind":"node","target_sha256":"7cb204c7c304fb9fad31456b844e7e02f27860853a6e7ab4d50d2ca8dae02ac7"}],"concept.nist.terminal":[{"id":"assertion.concept.nist.terminal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines terminal as: The set of points in a plane or vertices in a graph defining endpoints of a Steiner tree .","support":[{"end":133,"quote":"The set of points in a plane or\nvertices\nin a\ngraph\ndefining endpoints of a\nSteiner tree\n.","source_id":"nist-dads.terminal","source_sha256":"9f52b10b1c33ba21b405362b60049adce4bc85c0648560f294d3cd45d90d43a8","start":43}],"target_id":"concept.nist.terminal","target_kind":"node","target_sha256":"5aa3f145575eb91e3284dcdf22c6966f676eee78b4241a94da695425e484654c"}],"concept.nist.ternarysearchtree":[{"id":"assertion.concept.nist.ternarysearchtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ternary search tree as: A 3-way tree where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key. If the key is a multikey ( string , array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.) Also known as TST.","support":[{"end":427,"quote":"A 3-way\ntree\nwhere every\nnode's\nleft\nsubtree\nhas\nkeys\nless than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key.  If the key is a multikey (\nstring\n, array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.)\nAlso known as\nTST.","source_id":"nist-dads.ternarysearchtree","source_sha256":"94887bc4530c15b67cfb05547ac152d6442203f6c91035ae0e697219f1998b0d","start":69}],"target_id":"concept.nist.ternarysearchtree","target_kind":"node","target_sha256":"fad1ee672bda862704968d236af1853bf8c80d01fa2bcd165451e699bb178fb6"}],"concept.nist.text":[{"id":"assertion.concept.nist.text","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines text as: A list of characters, usually thought of as a list of words separated by spaces.","support":[{"end":115,"quote":"A list of characters, usually thought of as a list of words separated by spaces.","source_id":"nist-dads.text","source_sha256":"57fbc7c643ea2e3e30d29c8a61cd4113505e98f1cfc2cebf6eeae610ab5fca37","start":35}],"target_id":"concept.nist.text","target_kind":"node","target_sha256":"d06fbd4785d2259500021531007268ddde06eb68f66109baca0235217b44123b"}],"concept.nist.threadedtree":[{"id":"assertion.concept.nist.threadedtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines threaded tree as: A binary search tree in which each node uses an otherwise-empty left child link to refer to the node's in-order predecessor and an empty right child link to refer to its in-order successor.","support":[{"end":246,"quote":"A\nbinary\nsearch tree\nin which each\nnode\nuses an otherwise-empty left\nchild\nlink\nto refer to the node's\nin-order\npredecessor and an empty right child link to refer to its in-order successor.","source_id":"nist-dads.threadedtree","source_sha256":"9c6787c6d1a6bc6386c9d67e49f047cd96bf598188d9a79a058b4b7ec7eeca9c","start":57}],"target_id":"concept.nist.threadedtree","target_kind":"node","target_sha256":"2a57e3771b5fa144a620fd16dae4f840d85900810ea13db9294dac1441537c55"}],"concept.nist.threedimnsnl":[{"id":"assertion.concept.nist.threedimnsnl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines three-dimensional as: Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","support":[{"end":180,"quote":"Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","source_id":"nist-dads.threedimnsnl","source_sha256":"f8f2d778095c45fbc4b69b838cd8e799ee14cc91069b9c2f420c1f6079028997","start":61}],"target_id":"concept.nist.threedimnsnl","target_kind":"node","target_sha256":"dfc8bb2f2e8b652c7818dde967e67c4243c7fd7b6424c9567b000bdf860ef3bb"}],"concept.nist.time":[{"id":"assertion.concept.nist.time","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines time-constructible function as: A function t(n) that gives the actual running time of some Turing machine on all inputs of length n.","support":[{"end":181,"quote":"A function t(n) that gives the actual running time of some\nTuring machine\non all inputs of length n.","source_id":"nist-dads.time","source_sha256":"da03b770c61b3b9b4c3938933a5d9ea69c9e2bdfed2d33e34100d1258de1bbd5","start":81}],"target_id":"concept.nist.time","target_kind":"node","target_sha256":"f428319d99f7f85c5e714367685949ca6171776e902e4e570f019425c5989075"}],"concept.nist.timespace":[{"id":"assertion.concept.nist.timespace","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines time/space complexity as: The maximum time or space required by a Turing machine on any input of length n.","support":[{"end":149,"quote":"The maximum time or space required by a\nTuring machine\non any input of length n.","source_id":"nist-dads.timespace","source_sha256":"42950eb01c07e4ee8e612c486a43b18a3e55ef17e46ca99c4be5582b6669e144","start":69}],"target_id":"concept.nist.timespace","target_kind":"node","target_sha256":"063a1d7b5e28a2fd538fc31a9d546f722c4ee7a3568eb99bcb917de004d6bcd3"}],"concept.nist.topologicalorder":[{"id":"assertion.concept.nist.topologicalorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines topological order as: A numbering of the vertices of a directed acyclic graph such that every edge from a vertex numbered i to a vertex numbered j satisfies i<j.","support":[{"end":200,"quote":"A numbering of the\nvertices\nof a\ndirected acyclic graph\nsuch that every\nedge\nfrom a vertex numbered i to a vertex numbered j satisfies i<j.","source_id":"nist-dads.topologicalorder","source_sha256":"fa7d29c3b35060795d634b54548a2192b2c0a9df0562b0bd6d227e3d4af99562","start":61}],"target_id":"concept.nist.topologicalorder","target_kind":"node","target_sha256":"df433210552913c37bb6da43185e257ba3c3647111d0713d3b3aad021bd14a62"}],"concept.nist.topologicalsort":[{"id":"assertion.concept.nist.topologicalsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines topological sort as: To arrange items when some pairs of items have no comparison, that is, according to a partial order .","support":[{"end":160,"quote":"To arrange items when some pairs of items have no comparison, that is, according to a\npartial order\n.","source_id":"nist-dads.topologicalsort","source_sha256":"3459970d4754ed89977cc7b4cf41d4d2fd7cdcd617c1ca35af87362485c20b3d","start":59}],"target_id":"concept.nist.topologicalsort","target_kind":"node","target_sha256":"01bf6e3bfb8a68995532cc8a4f2e5e387832a73dd07b14047ff63bc14b00e594"}],"concept.nist.topologytree":[{"id":"assertion.concept.nist.topologytree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines topology tree as: Tree that describes a balanced decomposition of another tree, according to its topology. More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at level l represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two children , representing the vertex clusters at level l-1 whose union gives the vertex cluster the node represents.","support":[{"end":529,"quote":"Tree that describes a balanced decomposition of another tree, according to its topology.  More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at\nlevel\nl represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two\nchildren\n, representing the vertex clusters at level l-1 whose\nunion\ngives the vertex cluster the node represents.","source_id":"nist-dads.topologytree","source_sha256":"13a1a35537fa5b53b2603d334d4b4f3e7a98203c030b08cf05564788ac969535","start":53}],"target_id":"concept.nist.topologytree","target_kind":"node","target_sha256":"7b2dbbe29430faa6b54775f33c2f00ec6e24ab3148a8831a1aadae0a859a71d5"}],"concept.nist.totalfunc":[{"id":"assertion.concept.nist.totalfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines total function as: A function which is defined for all inputs of the right type, that is, for all of a domain .","support":[{"end":147,"quote":"A\nfunction\nwhich is defined for all inputs of the right type, that is, for all of a\ndomain\n.","source_id":"nist-dads.totalfunc","source_sha256":"7e28ed8b019861cfe0f4747f4952336ce98eda89289294bbc77f23ae87a57e33","start":55}],"target_id":"concept.nist.totalfunc","target_kind":"node","target_sha256":"d12af238b8eae1e0d202422e3fb02285e77f5319666d1c8b32b71b9545b6085d"}],"concept.nist.totallyundecidableprob":[{"id":"assertion.concept.nist.totallyundecidableprob","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines totally undecidable problem as: A problem that cannot be solved by a Turing machine .","support":[{"end":134,"quote":"A problem that cannot be solved by a\nTuring machine\n.","source_id":"nist-dads.totallyundecidableprob","source_sha256":"a78f993de62f98cafee4e48c08c0f39dc0378ca1c2586ac1d1ed58be1b8f1a5d","start":81}],"target_id":"concept.nist.totallyundecidableprob","target_kind":"node","target_sha256":"1d9fdd7a1cdee277773692d0eb758cb576500a7166cb35197f01c27e66d38855"}],"concept.nist.totalorder":[{"id":"assertion.concept.nist.totalorder","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines total order as: An order defined for all pairs of items of a set. For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other. Formal Definition: A total order is a relation that is reflexive , transitive , antisymmetric , and total. Also known as linear order.","support":[{"end":383,"quote":"An order defined for all pairs of items of a set.  For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other.\nFormal Definition:\nA total order is a\nrelation\nthat is\nreflexive\n,\ntransitive\n,\nantisymmetric\n, and total.\nAlso known as\nlinear order.","source_id":"nist-dads.totalorder","source_sha256":"0c5abdfc7840151c68b5594ad4996d1464f6811188e645f54063b53d77f2bc55","start":49}],"target_id":"concept.nist.totalorder","target_kind":"node","target_sha256":"7db247b9d80e93ae5a8633cdfd4b9cf54f2d5a0a3ec114f9f4417f7fd683f501"}],"concept.nist.tractable":[{"id":"assertion.concept.nist.tractable","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tractable as: A problem which has an algorithm which computes all instances of it in polynomial time .","support":[{"end":133,"quote":"A problem which has an\nalgorithm\nwhich computes all instances of it in\npolynomial time\n.","source_id":"nist-dads.tractable","source_sha256":"3ad1224500310cd66ff922fe436ba5a2432cc4e5a1b355008c76fc41824585d0","start":45}],"target_id":"concept.nist.tractable","target_kind":"node","target_sha256":"fe19eb57dedfd702540e2aea32e831ff02a0a12d8db0aac7dfcd7a87e129b9a6"}],"concept.nist.transition":[{"id":"assertion.concept.nist.transition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transition as: The change from one state to another in a finite state machine . Analogously, an edge in a directed graph . Also known as state transition, move.","support":[{"end":193,"quote":"The change from one\nstate\nto another in a\nfinite state machine\n.  Analogously, an\nedge\nin a\ndirected graph\n.\nAlso known as\nstate transition, move.","source_id":"nist-dads.transition","source_sha256":"1396ff5579ff22102b87e007950c0064fb7f16523ee9129d7b44b51cb58e0c09","start":47}],"target_id":"concept.nist.transition","target_kind":"node","target_sha256":"a55d8cb7432115695a89c1149406d75ba477bb4aa12222189892ea4073253f2b"}],"concept.nist.transitionfn":[{"id":"assertion.concept.nist.transitionfn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transition function as: A function of the current state and input giving the next state of a finite state machine or Turing machine .","support":[{"end":174,"quote":"A function of the current\nstate\nand input giving the\nnext state\nof a\nfinite state machine\nor\nTuring machine\n.","source_id":"nist-dads.transitionfn","source_sha256":"a4c8f66d88727b9244e75d198eb5933b172a2e401dfe376abf399927240fd002","start":65}],"target_id":"concept.nist.transitionfn","target_kind":"node","target_sha256":"7f18961e2a0fd815e4954efb85bc4f668d9f587de287e2524c87c7f79f2b7f6a"}],"concept.nist.transitive":[{"id":"assertion.concept.nist.transitive","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transitive as: A binary relation R for which a R b and b R c implies a R c.","support":[{"end":107,"quote":"A\nbinary relation\nR for which a R b and b R c implies a R c.","source_id":"nist-dads.transitive","source_sha256":"393168db374cea0550cebcd90cdb49ae213018a0efec515c57e5cb2f78ac5640","start":47}],"target_id":"concept.nist.transitive","target_kind":"node","target_sha256":"d1ec4e7818c2825bc8cafc89ee5608508fb3c8e7a39ce99b6096feaac5895b71"}],"concept.nist.transitiveclosure":[{"id":"assertion.concept.nist.transitiveclosure","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines transitive closure as: An extension or superset of a binary relation such that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","support":[{"end":197,"quote":"An extension or superset of a\nbinary relation\nsuch that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","source_id":"nist-dads.transitiveclosure","source_sha256":"efc3bf543ef61bc215238e543ebeb6f2ab051627d163d193f5d5fb94e8c45fba","start":63}],"target_id":"concept.nist.transitiveclosure","target_kind":"node","target_sha256":"3333da8a77f2733ef1140cb1192799f59d9994f2cfc3043e6917a6aa1ca34735"}],"concept.nist.transitivereduction":[{"id":"assertion.concept.nist.transitivereduction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transitive reduction as: The transitive reduction of a directed graph G is the directed graph G' with the smallest number of edges such that for every path between vertices in G, G' has a path between those vertices.","support":[{"end":258,"quote":"The transitive reduction of a\ndirected graph\nG is the directed graph G' with the smallest number of\nedges\nsuch that for every\npath\nbetween\nvertices\nin G, G' has a path between those vertices.","source_id":"nist-dads.transitivereduction","source_sha256":"5e7635ff32265ee10f660c4773e983cb27fc87ada8dbc4e401bdeaf0902f3d7a","start":67}],"target_id":"concept.nist.transitivereduction","target_kind":"node","target_sha256":"d2a43563130d4a952f82ca23296bec9c45af9321f8752db9007ab7348060cb0c"}],"concept.nist.travelingsalesman":[{"id":"assertion.concept.nist.travelingsalesman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines traveling salesman as: Find a path through a weighted graph that starts and ends at the same vertex , includes every other vertex exactly once, and minimizes the total cost of edges . Also known as TSP.","support":[{"end":247,"quote":"Find a\npath\nthrough a\nweighted graph\nthat starts and ends at the same\nvertex\n, includes every other vertex exactly once, and minimizes the total cost of\nedges\n.\nAlso known as\nTSP.","source_id":"nist-dads.travelingsalesman","source_sha256":"8a396942ed763dc3422e220a302a36ec64b9bbdc3188b3b68e8d0885c6d89217","start":68}],"target_id":"concept.nist.travelingsalesman","target_kind":"node","target_sha256":"aead32b40bbe3ea72f699fba37eaba198a261cf8451f64bbbfdd7450933a911a"}],"concept.nist.treap":[{"id":"assertion.concept.nist.treap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treap as: A binary search tree in which nodes have another key , called the priority. Operations also keep the nodes heap ordered with regard to the priority.","support":[{"end":190,"quote":"A\nbinary search tree\nin which\nnodes\nhave another\nkey\n, called the priority.  Operations also keep the nodes\nheap ordered\nwith regard to the priority.","source_id":"nist-dads.treap","source_sha256":"81208d00d688e70d26f8a6f5ca9d49d5ff80c6beffee4c333c2fe8ca303c9e53","start":41}],"target_id":"concept.nist.treap","target_kind":"node","target_sha256":"d650cdb05410141af5d15f6a48f197085a19789710853f7ad7a65c3f0b820ba6"}],"concept.nist.tree":[{"id":"assertion.concept.nist.tree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines tree as: (1) A data structure accessed beginning at the root node. Each node is either a leaf or an internal node . An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A connected , undirected , acyclic graph . It is rooted and ordered unless otherwise specified. Thanks to Joshua O'Madadhain ( [email protected] ) for the figure, 6 October 2005. Formal Definition: (1) A tree is either empty (no nodes), or a root and zero or more subtrees. The subtrees are ordered.","support":[{"end":718,"quote":"(1) A data structure accessed beginning at the\nroot\nnode.  Each\nnode\nis either a\nleaf\nor an\ninternal node\n.  An internal node has one or more\nchild\nnodes and is called the\nparent\nof its child nodes.  All children of the same node are\nsiblings\n. Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A\nconnected\n,\nundirected\n,\nacyclic graph\n.  It is\nrooted\nand\nordered\nunless otherwise specified.\nThanks to Joshua O'Madadhain (\n[email protected]\n) for the figure, 6 October 2005.\nFormal Definition:\n(1) A tree is either\nempty (no nodes), or\na root and zero or more subtrees.\nThe subtrees are ordered.","source_id":"nist-dads.tree","source_sha256":"351113c8d10916cb4c43fcb070c122a8828d73bd511765bd5edb0acaab990d0b","start":39}],"target_id":"concept.nist.tree","target_kind":"node","target_sha256":"41f35fad506f76e353579fd65463a8924fc4261c420423a2603ede649f9defc1"}],"concept.nist.treeautomaton":[{"id":"assertion.concept.nist.treeautomaton","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree automaton as: An extension of a finite state machine that operates on n-ary constructors. Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes n states and constructors. Tree automata may be top-down (starting from the root ) or bottom-up (starting from the leaves ), and deterministic or nondeterministic .","support":[{"end":406,"quote":"An extension of a\nfinite state machine\nthat operates on n-ary constructors.  Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes\nn\nstates and constructors.  Tree automata may be top-down (starting from the\nroot\n) or bottom-up (starting from the\nleaves\n), and\ndeterministic\nor\nnondeterministic\n.","source_id":"nist-dads.treeautomaton","source_sha256":"609ca5ae9516c8b5dddc811e4f0f2bf17a2ec18ce7183afb3e639730a5bbd139","start":55}],"target_id":"concept.nist.treeautomaton","target_kind":"node","target_sha256":"ee2e56e080ece989b07952dabc9fbf4d5cebcf5ce73b9a124f009c35164c58bf"}],"concept.nist.treecontrctn":[{"id":"assertion.concept.nist.treecontrctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree contraction as: Contracting a tree by removing some of the nodes.","support":[{"end":108,"quote":"Contracting a\ntree\nby removing some of the nodes.","source_id":"nist-dads.treecontrctn","source_sha256":"44aad98a54e92c0edafb8375b9fe934c28c5c55045ad08b4bc47ef758481747d","start":59}],"target_id":"concept.nist.treecontrctn","target_kind":"node","target_sha256":"03ca34dc72d6c2179fe78ee47626459541119e72c25d3e3a0c097005317fc23e"}],"concept.nist.treeedit":[{"id":"assertion.concept.nist.treeedit","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree editing problem as: The problem of finding an edit script of minimum cost which transforms a given tree into another given tree.","support":[{"end":175,"quote":"The problem of finding an\nedit script\nof minimum cost which transforms a given\ntree\ninto another given tree.","source_id":"nist-dads.treeedit","source_sha256":"6107c0ab4720bb0f499c2dd2f0b26bdf2e53c58d05cea3ce98c84cec410a0a79","start":67}],"target_id":"concept.nist.treeedit","target_kind":"node","target_sha256":"d9984f62f8bd6c22ae244a5cb98b3f7b26b711892e690bad0c5c18e392ea6ff2"}],"concept.nist.treetraversal":[{"id":"assertion.concept.nist.treetraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tree traversal as: A technique for processing the nodes of a tree in some order.","support":[{"end":116,"quote":"A technique for processing the\nnodes\nof a\ntree\nin some order.","source_id":"nist-dads.treetraversal","source_sha256":"b39c669f7aab391c4dfcb5fa17a84da3b94c54db649ce8fcf4c1a8f50e49e035","start":55}],"target_id":"concept.nist.treetraversal","target_kind":"node","target_sha256":"4a89238b1345e4a99d99bb07a047e354f99f4d8bbf253a9000a52bea76b78637"}],"concept.nist.trianglnqlty":[{"id":"assertion.concept.nist.trianglnqlty","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines triangle inequality as: The property that a complete weighted graph satisfies weight(u,v) ≤ weight(u,w) + weight(w,v) for all vertices u, v, w. Informally, the graph has no short cuts.","support":[{"end":227,"quote":"The property that a\ncomplete\nweighted graph\nsatisfies  weight(u,v) ≤  weight(u,w) + weight(w,v) for all\nvertices\nu, v, w. Informally, the graph has no short cuts.","source_id":"nist-dads.trianglnqlty","source_sha256":"1cd821017637a91132f9c48551d00e587dfa3a56716f0a75ef901e2bd212324c","start":65}],"target_id":"concept.nist.trianglnqlty","target_kind":"node","target_sha256":"7a14f6503b14ba8532963e9a1bd4a63a2bc83548b03bb50438a24455c79660fe"}],"concept.nist.triconnectedgraph":[{"id":"assertion.concept.nist.triconnectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines triconnected graph as: A connected graph such that deleting any two vertices (and incident edges ) results in a graph that is still connected.","support":[{"end":182,"quote":"A\nconnected graph\nsuch that deleting any two\nvertices\n(and incident\nedges\n) results in a graph that is still connected.","source_id":"nist-dads.triconnectedgraph","source_sha256":"e339448df1967338c88d9749253a814b8de00a5c40cd365ebf6394bb95beb161","start":63}],"target_id":"concept.nist.triconnectedgraph","target_kind":"node","target_sha256":"6ced114ea6a313f62e9ba9ab479f61d0c1ea64f6549793fee22a2153e50a4f17"}],"concept.nist.trie":[{"id":"assertion.concept.nist.trie","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines trie as: A tree for storing strings in which there is one node for every common prefix . The strings are stored in extra leaf nodes.","support":[{"end":163,"quote":"A\ntree\nfor storing\nstrings\nin which there is one\nnode\nfor every common\nprefix\n.  The strings are stored in extra\nleaf\nnodes.","source_id":"nist-dads.trie","source_sha256":"76381cb85d2cabd53dbdd57c719e90a66be4cd3034a38eb6ffdb58f439be7d03","start":39}],"target_id":"concept.nist.trie","target_kind":"node","target_sha256":"d7923bba0e5fd14cb295e3f549f8f1f019ad2e992f5d9fb1c2f0527491df6819"}],"concept.nist.trinaryfunc":[{"id":"assertion.concept.nist.trinaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines trinary function as: A function with three arguments.","support":[{"end":91,"quote":"A\nfunction\nwith three arguments.","source_id":"nist-dads.trinaryfunc","source_sha256":"108e50511755ab8ff00e6afac7330436ec61c3cdfc54e11118996a1990764713","start":59}],"target_id":"concept.nist.trinaryfunc","target_kind":"node","target_sha256":"49dc4225cd2c606924afb73c78be7818aca8d3a948568376622b1bc2cc22e09b"}],"concept.nist.turingmachine":[{"id":"assertion.concept.nist.turingmachine","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Turing machine as: A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic .","support":[{"end":376,"quote":"A\nmodel of computation\nconsisting of a\nfinite state machine\ncontroller, a read-write head, and an unbounded sequential tape. Depending on the current\nstate\nand symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is\ndeterministic\n.","source_id":"nist-dads.turingmachine","source_sha256":"8268532d26c9e29addd84fe0af76d68ff9c49d162ffe9cfd0ae8c25914b55089","start":55}],"target_id":"concept.nist.turingmachine","target_kind":"node","target_sha256":"c6d89bb3877febea8ab3d152f95af0bd688d43e68d01b7d4bdbd91f61699a806"}],"concept.nist.turingredctn":[{"id":"assertion.concept.nist.turingredctn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Turing reduction as: A reduction computable by an oracle Turing machine that halts for all inputs.","support":[{"end":136,"quote":"A\nreduction\ncomputable\nby an\noracle Turing machine\nthat halts for all inputs.","source_id":"nist-dads.turingredctn","source_sha256":"3a24e9eb58f6bc9e1d75611956b0679a9cdbf2f0339f9e1ae4f46f5073432c97","start":59}],"target_id":"concept.nist.turingredctn","target_kind":"node","target_sha256":"ff8c3d641dafe13ff9e77dbac55c08e4318f56ea2294b9ac31920fcf536d0c93"}],"concept.nist.twingridfl":[{"id":"assertion.concept.nist.twingridfl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines twin grid file as: A point access method which is two simultaneous grid files . Points are shuffled between the primary and secondary file to minimize the total size.","support":[{"end":207,"quote":"A\npoint access method\nwhich is two simultaneous\ngrid files\n.  Points are shuffled between the primary and secondary file to minimize the total size.","source_id":"nist-dads.twingridfl","source_sha256":"ee12f94f947d0306c5fa822dff65fbeeaf8f3d7aa761f551995b7df46c390246","start":59}],"target_id":"concept.nist.twingridfl","target_kind":"node","target_sha256":"1723bd195de935e861d5c67d4388ecff8e2f89ca4b9cc2069819e444841458f4"}],"concept.nist.two34tree":[{"id":"assertion.concept.nist.two34tree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 2-3-4 tree as: A B-tree of order 4, that is, internal nodes have two, three, or four children .","support":[{"end":131,"quote":"A\nB-tree\nof order 4, that is,\ninternal nodes\nhave two, three, or four\nchildren\n.","source_id":"nist-dads.two34tree","source_sha256":"98871ff24cc78b5c5577d9a1958d5e50ea049d2461209cb809e99f4b01837ee3","start":51}],"target_id":"concept.nist.two34tree","target_kind":"node","target_sha256":"ab91365d0e6680e367a39eee40d1f322933d8c6c60678a9b5fd928ccd238e574"}],"concept.nist.two3tree":[{"id":"assertion.concept.nist.two3tree","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines 2-3 tree as: A B-tree of order 3, that is, internal nodes have two or three children .","support":[{"end":120,"quote":"A\nB-tree\nof order 3, that is,\ninternal nodes\nhave two or three\nchildren\n.","source_id":"nist-dads.two3tree","source_sha256":"20c2a2600dcb3e0e953f457f8cf01f0bcc6b353f4f4a9fa7325820f19f8a9757","start":47}],"target_id":"concept.nist.two3tree","target_kind":"node","target_sha256":"414dbace7d1c3a5c96120fd2a7d0f314a6cd9a87a5c8e32ef4e35d1d4e0ef448"}],"concept.nist.twodimensnal":[{"id":"assertion.concept.nist.twodimensnal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-dimensional as: Dealing with or restricted to a plane. An organization where location can be completely described with exactly two orthogonal axes.","support":[{"end":189,"quote":"Dealing with or restricted to a plane.  An organization where location can be completely described with exactly two orthogonal axes.","source_id":"nist-dads.twodimensnal","source_sha256":"68e9ddb75abed0fd9deb55c2666fcccf25c34932e2ab3e47dd100a6eb2fd954c","start":57}],"target_id":"concept.nist.twodimensnal","target_kind":"node","target_sha256":"15f3bb2f7b42de7d8d5c6aec0cda82a32fd7cbe6186a69d1ea4929f5c2de39be"}],"concept.nist.twolevgrid":[{"id":"assertion.concept.nist.twolevgrid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-level grid file as: A point access method which is two levels of grid files . The first level addresses second level grid files.","support":[{"end":178,"quote":"A\npoint access method\nwhich is two levels of\ngrid files\n.  The first level addresses second level grid files.","source_id":"nist-dads.twolevgrid","source_sha256":"357c3d01afd73c3d9e0efad42925ebed1d4739f9f292db7a627b554f3b80c390","start":69}],"target_id":"concept.nist.twolevgrid","target_kind":"node","target_sha256":"a82c56827170f6c4169ffeed12fda051a6ab5942ea9681813199e0ca6cd78501"}],"concept.nist.ubtree":[{"id":"assertion.concept.nist.ubtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines UB-tree as: Refers to either universal B-tree or unlimited branching tree .","support":[{"end":108,"quote":"Refers to either\nuniversal B-tree\nor\nunlimited branching tree\n.","source_id":"nist-dads.ubtree","source_sha256":"986687126a6c05ff9ca07fd54b7128ae039d02a1012863635b4dab76f179ad92","start":45}],"target_id":"concept.nist.ubtree","target_kind":"node","target_sha256":"11aef5d7064c5d2ff4a4bfc641c57d13315bfbde8765b98c664c74a2fe3618b4"}],"concept.nist.unaryfunc":[{"id":"assertion.concept.nist.unaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unary function as: A function which takes one argument.","support":[{"end":91,"quote":"A\nfunction\nwhich takes one argument.","source_id":"nist-dads.unaryfunc","source_sha256":"73d62ff480a10d8ba80e3bf36575781608e20255225708c08ac4903739e3d754","start":55}],"target_id":"concept.nist.unaryfunc","target_kind":"node","target_sha256":"afa01a71a1a36b9ec4fbcde9592c7edb7d2f904a8277470726156de686abeec3"}],"concept.nist.uncomputablefunction":[{"id":"assertion.concept.nist.uncomputablefunction","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uncomputable function as: A function that cannot be computed by any algorithm --- equivalently, not by any Turing machine .","support":[{"end":166,"quote":"A function that cannot be computed by any\nalgorithm\n--- equivalently, not by any\nTuring machine\n.","source_id":"nist-dads.uncomputablefunction","source_sha256":"9e124e32ce316151e2f122710c842be31937b9767a3eda55f88155fe9d8ec735","start":69}],"target_id":"concept.nist.uncomputablefunction","target_kind":"node","target_sha256":"0ecfaad40546a2068a06109a30aa5d0245169f23b95e80da4b8960108585decd"}],"concept.nist.undecidablelanguage":[{"id":"assertion.concept.nist.undecidablelanguage","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undecidable language as: A language for which the membership cannot be decided by an algorithm --- equivalently, cannot be recognized by a Turing machine that halts for all inputs.","support":[{"end":222,"quote":"A language for which the membership cannot be decided by an\nalgorithm\n--- equivalently, cannot be recognized by a\nTuring machine\nthat halts for all inputs.","source_id":"nist-dads.undecidablelanguage","source_sha256":"e3b7bbbc85bb26164578fef7edec5fa53f52736f5e6b0580a943b26e9a9daead","start":67}],"target_id":"concept.nist.undecidablelanguage","target_kind":"node","target_sha256":"75f1b72ec157d1d91d70a84a0a6628c6ec07f3d171a920f318849617184eaf69"}],"concept.nist.undecidableproblem":[{"id":"assertion.concept.nist.undecidableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undecidable problem as: A problem that cannot be solved for all cases by any algorithm whatsoever---equivalently, whose associated language cannot be recognized by a Turing machine that halts for all inputs.","support":[{"end":248,"quote":"A problem that cannot be solved for all cases by any\nalgorithm\nwhatsoever---equivalently, whose associated\nlanguage\ncannot be recognized by a\nTuring machine\nthat halts for all inputs.","source_id":"nist-dads.undecidableproblem","source_sha256":"8f19753b49b93c88ed6eb25e47effcbc0ac8355530b021bbf03a87799177aa9b","start":65}],"target_id":"concept.nist.undecidableproblem","target_kind":"node","target_sha256":"956268b7b620d87eeaa1979f0cf070b4e4b7faff4bb524747b3288d84f91f933"}],"concept.nist.undirectedgraph":[{"id":"assertion.concept.nist.undirectedgraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines undirected graph as: A graph whose edges are unordered pairs of vertices . That is, each edge connects two vertices. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","support":[{"end":412,"quote":"A\ngraph\nwhose\nedges\nare\nunordered\npairs of\nvertices\n.  That is, each edge connects two vertices.\nFormal Definition:\nA graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow\nself-loops\n, adjacency is\nirreflexive\n, that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","source_id":"nist-dads.undirectedgraph","source_sha256":"4f9093840fbcf3e8be35fbfec2fa7e3e672519627fc06e4051f01f6030741281","start":63}],"target_id":"concept.nist.undirectedgraph","target_kind":"node","target_sha256":"fa255409445a5e73b91167012493808b3b24f0940b741627e5244d46bec54494"}],"concept.nist.uniformcircuitcomplexity":[{"id":"assertion.concept.nist.uniformcircuitcomplexity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform circuit complexity as: The study of complexity classes defined by uniform circuit families .","support":[{"end":148,"quote":"The study of\ncomplexity classes\ndefined by\nuniform circuit families\n.","source_id":"nist-dads.uniformcircuitcomplexity","source_sha256":"18b2b2de6ad3a8cb2afc272c92c4b591890e9c8cbc539322cb8b0bedfc6c1221","start":79}],"target_id":"concept.nist.uniformcircuitcomplexity","target_kind":"node","target_sha256":"b004720b7627e284b0e5a89bc2fafed26c2e0d556863e24d0d00b0692e8c5d80"}],"concept.nist.uniformcircuitfamily":[{"id":"assertion.concept.nist.uniformcircuitfamily","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform circuit family as: A sequence of circuits , one for each input length n, that can be efficiently generated by a Turing machine .","support":[{"end":180,"quote":"A sequence of\ncircuits\n, one for each input length n, that can be efficiently generated by a\nTuring machine\n.","source_id":"nist-dads.uniformcircuitfamily","source_sha256":"b1c824db603ad3ca5a15f7d3b6d79f3d462611b45e16ecf43bd112477faa08cf","start":71}],"target_id":"concept.nist.uniformcircuitfamily","target_kind":"node","target_sha256":"dac89e25680565145614e9a35878f7648ce2badc5feb50e6ff26f45bd15a85eb"}],"concept.nist.uniformmatrx":[{"id":"assertion.concept.nist.uniformmatrx","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform matrix as: A matrix having the same number of items in each row.","support":[{"end":112,"quote":"A\nmatrix\nhaving the same number of items in each row.","source_id":"nist-dads.uniformmatrx","source_sha256":"ac9c45c95f5aa4efbda27f2de799dca32baa181eb6f6198653823486ac7a17d4","start":59}],"target_id":"concept.nist.uniformmatrx","target_kind":"node","target_sha256":"5999c2d12b463f6b29f469e2ae3b03f566a674c4ae87fb6d76105d48e5adfca0"}],"concept.nist.union":[{"id":"assertion.concept.nist.union","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines union as: The union of two sets is a set having all members in either set.","support":[{"end":101,"quote":"The union of two\nsets\nis a set having all members in either set.","source_id":"nist-dads.union","source_sha256":"1898c159bf1c1476e50a82d92ceb656bc5f784574035e1eaa191536c9c419938","start":37}],"target_id":"concept.nist.union","target_kind":"node","target_sha256":"e5e8660b11c1ed1dc471205d6ad65174c55438ea822b8de7c23deb18b9a70c93"}],"concept.nist.universalhsh":[{"id":"assertion.concept.nist.universalhsh","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal hashing as: A scheme that chooses randomly from a set of hash functions .","support":[{"end":122,"quote":"A scheme that chooses randomly from a set of\nhash functions\n.","source_id":"nist-dads.universalhsh","source_sha256":"115f87d571c0f2da60e779fda3300205118d964180602db944786f25cc2b605e","start":61}],"target_id":"concept.nist.universalhsh","target_kind":"node","target_sha256":"20d63448ce4aab3a5bd197fb585fb7d83a1e0445316c7ccaf6a40e14c7956f4c"}],"concept.nist.universalstt":[{"id":"assertion.concept.nist.universalstt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal state as: A state in an alternating Turing machine from which the machine accepts only if all possible moves lead to acceptance.","support":[{"end":175,"quote":"A\nstate\nin an\nalternating Turing machine\nfrom which the machine accepts only if all possible moves lead to acceptance.","source_id":"nist-dads.universalstt","source_sha256":"34295a02ae457e2d57932bb605511701370a8062519b9b9cb983ecdc9439ecb3","start":57}],"target_id":"concept.nist.universalstt","target_kind":"node","target_sha256":"ddbfdc9947fb2a075f989f06d6824f1a4e5bb103e5ffa2eaf6d388226726b1a2"}],"concept.nist.universaltur":[{"id":"assertion.concept.nist.universaltur","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universal Turing machine as: A Turing machine that is capable of simulating any other Turing machine by encoding the latter.","support":[{"end":170,"quote":"A\nTuring machine\nthat is capable of simulating any other Turing machine by encoding the latter.","source_id":"nist-dads.universaltur","source_sha256":"caf7eac6e9e3828f2b2beb008a51979a0ed1588d07beda675a64b4598b391b68","start":75}],"target_id":"concept.nist.universaltur","target_kind":"node","target_sha256":"724ef010af147d3906b37b07036611b8766c83c7d1c478f8e7290a78fc46b745"}],"concept.nist.universe":[{"id":"assertion.concept.nist.universe","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines universe as: All potential elements of a set .","support":[{"end":76,"quote":"All potential elements of a\nset\n.","source_id":"nist-dads.universe","source_sha256":"7c8501517a1c564500b8975b1e5383e64191d33ca9756f73bf948283d893864b","start":43}],"target_id":"concept.nist.universe","target_kind":"node","target_sha256":"a794d43807753ce3158143773430775d8a941155217d9c476ec1cd8c18283757"}],"concept.nist.unlimitedbranchingtree":[{"id":"assertion.concept.nist.unlimitedbranchingtree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unlimited branching tree as: A forest of ordered trees used to contain ordered lists . The root of each tree is unique. An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element). Lists with common prefixes share nodes. The last node in common has one child for each list. This allows rapid searches for subset inclusion of sequences.","support":[{"end":447,"quote":"A\nforest\nof\nordered trees\nused to contain ordered\nlists\n.  The\nroot\nof each tree is unique.  An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element).  Lists with common\nprefixes\nshare nodes.  The last node in common has one\nchild\nfor each list. This allows rapid searches for\nsubset\ninclusion of sequences.","source_id":"nist-dads.unlimitedbranchingtree","source_sha256":"d6db14c8f251730428c86482ccf2607b94eda08776695fe107b703461158cb5b","start":79}],"target_id":"concept.nist.unlimitedbranchingtree","target_kind":"node","target_sha256":"b8c04fa293e3fb4bf15fab1f705a35e31966ef56c471c5248e39b8f139df2b96"}],"concept.nist.unsolvableproblem":[{"id":"assertion.concept.nist.unsolvableproblem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unsolvable problem as: A computational problem that cannot be solved by a Turing machine . The associated function is called an uncomputable function .","support":[{"end":192,"quote":"A computational problem that cannot be solved by a\nTuring machine\n.  The associated function is called an\nuncomputable function\n.","source_id":"nist-dads.unsolvableproblem","source_sha256":"cce18e6a43b7f23830f0dce2a6105c64fa43ed99af9dc690bdef0d7342fb4658","start":63}],"target_id":"concept.nist.unsolvableproblem","target_kind":"node","target_sha256":"71771254a3051db5938c6c94eaf760e14c38535867d84f818bf47307e8c1acbf"}],"concept.nist.unsortedlist":[{"id":"assertion.concept.nist.unsortedlist","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unsorted list as: A list whose order of items, if any, is not known.","support":[{"end":103,"quote":"A\nlist\nwhose order of items, if any, is not known.","source_id":"nist-dads.unsortedlist","source_sha256":"aeabf63de49483d9e626d945a6af534f2c3daebb4196785c1a77cb57d723a7d1","start":53}],"target_id":"concept.nist.unsortedlist","target_kind":"node","target_sha256":"5c48977f50f2a2a1da617db2ca702c0e5494d78eac16ba5f185eeede13063a58"}],"concept.nist.uppertriangularmatrix":[{"id":"assertion.concept.nist.uppertriangularmatrix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines upper triangular matrix as: A matrix that is only defined at (i,j) when i ≤ j.","support":[{"end":127,"quote":"A\nmatrix\nthat is only defined at (i,j) when i ≤ j.","source_id":"nist-dads.uppertriangularmatrix","source_sha256":"c6bb618f83667613d92a3a4594ceb29e0b5dacc31232c2826495c508ee7a2d00","start":77}],"target_id":"concept.nist.uppertriangularmatrix","target_kind":"node","target_sha256":"a64a3fdc2e448165e2b6fc2ca082170749bb9eeecefef18b07532fc21dc82b30"}],"concept.nist.vanemdeboas":[{"id":"assertion.concept.nist.vanemdeboas","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines van Emde-Boas priority queue as: An efficient implementation of priority queues where insert, delete, get minimum, get maximum, etc. take O(log log N) time, where N is the total possible number of keys . Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a bit vector of size N (if N is small), or a special data structure : an array of priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","support":[{"end":576,"quote":"An efficient implementation of\npriority queues\nwhere insert, delete, get minimum, get maximum, etc. take\nO(log log N)\ntime, where N is the total possible number of\nkeys\n.  Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a\nbit vector\nof size N (if N is small), or a special\ndata structure\n: an\narray\nof priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","source_id":"nist-dads.vanemdeboas","source_sha256":"f1e411601ab99bfa11e7e406b87705196c6c68cea983526606adbc27257def98","start":87}],"target_id":"concept.nist.vanemdeboas","target_kind":"node","target_sha256":"43ec86e07d92ff02678e0e652cacf412b966db67e1e71f01b18f8ee6152ef020"}],"concept.nist.vehiclerouting":[{"id":"assertion.concept.nist.vehiclerouting","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vehicle routing problem as: Find an optimal route of one or more vehicles through a graph . Also known as VRP.","support":[{"end":160,"quote":"Find an\noptimal\nroute of one or more vehicles through a\ngraph\n.\nAlso known as\nVRP.","source_id":"nist-dads.vehiclerouting","source_sha256":"411e7f5d683ab9ab49b40709ccefef289290f803834e449c066cd17d0f189d23","start":78}],"target_id":"concept.nist.vehiclerouting","target_kind":"node","target_sha256":"48e55af93a5f5c9a7b3473485765f68a082de7caffa9d7b5ae19d986d635e83a"}],"concept.nist.venndiagram":[{"id":"assertion.concept.nist.venndiagram","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Venn diagram as: A visual depiction of membership in sets according to binary properties, using overlapping ovals to divide the plane into regions. Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","support":[{"end":457,"quote":"A visual depiction of membership in\nsets\naccording to binary properties, using overlapping ovals to divide the plane into regions.  Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","source_id":"nist-dads.venndiagram","source_sha256":"803a6b2e03d185e71c6eb123412059f7ffbcecd981192372f7d1f75c724213c5","start":51}],"target_id":"concept.nist.venndiagram","target_kind":"node","target_sha256":"fe0fa1bd51ee2a2a5e8cca53d6e3992827063ab4b67ce3e9280f5f591e6a4f50"}],"concept.nist.vertex":[{"id":"assertion.concept.nist.vertex","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines vertex as: An item in a graph . Sometimes referred to as a node .","support":[{"end":94,"quote":"An item in a\ngraph\n.  Sometimes referred to as a\nnode\n.","source_id":"nist-dads.vertex","source_sha256":"ccb68045cc292c76261e2588cca2340a6375c508f723e108cf291f4b772b707d","start":39}],"target_id":"concept.nist.vertex","target_kind":"node","target_sha256":"f73e74e3369fb8f09baf07b47bd888eddc0841e4b777ec170821ff58910312f4"}],"concept.nist.vertexcolor":[{"id":"assertion.concept.nist.vertexcolor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex coloring as: An assignment of colors (or any distinct marks) to the vertices of a graph . Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.","support":[{"end":223,"quote":"An assignment of colors (or any distinct marks) to the\nvertices\nof a\ngraph\n.  Strictly speaking, a coloring is\nproper\nif no two\nadjacent\nvertices have the same color.","source_id":"nist-dads.vertexcolor","source_sha256":"5d4167924d33971a2ce9502fc5eb5a5e40f1173cf891b41182436b95b1fa38dd","start":57}],"target_id":"concept.nist.vertexcolor","target_kind":"node","target_sha256":"2050fbd5534224077f4e7326c5ba69e0f6275c8f27f2d08824188a8276f02eec"}],"concept.nist.vertexconnectivity":[{"id":"assertion.concept.nist.vertexconnectivity","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex connectivity as: (1) The smallest number of vertices whose deletion causes a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","support":[{"end":280,"quote":"(1) The smallest number of\nvertices\nwhose deletion causes a\nconnected graph\nto not be connected.  (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","source_id":"nist-dads.vertexconnectivity","source_sha256":"de69de8e2064236224701e3a1cae6fe1d06a9a9061e27bdc4b44e6d9bcf7411c","start":65}],"target_id":"concept.nist.vertexconnectivity","target_kind":"node","target_sha256":"4938290bc6b74212db0de262837d81a00cb7218b014d22ba8a2ebdba873c8241"}],"concept.nist.vertexcover":[{"id":"assertion.concept.nist.vertexcover","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertex cover as: A set of vertices in an undirected graph where every edge connects at least one vertex. The vertex cover problem is to find a minimum size set and is NP-complete .","support":[{"end":220,"quote":"A set of\nvertices\nin an\nundirected graph\nwhere every\nedge\nconnects at least one vertex.  The vertex cover problem is to find a minimum size set and is\nNP-complete\n.","source_id":"nist-dads.vertexcover","source_sha256":"5082fe7cc28fad53aa868fb5f19bcdafc75700a47dd24c7f0db7062dcdf8d5a4","start":56}],"target_id":"concept.nist.vertexcover","target_kind":"node","target_sha256":"e42e2d057fe1e6ac43cfa2cd8933eb74dbd9928bba4c45934812c70f57cbe5b2"}],"concept.nist.vertical":[{"id":"assertion.concept.nist.vertical","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines vertical visibility map as: A partition of the plane into regions by drawing a vertical straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be vertically visible from p.","support":[{"end":320,"quote":"A partition of the plane into regions by drawing a vertical straight line through each\nvertex\np of a planar straight-line\ngraph\nuntil it intersects an\nedge\ne of the graph or extends to infinity.  The edge e is said to be vertically visible from p.","source_id":"nist-dads.vertical","source_sha256":"806e1dfdc1a3f31f7e35c7a8c0888df8504225e1bfe405373095512b26f379f2","start":73}],"target_id":"concept.nist.vertical","target_kind":"node","target_sha256":"c5ec7847f6c32ddba08cfedfe8589c258a43a9b6f1c8cabf6321fe6bb0127fcd"}],"concept.nist.visibilitymap":[{"id":"assertion.concept.nist.visibilitymap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines visibility map as: A planar subdivision that encodes the visibility information, that is, which points are mutually visible .","support":[{"end":161,"quote":"A planar subdivision that encodes the visibility information, that is, which points are mutually\nvisible\n.","source_id":"nist-dads.visibilitymap","source_sha256":"4df75a02892e4fe3de521f29e79cfa15e69b410e10dbad06662dcd8d18a8bb36","start":55}],"target_id":"concept.nist.visibilitymap","target_kind":"node","target_sha256":"b463216ee09b23428febba5d6a83cb5c6610aba7c7dc8349673486db1ddbafa8"}],"concept.nist.visible":[{"id":"assertion.concept.nist.visible","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines visible as: Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","support":[{"end":161,"quote":"Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","source_id":"nist-dads.visible","source_sha256":"f442372f24ae1efab7fa04659cae07bd13f554bb9bb2c067a8fb6d255bfb5951","start":41}],"target_id":"concept.nist.visible","target_kind":"node","target_sha256":"eac74b5c99da10f728de2dcde6b6facb356c523cbc58fb5ace5ee8e29f7b82da"}],"concept.nist.walk":[{"id":"assertion.concept.nist.walk","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines walk as: A path in which edges may be repeated.","support":[{"end":73,"quote":"A\npath\nin which\nedges\nmay be repeated.","source_id":"nist-dads.walk","source_sha256":"466e5a0022cf426ec41d83f929d6328bb297f59c3e05365d6a4b25ba1f297fad","start":35}],"target_id":"concept.nist.walk","target_kind":"node","target_sha256":"c5ef08f40605db763ea697e47c46d2f53a4674cfd08c9a21a2b58e318499e5c6"}],"concept.nist.weakheap":[{"id":"assertion.concept.nist.weakheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weak-heap as: A relaxed heap satisfying the following three conditions: (1) every key in the right subtree of a node is greater than the key stored in the node itself, (2) the root has no left child , and (3) leaves are only found on the last two levels of the tree.","support":[{"end":307,"quote":"A relaxed\nheap\nsatisfying the following three conditions: (1) every\nkey\nin the right subtree of a\nnode\nis greater      than the key stored in the node itself,  (2) the\nroot\nhas no left\nchild\n, and (3)\nleaves\nare only found on the last two\nlevels\nof the tree.","source_id":"nist-dads.weakheap","source_sha256":"3edbcc6dcbee8c6666f8c6b2f0957b6e4295062b79885d90416394ad5f6d3dee","start":49}],"target_id":"concept.nist.weakheap","target_kind":"node","target_sha256":"63f2d9df367f79f47b6135306a12a4924fdbe839f23179d4b8d975b9b6747d72"}],"concept.nist.weighteddigraph":[{"id":"assertion.concept.nist.weighteddigraph","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weighted, directed graph as: A directed graph that has a weight, or numeric value, associated with each edge .","support":[{"end":156,"quote":"A\ndirected graph\nthat has a weight, or numeric value, associated with each\nedge\n.","source_id":"nist-dads.weighteddigraph","source_sha256":"ca711cf15484e11713bcbe0e877d3aa2032c5b73f3ac95958830821ef12c2917","start":75}],"target_id":"concept.nist.weighteddigraph","target_kind":"node","target_sha256":"9912d9a3164219ebeb2ee8e2f4e3b717ee9892284043efbdb4e0a96a040eb279"}],"concept.nist.weightedgraph":[{"id":"assertion.concept.nist.weightedgraph","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines weighted graph as: A graph having a weight, or number, associated with each edge . Some algorithms require all weights to be nonnegative, integral, positive, etc. Also known as edge-weighted graph.","support":[{"end":234,"quote":"A\ngraph\nhaving a weight, or number, associated with each\nedge\n.  Some algorithms require all weights to be nonnegative, integral, positive, etc.\nAlso known as\nedge-weighted graph.","source_id":"nist-dads.weightedgraph","source_sha256":"7ab149a777d9c9a5ab45a7462ff944eb47ec011d6f35e9b481e1aaec7db7064a","start":55}],"target_id":"concept.nist.weightedgraph","target_kind":"node","target_sha256":"1ab0db6ab8636712447cdc557b8aae95d8f124dd875b3985aab4307a74ff3ee3"}],"concept.nist.window":[{"id":"assertion.concept.nist.window","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines window as: substring of the text that is aligned with the pattern .","support":[{"end":95,"quote":"substring\nof the\ntext\nthat is aligned with the\npattern\n.","source_id":"nist-dads.window","source_sha256":"b8a12053855a784e65b98160b6bc7faf216149bb2399fdbd6bd1f4dc8fb7aa98","start":39}],"target_id":"concept.nist.window","target_kind":"node","target_sha256":"df5491448f28f511f27396ddd7d84e6423cbf4e4c2e24bd389088be2bcaf882c"}],"concept.nist.witness":[{"id":"assertion.concept.nist.witness","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines witness as: (1) a structure providing an easily verified bound on the optimal value of an optimization problem . Typically used in the analysis of an approximation algorithm to prove the performance guarantee . (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","support":[{"end":452,"quote":"(1) a structure providing an easily verified bound on the\noptimal value\nof an\noptimization problem\n.  Typically used in the analysis of an\napproximation algorithm\nto prove the\nperformance guarantee\n. (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","source_id":"nist-dads.witness","source_sha256":"ed062b1b19a9f92beee49f16cc9268f6fd05307148554cfb089ba46af2477c53","start":41}],"target_id":"concept.nist.witness","target_kind":"node","target_sha256":"5dcc9b3481e7be4945bb70bb5a9d34e4af1e19823598821a82c4791cad1042a8"}],"concept.nist.work":[{"id":"assertion.concept.nist.work","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work as: The total number of operations taken by a computation.","support":[{"end":89,"quote":"The total number of operations taken by a computation.","source_id":"nist-dads.work","source_sha256":"6d9de56ae424e6da2b8fd040b27eb6b3eafb49851231c8304d5e715b56f819db","start":35}],"target_id":"concept.nist.work","target_kind":"node","target_sha256":"f1d1e9cca0d1eb0ec4d488862d36ce73675904c9e815f295821602b2cd844985"}],"concept.nist.workdepthmdl":[{"id":"assertion.concept.nist.workdepthmdl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-depth model as: A model of parallel computation in which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","support":[{"end":211,"quote":"A\nmodel of parallel computation\nin which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","source_id":"nist-dads.workdepthmdl","source_sha256":"32600e077c1e37431859671e951f5401649a356e12c5ad3da082ecf0cdebc15b","start":59}],"target_id":"concept.nist.workdepthmdl","target_kind":"node","target_sha256":"ca6a4c014c606ab55479b5ac6c4dd85512c8b54256da5a3c57920396798d6832"}],"concept.nist.workefficint":[{"id":"assertion.concept.nist.workefficint","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-efficient as: A parallel algorithm which asymptotically requires at most a constant factor more work than the best known sequential algorithm or the optimal work.","support":[{"end":203,"quote":"A parallel\nalgorithm\nwhich asymptotically requires at most a constant factor more\nwork\nthan the best known sequential algorithm or the\noptimal\nwork.","source_id":"nist-dads.workefficint","source_sha256":"e0c07c094387fafbdc0c00b10f5e2d45e7be80d518601911061feb68b5dd089f","start":55}],"target_id":"concept.nist.workefficint","target_kind":"node","target_sha256":"9d95f70cf86e5bfbd55ce8ecab522da396cf4a033fb9bec369186996ba53ac2d"}],"concept.nist.workpreserv":[{"id":"assertion.concept.nist.workpreserv","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines work-preserving as: A translation of an algorithm from one model of computation to another in which the work is the same in both models, to within a constant factor.","support":[{"end":202,"quote":"A translation of an\nalgorithm\nfrom one\nmodel of computation\nto another in which the\nwork\nis the same in both models, to within a constant factor.","source_id":"nist-dads.workpreserv","source_sha256":"e897a90639b4f18e917d2b28bb05e4fe33e628c889da7d92e153183dad61ab93","start":57}],"target_id":"concept.nist.workpreserv","target_kind":"node","target_sha256":"ffd5b22f567bf4f08718b07e9165f2c1581d7cbcd03376be2b6b80e922b1d2e4"}],"concept.nist.worstcase":[{"id":"assertion.concept.nist.worstcase","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst case as: (1) The situation or input that forces an algorithm or data structure to take the most time or resources. (2) Having to do with this situation or input.","support":[{"end":199,"quote":"(1) The situation or input that forces an\nalgorithm\nor\ndata structure\nto take the most time or resources. (2) Having to do with this situation or input.","source_id":"nist-dads.worstcase","source_sha256":"0878aa469483326267f2bf0709b75b40e0ecbb94022bb0fded7fccae885c998a","start":47}],"target_id":"concept.nist.worstcase","target_kind":"node","target_sha256":"6799fab7ee22ee07b65480749e594ba6f2ad258d12ff3928db14a383dfc336df"}],"concept.nist.worstcasecost":[{"id":"assertion.concept.nist.worstcasecost","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case cost as: The highest possible use of resources of an algorithm , which occurs for the most pessimistic, or worst possible, input.","support":[{"end":177,"quote":"The highest possible use of resources of an\nalgorithm\n, which occurs for the most pessimistic, or worst possible, input.","source_id":"nist-dads.worstcasecost","source_sha256":"eb75b4afd382953bf80b4bdcb5757e26e2bcafcfe4275ec9a1c1018620fd4975","start":57}],"target_id":"concept.nist.worstcasecost","target_kind":"node","target_sha256":"bb4c2fd11695bd13e71255efe3dc3218f0a0f92108068054ddeddbfa4f8afd5a"}],"concept.nist.worstcaseexecutiontime":[{"id":"assertion.concept.nist.worstcaseexecutiontime","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case execution time as: The execution time of an algorithm in the worst case . Also known as WCET.","support":[{"end":151,"quote":"The execution time of an\nalgorithm\nin the\nworst case\n.\nAlso known as\nWCET.","source_id":"nist-dads.worstcaseexecutiontime","source_sha256":"337fe93f15547de28f309d866ffc9bc798673f79a55eb6f13a10746bc44f7a2d","start":77}],"target_id":"concept.nist.worstcaseexecutiontime","target_kind":"node","target_sha256":"a2c5c2ff318114609837c4c9da7c7fd3f3f04760c12d3cd33d59b595c3670176"}],"concept.nist.worstcaseminimumaccess":[{"id":"assertion.concept.nist.worstcaseminimumaccess","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines worst-case minimum access as: A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the worst case .","support":[{"end":197,"quote":"A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the\nworst case\n.","source_id":"nist-dads.worstcaseminimumaccess","source_sha256":"6565125455858c733024d96be5ac6b24ef9fcc0734647dd83e499497634694cd","start":77}],"target_id":"concept.nist.worstcaseminimumaccess","target_kind":"node","target_sha256":"83aac529f3be0425a2af55acad61361ef461c67b18af644637c14203b91c9c6b"}],"concept.nist.xor":[{"id":"assertion.concept.nist.xor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines xor as: \"Exclusive OR\" or \"not equal to\" function: 0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0. Also known as exclusive or.","support":[{"end":156,"quote":"\"Exclusive OR\" or \"not equal to\" function:  0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0.\nAlso known as\nexclusive or.","source_id":"nist-dads.xor","source_sha256":"be7013e771be17dc9c76beb32237894b8d3a1e7d978bbaefd3265038cd42ff96","start":33}],"target_id":"concept.nist.xor","target_kind":"node","target_sha256":"c5bbc076186ac340c4e2ec70a40f5badfe4fb16b1d49809127de5d9e00ff40cc"}],"concept.nist.zeroaryfunc":[{"id":"assertion.concept.nist.zeroaryfunc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 0-ary function as: A function that takes no arguments. Also known as nullary function.","support":[{"end":122,"quote":"A\nfunction\nthat takes no arguments.\nAlso known as\nnullary function.","source_id":"nist-dads.zeroaryfunc","source_sha256":"68a2936758ae36a87ec9d46b612c3e268198cae82f2db9e30dee7dade199b721","start":55}],"target_id":"concept.nist.zeroaryfunc","target_kind":"node","target_sha256":"b5eabc38bbc3575f51f6f5791c35c9b80beec80f048ba0853ba6225cc575bc79"}],"concept.nist.zerobasedindexing":[{"id":"assertion.concept.nist.zerobasedindexing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines 0-based indexing as: Indexing (an array ) beginning with 0.","support":[{"end":97,"quote":"Indexing (an\narray\n) beginning with 0.","source_id":"nist-dads.zerobasedindexing","source_sha256":"e8718c0dbc0f9b5b720f30b22ae5f5caf74dc66a25ffb26d1d10c543714263eb","start":59}],"target_id":"concept.nist.zerobasedindexing","target_kind":"node","target_sha256":"45f52d3c0d555e80fef2ff7d705538bfe81e168ef3942a16e304c4f0c92f6174"}],"concept.nist.zipfian":[{"id":"assertion.concept.nist.zipfian","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zipfian distribution as: A distribution of probabilities of occurrence that follows Zipf's law . Also known as Yule distribution.","support":[{"end":171,"quote":"A distribution of probabilities of occurrence that follows\nZipf's law\n.\nAlso known as\nYule distribution.","source_id":"nist-dads.zipfian","source_sha256":"8c910cf37dbb429ef56871c53b7a5120b74eb6ce333ac64d7dbae88e19363044","start":67}],"target_id":"concept.nist.zipfian","target_kind":"node","target_sha256":"5bc6b612a4e92e49b16c75ed5d61f75ec64f01088993ed409f0f75aa4f54a544"}],"concept.nist.zipper":[{"id":"assertion.concept.nist.zipper","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines zipper as: A data structure equivalent to a binary tree that is \"opened\" so that some node is accessible. It consists of a pair: the current node, along with information to reconstruct the tree. Reconstruction information is called the path or context. A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path. A similar operation moves to the right child. A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","support":[{"end":640,"quote":"A data structure equivalent to a\nbinary tree\nthat is \"opened\" so that some\nnode\nis accessible.  It consists of a pair: the current node, along with information to reconstruct the tree.  Reconstruction information is called the path or context.  A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path.  A similar operation moves to the right child.  A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","source_id":"nist-dads.zipper","source_sha256":"476c0690ec2c658548ca35052c19429ad974c6136802937b78133882beed4414","start":43}],"target_id":"concept.nist.zipper","target_kind":"node","target_sha256":"1988e758ad6ccc9983c36184489626f8077e88be1c2e67de8e5d89e9dd344f2c"}],"concept.nist.zpp":[{"id":"assertion.concept.nist.zpp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ZPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \" Z ero error P robability in P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that halts in polynomial time . M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","support":[{"end":505,"quote":"The class of\nlanguages\nfor which a membership computation by a\nprobabilistic Turing machine\nhalts in\npolynomial time\nwith no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \"\nZ\nero error\nP\nrobability in\nP\nolynomial\" time.\nFormal Definition:\nFor a language, S, there exists a\nprobabilistic Turing machine\n, M, that halts in\npolynomial time\n.  M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","source_id":"nist-dads.zpp","source_sha256":"1eb4d48640b0c44e545883851bb7e7bae3b435f264ec55d07df1f3cc07df22f1","start":33}],"target_id":"concept.nist.zpp","target_kind":"node","target_sha256":"94ef8078bc45ed461ff9e85602ab472ace4a02f9a00b05759205374f46346eb9"}],"concept.null-result-constraint":[{"id":"assertion.complete.concept.null-result-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP search reports no excess above expected backgrounds and places conditional limits on WIMP-nucleon cross sections. A bounded exclusion is the outcome described here.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.null-result-constraint","target_kind":"node","target_sha256":"74c8f32c706d64e057bc6214dd5bbecba112958a691e2ea3d795bdb28e2361c8"}],"concept.planetmath.abeliangroup":[{"id":"assertion.concept.planetmath.abeliangroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Abelian group as stated in the captured PlanetMath entry abeliangroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20K99) states: Let ( G , * ) be a group. If for any a , b ∈ G we have a * b = b * a , we say that the group is abelian (or commutative ).","support":[{"end":150,"quote":"Let\n(\nG\n,\n*\n)\nbe a group. If for any\na\n,\nb\n∈\nG\nwe have\na\n*\nb\n=\nb\n*\na\n, we say that the group is\nabelian\n(or\ncommutative\n).","source_id":"planetmath.abeliangroup","source_sha256":"e84c1edb33261a2e634b196ad714e7709088e3a3b05a73c8e83616408766b223","start":28}],"target_id":"concept.planetmath.abeliangroup","target_kind":"node","target_sha256":"b62694a61804a23b522e5594d1fd47ee16588808fa2a7fa906d2da9af04108a4"}],"concept.planetmath.absolutevalue":[{"id":"assertion.concept.planetmath.absolutevalue","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Absolute value as stated in the captured PlanetMath entry absolutevalue","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13-00, 11A15) states: Let R be an ordered ring and let a ∈ R . The absolute value of a is defined to be the function | | : R → R given by | a | := { a if ⁢ a ≥ 0 , - a otherwise.","support":[{"end":186,"quote":"Let\nR\nbe an\nordered ring\nand let\na\n∈\nR\n. The\nabsolute value\nof\na\nis defined to be the\nfunction\n|\n|\n:\nR\n→\nR\ngiven by\n|\na\n|\n:=\n{\na\nif\n⁢\na\n≥\n0\n,\n-\na\notherwise.","source_id":"planetmath.absolutevalue","source_sha256":"22eac82afc6473814dc632829398291d096d5ff6eba482bff1b43ffcf7f98329","start":30}],"target_id":"concept.planetmath.absolutevalue","target_kind":"node","target_sha256":"fa6941c06255e9dff5c5418c910f8e0631960b847d9f4e0b06c9d37d59bc6ad0"}],"concept.planetmath.absolutevalueinavectorlattice":[{"id":"assertion.concept.planetmath.absolutevalueinavectorlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Absolute value in a vector lattice as stated in the captured PlanetMath entry absolutevalueinavectorlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A40, 06F20) states: Let V be a vector lattice over ℝ , and V + be its positive cone .","support":[{"end":135,"quote":"Let\nV\nbe a\nvector lattice\nover\nℝ\n, and\nV\n+\nbe its\npositive cone\n.","source_id":"planetmath.absolutevalueinavectorlattice","source_sha256":"dbd6a022fb3f74146a3390eaa2c25c8937aa85614e57395257ceaff10459c79b","start":70}],"target_id":"concept.planetmath.absolutevalueinavectorlattice","target_kind":"node","target_sha256":"0067ec16cbff2eab1f0129573cbee1dfcbde3e8008e0521a21c606f861719607"}],"concept.planetmath.ackermannfunction":[{"id":"assertion.concept.planetmath.ackermannfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ackermann function as stated in the captured PlanetMath entry ackermannfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D75) states: Ackermann’s function A ⁢ ( x , y ) is defined by the recurrence relations A ⁢ ( 0 , y ) = y + 1 A ⁢ ( x + 1 , 0 ) = A ⁢ ( x , 1 ) A ⁢ ( x + 1 , y + 1 ) = A ⁢ ( x , A ⁢ ( x + 1 , y ) ) Ackermann’s function is an example of a recursive function that is not primitive recursive , but is instead μ - recursive (that is, Turing-computable ).","support":[{"end":374,"quote":"Ackermann’s\nfunction\nA\n⁢\n(\nx\n,\ny\n)\nis defined by the\nrecurrence relations\nA\n⁢\n(\n0\n,\ny\n)\n=\ny\n+\n1\nA\n⁢\n(\nx\n+\n1\n,\n0\n)\n=\nA\n⁢\n(\nx\n,\n1\n)\nA\n⁢\n(\nx\n+\n1\n,\ny\n+\n1\n)\n=\nA\n⁢\n(\nx\n,\nA\n⁢\n(\nx\n+\n1\n,\ny\n)\n)\nAckermann’s function is an example of a\nrecursive function\nthat is not\nprimitive recursive\n, but is instead\nμ\n-\nrecursive\n(that is,\nTuring-computable\n).","source_id":"planetmath.ackermannfunction","source_sha256":"c19855f6ca02b81858bb3b9bc04bd2a3b3e05839168ff0dcf7e83f88165ed344","start":38}],"target_id":"concept.planetmath.ackermannfunction","target_kind":"node","target_sha256":"4f03852f8641397568def135923d6deb22a605e279a3c2d37e64ff57ab03eea0"}],"concept.planetmath.addition":[{"id":"assertion.concept.planetmath.addition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Addition as stated in the captured PlanetMath entry addition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11B25, 00A06, 00A05) states: Addition is a mathematical operation in which two or more numbers are added up.","support":[{"end":97,"quote":"Addition\nis a mathematical\noperation\nin which two or more numbers are added up.","source_id":"planetmath.addition","source_sha256":"e703184a966d6b782bee0f9279d909c909b14e2a6dd3317cd6860b1a3a56f0c3","start":18}],"target_id":"concept.planetmath.addition","target_kind":"node","target_sha256":"1b4eb07e1d50589fc31b5f183a7f9af5b46994dd83bc5eba9fd676a4d4b196ec"}],"concept.planetmath.additive":[{"id":"assertion.concept.planetmath.additive","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Additive as stated in the captured PlanetMath entry additive","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let ϕ be some positive-valued set function defined on an algebra of sets 𝒜 .","support":[{"end":94,"quote":"Let\nϕ\nbe some positive-valued\nset function\ndefined on an\nalgebra of sets\n𝒜\n.","source_id":"planetmath.additive","source_sha256":"85d802640c74ec79d3667c49899cfb659a025bd2bd8a15a5967e9db62d1940ea","start":18}],"target_id":"concept.planetmath.additive","target_kind":"node","target_sha256":"4024b40cb453e4a1dec12abcb2fac7dd49122f6724e8e6ec0496a94279480e93"}],"concept.planetmath.adjointendomorphism":[{"id":"assertion.concept.planetmath.adjointendomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Adjoint endomorphism as stated in the captured PlanetMath entry adjointendomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04, 15A63) states: Definition (the bilinear case). Let U be a finite-dimensional vector space over a field 𝕂 , and B : U × U → 𝕂 a symmetric , non-degenerate bilinear mapping , for example a real inner product .","support":[{"end":234,"quote":"Definition (the bilinear case).\nLet\nU\nbe a\nfinite-dimensional\nvector space\nover a field\n𝕂\n, and\nB\n:\nU\n×\nU\n→\n𝕂\na\nsymmetric\n,\nnon-degenerate\nbilinear mapping\n, for example\na real\ninner product\n.","source_id":"planetmath.adjointendomorphism","source_sha256":"cc6f074357b9f08a981ceb5b2cdf4f0d0ecea2a2fc5ed5f5ae5eb85da17b5715","start":42}],"target_id":"concept.planetmath.adjointendomorphism","target_kind":"node","target_sha256":"64c1f90fb5bf6b1f685fb874fbd3c85faf41ba36e62bf4254820fec0da8f3485"}],"concept.planetmath.algebraicgeometry":[{"id":"assertion.concept.planetmath.algebraicgeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Algebraic geometry as stated in the captured PlanetMath entry algebraicgeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 14-00) states: Introduction Algebraic geometry is the study of algebraic objects using geometrical tools.","support":[{"end":128,"quote":"Introduction\nAlgebraic geometry\nis the study of\nalgebraic\nobjects using geometrical tools.","source_id":"planetmath.algebraicgeometry","source_sha256":"bc628fa5e68d473b3df7a22847f4ceb1dc06d8c6408c61d346a3dc7b225ed86f","start":38}],"target_id":"concept.planetmath.algebraicgeometry","target_kind":"node","target_sha256":"dc71f8c4a3af149a66e5a46447eae6d8cabb741d25f4b2fd335c82c69a84b6dd"}],"concept.planetmath.algebraicsystem":[{"id":"assertion.concept.planetmath.algebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Algebraic system as stated in the captured PlanetMath entry algebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A05, 03E99, 08A62) states: An algebraic system , loosely speaking, is a set, together with some operations on the set.","support":[{"end":125,"quote":"An\nalgebraic system\n, loosely speaking, is a set, together with some\noperations\non the set.","source_id":"planetmath.algebraicsystem","source_sha256":"fb1c27cd75bdbee2a9ab4f391372e15749b078f2e79b06e0c30539a3320e9584","start":34}],"target_id":"concept.planetmath.algebraicsystem","target_kind":"node","target_sha256":"65dcf20c77cf49789d055f3e82457c01c1e65d6dd7a123330362086c458c5544"}],"concept.planetmath.alternatingform":[{"id":"assertion.concept.planetmath.alternatingform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Alternating form as stated in the captured PlanetMath entry alternatingform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A63) states: A bilinear form A on a vector space V (over a field k ) is called an alternating form if for all v ∈ V , A ⁢ ( v , v ) = 0 .","support":[{"end":158,"quote":"A\nbilinear form\nA\non a\nvector space\nV\n(over a field\nk\n) is called an\nalternating form\nif for all\nv\n∈\nV\n,\nA\n⁢\n(\nv\n,\nv\n)\n=\n0\n.","source_id":"planetmath.alternatingform","source_sha256":"1e7f36f89fc94d70a0cf54ae0690009606bb2d040a1939a26d96067f65134949","start":34}],"target_id":"concept.planetmath.alternatingform","target_kind":"node","target_sha256":"b989858864896382581054fdc3f743437151f5364dfaf6c41a0381f8499c8d8f"}],"concept.planetmath.alternativecharacterizationsofrecursivefunctions":[{"id":"assertion.concept.planetmath.alternativecharacterizationsofrecursivefunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Alternative characterizations of recursive functions as stated in the captured PlanetMath entry alternativecharacterizationsofrecursivefunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03D20) states: The class of recursive functions may be characterized by considerably weaker conditions than those given in the entry “recursive function ( http://planetmath.org/RecursiveFunction )” of this encyclopaedia.","support":[{"end":311,"quote":"The class of\nrecursive functions\nmay be characterized by considerably weaker conditions than those given in the entry “recursive function (\nhttp://planetmath.org/RecursiveFunction\n)” of this encyclopaedia.","source_id":"planetmath.alternativecharacterizationsofrecursivefunctions","source_sha256":"7ff075fdbaccebc58a128ecc9ee09b6cf133afc8beadd8b321d812635af554b9","start":106}],"target_id":"concept.planetmath.alternativecharacterizationsofrecursivefunctions","target_kind":"node","target_sha256":"5d53b64282632074aaaa1fd4ce7f5563b39160ac4c31fe20091090cc5181c520"}],"concept.planetmath.ampheck":[{"id":"assertion.concept.planetmath.ampheck","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ampheck as stated in the captured PlanetMath entry ampheck","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05, 03-03, 01A55) states: Ampheck , from the Greek α ⁢ μ ⁢ ϕ ⁢ η ⁢ κ ⁢ η ⁢ ς , double-edged , is a term coined by Charles Sanders Peirce for either one of the pair of logically dual operators , variously referred to as Peirce arrows , Sheffer strokes , or logical NAND and logical NNOR.","support":[{"end":276,"quote":"Ampheck\n, from the Greek\nα\n⁢\nμ\n⁢\nϕ\n⁢\nη\n⁢\nκ\n⁢\nη\n⁢\nς\n,\ndouble-edged\n, is a term coined by\nCharles Sanders Peirce\nfor either one of the pair of logically dual\noperators\n, variously referred to as\nPeirce arrows\n,\nSheffer strokes\n, or logical NAND and logical NNOR.","source_id":"planetmath.ampheck","source_sha256":"175c1227008208bc05882fd4c057e431cb99e6c010f5d3885d87bc6ce49fd732","start":16}],"target_id":"concept.planetmath.ampheck","target_kind":"node","target_sha256":"612cf6f2439ed235bc7389c3956c43dc275c454e3cfa53a6cb48860fa726f2ff"}],"concept.planetmath.amsmscclassificationofarticlesandconversiontables":[{"id":"assertion.concept.planetmath.amsmscclassificationofarticlesandconversiontables","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"AMS MSC classification of articles and conversion tables as stated in the captured PlanetMath entry amsmscclassificationofarticlesandconversiontables","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 00-02, 00-01) states: 1 Links to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website Because the AMS MSC classification list or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the complete Table of AMS MSC2010 classifications: http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf All MSC 2010 in one PDF : http://www.ams.org/mathscinet/msc/msc2010.html The AMS MSC website with its maths specialized Search Engine 1.1 Conversion Tables http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf CONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000 M ⁢ S ⁢ C ⁢ 2000 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s → M ⁢ S ⁢ C ⁢ 2010 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s ⁢ U ⁢ p ⁢ d ⁢ a ⁢ t ⁢ e .","support":[{"end":1002,"quote":"1\nLinks to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website\nBecause the AMS MSC\nclassification\nlist or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the\ncomplete\nTable of AMS MSC2010 classifications:\nhttp://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf\nAll MSC 2010 in one PDF :\nhttp://www.ams.org/mathscinet/msc/msc2010.html\nThe AMS MSC website with its maths specialized Search Engine\n1.1\nConversion Tables\nhttp://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf\nCONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000\nM\n⁢\nS\n⁢\nC\n⁢\n2000\n⁢\nC\n⁢\nl\n⁢\na\n⁢\ns\n⁢\ns\n⁢\ni\n⁢\nf\n⁢\ni\n⁢\nc\n⁢\na\n⁢\nt\n⁢\ni\n⁢\no\n⁢\nn\n⁢\nC\n⁢\no\n⁢\nd\n⁢\ne\n⁢\ns\n→\nM\n⁢\nS\n⁢\nC\n⁢\n2010\n⁢\nC\n⁢\nl\n⁢\na\n⁢\ns\n⁢\ns\n⁢\ni\n⁢\nf\n⁢\ni\n⁢\nc\n⁢\na\n⁢\nt\n⁢\ni\n⁢\no\n⁢\nn\n⁢\nC\n⁢\no\n⁢\nd\n⁢\ne\n⁢\ns\n⁢\nU\n⁢\np\n⁢\nd\n⁢\na\n⁢\nt\n⁢\ne\n.","source_id":"planetmath.amsmscclassificationofarticlesandconversiontables","source_sha256":"7ff100ad22010dbea257eb2035564da0888770a498cb1b8389fcf941b03040bc","start":114}],"target_id":"concept.planetmath.amsmscclassificationofarticlesandconversiontables","target_kind":"node","target_sha256":"cfb3b148364ae0c3d6db04a51c6755f58944300f983fd7ced37f97784a9a3372"}],"concept.planetmath.analytichierarchy":[{"id":"assertion.concept.planetmath.analytichierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Analytic hierarchy as stated in the captured PlanetMath entry analytichierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: The analytic hierarchy is a hierarchy of either (depending on context ) formulas or relations similar to the arithmetical hierarchy .","support":[{"end":171,"quote":"The\nanalytic hierarchy\nis a hierarchy of either (depending on\ncontext\n)\nformulas\nor\nrelations\nsimilar\nto the\narithmetical hierarchy\n.","source_id":"planetmath.analytichierarchy","source_sha256":"60c39fb7f2a8b126b2129750e018c84ade3c05dfec3ba066f320ea44e37a3886","start":38}],"target_id":"concept.planetmath.analytichierarchy","target_kind":"node","target_sha256":"0191f4e3c561133cbc249292d22121bf9de9b8e188d814963d196f6e8824035a"}],"concept.planetmath.analyticsandformallogicsinmetamathematics":[{"id":"assertion.concept.planetmath.analyticsandformallogicsinmetamathematics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Analytics and formal logics in meta-mathematics as stated in the captured PlanetMath entry analyticsandformallogicsinmetamathematics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 53B21, 03G30, 03G20, 03B22, 01A60, 18-00, 03G30, 46M15, 03B22, 03B50, 03B15) states: This is a topic on meta-theories , metalogic and metamathematics founded in formal logic .","support":[{"end":186,"quote":"This is a topic on\nmeta-theories\n,\nmetalogic\nand\nmetamathematics\nfounded in\nformal logic\n.","source_id":"planetmath.analyticsandformallogicsinmetamathematics","source_sha256":"3971ecfe9587915fa11506d5a560b78731948a3b402e5142b7d21a49312c43ec","start":96}],"target_id":"concept.planetmath.analyticsandformallogicsinmetamathematics","target_kind":"node","target_sha256":"84cb035b3b90c3dad153f150704bd97612c55f47f13d8fef167772c4e5484c99"}],"concept.planetmath.annihilator":[{"id":"assertion.concept.planetmath.annihilator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Annihilator as stated in the captured PlanetMath entry annihilator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D10) states: Let R be a ring, and suppose that M is a left R -module and N a right R -module.","support":[{"end":104,"quote":"Let\nR\nbe a ring, and suppose that\nM\nis a left\nR\n-module and\nN\na right\nR\n-module.","source_id":"planetmath.annihilator","source_sha256":"55b5aa18ae99776e02170cba6af19bd0214636317714e5dd2c2e8a9dee77676d","start":24}],"target_id":"concept.planetmath.annihilator","target_kind":"node","target_sha256":"0b3014c20c78e92e9be75e0f1672b18df4dc0a2af94b8a2dd573a72eec12eaca"}],"concept.planetmath.anoutlineofhilbertsprogramme":[{"id":"assertion.concept.planetmath.anoutlineofhilbertsprogramme","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"An outline of Hilbert’s programme as stated in the captured PlanetMath entry anoutlineofhilbertsprogramme","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: Contents: 1 Initial definitions. Formalism 2 The two senses of the term ”axiomatic” 3 Meaning is in the model 4 Finite and infinite models 5 Hilbert’s Ansatz 6 Finitist inference 7 The rules of induction and recursion 8 From meaning to logic 9 Negation and disjunction 10 The consistency problem 11 Metamathematics 12 Beyond Incompleteness 1 Initial definitions.","support":[{"end":430,"quote":"Contents:\n1\nInitial definitions. Formalism\n2\nThe two senses of the term ”axiomatic”\n3\nMeaning is in the model\n4\nFinite and infinite models\n5\nHilbert’s\nAnsatz\n6\nFinitist inference\n7\nThe rules of induction and recursion\n8\nFrom meaning to logic\n9\nNegation and disjunction\n10\nThe consistency problem\n11\nMetamathematics\n12\nBeyond Incompleteness\n1\nInitial definitions.","source_id":"planetmath.anoutlineofhilbertsprogramme","source_sha256":"4b4a2471b363e2156efb6e5d7c4aeef3d12a04ffdebf5bc8925b33949d90f150","start":68}],"target_id":"concept.planetmath.anoutlineofhilbertsprogramme","target_kind":"node","target_sha256":"424fcd8cf4bcdd5758772b20553dbcbf19b1414d906fc9ac769c17e8aadc1852"}],"concept.planetmath.antisymmetricmapping":[{"id":"assertion.concept.planetmath.antisymmetricmapping","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Antisymmetric mapping as stated in the captured PlanetMath entry antisymmetricmapping","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69, 15A63) states: Let U and V be a vector spaces over a field K . A bilinear mapping B : U × U → V is said to be antisymmetric if B ⁢ ( u , u ) = 0 (1) for all u ∈ U .","support":[{"end":193,"quote":"Let\nU\nand\nV\nbe a\nvector spaces\nover a field\nK\n. A bilinear mapping\nB\n:\nU\n×\nU\n→\nV\nis said to be\nantisymmetric\nif\nB\n⁢\n(\nu\n,\nu\n)\n=\n0\n(1)\nfor all\nu\n∈\nU\n.","source_id":"planetmath.antisymmetricmapping","source_sha256":"eb77a59e32f158a08651a70ef3790868194871b403904dfc9219b5233fe16c2f","start":44}],"target_id":"concept.planetmath.antisymmetricmapping","target_kind":"node","target_sha256":"e045534057d6c60ac3fe5710ca2521a96908242469298a212764c1dfc56391eb"}],"concept.planetmath.arithmetic":[{"id":"assertion.concept.planetmath.arithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arithmetic as stated in the captured PlanetMath entry arithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: Arithmetic is ” the science of numbers and operations on sets of numbers.","support":[{"end":95,"quote":"Arithmetic\nis ” the science of numbers and\noperations\non sets of numbers.","source_id":"planetmath.arithmetic","source_sha256":"a54060ae4f3635d01be6d37097ec8212403ca3a1e8b411ad3aede99476f6e45e","start":22}],"target_id":"concept.planetmath.arithmetic","target_kind":"node","target_sha256":"5e93e156b0ceb9c7214cb892410bce4b616a6164048711927eae189c77ca84eb"}],"concept.planetmath.arithmeticalhierarchy":[{"id":"assertion.concept.planetmath.arithmeticalhierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arithmetical hierarchy as stated in the captured PlanetMath entry arithmeticalhierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: The arithmetical hierarchy is a hierarchy of either (depending on the context ) formulas or relations .","support":[{"end":149,"quote":"The\narithmetical hierarchy\nis a hierarchy of either (depending on the\ncontext\n)\nformulas\nor\nrelations\n.","source_id":"planetmath.arithmeticalhierarchy","source_sha256":"d9220763dba214f609bd6f69893b9cdb72e82f55a7b30927e067d2fdabb5149e","start":46}],"target_id":"concept.planetmath.arithmeticalhierarchy","target_kind":"node","target_sha256":"ad2ce10b1f73c7db16e6157ef13cf50ec4f1491f193db0c21403a2393475f89e"}],"concept.planetmath.arrowsrelation":[{"id":"assertion.concept.planetmath.arrowsrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Arrows relation as stated in the captured PlanetMath entry arrowsrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05A18, 03E05) states: Let [ X ] α = { Y ⊆ X ∣ | Y | = α } , that is, the set of subsets of X of size α .","support":[{"end":114,"quote":"Let\n[\nX\n]\nα\n=\n{\nY\n⊆\nX\n∣\n|\nY\n|\n=\nα\n}\n, that is, the set of subsets of\nX\nof size\nα\n.","source_id":"planetmath.arrowsrelation","source_sha256":"889ab321fe069991010a588fd90969d225bcbc2e16b6c7437cdc1ac0d2a17fa6","start":32}],"target_id":"concept.planetmath.arrowsrelation","target_kind":"node","target_sha256":"b006e52791d5444cc717d8c6cf9e3cc968edb7f1c8575b7cf242f48840bacfea"}],"concept.planetmath.ascendingorder":[{"id":"assertion.concept.planetmath.ascendingorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ascending order as stated in the captured PlanetMath entry ascendingorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in ascending order if each a i ≤ a i + 1 .","support":[{"end":165,"quote":"A\nsequence\nor arbitrary\nordered set\nor one-dimensional array of numbers,\na\n, is said to be in\nascending order\nif each\na\ni\n≤\na\ni\n+\n1\n.","source_id":"planetmath.ascendingorder","source_sha256":"3c1d5110e3f3f3af2ba1d39cab650cdcffd6fac431d1abbfd6ab2649b2f659a3","start":32}],"target_id":"concept.planetmath.ascendingorder","target_kind":"node","target_sha256":"45b7a66eb990b3ce9af25b76d333d85788a2197b9f3fe2977ee2478301daf44a"}],"concept.planetmath.atomicformula":[{"id":"assertion.concept.planetmath.atomicformula","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Atomic formula as stated in the captured PlanetMath entry atomicformula","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99, 03B10) states: Let Σ be a signature and T ⁢ ( Σ ) the set of terms over Σ .","support":[{"end":90,"quote":"Let\nΣ\nbe a\nsignature\nand\nT\n⁢\n(\nΣ\n)\nthe set of terms over\nΣ\n.","source_id":"planetmath.atomicformula","source_sha256":"f2b5166bdbd15f99d65dafea385d8be27fa11d40da7050490f8fd906a30b12b3","start":30}],"target_id":"concept.planetmath.atomicformula","target_kind":"node","target_sha256":"22129885ea6f903fdf2bef5a605b16e551e5a5a7810d895ed8695e1c443759d6"}],"concept.planetmath.automaton":[{"id":"assertion.concept.planetmath.automaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Automaton as stated in the captured PlanetMath entry automaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: An automaton is a semiautomaton with two types of special states: starting states, and final states.","support":[{"end":120,"quote":"An\nautomaton\nis a\nsemiautomaton\nwith two types of special states: starting states, and final states.","source_id":"planetmath.automaton","source_sha256":"384025f3a13b1f2f2956f6c82a35dd037a3074dbad9ed765ad351b19b64bc0cd","start":20}],"target_id":"concept.planetmath.automaton","target_kind":"node","target_sha256":"8209c3677978c75f0ae90f98316cd5b9a2cb8d4b811241d3dfd4e3b3b1d43d8c"}],"concept.planetmath.axiom":[{"id":"assertion.concept.planetmath.axiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom as stated in the captured PlanetMath entry axiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99, 03A05) states: In a nutshell, the logico-deductive method is a system of inference where conclusions (new knowledge) follow from premises (old knowledge) through the application of sound arguments ( syllogisms , rules of inference ).","support":[{"end":230,"quote":"In a nutshell, the logico-deductive method is a system of inference\nwhere\nconclusions\n(new knowledge) follow from\npremises\n(old knowledge)\nthrough the application of sound\narguments\n(\nsyllogisms\n,\nrules of\ninference\n).","source_id":"planetmath.axiom","source_sha256":"875b720e048df944707679ce52935c57164bfd758536a9774875bed87f3388ba","start":12}],"target_id":"concept.planetmath.axiom","target_kind":"node","target_sha256":"f1a7badf4b7a97e92e7b3a2844d88ae563d6499c1fb7a5d5c87fd17a59f3683c"}],"concept.planetmath.axiomatizableclass":[{"id":"assertion.concept.planetmath.axiomatizableclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiomatizable class as stated in the captured PlanetMath entry axiomatizableclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C52) states: Let L be a first order language and T a theory in L .","support":[{"end":93,"quote":"Let\nL\nbe a\nfirst order language\nand\nT\na theory in\nL\n.","source_id":"planetmath.axiomatizableclass","source_sha256":"02f6d9b9aa2d79deb67b84b36c7bbfaccb6dc26ca5e3365b7d1f3a663a47c374","start":40}],"target_id":"concept.planetmath.axiomatizableclass","target_kind":"node","target_sha256":"effc06ecbad54f31fde10201a07ffe10afb7b576baed30281bab3d99c5d714c8"}],"concept.planetmath.axiomofchoice":[{"id":"assertion.concept.planetmath.axiomofchoice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of choice as stated in the captured PlanetMath entry axiomofchoice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30, 03E25) states: The Zermelo-Fraenkel axioms for set theory are often accepted as a basis for an axiomatic set theory .","support":[{"end":134,"quote":"The\nZermelo-Fraenkel axioms\nfor\nset theory\nare often accepted as a basis for an\naxiomatic set theory\n.","source_id":"planetmath.axiomofchoice","source_sha256":"8dfc0fd905e3cd3cda8547aa16d73820c8bee059c326a1eff026efb3aa1f603c","start":32}],"target_id":"concept.planetmath.axiomofchoice","target_kind":"node","target_sha256":"222181aeefa3467f304bb4037a21691a5a3ec6020cc15a17d6d98bfeeee59bc7"}],"concept.planetmath.axiomofcountablechoice":[{"id":"assertion.concept.planetmath.axiomofcountablechoice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of countable choice as stated in the captured PlanetMath entry axiomofcountablechoice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E25) states: The Axiom of Countable Choice (CC) is a weak form of the Axiom of Choice ( http://planetmath.org/AxiomOfChoice ).","support":[{"end":165,"quote":"The\nAxiom of Countable Choice\n(CC) is a weak form of the\nAxiom of Choice\n(\nhttp://planetmath.org/AxiomOfChoice\n).","source_id":"planetmath.axiomofcountablechoice","source_sha256":"2008b805453e3ab6c6813cd39e3992d1e376ab684956af32cc24ed1577ff4fa9","start":52}],"target_id":"concept.planetmath.axiomofcountablechoice","target_kind":"node","target_sha256":"0096a789c6edad209b9c09c95bda42ea0d7b996840312352f24fa23a13d9064f"}],"concept.planetmath.axiomofextensionality":[{"id":"assertion.concept.planetmath.axiomofextensionality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of extensionality as stated in the captured PlanetMath entry axiomofextensionality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: If X and Y have the same elements , then X = Y . The Axiom of Extensionality is one of the axioms of Zermelo-Fraenkel set theory .","support":[{"end":178,"quote":"If\nX\nand\nY\nhave the same\nelements\n, then\nX\n=\nY\n.\nThe\nAxiom of Extensionality\nis one of the axioms of\nZermelo-Fraenkel set theory\n.","source_id":"planetmath.axiomofextensionality","source_sha256":"71b15f9b1956604ed970930602170f2e67363fd6576018a2579727b9f8b4a9da","start":48}],"target_id":"concept.planetmath.axiomofextensionality","target_kind":"node","target_sha256":"4615b46a15ec8e0fd31b909724d663d3a539dc943c9ad319f94212c46fcc4362"}],"concept.planetmath.axiomoffoundation":[{"id":"assertion.concept.planetmath.axiomoffoundation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of foundation as stated in the captured PlanetMath entry axiomoffoundation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99) states: The axiom of foundation (also called the axiom of regularity ) is an axiom of ZF set theory prohibiting circular sets and sets with infinite levels of containment.","support":[{"end":203,"quote":"The\naxiom of foundation\n(also called the\naxiom of regularity\n) is an axiom of ZF\nset theory\nprohibiting circular sets and sets with\ninfinite\nlevels of containment.","source_id":"planetmath.axiomoffoundation","source_sha256":"0a6d612d32c7f7eb967faab62529f61c5391d36be9f73ac23de59c24bcbd9f37","start":40}],"target_id":"concept.planetmath.axiomoffoundation","target_kind":"node","target_sha256":"bec861dce89077cd323ab5c25988abe63638df30d07df2fefda0229e7b6a237b"}],"concept.planetmath.axiomofinfinity":[{"id":"assertion.concept.planetmath.axiomofinfinity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of infinity as stated in the captured PlanetMath entry axiomofinfinity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: There exists an infinite set . The Axiom of Infinity is an axiom of Zermelo-Fraenkel set theory .","support":[{"end":133,"quote":"There exists an\ninfinite set\n.\nThe\nAxiom of Infinity\nis an axiom of\nZermelo-Fraenkel set theory\n.","source_id":"planetmath.axiomofinfinity","source_sha256":"cfabd608453598c91b074395b94eb5b066268fdf40a8280e3ee13cc445a6562d","start":36}],"target_id":"concept.planetmath.axiomofinfinity","target_kind":"node","target_sha256":"e4b38f3c70ea6f765a9462a6316d78486c3188bac4e9d66aceb6e3a92082044a"}],"concept.planetmath.axiomofpairing":[{"id":"assertion.concept.planetmath.axiomofpairing","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom of pairing as stated in the captured PlanetMath entry axiomofpairing","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: For any a and b there exists a set { a , b } that contains exactly a and b .","support":[{"end":110,"quote":"For any\na\nand\nb\nthere exists a set\n{\na\n,\nb\n}\nthat contains exactly\na\nand\nb\n.","source_id":"planetmath.axiomofpairing","source_sha256":"2e8d92f284abd87d0b614a981748b5d9a3d487c8ff674e92514edc3bf48e04ab","start":34}],"target_id":"concept.planetmath.axiomofpairing","target_kind":"node","target_sha256":"47cf014c9ba081aeee90c2e12d7585ab514edb6cf6de8598e06999c1ddfb6df4"}],"concept.planetmath.axiomschemaofseparation":[{"id":"assertion.concept.planetmath.axiomschemaofseparation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom schema of separation as stated in the captured PlanetMath entry axiomschemaofseparation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E30) states: Let ϕ ⁢ ( u , p ) be a formula . For any X and p , there exists a set Y = { u ∈ X : ϕ ⁢ ( u , p ) } .","support":[{"end":155,"quote":"Let\nϕ\n⁢\n(\nu\n,\np\n)\nbe a\nformula\n. For any\nX\nand\np\n, there exists a set\nY\n=\n{\nu\n∈\nX\n:\nϕ\n⁢\n(\nu\n,\np\n)\n}\n.","source_id":"planetmath.axiomschemaofseparation","source_sha256":"414d8e3056b0dbf728f46118fa4bed949dc0426efa5bb0e7e8f7046d9a292be6","start":54}],"target_id":"concept.planetmath.axiomschemaofseparation","target_kind":"node","target_sha256":"a3c6ad62838b3e40e8399fe593599f050579ca9305f79846f02b6eca660f3465"}],"concept.planetmath.axiomsystemforfirstorderlogic":[{"id":"assertion.concept.planetmath.axiomsystemforfirstorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom system for first order logic as stated in the captured PlanetMath entry axiomsystemforfirstorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: Let FO ( Σ ) be a first order language over signature Σ .","support":[{"end":127,"quote":"Let FO\n(\nΣ\n)\nbe a\nfirst order language\nover\nsignature\nΣ\n.","source_id":"planetmath.axiomsystemforfirstorderlogic","source_sha256":"ada94687605a9ce0be7fb7d9125430d34c03c933dabdf1e093c46781b0ec4ea5","start":70}],"target_id":"concept.planetmath.axiomsystemforfirstorderlogic","target_kind":"node","target_sha256":"471dd8ecb6d802a213a76d25f6536dcd2f1913daabf8d25a30b0c58b0f75131a"}],"concept.planetmath.axiomsystemforpropositionallogic":[{"id":"assertion.concept.planetmath.axiomsystemforpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Axiom system for propositional logic as stated in the captured PlanetMath entry axiomsystemforpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: The language of (classical) propositional logic PL c consists of a set of propositional letters or variables , the symbol ⟂ (for falsity), together with two symbols for logical connectives ¬ and → .","support":[{"end":272,"quote":"The\nlanguage\nof (classical)\npropositional logic\nPL\nc\nconsists of a set of propositional letters or\nvariables\n, the symbol\n⟂\n(for falsity), together with two symbols for\nlogical connectives\n¬\nand\n→\n.","source_id":"planetmath.axiomsystemforpropositionallogic","source_sha256":"88a04bffeeb81f8b1ecfe1d9224212e4409b11a4a263f83501df95e7f49136b0","start":74}],"target_id":"concept.planetmath.axiomsystemforpropositionallogic","target_kind":"node","target_sha256":"b86d84b9ad133dec2472942d418c04c62816f57b0cb787b84b93cf90a06a8cd9"}],"concept.planetmath.banachspace":[{"id":"assertion.concept.planetmath.banachspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Banach space as stated in the captured PlanetMath entry banachspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B99, 54E50) states: A Banach space ( X , ∥ ⋅ ∥ ) is a normed vector space such that X is complete under the metric induced by the norm ∥ ⋅ ∥ .","support":[{"end":148,"quote":"A\nBanach space\n(\nX\n,\n∥\n⋅\n∥\n)\nis a\nnormed vector space\nsuch that\nX\nis\ncomplete\nunder the metric\ninduced\nby the norm\n∥\n⋅\n∥\n.","source_id":"planetmath.banachspace","source_sha256":"3daa8da46a7920611816581bb0327f2cd860ee27f0ec6b9948ed46886f83b4a2","start":26}],"target_id":"concept.planetmath.banachspace","target_kind":"node","target_sha256":"8cb878a08b1254ce1cc1264e6a959ec95eb84de886f633f9eaf8fd258b37b1e8"}],"concept.planetmath.beyondformalismgodelsincompleteness":[{"id":"assertion.concept.planetmath.beyondformalismgodelsincompleteness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Beyond formalism: Gödel’s incompleteness as stated in the captured PlanetMath entry beyondformalismgodelsincompleteness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B10, 03A05, 03-01) states: Contents: 1 Overview 2 Arithmetic 3 From the number sequence to formal arithmetic 4 The formal theory Z 5 A model for Z 6 Gödel numbers 7 Expressing relations and representing functions in Z 8 Omega-consistency and metamathematical predicates 9 How to build Gödel’s undecidable statement 10 Gödel’s first theorem 11 The interpretation of the undecidable formula 12 Gödel’s second theorem 13 The interpretation of the second theorem 14 The concept of truth A Q & A 1 Overview In the literature on the foundations of mathematics the term ” formalism ” occurs with three different configurations .","support":[{"end":643,"quote":"Contents:\n1\nOverview\n2\nArithmetic\n3\nFrom the number sequence to formal arithmetic\n4\nThe formal theory\nZ\n5\nA model for\nZ\n6\nGödel numbers\n7\nExpressing relations and representing functions in\nZ\n8\nOmega-consistency and metamathematical predicates\n9\nHow to build Gödel’s undecidable statement\n10\nGödel’s first theorem\n11\nThe interpretation of the undecidable formula\n12\nGödel’s second theorem\n13\nThe interpretation of the second theorem\n14\nThe concept of truth\nA\nQ & A\n1\nOverview\nIn the literature on the\nfoundations of mathematics\nthe term ”\nformalism\n” occurs with three different\nconfigurations\n.","source_id":"planetmath.beyondformalismgodelsincompleteness","source_sha256":"164867353b1ccec350567ac68427a09f2abc17666650fd692067fba61755bfc8","start":49}],"target_id":"concept.planetmath.beyondformalismgodelsincompleteness","target_kind":"node","target_sha256":"ffbbd5a1cdae67ee8c4c3bf16ba3ef32a1307fe188f4123426e8b554f23fdf37"}],"concept.planetmath.biconditional":[{"id":"assertion.concept.planetmath.biconditional","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Biconditional as stated in the captured PlanetMath entry biconditional","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: 1 Biconditional A biconditional is a truth function that is true only in the case that both parameters are true or both are false.","support":[{"end":158,"quote":"1\nBiconditional\nA\nbiconditional\nis a\ntruth function\nthat is true only in the case that both\nparameters\nare true or both are false.","source_id":"planetmath.biconditional","source_sha256":"de9764540f4861e0e80d0d6e7dda3aa1b29cdea0e3c0e57e53e6fe77611d33db","start":28}],"target_id":"concept.planetmath.biconditional","target_kind":"node","target_sha256":"7adda158865296d157826c2d25d59716ef1aa8fcb1ddb824ebe83e813ab22901"}],"concept.planetmath.bicyclicsemigroup":[{"id":"assertion.concept.planetmath.bicyclicsemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bicyclic semigroup as stated in the captured PlanetMath entry bicyclicsemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99) states: The bicyclic semigroup 𝒞 ⁢ ( p , q ) is the monoid generated by { p , q } with the single relation p ⁢ q = 1 .","support":[{"end":148,"quote":"The\nbicyclic semigroup\n𝒞\n⁢\n(\np\n,\nq\n)\nis the\nmonoid generated by\n{\np\n,\nq\n}\nwith\nthe single\nrelation\np\n⁢\nq\n=\n1\n.","source_id":"planetmath.bicyclicsemigroup","source_sha256":"40c7f593ae4310762019249df8dcb56baf65a0afadaab8c5ad6c50ad91693256","start":38}],"target_id":"concept.planetmath.bicyclicsemigroup","target_kind":"node","target_sha256":"e06a5c4787a6ca206ce89e84793e5257dab2ec660d1e025267c7b60d86f56107"}],"concept.planetmath.bijection":[{"id":"assertion.concept.planetmath.bijection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bijection as stated in the captured PlanetMath entry bijection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 83-00, 81-00, 82-00) states: Let X and Y be sets. A function f : X → Y that is one-to-one and onto is called a bijection or bijective function from X to Y .","support":[{"end":147,"quote":"Let\nX\nand\nY\nbe sets. A\nfunction\nf\n:\nX\n→\nY\nthat is\none-to-one\nand onto is called a\nbijection\nor\nbijective function\nfrom\nX\nto\nY\n.","source_id":"planetmath.bijection","source_sha256":"ed11dd41ca70fafc911570064eaa6333876c9030a0ad91417f276b86be764751","start":20}],"target_id":"concept.planetmath.bijection","target_kind":"node","target_sha256":"239b3743a115e554a2783a36294e87ce8e0d9bab94b07d9a8b51a5c0a762a6f4"}],"concept.planetmath.bilinearform":[{"id":"assertion.concept.planetmath.bilinearform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bilinear form as stated in the captured PlanetMath entry bilinearform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 11E39, 15A63) states: Definition. Let U , V , W be vector spaces over a field K .","support":[{"end":87,"quote":"Definition.\nLet\nU\n,\nV\n,\nW\nbe\nvector spaces\nover a field\nK\n.","source_id":"planetmath.bilinearform","source_sha256":"ce0bedcdc690233f9bc6ca5d0852048d04c82520c1913f56fa21adb212eebeb3","start":28}],"target_id":"concept.planetmath.bilinearform","target_kind":"node","target_sha256":"adbb668b3e6cc12ee15fc2770fd1146dff30184a3341956950157b5cfabac0d4"}],"concept.planetmath.bilinearmap":[{"id":"assertion.concept.planetmath.bilinearmap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bilinear map as stated in the captured PlanetMath entry bilinearmap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13C99) states: Let R be a ring, and let M , N and P be modules over R .","support":[{"end":82,"quote":"Let\nR\nbe a ring, and let\nM\n,\nN\nand\nP\nbe modules over\nR\n.","source_id":"planetmath.bilinearmap","source_sha256":"aefa086264d5644977e453161de00aadc3c187b9ec028b3728ef3f8edf8d6064","start":26}],"target_id":"concept.planetmath.bilinearmap","target_kind":"node","target_sha256":"88eab811babbd11fa98a8f0fb137afc67f33382a50159981bc75f7e424e76f0e"}],"concept.planetmath.binaryoperation":[{"id":"assertion.concept.planetmath.binaryoperation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Binary operation as stated in the captured PlanetMath entry binaryoperation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A99) states: A binary operation on a set X is a function from the Cartesian product X × X to X .","support":[{"end":117,"quote":"A\nbinary operation\non a set\nX\nis a\nfunction\nfrom the\nCartesian product\nX\n×\nX\nto\nX\n.","source_id":"planetmath.binaryoperation","source_sha256":"b32a51a5380ea247453541c4209af0f4c8c7faa5d8bc64565e142cb4616626aa","start":34}],"target_id":"concept.planetmath.binaryoperation","target_kind":"node","target_sha256":"7757b170b1aaa0d87c753b0cbc4b64b44e4b5e0183289e78116de96a9cae80f4"}],"concept.planetmath.biops":[{"id":"assertion.concept.planetmath.biops","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Biops as stated in the captured PlanetMath entry biops","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A99) states: Let S be a set and n ∈ 𝐍 . Set 𝐍 n := { i ∈ 𝐍 | i < n } . If there exists a map ⋅ : 𝐍 n → ( S 2 → S ) : i ↦ ⋅ i where ⋅ i : S 2 → S : ( a , b ) ↦ a ⋅ i b is a binary operation , then I shall say that ( S , ⋅ ) is an n -biops .","support":[{"end":238,"quote":"Let\nS\nbe a set and\nn\n∈\n𝐍\n. Set\n𝐍\nn\n:=\n{\ni\n∈\n𝐍\n|\ni\n<\nn\n}\n. If there exists a map\n⋅\n:\n𝐍\nn\n→\n(\nS\n2\n→\nS\n)\n:\ni\n↦\n⋅\ni\nwhere\n⋅\ni\n:\nS\n2\n→\nS\n:\n(\na\n,\nb\n)\n↦\na\n⋅\ni\nb\nis a\nbinary operation\n, then I shall say that\n(\nS\n,\n⋅\n)\nis an\nn\n-biops\n.","source_id":"planetmath.biops","source_sha256":"5ba52c8a0c1dd7d83427092f1c752dd94cd08861ab7ceb94ac2a5851a01032e6","start":12}],"target_id":"concept.planetmath.biops","target_kind":"node","target_sha256":"df8de669d840735d60400d3d391db4a70dfa3a0a04f846ca816e28c8f94e6178"}],"concept.planetmath.bisimulation":[{"id":"assertion.concept.planetmath.bisimulation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bisimulation as stated in the captured PlanetMath entry bisimulation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B45, 68Q85, 68Q10) states: Given two labelled state transition systems (LTS) M = ( S 1 , Σ , → 1 ) , N = ( S 2 , Σ , → 2 ) , a binary relation ≈ ⊆ S 1 × S 2 is called a simulation if whenever p ≈ q and p → α 1 p ′ , then there is a q ′ such that p ′ ≈ q ′ and q → α 2 q ′ .","support":[{"end":272,"quote":"Given two\nlabelled state transition systems\n(LTS)\nM\n=\n(\nS\n1\n,\nΣ\n,\n→\n1\n)\n,\nN\n=\n(\nS\n2\n,\nΣ\n,\n→\n2\n)\n, a\nbinary relation\n≈\n⊆\nS\n1\n×\nS\n2\nis called a\nsimulation\nif whenever\np\n≈\nq\nand\np\n→\nα\n1\np\n′\n, then there is a\nq\n′\nsuch that\np\n′\n≈\nq\n′\nand\nq\n→\nα\n2\nq\n′\n.","source_id":"planetmath.bisimulation","source_sha256":"308275f5152e522cd5dc66cd242ecf43fc7b714edb2d14c92c85615865237592","start":26}],"target_id":"concept.planetmath.bisimulation","target_kind":"node","target_sha256":"693e10b39a3785dd7a78406897fea9d8ff9f8cef1c1657e2ea3abe0da4e8fb91"}],"concept.planetmath.booleanalgebrahomomorphism":[{"id":"assertion.concept.planetmath.booleanalgebrahomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean algebra homomorphism as stated in the captured PlanetMath entry booleanalgebrahomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Let A and B be Boolean algebras . A function f : A → B is called a Boolean algebra homomorphism , or homomorphism for short, if f is a { 0 , 1 } - lattice homomorphism ( http://planetmath.org/LatticeHomomorphism ) such that f respects ′ : f ⁢ ( a ′ ) = f ⁢ ( a ) ′ .","support":[{"end":324,"quote":"Let\nA\nand\nB\nbe\nBoolean algebras\n. A\nfunction\nf\n:\nA\n→\nB\nis called a\nBoolean algebra homomorphism\n, or\nhomomorphism\nfor short, if\nf\nis a\n{\n0\n,\n1\n}\n-\nlattice homomorphism\n(\nhttp://planetmath.org/LatticeHomomorphism\n) such that\nf\nrespects\n′\n:\nf\n⁢\n(\na\n′\n)\n=\nf\n⁢\n(\na\n)\n′\n.","source_id":"planetmath.booleanalgebrahomomorphism","source_sha256":"27ce5f7b9a18a5c4e8ad89cc76d5346e8baf004baee6bd2a5f75f49baec3db2c","start":58}],"target_id":"concept.planetmath.booleanalgebrahomomorphism","target_kind":"node","target_sha256":"97b43d2e21ea83e074acb6a45f9db1fd09ca8f37817508c70b0b49ee21e63b45"}],"concept.planetmath.booleandomain":[{"id":"assertion.concept.planetmath.booleandomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean domain as stated in the captured PlanetMath entry booleandomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68R01, 68Q01, 68P01, 03G05, 03C55, 03B05) states: \\PMlinkescapephrase generic \\PMlinkescapephrase Generic A Boolean domain 𝔹 is a generic 2-element set, say, 𝔹 = { 0 , 1 } , whose elements are interpreted as logical values, typically, 0 = false and 1 = true .","support":[{"end":239,"quote":"\\PMlinkescapephrase\ngeneric\n\\PMlinkescapephrase\nGeneric\nA\nBoolean domain\n𝔹\nis a generic 2-element set, say,\n𝔹\n=\n{\n0\n,\n1\n}\n, whose\nelements\nare interpreted as logical values, typically,\n0\n=\nfalse\nand\n1\n=\ntrue\n.","source_id":"planetmath.booleandomain","source_sha256":"ab4aabc051d5142b4e1ffaabe53fd4fe0d891ddf6dfe893c7491341c492ec2a4","start":30}],"target_id":"concept.planetmath.booleandomain","target_kind":"node","target_sha256":"f5d8bdea456251dc5e5ca77fffe07b85025a3068fafbc0841e89b81d199f54f6"}],"concept.planetmath.booleanideal":[{"id":"assertion.concept.planetmath.booleanideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean ideal as stated in the captured PlanetMath entry booleanideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G05, 03G10) states: Let A be a Boolean algebra and B a subset of A . The following are equivalent : 1.","support":[{"end":110,"quote":"Let\nA\nbe a\nBoolean algebra\nand\nB\na subset of\nA\n. The following are\nequivalent\n:\n1.","source_id":"planetmath.booleanideal","source_sha256":"25c6f11767aa5a61857de42ede4d6506fe09e1573f1a0135a9fe2c05f44605b2","start":28}],"target_id":"concept.planetmath.booleanideal","target_kind":"node","target_sha256":"d7ff2e830b16682b722d3ef909a89ac55fe094a1bd91b3a17d25b0deb8898883"}],"concept.planetmath.booleanlattice":[{"id":"assertion.concept.planetmath.booleanlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean lattice as stated in the captured PlanetMath entry booleanlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10, 06E20) states: In this entry, the notions of a Boolean lattice , a Boolean algebra , and a Boolean ring are defined, compared and contrasted.","support":[{"end":158,"quote":"In this entry, the notions of a\nBoolean lattice\n, a\nBoolean algebra\n, and a\nBoolean ring\nare defined, compared and contrasted.","source_id":"planetmath.booleanlattice","source_sha256":"60adc8943f5b27289e82baaa8613020d4c8bf86a61e6db6f73183041b64c67ef","start":32}],"target_id":"concept.planetmath.booleanlattice","target_kind":"node","target_sha256":"c47321c0d1ec082a335643bd612cb578934cd18d177332f9abb3756a1e90a18f"}],"concept.planetmath.booleanring":[{"id":"assertion.concept.planetmath.booleanring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean ring as stated in the captured PlanetMath entry booleanring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E99, 03G05) states: A Boolean ring is a ring R that has a multiplicative identity , and in which every element is idempotent , that is, x 2 = x ⁢ for all ⁢ x ∈ R .","support":[{"end":169,"quote":"A\nBoolean ring\nis a ring\nR\nthat has a\nmultiplicative identity\n,\nand in which every\nelement\nis\nidempotent\n, that is,\nx\n2\n=\nx\n⁢\nfor all\n⁢\nx\n∈\nR\n.","source_id":"planetmath.booleanring","source_sha256":"a56e95dee21f9ec1ec35dcea40e44e3e01aee42f0700214396d98cf2df4f7bd3","start":26}],"target_id":"concept.planetmath.booleanring","target_kind":"node","target_sha256":"8e042080ccdb19de53c98b6ac53f2b292555f86b9cd24995c4fefe05ba452f5b"}],"concept.planetmath.booleanvaluedfunction":[{"id":"assertion.concept.planetmath.booleanvaluedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Boolean-valued function as stated in the captured PlanetMath entry booleanvaluedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q01, 68P01, 06E30, 03G05, 03C55, 03B05, 68R01) states: A Boolean-valued function is a function of type f : X → 𝔹 , where X is an arbitrary set and where 𝔹 is a Boolean domain .","support":[{"end":169,"quote":"A\nBoolean-valued function\nis a\nfunction\nof type\nf\n:\nX\n→\n𝔹\n, where\nX\nis an arbitrary set and where\n𝔹\nis a\nBoolean domain\n.","source_id":"planetmath.booleanvaluedfunction","source_sha256":"ca4c92bac2ec41ccc25bde41e6cd91bdc82d22dcabcdde0d44c797f54db9f9c6","start":48}],"target_id":"concept.planetmath.booleanvaluedfunction","target_kind":"node","target_sha256":"36e0d543b9c124a3843a1b1cc6689a2ac6f42b90026f98bc8c7c8a7ded5213a3"}],"concept.planetmath.borelspace":[{"id":"assertion.concept.planetmath.borelspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Borel space as stated in the captured PlanetMath entry borelspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60A10, 28C15, 28A12, 54H05, 28A05) states: Definition 0.1 . A Borel space ( X ; ℬ ⁢ ( X ) ) is defined as a set X , together with a Borel σ - algebra ( http://planetmath.org/SigmaAlgebra ) ℬ ⁢ ( X ) of subsets of X , called Borel sets .","support":[{"end":217,"quote":"Definition 0.1\n.\nA\nBorel space\n(\nX\n;\nℬ\n⁢\n(\nX\n)\n)\nis defined as a set\nX\n, together with\na Borel\nσ\n-\nalgebra\n(\nhttp://planetmath.org/SigmaAlgebra\n)\nℬ\n⁢\n(\nX\n)\nof subsets of\nX\n, called\nBorel sets\n.","source_id":"planetmath.borelspace","source_sha256":"b8fdc5fa50437834cf522bafb6d1faf834c5dd71182179003ab238f89525b586","start":24}],"target_id":"concept.planetmath.borelspace","target_kind":"node","target_sha256":"26e6ac96e6111f7ac7b8db49c389b061254ae8dd282252baf14fb8e55bc588f4"}],"concept.planetmath.boundedcomplete":[{"id":"assertion.concept.planetmath.boundedcomplete","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded complete as stated in the captured PlanetMath entry boundedcomplete","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A12, 06B23, 03G10) states: Let P be a poset. Recall that a subset S of P is called bounded from above if there is an element a ∈ P such that, for every s ∈ S , s ≤ a .","support":[{"end":174,"quote":"Let\nP\nbe a poset. Recall that a subset\nS\nof\nP\nis called\nbounded from above\nif there is an\nelement\na\n∈\nP\nsuch that, for every\ns\n∈\nS\n,\ns\n≤\na\n.","source_id":"planetmath.boundedcomplete","source_sha256":"bc460f87075e10562bc5964e335f7781930acd9fc93a0382204f60168c9fad5a","start":34}],"target_id":"concept.planetmath.boundedcomplete","target_kind":"node","target_sha256":"0c6121b7af5834a178eeae6717750bd9027d453f287b38156962f30f1a254c66"}],"concept.planetmath.boundedfunction":[{"id":"assertion.concept.planetmath.boundedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded function as stated in the captured PlanetMath entry boundedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46-00) states: Definition Suppose X is a nonempty set . Then a function f : X → ℂ is a if there exist a C < ∞ such that | f ⁢ ( x ) | < C for all x ∈ X .","support":[{"end":172,"quote":"Definition\nSuppose\nX\nis a\nnonempty set\n. Then a\nfunction\nf\n:\nX\n→\nℂ\nis a\nif there exist a\nC\n<\n∞\nsuch that\n|\nf\n⁢\n(\nx\n)\n|\n<\nC\nfor all\nx\n∈\nX\n.","source_id":"planetmath.boundedfunction","source_sha256":"52e5ea216f38fd6e5cb4fa83b4e0c78e2c519af88570c586a0228f7b71805b9c","start":34}],"target_id":"concept.planetmath.boundedfunction","target_kind":"node","target_sha256":"99d5cdf921c5ec3326a62c29356d744f168c785bee17255a4ad5472a904413ef"}],"concept.planetmath.boundedminimization":[{"id":"assertion.concept.planetmath.boundedminimization","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Bounded minimization as stated in the captured PlanetMath entry boundedminimization","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: One useful way of generating more primitive recursive functions from existing ones is through what is known as bounded summation and bounded product .","support":[{"end":192,"quote":"One useful way of generating more\nprimitive recursive functions\nfrom existing ones is through what is known as\nbounded summation\nand\nbounded product\n.","source_id":"planetmath.boundedminimization","source_sha256":"088268ef63277d0a7f6f75692b6b902b80a6c63a490a32a5c718c69be5d0c4a1","start":42}],"target_id":"concept.planetmath.boundedminimization","target_kind":"node","target_sha256":"3b75cf303e014f055f0ac3c48ab06fb32f63b2b7312400657842f2aeed8c1624"}],"concept.planetmath.boxtopology":[{"id":"assertion.concept.planetmath.boxtopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Box topology as stated in the captured PlanetMath entry boxtopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let { ( X α , 𝒯 α ) } α ∈ A be a family of topological spaces .","support":[{"end":89,"quote":"Let\n{\n(\nX\nα\n,\n𝒯\nα\n)\n}\nα\n∈\nA\nbe a family of\ntopological spaces\n.","source_id":"planetmath.boxtopology","source_sha256":"b03ae923b09f91695ef6588076d5e9e4d2cc27c9ef7107ac7af7594615be44ba","start":26}],"target_id":"concept.planetmath.boxtopology","target_kind":"node","target_sha256":"a4f0c9eb4c83f1ab64ee0da30c107457f98850114ed19174633631e394b42abf"}],"concept.planetmath.buralifortiparadox":[{"id":"assertion.concept.planetmath.buralifortiparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Burali-Forti paradox as stated in the captured PlanetMath entry buralifortiparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: The Burali-Forti paradox demonstrates that the class of all ordinals is not a set.","support":[{"end":124,"quote":"The\nBurali-Forti\nparadox\ndemonstrates that the class of all\nordinals\nis not a set.","source_id":"planetmath.buralifortiparadox","source_sha256":"4e805d3b710d0a672206cbb848e30e26655ebcbe5a3d6102a14f9b6be4668d89","start":42}],"target_id":"concept.planetmath.buralifortiparadox","target_kind":"node","target_sha256":"d8041892725e4048c91fdcf804a81315632295e650b18198dfa744cc049999cd"}],"concept.planetmath.canonicalprojection":[{"id":"assertion.concept.planetmath.canonicalprojection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Canonical projection as stated in the captured PlanetMath entry canonicalprojection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20-00) states: Given a group G and a normal subgroup N ⊲ G there is an epimorphism π : G → G / N defined by sending an element g ∈ G to its coset g ⁢ N .","support":[{"end":180,"quote":"Given a group\nG\nand a\nnormal subgroup\nN\n⊲\nG\nthere is an\nepimorphism\nπ\n:\nG\n→\nG\n/\nN\ndefined by sending an element\ng\n∈\nG\nto its coset\ng\n⁢\nN\n.","source_id":"planetmath.canonicalprojection","source_sha256":"e2bf773f2efa85f6a619133f23cfea34f7ee552521d577e7c33cc248973b0fa4","start":42}],"target_id":"concept.planetmath.canonicalprojection","target_kind":"node","target_sha256":"fd22d9e5b4dbc5df81c5771c03f759dc0e42d0b37db6ef080b070f8e5f5b4577"}],"concept.planetmath.cantorsdiagonalargument":[{"id":"assertion.concept.planetmath.cantorsdiagonalargument","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cantor’s diagonal argument as stated in the captured PlanetMath entry cantorsdiagonalargument","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: One of the starting points in Cantor’s development of set theory was his discovery that there are different degrees of infinity .","support":[{"end":183,"quote":"One of the starting points in\nCantor’s development of\nset theory\nwas his discovery that there are\ndifferent degrees of\ninfinity\n.","source_id":"planetmath.cantorsdiagonalargument","source_sha256":"c6534ccb8719fa85e0c40e45e66587d77632a6aff528f55006e6ea01e0139fb3","start":54}],"target_id":"concept.planetmath.cantorsdiagonalargument","target_kind":"node","target_sha256":"7b1fac60bfc410bb27a7c7808bd4625574856b2bf9b2176c05f16d294a2186bc"}],"concept.planetmath.cardinalarithmetic":[{"id":"assertion.concept.planetmath.cardinalarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinal arithmetic as stated in the captured PlanetMath entry cardinalarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: Definitions Let κ and λ be cardinal numbers , and let A and B be disjoint sets such that | A | = κ and | B | = λ .","support":[{"end":154,"quote":"Definitions\nLet\nκ\nand\nλ\nbe\ncardinal numbers\n,\nand let\nA\nand\nB\nbe\ndisjoint sets\nsuch that\n|\nA\n|\n=\nκ\nand\n|\nB\n|\n=\nλ\n.","source_id":"planetmath.cardinalarithmetic","source_sha256":"9e950f373693471989ff3906e594287bd6fa790418eb8cdd166e5e9f049bf279","start":40}],"target_id":"concept.planetmath.cardinalarithmetic","target_kind":"node","target_sha256":"76820d6a8d23591f2e80df1557facbe16c565b70b39f0849b6a7198c0cc61540"}],"concept.planetmath.cardinality":[{"id":"assertion.concept.planetmath.cardinality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinality as stated in the captured PlanetMath entry cardinality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: Cardinality Cardinality is a notion of the size of a set which does not rely on numbers.","support":[{"end":112,"quote":"Cardinality\nCardinality\nis a notion of the size of a set which does not rely on numbers.","source_id":"planetmath.cardinality","source_sha256":"8d7ea7c5c5791b80e8c1f3fe0dac34fd4d4d9043530925de61a32b1e9d325474","start":24}],"target_id":"concept.planetmath.cardinality","target_kind":"node","target_sha256":"da846fd7cacbc3e8c9a5e3a5ac0bb81524977b86efc310986b9cc00c15a4dc3e"}],"concept.planetmath.cardinalnumber":[{"id":"assertion.concept.planetmath.cardinalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cardinal number as stated in the captured PlanetMath entry cardinalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A cardinal number is an ordinal number S with the property that S ≤ X for every ordinal number X which has the same cardinality as S .","support":[{"end":166,"quote":"A\ncardinal number\nis an\nordinal number\nS\nwith the\nproperty\nthat\nS\n≤\nX\nfor every ordinal number\nX\nwhich has the same\ncardinality\nas\nS\n.","source_id":"planetmath.cardinalnumber","source_sha256":"b55a9a5a3a8fe042dc0912671777c7012b98ce78eedf87862a4ae16ff6af6275","start":32}],"target_id":"concept.planetmath.cardinalnumber","target_kind":"node","target_sha256":"5a0653e6baa7a0de6697448095ebd12a08f010fb3ef686d2c17f1fbde11d46ef"}],"concept.planetmath.cartesianproduct":[{"id":"assertion.concept.planetmath.cartesianproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cartesian product as stated in the captured PlanetMath entry cartesianproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 81P10, 81P05) states: For any sets A and B , the Cartesian product A × B is the set consisting of all ordered pairs ( a , b ) where a ∈ A and b ∈ B .","support":[{"end":163,"quote":"For any sets\nA\nand\nB\n, the\nCartesian product\nA\n×\nB\nis the set consisting of all\nordered pairs\n(\na\n,\nb\n)\nwhere\na\n∈\nA\nand\nb\n∈\nB\n.","source_id":"planetmath.cartesianproduct","source_sha256":"c489bdabf08ec8c24847759557f945a40e35f908d975a853cf3ed39aa066006b","start":36}],"target_id":"concept.planetmath.cartesianproduct","target_kind":"node","target_sha256":"4ea0779c59859e2935ae1ebf316798796eec922220ab6c6c3a34fce5229afccb"}],"concept.planetmath.categoricalquantumlmlogicalgebras":[{"id":"assertion.concept.planetmath.categoricalquantumlmlogicalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Categorical quantum LM- logic algebras as stated in the captured PlanetMath entry categoricalquantumlmlogicalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U99, 55U40, 55U35, 55U30, 81T05, 18A40, 18A15, 18A05, 18A99) states: \\xyoption curve 0.1 Quantum LM-algebraic Logic 0.1.1 Fundamental concepts of space and time in quantum theory vs.","support":[{"end":191,"quote":"\\xyoption\ncurve\n0.1\nQuantum LM-algebraic Logic\n0.1.1\nFundamental concepts of space and time in quantum theory\nvs.","source_id":"planetmath.categoricalquantumlmlogicalgebras","source_sha256":"7f1b059b2fd0d5ff5b607c69dd50aceaf699622900cececd36ea551461062c73","start":78}],"target_id":"concept.planetmath.categoricalquantumlmlogicalgebras","target_kind":"node","target_sha256":"879f0c3510b4ff19a33584dd57369aa02e222e4cfe2bec47c349b53394c19a8a"}],"concept.planetmath.changeofbasis":[{"id":"assertion.concept.planetmath.changeofbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Change of basis as stated in the captured PlanetMath entry changeofbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Let V be a vector space . Given a basis A for V , each vector v ∈ V can be uniquely expressed in terms of the base elements v i ∈ A as follows: v = ∑ v i ∈ A r i ⁢ v i where the sum is taken over a finite number of elements in A .","support":[{"end":262,"quote":"Let\nV\nbe a\nvector space\n. Given a basis\nA\nfor\nV\n, each vector\nv\n∈\nV\ncan be uniquely expressed in terms of the base\nelements\nv\ni\n∈\nA\nas follows:\nv\n=\n∑\nv\ni\n∈\nA\nr\ni\n⁢\nv\ni\nwhere the sum is taken over a finite number of elements in\nA\n.","source_id":"planetmath.changeofbasis","source_sha256":"c8cac1bea9e913a7fb43290a087a025e1617f43ceb3a4eb7c887b44d60b7d5e3","start":32}],"target_id":"concept.planetmath.changeofbasis","target_kind":"node","target_sha256":"3f42a7e3f7562b69769b0341f9aff16561cccf4df319d718ed0a686b5d7a75f2"}],"concept.planetmath.characteristic":[{"id":"assertion.concept.planetmath.characteristic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic as stated in the captured PlanetMath entry characteristic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12E99) states: Let ( F , + , ⋅ ) be a field. The characteristic Char ⁡ ( F ) of F is commonly given by one of three equivalent definitions : • if there is some positive integer n for which the result of adding any element to itself n times yields 0 , then the characteristic of the field is the least such n .","support":[{"end":324,"quote":"Let\n(\nF\n,\n+\n,\n⋅\n)\nbe a field. The\ncharacteristic\nChar\n⁡\n(\nF\n)\nof\nF\nis commonly given by one of three\nequivalent\ndefinitions\n:\n•\nif there is some positive integer\nn\nfor which the result of adding any\nelement\nto itself\nn\ntimes yields\n0\n, then the characteristic of the field is the least such\nn\n.","source_id":"planetmath.characteristic","source_sha256":"458e4242035eeb4790aa0ca364aefa30c227fa036251a133645221ab62217ed7","start":30}],"target_id":"concept.planetmath.characteristic","target_kind":"node","target_sha256":"00752b432fbf742aee6804acaf0fae8e5e80e60b76c0de540299a39468dafbaf"}],"concept.planetmath.characteristicfunction":[{"id":"assertion.concept.planetmath.characteristicfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic function as stated in the captured PlanetMath entry characteristicfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 26-00, 26A09, 28-00) states: Definition Suppose A is a subset of a set X . Then the function χ A ⁢ ( x ) = { 1 , when ⁢ x ∈ A , 0 , when ⁢ x ∈ X ∖ A is the characteristic function for A .","support":[{"end":206,"quote":"Definition\nSuppose\nA\nis a subset of a set\nX\n. Then the\nfunction\nχ\nA\n⁢\n(\nx\n)\n=\n{\n1\n,\nwhen\n⁢\nx\n∈\nA\n,\n0\n,\nwhen\n⁢\nx\n∈\nX\n∖\nA\nis the\ncharacteristic function\nfor\nA\n.","source_id":"planetmath.characteristicfunction","source_sha256":"56a6d7c1fa127cb0ac8005fd98685a5fbf83bd5b9d70ede41345fd91e69ded71","start":48}],"target_id":"concept.planetmath.characteristicfunction","target_kind":"node","target_sha256":"2c1e76ab9278f59c31a0d6fcfc161923bf2a0627c18b80b9070e26ed5ff06a20"}],"concept.planetmath.characteristicsubgroup":[{"id":"assertion.concept.planetmath.characteristicsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Characteristic subgroup as stated in the captured PlanetMath entry characteristicsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: If ( G , * ) is a group, then H is a characteristic subgroup of G (written H ⁢ char ⁡ G ) if every automorphism of G maps H to itself.","support":[{"end":182,"quote":"If\n(\nG\n,\n*\n)\nis a group, then\nH\nis a\ncharacteristic subgroup\nof\nG\n(written\nH\n⁢\nchar\n⁡\nG\n) if every\nautomorphism\nof\nG\nmaps\nH\nto itself.","source_id":"planetmath.characteristicsubgroup","source_sha256":"69aaa5d08964087db08189bdec4c961ae7f20e273da34c51440f5c08b6bc8f26","start":48}],"target_id":"concept.planetmath.characteristicsubgroup","target_kind":"node","target_sha256":"d543a50f524b20f020a254390375e1e8ec192f4952ee70ecbb6de67d036d7312"}],"concept.planetmath.chomskyhierarchy":[{"id":"assertion.concept.planetmath.chomskyhierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chomsky hierarchy as stated in the captured PlanetMath entry chomskyhierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q15, 03D55) states: The Chomsky hierarchy or Chomsky-Schützenberger hierarchy is a way of classifying formal grammars into four types, with the lower numbered types being more general.","support":[{"end":200,"quote":"The\nChomsky hierarchy\nor\nChomsky-Schützenberger hierarchy\nis a way of classifying\nformal grammars\ninto four types, with the lower numbered types being more general.","source_id":"planetmath.chomskyhierarchy","source_sha256":"24419cbde30c1c34ce3210860ef0e6d3dcb7303431b0219fecfbae343ab09e26","start":36}],"target_id":"concept.planetmath.chomskyhierarchy","target_kind":"node","target_sha256":"5e2fc870c20ff4be2eef3f52e22f8b71282dd1549b134f494defc8dc2807449e"}],"concept.planetmath.churchinteger":[{"id":"assertion.concept.planetmath.churchinteger","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Church integer as stated in the captured PlanetMath entry churchinteger","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40, 68N18) states: A Church integer is a representation of integers as functions , invented by Alonzo Church.","support":[{"end":120,"quote":"A\nChurch integer\nis a representation of integers as\nfunctions\n, invented by Alonzo Church.","source_id":"planetmath.churchinteger","source_sha256":"9d0b9f89bdcaf9b05bf1f8d6d7901d14455b349cccdab48bed0e8e3e23cd52fe","start":30}],"target_id":"concept.planetmath.churchinteger","target_kind":"node","target_sha256":"0b7076faf0f37f4f09f4aca4ef8d0ff1dd736f573bccd1fff110ad892b823baf"}],"concept.planetmath.chuspace":[{"id":"assertion.concept.planetmath.chuspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chu space as stated in the captured PlanetMath entry chuspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G99) states: A Chu space over a set Σ is a triple ( 𝒜 , r , 𝒳 ) with r : 𝒜 × 𝒳 → Σ .","support":[{"end":91,"quote":"A\nChu space\nover a set\nΣ\nis a triple\n(\n𝒜\n,\nr\n,\n𝒳\n)\nwith\nr\n:\n𝒜\n×\n𝒳\n→\nΣ\n.","source_id":"planetmath.chuspace","source_sha256":"525ae9de6b5f01f5ae4b8e1cd23d57daa40b66ff8fa39a3ecb52a93fc88431be","start":20}],"target_id":"concept.planetmath.chuspace","target_kind":"node","target_sha256":"7f9bc8a8de1f597cb7398f889b32bb6dadce915a4d62150bc0949005296db5ba"}],"concept.planetmath.classesofordinalsandenumeratingfunctions":[{"id":"assertion.concept.planetmath.classesofordinalsandenumeratingfunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Classes of ordinals and enumerating functions as stated in the captured PlanetMath entry classesofordinalsandenumeratingfunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F15, 03E10) states: A class of ordinals is just a subclass of the class ( http://planetmath.org/Class ) 𝐎𝐧 of all ordinals.","support":[{"end":195,"quote":"A\nclass of\nordinals\nis just a\nsubclass\nof the class (\nhttp://planetmath.org/Class\n)\n𝐎𝐧\nof all ordinals.","source_id":"planetmath.classesofordinalsandenumeratingfunctions","source_sha256":"f1f703a0630a494433977986e85d8cb17918aced2cb73124a85e5a4ca1fe7021","start":92}],"target_id":"concept.planetmath.classesofordinalsandenumeratingfunctions","target_kind":"node","target_sha256":"cabcbad1de90a7cbba87da3ee6f8ce3a2a65be350292687e6b94d03a78ac74e9"}],"concept.planetmath.classicalringofquotients":[{"id":"assertion.concept.planetmath.classicalringofquotients","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Classical ring of quotients as stated in the captured PlanetMath entry classicalringofquotients","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16U20, 16S90) states: Let R be a ring. An element of R is called regular if it is not a right zero divisor or a left zero divisor in R .","support":[{"end":170,"quote":"Let\nR\nbe a ring. An element of\nR\nis called\nregular\nif it is not a\nright zero divisor\nor a left zero divisor in\nR\n.","source_id":"planetmath.classicalringofquotients","source_sha256":"feec425cae9ea210af2b6d40ef3600e8dfda80639406116baa2380e0f1e2ec5a","start":56}],"target_id":"concept.planetmath.classicalringofquotients","target_kind":"node","target_sha256":"da2ba43b5813e645d05f9abf50277fc1cd04f6abce9136f6c7b2fff047f5a97b"}],"concept.planetmath.closedset":[{"id":"assertion.concept.planetmath.closedset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closed set as stated in the captured PlanetMath entry closedset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: \\PMlinkescapephrase closed under Let ( X , τ ) be a topological space .","support":[{"end":93,"quote":"\\PMlinkescapephrase\nclosed under\nLet\n(\nX\n,\nτ\n)\nbe a\ntopological space\n.","source_id":"planetmath.closedset","source_sha256":"cf968923e831622c88ae4a0592f5e92f2dc3fa0364ee862d44a332f79900b3b7","start":22}],"target_id":"concept.planetmath.closedset","target_kind":"node","target_sha256":"ff2259fe00f63c18c708b657f2ce44962be6048b2753679bd3a14032d190689d"}],"concept.planetmath.closuremap":[{"id":"assertion.concept.planetmath.closuremap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closure map as stated in the captured PlanetMath entry closuremap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05, 06A15) states: Let P be a poset. A function c : P → P is called a closure map if • c is order preserving, • 1 P ≤ c , • c is idempotent : c ∘ c = c .","support":[{"end":158,"quote":"Let\nP\nbe a poset. A\nfunction\nc\n:\nP\n→\nP\nis called a\nclosure map\nif\n•\nc\nis order preserving,\n•\n1\nP\n≤\nc\n,\n•\nc\nis\nidempotent\n:\nc\n∘\nc\n=\nc\n.","source_id":"planetmath.closuremap","source_sha256":"dbe00f3f65b12d3349447ec735de665cfa287ef33e0c41252f46c307f5418155","start":24}],"target_id":"concept.planetmath.closuremap","target_kind":"node","target_sha256":"7e4190f63e7cb00cf1687114e92982913fa7441398f9fc3e27df5e2796a6326b"}],"concept.planetmath.closureofasubsetunderrelations":[{"id":"assertion.concept.planetmath.closureofasubsetunderrelations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Closure of a subset under relations as stated in the captured PlanetMath entry closureofasubsetunderrelations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A02) states: Let A be a set and R be an n -ary relation on A , n ≥ 1 . A subset B of A is said to be closed under R , or R -closed , if, whenever b 1 , … , b n - 1 ∈ B , and ( b 1 , … , b n - 1 , b n ) ∈ R , then b n ∈ B .","support":[{"end":281,"quote":"Let\nA\nbe a set and\nR\nbe an\nn\n-ary relation on\nA\n,\nn\n≥\n1\n. A subset\nB\nof\nA\nis said to be\nclosed under\nR\n, or\nR\n-closed\n, if, whenever\nb\n1\n,\n…\n,\nb\nn\n-\n1\n∈\nB\n, and\n(\nb\n1\n,\n…\n,\nb\nn\n-\n1\n,\nb\nn\n)\n∈\nR\n, then\nb\nn\n∈\nB\n.","source_id":"planetmath.closureofasubsetunderrelations","source_sha256":"16a9081989f3e05e0f335bc3f075e2cb27aadafc85736ec8f24c24aee308b369","start":72}],"target_id":"concept.planetmath.closureofasubsetunderrelations","target_kind":"node","target_sha256":"351060cbb8d68250ce58277fcbf4d25c2ac4c78a079b68e7ea32e7a8aa3db67d"}],"concept.planetmath.club":[{"id":"assertion.concept.planetmath.club","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Club as stated in the captured PlanetMath entry club","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: If κ is a cardinal then a set C ⊆ κ is closed iff for any S ⊆ C and α < κ , sup ⁡ ( S ∩ α ) = α then α ∈ C .","support":[{"end":118,"quote":"If\nκ\nis a\ncardinal\nthen a set\nC\n⊆\nκ\nis\nclosed\niff for any\nS\n⊆\nC\nand\nα\n<\nκ\n,\nsup\n⁡\n(\nS\n∩\nα\n)\n=\nα\nthen\nα\n∈\nC\n.","source_id":"planetmath.club","source_sha256":"57fbe8add1dbe14d187c25336bc662c2779198e9fdb8dd8acea69d9c27a6ea3f","start":10}],"target_id":"concept.planetmath.club","target_kind":"node","target_sha256":"5f386cb7bd8297ec468d730ea35c8b13e9f9d8317b833f9029f753cd1f149f0d"}],"concept.planetmath.coefficientsofapolynomial":[{"id":"assertion.concept.planetmath.coefficientsofapolynomial","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coefficients of a polynomial as stated in the captured PlanetMath entry coefficientsofapolynomial","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A40) states: If p ⁢ ( x ) = ∑ i = 0 n a i ⁢ x i is a polynomial ( http://planetmath.org/BasicPolynomial ), then its coefficients are { a i } i = 0 n .","support":[{"end":195,"quote":"If\np\n⁢\n(\nx\n)\n=\n∑\ni\n=\n0\nn\na\ni\n⁢\nx\ni\nis a\npolynomial\n(\nhttp://planetmath.org/BasicPolynomial\n), then its\ncoefficients\nare\n{\na\ni\n}\ni\n=\n0\nn\n.","source_id":"planetmath.coefficientsofapolynomial","source_sha256":"54fb90620164dc9a8d312a1804195abc6579c3b85dd0b744d38023283d348ba9","start":58}],"target_id":"concept.planetmath.coefficientsofapolynomial","target_kind":"node","target_sha256":"ddaadc93f713ec8ee82ef9a5aa1c7cfddcd93cc4cad41bdd17db3204aa747b87"}],"concept.planetmath.cofinality":[{"id":"assertion.concept.planetmath.cofinality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cofinality as stated in the captured PlanetMath entry cofinality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E04) states: Definitions Let ( P , ≤ ) be a poset. A subset A ⊆ P is said to be cofinal in P if for every x ∈ P there is a y ∈ A such that x ≤ y .","support":[{"end":155,"quote":"Definitions\nLet\n(\nP\n,\n≤\n)\nbe a poset. A subset\nA\n⊆\nP\nis said to be\ncofinal\nin\nP\nif for every\nx\n∈\nP\nthere is a\ny\n∈\nA\nsuch that\nx\n≤\ny\n.","source_id":"planetmath.cofinality","source_sha256":"6eb597c3bb37097d7531ea136860667e88254c28669d4a513a6d6a5591cd89bc","start":22}],"target_id":"concept.planetmath.cofinality","target_kind":"node","target_sha256":"e92f014097ee578e97aadcfc74860a9cb6722c24efc5d8f09e250f6b60ebb75b"}],"concept.planetmath.combinatorylogic":[{"id":"assertion.concept.planetmath.combinatorylogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Combinatory logic as stated in the captured PlanetMath entry combinatorylogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40) states: Combinatory logic was invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","support":[{"end":150,"quote":"Combinatory logic\nwas invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","source_id":"planetmath.combinatorylogic","source_sha256":"35b54bd24f2317bcf69138f7411405a12c5bed1269d02874643b67b0090e4920","start":36}],"target_id":"concept.planetmath.combinatorylogic","target_kind":"node","target_sha256":"febdd9304e94a20d808afd170e9eccae1a73a35da9d17b670813ad0d320e1aac"}],"concept.planetmath.commutativelanguage":[{"id":"assertion.concept.planetmath.commutativelanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutative language as stated in the captured PlanetMath entry commutativelanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q70) states: Let Σ be an alphabet and u a word over Σ . Write u as a product of symbols in Σ : u = a 1 ⁢ ⋯ ⁢ a n where a i ∈ Σ .","support":[{"end":157,"quote":"Let\nΣ\nbe an\nalphabet\nand\nu\na word over\nΣ\n. Write\nu\nas a\nproduct\nof symbols in\nΣ\n:\nu\n=\na\n1\n⁢\n⋯\n⁢\na\nn\nwhere\na\ni\n∈\nΣ\n.","source_id":"planetmath.commutativelanguage","source_sha256":"0b683848ae09ffc8d424e9c124c02767c26fbfa985c3cf5267ce9e53f93fbb9d","start":42}],"target_id":"concept.planetmath.commutativelanguage","target_kind":"node","target_sha256":"ca4a5928bff1689bb475e7c7456168c4efc96c973e84c2e6ac4328d8857775d7"}],"concept.planetmath.commutativesemigroup":[{"id":"assertion.concept.planetmath.commutativesemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutative semigroup as stated in the captured PlanetMath entry commutativesemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M14) states: A semigroup S is commutative if the defining binary operation is commutative ( http://planetmath.org/Commutative ).","support":[{"end":159,"quote":"A\nsemigroup\nS\nis\ncommutative\nif the defining\nbinary operation\nis commutative (\nhttp://planetmath.org/Commutative\n).","source_id":"planetmath.commutativesemigroup","source_sha256":"7df3ab9d9f86594db43b95ead5cf609dacf23e3bc12607d29d8e721ede41a554","start":44}],"target_id":"concept.planetmath.commutativesemigroup","target_kind":"node","target_sha256":"a3342eab58a9006d36619d6d38cbeda28c36102e9de0a97f8385ad1eacacf92d"}],"concept.planetmath.commutativityrelationinanorthocomplementedlattice":[{"id":"assertion.concept.planetmath.commutativityrelationinanorthocomplementedlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Commutativity relation in an orthocomplemented lattice as stated in the captured PlanetMath entry commutativityrelationinanorthocomplementedlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06C15, 03G12) states: Let L be an orthocomplemented lattice with a , b ∈ L .","support":[{"end":164,"quote":"Let\nL\nbe an\northocomplemented lattice\nwith\na\n,\nb\n∈\nL\n.","source_id":"planetmath.commutativityrelationinanorthocomplementedlattice","source_sha256":"caebcc0900cf4e50f65f7644fddc3685fd49c3a376ca9ec3835b79578057312a","start":110}],"target_id":"concept.planetmath.commutativityrelationinanorthocomplementedlattice","target_kind":"node","target_sha256":"cf44ef545e74be2dff5d7ab46a6e5759c812f86aba1696e3d1f213669d3905c8"}],"concept.planetmath.compact":[{"id":"assertion.concept.planetmath.compact","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Compact as stated in the captured PlanetMath entry compact","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D30, 81-00, 83-00, 82-00, 46L05, 22A22) states: A topological space X is compact if, for every collection { U i } i ∈ I of open sets in X whose union is X , there exists a finite subcollection { U i j } j = 1 n whose union is also X .","support":[{"end":202,"quote":"A\ntopological space\nX\nis\ncompact\nif, for every\ncollection\n{\nU\ni\n}\ni\n∈\nI\nof\nopen sets\nin\nX\nwhose union is\nX\n, there exists a finite subcollection\n{\nU\ni\nj\n}\nj\n=\n1\nn\nwhose union is also\nX\n.","source_id":"planetmath.compact","source_sha256":"3976b3ab8e086334aba9eebcfa645be2e017b21c86f502b3f63c0e5a260b83b6","start":16}],"target_id":"concept.planetmath.compact","target_kind":"node","target_sha256":"bead44c5aa56281d2b3e22c758e6e12338007be6cc5b55efc6349c8fa2d65b1b"}],"concept.planetmath.compactness":[{"id":"assertion.concept.planetmath.compactness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Compactness as stated in the captured PlanetMath entry compactness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: A logic is said to be ( κ , λ ) -compact, if the following holds If Φ is a set of sentences of cardinality less than or equal to κ and all subsets of Φ of cardinality less than λ are consistent , then Φ is consistent.","support":[{"end":241,"quote":"A logic is said to be\n(\nκ\n,\nλ\n)\n-compact, if the following holds\nIf\nΦ\nis a set of\nsentences\nof\ncardinality\nless than or equal to\nκ\nand all subsets of\nΦ\nof cardinality less than\nλ\nare\nconsistent\n, then\nΦ\nis consistent.","source_id":"planetmath.compactness","source_sha256":"ed5ebb3e56768a4ce7e00c039ba9b1dfb64396bf8473cd5f76801e7d66e850d6","start":24}],"target_id":"concept.planetmath.compactness","target_kind":"node","target_sha256":"250dc5943cd5afd05ebf9bdd9440726996b86caf8f8cdfb7b6148af6d28ac2d4"}],"concept.planetmath.comparisonoffilters":[{"id":"assertion.concept.planetmath.comparisonoffilters","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Comparison of filters as stated in the captured PlanetMath entry comparisonoffilters","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99, 03E99) states: Let 𝔽 1 and 𝔽 2 be two filters on the same set. The following terminology is commonly used to describe the relation of 𝔽 1 to 𝔽 2 : 𝔽 2 is said to be finer than 𝔽 1 if 𝔽 1 ⊆ 𝔽 2 .","support":[{"end":223,"quote":"Let\n𝔽\n1\nand\n𝔽\n2\nbe two filters on the same set. The following terminology is commonly used to describe the relation of\n𝔽\n1\nto\n𝔽\n2\n:\n𝔽\n2\nis said to be\nfiner\nthan\n𝔽\n1\nif\n𝔽\n1\n⊆\n𝔽\n2\n.","source_id":"planetmath.comparisonoffilters","source_sha256":"3a894c0193e43f00b90dd87e125c4da0da9a33013486f702ba44bfda29ae5b72","start":44}],"target_id":"concept.planetmath.comparisonoffilters","target_kind":"node","target_sha256":"f09e3c75dc796432ab8877e9242b5f8c78ee295f9708f638f2c56e115a98f34a"}],"concept.planetmath.complementarysubspace":[{"id":"assertion.concept.planetmath.complementarysubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complementary subspace as stated in the captured PlanetMath entry complementarysubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Direct sum decomposition. Let U be a vector space , and V , W ⊂ U subspaces .","support":[{"end":123,"quote":"Direct sum decomposition.\nLet\nU\nbe a\nvector space\n, and\nV\n,\nW\n⊂\nU\nsubspaces\n.","source_id":"planetmath.complementarysubspace","source_sha256":"ec33e60a9a57ec00718866ee1cab6253b33f1c21b4bfcfbd481fa0e3e1b76b0e","start":46}],"target_id":"concept.planetmath.complementarysubspace","target_kind":"node","target_sha256":"4ee90af070833070fcd41f1a1f1acb3b38058f61e7c822029e0857562c14c317"}],"concept.planetmath.completelattice":[{"id":"assertion.concept.planetmath.completelattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complete lattice as stated in the captured PlanetMath entry completelattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B23, 03G10) states: Complete lattices A complete lattice is a poset P such that every subset of P has both a supremum and an infimum in P .","support":[{"end":153,"quote":"Complete lattices\nA\ncomplete lattice\nis a poset\nP\nsuch that every subset of\nP\nhas both a\nsupremum\nand an\ninfimum\nin\nP\n.","source_id":"planetmath.completelattice","source_sha256":"8ee368875cce0e9755697a3df24436475c82aca16c6a8dd46d2a75b1456ede78","start":34}],"target_id":"concept.planetmath.completelattice","target_kind":"node","target_sha256":"8f474b32f465b81aa78eb00bbc0fb83f68ceb054a95e4d6ef3cd8c62fa5352ad"}],"concept.planetmath.complexnumber":[{"id":"assertion.concept.planetmath.complexnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Complex number as stated in the captured PlanetMath entry complexnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D99, 30-00, 32-00, 46L05, 18B40, 46M20, 17B37, 22A22, 81R50, 22D25) states: The ring of complex numbers ℂ is defined to be the quotient ring of the polynomial ring ℝ ⁢ [ X ] in one variable over the reals by the principal ideal ( X 2 + 1 ) .","support":[{"end":195,"quote":"The ring of\ncomplex numbers\nℂ\nis defined to be the\nquotient ring\nof the\npolynomial ring\nℝ\n⁢\n[\nX\n]\nin one\nvariable\nover the reals by the\nprincipal ideal\n(\nX\n2\n+\n1\n)\n.","source_id":"planetmath.complexnumber","source_sha256":"8085068cf57149c7d257dc8ac3ea9b934f7ac018b7c2c6b3768985e626b15544","start":30}],"target_id":"concept.planetmath.complexnumber","target_kind":"node","target_sha256":"4fa611dbd1b88009e4cd57dba4ac8d6c4fd64d544d9aa4a82915be5d9168734e"}],"concept.planetmath.compositenumber":[{"id":"assertion.concept.planetmath.compositenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Composite number as stated in the captured PlanetMath entry compositenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A41) states: A composite number is a positive integer which is not prime and not equal to 1.","support":[{"end":113,"quote":"A\ncomposite number\nis a\npositive integer\nwhich is not prime and not equal to 1.","source_id":"planetmath.compositenumber","source_sha256":"299840d9e2ccceea376d722c3a28e695c6d7837cb8aa0aa0d6bbbdea1fd69137","start":34}],"target_id":"concept.planetmath.compositenumber","target_kind":"node","target_sha256":"be3fa70170ac482dc367ff901d7e6fa2faa40270b3835c4ffae8ef02d7890f10"}],"concept.planetmath.comprehensionaxiom":[{"id":"assertion.concept.planetmath.comprehensionaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Comprehension axiom as stated in the captured PlanetMath entry comprehensionaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: The axiom of comprehension (CA) states that every formula defines a set.","support":[{"end":112,"quote":"The\naxiom of comprehension\n(CA) states that every\nformula\ndefines a set.","source_id":"planetmath.comprehensionaxiom","source_sha256":"744fdd769058c7943375b47326cb62dac308e407be2bfba32154e9e21cd46a20","start":40}],"target_id":"concept.planetmath.comprehensionaxiom","target_kind":"node","target_sha256":"81bedbf18ab91ab77b8188261e95d7791c7d64869f48d0907dd1db2b798b15ef"}],"concept.planetmath.computablenumber":[{"id":"assertion.concept.planetmath.computablenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Computable number as stated in the captured PlanetMath entry computablenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03D25, 68Q05) states: A real number r is called computable if there exists some terminating algorithm (or Turing machine ) that can approximate it to arbitrary precision.","support":[{"end":184,"quote":"A\nreal number\nr\nis called\ncomputable\nif there exists some\nterminating\nalgorithm\n(or\nTuring machine\n) that can approximate it to arbitrary precision.","source_id":"planetmath.computablenumber","source_sha256":"7e800fb2fcc72ac7d4b8c744289cce03d751ba456d6e37f7b8d9d4283aeb5778","start":36}],"target_id":"concept.planetmath.computablenumber","target_kind":"node","target_sha256":"f6c405aa253aa4262eaa85a11fcba50f695b6526808e5f73903de8772195dd6a"}],"concept.planetmath.conceptlattice":[{"id":"assertion.concept.planetmath.conceptlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Concept lattice as stated in the captured PlanetMath entry conceptlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q55, 68P99, 08A70, 06B23, 03B70, 06A15) states: Let G and M be sets whose elements we call objects and attributes respectively.","support":[{"end":111,"quote":"Let\nG\nand\nM\nbe sets whose\nelements\nwe call\nobjects\nand\nattributes\nrespectively.","source_id":"planetmath.conceptlattice","source_sha256":"98282c921141986923e059fc374bcad8e4d60fd06cc3151bb9cffc0d6be49007","start":32}],"target_id":"concept.planetmath.conceptlattice","target_kind":"node","target_sha256":"34869e9687fa81b92fb949d2217b9d77425d90c7971db75a7f460d7dd0a6fb60"}],"concept.planetmath.conceptsinabstractalgebra":[{"id":"assertion.concept.planetmath.conceptsinabstractalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Concepts in abstract algebra as stated in the captured PlanetMath entry conceptsinabstractalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55-00, 18-00, 16-00, 13-00, 20-00, 15-00) states: The aim of this entry is to present a list of the key operators used in abstract algebra .","support":[{"end":148,"quote":"The aim of this entry is to present a list of the key\noperators\nused in\nabstract algebra\n.","source_id":"planetmath.conceptsinabstractalgebra","source_sha256":"c1318e88443b9d187b0a3cb8ba67c65cc70e68189547a670cb202fe23804f69b","start":58}],"target_id":"concept.planetmath.conceptsinabstractalgebra","target_kind":"node","target_sha256":"c62700bce0350aa1be84de69d19740086ae9f77e64c34d911ffc7594f03da183"}],"concept.planetmath.congruence12":[{"id":"assertion.concept.planetmath.congruence12","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Congruence as stated in the captured PlanetMath entry congruence12","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , and 𝔄 a structure for Σ .","support":[{"end":76,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\na\nstructure\nfor\nΣ\n.","source_id":"planetmath.congruence12","source_sha256":"de88667ffb1f8385773e3fe4a015e235e24a6926671d3ca4a62c7d7fb4e828d4","start":22}],"target_id":"concept.planetmath.congruence12","target_kind":"node","target_sha256":"4982ceea115daedf7eafbeaac2ed99d2773eaaac99c24778fcbda0188cc55aaf"}],"concept.planetmath.congruenceonapartialalgebra":[{"id":"assertion.concept.planetmath.congruenceonapartialalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Congruence on a partial algebra as stated in the captured PlanetMath entry congruenceonapartialalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition There are two types of congruences on a partial algebra 𝑨 , both are special types of a certain equivalence relation on A : 1.","support":[{"end":201,"quote":"Definition\nThere are two types of\ncongruences\non a\npartial algebra\n𝑨\n, both are special types of a certain\nequivalence relation\non\nA\n:\n1.","source_id":"planetmath.congruenceonapartialalgebra","source_sha256":"d910b7e2608b6c6a9a7022c42f71e7b3d9e999445f0a315891d3e5b7fcdd1afb","start":64}],"target_id":"concept.planetmath.congruenceonapartialalgebra","target_kind":"node","target_sha256":"47bdbdb562929a724f0e2482e60957cde8467e53adedbf7d6cc0d153073c91eb"}],"concept.planetmath.connectedposet":[{"id":"assertion.concept.planetmath.connectedposet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Connected poset as stated in the captured PlanetMath entry connectedposet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A07) states: Let P be a poset. Write a ⟂ b if either a ≤ b or b ≤ a . In other words, a ⟂ b if a and b are comparable .","support":[{"end":138,"quote":"Let\nP\nbe a poset. Write\na\n⟂\nb\nif either\na\n≤\nb\nor\nb\n≤\na\n. In other words,\na\n⟂\nb\nif\na\nand\nb\nare\ncomparable\n.","source_id":"planetmath.connectedposet","source_sha256":"21efa1cba5556e635a859c2a25c7f948655f6b1f00e8bb7cc5857425cde33cd1","start":32}],"target_id":"concept.planetmath.connectedposet","target_kind":"node","target_sha256":"7086ef1e05c407bb40db112f5b521a02e93032f0730e4e876e7773317e3b436f"}],"concept.planetmath.connectedspace":[{"id":"assertion.concept.planetmath.connectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Connected space as stated in the captured PlanetMath entry connectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be connected if there is no pair of nonempty subsets U , V such that both U and V are open in X , U ∩ V = ∅ and U ∪ V = X .","support":[{"end":188,"quote":"A\ntopological space\nX\nis said to be\nconnected\nif there is no pair of nonempty subsets\nU\n,\nV\nsuch that both\nU\nand\nV\nare open in\nX\n,\nU\n∩\nV\n=\n∅\nand\nU\n∪\nV\n=\nX\n.","source_id":"planetmath.connectedspace","source_sha256":"cc0a0135beba9927eb9cfca7184c5158bb630988d7fcfbb8c04d4b7fab6bd9dc","start":32}],"target_id":"concept.planetmath.connectedspace","target_kind":"node","target_sha256":"032393cc9c45d55bcbdc533240843c464e68dc4444108ca134d794658f3c41ed"}],"concept.planetmath.consequenceoperator":[{"id":"assertion.concept.planetmath.consequenceoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Consequence operator as stated in the captured PlanetMath entry consequenceoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G25, 03G10, 03B22) states: 1 Definition Let L be a set. A consequence operator on L is a mapping 1 1 Here, “ 𝒫 ” denotes the power set and ℱ denotes the finite power set.","support":[{"end":185,"quote":"1\nDefinition\nLet\nL\nbe a set. A\nconsequence operator\non\nL\nis a\nmapping\n1\n1\nHere, “\n𝒫\n” denotes the\npower set\nand\nℱ\ndenotes the finite power set.","source_id":"planetmath.consequenceoperator","source_sha256":"58b5a301514089fd93de8feab888e3c5325b696a23a9c16dd207e76b399fa3ab","start":42}],"target_id":"concept.planetmath.consequenceoperator","target_kind":"node","target_sha256":"e161814851ee0fdb3b4c7e53a6859067188f2b738552ebb5ba647df64657097b"}],"concept.planetmath.constructingautomatafromregularlanguages":[{"id":"assertion.concept.planetmath.constructingautomatafromregularlanguages","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Constructing automata from regular languages as stated in the captured PlanetMath entry constructingautomatafromregularlanguages","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: In this entry, we describe how a certain equivalence relation on words gives rise to a deterministic automaton , and show that deterministic automata to a certain extent can be characterized by these equivalence relations.","support":[{"end":312,"quote":"In this entry, we describe how a certain\nequivalence relation\non words gives rise to a\ndeterministic automaton\n, and show that\ndeterministic\nautomata to a certain extent can be characterized by these equivalence relations.","source_id":"planetmath.constructingautomatafromregularlanguages","source_sha256":"f9bde3ce3b641201f383b98f1982fdc4678fe7bbe7d0686dc5f3748c5c5babca","start":90}],"target_id":"concept.planetmath.constructingautomatafromregularlanguages","target_kind":"node","target_sha256":"113c35effbd6376a5aa25fa7c46fbb2e13a03c770457a2697f00976885092b5e"}],"concept.planetmath.continuumhypothesis":[{"id":"assertion.concept.planetmath.continuumhypothesis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Continuum hypothesis as stated in the captured PlanetMath entry continuumhypothesis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E50) states: The continuum hypothesis that there is no cardinal number κ such that ℵ 0 < κ < 2 ℵ 0 .","support":[{"end":129,"quote":"The\ncontinuum hypothesis\nthat there is no\ncardinal number\nκ\nsuch that\nℵ\n0\n<\nκ\n<\n2\nℵ\n0\n.","source_id":"planetmath.continuumhypothesis","source_sha256":"599c6a7fc458001c973934e9cd8fa3d66dc76b0fb48d2f535d47a627c93fdb97","start":42}],"target_id":"concept.planetmath.continuumhypothesis","target_kind":"node","target_sha256":"75be771d2f2e1f0371074ce72e166199b00f4fd0974e04ba3086a4554caee9b7"}],"concept.planetmath.contradiction":[{"id":"assertion.concept.planetmath.contradiction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contradiction as stated in the captured PlanetMath entry contradiction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F07, 03B05) states: A contradiction occurs when the statements p and ¬ ⁢ p are shown to be true simultaneously.","support":[{"end":119,"quote":"A\ncontradiction\noccurs when the statements\np\nand\n¬\n⁢\np\nare shown to be true simultaneously.","source_id":"planetmath.contradiction","source_sha256":"2d584ef65df0f425eba04237b6a6a8fe8a1ce8b99d94d082ef7e7fa2420e7ef4","start":28}],"target_id":"concept.planetmath.contradiction","target_kind":"node","target_sha256":"c04d33fbde5c37fb3d0d7ebad350fc01b4d410ddbfb73c304b38ec6c5ff61cc8"}],"concept.planetmath.contradictorystatement":[{"id":"assertion.concept.planetmath.contradictorystatement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contradictory statement as stated in the captured PlanetMath entry contradictorystatement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A contradictory statement is a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","support":[{"end":195,"quote":"A\ncontradictory statement\nis a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","source_id":"planetmath.contradictorystatement","source_sha256":"e72474be721723b02c02a3fe2a12cd93ca05df18ec9e5f5eea350a272e2f0a28","start":48}],"target_id":"concept.planetmath.contradictorystatement","target_kind":"node","target_sha256":"52016939951dc12104cdcd80fd15b147e3315550761cd28fb43ee93423ef264b"}],"concept.planetmath.contrapositive":[{"id":"assertion.concept.planetmath.contrapositive","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Contrapositive as stated in the captured PlanetMath entry contrapositive","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Given an implication of the form p ⟹ q (“p implies q”) the contrapositive of this implication is ¬ ⁢ q ⟹ ¬ ⁢ p (“not q implies not p”).","support":[{"end":165,"quote":"Given an\nimplication\nof the form\np\n⟹\nq\n(“p implies q”) the\ncontrapositive\nof this implication is\n¬\n⁢\nq\n⟹\n¬\n⁢\np\n(“not q implies not p”).","source_id":"planetmath.contrapositive","source_sha256":"b69c12e29194d27e3e39356b592a554ab1d68feba37b031c9fcc15c0896d2c4b","start":30}],"target_id":"concept.planetmath.contrapositive","target_kind":"node","target_sha256":"87e5edd08b8f485c27dfab80c89e2c4c16f7e1807350009b32e8efc101234d76"}],"concept.planetmath.convergentsequence":[{"id":"assertion.concept.planetmath.convergentsequence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Convergent sequence as stated in the captured PlanetMath entry convergentsequence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 40A05) states: A sequence x 0 , x 1 , x 2 , … in a metric space ( X , d ) is a convergent sequence if there exists a point x ∈ X such that, for every real number ϵ > 0 , there exists a natural number N such that d ⁢ ( x , x n ) < ϵ for all n > N .","support":[{"end":272,"quote":"A\nsequence\nx\n0\n,\nx\n1\n,\nx\n2\n,\n…\nin a\nmetric space\n(\nX\n,\nd\n)\nis a\nconvergent sequence\nif there exists a point\nx\n∈\nX\nsuch that, for every\nreal number\nϵ\n>\n0\n, there exists a\nnatural number\nN\nsuch that\nd\n⁢\n(\nx\n,\nx\nn\n)\n<\nϵ\nfor all\nn\n>\nN\n.","source_id":"planetmath.convergentsequence","source_sha256":"26df8d751083de7827a1f1ae0ccc0dbea13cf83b3dd69648c01469fadbc3eced","start":40}],"target_id":"concept.planetmath.convergentsequence","target_kind":"node","target_sha256":"3501086f6f1f116b590f7bb21dcb5f749dbfdf1e9a29d4fd9cf38896e09df68c"}],"concept.planetmath.convexfunction":[{"id":"assertion.concept.planetmath.convexfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Convex function as stated in the captured PlanetMath entry convexfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 52A41, 26A51, 26B25, 55Q05, 18G30, 18B40, 20J05, 20E07, 18-01, 20L05) states: Definition Suppose Ω is a convex set in a vector space over ℝ (or ℂ ), and suppose f is a function f : Ω → ℝ .","support":[{"end":142,"quote":"Definition\nSuppose\nΩ\nis a\nconvex set\nin a\nvector space\nover\nℝ\n(or\nℂ\n), and suppose\nf\nis a function\nf\n:\nΩ\n→\nℝ\n.","source_id":"planetmath.convexfunction","source_sha256":"db6640afeaf0616191db08d47c0c10a35d68efdb407c544afac4867ae3fb062b","start":32}],"target_id":"concept.planetmath.convexfunction","target_kind":"node","target_sha256":"050b715a57dda12264836d41f29f6e3a44e140a0c6ac0a55ee91da41828c96c4"}],"concept.planetmath.coordinatevector":[{"id":"assertion.concept.planetmath.coordinatevector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coordinate vector as stated in the captured PlanetMath entry coordinatevector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space of dimension n over a field K .","support":[{"end":91,"quote":"Let\nV\nbe a\nvector space\nof\ndimension\nn\nover a field\nK\n.","source_id":"planetmath.coordinatevector","source_sha256":"c48f63b8ca91c7faff457ac73e540659ebf640fc5f8dc34c0619804a718aef25","start":36}],"target_id":"concept.planetmath.coordinatevector","target_kind":"node","target_sha256":"6489b56cc87bda036889e83be0e43ea444106acf294d3a2ca5addaefae837c31"}],"concept.planetmath.coset":[{"id":"assertion.concept.planetmath.coset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Coset as stated in the captured PlanetMath entry coset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Let H be a subgroup of a group G , and let a ∈ G . The left coset of a with respect to H in G is defined to be the set a ⁢ H := { a ⁢ h ∣ h ∈ H } .","support":[{"end":159,"quote":"Let\nH\nbe a\nsubgroup\nof a group\nG\n, and let\na\n∈\nG\n. The\nleft coset\nof\na\nwith respect to\nH\nin\nG\nis defined to be the set\na\n⁢\nH\n:=\n{\na\n⁢\nh\n∣\nh\n∈\nH\n}\n.","source_id":"planetmath.coset","source_sha256":"82e720e1813856271a29e5af8fe1ac350f937ac6ef1dbb07ce9803f60d555869","start":12}],"target_id":"concept.planetmath.coset","target_kind":"node","target_sha256":"1858629fbac86c4530198488090b1a2bfd100c0f699f51d4babd8fcf6fd09c6e"}],"concept.planetmath.countable":[{"id":"assertion.concept.planetmath.countable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Countable as stated in the captured PlanetMath entry countable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A set S is countable if there exists a bijection between S and some subset of ℕ .","support":[{"end":101,"quote":"A set\nS\nis\ncountable\nif there exists a\nbijection\nbetween\nS\nand some subset of\nℕ\n.","source_id":"planetmath.countable","source_sha256":"62f3ab16981bd55c39e814edccf0d9e46058f21d1048d36650a81569d2a07b88","start":20}],"target_id":"concept.planetmath.countable","target_kind":"node","target_sha256":"83648ff538b2920e5cf4ebe4cd0b5d9cf2ef88334ed7804abd08cb665e4484c5"}],"concept.planetmath.countablyinfinite":[{"id":"assertion.concept.planetmath.countablyinfinite","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Countably infinite as stated in the captured PlanetMath entry countablyinfinite","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: A set S is countably infinite if there is a bijection between S and ℕ .","support":[{"end":109,"quote":"A set\nS\nis\ncountably infinite\nif there is a\nbijection\nbetween\nS\nand\nℕ\n.","source_id":"planetmath.countablyinfinite","source_sha256":"e18436909f6a21aac0ca32d3e36e75c148e689d68094552254dced5239a372a2","start":38}],"target_id":"concept.planetmath.countablyinfinite","target_kind":"node","target_sha256":"dd7b64c56e167eebcfb3c9f3fa7a9c45c4239465603f8388a909c2b0334ec71b"}],"concept.planetmath.cover":[{"id":"assertion.concept.planetmath.cover","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cover as stated in the captured PlanetMath entry cover","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Definition ( [ 1 ] , pp. 49) Let Y be a subset of a set X .","support":[{"end":71,"quote":"Definition\n(\n[\n1\n]\n, pp. 49)\nLet\nY\nbe a subset of a set\nX\n.","source_id":"planetmath.cover","source_sha256":"91d18d9a5daf2503499accc5409feb8248a13baf5e6dda64087065be061459e6","start":12}],"target_id":"concept.planetmath.cover","target_kind":"node","target_sha256":"edb11c8fcf8426ad615b13a31941553ff39722ed230a9e32c2dee60a7fbcc70c"}],"concept.planetmath.crossproduct":[{"id":"assertion.concept.planetmath.crossproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cross product as stated in the captured PlanetMath entry crossproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A90, 15A72) states: \\PMlinkescapephrase imaginary part \\PMlinkescapephrase real part \\PMlinkescapephrase spanned by The cross product (or vector product ) of two vectors in ℝ 3 is a vector http://planetmath.org/node/1285 orthogonal to the plane of the two vectors being crossed, whose magnitude is equal to the area of the parallelogram defined by the two vectors.","support":[{"end":372,"quote":"\\PMlinkescapephrase\nimaginary part\n\\PMlinkescapephrase\nreal part\n\\PMlinkescapephrase\nspanned by\nThe\ncross product\n(or\nvector product\n) of two vectors in\nℝ\n3\nis a vector\nhttp://planetmath.org/node/1285\northogonal\nto the plane of the two vectors being crossed, whose magnitude is equal to the area of the\nparallelogram\ndefined by the two vectors.","source_id":"planetmath.crossproduct","source_sha256":"aa99c8e0f48a9ff7fc49d597c014c5cb40381b7415d421e4b69d8f8f28a6c626","start":28}],"target_id":"concept.planetmath.crossproduct","target_kind":"node","target_sha256":"3783411da4d99a01338320351818d4a574c5f30c11aedb53006c9c8a032afe9f"}],"concept.planetmath.cumulativehierarchy":[{"id":"assertion.concept.planetmath.cumulativehierarchy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Cumulative hierarchy as stated in the captured PlanetMath entry cumulativehierarchy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: The cumulative hierarchy of sets is defined by transfinite recursion as follows: we define V 0 = ∅ and for each ordinal α we define V α + 1 = 𝒫 ⁢ ( V α ) and for each limit ordinal δ we define V δ = ⋃ α ∈ δ V α .","support":[{"end":254,"quote":"The\ncumulative hierarchy\nof sets\nis defined by\ntransfinite recursion\nas follows:\nwe define\nV\n0\n=\n∅\nand for each\nordinal\nα\nwe define\nV\nα\n+\n1\n=\n𝒫\n⁢\n(\nV\nα\n)\nand for each\nlimit ordinal\nδ\nwe define\nV\nδ\n=\n⋃\nα\n∈\nδ\nV\nα\n.","source_id":"planetmath.cumulativehierarchy","source_sha256":"40989bea4569a9366a793d8ea26013cdef7d52fd35ebda882339f13813eb877d","start":42}],"target_id":"concept.planetmath.cumulativehierarchy","target_kind":"node","target_sha256":"92b9e4ace5a1315c90e94614f8674ed64460a9f10ad4660a0d4c3d2fdd47e1a8"}],"concept.planetmath.deduction":[{"id":"assertion.concept.planetmath.deduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deduction as stated in the captured PlanetMath entry deduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: Deductions are formalizations of proofs. Informally, they can be viewed as arriving at a conclusion from a set of assumptions, via applications of some prescribed rules in a finite number of steps.","support":[{"end":217,"quote":"Deductions\nare formalizations of proofs. Informally, they can be viewed as arriving at a\nconclusion\nfrom a set of assumptions, via applications of some prescribed rules in a finite number of steps.","source_id":"planetmath.deduction","source_sha256":"ee05442ac5a62a52c8450db3a4fca98af56371f3cf9b67442bd25575fa4e063c","start":20}],"target_id":"concept.planetmath.deduction","target_kind":"node","target_sha256":"9286fbc1372adb6e55420389f25e0d40484aa47f6bda4306a38d78ec48cccf8a"}],"concept.planetmath.deductivesystem":[{"id":"assertion.concept.planetmath.deductivesystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deductive system as stated in the captured PlanetMath entry deductivesystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03F03, 03B99, 03B22) states: Introduction A deductive system is a formal (mathematical) setup of reasoning.","support":[{"end":112,"quote":"Introduction\nA\ndeductive system\nis a formal (mathematical) setup of reasoning.","source_id":"planetmath.deductivesystem","source_sha256":"25d023529f08ac7fcb8f4306663cf5e6bc73d8aca8c1190f1efdb610eddbae82","start":34}],"target_id":"concept.planetmath.deductivesystem","target_kind":"node","target_sha256":"8ba4bd0da5de68d6e366cfb5d7f7df23b42a05592cbe22a61bbf459f2f1862c6"}],"concept.planetmath.definitionsintrigonometry":[{"id":"assertion.concept.planetmath.definitionsintrigonometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Definitions in trigonometry as stated in the captured PlanetMath entry definitionsintrigonometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A09) states: Informal definitions Given a triangle A ⁢ B ⁢ C with a signed angle x at A and a right angle at B , the ratios B ⁢ C A ⁢ C A ⁢ B A ⁢ C B ⁢ C A ⁢ B are dependent only on the angle x , and therefore define functions , denoted by sin ⁡ x cos ⁡ x tan ⁡ x respectively, where the names are short for sine, cosine and tangent .","support":[{"end":377,"quote":"Informal definitions\nGiven a\ntriangle\nA\n⁢\nB\n⁢\nC\nwith a signed angle\nx\nat\nA\nand a\nright angle\nat\nB\n, the ratios\nB\n⁢\nC\nA\n⁢\nC\nA\n⁢\nB\nA\n⁢\nC\nB\n⁢\nC\nA\n⁢\nB\nare dependent only on the angle\nx\n, and therefore define\nfunctions\n,\ndenoted by\nsin\n⁡\nx\ncos\n⁡\nx\ntan\n⁡\nx\nrespectively, where the names are short for\nsine, cosine\nand\ntangent\n.","source_id":"planetmath.definitionsintrigonometry","source_sha256":"e8ecedddf5a4b1134ff11e70680983180152316f6a79bd63f0de4063c87ace09","start":56}],"target_id":"concept.planetmath.definitionsintrigonometry","target_kind":"node","target_sha256":"1113d40d3b9865ff406cbd5a0759c36dcb0a924ded652f40db7202fa06553c1b"}],"concept.planetmath.derivativenotation":[{"id":"assertion.concept.planetmath.derivativenotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Derivative notation as stated in the captured PlanetMath entry derivativenotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 26-00) states: This is the list of known standard representations and their nuances.","support":[{"end":109,"quote":"This is the list of known\nstandard representations\nand their nuances.","source_id":"planetmath.derivativenotation","source_sha256":"7f47c8753fb68c84edeb2349dcb6cfa3c39f40f01186aa5a0a18bf9317a34774","start":40}],"target_id":"concept.planetmath.derivativenotation","target_kind":"node","target_sha256":"1ce81d0f933eae540f16af2f96c9be4de8f4ced31291e33ff8825ba00c6eaa3e"}],"concept.planetmath.derivedbooleanoperations":[{"id":"assertion.concept.planetmath.derivedbooleanoperations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Derived Boolean operations as stated in the captured PlanetMath entry derivedbooleanoperations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Recall that a Boolean algebra is an algebraic system A consisting of five operations : 1.","support":[{"end":143,"quote":"Recall that a\nBoolean algebra\nis an\nalgebraic system\nA\nconsisting of five\noperations\n:\n1.","source_id":"planetmath.derivedbooleanoperations","source_sha256":"7153a3e95d3130c66b1158e02361d4b3f0722acde0cdf95c763a973afcb8602e","start":54}],"target_id":"concept.planetmath.derivedbooleanoperations","target_kind":"node","target_sha256":"e54723578a1a5b51aa2748961f80858fcd97b33ea3a1ef48c5dba6a6e897656c"}],"concept.planetmath.descendingorder":[{"id":"assertion.concept.planetmath.descendingorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Descending order as stated in the captured PlanetMath entry descendingorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in descending order if each a i ≥ a i + 1 .","support":[{"end":168,"quote":"A\nsequence\nor arbitrary\nordered set\nor one-dimensional array of numbers,\na\n, is said to be in\ndescending order\nif each\na\ni\n≥\na\ni\n+\n1\n.","source_id":"planetmath.descendingorder","source_sha256":"609556da5ae7bb19816935310f30a6c75c0100bf4621f439a326c9151876c750","start":34}],"target_id":"concept.planetmath.descendingorder","target_kind":"node","target_sha256":"cc580a7fe86dd41521bf2d7584ce5ea87ccee2e73cbf1b8ccd304d739c3d41d5"}],"concept.planetmath.determinant":[{"id":"assertion.concept.planetmath.determinant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Determinant as stated in the captured PlanetMath entry determinant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A15) states: Overview The determinant is an algebraic operation that transforms a square matrix M into a scalar.","support":[{"end":123,"quote":"Overview\nThe\ndeterminant\nis an algebraic operation that transforms a\nsquare matrix\nM\ninto a scalar.","source_id":"planetmath.determinant","source_sha256":"6268719a09730e28447d3e4a5e37cf83547d707f59b8089f78cb6e340a45539f","start":24}],"target_id":"concept.planetmath.determinant","target_kind":"node","target_sha256":"c6e3353cf7f82b1462e1c76e9a266aaedf1ff196e2d02462aa29f7b5b88057ee"}],"concept.planetmath.differentiablefunction":[{"id":"assertion.concept.planetmath.differentiablefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differentiable function as stated in the captured PlanetMath entry differentiablefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A24, 57R35) states: Let f : V → W be a function , where V and W are Banach spaces .","support":[{"end":111,"quote":"Let\nf\n:\nV\n→\nW\nbe a\nfunction\n, where\nV\nand\nW\nare\nBanach spaces\n.","source_id":"planetmath.differentiablefunction","source_sha256":"e0fac66e87a460b27c20cf9c0f209277d0e4d88e7bf6cd4499616e0ab53e705f","start":48}],"target_id":"concept.planetmath.differentiablefunction","target_kind":"node","target_sha256":"db0d2b2fbe3d3761e899a7d33ce54e343c9937daa4745e814c503bda682bde55"}],"concept.planetmath.differentialequation":[{"id":"assertion.concept.planetmath.differentialequation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differential equation as stated in the captured PlanetMath entry differentialequation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 35-00, 34-00) states: A differential equation is an equation involving an unknown function of one or more variables, its derivatives and the variables.","support":[{"end":174,"quote":"A\ndifferential equation\nis an equation involving an unknown\nfunction\nof one or more variables, its\nderivatives\nand the\n variables.","source_id":"planetmath.differentialequation","source_sha256":"7b38d147ffd71672878ef28f00f3beba388a5cd51984dd09b57d0317785db9d2","start":44}],"target_id":"concept.planetmath.differentialequation","target_kind":"node","target_sha256":"7d2d1badeb1606f43949e257558e52d2eaa1c252f950e3eb939ce463a7b27b5d"}],"concept.planetmath.differentialoperator":[{"id":"assertion.concept.planetmath.differentialoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Differential operator as stated in the captured PlanetMath entry differentialoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53-00, 35-00, 47E05, 47F05) states: Roughly speaking, a differential operator is a mapping , typically understood to be linear, that transforms a function into another function by means of partial derivatives and multiplication by other functions.","support":[{"end":255,"quote":"Roughly speaking, a\ndifferential operator\nis a\nmapping\n,\ntypically understood to be linear, that transforms a\nfunction\ninto\nanother function by means of\npartial derivatives\nand\nmultiplication\nby\nother functions.","source_id":"planetmath.differentialoperator","source_sha256":"c56969befd423e88640d0fc5dc0ce97481291b8a771098c14043d25f8cc266ad","start":44}],"target_id":"concept.planetmath.differentialoperator","target_kind":"node","target_sha256":"2f7576bb2af812e267cb8c0f230734cdb7e65f7f0b4c55bfd1fc5794b4c6358d"}],"concept.planetmath.dimension":[{"id":"assertion.concept.planetmath.dimension","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension as stated in the captured PlanetMath entry dimension","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 00-01, 15A03, 54F45) states: The word dimension in mathematics has many definitions, but all of them are trying to quantify our intuition that, for example, a sheet of paper has somehow one less dimension than a stack of papers.","support":[{"end":219,"quote":"The word\ndimension\nin mathematics has many definitions, but\nall of them are trying to quantify our intuition that, for\nexample, a sheet of paper has somehow one less dimension than a\nstack of papers.","source_id":"planetmath.dimension","source_sha256":"0315c16ffa6db3cf508500dcb43e5a59078102c1df53f224cd35b766c4e31f9c","start":20}],"target_id":"concept.planetmath.dimension","target_kind":"node","target_sha256":"72f64f0e9a42d9b4efe2b8a23215e65996b5f89fa51dc1338b7214b87da40da7"}],"concept.planetmath.dimensionofaposet":[{"id":"assertion.concept.planetmath.dimensionofaposet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension of a poset as stated in the captured PlanetMath entry dimensionofaposet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06, 06A07) states: Let P be a finite poset and ℛ be the family of all realizers of P .","support":[{"end":109,"quote":"Let\nP\nbe a finite poset and\nℛ\nbe the family of all\nrealizers\nof\nP\n.","source_id":"planetmath.dimensionofaposet","source_sha256":"5f4cdf00100229a0e4ad0214ad8be212b22a362ba996fdf2032f2e7cdb738334","start":42}],"target_id":"concept.planetmath.dimensionofaposet","target_kind":"node","target_sha256":"abaf4d5cf5aaca34be063ebe20959e7691f282bd65959136334c2569ae077119"}],"concept.planetmath.dimensionvectorspace":[{"id":"assertion.concept.planetmath.dimensionvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dimension (vector space) as stated in the captured PlanetMath entry dimensionvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space over a field K . We say that V is finite-dimensional if there exists a finite basis of V .","support":[{"end":164,"quote":"Let\nV\nbe a\nvector space\nover a field\nK\n. We say that\nV\nis\nfinite-dimensional\nif there exists a finite basis of\nV\n.","source_id":"planetmath.dimensionvectorspace","source_sha256":"6c1e3d7044526f332513244c178110c830a2169617e6a742bdf17e8cdaefdfed","start":50}],"target_id":"concept.planetmath.dimensionvectorspace","target_kind":"node","target_sha256":"5b2122a5acb422a92054bad90a4f719ca6a1723cb9bac149253745a90f1207a7"}],"concept.planetmath.directionalderivative":[{"id":"assertion.concept.planetmath.directionalderivative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Directional derivative as stated in the captured PlanetMath entry directionalderivative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B12, 26B10) states: Let U be an open set in ℝ n and f : U → ℂ is a differentiable function .","support":[{"end":118,"quote":"Let\nU\nbe an open set in\nℝ\nn\nand\nf\n:\nU\n→\nℂ\nis a\ndifferentiable\nfunction\n.","source_id":"planetmath.directionalderivative","source_sha256":"f3fd1edd1fdb5259a0875d87218a8e8577a4df64f0bc831a60fc2231904f182e","start":46}],"target_id":"concept.planetmath.directionalderivative","target_kind":"node","target_sha256":"a85b4423b65f2bcf40376e42994c0682782f9f0f5e53eaeae829fca28bf5412c"}],"concept.planetmath.directproductofpartialalgebras":[{"id":"assertion.concept.planetmath.directproductofpartialalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Direct product of partial algebras as stated in the captured PlanetMath entry directproductofpartialalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 08A62, 03E99) states: Let 𝑨 and 𝑩 be two partial algebraic systems of type τ .","support":[{"end":126,"quote":"Let\n𝑨\nand\n𝑩\nbe two\npartial algebraic systems\nof type\nτ\n.","source_id":"planetmath.directproductofpartialalgebras","source_sha256":"c96d79acd701cb81fa231206caf05c7c85a15945176cb2eef6a705debe6d5556","start":70}],"target_id":"concept.planetmath.directproductofpartialalgebras","target_kind":"node","target_sha256":"24af6023be520c1141c0483a60b9acf0fd8e0c5d7f887fd4663203a7247c2c7c"}],"concept.planetmath.discrete":[{"id":"assertion.concept.planetmath.discrete","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Discrete as stated in the captured PlanetMath entry discrete","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: This entry aims at highlighting the fact that all uses of the word discrete in mathematics are directly related to the core concept of discrete space : • A discrete set is a set that, endowed with the topology implied by the context, is a \\PMlinkescaptetext discrete space.","support":[{"end":291,"quote":"This entry aims at highlighting the fact that all uses of the word\ndiscrete\nin mathematics are directly related to the core concept of\ndiscrete space\n:\n•\nA\ndiscrete set\nis a set that, endowed with the\ntopology\nimplied by the context, is a\n\\PMlinkescaptetext\ndiscrete space.","source_id":"planetmath.discrete","source_sha256":"38f01bfc2a1f54ecd157da032df0434d43d4e6c9284589fcac9102913af91a2a","start":18}],"target_id":"concept.planetmath.discrete","target_kind":"node","target_sha256":"a19bbdcbcb8a4eff98346fdfcf51648b47be606b6be498fc6a52b4afeaf53896"}],"concept.planetmath.discretespace":[{"id":"assertion.concept.planetmath.discretespace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Discrete space as stated in the captured PlanetMath entry discretespace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: The discrete topology on a set X is the topology given by the power set of X .","support":[{"end":108,"quote":"The\ndiscrete topology\non a set\nX\nis the\ntopology\ngiven by\nthe\npower set\nof\nX\n.","source_id":"planetmath.discretespace","source_sha256":"7da720b0716ed6dc6260ea79f95bf1f83611c72f8722de0bf68ff96a39f732b0","start":30}],"target_id":"concept.planetmath.discretespace","target_kind":"node","target_sha256":"40aec15cd2a45d67cf9db28b4cb0d8a707239d13f5c80eef790a82d597f5807e"}],"concept.planetmath.disjointunion":[{"id":"assertion.concept.planetmath.disjointunion","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Disjoint union as stated in the captured PlanetMath entry disjointunion","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Disjoint union of two sets Let A and B be sets. Then their disjoint union is the union A ⁢ ∐ B := A ∪ ( B × { ⋆ } ) , where ⋆ is an object chosen so that A and B × { ⋆ } are disjoint .","support":[{"end":214,"quote":"Disjoint union of two sets\nLet\nA\nand\nB\nbe sets. Then their\ndisjoint union\nis the union\nA\n⁢\n∐\nB\n:=\nA\n∪\n(\nB\n×\n{\n⋆\n}\n)\n,\nwhere\n⋆\nis an object chosen so that\nA\nand\nB\n×\n{\n⋆\n}\nare\ndisjoint\n.","source_id":"planetmath.disjointunion","source_sha256":"7ff51b405f8a8f69366434eceedb12d23b1736b0963464c5e03908aa5ec6f556","start":30}],"target_id":"concept.planetmath.disjointunion","target_kind":"node","target_sha256":"1d19de78461b6fb0d33f681ff646d8114b78f5788a58772cbdf0842a3cac4492"}],"concept.planetmath.distanceinagraph":[{"id":"assertion.concept.planetmath.distanceinagraph","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distance (in a graph) as stated in the captured PlanetMath entry distanceinagraph","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C12) states: The distance d ⁢ ( x , y ) of two vertices x and y of a graph G is the length of the shortest path (or, equivalently, walk) from x to y .","support":[{"end":181,"quote":"The\ndistance\nd\n⁢\n(\nx\n,\ny\n)\nof two vertices\nx\nand\ny\nof a graph\nG\nis the length of the shortest path (or, equivalently, walk) from\nx\nto\ny\n.","source_id":"planetmath.distanceinagraph","source_sha256":"5623ea7c777a208864f03b7e093734054276be54ec1314f2dc82041119d3267f","start":44}],"target_id":"concept.planetmath.distanceinagraph","target_kind":"node","target_sha256":"d2f48c7074da983720440c9254204323a07c04d1030d25658b1fd1911e876fcf"}],"concept.planetmath.distributionfunction":[{"id":"assertion.concept.planetmath.distributionfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distribution function as stated in the captured PlanetMath entry distributionfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60E05) states: [this entry is currently being revised, so hold off on corrections until this line is removed] Let F : ℝ → ℝ .","support":[{"end":154,"quote":"[this entry is currently being revised, so hold off on corrections until\nthis line is removed]\nLet\nF\n:\nℝ\n→\nℝ\n.","source_id":"planetmath.distributionfunction","source_sha256":"b30413e389f37aa50335f7e81ea9685b03a912968db67db42ce2f3872abb54c7","start":44}],"target_id":"concept.planetmath.distributionfunction","target_kind":"node","target_sha256":"69f75760b9f202891f6857c0f5483373c8f08e6e8376b6577daf381ee7c00ef8"}],"concept.planetmath.distributivity":[{"id":"assertion.concept.planetmath.distributivity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Distributivity as stated in the captured PlanetMath entry distributivity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06D99, 16-00, 13-00, 17-00) states: Given a set ( http://planetmath.org/Set ) S with two binary operations + : S × S → S and ⋅ : S × S → S , we say that ⋅ is right distributive over + if ( a + b ) ⋅ c = ( a ⋅ c ) + ( b ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S and left distributive over + if a ⋅ ( b + c ) = ( a ⋅ b ) + ( a ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S .","support":[{"end":346,"quote":"Given a set (\nhttp://planetmath.org/Set\n)\nS\nwith two\nbinary operations\n+\n:\nS\n×\nS\n→\nS\nand\n⋅\n:\nS\n×\nS\n→\nS\n, we say that\n⋅\nis\nright distributive\nover\n+\nif\n(\na\n+\nb\n)\n⋅\nc\n=\n(\na\n⋅\nc\n)\n+\n(\nb\n⋅\nc\n)\n⁢\nfor\n⁢\nall\n⁢\na\n,\nb\n,\nc\n∈\nS\nand\nleft distributive\nover\n+\nif\na\n⋅\n(\nb\n+\nc\n)\n=\n(\na\n⋅\nb\n)\n+\n(\na\n⋅\nc\n)\n⁢\nfor\n⁢\nall\n⁢\na\n,\nb\n,\nc\n∈\nS\n.","source_id":"planetmath.distributivity","source_sha256":"e8326f02ba5b45e932461b93d27778c584bbf39219f0c6157ad6c8c4964820c8","start":30}],"target_id":"concept.planetmath.distributivity","target_kind":"node","target_sha256":"e52ebf9a6c0c80f5d2eb7803bf91e68b5530e2349d9eb191242c2d4de01f270c"}],"concept.planetmath.division":[{"id":"assertion.concept.planetmath.division","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Division as stated in the captured PlanetMath entry division","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05, 12E99) states: Division is the operation which assigns to every two numbers (or more generally, elements of a field) a and b their quotient or ratio, provided that the latter, b , is distinct from zero.","support":[{"end":205,"quote":"Division\nis the\noperation\nwhich assigns to every two numbers (or more generally, elements of a field)\na\nand\nb\ntheir\nquotient\nor ratio, provided that the latter,\nb\n, is distinct from zero.","source_id":"planetmath.division","source_sha256":"38d3f7ec639f947b28c23bfa896047dadc91f2a24fc58dd1a5f8e8eca0684ae4","start":18}],"target_id":"concept.planetmath.division","target_kind":"node","target_sha256":"c76efcf75c7ba0082f0f8b1f4d0b89f0666aeac363685654e97a6701314332d4"}],"concept.planetmath.dotproduct":[{"id":"assertion.concept.planetmath.dotproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dot product as stated in the captured PlanetMath entry dotproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 83C05, 15A63, 14-02, 14-01) states: Let u = ( u 1 , u 2 , … , u n ) and v = ( v 1 , v 2 , … , v n ) two vectors on k n where k is a field (like ℝ or ℂ ).","support":[{"end":141,"quote":"Let\nu\n=\n(\nu\n1\n,\nu\n2\n,\n…\n,\nu\nn\n)\nand\nv\n=\n(\nv\n1\n,\nv\n2\n,\n…\n,\nv\nn\n)\ntwo vectors on\nk\nn\nwhere\nk\nis a field (like\nℝ\nor\nℂ\n).","source_id":"planetmath.dotproduct","source_sha256":"bbc793378686c83e92cd0b59a74742bd1e091ba85b39bac5f6384a7bdf44a108","start":24}],"target_id":"concept.planetmath.dotproduct","target_kind":"node","target_sha256":"a15f296ea042b359dd1a0b5804d283675a6745e7a08899201e0a6b767ec7ecfd"}],"concept.planetmath.dualhomomorphism":[{"id":"assertion.concept.planetmath.dualhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dual homomorphism as stated in the captured PlanetMath entry dualhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A72, 15A04) states: Definition. Let U , V be vector spaces over a field 𝕂 , and T : U → V be a homomorphism (a linear map ) between them.","support":[{"end":153,"quote":"Definition.\nLet\nU\n,\nV\nbe\nvector spaces\nover a field\n𝕂\n, and\nT\n:\nU\n→\nV\nbe a\nhomomorphism\n(a\nlinear map\n) between them.","source_id":"planetmath.dualhomomorphism","source_sha256":"962b62432e6129649473c5b8f77d707e882b9cbad1610897541caa7ad8bbd7d0","start":36}],"target_id":"concept.planetmath.dualhomomorphism","target_kind":"node","target_sha256":"534d6f97c90158290a5552e7bb2109781b1c580d3cfb674158e9a5615519e4fd"}],"concept.planetmath.dualspace":[{"id":"assertion.concept.planetmath.dualspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Dual space as stated in the captured PlanetMath entry dualspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A99) states: Dual of a vector space ; dual bases Let V be a vector space over a field k .","support":[{"end":98,"quote":"Dual of a\nvector space\n; dual bases\nLet\nV\nbe a vector space over a field\nk\n.","source_id":"planetmath.dualspace","source_sha256":"538b0ad5f9617b178f08fcb6c17c1b904d3355b123a8b0d0c56cf9fc5390d8f2","start":22}],"target_id":"concept.planetmath.dualspace","target_kind":"node","target_sha256":"61d4c2b4e08779a58ef4f06ac9e67297f2cb53c8e0b498cedd6dac8bd331d50c"}],"concept.planetmath.egyptianfraction":[{"id":"assertion.concept.planetmath.egyptianfraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Egyptian fraction as stated in the captured PlanetMath entry egyptianfraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A35, 01A30, 01A20, 01A16) states: This narrative reports rational number as a/b rather than in the standard LaTeX fraction form.","support":[{"end":130,"quote":"This narrative reports\nrational number\nas a/b rather than in the standard LaTeX\nfraction\nform.","source_id":"planetmath.egyptianfraction","source_sha256":"ebe0aaba0b5a9edd84799c6037e9a00e543b00674e4d0d5dd279e3da967235f8","start":36}],"target_id":"concept.planetmath.egyptianfraction","target_kind":"node","target_sha256":"19d5410043ac5ec5a5cb64253c5bc374ae9534dfe44d28d25976b00bdb64a665"}],"concept.planetmath.elementaryembedding":[{"id":"assertion.concept.planetmath.elementaryembedding","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary embedding as stated in the captured PlanetMath entry elementaryembedding","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C99) states: Let τ be a signature and 𝒜 and ℬ be two structures for τ such that f : 𝒜 → ℬ is an embedding .","support":[{"end":136,"quote":"Let\nτ\nbe a\nsignature\nand\n𝒜\nand\nℬ\nbe two\nstructures\nfor\nτ\nsuch that\nf\n:\n𝒜\n→\nℬ\nis an\nembedding\n.","source_id":"planetmath.elementaryembedding","source_sha256":"747f1daf72be77b5c6e91b642733e84d7b8fdb1c1af9ec763f244b675cf70794","start":42}],"target_id":"concept.planetmath.elementaryembedding","target_kind":"node","target_sha256":"6909d12aea8ea343212f7e5d3aa13b97e94f04f6cc4396247de3237ed763369a"}],"concept.planetmath.elementaryfunction":[{"id":"assertion.concept.planetmath.elementaryfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary function as stated in the captured PlanetMath entry elementaryfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26A99) states: An elementary function is a real function (of one variable) that can be constructed by a finite number of elementary operations ( addition , subtraction , multiplication and division ) and compositions from constant functions , the identity function ( x ↦ x ), algebraic functions , exponential functions , logarithm functions , trigonometric functions and cyclometric functions .","support":[{"end":420,"quote":"An\nelementary function\nis a\nreal function\n(of one variable) that can be constructed by a finite number of elementary operations (\naddition\n,\nsubtraction\n,\nmultiplication\nand\ndivision\n) and\ncompositions\nfrom\nconstant functions\n, the\nidentity function\n(\nx\n↦\nx\n),\nalgebraic functions\n,\nexponential functions\n,\nlogarithm functions\n,\ntrigonometric functions\nand\ncyclometric functions\n.","source_id":"planetmath.elementaryfunction","source_sha256":"4e393cb1d9ae42f49c31c1dfe1e03a0380dfd69b7a0334b8255d86f869c77884","start":40}],"target_id":"concept.planetmath.elementaryfunction","target_kind":"node","target_sha256":"2127e24bf02042db6a6abbd9f1a76e4263f6bd3d7c02ec05cd8c2cb8a408f118"}],"concept.planetmath.elementaryrecursivefunction":[{"id":"assertion.concept.planetmath.elementaryrecursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Elementary recursive function as stated in the captured PlanetMath entry elementaryrecursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: Informally, elementary recursive functions are functions that can be obtained from functions encountered in elementary schools: addition , multiplication , subtraction , and division , using basic operations such as substitutions and finite summation and product .","support":[{"end":324,"quote":"Informally,\nelementary recursive functions\nare\nfunctions\nthat can be obtained from functions encountered in elementary schools:\naddition\n,\nmultiplication\n,\nsubtraction\n, and\ndivision\n, using basic\noperations\nsuch as substitutions and finite\nsummation\nand\nproduct\n.","source_id":"planetmath.elementaryrecursivefunction","source_sha256":"a85f2633dfb92a9c67e832bb9aa3019d721ddbabf7dd87b99188f48e03b93670","start":60}],"target_id":"concept.planetmath.elementaryrecursivefunction","target_kind":"node","target_sha256":"cf3159d6ae138f33c78ac9e9b9b72c3d91e7365e001e33a49dacffe544639d5c"}],"concept.planetmath.emptyset":[{"id":"assertion.concept.planetmath.emptyset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Empty set as stated in the captured PlanetMath entry emptyset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 65H05, 65H10) states: An empty set is a set ∅ that contains no elements .","support":[{"end":71,"quote":"An\nempty set\nis a set\n∅\nthat contains no\nelements\n.","source_id":"planetmath.emptyset","source_sha256":"f63f3e9f7ce921da07ce93dab3c96e557f35d3b7be0d87cfd00b915280f61096","start":20}],"target_id":"concept.planetmath.emptyset","target_kind":"node","target_sha256":"a49918ec9876de51177a5a0fb6e277893ff04a9806a0774aa881f8cf7cde3ced"}],"concept.planetmath.endpoint":[{"id":"assertion.concept.planetmath.endpoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Endpoint as stated in the captured PlanetMath entry endpoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51-00, 03-00) states: An endpoint of a line segment L is a point that belongs to the boundary of L .","support":[{"end":96,"quote":"An\nendpoint\nof a\nline segment\nL\nis a point that belongs to the boundary of\nL\n.","source_id":"planetmath.endpoint","source_sha256":"402e3864852f9f11157ba03530216697ac6261516dc5fae0069e97c5428bfc8a","start":18}],"target_id":"concept.planetmath.endpoint","target_kind":"node","target_sha256":"b5309ea8148ad98a01ac78f9a25aed2fbf8bb57f599c3ba0c9f7353b253a1949"}],"concept.planetmath.equality":[{"id":"assertion.concept.planetmath.equality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equality as stated in the captured PlanetMath entry equality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 06-00) states: In any set S , the equality , denoted by “ = ”, is a binary relation which is reflexive , symmetric , transitive and antisymmetric, i.e.","support":[{"end":154,"quote":"In any set\nS\n, the\nequality\n, denoted by “\n=\n”, is a\nbinary relation\nwhich is\nreflexive\n,\nsymmetric\n,\ntransitive\nand antisymmetric, i.e.","source_id":"planetmath.equality","source_sha256":"af30c238db42464b6f0a84236772ce288a20847ce17b217dcd069f9a3d70c8eb","start":18}],"target_id":"concept.planetmath.equality","target_kind":"node","target_sha256":"8f8026b98eb6204373eb04d4e794a282126cd892063d867a07a68294c055d605"}],"concept.planetmath.equationalclass":[{"id":"assertion.concept.planetmath.equationalclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equational class as stated in the captured PlanetMath entry equationalclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08B99, 03C05) states: Let K be a class of algebraic systems of the same type.","support":[{"end":89,"quote":"Let\nK\nbe a class of\nalgebraic systems\nof the same type.","source_id":"planetmath.equationalclass","source_sha256":"fa23583bb878a26aad4a76446935fe1ab797e37c46d92abf33edacaba89f1f62","start":34}],"target_id":"concept.planetmath.equationalclass","target_kind":"node","target_sha256":"6e77cfbe0a803e562604fc1c4c260bce74001e9a1d536c693eff562968ef62bf"}],"concept.planetmath.equivalenceclass":[{"id":"assertion.concept.planetmath.equivalenceclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence class as stated in the captured PlanetMath entry equivalenceclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 93D05, 03B52, 93C42) states: Let S be a set with an equivalence relation ∼ . An equivalence class of S under ∼ is a subset T ⊂ S such that • If x ∈ T and y ∈ S , then x ∼ y if and only if y ∈ T • If S is nonempty, then T is nonempty For x ∈ S , the equivalence class containing x is often denoted by [ x ] , so that [ x ] := { y ∈ S ∣ x ∼ y } .","support":[{"end":351,"quote":"Let\nS\nbe a set with an\nequivalence relation\n∼\n. An\nequivalence class\nof\nS\nunder\n∼\nis a subset\nT\n⊂\nS\nsuch that\n•\nIf\nx\n∈\nT\nand\ny\n∈\nS\n, then\nx\n∼\ny\nif and only if\ny\n∈\nT\n•\nIf\nS\nis nonempty, then\nT\nis nonempty\nFor\nx\n∈\nS\n, the equivalence class containing\nx\nis often denoted by\n[\nx\n]\n, so that\n[\nx\n]\n:=\n{\ny\n∈\nS\n∣\nx\n∼\ny\n}\n.","source_id":"planetmath.equivalenceclass","source_sha256":"76da04375aac43d923d8252c4cd271aa7c5bb55caa49ba85346be9a26e0c697e","start":36}],"target_id":"concept.planetmath.equivalenceclass","target_kind":"node","target_sha256":"498dbf5c31dcd5c1ecc25fd97524ba5857228cc871aa248137da5169b67947a3"}],"concept.planetmath.equivalenceofforcingnotions":[{"id":"assertion.concept.planetmath.equivalenceofforcingnotions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence of forcing notions as stated in the captured PlanetMath entry equivalenceofforcingnotions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E35, 03E40) states: Let P and Q be two forcing notions such that given any generic subset G of P there is a generic subset H of Q with 𝔐 ⁢ [ G ] = 𝔐 ⁢ [ H ] and vice-versa.","support":[{"end":214,"quote":"Let\nP\nand\nQ\nbe two\nforcing\nnotions such that given any\ngeneric\nsubset\nG\nof\nP\nthere is a generic subset\nH\nof\nQ\nwith\n𝔐\n⁢\n[\nG\n]\n=\n𝔐\n⁢\n[\nH\n]\nand vice-versa.","source_id":"planetmath.equivalenceofforcingnotions","source_sha256":"28541c0b4cbf06c5ab816c4ae3a4879f59a6a21a71af6cd9c129fda5c6111172","start":62}],"target_id":"concept.planetmath.equivalenceofforcingnotions","target_kind":"node","target_sha256":"93ab0871d79fcdebbf87a37fdc34d2eeb66c746773a36049020ddb84ae824b3a"}],"concept.planetmath.equivalencerelation":[{"id":"assertion.concept.planetmath.equivalencerelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalence relation as stated in the captured PlanetMath entry equivalencerelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06-00, 03D20) states: An equivalence relation ∼ on a set S is a relation that is: Reflexive .","support":[{"end":113,"quote":"An\nequivalence relation\n∼\non a set\nS\nis a\nrelation\nthat is:\nReflexive\n.","source_id":"planetmath.equivalencerelation","source_sha256":"a85f2966361ab066eb956976d7eec4e8dd3ea4e5403e2cad5879a6ff596a7f9f","start":42}],"target_id":"concept.planetmath.equivalencerelation","target_kind":"node","target_sha256":"ecd0bd9e7dd0146c245702bb2140f15e0b237a9b8364caad565a6326fcdd4d3d"}],"concept.planetmath.equivalentmachines":[{"id":"assertion.concept.planetmath.equivalentmachines","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Equivalent machines as stated in the captured PlanetMath entry equivalentmachines","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Let M 1 = ( S 1 , Σ , Δ , σ 1 , λ 1 ) and M 2 = ( S 2 , Σ , Δ , σ 2 , λ 2 ) be two Mealy machines .","support":[{"end":139,"quote":"Let\nM\n1\n=\n(\nS\n1\n,\nΣ\n,\nΔ\n,\nσ\n1\n,\nλ\n1\n)\nand\nM\n2\n=\n(\nS\n2\n,\nΣ\n,\nΔ\n,\nσ\n2\n,\nλ\n2\n)\nbe two\nMealy machines\n.","source_id":"planetmath.equivalentmachines","source_sha256":"2815a84cc705544571084658be946d680ceea430c35205273efe522c8c0435e8","start":40}],"target_id":"concept.planetmath.equivalentmachines","target_kind":"node","target_sha256":"93351c5cfe0b12d36b60856a29e1a40d95bbb077d4b804c55a407a3c4fe30d7e"}],"concept.planetmath.euclideanfield":[{"id":"assertion.concept.planetmath.euclideanfield","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Euclidean field as stated in the captured PlanetMath entry euclideanfield","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D15) states: An ordered field F is Euclidean if every non-negative element a ( a ≥ 0 ) is a square in F (there exists b ∈ F such that b 2 = a ).","support":[{"end":163,"quote":"An\nordered field\nF\nis\nEuclidean\nif every non-negative element\na\n(\na\n≥\n0\n) is a square in\nF\n(there exists\nb\n∈\nF\nsuch that\nb\n2\n=\na\n).","source_id":"planetmath.euclideanfield","source_sha256":"03562a7d3d0cc3ae7fb9fcdca75c81b11566ca6e9cec87b312e1cb304350d316","start":32}],"target_id":"concept.planetmath.euclideanfield","target_kind":"node","target_sha256":"58501fa778c0c1bb5611da118702f07d5b6f1fde61a70ef6ab62ed0b16aefdf6"}],"concept.planetmath.euclideanspace":[{"id":"assertion.concept.planetmath.euclideanspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Euclidean space as stated in the captured PlanetMath entry euclideanspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03, 51M05) states: 1 Definition Euclidean n -space is a metric space ( E , d ) with the property that the group of isometries is transitive and is isomorphic to an n -dimensional Euclidean vector space .","support":[{"end":216,"quote":"1\nDefinition\nEuclidean\nn\n-space\nis a\nmetric space\n(\nE\n,\nd\n)\nwith the\nproperty\nthat the\ngroup of isometries\nis\ntransitive\nand is\nisomorphic\nto an\nn\n-dimensional\nEuclidean vector space\n.","source_id":"planetmath.euclideanspace","source_sha256":"966d29e4a1518e5374895473d22fc2e55f5f208833aeded96fc9129e4ce1e968","start":32}],"target_id":"concept.planetmath.euclideanspace","target_kind":"node","target_sha256":"721016d12b8c4a46aa6b7996d0c8a31ac4efb2f7d15cc28605b21bba12b494c2"}],"concept.planetmath.evennumber":[{"id":"assertion.concept.planetmath.evennumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Even number as stated in the captured PlanetMath entry evennumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11-00, 03-00) states: Definition Suppose k is an integer . If there exists an integer r such that k = 2 ⁢ r + 1 , then k is an odd number .","support":[{"end":141,"quote":"Definition\nSuppose\nk\nis an\ninteger\n.\nIf there exists an integer\nr\nsuch that\nk\n=\n2\n⁢\nr\n+\n1\n, then\nk\nis an\nodd number\n.","source_id":"planetmath.evennumber","source_sha256":"d477e373ad2c3909567f528ce7a4c293fc2aa89be1c6c3de918dd9d99077c4d8","start":24}],"target_id":"concept.planetmath.evennumber","target_kind":"node","target_sha256":"ecf5e190735b51bf3030c6d84f750af3c4ea6fb30949edcaa1a47c94071da3b2"}],"concept.planetmath.exclusiveor":[{"id":"assertion.concept.planetmath.exclusiveor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Exclusive or as stated in the captured PlanetMath entry exclusiveor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: The logical operator xor, short for “ exclusive or ”, is a binary operator that is true iff exactly one of its parameters is true, and thus corresponds to the normal use of “or” in English.","support":[{"end":215,"quote":"The logical operator xor, short for “\nexclusive or\n”, is a\nbinary operator\nthat is true iff exactly one of its\nparameters\nis true, and thus corresponds to the normal use of “or” in English.","source_id":"planetmath.exclusiveor","source_sha256":"0441d8a920d84b3531318d8d7bdc6e2beece8a2e2bcda625b6af9f3cac550d27","start":26}],"target_id":"concept.planetmath.exclusiveor","target_kind":"node","target_sha256":"79f999bc93c6160fd8e489293595dd541f3eea984f4b587f63166b449f82726a"}],"concept.planetmath.expression":[{"id":"assertion.concept.planetmath.expression","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Expression as stated in the captured PlanetMath entry expression","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: An expression is a symbol or of symbols used to denote a quantity or value.","support":[{"end":98,"quote":"An\nexpression\nis a symbol or  of symbols used to denote a quantity or value.","source_id":"planetmath.expression","source_sha256":"3baed8948760ea2522fc04ac0fc80d7c558b8b32f444d7f2e17c2b8f5d8a8744","start":22}],"target_id":"concept.planetmath.expression","target_kind":"node","target_sha256":"4f2c0b931790c96b7b43cb2d64301ff0db15ab92efdf45795f1ecdf64f88b45c"}],"concept.planetmath.extendedrealnumbers":[{"id":"assertion.concept.planetmath.extendedrealnumbers","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Extended real numbers as stated in the captured PlanetMath entry extendedrealnumbers","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 28-00, 12D99) states: The extended real numbers are the real numbers together with + ∞ (or simply ∞ ) and - ∞ .","support":[{"end":133,"quote":"The\nextended real numbers\nare the\nreal numbers\ntogether with\n+\n∞\n(or simply\n∞\n) and\n-\n∞\n.","source_id":"planetmath.extendedrealnumbers","source_sha256":"bfabb9a29830c238693cc7cf35514cc7a9be91eef96aa836c994f54b6ca27a6d","start":44}],"target_id":"concept.planetmath.extendedrealnumbers","target_kind":"node","target_sha256":"018ce5d1e15a542fe8ed4c51c25c734c93d640ff070c4b214c1e69884d5c6a4d"}],"concept.planetmath.extensionofafunction":[{"id":"assertion.concept.planetmath.extensionofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Extension of a function as stated in the captured PlanetMath entry extensionofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let f : X → Y be a function and A and B be sets such that X ⊆ A and Y ⊆ B .","support":[{"end":123,"quote":"Let\nf\n:\nX\n→\nY\nbe a\nfunction\nand\nA\nand\nB\nbe sets such that\nX\n⊆\nA\nand\nY\n⊆\nB\n.","source_id":"planetmath.extensionofafunction","source_sha256":"8aa2cc5525aa74fa816b67f8659d70dada127341c16d36d43e09b33b31bc208e","start":48}],"target_id":"concept.planetmath.extensionofafunction","target_kind":"node","target_sha256":"248fb96aa4a935b02d2cfa40a6c33be98c52ec02058f231e88d6e38d5beb3c14"}],"concept.planetmath.filterbasis":[{"id":"assertion.concept.planetmath.filterbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Filter basis as stated in the captured PlanetMath entry filterbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 54A99) states: A filter subbasis for a set S is a collection of subsets of S which has the finite intersection property .","support":[{"end":132,"quote":"A\nfilter subbasis\nfor a set\nS\nis a\ncollection\nof subsets of\nS\nwhich has the\nfinite intersection property\n.","source_id":"planetmath.filterbasis","source_sha256":"6a60fdda6393526525dd9b93e01c533c928075bab4153ffc867be3e39f9d6304","start":26}],"target_id":"concept.planetmath.filterbasis","target_kind":"node","target_sha256":"f046feeac14a3b19440193357ea4846df99ff1356f1e0e8135c1d95fef5da516"}],"concept.planetmath.finiteintersectionproperty":[{"id":"assertion.concept.planetmath.finiteintersectionproperty","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finite intersection property as stated in the captured PlanetMath entry finiteintersectionproperty","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D30) states: A collection 𝒜 = { A α } α ∈ I of subsets of a set X is said to have the finite intersection property , abbreviated f.i.p., if every finite subcollection { A 1 , A 2 , … , A n } of 𝒜 satisifes ⋂ i = 1 n A i ≠ ∅ .","support":[{"end":270,"quote":"A\ncollection\n𝒜\n=\n{\nA\nα\n}\nα\n∈\nI\nof subsets of a set\nX\nis said to have the\nfinite intersection property\n, abbreviated f.i.p., if every finite subcollection\n{\nA\n1\n,\nA\n2\n,\n…\n,\nA\nn\n}\nof\n𝒜\nsatisifes\n⋂\ni\n=\n1\nn\nA\ni\n≠\n∅\n.","source_id":"planetmath.finiteintersectionproperty","source_sha256":"df1201756f27c2e70bca33b42071f9643a7937b1ea805edff15c189d3bec20ce","start":58}],"target_id":"concept.planetmath.finiteintersectionproperty","target_kind":"node","target_sha256":"b5aeca550180645e402faf23aecadb25246526c41f613609747b95118bf9e6ae"}],"concept.planetmath.finitelygeneratedgroup":[{"id":"assertion.concept.planetmath.finitelygeneratedgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finitely generated group as stated in the captured PlanetMath entry finitelygeneratedgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: A finitely generated group is a group that has a finite generating set .","support":[{"end":122,"quote":"A\nfinitely generated group\nis a group that has a finite\ngenerating set\n.","source_id":"planetmath.finitelygeneratedgroup","source_sha256":"dca73394539d096cdfb801ddae743742729be99171c900705aa1ab83ec230071","start":50}],"target_id":"concept.planetmath.finitelygeneratedgroup","target_kind":"node","target_sha256":"332fe1c780bf8b2dc04118c50e8b4d8b38de9aea9b8b6d71e63eccd475611e50"}],"concept.planetmath.finitelygeneratedmodule":[{"id":"assertion.concept.planetmath.finitelygeneratedmodule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Finitely generated module as stated in the captured PlanetMath entry finitelygeneratedmodule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D10) states: A module X over a ring R is said to be finitely generated if there is a finite subset Y of X such that Y spans X .","support":[{"end":166,"quote":"A module\nX\nover a ring\nR\nis said to be\nfinitely generated\nif there is a finite subset\nY\nof\nX\nsuch that\nY\nspans\nX\n.","source_id":"planetmath.finitelygeneratedmodule","source_sha256":"a7455dd591c69bb789d91d630acfbad481d56cffc8f6831b9fc6af8f2391ac41","start":52}],"target_id":"concept.planetmath.finitelygeneratedmodule","target_kind":"node","target_sha256":"62ee2a6bc0a70c8844612cf71bb92a0692dfb23e8e27fa6748ccc8f2779dc18e"}],"concept.planetmath.firstorderlanguage":[{"id":"assertion.concept.planetmath.firstorderlanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First order language as stated in the captured PlanetMath entry firstorderlanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let Σ be a signature . The first order language FO ⁡ ( Σ ) on Σ contains the following: 1.","support":[{"end":132,"quote":"Let\nΣ\nbe a\nsignature\n. The\nfirst order language\nFO\n⁡\n(\nΣ\n)\non\nΣ\ncontains the following:\n1.","source_id":"planetmath.firstorderlanguage","source_sha256":"fb15d0f0ac5eeaeb7f57bf3cc5e2e9af3f4404cd92288c9ac297912cb96227e5","start":42}],"target_id":"concept.planetmath.firstorderlanguage","target_kind":"node","target_sha256":"4cbccb7a5301ccdc25c4cf744799d84be133cd250f067c5e8f3c8192ecf12c35"}],"concept.planetmath.firstorderlogic":[{"id":"assertion.concept.planetmath.firstorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First order logic as stated in the captured PlanetMath entry firstorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: A logic is first order if it has exactly one type.","support":[{"end":86,"quote":"A logic is\nfirst order\nif it has exactly one type.","source_id":"planetmath.firstorderlogic","source_sha256":"e3ad498c6a49b7eb5aac7ca56e515b0166c822b91731ae5298c0b0d8a3eb4c54","start":36}],"target_id":"concept.planetmath.firstorderlogic","target_kind":"node","target_sha256":"de93a9be7a6285d4561ce7158a46f5a900137afc628c24860419a478088dcd41"}],"concept.planetmath.firstordertheory":[{"id":"assertion.concept.planetmath.firstordertheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"First-order theory as stated in the captured PlanetMath entry firstordertheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In what follows, references to sentences and sets of sentences are all relative to some fixed first-order language L .","support":[{"end":156,"quote":"In what follows, references to\nsentences\nand sets of sentences are\nall relative to some fixed\nfirst-order language\nL\n.","source_id":"planetmath.firstordertheory","source_sha256":"d6898716a8213c993e1fcb0a85c67a42024ade8ec9f41718ac13edef1256938d","start":38}],"target_id":"concept.planetmath.firstordertheory","target_kind":"node","target_sha256":"bcdfb4b38a60e0d94d04d365236e9f63fd21897c7059c23e4a35335c15f8eab3"}],"concept.planetmath.fixedpointarithmetic":[{"id":"assertion.concept.planetmath.fixedpointarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fixed-point arithmetic as stated in the captured PlanetMath entry fixedpointarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A63) states: For computation or display in fixed-point arithmetic , each real number x has a variable number k > 0 of integer digits d k - 1 , … , d 0 (in order left to right from the most to the least significant digit) in base b but always l fractional digits to the right of the point.","support":[{"end":321,"quote":"For computation or display in\nfixed-point arithmetic\n, each\nreal number\nx\nhas a\nvariable\nnumber\nk\n>\n0\nof\ninteger\ndigits\nd\nk\n-\n1\n,\n…\n,\nd\n0\n(in order left to right from the most to the least significant digit) in base\nb\nbut always\nl\nfractional digits to the right of the point.","source_id":"planetmath.fixedpointarithmetic","source_sha256":"a86ef0d5114f9c699ac99b9ffebe6bdfd68861bdc18151d67e887e67dc0314f1","start":46}],"target_id":"concept.planetmath.fixedpointarithmetic","target_kind":"node","target_sha256":"630cbf3074f37cabb851931ca84679f88c8acd0817751a6144fc29a053fd7138"}],"concept.planetmath.fixedpointsofnormalfunctions":[{"id":"assertion.concept.planetmath.fixedpointsofnormalfunctions","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fixed points of normal functions as stated in the captured PlanetMath entry fixedpointsofnormalfunctions","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: If f : M → 𝐎𝐧 is a function from any set of ordinals to the class of ordinals then Fix ⁡ ( f ) = { x ∈ M ∣ f ⁢ ( x ) = x } is the set of fixed points of f .","support":[{"end":222,"quote":"If\nf\n:\nM\n→\n𝐎𝐧\nis a\nfunction\nfrom any set of\nordinals\nto the class of ordinals then\nFix\n⁡\n(\nf\n)\n=\n{\nx\n∈\nM\n∣\nf\n⁢\n(\nx\n)\n=\nx\n}\nis the set of\nfixed points\nof\nf\n.","source_id":"planetmath.fixedpointsofnormalfunctions","source_sha256":"47b73bfae01b15909d4508e523fc8e7a5bf9c3353d5c0b67ac07a4fa92c8d6c8","start":66}],"target_id":"concept.planetmath.fixedpointsofnormalfunctions","target_kind":"node","target_sha256":"fd33610726532689752444b927179070f468bc521bcd788e78f5b0e83e33b3e8"}],"concept.planetmath.fixtransformationaction":[{"id":"assertion.concept.planetmath.fixtransformationaction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fix (transformation action) as stated in the captured PlanetMath entry fixtransformationaction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","support":[{"end":115,"quote":"Let\nA\nbe a set, and\nT\n:\nA\n→\nA\na\ntransformation\nof that\nset.","source_id":"planetmath.fixtransformationaction","source_sha256":"d3cb2bdfb3013b0463b164b5c06959c441776c288287eb50fd9ea241626f7965","start":56}],"target_id":"concept.planetmath.fixtransformationaction","target_kind":"node","target_sha256":"6c886cfab169d9775f60c521554592580061ae2b635e6b1475dd8bab3b6fa062"}],"concept.planetmath.forcing":[{"id":"assertion.concept.planetmath.forcing","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Forcing as stated in the captured PlanetMath entry forcing","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E50, 03E35, 03E40) states: Forcing is the method used by Paul Cohen to prove the independence of the continuum hypothesis (CH).","support":[{"end":116,"quote":"Forcing\nis the method used by Paul Cohen to prove the independence of\nthe\ncontinuum hypothesis\n(CH).","source_id":"planetmath.forcing","source_sha256":"353ee6ad407003bddc1900353def0465ace3953bc68f2bb60ce71885d88126b8","start":16}],"target_id":"concept.planetmath.forcing","target_kind":"node","target_sha256":"c471d669e0508c067904c2c9a09795aa94c00b3be4986167fa7391491a9c3520"}],"concept.planetmath.formalgrammar":[{"id":"assertion.concept.planetmath.formalgrammar","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Formal grammar as stated in the captured PlanetMath entry formalgrammar","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 91F20, 68Q42, 68Q45, 03D05) states: Introduction A grammar , loosely speaking, is a set of rules that can be applied to words to generate sentences in a language .","support":[{"end":157,"quote":"Introduction\nA\ngrammar\n, loosely speaking, is a set of rules that can be applied to words to generate\nsentences\nin a\nlanguage\n.","source_id":"planetmath.formalgrammar","source_sha256":"567acce8c8c2db751f6838ad72336d49908d5faf948beeea78b20aa64df569a5","start":30}],"target_id":"concept.planetmath.formalgrammar","target_kind":"node","target_sha256":"7f9e5a4c277908b68f50e210ddd97adf765af162668d5c135123255b8c7b19df"}],"concept.planetmath.formalsystem":[{"id":"assertion.concept.planetmath.formalsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Formal system as stated in the captured PlanetMath entry formalsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B99) states: In mathematical logic, a formal system is a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","support":[{"end":165,"quote":"In mathematical logic, a\nformal system\nis a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","source_id":"planetmath.formalsystem","source_sha256":"e669654ecc1d2913232886b3609024c6912190a10fb14c6f434387130344395a","start":28}],"target_id":"concept.planetmath.formalsystem","target_kind":"node","target_sha256":"a89404e2e422d481822e2d1f2173aaed0b7458309782e2eeb0d5ae5a6120a296"}],"concept.planetmath.foundationsofmathematicsoverview":[{"id":"assertion.concept.planetmath.foundationsofmathematicsoverview","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Foundations of mathematics: overview as stated in the captured PlanetMath entry foundationsofmathematicsoverview","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05) states: The term ’ foundations of mathematics ’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","support":[{"end":244,"quote":"The term ’\nfoundations of mathematics\n’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","source_id":"planetmath.foundationsofmathematicsoverview","source_sha256":"54be6bc6974511fd7ca2fdbb9496c0c4fd101af6b44244debaa9af3aced1c3d1","start":74}],"target_id":"concept.planetmath.foundationsofmathematicsoverview","target_kind":"node","target_sha256":"0ee7645f846cf199f3b4e2919892002ba509ec94b068a58bee711cdb9a7c3113"}],"concept.planetmath.fraction":[{"id":"assertion.concept.planetmath.fraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fraction as stated in the captured PlanetMath entry fraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11-01) states: A fraction is a rational number expressed in the form n d or n / d , where n is designated the numerator and d the denominator .","support":[{"end":146,"quote":"A\nfraction\nis a\nrational number\nexpressed in the form\nn\nd\nor\nn\n/\nd\n, where\nn\nis designated the\nnumerator\nand\nd\nthe\ndenominator\n.","source_id":"planetmath.fraction","source_sha256":"aedeb38c7d47349becbcdfc4690c8d703253cec7370c694fb9b139a0c5a0acaf","start":18}],"target_id":"concept.planetmath.fraction","target_kind":"node","target_sha256":"b77fa4a02623029fd6ee0310bfc7efdd3f7aae70f47498e2bfdc8f127fa81925"}],"concept.planetmath.fractionalidealofcommutativering":[{"id":"assertion.concept.planetmath.fractionalidealofcommutativering","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fractional ideal of commutative ring as stated in the captured PlanetMath entry fractionalidealofcommutativering","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B30) states: Definition. Let R be a commutative ring having a regular element and let T be the total ring of fractions of R .","support":[{"end":186,"quote":"Definition.\nLet\nR\nbe a\ncommutative ring\nhaving a\nregular element\nand let\nT\nbe the\ntotal ring of fractions\nof\nR\n.","source_id":"planetmath.fractionalidealofcommutativering","source_sha256":"da94f25539c64564a7004b5277c8cab351772948cba139370823f9f84f11009c","start":74}],"target_id":"concept.planetmath.fractionalidealofcommutativering","target_kind":"node","target_sha256":"5ce7f45bc1134ce0a860b94af4cb5c101c994c4379120bf8609357b7aef89115"}],"concept.planetmath.framegroupoid":[{"id":"assertion.concept.planetmath.framegroupoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Frame groupoid as stated in the captured PlanetMath entry framegroupoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 18B40, 55U40) states: Definition 0.1 . Let 𝒢 be a groupoid , defined as usual by a category in which all morphisms are invertible , with the structure maps s , t : G 1 ⟶ G 0 , and u : G 0 ⟶ G 1 .","support":[{"end":203,"quote":"Definition 0.1\n.\nLet\n𝒢\nbe a\ngroupoid\n, defined as usual by a\ncategory\nin which all\nmorphisms\nare\ninvertible\n, with the\nstructure maps\ns\n,\nt\n:\nG\n1\n⟶\nG\n0\n, and\nu\n:\nG\n0\n⟶\nG\n1\n.","source_id":"planetmath.framegroupoid","source_sha256":"bcd32dc20dad1b2dd087020120e33557454559b015a82e81639cb8edcd2b3e9d","start":30}],"target_id":"concept.planetmath.framegroupoid","target_kind":"node","target_sha256":"cde6cd8a547d212d0ca5b440654e0b92fa9144f0df40296c949108842a96d8af"}],"concept.planetmath.freeandboundvariables":[{"id":"assertion.concept.planetmath.freeandboundvariables","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Free and bound variables as stated in the captured PlanetMath entry freeandboundvariables","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In the entry first-order language ( http://planetmath.org/TermsAndFormulas ), I have mentioned the use of variables without mentioning what variables really are.","support":[{"end":211,"quote":"In the entry\nfirst-order language\n(\nhttp://planetmath.org/TermsAndFormulas\n), I have mentioned the use of\nvariables\nwithout mentioning what variables really are.","source_id":"planetmath.freeandboundvariables","source_sha256":"6b208bdea2d2d3747dcbb29362a849843bbd451701ae5ce53419a24eaaa2a5d0","start":50}],"target_id":"concept.planetmath.freeandboundvariables","target_kind":"node","target_sha256":"777bd4c1af9dfa5fe6da22c4f0d014ae760be92bb17a7c62d4f076f1efc23b34"}],"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy":[{"id":"assertion.concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"From Hilbert’s tenth problem to Gödel’s trichotomy as stated in the captured PlanetMath entry fromhilbertstenthproblemtogodelstrichotomy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: From Hilbert’s tenth problem to Gödel’s trichotomy Contents: 1 Hilbert on the pursuit of knowledge 2 The two sources of mathematical knowledge 3 Hilbert’s epistemological optimism 4 Stricto sensu and conditional mathematics 5 The cumulative hierarchy 6 Diophantine equivalent of number theoretical statements 7 The incompleteness and consistency propositions 8 Sketch of a Gedankenexperiment 9 Gödel’s trichotomy 1 Hilbert on the pursuit of knowledge In the Summer of 1900 the Second International Congress of Mathematicians took place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","support":[{"end":768,"quote":"From Hilbert’s tenth problem to Gödel’s\ntrichotomy\nContents:\n1\nHilbert on the pursuit of knowledge\n2\nThe two sources of mathematical knowledge\n3\nHilbert’s epistemological optimism\n4\nStricto sensu\nand conditional mathematics\n5\nThe cumulative hierarchy\n6\nDiophantine equivalent of number theoretical statements\n7\nThe incompleteness and consistency propositions\n8\nSketch of a\nGedankenexperiment\n9\nGödel’s trichotomy\n1\nHilbert on the pursuit of knowledge\nIn the Summer of 1900 the\nSecond\nInternational Congress of Mathematicians\ntook place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","source_id":"planetmath.fromhilbertstenthproblemtogodelstrichotomy","source_sha256":"7f854e94132041bd5c6f4e329c77327ba4aa0167d818993b9911a34bad9039ae","start":102}],"target_id":"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","target_kind":"node","target_sha256":"43746c401a2c40270efae1c3021835a2edbba3e22af5c4b88c8629aafda85201"}],"concept.planetmath.functionalcompleteness":[{"id":"assertion.concept.planetmath.functionalcompleteness","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Functional completeness as stated in the captured PlanetMath entry functionalcompleteness","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Recall that in classical propositional logic , well-formed formulas (wffs) can be built up (recursively) from propositional variables via logical connectives .","support":[{"end":207,"quote":"Recall that in classical\npropositional logic\n,\nwell-formed formulas\n(wffs) can be built up (recursively) from\npropositional variables\nvia\nlogical connectives\n.","source_id":"planetmath.functionalcompleteness","source_sha256":"8f73f33fc7041b0710b241d1da8f9c87a891ce452b7f09c72be415840fc1c21c","start":48}],"target_id":"concept.planetmath.functionalcompleteness","target_kind":"node","target_sha256":"5676a92c09af1fdf3a35644ee1d5eb7edcf3d3d6c3305d3b78d7cc1affd98a31"}],"concept.planetmath.fuzzysubset":[{"id":"assertion.concept.planetmath.fuzzysubset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Fuzzy subset as stated in the captured PlanetMath entry fuzzysubset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E72, 03G20) states: Fuzzy set theory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","support":[{"end":143,"quote":"Fuzzy set\ntheory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","source_id":"planetmath.fuzzysubset","source_sha256":"e9606435807e101a02cc2ee19b4f4ce77407d9cba935ae38a59df08a3e9dce18","start":26}],"target_id":"concept.planetmath.fuzzysubset","target_kind":"node","target_sha256":"fa2658bdceb4c6f060237031aac68b29f9726f0fc34a79d8f778e3c189086834"}],"concept.planetmath.gametheoreticalquantifier":[{"id":"assertion.concept.planetmath.gametheoreticalquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Game-theoretical quantifier as stated in the captured PlanetMath entry gametheoreticalquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: A Henkin or branching quantifier is a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","support":[{"end":225,"quote":"A\nHenkin\nor\nbranching\nquantifier\nis a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","source_id":"planetmath.gametheoreticalquantifier","source_sha256":"f273f5c751ad7eaf1ab282a41d0262ff103fe9db53e2490f0038875f7c610632","start":56}],"target_id":"concept.planetmath.gametheoreticalquantifier","target_kind":"node","target_sha256":"f1a29a3e5abdce057af39fdad8576a6b6b09076893c445d4fa046d778928dd93"}],"concept.planetmath.generalizedcartesianproduct":[{"id":"assertion.concept.planetmath.generalizedcartesianproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Generalized Cartesian product as stated in the captured PlanetMath entry generalizedcartesianproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Given any family of sets { A j } j ∈ J indexed by an index set J , the generalized Cartesian product ∏ j ∈ J A j is the set of all functions f : J → ⋃ j ∈ J A j such that f ⁢ ( j ) ∈ A j for all j ∈ J .","support":[{"end":262,"quote":"Given any family of sets\n{\nA\nj\n}\nj\n∈\nJ\nindexed by\nan\nindex set\nJ\n, the\ngeneralized Cartesian product\n∏\nj\n∈\nJ\nA\nj\nis the set of all\nfunctions\nf\n:\nJ\n→\n⋃\nj\n∈\nJ\nA\nj\nsuch that\nf\n⁢\n(\nj\n)\n∈\nA\nj\nfor all\nj\n∈\nJ\n.","source_id":"planetmath.generalizedcartesianproduct","source_sha256":"0b32aed9d1eea98d790e81d334536e385fb287950497febab68a5707de96dc17","start":60}],"target_id":"concept.planetmath.generalizedcartesianproduct","target_kind":"node","target_sha256":"3fd4f7b7ea700bf6c5223e1ea0c220d723ee604004829bcfb462dcc811c476ef"}],"concept.planetmath.generalizedquantifier":[{"id":"assertion.concept.planetmath.generalizedquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Generalized quantifier as stated in the captured PlanetMath entry generalizedquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C80, 03B15, 03B10) states: Generalized quantifiers are an abstract way of defining quantifiers .","support":[{"end":115,"quote":"Generalized quantifiers\nare an abstract way of defining\nquantifiers\n.","source_id":"planetmath.generalizedquantifier","source_sha256":"e59d3ed3215ffa7903b6359f3e25fbd934b6db66a076c4d7a87916bb1e2324a5","start":46}],"target_id":"concept.planetmath.generalizedquantifier","target_kind":"node","target_sha256":"f11aa1d4cc2f86c55dd6d27a8b499f1b7f14a040dd68128191fb23a9c1bee69a"}],"concept.planetmath.gentzensystem":[{"id":"assertion.concept.planetmath.gentzensystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Gentzen system as stated in the captured PlanetMath entry gentzensystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03F07, 03F03, 03B99, 03F05) states: Introduction A Gentzen system , attributed to the German logician Gerhard Gentzen, is a variant form of a deductive system .","support":[{"end":154,"quote":"Introduction\nA\nGentzen system\n, attributed to the German logician Gerhard Gentzen, is a variant form of a\ndeductive system\n.","source_id":"planetmath.gentzensystem","source_sha256":"ca1c25bea5e61216f2019f4e1a542089c634b90b7895a5619964be6b26b2f41b","start":30}],"target_id":"concept.planetmath.gentzensystem","target_kind":"node","target_sha256":"5f726b612fb7964385e5aaa2da369ba9562643bc30f6558c4df5ad62685dc320"}],"concept.planetmath.goldenratio":[{"id":"assertion.concept.planetmath.goldenratio","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Golden ratio as stated in the captured PlanetMath entry goldenratio","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 40A05, 11B39) states: The “ Golden Ratio ”, or ϕ , has the value 1.61803398874989484820 ⁢ … This number gets its rather illustrious name from the fact that the Greeks thought that a rectangle with ratio of side lengths equal to ϕ was the most pleasing to the eye, and much of classical Greek architecture is based on this premise .","support":[{"end":335,"quote":"The “\nGolden Ratio\n”, or\nϕ\n, has the value\n1.61803398874989484820\n⁢\n…\nThis number gets its rather illustrious name from the fact that the Greeks thought that a\nrectangle\nwith ratio of side lengths equal to\nϕ\nwas the most pleasing to the eye, and much of classical Greek architecture is based on this\npremise\n.","source_id":"planetmath.goldenratio","source_sha256":"bbae260e99b6e341ae7d7808d56abd02f9a196b29ef360f6fcfd68dbcfea5a67","start":26}],"target_id":"concept.planetmath.goldenratio","target_kind":"node","target_sha256":"9c5ea3db48d4b0c14134f7cdb44aa02585a2f9c741ee568c34f49219117593c3"}],"concept.planetmath.graphtheory":[{"id":"assertion.concept.planetmath.graphtheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Graph theory as stated in the captured PlanetMath entry graphtheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 81Q30, 18G30, 05C50, 55U10, 18-00, 05C25, 05C99) states: Graph theory is the branch of mathematics that concerns itself with graphs.","support":[{"end":101,"quote":"Graph theory\nis the branch of mathematics that concerns itself with graphs.","source_id":"planetmath.graphtheory","source_sha256":"a238ecdd3860bd0f92dc862f3a78b53b069f3339bcc59ce8b329f2ad5a7e7b9a","start":26}],"target_id":"concept.planetmath.graphtheory","target_kind":"node","target_sha256":"9139074c1e2a1bfe6dca19b48e14838ce0c8605dac72a91afdbf46cc184dde48"}],"concept.planetmath.groupaction":[{"id":"assertion.concept.planetmath.groupaction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group action as stated in the captured PlanetMath entry groupaction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16W22, 20M30) states: Let G be a group and let X be a set. A left group action is a function ⋅ : G × X ⟶ X such that: 1.","support":[{"end":124,"quote":"Let\nG\nbe a group and let\nX\nbe a set. A left\ngroup action\nis a\nfunction\n⋅\n:\nG\n×\nX\n⟶\nX\nsuch that:\n1.","source_id":"planetmath.groupaction","source_sha256":"f648b2428bf38344e45af8023bd5e4f4ecd06b721781057425b1e730ac94832a","start":26}],"target_id":"concept.planetmath.groupaction","target_kind":"node","target_sha256":"f54cd1a609c97533940eded13a32d7bed6ffe1916011fb8e69d9cf0792a4d92c"}],"concept.planetmath.groupcohomologytopologicaldefinition":[{"id":"assertion.concept.planetmath.groupcohomologytopologicaldefinition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group cohomology as stated in the captured PlanetMath entry groupcohomologytopologicaldefinition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N25) states: Let G be a topological group . Suppose some contractible space X admits a fixed point free action of G , so that the quotient map p : X → X / G is a fibre map .","support":[{"end":244,"quote":"Let\nG\nbe a\ntopological group\n. Suppose some contractible space\nX\nadmits a\nfixed point\nfree action\nof\nG\n, so that the\nquotient map\np\n:\nX\n→\nX\n/\nG\nis a\nfibre map\n.","source_id":"planetmath.groupcohomologytopologicaldefinition","source_sha256":"288f02c27c85d67b9cbb2d9a71fa92499cd6ab692e3e7ca9fe73f8d51f3fd55e","start":84}],"target_id":"concept.planetmath.groupcohomologytopologicaldefinition","target_kind":"node","target_sha256":"29c92286371fd90a259df12fba1c36750896bd754dd4e6baf9668347e5b24873"}],"concept.planetmath.grouphomomorphism":[{"id":"assertion.concept.planetmath.grouphomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group homomorphism as stated in the captured PlanetMath entry grouphomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Let ( G , ∗ ) and ( K , ⋆ ) be two groups. A group homomorphism is a function ϕ : G → K such that ϕ ⁢ ( s ∗ t ) = ϕ ⁢ ( s ) ⋆ ϕ ⁢ ( t ) for all s , t ∈ G .","support":[{"end":193,"quote":"Let\n(\nG\n,\n∗\n)\nand\n(\nK\n,\n⋆\n)\nbe two groups. A\ngroup homomorphism\nis a\nfunction\nϕ\n:\nG\n→\nK\nsuch that\nϕ\n⁢\n(\ns\n∗\nt\n)\n=\nϕ\n⁢\n(\ns\n)\n⋆\nϕ\n⁢\n(\nt\n)\nfor all\ns\n,\nt\n∈\nG\n.","source_id":"planetmath.grouphomomorphism","source_sha256":"c16b7c9435adce0d753087f14d4e456d87212c8eccec7478ba7e4069bf191e6b","start":38}],"target_id":"concept.planetmath.grouphomomorphism","target_kind":"node","target_sha256":"ac46af866594edc1b28cbe89b8f9898953631cd7eb858b2e3de496db9bfc1636"}],"concept.planetmath.groupoid":[{"id":"assertion.concept.planetmath.groupoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Groupoid as stated in the captured PlanetMath entry groupoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02) states: A groupoid G is a set together with a binary operation ⋅ : G × G ⟶ G .","support":[{"end":88,"quote":"A groupoid\nG\nis a set together with a\nbinary operation\n⋅\n:\nG\n×\nG\n⟶\nG\n.","source_id":"planetmath.groupoid","source_sha256":"d3335826a7785653a269813a5151119f2cefaf05692a1527322382135e3fd851","start":18}],"target_id":"concept.planetmath.groupoid","target_kind":"node","target_sha256":"34e129ce358ad8490f3b0cbf809050613ea0f3c62f1920def42c0ac87fd40263"}],"concept.planetmath.groupoidrepresentation":[{"id":"assertion.concept.planetmath.groupoidrepresentation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Groupoid representation as stated in the captured PlanetMath entry groupoidrepresentation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 55U40) states: Let q : E ⟶ M be a vector bundle , with E the total space , and M a smooth manifold.","support":[{"end":132,"quote":"Let\nq\n:\nE\n⟶\nM\nbe a\nvector bundle\n, with\nE\nthe\ntotal space\n, and\nM\na smooth manifold.","source_id":"planetmath.groupoidrepresentation","source_sha256":"8e8d8e1166d6ca6feb298dba27ae246f9589f95a58b5e6255256ed7db4a1e70f","start":48}],"target_id":"concept.planetmath.groupoidrepresentation","target_kind":"node","target_sha256":"45d3d8c63211b0236630b986e2c1c4c6daf5e6e301420c6cc99105ab89a1f948"}],"concept.planetmath.grouprepresentation":[{"id":"assertion.concept.planetmath.grouprepresentation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Group representation as stated in the captured PlanetMath entry grouprepresentation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20C99) states: Let G be a group, and let V be a vector space . A representation of G in V is a group homomorphism ρ : G → GL ⁡ ( V ) from G to the general linear group GL ⁡ ( V ) of invertible linear transformations of V .","support":[{"end":249,"quote":"Let\nG\nbe a group, and let\nV\nbe a\nvector space\n. A\nrepresentation\nof\nG\nin\nV\nis a\ngroup homomorphism\nρ\n:\nG\n→\nGL\n⁡\n(\nV\n)\nfrom\nG\nto the\ngeneral linear group\nGL\n⁡\n(\nV\n)\nof\ninvertible linear transformations\nof\nV\n.","source_id":"planetmath.grouprepresentation","source_sha256":"efd4deb350686ab1b498f84ebba0ed9bc23a98b0e8bd535a57510af7b8b2cc1a","start":42}],"target_id":"concept.planetmath.grouprepresentation","target_kind":"node","target_sha256":"7f681a88d0c45945ae92c4699b0782ff8ed5e9c5f98b1df73f34c10439f6642b"}],"concept.planetmath.hartigsquantifier":[{"id":"assertion.concept.planetmath.hartigsquantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Härtig’s quantifier as stated in the captured PlanetMath entry hartigsquantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: Härtig’s quantifier is a quantifier which takes two variables and two formulas , written I ⁢ x ⁢ y ⁢ ϕ ⁢ ( x ) ⁢ ψ ⁢ ( y ) .","support":[{"end":164,"quote":"Härtig’s\nquantifier\nis a quantifier which takes two\nvariables\nand two\nformulas\n, written\nI\n⁢\nx\n⁢\ny\n⁢\nϕ\n⁢\n(\nx\n)\n⁢\nψ\n⁢\n(\ny\n)\n.","source_id":"planetmath.hartigsquantifier","source_sha256":"1682883e4724dede438204fa2a1f9616a4f3f8cdac3b708f2fe3de5925d2c709","start":40}],"target_id":"concept.planetmath.hartigsquantifier","target_kind":"node","target_sha256":"6134209f883c00620f5c5a7d353f3dfc48632fa76bab031b18ff4b856a921c15"}],"concept.planetmath.hausdorffspace":[{"id":"assertion.concept.planetmath.hausdorffspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff space as stated in the captured PlanetMath entry hausdorffspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: A topological space ( X , τ ) is said to be T 2 (or said to satisfy the T 2 axiom) if given distinct x , y ∈ X , there exist disjoint open sets U , V ∈ τ (that is, U ∩ V = ∅ ) such that x ∈ U and y ∈ V .","support":[{"end":235,"quote":"A\ntopological space\n(\nX\n,\nτ\n)\nis said to be\nT\n2\n(or said to\nsatisfy\nthe\nT\n2\naxiom) if given\ndistinct\nx\n,\ny\n∈\nX\n, there exist\ndisjoint\nopen sets\nU\n,\nV\n∈\nτ\n(that is,\nU\n∩\nV\n=\n∅\n)\nsuch that\nx\n∈\nU\nand\ny\n∈\nV\n.","source_id":"planetmath.hausdorffspace","source_sha256":"14022299a3f2a4b9a553acffd286cfe9ae824edd755df386245e91f52e5f0eb0","start":32}],"target_id":"concept.planetmath.hausdorffspace","target_kind":"node","target_sha256":"9ba1ff1abc6d9396cadc6307ba116b8f84fc8d754da144e56de780366d30b967"}],"concept.planetmath.hibehpapyrus":[{"id":"assertion.concept.planetmath.hibehpapyrus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hibeh Papyrus as stated in the captured PlanetMath entry hibehpapyrus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A20, 01A16, 01A15) states: The http://mathforum.org/kb/plaintext.jspa?messageID=5539288 Hibeh Papyrus was written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","support":[{"end":191,"quote":"The\nhttp://mathforum.org/kb/plaintext.jspa?messageID=5539288\nHibeh Papyrus\nwas written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","source_id":"planetmath.hibehpapyrus","source_sha256":"1be74e123e108320d5a470f87533099cb64399705a955c3bbd5e165494e46097","start":28}],"target_id":"concept.planetmath.hibehpapyrus","target_kind":"node","target_sha256":"56e0488a456dfb86c786b3993491def20f1af2d3a94938f38154df07d91aa8ff"}],"concept.planetmath.higherorderfunction":[{"id":"assertion.concept.planetmath.higherorderfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Higher-order function as stated in the captured PlanetMath entry higherorderfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q01) states: Any function that maps a function to anything or maps anything to a function is a higher-order function .","support":[{"end":149,"quote":"Any\nfunction\nthat maps a function to anything or maps anything to a function is a\nhigher-order function\n.","source_id":"planetmath.higherorderfunction","source_sha256":"cfa6f186c26ab0a163017a2fb7909daaaec48389f5dc03ceb57a9f9fc4d1b0bd","start":44}],"target_id":"concept.planetmath.higherorderfunction","target_kind":"node","target_sha256":"56f5d216d912dcb0f5232f5afe13c463c03fd36231b8336d6f403e1c8828e42d"}],"concept.planetmath.hilbertsystem":[{"id":"assertion.concept.planetmath.hilbertsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hilbert system as stated in the captured PlanetMath entry hilbertsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: A Hilbert system is a style (formulation) of deductive system that emphasizes the role played by the axioms in the system.","support":[{"end":152,"quote":"A\nHilbert system\nis a style (formulation) of\ndeductive system\nthat emphasizes the role played by the axioms in the system.","source_id":"planetmath.hilbertsystem","source_sha256":"38d3d28ba18de2eb213e200a6b8b08f4c7d85069b7675d573d83cd81a2502914","start":30}],"target_id":"concept.planetmath.hilbertsystem","target_kind":"node","target_sha256":"ec2bacfac25ef6db53db3ec16db2e495e80522bfd56a70faaf75ff923221f29c"}],"concept.planetmath.homeomorphism":[{"id":"assertion.concept.planetmath.homeomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homeomorphism as stated in the captured PlanetMath entry homeomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54C05) states: A homeomorphism f of topological spaces is a continuous , bijective map such that f - 1 is also continuous.","support":[{"end":135,"quote":"A\nhomeomorphism\nf\nof\ntopological spaces\nis a\ncontinuous\n,\nbijective\nmap such that\nf\n-\n1\nis also continuous.","source_id":"planetmath.homeomorphism","source_sha256":"022069f35dd6ff33f808e924ba9e618b54f132c346d90f8226eae42064c7fe8a","start":28}],"target_id":"concept.planetmath.homeomorphism","target_kind":"node","target_sha256":"a16f5b416a7f1c9e8feb5b5837b54bd3d78789f36ac5ba4e5e461e3b34a908a4"}],"concept.planetmath.homogeneous":[{"id":"assertion.concept.planetmath.homogeneous","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homogeneous as stated in the captured PlanetMath entry homogeneous","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C50) states: Let L be a first order language . Let M be an L - structure .","support":[{"end":85,"quote":"Let\nL\nbe a\nfirst order language\n. Let\nM\nbe an\nL\n-\nstructure\n.","source_id":"planetmath.homogeneous","source_sha256":"e27c99cd3012f99971913fbb7cdba74b469f7bada252785fbfd2ab0c145b1d69","start":24}],"target_id":"concept.planetmath.homogeneous","target_kind":"node","target_sha256":"38e1cb526c06844b99311093d5a333d00765f7ec42ec9babfa3b1b89ab1cc9d9"}],"concept.planetmath.homology":[{"id":"assertion.concept.planetmath.homology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homology as stated in the captured PlanetMath entry homology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55N10) states: Homology is the general name for a number of functors from topological spaces to abelian groups (or more generally modules over a fixed ring).","support":[{"end":160,"quote":"Homology\nis the general name for a number of\nfunctors\nfrom\ntopological spaces\nto\nabelian groups\n(or more generally modules over a fixed ring).","source_id":"planetmath.homology","source_sha256":"fbbaa3a2d6c50d81d13f9f714f8795f0272ba38d80d4f5ca2dc160298aafa5fc","start":18}],"target_id":"concept.planetmath.homology","target_kind":"node","target_sha256":"b31585b60bf45f12ddd2a16dc51221e165e087979db7236dff72efe775e62c06"}],"concept.planetmath.homomorphismbetweenalgebraicsystems":[{"id":"assertion.concept.planetmath.homomorphismbetweenalgebraicsystems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism between algebraic systems as stated in the captured PlanetMath entry homomorphismbetweenalgebraicsystems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A05) states: Let ( A , O ) , ( B , O ) be two algebraic systems with operator set O .","support":[{"end":150,"quote":"Let\n(\nA\n,\nO\n)\n,\n(\nB\n,\nO\n)\nbe two\nalgebraic systems\nwith operator set\nO\n.","source_id":"planetmath.homomorphismbetweenalgebraicsystems","source_sha256":"62fcd318ada9c98b4957235694178ab283d7765ef856fc8bb91f5f06e43e93b0","start":78}],"target_id":"concept.planetmath.homomorphismbetweenalgebraicsystems","target_kind":"node","target_sha256":"0809653a28d4fac908d47b079c80a29298a5edb376dc1085fedfad49053fd035"}],"concept.planetmath.homomorphismbetweenpartialalgebras":[{"id":"assertion.concept.planetmath.homomorphismbetweenpartialalgebras","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism between partial algebras as stated in the captured PlanetMath entry homomorphismbetweenpartialalgebras","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition Like subalgebras of partial algebras , there are also three ways to define homomorphisms between partial algebras .","support":[{"end":202,"quote":"Definition\nLike\nsubalgebras of partial algebras\n, there are also three ways to define\nhomomorphisms between partial algebras\n.","source_id":"planetmath.homomorphismbetweenpartialalgebras","source_sha256":"7853e396ff3c78fb41d414ed2d5a4dfd53cff4da95676dbe1dfa78e0fd66ed62","start":76}],"target_id":"concept.planetmath.homomorphismbetweenpartialalgebras","target_kind":"node","target_sha256":"9ec960b2ce0dce68967ab00ffce6f036e6fe1c7f3b543f8203bf21482fabb14a"}],"concept.planetmath.homomorphismoflanguages":[{"id":"assertion.concept.planetmath.homomorphismoflanguages","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Homomorphism of languages as stated in the captured PlanetMath entry homomorphismoflanguages","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45) states: Let Σ 1 and Σ 2 be two alphabets . A function h : Σ 1 * → Σ 2 * is called a homomorphism if it is a semigroup homomorphism from semigroups Σ 1 * to Σ 2 * .","support":[{"end":207,"quote":"Let\nΣ\n1\nand\nΣ\n2\nbe two\nalphabets\n. A\nfunction\nh\n:\nΣ\n1\n*\n→\nΣ\n2\n*\nis called a\nhomomorphism\nif it is a\nsemigroup homomorphism\nfrom\nsemigroups\nΣ\n1\n*\nto\nΣ\n2\n*\n.","source_id":"planetmath.homomorphismoflanguages","source_sha256":"c663db49300c40a3a2ec8264d9d12101a140ebe65d3bc03e87b43a7e73aa5751","start":52}],"target_id":"concept.planetmath.homomorphismoflanguages","target_kind":"node","target_sha256":"60473bab92f96d3596b44cf57bbb0d40a0919a8b99b6aff9cc754d8f86d83dfb"}],"concept.planetmath.hyperconnectedspace":[{"id":"assertion.concept.planetmath.hyperconnectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hyperconnected space as stated in the captured PlanetMath entry hyperconnectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be hyperconnected if no pair of nonempty open sets of X is disjoint (or, equivalently, if X is not the union of two proper closed sets ).","support":[{"end":212,"quote":"A\ntopological space\nX\nis said to be\nhyperconnected\nif no pair of nonempty\nopen sets\nof\nX\nis\ndisjoint\n(or, equivalently, if\nX\nis not the union of two proper\nclosed sets\n).","source_id":"planetmath.hyperconnectedspace","source_sha256":"a2997f7ba133294f79a067ae8ea1452156de174202b135d80c2166babf0538d0","start":42}],"target_id":"concept.planetmath.hyperconnectedspace","target_kind":"node","target_sha256":"c0cb3c0c939dac5e90929f18954a318bd285f2c51b404a0375716bf2b96c48ee"}],"concept.planetmath.hypergroup":[{"id":"assertion.concept.planetmath.hypergroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hypergroup as stated in the captured PlanetMath entry hypergroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N20) states: Hypergroups are generalizations of groups. Recall that a group is set with a binary operation on it satisfying a number of conditions.","support":[{"end":156,"quote":"Hypergroups\nare\ngeneralizations\nof groups. Recall that a group is set with a\nbinary operation\non it satisfying a number of conditions.","source_id":"planetmath.hypergroup","source_sha256":"fc9817b1f3655ed1b75b1decf0fde2cfa2e8f7ca344bc44c2d1c53bc3df902ff","start":22}],"target_id":"concept.planetmath.hypergroup","target_kind":"node","target_sha256":"7d6a60ef5425c45e53e42ff8b79ccec2352a015df8e3cc1eb16ea4c71a87f0ae"}],"concept.planetmath.hypostaticabstraction":[{"id":"assertion.concept.planetmath.hypostaticabstraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hypostatic abstraction as stated in the captured PlanetMath entry hypostaticabstraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B42, 03B30, 03B22, 03B15, 03A05, 00A30) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase contain \\PMlinkescapephrase Contain \\PMlinkescapephrase contains \\PMlinkescapephrase Contains \\PMlinkescapephrase occur \\PMlinkescapephrase occurs \\PMlinkescapephrase occur in \\PMlinkescapephrase occur ins \\PMlinkescapephrase occurs in \\PMlinkescapephrase occurs ins \\PMlinkescapephrase trace \\PMlinkescapephrase Trace \\PMlinkescapephrase variety \\PMlinkescapephrase Variety Hypostatic abstraction is a formal operation that takes an element of information, as expressed in a proposition X ⁢ is ⁡ Y , and conceives its information to consist in the relation between that subject and another subject, as expressed in the proposition X ⁢ has ⁡ Y ⁢ - ness .","support":[{"end":776,"quote":"\\PMlinkescapephrase\nadapted\n\\PMlinkescapephrase\nAdapted\n\\PMlinkescapephrase\ncontain\n\\PMlinkescapephrase\nContain\n\\PMlinkescapephrase\ncontains\n\\PMlinkescapephrase\nContains\n\\PMlinkescapephrase\noccur\n\\PMlinkescapephrase\noccurs\n\\PMlinkescapephrase\noccur in\n\\PMlinkescapephrase\noccur ins\n\\PMlinkescapephrase\noccurs in\n\\PMlinkescapephrase\noccurs ins\n\\PMlinkescapephrase\ntrace\n\\PMlinkescapephrase\nTrace\n\\PMlinkescapephrase\nvariety\n\\PMlinkescapephrase\nVariety\nHypostatic abstraction\nis a formal\noperation\nthat takes an element of information, as expressed in a\nproposition\nX\n⁢\nis\n⁡\nY\n,\nand conceives its information to consist in the\nrelation\nbetween that subject and another subject, as expressed in the proposition\nX\n⁢\nhas\n⁡\nY\n⁢\n-\nness\n.","source_id":"planetmath.hypostaticabstraction","source_sha256":"00c7fdb1f11b14fb1fa97d1033ec8cebd942bd459fb7fa3f791ddae1a5bcbbde","start":46}],"target_id":"concept.planetmath.hypostaticabstraction","target_kind":"node","target_sha256":"a4a90c266a1dc06550598d532f2f754228c5600f96b9a4927cc579ed21011ce3"}],"concept.planetmath.ideal1":[{"id":"assertion.concept.planetmath.ideal1","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ideal as stated in the captured PlanetMath entry ideal1","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M12, 20M10) states: Let S be a semigroup . An ideal of S is a non-empty subset of S which is closed under multiplication on either side by elements of S .","support":[{"end":146,"quote":"Let\nS\nbe a\nsemigroup\n. An\nideal\nof\nS\nis a non-empty subset of\nS\nwhich is\nclosed under\nmultiplication\non either side by elements of\nS\n.","source_id":"planetmath.ideal1","source_sha256":"af4f55ad8c1d8c11486e871233c91df5a4ba01c473b42b9b05afbdfd793dd899","start":12}],"target_id":"concept.planetmath.ideal1","target_kind":"node","target_sha256":"82dd111cb1e05cd051b87ed12586567e774ac192d6dd2a7bfe3c6bc08b572391"}],"concept.planetmath.idealgeneratedbyasubsetofaring":[{"id":"assertion.concept.planetmath.idealgeneratedbyasubsetofaring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ideal generated by a subset of a ring as stated in the captured PlanetMath entry idealgeneratedbyasubsetofaring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16D25) states: Let X be a subset of a ring R . Let S = { I k } be the collection of all left ideals of R that contain X (note that the set is nonempty since X ⊂ R and R is an ideal in itself).","support":[{"end":253,"quote":"Let\nX\nbe a subset of a ring\nR\n. Let\nS\n=\n{\nI\nk\n}\nbe the collection of all\nleft ideals\nof\nR\nthat contain\nX\n(note that the set is nonempty since\nX\n⊂\nR\nand\nR\nis an ideal in itself).","source_id":"planetmath.idealgeneratedbyasubsetofaring","source_sha256":"bbf5ac272cc255226426c5cb44c719c27a0711446a5b43c6c4760f4776a4cbb6","start":76}],"target_id":"concept.planetmath.idealgeneratedbyasubsetofaring","target_kind":"node","target_sha256":"8219a116382d1419539df753f5ba9889054aea8aa3f957c6c7390df119809e51"}],"concept.planetmath.idempotency":[{"id":"assertion.concept.planetmath.idempotency","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Idempotency as stated in the captured PlanetMath entry idempotency","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02) states: If ( S , * ) is a magma, then an element x ∈ S is said to be idempotent if x * x = x .","support":[{"end":110,"quote":"If\n(\nS\n,\n*\n)\nis a magma, then an\nelement\nx\n∈\nS\nis said to be\nidempotent\nif\nx\n*\nx\n=\nx\n.","source_id":"planetmath.idempotency","source_sha256":"c3c56bdc0c0c110b6220edaccabd677ef803aff04f5b541b0c9852739340f778","start":24}],"target_id":"concept.planetmath.idempotency","target_kind":"node","target_sha256":"483ac74895bd9c25bfa3686360d037e9be76202d33485c17b3f2fb2f6df65fe5"}],"concept.planetmath.idempotent":[{"id":"assertion.concept.planetmath.idempotent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Idempotent as stated in the captured PlanetMath entry idempotent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16U99, 20M99) states: An element x of a ring is called an idempotent element , or simply an idempotent if x 2 = x .","support":[{"end":115,"quote":"An element\nx\nof a ring is called an\nidempotent element\n, or simply an\nidempotent\nif\nx\n2\n=\nx\n.","source_id":"planetmath.idempotent","source_sha256":"21c0f4d4edcc42abb2cd2847c84566448d519e98b53aa5e97a497c2b7bd634c9","start":22}],"target_id":"concept.planetmath.idempotent","target_kind":"node","target_sha256":"71a154e55b1f7e1f82db61e99a16b6044418c8d4e4fca6a97e71e9af52b70c1e"}],"concept.planetmath.identityelement":[{"id":"assertion.concept.planetmath.identityelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity element as stated in the captured PlanetMath entry identityelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05, 20N02, 20N05, 20M99) states: Let G be a groupoid , that is a set with a binary operation G × G → G , written muliplicatively so that ( x , y ) ↦ x ⁢ y .","support":[{"end":157,"quote":"Let\nG\nbe a\ngroupoid\n, that is a set with a\nbinary operation\nG\n×\nG\n→\nG\n, written muliplicatively so that\n(\nx\n,\ny\n)\n↦\nx\n⁢\ny\n.","source_id":"planetmath.identityelement","source_sha256":"ab56a5d40d40c46060ce449987221c6973c0bcdb6aa31dd9318d92799e9e9e39","start":34}],"target_id":"concept.planetmath.identityelement","target_kind":"node","target_sha256":"5f8aa9cfb3e91dee3043788eb0acf79e7a855716f055933e18e65ca6c373e0d9"}],"concept.planetmath.identityinaclass":[{"id":"assertion.concept.planetmath.identityinaclass","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity in a class as stated in the captured PlanetMath entry identityinaclass","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08B99) states: Let K be a class of algebraic systems of the same type.","support":[{"end":95,"quote":"Let\nK\nbe a class of\nalgebraic systems\nof the same type.","source_id":"planetmath.identityinaclass","source_sha256":"03a47112e4d86d4c5fb46d73baabea07f656f99fa49e872297a23cea9b93309e","start":40}],"target_id":"concept.planetmath.identityinaclass","target_kind":"node","target_sha256":"42402b3d99707f61a538eb65fd167b0962d394b0f87d49a037479252560910a6"}],"concept.planetmath.identitymap":[{"id":"assertion.concept.planetmath.identitymap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity map as stated in the captured PlanetMath entry identitymap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition If X is a set, then the identity map in X is the mapping that maps each element in X to itself.","support":[{"end":132,"quote":"Definition\nIf\nX\nis a set, then the\nidentity map\nin\nX\nis the mapping\nthat maps each element in\nX\nto itself.","source_id":"planetmath.identitymap","source_sha256":"4d2f9aa446f80223d89d65e919b9b64cdcb5250faa82a656c356b63a720c9573","start":26}],"target_id":"concept.planetmath.identitymap","target_kind":"node","target_sha256":"4cc0d4240ad33c1c259dfec6b1da1aadefb4a9f154097ce136dbb2cd1cdd30c4"}],"concept.planetmath.identitymatrix":[{"id":"assertion.concept.planetmath.identitymatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Identity matrix as stated in the captured PlanetMath entry identitymatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-01, 15A57) states: The n × n identity matrix I (or I n ) over a ring R (with an identity 1) is the square matrix with coefficients in R given by I = [ 1 0 ⋯ 0 0 1 ⋯ 0 0 0 ⋱ 0 0 0 ⋯ 1 ] , where the numeral “1” and “0” respectively represent the multiplicative and additive identities in R .","support":[{"end":302,"quote":"The\nn\n×\nn\nidentity matrix\nI\n(or\nI\nn\n) over a ring\nR\n(with an\nidentity\n1) is the\nsquare matrix\nwith coefficients in\nR\ngiven by\nI\n=\n[\n1\n0\n⋯\n0\n0\n1\n⋯\n0\n0\n0\n⋱\n0\n0\n0\n⋯\n1\n]\n,\nwhere the numeral “1” and “0” respectively represent the multiplicative and\nadditive identities\nin\nR\n.","source_id":"planetmath.identitymatrix","source_sha256":"466f889ae801b8afcf0f38d48b96c38cdeec7f7a4cb5412fab779bf20d65e862","start":32}],"target_id":"concept.planetmath.identitymatrix","target_kind":"node","target_sha256":"b2f189f3876dd83e906bc6ab776193bf367675c9382ff5df9e9194749d5ce6dc"}],"concept.planetmath.imaginaries":[{"id":"assertion.concept.planetmath.imaginaries","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Imaginaries as stated in the captured PlanetMath entry imaginaries","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C95, 03C68) states: Given an algebraic structure S to investigate, mathematicians consider substructures , restrictions of the structure , quotient structures and the like.","support":[{"end":176,"quote":"Given an\nalgebraic structure\nS\nto investigate, mathematicians consider\nsubstructures\n,\nrestrictions\nof the\nstructure\n,\nquotient structures\nand the like.","source_id":"planetmath.imaginaries","source_sha256":"8afcc87c77619d2c2b8c5650b12ae098270bc92ed529d20c0db0ff878698725d","start":24}],"target_id":"concept.planetmath.imaginaries","target_kind":"node","target_sha256":"0748fc801dda3777078568ccd7945f613db8b043bf2c6746d49d25f04f82e980"}],"concept.planetmath.inaccessiblecardinal":[{"id":"assertion.concept.planetmath.inaccessiblecardinal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inaccessible cardinal as stated in the captured PlanetMath entry inaccessiblecardinal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E55) states: A limit cardinal κ is a strong limit cardinal if for any λ < κ , 2 λ < κ .","support":[{"end":118,"quote":"A\nlimit cardinal\nκ\nis a\nstrong limit cardinal\nif for any\nλ\n<\nκ\n,\n2\nλ\n<\nκ\n.","source_id":"planetmath.inaccessiblecardinal","source_sha256":"9c0204de9842fe854e7de2f4c15cd328efbd8af6954fa300f850d3e3bcdaac24","start":44}],"target_id":"concept.planetmath.inaccessiblecardinal","target_kind":"node","target_sha256":"883ea9d1215ea2f58e6d1e50924cab68ff9e979d0c95f4cb93239d4919474864"}],"concept.planetmath.incidencegeometry":[{"id":"assertion.concept.planetmath.incidencegeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Incidence geometry as stated in the captured PlanetMath entry incidencegeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: Incidence geometry is essentially geometry based on the first postulate in Euclid’s The Elements .","support":[{"end":136,"quote":"Incidence geometry\nis essentially\ngeometry\nbased on the first\npostulate\nin Euclid’s\nThe\nElements\n.","source_id":"planetmath.incidencegeometry","source_sha256":"bd356ed5e9d77c3eebaa44f3bd426e7942738fa68db0079e5f39316811b9d4d2","start":38}],"target_id":"concept.planetmath.incidencegeometry","target_kind":"node","target_sha256":"fa7724ca4783cf399b32ac1c73f32a288712c748f682feaef713f6ba84f87097"}],"concept.planetmath.incidencestructure":[{"id":"assertion.concept.planetmath.incidencestructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Incidence structure as stated in the captured PlanetMath entry incidencestructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 62K10, 51E30, 51E05, 05B25, 05B07, 05B05) states: Definition . An incidence structure 𝒮 is a triple ( 𝒫 , ℬ , ℐ ) , where 1.","support":[{"end":114,"quote":"Definition\n. An\nincidence structure\n𝒮\nis a triple\n(\n𝒫\n,\nℬ\n,\nℐ\n)\n, where\n1.","source_id":"planetmath.incidencestructure","source_sha256":"a420de23c3d2783733ab54e58eae83caefd9df3f83c527c8daeea8384e643808","start":40}],"target_id":"concept.planetmath.incidencestructure","target_kind":"node","target_sha256":"09ea95f35f3c2494b4de4c0eef425425f8d1a1a064b1c3f7df1643d2d130e4a6"}],"concept.planetmath.inclusionmapping":[{"id":"assertion.concept.planetmath.inclusionmapping","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inclusion mapping as stated in the captured PlanetMath entry inclusionmapping","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let X be a subset of Y . Then the inclusion map from X to Y is the mapping ι : X → Y x ↦ x .","support":[{"end":139,"quote":"Definition\nLet\nX\nbe a subset of\nY\n. Then the\ninclusion map\nfrom\nX\nto\nY\nis the\nmapping\nι\n:\nX\n→\nY\nx\n↦\nx\n.","source_id":"planetmath.inclusionmapping","source_sha256":"fe5d3e440d8a30da8255d8960214b80f287b85ac35c1154329d0a22c67665e17","start":36}],"target_id":"concept.planetmath.inclusionmapping","target_kind":"node","target_sha256":"0866cd90a226f0bc14a2cf1b098dd2881b5d510ab2db67908a54e1d15c967a1e"}],"concept.planetmath.indexingset":[{"id":"assertion.concept.planetmath.indexingset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Indexing set as stated in the captured PlanetMath entry indexingset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Let Λ and S be sets such that there exists a surjection f : Λ → S .","support":[{"end":93,"quote":"Let\nΛ\nand\nS\nbe sets such that there exists a\nsurjection\nf\n:\nΛ\n→\nS\n.","source_id":"planetmath.indexingset","source_sha256":"9c89437ed3ef36a9eb7a9321fa418e7ab6b532ebcfcc251517a8add3150556b4","start":26}],"target_id":"concept.planetmath.indexingset","target_kind":"node","target_sha256":"d40ea100d2fc0e62e9738ae64e068c945cf43a78589be9b3f4022f7fd975ffdb"}],"concept.planetmath.indexset":[{"id":"assertion.concept.planetmath.indexset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Index set as stated in the captured PlanetMath entry indexset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D25) states: In computability theory, a set A ⊆ ω is called an index set if for all x , y , x ∈ A , φ x = φ y ⟹ y ∈ A .","support":[{"end":126,"quote":"In computability theory, a set\nA\n⊆\nω\nis called an\nindex set\nif for all\nx\n,\ny\n,\nx\n∈\nA\n,\nφ\nx\n=\nφ\ny\n⟹\ny\n∈\nA\n.","source_id":"planetmath.indexset","source_sha256":"1ad7cc85cbee3f6cdb0e097fb901865679a0d8dd5ed2e95883d304ec71fc06b5","start":20}],"target_id":"concept.planetmath.indexset","target_kind":"node","target_sha256":"5865b4fe7beda7faebe14504372f03a6fee3a236bbfbbfeb9e549ab3d04e6df0"}],"concept.planetmath.indiscretetopology":[{"id":"assertion.concept.planetmath.indiscretetopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Indiscrete topology as stated in the captured PlanetMath entry indiscretetopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: If X is a set and it is endowed with a topology defined by τ = { X , ∅ } then X is said to have the indiscrete topology .","support":[{"end":161,"quote":"If\nX\nis a set and it is endowed with a\ntopology\ndefined by\nτ\n=\n{\nX\n,\n∅\n}\nthen\nX\nis said to have the\nindiscrete topology\n.","source_id":"planetmath.indiscretetopology","source_sha256":"184ed137c35d14b7bb22775e1454130695f976b0ada6ac484a69b8684251ac00","start":40}],"target_id":"concept.planetmath.indiscretetopology","target_kind":"node","target_sha256":"0541d18bdd5a66edee372d24cf6ef94afbc2041c1e3b8a14a08571a9981387fb"}],"concept.planetmath.inductionaxiom":[{"id":"assertion.concept.planetmath.inductionaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Induction axiom as stated in the captured PlanetMath entry inductionaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: An induction axiom specifies that a theory includes induction , possibly restricted to specific formulas .","support":[{"end":138,"quote":"An\ninduction axiom\nspecifies that a theory includes\ninduction\n, possibly restricted to specific\nformulas\n.","source_id":"planetmath.inductionaxiom","source_sha256":"12758f5c9d2ffe1a61447b74fab92af75ec00ceea5574083db120d3668c2ffa5","start":32}],"target_id":"concept.planetmath.inductionaxiom","target_kind":"node","target_sha256":"1613431cc2e7624d653571dc8f4f84daef4059a1214d08ddeb00365035c2f797"}],"concept.planetmath.inductiveset":[{"id":"assertion.concept.planetmath.inductiveset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inductive set as stated in the captured PlanetMath entry inductiveset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 45D05) states: An inductive set is a set X with the property that, for every x ∈ X , the successor x ′ of x is also an element of X .","support":[{"end":146,"quote":"An\ninductive set\nis a set\nX\nwith the\nproperty\nthat, for every\nx\n∈\nX\n, the\nsuccessor\nx\n′\nof\nx\nis also an element of\nX\n.","source_id":"planetmath.inductiveset","source_sha256":"603735a139e8828b5cf2392fffd1bee5c57fcbe722b2c7ba2e8d826e03ecbb29","start":28}],"target_id":"concept.planetmath.inductiveset","target_kind":"node","target_sha256":"215f482102e13e20fd69e9f541ae7208724f5ed12783da9939396303c7fd6e8d"}],"concept.planetmath.inferencerule":[{"id":"assertion.concept.planetmath.inferencerule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inference rule as stated in the captured PlanetMath entry inferencerule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B35, 03B22, 03B05) states: In logic, an inference rule is a rule whereby one may correctly draw a conclusion from one or more premises .","support":[{"end":139,"quote":"In logic, an\ninference rule\nis a rule whereby one may correctly\ndraw a\nconclusion\nfrom one or more\npremises\n.","source_id":"planetmath.inferencerule","source_sha256":"e809e4bc925c1f6b9d5655a640102c0e36ddaf84bba7caf691327512469db76a","start":30}],"target_id":"concept.planetmath.inferencerule","target_kind":"node","target_sha256":"74cbcd43892e48d1fcbaf58d03fa31d0cfee9914aad43499eaece3fbb6c0a87b"}],"concept.planetmath.infinitesimal":[{"id":"assertion.concept.planetmath.infinitesimal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Infinitesimal as stated in the captured PlanetMath entry infinitesimal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03H05, 06F25, 03C64) states: Let R be a real closed field, for example the reals thought of as a structure in L , the language of ordered rings .","support":[{"end":144,"quote":"Let\nR\nbe a real closed field, for example the reals thought of as a\nstructure\nin\nL\n, the\nlanguage\nof\nordered rings\n.","source_id":"planetmath.infinitesimal","source_sha256":"d94fa689376b89a540361c80b9c75af869ff2a7646edd03d14ad2a9086c87b4e","start":28}],"target_id":"concept.planetmath.infinitesimal","target_kind":"node","target_sha256":"0cf30bc0ee92757c05ec4b3ed8ef15fd7f942a745283f5e3693cfdb838d0b907"}],"concept.planetmath.infixnotation":[{"id":"assertion.concept.planetmath.infixnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Infix notation as stated in the captured PlanetMath entry infixnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: Infix notation is how we usually read and write arithmetic expressions .","support":[{"end":102,"quote":"Infix notation\nis how we usually read and write\narithmetic\nexpressions\n.","source_id":"planetmath.infixnotation","source_sha256":"76e83418383a7e117cfe5a7785106ecee7000f8b737edd6f4fb23f3a4f0a7786","start":30}],"target_id":"concept.planetmath.infixnotation","target_kind":"node","target_sha256":"07d53c030f81aa463bb921ac5d15395751a5d6de182d3383368340432899b29e"}],"concept.planetmath.initialtopology":[{"id":"assertion.concept.planetmath.initialtopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Initial topology as stated in the captured PlanetMath entry initialtopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B99) states: Let X i , i ∈ I be any family of topological spaces .","support":[{"end":87,"quote":"Let\nX\ni\n,\ni\n∈\nI\nbe any family of\ntopological spaces\n.","source_id":"planetmath.initialtopology","source_sha256":"28d75d2c1f00ab0a76c319d1ef00cfcabe7c770839b898d382697ae4c648fb60","start":34}],"target_id":"concept.planetmath.initialtopology","target_kind":"node","target_sha256":"722b4ac0eff41b38e28869e832a7cd895b06090af49fc8686b5d0fd56f779acb"}],"concept.planetmath.injectivefunction":[{"id":"assertion.concept.planetmath.injectivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Injective function as stated in the captured PlanetMath entry injectivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 03E99) states: We say that a function f : A → B is injective or one-to-one if f ⁢ ( x ) = f ⁢ ( y ) implies x = y , or equivalently, whenever x ≠ y , then f ⁢ ( x ) ≠ f ⁢ ( y ) .","support":[{"end":201,"quote":"We say that a\nfunction\nf\n:\nA\n→\nB\nis\ninjective\nor\none-to-one\nif\nf\n⁢\n(\nx\n)\n=\nf\n⁢\n(\ny\n)\nimplies\nx\n=\ny\n, or equivalently, whenever\nx\n≠\ny\n, then\nf\n⁢\n(\nx\n)\n≠\nf\n⁢\n(\ny\n)\n.","source_id":"planetmath.injectivefunction","source_sha256":"eb38a972ea11446a0207ea3ed349761f5263cf67a5e3492b495f01b84703f671","start":38}],"target_id":"concept.planetmath.injectivefunction","target_kind":"node","target_sha256":"4e05d6584fca45ca16d2e11b1ad0d34dfef08d55347b6b689c54e5fd9651cf8d"}],"concept.planetmath.innerproduct":[{"id":"assertion.concept.planetmath.innerproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inner product as stated in the captured PlanetMath entry innerproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11E39, 15A63) states: An inner product on a vector space V over a field K (which must be either the field ℝ of real numbers or the field ℂ of complex numbers ) is a function ( , ) : V × V ⟶ K such that, for all k 1 , k 2 ∈ K and 𝐯 1 , 𝐯 2 , 𝐯 , 𝐰 ∈ V , the following properties hold: 1.","support":[{"end":292,"quote":"An\ninner product\non a\nvector space\nV\nover a field\nK\n(which must be either the field\nℝ\nof\nreal numbers\nor the field\nℂ\nof\ncomplex numbers\n) is a\nfunction\n(\n,\n)\n:\nV\n×\nV\n⟶\nK\nsuch that, for all\nk\n1\n,\nk\n2\n∈\nK\nand\n𝐯\n1\n,\n𝐯\n2\n,\n𝐯\n,\n𝐰\n∈\nV\n, the following properties hold:\n1.","source_id":"planetmath.innerproduct","source_sha256":"66ffa3ce4dab8a661a4a6944bed33a24a7200e8d9fdcee326eb3eed51b0c234b","start":28}],"target_id":"concept.planetmath.innerproduct","target_kind":"node","target_sha256":"b374527608ceaab409cda9dcd68948189c77929d8ef1b919aa377f0b052fe457"}],"concept.planetmath.innerproductspace":[{"id":"assertion.concept.planetmath.innerproductspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inner product space as stated in the captured PlanetMath entry innerproductspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46C99) states: An inner product space (or pre-Hilbert space ) is a vector space (over ℝ or ℂ ) with an inner product ⟨ ⋅ , ⋅ ⟩ .","support":[{"end":153,"quote":"An\ninner product space\n(or\npre-Hilbert space\n) is a\nvector space\n(over\nℝ\nor\nℂ\n)\nwith an\ninner product\n⟨\n⋅\n,\n⋅\n⟩\n.","source_id":"planetmath.innerproductspace","source_sha256":"cd06dedb0334361bd713ca7c7b4805923e8909457933abeceec256916ab03412","start":40}],"target_id":"concept.planetmath.innerproductspace","target_kind":"node","target_sha256":"67caa90761491b00ed47497bb9a4978fc1d63e7006decbbb8a28a440eea4402a"}],"concept.planetmath.integral":[{"id":"assertion.concept.planetmath.integral","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Integral as stated in the captured PlanetMath entry integral","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B21) states: Let B be a ring with a subring A . We will assume that A is contained in the center of B (in particular, A is commutative ).","support":[{"end":142,"quote":"Let\nB\nbe a ring with a subring\nA\n. We will assume that\nA\nis contained in the center of\nB\n(in particular,\nA\nis\ncommutative\n).","source_id":"planetmath.integral","source_sha256":"e8724618165d86c01e23c49107020acb50785cd7e3d40d344e9bdd549248ccc6","start":18}],"target_id":"concept.planetmath.integral","target_kind":"node","target_sha256":"f0a69a888ae2d1dca904a95290f2390d8ae5caf34c0ff1b904a9824468f02da6"}],"concept.planetmath.integraldomain":[{"id":"assertion.concept.planetmath.integraldomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Integral domain as stated in the captured PlanetMath entry integraldomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13G05) states: An integral domain , or domain , is a commutative cancellation ring with an identity element 1 ≠ 0 .","support":[{"end":132,"quote":"An\nintegral domain\n, or\ndomain\n, is a\ncommutative\ncancellation ring\nwith an\nidentity element\n1\n≠\n0\n.","source_id":"planetmath.integraldomain","source_sha256":"e35e5776872ad528c09356943d15e20555cd95d3ad06951614cea118fd7f0eeb","start":32}],"target_id":"concept.planetmath.integraldomain","target_kind":"node","target_sha256":"cfbeb1f9173995b319a5d32c5239b67ade8425789343f17b03e4234c885bd620"}],"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals":[{"id":"assertion.concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Interpretation of intuitionistic logic by means of functionals as stated in the captured PlanetMath entry interpretationofintuitionisticlogicbymeansoffunctionals","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05, 03B20) states: Abstract The entry reports on the analysis of the concept of constructivity and in particular Gödel’s own stricto sensu constructivity.","support":[{"end":261,"quote":"Abstract\nThe entry reports on the\nanalysis\nof the\nconcept\nof\nconstructivity\nand in particular Gödel’s own\nstricto sensu\nconstructivity.","source_id":"planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","source_sha256":"bc68c4f5d16bc50a9488ccd1c6a3fa36861e3b629043bfc5e014710e37280044","start":126}],"target_id":"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","target_kind":"node","target_sha256":"7c7b5a4568d5c5a20ae3be40372b9cc3f5592b270c13d2f2baff8f97b00aee0c"}],"concept.planetmath.interval":[{"id":"assertion.concept.planetmath.interval","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Interval as stated in the captured PlanetMath entry interval","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12D99, 26-00, 54C30) states: Loosely speaking, an interval is a part of the real numbers that start at one number and stops at another number.","support":[{"end":131,"quote":"Loosely speaking, an\ninterval\nis a part of the\nreal numbers\nthat start at one number and stops at another number.","source_id":"planetmath.interval","source_sha256":"99b7170865ab7a28e4e1ae9bffabe00d73f55d5ae89b4cdc3cd3d06028a6fab7","start":18}],"target_id":"concept.planetmath.interval","target_kind":"node","target_sha256":"4bfb3a9097250cb2015e5f67157c7a8c23d8761713bd0a3f67008b3030608bce"}],"concept.planetmath.intuitionisticlogic":[{"id":"assertion.concept.planetmath.intuitionisticlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Intuitionistic logic as stated in the captured PlanetMath entry intuitionisticlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03B20, 03-01) states: Abstract The entry \" intuitionistic logic \" is a beginner’s introduction to the defining features of Brouwer’s (and his School) mathematical philosophy.","support":[{"end":194,"quote":"Abstract\nThe entry \"\nintuitionistic logic\n\" is a beginner’s\nintroduction\nto the defining features of Brouwer’s (and his School) mathematical philosophy.","source_id":"planetmath.intuitionisticlogic","source_sha256":"1e9250ccff6d704ab3f9afc2482f19d5dc279c3f0d2f38a6782d06500a7f37be","start":42}],"target_id":"concept.planetmath.intuitionisticlogic","target_kind":"node","target_sha256":"582ece403468e624abfe586ff43b5f4161e3a29d195d914ed14d2b5038587686"}],"concept.planetmath.invariant":[{"id":"assertion.concept.planetmath.invariant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invariant as stated in the captured PlanetMath entry invariant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","support":[{"end":79,"quote":"Let\nA\nbe a set, and\nT\n:\nA\n→\nA\na\ntransformation\nof that\nset.","source_id":"planetmath.invariant","source_sha256":"72e2a4f141a1a7371ba8cb22ff0b22798bd1e7428f6f5fda15d5f7e29940bbb8","start":20}],"target_id":"concept.planetmath.invariant","target_kind":"node","target_sha256":"40469522f65c5744327a1c92abb54cb80a35602ba5d88ba33cc909dd10fe79a8"}],"concept.planetmath.invariantsubspace":[{"id":"assertion.concept.planetmath.invariantsubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invariant subspace as stated in the captured PlanetMath entry invariantsubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Let T : V → V be a linear transformation of a vector space V .","support":[{"end":100,"quote":"Let\nT\n:\nV\n→\nV\nbe a\nlinear transformation\nof a\nvector space\nV\n.","source_id":"planetmath.invariantsubspace","source_sha256":"1ea9e9571b7abe74873bb110673e7f39d72b787a35a254104db031418f9c3f3f","start":38}],"target_id":"concept.planetmath.invariantsubspace","target_kind":"node","target_sha256":"6e970c83288e02d9f2366000f36209a5781291ab5e09040a49094544a733acaa"}],"concept.planetmath.inversefunction":[{"id":"assertion.concept.planetmath.inversefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse function as stated in the captured PlanetMath entry inversefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 03E20) states: Definition Suppose f : X → Y is a function between sets X and Y , and suppose f - 1 : Y → X is a mapping that satisfies f - 1 ∘ f = id X , f ∘ f - 1 = id Y , where id A denotes the identity function on the set A .","support":[{"end":247,"quote":"Definition\nSuppose\nf\n:\nX\n→\nY\nis a\nfunction\nbetween sets\nX\nand\nY\n,\nand suppose\nf\n-\n1\n:\nY\n→\nX\nis a\nmapping\nthat\nsatisfies\nf\n-\n1\n∘\nf\n=\nid\nX\n,\nf\n∘\nf\n-\n1\n=\nid\nY\n,\nwhere\nid\nA\ndenotes the\nidentity function\non the set\nA\n.","source_id":"planetmath.inversefunction","source_sha256":"974e792feba80e0c49438f06ce69e061b5cc00316810ae0f809b04dd0802e646","start":34}],"target_id":"concept.planetmath.inversefunction","target_kind":"node","target_sha256":"ecc0ee847dee819656d833d00249bab4fc80f78d6d7b667b6e32a16fe546c083"}],"concept.planetmath.inverseimage":[{"id":"assertion.concept.planetmath.inverseimage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse image as stated in the captured PlanetMath entry inverseimage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20, 46L05, 82-00, 83-00, 81-00) states: Let f : A ⟶ B be a function , and let U ⊂ B be a subset. The inverse image of U is the set f - 1 ⁢ ( U ) ⊂ A consisting of all elements a ∈ A such that f ⁢ ( a ) ∈ U .","support":[{"end":195,"quote":"Let\nf\n:\nA\n⟶\nB\nbe a\nfunction\n, and let\nU\n⊂\nB\nbe a subset. The\ninverse image\nof\nU\nis the set\nf\n-\n1\n⁢\n(\nU\n)\n⊂\nA\nconsisting of all\nelements\na\n∈\nA\nsuch that\nf\n⁢\n(\na\n)\n∈\nU\n.","source_id":"planetmath.inverseimage","source_sha256":"134f4e854d6519585d8fa18dc29c403a33f362f0a83a1ab67575a49c228e0fa9","start":28}],"target_id":"concept.planetmath.inverseimage","target_kind":"node","target_sha256":"834c230e1ca5176a0553a752abe3bbb3a48be16058d1e0be4b1adb0cefaf87d2"}],"concept.planetmath.inversenumber":[{"id":"assertion.concept.planetmath.inversenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse number as stated in the captured PlanetMath entry inversenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12E99, 00A05) states: The inverse number or reciprocal number of a non-zero real or complex number a may be denoted by a - 1 , and it the quotient 1 a (so, it is really the - 1 th power of a ).","support":[{"end":202,"quote":"The\ninverse number\nor\nreciprocal number\nof a non-zero real or\ncomplex number\na\nmay be denoted by\na\n-\n1\n, and it  the\nquotient\n1\na\n(so, it is really the\n-\n1\nth\npower of\na\n).","source_id":"planetmath.inversenumber","source_sha256":"3e1e54a526900f63ea86dfa1bc13a1b901e9f6b5c8881d151aa7d5614a5909c6","start":30}],"target_id":"concept.planetmath.inversenumber","target_kind":"node","target_sha256":"7da522b46d6ebc953679fe998c64d12d5cd573d1aefd6a52ac00e7dc022698d9"}],"concept.planetmath.inversestatement":[{"id":"assertion.concept.planetmath.inversestatement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse statement as stated in the captured PlanetMath entry inversestatement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Let a statement be of the form of an implication If p , then q i.e.","support":[{"end":103,"quote":"Let a statement be of the form of an\nimplication\nIf\np\n, then\nq\ni.e.","source_id":"planetmath.inversestatement","source_sha256":"a35773a244221240ab2e671d19d451b9a875d217f79e8f7a3a1dae530bd2b82c","start":36}],"target_id":"concept.planetmath.inversestatement","target_kind":"node","target_sha256":"186b10282b044a6a665784f16cac29efa9c25744fd0fa3bcd97a726fd8f66a59"}],"concept.planetmath.invertiblelineartransformation":[{"id":"assertion.concept.planetmath.invertiblelineartransformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Invertible linear transformation as stated in the captured PlanetMath entry invertiblelineartransformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: An invertible linear transformation is a linear transformation T : V ⟶ W which is a bijection .","support":[{"end":161,"quote":"An\ninvertible linear transformation\nis a\nlinear transformation\nT\n:\nV\n⟶\nW\nwhich is a\nbijection\n.","source_id":"planetmath.invertiblelineartransformation","source_sha256":"2749fb0a788e12b0b192ee376be495b94fa7ff4af31ca73e27765dd94efcb920","start":66}],"target_id":"concept.planetmath.invertiblelineartransformation","target_kind":"node","target_sha256":"27cbde493ec6fdd5017f01d613be44675c5e0081e8215c9b163c6bfc7a092082"}],"concept.planetmath.involutoryring":[{"id":"assertion.concept.planetmath.involutoryring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Involutory ring as stated in the captured PlanetMath entry involutoryring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16W10) states: General Definition of a Ring with Involution Let R be a ring.","support":[{"end":93,"quote":"General Definition of a Ring with Involution\nLet\nR\nbe a ring.","source_id":"planetmath.involutoryring","source_sha256":"4afff2315469a4f39c30685600375cca265d2a045f6789170feb7d07a036bd12","start":32}],"target_id":"concept.planetmath.involutoryring","target_kind":"node","target_sha256":"25669c25a0ffec71cac45a6e3f8f2838dd75fe2064b816ef83ba6cfc72042eb7"}],"concept.planetmath.irrational":[{"id":"assertion.concept.planetmath.irrational","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Irrational as stated in the captured PlanetMath entry irrational","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11J82, 11J72) states: An irrational number is a real number which cannot be represented as a ratio of two integers .","support":[{"end":116,"quote":"An\nirrational number\nis a real number which cannot be represented as a ratio of two\nintegers\n.","source_id":"planetmath.irrational","source_sha256":"3b08fd47821beef039215bce5432270816df594ba6adcbe313637042579a5cda","start":22}],"target_id":"concept.planetmath.irrational","target_kind":"node","target_sha256":"9d4b889deb242a6c5088273cd78fbd96a49e93b5e2d99abea3397f3835391431"}],"concept.planetmath.isomorphicgroups":[{"id":"assertion.concept.planetmath.isomorphicgroups","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Isomorphic groups as stated in the captured PlanetMath entry isomorphicgroups","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Two groups ( X 1 , * 1 ) and ( X 2 , * 2 ) are said to be isomorphic if there is a group isomorphism ψ : X 1 → X 2 .","support":[{"end":152,"quote":"Two groups\n(\nX\n1\n,\n*\n1\n)\nand\n(\nX\n2\n,\n*\n2\n)\nare said to be\nisomorphic\nif there is a group isomorphism\nψ\n:\nX\n1\n→\nX\n2\n.","source_id":"planetmath.isomorphicgroups","source_sha256":"f860e4bc40e371af548f2e246d96b2f89a64145bb34532c2e7c4ba1433fc521c","start":36}],"target_id":"concept.planetmath.isomorphicgroups","target_kind":"node","target_sha256":"5d6c32e238ec78eb5a2f685096882b63d99c383318b1cf1d3197de33a3a618e9"}],"concept.planetmath.isomorphism":[{"id":"assertion.concept.planetmath.isomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Isomorphism as stated in the captured PlanetMath entry isomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05, 15A04, 13A99, 20A05, 18A05) states: A morphism f : A ⟶ B in a category is an isomorphism if there exists a morphism f - 1 : B ⟶ A which is its inverse .","support":[{"end":140,"quote":"A\nmorphism\nf\n:\nA\n⟶\nB\nin a\ncategory\nis an\nisomorphism\nif there exists a morphism\nf\n-\n1\n:\nB\n⟶\nA\nwhich is its\ninverse\n.","source_id":"planetmath.isomorphism","source_sha256":"9f2a083612dea64ecd4937944fda23b74680b0f54fa4e7957c26504326a319d8","start":24}],"target_id":"concept.planetmath.isomorphism","target_kind":"node","target_sha256":"046e704ba6bc6f001443bedc086715b446f6578e35799de4d7ba21c6ec58d47c"}],"concept.planetmath.iterator":[{"id":"assertion.concept.planetmath.iterator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Iterator as stated in the captured PlanetMath entry iterator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N15) states: An iterator is a variable that one by one takes on all the values (usually integers) in a given range.","support":[{"end":120,"quote":"An\niterator\nis a\nvariable\nthat one by one takes on all the values (usually integers) in a given range.","source_id":"planetmath.iterator","source_sha256":"03bf016da508db5a02068cbc2385cf5b5345681cda898858ade4f44cdaaf245d","start":18}],"target_id":"concept.planetmath.iterator","target_kind":"node","target_sha256":"78c828a1ab78b6b45be72e6623b72e968782ed1b4eccb4fa05a67c6bc3b6e4dd"}],"concept.planetmath.jacobianmatrix":[{"id":"assertion.concept.planetmath.jacobianmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Jacobian matrix as stated in the captured PlanetMath entry jacobianmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B10) states: The Jacobian matrix [ 𝐉 ⁢ f ⁢ ( 𝐚 ) ] of a function f : ℝ n → ℝ m at the point 𝐚 with respect to some choice of bases for ℝ n and ℝ m is the matrix of the linear map from ℝ n into ℝ m that generalizes the definition of the derivative of a function on ℝ .","support":[{"end":286,"quote":"The\nJacobian matrix\n[\n𝐉\n⁢\nf\n⁢\n(\n𝐚\n)\n]\nof a function\nf\n:\nℝ\nn\n→\nℝ\nm\nat the point\n𝐚\nwith respect to some choice of bases for\nℝ\nn\nand\nℝ\nm\nis the matrix of the\nlinear map\nfrom\nℝ\nn\ninto\nℝ\nm\nthat generalizes the definition of the\nderivative\nof a function on\nℝ\n.","source_id":"planetmath.jacobianmatrix","source_sha256":"5ad9f692277c977033d969db09658dc39b80d1509e82ac90cf34abe09652a9fa","start":32}],"target_id":"concept.planetmath.jacobianmatrix","target_kind":"node","target_sha256":"13e1ce509cc4228144316b465538e79f40cb7d5e7aa1b6e5e7a3750ade12163b"}],"concept.planetmath.jacobideterminant":[{"id":"assertion.concept.planetmath.jacobideterminant","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Jacobi determinant as stated in the captured PlanetMath entry jacobideterminant","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 62H05, 15-00) states: Let f = f ⁢ ( x ) = f ⁢ ( x 1 , … , x n ) be a function of n variables , and let u = u ⁢ ( x ) = ( u 1 ⁢ ( x ) , … , u n ⁢ ( x ) ) be a function of x , where inversely x can be expressed as a function of u , x = x ⁢ ( u ) = ( x 1 ⁢ ( u ) , … , x n ⁢ ( u ) ) The formula for a change of variable in an n -dimensional integral is then ∫ Ω f ⁢ ( x ) ⁢ d n ⁢ x = ∫ u ⁢ ( Ω ) f ⁢ ( x ⁢ ( u ) ) ⁢ | det ⁡ ( d ⁢ x / d ⁢ u ) | ⁢ d n ⁢ u Ω is an integration region, and one integrates over all x ∈ Ω , or equivalently, all u ∈ u ⁢ ( Ω ) .","support":[{"end":567,"quote":"Let\nf\n=\nf\n⁢\n(\nx\n)\n=\nf\n⁢\n(\nx\n1\n,\n…\n,\nx\nn\n)\nbe a function of\nn\nvariables\n, and let\nu\n=\nu\n⁢\n(\nx\n)\n=\n(\nu\n1\n⁢\n(\nx\n)\n,\n…\n,\nu\nn\n⁢\n(\nx\n)\n)\nbe a function of\nx\n, where inversely\nx\ncan be expressed as a function of\nu\n,\nx\n=\nx\n⁢\n(\nu\n)\n=\n(\nx\n1\n⁢\n(\nu\n)\n,\n…\n,\nx\nn\n⁢\n(\nu\n)\n)\nThe formula for a change of variable in an\nn\n-dimensional integral is then\n∫\nΩ\nf\n⁢\n(\nx\n)\n⁢\nd\nn\n⁢\nx\n=\n∫\nu\n⁢\n(\nΩ\n)\nf\n⁢\n(\nx\n⁢\n(\nu\n)\n)\n⁢\n|\ndet\n⁡\n(\nd\n⁢\nx\n/\nd\n⁢\nu\n)\n|\n⁢\nd\nn\n⁢\nu\nΩ\nis an integration region, and one\nintegrates\nover all\nx\n∈\nΩ\n, or equivalently, all\nu\n∈\nu\n⁢\n(\nΩ\n)\n.","source_id":"planetmath.jacobideterminant","source_sha256":"de31748f78b9d3b17b9f73eecafd762273c23034840bbe1c120b17f498dfde60","start":38}],"target_id":"concept.planetmath.jacobideterminant","target_kind":"node","target_sha256":"4a20e4117b0029683b9600d89f98544c3b20cecd067367aed408d2a49b368089"}],"concept.planetmath.kripkesemantics":[{"id":"assertion.concept.planetmath.kripkesemantics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Kripke semantics as stated in the captured PlanetMath entry kripkesemantics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B48, 03B20, 03B45) states: A Kripke frame (or simply a frame) ℱ is a pair ( W , R ) where W is a non-empty set whose elements are called worlds or possible worlds , R is a binary relation on W called the accessibility relation .","support":[{"end":235,"quote":"A\nKripke frame\n(or simply a frame)\nℱ\nis a pair\n(\nW\n,\nR\n)\nwhere\nW\nis a non-empty set whose\nelements\nare called\nworlds\nor\npossible worlds\n,\nR\nis a\nbinary relation\non\nW\ncalled the\naccessibility relation\n.","source_id":"planetmath.kripkesemantics","source_sha256":"68d564d99953b5b9084365c642cba66f394f7d923fae4add9c24a09e7d0fd674","start":34}],"target_id":"concept.planetmath.kripkesemantics","target_kind":"node","target_sha256":"55ba48a610023c0b09b8b3f8f464f8e22937a3a97aef15fd673e507bf495d049"}],"concept.planetmath.lambdacalculus":[{"id":"assertion.concept.planetmath.lambdacalculus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lambda calculus as stated in the captured PlanetMath entry lambdacalculus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B40) states: Lambda calculus (often referred to as λ -calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with functions and the application of functions to their arguments .","support":[{"end":244,"quote":"Lambda calculus\n(often referred to as\nλ\n-calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with\nfunctions\nand the application of functions to their\narguments\n.","source_id":"planetmath.lambdacalculus","source_sha256":"c44b58c414b6fec162661fdc071ed54716a04fa48d35b7c5ca94471d13650206","start":32}],"target_id":"concept.planetmath.lambdacalculus","target_kind":"node","target_sha256":"e42ecbf71d986b4033bb362222a2c4271b0dc3ee15a34e8a2e66ce6ef8c234ba"}],"concept.planetmath.latticeideal":[{"id":"assertion.concept.planetmath.latticeideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lattice ideal as stated in the captured PlanetMath entry latticeideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B10) states: Let L be a lattice . An ideal I of L is a non-empty subset of L such that 1.","support":[{"end":104,"quote":"Let\nL\nbe a\nlattice\n. An\nideal\nI\nof\nL\nis a non-empty subset of\nL\nsuch that\n1.","source_id":"planetmath.latticeideal","source_sha256":"e6c29bff7c68037c22d92c2cba478e9a4efc6de1e39e1d183bbcc53433a49463","start":28}],"target_id":"concept.planetmath.latticeideal","target_kind":"node","target_sha256":"e0942dee927096f65e5341feaebbab61c1b467649bea63b3c6fd1c3a654de7b1"}],"concept.planetmath.lawoftrichotomy":[{"id":"assertion.concept.planetmath.lawoftrichotomy","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Law of trichotomy as stated in the captured PlanetMath entry lawoftrichotomy","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A05, 03E20) states: The law of trichotomy for a binary relation R on a set S is the property that • for all x , y ∈ S , exactly one of the following holds: x ⁢ R ⁢ y or y ⁢ R ⁢ x or x = y .","support":[{"end":205,"quote":"The\nlaw of trichotomy\nfor a\nbinary relation\nR\non a set\nS\nis the property that\n•\nfor all\nx\n,\ny\n∈\nS\n, exactly one of the following holds:\nx\n⁢\nR\n⁢\ny\nor\ny\n⁢\nR\n⁢\nx\nor\nx\n=\ny\n.","source_id":"planetmath.lawoftrichotomy","source_sha256":"07f6b1be902260cc391be5543c17ab21b23d9f8bfc7abd406ed23052c06f5bde","start":36}],"target_id":"concept.planetmath.lawoftrichotomy","target_kind":"node","target_sha256":"08349a20b5ac13d777699f1330dc6fb14a9c87a7d6288b555293ae1d36400cf8"}],"concept.planetmath.leftidentityandrightidentity":[{"id":"assertion.concept.planetmath.leftidentityandrightidentity","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Left identity and right identity as stated in the captured PlanetMath entry leftidentityandrightidentity","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let G be a groupoid . An element e ∈ G is called a left identity element if e ⁢ x = x for all x ∈ G .","support":[{"end":167,"quote":"Let\nG\nbe a\ngroupoid\n. An element\ne\n∈\nG\nis called a\nleft identity\nelement\nif\ne\n⁢\nx\n=\nx\nfor all\nx\n∈\nG\n.","source_id":"planetmath.leftidentityandrightidentity","source_sha256":"2d335aa777bfa3e6fa959d249ffb9cc38f39b1c1c829c9f4472dae5129c4fe32","start":66}],"target_id":"concept.planetmath.leftidentityandrightidentity","target_kind":"node","target_sha256":"b332141e577ccf421a9843c61b10f35b18d5bd44ce1bb4f03709c69d30394bb7"}],"concept.planetmath.lemma":[{"id":"assertion.concept.planetmath.lemma","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Lemma as stated in the captured PlanetMath entry lemma","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: There is no technical distinction a lemma, a proposition , and a theorem .","support":[{"end":87,"quote":"There is no technical distinction  a lemma, a\nproposition\n, and a\ntheorem\n.","source_id":"planetmath.lemma","source_sha256":"631b405806e8d159531f72db4b2232e60a34330cba727d86406fa3d8e89729ae","start":12}],"target_id":"concept.planetmath.lemma","target_kind":"node","target_sha256":"383c02c1820448061706020587e5aef27b1166087ac56a878e02f76ba345d101"}],"concept.planetmath.lengthofastring":[{"id":"assertion.concept.planetmath.lengthofastring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Length of a string as stated in the captured PlanetMath entry lengthofastring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Suppose we have a string w on alphabet Σ . We can then represent the string as w = x 1 ⁢ x 2 ⁢ x 3 ⁢ ⋯ ⁢ x n - 1 ⁢ x n , where for all x i ( 1 ≤ i ≤ n ), x i ∈ Σ (this means that each x i must be a “letter” from the alphabet).","support":[{"end":264,"quote":"Suppose we have a string\nw\non\nalphabet\nΣ\n. We can then represent\nthe string as\nw\n=\nx\n1\n⁢\nx\n2\n⁢\nx\n3\n⁢\n⋯\n⁢\nx\nn\n-\n1\n⁢\nx\nn\n, where for all\nx\ni\n(\n1\n≤\ni\n≤\nn\n),\nx\ni\n∈\nΣ\n(this means that each\nx\ni\nmust\nbe a “letter” from the alphabet).","source_id":"planetmath.lengthofastring","source_sha256":"b6dd99b2cb818118e81291d8815210f6fe2ac510724d5a1ccfc4b454b5593915","start":38}],"target_id":"concept.planetmath.lengthofastring","target_kind":"node","target_sha256":"e2320a1a05b8ec3a4d851b71a3a1461b704146c1a5cd5b41f29b9724101a99e5"}],"concept.planetmath.liberabaci":[{"id":"assertion.concept.planetmath.liberabaci","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Liber Abaci as stated in the captured PlanetMath entry liberabaci","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A35) states: Abstract (2015 Update): The “ Liber Abaci ”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to unit fraction by seven distinctions in a subtraction context .","support":[{"end":198,"quote":"Abstract (2015 Update):\nThe “\nLiber Abaci\n”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to\nunit fraction\nby seven distinctions in a\nsubtraction\ncontext\n.","source_id":"planetmath.liberabaci","source_sha256":"b78e6292549e33b6069c0463d9a2add4dca30206460d1858624f9c3b2b1f6ad3","start":24}],"target_id":"concept.planetmath.liberabaci","target_kind":"node","target_sha256":"021e08a63796849223a3be044beaebf0d860b98acdcae12d628235f2d9676186"}],"concept.planetmath.limitpoint":[{"id":"assertion.concept.planetmath.limitpoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Limit point as stated in the captured PlanetMath entry limitpoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let X be a topological space , and let A ⊆ X . An element x ∈ X is said to be a limit point of A if every open set containing x also contains at least one point of A distinct from x .","support":[{"end":207,"quote":"Let\nX\nbe a\ntopological space\n, and let\nA\n⊆\nX\n. An element\nx\n∈\nX\nis said to be a\nlimit point\nof\nA\nif every\nopen set\ncontaining\nx\nalso contains at least one point of\nA\ndistinct from\nx\n.","source_id":"planetmath.limitpoint","source_sha256":"7a24ac1d0a96b4a87e37d561f926796bff20e57fb145b1151a101282120c3982","start":24}],"target_id":"concept.planetmath.limitpoint","target_kind":"node","target_sha256":"03f58e4d9831f3512f2fb9760f4f84138663d8cd766aa0dcad05d491395e84c9"}],"concept.planetmath.linearalgebra":[{"id":"assertion.concept.planetmath.linearalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear algebra as stated in the captured PlanetMath entry linearalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 15-00, 15-01) states: Linear algebra is the branch of mathematics devoted to the theory of linear structure .","support":[{"end":117,"quote":"Linear algebra\nis the branch of mathematics devoted to the theory of\nlinear\nstructure\n.","source_id":"planetmath.linearalgebra","source_sha256":"2b417257b29d83ce1c2cb3dd2537e7f81db7d6cdbc452d9d3c15b42477a7b589","start":30}],"target_id":"concept.planetmath.linearalgebra","target_kind":"node","target_sha256":"fd39545926d756b397aa26bda21c26df824c335fc543eda54188a3ce1d76798b"}],"concept.planetmath.linearfunctional":[{"id":"assertion.concept.planetmath.linearfunctional","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear functional as stated in the captured PlanetMath entry linearfunctional","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A99) states: Let V be a vector space over a field K . A linear functional (or linear form ) on V is a linear mapping ϕ : V → K , where K is thought of as a one-dimensional vector space over itself.","support":[{"end":220,"quote":"Let\nV\nbe a\nvector space\nover a field\nK\n.\nA\nlinear functional\n(or\nlinear form\n) on\nV\nis a\nlinear mapping\nϕ\n:\nV\n→\nK\n,\nwhere\nK\nis thought of as a one-dimensional vector space over itself.","source_id":"planetmath.linearfunctional","source_sha256":"7b4ff3bdc82f84d7bbc817e6d9094232df6cc199d9248024502a57e1f4e5d84a","start":36}],"target_id":"concept.planetmath.linearfunctional","target_kind":"node","target_sha256":"38e36953a296cd56e1fdcd4b8c23d2494ba6314a359bb4ca43f1085e79a99345"}],"concept.planetmath.linearisomorphism":[{"id":"assertion.concept.planetmath.linearisomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear isomorphism as stated in the captured PlanetMath entry linearisomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Definition 1 . Suppose V and W are vector spaces and L : V → W is a linear map .","support":[{"end":118,"quote":"Definition 1\n.\nSuppose\nV\nand\nW\nare\nvector spaces\nand\nL\n:\nV\n→\nW\nis a\nlinear map\n.","source_id":"planetmath.linearisomorphism","source_sha256":"88a37c0718f6804e0fb4e2454dfcc4ef47a23230d41de1b4db60ac69314698c8","start":38}],"target_id":"concept.planetmath.linearisomorphism","target_kind":"node","target_sha256":"39f7f601e4fa5b28e1300b1166d62f966fc375f9576b0816f0ceba271bf05b00"}],"concept.planetmath.linearlyordered":[{"id":"assertion.concept.planetmath.linearlyordered","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linearly ordered as stated in the captured PlanetMath entry linearlyordered","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: An ordering ≤ (or < ) of A is called linear or total if any two elements of A are comparable .","support":[{"end":128,"quote":"An\nordering\n≤\n(or\n<\n) of\nA\nis called\nlinear\nor\ntotal\nif any two elements of\nA\nare\ncomparable\n.","source_id":"planetmath.linearlyordered","source_sha256":"1f08ecb5d167d5c48911c79e142995dfb40f9b50f99516ceb4ee88c1d198fd9e","start":34}],"target_id":"concept.planetmath.linearlyordered","target_kind":"node","target_sha256":"6f2048862a67892f7ad51b3d798eec3e13210e9904aade1f14a72c6d5825b032"}],"concept.planetmath.lineartransformation":[{"id":"assertion.concept.planetmath.lineartransformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Linear transformation as stated in the captured PlanetMath entry lineartransformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A04) states: Let V and W be vector spaces over the same field F .","support":[{"end":96,"quote":"Let\nV\nand\nW\nbe\nvector spaces\nover the same field\nF\n.","source_id":"planetmath.lineartransformation","source_sha256":"e18e429d0c30935e3ac36495c976b13c3644aa3bf061bbfed708b228ce3d079b","start":44}],"target_id":"concept.planetmath.lineartransformation","target_kind":"node","target_sha256":"0b932be285f17ab67977d295258e631c17fe784b6411126f387d8c86705edc99"}],"concept.planetmath.linesegment":[{"id":"assertion.concept.planetmath.linesegment","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Line segment as stated in the captured PlanetMath entry linesegment","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 51-00) states: Definition Suppose V is a vector space over ℝ or ℂ , and L is a subset of V .","support":[{"end":103,"quote":"Definition\nSuppose\nV\nis a vector space over\nℝ\nor\nℂ\n, and\nL\nis a subset of\nV\n.","source_id":"planetmath.linesegment","source_sha256":"6795de6c1ad583fafb80e76ca4d6cf4652550acc684e2ccbe2ca05d6946c4330","start":26}],"target_id":"concept.planetmath.linesegment","target_kind":"node","target_sha256":"4a2c98e82e0a8491463d1c957266d955aad4fed1f918773beed1d2c479959bfd"}],"concept.planetmath.listvector":[{"id":"assertion.concept.planetmath.listvector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"List vector as stated in the captured PlanetMath entry listvector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03, 15A90) states: Let 𝕂 be a field and n a positive natural number. We define 𝕂 n to be the set of all mappings from the index list ( 1 , 2 , … , n ) to 𝕂 .","support":[{"end":162,"quote":"Let\n𝕂\nbe a field and\nn\na positive natural number. We define\n𝕂\nn\nto be the set of all\nmappings\nfrom the index list\n(\n1\n,\n2\n,\n…\n,\nn\n)\nto\n𝕂\n.","source_id":"planetmath.listvector","source_sha256":"8816f2f871a6310af6064ce7d0daf23cfb5330f1d02e79a9823852f2abbc2943","start":24}],"target_id":"concept.planetmath.listvector","target_kind":"node","target_sha256":"6cebb2a21fc2b74b00cfebc01c892e302e7919818cd8f1e2ff7e474e5cb56d8a"}],"concept.planetmath.locallycompacthausdorffspaces":[{"id":"assertion.concept.planetmath.locallycompacthausdorffspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally compact Hausdorff spaces as stated in the captured PlanetMath entry locallycompacthausdorffspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U40, 55-00) states: 1 Locally compact Hausdorff spaces Definition 1.1 .","support":[{"end":117,"quote":"1\nLocally compact Hausdorff spaces\nDefinition 1.1\n.","source_id":"planetmath.locallycompacthausdorffspaces","source_sha256":"b091866cd428368302d910eb06baed0118bf231e1094550fdf536a08bd578e25","start":66}],"target_id":"concept.planetmath.locallycompacthausdorffspaces","target_kind":"node","target_sha256":"70e03b289ca94b47dd4ac513acd5b01ce68bd065361c9e9a24e344cbc81cc852"}],"concept.planetmath.locallyconvextopologicalvectorspace":[{"id":"assertion.concept.planetmath.locallyconvextopologicalvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally convex topological vector space as stated in the captured PlanetMath entry locallyconvextopologicalvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A03, 46-00) states: Definition Let V be a topological vector space over a subfield of the complex numbers (usually taken to be ℝ or ℂ ).","support":[{"end":196,"quote":"Definition\nLet\nV\nbe a\ntopological vector space\nover a\nsubfield\nof the\ncomplex numbers\n(usually taken to be\nℝ\nor\nℂ\n).","source_id":"planetmath.locallyconvextopologicalvectorspace","source_sha256":"b3021d616ec08b1eb4f245827be1f70afc981dd1e6d9ec8c04256509ef8a5919","start":80}],"target_id":"concept.planetmath.locallyconvextopologicalvectorspace","target_kind":"node","target_sha256":"90c3a4024143db08a903e16b41f22b171c2ef337618675029b5f53198b4b46d7"}],"concept.planetmath.locallyhomeomorphic":[{"id":"assertion.concept.planetmath.locallyhomeomorphic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Locally homeomorphic as stated in the captured PlanetMath entry locallyhomeomorphic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00) states: Let X and Y be topological spaces . Then X is locally homeomorphic to Y , if for every x ∈ X there is a neighbourhood U ⊆ X of x and an http://planetmath.org/node/380 open set V ⊆ Y , such that U and V with their respective subspace topology are homeomorphic .","support":[{"end":302,"quote":"Let\nX\nand\nY\nbe\ntopological spaces\n. Then\nX\nis\nlocally\nhomeomorphic\nto\nY\n, if for every\nx\n∈\nX\nthere is a\nneighbourhood\nU\n⊆\nX\nof\nx\nand an\nhttp://planetmath.org/node/380\nopen set\nV\n⊆\nY\n, such that\nU\nand\nV\nwith their respective\nsubspace topology\nare\nhomeomorphic\n.","source_id":"planetmath.locallyhomeomorphic","source_sha256":"4a0c742db0c2e928e5ba5b8b0f7b5a8adaac448abc224f451473d2a33a37b567","start":42}],"target_id":"concept.planetmath.locallyhomeomorphic","target_kind":"node","target_sha256":"5325aca9d2e1537882e3c1757083890928bc0f962efaaf53ec6d0b923af39fcc"}],"concept.planetmath.logicalaxiom":[{"id":"assertion.concept.planetmath.logicalaxiom","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical axiom as stated in the captured PlanetMath entry logicalaxiom","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B22, 03B05) states: In a logical system , a logical axiom (sometimes called an axiom for short) is a logically valid (well-formed) formula used in a deductive system (particularly an axiom system ) to deduce other logically valid formulas.","support":[{"end":247,"quote":"In a\nlogical system\n, a\nlogical axiom\n(sometimes called an axiom for short) is a logically valid (well-formed)\nformula\nused in a\ndeductive system\n(particularly an\naxiom system\n) to deduce other logically valid formulas.","source_id":"planetmath.logicalaxiom","source_sha256":"0c20ccc08f48269af43fc3b76812eb24f7a9afb093de8a2abec8d00ead476afc","start":28}],"target_id":"concept.planetmath.logicalaxiom","target_kind":"node","target_sha256":"1f35b971558817f293d506a58d6e72284c5f9338a7602c692ea53242951b50cc"}],"concept.planetmath.logicalconnective":[{"id":"assertion.concept.planetmath.logicalconnective","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical connective as stated in the captured PlanetMath entry logicalconnective","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In propositional logic , the usual way of forming a well-formed formula out of existing ones is by attaching a designated symbol to the existing wffs.","support":[{"end":188,"quote":"In\npropositional logic\n, the usual way of forming a\nwell-formed formula\nout of existing ones is by attaching a designated symbol to the existing wffs.","source_id":"planetmath.logicalconnective","source_sha256":"b6e1d3285ca81aa748ce710b0e0dbac38a5ffb67e1f011e0efc440259ea7a6d1","start":38}],"target_id":"concept.planetmath.logicalconnective","target_kind":"node","target_sha256":"3ae1b1ee19f27ca4e4aa51b9cd0624ce93e8f5c252721686a7a014a7ef30734d"}],"concept.planetmath.logicallanguage":[{"id":"assertion.concept.planetmath.logicallanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logical language as stated in the captured PlanetMath entry logicallanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: In its most general form, a logical language is a set of rules for constructing formulas for some logic, which can then be assigned truth values based on the rules of that logic.","support":[{"end":212,"quote":"In its most general form, a\nlogical language\nis a set of rules for constructing\nformulas\nfor some logic, which can then be assigned truth values based on the rules of that logic.","source_id":"planetmath.logicallanguage","source_sha256":"31472f804795eb9e6e6597b98617841a21e310efd40ec489a0fa28bb0135bf9d","start":34}],"target_id":"concept.planetmath.logicallanguage","target_kind":"node","target_sha256":"96490758e5bb19d2e9cab36a06996d4fa4f127328a39cb7ef74f44d65ccd92e6"}],"concept.planetmath.logicallyequivalent":[{"id":"assertion.concept.planetmath.logicallyequivalent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logically equivalent as stated in the captured PlanetMath entry logicallyequivalent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: Two formulas A and B are said to be logically equivalent (typically shortened to equivalent ) when A is true if and only if B is true (that is, A implies B and B implies A ): ⊧ A ↔ B .","support":[{"end":226,"quote":"Two\nformulas\nA\nand\nB\nare said to be\nlogically equivalent\n(typically shortened to\nequivalent\n) when\nA\nis true if and only if\nB\nis true (that is,\nA\nimplies\nB\nand\nB\nimplies\nA\n):\n⊧\nA\n↔\nB\n.","source_id":"planetmath.logicallyequivalent","source_sha256":"a0750dd4793f66d880a31faa88dc3beed45b1d1c9c8d46706f2b82e17c1854ed","start":42}],"target_id":"concept.planetmath.logicallyequivalent","target_kind":"node","target_sha256":"90638fd3fcb419ab68a89c9a4c475b9664ee351515450c4ed056064d78a8b9bb"}],"concept.planetmath.logicism":[{"id":"assertion.concept.planetmath.logicism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Logicism as stated in the captured PlanetMath entry logicism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03A05, 03-01) states: In the literature on the foundations of mathematics logicism aims at proving that the propositions of pure mathematics can be derived from the propositions of logic.","support":[{"end":183,"quote":"In the literature on the\nfoundations of mathematics\nlogicism\naims at proving that the\npropositions\nof pure mathematics can be derived from the propositions of logic.","source_id":"planetmath.logicism","source_sha256":"8eb7b97996831b1cac7708a2b3bed19791c0450a1599f3c76d4850ee768c72b6","start":18}],"target_id":"concept.planetmath.logicism","target_kind":"node","target_sha256":"8f710a0e9b7f3115458ff1e5d21ad40b16a4ac146d465c1bb12faf5a7c7af264"}],"concept.planetmath.longline":[{"id":"assertion.concept.planetmath.longline","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Long line as stated in the captured PlanetMath entry longline","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54G20) states: The long line is a non-paracompact Hausdorff 1 -dimensional manifold constructed as follows.","support":[{"end":112,"quote":"The\nlong line\nis a non-paracompact\nHausdorff\n1\n-dimensional\nmanifold\nconstructed as\nfollows.","source_id":"planetmath.longline","source_sha256":"d373a73113412e1f432b28bc8ff9f3434f1e6a71130e9c0cf7f120095a2d3898","start":20}],"target_id":"concept.planetmath.longline","target_kind":"node","target_sha256":"6dfb8dd791f30dd51664ad0a3e3d08aa30965b1069fafd293f571118d0568184"}],"concept.planetmath.manifold":[{"id":"assertion.concept.planetmath.manifold","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Manifold as stated in the captured PlanetMath entry manifold","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53-00, 57R50, 58A05, 58A07) states: Summary. A manifold is a space that is locally like ℝ n , however lacking a preferred system of coordinates.","support":[{"end":126,"quote":"Summary.\nA\nmanifold\nis a space that is\nlocally like\nℝ\nn\n, however lacking a preferred system of\ncoordinates.","source_id":"planetmath.manifold","source_sha256":"54324af466875c32ae061f35b671bb056ba7e02237a4aeec8de9e27c49cf8270","start":18}],"target_id":"concept.planetmath.manifold","target_kind":"node","target_sha256":"4311fbd27fba129fb20aa76a8fc3189d63d70dcaf1c73fa630f787922a297ddb"}],"concept.planetmath.markovalgorithm":[{"id":"assertion.concept.planetmath.markovalgorithm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Markov algorithm as stated in the captured PlanetMath entry markovalgorithm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10) states: Definition A Markov algorithm is a variant of a rewriting system , invented by mathematician Andrey Andreevich Markov Jr.","support":[{"end":155,"quote":"Definition\nA\nMarkov algorithm\nis a variant of a\nrewriting system\n, invented by mathematician Andrey Andreevich Markov Jr.","source_id":"planetmath.markovalgorithm","source_sha256":"4c9a52de1d58ffc13ea79903e9efc662b0fee0305b00f1346524fd2536127e91","start":34}],"target_id":"concept.planetmath.markovalgorithm","target_kind":"node","target_sha256":"f0f7eb7cb2309d6e865e178ecd922a12a1f0eade22dc2047703bad37d6cac17a"}],"concept.planetmath.mathematica":[{"id":"assertion.concept.planetmath.mathematica","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Mathematica as stated in the captured PlanetMath entry mathematica","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 68W30) states: Mathematica is a computer algebra system produced by Wolfram Research.","support":[{"end":94,"quote":"Mathematica\nis a\ncomputer algebra system\nproduced by Wolfram Research.","source_id":"planetmath.mathematica","source_sha256":"21d302dbe013220d095c90429815bed4220e691a00ea70b0f60260f3d7430e8e","start":24}],"target_id":"concept.planetmath.mathematica","target_kind":"node","target_sha256":"b9418d9ef0c9a49cc1338dab848db5c13d983bb79948c10d7762d0ba82e85550"}],"concept.planetmath.matrixinverse":[{"id":"assertion.concept.planetmath.matrixinverse","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Matrix inverse as stated in the captured PlanetMath entry matrixinverse","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A09) states: 1 Matrix Inverse The inverse of an n × n matrix A is denoted by A - 1 .","support":[{"end":101,"quote":"1\nMatrix Inverse\nThe\ninverse\nof an\nn\n×\nn\nmatrix\nA\nis denoted by\nA\n-\n1\n.","source_id":"planetmath.matrixinverse","source_sha256":"fe4dabdc2c380ca1b15ceb0374ef202a7ad358bf21d4d3e51f696dcc920d59e8","start":30}],"target_id":"concept.planetmath.matrixinverse","target_kind":"node","target_sha256":"a4a73973db61bb739af4e552d965b7eabea9dc31d23f3b4952fb2d040f6f0203"}],"concept.planetmath.maximalelement":[{"id":"assertion.concept.planetmath.maximalelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximal element as stated in the captured PlanetMath entry maximalelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E04) states: Let ≤ be an ordering on a set S , and let A ⊆ S . Then, with respect to the ordering ≤ , • a ∈ A is the least element of A if a ≤ x , for all x ∈ A .","support":[{"end":181,"quote":"Let\n≤\nbe an\nordering\non a set\nS\n, and let\nA\n⊆\nS\n. Then, with respect to the ordering\n≤\n,\n•\na\n∈\nA\nis the\nleast\nelement of\nA\nif\na\n≤\nx\n, for all\nx\n∈\nA\n.","source_id":"planetmath.maximalelement","source_sha256":"fb241418be5277265aeca0d98ff416e6381f59c769909099742d5e53bca217b7","start":32}],"target_id":"concept.planetmath.maximalelement","target_kind":"node","target_sha256":"70cf9a0184abc291d24deb21d02236ec9293ec2fec9b270bfa0ad0225c5c1cf6"}],"concept.planetmath.maximallyconsistent":[{"id":"assertion.concept.planetmath.maximallyconsistent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximally consistent as stated in the captured PlanetMath entry maximallyconsistent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03B10, 03B99, 03B45) states: A set Δ of well-formed formulas (wff) is maximally consistent if Δ is consistent and any consistent superset of it is itself: Δ ⊆ Γ with Γ consistent implies Γ = Δ .","support":[{"end":207,"quote":"A set\nΔ\nof\nwell-formed formulas\n(wff) is\nmaximally consistent\nif\nΔ\nis\nconsistent\nand any consistent\nsuperset\nof it is itself:\nΔ\n⊆\nΓ\nwith\nΓ\nconsistent implies\nΓ\n=\nΔ\n.","source_id":"planetmath.maximallyconsistent","source_sha256":"36d0c33e8893ef801e3d394b17277bb0ac5adff080901a612791249012d91f69","start":42}],"target_id":"concept.planetmath.maximallyconsistent","target_kind":"node","target_sha256":"b1a81c2eca8317bfc1b095edaa0c0255bfd298d204ddb7e9322c90835c142727"}],"concept.planetmath.maximalsubgroup":[{"id":"assertion.concept.planetmath.maximalsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Maximal subgroup as stated in the captured PlanetMath entry maximalsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20E28) states: Let G be a group. A subgroup H of G is said to be a maximal subgroup of G if H ≠ G and there is no subgroup K of G such that H < K < G .","support":[{"end":170,"quote":"Let\nG\nbe a group.\nA\nsubgroup\nH\nof\nG\nis said to be a\nmaximal subgroup\nof\nG\nif\nH\n≠\nG\nand there is no subgroup\nK\nof\nG\nsuch that\nH\n<\nK\n<\nG\n.","source_id":"planetmath.maximalsubgroup","source_sha256":"43a3a3787b4d6f6c93a9ee800a221dd394fd26dfdc704643a37fb5331be808c8","start":34}],"target_id":"concept.planetmath.maximalsubgroup","target_kind":"node","target_sha256":"b1f013c6eb602941a20eb55fc0dd65ca1e776456148fd34fad94b4b76656d06e"}],"concept.planetmath.measurablespace":[{"id":"assertion.concept.planetmath.measurablespace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Measurable space as stated in the captured PlanetMath entry measurablespace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 28A33) states: A measurable space is a set E together with a collection ℬ of subsets of E which is a sigma algebra .","support":[{"end":135,"quote":"A\nmeasurable space\nis a set\nE\ntogether with a\ncollection\nℬ\nof subsets of\nE\nwhich is a\nsigma algebra\n.","source_id":"planetmath.measurablespace","source_sha256":"2990b76ba6e1d1b80fb1a1894a4785f36554a98b717bfd56a6b22c4c2a89ffec","start":34}],"target_id":"concept.planetmath.measurablespace","target_kind":"node","target_sha256":"2278b787a4dd5e0d588214a235ec3ad2cfa9b9179d7c5c2fb2f229a41ca7c1ab"}],"concept.planetmath.metalanguage":[{"id":"assertion.concept.planetmath.metalanguage","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metalanguage as stated in the captured PlanetMath entry metalanguage","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: A remedy for Berry’s Paradox and related paradoxes is to separate the language used to formulate a particular mathematical theory from the language used for its discourse.","support":[{"end":197,"quote":"A remedy for Berry’s\nParadox\nand related paradoxes is to\nseparate the\nlanguage\nused to formulate a particular mathematical\ntheory from the language used for its discourse.","source_id":"planetmath.metalanguage","source_sha256":"fed3ca5413c141359e007684e29735cc3e8ea2780d70b253a9c475dcd707db52","start":26}],"target_id":"concept.planetmath.metalanguage","target_kind":"node","target_sha256":"becffa1310dae1a3c824fd1610fc0304ed9e6f574482cfc3c0cef853691bc7fb"}],"concept.planetmath.metricequivalence":[{"id":"assertion.concept.planetmath.metricequivalence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metric equivalence as stated in the captured PlanetMath entry metricequivalence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Let X be a set equipped with two metrics ρ and σ . We say that ρ is equivalent to σ (on X ) if the identity map on X , is a homeomorphism between the metric topology on X induced by ρ and the metric topology on X induced by σ .","support":[{"end":265,"quote":"Let\nX\nbe a set equipped with two metrics\nρ\nand\nσ\n. We say that\nρ\nis\nequivalent\nto\nσ\n(on\nX\n) if the\nidentity map\non\nX\n, is a\nhomeomorphism\nbetween the\nmetric topology\non\nX\ninduced by\nρ\nand the metric topology on\nX\ninduced by\nσ\n.","source_id":"planetmath.metricequivalence","source_sha256":"17bd62f8505c605ecf703a4011571fead92c6427bb4394717b98c953d246c09a","start":38}],"target_id":"concept.planetmath.metricequivalence","target_kind":"node","target_sha256":"c64fc4dc12a36001a4d3d2af6ff2ca86b98c34e768548dd02bf1291793c9d816"}],"concept.planetmath.metricspace":[{"id":"assertion.concept.planetmath.metricspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metric space as stated in the captured PlanetMath entry metricspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 82-00, 83-00, 81-00) states: A metric space is a set X together with a real valued function d : X × X ⟶ ℝ (called a metric , or sometimes a distance function) such that, for every x , y , z ∈ X , • d ⁢ ( x , y ) ≥ 0 , with equality 1 1 This condition can be replaced with the weaker statement d ⁢ ( x , y ) = 0 ⇔ x = y without affecting the definition.","support":[{"end":349,"quote":"A\nmetric space\nis a set\nX\ntogether with a real valued\nfunction\nd\n:\nX\n×\nX\n⟶\nℝ\n(called a\nmetric\n, or sometimes a\ndistance\nfunction) such that, for every\nx\n,\ny\n,\nz\n∈\nX\n,\n•\nd\n⁢\n(\nx\n,\ny\n)\n≥\n0\n, with equality\n1\n1\nThis condition can be replaced with the weaker statement\nd\n⁢\n(\nx\n,\ny\n)\n=\n0\n⇔\nx\n=\ny\nwithout affecting the definition.","source_id":"planetmath.metricspace","source_sha256":"619e9a878509c6d5796ed16829e9503c9b59c2036f9e8a49ba7c695921d4cedf","start":26}],"target_id":"concept.planetmath.metricspace","target_kind":"node","target_sha256":"b2cc8ed490299616ab02e51f5526b827bc3e4e56683b1dbcd1cda2a05f960b57"}],"concept.planetmath.metrizable":[{"id":"assertion.concept.planetmath.metrizable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Metrizable as stated in the captured PlanetMath entry metrizable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00, 55-00, 22-00) states: A topological space ( X , 𝒯 ) is said to be metrizable if there is a metric d : X → [ 0 , ∞ ) such that the topology induced by d is 𝒯 .","support":[{"end":158,"quote":"A\ntopological space\n(\nX\n,\n𝒯\n)\nis said to be\nmetrizable\nif there is a metric\nd\n:\nX\n→\n[\n0\n,\n∞\n)\nsuch that the\ntopology\ninduced by\nd\nis\n𝒯\n.","source_id":"planetmath.metrizable","source_sha256":"c064f2572e7f2f3442c8c1169f365de6fb03f43f3c3dea2918f89b230f9eb16f","start":22}],"target_id":"concept.planetmath.metrizable","target_kind":"node","target_sha256":"91a61a0693201e0ac23dbb3045ac39d2e860e82037cdb780d77fbfb2763e0d93"}],"concept.planetmath.modallogic":[{"id":"assertion.concept.planetmath.modallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modal logic as stated in the captured PlanetMath entry modallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B45) states: Introduction Modal logic is the logic of “ necessity ” and “possibility”.","support":[{"end":97,"quote":"Introduction\nModal logic\nis the logic of “\nnecessity\n” and “possibility”.","source_id":"planetmath.modallogic","source_sha256":"d2821100b89606483505b429ad9cf10aab1e7e65dbc6f451f7f973fcfdcf904e","start":24}],"target_id":"concept.planetmath.modallogic","target_kind":"node","target_sha256":"a97249bd61721c0ba501cb7f5ca1b4e06b22d717ad5d08934bd7f25ad19843fb"}],"concept.planetmath.modelsconstructedfromconstants":[{"id":"assertion.concept.planetmath.modelsconstructedfromconstants","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Models constructed from constants as stated in the captured PlanetMath entry modelsconstructedfromconstants","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: The definition of a structure and of the satisfaction relation is nice, but it raises the following question : how do we get models in the first place? The most basic construction for models of first-order theory is the construction that uses constants .","support":[{"end":322,"quote":"The\ndefinition\nof a\nstructure\nand of the\nsatisfaction relation\nis\nnice, but it raises the following question : how do we get models in\nthe first place? The most basic construction for models of\nfirst-order theory\nis the construction that uses\nconstants\n.","source_id":"planetmath.modelsconstructedfromconstants","source_sha256":"4e199b023d7f6c7f78766f0bf5bc9d2b6038549300f425653b06c48990dc1c37","start":68}],"target_id":"concept.planetmath.modelsconstructedfromconstants","target_kind":"node","target_sha256":"ad43a2a6a7e39aae66597f62f7ddaf6b57aa7d3cf1e2365b6cd1a448f8cd6db9"}],"concept.planetmath.modeltheory":[{"id":"assertion.concept.planetmath.modeltheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Model theory as stated in the captured PlanetMath entry modeltheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C99) states: Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","support":[{"end":149,"quote":"Model theory\nis a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","source_id":"planetmath.modeltheory","source_sha256":"1d0595e99b710e8e882331819f1f880473573b9a4df465764bbcd2a95cef403b","start":26}],"target_id":"concept.planetmath.modeltheory","target_kind":"node","target_sha256":"afc7c91166a4596397747d1cb7ad435b9112c673410ef2e9c98451b8aef93df4"}],"concept.planetmath.modulusofcomplexnumber":[{"id":"assertion.concept.planetmath.modulusofcomplexnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modulus of complex number as stated in the captured PlanetMath entry modulusofcomplexnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 32-00, 30-00, 12D99) states: Definition Let z be a complex number , and let z ¯ be the complex conjugate of z .","support":[{"end":134,"quote":"Definition\nLet\nz\nbe a\ncomplex number\n, and let\nz\n¯\nbe the\ncomplex conjugate\nof\nz\n.","source_id":"planetmath.modulusofcomplexnumber","source_sha256":"7a3d4cd80becd035ce2441214723e891a8cd77427a0902c17b4e761a29a079bc","start":52}],"target_id":"concept.planetmath.modulusofcomplexnumber","target_kind":"node","target_sha256":"e1ceacd40a5358f29b2afc1ccb91695f539ce7e747dd0fae4b1c792a3eee75b2"}],"concept.planetmath.modusponens":[{"id":"assertion.concept.planetmath.modusponens","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Modus ponens as stated in the captured PlanetMath entry modusponens","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B22, 03B05, 03B35) states: Modus ponens is a rule of inference that is commonly found in many logics where the binary logical connective → (sometimes written ⇒ or ⊃ ) called logical implication are defined.","support":[{"end":205,"quote":"Modus ponens\nis a\nrule of inference\nthat is commonly found in many logics where the binary\nlogical connective\n→\n(sometimes written\n⇒\nor\n⊃\n) called\nlogical implication\nare defined.","source_id":"planetmath.modusponens","source_sha256":"6970f5ab3e357b6742e32019bbc3b149dee8941cd9ed3a8086800896a9547df7","start":26}],"target_id":"concept.planetmath.modusponens","target_kind":"node","target_sha256":"328186bad138923ec1b8766b1f1b2b0dafb08de7c60eab34f44df4bded503fec"}],"concept.planetmath.monoid":[{"id":"assertion.concept.planetmath.monoid","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monoid as stated in the captured PlanetMath entry monoid","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99, 34-01) states: A monoid is a semigroup G which contains an identity element ; that is, there exists an element e ∈ G such that e ⋅ a = a ⋅ e = a for all a ∈ G .","support":[{"end":159,"quote":"A monoid is a\nsemigroup\nG\nwhich contains an\nidentity element\n; that is, there exists an\nelement\ne\n∈\nG\nsuch that\ne\n⋅\na\n=\na\n⋅\ne\n=\na\nfor all\na\n∈\nG\n.","source_id":"planetmath.monoid","source_sha256":"316bdc1256bf1a9244c8d7163d44a5d4d7f5f40f376492a0d3ce716dbd92e27d","start":14}],"target_id":"concept.planetmath.monoid","target_kind":"node","target_sha256":"4c34f257100b46c7b9dd5d83c8deb1b82adeb3a38bcfef2cb546ca4b27a10e36"}],"concept.planetmath.monoidalcategory":[{"id":"assertion.concept.planetmath.monoidalcategory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monoidal category as stated in the captured PlanetMath entry monoidalcategory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 81-00, 18-00, 18D10) states: A monoidal category is a category which has the structure of a monoid, that is, among the objects there is a binary operation which is associative and has an unique neutral or unit element.","support":[{"end":225,"quote":"A\nmonoidal category\nis a\ncategory\nwhich has the\nstructure\nof a monoid, that is, among the objects there is a\nbinary operation\nwhich is\nassociative\nand has an unique neutral or unit element.","source_id":"planetmath.monoidalcategory","source_sha256":"6673cc88b63bce95a4a575c8c9cb2b9db605d6ce4f5cbf841af772d66f145806","start":36}],"target_id":"concept.planetmath.monoidalcategory","target_kind":"node","target_sha256":"9193e1894d0e4267a49f213beb7d1b6651ce08fa7c4e0f173ea29c3b055b2721"}],"concept.planetmath.monomial":[{"id":"assertion.concept.planetmath.monomial","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Monomial as stated in the captured PlanetMath entry monomial","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 12-00) states: A monomial is a product of non-negative powers of variables .","support":[{"end":79,"quote":"A\nmonomial\nis a\nproduct\nof non-negative powers of\nvariables\n.","source_id":"planetmath.monomial","source_sha256":"a0829a2cd58dda3489739664bbaeda2526b4d826cbcc21d101ecc7cc8e679ac4","start":18}],"target_id":"concept.planetmath.monomial","target_kind":"node","target_sha256":"5d751e61b07f23c246365cfdb250fa9c86873500104ed978202cb6bbfef48f19"}],"concept.planetmath.multilinear":[{"id":"assertion.concept.planetmath.multilinear","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multi-linear as stated in the captured PlanetMath entry multilinear","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69) states: Let V 1 , V 2 , … , V n , W be vector spaces over a field K .","support":[{"end":87,"quote":"Let\nV\n1\n,\nV\n2\n,\n…\n,\nV\nn\n,\nW\nbe\nvector spaces\nover a field\nK\n.","source_id":"planetmath.multilinear","source_sha256":"1775ae0939b04c0f5953baf8fe5c61afbf8db6b7a354bc8a7dc6a32b3c39ac68","start":26}],"target_id":"concept.planetmath.multilinear","target_kind":"node","target_sha256":"49e08505b330e6e96b5d8abaf3c8c0c5d23cfdded053802d082fb7c247f25f96"}],"concept.planetmath.multiplication":[{"id":"assertion.concept.planetmath.multiplication","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiplication as stated in the captured PlanetMath entry multiplication","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A06, 11B25, 00A05) states: Multiplication is a mathematical operation in which two or more numbers are added up to themselves by a factor of other numbers.","support":[{"end":158,"quote":"Multiplication\nis a mathematical\noperation\nin which two or more numbers are added up to themselves by a factor of other numbers.","source_id":"planetmath.multiplication","source_sha256":"3efbdee95c7b88ba04c03acf699dfbb8364ca93382576ed35791110652f0609d","start":30}],"target_id":"concept.planetmath.multiplication","target_kind":"node","target_sha256":"f0c5b62b1acef082fe86db9e8edb92452e9e03e467bbad397eb3eda852e6daa9"}],"concept.planetmath.multiplicationoperator":[{"id":"assertion.concept.planetmath.multiplicationoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiplication operator as stated in the captured PlanetMath entry multiplicationoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A99) states: A multiplication operator is an operator signifying multiplication among two or more operands.","support":[{"end":142,"quote":"A\nmultiplication operator\nis an\noperator\nsignifying\nmultiplication\namong two or more operands.","source_id":"planetmath.multiplicationoperator","source_sha256":"df6785d682f7ae7755adcb6d17792e7c740bf8ffd215bb9b8b2ff4f87dd541fd","start":48}],"target_id":"concept.planetmath.multiplicationoperator","target_kind":"node","target_sha256":"b0fac47ed3c1030744bdb13d7084dd8a0e27e0ae9716bc6a44456e0a1a471fa8"}],"concept.planetmath.multiset":[{"id":"assertion.concept.planetmath.multiset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multiset as stated in the captured PlanetMath entry multiset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: A multiset is a set for which repeated elements are considered.","support":[{"end":81,"quote":"A\nmultiset\nis a set for which repeated\nelements\nare considered.","source_id":"planetmath.multiset","source_sha256":"b211e4a66e6af6affe5550f5f9242b8e0a75abc710f20f5b8eae8a3cabddc8cf","start":18}],"target_id":"concept.planetmath.multiset","target_kind":"node","target_sha256":"2f2f01d47a37d3be4aa225b79a8af2610d64bac1c4fcf757e65b43a2ff942de4"}],"concept.planetmath.multivaluedfunction":[{"id":"assertion.concept.planetmath.multivaluedfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Multivalued function as stated in the captured PlanetMath entry multivaluedfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Let us recall that a function f from a set A to a set B is an assignment that takes each element of A to a unique element of B .","support":[{"end":170,"quote":"Let us recall that a\nfunction\nf\nfrom a set\nA\nto a set\nB\nis an assignment that takes each element of\nA\nto a\nunique\nelement of\nB\n.","source_id":"planetmath.multivaluedfunction","source_sha256":"e6c43ab96a914e069f41e1e917458e287ab534844ee1b67cfc4bda655b4c3f0c","start":42}],"target_id":"concept.planetmath.multivaluedfunction","target_kind":"node","target_sha256":"26cfda9355f672c95a2d9f9b359aeddfbd7de7feb81f828a1e8677a2d9637b9e"}],"concept.planetmath.naturaldeduction":[{"id":"assertion.concept.planetmath.naturaldeduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Natural deduction as stated in the captured PlanetMath entry naturaldeduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03) states: Natural deduction refers to related proof systems for several different kinds of logic, intended to be similar to the way people actually reason.","support":[{"end":181,"quote":"Natural deduction\nrefers to related\nproof systems\nfor several different kinds of logic, intended to be\nsimilar\nto the way people actually reason.","source_id":"planetmath.naturaldeduction","source_sha256":"da719ce5c56e01f0b96a68c465131d17a00b01f31130a707fb26fbbd9918efc0","start":36}],"target_id":"concept.planetmath.naturaldeduction","target_kind":"node","target_sha256":"baa0838243b2f482956939d6b6bdefa7ea3272d3e3a2caffac9872403fc300a9"}],"concept.planetmath.naturalnumber":[{"id":"assertion.concept.planetmath.naturalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Natural number as stated in the captured PlanetMath entry naturalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10, 74D99) states: Given the Zermelo-Fraenkel axioms of set theory , one can prove that there exists an inductive set X such that ∅ ∈ X .","support":[{"end":148,"quote":"Given the\nZermelo-Fraenkel axioms\nof\nset theory\n, one can prove that there exists an\ninductive set\nX\nsuch that\n∅\n∈\nX\n.","source_id":"planetmath.naturalnumber","source_sha256":"6f3bf110d753d9e8fccd59de44dfe3b308faaafbba7c7431c972078f524a43ef","start":30}],"target_id":"concept.planetmath.naturalnumber","target_kind":"node","target_sha256":"3f5076d4babd67da2c4c51f13232e37d5420a5e3d3163b520cd34880658551a4"}],"concept.planetmath.nearring":[{"id":"assertion.concept.planetmath.nearring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Near-ring as stated in the captured PlanetMath entry nearring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16Y30) states: Definitions A near-ring is a set ( http://planetmath.org/Set ) N together with two binary operations , denoted + : N × N → N and ⋅ : N × N → N , such that 1.","support":[{"end":177,"quote":"Definitions\nA\nnear-ring\nis a set (\nhttp://planetmath.org/Set\n)\nN\ntogether with two\nbinary operations\n, denoted\n+\n:\nN\n×\nN\n→\nN\nand\n⋅\n:\nN\n×\nN\n→\nN\n, such that\n1.","source_id":"planetmath.nearring","source_sha256":"e8c7bd04e003c14a8894c0146a8bd8ec71381c981d2daf182facadd10fe57004","start":20}],"target_id":"concept.planetmath.nearring","target_kind":"node","target_sha256":"b29789c7bde02dcda8c052f35ae6c431b89e8d630d47b2cb287d9c464e531d55"}],"concept.planetmath.necessaryandsufficient":[{"id":"assertion.concept.planetmath.necessaryandsufficient","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Necessary and sufficient as stated in the captured PlanetMath entry necessaryandsufficient","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03F07) states: The statement “ p is necessary for q ” “ q implies ( http://planetmath.org/ Implication ) p ”.","support":[{"end":145,"quote":"The statement “\np\nis\nnecessary\nfor\nq\n”  “\nq\nimplies (\nhttp://planetmath.org/\nImplication\n)\np\n”.","source_id":"planetmath.necessaryandsufficient","source_sha256":"f54351a3fea8d8f8ac87034fb1b6201e46fd1368710a580fc5a5e0076c45e9fd","start":50}],"target_id":"concept.planetmath.necessaryandsufficient","target_kind":"node","target_sha256":"0e0f57356f657145a12a3fd015f58b1ff1b752fd3dedd41008298deafa352e93"}],"concept.planetmath.negativenumber":[{"id":"assertion.concept.planetmath.negativenumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Negative number as stated in the captured PlanetMath entry negativenumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A negative number is a number that is less than zero.","support":[{"end":85,"quote":"A\nnegative number\nis a number that is less than zero.","source_id":"planetmath.negativenumber","source_sha256":"9d7a27405f59967fa2052d6cdb2f4be067abf527063ecc936645ff0e65880ce9","start":32}],"target_id":"concept.planetmath.negativenumber","target_kind":"node","target_sha256":"1c1c4ef005f1ca3e357b1217d721ed2a293c6d18f67168418fa1629c65b9248a"}],"concept.planetmath.neighborhood":[{"id":"assertion.concept.planetmath.neighborhood","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Neighborhood as stated in the captured PlanetMath entry neighborhood","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: The meaning of the word neighborhood in topology is not well standardized.","support":[{"end":100,"quote":"The meaning of the word\nneighborhood\nin\ntopology\nis not well standardized.","source_id":"planetmath.neighborhood","source_sha256":"4fca53119d178fcda32906bae284d0cf6053338dee716d8cdbe0979041b1692e","start":26}],"target_id":"concept.planetmath.neighborhood","target_kind":"node","target_sha256":"e375a0e1208c2b8bee90f95d38908770ddd162d63571fd8881c883148af7d89f"}],"concept.planetmath.neighborhoodofavertex":[{"id":"assertion.concept.planetmath.neighborhoodofavertex","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Neighborhood (of a vertex) as stated in the captured PlanetMath entry neighborhoodofavertex","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C99) states: For a graph G , the set of vertices adjacent to a vertex x ∈ G , the neighborhood of x , is denoted by Γ ⁢ ( x ) .","support":[{"end":168,"quote":"For a graph\nG\n, the set of vertices\nadjacent\nto a vertex\nx\n∈\nG\n, the\nneighborhood\nof\nx\n, is denoted by\nΓ\n⁢\n(\nx\n)\n.","source_id":"planetmath.neighborhoodofavertex","source_sha256":"f7865fd6fde1d6e79a8fc5dd5ad5a08232fed00b3b753c36722758d5f5c17df5","start":54}],"target_id":"concept.planetmath.neighborhoodofavertex","target_kind":"node","target_sha256":"e3ce0c3184ef78807a566621a7c8c11a8effe747a50f8f983decf648ff10602d"}],"concept.planetmath.net":[{"id":"assertion.concept.planetmath.net","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Net as stated in the captured PlanetMath entry net","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A20) states: Let X be a set. A net is a map from a directed set to X .","support":[{"end":65,"quote":"Let\nX\nbe a set. A\nnet\nis a map from a directed set to\nX\n.","source_id":"planetmath.net","source_sha256":"a9071141b7d3ed3e851076d32796a2c97744e61e5a26e2f31c58f64cd3d292fd","start":8}],"target_id":"concept.planetmath.net","target_kind":"node","target_sha256":"f42401c4eb6dbbf54742498fe0565ef2850be7527ee803cb61e640398f508bc0"}],"concept.planetmath.noncommutativedynamicmodelingdiagrams":[{"id":"assertion.concept.planetmath.noncommutativedynamicmodelingdiagrams","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-commutative dynamic modeling diagrams as stated in the captured PlanetMath entry noncommutativedynamicmodelingdiagrams","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C98, 03C52, 18-00, 03D80, 03D15) states: \\xyoption curve 0.1 Introduction In an interesting report, Rosen(1987) showed that complex dynamical systems , such as biological organisms, cannot be adequately modelled through a commutative modelling diagram – in the sense of digital computer simulation –whereas the simple (‘physical’/ engineering) dynamical systems can be thus numerically simulated.","support":[{"end":439,"quote":"\\xyoption\ncurve\n0.1\nIntroduction\nIn an interesting report, Rosen(1987) showed that\ncomplex\ndynamical systems\n,\nsuch as biological organisms, cannot be adequately modelled through\na\ncommutative\nmodelling diagram\n– in the sense of digital\ncomputer simulation\n–whereas the simple (‘physical’/ engineering)\ndynamical systems can be thus numerically simulated.","source_id":"planetmath.noncommutativedynamicmodelingdiagrams","source_sha256":"1e48aed8f54309398dd32aa87c9ebc4debe4bf93864eb6944a735ba9a494e475","start":84}],"target_id":"concept.planetmath.noncommutativedynamicmodelingdiagrams","target_kind":"node","target_sha256":"0d253f3594ebf29e00c73fcb4735ddaf199fd4e9dab03de80812dce95ffb1458"}],"concept.planetmath.noncommutativestructure":[{"id":"assertion.concept.planetmath.noncommutativestructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-commutative structure as stated in the captured PlanetMath entry noncommutativestructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55-00, 18-00) states: Definition 0.1 . Let ( C , ∘ ) be a structure consisting of a class , C , together with a binary operation ∘ defined for pairs of objects in C (or elements of C when the latter is a small class, i.e., a set).","support":[{"end":260,"quote":"Definition 0.1\n.\nLet\n(\nC\n,\n∘\n)\nbe a\nstructure\nconsisting of a\nclass\n,\nC\n, together with a\nbinary operation\n∘\ndefined for pairs of objects in\nC\n(or elements of\nC\nwhen the latter is a small class, i.e., a set).","source_id":"planetmath.noncommutativestructure","source_sha256":"39f18106d6c1c0d1076dcff73f4111f659b5b51d02328d202006552da2c78ad1","start":52}],"target_id":"concept.planetmath.noncommutativestructure","target_kind":"node","target_sha256":"75f583d168e2c401dd945ba49aaa13410e150e6ef05cf7f5c76ab593365cc192"}],"concept.planetmath.nondegeneratebilinearform":[{"id":"assertion.concept.planetmath.nondegeneratebilinearform","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Non-degenerate bilinear form as stated in the captured PlanetMath entry nondegeneratebilinearform","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39) states: A bilinear form B over a vector space V is said to be non-degenerate when • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐱 ∈ V , then 𝐲 = 𝟎 , and • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐲 ∈ V , then 𝐱 = 𝟎 .","support":[{"end":239,"quote":"A\nbilinear form\nB\nover a\nvector space\nV\nis said to be\nnon-degenerate\nwhen\n•\nif\nB\n⁢\n(\n𝐱\n,\n𝐲\n)\n=\n0\nfor all\n𝐱\n∈\nV\n, then\n𝐲\n=\n𝟎\n, and\n•\nif\nB\n⁢\n(\n𝐱\n,\n𝐲\n)\n=\n0\nfor all\n𝐲\n∈\nV\n, then\n𝐱\n=\n𝟎\n.","source_id":"planetmath.nondegeneratebilinearform","source_sha256":"904b42747deeb8f1e0d5125ee6fc86568e6acea733550dfe719a76d23e625a31","start":58}],"target_id":"concept.planetmath.nondegeneratebilinearform","target_kind":"node","target_sha256":"d0705ea38083752bf9a451832c518c51501ec9ee2d67c150f31cd2eeb8ccea5d"}],"concept.planetmath.normalmodallogic":[{"id":"assertion.concept.planetmath.normalmodallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normal modal logic as stated in the captured PlanetMath entry normalmodallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B45) states: The study of modal logic is based on the concept of a logic , which is a set Λ of wff’s satisfying the following: • contains all tautologies , and • is closed under modus ponens .","support":[{"end":217,"quote":"The study of\nmodal logic\nis based on the\nconcept\nof a\nlogic\n, which is a set\nΛ\nof wff’s satisfying the following:\n•\ncontains all\ntautologies\n, and\n•\nis\nclosed under\nmodus ponens\n.","source_id":"planetmath.normalmodallogic","source_sha256":"cca884013fa3f04fac523e3ba89ba23108e958b44a8647c7ef4328675a1987f1","start":38}],"target_id":"concept.planetmath.normalmodallogic","target_kind":"node","target_sha256":"10b6e9ec42a1a61690cf9d55fe376e94d3ef88581e41ebabb9cab2de80da51dc"}],"concept.planetmath.normalsubgroup":[{"id":"assertion.concept.planetmath.normalsubgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normal subgroup as stated in the captured PlanetMath entry normalsubgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: A subgroup H of a group G is normal if a ⁢ H = H ⁢ a for all a ∈ G .","support":[{"end":100,"quote":"A\nsubgroup\nH\nof a group\nG\nis\nnormal\nif\na\n⁢\nH\n=\nH\n⁢\na\nfor all\na\n∈\nG\n.","source_id":"planetmath.normalsubgroup","source_sha256":"5d4b5b8e96e192e23a564d653af46dc10f08f7cc755e7f4a39caacbd90efd18b","start":32}],"target_id":"concept.planetmath.normalsubgroup","target_kind":"node","target_sha256":"b5d5ffe76d49e46e8fc7b38843e66baf805d2b574e143deedfceac14da2f33d6"}],"concept.planetmath.normedvectorspace":[{"id":"assertion.concept.planetmath.normedvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Normed vector space as stated in the captured PlanetMath entry normedvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B99) states: Let 𝔽 be a field which is either ℝ or ℂ . A over 𝔽 is a pair ( V , ∥ ⋅ ∥ ) where V is a vector space over 𝔽 and ∥ ⋅ ∥ : V → ℝ is a function such that 1.","support":[{"end":192,"quote":"Let\n𝔽\nbe a field which is either\nℝ\nor\nℂ\n. A\nover\n𝔽\nis a pair\n(\nV\n,\n∥\n⋅\n∥\n)\nwhere\nV\nis a\nvector space\nover\n𝔽\nand\n∥\n⋅\n∥\n:\nV\n→\nℝ\nis a function such that\n1.","source_id":"planetmath.normedvectorspace","source_sha256":"bc93cb3125040dfdcd8e9b9e651f5611e78166ad8694de2eb667c8e86ab57e6e","start":40}],"target_id":"concept.planetmath.normedvectorspace","target_kind":"node","target_sha256":"99f2bcacb7c7be52b8c13652ef07e72e0f0af636cf86ff6724c1030f2f344105"}],"concept.planetmath.oddnumber":[{"id":"assertion.concept.planetmath.oddnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Odd number as stated in the captured PlanetMath entry oddnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A51) states: An odd number n is an integer of the form 2 ⁢ m + 1 , and as such it is not divisible by 2.","support":[{"end":113,"quote":"An\nodd number\nn\nis an\ninteger\nof the form\n2\n⁢\nm\n+\n1\n, and as such it is not\ndivisible\nby 2.","source_id":"planetmath.oddnumber","source_sha256":"49c32ac6fea407e8355af849bddfca61ea20fa95f78ffecdff967c354859c4f6","start":22}],"target_id":"concept.planetmath.oddnumber","target_kind":"node","target_sha256":"e7a6b0e558c5cab04e6c96f5fbfcd589b9d40b6bb8ca038cd3c9491efb087e4e"}],"concept.planetmath.ominimality":[{"id":"assertion.concept.planetmath.ominimality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"O-minimality as stated in the captured PlanetMath entry ominimality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C64, 14P10) states: Let M be an ordered structure . An interval in M is any subset of M that can be expressed in one of the following forms: • { x : a < x < b } for some a , b from M • { x : x > a } for some a from M • { x : x < a } for some a from M Then we define M to be o-minimal iff every definable subset of M is a finite union of intervals and points.","support":[{"end":364,"quote":"Let\nM\nbe an ordered\nstructure\n. An\ninterval\nin\nM\nis any subset of\nM\nthat can be expressed in one of the following forms:\n•\n{\nx\n:\na\n<\nx\n<\nb\n}\nfor some\na\n,\nb\nfrom\nM\n•\n{\nx\n:\nx\n>\na\n}\nfor some\na\nfrom\nM\n•\n{\nx\n:\nx\n<\na\n}\nfor some\na\nfrom\nM\nThen we define\nM\nto be\no-minimal\niff every\ndefinable\nsubset of\nM\nis a finite union of intervals and points.","source_id":"planetmath.ominimality","source_sha256":"47e01001f61334a5da29852dadec77639e06847818cf87720f67110be0e769e7","start":26}],"target_id":"concept.planetmath.ominimality","target_kind":"node","target_sha256":"3acbb399f86dd0e483b636b064961c143524f9c36686eaa105f539a035b5b51c"}],"concept.planetmath.openset":[{"id":"assertion.concept.planetmath.openset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Open set as stated in the captured PlanetMath entry openset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A05) states: In a metric space M a set O is called an open subset of M or just open , if for every x ∈ O there is an open ball S around x such that S ⊂ O .","support":[{"end":160,"quote":"In a\nmetric space\nM\na set\nO\nis called an\nopen subset\nof\nM\nor just\nopen\n, if for every\nx\n∈\nO\nthere is an open ball\nS\naround\nx\nsuch that\nS\n⊂\nO\n.","source_id":"planetmath.openset","source_sha256":"0a2ca658f0dc8a0af6e50a94fb2152cd8dadc3832aa8857ad2b7b6f0d9fe6b2d","start":18}],"target_id":"concept.planetmath.openset","target_kind":"node","target_sha256":"bd73542ba77c774920e11f3bf58651119c4fab2f2ae0626df1e3236af4331019"}],"concept.planetmath.operationsonrelations":[{"id":"assertion.concept.planetmath.operationsonrelations","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Operations on relations as stated in the captured PlanetMath entry operationsonrelations","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A02, 03E20) states: Recall that an n -ary relation ( n > 0 ) is a subset of a product of some n sets.","support":[{"end":129,"quote":"Recall that an\nn\n-ary\nrelation\n(\nn\n>\n0\n) is a subset of a\nproduct\nof some\nn\nsets.","source_id":"planetmath.operationsonrelations","source_sha256":"1dda6f9fe2e8b257063d7851a56a9aacaefb0f3281490d8e0d1454dd882d8151","start":48}],"target_id":"concept.planetmath.operationsonrelations","target_kind":"node","target_sha256":"8c23b66c9971ce766d98d1c553c0af8ad40324923e19cddbea3a22a55dab5318"}],"concept.planetmath.operatornorm":[{"id":"assertion.concept.planetmath.operatornorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Operator norm as stated in the captured PlanetMath entry operatornorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47L25, 46A32, 47A30) states: Definition Let A : 𝖵 → 𝖶 be a linear map between normed vector spaces 𝖵 and 𝖶 .","support":[{"end":107,"quote":"Definition\nLet\nA\n:\n𝖵\n→\n𝖶\nbe a\nlinear map\nbetween\nnormed vector spaces\n𝖵\nand\n𝖶\n.","source_id":"planetmath.operatornorm","source_sha256":"cf8e67ad7d027b8803b3f7c65cb968d86860a0c131d7263307bd26c5b6d82b07","start":28}],"target_id":"concept.planetmath.operatornorm","target_kind":"node","target_sha256":"a4a557f0c4442d9e9850014d9449ce36baf8f07b4def01fded8d42da0a6ed2e0"}],"concept.planetmath.orderedgeometry":[{"id":"assertion.concept.planetmath.orderedgeometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered geometry as stated in the captured PlanetMath entry orderedgeometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51G05) states: \\PMlinkescapephrase line segment \\PMlinkescapephrase generated by \\PMlinkescapephrase opposite sides \\PMlinkescapephrase end points 1 Definition Let ( A , B ) be a linear ordered geometry , where A = ( P , n , I ) is an incidence geometry , and B is a strict betweenness relation .","support":[{"end":315,"quote":"\\PMlinkescapephrase\nline segment\n\\PMlinkescapephrase\ngenerated by\n\\PMlinkescapephrase\nopposite sides\n\\PMlinkescapephrase\nend points\n1\nDefinition\nLet\n(\nA\n,\nB\n)\nbe a\nlinear ordered geometry\n, where\nA\n=\n(\nP\n,\nn\n,\nI\n)\nis an\nincidence geometry\n,\nand\nB\nis a\nstrict betweenness relation\n.","source_id":"planetmath.orderedgeometry","source_sha256":"6d44b35b4a147dac13fa98a07a966e70d7b538c7cc19487bd80e7fa71f8563eb","start":34}],"target_id":"concept.planetmath.orderedgeometry","target_kind":"node","target_sha256":"ae42b20605035200adc1497d25e26ecb616e63db7efa02e214cea68d3a4af995"}],"concept.planetmath.orderedpair":[{"id":"assertion.concept.planetmath.orderedpair","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered pair as stated in the captured PlanetMath entry orderedpair","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 70A05, 70G99) states: For any sets a and b , the ordered pair ( a , b ) is the set { { a } , { a , b } } .","support":[{"end":110,"quote":"For any sets\na\nand\nb\n, the\nordered pair\n(\na\n,\nb\n)\nis the set\n{\n{\na\n}\n,\n{\na\n,\nb\n}\n}\n.","source_id":"planetmath.orderedpair","source_sha256":"e827d7ec2e3406f7fedc55d135f1fcb8be793855c62b12d8dc39b355464e3e34","start":26}],"target_id":"concept.planetmath.orderedpair","target_kind":"node","target_sha256":"4ae1a4abfb0dfa233577af1172da20c29209c9dbbf18074d4a897f68e0f8a81c"}],"concept.planetmath.orderedtuplet":[{"id":"assertion.concept.planetmath.orderedtuplet","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordered tuplet as stated in the captured PlanetMath entry orderedtuplet","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: The concept of ordered n -tuplet is the generalization of ordered pair to n items.","support":[{"end":112,"quote":"The\nconcept\nof ordered\nn\n-tuplet is the\ngeneralization\nof\nordered pair\nto\nn\nitems.","source_id":"planetmath.orderedtuplet","source_sha256":"457e29347bfac2aadf9f36b8d6db948bc93dc2c5277d806c2e766f688e9106fc","start":30}],"target_id":"concept.planetmath.orderedtuplet","target_kind":"node","target_sha256":"ad0c28b52281052b170ff11555bbba5f33ad6e5e70810a96a701fad42f0ff07d"}],"concept.planetmath.orderideal":[{"id":"assertion.concept.planetmath.orderideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Order ideal as stated in the captured PlanetMath entry orderideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06, 06A12) states: Order Ideals and Filters Let P be a poset. A subset I of P is said to be an order ideal if • I is a lower set : ↓ I = I , and • I is a directed set : I is non-empty, and every pair of elements in I has an upper bound in I .","support":[{"end":247,"quote":"Order Ideals and Filters\nLet\nP\nbe a poset. A subset\nI\nof\nP\nis said to be an\norder ideal\nif\n•\nI\nis a\nlower set\n:\n↓\nI\n=\nI\n, and\n•\nI\nis a\ndirected set\n:\nI\nis non-empty, and every pair of\nelements\nin\nI\nhas an\nupper bound\nin\nI\n.","source_id":"planetmath.orderideal","source_sha256":"e20e3873b7dc91724d9f01abb2716004cb1d129f62c371a8c200809565ac6fde","start":24}],"target_id":"concept.planetmath.orderideal","target_kind":"node","target_sha256":"fb8996f25067f311cfcbc38d4475e0c50ae800342cf568c6ebb8356cc766ad46"}],"concept.planetmath.orderingrelation":[{"id":"assertion.concept.planetmath.orderingrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordering relation as stated in the captured PlanetMath entry orderingrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 81-00, 18-00, 17B37, 18D10, 18D35, 16W30) states: Let S be a set. An ordering relation is a relation ≤ on S such that, for every a , b , c ∈ S : • Either a ≤ b , or b ≤ a , • If a ≤ b and b ≤ c , then a ≤ c , • If a ≤ b and b ≤ a , then a = b .","support":[{"end":230,"quote":"Let\nS\nbe a set. An\nordering relation\nis a\nrelation\n≤\non\nS\nsuch that, for every\na\n,\nb\n,\nc\n∈\nS\n:\n•\nEither\na\n≤\nb\n, or\nb\n≤\na\n,\n•\nIf\na\n≤\nb\nand\nb\n≤\nc\n, then\na\n≤\nc\n,\n•\nIf\na\n≤\nb\nand\nb\n≤\na\n, then\na\n=\nb\n.","source_id":"planetmath.orderingrelation","source_sha256":"8a26379ffa79789324e633a0b43469900f4c927e82d3757c0609a4d2232f6b28","start":36}],"target_id":"concept.planetmath.orderingrelation","target_kind":"node","target_sha256":"5220b5f8821a2cef0bb0e7ea23d7a08f0b6795f016f8f379f2964194287f8459"}],"concept.planetmath.orderpreservingmap":[{"id":"assertion.concept.planetmath.orderpreservingmap","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Order-preserving map as stated in the captured PlanetMath entry orderpreservingmap","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A06) states: Order-preserving map from a poset L to a poset M is a function f such that ∀ x , y ∈ L : ( x ≥ y ⟹ f ( x ) ≥ f ( y ) ) .","support":[{"end":162,"quote":"Order-preserving map\nfrom a poset\nL\nto a poset\nM\nis a\nfunction\nf\nsuch that\n∀\nx\n,\ny\n∈\nL\n:\n(\nx\n≥\ny\n⟹\nf\n(\nx\n)\n≥\nf\n(\ny\n)\n)\n.","source_id":"planetmath.orderpreservingmap","source_sha256":"9c87a2595b06dee7d0424a02b370aca571c24c5fd0952182b982287f6a690a95","start":42}],"target_id":"concept.planetmath.orderpreservingmap","target_kind":"node","target_sha256":"c791cd0da18f179458d9b68cfdaa92365a8189bb3403537ec555d37b4b7ab784"}],"concept.planetmath.ordinalarithmetic":[{"id":"assertion.concept.planetmath.ordinalarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordinal arithmetic as stated in the captured PlanetMath entry ordinalarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E10) states: Ordinal arithmetic is the extension of normal arithmetic to the transfinite ordinal numbers.","support":[{"end":130,"quote":"Ordinal arithmetic\nis the\nextension\nof normal\narithmetic\nto the transfinite ordinal numbers.","source_id":"planetmath.ordinalarithmetic","source_sha256":"82c530b1c99e8d7b80ea5e216c2b57337846fa369d09f75c3ca5601b024503d4","start":38}],"target_id":"concept.planetmath.ordinalarithmetic","target_kind":"node","target_sha256":"53b53ac7b57c2b2137e68f9de30e22127ed513cf483c4fae9c070a826b0e0caa"}],"concept.planetmath.ordinalnumber":[{"id":"assertion.concept.planetmath.ordinalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ordinal number as stated in the captured PlanetMath entry ordinalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: An ordinal number is a well ordered set S such that, for every x ∈ S , x = { z ∈ S ∣ z < x } (where < is the ordering relation on S ).","support":[{"end":164,"quote":"An\nordinal number\nis a well\nordered set\nS\nsuch that, for every\nx\n∈\nS\n,\nx\n=\n{\nz\n∈\nS\n∣\nz\n<\nx\n}\n(where\n<\nis the\nordering relation\non\nS\n).","source_id":"planetmath.ordinalnumber","source_sha256":"d5fc49adba72dcdc62cdc3268b14b9247be2895a50640736bb4b8cb075a75442","start":30}],"target_id":"concept.planetmath.ordinalnumber","target_kind":"node","target_sha256":"b68a1313821adedcbc91f75da237ff7fdbafa1f4d187006c6906f3a2ee9d5c11"}],"concept.planetmath.orthomodularlattice":[{"id":"assertion.concept.planetmath.orthomodularlattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Orthomodular lattice as stated in the captured PlanetMath entry orthomodularlattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06C15, 81P10, 03G12) states: Orthogonality Relations Let L be an orthocomplemented lattice and a , b ∈ L .","support":[{"end":119,"quote":"Orthogonality Relations\nLet\nL\nbe an\northocomplemented lattice\nand\na\n,\nb\n∈\nL\n.","source_id":"planetmath.orthomodularlattice","source_sha256":"836b7ccb2bceb285d247f45f77cb9148d0e7d63d8606cbd63dddb1d65b82e870","start":42}],"target_id":"concept.planetmath.orthomodularlattice","target_kind":"node","target_sha256":"857005670a9f7290883d8973bfc8f233c0d50a7c321494d14d6a4084a62de68a"}],"concept.planetmath.pa":[{"id":"assertion.concept.planetmath.pa","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"PA as stated in the captured PlanetMath entry pa","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F30) states: (PA) is the restriction of Peano’s axioms to a first order theory of .","support":[{"end":76,"quote":"(PA) is the\nrestriction\nof Peano’s axioms to a\nfirst order theory\nof .","source_id":"planetmath.pa","source_sha256":"02b48a51bdb37ee1cfeea65d22b8b14f1bede7f1dd075de3ee3363077853b253","start":6}],"target_id":"concept.planetmath.pa","target_kind":"node","target_sha256":"bafd3d634860a20646853b79264564759b8acf0cfc00dc3bb924d94abda30154"}],"concept.planetmath.pairingfunction":[{"id":"assertion.concept.planetmath.pairingfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pairing function as stated in the captured PlanetMath entry pairingfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: A pairing function is a function P : ℤ + 2 → ℤ + which establishes a one-to-one correspondence between ℤ + 2 and ℤ + .","support":[{"end":152,"quote":"A\npairing function\nis a\nfunction\nP\n:\nℤ\n+\n2\n→\nℤ\n+\nwhich establishes a\none-to-one correspondence\nbetween\nℤ\n+\n2\nand\nℤ\n+\n.","source_id":"planetmath.pairingfunction","source_sha256":"e8890cacb13d4ccce5373635d19c31df3e281862fbf131bf29838e25660d946a","start":34}],"target_id":"concept.planetmath.pairingfunction","target_kind":"node","target_sha256":"67d7e835079726c5aff824ec7f05e916f3ac8056d6476e03fc7fbfe654d72718"}],"concept.planetmath.pairwisedisjoint":[{"id":"assertion.concept.planetmath.pairwisedisjoint","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pairwise disjoint as stated in the captured PlanetMath entry pairwisedisjoint","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99) states: Definition Suppose { E α ∣ α ∈ I } is an arbitrary collection of sets.","support":[{"end":106,"quote":"Definition\nSuppose\n{\nE\nα\n∣\nα\n∈\nI\n}\nis an arbitrary\ncollection\nof sets.","source_id":"planetmath.pairwisedisjoint","source_sha256":"2148d00716b8c564ed73687b8272cf80173e336bb2f1cca74ad65b8be3b2c06b","start":36}],"target_id":"concept.planetmath.pairwisedisjoint","target_kind":"node","target_sha256":"e24d0b2313468cadb7c30b4eda28b32007a7f436d5fbf305d6a0f9158a956d89"}],"concept.planetmath.paracompacttopologicalspace":[{"id":"assertion.concept.planetmath.paracompacttopologicalspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paracompact topological space as stated in the captured PlanetMath entry paracompacttopologicalspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54-00, 55-00) states: A topological space X is said to be paracompact if every open cover of X has a locally finite open refinement.","support":[{"end":170,"quote":"A\ntopological space\nX\nis said to be\nparacompact\nif every\nopen cover\nof\nX\nhas a\nlocally finite\nopen refinement.","source_id":"planetmath.paracompacttopologicalspace","source_sha256":"b59db3ba7554d55bc70f961ac11985fc02a2a39a75ced840520c4e37c4f70506","start":60}],"target_id":"concept.planetmath.paracompacttopologicalspace","target_kind":"node","target_sha256":"f3d616c7043b7198aea96ea6c5747a05ecd24065720901ef70010d412a783618"}],"concept.planetmath.paradox":[{"id":"assertion.concept.planetmath.paradox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paradox as stated in the captured PlanetMath entry paradox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03A05, 03B99) states: A paradox is an assertion that is apparently self-contradictory, though based on a valid deduction from acceptable premises .","support":[{"end":141,"quote":"A\nparadox\nis an assertion that is apparently self-contradictory, though based on a valid\ndeduction\nfrom acceptable\npremises\n.","source_id":"planetmath.paradox","source_sha256":"54d4574d2901e3fa64595bcd021ca4fa93277befc8898fdbc5237db23285d538","start":16}],"target_id":"concept.planetmath.paradox","target_kind":"node","target_sha256":"07fbe3c3b0ef8249aadaed8dc9bcd5706571c3a477f6bd77292b5c637dfe4f55"}],"concept.planetmath.paradoxofthebinarytree":[{"id":"assertion.concept.planetmath.paradoxofthebinarytree","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Paradox of the binary tree as stated in the captured PlanetMath entry paradoxofthebinarytree","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E75, 03E15) states: The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node.","support":[{"end":230,"quote":"The\ncomplete infinite binary tree\nis a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two\nchildren\nwhich are not children of any other node.","source_id":"planetmath.paradoxofthebinarytree","source_sha256":"d3079b07db1c67c5bad53130ba3dbd891b6ce6d94bc06add9aa074fc4b4319e4","start":54}],"target_id":"concept.planetmath.paradoxofthebinarytree","target_kind":"node","target_sha256":"928bf441c8f321193dd18242ce5c64cc959eaf43222540d8e508304bb69dd300"}],"concept.planetmath.partialalgebraicsystem":[{"id":"assertion.concept.planetmath.partialalgebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partial algebraic system as stated in the captured PlanetMath entry partialalgebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 08A55, 08A62) states: Let λ be a cardinal . A partial function f : A λ → A is called a partial operation on A .","support":[{"end":139,"quote":"Let\nλ\nbe a\ncardinal\n. A\npartial function\nf\n:\nA\nλ\n→\nA\nis called a\npartial operation\non\nA\n.","source_id":"planetmath.partialalgebraicsystem","source_sha256":"d33d86acd322249793de773e7457024968c7a27a218acd1d66bc04fb542b3831","start":50}],"target_id":"concept.planetmath.partialalgebraicsystem","target_kind":"node","target_sha256":"5c84e859b6e026944280fdcf59e0e15aad9f863ceb34a1df78d2f4c9c89cdec8"}],"concept.planetmath.partialderivative":[{"id":"assertion.concept.planetmath.partialderivative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partial derivative as stated in the captured PlanetMath entry partialderivative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B12) states: The partial derivative of a multivariable function f is simply its derivative with respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","support":[{"end":242,"quote":"The\npartial derivative\nof a multivariable function\nf\nis simply its\nderivative\nwith respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","source_id":"planetmath.partialderivative","source_sha256":"ba1f9683b488f9ce08173cdb68aab42b336622be92ac0aa2161477519fa99fa7","start":38}],"target_id":"concept.planetmath.partialderivative","target_kind":"node","target_sha256":"59100b9fb1b5843cc25a64faec2a39a293f992193cb306c348a14a45269272e8"}],"concept.planetmath.partiallyorderedgroup":[{"id":"assertion.concept.planetmath.partiallyorderedgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Partially ordered group as stated in the captured PlanetMath entry partiallyorderedgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06F05, 06F20, 06F15, 20F60) states: A partially ordered group is a group G that is a poset at the same time, such that if a , b ∈ G and a ≤ b , then 1.","support":[{"end":163,"quote":"A\npartially ordered group\nis a group\nG\nthat is a poset at the same time, such that if\na\n,\nb\n∈\nG\nand\na\n≤\nb\n, then\n1.","source_id":"planetmath.partiallyorderedgroup","source_sha256":"cc52d72cc316db86073f8deb7c72a1c8c29773f7ad404558c90737784b9f3dd5","start":48}],"target_id":"concept.planetmath.partiallyorderedgroup","target_kind":"node","target_sha256":"074a60a01af14dd077b702f1626eedc9eb5060f6c33a1763080bd9b0cb262170"}],"concept.planetmath.peanoarithmetic":[{"id":"assertion.concept.planetmath.peanoarithmetic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Peano arithmetic as stated in the captured PlanetMath entry peanoarithmetic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03F30) states: Peano’s axioms are a definition of the set of natural numbers, denoted ℕ .","support":[{"end":108,"quote":"Peano’s axioms\nare a\ndefinition\nof the set of natural numbers, denoted\nℕ\n.","source_id":"planetmath.peanoarithmetic","source_sha256":"94f5c1ab9791a58d7540f70e1d8e35c2996ed43763fce6b6cb1618ceac905c5a","start":34}],"target_id":"concept.planetmath.peanoarithmetic","target_kind":"node","target_sha256":"c019ef5e54be87a0cc8d428b775d75a6b5666381a2b63d963f253354df67669a"}],"concept.planetmath.perfectset":[{"id":"assertion.concept.planetmath.perfectset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Perfect set as stated in the captured PlanetMath entry perfectset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: A set is called perfect if it is equal to the set of its limit points .","support":[{"end":95,"quote":"A set is called\nperfect\nif it is equal to the set of its\nlimit points\n.","source_id":"planetmath.perfectset","source_sha256":"2eb107f0c832928784f0b7c156eea5071c7b829ac1145d23d37cdbe0ac4c24a6","start":24}],"target_id":"concept.planetmath.perfectset","target_kind":"node","target_sha256":"864f38244236dd718374e20cbccca06d4d84d83310bd7a200ad3381a51ccbb1f"}],"concept.planetmath.planetmath":[{"id":"assertion.concept.planetmath.planetmath","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"PlanetMath as stated in the captured PlanetMath entry planetmath","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 01A65, 01A61) states: PlanetMath is a free, collaborative, online mathematics encyclopedia.","support":[{"end":91,"quote":"PlanetMath\nis a free, collaborative, online mathematics encyclopedia.","source_id":"planetmath.planetmath","source_sha256":"b2c4dffd2292a7cce84277da7f21539147a51f7f6668520cbacab1d646e5f922","start":22}],"target_id":"concept.planetmath.planetmath","target_kind":"node","target_sha256":"a9b6ec34351198f9eadd5ee8881edd07313287954d6990db669faec2644b9112"}],"concept.planetmath.pointedset":[{"id":"assertion.concept.planetmath.pointedset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pointed set as stated in the captured PlanetMath entry pointedset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: 0.1 Definition A pointed set is an ordered pair ( A , a ) such that A is a set and a ∈ A .","support":[{"end":114,"quote":"0.1\nDefinition\nA\npointed set\nis an\nordered pair\n(\nA\n,\na\n)\nsuch that\nA\nis a set and\na\n∈\nA\n.","source_id":"planetmath.pointedset","source_sha256":"91fbc7c82b5156cba87e50b517f83ef956ebe94e97e0c68fa1bef76d4c418521","start":24}],"target_id":"concept.planetmath.pointedset","target_kind":"node","target_sha256":"7c26b545f0b9b2adc75b98f3b1577c31172db78b866ccb89ce63eb3a40d699f9"}],"concept.planetmath.pointwise":[{"id":"assertion.concept.planetmath.pointwise","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pointwise as stated in the captured PlanetMath entry pointwise","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 08-00) states: When concepts (properties, operations , etc.) on a set Y are extended to functions f : X ⟶ Y by treating each function value f ⁢ ( x ) in isolation, the extended concept is often qualified with the word pointwise .","support":[{"end":234,"quote":"When\nconcepts\n(properties,\noperations\n, etc.) on a set\nY\nare extended to\nfunctions\nf\n:\nX\n⟶\nY\nby treating each\nfunction value\nf\n⁢\n(\nx\n)\nin isolation, the\nextended concept is often qualified with the word\npointwise\n.","source_id":"planetmath.pointwise","source_sha256":"2789971a3ea6b51e63f907b0317bf4e90e5343ac3711b8d68f5b89789e02a372","start":20}],"target_id":"concept.planetmath.pointwise","target_kind":"node","target_sha256":"9ec64eec502c1e9a42fb96beda24bad3530c24c82279ff5b3b9916536ce23052"}],"concept.planetmath.polishnotation":[{"id":"assertion.concept.planetmath.polishnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polish notation as stated in the captured PlanetMath entry polishnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","support":[{"end":324,"quote":"Whereas\noperators\nare traditionally placed between operands, with parentheses used to override\noperator precedence\n, it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","source_id":"planetmath.polishnotation","source_sha256":"b1ba8fabe09877ddf6ca72e689716c33e15da857e7788659f434b6a8e3697d79","start":32}],"target_id":"concept.planetmath.polishnotation","target_kind":"node","target_sha256":"19ee969189f4866e4663c58209b0b91c24aef6d18f086e9f540cf6813331c578"}],"concept.planetmath.polyadicalgebra":[{"id":"assertion.concept.planetmath.polyadicalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polyadic algebra as stated in the captured PlanetMath entry polyadicalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: A polyadic algebra is a quadruple ( B , V , ∃ , S ) , where ( B , V , ∃ ) is a quantifier algebra , and S is a function from the set of functions on V to the set of endomorphisms on the Boolean algebra B , in other words S : V V → End ⁡ ( B ) such that 1.","support":[{"end":289,"quote":"A\npolyadic algebra\nis a quadruple\n(\nB\n,\nV\n,\n∃\n,\nS\n)\n, where\n(\nB\n,\nV\n,\n∃\n)\nis a\nquantifier algebra\n, and\nS\nis a\nfunction\nfrom the set of functions on\nV\nto the set of\nendomorphisms\non the\nBoolean algebra\nB\n, in other words\nS\n:\nV\nV\n→\nEnd\n⁡\n(\nB\n)\nsuch that\n1.","source_id":"planetmath.polyadicalgebra","source_sha256":"abccf25124c0ceed1c3f84ee5ab600a9e10dfebe0cd9301858bff74636627b6a","start":34}],"target_id":"concept.planetmath.polyadicalgebra","target_kind":"node","target_sha256":"3f1c30dd695c0882021c1a0427e922446e3f3e64bda9bcc9b8f5eb5dcc939965"}],"concept.planetmath.polyadicalgebrawithequality":[{"id":"assertion.concept.planetmath.polyadicalgebrawithequality","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polyadic algebra with equality as stated in the captured PlanetMath entry polyadicalgebrawithequality","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: Let A = ( B , V , ∃ , S ) be a polyadic algebra . An equality predicate on A is a function E : V × V → B such that 1.","support":[{"end":179,"quote":"Let\nA\n=\n(\nB\n,\nV\n,\n∃\n,\nS\n)\nbe a\npolyadic algebra\n. An\nequality predicate\non\nA\nis a\nfunction\nE\n:\nV\n×\nV\n→\nB\nsuch that\n1.","source_id":"planetmath.polyadicalgebrawithequality","source_sha256":"eccaed36205cd36e5f9db78b9624289e49a49df792ef97ee650a0b519e66c2f2","start":62}],"target_id":"concept.planetmath.polyadicalgebrawithequality","target_kind":"node","target_sha256":"fa79f264e625f3328cf099ade91b09e9f046ff31dfbc09e9f795b4ad757af515"}],"concept.planetmath.polynomialring":[{"id":"assertion.concept.planetmath.polynomialring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomial ring as stated in the captured PlanetMath entry polynomialring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11C08, 12E05, 13P05, 17B66, 16W10, 70G65, 17B45) states: 1 Polynomial rings in one variable Let R be a ring.","support":[{"end":83,"quote":"1\nPolynomial rings in one variable\nLet\nR\nbe a ring.","source_id":"planetmath.polynomialring","source_sha256":"a26ae44f4e2950749a1fea104b43894dbd401d565b7ceff2231b31a19188b119","start":32}],"target_id":"concept.planetmath.polynomialring","target_kind":"node","target_sha256":"4970371625279e5d384c8051c2ac9bbe5e0b6e9a66b162e98bedbf43867ef5e1"}],"concept.planetmath.polynomialsinalgebraicsystems":[{"id":"assertion.concept.planetmath.polynomialsinalgebraicsystems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomials in algebraic systems as stated in the captured PlanetMath entry polynomialsinalgebraicsystems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A40) states: Polynomials in an Algebraic System Let ( A , O ) be an algebraic system .","support":[{"end":139,"quote":"Polynomials in an Algebraic System\nLet\n(\nA\n,\nO\n)\nbe an\nalgebraic system\n.","source_id":"planetmath.polynomialsinalgebraicsystems","source_sha256":"466128359387d7760884a0de1b18d318b3fc102685710fd165865a0277bcc4a8","start":66}],"target_id":"concept.planetmath.polynomialsinalgebraicsystems","target_kind":"node","target_sha256":"77314d261711f77557fcebfc4baddf136d1e9a0a2aa052cc1f518ab4a3beaa30"}],"concept.planetmath.positiveelement":[{"id":"assertion.concept.planetmath.positiveelement","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Positive element as stated in the captured PlanetMath entry positiveelement","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46L05, 47L07, 47A05) states: Let H be a complex Hilbert space . Let T : H ⟶ H be a bounded operator in H .","support":[{"end":111,"quote":"Let\nH\nbe a complex\nHilbert space\n. Let\nT\n:\nH\n⟶\nH\nbe a\nbounded operator\nin\nH\n.","source_id":"planetmath.positiveelement","source_sha256":"5691384f085f9536e49d7ba6539028cf29aef4d4ecf64b6f1e65be4781f8cb27","start":34}],"target_id":"concept.planetmath.positiveelement","target_kind":"node","target_sha256":"2f9f731be8b75cf74284260b97a28acc95c980bdb1cc4c044f096077b07f3c28"}],"concept.planetmath.postsystem":[{"id":"assertion.concept.planetmath.postsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Post system as stated in the captured PlanetMath entry postsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q42, 03D03) states: Introduction A Post canonical system (or Post system for short) 𝔓 is a triple ( Σ , X , P ) , such that 1.","support":[{"end":130,"quote":"Introduction\nA\nPost canonical system\n(or\nPost system\nfor short)\n𝔓\nis a triple\n(\nΣ\n,\nX\n,\nP\n)\n, such that\n1.","source_id":"planetmath.postsystem","source_sha256":"4bf669681f3ab4d24a77f7ffaf83e3d6bba8064936f073bcc57c1d918cca272e","start":24}],"target_id":"concept.planetmath.postsystem","target_kind":"node","target_sha256":"51b1a24f94352c9283b24b142b70b22b6b6800697579102aaab226ebfea2b078"}],"concept.planetmath.powerset":[{"id":"assertion.concept.planetmath.powerset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Power set as stated in the captured PlanetMath entry powerset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E99, 03E10, 37-01) states: Definition If X is a set, then the power set of X , denoted by 𝒫 ⁢ ( X ) , is the set whose elements are the subsets of X .","support":[{"end":143,"quote":"Definition\nIf\nX\nis a set, then the\npower set\nof\nX\n, denoted by\n𝒫\n⁢\n(\nX\n)\n, is the\nset whose\nelements\nare the subsets of\nX\n.","source_id":"planetmath.powerset","source_sha256":"b9c2fcc6295830e69b18088ebcf5ba30512c5b43d20c4c9e9071e9fe528b9eb6","start":20}],"target_id":"concept.planetmath.powerset","target_kind":"node","target_sha256":"4b4955b02881c5d2f34b4ef9bc1d12068a8a00d20021dec92fe85fcec2466898"}],"concept.planetmath.predicativism":[{"id":"assertion.concept.planetmath.predicativism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Predicativism as stated in the captured PlanetMath entry predicativism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03-01, 03A05) states: Predicativism Contents: 1 Initial definitions 2 The vicious circle principle 3 The scope of the vicious circle principle 4 Russell’s threefold formulation in Principia mathematica 5 Predicative reasoning in the ramified theory of types 6 Towards the predicative concept of set 7 Predicative philosophy of mathematics 1 Initial definitions In the literature on the foundations of mathematics the range of the concept predicativism is formulated in two divergent formulations.","support":[{"end":502,"quote":"Predicativism\nContents:\n1\nInitial definitions\n2\nThe vicious circle principle\n3\nThe scope of the vicious circle principle\n4\nRussell’s threefold formulation in\nPrincipia mathematica\n5\nPredicative reasoning in the ramified theory of types\n6\nTowards the predicative concept of set\n7\nPredicative philosophy of mathematics\n1\nInitial definitions\nIn the literature on the\nfoundations of mathematics\nthe range of the\nconcept\npredicativism is formulated in two divergent formulations.","source_id":"planetmath.predicativism","source_sha256":"aa3a9a0ffa8e5ba8a34a3108a642ec301952b02cba87fbf9ea3f0a980e5caf86","start":28}],"target_id":"concept.planetmath.predicativism","target_kind":"node","target_sha256":"e926b32f8021d947035a5640196e967be9b74197943e12368e6da90a346d9ddf"}],"concept.planetmath.preorder":[{"id":"assertion.concept.planetmath.preorder","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pre-order as stated in the captured PlanetMath entry preorder","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06A99) states: Definition A pre-order on a set S is a relation ≲ on S satisfying the following two axioms: reflexivity : s ≲ s for all s ∈ S , and transitivity : If s ≲ t and t ≲ u , then s ≲ u ; for all s , t , u ∈ S .","support":[{"end":224,"quote":"Definition\nA\npre-order\non a set\nS\nis a\nrelation\n≲\non\nS\nsatisfying the following two axioms:\nreflexivity\n:\ns\n≲\ns\nfor all\ns\n∈\nS\n, and\ntransitivity\n: If\ns\n≲\nt\nand\nt\n≲\nu\n, then\ns\n≲\nu\n; for all\ns\n,\nt\n,\nu\n∈\nS\n.","source_id":"planetmath.preorder","source_sha256":"8c9d4341312a608fa261f3bc23182ae7ac043e23b0ae4579a559aca7541388b2","start":20}],"target_id":"concept.planetmath.preorder","target_kind":"node","target_sha256":"a149426016669cb15950e8afec4045838c323c5e04eaa7eea449db2d13ad168d"}],"concept.planetmath.presentationofagroup":[{"id":"assertion.concept.planetmath.presentationofagroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Presentation of a group as stated in the captured PlanetMath entry presentationofagroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05, 20F05) states: A presentation of a group G is a description of G in terms of generators and relations (sometimes also known as relators).","support":[{"end":170,"quote":"A\npresentation\nof a group\nG\nis a description of\nG\nin terms of\ngenerators and relations (sometimes also known as relators).","source_id":"planetmath.presentationofagroup","source_sha256":"62df8c310671bfad772a713449a6a6d48d4ea5711d6a167f3a66b8294bc1b187","start":48}],"target_id":"concept.planetmath.presentationofagroup","target_kind":"node","target_sha256":"8a7d4012e827dec821347a7a5de1ae0634d441b5f37f8d27b16d48693363f18c"}],"concept.planetmath.preservationandreflection":[{"id":"assertion.concept.planetmath.preservationandreflection","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Preservation and reflection as stated in the captured PlanetMath entry preservationandreflection","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A35) states: In mathematics, the word “preserve” usually means the “preservation of properties”.","support":[{"end":139,"quote":"In mathematics, the word “preserve” usually means the “preservation of properties”.","source_id":"planetmath.preservationandreflection","source_sha256":"04d427176a71b0e52368b5de3da2000a9f5658e9b1dd2e8742868d8696243608","start":56}],"target_id":"concept.planetmath.preservationandreflection","target_kind":"node","target_sha256":"26c6cc55c714532c7d59fd4f2ace60f1e671cd0123ef1d81345905dd7c3c0c6a"}],"concept.planetmath.primitiverecursivefunction":[{"id":"assertion.concept.planetmath.primitiverecursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Primitive recursive function as stated in the captured PlanetMath entry primitiverecursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: To define what a primitive recursive function is, the following notations are used: ℱ = ⋃ { F k ∣ k ∈ ℕ } , where for each k ∈ ℕ ⁢ , ⁢ F k = { f ∣ f : ℕ k → ℕ } .","support":[{"end":220,"quote":"To define what a\nprimitive recursive function\nis, the following notations are used:\nℱ\n=\n⋃\n{\nF\nk\n∣\nk\n∈\nℕ\n}\n, where for each\nk\n∈\nℕ\n⁢\n,\n⁢\nF\nk\n=\n{\nf\n∣\nf\n:\nℕ\nk\n→\nℕ\n}\n.","source_id":"planetmath.primitiverecursivefunction","source_sha256":"8df37f9e3b01dafaa1f640bf9299ca8bba29db9360462cefcc9e6e26535b8089","start":58}],"target_id":"concept.planetmath.primitiverecursivefunction","target_kind":"node","target_sha256":"e80e4dce4512a9395495a9e21db3520ffdfa37893a15c6a90e21ddc28b71cba2"}],"concept.planetmath.principalideal":[{"id":"assertion.concept.planetmath.principalideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Principal ideal as stated in the captured PlanetMath entry principalideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13A15, 16D25, 81-00, 82-00, 83-00, 46L05) states: Let R be a ring and let a ∈ R . The principal left (resp.","support":[{"end":89,"quote":"Let\nR\nbe a ring and let\na\n∈\nR\n. The principal left (resp.","source_id":"planetmath.principalideal","source_sha256":"e195a825dc98a566ddb7f5d639a089f2f55f5cb612a057bee12af9f19190f593","start":32}],"target_id":"concept.planetmath.principalideal","target_kind":"node","target_sha256":"633b9b1852370f9da7de1602b0675c1eccd928fb991859072a9a6996026e8480"}],"concept.planetmath.probabilitydistributionfunction":[{"id":"assertion.concept.planetmath.probabilitydistributionfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Probability distribution function as stated in the captured PlanetMath entry probabilitydistributionfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 60E99) states: 1 Definition Let ( Ω , 𝔅 , μ ) be a measure space . A probability distribution function on Ω is a function f : Ω ⟶ ℝ such that: 1.","support":[{"end":198,"quote":"1\nDefinition\nLet\n(\nΩ\n,\n𝔅\n,\nμ\n)\nbe a\nmeasure space\n. A\nprobability distribution function\non\nΩ\nis a\nfunction\nf\n:\nΩ\n⟶\nℝ\nsuch that:\n1.","source_id":"planetmath.probabilitydistributionfunction","source_sha256":"67167dcda862d39465debfeafbd06bc850366e1dfb6bd69f93c530c72e3bf9d3","start":68}],"target_id":"concept.planetmath.probabilitydistributionfunction","target_kind":"node","target_sha256":"2d04d07fe37da44c656b87e37107d9c48f6e5bf283460e6093f33888676426e2"}],"concept.planetmath.producttopology":[{"id":"assertion.concept.planetmath.producttopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Product topology as stated in the captured PlanetMath entry producttopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B10) states: Definition Let ( ( X α , 𝒯 α ) ) α ∈ A be a family of topological spaces , and let Y be the Cartesian product ( http://planetmath.org/GeneralizedCartesianProduct ) of the sets X α , that is Y = ∏ α ∈ A X α .","support":[{"end":241,"quote":"Definition\nLet\n(\n(\nX\nα\n,\n𝒯\nα\n)\n)\nα\n∈\nA\nbe a family of\ntopological spaces\n, and let\nY\nbe the\nCartesian product\n(\nhttp://planetmath.org/GeneralizedCartesianProduct\n)\nof the sets\nX\nα\n, that is\nY\n=\n∏\nα\n∈\nA\nX\nα\n.","source_id":"planetmath.producttopology","source_sha256":"ab4c3d6939ed8c0e230b8f656e2a45050f96b0ee16f74d5768d3e4d8e0708dc4","start":34}],"target_id":"concept.planetmath.producttopology","target_kind":"node","target_sha256":"b5b59617b9c8a28d5a73d75171b46340a36b81733eafeb437ddc47ec8706e20f"}],"concept.planetmath.projectivebasis":[{"id":"assertion.concept.planetmath.projectivebasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Projective basis as stated in the captured PlanetMath entry projectivebasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: In the parent entry, we see how one may define dimension of a projective space inductively, from its subspaces starting with a point, then a line, and working its way up.","support":[{"end":204,"quote":"In the parent entry, we see how one may define\ndimension\nof a projective space inductively, from its\nsubspaces\nstarting with a point, then a line, and working its way up.","source_id":"planetmath.projectivebasis","source_sha256":"5fc35d3835c2e83c9987a8826d291fc834e574440feef0a840407a1090d59ace","start":34}],"target_id":"concept.planetmath.projectivebasis","target_kind":"node","target_sha256":"64aeb42e87e2bfb8304e4b4a44d490fa29893d106b80ef3df7199d37fb2d9bcb"}],"concept.planetmath.propositionalcalculus":[{"id":"assertion.concept.planetmath.propositionalcalculus","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Propositional calculus as stated in the captured PlanetMath entry propositionalcalculus","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03, 03C05, 03B22, 03B05) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase angle \\PMlinkescapephrase Angle \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase complete \\PMlinkescapephrase Complete \\PMlinkescapephrase component \\PMlinkescapephrase Component \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formalism \\PMlinkescapephrase Formalism \\PMlinkescapephrase holder \\PMlinkescapephrase Holder \\PMlinkescapephrase holders \\PMlinkescapephrase Holders \\PMlinkescapephrase origin \\PMlinkescapephrase Origin \\PMlinkescapephrase plus \\PMlinkescapephrase Plus \\PMlinkescapephrase point \\PMlinkescapephrase Point \\PMlinkescapephrase points \\PMlinkescapephrase Points \\PMlinkescapephrase right \\PMlinkescapephrase Right \\PMlinkescapephrase utility \\PMlinkescapephrase Utility A propositional calculus is a formal system whose expressions represent formal objects known as propositions and whose distinguished relations among expressions represent existing relations among propositions.","support":[{"end":1081,"quote":"\\PMlinkescapephrase\nadapted\n\\PMlinkescapephrase\nAdapted\n\\PMlinkescapephrase\nangle\n\\PMlinkescapephrase\nAngle\n\\PMlinkescapephrase\ncalculus\n\\PMlinkescapephrase\nCalculus\n\\PMlinkescapephrase\ncomplete\n\\PMlinkescapephrase\nComplete\n\\PMlinkescapephrase\ncomponent\n\\PMlinkescapephrase\nComponent\n\\PMlinkescapephrase\ndegree\n\\PMlinkescapephrase\nDegree\n\\PMlinkescapephrase\nformalism\n\\PMlinkescapephrase\nFormalism\n\\PMlinkescapephrase\nholder\n\\PMlinkescapephrase\nHolder\n\\PMlinkescapephrase\nholders\n\\PMlinkescapephrase\nHolders\n\\PMlinkescapephrase\norigin\n\\PMlinkescapephrase\nOrigin\n\\PMlinkescapephrase\nplus\n\\PMlinkescapephrase\nPlus\n\\PMlinkescapephrase\npoint\n\\PMlinkescapephrase\nPoint\n\\PMlinkescapephrase\npoints\n\\PMlinkescapephrase\nPoints\n\\PMlinkescapephrase\nright\n\\PMlinkescapephrase\nRight\n\\PMlinkescapephrase\nutility\n\\PMlinkescapephrase\nUtility\nA\npropositional calculus\nis a\nformal system\nwhose expressions\nrepresent\nformal objects\nknown as\npropositions\nand whose distinguished\nrelations\namong expressions represent existing relations among propositions.","source_id":"planetmath.propositionalcalculus","source_sha256":"91026f8fd674efb0838cc9384d5bd5113f4b0795413a1a7ed976288a72435c21","start":46}],"target_id":"concept.planetmath.propositionalcalculus","target_kind":"node","target_sha256":"096c1f22fc27e6f9d7cd78cdb138b433060f57bfed385b274b022f934c5bfd06"}],"concept.planetmath.propositionallogic":[{"id":"assertion.concept.planetmath.propositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Propositional logic as stated in the captured PlanetMath entry propositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A propositional logic is a logic in which the only objects are propositions , that is, objects which themselves have truth values.","support":[{"end":170,"quote":"A\npropositional logic\nis a logic in which the only objects are\npropositions\n, that is, objects which themselves have truth values.","source_id":"planetmath.propositionallogic","source_sha256":"b0c50eb2314d7a3c9323d24cc306ceca8835f819862c358ab36812ce256f395c","start":40}],"target_id":"concept.planetmath.propositionallogic","target_kind":"node","target_sha256":"4dc9b019fb86ca8d27108ed998dae02247e5db8a51482180d1035c0e34c94608"}],"concept.planetmath.pseudograph":[{"id":"assertion.concept.planetmath.pseudograph","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pseudograph as stated in the captured PlanetMath entry pseudograph","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C75) states: A pseudograph is a graph that allows both parallel edges and loops.","support":[{"end":91,"quote":"A\npseudograph\nis a graph that allows both\nparallel edges\nand loops.","source_id":"planetmath.pseudograph","source_sha256":"a40f3cd7fee17b743549d7858b8d7ca0cc2ce578af7cd090df065b89805d6039","start":24}],"target_id":"concept.planetmath.pseudograph","target_kind":"node","target_sha256":"4e734c597f6b196933d98f3528bba348595a76acdd29c8e8e332997dfa56287a"}],"concept.planetmath.pseudometrictopology":[{"id":"assertion.concept.planetmath.pseudometrictopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Pseudometric topology as stated in the captured PlanetMath entry pseudometrictopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Let ( X , d ) be a pseudometric space . As in a metric space , we define B ε ⁢ ( x ) = { y ∈ X ∣ d ⁢ ( x , y ) < ε } .","support":[{"end":162,"quote":"Let\n(\nX\n,\nd\n)\nbe a\npseudometric space\n. As in a\nmetric space\n, we define\nB\nε\n⁢\n(\nx\n)\n=\n{\ny\n∈\nX\n∣\nd\n⁢\n(\nx\n,\ny\n)\n<\nε\n}\n.","source_id":"planetmath.pseudometrictopology","source_sha256":"46dde0635840cd0b75c3ffdc32916ac9c3c678eb211421cad66a70735d3be428","start":44}],"target_id":"concept.planetmath.pseudometrictopology","target_kind":"node","target_sha256":"d99524e62c93d5adc99743b22c3ee1fe7b650dbc0f16e502e086e0a893a5ed60"}],"concept.planetmath.quantifier":[{"id":"assertion.concept.planetmath.quantifier","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantifier as stated in the captured PlanetMath entry quantifier","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Introduction A quantifier is a logical symbol which makes an assertion about the set of values which make one or more formulas true.","support":[{"end":154,"quote":"Introduction\nA\nquantifier\nis a\nlogical symbol\nwhich makes an assertion about the set of values which make one or more\nformulas\ntrue.","source_id":"planetmath.quantifier","source_sha256":"91d93149420c9b74764dd39d88023fc9495ef5692c0ee40653b32e6e17d53398","start":22}],"target_id":"concept.planetmath.quantifier","target_kind":"node","target_sha256":"21a4963dd0d358700d14b4f0cd0e5769ee08b913634065146ecfad26d5206f83"}],"concept.planetmath.quantifierfree":[{"id":"assertion.concept.planetmath.quantifierfree","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantifier free as stated in the captured PlanetMath entry quantifierfree","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C10, 03C07, 03B10) states: Let L be a first order language . A formula ψ is quantifier free iff it contains no quantifiers .","support":[{"end":129,"quote":"Let\nL\nbe a\nfirst order language\n.\nA\nformula\nψ\nis\nquantifier free\niff it contains no\nquantifiers\n.","source_id":"planetmath.quantifierfree","source_sha256":"7fb57f9f2c1d368cb6d7044aaa9bc84019841b68339570de848c0103ded8be08","start":32}],"target_id":"concept.planetmath.quantifierfree","target_kind":"node","target_sha256":"62ac8f2f58bdfd5461cbdbf0dd8708e055f9f7a2234de1eef5dbc83e77f657dd"}],"concept.planetmath.quantumfieldtheoriesqft":[{"id":"assertion.concept.planetmath.quantumfieldtheoriesqft","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantum field theories (QFT) as stated in the captured PlanetMath entry quantumfieldtheoriesqft","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 55U99, 81T80, 81T75, 81T70, 81T60, 81T40, 81T25, 81T18, 81T13, 81T10, 81T05) states: This topic links the general framework of quantum field theories to group symmetries and other relevant mathematical concepts utilized to represent quantum fields and their fundamental properties.","support":[{"end":254,"quote":"This topic links the general framework of\nquantum field theories\nto group\nsymmetries\nand other relevant mathematical concepts utilized to\nrepresent\nquantum fields\nand their fundamental properties.","source_id":"planetmath.quantumfieldtheoriesqft","source_sha256":"d0aab612d8a423d83af13cebb70a1b736af3bd05baaa88043e2cd830a43a4dae","start":58}],"target_id":"concept.planetmath.quantumfieldtheoriesqft","target_kind":"node","target_sha256":"1a28f18ee0dabdb45a3df9b763d374305e372eb9283007a47040a5d432a69b43"}],"concept.planetmath.quantumlogic":[{"id":"assertion.concept.planetmath.quantumlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quantum logic as stated in the captured PlanetMath entry quantumlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G12) states: Introduction In classical physics, results regarding experiments performed on physical propositions obey classical propositional logic .","support":[{"end":164,"quote":"Introduction\nIn classical physics, results regarding experiments performed on physical\npropositions\nobey classical\npropositional logic\n.","source_id":"planetmath.quantumlogic","source_sha256":"d92afdcdda38e1833789fd7466c2e4def043cc1c000c8caf9a7b49dc15be9107","start":28}],"target_id":"concept.planetmath.quantumlogic","target_kind":"node","target_sha256":"280902180cf48a180969fe6c60649b9b06e54ccacb9080418bb08bab6ddf9970"}],"concept.planetmath.quotientgroup":[{"id":"assertion.concept.planetmath.quotientgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient group as stated in the captured PlanetMath entry quotientgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20-00) states: Before defining quotient groups , some preliminary definitions must be introduced and a few established.","support":[{"end":135,"quote":"Before defining\nquotient groups\n, some preliminary\ndefinitions\nmust be introduced and a few  established.","source_id":"planetmath.quotientgroup","source_sha256":"2947b52ab0e622c2df844cbfe4400e233f5ff072d30abf64da6c060628e58a1f","start":30}],"target_id":"concept.planetmath.quotientgroup","target_kind":"node","target_sha256":"dc6cad6906cc55dc307816bc7df3a2259b7b5b0ef23c09fe27f191741a5dea8c"}],"concept.planetmath.quotientstructure":[{"id":"assertion.concept.planetmath.quotientstructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient structure as stated in the captured PlanetMath entry quotientstructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , 𝔄 a structure for Σ , and ∼ a congruence on 𝔄 .","support":[{"end":114,"quote":"Let\nΣ\nbe a fixed\nsignature\n,\n𝔄\na\nstructure\nfor\nΣ\n, and\n∼\na\ncongruence\non\n𝔄\n.","source_id":"planetmath.quotientstructure","source_sha256":"412058c68496b2bf96e6d2146feb6709e383df12a27f633b3aabe54026a72f0c","start":38}],"target_id":"concept.planetmath.quotientstructure","target_kind":"node","target_sha256":"86a76672608ab631e33d19ada6cffa5138dfc49d522f3678fae919101bfa39cb"}],"concept.planetmath.radicalofanideal":[{"id":"assertion.concept.planetmath.radicalofanideal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Radical of an ideal as stated in the captured PlanetMath entry radicalofanideal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 14A05, 16N40, 13-00) states: Let R be a commutative ring . For any ideal I of R , the radical of I , written I or Rad ⁡ ( I ) , is the set { a ∈ R ⁢ ∣ a n ∈ I ⁢ for some integer ⁢ n > ⁢ 0 } The radical of an ideal I is always an ideal of R .","support":[{"end":252,"quote":"Let\nR\nbe a\ncommutative ring\n. For any ideal\nI\nof\nR\n, the\nradical\nof\nI\n, written\nI\nor\nRad\n⁡\n(\nI\n)\n, is the set\n{\na\n∈\nR\n⁢\n∣\na\nn\n∈\nI\n⁢\nfor some integer\n⁢\nn\n>\n⁢\n0\n}\nThe radical of an ideal\nI\nis always an ideal of\nR\n.","source_id":"planetmath.radicalofanideal","source_sha256":"ab02bfdae98fe03765df41e4848d7598ece1167f165d24399c7f5c94a9f5c6f0","start":40}],"target_id":"concept.planetmath.radicalofanideal","target_kind":"node","target_sha256":"edab7fb8ca8b3a0f88fa368e32638f39ca136bb6badd69b89030c68c485354b8"}],"concept.planetmath.radicalofaninteger":[{"id":"assertion.concept.planetmath.radicalofaninteger","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Radical of an integer as stated in the captured PlanetMath entry radicalofaninteger","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13A10, 81-00, 18-00) states: Given a natural number n , let n = p 1 α 1 ⁢ ⋯ ⁢ p k α k be its unique factorization as a product of distinct prime powers.","support":[{"end":167,"quote":"Given a\nnatural number\nn\n, let\nn\n=\np\n1\nα\n1\n⁢\n⋯\n⁢\np\nk\nα\nk\nbe its\nunique factorization\nas a\nproduct\nof distinct prime powers.","source_id":"planetmath.radicalofaninteger","source_sha256":"24125b4e020f828a1d948d0e621f6ea1ea73bab981f689aaa5397646f2e7bc45","start":44}],"target_id":"concept.planetmath.radicalofaninteger","target_kind":"node","target_sha256":"6593d99c6fa2f66bce65ef00e219a8071ed4c659d3006dfbf7b93fd019309084"}],"concept.planetmath.randomvariable":[{"id":"assertion.concept.planetmath.randomvariable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Random variable as stated in the captured PlanetMath entry randomvariable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 62-00, 60-00, 11R32, 03-01, 20B25) states: If ( Ω , 𝒜 , P ) is a probability space , then a random variable on Ω is a measurable function X : ( Ω , 𝒜 ) → S to a measurable space S (frequently taken to be the real numbers with the standard measure ).","support":[{"end":238,"quote":"If\n(\nΩ\n,\n𝒜\n,\nP\n)\nis a\nprobability space\n, then a\nrandom variable\non\nΩ\nis a\nmeasurable function\nX\n:\n(\nΩ\n,\n𝒜\n)\n→\nS\nto a\nmeasurable space\nS\n(frequently taken to be the\nreal numbers\nwith the standard\nmeasure\n).","source_id":"planetmath.randomvariable","source_sha256":"3607482598b38d1f7da8e4d1b1bfaf4e2e80fc39ae76fd2f1d4aafb89fa893b1","start":32}],"target_id":"concept.planetmath.randomvariable","target_kind":"node","target_sha256":"bf6687214dc121552667b325ffd2e23fcb467efdd8528cc417e793f17f91e282"}],"concept.planetmath.rationalnumber":[{"id":"assertion.concept.planetmath.rationalnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rational number as stated in the captured PlanetMath entry rationalnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B30, 11A99, 03E99) states: The rational numbers ℚ are the fraction field of the ring ℤ of integers .","support":[{"end":105,"quote":"The\nrational numbers\nℚ\nare the\nfraction field\nof the ring\nℤ\nof\nintegers\n.","source_id":"planetmath.rationalnumber","source_sha256":"7d97345536d8221e3b74fa29d767612adbacd55d0b6502fe0f91440f1030d27d","start":32}],"target_id":"concept.planetmath.rationalnumber","target_kind":"node","target_sha256":"f1c4b73dd3f46f4e752226e96cb0c57931cfe2bd3ef34d9d5a0d18aa08d4076d"}],"concept.planetmath.realnumber":[{"id":"assertion.concept.planetmath.realnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Real number as stated in the captured PlanetMath entry realnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54C30, 26-00, 12D99) states: 1 Definition There are several equivalent definitions of real number , all in common use.","support":[{"end":113,"quote":"1\nDefinition\nThere are several\nequivalent\ndefinitions\nof\nreal number\n, all in common use.","source_id":"planetmath.realnumber","source_sha256":"f3e804bd8552da2fc734b565599cfc54947592bfaf29de479f2991df1b141db5","start":24}],"target_id":"concept.planetmath.realnumber","target_kind":"node","target_sha256":"319001b8b5455744230e1cea8cf99f4f9820363a941bf00dc63a7ed8a5aa6095"}],"concept.planetmath.recursivefunction":[{"id":"assertion.concept.planetmath.recursivefunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursive function as stated in the captured PlanetMath entry recursivefunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D20) states: Intuitively, a recursive function is a positive integer valued function of one or more positive integer arguments which may be computed by a definite algorithm .","support":[{"end":199,"quote":"Intuitively, a\nrecursive function\nis a\npositive integer\nvalued\nfunction\nof one or more positive integer\narguments\nwhich may be computed by a definite\nalgorithm\n.","source_id":"planetmath.recursivefunction","source_sha256":"b3ed8b62365e338cabd706d0c3566d4da304c7579e4c83dc831d200b040ab2fd","start":38}],"target_id":"concept.planetmath.recursivefunction","target_kind":"node","target_sha256":"65488868b08eec609516861144e8fc1bd53c3c78ae77d346d7b2396cebebbf29"}],"concept.planetmath.recursivelyenumerable":[{"id":"assertion.concept.planetmath.recursivelyenumerable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursively enumerable as stated in the captured PlanetMath entry recursivelyenumerable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D25) states: For a language L , TFAE: • There exists a Turing machine f such that ∀ x .","support":[{"end":120,"quote":"For a\nlanguage\nL\n, TFAE:\n•\nThere exists a\nTuring machine\nf\nsuch that\n∀\nx\n.","source_id":"planetmath.recursivelyenumerable","source_sha256":"bbe1095bf2b68731c0a9b30cd9fc970f947d65fe429ecdca679178d5f41f570f","start":46}],"target_id":"concept.planetmath.recursivelyenumerable","target_kind":"node","target_sha256":"33dabd716e5486e1a13c743ef40af0cd6fe011d1c203134437f299745a490f41"}],"concept.planetmath.recursiveset":[{"id":"assertion.concept.planetmath.recursiveset","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Recursive set as stated in the captured PlanetMath entry recursiveset","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B25, 03D20) states: A subset S of the natural numbers ℕ is said to be recursive if its characteristic function χ S ⁢ ( x ) := { 1 if ⁢ x ∈ S 0 if ⁢ x ∈ ℕ - S is recursive ( computable ).","support":[{"end":194,"quote":"A subset\nS\nof the\nnatural numbers\nℕ\nis said to be\nrecursive\nif its\ncharacteristic function\nχ\nS\n⁢\n(\nx\n)\n:=\n{\n1\nif\n⁢\nx\n∈\nS\n0\nif\n⁢\nx\n∈\nℕ\n-\nS\nis recursive (\ncomputable\n).","source_id":"planetmath.recursiveset","source_sha256":"5962d4ba1f0f1012dc5f9523a712f18ebd4ff0e44b3ffbe007afd0fdaf46a958","start":28}],"target_id":"concept.planetmath.recursiveset","target_kind":"node","target_sha256":"5b8e11e2c510d78819f30afedac53970cc2cf73615f13bec661fbd86cc2e6deb"}],"concept.planetmath.reducedautomaton":[{"id":"assertion.concept.planetmath.reducedautomaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reduced automaton as stated in the captured PlanetMath entry reducedautomaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an automaton ? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","support":[{"end":311,"quote":"Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an\nautomaton\n? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","source_id":"planetmath.reducedautomaton","source_sha256":"834db70d8fe410730de7292083496ab7ac4181909a6602489f514f0cd9e38231","start":36}],"target_id":"concept.planetmath.reducedautomaton","target_kind":"node","target_sha256":"c527fe7b6293210f7e892e5bb49727f25f85b2e7dc9f0414a6a561e6b69bbb04"}],"concept.planetmath.reductioadabsurdum":[{"id":"assertion.concept.planetmath.reductioadabsurdum","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reductio ad absurdum as stated in the captured PlanetMath entry reductioadabsurdum","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-01) states: Reductio ad Absurdum is a process of inference by means of which one can derive a proposition ¬ ⁢ X from the fact the the assumption of X leads to a contradiction .","support":[{"end":206,"quote":"Reductio ad Absurdum\nis a process of inference by means of which one can derive a\nproposition\n¬\n⁢\nX\nfrom the fact the the\nassumption\nof\nX\nleads to a\ncontradiction\n.","source_id":"planetmath.reductioadabsurdum","source_sha256":"3b13033c5b0f07e1402292d8d993129ed1d0c14c46fb4f9309033b495650c3b0","start":42}],"target_id":"concept.planetmath.reductioadabsurdum","target_kind":"node","target_sha256":"a5e8af34ffa80e802bf900f77a24215b6dd65af69623ec933577ac1ff2a103f2"}],"concept.planetmath.reflexiverelation":[{"id":"assertion.concept.planetmath.reflexiverelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reflexive relation as stated in the captured PlanetMath entry reflexiverelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is reflexive if and only if a ⁢ ℛ ⁢ a for all a ∈ A .","support":[{"end":115,"quote":"A\nrelation\nℛ\non a set\nA\nis\nreflexive\nif and only if\na\n⁢\nℛ\n⁢\na\nfor all\na\n∈\nA\n.","source_id":"planetmath.reflexiverelation","source_sha256":"5c1d8c8a2a0b665b1ceba3f4ee175255ee04aedb298f58683e8140717b5c44c8","start":38}],"target_id":"concept.planetmath.reflexiverelation","target_kind":"node","target_sha256":"92d5051264bf70d2406b0ed45cbfe851588bf9a00a95763163bf18ca9ebc8eaf"}],"concept.planetmath.regularsemigroup":[{"id":"assertion.concept.planetmath.regularsemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Regular semigroup as stated in the captured PlanetMath entry regularsemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M17, 20M18) states: \\PMlinkescapephrase completely regular \\PMlinkescapephrase generated by Let S be a semigroup .","support":[{"end":130,"quote":"\\PMlinkescapephrase\ncompletely regular\n\\PMlinkescapephrase\ngenerated by\nLet\nS\nbe a\nsemigroup\n.","source_id":"planetmath.regularsemigroup","source_sha256":"ef67e7743f26bb766c40dcfe3281ce557f3a89721a78e86311cbc6961ffd4039","start":36}],"target_id":"concept.planetmath.regularsemigroup","target_kind":"node","target_sha256":"61fec79b4935055c7c1f9954d2c18e0ee3a12dec53b1c191af148a627b2a722c"}],"concept.planetmath.regularspace":[{"id":"assertion.concept.planetmath.regularspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Regular space as stated in the captured PlanetMath entry regularspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: Definition 1 . A topological space is a regular space if it is both a T 0 space ( http://planetmath.org/T0Space ) and a T 3 space ( http://planetmath.org/T3Space ).","support":[{"end":192,"quote":"Definition 1\n.\nA\ntopological space\nis a\nregular space\nif\nit is both a\nT\n0\nspace (\nhttp://planetmath.org/T0Space\n) and a\nT\n3\nspace (\nhttp://planetmath.org/T3Space\n).","source_id":"planetmath.regularspace","source_sha256":"e0098937d93e93d05cb58f907357b804960e46d6a842a05795e9cc07a1844b85","start":28}],"target_id":"concept.planetmath.regularspace","target_kind":"node","target_sha256":"22fd22d6d49b6a0fa241cdfacb8c29d5df81f1db40416eb1056412748fbf3402"}],"concept.planetmath.relatedrates":[{"id":"assertion.concept.planetmath.relatedrates","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Related rates as stated in the captured PlanetMath entry relatedrates","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53A45, 53A17, 26A24) states: The notion of a derivative has numerous interpretations and applications.","support":[{"end":101,"quote":"The notion of a\nderivative\nhas numerous\ninterpretations\nand\napplications.","source_id":"planetmath.relatedrates","source_sha256":"655af6fde233c9d2a38ab25b18c1f1441bb5a93e098261a895185b74e89c4ed7","start":28}],"target_id":"concept.planetmath.relatedrates","target_kind":"node","target_sha256":"c64e7c93004ee1064f39a6585e53c3c8ee7557a5c82b33e031ea5a73c4341a8d"}],"concept.planetmath.relationalgebra":[{"id":"assertion.concept.planetmath.relationalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relation algebra as stated in the captured PlanetMath entry relationalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15, 06E25) states: It is a well-known fact that if A is a set, then P ⁢ ( A ) the power set of A , equipped with the intersection operation ∩ , the union operation ∪ , and the complement operation ′ turns P ⁢ ( A ) into a Boolean algebra .","support":[{"end":254,"quote":"It is a well-known fact that if\nA\nis a set, then\nP\n⁢\n(\nA\n)\nthe\npower set\nof\nA\n, equipped with the\nintersection\noperation\n∩\n, the union operation\n∪\n, and the\ncomplement\noperation\n′\nturns\nP\n⁢\n(\nA\n)\ninto a\nBoolean algebra\n.","source_id":"planetmath.relationalgebra","source_sha256":"7075bac1fe0ad42d2ed09bea898efa0378d992e5e59f84ae291d2b45cd5b962f","start":34}],"target_id":"concept.planetmath.relationalgebra","target_kind":"node","target_sha256":"4de70544a57f5e377e56e702d326995b27dc41c11ee17ce31b9c7b69f11f3472"}],"concept.planetmath.relationalsystem":[{"id":"assertion.concept.planetmath.relationalsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relational system as stated in the captured PlanetMath entry relationalsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03C07, 08A02) states: A relational system , loosely speaking, is a pair ( A , R ) where A is a set and R is a set of finitary relations defined on A (a finitary relation is just an n -ary relation where n ∈ ℕ ; when n = 1 , it is called a property ).","support":[{"end":264,"quote":"A\nrelational system\n, loosely speaking, is a pair\n(\nA\n,\nR\n)\nwhere\nA\nis a set and\nR\nis a set of finitary relations defined on\nA\n(a finitary relation is just an\nn\n-ary\nrelation\nwhere\nn\n∈\nℕ\n; when\nn\n=\n1\n, it is called a\nproperty\n).","source_id":"planetmath.relationalsystem","source_sha256":"b5abd6175785f2d73c536efa9489f82385de4fad798c43613aa088aa2f8fa1e2","start":36}],"target_id":"concept.planetmath.relationalsystem","target_kind":"node","target_sha256":"5ffd1819bc8ec33cfb7cefe1b4002410e79b116eee839c1497b4807794fa355a"}],"concept.planetmath.relationcomposition":[{"id":"assertion.concept.planetmath.relationcomposition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Relation composition as stated in the captured PlanetMath entry relationcomposition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 68R01, 68P15, 08A02, 05C65, 05B30, 05B20, 03E20, 03B10) states: Relation composition , or the composition of relations , is the generalization of function composition, or the composition of functions.","support":[{"end":178,"quote":"Relation composition\n, or the\ncomposition of relations\n, is the\ngeneralization\nof function composition, or the\ncomposition\nof functions.","source_id":"planetmath.relationcomposition","source_sha256":"7f7f0aff2adddb3ad723eecfa36ad3a98a7ca427d9e8ad11359d032a8623ccda","start":42}],"target_id":"concept.planetmath.relationcomposition","target_kind":"node","target_sha256":"50763ee31bc03af83c08ad6cd432afc7560234c2b13ce94b26915259dc9fd929"}],"concept.planetmath.restrictionofafunction":[{"id":"assertion.concept.planetmath.restrictionofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Restriction of a function as stated in the captured PlanetMath entry restrictionofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let f : X → Y be a function from a set X to a set Y .","support":[{"end":116,"quote":"Definition\nLet\nf\n:\nX\n→\nY\nbe a\nfunction\nfrom a set\nX\nto a set\nY\n.","source_id":"planetmath.restrictionofafunction","source_sha256":"a04b8eae7113ad8136a6b620fa089a3d5b326a1d855726d476dd729c7c273425","start":52}],"target_id":"concept.planetmath.restrictionofafunction","target_kind":"node","target_sha256":"627cb26b7c7a86ce576bcde2db9ca0104cd0f16560ed6869491a1e8b5e2bcd81"}],"concept.planetmath.reversepolishnotation":[{"id":"assertion.concept.planetmath.reversepolishnotation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Reverse Polish notation as stated in the captured PlanetMath entry reversepolishnotation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","support":[{"end":333,"quote":"Whereas\noperators\nare traditionally placed between operands, with parentheses used to override\noperator precedence\n, it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","source_id":"planetmath.reversepolishnotation","source_sha256":"bca88c4ccb5a7ece6949946a0286d9e35392e8dd4df357bccbbefd0fca813c1c","start":48}],"target_id":"concept.planetmath.reversepolishnotation","target_kind":"node","target_sha256":"42cc90bbaf300cf7a2a14ee35984a7fe7dcdcd9fe703dd65fa1726aad5899051"}],"concept.planetmath.ringhomomorphism":[{"id":"assertion.concept.planetmath.ringhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ring homomorphism as stated in the captured PlanetMath entry ringhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13B10, 16B99, 81P05) states: Let R and S be rings. A ring homomorphism is a function f : R ⟶ S such that: • f ⁢ ( a + b ) = f ⁢ ( a ) + f ⁢ ( b ) for all a , b ∈ R • f ⁢ ( a ⋅ b ) = f ⁢ ( a ) ⋅ f ⁢ ( b ) for all a , b ∈ R A ring isomorphism is a ring homomorphism which is a bijection .","support":[{"end":293,"quote":"Let\nR\nand\nS\nbe rings. A\nring homomorphism\nis a\nfunction\nf\n:\nR\n⟶\nS\nsuch that:\n•\nf\n⁢\n(\na\n+\nb\n)\n=\nf\n⁢\n(\na\n)\n+\nf\n⁢\n(\nb\n)\nfor all\na\n,\nb\n∈\nR\n•\nf\n⁢\n(\na\n⋅\nb\n)\n=\nf\n⁢\n(\na\n)\n⋅\nf\n⁢\n(\nb\n)\nfor all\na\n,\nb\n∈\nR\nA\nring isomorphism\nis a ring homomorphism which is a\nbijection\n.","source_id":"planetmath.ringhomomorphism","source_sha256":"303e591ba0d05abd5094905ea804b8d6d4930346fbeba361b973e23424c86ade","start":36}],"target_id":"concept.planetmath.ringhomomorphism","target_kind":"node","target_sha256":"50b252535a91e070fdc0128559eafc3d551b6dc457226713c63b6df490e40ac4"}],"concept.planetmath.ruleofproduct":[{"id":"assertion.concept.planetmath.ruleofproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rule of product as stated in the captured PlanetMath entry ruleofproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05A05, 03-00) states: If a process A can have altogether m different results and another process B altogether n different results, then the two processes can have altogether m ⁢ n different combined results.","support":[{"end":217,"quote":"If a process\nA\ncan have altogether\nm\ndifferent results and another process\nB\naltogether\nn\ndifferent results, then the two processes can have altogether\nm\n⁢\nn\ndifferent combined results.","source_id":"planetmath.ruleofproduct","source_sha256":"a96bffa7714c264f5d329fb61f9857cfa12ef576a7f6169cbe67eb4e99d59f9a","start":32}],"target_id":"concept.planetmath.ruleofproduct","target_kind":"node","target_sha256":"0ab1c58b916a8759e94c61dad07eeee1f7b286d2aa84db0c1a4577075a7184c2"}],"concept.planetmath.russellsparadox":[{"id":"assertion.concept.planetmath.russellsparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Russell’s paradox as stated in the captured PlanetMath entry russellsparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: Suppose that for any coherent proposition P ⁢ ( x ) , we can construct a set { x : P ⁢ ( x ) } .","support":[{"end":132,"quote":"Suppose that for any coherent\nproposition\nP\n⁢\n(\nx\n)\n, we can construct a set\n{\nx\n:\nP\n⁢\n(\nx\n)\n}\n.","source_id":"planetmath.russellsparadox","source_sha256":"5c01d870e4fc3fd1322b1df14345efc3ca94f0e91bbfe5e0557d1d3c87f12285","start":36}],"target_id":"concept.planetmath.russellsparadox","target_kind":"node","target_sha256":"71dd310cf92c8335cead820f24ab8cd98568af7f776a8b287a5600382c02edc3"}],"concept.planetmath.russellstheoryoftypes":[{"id":"assertion.concept.planetmath.russellstheoryoftypes","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Russell’s theory of types as stated in the captured PlanetMath entry russellstheoryoftypes","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: After the discovery of the paradoxes of set theory (notably Russell’s paradox ), it become apparent that naive set theory must be replaced by something in which the paradoxes can’t arise.","support":[{"end":239,"quote":"After the discovery of the paradoxes of set theory (notably Russell’s\nparadox\n), it become apparent that\nnaive set theory\nmust be replaced by something in which the paradoxes can’t arise.","source_id":"planetmath.russellstheoryoftypes","source_sha256":"bfc1bb1f912dabf4412945d2d746842d947c9a171bfba81a9dff84b165997cd7","start":52}],"target_id":"concept.planetmath.russellstheoryoftypes","target_kind":"node","target_sha256":"5c9b5f48020750726edb2f94c11477e2213b29566c235f7a0a7d7e22b1586546"}],"concept.planetmath.satisfactionrelation":[{"id":"assertion.concept.planetmath.satisfactionrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Satisfaction relation as stated in the captured PlanetMath entry satisfactionrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Alfred Tarski was the first mathematician to give a formal definition of what it means for a formula to be “true” in a structure .","support":[{"end":174,"quote":"Alfred Tarski was the first mathematician to give a formal definition of what\nit means for a\nformula\nto be “true” in a\nstructure\n.","source_id":"planetmath.satisfactionrelation","source_sha256":"f3c8a24eb9d729356d66d50eedcf9d398a3fc56ac051965bb4952e17bb50257e","start":44}],"target_id":"concept.planetmath.satisfactionrelation","target_kind":"node","target_sha256":"42da95f34158b5e75b37c485ab6df3ea8fbef03dcf1fc93918486285e8c89884"}],"concept.planetmath.secondcountable":[{"id":"assertion.concept.planetmath.secondcountable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Second countable as stated in the captured PlanetMath entry secondcountable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D70) states: A topological space is said to be second if it has a countable basis ( http://planetmath.org/BasisTopologicalSpace ).","support":[{"end":151,"quote":"A\ntopological space\nis said to be\nsecond\nif it has a countable basis (\nhttp://planetmath.org/BasisTopologicalSpace\n).","source_id":"planetmath.secondcountable","source_sha256":"09650a40f9d4adcd4f16613135f5ddfa1b8cca86c1ab05b1a77f97ff0c8c4d2a","start":34}],"target_id":"concept.planetmath.secondcountable","target_kind":"node","target_sha256":"cdfa88ee9127d6b080debc07cc3868062c477a5a3484600094350054f93d4c80"}],"concept.planetmath.secondorderlogic":[{"id":"assertion.concept.planetmath.secondorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Second order logic as stated in the captured PlanetMath entry secondorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15) states: Second order logic refers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or functions on those objects (or both, in the three type case).","support":[{"end":262,"quote":"Second order logic\nrefers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or\nfunctions\non those objects (or both, in the three type case).","source_id":"planetmath.secondorderlogic","source_sha256":"730e944fb02a299cf17e6174757a162d934f541244c3f3dfe87485e8e93f106a","start":38}],"target_id":"concept.planetmath.secondorderlogic","target_kind":"node","target_sha256":"d19184278ea0537ee6a5358638698e12f5747215f59b851fd692be2752158760"}],"concept.planetmath.sectionofafiberbundle":[{"id":"assertion.concept.planetmath.sectionofafiberbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Section of a fiber bundle as stated in the captured PlanetMath entry sectionofafiberbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R10) states: Let p : E → B be a fiber bundle , denoted by ξ . A section of ξ is a continuous map s : B → E such that the composition p ∘ s equals the identity .","support":[{"end":199,"quote":"Let\np\n:\nE\n→\nB\nbe a\nfiber bundle\n, denoted by\nξ\n.\nA\nsection\nof\nξ\nis a\ncontinuous map\ns\n:\nB\n→\nE\nsuch that the\ncomposition\np\n∘\ns\nequals the\nidentity\n.","source_id":"planetmath.sectionofafiberbundle","source_sha256":"a2e9f2a4d73a0d7599610e8717a6845db72f9504b380b77c347ff1ffea9d6101","start":52}],"target_id":"concept.planetmath.sectionofafiberbundle","target_kind":"node","target_sha256":"499f2eb3cd8a797300996fe7af372c0a555604d6de744d5af765d2d7dd1a2345"}],"concept.planetmath.sectionofagroup":[{"id":"assertion.concept.planetmath.sectionofagroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Section of a group as stated in the captured PlanetMath entry sectionofagroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20F99) states: A section of a group G is a quotient ( http://planetmath.org/QuotientGroup ) of a subgroup of G .","support":[{"end":135,"quote":"A\nsection\nof a group\nG\nis\na\nquotient\n(\nhttp://planetmath.org/QuotientGroup\n) of a\nsubgroup\nof\nG\n.","source_id":"planetmath.sectionofagroup","source_sha256":"84924de7b5c027e1faaac9cbcfaeb2e362fd6c2ba70eb84e4951d66d0860bf0a","start":38}],"target_id":"concept.planetmath.sectionofagroup","target_kind":"node","target_sha256":"2ca783960eec92423f1a0ebfd609d1ea41ece6143f1b1c32f007c5fef88e3ec2"}],"concept.planetmath.selector":[{"id":"assertion.concept.planetmath.selector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Selector as stated in the captured PlanetMath entry selector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E25) states: Let S be a collection of sets. A selector of S is by definition a set { f ⁢ ( R ) | R ∈ S } where f is a choice function on S (that is f ⁢ ( R ) ∈ R ).","support":[{"end":169,"quote":"Let\nS\nbe a\ncollection\nof sets. A\nselector\nof\nS\nis by definition a set\n{\nf\n⁢\n(\nR\n)\n|\nR\n∈\nS\n}\nwhere\nf\nis a\nchoice function\non\nS\n(that is\nf\n⁢\n(\nR\n)\n∈\nR\n).","source_id":"planetmath.selector","source_sha256":"50bc67472cb7b2ee294d4c0f20250e57f4ce57669c52cd1b7e53187ed0d5d2cf","start":18}],"target_id":"concept.planetmath.selector","target_kind":"node","target_sha256":"22579da1698a9309db7272c5a810e96fd79e17f48e645d6b2a28156e83a36dd3"}],"concept.planetmath.semiautomatonhomomorphism":[{"id":"assertion.concept.planetmath.semiautomatonhomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiautomaton homomorphism as stated in the captured PlanetMath entry semiautomatonhomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45, 20M35, 03D05, 68Q70) states: Just like groups and rings, a semiautomaton can be viewed as an algebraic structure .","support":[{"end":139,"quote":"Just like groups and rings, a\nsemiautomaton\ncan be viewed as an\nalgebraic structure\n.","source_id":"planetmath.semiautomatonhomomorphism","source_sha256":"46843f23a81dbf139584dfec50933db940888550089e3ea1574aea24c06764f8","start":54}],"target_id":"concept.planetmath.semiautomatonhomomorphism","target_kind":"node","target_sha256":"84f581790384d9a3caed23fb38be19fd46a856bf4a775ddeb14f74ac31e1da81"}],"concept.planetmath.semigroup":[{"id":"assertion.concept.planetmath.semigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semigroup as stated in the captured PlanetMath entry semigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M99) states: A semigroup G is a set together with a binary operation ⋅ : G × G ⟶ G which satisfies the associative property: ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) for all a , b , c ∈ G .","support":[{"end":185,"quote":"A\nsemigroup\nG\nis a set together with a\nbinary operation\n⋅\n:\nG\n×\nG\n⟶\nG\nwhich\nsatisfies\nthe associative property:\n(\na\n⋅\nb\n)\n⋅\nc\n=\na\n⋅\n(\nb\n⋅\nc\n)\nfor all\na\n,\nb\n,\nc\n∈\nG\n.","source_id":"planetmath.semigroup","source_sha256":"ce170036ac03eca9c5635e78b02d1ad02bb0e97b666ad3b1ae7941b2213574c3","start":20}],"target_id":"concept.planetmath.semigroup","target_kind":"node","target_sha256":"d8713746ecba435bcbe1b4a9e9596635aad1eb2367e273d7c2445c2063e96bff"}],"concept.planetmath.seminorm":[{"id":"assertion.concept.planetmath.seminorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Seminorm as stated in the captured PlanetMath entry seminorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B20) states: Let V be a real, or a complex vector space , with K denoting the corresponding field of scalars.","support":[{"end":114,"quote":"Let\nV\nbe a real, or a\ncomplex vector space\n, with\nK\ndenoting the\ncorresponding field of scalars.","source_id":"planetmath.seminorm","source_sha256":"6ebbca2c6f43cb998dfc608ccd05f6d1ed93b5cb955c475cdc9582f4965fd366","start":18}],"target_id":"concept.planetmath.seminorm","target_kind":"node","target_sha256":"484a7c5b107c2d5c53ec2227a3ea1fc6e86b8030c759144fdb02b50dbe8a34c3"}],"concept.planetmath.semioticequivalencerelation":[{"id":"assertion.concept.planetmath.semioticequivalencerelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiotic equivalence relation as stated in the captured PlanetMath entry semioticequivalencerelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 94A05, 03G15, 03E20, 03B42, 03B10, 94A15) states: Note. The intended forms of the Tables are visible only in the Page Image view.","support":[{"end":139,"quote":"Note.\nThe intended forms of the Tables are visible only in the Page Image view.","source_id":"planetmath.semioticequivalencerelation","source_sha256":"3ba69e6c21ddca817864c77c8cd35db17416469736305b1b058b38991b0227ac","start":60}],"target_id":"concept.planetmath.semioticequivalencerelation","target_kind":"node","target_sha256":"36186107b5b7daa0952aca85743c811cf4e0cf72160d3c817b91a357ef513291"}],"concept.planetmath.semiring":[{"id":"assertion.concept.planetmath.semiring","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semiring as stated in the captured PlanetMath entry semiring","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16Y60) states: \\PMlinkescapephrase right annihilator A semiring is a set A with two operations , + and ⋅ , such that 0 ∈ A makes ( A , + ) into a commutative monoid , 1 ∈ A makes ( A , ⋅ ) into a monoid, the operation ⋅ distributes ( http://planetmath.org/ Distributivity ) over + , and for any a ∈ A , 0 ⋅ a = a ⋅ 0 = 0 .","support":[{"end":325,"quote":"\\PMlinkescapephrase\nright annihilator\nA\nsemiring\nis a set\nA\nwith two\noperations\n,\n+\nand\n⋅\n, such that\n0\n∈\nA\nmakes\n(\nA\n,\n+\n)\ninto a\ncommutative monoid\n,\n1\n∈\nA\nmakes\n(\nA\n,\n⋅\n)\ninto a monoid, the operation\n⋅\ndistributes (\nhttp://planetmath.org/\nDistributivity\n)\nover\n+\n, and for any\na\n∈\nA\n,\n0\n⋅\na\n=\na\n⋅\n0\n=\n0\n.","source_id":"planetmath.semiring","source_sha256":"05b597d6cd82d94bad746aead7d5d0d76ca263aa8a8c227b04fb1aa8ba38fc52","start":18}],"target_id":"concept.planetmath.semiring","target_kind":"node","target_sha256":"6cc34fb002600be42d7a21added9f0b4faa413120e5d086ff50e5d670acec05a"}],"concept.planetmath.semithuesystem":[{"id":"assertion.concept.planetmath.semithuesystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Semi-Thue system as stated in the captured PlanetMath entry semithuesystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q42, 03D40, 20M35, 03D03) states: A semi-Thue system 𝔖 is a pair ( Σ , P ) where Σ is an alphabet and P is a non-empty finite binary relation on Σ * , the Kleene star of Σ .","support":[{"end":173,"quote":"A\nsemi-Thue system\n𝔖\nis a pair\n(\nΣ\n,\nP\n)\nwhere\nΣ\nis an\nalphabet\nand\nP\nis a non-empty finite\nbinary relation\non\nΣ\n*\n, the\nKleene star\nof\nΣ\n.","source_id":"planetmath.semithuesystem","source_sha256":"3f5af952e719734e8013f9a4949d3a5a84fe477b5426fb726fbccd0ccb04d57a","start":34}],"target_id":"concept.planetmath.semithuesystem","target_kind":"node","target_sha256":"1d9235ab0f90e84dfd695ee5c1d43529bea80c98e517a24b272c6f5292c26fb4"}],"concept.planetmath.separationaxioms":[{"id":"assertion.concept.planetmath.separationaxioms","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Separation axioms as stated in the captured PlanetMath entry separationaxioms","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10, 54D15) states: The separation axioms are additional conditions which may be required to a topological space in order to ensure that some particular types of sets can be separated by open sets , thus avoiding certain pathological cases.","support":[{"end":256,"quote":"The\nseparation axioms\nare additional conditions which may be required to a\ntopological space\nin order to ensure that some particular types of sets can be\nseparated\nby\nopen sets\n, thus avoiding certain pathological cases.","source_id":"planetmath.separationaxioms","source_sha256":"1a87df36e25e174dda5ae1623e617997b50bedb7a65a24d31331d93908a4da4a","start":36}],"target_id":"concept.planetmath.separationaxioms","target_kind":"node","target_sha256":"1b0a97a98bf8d14d3cd0bc56a1cd4e8db21761e05b6589880918e9c55ea37527"}],"concept.planetmath.sequent":[{"id":"assertion.concept.planetmath.sequent","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sequent as stated in the captured PlanetMath entry sequent","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F03) states: A sequent represents a formal step in a proof. Typically it consists of two lists of formulas , one representing the premises and one the conclusions .","support":[{"end":167,"quote":"A\nsequent\nrepresents a formal step in a proof. Typically it consists of two lists of\nformulas\n, one representing the\npremises\nand one the\nconclusions\n.","source_id":"planetmath.sequent","source_sha256":"56f7b8e0ef4fd3108f8d9cf4aeb25d934688a66a0ef922a79da4ec0db6171172","start":16}],"target_id":"concept.planetmath.sequent","target_kind":"node","target_sha256":"32e37462dba54f4fb3f69533f47916f5189cc6685340434a6e32a86ef1fa728b"}],"concept.planetmath.sequentiallycompact":[{"id":"assertion.concept.planetmath.sequentiallycompact","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sequentially compact as stated in the captured PlanetMath entry sequentiallycompact","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 40A05, 54D30) states: A topological space X is sequentially compact if every sequence in X has a convergent subsequence.","support":[{"end":140,"quote":"A\ntopological space\nX\nis\nsequentially compact\nif every\nsequence\nin\nX\nhas a convergent subsequence.","source_id":"planetmath.sequentiallycompact","source_sha256":"8fbbe11cca07ddc67f3c49d5a132a6135a225ec0f5c27efe4f2c3faa620e7f15","start":42}],"target_id":"concept.planetmath.sequentiallycompact","target_kind":"node","target_sha256":"21d7b52e56afde8fefc4468cbc8e295fa700a9048001f86861f72c613c6a61e6"}],"concept.planetmath.sesquilinearformsovergeneralfields":[{"id":"assertion.concept.planetmath.sesquilinearformsovergeneralfields","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sesquilinear forms over general fields as stated in the captured PlanetMath entry sesquilinearformsovergeneralfields","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39, 51A05) states: Let V be a vector space over a field k . k may be of any characteristic .","support":[{"end":151,"quote":"Let\nV\nbe a\nvector space\nover a field\nk\n.\nk\nmay be of any\ncharacteristic\n.","source_id":"planetmath.sesquilinearformsovergeneralfields","source_sha256":"f729f609f0aac1dc4d9f0b30d726f0f58edbc208cf9608d41f0497203930d02c","start":78}],"target_id":"concept.planetmath.sesquilinearformsovergeneralfields","target_kind":"node","target_sha256":"304bb92c79e079320eee5a7f22f64a1ce1b79b6fe5ceb3888a1c8a265e985d42"}],"concept.planetmath.setdifference":[{"id":"assertion.concept.planetmath.setdifference","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Set difference as stated in the captured PlanetMath entry setdifference","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Definition Let A and B be sets. The set difference (or simply difference ) between A and B (in that order) is the set of all elements of A that are not in B .","support":[{"end":188,"quote":"Definition\nLet\nA\nand\nB\nbe sets.\nThe\nset difference\n(or simply\ndifference\n)\nbetween\nA\nand\nB\n(in that order)\nis the set of all elements of\nA\nthat are not in\nB\n.","source_id":"planetmath.setdifference","source_sha256":"0a6bfc9b0cf1933ce98f2dd0f5faeb58868823459239bee65d9e9dd6107fcf1e","start":30}],"target_id":"concept.planetmath.setdifference","target_kind":"node","target_sha256":"ce18b7b605fa40b54745e9ac1f3fb800f9853a10000cf8fd573a10770578699a"}],"concept.planetmath.settheory":[{"id":"assertion.concept.planetmath.settheory","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Set theory as stated in the captured PlanetMath entry settheory","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03E30) states: Set theory is special among mathematical theories, in two ways: It plays a central role in putting mathematics on a reliable axiomatic foundation , and it provides the basic language and apparatus in which most of mathematics is expressed.","support":[{"end":261,"quote":"Set theory\nis special among mathematical theories, in two ways: It plays\na central role in putting mathematics on a reliable axiomatic\nfoundation\n,\nand it provides the basic\nlanguage\nand apparatus in which most of\nmathematics is expressed.","source_id":"planetmath.settheory","source_sha256":"c510af83743dc5b9b2a6785f6d082a91b206f42c77a4160fe46e43d2cb58a3a1","start":22}],"target_id":"concept.planetmath.settheory","target_kind":"node","target_sha256":"088a9a5be6f812b01a8a6cbd04c6503988767212feb28387ddb0bd16bd027089"}],"concept.planetmath.shefferstroke":[{"id":"assertion.concept.planetmath.shefferstroke","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sheffer stroke as stated in the captured PlanetMath entry shefferstroke","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In the late 19th century and early 20th century, Charles Sanders Peirce and H.M.","support":[{"end":110,"quote":"In the late 19th century and early 20th century,\nCharles Sanders Peirce\nand H.M.","source_id":"planetmath.shefferstroke","source_sha256":"8cd53bcdacfe5f3f2cb9b3c4d2556628f0ef2d313c3ed9d91a7470af3b62a7c9","start":30}],"target_id":"concept.planetmath.shefferstroke","target_kind":"node","target_sha256":"e1610b88ba44eede76edcb44c9eaaa6ff66463d6051fdd1c4aab1da92049ea79"}],"concept.planetmath.signatureofapermutation":[{"id":"assertion.concept.planetmath.signatureofapermutation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Signature of a permutation as stated in the captured PlanetMath entry signatureofapermutation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Let X be a finite set , and let G be the group of permutations of X (see permutation group ).","support":[{"end":147,"quote":"Let\nX\nbe a\nfinite set\n, and let\nG\nbe the group of\npermutations\nof\nX\n(see\npermutation group\n).","source_id":"planetmath.signatureofapermutation","source_sha256":"a8ca63ac1a4884229efad8965a6e2ce8a4fd5453f4abdbe6f276bd67ee6dc9ce","start":54}],"target_id":"concept.planetmath.signatureofapermutation","target_kind":"node","target_sha256":"c2086e6ae4b3022b3a25edf038c78524e7bc41ad24166d870a9dab5243e57913"}],"concept.planetmath.signrelation":[{"id":"assertion.concept.planetmath.signrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sign relation as stated in the captured PlanetMath entry signrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: A sign relation is a special type of triadic relation that arises in the use of signs to connote meanings and denote objects.","support":[{"end":153,"quote":"A\nsign relation\nis a special type of\ntriadic relation\nthat arises in the use of signs to connote meanings and denote objects.","source_id":"planetmath.signrelation","source_sha256":"5ed124eda4f8529bc55b691a6046b4a442cc5c442e8a0b1406c8e39a81e399b3","start":28}],"target_id":"concept.planetmath.signrelation","target_kind":"node","target_sha256":"0a4a36fa4dd26ba975339392aa88fb39e55035e5b8cfc51e09f9fa1f7c0109fc"}],"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence":[{"id":"assertion.concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Similarity and analogous systems: dynamic adjointness and topological equivalence as stated in the captured PlanetMath entry similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03C98, 18-00, 37F99, 37F05, 03D80, 03D15, 03C52, 18A40) states: \\xyoption curve 0.1 Dynamic Adjointness, Similarity and Analogous Systems.","support":[{"end":238,"quote":"\\xyoption\ncurve\n0.1\nDynamic Adjointness, Similarity and Analogous Systems.","source_id":"planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","source_sha256":"f826a4e66d64f118a86db4ab772870112af959fea5202f2c6c3b8abc3f0634ec","start":164}],"target_id":"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","target_kind":"node","target_sha256":"2f96a84c8c7d6e3333929521665932e33206236a597838c26a0516a8451dc6d8"}],"concept.planetmath.similarmatrix":[{"id":"assertion.concept.planetmath.similarmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Similar matrix as stated in the captured PlanetMath entry similarmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: Definition A square matrix A is similar (or conjugate ) to a square matrix B if there exists a nonsingular square matrix S such that A = S - 1 ⁢ B ⁢ S .","support":[{"end":182,"quote":"Definition\nA\nsquare matrix\nA\nis\nsimilar\n(or\nconjugate\n) to a square matrix\nB\nif there exists a\nnonsingular\nsquare matrix\nS\nsuch that\nA\n=\nS\n-\n1\n⁢\nB\n⁢\nS\n.","source_id":"planetmath.similarmatrix","source_sha256":"734b8e015ceb44dc2bb639b63e429668fe20fbcf0083f9174bb3a5151c77b032","start":30}],"target_id":"concept.planetmath.similarmatrix","target_kind":"node","target_sha256":"6e4228fe1df2ecc1cdfec364d82970a90bd4ec6af32b60a76b6bda13ff3f36b1"}],"concept.planetmath.simplifiedautomaton":[{"id":"assertion.concept.planetmath.simplifiedautomaton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Simplified automaton as stated in the captured PlanetMath entry simplifiedautomaton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Word acceptance is the primary function of an automaton .","support":[{"end":99,"quote":"Word acceptance is the primary\nfunction\nof an\nautomaton\n.","source_id":"planetmath.simplifiedautomaton","source_sha256":"b78881993c6319f5ef1351b5cfbba8388da06435dd7e35b7d760a7ba4566200f","start":42}],"target_id":"concept.planetmath.simplifiedautomaton","target_kind":"node","target_sha256":"6199d390354220ca16784377d70fcabde9c552a1af0efbc9b7a0455189591666"}],"concept.planetmath.singleton":[{"id":"assertion.concept.planetmath.singleton","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Singleton as stated in the captured PlanetMath entry singleton","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A singleton is a set containing a single element.","support":[{"end":69,"quote":"A\nsingleton\nis a set containing a single element.","source_id":"planetmath.singleton","source_sha256":"5ed85445f151b40d495a22b869dd6a665181900f788e2570f53b9e09b96784df","start":20}],"target_id":"concept.planetmath.singleton","target_kind":"node","target_sha256":"cee3c10000f91b05b72ea6e829278b504c5a04bfcc34d670f51157359795dc73"}],"concept.planetmath.skolemization":[{"id":"assertion.concept.planetmath.skolemization","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Skolemization as stated in the captured PlanetMath entry skolemization","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Skolemization is a way of removing existential quantifiers from a formula .","support":[{"end":103,"quote":"Skolemization\nis a way of removing\nexistential quantifiers\nfrom a\nformula\n.","source_id":"planetmath.skolemization","source_sha256":"eb335eb6fef9714f27614c71f04bd2b05effa432a7efc670820398b684d4647d","start":28}],"target_id":"concept.planetmath.skolemization","target_kind":"node","target_sha256":"c781f1e66d4c7dfa1791d0f1a36d5939b28135cd92aa19e492c9221b7e5b263c"}],"concept.planetmath.solesufficientoperator":[{"id":"assertion.concept.planetmath.solesufficientoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sole sufficient operator as stated in the captured PlanetMath entry solesufficientoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05) states: A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to define all of the operators in a specified set of operators.","support":[{"end":216,"quote":"A\nsole sufficient operator\nor a\nsole sufficient connective\nis an\noperator\nthat is\nsufficient\nby itself to define all of the operators in a specified set of operators.","source_id":"planetmath.solesufficientoperator","source_sha256":"9551caf3ee982a005ef768234f3f9c435087aafbc839eb3b6e3e02ae857ef13f","start":50}],"target_id":"concept.planetmath.solesufficientoperator","target_kind":"node","target_sha256":"17a7c300b2d1babd5ad93788e0d5620934d8cf3c2655a2f59838702fa252d6f5"}],"concept.planetmath.specialelementsinalattice":[{"id":"assertion.concept.planetmath.specialelementsinalattice","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Special elements in a lattice as stated in the captured PlanetMath entry specialelementsinalattice","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 06B99) states: Let L be a lattice and a ∈ L is said to be • distributive if a ∨ ( b ∧ c ) = ( a ∨ b ) ∧ ( a ∨ c ) , • standard if b ∧ ( a ∨ c ) = ( b ∧ a ) ∨ ( b ∧ c ) , or • neutral if ( a ∧ b ) ∨ ( b ∧ c ) ∨ ( c ∧ a ) = ( a ∨ b ) ∧ ( b ∨ c ) ∧ ( c ∨ a ) for all b , c ∈ L .","support":[{"end":320,"quote":"Let\nL\nbe a\nlattice\nand\na\n∈\nL\nis said to be\n•\ndistributive\nif\na\n∨\n(\nb\n∧\nc\n)\n=\n(\na\n∨\nb\n)\n∧\n(\na\n∨\nc\n)\n,\n•\nstandard\nif\nb\n∧\n(\na\n∨\nc\n)\n=\n(\nb\n∧\na\n)\n∨\n(\nb\n∧\nc\n)\n, or\n•\nneutral\nif\n(\na\n∧\nb\n)\n∨\n(\nb\n∧\nc\n)\n∨\n(\nc\n∧\na\n)\n=\n(\na\n∨\nb\n)\n∧\n(\nb\n∨\nc\n)\n∧\n(\nc\n∨\na\n)\nfor all\nb\n,\nc\n∈\nL\n.","source_id":"planetmath.specialelementsinalattice","source_sha256":"e878ef7db946edc58344fc4a19ba2b635e4395c1e92dbe661547f7b046b8331f","start":60}],"target_id":"concept.planetmath.specialelementsinalattice","target_kind":"node","target_sha256":"73c4d9ab65da7b33aab0820f30f735b5c0109da65c306d096a45adf2db3fb02f"}],"concept.planetmath.specialelementsinarelationalgebra":[{"id":"assertion.concept.planetmath.specialelementsinarelationalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Special elements in a relation algebra as stated in the captured PlanetMath entry specialelementsinarelationalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G15) states: Let A be a relation algebra with operators ( ∨ , ∧ , ; , ′ , - , 0 , 1 , i ) of type ( 2 , 2 , 2 , 1 , 1 , 0 , 0 , 0 ) .","support":[{"end":198,"quote":"Let\nA\nbe a\nrelation algebra\nwith\noperators\n(\n∨\n,\n∧\n,\n;\n,\n′\n,\n-\n,\n0\n,\n1\n,\ni\n)\nof type\n(\n2\n,\n2\n,\n2\n,\n1\n,\n1\n,\n0\n,\n0\n,\n0\n)\n.","source_id":"planetmath.specialelementsinarelationalgebra","source_sha256":"16496a532fb5c11fd917ade98d1f01bf610857c274d8511026da8430bef89643","start":78}],"target_id":"concept.planetmath.specialelementsinarelationalgebra","target_kind":"node","target_sha256":"ce934ea6abbdb7a4458707c562a0b40ee67d8509d0f2a50d67b69f053d7e8034"}],"concept.planetmath.sphenicnumber":[{"id":"assertion.concept.planetmath.sphenicnumber","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sphenic number as stated in the captured PlanetMath entry sphenicnumber","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A05) states: Given three primes p < q < r , the composite integer p ⁢ q ⁢ r is a sphenic number .","support":[{"end":114,"quote":"Given three primes\np\n<\nq\n<\nr\n, the\ncomposite\ninteger\np\n⁢\nq\n⁢\nr\nis a\nsphenic number\n.","source_id":"planetmath.sphenicnumber","source_sha256":"d8e27a32765209be20d482360648d8bc17c7643aac640b37ba88230abe5ab720","start":30}],"target_id":"concept.planetmath.sphenicnumber","target_kind":"node","target_sha256":"5f1936f944ba60951cb273c1bb25db4f469a23a39ec309afd8205b428ccf3d99"}],"concept.planetmath.stablesubspace":[{"id":"assertion.concept.planetmath.stablesubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Stable subspace as stated in the captured PlanetMath entry stablesubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A subset S of a larger set T is said to a stable subset for a function f : T → T iff f ⁢ ( S ) ⊂ S .","support":[{"end":132,"quote":"A subset\nS\nof a larger set\nT\nis said to a\nstable subset\nfor a function\nf\n:\nT\n→\nT\niff\nf\n⁢\n(\nS\n)\n⊂\nS\n.","source_id":"planetmath.stablesubspace","source_sha256":"719810aa4d87b785b22dd569c60ea9b6ec45c5ba5f341c2023ccc0ef3785dcd0","start":32}],"target_id":"concept.planetmath.stablesubspace","target_kind":"node","target_sha256":"ee753b34a471eb0d9f89c03d7734128ac1847f7213c6c576ae0fa48b71e78983"}],"concept.planetmath.standardenumeration":[{"id":"assertion.concept.planetmath.standardenumeration","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Standard enumeration as stated in the captured PlanetMath entry standardenumeration","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 68Q45, 03B65) states: The standard enumeration of { 0 , 1 } * is the sequence of strings s 0 = λ , s 1 = 0 , s 2 = 1 , s 3 = 00 , s 4 = 01 , ⋯ in lexicographic order .","support":[{"end":187,"quote":"The\nstandard enumeration\nof\n{\n0\n,\n1\n}\n*\nis the\nsequence\nof strings\ns\n0\n=\nλ\n,\ns\n1\n=\n0\n,\ns\n2\n=\n1\n,\ns\n3\n=\n00\n,\ns\n4\n=\n01\n,\n⋯\nin\nlexicographic order\n.","source_id":"planetmath.standardenumeration","source_sha256":"bf349fdcb760e2ccc6ac097dc6e5148d0778d684950dbb22016bea215462c759","start":42}],"target_id":"concept.planetmath.standardenumeration","target_kind":"node","target_sha256":"47a7f310dda5db687ca5ba6d5ae0d351b7d436bca1308e87892166c0542bf74c"}],"concept.planetmath.stronglyminimal":[{"id":"assertion.concept.planetmath.stronglyminimal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Strongly minimal as stated in the captured PlanetMath entry stronglyminimal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03C10, 03C45) states: Let L be a first order language and let M be an L - structure .","support":[{"end":97,"quote":"Let\nL\nbe a\nfirst order language\nand let\nM\nbe an\nL\n-\nstructure\n.","source_id":"planetmath.stronglyminimal","source_sha256":"519140432b257b29fe53aff362f3404f7bcb2b4b9f25602864997896d498a2be","start":34}],"target_id":"concept.planetmath.stronglyminimal","target_kind":"node","target_sha256":"43145605304aed123b026f0c4621de5ac693c59334865721e3dcadd55e8cb919"}],"concept.planetmath.structurehomomorphism":[{"id":"assertion.concept.planetmath.structurehomomorphism","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Structure homomorphism as stated in the captured PlanetMath entry structurehomomorphism","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 be two structures for Σ .","support":[{"end":112,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\nand\n𝔅\nbe two\nstructures\nfor\nΣ\n.","source_id":"planetmath.structurehomomorphism","source_sha256":"3f0953a8dc215da08e6312e6d37f9cb0938d8137909cef0eb342a335dfe311f6","start":46}],"target_id":"concept.planetmath.structurehomomorphism","target_kind":"node","target_sha256":"ebec43db16a3ba5f18c4c67d729b5bc11b2a7de0ffe841cb0ab8dfb59c40d064"}],"concept.planetmath.subalgebraofanalgebraicsystem":[{"id":"assertion.concept.planetmath.subalgebraofanalgebraicsystem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subalgebra of an algebraic system as stated in the captured PlanetMath entry subalgebraofanalgebraicsystem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A30, 08A05, 08A62) states: Let ( A , O ) be an algebraic system ( A ≠ ∅ is the underlying set and O is the set of operators on A ).","support":[{"end":172,"quote":"Let\n(\nA\n,\nO\n)\nbe an\nalgebraic system\n(\nA\n≠\n∅\nis the underlying set and\nO\nis the set of\noperators\non\nA\n).","source_id":"planetmath.subalgebraofanalgebraicsystem","source_sha256":"ff0a1d28d0ad7a35d76566557fd1e34cef5e1474bcce6325af14f7795b4c1f6b","start":68}],"target_id":"concept.planetmath.subalgebraofanalgebraicsystem","target_kind":"node","target_sha256":"01a9eaeab4e55b4d926ad8296f47107561fa39971bfcaa6427978d5439e297ac"}],"concept.planetmath.subalgebraofapartialalgebra":[{"id":"assertion.concept.planetmath.subalgebraofapartialalgebra","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subalgebra of a partial algebra as stated in the captured PlanetMath entry subalgebraofapartialalgebra","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Unlike an algebraic system , where there is only one way to define a subalgebra , there are several ways to define a subalgebra of a partial algebra .","support":[{"end":214,"quote":"Unlike an\nalgebraic system\n, where there is only one way to define a\nsubalgebra\n, there are several ways to define a subalgebra of a\npartial algebra\n.","source_id":"planetmath.subalgebraofapartialalgebra","source_sha256":"986913f311c247522577fba96b79bccd6e6b542137e0cfbafa53d4d8781ece14","start":64}],"target_id":"concept.planetmath.subalgebraofapartialalgebra","target_kind":"node","target_sha256":"d011825b7daa8327514cdf305de37b03f2715f72401d4c0cc3e5ab3b86b465f8"}],"concept.planetmath.subbasis":[{"id":"assertion.concept.planetmath.subbasis","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subbasis as stated in the captured PlanetMath entry subbasis","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54A99) states: Let ( X , 𝒯 ) be a topological space . A subset 𝒜 ⊆ 𝒯 is said to be a subbasis if the collection ℬ of intersections of finitely many elements of 𝒜 is a basis ( http://planetmath.org/BasisTopologicalSpace ) for 𝒯 .","support":[{"end":231,"quote":"Let\n(\nX\n,\n𝒯\n)\nbe a\ntopological space\n. A subset\n𝒜\n⊆\n𝒯\nis said to be a\nsubbasis\nif the\ncollection\nℬ\nof\nintersections\nof finitely many\nelements of\n𝒜\nis a basis (\nhttp://planetmath.org/BasisTopologicalSpace\n) for\n𝒯\n.","source_id":"planetmath.subbasis","source_sha256":"ba37f1039619d691264fb2f51528672dbca5f88cf85cdba536a51e8fed4cc00c","start":18}],"target_id":"concept.planetmath.subbasis","target_kind":"node","target_sha256":"0ad7c081e6b8318787952f36cff78e99e8132f37beb57b4f62b4e021cb57c2d8"}],"concept.planetmath.subcommutative":[{"id":"assertion.concept.planetmath.subcommutative","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subcommutative as stated in the captured PlanetMath entry subcommutative","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M25, 20M99) states: A semigroup ( S , ⋅ ) is said to be left subcommutative if for any two of its elements a and b , there exists its element c such that a ⁢ b = c ⁢ a .","support":[{"end":179,"quote":"A\nsemigroup\n(\nS\n,\n⋅\n)\nis said to be\nleft subcommutative\nif for any two of its elements\na\nand\nb\n, there exists its element\nc\nsuch that\na\n⁢\nb\n=\nc\n⁢\na\n.","source_id":"planetmath.subcommutative","source_sha256":"01e13f1c2e85170045ef760c92f47079f4520bd85f68c2771a491873929b3a71","start":30}],"target_id":"concept.planetmath.subcommutative","target_kind":"node","target_sha256":"7d9177f4a65be5786e4d3ff50b67db1b6e9b56965687d5e68a0a4a928046d1be"}],"concept.planetmath.subformula":[{"id":"assertion.concept.planetmath.subformula","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subformula as stated in the captured PlanetMath entry subformula","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let L be a first order language and suppose φ is a formula of L .","support":[{"end":87,"quote":"Let\nL\nbe a\nfirst order language\nand suppose\nφ\nis a\nformula\nof\nL\n.","source_id":"planetmath.subformula","source_sha256":"3e403021e309679cb251fd57077b6a1adc4bf8c3559e737715f060cc3a10dcdd","start":22}],"target_id":"concept.planetmath.subformula","target_kind":"node","target_sha256":"56a08b77af46a9130b6a7c625506ba2d2874f158733258548607b218088ca161"}],"concept.planetmath.subfunction":[{"id":"assertion.concept.planetmath.subfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subfunction as stated in the captured PlanetMath entry subfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 08A55, 03E20) states: Definition . Let f : A → B and g : C → D be partial functions .","support":[{"end":87,"quote":"Definition\n. Let\nf\n:\nA\n→\nB\nand\ng\n:\nC\n→\nD\nbe\npartial functions\n.","source_id":"planetmath.subfunction","source_sha256":"8f003f7a3d9f8848cb7cfb9f75d9d7c15eb34c8dc8d63ee7c66759a92f5213a3","start":24}],"target_id":"concept.planetmath.subfunction","target_kind":"node","target_sha256":"a0b51a3a5f3292fdcc6e4150438e0009c1a16e997f88820e185a0973702f54e8"}],"concept.planetmath.subgroup":[{"id":"assertion.concept.planetmath.subgroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subgroup as stated in the captured PlanetMath entry subgroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20A05) states: Definition: Let ( G , * ) be a group and let K be subset of G .","support":[{"end":81,"quote":"Definition:\nLet\n(\nG\n,\n*\n)\nbe a group and let\nK\nbe subset of\nG\n.","source_id":"planetmath.subgroup","source_sha256":"bc107f3ebbd708fbdf217d3c0623aed4c0d9853ee69e5c00ddbfe85002ed3448","start":18}],"target_id":"concept.planetmath.subgroup","target_kind":"node","target_sha256":"a803c09fec17945ee6ccd9c93e511eb0fe83237e9d00e5882c270aa421f43b63"}],"concept.planetmath.submanifold":[{"id":"assertion.concept.planetmath.submanifold","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Submanifold as stated in the captured PlanetMath entry submanifold","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 32V40, 53C40, 53B25, 57N99) states: There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","support":[{"end":134,"quote":"There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","source_id":"planetmath.submanifold","source_sha256":"427fa9c3d3261a10e212358655aa293593b0f8b5e10a02cd313b9f9e62954482","start":24}],"target_id":"concept.planetmath.submanifold","target_kind":"node","target_sha256":"61b87ab468cadd4dd202e47d3d0f097baed0573fa28878a65b61c20885bc60fb"}],"concept.planetmath.subspacetopology":[{"id":"assertion.concept.planetmath.subspacetopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subspace topology as stated in the captured PlanetMath entry subspacetopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54B05, 15A66, 11E88) states: Let X be a topological space , and let Y ⊂ X be a subset.","support":[{"end":93,"quote":"Let\nX\nbe a\ntopological space\n, and let\nY\n⊂\nX\nbe a subset.","source_id":"planetmath.subspacetopology","source_sha256":"a222c4cf2a2c6f893accff07dd6cf06454fdc90d1d515623359af251297e150f","start":36}],"target_id":"concept.planetmath.subspacetopology","target_kind":"node","target_sha256":"a356672dbd6079a7b0f415c909aef28784ccd002042583392e96df8c25283a86"}],"concept.planetmath.substitutability":[{"id":"assertion.concept.planetmath.substitutability","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substitutability as stated in the captured PlanetMath entry substitutability","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10, 03B05) states: In any logical system , the way to obtain (well-formed) formulas from existing ones is by attaching logical connectives to existing ones.","support":[{"end":171,"quote":"In any\nlogical system\n, the way to obtain (well-formed)\nformulas\nfrom existing ones is by attaching\nlogical connectives\nto existing ones.","source_id":"planetmath.substitutability","source_sha256":"52645abf43e534804a54d5282b1ac4139b3daa57d7e27992bebb0dd3b6822239","start":34}],"target_id":"concept.planetmath.substitutability","target_kind":"node","target_sha256":"c7a3945518db7efd0287d187b2e1add8e49b801fcbbf37ae0aea20075447dd35"}],"concept.planetmath.substitutionsinpropositionallogic":[{"id":"assertion.concept.planetmath.substitutionsinpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substitutions in propositional logic as stated in the captured PlanetMath entry substitutionsinpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B99) states: Uniform Substitution One area of mathematics where substitution plays a prominent role is mathematical logic.","support":[{"end":183,"quote":"Uniform Substitution\nOne area of mathematics where\nsubstitution\nplays a prominent role is mathematical logic.","source_id":"planetmath.substitutionsinpropositionallogic","source_sha256":"1e89b6a478960d2418f5d4c9faf97498d8356d7aabea684ac3690780ec40affd","start":74}],"target_id":"concept.planetmath.substitutionsinpropositionallogic","target_kind":"node","target_sha256":"fe8508ec9a5e3bd35d387003860d33c8436793e21c76f9a27ab8316727f2ec2d"}],"concept.planetmath.substructure":[{"id":"assertion.concept.planetmath.substructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Substructure as stated in the captured PlanetMath entry substructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 structures for Σ .","support":[{"end":85,"quote":"Let\nΣ\nbe a fixed\nsignature\n, and\n𝔄\nand\n𝔅\nstructures\nfor\nΣ\n.","source_id":"planetmath.substructure","source_sha256":"d8fd221fbd886df4f1b1d822e5afda10fea5078a5c3b1561d383f17fd6570bf7","start":26}],"target_id":"concept.planetmath.substructure","target_kind":"node","target_sha256":"a9af1634f6d16c6e71f00208ecd57adda7461c453231d5431df5ec1c3decfac6"}],"concept.planetmath.subtraction":[{"id":"assertion.concept.planetmath.subtraction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Subtraction as stated in the captured PlanetMath entry subtraction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A06, 00A05, 11B25) states: Subtraction is a mathematical operation in which the value of a number is decreased by the values of one or more other numbers.","support":[{"end":151,"quote":"Subtraction\nis a mathematical\noperation\nin which the value of a number is decreased by the values of one or more other numbers.","source_id":"planetmath.subtraction","source_sha256":"69f920b9fb837717d5e576bdec4574b35d943187974fe0ac4aee667df550caf0","start":24}],"target_id":"concept.planetmath.subtraction","target_kind":"node","target_sha256":"1cda9bd78c27a1f4a0c5bcde3cff7eb91702cf44dad6a06d8dc418f01081e9d3"}],"concept.planetmath.successor":[{"id":"assertion.concept.planetmath.successor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Successor as stated in the captured PlanetMath entry successor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10, 70K75) states: Given a set S , the successor of S is the set S ∪ { S } .","support":[{"end":77,"quote":"Given a set\nS\n, the\nsuccessor\nof\nS\nis the set\nS\n∪\n{\nS\n}\n.","source_id":"planetmath.successor","source_sha256":"10b03f69d292ffc970b9e1596ad4deb0a361e80ec386558664e211bb3ce328b7","start":20}],"target_id":"concept.planetmath.successor","target_kind":"node","target_sha256":"d8fa901e39a616399c4f238eea715fa7119db34b6cf912ca535d3696fc9fa04e"}],"concept.planetmath.summation":[{"id":"assertion.concept.planetmath.summation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Summation as stated in the captured PlanetMath entry summation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 11B25, 00A05) states: Sigma notation Sigma notation is often used to write complicated sums in a concise and compact way.","support":[{"end":119,"quote":"Sigma notation\nSigma notation\nis often used to write complicated sums in a concise and compact way.","source_id":"planetmath.summation","source_sha256":"4a178ef100d799211fa7e3ade380a2c3d9e38b6fe784c52ec0ef16c016f2b41c","start":20}],"target_id":"concept.planetmath.summation","target_kind":"node","target_sha256":"2b99f7052d54853eae89e11c3da0e99a9611cf5839d06901ee110f236d74c1c7"}],"concept.planetmath.surjective":[{"id":"assertion.concept.planetmath.surjective","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Surjective as stated in the captured PlanetMath entry surjective","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00) states: A function f : X → Y is called surjective or onto if, for every y ∈ Y , there is an x ∈ X such that f ⁢ ( x ) = y .","support":[{"end":137,"quote":"A\nfunction\nf\n:\nX\n→\nY\nis called\nsurjective\nor\nonto\nif, for every\ny\n∈\nY\n, there is an\nx\n∈\nX\nsuch that\nf\n⁢\n(\nx\n)\n=\ny\n.","source_id":"planetmath.surjective","source_sha256":"c65167780b32650905a82dfda136bd9bc6df64312f07348aa9f0f097fb8bf9e1","start":22}],"target_id":"concept.planetmath.surjective","target_kind":"node","target_sha256":"7305b12f79d8034abac08c8554a8eccf0523230de166d5f224462753aa4879b5"}],"concept.planetmath.symmetricdifference":[{"id":"assertion.concept.planetmath.symmetricdifference","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric difference as stated in the captured PlanetMath entry symmetricdifference","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: The symmetric difference between two sets A and B , written A ⁢ △ ⁢ B , is the set of all x such that either x ∈ A or x ∈ B but not both.","support":[{"end":179,"quote":"The\nsymmetric difference\nbetween two sets\nA\nand\nB\n, written\nA\n⁢\n△\n⁢\nB\n, is the set of all\nx\nsuch that either\nx\n∈\nA\nor\nx\n∈\nB\nbut not both.","source_id":"planetmath.symmetricdifference","source_sha256":"31d44c61a55c610026d01770e60693b8bc5fc479a522f524dd7b0090afe263de","start":42}],"target_id":"concept.planetmath.symmetricdifference","target_kind":"node","target_sha256":"9f2a6a6891d68acb94d0eabf844dfae303b54985426d558e41e245383f0e6447"}],"concept.planetmath.symmetricinversesemigroup":[{"id":"assertion.concept.planetmath.symmetricinversesemigroup","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric inverse semigroup as stated in the captured PlanetMath entry symmetricinversesemigroup","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20M18) states: Let X be a set. A partial map on X is an application defined from a subset of X into X .","support":[{"end":144,"quote":"Let\nX\nbe a set. A\npartial map\non\nX\nis an application defined from a subset of\nX\ninto\nX\n.","source_id":"planetmath.symmetricinversesemigroup","source_sha256":"fa08456ad4d126371fedf92416d16125231de1c3e10bbb34a762bf49c662a5b5","start":56}],"target_id":"concept.planetmath.symmetricinversesemigroup","target_kind":"node","target_sha256":"ed981b53f69adf3f6920a0f08730c26674e9ced8333974207de6732343589722"}],"concept.planetmath.symmetricmatrix":[{"id":"assertion.concept.planetmath.symmetricmatrix","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric matrix as stated in the captured PlanetMath entry symmetricmatrix","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Definition : Let A = ( a i ⁢ j ) be a square matrix of order n .","support":[{"end":98,"quote":"Definition\n:\nLet\nA\n=\n(\na\ni\n⁢\nj\n)\nbe a\nsquare matrix\nof\norder\nn\n.","source_id":"planetmath.symmetricmatrix","source_sha256":"1b2edc69e3d426a2f0b7298d9e4a6e10b1ce868553bc6f74c94557c0c550c98c","start":34}],"target_id":"concept.planetmath.symmetricmatrix","target_kind":"node","target_sha256":"c64421e6152977460341f4e36304a2cd85d4033ab59041b49d8dab80ad05ee58"}],"concept.planetmath.symmetricrelation":[{"id":"assertion.concept.planetmath.symmetricrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetric relation as stated in the captured PlanetMath entry symmetricrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is symmetric if and only if whenever x ⁢ ℛ ⁢ y for some x , y ∈ A then also y ⁢ ℛ ⁢ x .","support":[{"end":149,"quote":"A\nrelation\nℛ\non a set\nA\nis\nsymmetric\nif and only if\nwhenever\nx\n⁢\nℛ\n⁢\ny\nfor some\nx\n,\ny\n∈\nA\nthen also\ny\n⁢\nℛ\n⁢\nx\n.","source_id":"planetmath.symmetricrelation","source_sha256":"3bb6baddcbe1a65ebc172680f0b540dcf404fc930a75edbe8aacd76523063391","start":38}],"target_id":"concept.planetmath.symmetricrelation","target_kind":"node","target_sha256":"953afe939ede86770b47ec43db4459da6d0df499dd0a9b0b571c1c5c8192f7ea"}],"concept.planetmath.symmetry":[{"id":"assertion.concept.planetmath.symmetry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Symmetry as stated in the captured PlanetMath entry symmetry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 51A10, 15A04, 51A15) states: Let V be a Euclidean vector space , F ⊆ V , and E : V → V be a Euclidean transformation that is not the identity map .","support":[{"end":136,"quote":"Let\nV\nbe a\nEuclidean vector space\n,\nF\n⊆\nV\n, and\nE\n:\nV\n→\nV\nbe a\nEuclidean transformation\nthat is not the\nidentity map\n.","source_id":"planetmath.symmetry","source_sha256":"ac6748326da1160762ae945ac1507eda933238606d74d822d07030699efc16ce","start":18}],"target_id":"concept.planetmath.symmetry","target_kind":"node","target_sha256":"bb2f3254b49a52ff38fd74eab0a7a3ba2cfefd30d5e2b38d7febd066b74afbd5"}],"concept.planetmath.t3space":[{"id":"assertion.concept.planetmath.t3space","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"T3 space as stated in the captured PlanetMath entry t3space","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D10) states: A regular space is a topological space in which points and closed sets can be separated by open sets ; in other words, given a closed set A and a point x ∉ A , there are disjoint open sets U and V such that x ∈ U and A ⊆ V .","support":[{"end":242,"quote":"A\nregular space\nis a\ntopological space\nin which points and\nclosed sets\ncan be\nseparated\nby\nopen sets\n;\nin other words, given a closed set\nA\nand a point\nx\n∉\nA\n,\nthere are disjoint open sets\nU\nand\nV\nsuch that\nx\n∈\nU\nand\nA\n⊆\nV\n.","source_id":"planetmath.t3space","source_sha256":"bca96f50cb0cca3b8dc1381722b137d80e040779b09e7f3be79c8f1f63c805c2","start":18}],"target_id":"concept.planetmath.t3space","target_kind":"node","target_sha256":"61981b76f9ac5b1f92d5312d9142f314d8d9e208b895510630b7a8aac941f306"}],"concept.planetmath.tacitmultiplicationoperator":[{"id":"assertion.concept.planetmath.tacitmultiplicationoperator","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tacit multiplication operator as stated in the captured PlanetMath entry tacitmultiplicationoperator","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 11A99) states: A tacit multiplication operator is a multiplication operator not actually written in a formula but usually understood from the context , at least by humans.","support":[{"end":216,"quote":"A\ntacit multiplication operator\nis a\nmultiplication operator\nnot actually written in a formula but usually understood from the\ncontext\n, at least by humans.","source_id":"planetmath.tacitmultiplicationoperator","source_sha256":"2e9b291b169fd6d682cebc8d6d0c8739e4af0594dd85242c987949d13356e786","start":60}],"target_id":"concept.planetmath.tacitmultiplicationoperator","target_kind":"node","target_sha256":"7f506904cd295815fd6879296b50d520ab7a5b61e41660633950a5f39a3855a5"}],"concept.planetmath.tangentline":[{"id":"assertion.concept.planetmath.tangentline","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tangent line as stated in the captured PlanetMath entry tangentline","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26B05, 26A24) states: If the curve y = f ⁢ ( x ) of x ⁢ y -plane is sufficiently smooth in its point ( x 0 , y 0 ) and in a neighborhood of this, the curve may have a tangent line (or simply ) in ( x 0 , y 0 ) .","support":[{"end":215,"quote":"If the curve\ny\n=\nf\n⁢\n(\nx\n)\nof\nx\n⁢\ny\n-plane is sufficiently smooth in its point\n(\nx\n0\n,\ny\n0\n)\nand in a\nneighborhood\nof this, the curve may have a\ntangent line\n(or simply ) in\n(\nx\n0\n,\ny\n0\n)\n.","source_id":"planetmath.tangentline","source_sha256":"451cfd3d280f72c5a473bf9c619d2719b029242930e1eb934c9f551603fd6bb0","start":26}],"target_id":"concept.planetmath.tangentline","target_kind":"node","target_sha256":"8e0f1a6f8fa93629cda5cd228414dae7428bc81d89fc3e317ff06d2ee331dee5"}],"concept.planetmath.tautology":[{"id":"assertion.concept.planetmath.tautology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tautology as stated in the captured PlanetMath entry tautology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05, 03B10) states: A tautology is a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","support":[{"end":166,"quote":"A\ntautology\nis a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","source_id":"planetmath.tautology","source_sha256":"af957c6b40f4b1c0ee34d72a2da92e0824211ce1bf4aaaca25412a280633e0d3","start":20}],"target_id":"concept.planetmath.tautology","target_kind":"node","target_sha256":"5799d68a02f51c4fd5b240fba29675329428666f7fabce9a8179254fe816af5c"}],"concept.planetmath.tensorproduct":[{"id":"assertion.concept.planetmath.tensorproduct","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tensor product as stated in the captured PlanetMath entry tensorproduct","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13-00, 18-00) states: Summary. The tensor product is a formal bilinear multiplication of two modules or vector spaces .","support":[{"end":127,"quote":"Summary.\nThe\ntensor product\nis a formal\nbilinear\nmultiplication\nof two modules or\nvector spaces\n.","source_id":"planetmath.tensorproduct","source_sha256":"38c5b7c5ee9b7b8267a76c7f04bd6aef984fe287a07ed12ab829628fdf175ec0","start":30}],"target_id":"concept.planetmath.tensorproduct","target_kind":"node","target_sha256":"44dd5442faf807f45d34e8db01b069151e0e55aae11d569d0d1e9c3ce2874e6b"}],"concept.planetmath.tensorproductvectorspaces":[{"id":"assertion.concept.planetmath.tensorproductvectorspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tensor product (vector spaces) as stated in the captured PlanetMath entry tensorproductvectorspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A69) states: Definition . The classical conception of the tensor product operation involved finite dimensional vector spaces A , B , say over a field 𝕂 .","support":[{"end":202,"quote":"Definition\n.\nThe classical conception of the\ntensor product\noperation\ninvolved finite dimensional\nvector spaces\nA\n,\nB\n, say over\na field\n𝕂\n.","source_id":"planetmath.tensorproductvectorspaces","source_sha256":"5fb476fa33fef9fa33633ffa04fe067260012bf37ca3089844f84de9174d78c2","start":62}],"target_id":"concept.planetmath.tensorproductvectorspaces","target_kind":"node","target_sha256":"c15531e017a552586f761334eeaf7de1248a5d0be8e4350f38fe2a48bcba03a4"}],"concept.planetmath.textbookprojectsonplanetmath":[{"id":"assertion.concept.planetmath.textbookprojectsonplanetmath","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Textbook projects on PlanetMath as stated in the captured PlanetMath entry textbookprojectsonplanetmath","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: This will be a guide to textbook projects on PM. Since I don’t know if there currently are any textbook projects on PM, this is just a “stub” entry for now.","support":[{"end":220,"quote":"This will be a guide to textbook projects on PM. Since I don’t know\nif there currently are any textbook projects on PM, this is just a\n“stub” entry for now.","source_id":"planetmath.textbookprojectsonplanetmath","source_sha256":"a48229b3584bdf1864eaa6281d31e1440c0b95d20465ca8687442c86661d6274","start":64}],"target_id":"concept.planetmath.textbookprojectsonplanetmath","target_kind":"node","target_sha256":"7ea45e51742ae09ce8052ea859aa5c12632287239e65b32a6f05cff5c2b2015b"}],"concept.planetmath.theinclusionofclassicalintointuitionisticlogic":[{"id":"assertion.concept.planetmath.theinclusionofclassicalintointuitionisticlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"The inclusion of classical into intuitionistic logic as stated in the captured PlanetMath entry theinclusionofclassicalintointuitionisticlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 03B20, 03A05, 03-01) states: Abstract The entry is a report of Gödel’s 1933 first proof of the consistency of classical arithmetic by means of an interpretation of the basic concepts of intuitionistic logic .","support":[{"end":285,"quote":"Abstract\nThe entry is a report of\nGödel’s 1933\nfirst proof of the\nconsistency\nof classical\narithmetic\nby means of an\ninterpretation\nof the basic\nconcepts\nof\nintuitionistic logic\n.","source_id":"planetmath.theinclusionofclassicalintointuitionisticlogic","source_sha256":"99eb8ff68bd7d1fa9e62745915503a9be705cfbbab2b78217071be50df537293","start":106}],"target_id":"concept.planetmath.theinclusionofclassicalintointuitionisticlogic","target_kind":"node","target_sha256":"9f1654060f84921b861cd647ce523d04bf7b3aad45b6a7a0396ae56e9311c81f"}],"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics":[{"id":"assertion.concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topic entry on the algebraic foundations of mathematics as stated in the captured PlanetMath entry topicentryonthealgebraicfoundationsofmathematics","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 08A99, 08A70, 18E05, 18-00, 03-00, 08A05) states: This is a contributed topic on the algebraic foundations of mathematics .","support":[{"end":185,"quote":"This is a contributed topic on the\nalgebraic foundations of mathematics\n.","source_id":"planetmath.topicentryonthealgebraicfoundationsofmathematics","source_sha256":"bd62d5caf1a24593ce1ea664b721802a828589d18cb509763b06c12754fb93b8","start":112}],"target_id":"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","target_kind":"node","target_sha256":"ac805ca2af0c09f2141b721d633afb60b4b9188ec24608ca71b89e4df12333bd"}],"concept.planetmath.topicsinalgebraictopology":[{"id":"assertion.concept.planetmath.topicsinalgebraictopology","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topics in algebraic topology as stated in the captured PlanetMath entry topicsinalgebraictopology","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 57R19, 57N65, 11F23, 11E72, 18-00, 55N30, 55N15, 55N99, 55N40, 55N20, 55-01) states: 1 Algebraic topology topics 1.1 Introduction Algebraic topology (AT) utilizes algebraic approaches to solve topological problems, such as the classification of surfaces , proving duality theorems for manifolds and approximation theorems for topological spaces .","support":[{"end":319,"quote":"1\nAlgebraic topology topics\n1.1\nIntroduction\nAlgebraic topology\n(AT) utilizes\nalgebraic\napproaches to solve topological problems,\nsuch as the classification of\nsurfaces\n, proving duality theorems for\nmanifolds\nand\napproximation theorems for topological spaces\n.","source_id":"planetmath.topicsinalgebraictopology","source_sha256":"e3c02ec134fa74cc757e7c504270f1d94a405e5f54474ced4e2e3f9141f2d799","start":58}],"target_id":"concept.planetmath.topicsinalgebraictopology","target_kind":"node","target_sha256":"a16117d37152d2b9489779c15efd1afe0e86e5446f0b72d70618684b8f9170ff"}],"concept.planetmath.topologicalspace":[{"id":"assertion.concept.planetmath.topologicalspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topological space as stated in the captured PlanetMath entry topologicalspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 22-00, 55-00, 54-00) states: A topological space is a set X together with a set 𝒯 whose elements are subsets of X , such that • ∅ ∈ 𝒯 • X ∈ 𝒯 • If U j ∈ 𝒯 for all j ∈ J , then ⋃ j ∈ J U j ∈ 𝒯 • If U ∈ 𝒯 and V ∈ 𝒯 , then U ∩ V ∈ 𝒯 Elements of 𝒯 are called open sets of X .","support":[{"end":278,"quote":"A\ntopological space\nis a set\nX\ntogether with a set\n𝒯\nwhose\nelements\nare subsets of\nX\n, such that\n•\n∅\n∈\n𝒯\n•\nX\n∈\n𝒯\n•\nIf\nU\nj\n∈\n𝒯\nfor all\nj\n∈\nJ\n, then\n⋃\nj\n∈\nJ\nU\nj\n∈\n𝒯\n•\nIf\nU\n∈\n𝒯\nand\nV\n∈\n𝒯\n, then\nU\n∩\nV\n∈\n𝒯\nElements of\n𝒯\nare called\nopen sets\nof\nX\n.","source_id":"planetmath.topologicalspace","source_sha256":"08da0ef4f3b09372c75b4e6f325b8fd7b52d5e78da74528dcbf840422ca8c1b2","start":36}],"target_id":"concept.planetmath.topologicalspace","target_kind":"node","target_sha256":"48af7e84512652721f6d1c0fea56cc4e98e63691c3a9c7ef9ed080369a5623ba"}],"concept.planetmath.topologicalvectorspace":[{"id":"assertion.concept.planetmath.topologicalvectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topological vector space as stated in the captured PlanetMath entry topologicalvectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46A99) states: Definition A topological vector space is a pair ( V , 𝒯 ) , where V is a vector space over a topological field K , and 𝒯 is a topology on V such that under 𝒯 the scalar multiplication ( λ , v ) ↦ λ ⁢ v is a continuous function K × V → V and the vector addition ( v , w ) ↦ v + w is a continuous function V × V → V , where K × V and V × V are given the respective product topologies .","support":[{"end":433,"quote":"Definition\nA\ntopological vector space\nis a pair\n(\nV\n,\n𝒯\n)\n,\nwhere\nV\nis a\nvector space\nover a\ntopological field\nK\n,\nand\n𝒯\nis a\ntopology\non\nV\nsuch that under\n𝒯\nthe\nscalar multiplication\n(\nλ\n,\nv\n)\n↦\nλ\n⁢\nv\nis a\ncontinuous function\nK\n×\nV\n→\nV\nand the\nvector addition\n(\nv\n,\nw\n)\n↦\nv\n+\nw\nis a continuous function\nV\n×\nV\n→\nV\n,\nwhere\nK\n×\nV\nand\nV\n×\nV\nare given the respective\nproduct topologies\n.","source_id":"planetmath.topologicalvectorspace","source_sha256":"06c08d3a7be7cf64260c4699922575d2c5a6ab301eedaa622e7ed31f4f3de544","start":50}],"target_id":"concept.planetmath.topologicalvectorspace","target_kind":"node","target_sha256":"0f5d3e891f3e77f42e4ebd5888dd25462166d8bfabbe73779a4c0674823966cb"}],"concept.planetmath.topologyofthecomplexplane":[{"id":"assertion.concept.planetmath.topologyofthecomplexplane","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Topology of the complex plane as stated in the captured PlanetMath entry topologyofthecomplexplane","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35, 30-00) states: The usual topology for the complex plane ℂ is the topology induced by the metric d ⁢ ( x , y ) := | x - y | for x , y ∈ ℂ .","support":[{"end":183,"quote":"The\nusual topology\nfor the\ncomplex plane\nℂ\nis the\ntopology\ninduced by the metric\nd\n⁢\n(\nx\n,\ny\n)\n:=\n|\nx\n-\ny\n|\nfor\nx\n,\ny\n∈\nℂ\n.","source_id":"planetmath.topologyofthecomplexplane","source_sha256":"84a9d441f0e43a480c002f3150cf263f335a468b648c396378a98f2499cede91","start":60}],"target_id":"concept.planetmath.topologyofthecomplexplane","target_kind":"node","target_sha256":"01aa33cba92123822406876507a9204f6f1b3d06720cd53b6e433b442d7cb398"}],"concept.planetmath.totaldifferential":[{"id":"assertion.concept.planetmath.totaldifferential","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Total differential as stated in the captured PlanetMath entry totaldifferential","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 53A04, 26B05, 01A45) states: There is the generalisation of the theorem in the parent entry ( http:// planetmath .org/ Differential ) concerning the real functions of several variables; here we formulate it for three variables: Theorem.","support":[{"end":245,"quote":"There is the generalisation of the theorem in the parent entry (\nhttp://\nplanetmath\n.org/\nDifferential\n) concerning the\nreal functions\nof several variables; here we formulate it for three variables:\nTheorem.","source_id":"planetmath.totaldifferential","source_sha256":"11b9e5e42cb5a1f8c78a556ae21c1d3d7b54d9f643e481bca8005f51b93ca1d3","start":38}],"target_id":"concept.planetmath.totaldifferential","target_kind":"node","target_sha256":"a57d769fd5d997ff55aab60cf20f3ee736710ed9801d29e18a27679db8035eda"}],"concept.planetmath.toytheorem":[{"id":"assertion.concept.planetmath.toytheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Toy theorem as stated in the captured PlanetMath entry toytheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00-01) states: A toy theorem is a simplified version of a more general theorem .","support":[{"end":89,"quote":"A\ntoy theorem\nis a simplified version of a more general\ntheorem\n.","source_id":"planetmath.toytheorem","source_sha256":"77712fc06c02a31362cd290e5f72c33c44d06b99700be111369db94ba237aa4a","start":24}],"target_id":"concept.planetmath.toytheorem","target_kind":"node","target_sha256":"aeed5686028db9af608dbee49c8ce68ddda22ce3a918da5e100e1d1d3297f477"}],"concept.planetmath.traceable":[{"id":"assertion.concept.planetmath.traceable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Traceable as stated in the captured PlanetMath entry traceable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 05C45, 03B22, 03-00, 03-01) states: Let G be a graph. If G has a Hamiltonian path , we say that G is traceable .","support":[{"end":96,"quote":"Let\nG\nbe a graph. If\nG\nhas a\nHamiltonian path\n, we say that\nG\nis\ntraceable\n.","source_id":"planetmath.traceable","source_sha256":"6055fd35b610031c95c70ce0f549218e3c93fdc0dfe6ea856d16644e2f10c24f","start":20}],"target_id":"concept.planetmath.traceable","target_kind":"node","target_sha256":"eb7415e0b26936642062df37f1ee90cd26ca8815e81e96d5629de3363e9bbe2b"}],"concept.planetmath.transformation":[{"id":"assertion.concept.planetmath.transformation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transformation as stated in the captured PlanetMath entry transformation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: Synonym of mapping and function . Often used to refer to mappings where the domain and codomain are the same set, i.e.","support":[{"end":148,"quote":"Synonym of\nmapping\nand\nfunction\n. Often used to refer to mappings where the domain and\ncodomain are the same set, i.e.","source_id":"planetmath.transformation","source_sha256":"bd57c2f2d4219b8ceb81e9d73dbb4dfcc96c1d020fbd4f7f75815864305dc2f3","start":30}],"target_id":"concept.planetmath.transformation","target_kind":"node","target_sha256":"9525a8f42ed65b994bfcbeb3d5ea4a195ac8189fba3cbb6fb705aa55770532d8"}],"concept.planetmath.transitiverelation":[{"id":"assertion.concept.planetmath.transitiverelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transitive relation as stated in the captured PlanetMath entry transitiverelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is transitive if and only if ∀ x , y , z ∈ A , ( x ⁢ ℛ ⁢ y ∧ y ⁢ ℛ ⁢ z ) → ( x ⁢ ℛ ⁢ z ) .","support":[{"end":154,"quote":"A\nrelation\nℛ\non a set\nA\nis\ntransitive\nif and only if\n∀\nx\n,\ny\n,\nz\n∈\nA\n,\n(\nx\n⁢\nℛ\n⁢\ny\n∧\ny\n⁢\nℛ\n⁢\nz\n)\n→\n(\nx\n⁢\nℛ\n⁢\nz\n)\n.","source_id":"planetmath.transitiverelation","source_sha256":"89019ae1c6123fd2d9a8089f820d4b807eb44d6845521fa575a91f40fafada12","start":40}],"target_id":"concept.planetmath.transitiverelation","target_kind":"node","target_sha256":"eab3930aaf2552c32d0c13de2d317d544a8ad78467ffc8b6e3f6cfafb69025f8"}],"concept.planetmath.transpose":[{"id":"assertion.concept.planetmath.transpose","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transpose as stated in the captured PlanetMath entry transpose","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A57) states: The transpose of a matrix A is the matrix formed by “flipping” A about the diagonal line from the upper left corner.","support":[{"end":136,"quote":"The\ntranspose\nof a matrix\nA\nis the matrix formed by “flipping”\nA\nabout the\ndiagonal\nline from the upper left corner.","source_id":"planetmath.transpose","source_sha256":"6d1c69f24a3326d4e5b56018657bde2d03667f57ef69f92e553727920b6ca052","start":20}],"target_id":"concept.planetmath.transpose","target_kind":"node","target_sha256":"e545ef868eac55851b2efdc4371b8c41584f58806653a44ce237348e888add9e"}],"concept.planetmath.transposition":[{"id":"assertion.concept.planetmath.transposition","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transposition as stated in the captured PlanetMath entry transposition","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Given a finite set X = { a 1 , a 2 , … , a n } , a transposition is a permutation ( bijective function of X onto itself) f such that there exist indices i , j such that f ⁢ ( a i ) = a j , f ⁢ ( a j ) = a i and f ⁢ ( a k ) = a k for all other indices k .","support":[{"end":282,"quote":"Given a\nfinite set\nX\n=\n{\na\n1\n,\na\n2\n,\n…\n,\na\nn\n}\n, a\ntransposition\nis a\npermutation\n(\nbijective function\nof\nX\nonto itself)\nf\nsuch that there exist indices\ni\n,\nj\nsuch that\nf\n⁢\n(\na\ni\n)\n=\na\nj\n,\nf\n⁢\n(\na\nj\n)\n=\na\ni\nand\nf\n⁢\n(\na\nk\n)\n=\na\nk\nfor all other indices\nk\n.","source_id":"planetmath.transposition","source_sha256":"7baa71b0a04ee558fa07417a585e0297fe23882751934df0f71334a4a5d4e2de","start":28}],"target_id":"concept.planetmath.transposition","target_kind":"node","target_sha256":"ddb4cfa1b23307c1d62df6edfd8e65a16c8b8ba5bb8f8a7ada0c131223060787"}],"concept.planetmath.treesettheoretic":[{"id":"assertion.concept.planetmath.treesettheoretic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tree (set theoretic) as stated in the captured PlanetMath entry treesettheoretic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E05) states: In a set , a tree is defined to be a set T and a relation < T ⊆ T × T such that: • < T is a partial ordering of T • For any t ∈ T , { s ∈ T ∣ s < T t } is well-ordered The nodes (elements of the tree) immediately greater than a node are termed its children , the node immediately less is its parent (if it exists), any node less is an ancestor and any node greater is a descendant .","support":[{"end":424,"quote":"In a set , a\ntree\nis defined to be a set\nT\nand a\nrelation\n<\nT\n⊆\nT\n×\nT\nsuch that:\n•\n<\nT\nis a\npartial ordering\nof\nT\n•\nFor any\nt\n∈\nT\n,\n{\ns\n∈\nT\n∣\ns\n<\nT\nt\n}\nis\nwell-ordered\nThe nodes (elements of the tree) immediately greater than a node are termed its\nchildren\n, the node immediately less is its\nparent\n(if it exists), any node less is an\nancestor\nand any node greater is a\ndescendant\n.","source_id":"planetmath.treesettheoretic","source_sha256":"e9323bc0d0f01ef78931746e2a9c27f87d379d7bba843b0fba80a9d6d2935c4a","start":42}],"target_id":"concept.planetmath.treesettheoretic","target_kind":"node","target_sha256":"008a3ded31c364f4ff5478362fcc327d87414deffec95fa5dc937c22b9302fa5"}],"concept.planetmath.triadicrelation":[{"id":"assertion.concept.planetmath.triadicrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Triadic relation as stated in the captured PlanetMath entry triadicrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: In logic, mathematics, and semiotics, a triadic relation is an important special case of a polyadic or finitary relation, one in which the number of places in the relation is three.","support":[{"end":215,"quote":"In logic, mathematics, and semiotics, a\ntriadic relation\nis an important special case of a\npolyadic\nor finitary relation, one in which the number of places in the\nrelation\nis three.","source_id":"planetmath.triadicrelation","source_sha256":"0917c1c3aad02b4a33674e5ce2ed19ec3b45d3ceadc7cfdc05c5c94b2ebf40ba","start":34}],"target_id":"concept.planetmath.triadicrelation","target_kind":"node","target_sha256":"d4403e2c5c67bc9a6638cf5bc18753ecf69598efc5ba5563eef628c48a170a39"}],"concept.planetmath.trigonometry":[{"id":"assertion.concept.planetmath.trigonometry","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Trigonometry as stated in the captured PlanetMath entry trigonometry","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (topic entry, MSC 43-00, 51-00, 42-00, 33B10) states: 1 Geometrical definitions Trigonometry arose in ancient times out of attempts to measure the lengths of various lines associated with circles.","support":[{"end":168,"quote":"1\nGeometrical definitions\nTrigonometry\narose in ancient times out of attempts to measure the lengths of various lines associated with circles.","source_id":"planetmath.trigonometry","source_sha256":"f4a761a7c046d6efd6b7ce8f8f8ce5d26d1509d271d97f7d8515e85b6fb9dbce","start":26}],"target_id":"concept.planetmath.trigonometry","target_kind":"node","target_sha256":"43c649f6154e3c6162979ae7b49a763a61679d8a82117aeaab4b8c891e3dda49"}],"concept.planetmath.truthfunction":[{"id":"assertion.concept.planetmath.truthfunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth function as stated in the captured PlanetMath entry truthfunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: A truth function is a function that returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","support":[{"end":178,"quote":"A\ntruth function\nis a\nfunction\nthat returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","source_id":"planetmath.truthfunction","source_sha256":"52a0e7ba60e440dfeed593c1b20e6b07f798004c8a6a9773c5c50d0077d4f151","start":30}],"target_id":"concept.planetmath.truthfunction","target_kind":"node","target_sha256":"8781b657c0fde59f4d6c785eced90cc65620d1f420d6388dd462a3b17a24bdfa"}],"concept.planetmath.truthtable":[{"id":"assertion.concept.planetmath.truthtable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth table as stated in the captured PlanetMath entry truthtable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03-00, 34C29) states: A truth table is a tabular listing of all possible input value combinations for a logical function and their corresponding output values.","support":[{"end":161,"quote":"A\ntruth table\nis a tabular listing of all possible input value\ncombinations\nfor a logical\nfunction\nand their corresponding output values.","source_id":"planetmath.truthtable","source_sha256":"5ac52c74ac1098e84df4eb4087585c93ee694fd775c866f0e8b9d421362227d3","start":24}],"target_id":"concept.planetmath.truthtable","target_kind":"node","target_sha256":"4c0be2b0a44a2df3d96902d67be612751aa553444e565c8d6970953b8a323232"}],"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic":[{"id":"assertion.concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Truth-value semantics for classical propositional logic as stated in the captured PlanetMath entry truthvaluesemanticsforclassicalpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B05) states: In classical propositional logic , an interpretation of a well-formed formula (wff) p is an assignment of truth (=1) or falsity (=0) to p .","support":[{"end":251,"quote":"In classical\npropositional logic\n, an\ninterpretation\nof a\nwell-formed formula\n(wff)\np\nis an assignment of truth (=1) or falsity (=0) to\np\n.","source_id":"planetmath.truthvaluesemanticsforclassicalpropositionallogic","source_sha256":"883caeeeadd90e3eccf17baff8c552fee643b346ae85e6db27cd9cbf7e0dadf1","start":112}],"target_id":"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","target_kind":"node","target_sha256":"eb7e381e7936536585f2c36643cec4a3dea3f3184213910495ffb83331db9f20"}],"concept.planetmath.turingcomputable":[{"id":"assertion.concept.planetmath.turingcomputable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Turing computable as stated in the captured PlanetMath entry turingcomputable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03D10, 68Q05) states: A function is Turing computable if the function’s value can be computed with a Turing machine .","support":[{"end":131,"quote":"A\nfunction\nis\nTuring computable\nif the function’s value can be\ncomputed with a\nTuring machine\n.","source_id":"planetmath.turingcomputable","source_sha256":"511471a3de3dbe0a4fbddddbb766ba53fd4b77daf87a3cc1121a620feb1415cd","start":36}],"target_id":"concept.planetmath.turingcomputable","target_kind":"node","target_sha256":"93a0e58677d67afe873cf641cca442bdfe7a95a3ead68c656b5d4218738fb6e5"}],"concept.planetmath.tychonoffspace":[{"id":"assertion.concept.planetmath.tychonoffspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Tychonoff space as stated in the captured PlanetMath entry tychonoffspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D15) states: A topological space X is said to be completely regular if whenever C ⊆ X is closed and x ∈ X ∖ C then there is a continuous function f : X → [ 0 , 1 ] with f ⁢ ( x ) = 0 and f ⁢ ( C ) ⊆ { 1 } .","support":[{"end":225,"quote":"A\ntopological space\nX\nis said to be\ncompletely regular\nif whenever\nC\n⊆\nX\nis closed and\nx\n∈\nX\n∖\nC\nthen there is a\ncontinuous function\nf\n:\nX\n→\n[\n0\n,\n1\n]\nwith\nf\n⁢\n(\nx\n)\n=\n0\nand\nf\n⁢\n(\nC\n)\n⊆\n{\n1\n}\n.","source_id":"planetmath.tychonoffspace","source_sha256":"d3a9afbc6b7cf95d4286e2913182f0373162f5589eb7590b76159f46bad9e915","start":32}],"target_id":"concept.planetmath.tychonoffspace","target_kind":"node","target_sha256":"da2b94d0b1ec8ad313d1bc265344a390672f14c9bd40b33fd39e4dbfa80423bb"}],"concept.planetmath.ultraconnectedspace":[{"id":"assertion.concept.planetmath.ultraconnectedspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ultraconnected space as stated in the captured PlanetMath entry ultraconnectedspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be ultraconnected if no pair of nonempty closed sets of X is disjoint.","support":[{"end":145,"quote":"A\ntopological space\nX\nis said to be\nultraconnected\nif no pair of nonempty\nclosed sets\nof\nX\nis disjoint.","source_id":"planetmath.ultraconnectedspace","source_sha256":"3f4fefd9dff0ef45c9aca7adf91e520781d540294780291fbba7bdd34373172b","start":42}],"target_id":"concept.planetmath.ultraconnectedspace","target_kind":"node","target_sha256":"375357f47c7a47395de8af848744e12539189f3ca2d9ca6018067051edf78569"}],"concept.planetmath.ultrametric":[{"id":"assertion.concept.planetmath.ultrametric","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Ultrametric as stated in the captured PlanetMath entry ultrametric","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E35) states: Any metric d : X × X → ℝ on a set X must satisfy the triangle inequality : ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ d ⁢ ( x , y ) + d ⁢ ( y , z ) An ultrametric must additionally satisfy a stronger version of the triangle inequality: ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ max ⁡ { d ⁢ ( x , y ) , d ⁢ ( y , z ) } Here is an example of an ultrametric on a space with 5 points, labelled a , b , c , d , e : a b c d e a 0 12 4 6 12 b 0 12 12 5 c 0 6 12 d 0 12 e 0 In the table above, an entry n in the for element x and the for element y indicates that d ⁢ ( x , y ) = n , where d is the ultrametric.","support":[{"end":607,"quote":"Any metric\nd\n:\nX\n×\nX\n→\nℝ\non a set\nX\nmust\nsatisfy\nthe\ntriangle inequality\n:\n(\n∀\nx\n,\ny\n,\nz\n)\nd\n⁢\n(\nx\n,\nz\n)\n≤\nd\n⁢\n(\nx\n,\ny\n)\n+\nd\n⁢\n(\ny\n,\nz\n)\nAn\nultrametric\nmust additionally satisfy a\nstronger\nversion of the triangle inequality:\n(\n∀\nx\n,\ny\n,\nz\n)\nd\n⁢\n(\nx\n,\nz\n)\n≤\nmax\n⁡\n{\nd\n⁢\n(\nx\n,\ny\n)\n,\nd\n⁢\n(\ny\n,\nz\n)\n}\nHere is an example of an ultrametric on a space with 5 points, labelled\na\n,\nb\n,\nc\n,\nd\n,\ne\n:\na\nb\nc\nd\ne\na\n0\n12\n4\n6\n12\nb\n0\n12\n12\n5\nc\n0\n6\n12\nd\n0\n12\ne\n0\nIn the table above, an entry\nn\nin the  for\nelement\nx\nand the  for element\ny\nindicates that\nd\n⁢\n(\nx\n,\ny\n)\n=\nn\n, where\nd\nis the ultrametric.","source_id":"planetmath.ultrametric","source_sha256":"e23412232c00479811946e18c100b3316694a1a09649946dd7b57527d8689541","start":24}],"target_id":"concept.planetmath.ultrametric","target_kind":"node","target_sha256":"d37e07286df3435c0a057fc50824630ba96ed2612be067c702a0305a79c0e3ec"}],"concept.planetmath.uncountable":[{"id":"assertion.concept.planetmath.uncountable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Uncountable as stated in the captured PlanetMath entry uncountable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: Definition A set is uncountable if it is not countable .","support":[{"end":80,"quote":"Definition\nA set is\nuncountable\nif it is not\ncountable\n.","source_id":"planetmath.uncountable","source_sha256":"39ef5804305608036b963862cfff8166cdf73735630f6d0ba48fa891e7031220","start":24}],"target_id":"concept.planetmath.uncountable","target_kind":"node","target_sha256":"e9287a60ec2b1d3b3135bb348d07744ffffa11a5b1d53c6abefb7e17c5bfe919"}],"concept.planetmath.uniformspace":[{"id":"assertion.concept.planetmath.uniformspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Uniform space as stated in the captured PlanetMath entry uniformspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 54E15) states: A uniform structure (or uniformity ) on a set X is a non empty set 𝒰 of subsets of X × X which satisfies the following axioms: 1.","support":[{"end":157,"quote":"A\nuniform structure\n(or\nuniformity\n) on a set\nX\nis a non\nempty set\n𝒰\nof subsets of\nX\n×\nX\nwhich\nsatisfies\nthe following axioms:\n1.","source_id":"planetmath.uniformspace","source_sha256":"7b5cdf2e89b74bae63e39f76ccd32991c2181649e7e48640962e27c19e23aafa","start":28}],"target_id":"concept.planetmath.uniformspace","target_kind":"node","target_sha256":"588494af3090c4ae7062c1faa6a6e6e3900eeacf6bdea4d99e2b0fd2d830178c"}],"concept.planetmath.unitvector":[{"id":"assertion.concept.planetmath.unitvector","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Unit vector as stated in the captured PlanetMath entry unitvector","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A03) states: A unit vector is a unit-length element of Euclidean space .","support":[{"end":83,"quote":"A\nunit vector\nis a unit-length element of\nEuclidean space\n.","source_id":"planetmath.unitvector","source_sha256":"2731aa4e4e4507ab1317fe2998c9517d964d19ee465eb1b78e3d977b310c3146","start":24}],"target_id":"concept.planetmath.unitvector","target_kind":"node","target_sha256":"fadef249fe1efdbf3871d32fab7e1503cb4c64f8d5ba3b53cd973d229dec839b"}],"concept.planetmath.universalbundle":[{"id":"assertion.concept.planetmath.universalbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal bundle as stated in the captured PlanetMath entry universalbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R10, 55R15) states: Let G be a topological group . A universal bundle for G is a principal bundle p : E ⁢ G → B ⁢ G such that for any principal bundle π : E → B , with B a CW-complex , there is a map φ : B → B ⁢ G , unique up to homotopy , such that the pullback bundle φ * ⁢ ( p ) is equivalent to π , that is such that there is a bundle map φ ′ .","support":[{"end":362,"quote":"Let\nG\nbe a\ntopological group\n. A\nuniversal bundle\nfor\nG\nis a\nprincipal bundle\np\n:\nE\n⁢\nG\n→\nB\n⁢\nG\nsuch that for any principal bundle\nπ\n:\nE\n→\nB\n, with\nB\na\nCW-complex\n, there is a map\nφ\n:\nB\n→\nB\n⁢\nG\n, unique up to\nhomotopy\n, such that the\npullback bundle\nφ\n*\n⁢\n(\np\n)\nis\nequivalent\nto\nπ\n, that is such that there is a\nbundle map\nφ\n′\n.","source_id":"planetmath.universalbundle","source_sha256":"97179618927595044772eee69ea8650898108e41f4687cf1acdfbfbd262589b8","start":34}],"target_id":"concept.planetmath.universalbundle","target_kind":"node","target_sha256":"fb00b2ef4fb3342e76b87622eb3c40fbfed2b20231074627442f7a613727b65c"}],"concept.planetmath.universalrelation":[{"id":"assertion.concept.planetmath.universalrelation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal relation as stated in the captured PlanetMath entry universalrelation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B10) states: If Φ is a class of n -ary relations with x → as the only free variables , an n + 1 -ary formula ψ is universal for Φ if for any ϕ ∈ Φ there is some e such that ψ ⁢ ( e , x → ) ↔ ϕ ⁢ ( x → ) .","support":[{"end":229,"quote":"If\nΦ\nis a class of\nn\n-ary\nrelations\nwith\nx\n→\nas the only\nfree variables\n, an\nn\n+\n1\n-ary\nformula\nψ\nis\nuniversal\nfor\nΦ\nif for any\nϕ\n∈\nΦ\nthere is some\ne\nsuch that\nψ\n⁢\n(\ne\n,\nx\n→\n)\n↔\nϕ\n⁢\n(\nx\n→\n)\n.","source_id":"planetmath.universalrelation","source_sha256":"af0ae9fa57c40fbb0fc52afd063fb21fde4276903fa87c8374be0a0cd9e0cdd3","start":38}],"target_id":"concept.planetmath.universalrelation","target_kind":"node","target_sha256":"29b5443ab2acea96f1352c3f87e02e5d2494459543a988d64c009c62dc31890e"}],"concept.planetmath.universalstructure":[{"id":"assertion.concept.planetmath.universalstructure","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universal structure as stated in the captured PlanetMath entry universalstructure","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03C50, 03C52) states: Let L be a first order language , and let R be an elementary class of L - structures .","support":[{"end":126,"quote":"Let\nL\nbe a\nfirst order language\n, and let\nR\nbe an\nelementary class\nof\nL\n-\nstructures\n.","source_id":"planetmath.universalstructure","source_sha256":"6c56fb5ac30e09d314f5193846e130bc1ff8821345a6cfae8bbbae8efcdd0a4b","start":40}],"target_id":"concept.planetmath.universalstructure","target_kind":"node","target_sha256":"975326834a6ae042567859efaf10796efd034d0644bb0d0946f0aaa662cf1d2a"}],"concept.planetmath.universeofdiscourse":[{"id":"assertion.concept.planetmath.universeofdiscourse","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Universe of discourse as stated in the captured PlanetMath entry universeofdiscourse","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03B48, 03B05, 03A05, 03G05) states: \\PMlinkescapephrase field \\PMlinkescapephrase Field \\PMlinkescapephrase limit \\PMlinkescapephrase Limit \\PMlinkescapephrase object \\PMlinkescapephrase Object \\PMlinkescapephrase objects \\PMlinkescapephrase Objects Boole (1854) defines universe of discourse in the following manner: In every discourse, whether of the mind conversing with its own thoughts, or of the individual in his intercourse with others, there is an assumed or expressed limit within which the subjects of its operation are confined.","support":[{"end":548,"quote":"\\PMlinkescapephrase\nfield\n\\PMlinkescapephrase\nField\n\\PMlinkescapephrase\nlimit\n\\PMlinkescapephrase\nLimit\n\\PMlinkescapephrase\nobject\n\\PMlinkescapephrase\nObject\n\\PMlinkescapephrase\nobjects\n\\PMlinkescapephrase\nObjects\nBoole (1854) defines\nuniverse of discourse\nin the following manner:\nIn every discourse, whether of the mind conversing with its own thoughts, or of the\nindividual\nin his intercourse with others, there is an assumed or expressed limit within which the subjects of its\noperation\nare confined.","source_id":"planetmath.universeofdiscourse","source_sha256":"2a8344b64f6c90ca356fbb19c9fc7df8d628135b1dd7681a0187f2b2d877bf1f","start":44}],"target_id":"concept.planetmath.universeofdiscourse","target_kind":"node","target_sha256":"e8cc8b36654295ac5689a37298efd7dedbf1ba02eb0a3b26fcce8bf0f4ad95bc"}],"concept.planetmath.variable":[{"id":"assertion.concept.planetmath.variable","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Variable as stated in the captured PlanetMath entry variable","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: The word variable as used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the context .","support":[{"end":189,"quote":"The word\nvariable\nas used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the\ncontext\n.","source_id":"planetmath.variable","source_sha256":"9404e0b0e188ac71e885f70730c5472662cb7dcdc0dcfd07d4f5cb71cea6d73e","start":18}],"target_id":"concept.planetmath.variable","target_kind":"node","target_sha256":"f7679d92c6b90909aa31dfb88c05fed5060f70ec14e59ca08aa48a0838141ae3"}],"concept.planetmath.vectorbundle":[{"id":"assertion.concept.planetmath.vectorbundle","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector bundle as stated in the captured PlanetMath entry vectorbundle","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 55R25) states: Basic definition A vector bundle is a fiber bundle having a vector space as a fiber and the general linear group of that vector space (or some subgroup ) as structure group.","support":[{"end":201,"quote":"Basic definition\nA\nvector bundle\nis a\nfiber bundle\nhaving a\nvector space\nas a fiber and the\ngeneral linear group\nof that vector space (or some\nsubgroup\n) as structure group.","source_id":"planetmath.vectorbundle","source_sha256":"2233d52cf1fb75cca43377f7bc94c875453671449b8af2dd359381125ae588c7","start":28}],"target_id":"concept.planetmath.vectorbundle","target_kind":"node","target_sha256":"5d78c0330119236851f8e9e1c2620496bca575079a4574199f41f0422de0f0e3"}],"concept.planetmath.vectorfield":[{"id":"assertion.concept.planetmath.vectorfield","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector field as stated in the captured PlanetMath entry vectorfield","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46E40) states: Vector fields in ℝ n Definition . A vector field v on some open set U ⊂ R n is a function which associates a vector v ⁢ ( x ) to each point x of U .","support":[{"end":174,"quote":"Vector fields in\nℝ\nn\nDefinition\n.\nA\nvector field\nv\non some open set\nU\n⊂\nR\nn\nis a\nfunction\nwhich associates a vector\nv\n⁢\n(\nx\n)\nto each point\nx\nof\nU\n.","source_id":"planetmath.vectorfield","source_sha256":"c2e20acac80258dc2499ebecf8864bf4e8c0333cf34aea041184a4c906f5a9d4","start":26}],"target_id":"concept.planetmath.vectorfield","target_kind":"node","target_sha256":"7dd9a51bb941e9aa5c26c756b7f350d5c5c2eae270ac869551d1ed47597a2663"}],"concept.planetmath.vectornorm":[{"id":"assertion.concept.planetmath.vectornorm","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector norm as stated in the captured PlanetMath entry vectornorm","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 46B20, 18-01, 20H15, 20B30) states: A vector norm on the real vector space V is a function f : V → ℝ that satisfies the following properties: f ⁢ ( x ) = 0 ⇔ x = 0 f ⁢ ( x ) ≥ 0 x ∈ V f ⁢ ( x + y ) ≤ f ⁢ ( x ) + f ⁢ ( y ) x , y ∈ V f ⁢ ( α ⁢ x ) = | α | ⁢ f ⁢ ( x ) α ∈ ℝ , x ∈ V Such a function is denoted as || x || .","support":[{"end":307,"quote":"A\nvector norm\non the\nreal vector space\nV\nis a function\nf\n:\nV\n→\nℝ\nthat satisfies the following properties:\nf\n⁢\n(\nx\n)\n=\n0\n⇔\nx\n=\n0\nf\n⁢\n(\nx\n)\n≥\n0\nx\n∈\nV\nf\n⁢\n(\nx\n+\ny\n)\n≤\nf\n⁢\n(\nx\n)\n+\nf\n⁢\n(\ny\n)\nx\n,\ny\n∈\nV\nf\n⁢\n(\nα\n⁢\nx\n)\n=\n|\nα\n|\n⁢\nf\n⁢\n(\nx\n)\nα\n∈\nℝ\n,\nx\n∈\nV\nSuch a function is denoted as\n||\nx\n||\n.","source_id":"planetmath.vectornorm","source_sha256":"28f4fbf40b5ae63aed15bfe76dabbe377f2dc058942e8866b9b088bb0077b245","start":24}],"target_id":"concept.planetmath.vectornorm","target_kind":"node","target_sha256":"2cd52c64c422a2f88b8d95ab67f174f72e33f7c79737583504cbddf43fe66915"}],"concept.planetmath.vectorproductingeneralvectorspaces":[{"id":"assertion.concept.planetmath.vectorproductingeneralvectorspaces","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector product in general vector spaces as stated in the captured PlanetMath entry vectorproductingeneralvectorspaces","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15A72) states: The vector product can be defined in any finite dimensional vector space V with dim ⁡ V = n .","support":[{"end":173,"quote":"The\nvector product\ncan be defined in any finite dimensional\nvector space\nV\nwith\ndim\n⁡\nV\n=\nn\n.","source_id":"planetmath.vectorproductingeneralvectorspaces","source_sha256":"45060dbf6793a7b07b82f9859df5ab57c29afb12575d8cb6c9798ff13e2676ed","start":80}],"target_id":"concept.planetmath.vectorproductingeneralvectorspaces","target_kind":"node","target_sha256":"443ea6f66e86ae9e26671a02c7744603493f9878229306f17cba7230fc054756"}],"concept.planetmath.vectorspace":[{"id":"assertion.concept.planetmath.vectorspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector space as stated in the captured PlanetMath entry vectorspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16-00, 13-00, 20-00, 15-00, 70B15) states: Let F be a field (or, more generally, a division ring).","support":[{"end":81,"quote":"Let\nF\nbe a field (or, more generally, a division ring).","source_id":"planetmath.vectorspace","source_sha256":"49f146b93bc49524737a569d2970896b20f143ba87cb4d16fcda4a1fe612d48c","start":26}],"target_id":"concept.planetmath.vectorspace","target_kind":"node","target_sha256":"c356bee6c3976200ee5d365620c923f36c82ad686c611160a12e12b554657d95"}],"concept.planetmath.vectorsubspace":[{"id":"assertion.concept.planetmath.vectorsubspace","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Vector subspace as stated in the captured PlanetMath entry vectorsubspace","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 15-00) states: Definition Let V be a vector space over a field F , and let W be a subset of V .","support":[{"end":112,"quote":"Definition\nLet\nV\nbe a\nvector space\nover a field\nF\n,\nand let\nW\nbe a subset of\nV\n.","source_id":"planetmath.vectorsubspace","source_sha256":"18c7c90578165b022246316cae76d41230f7be2d7ef2fc15d9a8a0b865e55dda","start":32}],"target_id":"concept.planetmath.vectorsubspace","target_kind":"node","target_sha256":"53d62305559b83e83ae2fc5d9b9078030c8efd61ce6664e38342522278d327d6"}],"concept.planetmath.vonneumannordinal":[{"id":"assertion.concept.planetmath.vonneumannordinal","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Von Neumann ordinal as stated in the captured PlanetMath entry vonneumannordinal","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03E10) states: The is a method of defining ordinals in set theory .","support":[{"end":92,"quote":"The\nis a method of defining\nordinals\nin\nset theory\n.","source_id":"planetmath.vonneumannordinal","source_sha256":"8b3186e274131293428c708e0e83f8cccf3881297b1cf532d8818b6a7a2afb04","start":40}],"target_id":"concept.planetmath.vonneumannordinal","target_kind":"node","target_sha256":"485ecef12b0dcc1fdcc3c3e53a1ac195eb071a45d9e7d7cd8960d57c6dc495bc"}],"concept.planetmath.vonneumannregular":[{"id":"assertion.concept.planetmath.vonneumannregular","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Von Neumann regular as stated in the captured PlanetMath entry vonneumannregular","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 16E50) states: An element a of a ring R is said to be von Neumann regular if there exists b ∈ R such that a ⁢ b ⁢ a = a .","support":[{"end":146,"quote":"An\nelement\na\nof a ring\nR\nis said to be\nvon Neumann regular\nif there\nexists\nb\n∈\nR\nsuch that\na\n⁢\nb\n⁢\na\n=\na\n.","source_id":"planetmath.vonneumannregular","source_sha256":"1596ef1a855f5aa6cf984b2799f7e734f507387517669535d27534aa9202373f","start":40}],"target_id":"concept.planetmath.vonneumannregular","target_kind":"node","target_sha256":"ee5b77bf1e8f7dbc4f80bae836bb2064963f1d6d2c5641af728654dda31e2a54"}],"concept.planetmath.waveequation":[{"id":"assertion.concept.planetmath.waveequation","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Wave equation as stated in the captured PlanetMath entry waveequation","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 35L05) states: The wave equation is a partial differential equation which describes certain kinds of waves.","support":[{"end":120,"quote":"The\nwave equation\nis a\npartial differential equation\nwhich\ndescribes certain kinds of waves.","source_id":"planetmath.waveequation","source_sha256":"ebab90ea6ee87fcaad10b4196f11d47ac13d3a535bfa57db8df665a00df64db6","start":28}],"target_id":"concept.planetmath.waveequation","target_kind":"node","target_sha256":"c8e000a1b4e3381c897533e504709427bb7ccadfc279305b33c93b3a6feaecd9"}],"concept.planetmath.welldefined":[{"id":"assertion.concept.planetmath.welldefined","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Well-defined as stated in the captured PlanetMath entry welldefined","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 00A05) states: A mathematical concept is well-defined (German wohldefiniert , French bien défini ), if its contents is on the form or the alternative representative which is used for defining it.","support":[{"end":207,"quote":"A mathematical\nconcept\nis\nwell-defined\n(German\nwohldefiniert\n, French\nbien défini\n), if its contents is\n on the form or the alternative representative which is used for defining it.","source_id":"planetmath.welldefined","source_sha256":"4b0fa6fd5bd52e7883fc337c62b2771b21be41f930a9ab3a2fb73da47271450f","start":26}],"target_id":"concept.planetmath.welldefined","target_kind":"node","target_sha256":"42c77c00b64c817d05cd5fc77ea053d704d77a293adf2eaf7ed7f7ba93eed185"}],"concept.planetmath.z2":[{"id":"assertion.concept.planetmath.z2","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Z as stated in the captured PlanetMath entry z2","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03F35) states: 2 Z 2 is the full system of second order arithmetic , that is, the full theory of numbers and sets of numbers.","support":[{"end":116,"quote":"2\nZ\n2\nis the full system of\nsecond order arithmetic\n, that is, the full theory of numbers and sets of numbers.","source_id":"planetmath.z2","source_sha256":"0a3afd57b58034ffbe50361a533409912a04e7f70008238bf2574c0034413312","start":6}],"target_id":"concept.planetmath.z2","target_kind":"node","target_sha256":"590d8aa97919be6488a961f9d875ef144dd3bf87a6be0de84d377b59ebabc6e5"}],"concept.planetmath.zermelofraenkelaxioms":[{"id":"assertion.concept.planetmath.zermelofraenkelaxioms","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zermelo-Fraenkel axioms as stated in the captured PlanetMath entry zermelofraenkelaxioms","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (axiom entry, MSC 03E99) states: Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a for what is now called Zermelo-Fraenkel set theory , or ZF.","support":[{"end":178,"quote":"Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a  for what is now called\nZermelo-Fraenkel set theory\n, or ZF.","source_id":"planetmath.zermelofraenkelaxioms","source_sha256":"bf41078d5e54b807d8d32ad80d015792d006381ba6797331d7ce715f4670890c","start":48}],"target_id":"concept.planetmath.zermelofraenkelaxioms","target_kind":"node","target_sha256":"42551dacdfebc6d16c21387e2a56e32667f191b525a6b6cb4da93273a7099273"}],"concept.planetmath.zerodivisor":[{"id":"assertion.concept.planetmath.zerodivisor","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero divisor as stated in the captured PlanetMath entry zerodivisor","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 13G05) states: Let a be a nonzero element of a ring R . The element a is a left zero divisor if there exists a nonzero element b ∈ R such that a ⋅ b = 0 .","support":[{"end":165,"quote":"Let\na\nbe a nonzero element of a ring\nR\n.\nThe element\na\nis a\nleft zero divisor\nif there exists a nonzero element\nb\n∈\nR\nsuch that\na\n⋅\nb\n=\n0\n.","source_id":"planetmath.zerodivisor","source_sha256":"2675fd41dfce05df90db46e411eb44de5dd1077121f276882c068862a8c45c48","start":26}],"target_id":"concept.planetmath.zerodivisor","target_kind":"node","target_sha256":"08d9f6ecc7c2dc41409d89ad8dcf26a055df26408bb866143e64ecb00154da73"}],"concept.planetmath.zeroelements":[{"id":"assertion.concept.planetmath.zeroelements","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero elements as stated in the captured PlanetMath entry zeroelements","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let S be a semigroup . An element z is called a right zero [resp.","support":[{"end":93,"quote":"Let\nS\nbe a\nsemigroup\n. An\nelement\nz\nis called a\nright zero\n[resp.","source_id":"planetmath.zeroelements","source_sha256":"5c989a960c72cddc8962948e8392974eae2c44abd6b8266aafcfa9d756257921","start":28}],"target_id":"concept.planetmath.zeroelements","target_kind":"node","target_sha256":"7341e632f1c6dd8fd88944e968a50bcc8c6f844affe4d06f6115c07040f88557"}],"concept.planetmath.zeroofafunction":[{"id":"assertion.concept.planetmath.zeroofafunction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zero of a function as stated in the captured PlanetMath entry zeroofafunction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 26E99) states: \\PMlinkescapephrase closed set Suppose X is a set and f a complex ( http://planetmath.org/Complex )-valued function f : X → ℂ .","support":[{"end":165,"quote":"\\PMlinkescapephrase\nclosed set\nSuppose\nX\nis a set and\nf\na\ncomplex\n(\nhttp://planetmath.org/Complex\n)-valued\nfunction\nf\n:\nX\n→\nℂ\n.","source_id":"planetmath.zeroofafunction","source_sha256":"17a38be82a7a52dbfc6539b9b2650459a4a045e21d9bb48cb9ebb8f7180acf7b","start":38}],"target_id":"concept.planetmath.zeroofafunction","target_kind":"node","target_sha256":"194799ecdf35cd28aa092d1e983aac91bd6997f54d8d2cca9078f58347b1f6bc"}],"concept.planetmath.zerothorderlogic":[{"id":"assertion.concept.planetmath.zerothorderlogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zeroth order logic as stated in the captured PlanetMath entry zerothorderlogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (definition entry, MSC 03G05, 03B05) states: \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase column \\PMlinkescapephrase Column \\PMlinkescapephrase columns \\PMlinkescapephrase Columns \\PMlinkescapephrase compact \\PMlinkescapephrase Compact \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formal logic \\PMlinkescapephrase Formal logic \\PMlinkescapephrase level \\PMlinkescapephrase Level \\PMlinkescapephrase order \\PMlinkescapephrase Order \\PMlinkescapephrase reference \\PMlinkescapephrase Reference \\PMlinkescapephrase translation \\PMlinkescapephrase Translation Note.","support":[{"end":615,"quote":"\\PMlinkescapephrase\ncalculus\n\\PMlinkescapephrase\nCalculus\n\\PMlinkescapephrase\ncolumn\n\\PMlinkescapephrase\nColumn\n\\PMlinkescapephrase\ncolumns\n\\PMlinkescapephrase\nColumns\n\\PMlinkescapephrase\ncompact\n\\PMlinkescapephrase\nCompact\n\\PMlinkescapephrase\ndegree\n\\PMlinkescapephrase\nDegree\n\\PMlinkescapephrase\nformal logic\n\\PMlinkescapephrase\nFormal logic\n\\PMlinkescapephrase\nlevel\n\\PMlinkescapephrase\nLevel\n\\PMlinkescapephrase\norder\n\\PMlinkescapephrase\nOrder\n\\PMlinkescapephrase\nreference\n\\PMlinkescapephrase\nReference\n\\PMlinkescapephrase\ntranslation\n\\PMlinkescapephrase\nTranslation\nNote.","source_id":"planetmath.zerothorderlogic","source_sha256":"b657c80d3346aba99c7f3652d317607f5ed7812cb13999e2d832afe05c89fca8","start":38}],"target_id":"concept.planetmath.zerothorderlogic","target_kind":"node","target_sha256":"c68ee30133159f1108e5df3063f5d53f73c3ad8fe84f0aa1612b7468ddfcf45d"}],"concept.quantum-information-gravity-test":[{"id":"assertion.complete.concept.quantum-information-gravity-test","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited proposals use entanglement between two spatially superposed masses as an indirect witness of quantum features of the mediating gravitational field; they do not report a completed measurement.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"concept.quantum-information-gravity-test","target_kind":"node","target_sha256":"e52c8dc12ae05b31d4f61cc051360fa0fced18636ce0161dafd7431068bcb31b"}],"concept.quantum-mediator-principle":[{"id":"assertion.complete.concept.quantum-mediator-principle","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Entanglement mediation implies nonclassical mediator structure in the cited argument.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"concept.quantum-mediator-principle","target_kind":"node","target_sha256":"11063b6b9d7b21d1a08a8088553349fbcf79944f7b4ff6bacdebcfc6060eb7fd"}],"concept.quantum-nature-of-gravity":[{"id":"assertion.complete.concept.quantum-nature-of-gravity","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Whether gravity has quantum degrees of freedom.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.quantum-nature-of-gravity","target_kind":"node","target_sha256":"f739d3c893998cfde46bb834d6046004c4dc3aa232cfe6f7582b53f087320a88"}],"concept.running-newton-constant":[{"id":"assertion.complete.concept.running-newton-constant","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Scale dependence of Newton coupling.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477}],"target_id":"concept.running-newton-constant","target_kind":"node","target_sha256":"87d83a6e0831c6f7c3760f2833b83bf52a31179adac51cc7619447ebd222d58b"}],"concept.single-graviton-signature":[{"id":"assertion.complete.concept.single-graviton-signature","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Discrete matter-gravity energy exchange as quantization clue.","support":[{"end":1443,"quote":"The quantization of gravity is widely believed to result in gravitons -- particles of discrete energy that form gravitational waves. But their detection has so far been considered impossible. Here we show that signatures of single graviton exchange can be observed in laboratory experiments. We show that stimulated and spontaneous single-graviton processes can become relevant for massive quantum acoustic resonators and that stimulated absorption can be resolved through continuous sensing of quantum jumps. We analyze the feasibility of observing the exchange of single energy quanta between matter and gravitational waves. Our results show that single graviton signatures are within reach of experiments. In analogy to the discovery of the photo-electric effect for photons, such signatures can provide the first experimental clue of the quantization of gravity.","source_id":"completion-source.c3fd2ff048f4ab5e51f1","source_sha256":"c9ed5d040eb702c4487c53daad529efbe4503831d59f32a671eef5d0622c3666","start":577}],"target_id":"concept.single-graviton-signature","target_kind":"node","target_sha256":"39183456cd4c2a365cde3710a32dd1ff6f85855d057dc75d6d5653004872a7f3"}],"concept.spin-correlation-readout":[{"id":"assertion.complete.concept.spin-correlation-readout","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spin correlations witness generated entanglement.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615}],"target_id":"concept.spin-correlation-readout","target_kind":"node","target_sha256":"e510f5fc09a5675183fdf356ce1f06e745b459bf3005b03edb7df389f3d255a0"}],"concept.spin-dependent-cross-section":[{"id":"assertion.complete.concept.spin-dependent-cross-section","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The spin-dependent WIMP-nucleon cross section is an interaction parameter on which the cited LZ nuclear-recoil search places constraints; it is not a detection of that interaction.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.spin-dependent-cross-section","target_kind":"node","target_sha256":"e47c92ae9333cf90063bd541c0f9de7f0708657aee11627c1e1905d368b170c3"}],"concept.sub-gev-dark-matter":[{"id":"assertion.complete.concept.sub-gev-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Dark-matter candidates below the conventional WIMP mass range.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"concept.sub-gev-dark-matter","target_kind":"node","target_sha256":"9752fc46fd70a72bcbc99df0ccbb8162687dea5adc87bcb94821e710adffe497"}],"concept.ultrashort-microlensing-events":[{"id":"assertion.complete.concept.ultrashort-microlensing-events","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Six very short events discussed as PBH or free-floating-planet candidates.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"concept.ultrashort-microlensing-events","target_kind":"node","target_sha256":"89f677abe1599d3e2fd11783ffa478d6d35927874f15b438fea9b46e6f06bc82"}],"concept.usgs.1005":[{"id":"assertion.concept.usgs.1005","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Rocks and deposits as defined in the captured USGS Thesaurus term 1005","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Rocks and deposits as: Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms. This category is also used for crystals , with maps and atlases for lithologic maps , lithology , and rock composition","support":[{"end":425,"quote":"Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms.\nThis category is also used for\ncrystals\n,  with\nmaps and atlases\nfor\nlithologic maps\n,\nlithology\n, and\nrock composition","source_id":"usgs-thesaurus.1005","source_sha256":"44546750cc4b723a43ef3a8fa3370b001c883fb128e46228a28b15e23432dfba","start":118}],"target_id":"concept.usgs.1005","target_kind":"node","target_sha256":"90d3453aad9be5842c40c592f71ed50ce06da3458242a549a557b84eb0e23dee"}],"concept.usgs.101":[{"id":"assertion.concept.usgs.101","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biological and physical processes as defined in the captured USGS Thesaurus term 101","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biological and physical processes as: All continuing activities, functions, and phenomena associated with organisms and non-living matter. This category is also used for bioenergetic processes","support":[{"end":278,"quote":"All continuing activities, functions, and phenomena associated with organisms and non-living matter.\nThis category is also used for\nbioenergetic processes","source_id":"usgs-thesaurus.101","source_sha256":"66cfd8e2e5a757699bcce908b2650aed77bd19bc9490dbb077b96fd0777dfd0f","start":124}],"target_id":"concept.usgs.101","target_kind":"node","target_sha256":"019d958845a630b40da17961a5eb8e3676b0ffc8bef69d69dced923f059363c9"}],"concept.usgs.1010":[{"id":"assertion.concept.usgs.1010","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Salinity as defined in the captured USGS Thesaurus term 1010","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Salinity as: Measure of the concentration of salts dissolved in a solution. This category is also used for chloride concentration","support":[{"end":209,"quote":"Measure of the concentration of salts dissolved in a solution.\nThis category is also used for\nchloride concentration","source_id":"usgs-thesaurus.1010","source_sha256":"69f34cbfc050d227f6bfdb2f51840afe1070e2a0297a54a33271b754b6cd14db","start":93}],"target_id":"concept.usgs.1010","target_kind":"node","target_sha256":"44abde9cbab2bf8184df2200e9ea58fcbd382485e11317534f6d3e6d4c1c1b64"}],"concept.usgs.1028":[{"id":"assertion.concept.usgs.1028","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea-level change as defined in the captured USGS Thesaurus term 1028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea-level change as: Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface. Includes both global (eustatic) and local (relative) sea-level variations. This category is also used for sea level change , sea level rise , and sea-level rise","support":[{"end":528,"quote":"Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface.  Includes both global (eustatic) and local (relative) sea-level variations.\nThis category is also used for\nsea level change\n,\nsea level rise\n, and\nsea-level rise","source_id":"usgs-thesaurus.1028","source_sha256":"1ec69dfccc8b4e3f31c09c1f4985d4f167662b0c24d931042e80bdda6533435e","start":138}],"target_id":"concept.usgs.1028","target_kind":"node","target_sha256":"5c5335769baa99838e3476f043515f44a8881a0feda420a2437696c17186b7d4"}],"concept.usgs.1034":[{"id":"assertion.concept.usgs.1034","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sediment transport as defined in the captured USGS Thesaurus term 1034","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow","support":[{"end":622,"quote":"Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials.\nThis category is also used for\nalluvial transport\n,\nbed load\n,\nbedload\n,\ndensity flow\n,\ndust transport\n,  with\nestuarine processes\nfor\nestuarine sediment transport\n,  with\nlongshore currents\nfor\nlittoral drift\n,  with\nlongshore currents\nfor\nlongshore drift\n,  with\nocean processes\nfor\nmarine sediment transport\n,\nsuspended load\n, and\nturbidity flow","source_id":"usgs-thesaurus.1034","source_sha256":"da27563208acfdf678c3a45d4a7e91523bd5e6936f549c00bb98bb68d8d4efdb","start":151}],"target_id":"concept.usgs.1034","target_kind":"node","target_sha256":"89f6715573b4df01d6653cd69478a09ec9c6e6d94552d20edd686c94b6171cc5"}],"concept.usgs.1035":[{"id":"assertion.concept.usgs.1035","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sedimentary rocks as defined in the captured USGS Thesaurus term 1035","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sedimentary rocks as: Rocks formed by the consolidation of loose, uncemented pieces of sediments.","support":[{"end":212,"quote":"Rocks formed by the consolidation of loose, uncemented pieces of sediments.","source_id":"usgs-thesaurus.1035","source_sha256":"43a89c499792f971bb44a714c471ebf6dd93a8569d0375267524cf3478c38a0b","start":137}],"target_id":"concept.usgs.1035","target_kind":"node","target_sha256":"f3d383c712cfb5108128fc9e63eefb968f2a6b5eb0336abe53251b0056fd44b7"}],"concept.usgs.1036":[{"id":"assertion.concept.usgs.1036","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sedimentation as defined in the captured USGS Thesaurus term 1036","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sedimentation as: Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials). The sediments settle out of water or air into layers on a surface. This category is also used for alluvial sedimentation , deposition (sediment) , and dust deposition","support":[{"end":423,"quote":"Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials).  The sediments settle out of water or air into layers on a surface.\nThis category is also used for\nalluvial sedimentation\n,\ndeposition (sediment)\n, and\ndust deposition","source_id":"usgs-thesaurus.1036","source_sha256":"f561bb544109fdadafe894e7a121fbfd9f74766792209a36c15c0ffae974c209","start":141}],"target_id":"concept.usgs.1036","target_kind":"node","target_sha256":"2e507f5e1ea49ed116a2cd8a44871a35c9266159810c06af039d566a1ce3a8d6"}],"concept.usgs.1072":[{"id":"assertion.concept.usgs.1072","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Snow and ice cover as defined in the captured USGS Thesaurus term 1072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Snow and ice cover as: Accumulation of snow or ice blanketing land surfaces. This category is also used for cryosphere , glaciers , ice , with drilling and coring for ice core sampling , and snowpack","support":[{"end":295,"quote":"Accumulation of snow or ice blanketing land surfaces.\nThis category is also used for\ncryosphere\n,\nglaciers\n,\nice\n,  with\ndrilling and coring\nfor\nice core sampling\n, and\nsnowpack","source_id":"usgs-thesaurus.1072","source_sha256":"dea1b1c81b023fa61bf083e98035adc8cb89cce51a9f5d686f26013c77d2041d","start":118}],"target_id":"concept.usgs.1072","target_kind":"node","target_sha256":"9a89082843c60ee14a1d4d2dcecbb991bf4a97a71139967c028dc3d8563cf704"}],"concept.usgs.1078":[{"id":"assertion.concept.usgs.1078","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil chemistry as defined in the captured USGS Thesaurus term 1078","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil chemistry as: Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","support":[{"end":246,"quote":"Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","source_id":"usgs-thesaurus.1078","source_sha256":"9a6f90f16720b3fa3fcdd749b9ce3a8b9b9e19ed1b2505eebdc94b2a76ea1cd9","start":120}],"target_id":"concept.usgs.1078","target_kind":"node","target_sha256":"447a52e33f64335d9816790752a685f31f339c80e3349c27ce99780fb8a5ccb7"}],"concept.usgs.108":[{"id":"assertion.concept.usgs.108","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biological productivity as defined in the captured USGS Thesaurus term 108","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biological productivity as: The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","support":[{"end":398,"quote":"The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","source_id":"usgs-thesaurus.108","source_sha256":"802c5d9b91452e66a599cf1a1af77c155909bfefedcdf758474d7e65d3673a1b","start":163}],"target_id":"concept.usgs.108","target_kind":"node","target_sha256":"85fc0256180c3a0d99cba7f6aed2502e5040d973184e375dc8a316d850541ea5"}],"concept.usgs.1080":[{"id":"assertion.concept.usgs.1080","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil resources as defined in the captured USGS Thesaurus term 1080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil resources as: Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth. This category is also used with contamination and pollution for soil pollution","support":[{"end":300,"quote":"Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth.\nThis category is also used with\ncontamination and pollution\nfor\nsoil pollution","source_id":"usgs-thesaurus.1080","source_sha256":"3d8bf7b867984540533924199f8f00893b95123308fc5c5ef395e58cfb417afe","start":106}],"target_id":"concept.usgs.1080","target_kind":"node","target_sha256":"706b153281d063bd83461a18e1bf207ea9307f123fbae9b0d262052be0f8987f"}],"concept.usgs.1102":[{"id":"assertion.concept.usgs.1102","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Storms as defined in the captured USGS Thesaurus term 1102","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Storms as: Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","support":[{"end":288,"quote":"Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","source_id":"usgs-thesaurus.1102","source_sha256":"ed510e49a9d1acc6f2da5e36a8a79c1e934cdb215ab869d8ce3147feb9d0a1ec","start":143}],"target_id":"concept.usgs.1102","target_kind":"node","target_sha256":"fd175c3fac09537abd3562780ea9817d871889b3e9f0ba53ee613313f972a2aa"}],"concept.usgs.1103":[{"id":"assertion.concept.usgs.1103","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Stratigraphic sections as defined in the captured USGS Thesaurus term 1103","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Stratigraphic sections as: Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata. This category is also used for geologic sections , geologic units , sections (geologic) , sections (stratigraphic) , strata , and stratum","support":[{"end":378,"quote":"Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata.\nThis category is also used for\ngeologic sections\n,\ngeologic units\n,\nsections (geologic)\n,\nsections (stratigraphic)\n,\nstrata\n, and\nstratum","source_id":"usgs-thesaurus.1103","source_sha256":"4935f28a350e92cbf00e69f16e829c99684641fcbc82ed8b0fffde8a85ea60e7","start":126}],"target_id":"concept.usgs.1103","target_kind":"node","target_sha256":"b3bd7f73d5286bcd9d95aaecffeb9671068b9a7bdef311e2fb98c7ced6eb6cd5"}],"concept.usgs.1118":[{"id":"assertion.concept.usgs.1118","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Structure contours as defined in the captured USGS Thesaurus term 1118","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Structure contours as: Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features. This category is also used with maps and atlases for depth-to maps","support":[{"end":303,"quote":"Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features.\nThis category is also used with\nmaps and atlases\nfor\ndepth-to maps","source_id":"usgs-thesaurus.1118","source_sha256":"1940253d7de3f01f39f1385e229898365eb266393cd75ae9b07bce5b34ee52ff","start":139}],"target_id":"concept.usgs.1118","target_kind":"node","target_sha256":"2e64ce2efa73069481828c0060fbbe2cd8db4e37eba4f059d002e0b7fac585a8"}],"concept.usgs.1123":[{"id":"assertion.concept.usgs.1123","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Succession (biological) as defined in the captured USGS Thesaurus term 1123","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Succession (biological) as: Gradual replacement of one species in an area by another. This category is also used for ecologic succession","support":[{"end":271,"quote":"Gradual replacement of one species in an area by another.\nThis category is also used for\necologic succession","source_id":"usgs-thesaurus.1123","source_sha256":"0224cfed646a51b08d273ea542df7276b7b1e31158fe1603ebc4b40734e660f4","start":163}],"target_id":"concept.usgs.1123","target_kind":"node","target_sha256":"0a15df100e4c92b40370fcf5520eaad977b88426fd7643e49cf6205ef250adc2"}],"concept.usgs.1127":[{"id":"assertion.concept.usgs.1127","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Surficial geologic units as defined in the captured USGS Thesaurus term 1127","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Surficial geologic units as: Rock units on the earth's surface. This category is also used with maps and atlases for surficial geologic maps","support":[{"end":266,"quote":"Rock units on the earth's surface.\nThis category is also used with\nmaps and atlases\nfor\nsurficial geologic maps","source_id":"usgs-thesaurus.1127","source_sha256":"0dc06fee52f0ee31cc7acb14ff1733f72a8b336089048173b3dd020b3778d31d","start":155}],"target_id":"concept.usgs.1127","target_kind":"node","target_sha256":"f031edceb5eef32ac1fea86a1c798a5a78a17ee7d03e2fe351b9c7ee821bdaac"}],"concept.usgs.1129":[{"id":"assertion.concept.usgs.1129","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Suspended material (water) as defined in the captured USGS Thesaurus term 1129","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Suspended material (water) as: Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission. This category is also used for suspended sediment concentration and suspended-sediment concentration","support":[{"end":463,"quote":"Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission.\nThis category is also used for\nsuspended sediment concentration\nand\nsuspended-sediment concentration","source_id":"usgs-thesaurus.1129","source_sha256":"73395410788eb64be192a95d823b1c0b50bbe9b959a5d0394a5e4ce763578fbe","start":129}],"target_id":"concept.usgs.1129","target_kind":"node","target_sha256":"caf8dc00c5bcfb161d542bed5103cbf251ec8a5cca2623c23c01ecb124cb03f0"}],"concept.usgs.1145":[{"id":"assertion.concept.usgs.1145","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tectonic processes as defined in the captured USGS Thesaurus term 1145","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle","support":[{"end":462,"quote":"The structural forces affecting the deformation, uplift, and movement of the earth's crust.\nThis category is also used for\ncontinental drift\n,\ndynamic geology\n,  with\nmaps and atlases\nfor\npaleotectonic maps\n,\nplate tectonics\n,\nsubduction\n,  with\nmaps and atlases\nfor\ntectonic maps\n,\ntectonics\n, and\nwilson cycle","source_id":"usgs-thesaurus.1145","source_sha256":"58f532703777736489de58f63df12fd6df1d53a8a89029b7bf2433a9ab86846f","start":151}],"target_id":"concept.usgs.1145","target_kind":"node","target_sha256":"f9a0e39a4a36588569df1d63aea21c6eba7721b372a4df80d3de6fab2c8fbaca"}],"concept.usgs.1199":[{"id":"assertion.concept.usgs.1199","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Unconsolidated deposits as defined in the captured USGS Thesaurus term 1199","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits","support":[{"end":409,"quote":"Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys.\nThis category is also used for\nalluvium\n,\neolian sediments\n,\nloess\n,  with\nchemical analysis\nfor\nsediment geochemistry\n,\nsediments\n, and\nsurficial deposits","source_id":"usgs-thesaurus.1199","source_sha256":"4b6e7dc102443bffbef2ec12c335c6592728b95da9491b61250783e8f65c19ff","start":149}],"target_id":"concept.usgs.1199","target_kind":"node","target_sha256":"5779f35f3f9a54a0b5d8783f5c4a725aee9b5cc19d4ca2f916118a99db6534bc"}],"concept.usgs.1286":[{"id":"assertion.concept.usgs.1286","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Volcanic activity as defined in the captured USGS Thesaurus term 1286","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Volcanic activity as: Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors. This category is also used for eruption , lava flows , pyroclastic flows , volcanic tremors , volcanism , and with field inventory and monitoring for volcano monitoring","support":[{"end":445,"quote":"Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors.\nThis category is also used for\neruption\n,\nlava flows\n,\npyroclastic flows\n,\nvolcanic tremors\n,\nvolcanism\n, and  with\nfield inventory and monitoring\nfor\nvolcano monitoring","source_id":"usgs-thesaurus.1286","source_sha256":"6f59db88fdfd49ded4b0eba1315143c28704d4f4a020c60ca69a7a6d4fede0c6","start":149}],"target_id":"concept.usgs.1286","target_kind":"node","target_sha256":"0f91e44ed5b3983104ee5c07ef74fe9673d5ec81ac903dc59d42e79d53c6ae6a"}],"concept.usgs.1298":[{"id":"assertion.concept.usgs.1298","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water chemistry as defined in the captured USGS Thesaurus term 1298","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.","support":[{"end":194,"quote":"Branch of chemistry that deals with the elements and compounds in water.","source_id":"usgs-thesaurus.1298","source_sha256":"8c394dab3e31f96ff8ec57316e2123abdecd190da1bafed66df8d70a34869761","start":122}],"target_id":"concept.usgs.1298","target_kind":"node","target_sha256":"8acfe5ddb46b1162c68c7c5cbdcb4a33a73716f9a351305511a9c622e978bce5"}],"concept.usgs.1301":[{"id":"assertion.concept.usgs.1301","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water hardness as defined in the captured USGS Thesaurus term 1301","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water hardness as: Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality. This category is also used for hardness (water)","support":[{"end":272,"quote":"Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality.\nThis category is also used for\nhardness (water)","source_id":"usgs-thesaurus.1301","source_sha256":"4022db028a46303b7a2470a86c451f8743e95a75eb2871c83c0d659d57380d9b","start":105}],"target_id":"concept.usgs.1301","target_kind":"node","target_sha256":"92b689497660222435cf90d983d8c268f724ec2a15a2bef345e93ca7cc26fd29"}],"concept.usgs.1302":[{"id":"assertion.concept.usgs.1302","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water pH as defined in the captured USGS Thesaurus term 1302","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water pH as: The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral. This category is also used for pH (water)","support":[{"end":337,"quote":"The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral.\nThis category is also used for\npH (water)","source_id":"usgs-thesaurus.1302","source_sha256":"5aaf3d319dc7b764c5a4ef46cf3a1acb430f6a588d96c06f472084dc55b97cc8","start":93}],"target_id":"concept.usgs.1302","target_kind":"node","target_sha256":"6dc27f59504b1daec7a0c72f799e4e0a77a06e7319320fec60c1d30672d1379f"}],"concept.usgs.1304":[{"id":"assertion.concept.usgs.1304","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water properties as defined in the captured USGS Thesaurus term 1304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water properties as: Measurable physical and chemical characteristics of water from different sources.","support":[{"end":171,"quote":"Measurable physical and chemical characteristics of water from different sources.","source_id":"usgs-thesaurus.1304","source_sha256":"77aaa1859e7bd70204e8223ae95e1d77687d4aa7bcf1485b4d25f0eec54b62d1","start":90}],"target_id":"concept.usgs.1304","target_kind":"node","target_sha256":"e7accf297608fe37607d88b8e28a48403bc8ac4784c57d500b6a7fc6d8cf242b"}],"concept.usgs.1308":[{"id":"assertion.concept.usgs.1308","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water resources as defined in the captured USGS Thesaurus term 1308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution","support":[{"end":376,"quote":"Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface.\nThis category is also used for\nhydrosphere\nand  with\ncontamination and pollution\nfor\nwater pollution","source_id":"usgs-thesaurus.1308","source_sha256":"958f90911315f23c90a427519b409f6b87fe63f7525d53fb00e73b117e356ec1","start":108}],"target_id":"concept.usgs.1308","target_kind":"node","target_sha256":"a63abeef4a5622cbf1f9cef18d50dae227dbeadbfefb7679306bf593807dd171"}],"concept.usgs.1312":[{"id":"assertion.concept.usgs.1312","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water temperature as defined in the captured USGS Thesaurus term 1312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)","support":[{"end":230,"quote":"The degrees of heat of water from a given source at a specific time.\nThis category is also used for\ntemperature (water)","source_id":"usgs-thesaurus.1312","source_sha256":"343251cb18a897a369f1c8dd180afa650573494533d80e7741969bd24b6125ce","start":111}],"target_id":"concept.usgs.1312","target_kind":"node","target_sha256":"ea3ea36b6bc34ec639c174c76037ef0d44939944965d52587dbf39995232cd4d"}],"concept.usgs.1346":[{"id":"assertion.concept.usgs.1346","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biodegradation as defined in the captured USGS Thesaurus term 1346","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biodegradation as: Reduction in the concentration of harmful chemicals by the action of animals and plants. This category is also used for natural attenuation (harmful chemicals)","support":[{"end":305,"quote":"Reduction in the concentration of harmful chemicals by the action of animals and plants.\nThis category is also used for\nnatural attenuation (harmful chemicals)","source_id":"usgs-thesaurus.1346","source_sha256":"cdc94a0cc6d15a79622f59776cf89128c35ba71b74fa3107efbce62134101809","start":146}],"target_id":"concept.usgs.1346","target_kind":"node","target_sha256":"670d36113a62e16443d2ec67b48ad43068f74c8d29df5829b0f54e1973a48f3b"}],"concept.usgs.1347":[{"id":"assertion.concept.usgs.1347","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Physiological processes as defined in the captured USGS Thesaurus term 1347","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Physiological processes as: Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","support":[{"end":291,"quote":"Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","source_id":"usgs-thesaurus.1347","source_sha256":"9ffff2fb74597db1fe1ddca09e891c80dd124080a3aa63229b1e39a172105fc3","start":140}],"target_id":"concept.usgs.1347","target_kind":"node","target_sha256":"8f68db6c08669358cda9d16190966819e4e37bed233d8c39bb63a46bfd2e749d"}],"concept.usgs.1355":[{"id":"assertion.concept.usgs.1355","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Evaporation as defined in the captured USGS Thesaurus term 1355","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Evaporation as: Transfer of water from a surface into the atmosphere. This category is also used with transpiration for evapotranspiration","support":[{"end":275,"quote":"Transfer of water from a surface into the atmosphere.\nThis category is also used with\ntranspiration\nfor\nevapotranspiration","source_id":"usgs-thesaurus.1355","source_sha256":"56f2cf5b5e3ab9d0fe96a6804c91027de7b85a1aa44822eb252ef9b1eec7c929","start":153}],"target_id":"concept.usgs.1355","target_kind":"node","target_sha256":"e8965ce89ad493086fc3daa2bc9e4ca626dfcfdd8730253cb786f9014a6a7e12"}],"concept.usgs.1356":[{"id":"assertion.concept.usgs.1356","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Transpiration as defined in the captured USGS Thesaurus term 1356","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Transpiration as: Evaporation of water from plants. This category is also used with evaporation for evapotranspiration","support":[{"end":243,"quote":"Evaporation of water from plants.\nThis category is also used with\nevaporation\nfor\nevapotranspiration","source_id":"usgs-thesaurus.1356","source_sha256":"94d3bd4dbb718e21af2e6cadcdd1517a34e41240eb581a7a5feef995dcc6ce68","start":143}],"target_id":"concept.usgs.1356","target_kind":"node","target_sha256":"d964d95c948bc56dd898a3c0cb1f808860e0cd798ac07b001798edb9b6896bc2"}],"concept.usgs.1367":[{"id":"assertion.concept.usgs.1367","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth material properties as defined in the captured USGS Thesaurus term 1367","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth material properties as: Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","support":[{"end":229,"quote":"Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","source_id":"usgs-thesaurus.1367","source_sha256":"0ea1e90713385406884a0267ee383b5c48374f95c6d4c964e6f9a68bcbaea1b1","start":132}],"target_id":"concept.usgs.1367","target_kind":"node","target_sha256":"e4164fc79e740fd1e23bf8f76fd076d6051f5c7e8e9885791ef442f1f7355441"}],"concept.usgs.1368":[{"id":"assertion.concept.usgs.1368","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Permeability as defined in the captured USGS Thesaurus term 1368","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Permeability as: The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material. This category is also used for soil permeability","support":[{"end":311,"quote":"The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material.\nThis category is also used for\nsoil permeability","source_id":"usgs-thesaurus.1368","source_sha256":"f96fb5a9cacc9b6a6266cbdee96196ee6a8cd92ba422a22af285232d7ccbb256","start":134}],"target_id":"concept.usgs.1368","target_kind":"node","target_sha256":"7cc06da3c1150efd2a5d0677edecea163c5d6cc8530e74bf1d570e3c86c0f02e"}],"concept.usgs.1369":[{"id":"assertion.concept.usgs.1369","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Porosity as defined in the captured USGS Thesaurus term 1369","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Porosity as: The proportion of open space in a rock or unconsolidated material. This category is also used for interstices and soil porosity","support":[{"end":253,"quote":"The proportion of open space in a rock or unconsolidated material.\nThis category is also used for\ninterstices\nand\nsoil porosity","source_id":"usgs-thesaurus.1369","source_sha256":"c883e17fcf5aafdd1a0aa082ba9e00c490d5129619a103d0db31b9f09aa52022","start":126}],"target_id":"concept.usgs.1369","target_kind":"node","target_sha256":"392896ee4d8aa8c1fdc3921b0e1732c974776bef246ff987bc16edd634d0ae22"}],"concept.usgs.1370":[{"id":"assertion.concept.usgs.1370","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Permafrost as defined in the captured USGS Thesaurus term 1370","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Permafrost as: Rocks and deposits in which the interstitial waters remain perennially frozen.","support":[{"end":201,"quote":"Rocks and deposits in which the interstitial waters remain perennially frozen.","source_id":"usgs-thesaurus.1370","source_sha256":"dbe6e2b271205c68721e2a71e674f3975a58348ba9e762447cd069563a7ef8ee","start":123}],"target_id":"concept.usgs.1370","target_kind":"node","target_sha256":"36821dfa99092afbb1ba7b23e536e34b620dddde22dae66109a3700ae08b28a6"}],"concept.usgs.1622":[{"id":"assertion.concept.usgs.1622","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Archaean as defined in the captured USGS Thesaurus term 1622","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Archaean as: Eon of geologic time approximately 4 to 2.5 billion years ago. https://doi.org/10.3133/fs20103059","support":[{"end":215,"quote":"Eon of geologic time approximately 4 to 2.5 billion years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1622","source_sha256":"075bc5921cb4ae9295fc7384f04be17c1fc8720e4b16ff7e23bd9fc53415da3c","start":118}],"target_id":"concept.usgs.1622","target_kind":"node","target_sha256":"96829d8b93ec69d9e18cdd2ac27e73cb591e1d7731fe25e240aa170ce306ff96"}],"concept.usgs.1626":[{"id":"assertion.concept.usgs.1626","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cambrian as defined in the captured USGS Thesaurus term 1626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cambrian as: Period of geologic time approximately 542 to 488 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":232,"quote":"Period of geologic time approximately 542 to 488 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1626","source_sha256":"165202e08e3f9f35605e4cf4309935b86bdce4edfae8e4ac401aafb4bc83d36e","start":130}],"target_id":"concept.usgs.1626","target_kind":"node","target_sha256":"2c1529b7bcee4ab3b8ffc3b9dcd1560404a5eb56ae23ec1eab97a0dba698e28f"}],"concept.usgs.1627":[{"id":"assertion.concept.usgs.1627","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cenozoic as defined in the captured USGS Thesaurus term 1627","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cenozoic as: Era of geologic time approximately 65 million years ago extending to the present. https://doi.org/10.3133/fs20103059","support":[{"end":234,"quote":"Era of geologic time approximately 65 million years ago extending to the present.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1627","source_sha256":"2a867df1b2579e2ce6c23b83e21283c33f5942076a35d4693390650e30029a6e","start":118}],"target_id":"concept.usgs.1627","target_kind":"node","target_sha256":"0dd1cd4b75099c26fb3c2398551e52b7ce4f8ba37e9e1b15254646709b049a3f"}],"concept.usgs.1628":[{"id":"assertion.concept.usgs.1628","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Cretaceous as defined in the captured USGS Thesaurus term 1628","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Cretaceous as: Period of geologic time approximately 145 to 65 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":234,"quote":"Period of geologic time approximately 145 to 65 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1628","source_sha256":"ab6a495a4b811da7370a2ff8516d74cfbfcf4279c46a3577618901957b5da3d3","start":133}],"target_id":"concept.usgs.1628","target_kind":"node","target_sha256":"2e77d7a1b786545627d3e11853f8534e8e84cba0ac2b1cb18b0a92d85d1e457a"}],"concept.usgs.1630":[{"id":"assertion.concept.usgs.1630","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Devonian as defined in the captured USGS Thesaurus term 1630","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Devonian as: Period of geologic time approximately 416 to 359 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":232,"quote":"Period of geologic time approximately 416 to 359 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1630","source_sha256":"4e7d2b5639b181b9d20bc17378200c06f6116e322cf200273d914951ddce85ae","start":130}],"target_id":"concept.usgs.1630","target_kind":"node","target_sha256":"8e5b818f2698838084fcaa0cd31162cb53a55ac20eeea50af54b58228ae33e1d"}],"concept.usgs.1634":[{"id":"assertion.concept.usgs.1634","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic time periods as defined in the captured USGS Thesaurus term 1634","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic time periods as: This category is also used for geologic age and geologic time","support":[{"end":167,"quote":"This category is also used for\ngeologic age\nand\ngeologic time","source_id":"usgs-thesaurus.1634","source_sha256":"791fa0275aab7649f96747add7dca2699d676c2d706d909810f577d723cac88e","start":106}],"target_id":"concept.usgs.1634","target_kind":"node","target_sha256":"fb7db6df3dcb10ea7f745e4b9731126e31f45e2c049f1251090b9a89f459f5d6"}],"concept.usgs.1635":[{"id":"assertion.concept.usgs.1635","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hadean as defined in the captured USGS Thesaurus term 1635","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hadean as: Eon of geologic time prior to 4 billion years ago. https://doi.org/10.3133/fs20103059","support":[{"end":199,"quote":"Eon of geologic time prior to 4 billion years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1635","source_sha256":"93d6ee4baab86877d8fb967f605e78efaec234ba9d1add4bd50a63544e9ae4d0","start":114}],"target_id":"concept.usgs.1635","target_kind":"node","target_sha256":"0a892a21b7802ac646283430348ca222d350b955a9a8e714f6f4adc069d2ec2a"}],"concept.usgs.1638":[{"id":"assertion.concept.usgs.1638","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Jurassic as defined in the captured USGS Thesaurus term 1638","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Jurassic as: Period of geologic time approximately 200 to 145 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Period of geologic time approximately 200 to 145 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1638","source_sha256":"a6a50c3272e61d3fc3481ec08606571564664c8ad61d8d4fc39f292b52347a5e","start":129}],"target_id":"concept.usgs.1638","target_kind":"node","target_sha256":"cb3edaf0a1f4e8b7d2b70b4a5e82a446c1a29b1acd1ce0f1557ae973090704b2"}],"concept.usgs.1640":[{"id":"assertion.concept.usgs.1640","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mesozoic as defined in the captured USGS Thesaurus term 1640","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mesozoic as: Era of geologic time approximately 251 to 65 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":216,"quote":"Era of geologic time approximately 251 to 65 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1640","source_sha256":"53aafb5db97b483ab3db3b8b1e796a1d682e7c582cfc3d8e34101043cb7a5d77","start":118}],"target_id":"concept.usgs.1640","target_kind":"node","target_sha256":"bfd3a267487656b37270c543507a2af8c66e8b9e13feb157625fd8cd506194ca"}],"concept.usgs.1642":[{"id":"assertion.concept.usgs.1642","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mississippian as defined in the captured USGS Thesaurus term 1642","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mississippian as: Subperiod of geologic time approximately 359 to 318 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for lower carboniferous","support":[{"end":296,"quote":"Subperiod of geologic time approximately 359 to 318 million years ago.\nhttps://doi.org/10.3133/fs20103059\nThis category is also used for\nlower carboniferous","source_id":"usgs-thesaurus.1642","source_sha256":"ae02be5ae6e65b3048cc902a72ebcc5d010727892f0691adf65cf41b78581898","start":140}],"target_id":"concept.usgs.1642","target_kind":"node","target_sha256":"410ffaf74462ca8cc63babfabb1658be856f89ad7fc9b3d4ec7af23a180b0ad3"}],"concept.usgs.1649":[{"id":"assertion.concept.usgs.1649","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleozoic as defined in the captured USGS Thesaurus term 1649","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleozoic as: Era of geologic time approximately 542 to 251 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":219,"quote":"Era of geologic time approximately 542 to 251 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1649","source_sha256":"dc325859ef149d30aa736b6ec228b777e068767a71bbffaf167572f024662916","start":120}],"target_id":"concept.usgs.1649","target_kind":"node","target_sha256":"123e77da3ff4c927971424ba40d295acc0da148ed0da37645bd231e6b72564ff"}],"concept.usgs.1652":[{"id":"assertion.concept.usgs.1652","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Phanerozoic as defined in the captured USGS Thesaurus term 1652","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Phanerozoic as: Eon of geologic time approximately 542 million years ago extending to the present. https://doi.org/10.3133/fs20103059","support":[{"end":227,"quote":"Eon of geologic time approximately 542 million years ago extending to the present.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1652","source_sha256":"59920b7c7e771fed3dd711000cc50720c96ae0381fd870acc5af932b03533f89","start":110}],"target_id":"concept.usgs.1652","target_kind":"node","target_sha256":"74aaf78feef2708eae146e83c9c6c9a560004c9673be889726095f08d78016f0"}],"concept.usgs.1655":[{"id":"assertion.concept.usgs.1655","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Precambrian as defined in the captured USGS Thesaurus term 1655","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Precambrian as: General interval of geologic time before approximately 542 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for cryptozoic","support":[{"end":264,"quote":"General interval of geologic time before approximately 542 million years ago.\nhttps://doi.org/10.3133/fs20103059\nThis category is also used for\ncryptozoic","source_id":"usgs-thesaurus.1655","source_sha256":"9745220f28924cca0ab4da3fd6f113ee051ad94def731d8ec46851ea7585bfd9","start":110}],"target_id":"concept.usgs.1655","target_kind":"node","target_sha256":"af6877f445577a855a877edd5e66d77541853f0aad359d3b6ef07adcebc90b02"}],"concept.usgs.1656":[{"id":"assertion.concept.usgs.1656","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Proterozoic as defined in the captured USGS Thesaurus term 1656","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Proterozoic as: Eon of geologic time approximately 2.5 billion to 542 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Eon of geologic time approximately 2.5 billion to 542 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1656","source_sha256":"1d402e35017b23540955ec7feef6d250960169c5cc357b7dac7377f158d11220","start":124}],"target_id":"concept.usgs.1656","target_kind":"node","target_sha256":"24bed061402744db71bd7bd5d956f8400aee31ae7396c867566e33c1173e5dc1"}],"concept.usgs.1657":[{"id":"assertion.concept.usgs.1657","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Quaternary as defined in the captured USGS Thesaurus term 1657","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Quaternary as: Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene. https://doi.org/10.3133/fs20103059","support":[{"end":331,"quote":"Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1657","source_sha256":"2310239c98d25641f5d8056cdfb53d50f9474327aca658344ff7f0690ea19538","start":133}],"target_id":"concept.usgs.1657","target_kind":"node","target_sha256":"fcca22aaa0e17b0378ceb0847293f1815dac5259d6d29e66c6a5259f61c6b5fd"}],"concept.usgs.1662":[{"id":"assertion.concept.usgs.1662","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tertiary as defined in the captured USGS Thesaurus term 1662","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tertiary as: Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene. https://doi.org/10.3133/fs20103059","support":[{"end":305,"quote":"Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1662","source_sha256":"35586b10b4fdf21ead8a4d196d9fba32adffb7d2ad7769e813ce199fd7b5b874","start":129}],"target_id":"concept.usgs.1662","target_kind":"node","target_sha256":"3d82d251a3e963f6c5611945eb694868ed97e80a34550f2f0154d7bac1befbf4"}],"concept.usgs.1664":[{"id":"assertion.concept.usgs.1664","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Triassic as defined in the captured USGS Thesaurus term 1664","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Triassic as: Period of geologic time approximately 251 to 200 million years ago. https://doi.org/10.3133/fs20103059","support":[{"end":231,"quote":"Period of geologic time approximately 251 to 200 million years ago.\nhttps://doi.org/10.3133/fs20103059","source_id":"usgs-thesaurus.1664","source_sha256":"ace3de7fa94e6aeccb13a7b3b1274d64637d5857df109575c58a4662bba2906b","start":129}],"target_id":"concept.usgs.1664","target_kind":"node","target_sha256":"89738e49e6f72bf34a96e94ecc864d3433d9417c599023fff0862e2a4c9d8283"}],"concept.usgs.1673":[{"id":"assertion.concept.usgs.1673","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Isostatic anomaly as defined in the captured USGS Thesaurus term 1673","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Isostatic anomaly as: Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","support":[{"end":230,"quote":"Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","source_id":"usgs-thesaurus.1673","source_sha256":"bfdbfcec6b41b5452998ae96cdf37b352f70ded9448f40bb4e71bce169d026ce","start":146}],"target_id":"concept.usgs.1673","target_kind":"node","target_sha256":"1f8f9198b1cf779b97f06ff5ebda83d148fb6b98b0aaea1258b107a99c5f0929"}],"concept.usgs.1674":[{"id":"assertion.concept.usgs.1674","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Free-air anomaly as defined in the captured USGS Thesaurus term 1674","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Free-air anomaly as: Gravity anomaly corrected for elevation of the location at which the measurements were made.","support":[{"end":236,"quote":"Gravity anomaly corrected for elevation of the location at which the measurements were made.","source_id":"usgs-thesaurus.1674","source_sha256":"756523ec92d2b9a677794dd0b5f7ca5a526742ebf286852a6cf46a8bdebc1a3e","start":144}],"target_id":"concept.usgs.1674","target_kind":"node","target_sha256":"46e4a5f6cde088fa8a81a637b2eaa39d70dcc6998efc51fc9d8c3ec3ae10d46f"}],"concept.usgs.1675":[{"id":"assertion.concept.usgs.1675","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bouguer anomaly as defined in the captured USGS Thesaurus term 1675","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bouguer anomaly as: Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","support":[{"end":283,"quote":"Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","source_id":"usgs-thesaurus.1675","source_sha256":"2730e3c853b8cbfe784e9a80e3dc4758fb454711ff4512a1a5cf653a437caf81","start":142}],"target_id":"concept.usgs.1675","target_kind":"node","target_sha256":"612e9c0dd671a3dab92ef8eb1a30bfc1ea7773a1bdd3b3ee6c88813265b3d930"}],"concept.usgs.168":[{"id":"assertion.concept.usgs.168","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Climate change as defined in the captured USGS Thesaurus term 168","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate","support":[{"end":430,"quote":"Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature.\nThis category is also used for\nclimate history\n,\nclimate variability\n,\nclimatic change\n,\nglobal climate change\n,\nglobal warming\n, and\npaleoclimate","source_id":"usgs-thesaurus.168","source_sha256":"02f8cf30bc663cb057c111d0378a04ee23c90a639b3b652073ae80eb9789c483","start":159}],"target_id":"concept.usgs.168","target_kind":"node","target_sha256":"8208acfd73da261ea61fba99ab507c6cc018a2c3f0ab2d2250fa63fc4858a0ef"}],"concept.usgs.1682":[{"id":"assertion.concept.usgs.1682","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved gases as defined in the captured USGS Thesaurus term 1682","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved gases as: Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","support":[{"end":206,"quote":"Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","source_id":"usgs-thesaurus.1682","source_sha256":"e6b808e0b9e0e2561ec231af6fb88607f3f9b819df2bab1069920fa730f87757","start":107}],"target_id":"concept.usgs.1682","target_kind":"node","target_sha256":"639b8935476606126144fdc9f021e2ecb7ee6d01b5e2b506c5ebe2a65ff1a6d0"}],"concept.usgs.1683":[{"id":"assertion.concept.usgs.1683","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth tides as defined in the captured USGS Thesaurus term 1683","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth tides as: Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters. Used in studies of volcanic activity.","support":[{"end":310,"quote":"Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters.  Used in studies of volcanic activity.","source_id":"usgs-thesaurus.1683","source_sha256":"7f10f935199174d46b7e2fc8f7aadce97f8da260aeddd52e3ab03e06510448ae","start":137}],"target_id":"concept.usgs.1683","target_kind":"node","target_sha256":"90e400b5c7349d1da7320cb4e43e924ccfb05cf906e1efe8ef1d44799fd970d9"}],"concept.usgs.1690":[{"id":"assertion.concept.usgs.1690","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Wind as defined in the captured USGS Thesaurus term 1690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Wind as: Local air movements. This category is also used with erosion for wind erosion","support":[{"end":216,"quote":"Local air movements.\nThis category is also used with\nerosion\nfor\nwind erosion","source_id":"usgs-thesaurus.1690","source_sha256":"c3f711e3d8790051ec030d9ec351a5f52d9da34bb6253818e3aeef4604b141fe","start":139}],"target_id":"concept.usgs.1690","target_kind":"node","target_sha256":"cf51883bb62087bea4b924fb1f044126c199cf2feed27507b69ec569850460a8"}],"concept.usgs.1692":[{"id":"assertion.concept.usgs.1692","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Groundwater and surface-water interaction as defined in the captured USGS Thesaurus term 1692","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Groundwater and surface-water interaction as: Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water. This category is also used for aquifer-surface water interaction , ground-water/surface-water interaction , groundwater/surface water interaction , hyporheic zone processes , surface water/groundwater interaction , and surface-water/ground-water interaction","support":[{"end":1395,"quote":"Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water.\nThis category is also used for\naquifer-surface water interaction\n,\nground-water/surface-water interaction\n,\ngroundwater/surface water interaction\n,\nhyporheic zone processes\n,\nsurface water/groundwater interaction\n, and\nsurface-water/ground-water interaction","source_id":"usgs-thesaurus.1692","source_sha256":"6fb031488865a6abb296959a091c336ca3aca41ad63c2cec34b7f247d372566a","start":199}],"target_id":"concept.usgs.1692","target_kind":"node","target_sha256":"40820b53b5660ce62a78c9a59022c1e9a928c7b34111f429bcda7c684cd96032"}],"concept.usgs.1699":[{"id":"assertion.concept.usgs.1699","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Deformation (geologic) as defined in the captured USGS Thesaurus term 1699","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Deformation (geologic) as: Change in form and structure of geologic materials in response to stress, typically heat and pressure. This category is also used for rheology and strain history","support":[{"end":320,"quote":"Change in form and structure of geologic materials in response to stress, typically heat and pressure.\nThis category is also used for\nrheology\nand\nstrain history","source_id":"usgs-thesaurus.1699","source_sha256":"05403593d008b86dec650e0290c5d35b4a048739fdde0ffe8919d9e38dbb818a","start":159}],"target_id":"concept.usgs.1699","target_kind":"node","target_sha256":"21bf5841c6009380e67f38669564ab7c0aaec15b13bd3970d22c58ea7758a351"}],"concept.usgs.1701":[{"id":"assertion.concept.usgs.1701","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Radioactivity as defined in the captured USGS Thesaurus term 1701","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Radioactivity as: Release of subatomic particles from earth materials. Generally the energy of these particles is used to determine the chemical elements present. This category is also used for gamma ray emission","support":[{"end":331,"quote":"Release of subatomic particles from earth materials.  Generally the energy of these particles is used to determine the chemical elements present.\nThis category is also used for\ngamma ray emission","source_id":"usgs-thesaurus.1701","source_sha256":"a403825bd7733c39d949cc961c74eb29f2bb2d265fc302161b969a798ab3142e","start":136}],"target_id":"concept.usgs.1701","target_kind":"node","target_sha256":"f4efec0a556aea8134225d5e6538ba058305c9b5fca599d829a13b259b5320ef"}],"concept.usgs.1702":[{"id":"assertion.concept.usgs.1702","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Evolution as defined in the captured USGS Thesaurus term 1702","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Evolution as: Change in the genetic composition of populations of living organisms. This category is also used for gene flow","support":[{"end":222,"quote":"Change in the genetic composition of populations of living organisms.\nThis category is also used for\ngene flow","source_id":"usgs-thesaurus.1702","source_sha256":"9cecf61e8662a67634dd250f00d5fecf9b58f8e957efb9bffd4a34c09bd85e13","start":112}],"target_id":"concept.usgs.1702","target_kind":"node","target_sha256":"b5e108f95dbc0a1a69f4f331c795021e894e40314944c4cc3195ede10bfbbd5e"}],"concept.usgs.1703":[{"id":"assertion.concept.usgs.1703","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ore formation as defined in the captured USGS Thesaurus term 1703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ore formation as: Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials. Typically refers to metal ores. This category is also used for metallogenesis , metallogeny , and mineralization","support":[{"end":369,"quote":"Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials.  Typically refers to metal ores.\nThis category is also used for\nmetallogenesis\n,\nmetallogeny\n, and\nmineralization","source_id":"usgs-thesaurus.1703","source_sha256":"cf60741aa1741527868092031aa0a02af834aad020b6ef27cbfba88a0d2c9185","start":144}],"target_id":"concept.usgs.1703","target_kind":"node","target_sha256":"bc0c581a1e271514e54e56f36bdc6e9845636278f78df4c622f6ee574b35790e"}],"concept.usgs.1704":[{"id":"assertion.concept.usgs.1704","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Greenhouse effect as defined in the captured USGS Thesaurus term 1704","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Greenhouse effect as: Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","support":[{"end":310,"quote":"Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","source_id":"usgs-thesaurus.1704","source_sha256":"a56cd11fc712bf9fc81dd53bfd18a7206cbd1f066b0869217da5630410e1d4c6","start":165}],"target_id":"concept.usgs.1704","target_kind":"node","target_sha256":"f4e4194557befa745354f4016a77016bffe8d0c188b3e3715085fa006cd86351"}],"concept.usgs.1708":[{"id":"assertion.concept.usgs.1708","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Oxidation and reduction as defined in the captured USGS Thesaurus term 1708","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Oxidation and reduction as: Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms. This category is also used for fermentation","support":[{"end":303,"quote":"Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms.\nThis category is also used for\nfermentation","source_id":"usgs-thesaurus.1708","source_sha256":"b1b30717b7433e9c9241153f5baf63c77f5a88a91c43b01f144c0c84860a31e6","start":164}],"target_id":"concept.usgs.1708","target_kind":"node","target_sha256":"99358be289e8c3cde8bb6e27e29b7b5f10bd1f263304c755e6a6d60517ddc0df"}],"concept.usgs.1710":[{"id":"assertion.concept.usgs.1710","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil formation as defined in the captured USGS Thesaurus term 1710","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil formation as: Geological, geochemical, and ecological processes that work together to produce soils. This category is also used for pedogenesis","support":[{"end":272,"quote":"Geological, geochemical, and ecological processes that work together to produce soils.\nThis category is also used for\npedogenesis","source_id":"usgs-thesaurus.1710","source_sha256":"f7e051590f47c3b38eb4c794d0b4d718e26c6817c051f7b94b0943bfaecba120","start":143}],"target_id":"concept.usgs.1710","target_kind":"node","target_sha256":"790a3f269f6e14baea4ff3699e71c37d8bcd64f418a506aa87ef894c31af8a6d"}],"concept.usgs.1711":[{"id":"assertion.concept.usgs.1711","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Reaction transport as defined in the captured USGS Thesaurus term 1711","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Reaction transport as: Chemical reactions occurring during ground-water flow.","support":[{"end":208,"quote":"Chemical reactions occurring during ground-water flow.","source_id":"usgs-thesaurus.1711","source_sha256":"fa38b6b341913b8c2d936ebfd2d92f47fbce08c86e72f56f3dd40d3fd1e40823","start":154}],"target_id":"concept.usgs.1711","target_kind":"node","target_sha256":"0d45a65524c9bc20957cb9c4887289c61a90457888bac60ca7ee819cc3b6488a"}],"concept.usgs.1712":[{"id":"assertion.concept.usgs.1712","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Resistivity as defined in the captured USGS Thesaurus term 1712","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Resistivity as: Electrical resistance of materials, often measured in boreholes.","support":[{"end":196,"quote":"Electrical resistance of materials, often measured in boreholes.","source_id":"usgs-thesaurus.1712","source_sha256":"35184d087a110126e9ebeb7e1e6029148f41a386e23e0458bd30fd14b45c6652","start":132}],"target_id":"concept.usgs.1712","target_kind":"node","target_sha256":"cb97eeaa1340b1e9065704cd8fb3c6bc124a3e054aa7fb38f0d039022bca77dd"}],"concept.usgs.1714":[{"id":"assertion.concept.usgs.1714","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bulk density as defined in the captured USGS Thesaurus term 1714","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bulk density as: Overall density of an unconsolidated earth material.","support":[{"end":186,"quote":"Overall density of an unconsolidated earth material.","source_id":"usgs-thesaurus.1714","source_sha256":"2715f15a4c13298451c61b79abba0cb9ba61f3d21c875139266819536a52010e","start":134}],"target_id":"concept.usgs.1714","target_kind":"node","target_sha256":"7378593ece3279344df10f4940c9e474616416c655b8624d67b61344e9be91de"}],"concept.usgs.1715":[{"id":"assertion.concept.usgs.1715","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sorption as defined in the captured USGS Thesaurus term 1715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sorption as: Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption). This category is also used for absorption and adsorption","support":[{"end":303,"quote":"Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption).\nThis category is also used for\nabsorption\nand\nadsorption","source_id":"usgs-thesaurus.1715","source_sha256":"80bf445f52686dad5aae947b2c7e6f65fedb116d6b2b07936c013df20805312a","start":134}],"target_id":"concept.usgs.1715","target_kind":"node","target_sha256":"15dec6d7caeb5473129d0a228cb77be6d5b6bdb7e0bc8a4825829b899bcfcb30"}],"concept.usgs.1718":[{"id":"assertion.concept.usgs.1718","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Impact cratering as defined in the captured USGS Thesaurus term 1718","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Impact cratering as: Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth. This category is also used for asteroid impact , bolide impact , comet impact , and meteor impact","support":[{"end":310,"quote":"Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth.\nThis category is also used for\nasteroid impact\n,\nbolide impact\n,\ncomet impact\n, and\nmeteor impact","source_id":"usgs-thesaurus.1718","source_sha256":"2dcd3181ff3c8e58206a0c84747f7bec20481b440abd1d7e858aa9552ece5da6","start":126}],"target_id":"concept.usgs.1718","target_kind":"node","target_sha256":"d209128fd807bd64956e8f9be741a85990cc3d147d6237a60d30d0983d910a6a"}],"concept.usgs.1721":[{"id":"assertion.concept.usgs.1721","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetic storms as defined in the captured USGS Thesaurus term 1721","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetic storms as: A period of time during which the earth's magnetic field varies rapidly. During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation. This category is also used for geomagnetic storms","support":[{"end":493,"quote":"A period of time during which the earth's magnetic field varies rapidly.  During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation.\nThis category is also used for\ngeomagnetic storms","source_id":"usgs-thesaurus.1721","source_sha256":"aa9c32afb1eb7cc374508f382f2f1693c2c2dc78f75184e42aba4ffab8501867","start":145}],"target_id":"concept.usgs.1721","target_kind":"node","target_sha256":"10a4fbc7e87361cc064a481e65392647695d90df1b86a639560b9cbd071fce47"}],"concept.usgs.1722":[{"id":"assertion.concept.usgs.1722","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea ice concentration as defined in the captured USGS Thesaurus term 1722","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea ice concentration as: Proportion of ocean area in a given region that contains or is covered by floating ice. This category is also used for sea ice cover and sea-ice concentration","support":[{"end":303,"quote":"Proportion of ocean area in a given region that contains or is covered by floating ice.\nThis category is also used for\nsea ice cover\nand\nsea-ice concentration","source_id":"usgs-thesaurus.1722","source_sha256":"996cf70964344e6353fef2191749f4d80893d051a04bea578a5dd31a31f846ae","start":145}],"target_id":"concept.usgs.1722","target_kind":"node","target_sha256":"42577589b5c3a8d2fb3b0d34e42396a9e7d57382dccc4101c20dd5d3f467140a"}],"concept.usgs.1731":[{"id":"assertion.concept.usgs.1731","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Carbon sequestration as defined in the captured USGS Thesaurus term 1731","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage","support":[{"end":444,"quote":"Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system.\nThis category is also used for\ncarbon capture\n,\ncarbon capture and storage\n, and\ncarbon storage","source_id":"usgs-thesaurus.1731","source_sha256":"0f34754cad67c3062ee5d58a32cc500faec608d3b6944cfc5278c28a6b8a3707","start":158}],"target_id":"concept.usgs.1731","target_kind":"node","target_sha256":"26ceba1b5af8a55f09516210c4a86475bd9dab673ce4e0c6e8a24e23177447e3"}],"concept.usgs.1736":[{"id":"assertion.concept.usgs.1736","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Slope processes as defined in the captured USGS Thesaurus term 1736","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Slope processes as: The down slope movement of earth material under the influence of gravity. This category is also used for mass wasting and soil creep","support":[{"end":277,"quote":"The down slope movement of earth material under the influence of gravity.\nThis category is also used for\nmass wasting\nand\nsoil creep","source_id":"usgs-thesaurus.1736","source_sha256":"1c40be8679858a28461e532b4049f331334ce7f67d2ce454fa61da62037ba0b6","start":145}],"target_id":"concept.usgs.1736","target_kind":"node","target_sha256":"225fa66f31d44a679173d53d06f0e6f2e7411a59bb985c65d703f99660af9d2d"}],"concept.usgs.1741":[{"id":"assertion.concept.usgs.1741","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetism as defined in the captured USGS Thesaurus term 1741","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetism as: Strength and orientation of the permanent magnetic field in a given sample of an earth material","support":[{"end":223,"quote":"Strength and orientation of the permanent magnetic field in a given sample of an earth material","source_id":"usgs-thesaurus.1741","source_sha256":"ba99c7144f0e95b38ad9830c8995d17f6399ae6b169fb77bf6c71d854c2e2980","start":128}],"target_id":"concept.usgs.1741","target_kind":"node","target_sha256":"0a8d5f67e3bf24f80837cce7bef40847b48daa8a8c1f016994ecef0b3dddff64"}],"concept.usgs.1751":[{"id":"assertion.concept.usgs.1751","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Uplift as defined in the captured USGS Thesaurus term 1751","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Uplift as: Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","support":[{"end":234,"quote":"Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","source_id":"usgs-thesaurus.1751","source_sha256":"655b75663d61f299c4022357ea71fdb87a7517d695d8484df0c0dabcf3defb8b","start":127}],"target_id":"concept.usgs.1751","target_kind":"node","target_sha256":"b9875d60b4487f72ff9a147b047d9333f0517d2dd35f132837da2c70d4eb9184"}],"concept.usgs.1799":[{"id":"assertion.concept.usgs.1799","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal processes as defined in the captured USGS Thesaurus term 1799","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal processes as: Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation This category is also used with erosion for beach erosion , with erosion for coastal erosion , with hazards for coastal hazards , shoreline change , with erosion for shoreline erosion , and with erosion for shoreline retreat","support":[{"end":544,"quote":"Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation\nThis category is also used with\nerosion\nfor\nbeach erosion\n,  with\nerosion\nfor\ncoastal erosion\n,  with\nhazards\nfor\ncoastal hazards\n,\nshoreline change\n,  with\nerosion\nfor\nshoreline erosion\n, and  with\nerosion\nfor\nshoreline retreat","source_id":"usgs-thesaurus.1799","source_sha256":"ed4b4cce691b28a633c4123df5e3b472df7139494483819b5afc5a019b18b36b","start":128}],"target_id":"concept.usgs.1799","target_kind":"node","target_sha256":"bddcc5bdea509cb21425808cd25c937c030e64f2bb8cc4f751595b3c273844ce"}],"concept.usgs.1800":[{"id":"assertion.concept.usgs.1800","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine processes as defined in the captured USGS Thesaurus term 1800","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine processes as: Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters This category is also used with sediment transport for estuarine sediment transport","support":[{"end":305,"quote":"Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters\nThis category is also used with\nsediment transport\nfor\nestuarine sediment transport","source_id":"usgs-thesaurus.1800","source_sha256":"7b552cf7bdf934437d0ec9f67a388986c3d7571c5e1b6e002830f803a8736fa6","start":132}],"target_id":"concept.usgs.1800","target_kind":"node","target_sha256":"8794b4fc6780104d0e21497639d97bfbff495c994bdfccbd919a959a44b2d260"}],"concept.usgs.1801":[{"id":"assertion.concept.usgs.1801","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Longshore currents as defined in the captured USGS Thesaurus term 1801","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Longshore currents as: Movement of water parallel to the coast due to waves striking the shoreline at an angle This category is also used with sediment transport for littoral drift and with sediment transport for longshore drift","support":[{"end":356,"quote":"Movement of water parallel to the coast due to waves striking the shoreline at an angle\nThis category is also used with\nsediment transport\nfor\nlittoral drift\nand  with\nsediment transport\nfor\nlongshore drift","source_id":"usgs-thesaurus.1801","source_sha256":"4a0e2dca712969145257e515d619fb31d25fdcc02ec358bf0d6315bd077fb30c","start":150}],"target_id":"concept.usgs.1801","target_kind":"node","target_sha256":"75bb0220e6d01042348b396f3c1ee4dd5cd6f086c1cf83d607ad16f9e2bf51ab"}],"concept.usgs.1802":[{"id":"assertion.concept.usgs.1802","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine currents as defined in the captured USGS Thesaurus term 1802","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine currents as: Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","support":[{"end":266,"quote":"Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","source_id":"usgs-thesaurus.1802","source_sha256":"d1959a286a47d561dd029e8d432dee5a5eb1a09a371e85b50e58753a14801262","start":152}],"target_id":"concept.usgs.1802","target_kind":"node","target_sha256":"def933bd87403ddb760d0681abbde736c2c8d1c3708f822f9b9deab453810eb1"}],"concept.usgs.1803":[{"id":"assertion.concept.usgs.1803","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Estuarine mixing as defined in the captured USGS Thesaurus term 1803","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Estuarine mixing as: Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","support":[{"end":368,"quote":"Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","source_id":"usgs-thesaurus.1803","source_sha256":"1cc57518713ac5cb102cabbb57f77b0047d74ca745427d8389a6b27d194205fd","start":148}],"target_id":"concept.usgs.1803","target_kind":"node","target_sha256":"532794b3ab53ff5ba39f73f7e4fb9ba003c8a553d5fda6b73d1e820e090f791b"}],"concept.usgs.1804":[{"id":"assertion.concept.usgs.1804","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Petroleum as defined in the captured USGS Thesaurus term 1804","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Petroleum as: Naturally occurring hydrocarbons, typically fluid or gas, often of economic use. Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales. This category is also used with industrial pollution for oil spills","support":[{"end":356,"quote":"Naturally occurring hydrocarbons, typically fluid or gas, often of economic use.  Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales.\nThis category is also used with\nindustrial pollution\nfor\noil spills","source_id":"usgs-thesaurus.1804","source_sha256":"84fd0e7a1863aea53d7b95fee426722b608c95607a74016babcb4d4efe355079","start":121}],"target_id":"concept.usgs.1804","target_kind":"node","target_sha256":"f21185ddb3fa9698cacdb89ebeb47123128fd5fb2ff1500b312ca7d10c60bf18"}],"concept.usgs.196":[{"id":"assertion.concept.usgs.196","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Contaminant transport as defined in the captured USGS Thesaurus term 196","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Contaminant transport as: Processes involved in the movement of impurities through air, water, and soil.","support":[{"end":237,"quote":"Processes involved in the movement of impurities through air, water, and soil.","source_id":"usgs-thesaurus.196","source_sha256":"d8ece0060c7ebfa693a9a262c9b52f587051d2f7f477dab84b6871f76a8d1f32","start":159}],"target_id":"concept.usgs.196","target_kind":"node","target_sha256":"1a330b2da374379140ea0708f1e4dc6c013c4c16f0333e8886d127c69298e2da"}],"concept.usgs.1999":[{"id":"assertion.concept.usgs.1999","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved metals as defined in the captured USGS Thesaurus term 1999","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved metals as: Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","support":[{"end":224,"quote":"Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","source_id":"usgs-thesaurus.1999","source_sha256":"513a902a1b1cb2ff6d1ca97190e3ba941135d48645782335060706286826d86a","start":109}],"target_id":"concept.usgs.1999","target_kind":"node","target_sha256":"1310a3634a094dd56b57cb34313cc93f965e43d3c0ab710bdec4ab2440e0f62c"}],"concept.usgs.2000":[{"id":"assertion.concept.usgs.2000","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dissolved organic compounds as defined in the captured USGS Thesaurus term 2000","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dissolved organic compounds as: Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","support":[{"end":261,"quote":"Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","source_id":"usgs-thesaurus.2000","source_sha256":"367561cc64953937a10a988d2f4baf848cb1d738844f53284bdd3fd94eb59e91","start":131}],"target_id":"concept.usgs.2000","target_kind":"node","target_sha256":"43e9922994c7f95c95db5b02b3c3740037b955fe38dfbd3deb50e8290d49b65c"}],"concept.usgs.2027":[{"id":"assertion.concept.usgs.2027","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil moisture as defined in the captured USGS Thesaurus term 2027","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material","support":[{"end":210,"quote":"Water content of soil and other near-surface unconsolidated earth material","source_id":"usgs-thesaurus.2027","source_sha256":"d0ebce541ec5b583c6768fd1b08f2e33c40931078d4275a64d14656d6129d003","start":136}],"target_id":"concept.usgs.2027","target_kind":"node","target_sha256":"63eada4127222ba73f350430cd07ee527d840b3a95050b5b9e8268ce940069a6"}],"concept.usgs.2028":[{"id":"assertion.concept.usgs.2028","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil temperature as defined in the captured USGS Thesaurus term 2028","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","support":[{"end":241,"quote":"Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","source_id":"usgs-thesaurus.2028","source_sha256":"180c90b4a0aad47e5fa587c1921c0996004ce3792733a0e93c75ff2ada938964","start":142}],"target_id":"concept.usgs.2028","target_kind":"node","target_sha256":"f17d1b54d8103965a394b548076521510bfa7487b3b954fe9cc11556d3763350"}],"concept.usgs.2031":[{"id":"assertion.concept.usgs.2031","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Karst as defined in the captured USGS Thesaurus term 2031","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Karst as: Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes. This category is also used for karst topography and karstic","support":[{"end":304,"quote":"Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes.\nThis category is also used for\nkarst topography\nand\nkarstic","source_id":"usgs-thesaurus.2031","source_sha256":"372ce9b03c3e41e40441447284aad476a2bb3d4a8721e9fbe1574775bccf2574","start":123}],"target_id":"concept.usgs.2031","target_kind":"node","target_sha256":"aecdbe80118b927dd426a84a20627d2bebdf43317cfd0ca35a9524b88f9f5683"}],"concept.usgs.2043":[{"id":"assertion.concept.usgs.2043","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mineral deposits as defined in the captured USGS Thesaurus term 2043","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mineral deposits as: Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value. This category is also used for ore deposits","support":[{"end":301,"quote":"Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value.\nThis category is also used for\nore deposits","source_id":"usgs-thesaurus.2043","source_sha256":"b6c994f35d393d957c3b6d2cfb09be002939c7a9e0305899c7d841cf7ca8448f","start":135}],"target_id":"concept.usgs.2043","target_kind":"node","target_sha256":"6b16dbe47f07677645bda77a8bcd07ffd6f336d3ba26bda043adbd5e2d334e76"}],"concept.usgs.2058":[{"id":"assertion.concept.usgs.2058","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean acidification as defined in the captured USGS Thesaurus term 2058","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean acidification as: Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","support":[{"end":263,"quote":"Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","source_id":"usgs-thesaurus.2058","source_sha256":"8dbe9fc11898ed6a64c5fe92f1e0b1497961002d8c5fb1ce01c9655c3acb0161","start":156}],"target_id":"concept.usgs.2058","target_kind":"node","target_sha256":"5186cd34428c9c4ce42cfaab6caabd2154209a3df638d6a30473daefdb1c6674"}],"concept.usgs.2068":[{"id":"assertion.concept.usgs.2068","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Tidal currents as defined in the captured USGS Thesaurus term 2068","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Tidal currents as: Currents caused by tidal changes in water level from one body of water to another.","support":[{"end":224,"quote":"Currents caused by tidal changes in water level from one body of water to another.","source_id":"usgs-thesaurus.2068","source_sha256":"c817ec6e5fb62961baf67649cde795b8ac0ca80281384b7fd2464fd2d238d645","start":142}],"target_id":"concept.usgs.2068","target_kind":"node","target_sha256":"0e6a6e119a1b453e0928e3b1e7cb1012c9e32220993def7b4eb83c634ae09ec3"}],"concept.usgs.2069":[{"id":"assertion.concept.usgs.2069","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Barrier island migration as defined in the captured USGS Thesaurus term 2069","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Barrier island migration as: The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","support":[{"end":267,"quote":"The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","source_id":"usgs-thesaurus.2069","source_sha256":"62d2af5286159761586445e78877a9ac479c8aaf3382dd1600c74a694d3a305e","start":162}],"target_id":"concept.usgs.2069","target_kind":"node","target_sha256":"35b8e14bff48666cb4fb51d44aa9c238a26979b6a2bb60f1209a976047032257"}],"concept.usgs.2070":[{"id":"assertion.concept.usgs.2070","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal emergence as defined in the captured USGS Thesaurus term 2070","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal emergence as: Relative uplift of the coast accompanied by seaward displacement of the shoreline. This category is also used for regression (marine)","support":[{"end":281,"quote":"Relative uplift of the coast accompanied by seaward displacement of the shoreline.\nThis category is also used for\nregression (marine)","source_id":"usgs-thesaurus.2070","source_sha256":"8d600734e81c8373f7bef6dd4ee01e546b3701c4b0a09b5e359f1975449f6c69","start":148}],"target_id":"concept.usgs.2070","target_kind":"node","target_sha256":"470cb2afd56d545b1bcc7aad8f80a02fe4bd6d0335c7eeb667fe0aed02b1e83b"}],"concept.usgs.2071":[{"id":"assertion.concept.usgs.2071","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Coastal submergence as defined in the captured USGS Thesaurus term 2071","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Coastal submergence as: Relative subsidence of the coast accompanied by landward displacement of the shoreline. This category is also used for transgression (marine)","support":[{"end":293,"quote":"Relative subsidence of the coast accompanied by landward displacement of the shoreline.\nThis category is also used for\ntransgression (marine)","source_id":"usgs-thesaurus.2071","source_sha256":"fd2c329f3dee73707ae30f81f2849515cf267ab6d399f181382a3f73c3e8980c","start":152}],"target_id":"concept.usgs.2071","target_kind":"node","target_sha256":"0bba603cc32f9759d9d78f9de7d03c751f42515c4964d808dd310239ba019ff7"}],"concept.usgs.2072":[{"id":"assertion.concept.usgs.2072","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Shoreline accretion as defined in the captured USGS Thesaurus term 2072","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Shoreline accretion as: Seaward migration of the shoreline resulting from the addition of earth materials.","support":[{"end":234,"quote":"Seaward migration of the shoreline resulting from the addition of earth materials.","source_id":"usgs-thesaurus.2072","source_sha256":"00a9058e511535e9fa9add5938022ff59987531feb6fd2160d8cc59ed4cd6dd0","start":152}],"target_id":"concept.usgs.2072","target_kind":"node","target_sha256":"e6c4e147d2dba9ddf0b21da6d27dd29ed9cae07499e23a9737a40df398006a64"}],"concept.usgs.2080":[{"id":"assertion.concept.usgs.2080","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sound velocity as defined in the captured USGS Thesaurus term 2080","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sound velocity as: Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties. This category is also used with profiles for sound velocity profiles","support":[{"end":307,"quote":"Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties.\nThis category is also used with\nprofiles\nfor\nsound velocity profiles","source_id":"usgs-thesaurus.2080","source_sha256":"81ff7202ee150b2f3ca962655af3c73b678c4996ceb788762cce24d824721ad0","start":105}],"target_id":"concept.usgs.2080","target_kind":"node","target_sha256":"b7b57bb36fc68c35198ddd56a8dc37172635113a08a9be3f8d533984b44f3365"}],"concept.usgs.2089":[{"id":"assertion.concept.usgs.2089","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Stratigraphic thickness as defined in the captured USGS Thesaurus term 2089","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Stratigraphic thickness as: Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data. This category is also used for isopach , with maps and atlases for isopach maps , sediment thickness , and with maps and atlases for stratigraphic thickness maps","support":[{"end":433,"quote":"Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data.\nThis category is also used for\nisopach\n,  with\nmaps and atlases\nfor\nisopach maps\n,\nsediment thickness\n, and  with\nmaps and atlases\nfor\nstratigraphic thickness maps","source_id":"usgs-thesaurus.2089","source_sha256":"52300acfab5522969a7206ebd1c2d28076b1d1d890341ad7c40b7e01e8a69608","start":153}],"target_id":"concept.usgs.2089","target_kind":"node","target_sha256":"36ac3fa10797bb9ac11412d1f120f14c949ee2aa48935aba637bb030469bc590"}],"concept.usgs.2091":[{"id":"assertion.concept.usgs.2091","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lakebed acoustic reflectivity as defined in the captured USGS Thesaurus term 2091","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lakebed acoustic reflectivity as: Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed. This category is also used for backscatter (lakebed)","support":[{"end":315,"quote":"Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed.\nThis category is also used for\nbackscatter (lakebed)","source_id":"usgs-thesaurus.2091","source_sha256":"73597b7f72b7ba7abd1b610b5a7680339c7e2db0c3de47887e722ede4e82d47b","start":166}],"target_id":"concept.usgs.2091","target_kind":"node","target_sha256":"136d1b4c83ad9fa6206770c3104a524ec60e18422045221c39c02fabd2916aa2"}],"concept.usgs.211":[{"id":"assertion.concept.usgs.211","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Core (earth) as defined in the captured USGS Thesaurus term 211","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Core (earth) as: The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","support":[{"end":257,"quote":"The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","source_id":"usgs-thesaurus.211","source_sha256":"22083940dab7ab13a66d525669d96c3cdcb4abefca6f65e401edff7779e8faad","start":124}],"target_id":"concept.usgs.211","target_kind":"node","target_sha256":"f11fe0f7e6870c129f5131747b3e14d6a57330037ab7b4b3f5d18e245d84eabc"}],"concept.usgs.219":[{"id":"assertion.concept.usgs.219","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Crust (earth) as defined in the captured USGS Thesaurus term 219","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Crust (earth) as: The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","support":[{"end":227,"quote":"The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","source_id":"usgs-thesaurus.219","source_sha256":"88dadf57eeb755bdb9796d8a4941d853be3f8f64546f207d172b9b11e308b1ec","start":126}],"target_id":"concept.usgs.219","target_kind":"node","target_sha256":"dfbb05550662677d7076f5429214e7b39d4c35ce9003a561f30f1d85f885a2ca"}],"concept.usgs.2264":[{"id":"assertion.concept.usgs.2264","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Water column reflectivity as defined in the captured USGS Thesaurus term 2264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Water column reflectivity as: A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles. This category is also used for backscatter (water column) , water column acoustic reflectivity , and water column optical reflectivity","support":[{"end":562,"quote":"A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles.\nThis category is also used for\nbackscatter (water column)\n,\nwater column acoustic reflectivity\n, and\nwater column optical reflectivity","source_id":"usgs-thesaurus.2264","source_sha256":"0a95a5d4e5bf4b2fded3a1270264966bc16f2c8b75fa42e5ff1f3478b876a2fc","start":127}],"target_id":"concept.usgs.2264","target_kind":"node","target_sha256":"f4c8f9d4926f84d6496b2e0c0b85845d2c858ccb60abb496175517289d6c12d3"}],"concept.usgs.2276":[{"id":"assertion.concept.usgs.2276","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Acid neutralizing potential as defined in the captured USGS Thesaurus term 2276","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Acid neutralizing potential as: Geochemical capacity of earth materials to affect the pH of waters flowing through them. This category is also used for acid neutralizing capacity and neutralization potential","support":[{"end":339,"quote":"Geochemical capacity of earth materials to affect the pH of waters flowing through them.\nThis category is also used for\nacid neutralizing capacity\nand\nneutralization potential","source_id":"usgs-thesaurus.2276","source_sha256":"49a14855e0da15a47aa75bd5ea370a933ef838d46cd3beafca21dd3c6366c40e","start":164}],"target_id":"concept.usgs.2276","target_kind":"node","target_sha256":"1155b75aae72aac43ae58bb3e8990236da8b223e4ef904977d64a58925212156"}],"concept.usgs.2277":[{"id":"assertion.concept.usgs.2277","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Carbon flux as defined in the captured USGS Thesaurus term 2277","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange","support":[{"end":282,"quote":"The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things.\nThis category is also used for\ncarbon exchange","source_id":"usgs-thesaurus.2277","source_sha256":"9643e6e583a4a6a8f2179d0e574c9b94077fa74d8bb8e0ca15f2e6aa1580ff81","start":139}],"target_id":"concept.usgs.2277","target_kind":"node","target_sha256":"545f11fbbfff5f26b5a5353301392d144e152b3fb1b79c7335ba35ce17a5a73d"}],"concept.usgs.2279":[{"id":"assertion.concept.usgs.2279","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Thermal maturation as defined in the captured USGS Thesaurus term 2279","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Thermal maturation as: Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum. This category is also used for thermal indices , thermal maturity , and vitrinite reflectance","support":[{"end":470,"quote":"Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum.\nThis category is also used for\nthermal indices\n,\nthermal maturity\n, and\nvitrinite reflectance","source_id":"usgs-thesaurus.2279","source_sha256":"3f5fe6b2f1b4a6a66c6b674058779bb4ddfd5a08f6ee71babf830f808144c7b6","start":154}],"target_id":"concept.usgs.2279","target_kind":"node","target_sha256":"8215401dc01423e0e898083a7a4b4d12214cdc67deae256478c97ab9be4e3869"}],"concept.usgs.2281":[{"id":"assertion.concept.usgs.2281","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecosystem resilience as defined in the captured USGS Thesaurus term 2281","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecosystem resilience as: Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973) This category is also used for ecological resilience","support":[{"end":399,"quote":"Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973)\nThis category is also used for\necological resilience","source_id":"usgs-thesaurus.2281","source_sha256":"bf429f170c1f6c6972873826654b232fbd2eba7911be769ef9bcd0c4ec78b6be","start":157}],"target_id":"concept.usgs.2281","target_kind":"node","target_sha256":"25345cc5484e186d9a681234ef78d8627bba2049f2690ddca2651e81d1dc4600"}],"concept.usgs.2282":[{"id":"assertion.concept.usgs.2282","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fluid migration as defined in the captured USGS Thesaurus term 2282","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fluid migration as: Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces. This category is also used for interstitial fluid and pore fluid","support":[{"end":342,"quote":"Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces.\nThis category is also used for\ninterstitial fluid\nand\npore fluid","source_id":"usgs-thesaurus.2282","source_sha256":"d1fba003dc832c147fab457d7e180e199f6489b697e7676888999e07c2be9036","start":145}],"target_id":"concept.usgs.2282","target_kind":"node","target_sha256":"4325a53e80aaf4d56945053aac32165c3c99886feedc3cc79638b53f3d966f4b"}],"concept.usgs.2290":[{"id":"assertion.concept.usgs.2290","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Electromagnetic reflectance and emissivity as defined in the captured USGS Thesaurus term 2290","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Electromagnetic reflectance and emissivity as: Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength. Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems. This category is also used for infrared reflectance , laboratory reflectance , laboratory spectra , spectral radiance , and spectral reflectance","support":[{"end":615,"quote":"Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength.  Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems.\nThis category is also used for\ninfrared reflectance\n,\nlaboratory reflectance\n,\nlaboratory spectra\n,\nspectral radiance\n, and\nspectral reflectance","source_id":"usgs-thesaurus.2290","source_sha256":"6f65c16e4ecf93ab259f0c114232615c24bce11e9f7d2c2ad2e55b79969a4e3d","start":194}],"target_id":"concept.usgs.2290","target_kind":"node","target_sha256":"4a3bee9382a44c755c08c59c60366ec5a9cb46feff544ba9eeb6da7dfa647e9b"}],"concept.usgs.2291":[{"id":"assertion.concept.usgs.2291","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Gravity gradient as defined in the captured USGS Thesaurus term 2291","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Gravity gradient as: Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors. This category is also used for gravity gradiometry","support":[{"end":310,"quote":"Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors.\nThis category is also used for\ngravity gradiometry","source_id":"usgs-thesaurus.2291","source_sha256":"b72995bcaf359490f357c600413cf4d1b0ef7b8f80c97ecbb16067a4da1122a2","start":144}],"target_id":"concept.usgs.2291","target_kind":"node","target_sha256":"189b0c938b1e30607ae7384e44dbbfa7555ec16b25af9fa36539a0249c17130e"}],"concept.usgs.2295":[{"id":"assertion.concept.usgs.2295","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrocarbon reservoir processes as defined in the captured USGS Thesaurus term 2295","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrocarbon reservoir processes as: Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","support":[{"end":372,"quote":"Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","source_id":"usgs-thesaurus.2295","source_sha256":"828318a5f3f00eac0e7337f0d6f650d4168dfc2da85c6934468d1dc5e02bedf1","start":156}],"target_id":"concept.usgs.2295","target_kind":"node","target_sha256":"9487278ca74f006637f6fac34b338de0146722171387a2f6212f245f72daea09"}],"concept.usgs.2305":[{"id":"assertion.concept.usgs.2305","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Wildfires as defined in the captured USGS Thesaurus term 2305","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Wildfires as: Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments. This category is also used for wildland fire","support":[{"end":380,"quote":"Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments.\nThis category is also used for\nwildland fire","source_id":"usgs-thesaurus.2305","source_sha256":"3ff7055c877336cbfe07e9d93d134532b7879a3476149f3d26ba9eb70492c609","start":120}],"target_id":"concept.usgs.2305","target_kind":"node","target_sha256":"4ffd4c3215ace31791a383abde97324f751e2bc85ad3a82d5b29d3f957ec3b5d"}],"concept.usgs.248":[{"id":"assertion.concept.usgs.248","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Diagenesis as defined in the captured USGS Thesaurus term 248","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Diagenesis as: Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","support":[{"end":246,"quote":"Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","source_id":"usgs-thesaurus.248","source_sha256":"e34b682bf3d711c9e3a6fb59b957877e3bda989174c71db4e4af810bbbe253fb","start":135}],"target_id":"concept.usgs.248","target_kind":"node","target_sha256":"2cd1bd9e64d83e7fd1f37763d498502107c5a80125b9273ccada83f285a4da58"}],"concept.usgs.268":[{"id":"assertion.concept.usgs.268","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Dispersal (organisms) as defined in the captured USGS Thesaurus term 268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Dispersal (organisms) as: The dissemination or geographic spread of individuals of a plant or animal population. This category is also used for colonization (organisms)","support":[{"end":301,"quote":"The dissemination or geographic spread of individuals of a plant or animal population.\nThis category is also used for\ncolonization (organisms)","source_id":"usgs-thesaurus.268","source_sha256":"bb9a8ce5390e4ae4b0ce4f8636de92ca2e0e55420bbf2f20ae9fd78cb56d6f7b","start":159}],"target_id":"concept.usgs.268","target_kind":"node","target_sha256":"22e7fe93881c7e85bc0cb9deca91e67aac851612138fc8c73c2546cd7f0e0f89"}],"concept.usgs.27":[{"id":"assertion.concept.usgs.27","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Air temperature as defined in the captured USGS Thesaurus term 27","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)","support":[{"end":185,"quote":"This category is also used for\ntemperature (air)","source_id":"usgs-thesaurus.27","source_sha256":"6a06ffc0eb2e82e95c8956691cb3befc2a3df25b89e22cf95101db4cee3b67d7","start":137}],"target_id":"concept.usgs.27","target_kind":"node","target_sha256":"f1c8be308228d8b79c53c25c4e3d280401ebcac7571a75daf12b7c57e2688fa4"}],"concept.usgs.284":[{"id":"assertion.concept.usgs.284","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Droughts as defined in the captured USGS Thesaurus term 284","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Droughts as: Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man. This category is also used for drought","support":[{"end":312,"quote":"Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man.\nThis category is also used for\ndrought","source_id":"usgs-thesaurus.284","source_sha256":"bfe8da5555412de7f6d6cf2f143f6641d1a4766ad95a7693142057417b5fab7b","start":147}],"target_id":"concept.usgs.284","target_kind":"node","target_sha256":"5355fc3db818bd301743802639ac11657df6b9603a5c25d6a007368e5de8100f"}],"concept.usgs.292":[{"id":"assertion.concept.usgs.292","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth structure as defined in the captured USGS Thesaurus term 292","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth structure as: Major interior structural features of the planet earth.","support":[{"end":167,"quote":"Major interior structural features of the planet earth.","source_id":"usgs-thesaurus.292","source_sha256":"92286eef60976e6749c02ca541229ab6d5542dee6ca751099ff3b912e3e83a4a","start":112}],"target_id":"concept.usgs.292","target_kind":"node","target_sha256":"ab562ae9e139c76441b9cfbf421af53b8345bf5c89efcb45d7fb09315a34779c"}],"concept.usgs.30":[{"id":"assertion.concept.usgs.30","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Algal blooms as defined in the captured USGS Thesaurus term 30","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides","support":[{"end":364,"quote":"Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions.\nThis category is also used for\nbrown tides\n,  with\nhazards\nfor\nharmful algal blooms\n, and\nred tides","source_id":"usgs-thesaurus.30","source_sha256":"a47846494a60aa3649f9dcd5745354a6f6fcdc899988f2634b00c859d77f3e1a","start":141}],"target_id":"concept.usgs.30","target_kind":"node","target_sha256":"a3654993d4a92ba515e4acf6ca17ca0bafa5758622e9aafaada4c07fbaca0b89"}],"concept.usgs.304":[{"id":"assertion.concept.usgs.304","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earthquakes as defined in the captured USGS Thesaurus term 304","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earthquakes as: Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth. This category is also used with hazards for earthquake hazards","support":[{"end":404,"quote":"Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth.\nThis category is also used with\nhazards\nfor\nearthquake hazards","source_id":"usgs-thesaurus.304","source_sha256":"d5588013a51ce6c6e3c77160ae7bc9d77424c82023ef68a92ac7f9445172390e","start":137}],"target_id":"concept.usgs.304","target_kind":"node","target_sha256":"f035acbeeadbd64d7a20ec63f2b6f4ce1e16cbfdc420f385633ae770e603c32d"}],"concept.usgs.308":[{"id":"assertion.concept.usgs.308","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecological competition as defined in the captured USGS Thesaurus term 308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecological competition as: The struggle between members of two or more species for scarce environmental resources.","support":[{"end":248,"quote":"The struggle between members of two or more species for scarce environmental resources.","source_id":"usgs-thesaurus.308","source_sha256":"92f05afec7d255fe65f6dbd1b05a72cc42418c3a223c65cce0b45c6c78d5dbd0","start":161}],"target_id":"concept.usgs.308","target_kind":"node","target_sha256":"c1031accff64e8da9f58663e88e3fbf81441369dffcdcd08b75372930681fe7c"}],"concept.usgs.310":[{"id":"assertion.concept.usgs.310","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecological processes as defined in the captured USGS Thesaurus term 310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecological processes as: Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere. This category is also used for ecological models and environmental processes","support":[{"end":323,"quote":"Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere.\nThis category is also used for\necological models\nand\nenvironmental processes","source_id":"usgs-thesaurus.310","source_sha256":"95bc0804c8382ba580758b6df4ff14b42b8cd8bbebb34be60e0ee5705523119f","start":134}],"target_id":"concept.usgs.310","target_kind":"node","target_sha256":"9366bc7f34ebec197a8d8c7068326d9f343a1fe5fa7e8b9748b021921a377f28"}],"concept.usgs.315":[{"id":"assertion.concept.usgs.315","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ecosystem functions as defined in the captured USGS Thesaurus term 315","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ecosystem functions as: The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment. This category is also used with estuarine ecosystems for estuarine ecosystem functions","support":[{"end":376,"quote":"The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment.\nThis category is also used with\nestuarine ecosystems\nfor\nestuarine ecosystem functions","source_id":"usgs-thesaurus.315","source_sha256":"a73010a70320b1db812bbdc20cbcb92a057bc8a1072643315f3a46bffa921ce3","start":155}],"target_id":"concept.usgs.315","target_kind":"node","target_sha256":"0a3fadc548c9656cad1032b0fb4712a1ffe4c0d5dc11f7c946952a16934007a1"}],"concept.usgs.353":[{"id":"assertion.concept.usgs.353","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Erosion as defined in the captured USGS Thesaurus term 353","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Erosion as: The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another. This category is also used with coastal processes for beach erosion , with coastal processes for coastal erosion , dissolution , with coastal processes for shoreline erosion , with coastal processes for shoreline retreat , and with wind for wind erosion","support":[{"end":527,"quote":"The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another.\nThis category is also used with\ncoastal processes\nfor\nbeach erosion\n,  with\ncoastal processes\nfor\ncoastal erosion\n,\ndissolution\n,  with\ncoastal processes\nfor\nshoreline erosion\n,  with\ncoastal processes\nfor\nshoreline retreat\n, and  with\nwind\nfor\nwind erosion","source_id":"usgs-thesaurus.353","source_sha256":"2dcb37c7f3a5fcfab0e326d64607705d0e39af706576665908b49e90948b1391","start":129}],"target_id":"concept.usgs.353","target_kind":"node","target_sha256":"ec32f7adaa8ce8047a396cbcd0de797a0ae92f99975eec134d85c45b27583a01"}],"concept.usgs.359":[{"id":"assertion.concept.usgs.359","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Eutrophication as defined in the captured USGS Thesaurus term 359","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Eutrophication as: The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","support":[{"end":249,"quote":"The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","source_id":"usgs-thesaurus.359","source_sha256":"b7ce266fba49d497d8cf1871003d1240080dd8774ccf245e16d56366c5bad60d","start":145}],"target_id":"concept.usgs.359","target_kind":"node","target_sha256":"c4f8ec8fb4cafd14b71151ec1f3f5c0aeb9a5fec9df5ec32dcaa7a3e1a1fafbd"}],"concept.usgs.365":[{"id":"assertion.concept.usgs.365","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Extinction and extirpation as defined in the captured USGS Thesaurus term 365","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Extinction and extirpation as: Extinction is the complete disappearance of a species from the earth. Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area. This category is also used for extirpation","support":[{"end":389,"quote":"Extinction is the complete disappearance of a species from the earth.  Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area.\nThis category is also used for\nextirpation","source_id":"usgs-thesaurus.365","source_sha256":"6c7377c4f180eefe748766b44e58676a697b3f635aa2636407aed70632086f7d","start":169}],"target_id":"concept.usgs.365","target_kind":"node","target_sha256":"e1a320661bb76e5c9a84b09199ed1d6a9c0d97baedb87e9443fb8ce070135ea0"}],"concept.usgs.384":[{"id":"assertion.concept.usgs.384","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fires as defined in the captured USGS Thesaurus term 384","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fires as: Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires. This category is also used with hazard preparedness for fire preparedness and fires (uncontrolled)","support":[{"end":411,"quote":"Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires.\nThis category is also used with\nhazard preparedness\nfor\nfire preparedness\nand\nfires (uncontrolled)","source_id":"usgs-thesaurus.384","source_sha256":"0f9e88f176714b011be2eba01da0188a18e7ea6119ccd213082dffeba4c496b1","start":104}],"target_id":"concept.usgs.384","target_kind":"node","target_sha256":"24bf8fe86f0af38b3c6c674ffab1cfe9b2f655aafe83736943639c8ba84ac63b"}],"concept.usgs.391":[{"id":"assertion.concept.usgs.391","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fishery resources as defined in the captured USGS Thesaurus term 391","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fishery resources as: The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","support":[{"end":233,"quote":"The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","source_id":"usgs-thesaurus.391","source_sha256":"6d70daf57b7f7208c8daa03bbacbbd0fca2e9caed89e93e1ac49650391f20ece","start":112}],"target_id":"concept.usgs.391","target_kind":"node","target_sha256":"4edc7070dd3cac4ccd37913cd2bf7a69e8b543333febdb51652266a58ad50315"}],"concept.usgs.398":[{"id":"assertion.concept.usgs.398","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Floods as defined in the captured USGS Thesaurus term 398","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Floods as: Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level. This category is also used for bankfull stage and with hazard preparedness for flood preparedness","support":[{"end":376,"quote":"Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level.\nThis category is also used for\nbankfull stage\nand  with\nhazard preparedness\nfor\nflood preparedness","source_id":"usgs-thesaurus.398","source_sha256":"350e22adc918377e2fead93583c09e0db7f8cf18970e9e367c57c4b7f1ee5e56","start":129}],"target_id":"concept.usgs.398","target_kind":"node","target_sha256":"edbbac770ea21976a8dab39e521966c6b35221437a9cf0c756239692973e83f3"}],"concept.usgs.404":[{"id":"assertion.concept.usgs.404","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Foliation (geologic) as defined in the captured USGS Thesaurus term 404","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Foliation (geologic) as: The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","support":[{"end":270,"quote":"The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","source_id":"usgs-thesaurus.404","source_sha256":"a3f2fc935e0743efe6e0c2582da2834676484937c2aa2828ccfa9c90386871fb","start":143}],"target_id":"concept.usgs.404","target_kind":"node","target_sha256":"aaf02d4d8fd2ec6e99371ae71cec4ff40a8d08d89b3f1539961857ac727cc158"}],"concept.usgs.411":[{"id":"assertion.concept.usgs.411","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Forest resources as defined in the captured USGS Thesaurus term 411","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Forest resources as: Trees and associated vegetation available for human use. Use for timber and other forest resources with economic value. This category is also used for forestry","support":[{"end":270,"quote":"Trees and associated vegetation available for human use.  Use for timber and other forest resources with economic value.\nThis category is also used for\nforestry","source_id":"usgs-thesaurus.411","source_sha256":"ba81650877adc141fcd9c11e3bf736c0fcdf4560b001396bdbc5c3112e16a0b4","start":110}],"target_id":"concept.usgs.411","target_kind":"node","target_sha256":"9fb2a46800dd8281e4e3cea83aa6cf6f107d2b36247c9e08d6ad8cc6285ee60e"}],"concept.usgs.414":[{"id":"assertion.concept.usgs.414","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Fossils as defined in the captured USGS Thesaurus term 414","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Fossils as: Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth. This category is also used for index fossils and microfossils","support":[{"end":289,"quote":"Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth.\nThis category is also used for\nindex fossils\nand\nmicrofossils","source_id":"usgs-thesaurus.414","source_sha256":"ce87ec3b7297bb31173898a7db9dde3484b23e7cabbe02af7600118a3702eafc","start":117}],"target_id":"concept.usgs.414","target_kind":"node","target_sha256":"21a5be7824e40800cd85864bd78794e5c3550bdf3f035e0003ab1878a669a849"}],"concept.usgs.435":[{"id":"assertion.concept.usgs.435","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geochemical processes as defined in the captured USGS Thesaurus term 435","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","support":[{"end":257,"quote":"Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","source_id":"usgs-thesaurus.435","source_sha256":"a953c8432a136596af5f9500b2434db67449e2a2d06c125ce9e4247db21b95a3","start":136}],"target_id":"concept.usgs.435","target_kind":"node","target_sha256":"e2ce56c0e550b88486c7738430bfc618a04125651c6702a1a5003ad2404adf30"}],"concept.usgs.440":[{"id":"assertion.concept.usgs.440","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geodesy as defined in the captured USGS Thesaurus term 440","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geodesy as: Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","support":[{"end":322,"quote":"Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","source_id":"usgs-thesaurus.440","source_sha256":"2e1ad2ab1451e8850992fc39ab820b5eb81746fd8d252c49bd183f818bf9d392","start":104}],"target_id":"concept.usgs.440","target_kind":"node","target_sha256":"991e6dc61ea774d2b2d8495bb8d002d49e19cb16ac520b5ed17982b59e09b07b"}],"concept.usgs.451":[{"id":"assertion.concept.usgs.451","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic processes as defined in the captured USGS Thesaurus term 451","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic processes as: All types of processes involving geological structures. This category is also used for lithification","support":[{"end":230,"quote":"All types of processes involving geological structures.\nThis category is also used for\nlithification","source_id":"usgs-thesaurus.451","source_sha256":"e46db624243362bd4f452bbabad397726ba6ce3548867f98abbf9f029cfe9fba","start":130}],"target_id":"concept.usgs.451","target_kind":"node","target_sha256":"bb6d7ed3258c76b251f341c7f5ef58ce3a0ae0be812762ad65ff65408f1fc996"}],"concept.usgs.452":[{"id":"assertion.concept.usgs.452","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic contacts as defined in the captured USGS Thesaurus term 452","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic contacts as: Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes. This category is also used for contacts (geologic)","support":[{"end":320,"quote":"Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes.\nThis category is also used for\ncontacts (geologic)","source_id":"usgs-thesaurus.452","source_sha256":"83511b9925d107683512b72918b367b6a89a8593b4c7e310b4908dcf55c8b843","start":141}],"target_id":"concept.usgs.452","target_kind":"node","target_sha256":"8f69fad01afd5ca0ca03cb8e30611b3a860ed7fa2fff3859a46d502cf4cd57b3"}],"concept.usgs.459":[{"id":"assertion.concept.usgs.459","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic structure as defined in the captured USGS Thesaurus term 459","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic structure as: General position of rocks in an area, and geometrical relationships among rocks.","support":[{"end":198,"quote":"General position of rocks in an area, and geometrical relationships among rocks.","source_id":"usgs-thesaurus.459","source_sha256":"f68198744a8e61af855a2f23237e0d37e1eb1bb1f307355ea8b9a4147105c153","start":118}],"target_id":"concept.usgs.459","target_kind":"node","target_sha256":"45e60b5ab731faf20bb2e3a574a16d26428c0603fff527dc9c5b67dea813d1c0"}],"concept.usgs.482":[{"id":"assertion.concept.usgs.482","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Glaciation as defined in the captured USGS Thesaurus term 482","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Glaciation as: The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","support":[{"end":247,"quote":"The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","source_id":"usgs-thesaurus.482","source_sha256":"66b860eb92d46b179bfc365c24a2f3e7d87df55f0608579d19ea302960eb7abc","start":135}],"target_id":"concept.usgs.482","target_kind":"node","target_sha256":"206e7a3509df43583d619b314c126e529a9924e263fa037b5d4014b56af70195"}],"concept.usgs.501":[{"id":"assertion.concept.usgs.501","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Gravitational field (earth) as defined in the captured USGS Thesaurus term 501","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Gravitational field (earth) as: Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them. This category is also used for gravity , with maps and atlases for gravity anomaly maps , and gravity field","support":[{"end":415,"quote":"Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them.\nThis category is also used for\ngravity\n,  with\nmaps and atlases\nfor\ngravity anomaly maps\n, and\ngravity field","source_id":"usgs-thesaurus.501","source_sha256":"1daa8556ba43d8d29252064c82b00805b92c26803922c9b37e0d118ac8f3ffd9","start":136}],"target_id":"concept.usgs.501","target_kind":"node","target_sha256":"a97631917af645c7ddf7435e1848015eddd8b8927dd55b5eb8b277eac5b2f9fe"}],"concept.usgs.514":[{"id":"assertion.concept.usgs.514","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Groundwater flow as defined in the captured USGS Thesaurus term 514","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Groundwater flow as: Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge. This category is also used for ground-water flow , groundwater flow modeling , and groundwater movement","support":[{"end":349,"quote":"Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge.\nThis category is also used for\nground-water flow\n,\ngroundwater flow modeling\n, and\ngroundwater movement","source_id":"usgs-thesaurus.514","source_sha256":"f9fc1beffc0522deb285e94fc0a2b553bae33cdcd38fc4b6aa4fba3a7103e561","start":149}],"target_id":"concept.usgs.514","target_kind":"node","target_sha256":"c08959c44acb85f07a34d4d2d1f1a038eb2c11199e9d11c3a493017659394ff8"}],"concept.usgs.522":[{"id":"assertion.concept.usgs.522","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Habitat alteration and disturbance as defined in the captured USGS Thesaurus term 522","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Habitat alteration and disturbance as: Changes in the environments where plants and animals live. Includes natural changes as well as results of human actions, deliberate or accidental. This category is also used for ecological disturbance , environmental disturbance , habitat destruction , and habitat disturbance","support":[{"end":462,"quote":"Changes in the environments where plants and animals live.  Includes natural changes as well as results of human actions, deliberate or accidental.\nThis category is also used for\necological disturbance\n,\nenvironmental disturbance\n,\nhabitat destruction\n, and\nhabitat disturbance","source_id":"usgs-thesaurus.522","source_sha256":"74836441f10673c29ff09190ce7fcb24a4f85e6d15e4d328f620604bc3f5d767","start":185}],"target_id":"concept.usgs.522","target_kind":"node","target_sha256":"585df39a949d0cfe10efbf0d9fc522f6fc013a5fa9081bdce59b0d71df001b10"}],"concept.usgs.531":[{"id":"assertion.concept.usgs.531","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hazards as defined in the captured USGS Thesaurus term 531","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hazards as: Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment. This category is also used for catastrophes , with coastal processes for coastal hazards , disasters , with earthquakes for earthquake hazards , emergency management resources , environmental hazards , geologic hazards , with algal blooms for harmful algal blooms , and with ocean processes for ocean hazards","support":[{"end":516,"quote":"Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment.\nThis category is also used for\ncatastrophes\n,  with\ncoastal processes\nfor\ncoastal hazards\n,\ndisasters\n,  with\nearthquakes\nfor\nearthquake hazards\n,\nemergency management resources\n,\nenvironmental hazards\n,\ngeologic hazards\n,  with\nalgal blooms\nfor\nharmful algal blooms\n, and  with\nocean processes\nfor\nocean hazards","source_id":"usgs-thesaurus.531","source_sha256":"e8b78cfabb7063d79d6059b1ca9ea3be8d4a9c09535c63efa99b0c75a7b6115e","start":72}],"target_id":"concept.usgs.531","target_kind":"node","target_sha256":"14557e4b4a1170dd25e5f0f58fce42c1978709c1764a5b1a5e71f0e453b36167"}],"concept.usgs.534":[{"id":"assertion.concept.usgs.534","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Heat flow (earth) as defined in the captured USGS Thesaurus term 534","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Heat flow (earth) as: Energy transferred by a difference in temperature through the surface of the earth. This category is also used for geothermics and heatflow (earth)","support":[{"end":296,"quote":"Energy transferred by a difference in temperature through the surface of the earth.\nThis category is also used for\ngeothermics\nand\nheatflow (earth)","source_id":"usgs-thesaurus.534","source_sha256":"6a8b929a06365044cce22653f8732aa754028b662e7db7248383226409c9a420","start":149}],"target_id":"concept.usgs.534","target_kind":"node","target_sha256":"38b0aca3ba0474eab901fb4a037f748abbfe9a35f536a3906949b7df876d25ba"}],"concept.usgs.562":[{"id":"assertion.concept.usgs.562","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrothermal processes as defined in the captured USGS Thesaurus term 562","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.","support":[{"end":232,"quote":"Natural phenomena relating to heated water generated by igneous activity.","source_id":"usgs-thesaurus.562","source_sha256":"8a71b4386761b2106f0dee125338412bb34adbb01f08ee96d5113cfc7b1cdbb0","start":159}],"target_id":"concept.usgs.562","target_kind":"node","target_sha256":"e801535a0af509c0d1838e0c48143bba437ed75f49389f2cad649f7c819afadd"}],"concept.usgs.572":[{"id":"assertion.concept.usgs.572","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Igneous rocks as defined in the captured USGS Thesaurus term 572","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Igneous rocks as: Rocks formed from melted rock that has cooled and solidified.","support":[{"end":190,"quote":"Rocks formed from melted rock that has cooled and solidified.","source_id":"usgs-thesaurus.572","source_sha256":"68de0220444c5d18efcef3c17101ba9c240d27b02f4baad105ddc50ffd3eadb5","start":129}],"target_id":"concept.usgs.572","target_kind":"node","target_sha256":"6b2ce2687fc7c69f4a05ea19d484a4bfd98dece6b5163cf8b902b767f85bdd6b"}],"concept.usgs.608":[{"id":"assertion.concept.usgs.608","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Isostasy as defined in the captured USGS Thesaurus term 608","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Isostasy as: Condition of equilibrium or buoyancy of the earth's crust above the mantle.","support":[{"end":206,"quote":"Condition of equilibrium or buoyancy of the earth's crust above the mantle.","source_id":"usgs-thesaurus.608","source_sha256":"9de444e25e1588079fc15fe431d298861003d37c73aef9773f0bf0b19e2889c9","start":131}],"target_id":"concept.usgs.608","target_kind":"node","target_sha256":"39078814c6d343a54728d08bf97d95ecd653608c25feda6e2ec7a7eca89eed9a"}],"concept.usgs.624":[{"id":"assertion.concept.usgs.624","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Subsidence as defined in the captured USGS Thesaurus term 624","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Subsidence as: Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas. This category is also used for land subsidence and with maps and atlases for land subsidence maps","support":[{"end":357,"quote":"Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas.\nThis category is also used for\nland subsidence\nand  with\nmaps and atlases\nfor\nland subsidence maps","source_id":"usgs-thesaurus.624","source_sha256":"1f5f37c1ef10306ae077a07566d9b171a0a1024cdd92457bb60418a5c35aebd9","start":135}],"target_id":"concept.usgs.624","target_kind":"node","target_sha256":"0e2d107f4bcaff0f5b89d0ea313d19b8df346e877403ecc478e5253dade8662e"}],"concept.usgs.63":[{"id":"assertion.concept.usgs.63","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric and climatic processes as defined in the captured USGS Thesaurus term 63","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric and climatic processes as: Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions. This category is also used for climate , microclimate , weather , with field inventory and monitoring for weather monitoring , and with field inventory and monitoring for weather observations","support":[{"end":507,"quote":"Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions.\nThis category is also used for\nclimate\n,\nmicroclimate\n,\nweather\n,  with\nfield inventory and monitoring\nfor\nweather monitoring\n, and  with\nfield inventory and monitoring\nfor\nweather observations","source_id":"usgs-thesaurus.63","source_sha256":"d2880c4405d4d156d5f745e3166ef1a41f554a933935f2dcd2ee077a0c797754","start":162}],"target_id":"concept.usgs.63","target_kind":"node","target_sha256":"4587f59c0860aa5314b4dc6fc342ead1ab6bc5d96f03ad217f02226e756baa91"}],"concept.usgs.64":[{"id":"assertion.concept.usgs.64","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric circulation as defined in the captured USGS Thesaurus term 64","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.","support":[{"end":224,"quote":"Movement of atmospheric gases around the earth.","source_id":"usgs-thesaurus.64","source_sha256":"4ec370930fc44718196e072775863fed158e057e90a2cfc73bd6806fb8400996","start":177}],"target_id":"concept.usgs.64","target_kind":"node","target_sha256":"8671f65f2770696830f763fd73d1f519374b888baa27c38bb63b074c0e8abad1"}],"concept.usgs.65":[{"id":"assertion.concept.usgs.65","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric composition as defined in the captured USGS Thesaurus term 65","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution","support":[{"end":376,"quote":"Components of the mass of gases that surrounds a planet.  The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases.\nThis category is also used with\ncontamination and pollution\nfor\nair pollution","source_id":"usgs-thesaurus.65","source_sha256":"1d023bb1608cc042d18e601324745d230c1b92b6eb0994339b4471a1b5e4d53e","start":153}],"target_id":"concept.usgs.65","target_kind":"node","target_sha256":"82b0019e8240ae5e54e169020999b506e77dd3443b04374431101706d269a6d6"}],"concept.usgs.66":[{"id":"assertion.concept.usgs.66","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric deposition (chemical & particulate) as defined in the captured USGS Thesaurus term 66","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric deposition (chemical & particulate) as: The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles). This category is also used for atmospheric deposition (chemical and particulate) and atmospheric dust deposition","support":[{"end":506,"quote":"The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles).\nThis category is also used for\natmospheric deposition (chemical and particulate)\nand\natmospheric dust deposition","source_id":"usgs-thesaurus.66","source_sha256":"2b220058d3a000c35e561292540258c09947800ee011c51fe0e64f1a4ea2057a","start":225}],"target_id":"concept.usgs.66","target_kind":"node","target_sha256":"6229cb7f5c2ab2b6db038a056b4f50d00926df7bd941f3ae7c4c9847c215bf3c"}],"concept.usgs.660":[{"id":"assertion.concept.usgs.660","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lineation (geologic) as defined in the captured USGS Thesaurus term 660","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lineation (geologic) as: Linear topographic feature on the earth's surface or in rocks. This category is also used for lineaments","support":[{"end":247,"quote":"Linear topographic feature on the earth's surface or in rocks.\nThis category is also used for\nlineaments","source_id":"usgs-thesaurus.660","source_sha256":"0408d0ecda228dd1f923b3bb8179c1a36a5d850412c4e00e8238f2cab08fc065","start":143}],"target_id":"concept.usgs.660","target_kind":"node","target_sha256":"1788f5fa0de18f9a0100e79bf5ef0cdb309fac58001a19efa4bce6742da7db20"}],"concept.usgs.67":[{"id":"assertion.concept.usgs.67","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric properties as defined in the captured USGS Thesaurus term 67","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric properties as: Characteristics of the mass of gases surrounding the earth such as composition, temperature, pressure, and humidity. This category is also used for atmosphere properties","support":[{"end":296,"quote":"Characteristics of the mass of gases surrounding the earth  such as composition, temperature, pressure, and humidity.\nThis category is also used for\natmosphere properties","source_id":"usgs-thesaurus.67","source_sha256":"b106aa8112b498fd7f10fbde22492535ed892a33bf4aeba1357cfe146fe0a36d","start":126}],"target_id":"concept.usgs.67","target_kind":"node","target_sha256":"effd65fe5b7b9f95046e715d05556d2a58aece6e4517d323f68505e31b052f51"}],"concept.usgs.677":[{"id":"assertion.concept.usgs.677","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Magnetic field (earth) as defined in the captured USGS Thesaurus term 677","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere","support":[{"end":512,"quote":"The magnetic region surrounding earth.  It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles.\nThis category is also used for\ngeomagnetic field\n,\ngeomagnetics\n,\ngeomagnetism\n,  with\nmaps and atlases\nfor\nmagnetic anomaly maps\n,\nmagnetic field\n, and\nmagnetosphere","source_id":"usgs-thesaurus.677","source_sha256":"a6cfad72b19379d7710ec186243f784fcce1b5c04bb83167f4b466bddc69136c","start":126}],"target_id":"concept.usgs.677","target_kind":"node","target_sha256":"34789bedc53461ae9aaf2a94c5093cf817d77855439b21a110f123fa6f9d140a"}],"concept.usgs.690":[{"id":"assertion.concept.usgs.690","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mantle (earth) as defined in the captured USGS Thesaurus term 690","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mantle (earth) as: Zone of earth's interior between the crust and the core. It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","support":[{"end":362,"quote":"Zone of earth's interior between the crust and the core.  It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","source_id":"usgs-thesaurus.690","source_sha256":"6acb1cd1a761ca35ec65bd99f356ed93e5ed0676037fcc0cd7a2c76feb560890","start":128}],"target_id":"concept.usgs.690","target_kind":"node","target_sha256":"6518a382398e5dd55c4bdded22977d1d876ef16ebe770d363a92e3b66640bb3c"}],"concept.usgs.703":[{"id":"assertion.concept.usgs.703","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine chemistry as defined in the captured USGS Thesaurus term 703","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine chemistry as: Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans. This category is also used for chemical oceanography , ocean chemistry , and water properties (marine)","support":[{"end":374,"quote":"Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans.\nThis category is also used for\nchemical oceanography\n,\nocean chemistry\n, and\nwater properties (marine)","source_id":"usgs-thesaurus.703","source_sha256":"2f9dbb636c96f597b16bb777defd75a08032ce17162f9b0c7722a55974c7d472","start":142}],"target_id":"concept.usgs.703","target_kind":"node","target_sha256":"35ee298eada582883cd3935782632573137dc6bf3b144f6fa786334e2d46bc2a"}],"concept.usgs.725":[{"id":"assertion.concept.usgs.725","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Metamorphic rocks as defined in the captured USGS Thesaurus term 725","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Metamorphic rocks as: Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","support":[{"end":321,"quote":"Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","source_id":"usgs-thesaurus.725","source_sha256":"9b55905ac3a3689e53f49b3a6e7558ada24756ab69db0915f7f0da2e55e0c75a","start":137}],"target_id":"concept.usgs.725","target_kind":"node","target_sha256":"741e8de664b22fb4755aa11ef87b92671fcc3bc0b632f8c566d9482698933058"}],"concept.usgs.727":[{"id":"assertion.concept.usgs.727","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Metamorphism (geological) as defined in the captured USGS Thesaurus term 727","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","support":[{"end":286,"quote":"Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","source_id":"usgs-thesaurus.727","source_sha256":"82e97d11d1d66484217ab5a9321052b756f610e69ab1d5eb6249bbfdb8ca0840","start":165}],"target_id":"concept.usgs.727","target_kind":"node","target_sha256":"4a94f75142c5097b3af06bef6af9c6bb3f1c2e6092d352965ad2c6deb1b7b64c"}],"concept.usgs.743":[{"id":"assertion.concept.usgs.743","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Migration (organisms) as defined in the captured USGS Thesaurus term 743","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Migration (organisms) as: The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions. This category is also used with invasive species for biological invasions , with biogeography for flyways , and seasonal migration","support":[{"end":429,"quote":"The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions.\nThis category is also used with\ninvasive species\nfor\nbiological invasions\n,  with\nbiogeography\nfor\nflyways\n, and\nseasonal migration","source_id":"usgs-thesaurus.743","source_sha256":"779f25eea3a696c2a7f0fb9853da7ac2b653bb3b8295cb07277e1391f4af0537","start":159}],"target_id":"concept.usgs.743","target_kind":"node","target_sha256":"4e3dc6803b4fd4ca207a2bac7e3f713cfa1d1ec533a8d88bdd6e75b567aa33e2"}],"concept.usgs.745":[{"id":"assertion.concept.usgs.745","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Mineral resources as defined in the captured USGS Thesaurus term 745","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Mineral resources as: Natural occurrences of useful inorganic elements or compounds.","support":[{"end":174,"quote":"Natural occurrences of useful inorganic elements or compounds.","source_id":"usgs-thesaurus.745","source_sha256":"d08f4db09a0c5adafbb85e68fc8710c91f1af42e1b6357020c4a8f3889118110","start":112}],"target_id":"concept.usgs.745","target_kind":"node","target_sha256":"8f03446fc7c819ea21d7a37193edda3e3bc1b042857b7014f3f4d8d6b6428624"}],"concept.usgs.777":[{"id":"assertion.concept.usgs.777","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Natural resources as defined in the captured USGS Thesaurus term 777","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Natural resources as: Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","support":[{"end":243,"quote":"Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","source_id":"usgs-thesaurus.777","source_sha256":"5a1a60c3984fc8a6cd66b15aeae4bdebf6cd424582c93c15638f25b27764c026","start":92}],"target_id":"concept.usgs.777","target_kind":"node","target_sha256":"ddb7fff7c7c83694a7b3c8d540e1a7326c35537751f33f9fc9a3bbc862729c39"}],"concept.usgs.799":[{"id":"assertion.concept.usgs.799","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Energy resources as defined in the captured USGS Thesaurus term 799","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Energy resources as: Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy. This category is also used for energy sources and fossil fuels","support":[{"end":292,"quote":"Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy.\nThis category is also used for\nenergy sources\nand\nfossil fuels","source_id":"usgs-thesaurus.799","source_sha256":"b3defc5af01386048f25aeb6696d627b46835726b327fe09cbf9afc9f9c9a56c","start":110}],"target_id":"concept.usgs.799","target_kind":"node","target_sha256":"e8f7f3fc15750c54f5283fa062f6fb249d73446326940e17d668a748f53b8e52"}],"concept.usgs.80":[{"id":"assertion.concept.usgs.80","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bathymetry as defined in the captured USGS Thesaurus term 80","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bathymetry as: The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface. This category is also used for bathymetry data , sea floor topography , and underwater contours","support":[{"end":364,"quote":"The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface.\nThis category is also used for\nbathymetry data\n,\nsea floor topography\n, and\nunderwater contours","source_id":"usgs-thesaurus.80","source_sha256":"da62756dfd43151c6c16988cc2c6e36d66552eec6d1d1be572cb36bdef414d35","start":115}],"target_id":"concept.usgs.80","target_kind":"node","target_sha256":"7bf178aa2668ecc971ae2db7263653ea156194df15901941b7e8049e4c7d0569"}],"concept.usgs.806":[{"id":"assertion.concept.usgs.806","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Nutrient content (water) as defined in the captured USGS Thesaurus term 806","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Nutrient content (water) as: Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water. This category is also used for nitrogen content and phosphorus content","support":[{"end":410,"quote":"Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water.\nThis category is also used for\nnitrogen content\nand\nphosphorus content","source_id":"usgs-thesaurus.806","source_sha256":"6a6b244edecdec3620f43bd9fd641fe5b731d9bc6babcb816d357a5b38e61f29","start":125}],"target_id":"concept.usgs.806","target_kind":"node","target_sha256":"64a80071885ead05fb9a3e811f79a468f37095acbc43fb54219b5c9016f4db7e"}],"concept.usgs.816":[{"id":"assertion.concept.usgs.816","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean processes as defined in the captured USGS Thesaurus term 816","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean processes as: Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans. This category is also used with sediment transport for marine sediment transport , with hazards for ocean hazards , and with ocean characteristics for oceans","support":[{"end":393,"quote":"Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans.\nThis category is also used with\nsediment transport\nfor\nmarine sediment transport\n,  with\nhazards\nfor\nocean hazards\n, and  with\nocean characteristics\nfor\noceans","source_id":"usgs-thesaurus.816","source_sha256":"a3dedf689394cf36e4c121427f4d9547d402e07d297f2c43047816274c5e2524","start":124}],"target_id":"concept.usgs.816","target_kind":"node","target_sha256":"64867346fd2914149d4035631b15b2d004d3d329854cbaf5009fcc7031db4e09"}],"concept.usgs.817":[{"id":"assertion.concept.usgs.817","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean salinity as defined in the captured USGS Thesaurus term 817","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean salinity as: Measure of the percentage of dissolved salts in seawater.","support":[{"end":191,"quote":"Measure of the percentage of dissolved salts in seawater.","source_id":"usgs-thesaurus.817","source_sha256":"f8ff9095b9fd513dc88a0428fdcb1f02c11581943211e9e51b2757a80e0bfc26","start":134}],"target_id":"concept.usgs.817","target_kind":"node","target_sha256":"92b7cddacc277768f9aa0bcf94fd204466522f0f1aac2036f7342d11b446583b"}],"concept.usgs.819":[{"id":"assertion.concept.usgs.819","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean temperature as defined in the captured USGS Thesaurus term 819","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)","support":[{"end":374,"quote":"Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters.  Includes discussion and measures of both in-situ and potential temperature.\nThis category is also used for\ntemperature (ocean)","source_id":"usgs-thesaurus.819","source_sha256":"429ad76720d7741f187573874d3acfedc7b121aca0e23bab84ed89c1d92fc9ec","start":140}],"target_id":"concept.usgs.819","target_kind":"node","target_sha256":"28c408bc96816fb768b4f05f1d83825d1110502cd2542db7064415d37c9db24f"}],"concept.usgs.823":[{"id":"assertion.concept.usgs.823","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean-atmosphere interaction as defined in the captured USGS Thesaurus term 823","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean-atmosphere interaction as: Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans. This category is also used for El Nino and La Nina","support":[{"end":429,"quote":"Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans.\nThis category is also used for\nEl Nino\nand\nLa Nina","source_id":"usgs-thesaurus.823","source_sha256":"1a4022c24856143afc083a1bcae4f194f6e670a3cd43f3b19f093f44c4d9cb73","start":187}],"target_id":"concept.usgs.823","target_kind":"node","target_sha256":"4b9a2bef36bf17b67300ec18f8bd8d1ee2c1a17758dda333c78f0719ab8a1d71"}],"concept.usgs.84":[{"id":"assertion.concept.usgs.84","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bedrock geologic units as defined in the captured USGS Thesaurus term 84","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bedrock geologic units as: Units of consolidated (solid) rock that underlie soils or other unconsolidated materials. This category is also used with maps and atlases for basement maps and geologic formations","support":[{"end":331,"quote":"Units of consolidated (solid) rock that underlie soils or other unconsolidated materials.\nThis category is also used with\nmaps and atlases\nfor\nbasement maps\nand\ngeologic formations","source_id":"usgs-thesaurus.84","source_sha256":"b0aa5da46deed69a730a9ade33ce27def09d6d427d4f7db6078b2a4130bc20fb","start":151}],"target_id":"concept.usgs.84","target_kind":"node","target_sha256":"142ee12bf55fe217b073b239a1c8f3586f5fda50eda5a6c0a7f2312e0c102cd9"}],"concept.usgs.854":[{"id":"assertion.concept.usgs.854","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Oxygen content (water) as defined in the captured USGS Thesaurus term 854","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Oxygen content (water) as: Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body. This category is also used for anoxia , dissolved oxygen , and hypoxia","support":[{"end":320,"quote":"Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body.\nThis category is also used for\nanoxia\n,\ndissolved oxygen\n, and\nhypoxia","source_id":"usgs-thesaurus.854","source_sha256":"d4d7503ea45e5c94ab66398a465030384d08e6fe53e12ea0d9588e7a43bc758b","start":121}],"target_id":"concept.usgs.854","target_kind":"node","target_sha256":"2db9053a5266c8ad517f5dac4a1a1ed44a9e8bf76f7876a3719a169d259dcc89"}],"concept.usgs.858":[{"id":"assertion.concept.usgs.858","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleobotany as defined in the captured USGS Thesaurus term 858","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleobotany as: Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","support":[{"end":215,"quote":"Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","source_id":"usgs-thesaurus.858","source_sha256":"10f816652547e27118f67084b692adfda3cda051d9f341a71bf257d51564a5a1","start":114}],"target_id":"concept.usgs.858","target_kind":"node","target_sha256":"b7ffabf1756bf4fdea503d201e37259a047ab83cafab2cc89cb08f81a466fc88"}],"concept.usgs.88":[{"id":"assertion.concept.usgs.88","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Bioaccumulation as defined in the captured USGS Thesaurus term 88","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Bioaccumulation as: The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium. Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources. This category is also used for bioconcentration","support":[{"end":458,"quote":"The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium.  Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources.\nThis category is also used for\nbioconcentration","source_id":"usgs-thesaurus.88","source_sha256":"9bb3f1683ec671bf189a3aee2a4b808cb8964802253c62f407e45cde281bcd2a","start":147}],"target_id":"concept.usgs.88","target_kind":"node","target_sha256":"d9588d893cb013114578b232007ff84854b918a1878b45667309b872ade2fac6"}],"concept.usgs.915":[{"id":"assertion.concept.usgs.915","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Pollination as defined in the captured USGS Thesaurus term 915","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Pollination as: Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","support":[{"end":274,"quote":"Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","source_id":"usgs-thesaurus.915","source_sha256":"d466e4ca642e7798b3efe5d11a437a0a7bee2201bb5f85ddce8b770b934e9901","start":139}],"target_id":"concept.usgs.915","target_kind":"node","target_sha256":"be0ad08fe0d6077b9404bd540d84a0f00489a18472d86f1a889e5b98f8240f62"}],"concept.usgs.927":[{"id":"assertion.concept.usgs.927","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Precipitation (atmospheric) as defined in the captured USGS Thesaurus term 927","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Precipitation (atmospheric) as: Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet. This category is also used with field inventory and monitoring for precipitation measurement , rain , rainfall , with field inventory and monitoring for rainfall measurement , snow , snowfall , and with field inventory and monitoring for snowfall measurement","support":[{"end":548,"quote":"Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet.\nThis category is also used with\nfield inventory and monitoring\nfor\nprecipitation measurement\n,\nrain\n,\nrainfall\n,  with\nfield inventory and monitoring\nfor\nrainfall measurement\n,\nsnow\n,\nsnowfall\n, and  with\nfield inventory and monitoring\nfor\nsnowfall measurement","source_id":"usgs-thesaurus.927","source_sha256":"6dc6959dafecbcb1683a3d966a11572cba91a6315a5b007c683c0dda8c29c0bd","start":185}],"target_id":"concept.usgs.927","target_kind":"node","target_sha256":"f7236c38690b84405b1b33c7a563d023aaf4ed318682eaf9e1b6664372622bcc"}],"concept.usgs.93":[{"id":"assertion.concept.usgs.93","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biogeochemical cycling as defined in the captured USGS Thesaurus term 93","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition","support":[{"end":365,"quote":"The cycling of chemical constituents through a biological system.\nThis category is also used for\nbiogeochemical functioning\n,\nbiogeochemical processes\n,\ndecomposition (organic)\n, and\norganic decomposition","source_id":"usgs-thesaurus.93","source_sha256":"b376bdc281906d72a5570f2392ac5750e56a9d2235f5bb413264d93ab9d56d9b","start":161}],"target_id":"concept.usgs.93","target_kind":"node","target_sha256":"f4dd0675bc700abb62979893ca579b2792219bfebef5547a918ce2054a2da57a"}],"concept.wikipedia.a-b-testing":[{"id":"assertion.concept.wikipedia.a-b-testing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A/B testing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A/B testing\", CC BY-SA 4.0) states: A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","support":[{"end":214,"quote":"A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","source_id":"wikipedia.article.a-b-testing","source_sha256":"765242c1521535d6fbfae3a2c87156c6a1e09a9f5ddb47e0d23ded318fb0e204","start":98}],"target_id":"concept.wikipedia.a-b-testing","target_kind":"node","target_sha256":"9f9ca7339d6f22da0bcc976387991e9d160b37dfafb3166b0a12df3c63fd1088"}],"concept.wikipedia.a-frame":[{"id":"assertion.concept.wikipedia.a-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A-frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A-frame\", CC BY-SA 4.0) states: An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","support":[{"end":185,"quote":"An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","source_id":"wikipedia.article.a-frame","source_sha256":"7d621a9f4a5fd9fb83d9e9afb0ba06027d6cae4351291cdbf34fbf032f15e35e","start":94}],"target_id":"concept.wikipedia.a-frame","target_kind":"node","target_sha256":"56b0637de23263006321b0a8690b4300253547fc31668b291def52bcbde6a4a6"}],"concept.wikipedia.a-homotopy-theory":[{"id":"assertion.concept.wikipedia.a-homotopy-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A¹ homotopy theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A¹ homotopy theory\", CC BY-SA 4.0) states: In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","support":[{"end":357,"quote":"In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","source_id":"wikipedia.article.a-homotopy-theory","source_sha256":"3b1cb7ed7addcbc95174b37ba9c14d794a0e727362dcbcad09e46257ffe580ba","start":106}],"target_id":"concept.wikipedia.a-homotopy-theory","target_kind":"node","target_sha256":"627b8e7e56905ed33d0c2582181efa03e395563042cbc2f9b0bfdf48365c8cac"}],"concept.wikipedia.a-priori-and-a-posteriori":[{"id":"assertion.concept.wikipedia.a-priori-and-a-posteriori","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A priori and a posteriori as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A priori and a posteriori\", CC BY-SA 4.0) states: In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","support":[{"end":342,"quote":"In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","source_id":"wikipedia.article.a-priori-and-a-posteriori","source_sha256":"5f19b2fd15c6f47b6873342aac9444df37227c9871e090afba4b55a124269596","start":112}],"target_id":"concept.wikipedia.a-priori-and-a-posteriori","target_kind":"node","target_sha256":"65d1d6fe1d05646f75e1671adde2bdb6df52f389260dbd6b241fb14960a729b2"}],"concept.wikipedia.a-series-and-b-series":[{"id":"assertion.concept.wikipedia.a-series-and-b-series","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"A series and B series as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"A series and B series\", CC BY-SA 4.0) states: In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","support":[{"end":232,"quote":"In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","source_id":"wikipedia.article.a-series-and-b-series","source_sha256":"e65bd3796d2089a843f885dcffababbcb319269e5ca7f687a24b4604731cbc8c","start":108}],"target_id":"concept.wikipedia.a-series-and-b-series","target_kind":"node","target_sha256":"3a61ddfb25c2e943509ec4afd489b15d56da530bb6dbcfc4b95424ebe972fa6e"}],"concept.wikipedia.abductive-reasoning":[{"id":"assertion.concept.wikipedia.abductive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abductive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abductive reasoning\", CC BY-SA 4.0) states: Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","support":[{"end":295,"quote":"Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","source_id":"wikipedia.article.abductive-reasoning","source_sha256":"6d46153feadfe66eb39b937e4ed2730b274503fe090548e715ed0c7c4de15d73","start":104}],"target_id":"concept.wikipedia.abductive-reasoning","target_kind":"node","target_sha256":"e6ca96543ec6d3e668af4061fbca12aad4092c357df45bfa413873e23d81dbde"}],"concept.wikipedia.abel-s-summation-formula":[{"id":"assertion.concept.wikipedia.abel-s-summation-formula","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's summation formula as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's summation formula\", CC BY-SA 4.0) states: In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","support":[{"end":285,"quote":"In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","source_id":"wikipedia.article.abel-s-summation-formula","source_sha256":"92cdf545f08a20d8dc8956c4f1ff196d1cd40ba4ebcc4826ba96c855d8397a00","start":111}],"target_id":"concept.wikipedia.abel-s-summation-formula","target_kind":"node","target_sha256":"366d3c29b82a00bb2e19960c0ccc6831717be0825fb68c0e5d9b3d859f57403a"}],"concept.wikipedia.abelian-category":[{"id":"assertion.concept.wikipedia.abelian-category","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abelian category as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abelian category\", CC BY-SA 4.0) states: In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","support":[{"end":266,"quote":"In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","source_id":"wikipedia.article.abelian-category","source_sha256":"5dd552ad7b407d12963f2568612860e5907fd5ce7eced790468a543bcb7f5c14","start":101}],"target_id":"concept.wikipedia.abelian-category","target_kind":"node","target_sha256":"95822d6efcaf80b38a6fdddcc66d5fe6a2049408abbafff9fc321c240f62d556"}],"concept.wikipedia.abenics":[{"id":"assertion.concept.wikipedia.abenics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ABENICS as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ABENICS\", CC BY-SA 4.0) states: ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","support":[{"end":381,"quote":"ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","source_id":"wikipedia.article.abenics","source_sha256":"ff0093efc6c7781665e0014bfd85e650cacf04ca6f833c1be8c347a61b5a2151","start":95}],"target_id":"concept.wikipedia.abenics","target_kind":"node","target_sha256":"2421abf9f8099abc8bb993cfbd3b7c40062bbc2b74d38daf4c66b61562c657bd"}],"concept.wikipedia.abnormal-grain-growth":[{"id":"assertion.concept.wikipedia.abnormal-grain-growth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abnormal grain growth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abnormal grain growth\", CC BY-SA 4.0) states: In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","support":[{"end":432,"quote":"In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","source_id":"wikipedia.article.abnormal-grain-growth","source_sha256":"68dd3f8d7f5020d3efc028394b550678273c239daf91406d2b20c071bb4c3568","start":109}],"target_id":"concept.wikipedia.abnormal-grain-growth","target_kind":"node","target_sha256":"f622581ff9badac8cefd26eb0d2fc5881cb3eb5a2e3cc5d664daecd467a8c55d"}],"concept.wikipedia.abrams-law":[{"id":"assertion.concept.wikipedia.abrams-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrams' law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrams' law\", CC BY-SA 4.0) states: Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","support":[{"end":224,"quote":"Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","source_id":"wikipedia.article.abrams-law","source_sha256":"e0d33811f14ccf1d15e365762062f7d725f733d769ba3205234ecda3508be912","start":99}],"target_id":"concept.wikipedia.abrams-law","target_kind":"node","target_sha256":"6e43581e6cf5e60512d9965b1ceecd1078bf883e63d83b08f64e064577bee657"}],"concept.wikipedia.abrasion-mechanical":[{"id":"assertion.concept.wikipedia.abrasion-mechanical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasion (mechanical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasion (mechanical)\", CC BY-SA 4.0) states: Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","support":[{"end":197,"quote":"Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","source_id":"wikipedia.article.abrasion-mechanical","source_sha256":"a962affa37fc8558bdf8176424472dbd86bac194350295dc2cb968aa400fe1af","start":109}],"target_id":"concept.wikipedia.abrasion-mechanical","target_kind":"node","target_sha256":"adf52cdab076a6b3b2cd7b670fc92633c2fe8017d40d3a88fda9a6b71ad9d466"}],"concept.wikipedia.abrasive":[{"id":"assertion.concept.wikipedia.abrasive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive\", CC BY-SA 4.0) states: An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","support":[{"end":263,"quote":"An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","source_id":"wikipedia.article.abrasive","source_sha256":"210fdb2be95457dbf0b2cba63a077a5f0f03666dcd6a3422fb2240e21d0afad9","start":94}],"target_id":"concept.wikipedia.abrasive","target_kind":"node","target_sha256":"6b71df4780e62229891296efeca8159fe902ff663af5657d538efb351a7574f5"}],"concept.wikipedia.abrasive-flow-machining":[{"id":"assertion.concept.wikipedia.abrasive-flow-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive flow machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive flow machining\", CC BY-SA 4.0) states: Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","support":[{"end":308,"quote":"Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","source_id":"wikipedia.article.abrasive-flow-machining","source_sha256":"21a50d8e28ad0b8715b3257f249e3597cb279fcb7036a905a5665fb7ef8a831f","start":110}],"target_id":"concept.wikipedia.abrasive-flow-machining","target_kind":"node","target_sha256":"ec4c152c021fd01acd7469c1db215ed8590c5b13b2b5fca1afb0cb72d6cb9c77"}],"concept.wikipedia.abrasive-machining":[{"id":"assertion.concept.wikipedia.abrasive-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abrasive machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abrasive machining\", CC BY-SA 4.0) states: Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","support":[{"end":237,"quote":"Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","source_id":"wikipedia.article.abrasive-machining","source_sha256":"f324abb8c6d3ec3cc87d11738fa4d372efbd2ea7ad997fffc13e1f4aa9d6febc","start":106}],"target_id":"concept.wikipedia.abrasive-machining","target_kind":"node","target_sha256":"eacfc63d0127815acb54c26d0b27f210c04fdee6a46ebf55d57e1e65c4df30bb"}],"concept.wikipedia.absolute-continuity":[{"id":"assertion.concept.wikipedia.absolute-continuity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute continuity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute continuity\", CC BY-SA 4.0) states: In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","support":[{"end":257,"quote":"In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","source_id":"wikipedia.article.absolute-continuity","source_sha256":"75f9a10f73c2407afd57a4ff32bf4a55875688932ce193e4dad30df306c40dfd","start":105}],"target_id":"concept.wikipedia.absolute-continuity","target_kind":"node","target_sha256":"73e707018cfbdf156fe4fccb02d0678adafd8bbea82723568867487f06952cf8"}],"concept.wikipedia.absolute-neighborhood-retract":[{"id":"assertion.concept.wikipedia.absolute-neighborhood-retract","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute neighborhood retract as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute neighborhood retract\", CC BY-SA 4.0) states: In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \"nice\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","support":[{"end":322,"quote":"In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \\\"nice\\\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","source_id":"wikipedia.article.absolute-neighborhood-retract","source_sha256":"7ec2d346f752e1920071e8a7945833ec780b3b10c21aaa5984879109ec5a0c12","start":117}],"target_id":"concept.wikipedia.absolute-neighborhood-retract","target_kind":"node","target_sha256":"959f44800ce8fbce044f84b7dc82634c16243682590af384ba86b366ff2a5989"}],"concept.wikipedia.absolute-philosophy":[{"id":"assertion.concept.wikipedia.absolute-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute (philosophy)\", CC BY-SA 4.0) states: In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","support":[{"end":286,"quote":"In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","source_id":"wikipedia.article.absolute-philosophy","source_sha256":"5a76d421001827f398252574a1b70fcf90f36ccc6a44c677e3ef9ed8ee8db588","start":109}],"target_id":"concept.wikipedia.absolute-philosophy","target_kind":"node","target_sha256":"6eae5e96a54a985adaa20bc6ea9835e154a0427fa978de483a6ba56510be0b5d"}],"concept.wikipedia.absolute-space-and-time":[{"id":"assertion.concept.wikipedia.absolute-space-and-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolute space and time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolute space and time\", CC BY-SA 4.0) states: Absolute space and time is a concept in physics and philosophy about the properties of the universe.","support":[{"end":209,"quote":"Absolute space and time is a concept in physics and philosophy about the properties of the universe.","source_id":"wikipedia.article.absolute-space-and-time","source_sha256":"30ea876fffd4fcad265d321e8f140a22be08d2a6e68989b3ad9566213d154b83","start":109}],"target_id":"concept.wikipedia.absolute-space-and-time","target_kind":"node","target_sha256":"93080a90976cdb3e9d38e653da614171f799d3508dc410d8417aae5271c97be1"}],"concept.wikipedia.absolutely-convex-set":[{"id":"assertion.concept.wikipedia.absolutely-convex-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absolutely convex set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absolutely convex set\", CC BY-SA 4.0) states: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \"circled\" instead of \"balanced\"), in which case it is called a disk.","support":[{"end":338,"quote":"In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \\\"circled\\\" instead of \\\"balanced\\\"), in which case it is called a disk.","source_id":"wikipedia.article.absolutely-convex-set","source_sha256":"a6181464301d29c875f5fe61e7a5748331ee66a019a3242a626e63a3a1a5dfe9","start":108}],"target_id":"concept.wikipedia.absolutely-convex-set","target_kind":"node","target_sha256":"f58762c7d0c5f81ac15be4d561a77803157895e1ab62bd13e428f49f85327f0a"}],"concept.wikipedia.absoluteness-logic":[{"id":"assertion.concept.wikipedia.absoluteness-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absoluteness (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absoluteness (logic)\", CC BY-SA 4.0) states: In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","support":[{"end":282,"quote":"In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","source_id":"wikipedia.article.absoluteness-logic","source_sha256":"f4e3d4954d83f33014460fb3278487e645617832cfbb2a320133692749ef9a84","start":108}],"target_id":"concept.wikipedia.absoluteness-logic","target_kind":"node","target_sha256":"ac28bdc688ebe0f63ba68f5d04794458c79f2b2d1522b762be683710104f38aa"}],"concept.wikipedia.absorption-law":[{"id":"assertion.concept.wikipedia.absorption-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Absorption law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Absorption law\", CC BY-SA 4.0) states: In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","support":[{"end":205,"quote":"In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","source_id":"wikipedia.article.absorption-law","source_sha256":"69c843b2c17a7f35b690f4efb294366ae121863ea11abea73b1b56059bba8a81","start":100}],"target_id":"concept.wikipedia.absorption-law","target_kind":"node","target_sha256":"1f430375c471c6965510dfdb50da5b878dc1c01d4da41c7b6a9fc56575752bd9"}],"concept.wikipedia.abstract-logic":[{"id":"assertion.concept.wikipedia.abstract-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract logic\", CC BY-SA 4.0) states: In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","support":[{"end":325,"quote":"In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","source_id":"wikipedia.article.abstract-logic","source_sha256":"724220b1e13884cacfe47ee39833efcda7664b6f8b97fc84d11230e27822d0af","start":102}],"target_id":"concept.wikipedia.abstract-logic","target_kind":"node","target_sha256":"3c8ddaa9b605f79442c722a22597d607ae6105dc9e6a9fa44e47ca4ff290aee6"}],"concept.wikipedia.abstract-nonsense":[{"id":"assertion.concept.wikipedia.abstract-nonsense","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract nonsense as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract nonsense\", CC BY-SA 4.0) states: In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","support":[{"end":377,"quote":"In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","source_id":"wikipedia.article.abstract-nonsense","source_sha256":"80f96135e3c581ad2ec622761be127469a5aa1812b74d04918a32937629a675f","start":103}],"target_id":"concept.wikipedia.abstract-nonsense","target_kind":"node","target_sha256":"71778475a1151060f80b81093ba1b3b3b5f9ee0e5622440d8e8fa44accaa229d"}],"concept.wikipedia.abstract-polytope":[{"id":"assertion.concept.wikipedia.abstract-polytope","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract polytope as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract polytope\", CC BY-SA 4.0) states: In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","support":[{"end":333,"quote":"In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","source_id":"wikipedia.article.abstract-polytope","source_sha256":"d22b16d20f7e71cc9243ff7610c4dd7cbdf71b87ff37f8dd95165acc67d4201c","start":104}],"target_id":"concept.wikipedia.abstract-polytope","target_kind":"node","target_sha256":"cb7d110804bb2c3b5a7740200e6bd7dbe439555c26361d4a82d493a93138a3f2"}],"concept.wikipedia.abstract-simplicial-complex":[{"id":"assertion.concept.wikipedia.abstract-simplicial-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract simplicial complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract simplicial complex\", CC BY-SA 4.0) states: In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","support":[{"end":342,"quote":"In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","source_id":"wikipedia.article.abstract-simplicial-complex","source_sha256":"70604d9b279081dc0a67e98d7c557bec9739fd51d50a041877e2df90fe60a4d0","start":113}],"target_id":"concept.wikipedia.abstract-simplicial-complex","target_kind":"node","target_sha256":"f47655a142c719032f977e402cdb2233851a7d6bf3f6768dafbe6db2f238904e"}],"concept.wikipedia.abstract-wiener-space":[{"id":"assertion.concept.wikipedia.abstract-wiener-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract Wiener space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract Wiener space\", CC BY-SA 4.0) states: The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","support":[{"end":286,"quote":"The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","source_id":"wikipedia.article.abstract-wiener-space","source_sha256":"0eddbb8e5788233194a84030ca55b09fedb18de4f6f16fd13ce4e2e0fecffe6d","start":108}],"target_id":"concept.wikipedia.abstract-wiener-space","target_kind":"node","target_sha256":"6c73c5ada69fa5025df00cce07c344958e33d8a1d8308e79a6b44ca9340e8bf1"}],"concept.wikipedia.abstraction":[{"id":"assertion.concept.wikipedia.abstraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstraction\", CC BY-SA 4.0) states: Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","support":[{"end":255,"quote":"Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","source_id":"wikipedia.article.abstraction","source_sha256":"9b664437dc878f7ad8cb5dd84fbb15fb1149c5f57e4986b3c384108a0487f664","start":95}],"target_id":"concept.wikipedia.abstraction","target_kind":"node","target_sha256":"3a42180210f692984dc85e35d286251bd82d5c69b9c0264102924a6a9054e566"}],"concept.wikipedia.abundant-number":[{"id":"assertion.concept.wikipedia.abundant-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abundant number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abundant number\", CC BY-SA 4.0) states: In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","support":[{"end":248,"quote":"In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","source_id":"wikipedia.article.abundant-number","source_sha256":"b4889df159a3ba413cc0ae4228356e0121d4d0314a4e6f5850c46c30e08675b4","start":101}],"target_id":"concept.wikipedia.abundant-number","target_kind":"node","target_sha256":"8f825fe43832c6b9a052e471537451029dc25c868954530f6ac0a3f0fe444b94"}],"concept.wikipedia.abutment":[{"id":"assertion.concept.wikipedia.abutment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abutment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abutment\", CC BY-SA 4.0) states: An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","support":[{"end":193,"quote":"An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","source_id":"wikipedia.article.abutment","source_sha256":"292e2758008de074b8ccb69793c61d4ab36bd044fb1006709f162c0479ee07c2","start":95}],"target_id":"concept.wikipedia.abutment","target_kind":"node","target_sha256":"0fb6f1803b2dda4d37168ef528938a70bfceecbfdcab38db0020c5fa4518d853"}],"concept.wikipedia.ac-dc-receiver-design":[{"id":"assertion.concept.wikipedia.ac-dc-receiver-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"AC/DC receiver design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"AC/DC receiver design\", CC BY-SA 4.0) states: An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","support":[{"end":272,"quote":"An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","source_id":"wikipedia.article.ac-dc-receiver-design","source_sha256":"402018e76f6be7f924bb81dc7b5951a9bf7b3222b8b71265a63eb1308ffbfbc4","start":109}],"target_id":"concept.wikipedia.ac-dc-receiver-design","target_kind":"node","target_sha256":"a331069c735d282cbbaae6415b852edc847a46020bc9329545b95ac9ce539f09"}],"concept.wikipedia.academic-skepticism":[{"id":"assertion.concept.wikipedia.academic-skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Academic skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Academic skepticism\", CC BY-SA 4.0) states: Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","support":[{"end":438,"quote":"Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","source_id":"wikipedia.article.academic-skepticism","source_sha256":"16926f2c3d9e087271bcc8abe506fe5b6d257e4b544a1ac1feb92a673de72a67","start":107}],"target_id":"concept.wikipedia.academic-skepticism","target_kind":"node","target_sha256":"b9e85a28aa23122b4738168896079f5d3b0bfb53acac2e801c3310c24552d29e"}],"concept.wikipedia.access-consciousness":[{"id":"assertion.concept.wikipedia.access-consciousness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Access Consciousness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Access Consciousness\", CC BY-SA 4.0) states: Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","support":[{"end":276,"quote":"Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","source_id":"wikipedia.article.access-consciousness","source_sha256":"03092d288b1d7a707cd79590aaa84792813869135b5e863221882a115bdb3622","start":108}],"target_id":"concept.wikipedia.access-consciousness","target_kind":"node","target_sha256":"892dc74b4cfb7628709a669eca2c9f4e30341e47f959870006bcd7391c234877"}],"concept.wikipedia.accessible-quasi-category":[{"id":"assertion.concept.wikipedia.accessible-quasi-category","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Accessible quasi-category as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Accessible quasi-category\", CC BY-SA 4.0) states: In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","support":[{"end":273,"quote":"In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","source_id":"wikipedia.article.accessible-quasi-category","source_sha256":"fee6c9a0378259b71bb22ca4bd1417c75e8540812965409b3c5f544efc4a99ec","start":113}],"target_id":"concept.wikipedia.accessible-quasi-category","target_kind":"node","target_sha256":"c06c36a5a2c3918a9baae47e0ca4411cabdb5ef014d81efc7ab425d456b7d81d"}],"concept.wikipedia.accident-philosophy":[{"id":"assertion.concept.wikipedia.accident-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Accident (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Accident (philosophy)\", CC BY-SA 4.0) states: An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","support":[{"end":289,"quote":"An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","source_id":"wikipedia.article.accident-philosophy","source_sha256":"a57f74dd53506fc69f86dbe01e34e627feffd553cf8d15ef58f1c821fd7deb75","start":107}],"target_id":"concept.wikipedia.accident-philosophy","target_kind":"node","target_sha256":"9603e58b7f348d1c1acb514122eec348dc29913092a5a1ebb5688575c1f932b0"}],"concept.wikipedia.achilles-number":[{"id":"assertion.concept.wikipedia.achilles-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Achilles number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Achilles number\", CC BY-SA 4.0) states: An Achilles number is a number that is powerful but not a perfect power.","support":[{"end":174,"quote":"An Achilles number is a number that is powerful but not a perfect power.","source_id":"wikipedia.article.achilles-number","source_sha256":"6fa5ac3e10fddd40800b513551ff96ae9ad5ee67f170861bf546f3bb7ef19dc7","start":102}],"target_id":"concept.wikipedia.achilles-number","target_kind":"node","target_sha256":"33caba01b63a722d36cfa68ed7e612b123f33b4f2f201ec60903016e9688adda"}],"concept.wikipedia.acicular-ferrite":[{"id":"assertion.concept.wikipedia.acicular-ferrite","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acicular ferrite as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acicular ferrite\", CC BY-SA 4.0) states: Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","support":[{"end":252,"quote":"Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","source_id":"wikipedia.article.acicular-ferrite","source_sha256":"7ec0bbad157826d2402a19cb98766c29e678930d12cdcf4e82a07bdf6ee9ebbf","start":103}],"target_id":"concept.wikipedia.acicular-ferrite","target_kind":"node","target_sha256":"766003701f3ab742faa713f5b8b3645cbc3ad43653be9d2e94018c6d5a2b07eb"}],"concept.wikipedia.acid-egg":[{"id":"assertion.concept.wikipedia.acid-egg","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acid egg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acid egg\", CC BY-SA 4.0) states: The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","support":[{"end":291,"quote":"The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","source_id":"wikipedia.article.acid-egg","source_sha256":"447c3bd6ff5662e282a027c640caafd10049ee2d5610789c88f8b6e6662dca8b","start":96}],"target_id":"concept.wikipedia.acid-egg","target_kind":"node","target_sha256":"0b9ae700896de2dcd811c4010b155686373b0187ba5fef000c8e8281ec5ff823"}],"concept.wikipedia.acoustic-emission":[{"id":"assertion.concept.wikipedia.acoustic-emission","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic emission as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic emission\", CC BY-SA 4.0) states: Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","support":[{"end":415,"quote":"Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","source_id":"wikipedia.article.acoustic-emission","source_sha256":"757eecc18791a9b74be362f3036692bb495dcc9913b4dbc33989e780d8b49e0d","start":104}],"target_id":"concept.wikipedia.acoustic-emission","target_kind":"node","target_sha256":"d18b3b5121b70783c2ae088b39502c029171b7c8202d2c7990c029a659c13716"}],"concept.wikipedia.acoustic-panel":[{"id":"assertion.concept.wikipedia.acoustic-panel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic panel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic panel\", CC BY-SA 4.0) states: Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","support":[{"end":279,"quote":"Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","source_id":"wikipedia.article.acoustic-panel","source_sha256":"8e3c1118a850f0584204302d518a41c0e50fe37bc16bd4f8a723047858d40f9e","start":102}],"target_id":"concept.wikipedia.acoustic-panel","target_kind":"node","target_sha256":"82393dc6425b64b28290d51db3f1bdf65e96366269d9d42c37c5034e41e4c0b2"}],"concept.wikipedia.acoustic-pod":[{"id":"assertion.concept.wikipedia.acoustic-pod","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic pod as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic pod\", CC BY-SA 4.0) states: An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","support":[{"end":265,"quote":"An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","source_id":"wikipedia.article.acoustic-pod","source_sha256":"42762eb77d11e0721cf311497488dcdf15df274667502fc639b432c68c137ad5","start":100}],"target_id":"concept.wikipedia.acoustic-pod","target_kind":"node","target_sha256":"765816af58756d84e95108dcc5963d2a5582f3cc32391f37aaae4ec3f3c854e2"}],"concept.wikipedia.acoustic-transmission":[{"id":"assertion.concept.wikipedia.acoustic-transmission","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustic transmission as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustic transmission\", CC BY-SA 4.0) states: Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","support":[{"end":236,"quote":"Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","source_id":"wikipedia.article.acoustic-transmission","source_sha256":"e42d4c089db61536a5860fcbf66379aebdd5f56643cb1d05a6c3dba53fadb0bb","start":108}],"target_id":"concept.wikipedia.acoustic-transmission","target_kind":"node","target_sha256":"ca6c0b864413a2eb3a024149a34b375d2a2d096a174aa1d055b29a8740938d26"}],"concept.wikipedia.action-angle-coordinates":[{"id":"assertion.concept.wikipedia.action-angle-coordinates","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action-angle coordinates as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action-angle coordinates\", CC BY-SA 4.0) states: In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","support":[{"end":364,"quote":"In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","source_id":"wikipedia.article.action-angle-coordinates","source_sha256":"5c313dd174ae0498c1d54da471f47aee11fcb81fdceb187ba8ad16240375180e","start":111}],"target_id":"concept.wikipedia.action-angle-coordinates","target_kind":"node","target_sha256":"0416ccb331cafd6b88e5f17d5ed33f0a3d8f75e3005d9d0cdbeb9a74bcfc5f36"}],"concept.wikipedia.action-bias":[{"id":"assertion.concept.wikipedia.action-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action bias\", CC BY-SA 4.0) states: Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","support":[{"end":275,"quote":"Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","source_id":"wikipedia.article.action-bias","source_sha256":"b13a8543712bbd7811955dc3670f7ff2a888f61e54c4716248e84ec75ba8d29b","start":99}],"target_id":"concept.wikipedia.action-bias","target_kind":"node","target_sha256":"b70fc531d5231e654f3565d6881da26f53fa866cee61bbb2221c1ff63c711481"}],"concept.wikipedia.action-theory-philosophy":[{"id":"assertion.concept.wikipedia.action-theory-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action theory (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action theory (philosophy)\", CC BY-SA 4.0) states: Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","support":[{"end":284,"quote":"Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","source_id":"wikipedia.article.action-theory-philosophy","source_sha256":"cc39ef5411ea1e51442bc08eaa6e763c3a5616e5c7bf5e0133bde54f492a4ee9","start":111}],"target_id":"concept.wikipedia.action-theory-philosophy","target_kind":"node","target_sha256":"76413584af2a2208b5bf382f0be3b47d3898dbe1b60e9589f1acd6a185be3b92"}],"concept.wikipedia.action-type-approach":[{"id":"assertion.concept.wikipedia.action-type-approach","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Action type approach as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Action type approach\", CC BY-SA 4.0) states: The action type approach is a series of mental exercises—variously described as \"pseudoscientific\", \"empirically challenged\", or a \"neuromyth\"— that purport to increase physical performance in athletes.","support":[{"end":316,"quote":"The action type approach is a series of mental exercises—variously described as \\\"pseudoscientific\\\", \\\"empirically challenged\\\", or a \\\"neuromyth\\\"— that purport to increase physical performance in athletes.","source_id":"wikipedia.article.action-type-approach","source_sha256":"b5ed70b206254ac3627178b1c790ccc77ddc08d3a8b30c961f35de955530422a","start":108}],"target_id":"concept.wikipedia.action-type-approach","target_kind":"node","target_sha256":"8dba3e93170d1a4d16d75065fb768f0e2d6eee61dea170ad22ae9a8629217e4e"}],"concept.wikipedia.activated-sludge":[{"id":"assertion.concept.wikipedia.activated-sludge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Activated sludge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Activated sludge\", CC BY-SA 4.0) states: The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","support":[{"end":302,"quote":"The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","source_id":"wikipedia.article.activated-sludge","source_sha256":"c8bd71585211f67342b627c8d057a94f10fe156e3d16b65a17199db51ad2ada1","start":103}],"target_id":"concept.wikipedia.activated-sludge","target_kind":"node","target_sha256":"783c46121523bcc49ac2ab9bb4d5f917cdcf22a4134397f6b6d879b967391726"}],"concept.wikipedia.active-circulator":[{"id":"assertion.concept.wikipedia.active-circulator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active circulator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active circulator\", CC BY-SA 4.0) states: In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","support":[{"end":307,"quote":"In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","source_id":"wikipedia.article.active-circulator","source_sha256":"69941056f9bc168078df97b184c78c1eec52f7443649de3c678a4ba6355254c0","start":105}],"target_id":"concept.wikipedia.active-circulator","target_kind":"node","target_sha256":"56eb005265f2131be369ce424b99743d0dfd62ec34c085d66f9ce7a20b2388c2"}],"concept.wikipedia.active-disturbance-rejection-control":[{"id":"assertion.concept.wikipedia.active-disturbance-rejection-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active disturbance rejection control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active disturbance rejection control\", CC BY-SA 4.0) states: Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","support":[{"end":351,"quote":"Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","source_id":"wikipedia.article.active-disturbance-rejection-control","source_sha256":"4df4c2fe0b771d1a7652153675966270b5400f3b5d6a88aba6f5ff5047790fc9","start":124}],"target_id":"concept.wikipedia.active-disturbance-rejection-control","target_kind":"node","target_sha256":"ed55cc126cd7a32e6f3d5796c3737e7bbcda65de0a8b09ad027bde91794efff3"}],"concept.wikipedia.active-intellect":[{"id":"assertion.concept.wikipedia.active-intellect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active intellect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active intellect\", CC BY-SA 4.0) states: In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","support":[{"end":380,"quote":"In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","source_id":"wikipedia.article.active-intellect","source_sha256":"3435e519189be67bffce54c966f0013d99da2b0bccd3b4b8f0883c218b2510a2","start":103}],"target_id":"concept.wikipedia.active-intellect","target_kind":"node","target_sha256":"946a41df6e6993861f45b13334ac020990393b6d24249e16250b3844f657e251"}],"concept.wikipedia.active-power-filter":[{"id":"assertion.concept.wikipedia.active-power-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active power filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active power filter\", CC BY-SA 4.0) states: Active power filters (APF) are filters, which can perform the job of harmonic elimination.","support":[{"end":197,"quote":"Active power filters (APF) are filters, which can perform the job of harmonic elimination.","source_id":"wikipedia.article.active-power-filter","source_sha256":"42106cddd8e2110e4ce2459c84ffd1c779cc679aed93c22bf10a81e1d52778a3","start":107}],"target_id":"concept.wikipedia.active-power-filter","target_kind":"node","target_sha256":"c5e5f992f7544ce77abc292840be39fd3b4e0a53f3bc6f943559be13393771fe"}],"concept.wikipedia.active-redundancy":[{"id":"assertion.concept.wikipedia.active-redundancy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active redundancy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active redundancy\", CC BY-SA 4.0) states: Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","support":[{"end":263,"quote":"Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","source_id":"wikipedia.article.active-redundancy","source_sha256":"45368fcccbcbf45cf68d0207e7031b5a5eba3b94d93cd8b9a5c84133b80d40d3","start":105}],"target_id":"concept.wikipedia.active-redundancy","target_kind":"node","target_sha256":"11eae07843062b0dfade6baf9b4e4b7b42e4e96d340f350d7afe61e2e7ad0f63"}],"concept.wikipedia.active-thermography":[{"id":"assertion.concept.wikipedia.active-thermography","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Active thermography as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Active thermography\", CC BY-SA 4.0) states: Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","support":[{"end":283,"quote":"Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","source_id":"wikipedia.article.active-thermography","source_sha256":"1f1a1aeb6059ef94a89f54e6babcb68474209fb253e70812287018a62eaa5afc","start":107}],"target_id":"concept.wikipedia.active-thermography","target_kind":"node","target_sha256":"1e04666bcdc01a9dd2c27894a6c7ef7e0fd2168b2ed63f5ede1017a79433d522"}],"concept.wikipedia.actor-network-theory":[{"id":"assertion.concept.wikipedia.actor-network-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actor–network theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actor–network theory\", CC BY-SA 4.0) states: Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","support":[{"end":301,"quote":"Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","source_id":"wikipedia.article.actor-network-theory","source_sha256":"c2001ca0e9fef493d1032328c59362bc86c66a64908a3c88dda8598cde2b3adb","start":106}],"target_id":"concept.wikipedia.actor-network-theory","target_kind":"node","target_sha256":"7fa18c148460d7ab8ecb998a8a75231eb3c150c480b098a69077b47277f6e20d"}],"concept.wikipedia.actor-observer-asymmetry":[{"id":"assertion.concept.wikipedia.actor-observer-asymmetry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actor–observer asymmetry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actor–observer asymmetry\", CC BY-SA 4.0) states: Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","support":[{"end":283,"quote":"Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","source_id":"wikipedia.article.actor-observer-asymmetry","source_sha256":"17bc4e4877ff5470e5767a89a338555799e1eb0df8cdd5d61ed50e648ada2d1c","start":110}],"target_id":"concept.wikipedia.actor-observer-asymmetry","target_kind":"node","target_sha256":"316cb677849d51de72c960dab37c5d32f844546ae5021832c499dce58ecdb439"}],"concept.wikipedia.actuator":[{"id":"assertion.concept.wikipedia.actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Actuator\", CC BY-SA 4.0) states: An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","support":[{"end":288,"quote":"An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","source_id":"wikipedia.article.actuator","source_sha256":"f5c683e3fa31c0f5b0e8bf50eb11996c96f982fe69734388639581ef3eb5935e","start":94}],"target_id":"concept.wikipedia.actuator","target_kind":"node","target_sha256":"20b001fb154474651e9bb91f4452648f082c9f5fb544ddca99c48fdb82a0521d"}],"concept.wikipedia.acyclic-model":[{"id":"assertion.concept.wikipedia.acyclic-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acyclic model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acyclic model\", CC BY-SA 4.0) states: In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","support":[{"end":246,"quote":"In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","source_id":"wikipedia.article.acyclic-model","source_sha256":"189c025aad7bd0a098cd72f1915183d3fd3be087a89b69cce94fa67b56e5bfd3","start":101}],"target_id":"concept.wikipedia.acyclic-model","target_kind":"node","target_sha256":"eb41cf6f7a7cb46002783bbf767c75ccfa85f8eebb913e6dd39a8bb709f1b572"}],"concept.wikipedia.ad-hoc-hypothesis":[{"id":"assertion.concept.wikipedia.ad-hoc-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ad hoc hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ad hoc hypothesis\", CC BY-SA 4.0) states: In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","support":[{"end":226,"quote":"In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","source_id":"wikipedia.article.ad-hoc-hypothesis","source_sha256":"9c0c878c5ae13857bf7e16086f120d030919a81ef1351b5af1ba14ceffab5c11","start":103}],"target_id":"concept.wikipedia.ad-hoc-hypothesis","target_kind":"node","target_sha256":"0f678a6cf92c608314ef53a8e70ef882815f2c085be30508445ec50b39115d38"}],"concept.wikipedia.ad-personam":[{"id":"assertion.concept.wikipedia.ad-personam","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ad personam as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ad personam\", CC BY-SA 4.0) states: In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","support":[{"end":284,"quote":"In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","source_id":"wikipedia.article.ad-personam","source_sha256":"691b83b9ef09a396af769396798dafac86178772d8f34a56402b85b7b07b77b8","start":99}],"target_id":"concept.wikipedia.ad-personam","target_kind":"node","target_sha256":"52fcbeb3a4d9dc5cf088dfcfd9c202d21438abb85e49a187da184838b95a9803"}],"concept.wikipedia.adapter":[{"id":"assertion.concept.wikipedia.adapter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adapter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adapter\", CC BY-SA 4.0) states: An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","support":[{"end":242,"quote":"An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","source_id":"wikipedia.article.adapter","source_sha256":"e30fc4b240f4ad493b6b08f2cf12b09583d402c59700ebffacddc988efc41d69","start":93}],"target_id":"concept.wikipedia.adapter","target_kind":"node","target_sha256":"23e443ac5e097a3395f24ce126aa6fc7364062ccee2050f9abb7525a4426b72e"}],"concept.wikipedia.adaptive-beamformer":[{"id":"assertion.concept.wikipedia.adaptive-beamformer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive beamformer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive beamformer\", CC BY-SA 4.0) states: An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","support":[{"end":233,"quote":"An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","source_id":"wikipedia.article.adaptive-beamformer","source_sha256":"78d8758efd878dc7a1afc59191b0af528e4f415e6e561de3abaa9d26ea8ffa11","start":106}],"target_id":"concept.wikipedia.adaptive-beamformer","target_kind":"node","target_sha256":"e3af768b3ef30a76201b280977c2ee0eb8e5d07fa1dc018390f25c445a36505a"}],"concept.wikipedia.adaptive-bias":[{"id":"assertion.concept.wikipedia.adaptive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive bias\", CC BY-SA 4.0) states: Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","support":[{"end":455,"quote":"Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","source_id":"wikipedia.article.adaptive-bias","source_sha256":"0b457a2a4702374924182b9e4c2b29b1be74e1691860dafdfc34b82a11478e18","start":100}],"target_id":"concept.wikipedia.adaptive-bias","target_kind":"node","target_sha256":"82f0623f0a7bc3da554cdb408d4702b1c894f2b9572c94a87dab2230f0533bf0"}],"concept.wikipedia.adaptive-control":[{"id":"assertion.concept.wikipedia.adaptive-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive control\", CC BY-SA 4.0) states: Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","support":[{"end":258,"quote":"Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","source_id":"wikipedia.article.adaptive-control","source_sha256":"7c6af0b2a9f82456a445362f7d8415f0aa7cb144631e284ab7fa449a23f266d8","start":103}],"target_id":"concept.wikipedia.adaptive-control","target_kind":"node","target_sha256":"941a31e164ff3a171b7cb402b833c4de02802b6f1e07378eb8fd379db750d3f9"}],"concept.wikipedia.adaptive-reasoning":[{"id":"assertion.concept.wikipedia.adaptive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive reasoning\", CC BY-SA 4.0) states: Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","support":[{"end":230,"quote":"Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","source_id":"wikipedia.article.adaptive-reasoning","source_sha256":"4fbe9d1956d2691a4a487d7c988db9523bc9db6a0d3ad2c1e30e839074b3eae7","start":106}],"target_id":"concept.wikipedia.adaptive-reasoning","target_kind":"node","target_sha256":"5f8ac378dd90e581aabd25f7eb32737ffc2c3de0004ae6cc95c42ec720f59d27"}],"concept.wikipedia.adaptive-step-size":[{"id":"assertion.concept.wikipedia.adaptive-step-size","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adaptive step size as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adaptive step size\", CC BY-SA 4.0) states: In mathematics and numerical analysis, an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","support":[{"end":407,"quote":"In mathematics and numerical analysis,  an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","source_id":"wikipedia.article.adaptive-step-size","source_sha256":"4a0eb49691462b5d1a2a7e0b181672acd2541f6ebd8b34dcc5927bd680b5df36","start":105}],"target_id":"concept.wikipedia.adaptive-step-size","target_kind":"node","target_sha256":"0a5db7e309208034325c18f7ec6ca38cb9db274eccb70cb8f570829ff7343ad8"}],"concept.wikipedia.addition-principle":[{"id":"assertion.concept.wikipedia.addition-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Addition principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Addition principle\", CC BY-SA 4.0) states: In combinatorics, the addition principle or rule of sum is a basic counting principle.","support":[{"end":191,"quote":"In combinatorics, the addition principle or rule of sum is a basic counting principle.","source_id":"wikipedia.article.addition-principle","source_sha256":"49f87650a215a30a78d3d38a2be82d94d1698d597d706e64d878bef62eadf8b5","start":105}],"target_id":"concept.wikipedia.addition-principle","target_kind":"node","target_sha256":"4425af0537c2cbc72caeabc770bbacc5cd4d21c3dff2f4e5b05a9cabd28ebb0f"}],"concept.wikipedia.additive-bias":[{"id":"assertion.concept.wikipedia.additive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive bias\", CC BY-SA 4.0) states: Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","support":[{"end":229,"quote":"Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","source_id":"wikipedia.article.additive-bias","source_sha256":"aafe2d80a2a5d23f6ec19a2ce1e5bc80d45e7dd901e63fea02e63972eec0d770","start":101}],"target_id":"concept.wikipedia.additive-bias","target_kind":"node","target_sha256":"02a62ed9a24bee8e3494f9a6f45b7efc2912bdd3b4794ba613a865e6b6e8f028"}],"concept.wikipedia.additive-group":[{"id":"assertion.concept.wikipedia.additive-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive group\", CC BY-SA 4.0) states: An additive group is a group of which the group operation is to be thought of as addition in some sense.","support":[{"end":204,"quote":"An additive group is a group of which the group operation is to be thought of as addition in some sense.","source_id":"wikipedia.article.additive-group","source_sha256":"f983761671412e07352f97fb7b702bcb963609a8c436376aa6419330430e4697","start":100}],"target_id":"concept.wikipedia.additive-group","target_kind":"node","target_sha256":"bdf580db9a810a605315a36de0689b8bf48b8657b17edb3cb84649a7c583be97"}],"concept.wikipedia.additive-identity":[{"id":"assertion.concept.wikipedia.additive-identity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive identity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive identity\", CC BY-SA 4.0) states: In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","support":[{"end":478,"quote":"In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","source_id":"wikipedia.article.additive-identity","source_sha256":"47ea78ac38fc1d0b38c692fc4c8f40468681d8a6894f140ce5da4392a65c1fd0","start":104}],"target_id":"concept.wikipedia.additive-identity","target_kind":"node","target_sha256":"d3677d4eaffdb3a06b9b1de1e944ffe8fdb93fe3009118b46b8b823a5de5aab4"}],"concept.wikipedia.additive-inverse":[{"id":"assertion.concept.wikipedia.additive-inverse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive inverse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive inverse\", CC BY-SA 4.0) states: In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","support":[{"end":234,"quote":"In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","source_id":"wikipedia.article.additive-inverse","source_sha256":"717443da068476877d7cff7d9c8edf3051f9c869e5b81320e60892e1e6f614e0","start":102}],"target_id":"concept.wikipedia.additive-inverse","target_kind":"node","target_sha256":"4cdc4d05915e0633a5f0d9faf6324253543abb35806149fd093ca820e2b9b0f3"}],"concept.wikipedia.additive-polynomial":[{"id":"assertion.concept.wikipedia.additive-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive polynomial\", CC BY-SA 4.0) states: In mathematics, the additive polynomials are an important topic in classical algebraic number theory.","support":[{"end":208,"quote":"In mathematics, the additive polynomials are an important topic in  classical algebraic number theory.","source_id":"wikipedia.article.additive-polynomial","source_sha256":"3f82c7a0d032f2fc6a172a7c6a890d2d197bbf65b67776b3a2f78d95951a090d","start":106}],"target_id":"concept.wikipedia.additive-polynomial","target_kind":"node","target_sha256":"73168a969bc49a2e471a2169442c3d8b95400eecfcc2aaa1e39438d5f2a3c624"}],"concept.wikipedia.additive-process":[{"id":"assertion.concept.wikipedia.additive-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Additive process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Additive process\", CC BY-SA 4.0) states: An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","support":[{"end":234,"quote":"An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","source_id":"wikipedia.article.additive-process","source_sha256":"9b8be245b1f26d097ef034d4aaff16263194d00c65152a98802db6b32df1918c","start":104}],"target_id":"concept.wikipedia.additive-process","target_kind":"node","target_sha256":"102c566cf1109bca311d990c81bf5cd2977bc4a124df813a86b5625aa12f9c2b"}],"concept.wikipedia.addressed-fiber-bragg-structure":[{"id":"assertion.concept.wikipedia.addressed-fiber-bragg-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Addressed fiber Bragg structure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Addressed fiber Bragg structure\", CC BY-SA 4.0) states: An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","support":[{"end":387,"quote":"An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","source_id":"wikipedia.article.addressed-fiber-bragg-structure","source_sha256":"9dda4740b48eda85ee35f95cbbf80633f46de6b047ce004bff7cc185b5cb9b5b","start":119}],"target_id":"concept.wikipedia.addressed-fiber-bragg-structure","target_kind":"node","target_sha256":"636ae332dcff2eba9c8ae579b262775482006d0307a8dcee00de8ae532026df6"}],"concept.wikipedia.ade-classification":[{"id":"assertion.concept.wikipedia.ade-classification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ADE classification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ADE classification\", CC BY-SA 4.0) states: In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","support":[{"end":280,"quote":"In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","source_id":"wikipedia.article.ade-classification","source_sha256":"a80a980f540b2565d763fa482523a2ee47ab568939207135fd8d2341287bb7f5","start":104}],"target_id":"concept.wikipedia.ade-classification","target_kind":"node","target_sha256":"91826431ec14c578e87936cb8b7c51e2b1cc5d6dbbceb3627d7bc12eb2d7c94b"}],"concept.wikipedia.adjoint-representation":[{"id":"assertion.concept.wikipedia.adjoint-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjoint representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjoint representation\", CC BY-SA 4.0) states: In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","support":[{"end":322,"quote":"In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","source_id":"wikipedia.article.adjoint-representation","source_sha256":"55c34f4fd658dd5789d8830a120aac8c503e89653939c8e9e0017eb8b891433e","start":108}],"target_id":"concept.wikipedia.adjoint-representation","target_kind":"node","target_sha256":"8cae9ca47343e001a8feaf2b9c4b5dd7a0b99670874799f6e919d611ad4ff484"}],"concept.wikipedia.adjoint-state-method":[{"id":"assertion.concept.wikipedia.adjoint-state-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjoint state method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjoint state method\", CC BY-SA 4.0) states: The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","support":[{"end":256,"quote":"The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","source_id":"wikipedia.article.adjoint-state-method","source_sha256":"7a19989ff31dc098cec68aa865ff63689d4d6e07fcea349754d5c80a2db0a790","start":108}],"target_id":"concept.wikipedia.adjoint-state-method","target_kind":"node","target_sha256":"7d855e5835dfaaa7870e38d710d557690f1e39b13fddde987ba422c3ab4899b9"}],"concept.wikipedia.adjugate-matrix":[{"id":"assertion.concept.wikipedia.adjugate-matrix","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjugate matrix as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjugate matrix\", CC BY-SA 4.0) states: In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","support":[{"end":222,"quote":"In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","source_id":"wikipedia.article.adjugate-matrix","source_sha256":"ec75fe40c8cf3c945c4b5f5abed23fc031d7716bd14f95fefc9190cda0190e30","start":101}],"target_id":"concept.wikipedia.adjugate-matrix","target_kind":"node","target_sha256":"48cc09fe45c4d5b7366b5dfd12d93633b9193dba89dcd2abfbf34ac6064dc9bb"}],"concept.wikipedia.adjustable-pressure-limiting-valve":[{"id":"assertion.concept.wikipedia.adjustable-pressure-limiting-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adjustable pressure-limiting valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adjustable pressure-limiting valve\", CC BY-SA 4.0) states: An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","support":[{"end":356,"quote":"An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","source_id":"wikipedia.article.adjustable-pressure-limiting-valve","source_sha256":"849b78c105a8efbfb451361a7a7a56147249fb37ebbae1a8bbb5fa05055c0d4d","start":122}],"target_id":"concept.wikipedia.adjustable-pressure-limiting-valve","target_kind":"node","target_sha256":"4e89c0affeeda8cfdd3f88d8f953d2961e091937d1e42c8b3447be9e603fcef6"}],"concept.wikipedia.admissible-heuristic":[{"id":"assertion.concept.wikipedia.admissible-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible heuristic\", CC BY-SA 4.0) states: In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","support":[{"end":407,"quote":"In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","source_id":"wikipedia.article.admissible-heuristic","source_sha256":"9812a9f113568ae4a6ef159ec4417c22d6537278b526ca4ca482e1066389b8a1","start":108}],"target_id":"concept.wikipedia.admissible-heuristic","target_kind":"node","target_sha256":"6d1ab894ac96be0385443030f3c8f6f6bbd888b14644f7a9b91f5c745610e8bd"}],"concept.wikipedia.admissible-numbering":[{"id":"assertion.concept.wikipedia.admissible-numbering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible numbering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible numbering\", CC BY-SA 4.0) states: In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","support":[{"end":316,"quote":"In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","source_id":"wikipedia.article.admissible-numbering","source_sha256":"06905f1e9510de0db491252d03715e0b0bf65dfb2bbcca3876f0b4b2d79516f7","start":107}],"target_id":"concept.wikipedia.admissible-numbering","target_kind":"node","target_sha256":"995bc869bfacbfd1beef68a6d5821b3b395c983c1f4737df17faeaf241195540"}],"concept.wikipedia.admissible-representation":[{"id":"assertion.concept.wikipedia.admissible-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Admissible representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Admissible representation\", CC BY-SA 4.0) states: In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","support":[{"end":306,"quote":"In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","source_id":"wikipedia.article.admissible-representation","source_sha256":"0378ec8b844a15003715a134757def24c925e4c0edb1fc023b8b05b37e7dc2f2","start":113}],"target_id":"concept.wikipedia.admissible-representation","target_kind":"node","target_sha256":"c99b3c638614771260322e1a747f3cab497ff138e1ff877f086d8e53b06b66f4"}],"concept.wikipedia.adomian-decomposition-method":[{"id":"assertion.concept.wikipedia.adomian-decomposition-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adomian decomposition method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adomian decomposition method\", CC BY-SA 4.0) states: The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","support":[{"end":248,"quote":"The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","source_id":"wikipedia.article.adomian-decomposition-method","source_sha256":"dbac44382d871c5f7351afecdd56c662cfbd351f21f990892e918aa61caa6992","start":115}],"target_id":"concept.wikipedia.adomian-decomposition-method","target_kind":"node","target_sha256":"583d2451453a339cb6adc24f856ab8ed47f43131888f41deeb23bbe1dcdd65cd"}],"concept.wikipedia.adsorption-bio-oxidation-process":[{"id":"assertion.concept.wikipedia.adsorption-bio-oxidation-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adsorption/bio-oxidation process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adsorption/bio-oxidation process\", CC BY-SA 4.0) states: The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","support":[{"end":246,"quote":"The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","source_id":"wikipedia.article.adsorption-bio-oxidation-process","source_sha256":"3b7720d5925430b8cd91988fc8b1e3f773d2a51b02d0be823efa8ad8a69b9481","start":120}],"target_id":"concept.wikipedia.adsorption-bio-oxidation-process","target_kind":"node","target_sha256":"7df12d610180b677016f4d2775dd186b5372213636e5a7746435db976abefa6f"}],"concept.wikipedia.advance-ratio":[{"id":"assertion.concept.wikipedia.advance-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advance ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advance ratio\", CC BY-SA 4.0) states: The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","support":[{"end":376,"quote":"The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","source_id":"wikipedia.article.advance-ratio","source_sha256":"847132488d8bee07249c966ee8930137d0d60f731c73a49ab9b2dc63ab7be678","start":101}],"target_id":"concept.wikipedia.advance-ratio","target_kind":"node","target_sha256":"cbbac952bd1b1d02946cfc5cafa64630886b76805d13e105d0e951ccdd9647a4"}],"concept.wikipedia.advanced-composite-materials-engineering":[{"id":"assertion.concept.wikipedia.advanced-composite-materials-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced composite materials (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced composite materials (engineering)\", CC BY-SA 4.0) states: In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","support":[{"end":411,"quote":"In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","source_id":"wikipedia.article.advanced-composite-materials-engineering","source_sha256":"8d14252f4be02b8677b5fa452fd593c9dd400db7770a5d0889f3b77f8d3eca22","start":130}],"target_id":"concept.wikipedia.advanced-composite-materials-engineering","target_kind":"node","target_sha256":"3c39be3ceae65d906562c10404b764a8f923d0efa545c555bd6d82590eb65f3d"}],"concept.wikipedia.advanced-multi-mission-operations-system":[{"id":"assertion.concept.wikipedia.advanced-multi-mission-operations-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced multi-mission operations system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced multi-mission operations system\", CC BY-SA 4.0) states: The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","support":[{"end":354,"quote":"The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","source_id":"wikipedia.article.advanced-multi-mission-operations-system","source_sha256":"8b505c433253fa6d6bc1222409db090eab17fd2e737d27565729ed74e9e203a4","start":126}],"target_id":"concept.wikipedia.advanced-multi-mission-operations-system","target_kind":"node","target_sha256":"a9c24f046d9e155a67273e47ee02893e3a0211100e924aa85880fcb140aa01a9"}],"concept.wikipedia.advanced-oxidation-process":[{"id":"assertion.concept.wikipedia.advanced-oxidation-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced oxidation process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced oxidation process\", CC BY-SA 4.0) states: Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","support":[{"end":359,"quote":"Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","source_id":"wikipedia.article.advanced-oxidation-process","source_sha256":"481e0a87463fdd6606635184a87c67889085d29c499270df84d466af40dd9eb9","start":114}],"target_id":"concept.wikipedia.advanced-oxidation-process","target_kind":"node","target_sha256":"bc55cf9c5efbe9151710d97370dca92cafff42a90a3026db13a7d6bdc3f7c6ee"}],"concept.wikipedia.advanced-process-control":[{"id":"assertion.concept.wikipedia.advanced-process-control","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced process control as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced process control\", CC BY-SA 4.0) states: In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","support":[{"end":270,"quote":"In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","source_id":"wikipedia.article.advanced-process-control","source_sha256":"a56fbcd3798b5601f5f3eca186c8670597e970d39e73f2895bb4fb0f74275c79","start":111}],"target_id":"concept.wikipedia.advanced-process-control","target_kind":"node","target_sha256":"7912f2b77981c92b25e549803e149fbd30a500a77ce421529dbdd33619f5d529"}],"concept.wikipedia.advanced-stirling-radioisotope-generator":[{"id":"assertion.concept.wikipedia.advanced-stirling-radioisotope-generator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Advanced Stirling radioisotope generator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Advanced Stirling radioisotope generator\", CC BY-SA 4.0) states: The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","support":[{"end":259,"quote":"The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","source_id":"wikipedia.article.advanced-stirling-radioisotope-generator","source_sha256":"d4fa3eef460bf0942e4b6ca5e61d34ad1cc69630bc2a5db9b8f3616484bfd4f4","start":128}],"target_id":"concept.wikipedia.advanced-stirling-radioisotope-generator","target_kind":"node","target_sha256":"d83dbe63dcdd4aba5e9147a3d210fd3d0d5c32fe5f0e874149c7a14fac863054"}],"concept.wikipedia.adverse-inference":[{"id":"assertion.concept.wikipedia.adverse-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Adverse inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Adverse inference\", CC BY-SA 4.0) states: Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","support":[{"end":229,"quote":"Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","source_id":"wikipedia.article.adverse-inference","source_sha256":"490253a01c7e24e9dad7e4984ff79c6eb319bb9c2654d2ed7c58b19376c01c1e","start":105}],"target_id":"concept.wikipedia.adverse-inference","target_kind":"node","target_sha256":"2ead7d2773f3a0a0f559ebd6ab3e008f9c31386fc4ca1f3197a84e339e5dd4c2"}],"concept.wikipedia.aerial-manned-unmanned-teaming":[{"id":"assertion.concept.wikipedia.aerial-manned-unmanned-teaming","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerial manned-unmanned teaming as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerial manned-unmanned teaming\", CC BY-SA 4.0) states: Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","support":[{"end":252,"quote":"Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","source_id":"wikipedia.article.aerial-manned-unmanned-teaming","source_sha256":"169561b69f8607d2ad1b4640c94148e2f269abe1bbe77cfe7aa0ac21181e0746","start":118}],"target_id":"concept.wikipedia.aerial-manned-unmanned-teaming","target_kind":"node","target_sha256":"4ceab3fbe7b283caa3cf7b806cfd6e8e958d6d975784b32fc630138b12d7c498"}],"concept.wikipedia.aerobic-granular-reactor":[{"id":"assertion.concept.wikipedia.aerobic-granular-reactor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerobic granular reactor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerobic granular reactor\", CC BY-SA 4.0) states: Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","support":[{"end":342,"quote":"Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","source_id":"wikipedia.article.aerobic-granular-reactor","source_sha256":"e4f724c8d68700848530c6a73d31ccc5402b7937ea51c9d695ab40d15f4baf21","start":111}],"target_id":"concept.wikipedia.aerobic-granular-reactor","target_kind":"node","target_sha256":"2cfa8e7f5fedc3c47f5ce2f82052efbef2898373767ff6978775683160e3f814"}],"concept.wikipedia.aerobic-granulation":[{"id":"assertion.concept.wikipedia.aerobic-granulation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerobic granulation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerobic granulation\", CC BY-SA 4.0) states: The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","support":[{"end":242,"quote":"The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","source_id":"wikipedia.article.aerobic-granulation","source_sha256":"d0e404e4da9f06d716b77ad3dd9fa6e988d0ffa4bc285e9e2d0184dce62baa3b","start":107}],"target_id":"concept.wikipedia.aerobic-granulation","target_kind":"node","target_sha256":"a7f5a095e89f389b94b88bb2109f0aaee19e955cebd6ad765f3c7a3be1f85dd3"}],"concept.wikipedia.aerodynamic-center":[{"id":"assertion.concept.wikipedia.aerodynamic-center","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerodynamic center as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerodynamic center\", CC BY-SA 4.0) states: In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","support":[{"end":410,"quote":"In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","source_id":"wikipedia.article.aerodynamic-center","source_sha256":"a6cd2b579b47b52379815df4847cdf88db03bc8b6017c027213e0f425970a46c","start":105}],"target_id":"concept.wikipedia.aerodynamic-center","target_kind":"node","target_sha256":"a4d3b2b5b2c867e49d28553356157e71d32e4def55998277ef7975b1f5b36ede"}],"concept.wikipedia.aeroelasticity":[{"id":"assertion.concept.wikipedia.aeroelasticity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aeroelasticity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aeroelasticity\", CC BY-SA 4.0) states: Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","support":[{"end":294,"quote":"Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","source_id":"wikipedia.article.aeroelasticity","source_sha256":"612b14d53b21b7bb6ddf1f762c722e3b20140bafe811dcdab25e521cd7eec5c0","start":99}],"target_id":"concept.wikipedia.aeroelasticity","target_kind":"node","target_sha256":"440c5bd6b237d17cae1c8fe5d20788ae246442e3c2c97e9b4bacf0dbd4d96066"}],"concept.wikipedia.aerospace-architecture":[{"id":"assertion.concept.wikipedia.aerospace-architecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace architecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace architecture\", CC BY-SA 4.0) states: Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","support":[{"end":319,"quote":"Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","source_id":"wikipedia.article.aerospace-architecture","source_sha256":"cec43433b8d663b3f7127f4256d9f7616a4b819ab48fc6d85421ea2c27f9e068","start":109}],"target_id":"concept.wikipedia.aerospace-architecture","target_kind":"node","target_sha256":"0566d7e8255327cf6cccafe0e920a1b0bd8efff42d19dabcc3ce351233f5eb44"}],"concept.wikipedia.aerospace-bearing":[{"id":"assertion.concept.wikipedia.aerospace-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace bearing\", CC BY-SA 4.0) states: Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","support":[{"end":248,"quote":"Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","source_id":"wikipedia.article.aerospace-bearing","source_sha256":"f43de874dcb1e14c37b23a51009ea10410d1954c6ddc17ef5e24ff4d474b81f4","start":105}],"target_id":"concept.wikipedia.aerospace-bearing","target_kind":"node","target_sha256":"106651f180673d090fbe35080a802412fcd10b4e0120a2178106e2c57e966891"}],"concept.wikipedia.aerospace-materials":[{"id":"assertion.concept.wikipedia.aerospace-materials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace materials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace materials\", CC BY-SA 4.0) states: Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","support":[{"end":272,"quote":"Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","source_id":"wikipedia.article.aerospace-materials","source_sha256":"70d11db2ab16ab2055fc4c33fa947215f14489eca0e7543d68865e8b43c09398","start":107}],"target_id":"concept.wikipedia.aerospace-materials","target_kind":"node","target_sha256":"3d36cc29b75f25c7fa34f7a942df2c69e459532b8de798696a0e9547eb044bfe"}],"concept.wikipedia.aerostructure":[{"id":"assertion.concept.wikipedia.aerostructure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerostructure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerostructure\", CC BY-SA 4.0) states: An aerostructure is a component of an aircraft's airframe.","support":[{"end":158,"quote":"An aerostructure is a component of an aircraft's airframe.","source_id":"wikipedia.article.aerostructure","source_sha256":"5257f45401129a35223c686234d5c7625e24d63a75ce91c77a9f5b4a9bacf244","start":100}],"target_id":"concept.wikipedia.aerostructure","target_kind":"node","target_sha256":"32885ef802a8909c7b41f4eceed58dcdc8df06e1b8813be47057fdb1b0d34c2d"}],"concept.wikipedia.aesthetic-usability-effect":[{"id":"assertion.concept.wikipedia.aesthetic-usability-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aesthetic–usability effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aesthetic–usability effect\", CC BY-SA 4.0) states: The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","support":[{"end":288,"quote":"The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","source_id":"wikipedia.article.aesthetic-usability-effect","source_sha256":"23374f56f63b6f7c0dc501a29f74c3b4ed065b4cdb3309d31c0d69b264a6249b","start":114}],"target_id":"concept.wikipedia.aesthetic-usability-effect","target_kind":"node","target_sha256":"cdd4a3c2e19a45c4deb86f578f44781a78278dd64dc0f189e1a5aff53e9b35fc"}],"concept.wikipedia.affect-heuristic":[{"id":"assertion.concept.wikipedia.affect-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affect heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affect heuristic\", CC BY-SA 4.0) states: The affect heuristic is a heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","support":[{"end":317,"quote":"The affect heuristic is a  heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","source_id":"wikipedia.article.affect-heuristic","source_sha256":"b503ca228139e7dcfe82412483a61ff2137dbc9a3dd24a8f109e0b56cea68f62","start":103}],"target_id":"concept.wikipedia.affect-heuristic","target_kind":"node","target_sha256":"16ba991bd487ccedb2171b9aa5b354a4686c9f13de301079fc354298fc717ac3"}],"concept.wikipedia.affine-arithmetic":[{"id":"assertion.concept.wikipedia.affine-arithmetic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine arithmetic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine arithmetic\", CC BY-SA 4.0) states: Affine arithmetic (AA) is a model for self-validated numerical analysis.","support":[{"end":176,"quote":"Affine arithmetic (AA) is a model for self-validated numerical analysis.","source_id":"wikipedia.article.affine-arithmetic","source_sha256":"ca42c7d2596a4b73a31324ef637717e7cb2408084597e15b6a2b9c3e1f9d9cef","start":104}],"target_id":"concept.wikipedia.affine-arithmetic","target_kind":"node","target_sha256":"1a780a91f89f12443c2cdcb044bc956864389e5b5797e5ab6606131e4677e29c"}],"concept.wikipedia.affine-bundle":[{"id":"assertion.concept.wikipedia.affine-bundle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine bundle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine bundle\", CC BY-SA 4.0) states: In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","support":[{"end":296,"quote":"In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","source_id":"wikipedia.article.affine-bundle","source_sha256":"3ce0072a7d44ca64ca00995ce5c3986bef4d795888399ad9834b1b54cbcd1572","start":101}],"target_id":"concept.wikipedia.affine-bundle","target_kind":"node","target_sha256":"17a8ed46bca1ade74745d79b41279a96b2e4b49389f19d907ec15df36e6e11c7"}],"concept.wikipedia.affine-connection":[{"id":"assertion.concept.wikipedia.affine-connection","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine connection as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine connection\", CC BY-SA 4.0) states: In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","support":[{"end":366,"quote":"In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","source_id":"wikipedia.article.affine-connection","source_sha256":"32bee1e890fa7075a7252353cf8680dd0b6fc4ff3b6b98cdee56eba2ba504584","start":103}],"target_id":"concept.wikipedia.affine-connection","target_kind":"node","target_sha256":"4e99a0644612bf29b7167f82da40d80ac44117c0adc965d4bd61ee73ccf417b2"}],"concept.wikipedia.affine-grassmannian-manifold":[{"id":"assertion.concept.wikipedia.affine-grassmannian-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine Grassmannian (manifold) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine Grassmannian (manifold)\", CC BY-SA 4.0) states: In mathematics, there are two distinct meanings of the term affine Grassmannian.","support":[{"end":198,"quote":"In mathematics, there are two distinct meanings of the term affine Grassmannian.","source_id":"wikipedia.article.affine-grassmannian-manifold","source_sha256":"9252af393598ddf078078c19545f6f4fa2b1e3ba360cebffa121474499cc0566","start":118}],"target_id":"concept.wikipedia.affine-grassmannian-manifold","target_kind":"node","target_sha256":"f0b14bbea4983feaee8fc1f5a67f0bcf75b023c0f5720e39c49d47f2e1353467"}],"concept.wikipedia.affine-group":[{"id":"assertion.concept.wikipedia.affine-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine group\", CC BY-SA 4.0) states: In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","support":[{"end":256,"quote":"In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","source_id":"wikipedia.article.affine-group","source_sha256":"c8a83a048307f09955b28d7d28bba15ddb02ac1c462217a1e15c2486498b1028","start":98}],"target_id":"concept.wikipedia.affine-group","target_kind":"node","target_sha256":"a2a124475614f1c1fe833bce8f6141c8ee956b58ad63530b2fec02e0bc5c15fd"}],"concept.wikipedia.affine-lie-algebra":[{"id":"assertion.concept.wikipedia.affine-lie-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine Lie algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine Lie algebra\", CC BY-SA 4.0) states: In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","support":[{"end":272,"quote":"In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","source_id":"wikipedia.article.affine-lie-algebra","source_sha256":"3d43273528bbc9323b14086cbfdcc663a28253a8c762066c6f5fef53ffa50878","start":105}],"target_id":"concept.wikipedia.affine-lie-algebra","target_kind":"node","target_sha256":"8807bed74eb6192abf276066db460020858637972a53543a6f9002bdd456a960"}],"concept.wikipedia.affine-plank-problem":[{"id":"assertion.concept.wikipedia.affine-plank-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine plank problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine plank problem\", CC BY-SA 4.0) states: In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","support":[{"end":262,"quote":"In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","source_id":"wikipedia.article.affine-plank-problem","source_sha256":"67cf867c0dfa64f6a64c16141b01c65e0d0f5fcac95c8ce08f02c22390e19aad","start":108}],"target_id":"concept.wikipedia.affine-plank-problem","target_kind":"node","target_sha256":"a89062c1b8cdb0fa6db1eed1fe3ca56e8200d60daf25248c88705073c5b26c7f"}],"concept.wikipedia.affine-space":[{"id":"assertion.concept.wikipedia.affine-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine space\", CC BY-SA 4.0) states: In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","support":[{"end":406,"quote":"In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","source_id":"wikipedia.article.affine-space","source_sha256":"25eac7f539638e90924e1190253c0b5556130c3c4e7ce0c98f4d1d92e92fe61f","start":98}],"target_id":"concept.wikipedia.affine-space","target_kind":"node","target_sha256":"fb589ef5dcd10a5c351f1f654a637c45b5176d5ea5e4354e8385da25bb9d90dc"}],"concept.wikipedia.affine-sphere":[{"id":"assertion.concept.wikipedia.affine-sphere","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine sphere as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine sphere\", CC BY-SA 4.0) states: In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","support":[{"end":392,"quote":"In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","source_id":"wikipedia.article.affine-sphere","source_sha256":"963c95a8342d40fc1b6f72a74950f136a002ed287587523e98df4f98e638a915","start":101}],"target_id":"concept.wikipedia.affine-sphere","target_kind":"node","target_sha256":"c13c6bc6d201dfc72569fa77d53f1268a3aeff04643d1b327eae4b3e603e0111"}],"concept.wikipedia.affine-symmetric-group":[{"id":"assertion.concept.wikipedia.affine-symmetric-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affine symmetric group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affine symmetric group\", CC BY-SA 4.0) states: The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","support":[{"end":320,"quote":"The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","source_id":"wikipedia.article.affine-symmetric-group","source_sha256":"7efd367b1af73934eb6b6917c2e138e728a50812256746d1dddddccaae28921e","start":110}],"target_id":"concept.wikipedia.affine-symmetric-group","target_kind":"node","target_sha256":"dd592f2a401bff3400ebefd06f389f98af590f5f168b17487bf9ee4bc8a35000"}],"concept.wikipedia.affinity-laws":[{"id":"assertion.concept.wikipedia.affinity-laws","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affinity laws as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affinity laws\", CC BY-SA 4.0) states: The affinity laws (also known as the \"Fan Laws\" or \"Pump Laws\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","support":[{"end":371,"quote":"The affinity laws (also known as the \\\"Fan Laws\\\" or \\\"Pump Laws\\\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","source_id":"wikipedia.article.affinity-laws","source_sha256":"90007a158e8379e6b6312e68ee455571f9bcb3d1340c8844271b638b80cf4f1e","start":100}],"target_id":"concept.wikipedia.affinity-laws","target_kind":"node","target_sha256":"a782643903b40ef505bf6945f99f58f40ba4152cbeaff342f7269c65486333ee"}],"concept.wikipedia.affirming-the-consequent":[{"id":"assertion.concept.wikipedia.affirming-the-consequent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Affirming the consequent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Affirming the consequent\", CC BY-SA 4.0) states: In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","support":[{"end":470,"quote":"In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","source_id":"wikipedia.article.affirming-the-consequent","source_sha256":"a1fc6f413fe0b30224c790115cbb3c39bcb82c33fd75b0ae8fc74f714e3914f8","start":107}],"target_id":"concept.wikipedia.affirming-the-consequent","target_kind":"node","target_sha256":"2c5cae270485de8c0cae0444aaac82f804e70571de37c5ded7f1476b7a9d192c"}],"concept.wikipedia.agent-causation":[{"id":"assertion.concept.wikipedia.agent-causation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agent causation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agent causation\", CC BY-SA 4.0) states: Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","support":[{"end":293,"quote":"Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","source_id":"wikipedia.article.agent-causation","source_sha256":"b0786632237a2f3b37d5a29a147de92c4127bc58dfd109279d3822ff4ac97725","start":103}],"target_id":"concept.wikipedia.agent-causation","target_kind":"node","target_sha256":"521f5c2eb19872658f817c3fd92a520a46d69e4f91118dc2c8f200c85b64905a"}],"concept.wikipedia.agentive-logic":[{"id":"assertion.concept.wikipedia.agentive-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agentive logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agentive logic\", CC BY-SA 4.0) states: Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","support":[{"end":318,"quote":"Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","source_id":"wikipedia.article.agentive-logic","source_sha256":"f24aa56faff96e9e6064f65a6b7dd222cd88037c9a61f531266412ce5c5bb7ac","start":102}],"target_id":"concept.wikipedia.agentive-logic","target_kind":"node","target_sha256":"fc9d5dc264bf788b682e707ac3a9ec0dab901c38a85288adca1d99737b1f3571"}],"concept.wikipedia.agitator-device":[{"id":"assertion.concept.wikipedia.agitator-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agitator (device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agitator (device)\", CC BY-SA 4.0) states: An agitator is a device or mechanism to put something into motion by shaking or stirring.","support":[{"end":193,"quote":"An agitator is a device or mechanism to put something into motion by shaking or stirring.","source_id":"wikipedia.article.agitator-device","source_sha256":"795d4c411866fba976dab15b73e4746b13e2a63755231e85e477899aa0b17446","start":104}],"target_id":"concept.wikipedia.agitator-device","target_kind":"node","target_sha256":"3f8023568d2e9f773ef6e332e609dc7eb5b5f31242849cd09dd2e3e06735285c"}],"concept.wikipedia.ai-trust-paradox":[{"id":"assertion.concept.wikipedia.ai-trust-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"AI trust paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"AI trust paradox\", CC BY-SA 4.0) states: The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","support":[{"end":406,"quote":"The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","source_id":"wikipedia.article.ai-trust-paradox","source_sha256":"5b2bf29586a8570a20eb87c96fcfdf23ee7dfdcfb81beca068013b12448a4ca1","start":104}],"target_id":"concept.wikipedia.ai-trust-paradox","target_kind":"node","target_sha256":"68a914ee82b436f0976bc9cc34c1ddad45827e4d41a594086b47ce71f9befe07"}],"concept.wikipedia.air-bearing":[{"id":"assertion.concept.wikipedia.air-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air bearing\", CC BY-SA 4.0) states: Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","support":[{"end":282,"quote":"Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","source_id":"wikipedia.article.air-bearing","source_sha256":"ee2641e5dbe1b3f8ec04ad3893b0681652bdb6b4d2e579f4eff38db7de1c646b","start":99}],"target_id":"concept.wikipedia.air-bearing","target_kind":"node","target_sha256":"7194f4639e8c5f3fbeb9dd626d9b6538af2b7d5cc4f4029d157672c9158fb601"}],"concept.wikipedia.air-carbon-arc-cutting":[{"id":"assertion.concept.wikipedia.air-carbon-arc-cutting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air carbon arc cutting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air carbon arc cutting\", CC BY-SA 4.0) states: Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","support":[{"end":292,"quote":"Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","source_id":"wikipedia.article.air-carbon-arc-cutting","source_sha256":"f0de64eae7bfaab260187157aa9b91595957357ec18afc2ef66c8586fa7aac5e","start":110}],"target_id":"concept.wikipedia.air-carbon-arc-cutting","target_kind":"node","target_sha256":"7c76665bee8e44ee6d02755aaaa4272b9f24f896cc8c41af96e19638143a0b74"}],"concept.wikipedia.air-cooled-heat-exchanger":[{"id":"assertion.concept.wikipedia.air-cooled-heat-exchanger","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air cooled heat exchanger as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air cooled heat exchanger\", CC BY-SA 4.0) states: An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","support":[{"end":363,"quote":"An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","source_id":"wikipedia.article.air-cooled-heat-exchanger","source_sha256":"00cd98d1ee6fe7bc38bf6ebb508a99b559995a091bc7422f776db7b0c9cfee7f","start":113}],"target_id":"concept.wikipedia.air-cooled-heat-exchanger","target_kind":"node","target_sha256":"a4f266ec57b19321a75450e65a02e4a1575e022af3c8c8726170571aeaaeecc4"}],"concept.wikipedia.air-data-inertial-reference-unit":[{"id":"assertion.concept.wikipedia.air-data-inertial-reference-unit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air data inertial reference unit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air data inertial reference unit\", CC BY-SA 4.0) states: An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","support":[{"end":557,"quote":"An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","source_id":"wikipedia.article.air-data-inertial-reference-unit","source_sha256":"14f13721f7154974c8ed411da264df7e7f26a21d421f37e293d21461831c3602","start":119}],"target_id":"concept.wikipedia.air-data-inertial-reference-unit","target_kind":"node","target_sha256":"34030597e05ab76e8bf9a85b57af3c08734c4d56074792dfbba710a0440efb9c"}],"concept.wikipedia.air-fuel-ratio":[{"id":"assertion.concept.wikipedia.air-fuel-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air–fuel ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air–fuel ratio\", CC BY-SA 4.0) states: Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","support":[{"end":215,"quote":"Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","source_id":"wikipedia.article.air-fuel-ratio","source_sha256":"b07fed0d6a35abb3c595bb81076cf5dacd13ba0757d3efdabf7d4dc0c026b1ca","start":101}],"target_id":"concept.wikipedia.air-fuel-ratio","target_kind":"node","target_sha256":"bdcd181f88df55567e50dd9db70b5f457367dcf4d39eaa89cdfb2213947f834a"}],"concept.wikipedia.air-handler":[{"id":"assertion.concept.wikipedia.air-handler","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air handler as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air handler\", CC BY-SA 4.0) states: An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","support":[{"end":280,"quote":"An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","source_id":"wikipedia.article.air-handler","source_sha256":"725a012d75fd6aa9bb407af0cfc331d2ccf00b8ed3bf661a8e0b6d3732932b01","start":98}],"target_id":"concept.wikipedia.air-handler","target_kind":"node","target_sha256":"8873db462b882fc5d0691bd6652679b5fbbda49100fe305627b0f0e5170a1df6"}],"concept.wikipedia.air-operated-valve":[{"id":"assertion.concept.wikipedia.air-operated-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air-operated valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air-operated valve\", CC BY-SA 4.0) states: An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","support":[{"end":267,"quote":"An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","source_id":"wikipedia.article.air-operated-valve","source_sha256":"549e08ccd477dabbea8c5aa1032afe7dc86c47ade4ffaf10e6fe9f24b8879e79","start":105}],"target_id":"concept.wikipedia.air-operated-valve","target_kind":"node","target_sha256":"404d51eb6e49cee4f417a8f61771c1f723ae3c0a99ec9623ade2db62f4c99b69"}],"concept.wikipedia.air-permeability-specific-surface":[{"id":"assertion.concept.wikipedia.air-permeability-specific-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air permeability specific surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air permeability specific surface\", CC BY-SA 4.0) states: The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","support":[{"end":244,"quote":"The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","source_id":"wikipedia.article.air-permeability-specific-surface","source_sha256":"01c47059818a4680732fbb275ffd20d22648b686d309da2e61cb045cf36a3d15","start":121}],"target_id":"concept.wikipedia.air-permeability-specific-surface","target_kind":"node","target_sha256":"9ceefbf89434db080be0df12b7f28d0131de4b3304b46801f965e896b15cbb0c"}],"concept.wikipedia.air-preheater":[{"id":"assertion.concept.wikipedia.air-preheater","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air preheater as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air preheater\", CC BY-SA 4.0) states: An air preheater is any device designed to heat air before another process (for example, combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","support":[{"end":294,"quote":"An air preheater is any device designed to heat air before another process (for example,  combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","source_id":"wikipedia.article.air-preheater","source_sha256":"d1da5e46576ed506970984c7f0cac276b410beafcc734d4bc04175559749496e","start":100}],"target_id":"concept.wikipedia.air-preheater","target_kind":"node","target_sha256":"881b398d93f85a773f43bae08c9d8d18c32a095ad77d2f08aa1cfb498cec2128"}],"concept.wikipedia.air-pump":[{"id":"assertion.concept.wikipedia.air-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Air pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Air pump\", CC BY-SA 4.0) states: An air pump is a pump for pushing air. Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","support":[{"end":381,"quote":"An air pump is a pump for pushing air.  Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","source_id":"wikipedia.article.air-pump","source_sha256":"a3958cf864687251ae1021d5fb1cf5014dac00763598bd75d5ff4ad79129bf34","start":95}],"target_id":"concept.wikipedia.air-pump","target_kind":"node","target_sha256":"9bee414f215ca6b011201cad68e090b8f0f83001a2428dd2831722523cbdf081"}],"concept.wikipedia.airframe":[{"id":"assertion.concept.wikipedia.airframe","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airframe as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airframe\", CC BY-SA 4.0) states: The mechanical structure of an aircraft is known as the airframe.","support":[{"end":159,"quote":"The mechanical structure of an aircraft is known as the airframe.","source_id":"wikipedia.article.airframe","source_sha256":"fad97f0802c817c12caa68bb0488bc30fc8ade563ca2be1fac7bcee4ae07dbd4","start":94}],"target_id":"concept.wikipedia.airframe","target_kind":"node","target_sha256":"6b6269ccb5ce4707757f950f6baa763f4a4ba01f6235e5c9119dd237e05283d3"}],"concept.wikipedia.airlift-pump":[{"id":"assertion.concept.wikipedia.airlift-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airlift pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airlift pump\", CC BY-SA 4.0) states: An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","support":[{"end":200,"quote":"An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","source_id":"wikipedia.article.airlift-pump","source_sha256":"2313f99e442b5f6b231964ba4640cbfe6de84cb647bdcd866d13d0b73f980638","start":99}],"target_id":"concept.wikipedia.airlift-pump","target_kind":"node","target_sha256":"ec28f15dcdaa535766cfa178b33f7846e0e4e022a657770567b0560f897cc8c3"}],"concept.wikipedia.airshaft":[{"id":"assertion.concept.wikipedia.airshaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Airshaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Airshaft\", CC BY-SA 4.0) states: In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","support":[{"end":253,"quote":"In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","source_id":"wikipedia.article.airshaft","source_sha256":"f7975797e9e5adda46dcef0730118a860b562e5740ba9f9f6b710af9fffcda2b","start":95}],"target_id":"concept.wikipedia.airshaft","target_kind":"node","target_sha256":"89357b026c459c6eb675ecbe52ef1ec3e42273f13fd13f5bbc1021ab02531100"}],"concept.wikipedia.aitken-interpolation":[{"id":"assertion.concept.wikipedia.aitken-interpolation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aitken interpolation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aitken interpolation\", CC BY-SA 4.0) states: Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","support":[{"end":234,"quote":"Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","source_id":"wikipedia.article.aitken-interpolation","source_sha256":"a5832f513504062729117012bf8129f13ca827b852455a52d352ebaa3932ef81","start":108}],"target_id":"concept.wikipedia.aitken-interpolation","target_kind":"node","target_sha256":"de845ce2ee0f772d727901838c6849a2b87a981fb98b96b60b759d4db3f6cf5c"}],"concept.wikipedia.alarm-management":[{"id":"assertion.concept.wikipedia.alarm-management","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alarm management as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alarm management\", CC BY-SA 4.0) states: Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","support":[{"end":296,"quote":"Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","source_id":"wikipedia.article.alarm-management","source_sha256":"18cf59529db6895c931fdd0456751be6432ab20cd2058889b69fc4f1b8a65c72","start":102}],"target_id":"concept.wikipedia.alarm-management","target_kind":"node","target_sha256":"18be014a5e4c99160154c3f53977efce90ecaf107e1cc5f03e6b853b5483bacd"}],"concept.wikipedia.albertson-index":[{"id":"assertion.concept.wikipedia.albertson-index","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Albertson index as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Albertson index\", CC BY-SA 4.0) states: The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","support":[{"end":290,"quote":"The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","source_id":"wikipedia.article.albertson-index","source_sha256":"e6a9687641f1a24d053e9538ccaa0a149c80711c34feb28f9311b37b2a609ebe","start":103}],"target_id":"concept.wikipedia.albertson-index","target_kind":"node","target_sha256":"b7d8be1ca3cdae401eb09381ae0ad4f658908dbbb55d87034f38976cc3082e4c"}],"concept.wikipedia.alexander-duality":[{"id":"assertion.concept.wikipedia.alexander-duality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander duality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander duality\", CC BY-SA 4.0) states: In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","support":[{"end":303,"quote":"In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","source_id":"wikipedia.article.alexander-duality","source_sha256":"f5f44580b7a4aa1ea37e7999d87576a63b2ace2d919f9db4f5f9b318ff646be6","start":104}],"target_id":"concept.wikipedia.alexander-duality","target_kind":"node","target_sha256":"d085eef169232d7790a132c402759ed319c36018613b0d93322bd44df02b8167"}],"concept.wikipedia.alexander-polynomial":[{"id":"assertion.concept.wikipedia.alexander-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander polynomial\", CC BY-SA 4.0) states: In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","support":[{"end":239,"quote":"In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","source_id":"wikipedia.article.alexander-polynomial","source_sha256":"0ed6cc84135da42b792dbcee21d4b9bcc641c0edac779d3caa30ba16e4609233","start":107}],"target_id":"concept.wikipedia.alexander-polynomial","target_kind":"node","target_sha256":"9d7f31240a4a8ffcc5faf7368aaf6163a9045fd538daa3e7b7071716dd3af795"}],"concept.wikipedia.alexandroff-extension":[{"id":"assertion.concept.wikipedia.alexandroff-extension","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandroff extension as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandroff extension\", CC BY-SA 4.0) states: In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","support":[{"end":299,"quote":"In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","source_id":"wikipedia.article.alexandroff-extension","source_sha256":"fe7d56c04a23816d29b3d696e8579c766fc981cf4fd4b0627fd0e8ad473e9e27","start":106}],"target_id":"concept.wikipedia.alexandroff-extension","target_kind":"node","target_sha256":"ad9f3f4e2e27d2709c1e73c971f87bef5ed31328bbc37ab8a51e4ef0a4b0dc5d"}],"concept.wikipedia.alexandrov-space":[{"id":"assertion.concept.wikipedia.alexandrov-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandrov space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandrov space\", CC BY-SA 4.0) states: In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","support":[{"end":271,"quote":"In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","source_id":"wikipedia.article.alexandrov-space","source_sha256":"aae255a25b698b558359e98c34e4c71d4695eae85fb96610c0d8b850283c7bea","start":104}],"target_id":"concept.wikipedia.alexandrov-space","target_kind":"node","target_sha256":"2f7b69a492707621ae233776ae9595cc16738f4d5ecfd9bf854b3cca67526c10"}],"concept.wikipedia.alexandrov-topology":[{"id":"assertion.concept.wikipedia.alexandrov-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexandrov topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexandrov topology\", CC BY-SA 4.0) states: In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","support":[{"end":309,"quote":"In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","source_id":"wikipedia.article.alexandrov-topology","source_sha256":"91f5d719859cb893c50b0f13f2245c14c8c06c5eb042bc3b1183780b15f9828a","start":105}],"target_id":"concept.wikipedia.alexandrov-topology","target_kind":"node","target_sha256":"3502ddd7b8d217d63b25a8b97c37dbcefb1d31d91f8beddc129e3b7bff98fd2d"}],"concept.wikipedia.algebra-extension":[{"id":"assertion.concept.wikipedia.algebra-extension","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebra extension as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebra extension\", CC BY-SA 4.0) states: In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","support":[{"end":201,"quote":"In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","source_id":"wikipedia.article.algebra-extension","source_sha256":"f1ff18875218685a3748b5c35a21a19c2fa7f7c96a19cdc8d0ede6a90295ead1","start":105}],"target_id":"concept.wikipedia.algebra-extension","target_kind":"node","target_sha256":"610084ca92b620e4c0be9122740f39ea253857d9403daccb984cc9bfb37fc703"}],"concept.wikipedia.algebra-representation":[{"id":"assertion.concept.wikipedia.algebra-representation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebra representation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebra representation\", CC BY-SA 4.0) states: In abstract algebra, a representation of an associative algebra is a module for that algebra.","support":[{"end":201,"quote":"In abstract algebra, a representation of an associative algebra is a module for that algebra.","source_id":"wikipedia.article.algebra-representation","source_sha256":"e42fdffe240853f29b6899d863dc722ba18455b15ff1e8f9b962b5c5c267324c","start":108}],"target_id":"concept.wikipedia.algebra-representation","target_kind":"node","target_sha256":"5d6eee5e947c9ceab045ec53865f83f070664a8db3f68be7987819798c178162"}],"concept.wikipedia.algebraic-cycle":[{"id":"assertion.concept.wikipedia.algebraic-cycle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic cycle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic cycle\", CC BY-SA 4.0) states: In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V. These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","support":[{"end":316,"quote":"In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V.  These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","source_id":"wikipedia.article.algebraic-cycle","source_sha256":"a1ed8f49987d19098db2d83e5f2717f479744d617aab5efbbebe487942cd03d9","start":102}],"target_id":"concept.wikipedia.algebraic-cycle","target_kind":"node","target_sha256":"a50189987ae4ad8ffacbb6fcdb96d6b19cea8db79bb6adf5817bfc32de4ff72a"}],"concept.wikipedia.algebraic-differential-equation":[{"id":"assertion.concept.wikipedia.algebraic-differential-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic differential equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic differential equation\", CC BY-SA 4.0) states: In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","support":[{"end":251,"quote":"In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","source_id":"wikipedia.article.algebraic-differential-equation","source_sha256":"20a73133bcd45ec75ad552005580c76e2b8b821a595e692444b68a3cedd76467","start":118}],"target_id":"concept.wikipedia.algebraic-differential-equation","target_kind":"node","target_sha256":"1d5f2265792d6705acddc1150aad8238e7ba029c78a7ed44b2f829ca11c2c57e"}],"concept.wikipedia.algebraic-function":[{"id":"assertion.concept.wikipedia.algebraic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic function\", CC BY-SA 4.0) states: In mathematics, an algebraic function is a function that satisfies a polynomial equation.","support":[{"end":193,"quote":"In mathematics, an algebraic function is a function that satisfies a polynomial equation.","source_id":"wikipedia.article.algebraic-function","source_sha256":"073286b57c3048dabd96453a18e51f59038fe4111ed9380acade3959455988a9","start":104}],"target_id":"concept.wikipedia.algebraic-function","target_kind":"node","target_sha256":"e35d67cf387d9db6d8efbe37a1b6e78fe3d1e15e9ce87fed0d1c07390e70fb99"}],"concept.wikipedia.algebraic-geometry-and-analytic-geometry":[{"id":"assertion.concept.wikipedia.algebraic-geometry-and-analytic-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic geometry and analytic geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic geometry and analytic geometry\", CC BY-SA 4.0) states: In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","support":[{"end":216,"quote":"In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","source_id":"wikipedia.article.algebraic-geometry-and-analytic-geometry","source_sha256":"9b3a3ee2c59ea274736d5e3a4d0fc77268b367cfa78cb4066119ac546e93844a","start":126}],"target_id":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","target_kind":"node","target_sha256":"509f0bb8576652150829f7822206a8f1e0063236adb4bd19162f878772a375c0"}],"concept.wikipedia.algebraic-interior":[{"id":"assertion.concept.wikipedia.algebraic-interior","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic interior as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic interior\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","support":[{"end":272,"quote":"In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","source_id":"wikipedia.article.algebraic-interior","source_sha256":"4195c2ee12eef06702b765a69a7d8adfda82457180ec5f8fe6f3ad55c23ee8a7","start":106}],"target_id":"concept.wikipedia.algebraic-interior","target_kind":"node","target_sha256":"e622a87a917b37bd759bc2b1bc2686331e046acaa1647840338dfba68b2cbe7e"}],"concept.wikipedia.algebraic-k-theory":[{"id":"assertion.concept.wikipedia.algebraic-k-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic K-theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic K-theory\", CC BY-SA 4.0) states: Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","support":[{"end":227,"quote":"Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","source_id":"wikipedia.article.algebraic-k-theory","source_sha256":"c70a109055c4449aac61f33c564bf5b942ea718bdd15fa70c3010dc01c923d57","start":104}],"target_id":"concept.wikipedia.algebraic-k-theory","target_kind":"node","target_sha256":"e4a9f4944471f13feaa2429c6f460e62e1d2c7ac9a32861c9ce9575111628237"}],"concept.wikipedia.algebraic-manifold":[{"id":"assertion.concept.wikipedia.algebraic-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic manifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic manifold\", CC BY-SA 4.0) states: In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","support":[{"end":192,"quote":"In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","source_id":"wikipedia.article.algebraic-manifold","source_sha256":"ad19068268ec26e6431f0a75031daa427db77e926b1623d057d159f7af0164d2","start":105}],"target_id":"concept.wikipedia.algebraic-manifold","target_kind":"node","target_sha256":"c7aca5b51f3de645146c8fa3e6df88e2b0633d0814693130ec0e2d5abc49eb8b"}],"concept.wikipedia.algebraic-semantics-mathematical-logic":[{"id":"assertion.concept.wikipedia.algebraic-semantics-mathematical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic semantics (mathematical logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic semantics (mathematical logic)\", CC BY-SA 4.0) states: In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","support":[{"end":245,"quote":"In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","source_id":"wikipedia.article.algebraic-semantics-mathematical-logic","source_sha256":"4aeeaff69e7ba92a53ddfbe574828506b902d45de4f176d8c809e6e5591c6a17","start":127}],"target_id":"concept.wikipedia.algebraic-semantics-mathematical-logic","target_kind":"node","target_sha256":"b525064379fa70f5940fad47c3246bb02e0dde0aabd14b8f45a7a3a97c5eae5c"}],"concept.wikipedia.algebraic-structure":[{"id":"assertion.concept.wikipedia.algebraic-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic structure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic structure\", CC BY-SA 4.0) states: In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","support":[{"end":428,"quote":"In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","source_id":"wikipedia.article.algebraic-structure","source_sha256":"d152cf257e90068c846f46d4241966d46a27dc325a2bb59d425a6722f1cecccb","start":105}],"target_id":"concept.wikipedia.algebraic-structure","target_kind":"node","target_sha256":"15dc84610b940fcbd4445c8a561be5ad00fc1702f27f5613034863b26fdbe2b8"}],"concept.wikipedia.algebraically-compact-module":[{"id":"assertion.concept.wikipedia.algebraically-compact-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraically compact module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraically compact module\", CC BY-SA 4.0) states: In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \"nice\" property which allows the solution of infinite systems of equations in the module by finitary means.","support":[{"end":338,"quote":"In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \\\"nice\\\" property which allows the solution of infinite systems of equations in the module by finitary means.","source_id":"wikipedia.article.algebraically-compact-module","source_sha256":"127adf2a79c83471f2d771e938087bba50e6c4d5b0180e4c77e21aa5d0462bb7","start":114}],"target_id":"concept.wikipedia.algebraically-compact-module","target_kind":"node","target_sha256":"b19f362e137d07f5ec30272cf88f23389ed5890b8f4575ade2b777c03f2f42c3"}],"concept.wikipedia.aliasing":[{"id":"assertion.concept.wikipedia.aliasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aliasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aliasing\", CC BY-SA 4.0) states: In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","support":[{"end":292,"quote":"In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","source_id":"wikipedia.article.aliasing","source_sha256":"0eb6a5af935dfef86437559e8e357bae416c0201a801860128eaf5baca02995b","start":94}],"target_id":"concept.wikipedia.aliasing","target_kind":"node","target_sha256":"eadbfb03367dc6dcc75e39df9739b01091e86b7545c28a7cb6a43879680c4f37"}],"concept.wikipedia.alief-mental-state":[{"id":"assertion.concept.wikipedia.alief-mental-state","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alief (mental state) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alief (mental state)\", CC BY-SA 4.0) states: In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","support":[{"end":266,"quote":"In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","source_id":"wikipedia.article.alief-mental-state","source_sha256":"5e1c37b7fa2c03efb24fb490caa19ea53c46d805f632750f69923675889bb587","start":108}],"target_id":"concept.wikipedia.alief-mental-state","target_kind":"node","target_sha256":"3c2e0cac864432a1af2b5f8d20ca4f580772acbfa0a24e0e4d9151910331d8f7"}],"concept.wikipedia.alignments-of-random-points":[{"id":"assertion.concept.wikipedia.alignments-of-random-points","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alignments of random points as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alignments of random points\", CC BY-SA 4.0) states: The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","support":[{"end":318,"quote":"The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","source_id":"wikipedia.article.alignments-of-random-points","source_sha256":"69819e03c7915db30773deb9f84df299d0e4ca31acbe834c4edce36aed82b386","start":113}],"target_id":"concept.wikipedia.alignments-of-random-points","target_kind":"node","target_sha256":"488a1fc302e8024c5eaab532fa7b5bf7899e846af868c7f4b11a20847588968b"}],"concept.wikipedia.alkali-metal-thermal-to-electric-converter":[{"id":"assertion.concept.wikipedia.alkali-metal-thermal-to-electric-converter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alkali-metal thermal to electric converter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alkali-metal thermal to electric converter\", CC BY-SA 4.0) states: An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","support":[{"end":338,"quote":"An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","source_id":"wikipedia.article.alkali-metal-thermal-to-electric-converter","source_sha256":"1910f08b04b08e56ed9a7ce912ed8951fca4e20647384fb760798b898f5cd2a8","start":129}],"target_id":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","target_kind":"node","target_sha256":"40609b5b80f541a124ca7c5097f5c06ccdf08c69b55bd3bf4e3bd5549c1a0b85"}],"concept.wikipedia.all-in-rate":[{"id":"assertion.concept.wikipedia.all-in-rate","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"All-in rate as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"All-in rate\", CC BY-SA 4.0) states: All-in rate is a term used in both the construction industry and the financial sector.","support":[{"end":185,"quote":"All-in rate is a term used in both the construction industry and the financial sector.","source_id":"wikipedia.article.all-in-rate","source_sha256":"ef3c20f5b188278d9e5f57a5c87335f2605f1b229c9462c125501865d04dcf1d","start":99}],"target_id":"concept.wikipedia.all-in-rate","target_kind":"node","target_sha256":"08d28ad24ca38c9e91f3fb97f4f7ac3d043389de906eac749f708c6451d4ab23"}],"concept.wikipedia.all-one-polynomial":[{"id":"assertion.concept.wikipedia.all-one-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"All one polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"All one polynomial\", CC BY-SA 4.0) states: In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","support":[{"end":199,"quote":"In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","source_id":"wikipedia.article.all-one-polynomial","source_sha256":"47c65f2fc2b9d129bf825ff7ec99da6b2cd042b39cb0c6cc8162d2c0f6a21b01","start":105}],"target_id":"concept.wikipedia.all-one-polynomial","target_kind":"node","target_sha256":"1f72c527ef6759026a2ad9ec736e34a03c4245fe1f29bd7daa40d6e4178c21e4"}],"concept.wikipedia.allegory-of-the-cave":[{"id":"assertion.concept.wikipedia.allegory-of-the-cave","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Allegory of the cave as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Allegory of the cave\", CC BY-SA 4.0) states: The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \"the effect of education (παιδεία) and the lack of it on our nature\".","support":[{"end":311,"quote":"The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \\\"the effect of education (παιδεία) and the lack of it on our nature\\\".","source_id":"wikipedia.article.allegory-of-the-cave","source_sha256":"676b50b9623ec983551d248d2bdda73275e57cb3895f86c4be1a3775df3db2f6","start":105}],"target_id":"concept.wikipedia.allegory-of-the-cave","target_kind":"node","target_sha256":"cd06991fe7e06e433640b1e55b98549eeb57ff7ef8edbbb9bb9b371bdffcc4e2"}],"concept.wikipedia.almost-everywhere":[{"id":"assertion.concept.wikipedia.almost-everywhere","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost everywhere as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost everywhere\", CC BY-SA 4.0) states: In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","support":[{"end":307,"quote":"In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","source_id":"wikipedia.article.almost-everywhere","source_sha256":"d1d2fa957926b715f08b1a7de31acd7342344824dfac35eaf6124531352f51f9","start":102}],"target_id":"concept.wikipedia.almost-everywhere","target_kind":"node","target_sha256":"fd80aec1e0092c11df27d6465196eccd644b3be316a44309d1cebcaca3a5e8b0"}],"concept.wikipedia.almost-perfect-number":[{"id":"assertion.concept.wikipedia.almost-perfect-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost perfect number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost perfect number\", CC BY-SA 4.0) states: In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","support":[{"end":414,"quote":"In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","source_id":"wikipedia.article.almost-perfect-number","source_sha256":"f41dbd6a61845a18451f38ac1b981cfbe43c9157ed9f610e9b3c9d412ec02f3d","start":107}],"target_id":"concept.wikipedia.almost-perfect-number","target_kind":"node","target_sha256":"1bac32de3b8c16a6de53af435ed257878fd7dac17c0c727f084ff6194af6eed2"}],"concept.wikipedia.almost-periodic-function":[{"id":"assertion.concept.wikipedia.almost-periodic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost periodic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost periodic function\", CC BY-SA 4.0) states: In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \"almost-periods\".","support":[{"end":321,"quote":"In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \\\"almost-periods\\\".","source_id":"wikipedia.article.almost-periodic-function","source_sha256":"b6ff3c5dedd0c85a0a0d53502f799fa8c09eb6bacc6ff0542962aefdcb084a5f","start":110}],"target_id":"concept.wikipedia.almost-periodic-function","target_kind":"node","target_sha256":"9ca0c0da92dfa18e27b45f4e5c93036dd1e45a4e3d23dec22f799109c1683baa"}],"concept.wikipedia.almost-ring":[{"id":"assertion.concept.wikipedia.almost-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost ring\", CC BY-SA 4.0) states: In mathematics, almost modules and almost rings are certain objects interpolating between rings and their fields of fractions.","support":[{"end":226,"quote":"In mathematics, almost modules and almost rings are certain objects interpolating between  rings and their fields of fractions.","source_id":"wikipedia.article.almost-ring","source_sha256":"88da25d9805dd7ffd4cbd3ff99d8be9c285b549ae1d0bf82ead7b954f2f9a30b","start":99}],"target_id":"concept.wikipedia.almost-ring","target_kind":"node","target_sha256":"64792e3c20677288f072c3a27e574dd4e482f5a43f09113737b3b3a6d7fe8c1e"}],"concept.wikipedia.almost-surely":[{"id":"assertion.concept.wikipedia.almost-surely","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Almost surely as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Almost surely\", CC BY-SA 4.0) states: In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","support":[{"end":270,"quote":"In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","source_id":"wikipedia.article.almost-surely","source_sha256":"0de8f6059ce071e012d294df709931101826e797c606c35f1a4207b109f56bd9","start":99}],"target_id":"concept.wikipedia.almost-surely","target_kind":"node","target_sha256":"5c42e37ba3c48b8e6b0b5723e8fbac4e39dda82a07cd2ec41f23b58c91e9617e"}],"concept.wikipedia.alpha-beta-filter":[{"id":"assertion.concept.wikipedia.alpha-beta-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alpha beta filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alpha beta filter\", CC BY-SA 4.0) states: An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","support":[{"end":273,"quote":"An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","source_id":"wikipedia.article.alpha-beta-filter","source_sha256":"24aec09b52e3ecde3e0d76974ac77b9ccce3eca3025158eac76e02d67e1d5403","start":105}],"target_id":"concept.wikipedia.alpha-beta-filter","target_kind":"node","target_sha256":"f1b2c7ef4040ea9338fe4001b3023dd0594ea0e616476a7febebd606ea45aa37"}],"concept.wikipedia.alpha-factor":[{"id":"assertion.concept.wikipedia.alpha-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alpha factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alpha factor\", CC BY-SA 4.0) states: The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","support":[{"end":225,"quote":"The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","source_id":"wikipedia.article.alpha-factor","source_sha256":"56dc6d1644ef664565fcbaa9d071583e2eeedcad917cc14c48ea8d3a91aa6fd9","start":100}],"target_id":"concept.wikipedia.alpha-factor","target_kind":"node","target_sha256":"9e6be167fa36fdf44dd2513d1787e9375bf11c0045302b0be986ca933003e430"}],"concept.wikipedia.alphabet-of-human-thought":[{"id":"assertion.concept.wikipedia.alphabet-of-human-thought","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alphabet of human thought as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alphabet of human thought\", CC BY-SA 4.0) states: The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","support":[{"end":365,"quote":"The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","source_id":"wikipedia.article.alphabet-of-human-thought","source_sha256":"44f65a17ed658728649826bf13b4546c4e19a37d602da42c98e76a842b4d71cf","start":111}],"target_id":"concept.wikipedia.alphabet-of-human-thought","target_kind":"node","target_sha256":"e7cf57970e3d7f5273be1d7e76c8de3b1a6d67391bd725949e53947cceed52c1"}],"concept.wikipedia.alternating-current":[{"id":"assertion.concept.wikipedia.alternating-current","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alternating current as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alternating current\", CC BY-SA 4.0) states: Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","support":[{"end":309,"quote":"Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","source_id":"wikipedia.article.alternating-current","source_sha256":"18a6e09fc37bc42467570c8803f91458a44578a67ba8ff43d699e77c2b71ea2d","start":104}],"target_id":"concept.wikipedia.alternating-current","target_kind":"node","target_sha256":"54eb290564804b1137efd2225169e5e5eda7e580d5689daa79b97abd8659863a"}],"concept.wikipedia.alternating-series":[{"id":"assertion.concept.wikipedia.alternating-series","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alternating series as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alternating series\", CC BY-SA 4.0) states: In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","support":[{"end":224,"quote":"In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","source_id":"wikipedia.article.alternating-series","source_sha256":"88197222820fdb7067e04b17e48ce965e062c0445c79c3e72d0fde9e0770c8d4","start":104}],"target_id":"concept.wikipedia.alternating-series","target_kind":"node","target_sha256":"9d72d20604a41d96d3fe35c2f2eab971b05336d53beeaa5f1a053095fef16105"}],"concept.wikipedia.aluminium-conductor-steel-reinforced-cable":[{"id":"assertion.concept.wikipedia.aluminium-conductor-steel-reinforced-cable","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aluminium-conductor steel-reinforced cable as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aluminium-conductor steel-reinforced cable\", CC BY-SA 4.0) states: Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","support":[{"end":279,"quote":"Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","source_id":"wikipedia.article.aluminium-conductor-steel-reinforced-cable","source_sha256":"ca7df856c998c31c1c9cbc2c8e52d59f4bd271c60a39fb5d0e987a08f7502a7d","start":130}],"target_id":"concept.wikipedia.aluminium-conductor-steel-reinforced-cable","target_kind":"node","target_sha256":"652001eabfd31421b553c36ddbd6451b99899e87d40b1edd60e4605b61b6e997"}],"concept.wikipedia.alvin-plantinga-s-free-will-defense":[{"id":"assertion.concept.wikipedia.alvin-plantinga-s-free-will-defense","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alvin Plantinga's free-will defense as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alvin Plantinga's free-will defense\", CC BY-SA 4.0) states: Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","support":[{"end":319,"quote":"Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","source_id":"wikipedia.article.alvin-plantinga-s-free-will-defense","source_sha256":"e280db366964879677f9bd4f1fda0936bc843125ca9ec9b45d3d98a72a1c8bef","start":123}],"target_id":"concept.wikipedia.alvin-plantinga-s-free-will-defense","target_kind":"node","target_sha256":"bf69d376fc90615b77378abafac916d2de8381f0722d1e7b4ff88a6536d56f69"}],"concept.wikipedia.always-already":[{"id":"assertion.concept.wikipedia.always-already","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Always already as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Always already\", CC BY-SA 4.0) states: In philosophy, always already describes the perception of phenomena by the mind of an observer.","support":[{"end":197,"quote":"In philosophy, always already describes the perception of phenomena by the mind of an observer.","source_id":"wikipedia.article.always-already","source_sha256":"20bb933878816ca3af1c3f5200cc1367bcf67edf68f7685a3b74d8042a9a09ba","start":102}],"target_id":"concept.wikipedia.always-already","target_kind":"node","target_sha256":"248ee5849cf033d38f091f8653a8d209618913905fb77962e6ac59d2abf31e8c"}],"concept.wikipedia.amalgamation-property":[{"id":"assertion.concept.wikipedia.amalgamation-property","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amalgamation property as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amalgamation property\", CC BY-SA 4.0) states: In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","support":[{"end":351,"quote":"In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","source_id":"wikipedia.article.amalgamation-property","source_sha256":"b6af461ad87591a648d4217b17d9784ecb66cd0d7dd671867fc240d39e07cae9","start":109}],"target_id":"concept.wikipedia.amalgamation-property","target_kind":"node","target_sha256":"4ed84e8a399c260d8b05babef5af3add6f5033952251bd5fdd30d0647bd7644b"}],"concept.wikipedia.ambient-isotopy":[{"id":"assertion.concept.wikipedia.ambient-isotopy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambient isotopy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambient isotopy\", CC BY-SA 4.0) states: In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","support":[{"end":313,"quote":"In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","source_id":"wikipedia.article.ambient-isotopy","source_sha256":"919660f17c111ecc803c3d2078a8ccdc6fdb3e5d07eb1e96936642c3bc007c3e","start":102}],"target_id":"concept.wikipedia.ambient-isotopy","target_kind":"node","target_sha256":"6164fb917fed71bb68f8b45e3e6d0b59f323ae57f0f35e2c3919d0360161984f"}],"concept.wikipedia.ambient-space-mathematics":[{"id":"assertion.concept.wikipedia.ambient-space-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambient space (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambient space (mathematics)\", CC BY-SA 4.0) states: In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","support":[{"end":260,"quote":"In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","source_id":"wikipedia.article.ambient-space-mathematics","source_sha256":"1b4ef100c66f07005609a701536394262698876f8f93ec018ea5efeb975402b6","start":114}],"target_id":"concept.wikipedia.ambient-space-mathematics","target_kind":"node","target_sha256":"f576b370297127bb4840d79d68a3521c538453a764257a6f854ba81051b333a9"}],"concept.wikipedia.ambiguity":[{"id":"assertion.concept.wikipedia.ambiguity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambiguity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambiguity\", CC BY-SA 4.0) states: Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","support":[{"end":256,"quote":"Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","source_id":"wikipedia.article.ambiguity","source_sha256":"1015a00212c82572fb57899340a6c5d8bcfa5bb43feaad45a2db78d3709a791e","start":92}],"target_id":"concept.wikipedia.ambiguity","target_kind":"node","target_sha256":"4d0829996bd8501c950980cef880606e7d02af5e13b2795be7a3ca1b67054b84"}],"concept.wikipedia.ambiguity-effect":[{"id":"assertion.concept.wikipedia.ambiguity-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ambiguity effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ambiguity effect\", CC BY-SA 4.0) states: The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \"ambiguity\".","support":[{"end":225,"quote":"The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \\\"ambiguity\\\".","source_id":"wikipedia.article.ambiguity-effect","source_sha256":"927a75525786d9809517fa3de91185a3a5384d765e6a3b959dfbfc0847b5ec44","start":103}],"target_id":"concept.wikipedia.ambiguity-effect","target_kind":"node","target_sha256":"0d351b1ad47b69388bebd855ca449e59e8fea9f249b1d2472a4478d8c41278a9"}],"concept.wikipedia.ameca-robot":[{"id":"assertion.concept.wikipedia.ameca-robot","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ameca (robot) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ameca (robot)\", CC BY-SA 4.0) states: Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","support":[{"end":217,"quote":"Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","source_id":"wikipedia.article.ameca-robot","source_sha256":"00731cb34236752990197204630ff4932604a38c8eb22f1cdb70167d4584e059","start":101}],"target_id":"concept.wikipedia.ameca-robot","target_kind":"node","target_sha256":"c7677a35f80ab2974c0e8b08370165b26133cc482ee9c94f16b3b20b3eb4e624"}],"concept.wikipedia.amenable-number":[{"id":"assertion.concept.wikipedia.amenable-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amenable number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amenable number\", CC BY-SA 4.0) states: An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","support":[{"end":314,"quote":"An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","source_id":"wikipedia.article.amenable-number","source_sha256":"815b49d82ef0805634216945baaed113c4d7125cd586e99cd5518246f30da516","start":102}],"target_id":"concept.wikipedia.amenable-number","target_kind":"node","target_sha256":"cc531b230be91e4008debb432929f85d9396d16358938e7859c9f6a2f3c7c8d9"}],"concept.wikipedia.amicable-numbers":[{"id":"assertion.concept.wikipedia.amicable-numbers","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amicable numbers as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amicable numbers\", CC BY-SA 4.0) states: In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","support":[{"end":266,"quote":"In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","source_id":"wikipedia.article.amicable-numbers","source_sha256":"3523d7c418d79e17ad10d1222d525bdb9efc18fc2ff95cddc2721e2f1b5ccd55","start":100}],"target_id":"concept.wikipedia.amicable-numbers","target_kind":"node","target_sha256":"65afcd538460a5787b52de4415a99d93359dd77ed1909ad1e2f46c851fc7f024"}],"concept.wikipedia.amicable-triple":[{"id":"assertion.concept.wikipedia.amicable-triple","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amicable triple as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amicable triple\", CC BY-SA 4.0) states: In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","support":[{"end":278,"quote":"In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","source_id":"wikipedia.article.amicable-triple","source_sha256":"1f9539239dee5fafa147978fe2bc713991e7ac4828ec1743edcf4bf571cbb374","start":103}],"target_id":"concept.wikipedia.amicable-triple","target_kind":"node","target_sha256":"ffbf18183531e402ec67ee070a3f47cda8f52eb43db62637261638e8857177a7"}],"concept.wikipedia.amplifier":[{"id":"assertion.concept.wikipedia.amplifier","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amplifier as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amplifier\", CC BY-SA 4.0) states: An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","support":[{"end":252,"quote":"An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","source_id":"wikipedia.article.amplifier","source_sha256":"712a09c187e04fd0133b64fadcc7b296e91efe7b5709643225be64029d1153c6","start":93}],"target_id":"concept.wikipedia.amplifier","target_kind":"node","target_sha256":"949e0747490dbc364d287045166cf84661434de49201ab3a5510c2851f7e290a"}],"concept.wikipedia.amplitwist":[{"id":"assertion.concept.wikipedia.amplitwist","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amplitwist as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amplitwist\", CC BY-SA 4.0) states: In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","support":[{"end":271,"quote":"In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","source_id":"wikipedia.article.amplitwist","source_sha256":"769c4be276b8695ccaa7ce940bd0e5d77f26b27b8ba7c928c8543e1e9c12cb7f","start":98}],"target_id":"concept.wikipedia.amplitwist","target_kind":"node","target_sha256":"7ed9c335edf519fdef86dea7523bca013eb9709c1d4a5826f4c1da5d1fb13395"}],"concept.wikipedia.anaesthetic-machine":[{"id":"assertion.concept.wikipedia.anaesthetic-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anaesthetic machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anaesthetic machine\", CC BY-SA 4.0) states: An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","support":[{"end":358,"quote":"An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","source_id":"wikipedia.article.anaesthetic-machine","source_sha256":"da0c35974b64fdaef333c74cea7cc0e8175c805178709f3efffef010fa58a092","start":105}],"target_id":"concept.wikipedia.anaesthetic-machine","target_kind":"node","target_sha256":"1dd45bdb66d9cfd3ff574c43f0fe7eb7024d8f9a65c4391d13ce179392464c17"}],"concept.wikipedia.analog-delay-line":[{"id":"assertion.concept.wikipedia.analog-delay-line","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog delay line as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog delay line\", CC BY-SA 4.0) states: An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","support":[{"end":270,"quote":"An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","source_id":"wikipedia.article.analog-delay-line","source_sha256":"9adb90c69ded9431bd16c829c2f2cdd3d3a48b4141c95846d09039f5da6f1600","start":104}],"target_id":"concept.wikipedia.analog-delay-line","target_kind":"node","target_sha256":"1b607e8f272079e95e833cd999b9943e1eafc45e4e445c066542856334d2e61b"}],"concept.wikipedia.analog-device":[{"id":"assertion.concept.wikipedia.analog-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog device\", CC BY-SA 4.0) states: Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","support":[{"end":375,"quote":"Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","source_id":"wikipedia.article.analog-device","source_sha256":"e2f560f883edd6677678c37245689ff726406f8a249f47a3f811edb794da58ee","start":101}],"target_id":"concept.wikipedia.analog-device","target_kind":"node","target_sha256":"0471fbab5ed1ad4247408ac1700cec1d4d7baf5748912187d7c03a9c8e207804"}],"concept.wikipedia.analog-front-end":[{"id":"assertion.concept.wikipedia.analog-front-end","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog front-end as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog front-end\", CC BY-SA 4.0) states: An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","support":[{"end":589,"quote":"An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","source_id":"wikipedia.article.analog-front-end","source_sha256":"066c690e6d2d0479c5dd542a8682baa5d2f75e13c7eab750d677a6b74f0ceb8a","start":104}],"target_id":"concept.wikipedia.analog-front-end","target_kind":"node","target_sha256":"6ae904ad7a1abdd9082dce56ccd5b06d0e18239768701fd14c372c0dff9e8b0b"}],"concept.wikipedia.analog-signal-processing":[{"id":"assertion.concept.wikipedia.analog-signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog signal processing\", CC BY-SA 4.0) states: Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","support":[{"end":351,"quote":"Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","source_id":"wikipedia.article.analog-signal-processing","source_sha256":"d1d7895b1592341179ea2dd732726aec15eb59f2c03e14ea421b715a57c7740c","start":110}],"target_id":"concept.wikipedia.analog-signal-processing","target_kind":"node","target_sha256":"23137c3a762243292099379490d8b8fa52b3c5b4e4b07828ac5a26e332161e1a"}],"concept.wikipedia.analog-to-digital-converter":[{"id":"assertion.concept.wikipedia.analog-to-digital-converter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analog-to-digital converter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analog-to-digital converter\", CC BY-SA 4.0) states: In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","support":[{"end":357,"quote":"In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","source_id":"wikipedia.article.analog-to-digital-converter","source_sha256":"f59ee3072b8ea2120851eeccf7148640d2f4397a618783579284da746ba4aba7","start":112}],"target_id":"concept.wikipedia.analog-to-digital-converter","target_kind":"node","target_sha256":"8d1b25339c1e79a96c55a3d5133944bf989bcbccc8c61083589b3cfe4e0ba1ce"}],"concept.wikipedia.analogue-electronics":[{"id":"assertion.concept.wikipedia.analogue-electronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogue electronics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogue electronics\", CC BY-SA 4.0) states: Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","support":[{"end":305,"quote":"Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","source_id":"wikipedia.article.analogue-electronics","source_sha256":"9e5ead582992b2d34655be5a74604861f945f43d598d6c8323086eb9906e998a","start":107}],"target_id":"concept.wikipedia.analogue-electronics","target_kind":"node","target_sha256":"64810c69743bdadccff95f66cee87e4046ef34ad18e7972f18c9e214ce346ec9"}],"concept.wikipedia.analogy":[{"id":"assertion.concept.wikipedia.analogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogy\", CC BY-SA 4.0) states: Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","support":[{"end":241,"quote":"Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","source_id":"wikipedia.article.analogy","source_sha256":"f389735a8d535a14bd10cb492303ed779338473510a7cb8ad79ae4e1fc7ea2e6","start":93}],"target_id":"concept.wikipedia.analogy","target_kind":"node","target_sha256":"91bfb103b1424b8be41ce2f8a238acf21bd24141d7f4f7f89274c64ceea0bd8f"}],"concept.wikipedia.analogy-of-the-divided-line":[{"id":"assertion.concept.wikipedia.analogy-of-the-divided-line","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analogy of the divided line as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analogy of the divided line\", CC BY-SA 4.0) states: The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","support":[{"end":290,"quote":"The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","source_id":"wikipedia.article.analogy-of-the-divided-line","source_sha256":"630c4d66a068fa791acc7f9b5fd94ff01f741f6cb3fa35150bff0e8f8fda19cb","start":112}],"target_id":"concept.wikipedia.analogy-of-the-divided-line","target_kind":"node","target_sha256":"3c52733e14a8c8ae0590f096470185ffdfa13d99622b43d02e0583f0c88e64e4"}],"concept.wikipedia.analysis-of-competing-hypotheses":[{"id":"assertion.concept.wikipedia.analysis-of-competing-hypotheses","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analysis of competing hypotheses as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analysis of competing hypotheses\", CC BY-SA 4.0) states: The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","support":[{"end":242,"quote":"The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","source_id":"wikipedia.article.analysis-of-competing-hypotheses","source_sha256":"6fa78c7f4203b011c57a342017019fda3618bada198a1b59d1c52b2eec31f273","start":119}],"target_id":"concept.wikipedia.analysis-of-competing-hypotheses","target_kind":"node","target_sha256":"2e13c43dda84b11e5ae2cb7aaf6762336a13289a627c604c7e2a92d7436f6574"}],"concept.wikipedia.analytic-hierarchy-process":[{"id":"assertion.concept.wikipedia.analytic-hierarchy-process","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic hierarchy process as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic hierarchy process\", CC BY-SA 4.0) states: In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","support":[{"end":330,"quote":"In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","source_id":"wikipedia.article.analytic-hierarchy-process","source_sha256":"5ea2c91d1453f637b320386340b34a74f9854d6a1373bc3597d6cdbfe260d4dd","start":113}],"target_id":"concept.wikipedia.analytic-hierarchy-process","target_kind":"node","target_sha256":"58114bf8e35a3158c39273a08cce7adf0a17824520901f67ccbc3d9998385331"}],"concept.wikipedia.analytic-proof":[{"id":"assertion.concept.wikipedia.analytic-proof","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic proof as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic proof\", CC BY-SA 4.0) states: In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","support":[{"end":294,"quote":"In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","source_id":"wikipedia.article.analytic-proof","source_sha256":"9a347e1328b219141256af1045728668584c03dfe7dc3c899467180243b329ee","start":101}],"target_id":"concept.wikipedia.analytic-proof","target_kind":"node","target_sha256":"3e14a961585f524c99d1d5180ea23edd0cf60b7428c1f7a6606a9823be5c3da7"}],"concept.wikipedia.analytic-reasoning":[{"id":"assertion.concept.wikipedia.analytic-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic reasoning\", CC BY-SA 4.0) states: Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","support":[{"end":297,"quote":"Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","source_id":"wikipedia.article.analytic-reasoning","source_sha256":"1ab225adb5533019f249857075504d1dcb96392fabdd5e5e066d68327278183c","start":105}],"target_id":"concept.wikipedia.analytic-reasoning","target_kind":"node","target_sha256":"aa9891dad3f12f633e3e588a9ea2b8f50ae3c546d8f25d7d5cdade70fa1fb0a7"}],"concept.wikipedia.analytic-semigroup":[{"id":"assertion.concept.wikipedia.analytic-semigroup","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic semigroup as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic semigroup\", CC BY-SA 4.0) states: In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","support":[{"end":196,"quote":"In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","source_id":"wikipedia.article.analytic-semigroup","source_sha256":"c8f518ceba69bb839b48a1cae55f14acf8e1e083ae7a2f522fbec41d75aa956b","start":106}],"target_id":"concept.wikipedia.analytic-semigroup","target_kind":"node","target_sha256":"c5107cadfde4523814a85585072b107e29ba2246ec076d26bd73129efd2885fc"}],"concept.wikipedia.analytic-signal":[{"id":"assertion.concept.wikipedia.analytic-signal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic signal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic signal\", CC BY-SA 4.0) states: In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","support":[{"end":229,"quote":"In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","source_id":"wikipedia.article.analytic-signal","source_sha256":"19879fee641c7aebe6bb8c339360f3b91a483285d2c44f11d37b409b45bde206","start":101}],"target_id":"concept.wikipedia.analytic-signal","target_kind":"node","target_sha256":"b25f8196a73b92107c4dac967cf7e503110c6566a7500760e71db80dcc4dc730"}],"concept.wikipedia.analytic-synthetic-distinction":[{"id":"assertion.concept.wikipedia.analytic-synthetic-distinction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic–synthetic distinction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic–synthetic distinction\", CC BY-SA 4.0) states: The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","support":[{"end":392,"quote":"The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","source_id":"wikipedia.article.analytic-synthetic-distinction","source_sha256":"4a03bd563175fd700caace56ca570a79942fa7e0c86bd77a72f57f1adaed57f3","start":117}],"target_id":"concept.wikipedia.analytic-synthetic-distinction","target_kind":"node","target_sha256":"30cee2038897dd0f7a5e20a4acbef882fe9caf833dec4cf0ab2f6c21950f2cee"}],"concept.wikipedia.analytical-chemistry":[{"id":"assertion.concept.wikipedia.analytical-chemistry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytical chemistry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytical chemistry\", CC BY-SA 4.0) states: Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","support":[{"end":334,"quote":"Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","source_id":"wikipedia.article.analytical-chemistry","source_sha256":"0186d5558c6b6a85f0870e7c56cc8e3a99de0d1a87d4a6689079e7e8e71c31c1","start":104}],"target_id":"concept.wikipedia.analytical-chemistry","target_kind":"node","target_sha256":"af458c9800b0f46a891435dd8385af2190a0954b9126f1aebd41a15ab87db93d"}],"concept.wikipedia.analytical-hierarchy":[{"id":"assertion.concept.wikipedia.analytical-hierarchy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytical hierarchy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytical hierarchy\", CC BY-SA 4.0) states: In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","support":[{"end":227,"quote":"In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","source_id":"wikipedia.article.analytical-hierarchy","source_sha256":"e7eadb010362c40446c3bbce6b270d9f168561beff5022895e778b3438e85025","start":106}],"target_id":"concept.wikipedia.analytical-hierarchy","target_kind":"node","target_sha256":"9911dcbfbf84bab1bc4de76325e569f64d1c134c24a41b6f4669492719d42b8b"}],"concept.wikipedia.anamorphism":[{"id":"assertion.concept.wikipedia.anamorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anamorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anamorphism\", CC BY-SA 4.0) states: In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","support":[{"end":241,"quote":"In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","source_id":"wikipedia.article.anamorphism","source_sha256":"fdca7b5d0d3f962a9829189b84c7e7d9a45e95505879a6273b4531783e666a01","start":98}],"target_id":"concept.wikipedia.anamorphism","target_kind":"node","target_sha256":"541167992b6d285216b9d9e42e7224e29d09565d69e570c2d7b515a604536871"}],"concept.wikipedia.anchor-channel":[{"id":"assertion.concept.wikipedia.anchor-channel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anchor channel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anchor channel\", CC BY-SA 4.0) states: Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","support":[{"end":292,"quote":"Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","source_id":"wikipedia.article.anchor-channel","source_sha256":"682308d680e4b18d5ac036adeac4e3b34b2a09726351c5bf27c121b12ad94540","start":102}],"target_id":"concept.wikipedia.anchor-channel","target_kind":"node","target_sha256":"2d56cda7a1faed5d1c3c57ea0b04dd76af10ec070aa3fce10701eae90b6782be"}],"concept.wikipedia.anchoring-effect":[{"id":"assertion.concept.wikipedia.anchoring-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anchoring effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anchoring effect\", CC BY-SA 4.0) states: The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \"anchor\" which can be completely irrelevant.","support":[{"end":286,"quote":"The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \\\"anchor\\\" which can be completely irrelevant.","source_id":"wikipedia.article.anchoring-effect","source_sha256":"94482ae9976df9d87e1d41de5ca50b29dcffef3a6e29ccb4ec3c97566905d0ec","start":102}],"target_id":"concept.wikipedia.anchoring-effect","target_kind":"node","target_sha256":"609678b87c25fa6770cd54c2190f4f2a176ae13d441e0c8b1594bf6539a864f0"}],"concept.wikipedia.anderson-acceleration":[{"id":"assertion.concept.wikipedia.anderson-acceleration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anderson acceleration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anderson acceleration\", CC BY-SA 4.0) states: In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","support":[{"end":260,"quote":"In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","source_id":"wikipedia.article.anderson-acceleration","source_sha256":"e371757a02107ba74d6652da0fc07e7c57ca36ef4c7df029edc8258f86dd999c","start":109}],"target_id":"concept.wikipedia.anderson-acceleration","target_kind":"node","target_sha256":"a0df60b5de2fab124c53152d415acef16ca2deeb63137da892bbe2cd1d17da88"}],"concept.wikipedia.andr-quillen-cohomology":[{"id":"assertion.concept.wikipedia.andr-quillen-cohomology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"André–Quillen cohomology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"André–Quillen cohomology\", CC BY-SA 4.0) states: In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","support":[{"end":288,"quote":"In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","source_id":"wikipedia.article.andr-quillen-cohomology","source_sha256":"4ea1372cc27e9abe9fad583236a028a4d027d8a8c4cd8680b1b3132c3f119c38","start":112}],"target_id":"concept.wikipedia.andr-quillen-cohomology","target_kind":"node","target_sha256":"ac86cf3bf3bd235bce3d35024d02443269af85270ffc30a5c37b624b7e663fdf"}],"concept.wikipedia.android-epistemology":[{"id":"assertion.concept.wikipedia.android-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Android epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Android epistemology\", CC BY-SA 4.0) states: Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","support":[{"end":316,"quote":"Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","source_id":"wikipedia.article.android-epistemology","source_sha256":"b381a32981867a92f8a32be9777aa0d3aab93383c7117e7946eafb495b401675","start":107}],"target_id":"concept.wikipedia.android-epistemology","target_kind":"node","target_sha256":"32671c35ecc12b7c9e7f5914099302a7f7ee0bf6e31eaecdacdffaddd6ee7e58"}],"concept.wikipedia.andronov-pontryagin-criterion":[{"id":"assertion.concept.wikipedia.andronov-pontryagin-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Andronov–Pontryagin criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Andronov–Pontryagin criterion\", CC BY-SA 4.0) states: The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","support":[{"end":243,"quote":"The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","source_id":"wikipedia.article.andronov-pontryagin-criterion","source_sha256":"b4d89f16fe3258d128db2f551347ec7d4e8f361bd3f95a3ac2f422f684275b73","start":117}],"target_id":"concept.wikipedia.andronov-pontryagin-criterion","target_kind":"node","target_sha256":"5104004190bb1054992fa60a63e84b05c99e2e3a1ff1a3d212c0dde15513af44"}],"concept.wikipedia.anecdotal-evidence":[{"id":"assertion.concept.wikipedia.anecdotal-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anecdotal evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anecdotal evidence\", CC BY-SA 4.0) states: Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","support":[{"end":274,"quote":"Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","source_id":"wikipedia.article.anecdotal-evidence","source_sha256":"4e27c363d7a14b13e58393b3fd00670f9c32f89521bb586576f251a650ea68f9","start":104}],"target_id":"concept.wikipedia.anecdotal-evidence","target_kind":"node","target_sha256":"75ae30c724cda7bcf0883e7ececab7b3f1592ff7ea7111ef12eefdb89e7b558d"}],"concept.wikipedia.anfinsen-s-dogma":[{"id":"assertion.concept.wikipedia.anfinsen-s-dogma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anfinsen's dogma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anfinsen's dogma\", CC BY-SA 4.0) states: Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","support":[{"end":201,"quote":"Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","source_id":"wikipedia.article.anfinsen-s-dogma","source_sha256":"e146e2682491a34170cb7b4289c8822fd3e73e8cf31071f14ed219fa8b40830b","start":103}],"target_id":"concept.wikipedia.anfinsen-s-dogma","target_kind":"node","target_sha256":"582627d04e74788a9931b8a34b04ab7c0492effab9632cce12acb2fca22be7a7"}],"concept.wikipedia.angelescu-polynomials":[{"id":"assertion.concept.wikipedia.angelescu-polynomials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angelescu polynomials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angelescu polynomials\", CC BY-SA 4.0) states: In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","support":[{"end":253,"quote":"In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","source_id":"wikipedia.article.angelescu-polynomials","source_sha256":"21d416ee38be2ad09d0a2a8afba3ae3f83f472140d1b741d1c9dacbd7c95dc7e","start":109}],"target_id":"concept.wikipedia.angelescu-polynomials","target_kind":"node","target_sha256":"146efc8d84cfb0c4ad03eb4b2c207aca0e8252d8d6a8910d182ae411ace56755"}],"concept.wikipedia.angle-bracket-fastener":[{"id":"assertion.concept.wikipedia.angle-bracket-fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angle bracket (fastener) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angle bracket (fastener)\", CC BY-SA 4.0) states: An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","support":[{"end":237,"quote":"An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","source_id":"wikipedia.article.angle-bracket-fastener","source_sha256":"df2485c01e79e5ae5f99dba0865ce95742487d3477c5c011a4b0c4fb1759cbca","start":112}],"target_id":"concept.wikipedia.angle-bracket-fastener","target_kind":"node","target_sha256":"8777b3eb58b7e1ecbdc653085e5a7ed3471d10fc3a1fd3bfbfe6204077016832"}],"concept.wikipedia.angle-of-arrival":[{"id":"assertion.concept.wikipedia.angle-of-arrival","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angle of arrival as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angle of arrival\", CC BY-SA 4.0) states: The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","support":[{"end":227,"quote":"The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","source_id":"wikipedia.article.angle-of-arrival","source_sha256":"31cc2ec242b6e2bee264d447663c795c23b4fcbf3a36eafaa0cd79322977a2e0","start":103}],"target_id":"concept.wikipedia.angle-of-arrival","target_kind":"node","target_sha256":"ce58f418cbe8c098b94efdc1fe08102147939045164005bdc0952219eeaf9da3"}],"concept.wikipedia.angular-rate-sensor":[{"id":"assertion.concept.wikipedia.angular-rate-sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Angular rate sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Angular rate sensor\", CC BY-SA 4.0) states: Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","support":[{"end":230,"quote":"Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","source_id":"wikipedia.article.angular-rate-sensor","source_sha256":"ee60c4cc25b5f1fb6c81378c26f53433b7a219bf2de064be044ec2cc2fadec3c","start":107}],"target_id":"concept.wikipedia.angular-rate-sensor","target_kind":"node","target_sha256":"3b1c31f665afe35bb4ce3fa67a3955e4b444cabe4d9a7ef52e327c91ea7ef746"}],"concept.wikipedia.annealing-materials-science":[{"id":"assertion.concept.wikipedia.annealing-materials-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Annealing (materials science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Annealing (materials science)\", CC BY-SA 4.0) states: In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","support":[{"end":331,"quote":"In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","source_id":"wikipedia.article.annealing-materials-science","source_sha256":"d910aa86454897794fc8bc6fdcb3d20a05171c8dcb8b310ab7a61d895cfdde59","start":116}],"target_id":"concept.wikipedia.annealing-materials-science","target_kind":"node","target_sha256":"986a987dc893e86da58e26abe35f39863cf3290b820371154b0fc32b91af3535"}],"concept.wikipedia.anosov-diffeomorphism":[{"id":"assertion.concept.wikipedia.anosov-diffeomorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anosov diffeomorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anosov diffeomorphism\", CC BY-SA 4.0) states: In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \"expansion\" and \"contraction\".","support":[{"end":360,"quote":"In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \\\"expansion\\\" and \\\"contraction\\\".","source_id":"wikipedia.article.anosov-diffeomorphism","source_sha256":"ed936108feb42c21f87572c9df9db167260374be938d2c12b36215f89a7ca420","start":108}],"target_id":"concept.wikipedia.anosov-diffeomorphism","target_kind":"node","target_sha256":"3683614e9146c49551d1b2ea8bd4fd7251d38566782f01dbf46414d5c2f04536"}],"concept.wikipedia.anthrobotics":[{"id":"assertion.concept.wikipedia.anthrobotics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anthrobotics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anthrobotics\", CC BY-SA 4.0) states: Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","support":[{"end":212,"quote":"Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","source_id":"wikipedia.article.anthrobotics","source_sha256":"1b83c43f15874e9c2e8900648811b637eefca9693328c81b95227529a9e06dbc","start":99}],"target_id":"concept.wikipedia.anthrobotics","target_kind":"node","target_sha256":"39668faa372be218dc0442a1e51e05aad1576c2b25b225bdf6330eadcca54920"}],"concept.wikipedia.anthropic-principle":[{"id":"assertion.concept.wikipedia.anthropic-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anthropic principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anthropic principle\", CC BY-SA 4.0) states: In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","support":[{"end":426,"quote":"In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","source_id":"wikipedia.article.anthropic-principle","source_sha256":"1f33ad20a907cc161060e4b63bc986b5b5ddacc0004fab73621b5e5021a806ae","start":103}],"target_id":"concept.wikipedia.anthropic-principle","target_kind":"node","target_sha256":"2e5fe82808a44fa20ff66344a19be9566390dacc1c9ba181ac222cf81284cb2b"}],"concept.wikipedia.anti-twister-mechanism":[{"id":"assertion.concept.wikipedia.anti-twister-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anti-twister mechanism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anti-twister mechanism\", CC BY-SA 4.0) states: The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","support":[{"end":319,"quote":"The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","source_id":"wikipedia.article.anti-twister-mechanism","source_sha256":"73fbb2b2660c409c01cf8115d3cebf866b42b74feec1b9fd5a81bb5e3d97a595","start":108}],"target_id":"concept.wikipedia.anti-twister-mechanism","target_kind":"node","target_sha256":"76c76fde2537a36a922d4579e4c70df2880aae74efe01af8ecebe2b5c58794b8"}],"concept.wikipedia.anticausal-system":[{"id":"assertion.concept.wikipedia.anticausal-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anticausal system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anticausal system\", CC BY-SA 4.0) states: In systems theory, an anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","support":[{"end":246,"quote":"In systems theory, an  anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","source_id":"wikipedia.article.anticausal-system","source_sha256":"ffe588603becac5aa32087c26ba3a5190380a581062531d364fff9a650c2d912","start":105}],"target_id":"concept.wikipedia.anticausal-system","target_kind":"node","target_sha256":"5b5c656d9af5afc6a43820d484fd38b7846cd568cd81baff460045376c528113"}],"concept.wikipedia.antieigenvalue-theory":[{"id":"assertion.concept.wikipedia.antieigenvalue-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antieigenvalue theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antieigenvalue theory\", CC BY-SA 4.0) states: In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","support":[{"end":205,"quote":"In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","source_id":"wikipedia.article.antieigenvalue-theory","source_sha256":"5c9152bf8bd1b1f282aa9bd32dbe00137090172b39d7785e1f5544d5976fd92b","start":109}],"target_id":"concept.wikipedia.antieigenvalue-theory","target_kind":"node","target_sha256":"3a1a96b28154cc63958b8b357a427a1274f1f2179a6fcb0852351bd48e7c71de"}],"concept.wikipedia.antifragility":[{"id":"assertion.concept.wikipedia.antifragility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antifragility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antifragility\", CC BY-SA 4.0) states: Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","support":[{"end":279,"quote":"Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","source_id":"wikipedia.article.antifragility","source_sha256":"62e33aa735c1fb315973d40f18410a60765aafbd886dcc70be1ecf1c993d428d","start":101}],"target_id":"concept.wikipedia.antifragility","target_kind":"node","target_sha256":"6dad967819663d717d801e01c83f50e950f5f624ae3be86c7c7cb53cf127ab9e"}],"concept.wikipedia.antiholomorphic-function":[{"id":"assertion.concept.wikipedia.antiholomorphic-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiholomorphic function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiholomorphic function\", CC BY-SA 4.0) states: In mathematics, antiholomorphic functions (also called antianalytic functions) are a family of functions closely related to but distinct from holomorphic functions.","support":[{"end":276,"quote":"In mathematics,  antiholomorphic functions (also called antianalytic functions) are a family of  functions closely related to but distinct from holomorphic functions.","source_id":"wikipedia.article.antiholomorphic-function","source_sha256":"062e1f01cb489fc5e309fdc30edd7f572a2df151c8578432047c3c3935529561","start":110}],"target_id":"concept.wikipedia.antiholomorphic-function","target_kind":"node","target_sha256":"e312d450d008534d6cffa8ce2385d2dfd444ff808c2fc9ebb995d644ba0b4266"}],"concept.wikipedia.antiisomorphism":[{"id":"assertion.concept.wikipedia.antiisomorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiisomorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiisomorphism\", CC BY-SA 4.0) states: In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","support":[{"end":312,"quote":"In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","source_id":"wikipedia.article.antiisomorphism","source_sha256":"acc6ae5350019c48844c8d9d9368d22c2cce8fdee71eaf19be63c5d02af4f94c","start":102}],"target_id":"concept.wikipedia.antiisomorphism","target_kind":"node","target_sha256":"4ecdadfedb0aa9de9d276823a76349f8319b81aac2050ffaf723cbe3f846d3af"}],"concept.wikipedia.antimatroid":[{"id":"assertion.concept.wikipedia.antimatroid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antimatroid as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antimatroid\", CC BY-SA 4.0) states: In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","support":[{"end":330,"quote":"In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","source_id":"wikipedia.article.antimatroid","source_sha256":"b834c97500753a56d77c537c5bb27c0c777d5bd5b19eb1ae01a9f91fef7f2e05","start":97}],"target_id":"concept.wikipedia.antimatroid","target_kind":"node","target_sha256":"d901b7970feba87d9d5e134f3d83095fe55169b6e78d8c2bdfcd3e1afd51e963"}],"concept.wikipedia.antinomy":[{"id":"assertion.concept.wikipedia.antinomy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antinomy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antinomy\", CC BY-SA 4.0) states: In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","support":[{"end":257,"quote":"In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","source_id":"wikipedia.article.antinomy","source_sha256":"08b4918b55b56bbd6c1be2ea8c5a81a46a4194ad8667ddfe9e5cbb6608d77561","start":92}],"target_id":"concept.wikipedia.antinomy","target_kind":"node","target_sha256":"52a926824df7b0dfdcc9339d2af10bf54919d99a058d4e96dc1c6cadaf2b935c"}],"concept.wikipedia.antipedagogy":[{"id":"assertion.concept.wikipedia.antipedagogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antipedagogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antipedagogy\", CC BY-SA 4.0) states: Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","support":[{"end":430,"quote":"Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","source_id":"wikipedia.article.antipedagogy","source_sha256":"0c30118ccd965943772a027caaf5882b1d0c719ad0db7ce2a406eda50902cc4e","start":100}],"target_id":"concept.wikipedia.antipedagogy","target_kind":"node","target_sha256":"f712ecc286faa3abbd9b2c8e406c1ef5b2c92547430800394a3b256598db8cdc"}],"concept.wikipedia.antipositivism":[{"id":"assertion.concept.wikipedia.antipositivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antipositivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antipositivism\", CC BY-SA 4.0) states: In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","support":[{"end":415,"quote":"In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","source_id":"wikipedia.article.antipositivism","source_sha256":"1ea5f782e64aae3e073533c8436d27f9315435f41365bf247783bf1f5c2dde77","start":101}],"target_id":"concept.wikipedia.antipositivism","target_kind":"node","target_sha256":"ec42fe0a98a196420b369a932a07d2acde25a7cb0ad04bd0779727dfae6dd8ee"}],"concept.wikipedia.antireductionism":[{"id":"assertion.concept.wikipedia.antireductionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antireductionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antireductionism\", CC BY-SA 4.0) states: Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","support":[{"end":341,"quote":"Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","source_id":"wikipedia.article.antireductionism","source_sha256":"110a104aee502b4b0bc2db858caca1cc1d694d08c067b40c1e1e20e0a4a6942e","start":103}],"target_id":"concept.wikipedia.antireductionism","target_kind":"node","target_sha256":"fc17ebeb05ba0a2e7d7b2e9e359c751e7bc5dbde38abf5f730a52be9a41ee99f"}],"concept.wikipedia.antiscience":[{"id":"assertion.concept.wikipedia.antiscience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antiscience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antiscience\", CC BY-SA 4.0) states: Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","support":[{"end":230,"quote":"Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","source_id":"wikipedia.article.antiscience","source_sha256":"2e4b2df04057ee783eaf901891faa63a539ef875e910e455df82ea0a51607ea0","start":98}],"target_id":"concept.wikipedia.antiscience","target_kind":"node","target_sha256":"fed84c7e7492ff346190c3c9b81b6f6202823515dbb791ca7bc9bddb21871266"}],"concept.wikipedia.antoine-s-necklace":[{"id":"assertion.concept.wikipedia.antoine-s-necklace","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Antoine's necklace as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Antoine's necklace\", CC BY-SA 4.0) states: In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","support":[{"end":261,"quote":"In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","source_id":"wikipedia.article.antoine-s-necklace","source_sha256":"29a4da7ca5747558999d1c4cfea5fc8adff9c51d037b118016f2bf1cc76a9684","start":106}],"target_id":"concept.wikipedia.antoine-s-necklace","target_kind":"node","target_sha256":"bf1dd69cd376bacb922c8f2df5d7e34b3bee69c5b71f9efd8aa5228e106c5df3"}],"concept.wikipedia.apodicticity":[{"id":"assertion.concept.wikipedia.apodicticity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apodicticity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apodicticity\", CC BY-SA 4.0) states: \"Apodictic\", also spelled \"apodeictic\" (Ancient Greek: ἀποδεικτικός, \"capable of demonstration\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","support":[{"end":341,"quote":"\\\"Apodictic\\\", also spelled \\\"apodeictic\\\" (Ancient Greek: ἀποδεικτικός, \\\"capable of demonstration\\\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","source_id":"wikipedia.article.apodicticity","source_sha256":"f7a64e53ee6fa4855d9d7bab4853a6bed029ea1f8ab641d801d8cc7b68e1e5d7","start":99}],"target_id":"concept.wikipedia.apodicticity","target_kind":"node","target_sha256":"e32b3080c80a4a47f452882a8ce84603a6555d91e5b484a2d21f6c8457f4c98a"}],"concept.wikipedia.apodization":[{"id":"assertion.concept.wikipedia.apodization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apodization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apodization\", CC BY-SA 4.0) states: In signal processing, apodization (from Greek \"removing the foot\") is the modification of the shape of a mathematical function.","support":[{"end":227,"quote":"In signal processing, apodization (from Greek \\\"removing the foot\\\") is the modification of the shape of a mathematical function.","source_id":"wikipedia.article.apodization","source_sha256":"7f0ab39f33d29e7ce845ede62b993dfee08a5d0226b0bd7e348f55ab3af50df9","start":98}],"target_id":"concept.wikipedia.apodization","target_kind":"node","target_sha256":"5e08cf857d8bc1d5cc97a29d9f8741a73c6a2276ab88f7a417c01ae683078276"}],"concept.wikipedia.apoha":[{"id":"assertion.concept.wikipedia.apoha","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apoha as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apoha\", CC BY-SA 4.0) states: Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","support":[{"end":253,"quote":"Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","source_id":"wikipedia.article.apoha","source_sha256":"16c3154c948ec588d614b0e22471e760aaafab015088b6b21d57123ae6201714","start":93}],"target_id":"concept.wikipedia.apoha","target_kind":"node","target_sha256":"037fea7ef31acf2aae1a486232b870efdb58254e2d0c66692d5d46e81861ab6e"}],"concept.wikipedia.apophantic":[{"id":"assertion.concept.wikipedia.apophantic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apophantic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apophantic\", CC BY-SA 4.0) states: In logic, Apophantic (Greek: ἀποφαντικός, \"declaratory\", from ἀποφαίνειν apophainein, \"to show, to make known\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","support":[{"end":366,"quote":"In logic, Apophantic (Greek: ἀποφαντικός, \\\"declaratory\\\", from ἀποφαίνειν apophainein, \\\"to show, to make known\\\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","source_id":"wikipedia.article.apophantic","source_sha256":"ac989fe4e16a895df6fca30213c7a35e74c6136500b26f7ab9134793a7968f88","start":98}],"target_id":"concept.wikipedia.apophantic","target_kind":"node","target_sha256":"f614624d5814d98ccddb5842db747148a0d21833725cd2f20acd3e5f668d7dac"}],"concept.wikipedia.apophenia":[{"id":"assertion.concept.wikipedia.apophenia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apophenia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apophenia\", CC BY-SA 4.0) states: Apophenia () is the tendency to perceive meaningful connections between unrelated things.","support":[{"end":184,"quote":"Apophenia () is the tendency to perceive meaningful connections between unrelated things.","source_id":"wikipedia.article.apophenia","source_sha256":"3ba090c7100adc5f39192f5975c2b22413eb369194bf6665074ba0dc9763984a","start":95}],"target_id":"concept.wikipedia.apophenia","target_kind":"node","target_sha256":"258606f9b2cc88c7054217415fd2ddd515789457dbb5389cc3203e4a1036c3fc"}],"concept.wikipedia.aporia":[{"id":"assertion.concept.wikipedia.aporia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aporia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aporia\", CC BY-SA 4.0) states: In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\"lacking passage\", also: \"impasse\", \"difficulty in passage\", \"puzzlement\"') is a conundrum or state of puzzlement.","support":[{"end":290,"quote":"In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\\\"lacking passage\\\", also: \\\"impasse\\\", \\\"difficulty in passage\\\", \\\"puzzlement\\\"') is a conundrum or state of puzzlement.","source_id":"wikipedia.article.aporia","source_sha256":"fbdb97b58d3097cec8b0d75aa10ad02470d83dc285f3876f00b1411d22bb20be","start":92}],"target_id":"concept.wikipedia.aporia","target_kind":"node","target_sha256":"af05f8813557c5a660471279783f9e3fb2ff208d19f56bab45edb8fc9b505d32"}],"concept.wikipedia.appeal-to-the-law":[{"id":"assertion.concept.wikipedia.appeal-to-the-law","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appeal to the law as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appeal to the law\", CC BY-SA 4.0) states: An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","support":[{"end":328,"quote":"An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","source_id":"wikipedia.article.appeal-to-the-law","source_sha256":"0d698ed50264133a4bd6fd20e01a11e566871bfdb79f82721d08a65ca0c16662","start":105}],"target_id":"concept.wikipedia.appeal-to-the-law","target_kind":"node","target_sha256":"ffde03712c734b8ed06d5f33db559df19f9631527e580bbd56cb2bf408ca81c7"}],"concept.wikipedia.appeal-to-the-stone":[{"id":"assertion.concept.wikipedia.appeal-to-the-stone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appeal to the stone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appeal to the stone\", CC BY-SA 4.0) states: Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","support":[{"end":232,"quote":"Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","source_id":"wikipedia.article.appeal-to-the-stone","source_sha256":"3b9b2ed9a6891b6b4e83a59d1f00a976f13a56f1f866e811c901f27788d4780f","start":106}],"target_id":"concept.wikipedia.appeal-to-the-stone","target_kind":"node","target_sha256":"d79a024d7da55b2569fc4083a391e9ead7f6e16dad390baea5eaa0f84bb2ec2b"}],"concept.wikipedia.apperception":[{"id":"assertion.concept.wikipedia.apperception","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apperception as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apperception\", CC BY-SA 4.0) states: Apperception (from the Latin ad-, \"to, toward\" and percipere, \"to perceive, gain, secure, learn, or feel\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","support":[{"end":326,"quote":"Apperception (from the Latin ad-, \\\"to, toward\\\" and percipere, \\\"to perceive, gain, secure, learn, or feel\\\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","source_id":"wikipedia.article.apperception","source_sha256":"9c4608398e8efdf21ae20ca0a3cee905d2c88a4cd28629a4eab47911c84c4323","start":99}],"target_id":"concept.wikipedia.apperception","target_kind":"node","target_sha256":"e73d87d53dc518fe16b78fb1a3f617fb2f7af7f53e4e6175b947d21aad7eb905"}],"concept.wikipedia.application-layer-framing":[{"id":"assertion.concept.wikipedia.application-layer-framing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Application-layer framing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Application-layer framing\", CC BY-SA 4.0) states: Application-layer framing or application-level framing (ALF) is a method of allowing an application to use its semantics for the design of its network protocols.","support":[{"end":276,"quote":"Application-layer framing or application-level framing (ALF)  is a method of allowing  an application to use its semantics for the design of its network protocols.","source_id":"wikipedia.article.application-layer-framing","source_sha256":"a38df14053459ccdff415bb75e3e4d978666802862efe56baf82855397477c7d","start":113}],"target_id":"concept.wikipedia.application-layer-framing","target_kind":"node","target_sha256":"a838f2460345fed18f498e65d3234818af120cc3b5b6d7db17376d7a315a4071"}],"concept.wikipedia.applied-epistemology":[{"id":"assertion.concept.wikipedia.applied-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied epistemology\", CC BY-SA 4.0) states: Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","support":[{"end":259,"quote":"Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","source_id":"wikipedia.article.applied-epistemology","source_sha256":"ee734d5bfbb92aac8c3dcaaa0fe66ed896554869e114cf24a2e136d7de8652f0","start":108}],"target_id":"concept.wikipedia.applied-epistemology","target_kind":"node","target_sha256":"e6fe525c977d862124b72a6a8f1fbb7509d2cce5750b435aeb05944e8998191b"}],"concept.wikipedia.applied-physics":[{"id":"assertion.concept.wikipedia.applied-physics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied physics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied physics\", CC BY-SA 4.0) states: Applied physics is the application of physics to solve scientific or engineering problems.","support":[{"end":192,"quote":"Applied physics is the application of physics to solve scientific or engineering problems.","source_id":"wikipedia.article.applied-physics","source_sha256":"5ee3c3909630d4db10f4eaff4816b615c1e29162b539b06b45b45c053e740864","start":102}],"target_id":"concept.wikipedia.applied-physics","target_kind":"node","target_sha256":"1edc393af439d05349facaef62dea9a6252ccdcb8b33002d7e41f5b0f3db9bec"}],"concept.wikipedia.appropriation-of-knowledge":[{"id":"assertion.concept.wikipedia.appropriation-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appropriation of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appropriation of knowledge\", CC BY-SA 4.0) states: Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","support":[{"end":261,"quote":"Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","source_id":"wikipedia.article.appropriation-of-knowledge","source_sha256":"61e806bbd97e9aed4f4018b0fa5d5cc8ac0d2c84c5b25a3da1a9b821488b1047","start":114}],"target_id":"concept.wikipedia.appropriation-of-knowledge","target_kind":"node","target_sha256":"c6556c45d50cf8bbacb0cfac6bf406f707a21a70fece3e6f22f0f51767005ba0"}],"concept.wikipedia.approximate-fibration":[{"id":"assertion.concept.wikipedia.approximate-fibration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate fibration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate fibration\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","support":[{"end":270,"quote":"In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","source_id":"wikipedia.article.approximate-fibration","source_sha256":"6c9b8ad6393aeacabb7d438cc304e130c98e8fc32c275ffe0bb70bee12c57fdc","start":109}],"target_id":"concept.wikipedia.approximate-fibration","target_kind":"node","target_sha256":"c1353d4c9910fce27f4c2efb13e5e731aa29ed81c42c26928e45ae9d5bb047dd"}],"concept.wikipedia.approximate-group":[{"id":"assertion.concept.wikipedia.approximate-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate group\", CC BY-SA 4.0) states: In mathematics, an approximate group is a subset of a group which behaves like a subgroup \"up to a constant error\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","support":[{"end":310,"quote":"In mathematics, an approximate group is a subset of a group which behaves like a subgroup \\\"up to a constant error\\\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","source_id":"wikipedia.article.approximate-group","source_sha256":"2b64a30a2b67d13bdc2541009ddd72305517d3f0c9b05df35f38a48ba777bc1c","start":105}],"target_id":"concept.wikipedia.approximate-group","target_kind":"node","target_sha256":"733c8a20848248578cf20c2f44bd833ad9e875d7da138156e040e6cd0ad17b41"}],"concept.wikipedia.approximate-limit":[{"id":"assertion.concept.wikipedia.approximate-limit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate limit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate limit\", CC BY-SA 4.0) states: In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","support":[{"end":237,"quote":"In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","source_id":"wikipedia.article.approximate-limit","source_sha256":"a0b2e7164954224113bfc7a597b011bc4382827f24264ec14892fed374d259aa","start":105}],"target_id":"concept.wikipedia.approximate-limit","target_kind":"node","target_sha256":"f72925fb987dc0feb3e3a73255d649b13a0f4d2c560c6c1bba42d111d8f21160"}],"concept.wikipedia.approximate-measures":[{"id":"assertion.concept.wikipedia.approximate-measures","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate measures as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate measures\", CC BY-SA 4.0) states: Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","support":[{"end":321,"quote":"Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","source_id":"wikipedia.article.approximate-measures","source_sha256":"17842d3f2ddf555845daa2ca60da76d8dcc5e93a62cfb8507a201bdca32eb9cb","start":108}],"target_id":"concept.wikipedia.approximate-measures","target_kind":"node","target_sha256":"f2647092c8ecde7869806233bdfe395521dc0cb196a3dc84ec080e7fbd00a9b9"}],"concept.wikipedia.approximate-tangent-space":[{"id":"assertion.concept.wikipedia.approximate-tangent-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximate tangent space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximate tangent space\", CC BY-SA 4.0) states: In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","support":[{"end":272,"quote":"In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","source_id":"wikipedia.article.approximate-tangent-space","source_sha256":"128ecb04b04768775065f28c4002a8d3d7d37546e577145f8edc5ac29185d482","start":113}],"target_id":"concept.wikipedia.approximate-tangent-space","target_kind":"node","target_sha256":"ba3cf86f3f45745729b2e391765a9b14b680c05724c4d5c074753b00c4fe8e51"}],"concept.wikipedia.approximately-continuous-function":[{"id":"assertion.concept.wikipedia.approximately-continuous-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximately continuous function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximately continuous function\", CC BY-SA 4.0) states: In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","support":[{"end":355,"quote":"In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","source_id":"wikipedia.article.approximately-continuous-function","source_sha256":"86bfbb3e457fa85d3088e00160ffd9db4ae870c5bfd7c24d6f412b30a2133e7c","start":121}],"target_id":"concept.wikipedia.approximately-continuous-function","target_kind":"node","target_sha256":"8eb5886f6a7e48e3a947a78fa4c66e454cdbb6caecc3480d1bf28e2aef20b978"}],"concept.wikipedia.approximation-error":[{"id":"assertion.concept.wikipedia.approximation-error","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximation error as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximation error\", CC BY-SA 4.0) states: The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","support":[{"end":282,"quote":"The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","source_id":"wikipedia.article.approximation-error","source_sha256":"df7e715a284d3ee43443d83a3a56192a9c02aeb55f6efc874e6d21e4ff964adf","start":105}],"target_id":"concept.wikipedia.approximation-error","target_kind":"node","target_sha256":"09459591d359af079bb288258dc7da739890346d620459409bef3bb753e2bfd2"}],"concept.wikipedia.approximation-theory":[{"id":"assertion.concept.wikipedia.approximation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Approximation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Approximation theory\", CC BY-SA 4.0) states: In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","support":[{"end":294,"quote":"In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","source_id":"wikipedia.article.approximation-theory","source_sha256":"7836a70f798fcb09eae0ee4be11f84795197ca7027bebd66aa079f62f683594c","start":107}],"target_id":"concept.wikipedia.approximation-theory","target_kind":"node","target_sha256":"85d7ae92a3c12b334279dd8e761ffe260bf80c581373dbc1827e326ea70d9409"}],"concept.wikipedia.apriorism":[{"id":"assertion.concept.wikipedia.apriorism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apriorism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apriorism\", CC BY-SA 4.0) states: Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","support":[{"end":366,"quote":"Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","source_id":"wikipedia.article.apriorism","source_sha256":"fc250f4ccd8d02acab79f9c3d760cc2fba8e144329aa379d35de70016f5f6d8d","start":97}],"target_id":"concept.wikipedia.apriorism","target_kind":"node","target_sha256":"5aa6535f1c94726287fe6f7367564500e41a790fcfa6a33471b61438d269a9bf"}],"concept.wikipedia.aquifer":[{"id":"assertion.concept.wikipedia.aquifer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aquifer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aquifer\", CC BY-SA 4.0) states: An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","support":[{"end":251,"quote":"An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","source_id":"wikipedia.article.aquifer","source_sha256":"242c7a791e9baace3f06bb84d7dbdaf6030955bc0039f33cc1ff0767a60da8fe","start":92}],"target_id":"concept.wikipedia.aquifer","target_kind":"node","target_sha256":"faa93273d6a4fcabc30a930ea2d10b9aef3e0ae2cc2db41ce2b0779cb9be392b"}],"concept.wikipedia.aquifer-test":[{"id":"assertion.concept.wikipedia.aquifer-test","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aquifer test as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aquifer test\", CC BY-SA 4.0) states: In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \"stimulating\" the aquifer through constant pumping, and observing the aquifer's \"response\" (drawdown) in observation wells.","support":[{"end":318,"quote":"In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \\\"stimulating\\\" the aquifer through constant pumping, and observing the aquifer's \\\"response\\\" (drawdown) in observation wells.","source_id":"wikipedia.article.aquifer-test","source_sha256":"78187f0b97b77e9347cdce55d39a2eb17d7502de0d017ec8caa8dd26e229f232","start":99}],"target_id":"concept.wikipedia.aquifer-test","target_kind":"node","target_sha256":"788dd76c5a06ed515096d9141b24542b67dbc289665137bbfcb77fc30934bdae"}],"concept.wikipedia.arbitrary-inference":[{"id":"assertion.concept.wikipedia.arbitrary-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arbitrary inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arbitrary inference\", CC BY-SA 4.0) states: Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","support":[{"end":200,"quote":"Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","source_id":"wikipedia.article.arbitrary-inference","source_sha256":"9c67679e15285abe2deb4683f7a6d126910f482e014f7675f79b9b361efbdf70","start":107}],"target_id":"concept.wikipedia.arbitrary-inference","target_kind":"node","target_sha256":"f1df2d3ec1a0a98883434118685a6dce9fd0c78574ba5d207ebcbbb510005b83"}],"concept.wikipedia.arbor-milling":[{"id":"assertion.concept.wikipedia.arbor-milling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arbor milling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arbor milling\", CC BY-SA 4.0) states: Arbor milling is a cutting process which removes material via a multi-toothed cutter.","support":[{"end":186,"quote":"Arbor milling is a cutting process which removes material via a multi-toothed cutter.","source_id":"wikipedia.article.arbor-milling","source_sha256":"a9725623ee8e69420e2b4ed60d503ccdadb4966ce6554e9a2b3258029cbc4a7d","start":101}],"target_id":"concept.wikipedia.arbor-milling","target_kind":"node","target_sha256":"76cab6e90fbb19a4a5eff91765524a0da5b96955248d4e8b59e4ea9276215679"}],"concept.wikipedia.arc-fault":[{"id":"assertion.concept.wikipedia.arc-fault","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arc fault as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arc fault\", CC BY-SA 4.0) states: An arc fault is a high power discharge of electricity between two or more conductors.","support":[{"end":182,"quote":"An arc fault is a high power discharge of electricity between two or more conductors.","source_id":"wikipedia.article.arc-fault","source_sha256":"ce0e48cc61149743bae631c202ba0e141ff5c331a0913b74e102af459e088e85","start":97}],"target_id":"concept.wikipedia.arc-fault","target_kind":"node","target_sha256":"81e2575b5a0a643fdf4669b385c062fc72a2d20d179bcdcf88b8ed00bc27b3f1"}],"concept.wikipedia.arc-length-method":[{"id":"assertion.concept.wikipedia.arc-length-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arc-length method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arc-length method\", CC BY-SA 4.0) states: In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","support":[{"end":385,"quote":"In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","source_id":"wikipedia.article.arc-length-method","source_sha256":"95f0b21119eecb827f9ebca0331ff27246d53efd602db12648fdcc7e21abd807","start":105}],"target_id":"concept.wikipedia.arc-length-method","target_kind":"node","target_sha256":"5f25506e23ec7bafa74f36958ed9777cf2a41d1a35fc6f18373aca833b168a3a"}],"concept.wikipedia.arcadia-engineering":[{"id":"assertion.concept.wikipedia.arcadia-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arcadia (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arcadia (engineering)\", CC BY-SA 4.0) states: ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","support":[{"end":297,"quote":"ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","source_id":"wikipedia.article.arcadia-engineering","source_sha256":"a6844d696b0403645086313084ce4292453a61e7b8d728b606f5033e6b699977","start":109}],"target_id":"concept.wikipedia.arcadia-engineering","target_kind":"node","target_sha256":"88220959ad8476101d6e45ae146faf88c294ebcbfa78f7682c9c6640d5bca449"}],"concept.wikipedia.archard-equation":[{"id":"assertion.concept.wikipedia.archard-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archard equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archard equation\", CC BY-SA 4.0) states: The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","support":[{"end":225,"quote":"The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","source_id":"wikipedia.article.archard-equation","source_sha256":"da22c1f32fa73108e7d91719c69314b884ebff244361e01c697a756ab5edecfc","start":104}],"target_id":"concept.wikipedia.archard-equation","target_kind":"node","target_sha256":"7a028fad91d6f6c6edb7de7f6060fe991fdcbed0dbf23ab1cccea57dc98e37ee"}],"concept.wikipedia.arche-writing":[{"id":"assertion.concept.wikipedia.arche-writing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arche-writing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arche-writing\", CC BY-SA 4.0) states: In the philosophy of language, \"Arche-writing\" (French: archi-écriture \"arche-\" meaning \"origin, principle, or telos\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","support":[{"end":376,"quote":"In the philosophy of language, \\\"Arche-writing\\\" (French: archi-écriture \\\"arche-\\\" meaning \\\"origin, principle, or telos\\\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","source_id":"wikipedia.article.arche-writing","source_sha256":"a054741e037cf472025c4e129beb6b86f81f128ca0cc48d31aadcaf1c0081b76","start":100}],"target_id":"concept.wikipedia.arche-writing","target_kind":"node","target_sha256":"b3fce8dafcef058568937b43655b2cba3c4006bedc7d79870d7dbbfd697e8085"}],"concept.wikipedia.archimedean-point":[{"id":"assertion.concept.wikipedia.archimedean-point","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archimedean point as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archimedean point\", CC BY-SA 4.0) states: An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","support":[{"end":331,"quote":"An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","source_id":"wikipedia.article.archimedean-point","source_sha256":"af2b88dd38f47e565a7b1fcc48f5691e8091580784437f2d74c1366cf6dcebfc","start":103}],"target_id":"concept.wikipedia.archimedean-point","target_kind":"node","target_sha256":"e87381031efe427aaf033f421f61e7e817847ebd07e28a47f8953879d8fb58a7"}],"concept.wikipedia.archimedes-screw":[{"id":"assertion.concept.wikipedia.archimedes-screw","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archimedes' screw as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archimedes' screw\", CC BY-SA 4.0) states: An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","support":[{"end":218,"quote":"An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","source_id":"wikipedia.article.archimedes-screw","source_sha256":"91cd6d442331effdc5169ddfc58ebfb1d6b50b2bc379a5a5fa6eccd2bb923a79","start":102}],"target_id":"concept.wikipedia.archimedes-screw","target_kind":"node","target_sha256":"d7289c3988efaefa2335d44f62e46df4f2ed45aacb6734bf8dfc6b9d151b6e79"}],"concept.wikipedia.architectural-ironmongery":[{"id":"assertion.concept.wikipedia.architectural-ironmongery","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural ironmongery as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural ironmongery\", CC BY-SA 4.0) states: Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","support":[{"end":347,"quote":"Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","source_id":"wikipedia.article.architectural-ironmongery","source_sha256":"551184335ad2ee84cc2595739a461815679f9cca41727ffbf1b565c65aa39ed7","start":113}],"target_id":"concept.wikipedia.architectural-ironmongery","target_kind":"node","target_sha256":"e72e0c90ab698b67dbcdddf62f9283ede7f21bc563b78e3f695d64edb9cc7290"}],"concept.wikipedia.archival-research":[{"id":"assertion.concept.wikipedia.archival-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Archival research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Archival research\", CC BY-SA 4.0) states: Archival research is a type of research which involves seeking out and extracting evidence from archival records.","support":[{"end":218,"quote":"Archival research is a type of research which involves seeking out and extracting evidence from archival records.","source_id":"wikipedia.article.archival-research","source_sha256":"0d7856923b76967af1521b4d3b5538e3530896e2b83edc55f12315cffa15e3d8","start":105}],"target_id":"concept.wikipedia.archival-research","target_kind":"node","target_sha256":"42fb09d564b7ea50e0a83c7f578a0d150009d528c67be73fa0987982687829ad"}],"concept.wikipedia.arens-fort-space":[{"id":"assertion.concept.wikipedia.arens-fort-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arens–Fort space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arens–Fort space\", CC BY-SA 4.0) states: In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","support":[{"end":252,"quote":"In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","source_id":"wikipedia.article.arens-fort-space","source_sha256":"93e107e8590c630437a8df41b78c6e6ecb02fa8d3d3eb1dc689da1501f89df7b","start":103}],"target_id":"concept.wikipedia.arens-fort-space","target_kind":"node","target_sha256":"f0dc2ae5077b8fe51dbbacc827a5f5c5ebd656ba81490d558ed9155bc0510706"}],"concept.wikipedia.arf-ring":[{"id":"assertion.concept.wikipedia.arf-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arf ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arf ring\", CC BY-SA 4.0) states: In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","support":[{"end":273,"quote":"In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","source_id":"wikipedia.article.arf-ring","source_sha256":"813774d193c4524e48219588c23a0d77bed441b49814fcd63366645a88dcc83a","start":96}],"target_id":"concept.wikipedia.arf-ring","target_kind":"node","target_sha256":"bc8d8d2cedf7c6c31397f96d9d785a0c3cd565682d7a42c4f4e08c733f760cbd"}],"concept.wikipedia.argument":[{"id":"assertion.concept.wikipedia.argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument\", CC BY-SA 4.0) states: An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","support":[{"end":221,"quote":"An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","source_id":"wikipedia.article.argument","source_sha256":"b5a627179efb38ef4d0db9cf1f2767686f5b2d68041478fe58e3202c5f2f3ac1","start":96}],"target_id":"concept.wikipedia.argument","target_kind":"node","target_sha256":"ba29d27717d8e8ac849a1d0524a5b19ddace7297834c6f3c40ae9ba3d81e3b0a"}],"concept.wikipedia.argument-from-analogy":[{"id":"assertion.concept.wikipedia.argument-from-analogy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from analogy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from analogy\", CC BY-SA 4.0) states: Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","support":[{"end":285,"quote":"Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","source_id":"wikipedia.article.argument-from-analogy","source_sha256":"e1fc6f372ebf7ac04df80ba5d2464d92998c817a3be458d3cd36dd378b29b9fd","start":109}],"target_id":"concept.wikipedia.argument-from-analogy","target_kind":"node","target_sha256":"4049945ccf286801782c68292cc475c1ddde2beab205c4ab46ead9437c0ffaa1"}],"concept.wikipedia.argument-from-illusion":[{"id":"assertion.concept.wikipedia.argument-from-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from illusion\", CC BY-SA 4.0) states: The argument from illusion is an argument for the existence of sense-data.","support":[{"end":184,"quote":"The argument from illusion is an argument for the existence of sense-data.","source_id":"wikipedia.article.argument-from-illusion","source_sha256":"705c66c3b7892c80647748c81f3130b9477743663b02e98c59c9fd410800805a","start":110}],"target_id":"concept.wikipedia.argument-from-illusion","target_kind":"node","target_sha256":"9cf75c3607285bd4d78abc219e9459b5603d07453b211cc83631410b148c28f7"}],"concept.wikipedia.argument-from-incredulity":[{"id":"assertion.concept.wikipedia.argument-from-incredulity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from incredulity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from incredulity\", CC BY-SA 4.0) states: Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","support":[{"end":267,"quote":"Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","source_id":"wikipedia.article.argument-from-incredulity","source_sha256":"f0986abf20e5750e4090944bbd42bb444585a0120d1678acbf004bf929db6d95","start":112}],"target_id":"concept.wikipedia.argument-from-incredulity","target_kind":"node","target_sha256":"fbc0010150979abe6c66cba540745bb38ed489cbf9c94b27b816fc633a6590f3"}],"concept.wikipedia.argument-from-marginal-cases":[{"id":"assertion.concept.wikipedia.argument-from-marginal-cases","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument from marginal cases as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument from marginal cases\", CC BY-SA 4.0) states: The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","support":[{"end":302,"quote":"The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","source_id":"wikipedia.article.argument-from-marginal-cases","source_sha256":"4a5860aa0a3fecb980eea1fa7e9cafbed9b0dc8e610266b67d72d23e3bd3bc12","start":115}],"target_id":"concept.wikipedia.argument-from-marginal-cases","target_kind":"node","target_sha256":"14263fa62e916c40287ae9216eb23f7db803ea40e14a5dd448a57282cfd91300"}],"concept.wikipedia.argument-map":[{"id":"assertion.concept.wikipedia.argument-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argument map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argument map\", CC BY-SA 4.0) states: An argument map or argument diagram is a visual representation of the structure of an argument.","support":[{"end":194,"quote":"An argument map or argument diagram is a visual representation of the structure of an argument.","source_id":"wikipedia.article.argument-map","source_sha256":"1e146e84f808bd9cc653efb86c351ae0918b56dc20fbaa7f215cbe1188dec86e","start":99}],"target_id":"concept.wikipedia.argument-map","target_kind":"node","target_sha256":"a62e7b0f055d1f6700b33b419960a3ac71802c8ede94eecbcd57ac82585efbce"}],"concept.wikipedia.argumentum-a-fortiori":[{"id":"assertion.concept.wikipedia.argumentum-a-fortiori","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum a fortiori as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum a fortiori\", CC BY-SA 4.0) states: Argumentum a fortiori (literally \"argument from the stronger [reason]\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","support":[{"end":388,"quote":"Argumentum a fortiori (literally \\\"argument from the stronger [reason]\\\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","source_id":"wikipedia.article.argumentum-a-fortiori","source_sha256":"3408b31dfee8292212fe16e06e7df0959c5140a2f7a144989cb8051ad5146c13","start":109}],"target_id":"concept.wikipedia.argumentum-a-fortiori","target_kind":"node","target_sha256":"65ff2bd8765f8fb73f3326aa44129faf9dd8b974c2ca950a6a72e75dc4f9e760"}],"concept.wikipedia.argumentum-ad-baculum":[{"id":"assertion.concept.wikipedia.argumentum-ad-baculum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum ad baculum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum ad baculum\", CC BY-SA 4.0) states: Argumentum ad baculum (Latin for \"argument to the cudgel\" or \"appeal to the stick\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","support":[{"end":304,"quote":"Argumentum ad baculum (Latin for \\\"argument to the cudgel\\\" or \\\"appeal to the stick\\\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","source_id":"wikipedia.article.argumentum-ad-baculum","source_sha256":"cfb0419a9820e941f6899db587fdd6c91d2ac9958bba914ff8824902be9c7825","start":106}],"target_id":"concept.wikipedia.argumentum-ad-baculum","target_kind":"node","target_sha256":"c1fdf428da6be5681d0ae56e22854919f2c7f5c2cec8c61f423451d2cf0660dd"}],"concept.wikipedia.argumentum-ad-captandum":[{"id":"assertion.concept.wikipedia.argumentum-ad-captandum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentum ad captandum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentum ad captandum\", CC BY-SA 4.0) states: In rhetoric, an argumentum ad captandum, \"for capturing\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","support":[{"end":321,"quote":"In rhetoric, an argumentum ad captandum, \\\"for capturing\\\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","source_id":"wikipedia.article.argumentum-ad-captandum","source_sha256":"9acab6dc11c0a85a3839c8651972ba5b898118c0005635333bc638c8f2d79694","start":109}],"target_id":"concept.wikipedia.argumentum-ad-captandum","target_kind":"node","target_sha256":"59df84af77d404456055fce89abdcc0e463ed4c7ad4eba8067af651fb927f89e"}],"concept.wikipedia.ariadne-s-thread-logic":[{"id":"assertion.concept.wikipedia.ariadne-s-thread-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ariadne's thread (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ariadne's thread (logic)\", CC BY-SA 4.0) states: Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","support":[{"end":465,"quote":"Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","source_id":"wikipedia.article.ariadne-s-thread-logic","source_sha256":"38b7b94ccb83bb5c7048950c783cdec105b34043214ff595ce78dccefaa187dd","start":111}],"target_id":"concept.wikipedia.ariadne-s-thread-logic","target_kind":"node","target_sha256":"3758ba0c1a365e53ce54bd0bc6e443dd660c3f94237d5d4893c3098ec7237fed"}],"concept.wikipedia.aristotle-s-theory-of-universals":[{"id":"assertion.concept.wikipedia.aristotle-s-theory-of-universals","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aristotle's theory of universals as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aristotle's theory of universals\", CC BY-SA 4.0) states: Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","support":[{"end":277,"quote":"Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","source_id":"wikipedia.article.aristotle-s-theory-of-universals","source_sha256":"f2cd64797acf35361825a8d25fe848f31ca3de3bf34b4857843434b1016c6415","start":118}],"target_id":"concept.wikipedia.aristotle-s-theory-of-universals","target_kind":"node","target_sha256":"9dde63edaebb0c90dd1be4b5992e63568f316882bb40f5be1ed01cdda250d330"}],"concept.wikipedia.arithmetic-derivative":[{"id":"assertion.concept.wikipedia.arithmetic-derivative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic derivative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic derivative\", CC BY-SA 4.0) states: In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","support":[{"end":353,"quote":"In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","source_id":"wikipedia.article.arithmetic-derivative","source_sha256":"9448d251e31881d385c8cfb500a4f51f83cde237f408023e7f5355e0a604e77e","start":109}],"target_id":"concept.wikipedia.arithmetic-derivative","target_kind":"node","target_sha256":"a9132cc0c01e52396ee9944f6f68a64a6512e13bb9fcd218f0ecdf109fead98c"}],"concept.wikipedia.arithmetic-fuchsian-group":[{"id":"assertion.concept.wikipedia.arithmetic-fuchsian-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic Fuchsian group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic Fuchsian group\", CC BY-SA 4.0) states: Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","support":[{"end":227,"quote":"Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","source_id":"wikipedia.article.arithmetic-fuchsian-group","source_sha256":"9062c1189a4854307c8239dc57f9a38155d0fb2e648a47263834c1dab0c4d534","start":113}],"target_id":"concept.wikipedia.arithmetic-fuchsian-group","target_kind":"node","target_sha256":"90b99dc9eca49160f051340859b07ebfdb7d9d7d3ccad41dcf8ed1ef306cfb06"}],"concept.wikipedia.arithmetic-number":[{"id":"assertion.concept.wikipedia.arithmetic-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic number\", CC BY-SA 4.0) states: In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","support":[{"end":224,"quote":"In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","source_id":"wikipedia.article.arithmetic-number","source_sha256":"f6a88ca045f3021156917862416d470551d24d0d9999b73a9d18572476e73b57","start":105}],"target_id":"concept.wikipedia.arithmetic-number","target_kind":"node","target_sha256":"534c9e15a11c8f45e158be7d799001403c0aad000e7da6586e7624ae8277f841"}],"concept.wikipedia.arithmetic-progression":[{"id":"assertion.concept.wikipedia.arithmetic-progression","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic progression as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic progression\", CC BY-SA 4.0) states: An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","support":[{"end":312,"quote":"An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","source_id":"wikipedia.article.arithmetic-progression","source_sha256":"2c4cba242f89bee55162cb63c53c526d13fc86c7e231430bddfc5ecd480e666f","start":108}],"target_id":"concept.wikipedia.arithmetic-progression","target_kind":"node","target_sha256":"1fdb5c719200cd86bc5dd42df63defd794cc3d0c5e65e453465a5b31d538ebbd"}],"concept.wikipedia.arithmetic-zeta-function":[{"id":"assertion.concept.wikipedia.arithmetic-zeta-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic zeta function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic zeta function\", CC BY-SA 4.0) states: In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","support":[{"end":230,"quote":"In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","source_id":"wikipedia.article.arithmetic-zeta-function","source_sha256":"a4d1ee85f016b2933210a1f7e0b297e3c350ebfaf91db72f5165d0f9a4209b52","start":112}],"target_id":"concept.wikipedia.arithmetic-zeta-function","target_kind":"node","target_sha256":"965fded121d892ba4ca685dd74672a2de028ee2a54f1b9319abb344114c33186"}],"concept.wikipedia.arithmetical-set":[{"id":"assertion.concept.wikipedia.arithmetical-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetical set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetical set\", CC BY-SA 4.0) states: In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","support":[{"end":259,"quote":"In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","source_id":"wikipedia.article.arithmetical-set","source_sha256":"2de96f44b0d33427bda6c502c3704ad30e6a256148bba21a5ab2f40addf0f005","start":103}],"target_id":"concept.wikipedia.arithmetical-set","target_kind":"node","target_sha256":"6ec9c2be39017bb1e55e05f857d117959ac6479c0be0512d99eec830def9eadc"}],"concept.wikipedia.arithmetico-geometric-sequence":[{"id":"assertion.concept.wikipedia.arithmetico-geometric-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetico-geometric sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetico-geometric sequence\", CC BY-SA 4.0) states: In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","support":[{"end":323,"quote":"In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","source_id":"wikipedia.article.arithmetico-geometric-sequence","source_sha256":"385d21e7a204e3044c91b594a2b129debdd5ce8a2e7fb677739abb2d68247a29","start":118}],"target_id":"concept.wikipedia.arithmetico-geometric-sequence","target_kind":"node","target_sha256":"f823f9d3bf743696b0f5013913fb763e00fb3ce8386c367217e6357d0dc053d8"}],"concept.wikipedia.arity":[{"id":"assertion.concept.wikipedia.arity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arity\", CC BY-SA 4.0) states: In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","support":[{"end":227,"quote":"In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","source_id":"wikipedia.article.arity","source_sha256":"0b0565c806f32ca43cc992bac681f926bd7670b95ba7d1548df2ba3bc3b3ea14","start":90}],"target_id":"concept.wikipedia.arity","target_kind":"node","target_sha256":"fd67b1bcca6efc5a7cf1f23eabc6355248033960162481c8480368733b4aa9f8"}],"concept.wikipedia.armature-controlled-dc-motor":[{"id":"assertion.concept.wikipedia.armature-controlled-dc-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armature-controlled DC motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armature-controlled DC motor\", CC BY-SA 4.0) states: An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","support":[{"end":242,"quote":"An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","source_id":"wikipedia.article.armature-controlled-dc-motor","source_sha256":"50515318cf78778f23a01f5acbf36e49c1179e2bb3515f4964f356a8e76d9e1b","start":116}],"target_id":"concept.wikipedia.armature-controlled-dc-motor","target_kind":"node","target_sha256":"46eef912eb4e6451aea3f57efa414c4e50395097e0455ebcc7703a4946815ff9"}],"concept.wikipedia.armature-electrical":[{"id":"assertion.concept.wikipedia.armature-electrical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armature (electrical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armature (electrical)\", CC BY-SA 4.0) states: In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","support":[{"end":240,"quote":"In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","source_id":"wikipedia.article.armature-electrical","source_sha256":"9642df35d57945f1accf6d66f525f75439244b0efb327edd91861be47f333fb9","start":108}],"target_id":"concept.wikipedia.armature-electrical","target_kind":"node","target_sha256":"0012a7ab83d403273231a40e3630a0cc428e673d3efc2d411eea3d8df24a8722"}],"concept.wikipedia.armchair-theorizing":[{"id":"assertion.concept.wikipedia.armchair-theorizing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armchair theorizing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armchair theorizing\", CC BY-SA 4.0) states: Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","support":[{"end":264,"quote":"Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","source_id":"wikipedia.article.armchair-theorizing","source_sha256":"0c6c403e629cc3439a9c623ca827e3fcf06dc9b98b4560b1c855a079ea29fe49","start":107}],"target_id":"concept.wikipedia.armchair-theorizing","target_kind":"node","target_sha256":"d1655481ff07013fa3f68a9d2def94aff53dc4377798b271839d3b8b842d3612"}],"concept.wikipedia.armourstone":[{"id":"assertion.concept.wikipedia.armourstone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Armourstone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Armourstone\", CC BY-SA 4.0) states: Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","support":[{"end":291,"quote":"Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","source_id":"wikipedia.article.armourstone","source_sha256":"9050af8f3a7f17bb32730f8fa77b7312bbc345bacfc093336b0fe364ee97a518","start":99}],"target_id":"concept.wikipedia.armourstone","target_kind":"node","target_sha256":"344e5d3280a4d99afda78acedd94141c47b292ce62af358b656593cf6c1f9853"}],"concept.wikipedia.arnold-diffusion":[{"id":"assertion.concept.wikipedia.arnold-diffusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arnold diffusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arnold diffusion\", CC BY-SA 4.0) states: In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","support":[{"end":219,"quote":"In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","source_id":"wikipedia.article.arnold-diffusion","source_sha256":"4dbe5bd26ad68ad509b6367aac798a7e2d7afc174ee53e0296614b4d0b8d7535","start":104}],"target_id":"concept.wikipedia.arnold-diffusion","target_kind":"node","target_sha256":"5a77158aeb967b2ff8ac8076321bdc2910a6d15b2c2342b700a15ec5cd8b8632"}],"concept.wikipedia.arnold-invariants":[{"id":"assertion.concept.wikipedia.arnold-invariants","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arnold invariants as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arnold invariants\", CC BY-SA 4.0) states: In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","support":[{"end":289,"quote":"In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","source_id":"wikipedia.article.arnold-invariants","source_sha256":"00cf86f4db3600314755de1777b2f29fd30f35014e2cf9260680a12b3403ccad","start":105}],"target_id":"concept.wikipedia.arnold-invariants","target_kind":"node","target_sha256":"dfe702637ffa03dc9b83882eee626ec78eefcfe89aae49b18d5d0b421a7e3c66"}],"concept.wikipedia.array-processing":[{"id":"assertion.concept.wikipedia.array-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Array processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Array processing\", CC BY-SA 4.0) states: Array processing is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","support":[{"end":287,"quote":"Array processing  is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","source_id":"wikipedia.article.array-processing","source_sha256":"19b02ce7fa41cd13f27d7d5f2e9dd8db328973dfb0a75bd18f5787ff1943f3b5","start":103}],"target_id":"concept.wikipedia.array-processing","target_kind":"node","target_sha256":"f2a11ca86c013946f7fe48da3f3154cacc4f04009db09752543f08885e3cb508"}],"concept.wikipedia.artifact-centric-business-process-model":[{"id":"assertion.concept.wikipedia.artifact-centric-business-process-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artifact-centric business process model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artifact-centric business process model\", CC BY-SA 4.0) states: Artifact-centric business process model represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","support":[{"end":348,"quote":"Artifact-centric business process model  represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","source_id":"wikipedia.article.artifact-centric-business-process-model","source_sha256":"291ad4dde16fa2924d5b19086d9d6c7a3a1fc54f7e2345ee64f56f3f58d138e0","start":127}],"target_id":"concept.wikipedia.artifact-centric-business-process-model","target_kind":"node","target_sha256":"22d51b871cafc7826ec4acfee7e0b3620a6dccc480ae2d07da849b71f688ce35"}],"concept.wikipedia.artificio-de-juanelo":[{"id":"assertion.concept.wikipedia.artificio-de-juanelo","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artificio de Juanelo as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artificio de Juanelo\", CC BY-SA 4.0) states: The Artificio de Juanelo (\"Gianello's artifice\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","support":[{"end":243,"quote":"The Artificio de Juanelo (\\\"Gianello's artifice\\\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","source_id":"wikipedia.article.artificio-de-juanelo","source_sha256":"77a58d8c39b8a3d0fe775f0a649a8a8b40325778ceb71b8f349707d0dc9a871d","start":108}],"target_id":"concept.wikipedia.artificio-de-juanelo","target_kind":"node","target_sha256":"530282a2bb89ae85a58da173a0bac1814dd936b8a3080eca8532751dab821b79"}],"concept.wikipedia.artin-verdier-duality":[{"id":"assertion.concept.wikipedia.artin-verdier-duality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artin–Verdier duality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artin–Verdier duality\", CC BY-SA 4.0) states: In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","support":[{"end":341,"quote":"In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","source_id":"wikipedia.article.artin-verdier-duality","source_sha256":"dc3a4297031229e9b4f54e1bf13c13b331f9bb87c0b933534c655ba344afa54c","start":109}],"target_id":"concept.wikipedia.artin-verdier-duality","target_kind":"node","target_sha256":"125645b91992feabcd16bad9a3df24e8a0335d53b0ea1087b3fb5fe894f46897"}],"concept.wikipedia.artinian-module":[{"id":"assertion.concept.wikipedia.artinian-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artinian module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artinian module\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","support":[{"end":252,"quote":"In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","source_id":"wikipedia.article.artinian-module","source_sha256":"32f126272795b57d038afde240a10da068833d11dd50a20965bdea59d6213ff0","start":101}],"target_id":"concept.wikipedia.artinian-module","target_kind":"node","target_sha256":"f0f7c0427897bb00dda4b8b43b7ef7a3f5135bc2cbf9bcd81367870b13701585"}],"concept.wikipedia.artinian-ring":[{"id":"assertion.concept.wikipedia.artinian-ring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artinian ring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artinian ring\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","support":[{"end":325,"quote":"In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","source_id":"wikipedia.article.artinian-ring","source_sha256":"84beeb9c04e97ed4fb5cacc772aa18cf8a976a1f60ef7a5fb8130feed3b2e79f","start":99}],"target_id":"concept.wikipedia.artinian-ring","target_kind":"node","target_sha256":"a18cd3daaadd8ea150c55b5da0b90b2f8d7404f21d9378c8b37e4b1d3b490f84"}],"concept.wikipedia.asano-contraction":[{"id":"assertion.concept.wikipedia.asano-contraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asano contraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asano contraction\", CC BY-SA 4.0) states: In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","support":[{"end":300,"quote":"In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","source_id":"wikipedia.article.asano-contraction","source_sha256":"ac62447849e7879de27447e1fb50e9e8d975bfb835c7c4ec2e864fc92ce75b11","start":105}],"target_id":"concept.wikipedia.asano-contraction","target_kind":"node","target_sha256":"82a8bf0ee7d6bee72c90a1ac881e8914231a8a012a3f5e889025e9b072acde1d"}],"concept.wikipedia.ascending-chain-condition":[{"id":"assertion.concept.wikipedia.ascending-chain-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ascending chain condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ascending chain condition\", CC BY-SA 4.0) states: In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","support":[{"end":317,"quote":"In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","source_id":"wikipedia.article.ascending-chain-condition","source_sha256":"bf28e7cfaef079b960f9a47ff056e7c9bbb6dfae4d004a49a8445a4d23c79199","start":109}],"target_id":"concept.wikipedia.ascending-chain-condition","target_kind":"node","target_sha256":"d9d71a7e4cd15ce403cc2a8ee6d368d1e9ea683fda1d2241a1c00341920168dc"}],"concept.wikipedia.asplund-space":[{"id":"assertion.concept.wikipedia.asplund-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asplund space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asplund space\", CC BY-SA 4.0) states: In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","support":[{"end":247,"quote":"In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","source_id":"wikipedia.article.asplund-space","source_sha256":"05fa90db3a81e09b8969168fc76fbfe7b144282057d1ee3114d8655836981581","start":101}],"target_id":"concept.wikipedia.asplund-space","target_kind":"node","target_sha256":"94ae4eb7d7a1bc3e4ca0aafbb6dc43bfa0c642a8f995e51d16ff6eb6a01f0a7d"}],"concept.wikipedia.asset-health-management":[{"id":"assertion.concept.wikipedia.asset-health-management","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asset health management as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asset health management\", CC BY-SA 4.0) states: In asset management, asset health management (AHM) is the field of study that looks at how to manage the \"health\" of an assets in a facility, system, or fleet.","support":[{"end":272,"quote":"In asset management, asset health management (AHM) is the field of study that looks at how to manage the \\\"health\\\" of an assets in a facility, system, or fleet.","source_id":"wikipedia.article.asset-health-management","source_sha256":"73a042f8745ec1ed53a13327610354a400869b7ab028088429274d0d73271626","start":111}],"target_id":"concept.wikipedia.asset-health-management","target_kind":"node","target_sha256":"87cb8ae14452920d0352e5783770b681de0f767ba82a239749d48f24abaab4df"}],"concept.wikipedia.associative-property":[{"id":"assertion.concept.wikipedia.associative-property","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Associative property as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Associative property\", CC BY-SA 4.0) states: In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","support":[{"end":262,"quote":"In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","source_id":"wikipedia.article.associative-property","source_sha256":"153a30378b69745cf8f9b846138d212cb904ac85e9de5481c6bbeff4473a600b","start":104}],"target_id":"concept.wikipedia.associative-property","target_kind":"node","target_sha256":"c04a5e2f2bb4f5a6786a589657493d85856db6c8cd62fced8d05ec551c17957d"}],"concept.wikipedia.astm-g65":[{"id":"assertion.concept.wikipedia.astm-g65","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"ASTM G65 as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"ASTM G65\", CC BY-SA 4.0) states: ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","support":[{"end":276,"quote":"ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","source_id":"wikipedia.article.astm-g65","source_sha256":"43beeafe20c402e7afe0c8c728fde6471708900c96c3f6da9dfb1e32698d7907","start":96}],"target_id":"concept.wikipedia.astm-g65","target_kind":"node","target_sha256":"633c48e11e5fcbbe4da9d9e9ee27c9dbaa34eb8d50080e95952b7c38e3dac9cf"}],"concept.wikipedia.asymmetric-norm":[{"id":"assertion.concept.wikipedia.asymmetric-norm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymmetric norm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymmetric norm\", CC BY-SA 4.0) states: In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","support":[{"end":201,"quote":"In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","source_id":"wikipedia.article.asymmetric-norm","source_sha256":"4b4c89989dd2d1cf9dbd30f7e5ad588c3b4b449f5f2197cc720eac348bd3d491","start":103}],"target_id":"concept.wikipedia.asymmetric-norm","target_kind":"node","target_sha256":"a11f22f29b9f04cf7efd512ca34ca8cc5cf427ddc340e31edc47d4e6e6901a9a"}],"concept.wikipedia.asymptote":[{"id":"assertion.concept.wikipedia.asymptote","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptote as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptote\", CC BY-SA 4.0) states: In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","support":[{"end":291,"quote":"In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","source_id":"wikipedia.article.asymptote","source_sha256":"05f66671009ed315f42352142817a87a1f951b376d538628c1bf02e6d4a7e475","start":93}],"target_id":"concept.wikipedia.asymptote","target_kind":"node","target_sha256":"d660b17dc5a96c71c2387c2444018f7c125091a680e08497e8b4230d8cca9756"}],"concept.wikipedia.asymptotic-expansion":[{"id":"assertion.concept.wikipedia.asymptotic-expansion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptotic expansion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptotic expansion\", CC BY-SA 4.0) states: In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function near a specific point or at infinity.","support":[{"end":282,"quote":"In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function  near a specific point or at infinity.","source_id":"wikipedia.article.asymptotic-expansion","source_sha256":"aa98a95fcd50d5f8a41c4b6b62422f7878919d71f404bbb7d72a36269a8880ab","start":106}],"target_id":"concept.wikipedia.asymptotic-expansion","target_kind":"node","target_sha256":"06d8b2d57d37ab9f51c0f44def5120035aaaff66cc3bd10e705256ec72fbcdec"}],"concept.wikipedia.atlas-topology":[{"id":"assertion.concept.wikipedia.atlas-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atlas (topology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atlas (topology)\", CC BY-SA 4.0) states: In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","support":[{"end":190,"quote":"In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","source_id":"wikipedia.article.atlas-topology","source_sha256":"58bd4a6f937556c703e11d442db0cdcf1cf4970ead4071e0d93b95753cc49e34","start":101}],"target_id":"concept.wikipedia.atlas-topology","target_kind":"node","target_sha256":"689d4202f7688eeb6fb3a4b8c7ac20a778e4b11eac7931ef8d39ca9e295c5de1"}],"concept.wikipedia.atom-measure-theory":[{"id":"assertion.concept.wikipedia.atom-measure-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atom (measure theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atom (measure theory)\", CC BY-SA 4.0) states: In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","support":[{"end":261,"quote":"In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","source_id":"wikipedia.article.atom-measure-theory","source_sha256":"d3add0cd5cb7044d14e4b2ad803cd3c9d80a8f6f45b43be5cf04cb255b6fa031","start":108}],"target_id":"concept.wikipedia.atom-measure-theory","target_kind":"node","target_sha256":"26ea445825760c19bde6e8754eb7ce997174c30fe8e7379ef893e481c369a297"}],"concept.wikipedia.attack-time-delay":[{"id":"assertion.concept.wikipedia.attack-time-delay","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attack-time delay as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attack-time delay\", CC BY-SA 4.0) states: In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","support":[{"end":225,"quote":"In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","source_id":"wikipedia.article.attack-time-delay","source_sha256":"7b543797bf1bdd55957b68a393858cbd9428c581eab8331e30781cb312ff81c8","start":102}],"target_id":"concept.wikipedia.attack-time-delay","target_kind":"node","target_sha256":"90eec6f20735a98cc4e01fb0a10d78865192de1a16265893897cb9e37109168b"}],"concept.wikipedia.attention-inequality":[{"id":"assertion.concept.wikipedia.attention-inequality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attention inequality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attention inequality\", CC BY-SA 4.0) states: Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","support":[{"end":254,"quote":"Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","source_id":"wikipedia.article.attention-inequality","source_sha256":"8bd18b5b33871a14cff98cbc819a44a53f4a53c8a98567e2509ae7fd2097c749","start":108}],"target_id":"concept.wikipedia.attention-inequality","target_kind":"node","target_sha256":"7021f19e6732692ca6da50638cb546287d74c09c1fabe73eb569cc83a96077f7"}],"concept.wikipedia.attribute-substitution":[{"id":"assertion.concept.wikipedia.attribute-substitution","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attribute substitution as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attribute substitution\", CC BY-SA 4.0) states: Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","support":[{"end":234,"quote":"Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","source_id":"wikipedia.article.attribute-substitution","source_sha256":"39921c659cba91524ab21795a672d09f16e2c6b399b6878857b7d2a5e5d60af9","start":110}],"target_id":"concept.wikipedia.attribute-substitution","target_kind":"node","target_sha256":"321d510b4decc184775a79fb7df0f9d29b78dbe656950d65c9ad71c2956f970d"}],"concept.wikipedia.attribution-psychology":[{"id":"assertion.concept.wikipedia.attribution-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attribution (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attribution (psychology)\", CC BY-SA 4.0) states: Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","support":[{"end":266,"quote":"Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","source_id":"wikipedia.article.attribution-psychology","source_sha256":"24a975050fe9d522ce78edd21ed2bc4bd1968a56b469a30d5b21ea8a8591ce75","start":111}],"target_id":"concept.wikipedia.attribution-psychology","target_kind":"node","target_sha256":"fabcb65be00249c8ef833563d08a36cb355bddfd0c677f829902324866b5aa97"}],"concept.wikipedia.attrition-research":[{"id":"assertion.concept.wikipedia.attrition-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Attrition (research) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Attrition (research)\", CC BY-SA 4.0) states: In science, attrition are ratios regarding the loss of participants during an experiment.","support":[{"end":197,"quote":"In science, attrition are ratios regarding the loss of participants during an experiment.","source_id":"wikipedia.article.attrition-research","source_sha256":"787e7a3707ade45124280e6acb806147d88aa214a2484dccb7993aa8cd3b6d56","start":108}],"target_id":"concept.wikipedia.attrition-research","target_kind":"node","target_sha256":"98a4da0fe4732f7b57116b6a498614ee2257b5acbb1743cb457513cbe1531581"}],"concept.wikipedia.audio-filter":[{"id":"assertion.concept.wikipedia.audio-filter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audio filter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audio filter\", CC BY-SA 4.0) states: An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","support":[{"end":223,"quote":"An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","source_id":"wikipedia.article.audio-filter","source_sha256":"e0da534c8cedd7570b0b7db6d8477e05a913c988a6990712ea963c4fba0d49e6","start":98}],"target_id":"concept.wikipedia.audio-filter","target_kind":"node","target_sha256":"e11086b6aac9faf83037b43442bd3b3b2ce608377c4edceebd9db4ca4b47a215"}],"concept.wikipedia.audio-signal-processing":[{"id":"assertion.concept.wikipedia.audio-signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audio signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audio signal processing\", CC BY-SA 4.0) states: Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","support":[{"end":234,"quote":"Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","source_id":"wikipedia.article.audio-signal-processing","source_sha256":"62c14361aa1e3b3e65f447d31514efefda6e1871500ac4b2121ba4db127e64f3","start":107}],"target_id":"concept.wikipedia.audio-signal-processing","target_kind":"node","target_sha256":"779272eaaa01db832762b6654b19597fc3d2a2248f3158686996f68dc11498c9"}],"concept.wikipedia.audit-study":[{"id":"assertion.concept.wikipedia.audit-study","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Audit study as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Audit study\", CC BY-SA 4.0) states: A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\"auditors\") are matched on all characteristics except the one being tested for discrimination.","support":[{"end":344,"quote":"A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\\\"auditors\\\") are matched on all characteristics except the one being tested for discrimination.","source_id":"wikipedia.article.audit-study","source_sha256":"8e2a893c6075e72229a91938e066e7f8a89e4d8768938cb8a39ff0f8da395f14","start":99}],"target_id":"concept.wikipedia.audit-study","target_kind":"node","target_sha256":"2081dffc6fec815824268e99064d19ff005f16f3a49dd3112bd54af813eba11f"}],"concept.wikipedia.augustinian-hypothesis":[{"id":"assertion.concept.wikipedia.augustinian-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Augustinian hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Augustinian hypothesis\", CC BY-SA 4.0) states: The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","support":[{"end":299,"quote":"The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","source_id":"wikipedia.article.augustinian-hypothesis","source_sha256":"6fe870e53da942ebd5d6728385859d1361c1f28be3b935c3b260eb1fb44783da","start":109}],"target_id":"concept.wikipedia.augustinian-hypothesis","target_kind":"node","target_sha256":"76041af9ec1e9ef470ad85cd1e98ccdeab56bf1e8dc76e640eb490844cc1385d"}],"concept.wikipedia.authority-bias":[{"id":"assertion.concept.wikipedia.authority-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Authority bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Authority bias\", CC BY-SA 4.0) states: Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","support":[{"end":267,"quote":"Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","source_id":"wikipedia.article.authority-bias","source_sha256":"94de1fca749556177b3c9196572d5f5ae22692e0b7a89db6de2933cff7b9537c","start":102}],"target_id":"concept.wikipedia.authority-bias","target_kind":"node","target_sha256":"67c56ba14482b4756a01012c7e82d6fcf5dcf298c6981ad53039a093824a856c"}],"concept.wikipedia.authority-of-the-bootmaker":[{"id":"assertion.concept.wikipedia.authority-of-the-bootmaker","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Authority of the bootmaker as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Authority of the bootmaker\", CC BY-SA 4.0) states: Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","support":[{"end":368,"quote":"Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","source_id":"wikipedia.article.authority-of-the-bootmaker","source_sha256":"2012981b8f5f08bc07e1a31789fb1f7a1bda4f06f0c98c1ac2200b9664e70599","start":114}],"target_id":"concept.wikipedia.authority-of-the-bootmaker","target_kind":"node","target_sha256":"08d03dec6f2d4b5eb3cadabd01842c5925f1c1da7beb5ee277f9f0b3f2a9d1e5"}],"concept.wikipedia.autocovariance":[{"id":"assertion.concept.wikipedia.autocovariance","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autocovariance as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autocovariance\", CC BY-SA 4.0) states: In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","support":[{"end":277,"quote":"In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","source_id":"wikipedia.article.autocovariance","source_sha256":"ad6aa99b4876b20de0fe446f0274b2367edd8d5a89eef3c476f58c568f2c6462","start":101}],"target_id":"concept.wikipedia.autocovariance","target_kind":"node","target_sha256":"e81ece791e462b69291bb6b879e9d4174773da0e770bf8718ae04f4f635c76cb"}],"concept.wikipedia.autofrettage":[{"id":"assertion.concept.wikipedia.autofrettage","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autofrettage as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autofrettage\", CC BY-SA 4.0) states: Autofrettage is a work-hardening process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","support":[{"end":357,"quote":"Autofrettage is a work-hardening  process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","source_id":"wikipedia.article.autofrettage","source_sha256":"7d59d78cd0743853a9d458e59cb4862dbcd779da95b548ed1a36292fa29a7688","start":98}],"target_id":"concept.wikipedia.autofrettage","target_kind":"node","target_sha256":"8e4295418f059b1c46ba9c95c1923b3fec9ce949c2b6be04592f440b7cce014d"}],"concept.wikipedia.autogenous-welding":[{"id":"assertion.concept.wikipedia.autogenous-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autogenous welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autogenous welding\", CC BY-SA 4.0) states: Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","support":[{"end":254,"quote":"Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","source_id":"wikipedia.article.autogenous-welding","source_sha256":"d37d3d70b6ae2a7263182fc8a0d0b262e6cff7f83562c37810559071d481b1d2","start":106}],"target_id":"concept.wikipedia.autogenous-welding","target_kind":"node","target_sha256":"581be1a7ca6b6c93edd71743130dd4a5a2259bbac9eeb539cac72377d2499f62"}],"concept.wikipedia.automatic-semigroup":[{"id":"assertion.concept.wikipedia.automatic-semigroup","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automatic semigroup as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automatic semigroup\", CC BY-SA 4.0) states: In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","support":[{"end":267,"quote":"In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","source_id":"wikipedia.article.automatic-semigroup","source_sha256":"8caaf1d1059ef02d255c9177adec74b0993f60df57bef57f3f9e4e8da2cb3580","start":107}],"target_id":"concept.wikipedia.automatic-semigroup","target_kind":"node","target_sha256":"fcc8c8eafc6575fce3b9ef92400a95732606443fae7afa1c81435fbae7b4e103"}],"concept.wikipedia.automatic-sequence":[{"id":"assertion.concept.wikipedia.automatic-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automatic sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automatic sequence\", CC BY-SA 4.0) states: In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","support":[{"end":378,"quote":"In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","source_id":"wikipedia.article.automatic-sequence","source_sha256":"9da2dc9fd370ead5be7efee2c25c9c529e477f42e32ad7988031c14e9de9cb5f","start":105}],"target_id":"concept.wikipedia.automatic-sequence","target_kind":"node","target_sha256":"1bf7eb7f500b628eaf6ca4e3168d8f511b48fb54dd6374075c0ec52840f743e8"}],"concept.wikipedia.automation-bias":[{"id":"assertion.concept.wikipedia.automation-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automation bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automation bias\", CC BY-SA 4.0) states: Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","support":[{"end":295,"quote":"Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","source_id":"wikipedia.article.automation-bias","source_sha256":"c9255726e2fb1da166a4db4604097b0a930d895f5c701b9fdb7dbbfbf4ed9845","start":103}],"target_id":"concept.wikipedia.automation-bias","target_kind":"node","target_sha256":"089ed8876f1907c6954c44ad8d5704fc812701be70650847ad7f4cbc0057cf24"}],"concept.wikipedia.automorphism":[{"id":"assertion.concept.wikipedia.automorphism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automorphism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automorphism\", CC BY-SA 4.0) states: In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","support":[{"end":183,"quote":"In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","source_id":"wikipedia.article.automorphism","source_sha256":"7e844822c238f99c8a47ae059b79c67e83a0cd08b9596c541edf5aa98b2c83b6","start":96}],"target_id":"concept.wikipedia.automorphism","target_kind":"node","target_sha256":"309154c958f2d4874e9c24a1936c698e30387e3def5508918407d89bc13ecc43"}],"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups":[{"id":"assertion.concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automorphisms of the symmetric and alternating groups as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automorphisms of the symmetric and alternating groups\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","support":[{"end":453,"quote":"In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","source_id":"wikipedia.article.automorphisms-of-the-symmetric-and-alternating-groups","source_sha256":"3e988d04fd44181e2a4482af0493cef971e7ded6245b95a401739c937ca9f81a","start":141}],"target_id":"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","target_kind":"node","target_sha256":"d80081db0015db1727fe1234321ae61bc99a75d709a478a4113a54b2ec6257ce"}],"concept.wikipedia.automotive-fuse":[{"id":"assertion.concept.wikipedia.automotive-fuse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automotive fuse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automotive fuse\", CC BY-SA 4.0) states: Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","support":[{"end":212,"quote":"Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","source_id":"wikipedia.article.automotive-fuse","source_sha256":"821a2a4922a7b5554f7271181e8e4ad9151da7ca4fae64ed2f5d8e1e4418f80d","start":103}],"target_id":"concept.wikipedia.automotive-fuse","target_kind":"node","target_sha256":"345ad2189e912e91e8d59fdb599971eacce8f368b4d10be3d2652dcb7015ba93"}],"concept.wikipedia.autonomous-aircraft":[{"id":"assertion.concept.wikipedia.autonomous-aircraft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous aircraft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous aircraft\", CC BY-SA 4.0) states: An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","support":[{"end":277,"quote":"An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","source_id":"wikipedia.article.autonomous-aircraft","source_sha256":"ba57c39884f9123e8c5dbbd24fcb70f371c28e2c25c21715bf49fd43166af7a2","start":107}],"target_id":"concept.wikipedia.autonomous-aircraft","target_kind":"node","target_sha256":"f56f9c8de6a5ad76e6c2b7bbd7471701dbfc56741fa37106fc15eb7506cd1770"}],"concept.wikipedia.autonomous-circuit":[{"id":"assertion.concept.wikipedia.autonomous-circuit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous circuit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous circuit\", CC BY-SA 4.0) states: An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","support":[{"end":278,"quote":"An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","source_id":"wikipedia.article.autonomous-circuit","source_sha256":"73c83a40db67832d88d7a69828e44eb714a0e6f8714e1d9acf8e4a006e86d8bb","start":106}],"target_id":"concept.wikipedia.autonomous-circuit","target_kind":"node","target_sha256":"959f97919ae903575a50cc127335fac9751c2b6993d84ef7fb6192364a0d249b"}],"concept.wikipedia.autonomous-logistics":[{"id":"assertion.concept.wikipedia.autonomous-logistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous logistics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous logistics\", CC BY-SA 4.0) states: Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","support":[{"end":298,"quote":"Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","source_id":"wikipedia.article.autonomous-logistics","source_sha256":"ee58b2c236ff88acdbd9840979f158a775f989a6289f3600eff879150cba0a78","start":108}],"target_id":"concept.wikipedia.autonomous-logistics","target_kind":"node","target_sha256":"3f1dd7627b794c74aecdbb5e4b876e72ab9b4816b99ce045885d96a6db60c272"}],"concept.wikipedia.autonomous-system-mathematics":[{"id":"assertion.concept.wikipedia.autonomous-system-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomous system (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomous system (mathematics)\", CC BY-SA 4.0) states: In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","support":[{"end":298,"quote":"In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","source_id":"wikipedia.article.autonomous-system-mathematics","source_sha256":"e9695c2e223f54885e9e65dd0e003da731652dac0a6a3aa63c27c2f86af51f29","start":117}],"target_id":"concept.wikipedia.autonomous-system-mathematics","target_kind":"node","target_sha256":"63987586fca7a8f94c4dc2ebd821971f1e27cbd8fbacd1fccbc135dbe93e71d6"}],"concept.wikipedia.autonomy-of-syntax":[{"id":"assertion.concept.wikipedia.autonomy-of-syntax","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autonomy of syntax as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autonomy of syntax\", CC BY-SA 4.0) states: In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","support":[{"end":314,"quote":"In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","source_id":"wikipedia.article.autonomy-of-syntax","source_sha256":"ce3e5ab5b0401dc760c64efda6a3088e52f5ab4e6bf525b4e9616e4e55820d29","start":106}],"target_id":"concept.wikipedia.autonomy-of-syntax","target_kind":"node","target_sha256":"3c2481a00627a8897c15ff99c66e0c24f98cbb2d6b0b78efdc01d1e9b63cc0f9"}],"concept.wikipedia.autopen":[{"id":"assertion.concept.wikipedia.autopen","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Autopen as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Autopen\", CC BY-SA 4.0) states: An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","support":[{"end":240,"quote":"An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","source_id":"wikipedia.article.autopen","source_sha256":"3e533a1c2d2a87e1c998bf087da26b81036a5a6f17ad8417dcc05e2134b4783a","start":94}],"target_id":"concept.wikipedia.autopen","target_kind":"node","target_sha256":"f6d1f307cda0917c2ac6b97935ff9787bffd2ea39999c8c7efb60710ed4b9b7c"}],"concept.wikipedia.availability-cascade":[{"id":"assertion.concept.wikipedia.availability-cascade","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability cascade as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability cascade\", CC BY-SA 4.0) states: An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","support":[{"end":229,"quote":"An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","source_id":"wikipedia.article.availability-cascade","source_sha256":"85a6839f88cbdb3810cd548d84c8060234bbcf71020066a557ced411176c3403","start":108}],"target_id":"concept.wikipedia.availability-cascade","target_kind":"node","target_sha256":"e3f3b83b3a453c2574da1ebbc151c65ca0c2fe52b6247afaf2e047d2abe407ed"}],"concept.wikipedia.availability-heuristic":[{"id":"assertion.concept.wikipedia.availability-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability heuristic\", CC BY-SA 4.0) states: The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","support":[{"end":322,"quote":"The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","source_id":"wikipedia.article.availability-heuristic","source_sha256":"6b8d205bc6bf5f67faaced2b1b936f0fb56a88807eaaa00bcaad4dbf318ea7ae","start":108}],"target_id":"concept.wikipedia.availability-heuristic","target_kind":"node","target_sha256":"5a7ab2ea11bf7e300aafae1c2058288ce399ad332d4565c3bc694f797fbdeffa"}],"concept.wikipedia.availability-zone":[{"id":"assertion.concept.wikipedia.availability-zone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Availability zone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Availability zone\", CC BY-SA 4.0) states: In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","support":[{"end":224,"quote":"In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","source_id":"wikipedia.article.availability-zone","source_sha256":"c2c3d0a0538e0a0216e1b391a757e0360a42cef1d6a6ef14a132c311c6443954","start":105}],"target_id":"concept.wikipedia.availability-zone","target_kind":"node","target_sha256":"36bfc36bac2f75607c60fc9fedb8e5f3ccadde5fe6f7ceb7c5f44d17f8faeb8c"}],"concept.wikipedia.average-treatment-effect":[{"id":"assertion.concept.wikipedia.average-treatment-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Average treatment effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Average treatment effect\", CC BY-SA 4.0) states: The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","support":[{"end":288,"quote":"The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","source_id":"wikipedia.article.average-treatment-effect","source_sha256":"3423a3424ca95fb2b9adc54aae725faa421ae0bcab2bea6bcc8d77808bf556cf","start":112}],"target_id":"concept.wikipedia.average-treatment-effect","target_kind":"node","target_sha256":"e111a45d0bb3c0955bbd6342ea0d40f1a9dc739ae53d2228ad965a39d7eccdb5"}],"concept.wikipedia.avionics":[{"id":"assertion.concept.wikipedia.avionics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Avionics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Avionics\", CC BY-SA 4.0) states: Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","support":[{"end":189,"quote":"Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","source_id":"wikipedia.article.avionics","source_sha256":"dcb48872d325afc7e527700d425b1eb117322c0081482b064068ab5e022e507f","start":92}],"target_id":"concept.wikipedia.avionics","target_kind":"node","target_sha256":"fad0516dd3ce02a5ad5380dda16e093a4cc7da369ba04a147582dd42ebd71280"}],"concept.wikipedia.avulsion-river":[{"id":"assertion.concept.wikipedia.avulsion-river","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Avulsion (river) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Avulsion (river)\", CC BY-SA 4.0) states: In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","support":[{"end":309,"quote":"In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","source_id":"wikipedia.article.avulsion-river","source_sha256":"1338b41307b2f0efd764f7eea9b10da7bf1012a68975f757fba3f3a84a02061a","start":104}],"target_id":"concept.wikipedia.avulsion-river","target_kind":"node","target_sha256":"0831764ae61dbe3bbb3fa91d70d1b5b8866d77e6954af1ff9ddae966d9ee6ff4"}],"concept.wikipedia.axial-fan-design":[{"id":"assertion.concept.wikipedia.axial-fan-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial fan design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial fan design\", CC BY-SA 4.0) states: An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","support":[{"end":263,"quote":"An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","source_id":"wikipedia.article.axial-fan-design","source_sha256":"1db6ed4046f7576b514d70a8b441da808faa2e5b13565ab41db4ad840104913d","start":104}],"target_id":"concept.wikipedia.axial-fan-design","target_kind":"node","target_sha256":"88ae575fefc5893930e06c5db8c268e64f601daeeed818a4627e34479d285bb4"}],"concept.wikipedia.axial-flow-pump":[{"id":"assertion.concept.wikipedia.axial-flow-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial-flow pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial-flow pump\", CC BY-SA 4.0) states: An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","support":[{"end":226,"quote":"An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","source_id":"wikipedia.article.axial-flow-pump","source_sha256":"ebaff606dc0ceac1a93bca8797af00059daa40f16a0d2d9d16b426b444d71e90","start":102}],"target_id":"concept.wikipedia.axial-flow-pump","target_kind":"node","target_sha256":"d3c33e91f26f3aaeb9b27be7192a726d74d3c8baa18087c6bbd3c26c19b8b7cd"}],"concept.wikipedia.axial-flux-motor":[{"id":"assertion.concept.wikipedia.axial-flux-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial flux motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial flux motor\", CC BY-SA 4.0) states: An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","support":[{"end":460,"quote":"An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","source_id":"wikipedia.article.axial-flux-motor","source_sha256":"1747124612c4c34835ad266689216123c20645e7adc47c958ba6a5e731ea9259","start":104}],"target_id":"concept.wikipedia.axial-flux-motor","target_kind":"node","target_sha256":"510bee9f4c52cd2f2879a542b04ca968d3f2f44a8b8ebec8ddf4a499c9476ce2"}],"concept.wikipedia.axial-piston-pump":[{"id":"assertion.concept.wikipedia.axial-piston-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial piston pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial piston pump\", CC BY-SA 4.0) states: An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","support":[{"end":230,"quote":"An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","source_id":"wikipedia.article.axial-piston-pump","source_sha256":"a5b4bc12a4098a7dc4dbbb61445a34c7086524cded2c672ebc98874cfc07dffc","start":104}],"target_id":"concept.wikipedia.axial-piston-pump","target_kind":"node","target_sha256":"2d969f2e49b4f6019360cdf64a17497aad3adb08523c40d57528abf7aa6dbd81"}],"concept.wikipedia.axial-turbine":[{"id":"assertion.concept.wikipedia.axial-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axial turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axial turbine\", CC BY-SA 4.0) states: In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","support":[{"end":301,"quote":"In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","source_id":"wikipedia.article.axial-turbine","source_sha256":"911722de645906a7bf4e20c40550dedc4b89d7b4613e384829cceeaeb7e342a4","start":101}],"target_id":"concept.wikipedia.axial-turbine","target_kind":"node","target_sha256":"51067c8cf3cfc9067d4846c0eabf4b1a7e5116009b9ae57dbd75291bb1515966"}],"concept.wikipedia.axiom-of-countability":[{"id":"assertion.concept.wikipedia.axiom-of-countability","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiom of countability as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiom of countability\", CC BY-SA 4.0) states: In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","support":[{"end":264,"quote":"In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","source_id":"wikipedia.article.axiom-of-countability","source_sha256":"de4802b6229d5a4224a3ca04c2bfd5b371beb67ad81c33147ea6520395ce2097","start":107}],"target_id":"concept.wikipedia.axiom-of-countability","target_kind":"node","target_sha256":"e55e6477cd51f901c47b21f93f7b74dc480a7a4c3c95099b524c2de20d881e9b"}],"concept.wikipedia.axiom-of-reducibility":[{"id":"assertion.concept.wikipedia.axiom-of-reducibility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiom of reducibility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiom of reducibility\", CC BY-SA 4.0) states: The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","support":[{"end":236,"quote":"The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","source_id":"wikipedia.article.axiom-of-reducibility","source_sha256":"419f24f879cd80ad92bcd34cc0fa25b14463f67dcc122baf9783274eb74351de","start":109}],"target_id":"concept.wikipedia.axiom-of-reducibility","target_kind":"node","target_sha256":"ef6b048a1ac6e108bb4cb94db51ad47ab390aea076bc1a8b74cf976a1c304832"}],"concept.wikipedia.axiomatic-design":[{"id":"assertion.concept.wikipedia.axiomatic-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiomatic design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiomatic design\", CC BY-SA 4.0) states: Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","support":[{"end":307,"quote":"Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","source_id":"wikipedia.article.axiomatic-design","source_sha256":"34e7485da98d139089f56013a6ed23f9c50559527f67ed374da2ed66f8b9b656","start":103}],"target_id":"concept.wikipedia.axiomatic-design","target_kind":"node","target_sha256":"94d90e5142642aa60220e77fd93ee9b293bb8449ff4aaf90d976c7298edebdd0"}],"concept.wikipedia.axiomatic-foundations-of-topological-spaces":[{"id":"assertion.concept.wikipedia.axiomatic-foundations-of-topological-spaces","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Axiomatic foundations of topological spaces as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Axiomatic foundations of topological spaces\", CC BY-SA 4.0) states: In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","support":[{"end":235,"quote":"In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","source_id":"wikipedia.article.axiomatic-foundations-of-topological-spaces","source_sha256":"ff2e026ccd7db96f4e19d94afe017d64eefcb6089ef3f9dee106261b28dbecf8","start":130}],"target_id":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","target_kind":"node","target_sha256":"69f286c2622546a48441f4dc35650ed714839d80bf40e522c724472f8e3452eb"}],"concept.wikipedia.b-n-pair":[{"id":"assertion.concept.wikipedia.b-n-pair","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"(B, N) pair as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"(B, N) pair\", CC BY-SA 4.0) states: In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","support":[{"end":277,"quote":"In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","source_id":"wikipedia.article.b-n-pair","source_sha256":"4b4e427c536a9f5b5176fee23934ba593acaf34e62ded88ed2b981b9b29a6b91","start":98}],"target_id":"concept.wikipedia.b-n-pair","target_kind":"node","target_sha256":"3c99bcbd9cd75b2eb8788e3a0c448d3eaa65a7f666a4737ff5dcba0c01a4c973"}],"concept.wikipedia.b-theory-of-time":[{"id":"assertion.concept.wikipedia.b-theory-of-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"B-theory of time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"B-theory of time\", CC BY-SA 4.0) states: The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","support":[{"end":260,"quote":"The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","source_id":"wikipedia.article.b-theory-of-time","source_sha256":"b31451a83150a28de7fa69dc16a525c580495b0e391d5965014061808e14f6d5","start":104}],"target_id":"concept.wikipedia.b-theory-of-time","target_kind":"node","target_sha256":"2cc556136ae14d64a61b5ffb89b4b25848a100d02b2ed0f3061960d5c9f0e76a"}],"concept.wikipedia.baby-step-giant-step":[{"id":"assertion.concept.wikipedia.baby-step-giant-step","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baby-step giant-step as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baby-step giant-step\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","support":[{"end":310,"quote":"In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","source_id":"wikipedia.article.baby-step-giant-step","source_sha256":"85d557eb28bb90e06faf2faa1e8ba2ac6f4a3373c91a018b07f67103b180c9b7","start":106}],"target_id":"concept.wikipedia.baby-step-giant-step","target_kind":"node","target_sha256":"71d1a9537552a55871b84f55cb6f1de027faa4fb7ab90d24eabefe210c0fb7eb"}],"concept.wikipedia.bachmann-howard-ordinal":[{"id":"assertion.concept.wikipedia.bachmann-howard-ordinal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bachmann–Howard ordinal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bachmann–Howard ordinal\", CC BY-SA 4.0) states: In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","support":[{"end":247,"quote":"In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","source_id":"wikipedia.article.bachmann-howard-ordinal","source_sha256":"d767f23e253085f958822239354ed3c0cf6e2cfdc3ca93c9c67eaef49d81e020","start":111}],"target_id":"concept.wikipedia.bachmann-howard-ordinal","target_kind":"node","target_sha256":"20944b4129e16ae250f5ec5247ed34a7c788d4cec6e836be58473c4e1e52d8a7"}],"concept.wikipedia.back-and-forth-method":[{"id":"assertion.concept.wikipedia.back-and-forth-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Back-and-forth method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Back-and-forth method\", CC BY-SA 4.0) states: In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","support":[{"end":303,"quote":"In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","source_id":"wikipedia.article.back-and-forth-method","source_sha256":"126ff9754790d033e584a5425e20ea9029e52342c682198a1ad484e193b5f0a3","start":108}],"target_id":"concept.wikipedia.back-and-forth-method","target_kind":"node","target_sha256":"4fc0043f09ddae41cfa6050478192638095c38b2f6a62d178eea41ff9e72e0c3"}],"concept.wikipedia.backcasting":[{"id":"assertion.concept.wikipedia.backcasting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backcasting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backcasting\", CC BY-SA 4.0) states: Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","support":[{"end":290,"quote":"Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","source_id":"wikipedia.article.backcasting","source_sha256":"11c2890f3b213d6f8e0d54342dc16d55818eaccfccdbf765ad113581c14b1c8c","start":98}],"target_id":"concept.wikipedia.backcasting","target_kind":"node","target_sha256":"6e15eb98784f6c74e3f2e4543cbb55b59f89c09f2d4f04e06291e7f19ff4bc0c"}],"concept.wikipedia.backlash-engineering":[{"id":"assertion.concept.wikipedia.backlash-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backlash (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backlash (engineering)\", CC BY-SA 4.0) states: In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","support":[{"end":263,"quote":"In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","source_id":"wikipedia.article.backlash-engineering","source_sha256":"b6e26f2d1bb7bbd1a874baff923c492c730ed44a9bf813454af4c53de6036df3","start":110}],"target_id":"concept.wikipedia.backlash-engineering","target_kind":"node","target_sha256":"0ddb02a11d6e491b5c6cb4f7e1ef7159ac229fbdd1883e14a38e859b125be1fa"}],"concept.wikipedia.backward-chaining":[{"id":"assertion.concept.wikipedia.backward-chaining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backward chaining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backward chaining\", CC BY-SA 4.0) states: Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","support":[{"end":225,"quote":"Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","source_id":"wikipedia.article.backward-chaining","source_sha256":"e41d6e68a5d5e4fdda9acdee23402ca9d3a5cde65d10ea116d66ce3d11ae0b27","start":103}],"target_id":"concept.wikipedia.backward-chaining","target_kind":"node","target_sha256":"603fcc5085684ad2c196abb5eac5e4c987857742f572198da5218ac367283c71"}],"concept.wikipedia.backward-induction":[{"id":"assertion.concept.wikipedia.backward-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Backward induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Backward induction\", CC BY-SA 4.0) states: Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","support":[{"end":298,"quote":"Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","source_id":"wikipedia.article.backward-induction","source_sha256":"015c3de876a99426fcad512b0b448445e144caafb5d9c10d9b144e665a4a079e","start":105}],"target_id":"concept.wikipedia.backward-induction","target_kind":"node","target_sha256":"20ab9e0be7a162f0707a820563788fe7ef94dc366ebd5f0d00b7b3259085e21d"}],"concept.wikipedia.baconian-method":[{"id":"assertion.concept.wikipedia.baconian-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baconian method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baconian method\", CC BY-SA 4.0) states: The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","support":[{"end":274,"quote":"The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","source_id":"wikipedia.article.baconian-method","source_sha256":"b38d3884a12049790c928275c86c08c484d703095a10ca13f43fa8360618afca","start":100}],"target_id":"concept.wikipedia.baconian-method","target_kind":"node","target_sha256":"7e03301284cffa5cb3a39fda7366058f1c0d6887da48e5763432de70a9c00096"}],"concept.wikipedia.baer-norm":[{"id":"assertion.concept.wikipedia.baer-norm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baer norm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baer norm\", CC BY-SA 4.0) states: In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","support":[{"end":222,"quote":"In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","source_id":"wikipedia.article.baer-norm","source_sha256":"bafd620d1c0c32bc4d3c592971cc37479d8150f563472962f934f2f6e6eb691f","start":96}],"target_id":"concept.wikipedia.baer-norm","target_kind":"node","target_sha256":"829e83eedfd22b59c996ed0c7a48e4b545f598542c762ad1bd8bd3f680796c58"}],"concept.wikipedia.baffle-heat-transfer":[{"id":"assertion.concept.wikipedia.baffle-heat-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baffle (heat transfer) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baffle (heat transfer)\", CC BY-SA 4.0) states: Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","support":[{"end":207,"quote":"Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","source_id":"wikipedia.article.baffle-heat-transfer","source_sha256":"9c70384685135f38bea0f60f8d6029b4f515bb7afa994c058390952c06e3e2c2","start":110}],"target_id":"concept.wikipedia.baffle-heat-transfer","target_kind":"node","target_sha256":"da9ae06b8c1e2e3b88435f85a64579574805e2cd070a3a725d3b876feb89d613"}],"concept.wikipedia.bagel-machine":[{"id":"assertion.concept.wikipedia.bagel-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bagel machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bagel machine\", CC BY-SA 4.0) states: A bagel machine is a machine that automatically produces bagels.","support":[{"end":165,"quote":"A bagel machine is a machine that automatically produces bagels.","source_id":"wikipedia.article.bagel-machine","source_sha256":"d4b26667ba59aa03276838e59dea563608b5c7911385df2e11aab5098eaa9792","start":101}],"target_id":"concept.wikipedia.bagel-machine","target_kind":"node","target_sha256":"1ceb4bd0cdbbd8581b42c298d1eadcc81fd103e6dbcc657192189baf7ef05cb7"}],"concept.wikipedia.baire-one-star-function":[{"id":"assertion.concept.wikipedia.baire-one-star-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire one star function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire one star function\", CC BY-SA 4.0) states: A Baire one star function is a type of function studied in real analysis.","support":[{"end":183,"quote":"A Baire one star function is a type of function studied in real analysis.","source_id":"wikipedia.article.baire-one-star-function","source_sha256":"e765572c674dc711e925227dc0081490800af66d0ad169f57fb2727227c24b8b","start":110}],"target_id":"concept.wikipedia.baire-one-star-function","target_kind":"node","target_sha256":"a53e58047318488dbf64016d68c2bafe003a44384afe342012f879cd49a14f37"}],"concept.wikipedia.baire-space-set-theory":[{"id":"assertion.concept.wikipedia.baire-space-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire space (set theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire space (set theory)\", CC BY-SA 4.0) states: In set theory, the Baire space is the set of all infinite sequences of natural numbers.","support":[{"end":198,"quote":"In set theory, the Baire space is the set of all infinite sequences of natural numbers.","source_id":"wikipedia.article.baire-space-set-theory","source_sha256":"de2ac883a51ab13c03796689cb3d8e50d2fe6d6b13d96dfd1a8e99a5658d3367","start":111}],"target_id":"concept.wikipedia.baire-space-set-theory","target_kind":"node","target_sha256":"d8709ec3beb9691c9e3e557915ba8d74ed8b6f329314587fe761cac8c25dbbdd"}],"concept.wikipedia.baker-clamp":[{"id":"assertion.concept.wikipedia.baker-clamp","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baker clamp as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baker clamp\", CC BY-SA 4.0) states: Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","support":[{"end":316,"quote":"Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","source_id":"wikipedia.article.baker-clamp","source_sha256":"76d5e14709dbd457f7ac093dd64535c0bec17d0055d8a2a19e8dfca118af9648","start":99}],"target_id":"concept.wikipedia.baker-clamp","target_kind":"node","target_sha256":"5b79c4dff8fb4ee97c64199acf9d712eb2e1c8fbef42150348c5646cbf7bd649"}],"concept.wikipedia.balancing-lake":[{"id":"assertion.concept.wikipedia.balancing-lake","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Balancing lake as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Balancing lake\", CC BY-SA 4.0) states: A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","support":[{"end":253,"quote":"A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","source_id":"wikipedia.article.balancing-lake","source_sha256":"01cae08d9c34318143e0efbc367d9776bf38e0b343705eddfeb13172f5a31b9e","start":101}],"target_id":"concept.wikipedia.balancing-lake","target_kind":"node","target_sha256":"55c9825ba12c179ce94ca4e8dfc5cde112c348d671cc8e5e51371e63509f3f28"}],"concept.wikipedia.ball-bearing":[{"id":"assertion.concept.wikipedia.ball-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball (bearing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball (bearing)\", CC BY-SA 4.0) states: Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","support":[{"end":264,"quote":"Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","source_id":"wikipedia.article.ball-bearing","source_sha256":"de9fe8ad6a434f06d5526e8fa0c3ba048d5ed892abf28682ab871b378cb14097","start":102}],"target_id":"concept.wikipedia.ball-bearing","target_kind":"node","target_sha256":"b5782c7f160d3780438312132ce6477eb7592412ff697063c61c0dc82231c998"}],"concept.wikipedia.ball-detent":[{"id":"assertion.concept.wikipedia.ball-detent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball detent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball detent\", CC BY-SA 4.0) states: A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","support":[{"end":231,"quote":"A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","source_id":"wikipedia.article.ball-detent","source_sha256":"7247cb062903625bfd8884503f0bc4c2cfdbbe7701387dc6e38b64d9713f7c7b","start":98}],"target_id":"concept.wikipedia.ball-detent","target_kind":"node","target_sha256":"de1781f6b3e6c53c552df910f87cb59eaa986d8fed95c35cb832ae09e8fcf7db"}],"concept.wikipedia.ball-differential":[{"id":"assertion.concept.wikipedia.ball-differential","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball differential as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball differential\", CC BY-SA 4.0) states: A ball differential is a type of differential typically used on radio-controlled cars.","support":[{"end":190,"quote":"A ball differential is a type of differential typically used on radio-controlled cars.","source_id":"wikipedia.article.ball-differential","source_sha256":"a3c91920ead8c0c627b17d9995120805938b68368656ad2c8cb2721bf6ee21a6","start":104}],"target_id":"concept.wikipedia.ball-differential","target_kind":"node","target_sha256":"14c252353ea2a5bc3d8253ad1b6425482d3342c7efcf1c7c2e80d83c7b10975a"}],"concept.wikipedia.ball-joint":[{"id":"assertion.concept.wikipedia.ball-joint","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball joint as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball joint\", CC BY-SA 4.0) states: In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","support":[{"end":254,"quote":"In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","source_id":"wikipedia.article.ball-joint","source_sha256":"c18b1abc38b8bcc3136d3806abb90b5ecffbbde42f72d9d00ac0b8fb582da0f2","start":97}],"target_id":"concept.wikipedia.ball-joint","target_kind":"node","target_sha256":"825fa0b556c7dbed75dfceb634f921d37cf44ba5e2bfd9cd31476c72c36f903b"}],"concept.wikipedia.ball-mathematics":[{"id":"assertion.concept.wikipedia.ball-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball (mathematics)\", CC BY-SA 4.0) states: In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","support":[{"end":201,"quote":"In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","source_id":"wikipedia.article.ball-mathematics","source_sha256":"a1679b3104731aa1c62b711098e376339643b542b547f0d2ada3bf3b3e790394","start":104}],"target_id":"concept.wikipedia.ball-mathematics","target_kind":"node","target_sha256":"4ffe23e542c86dd8c21207b2aa8f03bf94c0fc3fb016191b3acb91183d0cb7b7"}],"concept.wikipedia.ball-screw":[{"id":"assertion.concept.wikipedia.ball-screw","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball screw as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball screw\", CC BY-SA 4.0) states: A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","support":[{"end":229,"quote":"A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","source_id":"wikipedia.article.ball-screw","source_sha256":"f5060692f8f3bf9b3873714db46c5fbf4736c679e921653bc47112de029e7509","start":97}],"target_id":"concept.wikipedia.ball-screw","target_kind":"node","target_sha256":"72e53ef93fad6c919d4e3c16a51f60ce4423d5db1d26fb9dc3484a8a80b4a6f0"}],"concept.wikipedia.ball-valve":[{"id":"assertion.concept.wikipedia.ball-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ball valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ball valve\", CC BY-SA 4.0) states: A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","support":[{"end":253,"quote":"A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","source_id":"wikipedia.article.ball-valve","source_sha256":"57cf19c866df1b986ecf949b9774adc6dd0bd02de6b8d3225f5b729871801056","start":96}],"target_id":"concept.wikipedia.ball-valve","target_kind":"node","target_sha256":"7ce4ebdf6fba1843f7b0b3cb6a784f347b4529de44e63d9228ae187a7f28985e"}],"concept.wikipedia.ballast":[{"id":"assertion.concept.wikipedia.ballast","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ballast as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ballast\", CC BY-SA 4.0) states: Ballast is dense material used as a weight to provide stability to a vehicle or structure.","support":[{"end":185,"quote":"Ballast is dense material used as a weight to provide stability to a vehicle or structure.","source_id":"wikipedia.article.ballast","source_sha256":"c3a88a1ec213b7976794d807e3b3a4a61ac624384008696e81fbd9178bd77aed","start":95}],"target_id":"concept.wikipedia.ballast","target_kind":"node","target_sha256":"599ba1a0b362bd47af942a5fceff5234d94565502d20760797b1af8769c24183"}],"concept.wikipedia.ban-number":[{"id":"assertion.concept.wikipedia.ban-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ban number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ban number\", CC BY-SA 4.0) states: In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \"banned.\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","support":[{"end":404,"quote":"In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \\\"banned.\\\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","source_id":"wikipedia.article.ban-number","source_sha256":"25b9e712ce2f3e83fb07a63ec52e47da39227155013f716a285378b33287eb7b","start":97}],"target_id":"concept.wikipedia.ban-number","target_kind":"node","target_sha256":"e4a7c5b384cb2b0624abca219360b2b0fdcadb5db1c73de67d2e114d0abaac05"}],"concept.wikipedia.bandgap-voltage-reference":[{"id":"assertion.concept.wikipedia.bandgap-voltage-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bandgap voltage reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bandgap voltage reference\", CC BY-SA 4.0) states: A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","support":[{"end":205,"quote":"A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","source_id":"wikipedia.article.bandgap-voltage-reference","source_sha256":"5a4d4bd1eeba4d7664633ba880b953e7f1294126170043b207100d8dc35c6d04","start":111}],"target_id":"concept.wikipedia.bandgap-voltage-reference","target_kind":"node","target_sha256":"86c7fbe6b15e32429c90fd2690e38e8f5208f320ac5243bcdb58d59c75c92da4"}],"concept.wikipedia.bandwagon-effect":[{"id":"assertion.concept.wikipedia.bandwagon-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bandwagon effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bandwagon effect\", CC BY-SA 4.0) states: The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","support":[{"end":247,"quote":"The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","source_id":"wikipedia.article.bandwagon-effect","source_sha256":"e6692def41a6da861b303e11d46851e1a021b72e736148528a015942addb2d42","start":102}],"target_id":"concept.wikipedia.bandwagon-effect","target_kind":"node","target_sha256":"aad1880230023d600ec3faf6a4ba86853c535644466a0c2567b8587e65779261"}],"concept.wikipedia.bar-complex":[{"id":"assertion.concept.wikipedia.bar-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bar complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bar complex\", CC BY-SA 4.0) states: In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","support":[{"end":284,"quote":"In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","source_id":"wikipedia.article.bar-complex","source_sha256":"71a4fb74a48e1a97d8e54f23844318e154d2b5e5ac187ab3d7b310f0cbf88f2a","start":99}],"target_id":"concept.wikipedia.bar-complex","target_kind":"node","target_sha256":"cf20265f1a420fcaaeb00841f88fb5c7e88086ab55dc2e4cac317d31061b7e28"}],"concept.wikipedia.barkhausen-stability-criterion":[{"id":"assertion.concept.wikipedia.barkhausen-stability-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barkhausen stability criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barkhausen stability criterion\", CC BY-SA 4.0) states: In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","support":[{"end":258,"quote":"In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","source_id":"wikipedia.article.barkhausen-stability-criterion","source_sha256":"1ad2708566c613e1e76130d464bb2ec318e49c7eb8b0c02d00ec5f4c95a3008d","start":118}],"target_id":"concept.wikipedia.barkhausen-stability-criterion","target_kind":"node","target_sha256":"b7dee0b5c3ec51ade5120333918abe324d609dbe5ef735addbd674a6f40e5414"}],"concept.wikipedia.barlow-s-wheel":[{"id":"assertion.concept.wikipedia.barlow-s-wheel","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barlow's wheel as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barlow's wheel\", CC BY-SA 4.0) states: Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","support":[{"end":243,"quote":"Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","source_id":"wikipedia.article.barlow-s-wheel","source_sha256":"5011831772abf511b7567a6ac3290bff74b4a2ee751280ce51052e5670589a5e","start":100}],"target_id":"concept.wikipedia.barlow-s-wheel","target_kind":"node","target_sha256":"038becdd515cab94e1999b2ef8929aa0dae2a4ff7b4f97e5ad966c18205e9df8"}],"concept.wikipedia.barn-raising":[{"id":"assertion.concept.wikipedia.barn-raising","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barn raising as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barn raising\", CC BY-SA 4.0) states: A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","support":[{"end":245,"quote":"A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","source_id":"wikipedia.article.barn-raising","source_sha256":"8bdb643588acfcf6426781038fcca96e5092d8168089a19e15e9b32631cb6ee1","start":98}],"target_id":"concept.wikipedia.barn-raising","target_kind":"node","target_sha256":"0c376eea48087d4abd11cb6076c746b2d8c45ea4ab8dbeb2bfe38c80b88244e2"}],"concept.wikipedia.barycentric-coordinate-system":[{"id":"assertion.concept.wikipedia.barycentric-coordinate-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barycentric coordinate system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barycentric coordinate system\", CC BY-SA 4.0) states: In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","support":[{"end":349,"quote":"In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","source_id":"wikipedia.article.barycentric-coordinate-system","source_sha256":"60fd51e3c9facb1569b7d0a7d54db42cfbfdd6bfbe08683e27ca3097b1608fb7","start":115}],"target_id":"concept.wikipedia.barycentric-coordinate-system","target_kind":"node","target_sha256":"b356510e5dde392313924a7e239fc7129bd79daa3a7ed314000af617d3af62d9"}],"concept.wikipedia.barycentric-subdivision":[{"id":"assertion.concept.wikipedia.barycentric-subdivision","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Barycentric subdivision as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Barycentric subdivision\", CC BY-SA 4.0) states: In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","support":[{"end":218,"quote":"In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","source_id":"wikipedia.article.barycentric-subdivision","source_sha256":"951afc877a6c9fbb8b7fbfa05a355eb7f38579ad981ec104306b67ffbd9f2078","start":109}],"target_id":"concept.wikipedia.barycentric-subdivision","target_kind":"node","target_sha256":"9fecc54b2beabf7eb64ea0e349d6cbe7a0123d8959c5c83c4e69d71a0be1edac"}],"concept.wikipedia.base-50":[{"id":"assertion.concept.wikipedia.base-50","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Base 50 as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Base 50\", CC BY-SA 4.0) states: A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","support":[{"end":249,"quote":"A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","source_id":"wikipedia.article.base-50","source_sha256":"d7b82105b8e2049f55bcbaea759cfd3335c0c8d4e75bcdffee8568fc6cc43dca","start":95}],"target_id":"concept.wikipedia.base-50","target_kind":"node","target_sha256":"8db237b7762e792a2475e097811410b838c56b98c2cd5e4ff95fbd8684d1ddaa"}],"concept.wikipedia.base-unit-of-measurement":[{"id":"assertion.concept.wikipedia.base-unit-of-measurement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Base unit of measurement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Base unit of measurement\", CC BY-SA 4.0) states: A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","support":[{"end":243,"quote":"A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","source_id":"wikipedia.article.base-unit-of-measurement","source_sha256":"48ca80987fdbcf1c7219a7e0922df3a31e0073779ab10964f3be40619be57bd3","start":109}],"target_id":"concept.wikipedia.base-unit-of-measurement","target_kind":"node","target_sha256":"fad73c22b535153a120ec8f4dbaa0c43ab62d7490e8422df4ddf9139dbb43da9"}],"concept.wikipedia.basic-belief":[{"id":"assertion.concept.wikipedia.basic-belief","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basic belief as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basic belief\", CC BY-SA 4.0) states: Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism, the axioms of a belief system.","support":[{"end":264,"quote":"Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism,  the axioms of a belief system.","source_id":"wikipedia.article.basic-belief","source_sha256":"f4eb37f4cc6c0359e7c3c2e92b7ef17d765f20a7b0759ecc82a6ec97d2d6ff49","start":99}],"target_id":"concept.wikipedia.basic-belief","target_kind":"node","target_sha256":"320579906742bb0e1673cdfe7a323c14e845775ee63512058395d3edb969ac44"}],"concept.wikipedia.basis-function":[{"id":"assertion.concept.wikipedia.basis-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basis function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basis function\", CC BY-SA 4.0) states: In mathematics, a basis function is an element of a particular basis for a function space.","support":[{"end":189,"quote":"In mathematics, a basis function is an element of a particular basis for a function space.","source_id":"wikipedia.article.basis-function","source_sha256":"46ca4b760cc8d109468bafbd9edb53989c3bc505ece7bda26e1a7976dcc89e01","start":99}],"target_id":"concept.wikipedia.basis-function","target_kind":"node","target_sha256":"5fd6a6c283fdf149f6f48ec0a01d263d1528179f19aee9720e9642dfd6a661c9"}],"concept.wikipedia.basis-linear-algebra":[{"id":"assertion.concept.wikipedia.basis-linear-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Basis (linear algebra) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Basis (linear algebra)\", CC BY-SA 4.0) states: In mathematics, a set B of elements of a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","support":[{"end":468,"quote":"In mathematics, a set B of elements of  a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","source_id":"wikipedia.article.basis-linear-algebra","source_sha256":"b22eb31230e9b11ea718c201ade1e0f87239bfb05934b5ba098cc24c795f3e0e","start":107}],"target_id":"concept.wikipedia.basis-linear-algebra","target_kind":"node","target_sha256":"8bf7884fb2ccc3abac2a6ae586a767beff8f653cdb577ee3908e037efd2f6056"}],"concept.wikipedia.bateman-transform":[{"id":"assertion.concept.wikipedia.bateman-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bateman transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bateman transform\", CC BY-SA 4.0) states: In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","support":[{"end":357,"quote":"In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","source_id":"wikipedia.article.bateman-transform","source_sha256":"a565aa271c2afa96e4224ad587ffd12736c714071b4271fc0299900c0850afba","start":105}],"target_id":"concept.wikipedia.bateman-transform","target_kind":"node","target_sha256":"ed36765d5b0a76f39f88d7686cdf39e5ad3f0d23dd68cad22573909216a8ee79"}],"concept.wikipedia.bathtub-curve":[{"id":"assertion.concept.wikipedia.bathtub-curve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bathtub curve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bathtub curve\", CC BY-SA 4.0) states: In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","support":[{"end":254,"quote":"In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","source_id":"wikipedia.article.bathtub-curve","source_sha256":"59070032c6c82e768dbbe76d9cd315063e4d0f35ca41c6dcf6ebc2b7fab23ad1","start":100}],"target_id":"concept.wikipedia.bathtub-curve","target_kind":"node","target_sha256":"0505b5086d6a81294191f85b5d7f67cf6770f3aabd683cccafda3c61b21a993f"}],"concept.wikipedia.bating-leather":[{"id":"assertion.concept.wikipedia.bating-leather","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bating (leather) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bating (leather)\", CC BY-SA 4.0) states: Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","support":[{"end":469,"quote":"Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","source_id":"wikipedia.article.bating-leather","source_sha256":"d3a6408f5ae621cf4fdad2ba88e5d2abeb69b499ac5c2428c4d36e3f33a29851","start":104}],"target_id":"concept.wikipedia.bating-leather","target_kind":"node","target_sha256":"7563d0553fb938418f02e75c21d771fb64d33f60c549b21f220008939e365fbe"}],"concept.wikipedia.baubotanik":[{"id":"assertion.concept.wikipedia.baubotanik","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baubotanik as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baubotanik\", CC BY-SA 4.0) states: Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","support":[{"end":237,"quote":"Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","source_id":"wikipedia.article.baubotanik","source_sha256":"34a9aa1dcbcc81ddc89b2eaeadfe6ba79ea49ba7081810e4cac8fffb7c00f683","start":98}],"target_id":"concept.wikipedia.baubotanik","target_kind":"node","target_sha256":"f91be3bf9e825ff22a751144797566d634f680bbbb3eff3b41292a91c12452b4"}],"concept.wikipedia.bauschinger-effect":[{"id":"assertion.concept.wikipedia.bauschinger-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bauschinger effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bauschinger effect\", CC BY-SA 4.0) states: The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","support":[{"end":287,"quote":"The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","source_id":"wikipedia.article.bauschinger-effect","source_sha256":"63301d914370385cf21e2c69ca2d4845d343e94a02ceb2c53c861f13f1ca5039","start":105}],"target_id":"concept.wikipedia.bauschinger-effect","target_kind":"node","target_sha256":"ce29bb17b94c962b60eb6acc8ca4ea64e72a7d739e52d7ffc4470b79b448270f"}],"concept.wikipedia.bayonet-mount":[{"id":"assertion.concept.wikipedia.bayonet-mount","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bayonet mount as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bayonet mount\", CC BY-SA 4.0) states: A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","support":[{"end":471,"quote":"A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","source_id":"wikipedia.article.bayonet-mount","source_sha256":"d3d644f11748a0f67b9d9c838da10d1c85033c39290bac79fe1723846c4dc5db","start":100}],"target_id":"concept.wikipedia.bayonet-mount","target_kind":"node","target_sha256":"02e7ef9c97f3004124467edb03d6bc732f85d4700561de444cad3988432ed470"}],"concept.wikipedia.beam-bridge":[{"id":"assertion.concept.wikipedia.beam-bridge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beam bridge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beam bridge\", CC BY-SA 4.0) states: Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","support":[{"end":207,"quote":"Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","source_id":"wikipedia.article.beam-bridge","source_sha256":"01f9484aaba94f976bfc217dd43c5b9bfa0f179afa64416167c8be0355644d1b","start":98}],"target_id":"concept.wikipedia.beam-bridge","target_kind":"node","target_sha256":"4b27ac2b4fc4596477824dc8cff1b42c95c20c84ac3b77aa71da3ba15c74f6de"}],"concept.wikipedia.beam-structure":[{"id":"assertion.concept.wikipedia.beam-structure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beam (structure) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beam (structure)\", CC BY-SA 4.0) states: A beam is a structural element designed to carry loads perpendicular to its long (or \"horizontal\") axis.","support":[{"end":208,"quote":"A beam is a structural element designed to carry loads perpendicular to its long (or \\\"horizontal\\\") axis.","source_id":"wikipedia.article.beam-structure","source_sha256":"2b74e5d16d7757644e5c9b0e23b742780d6869b33514fcecad0f4854d291d86c","start":102}],"target_id":"concept.wikipedia.beam-structure","target_kind":"node","target_sha256":"cdaa3b4a509b59e97bfa572cdf112425329582a1f636d7ccbd61590127e10a64"}],"concept.wikipedia.beamline":[{"id":"assertion.concept.wikipedia.beamline","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beamline as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beamline\", CC BY-SA 4.0) states: In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","support":[{"end":318,"quote":"In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","source_id":"wikipedia.article.beamline","source_sha256":"9dcc4e0c0553e4bd51a502755ad606ad6a0103dc64b38ed9cc99026365679631","start":94}],"target_id":"concept.wikipedia.beamline","target_kind":"node","target_sha256":"8fbcd62035ffdf9933acd81191686b08ed9690fb6dc92c3580a63a5483617fe4"}],"concept.wikipedia.bearing-pressure":[{"id":"assertion.concept.wikipedia.bearing-pressure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bearing pressure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bearing pressure\", CC BY-SA 4.0) states: Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","support":[{"end":319,"quote":"Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","source_id":"wikipedia.article.bearing-pressure","source_sha256":"42727eca41b1ac661bab6b6bab9721af12fdbf003b0e066e58098e6baf395f91","start":104}],"target_id":"concept.wikipedia.bearing-pressure","target_kind":"node","target_sha256":"389771418e2b826df97c254cddcf74da987516e4cca3ac8afb7ebbd638dc15dd"}],"concept.wikipedia.bearing-surface":[{"id":"assertion.concept.wikipedia.bearing-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bearing surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bearing surface\", CC BY-SA 4.0) states: A bearing surface in mechanical engineering is the area of contact between two objects.","support":[{"end":190,"quote":"A bearing surface in mechanical engineering is the area of contact between two objects.","source_id":"wikipedia.article.bearing-surface","source_sha256":"3c25d1dce9080e726daa4bd5c913aaac634c205a39079d8e471e1d93912b49af","start":103}],"target_id":"concept.wikipedia.bearing-surface","target_kind":"node","target_sha256":"9effd893443065078b37221a6a22d9a4d1cebe4b20bc38302457b55c1fe95b75"}],"concept.wikipedia.beatty-sequence":[{"id":"assertion.concept.wikipedia.beatty-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beatty sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beatty sequence\", CC BY-SA 4.0) states: In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","support":[{"end":298,"quote":"In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","source_id":"wikipedia.article.beatty-sequence","source_sha256":"dc7158123e5cac5d93f283572b0941f9e37e8622dc13bc12e60d0f1aecfd6a79","start":102}],"target_id":"concept.wikipedia.beatty-sequence","target_kind":"node","target_sha256":"b3637eb7d034d73457e3ab5a1c418a74e3ad3c381562b4990437dc2437af498a"}],"concept.wikipedia.beer-engine":[{"id":"assertion.concept.wikipedia.beer-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beer engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beer engine\", CC BY-SA 4.0) states: A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","support":[{"end":188,"quote":"A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","source_id":"wikipedia.article.beer-engine","source_sha256":"05147fc5798e55d64b25514f281ff8292eff566ca20c4335940dc665e5664c5b","start":98}],"target_id":"concept.wikipedia.beer-engine","target_kind":"node","target_sha256":"634f39be739173373b4f4bc52b1e82b4eea0377377567f1ddb219127652d6949"}],"concept.wikipedia.beer-tap":[{"id":"assertion.concept.wikipedia.beer-tap","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beer tap as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beer tap\", CC BY-SA 4.0) states: A beer tap is a valved device for controlling the release of beer.","support":[{"end":160,"quote":"A beer tap is a valved device for controlling the release of beer.","source_id":"wikipedia.article.beer-tap","source_sha256":"6a3d07e489cf216225844f2e3efe907999777eafefed074285096e6206023dc3","start":94}],"target_id":"concept.wikipedia.beer-tap","target_kind":"node","target_sha256":"92faf772f61e4f9fa0ecc0242a0a705ce6ceaf13a2091045cc4dba1458d1a2d8"}],"concept.wikipedia.begging-the-question":[{"id":"assertion.concept.wikipedia.begging-the-question","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Begging the question as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Begging the question\", CC BY-SA 4.0) states: In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","support":[{"end":313,"quote":"In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","source_id":"wikipedia.article.begging-the-question","source_sha256":"1ad5c0c73dd43abaeaf3f4dcffd735615ce6da0459dc2324564259817e5aa9d5","start":105}],"target_id":"concept.wikipedia.begging-the-question","target_kind":"node","target_sha256":"2fd6d402eed2d2a4780bbd91e5a1818d7dc54b4082b74537a1c30f82f148cf0a"}],"concept.wikipedia.behavior-based-robotics":[{"id":"assertion.concept.wikipedia.behavior-based-robotics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behavior-based robotics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behavior-based robotics\", CC BY-SA 4.0) states: Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","support":[{"end":404,"quote":"Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","source_id":"wikipedia.article.behavior-based-robotics","source_sha256":"70bcbc7f7df6f3247acf7dec205a99bd042075e454ad87b10c205d14f2f9ef80","start":109}],"target_id":"concept.wikipedia.behavior-based-robotics","target_kind":"node","target_sha256":"4b4ad09251154db2e1a227f596124c52b8fa5ae37da7a716f58331b467e3ebcc"}],"concept.wikipedia.behavior-tree":[{"id":"assertion.concept.wikipedia.behavior-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behavior tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behavior tree\", CC BY-SA 4.0) states: A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","support":[{"end":241,"quote":"A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","source_id":"wikipedia.article.behavior-tree","source_sha256":"17d71d4c5ba391ec4948f439cc15f4dbb4e7df1f07a15fae11793b4abfddb6a9","start":101}],"target_id":"concept.wikipedia.behavior-tree","target_kind":"node","target_sha256":"76488d54324cb2730640a0769da39dead009353a66e264c0e2bdfb6808a77ce8"}],"concept.wikipedia.behrend-sequence":[{"id":"assertion.concept.wikipedia.behrend-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Behrend sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Behrend sequence\", CC BY-SA 4.0) states: In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","support":[{"end":208,"quote":"In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","source_id":"wikipedia.article.behrend-sequence","source_sha256":"ee7f01a49ef252232b7ff4d30dd1016db7361b23682a098ca201845123943a7f","start":104}],"target_id":"concept.wikipedia.behrend-sequence","target_kind":"node","target_sha256":"e51fc812cc0750448da52996c29c38128fb828d96264be0eb837137dbf2a8a08"}],"concept.wikipedia.belief":[{"id":"assertion.concept.wikipedia.belief","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief\", CC BY-SA 4.0) states: A belief is a subjective attitude that something is true or a state of affairs is the case.","support":[{"end":183,"quote":"A belief is a subjective attitude that something is true or a state of affairs is the case.","source_id":"wikipedia.article.belief","source_sha256":"87686ccf400255dbaec83df45d47fab8a02552f1f022d7708cf9a15e9cf3a64e","start":92}],"target_id":"concept.wikipedia.belief","target_kind":"node","target_sha256":"78d289c8b0a5393a109a85c4a7a527e5cca368f6b5bf83ef8b67bdf9c1185991"}],"concept.wikipedia.belief-desire-intention-model":[{"id":"assertion.concept.wikipedia.belief-desire-intention-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief–desire–intention model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief–desire–intention model\", CC BY-SA 4.0) states: For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","support":[{"end":291,"quote":"For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","source_id":"wikipedia.article.belief-desire-intention-model","source_sha256":"042937fec851fb465dd5c893135c4faa622f9d7a28d91581720b5fc3eaac5197","start":116}],"target_id":"concept.wikipedia.belief-desire-intention-model","target_kind":"node","target_sha256":"4e5b51fdc22c9b134cc03b7b7b3bee1f78104e6f0b7873b4ff30d772603eb4cf"}],"concept.wikipedia.belief-revision":[{"id":"assertion.concept.wikipedia.belief-revision","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belief revision as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belief revision\", CC BY-SA 4.0) states: Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","support":[{"end":229,"quote":"Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","source_id":"wikipedia.article.belief-revision","source_sha256":"c6ac8d5bbaa70be2b75e2d60aeeadbc4b4a9c0be21bf8956da9b6cf8dc2866dd","start":102}],"target_id":"concept.wikipedia.belief-revision","target_kind":"node","target_sha256":"7ce3d286b9aae7237b6b2ac141df828fb4b08d6481f41b43c94f22acb4e583f0"}],"concept.wikipedia.bell-nipple":[{"id":"assertion.concept.wikipedia.bell-nipple","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bell nipple as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bell nipple\", CC BY-SA 4.0) states: A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","support":[{"end":328,"quote":"A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","source_id":"wikipedia.article.bell-nipple","source_sha256":"ed93e9d0f0b9521c1f3f7c6ce51f3b23ed43638f4c5b656b6df4ef8b27a04275","start":99}],"target_id":"concept.wikipedia.bell-nipple","target_kind":"node","target_sha256":"6a420b580d5a83366357048e0f13f6540152d6ac41a32113f4192852c35fa90f"}],"concept.wikipedia.bell-polynomials":[{"id":"assertion.concept.wikipedia.bell-polynomials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bell polynomials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bell polynomials\", CC BY-SA 4.0) states: In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","support":[{"end":230,"quote":"In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","source_id":"wikipedia.article.bell-polynomials","source_sha256":"ad726b2cf38b2d06c4dbd52e2a64823da60458cdaa9fa9e83d70dde1a40f6207","start":102}],"target_id":"concept.wikipedia.bell-polynomials","target_kind":"node","target_sha256":"becac1119715960c887120725c3b153c704123c5eab02da6b81076593cb56521"}],"concept.wikipedia.belt-mechanical":[{"id":"assertion.concept.wikipedia.belt-mechanical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Belt (mechanical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Belt (mechanical)\", CC BY-SA 4.0) states: A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","support":[{"end":217,"quote":"A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","source_id":"wikipedia.article.belt-mechanical","source_sha256":"02bdc37bbf865c1cd94ce58810ec3eb73cd4a0c9ac9c4c914ec0f04f7ddd91b7","start":104}],"target_id":"concept.wikipedia.belt-mechanical","target_kind":"node","target_sha256":"af02468a051fd63d02562bd3b4f6ec5c0eb0f8590e4a2e27e9d97965834ae8fd"}],"concept.wikipedia.benacerraf-s-identification-problem":[{"id":"assertion.concept.wikipedia.benacerraf-s-identification-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Benacerraf's identification problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Benacerraf's identification problem\", CC BY-SA 4.0) states: In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \"What Numbers Could Not Be\".","support":[{"end":357,"quote":"In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \\\"What Numbers Could Not Be\\\".","source_id":"wikipedia.article.benacerraf-s-identification-problem","source_sha256":"a9cdc12cbd03732f979710a02782c2fb6d740eb2e7529434634bb08ee0f15bf7","start":123}],"target_id":"concept.wikipedia.benacerraf-s-identification-problem","target_kind":"node","target_sha256":"f0858e159391f3285cc05d266ec0773f9d9e52538ad65dea9f6aca3f86adde10"}],"concept.wikipedia.bending-moment":[{"id":"assertion.concept.wikipedia.bending-moment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bending moment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bending moment\", CC BY-SA 4.0) states: In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","support":[{"end":245,"quote":"In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","source_id":"wikipedia.article.bending-moment","source_sha256":"9616ed9b33b59dc804e1b5894ee9c213e03b03c9f277f3133d1a79927f799226","start":101}],"target_id":"concept.wikipedia.bending-moment","target_kind":"node","target_sha256":"476dc5345d86dc48d0da5ddc0509727f0996928d992fe6c0428d7cdbb34463a4"}],"concept.wikipedia.bendix-drive":[{"id":"assertion.concept.wikipedia.bendix-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bendix drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bendix drive\", CC BY-SA 4.0) states: A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","support":[{"end":203,"quote":"A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","source_id":"wikipedia.article.bendix-drive","source_sha256":"a43aa49e787a14fd99ad01e248242e3c8d1cb06fae8939a8a6dd0ab87175635c","start":100}],"target_id":"concept.wikipedia.bendix-drive","target_kind":"node","target_sha256":"bce4410fc81fdead33accd0bbf3e8436d48b05a3eac55577774da85c210bb91e"}],"concept.wikipedia.bent-structural":[{"id":"assertion.concept.wikipedia.bent-structural","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bent (structural) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bent (structural)\", CC BY-SA 4.0) states: A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","support":[{"end":212,"quote":"A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","source_id":"wikipedia.article.bent-structural","source_sha256":"dbba1ccfdc6d7a793f9165b46e564022e1027cd1941af913a01ff9b39d9b87b2","start":105}],"target_id":"concept.wikipedia.bent-structural","target_kind":"node","target_sha256":"0cb414e18d8abeb59622319c34277fbe7305aa9f38a29ec81581f7b44d450a70"}],"concept.wikipedia.bentley-s-paradox":[{"id":"assertion.concept.wikipedia.bentley-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bentley's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bentley's paradox\", CC BY-SA 4.0) states: In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","support":[{"end":319,"quote":"In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox  or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","source_id":"wikipedia.article.bentley-s-paradox","source_sha256":"117a23cae32ff2f23191178dc21453f3cafa8b327a4f54ec1cd66b456f306463","start":105}],"target_id":"concept.wikipedia.bentley-s-paradox","target_kind":"node","target_sha256":"ae666f8c69c5fb16466cbf34e3e996153eebb8e68ba371b123d83a35cf8f1bec"}],"concept.wikipedia.bergeron-diagram":[{"id":"assertion.concept.wikipedia.bergeron-diagram","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bergeron diagram as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bergeron diagram\", CC BY-SA 4.0) states: The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","support":[{"end":207,"quote":"The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","source_id":"wikipedia.article.bergeron-diagram","source_sha256":"b4c0fb4b1f96fde6a2b242200d2ee15e23b63855ec9daaff9ab48db0b9582dbc","start":104}],"target_id":"concept.wikipedia.bergeron-diagram","target_kind":"node","target_sha256":"b19ef93e6f6547e64b55602ebf8e045571136fb07ae49ab13267030480f5f60e"}],"concept.wikipedia.bernstein-polynomial":[{"id":"assertion.concept.wikipedia.bernstein-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein polynomial\", CC BY-SA 4.0) states: In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","support":[{"end":259,"quote":"In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","source_id":"wikipedia.article.bernstein-polynomial","source_sha256":"58b6a2f018b755ba9f9c76d547a2175f54a0014f296889abd494f3bc949dc51b","start":106}],"target_id":"concept.wikipedia.bernstein-polynomial","target_kind":"node","target_sha256":"d1a3356528a3cbbea82377886ca992bcfe5d6f8fcdc1ec7a6982eb836e26732f"}],"concept.wikipedia.bernstein-s-constant":[{"id":"assertion.concept.wikipedia.bernstein-s-constant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein's constant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein's constant\", CC BY-SA 4.0) states: Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","support":[{"end":276,"quote":"Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","source_id":"wikipedia.article.bernstein-s-constant","source_sha256":"ed533a076f9e7f1c159972c065c84e3d7d4aba1609a41a4b0a17a4abf71456c7","start":108}],"target_id":"concept.wikipedia.bernstein-s-constant","target_kind":"node","target_sha256":"6415dd91c27720c550e677f28a737056236b1a8a11dae368600a8a55844ee0c8"}],"concept.wikipedia.bernstein-sato-polynomial":[{"id":"assertion.concept.wikipedia.bernstein-sato-polynomial","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bernstein–Sato polynomial as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bernstein–Sato polynomial\", CC BY-SA 4.0) states: In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","support":[{"end":322,"quote":"In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","source_id":"wikipedia.article.bernstein-sato-polynomial","source_sha256":"251246ada33c8b6071543d24a9cd32c67218334c3bf3686715ede6c821dedbf5","start":112}],"target_id":"concept.wikipedia.bernstein-sato-polynomial","target_kind":"node","target_sha256":"5402919b35799216526c3ddcb7ec2099f8a325b5f3031f102fe7499d442bfbfc"}],"concept.wikipedia.berry-robbins-problem":[{"id":"assertion.concept.wikipedia.berry-robbins-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Berry–Robbins problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Berry–Robbins problem\", CC BY-SA 4.0) states: In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","support":[{"end":327,"quote":"In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","source_id":"wikipedia.article.berry-robbins-problem","source_sha256":"2d8a37531bb9ba8fc58054d4a3e187819a740d3b6873d453010408d586bf5a44","start":109}],"target_id":"concept.wikipedia.berry-robbins-problem","target_kind":"node","target_sha256":"ad0ea6ad9d853714458947edbf788c06e469e6a70a41e22857199b35d0985bc5"}],"concept.wikipedia.bessel-function":[{"id":"assertion.concept.wikipedia.bessel-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bessel function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bessel function\", CC BY-SA 4.0) states: Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","support":[{"end":289,"quote":"Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","source_id":"wikipedia.article.bessel-function","source_sha256":"cb33e4c5b945878b009546f1b8aefe30496ae8b31bcc45e41c2d8c46c27ea831","start":99}],"target_id":"concept.wikipedia.bessel-function","target_kind":"node","target_sha256":"1de25b2dba7043f95e20cd4fcf2194a0cc056e1d1db2f413a74061d93e2aeaf5"}],"concept.wikipedia.best-management-practice-for-water-pollution":[{"id":"assertion.concept.wikipedia.best-management-practice-for-water-pollution","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Best management practice for water pollution as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Best management practice for water pollution\", CC BY-SA 4.0) states: Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","support":[{"end":257,"quote":"Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","source_id":"wikipedia.article.best-management-practice-for-water-pollution","source_sha256":"2c268648da5aa3882cefc0ec5ece6a42832b55e4c9d8459aced6ba9a752f47b3","start":131}],"target_id":"concept.wikipedia.best-management-practice-for-water-pollution","target_kind":"node","target_sha256":"1cc1ac15374acb73ef08a36afd8ca32e85275ce86319d54a0f505ed25f532b3c"}],"concept.wikipedia.best-of-all-possible-worlds":[{"id":"assertion.concept.wikipedia.best-of-all-possible-worlds","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Best of all possible worlds as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Best of all possible worlds\", CC BY-SA 4.0) states: The phrase \"the best of all possible worlds\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","support":[{"end":560,"quote":"The phrase \\\"the best of all possible worlds\\\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","source_id":"wikipedia.article.best-of-all-possible-worlds","source_sha256":"1bd0744fd9316c2c7bdf4ac50eb4d72a83ad874d446c36c112ac380fdd433baa","start":114}],"target_id":"concept.wikipedia.best-of-all-possible-worlds","target_kind":"node","target_sha256":"6d01698e95ce6082b9f658a2c93e52a73886cd6168b69779784f3549056c24c6"}],"concept.wikipedia.beta-model":[{"id":"assertion.concept.wikipedia.beta-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beta-model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beta-model\", CC BY-SA 4.0) states: In model theory, a mathematical discipline, a β-model (from the French \"bon ordre\", well-ordering) is a model that is correct about statements of the form \"X is well-ordered\".","support":[{"end":277,"quote":"In model theory, a mathematical discipline, a β-model (from the French \\\"bon ordre\\\", well-ordering) is a model that is correct about statements of the form \\\"X is well-ordered\\\".","source_id":"wikipedia.article.beta-model","source_sha256":"679142b1fdc511c34556809cb6322a359aa9b36f35f67cbdbf5355fea34a126f","start":98}],"target_id":"concept.wikipedia.beta-model","target_kind":"node","target_sha256":"6b0609b3a9f09476f8ada803f3dc251e93e4a581b8de326e2250183d3b390c50"}],"concept.wikipedia.betavoltaic-device":[{"id":"assertion.concept.wikipedia.betavoltaic-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Betavoltaic device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Betavoltaic device\", CC BY-SA 4.0) states: A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","support":[{"end":339,"quote":"A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","source_id":"wikipedia.article.betavoltaic-device","source_sha256":"9e98f420e5c3ac0bdbd83121d719147be1c09e772e8d159b7fcde92bede36c29","start":105}],"target_id":"concept.wikipedia.betavoltaic-device","target_kind":"node","target_sha256":"c2b8c387fec0b613d95f36d3ab044bd1b13ba51e8ee6bfcb0ffe09fa6b59a0c8"}],"concept.wikipedia.betweenness-problem":[{"id":"assertion.concept.wikipedia.betweenness-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Betweenness problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Betweenness problem\", CC BY-SA 4.0) states: Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","support":[{"end":266,"quote":"Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","source_id":"wikipedia.article.betweenness-problem","source_sha256":"b34230f2df73fa74f16b16fc9527e86230f4df13b4fc93eee5219072b1f5b7d9","start":106}],"target_id":"concept.wikipedia.betweenness-problem","target_kind":"node","target_sha256":"7b373f4c0a5a56bbfceac20bf4cac60f265ee0e610177fd5df39ebfae8519aed"}],"concept.wikipedia.bevel-gear":[{"id":"assertion.concept.wikipedia.bevel-gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bevel gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bevel gear\", CC BY-SA 4.0) states: Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","support":[{"end":238,"quote":"Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","source_id":"wikipedia.article.bevel-gear","source_sha256":"8fd204fd4471982b53e0dc6b115f3077624057e63aace4e5bbcad3099aff520d","start":97}],"target_id":"concept.wikipedia.bevel-gear","target_kind":"node","target_sha256":"557b33a7ed8276c8e76aa1a6adfca54945440c0ffa79032bb51a92f53786b92a"}],"concept.wikipedia.biasing":[{"id":"assertion.concept.wikipedia.biasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biasing\", CC BY-SA 4.0) states: In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","support":[{"end":262,"quote":"In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","source_id":"wikipedia.article.biasing","source_sha256":"5e9beed0304f23862503f6e546edfe56843f3f02a23dc8f549935d0843843c6f","start":94}],"target_id":"concept.wikipedia.biasing","target_kind":"node","target_sha256":"5248c2a60acda6f46e3e0f303a365607457493a178d38d72aaa79de967740cf3"}],"concept.wikipedia.bicircular-matroid":[{"id":"assertion.concept.wikipedia.bicircular-matroid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicircular matroid as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicircular matroid\", CC BY-SA 4.0) states: In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","support":[{"end":393,"quote":"In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","source_id":"wikipedia.article.bicircular-matroid","source_sha256":"4f042ffe5d995588398387931b21b9b8c6dbaece1a016584de13b8eae51db92b","start":106}],"target_id":"concept.wikipedia.bicircular-matroid","target_kind":"node","target_sha256":"61c7a4e9e3ebae99fc3b200c1bc9605416be90dcaaf7f5a3f1a01bc46d917243"}],"concept.wikipedia.bicoherence":[{"id":"assertion.concept.wikipedia.bicoherence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicoherence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicoherence\", CC BY-SA 4.0) states: In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","support":[{"end":238,"quote":"In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","source_id":"wikipedia.article.bicoherence","source_sha256":"d719f5a1568b4ddd3edc710d24512b70d8304905aecf9ba1b79d04839fba1fdd","start":98}],"target_id":"concept.wikipedia.bicoherence","target_kind":"node","target_sha256":"3874584bc3c89ab4084daeaff09a6aa4dcf7fce8fb7fedf88ef27e627a352bc1"}],"concept.wikipedia.bicycle-tree":[{"id":"assertion.concept.wikipedia.bicycle-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bicycle tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bicycle tree\", CC BY-SA 4.0) states: A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","support":[{"end":201,"quote":"A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","source_id":"wikipedia.article.bicycle-tree","source_sha256":"f740763bf1adb4b5e1a399ea79bfaf05f0f62e9c048aad93563d9f3aabb4cacc","start":100}],"target_id":"concept.wikipedia.bicycle-tree","target_kind":"node","target_sha256":"0d62c29b7611caf9a58563c2be3042b82bdb467af025b36516a2fe17e76107c3"}],"concept.wikipedia.bifacial-solar-cells":[{"id":"assertion.concept.wikipedia.bifacial-solar-cells","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bifacial solar cells as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bifacial solar cells\", CC BY-SA 4.0) states: A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","support":[{"end":230,"quote":"A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","source_id":"wikipedia.article.bifacial-solar-cells","source_sha256":"a8fc23231e54e112e79049522e33a61a7736cfcfd08b45473734cf01b8e21f9b","start":108}],"target_id":"concept.wikipedia.bifacial-solar-cells","target_kind":"node","target_sha256":"8f37f1b0ba115f7634608af0556093d835c61914a032f2b5f5b2ac572e3b0d00"}],"concept.wikipedia.big-m-method":[{"id":"assertion.concept.wikipedia.big-m-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big M method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big M method\", CC BY-SA 4.0) states: In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","support":[{"end":220,"quote":"In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","source_id":"wikipedia.article.big-m-method","source_sha256":"c6ff20415586050051deae2e39df733b187e312f6325b4825b1c9f7ff1d8e972","start":100}],"target_id":"concept.wikipedia.big-m-method","target_kind":"node","target_sha256":"84e6b0729906a5b829a08c9c8b34578b63bb0d6d086bbf6cf1a04f20e096aa27"}],"concept.wikipedia.big-stan-drill-rig":[{"id":"assertion.concept.wikipedia.big-stan-drill-rig","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big Stan (drill rig) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big Stan (drill rig)\", CC BY-SA 4.0) states: Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","support":[{"end":183,"quote":"Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","source_id":"wikipedia.article.big-stan-drill-rig","source_sha256":"4fcee60a3ae3cbe2813bda95c87bec605182a3d6643e23c3fbd0600de41a83a0","start":108}],"target_id":"concept.wikipedia.big-stan-drill-rig","target_kind":"node","target_sha256":"776e8f65672f23d803d4a70f30e208d0fcb3aaf8ca86694893f9815a8d8a212b"}],"concept.wikipedia.bigdog":[{"id":"assertion.concept.wikipedia.bigdog","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"BigDog as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"BigDog\", CC BY-SA 4.0) states: BigDog is a dynamically stable quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","support":[{"end":253,"quote":"BigDog is a dynamically stable  quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","source_id":"wikipedia.article.bigdog","source_sha256":"0fa4daebbb98a6e88aa7f2f82a1a7b746c85011eb9b06338476f4534706618eb","start":93}],"target_id":"concept.wikipedia.bigdog","target_kind":"node","target_sha256":"9ec4275ed02b15810d67f3ce9b6b80034a79b2874a83c1daec6383222338e79f"}],"concept.wikipedia.bilge-pump":[{"id":"assertion.concept.wikipedia.bilge-pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bilge pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bilge pump\", CC BY-SA 4.0) states: A bilge pump is a water pump used to remove bilge water.","support":[{"end":153,"quote":"A bilge pump is a water pump used to remove bilge water.","source_id":"wikipedia.article.bilge-pump","source_sha256":"27cedd39ea1a3c571e92d99f38f43fad76f2e0f0dd1bdf8faa71999112aaa3a9","start":97}],"target_id":"concept.wikipedia.bilge-pump","target_kind":"node","target_sha256":"1c276b0dff281f91cb94d44b5caa1ddc3d62b632a1020e083dcf341ae61f862b"}],"concept.wikipedia.bill-of-materials":[{"id":"assertion.concept.wikipedia.bill-of-materials","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bill of materials as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bill of materials\", CC BY-SA 4.0) states: A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","support":[{"end":358,"quote":"A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","source_id":"wikipedia.article.bill-of-materials","source_sha256":"b2ee992f9a030f41eb2f0a7704e17dddc9b47d1d138525b5cb714593bbf4a055","start":104}],"target_id":"concept.wikipedia.bill-of-materials","target_kind":"node","target_sha256":"05aeb87048b51b6c0ef6a8cf591d5393fbfed81c2ecce4e400735d32a0932247"}],"concept.wikipedia.bill-of-quantities":[{"id":"assertion.concept.wikipedia.bill-of-quantities","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bill of quantities as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bill of quantities\", CC BY-SA 4.0) states: A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","support":[{"end":255,"quote":"A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","source_id":"wikipedia.article.bill-of-quantities","source_sha256":"8fd25e3885a76692d8c24fa155290148a31b3faddfd5e2a60f905fa640e57ecb","start":105}],"target_id":"concept.wikipedia.bill-of-quantities","target_kind":"node","target_sha256":"b7fb7137947222f708beaeaa76a775925544c564681cfff1eda82a9187b1fc4d"}],"concept.wikipedia.bimodule":[{"id":"assertion.concept.wikipedia.bimodule","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bimodule as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bimodule\", CC BY-SA 4.0) states: In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","support":[{"end":246,"quote":"In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","source_id":"wikipedia.article.bimodule","source_sha256":"8294cb851d3ccc225cf14218d373bc4c61fabdce91439cd1fb68ef7957d881f1","start":94}],"target_id":"concept.wikipedia.bimodule","target_kind":"node","target_sha256":"9875f7b4130bd8f5c85811138a18decef7343a7d4c13e9979c0b41c5a03fe2fd"}],"concept.wikipedia.bin-tipper":[{"id":"assertion.concept.wikipedia.bin-tipper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bin tipper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bin tipper\", CC BY-SA 4.0) states: A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","support":[{"end":262,"quote":"A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","source_id":"wikipedia.article.bin-tipper","source_sha256":"3b9bcad4c62e572586d52944d0a5d5bcf5713a0e5ac9ab015da09362b8c0c8ba","start":98}],"target_id":"concept.wikipedia.bin-tipper","target_kind":"node","target_sha256":"725e23f4c566c47281bbe978c3670d96ea7bfadd562c17745670df44c92b8597"}],"concept.wikipedia.binary-opposition":[{"id":"assertion.concept.wikipedia.binary-opposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Binary opposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Binary opposition\", CC BY-SA 4.0) states: A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","support":[{"end":213,"quote":"A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","source_id":"wikipedia.article.binary-opposition","source_sha256":"00b1d30808de0177154929a4dab0fed2112b560ab2069e580334fefabf2fbe78","start":104}],"target_id":"concept.wikipedia.binary-opposition","target_kind":"node","target_sha256":"4f418c2be9cc4fc680759ea195e7b7c0612691419d20b42e97343ed6ea80dfee"}],"concept.wikipedia.binder-clip":[{"id":"assertion.concept.wikipedia.binder-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Binder clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Binder clip\", CC BY-SA 4.0) states: A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","support":[{"end":277,"quote":"A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","source_id":"wikipedia.article.binder-clip","source_sha256":"0d3b4e25f41988ecba9bfd131e9e77bb310fea9167c87f74cee6d3e4258eefbb","start":97}],"target_id":"concept.wikipedia.binder-clip","target_kind":"node","target_sha256":"3d7bc04ead284067f6ff604fba8d35674ac79e7b6a0cca7cca9c2ebf1466afcc"}],"concept.wikipedia.bioactive-paper":[{"id":"assertion.concept.wikipedia.bioactive-paper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bioactive paper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bioactive paper\", CC BY-SA 4.0) states: Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","support":[{"end":200,"quote":"Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","source_id":"wikipedia.article.bioactive-paper","source_sha256":"4cf0b60c9e67be702b084c64e92e70bdc1004316404efd9dcf87c0e10bb63b10","start":103}],"target_id":"concept.wikipedia.bioactive-paper","target_kind":"node","target_sha256":"12c82f173c60a8f6c9e16ff41fcaf85d49cea84f69f5eeceb6e0a3dedb0a5068"}],"concept.wikipedia.biofilter":[{"id":"assertion.concept.wikipedia.biofilter","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biofilter as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biofilter\", CC BY-SA 4.0) states: Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","support":[{"end":236,"quote":"Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","source_id":"wikipedia.article.biofilter","source_sha256":"7148f9019c65b945fe9048c584ea2cc7c75694ad4b9321818b606cc7f649f897","start":96}],"target_id":"concept.wikipedia.biofilter","target_kind":"node","target_sha256":"8e33233071a4d024c94ae6fbf20757fb37fe08463dc72631039e97975de576a1"}],"concept.wikipedia.biological-determinism":[{"id":"assertion.concept.wikipedia.biological-determinism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biological determinism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biological determinism\", CC BY-SA 4.0) states: Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","support":[{"end":395,"quote":"Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","source_id":"wikipedia.article.biological-determinism","source_sha256":"e0b525222306de2278c0c278e2b053473a0ba5ca4c515369aa7c48b17b54a3e4","start":107}],"target_id":"concept.wikipedia.biological-determinism","target_kind":"node","target_sha256":"1e24f000e06b065a057d1fd2d2e4b9bacd959e63d71e0d4d328edb51b95e9e83"}],"concept.wikipedia.biomachining":[{"id":"assertion.concept.wikipedia.biomachining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biomachining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biomachining\", CC BY-SA 4.0) states: Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","support":[{"end":320,"quote":"Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","source_id":"wikipedia.article.biomachining","source_sha256":"eeffa77fd91fa1bf663947b0f8192458d8300f6b622ea4050905678100487ace","start":100}],"target_id":"concept.wikipedia.biomachining","target_kind":"node","target_sha256":"86654cc013ef0437f7a3a72c9941c613cfcf2d670cddfee39d1c33833c20b74a"}],"concept.wikipedia.bipolar-electric-motor":[{"id":"assertion.concept.wikipedia.bipolar-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bipolar electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bipolar electric motor\", CC BY-SA 4.0) states: A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","support":[{"end":212,"quote":"A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","source_id":"wikipedia.article.bipolar-electric-motor","source_sha256":"f307afed91a7245585fa60f980bf083a5dfab75d727250ca00299b3ad2a37d7e","start":110}],"target_id":"concept.wikipedia.bipolar-electric-motor","target_kind":"node","target_sha256":"f91e9dd871d8ece841058aac043fec74d23b8a7d2dd2878e0a3d87ceced348bb"}],"concept.wikipedia.bipolar-transistor-biasing":[{"id":"assertion.concept.wikipedia.bipolar-transistor-biasing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bipolar transistor biasing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bipolar transistor biasing\", CC BY-SA 4.0) states: Biasing is the setting of the DC operating point of an electronic component.","support":[{"end":190,"quote":"Biasing is the setting of the DC operating point of an electronic component.","source_id":"wikipedia.article.bipolar-transistor-biasing","source_sha256":"5a648a08c426b3fa3b37ba38fc14b1a72e9323a81290e943230e654ca17de8a2","start":114}],"target_id":"concept.wikipedia.bipolar-transistor-biasing","target_kind":"node","target_sha256":"6b07c1c9adfa26461c90730145b0efc745f3bea061830c28e757bf3fa614b4a0"}],"concept.wikipedia.biryukov-equation":[{"id":"assertion.concept.wikipedia.biryukov-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biryukov equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biryukov equation\", CC BY-SA 4.0) states: In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","support":[{"end":307,"quote":"In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","source_id":"wikipedia.article.biryukov-equation","source_sha256":"78c45549d75985d44340e95a020fce71e017fb1ef6a083c1975e71d4a09aa459","start":105}],"target_id":"concept.wikipedia.biryukov-equation","target_kind":"node","target_sha256":"8174f5d4f07e26bdd47db74a15f3dbd1bbae3e47deb050c9b66400a77d6cef6c"}],"concept.wikipedia.bispectrum":[{"id":"assertion.concept.wikipedia.bispectrum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bispectrum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bispectrum\", CC BY-SA 4.0) states: In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","support":[{"end":222,"quote":"In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","source_id":"wikipedia.article.bispectrum","source_sha256":"f774b49adfed437fa33ed82be73174be98091fa6360fc74b9b638edeaba1dc9f","start":97}],"target_id":"concept.wikipedia.bispectrum","target_kind":"node","target_sha256":"9d410f023f52a857cfaf5b6638d6bd11894549aefaad61009777bdc267a11d90"}],"concept.wikipedia.bitopological-space":[{"id":"assertion.concept.wikipedia.bitopological-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bitopological space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bitopological space\", CC BY-SA 4.0) states: In mathematics, a bitopological space is a set endowed with two topologies.","support":[{"end":181,"quote":"In mathematics, a bitopological space is a set endowed with two topologies.","source_id":"wikipedia.article.bitopological-space","source_sha256":"ea95528134e018ebb22263aca9cc96200a9dbc6706aa84ac6fd3e94848c0c9cd","start":106}],"target_id":"concept.wikipedia.bitopological-space","target_kind":"node","target_sha256":"da6c10a6deffb7968b1db4443f8c47ce5dc05bc090466b8af5701506b78a4a27"}],"concept.wikipedia.black-swan-theory":[{"id":"assertion.concept.wikipedia.black-swan-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Black swan theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Black swan theory\", CC BY-SA 4.0) states: The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","support":[{"end":328,"quote":"The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","source_id":"wikipedia.article.black-swan-theory","source_sha256":"10bd4594933a8930ce93ed8230d2eadc0424a41be02a195ea9f8623683c76278","start":104}],"target_id":"concept.wikipedia.black-swan-theory","target_kind":"node","target_sha256":"d92ee5f522123cd651b43e232cc3ee24cffc8123f0542b3dd484c75cee1af355"}],"concept.wikipedia.blackwell-girshick-equation":[{"id":"assertion.concept.wikipedia.blackwell-girshick-equation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blackwell-Girshick equation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blackwell-Girshick equation\", CC BY-SA 4.0) states: The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","support":[{"end":267,"quote":"The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","source_id":"wikipedia.article.blackwell-girshick-equation","source_sha256":"e145086ef417acfb4476009b56e1559f2fb33280a3c4d3d629c3d1fa22d81363","start":115}],"target_id":"concept.wikipedia.blackwell-girshick-equation","target_kind":"node","target_sha256":"ec44bbec26d35718c27fcea874f9f0ae330ae4bf76463f07a8e06e703a9f5246"}],"concept.wikipedia.blaschke-sum":[{"id":"assertion.concept.wikipedia.blaschke-sum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blaschke sum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blaschke sum\", CC BY-SA 4.0) states: In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","support":[{"end":295,"quote":"In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","source_id":"wikipedia.article.blaschke-sum","source_sha256":"86a6d86e41b43cee14018f9643e94cbc4c162dc7f14906f1d59d64cd8d048b1c","start":100}],"target_id":"concept.wikipedia.blaschke-sum","target_kind":"node","target_sha256":"2260b05bd8fcec1b499896c0a94e8c74844cec0cea2f3cbc9b62850e2ade56fe"}],"concept.wikipedia.blast-valve":[{"id":"assertion.concept.wikipedia.blast-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blast valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blast valve\", CC BY-SA 4.0) states: A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","support":[{"end":235,"quote":"A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","source_id":"wikipedia.article.blast-valve","source_sha256":"7352a9c2075259050a6bb62ed2c57136727017311d2a314d5b0222528a278c91","start":98}],"target_id":"concept.wikipedia.blast-valve","target_kind":"node","target_sha256":"3ee2ad0d5eb49105048bffc170b344c306cf99a16661d718dd846d7e8b52fc7a"}],"concept.wikipedia.blind-men-and-an-elephant":[{"id":"assertion.concept.wikipedia.blind-men-and-an-elephant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blind men and an elephant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blind men and an elephant\", CC BY-SA 4.0) states: The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","support":[{"end":305,"quote":"The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","source_id":"wikipedia.article.blind-men-and-an-elephant","source_sha256":"6a4785e0ab0c6ae9e60cae2b10e3301b458968668fc304609de9de57f3b42ed1","start":112}],"target_id":"concept.wikipedia.blind-men-and-an-elephant","target_kind":"node","target_sha256":"3e4c4b63470b9c0fccbd738de66231df3d420057bf4ec88182199936ba4268eb"}],"concept.wikipedia.blinded-experiment":[{"id":"assertion.concept.wikipedia.blinded-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blinded experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blinded experiment\", CC BY-SA 4.0) states: In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","support":[{"end":247,"quote":"In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","source_id":"wikipedia.article.blinded-experiment","source_sha256":"eb0200f74a02f6411816cc05198717fad7fe1d7be1146974a416808ca1bab2ef","start":104}],"target_id":"concept.wikipedia.blinded-experiment","target_kind":"node","target_sha256":"053718a284dff52d94d49c9538a5293821f304c3a022e47bc9dad3e13fa8e6f9"}],"concept.wikipedia.block-and-tackle":[{"id":"assertion.concept.wikipedia.block-and-tackle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Block and tackle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Block and tackle\", CC BY-SA 4.0) states: A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","support":[{"end":271,"quote":"A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","source_id":"wikipedia.article.block-and-tackle","source_sha256":"a5dd7eb775e0dd42918bb89acc86e0f84b1fecf2a6900408d2370cd3587b314f","start":102}],"target_id":"concept.wikipedia.block-and-tackle","target_kind":"node","target_sha256":"3828ddbfe4878610a621c21ddf8c3aac5b57f7444c3fc58f84e7983283e836b9"}],"concept.wikipedia.block-matrix-pseudoinverse":[{"id":"assertion.concept.wikipedia.block-matrix-pseudoinverse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Block matrix pseudoinverse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Block matrix pseudoinverse\", CC BY-SA 4.0) states: In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","support":[{"end":217,"quote":"In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","source_id":"wikipedia.article.block-matrix-pseudoinverse","source_sha256":"3c167c699d663f2c30b3157f9592e64b96b010ecb32d1bfe2fd0e782266c2730","start":113}],"target_id":"concept.wikipedia.block-matrix-pseudoinverse","target_kind":"node","target_sha256":"960d6bf4cee8a1c8b6355f2a2ef9c570ed116d6f4c87041625545bd26a79a9cf"}],"concept.wikipedia.blockhead-thought-experiment":[{"id":"assertion.concept.wikipedia.blockhead-thought-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blockhead (thought experiment) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blockhead (thought experiment)\", CC BY-SA 4.0) states: Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \"Psychologism and Behaviorism\".","support":[{"end":293,"quote":"Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \\\"Psychologism and Behaviorism\\\".","source_id":"wikipedia.article.blockhead-thought-experiment","source_sha256":"2cf6cdde4945b091add2dc096478d0f3e78c17fb189b381ed0bca5739023f422","start":117}],"target_id":"concept.wikipedia.blockhead-thought-experiment","target_kind":"node","target_sha256":"5cc17b6901bd9629d279c73385d2914851a05180319da94029c2ab46146bd0a2"}],"concept.wikipedia.blowpipe-tool":[{"id":"assertion.concept.wikipedia.blowpipe-tool","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blowpipe (tool) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blowpipe (tool)\", CC BY-SA 4.0) states: A blowpipe is one of several tools used to direct streams of gases into any of several working media.","support":[{"end":203,"quote":"A blowpipe is one of several tools used to direct streams of gases into any of several working media.","source_id":"wikipedia.article.blowpipe-tool","source_sha256":"979ef30aec16753d01ae9a590bbe8b1ed7afafdade000c529020ff87808eec2f","start":102}],"target_id":"concept.wikipedia.blowpipe-tool","target_kind":"node","target_sha256":"7a848689aec45e8ece39bc35312fd4728cd168306969b824cfcb34643eebcd87"}],"concept.wikipedia.blue-skies-research":[{"id":"assertion.concept.wikipedia.blue-skies-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Blue skies research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Blue skies research\", CC BY-SA 4.0) states: Blue skies research, also called blue sky science, is scientific research in domains where \"real-world\" applications are not immediately apparent.","support":[{"end":255,"quote":"Blue skies research, also called blue sky science, is scientific research in domains where \\\"real-world\\\" applications are not immediately apparent.","source_id":"wikipedia.article.blue-skies-research","source_sha256":"d1cebcea17216ee788ad9386e00078179abf68bbcef045add408cccc64d7b222","start":107}],"target_id":"concept.wikipedia.blue-skies-research","target_kind":"node","target_sha256":"52b79196d20f36659b41175a51a9f497a53baa731f85f5ba22309310ed5efdf0"}],"concept.wikipedia.bodenstein-number":[{"id":"assertion.concept.wikipedia.bodenstein-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bodenstein number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bodenstein number\", CC BY-SA 4.0) states: The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","support":[{"end":345,"quote":"The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","source_id":"wikipedia.article.bodenstein-number","source_sha256":"c5385ef923d52f56a1ebd8243cee7643e32feab345161587e04c314be69ae5e0","start":105}],"target_id":"concept.wikipedia.bodenstein-number","target_kind":"node","target_sha256":"40b12de1e89eab34b032307a26a682f9df09f3e205e219fac83bc3cc25fff546"}],"concept.wikipedia.body-on-frame":[{"id":"assertion.concept.wikipedia.body-on-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Body-on-frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Body-on-frame\", CC BY-SA 4.0) states: Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","support":[{"end":429,"quote":"Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","source_id":"wikipedia.article.body-on-frame","source_sha256":"b7db0c6bf1b4645c2340354d97304d76af9783662ec19098b87b14c9ce1c9e5e","start":100}],"target_id":"concept.wikipedia.body-on-frame","target_kind":"node","target_sha256":"719bb57e6f77e6b42624919efaec22556d25ddb6429d987fa5f4f2d2b60ee813"}],"concept.wikipedia.bogdanov-map":[{"id":"assertion.concept.wikipedia.bogdanov-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bogdanov map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bogdanov map\", CC BY-SA 4.0) states: In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","support":[{"end":209,"quote":"In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","source_id":"wikipedia.article.bogdanov-map","source_sha256":"bcf06d7af5565788550e35d463189537053c5154db2d63327899ffbddc257c9a","start":100}],"target_id":"concept.wikipedia.bogdanov-map","target_kind":"node","target_sha256":"3143023645888e56e2e68a3655e0fffcd42a72fea9022c47e53273e265fd2629"}],"concept.wikipedia.bold-hypothesis":[{"id":"assertion.concept.wikipedia.bold-hypothesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bold hypothesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bold hypothesis\", CC BY-SA 4.0) states: Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","support":[{"end":330,"quote":"Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","source_id":"wikipedia.article.bold-hypothesis","source_sha256":"aa2b079caf41c8da4c8859d8348a1a87d518651c4acd6cf330508eca2cafaafe","start":103}],"target_id":"concept.wikipedia.bold-hypothesis","target_kind":"node","target_sha256":"08a005123da567f65892b2839793b0278cf4386f4a440c47cec65858cfd38381"}],"concept.wikipedia.bolometer":[{"id":"assertion.concept.wikipedia.bolometer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bolometer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bolometer\", CC BY-SA 4.0) states: A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","support":[{"end":221,"quote":"A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","source_id":"wikipedia.article.bolometer","source_sha256":"b79b1425df17479df338ccbac2afafb35f27c0a0ddbc6c04b7e4fd3b993502db","start":94}],"target_id":"concept.wikipedia.bolometer","target_kind":"node","target_sha256":"5dd8f2a2dd950448da207123160293f164d90973a4f228881c25d6ce6bafb8cd"}],"concept.wikipedia.bolt-snap":[{"id":"assertion.concept.wikipedia.bolt-snap","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bolt snap as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bolt snap\", CC BY-SA 4.0) states: A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","support":[{"end":298,"quote":"A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","source_id":"wikipedia.article.bolt-snap","source_sha256":"d56aba556bdba8c415b32db1802b910237286e64c6e0ad91ca25c19288ed29bc","start":97}],"target_id":"concept.wikipedia.bolt-snap","target_kind":"node","target_sha256":"493b8ecd41a08a92201c684943eb81236d5b0d4cbaf8c64f46aa75648369f393"}],"concept.wikipedia.boolean-differential-calculus":[{"id":"assertion.concept.wikipedia.boolean-differential-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean differential calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean differential calculus\", CC BY-SA 4.0) states: Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","support":[{"end":299,"quote":"Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","source_id":"wikipedia.article.boolean-differential-calculus","source_sha256":"b6a13cb3dc0dde3fae6f66eded188e236946e36430c0b5aa9c5cdf30ccec638f","start":117}],"target_id":"concept.wikipedia.boolean-differential-calculus","target_kind":"node","target_sha256":"661607a8fad5f9682b5405e77d9ecee2b6aaf672ad75b37d12282b257d19a144"}],"concept.wikipedia.boolean-valued-model":[{"id":"assertion.concept.wikipedia.boolean-valued-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean-valued model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean-valued model\", CC BY-SA 4.0) states: In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","support":[{"end":236,"quote":"In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","source_id":"wikipedia.article.boolean-valued-model","source_sha256":"ad32be15dbc3b3160b2cda1f5817937bc0fd3a5e61034284824bbbeaf8081479","start":107}],"target_id":"concept.wikipedia.boolean-valued-model","target_kind":"node","target_sha256":"f68215fc71b76593ea913380d92dba2ae09d60aa8b550e6a66606bd46e90fb33"}],"concept.wikipedia.bootstrapping-electronics":[{"id":"assertion.concept.wikipedia.bootstrapping-electronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bootstrapping (electronics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bootstrapping (electronics)\", CC BY-SA 4.0) states: Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","support":[{"end":227,"quote":"Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","source_id":"wikipedia.article.bootstrapping-electronics","source_sha256":"d2b7281b72593d5a036c50f5cd9d10072f9cc96288cecb9d2fd588a9757fc41b","start":114}],"target_id":"concept.wikipedia.bootstrapping-electronics","target_kind":"node","target_sha256":"810587f2f4acfda8b7c441222d278d8024ff6c602014ce69e82f317b668123e8"}],"concept.wikipedia.borel-set":[{"id":"assertion.concept.wikipedia.borel-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Borel set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Borel set\", CC BY-SA 4.0) states: In mathematics, the Borel sets of a topological space are a particular class of \"well-behaved\" subsets of that space.","support":[{"end":213,"quote":"In mathematics, the Borel sets of a topological space are a particular class of \\\"well-behaved\\\" subsets of that space.","source_id":"wikipedia.article.borel-set","source_sha256":"56962fcdc37a06fd95969d061f458f9a00ee22635f5438cd314cb0eb4ea9ab8a","start":94}],"target_id":"concept.wikipedia.borel-set","target_kind":"node","target_sha256":"2a083a253bcb98bcd45d6d2d2771082aecd5b7b9068012e38943916499abc79c"}],"concept.wikipedia.boring-manufacturing":[{"id":"assertion.concept.wikipedia.boring-manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boring (manufacturing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boring (manufacturing)\", CC BY-SA 4.0) states: In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","support":[{"end":351,"quote":"In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","source_id":"wikipedia.article.boring-manufacturing","source_sha256":"26506fb607da6f509abf0c4a545e130737b9572daeee328f30924b763fca1830","start":109}],"target_id":"concept.wikipedia.boring-manufacturing","target_kind":"node","target_sha256":"5bcda36a0dd06f0695d1a371909a9f182c13ab7d354f7b9e1f131edb5fa4f3c7"}],"concept.wikipedia.both-and-reasoning":[{"id":"assertion.concept.wikipedia.both-and-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Both/and reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Both/and reasoning\", CC BY-SA 4.0) states: Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","support":[{"end":227,"quote":"Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","source_id":"wikipedia.article.both-and-reasoning","source_sha256":"468785dee4e09f54c4ea349c2fc3dd8c6e2b91c87eb72673ac33a484afcc6e7a","start":106}],"target_id":"concept.wikipedia.both-and-reasoning","target_kind":"node","target_sha256":"4e17ca64891f05d9ebb98e59f229a44fc9afc7fd7c9b9f8d5faa571f8ba1cbd5"}],"concept.wikipedia.boundary-topology":[{"id":"assertion.concept.wikipedia.boundary-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boundary (topology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boundary (topology)\", CC BY-SA 4.0) states: In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","support":[{"end":416,"quote":"In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","source_id":"wikipedia.article.boundary-topology","source_sha256":"0d21fc056f56105dca6aedacb0151f9d78b771dff46d13e7a26f5023fad23e94","start":104}],"target_id":"concept.wikipedia.boundary-topology","target_kind":"node","target_sha256":"0c557d0a2a5c341a095029366cd4bbaecf15abf307c9ec279ef4a8243eb55fed"}],"concept.wikipedia.boundary-work":[{"id":"assertion.concept.wikipedia.boundary-work","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boundary-work as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boundary-work\", CC BY-SA 4.0) states: Boundary-work is part of science studies.","support":[{"end":141,"quote":"Boundary-work is part of science studies.","source_id":"wikipedia.article.boundary-work","source_sha256":"65395003f0e170af97671718571f5c4a2319e2af76d77a25e47df0a8847dec46","start":100}],"target_id":"concept.wikipedia.boundary-work","target_kind":"node","target_sha256":"0ee16af45ab3960cd7a47bc1836d8fad05e62679756e1ee4c5af57b671f63f26"}],"concept.wikipedia.bounded-quantifier":[{"id":"assertion.concept.wikipedia.bounded-quantifier","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounded quantifier as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounded quantifier\", CC BY-SA 4.0) states: In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \"∀\" and \"∃\".","support":[{"end":315,"quote":"In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \\\"∀\\\" and \\\"∃\\\".","source_id":"wikipedia.article.bounded-quantifier","source_sha256":"f55806e5d6d9a30193b993f68fb5badc590785bcff18c2921b5d1f81dbd433a5","start":105}],"target_id":"concept.wikipedia.bounded-quantifier","target_kind":"node","target_sha256":"438074c84ed4f29cc3287e82702aa6fcc40218d57abb1c9097f4fe7367006d50"}],"concept.wikipedia.bounded-variation":[{"id":"assertion.concept.wikipedia.bounded-variation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounded variation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounded variation\", CC BY-SA 4.0) states: In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","support":[{"end":338,"quote":"In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","source_id":"wikipedia.article.bounded-variation","source_sha256":"7f16518a83bbdda57539145a553640d555415401b6e143ed3412d335c558d08e","start":103}],"target_id":"concept.wikipedia.bounded-variation","target_kind":"node","target_sha256":"003324958ec523f005dfa9bc5e5982635378c8c9de9bb9f3a5cf381cd8b10a60"}],"concept.wikipedia.bounding-point":[{"id":"assertion.concept.wikipedia.bounding-point","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bounding point as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bounding point\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","support":[{"end":249,"quote":"In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","source_id":"wikipedia.article.bounding-point","source_sha256":"ad74a99d403738f6bf7c400bd095ce8be5312008301592fe6c06e8cbde6a684d","start":102}],"target_id":"concept.wikipedia.bounding-point","target_kind":"node","target_sha256":"07533a828a90019970e3313330d05633180c836f21ac537bcb7f90377507fba5"}],"concept.wikipedia.braced-frame":[{"id":"assertion.concept.wikipedia.braced-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braced frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braced frame\", CC BY-SA 4.0) states: In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","support":[{"end":211,"quote":"In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","source_id":"wikipedia.article.braced-frame","source_sha256":"b5e9b51e84a1bfdc425b2f8412a4d2a5c2167005bf8ca971da94dacbb2615b79","start":100}],"target_id":"concept.wikipedia.braced-frame","target_kind":"node","target_sha256":"4a48bfe39013287dbb23a08e613fdd3b7b925fbc821661428b71a224bb374595"}],"concept.wikipedia.bracketing-paradox":[{"id":"assertion.concept.wikipedia.bracketing-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bracketing paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bracketing paradox\", CC BY-SA 4.0) states: In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","support":[{"end":347,"quote":"In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","source_id":"wikipedia.article.bracketing-paradox","source_sha256":"c44ec866fe0802b83145c05a94e6020c0c086d598db8f3a41b0bfb7d7cd6dc04","start":105}],"target_id":"concept.wikipedia.bracketing-paradox","target_kind":"node","target_sha256":"bf5dbcaddab53a9432a6ed33d79ec857097ea33d06c784e343f8ce0a84242e29"}],"concept.wikipedia.bracketing-phenomenology":[{"id":"assertion.concept.wikipedia.bracketing-phenomenology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bracketing (phenomenology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bracketing (phenomenology)\", CC BY-SA 4.0) states: Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","support":[{"end":356,"quote":"Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","source_id":"wikipedia.article.bracketing-phenomenology","source_sha256":"7a96479485eb2868a69b053770e6e73b84be2782fcf33b8418911880b4bc3ad1","start":114}],"target_id":"concept.wikipedia.bracketing-phenomenology","target_kind":"node","target_sha256":"97885fe8a7fcc3069723d8c132742ba8963f626cd558eb5f24b29135b35fcac1"}],"concept.wikipedia.bradley-s-regress":[{"id":"assertion.concept.wikipedia.bradley-s-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bradley's regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bradley's regress\", CC BY-SA 4.0) states: Bradley's regress is a philosophical problem concerning the nature of relations.","support":[{"end":185,"quote":"Bradley's regress is a philosophical problem concerning the nature of relations.","source_id":"wikipedia.article.bradley-s-regress","source_sha256":"08bf70bce0744ac23ae544a9ab39756d77840249b9afa9533c0ae339f3e630e5","start":105}],"target_id":"concept.wikipedia.bradley-s-regress","target_kind":"node","target_sha256":"d446bf16ca88a5aa069971a5aa3bb18a6ad897612e6e088fe7a2769325740a5e"}],"concept.wikipedia.braitenberg-vehicle":[{"id":"assertion.concept.wikipedia.braitenberg-vehicle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braitenberg vehicle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braitenberg vehicle\", CC BY-SA 4.0) states: A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","support":[{"end":235,"quote":"A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","source_id":"wikipedia.article.braitenberg-vehicle","source_sha256":"44c828683d33accf6fa0337e3e963f00049016828246422dc63d02f847be09ad","start":107}],"target_id":"concept.wikipedia.braitenberg-vehicle","target_kind":"node","target_sha256":"8d23302a5b851a4971f34ee5575046f78aaf15ec64c2f395aad6a32f17abae5f"}],"concept.wikipedia.braking-chopper":[{"id":"assertion.concept.wikipedia.braking-chopper","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Braking chopper as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Braking chopper\", CC BY-SA 4.0) states: Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","support":[{"end":318,"quote":"Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","source_id":"wikipedia.article.braking-chopper","source_sha256":"619c50906a569e9619aaeeae89833ba66029fe058ad82f30acc153dcee0c77e7","start":103}],"target_id":"concept.wikipedia.braking-chopper","target_kind":"node","target_sha256":"9d223ebd2a485cbfec3e2526fdefbc69decb0eb6e5036e08c812985a9f7de624"}],"concept.wikipedia.brass-fastener":[{"id":"assertion.concept.wikipedia.brass-fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brass fastener as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brass fastener\", CC BY-SA 4.0) states: A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","support":[{"end":243,"quote":"A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","source_id":"wikipedia.article.brass-fastener","source_sha256":"ccd864491b831e4f205dff6794c5c309963a2b2775e91ec3806694dcf64eb3f8","start":101}],"target_id":"concept.wikipedia.brass-fastener","target_kind":"node","target_sha256":"4a39b007b17284a534c2be3c6b081458b47f23eaea3b748bbb6d4d09d2495437"}],"concept.wikipedia.bread-clip":[{"id":"assertion.concept.wikipedia.bread-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bread clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bread clip\", CC BY-SA 4.0) states: A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","support":[{"end":220,"quote":"A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","source_id":"wikipedia.article.bread-clip","source_sha256":"a6c25c8128409a1414212951c6a6a9898494b9688c515be9065ffe5dee52ac58","start":96}],"target_id":"concept.wikipedia.bread-clip","target_kind":"node","target_sha256":"77dbb1ea67959dfe58610f117ec5c5424004d255aad88920997daf73360e9d15"}],"concept.wikipedia.breaking-capacity":[{"id":"assertion.concept.wikipedia.breaking-capacity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breaking capacity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breaking capacity\", CC BY-SA 4.0) states: Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","support":[{"end":319,"quote":"Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","source_id":"wikipedia.article.breaking-capacity","source_sha256":"5fc093e6298d08d12a58c575e93dda1331c80f131fa2cf1c64305f0a72c3eaac","start":104}],"target_id":"concept.wikipedia.breaking-capacity","target_kind":"node","target_sha256":"37d1c91252c684cabbc8e48a48303938cf4466ab9354475c0438ce064668fc27"}],"concept.wikipedia.breather-surface":[{"id":"assertion.concept.wikipedia.breather-surface","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breather surface as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breather surface\", CC BY-SA 4.0) states: In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","support":[{"end":325,"quote":"In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","source_id":"wikipedia.article.breather-surface","source_sha256":"823520bf000c3d3331753073f9f45a33c1cf6d0c69345df15f9d0135321086a4","start":104}],"target_id":"concept.wikipedia.breather-surface","target_kind":"node","target_sha256":"b31c5d6d6f45960c832e5701eccb92f4602e1d8af1bf5852e44dd686a1a55881"}],"concept.wikipedia.breech-lock":[{"id":"assertion.concept.wikipedia.breech-lock","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Breech-lock as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Breech-lock\", CC BY-SA 4.0) states: A breech-lock is a system for mounting camera lenses to camera bodies.","support":[{"end":168,"quote":"A breech-lock is a system for mounting camera lenses to camera bodies.","source_id":"wikipedia.article.breech-lock","source_sha256":"3168c00454ffdc52edb854787d93ab4ea6c055334c15d5ae903aa8586e4bbb58","start":98}],"target_id":"concept.wikipedia.breech-lock","target_kind":"node","target_sha256":"e9e0610475635d4c94055b24e9e16556284c96e47489e6a52e4d64698b87afb3"}],"concept.wikipedia.bressummer":[{"id":"assertion.concept.wikipedia.bressummer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bressummer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bressummer\", CC BY-SA 4.0) states: A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","support":[{"end":289,"quote":"A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","source_id":"wikipedia.article.bressummer","source_sha256":"a8ce201e9d72199ed27327f0f7c65cdadc15f7e4fecd2d5a028c68f5c3ca119d","start":97}],"target_id":"concept.wikipedia.bressummer","target_kind":"node","target_sha256":"772b2e7c3da0f1b48ae5908626ebedb78e1f91f95015dcfc760405f4bc229e5c"}],"concept.wikipedia.bridge-bearing":[{"id":"assertion.concept.wikipedia.bridge-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge bearing\", CC BY-SA 4.0) states: In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","support":[{"end":257,"quote":"In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","source_id":"wikipedia.article.bridge-bearing","source_sha256":"c98da73aa3e1b9a83f756790a7ca8075fe117bbbc6489faf2ea94765b6e4319c","start":102}],"target_id":"concept.wikipedia.bridge-bearing","target_kind":"node","target_sha256":"96fb794b82dbca08ec01606fd457e782420baec61799ef07ca093e7c1f42188c"}],"concept.wikipedia.bridge-scour":[{"id":"assertion.concept.wikipedia.bridge-scour","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge scour as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge scour\", CC BY-SA 4.0) states: Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","support":[{"end":202,"quote":"Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","source_id":"wikipedia.article.bridge-scour","source_sha256":"a38f021f5ddc3c38a1205ed61367ded142368624a4a4046ab79b4edfcfe28f9c","start":100}],"target_id":"concept.wikipedia.bridge-scour","target_kind":"node","target_sha256":"fd2edb1af7c25b037aeb4cb86cfd4984b1a08b76a23b9ba782bc0db7bf7e6f41"}],"concept.wikipedia.bridge-strike":[{"id":"assertion.concept.wikipedia.bridge-strike","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridge strike as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridge strike\", CC BY-SA 4.0) states: Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","support":[{"end":260,"quote":"Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","source_id":"wikipedia.article.bridge-strike","source_sha256":"85f17e92fcd5c7ca8ded678fa39a1d1884efa1fdb8b6ef5612c82025891d8820","start":101}],"target_id":"concept.wikipedia.bridge-strike","target_kind":"node","target_sha256":"a786a915551ae2e08db5dff37cacc9acb20d3299ab1baf9992e400321633a5cc"}],"concept.wikipedia.bridgeland-stability-condition":[{"id":"assertion.concept.wikipedia.bridgeland-stability-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bridgeland stability condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bridgeland stability condition\", CC BY-SA 4.0) states: In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","support":[{"end":293,"quote":"In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","source_id":"wikipedia.article.bridgeland-stability-condition","source_sha256":"c4f92d5f19fd1eca86007f4281d8dbd9b122b5cd95953e884258acb75ca65e17","start":118}],"target_id":"concept.wikipedia.bridgeland-stability-condition","target_kind":"node","target_sha256":"9491e689636f7e22d02b38c19ec6daf4fc749679bbfd4072fe7e494271481e99"}],"concept.wikipedia.brokaw-bandgap-reference":[{"id":"assertion.concept.wikipedia.brokaw-bandgap-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brokaw bandgap reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brokaw bandgap reference\", CC BY-SA 4.0) states: The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","support":[{"end":284,"quote":"The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","source_id":"wikipedia.article.brokaw-bandgap-reference","source_sha256":"12f78b905062dc2c2fe1c2edab6b27e7fe731754b05089491a484ce92be1f137","start":110}],"target_id":"concept.wikipedia.brokaw-bandgap-reference","target_kind":"node","target_sha256":"a9da9082281aba274110b826ced98afe83e1096055d7b89a94d4c29bfb982b27"}],"concept.wikipedia.brooch":[{"id":"assertion.concept.wikipedia.brooch","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brooch as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brooch\", CC BY-SA 4.0) states: A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","support":[{"end":252,"quote":"A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","source_id":"wikipedia.article.brooch","source_sha256":"46fa4c8cb4ec6bd67cccc078cd4f31f2f6912efc9b80fff5f1c9ec2fe2441ec6","start":92}],"target_id":"concept.wikipedia.brooch","target_kind":"node","target_sha256":"8d2d21bf1fa8c5b15718eb1239d7bf4022069f06a804074f684846971a320016"}],"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation":[{"id":"assertion.concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brouwer–Heyting–Kolmogorov interpretation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brouwer–Heyting–Kolmogorov interpretation\", CC BY-SA 4.0) states: In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","support":[{"end":375,"quote":"In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","source_id":"wikipedia.article.brouwer-heyting-kolmogorov-interpretation","source_sha256":"c424e2ab298c46711f930f39818a996850102bb7b7eee35c16e752d87a68809f","start":128}],"target_id":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","target_kind":"node","target_sha256":"1cf607fa2cabdaca427cb67fb5fd63c3a4ad9502c074343c4cd0f2ce6c819214"}],"concept.wikipedia.bruhat-order":[{"id":"assertion.concept.wikipedia.bruhat-order","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bruhat order as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bruhat order\", CC BY-SA 4.0) states: In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","support":[{"end":370,"quote":"In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","source_id":"wikipedia.article.bruhat-order","source_sha256":"0b2568d8a4634aa5d8f09cff5bf495e04b99504a690e01ffa9367ce6a7ae5d87","start":100}],"target_id":"concept.wikipedia.bruhat-order","target_kind":"node","target_sha256":"8632bb79092a010c1815e2c36c6fee3752b7bd0b588a6623a1f1054c2f29545e"}],"concept.wikipedia.brumer-bound":[{"id":"assertion.concept.wikipedia.brumer-bound","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brumer bound as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brumer bound\", CC BY-SA 4.0) states: In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","support":[{"end":203,"quote":"In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","source_id":"wikipedia.article.brumer-bound","source_sha256":"2b324c36de64da6eb2f88c6acfe6d6f4be00265a36ac035b3f66258cfd64a258","start":100}],"target_id":"concept.wikipedia.brumer-bound","target_kind":"node","target_sha256":"557569d8ddecfe32496f84231c673b76a7a2f703a8202b1fa176fcf8a0eeb060"}],"concept.wikipedia.brush-electric":[{"id":"assertion.concept.wikipedia.brush-electric","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brush (electric) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brush (electric)\", CC BY-SA 4.0) states: A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","support":[{"end":332,"quote":"A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","source_id":"wikipedia.article.brush-electric","source_sha256":"eaddb6622772c28f9a1931621913ee1842368064fdf4b8d3926fc4ad4d604d47","start":103}],"target_id":"concept.wikipedia.brush-electric","target_kind":"node","target_sha256":"1bdd04867e0bf4ce8fa9ca29a350f43b3b9e5d4cc1922a1d2f0c18699a4d64dd"}],"concept.wikipedia.brushed-dc-electric-motor":[{"id":"assertion.concept.wikipedia.brushed-dc-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brushed DC electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brushed DC electric motor\", CC BY-SA 4.0) states: A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","support":[{"end":282,"quote":"A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","source_id":"wikipedia.article.brushed-dc-electric-motor","source_sha256":"fd9acaf2187d642ceedbcf1046cf43d9dcd115329db5f4095fb22087e7b766e9","start":113}],"target_id":"concept.wikipedia.brushed-dc-electric-motor","target_kind":"node","target_sha256":"8b9b7357185a53bd73c27027d96c494d9cdce8c8b51d181a9de3c89db60030e5"}],"concept.wikipedia.brushless-dc-electric-motor":[{"id":"assertion.concept.wikipedia.brushless-dc-electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brushless DC electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brushless DC electric motor\", CC BY-SA 4.0) states: A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","support":[{"end":274,"quote":"A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","source_id":"wikipedia.article.brushless-dc-electric-motor","source_sha256":"633c4a77b3fd5bc4ac65b084627744bb0b88c3e940c594bde154a3cbbb44a3c0","start":113}],"target_id":"concept.wikipedia.brushless-dc-electric-motor","target_kind":"node","target_sha256":"229277215c20230756e5c87cfdd66ef477ca47f7e9abc211cb953dedd4b0eefb"}],"concept.wikipedia.bubble-sensor":[{"id":"assertion.concept.wikipedia.bubble-sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bubble sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bubble sensor\", CC BY-SA 4.0) states: Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","support":[{"end":181,"quote":"Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","source_id":"wikipedia.article.bubble-sensor","source_sha256":"a9801608dcf3b0367ad2f691ec47d808685053531bc93f3701d8278afae940b7","start":101}],"target_id":"concept.wikipedia.bubble-sensor","target_kind":"node","target_sha256":"b0858861a3393071f05dbb37ad707e60adac3344c8c6026d50c01b05d722ac64"}],"concept.wikipedia.buchholz-s-ordinal":[{"id":"assertion.concept.wikipedia.buchholz-s-ordinal","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buchholz's ordinal as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buchholz's ordinal\", CC BY-SA 4.0) states: In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","support":[{"end":277,"quote":"In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","source_id":"wikipedia.article.buchholz-s-ordinal","source_sha256":"db8f96473b5bfa4da955aac34cc80454f6770be65f34afd4cd87c12f5f7d5722","start":106}],"target_id":"concept.wikipedia.buchholz-s-ordinal","target_kind":"node","target_sha256":"f319dcf97925b9392a664c03be8c7b148a0fe26b69792b9af838c425f827ddad"}],"concept.wikipedia.buckling-restrained-braced-frame":[{"id":"assertion.concept.wikipedia.buckling-restrained-braced-frame","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buckling-restrained braced frame as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buckling-restrained braced frame\", CC BY-SA 4.0) states: Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","support":[{"end":271,"quote":"Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","source_id":"wikipedia.article.buckling-restrained-braced-frame","source_sha256":"ebd495d5d959aead754848d1f7e91ee39a9d33f17b9a1003a4c7ccc96ed57b65","start":120}],"target_id":"concept.wikipedia.buckling-restrained-braced-frame","target_kind":"node","target_sha256":"94440a0f1c9751cd2d5b031b377bc7574b5d304477488f5b86e07caba963e24b"}],"concept.wikipedia.building-engineer":[{"id":"assertion.concept.wikipedia.building-engineer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Building engineer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Building engineer\", CC BY-SA 4.0) states: A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","support":[{"end":262,"quote":"A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","source_id":"wikipedia.article.building-engineer","source_sha256":"916046ecdcbdc5d6976e35fdcaafc2614694fd1021cb814e6e294ee3befa5262","start":105}],"target_id":"concept.wikipedia.building-engineer","target_kind":"node","target_sha256":"998db9ce91b8bce2ebf43c164a29b5fdaddfc7b430b1eed178a57854990ec2e6"}],"concept.wikipedia.bulldog-clip":[{"id":"assertion.concept.wikipedia.bulldog-clip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bulldog clip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bulldog clip\", CC BY-SA 4.0) states: A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","support":[{"end":186,"quote":"A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","source_id":"wikipedia.article.bulldog-clip","source_sha256":"2a0722e8c9fbff14e209a62af88ef80d3d4ae248d5ac16127697554a0427b407","start":99}],"target_id":"concept.wikipedia.bulldog-clip","target_kind":"node","target_sha256":"fab1299ff7f3659779992532c10b373dee000086d6130d8c1ffe476d4dc8f9ec"}],"concept.wikipedia.burden-of-knowledge":[{"id":"assertion.concept.wikipedia.burden-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Burden of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Burden of knowledge\", CC BY-SA 4.0) states: The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","support":[{"end":263,"quote":"The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","source_id":"wikipedia.article.burden-of-knowledge","source_sha256":"f919312cd0854bc02669ff7fc45ac7d080d6aa69774a79c79a6de77821ab4526","start":107}],"target_id":"concept.wikipedia.burden-of-knowledge","target_kind":"node","target_sha256":"4476f78b973f64616542cbb81321de0b4028924bffed72206ca3f8f80a384b07"}],"concept.wikipedia.bus-holder":[{"id":"assertion.concept.wikipedia.bus-holder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bus-holder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bus-holder\", CC BY-SA 4.0) states: A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","support":[{"end":193,"quote":"A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","source_id":"wikipedia.article.bus-holder","source_sha256":"3b3b8def1dee9681221bf97b19e679782c412658ae2594f5d61fc73ebf858aaf","start":97}],"target_id":"concept.wikipedia.bus-holder","target_kind":"node","target_sha256":"1bc1ede4307070b6a3bc4cc7b0368c6dc2bec7c5ef9c53f9ff60562f17e5a53e"}],"concept.wikipedia.busemann-petty-problem":[{"id":"assertion.concept.wikipedia.busemann-petty-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Busemann–Petty problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Busemann–Petty problem\", CC BY-SA 4.0) states: In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","support":[{"end":369,"quote":"In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","source_id":"wikipedia.article.busemann-petty-problem","source_sha256":"ad01d9b3db36f302d469347e231d5df25ab8586b5bb172f3dd220b60a258f065","start":110}],"target_id":"concept.wikipedia.busemann-petty-problem","target_kind":"node","target_sha256":"7576695211bf485e4188aba790913c8c85677d0d83d640b2a642732d3402f34b"}],"concept.wikipedia.butt-welding":[{"id":"assertion.concept.wikipedia.butt-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butt welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butt welding\", CC BY-SA 4.0) states: Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","support":[{"end":365,"quote":"Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","source_id":"wikipedia.article.butt-welding","source_sha256":"94765ba13844807ebb3b69f5ceb6efd92ec74a4203390b1521e0d445c38c66ca","start":99}],"target_id":"concept.wikipedia.butt-welding","target_kind":"node","target_sha256":"9b85130818cb48b96993be8c8425171782d2d4b95b2aab9a824c88964acb2960"}],"concept.wikipedia.butterfly-effect":[{"id":"assertion.concept.wikipedia.butterfly-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butterfly effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butterfly effect\", CC BY-SA 4.0) states: In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","support":[{"end":310,"quote":"In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","source_id":"wikipedia.article.butterfly-effect","source_sha256":"c328aba036a3b259096aa81107ae0dbde92186668b3286cb4f2d40bdb89359c0","start":100}],"target_id":"concept.wikipedia.butterfly-effect","target_kind":"node","target_sha256":"cbb998c1c878f254cca92416573eda49a34769f09b4604ed004f7569fc5b8c62"}],"concept.wikipedia.butterfly-valve":[{"id":"assertion.concept.wikipedia.butterfly-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Butterfly valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Butterfly valve\", CC BY-SA 4.0) states: A butterfly valve is a valve that isolates or regulates the flow of a fluid.","support":[{"end":177,"quote":"A butterfly valve is a valve that isolates or regulates the flow of a fluid.","source_id":"wikipedia.article.butterfly-valve","source_sha256":"7d4f25551387587cd891de447e7e4a5956fb80bcb000ed20c4936f520b2eed1e","start":101}],"target_id":"concept.wikipedia.butterfly-valve","target_kind":"node","target_sha256":"1f6f6091695e96fc27e560ca0a8a7e0db94601d63a7cc9f56bca19fbef68db86"}],"concept.wikipedia.buttressed-core":[{"id":"assertion.concept.wikipedia.buttressed-core","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buttressed core as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buttressed core\", CC BY-SA 4.0) states: A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","support":[{"end":246,"quote":"A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","source_id":"wikipedia.article.buttressed-core","source_sha256":"be80f4da70fe0be3ec1d38ecc14b67801e5e08e08f0eb0d083ba90714b56d17e","start":103}],"target_id":"concept.wikipedia.buttressed-core","target_kind":"node","target_sha256":"764fa5ee58df07768dd2a56942e3e18c971dc38bceb8f635d69623d3941a67e3"}],"concept.wikipedia.buzzer":[{"id":"assertion.concept.wikipedia.buzzer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Buzzer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Buzzer\", CC BY-SA 4.0) states: A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","support":[{"end":220,"quote":"A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","source_id":"wikipedia.article.buzzer","source_sha256":"ccfbb4f985c83adcb5fb04e33a2b1a036f5cde23823b7fc47750b6adf05f7710","start":92}],"target_id":"concept.wikipedia.buzzer","target_kind":"node","target_sha256":"c3eb1ee8d5520d343fc94921977c490a9cc7bfc0f81def569dab336939e57d40"}],"concept.wikipedia.c-dl-g":[{"id":"assertion.concept.wikipedia.c-dl-g","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Càdlàg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Càdlàg\", CC BY-SA 4.0) states: In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\"right continuous with left limits\"), or corlol (\"continuous on (the) right, limit on (the) left\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","support":[{"end":414,"quote":"In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\\\"right continuous with left limits\\\"), or corlol (\\\"continuous on (the) right, limit on (the) left\\\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","source_id":"wikipedia.article.c-dl-g","source_sha256":"8f76ad8dfa0c303aa0a399825d967eaa9eee0aa5504eb8997e0109d9d518c57c","start":94}],"target_id":"concept.wikipedia.c-dl-g","target_kind":"node","target_sha256":"1d445ddaebf11e9c5b2a59d6d9a9bec4800ce1de23c3ee6c9c392ef59896f9e1"}],"concept.wikipedia.cable-fairing":[{"id":"assertion.concept.wikipedia.cable-fairing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cable fairing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cable fairing\", CC BY-SA 4.0) states: A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","support":[{"end":241,"quote":"A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","source_id":"wikipedia.article.cable-fairing","source_sha256":"f2b2b820c6135c7a0631017644c3d273fe3e4c8ed9a70a5f12420c8d397e52f4","start":101}],"target_id":"concept.wikipedia.cable-fairing","target_kind":"node","target_sha256":"283c9bca60cbd08f292b5254e4c39dd86edd6c92b041cfcd4550cefa33fb25e1"}],"concept.wikipedia.cable-robots":[{"id":"assertion.concept.wikipedia.cable-robots","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cable robots as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cable robots\", CC BY-SA 4.0) states: Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","support":[{"end":285,"quote":"Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","source_id":"wikipedia.article.cable-robots","source_sha256":"22b99cac88b5e134e9e3e8e046b612c08e56bdcfdc21a02ae46a43c23f7ea0d3","start":100}],"target_id":"concept.wikipedia.cable-robots","target_kind":"node","target_sha256":"8159ca8b92bdca0e186e1da3c4ed47b11fc702dc21c6d9ad87784b2cae14adc5"}],"concept.wikipedia.cagniard-de-hoop-method":[{"id":"assertion.concept.wikipedia.cagniard-de-hoop-method","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cagniard–De Hoop method as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cagniard–De Hoop method\", CC BY-SA 4.0) states: In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","support":[{"end":310,"quote":"In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","source_id":"wikipedia.article.cagniard-de-hoop-method","source_sha256":"f8436daa843fba48315f4a897f2651530d0b438e424632d8955db9aec01107ac","start":111}],"target_id":"concept.wikipedia.cagniard-de-hoop-method","target_kind":"node","target_sha256":"776b9af314b1fd02ac1c288b0419acc436a52f6c754564d62680c0ee9c217d7b"}],"concept.wikipedia.calcium-looping":[{"id":"assertion.concept.wikipedia.calcium-looping","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calcium looping as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calcium looping\", CC BY-SA 4.0) states: Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","support":[{"end":216,"quote":"Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","source_id":"wikipedia.article.calcium-looping","source_sha256":"1616c15b8eef3e383a2a9cf3f79c2a56a04d2f95c71610b7137e7a275cfc3a0f","start":103}],"target_id":"concept.wikipedia.calcium-looping","target_kind":"node","target_sha256":"043a84dd8915953154207fef622013a1897c26019d94ab37dcdd554aaac5ec9d"}],"concept.wikipedia.calculus":[{"id":"assertion.concept.wikipedia.calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus\", CC BY-SA 4.0) states: Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","support":[{"end":225,"quote":"Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","source_id":"wikipedia.article.calculus","source_sha256":"f037fd3ccae5d49070f1a21e012af94cab21296635c2fd93bb59be6dfd9c9ec2","start":92}],"target_id":"concept.wikipedia.calculus","target_kind":"node","target_sha256":"f0abe08f475e3f384f7a558eefd238aecd191d9d03ad3dcb485d07c400187d36"}],"concept.wikipedia.calculus-on-finite-weighted-graphs":[{"id":"assertion.concept.wikipedia.calculus-on-finite-weighted-graphs","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus on finite weighted graphs as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus on finite weighted graphs\", CC BY-SA 4.0) states: In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","support":[{"end":321,"quote":"In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","source_id":"wikipedia.article.calculus-on-finite-weighted-graphs","source_sha256":"8060d72dda9f7f403d92f3f0f370ad464be17b1cff19baa58e47760ed990b7ef","start":122}],"target_id":"concept.wikipedia.calculus-on-finite-weighted-graphs","target_kind":"node","target_sha256":"548179325f045f2249a84896346a53d24093096955c29a7f10228333079c1691"}],"concept.wikipedia.calculus-ratiocinator":[{"id":"assertion.concept.wikipedia.calculus-ratiocinator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Calculus ratiocinator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Calculus ratiocinator\", CC BY-SA 4.0) states: The calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","support":[{"end":361,"quote":"The  calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","source_id":"wikipedia.article.calculus-ratiocinator","source_sha256":"336367a6c3bc47d18c2d66e34988573840eefcce8349ae9194ade62ba38dd3d0","start":107}],"target_id":"concept.wikipedia.calculus-ratiocinator","target_kind":"node","target_sha256":"be034eadbf7bf68609bb65e7abe1c6bc8c113ece24e5a5ecdfeaeb670d125898"}],"concept.wikipedia.cam-mechanism":[{"id":"assertion.concept.wikipedia.cam-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cam (mechanism) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cam (mechanism)\", CC BY-SA 4.0) states: A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","support":[{"end":226,"quote":"A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","source_id":"wikipedia.article.cam-mechanism","source_sha256":"124154e3ac0e74e30a7df242fb7d58004c52162a8c876e2e079a0d0132c82328","start":100}],"target_id":"concept.wikipedia.cam-mechanism","target_kind":"node","target_sha256":"4ae306b198c80feffd4dab9f66095be6ef15ed69d434a474e49e4a527740192f"}],"concept.wikipedia.cam-timer":[{"id":"assertion.concept.wikipedia.cam-timer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cam timer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cam timer\", CC BY-SA 4.0) states: A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","support":[{"end":207,"quote":"A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","source_id":"wikipedia.article.cam-timer","source_sha256":"a303826ac33896bdd7a01bc3ed6ff4f3de66b53a7d1d0af50e0799c9659d8884","start":95}],"target_id":"concept.wikipedia.cam-timer","target_kind":"node","target_sha256":"a9e6366c44d70a62d3146a11620ca54ad6cdad241b60b6000a797ce1b7ce9ef1"}],"concept.wikipedia.camcon-binary-actuator":[{"id":"assertion.concept.wikipedia.camcon-binary-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Camcon binary actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Camcon binary actuator\", CC BY-SA 4.0) states: The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","support":[{"end":251,"quote":"The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","source_id":"wikipedia.article.camcon-binary-actuator","source_sha256":"f874becb8e4ed0dce522cfcaacd8fffba036cede0394827625b8d12f10573e2b","start":110}],"target_id":"concept.wikipedia.camcon-binary-actuator","target_kind":"node","target_sha256":"cd399efa48ee2f1246d317da10cb76ef23ac1c93f6e036da395a58636f51f970"}],"concept.wikipedia.cameleon-protein":[{"id":"assertion.concept.wikipedia.cameleon-protein","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cameleon (protein) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cameleon (protein)\", CC BY-SA 4.0) states: Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","support":[{"end":234,"quote":"Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","source_id":"wikipedia.article.cameleon-protein","source_sha256":"71401211622bcbfccf51c549b8ddde5204f00cfd981de9b8b03e614aa3fbd063","start":105}],"target_id":"concept.wikipedia.cameleon-protein","target_kind":"node","target_sha256":"2f828191c293a5f4ab25b3de6fdbac087bbf97c61d5772d717e37b77f7cdabc0"}],"concept.wikipedia.canberra-plan":[{"id":"assertion.concept.wikipedia.canberra-plan","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Canberra Plan as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Canberra Plan\", CC BY-SA 4.0) states: In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","support":[{"end":262,"quote":"In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","source_id":"wikipedia.article.canberra-plan","source_sha256":"d3de7c46bff4a6cc8e4ce23259a2c9e530b8534469a7787f4f75d07a8bc2e69a","start":101}],"target_id":"concept.wikipedia.canberra-plan","target_kind":"node","target_sha256":"6b95eb9f49f3f557bd8ef47b234cbfbdc85a5f9b2afe2e75750003d9b5c216e1"}],"concept.wikipedia.candle-problem":[{"id":"assertion.concept.wikipedia.candle-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Candle problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Candle problem\", CC BY-SA 4.0) states: The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","support":[{"end":306,"quote":"The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","source_id":"wikipedia.article.candle-problem","source_sha256":"5d3335c0262ce9e14a592097b2137de75183eb8bc8ad34355240eb44a1b830c6","start":102}],"target_id":"concept.wikipedia.candle-problem","target_kind":"node","target_sha256":"8c060d39578c1278b9a0a62d04c1f02f3e77268ce3785d239a7b4b2f63e03891"}],"concept.wikipedia.cannon-bearing":[{"id":"assertion.concept.wikipedia.cannon-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cannon bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cannon bearing\", CC BY-SA 4.0) states: A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","support":[{"end":251,"quote":"A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","source_id":"wikipedia.article.cannon-bearing","source_sha256":"49d9282a26213df599f80d77344c14c4026264ea9f4b596689b2d77aa9f38359","start":102}],"target_id":"concept.wikipedia.cannon-bearing","target_kind":"node","target_sha256":"e1ae7a178b04b35a439df3e476936dce239cf1fa6d346c410cba1ef0fa32b419"}],"concept.wikipedia.canonical-form":[{"id":"assertion.concept.wikipedia.canonical-form","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Canonical form as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Canonical form\", CC BY-SA 4.0) states: In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","support":[{"end":273,"quote":"In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","source_id":"wikipedia.article.canonical-form","source_sha256":"f56d06b328ffb0263961c7b59c3bdfc00b69952775d1582fb9fc3a7faedd9d31","start":100}],"target_id":"concept.wikipedia.canonical-form","target_kind":"node","target_sha256":"279b3a4813ec599d2023e43295a5042d2e53f906e7a3b58e4408c9dea30a2ca0"}],"concept.wikipedia.cantilever":[{"id":"assertion.concept.wikipedia.cantilever","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantilever as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantilever\", CC BY-SA 4.0) states: A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","support":[{"end":225,"quote":"A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","source_id":"wikipedia.article.cantilever","source_sha256":"0cff716c11a2dbd69cef91d4b628d4897ae001577374f524dcc162054f3953d9","start":96}],"target_id":"concept.wikipedia.cantilever","target_kind":"node","target_sha256":"52b3e91d89e998ff5b6e0fa285d5e8fdb386ec2cf07164f9a9ae7b27e40fb206"}],"concept.wikipedia.cantor-function":[{"id":"assertion.concept.wikipedia.cantor-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor function\", CC BY-SA 4.0) states: In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous.","support":[{"end":216,"quote":"In mathematics, the Cantor function is an example of a  function that is continuous, but not absolutely continuous.","source_id":"wikipedia.article.cantor-function","source_sha256":"cd6226112e6e68adc63f989f03dc8264e2b5871ddc320b4a3a99da5bfae0bddf","start":101}],"target_id":"concept.wikipedia.cantor-function","target_kind":"node","target_sha256":"4f4ce0258e3e44107e74c3bfd37763c6842e3c3fe56ebd395336eae2e184620a"}],"concept.wikipedia.cantor-set":[{"id":"assertion.concept.wikipedia.cantor-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor set\", CC BY-SA 4.0) states: In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","support":[{"end":232,"quote":"In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","source_id":"wikipedia.article.cantor-set","source_sha256":"bd34e21972d7b6114b83ca67f3da4f0f0bd8bc7766ca79e00a440d7ac68a909f","start":94}],"target_id":"concept.wikipedia.cantor-set","target_kind":"node","target_sha256":"91f0d8f04586b768623c54551633d0725559b2ed4eb55b69bae2b10539f55796"}],"concept.wikipedia.cantor-space":[{"id":"assertion.concept.wikipedia.cantor-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor space\", CC BY-SA 4.0) states: In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","support":[{"end":290,"quote":"In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","source_id":"wikipedia.article.cantor-space","source_sha256":"a86ca11b0a1dc1f7726ac12be65364168869f41adab9d1be465430fbd89a49fe","start":98}],"target_id":"concept.wikipedia.cantor-space","target_kind":"node","target_sha256":"c6a54a5d50516f5b8a935cadea2533b799d95281c6322dc958f4b97f748eed5a"}],"concept.wikipedia.cantor-tree":[{"id":"assertion.concept.wikipedia.cantor-tree","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor tree as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor tree\", CC BY-SA 4.0) states: In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","support":[{"end":267,"quote":"In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","source_id":"wikipedia.article.cantor-tree","source_sha256":"fa295d4e43bff607cb33ad9fb9e67c05183b3ed2435d6953517725071e53797b","start":99}],"target_id":"concept.wikipedia.cantor-tree","target_kind":"node","target_sha256":"7a93bbb77fc7df4a9e9bfdfa390d937c351cc09b0137afc0a4a6f4e279854fe3"}],"concept.wikipedia.capacitor":[{"id":"assertion.concept.wikipedia.capacitor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capacitor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capacitor\", CC BY-SA 4.0) states: A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","support":[{"end":249,"quote":"A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","source_id":"wikipedia.article.capacitor","source_sha256":"664d073a795f0e3026b3b61aadee89fffa6ee1fc9d338532bac55b00bc2722c1","start":96}],"target_id":"concept.wikipedia.capacitor","target_kind":"node","target_sha256":"0da68ec230d35cdf4f1ec36bc4621014861787ad58e6310ea3b393bdc72a9d5b"}],"concept.wikipedia.capacitor-discharge-sintering":[{"id":"assertion.concept.wikipedia.capacitor-discharge-sintering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capacitor discharge sintering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capacitor discharge sintering\", CC BY-SA 4.0) states: Capacitor discharge sintering (CDS) is an electric current assisted sintering (ECAS) technique.","support":[{"end":213,"quote":"Capacitor discharge sintering (CDS)  is an electric current assisted sintering (ECAS) technique.","source_id":"wikipedia.article.capacitor-discharge-sintering","source_sha256":"452bb3cd5e5622a16ff8a090c35a3b5f672daec501e74e590ed25ffb9bd4675a","start":117}],"target_id":"concept.wikipedia.capacitor-discharge-sintering","target_kind":"node","target_sha256":"c05bac55597183a9ed0c6509dcaecd6a591fa04da1d11c43019595ce31cb9db2"}],"concept.wikipedia.capella-engineering":[{"id":"assertion.concept.wikipedia.capella-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Capella (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Capella (engineering)\", CC BY-SA 4.0) states: Capella is an open-source solution for model-based systems engineering (MBSE).","support":[{"end":187,"quote":"Capella is an open-source solution for model-based systems engineering (MBSE).","source_id":"wikipedia.article.capella-engineering","source_sha256":"4ee6cdaf07a8dc72bb2b665c8ccd04d00b2bb79276537aaa99c553815f40751f","start":109}],"target_id":"concept.wikipedia.capella-engineering","target_kind":"node","target_sha256":"40b67203dcbde5750ed907a67c9a9856fd2939bbd27ab2f01d6ac5686ed13757"}],"concept.wikipedia.carath-odory-s-criterion":[{"id":"assertion.concept.wikipedia.carath-odory-s-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carathéodory's criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carathéodory's criterion\", CC BY-SA 4.0) states: Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","support":[{"end":287,"quote":"Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","source_id":"wikipedia.article.carath-odory-s-criterion","source_sha256":"f3ecce1321d61476c56d1646aee0304ac323e66e9ab4fd5da6da5ccdef9240ef","start":112}],"target_id":"concept.wikipedia.carath-odory-s-criterion","target_kind":"node","target_sha256":"59872bb9555da560bf0853f7ffa1852f847a7a2d666ca76a6b0059d6d3b93ec2"}],"concept.wikipedia.carlyle-circle":[{"id":"assertion.concept.wikipedia.carlyle-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carlyle circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carlyle circle\", CC BY-SA 4.0) states: In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","support":[{"end":248,"quote":"In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","source_id":"wikipedia.article.carlyle-circle","source_sha256":"841dc6275d353d1fc39a204a9e8f830f6fc0813432eb42e829ebaa1416eb744e","start":102}],"target_id":"concept.wikipedia.carlyle-circle","target_kind":"node","target_sha256":"b0a3f933f753e7cd9e873577fa6b22a849587bfed5120ecee0b2f50be5f5c193"}],"concept.wikipedia.carnot-heat-engine":[{"id":"assertion.concept.wikipedia.carnot-heat-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carnot heat engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carnot heat engine\", CC BY-SA 4.0) states: A Carnot heat engine (English: kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","support":[{"end":223,"quote":"A Carnot heat engine (English:  kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","source_id":"wikipedia.article.carnot-heat-engine","source_sha256":"a3388dda742833ef37d8d531e31834b3c8e3a7e073d41b1f5e30b433460a0377","start":102}],"target_id":"concept.wikipedia.carnot-heat-engine","target_kind":"node","target_sha256":"0830b2ac597e4fccd5de35f6f276da12c9314d838c767818f2d3356896f64bf2"}],"concept.wikipedia.carr-du-champ-operator":[{"id":"assertion.concept.wikipedia.carr-du-champ-operator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carré du champ operator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carré du champ operator\", CC BY-SA 4.0) states: The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","support":[{"end":250,"quote":"The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","source_id":"wikipedia.article.carr-du-champ-operator","source_sha256":"d673519d1db90e0c5f79fba43334b8e401cb12df7ac3778d1154c1a445870017","start":111}],"target_id":"concept.wikipedia.carr-du-champ-operator","target_kind":"node","target_sha256":"35ef349e83c8ccdd4ac66a720692503325820a48f9b0811263cf4a4796e5c140"}],"concept.wikipedia.carrier-grade":[{"id":"assertion.concept.wikipedia.carrier-grade","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Carrier grade as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Carrier grade\", CC BY-SA 4.0) states: In telecommunications, a \"carrier grade\" or \"carrier class\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","support":[{"end":292,"quote":"In telecommunications, a \\\"carrier grade\\\" or \\\"carrier class\\\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","source_id":"wikipedia.article.carrier-grade","source_sha256":"a2c19541ebc187140fa989d59138cf80c36dcb82a5b5591d388be475a4b1e1a6","start":101}],"target_id":"concept.wikipedia.carrier-grade","target_kind":"node","target_sha256":"692a4a369e3cbbaca1d8bf0b7e87168ed1bdc688229f32015440941c4f8da5fc"}],"concept.wikipedia.cartan-decomposition":[{"id":"assertion.concept.wikipedia.cartan-decomposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartan decomposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartan decomposition\", CC BY-SA 4.0) states: In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","support":[{"end":291,"quote":"In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","source_id":"wikipedia.article.cartan-decomposition","source_sha256":"c30eb6ab6e24651df27226cc5f941bb696975a30807c7b920a9f1e72d27e03e0","start":107}],"target_id":"concept.wikipedia.cartan-decomposition","target_kind":"node","target_sha256":"9ce586b427ddfa9d78ef6841234739e50a7fdef865698d81e0841c74debf9ae2"}],"concept.wikipedia.cartesian-circle":[{"id":"assertion.concept.wikipedia.cartesian-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesian circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesian circle\", CC BY-SA 4.0) states: The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","support":[{"end":252,"quote":"The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","source_id":"wikipedia.article.cartesian-circle","source_sha256":"b9ad40ec83da7d3be4126d60529fb8a230e7d7871e0b3558b7aa4c1125e34cdf","start":103}],"target_id":"concept.wikipedia.cartesian-circle","target_kind":"node","target_sha256":"719af8da7d8e64e900131d2ce931dbaefc4f9917116a9ca3c52cc3063f3077af"}],"concept.wikipedia.cartesian-doubt":[{"id":"assertion.concept.wikipedia.cartesian-doubt","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesian doubt as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesian doubt\", CC BY-SA 4.0) states: Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","support":[{"end":221,"quote":"Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","source_id":"wikipedia.article.cartesian-doubt","source_sha256":"302f95d3603e1e368c47a2e213dea68a6e4a78c40a1ae1ba47d7c4a36ec2310b","start":103}],"target_id":"concept.wikipedia.cartesian-doubt","target_kind":"node","target_sha256":"580370303d4a45ae3145c64d75701d19722417365a6a8a53679d91735a1f57e3"}],"concept.wikipedia.cartesianism":[{"id":"assertion.concept.wikipedia.cartesianism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cartesianism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cartesianism\", CC BY-SA 4.0) states: Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","support":[{"end":327,"quote":"Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","source_id":"wikipedia.article.cartesianism","source_sha256":"9d5c9d8206ca0efbbb7d695bdca99071a19485ab4790822c7dc26abc00705906","start":100}],"target_id":"concept.wikipedia.cartesianism","target_kind":"node","target_sha256":"18a2f4bb60d3fcbe5b8fda75d2560338d2733d30754214427b5e8a426d83382f"}],"concept.wikipedia.cascading-failure":[{"id":"assertion.concept.wikipedia.cascading-failure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cascading failure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cascading failure\", CC BY-SA 4.0) states: A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","support":[{"end":305,"quote":"A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","source_id":"wikipedia.article.cascading-failure","source_sha256":"17d11c28a4c0727ab0261180a95493d30dffb2bc7dac7589b14696d8abd8b9b6","start":103}],"target_id":"concept.wikipedia.cascading-failure","target_kind":"node","target_sha256":"94ecaef30c3186eaad1b57119dffdfcd7ab959eca498c1a54069196180aef835"}],"concept.wikipedia.case-based-reasoning":[{"id":"assertion.concept.wikipedia.case-based-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Case-based reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Case-based reasoning\", CC BY-SA 4.0) states: Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","support":[{"end":240,"quote":"Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","source_id":"wikipedia.article.case-based-reasoning","source_sha256":"ad3130fdf0a05cdac606c0a3979ca3ff3c092c21969b6e05189f4ef99836dbce","start":106}],"target_id":"concept.wikipedia.case-based-reasoning","target_kind":"node","target_sha256":"4f91ce90050b534a6579907c54bdd70516ff1acea3720b4521f3033a2ca09551"}],"concept.wikipedia.cask-breather":[{"id":"assertion.concept.wikipedia.cask-breather","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cask breather as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cask breather\", CC BY-SA 4.0) states: A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","support":[{"end":206,"quote":"A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","source_id":"wikipedia.article.cask-breather","source_sha256":"41940e320fa2db650106e6b1ffd50031301a1962a30d5ab409ef7569979e0b3d","start":101}],"target_id":"concept.wikipedia.cask-breather","target_kind":"node","target_sha256":"d17629432fc1f59d507a8a06edf414e532a962cc84f241bbcb21eec046a307cd"}],"concept.wikipedia.castellated-beam":[{"id":"assertion.concept.wikipedia.castellated-beam","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Castellated beam as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Castellated beam\", CC BY-SA 4.0) states: A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","support":[{"end":233,"quote":"A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","source_id":"wikipedia.article.castellated-beam","source_sha256":"8cb68fd74fb1f58695c219bc45816d4d0f4e8b704a98787c0006c10fe539abcf","start":104}],"target_id":"concept.wikipedia.castellated-beam","target_kind":"node","target_sha256":"c189a5657f84cf07665caa9ceea45946f3a86368d6ffde2948144bc3146a2866"}],"concept.wikipedia.catch-22-logic":[{"id":"assertion.concept.wikipedia.catch-22-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catch-22 (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catch-22 (logic)\", CC BY-SA 4.0) states: A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","support":[{"end":226,"quote":"A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","source_id":"wikipedia.article.catch-22-logic","source_sha256":"04077c23956fd698e6d16f303bce9fafffe9a7c35ad79274652ecd90b5383066","start":103}],"target_id":"concept.wikipedia.catch-22-logic","target_kind":"node","target_sha256":"272383c4d2b248170c0e5caaa1d8faa659a9f18a837a5ede3814aeb6c7b76898"}],"concept.wikipedia.categorical-set-theory":[{"id":"assertion.concept.wikipedia.categorical-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Categorical set theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Categorical set theory\", CC BY-SA 4.0) states: Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","support":[{"end":250,"quote":"Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","source_id":"wikipedia.article.categorical-set-theory","source_sha256":"28774ed84d976863d27359bb660a743ecb874cb4e6eccc20f240aa886c4d2405","start":109}],"target_id":"concept.wikipedia.categorical-set-theory","target_kind":"node","target_sha256":"8dd7999c4d371799c90bfa53c74e79727577968577d52d2cfe8f334e4cf3c7c3"}],"concept.wikipedia.category-mathematics":[{"id":"assertion.concept.wikipedia.category-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category (mathematics)\", CC BY-SA 4.0) states: In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \"objects\" that are linked by \"arrows\".","support":[{"end":278,"quote":"In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \\\"objects\\\" that are linked by \\\"arrows\\\".","source_id":"wikipedia.article.category-mathematics","source_sha256":"2f33f56822c212be644c3add26f7f137eec08dc7f3307704e7bb0a74b067e56e","start":107}],"target_id":"concept.wikipedia.category-mathematics","target_kind":"node","target_sha256":"933cfaa4806947b6a4fe4ea0635a2861c0e4315fb93a093add62922d01c7b316"}],"concept.wikipedia.category-mistake":[{"id":"assertion.concept.wikipedia.category-mistake","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category mistake as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category mistake\", CC BY-SA 4.0) states: A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","support":[{"end":425,"quote":"A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","source_id":"wikipedia.article.category-mistake","source_sha256":"956f1f2582f79a87aefc73743c54eca32ba93782bf3b8261425281dce1542606","start":102}],"target_id":"concept.wikipedia.category-mistake","target_kind":"node","target_sha256":"d0360af13757b4ae879eb758054f75fe765ec5450671cedea42d4c4225ed34e6"}],"concept.wikipedia.category-of-manifolds":[{"id":"assertion.concept.wikipedia.category-of-manifolds","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of manifolds as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of manifolds\", CC BY-SA 4.0) states: In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","support":[{"end":304,"quote":"In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","source_id":"wikipedia.article.category-of-manifolds","source_sha256":"fd16ab2d52b0fb1584b3dd5d45d2d1fcf604958da652c8acfaccbd3727267e3a","start":109}],"target_id":"concept.wikipedia.category-of-manifolds","target_kind":"node","target_sha256":"66656e6e6ee95b3cd88b9d79397ca506a509d2757c31da4817e1fb80d4e75077"}],"concept.wikipedia.category-of-markov-kernels":[{"id":"assertion.concept.wikipedia.category-of-markov-kernels","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of Markov kernels as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of Markov kernels\", CC BY-SA 4.0) states: In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","support":[{"end":274,"quote":"In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","source_id":"wikipedia.article.category-of-markov-kernels","source_sha256":"a693805c5e959707c669de918b127e09234aeb7fa9ceb60fb97f2429a688475f","start":114}],"target_id":"concept.wikipedia.category-of-markov-kernels","target_kind":"node","target_sha256":"508d2ac6c083d49ab538f0e74f1f86c5581169e33beab98f61e06371f5e750d7"}],"concept.wikipedia.category-of-measurable-spaces":[{"id":"assertion.concept.wikipedia.category-of-measurable-spaces","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Category of measurable spaces as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Category of measurable spaces\", CC BY-SA 4.0) states: In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","support":[{"end":280,"quote":"In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","source_id":"wikipedia.article.category-of-measurable-spaces","source_sha256":"a6bb45d7bfdbd29a78266325fe017caeaba245141663d3d7db02d45bd732f6cb","start":117}],"target_id":"concept.wikipedia.category-of-measurable-spaces","target_kind":"node","target_sha256":"83a5346b3ef3b3cd3ca82f60b9b6b577d379dda931113e94a8fffceb019cc694"}],"concept.wikipedia.catu-ko-i":[{"id":"assertion.concept.wikipedia.catu-ko-i","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catuṣkoṭi as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catuṣkoṭi\", CC BY-SA 4.0) states: Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","support":[{"end":468,"quote":"Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","source_id":"wikipedia.article.catu-ko-i","source_sha256":"73a48076333f1a394e7e06c647b0a20ed038fbff807e459d63f30b332e0210ed","start":97}],"target_id":"concept.wikipedia.catu-ko-i","target_kind":"node","target_sha256":"cb531ef78c06d73198998eb4a624c4d596079f5c357a157b29d0b33f4b6886ee"}],"concept.wikipedia.cauchy-principal-value":[{"id":"assertion.concept.wikipedia.cauchy-principal-value","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy principal value as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy principal value\", CC BY-SA 4.0) states: In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","support":[{"end":285,"quote":"In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","source_id":"wikipedia.article.cauchy-principal-value","source_sha256":"9e9ddfb310a457fa2dfaef81f563f8bb47e5ee6030cc00bd5846514368f8fab2","start":108}],"target_id":"concept.wikipedia.cauchy-principal-value","target_kind":"node","target_sha256":"b5883697fc7989cc014dded2093577157a977362ae59eee3a3c010d336878f75"}],"concept.wikipedia.cauchy-product":[{"id":"assertion.concept.wikipedia.cauchy-product","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy product as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy product\", CC BY-SA 4.0) states: In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","support":[{"end":230,"quote":"In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","source_id":"wikipedia.article.cauchy-product","source_sha256":"bb2751a5a561a2c105aa56979ff27b4b66b35e1cab50f59752226a9b616642cd","start":100}],"target_id":"concept.wikipedia.cauchy-product","target_kind":"node","target_sha256":"22c9dae0142b924a13da9c82ded5deada2ebc53b9f8fb52aa5218419752d1380"}],"concept.wikipedia.cauchy-sequence":[{"id":"assertion.concept.wikipedia.cauchy-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy sequence\", CC BY-SA 4.0) states: In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","support":[{"end":228,"quote":"In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","source_id":"wikipedia.article.cauchy-sequence","source_sha256":"53f85965297862f6dbd698932b6da80e1f98f3c6eb470946f490abda84f81534","start":99}],"target_id":"concept.wikipedia.cauchy-sequence","target_kind":"node","target_sha256":"05ff707ef980bec38f159d000f75f9beeb28c3676c1a7e652b115f8e9942eb62"}],"concept.wikipedia.causal-closure":[{"id":"assertion.concept.wikipedia.causal-closure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal closure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal closure\", CC BY-SA 4.0) states: Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","support":[{"end":274,"quote":"Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","source_id":"wikipedia.article.causal-closure","source_sha256":"fb94c89fbc2ed08d63ddf0adda4c342eb5d73a5e07e4d6f655408dd511f34926","start":101}],"target_id":"concept.wikipedia.causal-closure","target_kind":"node","target_sha256":"1124f81d5fbaf9b158cac751f0ff8ee5fc38e6ddd020a56aa320f041da446408"}],"concept.wikipedia.causal-inference":[{"id":"assertion.concept.wikipedia.causal-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal inference\", CC BY-SA 4.0) states: Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","support":[{"end":248,"quote":"Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","source_id":"wikipedia.article.causal-inference","source_sha256":"242c6c1788209dde36e5b79e754ca5e4118e34c40f22e5da512d7be09f409ea3","start":104}],"target_id":"concept.wikipedia.causal-inference","target_kind":"node","target_sha256":"a81dcf34c5af14e3c98b255cc674fcb9285a8a1987e52d0484d6beee6cc9e58f"}],"concept.wikipedia.causal-model":[{"id":"assertion.concept.wikipedia.causal-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal model\", CC BY-SA 4.0) states: In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","support":[{"end":257,"quote":"In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","source_id":"wikipedia.article.causal-model","source_sha256":"7a8677e583f6cf9a4203056d7a4f89195acaacac1810c7005159506d02e80778","start":99}],"target_id":"concept.wikipedia.causal-model","target_kind":"node","target_sha256":"35d403a8c5806d883080ee20ee4ba1266e5e02b69b765b01ac9ea4e2f69e0da0"}],"concept.wikipedia.causal-reasoning":[{"id":"assertion.concept.wikipedia.causal-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal reasoning\", CC BY-SA 4.0) states: Causal reasoning is the process of identifying causality: the relationship between a cause and its effect.","support":[{"end":211,"quote":"Causal reasoning is the process of  identifying causality: the relationship between a cause and its effect.","source_id":"wikipedia.article.causal-reasoning","source_sha256":"0924b63059b05b075516d7e1ff02fe0a26404a826031eadc5fe2c634f1301114","start":104}],"target_id":"concept.wikipedia.causal-reasoning","target_kind":"node","target_sha256":"3911048a8f71f452e2138ea2cc6e4cbcd7bc16b016e61201a43cb9a0a480fedf"}],"concept.wikipedia.causal-theory-of-reference":[{"id":"assertion.concept.wikipedia.causal-theory-of-reference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Causal theory of reference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Causal theory of reference\", CC BY-SA 4.0) states: A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","support":[{"end":251,"quote":"A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","source_id":"wikipedia.article.causal-theory-of-reference","source_sha256":"b6677a481ece0b884ee88d002270ccf3ce9fd5ea11909c62c872802de8075a4b","start":112}],"target_id":"concept.wikipedia.causal-theory-of-reference","target_kind":"node","target_sha256":"b3b77a5a6c66ee713470842e4beb8a602a3a1bb719f6df4ebb9d7ed890770afe"}],"concept.wikipedia.center-algebra":[{"id":"assertion.concept.wikipedia.center-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Center (algebra) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Center (algebra)\", CC BY-SA 4.0) states: The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","support":[{"end":253,"quote":"The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","source_id":"wikipedia.article.center-algebra","source_sha256":"78d35093cbe7b4676dbec8933820bef9b972deed3a66e6a3207440c1177cc32e","start":102}],"target_id":"concept.wikipedia.center-algebra","target_kind":"node","target_sha256":"4b341d9d2c385289d51d7c9466c591801771e9a9ea34802bfa76a3dbbadd3c62"}],"concept.wikipedia.centerpoint-geometry":[{"id":"assertion.concept.wikipedia.centerpoint-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centerpoint (geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centerpoint (geometry)\", CC BY-SA 4.0) states: In statistics and computational geometry, the notion of centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","support":[{"end":259,"quote":"In statistics and computational geometry, the notion of  centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","source_id":"wikipedia.article.centerpoint-geometry","source_sha256":"2014e08ef97885622cda78edd8d76bff3bf6956bb20e7eaf54e60a632b1b2f28","start":110}],"target_id":"concept.wikipedia.centerpoint-geometry","target_kind":"node","target_sha256":"2bd15a9cac05beaab33a0d654c41f866ef6ed86dab5ece04b281d5822a6603d6"}],"concept.wikipedia.centrifugal-governor":[{"id":"assertion.concept.wikipedia.centrifugal-governor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centrifugal governor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centrifugal governor\", CC BY-SA 4.0) states: A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","support":[{"end":308,"quote":"A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","source_id":"wikipedia.article.centrifugal-governor","source_sha256":"7c2953a34fc653ddbef2bd60b520404a309f873e1fb75b03c934f8fe5d92d996","start":105}],"target_id":"concept.wikipedia.centrifugal-governor","target_kind":"node","target_sha256":"b6642e1100d5ad1db7b7e9940383b21cc916e044e10bd66341745853acdff09f"}],"concept.wikipedia.ceramic-engine":[{"id":"assertion.concept.wikipedia.ceramic-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ceramic engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ceramic engine\", CC BY-SA 4.0) states: A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","support":[{"end":201,"quote":"A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","source_id":"wikipedia.article.ceramic-engine","source_sha256":"b83c7382617d93ea456a9a0b42ce7614a0b009330c0908473253c9c879f3a0ee","start":102}],"target_id":"concept.wikipedia.ceramic-engine","target_kind":"node","target_sha256":"9920fa6ba4ddad3b78d966dc701cb0a21dfef5ba58d9356de51e72af5acfbb10"}],"concept.wikipedia.certificate-of-analysis":[{"id":"assertion.concept.wikipedia.certificate-of-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Certificate of analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Certificate of analysis\", CC BY-SA 4.0) states: A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","support":[{"end":411,"quote":"A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","source_id":"wikipedia.article.certificate-of-analysis","source_sha256":"6a81ecc05424f3d7caed8a2cfd6e7814cd978a1235f86870e8dbdc2eb82fc0e4","start":111}],"target_id":"concept.wikipedia.certificate-of-analysis","target_kind":"node","target_sha256":"28ef2ac601edfa82fcbb766fdfea5dfe323fb06d60784852d809e415f55a4f41"}],"concept.wikipedia.chain-complex":[{"id":"assertion.concept.wikipedia.chain-complex","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain complex as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain complex\", CC BY-SA 4.0) states: In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","support":[{"end":355,"quote":"In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","source_id":"wikipedia.article.chain-complex","source_sha256":"22d40bbd2a657da5a7b9343e3217e31e6fefca3c5bb97c416a10f4675c937600","start":99}],"target_id":"concept.wikipedia.chain-complex","target_kind":"node","target_sha256":"eee39aef75238a7787c28f270f38a01808f516d8f7f80f9aabd4663437c50e5c"}],"concept.wikipedia.chain-conveyor":[{"id":"assertion.concept.wikipedia.chain-conveyor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain conveyor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain conveyor\", CC BY-SA 4.0) states: A chain conveyor is a type of conveyor system for moving material through production lines.","support":[{"end":193,"quote":"A chain conveyor is a type of conveyor system for moving material through production lines.","source_id":"wikipedia.article.chain-conveyor","source_sha256":"7c946d4923b94c20809b380d613f179113d1f481edf142f09a9d5f8771eaeafd","start":102}],"target_id":"concept.wikipedia.chain-conveyor","target_kind":"node","target_sha256":"64508c60ba8e9d9a1ea160899e528df03a2f6492f7ca931e50847a06b897fc71"}],"concept.wikipedia.chain-drive":[{"id":"assertion.concept.wikipedia.chain-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chain drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chain drive\", CC BY-SA 4.0) states: A chain drive is a way of transmitting mechanical power from one place to another.","support":[{"end":180,"quote":"A chain drive is a way of transmitting mechanical power from one place to another.","source_id":"wikipedia.article.chain-drive","source_sha256":"bb59794860e665a9b385f695f63ebbb9db0559cec0f449c54530671c0f87ec61","start":98}],"target_id":"concept.wikipedia.chain-drive","target_kind":"node","target_sha256":"67734377f514dc854fae84ac10e9a780386def25bc4b3474103cf97d7d4249ac"}],"concept.wikipedia.change-management-engineering":[{"id":"assertion.concept.wikipedia.change-management-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Change management (engineering) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Change management (engineering)\", CC BY-SA 4.0) states: The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","support":[{"end":298,"quote":"The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","source_id":"wikipedia.article.change-management-engineering","source_sha256":"e85374f6ead1d44407f5a0cf1779aa9402772f897057cc20c618de0c2888af90","start":118}],"target_id":"concept.wikipedia.change-management-engineering","target_kind":"node","target_sha256":"22b34fd317f9492151a5e99f9850ff2cd028cfb8eeafa26677804585f8278c84"}],"concept.wikipedia.change-request":[{"id":"assertion.concept.wikipedia.change-request","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Change request as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Change request\", CC BY-SA 4.0) states: A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","support":[{"end":288,"quote":"A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","source_id":"wikipedia.article.change-request","source_sha256":"6b66df5d69b44e4eb0ea2b52a78b7bcec2ebbf1cfb18dcf7465cfcb8045ebb43","start":101}],"target_id":"concept.wikipedia.change-request","target_kind":"node","target_sha256":"05371ac72dd0cbc6f4101e80098b20f3e35478725adb24caae642d5f1f8e122a"}],"concept.wikipedia.charlesworth-s-paradox":[{"id":"assertion.concept.wikipedia.charlesworth-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Charlesworth's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Charlesworth's paradox\", CC BY-SA 4.0) states: Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","support":[{"end":218,"quote":"Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","source_id":"wikipedia.article.charlesworth-s-paradox","source_sha256":"369764d4ac63eaa4f55d11677709461b62e6bfa19c023277153fa018d5b7137d","start":110}],"target_id":"concept.wikipedia.charlesworth-s-paradox","target_kind":"node","target_sha256":"40b0308f1adf4cb1a2b1ec806a595a7cc978b72bd3722b397728790f35d7ac3d"}],"concept.wikipedia.charts-on-so-3":[{"id":"assertion.concept.wikipedia.charts-on-so-3","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Charts on SO(3) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Charts on SO(3)\", CC BY-SA 4.0) states: In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","support":[{"end":259,"quote":"In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","source_id":"wikipedia.article.charts-on-so-3","source_sha256":"50304f33e9274ceae69130dffaef7de1c915fc2a554811107330bcbbe3bf9d79","start":101}],"target_id":"concept.wikipedia.charts-on-so-3","target_kind":"node","target_sha256":"1f24c0a8ddb070c9036178d38d9fe6c515824cd2f6f507a047c028d8a1d406d6"}],"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion":[{"id":"assertion.concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chebychev–Grübler–Kutzbach criterion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chebychev–Grübler–Kutzbach criterion\", CC BY-SA 4.0) states: The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","support":[{"end":302,"quote":"The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","source_id":"wikipedia.article.chebychev-gr-bler-kutzbach-criterion","source_sha256":"27b84df9c052b60ee23a0632d36eea21c17f2c3d5cec06931f9800a55c2b812c","start":124}],"target_id":"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","target_kind":"node","target_sha256":"21d55008593a3593f2e77b8936c78b91a4b79d510da61bafd5888e1f0ba8e061"}],"concept.wikipedia.check-valve":[{"id":"assertion.concept.wikipedia.check-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Check valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Check valve\", CC BY-SA 4.0) states: A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","support":[{"end":285,"quote":"A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","source_id":"wikipedia.article.check-valve","source_sha256":"1a7dc92dc72cf671a62b4e87bffbf3c0a9848b9d77c2b3adb7d2ca598f77718b","start":97}],"target_id":"concept.wikipedia.check-valve","target_kind":"node","target_sha256":"0caa0e8077d6c71f0932daa7f92718f73b6b52a8bd3d7be29133979c19d762a2"}],"concept.wikipedia.chemical-field-effect-transistor":[{"id":"assertion.concept.wikipedia.chemical-field-effect-transistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemical field-effect transistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemical field-effect transistor\", CC BY-SA 4.0) states: A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","support":[{"end":281,"quote":"A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","source_id":"wikipedia.article.chemical-field-effect-transistor","source_sha256":"86b7403692df90b2c1c8249d79c083cf08b70588892d2698113a6ec89d1b7e1a","start":119}],"target_id":"concept.wikipedia.chemical-field-effect-transistor","target_kind":"node","target_sha256":"5b3e82843d8c09bc66ecc6c97ed8bf781e48abf1cbc457bd45625357f5dad9b5"}],"concept.wikipedia.chemical-reaction-engineering":[{"id":"assertion.concept.wikipedia.chemical-reaction-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemical reaction engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemical reaction engineering\", CC BY-SA 4.0) states: Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","support":[{"end":287,"quote":"Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","source_id":"wikipedia.article.chemical-reaction-engineering","source_sha256":"b29823347cf5868c7e0a84d218d0c5c2686995763e7a76877d7ba0407d708cc8","start":117}],"target_id":"concept.wikipedia.chemical-reaction-engineering","target_kind":"node","target_sha256":"1e16a07b0840977731dddd4a0bee7ade32cead3044ec8d4bd3886fb2658a2ad9"}],"concept.wikipedia.chemiresistor":[{"id":"assertion.concept.wikipedia.chemiresistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemiresistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemiresistor\", CC BY-SA 4.0) states: A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","support":[{"end":228,"quote":"A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","source_id":"wikipedia.article.chemiresistor","source_sha256":"93e4f962c8d91107f4959ff4a5abfdd1e522ebdc221d8ee6bb3252aa806ce63c","start":101}],"target_id":"concept.wikipedia.chemiresistor","target_kind":"node","target_sha256":"44c529ea0f05906a92c4593783a2fbc9d1ce189ca7e535d41a9b08b44739ee18"}],"concept.wikipedia.cheng-cycle":[{"id":"assertion.concept.wikipedia.cheng-cycle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cheng cycle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cheng cycle\", CC BY-SA 4.0) states: The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","support":[{"end":210,"quote":"The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","source_id":"wikipedia.article.cheng-cycle","source_sha256":"2434ca9265ed5901dde678a2858b3560acdc1a8f15bf209c5550c9344383cd33","start":99}],"target_id":"concept.wikipedia.cheng-cycle","target_kind":"node","target_sha256":"a202d3311b422472adfdaa7d15a9dfc566cd8889ddce1431a4cee17c23617c5d"}],"concept.wikipedia.cheng-zhu-school":[{"id":"assertion.concept.wikipedia.cheng-zhu-school","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cheng–Zhu school as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cheng–Zhu school\", CC BY-SA 4.0) states: The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","support":[{"end":408,"quote":"The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","source_id":"wikipedia.article.cheng-zhu-school","source_sha256":"b156efc57d3ee71b94e786717390896de9601954a3f9613eb4482e42456ec363","start":104}],"target_id":"concept.wikipedia.cheng-zhu-school","target_kind":"node","target_sha256":"e5cbd1f298b6956e155e131d9ddcb81a3399bf3f39478582834282fbcd53c4e8"}],"concept.wikipedia.chern-simons-theory":[{"id":"assertion.concept.wikipedia.chern-simons-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"∞-Chern–Simons theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"∞-Chern–Simons theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","support":[{"end":381,"quote":"In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","source_id":"wikipedia.article.chern-simons-theory","source_sha256":"ded8bf2a9ed4d0b05a908b8509e0abd7acc271891485d312dee9c017e6123ca3","start":109}],"target_id":"concept.wikipedia.chern-simons-theory","target_kind":"node","target_sha256":"925032e1401f7b048da1ee8801c50e4e206a2a45772fe1c8701083003862deb2"}],"concept.wikipedia.chern-weil-theory":[{"id":"assertion.concept.wikipedia.chern-weil-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"∞-Chern–Weil theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"∞-Chern–Weil theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","support":[{"end":266,"quote":"In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","source_id":"wikipedia.article.chern-weil-theory","source_sha256":"4b3ba1067c252140d50318c8725e201eb105af9441ac3b576200a8c60ad42442","start":107}],"target_id":"concept.wikipedia.chern-weil-theory","target_kind":"node","target_sha256":"ae35ea7bb6704c312f3341744453cfb49fe83c869e1ff8582010a1a97426c92b"}],"concept.wikipedia.chicken-or-the-egg":[{"id":"assertion.concept.wikipedia.chicken-or-the-egg","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chicken or the egg as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chicken or the egg\", CC BY-SA 4.0) states: The chicken or the egg causality dilemma is commonly stated as the question, \"which came first: the chicken or the egg?\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \"Chicken-and-egg\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","support":[{"end":674,"quote":"The chicken or the egg causality dilemma is commonly stated as the question, \\\"which came first: the chicken or the egg?\\\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \\\"Chicken-and-egg\\\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","source_id":"wikipedia.article.chicken-or-the-egg","source_sha256":"a9b60e86b3089057f35d4d722de1e276bd4241ade199cd332788ddfd6c8d447e","start":103}],"target_id":"concept.wikipedia.chicken-or-the-egg","target_kind":"node","target_sha256":"6b836de96e7dfee9bc882310aa624e171f570293f61d58259eab0f83de6db50d"}],"concept.wikipedia.chinese-room":[{"id":"assertion.concept.wikipedia.chinese-room","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chinese room as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chinese room\", CC BY-SA 4.0) states: The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","support":[{"end":304,"quote":"The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","source_id":"wikipedia.article.chinese-room","source_sha256":"0b901b384e735ea38bbe8ace107ab546897543562952bde152fea83a4d8224e3","start":96}],"target_id":"concept.wikipedia.chinese-room","target_kind":"node","target_sha256":"3fa4787c773e8d9f8164788fedc1b4f060f174e80dc9dd4621aa3734558b8916"}],"concept.wikipedia.chiplet":[{"id":"assertion.concept.wikipedia.chiplet","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chiplet as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chiplet\", CC BY-SA 4.0) states: A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","support":[{"end":192,"quote":"A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","source_id":"wikipedia.article.chiplet","source_sha256":"ff21ad2d82bee803a58ea3a4ff0576a5b483a6efda36ee14858f313cdbe2bb5e","start":95}],"target_id":"concept.wikipedia.chiplet","target_kind":"node","target_sha256":"ad1eb48f97ce997b5174a6af97cd4aa09f03cf9706f8eb8b70506e74ce6da312"}],"concept.wikipedia.chirp-z-transform":[{"id":"assertion.concept.wikipedia.chirp-z-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chirp Z-transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chirp Z-transform\", CC BY-SA 4.0) states: The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","support":[{"end":191,"quote":"The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","source_id":"wikipedia.article.chirp-z-transform","source_sha256":"922290d84f0283f2f5d54f58b02ab45b46c091bbf2e71a53a257899e27f6587b","start":103}],"target_id":"concept.wikipedia.chirp-z-transform","target_kind":"node","target_sha256":"c169b18e359e990299afd35e8a52f2dddb7994bb2e4934defa4187cb4309039f"}],"concept.wikipedia.chirplet-transform":[{"id":"assertion.concept.wikipedia.chirplet-transform","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chirplet transform as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chirplet transform\", CC BY-SA 4.0) states: In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","support":[{"end":243,"quote":"In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","source_id":"wikipedia.article.chirplet-transform","source_sha256":"fcda238fb91673db4714411d8b101757735255b2e05594c53aa52ad81f697aa4","start":105}],"target_id":"concept.wikipedia.chirplet-transform","target_kind":"node","target_sha256":"32fa01fe10d1ad83dedab9aef7cd5256cd0859a815c230f5fa3c82d753d4b44a"}],"concept.wikipedia.chowla-selberg-formula":[{"id":"assertion.concept.wikipedia.chowla-selberg-formula","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chowla–Selberg formula as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chowla–Selberg formula\", CC BY-SA 4.0) states: In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","support":[{"end":331,"quote":"In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","source_id":"wikipedia.article.chowla-selberg-formula","source_sha256":"49f7d3c743372c9de7da7b5c1394c62ea89b676827aad994957c2a109c26ec2b","start":108}],"target_id":"concept.wikipedia.chowla-selberg-formula","target_kind":"node","target_sha256":"82cdd4153ea5d7bb2fa9edea1ec679cc451a626e985066c510d44dd1b2cd1458"}],"concept.wikipedia.chronotope":[{"id":"assertion.concept.wikipedia.chronotope","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chronotope as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chronotope\", CC BY-SA 4.0) states: In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","support":[{"end":241,"quote":"In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","source_id":"wikipedia.article.chronotope","source_sha256":"f3d0d852eac82065ad300511606506a97254b4973e5d6e2d917d09e06930880b","start":97}],"target_id":"concept.wikipedia.chronotope","target_kind":"node","target_sha256":"74ad440e20c41ac9e47a7e66de6955432570f351e629d64b356da35e4e5cc4d5"}],"concept.wikipedia.church-turing-thesis":[{"id":"assertion.concept.wikipedia.church-turing-thesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Church–Turing thesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Church–Turing thesis\", CC BY-SA 4.0) states: In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","support":[{"end":207,"quote":"In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","source_id":"wikipedia.article.church-turing-thesis","source_sha256":"7e49b2f983e78728733742f03b9b7616ab118b80662c8a762f3ace379b6cfadc","start":104}],"target_id":"concept.wikipedia.church-turing-thesis","target_kind":"node","target_sha256":"076f9b219736e2398050b1a668e130d108769a33f1f87edf7d77bc95587583cb"}],"concept.wikipedia.chv-tal-sankoff-constants":[{"id":"assertion.concept.wikipedia.chv-tal-sankoff-constants","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chvátal–Sankoff constants as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chvátal–Sankoff constants\", CC BY-SA 4.0) states: In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","support":[{"end":261,"quote":"In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","source_id":"wikipedia.article.chv-tal-sankoff-constants","source_sha256":"df489560da7927e6dd0227a1f02125dae27b615d24d625fbb1b9214a8ec85c24","start":113}],"target_id":"concept.wikipedia.chv-tal-sankoff-constants","target_kind":"node","target_sha256":"14f4781552c6a63ae239ed5a442bde9643d70308cf1bbd7f88187a544be2edc5"}],"concept.wikipedia.circuit-extraction":[{"id":"assertion.concept.wikipedia.circuit-extraction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit extraction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit extraction\", CC BY-SA 4.0) states: The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","support":[{"end":314,"quote":"The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","source_id":"wikipedia.article.circuit-extraction","source_sha256":"ee20e836c0024d969216e8d0dbadd3f2cc66cfc9bbc3e561ce4a5e9249eaefd3","start":105}],"target_id":"concept.wikipedia.circuit-extraction","target_kind":"node","target_sha256":"1008b5daa50729a7ce0e6046111c189f25e1f142af8324c82fc6f0b21882354a"}],"concept.wikipedia.circuit-topology-electrical":[{"id":"assertion.concept.wikipedia.circuit-topology-electrical","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit topology (electrical) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit topology (electrical)\", CC BY-SA 4.0) states: The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","support":[{"end":242,"quote":"The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","source_id":"wikipedia.article.circuit-topology-electrical","source_sha256":"9dac29b3e96f4f15c1e9f2853e8c793a36cbc3b81b83f0774b78dd170582c0f2","start":117}],"target_id":"concept.wikipedia.circuit-topology-electrical","target_kind":"node","target_sha256":"379f049a0b1a0c17f5d65c7a08dd5e7f045d68e2d20afeb682600c4e451f84d8"}],"concept.wikipedia.circuit-total-limitation":[{"id":"assertion.concept.wikipedia.circuit-total-limitation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circuit total limitation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circuit total limitation\", CC BY-SA 4.0) states: Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","support":[{"end":254,"quote":"Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","source_id":"wikipedia.article.circuit-total-limitation","source_sha256":"6a17504b78adeeb63f6d822079003c2cb7aa4974d9876f443d519bed378d9c9c","start":112}],"target_id":"concept.wikipedia.circuit-total-limitation","target_kind":"node","target_sha256":"5f609d3457eb6f38a6eeb1600c922c341f9791d4f8348a5dc848b3e328ee3a62"}],"concept.wikipedia.circular-definition":[{"id":"assertion.concept.wikipedia.circular-definition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circular definition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circular definition\", CC BY-SA 4.0) states: A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","support":[{"end":275,"quote":"A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","source_id":"wikipedia.article.circular-definition","source_sha256":"124d9f4114184e4279f82cf44105815897a217d48ca8e7992fc94af8c2efd161","start":104}],"target_id":"concept.wikipedia.circular-definition","target_kind":"node","target_sha256":"38999584670ae5e4817057b95947ec0c839563da531017f3294491d4ef515a09"}],"concept.wikipedia.circular-reasoning":[{"id":"assertion.concept.wikipedia.circular-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circular reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circular reasoning\", CC BY-SA 4.0) states: Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","support":[{"end":289,"quote":"Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","source_id":"wikipedia.article.circular-reasoning","source_sha256":"593b9564704ddf3a8d10f886e4a5e1a90b1d7c16b84a9026f3f2d5b3697a16be","start":104}],"target_id":"concept.wikipedia.circular-reasoning","target_kind":"node","target_sha256":"ac242bd0bc11cd475f279caa2c85a032dc9d813d456a1e2046dc97cdb2de1765"}],"concept.wikipedia.circumstantial-evidence":[{"id":"assertion.concept.wikipedia.circumstantial-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Circumstantial evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Circumstantial evidence\", CC BY-SA 4.0) states: Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","support":[{"end":258,"quote":"Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","source_id":"wikipedia.article.circumstantial-evidence","source_sha256":"cd674333cb1694993ee0591db77e471e943ca5a53a16e7d9dd897c190ac65daf","start":109}],"target_id":"concept.wikipedia.circumstantial-evidence","target_kind":"node","target_sha256":"62502297973335772f47cbfdf9af323818d2741f55103b6f4c191c4275a40fb7"}],"concept.wikipedia.class-set-theory":[{"id":"assertion.concept.wikipedia.class-set-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Class (set theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Class (set theory)\", CC BY-SA 4.0) states: In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","support":[{"end":298,"quote":"In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","source_id":"wikipedia.article.class-set-theory","source_sha256":"2e9b3d2a3ebf6da8208ab8868c9fc64611462f304e2871e1f6a5871df3a3482a","start":103}],"target_id":"concept.wikipedia.class-set-theory","target_kind":"node","target_sha256":"e924c9aa36acd1ca9208bc713fa2734acf14bbd748cd670bd2444df51e415da7"}],"concept.wikipedia.classical-group":[{"id":"assertion.concept.wikipedia.classical-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Classical group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Classical group\", CC BY-SA 4.0) states: In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","support":[{"end":286,"quote":"In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","source_id":"wikipedia.article.classical-group","source_sha256":"512c90135fb983627b639d48a3384ca0e6e4fc01add0dc2c9e34a296f79e0974","start":103}],"target_id":"concept.wikipedia.classical-group","target_kind":"node","target_sha256":"bbf382746d5beb5fed005708263bb4c0cebe3e63459d6fedf9ce0858e7d0f995"}],"concept.wikipedia.clinamen":[{"id":"assertion.concept.wikipedia.clinamen","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clinamen as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clinamen\", CC BY-SA 4.0) states: Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","support":[{"end":234,"quote":"Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","source_id":"wikipedia.article.clinamen","source_sha256":"d60911b5cb9025dab70fd1c49ca691ef555750c016337260c9a918bcc243cfd4","start":95}],"target_id":"concept.wikipedia.clinamen","target_kind":"node","target_sha256":"6855af01d86449e5abcbae49af5d487e6c59f6df98e4233223a5739a125a661f"}],"concept.wikipedia.clinical-study-design":[{"id":"assertion.concept.wikipedia.clinical-study-design","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clinical study design as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clinical study design\", CC BY-SA 4.0) states: Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including epidemiology .","support":[{"end":325,"quote":"Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including  epidemiology .","source_id":"wikipedia.article.clinical-study-design","source_sha256":"469e50b6b7293b2265ac1db284a2eee1b6ea99a2d91a239a7afe547c67ffef35","start":108}],"target_id":"concept.wikipedia.clinical-study-design","target_kind":"node","target_sha256":"1fab7151a4906342a88ad25c613cbb27f481afd243dafe06ce300b7a18d4c2a9"}],"concept.wikipedia.closed-circle":[{"id":"assertion.concept.wikipedia.closed-circle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closed circle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closed circle\", CC BY-SA 4.0) states: A closed-circle argument is one that is unfalsifiable.","support":[{"end":154,"quote":"A closed-circle argument is one that is unfalsifiable.","source_id":"wikipedia.article.closed-circle","source_sha256":"4e6c411f68e678677c9c64c25b5d36e960a9747be2f9b09af0e9a199819cdef6","start":100}],"target_id":"concept.wikipedia.closed-circle","target_kind":"node","target_sha256":"2dd0c894d1178c78a20ac31ac1d3f00f9d8c4abfc0d0700f3a046a3872301aad"}],"concept.wikipedia.closed-concept":[{"id":"assertion.concept.wikipedia.closed-concept","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closed concept as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closed concept\", CC BY-SA 4.0) states: A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","support":[{"end":244,"quote":"A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","source_id":"wikipedia.article.closed-concept","source_sha256":"3d9c0ee415c3b384f7985197ffd140aea2405022f073e69d66ca945b06d05a2e","start":101}],"target_id":"concept.wikipedia.closed-concept","target_kind":"node","target_sha256":"0c6d97b1f88f282415268d708e2369c970f09bb4db7c83a452f4666645b3164d"}],"concept.wikipedia.closure-mathematics":[{"id":"assertion.concept.wikipedia.closure-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Closure (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Closure (mathematics)\", CC BY-SA 4.0) states: In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","support":[{"end":294,"quote":"In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","source_id":"wikipedia.article.closure-mathematics","source_sha256":"fad5e051b80cfebe5962a0cef91c6ef764ea3691406144b1e6dfd0409f441fa1","start":107}],"target_id":"concept.wikipedia.closure-mathematics","target_kind":"node","target_sha256":"f940c5cde3786d451b573ec2b664fa80b08fab9d83f38a44c34fb1bf894cf165"}],"concept.wikipedia.cluster-algebra":[{"id":"assertion.concept.wikipedia.cluster-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cluster algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cluster algebra\", CC BY-SA 4.0) states: Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007).","support":[{"end":208,"quote":"Cluster algebras are a class of commutative rings introduced by Fomin and  Zelevinsky (2002, 2003, 2007).","source_id":"wikipedia.article.cluster-algebra","source_sha256":"c65c4441e3d225f175593744698667504a5571b9f7d5ed3986614b116e477813","start":103}],"target_id":"concept.wikipedia.cluster-algebra","target_kind":"node","target_sha256":"ae072a9ceed02a485135c387f5defcbc24614c7f2e9fc41361c3a31f0deb44eb"}],"concept.wikipedia.cluster-aware-application":[{"id":"assertion.concept.wikipedia.cluster-aware-application","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cluster-aware application as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cluster-aware application\", CC BY-SA 4.0) states: A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","support":[{"end":473,"quote":"A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","source_id":"wikipedia.article.cluster-aware-application","source_sha256":"30026c59f25d6c40ad0248bec16ce2ffb62d87805c9a96b80848e5fe20c0957c","start":113}],"target_id":"concept.wikipedia.cluster-aware-application","target_kind":"node","target_sha256":"9fdfc7cf60ffa007f8d4bc19eacafd00966ae8bd8668e8ac1309083efa9a6971"}],"concept.wikipedia.clutch-delay-valve":[{"id":"assertion.concept.wikipedia.clutch-delay-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Clutch delay valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Clutch delay valve\", CC BY-SA 4.0) states: A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","support":[{"end":233,"quote":"A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","source_id":"wikipedia.article.clutch-delay-valve","source_sha256":"1e3a3fb77dca6789c9c45809525c54010826d9c680d4cd4e419e6738b5847f1f","start":106}],"target_id":"concept.wikipedia.clutch-delay-valve","target_kind":"node","target_sha256":"3ca343d712b66bd42a99b16c662348498c2468fdb4ef6d0a8beff9fbd97b62a1"}],"concept.wikipedia.code-talker-paradox":[{"id":"assertion.concept.wikipedia.code-talker-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Code-talker paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Code-talker paradox\", CC BY-SA 4.0) states: A code-talker paradox is a situation in which a language prevents communication.","support":[{"end":187,"quote":"A code-talker paradox  is a situation in which a language prevents communication.","source_id":"wikipedia.article.code-talker-paradox","source_sha256":"0e41ce9daa899a3ebae1c5299dd2bd902c6c2ab385cf02862cfd04a1d4d4edd8","start":106}],"target_id":"concept.wikipedia.code-talker-paradox","target_kind":"node","target_sha256":"ba3d77aa1e53b0e09548a4a1b52432ae5bb28f96ab65273ec2aca86cc12d9b8f"}],"concept.wikipedia.cogging-torque":[{"id":"assertion.concept.wikipedia.cogging-torque","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cogging torque as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cogging torque\", CC BY-SA 4.0) states: In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","support":[{"end":293,"quote":"In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","source_id":"wikipedia.article.cogging-torque","source_sha256":"d96a973e4fe2c5c67248822086bedc19fd8c394091b2cf03418df64856485731","start":101}],"target_id":"concept.wikipedia.cogging-torque","target_kind":"node","target_sha256":"2ee66d99a2d0cdd78ab6cda1faefffc132944642f165daada2d2dd2f22ea52b8"}],"concept.wikipedia.cognitive-bias":[{"id":"assertion.concept.wikipedia.cognitive-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive bias\", CC BY-SA 4.0) states: A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","support":[{"end":194,"quote":"A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","source_id":"wikipedia.article.cognitive-bias","source_sha256":"e9c54218c1e04bdf03db7f2e538281e4ab88fda19f930896293718b7ce7892b7","start":99}],"target_id":"concept.wikipedia.cognitive-bias","target_kind":"node","target_sha256":"fedef8c0648429d7eaac52b7c40af95910e43068707b70a3b14cde74b29537dc"}],"concept.wikipedia.cognitive-dissonance":[{"id":"assertion.concept.wikipedia.cognitive-dissonance","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive dissonance as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive dissonance\", CC BY-SA 4.0) states: In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","support":[{"end":279,"quote":"In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","source_id":"wikipedia.article.cognitive-dissonance","source_sha256":"8c67bea1fe823d93215c02cf24af0d446830df92a7aaddfcb9592010d2def5f2","start":106}],"target_id":"concept.wikipedia.cognitive-dissonance","target_kind":"node","target_sha256":"32e8c53a3172b2f92be41251c516a03539631e282c74c8bd975529fbf68a0304"}],"concept.wikipedia.cognitive-inertia":[{"id":"assertion.concept.wikipedia.cognitive-inertia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive inertia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive inertia\", CC BY-SA 4.0) states: Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","support":[{"end":253,"quote":"Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","source_id":"wikipedia.article.cognitive-inertia","source_sha256":"348db5eae5f89761b052e13242cf0b13943470cabd9bce4a568e391037f1aa01","start":105}],"target_id":"concept.wikipedia.cognitive-inertia","target_kind":"node","target_sha256":"0943e1c5ec533453fbdebd1f0755028b8394af61b6952265805b8f0892aac641"}],"concept.wikipedia.cognitive-justice":[{"id":"assertion.concept.wikipedia.cognitive-justice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive justice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive justice\", CC BY-SA 4.0) states: The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","support":[{"end":268,"quote":"The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","source_id":"wikipedia.article.cognitive-justice","source_sha256":"ac1cc3471d0b23f3651674309660f73850803efd5bcac9d174a94347972bd50b","start":105}],"target_id":"concept.wikipedia.cognitive-justice","target_kind":"node","target_sha256":"0b623a28ad5e6ffe7f38d8be86235464a9ad87c60d107deacdc98757b8d0426c"}],"concept.wikipedia.cognitive-synonymy":[{"id":"assertion.concept.wikipedia.cognitive-synonymy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cognitive synonymy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cognitive synonymy\", CC BY-SA 4.0) states: Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","support":[{"end":356,"quote":"Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","source_id":"wikipedia.article.cognitive-synonymy","source_sha256":"954f9c661a11e39b69885d6c0988a84fe7e674a174ad9c97008cba9f6cc00f4e","start":106}],"target_id":"concept.wikipedia.cognitive-synonymy","target_kind":"node","target_sha256":"a8baf3f1f6bad19c8df03e92633059b46dc537ad01aae32cf93e9c6837ac0583"}],"concept.wikipedia.coherence-theory-of-truth":[{"id":"assertion.concept.wikipedia.coherence-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherence theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherence theory of truth\", CC BY-SA 4.0) states: In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","support":[{"end":378,"quote":"In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","source_id":"wikipedia.article.coherence-theory-of-truth","source_sha256":"f76e5b76e758866ed3cdadca27e4d6dbd7ee76bdc19869176572b2959d4e1196","start":112}],"target_id":"concept.wikipedia.coherence-theory-of-truth","target_kind":"node","target_sha256":"55ef365566a7e6604f4ede6b3a7d2c6024ee4317c3821e36d9b9e788c91dd9b5"}],"concept.wikipedia.coherent-extrapolated-volition":[{"id":"assertion.concept.wikipedia.coherent-extrapolated-volition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherent extrapolated volition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherent extrapolated volition\", CC BY-SA 4.0) states: Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","support":[{"end":526,"quote":"Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","source_id":"wikipedia.article.coherent-extrapolated-volition","source_sha256":"e6e9a89ce7fbe5253f7fb2feb0bd5fea5d81677cdb40d2d68f0b2fed74dda734","start":118}],"target_id":"concept.wikipedia.coherent-extrapolated-volition","target_kind":"node","target_sha256":"69bbb7b1a411ae04c3465b0d9bf479ced7f6b546a18961e23484dc1062632286"}],"concept.wikipedia.coherentism":[{"id":"assertion.concept.wikipedia.coherentism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coherentism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coherentism\", CC BY-SA 4.0) states: In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","support":[{"end":261,"quote":"In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","source_id":"wikipedia.article.coherentism","source_sha256":"35607264669b023d485f17a29a539bc20d9a3037fce55461ccef925e0037ab62","start":97}],"target_id":"concept.wikipedia.coherentism","target_kind":"node","target_sha256":"1bdfb435df8e507b9963f391fa9e27d7fe2d731163c17cbc4da0ee6d3a33cf8e"}],"concept.wikipedia.coilgun":[{"id":"assertion.concept.wikipedia.coilgun","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coilgun as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coilgun\", CC BY-SA 4.0) states: A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","support":[{"end":296,"quote":"A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","source_id":"wikipedia.article.coilgun","source_sha256":"ad4936854c339fd08501b108770d5f014342fb71bd97332c29f9eca57b2a3530","start":93}],"target_id":"concept.wikipedia.coilgun","target_kind":"node","target_sha256":"a17efbea19218de705a2691b4d2bfad2d60e4c5bfa02c4ccc4f1e750af77ef50"}],"concept.wikipedia.coincidence":[{"id":"assertion.concept.wikipedia.coincidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coincidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coincidence\", CC BY-SA 4.0) states: A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","support":[{"end":224,"quote":"A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","source_id":"wikipedia.article.coincidence","source_sha256":"c99834b1bb56a288b42f2667eae2525460ba95992779d798151f7fb8a4815672","start":98}],"target_id":"concept.wikipedia.coincidence","target_kind":"node","target_sha256":"e6ca12e34d4d94c2ca80b41b4fc2dab3ffd19afa9d4800d997c90fc669f2e2d8"}],"concept.wikipedia.cold-metal-transfer":[{"id":"assertion.concept.wikipedia.cold-metal-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cold metal transfer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cold metal transfer\", CC BY-SA 4.0) states: Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","support":[{"end":198,"quote":"Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","source_id":"wikipedia.article.cold-metal-transfer","source_sha256":"fd86885e2a5f207d99c349eef1809e1abde2fd6b4de3e54ad3a12baf6aa5f167","start":107}],"target_id":"concept.wikipedia.cold-metal-transfer","target_kind":"node","target_sha256":"790fa514f1034ef7aea3dd9898edede3fad7b0874916b327bf0c4a634baa3b7d"}],"concept.wikipedia.cold-welding":[{"id":"assertion.concept.wikipedia.cold-welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cold welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cold welding\", CC BY-SA 4.0) states: Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","support":[{"end":265,"quote":"Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","source_id":"wikipedia.article.cold-welding","source_sha256":"1a6d7992e9475f3dff931e059e3a4f5e9a478aeed7dd97e343976341dbfab908","start":98}],"target_id":"concept.wikipedia.cold-welding","target_kind":"node","target_sha256":"ffa5dbf78eafde7fc25c8a2870c3aa6a9247af9cfe942a6d9ce5c9f150dbe36d"}],"concept.wikipedia.collectively-exhaustive-events":[{"id":"assertion.concept.wikipedia.collectively-exhaustive-events","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Collectively exhaustive events as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Collectively exhaustive events\", CC BY-SA 4.0) states: In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","support":[{"end":245,"quote":"In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","source_id":"wikipedia.article.collectively-exhaustive-events","source_sha256":"2c06c0854aeb61f4c178076e55de936bc489772eb4f2310e9b4dd2c7cdeb34d1","start":117}],"target_id":"concept.wikipedia.collectively-exhaustive-events","target_kind":"node","target_sha256":"655fc4c6f5f09a89c414b41993a5fb6b206ed5602b7cd1599221eb6af986e5b8"}],"concept.wikipedia.colloid-thruster":[{"id":"assertion.concept.wikipedia.colloid-thruster","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Colloid thruster as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Colloid thruster\", CC BY-SA 4.0) states: A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","support":[{"end":286,"quote":"A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","source_id":"wikipedia.article.colloid-thruster","source_sha256":"3f3c5066d96ee788177202c79e792dfdb6dc24888ab6b3e2a0ea2429eb1becbb","start":103}],"target_id":"concept.wikipedia.colloid-thruster","target_kind":"node","target_sha256":"b6cd59ed87ff50492d8afda9eff69d9ec86c28d584cd958c9a46eae930842908"}],"concept.wikipedia.colonnette":[{"id":"assertion.concept.wikipedia.colonnette","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Colonnette as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Colonnette\", CC BY-SA 4.0) states: A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","support":[{"end":200,"quote":"A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","source_id":"wikipedia.article.colonnette","source_sha256":"ac17ca5fa1f0b5d6face1e7f1f860556e44434392d9ff709e4d194f940684d96","start":98}],"target_id":"concept.wikipedia.colonnette","target_kind":"node","target_sha256":"229325b2b7b1aec3a6e66f7b2e59eed9503e6e6181d6fccf61215d9d083aa68f"}],"concept.wikipedia.color-wheel-optics":[{"id":"assertion.concept.wikipedia.color-wheel-optics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Color wheel (optics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Color wheel (optics)\", CC BY-SA 4.0) states: A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","support":[{"end":279,"quote":"A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","source_id":"wikipedia.article.color-wheel-optics","source_sha256":"9dce9d7fa53af131cf6dff65b4c0416bb00d89de26b2107407b571a174374ca0","start":108}],"target_id":"concept.wikipedia.color-wheel-optics","target_kind":"node","target_sha256":"a5e881cc6421330e171c55f117ca61d127ab6179fa1728dfbe8deb8f202627ec"}],"concept.wikipedia.column":[{"id":"assertion.concept.wikipedia.column","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Column as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Column\", CC BY-SA 4.0) states: A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","support":[{"end":279,"quote":"A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","source_id":"wikipedia.article.column","source_sha256":"60e18dd12103b732dbec6f3b6d960ba354f161af4559b35365ac95d76cba06fe","start":90}],"target_id":"concept.wikipedia.column","target_kind":"node","target_sha256":"d21726e99a5e862ec0866204b90ef631de723e8dc700bfaadfa9cbadaa6dd1d4"}],"concept.wikipedia.comb-drive":[{"id":"assertion.concept.wikipedia.comb-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Comb drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Comb drive\", CC BY-SA 4.0) states: Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","support":[{"end":265,"quote":"Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","source_id":"wikipedia.article.comb-drive","source_sha256":"4151cf95b72d7e97f4b9e1d0d4b2c969f6fce4356774a4a20af911543f457e91","start":97}],"target_id":"concept.wikipedia.comb-drive","target_kind":"node","target_sha256":"4f2b504dd2e211c5784ae6051c42ae2a7631a35319b5cc6fb9800da6f4f06b2e"}],"concept.wikipedia.combinatorial-principles":[{"id":"assertion.concept.wikipedia.combinatorial-principles","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Combinatorial principles as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Combinatorial principles\", CC BY-SA 4.0) states: In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","support":[{"end":243,"quote":"In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","source_id":"wikipedia.article.combinatorial-principles","source_sha256":"be735fcba375516cd441d6e80188f5d350c7e3461fd8981ed6f11e97ec03dd38","start":111}],"target_id":"concept.wikipedia.combinatorial-principles","target_kind":"node","target_sha256":"34aa89c3c8bdcad1abb957147f5f69cd7c6f9c3af5c19d7977bcb652f82cffec"}],"concept.wikipedia.common-rail-electricity":[{"id":"assertion.concept.wikipedia.common-rail-electricity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Common rail (electricity) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Common rail (electricity)\", CC BY-SA 4.0) states: In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","support":[{"end":251,"quote":"In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","source_id":"wikipedia.article.common-rail-electricity","source_sha256":"521fdfde5873f04edaa98e161e90216f7f5abc4e6b4ff487bb3cc6e75350d572","start":113}],"target_id":"concept.wikipedia.common-rail-electricity","target_kind":"node","target_sha256":"1a75319a6db58982a374d173130fbeef9552070fab9b37fdcdc73cf4b600ca07"}],"concept.wikipedia.commonsense-reasoning":[{"id":"assertion.concept.wikipedia.commonsense-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commonsense reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commonsense reasoning\", CC BY-SA 4.0) states: In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","support":[{"end":284,"quote":"In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","source_id":"wikipedia.article.commonsense-reasoning","source_sha256":"79dfaaf8a17afada47df8fd1516b74868745a7f430edc7676a9f6ea3c796586c","start":107}],"target_id":"concept.wikipedia.commonsense-reasoning","target_kind":"node","target_sha256":"b96e796885376db9a97103882e7ac6b56a73984dc98d02f471821648b33ce4ca"}],"concept.wikipedia.communal-reinforcement":[{"id":"assertion.concept.wikipedia.communal-reinforcement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Communal reinforcement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Communal reinforcement\", CC BY-SA 4.0) states: Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","support":[{"end":305,"quote":"Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","source_id":"wikipedia.article.communal-reinforcement","source_sha256":"dd0a6ac02fc1214911a482b316b86b27bec777271ca03b6bd0b76b9d2eed34e1","start":108}],"target_id":"concept.wikipedia.communal-reinforcement","target_kind":"node","target_sha256":"e734cd35643bb4e7c544af15cb303367c3bcffe91fc502bc6961f29b8327d847"}],"concept.wikipedia.communicative-rationality":[{"id":"assertion.concept.wikipedia.communicative-rationality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Communicative rationality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Communicative rationality\", CC BY-SA 4.0) states: Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","support":[{"end":315,"quote":"Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","source_id":"wikipedia.article.communicative-rationality","source_sha256":"7d7d9cf6112c067487d42640818b2e9295ac43bc19698a97671b2ee18574f28a","start":112}],"target_id":"concept.wikipedia.communicative-rationality","target_kind":"node","target_sha256":"d4f2dd4da078c87bb5a6adcd146b51204b2c38115d7177f15fd20f49dcacd63b"}],"concept.wikipedia.commutator-electric":[{"id":"assertion.concept.wikipedia.commutator-electric","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commutator (electric) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commutator (electric)\", CC BY-SA 4.0) states: A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","support":[{"end":304,"quote":"A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","source_id":"wikipedia.article.commutator-electric","source_sha256":"e8a43d11d4c1aca3d6c382d2012e1b130c9460762c9698fcac9334612c992e17","start":107}],"target_id":"concept.wikipedia.commutator-electric","target_kind":"node","target_sha256":"eb134f0ab70663675e9ce08157aa63d05e2c91ed4d45565eb79e83314c50f11f"}],"concept.wikipedia.compact-group":[{"id":"assertion.concept.wikipedia.compact-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compact group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compact group\", CC BY-SA 4.0) states: In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","support":[{"end":226,"quote":"In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","source_id":"wikipedia.article.compact-group","source_sha256":"35d708c463f35cbf9e4e6cef74590f216be95e9be8c0633b407112bb9112d734","start":99}],"target_id":"concept.wikipedia.compact-group","target_kind":"node","target_sha256":"57d6be2607cb1a8bba04698f642538d781b80ebda1ffb0924adeff1d22f5a06c"}],"concept.wikipedia.complemented-lattice":[{"id":"assertion.concept.wikipedia.complemented-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Complemented lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Complemented lattice\", CC BY-SA 4.0) states: In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","support":[{"end":341,"quote":"In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","source_id":"wikipedia.article.complemented-lattice","source_sha256":"81912268c8489d6de5885090a08604035d5d9d0f4f625d545511c781347db689","start":106}],"target_id":"concept.wikipedia.complemented-lattice","target_kind":"node","target_sha256":"f456a20ae46b0d2967a9a6cd70c3062aad169a1f403fc81f21ed8306733d1a29"}],"concept.wikipedia.compliant-mechanism":[{"id":"assertion.concept.wikipedia.compliant-mechanism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compliant mechanism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compliant mechanism\", CC BY-SA 4.0) states: In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","support":[{"end":257,"quote":"In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","source_id":"wikipedia.article.compliant-mechanism","source_sha256":"c67367a49866dca2637bd0f848fe8d1e0de38b1648788fd1f2083a04338f3254","start":107}],"target_id":"concept.wikipedia.compliant-mechanism","target_kind":"node","target_sha256":"02d35ebe960a2030fbc2f9f0f6ea9e60775824d52e1484218f7aa2936915c652"}],"concept.wikipedia.composite-bearing":[{"id":"assertion.concept.wikipedia.composite-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Composite bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Composite bearing\", CC BY-SA 4.0) states: A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","support":[{"end":284,"quote":"A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","source_id":"wikipedia.article.composite-bearing","source_sha256":"1fc2b25056d38c10399a589387f12ceab4504f4b7ca534fd49d630e6285b5d82","start":105}],"target_id":"concept.wikipedia.composite-bearing","target_kind":"node","target_sha256":"f495f74ade7a8dc7259ca60231387e5d6eb1f6be16f9e8b524e59b5ce9ff4e69"}],"concept.wikipedia.compossibility":[{"id":"assertion.concept.wikipedia.compossibility","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Compossibility as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Compossibility\", CC BY-SA 4.0) states: Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","support":[{"end":174,"quote":"Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","source_id":"wikipedia.article.compossibility","source_sha256":"1a0d0bb886c532c9f49b18951d408b26b318a93dabb2e6e3beae089ed184fe6e","start":101}],"target_id":"concept.wikipedia.compossibility","target_kind":"node","target_sha256":"b1a24f91ec29eda21d40a6a1e50728e62c1ba0f2d6da138465e91cd890f08122"}],"concept.wikipedia.comprehension-logic":[{"id":"assertion.concept.wikipedia.comprehension-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Comprehension (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Comprehension (logic)\", CC BY-SA 4.0) states: In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the context of a given discussion.","support":[{"end":365,"quote":"In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the  context of a given discussion.","source_id":"wikipedia.article.comprehension-logic","source_sha256":"50ed2821556fbf874e694debb50b8d7aada4de9779046d7d7d2ee3a121cae0e3","start":108}],"target_id":"concept.wikipedia.comprehension-logic","target_kind":"node","target_sha256":"1fffd1526cdf9535afcaa8d7107b6d51d5ce0c3eb883d15079867d9f0da45cee"}],"concept.wikipedia.computational-philosophy":[{"id":"assertion.concept.wikipedia.computational-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computational philosophy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computational philosophy\", CC BY-SA 4.0) states: Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","support":[{"end":212,"quote":"Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","source_id":"wikipedia.article.computational-philosophy","source_sha256":"b1e0443588ed2b19d16c7ed91ea2b5ce4fd7ab9b4d2b7f1b219cbf8a13bfd989","start":112}],"target_id":"concept.wikipedia.computational-philosophy","target_kind":"node","target_sha256":"9e983651e06e726061453c227fb7149b77ecfa45a59d8507ff0a92d23a11edc3"}],"concept.wikipedia.computer-aided-engineering":[{"id":"assertion.concept.wikipedia.computer-aided-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer-aided engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer-aided engineering\", CC BY-SA 4.0) states: Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","support":[{"end":228,"quote":"Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","source_id":"wikipedia.article.computer-aided-engineering","source_sha256":"db2519f264f43e5279bfcf554cf552981ac06cfe93bb5b64209143edf8fcdcca","start":112}],"target_id":"concept.wikipedia.computer-aided-engineering","target_kind":"node","target_sha256":"206417743b3a38db9b5f7057bb9789111a1d43e006df1051583ad7fe3571484d"}],"concept.wikipedia.concept-horse-paradox":[{"id":"assertion.concept.wikipedia.concept-horse-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Concept horse paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Concept horse paradox\", CC BY-SA 4.0) states: The concept \"horse\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","support":[{"end":376,"quote":"The concept \\\"horse\\\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","source_id":"wikipedia.article.concept-horse-paradox","source_sha256":"ea5fa1eea630e18d5b5f4518ed5ee5f27de6dbf8952de60e99e9453613468717","start":109}],"target_id":"concept.wikipedia.concept-horse-paradox","target_kind":"node","target_sha256":"fc20abfb90c896a5f730bed6e69c4e4c63eaa88bd8060fb2e2d83688a6394aa2"}],"concept.wikipedia.conciliationism":[{"id":"assertion.concept.wikipedia.conciliationism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conciliationism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conciliationism\", CC BY-SA 4.0) states: Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","support":[{"end":287,"quote":"Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","source_id":"wikipedia.article.conciliationism","source_sha256":"32919f592cf06b4b05ebc138df8a89ab889f90020d98d85a079cb2002957962e","start":103}],"target_id":"concept.wikipedia.conciliationism","target_kind":"node","target_sha256":"14902faf3e866d4430098f14a948b3820fb0f331481355dd744a1864a6fbd537"}],"concept.wikipedia.concurrent-engineering":[{"id":"assertion.concept.wikipedia.concurrent-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Concurrent engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Concurrent engineering\", CC BY-SA 4.0) states: Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","support":[{"end":410,"quote":"Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","source_id":"wikipedia.article.concurrent-engineering","source_sha256":"3a8b92bc56e57dd0b5730445976844726319802e8fffbfb6d513f6624671c09b","start":109}],"target_id":"concept.wikipedia.concurrent-engineering","target_kind":"node","target_sha256":"04870d09e0dcafddd82b7b367747e8e2e1ae27364a217c7fdb5eee478f81dc87"}],"concept.wikipedia.condensed-detachment":[{"id":"assertion.concept.wikipedia.condensed-detachment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Condensed detachment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Condensed detachment\", CC BY-SA 4.0) states: Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","support":[{"end":233,"quote":"Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","source_id":"wikipedia.article.condensed-detachment","source_sha256":"be598a37fa95fe8f1b87d6ed8e52fc919d79ba2e0563db6c043b10e040e09b33","start":107}],"target_id":"concept.wikipedia.condensed-detachment","target_kind":"node","target_sha256":"3a5d2b287090b5885074d279130b7f50fc8c4bd15f2a7b9109c5dafa46fff15d"}],"concept.wikipedia.condenser-heat-transfer":[{"id":"assertion.concept.wikipedia.condenser-heat-transfer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Condenser (heat transfer) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Condenser (heat transfer)\", CC BY-SA 4.0) states: In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","support":[{"end":254,"quote":"In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","source_id":"wikipedia.article.condenser-heat-transfer","source_sha256":"4a0cb9d64021201dcc02426501d556b929972e86ea82f83eba8272c9b8176428","start":113}],"target_id":"concept.wikipedia.condenser-heat-transfer","target_kind":"node","target_sha256":"7bb00b838ff6eccc33c720f447b2f1f963b1431269f1dde539481f3672a08487"}],"concept.wikipedia.conditional-logic":[{"id":"assertion.concept.wikipedia.conditional-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conditional logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conditional logic\", CC BY-SA 4.0) states: Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \"if A, (then) B\".","support":[{"end":255,"quote":"Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \\\"if A, (then) B\\\".","source_id":"wikipedia.article.conditional-logic","source_sha256":"40dbc85923596d12adbc82c3ecd310d0eeb6aa1d35961b0e60928d63d5c10d64","start":105}],"target_id":"concept.wikipedia.conditional-logic","target_kind":"node","target_sha256":"28482fe15f7b68108fea578fd5df733641867f60ef85b9c22031a2087c7c1e6f"}],"concept.wikipedia.conductive-ink":[{"id":"assertion.concept.wikipedia.conductive-ink","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conductive ink as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conductive ink\", CC BY-SA 4.0) states: Conductive ink is an ink that results in a printed object which conducts electricity.","support":[{"end":186,"quote":"Conductive ink is an ink that results in a printed object which conducts electricity.","source_id":"wikipedia.article.conductive-ink","source_sha256":"169c308ce62921cd97bc46089820e85607aa71f914e7c1586dd4899ee872de1d","start":101}],"target_id":"concept.wikipedia.conductive-ink","target_kind":"node","target_sha256":"ecf811be75316796d6dafbe5ebdc51d4140edc10c531d4029db198665686b6c2"}],"concept.wikipedia.conductor-pipe":[{"id":"assertion.concept.wikipedia.conductor-pipe","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conductor pipe as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conductor pipe\", CC BY-SA 4.0) states: A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","support":[{"end":251,"quote":"A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","source_id":"wikipedia.article.conductor-pipe","source_sha256":"7dfe9b612531a0c5eb53cdb8198dbae968b51b4a5e0a1bf19d69bc32309d1a6c","start":102}],"target_id":"concept.wikipedia.conductor-pipe","target_kind":"node","target_sha256":"bf148239cdf92817f9c3831b99d344e3ee30f1a07ca3b25063d5ebed3907c819"}],"concept.wikipedia.cone-condition":[{"id":"assertion.concept.wikipedia.cone-condition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cone condition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cone condition\", CC BY-SA 4.0) states: In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","support":[{"end":207,"quote":"In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","source_id":"wikipedia.article.cone-condition","source_sha256":"0a22a283deba1a09d4156e84f6fe2fb50c3c1391fd7dcfdd08bd68928d2fe110","start":102}],"target_id":"concept.wikipedia.cone-condition","target_kind":"node","target_sha256":"680e483d5e72d2abd901be264ed9b14049d0a89ba0fe6fcdd697f72b64a10874"}],"concept.wikipedia.congruence-lattice-problem":[{"id":"assertion.concept.wikipedia.congruence-lattice-problem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Congruence lattice problem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Congruence lattice problem\", CC BY-SA 4.0) states: In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","support":[{"end":272,"quote":"In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","source_id":"wikipedia.article.congruence-lattice-problem","source_sha256":"7cbe7e2b50506f3541a538968db4b9f17f3751976a237a57b9cc5814b4266a20","start":113}],"target_id":"concept.wikipedia.congruence-lattice-problem","target_kind":"node","target_sha256":"fb1e706e03b01af871bd4fe38231542ccc2b7afc7c3dca18827b677e641da8ad"}],"concept.wikipedia.consciousness-causes-collapse":[{"id":"assertion.concept.wikipedia.consciousness-causes-collapse","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consciousness causes collapse as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consciousness causes collapse\", CC BY-SA 4.0) states: The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","support":[{"end":326,"quote":"The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","source_id":"wikipedia.article.consciousness-causes-collapse","source_sha256":"573b919daead58639b71ae6819898b6c238ace503302a27bbf630cf1afa1dbf2","start":117}],"target_id":"concept.wikipedia.consciousness-causes-collapse","target_kind":"node","target_sha256":"1c13bf40b95250ebd70b60b525cb77ec3d7ed77a39766d1b46e4d6028a967cf6"}],"concept.wikipedia.consistency":[{"id":"assertion.concept.wikipedia.consistency","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consistency as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consistency\", CC BY-SA 4.0) states: In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","support":[{"end":189,"quote":"In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","source_id":"wikipedia.article.consistency","source_sha256":"9d5c7a83c091d8e68e1390f69873b6001ae130112287aacf1c659435771dbcf4","start":96}],"target_id":"concept.wikipedia.consistency","target_kind":"node","target_sha256":"c0e13fe69293f96210a8c0cf814efca0caf1ae9e1fec7a75136f3c1567c96191"}],"concept.wikipedia.consistent-heuristic":[{"id":"assertion.concept.wikipedia.consistent-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consistent heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consistent heuristic\", CC BY-SA 4.0) states: In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","support":[{"end":387,"quote":"In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","source_id":"wikipedia.article.consistent-heuristic","source_sha256":"3e86587298bff18843913446c19b798417932f361fbc7e9cd6de3dc6f09996ef","start":107}],"target_id":"concept.wikipedia.consistent-heuristic","target_kind":"node","target_sha256":"ae7a9043fc4723e1387f24d3dc402aba03d2271e3a6b75017cbb6a6c0dc51437"}],"concept.wikipedia.constant-conjunction":[{"id":"assertion.concept.wikipedia.constant-conjunction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constant conjunction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constant conjunction\", CC BY-SA 4.0) states: In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","support":[{"end":327,"quote":"In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","source_id":"wikipedia.article.constant-conjunction","source_sha256":"845242ffdc477f00e6522035994bfaaa5708adbb6b78c9d2eed0d7c0a66c9e4e","start":108}],"target_id":"concept.wikipedia.constant-conjunction","target_kind":"node","target_sha256":"cd0b84f9e4c05fc0470606eaf7c9b2363e17567a926959d48f2467a4189f44f3"}],"concept.wikipedia.construct-psychology":[{"id":"assertion.concept.wikipedia.construct-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Construct (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Construct (psychology)\", CC BY-SA 4.0) states: In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","support":[{"end":329,"quote":"In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","source_id":"wikipedia.article.construct-psychology","source_sha256":"fa810c3da1e72c14e6d681990966e72cac23b3efd527d3e153a3c191baa864ee","start":110}],"target_id":"concept.wikipedia.construct-psychology","target_kind":"node","target_sha256":"4a90315e77e0d72662c1c8cf398cc4eaa995f96c6dfdf57c94d8f1b74c95a9d1"}],"concept.wikipedia.construction":[{"id":"assertion.concept.wikipedia.construction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Construction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Construction\", CC BY-SA 4.0) states: Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","support":[{"end":258,"quote":"Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","source_id":"wikipedia.article.construction","source_sha256":"1b82cc216da3b8984c856a5485feaebc909de2ba8bfa43fe50ebbd85891a96a0","start":98}],"target_id":"concept.wikipedia.construction","target_kind":"node","target_sha256":"67b25716da090bfa262cfd3e334d1a7f777161575b6682963f3b6568257b4b97"}],"concept.wikipedia.constructive-analysis":[{"id":"assertion.concept.wikipedia.constructive-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive analysis\", CC BY-SA 4.0) states: In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","support":[{"end":232,"quote":"In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","source_id":"wikipedia.article.constructive-analysis","source_sha256":"c6c6559836165d91a0f094cb502954f01607745dac90cfb7fcdf1f9c00f32966","start":107}],"target_id":"concept.wikipedia.constructive-analysis","target_kind":"node","target_sha256":"693805958b513a053a39efbae4ad9cab2aa8000bb181c2b2a82f74df2614d88d"}],"concept.wikipedia.constructive-empiricism":[{"id":"assertion.concept.wikipedia.constructive-empiricism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive empiricism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive empiricism\", CC BY-SA 4.0) states: In philosophy of science, constructive empiricism is a form of empiricism.","support":[{"end":183,"quote":"In philosophy of science, constructive empiricism is a form of empiricism.","source_id":"wikipedia.article.constructive-empiricism","source_sha256":"69e7b56ef19ea282aab326c257af46f33d36464e5496ddd66faed726d7847b51","start":109}],"target_id":"concept.wikipedia.constructive-empiricism","target_kind":"node","target_sha256":"f0e7597c3c925077d4e712217080c2b734ad743118f5edf36ed475cd076888b0"}],"concept.wikipedia.constructive-heuristic":[{"id":"assertion.concept.wikipedia.constructive-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructive heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructive heuristic\", CC BY-SA 4.0) states: A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","support":[{"end":283,"quote":"A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","source_id":"wikipedia.article.constructive-heuristic","source_sha256":"90cf5d9334fae3fe4abad966258e91d2d92655f4bf8088af2817d157ad9b3e00","start":110}],"target_id":"concept.wikipedia.constructive-heuristic","target_kind":"node","target_sha256":"bfed64788c99b1a6c1eb9c9dd84a017f160d407f18b1fe65582b06d94be184bd"}],"concept.wikipedia.constructivism-philosophy-of-mathematics":[{"id":"assertion.concept.wikipedia.constructivism-philosophy-of-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructivism (philosophy of mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructivism (philosophy of mathematics)\", CC BY-SA 4.0) states: In philosophy of mathematics, constructivism asserts that it is necessary to find (or \"construct\") a specific example of a mathematical object in order to prove that an example exists.","support":[{"end":313,"quote":"In philosophy of mathematics, constructivism asserts that it is necessary to find (or \\\"construct\\\") a specific example of a mathematical object in order to prove that an example exists.","source_id":"wikipedia.article.constructivism-philosophy-of-mathematics","source_sha256":"4d99a9efb371a4dbd956f007773d0ff120a39380cff072718ed56b41037ce858","start":127}],"target_id":"concept.wikipedia.constructivism-philosophy-of-mathematics","target_kind":"node","target_sha256":"c73257e36b8a12e1ba3f326c8cde25479c5daa2586cb5e054657d7288979a549"}],"concept.wikipedia.constructivism-philosophy-of-science":[{"id":"assertion.concept.wikipedia.constructivism-philosophy-of-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constructivism (philosophy of science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constructivism (philosophy of science)\", CC BY-SA 4.0) states: Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","support":[{"end":329,"quote":"Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","source_id":"wikipedia.article.constructivism-philosophy-of-science","source_sha256":"c59bd13b64e3c73a57dc5bb9a9bd73c9d697191c85b0f967d9b2602560fc30e0","start":124}],"target_id":"concept.wikipedia.constructivism-philosophy-of-science","target_kind":"node","target_sha256":"1b60f61b2205a87ba72acc35139c2a7a98f9aecd5bdae83a02e97af12982438c"}],"concept.wikipedia.contact-protection":[{"id":"assertion.concept.wikipedia.contact-protection","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contact protection as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contact protection\", CC BY-SA 4.0) states: Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","support":[{"end":359,"quote":"Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","source_id":"wikipedia.article.contact-protection","source_sha256":"396205f879a88700637b333baf6d3700cb7b27adb11fdc73c0ba80c25c7867cd","start":106}],"target_id":"concept.wikipedia.contact-protection","target_kind":"node","target_sha256":"47044cabf9c0a469fd0eaeef485286567bcce90279f22179669ae18ecf487a2a"}],"concept.wikipedia.contagion-heuristic":[{"id":"assertion.concept.wikipedia.contagion-heuristic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contagion heuristic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contagion heuristic\", CC BY-SA 4.0) states: The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \"contaminated\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","support":[{"end":472,"quote":"The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \\\"contaminated\\\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","source_id":"wikipedia.article.contagion-heuristic","source_sha256":"99ac656f63f8e7f3a94035758e90f69bbb5abd1792cf16fccb5c1561bd31bd1f","start":106}],"target_id":"concept.wikipedia.contagion-heuristic","target_kind":"node","target_sha256":"3136abd002a252d299ea632d19fe0563f1d818178078eeb6f8cafe3c00f7cb68"}],"concept.wikipedia.contingency-electrical-grid":[{"id":"assertion.concept.wikipedia.contingency-electrical-grid","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contingency (electrical grid) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contingency (electrical grid)\", CC BY-SA 4.0) states: In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","support":[{"end":356,"quote":"In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","source_id":"wikipedia.article.contingency-electrical-grid","source_sha256":"f79bcacc35234ab007162be9571951c8e980a8950bd9cd51fbf5d8c18f48797f","start":117}],"target_id":"concept.wikipedia.contingency-electrical-grid","target_kind":"node","target_sha256":"8d6a6e227c2b20ec9514ad4ecb36bf27a4271979cad82c33c2dd1216634dcf7e"}],"concept.wikipedia.contingency-philosophy":[{"id":"assertion.concept.wikipedia.contingency-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contingency (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contingency (philosophy)\", CC BY-SA 4.0) states: In logic, contingency is the feature of a statement making it neither necessary nor impossible.","support":[{"end":207,"quote":"In logic, contingency is the feature of a statement making it neither necessary nor impossible.","source_id":"wikipedia.article.contingency-philosophy","source_sha256":"89318778f0e417dd0c9d6cb748d21917469b53f6a0635a10e902fbc7a82d875e","start":112}],"target_id":"concept.wikipedia.contingency-philosophy","target_kind":"node","target_sha256":"a4d33d15fe391c57c2fa2998e33df3479703e858ba821be770334149f88689eb"}],"concept.wikipedia.continuous-emissions-monitoring-system":[{"id":"assertion.concept.wikipedia.continuous-emissions-monitoring-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Continuous emissions monitoring system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Continuous emissions monitoring system\", CC BY-SA 4.0) states: Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","support":[{"end":277,"quote":"Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","source_id":"wikipedia.article.continuous-emissions-monitoring-system","source_sha256":"b53c8fa953d09aa1f06196c40556eede26dd6aa8313aca94ec30b7bb6ddf89c3","start":126}],"target_id":"concept.wikipedia.continuous-emissions-monitoring-system","target_kind":"node","target_sha256":"80e9b67a5a37920fb27a7bb8e7f4f27c7ecca70330553931ac410ca3747ca5c7"}],"concept.wikipedia.continuous-function":[{"id":"assertion.concept.wikipedia.continuous-function","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Continuous function as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Continuous function\", CC BY-SA 4.0) states: In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","support":[{"end":246,"quote":"In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","source_id":"wikipedia.article.continuous-function","source_sha256":"2d045363976ce00f6ab9478d672ac6e42635958e20e4bad93f74527232c1e375","start":103}],"target_id":"concept.wikipedia.continuous-function","target_kind":"node","target_sha256":"eee30ff490dad4ee6898010afc753b2aa4e14404f302cc7ea83363dc12563f02"}],"concept.wikipedia.contra-principia-negantem-non-est-disputandum":[{"id":"assertion.concept.wikipedia.contra-principia-negantem-non-est-disputandum","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contra principia negantem non est disputandum as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contra principia negantem non est disputandum\", CC BY-SA 4.0) states: Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \"Against one who denies the principles, there can be no debate\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","support":[{"end":545,"quote":"Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \\\"Against one who denies the principles, there can be no debate\\\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","source_id":"wikipedia.article.contra-principia-negantem-non-est-disputandum","source_sha256":"074903846a947abcc2e855321c284025b44eaa8682f24084f2e42a83e803a70a","start":133}],"target_id":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","target_kind":"node","target_sha256":"b95968f092cd0823d23df2bbdf524fe4f61034361df9f867b73c089e713ab4ef"}],"concept.wikipedia.contrastivism":[{"id":"assertion.concept.wikipedia.contrastivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Contrastivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Contrastivism\", CC BY-SA 4.0) states: Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","support":[{"end":320,"quote":"Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","source_id":"wikipedia.article.contrastivism","source_sha256":"0f38f422f5694a2843db802aede0270bbb0530701adf65a1c700ac715df0e33d","start":101}],"target_id":"concept.wikipedia.contrastivism","target_kind":"node","target_sha256":"22a8bee992eda34049449604493c9e67ee36c6c2d8515614bea76372c19fb8a2"}],"concept.wikipedia.control-knob":[{"id":"assertion.concept.wikipedia.control-knob","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control knob as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control knob\", CC BY-SA 4.0) states: A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","support":[{"end":334,"quote":"A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","source_id":"wikipedia.article.control-knob","source_sha256":"cdddf90d1601e5dba4223c1947d34979c7ac9eaedb5e148ecaacde05cb15e2dd","start":99}],"target_id":"concept.wikipedia.control-knob","target_kind":"node","target_sha256":"0f036d69932dc21a8abeb7b27c399ee4905a0b769a880b921f0b82ff3be5aa68"}],"concept.wikipedia.control-valve":[{"id":"assertion.concept.wikipedia.control-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control valve\", CC BY-SA 4.0) states: A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","support":[{"end":236,"quote":"A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","source_id":"wikipedia.article.control-valve","source_sha256":"dea3a1d58ed7c6a67d6b5c1eacc2214098fb9a3110e4dcb1b8eeb2c9d9aa6409","start":100}],"target_id":"concept.wikipedia.control-valve","target_kind":"node","target_sha256":"f4fdfb2a5eb79e8bf454cdef32cc5c5519cdad7eaa2f3974193a631e2e7312a4"}],"concept.wikipedia.convergence-space":[{"id":"assertion.concept.wikipedia.convergence-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convergence space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convergence space\", CC BY-SA 4.0) states: In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","support":[{"end":475,"quote":"In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X.  Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","source_id":"wikipedia.article.convergence-space","source_sha256":"482e150d2fd638809536c528b75f4be97ce214e1e658cbcb834ed86bb136095f","start":105}],"target_id":"concept.wikipedia.convergence-space","target_kind":"node","target_sha256":"c75040f0251491d52fd1f66736700974422c2f32d546407f9f6cf1e8cea377c4"}],"concept.wikipedia.convex-curve":[{"id":"assertion.concept.wikipedia.convex-curve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex curve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex curve\", CC BY-SA 4.0) states: In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","support":[{"end":199,"quote":"In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","source_id":"wikipedia.article.convex-curve","source_sha256":"0546528fcb868127801a785cea9a973bb45fe6347c564ab10cbfddbb5778d68f","start":100}],"target_id":"concept.wikipedia.convex-curve","target_kind":"node","target_sha256":"1de85f897623ac78f71f37b2ab5b12f72ef18300c26dd172eae431ded4fbd8c3"}],"concept.wikipedia.convex-metric-space":[{"id":"assertion.concept.wikipedia.convex-metric-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex metric space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex metric space\", CC BY-SA 4.0) states: In mathematics, there are several notions of \"convexity\" on metric spaces.","support":[{"end":183,"quote":"In mathematics, there are several notions of \\\"convexity\\\" on metric spaces.","source_id":"wikipedia.article.convex-metric-space","source_sha256":"88cb54a5c5445bfb17acaa3480ccade55248c15ce2c711fa25eca46c5376d28a","start":107}],"target_id":"concept.wikipedia.convex-metric-space","target_kind":"node","target_sha256":"20382251df7d8fb7faf5e9d3d4894c14c70800597a6feb99d16e9c444f114052"}],"concept.wikipedia.convex-polygon":[{"id":"assertion.concept.wikipedia.convex-polygon","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex polygon as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex polygon\", CC BY-SA 4.0) states: In geometry, a convex polygon is a polygon that is the boundary of a convex set.","support":[{"end":180,"quote":"In geometry, a convex polygon is a polygon that is the boundary of a convex set.","source_id":"wikipedia.article.convex-polygon","source_sha256":"4a25651df36696133d7b4997d266e02a53104c6403f6d1a2bdff9f7274c780a5","start":100}],"target_id":"concept.wikipedia.convex-polygon","target_kind":"node","target_sha256":"b8c6c5fa24afdf423f204d38245dae167c4e0b02e7392f8fcc9aee6a40d21f9d"}],"concept.wikipedia.convex-set":[{"id":"assertion.concept.wikipedia.convex-set","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex set as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex set\", CC BY-SA 4.0) states: In geometry, a set of points is convex if it contains every line segment between two points in the set.","support":[{"end":197,"quote":"In geometry, a set of points is convex if it contains every line segment between two points in the set.","source_id":"wikipedia.article.convex-set","source_sha256":"0714df557ba3fa44d07b2891f42d726d481043817d4cd36cfc7da4329f5f1a50","start":94}],"target_id":"concept.wikipedia.convex-set","target_kind":"node","target_sha256":"09aa58c7fead3e56a65af3a443be49e6b32619a11cb0f8e5535019452e94fcab"}],"concept.wikipedia.convex-space":[{"id":"assertion.concept.wikipedia.convex-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex space\", CC BY-SA 4.0) states: In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","support":[{"end":247,"quote":"In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","source_id":"wikipedia.article.convex-space","source_sha256":"2bd8e49c8e93bbf5b034beed0e6c23e2ecdd1e0cab2c2c3cef2a90f29cb52616","start":100}],"target_id":"concept.wikipedia.convex-space","target_kind":"node","target_sha256":"f5d7f1948ac0946cfbcae5f33ce57dadbdf075b333f019da5ade2c8a028e8c7e"}],"concept.wikipedia.cooperative-principle":[{"id":"assertion.concept.wikipedia.cooperative-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cooperative principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cooperative principle\", CC BY-SA 4.0) states: In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","support":[{"end":411,"quote":"In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","source_id":"wikipedia.article.cooperative-principle","source_sha256":"cddff45fc57d4a37e40c194039779fb4735d149172711429f9f25e4982b0916f","start":108}],"target_id":"concept.wikipedia.cooperative-principle","target_kind":"node","target_sha256":"e29e308bf9c4c52fe0024d0c5af3db12a799de0c0abd7fcbfd2ab78c47c06fe2"}],"concept.wikipedia.copper-loss":[{"id":"assertion.concept.wikipedia.copper-loss","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Copper loss as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Copper loss\", CC BY-SA 4.0) states: Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","support":[{"end":245,"quote":"Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","source_id":"wikipedia.article.copper-loss","source_sha256":"eed196c36cccb8baa1d27fbde8fafe73c781ddc15dcdc714fa36ecacee2bd48a","start":98}],"target_id":"concept.wikipedia.copper-loss","target_kind":"node","target_sha256":"2e6929e9f4e908c9130cee23fc6b4b29e078986c9f0048193e68fd4a791edfd8"}],"concept.wikipedia.corexy":[{"id":"assertion.concept.wikipedia.corexy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"CoreXY as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"CoreXY\", CC BY-SA 4.0) states: CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","support":[{"end":250,"quote":"CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","source_id":"wikipedia.article.corexy","source_sha256":"c8101476354ec47b41d3cebbacd3f83eb0de767e7610028d2c1304590d55790d","start":94}],"target_id":"concept.wikipedia.corexy","target_kind":"node","target_sha256":"434dfa3dca39913362046f59ddb04807853b5b6f7bc22f6fb941fb63e843d9af"}],"concept.wikipedia.correlative-based-fallacies":[{"id":"assertion.concept.wikipedia.correlative-based-fallacies","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correlative-based fallacies as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correlative-based fallacies\", CC BY-SA 4.0) states: In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","support":[{"end":213,"quote":"In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","source_id":"wikipedia.article.correlative-based-fallacies","source_sha256":"3b5289c3aa638697b54f44db5cf0b99106a87a3c8c09a83b08ed9a8147e539db","start":113}],"target_id":"concept.wikipedia.correlative-based-fallacies","target_kind":"node","target_sha256":"d574177688e644d2a0a957c62d6f2d7605412dc3d00a9270b682697bc9855db1"}],"concept.wikipedia.correspondence-theory-of-truth":[{"id":"assertion.concept.wikipedia.correspondence-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correspondence theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correspondence theory of truth\", CC BY-SA 4.0) states: In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","support":[{"end":364,"quote":"In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","source_id":"wikipedia.article.correspondence-theory-of-truth","source_sha256":"eb2c1eb6a9bd98564db5faf29ea3132443e5ed80a0a6480609bb3d54da384db9","start":116}],"target_id":"concept.wikipedia.correspondence-theory-of-truth","target_kind":"node","target_sha256":"448c054cbcc05114ba80e6f8eb9c6f9250ea5dca5b3a97e0012b2260b5265cf3"}],"concept.wikipedia.correspondent-inference-theory":[{"id":"assertion.concept.wikipedia.correspondent-inference-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Correspondent inference theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Correspondent inference theory\", CC BY-SA 4.0) states: Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965) that \"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\".","support":[{"end":356,"quote":"Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965)  that \\\"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\\\".","source_id":"wikipedia.article.correspondent-inference-theory","source_sha256":"e66ebe02b911cf977a50a6b0296d07aea7967d93dab9c712148f45a4e33a1758","start":117}],"target_id":"concept.wikipedia.correspondent-inference-theory","target_kind":"node","target_sha256":"f3de7fe7e1e164079c7a9cd16bf35a2f49271dce4245fe25e41a027f0dc21fb6"}],"concept.wikipedia.cosmological-argument":[{"id":"assertion.concept.wikipedia.cosmological-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cosmological argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cosmological argument\", CC BY-SA 4.0) states: In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","support":[{"end":347,"quote":"In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","source_id":"wikipedia.article.cosmological-argument","source_sha256":"570b48518b9679044c90fed7ff9d47c295a5def7b5499a54a8bcb0f63ba2be7d","start":105}],"target_id":"concept.wikipedia.cosmological-argument","target_kind":"node","target_sha256":"00e4d35d4424899719b988cefadfa7ee897499c67ef80422b45b3856af581e2b"}],"concept.wikipedia.countably-generated-module":[{"id":"assertion.concept.wikipedia.countably-generated-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Countably generated module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Countably generated module\", CC BY-SA 4.0) states: In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","support":[{"end":257,"quote":"In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","source_id":"wikipedia.article.countably-generated-module","source_sha256":"996c45c0dd5e0da132e6ded511d1f345c21dc0ea68ac088cd6a4b715f27ac28a","start":114}],"target_id":"concept.wikipedia.countably-generated-module","target_kind":"node","target_sha256":"2c03ca513f1b1881cdeaec08de7fb73332a80e7917629e29d114cd9b442e5f16"}],"concept.wikipedia.counterbore":[{"id":"assertion.concept.wikipedia.counterbore","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Counterbore as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Counterbore\", CC BY-SA 4.0) states: In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","support":[{"end":250,"quote":"In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","source_id":"wikipedia.article.counterbore","source_sha256":"bfcc6423bbebacd838f56fbf6ea20da4e463fe11a92bb9d974f61798ccfa8ab0","start":98}],"target_id":"concept.wikipedia.counterbore","target_kind":"node","target_sha256":"a152410bd6aa0759fb985bd63ada5c7e48809124fd23956a6f91c3b262954474"}],"concept.wikipedia.counterfactual-conditional":[{"id":"assertion.concept.wikipedia.counterfactual-conditional","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Counterfactual conditional as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Counterfactual conditional\", CC BY-SA 4.0) states: Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","support":[{"end":393,"quote":"Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","source_id":"wikipedia.article.counterfactual-conditional","source_sha256":"5477faaf46c07344cc7dc6c3c1bece0b344addb171611dc98733e05b32fde883","start":112}],"target_id":"concept.wikipedia.counterfactual-conditional","target_kind":"node","target_sha256":"d62d72fa86307ec80db8f234ac382fa70e0046c86c1667416c9042f238a2c90e"}],"concept.wikipedia.coupling":[{"id":"assertion.concept.wikipedia.coupling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Coupling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Coupling\", CC BY-SA 4.0) states: A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","support":[{"end":204,"quote":"A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","source_id":"wikipedia.article.coupling","source_sha256":"d4ba8c539742fb3de0fc4f05ddeee6f128c74029d4a042c88016adda957124cb","start":93}],"target_id":"concept.wikipedia.coupling","target_kind":"node","target_sha256":"1b5c7fb9bf216e39869c008f14fd65254303dddc0bbbcedda81ba9563b57381d"}],"concept.wikipedia.courtier-s-reply":[{"id":"assertion.concept.wikipedia.courtier-s-reply","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Courtier's reply as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Courtier's reply\", CC BY-SA 4.0) states: The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","support":[{"end":347,"quote":"The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","source_id":"wikipedia.article.courtier-s-reply","source_sha256":"063a8d5a734ae35ede3ee8973ec0e96975bd3269b2e2e2763418775814938b80","start":104}],"target_id":"concept.wikipedia.courtier-s-reply","target_kind":"node","target_sha256":"131b2c2fbb8d39db3bcafd7892fdf877571f5d7513db697fe27457df14bee75a"}],"concept.wikipedia.cover-time":[{"id":"assertion.concept.wikipedia.cover-time","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cover time as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cover time\", CC BY-SA 4.0) states: In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","support":[{"end":285,"quote":"In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","source_id":"wikipedia.article.cover-time","source_sha256":"8472dceda598fd317e3007f620222ac1fecf14a0bdcf3f37f4060ec5014d0d50","start":98}],"target_id":"concept.wikipedia.cover-time","target_kind":"node","target_sha256":"ed74ed92c7530705e38d9cd855015eb7babd1a59646b31c294b4701bfe2d1329"}],"concept.wikipedia.cr-maill-re":[{"id":"assertion.concept.wikipedia.cr-maill-re","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crémaillère as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crémaillère\", CC BY-SA 4.0) states: A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","support":[{"end":298,"quote":"A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","source_id":"wikipedia.article.cr-maill-re","source_sha256":"6d754833f1b34d6e73c1ca9bbd66825252835230074d2856a9baaf90aa736d91","start":99}],"target_id":"concept.wikipedia.cr-maill-re","target_kind":"node","target_sha256":"47d1f0892fc47c519eb4825cfe65b0522683b362e66501d97d1ff91b4e14f454"}],"concept.wikipedia.crawl-ratio":[{"id":"assertion.concept.wikipedia.crawl-ratio","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crawl ratio as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crawl ratio\", CC BY-SA 4.0) states: In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","support":[{"end":264,"quote":"In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","source_id":"wikipedia.article.crawl-ratio","source_sha256":"6dfd0c4423ef81ff2745767275e2d15cf6d83957487aafaa8475bb59ada9faad","start":98}],"target_id":"concept.wikipedia.crawl-ratio","target_kind":"node","target_sha256":"06e7eb6e290ea6e3f1ff59913d72c0e4eb0359bd7a89b496ec48d14c81125bd6"}],"concept.wikipedia.crayford-focuser":[{"id":"assertion.concept.wikipedia.crayford-focuser","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crayford focuser as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crayford focuser\", CC BY-SA 4.0) states: The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","support":[{"end":195,"quote":"The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","source_id":"wikipedia.article.crayford-focuser","source_sha256":"f557e1da8392a45b13d241aabe4f1d0c9e0d02d81df38fc1587815692c2c5efb","start":103}],"target_id":"concept.wikipedia.crayford-focuser","target_kind":"node","target_sha256":"5c12735387908b199a5180ab4f079dbe2728419bdce6ffdbf230383d7712fe9b"}],"concept.wikipedia.credulity":[{"id":"assertion.concept.wikipedia.credulity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Credulity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Credulity\", CC BY-SA 4.0) states: Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","support":[{"end":225,"quote":"Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","source_id":"wikipedia.article.credulity","source_sha256":"da1c5d4bcf79bf075f8330db18f2b341514139e4e97a81b940851557eff3621d","start":97}],"target_id":"concept.wikipedia.credulity","target_kind":"node","target_sha256":"fdbabed784e75477a1a43ea0c93c189fef3304d99f2242d393b9b3e6ce1e0c7b"}],"concept.wikipedia.critical-realism-philosophy-of-perception":[{"id":"assertion.concept.wikipedia.critical-realism-philosophy-of-perception","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Critical realism (philosophy of perception) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Critical realism (philosophy of perception)\", CC BY-SA 4.0) states: In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","support":[{"end":546,"quote":"In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","source_id":"wikipedia.article.critical-realism-philosophy-of-perception","source_sha256":"258b268a00c9986ddc1b1d44b1c85196021eac1edae15a882d3e0ae4055c0d01","start":131}],"target_id":"concept.wikipedia.critical-realism-philosophy-of-perception","target_kind":"node","target_sha256":"ef129d787986725c58d50b5a682d7b5f96da28a78af5e527392885f4918ca8a1"}],"concept.wikipedia.critical-thinking":[{"id":"assertion.concept.wikipedia.critical-thinking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Critical thinking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Critical thinking\", CC BY-SA 4.0) states: Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","support":[{"end":251,"quote":"Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","source_id":"wikipedia.article.critical-thinking","source_sha256":"767b8dcf3ba665a628b4ecc87b8819965a20fda472c6e45113a901c6392eb461","start":103}],"target_id":"concept.wikipedia.critical-thinking","target_kind":"node","target_sha256":"ad0c690a1658793e57012d9e4bd30c09832fdcb0cd7739fefc5de7685ce9f78b"}],"concept.wikipedia.cross-impact-analysis":[{"id":"assertion.concept.wikipedia.cross-impact-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cross impact analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cross impact analysis\", CC BY-SA 4.0) states: Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","support":[{"end":322,"quote":"Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","source_id":"wikipedia.article.cross-impact-analysis","source_sha256":"ae35c232205a10b7a19c9c6f271de19c388ef7a598e11147fdc09228c437d8b7","start":109}],"target_id":"concept.wikipedia.cross-impact-analysis","target_kind":"node","target_sha256":"613a0910aee4418b1973773c9857084c229f32389eef090618b84525bef0b2c4"}],"concept.wikipedia.cross-sectional-study":[{"id":"assertion.concept.wikipedia.cross-sectional-study","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cross-sectional study as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cross-sectional study\", CC BY-SA 4.0) states: In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","support":[{"end":428,"quote":"In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","source_id":"wikipedia.article.cross-sectional-study","source_sha256":"49cb08d76e97a6eb8b533d0e9cc3ed9ccba9188b87e9bc38c743baf191fec183","start":108}],"target_id":"concept.wikipedia.cross-sectional-study","target_kind":"node","target_sha256":"7e2ed762cec070d24285d4ef374ae541517f0c2225d3a2c7c0f6194128bd2f39"}],"concept.wikipedia.crosshead":[{"id":"assertion.concept.wikipedia.crosshead","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Crosshead as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Crosshead\", CC BY-SA 4.0) states: In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","support":[{"end":345,"quote":"In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","source_id":"wikipedia.article.crosshead","source_sha256":"6e0e78387c9de4965b6eb7b9f3ce8f797e3eb7d6639a8a40269c2ce73751e8a8","start":95}],"target_id":"concept.wikipedia.crosshead","target_kind":"node","target_sha256":"dee5ad91e6723adb12ed8356268df912e86970e69d30be54983a8a81c2beaaab"}],"concept.wikipedia.cubicity":[{"id":"assertion.concept.wikipedia.cubicity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cubicity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cubicity\", CC BY-SA 4.0) states: In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","support":[{"end":313,"quote":"In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","source_id":"wikipedia.article.cubicity","source_sha256":"9f14e2a5efb08a5fa84467f7d298b44711ba7053dbb57424f2b7f974a5d62a11","start":96}],"target_id":"concept.wikipedia.cubicity","target_kind":"node","target_sha256":"691b6a4d9f5d1a866ce693eb27e11be4a70d3ae87b468a6bf0bb68ef01ec7f5e"}],"concept.wikipedia.curry-howard-correspondence":[{"id":"assertion.concept.wikipedia.curry-howard-correspondence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Curry–Howard correspondence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Curry–Howard correspondence\", CC BY-SA 4.0) states: In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","support":[{"end":269,"quote":"In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","source_id":"wikipedia.article.curry-howard-correspondence","source_sha256":"980c3d16a6eed990774afe285db6ce0fff92121f9e78c7fc9f55d6c0d9228b0d","start":113}],"target_id":"concept.wikipedia.curry-howard-correspondence","target_kind":"node","target_sha256":"a5b9061e75c8589ef75b2a3c5019ef5633859648ffe61fe2e63a05cd062f6b88"}],"concept.wikipedia.cuthill-mckee-algorithm":[{"id":"assertion.concept.wikipedia.cuthill-mckee-algorithm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cuthill–McKee algorithm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cuthill–McKee algorithm\", CC BY-SA 4.0) states: In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth.","support":[{"end":350,"quote":"In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a   band matrix form with a small bandwidth.","source_id":"wikipedia.article.cuthill-mckee-algorithm","source_sha256":"1ee9f1d193df9c963b2b81a43f8064c0bfe7ae2a1424aa8fced991a867e39c01","start":110}],"target_id":"concept.wikipedia.cuthill-mckee-algorithm","target_kind":"node","target_sha256":"9f2e51f0a3fbfd5859c58c1d667ea195df8d0fd31dfabbba90f5943b58893be0"}],"concept.wikipedia.cutting-sequence":[{"id":"assertion.concept.wikipedia.cutting-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting sequence\", CC BY-SA 4.0) states: In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\"cut\") as a curve crosses a square grid.","support":[{"end":275,"quote":"In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\\\"cut\\\") as a curve crosses a square grid.","source_id":"wikipedia.article.cutting-sequence","source_sha256":"f8ffe8602f82a8ea60062d3ae5b45c904e6d8ceb2953c3768436a6712cd55db9","start":104}],"target_id":"concept.wikipedia.cutting-sequence","target_kind":"node","target_sha256":"978c403ad093dea750edb34ce1e6b451cace1e0b1c857488f1e9751dfea1b3d5"}],"concept.wikipedia.cutting-tool-machining":[{"id":"assertion.concept.wikipedia.cutting-tool-machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting tool (machining) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting tool (machining)\", CC BY-SA 4.0) states: In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","support":[{"end":347,"quote":"In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","source_id":"wikipedia.article.cutting-tool-machining","source_sha256":"665938665510938b067d225bedd5766d8186eae8dc59e5771060e53d5deed616","start":111}],"target_id":"concept.wikipedia.cutting-tool-machining","target_kind":"node","target_sha256":"2609b9ff206d86cb2f74349fc1145c97096c059cdcbf28ad0f6ba081420b286d"}],"concept.wikipedia.cutting-tool-material":[{"id":"assertion.concept.wikipedia.cutting-tool-material","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cutting tool material as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cutting tool material\", CC BY-SA 4.0) states: Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","support":[{"end":308,"quote":"Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","source_id":"wikipedia.article.cutting-tool-material","source_sha256":"5e951944508f6a76c9762e73013908f963a7cda1eec8a122913b2a937d4f3581","start":109}],"target_id":"concept.wikipedia.cutting-tool-material","target_kind":"node","target_sha256":"838f6c6e9687d7bacd52a91ef18a6f477f1cc645d0a6f984ba47b80a276889cf"}],"concept.wikipedia.cvcc":[{"id":"assertion.concept.wikipedia.cvcc","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"CVCC as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"CVCC\", CC BY-SA 4.0) states: CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","support":[{"end":304,"quote":"CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","source_id":"wikipedia.article.cvcc","source_sha256":"bf0c007c47d1827e4116acbd8172df6940653a39567d6a703099f0a32379ee22","start":90}],"target_id":"concept.wikipedia.cvcc","target_kind":"node","target_sha256":"a95c2966a20e8f732942fa4df0fbedaff6235ce267dda9e577593c0ca56e4b13"}],"concept.wikipedia.cycloid-gear":[{"id":"assertion.concept.wikipedia.cycloid-gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cycloid gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cycloid gear\", CC BY-SA 4.0) states: A cycloidal gear is a toothed gear with a cycloidal profile.","support":[{"end":159,"quote":"A cycloidal gear is a toothed gear with a cycloidal profile.","source_id":"wikipedia.article.cycloid-gear","source_sha256":"6967728058c2273630c647178e68f22dae2fcf03287f1245f4067441c905c1ea","start":99}],"target_id":"concept.wikipedia.cycloid-gear","target_kind":"node","target_sha256":"cd4ae79e4d024f290cd683dace82434052768f0863f5ea5cf64eb78fdc624f50"}],"concept.wikipedia.cycloidal-drive":[{"id":"assertion.concept.wikipedia.cycloidal-drive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cycloidal drive as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cycloidal drive\", CC BY-SA 4.0) states: A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","support":[{"end":222,"quote":"A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","source_id":"wikipedia.article.cycloidal-drive","source_sha256":"07237d5fcb3a7f4809abab039abdc08acf19a8cd1bbfb8fc1ed236b772eb75e9","start":102}],"target_id":"concept.wikipedia.cycloidal-drive","target_kind":"node","target_sha256":"44430c0ecd4aab380435a8e7e1dd97e46d20404437d1900d2691e775afe71835"}],"concept.wikipedia.dashpot":[{"id":"assertion.concept.wikipedia.dashpot","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dashpot as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dashpot\", CC BY-SA 4.0) states: A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","support":[{"end":192,"quote":"A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","source_id":"wikipedia.article.dashpot","source_sha256":"9e62a467464b2bf036d0ef649e82420af7c4523e1c34bf309e6fa805f68d174d","start":94}],"target_id":"concept.wikipedia.dashpot","target_kind":"node","target_sha256":"6beb379d2005bbe05234134b65ff07ecb0341df7ce2b633cbeefcaedcf88c6d4"}],"concept.wikipedia.data-center-tiers":[{"id":"assertion.concept.wikipedia.data-center-tiers","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data center tiers as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data center tiers\", CC BY-SA 4.0) states: Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","support":[{"end":202,"quote":"Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","source_id":"wikipedia.article.data-center-tiers","source_sha256":"3226b1e491406c32862e5f4202143a68ead060d42e5ba0ec257e326730847b69","start":105}],"target_id":"concept.wikipedia.data-center-tiers","target_kind":"node","target_sha256":"1103df70d725cb8d8c382ec413a15f5dde1c93b5e9af049d343b881316739e06"}],"concept.wikipedia.data-sharing":[{"id":"assertion.concept.wikipedia.data-sharing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data sharing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data sharing\", CC BY-SA 4.0) states: Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","support":[{"end":208,"quote":"Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","source_id":"wikipedia.article.data-sharing","source_sha256":"30a999ae00753600cd3fc15f98216f66b1a251b90c6841bb53185404184e82a8","start":100}],"target_id":"concept.wikipedia.data-sharing","target_kind":"node","target_sha256":"1d38bbdf2e393839cafd69bc8c5decf1a7476229771b1c53ab9d5a98c2f3f0c1"}],"concept.wikipedia.data-universalism":[{"id":"assertion.concept.wikipedia.data-universalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Data universalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Data universalism\", CC BY-SA 4.0) states: Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","support":[{"end":282,"quote":"Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","source_id":"wikipedia.article.data-universalism","source_sha256":"bc27dba5b8b31c444f3c0e58ad8c70ee1b43f54dd88ec3d88c464705811b0999","start":105}],"target_id":"concept.wikipedia.data-universalism","target_kind":"node","target_sha256":"2e1aa50d9df99a60a7554848eb650094f12918e352a9f61a3c5857c4ea0993f7"}],"concept.wikipedia.davenport-schinzel-sequence":[{"id":"assertion.concept.wikipedia.davenport-schinzel-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Davenport–Schinzel sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Davenport–Schinzel sequence\", CC BY-SA 4.0) states: In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","support":[{"end":270,"quote":"In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","source_id":"wikipedia.article.davenport-schinzel-sequence","source_sha256":"f4424f49ddbb90533663c74d9f9e0e563946fe0af56fe50d413f79694a3f2338","start":115}],"target_id":"concept.wikipedia.davenport-schinzel-sequence","target_kind":"node","target_sha256":"4948b0b8545511a2cf81d932f85d807502cfdbef4a4e8278a12ee9a954c3dc8e"}],"concept.wikipedia.dc-injection-braking":[{"id":"assertion.concept.wikipedia.dc-injection-braking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"DC injection braking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"DC injection braking\", CC BY-SA 4.0) states: DC injection braking is a method of slowing AC electric motors.","support":[{"end":171,"quote":"DC injection braking is a method of slowing AC electric motors.","source_id":"wikipedia.article.dc-injection-braking","source_sha256":"c38c780ae4a125c1c5228c74f6c6b98bd31e6d12a99d9acf9cd08b8fa96dd376","start":108}],"target_id":"concept.wikipedia.dc-injection-braking","target_kind":"node","target_sha256":"457a374c0370966744ec78e295da576958140772f1c588cfaeedf75a7331a412"}],"concept.wikipedia.de-se":[{"id":"assertion.concept.wikipedia.de-se","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"De se as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"De se\", CC BY-SA 4.0) states: De se is Latin for \"of oneself\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \"de dicto and de re\".","support":[{"end":261,"quote":"De se is Latin for \\\"of oneself\\\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \\\"de dicto and de re\\\".","source_id":"wikipedia.article.de-se","source_sha256":"546f9e40f76613d54538371cc467dbece27c4e418629d56676aca27e29f6df3a","start":93}],"target_id":"concept.wikipedia.de-se","target_kind":"node","target_sha256":"d3e6eefeb12ec8a77c5dde6865904ff8bac8e3feb8933bb7208d9d3316154b3e"}],"concept.wikipedia.deal-grove-model":[{"id":"assertion.concept.wikipedia.deal-grove-model","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deal–Grove model as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deal–Grove model\", CC BY-SA 4.0) states: The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","support":[{"end":207,"quote":"The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","source_id":"wikipedia.article.deal-grove-model","source_sha256":"166a875968d027e8f1b2e15eab7fa7d0a05826a459882651aba2419a5a4ec870","start":103}],"target_id":"concept.wikipedia.deal-grove-model","target_kind":"node","target_sha256":"45fe3a78d4b884585356f81afdbca0b5d54c858e34b98afc4284448af0edf65c"}],"concept.wikipedia.decidability-logic":[{"id":"assertion.concept.wikipedia.decidability-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decidability (logic) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decidability (logic)\", CC BY-SA 4.0) states: In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","support":[{"end":227,"quote":"In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","source_id":"wikipedia.article.decidability-logic","source_sha256":"cb649bcc5e9080cfc5b361cf8fb35e5bcedea6a002abd97959114fa5631f5e58","start":106}],"target_id":"concept.wikipedia.decidability-logic","target_kind":"node","target_sha256":"b05436b449999a093a5378f1c0bdbd0b1f7325f862952004336f574c3ef7894c"}],"concept.wikipedia.decolonization-of-knowledge":[{"id":"assertion.concept.wikipedia.decolonization-of-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decolonization of knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decolonization of knowledge\", CC BY-SA 4.0) states: Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","support":[{"end":324,"quote":"Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","source_id":"wikipedia.article.decolonization-of-knowledge","source_sha256":"a979b2411d2825ef8fb6a046a2490706327c6a78b5f64da5c3d68b9acee9a7dd","start":115}],"target_id":"concept.wikipedia.decolonization-of-knowledge","target_kind":"node","target_sha256":"9c525294c08d5c1df12ec5ddea23b4740bd43f19d1d2e06a943b43091004db63"}],"concept.wikipedia.decomposition-of-a-module":[{"id":"assertion.concept.wikipedia.decomposition-of-a-module","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Decomposition of a module as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Decomposition of a module\", CC BY-SA 4.0) states: In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","support":[{"end":216,"quote":"In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","source_id":"wikipedia.article.decomposition-of-a-module","source_sha256":"5f51dd613e8e346ff9d16a844b17f97c43d7033e7eb04f72e93a7ec4f9766d47","start":113}],"target_id":"concept.wikipedia.decomposition-of-a-module","target_kind":"node","target_sha256":"ba804840361d96a938fe92017a7b93999c1fb6bb5611fccf409f68aaf0fd84b6"}],"concept.wikipedia.deconstruction":[{"id":"assertion.concept.wikipedia.deconstruction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deconstruction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deconstruction\", CC BY-SA 4.0) states: In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","support":[{"end":226,"quote":"In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","source_id":"wikipedia.article.deconstruction","source_sha256":"99fe3d0cbed94675fd9f3b3a887c495fb93ac1215667a3a939138d15a878d304","start":98}],"target_id":"concept.wikipedia.deconstruction","target_kind":"node","target_sha256":"36cbacbc3395ec3438289be40c252151891489357f7f528fb03a85b4f3876b2c"}],"concept.wikipedia.deductive-reasoning":[{"id":"assertion.concept.wikipedia.deductive-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deductive reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deductive reasoning\", CC BY-SA 4.0) states: Deductive reasoning is the process of drawing valid inferences.","support":[{"end":167,"quote":"Deductive reasoning is the process of drawing valid inferences.","source_id":"wikipedia.article.deductive-reasoning","source_sha256":"56c703ea347f75516c81df98c0b6ee58cfd95fee9fe3f4b38517965340174780","start":104}],"target_id":"concept.wikipedia.deductive-reasoning","target_kind":"node","target_sha256":"d8a70931b1a5a867dccf5d897a1a2b5cd67e2cdbb6497a42371eb32709b0f4a1"}],"concept.wikipedia.defeasibility-linguistics":[{"id":"assertion.concept.wikipedia.defeasibility-linguistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defeasibility (linguistics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defeasibility (linguistics)\", CC BY-SA 4.0) states: In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","support":[{"end":302,"quote":"In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","source_id":"wikipedia.article.defeasibility-linguistics","source_sha256":"9ad305a60aa2798a208ec1ea2c9f21d1a20e138998df59ce12af85e73d2b6971","start":115}],"target_id":"concept.wikipedia.defeasibility-linguistics","target_kind":"node","target_sha256":"b17bc3091e041218dd64b8ab623e38e80ee9a3cd53980cbc432b629a7218d692"}],"concept.wikipedia.defeasible-reasoning":[{"id":"assertion.concept.wikipedia.defeasible-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defeasible reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defeasible reasoning\", CC BY-SA 4.0) states: In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","support":[{"end":247,"quote":"In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","source_id":"wikipedia.article.defeasible-reasoning","source_sha256":"eb39fa0321646d5cb0c6bb305e33a6568b01cab98d7ccf242a5cb465b26bba39","start":107}],"target_id":"concept.wikipedia.defeasible-reasoning","target_kind":"node","target_sha256":"6fc1bdbf6efe7d8f088f99fc8dd395824a32e924c65e8ed20a18262bb2574924"}],"concept.wikipedia.defensive-pessimism":[{"id":"assertion.concept.wikipedia.defensive-pessimism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Defensive pessimism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Defensive pessimism\", CC BY-SA 4.0) states: Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","support":[{"end":270,"quote":"Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","source_id":"wikipedia.article.defensive-pessimism","source_sha256":"d6f3dd23fc40266319fc0888d220b190bded7b1f88a40ff91c6dec422fe8d7c6","start":107}],"target_id":"concept.wikipedia.defensive-pessimism","target_kind":"node","target_sha256":"44d80e5f676780cd5a1dc5de20656837d49732c52a4bd39e249e9d5008f55312"}],"concept.wikipedia.definite-description":[{"id":"assertion.concept.wikipedia.definite-description","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definite description as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definite description\", CC BY-SA 4.0) states: In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \"the X\" where X is a noun-phrase or a singular common noun.","support":[{"end":274,"quote":"In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \\\"the X\\\" where X is a noun-phrase or a singular common noun.","source_id":"wikipedia.article.definite-description","source_sha256":"6c329d54988a88df7f5c835485e9441e5f5bcc806b9e241b3e0f3424c8da1e5a","start":106}],"target_id":"concept.wikipedia.definite-description","target_kind":"node","target_sha256":"9633b1c46de51b2a611cd40df6f4d1ecf4a9a3a6d6f9035d6ea48b9ade7a013d"}],"concept.wikipedia.definition":[{"id":"assertion.concept.wikipedia.definition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definition\", CC BY-SA 4.0) states: A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","support":[{"end":198,"quote":"A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","source_id":"wikipedia.article.definition","source_sha256":"a9ec0af5465f3f97efaed51f577047eb75a7c627a181a67e0531aa263117bdf7","start":94}],"target_id":"concept.wikipedia.definition","target_kind":"node","target_sha256":"f0ee97ecd9bd06483de716000a2448b338be36496b1dcede0a4fab9ace0521c3"}],"concept.wikipedia.definitionism":[{"id":"assertion.concept.wikipedia.definitionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Definitionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Definitionism\", CC BY-SA 4.0) states: Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","support":[{"end":317,"quote":"Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","source_id":"wikipedia.article.definitionism","source_sha256":"d611f74be72eec751e8b0b17a0f7f16b8f7c78008d80e8ebeeca1a9746249f25","start":101}],"target_id":"concept.wikipedia.definitionism","target_kind":"node","target_sha256":"50c7a9c671e66ba8ec8d183afaac9ef230b7e8572c7d0a6b3b9147e73fba880a"}],"concept.wikipedia.deflationary-theory-of-truth":[{"id":"assertion.concept.wikipedia.deflationary-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deflationary theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deflationary theory of truth\", CC BY-SA 4.0) states: In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \"truth\" to such a statement.","support":[{"end":402,"quote":"In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \\\"truth\\\" to such a statement.","source_id":"wikipedia.article.deflationary-theory-of-truth","source_sha256":"f3a56493e1e8e87c14325a3928cf6cd23bff54ad890fbde2b084a3c22511cb3b","start":114}],"target_id":"concept.wikipedia.deflationary-theory-of-truth","target_kind":"node","target_sha256":"052bbf054ea86e9389ded881716c2176c064379d91cc90815375623ce54acd87"}],"concept.wikipedia.degeneracy-mathematics":[{"id":"assertion.concept.wikipedia.degeneracy-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Degeneracy (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Degeneracy (mathematics)\", CC BY-SA 4.0) states: In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \"degeneracy\" is the condition of being a degenerate case.","support":[{"end":343,"quote":"In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \\\"degeneracy\\\" is the condition of being a degenerate case.","source_id":"wikipedia.article.degeneracy-mathematics","source_sha256":"8998ea1e669aa070871ddd6d0dd47f3de417432f9ac2bf5b2261f8a04946b6c8","start":110}],"target_id":"concept.wikipedia.degeneracy-mathematics","target_kind":"node","target_sha256":"6cd249706668c8b829dc97d0274571773df81fc79da7e5278502861deb6d269e"}],"concept.wikipedia.deliberative-indispensability-argument":[{"id":"assertion.concept.wikipedia.deliberative-indispensability-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deliberative indispensability argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deliberative indispensability argument\", CC BY-SA 4.0) states: The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","support":[{"end":291,"quote":"The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","source_id":"wikipedia.article.deliberative-indispensability-argument","source_sha256":"e51539e102a3503ed8287811ab87036d3888926cafc49d491665b52765d78393","start":126}],"target_id":"concept.wikipedia.deliberative-indispensability-argument","target_kind":"node","target_sha256":"85894e7122e6527164bc52dea8d512965f60d36663da98baa89fc027b0788cc7"}],"concept.wikipedia.delta-functor":[{"id":"assertion.concept.wikipedia.delta-functor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Delta-functor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Delta-functor\", CC BY-SA 4.0) states: In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","support":[{"end":319,"quote":"In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","source_id":"wikipedia.article.delta-functor","source_sha256":"349bb15b99b0801df86095d18acf9de9f4ed84556d2d8cc26b2d15b9bd28dd59","start":101}],"target_id":"concept.wikipedia.delta-functor","target_kind":"node","target_sha256":"f3cdd1d59b7d3f26c52c534b8d4b6f171d44f89b848460461e2580597f5841b3"}],"concept.wikipedia.delusion":[{"id":"assertion.concept.wikipedia.delusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Delusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Delusion\", CC BY-SA 4.0) states: A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","support":[{"end":187,"quote":"A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","source_id":"wikipedia.article.delusion","source_sha256":"4fb87d8c03c18a179dc9c3f9ed569f571e728be14f0030ab84bdb7bb3d7a5917","start":94}],"target_id":"concept.wikipedia.delusion","target_kind":"node","target_sha256":"7e3de2a4622cda73c0c2a396b341663458ae732ae51bd71cc9cb5fd7090e3c25"}],"concept.wikipedia.demand-factor":[{"id":"assertion.concept.wikipedia.demand-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Demand factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Demand factor\", CC BY-SA 4.0) states: In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","support":[{"end":330,"quote":"In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","source_id":"wikipedia.article.demand-factor","source_sha256":"32e746f94c33be2bcdf42204125b98476c9b535d30e9f6f9db4add25f88da7bb","start":98}],"target_id":"concept.wikipedia.demand-factor","target_kind":"node","target_sha256":"0cc82b3d514471a15816c226d45af791bedc9c4902caf274698d22aeb09fbcfb"}],"concept.wikipedia.dempster-shafer-theory":[{"id":"assertion.concept.wikipedia.dempster-shafer-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dempster–Shafer theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dempster–Shafer theory\", CC BY-SA 4.0) states: The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","support":[{"end":380,"quote":"The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","source_id":"wikipedia.article.dempster-shafer-theory","source_sha256":"df43a3d221b5cdb7786bc19035d35650ffbf10ed7aaa9e4fa809c81e56d61706","start":108}],"target_id":"concept.wikipedia.dempster-shafer-theory","target_kind":"node","target_sha256":"6420b10992b6f76e2434edd57a53f2ade4e9e77c49ded2af5896b802b87a5f02"}],"concept.wikipedia.denotation":[{"id":"assertion.concept.wikipedia.denotation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denotation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denotation\", CC BY-SA 4.0) states: In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","support":[{"end":198,"quote":"In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","source_id":"wikipedia.article.denotation","source_sha256":"722af92245903b787796355ffe96304ac0218f8159cd2ac7177356e7f2c42a2a","start":96}],"target_id":"concept.wikipedia.denotation","target_kind":"node","target_sha256":"ce1a89df0cb9e2b3fbf1c2bb14fc5a2dcf7254c819a8e7702dc5e9a0d879743c"}],"concept.wikipedia.denying-the-antecedent":[{"id":"assertion.concept.wikipedia.denying-the-antecedent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denying the antecedent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denying the antecedent\", CC BY-SA 4.0) states: Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","support":[{"end":286,"quote":"Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","source_id":"wikipedia.article.denying-the-antecedent","source_sha256":"271131b058ffec01a4ed39927d0369a5210b92e197394309688d19ca28052278","start":108}],"target_id":"concept.wikipedia.denying-the-antecedent","target_kind":"node","target_sha256":"18b38ad78454e98324fae7e72d3cf4ba76b9a9b4e86984b86de0ca67b2bb22b6"}],"concept.wikipedia.denying-the-correlative":[{"id":"assertion.concept.wikipedia.denying-the-correlative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Denying the correlative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Denying the correlative\", CC BY-SA 4.0) states: The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","support":[{"end":225,"quote":"The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","source_id":"wikipedia.article.denying-the-correlative","source_sha256":"16fb4a24c7435e76f7a61e2f62901cc3538ebf3060e663c9d86f33d6e7a161f5","start":109}],"target_id":"concept.wikipedia.denying-the-correlative","target_kind":"node","target_sha256":"b3d48bc21da1df8762b2a6f9bc9824989aebf78cad809905464a36a251e40e53"}],"concept.wikipedia.deontic-logic":[{"id":"assertion.concept.wikipedia.deontic-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deontic logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deontic logic\", CC BY-SA 4.0) states: Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","support":[{"end":218,"quote":"Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","source_id":"wikipedia.article.deontic-logic","source_sha256":"61f4b3001bfb9dd707df87e2ea23882b48c2e528949953224782ac70426ad487","start":100}],"target_id":"concept.wikipedia.deontic-logic","target_kind":"node","target_sha256":"3538026ca9d79909e590f4a41325e57582591cc9f3c20908e4c484bda0d1a9fe"}],"concept.wikipedia.deriaz-turbine":[{"id":"assertion.concept.wikipedia.deriaz-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Deriaz turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Deriaz turbine\", CC BY-SA 4.0) states: The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","support":[{"end":218,"quote":"The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","source_id":"wikipedia.article.deriaz-turbine","source_sha256":"afd1aee5124b04c46bcf842ec6e3783563022c2695e31f1edafe0a04770a77ef","start":102}],"target_id":"concept.wikipedia.deriaz-turbine","target_kind":"node","target_sha256":"536f2d80745303572f0a87994056138f6216a82c737e7cc8e7cad2431c37e7f8"}],"concept.wikipedia.derivative-of-the-exponential-map":[{"id":"assertion.concept.wikipedia.derivative-of-the-exponential-map","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Derivative of the exponential map as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Derivative of the exponential map\", CC BY-SA 4.0) states: In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","support":[{"end":314,"quote":"In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","source_id":"wikipedia.article.derivative-of-the-exponential-map","source_sha256":"2f0bfe666d1e820fb558fdb17555101f7d530d81507ca15d5317db2e77cb3931","start":121}],"target_id":"concept.wikipedia.derivative-of-the-exponential-map","target_kind":"node","target_sha256":"e1a35b5ea6cf7951ed1a7d36a5a60b5a0b4e8a75649a2a85207628a0c558eba7"}],"concept.wikipedia.desander":[{"id":"assertion.concept.wikipedia.desander","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Desander as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Desander\", CC BY-SA 4.0) states: Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","support":[{"end":246,"quote":"Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","source_id":"wikipedia.article.desander","source_sha256":"4e93ce3f9e2c69fc9b90ef1cff00763fe8f0a3618ef30cd54bf3fc1297e6c89f","start":96}],"target_id":"concept.wikipedia.desander","target_kind":"node","target_sha256":"5b47eb0271807007a22a1117d99e7d1bece7c693dddf6849715976a670a8d82a"}],"concept.wikipedia.design-based-research":[{"id":"assertion.concept.wikipedia.design-based-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design-based research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design-based research\", CC BY-SA 4.0) states: Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","support":[{"end":251,"quote":"Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","source_id":"wikipedia.article.design-based-research","source_sha256":"c3982881f8fcbb59ecb465d3f607cb1b1dee18c5cfaceeda7c5118336ffa402b","start":109}],"target_id":"concept.wikipedia.design-based-research","target_kind":"node","target_sha256":"bd4d6f764e426e1fff9138d0b1f96c7be986afa5d15bf8a421ed47d58b8eb8da"}],"concept.wikipedia.design-manufacture-service":[{"id":"assertion.concept.wikipedia.design-manufacture-service","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design manufacture service as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design manufacture service\", CC BY-SA 4.0) states: Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","support":[{"end":329,"quote":"Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","source_id":"wikipedia.article.design-manufacture-service","source_sha256":"b9402c8189631ec667c36e687c38499478cd2e2ffc2664b03469f52a5864a706","start":114}],"target_id":"concept.wikipedia.design-manufacture-service","target_kind":"node","target_sha256":"851d93d428e6039ec31fcf49003ed1cdd8d010aadd928f20557499aa314054f6"}],"concept.wikipedia.design-of-experiments":[{"id":"assertion.concept.wikipedia.design-of-experiments","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design of experiments as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design of experiments\", CC BY-SA 4.0) states: The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","support":[{"end":326,"quote":"The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","source_id":"wikipedia.article.design-of-experiments","source_sha256":"0bd9f343c9c53ea6841a31930541ba9ecc55110dd65ca61e8a14073d3b0be418","start":105}],"target_id":"concept.wikipedia.design-of-experiments","target_kind":"node","target_sha256":"2ee6cb9e5838d1c93755b69587e4b6ad95e97c4d3345ff54fd0fac4114df2ca4"}],"concept.wikipedia.design-rationale":[{"id":"assertion.concept.wikipedia.design-rationale","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design rationale as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design rationale\", CC BY-SA 4.0) states: A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","support":[{"end":225,"quote":"A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","source_id":"wikipedia.article.design-rationale","source_sha256":"90afdc66b2d5474a4656a6d15b13df7d71fbf6df1e447dcd8627bf9d926b5a97","start":104}],"target_id":"concept.wikipedia.design-rationale","target_kind":"node","target_sha256":"7e66f4f1777a629e927d92e295d691ef8971b79cb56bf08ad554e8bcd8e3b627"}],"concept.wikipedia.design-science":[{"id":"assertion.concept.wikipedia.design-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Design science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Design science\", CC BY-SA 4.0) states: Design science refers to a scientific, i.e. rational and systematic, approach to designing.","support":[{"end":192,"quote":"Design science refers to a scientific, i.e. rational and systematic, approach to designing.","source_id":"wikipedia.article.design-science","source_sha256":"a8d950c65246de6df721be8a21de12ac9a01dba5be97cabba1b02dd7bb762369","start":101}],"target_id":"concept.wikipedia.design-science","target_kind":"node","target_sha256":"b6b3a93fc6c896fd1f3ab2ab5e30af70426bd5acb806747b53309cb700733e30"}],"concept.wikipedia.detent":[{"id":"assertion.concept.wikipedia.detent","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Detent as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Detent\", CC BY-SA 4.0) states: A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","support":[{"end":192,"quote":"A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","source_id":"wikipedia.article.detent","source_sha256":"c3fd773adabc6d181c61773f1bf1d76be8555f8d157223133c0555f1b4e1e6d3","start":93}],"target_id":"concept.wikipedia.detent","target_kind":"node","target_sha256":"3a44be558391910b59fa7b06d60b86bb0b20379908744369c686807aad0dbcbb"}],"concept.wikipedia.diagrammatic-reasoning":[{"id":"assertion.concept.wikipedia.diagrammatic-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diagrammatic reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diagrammatic reasoning\", CC BY-SA 4.0) states: Diagrammatic reasoning is reasoning by means of visual representations.","support":[{"end":180,"quote":"Diagrammatic reasoning is reasoning by means of visual representations.","source_id":"wikipedia.article.diagrammatic-reasoning","source_sha256":"620772faeba15b309cbd48d3831d69d0b18edccb68ef4605fa9c1d156327aba7","start":109}],"target_id":"concept.wikipedia.diagrammatic-reasoning","target_kind":"node","target_sha256":"f2fe3e9ed0330e1cf9ebbbfb0880c09f2a4fc4525f19bc188dd6fed10f5975d9"}],"concept.wikipedia.diairesis":[{"id":"assertion.concept.wikipedia.diairesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diairesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diairesis\", CC BY-SA 4.0) states: Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \"division\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","support":[{"end":301,"quote":"Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \\\"division\\\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","source_id":"wikipedia.article.diairesis","source_sha256":"9770c982dc28f9cea71966e18c0ef8437a003717a29b47868b1a9906f3cbe3d3","start":96}],"target_id":"concept.wikipedia.diairesis","target_kind":"node","target_sha256":"e29326b6fc65443667c6104c387fcce80698fe259aea1e4ea83af4be34714a41"}],"concept.wikipedia.dialectica-interpretation":[{"id":"assertion.concept.wikipedia.dialectica-interpretation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dialectica interpretation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dialectica interpretation\", CC BY-SA 4.0) states: In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T. It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","support":[{"end":396,"quote":"In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T.  It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","source_id":"wikipedia.article.dialectica-interpretation","source_sha256":"1527c923d331e1cf828bdbcc9b2a463ccce10d5a2320689812e2a531f204d907","start":113}],"target_id":"concept.wikipedia.dialectica-interpretation","target_kind":"node","target_sha256":"aab96d9d7e41f89ce671c03134b34afd768f9686f31cd204b421384184513eee"}],"concept.wikipedia.dialectical-logic":[{"id":"assertion.concept.wikipedia.dialectical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dialectical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dialectical logic\", CC BY-SA 4.0) states: Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","support":[{"end":273,"quote":"Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","source_id":"wikipedia.article.dialectical-logic","source_sha256":"4fa4c10d42b7d2d6e3cc759d34bd1dded87e6b30cb60e9d86f702f42731ea3c4","start":105}],"target_id":"concept.wikipedia.dialectical-logic","target_kind":"node","target_sha256":"a01ca168350a73eb57e1354f4325fcf3df0ade7c2bc9e4bce4a0a81bc1f90721"}],"concept.wikipedia.diaphragm-valve":[{"id":"assertion.concept.wikipedia.diaphragm-valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diaphragm valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diaphragm valve\", CC BY-SA 4.0) states: A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","support":[{"end":281,"quote":"A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","source_id":"wikipedia.article.diaphragm-valve","source_sha256":"ebddee7251c7eafd08cc3b842ca2cd6ff6ada3d4bb3250b48add024c43b8d73d","start":102}],"target_id":"concept.wikipedia.diaphragm-valve","target_kind":"node","target_sha256":"b530082f36172c15bb2505c7c634325113082d94c2e6b404d237c64b78d1f280"}],"concept.wikipedia.dieudonn-plank":[{"id":"assertion.concept.wikipedia.dieudonn-plank","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dieudonné plank as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dieudonné plank\", CC BY-SA 4.0) states: In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","support":[{"end":202,"quote":"In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","source_id":"wikipedia.article.dieudonn-plank","source_sha256":"2dede73b7275fb6d5aaa608492b18c373532b517bdb3901f4d0e35561aea1498","start":103}],"target_id":"concept.wikipedia.dieudonn-plank","target_kind":"node","target_sha256":"07d49dd574ddf133087791232fce193ccf466e7fef107fe281c94dd45fd6af0a"}],"concept.wikipedia.differential-calculus":[{"id":"assertion.concept.wikipedia.differential-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential calculus\", CC BY-SA 4.0) states: In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","support":[{"end":220,"quote":"In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","source_id":"wikipedia.article.differential-calculus","source_sha256":"e0e2a41e92edbf9f79de7994e7161edd93d6432acfef8d53d06c87e59154d085","start":106}],"target_id":"concept.wikipedia.differential-calculus","target_kind":"node","target_sha256":"bc025ab70b9a7b1c9b61c3c38eb7253838909770db5c16966ab3fa98984ceebe"}],"concept.wikipedia.differential-effects":[{"id":"assertion.concept.wikipedia.differential-effects","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential effects as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential effects\", CC BY-SA 4.0) states: Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","support":[{"end":343,"quote":"Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","source_id":"wikipedia.article.differential-effects","source_sha256":"43152afc3764711830d4a28648502032c35bdbb9a075a83584595f22a1657376","start":108}],"target_id":"concept.wikipedia.differential-effects","target_kind":"node","target_sha256":"818c773062e0d7da693df65e446c098a0510748b81aa1c75602beb7b0a4f863c"}],"concept.wikipedia.differential-mathematics":[{"id":"assertion.concept.wikipedia.differential-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential (mathematics)\", CC BY-SA 4.0) states: In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","support":[{"end":310,"quote":"In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","source_id":"wikipedia.article.differential-mathematics","source_sha256":"ccf51e50bd4154dfac7a257af53265ea07a206788f31f2ea68fc5d107616659d","start":112}],"target_id":"concept.wikipedia.differential-mathematics","target_kind":"node","target_sha256":"f51cea258e8fd243e34251f7b162f7d657aa2c617543ad502bf9868858e6548e"}],"concept.wikipedia.differential-mechanical-device":[{"id":"assertion.concept.wikipedia.differential-mechanical-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential (mechanical device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential (mechanical device)\", CC BY-SA 4.0) states: A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","support":[{"end":277,"quote":"A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","source_id":"wikipedia.article.differential-mechanical-device","source_sha256":"027d1817aa580bc3b0a304a424aec76531aac3e0a10311e084204703fdc565b7","start":118}],"target_id":"concept.wikipedia.differential-mechanical-device","target_kind":"node","target_sha256":"7520ff685c9e063cdf35577b5cc02a42473586a8b5dd47791df0ecdd47437026"}],"concept.wikipedia.digifold":[{"id":"assertion.concept.wikipedia.digifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Digifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Digifold\", CC BY-SA 4.0) states: Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","support":[{"end":203,"quote":"Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","source_id":"wikipedia.article.digifold","source_sha256":"3b0552d3803649888ef41f7262ce69c5e1eca5487cf811367e8e821ccf61d9b1","start":96}],"target_id":"concept.wikipedia.digifold","target_kind":"node","target_sha256":"72973d799936608b4a9a692f680346a58c26318c9434c5ee84418b66f43f4971"}],"concept.wikipedia.digital-micromirror-device":[{"id":"assertion.concept.wikipedia.digital-micromirror-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Digital micromirror device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Digital micromirror device\", CC BY-SA 4.0) states: The digital micromirror device, or DMD, is the microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","support":[{"end":321,"quote":"The digital micromirror device, or DMD, is the  microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","source_id":"wikipedia.article.digital-micromirror-device","source_sha256":"cf1749bab4e5125778c811d42402194b7da0232aff4b51f5342ef965d219d307","start":114}],"target_id":"concept.wikipedia.digital-micromirror-device","target_kind":"node","target_sha256":"a32e1690ac983dbd7dddc02c364c7cfb85181998a019b3a48ba3c6fc7cdbbe30"}],"concept.wikipedia.dilemma":[{"id":"assertion.concept.wikipedia.dilemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dilemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dilemma\", CC BY-SA 4.0) states: A dilemma (from Ancient Greek δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","support":[{"end":265,"quote":"A dilemma (from Ancient Greek  δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","source_id":"wikipedia.article.dilemma","source_sha256":"b5ebb108d3dbc507ff3ec0a3896fea636f8c7bf7d9e3c7c808bcab936b951f9b","start":94}],"target_id":"concept.wikipedia.dilemma","target_kind":"node","target_sha256":"65eb75f224e52bbf3ea36dc5f9e6729248f22dcdf777097c18c5cb01611420ce"}],"concept.wikipedia.diode":[{"id":"assertion.concept.wikipedia.diode","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Diode as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Diode\", CC BY-SA 4.0) states: A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","support":[{"end":219,"quote":"A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","source_id":"wikipedia.article.diode","source_sha256":"c733c46d0d864ed5ae84f4cc129b810a5ac289666c9fa9cc99f67e1c00b32c28","start":89}],"target_id":"concept.wikipedia.diode","target_kind":"node","target_sha256":"b079509aef49ebc509c646a138130485140ceb05a35dc550e223b457562bce1e"}],"concept.wikipedia.direct-and-indirect-realism":[{"id":"assertion.concept.wikipedia.direct-and-indirect-realism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Direct and indirect realism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Direct and indirect realism\", CC BY-SA 4.0) states: In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","support":[{"end":317,"quote":"In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","source_id":"wikipedia.article.direct-and-indirect-realism","source_sha256":"7345865d78e88f1e59861a9aada9385979e47e0e5b63142f3df520daa248ae64","start":113}],"target_id":"concept.wikipedia.direct-and-indirect-realism","target_kind":"node","target_sha256":"db015564ecf6bd558713692aa8b9b21edb275b895bd435e4eca20444faffab19"}],"concept.wikipedia.directed-assembly-of-micro-and-nano-structures":[{"id":"assertion.concept.wikipedia.directed-assembly-of-micro-and-nano-structures","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Directed assembly of micro- and nano-structures as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Directed assembly of micro- and nano-structures\", CC BY-SA 4.0) states: Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","support":[{"end":249,"quote":"Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","source_id":"wikipedia.article.directed-assembly-of-micro-and-nano-structures","source_sha256":"e1787d906b7e252326fd253e81f86147a197491d4f18eddc14b7d454ed32d737","start":135}],"target_id":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","target_kind":"node","target_sha256":"b864f059b1756ead699deeb815e66421b597d22f698c8b9bdf2ed0321c987e6e"}],"concept.wikipedia.dirichlet-average":[{"id":"assertion.concept.wikipedia.dirichlet-average","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dirichlet average as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dirichlet average\", CC BY-SA 4.0) states: Dirichlet averages are averages of functions under the Dirichlet distribution.","support":[{"end":183,"quote":"Dirichlet averages are averages of functions under the Dirichlet distribution.","source_id":"wikipedia.article.dirichlet-average","source_sha256":"a7cbbddd818a707b3d3b2185ca477cab1976011111eeb97469f090108846842b","start":105}],"target_id":"concept.wikipedia.dirichlet-average","target_kind":"node","target_sha256":"2111dae0d656d82af01f6c018c795f45430a3adee7c5f5e641af3e5597fefdf3"}],"concept.wikipedia.discontinuous-group":[{"id":"assertion.concept.wikipedia.discontinuous-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discontinuous group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discontinuous group\", CC BY-SA 4.0) states: A discontinuous group is a mathematical concept relating to mappings in topological space.","support":[{"end":197,"quote":"A discontinuous group is a mathematical concept relating to mappings in topological space.","source_id":"wikipedia.article.discontinuous-group","source_sha256":"fe08623c741418107a81dd7a3e6b2a5a72d6e83720f5c50a144f954755689c00","start":107}],"target_id":"concept.wikipedia.discontinuous-group","target_kind":"node","target_sha256":"896286286799d9f2c17914a3e7b0b908eb00aa44998811d38559dca53467cf5a"}],"concept.wikipedia.discourse-ethics":[{"id":"assertion.concept.wikipedia.discourse-ethics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discourse ethics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discourse ethics\", CC BY-SA 4.0) states: Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","support":[{"end":253,"quote":"Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","source_id":"wikipedia.article.discourse-ethics","source_sha256":"06da91cae877a098283875fd9330491d793809db1701c242a9969adba7cd98ee","start":103}],"target_id":"concept.wikipedia.discourse-ethics","target_kind":"node","target_sha256":"cbda3b1fcffd83629bfc5de2cb8c966596e7e9bf90a26a42d59b5f2e7aef9142"}],"concept.wikipedia.discovery-science":[{"id":"assertion.concept.wikipedia.discovery-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discovery science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discovery science\", CC BY-SA 4.0) states: Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","support":[{"end":311,"quote":"Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","source_id":"wikipedia.article.discovery-science","source_sha256":"6a3be3095d427ded9ed03865e00f5fc17100ddd0b31502b6f9237f8f79459892","start":104}],"target_id":"concept.wikipedia.discovery-science","target_kind":"node","target_sha256":"b517392ce2020c389c827a58b8538ee5d6bce759b5a95ec763c197007c8f2fc3"}],"concept.wikipedia.discrete-two-point-space":[{"id":"assertion.concept.wikipedia.discrete-two-point-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discrete two-point space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discrete two-point space\", CC BY-SA 4.0) states: In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","support":[{"end":242,"quote":"In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","source_id":"wikipedia.article.discrete-two-point-space","source_sha256":"1f995a25b9aa665dcc69cf9b098e3430a5be4b8ac8c0373310e6fe834722aba5","start":112}],"target_id":"concept.wikipedia.discrete-two-point-space","target_kind":"node","target_sha256":"acec32794da70f61138ee8d22e9aa3a0897958d94c8be52eebdd31973b19506a"}],"concept.wikipedia.disinformation-research":[{"id":"assertion.concept.wikipedia.disinformation-research","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disinformation research as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disinformation research\", CC BY-SA 4.0) states: Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","support":[{"end":316,"quote":"Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","source_id":"wikipedia.article.disinformation-research","source_sha256":"7b71d63e888a19c724c302e24a066546065f5421279a56fdcbb61a98f585acba","start":111}],"target_id":"concept.wikipedia.disinformation-research","target_kind":"node","target_sha256":"149403b9ce4aa15873041099da6a9f3c3df73f58ec57ef44631b5d71f2ded488"}],"concept.wikipedia.disjunctive-sequence":[{"id":"assertion.concept.wikipedia.disjunctive-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disjunctive sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disjunctive sequence\", CC BY-SA 4.0) states: A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","support":[{"end":250,"quote":"A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","source_id":"wikipedia.article.disjunctive-sequence","source_sha256":"f05536b26adeadad5a4d6f1a08df29e9819ef3110999abd099802c948dd4da6a","start":107}],"target_id":"concept.wikipedia.disjunctive-sequence","target_kind":"node","target_sha256":"87e2b51bab793f8c7f72eb010746efec0815383bc87f076c0c1d1e1c8790038c"}],"concept.wikipedia.dispersed-knowledge":[{"id":"assertion.concept.wikipedia.dispersed-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dispersed knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dispersed knowledge\", CC BY-SA 4.0) states: Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","support":[{"end":274,"quote":"Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","source_id":"wikipedia.article.dispersed-knowledge","source_sha256":"8390bbba2fb2f578ee44c3d398a4f9da802f3d419cea7e368e4e344ec5fe1c2d","start":105}],"target_id":"concept.wikipedia.dispersed-knowledge","target_kind":"node","target_sha256":"fdaecc5b1e983a6a16f0e2ecdbe27fa17a40541a10b0e193ee73b3b1239d0b12"}],"concept.wikipedia.disquotational-principle":[{"id":"assertion.concept.wikipedia.disquotational-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Disquotational principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Disquotational principle\", CC BY-SA 4.0) states: The disquotational principle is a philosophical principle which holds that a rational speaker will accept \"p\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","support":[{"end":362,"quote":"The disquotational principle is a philosophical principle which holds that a rational speaker will accept \\\"p\\\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","source_id":"wikipedia.article.disquotational-principle","source_sha256":"0706ad47d14ce1f0366a32f29fb631a0ee4facc9ebd487b39a983a9ab0c3859c","start":112}],"target_id":"concept.wikipedia.disquotational-principle","target_kind":"node","target_sha256":"a468fe9dbcbc14d622ca41ac5a1c960dd564434b96a05e46655d9cb18edb5100"}],"concept.wikipedia.dissoi-logoi":[{"id":"assertion.concept.wikipedia.dissoi-logoi","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dissoi logoi as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dissoi logoi\", CC BY-SA 4.0) states: The Dissoi logoi (Greek δισσοὶ λόγοι, \"contrasting arguments\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","support":[{"end":314,"quote":"The Dissoi logoi (Greek δισσοὶ λόγοι, \\\"contrasting arguments\\\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","source_id":"wikipedia.article.dissoi-logoi","source_sha256":"ea06f1b1cb9fc3e589c3d65be9c7f413b2554ad48f1eaa61bb69579768b504c4","start":100}],"target_id":"concept.wikipedia.dissoi-logoi","target_kind":"node","target_sha256":"7155e1a16e31525fcd53a001ce66b63ab83aa6cbb15bf3742c4a2166e273f56d"}],"concept.wikipedia.distinction-bias":[{"id":"assertion.concept.wikipedia.distinction-bias","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distinction bias as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distinction bias\", CC BY-SA 4.0) states: Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","support":[{"end":281,"quote":"Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","source_id":"wikipedia.article.distinction-bias","source_sha256":"9656dddd7b3b570f71586b2c0b240a72ca6657e08fc1fcf5c70069e6e9abc96e","start":104}],"target_id":"concept.wikipedia.distinction-bias","target_kind":"node","target_sha256":"496f3836bc72e1de56106709b01b1090c4533d97cc37d3c50ef3387d25b6b6c8"}],"concept.wikipedia.distinction-without-a-difference":[{"id":"assertion.concept.wikipedia.distinction-without-a-difference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distinction without a difference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distinction without a difference\", CC BY-SA 4.0) states: A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","support":[{"end":297,"quote":"A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","source_id":"wikipedia.article.distinction-without-a-difference","source_sha256":"95d53a7e34ff81023980b77dc34ef843525b49ba6c4f6e81c52b631220161d79","start":119}],"target_id":"concept.wikipedia.distinction-without-a-difference","target_kind":"node","target_sha256":"e4727cd34c46e035b3c2ab64d2d758b78bcffe71110721e77c5e247a954fbe02"}],"concept.wikipedia.distributed-parameter-system":[{"id":"assertion.concept.wikipedia.distributed-parameter-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distributed parameter system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distributed parameter system\", CC BY-SA 4.0) states: In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","support":[{"end":261,"quote":"In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","source_id":"wikipedia.article.distributed-parameter-system","source_sha256":"c6c2bb44d9c3695ab90274a54a72e5d33c65ec08d3f956e7068520ab7956f788","start":115}],"target_id":"concept.wikipedia.distributed-parameter-system","target_kind":"node","target_sha256":"88a210a5a49c1f4fff46b9525f933b6eb08b1a15f3ed607918ea8c79041e298b"}],"concept.wikipedia.distributive-lattice":[{"id":"assertion.concept.wikipedia.distributive-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Distributive lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Distributive lattice\", CC BY-SA 4.0) states: In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","support":[{"end":227,"quote":"In mathematics,  a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","source_id":"wikipedia.article.distributive-lattice","source_sha256":"f7b843d6cd7ff19e95e14c2adcd4de5310f60e35e7a1b53d68bfc5c0d31cffba","start":106}],"target_id":"concept.wikipedia.distributive-lattice","target_kind":"node","target_sha256":"842d448fbdb78224c91618b4c373ce2520ef758d3206953ae624fa8fe5968c01"}],"concept.wikipedia.dn-factor":[{"id":"assertion.concept.wikipedia.dn-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"DN factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"DN factor\", CC BY-SA 4.0) states: DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","support":[{"end":248,"quote":"DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","source_id":"wikipedia.article.dn-factor","source_sha256":"25c0de964e1c3ab0ef654dc504cf5df473f4044187fe3eb2f56683e5934c420c","start":97}],"target_id":"concept.wikipedia.dn-factor","target_kind":"node","target_sha256":"47dd2420b876f7fece5d13715635dbdbfd4134e99aad0c7f09d4bd40a5096a97"}],"concept.wikipedia.doctrine":[{"id":"assertion.concept.wikipedia.doctrine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Doctrine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Doctrine\", CC BY-SA 4.0) states: Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","support":[{"end":343,"quote":"Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","source_id":"wikipedia.article.doctrine","source_sha256":"7392315f5b42e520f4597ca61a78ebefad3baddbf4fd50e17f77c95f0a3a4287","start":96}],"target_id":"concept.wikipedia.doctrine","target_kind":"node","target_sha256":"1ee769429880146bfd160033e23a2eac0eb79683ab80d365a3020cbc4d4398d7"}],"concept.wikipedia.dogma":[{"id":"assertion.concept.wikipedia.dogma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dogma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dogma\", CC BY-SA 4.0) states: Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","support":[{"end":190,"quote":"Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","source_id":"wikipedia.article.dogma","source_sha256":"7497f74f2e164aae71f7e710401eefb505dda6a309cc75ce888bf39fa64dfc1b","start":90}],"target_id":"concept.wikipedia.dogma","target_kind":"node","target_sha256":"e7214c0b4f0915df7810d3b71682ce5f525de3024fafb06b38c2f1791cbcbd0d"}],"concept.wikipedia.dominance-order":[{"id":"assertion.concept.wikipedia.dominance-order","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dominance order as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dominance order\", CC BY-SA 4.0) states: In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","support":[{"end":462,"quote":"In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","source_id":"wikipedia.article.dominance-order","source_sha256":"f4c0bb1c1dd68fb1a0501568574f9319014e0988aa91392106d3a50dd7a5888c","start":103}],"target_id":"concept.wikipedia.dominance-order","target_kind":"node","target_sha256":"d532e07a5201ff369da665a3b327fddd1179bd538ba413d9a58acccebcebbddd"}],"concept.wikipedia.double-articulation":[{"id":"assertion.concept.wikipedia.double-articulation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double articulation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double articulation\", CC BY-SA 4.0) states: In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","support":[{"end":401,"quote":"In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","source_id":"wikipedia.article.double-articulation","source_sha256":"79eda1ea8239973831af175437c2b232602229f8e42b35b9b8cb918aa0fab1fd","start":106}],"target_id":"concept.wikipedia.double-articulation","target_kind":"node","target_sha256":"ebc83ba945cbf3298023b0106d001a8e8b599bbd268a42cbe25ebddbe5c4ac91"}],"concept.wikipedia.double-counting-fallacy":[{"id":"assertion.concept.wikipedia.double-counting-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double counting (fallacy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double counting (fallacy)\", CC BY-SA 4.0) states: Double counting is a fallacy in reasoning.","support":[{"end":154,"quote":"Double counting is a fallacy in reasoning.","source_id":"wikipedia.article.double-counting-fallacy","source_sha256":"2ced0717457af99d989363048fe09f6111187f63b3382a057a68ca1b2283c275","start":112}],"target_id":"concept.wikipedia.double-counting-fallacy","target_kind":"node","target_sha256":"4a59156643ce6b8a25c837fb9b4c86897659d3a6f61b9b706c3f2bc9e1200f73"}],"concept.wikipedia.double-hermeneutic":[{"id":"assertion.concept.wikipedia.double-hermeneutic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double hermeneutic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double hermeneutic\", CC BY-SA 4.0) states: The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \"lay\" concepts and those from the social sciences have a two-way relationship.","support":[{"end":279,"quote":"The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \\\"lay\\\" concepts and those from the social sciences have a two-way relationship.","source_id":"wikipedia.article.double-hermeneutic","source_sha256":"0031316c616bb204f8a1414db7a70cca9ffcc7a6d54db9eee82d328703b8caab","start":105}],"target_id":"concept.wikipedia.double-hermeneutic","target_kind":"node","target_sha256":"68cfb667015640c151d7572dfe4572509a110a71652fa55e9d69819a3557f932"}],"concept.wikipedia.downstream-manufacturing":[{"id":"assertion.concept.wikipedia.downstream-manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Downstream (manufacturing) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Downstream (manufacturing)\", CC BY-SA 4.0) states: Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","support":[{"end":228,"quote":"Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","source_id":"wikipedia.article.downstream-manufacturing","source_sha256":"742a28375021c943356a995ec52b1d584bc729d2f3a85f8e442b0345cd6e32bc","start":113}],"target_id":"concept.wikipedia.downstream-manufacturing","target_kind":"node","target_sha256":"06b2cab54c3aa7584bbbddddabe2f3ebbb6c965380d314c7aae00ac3e4caded2"}],"concept.wikipedia.doxastic-logic":[{"id":"assertion.concept.wikipedia.doxastic-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Doxastic logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Doxastic logic\", CC BY-SA 4.0) states: Doxastic logic is a type of logic concerned with reasoning about beliefs.","support":[{"end":175,"quote":"Doxastic logic is a type of logic concerned with reasoning about beliefs.","source_id":"wikipedia.article.doxastic-logic","source_sha256":"0894eedf6b163e9e1d3de71da2ec1804826c185e4a1599e8ac3686c9213c2949","start":102}],"target_id":"concept.wikipedia.doxastic-logic","target_kind":"node","target_sha256":"078e4cf6627bcccb11ae7d60c4b5d5831009e41c4049e185675303f85a575b85"}],"concept.wikipedia.drill-bit-sizes":[{"id":"assertion.concept.wikipedia.drill-bit-sizes","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drill bit sizes as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drill bit sizes\", CC BY-SA 4.0) states: Drill bits are the cutting tools of drilling machines.","support":[{"end":156,"quote":"Drill bits are the cutting tools of drilling machines.","source_id":"wikipedia.article.drill-bit-sizes","source_sha256":"2518e1f05e8e631b9a26dc3c0dbdc13c545099177c526389b17f401846c982aa","start":102}],"target_id":"concept.wikipedia.drill-bit-sizes","target_kind":"node","target_sha256":"2bafb558eeb1a19fb5fa4719e16a3e294cf07eb5c9f940ce839c44572d5947d9"}],"concept.wikipedia.drilling":[{"id":"assertion.concept.wikipedia.drilling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drilling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drilling\", CC BY-SA 4.0) states: Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","support":[{"end":209,"quote":"Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","source_id":"wikipedia.article.drilling","source_sha256":"84d384ad821dfc64a18019513d7ec662472d857874b7a1230b58e6912d208788","start":94}],"target_id":"concept.wikipedia.drilling","target_kind":"node","target_sha256":"a2bd781051360d68d5e4e79fea71274cbbe0e014aee074eccd9af1c1441ccd37"}],"concept.wikipedia.drive-shaft":[{"id":"assertion.concept.wikipedia.drive-shaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Drive shaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Drive shaft\", CC BY-SA 4.0) states: A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","support":[{"end":482,"quote":"A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","source_id":"wikipedia.article.drive-shaft","source_sha256":"05732eaa3c8bd719d4c1a63da36263ebf85afe520eb0737a9d36abe47be7b3fb","start":98}],"target_id":"concept.wikipedia.drive-shaft","target_kind":"node","target_sha256":"1fb366fb1a0c2ad51aa510a861825b2d322cb12725e7852eb5a94867ef87f8a8"}],"concept.wikipedia.dry-lubricant":[{"id":"assertion.concept.wikipedia.dry-lubricant","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dry lubricant as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dry lubricant\", CC BY-SA 4.0) states: Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","support":[{"end":307,"quote":"Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","source_id":"wikipedia.article.dry-lubricant","source_sha256":"77ef49fa1f55eaedf5044483cb80b317ecbe213f6cffda260cd518ddce16e8f2","start":101}],"target_id":"concept.wikipedia.dry-lubricant","target_kind":"node","target_sha256":"9bd1e0cca27b2723b6b8ffd33beba8784466e8625063af472208790eeda8c431"}],"concept.wikipedia.dual-cone-and-polar-cone":[{"id":"assertion.concept.wikipedia.dual-cone-and-polar-cone","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dual cone and polar cone as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dual cone and polar cone\", CC BY-SA 4.0) states: Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","support":[{"end":210,"quote":"Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","source_id":"wikipedia.article.dual-cone-and-polar-cone","source_sha256":"d81701aea7411b090b33abc060a497f187e26f792521521f368acdb342c7e8c7","start":112}],"target_id":"concept.wikipedia.dual-cone-and-polar-cone","target_kind":"node","target_sha256":"33c4eb2d850a4949e072a32f9bdf4595bb9e20dc337533786645fc42299ef23d"}],"concept.wikipedia.dual-lattice":[{"id":"assertion.concept.wikipedia.dual-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dual lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dual lattice\", CC BY-SA 4.0) states: In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","support":[{"end":202,"quote":"In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","source_id":"wikipedia.article.dual-lattice","source_sha256":"3dd970b4f85b449fdf4ebfb2b450277c7714ba7062cc5ddbdacaf49a65e0fd55","start":99}],"target_id":"concept.wikipedia.dual-lattice","target_kind":"node","target_sha256":"1849291e7dc88ef4623ec4507e2d2654cc90c0e2aad4fb25e43737789c0829fb"}],"concept.wikipedia.duck-test":[{"id":"assertion.concept.wikipedia.duck-test","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Duck test as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Duck test\", CC BY-SA 4.0) states: The duck test is a frequently cited colloquial example of abductive reasoning.","support":[{"end":174,"quote":"The duck test is a frequently cited colloquial example of abductive reasoning.","source_id":"wikipedia.article.duck-test","source_sha256":"a77ee672e835f0b9f2c3b663fc12343b6d030478b9ea95221d69b8d27c13a83c","start":96}],"target_id":"concept.wikipedia.duck-test","target_kind":"node","target_sha256":"0aef027e6fed91a904b58836c432a5b3604e779b9d443859430a779d3b9fb073"}],"concept.wikipedia.dyadic-cubes":[{"id":"assertion.concept.wikipedia.dyadic-cubes","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dyadic cubes as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dyadic cubes\", CC BY-SA 4.0) states: In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","support":[{"end":329,"quote":"In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","source_id":"wikipedia.article.dyadic-cubes","source_sha256":"e2de8463849c3fec4c723f5b6ddf34823bb9288c9b69a81af2a0dedda3657e0e","start":100}],"target_id":"concept.wikipedia.dyadic-cubes","target_kind":"node","target_sha256":"d9529a71b992e5b5a5cc48c4e9b10ab8c46f50e9a60a4f23bbe2e6a496356181"}],"concept.wikipedia.dye-and-pry":[{"id":"assertion.concept.wikipedia.dye-and-pry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dye-and-pry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dye-and-pry\", CC BY-SA 4.0) states: Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","support":[{"end":340,"quote":"Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","source_id":"wikipedia.article.dye-and-pry","source_sha256":"3a332c6249f2ecc31d8ee2f27a8f645b6e0b3b138689c14b504e7ba88db2c528","start":99}],"target_id":"concept.wikipedia.dye-and-pry","target_kind":"node","target_sha256":"5f07f360e2fdfb1b608d60d886dfee0433b50adf3f435c95809b6b7056cc12f3"}],"concept.wikipedia.dynamic-semantics":[{"id":"assertion.concept.wikipedia.dynamic-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dynamic semantics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dynamic semantics\", CC BY-SA 4.0) states: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","support":[{"end":253,"quote":"Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","source_id":"wikipedia.article.dynamic-semantics","source_sha256":"e202886a8aed04e22ee700ef7868ee099a8076705c65d099f754ce5269e2645c","start":105}],"target_id":"concept.wikipedia.dynamic-semantics","target_kind":"node","target_sha256":"23259b19b8bd97d89b4a3a59252b0d72dc74bfd971584033d7dce29a7226e81c"}],"concept.wikipedia.dynamical-system":[{"id":"assertion.concept.wikipedia.dynamical-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dynamical system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dynamical system\", CC BY-SA 4.0) states: In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","support":[{"end":259,"quote":"In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","source_id":"wikipedia.article.dynamical-system","source_sha256":"6228121c559cf6468a031c0254dcddfddf3a904ec52711953e5a762003c69a40","start":100}],"target_id":"concept.wikipedia.dynamical-system","target_kind":"node","target_sha256":"3d091650e615d6f6b8aac90ac73592a4f59745edca114a2dedfba49eaac086d7"}],"concept.wikipedia.dysrationalia":[{"id":"assertion.concept.wikipedia.dysrationalia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dysrationalia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dysrationalia\", CC BY-SA 4.0) states: Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","support":[{"end":203,"quote":"Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","source_id":"wikipedia.article.dysrationalia","source_sha256":"06fd352894a573ef713bb22b2032c80c104432cdd622ac68d0087ad967d0806b","start":100}],"target_id":"concept.wikipedia.dysrationalia","target_kind":"node","target_sha256":"049ccb0c74374d955565e7d15cd6e72c49f263b697b000b2113f27dd597ee8eb"}],"concept.wikipedia.dysteleology":[{"id":"assertion.concept.wikipedia.dysteleology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dysteleology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dysteleology\", CC BY-SA 4.0) states: Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","support":[{"end":239,"quote":"Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","source_id":"wikipedia.article.dysteleology","source_sha256":"1502619c2aaee94bb6329ee37f6bd6c155cdfff85a8dde02000ac736af684862","start":99}],"target_id":"concept.wikipedia.dysteleology","target_kind":"node","target_sha256":"7d226580ad3487a388e576f04410c2ba1bf572f779d1dfaa8123cc4dcbffb840"}],"concept.wikipedia.ecological-fallacy":[{"id":"assertion.concept.wikipedia.ecological-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecological fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecological fallacy\", CC BY-SA 4.0) states: An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \"Ecological fallacy\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","support":[{"end":513,"quote":"An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \\\"Ecological fallacy\\\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","source_id":"wikipedia.article.ecological-fallacy","source_sha256":"0e1b3cba7cb199ba2c670326db046eb2c5e6e8d6aff4c0c05e69e9a742635cae","start":104}],"target_id":"concept.wikipedia.ecological-fallacy","target_kind":"node","target_sha256":"0a67edfccb2a77c94f3966d4b3a6fd6d3e1c7f629cd98d1d1bfcf11ea5ba7fcb"}],"concept.wikipedia.ecology-of-contexts":[{"id":"assertion.concept.wikipedia.ecology-of-contexts","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecology of contexts as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecology of contexts\", CC BY-SA 4.0) states: The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","support":[{"end":262,"quote":"The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","source_id":"wikipedia.article.ecology-of-contexts","source_sha256":"291be065ba4b6cbbe4c349492ac2793b2d0f6ffdc40c3ddbbfdc287e1205da96","start":107}],"target_id":"concept.wikipedia.ecology-of-contexts","target_kind":"node","target_sha256":"2020c0898a756c3e8f4e74306f1bee668c390e451028923184b9f3050d6f2287"}],"concept.wikipedia.ecstasy-philosophy":[{"id":"assertion.concept.wikipedia.ecstasy-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ecstasy (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ecstasy (philosophy)\", CC BY-SA 4.0) states: In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \"outside-itself\".","support":[{"end":349,"quote":"In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \\\"outside-itself\\\".","source_id":"wikipedia.article.ecstasy-philosophy","source_sha256":"d2d0c95958ccc0eeaadf00f4f24970adec745aba341833e603bab8dc4ac5caa1","start":107}],"target_id":"concept.wikipedia.ecstasy-philosophy","target_kind":"node","target_sha256":"0a6b1beb02bc44b817356da9cdf3eb7ca9357b4e38154718aec3991f8d02d18e"}],"concept.wikipedia.effective-theory":[{"id":"assertion.concept.wikipedia.effective-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Effective theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Effective theory\", CC BY-SA 4.0) states: In science, an effective theory is a deliberately limited scientific theory applicable under specific circumstances.","support":[{"end":220,"quote":"In science, an effective theory is a deliberately limited  scientific theory applicable under specific circumstances.","source_id":"wikipedia.article.effective-theory","source_sha256":"7a59746bf2361985bd8696ec127a9d82385240a2d6b4d12ff87673785b40bf9a","start":103}],"target_id":"concept.wikipedia.effective-theory","target_kind":"node","target_sha256":"f21fa309a701ed2e327474b2a74ba43c5d6ccb77202fdef088c4ae3a36bbf7df"}],"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative":[{"id":"assertion.concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eigenvalues and eigenvectors of the second derivative as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eigenvalues and eigenvectors of the second derivative\", CC BY-SA 4.0) states: Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","support":[{"end":308,"quote":"Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","source_id":"wikipedia.article.eigenvalues-and-eigenvectors-of-the-second-derivative","source_sha256":"524f0626371cbfafa9242deab5acbf3be5047048d0f746250ba2790ac47319f3","start":141}],"target_id":"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","target_kind":"node","target_sha256":"16ec87a9ce86874a24a454659146f6bcc1edc4db59426e4dad4ef62c278c2b4b"}],"concept.wikipedia.elastic-and-inelastic-collisions-apparatus":[{"id":"assertion.concept.wikipedia.elastic-and-inelastic-collisions-apparatus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elastic and inelastic collisions apparatus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elastic and inelastic collisions apparatus\", CC BY-SA 4.0) states: The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","support":[{"end":240,"quote":"The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","source_id":"wikipedia.article.elastic-and-inelastic-collisions-apparatus","source_sha256":"c085c8fd95434068fbc2e96e87728035e8b26a4d4cf58f94a6abab79a50d8a47","start":130}],"target_id":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","target_kind":"node","target_sha256":"e51146198f5263925394e8b5a8cf07c0e5fb3834c7a3e6bc0f675844e57278c2"}],"concept.wikipedia.elastomeric-bridge-bearing":[{"id":"assertion.concept.wikipedia.elastomeric-bridge-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elastomeric bridge bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elastomeric bridge bearing\", CC BY-SA 4.0) states: An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","support":[{"end":288,"quote":"An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","source_id":"wikipedia.article.elastomeric-bridge-bearing","source_sha256":"8208e6f873b190e6aa608e98b8824a274309e0ef993153769b393b0a4ba0988b","start":114}],"target_id":"concept.wikipedia.elastomeric-bridge-bearing","target_kind":"node","target_sha256":"c7b1445df6bfd029060d2fa9cb0d834a88e22c91acd3c0a033f791c0b16f333f"}],"concept.wikipedia.electric-motor":[{"id":"assertion.concept.wikipedia.electric-motor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric motor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric motor\", CC BY-SA 4.0) states: An electric motor is a machine that converts electrical energy into mechanical energy.","support":[{"end":185,"quote":"An electric motor is a machine that converts electrical energy into mechanical energy.","source_id":"wikipedia.article.electric-motor","source_sha256":"e14906ef07e7ed5331691b4372f425caeeb6c941b795ebe6aa9f09e5785ff1df","start":99}],"target_id":"concept.wikipedia.electric-motor","target_kind":"node","target_sha256":"fa402c725890c31e8b4070c523f5a3959be13a86c06f3007e881186b4a2b952b"}],"concept.wikipedia.electric-power-quality":[{"id":"assertion.concept.wikipedia.electric-power-quality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric power quality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric power quality\", CC BY-SA 4.0) states: Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","support":[{"end":255,"quote":"Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","source_id":"wikipedia.article.electric-power-quality","source_sha256":"6294243e11c3be316480441b8a4d0011b5126ebf2f4de2513a839e433ff00cc1","start":109}],"target_id":"concept.wikipedia.electric-power-quality","target_kind":"node","target_sha256":"94dc88d4900bce13a4110dae8d4b9e8e129327c71b1a8aafd1ca11e87d805a91"}],"concept.wikipedia.electric-power-system":[{"id":"assertion.concept.wikipedia.electric-power-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electric power system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electric power system\", CC BY-SA 4.0) states: An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","support":[{"end":225,"quote":"An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","source_id":"wikipedia.article.electric-power-system","source_sha256":"ecf9610d5a30b2bdda22dc6477c45743c0950ce97b7505c7f2aba78b31feb031","start":109}],"target_id":"concept.wikipedia.electric-power-system","target_kind":"node","target_sha256":"27b857ba422ebf001ff76cb1c12a16210487eeabf38ffca5e1a6a5635f4d00cc"}],"concept.wikipedia.electrical-fault":[{"id":"assertion.concept.wikipedia.electrical-fault","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electrical fault as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electrical fault\", CC BY-SA 4.0) states: In an electric power system, a fault is a defect that results in abnormality of electric current.","support":[{"end":200,"quote":"In an electric power system, a fault is a defect that results in abnormality of electric current.","source_id":"wikipedia.article.electrical-fault","source_sha256":"554aa2888b752714463e9ebd95dd90602eb16e831a43aeab4c82fe546f807218","start":103}],"target_id":"concept.wikipedia.electrical-fault","target_kind":"node","target_sha256":"cb703fc5d8209cbba842e450f51933467728621fba56cb8c27d98ab47a2e7a6a"}],"concept.wikipedia.electronic-circuit":[{"id":"assertion.concept.wikipedia.electronic-circuit","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic circuit as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic circuit\", CC BY-SA 4.0) states: An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","support":[{"end":322,"quote":"An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","source_id":"wikipedia.article.electronic-circuit","source_sha256":"4d68dac47aec3ee5c19d5514dac970cb6d95160c6d12e1e2b291350a397bb449","start":105}],"target_id":"concept.wikipedia.electronic-circuit","target_kind":"node","target_sha256":"5c94229d80588878b8721e72906dfe029278b163a754ad06d03d1fd63ad398ed"}],"concept.wikipedia.electronic-color-code":[{"id":"assertion.concept.wikipedia.electronic-color-code","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic color code as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic color code\", CC BY-SA 4.0) states: An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","support":[{"end":270,"quote":"An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","source_id":"wikipedia.article.electronic-color-code","source_sha256":"542c0c851d15b71a6cfd3f9a04860fb8c0b9e448b62d8fa9310951ec5ecffca5","start":106}],"target_id":"concept.wikipedia.electronic-color-code","target_kind":"node","target_sha256":"02fa4e5f87ae916401a2f89259e667c51a27b383cc512209f241513011e2c570"}],"concept.wikipedia.electronic-component":[{"id":"assertion.concept.wikipedia.electronic-component","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electronic component as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electronic component\", CC BY-SA 4.0) states: An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","support":[{"end":271,"quote":"An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","source_id":"wikipedia.article.electronic-component","source_sha256":"fc869b7a1fb29b368016b162d61a365002ca8328fa087df6d2bf1cd07ea0177c","start":107}],"target_id":"concept.wikipedia.electronic-component","target_kind":"node","target_sha256":"1c747972a01134172fa87f8c4c0987eee5c20ff69d767347d9f9f9f531f42878"}],"concept.wikipedia.elementary-class":[{"id":"assertion.concept.wikipedia.elementary-class","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Elementary class as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Elementary class\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","support":[{"end":275,"quote":"In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","source_id":"wikipedia.article.elementary-class","source_sha256":"5895e7d89e7f12715e3cf8df9b7681d2c349065b7cb090e78d3e427224a3a7cb","start":103}],"target_id":"concept.wikipedia.elementary-class","target_kind":"node","target_sha256":"34eda768a88b936644f8ed569372d1b16dda115e90f0ea5ba9b3ffd8c7dcb0a5"}],"concept.wikipedia.eliminative-materialism":[{"id":"assertion.concept.wikipedia.eliminative-materialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eliminative materialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eliminative materialism\", CC BY-SA 4.0) states: Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","support":[{"end":300,"quote":"Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","source_id":"wikipedia.article.eliminative-materialism","source_sha256":"4eaed4fb7399ede61be0b9976c839a2742c82947269a01395abb3b7c39686360","start":109}],"target_id":"concept.wikipedia.eliminative-materialism","target_kind":"node","target_sha256":"306dcc0bc801e64ef73b705bdd33678fe5291bcb1e08c2bd39b75ccc88b7519b"}],"concept.wikipedia.embedded-instrumentation":[{"id":"assertion.concept.wikipedia.embedded-instrumentation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Embedded instrumentation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Embedded instrumentation\", CC BY-SA 4.0) states: In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","support":[{"end":289,"quote":"In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","source_id":"wikipedia.article.embedded-instrumentation","source_sha256":"94b751aebd35634e655e7ee0ef0de4d784bc32cc04223f8c009fcedb9dd710d8","start":112}],"target_id":"concept.wikipedia.embedded-instrumentation","target_kind":"node","target_sha256":"55bc7c26ff87a5549291ce6e2a9619f52bfe215f099db98d6e178231bb8d057a"}],"concept.wikipedia.emotional-reasoning":[{"id":"assertion.concept.wikipedia.emotional-reasoning","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Emotional reasoning as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Emotional reasoning\", CC BY-SA 4.0) states: Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","support":[{"end":274,"quote":"Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","source_id":"wikipedia.article.emotional-reasoning","source_sha256":"24a812bb6221d98252fcc4ca11bec04c823f4124bd8f01a4f2ea67fea8f3c320","start":106}],"target_id":"concept.wikipedia.emotional-reasoning","target_kind":"node","target_sha256":"7ad9d5e7e61feeac3e4b4bb790415cec03d6522354bc55e03fb1a1a84ba01969"}],"concept.wikipedia.empiric-school":[{"id":"assertion.concept.wikipedia.empiric-school","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Empiric school as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Empiric school\", CC BY-SA 4.0) states: The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","support":[{"end":271,"quote":"The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","source_id":"wikipedia.article.empiric-school","source_sha256":"cc759883786452b3c7c470df3929d1762316379c02aef312359843191e844619","start":102}],"target_id":"concept.wikipedia.empiric-school","target_kind":"node","target_sha256":"1c3a6329e5c7af5cfa5686ff3ba3e3b08051d7e42ff86d24a5f53f46a6d6b0e5"}],"concept.wikipedia.empirical-evidence":[{"id":"assertion.concept.wikipedia.empirical-evidence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Empirical evidence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Empirical evidence\", CC BY-SA 4.0) states: Empirical evidence is evidence obtained through sense experience or experimental procedure.","support":[{"end":195,"quote":"Empirical evidence is evidence obtained through sense experience or experimental procedure.","source_id":"wikipedia.article.empirical-evidence","source_sha256":"c07a3cb62daa5c1c88ffaca0555da17f869fbe51ad11be0600a83019dec2dc83","start":104}],"target_id":"concept.wikipedia.empirical-evidence","target_kind":"node","target_sha256":"d56f5226c228f029796db0039a8f946500d5be707431e245c04492330fcc6198"}],"concept.wikipedia.encyclopedic-knowledge":[{"id":"assertion.concept.wikipedia.encyclopedic-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Encyclopedic knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Encyclopedic knowledge\", CC BY-SA 4.0) states: To have encyclopedic knowledge is to have \"vast and complete\" knowledge about a large number of diverse subjects.","support":[{"end":225,"quote":"To have encyclopedic knowledge is to have \\\"vast and complete\\\" knowledge about a large number of diverse subjects.","source_id":"wikipedia.article.encyclopedic-knowledge","source_sha256":"dc413cec8c7da8068842669f31762e5a25a42213783c1907cc15a1b515dfe90b","start":110}],"target_id":"concept.wikipedia.encyclopedic-knowledge","target_kind":"node","target_sha256":"25a83e4ba5ae8ca523dbcb5b97b813fadd23a396ac44e3813cfcaa3da374ffad"}],"concept.wikipedia.end-of-history-illusion":[{"id":"assertion.concept.wikipedia.end-of-history-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"End-of-history illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"End-of-history illusion\", CC BY-SA 4.0) states: The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","support":[{"end":367,"quote":"The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","source_id":"wikipedia.article.end-of-history-illusion","source_sha256":"781cd95ed70ff8003418d43aebb44c2e7cd24471b80687eadb54daa1b8184706","start":111}],"target_id":"concept.wikipedia.end-of-history-illusion","target_kind":"node","target_sha256":"e2855ed6f4c620c7d7f13932a42c66eee5ec5c8af3f74d70d70d4c1cfa4b7efc"}],"concept.wikipedia.engaged-theory":[{"id":"assertion.concept.wikipedia.engaged-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engaged theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engaged theory\", CC BY-SA 4.0) states: Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","support":[{"end":356,"quote":"Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","source_id":"wikipedia.article.engaged-theory","source_sha256":"5fd03e90f70c73a6fcfb53c094f94f68862be6cd6e8d13d5b585128e704dc180","start":102}],"target_id":"concept.wikipedia.engaged-theory","target_kind":"node","target_sha256":"ae7e5372d80253cd329dde6dc9d05acc6189a7e181aef5702d02581564e75d60"}],"concept.wikipedia.engine":[{"id":"assertion.concept.wikipedia.engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engine\", CC BY-SA 4.0) states: An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","support":[{"end":193,"quote":"An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","source_id":"wikipedia.article.engine","source_sha256":"23770c4eb69102515204e8777455beab5a10db7cdbe9444a0e359404b225b401","start":90}],"target_id":"concept.wikipedia.engine","target_kind":"node","target_sha256":"9ac1611ee83efecf0509467ed17a788f890b291b5932d212c64c739d6de1236c"}],"concept.wikipedia.engineering-geology":[{"id":"assertion.concept.wikipedia.engineering-geology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Engineering geology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Engineering geology\", CC BY-SA 4.0) states: Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","support":[{"end":358,"quote":"Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","source_id":"wikipedia.article.engineering-geology","source_sha256":"5f1eb870bf7b3dffa85929a84b6017441c900d78da833c567bebbef854d786df","start":105}],"target_id":"concept.wikipedia.engineering-geology","target_kind":"node","target_sha256":"9333574ce940306f1fc9c9c58b4dd14379a937b284e27610054bf72cbbc27347"}],"concept.wikipedia.epicurean-paradox":[{"id":"assertion.concept.wikipedia.epicurean-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epicurean paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epicurean paradox\", CC BY-SA 4.0) states: The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","support":[{"end":327,"quote":"The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","source_id":"wikipedia.article.epicurean-paradox","source_sha256":"1cb1ef5d0cfb3cb7761546bf98768f1db50c2814afce06935de53d8b51b982cf","start":105}],"target_id":"concept.wikipedia.epicurean-paradox","target_kind":"node","target_sha256":"653a3f39633ae4a8c72c9bb3c5c48e336517c8e67bf51e17628c5ff6f62cc423"}],"concept.wikipedia.epicyclic-gearing":[{"id":"assertion.concept.wikipedia.epicyclic-gearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epicyclic gearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epicyclic gearing\", CC BY-SA 4.0) states: An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \"planet\") revolves around the center of the other (the \"sun\").","support":[{"end":326,"quote":"An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \\\"planet\\\") revolves around the center of the other (the \\\"sun\\\").","source_id":"wikipedia.article.epicyclic-gearing","source_sha256":"e904f6af2594b42bef76c043b89fa91028ea2014868666edbd41afa4afef5a28","start":103}],"target_id":"concept.wikipedia.epicyclic-gearing","target_kind":"node","target_sha256":"85e1805e3f0d3a28ad555c83656a24263c693a9230f1d3dbf8a49f07d7a68237"}],"concept.wikipedia.epistemic-democracy":[{"id":"assertion.concept.wikipedia.epistemic-democracy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic democracy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic democracy\", CC BY-SA 4.0) states: Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","support":[{"end":300,"quote":"Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","source_id":"wikipedia.article.epistemic-democracy","source_sha256":"73a4c6f4fff603077bec93c2aaa47eea01100d73777ef7f7d661a8a721496d2f","start":107}],"target_id":"concept.wikipedia.epistemic-democracy","target_kind":"node","target_sha256":"47afbb7ab67a813b0f93feb0df384154ab5bdcb1921c18eea79851d89702c5a7"}],"concept.wikipedia.epistemic-insight":[{"id":"assertion.concept.wikipedia.epistemic-insight","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic insight as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic insight\", CC BY-SA 4.0) states: Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","support":[{"end":233,"quote":"Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","source_id":"wikipedia.article.epistemic-insight","source_sha256":"f07813e89a313f89eabb15542cac5cb2bfb152c1d55255ddcfbb15bee78cb37d","start":105}],"target_id":"concept.wikipedia.epistemic-insight","target_kind":"node","target_sha256":"aa8741cb22373d1ed2d65e9c0fac8e1ba17df123b29839016596fa92cc208310"}],"concept.wikipedia.epistemic-theories-of-truth":[{"id":"assertion.concept.wikipedia.epistemic-theories-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemic theories of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemic theories of truth\", CC BY-SA 4.0) states: In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","support":[{"end":332,"quote":"In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","source_id":"wikipedia.article.epistemic-theories-of-truth","source_sha256":"d30474e579c22a51aa6710e87fea25ab2c7a9243414543bb45f262fba5726dc2","start":114}],"target_id":"concept.wikipedia.epistemic-theories-of-truth","target_kind":"node","target_sha256":"1ca048525d90e4f5cda22cf5f926e2c99230c0a5161949a5e62212a3fc340011"}],"concept.wikipedia.epistemicism":[{"id":"assertion.concept.wikipedia.epistemicism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemicism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemicism\", CC BY-SA 4.0) states: Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","support":[{"end":300,"quote":"Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","source_id":"wikipedia.article.epistemicism","source_sha256":"074475ca4a944bbbfb605edfd8384d89d801f2a78eb23b4db4b1c0bb004aabe9","start":100}],"target_id":"concept.wikipedia.epistemicism","target_kind":"node","target_sha256":"cbd7c47218ad45aa015241cdaf3ed0941612759a0fd6586e18b1eba796ff5f70"}],"concept.wikipedia.epistemological-idealism":[{"id":"assertion.concept.wikipedia.epistemological-idealism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological idealism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological idealism\", CC BY-SA 4.0) states: Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","support":[{"end":251,"quote":"Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","source_id":"wikipedia.article.epistemological-idealism","source_sha256":"aa9a397fbd93701d6ea954342b8371cea4e6e70c4a0ce0f8868f0be624160084","start":110}],"target_id":"concept.wikipedia.epistemological-idealism","target_kind":"node","target_sha256":"b1a09240e9cdeb4d0323dc74de626f942e4b1c8187154a704179d8be3c30eb03"}],"concept.wikipedia.epistemological-particularism":[{"id":"assertion.concept.wikipedia.epistemological-particularism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological particularism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological particularism\", CC BY-SA 4.0) states: Epistemological particularism is the view that one can know something without knowing how one knows it.","support":[{"end":220,"quote":"Epistemological particularism is the view that one can know something without knowing how one knows it.","source_id":"wikipedia.article.epistemological-particularism","source_sha256":"a5c7cff003874aa13ae6da4e5d4243a07a04d505dc8484bd36b3a5f0a94a0744","start":117}],"target_id":"concept.wikipedia.epistemological-particularism","target_kind":"node","target_sha256":"e5afb4830cf5ede46af8856862b810e0dd89bc193b80747c7e0605d18e1ef073"}],"concept.wikipedia.epistemological-pluralism":[{"id":"assertion.concept.wikipedia.epistemological-pluralism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological pluralism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological pluralism\", CC BY-SA 4.0) states: Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","support":[{"end":356,"quote":"Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","source_id":"wikipedia.article.epistemological-pluralism","source_sha256":"eb018ee1f7a9a8761a3221a0c126dc4acfd7707259861331455cd6d6b5d10550","start":113}],"target_id":"concept.wikipedia.epistemological-pluralism","target_kind":"node","target_sha256":"9a94004f3a29859e0aa24fb5cebffc7e1abe83216894cc6696f4e8f5f87fd6d3"}],"concept.wikipedia.epistemological-rupture":[{"id":"assertion.concept.wikipedia.epistemological-rupture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epistemological rupture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epistemological rupture\", CC BY-SA 4.0) states: Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","support":[{"end":266,"quote":"Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","source_id":"wikipedia.article.epistemological-rupture","source_sha256":"98143c63389fdc7e22c7dac6b1296b0fcb967be237d4be8e13630ddbb0a12052","start":110}],"target_id":"concept.wikipedia.epistemological-rupture","target_kind":"node","target_sha256":"0e4aaea0259bd08682785a7629702c9af98a12f61196f4f0016ba532918ecfee"}],"concept.wikipedia.epsilon-calculus":[{"id":"assertion.concept.wikipedia.epsilon-calculus","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Epsilon calculus as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Epsilon calculus\", CC BY-SA 4.0) states: In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","support":[{"end":354,"quote":"In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","source_id":"wikipedia.article.epsilon-calculus","source_sha256":"4f260b1882ffd26f5332fc2137650f58ac31a4c6c9d9df759e3270a2762230df","start":104}],"target_id":"concept.wikipedia.epsilon-calculus","target_kind":"node","target_sha256":"d3cf5a0f7e150f42aa534ecd0fcfa1a526acf3af10491dfa223bfd78aed7e4b6"}],"concept.wikipedia.ergo-decedo":[{"id":"assertion.concept.wikipedia.ergo-decedo","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ergo decedo as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ergo decedo\", CC BY-SA 4.0) states: Ergo decedo, Latin for \"therefore I leave\" or \"then I go off\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","support":[{"end":462,"quote":"Ergo decedo, Latin for \\\"therefore I leave\\\" or \\\"then I go off\\\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","source_id":"wikipedia.article.ergo-decedo","source_sha256":"bbd42bbe8370b00ffd5c0c01262efeaa5450718882d26b1ff339108982b58981","start":99}],"target_id":"concept.wikipedia.ergo-decedo","target_kind":"node","target_sha256":"1b5a55aaaeb8b805e53d104a31cbc615d0b8e28b072e7eaa04ad6ff853b4bd11"}],"concept.wikipedia.euclidean-geometry":[{"id":"assertion.concept.wikipedia.euclidean-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Euclidean geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Euclidean geometry\", CC BY-SA 4.0) states: Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","support":[{"end":257,"quote":"Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","source_id":"wikipedia.article.euclidean-geometry","source_sha256":"592f4fab7144fcf9f1ff00aedcdc296017776e1b362a98f2d98b90f097b6c29f","start":102}],"target_id":"concept.wikipedia.euclidean-geometry","target_kind":"node","target_sha256":"da6bf55f67fd2b4a7901e9231dd242b375aae02ea35284d140737decd7d6b8a7"}],"concept.wikipedia.euler-spiral":[{"id":"assertion.concept.wikipedia.euler-spiral","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Euler spiral as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Euler spiral\", CC BY-SA 4.0) states: An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","support":[{"end":259,"quote":"An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","source_id":"wikipedia.article.euler-spiral","source_sha256":"93f7a0d3b0dd5a2f826ef70452d46bc48b217b7781d5adad7c903e023094e2f5","start":100}],"target_id":"concept.wikipedia.euler-spiral","target_kind":"node","target_sha256":"157fe5e0d33db22e7179f9d38adc232d9bb80c6a34a410e82071340ecd5e1c68"}],"concept.wikipedia.evidence-based-practice":[{"id":"assertion.concept.wikipedia.evidence-based-practice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evidence-based practice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evidence-based practice\", CC BY-SA 4.0) states: Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","support":[{"end":221,"quote":"Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","source_id":"wikipedia.article.evidence-based-practice","source_sha256":"ddefaf787fe5bf43ffd94dc77da473006824a578184f300c6a0a45e0dcc3cfd5","start":110}],"target_id":"concept.wikipedia.evidence-based-practice","target_kind":"node","target_sha256":"a1edc4db5911146c370921d85a6b163afab1005d3abdcff9f3dac4f7bf295043"}],"concept.wikipedia.evidentialism":[{"id":"assertion.concept.wikipedia.evidentialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evidentialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evidentialism\", CC BY-SA 4.0) states: Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","support":[{"end":264,"quote":"Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","source_id":"wikipedia.article.evidentialism","source_sha256":"2e60d08474176fad7d0b59965f44b43e4ae59783153fd982b7facc626d0644e6","start":99}],"target_id":"concept.wikipedia.evidentialism","target_kind":"node","target_sha256":"ffa8cc72ba56ee17b40cc27039776f0023c6d0fc0acd03cdbf4af418768fb8ad"}],"concept.wikipedia.evolutionary-debunking":[{"id":"assertion.concept.wikipedia.evolutionary-debunking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Evolutionary debunking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Evolutionary debunking\", CC BY-SA 4.0) states: An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","support":[{"end":458,"quote":"An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","source_id":"wikipedia.article.evolutionary-debunking","source_sha256":"e318c5dda43a157cbb9a9ef31fd103519064f8b7dae9d588a270bf6507063d3e","start":110}],"target_id":"concept.wikipedia.evolutionary-debunking","target_kind":"node","target_sha256":"864970f597572f703b2b11bfb06cd11442a8d2acb296f0cd124a12a68bc8fe59"}],"concept.wikipedia.excluded-point-topology":[{"id":"assertion.concept.wikipedia.excluded-point-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Excluded point topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Excluded point topology\", CC BY-SA 4.0) states: In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","support":[{"end":223,"quote":"In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","source_id":"wikipedia.article.excluded-point-topology","source_sha256":"d7f9a427dfeeabd43d748148cbf522a226d009896eb47aac0e2a7bb857e58b66","start":110}],"target_id":"concept.wikipedia.excluded-point-topology","target_kind":"node","target_sha256":"51e558d16966b1b336bc88df8a08db5124aecbfd0ca5dbffdfc7b76640de25d1"}],"concept.wikipedia.exercise-machine":[{"id":"assertion.concept.wikipedia.exercise-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Exercise machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Exercise machine\", CC BY-SA 4.0) states: An exercise machine is any machine used for physical exercise.","support":[{"end":165,"quote":"An exercise machine is any machine used for physical exercise.","source_id":"wikipedia.article.exercise-machine","source_sha256":"75d1543ddaaa60ed557d6da644ef1276c0df0e4b82a8fd5131302d713c2874d3","start":103}],"target_id":"concept.wikipedia.exercise-machine","target_kind":"node","target_sha256":"0bf50f7bc87e5c2cdc3e6c308dadaf632ad1166f4c41bb651e8277f84a357eef"}],"concept.wikipedia.existential-graph":[{"id":"assertion.concept.wikipedia.existential-graph","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Existential graph as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Existential graph\", CC BY-SA 4.0) states: An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","support":[{"end":337,"quote":"An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","source_id":"wikipedia.article.existential-graph","source_sha256":"fce377ab0a7a091f1d696171b2605ba1d5237e6cd309b6d12ee7cddb71d2ded0","start":104}],"target_id":"concept.wikipedia.existential-graph","target_kind":"node","target_sha256":"50ded4c56d237a5029e4e90658d804db6e7cf1fc478de310b85d2abcaec33144"}],"concept.wikipedia.expectancy-theory":[{"id":"assertion.concept.wikipedia.expectancy-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Expectancy theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Expectancy theory\", CC BY-SA 4.0) states: Expectancy theory (or expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","support":[{"end":361,"quote":"Expectancy theory (or  expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","source_id":"wikipedia.article.expectancy-theory","source_sha256":"effb08d117098fdcfdde331a09710c3e8d138ec2579c27cc39463c33392d33fa","start":103}],"target_id":"concept.wikipedia.expectancy-theory","target_kind":"node","target_sha256":"af018dcf49991fec4fc8a23f134ed56c0dfc1829947257e5103dd45201de8ba1"}],"concept.wikipedia.expectancy-violations-theory":[{"id":"assertion.concept.wikipedia.expectancy-violations-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Expectancy violations theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Expectancy violations theory\", CC BY-SA 4.0) states: Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","support":[{"end":278,"quote":"Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","source_id":"wikipedia.article.expectancy-violations-theory","source_sha256":"8fcd233f2bcc00e9803b138b7f2c5fbc6b9404242cb070b64380f36359e9eec3","start":115}],"target_id":"concept.wikipedia.expectancy-violations-theory","target_kind":"node","target_sha256":"93ea8c6f34161bc19f3c9ccf6d650ae19c2e1eb53ca50e1ae0eccf77636cdd7d"}],"concept.wikipedia.experience-machine":[{"id":"assertion.concept.wikipedia.experience-machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experience machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experience machine\", CC BY-SA 4.0) states: The experience machine or pleasure machine is a thought experiment put forward by philosopher Robert Nozick in his 1974 book Anarchy, State, and Utopia.","support":[{"end":259,"quote":"The experience machine or pleasure machine is a thought experiment put forward by  philosopher Robert Nozick in his 1974 book  Anarchy, State, and Utopia.","source_id":"wikipedia.article.experience-machine","source_sha256":"3d167e53177941a5005b87825ee0ea9865d68dd9b6bdb743ca5be4ebe0c67c4a","start":105}],"target_id":"concept.wikipedia.experience-machine","target_kind":"node","target_sha256":"57bf86d2b8c4e02ae22bc179aa0da312c52e8f6dd14a1a81b1b38b3d99b07f53"}],"concept.wikipedia.experiment":[{"id":"assertion.concept.wikipedia.experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experiment\", CC BY-SA 4.0) states: An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","support":[{"end":243,"quote":"An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","source_id":"wikipedia.article.experiment","source_sha256":"fa1de9df3db3da82e310756f2d8c19052337c74b46ff243e4b45f706b24a81f3","start":95}],"target_id":"concept.wikipedia.experiment","target_kind":"node","target_sha256":"ae123452ee97e7fc8cdbf1835ccbd5195d765825f2c522855a071edd5c3dac65"}],"concept.wikipedia.experimental-philosophy":[{"id":"assertion.concept.wikipedia.experimental-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimental philosophy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimental philosophy\", CC BY-SA 4.0) states: Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","support":[{"end":370,"quote":"Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","source_id":"wikipedia.article.experimental-philosophy","source_sha256":"8cbd3a256d1efeee00a9b15c7f51590e9f2dbf921c1f62c3b31c27e933f96d47","start":110}],"target_id":"concept.wikipedia.experimental-philosophy","target_kind":"node","target_sha256":"ee56e1d1686f6b427ce6afb80d2afd0273d59836a3da609170ef58d805b6f075"}],"concept.wikipedia.experimenter-s-regress":[{"id":"assertion.concept.wikipedia.experimenter-s-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimenter's regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimenter's regress\", CC BY-SA 4.0) states: In science, experimenter's regress refers to a loop of dependence between theory and evidence.","support":[{"end":203,"quote":"In science, experimenter's regress refers to a loop of dependence between theory and evidence.","source_id":"wikipedia.article.experimenter-s-regress","source_sha256":"444106ac20c54cf17d65bf927d33cf89ffe6d643af744e454f7603efc393e3f3","start":109}],"target_id":"concept.wikipedia.experimenter-s-regress","target_kind":"node","target_sha256":"cbe4af7e9edee7ffc3c0b195330fa3c9b213188d7a196dc9a73a6322c6bf7aba"}],"concept.wikipedia.experimentum-crucis":[{"id":"assertion.concept.wikipedia.experimentum-crucis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Experimentum crucis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Experimentum crucis\", CC BY-SA 4.0) states: In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","support":[{"end":388,"quote":"In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","source_id":"wikipedia.article.experimentum-crucis","source_sha256":"0c4a22386318d08002289b142ec22e59809a860ed0096f11b950d3e27c018c15","start":105}],"target_id":"concept.wikipedia.experimentum-crucis","target_kind":"node","target_sha256":"233d78445f0ba93088df77eca3fb6808c79df96d778aad828cd13406d8a38776"}],"concept.wikipedia.explanatory-indispensability-argument":[{"id":"assertion.concept.wikipedia.explanatory-indispensability-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explanatory indispensability argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explanatory indispensability argument\", CC BY-SA 4.0) states: The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","support":[{"end":257,"quote":"The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","source_id":"wikipedia.article.explanatory-indispensability-argument","source_sha256":"26a784fd575d347cbb28636bd07c58543f497e4d71dca051261d06fdc104aa5e","start":125}],"target_id":"concept.wikipedia.explanatory-indispensability-argument","target_kind":"node","target_sha256":"9ce0d106e1052a79a56c65a4a8ecb83deca2e9e4b904a3c1e2a0ceb8170c8b01"}],"concept.wikipedia.explanatory-power":[{"id":"assertion.concept.wikipedia.explanatory-power","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explanatory power as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explanatory power\", CC BY-SA 4.0) states: Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","support":[{"end":227,"quote":"Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","source_id":"wikipedia.article.explanatory-power","source_sha256":"c05592412b7025bb988c47fb572d76b29bd4558707aabcd2924338c1ab2e99c8","start":105}],"target_id":"concept.wikipedia.explanatory-power","target_kind":"node","target_sha256":"1d0a6f337f43d5cdd726102be8bed95752e1ff4d139129d282436def783f5167"}],"concept.wikipedia.explicit-knowledge":[{"id":"assertion.concept.wikipedia.explicit-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Explicit knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Explicit knowledge\", CC BY-SA 4.0) states: Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","support":[{"end":256,"quote":"Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","source_id":"wikipedia.article.explicit-knowledge","source_sha256":"c50704af37625ce241692da09793030a17e650106a54c6df20ee580725c6cc88","start":105}],"target_id":"concept.wikipedia.explicit-knowledge","target_kind":"node","target_sha256":"1850d021dd99e2a3c8955d45c910d629f62cedeaa7def65d96af7793264961aa"}],"concept.wikipedia.exponential-field":[{"id":"assertion.concept.wikipedia.exponential-field","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Exponential field as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Exponential field\", CC BY-SA 4.0) states: In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","support":[{"end":267,"quote":"In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","source_id":"wikipedia.article.exponential-field","source_sha256":"bbebcc9bf14b7110da21472dbe652eb0f174f6a9811a419ec3cf4f8aca22f99a","start":105}],"target_id":"concept.wikipedia.exponential-field","target_kind":"node","target_sha256":"8029852e11d8672aa0645f08176c36c9a6f12c14173715a3b6c390d7fa8ec973"}],"concept.wikipedia.extension-semantics":[{"id":"assertion.concept.wikipedia.extension-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extension (semantics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extension (semantics)\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","support":[{"end":539,"quote":"In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","source_id":"wikipedia.article.extension-semantics","source_sha256":"0aeccfceefca2deccd1665382b7b28bdafe38a665d7e48a3e9dbd1080651e8c2","start":106}],"target_id":"concept.wikipedia.extension-semantics","target_kind":"node","target_sha256":"95237318e0a7d031f78baf5b2155a9f6f5b4c211e7613ebdb7d94da2f029f0e8"}],"concept.wikipedia.extensional-context":[{"id":"assertion.concept.wikipedia.extensional-context","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extensional context as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extensional context\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","support":[{"end":506,"quote":"In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","source_id":"wikipedia.article.extensional-context","source_sha256":"1bd5bc8b05cbbe53472dcb91e30b9282fad813045238d439ae06a5eae6896213","start":106}],"target_id":"concept.wikipedia.extensional-context","target_kind":"node","target_sha256":"671d5452ef1adc42175b996fbd085d69af4dd4dea76bd2787aaa6068b0541e7a"}],"concept.wikipedia.fallacy":[{"id":"assertion.concept.wikipedia.fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fallacy\", CC BY-SA 4.0) states: A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","support":[{"end":238,"quote":"A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","source_id":"wikipedia.article.fallacy","source_sha256":"13ef7eade885875b25b0600f9ba7a956a992a42fdae29d1035b44bfd3da96ab7","start":92}],"target_id":"concept.wikipedia.fallacy","target_kind":"node","target_sha256":"7200da20e4404fd7461ed6ff2602918c535d93a196044e7928abd8e84a176632"}],"concept.wikipedia.false-brinelling":[{"id":"assertion.concept.wikipedia.false-brinelling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"False brinelling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"False brinelling\", CC BY-SA 4.0) states: False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","support":[{"end":289,"quote":"False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","source_id":"wikipedia.article.false-brinelling","source_sha256":"0d12148c009f4f8b55330edba9970bc884ae36f7a8b0e494ee518a19dd372465","start":103}],"target_id":"concept.wikipedia.false-brinelling","target_kind":"node","target_sha256":"7e4cffa9297be7b88696f9262360cdc7efaccec41ddf7be2f905a52d5f92a811"}],"concept.wikipedia.faraday-paradox-electrochemistry":[{"id":"assertion.concept.wikipedia.faraday-paradox-electrochemistry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Faraday paradox (electrochemistry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Faraday paradox (electrochemistry)\", CC BY-SA 4.0) states: The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","support":[{"end":218,"quote":"The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","source_id":"wikipedia.article.faraday-paradox-electrochemistry","source_sha256":"850d28aa1d4ac7e6a8e18a805cd4769e14d0f12b1787f7068f464d37a91ca282","start":121}],"target_id":"concept.wikipedia.faraday-paradox-electrochemistry","target_kind":"node","target_sha256":"96ff02876cd0fec369cd0cb1f298729a4e602c36236b115410409621da60e519"}],"concept.wikipedia.fast-growing-hierarchy":[{"id":"assertion.concept.wikipedia.fast-growing-hierarchy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fast-growing hierarchy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fast-growing hierarchy\", CC BY-SA 4.0) states: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","support":[{"end":468,"quote":"In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","source_id":"wikipedia.article.fast-growing-hierarchy","source_sha256":"49aabb0f774f847e00c1c9b17438e598d2e85d2cb7921a0329641bcf49f70735","start":110}],"target_id":"concept.wikipedia.fast-growing-hierarchy","target_kind":"node","target_sha256":"65c0319c3886d02bd2375c96964fd0f6f32c501415b3552f4a49816768cdda1a"}],"concept.wikipedia.fastener":[{"id":"assertion.concept.wikipedia.fastener","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fastener as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fastener\", CC BY-SA 4.0) states: A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","support":[{"end":229,"quote":"A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","source_id":"wikipedia.article.fastener","source_sha256":"910e83a5fa1bcfb1925eb5ab03594058ddd27da68134b47037d57b6dd05c9987","start":94}],"target_id":"concept.wikipedia.fastener","target_kind":"node","target_sha256":"7d3c28339f9c9a4b742582a37e204e8c1c55bd0878ff8a606af1fabdcfc4eac1"}],"concept.wikipedia.feminist-epistemology":[{"id":"assertion.concept.wikipedia.feminist-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Feminist epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Feminist epistemology\", CC BY-SA 4.0) states: Feminist epistemology is an examination of epistemology from a feminist standpoint.","support":[{"end":192,"quote":"Feminist epistemology is an examination of epistemology from a feminist standpoint.","source_id":"wikipedia.article.feminist-epistemology","source_sha256":"0863ab3c39aa91598863e25ba4649b41863686b14eed478b479a15c7b9e79cef","start":109}],"target_id":"concept.wikipedia.feminist-epistemology","target_kind":"node","target_sha256":"db51a82dc7d0d74e4b32fded819af5074da591f7acfb2823845de984c5ca7858"}],"concept.wikipedia.feminist-post-structuralist-discourse-analysis":[{"id":"assertion.concept.wikipedia.feminist-post-structuralist-discourse-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Feminist post-structuralist discourse analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Feminist post-structuralist discourse analysis\", CC BY-SA 4.0) states: Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","support":[{"end":350,"quote":"Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","source_id":"wikipedia.article.feminist-post-structuralist-discourse-analysis","source_sha256":"23c6258f644e54ef2565dc668dac74b72a51040e3892461f224b5087981bd15a","start":134}],"target_id":"concept.wikipedia.feminist-post-structuralist-discourse-analysis","target_kind":"node","target_sha256":"abffe2a7b29291d1968d3a2e6629b22b459932542a170f3fbe5bb7834d98c53d"}],"concept.wikipedia.fictionalism":[{"id":"assertion.concept.wikipedia.fictionalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fictionalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fictionalism\", CC BY-SA 4.0) states: Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \"make believe\", thus allowing individuals to treat something as literally true (a \"useful fiction\").","support":[{"end":388,"quote":"Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \\\"make believe\\\", thus allowing individuals to treat something as literally true (a \\\"useful fiction\\\").","source_id":"wikipedia.article.fictionalism","source_sha256":"931da8cc260751f351007688030117a48c281b6a0988ac528b19db65907f4d6b","start":99}],"target_id":"concept.wikipedia.fictionalism","target_kind":"node","target_sha256":"7e75463bab4a04665d615a9dd8b56537d651970a025d9a3be833013b075a7873"}],"concept.wikipedia.field-programmable-gate-array":[{"id":"assertion.concept.wikipedia.field-programmable-gate-array","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Field-programmable gate array as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Field-programmable gate array\", CC BY-SA 4.0) states: A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","support":[{"end":252,"quote":"A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","source_id":"wikipedia.article.field-programmable-gate-array","source_sha256":"de7f4a6616632662bdf739126d5ca46769ef7e875b47fd63269282682673114d","start":114}],"target_id":"concept.wikipedia.field-programmable-gate-array","target_kind":"node","target_sha256":"f5b5c31308f87bf889674251966d5d838b22540c4d1687c8ec18a0a69fe8ead8"}],"concept.wikipedia.fin-field-effect-transistor":[{"id":"assertion.concept.wikipedia.fin-field-effect-transistor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fin field-effect transistor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fin field-effect transistor\", CC BY-SA 4.0) states: A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","support":[{"end":422,"quote":"A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","source_id":"wikipedia.article.fin-field-effect-transistor","source_sha256":"5295f18951445c8f039daa74cad965365e10e5f587b90eff82f11d94c2e48d0a","start":114}],"target_id":"concept.wikipedia.fin-field-effect-transistor","target_kind":"node","target_sha256":"c00f47446c8b3ef909e5ace1e29670cb62682addc2161a22fd899172a9866f82"}],"concept.wikipedia.finite-model-theory":[{"id":"assertion.concept.wikipedia.finite-model-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Finite model theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Finite model theory\", CC BY-SA 4.0) states: Finite model theory is a subarea of model theory.","support":[{"end":155,"quote":"Finite model theory is a subarea of model theory.","source_id":"wikipedia.article.finite-model-theory","source_sha256":"4af28905c38d558c984ca94c14195b0c7f6b9887229c97bda2848d5f240e70ea","start":106}],"target_id":"concept.wikipedia.finite-model-theory","target_kind":"node","target_sha256":"dc7b5d2dd1d84881dc787412ee93f05180ac86696648edd0f9d37c1a262bace7"}],"concept.wikipedia.first-order-logic":[{"id":"assertion.concept.wikipedia.first-order-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"First-order logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"First-order logic\", CC BY-SA 4.0) states: In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","support":[{"end":293,"quote":"In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","source_id":"wikipedia.article.first-order-logic","source_sha256":"6cd37bb24403b0b1935c11a25fea1cc1dba8c4fbd629ba4825e319e2b3825d8a","start":102}],"target_id":"concept.wikipedia.first-order-logic","target_kind":"node","target_sha256":"811991d4ca56a92d6e4c204801da19f8008d5261e37af7c54dc5fa7646325db7"}],"concept.wikipedia.first-principle":[{"id":"assertion.concept.wikipedia.first-principle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"First principle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"First principle\", CC BY-SA 4.0) states: In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","support":[{"end":247,"quote":"In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","source_id":"wikipedia.article.first-principle","source_sha256":"5199af12a2666ba631ef571760b45f4672f0fb6f80cd94087c0f46261e130e11","start":101}],"target_id":"concept.wikipedia.first-principle","target_kind":"node","target_sha256":"4274675ac905372d6799567671ad2d09ceacafe89d34101dadc0b08a3376d1b9"}],"concept.wikipedia.fitch-notation":[{"id":"assertion.concept.wikipedia.fitch-notation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fitch notation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fitch notation\", CC BY-SA 4.0) states: Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","support":[{"end":379,"quote":"Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","source_id":"wikipedia.article.fitch-notation","source_sha256":"bd3ce4349105c21bdf7f15fc0fe67a4f7eb323b76f1eb8f0a718de86365e80ee","start":101}],"target_id":"concept.wikipedia.fitch-notation","target_kind":"node","target_sha256":"4c4400fed9022fe6907341c06cdac43da55b5084796b277c9ea7e4a61f40bc90"}],"concept.wikipedia.flat-chain":[{"id":"assertion.concept.wikipedia.flat-chain","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flat chain as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flat chain\", CC BY-SA 4.0) states: Flat chain is a form of chain used chiefly in agricultural machinery.","support":[{"end":165,"quote":"Flat chain is a form of chain used chiefly in agricultural machinery.","source_id":"wikipedia.article.flat-chain","source_sha256":"82347ab864988568b503a048ecf324345c30f58dc63b84480b43c7e5ae2f6733","start":96}],"target_id":"concept.wikipedia.flat-chain","target_kind":"node","target_sha256":"ef0af4d917ddf10d1964d7be96de15810fe2022ad7ff363fb83dee3a87b0ada4"}],"concept.wikipedia.flexible-shaft":[{"id":"assertion.concept.wikipedia.flexible-shaft","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flexible shaft as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flexible shaft\", CC BY-SA 4.0) states: A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","support":[{"end":261,"quote":"A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","source_id":"wikipedia.article.flexible-shaft","source_sha256":"2031f1c7404dd6e6495622c9f4c6dcbc009aef797306b65fc9bf30eec5990df7","start":101}],"target_id":"concept.wikipedia.flexible-shaft","target_kind":"node","target_sha256":"9253a1587d29cce7f70642155ea656461a71ae9ebc29bd226e87b005c89bb4ea"}],"concept.wikipedia.flexure-bearing":[{"id":"assertion.concept.wikipedia.flexure-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flexure bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flexure bearing\", CC BY-SA 4.0) states: A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","support":[{"end":222,"quote":"A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","source_id":"wikipedia.article.flexure-bearing","source_sha256":"804931c45db537a7e54bf5149c5519d9be541c53f71ad14bcfc54de1310c6841","start":101}],"target_id":"concept.wikipedia.flexure-bearing","target_kind":"node","target_sha256":"7e8721df5f1cb634e4bcfcfe9c142421f41963a223eca771a4dfff97cadb4baa"}],"concept.wikipedia.floquet-theory":[{"id":"assertion.concept.wikipedia.floquet-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Floquet theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Floquet theory\", CC BY-SA 4.0) states: Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","support":[{"end":325,"quote":"Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","source_id":"wikipedia.article.floquet-theory","source_sha256":"cc38de1afcb09f384f70ada213fbf6c7ea07782007e9a7fa6b9437dd3b278a07","start":101}],"target_id":"concept.wikipedia.floquet-theory","target_kind":"node","target_sha256":"5f5fa1a4950901819fcf5cef3bc7f7f7b35119db72f3dc2729d6cbae8607d7cc"}],"concept.wikipedia.flowability":[{"id":"assertion.concept.wikipedia.flowability","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flowability as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flowability\", CC BY-SA 4.0) states: Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","support":[{"end":229,"quote":"Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","source_id":"wikipedia.article.flowability","source_sha256":"1ea0689d8dec2b5758b8001f6684ccf6ad09610851f32b363912921edafa12f1","start":99}],"target_id":"concept.wikipedia.flowability","target_kind":"node","target_sha256":"5cc7c67c300ea43e550b56903a37d22653f6a16090bf5027cd454b6fbddc9038"}],"concept.wikipedia.flue-gas-condensation":[{"id":"assertion.concept.wikipedia.flue-gas-condensation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Flue-gas condensation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Flue-gas condensation\", CC BY-SA 4.0) states: Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","support":[{"end":306,"quote":"Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","source_id":"wikipedia.article.flue-gas-condensation","source_sha256":"1d55d2d3513c1d3d4fed49e9cf2dfb8add08d627f5c90afed266c9c92f0475ab","start":109}],"target_id":"concept.wikipedia.flue-gas-condensation","target_kind":"node","target_sha256":"32e8a5c3671609c8ad687c1eb6ad419f8b3e31cfbe4549932ac455035e91dc13"}],"concept.wikipedia.fluid-bearing":[{"id":"assertion.concept.wikipedia.fluid-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fluid bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fluid bearing\", CC BY-SA 4.0) states: Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","support":[{"end":247,"quote":"Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","source_id":"wikipedia.article.fluid-bearing","source_sha256":"925b2bba97f25ba8b21da6a1c3f3a6c0fca7e85439a6a6e653129667713e6a97","start":99}],"target_id":"concept.wikipedia.fluid-bearing","target_kind":"node","target_sha256":"5e8c703849d37c00582b23eba364697022e3a8ecefc6ae8ae181e7df7c8ff71d"}],"concept.wikipedia.fluid-coupling":[{"id":"assertion.concept.wikipedia.fluid-coupling","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fluid coupling as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fluid coupling\", CC BY-SA 4.0) states: A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","support":[{"end":226,"quote":"A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","source_id":"wikipedia.article.fluid-coupling","source_sha256":"089206caa95db54499ddb4cc50f7940673077175944b0e3b978b93ad0d7c86e9","start":101}],"target_id":"concept.wikipedia.fluid-coupling","target_kind":"node","target_sha256":"8bdeec183e52c3c199825271dcdd431814308a92f031054900d682eed025fefd"}],"concept.wikipedia.foil-bearing":[{"id":"assertion.concept.wikipedia.foil-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Foil bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Foil bearing\", CC BY-SA 4.0) states: A foil bearing, also known as a foil-air bearing, is a type of air bearing.","support":[{"end":173,"quote":"A foil bearing, also known as a foil-air bearing, is a type of air bearing.","source_id":"wikipedia.article.foil-bearing","source_sha256":"8ed8e246a75ad36646c06ed0e3f5ea8500101c154b356a56a11bedf1fa7b748b","start":98}],"target_id":"concept.wikipedia.foil-bearing","target_kind":"node","target_sha256":"4271be9306ff32b5ea108bc3366c921f463edd9a9c39491ccfe06629524a03f0"}],"concept.wikipedia.forbidden-knowledge":[{"id":"assertion.concept.wikipedia.forbidden-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Forbidden knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Forbidden knowledge\", CC BY-SA 4.0) states: Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","support":[{"end":262,"quote":"Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","source_id":"wikipedia.article.forbidden-knowledge","source_sha256":"ea0d6c44eba7d3978007f4e850fa369cf945345381e243f120c5f2ada9f96618","start":105}],"target_id":"concept.wikipedia.forbidden-knowledge","target_kind":"node","target_sha256":"14a7c0cf7751d1da2f11134d22b96e667c4b724d004ce4227331263107c7a0fb"}],"concept.wikipedia.force-matching":[{"id":"assertion.concept.wikipedia.force-matching","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Force matching as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Force matching\", CC BY-SA 4.0) states: Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","support":[{"end":259,"quote":"Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","source_id":"wikipedia.article.force-matching","source_sha256":"bef92e8e16477659cb6376116f3a8d1f342119b3b67263ff3c63e83e37867d81","start":102}],"target_id":"concept.wikipedia.force-matching","target_kind":"node","target_sha256":"06550c41d9c9210019057d4cc23f18caf426826225af4eb85ec8dc7eaa9a678f"}],"concept.wikipedia.formal-concept-analysis":[{"id":"assertion.concept.wikipedia.formal-concept-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Formal concept analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Formal concept analysis\", CC BY-SA 4.0) states: In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","support":[{"end":284,"quote":"In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","source_id":"wikipedia.article.formal-concept-analysis","source_sha256":"ad34ce9eae9aeea70c0ffbe6d7eb22cd021f97bd553c4d06d0287fc54292cc62","start":109}],"target_id":"concept.wikipedia.formal-concept-analysis","target_kind":"node","target_sha256":"d55a649b8d99428b292eae4ac665b5850c1816796590f60f9fbd34cd9b2a29a9"}],"concept.wikipedia.formal-fallacy":[{"id":"assertion.concept.wikipedia.formal-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Formal fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Formal fallacy\", CC BY-SA 4.0) states: In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","support":[{"end":273,"quote":"In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","source_id":"wikipedia.article.formal-fallacy","source_sha256":"f4d3ec97f9808ae23ba08e3e2de359bd946fac342f987841e0ed56e11896445e","start":101}],"target_id":"concept.wikipedia.formal-fallacy","target_kind":"node","target_sha256":"d9af9b1d1269c1cf7a491c12f29c1c21042743c53f2272092ab3cb2e902f2508"}],"concept.wikipedia.fort-space":[{"id":"assertion.concept.wikipedia.fort-space","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fort space as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fort space\", CC BY-SA 4.0) states: In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","support":[{"end":176,"quote":"In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","source_id":"wikipedia.article.fort-space","source_sha256":"66d01e5c2914d6a5444e5517a7acfe1a18fe620377e2e2d8ec20c4e0dac6afac","start":98}],"target_id":"concept.wikipedia.fort-space","target_kind":"node","target_sha256":"41a0f28a96d3834583c1e040b3b45f1e9716338cd49422eaf28ee202e5b0852d"}],"concept.wikipedia.four-slide":[{"id":"assertion.concept.wikipedia.four-slide","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Four-slide as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Four-slide\", CC BY-SA 4.0) states: A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","support":[{"end":284,"quote":"A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","source_id":"wikipedia.article.four-slide","source_sha256":"b1109dd214b733bc5ef3096adc1c51709898cbf6488ba07b59e505d293997e7f","start":98}],"target_id":"concept.wikipedia.four-slide","target_kind":"node","target_sha256":"e0fbbdacc87c0e767dd1671ba1791561fbe1e4807cc43d0ba50001fdc7061986"}],"concept.wikipedia.fr-chet-manifold":[{"id":"assertion.concept.wikipedia.fr-chet-manifold","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fréchet manifold as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fréchet manifold\", CC BY-SA 4.0) states: In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","support":[{"end":292,"quote":"In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","source_id":"wikipedia.article.fr-chet-manifold","source_sha256":"110c28ba8b668968d798961a96017b1b482b637c291efe09040ebf7162103d37","start":103}],"target_id":"concept.wikipedia.fr-chet-manifold","target_kind":"node","target_sha256":"7ff385cfddc68a547fb1210edbeb0e9a2113466a394986ad114704102449cc68"}],"concept.wikipedia.frankfurt-cases":[{"id":"assertion.concept.wikipedia.frankfurt-cases","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Frankfurt cases as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Frankfurt cases\", CC BY-SA 4.0) states: Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","support":[{"end":418,"quote":"Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","source_id":"wikipedia.article.frankfurt-cases","source_sha256":"0a27a91f53bb8b46062aba6c9c1155a486298765caa639ccaf8efdafdcd4e711","start":102}],"target_id":"concept.wikipedia.frankfurt-cases","target_kind":"node","target_sha256":"d1c47ba90e9cf71f106a10ed098314d713b743efa8a1a61559a28542d04f59ea"}],"concept.wikipedia.free-choice-inference":[{"id":"assertion.concept.wikipedia.free-choice-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Free choice inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Free choice inference\", CC BY-SA 4.0) states: Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","support":[{"end":284,"quote":"Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","source_id":"wikipedia.article.free-choice-inference","source_sha256":"0581b43b30935370bde462bd5b67ff3d9db950f6bdb0c926c4338eebd2481399","start":109}],"target_id":"concept.wikipedia.free-choice-inference","target_kind":"node","target_sha256":"3fa7f1c7e60b242204d99772beb5643f7fc31b41365aa59b8a1fb0713232272b"}],"concept.wikipedia.free-lattice":[{"id":"assertion.concept.wikipedia.free-lattice","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Free lattice as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Free lattice\", CC BY-SA 4.0) states: In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","support":[{"end":206,"quote":"In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","source_id":"wikipedia.article.free-lattice","source_sha256":"0a1390a252b990dbd88bcf2180d9e4c9737929135fe9aa2973c31a6f0d89663b","start":100}],"target_id":"concept.wikipedia.free-lattice","target_kind":"node","target_sha256":"dfcc566897b844a09ce26930345385b6d6819af03f4715f15a768c81067597d9"}],"concept.wikipedia.freivalds-algorithm":[{"id":"assertion.concept.wikipedia.freivalds-algorithm","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Freivalds' algorithm as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Freivalds' algorithm\", CC BY-SA 4.0) states: Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","support":[{"end":244,"quote":"Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","source_id":"wikipedia.article.freivalds-algorithm","source_sha256":"d6c747a1351e3ef23570bf8ecbbcdafc26ed2038a064426cf8226d13e2d53540","start":107}],"target_id":"concept.wikipedia.freivalds-algorithm","target_kind":"node","target_sha256":"85e5b635a176f2dea7ce4b04580a2bb0cec6230edeb7497ffcfe7df9dcd808f4"}],"concept.wikipedia.fretting":[{"id":"assertion.concept.wikipedia.fretting","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fretting as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fretting\", CC BY-SA 4.0) states: Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","support":[{"end":248,"quote":"Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","source_id":"wikipedia.article.fretting","source_sha256":"016dccd3390a5ef9bcb65948bd0c5adcdd2d2ce8f892bd20025a769df05de970","start":95}],"target_id":"concept.wikipedia.fretting","target_kind":"node","target_sha256":"0450685ba40d478b498b421fe87d8e5a13859094303b4f66ec2ece9e7fa22b07"}],"concept.wikipedia.friction":[{"id":"assertion.concept.wikipedia.friction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Friction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Friction\", CC BY-SA 4.0) states: Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","support":[{"end":239,"quote":"Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","source_id":"wikipedia.article.friction","source_sha256":"c57314f98cab70c04101ccd81303163d794dac27da96bcc77ed461b210169563","start":93}],"target_id":"concept.wikipedia.friction","target_kind":"node","target_sha256":"954304c58f374486abed6c8ab5aa9e8f7b0692c7926cea9bebd781ef535003ce"}],"concept.wikipedia.fringe-science":[{"id":"assertion.concept.wikipedia.fringe-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fringe science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fringe science\", CC BY-SA 4.0) states: Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","support":[{"end":220,"quote":"Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","source_id":"wikipedia.article.fringe-science","source_sha256":"0bc624921861cb73bb73cd63ef7f311b4c057c13d585a5129456e546996a9788","start":100}],"target_id":"concept.wikipedia.fringe-science","target_kind":"node","target_sha256":"6bfab7022c15994a8ebe560c9b8acb5e1a88708ef06f42785f9ac2d9491af4bc"}],"concept.wikipedia.fudge-factor":[{"id":"assertion.concept.wikipedia.fudge-factor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fudge factor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fudge factor\", CC BY-SA 4.0) states: A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","support":[{"end":248,"quote":"A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","source_id":"wikipedia.article.fudge-factor","source_sha256":"d0c2321c0eb6fffad42d76d52b87b3b046937a665f9c61bcc145d7feb2214e07","start":99}],"target_id":"concept.wikipedia.fudge-factor","target_kind":"node","target_sha256":"557df0735b3aaea11214c05d97eed4634c1f324bde266e443b74f66fa64dc7fd"}],"concept.wikipedia.functional-fixedness":[{"id":"assertion.concept.wikipedia.functional-fixedness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Functional fixedness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Functional fixedness\", CC BY-SA 4.0) states: Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","support":[{"end":227,"quote":"Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","source_id":"wikipedia.article.functional-fixedness","source_sha256":"2320f57f52f7f2470912bb4cc1bcf869a364fe52677f66797242a70b5f4310ed","start":107}],"target_id":"concept.wikipedia.functional-fixedness","target_kind":"node","target_sha256":"86f26fd3e8aa294f6abfc8eaa04be2a2e5fef1f55ebe58fb4849100bea0c119d"}],"concept.wikipedia.furstenberg-boundary":[{"id":"assertion.concept.wikipedia.furstenberg-boundary","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Furstenberg boundary as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Furstenberg boundary\", CC BY-SA 4.0) states: In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","support":[{"end":252,"quote":"In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","source_id":"wikipedia.article.furstenberg-boundary","source_sha256":"14f2c409bada995bb384b0c46aeb6e245efdb9b51cc46f360a1eb8d5940af1a0","start":108}],"target_id":"concept.wikipedia.furstenberg-boundary","target_kind":"node","target_sha256":"4207ccd40ec351bef77d613e314a93cd9a2f7978aba4db690ea3d13adbd5ef8a"}],"concept.wikipedia.further-research-is-needed":[{"id":"assertion.concept.wikipedia.further-research-is-needed","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Further research is needed as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Further research is needed\", CC BY-SA 4.0) states: \"Further research is needed\" (FRIN), \"more research is needed\" and other variants of similar phrases are commonly used in research papers.","support":[{"end":256,"quote":"\\\"Further research is needed\\\" (FRIN), \\\"more research is needed\\\" and other variants of similar phrases are commonly used in research papers.","source_id":"wikipedia.article.further-research-is-needed","source_sha256":"c1582f6aa072548129dd05fca70508f7308954df469b596e5893d6dbb7658d40","start":114}],"target_id":"concept.wikipedia.further-research-is-needed","target_kind":"node","target_sha256":"a4f63b15877f9bec6bcd04eae2225757d74131ec7737951d76847d4299c6e1ed"}],"concept.wikipedia.game-semantics":[{"id":"assertion.concept.wikipedia.game-semantics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Game semantics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Game semantics\", CC BY-SA 4.0) states: Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","support":[{"end":282,"quote":"Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","source_id":"wikipedia.article.game-semantics","source_sha256":"7ff8c7ec45ecf4aec35d8ba1ab18cbf8f3094c23a588259bd6d31eb228d2ebd1","start":100}],"target_id":"concept.wikipedia.game-semantics","target_kind":"node","target_sha256":"8e5cf79e0f8386cb7f8a5eb79e1ef6a730b8272680bd600b961f86aa14b35214"}],"concept.wikipedia.gate-oxide":[{"id":"assertion.concept.wikipedia.gate-oxide","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gate oxide as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gate oxide\", CC BY-SA 4.0) states: The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","support":[{"end":379,"quote":"The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","source_id":"wikipedia.article.gate-oxide","source_sha256":"5cde5d2b887131f2ca39ad2c7f1e35954f7066c1450b7115f964c014b4996229","start":98}],"target_id":"concept.wikipedia.gate-oxide","target_kind":"node","target_sha256":"8ea9d86cceb9c4009943131b10ecff0f395735f355567d52fbaab6390e79ebe6"}],"concept.wikipedia.gear":[{"id":"assertion.concept.wikipedia.gear","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear\", CC BY-SA 4.0) states: A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \"teeth\" that engage with compatible teeth of another gear or other part.","support":[{"end":327,"quote":"A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \\\"teeth\\\"  that engage with compatible teeth of another gear or other part.","source_id":"wikipedia.article.gear","source_sha256":"6043b16ad62bcd86898cfcf743b9621c0fdfc84c36a614d5ff69ebea3cbb606d","start":89}],"target_id":"concept.wikipedia.gear","target_kind":"node","target_sha256":"1b20519eb8ee4a2b2b3adefd8a772c297b05448b4887c4e9621972da2ec09bc3"}],"concept.wikipedia.gear-failure":[{"id":"assertion.concept.wikipedia.gear-failure","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear failure as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear failure\", CC BY-SA 4.0) states: Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","support":[{"end":213,"quote":"Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","source_id":"wikipedia.article.gear-failure","source_sha256":"68043f2b7b31c38e9a03665488f75ec8f315fc746f296aca7204331eb971cf91","start":100}],"target_id":"concept.wikipedia.gear-failure","target_kind":"node","target_sha256":"4209f4460142a24729e78246621483e1f670822a1a90a24719d81128445132ac"}],"concept.wikipedia.gear-oil":[{"id":"assertion.concept.wikipedia.gear-oil","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gear oil as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gear oil\", CC BY-SA 4.0) states: Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","support":[{"end":234,"quote":"Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","source_id":"wikipedia.article.gear-oil","source_sha256":"691f32809b3dc21a57ce58333f8332a7ac167cb6353d16a72f0af9fa0c342381","start":95}],"target_id":"concept.wikipedia.gear-oil","target_kind":"node","target_sha256":"cad304c4d6e8e0d0e9ada4f4c3e17730ab2efc53700803168b4fd132e92824ab"}],"concept.wikipedia.gelfand-pair":[{"id":"assertion.concept.wikipedia.gelfand-pair","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gelfand pair as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gelfand pair\", CC BY-SA 4.0) states: In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","support":[{"end":285,"quote":"In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","source_id":"wikipedia.article.gelfand-pair","source_sha256":"6ce9c15ba7a11cd00c4919cace2c2886426749dbc1567d11ab8a3c3fa7e4a9f9","start":99}],"target_id":"concept.wikipedia.gelfand-pair","target_kind":"node","target_sha256":"0ac1a54e7e90b97d6333d858f0ac95fa3ced82be90e34958ec8f3c334120b83b"}],"concept.wikipedia.gender-of-connectors-and-fasteners":[{"id":"assertion.concept.wikipedia.gender-of-connectors-and-fasteners","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gender of connectors and fasteners as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gender of connectors and fasteners\", CC BY-SA 4.0) states: In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","support":[{"end":318,"quote":"In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","source_id":"wikipedia.article.gender-of-connectors-and-fasteners","source_sha256":"7513d481f5a8f31e3095cf12afb756afcd861402944e260d47ff851c051dfc53","start":121}],"target_id":"concept.wikipedia.gender-of-connectors-and-fasteners","target_kind":"node","target_sha256":"6defb8e27a66f72d6791ba958e9694d89e59fb149cae401497c75543083c3fed"}],"concept.wikipedia.general-knowledge":[{"id":"assertion.concept.wikipedia.general-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"General knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"General knowledge\", CC BY-SA 4.0) states: General knowledge is information that has been accumulated over time through various media and sources.","support":[{"end":207,"quote":"General knowledge is information that has been accumulated over time through various media and sources.","source_id":"wikipedia.article.general-knowledge","source_sha256":"33c258e9325a0d1194263570f19907f0cbad28e3d544ca7e1fa511fdd90e577a","start":104}],"target_id":"concept.wikipedia.general-knowledge","target_kind":"node","target_sha256":"2ab11489b82f2ead4436155792b093de6bc66db4160fcfc70381d9dd1c2d5e58"}],"concept.wikipedia.generality-psychology":[{"id":"assertion.concept.wikipedia.generality-psychology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Generality (psychology) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Generality (psychology)\", CC BY-SA 4.0) states: In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","support":[{"end":340,"quote":"In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","source_id":"wikipedia.article.generality-psychology","source_sha256":"ec749169314a9aa39a0b49a93f7aaa3a8124757caf2d8bf2bceff64381281a4e","start":110}],"target_id":"concept.wikipedia.generality-psychology","target_kind":"node","target_sha256":"9cadbc81385e739937f01cd6c953538a1296cf21505904f95da5f395b13cfcb1"}],"concept.wikipedia.generalization":[{"id":"assertion.concept.wikipedia.generalization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Generalization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Generalization\", CC BY-SA 4.0) states: A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","support":[{"end":234,"quote":"A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","source_id":"wikipedia.article.generalization","source_sha256":"e1f8dcc48c390a0beb2b9a90643152d294e1238361fae20f7547e4b8211ad605","start":99}],"target_id":"concept.wikipedia.generalization","target_kind":"node","target_sha256":"558ca6973bf8da88ddb7138a46c26a846e75d77e3a744bec3e7c3223c2236bdc"}],"concept.wikipedia.geological-structure-measurement-by-lidar":[{"id":"assertion.concept.wikipedia.geological-structure-measurement-by-lidar","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geological structure measurement by LiDAR as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geological structure measurement by LiDAR\", CC BY-SA 4.0) states: Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","support":[{"end":239,"quote":"Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","source_id":"wikipedia.article.geological-structure-measurement-by-lidar","source_sha256":"4b912bc3687a8ed00a60fde467eea4cee55fd67bfed72face1794724c9221cdf","start":129}],"target_id":"concept.wikipedia.geological-structure-measurement-by-lidar","target_kind":"node","target_sha256":"8dfb9118b39f2bf3418961f86f15218cc921ccaf70d39631eba77bea92e47246"}],"concept.wikipedia.geometric-progression":[{"id":"assertion.concept.wikipedia.geometric-progression","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric progression as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric progression\", CC BY-SA 4.0) states: A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","support":[{"end":332,"quote":"A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","source_id":"wikipedia.article.geometric-progression","source_sha256":"86ae99fd392beb8c807f6d53786855b97aec25e388552cc3770926f06e18721e","start":109}],"target_id":"concept.wikipedia.geometric-progression","target_kind":"node","target_sha256":"a7727dd60136d751e2be2339be8207ac666955d6452a9b8ac91cd49a62292460"}],"concept.wikipedia.geometric-topology-object":[{"id":"assertion.concept.wikipedia.geometric-topology-object","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric topology (object) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric topology (object)\", CC BY-SA 4.0) states: In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","support":[{"end":235,"quote":"In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","source_id":"wikipedia.article.geometric-topology-object","source_sha256":"6b66bf4867e0b15d9906a0b3061545ff3a3a3ff5213b018bdc411bb9bf9b2f76","start":114}],"target_id":"concept.wikipedia.geometric-topology-object","target_kind":"node","target_sha256":"9befb77cd54ca4858a4be8e471befd74a94253a76991f5d03fd1e2a8733cc982"}],"concept.wikipedia.geometry-of-interaction":[{"id":"assertion.concept.wikipedia.geometry-of-interaction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometry of interaction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometry of interaction\", CC BY-SA 4.0) states: In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","support":[{"end":235,"quote":"In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","source_id":"wikipedia.article.geometry-of-interaction","source_sha256":"9fa1b5deb4f29ac71300405154470f6ede4193f0153fbf6d1a4ece89b935f718","start":110}],"target_id":"concept.wikipedia.geometry-of-interaction","target_kind":"node","target_sha256":"20e73dae8f62cbd2cf9cfd1af37f9ce14571fd4719e71f8c0720efac8294521b"}],"concept.wikipedia.gestell":[{"id":"assertion.concept.wikipedia.gestell","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gestell as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gestell\", CC BY-SA 4.0) states: Gestell (or Ge-stell, translated as \"Enframing\" or \"positioning\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","support":[{"end":301,"quote":"Gestell (or Ge-stell, translated as \\\"Enframing\\\" or \\\"positioning\\\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","source_id":"wikipedia.article.gestell","source_sha256":"666744373fc2e4cad09d05dcd4299ddb697db95b18ae1d2849a233514541fe40","start":94}],"target_id":"concept.wikipedia.gestell","target_kind":"node","target_sha256":"6a82177f7cb541c8b51c1cf1697208df1e5e913f5e9f4055b6c49cf7a054a1ae"}],"concept.wikipedia.ggnmos":[{"id":"assertion.concept.wikipedia.ggnmos","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"GgNMOS as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"GgNMOS\", CC BY-SA 4.0) states: Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","support":[{"end":236,"quote":"Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","source_id":"wikipedia.article.ggnmos","source_sha256":"e47662671eb90d35df712488f1e4d39ec538229627d02be98c9e73933ae11eff","start":93}],"target_id":"concept.wikipedia.ggnmos","target_kind":"node","target_sha256":"24288489e010014c2522ec3738472eaa0d22f08692f5678147eb77c480ffcc9d"}],"concept.wikipedia.graph-coloring":[{"id":"assertion.concept.wikipedia.graph-coloring","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Graph coloring as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Graph coloring\", CC BY-SA 4.0) states: In graph theory, graph coloring is a methodic assignment of labels traditionally called \"colors\" to elements of a graph.","support":[{"end":222,"quote":"In graph theory, graph coloring is a methodic assignment of labels traditionally called \\\"colors\\\" to elements of a graph.","source_id":"wikipedia.article.graph-coloring","source_sha256":"a47924373604ae8d49dad58c9bc1173eeb61cad4d60ec802819b448f02f91fb1","start":100}],"target_id":"concept.wikipedia.graph-coloring","target_kind":"node","target_sha256":"30b1290ac4c5b2740742f69310b5a0bef6dc408dcab1baaf84cf544f2e86db30"}],"concept.wikipedia.graphism-thesis":[{"id":"assertion.concept.wikipedia.graphism-thesis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Graphism thesis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Graphism thesis\", CC BY-SA 4.0) states: In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","support":[{"end":375,"quote":"In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","source_id":"wikipedia.article.graphism-thesis","source_sha256":"a62b99c3771c3d08c7b8607c250119549daf37dcd31a2435e8d77e413e98d2a0","start":103}],"target_id":"concept.wikipedia.graphism-thesis","target_kind":"node","target_sha256":"fbd3bf424f6e5e66673610c261b42e9f3e04e26d77242227b878c28c411ed4cc"}],"concept.wikipedia.ground-truth":[{"id":"assertion.concept.wikipedia.ground-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ground truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ground truth\", CC BY-SA 4.0) states: Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","support":[{"end":281,"quote":"Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","source_id":"wikipedia.article.ground-truth","source_sha256":"3b3c0818e9574ee0abaed4ef9e2b8f43cc7a1559618a2130f36906931cc1a72b","start":98}],"target_id":"concept.wikipedia.ground-truth","target_kind":"node","target_sha256":"28da23a706a4c87c4c0870b4aa3d8f290c490858024a1836ff4a9bd51945aaa8"}],"concept.wikipedia.group-algebra-of-a-locally-compact-group":[{"id":"assertion.concept.wikipedia.group-algebra-of-a-locally-compact-group","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Group algebra of a locally compact group as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Group algebra of a locally compact group\", CC BY-SA 4.0) states: In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","support":[{"end":414,"quote":"In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group  an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","source_id":"wikipedia.article.group-algebra-of-a-locally-compact-group","source_sha256":"f9a9326b390afcbab8f7a4aa7491ea7cb4a8491dbf05ccba426d12440dd795c7","start":126}],"target_id":"concept.wikipedia.group-algebra-of-a-locally-compact-group","target_kind":"node","target_sha256":"abf65e4c012c839a0f0b3c2a4fbc8d3c395279e6dc10d6d43442610dd9a4800a"}],"concept.wikipedia.group-mathematics":[{"id":"assertion.concept.wikipedia.group-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Group (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Group (mathematics)\", CC BY-SA 4.0) states: In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","support":[{"end":244,"quote":"In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","source_id":"wikipedia.article.group-mathematics","source_sha256":"eefaf5e31abf300469a1a051ddfd759b763658d7b86de7acfd39d16aa2a005bd","start":104}],"target_id":"concept.wikipedia.group-mathematics","target_kind":"node","target_sha256":"0f2a677dee647be9113201f5cd91cfa0450dd8ab88dd0c091f1e81ea58376e5a"}],"concept.wikipedia.gunslinger-effect":[{"id":"assertion.concept.wikipedia.gunslinger-effect","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gunslinger effect as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gunslinger effect\", CC BY-SA 4.0) states: The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","support":[{"end":316,"quote":"The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","source_id":"wikipedia.article.gunslinger-effect","source_sha256":"cfff405457fd4efd9d06dc4303208405e9a2f934e72d65d31459be7f65d9abc9","start":105}],"target_id":"concept.wikipedia.gunslinger-effect","target_kind":"node","target_sha256":"2f2fe6e7ae5491950c442172dbfd0d499d3c6dbcba31abcdec8a7fddaa9bd34a"}],"concept.wikipedia.hadamard-product-matrices":[{"id":"assertion.concept.wikipedia.hadamard-product-matrices","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hadamard product (matrices) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hadamard product (matrices)\", CC BY-SA 4.0) states: In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","support":[{"end":363,"quote":"In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","source_id":"wikipedia.article.hadamard-product-matrices","source_sha256":"204ce7b2d897ccafafe3adcae9c28b650b3be98ac3b3d40799272bb0fdda268a","start":115}],"target_id":"concept.wikipedia.hadamard-product-matrices","target_kind":"node","target_sha256":"0efc0eabc6eac67ff49c7f8174dc13531099438478c60a995ba0a6acad981700"}],"concept.wikipedia.half-truth":[{"id":"assertion.concept.wikipedia.half-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Half-truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Half-truth\", CC BY-SA 4.0) states: A half-truth is a deceptive statement that includes some element of truth.","support":[{"end":171,"quote":"A half-truth is a deceptive statement that includes some element of truth.","source_id":"wikipedia.article.half-truth","source_sha256":"650274c562a04b448754ad6823feb4652ee3402ea770b34affcf38ab7b971493","start":97}],"target_id":"concept.wikipedia.half-truth","target_kind":"node","target_sha256":"f75b62ee5b8e1962b55655f82340976743ebf16d8fc0f56399aad3f1f4fe2e53"}],"concept.wikipedia.halton-sequence":[{"id":"assertion.concept.wikipedia.halton-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Halton sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Halton sequence\", CC BY-SA 4.0) states: In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","support":[{"end":235,"quote":"In statistics, Halton sequences are  sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","source_id":"wikipedia.article.halton-sequence","source_sha256":"67d337e087cdc74c1bef695934a03c2f1b789b2e1ca9720aa6a62ffa525aac80","start":101}],"target_id":"concept.wikipedia.halton-sequence","target_kind":"node","target_sha256":"298495e2173ba37ce125fd0841605453cf2d7ac62a7e9a2b96895dbac673a6fd"}],"concept.wikipedia.harking":[{"id":"assertion.concept.wikipedia.harking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"HARKing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"HARKing\", CC BY-SA 4.0) states: HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\".","support":[{"end":372,"quote":"HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \\\"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\\\".","source_id":"wikipedia.article.harking","source_sha256":"c849ef208ec43aff5396b73a974b4ea8b62794800f63db04636c64dcc1f07071","start":95}],"target_id":"concept.wikipedia.harking","target_kind":"node","target_sha256":"03eaab86fadc071999697117f64c40d476dbb292e6584467e76aedeab0b69893"}],"concept.wikipedia.harmonic-progression-mathematics":[{"id":"assertion.concept.wikipedia.harmonic-progression-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic progression (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic progression (mathematics)\", CC BY-SA 4.0) states: In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","support":[{"end":310,"quote":"In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","source_id":"wikipedia.article.harmonic-progression-mathematics","source_sha256":"9f0514fea419f200aca40e33c11cad9034cf434c1312211aab87abb01c1e7c87","start":122}],"target_id":"concept.wikipedia.harmonic-progression-mathematics","target_kind":"node","target_sha256":"1df1d016c89394429f512057091292507c8c55f6223692101e01d4ba6377daa9"}],"concept.wikipedia.harmonic-tensors":[{"id":"assertion.concept.wikipedia.harmonic-tensors","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic tensors as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic tensors\", CC BY-SA 4.0) states: In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","support":[{"end":276,"quote":"In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","source_id":"wikipedia.article.harmonic-tensors","source_sha256":"f11cd1e8368474cba7f9e1c9412db11ed1ccaf0cfca3578ac1fbfda2179375a1","start":104}],"target_id":"concept.wikipedia.harmonic-tensors","target_kind":"node","target_sha256":"c73626b84a03de250cac03b8c09a25fe4cbdaf385065679d3065485bc00fd98d"}],"concept.wikipedia.heat-exchanger":[{"id":"assertion.concept.wikipedia.heat-exchanger","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heat exchanger as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heat exchanger\", CC BY-SA 4.0) states: A heat exchanger is a system used to transfer heat between a source and a working fluid.","support":[{"end":188,"quote":"A heat exchanger is a system used to transfer heat between a source and a working fluid.","source_id":"wikipedia.article.heat-exchanger","source_sha256":"1e03284fbd5f3648047b158df5f509cb82e3496bb12a84a0801076f697ad828e","start":100}],"target_id":"concept.wikipedia.heat-exchanger","target_kind":"node","target_sha256":"e11e3368513963ef6114c9d8e1d139d47194fe4423fed9af5f5a7e73e22e8a78"}],"concept.wikipedia.heat-sink":[{"id":"assertion.concept.wikipedia.heat-sink","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heat sink as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heat sink\", CC BY-SA 4.0) states: A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","support":[{"end":393,"quote":"A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","source_id":"wikipedia.article.heat-sink","source_sha256":"d4920f5d93d401f82f33e17b7da31937c53298e4d4dbb02c4be9f25cf63e24e5","start":95}],"target_id":"concept.wikipedia.heat-sink","target_kind":"node","target_sha256":"828593825e444ce5551fb36faac7493dfe9ae43ee38400c59d310d1e115a7bfa"}],"concept.wikipedia.heater-core":[{"id":"assertion.concept.wikipedia.heater-core","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Heater core as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Heater core\", CC BY-SA 4.0) states: A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","support":[{"end":275,"quote":"A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","source_id":"wikipedia.article.heater-core","source_sha256":"e838a7bbf649b001cca694b6acf34c0076a0b14f2e9d394e8ebb61b1b20075b9","start":98}],"target_id":"concept.wikipedia.heater-core","target_kind":"node","target_sha256":"ac6365e48e886bb900e848df61b6847650bc82e156094f1f38eb30e9c25ab5d0"}],"concept.wikipedia.helix-angle":[{"id":"assertion.concept.wikipedia.helix-angle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Helix angle as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Helix angle\", CC BY-SA 4.0) states: In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","support":[{"end":229,"quote":"In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","source_id":"wikipedia.article.helix-angle","source_sha256":"47e487958ff8afa76281166392584d6288208fec8387fdb86ad94f396be8199c","start":99}],"target_id":"concept.wikipedia.helix-angle","target_kind":"node","target_sha256":"41911c5d02ad54335b3bcb2bb45304e73a189ec4a80936a54c2cd0fe74d60a0f"}],"concept.wikipedia.high-tensile-chain":[{"id":"assertion.concept.wikipedia.high-tensile-chain","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"High-tensile chain as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"High-tensile chain\", CC BY-SA 4.0) states: A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength used for drawing or securing loads.","support":[{"end":248,"quote":"A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength  used for drawing or securing loads.","source_id":"wikipedia.article.high-tensile-chain","source_sha256":"156859a794bbae16a1d5c9e29ab3fc71d899bfa85edd2b68708ed902a3b7c75c","start":106}],"target_id":"concept.wikipedia.high-tensile-chain","target_kind":"node","target_sha256":"61a1d3a402194c39cf16dd24c44ce815192d0757b3f2ace990802b9922b9ab7b"}],"concept.wikipedia.hoist-device":[{"id":"assertion.concept.wikipedia.hoist-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hoist (device) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hoist (device)\", CC BY-SA 4.0) states: A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","support":[{"end":223,"quote":"A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","source_id":"wikipedia.article.hoist-device","source_sha256":"e7947eef440242bae216fd5be58e37839b8073a533d4ffb4a7cc6528678655c5","start":101}],"target_id":"concept.wikipedia.hoist-device","target_kind":"node","target_sha256":"ebeb502d3e4c0a0c781864bb9b49b2b0ac51d6f9ce149dae6effaabca8370070"}],"concept.wikipedia.hydraulic-cylinder":[{"id":"assertion.concept.wikipedia.hydraulic-cylinder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hydraulic cylinder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hydraulic cylinder\", CC BY-SA 4.0) states: A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","support":[{"end":296,"quote":"A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","source_id":"wikipedia.article.hydraulic-cylinder","source_sha256":"b11076e4a61c09b97abe24ba85a9d1d70cdd42d4a5a610fa4f5a53a4522e9abd","start":105}],"target_id":"concept.wikipedia.hydraulic-cylinder","target_kind":"node","target_sha256":"2e303849e440e1a8a3321fc45d0d165ddd3a9d643aedf13687251c958d5e76ac"}],"concept.wikipedia.imperfect-induction":[{"id":"assertion.concept.wikipedia.imperfect-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Imperfect induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Imperfect induction\", CC BY-SA 4.0) states: Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","support":[{"end":224,"quote":"Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","source_id":"wikipedia.article.imperfect-induction","source_sha256":"4fe007efa4dd28f3adffca4c23b3b49dc727e3b118fd45e6109ddc9c1590b9b7","start":106}],"target_id":"concept.wikipedia.imperfect-induction","target_kind":"node","target_sha256":"67bbdb669f7433e66dd59c3e8ee175f9f56f5b0a129281ab1a231b03916d7087"}],"concept.wikipedia.implicit-and-explicit-knowledge":[{"id":"assertion.concept.wikipedia.implicit-and-explicit-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Implicit and explicit knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Implicit and explicit knowledge\", CC BY-SA 4.0) states: Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","support":[{"end":256,"quote":"Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","source_id":"wikipedia.article.implicit-and-explicit-knowledge","source_sha256":"eccbf7d2300f098c3a8f75a6e4c0a71ebf8bc634443a85d9adb58cb8b25a203d","start":119}],"target_id":"concept.wikipedia.implicit-and-explicit-knowledge","target_kind":"node","target_sha256":"8c5bd976b6dd6158f26ddc999503e30ef381c45464214c09434951ea53a92375"}],"concept.wikipedia.inductionism":[{"id":"assertion.concept.wikipedia.inductionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inductionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inductionism\", CC BY-SA 4.0) states: Inductionism is the scientific philosophy where laws are \"induced\" from sets of data.","support":[{"end":186,"quote":"Inductionism is the scientific philosophy where laws are \\\"induced\\\" from sets of data.","source_id":"wikipedia.article.inductionism","source_sha256":"d8897010435ee2136ecc201c3bbe5a59ff2e28320c6b3ecf0ec9ec59d97c65cf","start":99}],"target_id":"concept.wikipedia.inductionism","target_kind":"node","target_sha256":"e708f21ff95a993749c880939433683ea20cc483116212b856658068fa49ba6f"}],"concept.wikipedia.inert-knowledge":[{"id":"assertion.concept.wikipedia.inert-knowledge","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inert knowledge as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inert knowledge\", CC BY-SA 4.0) states: Inert knowledge is information which one can express but not use.","support":[{"end":167,"quote":"Inert knowledge is information which one can express but not use.","source_id":"wikipedia.article.inert-knowledge","source_sha256":"7d000ce87c9c788336ccc920287ab576e2b1c8b616d87425b711d1479e774ec9","start":102}],"target_id":"concept.wikipedia.inert-knowledge","target_kind":"node","target_sha256":"38943ddd1f6d8b38ccebb14a685227987fa48b332d46c301246e04bf6e82a5b4"}],"concept.wikipedia.inference-engine":[{"id":"assertion.concept.wikipedia.inference-engine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inference engine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inference engine\", CC BY-SA 4.0) states: In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","support":[{"end":287,"quote":"In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","source_id":"wikipedia.article.inference-engine","source_sha256":"37fc86683bc270e3b2acb4bc5409708f55ebc982fccd5b6cb72d46a620280580","start":102}],"target_id":"concept.wikipedia.inference-engine","target_kind":"node","target_sha256":"73d6233b6c754512868396807e92d8f6826e5025fd81b92c52b3f8adbd76cc76"}],"concept.wikipedia.infinite-regress":[{"id":"assertion.concept.wikipedia.infinite-regress","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Infinite regress as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Infinite regress\", CC BY-SA 4.0) states: Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","support":[{"end":250,"quote":"Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","source_id":"wikipedia.article.infinite-regress","source_sha256":"4feb18e50ce70f25afeed8f4cae0263c71e7537df36309510c93a3805e8de059","start":103}],"target_id":"concept.wikipedia.infinite-regress","target_kind":"node","target_sha256":"8df6cbe78695436ad994269b0bda5114e6c57c2953185e487a0cd43980fc64e7"}],"concept.wikipedia.inflatable-packer":[{"id":"assertion.concept.wikipedia.inflatable-packer","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inflatable packer as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inflatable packer\", CC BY-SA 4.0) states: An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","support":[{"end":278,"quote":"An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","source_id":"wikipedia.article.inflatable-packer","source_sha256":"201e37faac6a98c0fd7f7123b764eae2f9732844e535b63551bf25b9ec6bec45","start":105}],"target_id":"concept.wikipedia.inflatable-packer","target_kind":"node","target_sha256":"c4f95573981abc6d3560d6251219413c1902d56b496428f513edf4149f3dba46"}],"concept.wikipedia.informal-fallacy":[{"id":"assertion.concept.wikipedia.informal-fallacy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Informal fallacy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Informal fallacy\", CC BY-SA 4.0) states: Informal fallacies are a type of incorrect argument in natural language.","support":[{"end":175,"quote":"Informal fallacies are a type of incorrect argument in natural language.","source_id":"wikipedia.article.informal-fallacy","source_sha256":"7502ae964cf2b55064e1a216d538ac704d7c29f42c89080d76457ca59172dbe3","start":103}],"target_id":"concept.wikipedia.informal-fallacy","target_kind":"node","target_sha256":"2126e3b039291174118a3d4d3ef2ad80040db4029c78566e68c7bdaa9436c6ae"}],"concept.wikipedia.insight-phenomenology":[{"id":"assertion.concept.wikipedia.insight-phenomenology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Insight phenomenology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Insight phenomenology\", CC BY-SA 4.0) states: Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","support":[{"end":200,"quote":"Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","source_id":"wikipedia.article.insight-phenomenology","source_sha256":"61824fd5587efb6cc222e76b39b3c32f07272e9d29075da0645059433ee20fcd","start":108}],"target_id":"concept.wikipedia.insight-phenomenology","target_kind":"node","target_sha256":"2ded380b8cc4ae80a45b271fe4aca2157bb4668070e5872182cd6bfb2f394d09"}],"concept.wikipedia.instrumentalism":[{"id":"assertion.concept.wikipedia.instrumentalism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Instrumentalism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Instrumentalism\", CC BY-SA 4.0) states: In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","support":[{"end":332,"quote":"In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","source_id":"wikipedia.article.instrumentalism","source_sha256":"cf4e8a2adac4e4c0a079aa20c8acc0db1e7322608ed687c698f644c23a9ab1b4","start":101}],"target_id":"concept.wikipedia.instrumentalism","target_kind":"node","target_sha256":"a90656cdd3babf6154d3d1c91fe91e0e0acfa7a8dbb082d0cddffbbfbe811b3a"}],"concept.wikipedia.interdisciplinarity":[{"id":"assertion.concept.wikipedia.interdisciplinarity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Interdisciplinarity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Interdisciplinarity\", CC BY-SA 4.0) states: Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","support":[{"end":263,"quote":"Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","source_id":"wikipedia.article.interdisciplinarity","source_sha256":"720fbbbc89b553ec3bb0d609aeefb327010c356ee11ddfb9c82cfc2f5bec461e","start":104}],"target_id":"concept.wikipedia.interdisciplinarity","target_kind":"node","target_sha256":"d1c920e153de9e0cec786fdb4f2ee6742d59a9d586a0022de55feca5cbcbaace"}],"concept.wikipedia.intertwingularity":[{"id":"assertion.concept.wikipedia.intertwingularity","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Intertwingularity as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Intertwingularity\", CC BY-SA 4.0) states: Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","support":[{"end":315,"quote":"Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","source_id":"wikipedia.article.intertwingularity","source_sha256":"448769ee8d3255254db0fafa9953a4f9bf53889fc39e07fce2660984a0124446","start":103}],"target_id":"concept.wikipedia.intertwingularity","target_kind":"node","target_sha256":"cb8fbc1386306e37dd0cc8242d00c7c79ca13af383345b8c14e85ba4bb3ead94"}],"concept.wikipedia.inventor-s-paradox":[{"id":"assertion.concept.wikipedia.inventor-s-paradox","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inventor's paradox as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inventor's paradox\", CC BY-SA 4.0) states: The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","support":[{"end":198,"quote":"The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","source_id":"wikipedia.article.inventor-s-paradox","source_sha256":"05cddb2641e51c2adb375e9c40d4ad4eb0d28385e2c84a95120eedb0d6dfaa41","start":106}],"target_id":"concept.wikipedia.inventor-s-paradox","target_kind":"node","target_sha256":"9ba5d608dab619d7005a391af1b8a201f8930cee7e1bf7c52fae87cd90a52baf"}],"concept.wikipedia.inverterization":[{"id":"assertion.concept.wikipedia.inverterization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Inverterization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Inverterization\", CC BY-SA 4.0) states: Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","support":[{"end":267,"quote":"Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","source_id":"wikipedia.article.inverterization","source_sha256":"e69a05b49ceb7aef25d15bf4f169ecdd4f8eb394be9c294e2edcc4426cae8689","start":103}],"target_id":"concept.wikipedia.inverterization","target_kind":"node","target_sha256":"7b11d6e4e13ae3c44b69f8d6e184c10da775a31bd07ab30db3a11eeaff466dbd"}],"concept.wikipedia.irrationality":[{"id":"assertion.concept.wikipedia.irrationality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Irrationality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Irrationality\", CC BY-SA 4.0) states: Irrationality is cognition, thinking, talking, or acting without rationality.","support":[{"end":176,"quote":"Irrationality is cognition, thinking, talking, or acting without rationality.","source_id":"wikipedia.article.irrationality","source_sha256":"734d9a5f28f27a32a5a7a9656e6f47e4ed0a028dc64a7467d5663c99058c6142","start":99}],"target_id":"concept.wikipedia.irrationality","target_kind":"node","target_sha256":"60d8d11e7b26284a400b55b19379de3badadfb5a58becd00b0757a6a11e5ab26"}],"concept.wikipedia.issue-based-information-system":[{"id":"assertion.concept.wikipedia.issue-based-information-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Issue-based information system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Issue-based information system\", CC BY-SA 4.0) states: The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","support":[{"end":290,"quote":"The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","source_id":"wikipedia.article.issue-based-information-system","source_sha256":"bac92b0377ed928fd19c963d2b877e6f3f92c8c4d6ec7a8330538afdd17ff2d0","start":118}],"target_id":"concept.wikipedia.issue-based-information-system","target_kind":"node","target_sha256":"7edfb49f5532bba4fe458f83a3d38db306c45c01cf8e57378c3c059d81e84a12"}],"concept.wikipedia.jackshaft-locomotive":[{"id":"assertion.concept.wikipedia.jackshaft-locomotive","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jackshaft (locomotive) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jackshaft (locomotive)\", CC BY-SA 4.0) states: A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","support":[{"end":294,"quote":"A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","source_id":"wikipedia.article.jackshaft-locomotive","source_sha256":"d5a6a9837e8a117f514051463439b30e394268a75f20cf3f5a2dfa9628fea3e3","start":109}],"target_id":"concept.wikipedia.jackshaft-locomotive","target_kind":"node","target_sha256":"60fcba032fef464658145045ed100676d264d4babdd395d4f2fe6ce850e45246"}],"concept.wikipedia.javelin-argument":[{"id":"assertion.concept.wikipedia.javelin-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Javelin argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Javelin argument\", CC BY-SA 4.0) states: The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","support":[{"end":238,"quote":"The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","source_id":"wikipedia.article.javelin-argument","source_sha256":"8bf31b46a74aa6e250d30603b5e23a17fde4c712a7c078f0a65747366e42b813","start":103}],"target_id":"concept.wikipedia.javelin-argument","target_kind":"node","target_sha256":"a2b2ed79391507a3d021b4c290cbad00b734989a63060d51d0dc46aff0c3c96e"}],"concept.wikipedia.jewel-bearing":[{"id":"assertion.concept.wikipedia.jewel-bearing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jewel bearing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jewel bearing\", CC BY-SA 4.0) states: A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","support":[{"end":193,"quote":"A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","source_id":"wikipedia.article.jewel-bearing","source_sha256":"bff6949f277d805298adfa6be7a5f5010bc9784bffad6ff4ad31eb0ba5b8caec","start":99}],"target_id":"concept.wikipedia.jewel-bearing","target_kind":"node","target_sha256":"80e283b08fb837ee32245f76bc4cc1f2d53857b468e308dd1951a159583c48ce"}],"concept.wikipedia.knowledge-falsification":[{"id":"assertion.concept.wikipedia.knowledge-falsification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge falsification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge falsification\", CC BY-SA 4.0) states: Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","support":[{"end":222,"quote":"Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","source_id":"wikipedia.article.knowledge-falsification","source_sha256":"c2d058284f48e5d67edf43a34566d8bc0d1f94b8106d00304d778539a087d270","start":111}],"target_id":"concept.wikipedia.knowledge-falsification","target_kind":"node","target_sha256":"560959545e1c53506006ce7eccf35778904eb1d66786b389e20df7397783262e"}],"concept.wikipedia.knowledge-inertia":[{"id":"assertion.concept.wikipedia.knowledge-inertia","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge inertia as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge inertia\", CC BY-SA 4.0) states: Knowledge inertia (KI) is a concept in knowledge management.","support":[{"end":166,"quote":"Knowledge inertia  (KI) is a concept in knowledge management.","source_id":"wikipedia.article.knowledge-inertia","source_sha256":"ba54c09c44a3f65b0ba738ca2c59e8100283a69096e2b589aae2bb30bcb73b92","start":105}],"target_id":"concept.wikipedia.knowledge-inertia","target_kind":"node","target_sha256":"5a1f04e989aba7a5cbcb199170af856a82c0b03147e6f765c9b390dff8fa9ae6"}],"concept.wikipedia.knowledge-is-power":[{"id":"assertion.concept.wikipedia.knowledge-is-power","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge is power as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge is power\", CC BY-SA 4.0) states: The phrase \"scientia potentia est\" (or \"scientia est potentia\" or also \"scientia potestas est\") is a Latin aphorism meaning \"knowledge is power\", commonly attributed to Sir Francis Bacon.","support":[{"end":300,"quote":"The phrase \\\"scientia potentia est\\\" (or \\\"scientia est potentia\\\" or also \\\"scientia potestas est\\\") is a Latin aphorism meaning \\\"knowledge is power\\\", commonly attributed to Sir Francis Bacon.","source_id":"wikipedia.article.knowledge-is-power","source_sha256":"5c1550823dad8a2dc2043053fd5d4747858b4b43a38aaf3440041afa42563749","start":105}],"target_id":"concept.wikipedia.knowledge-is-power","target_kind":"node","target_sha256":"2519e9f4a6a2f8f2585d27f0d758e8a2580590ee13f0b2f9968632e7fed4b42f"}],"concept.wikipedia.knowledge-organization":[{"id":"assertion.concept.wikipedia.knowledge-organization","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Knowledge organization as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Knowledge organization\", CC BY-SA 4.0) states: Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","support":[{"end":433,"quote":"Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","source_id":"wikipedia.article.knowledge-organization","source_sha256":"b06eeb2b44e7079dbf8d021de73c002891c0782a88206d888c8e0b8da03b646e","start":109}],"target_id":"concept.wikipedia.knowledge-organization","target_kind":"node","target_sha256":"ae2f4d458e9e515e234999f6ac68f3e5a97d6dac1c4c340131134c8ea50cff6b"}],"concept.wikipedia.lateral-thinking":[{"id":"assertion.concept.wikipedia.lateral-thinking","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Lateral thinking as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Lateral thinking\", CC BY-SA 4.0) states: Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","support":[{"end":237,"quote":"Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","source_id":"wikipedia.article.lateral-thinking","source_sha256":"e798af585093b7c47c0295c92b67f04a435593b09afa50f46e0c84e49ee98d1d","start":102}],"target_id":"concept.wikipedia.lateral-thinking","target_kind":"node","target_sha256":"552845ddc5af6b4c86f638e6343c8e83f78051967cac02144a4575194c7fd7ec"}],"concept.wikipedia.lazy-argument":[{"id":"assertion.concept.wikipedia.lazy-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Lazy argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Lazy argument\", CC BY-SA 4.0) states: The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","support":[{"end":343,"quote":"The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","source_id":"wikipedia.article.lazy-argument","source_sha256":"5a35e1aef75f0991432c89ac48f27fc2570803bd866d0bd76175c58d7987bdeb","start":100}],"target_id":"concept.wikipedia.lazy-argument","target_kind":"node","target_sha256":"a886c3c5bde5f574fe66919a2f1e19d86610a34f0d3f87986f67353a3ff9cb8d"}],"concept.wikipedia.limiting-case-mathematics":[{"id":"assertion.concept.wikipedia.limiting-case-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Limiting case (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Limiting case (mathematics)\", CC BY-SA 4.0) states: In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","support":[{"end":287,"quote":"In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","source_id":"wikipedia.article.limiting-case-mathematics","source_sha256":"ae09509335653796fb7493e6d51a424bf366edbffd76e5a64b28cc4994213b05","start":115}],"target_id":"concept.wikipedia.limiting-case-mathematics","target_kind":"node","target_sha256":"970ddab589dad9493496da374c0edaec91772783aaa777b03f1487e8d5e4f6f5"}],"concept.wikipedia.linear-actuator":[{"id":"assertion.concept.wikipedia.linear-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Linear actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Linear actuator\", CC BY-SA 4.0) states: A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","support":[{"end":258,"quote":"A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","source_id":"wikipedia.article.linear-actuator","source_sha256":"791543fd524070da72cf1fc0d08d7733f2c692b0242810b41dbe8a4790729879","start":102}],"target_id":"concept.wikipedia.linear-actuator","target_kind":"node","target_sha256":"aa6e33c059b959e7092ddea7c75c8ff45ac749b7dd40bdda5c5c2d093ee5bc78"}],"concept.wikipedia.local-skepticism":[{"id":"assertion.concept.wikipedia.local-skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Local skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Local skepticism\", CC BY-SA 4.0) states: Local skepticism is the view that one cannot possess knowledge in some particular domain.","support":[{"end":193,"quote":"Local skepticism is the view that one cannot possess knowledge in some particular domain.","source_id":"wikipedia.article.local-skepticism","source_sha256":"6072fb52ad43b1efcb05baf84be2fdd041f4b366b082243132bb19d288ad9f72","start":104}],"target_id":"concept.wikipedia.local-skepticism","target_kind":"node","target_sha256":"e451bdd9474d6aaa9f448a884e7f6aa10a05de523cdbeff68106e6417170fbc3"}],"concept.wikipedia.logarithmically-concave-sequence":[{"id":"assertion.concept.wikipedia.logarithmically-concave-sequence","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logarithmically concave sequence as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logarithmically concave sequence\", CC BY-SA 4.0) states: In mathematics, a sequence a = (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","support":[{"end":320,"quote":"In mathematics, a sequence a =  (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","source_id":"wikipedia.article.logarithmically-concave-sequence","source_sha256":"feaa814f840b6fe11dcf5efb04c4a625e2ad6647f400a40c6f35768965de6b6b","start":120}],"target_id":"concept.wikipedia.logarithmically-concave-sequence","target_kind":"node","target_sha256":"41f044c09f9fc47ef27de3fbae935f26cfa39041e6d2b21fda61d43bcd4f763a"}],"concept.wikipedia.logic-of-argumentation":[{"id":"assertion.concept.wikipedia.logic-of-argumentation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logic of argumentation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logic of argumentation\", CC BY-SA 4.0) states: The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","support":[{"end":234,"quote":"The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","source_id":"wikipedia.article.logic-of-argumentation","source_sha256":"c756ad68415c92243976c4045dd60972a17a4f73805fbb1680cd7e961f1e4d87","start":110}],"target_id":"concept.wikipedia.logic-of-argumentation","target_kind":"node","target_sha256":"da5414418cb64df74290ccda1893c2a4bc7e582bffec88e982213e51ea649e39"}],"concept.wikipedia.logical-form":[{"id":"assertion.concept.wikipedia.logical-form","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical form as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical form\", CC BY-SA 4.0) states: In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","support":[{"end":220,"quote":"In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","source_id":"wikipedia.article.logical-form","source_sha256":"caaa34822bdb3d87ecbcd4ab43e67f4e66a1fc65a235307d7fbff5fe1319a591","start":99}],"target_id":"concept.wikipedia.logical-form","target_kind":"node","target_sha256":"a192a197c3aea62201a15e0de9df6fb6a83797d7e7c5a38f3ed340d9f442c788"}],"concept.wikipedia.logical-hexagon":[{"id":"assertion.concept.wikipedia.logical-hexagon","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical hexagon as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical hexagon\", CC BY-SA 4.0) states: In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","support":[{"end":273,"quote":"In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","source_id":"wikipedia.article.logical-hexagon","source_sha256":"ca974efe3ea03e7da927557d65b2c55632bf74c47add69f7889c1ff91c5ff4a7","start":103}],"target_id":"concept.wikipedia.logical-hexagon","target_kind":"node","target_sha256":"b1d133f8fd3e2a26a7bc38e0729a5872ba768951131f61c965d0401772ef99e8"}],"concept.wikipedia.logical-truth":[{"id":"assertion.concept.wikipedia.logical-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Logical truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Logical truth\", CC BY-SA 4.0) states: Logical truth is one of the most fundamental concepts in logic.","support":[{"end":163,"quote":"Logical truth is one of the most fundamental concepts in logic.","source_id":"wikipedia.article.logical-truth","source_sha256":"d4cbe8af2a6b102c91340b14c18c4ca062e1ee40b7148ed26d142b3925bc8f7b","start":100}],"target_id":"concept.wikipedia.logical-truth","target_kind":"node","target_sha256":"63d43274fbb72360dcbad1bde94bd31568d9eedc64f749a32156b5266a124384"}],"concept.wikipedia.loki-s-wager":[{"id":"assertion.concept.wikipedia.loki-s-wager","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Loki's wager as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Loki's wager\", CC BY-SA 4.0) states: Loki's wager is the insistence that because two or more categories exist as poles on a spectrum with a grey area in the middle, the distinction between the two cannot be defined.","support":[{"end":278,"quote":"Loki's wager is the insistence that because two or more categories exist as poles on a spectrum  with a grey area in the middle, the distinction between the two cannot be defined.","source_id":"wikipedia.article.loki-s-wager","source_sha256":"ffbc8321a8f44519b8c8b2fa4592227b21879e73015adabdca1546de5bc89fee","start":99}],"target_id":"concept.wikipedia.loki-s-wager","target_kind":"node","target_sha256":"ad6cf91e5dee037e12a161fbb332a182593ccac2519add1f3407ccec8a9b7cd5"}],"concept.wikipedia.machine":[{"id":"assertion.concept.wikipedia.machine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Machine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Machine\", CC BY-SA 4.0) states: A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","support":[{"end":202,"quote":"A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","source_id":"wikipedia.article.machine","source_sha256":"bd1e1bc819d38622c6e0079c79d42be6bead37155f468784e005c54253aa92b1","start":92}],"target_id":"concept.wikipedia.machine","target_kind":"node","target_sha256":"4c6afdef8ab52a3e425340c7eba3303e3abf799e8aceb8e06edc8780ae6ab769"}],"concept.wikipedia.machining":[{"id":"assertion.concept.wikipedia.machining","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Machining as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Machining\", CC BY-SA 4.0) states: Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","support":[{"end":280,"quote":"Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","source_id":"wikipedia.article.machining","source_sha256":"515a85285b810605f94e9a69c0ab7c6bc210e203750f876300ab6273e73d9de7","start":95}],"target_id":"concept.wikipedia.machining","target_kind":"node","target_sha256":"7776cdd02d6d8419e7e158459804a10436f73dc6f7cf642b6a97f6c52bd17b28"}],"concept.wikipedia.malibu-hydro":[{"id":"assertion.concept.wikipedia.malibu-hydro","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Malibu Hydro as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Malibu Hydro\", CC BY-SA 4.0) states: Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","support":[{"end":185,"quote":"Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","source_id":"wikipedia.article.malibu-hydro","source_sha256":"44bbeb4367e9d7d2ee368a13923ca29b9807f877526d3c3a247621c13a24d355","start":100}],"target_id":"concept.wikipedia.malibu-hydro","target_kind":"node","target_sha256":"246f68046bef31965f48943cdecb3b26276b06236d96347f5586d24bba9b77f8"}],"concept.wikipedia.manufacturing":[{"id":"assertion.concept.wikipedia.manufacturing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Manufacturing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Manufacturing\", CC BY-SA 4.0) states: Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","support":[{"end":256,"quote":"Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","source_id":"wikipedia.article.manufacturing","source_sha256":"c28859d7f119cb32e72de33aee3595b52d6524e0fcd5fa71c84da4a71fde9400","start":98}],"target_id":"concept.wikipedia.manufacturing","target_kind":"node","target_sha256":"18dda8dfe09facef81ab177d2ed18e61459ed864b76dd0a0d696259886028bc5"}],"concept.wikipedia.material-inference":[{"id":"assertion.concept.wikipedia.material-inference","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Material inference as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Material inference\", CC BY-SA 4.0) states: In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","support":[{"end":215,"quote":"In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","source_id":"wikipedia.article.material-inference","source_sha256":"b9cadfdeac5587abd0471605f494a34ec2fe85021157b4bf1644ca04ba84a64b","start":106}],"target_id":"concept.wikipedia.material-inference","target_kind":"node","target_sha256":"3c20db9be3ce15f1640fcddade110d760299c5daecb2584aca1f4d4db1d1991e"}],"concept.wikipedia.mathematical-diagram":[{"id":"assertion.concept.wikipedia.mathematical-diagram","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical diagram as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical diagram\", CC BY-SA 4.0) states: Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","support":[{"end":250,"quote":"Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","source_id":"wikipedia.article.mathematical-diagram","source_sha256":"94965251e91e95da94d9da5d4628a030abdba9c512e73db5d0bcc64613e1d274","start":108}],"target_id":"concept.wikipedia.mathematical-diagram","target_kind":"node","target_sha256":"fbd7dbde2a8ab342de29043dc877efce5d1cb6966cbaceca74de2a786e84bdd8"}],"concept.wikipedia.mathematical-logic":[{"id":"assertion.concept.wikipedia.mathematical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical logic\", CC BY-SA 4.0) states: Mathematical logic is the study of formal logic within mathematics.","support":[{"end":170,"quote":"Mathematical logic is the study of formal logic within mathematics.","source_id":"wikipedia.article.mathematical-logic","source_sha256":"80a941a28d5557df3536ea3df6a9eac8bf37067cd21064850c94a281c117967f","start":103}],"target_id":"concept.wikipedia.mathematical-logic","target_kind":"node","target_sha256":"56e5f084ccede16c53576e42a4e22a1db2caef5b24e88c1ad0c7a90e103e67d2"}],"concept.wikipedia.measure-mathematics":[{"id":"assertion.concept.wikipedia.measure-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Measure (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Measure (mathematics)\", CC BY-SA 4.0) states: In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","support":[{"end":309,"quote":"In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","source_id":"wikipedia.article.measure-mathematics","source_sha256":"8fac8382790a72f723e8ba78d26696d1dc172ef436ca65557d2972a643cc6356","start":106}],"target_id":"concept.wikipedia.measure-mathematics","target_kind":"node","target_sha256":"2429e134f43ed3318b117da2b8fded822147da1ac1ec436b054e61e9cc3f76b5"}],"concept.wikipedia.measurement":[{"id":"assertion.concept.wikipedia.measurement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Measurement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Measurement\", CC BY-SA 4.0) states: Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","support":[{"end":225,"quote":"Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","source_id":"wikipedia.article.measurement","source_sha256":"cee020945aa4a69c0431406415eb331fe422aacf9c52c4ca010e744cbaf5b637","start":96}],"target_id":"concept.wikipedia.measurement","target_kind":"node","target_sha256":"958b0333cb3deac1703a205ee784531a840f268d7a9565c34152acdfba8e4fdd"}],"concept.wikipedia.meta-functional-expertise":[{"id":"assertion.concept.wikipedia.meta-functional-expertise","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Meta-functional expertise as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Meta-functional expertise\", CC BY-SA 4.0) states: Meta-functional expertise is the breadth of one’s strategically important knowledge.","support":[{"end":197,"quote":"Meta-functional expertise is the breadth of one’s strategically important knowledge.","source_id":"wikipedia.article.meta-functional-expertise","source_sha256":"00d0ee19f6fadbbae03a7a79e79381c45196f4e545d7cd7919196dd379f9857e","start":113}],"target_id":"concept.wikipedia.meta-functional-expertise","target_kind":"node","target_sha256":"f642c27e3024381f277efdd1c262f7e24f76200704a07bc9dc4b9eb1a0f2d668"}],"concept.wikipedia.modular-representation-theory":[{"id":"assertion.concept.wikipedia.modular-representation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Modular representation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Modular representation theory\", CC BY-SA 4.0) states: In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","support":[{"end":291,"quote":"In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","source_id":"wikipedia.article.modular-representation-theory","source_sha256":"6b4a7f219ca546c728b13a803a4802fe74551fe8d84ad66851561fa461560e63","start":116}],"target_id":"concept.wikipedia.modular-representation-theory","target_kind":"node","target_sha256":"47799ce03c4bb9b7aee2515301005c37d6924df32655502a2758567cf30ea5f6"}],"concept.wikipedia.module-mathematics":[{"id":"assertion.concept.wikipedia.module-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Module (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Module (mathematics)\", CC BY-SA 4.0) states: In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","support":[{"end":263,"quote":"In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","source_id":"wikipedia.article.module-mathematics","source_sha256":"f58805fbf8fc17fda334366db824b8987d5629538d0e2bc4caf66daa884a53b5","start":106}],"target_id":"concept.wikipedia.module-mathematics","target_kind":"node","target_sha256":"f39255db51e42246a9b7bab9e86bce07675cd2f3f915c1a9c6e650f2cf888cfe"}],"concept.wikipedia.moment-statistics":[{"id":"assertion.concept.wikipedia.moment-statistics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Moment (statistics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Moment (statistics)\", CC BY-SA 4.0) states: In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","support":[{"end":226,"quote":"In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","source_id":"wikipedia.article.moment-statistics","source_sha256":"3937b33609ae2e9a255bb0ff5c5f36308c8b9862fa71e2c0b3aa74c77edb5b30","start":107}],"target_id":"concept.wikipedia.moment-statistics","target_kind":"node","target_sha256":"fa21c6df791fb2830daa75d9262aaef63e617519752241074408457561e90a78"}],"concept.wikipedia.moral-intellectualism":[{"id":"assertion.concept.wikipedia.moral-intellectualism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Moral intellectualism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Moral intellectualism\", CC BY-SA 4.0) states: Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","support":[{"end":313,"quote":"Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","source_id":"wikipedia.article.moral-intellectualism","source_sha256":"09fd92886e1379b4bd35bfacab12a82c47c9cf57bfe1589a568c110b8e065954","start":109}],"target_id":"concept.wikipedia.moral-intellectualism","target_kind":"node","target_sha256":"b2441498cf06f1ee502654511e918d20e5c25c265339d04a7dbd1d71513ead5f"}],"concept.wikipedia.new-riddle-of-induction":[{"id":"assertion.concept.wikipedia.new-riddle-of-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"New riddle of induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"New riddle of induction\", CC BY-SA 4.0) states: The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","support":[{"end":242,"quote":"The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","source_id":"wikipedia.article.new-riddle-of-induction","source_sha256":"b285bd73341162e73f25b9e70382a93bdd974eb9aece32439fa1b8b4fc498437","start":109}],"target_id":"concept.wikipedia.new-riddle-of-induction","target_kind":"node","target_sha256":"e93e7ae1e7239bfc1b66e38a75e428604553dafb7230f9b1761508c7386db6c1"}],"concept.wikipedia.nothing-to-hide-argument":[{"id":"assertion.concept.wikipedia.nothing-to-hide-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Nothing to hide argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Nothing to hide argument\", CC BY-SA 4.0) states: The \"nothing to hide\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","support":[{"end":329,"quote":"The \\\"nothing to hide\\\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","source_id":"wikipedia.article.nothing-to-hide-argument","source_sha256":"50f6628a6a453c7532d458486378d2ff7e37ba0bce5f42856612073cb5680c72","start":112}],"target_id":"concept.wikipedia.nothing-to-hide-argument","target_kind":"node","target_sha256":"4777ead8e472c58533fca1a8c05a134929c14e398062555ad556c297a915a6f0"}],"concept.wikipedia.nuclear-technology":[{"id":"assertion.concept.wikipedia.nuclear-technology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Nuclear technology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Nuclear technology\", CC BY-SA 4.0) states: Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","support":[{"end":189,"quote":"Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","source_id":"wikipedia.article.nuclear-technology","source_sha256":"46082db1c0f5c9f5c869b7cafbeb3ee190e63a454f1d18c9ee56c4286efba8c8","start":103}],"target_id":"concept.wikipedia.nuclear-technology","target_kind":"node","target_sha256":"d87bff7bcd8d8bcabbc97b78dff11f20fb67c434f3a464992a911ae75206429c"}],"concept.wikipedia.objection-argument":[{"id":"assertion.concept.wikipedia.objection-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Objection (argument) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Objection (argument)\", CC BY-SA 4.0) states: In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","support":[{"end":201,"quote":"In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","source_id":"wikipedia.article.objection-argument","source_sha256":"bcb5ded1c728028cb36cfcab1ce10421fcf81160c3a517209901ece83bdb3e71","start":107}],"target_id":"concept.wikipedia.objection-argument","target_kind":"node","target_sha256":"28e51496327f74434b5dc0fcef6288c12b8a2626c38b4b53c17c61a63627cff8"}],"concept.wikipedia.ontoclean":[{"id":"assertion.concept.wikipedia.ontoclean","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"OntoClean as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"OntoClean\", CC BY-SA 4.0) states: OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","support":[{"end":272,"quote":"OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","source_id":"wikipedia.article.ontoclean","source_sha256":"c61ad98d6721c6ed25162691c3a25fd6e4293f47189c431dfa1677fb73eb1960","start":97}],"target_id":"concept.wikipedia.ontoclean","target_kind":"node","target_sha256":"f16bd4800c10feefebd0d5e997ee2b485bb2eae3431792149315d4453ae22da2"}],"concept.wikipedia.open-question-argument":[{"id":"assertion.concept.wikipedia.open-question-argument","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open-question argument as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open-question argument\", CC BY-SA 4.0) states: The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","support":[{"end":382,"quote":"The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","source_id":"wikipedia.article.open-question-argument","source_sha256":"d5aa849a35b551608dd0453813fc3e59d5c895e37640a4154061c3bd6ab749ff","start":108}],"target_id":"concept.wikipedia.open-question-argument","target_kind":"node","target_sha256":"2daaa3da2c6a214b665897ed6dc394229bfe26e72040b98411bc9b332498d9df"}],"concept.wikipedia.open-science":[{"id":"assertion.concept.wikipedia.open-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open science\", CC BY-SA 4.0) states: Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","support":[{"end":340,"quote":"Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","source_id":"wikipedia.article.open-science","source_sha256":"79ca63347b400f6e6a335c7264c00bb2231ad4b7a45dcaac7bfb0b5fe86624f1","start":99}],"target_id":"concept.wikipedia.open-science","target_kind":"node","target_sha256":"b12cce4a0839513fba62c9153ccc06347d21f73a262e258b174a6326686e4f7b"}],"concept.wikipedia.open-texture":[{"id":"assertion.concept.wikipedia.open-texture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Open texture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Open texture\", CC BY-SA 4.0) states: Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \"Verifiability\" to refer to the universal possibility of vagueness in empirical statements.","support":[{"end":287,"quote":"Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \\\"Verifiability\\\" to refer to the universal possibility of vagueness in empirical statements.","source_id":"wikipedia.article.open-texture","source_sha256":"7a7175d0d71619c10c82271bd271b411dc85e85a4db5afd11d7002478a7495d4","start":100}],"target_id":"concept.wikipedia.open-texture","target_kind":"node","target_sha256":"1f8233a5949a8b71ab87f33233c576b04d3ec6526205e106307954a500f474f5"}],"concept.wikipedia.overdetermination":[{"id":"assertion.concept.wikipedia.overdetermination","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Overdetermination as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Overdetermination\", CC BY-SA 4.0) states: Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\"determine\") the effect.","support":[{"end":291,"quote":"Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\\\"determine\\\") the effect.","source_id":"wikipedia.article.overdetermination","source_sha256":"21805c11a3b21940999828732532931c00cab26914b4db6a5876dfec3b24eefb","start":105}],"target_id":"concept.wikipedia.overdetermination","target_kind":"node","target_sha256":"9736aaad9606db79bcf3328e71000d131a6fd9a3a895cf5b0521ab77c395c755"}],"concept.wikipedia.philosophical-logic":[{"id":"assertion.concept.wikipedia.philosophical-logic","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Philosophical logic as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Philosophical logic\", CC BY-SA 4.0) states: Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","support":[{"end":314,"quote":"Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","source_id":"wikipedia.article.philosophical-logic","source_sha256":"c30b585df4aa209b0bf29bbd0e08750c98fa8f45d560a0ccd0d3236a5f47098e","start":105}],"target_id":"concept.wikipedia.philosophical-logic","target_kind":"node","target_sha256":"91ac4f44dec8cfbad869ee2d33e4bc3677418b9f31eace644bc2649b59731d45"}],"concept.wikipedia.philosophical-razor":[{"id":"assertion.concept.wikipedia.philosophical-razor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Philosophical razor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Philosophical razor\", CC BY-SA 4.0) states: In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","support":[{"end":272,"quote":"In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","source_id":"wikipedia.article.philosophical-razor","source_sha256":"56c5f18e4a897e0a5de36ec2bb2ab182068310a66a91fb0468527b1e8ccac737","start":107}],"target_id":"concept.wikipedia.philosophical-razor","target_kind":"node","target_sha256":"2bf9ba8724261f7aa21ef067b278144be04d2632841cd0c52d571218a2b72ea0"}],"concept.wikipedia.pragmatic-theory-of-truth":[{"id":"assertion.concept.wikipedia.pragmatic-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pragmatic theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pragmatic theory of truth\", CC BY-SA 4.0) states: A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","support":[{"end":215,"quote":"A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","source_id":"wikipedia.article.pragmatic-theory-of-truth","source_sha256":"4b2fd6ac911ef332b1bdf48b72da30d2a496e01b9fff2ce059a95ef8c58e9d72","start":111}],"target_id":"concept.wikipedia.pragmatic-theory-of-truth","target_kind":"node","target_sha256":"90821210d48b960ff47a4cf642244db52270dee0815baf360315a16a45b052ac"}],"concept.wikipedia.pregeometry-model-theory":[{"id":"assertion.concept.wikipedia.pregeometry-model-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pregeometry (model theory) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pregeometry (model theory)\", CC BY-SA 4.0) states: Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \"matroid\".","support":[{"end":206,"quote":"Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \\\"matroid\\\".","source_id":"wikipedia.article.pregeometry-model-theory","source_sha256":"ee17cbe00b547b57fdd734463976f2c1c11f3bf7dfffa6d92310d88530de403e","start":113}],"target_id":"concept.wikipedia.pregeometry-model-theory","target_kind":"node","target_sha256":"3cb6cfaf0397f0f024eabfa6ee8f746323def2d8345f044d8f7e4d6d40bb32ab"}],"concept.wikipedia.preregistration-science":[{"id":"assertion.concept.wikipedia.preregistration-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Preregistration (science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Preregistration (science)\", CC BY-SA 4.0) states: Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","support":[{"end":242,"quote":"Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","source_id":"wikipedia.article.preregistration-science","source_sha256":"aa2bfce7c4741cb62adfff55489eeaa5dfa6cf29687b5b146ab0c8e91656c64e","start":113}],"target_id":"concept.wikipedia.preregistration-science","target_kind":"node","target_sha256":"215122e4d2510c5e54030cd62bc2fa3643f7e6291dbb34dab0c22ee6cedfc194"}],"concept.wikipedia.prime-number":[{"id":"assertion.concept.wikipedia.prime-number","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Prime number as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Prime number\", CC BY-SA 4.0) states: A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","support":[{"end":213,"quote":"A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","source_id":"wikipedia.article.prime-number","source_sha256":"b28675516b97771fa6343e42a38ad1161a26f0cafb2f3ca271645f5cdcbd1ca6","start":97}],"target_id":"concept.wikipedia.prime-number","target_kind":"node","target_sha256":"d152a5e56553b89cb6985de2cee9142a204a4ed0003026b8f78e4175a9034374"}],"concept.wikipedia.problem-finding":[{"id":"assertion.concept.wikipedia.problem-finding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem finding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem finding\", CC BY-SA 4.0) states: Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","support":[{"end":219,"quote":"Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","source_id":"wikipedia.article.problem-finding","source_sha256":"81de84706d016ec44cc7db16b9f618d87040af03e42cf7dfa597a766b0549bd9","start":102}],"target_id":"concept.wikipedia.problem-finding","target_kind":"node","target_sha256":"8b10286f065d8ac041ad215b4584c453e28b3d53dbe7bb1e41c912de3d6f5e8c"}],"concept.wikipedia.problem-solving-environment":[{"id":"assertion.concept.wikipedia.problem-solving-environment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem solving environment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem solving environment\", CC BY-SA 4.0) states: A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","support":[{"end":351,"quote":"A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","source_id":"wikipedia.article.problem-solving-environment","source_sha256":"73ee159d29c18ce2fa071a8963a6d6543a9e33a141636273528a477084904a26","start":114}],"target_id":"concept.wikipedia.problem-solving-environment","target_kind":"node","target_sha256":"08cc2544f906b544ad5ab91f74ecc3507f5c3a76b6fc44e875e850c0ab65328c"}],"concept.wikipedia.problem-statement":[{"id":"assertion.concept.wikipedia.problem-statement","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Problem statement as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Problem statement\", CC BY-SA 4.0) states: A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","support":[{"end":206,"quote":"A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","source_id":"wikipedia.article.problem-statement","source_sha256":"dd5faefd118a13bfb1d8d0b1ba57efff7044a13d2c50b180a3423aa312e85932","start":105}],"target_id":"concept.wikipedia.problem-statement","target_kind":"node","target_sha256":"2159059fd74f8e05c02ef3717e201e70f153a7a21bf9ff55301ebeb7cb77b10a"}],"concept.wikipedia.pseudoscience":[{"id":"assertion.concept.wikipedia.pseudoscience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pseudoscience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pseudoscience\", CC BY-SA 4.0) states: Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","support":[{"end":245,"quote":"Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","source_id":"wikipedia.article.pseudoscience","source_sha256":"a3b99d187b1ee561b4416d4e8b67aa32d3747ea726624c2ea8e2fa4266abe881","start":98}],"target_id":"concept.wikipedia.pseudoscience","target_kind":"node","target_sha256":"02db12be5297d05acadd69fb0c76c845450698c1f63ebc18963007fd35d9a912"}],"concept.wikipedia.pump":[{"id":"assertion.concept.wikipedia.pump","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Pump as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Pump\", CC BY-SA 4.0) states: A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","support":[{"end":269,"quote":"A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","source_id":"wikipedia.article.pump","source_sha256":"557fab341bec86e4e0b8cbcc2e0f6720687a758ce11a323a7066275fa0c0ab83","start":89}],"target_id":"concept.wikipedia.pump","target_kind":"node","target_sha256":"a52d340cc2a253e26411552275bdda5466ef15f96364bf1b95d30f304c548412"}],"concept.wikipedia.radial-turbine":[{"id":"assertion.concept.wikipedia.radial-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Radial turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Radial turbine\", CC BY-SA 4.0) states: A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","support":[{"end":194,"quote":"A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","source_id":"wikipedia.article.radial-turbine","source_sha256":"e71ffa503678717ef5dfd0d527ad39eae8c3d23fce28df3fd5382cc7f5b4ca0e","start":102}],"target_id":"concept.wikipedia.radial-turbine","target_kind":"node","target_sha256":"22d9c2669a742605b5c456a011307c1543887537d6b85241111e627f295b8bed"}],"concept.wikipedia.radical-empiricism":[{"id":"assertion.concept.wikipedia.radical-empiricism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Radical empiricism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Radical empiricism\", CC BY-SA 4.0) states: Radical empiricism is a philosophical doctrine put forward by William James.","support":[{"end":181,"quote":"Radical empiricism is a philosophical doctrine put forward by William James.","source_id":"wikipedia.article.radical-empiricism","source_sha256":"321b427661f06ef8c2e0e9b0a89f2dcddb7001e79455f331f42486f9618577a2","start":105}],"target_id":"concept.wikipedia.radical-empiricism","target_kind":"node","target_sha256":"119768b4be8b065732731c7a5f07c9b6a23377ea8040c5c0e8674850d987d55d"}],"concept.wikipedia.rational-egoism":[{"id":"assertion.concept.wikipedia.rational-egoism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rational egoism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rational egoism\", CC BY-SA 4.0) states: Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","support":[{"end":245,"quote":"Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","source_id":"wikipedia.article.rational-egoism","source_sha256":"1c7988b394f11bb9ca3cfe316579035c3ec347004b5d136f801deab4c747a2c4","start":102}],"target_id":"concept.wikipedia.rational-egoism","target_kind":"node","target_sha256":"27bf94c9dd14cb19659747611bd8c6d146426e28fe20b26d9c05622373db7b1e"}],"concept.wikipedia.rational-fideism":[{"id":"assertion.concept.wikipedia.rational-fideism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rational fideism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rational fideism\", CC BY-SA 4.0) states: Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","support":[{"end":211,"quote":"Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","source_id":"wikipedia.article.rational-fideism","source_sha256":"ce2924d13d6c7b4c716e351c017b7d16f697c03f0cf1e2dd489c0f7d01540b76","start":104}],"target_id":"concept.wikipedia.rational-fideism","target_kind":"node","target_sha256":"b8350e701c1014dd894503f13b8972d9f114114cb835774dffa733711f1610b5"}],"concept.wikipedia.real-analysis":[{"id":"assertion.concept.wikipedia.real-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Real analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Real analysis\", CC BY-SA 4.0) states: Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","support":[{"end":287,"quote":"Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","source_id":"wikipedia.article.real-analysis","source_sha256":"5cd68fef65487d4f9074b21b17222457c1df24d135605f0806ae5ab9321a99d6","start":98}],"target_id":"concept.wikipedia.real-analysis","target_kind":"node","target_sha256":"c7b7c669f348aa88a7efefeae7b88627a24c3a2fe5255679623ac97438ede092"}],"concept.wikipedia.reasonable-doubt":[{"id":"assertion.concept.wikipedia.reasonable-doubt","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Reasonable doubt as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Reasonable doubt\", CC BY-SA 4.0) states: Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","support":[{"end":234,"quote":"Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","source_id":"wikipedia.article.reasonable-doubt","source_sha256":"8f1e56bbdea4a481639b4d5ce0fb106b13760647baef40ae4c952e6431d4ba7d","start":103}],"target_id":"concept.wikipedia.reasonable-doubt","target_kind":"node","target_sha256":"38b9d0266657d5ebf204ed417e109940a599b9602533a09df8e8cc0fbeb5f734"}],"concept.wikipedia.reasoning-system":[{"id":"assertion.concept.wikipedia.reasoning-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Reasoning system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Reasoning system\", CC BY-SA 4.0) states: In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","support":[{"end":279,"quote":"In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","source_id":"wikipedia.article.reasoning-system","source_sha256":"ff1b261150525d755e8f4247fd4d12f1ee7d7fa495aedad6bcb1bc31b3486aca","start":104}],"target_id":"concept.wikipedia.reasoning-system","target_kind":"node","target_sha256":"75f7b058a87e2f4c26d11bee3ed55b787406d7d9a12223ad11b72a6c077e9686"}],"concept.wikipedia.redundancy-theory-of-truth":[{"id":"assertion.concept.wikipedia.redundancy-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Redundancy theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Redundancy theory of truth\", CC BY-SA 4.0) states: According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","support":[{"end":303,"quote":"According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","source_id":"wikipedia.article.redundancy-theory-of-truth","source_sha256":"0c14b9a0c5f9bb133dce052aa420584e1aa1cecf11ec56c91e1b18cc82ddd78e","start":113}],"target_id":"concept.wikipedia.redundancy-theory-of-truth","target_kind":"node","target_sha256":"77a0059e4ee43b681ae9dbe7c8989e3da03717056f5b6718c6a9de42da06987e"}],"concept.wikipedia.research-program":[{"id":"assertion.concept.wikipedia.research-program","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Research program as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Research program\", CC BY-SA 4.0) states: A research program (British English: research programme) is a professional network of scientists conducting basic research.","support":[{"end":227,"quote":"A research program (British English: research programme) is a professional network of scientists conducting basic research.","source_id":"wikipedia.article.research-program","source_sha256":"1c05a5150fe6ba772f14ce394f56b598b622e19cd0bc79012170fd0bc2887eed","start":104}],"target_id":"concept.wikipedia.research-program","target_kind":"node","target_sha256":"d79e2d401859038bf33a7d89cf8860b1c27f43b3870bb5f5187918f919b862ae"}],"concept.wikipedia.residue-field":[{"id":"assertion.concept.wikipedia.residue-field","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Residue field as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Residue field\", CC BY-SA 4.0) states: In mathematics, the residue field is a basic construction in commutative algebra.","support":[{"end":182,"quote":"In mathematics, the residue field is a basic construction in commutative algebra.","source_id":"wikipedia.article.residue-field","source_sha256":"4ece439153f1c557f3c55b3209f8a4cbfb754adfe3fd4c5a9df91ce713638214","start":101}],"target_id":"concept.wikipedia.residue-field","target_kind":"node","target_sha256":"b32fd18fb5955fddf6071a20b4dd4112a5b4b596f20b3ebd5b5e461ec7a40e75"}],"concept.wikipedia.rule-induction":[{"id":"assertion.concept.wikipedia.rule-induction","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rule induction as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rule induction\", CC BY-SA 4.0) states: Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","support":[{"end":210,"quote":"Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","source_id":"wikipedia.article.rule-induction","source_sha256":"085c4886d1bddeaff4383842a7d7207f0e81d448b1daaf0e33ea19a20eace32e","start":101}],"target_id":"concept.wikipedia.rule-induction","target_kind":"node","target_sha256":"4a69786c29f1bb4c54d35854308755c92e0ec7bd3e7dd9e7fd621cd00db09025"}],"concept.wikipedia.rule-of-succession":[{"id":"assertion.concept.wikipedia.rule-of-succession","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Rule of succession as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Rule of succession\", CC BY-SA 4.0) states: In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","support":[{"end":264,"quote":"In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","source_id":"wikipedia.article.rule-of-succession","source_sha256":"9bbb5c9c3ee7fdab04ca446782ada4be83d109916c42fef5f9351f64310a9292","start":104}],"target_id":"concept.wikipedia.rule-of-succession","target_kind":"node","target_sha256":"f36661850a0987ba53baa7b2ae8d2bdf41672217f4d1dcbeb90fabaad15a90af"}],"concept.wikipedia.sat":[{"id":"assertion.concept.wikipedia.sat","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"♯SAT as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"♯SAT\", CC BY-SA 4.0) states: In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","support":[{"end":324,"quote":"In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","source_id":"wikipedia.article.sat","source_sha256":"29a934e65626c0ad09461868e1d0e30ac01862353933029ab180a18562d35911","start":92}],"target_id":"concept.wikipedia.sat","target_kind":"node","target_sha256":"6b4616201753a66ed92c3a9224dd4e537aea67cf7a47d039df41ab514a595b27"}],"concept.wikipedia.scalar-implicature":[{"id":"assertion.concept.wikipedia.scalar-implicature","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Scalar implicature as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Scalar implicature\", CC BY-SA 4.0) states: In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","support":[{"end":393,"quote":"In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","source_id":"wikipedia.article.scalar-implicature","source_sha256":"4aff866feff8646a3c8190b843f09ea757c88727a25cdd8fd0bd633ef52d4549","start":106}],"target_id":"concept.wikipedia.scalar-implicature","target_kind":"node","target_sha256":"5ce4dd13e0d1ec923e681d7517a2ef561f67275447c036c96bbfa88c70f6c67f"}],"concept.wikipedia.science-and-technology-studies":[{"id":"assertion.concept.wikipedia.science-and-technology-studies","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Science and technology studies as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Science and technology studies\", CC BY-SA 4.0) states: Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","support":[{"end":463,"quote":"Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","source_id":"wikipedia.article.science-and-technology-studies","source_sha256":"ecb006f21146fee9e262f067e10dc7247da986c5094f64d3dfac3e38fbd2c298","start":116}],"target_id":"concept.wikipedia.science-and-technology-studies","target_kind":"node","target_sha256":"5fad9b14460e4a4d89b53844beeabed346bd348172591413a039adc63ef8478f"}],"concept.wikipedia.science-of-science-policy":[{"id":"assertion.concept.wikipedia.science-of-science-policy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Science of science policy as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Science of science policy\", CC BY-SA 4.0) states: Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","support":[{"end":277,"quote":"Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","source_id":"wikipedia.article.science-of-science-policy","source_sha256":"958fee5d6dd4aab4a63116bdd275ce9d5ee3d902114c88b97b8ddc1f273e8bba","start":113}],"target_id":"concept.wikipedia.science-of-science-policy","target_kind":"node","target_sha256":"d71cc835a682b701f4b72f86b537a00dc8fac12a9168ca28ee175871202c0443"}],"concept.wikipedia.seismic-base-isolation":[{"id":"assertion.concept.wikipedia.seismic-base-isolation","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Seismic base isolation as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Seismic base isolation\", CC BY-SA 4.0) states: Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","support":[{"end":275,"quote":"Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","source_id":"wikipedia.article.seismic-base-isolation","source_sha256":"26c647115ccac54af0fe0592c78b89415826265830ef9db23025cddca33d1a34","start":110}],"target_id":"concept.wikipedia.seismic-base-isolation","target_kind":"node","target_sha256":"7584ee9048acc119e64fb130073eef690adba2dc57cd1938799c4bcdd60b0d2f"}],"concept.wikipedia.semantic-theory-of-truth":[{"id":"assertion.concept.wikipedia.semantic-theory-of-truth","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Semantic theory of truth as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Semantic theory of truth\", CC BY-SA 4.0) states: A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","support":[{"end":238,"quote":"A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","source_id":"wikipedia.article.semantic-theory-of-truth","source_sha256":"74ecd3b8ab8b73555b48fc3dfacff55b0ca1b78a3d6b58eb0815863b23f057cc","start":110}],"target_id":"concept.wikipedia.semantic-theory-of-truth","target_kind":"node","target_sha256":"61c51fa709dd050955b2157c13bd33eb7bde306805b58c9ac889bae860554ad3"}],"concept.wikipedia.semiconductor-device":[{"id":"assertion.concept.wikipedia.semiconductor-device","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Semiconductor device as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Semiconductor device\", CC BY-SA 4.0) states: A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","support":[{"end":329,"quote":"A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","source_id":"wikipedia.article.semiconductor-device","source_sha256":"55ea79a9dbd0982687773239cb285a47ad183ca60da6c21637b5a6dd567a44ec","start":105}],"target_id":"concept.wikipedia.semiconductor-device","target_kind":"node","target_sha256":"2793e1edba59cc65816b8e6170a9adda55368f496d3a17b4a8a5d6f41d7b79d9"}],"concept.wikipedia.sense-data":[{"id":"assertion.concept.wikipedia.sense-data","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sense data as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sense data\", CC BY-SA 4.0) states: The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","support":[{"end":303,"quote":"The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","source_id":"wikipedia.article.sense-data","source_sha256":"11a1c8f1ad407ab2f7b51cf855154ad9069242659a0ee28f0ece8254af7d1045","start":98}],"target_id":"concept.wikipedia.sense-data","target_kind":"node","target_sha256":"a4eab36f023eccdebeaf7b953c41cc5dee17abb7e70c3fad53b261f95f241afa"}],"concept.wikipedia.sensor":[{"id":"assertion.concept.wikipedia.sensor","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sensor as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sensor\", CC BY-SA 4.0) states: A sensor is often defined as a device that receives and responds to a signal or stimulus.","support":[{"end":181,"quote":"A sensor is often defined as a device that receives and responds to a signal or stimulus.","source_id":"wikipedia.article.sensor","source_sha256":"5bcc15d0a9c4331d74dd89bcfeaf7f162758410d4d2d9dd91feba7b9722f1e11","start":92}],"target_id":"concept.wikipedia.sensor","target_kind":"node","target_sha256":"7712079ae9ebc49afc75b3090dbc2565f01cf440e0bf61bd4416982c6b32ea37"}],"concept.wikipedia.signal-processing":[{"id":"assertion.concept.wikipedia.signal-processing","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Signal processing as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Signal processing\", CC BY-SA 4.0) states: Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","support":[{"end":329,"quote":"Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","source_id":"wikipedia.article.signal-processing","source_sha256":"e752d511bedba35151eafd1d6acbe54e3b77888f2bf32e182c3c253881642a0d","start":102}],"target_id":"concept.wikipedia.signal-processing","target_kind":"node","target_sha256":"640e8974a6fc1ee697d8f4f88c9942059e47455394254fb6fe4ab941a6d4a0c5"}],"concept.wikipedia.simple-philosophy":[{"id":"assertion.concept.wikipedia.simple-philosophy","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Simple (philosophy) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Simple (philosophy)\", CC BY-SA 4.0) states: In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","support":[{"end":237,"quote":"In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","source_id":"wikipedia.article.simple-philosophy","source_sha256":"754d4a944e64bc77d00ba6fa79713e51ed9d9b3fc727eba17723ca114bf2c476","start":106}],"target_id":"concept.wikipedia.simple-philosophy","target_kind":"node","target_sha256":"1c5f48242c66b32db0619070f3d97a622956ce7d68c9632d72d9325983842e12"}],"concept.wikipedia.skepticism":[{"id":"assertion.concept.wikipedia.skepticism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Skepticism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Skepticism\", CC BY-SA 4.0) states: Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","support":[{"end":227,"quote":"Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","source_id":"wikipedia.article.skepticism","source_sha256":"58e92278463146ceee62cb4116d7681967c732be3729bb7dc6a87809eb228528","start":95}],"target_id":"concept.wikipedia.skepticism","target_kind":"node","target_sha256":"eba3d765e4037ca0e96ebe5aa3c7e5d7bee95b812814eb75c725ba469dbcdcfe"}],"concept.wikipedia.social-constructionism":[{"id":"assertion.concept.wikipedia.social-constructionism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Social constructionism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Social constructionism\", CC BY-SA 4.0) states: Social constructionism is a term used in sociology, social ontology, and communication theory.","support":[{"end":202,"quote":"Social constructionism is a term used in sociology, social ontology, and communication theory.","source_id":"wikipedia.article.social-constructionism","source_sha256":"fe08bcd1cfdaf05d0967f9b06a7d04f02048167f4b2beaec00b86f2aa3424853","start":108}],"target_id":"concept.wikipedia.social-constructionism","target_kind":"node","target_sha256":"f514e22b35d6b6befa380112c8322172753361be8bcba6ae7b3e50d112e2b349"}],"concept.wikipedia.social-constructivism":[{"id":"assertion.concept.wikipedia.social-constructivism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Social constructivism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Social constructivism\", CC BY-SA 4.0) states: Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","support":[{"end":287,"quote":"Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","source_id":"wikipedia.article.social-constructivism","source_sha256":"209ee0bdff7a727f5e48ab7e86376c7e4d48f911943c25732cfc8d793a28593c","start":107}],"target_id":"concept.wikipedia.social-constructivism","target_kind":"node","target_sha256":"0adfbf8443d9d183d050bce7ed0b2584a59dfad90a53f9d2a855f39d0abfdfeb"}],"concept.wikipedia.sociology-of-absences":[{"id":"assertion.concept.wikipedia.sociology-of-absences","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Sociology of absences as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Sociology of absences\", CC BY-SA 4.0) states: The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","support":[{"end":378,"quote":"The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \\\"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","source_id":"wikipedia.article.sociology-of-absences","source_sha256":"c735d395355723e46fa822f8544aa8c26b830cadd58c6b37f0b1cff8f4e91e48","start":109}],"target_id":"concept.wikipedia.sociology-of-absences","target_kind":"node","target_sha256":"ee0b239f41b984ffadd755bd9128b660b120251f7943c6654c967c830cf94352"}],"concept.wikipedia.square-of-opposition":[{"id":"assertion.concept.wikipedia.square-of-opposition","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Square of opposition as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Square of opposition\", CC BY-SA 4.0) states: In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","support":[{"end":268,"quote":"In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","source_id":"wikipedia.article.square-of-opposition","source_sha256":"abf34788b6ff7149bc7033afce0bbb43b94e43e75d7a1e3b163bb6e52041b642","start":106}],"target_id":"concept.wikipedia.square-of-opposition","target_kind":"node","target_sha256":"0c4521c164bf74a8c35809c25b307c1ad9eb908b63531c78aa3133c0b96e9836"}],"concept.wikipedia.standpoint-feminism":[{"id":"assertion.concept.wikipedia.standpoint-feminism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Standpoint feminism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Standpoint feminism\", CC BY-SA 4.0) states: Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","support":[{"end":269,"quote":"Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","source_id":"wikipedia.article.standpoint-feminism","source_sha256":"1aa655e19e72e3f753f1cc18e25a0d97095b86fe477ad3e9977857e7eac10f64","start":106}],"target_id":"concept.wikipedia.standpoint-feminism","target_kind":"node","target_sha256":"071a42bee7b7dc34ceb6951ba64a377b0deb642f025c43f7e549b4aefdd5ce74"}],"concept.wikipedia.structural-system":[{"id":"assertion.concept.wikipedia.structural-system","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Structural system as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Structural system\", CC BY-SA 4.0) states: The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","support":[{"end":241,"quote":"The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","source_id":"wikipedia.article.structural-system","source_sha256":"e963ec5a9cb7558851c7f2c9c168a9db88e555aa2030e6c4e8a6d37cecb9d50d","start":104}],"target_id":"concept.wikipedia.structural-system","target_kind":"node","target_sha256":"289a2ca92a82e45da696297c22ada2c61d97a350b4a1576da1d86c7f78edea0b"}],"concept.wikipedia.supergeometry":[{"id":"assertion.concept.wikipedia.supergeometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Supergeometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Supergeometry\", CC BY-SA 4.0) states: Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","support":[{"end":221,"quote":"Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","source_id":"wikipedia.article.supergeometry","source_sha256":"776e1321ef26137b628063fa8231537d7b8dab8f945a758899028d976768b82c","start":101}],"target_id":"concept.wikipedia.supergeometry","target_kind":"node","target_sha256":"76d43e5927e22221cb0e9ed073e1fee2df6c9b1ed70778544a01285b57f84a19"}],"concept.wikipedia.supervenience":[{"id":"assertion.concept.wikipedia.supervenience","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Supervenience as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Supervenience\", CC BY-SA 4.0) states: In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","support":[{"end":193,"quote":"In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","source_id":"wikipedia.article.supervenience","source_sha256":"5f09a7a495dcb8744e9927ca84b0970d0c637c0deaf750b4ee532cbdb9c5f8ea","start":99}],"target_id":"concept.wikipedia.supervenience","target_kind":"node","target_sha256":"e8438b1004409fc89749a835016c49c3709d012dc132a047b781874ab524fdf8"}],"concept.wikipedia.tau-mathematics":[{"id":"assertion.concept.wikipedia.tau-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tau (mathematics) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tau (mathematics)\", CC BY-SA 4.0) states: The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","support":[{"end":431,"quote":"The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","source_id":"wikipedia.article.tau-mathematics","source_sha256":"0bfd7bdbd0a93052edbcc4a8bdff448ddd0bb4cecca582e44b49dfabce5daf7d","start":105}],"target_id":"concept.wikipedia.tau-mathematics","target_kind":"node","target_sha256":"ffe5ff874d8031e035f3a1ac68564e020765856d4157ee2dda2eef575310122c"}],"concept.wikipedia.tesla-turbine":[{"id":"assertion.concept.wikipedia.tesla-turbine","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tesla turbine as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tesla turbine\", CC BY-SA 4.0) states: The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","support":[{"end":189,"quote":"The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","source_id":"wikipedia.article.tesla-turbine","source_sha256":"feadd94d4030c508e27cad7b963356e1330b40de2f4915fe5bf1a7ee7c7563ce","start":98}],"target_id":"concept.wikipedia.tesla-turbine","target_kind":"node","target_sha256":"1ad1d1ca230abec42c9087d8816b102195a259e2f291d03844bf02bacd8533f3"}],"concept.wikipedia.testimony":[{"id":"assertion.concept.wikipedia.testimony","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Testimony as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Testimony\", CC BY-SA 4.0) states: Testimony is a solemn attestation as to the truth of a situation.","support":[{"end":159,"quote":"Testimony is a solemn attestation as to the truth of a situation.","source_id":"wikipedia.article.testimony","source_sha256":"42a94493c09ef48622a7a2269d03a435befe7df7c331e36089e8dfa7a0f6ebaf","start":94}],"target_id":"concept.wikipedia.testimony","target_kind":"node","target_sha256":"75a782c8ce7c465089e6650c10a4e91892e9577ec8f0f3456c70cf601a27d67c"}],"concept.wikipedia.the-central-science":[{"id":"assertion.concept.wikipedia.the-central-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"The central science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"The central science\", CC BY-SA 4.0) states: Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","support":[{"end":337,"quote":"Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","source_id":"wikipedia.article.the-central-science","source_sha256":"ff41be6e91ec399f42b16316c22e6246a5436a6ddb89b0c9489e29c55c569740","start":107}],"target_id":"concept.wikipedia.the-central-science","target_kind":"node","target_sha256":"7d41c1e4f89295a1a2aec5d2bcd852e92781b2493f856cd0262290974d427e2c"}],"concept.wikipedia.theory":[{"id":"assertion.concept.wikipedia.theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Theory\", CC BY-SA 4.0) states: A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","support":[{"end":225,"quote":"A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","source_id":"wikipedia.article.theory","source_sha256":"d58d865d0d01d613144121b687b0a0cd6404261e0af7442c8d9bf0bec08ff5f6","start":91}],"target_id":"concept.wikipedia.theory","target_kind":"node","target_sha256":"a2e47008d15f47efc65bafb5f96723edfe02a74f881be41325b24ff0f445fd2a"}],"concept.wikipedia.theory-ladenness":[{"id":"assertion.concept.wikipedia.theory-ladenness","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Theory-ladenness as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Theory-ladenness\", CC BY-SA 4.0) states: In philosophy of science, an observation is said to be \"theory-laden\" when shaped by the investigator's theoretical presuppositions.","support":[{"end":238,"quote":"In philosophy of science, an observation is said to be \\\"theory-laden\\\" when shaped by the investigator's theoretical presuppositions.","source_id":"wikipedia.article.theory-ladenness","source_sha256":"30672bae0aca9b332e4a11a211500a839e657fe54eff62438f4a78ac64954f17","start":104}],"target_id":"concept.wikipedia.theory-ladenness","target_kind":"node","target_sha256":"064efffd4f93688835ede7efd75a104869942f38899d5e361dec87874c9c2cb4"}],"concept.wikipedia.thought-experiment":[{"id":"assertion.concept.wikipedia.thought-experiment","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Thought experiment as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Thought experiment\", CC BY-SA 4.0) states: A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","support":[{"end":206,"quote":"A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","source_id":"wikipedia.article.thought-experiment","source_sha256":"3ef1f506b3cb3c38469d994e28bf5a98c015c349a4a0cf105ad7e4d50eaeb906","start":103}],"target_id":"concept.wikipedia.thought-experiment","target_kind":"node","target_sha256":"12238345ede0a77665cb3452f036fce5491c4ed827d280a808aa57531e783e6e"}],"concept.wikipedia.trivialism":[{"id":"assertion.concept.wikipedia.trivialism","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Trivialism as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Trivialism\", CC BY-SA 4.0) states: Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \"p and not p\" (e.g. the ball is red and not red) are true.","support":[{"end":304,"quote":"Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \\\"p and not p\\\" (e.g. the ball is red and not red) are true.","source_id":"wikipedia.article.trivialism","source_sha256":"f5ddad7a3d1f7f3e7b613d4a1ccacee047fb24128b87c41125db4a49ea3c7989","start":98}],"target_id":"concept.wikipedia.trivialism","target_kind":"node","target_sha256":"4caafc3ab0f3c07305a3797dcb2d228e66b0369440861327a880a9397146de69"}],"concept.wikipedia.trust-social-science":[{"id":"assertion.concept.wikipedia.trust-social-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Trust (social science) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Trust (social science)\", CC BY-SA 4.0) states: Trust is the belief that another person will do what is expected and is built through repeated consistency.","support":[{"end":215,"quote":"Trust is the belief that another person will do what is expected and is built through repeated consistency.","source_id":"wikipedia.article.trust-social-science","source_sha256":"111de50908ca08d59c82e85166916a5b0059d8550b262451d100ef9ad45bb602","start":108}],"target_id":"concept.wikipedia.trust-social-science","target_kind":"node","target_sha256":"63da7490a0d789787326d3026cdbe5e59c1c84f4b86cf17a4d5ad43b6ae7bc45"}],"concept.wikipedia.truth-predicate":[{"id":"assertion.concept.wikipedia.truth-predicate","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Truth predicate as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Truth predicate\", CC BY-SA 4.0) states: In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","support":[{"end":243,"quote":"In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","source_id":"wikipedia.article.truth-predicate","source_sha256":"2eff6019b262e5ed28d134847c35a543a7d5a6f4e48c9df715565bdc25cacef7","start":102}],"target_id":"concept.wikipedia.truth-predicate","target_kind":"node","target_sha256":"daa69b7656f077508785f2331808014edcc209dd2a0196d3022b48d96c77d874"}],"concept.wikipedia.turbine-trip":[{"id":"assertion.concept.wikipedia.turbine-trip","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turbine trip as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turbine trip\", CC BY-SA 4.0) states: A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","support":[{"end":203,"quote":"A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","source_id":"wikipedia.article.turbine-trip","source_sha256":"b546ce5f8b4feda1085b442053dcfa786af55289cc39e5098598d0c71c3064a9","start":100}],"target_id":"concept.wikipedia.turbine-trip","target_kind":"node","target_sha256":"c9c4c88bc960fd11e12a7ecab4981c3978dd3064ae844e3ffd4d162f713fc917"}],"concept.wikipedia.turkey-illusion":[{"id":"assertion.concept.wikipedia.turkey-illusion","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turkey illusion as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turkey illusion\", CC BY-SA 4.0) states: Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","support":[{"end":273,"quote":"Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","source_id":"wikipedia.article.turkey-illusion","source_sha256":"fedae77f612e377f3894e06dc8ca94b97c91d0ff4a0c582c32c971364609cc85","start":103}],"target_id":"concept.wikipedia.turkey-illusion","target_kind":"node","target_sha256":"246f1bb3a0d6368135b5335d488a5d2b37914050112c8634c3eebb351c307c42"}],"concept.wikipedia.turn-angle":[{"id":"assertion.concept.wikipedia.turn-angle","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Turn (angle) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Turn (angle)\", CC BY-SA 4.0) states: The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","support":[{"end":258,"quote":"The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","source_id":"wikipedia.article.turn-angle","source_sha256":"36ee5592ad24f2edd55c4b8924dea845d553d0636e208ed52a78494396b4fe4d","start":98}],"target_id":"concept.wikipedia.turn-angle","target_kind":"node","target_sha256":"5e5f5c34590e053bf0ce8b2e831b5971a6bba001be74f21b5f0e6c0aea9015c1"}],"concept.wikipedia.valve":[{"id":"assertion.concept.wikipedia.valve","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Valve as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Valve\", CC BY-SA 4.0) states: A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","support":[{"end":298,"quote":"A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","source_id":"wikipedia.article.valve","source_sha256":"554241121eaf1f0fe8bbc9a5e6ea907f4889445e7d771b4d5c745dab07adb16a","start":90}],"target_id":"concept.wikipedia.valve","target_kind":"node","target_sha256":"3cbae4d15992c2298adf36eb03365cf14148041dbae68685af0daaba59682c6c"}],"concept.wikipedia.valve-actuator":[{"id":"assertion.concept.wikipedia.valve-actuator","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Valve actuator as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Valve actuator\", CC BY-SA 4.0) states: A valve actuator is the mechanism for opening and closing a valve.","support":[{"end":167,"quote":"A valve actuator is the mechanism for opening and closing a valve.","source_id":"wikipedia.article.valve-actuator","source_sha256":"15d0e0a10b4b1c496583d7c786b0005b48c8e1356da5bfbe1b55ba816fbafb7b","start":101}],"target_id":"concept.wikipedia.valve-actuator","target_kind":"node","target_sha256":"838ddf74f058c6ba8420465f6f487e17fe1204533faea4f3d1274e136a087d6c"}],"concept.wikipedia.veridicality":[{"id":"assertion.concept.wikipedia.veridicality","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Veridicality as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Veridicality\", CC BY-SA 4.0) states: In linguistics, veridicality (from Latin \"truthfully said\") is a semantic or grammatical assertion of the truth of an utterance.","support":[{"end":230,"quote":"In linguistics, veridicality (from Latin \\\"truthfully said\\\") is a semantic or grammatical assertion of the truth of an utterance.","source_id":"wikipedia.article.veridicality","source_sha256":"41bad4cadb253d6362b827fb4b0a24cf4b55f543c19d8b2498a9cb1df275ad8d","start":100}],"target_id":"concept.wikipedia.veridicality","target_kind":"node","target_sha256":"7403cb75dac3aa51bf7c911c486c79ee7c419da6c68637e96ad02c41b22a272a"}],"concept.wikipedia.vietoris-rips-filtration":[{"id":"assertion.concept.wikipedia.vietoris-rips-filtration","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Vietoris–Rips filtration as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Vietoris–Rips filtration\", CC BY-SA 4.0) states: In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \"Rips filtration\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","support":[{"end":379,"quote":"In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \\\"Rips filtration\\\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","source_id":"wikipedia.article.vietoris-rips-filtration","source_sha256":"73e601c17f170be7ca578d567afee5be6a16551d85ff93ea82060ea2ff7df1c1","start":112}],"target_id":"concept.wikipedia.vietoris-rips-filtration","target_kind":"node","target_sha256":"929ab13f22330730b18b973f9d6810da070271f4f906c2926a3abaf3a279146f"}],"concept.wikipedia.virtue-epistemology":[{"id":"assertion.concept.wikipedia.virtue-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Virtue epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Virtue epistemology\", CC BY-SA 4.0) states: Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","support":[{"end":250,"quote":"Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","source_id":"wikipedia.article.virtue-epistemology","source_sha256":"a671f9303a09749e96c07c9ed87c882ec69018e215f8bb9326a7df188abe8736","start":106}],"target_id":"concept.wikipedia.virtue-epistemology","target_kind":"node","target_sha256":"4585e37ad0504b1265e72f2df36eb72244b3d6fe983c155434868564967e2672"}],"concept.wikipedia.welder":[{"id":"assertion.concept.wikipedia.welder","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welder as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welder\", CC BY-SA 4.0) states: A welder is a person or equipment that fuses materials together.","support":[{"end":156,"quote":"A welder is a person or equipment that fuses materials together.","source_id":"wikipedia.article.welder","source_sha256":"b853afa7c759df66ad8f9be17c6a0e6c2bac3d6d528df1c5350aa06093b5a682","start":92}],"target_id":"concept.wikipedia.welder","target_kind":"node","target_sha256":"5b0fffe34dc03cfe9c3c138e7c82dc13d07355a555f9b71418b1db80f85f37ce"}],"concept.wikipedia.welder-certification":[{"id":"assertion.concept.wikipedia.welder-certification","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welder certification as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welder certification\", CC BY-SA 4.0) states: Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","support":[{"end":310,"quote":"Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","source_id":"wikipedia.article.welder-certification","source_sha256":"7957a47470d781ccfb952478f28fa383b50cb38dde78b1e9948bf50b5e6b26e8","start":107}],"target_id":"concept.wikipedia.welder-certification","target_kind":"node","target_sha256":"96bed595bc43584cde805bf7cfad19a0dc3f1266858f570fed1aa3230fb14d94"}],"concept.wikipedia.welding":[{"id":"assertion.concept.wikipedia.welding","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Welding as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Welding\", CC BY-SA 4.0) states: Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","support":[{"end":284,"quote":"Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","source_id":"wikipedia.article.welding","source_sha256":"cbe135c90548c52231249e991de6467a33ef4499da262067ec3349710aa5df5d","start":92}],"target_id":"concept.wikipedia.welding","target_kind":"node","target_sha256":"5133d13897327fe3b297b3b90e00d8afb4e07709b24f0d7867239960889c2975"}],"concept.wimp-parameter-space":[{"id":"assertion.complete.concept.wimp-parameter-space","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Mass-cross-section region constrained by direct searches.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"concept.wimp-parameter-space","target_kind":"node","target_sha256":"3e8138d2ec612b7739cfdb4cdf3cd9cb66903ba47c3dbb438d6fa78047029090"}],"dataset.admx-run1b":[{"id":"assertion.complete.dataset.admx-run1b","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2018 search data covering 2.81-3.31 micro-eV.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"dataset.admx-run1b","target_kind":"node","target_sha256":"c6e6f04db3fcd198c99ca93d142f1d103c8b717057f6decd8752ba6c5f302a5f"}],"dataset.fermi-grb090510-photons":[{"id":"assertion.complete.dataset.fermi-grb090510-photons","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The photon observations of GRB090510 collected by Fermi-LAT are analyzed in the cited work to constrain energy-dependent vacuum dispersion, under its stated source and propagation assumptions.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"dataset.fermi-grb090510-photons","target_kind":"node","target_sha256":"ad3b6eb667f0bad7fd6ce75b5658d7924bb1776bea8b46287eb6ca08f075aa67"}],"dataset.grb090510":[{"id":"assertion.complete.dataset.grb090510","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: GRB090510 is a gamma-ray burst observed by Fermi-LAT whose emission was used in the cited conditional vacuum-dispersion analysis. This record denotes the burst; its photon observations have a separate dataset record.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"dataset.grb090510","target_kind":"node","target_sha256":"e3cceb04e9e3e38d54fce7dfab651dc41a628c0c48afb8b2b4751f227f38d7b7"}],"dataset.lz-4p2-tonne-year":[{"id":"assertion.complete.dataset.lz-4p2-tonne-year","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP-search analysis has a total exposure of 4.2 ± 0.1 tonne-years over 280 live days. This record denotes that exposure quantity; the associated detector data have a separate dataset record.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"dataset.lz-4p2-tonne-year","target_kind":"node","target_sha256":"71d6ca07377db1278856ddad47d315e2b0fd0044a578125c89e47bea5b83e5df"}],"dataset.lz-wimp-280-live-days":[{"id":"assertion.complete.dataset.lz-wimp-280-live-days","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ WIMP-search analysis uses detector data corresponding to 4.2 ± 0.1 tonne-years of total exposure over 280 live days. It reports no excess over expected backgrounds.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"dataset.lz-wimp-280-live-days","target_kind":"node","target_sha256":"905fc23c916e4bd6e3d66274e670347c08b99d3d22492b85f4c9fbec3b5768d8"}],"dataset.ogle-five-year-events":[{"id":"assertion.complete.dataset.ogle-five-year-events","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2622 Galactic-bulge microlensing events used for PBH constraints.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"dataset.ogle-five-year-events","target_kind":"node","target_sha256":"819b26e67bcbae0bb65e4e163dea13185d27aca271b01179f4b4e09db519a871"}],"dataset.xq100-hires-mike":[{"id":"assertion.complete.dataset.xq100-hires-mike","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Quasar spectra used in cited fuzzy-DM limits.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"dataset.xq100-hires-mike","target_kind":"node","target_sha256":"44d81fd0da28b38fc52aadc76934158ac915dfbb16d6d46b54b829f721372dde"}],"engineering.biaxially-textured-ybco-tapes-1996":[{"id":"assertion.hts.04","scope":{"assumptions":["Thermomechanical substrate texture followed by epitaxial metal and/or ceramic buffer deposition"],"population":"Epitaxial YBa2Cu3Ox films on biaxially textured, buffered metal substrates","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1996","uncertainty":"Publisher-deposited abstract retained through Crossref; the exponent formatting in the current-density value is ambiguous and no numeric Jc is claimed. Long-length manufacturing is a potential route, not established commercial output.","units":{"field":"zero field","temperature":"K"}},"statement":"Goyal et al. reported a route using industrially scalable thermomechanical texturing of flexible metal substrates followed by epitaxial buffer layers and YBa2Cu3Ox films; the deposited films carried critical currents at 77 K in zero field and had field dependencies similar to epitaxial films on single-crystal ceramic substrates.","support":[{"end":1309,"quote":"A method to obtain long lengths of flexible, biaxially oriented substrates with smooth, chemically compatible surfaces for epitaxial growth of high-temperature superconductors is reported. The technique uses well established, industrially scalable, thermomechanical processes to impart a strong biaxial texture to a base metal. This is followed by vapor deposition of epitaxial buffer layers (metal and\\/or ceramic) to yield chemically compatible surfaces. Epitaxial YBa2Cu3Ox films grown on such substrates have critical current densities exceeding 105 A\\/cm2 at 77 K in zero field and have field dependencies similar to epitaxial films on single crystal ceramic substrates. Deposited conductors made using this technique offer a potential route for the fabrication of long lengths of high-Jc wire capable of carrying high currents in high magnetic fields and at elevated temperatures.","source_id":"source.goyal-rabits-1996","source_sha256":"232bb4f07a74ff459b0ce8dfd0625fdfb685079b3452bfb9254debf07c399037","start":423}],"target_id":"engineering.biaxially-textured-ybco-tapes-1996","target_kind":"node","target_sha256":"279798f4a3962db3f109f28aaeaf339e3db3b4654bcf1a2a7d0d3b9e926a6d11"}],"engineering.tfmc-demountable-nanohm-joints":[{"id":"assertion.hts.10","scope":{"assumptions":["Conditions are joint temperature 20 K and local field up to 12 T"],"population":"Fifteen internal pancake-to-pancake joints in TFMC","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"Not resistance-free, not measured at 20.1 T joint field, and not a demonstrated repeatedly remountable reactor lifetime.","units":{"magnetic_field":"T (joint field)","resistance":"nanohm","temperature":"K"}},"statement":"Hartwig et al. reported fifteen internal demountable pancake-to-pancake TFMC joints operating with resistance in the 0.5–2.0 nanohm range at 20 K and magnetic fields up to 12 T.","support":[{"end":8308,"page":2,"quote":"Fifteen  internal  demountable  pancake-to-pancake  joints                       T 2018  and  2021             to  retire  the  design,  fabrication,  and\noperated in the 0.5 to 2.0 nΩ range at 20 K and in magnetic                      operational     risks     inherent     in     large  -scale,     high-field\nfields   up   to   12   T.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":7970}],"target_id":"engineering.tfmc-demountable-nanohm-joints","target_kind":"node","target_sha256":"1026ab72e960837eb8aa9cda347f555c83eb162522a88f6b715a285b11a0e001"}],"engineering.tfmc-nint-stack-in-plate":[{"id":"assertion.hts.08","scope":{"assumptions":["NINT denotes no insulation–no twist; modular stack-in-plate construction"],"population":"The built representative-scale TFMC winding pack and assembly","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2018–2021 program; 2023 author preprint","uncertainty":"This is an implemented magnet architecture, not a claim of unconditional passive quench protection or a completed tokamak power plant.","units":{"mass":"kg","pancakes":"count","tape_length":"km"}},"statement":"Hartwig et al. described the built TFMC as a no-insulation, no-twist REBCO stack-in-plate magnet using 270 km of tape, weighing 10058 kg, with 16 single-pancake modules and two termination plates. REBCO stacks occupy spiral plate channels, with single-pass supercritical-helium coolant channels on the other side; vacuum-pressure solder impregnation provides mechanical protection and thermal/electrical connectivity.","support":[{"end":72497,"page":10,"quote":"The   TFMC,  shown  at  the  bottom-left  of           Fig.  1  and  as  a           backed  by  Leybold  Ecodry  35  scroll  pumps. The  scroll\ndetailed CAD rendering in Fig. 4, is a non-insulated, REBCO                             pumps  were  located  outside  of  the  35-gauss  line  of  the\nstack-in-plate,     style   superconducting   magnet.   It   weighed                    TFMC  with the turbos enclosed within 1-inch thick iron\n10,058 kg and utilized 270 km of REBCO. It has three main                               magnetic shields. High vacuum in the 10-6 to 10-7 torr range\ncomponents: (1) the winding pack; (2) the structural case; and                          was routinely achieved during experiments.\n(3) the plena. The winding pack is composed of a stack of 16                       •    LN2 radiation shields and distribution system: Radiation\nsingle pancakes with 2 termination plates top and bottom. The                           shields, consisting of modules of two steel panels with a\npancakes  are  Nitronic-40  radial  plates  machined with  spiral                       thin interstitial space for LN2, were also designed at MIT\nchannels on one side for the REBCO tape stack and single-pass                           and  built  by    an  external  vendor.      They  were  assembled\nchannels on the opposite side for supercritical helium              coolant.            within the vacuum cryostat. The LN2 was gravity fed from\nAfter REBCO winding and pancake assembly is complete, the                               two storage dewars adjacent to the vacuum cryostat, which\npancake  undergoes  a  vacuum-pressure  impregnation  solder                            were provided with  LN2 from an 18,000 external gallon\nprocess to provide good mechanical protection of the REBCO                              storage tank.\nstack    and    efficient    thermal    and    electrical    connectivity          •    Power   supply:       The   system   was   delivered   by   Alpha\nthroughout each pancake.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":70469},{"end":64853,"page":9,"quote":"C. Selection of NINT for the TFMC winding pack                                    and the absence of high voltage insulation makes production of\n   At the conclusion of the first phase of TFMC in June 2019,                     NI magnets relatively efficient and scalable. In particular, the\na review  was  held  to  assess  the results  from the  VIPER  and                use of REBCO as opposed to LTS materials and the absence of\nNINT development programs with the objective of selecting the                     an epoxy vacuum pressure impregnation step eliminates two of\ntechnology     that  would  be  scaled-up       into  the  TFMC  and,  if         the   most   complex,   long   duration   high   temperature   heat\nsuccessful, the SPARC TF. Design and analysis based on the                        treatment  operations  involved  in  traditional  insulated  LTS\nexperimental and modelling results from the VIPER and NINT                        CICC  superconducting  fusion  magnets.  Because  the  magnet\ndevelopment                                                                       winding  pack  is  not  encased  in  VPI  epoxy  and  because\nprograms showed that either technology could successfully be                      demountable  pancake-to-pancake  joints             can  be    used,  NINT\nused as the base magnet winding pack technology to achieve                        magnets   can   be   fully   disassembled   for   maintenance   or\nthe necessary requirements for both the TFMC and the SPARC                        component    replacement    without    destructive    operations.\nTF. Ultimately, NINT technology was selected for the TFMC                         Finally, the intrinsic low voltage nature of NINT eliminates the\non the basis of the proposed advantages summarized in Table II                    need   for   high   voltage   current       leads   and   feeder   cables,\nalthough, as discussed at the end of this section, VIPER cable                    traditionally  one  of  the  most  challenging         parts  of  insulated\nwas utilized in several ways in the        TFMC Program.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":62719}],"target_id":"engineering.tfmc-nint-stack-in-plate","target_kind":"node","target_sha256":"0c7fa08bdb3c4c63ab67052b0ace533652a4289abea70e9102af4c4ec297b593"}],"engineering.ybco-y2o3-high-field-wire-2021":[{"id":"assertion.hts.07","scope":{"assumptions":["Field B parallel to c (normal to tape surface); JE averages over complete wire cross-section; specified substrate and stabilizer thickness"],"population":"Reported industrial wire output and the specified tested YBCO/Y2O3 tape specimens","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"Paper published in 2021","uncertainty":"Not every delivered length is claimed to exceed these JE values; selected measurements and production volume have different populations. No claim that these exact lots compose the entire TFMC.","units":{"engineering_current_density":"A/mm²","length":"km","magnetic_field":"T","temperature":"K","thickness":"micrometres","width":"mm"}},"statement":"Molodyk et al. reported over 300 km of 4 mm-wide YBCO wire manufactured in nine months, with most delivered to CFS. In tested B-parallel-c samples with a 40 micrometre substrate and 5 micrometre copper stabilizer per side, engineering current density exceeded 1000 A/mm² at 20 K and 20 T and 2000 A/mm² at 4.2 K and 20 T; the formulation used Y2O3 nanoparticles without c-axis-correlated nanocolumnar defects.","support":[{"end":14548,"page":2,"quote":"In 9  months, we manufactured over 300  km of 4  mm wide YB CO wire, delivering most of it to CFS. This has\n                                                been the largest completed order in the histor y of the 2G HTS wire industr y. We fabricated the wire on a strong\n                                                Hastelloy C276 substrate with a buffer layer architecture based on MgO textured using ion beam assisted depo-\n                                                sition and with the HTS layer grown by pulsed laser deposition (PLD), as explained in the Methods section.\n                                                The YB CO layer contains uniformly distributed  Y2O3 nanoparticles with (001) and (110) axial orientation, with\n                                                the average density of 4000                 ± 2000 μm-2. Microstructural analysis is presented in Supplementar y Information.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":13632},{"end":16218,"page":2,"quote":"Superconducting  properties  in  high  magnetic  field.                                                                                                                   In Fig.  1a we present the superconducting per                  -\n                                                formance at low temperature and high magnetic field oriented perpendicular to the wire surface (B//c) of three\n                                                representative YB CO wires measured at high field facilities in Switzerland, Japan and the USA. The samples dif-\n                                                fered in substrate thickness: 40, 60 and 100 µm and YB CO layer thickness: 2.55, 2.82 and 3.28 µm, respectively.\n                                                In all three samples ver y high values of critical current were achieved, among the best reported to date for com-\n                                                mercial 2G HTS                   wire7,26,30–34                                                                              . In particular, an I                              c at 20  K, 20  T in the 220–270 A/4  mm range and an I                              c at 4.2  K,\n                                                20 T in the 450–570 A/4 mm range were measured. Record J                              E values for commercial wires of over 1000 A/mm2\n                                                at 20   K, 20   T and over 2000 A/mm2 at 4.2   K, 20   T were established for 40   μm substrate with 5   μm per side of\n                                                stabilising copper.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":14598},{"end":4134,"page":1,"quote":"We demonstrate a novel YBCO superconductor formulation without\n                                                          the c-axis correlated nano-columnar defects that are widely believed to be prerequisite for high\n                                                          in-field performance.","source_id":"source.molodyk-mit-paper","source_sha256":"2ea59e4d3b460a97d397f5deb52c005e88347a7ed34fe062225444e92d6bdbcb","start":3837}],"target_id":"engineering.ybco-y2o3-high-field-wire-2021","target_kind":"node","target_sha256":"05a7573184051f7a762d9c3a190174d4fd1ae93f101d8d74866d1dad5ed39e31"}],"event.bullet-cluster":[{"id":"assertion.complete.event.bullet-cluster","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The Bullet Cluster is a merging-cluster system used in the cited studies to investigate dark-matter interactions. The finite-range-force analysis considers possible effects on collision velocity and post-collision separation of dark matter and galaxies.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":2381,"quote":"We review theories of dark matter (DM) beyond the collisionless paradigm, known as self-interacting dark matter (SIDM), and their observable implications for astrophysical structure in the Universe. Self-interactions are motivated, in part, due to the potential to explain long-standing (and more recent) small scale structure observations that are in tension with collisionless cold DM (CDM) predictions. Simple particle physics models for SIDM can provide a universal explanation for these observations across a wide range of mass scales spanning dwarf galaxies, low and high surface brightness spiral galaxies, and clusters of galaxies. At the same time, SIDM leaves intact the success of $\\Lambda$CDM cosmology on large scales. This report covers the following topics: (1) small scale structure issues, including the core-cusp problem, the diversity problem for rotation curves, the missing satellites problem, and the too-big-to-fail problem, as well as recent progress in hydrodynamical simulations of galaxy formation; (2) N-body simulations for SIDM, including implications for density profiles, halo shapes, substructure, and the interplay between baryons and self-interactions; (3) semi-analytic Jeans-based methods that provide a complementary approach for connecting particle models with observations; (4) merging systems, such as cluster mergers (e.g., the Bullet Cluster) and minor infalls, along with recent simulation results for mergers; (5) particle physics models, including light mediator models and composite DM models; and (6) complementary probes for SIDM, including indirect and direct detection experiments, particle collider searches, and cosmological observations. We provide a summary and critical look for all current constraints on DM self-interactions and an outline for future directions.","source_id":"completion-source.495bd78c68aa1596d994","source_sha256":"7add5fe1b98d3f97f006857a5ad1a04b37c36be497e2f7eb35652b95a47ee519","start":561}],"target_id":"event.bullet-cluster","target_kind":"node","target_sha256":"f53fbe4bc53ba095b8254f1ead16448d0d3584560e787d6360fab7c0e5eefcfe"}],"evidence.admx-dfsz-exclusion":[{"id":"assertion.complete.evidence.admx-dfsz-exclusion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX Run 1B analysis excludes DFSZ axions over 680–790 MHz except for mode-crossing gaps, assuming axions supply 100% of the dark-matter density.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"evidence.admx-dfsz-exclusion","target_kind":"node","target_sha256":"3c01df78ccc646428864d61d25552f7532171da9b5e95263a0cf9a11a07297ac"}],"evidence.bmv-proposal-2017":[{"id":"assertion.complete.evidence.bmv-proposal-2017","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: 2017 laboratory entanglement-witness proposal.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615},{"end":1105,"quote":"We provide brief answers to a number of recurring questions about the BMV effect and the related experimental proposal (Bose et al., 2017; Marletto and Vedral, 2017). Some of these questions include alleged counter-examples to our result, stating that if gravity (or anything mediating the interaction) can create entanglement while complying with locality, then it must then be non-classical. Here we explain why these objections are not counter-examples and why our result still stands; we also explore a few other important subtleties often disregarded on a first read of our paper (Marletto and Vedral, 2017).","source_id":"completion-source.b0684b58644cb3ab135c","source_sha256":"8f9b9ee23bbaa60ef23eb04b9f1c91a1df138a89248fece1782281c1364e4953","start":492}],"target_id":"evidence.bmv-proposal-2017","target_kind":"node","target_sha256":"877adc97a859d7207976c682219c7c90ae794fe45e908164f6bdfb5e0d5df1c3"}],"evidence.fuzzy-dm-lyman-alpha-limit":[{"id":"assertion.complete.evidence.fuzzy-dm-lyman-alpha-limit","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Cited analysis sets lower mass limits under thermal-history assumptions.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"evidence.fuzzy-dm-lyman-alpha-limit","target_kind":"node","target_sha256":"9e32c39ebf5217792df96eec9bcd8d7f64732629bfe6107223572eaf0f8d350b"}],"evidence.lz-crdm-null-2025":[{"id":"assertion.complete.evidence.lz-crdm-null-2025","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: No excess above background in cited boosted-DM search.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"evidence.lz-crdm-null-2025","target_kind":"node","target_sha256":"95badcbe7646d511fe8d51fde2e1a84afafaeab6f964c8514a2bce0276a7c7b3"}],"evidence.lz-null-2024":[{"id":"assertion.complete.evidence.lz-null-2024","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: No excess over expected backgrounds in cited WIMP search.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"evidence.lz-null-2024","target_kind":"node","target_sha256":"4abf970133a2eeac7690a70040d269a5b75397d149ee82179301bb852a99ed07"}],"evidence.ogle-pbh-constraint":[{"id":"assertion.complete.evidence.ogle-pbh-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Microlensing sample constrains PBH abundance in Earth-Jupiter mass range.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"evidence.ogle-pbh-constraint","target_kind":"node","target_sha256":"704663dd5d7d240ee49561581fc3da55793294214782f39e57baecf70948c4fa"}],"evidence.qg-liv-constraint-2013":[{"id":"assertion.complete.evidence.qg-liv-constraint-2013","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Fermi data disfavors some Planck-scale linear-dispersion models.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"evidence.qg-liv-constraint-2013","target_kind":"node","target_sha256":"e4ea8ad3d2d5ac924877928fe227204ff6b8eec67c036574c730200d900822cc"}],"field.aat.300054162":[{"id":"assertion.field.aat.300054162","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural history as defined in the captured Getty AAT record 300054162","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural history as: Study of the development over time of the human built environment.","support":[{"end":501,"quote":"Study of the development over time of the human built environment.","source_id":"getty-aat.300054162","source_sha256":"8c446b144dd2ae817b202e844cf0b23934c9f394eee2ca1d262eaa345606f4c8","start":435}],"target_id":"field.aat.300054162","target_kind":"node","target_sha256":"089e0383b3042aa3dec880e448134e88e12826043a6f264519979227148b32f4"}],"field.aat.300054233":[{"id":"assertion.field.aat.300054233","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art history as defined in the captured Getty AAT record 300054233","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art history as: Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","support":[{"end":721,"quote":"Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","source_id":"getty-aat.300054233","source_sha256":"05f0259ddef9c12b8671493f4f6b6da54bd8ac2cba0320fb09258fa0cf76c36e","start":425}],"target_id":"field.aat.300054233","target_kind":"node","target_sha256":"059b7401f4014537e9d8f5b65f10286129b86569ea2d16201bcd481c7d4d467f"}],"field.aat.300054240":[{"id":"assertion.field.aat.300054240","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"musicology as defined in the captured Getty AAT record 300054240","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","support":[{"end":598,"quote":"Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","source_id":"getty-aat.300054240","source_sha256":"628d6177e23f40d8ef6bce1f4cfe5b9a2fea6252b8f063673537711d57260f90","start":424}],"target_id":"field.aat.300054240","target_kind":"node","target_sha256":"d30027c4896aa5afd898ab5887bacc38ffb61a42581bd48e98e70e828f1b671f"}],"field.aat.300054241":[{"id":"assertion.field.aat.300054241","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ethnomusicology as defined in the captured Getty AAT record 300054241","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ethnomusicology as: Branch of musicology focusing on the study of music in its cultural context.","support":[{"end":485,"quote":"Branch of musicology focusing on the study of music in its cultural context.","source_id":"getty-aat.300054241","source_sha256":"d471ea0ca72ac46d48e4c6bf56d8edb515470e77854b21130d01509ea436e418","start":409}],"target_id":"field.aat.300054241","target_kind":"node","target_sha256":"9b76e12cc70557ee0298f9cc4bf66131151a66069f73f5a3c4f637003f271eab"}],"field.aat.300054245":[{"id":"assertion.field.aat.300054245","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"linguistics as defined in the captured Getty AAT record 300054245","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","support":[{"end":625,"quote":"Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","source_id":"getty-aat.300054245","source_sha256":"4c78f04b65bcaeda4650619eb0a471da1289c4ab83cf7ec50d4ae762b213d4b5","start":418}],"target_id":"field.aat.300054245","target_kind":"node","target_sha256":"0ef82225111b7b1eb24f7dded0e7aea00db697ae6520483e12ac111030553c7c"}],"field.aat.300054247":[{"id":"assertion.field.aat.300054247","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"applied linguistics as defined in the captured Getty AAT record 300054247","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines applied linguistics as: Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","support":[{"end":657,"quote":"Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","source_id":"getty-aat.300054247","source_sha256":"a1e7e97e85e2dee33aa15ad53949dfd53f2b615b6f064ed97d89129d93b058d0","start":427}],"target_id":"field.aat.300054247","target_kind":"node","target_sha256":"ca37d3ccef43018a6c3a0c04cc74fb3fadd9d705f6712b0fb4d4a37db7f77172"}],"field.aat.300054248":[{"id":"assertion.field.aat.300054248","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"anthropological linguistics as defined in the captured Getty AAT record 300054248","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines anthropological linguistics as: Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","support":[{"end":553,"quote":"Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","source_id":"getty-aat.300054248","source_sha256":"f7dd4c1c84dfc641a87ce7d022173d4402e29ac9a548745e524ee21e67bc3b06","start":417}],"target_id":"field.aat.300054248","target_kind":"node","target_sha256":"61041d0d305c5084d5051777ea954d6d4136d250aeacd4f0a1aa02f43b23d57a"}],"field.aat.300054250":[{"id":"assertion.field.aat.300054250","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"computational linguistics as defined in the captured Getty AAT record 300054250","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines computational linguistics as: Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","support":[{"end":601,"quote":"Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","source_id":"getty-aat.300054250","source_sha256":"2bbebc03073ab9bf89c3ac9f94edbd7baf9f2406eeb275a0893686bad5086fc8","start":415}],"target_id":"field.aat.300054250","target_kind":"node","target_sha256":"9853d8a6fc4011408a05a6f89f87acaa0db514def0aa5869e9f542715113ae94"}],"field.aat.300054251":[{"id":"assertion.field.aat.300054251","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"graphemics as defined in the captured Getty AAT record 300054251","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines graphemics as: Study of writing systems and of their relation to speech.","support":[{"end":461,"quote":"Study of writing systems and of their relation to speech.","source_id":"getty-aat.300054251","source_sha256":"1d8ecc39b110ba74705f8059840af80ce792982b4083356465ea0a2d4abc4525","start":404}],"target_id":"field.aat.300054251","target_kind":"node","target_sha256":"13899441bddfe016ac1dea610641a2f9d7cbda6a9694f394879622013e2b59e2"}],"field.aat.300054254":[{"id":"assertion.field.aat.300054254","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"semiotics as defined in the captured Getty AAT record 300054254","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","support":[{"end":572,"quote":"Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","source_id":"getty-aat.300054254","source_sha256":"fb27eb8544ba14857ff22bf9014021a284cce9e3f84e9c276e76b1a5b51364ac","start":437}],"target_id":"field.aat.300054254","target_kind":"node","target_sha256":"d4e1b95d09da68ebcaef2b58d11e4b4de0f12065c5edf3b48b718c0697f578d6"}],"field.aat.300054255":[{"id":"assertion.field.aat.300054255","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"sociolinguistics as defined in the captured Getty AAT record 300054255","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.","support":[{"end":519,"quote":"The study of language as it functions in society, and of the interaction between linguistic and social variables.","source_id":"getty-aat.300054255","source_sha256":"f32e5d80bd60b3349604c5cb3db90666647c29197c5b79acb2b7baed7ce27a8e","start":406}],"target_id":"field.aat.300054255","target_kind":"node","target_sha256":"25a4c8b5d07b523ab298a8736772808e98f601dfaa6b8879e40a645b022ec82e"}],"field.aat.300054256":[{"id":"assertion.field.aat.300054256","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"theoretical linguistics as defined in the captured Getty AAT record 300054256","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","support":[{"end":639,"quote":"Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","source_id":"getty-aat.300054256","source_sha256":"d87b021cf97f7e4fa5287d8a121abfdd959fa07dd5d20f8f610ee9c4199138f1","start":431}],"target_id":"field.aat.300054256","target_kind":"node","target_sha256":"0ebe667d0d81a0518b55dac832eff7c5d6aaf9d45826bb48fcde5db7774f2a04"}],"field.aat.300054257":[{"id":"assertion.field.aat.300054257","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"historical linguistics as defined in the captured Getty AAT record 300054257","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines historical linguistics as: Study of the development of or changes in words, speech, and language or groups of languages over time.","support":[{"end":519,"quote":"Study of the development of or changes in words, speech, and language or groups of languages over time.","source_id":"getty-aat.300054257","source_sha256":"7bbfd58d035735b3e009baef334761a43664be5667b76cf1896041feb545203b","start":416}],"target_id":"field.aat.300054257","target_kind":"node","target_sha256":"d521d8fcbed6345e6eae4d52ab2bb3aba61c3972c8b25c2a93ed996ed7a0f26c"}],"field.aat.300054258":[{"id":"assertion.field.aat.300054258","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"metalinguistics as defined in the captured Getty AAT record 300054258","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines metalinguistics as: Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","support":[{"end":515,"quote":"Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","source_id":"getty-aat.300054258","source_sha256":"331efa37f810e9f97ff24bd36218dd4c6c75f7b390b8e809879f6c564c8daba4","start":409}],"target_id":"field.aat.300054258","target_kind":"node","target_sha256":"26828596f16b13d0ae5651884453d51ac56157b9891b87569d7c48e8da3bf7ff"}],"field.aat.300054262":[{"id":"assertion.field.aat.300054262","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phonetics as defined in the captured Getty AAT record 300054262","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phonetics as: Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","support":[{"end":643,"quote":"Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","source_id":"getty-aat.300054262","source_sha256":"885d2dc98d95c32e323f35711dfd9ba56f9c36798be957a8b708dadabe7f2c18","start":403}],"target_id":"field.aat.300054262","target_kind":"node","target_sha256":"794415625bb8a6bccd2f613be24233fd25aa1f3c51d64435a59e34e0124a153e"}],"field.aat.300054263":[{"id":"assertion.field.aat.300054263","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phonology as defined in the captured Getty AAT record 300054263","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","support":[{"end":632,"quote":"Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","source_id":"getty-aat.300054263","source_sha256":"0b3e5b7c9e0913f303a6dc38da3f737c515cee2c02ad919dc21bf5c7976f6431","start":403}],"target_id":"field.aat.300054263","target_kind":"node","target_sha256":"40eff5869e0cba7a7f0bce7533e514cf88ea1f120ccfaf59c62f46f096d5f438"}],"field.aat.300054264":[{"id":"assertion.field.aat.300054264","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"pragmatics as defined in the captured Getty AAT record 300054264","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.","support":[{"end":509,"quote":"Study of the aspects of meaning in language that are related to the use of language in a natural context.","source_id":"getty-aat.300054264","source_sha256":"a49970291aac2368c04b994d03f51262ee4a457bc2c2fcdb33852e1ac14185a8","start":404}],"target_id":"field.aat.300054264","target_kind":"node","target_sha256":"63111ab3bc2b99e43f3b71b63407db11e6f3ec5543f533b03c2128d87aaad0f5"}],"field.aat.300054268":[{"id":"assertion.field.aat.300054268","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"semantics as defined in the captured Getty AAT record 300054268","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines semantics as: Study of meanings in language and of changes in those meanings.","support":[{"end":466,"quote":"Study of meanings in language and of changes in those meanings.","source_id":"getty-aat.300054268","source_sha256":"ac5808180065a924b1c0da939ae2bdb2e2bd24a476d8df41cb1a560f31181afa","start":403}],"target_id":"field.aat.300054268","target_kind":"node","target_sha256":"bd4f17728869602e04d55487c379ca669aff58260789f344a0ca8e68bbdfa0eb"}],"field.aat.300054273":[{"id":"assertion.field.aat.300054273","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary studies as defined in the captured Getty AAT record 300054273","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary studies as: Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","support":[{"end":1003,"quote":"Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","source_id":"getty-aat.300054273","source_sha256":"cd5dd94c1ef7226014396c53f441d3bebce115676e4ab71d6b5532ed8f559ba8","start":403}],"target_id":"field.aat.300054273","target_kind":"node","target_sha256":"88c0fd85161a7aafb0d0086fc119afdca055a070d13bb792780b98b214fae417"}],"field.aat.300054275":[{"id":"assertion.field.aat.300054275","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museology as defined in the captured Getty AAT record 300054275","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museology as: The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","support":[{"end":607,"quote":"The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","source_id":"getty-aat.300054275","source_sha256":"37380e6f30329006309fb7683025c410c8233b62514b54ba669c3bf7fba07214","start":396}],"target_id":"field.aat.300054275","target_kind":"node","target_sha256":"19dbec9f9b2d4a9446e576212e0cdff89a6a5e8e864fee9c1b0dd99d77f244e2"}],"field.aat.300054280":[{"id":"assertion.field.aat.300054280","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"aesthetics as defined in the captured Getty AAT record 300054280","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","support":[{"end":747,"quote":"Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","source_id":"getty-aat.300054280","source_sha256":"9a4d060c54538ef264af1ff43707cc812a2ae77dc30a9e76bf47647b1e11ed10","start":390}],"target_id":"field.aat.300054280","target_kind":"node","target_sha256":"15bca56fbd856e6d2dd6dbdd956e9bed858fd1b34f703fa4818ec4298da89d57"}],"field.aat.300054283":[{"id":"assertion.field.aat.300054283","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"axiology as defined in the captured Getty AAT record 300054283","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines axiology as: Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","support":[{"end":678,"quote":"Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","source_id":"getty-aat.300054283","source_sha256":"4ed213135e7aa2aa4fdc8341d12b6451afd33908939aaa6f457338bcaf27e3c0","start":388}],"target_id":"field.aat.300054283","target_kind":"node","target_sha256":"7e85711aa9b40e9c9cf79e7d115ee3e272699467637376ff65b03045294024bb"}],"field.aat.300054288":[{"id":"assertion.field.aat.300054288","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"epistemology as defined in the captured Getty AAT record 300054288","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","support":[{"end":486,"quote":"Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","source_id":"getty-aat.300054288","source_sha256":"9d2b558f24366a8c6252907b8735373076e1dcf2420f9b553f53e6373445f0da","start":392}],"target_id":"field.aat.300054288","target_kind":"node","target_sha256":"6f51e292115e38cafabcd0be653c86ba620a6e307150b4d673c62610d011cec8"}],"field.aat.300054296":[{"id":"assertion.field.aat.300054296","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"process philosophy as defined in the captured Getty AAT record 300054296","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines process philosophy as: Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","support":[{"end":545,"quote":"Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","source_id":"getty-aat.300054296","source_sha256":"790b8f53210503f8f99316ad37ecaed753d182e0c9753102ee3edd41f214596b","start":399}],"target_id":"field.aat.300054296","target_kind":"node","target_sha256":"ebb4295d32c002a3c36d81bc55bb0526220e86b31c32eaafbcd0ec56033a6ec3"}],"field.aat.300054297":[{"id":"assertion.field.aat.300054297","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"phenomenology as defined in the captured Getty AAT record 300054297","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.","support":[{"end":482,"quote":"Branch of modern philosophy dealing with the description and classification of phenomena.","source_id":"getty-aat.300054297","source_sha256":"ad770d0f664de620880b777c09bb2b38932dcfcf46a01ca279d1708bd94f0c39","start":393}],"target_id":"field.aat.300054297","target_kind":"node","target_sha256":"e9a4ca299d689f567b59cda7a185fcec773e0ee1bd32cbf9379b00dfc8242634"}],"field.aat.300054307":[{"id":"assertion.field.aat.300054307","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"biblical studies as defined in the captured Getty AAT record 300054307","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines biblical studies as: Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","support":[{"end":616,"quote":"Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","source_id":"getty-aat.300054307","source_sha256":"0faa183f99a6e8dfdf519ce3f80893ec8cee75f737bce8f897e30d0b8c12f159","start":438}],"target_id":"field.aat.300054307","target_kind":"node","target_sha256":"65b8fc50dad9e8f01fff67ba4ddb55b830a53f033703699ac88453d47c37640b"}],"field.aat.300054308":[{"id":"assertion.field.aat.300054308","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"church history as defined in the captured Getty AAT record 300054308","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines church history as: Study of the history of the Christian Church and its sects and branches.","support":[{"end":508,"quote":"Study of the history of the Christian Church and its sects and branches.","source_id":"getty-aat.300054308","source_sha256":"5bb7535699d504ca90670e2278b3f1614e468a02949e51b98afec53e6f50e06e","start":436}],"target_id":"field.aat.300054308","target_kind":"node","target_sha256":"5431e72ebaeddd97447c406237450b1060ff5795b1e24cb5acfb03c311b80188"}],"field.aat.300054309":[{"id":"assertion.field.aat.300054309","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious history as defined in the captured Getty AAT record 300054309","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious history as: Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","support":[{"end":843,"quote":"Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","source_id":"getty-aat.300054309","source_sha256":"9226fcbdd3e5f56305224f911ac17f8ea66e0b6ae28d2839d1a86f6302fbcc96","start":439}],"target_id":"field.aat.300054309","target_kind":"node","target_sha256":"3172e3c2a33c4196b39fd88103fd0c61788626b92f681527c5c4f94afa5b8198"}],"field.aat.300054310":[{"id":"assertion.field.aat.300054310","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ecclesiology as defined in the captured Getty AAT record 300054310","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ecclesiology as: Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","support":[{"end":572,"quote":"Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","source_id":"getty-aat.300054310","source_sha256":"bd31a00058c14edff509ba4160f96a117f5cb9c382da2a0e35aff90ad3307d08","start":434}],"target_id":"field.aat.300054310","target_kind":"node","target_sha256":"f6ecbc3042de3b09b678a69e6411814e3e5976e2b4f7612d2fed6876fe6b71b0"}],"field.aat.300054311":[{"id":"assertion.field.aat.300054311","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"eschatology as defined in the captured Getty AAT record 300054311","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines eschatology as: The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","support":[{"end":658,"quote":"The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","source_id":"getty-aat.300054311","source_sha256":"774020abe4ef0fe157b3711b05f5eda9f00c783c0d9f33a7d12f400420cc8718","start":433}],"target_id":"field.aat.300054311","target_kind":"node","target_sha256":"4d592ed365cbe44c0e8b9a96e28c4c260600b98312a6813b402bb8d6419bfedd"}],"field.aat.300054312":[{"id":"assertion.field.aat.300054312","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious ethics as defined in the captured Getty AAT record 300054312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious ethics as: Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","support":[{"end":599,"quote":"Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","source_id":"getty-aat.300054312","source_sha256":"fff546ca6a64a6dc235f7b524d90afb5a7a74bf5c1a7840aba7aceb1410a2a34","start":438}],"target_id":"field.aat.300054312","target_kind":"node","target_sha256":"f8a6b84be289400f15212d88754a7fdfd7ab32d7558095871c989622e2b2e319"}],"field.aat.300055944":[{"id":"assertion.field.aat.300055944","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"social ethics as defined in the captured Getty AAT record 300055944","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines social ethics as: Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","support":[{"end":529,"quote":"Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","source_id":"getty-aat.300055944","source_sha256":"1e8bafbe542ea8bb95ccc934a37cfddc2c3d542648f0af4ce4fb89f475fd37ef","start":429}],"target_id":"field.aat.300055944","target_kind":"node","target_sha256":"4818aeacd73c395caf5ec90d7dca06193f0757b2af50f2d4fe049d6eec60a922"}],"field.aat.300055987":[{"id":"assertion.field.aat.300055987","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"religious ideologies as defined in the captured Getty AAT record 300055987","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines religious ideologies as: Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","support":[{"end":744,"quote":"Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","source_id":"getty-aat.300055987","source_sha256":"640fff13e6cf0cdb04a1f82164c1a53b8bfe41c0ea1991e7aea7baeaa95a357e","start":436}],"target_id":"field.aat.300055987","target_kind":"node","target_sha256":"4bce4333b727e0612a8316bd8bbd09688181192aadeb07d705a820f2d6b0a56a"}],"field.aat.300069325":[{"id":"assertion.field.aat.300069325","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"poetics as defined in the captured Getty AAT record 300069325","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines poetics as: The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","support":[{"end":525,"quote":"The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","source_id":"getty-aat.300069325","source_sha256":"82fa2e1ca635d796d09e010c2b961bc246d4bd315a01cbce7a95c97734b80550","start":393}],"target_id":"field.aat.300069325","target_kind":"node","target_sha256":"8f0b37b972781744d5b8153fce39b330726ac1bde0141fe547e8ae59d7e63b53"}],"field.aat.300080402":[{"id":"assertion.field.aat.300080402","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural criticism as defined in the captured Getty AAT record 300080402","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural criticism as: The study or practice of the analytical description, interpretation, and evaluation of architectural works.","support":[{"end":544,"quote":"The study or practice of the analytical description, interpretation, and evaluation of architectural works.","source_id":"getty-aat.300080402","source_sha256":"71e19436b75cf7f1ae16b7f477f1b35ad4f3aee1a480bac74d12cb63fda30c39","start":437}],"target_id":"field.aat.300080402","target_kind":"node","target_sha256":"20829f44d5ec407c862cd419b1953ae92d9b365949bb81b0a91f26f906cd3d32"}],"field.aat.300112920":[{"id":"assertion.field.aat.300112920","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"etymology as defined in the captured Getty AAT record 300112920","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines etymology as: Study of the history of a particular word or element of a word, or of historical linguistic change.","support":[{"end":536,"quote":"Study of the history of a particular word or element of a word, or of historical linguistic change.","source_id":"getty-aat.300112920","source_sha256":"a4ad5ac76b33e21e062101ee41226455cc5466ced3eb948de50cd258911a52b6","start":437}],"target_id":"field.aat.300112920","target_kind":"node","target_sha256":"db882b586887a73653613ebead6e09bc6c38cc656d75ceb8ec725676943a01a2"}],"field.aat.300168233":[{"id":"assertion.field.aat.300168233","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"art criticism as defined in the captured Getty AAT record 300168233","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines art criticism as: The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","support":[{"end":547,"quote":"The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","source_id":"getty-aat.300168233","source_sha256":"cd33a11a41f24191ea60801b12f66d58406aea531fe921662043142cb85d6a5a","start":427}],"target_id":"field.aat.300168233","target_kind":"node","target_sha256":"29f20d7b6a110f902162bf1038ccb6c1249d03da3147367e8ad3fe3618e6f26b"}],"field.aat.300174160":[{"id":"assertion.field.aat.300174160","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary criticism as defined in the captured Getty AAT record 300174160","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary criticism as: The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","support":[{"end":572,"quote":"The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","source_id":"getty-aat.300174160","source_sha256":"d623b65b5915e38a41dcfa7d7ed503568554dca9f37229f61bc0a99313bca0ef","start":404}],"target_id":"field.aat.300174160","target_kind":"node","target_sha256":"06f1bcb522958fd1644289d10cc99a282c0e7b2e2948b885bbd3507e3779ff4f"}],"field.aat.300174173":[{"id":"assertion.field.aat.300174173","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"literary history as defined in the captured Getty AAT record 300174173","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines literary history as: Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","support":[{"end":523,"quote":"Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","source_id":"getty-aat.300174173","source_sha256":"f332deb6f26f6d771f52dc47b0f20c98683d2f22c212adb29b0733911112c532","start":402}],"target_id":"field.aat.300174173","target_kind":"node","target_sha256":"28c8de8a0555f413e60b22169badbda6fd9794c89cec7e23c6a29764a4b29c59"}],"field.aat.300205021":[{"id":"assertion.field.aat.300205021","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"organology as defined in the captured Getty AAT record 300205021","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines organology as: Descriptive and analytical study of musical instruments.","support":[{"end":460,"quote":"Descriptive and analytical study of musical instruments.","source_id":"getty-aat.300205021","source_sha256":"9f2a08bbb8144fffb68c5d50373657b364eb42741762a30192e1a710c1763efd","start":404}],"target_id":"field.aat.300205021","target_kind":"node","target_sha256":"bc4ccb74c2bd94b60b6119494bbcae7eb5e0453bf1e4839ec50c3ee2a9265139"}],"field.aat.300255715":[{"id":"assertion.field.aat.300255715","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"choreography as defined in the captured Getty AAT record 300255715","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines choreography as: The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","support":[{"end":608,"quote":"The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","source_id":"getty-aat.300255715","source_sha256":"8c8155135be03f682b5748b79a9e25d74949d6fc7e3b003f48626e8469842cb4","start":418}],"target_id":"field.aat.300255715","target_kind":"node","target_sha256":"586a714487737c0350dd38f61bd967748e219c0944203782e9d7dd00bb8adcdf"}],"field.aat.300258340":[{"id":"assertion.field.aat.300258340","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"ideology as defined in the captured Getty AAT record 300258340","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines ideology as: Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","support":[{"end":712,"quote":"Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","source_id":"getty-aat.300258340","source_sha256":"d1c7802a0ea5c915af5840df920723e46b2a6a09acc904a517ff0e3360a2b24c","start":392}],"target_id":"field.aat.300258340","target_kind":"node","target_sha256":"32abe7a259fccd5f6ab51cd697e3826a2be9effd39d65aa8382a8f74c1bee295"}],"field.aat.300265672":[{"id":"assertion.field.aat.300265672","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectonics as defined in the captured Getty AAT record 300265672","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectonics as: The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","support":[{"end":551,"quote":"The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","source_id":"getty-aat.300265672","source_sha256":"7e891eba4a0e1ce81808efa389ddf7ed923b7df7531206917f8e5ad14c2567c7","start":423}],"target_id":"field.aat.300265672","target_kind":"node","target_sha256":"2499b3eaa12f85b2ed87e641ae213998d378c778e43aa35dc659aba2477edb9d"}],"field.aat.300265767":[{"id":"assertion.field.aat.300265767","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"teleology as defined in the captured Getty AAT record 300265767","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines teleology as: Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","support":[{"end":497,"quote":"Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","source_id":"getty-aat.300265767","source_sha256":"2b0334afd9c829e10b40b21e8d2d57ef79127f04a1a0e90fc138c37a36b5ed22","start":389}],"target_id":"field.aat.300265767","target_kind":"node","target_sha256":"a6641342a25b80b05ecc973dc0957a6ca31da1707ec206b5a7fc7f309dfa1747"}],"field.aat.300379540":[{"id":"assertion.field.aat.300379540","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"technical art history as defined in the captured Getty AAT record 300379540","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines technical art history as: Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","support":[{"end":782,"quote":"Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","source_id":"getty-aat.300379540","source_sha256":"885c751e155f2fa4b298bd80fb27c33ab71aaf81198225a93082f6bafda04889","start":416}],"target_id":"field.aat.300379540","target_kind":"node","target_sha256":"e5709e4d9e0b0eeb83c833c08d7ed4d4095334136ea6d69074aab2063c646615"}],"field.aat.300387576":[{"id":"assertion.field.aat.300387576","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"museography as defined in the captured Getty AAT record 300387576","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines museography as: Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","support":[{"end":537,"quote":"Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","source_id":"getty-aat.300387576","source_sha256":"b47de4a11e764bdf91a45b28b8ec95394e14483d982f9293c04bde2a08688c5c","start":390}],"target_id":"field.aat.300387576","target_kind":"node","target_sha256":"8ae914b8a67deecc99d5c7d9f07c4abeeae2051ab39d0f504110930916adaaa5"}],"field.aat.300389757":[{"id":"assertion.field.aat.300389757","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cryptology as defined in the captured Getty AAT record 300389757","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cryptology as: The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","support":[{"end":617,"quote":"The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","source_id":"getty-aat.300389757","source_sha256":"f44007bd4e9f85d48aea9a0105238be6467e81b38ad89c46f30820fbcc12f810","start":438}],"target_id":"field.aat.300389757","target_kind":"node","target_sha256":"99c1eebefd5019489c70eef7d82014e68efe9561c47990a3ab4ea836e0c21b59"}],"field.aat.300389758":[{"id":"assertion.field.aat.300389758","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"cryptography as defined in the captured Getty AAT record 300389758","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.","support":[{"end":483,"quote":"The practice of writing in code or symbols.","source_id":"getty-aat.300389758","source_sha256":"7ec97679edf7ea49d65ddb7f6ace52cca2abc837705f00da76df964e574a382b","start":440}],"target_id":"field.aat.300389758","target_kind":"node","target_sha256":"8b704d583f45f5d988b45c9237fa3ce42809583c8e89a4578ba4363787aeffd2"}],"field.aat.300412155":[{"id":"assertion.field.aat.300412155","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"book history as defined in the captured Getty AAT record 300412155","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines book history as: Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","support":[{"end":1081,"quote":"Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","source_id":"getty-aat.300412155","source_sha256":"f97123540749ebbcca6c3e57ce7417b50fe7ec9cfc830534335bef182e3afe71","start":399}],"target_id":"field.aat.300412155","target_kind":"node","target_sha256":"842a06a5c36fbdee740dc80c63afc7d4cde0feecad3d147cc4cab9822ec40e54"}],"field.aat.300417579":[{"id":"assertion.field.aat.300417579","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"music theory as defined in the captured Getty AAT record 300417579","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines music theory as: Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","support":[{"end":546,"quote":"Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","source_id":"getty-aat.300417579","source_sha256":"7d8709ad288108456b0a30fb8e0e2af8e340d525b8d0e11d6561e7e681d4cc5d","start":418}],"target_id":"field.aat.300417579","target_kind":"node","target_sha256":"de9bd80fb6fc28b15b80bb8086749f1665f9a1c3ea14055ff5ab1f6650eecbc2"}],"field.aat.300435151":[{"id":"assertion.field.aat.300435151","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"architectural photography as defined in the captured Getty AAT record 300435151","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines architectural photography as: Specialization of photography focused on architecture as subject.","support":[{"end":498,"quote":"Specialization of photography focused on architecture as subject.","source_id":"getty-aat.300435151","source_sha256":"c74df4212891c7ee97bf42488e76c6b91f33536986c8890e760ce8ef8b2cc4d4","start":433}],"target_id":"field.aat.300435151","target_kind":"node","target_sha256":"eb72874b4ab1b1e63c60aaba8bae2c1abbf3476424373aa43a28daf794949158"}],"field.aat.300444364":[{"id":"assertion.field.aat.300444364","scope":{"assumptions":"Attributed controlled-vocabulary definition; not an original research or historical-priority claim","population":"paper history as defined in the captured Getty AAT record 300444364","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The Getty Art & Architecture Thesaurus defines paper history as: Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","support":[{"end":629,"quote":"Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","source_id":"getty-aat.300444364","source_sha256":"f8a922de5280f93a178b3981b1f410ed7602130de62014f59d683a6e5d4b8277","start":400}],"target_id":"field.aat.300444364","target_kind":"node","target_sha256":"5d22624b553dc5249817089a8d0ee51ced07e0d9cc405feefc66427955d89f6e"}],"field.ai":[{"id":"assertion.complete.field.ai","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Artificial intelligence in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Artificial intelligence as: Theory and development of COMPUTER SYSTEMS which perform tasks that normally require human intelligence. Such tasks may include speech recognition, LEARNING ; VISUAL PERCEPTION ; MATHEMATICAL COMPUTING ; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","support":[{"end":655,"quote":"Theory and development of\nCOMPUTER SYSTEMS\nwhich perform tasks that normally require human intelligence. Such tasks may include speech recognition,\nLEARNING\n;\nVISUAL PERCEPTION\n;\nMATHEMATICAL COMPUTING\n; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","source_id":"nlm-mesh.8fdf3c0558d0b89101fb","source_sha256":"acce7fa759a5505014b23ce88c231e5f68cea1bcd3188361e87f4dedcc9e790b","start":378}],"target_id":"field.ai","target_kind":"node","target_sha256":"a454a254c4fd117c5ec18947bd40fc9bbcd1050e6f733c5fad200fb591b32358"}],"field.anatomy":[{"id":"assertion.complete.field.anatomy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Anatomy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Anatomy as: A branch of biology dealing with the structure of organisms.","support":[{"end":544,"quote":"A branch of biology dealing with the structure of organisms.","source_id":"nlm-mesh.0b589dd05c92deac1e04","source_sha256":"e8edd3705857ad1c75b8acc3e4f9bb4623884a10102b79b5e7342a2f05a87a9c","start":484}],"target_id":"field.anatomy","target_kind":"node","target_sha256":"fcd6a062888cb1e70ecf74a027f601fa74169b992177ae173fb9c8a95beea2cf"}],"field.anthropology":[{"id":"assertion.complete.field.anthropology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Anthropology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.","support":[{"end":455,"quote":"The science devoted to the comparative study of man.","source_id":"nlm-mesh.bcc9794e5c2487d85964","source_sha256":"0dae9a26be94f6fdb84ae4db206436830a3003a86150917797dce444c2e29cbd","start":403}],"target_id":"field.anthropology","target_kind":"node","target_sha256":"db936b1d24777d51c4e14d51a2c932a97c7367471c12d86b49781a5d1a0c35be"}],"field.archaeology":[{"id":"assertion.complete.field.archaeology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Archaeology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Archaeology as: Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","support":[{"end":537,"quote":"Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","source_id":"nlm-mesh.76d8813e0d4330d9aaf5","source_sha256":"c823370f3944ce6fb2da5ddf3a58d97f526157497200b8ad414e3c245540795b","start":342}],"target_id":"field.archaeology","target_kind":"node","target_sha256":"7cc1236951992a66a7a6c4779108b524d10a640fac839e73988822ba4dd94fc3"}],"field.astronomy":[{"id":"assertion.complete.field.astronomy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Astronomy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Astronomy as: The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","support":[{"end":775,"quote":"The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","source_id":"nlm-mesh.dd44e18a1fa393e60806","source_sha256":"9c1b1d697f9039e72e1ce473229040abdda68010baf9f284d10db6e2d953ed6c","start":530}],"target_id":"field.astronomy","target_kind":"node","target_sha256":"e5a28f62bb9ca35aaca4745faedf3f6ac4617435fee89d592f6f3f3e6fff1fc5"}],"field.biology":[{"id":"assertion.complete.field.biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Biology as: One of the BIOLOGICAL SCIENCE DISCIPLINES concerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","support":[{"end":768,"quote":"One of the\nBIOLOGICAL SCIENCE DISCIPLINES\nconcerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","source_id":"nlm-mesh.5934874aa38f9094fd81","source_sha256":"6750f82ab65595e9c57c5cec35c086fe2e1468bfcc80d7ab7df79a17d321338b","start":591}],"target_id":"field.biology","target_kind":"node","target_sha256":"e0aa59a0722f7eb26102e292cb698c897f7cd54958e5d74624325815c3d8d45c"}],"field.cartography":[{"id":"assertion.complete.field.cartography","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Cartography as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Cartography as: The science and art of making maps.","support":[{"end":146,"quote":"The science and art of making maps.","source_id":"usgs-thesaurus.5381093d44dfea691929","source_sha256":"b656c996a4d11f7e3301005c6db7b79ba9f4d0654ba45a685d6466ad947bc3a3","start":111}],"target_id":"field.cartography","target_kind":"node","target_sha256":"21ada9fe780a1d6c8aa8c65776b75f8bb1df598b8d2502354c620346db95ab35"}],"field.chemistry":[{"id":"assertion.complete.field.chemistry","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Chemistry in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Chemistry as: A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","support":[{"end":770,"quote":"A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","source_id":"nlm-mesh.67a1950c3c2557253dd5","source_sha256":"c1d9cafd09ebd4b93899758d9a8ac6d90d3a618189ae5fd2de25a122b1ba9ece","start":602}],"target_id":"field.chemistry","target_kind":"node","target_sha256":"bba5fc429d86559b99d27d140453e7932ee85a832dd7d79ff71f18635cd77f1c"}],"field.climatology":[{"id":"assertion.complete.field.climatology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Climatology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.","support":[{"end":200,"quote":"Scientific study of the characteristic weather conditions of geographic areas.","source_id":"usgs-thesaurus.e70c8d2c1e03ea23b093","source_sha256":"20e842d7f926a4ee2a1feec3fb4ad56768373e3b879e3e114b044e2822792a38","start":122}],"target_id":"field.climatology","target_kind":"node","target_sha256":"901b275990a79741f544339cb1f2f92d51f9592e441fa3db6aa5d6e31bc5d8cc"}],"field.cognitive-science":[{"id":"assertion.complete.field.cognitive-science","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cognitive science in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cognitive science as: The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","support":[{"end":601,"quote":"The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.3afa87c4efa263dea007","source_sha256":"83d06c651636977640e1defba29a2d0d0dd301b3d5eaf03889e4055d2b8239a5","start":354}],"target_id":"field.cognitive-science","target_kind":"node","target_sha256":"8eea67b5da8c68cf242419d8a273855dd0d82a73b41617f9732b3a9d986003e1"}],"field.computer-science":[{"id":"assertion.complete.field.computer-science","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Computer science as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Computer science as: Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","support":[{"end":233,"quote":"Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","source_id":"usgs-thesaurus.c12f0d8d6bc2875dfd18","source_sha256":"9ed5afa033c33f8000ad565538d4793493362b7ac2238aba899333966bb04ea0","start":115}],"target_id":"field.computer-science","target_kind":"node","target_sha256":"c465320deab376daa2c78e0186e2bd4a6efb8f15b6de076aa52a1f2806bff68b"}],"field.ecology":[{"id":"assertion.complete.field.ecology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ecology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ecology as: Study of the relations between living plants and animals and their environment.","support":[{"end":169,"quote":"Study of the relations between living plants and animals and their environment.","source_id":"usgs-thesaurus.54a47b5a480dee09e51c","source_sha256":"29534ed09b491b5c47a02485dd576cab608126d22e5e5393203d359ba635d877","start":90}],"target_id":"field.ecology","target_kind":"node","target_sha256":"4252367969341fb187fc5e8df26ea1b8ce18f97fa1698ee767050862f38d9c3e"}],"field.economics":[{"id":"assertion.complete.field.economics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Economics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Economics as: The science of utilization, distribution, and consumption of services and materials.","support":[{"end":540,"quote":"The science of utilization, distribution, and consumption of services and materials.","source_id":"nlm-mesh.3b75ab5915b79fbe20b6","source_sha256":"6c14983657d8114e03039e7c3816663e8019ae1489061a5d884d88d46a7ea372","start":456}],"target_id":"field.economics","target_kind":"node","target_sha256":"f21373350254a4c299207e1663d7f9cc2cc08392ba7eaad4b207c71586be98f5"}],"field.epidemiology":[{"id":"assertion.complete.field.epidemiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Epidemiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Epidemiology as: Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","support":[{"end":826,"quote":"Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","source_id":"nlm-mesh.ca259dbfe57d6af9326c","source_sha256":"6282a4f957e88aaf13b80a2608f552f606459941f1a15ded9e2871b48dd9c5be","start":566}],"target_id":"field.epidemiology","target_kind":"node","target_sha256":"14d42826a32bf9a96e4dec89772df0701884305f6fec971b68769df4b65d0863"}],"field.genetics":[{"id":"assertion.complete.field.genetics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Genetics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","support":[{"end":212,"quote":"Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","source_id":"usgs-thesaurus.55d3172c77bc4f57a64a","source_sha256":"7b13e742b744011c55c946924cf7f3792dfae9f81f567ab4ab8f202a946df5e0","start":92}],"target_id":"field.genetics","target_kind":"node","target_sha256":"1be8ac6d29dbad2119370d3e2cb5464d0588f58f6bb96916d7e88cae3c4d5d02"},{"id":"assertion.mesh-r2.context.field.genetics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Genetics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","support":[{"end":212,"quote":"Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","source_id":"usgs-thesaurus.55d3172c77bc4f57a64a","source_sha256":"7b13e742b744011c55c946924cf7f3792dfae9f81f567ab4ab8f202a946df5e0","start":92}],"target_id":"field.genetics","target_kind":"node","target_sha256":"1be8ac6d29dbad2119370d3e2cb5464d0588f58f6bb96916d7e88cae3c4d5d02"}],"field.geology":[{"id":"assertion.complete.field.geology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geology as: Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","support":[{"end":208,"quote":"Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","source_id":"usgs-thesaurus.91b39721167a39a9ed03","source_sha256":"4bec33357e1e14fccf76cf9c455c557476ec42012c683852f242c9b04e35f3de","start":91}],"target_id":"field.geology","target_kind":"node","target_sha256":"20cbbae923a8f46b98691ce1512755bad5d0949c4e77513d9b31d2fa247f9daa"}],"field.information-theory":[{"id":"assertion.complete.field.information-theory","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Information theory in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Information theory as: An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and CYBERNETICS .","support":[{"end":665,"quote":"An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and\nCYBERNETICS\n.","source_id":"nlm-mesh.29527d691d2b917a2f70","source_sha256":"1196258c27016f5457b20c68f1c04e91e37cb85b531a35523bf2d9aa31656076","start":348}],"target_id":"field.information-theory","target_kind":"node","target_sha256":"7d30ca668c1569834142793fe61f1f55f32da29511c606cf8cf5b50bd93eddcc"}],"field.logic":[{"id":"assertion.complete.field.logic","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Logic in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Logic as: The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","support":[{"end":648,"quote":"The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","source_id":"nlm-mesh.a39a42601f13cc4e3244","source_sha256":"e33c72899bfe59365d03e2c8fff33e69d9d14a2a64aa2b062d2f224f6d9abcb6","start":326}],"target_id":"field.logic","target_kind":"node","target_sha256":"7cef9bf304d88d42494fd4ebeb852073db63539934b3fa9d613bf0d38b406b09"}],"field.mesh.d000066949":[{"id":"assertion.field.mesh.d000066949","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biobehavioral Sciences as described in the captured NLM MeSH descriptor D000066949","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biobehavioral Sciences as: An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","support":[{"end":515,"quote":"An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","source_id":"nlm-mesh.d000066949","source_sha256":"1eab570eaeb66b22b0b9990a5b93469bb156a76120ad1c8114d841dfc9e1f0e3","start":374}],"target_id":"field.mesh.d000066949","target_kind":"node","target_sha256":"870afec917edbf2f555114d86cc0d1d611b24b50207b759b41e66ad3f2206255"}],"field.mesh.d000067568":[{"id":"assertion.field.mesh.d000067568","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Culturally Appropriate Technology as described in the captured NLM MeSH descriptor D000067568","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Culturally Appropriate Technology as: A SCIENCE or TECHNOLOGY that promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","support":[{"end":568,"quote":"A SCIENCE or\nTECHNOLOGY\nthat promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","source_id":"nlm-mesh.d000067568","source_sha256":"11dda86f54d7b086c4f479788cd6ef516b435be5c85ea2951e79e903aa9b7a57","start":388}],"target_id":"field.mesh.d000067568","target_kind":"node","target_sha256":"dd94429c75cc17c9cf16294001e3f8b829a757d065beedb3c4e06bc179159c31"}],"field.mesh.d000068936":[{"id":"assertion.field.mesh.d000068936","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Theranostic Nanomedicine as described in the captured NLM MeSH descriptor D000068936","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Theranostic Nanomedicine as: An integrated nano-scale approach to MEDICINE which involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","support":[{"end":592,"quote":"An integrated nano-scale approach to\nMEDICINE\nwhich involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","source_id":"nlm-mesh.d000068936","source_sha256":"38ce011762120b1a454004756d36a590c1756a85e879c07511c1d54b22bf45ff","start":446}],"target_id":"field.mesh.d000068936","target_kind":"node","target_sha256":"3e24424cb3f367aae63384173a128c4b542d0458f9e84588adb5511dc33d24ce"}],"field.mesh.d000070316":[{"id":"assertion.field.mesh.d000070316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pediatric Emergency Medicine as described in the captured NLM MeSH descriptor D000070316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pediatric Emergency Medicine as: Branch of EMERGENCY MEDICINE dealing with the emergency care of children.","support":[{"end":471,"quote":"Branch of\nEMERGENCY MEDICINE\ndealing with the emergency care of children.","source_id":"nlm-mesh.d000070316","source_sha256":"1dcf0c572a71de175b9358c8510d62e2abae7f38e9c8dd7bb71273db6dd8279e","start":398}],"target_id":"field.mesh.d000070316","target_kind":"node","target_sha256":"94a7216f7002c56fb42c293354e8088ba980075ea47efdc3a4ff15ab7498c008"}],"field.mesh.d000071077":[{"id":"assertion.field.mesh.d000071077","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Surgical Oncology as described in the captured NLM MeSH descriptor D000071077","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Surgical Oncology as: A surgical specialty concerned with management of cancer.","support":[{"end":437,"quote":"A surgical specialty concerned with management of cancer.","source_id":"nlm-mesh.d000071077","source_sha256":"f0de4ebb1b943d23fec226d7d5a516417e15b9481dc604f551a3d3e7b3eb38cd","start":380}],"target_id":"field.mesh.d000071077","target_kind":"node","target_sha256":"32785c2a4814704dca154d12a5a03a56471559b8a176fd7889c8b969cba36020"}],"field.mesh.d000073316":[{"id":"assertion.field.mesh.d000073316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Addiction Medicine as described in the captured NLM MeSH descriptor D000073316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Addiction Medicine as: A medical specialty focused on the diagnosis and treatment of ADDICTIVE BEHAVIOR disorders, including SUBSTANCE-RELATED DISORDERS and IMPULSE CONTROL DISORDERS ; and the management of co-occurring medical and psychiatric conditions","support":[{"end":589,"quote":"A medical specialty focused on the diagnosis and treatment of\nADDICTIVE BEHAVIOR\ndisorders, including\nSUBSTANCE-RELATED DISORDERS\nand\nIMPULSE CONTROL DISORDERS\n; and the management of co-occurring medical and psychiatric conditions","source_id":"nlm-mesh.d000073316","source_sha256":"28052e88b1cdb043f90b70c1986b599c3b38466fcdddb18c5a0dfc7fe9af5253","start":358}],"target_id":"field.mesh.d000073316","target_kind":"node","target_sha256":"ea2e6da7cd42fcf1642793e108b3b4872a4aed3b3ed5dfeec97de4bde2b67f1b"}],"field.mesh.d000073320":[{"id":"assertion.field.mesh.d000073320","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psycho-Oncology as described in the captured NLM MeSH descriptor D000073320","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psycho-Oncology as: A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","support":[{"end":672,"quote":"A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","source_id":"nlm-mesh.d000073320","source_sha256":"4c75fe1e28715f58b8ed3f8c6b5c043a6626d2a3fdfa756efc23bbe5b597c77a","start":392}],"target_id":"field.mesh.d000073320","target_kind":"node","target_sha256":"6c244bcc74560b06f3933057cb9e98632a68a8b8a7f16f7756fedf28a963b1a0"}],"field.mesh.d000074266":[{"id":"assertion.field.mesh.d000074266","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Materials Science as described in the captured NLM MeSH descriptor D000074266","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Materials Science as: An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","support":[{"end":673,"quote":"An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","source_id":"nlm-mesh.d000074266","source_sha256":"982e28555c7a10445af4c02e741cf1114a05244aefda6ae6bfddd305613e6d9c","start":364}],"target_id":"field.mesh.d000074266","target_kind":"node","target_sha256":"e14676ca14ce281b52268f3e742d1e788c13089d873a5297b872c8c1ed504883"}],"field.mesh.d000075863":[{"id":"assertion.field.mesh.d000075863","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science in Literature as described in the captured NLM MeSH descriptor D000075863","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science in Literature as: Literary works whose subject matter is science or about the profession of science and related areas.","support":[{"end":464,"quote":"Literary works whose subject matter is science or about the profession of science and related areas.","source_id":"nlm-mesh.d000075863","source_sha256":"8bd87abfa059ef53258fcce80f3173e0ec9dd505250a62c573f141cc12b53f17","start":364}],"target_id":"field.mesh.d000075863","target_kind":"node","target_sha256":"f68e39918738088c16d42fc435751142e6e00ffdb6c60a640b9bbfed700e74df"}],"field.mesh.d000076227":[{"id":"assertion.field.mesh.d000076227","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Stereolithography as described in the captured NLM MeSH descriptor D000076227","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).","support":[{"end":622,"quote":"A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid\nPOLYMERS\nthat harden on contact with laser light (photopolymerization).","source_id":"nlm-mesh.d000076227","source_sha256":"5c43f7c07b2e7796343994895c621335e81c0514e2c749cb29c4670adcc3d61c","start":408}],"target_id":"field.mesh.d000076227","target_kind":"node","target_sha256":"8b8a555ac0ae72f4a1cc75f1d437917f4a5e62c296be3a782075164f473414c9"}],"field.mesh.d000077283":[{"id":"assertion.field.mesh.d000077283","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Psychology as described in the captured NLM MeSH descriptor D000077283","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Psychology as: A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","support":[{"end":552,"quote":"A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","source_id":"nlm-mesh.d000077283","source_sha256":"4fadb7ce41af86375e7f64f19042f17654b473404f4fd8ee7c84647e70fcc1df","start":380}],"target_id":"field.mesh.d000077283","target_kind":"node","target_sha256":"2b9e2a6472a9673dbf33199c85858d6fb3f52d218889f984ef535915780cb352"}],"field.mesh.d000078782":[{"id":"assertion.field.mesh.d000078782","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Vaccinology as described in the captured NLM MeSH descriptor D000078782","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Vaccinology as: Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","support":[{"end":568,"quote":"Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","source_id":"nlm-mesh.d000078782","source_sha256":"03f5c1871883f3e88b1016f9f7678e35bbba2bcfa2b81060b6ff852c4f9ae94f","start":344}],"target_id":"field.mesh.d000078782","target_kind":"node","target_sha256":"51022c94a627aa92ea841d552d25d64356ac18681488311c090a18d376a203aa"}],"field.mesh.d000079203":[{"id":"assertion.field.mesh.d000079203","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disruptive Technology as described in the captured NLM MeSH descriptor D000079203","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disruptive Technology as: A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","support":[{"end":608,"quote":"A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","source_id":"nlm-mesh.d000079203","source_sha256":"ebfaba60532dbd4741ef73e8d0005c6df45b97e4721af073756766069c65242e","start":364}],"target_id":"field.mesh.d000079203","target_kind":"node","target_sha256":"9ae47f0e1a9e1c54265fb94083f609dc39977ee7c1f8d13afeb12a877e4fc20f"}],"field.mesh.d000079645":[{"id":"assertion.field.mesh.d000079645","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perioperative Medicine as described in the captured NLM MeSH descriptor D000079645","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perioperative Medicine as: A medical specialty concerned with the patient before and after surgical procedures.","support":[{"end":450,"quote":"A medical specialty concerned with the patient before and after surgical procedures.","source_id":"nlm-mesh.d000079645","source_sha256":"4ebeda4ea61cae5e90d8ce1065048a6bdb0735a30295811bdb20d3ff6f862235","start":366}],"target_id":"field.mesh.d000079645","target_kind":"node","target_sha256":"3969cb0e3cc2960903d994d75c7c46e020aa09f16d716ab5edf804fb8f3f73b9"}],"field.mesh.d000080029":[{"id":"assertion.field.mesh.d000080029","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Citizen Science as described in the captured NLM MeSH descriptor D000080029","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Citizen Science as: Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","support":[{"end":748,"quote":"Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","source_id":"nlm-mesh.d000080029","source_sha256":"8beb6a18b97db484e8e751096d81058a06091ef792189e96f00318e98c227abd","start":380}],"target_id":"field.mesh.d000080029","target_kind":"node","target_sha256":"b79fd7e2ced8cb599c48cd4921fe1e1f340531ad5639c70917e9f201fbc73e60"}],"field.mesh.d000080048":[{"id":"assertion.field.mesh.d000080048","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hot Melt Extrusion Technology as described in the captured NLM MeSH descriptor D000080048","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hot Melt Extrusion Technology as: Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an increase in the dissolution profile for the active pharmaceutical ingredients.","support":[{"end":856,"quote":"Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an  increase in the dissolution profile for the active pharmaceutical ingredients.","source_id":"nlm-mesh.d000080048","source_sha256":"36f5f1464a4f10343c13fac7a1ce6b93b27743373ec58d0ffcbe7c2d37d4e85c","start":412}],"target_id":"field.mesh.d000080048","target_kind":"node","target_sha256":"e812e457715e1837f5db0fdc5d33e1de90305e2d1c35520a0140c769e46109c1"}],"field.mesh.d000081230":[{"id":"assertion.field.mesh.d000081230","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Entomology as described in the captured NLM MeSH descriptor D000081230","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Entomology as: The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","support":[{"end":539,"quote":"The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","source_id":"nlm-mesh.d000081230","source_sha256":"d4f1c471889e76c1b6698bf504be89a7ea673da7c216f3f19bf0d7b0020af80f","start":388}],"target_id":"field.mesh.d000081230","target_kind":"node","target_sha256":"52db2a25f9a1ca77b157d97315a795c52bd9453f9b7aa306e2e9660967a0de02"}],"field.mesh.d000082222":[{"id":"assertion.field.mesh.d000082222","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Digital Technology as described in the captured NLM MeSH descriptor D000082222","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Digital Technology as: The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","support":[{"end":572,"quote":"The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","source_id":"nlm-mesh.d000082222","source_sha256":"7c8c014cb4c060558d79a11e00b8622ef0d641af767f7fa5827d4d8e1e5199c1","start":374}],"target_id":"field.mesh.d000082222","target_kind":"node","target_sha256":"2f975a9952e5cd170c865bbd08e6f79c19f1c36153dc2fb673c43664016992dd"}],"field.mesh.d000084542":[{"id":"assertion.field.mesh.d000084542","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eye-Tracking Technology as described in the captured NLM MeSH descriptor D000084542","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eye-Tracking Technology as: Technology used for EYE MOVEMENT MEASUREMENTS , which capture and measure a persons EYE MOVEMENT and/or EYE GAZE","support":[{"end":524,"quote":"Technology used for\nEYE MOVEMENT MEASUREMENTS\n, which capture and measure a persons\nEYE MOVEMENT\nand/or\nEYE GAZE","source_id":"nlm-mesh.d000084542","source_sha256":"5850d415a862632d0f378797189515a5f34cbf836b6d168342d41cfdca9d5242","start":412}],"target_id":"field.mesh.d000084542","target_kind":"node","target_sha256":"b8a76a7f6488dd327a6c4d29089ef1193145f967d7def7514d337bb2816b5feb"}],"field.mesh.d000085843":[{"id":"assertion.field.mesh.d000085843","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Imaging Genomics as described in the captured NLM MeSH descriptor D000085843","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Imaging Genomics as: The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","support":[{"end":622,"quote":"The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","source_id":"nlm-mesh.d000085843","source_sha256":"1ad810ef036e448eeb8e4ca16a294d111a791b693afa3c61825f6cc8f85390ff","start":406}],"target_id":"field.mesh.d000085843","target_kind":"node","target_sha256":"dedbce1fd60affc8048ac148c7939a5e4af153c41732d4c54d45adf926f343d9"}],"field.mesh.d000085844":[{"id":"assertion.field.mesh.d000085844","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiation Genomics as described in the captured NLM MeSH descriptor D000085844","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiation Genomics as: The study of the association between patient genomic data and the response to IONIZING RADIATION .","support":[{"end":504,"quote":"The study of the association between patient genomic data and the response to\nIONIZING RADIATION\n.","source_id":"nlm-mesh.d000085844","source_sha256":"d24551ed7132d96bad14b7be8220280688bc3f262aa096c54a861bf89ebdb8cc","start":406}],"target_id":"field.mesh.d000085844","target_kind":"node","target_sha256":"978be5dae91ef9a802513f4f723d4ae7a3610538e87c607714cd146806ab4046"}],"field.mesh.d000088744":[{"id":"assertion.field.mesh.d000088744","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genomic Medicine as described in the captured NLM MeSH descriptor D000088744","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genomic Medicine as: A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use. (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","support":[{"end":658,"quote":"A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use.  (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","source_id":"nlm-mesh.d000088744","source_sha256":"dbc5846d406bd4638a0fc35334502cceb0aba1c8a2733ad5ff0ac322fcbbd0ec","start":366}],"target_id":"field.mesh.d000088744","target_kind":"node","target_sha256":"c8f399dd4eac393a180b321ede9427ceb0488d104dfd85fe8349d161ce9b49f0"}],"field.mesh.d000089323":[{"id":"assertion.field.mesh.d000089323","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geroscience as described in the captured NLM MeSH descriptor D000089323","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geroscience as: The study of the BIOLOGY ; BIOCHEMISTRY ; and PHYSIOLOGY of AGING and the AGED and age-related diseases such as CARDIOVASCULAR DISEASES ; DIABETES MELLITUS ; and CANCER , as well as debilitating conditions like ARTHRITIS ; FATIGUE ; and FRAILTY .","support":[{"end":606,"quote":"The study of the\nBIOLOGY\n;\nBIOCHEMISTRY\n; and\nPHYSIOLOGY\nof\nAGING\nand the\nAGED\nand age-related diseases such as\nCARDIOVASCULAR DISEASES\n;\nDIABETES MELLITUS\n; and\nCANCER\n, as well as debilitating conditions like\nARTHRITIS\n;\nFATIGUE\n; and\nFRAILTY\n.","source_id":"nlm-mesh.d000089323","source_sha256":"6246ec1ab04f2470d89d0fe741e5d2b02cc439d2972a47f9c5ea9f2a205f4966","start":360}],"target_id":"field.mesh.d000089323","target_kind":"node","target_sha256":"609f3d6110d667aafef5a63cf8f58af3151831ac90d42befc4256bee2b1aedf5"}],"field.mesh.d000089862":[{"id":"assertion.field.mesh.d000089862","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Haptic Technology as described in the captured NLM MeSH descriptor D000089862","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Haptic Technology as: The study of the use of touch and KINESTHESIS in order to produce HAPTIC COMPUTER INTERFACES that will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","support":[{"end":634,"quote":"The study of the use of touch and\nKINESTHESIS\nin order to produce\nHAPTIC COMPUTER INTERFACES\nthat will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","source_id":"nlm-mesh.d000089862","source_sha256":"37c544ab7251b363d426d2dc2598b903013217bbf9fef0b7dcf0bbb6c2aff319","start":424}],"target_id":"field.mesh.d000089862","target_kind":"node","target_sha256":"8ae2eb0d7e89fe155a6c6be3ee3b147c5c5ccaedd83b894fffb6ffe368a4b550"}],"field.mesh.d000095024":[{"id":"assertion.field.mesh.d000095024","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Microbiology as described in the captured NLM MeSH descriptor D000095024","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Microbiology as: The scientific discipline dedicated to analyzing evidence from BIOTERRORISM , biocrime, HOAX , or inadvertent microorganism/toxin release for attribution purposes.","support":[{"end":551,"quote":"The scientific discipline dedicated to analyzing evidence from\nBIOTERRORISM\n, biocrime,\nHOAX\n, or inadvertent microorganism/toxin release for attribution purposes.","source_id":"nlm-mesh.d000095024","source_sha256":"d914ee6a5c31352044b9a36611d1a474e91da59c68648f3318f83ee392ab3b78","start":388}],"target_id":"field.mesh.d000095024","target_kind":"node","target_sha256":"b76e335992e349d1734d691fd6a9db5acfa781f0d518c8140c4cb300e51c6b47"}],"field.mesh.d000095763":[{"id":"assertion.field.mesh.d000095763","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immunoinformatics as described in the captured NLM MeSH descriptor D000095763","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immunoinformatics as: The interface between INFORMATICS and IMMUNOLOGY . Otherwise known as computational immunology, it is the use of computational methods and resources for studying IMMUNE SYSTEM PHENOMENA .","support":[{"end":583,"quote":"The interface between\nINFORMATICS\nand\nIMMUNOLOGY\n. Otherwise known as computational immunology, it is the use of computational methods and resources for studying\nIMMUNE SYSTEM PHENOMENA\n.","source_id":"nlm-mesh.d000095763","source_sha256":"5f5b958093a17785be2ca6060df9765efeb751883308f21f7e5fa674f909fb5e","start":396}],"target_id":"field.mesh.d000095763","target_kind":"node","target_sha256":"1f7df36a24ceee786d5228e341060a14e1fcb3943b2fda01aac318a37fa57fa1"}],"field.mesh.d000096725":[{"id":"assertion.field.mesh.d000096725","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Acute Care Surgery as described in the captured NLM MeSH descriptor D000096725","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Acute Care Surgery as: Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","support":[{"end":633,"quote":"Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","source_id":"nlm-mesh.d000096725","source_sha256":"fa9d25bb2f71f5de6300f0e1543b547bf7fa3630ff55d452a6ea9c4cecc46e76","start":362}],"target_id":"field.mesh.d000096725","target_kind":"node","target_sha256":"c46523bc75f9734e2a4a737ccb359d1e9de88c9f6ea0404812160745903953ac"}],"field.mesh.d000097562":[{"id":"assertion.field.mesh.d000097562","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardio-Oncology as described in the captured NLM MeSH descriptor D000097562","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardio-Oncology as: The study, diagnosis, and treatment of CARDIOTOXICITY in patients who undergo treatment for cancer.","support":[{"end":479,"quote":"The study, diagnosis, and treatment of\nCARDIOTOXICITY\nin patients who undergo treatment for cancer.","source_id":"nlm-mesh.d000097562","source_sha256":"c370b29d1f595032d65c2333c0af5c229962b3f8452ac753a295d67c4a3e3213","start":380}],"target_id":"field.mesh.d000097562","target_kind":"node","target_sha256":"5030d607a8ac9032e3c37ffd66cd4baa0c8005a26d7f389067ca15b118463e63"}],"field.mesh.d000099051":[{"id":"assertion.field.mesh.d000099051","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Diving and Hyperbaric Medicine as described in the captured NLM MeSH descriptor D000099051","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Diving and Hyperbaric Medicine as: The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","support":[{"end":566,"quote":"The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","source_id":"nlm-mesh.d000099051","source_sha256":"f4d6d9c13c9be72dd8ccb5c101882e8d471a437c249dba619d6b467956728275","start":386}],"target_id":"field.mesh.d000099051","target_kind":"node","target_sha256":"48e58920e478b97e5c2a51aaf252ba94d91d6787894cbdf7df008b14c24f6834"}],"field.mesh.d000099079":[{"id":"assertion.field.mesh.d000099079","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Functional Medicine as described in the captured NLM MeSH descriptor D000099079","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Functional Medicine as: The clinical application of SYSTEMS BIOLOGY , that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","support":[{"end":577,"quote":"The clinical application of\nSYSTEMS BIOLOGY\n, that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","source_id":"nlm-mesh.d000099079","source_sha256":"424c81489ee74183c5c5d809d1f63f9c230bb5cd1434d36177cbdd3fe95c5994","start":360}],"target_id":"field.mesh.d000099079","target_kind":"node","target_sha256":"64f5d4be317fa3a0fb0c2f9111a062b0a9dd3690cae14ccde31ae33f7f6996d2"}],"field.mesh.d000295":[{"id":"assertion.field.mesh.d000295","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Medicine as described in the captured NLM MeSH descriptor D000295","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Medicine as: A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of ADOLESCENCE .","support":[{"end":567,"quote":"A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of\nADOLESCENCE\n.","source_id":"nlm-mesh.d000295","source_sha256":"38d6accfd2e0f3d03a6ffd51a6985b7fb73f687dae862435a6c9c575ed3acc9c","start":448}],"target_id":"field.mesh.d000295","target_kind":"node","target_sha256":"b5fef823aecf578b495b0370d8e062897e3538e7b269cc9d49ecf9660658ceae"}],"field.mesh.d000296":[{"id":"assertion.field.mesh.d000296","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Adolescent Psychiatry as described in the captured NLM MeSH descriptor D000296","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Adolescent Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","support":[{"end":617,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","source_id":"nlm-mesh.d000296","source_sha256":"d79a0f30788dcb46556b2db29fca598b6d5dd0dcb665586eb468b2f7ca336bcc","start":485}],"target_id":"field.mesh.d000296","target_kind":"node","target_sha256":"144659d1931e383b043a0600c1f293150864bd473189cdd07fa9c32da8b697e5"}],"field.mesh.d000337":[{"id":"assertion.field.mesh.d000337","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Aerospace Medicine as described in the captured NLM MeSH descriptor D000337","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Aerospace Medicine as: That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from NASA Thesaurus)","support":[{"end":815,"quote":"That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from\nNASA\nThesaurus)","source_id":"nlm-mesh.d000337","source_sha256":"a4029e3a3c2bbf87116a171aa3b9ec1db34adb9576b69e13d223b74315ad5b3a","start":561}],"target_id":"field.mesh.d000337","target_kind":"node","target_sha256":"d6f91a9c80835fabdbc2899fa3aa9fd012d409c87c52166baa791caeee6a933f"}],"field.mesh.d000486":[{"id":"assertion.field.mesh.d000486","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Allergy and Immunology as described in the captured NLM MeSH descriptor D000486","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Allergy and Immunology as: A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","support":[{"end":844,"quote":"A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","source_id":"nlm-mesh.d000486","source_sha256":"aa912c6a30d3d2b6acbb857dc0fd1e6d1bc1c978196eb6dfe19b175e4706e9e0","start":692}],"target_id":"field.mesh.d000486","target_kind":"node","target_sha256":"acb9afd94114117f3fd0407c402eb5f1cecdbaa3f0288cf24b9eb23dcfd00b89"}],"field.mesh.d000776":[{"id":"assertion.field.mesh.d000776","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anesthesiology as described in the captured NLM MeSH descriptor D000776","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anesthesiology as: A specialty concerned with the study of anesthetics and anesthesia.","support":[{"end":411,"quote":"A specialty concerned with the study of anesthetics and anesthesia.","source_id":"nlm-mesh.d000776","source_sha256":"84a265575532447db0700e08e56509b298ded46a4acb70b375cd131581b14a8a","start":344}],"target_id":"field.mesh.d000776","target_kind":"node","target_sha256":"5c70a8ed6dd7123ad3a0e2ad327b8b44154d4095ece9ed627a76f1aa1042e5b1"}],"field.mesh.d001154":[{"id":"assertion.field.mesh.d001154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Art as described in the captured NLM MeSH descriptor D001154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Art as: Processes and results of aesthetic expression.","support":[{"end":464,"quote":"Processes and results of aesthetic expression.","source_id":"nlm-mesh.d001154","source_sha256":"b13b244818c7839e3a7d4effa3e6e5423e3d6aa70728e4a57708fee804a0a967","start":418}],"target_id":"field.mesh.d001154","target_kind":"node","target_sha256":"1c65d6da7f470ca5456a9aa6f065ef0e62160f0cde73cd74291cf017fdc5580b"}],"field.mesh.d001255":[{"id":"assertion.field.mesh.d001255","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Astrology as described in the captured NLM MeSH descriptor D001255","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Astrology as: System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","support":[{"end":485,"quote":"System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","source_id":"nlm-mesh.d001255","source_sha256":"8a05723e0cb6520fd84a7ea93001e71aa5a9552c5bf0566afa871fc15737c22a","start":334}],"target_id":"field.mesh.d001255","target_kind":"node","target_sha256":"d91a6cdbbf608e457e2a4972c6637f6f4d241a0da2c4817290b2d978ccfae91d"}],"field.mesh.d001524":[{"id":"assertion.field.mesh.d001524","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Behavioral Medicine as described in the captured NLM MeSH descriptor D001524","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Behavioral Medicine as: The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","support":[{"end":651,"quote":"The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","source_id":"nlm-mesh.d001524","source_sha256":"27a7149b0a07c19a022dbee13c9cca0bd3868307853567c411d4ec680fbac019","start":366}],"target_id":"field.mesh.d001524","target_kind":"node","target_sha256":"b2c9b2b4e32cabeacf55786f30a4a3a10c71863fdf9596cff3120da323995a3f"}],"field.mesh.d001675":[{"id":"assertion.field.mesh.d001675","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bioethics as described in the captured NLM MeSH descriptor D001675","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bioethics as: A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","support":[{"end":605,"quote":"A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","source_id":"nlm-mesh.d001675","source_sha256":"f5e6108820e04e57168afa8854fe2c3bb573b62a0c00bbad24aa3de4f92732b8","start":468}],"target_id":"field.mesh.d001675","target_kind":"node","target_sha256":"24a6f408d783ae53f7e8fd5adcb752c563b492277c3ab1196e978b1c66e3b53c"}],"field.mesh.d001689":[{"id":"assertion.field.mesh.d001689","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biological Psychiatry as described in the captured NLM MeSH descriptor D001689","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biological Psychiatry as: An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","support":[{"end":596,"quote":"An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","source_id":"nlm-mesh.d001689","source_sha256":"af2365aa981f05d8a76fbc6215f46ef01d6c5d87ef65ad0f90dd3d99870f2c4c","start":378}],"target_id":"field.mesh.d001689","target_kind":"node","target_sha256":"2d2665062ac98d3d9630afb33a3a512ca99a824272642ea723a28e5de162637d"}],"field.mesh.d002665":[{"id":"assertion.field.mesh.d002665","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Child Psychiatry as described in the captured NLM MeSH descriptor D002665","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Child Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","support":[{"end":601,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","source_id":"nlm-mesh.d002665","source_sha256":"96cdbc0bce603a356a8705f99a547aa05ebe30f41c643fc0567fe1cff77f6d91","start":484}],"target_id":"field.mesh.d002665","target_kind":"node","target_sha256":"1f96d87bc97a7257c5f2bcae1ef1e7bbbe34491a28ec8f7fa26a2d0bf14f3644"}],"field.mesh.d002834":[{"id":"assertion.field.mesh.d002834","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Christian Science as described in the captured NLM MeSH descriptor D002834","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Christian Science as: A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","support":[{"end":577,"quote":"A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","source_id":"nlm-mesh.d002834","source_sha256":"7214bf49dc5e6d3b01c7ab923e070996152c554323159567dd3332ea6da6d6bd","start":406}],"target_id":"field.mesh.d002834","target_kind":"node","target_sha256":"b6a390df514868cd291ae1da3c739abb961875d71172fd1d27951f8b1ecc21a0"}],"field.mesh.d003107":[{"id":"assertion.field.mesh.d003107","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Colorectal Surgery as described in the captured NLM MeSH descriptor D003107","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Colorectal Surgery as: A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the COLON ; RECTUM ; and ANAL CANAL .","support":[{"end":571,"quote":"A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the\nCOLON\n;\nRECTUM\n; and\nANAL CANAL\n.","source_id":"nlm-mesh.d003107","source_sha256":"e5ac7ba23452cff30073759dbca3b709f8a83e04e97e0d7b5f3ee02174ddebfd","start":436}],"target_id":"field.mesh.d003107","target_kind":"node","target_sha256":"7a7932a451c8f862f5ae6a09d1a333795f04ec3a677e1799f306b36ec542ee12"}],"field.mesh.d003154":[{"id":"assertion.field.mesh.d003154","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community Medicine as described in the captured NLM MeSH descriptor D003154","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community Medicine as: A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","support":[{"end":587,"quote":"A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","source_id":"nlm-mesh.d003154","source_sha256":"9e8bf5ad410e3d380e241e888a77cac4deb1b8fc9d9c1fef9585ff4e13600fd8","start":352}],"target_id":"field.mesh.d003154","target_kind":"node","target_sha256":"5262dfb929fc6b74f86f23f665a05b64de0d7ddf096a22016e97f1b8c0472df3"}],"field.mesh.d003158":[{"id":"assertion.field.mesh.d003158","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Community Psychiatry as described in the captured NLM MeSH descriptor D003158","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Community Psychiatry as: Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","support":[{"end":688,"quote":"Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","source_id":"nlm-mesh.d003158","source_sha256":"6c0142826debca92e3a37f9b826338df7a7729aa88e67d3958937aa88687c3a7","start":376}],"target_id":"field.mesh.d003158","target_kind":"node","target_sha256":"01daf90ee8848d8601d2aaf80ed0a3541b3bb1ab6306d6cde51619b8869b3523"}],"field.mesh.d003416":[{"id":"assertion.field.mesh.d003416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Criminal Law as described in the captured NLM MeSH descriptor D003416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Criminal Law as: A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","support":[{"end":594,"quote":"A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","source_id":"nlm-mesh.d003416","source_sha256":"e69f661d4a3e70542f71dca1a8f9cbc49cc6246389ae9bbd55bde11af8300582","start":396}],"target_id":"field.mesh.d003416","target_kind":"node","target_sha256":"7566a6bd7fa92ceb32f8a97fd2e24ea489cbbd9e7ae8802d328a6c2d455adec0"}],"field.mesh.d004635":[{"id":"assertion.field.mesh.d004635","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Emergency Medicine as described in the captured NLM MeSH descriptor D004635","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Emergency Medicine as: The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","support":[{"end":715,"quote":"The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","source_id":"nlm-mesh.d004635","source_sha256":"86f164bc3c30d2775c9ce82dfe98b7e5e81485f607be009c8cfbe19bb0996482","start":419}],"target_id":"field.mesh.d004635","target_kind":"node","target_sha256":"93f8608fddc3d6260c2db1f2346848083e9e6f61c4d9be8859c1e6622f02e056"}],"field.mesh.d004954":[{"id":"assertion.field.mesh.d004954","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Esthetics as described in the captured NLM MeSH descriptor D004954","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Esthetics as: The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","support":[{"end":511,"quote":"The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","source_id":"nlm-mesh.d004954","source_sha256":"a08f6bc1dd69019ccb9432f340835c52e9019d3428b7fd6d739f1256a27378d9","start":350}],"target_id":"field.mesh.d004954","target_kind":"node","target_sha256":"40eb657a6bf87e162ac732a72034d3b07ea2cdea7ead86ac7c0bc5dffddec551"}],"field.mesh.d004989":[{"id":"assertion.field.mesh.d004989","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics as described in the captured NLM MeSH descriptor D004989","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics as: The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","support":[{"end":488,"quote":"The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","source_id":"nlm-mesh.d004989","source_sha256":"9ccb5e25621ebe1c8980a355a28d8e5e3c88eed12a29fd28d0c306cb140341f0","start":340}],"target_id":"field.mesh.d004989","target_kind":"node","target_sha256":"d40dd91f154d0dcdd66dc6484b6a2ebd1fd064c4ad3702d45c388dc4dd30add5"}],"field.mesh.d004990":[{"id":"assertion.field.mesh.d004990","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Dental as described in the captured NLM MeSH descriptor D004990","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Dental as: The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","support":[{"end":713,"quote":"The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","source_id":"nlm-mesh.d004990","source_sha256":"1fc002124e8d7fa8755c747f92936480afd8b5bb07d1a939fb68b3a6691c89f6","start":444}],"target_id":"field.mesh.d004990","target_kind":"node","target_sha256":"84a14e65a1cc446904daa9cac6391891a17e9e5fd404abcebcbb83738da1c200"}],"field.mesh.d004991":[{"id":"assertion.field.mesh.d004991","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Institutional as described in the captured NLM MeSH descriptor D004991","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Institutional as: The moral and ethical obligations or responsibilities of institutions.","support":[{"end":525,"quote":"The moral and ethical obligations or responsibilities of institutions.","source_id":"nlm-mesh.d004991","source_sha256":"cf03c73b07883928ef6ae477811fcff869c9c764ffc073689c254fdd9194cb77","start":455}],"target_id":"field.mesh.d004991","target_kind":"node","target_sha256":"f27e6e10a9949d402d36a1cec3fa5a05416e0c89d16c3fb2d7c2ac8c4d2c25a9"}],"field.mesh.d004993":[{"id":"assertion.field.mesh.d004993","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Nursing as described in the captured NLM MeSH descriptor D004993","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Nursing as: The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","support":[{"end":633,"quote":"The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","source_id":"nlm-mesh.d004993","source_sha256":"856e51f3f187db9c79be5f0465b4b56f7c9b24bbe9975fe1eca363029ff4fd20","start":398}],"target_id":"field.mesh.d004993","target_kind":"node","target_sha256":"d989aef6670824d37ff9616d5680298d37dcd3e1263d9f8cdf97ed38e7968bf9"}],"field.mesh.d004995":[{"id":"assertion.field.mesh.d004995","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Professional as described in the captured NLM MeSH descriptor D004995","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Professional as: The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","support":[{"end":688,"quote":"The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","source_id":"nlm-mesh.d004995","source_sha256":"ba05820d3c293a7c97178368f71dc6e58403100b110b3b4149889d44de080166","start":413}],"target_id":"field.mesh.d004995","target_kind":"node","target_sha256":"484c2bc1584986abdb4e1bc7024afb7cfde72df6406f5b92567f585d6b611fed"}],"field.mesh.d005053":[{"id":"assertion.field.mesh.d005053","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Eugenics as described in the captured NLM MeSH descriptor D005053","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Eugenics as: The attempt to improve the PHENOTYPES of future generations of the human population by fostering the reproduction of those with favorable phenotypes and GENOTYPES and hampering or preventing BREEDING by those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":686,"quote":"The attempt to improve the\nPHENOTYPES\nof future generations of the human population by fostering the reproduction of those with favorable phenotypes and\nGENOTYPES\nand hampering or preventing\nBREEDING\nby those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.d005053","source_sha256":"230855404e747ac91d1496b36d8d1ff45748274e57038431e960e395cb96f01c","start":332}],"target_id":"field.mesh.d005053","target_kind":"node","target_sha256":"637fe5255caa5916fb7d3a91bd7e72645c19163b03367b79d27d970e48644468"}],"field.mesh.d005191":[{"id":"assertion.field.mesh.d005191","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Characteristics as described in the captured NLM MeSH descriptor D005191","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Characteristics as: Size and composition of the family.","support":[{"end":475,"quote":"Size and composition of the family.","source_id":"nlm-mesh.d005191","source_sha256":"5252a3698a500a6038b522652f44f22597fde8daf1965ee322300a4ed7687035","start":440}],"target_id":"field.mesh.d005191","target_kind":"node","target_sha256":"c4a00a1ebbb512284fd57dc1478959b8deff69d291b40043962468f89224aaf0"}],"field.mesh.d005194":[{"id":"assertion.field.mesh.d005194","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Family Practice as described in the captured NLM MeSH descriptor D005194","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Family Practice as: A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","support":[{"end":470,"quote":"A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","source_id":"nlm-mesh.d005194","source_sha256":"daf11d026840e32f67ef85f1d8d243bf32361693845de6314d1fa32596e903d4","start":350}],"target_id":"field.mesh.d005194","target_kind":"node","target_sha256":"e9a14d7f2ad30de2437cd348d0aed82d8f578927f93168612287bded2b738c04"}],"field.mesh.d005554":[{"id":"assertion.field.mesh.d005554","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Medicine as described in the captured NLM MeSH descriptor D005554","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Medicine as: The application of medical knowledge to questions of law.","support":[{"end":738,"quote":"The application of medical knowledge to questions of law.","source_id":"nlm-mesh.d005554","source_sha256":"e3bf2a8c7c82a21b22fa47a911ea836112c63ed72c8258f336eb50f9ee63728e","start":681}],"target_id":"field.mesh.d005554","target_kind":"node","target_sha256":"ce7f4ef77ffc01f955f9d6241e516e5fb8c13135c4969bb0859ba63db81ffac7"}],"field.mesh.d005555":[{"id":"assertion.field.mesh.d005555","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Psychiatry as described in the captured NLM MeSH descriptor D005555","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Psychiatry as: Psychiatry in its legal aspects. This includes criminology, penology, COMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS , the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","support":[{"end":674,"quote":"Psychiatry in its legal aspects. This includes criminology, penology,\nCOMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS\n, the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","source_id":"nlm-mesh.d005555","source_sha256":"d1d593bbce684ea8c6a731495b4810886e6f4f701774806af32c4421c7cf8e82","start":430}],"target_id":"field.mesh.d005555","target_kind":"node","target_sha256":"a4cdc5b6c3612ec9c423a26b45fc25cc826437347414f542d8fdc5c8858c3b18"}],"field.mesh.d005826":[{"id":"assertion.field.mesh.d005826","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Genetics, Medical as described in the captured NLM MeSH descriptor D005826","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Genetics, Medical as: A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","support":[{"end":712,"quote":"A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","source_id":"nlm-mesh.d005826","source_sha256":"9b7134eb1a95f7c770be84c729801dc78401d1612bc4ebcae8639580c5c0c54e","start":502}],"target_id":"field.mesh.d005826","target_kind":"node","target_sha256":"6d81f231931572fe1dfae9cc4e6bfc0ed60bbc1b22f57019d800f118fd66b669"}],"field.mesh.d005852":[{"id":"assertion.field.mesh.d005852","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatric Psychiatry as described in the captured NLM MeSH descriptor D005852","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatric Psychiatry as: A subspecialty of psychiatry concerned with the mental health of the aged.","support":[{"end":550,"quote":"A subspecialty of psychiatry concerned with the mental health of the aged.","source_id":"nlm-mesh.d005852","source_sha256":"687632f1e37cadc7c3044e6708ebd04695e71f7b65d9dedee4dc69538cfb849c","start":476}],"target_id":"field.mesh.d005852","target_kind":"node","target_sha256":"a809585f96d909bdbe33f88a2f550f3fe7ef9dc900ef3535b537c4eae975efe5"}],"field.mesh.d005853":[{"id":"assertion.field.mesh.d005853","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geriatrics as described in the captured NLM MeSH descriptor D005853","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geriatrics as: The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","support":[{"end":566,"quote":"The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","source_id":"nlm-mesh.d005853","source_sha256":"f5b09e5715c6743e7ca82a18742006a11b93d03c3c842ee750baea148e730faf","start":413}],"target_id":"field.mesh.d005853","target_kind":"node","target_sha256":"06c1405d5057eee5c8e5c7f21a166c30599cc154ffe2cf359af971f056c03dbd"}],"field.mesh.d006663":[{"id":"assertion.field.mesh.d006663","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Historiography as described in the captured NLM MeSH descriptor D006663","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Historiography as: The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","support":[{"end":478,"quote":"The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","source_id":"nlm-mesh.d006663","source_sha256":"5cb377209ea12e49e92621abc3525c195af65be37808b1900cb028aad65c7956","start":344}],"target_id":"field.mesh.d006663","target_kind":"node","target_sha256":"91e828607a601824a4029222ff15c65ba6e58d8ca8651ae2185f20d4cd9f62ad"}],"field.mesh.d006664":[{"id":"assertion.field.mesh.d006664","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History as described in the captured NLM MeSH descriptor D006664","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History as: Record and study of past events.","support":[{"end":460,"quote":"Record and study of past events.","source_id":"nlm-mesh.d006664","source_sha256":"26f4fff4783c19df709a539cb8a7cf62efdfa8de13499c31446ca612ba2e046a","start":428}],"target_id":"field.mesh.d006664","target_kind":"node","target_sha256":"a4d5248d8d59c758495c43b43ec1e72f61963b52656d729f2bfa5082b78c96aa"}],"field.mesh.d006666":[{"id":"assertion.field.mesh.d006666","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History of Medicine as described in the captured NLM MeSH descriptor D006666","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History of Medicine as: Study of past events and development in the field of Medicine.","support":[{"end":600,"quote":"Study of past events and development in the field of Medicine.","source_id":"nlm-mesh.d006666","source_sha256":"570988beb1917485117417573b7db3c2353f99cc486b3462127bf7a44eb56b37","start":538}],"target_id":"field.mesh.d006666","target_kind":"node","target_sha256":"0bfeec700b0f2eb842e8baba4697bfadb3c6f5c6024d7143ab1b7caa48659404"}],"field.mesh.d006804":[{"id":"assertion.field.mesh.d006804","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ergonomics as described in the captured NLM MeSH descriptor D006804","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ergonomics as: The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","support":[{"end":621,"quote":"The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","source_id":"nlm-mesh.d006804","source_sha256":"f661a116708147aa3ea37ee69676f8b61ba3820f4f0586b05b7288a106015e33","start":427}],"target_id":"field.mesh.d006804","target_kind":"node","target_sha256":"39dcc5776e961755fed1f1e625bdfb1f93ddd89c5bb3f5a9a0758c71a4592dee"}],"field.mesh.d007120":[{"id":"assertion.field.mesh.d007120","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Immunochemistry as described in the captured NLM MeSH descriptor D007120","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Immunochemistry as: Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","support":[{"end":697,"quote":"Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","source_id":"nlm-mesh.d007120","source_sha256":"73806bc3b805a64bb75f52c1f5cd4e4e6a8a73b61ae9cf786ab8ec31a3022e95","start":485}],"target_id":"field.mesh.d007120","target_kind":"node","target_sha256":"ec1da04875a4758915082b47c5c4af3e8c87306d07a58b404ede1d0f56fc5475"}],"field.mesh.d007218":[{"id":"assertion.field.mesh.d007218","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Industrial Microbiology as described in the captured NLM MeSH descriptor D007218","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Industrial Microbiology as: The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","support":[{"end":578,"quote":"The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","source_id":"nlm-mesh.d007218","source_sha256":"d2c0e796fc10f710581139b0654b642cd6bc7bfd52aa1f45dd4c283dd067b253","start":386}],"target_id":"field.mesh.d007218","target_kind":"node","target_sha256":"c4204c9806463b423f3a0811b3f5ec6a903abc4ee19d0bb2d06fee860ea0bc80"}],"field.mesh.d007388":[{"id":"assertion.field.mesh.d007388","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Internal Medicine as described in the captured NLM MeSH descriptor D007388","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Internal Medicine as: A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","support":[{"end":486,"quote":"A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","source_id":"nlm-mesh.d007388","source_sha256":"0bee9d581efb0b42c53db51ae0ada5273360c0219f2abd5cbe354675016e106b","start":371}],"target_id":"field.mesh.d007388","target_kind":"node","target_sha256":"ee7e559e66f1552967eb23b6dff8d34118423e076e3e58735cfc7e85208b7b2d"}],"field.mesh.d008091":[{"id":"assertion.field.mesh.d008091","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature as described in the captured NLM MeSH descriptor D008091","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature as: Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","support":[{"end":596,"quote":"Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","source_id":"nlm-mesh.d008091","source_sha256":"328c7114462c3a55144fef357738b2c1a10e5cd66b9c298bbff0764f387f267f","start":396}],"target_id":"field.mesh.d008091","target_kind":"node","target_sha256":"848a773b9dd5d95f59d4e461e21d8d663ced8dc2fca3d4291ca7434b67216788"}],"field.mesh.d008092":[{"id":"assertion.field.mesh.d008092","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature, Medieval as described in the captured NLM MeSH descriptor D008092","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature, Medieval as: Writings originating in the 5th century A.D. through the 15h century.","support":[{"end":492,"quote":"Writings originating in the 5th century A.D. through the 15h century.","source_id":"nlm-mesh.d008092","source_sha256":"41b48524159490df781eaa2397169415afee46f63db67bc090de13987bb864bf","start":423}],"target_id":"field.mesh.d008092","target_kind":"node","target_sha256":"bde8ea59a20ae3c776f26ef0e9437c93787efa1fa8901807bf41326204ec7a7a"}],"field.mesh.d008093":[{"id":"assertion.field.mesh.d008093","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Literature, Modern as described in the captured NLM MeSH descriptor D008093","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Literature, Modern as: Writings originating from the 15th century A.D. to the present","support":[{"end":513,"quote":"Writings originating from the 15th century A.D. to the present","source_id":"nlm-mesh.d008093","source_sha256":"5b079d81f4c82b48025e2b4b8dda0f014880b63e1d7d80065ec6a3a2e756e6e1","start":451}],"target_id":"field.mesh.d008093","target_kind":"node","target_sha256":"9c37d4aad70ed7e4e5cd9d1157f6c0aa8e9d4fd542ff5ef6e87d58d1d64e54ab"}],"field.mesh.d008433":[{"id":"assertion.field.mesh.d008433","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mathematics as described in the captured NLM MeSH descriptor D008433","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mathematics as: The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":650,"quote":"The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.d008433","source_sha256":"483a0ff03e582d89c450eaf31269edb1510f643d4fb3cd6e88c34faadfe9c422","start":523}],"target_id":"field.mesh.d008433","target_kind":"node","target_sha256":"89fddea04c4b616e512c2b3a8f81bfa55f25cfe015b766ea430e8eb918a4860c"}],"field.mesh.d008495":[{"id":"assertion.field.mesh.d008495","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Oncology as described in the captured NLM MeSH descriptor D008495","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Oncology as: A subspecialty of internal medicine concerned with the study of neoplasms.","support":[{"end":501,"quote":"A subspecialty of internal medicine concerned with the study of neoplasms.","source_id":"nlm-mesh.d008495","source_sha256":"ec1b4579f838aaf4631107a17760818bad5b6363489115bdee06748bd060df93","start":427}],"target_id":"field.mesh.d008495","target_kind":"node","target_sha256":"977979d111b500793d148291f08ad478abb03ea4b5804a1bdaea74ad43e7ac61"}],"field.mesh.d008511":[{"id":"assertion.field.mesh.d008511","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine as described in the captured NLM MeSH descriptor D008511","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine as: The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","support":[{"end":935,"quote":"The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","source_id":"nlm-mesh.d008511","source_sha256":"a764f83e8800f5fade6406d58ffdc005120d99f1dbbc5e855cfc09550b8714f1","start":795}],"target_id":"field.mesh.d008511","target_kind":"node","target_sha256":"c0b02a9fc660d6b5f254313e16dcf59867e30bfdaafe6203bb7a3b858df5836d"}],"field.mesh.d008513":[{"id":"assertion.field.mesh.d008513","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medicine in Literature as described in the captured NLM MeSH descriptor D008513","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medicine in Literature as: Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","support":[{"end":624,"quote":"Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","source_id":"nlm-mesh.d008513","source_sha256":"504b6a97f8cd244514e11b649800eb18623bfbc960381aa1cb41bcd7a7590dfb","start":506}],"target_id":"field.mesh.d008513","target_kind":"node","target_sha256":"a396a7a16c35ec4daa1653654eb7b191658a0ced189244fe4175cd64f92ff776"}],"field.mesh.d008678":[{"id":"assertion.field.mesh.d008678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Metaphysics as described in the captured NLM MeSH descriptor D008678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","support":[{"end":579,"quote":"The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.d008678","source_sha256":"ca4c9beb6311ce2fcbcb9e412dffed2e1e5a53ee24a9c103b651a41ee811ef6b","start":361}],"target_id":"field.mesh.d008678","target_kind":"node","target_sha256":"88920d49f9b5e59132f2dbbd520d9aab5931330ab18b01787be1ce3033686594"}],"field.mesh.d008887":[{"id":"assertion.field.mesh.d008887","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Military Medicine as described in the captured NLM MeSH descriptor D008887","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Military Medicine as: The practice of medicine as applied to special circumstances associated with military operations.","support":[{"end":616,"quote":"The practice of medicine as applied to special circumstances associated with military operations.","source_id":"nlm-mesh.d008887","source_sha256":"0e33ce869323e73fc65b2588439b68a5e40272d54e464b1d95b2405ad94aa503","start":519}],"target_id":"field.mesh.d008887","target_kind":"node","target_sha256":"3663736cf015d70df59f1a6b5176e62d1215ea159b39033e4330010f3bd84b8f"}],"field.mesh.d008890":[{"id":"assertion.field.mesh.d008890","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Military Psychiatry as described in the captured NLM MeSH descriptor D008890","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Military Psychiatry as: Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","support":[{"end":610,"quote":"Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","source_id":"nlm-mesh.d008890","source_sha256":"ebc3919b182666a3fcfdb66fe386998c5cf59bc88d4ed35ed0e4fc110eca2ca0","start":444}],"target_id":"field.mesh.d008890","target_kind":"node","target_sha256":"5ba2ef5dcc97ef878d210933b9d6343ca5c403a8977f04c16e6dedbceca170cf"}],"field.mesh.d009146":[{"id":"assertion.field.mesh.d009146","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Music as described in the captured NLM MeSH descriptor D009146","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Music as: Sound that expresses emotion through rhythm, melody, and harmony.","support":[{"end":430,"quote":"Sound that expresses emotion through rhythm, melody, and harmony.","source_id":"nlm-mesh.d009146","source_sha256":"184effda1ad0a389039fea99ffd297551abe2ff0b245e98a749548bd161fd695","start":365}],"target_id":"field.mesh.d009146","target_kind":"node","target_sha256":"0ee28e2f221239125902361d6b6b8e9b6cf5c087b65bdf162fdfbb08dd5e570d"}],"field.mesh.d009229":[{"id":"assertion.field.mesh.d009229","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Mythology as described in the captured NLM MeSH descriptor D009229","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Mythology as: A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","support":[{"end":703,"quote":"A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","source_id":"nlm-mesh.d009229","source_sha256":"ea9a5687024b780712cd2169642a5bc73421c4667f45627846813274406bc52f","start":416}],"target_id":"field.mesh.d009229","target_kind":"node","target_sha256":"2d8a68f997a953aea8f804fa389e6ddd551f52a536f66d2ac67daa38f7977c13"}],"field.mesh.d009326":[{"id":"assertion.field.mesh.d009326","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Naval Medicine as described in the captured NLM MeSH descriptor D009326","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Naval Medicine as: The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","support":[{"end":610,"quote":"The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","source_id":"nlm-mesh.d009326","source_sha256":"ec46b7ad1cbe35c4b43147595e5c14264ccdfb015fb8431debec11ef6ebd46fb","start":484}],"target_id":"field.mesh.d009326","target_kind":"node","target_sha256":"b157ee9513a82042046d8af4c789495f94ca33d4fbe32b5d0117d27cb4266375"}],"field.mesh.d009493":[{"id":"assertion.field.mesh.d009493","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurosurgery as described in the captured NLM MeSH descriptor D009493","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurosurgery as: A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","support":[{"end":493,"quote":"A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","source_id":"nlm-mesh.d009493","source_sha256":"0ed1ee3ded8ee1a3c1e0508242f76419277b4c342b50adb97f12f0871d70695f","start":344}],"target_id":"field.mesh.d009493","target_kind":"node","target_sha256":"24729774ab1c2a44bfff27aa07dd40d964cc79322b72be2c2bb38a79c00004dd"}],"field.mesh.d009683":[{"id":"assertion.field.mesh.d009683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nuclear Medicine as described in the captured NLM MeSH descriptor D009683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nuclear Medicine as: A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","support":[{"end":470,"quote":"A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","source_id":"nlm-mesh.d009683","source_sha256":"e6bf077fe4508118c35b0c890690da016fa5fa5ba552f4c727563f43b7e58b10","start":352}],"target_id":"field.mesh.d009683","target_kind":"node","target_sha256":"0b08ab53d097210d69b2c41dea8d487f07daf519b8f22be1195638cca62412a3"}],"field.mesh.d009717":[{"id":"assertion.field.mesh.d009717","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Numismatics as described in the captured NLM MeSH descriptor D009717","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Numismatics as: Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","support":[{"end":715,"quote":"Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","source_id":"nlm-mesh.d009717","source_sha256":"c211f04f7ff9947bcca5875877241e31909c4d7a888a49cf1c36d586cda74cb6","start":603}],"target_id":"field.mesh.d009717","target_kind":"node","target_sha256":"1da8aa7fda45d1900baea694de7029ae31fb21ff556aba76aeabbd53a6ab42a9"}],"field.mesh.d009774":[{"id":"assertion.field.mesh.d009774","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Obstetrics as described in the captured NLM MeSH descriptor D009774","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Obstetrics as: A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","support":[{"end":566,"quote":"A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","source_id":"nlm-mesh.d009774","source_sha256":"cd7a00a12ef4afb1c7d902217d3f1d1afb8110117eb9562fba9dc24ae5d5d4d6","start":443}],"target_id":"field.mesh.d009774","target_kind":"node","target_sha256":"1fe64fc0fec46b13e6767d448ea3eac936877830ce5ac46a887054281acb79d4"}],"field.mesh.d009985":[{"id":"assertion.field.mesh.d009985","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orthopedics as described in the captured NLM MeSH descriptor D009985","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orthopedics as: A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","support":[{"end":629,"quote":"A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","source_id":"nlm-mesh.d009985","source_sha256":"7ff68109c0d16be0adca538acfde2f5534be7af7c38051a79e43c023547a63e1","start":436}],"target_id":"field.mesh.d009985","target_kind":"node","target_sha256":"fa6792265c333247200298d2df74bf58e4ced5ff9db88b44c5544a098858cc93"}],"field.mesh.d010021":[{"id":"assertion.field.mesh.d010021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Osteopathic Medicine as described in the captured NLM MeSH descriptor D010021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Osteopathic Medicine as: A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the MUSCULOSKELETAL SYSTEM .","support":[{"end":819,"quote":"A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the\nMUSCULOSKELETAL SYSTEM\n.","source_id":"nlm-mesh.d010021","source_sha256":"b2109352d05c9c43e6ac5f71b0c790af7e5070e06aa586e6d50cdf38918f4663","start":445}],"target_id":"field.mesh.d010021","target_kind":"node","target_sha256":"b2c381026d69e3af629fdcad49b442a6b75fe67aecfe2d0fcbdd55bb77c840b5"}],"field.mesh.d010036":[{"id":"assertion.field.mesh.d010036","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Otolaryngology as described in the captured NLM MeSH descriptor D010036","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Otolaryngology as: A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","support":[{"end":557,"quote":"A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","source_id":"nlm-mesh.d010036","source_sha256":"da97a0e59062a0741a868c1ef89024665e905b79cbbde1c6e43096f78aca519d","start":455}],"target_id":"field.mesh.d010036","target_kind":"node","target_sha256":"bcc94cba537048aa63fee3db2214842d73f564357bbd8a712ffd8335f396572f"}],"field.mesh.d010338":[{"id":"assertion.field.mesh.d010338","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Clinical as described in the captured NLM MeSH descriptor D010338","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Clinical as: A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","support":[{"end":603,"quote":"A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","source_id":"nlm-mesh.d010338","source_sha256":"50977746c10deb7a11bd9e7c640427b09e4a0705134f93b6cd4a46c2e19704be","start":446}],"target_id":"field.mesh.d010338","target_kind":"node","target_sha256":"8a009edfc88d1bd941b2b7c9e89e8aaae29458eb5a4c805a616bd8e15bd5cb09"}],"field.mesh.d010340":[{"id":"assertion.field.mesh.d010340","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Surgical as described in the captured NLM MeSH descriptor D010340","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Surgical as: A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","support":[{"end":478,"quote":"A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","source_id":"nlm-mesh.d010340","source_sha256":"98a161517b98d84ed6d17f818df8b41c64e117a23abeb72fbb9c98be70ab5ffe","start":358}],"target_id":"field.mesh.d010340","target_kind":"node","target_sha256":"cfe30c2a77c0f2874f0b625c2892db21544d6dab436cdd8a9dc8b2fb4f417949"}],"field.mesh.d010372":[{"id":"assertion.field.mesh.d010372","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pediatrics as described in the captured NLM MeSH descriptor D010372","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pediatrics as: A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","support":[{"end":476,"quote":"A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","source_id":"nlm-mesh.d010372","source_sha256":"ba60cc5402c9c0e3952fe3a33a40e649b36dad43ad1900e779932689eb4a2c9f","start":357}],"target_id":"field.mesh.d010372","target_kind":"node","target_sha256":"c0b8e38917d3bc9932fd115fec50ede98604d44c8f2e276ccf79b93d2ad807ec"}],"field.mesh.d010500":[{"id":"assertion.field.mesh.d010500","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Perinatology as described in the captured NLM MeSH descriptor D010500","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Perinatology as: The branch of medicine dealing with the FETUS and NEWBORN during the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","support":[{"end":633,"quote":"The branch of medicine dealing with the\nFETUS\nand\nNEWBORN\nduring the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","source_id":"nlm-mesh.d010500","source_sha256":"85c08faf817704a304f4ed7f4368aecf0b3c20f713180ac10ac718ee7ae4ec2a","start":438}],"target_id":"field.mesh.d010500","target_kind":"node","target_sha256":"8aacf667623330ea0f9710e3145eb8345f2f250e277f438294ea8f72c3ac6fc4"}],"field.mesh.d010681":[{"id":"assertion.field.mesh.d010681","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Classical as described in the captured NLM MeSH descriptor D010681","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Classical as: The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":504,"quote":"The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010681","source_sha256":"2abdc64693fd8cff57a0bb6ffeec03d1d26e7c93fd670cf4a5d9065e8d23fdee","start":360}],"target_id":"field.mesh.d010681","target_kind":"node","target_sha256":"b0654f6fd297faafd83bbdf95721db44f6b1194a9d710c5a928577c4458dee2c"}],"field.mesh.d010682":[{"id":"assertion.field.mesh.d010682","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Oriental as described in the captured NLM MeSH descriptor D010682","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Oriental as: The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":524,"quote":"The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010682","source_sha256":"53111d2bb2594f9873eb7358229818bccea051152b07b9793ef888e43b49ef55","start":358}],"target_id":"field.mesh.d010682","target_kind":"node","target_sha256":"7328d6c0811944b5fcafea84e01f8317926171b60b668f16d5a8f7342f532712"}],"field.mesh.d010683":[{"id":"assertion.field.mesh.d010683","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philology, Romance as described in the captured NLM MeSH descriptor D010683","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philology, Romance as: The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","support":[{"end":569,"quote":"The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","source_id":"nlm-mesh.d010683","source_sha256":"344d9da5a42209c7ad89a48c02438e82bec1f92c26feafcb06d6840c3687b09a","start":356}],"target_id":"field.mesh.d010683","target_kind":"node","target_sha256":"4eb0825bed9d50fb6c3c9de753fb4a1aac32ade01d092c91bd66863e6c7c744d"}],"field.mesh.d010685":[{"id":"assertion.field.mesh.d010685","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Dental as described in the captured NLM MeSH descriptor D010685","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Dental as: The underlying rationale or theoretical basis for the principles of DENTISTRY .","support":[{"end":431,"quote":"The underlying rationale or theoretical basis for the principles of\nDENTISTRY\n.","source_id":"nlm-mesh.d010685","source_sha256":"f23451b055c7e1dc807ea5c196b9e54ad55aaab56bfbbde54d3787a9311be6ca","start":352}],"target_id":"field.mesh.d010685","target_kind":"node","target_sha256":"5c9964ae8af97c3ee7c6d653668494c6d52716816f39ead10472886f7393dea8"}],"field.mesh.d010686":[{"id":"assertion.field.mesh.d010686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Medical as described in the captured NLM MeSH descriptor D010686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Medical as: The underlying rationale or theoretical basis for the principles of MEDICINE .","support":[{"end":432,"quote":"The underlying rationale or theoretical basis for the principles of\nMEDICINE\n.","source_id":"nlm-mesh.d010686","source_sha256":"5df85c4ad982d0d180db891173ae8710e3ab275aa5d152ffb92b38c29a0b223d","start":354}],"target_id":"field.mesh.d010686","target_kind":"node","target_sha256":"8482b57755e902a2a88464a1adae120cb1507f9f34288fddef2e6e1fbc231e5d"}],"field.mesh.d010687":[{"id":"assertion.field.mesh.d010687","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Philosophy, Nursing as described in the captured NLM MeSH descriptor D010687","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Philosophy, Nursing as: The underlying rationale or theoretical basis for the principles of NURSING .","support":[{"end":431,"quote":"The underlying rationale or theoretical basis for the principles of\nNURSING\n.","source_id":"nlm-mesh.d010687","source_sha256":"d79c409f044a154436377b568ccdda1641d5a269a88794b072c811946a3a3c23","start":354}],"target_id":"field.mesh.d010687","target_kind":"node","target_sha256":"20c484dc9474e95a9c2ce403e9d542c23dacb583328df9a21b72f36b3fb7cc94"}],"field.mesh.d010792":[{"id":"assertion.field.mesh.d010792","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Phrenology as described in the captured NLM MeSH descriptor D010792","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Phrenology as: The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","support":[{"end":519,"quote":"The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","source_id":"nlm-mesh.d010792","source_sha256":"8d8e19f93d8e55cb2d8acfd12fb0ada034b0f55340d9b355f9ca68635ee66b1d","start":336}],"target_id":"field.mesh.d010792","target_kind":"node","target_sha256":"086d0d894fb0b61b47a22f69c9543957a953f76545e0fcb47df08cea7f857b08"}],"field.mesh.d010810":[{"id":"assertion.field.mesh.d010810","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Physical and Rehabilitation Medicine as described in the captured NLM MeSH descriptor D010810","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Physical and Rehabilitation Medicine as: A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","support":[{"end":697,"quote":"A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","source_id":"nlm-mesh.d010810","source_sha256":"9eb503ff3a1f78aa0ef1c30f31701175dab2adbe62ced8b190fe398720f4118f","start":537}],"target_id":"field.mesh.d010810","target_kind":"node","target_sha256":"3dea61ce3b2af02d74a7f9c4a335c6b8c6ad3c6d566f7c5044d1c204c6450907"}],"field.mesh.d011057":[{"id":"assertion.field.mesh.d011057","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Politics as described in the captured NLM MeSH descriptor D011057","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.","support":[{"end":429,"quote":"Activities concerned with governmental policies, functions, etc.","source_id":"nlm-mesh.d011057","source_sha256":"a1ed5c1deb12c39c565f82c9ca80135cae350a3ff0026bc8390ef284fbefed35","start":365}],"target_id":"field.mesh.d011057","target_kind":"node","target_sha256":"d153abc7b3d102ee0cf58552558bb5bdb5b0249bacfdf3299e8fc88b2b00a351"}],"field.mesh.d011157":[{"id":"assertion.field.mesh.d011157","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Population Dynamics as described in the captured NLM MeSH descriptor D011157","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Population Dynamics as: The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","support":[{"end":565,"quote":"The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","source_id":"nlm-mesh.d011157","source_sha256":"a79437150cd920350237e854e16dc0ee97d9ec818e97a0bfe7475534823cffcd","start":447}],"target_id":"field.mesh.d011157","target_kind":"node","target_sha256":"9ad802ed7ed9a8b51f1f4dfb8f6723f25f5aecce68aa7c2c0339de441ea9e4ea"}],"field.mesh.d011315":[{"id":"assertion.field.mesh.d011315","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Preventive Medicine as described in the captured NLM MeSH descriptor D011315","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Preventive Medicine as: A medical specialty primarily concerned with prevention of disease ( PRIMARY PREVENTION ) and the promotion and preservation of health in the individual.","support":[{"end":665,"quote":"A medical specialty primarily concerned with prevention of disease (\nPRIMARY PREVENTION\n) and the promotion and preservation of health in the individual.","source_id":"nlm-mesh.d011315","source_sha256":"c0c186c3d01b7591076ff23c55e587197874a35bc1d21fcfffce6ae64d1427e0","start":512}],"target_id":"field.mesh.d011315","target_kind":"node","target_sha256":"3fd2aa14c0006dfb4b722d2a87723b328542a5f94d01f343b8dc871f59671787"}],"field.mesh.d011316":[{"id":"assertion.field.mesh.d011316","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Preventive Psychiatry as described in the captured NLM MeSH descriptor D011316","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Preventive Psychiatry as: A discipline concerned with the prevention of mental illness and the promotion of mental health.","support":[{"end":621,"quote":"A discipline concerned with the prevention of mental illness and the promotion of mental health.","source_id":"nlm-mesh.d011316","source_sha256":"849bd45b2617d356a15137557d48cb7407cd24d80ecb2eff6ecacb8726b591ff","start":525}],"target_id":"field.mesh.d011316","target_kind":"node","target_sha256":"8dade37ea53547d54515eeb54caae6168a90d68f35c9618105e79450a6060917"}],"field.mesh.d011570":[{"id":"assertion.field.mesh.d011570","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychiatry as described in the captured NLM MeSH descriptor D011570","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","support":[{"end":517,"quote":"The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","source_id":"nlm-mesh.d011570","source_sha256":"1e931e1765b8d4912f3b3157b0acc7638ba2662082d3940ddbe989aacbfa9899","start":412}],"target_id":"field.mesh.d011570","target_kind":"node","target_sha256":"5c6fe12db00331175dcfde1443202988a355f6a5d374a5a5853d96c56787b3b0"}],"field.mesh.d011593":[{"id":"assertion.field.mesh.d011593","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychology, Social as described in the captured NLM MeSH descriptor D011593","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","support":[{"end":549,"quote":"The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","source_id":"nlm-mesh.d011593","source_sha256":"da9760990d68ed77c4c9fdfb678ce4a366011d4b6fc6688b7cbe74c5941d62b3","start":418}],"target_id":"field.mesh.d011593","target_kind":"node","target_sha256":"4ea8036cb8e1c3c0cced67238285ff93937934c26f652682c023bd0cba972062"}],"field.mesh.d011634":[{"id":"assertion.field.mesh.d011634","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Public Health as described in the captured NLM MeSH descriptor D011634","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Public Health as: Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","support":[{"end":641,"quote":"Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","source_id":"nlm-mesh.d011634","source_sha256":"49d795fe2078dfd8ecda286471f8683955f3725a0f4b68fdaaefcc72e77d6462","start":429}],"target_id":"field.mesh.d011634","target_kind":"node","target_sha256":"6093893aae4e5111cffdb6ff371e83f4ea2436006015b717660a930cf292d3c9"}],"field.mesh.d012067":[{"id":"assertion.field.mesh.d012067","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion as described in the captured NLM MeSH descriptor D012067","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion as: A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","support":[{"end":628,"quote":"A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","source_id":"nlm-mesh.d012067","source_sha256":"571c96ac68a8f7b1c5819aefdfc5c41f6b047c21e2293ba989f7cf95a93ac907","start":328}],"target_id":"field.mesh.d012067","target_kind":"node","target_sha256":"2274c42cf65e0305dc6568904cb17977cb7bf934117f8bdc332d143afdde36f8"}],"field.mesh.d012068":[{"id":"assertion.field.mesh.d012068","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Medicine as described in the captured NLM MeSH descriptor D012068","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Medicine as: The interrelationship of medicine and religion.","support":[{"end":475,"quote":"The interrelationship of medicine and religion.","source_id":"nlm-mesh.d012068","source_sha256":"95ac2c14cbff1fec2245216773ce10c4cc098ce17b27eb14a7cc77b7aac82f8d","start":428}],"target_id":"field.mesh.d012068","target_kind":"node","target_sha256":"1aac76aa089e0529e3483f5ac2c34b7b52ae71a08651b25ca7b41eb15a3411fa"}],"field.mesh.d012069":[{"id":"assertion.field.mesh.d012069","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Psychology as described in the captured NLM MeSH descriptor D012069","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Psychology as: The interrelationship of psychology and religion.","support":[{"end":419,"quote":"The interrelationship of psychology and religion.","source_id":"nlm-mesh.d012069","source_sha256":"44b773afc3f7899a6b31f0853c1ab45ab7d0392991c506a8545cb66c16b20421","start":370}],"target_id":"field.mesh.d012069","target_kind":"node","target_sha256":"01af8a1a0e4d7381a9b20398a7cb5af5b8a23740725a850221f463e422135819"}],"field.mesh.d012070":[{"id":"assertion.field.mesh.d012070","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Religion and Science as described in the captured NLM MeSH descriptor D012070","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Religion and Science as: The interrelationship of science and religion.","support":[{"end":402,"quote":"The interrelationship of science and religion.","source_id":"nlm-mesh.d012070","source_sha256":"b45591271567e9764a19b0338ca34e30afe07561f96d43a43857792a79bacc66","start":356}],"target_id":"field.mesh.d012070","target_kind":"node","target_sha256":"046955660d7ed6f8e26c9d2c29a730e0e0e639e19335853e301faf252b78ec40"}],"field.mesh.d012371":[{"id":"assertion.field.mesh.d012371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Robotics as described in the captured NLM MeSH descriptor D012371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Robotics as: The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","support":[{"end":662,"quote":"The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","source_id":"nlm-mesh.d012371","source_sha256":"ab268773c4669260cf016ebf523e4d14ba9bcf8183bd61a01abb6f9a94476cc8","start":372}],"target_id":"field.mesh.d012371","target_kind":"node","target_sha256":"03918f2946d235ac03094687f2c39bf0804f07ef7cb508274bf91ca35b5de0da"}],"field.mesh.d012586":[{"id":"assertion.field.mesh.d012586","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Science as described in the captured NLM MeSH descriptor D012586","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Science as: The study of natural phenomena by observation, measurement, and experimentation.","support":[{"end":471,"quote":"The study of natural phenomena by observation, measurement, and experimentation.","source_id":"nlm-mesh.d012586","source_sha256":"39b60447bdd83ff694373661139be4164623ddb0ce6621f784b828e88ad80d4a","start":391}],"target_id":"field.mesh.d012586","target_kind":"node","target_sha256":"8c4395f3bee09d529bb51e911fd698332da6a9832b3d3a6de256a0ece8f1504e"}],"field.mesh.d012936":[{"id":"assertion.field.mesh.d012936","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Medicine as described in the captured NLM MeSH descriptor D012936","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Medicine as: A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","support":[{"end":477,"quote":"A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","source_id":"nlm-mesh.d012936","source_sha256":"435ca04e6afd7afeefb319d77e0ab235b7bd107200cc12c69e30207cfb434356","start":346}],"target_id":"field.mesh.d012936","target_kind":"node","target_sha256":"bf73d9d9136f752dfe401e2b2f5c92951ba49507a230fd1d3b75f39f72e0c358"}],"field.mesh.d012942":[{"id":"assertion.field.mesh.d012942","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Social Sciences as described in the captured NLM MeSH descriptor D012942","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Social Sciences as: Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","support":[{"end":524,"quote":"Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","source_id":"nlm-mesh.d012942","source_sha256":"360f81175ffa9c71e7eb3e5aaf24189d952dae0fa8adec6233b87e1b934ab531","start":350}],"target_id":"field.mesh.d012942","target_kind":"node","target_sha256":"095afb891b1982f7623dd4e463b6dfd08d56c2d2fdcd0b4e1a3cb139994ebbd0"}],"field.mesh.d012962":[{"id":"assertion.field.mesh.d012962","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sociology, Medical as described in the captured NLM MeSH descriptor D012962","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sociology, Medical as: The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","support":[{"end":564,"quote":"The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","source_id":"nlm-mesh.d012962","source_sha256":"705ffb14f79c640244ee4af7cee593abe26eb12ec68ce4872129fe988f4351b2","start":418}],"target_id":"field.mesh.d012962","target_kind":"node","target_sha256":"39db8cf0fa1faa62435dd6e7e7c9e8a9d9a8886aa050c206ffc1667b7726a0ee"}],"field.mesh.d013043":[{"id":"assertion.field.mesh.d013043","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Specialties, Surgical as described in the captured NLM MeSH descriptor D013043","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Specialties, Surgical as: Various branches of surgical practice limited to specialized areas.","support":[{"end":655,"quote":"Various branches of surgical practice limited to specialized areas.","source_id":"nlm-mesh.d013043","source_sha256":"dcaa9156bb8c1f89c8f5bce60498d7d365cf8fa3f41fb7f457a375ca501f8e0a","start":588}],"target_id":"field.mesh.d013043","target_kind":"node","target_sha256":"494b7cd4945e55a4f980cdb5f1714e5c859adbf3465bc5dde08c820b7d22516b"}],"field.mesh.d013178":[{"id":"assertion.field.mesh.d013178","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sports Medicine as described in the captured NLM MeSH descriptor D013178","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sports Medicine as: The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","support":[{"end":612,"quote":"The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","source_id":"nlm-mesh.d013178","source_sha256":"b287ffd927333d3593a17e8363d8beb2c68e20ac77c4db063843b3016e81b50a","start":470}],"target_id":"field.mesh.d013178","target_kind":"node","target_sha256":"765715db5ca9943bc36d7d084b2617b74668689c98451f188721232e97a84c9a"}],"field.mesh.d013366":[{"id":"assertion.field.mesh.d013366","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Submarine Medicine as described in the captured NLM MeSH descriptor D013366","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Submarine Medicine as: The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","support":[{"end":595,"quote":"The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","source_id":"nlm-mesh.d013366","source_sha256":"4c9431f8cba1ff0cb239b95a303944723b70cf6e6511f5bf2528a4c2db53cc36","start":491}],"target_id":"field.mesh.d013366","target_kind":"node","target_sha256":"bc06085e57392cd6e90097200e477c36a547ca0cab000889a18bdb6beb53e6ba"}],"field.mesh.d013502":[{"id":"assertion.field.mesh.d013502","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"General Surgery as described in the captured NLM MeSH descriptor D013502","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes General Surgery as: A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","support":[{"end":639,"quote":"A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","source_id":"nlm-mesh.d013502","source_sha256":"b09e59f9a6e68c6220cf3dd7c3bd3a25b654e7a3c68d655c5bf21927fb701fc5","start":524}],"target_id":"field.mesh.d013502","target_kind":"node","target_sha256":"1e4414c759de741d379af934d9e577bc2f0d41613581291e5145cee445a639bb"}],"field.mesh.d013518":[{"id":"assertion.field.mesh.d013518","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Surgery, Plastic as described in the captured NLM MeSH descriptor D013518","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Surgery, Plastic as: The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","support":[{"end":588,"quote":"The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","source_id":"nlm-mesh.d013518","source_sha256":"0c05c22f027d816bc0e406ecf5ff87685c722c8341414af5e46f867b03387feb","start":462}],"target_id":"field.mesh.d013518","target_kind":"node","target_sha256":"51f942b31a13e24126abb8219e45cb3521c4bbe805c1bddbd6c6dcd98b21db2f"}],"field.mesh.d013672":[{"id":"assertion.field.mesh.d013672","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology as described in the captured NLM MeSH descriptor D013672","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology as: The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","support":[{"end":461,"quote":"The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","source_id":"nlm-mesh.d013672","source_sha256":"08f99616a82431407ac21d1e4ecc727aabc9bba820cfe0a3f6f62156e5150ad6","start":332}],"target_id":"field.mesh.d013672","target_kind":"node","target_sha256":"bda6f1dae4bdff1c0f688ed2cb3521a9446aa5e69879c06be649b36954acfd2e"}],"field.mesh.d013674":[{"id":"assertion.field.mesh.d013674","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Dental as described in the captured NLM MeSH descriptor D013674","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Dental as: The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","support":[{"end":545,"quote":"The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","source_id":"nlm-mesh.d013674","source_sha256":"a6e3a86aaac59d0b85a423f67dc513dcc741b1cd30d4548fa079ba6db4ba5b9f","start":372}],"target_id":"field.mesh.d013674","target_kind":"node","target_sha256":"0f53a94519ab3f60f48ac5e4b4aaf95d3ec0c3043d9a3aeb30418fc64a94151e"}],"field.mesh.d013677":[{"id":"assertion.field.mesh.d013677","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Medical Laboratory Science as described in the captured NLM MeSH descriptor D013677","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Medical Laboratory Science as: The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","support":[{"end":551,"quote":"The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","source_id":"nlm-mesh.d013677","source_sha256":"48886ea008f208539d2dfca58dec5f4ed1095f1665f2b904845819d2784a99b7","start":380}],"target_id":"field.mesh.d013677","target_kind":"node","target_sha256":"6b678f4d6011a752ea02cd55c3c3d87ebffa0a0a37ce039c2d26daa9fd8bc864"}],"field.mesh.d013678":[{"id":"assertion.field.mesh.d013678","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Pharmaceutical as described in the captured NLM MeSH descriptor D013678","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Pharmaceutical as: The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","support":[{"end":723,"quote":"The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","source_id":"nlm-mesh.d013678","source_sha256":"9bbf6f2ff0c9af09ee12346b5772e36bb78d6c545a2f69290baf41ae26a73587","start":376}],"target_id":"field.mesh.d013678","target_kind":"node","target_sha256":"fabd4c31274a6efb3d773de795449a170f4df90178ea7a19377fa6c0e60aa48a"}],"field.mesh.d013679":[{"id":"assertion.field.mesh.d013679","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Technology, Radiologic as described in the captured NLM MeSH descriptor D013679","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Technology, Radiologic as: The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","support":[{"end":726,"quote":"The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","source_id":"nlm-mesh.d013679","source_sha256":"e0f21659c097388ab1baaf0ac5737affd9746a78c1ff390ccacd70b7bc693428","start":423}],"target_id":"field.mesh.d013679","target_kind":"node","target_sha256":"164cafcbce667a0cfb29294f2a26cdcd001d26fbd1c22113896386bd2dc802d7"}],"field.mesh.d013903":[{"id":"assertion.field.mesh.d013903","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Thoracic Surgery as described in the captured NLM MeSH descriptor D013903","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Thoracic Surgery as: A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","support":[{"end":626,"quote":"A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","source_id":"nlm-mesh.d013903","source_sha256":"1a1c42a53c2dadd9c35864b13b6ae81e4c792b5aa1a67622fc6d990612f12ba1","start":434}],"target_id":"field.mesh.d013903","target_kind":"node","target_sha256":"3df6fa7521ced4bf616f0dde6f74f5f887a9cc994af57f1249ea74ebeeb7c80a"}],"field.mesh.d014330":[{"id":"assertion.field.mesh.d014330","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Tropical Medicine as described in the captured NLM MeSH descriptor D014330","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Tropical Medicine as: The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","support":[{"end":582,"quote":"The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","source_id":"nlm-mesh.d014330","source_sha256":"95595a05d4d4337e00e0541ffb29a2520f662e01cf2891abcd0b76bfa8e22473","start":463}],"target_id":"field.mesh.d014330","target_kind":"node","target_sha256":"361b6d1299cdb13bd1b831111736e8b9eb6db493a322589b1b0bab9260a350d5"}],"field.mesh.d014686":[{"id":"assertion.field.mesh.d014686","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Venereology as described in the captured NLM MeSH descriptor D014686","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Venereology as: A branch of medicine which deals with sexually transmitted disease.","support":[{"end":405,"quote":"A branch of medicine which deals with sexually transmitted disease.","source_id":"nlm-mesh.d014686","source_sha256":"8ada370f70d1693646e26161e362907fae36deb1aaa37e68374bd426f4e0101d","start":338}],"target_id":"field.mesh.d014686","target_kind":"node","target_sha256":"b8e47868999e406a2eedd18a0b8153c4ef35f61b81f5a014d5e18c2d25b90c96"}],"field.mesh.d014943":[{"id":"assertion.field.mesh.d014943","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Global Health as described in the captured NLM MeSH descriptor D014943","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Global Health as: A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","support":[{"end":671,"quote":"A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","source_id":"nlm-mesh.d014943","source_sha256":"ca65929785f6206a7003417d503ee05f5f47035dd0cba777f665a2c613e2d919","start":354}],"target_id":"field.mesh.d014943","target_kind":"node","target_sha256":"c796812b5441ce953f5a72f747ad2c5112c3d93496fefc696b0bdafe51df2e65"}],"field.mesh.d015272":[{"id":"assertion.field.mesh.d015272","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pulmonary Medicine as described in the captured NLM MeSH descriptor D015272","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pulmonary Medicine as: A subspecialty of internal medicine concerned with the study of the RESPIRATORY SYSTEM . It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","support":[{"end":618,"quote":"A subspecialty of internal medicine concerned with the study of the\nRESPIRATORY SYSTEM\n. It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","source_id":"nlm-mesh.d015272","source_sha256":"047f790fba559bdd4fe535fbd621b9181a379eca85aefb6487a2c606629fccf7","start":417}],"target_id":"field.mesh.d015272","target_kind":"node","target_sha256":"a40e9233f137e498de0f906737ce9321a7dae0b395bc10d9add4a9576831430d"}],"field.mesh.d015510":[{"id":"assertion.field.mesh.d015510","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Clinical Medicine as described in the captured NLM MeSH descriptor D015510","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Clinical Medicine as: The study and practice of medicine by direct examination of the patient.","support":[{"end":422,"quote":"The study and practice of medicine by direct examination of the patient.","source_id":"nlm-mesh.d015510","source_sha256":"985f485b4a309b94c1ccaa3fdd4c7eafc20fe240375db0c21ff9d9a85eb6c977","start":350}],"target_id":"field.mesh.d015510","target_kind":"node","target_sha256":"270e7190f1d7ce459b08fb7e58079fc944d364e6687b66a04f56f585f92238e8"}],"field.mesh.d015642":[{"id":"assertion.field.mesh.d015642","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiology, Interventional as described in the captured NLM MeSH descriptor D015642","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiology, Interventional as: Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","support":[{"end":587,"quote":"Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","source_id":"nlm-mesh.d015642","source_sha256":"bd368b4fde31f0291bc0d5adaf62ee98daca3ccdb3adbe2582ce9f9f2a746bd8","start":479}],"target_id":"field.mesh.d015642","target_kind":"node","target_sha256":"418f72dd7198c6b4d1d81a843dc59b74a47471f889dcc210fa664072aec18382"}],"field.mesh.d017711":[{"id":"assertion.field.mesh.d017711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Nonlinear Dynamics as described in the captured NLM MeSH descriptor D017711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Nonlinear Dynamics as: The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal ( FRACTALS ) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","support":[{"end":1105,"quote":"The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal (\nFRACTALS\n) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","source_id":"nlm-mesh.d017711","source_sha256":"7339d4ceab6363dc4440ad1a27ed68eea69381232d1f23ec79c4457e0b49b503","start":418}],"target_id":"field.mesh.d017711","target_kind":"node","target_sha256":"bb9d3a644e09becb3f5d065480d28eae3c99070ea8e7b91f5bce99ecdd3f9c9c"}],"field.mesh.d017720":[{"id":"assertion.field.mesh.d017720","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Epidemiology as described in the captured NLM MeSH descriptor D017720","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Epidemiology as: The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in DNA to implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","support":[{"end":1247,"quote":"The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in\nDNA\nto implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","source_id":"nlm-mesh.d017720","source_sha256":"7584ca84d4564c8cef08bbc868ca2941750fe20537384b50f50e36b060a03c2f","start":965}],"target_id":"field.mesh.d017720","target_kind":"node","target_sha256":"e249ef10d0aebacd85c1d0474a0ed8ce738a25b15fadde8964d3ac655999cf54"}],"field.mesh.d017891":[{"id":"assertion.field.mesh.d017891","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pharmacoepidemiology as described in the captured NLM MeSH descriptor D017891","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pharmacoepidemiology as: The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","support":[{"end":1047,"quote":"The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","source_id":"nlm-mesh.d017891","source_sha256":"b1791614dbf02b48d88ae2647a316193f907672c63c5368c2277284dd54f5169","start":392}],"target_id":"field.mesh.d017891","target_kind":"node","target_sha256":"c0fab0fab6c9193cb7f7dd55c91f67d3c34b0fc7c3e38b8644f07f351d56e273"}],"field.mesh.d018456":[{"id":"assertion.field.mesh.d018456","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Reproductive Medicine as described in the captured NLM MeSH descriptor D018456","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Reproductive Medicine as: A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","support":[{"end":1061,"quote":"A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","source_id":"nlm-mesh.d018456","source_sha256":"d3f96a2c14bff790e29ee2d800f42813cf066dbd03ff823e3701fede0f769cc1","start":462}],"target_id":"field.mesh.d018456","target_kind":"node","target_sha256":"2474083ff2927639fc79f08b457e879b494bfd14851fbe9486c3201213f41080"}],"field.mesh.d018732":[{"id":"assertion.field.mesh.d018732","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Anthropology as described in the captured NLM MeSH descriptor D018732","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Anthropology as: Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","support":[{"end":1107,"quote":"Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","source_id":"nlm-mesh.d018732","source_sha256":"895770077cd26a6eae098654705410f68e9a8ef77797c79cbba1967827c4fd10","start":521}],"target_id":"field.mesh.d018732","target_kind":"node","target_sha256":"b3c8603c8566e8e6b4a78e97023f56ad4fdeaefc976c334db0e32a2b4c051cdd"}],"field.mesh.d018787":[{"id":"assertion.field.mesh.d018787","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Radiation Oncology as described in the captured NLM MeSH descriptor D018787","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Radiation Oncology as: A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","support":[{"end":584,"quote":"A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","source_id":"nlm-mesh.d018787","source_sha256":"24cc301d90c732395e6aa95925edf5bb1b44f46a3f79c51bfb44f12bc1d36f70","start":493}],"target_id":"field.mesh.d018787","target_kind":"node","target_sha256":"9dedad3a292116006f8695adf7c4c855e11442f23b6d1d3701dd2b2ea53f9c40"}],"field.mesh.d018961":[{"id":"assertion.field.mesh.d018961","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Educational Technology as described in the captured NLM MeSH descriptor D018961","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Educational Technology as: Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","support":[{"end":752,"quote":"Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","source_id":"nlm-mesh.d018961","source_sha256":"fec82e43a3c6e99157f4b3356f0f87ad7130ab656c3ce2c25197a88b9e91adcb","start":416}],"target_id":"field.mesh.d018961","target_kind":"node","target_sha256":"ddf4953ca425246d474cf138f8b291a0375587f1304a17b8af188d012c48af2b"}],"field.mesh.d019021":[{"id":"assertion.field.mesh.d019021","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Natural History as described in the captured NLM MeSH descriptor D019021","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","support":[{"end":930,"quote":"A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","source_id":"nlm-mesh.d019021","source_sha256":"a311f940b7dcd549e907c0bcf73addfc851c1397331b0b574ef03c28a883b88a","start":493}],"target_id":"field.mesh.d019021","target_kind":"node","target_sha256":"decc8682c9a97ecc7c00b7156ce5025628d23f2cfc52649a1c4747d18c8d6933"}],"field.mesh.d019317":[{"id":"assertion.field.mesh.d019317","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence-Based Medicine as described in the captured NLM MeSH descriptor D019317","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence-Based Medicine as: An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","support":[{"end":868,"quote":"An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","source_id":"nlm-mesh.d019317","source_sha256":"e1d4683bf9a782e08e009c69022db97f84401c7544eef70fb66e8e212d33ae43","start":406}],"target_id":"field.mesh.d019317","target_kind":"node","target_sha256":"ea82fb2ae0c8692fd2db344d829cac8fc33b3f75c4fd8d4baf1d5439aca06e92"}],"field.mesh.d019371":[{"id":"assertion.field.mesh.d019371","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Topography, Medical as described in the captured NLM MeSH descriptor D019371","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Topography, Medical as: The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from EPIDEMIOLOGY in that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","support":[{"end":960,"quote":"The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from\nEPIDEMIOLOGY\nin that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","source_id":"nlm-mesh.d019371","source_sha256":"34550447f56c2717df070f990038d093403d112e71bce125d99f81384be8afec","start":625}],"target_id":"field.mesh.d019371","target_kind":"node","target_sha256":"ae76ebb9865d4b585610c332952279daa86710990f27df5f25af53b3f9e5cf41"}],"field.mesh.d020811":[{"id":"assertion.field.mesh.d020811","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomedical Technology as described in the captured NLM MeSH descriptor D020811","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomedical Technology as: The application of technology to the solution of medical problems.","support":[{"end":428,"quote":"The application of technology to the solution of medical problems.","source_id":"nlm-mesh.d020811","source_sha256":"f1797c521c5d00775331d775f36c2aa35eb9837cc61f238049c36af78b7b2d0e","start":362}],"target_id":"field.mesh.d020811","target_kind":"node","target_sha256":"733da2e94232a6c9ca87d646e572b8ea26f4cbfa4b06e9513e893b145e042084"}],"field.mesh.d026690":[{"id":"assertion.field.mesh.d026690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Clinical as described in the captured NLM MeSH descriptor D026690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","support":[{"end":769,"quote":"The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","source_id":"nlm-mesh.d026690","source_sha256":"809eb3278963950c09addcf8bb75038047b70a00bd640895de003aae3663237f","start":649}],"target_id":"field.mesh.d026690","target_kind":"node","target_sha256":"c29bdb29b292244a8e3ef114c6df050b5beb4d273bc6b4eaeb44c1972a79ef67"}],"field.mesh.d028662":[{"id":"assertion.field.mesh.d028662","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Principle-Based Ethics as described in the captured NLM MeSH descriptor D028662","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Principle-Based Ethics as: An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","support":[{"end":537,"quote":"An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","source_id":"nlm-mesh.d028662","source_sha256":"2416e311da3e306c70befff014f44140beb06cb26eb8f87a51fdea795ee46847","start":380}],"target_id":"field.mesh.d028662","target_kind":"node","target_sha256":"cb005a3828ecd5e5a37dd63279c480f4158f58a5d52afa15cf9ad6b9fae7c567"}],"field.mesh.d032701":[{"id":"assertion.field.mesh.d032701","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Biomimetics as described in the captured NLM MeSH descriptor D032701","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Biomimetics as: An interdisciplinary field in materials science, ENGINEERING , and BIOLOGY , studying the use of biological principles for synthesis or fabrication of BIOMIMETIC MATERIALS .","support":[{"end":581,"quote":"An interdisciplinary field in materials science,\nENGINEERING\n, and\nBIOLOGY\n, studying the use of biological principles for synthesis or fabrication of\nBIOMIMETIC MATERIALS\n.","source_id":"nlm-mesh.d032701","source_sha256":"115dd0c7e511626f261efe3357d0882a512b70b36ebf4b146b839d18cff3170a","start":408}],"target_id":"field.mesh.d032701","target_kind":"node","target_sha256":"cdb95880b307d6da326a68e13a0719ccc5ba99f6e500ae353b03ed64dd99bfac"}],"field.mesh.d032781":[{"id":"assertion.field.mesh.d032781","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Codes of Ethics as described in the captured NLM MeSH descriptor D032781","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Codes of Ethics as: Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","support":[{"end":662,"quote":"Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","source_id":"nlm-mesh.d032781","source_sha256":"f55324cf9c30cbb15e7433ceee6def9d66f45deb08d4678e7151ab22c24949fa","start":534}],"target_id":"field.mesh.d032781","target_kind":"node","target_sha256":"9d11d6a7556c32dfec1e3ed880ca7f108416a3627a13dcf9e8647b1d00e0ea42"}],"field.mesh.d032984":[{"id":"assertion.field.mesh.d032984","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Research as described in the captured NLM MeSH descriptor D032984","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Research as: The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","support":[{"end":653,"quote":"The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","source_id":"nlm-mesh.d032984","source_sha256":"1ee1cb41e82cd1ee9ed0000a9ff2030f93240ad7152f28b2f1643c74a5a528ab","start":537}],"target_id":"field.mesh.d032984","target_kind":"node","target_sha256":"4b6eb63c7be7ffb92aac3a2fea8bf637ae17a4a5729a96a36ab07b010dc382a0"}],"field.mesh.d040821":[{"id":"assertion.field.mesh.d040821","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Human Characteristics as described in the captured NLM MeSH descriptor D040821","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Human Characteristics as: The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":455,"quote":"The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.d040821","source_sha256":"3ff2e4966dbdd3d6a3fdbb3f8e22b91df1172ce6e0f683fa8a4b2a2462948080","start":354}],"target_id":"field.mesh.d040821","target_kind":"node","target_sha256":"93fc870f8f9780579811be70ac835528940a087a496ee1da66e929634a67afe0"}],"field.mesh.d040861":[{"id":"assertion.field.mesh.d040861","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Ethics, Business as described in the captured NLM MeSH descriptor D040861","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Ethics, Business as: The moral obligations governing the conduct of commercial or industrial enterprises.","support":[{"end":452,"quote":"The moral obligations governing the conduct of commercial or industrial enterprises.","source_id":"nlm-mesh.d040861","source_sha256":"6a8d4dd2b8edabb5b312b6f5e030a64913e2a1e7c1e0d7536195d1f979f5301b","start":368}],"target_id":"field.mesh.d040861","target_kind":"node","target_sha256":"33bfa0bcce857dac7564c981e1fe57104bf5297f3e99baf55f71bc327013be85"}],"field.mesh.d044085":[{"id":"assertion.field.mesh.d044085","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microfluidics as described in the captured NLM MeSH descriptor D044085","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .","support":[{"end":622,"quote":"The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological\nMICROCIRCULATION\nand used in\nMICROCHEMISTRY\nand\nINVESTIGATIVE TECHNIQUES\n.","source_id":"nlm-mesh.d044085","source_sha256":"c5c8478d80327123b39bd8a04bd547c843267c4eec5da1781e2db04d6edb0449","start":378}],"target_id":"field.mesh.d044085","target_kind":"node","target_sha256":"61278e444b9fe8d9920f576ee1786ac1a2c92d014f68af7f936b2776a3329774"}],"field.mesh.d044707":[{"id":"assertion.field.mesh.d044707","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Sciences as described in the captured NLM MeSH descriptor D044707","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Sciences as: Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as FORENSIC TOXICOLOGY ; FORENSIC ANTHROPOLOGY ; FORENSIC MEDICINE ; FORENSIC DENTISTRY ; and others.","support":[{"end":551,"quote":"Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as\nFORENSIC TOXICOLOGY\n;\nFORENSIC ANTHROPOLOGY\n;\nFORENSIC MEDICINE\n;\nFORENSIC DENTISTRY\n; and others.","source_id":"nlm-mesh.d044707","source_sha256":"0d09f0c3351d68e84f1734ef838afceeb6a612f6dd7e080941843d3e502b47d7","start":350}],"target_id":"field.mesh.d044707","target_kind":"node","target_sha256":"fcf7fe6138c9d3ed85aee52a87f4ce5d81a2e1fbce529097321bc7b5911458d8"}],"field.mesh.d044709":[{"id":"assertion.field.mesh.d044709","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Ballistics as described in the captured NLM MeSH descriptor D044709","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Ballistics as: The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","support":[{"end":645,"quote":"The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","source_id":"nlm-mesh.d044709","source_sha256":"acede0e0b839f4b9fe4e90c05d741adfb7e3fea6a947a59d2a5a56b76def2ecb","start":358}],"target_id":"field.mesh.d044709","target_kind":"node","target_sha256":"a0051f5d7f5f6545fc25c04de97dcf2e08c5f74300eae78f6fcc399945c1a99c"}],"field.mesh.d044968":[{"id":"assertion.field.mesh.d044968","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Regenerative Medicine as described in the captured NLM MeSH descriptor D044968","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Regenerative Medicine as: A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via TISSUE ENGINEERING ; CELL TRANSPLANTATION ; and ARTIFICIAL ORGANS and BIOARTIFICIAL ORGANS and tissues.","support":[{"end":677,"quote":"A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via\nTISSUE ENGINEERING\n;\nCELL TRANSPLANTATION\n; and\nARTIFICIAL ORGANS\nand\nBIOARTIFICIAL ORGANS\nand tissues.","source_id":"nlm-mesh.d044968","source_sha256":"1a74d258ccaec4713f439a4628bebbc10d87df4a1715cb4544c21a0cd88e653c","start":396}],"target_id":"field.mesh.d044968","target_kind":"node","target_sha256":"e4d2506bf0626ccd53623be466fe8c906b0339bf016cc40a8dc58947336240e0"}],"field.mesh.d049429":[{"id":"assertion.field.mesh.d049429","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Pathology as described in the captured NLM MeSH descriptor D049429","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Pathology as: The application of pathology to questions of law.","support":[{"end":514,"quote":"The application of pathology to questions of law.","source_id":"nlm-mesh.d049429","source_sha256":"1060f7d20f4aa72761b085911640934142e915a963387c43da5e31ea418ac41e","start":465}],"target_id":"field.mesh.d049429","target_kind":"node","target_sha256":"324faadcc8b823cae485ffd35a7c5d227b51680fd645d67dfc3dfecd63dd0fab"}],"field.mesh.d049690":[{"id":"assertion.field.mesh.d049690","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Ancient as described in the captured NLM MeSH descriptor D049690","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Ancient as: The period of history before 500 of the common era.","support":[{"end":493,"quote":"The period of history before 500 of the common era.","source_id":"nlm-mesh.d049690","source_sha256":"540f19bf7796754b686922cf3ebc3115fd7e11e278299c60e4a78de2d32163cf","start":442}],"target_id":"field.mesh.d049690","target_kind":"node","target_sha256":"f4838bd717a67235a0172a349a2d6d2c12ba0052b62f217fe2a36579cb01e30b"}],"field.mesh.d049691":[{"id":"assertion.field.mesh.d049691","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Medieval as described in the captured NLM MeSH descriptor D049691","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.","support":[{"end":466,"quote":"The period of history from the year 500 through 1450 of the common era.","source_id":"nlm-mesh.d049691","source_sha256":"78131ae2120040ed2e51df7a6266eae947d7938bd12b2c4576033e9027766566","start":395}],"target_id":"field.mesh.d049691","target_kind":"node","target_sha256":"8757bccce7a7886a890de78fc070bc859ca59b428f7e485c8bc0159bd1665481"}],"field.mesh.d049692":[{"id":"assertion.field.mesh.d049692","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Early Modern 1451-1600 as described in the captured NLM MeSH descriptor D049692","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Early Modern 1451-1600 as: The period of history from 1451 through 1600 of the common era.","support":[{"end":472,"quote":"The period of history from 1451 through 1600 of the common era.","source_id":"nlm-mesh.d049692","source_sha256":"6b559db671d65cc331407430f415e6eec906b361671d1a131ee9c1b1a0244966","start":409}],"target_id":"field.mesh.d049692","target_kind":"node","target_sha256":"3da27d4e210b5069a9266a1d7b57b38a436e837d0a9dbc1276b7425b4c61b4c7"}],"field.mesh.d049711":[{"id":"assertion.field.mesh.d049711","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"History, Modern 1601- as described in the captured NLM MeSH descriptor D049711","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes History, Modern 1601- as: The period of history from 1601 of the common era to the present.","support":[{"end":454,"quote":"The period of history from 1601 of the common era to the present.","source_id":"nlm-mesh.d049711","source_sha256":"32e801b75e430c8028bdabd7df1fce286a71a14bc7e2a3e54cd53d7250c25229","start":389}],"target_id":"field.mesh.d049711","target_kind":"node","target_sha256":"d84e4d80c9ea878a49d4462be7403ea0d096a83651e8b1996e8270ad668acdf3"}],"field.mesh.d052938":[{"id":"assertion.field.mesh.d052938","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Bariatric Medicine as described in the captured NLM MeSH descriptor D052938","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Bariatric Medicine as: The discipline concerned with WEIGHT REDUCTION in patients with OBESITY .","support":[{"end":501,"quote":"The discipline concerned with\nWEIGHT REDUCTION\nin patients with\nOBESITY\n.","source_id":"nlm-mesh.d052938","source_sha256":"baf7fe1aa98d23164d3f17adf9916a1fbcae5a4fc9561486517945c04a470a4c","start":428}],"target_id":"field.mesh.d052938","target_kind":"node","target_sha256":"6de5f94a89efcc5aa7a88880f634f8fc9d4850e045569dbc59d09132f6284e92"}],"field.mesh.d053593":[{"id":"assertion.field.mesh.d053593","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Toxicology as described in the captured NLM MeSH descriptor D053593","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Toxicology as: The application of TOXICOLOGY knowledge to questions of law.","support":[{"end":446,"quote":"The application of\nTOXICOLOGY\nknowledge to questions of law.","source_id":"nlm-mesh.d053593","source_sha256":"62e1af6618eadf3b7176eba08c7e90f286640dc4c3a72a0d2dfa0fd41956d890","start":386}],"target_id":"field.mesh.d053593","target_kind":"node","target_sha256":"43fe4e8dbfd85e6407f6f8fe5e123dd5e405eb4517c66fd40457a9eb366fff42"}],"field.mesh.d053803":[{"id":"assertion.field.mesh.d053803","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Forensic Genetics as described in the captured NLM MeSH descriptor D053803","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Forensic Genetics as: The application of genetic analyses and MOLECULAR DIAGNOSTIC TECHNIQUES to legal matters and crime analysis.","support":[{"end":482,"quote":"The application of genetic analyses and\nMOLECULAR DIAGNOSTIC TECHNIQUES\nto legal matters and crime analysis.","source_id":"nlm-mesh.d053803","source_sha256":"7ac667ad8bc60b3984d9b4bbbb4e2d18ebbd1f754affee679073a1efdcb50c14","start":374}],"target_id":"field.mesh.d053803","target_kind":"node","target_sha256":"086128751da630be8afb684e0d04564ace587c1937d3f03f1b828c70d374f82e"}],"field.mesh.d054597":[{"id":"assertion.field.mesh.d054597","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Disaster Medicine as described in the captured NLM MeSH descriptor D054597","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Disaster Medicine as: Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","support":[{"end":594,"quote":"Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","source_id":"nlm-mesh.d054597","source_sha256":"7f3d2b0d3fcfb906ed96692df63fe378e6cf42238ad98cb6065ee357664182da","start":401}],"target_id":"field.mesh.d054597","target_kind":"node","target_sha256":"7834000b8e94ef405352ece57e6c7660b9d4373b4ca7a696f6aa623fd353ca4c"}],"field.mesh.d054849":[{"id":"assertion.field.mesh.d054849","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Cardiac Electrophysiology as described in the captured NLM MeSH descriptor D054849","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Cardiac Electrophysiology as: The study of the electrical activity and characteristics of the HEART ; MYOCARDIUM ; and CARDIOMYOCYTES .","support":[{"end":603,"quote":"The study of the electrical activity and characteristics of the\nHEART\n;\nMYOCARDIUM\n; and\nCARDIOMYOCYTES\n.","source_id":"nlm-mesh.d054849","source_sha256":"e153f29ecdb34c79fcef46e58b2941c152d86841ae12a0e5526e6e6c0a033dac","start":498}],"target_id":"field.mesh.d054849","target_kind":"node","target_sha256":"aeead8f711be38bfb11bf0ca6cee6eb117ff09685493cd785839e6f996f75d74"}],"field.mesh.d055048":[{"id":"assertion.field.mesh.d055048","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Integrative Medicine as described in the captured NLM MeSH descriptor D055048","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Integrative Medicine as: The discipline concerned with using the combination of conventional allopathic medicine and ALTERNATIVE MEDICINE to address the biological, psychological, social, and spiritual aspects of health and illness.","support":[{"end":563,"quote":"The discipline concerned with using the combination of conventional allopathic medicine and\nALTERNATIVE MEDICINE\nto address the biological, psychological, social, and spiritual aspects of health and illness.","source_id":"nlm-mesh.d055048","source_sha256":"9bb6da1f8cc045d0bee029f4fb14f7f7c23e5b4c3463311c8ffab8ff72422573","start":356}],"target_id":"field.mesh.d055048","target_kind":"node","target_sha256":"94bdfff78b7d9cd9d86e95a2271836b18fbadf3b160b32260ab86f025dfd7956"}],"field.mesh.d055095":[{"id":"assertion.field.mesh.d055095","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Optics and Photonics as described in the captured NLM MeSH descriptor D055095","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Optics and Photonics as: A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating ELECTROMAGNETIC RADIATION in the visible, infrared, and ultraviolet range.","support":[{"end":806,"quote":"A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating\nELECTROMAGNETIC RADIATION\nin the visible, infrared, and ultraviolet range.","source_id":"nlm-mesh.d055095","source_sha256":"8c7133becec32656bd061b73d7df6e7e048b101b87d1966caaf2f21996cf2919","start":551}],"target_id":"field.mesh.d055095","target_kind":"node","target_sha256":"576328bb1c6221e67e91688688ef5ff0cedb189f3250c413535f888ce83b600a"}],"field.mesh.d055416":[{"id":"assertion.field.mesh.d055416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Evidence-Based Emergency Medicine as described in the captured NLM MeSH descriptor D055416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Evidence-Based Emergency Medicine as: A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in EMERGENCY MEDICINE . This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","support":[{"end":855,"quote":"A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in\nEMERGENCY MEDICINE\n. This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","source_id":"nlm-mesh.d055416","source_sha256":"826b4f94fed2138a43f6991258b9752e2e96283a9ca3f2564bd97d02036cdb3a","start":406}],"target_id":"field.mesh.d055416","target_kind":"node","target_sha256":"c88d015d7eb45c756a19b5ffbd1cd8aefd97fefc295fc8def4d894fc92c3bc8f"}],"field.mesh.d055552":[{"id":"assertion.field.mesh.d055552","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Infectious Disease Medicine as described in the captured NLM MeSH descriptor D055552","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Infectious Disease Medicine as: A branch of internal medicine concerned with the diagnosis and treatment of INFECTIOUS DISEASES .","support":[{"end":587,"quote":"A branch of internal medicine concerned with the diagnosis and treatment of\nINFECTIOUS DISEASES\n.","source_id":"nlm-mesh.d055552","source_sha256":"a32b37cad6b0fe37a7dc62861e77ef3716d28bc13c9f3cf1a560052782099a8c","start":490}],"target_id":"field.mesh.d055552","target_kind":"node","target_sha256":"99a441279d0aaeb3e04090eb7fe3adf6995237f7b1c7795ca848fc62be3a78a4"}],"field.mesh.d055616":[{"id":"assertion.field.mesh.d055616","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Microtechnology as described in the captured NLM MeSH descriptor D055616","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Microtechnology as: Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or MEMS . The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","support":[{"end":725,"quote":"Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or\nMEMS\n. The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","source_id":"nlm-mesh.d055616","source_sha256":"e76917cd6af6664ee9ce6f56b8de338d165eb570bfb3b62cfc3d2f822ed0e312","start":358}],"target_id":"field.mesh.d055616","target_kind":"node","target_sha256":"94375b04a6759b0510567522e851c35c784bfe9284f8c93cd60d73a076a3d2b8"}],"field.mesh.d055772":[{"id":"assertion.field.mesh.d055772","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Green Chemistry Technology as described in the captured NLM MeSH descriptor D055772","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Green Chemistry Technology as: Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","support":[{"end":570,"quote":"Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","source_id":"nlm-mesh.d055772","source_sha256":"f378ea002cc0db347173e25235ba4eb35c449e524e38f27bff029de8af1f61d4","start":368}],"target_id":"field.mesh.d055772","target_kind":"node","target_sha256":"306057c004d8aa7b9f2bed683f7a15722fa3fed7fcadbc4b0f01be0acde205d8"}],"field.mesh.d055813":[{"id":"assertion.field.mesh.d055813","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Wilderness Medicine as described in the captured NLM MeSH descriptor D055813","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Wilderness Medicine as: Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","support":[{"end":514,"quote":"Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","source_id":"nlm-mesh.d055813","source_sha256":"f65e8fbbf7daf20e7155e2349c185a89954cc02809ad55fa22a791f73e9513e8","start":354}],"target_id":"field.mesh.d055813","target_kind":"node","target_sha256":"57e863914b9d8d48daf31c3e9b9719483a8b0926143bddb558470b8b110492a2"}],"field.mesh.d056508":[{"id":"assertion.field.mesh.d056508","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sleep Medicine Specialty as described in the captured NLM MeSH descriptor D056508","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sleep Medicine Specialty as: A medical specialty concerned with the diagnosis and treatment of SLEEP WAKE DISORDERS and their causes.","support":[{"end":571,"quote":"A medical specialty concerned with the diagnosis and treatment of\nSLEEP WAKE DISORDERS\nand their causes.","source_id":"nlm-mesh.d056508","source_sha256":"caf12993076fa4a033697656284f82f9dce6966c7b10a6d9406e00f9c33c93ee","start":467}],"target_id":"field.mesh.d056508","target_kind":"node","target_sha256":"1374d6309800e98bbcbf2afb042edfde0f118168ea4f1a8243b807b6612f3ea9"}],"field.mesh.d057089":[{"id":"assertion.field.mesh.d057089","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Pathology, Molecular as described in the captured NLM MeSH descriptor D057089","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Pathology, Molecular as: A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","support":[{"end":602,"quote":"A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","source_id":"nlm-mesh.d057089","source_sha256":"04dd0a2d4fd5510da33ef0f0bf28672534d8eef02e30e94ca3f2db959219dcb5","start":501}],"target_id":"field.mesh.d057089","target_kind":"node","target_sha256":"ecb64923215868e7fae675ed6f2bbb43f6c78a5bfcd7d6116c5884413ea6b918"}],"field.mesh.d057236":[{"id":"assertion.field.mesh.d057236","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Travel Medicine as described in the captured NLM MeSH descriptor D057236","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Travel Medicine as: Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international TRAVEL . Key element of patient's pre-travel visit to the physician is a health risk assessment.","support":[{"end":728,"quote":"Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international\nTRAVEL\n. Key element of patient's pre-travel visit to the physician is a health risk assessment.","source_id":"nlm-mesh.d057236","source_sha256":"b11e957a9330b40f1e95b09eec3547f3cd1b4e454f0fc03635e02481e30ffcf9","start":522}],"target_id":"field.mesh.d057236","target_kind":"node","target_sha256":"90f20eac0229e6650207db0fca4551dc09ac42048aff23d950af37593c5caa7b"}],"field.mesh.d057285":[{"id":"assertion.field.mesh.d057285","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Precision Medicine as described in the captured NLM MeSH descriptor D057285","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Precision Medicine as: Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","support":[{"end":504,"quote":"Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","source_id":"nlm-mesh.d057285","source_sha256":"b714d014ec0a4e5ce92501007cba6da1226d163096269255cc5be5c902d70a2b","start":364}],"target_id":"field.mesh.d057285","target_kind":"node","target_sha256":"9d29e6198b138139828922c4027e5cd16ba6a53e8236ac66b357d3dc9e573ec6"}],"field.mesh.d057909":[{"id":"assertion.field.mesh.d057909","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Orthognathic Surgery as described in the captured NLM MeSH descriptor D057909","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Orthognathic Surgery as: A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related MAXILLOFACIAL ABNORMALITIES (e.g., CLEFT PALATE ; RETROGNATHISM ).","support":[{"end":637,"quote":"A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related\nMAXILLOFACIAL ABNORMALITIES\n(e.g.,\nCLEFT PALATE\n;\nRETROGNATHISM\n).","source_id":"nlm-mesh.d057909","source_sha256":"b1ea1aed038e4498fd5251afcc06e6327fc27644ed56cf57fbd7626714fad7be","start":456}],"target_id":"field.mesh.d057909","target_kind":"node","target_sha256":"ede92d17d9cb52c2bb9ab659728319c66176513a1562feceaff027a969f75979"}],"field.mesh.d058006":[{"id":"assertion.field.mesh.d058006","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"General Practice as described in the captured NLM MeSH descriptor D058006","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes General Practice as: Patient-based medical care provided across age and gender or specialty boundaries.","support":[{"end":430,"quote":"Patient-based medical care provided across age and gender or specialty boundaries.","source_id":"nlm-mesh.d058006","source_sha256":"bca72062757ded9e4a73d102fffe6af7a515baf1b0635fedff142e3cc4f3cdfa","start":348}],"target_id":"field.mesh.d058006","target_kind":"node","target_sha256":"2d3f9552dc50acafaf7db8c3c1bcf637abade81668a1c53f3db0c6c91b0ffdbc"}],"field.mesh.d058027":[{"id":"assertion.field.mesh.d058027","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neuropsychiatry as described in the captured NLM MeSH descriptor D058027","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neuropsychiatry as: A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","support":[{"end":720,"quote":"A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","source_id":"nlm-mesh.d058027","source_sha256":"5ca359ee5e6c822d918c194841fc9ef6d88df105cd54cc7d7459435525c7f529","start":392}],"target_id":"field.mesh.d058027","target_kind":"node","target_sha256":"de73c1161352264dda145127ee58bd3642fc967747f62b2331b208d7e993213e"}],"field.mesh.d058615":[{"id":"assertion.field.mesh.d058615","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Synthetic Biology as described in the captured NLM MeSH descriptor D058615","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Synthetic Biology as: A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","support":[{"end":686,"quote":"A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","source_id":"nlm-mesh.d058615","source_sha256":"9681b043a4597b02956482cbcc7813d3f5616dfcc48a3a559fe5eab7200f64a6","start":525}],"target_id":"field.mesh.d058615","target_kind":"node","target_sha256":"f071a775557b28f90636178a2ca9cafbfdbbd23948065f6afedf78f7a7249dff"}],"field.mesh.d060432":[{"id":"assertion.field.mesh.d060432","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Anthropology, Medical as described in the captured NLM MeSH descriptor D060432","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Anthropology, Medical as: Field of social science that is concerned with differences between human groups as related to health status and beliefs.","support":[{"end":601,"quote":"Field of social science that is concerned with differences between human groups as related to health status and beliefs.","source_id":"nlm-mesh.d060432","source_sha256":"8b77f264e12017995e0fe7db1dc5ef354757102c428151a61c7ed03cecef8019","start":481}],"target_id":"field.mesh.d060432","target_kind":"node","target_sha256":"d5500aeb7460304954f67131745f09af92e929e8de682615cd739dc6f243c95a"}],"field.mesh.d062306":[{"id":"assertion.field.mesh.d062306","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Geography, Medical as described in the captured NLM MeSH descriptor D062306","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Geography, Medical as: The area of medicine concerned with the effects on health and disease due to geographic factors such as CLIMATE , environmental conditions, and geographic location.","support":[{"end":630,"quote":"The area of medicine concerned with the effects on health and disease due to geographic factors such as\nCLIMATE\n, environmental conditions, and geographic location.","source_id":"nlm-mesh.d062306","source_sha256":"0c220a7d59322054e96e76fa9c71f140f4fa556784fc4f573bea29c083ad2fef","start":466}],"target_id":"field.mesh.d062306","target_kind":"node","target_sha256":"c57ddc27e717a33d2eba06a4158190ea22da978179200948f5b99883f4483c5f"}],"field.mesh.d062346":[{"id":"assertion.field.mesh.d062346","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Molecular Medicine as described in the captured NLM MeSH descriptor D062346","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Molecular Medicine as: The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize MOLECULAR BIOLOGY techniques.","support":[{"end":680,"quote":"The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize\nMOLECULAR BIOLOGY\ntechniques.","source_id":"nlm-mesh.d062346","source_sha256":"6fcc592969bd46ad27127d66c0d9810376dd9c06f9e4518d5ac19cb2723abfcd","start":481}],"target_id":"field.mesh.d062346","target_kind":"node","target_sha256":"fc2291ddbf7762091eda0cf2f78198bd49dbf214f67a53e9e4ba66bbc7630b9f"}],"field.mesh.d063165":[{"id":"assertion.field.mesh.d063165","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Neurotology as described in the captured NLM MeSH descriptor D063165","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Neurotology as: A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","support":[{"end":497,"quote":"A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","source_id":"nlm-mesh.d063165","source_sha256":"cfb77e5b443211780a844323751450dcabd1dd1fa87e651bb962ef8d6a6976f3","start":400}],"target_id":"field.mesh.d063165","target_kind":"node","target_sha256":"8355fb293d6f71304faedd17c83ed25f1baf88323d5f63f4cfbf42c72905f6c7"}],"field.mesh.d064132":[{"id":"assertion.field.mesh.d064132","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Sports Nutritional Sciences as described in the captured NLM MeSH descriptor D064132","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Sports Nutritional Sciences as: The study of NUTRITION PROCESSES during EXERCISE and ATHLETIC PERFORMANCE as well as specific NUTRITIONAL REQUIREMENTS of ATHLETES and the relationship between NUTRITIONAL STATUS and NUTRITION DISORDERS in athletes.","support":[{"end":601,"quote":"The study of\nNUTRITION PROCESSES\nduring\nEXERCISE\nand\nATHLETIC PERFORMANCE\nas well as specific\nNUTRITIONAL REQUIREMENTS\nof\nATHLETES\nand the relationship between\nNUTRITIONAL STATUS\nand\nNUTRITION DISORDERS\nin athletes.","source_id":"nlm-mesh.d064132","source_sha256":"c1bdee8c0a1d00e1dd3200c49ed82bddc69b42167614ef7cee7dd33613940764","start":386}],"target_id":"field.mesh.d064132","target_kind":"node","target_sha256":"1b61cf60eb5c9301d7f8da240bb0267950160aefcf6ba313a72fe6f80342ad7d"}],"field.mesh.d064416":[{"id":"assertion.field.mesh.d064416","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Hospital Medicine as described in the captured NLM MeSH descriptor D064416","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Hospital Medicine as: The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","support":[{"end":746,"quote":"The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","source_id":"nlm-mesh.d064416","source_sha256":"422d4842c83f89d1da6a17edf8711b7bfdbfb7c4555cd821da0871f5c5c97c6d","start":388}],"target_id":"field.mesh.d064416","target_kind":"node","target_sha256":"0d4250d7a5e696fedf2dc369505bbe5113a540f00a97f8ebd7a241d8c1972116"}],"field.mesh.d064796":[{"id":"assertion.field.mesh.d064796","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Veterinary Sports Medicine as described in the captured NLM MeSH descriptor D064796","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Veterinary Sports Medicine as: The field of veterinary medicine concerned with PHYSICAL FITNESS of animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","support":[{"end":565,"quote":"The field of veterinary medicine concerned with\nPHYSICAL FITNESS\nof animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","source_id":"nlm-mesh.d064796","source_sha256":"abf0769da9470ee5daf1628610b5b239d4b86740ffa4aacbf98dfe012b88b464","start":384}],"target_id":"field.mesh.d064796","target_kind":"node","target_sha256":"3940e9bb2c50daec9a62280d8350574900292976afeb0c0cbafb577cf149e7ed"}],"field.mesh.d064826":[{"id":"assertion.field.mesh.d064826","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Transfusion Medicine as described in the captured NLM MeSH descriptor D064826","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Transfusion Medicine as: The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from BLOOD TRANSFUSION errors.","support":[{"end":538,"quote":"The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from\nBLOOD TRANSFUSION\nerrors.","source_id":"nlm-mesh.d064826","source_sha256":"7ea145d71818c193c91b1db89c0bb1a4ef7dcef272847c39701fa4507dfcb2d7","start":364}],"target_id":"field.mesh.d064826","target_kind":"node","target_sha256":"286441e3e2b20c8e470d992bda9b23c75c874e1246e9be39684c38d03cc64d5b"}],"field.mesh.d065126":[{"id":"assertion.field.mesh.d065126","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Palliative Medicine as described in the captured NLM MeSH descriptor D065126","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Palliative Medicine as: A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","support":[{"end":630,"quote":"A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","source_id":"nlm-mesh.d065126","source_sha256":"7c12e1eed57af860407b7fa3ef142ca60b10a7002c29256e98ce7b6d2b1dd7c8","start":422}],"target_id":"field.mesh.d065126","target_kind":"node","target_sha256":"8760bf8ae6135d2f68c93cb9650bc98440efefa0ad0d28ba204ed55eace9cbe4"}],"field.mesh.d066291":[{"id":"assertion.field.mesh.d066291","scope":{"assumptions":"Attributed scope-note definition from a controlled vocabulary; not an original research, efficacy or historical-priority claim","population":"Psychiatry in Literature as described in the captured NLM MeSH descriptor D066291","quantifiers":"Only what the captured scope note states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"NLM MeSH describes Psychiatry in Literature as: Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","support":[{"end":637,"quote":"Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","source_id":"nlm-mesh.d066291","source_sha256":"e42a10713615e21661896e2cc6223c1c57df9468ba2566ec2b6f5c29c58bc424","start":498}],"target_id":"field.mesh.d066291","target_kind":"node","target_sha256":"cfb5559c5d678e28775f4e56f380851d309cfcaea2ae3432b6887b0bf13bd7c7"}],"field.microbiology":[{"id":"assertion.complete.field.microbiology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Microbiology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Microbiology as: Branch of biology dealing with organisms too small to be seen without the use of a microscope.","support":[{"end":194,"quote":"Branch of biology dealing with organisms too small to be seen without the use of a microscope.","source_id":"usgs-thesaurus.dcab6f768c008f0c2c69","source_sha256":"0b76bb3b937cda900c15b3fb20f98125b2750c987d1af71a99b427b72a2bad41","start":100}],"target_id":"field.microbiology","target_kind":"node","target_sha256":"915220248c92e14251ac41b3ef841466140391beb5a09b6c40237ee398f4e78a"}],"field.molecular-biology":[{"id":"assertion.complete.field.molecular-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Molecular biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Molecular biology as: Branch of biology concerned with the study of physiology at the molecular level.","support":[{"end":190,"quote":"Branch of biology concerned with the study of physiology at the molecular level.","source_id":"usgs-thesaurus.d2d1d971931c29ceef7f","source_sha256":"adab88904576f799cca8153007b3d33faa05a2f0a588251a28ffad1044cdd210","start":110}],"target_id":"field.molecular-biology","target_kind":"node","target_sha256":"73e7cbc441014179c5d99bdbb329bc93147f2b2320bca41722dbc78f43bd42d6"}],"field.philosophy":[{"id":"assertion.complete.field.philosophy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Philosophy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Philosophy as: A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","support":[{"end":439,"quote":"A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","source_id":"nlm-mesh.ed675d30c3b71c4b6263","source_sha256":"05bbf9751db0e1573d1130c6e9c7eaaf9e4f58089badc5ca5d86bd4912a4fb72","start":332}],"target_id":"field.philosophy","target_kind":"node","target_sha256":"deb93e9a15176a2071c3d801ea08f37dcb755fff7f4b07849bde50b9cd3ef46a"}],"field.physics":[{"id":"assertion.complete.field.physics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Physics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Physics as: The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":654,"quote":"The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.c9083b1f6c559b444afe","source_sha256":"d7fb365d079f2c81c4f52226663dff89309701eb570a919a631d227c0738e2e8","start":491}],"target_id":"field.physics","target_kind":"node","target_sha256":"1d9feb5b691def0e4dbe4c8cf826e7a8ca68acec1a24a68aa3ec2899a59a5889"}],"field.psychology":[{"id":"assertion.complete.field.psychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychology as: The science dealing with the study of mental processes and behavior in man and animals.","support":[{"end":545,"quote":"The science dealing with the study of mental processes and behavior in man and animals.","source_id":"nlm-mesh.7d823551929a4fc3072e","source_sha256":"59a71455c76b75dc90035af6099231e367076aaef0bc0fdf2abe3c97fc5f9400","start":458}],"target_id":"field.psychology","target_kind":"node","target_sha256":"b2512b868d6c7dcf0c609b3a3d64bd481d5204d9c0cbc8f23096447d30e02ea1"}],"field.sociology":[{"id":"assertion.complete.field.sociology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sociology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sociology as: A social science dealing with group relationships, patterns of collective behavior, and social organization.","support":[{"end":621,"quote":"A social science dealing with group relationships, patterns of collective behavior, and social organization.","source_id":"nlm-mesh.902611a238e10eb5c9bf","source_sha256":"fdb12adac755ce34630509204ce61e38eddeb47d64cec43b55f0f3c27f4e433f","start":513}],"target_id":"field.sociology","target_kind":"node","target_sha256":"952a2e4d52876c8b75142592cde4845d0b5f26b1ed6f6dd306d94d03a1bb1015"}],"field.systems-biology":[{"id":"assertion.complete.field.systems-biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Systems biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Systems biology as: Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","support":[{"end":605,"quote":"Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","source_id":"nlm-mesh.ac32a89227fa482fcba6","source_sha256":"5f220ee076569ea7d8397594e104a2f4fe9881f69a65d579c1b67d0f6213b5b9","start":354}],"target_id":"field.systems-biology","target_kind":"node","target_sha256":"c1e551ef958b2df921a7f1cf7896cc59c4c4c28d0c7683db0bdf59e0d6e138d2"}],"field.usgs.1025":[{"id":"assertion.field.usgs.1025","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Sea-floor characteristics as defined in the captured USGS Thesaurus term 1025","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Sea-floor characteristics as: Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor. This category is also used for ocean bottom characteristics , sea floor characteristics , and seafloor characteristics","support":[{"end":525,"quote":"Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor.\nThis category is also used for\nocean bottom characteristics\n,\nsea floor characteristics\n, and\nseafloor characteristics","source_id":"usgs-thesaurus.1025","source_sha256":"e17d221caac2dd6df199f7ed4a705bac6317d8d459b17400afcf4a5432b654d3","start":156}],"target_id":"field.usgs.1025","target_kind":"node","target_sha256":"4c5181549481c37a48f438ddc1d7172891a26dccb66d9f596b89551ca78c541f"}],"field.usgs.1081":[{"id":"assertion.field.usgs.1081","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Soil sciences as defined in the captured USGS Thesaurus term 1081","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Soil sciences as: Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils. This category is also used for pedology (soils)","support":[{"end":262,"quote":"Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils.\nThis category is also used for\npedology (soils)","source_id":"usgs-thesaurus.1081","source_sha256":"d4653d5d35e5aae8bd21f5ab80b6099bc2d212327b44107f8211ed61c0eda6c9","start":103}],"target_id":"field.usgs.1081","target_kind":"node","target_sha256":"1c3740d5325c184fbaa9e905dd1d2d436afd6d74fe9d4d0d47e6ee281aabd91b"}],"field.usgs.1117":[{"id":"assertion.field.usgs.1117","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Structural geology as defined in the captured USGS Thesaurus term 1117","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Structural geology as: Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","support":[{"end":223,"quote":"Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","source_id":"usgs-thesaurus.1117","source_sha256":"95df20c1babf3252b77c9c4260d51d08b1e40f79ee1f0e83f0cc539ff34c421d","start":123}],"target_id":"field.usgs.1117","target_kind":"node","target_sha256":"875e4bcbd749f07eced37c0038693cdabbb41e1073970d5605607583724e9518"}],"field.usgs.115":[{"id":"assertion.field.usgs.115","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Biostratigraphy as defined in the captured USGS Thesaurus term 115","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Biostratigraphy as: Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","support":[{"end":248,"quote":"Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","source_id":"usgs-thesaurus.115","source_sha256":"2b45b2440d097fd5a5f3646703be8d4894640e7ef694c8596043f96930e5bcbb","start":132}],"target_id":"field.usgs.115","target_kind":"node","target_sha256":"670354572cc65a23aba671ccecd0fbfbaff46490dc2b1b4403806dcd8b97d0bc"}],"field.usgs.1176":[{"id":"assertion.field.usgs.1176","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Topography as defined in the captured USGS Thesaurus term 1176","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief","support":[{"end":202,"quote":"Configuration of the land surface and sea floor.\nThis category is also used for\nelevation and relief","source_id":"usgs-thesaurus.1176","source_sha256":"b3c1190ab4358443f78ca711a3b5b3a8fb3c822547e89ec1002ffb7cc3bf720c","start":102}],"target_id":"field.usgs.1176","target_kind":"node","target_sha256":"6a0fe2bec2f4e51fffa31da4d84809586ad4a6204d43737c2f1458d5e504a2f0"}],"field.usgs.1267":[{"id":"assertion.field.usgs.1267","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Vertebrate paleontology as defined in the captured USGS Thesaurus term 1267","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Vertebrate paleontology as: Branch of paleontology dealing with fossil animals that have spinal columns.","support":[{"end":214,"quote":"Branch of paleontology dealing with fossil animals that have spinal columns.","source_id":"usgs-thesaurus.1267","source_sha256":"c7316b1c931eb4c7bfaeaebbfdd38be025b578e57a98a6930451f69563a1a009","start":138}],"target_id":"field.usgs.1267","target_kind":"node","target_sha256":"328fe484d362946c588db006ba93c0e5ae71e8dc9845b7c0c4a8dd4a961ca3ac"}],"field.usgs.1678":[{"id":"assertion.field.usgs.1678","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Hydrodynamics as defined in the captured USGS Thesaurus term 1678","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics","support":[{"end":214,"quote":"Principles of fluid dynamics applied to water bodies.\nThis category is also used for\nfluid dynamics","source_id":"usgs-thesaurus.1678","source_sha256":"cf3bddf3c38503680c31da711d4cb10a9748f34555a0776c88b814380d29b6f4","start":115}],"target_id":"field.usgs.1678","target_kind":"node","target_sha256":"50f4fcdbd6462e4dcc338904559d1897e05833d24f73e12394561668a98853f6"}],"field.usgs.1679":[{"id":"assertion.field.usgs.1679","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleogeography as defined in the captured USGS Thesaurus term 1679","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleogeography as: Study of the history of earth surface characteristics; geomorphology in the past.","support":[{"end":198,"quote":"Study of the history of earth surface characteristics; geomorphology in the past.","source_id":"usgs-thesaurus.1679","source_sha256":"3a4aa8fca56d1dadcbf6ccaf1b16a80e200e87da68f127aa512dad00bd7a8547","start":117}],"target_id":"field.usgs.1679","target_kind":"node","target_sha256":"0ae1822e3ca728ce1e8e11f8f2ab4091bc2236d44119f01ebdb671d1c8659c1b"}],"field.usgs.2090":[{"id":"assertion.field.usgs.2090","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lakebed characteristics as defined in the captured USGS Thesaurus term 2090","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lakebed characteristics as: Characteristics of the bottom of inland bodies of water. This category is also used for lake-bed characteristics , lake-bottom characteristics , and lake-floor characteristics","support":[{"end":303,"quote":"Characteristics of the bottom of inland bodies of water.\nThis category is also used for\nlake-bed characteristics\n,\nlake-bottom characteristics\n, and\nlake-floor characteristics","source_id":"usgs-thesaurus.2090","source_sha256":"d79926b0e705be6481e2b3fbf72f18375a4c9e137a229f95421ef87e2afd291c","start":128}],"target_id":"field.usgs.2090","target_kind":"node","target_sha256":"31708f59572a04ccf5482cb24eb161c99f3c36629bde0c84e5904b353a787777"}],"field.usgs.287":[{"id":"assertion.field.usgs.287","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth characteristics as defined in the captured USGS Thesaurus term 287","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth characteristics as: The measurable, definable properties and features of the earth.","support":[{"end":163,"quote":"The measurable, definable properties and features of the earth.","source_id":"usgs-thesaurus.287","source_sha256":"ca69641e4049c03a1b1e956e22d0562d1d89ba1a4c4a828392ca643a22806f10","start":100}],"target_id":"field.usgs.287","target_kind":"node","target_sha256":"4dae575ad77550ea75aec43cbdbe99daf65e8d907165e1f80419d6f5c2af343b"}],"field.usgs.288":[{"id":"assertion.field.usgs.288","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth history as defined in the captured USGS Thesaurus term 288","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth history as: The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","support":[{"end":310,"quote":"The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","source_id":"usgs-thesaurus.288","source_sha256":"d267e5d8f2f156690d8315000fea4efd1d8895ff91e2181979c0ad89c4f14a21","start":127}],"target_id":"field.usgs.288","target_kind":"node","target_sha256":"073d1faff4c914b71276fec14653e70f3f3d69fa3965822b20d04c4f4002a388"}],"field.usgs.291":[{"id":"assertion.field.usgs.291","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Earth sciences as defined in the captured USGS Thesaurus term 291","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Earth sciences as: Broad term for all science related to the study of the earth. This category is also used for geosciences","support":[{"end":192,"quote":"Broad term for all science related to the study of the earth.\nThis category is also used for\ngeosciences","source_id":"usgs-thesaurus.291","source_sha256":"b7f78697d0e8f3f15deb65da9938400fd83602bcd998c8ec1cf8ef6683825c19","start":88}],"target_id":"field.usgs.291","target_kind":"node","target_sha256":"208319c6c928294626bd07bbad0eacaba77024144e7ac7f2445b7885b734b29c"}],"field.usgs.312":[{"id":"assertion.field.usgs.312","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Economic geology as defined in the captured USGS Thesaurus term 312","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Economic geology as: Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","support":[{"end":250,"quote":"Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","source_id":"usgs-thesaurus.312","source_sha256":"51e4419db6331bc323a253384d883f816a3364290f1f237d9b7bf8ec44711ec5","start":119}],"target_id":"field.usgs.312","target_kind":"node","target_sha256":"e15e01d94cd1b435efedddbe680bb99b38ed6eaad25a1c8fe0a620c00fbc34a7"}],"field.usgs.447":[{"id":"assertion.field.usgs.447","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geography as defined in the captured USGS Thesaurus term 447","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geography as: Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations. This category is also used for geographic information sciences","support":[{"end":319,"quote":"Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations.\nThis category is also used for\ngeographic information sciences","source_id":"usgs-thesaurus.447","source_sha256":"664bef5d57d566dbd756206e387941ad2795894f175a389476d6b340a5516698","start":95}],"target_id":"field.usgs.447","target_kind":"node","target_sha256":"eb461a8fcc6d35fbb3ef65fd859fd8f530086383ac5f46f6dee22a64bab4cb51"}],"field.usgs.455":[{"id":"assertion.field.usgs.455","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geologic history as defined in the captured USGS Thesaurus term 455","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geologic history as: Record (and inferred reconstruction) of the origin and development of the earth since its formation. This category is also used for chronostratigraphy and geohistory","support":[{"end":279,"quote":"Record (and inferred reconstruction) of the origin and development of the earth since its formation.\nThis category is also used for\nchronostratigraphy\nand\ngeohistory","source_id":"usgs-thesaurus.455","source_sha256":"1b7fbcc7c672b3f1976d709e16eb6fa54aefa27cd1a16790579d0d0a83d94e17","start":114}],"target_id":"field.usgs.455","target_kind":"node","target_sha256":"b440ddbce6d18be15af2beb4874d83a25ea8fe278e909e709101f0ace4621f9d"}],"field.usgs.470":[{"id":"assertion.field.usgs.470","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Geophysics as defined in the captured USGS Thesaurus term 470","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Geophysics as: Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere. This category is also used with maps and atlases for geophysical maps","support":[{"end":269,"quote":"Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere.\nThis category is also used with\nmaps and atlases\nfor\ngeophysical maps","source_id":"usgs-thesaurus.470","source_sha256":"7778c51494b82021e1b34d4767226e65fbb9239a34878dae377f5cf79276020e","start":97}],"target_id":"field.usgs.470","target_kind":"node","target_sha256":"c51aa604eb5ad24ecab06f9519bdcd43dba7a70f40f72cc3bd19c665dc8d53b4"}],"field.usgs.604":[{"id":"assertion.field.usgs.604","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Invertebrate paleontology as defined in the captured USGS Thesaurus term 604","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Invertebrate paleontology as: Branch of paleontology which deals with fossil animals without backbones.","support":[{"end":215,"quote":"Branch of paleontology which deals with fossil animals without backbones.","source_id":"usgs-thesaurus.604","source_sha256":"3106464fc4d51b5f0e3070e4cd5033d7897f53444859cd41775577132c793a45","start":142}],"target_id":"field.usgs.604","target_kind":"node","target_sha256":"4ccbc627db26df49221f273cfee899ac40ebbf67093ca7158903ae2aceb01dcc"}],"field.usgs.626":[{"id":"assertion.field.usgs.626","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Land surface characteristics as defined in the captured USGS Thesaurus term 626","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Land surface characteristics as: Features and attributes of earth's land surface. This category is also used for landscape and physiography","support":[{"end":244,"quote":"Features and attributes of earth's land surface.\nThis category is also used for\nlandscape\nand\nphysiography","source_id":"usgs-thesaurus.626","source_sha256":"d80fde4161c55c1e07cdd9e0e6723b5daa2f80041c399712d22d8783c2615e0d","start":138}],"target_id":"field.usgs.626","target_kind":"node","target_sha256":"87f33e5c50676908f5ed3ba335b925d71aca7996313804d2a7dce7fb49148b69"}],"field.usgs.668":[{"id":"assertion.field.usgs.668","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Lithostratigraphy as defined in the captured USGS Thesaurus term 668","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Lithostratigraphy as: Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","support":[{"end":340,"quote":"Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","source_id":"usgs-thesaurus.668","source_sha256":"cfb4912f5deded9b30e8f13498a9cd9879468aa306449f5ae3530cdf4f5d7f0a","start":136}],"target_id":"field.usgs.668","target_kind":"node","target_sha256":"7aeb68ded789a8c470bd49e353d1310a78c5f720821add1c140b7f4b595ada1f"}],"field.usgs.68":[{"id":"assertion.field.usgs.68","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Atmospheric sciences as defined in the captured USGS Thesaurus term 68","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","support":[{"end":212,"quote":"Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","source_id":"usgs-thesaurus.68","source_sha256":"b8c85cc1a3d428338236db0abc875209a315cf8419890925be55b016cecb4dbc","start":117}],"target_id":"field.usgs.68","target_kind":"node","target_sha256":"c2d1e3e57171ec7d1a1d7885d528d21a4945cc5a1bc041f2a5dc956288616126"}],"field.usgs.706":[{"id":"assertion.field.usgs.706","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine geology as defined in the captured USGS Thesaurus term 706","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine geology as: Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin. This category is also used for geological oceanography","support":[{"end":304,"quote":"Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin.\nThis category is also used for\ngeological oceanography","source_id":"usgs-thesaurus.706","source_sha256":"96683ccc8136bc657fc18a5f3b50638a1632d67e8279a6f86e71b14468aaf9a4","start":115}],"target_id":"field.usgs.706","target_kind":"node","target_sha256":"491f6aee5ca67fcb2847c6fb24e3eacebe58f5897142321282b7f404b9f34a34"}],"field.usgs.707":[{"id":"assertion.field.usgs.707","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Marine geophysics as defined in the captured USGS Thesaurus term 707","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Marine geophysics as: Branch of earth sciences concerned with the physical processes of the oceans and continental margins. We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","support":[{"end":321,"quote":"Branch of earth sciences concerned with the physical processes of the oceans and continental margins.  We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","source_id":"usgs-thesaurus.707","source_sha256":"1d79c58d6fc69b4b8b3cadff42431981ff63d7afe1acda7489a6abc3bef84d12","start":124}],"target_id":"field.usgs.707","target_kind":"node","target_sha256":"71e712f4b1ed9834137e6b93690b5cb1d72ebd75b63e280ffec2295d61a2f7b4"}],"field.usgs.738":[{"id":"assertion.field.usgs.738","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Micropaleontology as defined in the captured USGS Thesaurus term 738","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Micropaleontology as: Branch of paleontology dealing with fossils too small to be seen without a microscope.","support":[{"end":212,"quote":"Branch of paleontology dealing with fossils too small to be seen without a microscope.","source_id":"usgs-thesaurus.738","source_sha256":"cf4d5c915642a1f6c02800a88b07371934ae7ef6c0ad77fdcf1210073d43ea62","start":126}],"target_id":"field.usgs.738","target_kind":"node","target_sha256":"9be2f07b9606d4a21e443d40b7ae79542f5aefc7feaff6784d2ae8377079e30d"}],"field.usgs.810":[{"id":"assertion.field.usgs.810","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean characteristics as defined in the captured USGS Thesaurus term 810","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean characteristics as: The attributes and process of seas and oceans. This category is also used for ocean mixed-layer depth , with field inventory and monitoring for ocean monitoring , ocean surface characteristics , with ocean processes for oceans , and sea surface reflectance","support":[{"end":382,"quote":"The attributes and process of seas and oceans.\nThis category is also used for\nocean mixed-layer depth\n,  with\nfield inventory and monitoring\nfor\nocean monitoring\n,\nocean surface characteristics\n,  with\nocean processes\nfor\noceans\n, and\nsea surface reflectance","source_id":"usgs-thesaurus.810","source_sha256":"243247b1d2abf76416d468177c095a46ff5afeeef623047a426a43639aa49f67","start":124}],"target_id":"field.usgs.810","target_kind":"node","target_sha256":"d62ee1366694c8034d76b3e71f4fcd3d7036fc7b424f6e15ac2ddb19eaf00965"}],"field.usgs.818":[{"id":"assertion.field.usgs.818","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Ocean sciences as defined in the captured USGS Thesaurus term 818","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Ocean sciences as: Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans. This category is also used for oceanography and physical oceanography","support":[{"end":300,"quote":"Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans.\nThis category is also used for\noceanography\nand\nphysical oceanography","source_id":"usgs-thesaurus.818","source_sha256":"9ce96247834363de427791996e64a8dae6069a6dfe5a6f5c2a28abae682f9224","start":105}],"target_id":"field.usgs.818","target_kind":"node","target_sha256":"41dff1d87ded5db4c205f31137d6f5d76d85320f97aa294c70e2950639163837"}],"field.usgs.859":[{"id":"assertion.field.usgs.859","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleoceanography as defined in the captured USGS Thesaurus term 859","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleoceanography as: Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","support":[{"end":235,"quote":"Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","source_id":"usgs-thesaurus.859","source_sha256":"870c4912c73a119d43e4882fb871f8c64f8c4c819d32841d9a8c928c8d07ecdc","start":126}],"target_id":"field.usgs.859","target_kind":"node","target_sha256":"53444b4b7a32db68072a3d50849a7c93cc8941d30f22f3813d431e020a74ef1b"}],"field.usgs.862":[{"id":"assertion.field.usgs.862","scope":{"assumptions":"Attributed thesaurus definition; not an original research, efficacy or historical-priority claim","population":"Paleoseismology as defined in the captured USGS Thesaurus term 862","quantifiers":"Only what the captured definition states","time":null,"uncertainty":"Vocabulary attribution only; no claim of empirical validation, consensus or frontier status","units":null},"statement":"The USGS Thesaurus defines Paleoseismology as: Branch of seismology concerned with ancient earthquakes. Clues which indicate seismic activities in the geologic past are used to date and determine the effects of those earthquakes.","support":[{"end":317,"quote":"Branch of seismology concerned with ancient earthquakes.  Clues which indicate seismic activities in the geologic past are used  to date and determine the effects of those earthquakes.","source_id":"usgs-thesaurus.862","source_sha256":"ff23d3bf2bfa647b7d5bee8cd7fd69332107162248174a3c53c7dadeade8783e","start":133}],"target_id":"field.usgs.862","target_kind":"node","target_sha256":"f8f375f9f8ce88ff742a3996d2e674d4827aedf1e25e01057ab15f6bd885d030"}],"field.wikipedia.abstract-algebra":[{"id":"assertion.field.wikipedia.abstract-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abstract algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abstract algebra\", CC BY-SA 4.0) states: In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","support":[{"end":285,"quote":"In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","source_id":"wikipedia.article.abstract-algebra","source_sha256":"b914c6a89315c6af5de93ae44b2135dfb69092646db6351dd47bc6cda45a1235","start":104}],"target_id":"field.wikipedia.abstract-algebra","target_kind":"node","target_sha256":"3011d24281af85fc68e76ce6aa6985e0ab710e6547debdd5b174293d0d310976"}],"field.wikipedia.acoustical-engineering":[{"id":"assertion.field.wikipedia.acoustical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Acoustical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Acoustical engineering\", CC BY-SA 4.0) states: Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","support":[{"end":230,"quote":"Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","source_id":"wikipedia.article.acoustical-engineering","source_sha256":"3d0e12508dc3985a2b8b0ccd3bf4bae12660abee32b015b9d7575c5353b57962","start":108}],"target_id":"field.wikipedia.acoustical-engineering","target_kind":"node","target_sha256":"49f188d38522cbe0b8fb2fb92384a416b82ef2c5cea278c323fa88eabdd2fc30"}],"field.wikipedia.aerospace-engineering":[{"id":"assertion.field.wikipedia.aerospace-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aerospace engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aerospace engineering\", CC BY-SA 4.0) states: Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","support":[{"end":225,"quote":"Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","source_id":"wikipedia.article.aerospace-engineering","source_sha256":"43d820ee7a74c974fff38dcb315a38a234be6df25ff838e313e40c9f23fed314","start":109}],"target_id":"field.wikipedia.aerospace-engineering","target_kind":"node","target_sha256":"32237d3a99013f588b68a341515246b39a4fe1b539fd895b462cad723ae754d2"}],"field.wikipedia.agnoiology":[{"id":"assertion.field.wikipedia.agnoiology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agnoiology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agnoiology\", CC BY-SA 4.0) states: Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \"unknowable\" (as distinct from \"unknown\").","support":[{"end":317,"quote":"Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \\\"unknowable\\\" (as distinct from \\\"unknown\\\").","source_id":"wikipedia.article.agnoiology","source_sha256":"ad2eb372d28b3d1b2c2cbe7a5017ece7e2147d0b22402a86de63658cbb76ec84","start":98}],"target_id":"field.wikipedia.agnoiology","target_kind":"node","target_sha256":"51eb8810b8f468423d5b1812a84c5c3b0bbe681f4e89f861c53b40cfd7ab904f"}],"field.wikipedia.agricultural-engineering":[{"id":"assertion.field.wikipedia.agricultural-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Agricultural engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Agricultural engineering\", CC BY-SA 4.0) states: Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","support":[{"end":570,"quote":"Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","source_id":"wikipedia.article.agricultural-engineering","source_sha256":"ccc6297b61bd7b28cbb653e5a4609fa1d68801ea409cdc182a89195105b07cca","start":112}],"target_id":"field.wikipedia.agricultural-engineering","target_kind":"node","target_sha256":"00cdac86ed1529f936f92cc43d1720f0faa5cfd53305f74bf283eeaeeebf1e0c"}],"field.wikipedia.alethiology":[{"id":"assertion.field.wikipedia.alethiology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alethiology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alethiology\", CC BY-SA 4.0) states: Alethiology (or alethology, \"the study of aletheia\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","support":[{"end":263,"quote":"Alethiology (or alethology, \\\"the study of aletheia\\\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","source_id":"wikipedia.article.alethiology","source_sha256":"a253660a7045cc063f335ad9900821b5c2cc5c48a98b0e849dbfedec249d382a","start":98}],"target_id":"field.wikipedia.alethiology","target_kind":"node","target_sha256":"561632bc950746151e3c2237cca9b13a88137775afe49c0f2c147e630a259424"}],"field.wikipedia.algebraic-analysis":[{"id":"assertion.field.wikipedia.algebraic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic analysis\", CC BY-SA 4.0) states: Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","support":[{"end":354,"quote":"Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","source_id":"wikipedia.article.algebraic-analysis","source_sha256":"e36e8a62e908d85945858ca6d0e5d98d64938a376c1d84fb30abb83b440f9abf","start":106}],"target_id":"field.wikipedia.algebraic-analysis","target_kind":"node","target_sha256":"c94ebec4841713d8832152fad9667a376b8a7e22c83540f610c1c5acf9f846c2"}],"field.wikipedia.algebraic-number-theory":[{"id":"assertion.field.wikipedia.algebraic-number-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic number theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic number theory\", CC BY-SA 4.0) states: Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","support":[{"end":274,"quote":"Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","source_id":"wikipedia.article.algebraic-number-theory","source_sha256":"aced4bb02a991fb5362adb8cf97cd13505e471c37db0e2f8b6b40951efd48494","start":109}],"target_id":"field.wikipedia.algebraic-number-theory","target_kind":"node","target_sha256":"eb16e74dbf140221e45e850d1e53ef10fead8b9f9600d9e86551eb34b6eca8b0"}],"field.wikipedia.algebraic-topology":[{"id":"assertion.field.wikipedia.algebraic-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Algebraic topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Algebraic topology\", CC BY-SA 4.0) states: Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","support":[{"end":215,"quote":"Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","source_id":"wikipedia.article.algebraic-topology","source_sha256":"816c31ad92147e32f7a22c99063af2029d171cc2fa823523a48d8034e66a80d3","start":103}],"target_id":"field.wikipedia.algebraic-topology","target_kind":"node","target_sha256":"6c8a664da2c90dc3a7920fd5de9cf3beed45a5f414a90a708e806ec2a3266b3b"}],"field.wikipedia.appert-topology":[{"id":"assertion.field.wikipedia.appert-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Appert topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Appert topology\", CC BY-SA 4.0) states: In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","support":[{"end":268,"quote":"In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","source_id":"wikipedia.article.appert-topology","source_sha256":"817e3afab0844b8a32ce79b08f1cb4efbcd6157f97b4f5a5030738b7e05ac041","start":103}],"target_id":"field.wikipedia.appert-topology","target_kind":"node","target_sha256":"aa003d8a8c3f7f974c4b350bb6f82803c8f31d699b7f4074b579a6112cf205b8"}],"field.wikipedia.applied-category-theory":[{"id":"assertion.field.wikipedia.applied-category-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied category theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied category theory\", CC BY-SA 4.0) states: Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","support":[{"end":398,"quote":"Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","source_id":"wikipedia.article.applied-category-theory","source_sha256":"8f78a25c0345a6c792a409c0df8150afa78df0d296bbe1e172d9c9a13b7a87aa","start":111}],"target_id":"field.wikipedia.applied-category-theory","target_kind":"node","target_sha256":"8b1012e00d2df48b4fcf6cff8e67f9d52c04fcd3d78df6856e1498b47a163dbb"}],"field.wikipedia.applied-mechanics":[{"id":"assertion.field.wikipedia.applied-mechanics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Applied mechanics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Applied mechanics\", CC BY-SA 4.0) states: Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","support":[{"end":269,"quote":"Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","source_id":"wikipedia.article.applied-mechanics","source_sha256":"d6953c3a186f4dcab81f87d460470486b724adac3c6b30c9ac49e4cf8ebb8879","start":104}],"target_id":"field.wikipedia.applied-mechanics","target_kind":"node","target_sha256":"157515579c2703a34a2d944e4f478d83c4ba0130a7a6dc0624c30ee8652b4cde"}],"field.wikipedia.architectural-acoustics":[{"id":"assertion.field.wikipedia.architectural-acoustics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural acoustics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural acoustics\", CC BY-SA 4.0) states: Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","support":[{"end":286,"quote":"Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","source_id":"wikipedia.article.architectural-acoustics","source_sha256":"51e3108a6bc8de9a7bbf787e09f02c4bcf0e5a21c10e2e3dd2410a940f22d172","start":110}],"target_id":"field.wikipedia.architectural-acoustics","target_kind":"node","target_sha256":"593c28cf83cab6c1111c73d91509232ef60aacc0d4e473d21442f61897bf634a"}],"field.wikipedia.architectural-engineering":[{"id":"assertion.field.wikipedia.architectural-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Architectural engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Architectural engineering\", CC BY-SA 4.0) states: Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","support":[{"end":396,"quote":"Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","source_id":"wikipedia.article.architectural-engineering","source_sha256":"0f2d99f21a3cbcf1e04691af93823257b4aed729d6c8c36fe99ba2adc8a45e22","start":113}],"target_id":"field.wikipedia.architectural-engineering","target_kind":"node","target_sha256":"6f758218c5aa1cbdbd0e431e16437bd125ed6cd1866532fbe89320bddc575318"}],"field.wikipedia.argumentation-theory":[{"id":"assertion.field.wikipedia.argumentation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Argumentation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Argumentation theory\", CC BY-SA 4.0) states: Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","support":[{"end":247,"quote":"Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","source_id":"wikipedia.article.argumentation-theory","source_sha256":"78216012fa171462a17524293032e966e23c062d3b982d3049edb212f8102048","start":107}],"target_id":"field.wikipedia.argumentation-theory","target_kind":"node","target_sha256":"7d4d56cf266c326e32015f38b9a541707f58233a2d8f11e45e94785c5868a994"}],"field.wikipedia.arithmetic-combinatorics":[{"id":"assertion.field.wikipedia.arithmetic-combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic combinatorics\", CC BY-SA 4.0) states: In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","support":[{"end":254,"quote":"In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","source_id":"wikipedia.article.arithmetic-combinatorics","source_sha256":"fda0e0896cdaee446b4e1a8aa7ae46744add263f99638903242577eb5b7cc55f","start":112}],"target_id":"field.wikipedia.arithmetic-combinatorics","target_kind":"node","target_sha256":"a71c444998332f18de919cb03f64e95aa93f4e97a66735e0cd6898cacdebfac3"}],"field.wikipedia.arithmetic-dynamics":[{"id":"assertion.field.wikipedia.arithmetic-dynamics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Arithmetic dynamics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Arithmetic dynamics\", CC BY-SA 4.0) states: Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","support":[{"end":217,"quote":"Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","source_id":"wikipedia.article.arithmetic-dynamics","source_sha256":"f0f3d559126f473f2cfedc4a18e1e88d9abfa9b306a13e996ecd530e8e04f96d","start":107}],"target_id":"field.wikipedia.arithmetic-dynamics","target_kind":"node","target_sha256":"fdf68c72037ba187469d95cd6d57d74217f760ca2ebd680831d7df5962612917"}],"field.wikipedia.artificial-intelligence-engineering":[{"id":"assertion.field.wikipedia.artificial-intelligence-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Artificial intelligence engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Artificial intelligence engineering\", CC BY-SA 4.0) states: Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","support":[{"end":272,"quote":"Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","source_id":"wikipedia.article.artificial-intelligence-engineering","source_sha256":"2c5dcea1cdca78edd3775c9b7bc482d065d48c5e2b04b60ea3ca4cf065f64d63","start":123}],"target_id":"field.wikipedia.artificial-intelligence-engineering","target_kind":"node","target_sha256":"1c7ce65f99f1ce36cb4144d8a5dda8b22a35a5b32cf9bffdec8642bbe1cb755d"}],"field.wikipedia.asymptotic-geometry":[{"id":"assertion.field.wikipedia.asymptotic-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Asymptotic geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Asymptotic geometry\", CC BY-SA 4.0) states: Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","support":[{"end":378,"quote":"Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","source_id":"wikipedia.article.asymptotic-geometry","source_sha256":"4f5ab8c058ffa10ef129fa06b8e81319a12814899eb947b4f5666b0160e17586","start":107}],"target_id":"field.wikipedia.asymptotic-geometry","target_kind":"node","target_sha256":"0ed3576cf1c5de4ce21cc9f4460fb2a7a081b99642d9b44c736b5f4b93432218"}],"field.wikipedia.automation-engineering":[{"id":"assertion.field.wikipedia.automation-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Automation engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Automation engineering\", CC BY-SA 4.0) states: Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","support":[{"end":344,"quote":"Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","source_id":"wikipedia.article.automation-engineering","source_sha256":"ece3ffcbd3a29d5b8153e3b343e7f0726f3ee31422159fc4ef7acf7e4c5924a2","start":110}],"target_id":"field.wikipedia.automation-engineering","target_kind":"node","target_sha256":"c61fe7e98228e89a1b796d6d2d279d28abfe1480b120d2b61d9cb77578564194"}],"field.wikipedia.aviation-engineering":[{"id":"assertion.field.wikipedia.aviation-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aviation engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aviation engineering\", CC BY-SA 4.0) states: Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","support":[{"end":267,"quote":"Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","source_id":"wikipedia.article.aviation-engineering","source_sha256":"f03bd54a62863f7e167c76839f02a10e2d446ce4bbc9564e89325905ecea1433","start":108}],"target_id":"field.wikipedia.aviation-engineering","target_kind":"node","target_sha256":"f54d4562fbaf77e735741f02794f8670a45854b5e42187c0f18ea74a5daa997c"}],"field.wikipedia.bayesian-epistemology":[{"id":"assertion.field.wikipedia.bayesian-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bayesian epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bayesian epistemology\", CC BY-SA 4.0) states: Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","support":[{"end":262,"quote":"Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","source_id":"wikipedia.article.bayesian-epistemology","source_sha256":"84d6e9908a5905879eb51d54a7c608a706a4c013891d629e70afba2f5778e6ca","start":109}],"target_id":"field.wikipedia.bayesian-epistemology","target_kind":"node","target_sha256":"1ab542c4aa75177d49665fac9851bad34ae4c4057801eac95818225ae4d50405"}],"field.wikipedia.biological-systems-engineering":[{"id":"assertion.field.wikipedia.biological-systems-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Biological systems engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Biological systems engineering\", CC BY-SA 4.0) states: Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","support":[{"end":262,"quote":"Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","source_id":"wikipedia.article.biological-systems-engineering","source_sha256":"84c8ad52c1640aad5043d184e58059efb2d82b6216ea5c0ddb6a82fc4bb6a22a","start":117}],"target_id":"field.wikipedia.biological-systems-engineering","target_kind":"node","target_sha256":"3278893830bf1b5179663a1146f35ad12a73a0cfda9df434336f506db63b414a"}],"field.wikipedia.bioresource-engineering":[{"id":"assertion.field.wikipedia.bioresource-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bioresource engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bioresource engineering\", CC BY-SA 4.0) states: Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","support":[{"end":218,"quote":"Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","source_id":"wikipedia.article.bioresource-engineering","source_sha256":"cbfdd9957c50c2738376406e797366a7e92fc4a831194e677533b1f3677cea49","start":111}],"target_id":"field.wikipedia.bioresource-engineering","target_kind":"node","target_sha256":"547d432bcaea46a73209ecdd49d0dcd60c294bf35eebf70e6c920b78efba4738"}],"field.wikipedia.categorical-topology":[{"id":"assertion.field.wikipedia.categorical-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Categorical topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Categorical topology\", CC BY-SA 4.0) states: In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","support":[{"end":299,"quote":"In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","source_id":"wikipedia.article.categorical-topology","source_sha256":"0767f2c8bec022adf050a5f8c73aca8c29ac803f0e4f6298ebc57cd55baade9b","start":108}],"target_id":"field.wikipedia.categorical-topology","target_kind":"node","target_sha256":"33b81114343308a672d27dd240ba5c9a5c3a6c68f3a6f53ee21eef996afe4e4c"}],"field.wikipedia.chaos-engineering":[{"id":"assertion.field.wikipedia.chaos-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chaos engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chaos engineering\", CC BY-SA 4.0) states: Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","support":[{"end":274,"quote":"Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","source_id":"wikipedia.article.chaos-engineering","source_sha256":"34b3a2bc6a354dce01895c2bc2b8851bf4a0154828a3a1bea49b543fdde1a6ae","start":105}],"target_id":"field.wikipedia.chaos-engineering","target_kind":"node","target_sha256":"d960faaa17b68b6f69b82cc7d6e15a8f3f950b2045de7f58e8ea62dcab29761c"}],"field.wikipedia.chemotronics":[{"id":"assertion.field.wikipedia.chemotronics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chemotronics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chemotronics\", CC BY-SA 4.0) states: Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","support":[{"end":269,"quote":"Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","source_id":"wikipedia.article.chemotronics","source_sha256":"110f1a6fb49b2cfafa432f357dd78ba2c3e5088265003815b90503c8700b77e9","start":100}],"target_id":"field.wikipedia.chemotronics","target_kind":"node","target_sha256":"3a879322d1dfd2c8b21faeebbf8236d28271ddf8353692bb27166f643c90fef7"}],"field.wikipedia.civil-engineering":[{"id":"assertion.field.wikipedia.civil-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Civil engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Civil engineering\", CC BY-SA 4.0) states: Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","support":[{"end":414,"quote":"Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","source_id":"wikipedia.article.civil-engineering","source_sha256":"1652caa7287e0291bd3401f0d941067f7e504009bc966f0892544cc3608a6845","start":101}],"target_id":"field.wikipedia.civil-engineering","target_kind":"node","target_sha256":"8847d65e5b75669f21c61348ea154e3b11d1a61d2e8e1557e4ce805a8521e565"}],"field.wikipedia.combinatorics":[{"id":"assertion.field.wikipedia.combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Combinatorics\", CC BY-SA 4.0) states: Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","support":[{"end":268,"quote":"Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","source_id":"wikipedia.article.combinatorics","source_sha256":"c5e6762b3b4cf14ad1c39419af69cd8fd65096a681577ec8175aee8751344f95","start":97}],"target_id":"field.wikipedia.combinatorics","target_kind":"node","target_sha256":"7a8dd8a7271d41a381ca962b51e2d4f02ad8eb97a6b4929c1ced4d2955f05d5a"}],"field.wikipedia.commutative-algebra":[{"id":"assertion.field.wikipedia.commutative-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commutative algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commutative algebra\", CC BY-SA 4.0) states: Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","support":[{"end":254,"quote":"Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","source_id":"wikipedia.article.commutative-algebra","source_sha256":"010dec44b016b1ef8d3b5523a4f51161505bcd149877163ec9c5479c96254722","start":105}],"target_id":"field.wikipedia.commutative-algebra","target_kind":"node","target_sha256":"cd26965896f39c70cc18e786a7d4fa345b73aacd0984e133b5771fe39e82ae90"}],"field.wikipedia.complex-analysis":[{"id":"assertion.field.wikipedia.complex-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Complex analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Complex analysis\", CC BY-SA 4.0) states: Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","support":[{"end":298,"quote":"Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","source_id":"wikipedia.article.complex-analysis","source_sha256":"26e36b429afe1deb80f6d4faf9e35a0c2e6bbfd945b0d260d6fc97acdf12517d","start":100}],"target_id":"field.wikipedia.complex-analysis","target_kind":"node","target_sha256":"d9099e6f9e9a87bdcda5a781b4e4b28816a6a8988de9bda69d38b5a2756bbbd2"}],"field.wikipedia.computability-theory":[{"id":"assertion.field.wikipedia.computability-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computability theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computability theory\", CC BY-SA 4.0) states: Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","support":[{"end":330,"quote":"Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","source_id":"wikipedia.article.computability-theory","source_sha256":"eb219d73180e0db246e2543e2e10fa8e9be642568ddfd58d7aba06792869b10a","start":106}],"target_id":"field.wikipedia.computability-theory","target_kind":"node","target_sha256":"eee76ffb1093b722dadaddf42b5b1408ee8e0da0efac45b46a4bf2778d6de642"}],"field.wikipedia.computer-engineering":[{"id":"assertion.field.wikipedia.computer-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer engineering\", CC BY-SA 4.0) states: Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","support":[{"end":235,"quote":"Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","source_id":"wikipedia.article.computer-engineering","source_sha256":"b6cdee707c60616e1b59f68161a0cd26a5a905d93724ea2d5375baa4d0b7bc80","start":105}],"target_id":"field.wikipedia.computer-engineering","target_kind":"node","target_sha256":"891ffc3beb0021692ffedcee760c846cca9fb868ec0904305df6ac4fb75b807a"}],"field.wikipedia.computer-network-engineering":[{"id":"assertion.field.wikipedia.computer-network-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Computer network engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Computer network engineering\", CC BY-SA 4.0) states: Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","support":[{"end":271,"quote":"Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","source_id":"wikipedia.article.computer-network-engineering","source_sha256":"1391dc8f4eb69ebf09f90ab4281139ddd53ed83dc07132ba3142662def0e42ff","start":116}],"target_id":"field.wikipedia.computer-network-engineering","target_kind":"node","target_sha256":"62f503a308cc6e59f36593041f9359ec0a7e2009f7d0b808299f82a5903a587b"}],"field.wikipedia.conceptual-engineering":[{"id":"assertion.field.wikipedia.conceptual-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conceptual engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conceptual engineering\", CC BY-SA 4.0) states: Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","support":[{"end":253,"quote":"Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","source_id":"wikipedia.article.conceptual-engineering","source_sha256":"a8f7d0c23e1f4b1c8645412d996b232988ce85f924892af5ba7b5ff8d321fdaa","start":110}],"target_id":"field.wikipedia.conceptual-engineering","target_kind":"node","target_sha256":"13604301b51a5a8f7a7bf64e4f741017bdde501160242a43e3c3688d0719d1e0"}],"field.wikipedia.consensus-dynamics":[{"id":"assertion.field.wikipedia.consensus-dynamics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Consensus dynamics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Consensus dynamics\", CC BY-SA 4.0) states: Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","support":[{"end":238,"quote":"Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","source_id":"wikipedia.article.consensus-dynamics","source_sha256":"561998ed1973622b395e92cab044c3a19638cd42d446645e91a04147c98e9443","start":106}],"target_id":"field.wikipedia.consensus-dynamics","target_kind":"node","target_sha256":"72a9a373cdefff2cc7ffd97b3f33059428dc745b8c75b272f2a293db4230954b"}],"field.wikipedia.control-theory":[{"id":"assertion.field.wikipedia.control-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Control theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Control theory\", CC BY-SA 4.0) states: Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","support":[{"end":220,"quote":"Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","source_id":"wikipedia.article.control-theory","source_sha256":"a24e996a9caa742e5c35b8c43b98301d807a83242c961f22731db7500787f759","start":98}],"target_id":"field.wikipedia.control-theory","target_kind":"node","target_sha256":"d33fe1a18774c9ac24d66a65f6957bfa2b6251ce73edba1fec35ef9d88e4be80"}],"field.wikipedia.convex-analysis":[{"id":"assertion.field.wikipedia.convex-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex analysis\", CC BY-SA 4.0) states: Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","support":[{"end":321,"quote":"Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","source_id":"wikipedia.article.convex-analysis","source_sha256":"cef4cd83eaca39ad1087cda7455cf043e4ee6e107e83b11d8704b3a3932a6c02","start":102}],"target_id":"field.wikipedia.convex-analysis","target_kind":"node","target_sha256":"911a8cd2375c1b8f1a6fbb3ac5e989704cdbb538aa5d317d49ff88945ec6ce8d"}],"field.wikipedia.convex-geometry":[{"id":"assertion.field.wikipedia.convex-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Convex geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Convex geometry\", CC BY-SA 4.0) states: In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","support":[{"end":208,"quote":"In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","source_id":"wikipedia.article.convex-geometry","source_sha256":"a817399c37725e803f886822927037b8532f75309447122b3f58e8ee82089260","start":102}],"target_id":"field.wikipedia.convex-geometry","target_kind":"node","target_sha256":"216008ed15962ee0d800e5ebb0cf94d1e79b37c9617a702cacdb485afbc3519a"}],"field.wikipedia.differential-geometry":[{"id":"assertion.field.wikipedia.differential-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Differential geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Differential geometry\", CC BY-SA 4.0) states: Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","support":[{"end":254,"quote":"Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","source_id":"wikipedia.article.differential-geometry","source_sha256":"bb15f037c5427d487984e21dc0a74f86c569bfbd8bdc59fced5680a7e886d707","start":105}],"target_id":"field.wikipedia.differential-geometry","target_kind":"node","target_sha256":"11b2498e6e0b5f7d9494b2540c39146e926f7947a7e976de0d33dd6d1b772602"}],"field.wikipedia.discrete-mathematics":[{"id":"assertion.field.wikipedia.discrete-mathematics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Discrete mathematics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Discrete mathematics\", CC BY-SA 4.0) states: Discrete mathematics is the study of mathematical structures that can be considered \"discrete\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \"continuous\" (analogously to continuous functions).","support":[{"end":379,"quote":"Discrete mathematics is the study of mathematical structures that can be considered \\\"discrete\\\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \\\"continuous\\\" (analogously to continuous functions).","source_id":"wikipedia.article.discrete-mathematics","source_sha256":"aee41777f21c001d746a59e6b83478816a8b795370954348bcb21761f9a62ecd","start":104}],"target_id":"field.wikipedia.discrete-mathematics","target_kind":"node","target_sha256":"ef1c3e12c0958adf0ae4aea2889f48a8d06e44d7cb97fd8c3446b1fec8b6911d"}],"field.wikipedia.electrical-engineering":[{"id":"assertion.field.wikipedia.electrical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Electrical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Electrical engineering\", CC BY-SA 4.0) states: Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","support":[{"end":299,"quote":"Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","source_id":"wikipedia.article.electrical-engineering","source_sha256":"73f4bd99c02717d7813b6d786e4a5aed15bef05f5e963c63435d06e7a4f86549","start":106}],"target_id":"field.wikipedia.electrical-engineering","target_kind":"node","target_sha256":"53d71890e08e47e371dadb3f0fe625b73a809e08d28caf5699016c122a140e27"}],"field.wikipedia.extremal-combinatorics":[{"id":"assertion.field.wikipedia.extremal-combinatorics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Extremal combinatorics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Extremal combinatorics\", CC BY-SA 4.0) states: Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","support":[{"end":199,"quote":"Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","source_id":"wikipedia.article.extremal-combinatorics","source_sha256":"b1b4338812fe35b0a95897879bb540c3704e3850c0812ea97756f3d524484941","start":109}],"target_id":"field.wikipedia.extremal-combinatorics","target_kind":"node","target_sha256":"4a26a843fee31b48bc4d66a2fc6d8985d8cb1624ece47b903bc1c573a3d857d5"}],"field.wikipedia.fourier-analysis":[{"id":"assertion.field.wikipedia.fourier-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fourier analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fourier analysis\", CC BY-SA 4.0) states: In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of trigonometric functions or more conveniently, complex exponentials.","support":[{"end":421,"quote":"In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of  trigonometric functions or more conveniently, complex exponentials.","source_id":"wikipedia.article.fourier-analysis","source_sha256":"e3dbcda56208ffe347a7c199b9abd70a9b805fa3eea017ef30c6dd70ae44d2b1","start":101}],"target_id":"field.wikipedia.fourier-analysis","target_kind":"node","target_sha256":"a102d118cfeaaca9393ba4e9d0cfc60d23bbe5c487a2ced84bced2888d9cd69c"}],"field.wikipedia.functional-analysis":[{"id":"assertion.field.wikipedia.functional-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Functional analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Functional analysis\", CC BY-SA 4.0) states: Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","support":[{"end":408,"quote":"Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","source_id":"wikipedia.article.functional-analysis","source_sha256":"39ee898b84a5e26d0e48b0cf954cc87447f337b6a2d31c425449bf9aa0b7eb8b","start":104}],"target_id":"field.wikipedia.functional-analysis","target_kind":"node","target_sha256":"de9fe92e2747d2c7f5cbb5d09f3f0417c474b9bfdf335cc76f73bb60ff91a737"}],"field.wikipedia.general-topology":[{"id":"assertion.field.wikipedia.general-topology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"General topology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"General topology\", CC BY-SA 4.0) states: In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","support":[{"end":272,"quote":"In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","source_id":"wikipedia.article.general-topology","source_sha256":"bbb12ce87227b06504e63d52bcf6c94d412454630be00476ca00c36dc7207102","start":102}],"target_id":"field.wikipedia.general-topology","target_kind":"node","target_sha256":"c497dac6ed255c6fc64ae4da2f31c9f841e4d5b453941309d384fd98cc8c5f40"}],"field.wikipedia.genetic-epistemology":[{"id":"assertion.field.wikipedia.genetic-epistemology","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Genetic epistemology as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Genetic epistemology\", CC BY-SA 4.0) states: Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","support":[{"end":278,"quote":"Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","source_id":"wikipedia.article.genetic-epistemology","source_sha256":"c74057f24f44c2991c7a1797a5a93bfc126b390e65c517f7b356dee021e1e7c1","start":108}],"target_id":"field.wikipedia.genetic-epistemology","target_kind":"node","target_sha256":"f70f44b11c8c9ab2f9f2a515c54a173969673165ec7c43a08067758ef57f71e0"}],"field.wikipedia.geometric-analysis":[{"id":"assertion.field.wikipedia.geometric-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geometric analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geometric analysis\", CC BY-SA 4.0) states: Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","support":[{"end":338,"quote":"Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","source_id":"wikipedia.article.geometric-analysis","source_sha256":"95adaf24a467daa07c78b09f0fc0f1af640d4c0801c1ff893ed96603549d8ec2","start":105}],"target_id":"field.wikipedia.geometric-analysis","target_kind":"node","target_sha256":"621c525f6779fe3f92b4ac6d1936859cb8bad7e2e0cb2596af8031458eb2d9b4"}],"field.wikipedia.geotechnical-engineering":[{"id":"assertion.field.wikipedia.geotechnical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Geotechnical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Geotechnical engineering\", CC BY-SA 4.0) states: Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","support":[{"end":256,"quote":"Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","source_id":"wikipedia.article.geotechnical-engineering","source_sha256":"0030eef34e2e5d05aa9e74bfd3ad416c07f279edbd23563c198ac73c8b4e16cf","start":109}],"target_id":"field.wikipedia.geotechnical-engineering","target_kind":"node","target_sha256":"798e59165b18a813ea73d37b0a4661aa56ea3df46e2a514ee53df7fced2860f0"}],"field.wikipedia.global-analysis":[{"id":"assertion.field.wikipedia.global-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Global analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Global analysis\", CC BY-SA 4.0) states: In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","support":[{"end":283,"quote":"In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","source_id":"wikipedia.article.global-analysis","source_sha256":"1e10b28b5709b7d4a00e802cb8f09ff35b828f10b35b26592d810f86ec004ebf","start":103}],"target_id":"field.wikipedia.global-analysis","target_kind":"node","target_sha256":"e96c52ae025d556014f895e2c0cb088a38fa4738a129ed4549ed6f2c1acf80da"}],"field.wikipedia.harmonic-analysis":[{"id":"assertion.field.wikipedia.harmonic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Harmonic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Harmonic analysis\", CC BY-SA 4.0) states: Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","support":[{"end":246,"quote":"Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","source_id":"wikipedia.article.harmonic-analysis","source_sha256":"474a2cbfb2e2ce6a0027ad1fe937f292a0f99f82c8446eafbe1960a7a4d739b2","start":102}],"target_id":"field.wikipedia.harmonic-analysis","target_kind":"node","target_sha256":"208d78a72f8e31841861149709ce4be7b0b987e6521c2316bd7bb1fc2dc0badc"}],"field.wikipedia.hermeneutics":[{"id":"assertion.field.wikipedia.hermeneutics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hermeneutics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hermeneutics\", CC BY-SA 4.0) states: Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","support":[{"end":270,"quote":"Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","source_id":"wikipedia.article.hermeneutics","source_sha256":"8189bc325e90b595fb18572b0da6d177531d235e928a55bcc3ea8927ab6e9054","start":97}],"target_id":"field.wikipedia.hermeneutics","target_kind":"node","target_sha256":"f7605c7c6f5a29a097cbc5092d06ee6e9f8ba77b0767402f4170142041001a0f"}],"field.wikipedia.history-and-philosophy-of-science":[{"id":"assertion.field.wikipedia.history-and-philosophy-of-science","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"History and philosophy of science as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"History and philosophy of science\", CC BY-SA 4.0) states: The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","support":[{"end":260,"quote":"The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","source_id":"wikipedia.article.history-and-philosophy-of-science","source_sha256":"a904862f00f3e6bc069a218eb8e1409b94a48b462fc5559e53766d4e62fdc36d","start":120}],"target_id":"field.wikipedia.history-and-philosophy-of-science","target_kind":"node","target_sha256":"0ff19f1a10dd1ae2b4b30cbf3f266d84779c2d653648ebdb81a246ada5403d61"}],"field.wikipedia.homological-algebra":[{"id":"assertion.field.wikipedia.homological-algebra","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Homological algebra as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Homological algebra\", CC BY-SA 4.0) states: Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","support":[{"end":207,"quote":"Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","source_id":"wikipedia.article.homological-algebra","source_sha256":"563784e1be9b8f0641d8e1637bb178e9f4d85e611ae7bf49a7379da20f46c5fe","start":105}],"target_id":"field.wikipedia.homological-algebra","target_kind":"node","target_sha256":"2cd8699d503a1fa66b5b3fc598efd679b00f166f255f20f9918a738527b5dd01"}],"field.wikipedia.mathematical-analysis":[{"id":"assertion.field.wikipedia.mathematical-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Mathematical analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Mathematical analysis\", CC BY-SA 4.0) states: Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","support":[{"end":252,"quote":"Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","source_id":"wikipedia.article.mathematical-analysis","source_sha256":"88b8cb874eb78cfbfd139efd879545732c86f2ecc34ba0f47537801d40007113","start":106}],"target_id":"field.wikipedia.mathematical-analysis","target_kind":"node","target_sha256":"455368cec39ff073c640c83c5540241982c233be1b30461122100769e3af4d56"}],"field.wikipedia.noncommutative-harmonic-analysis":[{"id":"assertion.field.wikipedia.noncommutative-harmonic-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Noncommutative harmonic analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Noncommutative harmonic analysis\", CC BY-SA 4.0) states: In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","support":[{"end":281,"quote":"In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","source_id":"wikipedia.article.noncommutative-harmonic-analysis","source_sha256":"635eaf894a4cdca231b6d197f2d852fc2b3ffb3efb7a2e7e63dbe00cdb1b8bf8","start":120}],"target_id":"field.wikipedia.noncommutative-harmonic-analysis","target_kind":"node","target_sha256":"dded5e69acd777b96e5c3f675dfa3a34fccd0d32c3d8ffaa4c49d808620200fb"}],"field.wikipedia.number-theory":[{"id":"assertion.field.wikipedia.number-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Number theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Number theory\", CC BY-SA 4.0) states: Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","support":[{"end":211,"quote":"Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","source_id":"wikipedia.article.number-theory","source_sha256":"65ad76112e37a89c1ace150fed6aca64cc059fee7f6521ed9cfbf46bf2997062","start":98}],"target_id":"field.wikipedia.number-theory","target_kind":"node","target_sha256":"ca324cae36a7301c08812dbbea65582346db509c096d375a3ecf46d146b0f2e7"}],"field.wikipedia.numerical-analysis":[{"id":"assertion.field.wikipedia.numerical-analysis","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Numerical analysis as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Numerical analysis\", CC BY-SA 4.0) states: Numerical analysis is the study of algorithms for the problems of continuous mathematics.","support":[{"end":192,"quote":"Numerical analysis is the study of algorithms for the problems of continuous mathematics.","source_id":"wikipedia.article.numerical-analysis","source_sha256":"7d42a0f7fa1d74e3adfbe43914531b9dcdeee2647ac24482dd612e605b89fa08","start":103}],"target_id":"field.wikipedia.numerical-analysis","target_kind":"node","target_sha256":"0fa19e5dc851806db90903ec0c5d5c9a8d60ae79b44f76c9718157f32cd3742b"}],"field.wikipedia.offshore-geotechnical-engineering":[{"id":"assertion.field.wikipedia.offshore-geotechnical-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Offshore geotechnical engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Offshore geotechnical engineering\", CC BY-SA 4.0) states: Offshore geotechnical engineering is a sub-field of geotechnical engineering.","support":[{"end":198,"quote":"Offshore geotechnical engineering is a sub-field of geotechnical engineering.","source_id":"wikipedia.article.offshore-geotechnical-engineering","source_sha256":"f041d9d1cd9dd0e99ae090e9caf36f6dd69562c7ed2860dfe5b6ed459591b99b","start":121}],"target_id":"field.wikipedia.offshore-geotechnical-engineering","target_kind":"node","target_sha256":"0c683e5e19d12c8d77b16ed33d120a4ce83630bf05cd4ea03f05b469e247157d"}],"field.wikipedia.order-theory":[{"id":"assertion.field.wikipedia.order-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Order theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Order theory\", CC BY-SA 4.0) states: Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","support":[{"end":209,"quote":"Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","source_id":"wikipedia.article.order-theory","source_sha256":"bace12a5b8441aabf2a2da792a676d5a22ab5ea8ed820983e566624f70d923af","start":98}],"target_id":"field.wikipedia.order-theory","target_kind":"node","target_sha256":"ce600837f9b5b272b4fbb821bb3864c57cb03146572de54e3ef53bddee46a397"}],"field.wikipedia.probability-theory":[{"id":"assertion.field.wikipedia.probability-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Probability theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Probability theory\", CC BY-SA 4.0) states: Probability theory or probability calculus is the branch of mathematics concerned with probability.","support":[{"end":202,"quote":"Probability theory or probability calculus is the branch of mathematics concerned with probability.","source_id":"wikipedia.article.probability-theory","source_sha256":"66692308fe33d15a2beddd1c83049d51f3534f3c0d14847cbb698be4127b585d","start":103}],"target_id":"field.wikipedia.probability-theory","target_kind":"node","target_sha256":"7f9836278db82d80797a326975aff3d83291fac607efb00ff62989ec9cf1a722"}],"field.wikipedia.projective-differential-geometry":[{"id":"assertion.field.wikipedia.projective-differential-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Projective differential geometry as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Projective differential geometry\", CC BY-SA 4.0) states: In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","support":[{"end":387,"quote":"In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","source_id":"wikipedia.article.projective-differential-geometry","source_sha256":"fcabab1cc57687cb02fd8f1094bc5a9b7c4a5e432c6da00aa2fda6b4a4bd3f57","start":119}],"target_id":"field.wikipedia.projective-differential-geometry","target_kind":"node","target_sha256":"43760dc2ccb7ce24d8ee0c6ce765b90c59cc5e11682f1c0a4a1d1fdc3353756f"}],"field.wikipedia.representation-theory":[{"id":"assertion.field.wikipedia.representation-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Representation theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Representation theory\", CC BY-SA 4.0) states: Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","support":[{"end":275,"quote":"Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","source_id":"wikipedia.article.representation-theory","source_sha256":"fa70e3022a3e53f87880315893e93717ac45ebbdbea183d2ec938a88f1f921c2","start":109}],"target_id":"field.wikipedia.representation-theory","target_kind":"node","target_sha256":"687fd6e00648220849be86490d28642ce811e2d685261d061aa301882566575a"}],"field.wikipedia.ring-theory":[{"id":"assertion.field.wikipedia.ring-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ring theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ring theory\", CC BY-SA 4.0) states: In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","support":[{"end":287,"quote":"In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","source_id":"wikipedia.article.ring-theory","source_sha256":"87cadb9946f4a494b13c91c29394869ebbbc532a58bab42ac44d8b28a9f0fb71","start":97}],"target_id":"field.wikipedia.ring-theory","target_kind":"node","target_sha256":"c5779f1dd125aafd0cd4fb3d7b69ebd363efc80d5277f89fb86f92e6b5219e03"}],"field.wikipedia.scientometrics":[{"id":"assertion.field.wikipedia.scientometrics","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Scientometrics as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Scientometrics\", CC BY-SA 4.0) states: Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","support":[{"end":274,"quote":"Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","source_id":"wikipedia.article.scientometrics","source_sha256":"5899874c9cb80c2bc46cb2191ae53ab00554edb0101089134b0aac14aeffecfd","start":101}],"target_id":"field.wikipedia.scientometrics","target_kind":"node","target_sha256":"e5e04b0c1c457d7fe71a2812dc54e71e2ae96d3c53e449ddb6310aa1b244884d"}],"field.wikipedia.systems-engineering":[{"id":"assertion.field.wikipedia.systems-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Systems engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Systems engineering\", CC BY-SA 4.0) states: Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","support":[{"end":288,"quote":"Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","source_id":"wikipedia.article.systems-engineering","source_sha256":"c9fed2abb569cc20beb89a5e9a1ef0ab2be55b461939570d616eba689dbaf201","start":104}],"target_id":"field.wikipedia.systems-engineering","target_kind":"node","target_sha256":"0a7ce273d661e433d371b38def61b50b424b69935f94844155c4b526258ce387"}],"field.wikipedia.telecommunications-engineering":[{"id":"assertion.field.wikipedia.telecommunications-engineering","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Telecommunications engineering as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Telecommunications engineering\", CC BY-SA 4.0) states: Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","support":[{"end":259,"quote":"Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","source_id":"wikipedia.article.telecommunications-engineering","source_sha256":"17b5de9ce29d29b841bd5bd61de3a8b9d79bd41f669898cd1a975beeac3743a9","start":117}],"target_id":"field.wikipedia.telecommunications-engineering","target_kind":"node","target_sha256":"e230000dfa9db03779fc826b925e70c1d5a5c7a80310ac808467533c62e461f9"}],"field.wikipedia.truthmaker-theory":[{"id":"assertion.field.wikipedia.truthmaker-theory","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Truthmaker theory as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Truthmaker theory\", CC BY-SA 4.0) states: Truthmaker theory is \"the branch of metaphysics that explores the relationships between what is true and what exists\".","support":[{"end":223,"quote":"Truthmaker theory is \\\"the branch of metaphysics that explores the relationships between what is true and what exists\\\".","source_id":"wikipedia.article.truthmaker-theory","source_sha256":"3ea61b142aa3866d536b596e240ad3bbaa2fcdfde1bc857ad47241fa176bca09","start":103}],"target_id":"field.wikipedia.truthmaker-theory","target_kind":"node","target_sha256":"0a09f1d8f9ee5eab33a912d072180159131ba069f0bb6aa50365b2867bdfb058"}],"instrument.admx":[{"id":"assertion.complete.instrument.admx","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Microwave-cavity axion haloscope.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"instrument.admx","target_kind":"node","target_sha256":"9bfc2a103467e26da7ce7ea023bbba01e17a2556df4d75fbd3cae7d625567062"}],"instrument.fermi-lat":[{"id":"assertion.complete.instrument.fermi-lat","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gamma-ray telescope used for LIV constraints.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"instrument.fermi-lat","target_kind":"node","target_sha256":"5451f3e7ab557645f975be27288253e9d1eb3c0bec57672667abca9406e93974"}],"instrument.lux-zeplin":[{"id":"assertion.complete.instrument.lux-zeplin","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Two-phase xenon TPC used for direct dark-matter searches.","support":[{"end":4822,"quote":"We report results of a search for nuclear recoils induced by weakly interacting massive particle (WIMP) dark matter using the LUX-ZEPLIN (LZ) two-phase xenon time projection chamber. This analysis uses a total exposure of $4.2\\pm0.1$ tonne-years from 280 live days of LZ operation, of which $3.3\\pm0.1$ tonne-years and 220 live days are new. A technique to actively tag background electronic recoils from $^{214}$Pb $\\beta$ decays is featured for the first time. Enhanced electron-ion recombination is observed in two-neutrino double electron capture decays of $^{124}$Xe, representing a noteworthy new background. After removal of artificial signal-like events injected into the data set to mitigate analyzer bias, we find no evidence for an excess over expected backgrounds. World-leading constraints are placed on spin-independent (SI) and spin-dependent WIMP-nucleon cross sections for masses $\\geq$9 GeV/$c^2$. The strongest SI exclusion set is $2.2\\times10^{-48}$ cm$^{2}$ at the 90% confidence level and the best SI median sensitivity achieved is $5.1\\times10^{-48}$ cm$^{2}$, both for a mass of 40 GeV/$c^2$.","source_id":"completion-source.1af1fa72bebe284da6bd","source_sha256":"7c4029200d8f192120bb03557a8a9661ba2b9f8110e3589538dc7629590b8e00","start":3706}],"target_id":"instrument.lux-zeplin","target_kind":"node","target_sha256":"ad6ee2c1c37d897c1cd5e98cd5ba4b101caa80081926968cd095ac8e6a0ab822"}],"method.axion-haloscope":[{"id":"assertion.complete.method.axion-haloscope","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX search uses an axion haloscope consisting of a microwave cavity in a strong magnetic field to test axion dark matter.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"method.axion-haloscope","target_kind":"node","target_sha256":"ebb1533ce4d2f82988d956e75c407452e94ca0e191e68b16c711034bb6fdf28d"}],"method.bmv-entanglement-witness":[{"id":"assertion.complete.method.bmv-entanglement-witness","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spin-correlation test using mesoscopic masses.","support":[{"end":1780,"quote":"Understanding gravity in the framework of quantum mechanics is one of the great challenges in modern physics. Along this line, a prime question is to find whether gravity is a quantum entity subject to the rules of quantum mechanics. It is fair to say that there are no feasible ideas yet to test the quantum coherent behaviour of gravity directly in a laboratory experiment. Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass. Fundamentally, the above entanglement is shown to certify the presence of non-zero off-diagonal terms in the coherent state basis of the gravitational field modes.","source_id":"completion-source.f3e47999b24212e86885","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":615},{"end":1105,"quote":"We provide brief answers to a number of recurring questions about the BMV effect and the related experimental proposal (Bose et al., 2017; Marletto and Vedral, 2017). Some of these questions include alleged counter-examples to our result, stating that if gravity (or anything mediating the interaction) can create entanglement while complying with locality, then it must then be non-classical. Here we explain why these objections are not counter-examples and why our result still stands; we also explore a few other important subtleties often disregarded on a first read of our paper (Marletto and Vedral, 2017).","source_id":"completion-source.b0684b58644cb3ab135c","source_sha256":"8f9b9ee23bbaa60ef23eb04b9f1c91a1df138a89248fece1782281c1364e4953","start":492}],"target_id":"method.bmv-entanglement-witness","target_kind":"node","target_sha256":"f1432b44430531805e0b2e273c3833a5f8f9d93dcf4b42b48de10f19de816e80"}],"method.cluster-offset-constraint":[{"id":"assertion.complete.method.cluster-offset-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited finite-range-force analysis constrains dark-matter models using conditional predictions of altered cluster collision velocity or separation between dark matter and galaxies after collision, along with the stated observational assumptions.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653}],"target_id":"method.cluster-offset-constraint","target_kind":"node","target_sha256":"1b94a5d18450db6c1587e3dd38e29a4606bd10ec7951ff0adde7d9fe742a433b"}],"method.crdm-direct-search":[{"id":"assertion.complete.method.crdm-direct-search","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Search for boosted sub-GeV dark matter in xenon data.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"method.crdm-direct-search","target_kind":"node","target_sha256":"6652c2d4ca5a5c3e43d34c653a53d7a0cd9d3b71e5cf01a092423b6a4a172510"}],"method.functional-rg-gravity":[{"id":"assertion.complete.method.functional-rg-gravity","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Scale-dependent effective-action flow.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477}],"target_id":"method.functional-rg-gravity","target_kind":"node","target_sha256":"9536c066a9b062befcbd0a5c93bcc9531fca568320032e4f2aa5f2a44b0d43c6"}],"method.gamma-ray-burst-dispersion-test":[{"id":"assertion.complete.method.gamma-ray-burst-dispersion-test","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Gamma-ray timing constrains vacuum dispersion.","support":[{"end":2168,"quote":"We analyze the MeV/GeV emission from four bright Gamma-Ray Bursts (GRBs) observed by the Fermi-Large Area Telescope to produce robust, stringent constraints on a dependence of the speed of light in vacuo on the photon energy (vacuum dispersion), a form of Lorentz invariance violation (LIV) allowed by some Quantum Gravity (QG) theories. First, we use three different and complementary techniques to constrain the total degree of dispersion observed in the data. Additionally, using a maximally conservative set of assumptions on possible source-intrinsic spectral-evolution effects, we constrain any vacuum dispersion solely attributed to LIV. We then derive limits on the \"QG energy scale\" (the energy scale that LIV-inducing QG effects become important, E_QG) and the coefficients of the Standard Model Extension. For the subluminal case (where high energy photons propagate more slowly than lower energy photons) and without taking into account any source-intrinsic dispersion, our most stringent limits (at 95% CL) are obtained from GRB090510 and are E_{QG,1}>7.6 times the Planck energy (E_Pl) and E_{QG,2}>1.3 x 10^11 GeV for linear and quadratic leading order LIV-induced vacuum dispersion, respectively. These limits improve the latest constraints by Fermi and H.E.S.S. by a factor of ~2. Our results disfavor any class of models requiring E_{QG,1} \\lesssim E_Pl.","source_id":"completion-source.da8bd9eda3be0640024e","source_sha256":"9022428cd3d10a0174c4a0c9984680aa15399ad1c3380bb51f160180e4b2dfc4","start":796}],"target_id":"method.gamma-ray-burst-dispersion-test","target_kind":"node","target_sha256":"d4a73be619a9e4589a39a08869a596882bcbafcc23f0180858aacdfc182f07c9"}],"method.lyman-alpha-forest-constraint":[{"id":"assertion.complete.method.lyman-alpha-forest-constraint","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Uses quasar absorption power spectra to constrain fuzzy dark matter.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"method.lyman-alpha-forest-constraint","target_kind":"node","target_sha256":"48b35f227147c028537a5e51efb8d460078ed114ec4619924c5bb57a281aed12"}],"method.mass-superposition-probe":[{"id":"assertion.complete.method.mass-superposition-probe","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Spatial superpositions probe gravity-mediated quantum effects.","support":[{"end":2379,"quote":"All existing quantum gravity proposals share the same deep problem. Their predictions are extremely hard to test in practice. Quantum effects in the gravitational field are exceptionally small, unlike those in the electromagnetic field. The fundamental reason is that the gravitational coupling constant is about 43 orders of magnitude smaller than the fine structure constant, which governs light-matter interactions. For example, the detection of gravitons -- the hypothetical quanta of energy of the gravitational field predicted by certain quantum-gravity proposals -- is deemed to be practically impossible. In this letter we adopt a radically different, quantum-information-theoretic approach which circumvents the problem that quantum gravity is hard to test. We propose an experiment to witness quantum-like features in the gravitational field, by probing it with two masses each in a superposition of two locations. First, we prove the fact that any system (e.g. a field) capable of mediating entanglement between two quantum systems must itself be quantum. This argument is general and does not rely on any specific dynamics. Then, we propose an experiment to detect the entanglement generated between two masses via gravitational interaction. By our argument, the degree of entanglement between the masses is an indirect witness of the quantisation of the field mediating the interaction. Remarkably, this experiment does not require any quantum control over gravity itself. It is also closer to realisation than other proposals, such as detecting gravitons or detecting quantum gravitational vacuum fluctuations.","source_id":"completion-source.038511de4307cd41caf7","source_sha256":"af759d02a217adb88429e4a20ec2b4394ec53d8ce4eee9488447a8f8a35d0321","start":755}],"target_id":"method.mass-superposition-probe","target_kind":"node","target_sha256":"ff0748031c48bcb1d96cdf4c4770971d08feb88e5f5750b3656e64073d993b1c"}],"method.microlensing-dark-matter":[{"id":"assertion.complete.method.microlensing-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Uses transient lensing magnification to test compact dark matter.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"method.microlensing-dark-matter","target_kind":"node","target_sha256":"d39794dd0e875a1d6fe8da70b3ae419773fc703019d10ab276c62ab968c46923"}],"method.nist.ackermann":[{"id":"assertion.method.nist.ackermann","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ackermann's function as: A function of two parameters whose value grows very fast. Formal Definition: A(0, j)=j+1 for j ≥ 0 A(i, 0)=A(i-1, 1) for i > 0 A(i, j)=A(i-1, A(i, j-1)) for i, j > 0","support":[{"end":236,"quote":"A function of two parameters whose value grows very fast.\nFormal Definition:\nA(0, j)=j+1\t\t\tfor j ≥ 0\nA(i, 0)=A(i-1, 1)\t\t\tfor i > 0\nA(i, j)=A(i-1, A(i, j-1))\t\tfor i, j > 0","source_id":"nist-dads.ackermann","source_sha256":"498e1a49c607f9415f6b17af40a06e785f67b0b572d1a31e285bb7c4ae6dac88","start":66}],"target_id":"method.nist.ackermann","target_kind":"node","target_sha256":"7ddce0781d5639b0ff26f2334b441d3a2fae1975f3ef53f4af0cfd65a6bbe512"}],"method.nist.adaptiveheapsort":[{"id":"assertion.method.nist.adaptiveheapsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive heap sort as: A variant of heapsort that uses a randomized binary search tree (RBST) to structure the input according to any preexisting order. The RBST is used to select candidates that are put into the heap so the heap doesn't need to keep track of all elements.","support":[{"end":314,"quote":"A variant of\nheapsort\nthat uses a\nrandomized binary search tree\n(RBST) to structure the input according to any preexisting order.  The RBST is used to select candidates that are put into the\nheap\nso the heap doesn't need to  keep track of all elements.","source_id":"nist-dads.adaptiveheapsort","source_sha256":"c94aaf893bca380d8acbb7ae44ff46f49c287df82a2c5f568c9ae72969ad4494","start":62}],"target_id":"method.nist.adaptiveheapsort","target_kind":"node","target_sha256":"3cb595fdcfef664cfc1245a8acc3a3a2cee1e40671abff621723c78ffaf3e28f"}],"method.nist.adaptivehuffman":[{"id":"assertion.method.nist.adaptivehuffman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines adaptive Huffman coding as: A near-minimal variable-length character coding that changes based on the frequency of characters processed. As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified). Also known as dynamic Huffman coding.","support":[{"end":329,"quote":"A near-minimal variable-length character coding that changes based on the frequency of characters processed.  As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified).\nAlso known as\ndynamic Huffman coding.","source_id":"nist-dads.adaptivehuffman","source_sha256":"0337b06b51d476a0c945669d54ba2dc794adb27a64ee756df43a2c4c63438406","start":72}],"target_id":"method.nist.adaptivehuffman","target_kind":"node","target_sha256":"3bea9474f9bffafba24118f41179a7d4f315cba8a2bffa007ec4c61f1034297c"}],"method.nist.addresscalc":[{"id":"assertion.method.nist.addresscalc","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines address-calculation sort as: A sort algorithm which uses knowledge of the domain of the items to calculate the position of each item in the sorted array .","support":[{"end":199,"quote":"A\nsort\nalgorithm which uses knowledge of the\ndomain\nof the items to calculate the position of each item in the sorted\narray\n.","source_id":"nist-dads.addresscalc","source_sha256":"57813157e6cb36ec5b20dffe340839c5fbba228a7769742f76c3bb50c7f0094c","start":74}],"target_id":"method.nist.addresscalc","target_kind":"node","target_sha256":"e251251221a31a0ac1d0cb48408bf8e50a52ae27f78f4c8ea6f23eaf807b59cc"}],"method.nist.ahocorasick":[{"id":"assertion.method.nist.ahocorasick","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Aho-Corasick as: A multiple string matching algorithm that constructs a finite state machine from a pattern (list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","support":[{"end":243,"quote":"A multiple\nstring matching\nalgorithm that constructs a\nfinite state machine\nfrom a\npattern\n(list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","source_id":"nist-dads.ahocorasick","source_sha256":"b521aaa511658871ec7e9e154de6903b9c6564adff07372b72996413613d9885","start":50}],"target_id":"method.nist.ahocorasick","target_kind":"node","target_sha256":"d70e1a20f7c108aa576055b35d30352d8880a6f7a8cc278a5e0f9ab4696d61d0"}],"method.nist.algorithmfgk":[{"id":"assertion.method.nist.algorithmfgk","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines algorithm FGK as: An adaptive Huffman coding scheme. Coding is never much worse than twice optimal .","support":[{"end":135,"quote":"An\nadaptive Huffman coding\nscheme.  Coding is never much worse than twice\noptimal\n.","source_id":"nist-dads.algorithmfgk","source_sha256":"8d3f479b445c0cfcbc74e406521332f1256570cd21d8a1c4cfc2da89cfdc760e","start":52}],"target_id":"method.nist.algorithmfgk","target_kind":"node","target_sha256":"9f35d34afca072c456a6046e0cca77ed77a8565670dffd178520d1a8f6ad1592"}],"method.nist.americanflagsort":[{"id":"assertion.method.nist.americanflagsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines American flag sort as: An efficient, in-place variant of radix sort that distributes items into hundreds of buckets . The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array. The last step cyclically permutes items to their proper bucket. Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the Dutch national flag problem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as quicksort for large sets of strings.","support":[{"end":656,"quote":"An efficient,\nin-place\nvariant of\nradix sort\nthat distributes items into hundreds of\nbuckets\n.   The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array.  The last step cyclically\npermutes\nitems to their proper bucket.  Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the\nDutch national flag\nproblem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as\nquicksort\nfor large sets of strings.","source_id":"nist-dads.americanflagsort","source_sha256":"0155cdce01e5dc56cb1a71b9cf5c99299a55ea760b69a95e98eecfcfb68d03d5","start":62}],"target_id":"method.nist.americanflagsort","target_kind":"node","target_sha256":"a4c772513aa62dbb5ae8ee7852882c04e8048af4de432835aeb52713d587fc5d"}],"method.nist.approximatin":[{"id":"assertion.method.nist.approximatin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines approximation algorithm as: An algorithm to solve an optimization problem that runs in polynomial time in the length of the input and outputs a solution that is guaranteed to be close to the optimal solution . \"Close\" has some well-defined sense called the performance guarantee .","support":[{"end":337,"quote":"An\nalgorithm\nto solve an\noptimization problem\nthat runs in\npolynomial time\nin the length of the input and outputs a solution that is guaranteed to be close to the\noptimal solution\n.  \"Close\" has some well-defined sense called the\nperformance guarantee\n.","source_id":"nist-dads.approximatin","source_sha256":"c6525b948214baf474ad2088ed4ab30121ecf8c2290c8e451f377045c3feed5e","start":84}],"target_id":"method.nist.approximatin","target_kind":"node","target_sha256":"8855b1793228fd9585602b1068d9d9e94d4f24520630f7e49cacc8a018f62a24"}],"method.nist.arithmeticcoding":[{"id":"assertion.method.nist.arithmeticcoding","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines arithmetic coding as: A minimal variable-length message coding based on the frequency of each character. The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","support":[{"end":303,"quote":"A minimal variable-length message coding based on the frequency of each character.  The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","source_id":"nist-dads.arithmeticcoding","source_sha256":"ac2e2ff17f362916fbb50261f2f63522864ed8b0fbc6b5f27798cac2fd17ac6f","start":60}],"target_id":"method.nist.arithmeticcoding","target_kind":"node","target_sha256":"270c5b544ce53effa787084956d7305f41c9d9e974c9e82eed6e5c4958d65635"}],"method.nist.arraymerg":[{"id":"assertion.method.nist.arraymerg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines array merging as: Joining two arrays into one.","support":[{"end":80,"quote":"Joining two arrays into one.","source_id":"nist-dads.arraymerg","source_sha256":"01767415264c1ca05126047d7f299a73d00cf778c9d895ed0c844d289e3252c9","start":52}],"target_id":"method.nist.arraymerg","target_kind":"node","target_sha256":"8ddc1971f0256c611deb640594949878172286f4d27b6902f3d809ebd8c9ee46"}],"method.nist.backtrack":[{"id":"assertion.method.nist.backtrack","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines backtracking as: Find a solution by trying one of several choices. If the choice proves incorrect, computation backtracks or restarts at the point of choice and tries another choice. It is often convenient to maintain choice points and alternate choices using recursion .","support":[{"end":318,"quote":"Find a solution by trying one of several choices.  If the choice proves incorrect, computation\nbacktracks\nor restarts at the point of choice and tries another choice.  It is often convenient to maintain choice points and alternate choices using\nrecursion\n.","source_id":"nist-dads.backtrack","source_sha256":"5034ab49bbfb913385905358512212e9bf1a3bda923bdf2fd19467797eb7894e","start":62}],"target_id":"method.nist.backtrack","target_kind":"node","target_sha256":"444984b4fb61d6728516942dc3255015c2e8cbc237980bef2a8b8d56825b4749"}],"method.nist.balanc2wayms":[{"id":"assertion.method.nist.balanc2wayms","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced two-way merge sort as: A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","support":[{"end":452,"quote":"A\nbalanced k-way merge sort\nthat sorts a data stream using repeated merges.  It distributes the input into two streams by repeatedly reading a\nblock\nof input that fits in memory, a\nrun\n, sorting it, then writing it to the next stream.  It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","source_id":"nist-dads.balanc2wayms","source_sha256":"fb382909518d57a7e314da736eb227cbda494dcd65258a5e5d6546cad4cbe078","start":80}],"target_id":"method.nist.balanc2wayms","target_kind":"node","target_sha256":"5a85ee4d6dca5793257dc8cc7e8d88594b6891d149f7a322c9a74ca618c6b2fc"}],"method.nist.balancedqsrt":[{"id":"assertion.method.nist.balancedqsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced quicksort as: A variant of quicksort which attempts to choose a pivot likely to represent the middle of the values to be sorted.","support":[{"end":176,"quote":"A variant of\nquicksort\nwhich attempts to choose a pivot likely to represent the middle of the values to be sorted.","source_id":"nist-dads.balancedqsrt","source_sha256":"73530677357b2d803438ad18a5e482e64e187170f5075dfeb84bd022323caab9","start":62}],"target_id":"method.nist.balancedqsrt","target_kind":"node","target_sha256":"9872dc5f2002bd1a0ec4e7a50d042fff6ddc0fc713f8aa4e1c2c48053dbd2e6f"}],"method.nist.balanckwayms":[{"id":"assertion.method.nist.balanckwayms","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","support":[{"end":434,"quote":"A\nmerge sort\nthat sorts a data stream using repeated merges.  It distributes the input into k streams by repeatedly reading a\nblock\nof input that fits in memory, called a\nrun\n, sorting it, then writing it to the next stream.  It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","source_id":"nist-dads.balanckwayms","source_sha256":"c5212c2be449872276b869a7954e7c7c6421484ac8acd821f25686765ef60af9","start":76}],"target_id":"method.nist.balanckwayms","target_kind":"node","target_sha256":"ff413db436dbc31da04e6073af474f22598c02e4767e8124d1593d81e1a86f40"}],"method.nist.balancmrgsrt":[{"id":"assertion.method.nist.balancmrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines balanced merge sort as: A k-way merge sort in which the number of input and output data streams is the same. See balanced k-way merge sort .","support":[{"end":182,"quote":"A\nk-way merge sort\nin which the number of input and  output data streams is the same.  See\nbalanced k-way merge sort\n.","source_id":"nist-dads.balancmrgsrt","source_sha256":"4d93081da1aad38381060dc8573ac8e90376152d948c4b126f75ca24cefbac7c","start":64}],"target_id":"method.nist.balancmrgsrt","target_kind":"node","target_sha256":"8901fabd115e3b503f1466b6aab415af2fe7d00b95c8ad4fb2109b18c560ab7d"}],"method.nist.baumwelch":[{"id":"assertion.method.nist.baumwelch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Baum Welch algorithm as: An algorithm to find hidden Markov model parameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","support":[{"end":224,"quote":"An algorithm to find\nhidden Markov model\nparameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","source_id":"nist-dads.baumwelch","source_sha256":"7b0043e2475dd61d1b22b1331c2d8a8053b821db7ad984da3ec579e75f693a8c","start":66}],"target_id":"method.nist.baumwelch","target_kind":"node","target_sha256":"f70076346fc3abdcdf22fe5f401f1ef468b0f16442030eabaebd32b26a1a4abb"}],"method.nist.bbp":[{"id":"assertion.method.nist.bbp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines BBP algorithm as: Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","support":[{"end":147,"quote":"Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","source_id":"nist-dads.bbp","source_sha256":"c166e1d6be7e125bc3b269f46cf7ca31cf116da7724dc1ee80d7cc688030ef97","start":52}],"target_id":"method.nist.bbp","target_kind":"node","target_sha256":"834e2c512bcddbd768ce82d2165b99316ef15a715746e0625fe82f6d5ed491ed"}],"method.nist.bellmanford":[{"id":"assertion.method.nist.bellmanford","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Bellman-Ford algorithm as: An efficient algorithm to solve the single-source shortest-path problem . Weights may be negative. The algorithm initializes the distance to the source vertex to 0 and all other vertices to ∞. It then does V-1 passes (V is the number of vertices) over all edges relaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight cycles , in which case it returns false. The time complexity is O(VE) , where E is the number of edges. Also known as Ford-Bellman.","support":[{"end":596,"quote":"An efficient algorithm to solve the\nsingle-source shortest-path problem\n. Weights may be negative.   The algorithm initializes the distance to the\nsource\nvertex to 0 and all other vertices to ∞.  It then does V-1 passes (V is the number of vertices) over all\nedges\nrelaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight\ncycles\n, in which case it returns false.  The time complexity is\nO(VE)\n, where E is the number of edges.\nAlso known as\nFord-Bellman.","source_id":"nist-dads.bellmanford","source_sha256":"f5b8c250350fef1af20c1c7a647c31fea8e55e197b289e0cfc951067103127b8","start":70}],"target_id":"method.nist.bellmanford","target_kind":"node","target_sha256":"3cb1de6171d4f8c38b006f95c8af804f06eeeb17210ac26a0fef7c1f83ee79b3"}],"method.nist.bestfirst":[{"id":"assertion.method.nist.bestfirst","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines best-first search as: A state-space search algorithm that considers the estimated best partial solution next. This is typically implemented with a priority queue .","support":[{"end":202,"quote":"A state-space search algorithm that considers the estimated best partial solution next.  This is typically implemented with a\npriority queue\n.","source_id":"nist-dads.bestfirst","source_sha256":"f07957db8213fa246132c8c19559de964e598d56494cc5a3484fc7c4fff0c377","start":60}],"target_id":"method.nist.bestfirst","target_kind":"node","target_sha256":"afcd30564e8e29a9aa264830a1eb47449bf5e03c71f61bc8ce3f0ba3b5044c5b"}],"method.nist.bidirectionalbubblesort":[{"id":"assertion.method.nist.bidirectionalbubblesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bidirectional bubble sort as: A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps. Also known as cocktail shaker sort, shaker sort, double-direction bubble sort.","support":[{"end":410,"quote":"A variant of\nbubble sort\nthat compares each adjacent pair of items in a\nlist\nin turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps.\nAlso known as\ncocktail shaker sort, shaker sort, double-direction bubble sort.","source_id":"nist-dads.bidirectionalbubblesort","source_sha256":"bf1666329c338f15fac37979dbf2a9e3325e5629a46402bee83a0166439c7413","start":76}],"target_id":"method.nist.bidirectionalbubblesort","target_kind":"node","target_sha256":"5ce8e1b3a06d55579793dc87323cfa7e172194938ec79ed0fe2f9de97374dcb0"}],"method.nist.binaryinsort":[{"id":"assertion.method.nist.binaryinsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines binary insertion sort as: Insertion sort in which the proper location for the next item is found with a binary search .","support":[{"end":161,"quote":"Insertion sort\nin which the proper location for the next item is found with a\nbinary search\n.","source_id":"nist-dads.binaryinsort","source_sha256":"1f48745d5aafced4843c7e37f577880ba1d0d79e5b9675e99823125f68bc79ad","start":68}],"target_id":"method.nist.binaryinsort","target_kind":"node","target_sha256":"f837d6f56ebe2ed25737e020b9213068d688ffa61b1dd34a2a675412e1f13d1f"}],"method.nist.binarysearch":[{"id":"assertion.method.nist.binarysearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines binary search as: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.","support":[{"end":407,"quote":"Search a\nsorted array\nby repeatedly dividing the search interval in half.  Begin with an interval covering the whole array. If the value of the search\nkey\nis less than the item in the middle of the interval, narrow the interval to the lower half.  Otherwise narrow it to the upper half.  Repeatedly check until the value is found or the interval is empty.","source_id":"nist-dads.binarysearch","source_sha256":"68aa31889be5cd50665f583de20e5f87b7b15216d0e38b35ca75c70289d58572","start":52}],"target_id":"method.nist.binarysearch","target_kind":"node","target_sha256":"33d4f59bf845e0ff05b2879f7fb21a64917541b413b2c8c41516c109ec973fdb"}],"method.nist.bingosort":[{"id":"assertion.method.nist.bingosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bingo sort as: A variant of selection sort that orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass. This is more efficient than selection sort if there are many duplicate values.","support":[{"end":322,"quote":"A variant of\nselection sort\nthat orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass.  This is more efficient than selection sort if there are many duplicate values.","source_id":"nist-dads.bingosort","source_sha256":"109f1f858e8b25c4620db9cc61b8438c160ede455affb85cd14a857b67209a1a","start":46}],"target_id":"method.nist.bingosort","target_kind":"node","target_sha256":"81720bd0b32c5426d7f0c8be4eaca839068579d19a27f2b2c4d137152a87b3ad"}],"method.nist.bitonicsort":[{"id":"assertion.method.nist.bitonicsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bitonic sort as: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort.","support":[{"end":172,"quote":"Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged.\nAlso known as\nBatcher sort.","source_id":"nist-dads.bitonicsort","source_sha256":"8ee8c8f8c8b5e6b412b363124b8e6e4848060d1f4342f83ec15775ac8ec6943d","start":50}],"target_id":"method.nist.bitonicsort","target_kind":"node","target_sha256":"bd09ab17af42d7a9b00f783010fa370ae71cf18cd4a08539121686a3da795628"}],"method.nist.blindsort":[{"id":"assertion.method.nist.blindsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines blind sort as: A specialized sort algorithm that first builds a blind trie , then traverse the tree left to right.","support":[{"end":145,"quote":"A specialized\nsort\nalgorithm that first builds a\nblind trie\n, then traverse the tree left to right.","source_id":"nist-dads.blindsort","source_sha256":"607c5cf624646d7e3ec3c37b64b063102630c53ac8f8b8fb6df82a712ea4b294","start":46}],"target_id":"method.nist.blindsort","target_kind":"node","target_sha256":"cdbcf2621e2ca998b89d1ea14b11dde0100faf32779ff51486f892a837430f90"}],"method.nist.bogosort":[{"id":"assertion.method.nist.bogosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bogosort as: A terribly inefficient sort algorithm that repeatedly generates a random permutation of the items until the items are in order.","support":[{"end":169,"quote":"A terribly inefficient\nsort\nalgorithm that repeatedly generates a random\npermutation\nof the items until the items are in order.","source_id":"nist-dads.bogosort","source_sha256":"af8637fb0b6e9a90c10ca2fc9a5abae9c538f5429a7620e0931aa527a9dfaa03","start":42}],"target_id":"method.nist.bogosort","target_kind":"node","target_sha256":"2cfdfe8c7fe5911d9f64827255046dc8f6fb046f288ce7d53e240194f1dadd4f"}],"method.nist.bondseqsearch":[{"id":"assertion.method.nist.bondseqsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bond Sequential Search as: Search an array or list for two keys at once by using the bitwise or of the keys as the search key. When a possible match is found, compare each key against the item.","support":[{"end":237,"quote":"Search an\narray\nor\nlist\nfor two\nkeys\nat once by using the bitwise\nor\nof the keys as the search key.  When a possible match is found, compare each key against the item.","source_id":"nist-dads.bondseqsearch","source_sha256":"fa949d2c8fff88e0c151433496955902cb3956482c165cca2ef31a574f753254","start":70}],"target_id":"method.nist.bondseqsearch","target_kind":"node","target_sha256":"ead2091d036bd04e0436ee26b522728c2ae5db9a8bd712511498b86807aa9148"}],"method.nist.boruvkasalgorithm":[{"id":"assertion.method.nist.boruvkasalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Boruvka's algorithm as: Compute a minimum spanning tree .","support":[{"end":97,"quote":"Compute a\nminimum spanning tree\n.","source_id":"nist-dads.boruvkasalgorithm","source_sha256":"25c92ed6531755fe4de27776910c41387ec86d9a5071629d36057c33a9ba8165","start":64}],"target_id":"method.nist.boruvkasalgorithm","target_kind":"node","target_sha256":"e47d32c87eeaf46f6988c02143204c3ec0d783bc828ffdd395b7bd1c1ac8a0a4"}],"method.nist.boyermoore":[{"id":"assertion.method.nist.boyermoore","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Boyer-Moore as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the Knuth-Morris-Pratt algorithm and the next matching position in the pattern .","support":[{"end":343,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the\npattern\nto its beginning.  When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the\nKnuth-Morris-Pratt algorithm\nand the next matching position in the\npattern\n.","source_id":"nist-dads.boyermoore","source_sha256":"e19956dc3d71bdf474ef374a70d8c4f1005b0cfecd562750deac813672a88b0c","start":48}],"target_id":"method.nist.boyermoore","target_kind":"node","target_sha256":"46eada8823b8b0921e16cd21c6150ff292232703c044babbf58d43e13be2968b"}],"method.nist.boyermoorehorspool":[{"id":"assertion.method.nist.boyermoorehorspool","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Boyer-Moore-Horspool as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next matching position in the pattern. Also known as Horspool.","support":[{"end":280,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the\npattern\nto its beginning.  When characters don't match, searching jumps to the next matching position in the pattern.\nAlso known as\nHorspool.","source_id":"nist-dads.boyermoorehorspool","source_sha256":"cbdfc6665e1427284866a166c52ec7b885958582e8c956c1a9d2366b1106bc6b","start":66}],"target_id":"method.nist.boyermoorehorspool","target_kind":"node","target_sha256":"dbdb1cf5ea37c062cfe48976eb31c1319c84bd99e8b08b4e2fe559685d678714"}],"method.nist.bozosort":[{"id":"assertion.method.nist.bozosort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines bozo sort as: A terribly inefficient sort algorithm that randomly swaps items until they are in order.","support":[{"end":132,"quote":"A terribly inefficient\nsort\nalgorithm that randomly swaps items until they are in order.","source_id":"nist-dads.bozosort","source_sha256":"e87f037ca9f60d7ace6d165bfc6546b75ad73dca994f75ee3bc1b11532e46347","start":44}],"target_id":"method.nist.bozosort","target_kind":"node","target_sha256":"b62e738ce5fd2e81ded7919a1d0a01e3c0c7a95db1d116ff929e557f37c55c3d"}],"method.nist.branchnbound":[{"id":"assertion.method.nist.branchnbound","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines branch and bound as: An algorithmic technique to find the optimal solution by keeping the best solution found so far. If a partial solution cannot improve on the best, it is abandoned.","support":[{"end":234,"quote":"An algorithmic technique to find the optimal solution by keeping the best solution found so far.  If a partial solution cannot improve on the best, it is abandoned.","source_id":"nist-dads.branchnbound","source_sha256":"9bfe6473a02dc163b315dddc9a463a234c65e394d078138766ce3d3ce0fc8a62","start":70}],"target_id":"method.nist.branchnbound","target_kind":"node","target_sha256":"5dabd87c9ae1c6cc47405698f735445b7d9ef67900299d548dbe6f7beae52e36"}],"method.nist.breadthfirst":[{"id":"assertion.method.nist.breadthfirst","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines breadth-first search as: Any search algorithm that considers neighbors of a vertex , that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue .","support":[{"end":308,"quote":"Any search algorithm that considers neighbors of a\nvertex\n, that is, outgoing\nedges\nof the vertex's predecessor in the search, before any outgoing edges of the vertex.  Extremes are searched last.  This is typically implemented with a\nqueue\n.","source_id":"nist-dads.breadthfirst","source_sha256":"ce8bb0255160e02d3de2a9883def59bcdff82db18419f6a37014d63ee2881213","start":66}],"target_id":"method.nist.breadthfirst","target_kind":"node","target_sha256":"773605ff26593cf1b41aa5cffa4b51ecacbf189a0459270a0d4ddd1b92c30de8"}],"method.nist.bresenham":[{"id":"assertion.method.nist.bresenham","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Bresenham's algorithm as: An efficient algorithm to render a line with pixels. The long dimension is incremented for each pixel, and the fractional slope is accumulated.","support":[{"end":212,"quote":"An efficient algorithm to render a line with pixels.  The long dimension is incremented for each pixel, and the fractional slope is accumulated.","source_id":"nist-dads.bresenham","source_sha256":"6fd5bc9218673dc1667d8b8f4fdac3b3e12b6b1448aad41f19537fa8e92d43bb","start":68}],"target_id":"method.nist.bresenham","target_kind":"node","target_sha256":"e041cb3cc3dafac0566c4d9e62bcc6e597d971d09d85feb016a53dfa7e728dd9"}],"method.nist.britishmuseum":[{"id":"assertion.method.nist.britishmuseum","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines British Museum technique as: Find a solution by checking all possibilities one by one, beginning with the smallest. This is a conceptual, not a practical, technique where the number of possibilities are enormous.","support":[{"end":270,"quote":"Find a solution by checking all possibilities one by one, beginning with the smallest.  This is a conceptual, not a practical, technique where the number of possibilities are enormous.","source_id":"nist-dads.britishmuseum","source_sha256":"59e9e77942707d622ae83aa66557b5c9ed49d22fff7de3759578a03c040fd247","start":86}],"target_id":"method.nist.britishmuseum","target_kind":"node","target_sha256":"083f44f18936a24be5e8ace13f65272c9c363a143047f86e1d7ae2cb76fd8c60"}],"method.nist.bruteforce":[{"id":"assertion.method.nist.bruteforce","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force as: An algorithm that inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","support":[{"end":174,"quote":"An\nalgorithm\nthat inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","source_id":"nist-dads.bruteforce","source_sha256":"b44ecdae2a9185db68d3a64479946814c45fdee22cd09846f8fe02533b69b171","start":60}],"target_id":"method.nist.bruteforce","target_kind":"node","target_sha256":"116317e6c72c1eae18be86b3c523056f4bb6c3f0d6d93beffd303ad9c85ba7ad"}],"method.nist.bruteforcestringsearch":[{"id":"assertion.method.nist.bruteforcestringsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force string search as: Find a string in another string or body of text by trying each position one at a time. There are many far faster string matching algorithms. Also known as naive string search.","support":[{"end":252,"quote":"Find a\nstring\nin another string or body of text by trying each position one at a time.  There are many far faster\nstring matching\nalgorithms.\nAlso known as\nnaive string search.","source_id":"nist-dads.bruteforcestringsearch","source_sha256":"eff3ffda4931b56f1ecaa33f0e7689ffc8f15b740fc71de67958daf0a846d755","start":76}],"target_id":"method.nist.bruteforcestringsearch","target_kind":"node","target_sha256":"2992aae44b8d9ff3d898f244b92aec8d03bdebc5fc0051875f052e540fcb7a69"}],"method.nist.bruteforcestrsrchwmismatch":[{"id":"assertion.method.nist.bruteforcestrsrchwmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines brute force string search with mismatches as: Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the pattern and the substring beginning at that position don't match (the Hamming distance ). Return the first position with k or fewer mismatches.","support":[{"end":381,"quote":"Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the\npattern\nand the substring beginning at that position don't match (the\nHamming distance\n).  Return the first position with k or fewer mismatches.","source_id":"nist-dads.bruteforcestrsrchwmismatch","source_sha256":"aa5950d5956a374a5aefc7599759bd2f50730a86f5baa1215b4d5f8d2f025c76","start":108}],"target_id":"method.nist.bruteforcestrsrchwmismatch","target_kind":"node","target_sha256":"604e12c00757e29b59c6ffd3644cd4cb2d2475d140d5d7e8ba82ebd822c771f2"}],"method.nist.bubblesort":[{"id":"assertion.method.nist.bubblesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bubble sort as: Sort by comparing each adjacent pair of items in a list in turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done. Also known as sinking sort, exchange sort.","support":[{"end":253,"quote":"Sort by comparing each adjacent pair of items in a\nlist\nin turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done.\nAlso known as\nsinking sort, exchange sort.","source_id":"nist-dads.bubblesort","source_sha256":"e5b5afb0bf3731c6ff10c0a01d478eef9dd4b7ad68faabd3b749ee8d508af782","start":48}],"target_id":"method.nist.bubblesort","target_kind":"node","target_sha256":"35b5c006fb5df908d5f1bc442b514e4400fb8ba1904f8ebe1175e5f39d8ecdae"}],"method.nist.bucketsort":[{"id":"assertion.method.nist.bucketsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines bucket sort as: A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key . Each bucket is sorted if necessary, and the buckets' contents are concatenated. Also known as bin sort.","support":[{"end":287,"quote":"A\ndistribution sort\nwhere input elements are initially  distributed to several\nbuckets\nbased on an interpolation of the element's\nkey\n. Each bucket is sorted if necessary, and the buckets' contents are concatenated.\nAlso known as\nbin sort.","source_id":"nist-dads.bucketsort","source_sha256":"f910086f6a3aef25d3b9f604975650cff905bf64b8d3c600598def8bc226d7f3","start":48}],"target_id":"method.nist.bucketsort","target_kind":"node","target_sha256":"da6bfc3c0fad4772c81bd1b8b91026da4d49e0cd52521e0562cb9db5f35ad020"}],"method.nist.buddysystem":[{"id":"assertion.method.nist.buddysystem","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines buddy system as: A memory allocation strategy which recursively divides allocatable blocks of memory into pairs of adjacent equal-sized blocks called \"buddies\".","support":[{"end":193,"quote":"A memory allocation strategy which recursively divides allocatable\nblocks\nof memory into pairs of adjacent equal-sized blocks called \"buddies\".","source_id":"nist-dads.buddysystem","source_sha256":"63122ce9efd9bff983b5c7cea559da442df9d4f5b1553356c7a6549b12b081fd","start":50}],"target_id":"method.nist.buddysystem","target_kind":"node","target_sha256":"4b62c68c30377b413185dd62e5bd27e1e839943f12dd17d5bd5a493eb2ad9287"}],"method.nist.buildheap":[{"id":"assertion.method.nist.buildheap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines build-heap as: Convert an array into a heap by executing heapify progressively closer to the root . For an array of n nodes, this takes O(n) time under the comparison model.","support":[{"end":205,"quote":"Convert an\narray\ninto a\nheap\nby executing\nheapify\nprogressively closer to the\nroot\n.  For an array of n nodes, this takes\nO(n)\ntime under the comparison model.","source_id":"nist-dads.buildheap","source_sha256":"d35d7367ab0d1761832cb6542392b4c0a4c95871c7d88fd27d1d3976f5c6db37","start":46}],"target_id":"method.nist.buildheap","target_kind":"node","target_sha256":"3c57331f2a0da196db3a952d78f98d72037777a6b6bb04510be4cdd8e714b5f0"}],"method.nist.burrowswheelertransform":[{"id":"assertion.method.nist.burrowswheelertransform","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Burrows-Wheeler transform as: Permute a string . Repeated substrings lead to repeated characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string. Also known as BWT.","support":[{"end":334,"quote":"Permute\na\nstring\n. Repeated\nsubstrings\nlead to repeated  characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string.\nAlso known as\nBWT.","source_id":"nist-dads.burrowswheelertransform","source_sha256":"ef77742cd477739d2a97f2bd31e18b2096f32eee01bfed6426ebd32ddaf9d037","start":76}],"target_id":"method.nist.burrowswheelertransform","target_kind":"node","target_sha256":"a197ec0fc277917f5604f7c93c36c849126077a82e2377ce4bd9f5a2ce620fa1"}],"method.nist.caverphone":[{"id":"assertion.method.nist.caverphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Caverphone as: An algorithm to code English names phonetically.","support":[{"end":94,"quote":"An algorithm to code English names phonetically.","source_id":"nist-dads.caverphone","source_sha256":"b22f2910bd48fdd11ca56582c3d48bbebf169720e058be463f17c971f72933aa","start":46}],"target_id":"method.nist.caverphone","target_kind":"node","target_sha256":"c073e5fdefa190c45a4cda4438bf71ae04fff25784b00e6cf125b9a6d6c516ce"}],"method.nist.chinesermndr":[{"id":"assertion.method.nist.chinesermndr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Chinese remainder theorem as: An integer n can be solved uniquely mod LCM(A(i)) , given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","support":[{"end":405,"quote":"An integer n can be solved uniquely mod\nLCM(A(i))\n, given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","source_id":"nist-dads.chinesermndr","source_sha256":"a5d2aff31e24d38ff54046658375ebf9c78f8d305edae63623ac9fcbdb4c0efc","start":76}],"target_id":"method.nist.chinesermndr","target_kind":"node","target_sha256":"5c962a00ef9e1f9cf1bb2a4ac9541863c558cfb66a67050e6c05f27424ad6767"}],"method.nist.christofides":[{"id":"assertion.method.nist.christofides","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Christofides algorithm as: (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Step 1: find a minimum spanning tree T. Step 2: find a perfect matching M among vertices with odd degree . Step 3: combine the edges of M and T to make a multigraph G. Step 4: find an Euler cycle in G. Step 5: Turn the Euler cycle into a Hamiltonian cycle by skipping vertices already seen. (2) An algorithm to find the chromatic number of a graph.","support":[{"end":516,"quote":"(1) A\nheuristic\nalgorithm\nto find a near-optimal solution to the\ntraveling salesman\nproblem.  Step 1: find a\nminimum spanning tree\nT.  Step 2: find a\nperfect matching\nM among\nvertices\nwith odd\ndegree\n.  Step 3: combine the\nedges\nof M and T to make a\nmultigraph\nG.  Step 4: find an\nEuler cycle\nin G. Step 5: Turn the Euler cycle into a\nHamiltonian cycle\nby skipping vertices already seen.  (2) An algorithm to find the\nchromatic number\nof a graph.","source_id":"nist-dads.christofides","source_sha256":"ecf5ed84afd2fd3e12d6ef7876af308715463e49a62169f49e643c8af95a30b2","start":70}],"target_id":"method.nist.christofides","target_kind":"node","target_sha256":"3fd59a2a8bf1d1b6c784e63b1e6a498b8d738e246d0c483b2d952a049bf6978a"}],"method.nist.collectiverecursion":[{"id":"assertion.method.nist.collectiverecursion","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collective recursion as: A special form of tail recursion , where the results are produced during the recursive calls and nothing is returned. The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","support":[{"end":413,"quote":"A special form of\ntail recursion\n, where the results are produced during the recursive calls and nothing is returned.  The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","source_id":"nist-dads.collectiverecursion","source_sha256":"2c80087304eba3ba26c5bbe849b17e899f4fa8f4ae78aba4318341de17bc6fb8","start":78}],"target_id":"method.nist.collectiverecursion","target_kind":"node","target_sha256":"1e51ccc50f85862b98c4f063331a17cc47eb95bfb8357ec1fecc834cafef1804"}],"method.nist.collisionres":[{"id":"assertion.method.nist.collisionres","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines collision resolution scheme as: A way of handling collisions , that is, when two or more items should be kept in the same location, especially in a hash table . The general ways are keeping subsequent items within the table and computing possible locations ( open addressing ), keeping lists for items that collide ( chaining ), or keeping one special overflow area.","support":[{"end":414,"quote":"A way of handling\ncollisions\n, that is, when two or more items should be kept in the same location, especially in a\nhash table\n. The general ways are keeping subsequent items within the table and computing possible locations (\nopen addressing\n), keeping\nlists\nfor items that collide (\nchaining\n), or keeping one special overflow area.","source_id":"nist-dads.collisionres","source_sha256":"2da275a63b8dcc87a94371fd6009120b18cc16bf4501a8cfcfcc0bce2c2bd406","start":80}],"target_id":"method.nist.collisionres","target_kind":"node","target_sha256":"06b370e03c9f3a15f4e5b072827401de2727e1f486111c061b1240b9a96563d9"}],"method.nist.combination":[{"id":"assertion.method.nist.combination","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines combination as: Choose m of n elements, where m ≤ n.","support":[{"end":84,"quote":"Choose m of n elements, where m ≤ n.","source_id":"nist-dads.combination","source_sha256":"e9fb06cb9235614d52875dd640d003e7948f63534c15a668c5bf76f07ee5b14c","start":48}],"target_id":"method.nist.combination","target_kind":"node","target_sha256":"91d377ea34ac03fadd8181607b0838b4dc88208df163219cf4671cef7cc27fa5"}],"method.nist.combsort":[{"id":"assertion.method.nist.combsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines comb sort as: An in-place sort algorithm that repeatedly reorders different pairs of items. On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3). The gap starts at about 3/4 of the number of items. Continue until the gap is 1 and a pass had no swaps.","support":[{"end":353,"quote":"An\nin-place sort\nalgorithm that repeatedly reorders different pairs of items.  On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3).  The gap starts at about 3/4 of the number of items.  Continue until the gap is 1 and a pass had no swaps.","source_id":"nist-dads.combsort","source_sha256":"aa71a9b7d4e5267551b5ded093872158e37f2b6b588ee93f9dfd71d033aa512b","start":44}],"target_id":"method.nist.combsort","target_kind":"node","target_sha256":"8f775d480b5b91987112339341cedbac7e7bb0ffebe8baee8e9feb7002fd0a2c"}],"method.nist.commentzwalter":[{"id":"assertion.method.nist.commentzwalter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Commentz-Walter as: A multiple string matching algorithm that compares from the end of the pattern , like Boyer-Moore , using a finite state machine , like Aho-Corasick .","support":[{"end":206,"quote":"A multiple\nstring matching\nalgorithm that compares from the end of the\npattern\n, like\nBoyer-Moore\n, using a\nfinite state machine\n, like\nAho-Corasick\n.","source_id":"nist-dads.commentzwalter","source_sha256":"3e491e4e43dc46819b457b8b791bd22b6b20e99613ae81683adfe477e75c6202","start":56}],"target_id":"method.nist.commentzwalter","target_kind":"node","target_sha256":"7a3329395ee5bd1df124ec480e71551be85550c4768410ad5236ca1467f4e206"}],"method.nist.cordic":[{"id":"assertion.method.nist.cordic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines CORDIC as: Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","support":[{"end":199,"quote":"Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","source_id":"nist-dads.cordic","source_sha256":"a3e5b40038389bd9f1bed2ab9478f406d0b5802f011026f7fb14be7e2ec92aa0","start":38}],"target_id":"method.nist.cordic","target_kind":"node","target_sha256":"e637b27dda85398d4f3fdbc592b29f61b7d55929bdb0053af5a9d252873ffa13"}],"method.nist.countingsort":[{"id":"assertion.method.nist.countingsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines counting sort as: A 2-pass sort algorithm that is efficient when the number of distinct keys is small compared to the number of items. The first pass counts the occurrences of each key in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding keys. The second pass puts each item in its final place according to the auxiliary entry for that key.","support":[{"end":429,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the number of distinct\nkeys\nis small compared to the number of items.  The first pass counts the occurrences of each key in an auxiliary\narray\n, and then makes a running total so each auxiliary entry is the number of preceding keys.  The second pass puts each item in its final place according to the auxiliary entry for that key.","source_id":"nist-dads.countingsort","source_sha256":"2dd515e2de79d069b3f21249ef0ad68d729686008544106ad8613cedfe5452b9","start":52}],"target_id":"method.nist.countingsort","target_kind":"node","target_sha256":"d4db387c8f645073694fd09e1b0fef5e84cce2f3881821c2cd332fb7c5a7b66b"}],"method.nist.cyclicredundancycheck":[{"id":"assertion.method.nist.cyclicredundancycheck","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines cyclic redundancy check as: (1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of polynomials over the integers, modulo 2. (3) The characteristic bits of a block. Also known as CRC.","support":[{"end":364,"quote":"(1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of\npolynomials\nover the integers, modulo 2. (3) The characteristic bits of a block.\nAlso known as\nCRC.","source_id":"nist-dads.cyclicredundancycheck","source_sha256":"11713b402daaccbf9b437784135124eee852e05322bf096062c94eb1f41fbecb","start":72}],"target_id":"method.nist.cyclicredundancycheck","target_kind":"node","target_sha256":"f642a517705b12e0d9cc33b72b2df196f9c02f7e577ffac43818d3e0b9f32cbb"}],"method.nist.dagshortpath":[{"id":"assertion.method.nist.dagshortpath","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines DAG shortest paths as: Solve the single-source shortest-path problem in a weighted directed acyclic graph by 1) doing a topological sort on the vertices by edge so vertices with no incoming edges are first and vertices with only incoming edges are last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","support":[{"end":556,"quote":"Solve the\nsingle-source shortest-path problem\nin a\nweighted\ndirected acyclic graph\nby 1) doing a\ntopological sort\non the\nvertices\nby\nedge\nso vertices with no incoming\nedges\nare first and vertices with only incoming\nedges\nare last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","source_id":"nist-dads.dagshortpath","source_sha256":"3532b3cb67b505d527199a77a0030576ad4c412b6f20ede897e623f25ab48041","start":62}],"target_id":"method.nist.dagshortpath","target_kind":"node","target_sha256":"0b769ff554ce5056bac23b443145db20e87961d38e867186cae63e08820d7706"}],"method.nist.depthfirst":[{"id":"assertion.method.nist.depthfirst","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines depth-first search as: (1) Any search algorithm that considers outgoing edges ( children ) of a vertex before any of the vertex's siblings , that is, outgoing edges of the vertex's predecessor in the search. Extremes are searched first. This is easily implemented with recursion . (2) An algorithm that marks all vertices in a directed graph in the order they are discovered and finished, partitioning the graph into a forest . Also known as DFS.","support":[{"end":489,"quote":"(1) Any search algorithm that considers outgoing\nedges\n(\nchildren\n) of a\nvertex\nbefore any of the vertex's\nsiblings\n, that is, outgoing  edges of the vertex's predecessor in the search.  Extremes are searched first.  This is easily implemented with\nrecursion\n.  (2) An algorithm that marks all vertices in a\ndirected graph\nin the order they are discovered and finished, partitioning the graph into a\nforest\n.\nAlso known as\nDFS.","source_id":"nist-dads.depthfirst","source_sha256":"1d66559ce426dcbae32bbeec3c58b61535000e4dc46efa8728bfbe8d4e4c283d","start":62}],"target_id":"method.nist.depthfirst","target_kind":"node","target_sha256":"7822907d6e361dfc3ab95bf077208b1cf9f3544d1ba7081e0fc7e52d496403d3"}],"method.nist.derangement":[{"id":"assertion.method.nist.derangement","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines derangement as: A permutation of elements, where no element is in its original position.","support":[{"end":120,"quote":"A\npermutation\nof elements, where no element is in its original position.","source_id":"nist-dads.derangement","source_sha256":"734e1e1f2c80d9fd0b2473336a099252918ebc7a71f3bcd454b9c24e2fbb8d0b","start":48}],"target_id":"method.nist.derangement","target_kind":"node","target_sha256":"9c33e18ee047cba34802a006d5fc0d5c037c200c1fa1fb47f6a5079810d06cac"}],"method.nist.determfinitautsrch":[{"id":"assertion.method.nist.determfinitautsrch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic finite automata string search as: A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.","support":[{"end":314,"quote":"A\nstring matching\nalgorithm which builds a\ndeterministic finite state machine\nto recognize the search string.  The machine is then run at each location in turn.  If the machine accepts, that is a match.","source_id":"nist-dads.determfinitautsrch","source_sha256":"bc126febdbef4b1731e1bfff69fc7fb75f24a50b83e6654f3986ec7566bff0dc","start":112}],"target_id":"method.nist.determfinitautsrch","target_kind":"node","target_sha256":"56f103a0b2e9a45a48ca8a8258a3c2b871e3a2d8abf0fb4d5fbe2c9cb37c28a7"}],"method.nist.deterministicalgorithm":[{"id":"assertion.method.nist.deterministicalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines deterministic algorithm as: An algorithm whose behavior can be completely predicted from the input.","support":[{"end":155,"quote":"An\nalgorithm\nwhose behavior can be completely predicted from the input.","source_id":"nist-dads.deterministicalgorithm","source_sha256":"fe738db4c1e81974f341bbd7eee122ba72e77a49d43869f05fb5d413bf1b3f60","start":84}],"target_id":"method.nist.deterministicalgorithm","target_kind":"node","target_sha256":"6748a3455381d9fdb7238b44081bfc108e6738b2480c9ecb911e7ec0bc6708d6"}],"method.nist.deutschjozsaalgo":[{"id":"assertion.method.nist.deutschjozsaalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Deutsch-Jozsa algorithm as: A quantum algorithm to determine whether a function is constant or balanced, that is, returns 1 for half the domain and 0 for the other half. For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this exclusive or 's the result with the answer qubit. Finally, do Hadamards on the n inputs again, and measure the answer qubit. If it is 0, the function is constant, otherwise the function is balanced.","support":[{"end":594,"quote":"A quantum algorithm to determine whether a function is\nconstant\nor balanced, that is, returns 1 for half the\ndomain\nand 0 for the other half.  For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this\nexclusive or\n's the result with the answer qubit.  Finally, do Hadamards on the n inputs again, and measure the answer qubit.  If it is 0, the function is constant, otherwise the function is balanced.","source_id":"nist-dads.deutschjozsaalgo","source_sha256":"944e4ae3bc5fc04c502c49842e0d62ada81e402171c8d18bbf5d612b01d0026d","start":72}],"target_id":"method.nist.deutschjozsaalgo","target_kind":"node","target_sha256":"3eb9b5a8149f298010035fcc5a103447703f46022d82beb7559049345f8c23de"}],"method.nist.dijkstraalgo":[{"id":"assertion.method.nist.dijkstraalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Dijkstra's algorithm as: An algorithm to find the shortest paths from a single source vertex to all other vertices in a weighted, directed graph . All weights must be nonnegative.","support":[{"end":221,"quote":"An algorithm to find the\nshortest paths\nfrom a single\nsource\nvertex\nto all other vertices in a\nweighted, directed graph\n.  All weights must be nonnegative.","source_id":"nist-dads.dijkstraalgo","source_sha256":"92fbe3f77c70cb66956d14187e0121c7bf784eb5e8c35ec8f578c5d7c5a98aca","start":66}],"target_id":"method.nist.dijkstraalgo","target_kind":"node","target_sha256":"84a68b8eb865831e8a51df8dbdd0bec2adcefcb71a1561263e4844848563384b"}],"method.nist.diminishingincsort":[{"id":"assertion.method.nist.diminishingincsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines diminishing increment sort as: An in-place sort algorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items. Each set is every i th item, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc. On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","support":[{"end":476,"quote":"An\nin-place sort\nalgorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items.  Each set is every i\nth\nitem, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc.  On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","source_id":"nist-dads.diminishingincsort","source_sha256":"a4ca64787e2e33292b2bb98a3c186857f0226fafdb02ec0388d433fc511412f2","start":78}],"target_id":"method.nist.diminishingincsort","target_kind":"node","target_sha256":"9eac35e88982d38ed41739d2098a596f6c0bd7e94b8832bb88b77c927c7cfe35"}],"method.nist.distributionsort":[{"id":"assertion.method.nist.distributionsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distribution sort as: Any sort algorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","support":[{"end":208,"quote":"Any\nsort\nalgorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","source_id":"nist-dads.distributionsort","source_sha256":"3894d81800ce34e2e99cc4a9d85c283af11c36795efb19fb4b0ef343bfa78a90","start":60}],"target_id":"method.nist.distributionsort","target_kind":"node","target_sha256":"a7a4f845bdea7393aa6402a340d75c40dee640b95b2dc79c85e6d93dc67e5133"}],"method.nist.distributivepartitioningsort":[{"id":"assertion.method.nist.distributivepartitioningsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines distributive partitioning sort as: Step 1: find the median key . Step 2: distribute the n items into n/2 buckets linearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum. Step 3: compact the buckets, removing empty buckets. Recursively start again at step 1 for any bucket with multiple items. Linked lists are used to avoid moving items until a final phase and to avoid bucket overflows.","support":[{"end":525,"quote":"Step 1: find the\nmedian\nkey\n. Step 2: distribute the n items into n/2\nbuckets\nlinearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum.   Step 3: compact the buckets, removing empty buckets.  Recursively start again at step 1 for any bucket with multiple items.\nLinked lists\nare used to avoid moving items until a final phase and to avoid bucket overflows.","source_id":"nist-dads.distributivepartitioningsort","source_sha256":"0e9e86422870e42a2081cd2487dc0e9e771c6e7acba20c14594bf9c961f0677e","start":86}],"target_id":"method.nist.distributivepartitioningsort","target_kind":"node","target_sha256":"5ed9c826ef727df0bd4620ba762c9b82239c6b331b92cf07fe41e8020a1f1cd1"}],"method.nist.divideandconquer":[{"id":"assertion.method.nist.divideandconquer","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines divide and conquer as: Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by dividing it into two or more smaller instances. Each of these smaller instances is recursively solved, and the solutions are combined to produce a solution for the original instance.","support":[{"end":377,"quote":"Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by\ndividing\nit into two or more smaller instances.  Each of these smaller instances is\nrecursively\nsolved, and the solutions are combined to produce a solution for the original instance.","source_id":"nist-dads.divideandconquer","source_sha256":"47b7a0164cf957b005b5dffb99a81ba6d4759967a38c0fea80b29cf36e0ebf4e","start":74}],"target_id":"method.nist.divideandconquer","target_kind":"node","target_sha256":"a9fb74d1cd33217ba01fb4d9927642de47515c033cf889a64513d70c3946942f"}],"method.nist.dividemarrig":[{"id":"assertion.method.nist.dividemarrig","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines divide and marriage before conquest as: A variant of divide and conquer in which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","support":[{"end":227,"quote":"A variant of\ndivide and conquer\nin which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","source_id":"nist-dads.dividemarrig","source_sha256":"6bc4fa57b4d362dda25c194311441052abc6621e5fdc4f66a928cda1b770db47","start":108}],"target_id":"method.nist.dividemarrig","target_kind":"node","target_sha256":"d401594d2ff539705969a5aac2f4b4e9a980d0a77ae0e3abc7d996f923335534"}],"method.nist.doomsday":[{"id":"assertion.method.nist.doomsday","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Doomsday rule as: An algorithm to find the day of the week for any date. It is simple enough to memorize and do mentally.","support":[{"end":156,"quote":"An algorithm to find the day of the week for any date.  It is simple enough to memorize and do mentally.","source_id":"nist-dads.doomsday","source_sha256":"a5a379a2e63fe46d9e42b7494a24d6f5178d09135e06097f20bba8c9b76787c1","start":52}],"target_id":"method.nist.doomsday","target_kind":"node","target_sha256":"3c99c29956260d38471c46570ffb5968a5bba119f48fa6ccd054f82b11680bfe"}],"method.nist.doublehashng":[{"id":"assertion.method.nist.doublehashng","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines double hashing as: A method of open addressing for a hash table in which a collision is resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing clustering . Also known as rehashing.","support":[{"end":276,"quote":"A method of\nopen addressing\nfor a\nhash table\nin which a\ncollision\nis resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing\nclustering\n.\nAlso known as\nrehashing.","source_id":"nist-dads.doublehashng","source_sha256":"a64b45a6ba996c9140c402f410fdddb3966671470f7e2a790b830e1cd56b179d","start":54}],"target_id":"method.nist.doublehashng","target_kind":"node","target_sha256":"741d1585568217b3ab307b4cf19ee8ac6b9360d3a3515759fb9a9aad1fda9b01"}],"method.nist.doublemetaphone":[{"id":"assertion.method.nist.doublemetaphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines double metaphone as: An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds. It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","support":[{"end":359,"quote":"An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds.   It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","source_id":"nist-dads.doublemetaphone","source_sha256":"fe4801d57ce59db3b947f496651e38e69c9c6ff62c02bba4425b6b3a977752f2","start":58}],"target_id":"method.nist.doublemetaphone","target_kind":"node","target_sha256":"3dca6bd089e31e1029be17b67c3982ae80f5dcc9a3eaf898b0b89a8d2fd843c2"}],"method.nist.dualpivotquicksort":[{"id":"assertion.method.nist.dualpivotquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dual-pivot quicksort as: Pick two elements from the array to be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","support":[{"end":319,"quote":"Pick two elements from the\narray\nto be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","source_id":"nist-dads.dualpivotquicksort","source_sha256":"0fbf27ccc3ac0504363198f2e09b53348569d81c56edec4196b5fe0b92bc5d35","start":66}],"target_id":"method.nist.dualpivotquicksort","target_kind":"node","target_sha256":"715e3234064ecb64bbc55539078335f28b98d00b018abbd0aee361477e1e5240"}],"method.nist.dynamicprog":[{"id":"assertion.method.nist.dynamicprog","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines dynamic programming as: Solve an optimization problem by caching subproblem solutions ( memoization ) rather than recomputing them.","support":[{"end":183,"quote":"Solve an\noptimization problem\nby caching subproblem solutions (\nmemoization\n) rather than recomputing them.","source_id":"nist-dads.dynamicprog","source_sha256":"3b04a362b511d3237ec862fdb693950bd750f4c65868d1ac88cbc093ee4e9f79","start":76}],"target_id":"method.nist.dynamicprog","target_kind":"node","target_sha256":"55c99e59cd24fdd56592d4c04cf4a3bf6ef4beffff2aeb890938005ee9db971b"}],"method.nist.dynamization":[{"id":"assertion.method.nist.dynamization","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines dynamization transformation as: A data structuring technique that can make a static data structure dynamic . In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","support":[{"end":266,"quote":"A data structuring technique that can make a\nstatic\ndata structure\ndynamic\n.  In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","source_id":"nist-dads.dynamization","source_sha256":"bc99568c3f762a79860cb6de4386a0b2bb0135fa5580e609955e6edd8f94ef70","start":92}],"target_id":"method.nist.dynamization","target_kind":"node","target_sha256":"783c68cf3c565ed4e5a452ed49999b647ae44295be9adc33aedd29028c7bd87f"}],"method.nist.easysplithardmerge":[{"id":"assertion.method.nist.easysplithardmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines easy split, hard merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","support":[{"end":269,"quote":"A\nrecursive\nalgorithm, especially a\nsort\nalgorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","source_id":"nist-dads.easysplithardmerge","source_sha256":"1d67055000ee567e6d2a50d489f3ba81c04cccfb41bf32b0d4bf953a09d2e0b5","start":82}],"target_id":"method.nist.easysplithardmerge","target_kind":"node","target_sha256":"33a31602aaaa2cabdb07280a99743fa0f15df41cc0b9de3d16c9789146939258"}],"method.nist.euclidalgo":[{"id":"assertion.method.nist.euclidalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Euclid's algorithm as: An algorithm to compute the greatest common divisor of two positive integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);} . The run time complexity is O((log a)(log b)) bit operations. Also known as Euclidean algorithm.","support":[{"end":314,"quote":"An algorithm to compute the\ngreatest common divisor\nof two positive integers.  It is\nEuclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);}\n.  The run time complexity is\nO((log a)(log b))\nbit operations.\nAlso known as\nEuclidean algorithm.","source_id":"nist-dads.euclidalgo","source_sha256":"03c113c74cb3ad356cf7e8e9645fcdec8e41efa1ec5e4fa5f0c7a713c4265bab","start":62}],"target_id":"method.nist.euclidalgo","target_kind":"node","target_sha256":"843ee59b7f7be413ec2c4f9663406c6320e0fd9aec44f2c6b302d48bcbfb64da"}],"method.nist.exhaustivesearch":[{"id":"assertion.method.nist.exhaustivesearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines exhaustive search as: An algorithm that finds a solution by trying every possibility.","support":[{"end":135,"quote":"An\nalgorithm\nthat finds a solution by trying every possibility.","source_id":"nist-dads.exhaustivesearch","source_sha256":"32e81d530691ab058602010165e499a140e10b0a4f7df777f73650cc8fb33bdd","start":72}],"target_id":"method.nist.exhaustivesearch","target_kind":"node","target_sha256":"fe334a9f425e4f40493d19578bde72b4fc56ad9ce3895421a02eef3b37ebdc0d"}],"method.nist.extendeuclid":[{"id":"assertion.method.nist.extendeuclid","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines extended Euclid's algorithm as: An algorithm to find the greatest common divisor , g , of two positive integers, a and b , and coefficients, h and j , such that g = ha + jb .","support":[{"end":222,"quote":"An algorithm to find the\ngreatest common divisor\n,\ng\n, of two positive integers,\na\nand\nb\n, and coefficients,\nh\nand\nj\n, such that\ng = ha + jb\n.","source_id":"nist-dads.extendeuclid","source_sha256":"4c3c34da6e38f49ff9499ed7c91adeb7643a7b5292fee25e252aa6e75bdc53da","start":80}],"target_id":"method.nist.extendeuclid","target_kind":"node","target_sha256":"4c970fd0b00a554e43da25f0a28979243be9bb0b5380946f41768b14477265ab"}],"method.nist.externalmemoryalgo":[{"id":"assertion.method.nist.externalmemoryalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external memory algorithm as: An algorithm that is efficient when accessing most of the data is very slow, such as, on disk.","support":[{"end":170,"quote":"An\nalgorithm\nthat is efficient when accessing most of the data is very slow, such as, on disk.","source_id":"nist-dads.externalmemoryalgo","source_sha256":"068de27a9bbd80adfad82762073dad6f76990a920a58f8c07f6d250ef3c9a1a6","start":76}],"target_id":"method.nist.externalmemoryalgo","target_kind":"node","target_sha256":"b4f1100e322145cc820ffb30fbe4f89fc553134888e6ee5d0fe9a5d6871111c4"}],"method.nist.externalmerg":[{"id":"assertion.method.nist.externalmerg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external merge as: To combine multiple sorted data streams into a single sorted stream using external storage.","support":[{"end":145,"quote":"To combine multiple sorted data streams into a single sorted stream using external storage.","source_id":"nist-dads.externalmerg","source_sha256":"6a8ba04833c54d9279ebe8d2852f14408ca1813bab6920a09e6c813eb4289d68","start":54}],"target_id":"method.nist.externalmerg","target_kind":"node","target_sha256":"f0b1cbc7f1e09c27a6ba5cf5283f7a655dd23cc584e558e6ec72b3467ee55eba"}],"method.nist.externalquicksort":[{"id":"assertion.method.nist.externalquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines external quicksort as: Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in quicksort ), and sort them. Read the next element from the beginning or end to balance writing. If the next element is less than the least of the buffer, write it to available space at the beginning. If greater than the greatest, write it to the end. Otherwise write the greatest or least of the buffer, and put the next element in the buffer. Keep the maximum lower and minimum upper keys written to avoid resorting middle elements that are in order. When done, write the buffer. Recursively sort the smaller partition, and loop to sort the remaining partition.","support":[{"end":717,"quote":"Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in\nquicksort\n), and sort them.  Read the next element from the beginning or end to balance writing.  If the next element is less than the least of the buffer, write it to available space at the beginning.  If greater than the greatest, write it to the end.  Otherwise write the greatest or least of the buffer, and put the next element in the buffer.  Keep the maximum lower and minimum upper\nkeys\nwritten to avoid resorting middle elements that are in order.   When done, write the buffer.\nRecursively\nsort the smaller partition, and loop to sort the remaining partition.","source_id":"nist-dads.externalquicksort","source_sha256":"323b941fbb390a40279706c21cd865e074122a3a16d398df91cf6f46b92dba39","start":62}],"target_id":"method.nist.externalquicksort","target_kind":"node","target_sha256":"aa14f0b169735da09ff8cc6e55c2c80016b324eda8a053325d770afa4efe9a7a"}],"method.nist.fastfouriertransform":[{"id":"assertion.method.nist.fastfouriertransform","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines fast fourier transform as: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain. Also known as FFT.","support":[{"end":191,"quote":"An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain.\nAlso known as\nFFT.","source_id":"nist-dads.fastfouriertransform","source_sha256":"7409e476ed8b14c5792c775e7f6e6861fdd94f9005f911e8c2471d62b435f261","start":70}],"target_id":"method.nist.fastfouriertransform","target_kind":"node","target_sha256":"5f5288d4e013fb394ad189f585eeb5c2b771c6d7d3b41167c00ce7be11b0a5c7"}],"method.nist.fathoming":[{"id":"assertion.method.nist.fathoming","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fathoming as: Pruning a search tree .","support":[{"end":79,"quote":"Pruning a\nsearch tree\n.","source_id":"nist-dads.fathoming","source_sha256":"4259b33e13dbe052144e118ef5763244781fda553a339ea5fc4ce82bbaec5703","start":56}],"target_id":"method.nist.fathoming","target_kind":"node","target_sha256":"61785987b48ca88a2b8e17bd683ac8b0c8c7384140a19a793b700e569a625b57"}],"method.nist.fibonacciansearch":[{"id":"assertion.method.nist.fibonacciansearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Fibonaccian search as: Search a sorted array by narrowing possible locations to progressively smaller intervals. Begin with two Fibonacci numbers , p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array. The first step checks location p. The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","support":[{"end":424,"quote":"Search a\nsorted array\nby narrowing possible locations to progressively smaller intervals.  Begin with two\nFibonacci numbers\n, p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array.  The first step checks location p.  The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","source_id":"nist-dads.fibonacciansearch","source_sha256":"5b19e28c2e2c873265e47fc224bd6b71b98c50dcd683ce3c27c505d076dce95e","start":62}],"target_id":"method.nist.fibonacciansearch","target_kind":"node","target_sha256":"01d2ff912f6814de32c15873e62326d06341faf5c7cdad9d3e331bf04cb3d485"}],"method.nist.find":[{"id":"assertion.method.nist.find","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Find as: An algorithm to select the k th smallest element of an array and partition the array around it. First, partition around the value of the k th element. If the split is not at element k, move the upper or lower boundary and partition again.","support":[{"end":274,"quote":"An algorithm to select the k\nth\nsmallest element of an array and\npartition\nthe array around it.  First, partition around the value of the k\nth\nelement.  If the split is not at element k, move the upper or lower boundary and partition again.","source_id":"nist-dads.find","source_sha256":"b3e2abf5740a0a0e793904cedae8f4c9fe7631ca779b030e1ba69034cbcf1f47","start":34}],"target_id":"method.nist.find","target_kind":"node","target_sha256":"d606be72d1118042bd158aacaf89b77223f79d33ca54d9afcbcc8b807cb078fc"}],"method.nist.floydwarshall":[{"id":"assertion.method.nist.floydwarshall","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Floyd-Warshall algorithm as: An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles . The time complexity is Θ (V³) .","support":[{"end":342,"quote":"An algorithm to solve the\nall pairs shortest path\nproblem in a\nweighted, directed graph\nby multiplying an\nadjacency-matrix representation\nof the graph multiple times.  The edges may have negative weights, but no negative weight\ncycles\n. The time complexity is\nΘ (V³)\n.","source_id":"nist-dads.floydwarshall","source_sha256":"001b4abb65d4a69980f23d845da2bf9165aced6ee6a66d3e313412bd58d681b2","start":74}],"target_id":"method.nist.floydwarshall","target_kind":"node","target_sha256":"6c53f26dfb8b817d120223f2b05829de5403cfb1eece7cc2d3ad44a9b381b445"}],"method.nist.fordfulkerson":[{"id":"assertion.method.nist.fordfulkerson","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ford-Fulkerson method as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a path from the source to the sink along which the flow can be increased and increase the flow. Repeat until there are no such paths.","support":[{"end":294,"quote":"Given a\nflow function\nand its corresponding residual graph (a\nmaximum-flow problem\n), select a\npath\nfrom the\nsource\nto the\nsink\nalong which the\nflow\ncan be increased and increase the flow. Repeat until there are no such paths.","source_id":"nist-dads.fordfulkerson","source_sha256":"1ef3b2adf59958d4250775d0264b450c7a17e9573a6bcadcdd69340f52fa6ac4","start":68}],"target_id":"method.nist.fordfulkerson","target_kind":"node","target_sha256":"b27555911422c8a9d4c92db7d65b2028c2944e942290cde63b6f8ddb309f9f31"}],"method.nist.frequencycounthueristic":[{"id":"assertion.method.nist.frequencycounthueristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines frequency count heuristic as: A heuristic that keeps the elements of a list ordered by number of times each element is the target of a search .","support":[{"end":189,"quote":"A\nheuristic\nthat keeps the elements of a\nlist\nordered by number of times each element is the target of a\nsearch\n.","source_id":"nist-dads.frequencycounthueristic","source_sha256":"bfbd608de914df28d200ab4a8febdf86dce3aa4bece3fbead07f586820fbc1f1","start":76}],"target_id":"method.nist.frequencycounthueristic","target_kind":"node","target_sha256":"1bc5f297732099a747df01d4249d1302fd5d1edb52becc3fccf7536952bf3f64"}],"method.nist.fullypolynml":[{"id":"assertion.method.nist.fullypolynml","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines fully polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a 1+ε- approximation algorithm bounded by a polynomial in the length of the input and 1/ε.","support":[{"end":256,"quote":"A set of\nalgorithms\n{A\nε\n| ε > 0},  where each A\nε\nis a 1+ε-\napproximation algorithm\nbounded by a\npolynomial\nin the length of the input and 1/ε.","source_id":"nist-dads.fullypolynml","source_sha256":"a508d128c6edee09e41dae1ac00c4a37c02e5bbb8ed3fa75f6c03c3dadaadbfd","start":112}],"target_id":"method.nist.fullypolynml","target_kind":"node","target_sha256":"ebc96ce805913afbc38defdb40a013b5363765f29ec99940fb6e62e422a82a71"}],"method.nist.gnomesort":[{"id":"assertion.method.nist.gnomesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines gnome sort as: Put items in order by comparing the current item with the previous item. If they are in order, move to the next item (or stop if the end is reached). If they are out of order, swap them and move to the previous item. If there is no previous item, move to the next item.","support":[{"end":318,"quote":"Put items in order by comparing the current item with the previous item.  If they are in order, move to the next item (or stop if the end is reached).  If they are out of order, swap them and move to the previous item.  If there is no previous item, move to the next item.","source_id":"nist-dads.gnomesort","source_sha256":"1d373373f74207feb0122b220da59a13464ecf75fbe23f419bb3ac23c4718e5a","start":46}],"target_id":"method.nist.gnomesort","target_kind":"node","target_sha256":"884d447f2f16e3495ac11d17a4d313a4701ca9d2c36d50b266ccfd0c749fdf65"}],"method.nist.greatestcommondivisor":[{"id":"assertion.method.nist.greatestcommondivisor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines greatest common divisor as: (1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same. Also known as GCD, highest common factor.","support":[{"end":253,"quote":"(1) The greatest integer which is a divisor of given positive integers.  For instance, GCD(30, 42) = 6.  (2) An algorithm to find the same.\nAlso known as\nGCD, highest common factor.","source_id":"nist-dads.greatestcommondivisor","source_sha256":"972a6229e64bcc54d4856990084f4a235e774af40ae9b9a1c9c316a881c7c568","start":72}],"target_id":"method.nist.greatestcommondivisor","target_kind":"node","target_sha256":"f366d2584572f6c216a2deffc97a66b08b71a0456a735afa91acc823c537e3af"}],"method.nist.greedyalgo":[{"id":"assertion.method.nist.greedyalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines greedy algorithm as: An algorithm that always takes the best immediate, or local, solution while finding an answer. Greedy algorithms find the overall, or globally, optimal solution for some optimization problems , but may find less-than-optimal solutions for some instances of other problems.","support":[{"end":343,"quote":"An algorithm that always takes the best immediate, or local, solution while finding an answer.  Greedy algorithms find the overall, or globally,\noptimal solution\nfor some\noptimization problems\n, but may find less-than-optimal solutions for some instances of other problems.","source_id":"nist-dads.greedyalgo","source_sha256":"b726b175af45e8bdf4269abedd0918a9437dbbc66b666cb0bc7e30ee738cd6e6","start":70}],"target_id":"method.nist.greedyalgo","target_kind":"node","target_sha256":"1b31eb1f65bd8f79b85f1d4302e990ea4d4d317b27375d3b7575cf4d175b733c"}],"method.nist.greedyheuristic":[{"id":"assertion.method.nist.greedyheuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines greedy heuristic as: Solve an optimization problem by finding locally optimal solutions .","support":[{"end":138,"quote":"Solve an\noptimization problem\nby finding locally\noptimal solutions\n.","source_id":"nist-dads.greedyheuristic","source_sha256":"fd392b601e1051b399ff68c2754f18c0d0e9670f5b79197d5d0d314cd32d0ab4","start":70}],"target_id":"method.nist.greedyheuristic","target_kind":"node","target_sha256":"b034e1551ae50f91b3b4cd5d5f31bfddb81a9b102e6169010ec3d7c60dbd632a"}],"method.nist.hardspliteasymerge":[{"id":"assertion.method.nist.hardspliteasymerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hard split, easy merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","support":[{"end":270,"quote":"A\nrecursive\nalgorithm, especially a\nsort\nalgorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","source_id":"nist-dads.hardspliteasymerge","source_sha256":"4d4c4d78456dae8c95ecb6646d0e381220ba5aabac3670dd1055eeba4a8a69c3","start":82}],"target_id":"method.nist.hardspliteasymerge","target_kind":"node","target_sha256":"2baf98fee5e829b9d832587962831997d1fa9799b244676c7387d911b47320e4"}],"method.nist.hash":[{"id":"assertion.method.nist.hash","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines hash function as: A function that maps keys to integers, usually to get an even distribution on a smaller set of values. Also known as hash.","support":[{"end":174,"quote":"A function that maps\nkeys\nto integers, usually to get an even distribution on a smaller set of values.\nAlso known as\nhash.","source_id":"nist-dads.hash","source_sha256":"a403ee883530b9788f5c3e72b1b1f562aa575c3839661f7f3135792cf781f2ae","start":52}],"target_id":"method.nist.hash","target_kind":"node","target_sha256":"57717db64dd84b812728ea461d1df06371c9cbcbfe54ff44659e7692e82f92d3"}],"method.nist.hashtabdelet":[{"id":"assertion.method.nist.hashtabdelet","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hash table delete as: If the hash table uses chaining , use the chaining data structure delete. If it uses open addressing , mark the item \"deleted\" for future reuse.","support":[{"end":205,"quote":"If the\nhash table\nuses\nchaining\n, use the chaining data structure delete.  If it uses\nopen addressing\n, mark the item \"deleted\" for future reuse.","source_id":"nist-dads.hashtabdelet","source_sha256":"3456c04766169ce18d864fd420f223611c3a34a81f2b171d51573e707d47dbfb","start":60}],"target_id":"method.nist.hashtabdelet","target_kind":"node","target_sha256":"c707165d2286fd56373f6379810ff1c2791d933fb725cdb1aca0a38d4013fd21"}],"method.nist.heapify":[{"id":"assertion.method.nist.heapify","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heapify as: Rearrange a heap to maintain the heap property , that is, the key of the root node is more extreme (greater or less) than or equal to the keys of its children . If the root node's key is not more extreme, swap it with the most extreme child key, then recursively heapify that child's subtree. The child subtrees must be heaps to start.","support":[{"end":377,"quote":"Rearrange a\nheap\nto maintain the\nheap property\n, that is, the\nkey\nof the\nroot\nnode\nis more extreme (greater or less) than or equal to the keys of its\nchildren\n.  If the root node's key is not more extreme, swap it with the most extreme child key, then\nrecursively\nheapify that child's subtree.  The child subtrees must be heaps to start.","source_id":"nist-dads.heapify","source_sha256":"aeaa5dbab3e5b7dba059ddda98111773b74620975a75bbbf702b79a0c17cd705","start":40}],"target_id":"method.nist.heapify","target_kind":"node","target_sha256":"a733254447a1a411f4f8af806393bd5b46fa7adec704953b3e12dd89f1eeffcd"}],"method.nist.heapsort":[{"id":"assertion.method.nist.heapsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines heapsort as: A sort algorithm that builds a heap , then repeatedly extracts the maximum item. Run time is O(n log n) .","support":[{"end":148,"quote":"A\nsort\nalgorithm that builds a\nheap\n, then repeatedly extracts the maximum item.  Run time is\nO(n log n)\n.","source_id":"nist-dads.heapsort","source_sha256":"33495638dc8092b72c4b3a860ccb9b5f115394bb20701cc1994ccdb2721f2039","start":42}],"target_id":"method.nist.heapsort","target_kind":"node","target_sha256":"d97aee44f6af8981ce017ccf0e14a92c31ab655b0b536f1ed29ff345c7dffaa5"}],"method.nist.heuristic":[{"id":"assertion.method.nist.heuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines heuristic as: An algorithm that usually, but not always, works or that gives nearly the right answer.","support":[{"end":143,"quote":"An\nalgorithm\nthat usually, but not always, works or that gives nearly the right answer.","source_id":"nist-dads.heuristic","source_sha256":"c88fa411b177be6b5c6fc148d29238a00502fe94d3bda5b032ec97015ea84a3a","start":56}],"target_id":"method.nist.heuristic","target_kind":"node","target_sha256":"708baca77d2dec983fc8db10a636450d05a8f0eb8ff2bfbda7587f516c88851e"}],"method.nist.histogramsort":[{"id":"assertion.method.nist.histogramsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines histogram sort as: An efficient 3-pass refinement of a bucket sort algorithm. The first pass counts the number of items for each bucket in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding items. The second pass puts each item in its proper bucket according to the auxiliary entry for the key of that item. The last pass sorts each bucket. Also known as interpolation sort.","support":[{"end":465,"quote":"An efficient 3-pass refinement of a\nbucket sort\nalgorithm.   The first pass counts the number of items for each bucket in an auxiliary\narray\n, and then makes a running total so each auxiliary entry is the number of preceding items.  The second pass puts each item in its proper bucket according to the auxiliary entry for the\nkey\nof that item.  The last pass sorts each bucket.\nAlso known as\ninterpolation sort.","source_id":"nist-dads.histogramsort","source_sha256":"f7115927702f8dbd46861329bd480901e91d125b6ede73e5406ee96fdf6a4e50","start":54}],"target_id":"method.nist.histogramsort","target_kind":"node","target_sha256":"e3998329ec45709884d44177de451537e36e4cde23d58f09bd443771efbe72ab"}],"method.nist.hsadelta":[{"id":"assertion.method.nist.hsadelta","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines hsadelta as: An algorithm to produce a sequence of insert and copy commands (an edit script ) which creates a new version file from a reference file. To begin, hash every block of the reference file and store every hash in a hash value array . Build a suffix array and three other data structures for quick access. Beginning at the first location in the version file, hash a block and look for the longest match in the reference file. Upon a match, encode an insert back to the previous match and a copy of the match. If no match, look at the next location. At the end, encode an insert for remaining unmatched characters.","support":[{"end":657,"quote":"An\nalgorithm\nto produce a sequence of insert and copy commands (an\nedit script\n) which creates a new version file from a reference file. To begin,\nhash\nevery block of the reference file and store every hash in a hash value\narray\n.  Build a\nsuffix array\nand three other data  structures for quick access.  Beginning at the first location in the version file, hash a block and look for the longest match in the reference file.  Upon a match, encode an insert back to the previous match and a copy of the match.  If no match, look at the next location.  At the end, encode an insert for remaining unmatched characters.","source_id":"nist-dads.hsadelta","source_sha256":"8d82824fcb907a529eb4850e274a345c1b535ac685dbf2dce3e6a0a8ccd2ab18","start":42}],"target_id":"method.nist.hsadelta","target_kind":"node","target_sha256":"21012502baffd9b8387d74a3b891dc3d10c9b79696f14b0836cfe98c41cbe793"}],"method.nist.huffmancoding":[{"id":"assertion.method.nist.huffmancoding","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Huffman coding as: A minimal variable-length character coding based on the frequency of each character. First, each character becomes a one-node binary tree , with the character as the only node . The character's frequency is the tree's frequency. Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree. One code bit represents each level . Thus more frequent characters are near the root and are coded with few bits, and rare characters are far from the root and are coded with many bits. Also known as static Huffman coding.","support":[{"end":681,"quote":"A minimal variable-length character coding based on the frequency of  each character.  First, each character becomes a one-node\nbinary tree\n, with the character as the only\nnode\n.  The character's frequency is the tree's frequency.  Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree.  One code bit represents each\nlevel\n.  Thus more frequent characters are near the\nroot\nand are coded with few bits, and rare characters are far from the root and are coded with many bits.\nAlso known as\nstatic Huffman coding.","source_id":"nist-dads.huffmancoding","source_sha256":"0a26d58ba6341bcaccde7795a8f98f77c15b4a7665caae84340feea0782ce379","start":54}],"target_id":"method.nist.huffmancoding","target_kind":"node","target_sha256":"973818339ff869e8990bfff448f842caa6ec224548963f3946b11401bc923395"}],"method.nist.idealmerge":[{"id":"assertion.method.nist.idealmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ideal merge as: Merge n sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output. That stream is inserted back into the list of streams according to its new head. Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using linear search to insert a stream into the list, the execution time is Θ(M N) where M is the total number of elements. Keeping the streams in a heap , the execution time is Θ(M log N) .","support":[{"end":681,"quote":"Merge\nn sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output.  That stream is inserted back into the list of streams according to its new head.  Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using\nlinear search\nto insert a stream into the list, the execution time is\nΘ(M N)\nwhere M is the total number of elements. Keeping the streams in a\nheap\n, the execution time is\nΘ(M log N)\n.","source_id":"nist-dads.idealmerge","source_sha256":"35aa61da68f8577b21cd653347968d58c1e85c219280c8587b9da0565e96c73c","start":48}],"target_id":"method.nist.idealmerge","target_kind":"node","target_sha256":"a5e791bf19539109946253ef621015fe6941cf0dfbddad5dc8394b5f225b5cb2"}],"method.nist.idealrandomshuffle":[{"id":"assertion.method.nist.idealrandomshuffle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ideal random shuffle as: A permutation algorithm, or shuffle, that has exactly the same chance of producing any permutation.","support":[{"end":165,"quote":"A\npermutation\nalgorithm, or shuffle, that has exactly the same chance of producing any permutation.","source_id":"nist-dads.idealrandomshuffle","source_sha256":"800278cf6ac2c39425a8b1370281599d5aa2cfda53a7ef23b154f0d63ca18949","start":66}],"target_id":"method.nist.idealrandomshuffle","target_kind":"node","target_sha256":"57c8de870d7bc13488734474941154c4e494cde58a9772d3f54ff82330f14286"}],"method.nist.inordertraversal":[{"id":"assertion.method.nist.inordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines in-order traversal as: Process all nodes of a tree by recursively processing the left subtree, then processing the root , and finally the right subtree. Also known as symmetric traversal.","support":[{"end":226,"quote":"Process all\nnodes\nof a\ntree\nby\nrecursively\nprocessing the left subtree, then processing the\nroot\n, and finally the right subtree.\nAlso known as\nsymmetric traversal.","source_id":"nist-dads.inordertraversal","source_sha256":"ca801223ea3923a02243197c9a0215bfccb83bc0955dab471e305396b949a371","start":62}],"target_id":"method.nist.inordertraversal","target_kind":"node","target_sha256":"ccd9718795cfe2e6bbeacd9aecbf1db861f7eb740f16402ef27a2a7107c02536"}],"method.nist.inplacesort":[{"id":"assertion.method.nist.inplacesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines in-place sort as: A sort algorithm in which the sorted items occupy the same storage as the original ones. These algorithms may use o(n) additional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time. Also known as sort in place.","support":[{"end":316,"quote":"A\nsort\nalgorithm in which the sorted items occupy the same storage as the original ones.  These algorithms may use\no(n)\nadditional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time.\nAlso known as\nsort in place.","source_id":"nist-dads.inplacesort","source_sha256":"88881d85f4b5bc4ed539fc30068f958a2591bfc73337590a5ffc4bee3d2af1de","start":52}],"target_id":"method.nist.inplacesort","target_kind":"node","target_sha256":"3d1790e99bfa772040c832000ec4cd502c958d1b85c576194ad5bf125ebaf6ce"}],"method.nist.insertionsort":[{"id":"assertion.method.nist.insertionsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines insertion sort as: Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted. Run time is O(n 2 ) because of moves. Also known as linear insertion sort.","support":[{"end":276,"quote":"Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted.  Run time is\nO(n\n2\n)\nbecause of moves.\nAlso known as\nlinear insertion sort.","source_id":"nist-dads.insertionsort","source_sha256":"e43a6a25f3af6427d5229b35bf517e2266fea7fd33861ca0d5e9c629bdd007bc","start":54}],"target_id":"method.nist.insertionsort","target_kind":"node","target_sha256":"b42934545120c8e0fcc3edd8478442725ca156534bb387c110e632ff29adb934"}],"method.nist.interpolationsearch":[{"id":"assertion.method.nist.interpolationsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines interpolation search as: Search a sorted array by estimating the next position to check based on a linear interpolation of the search key and the values at the ends of the search interval. Also known as extrapolation search.","support":[{"end":265,"quote":"Search a\nsorted array\nby estimating the next position to check based on a linear interpolation of the search\nkey\nand the values at the ends of the search interval.\nAlso known as\nextrapolation search.","source_id":"nist-dads.interpolationsearch","source_sha256":"8ca00d41b29165bdde46cacf01e22d74e575729715fa80d44c9387506c32205d","start":66}],"target_id":"method.nist.interpolationsearch","target_kind":"node","target_sha256":"524695f29850494fd1f27131340f68a5c055bee9f50466cf1806f6a2405eecc5"}],"method.nist.interpsequen":[{"id":"assertion.method.nist.interpsequen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines interpolation-sequential search as: An approximate location is interpolated from the first and last items of a sorted array , then a linear search finds the actual location.","support":[{"end":225,"quote":"An approximate location is interpolated from the first and last items of a sorted\narray\n, then a\nlinear search\nfinds the actual location.","source_id":"nist-dads.interpsequen","source_sha256":"af1cb5a4ab63594cc84c0812ba96229315cc75f4989d5805ce0b59fde2330dd0","start":88}],"target_id":"method.nist.interpsequen","target_kind":"node","target_sha256":"9dbe1473c2290a738a46a875e011cfb8e3fc3d89dfe8107d67b6cbd7c94c01f0"}],"method.nist.introspectivesort":[{"id":"assertion.method.nist.introspectivesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines introspective sort as: A variant of quicksort which switches to heapsort for pathological inputs, that is, when execution time is becoming quadratic. Also known as introsort.","support":[{"end":213,"quote":"A variant of\nquicksort\nwhich switches to\nheapsort\nfor pathological inputs, that is, when execution time is becoming quadratic.\nAlso known as\nintrosort.","source_id":"nist-dads.introspectivesort","source_sha256":"c466910cd23e820ca14b149d47eabad0585cdf47f54f64fbcdcf85421bf3677a","start":62}],"target_id":"method.nist.introspectivesort","target_kind":"node","target_sha256":"703c78426e02f8921c3d5e6ad5c095b11dade8688e0b50da11b8f26fdc94a0dc"}],"method.nist.iteration":[{"id":"assertion.method.nist.iteration","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines iteration as: Solve a problem by repeatedly working on successive parts of the problem.","support":[{"end":129,"quote":"Solve a problem by repeatedly working on successive parts of the problem.","source_id":"nist-dads.iteration","source_sha256":"276cb63f503c5160710a06fa3d501470d0d8bc4dd688861aa4acc13b98ee9f91","start":56}],"target_id":"method.nist.iteration","target_kind":"node","target_sha256":"54767cbf1fe6dbaa1c156f114319258a486b9e2e3945b603adcb1de96d023579"}],"method.nist.j_sort":[{"id":"assertion.method.nist.j_sort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines J sort as: An in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more.","support":[{"end":151,"quote":"An\nin-place sort\nalgorithm that uses\nstrand sort\nto sort fewer than about 40 items and\nshuffle sort\nto sort more.","source_id":"nist-dads.j_sort","source_sha256":"802e2c48a977bbe9c9a0dcb7aadb562f1b8c09e08a26b3049ea1576ff43564a9","start":38}],"target_id":"method.nist.j_sort","target_kind":"node","target_sha256":"80ca76ad50e8bfd895b96e7479ad88a25b281129091081231a42dc9719699dbd"}],"method.nist.jarowinkler":[{"id":"assertion.method.nist.jarowinkler","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Jaro-Winkler as: A measure of similarity between two strings . The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters. Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","support":[{"end":414,"quote":"A measure of similarity between two\nstrings\n.  The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters.  Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","source_id":"nist-dads.jarowinkler","source_sha256":"3464a670e153342a1dd094ab5050029c73a0d8e62e959d0104c5d4108ca2acc7","start":50}],"target_id":"method.nist.jarowinkler","target_kind":"node","target_sha256":"7fee1a04c37f12fd24ce26fa4e0339240dfc641814275d9b1a6583e27babdc9d"}],"method.nist.johnsonsalgorithm":[{"id":"assertion.method.nist.johnsonsalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Johnson's algorithm as: An algorithm to solve the all pairs shortest path problem in a sparse weighted, directed graph . First, it adds a new node with zero weight edges from it to all other nodes, and runs the Bellman-Ford algorithm to check for negative weight cycles and find h(v), the least weight of a path from the new node to node v. Next it reweights the edges using the nodes' h(v) values. Finally for each node, it runs Dijkstra's algorithm and stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is O(V²log V + VE) .","support":[{"end":649,"quote":"An algorithm to solve the\nall pairs shortest path\nproblem in a\nsparse\nweighted, directed graph\n.  First, it adds a new\nnode\nwith zero weight edges from it to all other nodes, and runs the\nBellman-Ford algorithm\nto check for negative weight\ncycles\nand find h(v), the least weight of a path from the new node to node v.  Next it reweights the edges using the nodes' h(v) values.  Finally for each node, it runs\nDijkstra's algorithm\nand stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is\nO(V²log V + VE)\n.","source_id":"nist-dads.johnsonsalgorithm","source_sha256":"2d7e3330c170b2bb3277c14b1c2291ad27e528b9732565031826526206ed96f8","start":64}],"target_id":"method.nist.johnsonsalgorithm","target_kind":"node","target_sha256":"00003d1551e7fa7d38a92fe25cb5156f16d3e64ab1880e1d38e6b7f029614a77"}],"method.nist.johnsontrotter":[{"id":"assertion.method.nist.johnsontrotter","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Johnson-Trotter as: Generate permutations by swapping one adjacent pair of elements at a time. Also known as Steinhaus-Johnson-Trotter, Trotter-Johnson.","support":[{"end":188,"quote":"Generate\npermutations\nby swapping one adjacent pair of elements at a time.\nAlso known as\nSteinhaus-Johnson-Trotter, Trotter-Johnson.","source_id":"nist-dads.johnsontrotter","source_sha256":"8923680f71cd5e1191185bf57c2d0ecacca9dc8b60a5ba29b81c46046b9c44ec","start":56}],"target_id":"method.nist.johnsontrotter","target_kind":"node","target_sha256":"d82bb40525ca9edbb36bf00e6e2a5edc095d55f764f17317ee8429790e366fbc"}],"method.nist.jsort":[{"id":"assertion.method.nist.jsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines JSort as: An in-place sort that partially orders the array twice with build-heap , once moving lesser items earlier and once in reverse moving greater items later, then uses insertion sort on the nearly-ordered array.","support":[{"end":243,"quote":"An\nin-place sort\nthat partially orders the\narray\ntwice with\nbuild-heap\n, once moving lesser items earlier and once in reverse moving greater items later, then uses\ninsertion sort\non the nearly-ordered array.","source_id":"nist-dads.jsort","source_sha256":"9bd4f9c1b8c15818d2cfc301672bdf72385ef40dd0b856a226a51fcb33fea49a","start":36}],"target_id":"method.nist.jsort","target_kind":"node","target_sha256":"deaee8fc3267174b3a12dd4f07c05c67676f07f37cc72195bb82662510aceb94"}],"method.nist.jumpsearch":[{"id":"assertion.method.nist.jumpsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines jump search as: Search a sorted array by checking every j th item until the right area is found, then doing a linear search . The optimum for n items is when j=√ n. Also known as block search.","support":[{"end":225,"quote":"Search a\nsorted array\nby checking every j\nth\nitem until the right area is found, then doing a\nlinear search\n.  The optimum for n items is when j=√ n.\nAlso known as\nblock search.","source_id":"nist-dads.jumpsearch","source_sha256":"b2fa8d99641d96c32a7d43fbf47c0c1d6520d8007646e74329dee8af35766138","start":48}],"target_id":"method.nist.jumpsearch","target_kind":"node","target_sha256":"2bc1d1c88af0f8cfe5a9d25afb13463d695f2da69d90f8428a8da57182c77c98"}],"method.nist.karnaughmap":[{"id":"assertion.method.nist.karnaughmap","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karnaugh map as: A method for minimizing a boolean expression , usually aided by a rectangular map of the value of the expression for all possible input values. Input values are arranged in a Gray code . Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation. Also known as Veitch diagram, KV diagram.","support":[{"end":389,"quote":"A method for minimizing a\nboolean expression\n, usually aided by a rectangular map of the value of the expression for all possible input values.  Input values are arranged in a\nGray code\n.  Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation.\nAlso known as\nVeitch diagram, KV diagram.","source_id":"nist-dads.karnaughmap","source_sha256":"7ae4011653527f0e33e5fa3449f40e61813882c01f6b9da7794a906de5a8a22f","start":50}],"target_id":"method.nist.karnaughmap","target_kind":"node","target_sha256":"906efd9132df5f65425bf9892d68813c8e287c290bc55884d21de94c2787020d"}],"method.nist.karprabin":[{"id":"assertion.method.nist.karprabin","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Karp-Rabin as: A string matching algorithm that compares string's hash values, rather than the strings themselves. For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position. Also known as Rabin-Karp.","support":[{"end":300,"quote":"A\nstring matching\nalgorithm that compares string's\nhash\nvalues, rather than the strings themselves.  For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position.\nAlso known as\nRabin-Karp.","source_id":"nist-dads.karprabin","source_sha256":"1c57507036c9312e0191e5e963400edc3d295c3a94ffc71580b2db4fd3a9f3cd","start":46}],"target_id":"method.nist.karprabin","target_kind":"node","target_sha256":"6396a2d0775af17429a50c6576713c8377a9a97cf59af3a929f580b5e8f6550d"}],"method.nist.karyhuffman":[{"id":"assertion.method.nist.karyhuffman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-ary Huffman coding as: A minimal variable-length coding based on the frequency of each character. Similar to a Huffman coding , but joins k trees into a k-ary tree at each step, and uses k symbols for each level.","support":[{"end":256,"quote":"A minimal variable-length coding based on the frequency of each character.  Similar to a\nHuffman coding\n, but joins k trees into a\nk-ary tree\nat each step, and uses k symbols for each level.","source_id":"nist-dads.karyhuffman","source_sha256":"bfb9d3a86c0034c0f3d9887f6b3258689cc235a26869fbcded81756fea4b64d6","start":66}],"target_id":"method.nist.karyhuffman","target_kind":"node","target_sha256":"3e3f3fd13bd4a0b9abb1b280ab6a364cb5adfe094917f7f35d1aecaedf5617d5"}],"method.nist.knuthmorrispratt":[{"id":"assertion.method.nist.knuthmorrispratt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Knuth-Morris-Pratt algorithm as: A string matching algorithm that turns the search string into a finite state machine , then runs the machine with the string to be searched as the input string. Execution time is O(m+n) , where m is the length of the search string, and n is the length of the string to be searched. Also known as KMP.","support":[{"end":383,"quote":"A\nstring matching\nalgorithm that turns the search string into a\nfinite state machine\n, then runs the machine with the string to be searched as the input string.  Execution time is\nO(m+n)\n, where m is the length of the search string, and n is the length of the string to be searched.\nAlso known as\nKMP.","source_id":"nist-dads.knuthmorrispratt","source_sha256":"f8c309241f4ef5f851ca36270ad6674345c036e26f506e07b3ad5a7fc6ae2a7c","start":82}],"target_id":"method.nist.knuthmorrispratt","target_kind":"node","target_sha256":"42bc596267820d160cd42f0adcb261c29c2c5348a76ea7e9c2b007cd2bb4d01e"}],"method.nist.kruskalsalgo":[{"id":"assertion.method.nist.kruskalsalgo","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Kruskal's algorithm as: An algorithm for computing a minimum spanning tree . It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest edge in the graph whose vertices are in different partial minimum spanning trees.","support":[{"end":286,"quote":"An algorithm for computing a\nminimum spanning tree\n.  It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest\nedge\nin the\ngraph\nwhose\nvertices\nare in different partial minimum spanning trees.","source_id":"nist-dads.kruskalsalgo","source_sha256":"4b187bcf5043f2c5bd05cf7ddf0b57fc56d61ba0ea95b807194147a16b1e7637","start":64}],"target_id":"method.nist.kruskalsalgo","target_kind":"node","target_sha256":"21749f8b2f15bbdd26db79d7ee64ca2b2503aa3f63b7cda2d04786f684c64474"}],"method.nist.kwaymergesort":[{"id":"assertion.method.nist.kwaymergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It merges runs from the k streams into an output stream. It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output. Also known as p-way merge sort.","support":[{"end":506,"quote":"A\nmerge sort\nthat sorts a data stream using repeated merges.  It distributes the input into k streams by repeatedly reading a\nblock\nof input that fits in memory, called a\nrun\n, sorting it, then writing it to the next stream.  It merges runs from the k streams into an output stream.  It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output.\nAlso known as\np-way merge sort.","source_id":"nist-dads.kwaymergesort","source_sha256":"6d702d9f09dc65a4b05917b1ac0ed76704151762b94a9d586c6e482f94a3fc0c","start":58}],"target_id":"method.nist.kwaymergesort","target_kind":"node","target_sha256":"ec0fd1a38003a18d553c0e98aeed69950b5bd91ae7e4f604b714fe8c378b6261"}],"method.nist.lasvegas":[{"id":"assertion.method.nist.lasvegas","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Las Vegas algorithm as: A randomized algorithm that always produces correct results, with the only variation from one run to another being its running time.","support":[{"end":208,"quote":"A\nrandomized algorithm\nthat always produces correct results, with the only variation from one run to another being its running time.","source_id":"nist-dads.lasvegas","source_sha256":"8318e3f4770c327e628dbec79348330e10ea28d2b5581d0a5c0aa11fea937a9d","start":76}],"target_id":"method.nist.lasvegas","target_kind":"node","target_sha256":"0c7b6644cd8bb85828ac5501a0cf602c4446c9aa050ca857fe09d024afa2a5f4"}],"method.nist.lcfshashing":[{"id":"assertion.method.nist.lcfshashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines LCFS hashing as: In case of collision , move the existing item to another position, dictated by the open addressing scheme used.","support":[{"end":161,"quote":"In case of\ncollision\n, move the existing item to another position, dictated by the\nopen addressing\nscheme used.","source_id":"nist-dads.lcfshashing","source_sha256":"519906461568b64597d7a6a08ac3cbc87a1f4ea24982b003b524a85bc3f2f953","start":50}],"target_id":"method.nist.lcfshashing","target_kind":"node","target_sha256":"882983cd48fbe00806d24db49b6a04134d6c7dac9dd88a91d735487da1d299a6"}],"method.nist.leftrotation":[{"id":"assertion.method.nist.leftrotation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines left rotation as: (1) In a binary search tree , pushing a node N down and to the left to balance the tree. N's right child replaces N, and the right child's left child becomes N's right child. (2) In an array , moving all items to the next lower location. The first item is moved to the last location, which is now vacant. (3) In a list , removing the head and inserting it at the tail . Also known as rotate left.","support":[{"end":450,"quote":"(1) In a\nbinary search tree\n, pushing a\nnode\nN down and to the left to\nbalance\nthe tree.  N's right\nchild\nreplaces N, and the right child's left child becomes N's right child. (2) In an\narray\n, moving all items to the next lower location.  The first item is moved to the last location, which is now vacant. (3) In a\nlist\n, removing the\nhead\nand inserting it at the\ntail\n.\nAlso known as\nrotate left.","source_id":"nist-dads.leftrotation","source_sha256":"346687c6891d606cfec208ae7dd2541bd3b8b680d75058ba7aa8368c2181fb4d","start":52}],"target_id":"method.nist.leftrotation","target_kind":"node","target_sha256":"133daffdd3ba3a82e77dbc5b81b109fa7bfd43f323af06d8db2213aaf7175101"}],"method.nist.lempelzivwelch":[{"id":"assertion.method.nist.lempelzivwelch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Lempel-Ziv-Welch as: A compression algorithm that codes strings of characters with codes of a fixed number of bits. Every new string in the input is added to a table until it is full. The codes of existing strings are output instead of the strings. Also known as LZW compression.","support":[{"end":318,"quote":"A compression algorithm that codes strings of characters with codes of a fixed number of bits.  Every new string in the input is added to a table until it is full.  The codes of existing strings are output instead of the strings.\nAlso known as\nLZW compression.","source_id":"nist-dads.lempelzivwelch","source_sha256":"4049baa4da5dc280fec120bc03ff57ef12c51233e5e0fbff7e69d7421a9acdaa","start":58}],"target_id":"method.nist.lempelzivwelch","target_kind":"node","target_sha256":"96a56ada71780f20b97990458c9357af424881bb6a71043b3f0667f2b26e4820"}],"method.nist.levelordertraversal":[{"id":"assertion.method.nist.levelordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines level-order traversal as: Process all nodes of a tree by depth : first the root , then the children of the root, etc. Equivalent to a breadth-first search from the root.","support":[{"end":212,"quote":"Process all\nnodes\nof a\ntree\nby\ndepth\n: first the\nroot\n, then the\nchildren\nof the root, etc.  Equivalent to a\nbreadth-first search\nfrom the root.","source_id":"nist-dads.levelordertraversal","source_sha256":"93c0ccb4bbd8ee5d7d29e0d0b38b1418892f4bf4df1a8c877c0f786fb29bafda","start":68}],"target_id":"method.nist.levelordertraversal","target_kind":"node","target_sha256":"0dec9eaf3da7d50ddc2f165e21cb1ae33c918d753cf4fa3dafd02ee04b7efdac"}],"method.nist.linearhash":[{"id":"assertion.method.nist.linearhash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines linear hash as: A numeric function that maintains the order of input keys while changing their spacing. Formal Definition: A hash function f for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2). Also known as order-preserving hash.","support":[{"end":271,"quote":"A numeric function that maintains the order of input\nkeys\nwhile changing their spacing.\nFormal Definition:\nA\nhash function\nf for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2).\nAlso known as\norder-preserving hash.","source_id":"nist-dads.linearhash","source_sha256":"02ff354bd099fd7995ce8bb04a201642710838683a304f0f7e0e0ddd78884a6b","start":48}],"target_id":"method.nist.linearhash","target_kind":"node","target_sha256":"8d7c91e4ebef0e57245c13f8cdc20594e070aeb9ce670d2da6eb8f31f55fb723"}],"method.nist.linearsearch":[{"id":"assertion.method.nist.linearsearch","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines linear search as: Search an array or list by checking items one at a time. Also known as sequential search.","support":[{"end":141,"quote":"Search an\narray\nor\nlist\nby checking items one at a time.\nAlso known as\nsequential search.","source_id":"nist-dads.linearsearch","source_sha256":"98b34c763528f3e21071e2ed34d68da4b48513c3b3bab79f2187a8bb6fc81a40","start":52}],"target_id":"method.nist.linearsearch","target_kind":"node","target_sha256":"537d6848766a0943d3d408748e1b6df500996c0abf09d3cf801c94191cea6c8d"}],"method.nist.localitysensitivehashing":[{"id":"assertion.method.nist.localitysensitivehashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines locality-sensitive hashing as: A probabilistic algorithm to quickly find points in a high dimensional space near a query point. Preprocessing: put every point in multiple hash tables . Each table has its own locality-sensitive hash function and uses buckets (or chaining ) since many collisions are expected. The hash functions come from a family of functions. Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","support":[{"end":540,"quote":"A\nprobabilistic algorithm\nto quickly find points in a high dimensional space near a query point.  Preprocessing: put every point in multiple\nhash tables\n.  Each table has its own locality-sensitive\nhash function\nand uses\nbuckets\n(or\nchaining\n) since many collisions are expected. The\nhash functions\ncome from a family of functions.   Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","source_id":"nist-dads.localitysensitivehashing","source_sha256":"881fd73e44b2610799deb7c3a37eabddeb151d3dd4db11a7871eb775760023b8","start":78}],"target_id":"method.nist.localitysensitivehashing","target_kind":"node","target_sha256":"a1bb4ec83d62b2745a4dc78c706c5239d492eea3f2cc6d5c862d577309c2aa02"}],"method.nist.luckysort":[{"id":"assertion.method.nist.luckysort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines lucky sort as: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing!","support":[{"end":152,"quote":"The best possible\nsort\nalgorithm: it is so lucky that the input is already sorted, and it need do nothing!","source_id":"nist-dads.luckysort","source_sha256":"3e7370a03272c10f24d61ca117963d50bc96343f94bb297f0605f41602e72d92","start":46}],"target_id":"method.nist.luckysort","target_kind":"node","target_sha256":"0e6126e8d86e408fe5e18a14d5b8ed62a80f5e4beac3c15e68b9b31e76c9a9b6"}],"method.nist.malhotrakumr":[{"id":"assertion.method.nist.malhotrakumr","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Malhotra-Kumar-Maheshwari blocking flow as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a vertex with the least throughput and greedily push the maximum flow from it to the sink . This is repeated until all vertices are deleted.","support":[{"end":338,"quote":"Given a\nflow function\nand its corresponding residual graph (a\nmaximum-flow problem\n), select a\nvertex\nwith the least throughput and\ngreedily\npush the maximum flow from it to the\nsink\n.  This is repeated until all vertices are deleted.","source_id":"nist-dads.malhotrakumr","source_sha256":"d62af5438f39566b410c72b24d78e6e0b376744723ad866c03f36aacb3b26286","start":104}],"target_id":"method.nist.malhotrakumr","target_kind":"node","target_sha256":"217c992165b7983dead76cd2988c9eca449b22c8bbb00d9d2ae45595d571c0ae"}],"method.nist.memoize":[{"id":"assertion.method.nist.memoize","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines memoization as: Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","support":[{"end":154,"quote":"Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","source_id":"nist-dads.memoize","source_sha256":"51257d9af5d6bb37c6264c693c98a439bcf13b71590d057be45ab847e4cd80b4","start":60}],"target_id":"method.nist.memoize","target_kind":"node","target_sha256":"f73631cb75a2d24eba694613a949a022c4a7fc3d276cbe5bda5d41383b5c5ca8"}],"method.nist.mergesort":[{"id":"assertion.method.nist.mergesort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines merge sort as: A sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence. Run time is Θ (n log n).","support":[{"end":218,"quote":"A\nsort\nalgorithm that splits the items to be sorted into two groups,\nrecursively\nsorts each group, and\nmerges\nthem into a final, sorted sequence.   Run time is\nΘ\n(n log n).","source_id":"nist-dads.mergesort","source_sha256":"8cff46f3edb0aec6a3a99f565d232f595a68ef3ab72018f406e27efb264afb6d","start":46}],"target_id":"method.nist.mergesort","target_kind":"node","target_sha256":"071557e230c3115cb1efeb80589486acc83a5e7b7c5c7554c27290b5d58f2698"}],"method.nist.metaheuristic":[{"id":"assertion.method.nist.metaheuristic","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines metaheuristic as: (1) A high-level algorithmic framework or approach that can be specialized to solve optimization problems . (2) A high-level strategy that guides other heuristics in a search for feasible solutions .","support":[{"end":264,"quote":"(1) A high-level algorithmic framework or approach that can be specialized to solve\noptimization problems\n.  (2) A high-level strategy that guides other\nheuristics\nin a search for\nfeasible solutions\n.","source_id":"nist-dads.metaheuristic","source_sha256":"ce45a1c03c867e90466272aeeda4683e56eb052ca8f2318aee527c76ccc4f34d","start":64}],"target_id":"method.nist.metaheuristic","target_kind":"node","target_sha256":"c83aa0c22f3cef4e15994b7d62cc120aae68c8cdf889a95023a1509d218194dd"}],"method.nist.metaphone":[{"id":"assertion.method.nist.metaphone","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines metaphone as: An algorithm to code English words phonetically by reducing them to 16 consonant sounds. A better variant is double metaphone .","support":[{"end":172,"quote":"An algorithm to code English words phonetically by reducing them to 16 consonant sounds.  A better variant is\ndouble metaphone\n.","source_id":"nist-dads.metaphone","source_sha256":"1e22de5b877c16eda43d1bd5f80f38bd6218e92cb271b826c7f83267bd994b85","start":44}],"target_id":"method.nist.metaphone","target_kind":"node","target_sha256":"c5ad1fdf60531a8f40c8ba30f45b36bb0d0e4bc2d29c4889919d6e3da0ff0053"}],"method.nist.minimalperfecthash":[{"id":"assertion.method.nist.minimalperfecthash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimal perfect hashing as: A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formal Definition: A function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the range of f(k) is 1… |K|.","support":[{"end":358,"quote":"A\nperfect hashing\nfunction that maps each different\nkey\nto a distinct integer and has the same number of possible integers as keys.\nFormal Definition:\nA function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the\nrange\nof f(k) is 1… |K|.","source_id":"nist-dads.minimalperfecthash","source_sha256":"fd175a557a320b9f708d54e78f76632a5adede728399e29d2f861a05f88ceb1d","start":72}],"target_id":"method.nist.minimalperfecthash","target_kind":"node","target_sha256":"0b8d58851f8e7d78ed49cc24bc7d78ff230d31d800a30dda9bcf0f31825ee3cc"}],"method.nist.minimax":[{"id":"assertion.method.nist.minimax","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines minimax as: Generate all nodes in a game tree. Score each leaf node with its utility value. Score each minimizing node with the smallest of its children's scores, and maximizing node with the largest of its children's scores.","support":[{"end":255,"quote":"Generate all nodes in a game tree.  Score each\nleaf\nnode with its utility value.  Score each minimizing node with the smallest of its\nchildren's\nscores, and maximizing node with the largest of its children's scores.","source_id":"nist-dads.minimax","source_sha256":"29977022bea244e7a724baa202bb9415b0fc31c2875b422c560d61bad8623d17","start":40}],"target_id":"method.nist.minimax","target_kind":"node","target_sha256":"a0a58f29b408a147ebed871519cfb024ede7557fbc4c42c72da274373848e597"}],"method.nist.modelcheckng":[{"id":"assertion.method.nist.modelcheckng","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines model checking as: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.","support":[{"end":153,"quote":"Efficiently deciding whether a\ntemporal logic\nformula is satisfied in a\nfinite state machine\nmodel.","source_id":"nist-dads.modelcheckng","source_sha256":"69d894eeeb6399ec8d2fe1f701324d1fe1924ce25d66b6234cb7fe2773be5137","start":54}],"target_id":"method.nist.modelcheckng","target_kind":"node","target_sha256":"179d00569b3bec70176547bb6042abdd92122b30d9804bc5dc6ffaf954baa509"}],"method.nist.modifind":[{"id":"assertion.method.nist.modifind","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines MODIFIND as: Select the k th smallest element of an array and partition the array around it. Partition around the value of the k th element. If the partition boundary is not at k, repeat in the partition that includes k.","support":[{"end":251,"quote":"Select the k\nth\nsmallest element of an array and\npartition\nthe array around it.  Partition around the value of the k\nth\nelement.  If the partition boundary is not at k, repeat in the partition that includes k.","source_id":"nist-dads.modifind","source_sha256":"fae0832bcea4c48ac8b5afb484724ea4f64d8e36556ad18b95ad7ef1e8c2d4cd","start":42}],"target_id":"method.nist.modifind","target_kind":"node","target_sha256":"5de23c005006aa4946c49b4c4644409dacad2a81a56de208336da56f50cddb3d"}],"method.nist.montecarlo":[{"id":"assertion.method.nist.montecarlo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Monte Carlo algorithm as: A randomized algorithm that may produce incorrect results, but with bounded error probability.","support":[{"end":174,"quote":"A\nrandomized algorithm\nthat may produce incorrect results, but with bounded error probability.","source_id":"nist-dads.montecarlo","source_sha256":"82166e8633740bccda0cf05d7bee2261c8816534d4f36bf35993572846d3dcff","start":80}],"target_id":"method.nist.montecarlo","target_kind":"node","target_sha256":"9d0b72d1c184ff13163515a9c885ce8c4a74b734a65c76360ebd52df86277929"}],"method.nist.movefront":[{"id":"assertion.method.nist.movefront","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines move-to-front heuristic as: A heuristic that moves the target of a search to the head of a list so it is found faster next time.","support":[{"end":172,"quote":"A\nheuristic\nthat moves the target of a\nsearch\nto the\nhead\nof a\nlist\nso it is found faster next time.","source_id":"nist-dads.movefront","source_sha256":"457cf76a8c0855fcf2a9ec04a448709681a8b9c9b0af367641debb7eaa301ee0","start":72}],"target_id":"method.nist.movefront","target_kind":"node","target_sha256":"05ac1537d465aecce72b409e3aa1c512e0b4094bb904df3d426772c07f491b4c"}],"method.nist.movetoroot":[{"id":"assertion.method.nist.movetoroot","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines move-to-root heuristic as: A heuristic that moves the target of a search to the root of the search tree so it is found faster next time.","support":[{"end":179,"quote":"A\nheuristic\nthat moves the target of a\nsearch\nto the\nroot\nof the\nsearch tree\nso it is found faster next time.","source_id":"nist-dads.movetoroot","source_sha256":"3c63a8b0423f4c8c65811462f9d96135665bd0269040000bbd63d2d561094959","start":70}],"target_id":"method.nist.movetoroot","target_kind":"node","target_sha256":"33b5c5a2411a974c07e55505ab1b231cdda720f42a3c6d14647416d26c54d8a0"}],"method.nist.multikeyquicksort":[{"id":"assertion.method.nist.multikeyquicksort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multikey Quicksort as: Pick an element from the array (the pivot). Consider the first character (key) of the string (multikey). Partition the remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character. Recursively sort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key). Also known as three-way radix quicksort.","support":[{"end":515,"quote":"Pick an element from the array (the pivot).  Consider the first character (key) of the\nstring\n(multikey).\nPartition\nthe remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character.\nRecursively\nsort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key).\nAlso known as\nthree-way radix quicksort.","source_id":"nist-dads.multikeyquicksort","source_sha256":"35fa9e30e6ba1c840bd1c70799f6b4a139652a5d45b526a592d2e196cac14482","start":62}],"target_id":"method.nist.multikeyquicksort","target_kind":"node","target_sha256":"d373bac85216bff601677ebc4535e2a1efc7d1585664a45f31f6bce81bb5a71b"}],"method.nist.multiprefix":[{"id":"assertion.method.nist.multiprefix","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines multiprefix as: A generalization of scan in which the partial sums are grouped by keys .","support":[{"end":120,"quote":"A generalization of\nscan\nin which the partial sums are grouped by\nkeys\n.","source_id":"nist-dads.multiprefix","source_sha256":"ad580805b1c440e0807ce8fb7817bdf706255fafee463b34ce1ecd3f45c226c1","start":48}],"target_id":"method.nist.multiprefix","target_kind":"node","target_sha256":"0c865ff16d610f64362047086d6a175f24b6af89c8b380bbabc3b52a734c013c"}],"method.nist.munkresassignment":[{"id":"assertion.method.nist.munkresassignment","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Munkres' assignment algorithm as: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns. Also known as Hungarian algorithm.","support":[{"end":245,"quote":"Solve the\nassignment problem\nin\npolynomial time\nby marking and unmarking entries and covering and uncovering rows and columns.\nAlso known as\nHungarian algorithm.","source_id":"nist-dads.munkresassignment","source_sha256":"30736ed89087377cd4df9fb9dc1062912e2ea357950243e1d2ad7e47b9df3e54","start":84}],"target_id":"method.nist.munkresassignment","target_kind":"node","target_sha256":"182c0c1e24c30479d7608ddbb2d40fd29987631d313f12b70911f9156122e2e6"}],"method.nist.nonbalncmsrt":[{"id":"assertion.method.nist.nonbalncmsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nonbalanced merge sort as: A k-way merge sort in which the number of input and output data streams is different for any particular pass. Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","support":[{"end":334,"quote":"A\nk-way merge sort\nin which the number of input and  output data streams is different for any particular  pass.  Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","source_id":"nist-dads.nonbalncmsrt","source_sha256":"bea350a5fd3d2b12f54175ebc5a1b1a71aac6110be44d5e9108781dce823f0c7","start":70}],"target_id":"method.nist.nonbalncmsrt","target_kind":"node","target_sha256":"32a822e9ce7e6d0b8ce50f145997b3baca4837aa4b874d8debd36567f7730529"}],"method.nist.nondetermalgo":[{"id":"assertion.method.nist.nondetermalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines nondeterministic algorithm as: A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It is not random, as in randomized algorithm , or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","support":[{"end":361,"quote":"A conceptual\nalgorithm\nwith more than one allowed step at certain times and which always takes the right or best step.   It is not random, as in\nrandomized algorithm\n, or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","source_id":"nist-dads.nondetermalgo","source_sha256":"4a3f6e614c396881689a3c402c9006b867619345bb4d10875180e6b46a15d868","start":90}],"target_id":"method.nist.nondetermalgo","target_kind":"node","target_sha256":"df762c0c30646ea60ab3d55064d93bb433ca2cc6a0f7b8924e95d19db45037e6"}],"method.nist.nysiis":[{"id":"assertion.method.nist.nysiis","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines NYSIIS as: Convert a name to a phonetic coding of up to six characters.","support":[{"end":98,"quote":"Convert a name to a phonetic coding of up to six characters.","source_id":"nist-dads.nysiis","source_sha256":"d6a94fcfad46a225536d81abf2b6ec81c71ab314a49ae3ec3fc1b0f965e5bf82","start":38}],"target_id":"method.nist.nysiis","target_kind":"node","target_sha256":"184aaa7056bface6b35a8325af4b50806343423d7cf4acdb1350e9746c9b0afe"}],"method.nist.openaddressing":[{"id":"assertion.method.nist.openaddressing","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines open addressing as: A class of collision resolution schemes in which all items are stored within the hash table . In case of collision , other positions are computed, giving a probe sequence , and checked until an empty position is found. Some ways of computing possible new positions are less efficient because of clustering . Typically items never move once put in place, but in Robin Hood hashing , LCFS hashing , and other techniques, previously placed items may move.","support":[{"end":511,"quote":"A class of\ncollision resolution schemes\nin which all items are stored within the\nhash table\n.  In case of\ncollision\n, other positions are computed, giving a\nprobe sequence\n, and checked until an empty position is found.  Some ways of computing possible new positions are less efficient because of\nclustering\n. Typically items never move once put in place, but in\nRobin Hood hashing\n,\nLCFS hashing\n, and other techniques,  previously placed items may move.","source_id":"nist-dads.openaddressing","source_sha256":"86639cadf497d4cd7f686e62ca9fcb374f57a14c869676513f0356c81a283b68","start":56}],"target_id":"method.nist.openaddressing","target_kind":"node","target_sha256":"76494ba702a0f1662d3081daef0cb1964d6cc3e3eeafbcd8b6d51aac7229d14f"}],"method.nist.optimalmismatch":[{"id":"assertion.method.nist.optimalmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal mismatch as: A string matching algorithm that compares the rarest character first. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","support":[{"end":265,"quote":"A\nstring matching\nalgorithm that compares the rarest character first.  When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","source_id":"nist-dads.optimalmismatch","source_sha256":"da1003ac32a4c93f6c9a5d093c62bb6dc88d332fcf7b04648ffce60a9a0e2bed","start":58}],"target_id":"method.nist.optimalmismatch","target_kind":"node","target_sha256":"b6a2279b63f4b9c71fdd4b4f467a6b4894a779882713d39ddf1e9b6384017cf7"}],"method.nist.optimalpolyphasemergesort":[{"id":"assertion.method.nist.optimalpolyphasemergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal polyphase merge sort as: An external sort algorithm that uses optimal polyphase merges .","support":[{"end":145,"quote":"An\nexternal sort\nalgorithm that uses\noptimal polyphase merges\n.","source_id":"nist-dads.optimalpolyphasemergesort","source_sha256":"78f678110a3a6262b951df65e33d1ae9cc7aef6eefa59396331ef359752adca3","start":82}],"target_id":"method.nist.optimalpolyphasemergesort","target_kind":"node","target_sha256":"6fff355a224a04aebafca660881123831fabc2348f396fa57a9d194dbc338712"}],"method.nist.optimpolymrg":[{"id":"assertion.method.nist.optimpolymrg","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines optimal polyphase merge as: A polyphase merge which seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files. Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file. A series of kth order Fibonacci numbers is one way to select the number of runs.","support":[{"end":461,"quote":"A\npolyphase merge\nwhich seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files.  Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file.  A series of\nkth order Fibonacci numbers\nis one way to select the number of runs.","source_id":"nist-dads.optimpolymrg","source_sha256":"338b8152021c21608548da123feb9ed9acb3b9d0cc61bb9ea41aa8352ec5b33c","start":72}],"target_id":"method.nist.optimpolymrg","target_kind":"node","target_sha256":"491664067aafc608449ed6ee87fd3444587ceac4068a29fbee339c0f72faa993"}],"method.nist.orderpreservinghuffmancoding":[{"id":"assertion.method.nist.orderpreservinghuffmancoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order-preserving Huffman coding as: A variable-length character coding based on the frequency of each character. The algorithm is similar to Huffman coding , but the trees are kept in the same order as the characters. Two adjacent trees with the least combined frequency are joined as subtrees of a new root. As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies. Repeat until all characters are in one tree.","support":[{"end":497,"quote":"A variable-length character coding based on the frequency of each character.  The algorithm is similar to\nHuffman coding\n, but the trees are kept in the same order as the characters.  Two\nadjacent\ntrees with the least combined frequency are joined as subtrees of a new root.  As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies.  Repeat until all characters are in one tree.","source_id":"nist-dads.orderpreservinghuffmancoding","source_sha256":"1541c6d209e942d65bc57668fa0abd704e7de418a81e65a1203bd3f82e4eb2d7","start":88}],"target_id":"method.nist.orderpreservinghuffmancoding","target_kind":"node","target_sha256":"757fb1c7974f4509c3675bfc5f79763449b8cb0156595a4bc2d58fbfefd05702"}],"method.nist.orderpreservminperfecthash":[{"id":"assertion.method.nist.orderpreservminperfecthash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines order-preserving minimal perfect hashing as: A minimal perfect hashing function for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","support":[{"end":211,"quote":"A\nminimal perfect hashing\nfunction for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","source_id":"nist-dads.orderpreservminperfecthash","source_sha256":"568f565a957cbbe009b53414e116e6a3aa568018b2cbd53415ba549dd52f7c10","start":106}],"target_id":"method.nist.orderpreservminperfecthash","target_kind":"node","target_sha256":"ea7cc36fb3dfb4892e70944e9c346fdc455eda617ccb601ff860a00a88e2279e"}],"method.nist.oscillatingmergesort":[{"id":"assertion.method.nist.oscillatingmergesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines oscillating merge sort as: Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward. Repeat until n-2 (backward) merged runs have been created, at which time they are merged. Continue building up powers of n-2 batches until done.","support":[{"end":379,"quote":"Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward.  Repeat until n-2 (backward) merged runs have been created, at which time they are  merged.  Continue building up powers of n-2 batches until done.","source_id":"nist-dads.oscillatingmergesort","source_sha256":"a2b35ade8d38be138c9e349c654f469ea6d9397fa959e7377e4f95b9d9cab1f6","start":70}],"target_id":"method.nist.oscillatingmergesort","target_kind":"node","target_sha256":"87cc05fe56960c0e078bfcfc35c5d4b0c0075eb6ef4b808f50b26e3e9d774660"}],"method.nist.pearsonshash":[{"id":"assertion.method.nist.pearsonshash","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Pearson's hash as: A hash function that uses an auxiliary array, but no shift or exclusive-or ( xor ) operations.","support":[{"end":148,"quote":"A\nhash function\nthat uses an auxiliary array, but no shift or exclusive-or (\nxor\n) operations.","source_id":"nist-dads.pearsonshash","source_sha256":"ff4fc46f19620af88fb1f6ddc9f8b7253fe878474e8b1904678b0d09d77f1d20","start":54}],"target_id":"method.nist.pearsonshash","target_kind":"node","target_sha256":"2a86d9cc74e0cacf1fea7a40c2e4dec5a3b6c43d0684a52cf7a4e3fc621e1931"}],"method.nist.perfecthash":[{"id":"assertion.method.nist.perfecthash","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines perfect hashing as: A hash function that maps each different key to a distinct integer. Usually all possible keys must be known beforehand. A hash table that uses a perfect hash has no collisions . Formal Definition: A function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k. Also known as optimal hashing.","support":[{"end":365,"quote":"A\nhash function\nthat maps each different\nkey\nto a distinct integer.  Usually all possible keys must be known beforehand.  A\nhash table\nthat uses a perfect hash has no\ncollisions\n.\nFormal Definition:\nA function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k.\nAlso known as\noptimal hashing.","source_id":"nist-dads.perfecthash","source_sha256":"a5d69550cd9f0f0573fe0abfd5ff44b003a1d95df2e741578695b2d904824723","start":56}],"target_id":"method.nist.perfecthash","target_kind":"node","target_sha256":"36d3a19ac462c1d97406c218dcafe52082c0f8fdd0229c84b04145b56161dedb"}],"method.nist.perfectshuffle":[{"id":"assertion.method.nist.perfectshuffle","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines perfect shuffle as: Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","support":[{"end":157,"quote":"Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","source_id":"nist-dads.perfectshuffle","source_sha256":"32c4d2b435df36f2f9911d3c747ed13e216fadec722ec02270598cf63314fe5e","start":56}],"target_id":"method.nist.perfectshuffle","target_kind":"node","target_sha256":"ca6ac2c54761faeffb856ab9e380bfb13620818ee051124957ff26401c347e6c"}],"method.nist.permutation":[{"id":"assertion.method.nist.permutation","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines permutation as: A rearrangement of elements, where none are lost, added, or changed. The Fisher-Yates shuffle randomly permutes elements. Also known as shuffle.","support":[{"end":193,"quote":"A rearrangement of elements, where none are lost, added, or changed.  The\nFisher-Yates shuffle\nrandomly permutes elements.\nAlso known as\nshuffle.","source_id":"nist-dads.permutation","source_sha256":"ce156ee8ab3d7451a40895ef84b9d1704ef9e67f6c1bc39440951f258ee89a33","start":48}],"target_id":"method.nist.permutation","target_kind":"node","target_sha256":"7e9d67380cefaef813dbbf5f5f93bfd6692265c509ea1daeaff5738383cb8b0c"}],"method.nist.permutationsort":[{"id":"assertion.method.nist.permutationsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines permutation sort as: A terribly inefficient sort algorithm that generates each permutation of the items until the items are in order.","support":[{"end":170,"quote":"A terribly inefficient\nsort\nalgorithm that generates each\npermutation\nof the items until the items are in order.","source_id":"nist-dads.permutationsort","source_sha256":"5fc2880dc3f719b8df6f0a8320be938fbdcc8ebcd252421811e2d11d26991cc6","start":58}],"target_id":"method.nist.permutationsort","target_kind":"node","target_sha256":"4c149ce316da0a75a5254d9a97da73cc95001f89af5984f8be44df42dc358aa1"}],"method.nist.pigeonholesort":[{"id":"assertion.method.nist.pigeonholesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pigeonhole sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items. The first pass allocates an array of buckets , one bucket for each possible key value, then moves each item to its key's bucket. The second pass goes over the bucket array moving each item to the next place in the destination.","support":[{"end":396,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the range of\nkeys\nis approximately equal to the number of items.  The first pass allocates an\narray\nof\nbuckets\n, one bucket for each possible\nkey\nvalue, then moves each item to its key's bucket.  The second pass goes over the bucket array moving each item to the next place in the destination.","source_id":"nist-dads.pigeonholesort","source_sha256":"d91e5e538fa22d040faa03d6bc7591cea943510a403c27c061f0f12c0db33570","start":56}],"target_id":"method.nist.pigeonholesort","target_kind":"node","target_sha256":"725718d465e40da14a79342ae94619bc2fa466fc210cab7ced29748efc1c5922"}],"method.nist.pipelineddvd":[{"id":"assertion.method.nist.pipelineddvd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pipelined divide and conquer as: A divide and conquer paradigm in which partial results from recursive calls can be used before the calls complete. The technique is often useful for reducing the depth of an algorithm .","support":[{"end":279,"quote":"A\ndivide and conquer\nparadigm in which partial results from\nrecursive\ncalls can be used before the calls complete. The technique is often useful for reducing the\ndepth\nof an\nalgorithm\n.","source_id":"nist-dads.pipelineddvd","source_sha256":"d911c4da968d5ec13b939127558def311135318418ba54eab0aa9dbcd7e6eebd","start":94}],"target_id":"method.nist.pipelineddvd","target_kind":"node","target_sha256":"e9a14a0f8fa489b9db16959b3c668e661c89906e7b0b77bbd2eee2b9cd4bf290"}],"method.nist.polynomaprox":[{"id":"assertion.method.nist.polynomaprox","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a (1+ε)-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of ε. Sometimes referred to more precisely as polynomial-time approximation scheme. Also known as PTAS.","support":[{"end":412,"quote":"A set of\nalgorithms\n{A\nε\n| ε > 0}, where each A\nε\nis a\n(1+ε)-approximation algorithm\nand the execution time is bounded by a\npolynomial\nin the length of the input.  The execution time may depend on the choice of ε.  Sometimes referred to more precisely as polynomial-time approximation scheme.\nAlso known as\nPTAS.","source_id":"nist-dads.polynomaprox","source_sha256":"c703d11352b1f66fed9aac056a6cd9d72539acf4bfb1122d137e0a42078204c6","start":100}],"target_id":"method.nist.polynomaprox","target_kind":"node","target_sha256":"a9be6d21b562fc0dd0764b2a59e056aff0ff294c389e6d9949b915b4bd1cc3b4"}],"method.nist.polyphmerge":[{"id":"assertion.method.nist.polyphmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polyphase merge as: A nonbalanced k-way merge which reduces the number of output files needed by reusing the emptied input file or device as one of the output devices. This is most efficient if the number of output runs in each output file is different.","support":[{"end":290,"quote":"A nonbalanced\nk-way merge\nwhich reduces the number of output files needed by reusing the emptied input file or device as one of the output devices.  This is most efficient if the number of output runs in each output file is different.","source_id":"nist-dads.polyphmerge","source_sha256":"c36a02bd68f62a0467d6093195efeda11b7585bffc67f12c6c0b63828e075fea","start":56}],"target_id":"method.nist.polyphmerge","target_kind":"node","target_sha256":"539b036074399709dd0c66df0b30a2400543b1a5a726305f108538943f23fbe0"}],"method.nist.polyphmrgsrt":[{"id":"assertion.method.nist.polyphmrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines polyphase merge sort as: A merge sort algorithm that reduces the number of intermediate files needed by reusing emptied files.","support":[{"end":167,"quote":"A\nmerge sort\nalgorithm that reduces the number of intermediate files needed by reusing emptied files.","source_id":"nist-dads.polyphmrgsrt","source_sha256":"0713a157e655c2743f78e104a2091904ac4624611fd70c44975c4be607b1f002","start":66}],"target_id":"method.nist.polyphmrgsrt","target_kind":"node","target_sha256":"f68714853da068269cd0a073cbc91dd0e72789d50b33dba46a559eee03901053"}],"method.nist.postmansort":[{"id":"assertion.method.nist.postmansort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines postman's sort as: A highly engineered variant of top-down radix sort where attributes of the key are described so the algorithm can allocate buckets and distribute efficiently.","support":[{"end":212,"quote":"A highly engineered variant of\ntop-down radix sort\nwhere attributes of the\nkey\nare described so the algorithm can allocate buckets and distribute efficiently.","source_id":"nist-dads.postmansort","source_sha256":"326576c451b5306c72c7fcd221bbbe079e7d8e3409a24489edeba5ccaffd36c0","start":54}],"target_id":"method.nist.postmansort","target_kind":"node","target_sha256":"36990effd05b788ced371d7ac4e94d212467cae21085b4397731126aece2b0ae"}],"method.nist.postordertraversal":[{"id":"assertion.method.nist.postordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines postorder traversal as: Process all nodes of a tree by recursively processing all subtrees, then finally processing the root . Also known as postfix traversal.","support":[{"end":199,"quote":"Process all\nnodes\nof a\ntree\nby\nrecursively\nprocessing all subtrees, then finally processing the\nroot\n.\nAlso known as\npostfix traversal.","source_id":"nist-dads.postordertraversal","source_sha256":"96ce23cb392f55631e3fcbba6273e577e34016447ab35df659257e5a94fea857","start":64}],"target_id":"method.nist.postordertraversal","target_kind":"node","target_sha256":"43bb3fc47a3d387514a76bbe0b09eed19d67891edc326bcc263163188889990f"}],"method.nist.preordertraversal":[{"id":"assertion.method.nist.preordertraversal","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines preorder traversal as: Process all nodes of a tree by processing the root , then recursively processing all subtrees. Also known as prefix traversal.","support":[{"end":188,"quote":"Process all\nnodes\nof a\ntree\nby processing the\nroot\n, then\nrecursively\nprocessing all subtrees.\nAlso known as\nprefix traversal.","source_id":"nist-dads.preordertraversal","source_sha256":"529ca5ac1b71f7f2b6aa3f1231f911f57b1983d1bd88bd22eb8d1a6350754b7d","start":62}],"target_id":"method.nist.preordertraversal","target_kind":"node","target_sha256":"bc94cb61f9a9bd071b3f339c89ea4a776798465209bfe58dbede8fcbc060e26a"}],"method.nist.primjarnik":[{"id":"assertion.method.nist.primjarnik","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Prim-Jarnik algorithm as: Compute a minimum spanning tree by beginning with any vertex as the current tree . At each step add a least edge between any vertex not in the tree and any vertex in the tree. Continue until all vertices have been added.","support":[{"end":290,"quote":"Compute a\nminimum spanning tree\nby beginning with any\nvertex\nas the current\ntree\n.  At each step add a least\nedge\nbetween any\nvertex\nnot in the tree and any vertex in the tree.  Continue until all vertices have been added.","source_id":"nist-dads.primjarnik","source_sha256":"182665b9d10c2ece0f563d3bac08cb6cb29c9302a9088e7315d4668ee95df510","start":68}],"target_id":"method.nist.primjarnik","target_kind":"node","target_sha256":"bcefbfede2463547edda893fec70408a15969fb6c86b7234b50221acde19c821"}],"method.nist.prunensearch":[{"id":"assertion.method.nist.prunensearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines prune and search as: Find an optimal value by eliminating a constant fraction of remaining objects at each step. Eliminated objects are guaranteed not to affect the optimal value. A logarithmic number of steps reduces the number of objects to a constant, and a brute force approach can then solve it. Also known as decimation.","support":[{"end":377,"quote":"Find an\noptimal value\nby eliminating a constant fraction of remaining objects at each step.  Eliminated objects are guaranteed not to affect the optimal value.  A\nlogarithmic\nnumber of steps reduces the number of objects to a constant, and a\nbrute force\napproach can then solve it.\nAlso known as\ndecimation.","source_id":"nist-dads.prunensearch","source_sha256":"c2bec4ceb1f19fcb3ca9a30c14d18618e687e239523fed0dc704bb6eae3cdfef","start":70}],"target_id":"method.nist.prunensearch","target_kind":"node","target_sha256":"dbb78a2b15fc0f6dc082ba1198e3a78a02e2f636b1426eb6191b21db228ad73d"}],"method.nist.pseudorandomnumbergen":[{"id":"assertion.method.nist.pseudorandomnumbergen","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines pseudo-random number generator as: A deterministic algorithm to generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties. Also known as PRNG, deterministic random bit generator, DRBG.","support":[{"end":302,"quote":"A\ndeterministic algorithm\nto generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties.\nAlso known as\nPRNG, deterministic random bit generator, DRBG.","source_id":"nist-dads.pseudorandomnumbergen","source_sha256":"dd9863e891f330ce124accfc80f6039b6b7f71eaf5300e0e0b5dad1d979c7095","start":86}],"target_id":"method.nist.pseudorandomnumbergen","target_kind":"node","target_sha256":"a4266eafec185d788e9a60e408085bba051f5829193a6fe32de0e02578812f22"}],"method.nist.qsort":[{"id":"assertion.method.nist.qsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines q sort as: The sort function in many libraries. It is generally a combination of quicksort, for many items, and insertion sort , for a few items.","support":[{"end":172,"quote":"The\nsort\nfunction in many libraries. It is generally a combination of quicksort, for many items, and\ninsertion sort\n, for a few items.","source_id":"nist-dads.qsort","source_sha256":"5de8a90679d0a4801804280d9968c3a1f144f051f53fb381a23251a1c2cb1847","start":38}],"target_id":"method.nist.qsort","target_kind":"node","target_sha256":"9dcdbdf37e41f9faf62742e2e3456215c439256356d2d11885360e8112300a8b"}],"method.nist.quadraticprb":[{"id":"assertion.method.nist.quadraticprb","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quadratic probing as: A method of open addressing for a hash table in which a collision is resolved by putting the item in the next empty place given by a probe sequence . The space between places in the sequence increases quadratically.","support":[{"end":276,"quote":"A method of\nopen addressing\nfor a\nhash table\nin which a\ncollision\nis resolved by putting the item in the next empty place given by a\nprobe sequence\n.  The space between places in the sequence increases quadratically.","source_id":"nist-dads.quadraticprb","source_sha256":"52910a88e5ec859d6aa1f5f8438b64e144cb26e88ec3ae436446a6c0d17e6312","start":60}],"target_id":"method.nist.quadraticprb","target_kind":"node","target_sha256":"2268915267031d3bd34d7f0a01b570e2b28499b818eab0bbdb46009360fee397"}],"method.nist.quicksearch":[{"id":"assertion.method.nist.quicksearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines quick search as: A string matching algorithm that compares characters from the end of the search string to its beginning. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","support":[{"end":292,"quote":"A\nstring matching\nalgorithm that compares characters from the end of the search string to its beginning.  When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","source_id":"nist-dads.quicksearch","source_sha256":"5c615ff093cc5edd59467ec3b03c3bcb728cf82de88c4afc9ebe0df6425812c9","start":50}],"target_id":"method.nist.quicksearch","target_kind":"node","target_sha256":"d9984270d67028a7e5f39c8bf5841880651613fd672a7ca0605879c77eaaada0"}],"method.nist.quicksort":[{"id":"assertion.method.nist.quicksort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines quicksort as: Pick an element from the array (the pivot), partition the remaining elements into those greater than and less than this pivot, and recursively sort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","support":[{"end":383,"quote":"Pick an element from the array (the pivot),\npartition\nthe remaining elements into those greater than and less than this pivot, and\nrecursively\nsort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","source_id":"nist-dads.quicksort","source_sha256":"0782b309479e447f90ae37b5fd4804aa9e617eaeaf1c1bfb38d43d29402a7b1e","start":44}],"target_id":"method.nist.quicksort","target_kind":"node","target_sha256":"333feb7621bfc1412387e14a2009093b393ebcc215bf4f0e0797517047ea4832"}],"method.nist.radixsort":[{"id":"assertion.method.nist.radixsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines radix sort as: A multiple pass distribution sort algorithm that distributes each item to a bucket according to part of the item's key beginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","support":[{"end":376,"quote":"A multiple pass\ndistribution sort\nalgorithm that distributes each item to a\nbucket\naccording to part of the item's\nkey\nbeginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","source_id":"nist-dads.radixsort","source_sha256":"a100bba766cbf8977c872a6521a1311d6aba58ec69121272ed871660b4e07282","start":46}],"target_id":"method.nist.radixsort","target_kind":"node","target_sha256":"429bc1885f2104da9f5663a7472cc7700465217c7e10d7d6bbf692b98be2812c"}],"method.nist.randomizdrnd":[{"id":"assertion.method.nist.randomizdrnd","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines randomized rounding as: A probabilistic method to convert a solution of a relaxed problem into an approximate solution to the original problem.","support":[{"end":183,"quote":"A probabilistic method to convert a solution of a\nrelaxed\nproblem into an approximate solution to the original problem.","source_id":"nist-dads.randomizdrnd","source_sha256":"34c91448929459ed05e3424ffef09ca21d1225e83304d991171bab5d6025ffbc","start":64}],"target_id":"method.nist.randomizdrnd","target_kind":"node","target_sha256":"fb84a641e5405cc49ac047f990e134a4115365ffcb9a238e8822f14d08c8aee6"}],"method.nist.randomsampl":[{"id":"assertion.method.nist.randomsampl","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random sampling as: Using a randomly selected sample of the data to help solve a problem on the whole data.","support":[{"end":155,"quote":"Using a randomly selected sample of the data to help solve a problem on the whole data.","source_id":"nist-dads.randomsampl","source_sha256":"99a5f3a07e16dde99d54f7949f7175219878669739c7107fb3d99419aac5cb1d","start":68}],"target_id":"method.nist.randomsampl","target_kind":"node","target_sha256":"4260d1ab6c54e420beb59f52dfea66bd5f30ddf3eacab73eaf120b26eaaf20b9"}],"method.nist.randomsearch":[{"id":"assertion.method.nist.randomsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines random search as: Repeatedly check items in an array at random until successful.","support":[{"end":114,"quote":"Repeatedly check items in an\narray\nat random until successful.","source_id":"nist-dads.randomsearch","source_sha256":"685152c5b0fb50ffaabc75d899be29d97bb5ad35ab37866d60c576d6b234d4ac","start":52}],"target_id":"method.nist.randomsearch","target_kind":"node","target_sha256":"54d6ff72a1020ae22bc5953b640f4cf6f34c88bbdc176915d783ec33b06dc8d3"}],"method.nist.rangesort":[{"id":"assertion.method.nist.rangesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines range sort as: A bucket sort where the function to determine the bucket is based on the range of possible keys .","support":[{"end":143,"quote":"A\nbucket sort\nwhere the function to determine the\nbucket\nis based on the\nrange\nof possible\nkeys\n.","source_id":"nist-dads.rangesort","source_sha256":"26fbaaefe9780fbcca6e5f1e3ecaba8fd8712b6015b56f895c494f913c307bc6","start":46}],"target_id":"method.nist.rangesort","target_kind":"node","target_sha256":"5bc18e7061f283210326fa48acfed51dfdb6b95434a8ff77b04d3ba51aad78de"}],"method.nist.rapidsort":[{"id":"assertion.method.nist.rapidsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rapid sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary array . The second pass goes over the auxiliary array writing the counted number of keys to the destination.","support":[{"end":357,"quote":"A 2-pass\nsort\nalgorithm that is efficient when the range of\nkeys\nis approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary\narray\n. The second pass goes over the auxiliary array writing the counted number of keys to the destination.","source_id":"nist-dads.rapidsort","source_sha256":"4b3cad6866cad9c884deb7ae3a717126394bd2774e962a6c1d900b60064cc1c0","start":46}],"target_id":"method.nist.rapidsort","target_kind":"node","target_sha256":"5cd342cd02c5fe3bfec9c62f0d70ea68c5123b98d80016aa9af4bdeeec750488"}],"method.nist.ratcliffobershelp":[{"id":"assertion.method.nist.ratcliffobershelp","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Ratcliff/Obershelp pattern recognition as: Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common substring plus, recursively, matching characters in the unmatched region on either side of the longest common substring.","support":[{"end":412,"quote":"Compute the similarity of two\nstrings\nas the number of matching characters divided by the total number of characters in the two strings.  Matching characters are those in the\nlongest common substring\nplus, recursively, matching characters in the unmatched region on either side of the longest common substring.","source_id":"nist-dads.ratcliffobershelp","source_sha256":"7b699795308416bb805af1de0b8596a75c9fbd2f309014796e5a9d28f4f0ba2c","start":102}],"target_id":"method.nist.ratcliffobershelp","target_kind":"node","target_sha256":"bff99f88e959045887473b8c043c4730f7d88558d069352b6fe1665c79c24428"}],"method.nist.rebalance":[{"id":"assertion.method.nist.rebalance","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines rebalance as: Restore balance to a tree .","support":[{"end":71,"quote":"Restore\nbalance\nto a\ntree\n.","source_id":"nist-dads.rebalance","source_sha256":"376064a758a690f561e6da31ef4c116a293596937367f815c50124c1d7c328c2","start":44}],"target_id":"method.nist.rebalance","target_kind":"node","target_sha256":"2a545d4c6ec33f58881fa0149347f7604021669b8eb0dd5101fa12c73778a491"}],"method.nist.recursion":[{"id":"assertion.method.nist.recursion","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines recursion as: An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","support":[{"end":170,"quote":"An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","source_id":"nist-dads.recursion","source_sha256":"22e73481a2c3487b2e35080a2ef2abec1a5df04b470f63186cd5fce2d04342d5","start":56}],"target_id":"method.nist.recursion","target_kind":"node","target_sha256":"219cb89dd1677e39912603f3f231dc6faaa437bcfe0446a06da229339d984ff9"}],"method.nist.repeatedsquaring":[{"id":"assertion.method.nist.repeatedsquaring","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines repeated squaring as: Compute the n th power of an expression in Θ(log n) steps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","support":[{"end":246,"quote":"Compute the n\nth\npower of an expression in\nΘ(log n)\nsteps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","source_id":"nist-dads.repeatedsquaring","source_sha256":"f8eaff86444a00e6a3da69c65099c97bdc0843a54d61c531cb8c6736c9e9da37","start":60}],"target_id":"method.nist.repeatedsquaring","target_kind":"node","target_sha256":"b87d369e88d5d805edd5ba3a76849f409c0f6d831ef134dd369333dfd99954e8"}],"method.nist.reservoirsampling":[{"id":"assertion.method.nist.reservoirsampling","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines reservoir sampling as: Randomly select k items from a stream of items of unknown length. Save the first k items in an array of size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive). If M ≤ k, replace item M of the array with item j.","support":[{"end":301,"quote":"Randomly select k items from a stream of items of unknown length.  Save the first k items in an\narray\nof size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive).  If M ≤ k, replace item M of the array with item j.","source_id":"nist-dads.reservoirsampling","source_sha256":"ced24fac1562ff0a5344be627d2c6953e6ef7b38f792b956764e1e800e429b96","start":62}],"target_id":"method.nist.reservoirsampling","target_kind":"node","target_sha256":"e4bf574d96e032524019331f9cfefce9f351a2c58a3170d5fc573dcfc0a9559d"}],"method.nist.rhoapproxmtn":[{"id":"assertion.method.nist.rhoapproxmtn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines ρ-approximation algorithm as: An approximation algorithm guaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or relative performance guarantee of the algorithm.","support":[{"end":294,"quote":"An\napproximation algorithm\nguaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or\nrelative performance guarantee\nof the algorithm.","source_id":"nist-dads.rhoapproxmtn","source_sha256":"e84386d66472aa1deb376b85d79cd067a5aa0aec261135961308a800f84476ce","start":90}],"target_id":"method.nist.rhoapproxmtn","target_kind":"node","target_sha256":"fae842708fc391afb24db2c6f83563bc10c36099d562116a9936d8122656985e"}],"method.nist.rightrotatn":[{"id":"assertion.method.nist.rightrotatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines right rotation as: (1) In a binary search tree , pushing a node N down and to the right to balance the tree. N's left child replaces N, and the left child's right child becomes N's left child. (2) In an array , moving all items to the next higher location. The last item is moved to the first location, which is now vacant. (3) In a list , removing the tail and inserting it at the head . Also known as rotate right.","support":[{"end":453,"quote":"(1) In a\nbinary search tree\n, pushing a\nnode\nN down and to the right to\nbalance\nthe tree.  N's left\nchild\nreplaces N, and the left child's right child becomes N's left child. (2) In an\narray\n, moving all items to the next higher location.  The last item is moved to the first location, which is now vacant. (3) In a\nlist\n, removing the\ntail\nand inserting it at the\nhead\n.\nAlso known as\nrotate right.","source_id":"nist-dads.rightrotatn","source_sha256":"4f2e7a19a7e85bc57a14c8db23243bcb131faf107ba61881a5698fffb3f5843f","start":54}],"target_id":"method.nist.rightrotatn","target_kind":"node","target_sha256":"ee89de6c8d34c0ba7336e989184f5f3e875cd9a583e139bf97bdf7b70fca8b1c"}],"method.nist.robinhoodhashing":[{"id":"assertion.method.nist.robinhoodhashing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Robin Hood hashing as: In case of collision , the item with the longer probe sequence stays in the position. The other item is moved. This tends to equalize the length of probe sequences.","support":[{"end":228,"quote":"In case of\ncollision\n, the item with the longer\nprobe sequence\nstays in the position.  The other item is moved.  This tends to equalize the length of probe sequences.","source_id":"nist-dads.robinhoodhashing","source_sha256":"3df2ae0eb31cac4c0c019f143e0f6b4f897a218ab733fe58f29e7fe2772c60f1","start":62}],"target_id":"method.nist.robinhoodhashing","target_kind":"node","target_sha256":"864d4f17ee9e52247e45c9af69840594e821ffc7f37a3389b5bd371eb3ff7dfc"}],"method.nist.scan":[{"id":"assertion.method.nist.scan","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines scan as: A parallel operation in which each element in an array or linked list receives the sum of all previous elements. Also known as prefix sums.","support":[{"end":173,"quote":"A parallel operation in which each element in an\narray\nor\nlinked list\nreceives the sum of all previous elements.\nAlso known as\nprefix sums.","source_id":"nist-dads.scan","source_sha256":"b8579e67a02740e05bb1d1435f62ceb2cadcc045a83f0362d60d2d3a512c11bd","start":34}],"target_id":"method.nist.scan","target_kind":"node","target_sha256":"f2e7e3658fe483cc32af0f574f07696196cc3313eb65703fdefd8884e0691314"}],"method.nist.scapegoattree":[{"id":"assertion.method.nist.scapegoattree","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines scapegoat tree as: A binary search tree that needs no balance information. Search time is logarithmic , and the amortized cost of update is logarithmic .","support":[{"end":188,"quote":"A\nbinary search tree\nthat needs no\nbalance\ninformation. Search time is\nlogarithmic\n, and the\namortized cost\nof update is\nlogarithmic\n.","source_id":"nist-dads.scapegoattree","source_sha256":"ca8d26699631e0f5b66239dd88442b33bccecf986dfc7f1293b648e35466efe9","start":54}],"target_id":"method.nist.scapegoattree","target_kind":"node","target_sha256":"92149c038ae7cb9e44884d44d51688b931556f8eeddf9ca1906a890b880aa224"}],"method.nist.search":[{"id":"assertion.method.nist.search","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines search as: Look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches.","support":[{"end":149,"quote":"Look for a value or item in a data structure.  There are dozens of algorithms, data structures, and approaches.","source_id":"nist-dads.search","source_sha256":"6ae86819505e27d7efc139527fa93c055ce8002bbc202c0c63c3c5be0c11b49f","start":38}],"target_id":"method.nist.search","target_kind":"node","target_sha256":"85838381a72d68dcd78b781e296f1a26f7e05b36f1d1f304ef745219aa088d6c"}],"method.nist.secantsearch":[{"id":"assertion.method.nist.secantsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines secant search as: Search a sorted array by estimating the next position to check based on the values at the two previous positions checked.","support":[{"end":173,"quote":"Search a\nsorted array\nby estimating the next position to check based on the values at the two previous positions checked.","source_id":"nist-dads.secantsearch","source_sha256":"5a17c610e140f433ee499ed0b706c095882282b3690199a67ecb3fe254fd1312","start":52}],"target_id":"method.nist.secantsearch","target_kind":"node","target_sha256":"ef457cea68a43598512e60adb85218647a53567bd97d0491cd673b7e1c00ebea"}],"method.nist.select":[{"id":"assertion.method.nist.select","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Select as: A four-part algorithm to select the k th smallest element of an array . Part 1) Consider the array as groups of 5 elements; sort and find the median of each group. 2) Use Select recursively to find x , the median of the medians. 3) Next partition the array around x . 4) Let i be the number of elements in the low side of the partition. If k ≤ i, use Select recursively to find the k th element of the low side. Otherwise Select the k-i th element of the high side.","support":[{"end":509,"quote":"A four-part algorithm to select the k\nth\nsmallest element of an\narray\n.  Part 1) Consider the array as groups of 5 elements; sort and find the\nmedian\nof each group.  2) Use Select\nrecursively\nto find\nx\n, the median of the medians. 3) Next\npartition\nthe array around\nx\n.   4) Let i be the number of elements in the low side of the partition.  If k ≤ i, use Select recursively to find the k\nth\nelement of the low side.  Otherwise Select the k-i\nth\nelement of the high side.","source_id":"nist-dads.select","source_sha256":"49abb127dd47a896be309253eb3af0946b8fec3d8a2f3f691df60b55b57f43a4","start":38}],"target_id":"method.nist.select","target_kind":"node","target_sha256":"25ea3aadd2904e70584bb761f8d9e279844f028ae6aabfba7580ab6f12c785d4"}],"method.nist.selectionsort":[{"id":"assertion.method.nist.selectionsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines selection sort as: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²) , where n is the number of elements. The number of swaps is O(n) .","support":[{"end":260,"quote":"A\nsort\nalgorithm that repeatedly searches remaining items to find the least one and moves it to its final location.  The run time is\nΘ(n²)\n, where n is the number of elements.  The number of swaps is\nO(n)\n.","source_id":"nist-dads.selectionsort","source_sha256":"210824667c4e247cf74c075c7aebf9f2daca04a8c505c5a488650ba1eb6f7d3a","start":54}],"target_id":"method.nist.selectionsort","target_kind":"node","target_sha256":"76ce5b4319b2823a61ecc64ff271c65a28840559e1b3a90d433805131585fa08"}],"method.nist.selectmode":[{"id":"assertion.method.nist.selectmode","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines select mode as: An algorithm to find the mode, or most frequently occurring value, in a group of elements.","support":[{"end":138,"quote":"An algorithm to find the mode, or most frequently occurring value, in a group of elements.","source_id":"nist-dads.selectmode","source_sha256":"8ca4e3c4e1e1aa994b990231e0749e90a457b947609eed03a10fc32211edeac8","start":48}],"target_id":"method.nist.selectmode","target_kind":"node","target_sha256":"d5c18610ff6fd7aadef97615e61a0f5dc4e77e4b0e3cd2e89a3d4820a607a39a"}],"method.nist.shadowmerge":[{"id":"assertion.method.nist.shadowmerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow merge as: An algorithm to merge two heaps by concatenating the smaller heap to the larger, then reordering just the concatenated nodes and their parents to restore the heap property.","support":[{"end":222,"quote":"An algorithm to merge two\nheaps\nby concatenating the smaller heap to the larger, then reordering just the concatenated\nnodes\nand their\nparents\nto restore the heap property.","source_id":"nist-dads.shadowmerge","source_sha256":"028fd17238730e130a40bd39306a8e04222c8d28f1e1078620699d7dd8d57c31","start":50}],"target_id":"method.nist.shadowmerge","target_kind":"node","target_sha256":"7a6a7cda2d95b29239c8b793a964ba3f7f673b9783820fc6a0018d46b82174be"}],"method.nist.shadowmrgins":[{"id":"assertion.method.nist.shadowmrgins","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shadow merge insert as: An algorithm to insert a new node into a shadow heap . The new node is placed in the unordered table. When the table grows beyond some threshold size, table nodes and all their parents are reordered so everything is a heap.","support":[{"end":288,"quote":"An\nalgorithm\nto insert a new\nnode\ninto a\nshadow heap\n. The new node is placed in the unordered table. When the table grows beyond some threshold size, table  nodes and all their\nparents\nare reordered so everything is a heap.","source_id":"nist-dads.shadowmrgins","source_sha256":"6e631a2698a883b4a0af5df15d98f4a9c979d928d51d80414a480fb68df412fa","start":64}],"target_id":"method.nist.shadowmrgins","target_kind":"node","target_sha256":"39c976254b977c6e7d9eb4c08b40084b21927b268f3634e4e03c2f403c298e0f"}],"method.nist.shannonfano":[{"id":"assertion.method.nist.shannonfano","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Shannon-Fano coding as: A variable-length coding based on the frequency of occurrence of each character. Divide the characters into two sets with the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding. Repeatedly divide the sets until each character has a unique coding.","support":[{"end":354,"quote":"A variable-length coding based on the frequency of occurrence of each character.  Divide the characters into two\nsets\nwith the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding.  Repeatedly divide the sets until each character has a unique coding.","source_id":"nist-dads.shannonfano","source_sha256":"20eb6f518528ad31c8e2cd84ea4c4b2f33045b3790b33214910e094499774cd9","start":64}],"target_id":"method.nist.shannonfano","target_kind":"node","target_sha256":"05d8a0188f5bde06ed60be460c370c41c0ccebbefdc307e45c93c8c3e087619d"}],"method.nist.shellsort":[{"id":"assertion.method.nist.shellsort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines Shell sort as: The first diminishing increment sort . On each pass i sets of n/i items are sorted, typically with insertion sort . On each succeeding pass, i is reduced until it is 1 for the last pass. A good series of i values is important to efficiency.","support":[{"end":289,"quote":"The first\ndiminishing increment sort\n.  On each pass i sets of n/i items are sorted, typically with\ninsertion sort\n.  On each succeeding pass, i is reduced until it is 1 for the last pass.  A good series of i values is important to efficiency.","source_id":"nist-dads.shellsort","source_sha256":"cadb664db3f88af94c604e2a509533a265abc9c1ea456f4582e9f50da94468ed","start":46}],"target_id":"method.nist.shellsort","target_kind":"node","target_sha256":"610149a82fd192b79dc73e93919f8231142ae893542097d4f1daa591ae7b46d2"}],"method.nist.shiftor":[{"id":"assertion.method.nist.shiftor","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Shift-Or as: A string matching algorithm which keeps an array of bits, R, showing if prefixes of the pattern don't match at the current place. Before searching, mismatch arrays are computed for each character in the alphabet and saved in an array, S. For the next position, with the character c, R = shift(R) or S[c]. If the last bit of R is 0, the pattern matches.","support":[{"end":397,"quote":"A\nstring matching\nalgorithm which keeps an\narray\nof bits, R, showing if\nprefixes\nof the\npattern\ndon't match at the current place.  Before searching, mismatch arrays are computed for each character in the\nalphabet\nand saved in an array, S.  For the next position, with the character c, R = shift(R)\nor\nS[c].  If the last bit of R is 0, the pattern matches.","source_id":"nist-dads.shiftor","source_sha256":"e6b19706704ac32ed4b4e29214722e60ece8fa7a2944b948a24bb7b4e8a8ffda","start":42}],"target_id":"method.nist.shiftor","target_kind":"node","target_sha256":"96ae4cb5226dd4bcfd22f0f06aa74dc892608c6da1c93231f7f598e8ac106de7"}],"method.nist.shufflesort":[{"id":"assertion.method.nist.shufflesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines shuffle sort as: A distribution sort algorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array. This creates n/8 buckets to which the remaining 7/8 of the items are distributed. Each bucket is then sorted, and the buckets are concatenated.","support":[{"end":337,"quote":"A\ndistribution sort\nalgorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array.  This creates n/8\nbuckets\nto which the remaining 7/8 of the items are distributed.  Each bucket is then sorted, and the buckets are concatenated.","source_id":"nist-dads.shufflesort","source_sha256":"4618771755724face5fa21724679321b2a993a9f1cb201fb406725410ee78980","start":50}],"target_id":"method.nist.shufflesort","target_kind":"node","target_sha256":"16a532fd2752f9f82c52f46628826892feecae7a9805a8ab5e3014ff1ee48e62"}],"method.nist.sieve":[{"id":"assertion.method.nist.sieve","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sieve of Eratosthenes as: An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked) array of integers from 2 to N. The first unmarked integer, 2, is the first prime. Mark every multiple of this prime. Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","support":[{"end":368,"quote":"An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked)\narray\nof integers from 2 to N.  The first unmarked integer, 2, is the first prime.  Mark every multiple of this prime.  Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","source_id":"nist-dads.sieve","source_sha256":"22cdbc297a359d85a643bc5485fcb969adb9f95fec137a208b15b3bfab98420e","start":68}],"target_id":"method.nist.sieve","target_kind":"node","target_sha256":"c180391ee95b2bba5e69ead5331f2c4f7b049287663a436fedfd14ebebfe8523"}],"method.nist.siftup":[{"id":"assertion.method.nist.siftup","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sift up as: Restoring the heap property by swapping a node with its parent , and repeating the process on the parent until the root is reached or the heap property is satisfied.","support":[{"end":205,"quote":"Restoring the\nheap property\nby swapping a\nnode\nwith its\nparent\n, and repeating the process on the parent until the\nroot\nis reached or the heap property is satisfied.","source_id":"nist-dads.siftup","source_sha256":"2b8528e624e6b05c7b61934f08c0a11288f382800fcf43324fbdf25c5e05671f","start":40}],"target_id":"method.nist.siftup","target_kind":"node","target_sha256":"ffff2ccaa7ea92f4ed6a7dee86f97660e5aa967e6442df2132fbba151b150b47"}],"method.nist.simplemerge":[{"id":"assertion.method.nist.simplemerge","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simple merge as: Merge n sorted streams into one output stream. All the stream heads are compared, and the head with the least key is removed and written to the output. This is repeated until all streams are empty.","support":[{"end":247,"quote":"Merge\nn sorted streams into one output stream. All the stream heads are compared, and the head with the least\nkey\nis removed and written to the output. This is repeated until all streams are empty.","source_id":"nist-dads.simplemerge","source_sha256":"b344fc608739a11e0dec63bed512eec32476278f8401573a0b997639afe00314","start":50}],"target_id":"method.nist.simplemerge","target_kind":"node","target_sha256":"3b4ff152a5819830becafbe61e27d60e511ab6fd7428691ea4532746955517c3"}],"method.nist.simulatedannealing":[{"id":"assertion.method.nist.simulatedannealing","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines simulated annealing as: A technique to find a good solution to an optimization problem by trying random variations of the current solution. A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds. The slower the cooling schedule , or rate of decrease, the more likely the algorithm is to find an optimal or near- optimal solution .","support":[{"end":429,"quote":"A technique to find a good solution to an\noptimization problem\nby trying random variations of the current solution.  A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds.  The slower the\ncooling schedule\n, or rate of decrease, the more likely the algorithm is to find an optimal or near-\noptimal solution\n.","source_id":"nist-dads.simulatedannealing","source_sha256":"99fcaae80e16487f142705cf1653792ef0cb63e48786d4a28fcd9ae8d7f8f7fd","start":64}],"target_id":"method.nist.simulatedannealing","target_kind":"node","target_sha256":"4b663e50151cd2f8f0ff0b629995bd846a5df65fef176a1f826d5a15c5b9d7d8"}],"method.nist.smithalgorithm":[{"id":"assertion.method.nist.smithalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Smith algorithm as: A string matching algorithm which computes the shift value for both the rightmost character of the window and the character preceding it, then uses the maximum of the two values.","support":[{"end":234,"quote":"A\nstring matching\nalgorithm which computes the shift value for both the rightmost character of the\nwindow\nand the character preceding it, then uses the maximum of the two values.","source_id":"nist-dads.smithalgorithm","source_sha256":"0850c75f8bee323ac86e94136528453e586e2622abcdfe4715ea652e3977516d","start":56}],"target_id":"method.nist.smithalgorithm","target_kind":"node","target_sha256":"421357ebd3164a09b14cf924f70878b9c31f366505ff4107bd3caf81eea17a8e"}],"method.nist.smithwaterman":[{"id":"assertion.method.nist.smithwaterman","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Smith-Waterman algorithm as: A means of searching protein databases to find those with the best alignment.","support":[{"end":151,"quote":"A means of searching protein databases to find those with the best alignment.","source_id":"nist-dads.smithwaterman","source_sha256":"a9a4a20178d679955780bd54aa324f220f9b7e02c870e6429186a349b9433020","start":74}],"target_id":"method.nist.smithwaterman","target_kind":"node","target_sha256":"617fb56790014ab894912cc529d03cc2517179dbf580d5b224c908605a0a7f64"}],"method.nist.smoothsort":[{"id":"assertion.method.nist.smoothsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines smoothsort as: A variant of heapsort that takes advantage of a partially ordered table. Performance is O(n) when input is sorted and O(n log n) performance for worst case .","support":[{"end":205,"quote":"A variant of\nheapsort\nthat takes advantage of a partially ordered table.  Performance is O(n) when input is sorted and O(n log n)  performance for\nworst case\n.","source_id":"nist-dads.smoothsort","source_sha256":"317f9917a6777a9a458a15fca638f69be38bba73d846222a7226c24cc97a3fb4","start":46}],"target_id":"method.nist.smoothsort","target_kind":"node","target_sha256":"6c92602498ae8ec7c8ff47a0aed46a4ff7524b647786ebef1177df64a3405011"}],"method.nist.sort":[{"id":"assertion.method.nist.sort","scope":{"assumptions":"Descriptive definition; not an experimental performance or historical priority claim","population":"The named algorithm or data-structure definition in NIST DADS","quantifiers":"Only the conditions expressly included in the captured definition","time":null,"uncertainty":"Dictionary attribution; no claim of empirical validation, consensus, or frontier status","units":null},"statement":"NIST DADS defines sort as: Arrange items in a predetermined order. There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the keys , the cost of comparing keys vs. the cost of moving items, etc. Most algorithms can be implemented as an in-place sort , and many can be implemented so they are stable , too. Formal Definition: The sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows. S′ i ≤ S′ i+1 , 0 < i < N (the items are in order) and S′ is a permutation of S.","support":[{"end":657,"quote":"Arrange items in a predetermined order.  There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the\nkeys\n, the cost of comparing keys vs. the cost of moving items, etc.  Most algorithms can be implemented as an\nin-place sort\n, and many can be implemented so they are\nstable\n, too.\nFormal Definition:\nThe sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows.\nS′\ni\n≤ S′\ni+1\n, 0 < i < N\n(the items are in order) and\nS′ is a\npermutation\nof S.","source_id":"nist-dads.sort","source_sha256":"1055fa7ba1c68225a4a1cf591d06992d50dacfdb9bcbda468d358c54b591a155","start":34}],"target_id":"method.nist.sort","target_kind":"node","target_sha256":"eadc23976a278bfde0e02cc3283c035f52f19cca358574433b07040f474452e7"}],"method.nist.soundex":[{"id":"assertion.method.nist.soundex","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines soundex as: An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds. This reduces matching problems from different spellings.","support":[{"end":250,"quote":"An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds.  This reduces matching problems from different spellings.","source_id":"nist-dads.soundex","source_sha256":"c661440783005c9ddc2a95f9b915fb9e6d847588033d82245ab044d633dacf6a","start":40}],"target_id":"method.nist.soundex","target_kind":"node","target_sha256":"00ea55100c4ae1c765c5cceeecb6daa1d93ad6d70225b422cbc8d282989d035d"}],"method.nist.spaceorderingmethod":[{"id":"assertion.method.nist.spaceorderingmethod","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines space ordering method as: A mapping from a discrete k-dimensional space into a linear order.","support":[{"end":134,"quote":"A mapping from a discrete k-dimensional space into a linear order.","source_id":"nist-dads.spaceorderingmethod","source_sha256":"72754115f9746f77d7730720bad00eac8e283a8b2164a12b17723908df148af0","start":68}],"target_id":"method.nist.spaceorderingmethod","target_kind":"node","target_sha256":"20d79fdc2e76afe2653d1b8f7d297cf138f103800b247fec11d8f4fa9cf76109"}],"method.nist.sparsificatn":[{"id":"assertion.method.nist.sparsificatn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines sparsification as: Technique for designing dynamic graph algorithms , which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of edges and n is the number of vertices of the given graph.","support":[{"end":270,"quote":"Technique for designing dynamic\ngraph\nalgorithms\n, which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of\nedges\nand n is the number of\nvertices\nof the given graph.","source_id":"nist-dads.sparsificatn","source_sha256":"1ea60d43af8a0ce48d438b2fc02708ba793de5479e339622f968017a66bfc133","start":66}],"target_id":"method.nist.sparsificatn","target_kind":"node","target_sha256":"6c1df8d4c5f8ac7021bbc570f0f65c0f3efc24d77a578d4bb316375b3dd5f925"}],"method.nist.starencoding":[{"id":"assertion.method.nist.starencoding","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines star encoding as: Using a fixed dictionary , encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","support":[{"end":182,"quote":"Using a fixed\ndictionary\n, encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","source_id":"nist-dads.starencoding","source_sha256":"90a89b4c0a1edbef819250b6509b86bd205fd7d1979c265abad09b0d19ebcf3e","start":52}],"target_id":"method.nist.starencoding","target_kind":"node","target_sha256":"99d4f1c8d800819306a9a182e047fde27695351d8d839b4bc60081bfbe4ad203"}],"method.nist.stoogesort":[{"id":"assertion.method.nist.stoogesort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stooge sort as: A terribly inefficient sort algorithm that swaps the top and bottom items if needed, then ( recursively ) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","support":[{"end":241,"quote":"A terribly inefficient\nsort\nalgorithm that swaps the top and bottom items if needed, then (\nrecursively\n) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","source_id":"nist-dads.stoogesort","source_sha256":"5875a1bfea305431af56773c0a16a9cc1fc8a2e661110524e49cf3ff0db03fac","start":48}],"target_id":"method.nist.stoogesort","target_kind":"node","target_sha256":"6406bb87229ef9cc7f6e02530d587a48dfd7f2a2dfd6138c647ca39452cc9218"}],"method.nist.strandsort":[{"id":"assertion.method.nist.strandsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strand sort as: A sort algorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist. For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist. Merge the sublist into a final, sorted list. Repeatedly extract and merge sublists until all items are sorted. Handle two or fewer items as special cases.","support":[{"end":516,"quote":"A\nsort\nalgorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist.  For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist.\nMerge\nthe sublist into a final, sorted list.  Repeatedly extract and merge  sublists until all items are sorted.  Handle two or fewer items as special cases.","source_id":"nist-dads.strandsort","source_sha256":"3f3aa4106813c013246100fa0083845ee9bf2c64e71e186145fe373f7999dd78","start":48}],"target_id":"method.nist.strandsort","target_kind":"node","target_sha256":"f6dbc4a8ebd40ec8b24291d7092349d8ed6d5c91a738212b3c92fa370bc67483"}],"method.nist.stringmatchwerror":[{"id":"assertion.method.nist.stringmatchwerror","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string matching with errors as: Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string. Preprocessing, e.g., building an index, may or may not be allowed. Also known as approximate string matching.","support":[{"end":348,"quote":"Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string.  Preprocessing, e.g., building an index, may or may not be allowed.\nAlso known as\napproximate string matching.","source_id":"nist-dads.stringmatchwerror","source_sha256":"aab04c10028533d7980eb204bd7e6dfc34efda9301b488cd89f8ef8bc2fe6cf7","start":80}],"target_id":"method.nist.stringmatchwerror","target_kind":"node","target_sha256":"baa21d8195bf149872e2f1af4878cc723b492a0c4221b7780e6d39640d5cf3fa"}],"method.nist.stringmatchwmismatch":[{"id":"assertion.method.nist.stringmatchwmismatch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines string matching with mismatches as: The special case of string matching with errors where mismatches are the only type of error allowed.","support":[{"end":188,"quote":"The special case of\nstring matching with errors\nwhere mismatches are the only type of error allowed.","source_id":"nist-dads.stringmatchwmismatch","source_sha256":"177b70bbfcb002dbbc119c27cad553cfcb36628e72051ef1b38a1732754352f0","start":88}],"target_id":"method.nist.stringmatchwmismatch","target_kind":"node","target_sha256":"8ffd3c15fba98022ccfa4e15d1341911de46a53cf37f2251e4c2585be2727aa1"}],"method.nist.strsrch":[{"id":"assertion.method.nist.strsrch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines strsrch as: Find occurrences of a substring in a target string by trying the substring at each possible location in the string. Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","support":[{"end":258,"quote":"Find occurrences of a\nsubstring\nin a target\nstring\nby trying the substring at each possible location in the string.  Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","source_id":"nist-dads.strsrch","source_sha256":"b9b179c6023d878d07a9cfeeaec01f4c1ba30c03c536f3c1d02c0649cf2224e8","start":40}],"target_id":"method.nist.strsrch","target_kind":"node","target_sha256":"2c3be498d1b4ea4990039f0bab2d01df819cbfe9d3772c387dce646ef8812c09"}],"method.nist.stupidsort":[{"id":"assertion.method.nist.stupidsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines stupid sort as: (1) The original name of gnome sort . (2) An alternate name for bogosort .","support":[{"end":122,"quote":"(1) The original name of\ngnome sort\n. (2) An alternate name for\nbogosort\n.","source_id":"nist-dads.stupidsort","source_sha256":"9e20bf0443b93c851d392214c70eee2d4f419812212822e26f217d712b3cc38b","start":48}],"target_id":"method.nist.stupidsort","target_kind":"node","target_sha256":"1685b954070874da62e917a6b17ac904ab1f555cb3b680961e2fe070be782cd1"}],"method.nist.symmetrybrek":[{"id":"assertion.method.nist.symmetrybrek","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines symmetry breaking as: To differentiate parts of a structure, such as a graph , which locally look the same to all vertices . Usually implemented with randomization .","support":[{"end":216,"quote":"To differentiate parts of a structure, such as a\ngraph\n, which locally look the same to all\nvertices\n.  Usually implemented with\nrandomization\n.","source_id":"nist-dads.symmetrybrek","source_sha256":"328c4637788eb1db8c3bdda70ec8091044808f9e0a701ca78b521b3f5243b7e6","start":72}],"target_id":"method.nist.symmetrybrek","target_kind":"node","target_sha256":"464fc1b10aa5678f65546f81cbe3c06d48521b30b71ffffc9c9cbce5ee12eff3"}],"method.nist.tailrecursion":[{"id":"assertion.method.nist.tailrecursion","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tail recursion as: A special form of recursion where the last operation of a function is a recursive call. The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","support":[{"end":304,"quote":"A special form of\nrecursion\nwhere the last operation of a function is a recursive call.  The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","source_id":"nist-dads.tailrecursion","source_sha256":"03763f16730b90bc923f96a38f78b2dc5a1d56a96327501421ba77c1af65de9a","start":66}],"target_id":"method.nist.tailrecursion","target_kind":"node","target_sha256":"5a9ba7972b5ecba34f81eba1c0e767edf2c0134352a94d777bf236853823e185"}],"method.nist.threewaymsrt":[{"id":"assertion.method.nist.threewaymsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines three-way merge sort as: A k-way merge sort which uses three input and three output streams.","support":[{"end":133,"quote":"A\nk-way merge sort\nwhich uses three input and three output streams.","source_id":"nist-dads.threewaymsrt","source_sha256":"9fbe69facb916916972623165db8040bcabc9c430dc5eaf090a19301fdcba3d0","start":66}],"target_id":"method.nist.threewaymsrt","target_kind":"node","target_sha256":"519561b46aaf97dde72a8250703d9a06d028a1f29d4df781bb928da796ce473e"}],"method.nist.topdownradixsort":[{"id":"assertion.method.nist.topdownradixsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines top-down radix sort as: A recursive bucket sort where elements are distributed based on succeeding pieces (characters) of the key .","support":[{"end":171,"quote":"A recursive\nbucket sort\nwhere elements are distributed based on succeeding pieces (characters) of the\nkey\n.","source_id":"nist-dads.topdownradixsort","source_sha256":"dff8c7b4b14efb283dbab1d62e23d911c57ddb4900e827d43a0adf69e8ea0d66","start":64}],"target_id":"method.nist.topdownradixsort","target_kind":"node","target_sha256":"188b7b364582ca5d4bc45c1ff66d0234cad9364c448ea6de6f740dc2cc331e9c"}],"method.nist.tournament":[{"id":"assertion.method.nist.tournament","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tournament as: Find the maximum of a set of n elements in ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round. It takes n-1 comparisons, like linear search , but may be parallelized, extended to also find the second greatest element, etc.","support":[{"end":354,"quote":"Find the maximum of a set of n elements in  ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round.  It takes n-1 comparisons, like\nlinear search\n, but may be parallelized, extended to also find the second greatest element, etc.","source_id":"nist-dads.tournament","source_sha256":"d44a5e77a6dcad4b38aa84c0c7cc486b055eb0250bda999dcf754eca56abddd8","start":46}],"target_id":"method.nist.tournament","target_kind":"node","target_sha256":"76ded0bc4b792d6474af5e3a985117c5935a782bede4e0a8c7007fcb363a2bf0"}],"method.nist.transposeseqsearch":[{"id":"assertion.method.nist.transposeseqsearch","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines transpose sequential search as: Search an array or list by checking items one at a time. If the value is found, swap it with its predecessor so it is found faster next time. Also known as self-organizing sequential search.","support":[{"end":271,"quote":"Search an\narray\nor\nlist\nby checking items one at a time.  If the value is found, swap it with its predecessor so it is found faster next time.\nAlso known as\nself-organizing sequential search.","source_id":"nist-dads.transposeseqsearch","source_sha256":"b5c1bd884ffa91e1096215e30a022e9070dc9ed6923517dd6d9076624692d162","start":80}],"target_id":"method.nist.transposeseqsearch","target_kind":"node","target_sha256":"456c8c6e89b7379b685c0f66ddccc5b08837b506d579aacec936baff48d37ea5"}],"method.nist.treesort1":[{"id":"assertion.method.nist.treesort1","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treesort (1) as: A sort algorithm that first builds a binary search tree of the keys , then accesses the keys with an in-order traversal .","support":[{"end":171,"quote":"A\nsort\nalgorithm that first builds a\nbinary search tree\nof the\nkeys\n, then accesses the keys with an\nin-order traversal\n.","source_id":"nist-dads.treesort1","source_sha256":"d36b4fc56d13b700220aeb7938d6fa3543b6a5245a00f79eb5d3cce8dfbaa435","start":50}],"target_id":"method.nist.treesort1","target_kind":"node","target_sha256":"62a39c79b825c964b8f870eaae60d2309488f761d21ebffc3ab04c8495965970"}],"method.nist.treesort2":[{"id":"assertion.method.nist.treesort2","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines treesort (2) as: Variants of heapsort .","support":[{"end":72,"quote":"Variants of\nheapsort\n.","source_id":"nist-dads.treesort2","source_sha256":"5ed6f7942d424b598b85321d038c96c0a4af152734b059370702fa887d954704","start":50}],"target_id":"method.nist.treesort2","target_kind":"node","target_sha256":"f8ac0ac4b96222acdb7e848fefdeb32617ede8fc3461e633d1d107be61c6d396"}],"method.nist.tripartition":[{"id":"assertion.method.nist.tripartition","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines tripartition as: To partition array elements into three groups.","support":[{"end":96,"quote":"To\npartition\narray\nelements into three groups.","source_id":"nist-dads.tripartition","source_sha256":"936e002fb8dc1eb4faf086b979dd0328aed2d5c9fc20bab570704ef7f28d98c8","start":50}],"target_id":"method.nist.tripartition","target_kind":"node","target_sha256":"e920c9188292046ae822eb98843fded313d9f31e16ff2e0add5ff7f626dc92c2"}],"method.nist.twoway":[{"id":"assertion.method.nist.twoway","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Two Way algorithm as: Partition (\"factor\") the pattern , x, into left, x l , and right, x r , parts in such a way to optimize searching. Compare x r left to right then, if it matches, compare x l right to left.","support":[{"end":249,"quote":"Partition\n(\"factor\") the\npattern\n, x, into left, x\nl\n, and right, x\nr\n, parts in such a way to optimize searching.  Compare x\nr\nleft to right then, if it matches, compare x\nl\nright to left.","source_id":"nist-dads.twoway","source_sha256":"d56413f45c672176078d3fc34e8614287c81437b322195a90e384bcafd9f5ea7","start":60}],"target_id":"method.nist.twoway","target_kind":"node","target_sha256":"fa083f7815267df1b236183346a11fc5af13e1c6e1a480d9da0d30164418d84c"}],"method.nist.twowaymrgsrt":[{"id":"assertion.method.nist.twowaymrgsrt","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines two-way merge sort as: A k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It merges runs from the two streams into an output stream. It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","support":[{"end":483,"quote":"A\nk-way merge sort\nthat sorts a data stream using repeated merges.  It distributes the input into two streams by repeatedly reading a\nblock\nof input that fits in memory, a\nrun\n, sorting it, then writing it to the next stream.  It merges runs from the two streams into an output stream.  It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","source_id":"nist-dads.twowaymrgsrt","source_sha256":"3db11fc076116faf508c8a4c0cad6e00c43f090be11f9f2bafa1ed260271e0ca","start":62}],"target_id":"method.nist.twowaymrgsrt","target_kind":"node","target_sha256":"720a6617d55cdbbae898d61e7c6b14090ab487b187683d8a48b8b8497265c87f"}],"method.nist.unbiasedcoinflipalgo":[{"id":"assertion.method.nist.unbiasedcoinflipalgo","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unbiased coin flipping algorithm as: To get unbiased random bits, flip a coin twice. If it comes up heads then tails, the result bit is 1. It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","support":[{"end":294,"quote":"To get unbiased random bits, flip a coin twice.  If it comes up heads then tails, the result bit is 1.  It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","source_id":"nist-dads.unbiasedcoinflipalgo","source_sha256":"dc07b535a46c96ee03a273f4218ecc332788754685e2798c8cb6958f90e9ec8d","start":90}],"target_id":"method.nist.unbiasedcoinflipalgo","target_kind":"node","target_sha256":"a5612343f367144a617328a355f9611d3cf2c3c85c8ee1c2d547647eee0ebe47"}],"method.nist.uniformhashn":[{"id":"assertion.method.nist.uniformhashn","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines uniform hashing as: A conceptual method of open addressing for a hash table . A collision is resolved by putting the item in the next empty place given by a probe sequence which is independent of sequences for all other key .","support":[{"end":261,"quote":"A conceptual method of\nopen addressing\nfor a\nhash table\n. A\ncollision\nis resolved by putting the item in the next empty place given by a\nprobe sequence\nwhich is independent of sequences for all other\nkey\n.","source_id":"nist-dads.uniformhashn","source_sha256":"9be915357107cb6d540d9d71984a908a948a37c41a248f34cade23aeb3ea9cff","start":56}],"target_id":"method.nist.uniformhashn","target_kind":"node","target_sha256":"4a8d238005b979a09064bce62aa449b0f7759066a52011fb3fa8ae3b6ac7127d"}],"method.nist.unionautoma":[{"id":"assertion.method.nist.unionautoma","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines union of automata as: Find an automaton that accepts everything which the automata accept individually.","support":[{"end":141,"quote":"Find an\nautomaton\nthat accepts everything which the automata accept individually.","source_id":"nist-dads.unionautoma","source_sha256":"678b9b04d08a3d506ada7f9cfe6c8fd78d5b9cb7a80c96e5bf24a2d001a7f115","start":60}],"target_id":"method.nist.unionautoma","target_kind":"node","target_sha256":"65c6f57ace665c8088e778670de05d20550a880dd07fe14af5d6237c0e52aea6"}],"method.nist.unrank":[{"id":"assertion.method.nist.unrank","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines unranking as: Given a ranking, r, generate the r th permutation of n elements.","support":[{"end":108,"quote":"Given a ranking, r, generate the r\nth\npermutation\nof n elements.","source_id":"nist-dads.unrank","source_sha256":"031dcc89f7bdcd19b18b8cb8a43ea016391d8488709dd9068d458c48d34f228f","start":44}],"target_id":"method.nist.unrank","target_kind":"node","target_sha256":"b45485b49deb844b295edbee1f7e13379021c44a65abfd1b71796b5f80887291"}],"method.nist.unshufflsort":[{"id":"assertion.method.nist.unshufflsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines UnShuffle sort as: A distribution sort with two phases. In the first phase, the inputs are distributed among doubly-ended queues keeping the items in each queue ordered and creating a new queue when there is no place on an existing queue. The second phase is an ideal merge in which the item to be removed is determined by keeping the queues in a priority queue .","support":[{"end":400,"quote":"A\ndistribution sort\nwith two phases.  In the first phase, the inputs are distributed among\ndoubly-ended queues\nkeeping the items in each queue ordered and creating a new queue when there is no place on an existing queue.  The second phase is an\nideal merge\nin which the item to be removed is determined by keeping the queues in a\npriority queue\n.","source_id":"nist-dads.unshufflsort","source_sha256":"acd3bd7cde8feeda5fd19dd87fa5594224295a841b94ef727ba12c50d358bceb","start":54}],"target_id":"method.nist.unshufflsort","target_kind":"node","target_sha256":"56ac3d8b77ab0b6adcc77e1ed6d274ef279275779d52e2e19c2c0e883fc43114"}],"method.nist.viterbialgorithm":[{"id":"assertion.method.nist.viterbialgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Viterbi algorithm as: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.","support":[{"end":187,"quote":"An algorithm to compute the optimal (most likely) state sequence in a\nhidden Markov model\ngiven a sequence of observed outputs.","source_id":"nist-dads.viterbialgorithm","source_sha256":"d8cbd1dc410afd97de5f0e088648e556e6f18ceb9195988669f6cdb217917c30","start":60}],"target_id":"method.nist.viterbialgorithm","target_kind":"node","target_sha256":"286e10d66fb56868b4ebe2bdcd97228490d0be77ec6fbad105e316a1445725e5"}],"method.nist.vittersalgorithm":[{"id":"assertion.method.nist.vittersalgorithm","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Vitter's algorithm as: An adaptive Huffman coding scheme. Typically this produces codings the same length as or shorter than static Huffman coding . In the worst case , this uses one more bit per codeword .","support":[{"end":246,"quote":"An\nadaptive Huffman coding\nscheme.  Typically this produces codings the same length as or shorter than static\nHuffman coding\n. In the\nworst case\n, this uses one more bit per\ncodeword\n.","source_id":"nist-dads.vittersalgorithm","source_sha256":"506e3bb9d62fea05a18057be5369ec4e58066a22e487aed62afa45290c796baa","start":62}],"target_id":"method.nist.vittersalgorithm","target_kind":"node","target_sha256":"e326ff0c06e1919785fca3d3c6b9c2cc8154d6c0d37bc0049ed092cf4b7f2feb"}],"method.nist.weakheapsort":[{"id":"assertion.method.nist.weakheapsort","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines weak-heap sort as: A sort algorithm that builds a weak-heap , then repeatedly extracts the maximum item. In the worst case , the run time is O(n log n + 0.1 n) .","support":[{"end":197,"quote":"A\nsort\nalgorithm that builds a\nweak-heap\n, then repeatedly extracts the maximum item.  In the\nworst case\n, the run time is\nO(n log n + 0.1 n)\n.","source_id":"nist-dads.weakheapsort","source_sha256":"3af6a0bd4c69b5a20f4ba07c1496b9e19f99c601bfa573de68b8908690f57189","start":54}],"target_id":"method.nist.weakheapsort","target_kind":"node","target_sha256":"c7dd34004bc30c78ae716e3a309e89474585c46cbb51bd27e1a4b445ced8d0f8"}],"method.nist.zellerscongruence":[{"id":"assertion.method.nist.zellerscongruence","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zeller's congruence as: An algorithm to find the day of the week for any date.","support":[{"end":118,"quote":"An algorithm to find the day of the week for any date.","source_id":"nist-dads.zellerscongruence","source_sha256":"a8ff2f6361f9fc90fe037cac4f7d782d09ea113445031b56b96e1e5961ad4f69","start":64}],"target_id":"method.nist.zellerscongruence","target_kind":"node","target_sha256":"17f1dec333c8e49cc61ab90a48346dd267a0386b2c20ab2c153bf45e4fd2175c"}],"method.nist.zhutakaoka":[{"id":"assertion.method.nist.zhutakaoka","scope":{"assumptions":"Descriptive publisher attribution only; no unqualified performance, invention or experimental authority","population":"The named definition in the NIST Dictionary of Algorithms and Data Structures","quantifiers":"Only the conditions explicitly present in the captured definition","time":null,"uncertainty":"Acceptance, chronology and current frontier standing unresolved","units":null},"statement":"NIST DADS defines Zhu-Takaoka as: A string matching algorithm that is a variant of the Boyer-Moore algorithm. It uses two consecutive text characters to compute the bad character shift. It is faster when the alphabet or pattern is small, but the skip table grows quickly, slowing the pre-processing phase.","support":[{"end":321,"quote":"A\nstring matching\nalgorithm that is a variant of the\nBoyer-Moore\nalgorithm.  It uses two consecutive text characters to compute the bad character shift.  It is faster when the\nalphabet\nor\npattern\nis small, but the skip table grows quickly, slowing the pre-processing phase.","source_id":"nist-dads.zhutakaoka","source_sha256":"456c2d18d0fdc15b0645114458ba6ea2e857b5581455df3db1770159d5d85b8e","start":48}],"target_id":"method.nist.zhutakaoka","target_kind":"node","target_sha256":"64f9c1797b69a551469b8bde3897f5d05e693dd25b2217f42275c58ce140026a"}],"method.single-graviton-quantum-sensing":[{"id":"assertion.complete.method.single-graviton-quantum-sensing","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Quantum sensing proposal for single-graviton exchange signatures.","support":[{"end":1443,"quote":"The quantization of gravity is widely believed to result in gravitons -- particles of discrete energy that form gravitational waves. But their detection has so far been considered impossible. Here we show that signatures of single graviton exchange can be observed in laboratory experiments. We show that stimulated and spontaneous single-graviton processes can become relevant for massive quantum acoustic resonators and that stimulated absorption can be resolved through continuous sensing of quantum jumps. We analyze the feasibility of observing the exchange of single energy quanta between matter and gravitational waves. Our results show that single graviton signatures are within reach of experiments. In analogy to the discovery of the photo-electric effect for photons, such signatures can provide the first experimental clue of the quantization of gravity.","source_id":"completion-source.c3fd2ff048f4ab5e51f1","source_sha256":"c9ed5d040eb702c4487c53daad529efbe4503831d59f32a671eef5d0622c3666","start":577}],"target_id":"method.single-graviton-quantum-sensing","target_kind":"node","target_sha256":"dee2ccabc8ab62cbe258423d7186a32506f0ced2199eb5df7a235f5843900dff"}],"ology.andrology":[{"id":"assertion.complete.ology.andrology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Andrology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Andrology as: A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include ENDOCRINOLOGY ; SPERMATOGENESIS ; SEMEN ANALYSIS ; FERTILIZATION ; CONTRACEPTION ; and CRYOPRESERVATION .","support":[{"end":658,"quote":"A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include\nENDOCRINOLOGY\n;\nSPERMATOGENESIS\n;\nSEMEN ANALYSIS\n;\nFERTILIZATION\n;\nCONTRACEPTION\n; and\nCRYOPRESERVATION\n.","source_id":"nlm-mesh.47e3bfae5378d264a4a6","source_sha256":"22342bde576af2b2e1957e6053513d34ef89a5ecdd8e2b6c1ece9549eb056c4a","start":376}],"target_id":"ology.andrology","target_kind":"node","target_sha256":"25cce35aa909d4643d5d6337cc92c2812c083fe99337438829a8d24093ccbe57"}],"ology.audiology":[{"id":"assertion.complete.ology.audiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Audiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Audiology as: Allied medical specialty that studies hearing and hearing impairment.","support":[{"end":621,"quote":"Allied medical specialty that studies hearing and hearing impairment.","source_id":"nlm-mesh.6358ed9b75543994a867","source_sha256":"de37eea7706082cb13ce02d449f3cfce2f81f68ec5614478ea938ee0d50fa169","start":552}],"target_id":"ology.audiology","target_kind":"node","target_sha256":"f5e1005bcfc5acabebb4c2e13a4cfd2521fb872db8c6a3e4dc87c89c95af3a97"}],"ology.bacteriology":[{"id":"assertion.complete.ology.bacteriology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Bacteriology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Bacteriology as: Study of the single celled microorganisms known as bacteria.","support":[{"end":175,"quote":"Study of the single celled microorganisms known as bacteria.","source_id":"usgs-thesaurus.2638b993d82a3ee7dc55","source_sha256":"41075a31d0022f6078d2ba23acc6938a22c25b02068229e9f84a148d55e59a91","start":115}],"target_id":"ology.bacteriology","target_kind":"node","target_sha256":"08505d08a880d153667e386326cbb42e84840783a5c1e33ddb498fd35a3d8eec"}],"ology.bionics":[{"id":"assertion.complete.ology.bionics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Bionics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Bionics as: The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","support":[{"end":686,"quote":"The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","source_id":"nlm-mesh.96b0d9c21edd54e642e5","source_sha256":"a5cbc5b5407db399a19754152d014205cf51a7bdc147b1be335b9f2af83a065b","start":431}],"target_id":"ology.bionics","target_kind":"node","target_sha256":"524d4fb49401a7fb0bd4f3dabc979edc27e96b28da1f8a22ffcc71f42ec429f1"}],"ology.biotechnology":[{"id":"assertion.complete.ology.biotechnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Biotechnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Biotechnology as: Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e., GENETIC ENGINEERING ) is a central focus; laboratory methods used include TRANSFECTION and CLONING technologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","support":[{"end":843,"quote":"Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e.,\nGENETIC ENGINEERING\n) is a central focus; laboratory methods used include\nTRANSFECTION\nand\nCLONING\ntechnologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","source_id":"nlm-mesh.e21655cf4050fe8a0ce0","source_sha256":"80ae877d7528421cbb32d5673363532f23c7d22ce6a412421360964cfcfd310a","start":354}],"target_id":"ology.biotechnology","target_kind":"node","target_sha256":"442b91a0eafad769a1d11554289222da29cb5cfb912bc53affbc81815ebe91f5"}],"ology.cardiology":[{"id":"assertion.complete.ology.cardiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cardiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cardiology as: The study of the heart, its physiology, and its functions.","support":[{"end":531,"quote":"The study of the heart, its physiology, and its functions.","source_id":"nlm-mesh.ef1675e27d8e1b53b18d","source_sha256":"9ea8d11ffbca78ff16ee1fa968e789b0eabc7801b76549e01e0472ad44f61082","start":473}],"target_id":"ology.cardiology","target_kind":"node","target_sha256":"9cbe277168de70924d219d2c4d87d3de8d0c71e0f033543bdaf439b4a6dd5eaf"}],"ology.cell-biology":[{"id":"assertion.complete.ology.cell-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Cell biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Cell biology as: Branch of biology that deals with the study of the formation, structure, and physiology of cells.","support":[{"end":197,"quote":"Branch of biology that deals with the study of the formation, structure, and physiology of cells.","source_id":"usgs-thesaurus.54dbaf6b936415d8d2d7","source_sha256":"520e14d2014bc32d3b2f734d0894a03fd90513e094684b8bcb701e1c1de5bd6f","start":100}],"target_id":"ology.cell-biology","target_kind":"node","target_sha256":"3fcb0df5a65aece58e35100576bb90a4dc3828e067028e749490e39a2f7d3161"}],"ology.cognitive-psychology":[{"id":"assertion.complete.ology.cognitive-psychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus; proposed information-domain grouping is additionally evidenced by explicit MeSH Cognitive Science ancestry and the retained parent scope including computer science; this is not a claim that all psychology is information science","population":"Cognitive psychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved; crosswalk from publisher vocabulary to this coarse domain is an explicit author proposal requiring independent review","units":null},"statement":"NLM MeSH describes Cognitive psychology as: Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","support":[{"end":662,"quote":"Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","source_id":"nlm-mesh.84e5e4de8f730357653e","source_sha256":"14391759697fb5917c72b647049e5986e43c819eda2513fab0ce1b8686f9211c","start":386},{"end":2431,"quote":"Cognitive Science [F04.096.628.255]\nCognitive Neuroscience [F04.096.628.255.500]\nCognitive Psychology [F04.096.628.255.750]","source_id":"nlm-mesh.84e5e4de8f730357653e","source_sha256":"14391759697fb5917c72b647049e5986e43c819eda2513fab0ce1b8686f9211c","start":2308},{"end":601,"quote":"The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","source_id":"nlm-mesh.3afa87c4efa263dea007","source_sha256":"83d06c651636977640e1defba29a2d0d0dd301b3d5eaf03889e4055d2b8239a5","start":354}],"target_id":"ology.cognitive-psychology","target_kind":"node","target_sha256":"ba67628438901552cd9151e339ce500fb5674783676bfb19b67f4f08cde69d49"}],"ology.computational-biology":[{"id":"assertion.complete.ology.computational-biology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Computational biology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Computational biology as: A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","support":[{"end":787,"quote":"A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","source_id":"nlm-mesh.e55950fe926d0ebee0e8","source_sha256":"724c6eb576f6dc29c8f6259ec9bbc1cfad51d79c9824773c7400d95408892c3e","start":455}],"target_id":"ology.computational-biology","target_kind":"node","target_sha256":"0abacceb35edf023950293efb750c68307e07a60445110e796bec69f0768a494"}],"ology.criminology":[{"id":"assertion.complete.ology.criminology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Criminology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Criminology as: The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","support":[{"end":474,"quote":"The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","source_id":"nlm-mesh.49b6dba2f266b504ca82","source_sha256":"d9bd96d5c9df3f4f6bcd266aa15cf1f95245dc4bb833dbf355f3c14a39e2fd1b","start":334}],"target_id":"ology.criminology","target_kind":"node","target_sha256":"aa35cd8deb2d100aba44cb83fc9030d9e36245acee9c643f829816e553d612a8"}],"ology.cryobiology":[{"id":"assertion.complete.ology.cryobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cryobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cryobiology as: The study of biological materials or systems subjected to temperatures below their normal range.","support":[{"end":483,"quote":"The study of biological materials or systems subjected to temperatures below their normal range.","source_id":"nlm-mesh.946d44c7d4c966d8f70c","source_sha256":"05564a0c9eda9296af1d645f794653363278b3c62072433c04905d62f545d688","start":387}],"target_id":"ology.cryobiology","target_kind":"node","target_sha256":"6a005b631d723595926009c111889ebb3ad3b5d581f723a2fe294ea82cc5fcdb"}],"ology.cytology":[{"id":"assertion.complete.ology.cytology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Cytology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Cytology as: The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","support":[{"end":831,"quote":"The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","source_id":"nlm-mesh.0d50c20ba335a36532f3","source_sha256":"66c3fbb453fb979cef5c72e470db78949fabb38226d9ae7be41f1eda2578dbe0","start":648}],"target_id":"ology.cytology","target_kind":"node","target_sha256":"34a450f7303bd440d9df48ea315e2e94f63d849cc3dd7b860c1b9d3dd02d0e14"}],"ology.demography":[{"id":"assertion.complete.ology.demography","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Demography in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Demography as: Statistical interpretation and description of a population with reference to distribution, composition, or structure.","support":[{"end":579,"quote":"Statistical interpretation and description of a population with reference to distribution, composition, or structure.","source_id":"nlm-mesh.cf575eadb37c41446ec6","source_sha256":"fe5a8841d69fdae9ea3d031164acef874adedcbfa2d01597cd49ae8daaa1abc7","start":462}],"target_id":"ology.demography","target_kind":"node","target_sha256":"4260fb5c3eec093ce19d7587a3ac6711dc7bb7facc73d584d8c08a250c7aeca0"}],"ology.dermatology":[{"id":"assertion.complete.ology.dermatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Dermatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Dermatology as: A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","support":[{"end":433,"quote":"A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","source_id":"nlm-mesh.963851b0921eef8ae42d","source_sha256":"8dd4377b43c3a18b8d3bb7c791baa96afffc2220fed8de3f77b0f41ce6b2d42a","start":338}],"target_id":"ology.dermatology","target_kind":"node","target_sha256":"bc0d1600147e7a644c661d61eee7f08afa26a6aec6b02404cbd9df9d94a89ce9"}],"ology.developmental-biology":[{"id":"assertion.complete.ology.developmental-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Developmental biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Developmental biology as: Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","support":[{"end":256,"quote":"Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","source_id":"usgs-thesaurus.43c406756994e4d6a610","source_sha256":"9ee1607473b6c684efd223ebfc8c41b3045ad26cdddbf0acb650577faabcf512","start":118}],"target_id":"ology.developmental-biology","target_kind":"node","target_sha256":"9ecbfebf8e518aa4938756fe7f697836f9f3da7a1b5265ebbd61c97583fc0aa1"}],"ology.embryology":[{"id":"assertion.complete.ology.embryology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Embryology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Embryology as: The study of the development of an organism during the embryonic and fetal stages of life.","support":[{"end":607,"quote":"The study of the development of an organism during the embryonic and fetal stages of life.","source_id":"nlm-mesh.fe237ee68bf6ac2997f1","source_sha256":"1139c4e8952aec7cda0d7eacd8065a0e3b8dc94980599316c88f2ec88390524d","start":517}],"target_id":"ology.embryology","target_kind":"node","target_sha256":"09e2e469b621b47a6193b1377910592007a41724e47289a81d105e7df0116980"}],"ology.endocrinology":[{"id":"assertion.complete.ology.endocrinology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Endocrinology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Endocrinology as: Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","support":[{"end":262,"quote":"Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","source_id":"usgs-thesaurus.7fecd1d9d681f5519ebb","source_sha256":"75be4c7ca6f42af4b6d86a466ad0ddf7b3c5e3535d1714666dd51a1935df9d36","start":127},{"end":480,"quote":"A subspecialty of internal medicine concerned with the metabolism, physiology, and disorders of the\nENDOCRINE SYSTEM\n.","source_id":"completion-source.e90badae02d39b991a93","source_sha256":"8a771ad79863d843b424d5a908fbb55c1603ec23314e2b56af34520140edf2a1","start":362}],"target_id":"ology.endocrinology","target_kind":"node","target_sha256":"eca0771a252a3ba328a5240dbd55833b0a0dca4cfc30a8b4a7fe471cb73456fc"}],"ology.entomology":[{"id":"assertion.complete.ology.entomology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Entomology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Entomology as: Branch of zoology involved in studying insects.","support":[{"end":176,"quote":"Branch of zoology involved in studying insects.","source_id":"usgs-thesaurus.26d0f4a60626d67a41cf","source_sha256":"2fd467cf92662bdeb7328c600a9d318e5700b5c53156bc810045bdd906ee4013","start":129}],"target_id":"ology.entomology","target_kind":"node","target_sha256":"0cef0c2287b4ba7b2e403038af48db70cc4dd8190d7c78e5825d61bd8ef74838"}],"ology.ethnology":[{"id":"assertion.complete.ology.ethnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Ethnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Ethnology as: The comparative and theoretical study of culture, often synonymous with cultural anthropology.","support":[{"end":524,"quote":"The comparative and theoretical study of culture, often synonymous with cultural anthropology.","source_id":"nlm-mesh.3294b344080d4d981ed0","source_sha256":"8f002862cbb167ba4abf91d3c6f2301795cafbe8cf639b2fb8abb8b93efab8f3","start":430}],"target_id":"ology.ethnology","target_kind":"node","target_sha256":"2b060f4463e464c710f01a26aed6449febdc3b018268f6b106fc7c96e3f447f2"}],"ology.ethology":[{"id":"assertion.complete.ology.ethology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ethology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ethology as: Study of animal behavior under natural conditions","support":[{"end":151,"quote":"Study of animal behavior under natural conditions","source_id":"usgs-thesaurus.9375aebb8cb97e02bd6f","source_sha256":"1f80354cdb62f0f56d23c25a04917aeebbd940b81d538fc540e1bd2d5668fee9","start":102}],"target_id":"ology.ethology","target_kind":"node","target_sha256":"112406d6402c798f7d6564826b60d740c91a534eba82295ed7a6107ba7c0396c"}],"ology.gastroenterology":[{"id":"assertion.complete.ology.gastroenterology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Gastroenterology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Gastroenterology as: A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","support":[{"end":537,"quote":"A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","source_id":"nlm-mesh.b5b237de56e2aaaa3266","source_sha256":"1b19a2319ea18b96bb21c9025a3540490a8f9cd363f6cd0160cc155b72d55e05","start":352}],"target_id":"ology.gastroenterology","target_kind":"node","target_sha256":"95a1a50ec2508283db3ec75eb91ec0de3f342f090054ed2bdac23cff80337223"}],"ology.genomics":[{"id":"assertion.complete.ology.genomics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Genomics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Genomics as: The systematic study of the complete DNA sequences ( GENOME ) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in GENOME WIDE ASSOCIATION STUDIES .","support":[{"end":686,"quote":"The systematic study of the complete\nDNA\nsequences (\nGENOME\n) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in\nGENOME WIDE ASSOCIATION STUDIES\n.","source_id":"nlm-mesh.effd12a7827847f3b1ba","source_sha256":"b0aaffebed8abbbfc36294e85bd02f2fb99057beda75972447ff2779f750ea6d","start":415}],"target_id":"ology.genomics","target_kind":"node","target_sha256":"b7f74da014b7be8552d25e02dbebb391dd2af73e73203fd046bed8baeb677484"}],"ology.geochemistry":[{"id":"assertion.complete.ology.geochemistry","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geochemistry as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geochemistry as: Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","support":[{"end":254,"quote":"Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","source_id":"usgs-thesaurus.45717bf85fdd31a41c91","source_sha256":"09a511efa85e2e21b037b9ecc1f5befd3f57421dad6433b0068916db0623885f","start":101}],"target_id":"ology.geochemistry","target_kind":"node","target_sha256":"d15b6fcb7e4a8c32b1830938920103a5733acff9aee903efeb2650f8cd446eae"}],"ology.geochronology":[{"id":"assertion.complete.ology.geochronology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geochronology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.","support":[{"end":195,"quote":"Study of the age of the earth by dating geological formations, rocks, and fossils.","source_id":"usgs-thesaurus.9b9b9c2209b3540da35b","source_sha256":"e11321b2e85984746c01bea99870860b7a27d5ccbb12581742cf376d2633d2f8","start":113}],"target_id":"ology.geochronology","target_kind":"node","target_sha256":"40833547fe0850db8f64d7d78ca8d62a2215f19560c6fa94358a6a9b524173e6"}],"ology.geomorphology":[{"id":"assertion.complete.ology.geomorphology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Geomorphology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Geomorphology as: Branch of geology dealing with surface land features and the processes that create and change them.","support":[{"end":212,"quote":"Branch of geology dealing with surface land features and the processes that create and change them.","source_id":"usgs-thesaurus.ac143557ea12a17d3c6d","source_sha256":"6d4e08a53abcc0fa1150d278c5c354765dc6136556b32f4533bcaa052ec63916","start":113}],"target_id":"ology.geomorphology","target_kind":"node","target_sha256":"d68e4a0fdcec0c396c853bb14fc2deed980d59601fa5f2a68a356a319fd4c112"}],"ology.glaciology":[{"id":"assertion.complete.ology.glaciology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Glaciology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Glaciology as: Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","support":[{"end":206,"quote":"Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","source_id":"usgs-thesaurus.72927539f9b5c6155294","source_sha256":"94bf50bab9debece80993d9aa58a431a7458ec5ef6360334bb44ed7c7d9c515f","start":97}],"target_id":"ology.glaciology","target_kind":"node","target_sha256":"7a4b2fea9315cc6cd87b2dbc88717d4bd9ac4a8975f64a48d44e3ce6842e3e72"}],"ology.glycobiology":[{"id":"assertion.complete.ology.glycobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Glycobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Glycobiology as: The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","support":[{"end":505,"quote":"The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","source_id":"nlm-mesh.7bc5eafef50d053d5814","source_sha256":"567573316e3263c00c49ef5bc9e6926e579eb06079ce7ba72be4b0a208dcd1a6","start":350}],"target_id":"ology.glycobiology","target_kind":"node","target_sha256":"9c3abd13642cb2b0e4f0642735e784ae1a966078e063bd1588708307a7d1106e"}],"ology.gynecology":[{"id":"assertion.complete.ology.gynecology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Gynecology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Gynecology as: A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","support":[{"end":596,"quote":"A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","source_id":"nlm-mesh.2d51683a5c47ff65a4e9","source_sha256":"3ade9eba0ae8f11b5bdbd988e55e95b6d265cf256be14635e14af7a7f3bc1313","start":424}],"target_id":"ology.gynecology","target_kind":"node","target_sha256":"1ba84eac1e2c5556906ea4a4de9179556006bf1c728b67905cffd724bd63e781"}],"ology.hematology":[{"id":"assertion.complete.ology.hematology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Hematology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Hematology as: A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","support":[{"end":468,"quote":"A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","source_id":"nlm-mesh.44db89f7a8e212468382","source_sha256":"a39661d3ad758cf6a6569365760afc4c3db48d2f702d38d23e3040e9acdcbe57","start":340}],"target_id":"ology.hematology","target_kind":"node","target_sha256":"84dc9b8cefe6b1132a97914bf17b9d81e5a22953a468492ec09f0c4e4f0278e4"}],"ology.herpetology":[{"id":"assertion.complete.ology.herpetology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Herpetology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Herpetology as: Branch of zoology concerned with the study of reptiles and amphibians.","support":[{"end":199,"quote":"Branch of zoology concerned with the study of reptiles and amphibians.","source_id":"usgs-thesaurus.7a6a2965ad207743d814","source_sha256":"919a91962c4fc7f727eb5111f68a8c5ba888fc48a8ff6af3413686a2c8de7df6","start":129}],"target_id":"ology.herpetology","target_kind":"node","target_sha256":"4475fa4260914066e5c62d178e9f1e638a9a5d79fa05a57073ce2e8da6278f3d"}],"ology.histology":[{"id":"assertion.complete.ology.histology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Histology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Histology as: Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","support":[{"end":205,"quote":"Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","source_id":"usgs-thesaurus.6b30b2d3f6402ab23f69","source_sha256":"876165b8c9834aefa3ff81283eed0d18b8d006ee98a523c2a5967abb973cd50c","start":119}],"target_id":"ology.histology","target_kind":"node","target_sha256":"14ffe6b44a81fa11dcab2ce977aec252af1c66d6e73d41e462ab77410db8be50"}],"ology.hydrogeology":[{"id":"assertion.complete.ology.hydrogeology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Hydrogeology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Hydrogeology as: Study of subsurface waters and geologic aspects of surface waters.","support":[{"end":177,"quote":"Study of subsurface waters and geologic aspects of surface waters.","source_id":"usgs-thesaurus.ce8e9bd3a3dd978ad873","source_sha256":"37c2f07c7414b104b53197d8582f966282b4e8b60b25f129380c0f3a6eedbc26","start":111}],"target_id":"ology.hydrogeology","target_kind":"node","target_sha256":"0e587437dade2d7275288bb1deeff29578bf16e8663d303fec137fe3f2dbe3a3"}],"ology.hydrology":[{"id":"assertion.complete.ology.hydrology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Hydrology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","support":[{"end":219,"quote":"Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","source_id":"usgs-thesaurus.7691e5829ecd899aeb75","source_sha256":"84e4a77fd1f639c254e332f2ce48795daafe22a691731d09bb64d303bc724dfa","start":95}],"target_id":"ology.hydrology","target_kind":"node","target_sha256":"0510ad057853f0b278867b84f65f6df8711badc8e0e291b4ebdb9dc68affbc3b"}],"ology.ichthyology":[{"id":"assertion.complete.ology.ichthyology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ichthyology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ichthyology as: Branch of zoology concerned with the study of fish.","support":[{"end":180,"quote":"Branch of zoology concerned with the study of fish.","source_id":"usgs-thesaurus.fc3a1187d897acbd35b3","source_sha256":"cdeee23755d5cfe8bf46ee409b13eeaa3e6ce97a695e98a5879d497b7e254066","start":129}],"target_id":"ology.ichthyology","target_kind":"node","target_sha256":"943df569b50b60040c9af0abe782e543c5abf776880eb9693374b4cd5a17f567"}],"ology.immunology":[{"id":"assertion.complete.ology.immunology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Immunology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Immunology as: Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","support":[{"end":277,"quote":"Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","source_id":"usgs-thesaurus.1e207764c4dcaddcfa3f","source_sha256":"4acff4859b80a983cfd8e2d1eab25a5383412d50d1e7c16429ce7122ab9502d4","start":121}],"target_id":"ology.immunology","target_kind":"node","target_sha256":"1a661c7ea75e24af2e2ad29ae907c5715db52df6dee34115838f7b5392955959"}],"ology.limnology":[{"id":"assertion.complete.ology.limnology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Limnology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Limnology as: Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","support":[{"end":209,"quote":"Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","source_id":"usgs-thesaurus.2e19bcc18d8f8bb2cd4f","source_sha256":"a109fe1ec6d5c09b51369d9194ed6c4860f3bb5dfbbc208c7afb9eba23cfe90a","start":95}],"target_id":"ology.limnology","target_kind":"node","target_sha256":"19571154704b50d9ac324f7fdf9d68d9dd9e3396e9dc6ead877976c917f8d88b"}],"ology.mammalogy":[{"id":"assertion.complete.ology.mammalogy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mammalogy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mammalogy as: Branch of zoology concerned with the study of mammals.","support":[{"end":179,"quote":"Branch of zoology concerned with the study of mammals.","source_id":"usgs-thesaurus.371c76fcaf528fc15e5e","source_sha256":"6b8734fcae6ddd21220dede80f89accd9e35766c31c2dfae4a9f6041ffca76a8","start":125}],"target_id":"ology.mammalogy","target_kind":"node","target_sha256":"2267987070312ddf19030e8b9f2368e2422036c1dceb2db71ddd90bc44ed8ca4"}],"ology.marine-biology":[{"id":"assertion.complete.ology.marine-biology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Marine biology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Marine biology as: Branch of biology concerned with the organisms and habitats of the seas and oceans.","support":[{"end":187,"quote":"Branch of biology concerned with the organisms and habitats of the seas and oceans.","source_id":"usgs-thesaurus.c06c39ee767c6bf57f75","source_sha256":"40514a937e9acbb59b4bca285f444b0df126c75565bff3a5c0883c4775a362ef","start":104}],"target_id":"ology.marine-biology","target_kind":"node","target_sha256":"e829709b1720c6e911f7c3109c7d6a0c0692a679a793db2b2eeb2fa423706137"}],"ology.meteorology":[{"id":"assertion.complete.ology.meteorology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Meteorology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","support":[{"end":289,"quote":"Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","source_id":"usgs-thesaurus.4c9d6896b889ce2b2e86","source_sha256":"a38a07d239077c0053d671d02b18a70019ad5b1bee7d8706f06da5ed4dd18298","start":122}],"target_id":"ology.meteorology","target_kind":"node","target_sha256":"72dc8f2c520b53ade0aec649b163ac5dba5c77a99f3d6b3710a6a5f0a380c1d0"}],"ology.mineralogy":[{"id":"assertion.complete.ology.mineralogy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mineralogy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","support":[{"end":212,"quote":"Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","source_id":"usgs-thesaurus.a5b24d28b9768fcf1686","source_sha256":"5147eb376f53be06a955dfa299dadadfc56340d32f71a143398798f9be453d52","start":107}],"target_id":"ology.mineralogy","target_kind":"node","target_sha256":"e46137b7ab9376acc53bf8f3ecfa32d3470078b1a90f67c27860b698576a3600"}],"ology.mycology":[{"id":"assertion.complete.ology.mycology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Mycology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Mycology as: Branch of biology concerned with the study of fungi.","support":[{"end":144,"quote":"Branch of biology concerned with the study of fungi.","source_id":"usgs-thesaurus.4cae14b1bd2e1d062020","source_sha256":"8b80f345736f8abd211dc2d602a4c2921f279f9e9d9e1150f4fd58b183f52f35","start":92}],"target_id":"ology.mycology","target_kind":"node","target_sha256":"e5307053c8070f0621be1292fee6cc611ead5b7aabf8459eef0512cc5cee27f7"}],"ology.nanotechnology":[{"id":"assertion.complete.ology.nanotechnology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nanotechnology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nanotechnology as: The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","support":[{"end":486,"quote":"The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","source_id":"nlm-mesh.81fd205e36d18b028764","source_sha256":"be4d8a80a39e64a7fd27e1e33e8a02c6042ce535b1c6541b1bd5f09d2b69af65","start":356}],"target_id":"ology.nanotechnology","target_kind":"node","target_sha256":"7dd516b638061c57e66dc30bbdbf49d9a6da3359ca82bd3c7ed5f1c4ba24d75a"}],"ology.neonatology":[{"id":"assertion.complete.ology.neonatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neonatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neonatology as: A subspecialty of Pediatrics concerned with the newborn infant.","support":[{"end":613,"quote":"A subspecialty of Pediatrics concerned with the newborn infant.","source_id":"nlm-mesh.8268ca3c835135b3e0de","source_sha256":"0da00c55c484715a52a1a24913f5c26552a42de4a3bf40d43654df830675f4a1","start":550}],"target_id":"ology.neonatology","target_kind":"node","target_sha256":"28777069c0ddae374101f309b187dd15d784a407cb2eef18311a2fe1cb741a55"}],"ology.nephrology":[{"id":"assertion.complete.ology.nephrology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nephrology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nephrology as: A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","support":[{"end":444,"quote":"A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","source_id":"nlm-mesh.afe32e7cd24512af6fea","source_sha256":"48d2a03dbd630a667e04a35aab16d0e042d5140210e0b7bba3b5104e4d2e24bc","start":340}],"target_id":"ology.nephrology","target_kind":"node","target_sha256":"0528e79a805deb37ea5bbdc29597e38dfbe2da713cec661e13e3b126c1ca9106"}],"ology.neurobiology":[{"id":"assertion.complete.ology.neurobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neurobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neurobiology as: The study of the structure, growth, activities, and functions of NEURONS and the NERVOUS SYSTEM .","support":[{"end":522,"quote":"The study of the structure, growth, activities, and functions of\nNEURONS\nand the\nNERVOUS SYSTEM\n.","source_id":"nlm-mesh.8d297a4fd89adab5fa15","source_sha256":"7f01610b43f095181d41084bfd36faa76dfa822f2f69c40bb59f6c246d67bebc","start":425}],"target_id":"ology.neurobiology","target_kind":"node","target_sha256":"ee8cab3e1925246b041a2f1ec525e18cb6f4b486ecc4b2e5545068b318a0958c"}],"ology.neurology":[{"id":"assertion.complete.ology.neurology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neurology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neurology as: A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","support":[{"end":444,"quote":"A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","source_id":"nlm-mesh.6ce32d2c745cf556384b","source_sha256":"65c543143829c6d8a5b348c92a25cefdd2133eede2bfd1c07cb833cd44331961","start":334}],"target_id":"ology.neurology","target_kind":"node","target_sha256":"bbbededad8e4e5563f1e46e62084163b3effdb36416e92732e9980fc56a3e120"}],"ology.neuropathology":[{"id":"assertion.complete.ology.neuropathology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neuropathology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neuropathology as: The branch of medicine and biomedical science concerned with diseases of the nervous system.","support":[{"end":549,"quote":"The branch of medicine and biomedical science concerned with diseases of the nervous system.","source_id":"nlm-mesh.b195e4fedf3aa920449b","source_sha256":"e978845e2de7fc678c8fa658b69e6be34d8a072ed2a9d8cff4eaad74f05a0ff8","start":457}],"target_id":"ology.neuropathology","target_kind":"node","target_sha256":"54fb095e2cdb26e72d359f82cb0a1835a708250b842e549c508386be37998f88"}],"ology.neuropsychology":[{"id":"assertion.complete.ology.neuropsychology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Neuropsychology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Neuropsychology as: A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","support":[{"end":742,"quote":"A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","source_id":"nlm-mesh.ef3566806174802f82a1","source_sha256":"c8268de56d93c71d93c273a8eea3b85bdaf556c91b745bb7a528cd5112bec0ad","start":448}],"target_id":"ology.neuropsychology","target_kind":"node","target_sha256":"0c84da63db927cac80a8d6af9e03d0956eb4610e64c4f0303309d304aebd8499"}],"ology.ophthalmology":[{"id":"assertion.complete.ology.ophthalmology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Ophthalmology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Ophthalmology as: A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","support":[{"end":487,"quote":"A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","source_id":"nlm-mesh.ef44f675a31fc40f56be","source_sha256":"9bc5b2232140d5e527220ea577b1eaf20c065046bd216096593869d015720e8d","start":346}],"target_id":"ology.ophthalmology","target_kind":"node","target_sha256":"a3d05aa071c5ea67e65357210a38087f6581cc39640aa160290647627ded54b8"}],"ology.ornithology":[{"id":"assertion.complete.ology.ornithology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Ornithology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Ornithology as: Branch of biology concerned with the study of birds.","support":[{"end":181,"quote":"Branch of biology concerned with the study of birds.","source_id":"usgs-thesaurus.45d1b09cab533d0d8add","source_sha256":"d90e6af61e6a60b37c189753b2535d2ea1c843f1798707f7f55913e5778b625a","start":129}],"target_id":"ology.ornithology","target_kind":"node","target_sha256":"2e96bb1ee5f674805205cb323275b9ab8da428c4c86ec0186848ba86addf0a91"}],"ology.paleography":[{"id":"assertion.complete.ology.paleography","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Paleography in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Paleography as: The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","support":[{"end":589,"quote":"The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","source_id":"nlm-mesh.de31c6b64b58d9b44545","source_sha256":"dcc7dafe0b9f98075117d4cbfbd83f0e81f15e7d1ca9aca2f1f5e92ebb166bb7","start":414}],"target_id":"ology.paleography","target_kind":"node","target_sha256":"527bc0be89188a1d7e59c9151203c206b8695320264eb413a32dbc9c191fd6c9"}],"ology.paleontology":[{"id":"assertion.complete.ology.paleontology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Paleontology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Paleontology as: Study of life in past geologic time based on fossil plants and animals.","support":[{"end":172,"quote":"Study of life in past geologic time based on fossil plants and animals.","source_id":"usgs-thesaurus.2dcbaf2d1a595f7517e5","source_sha256":"949f27e6056d88039c41b36d440cb54c3d747d6fcbcf399f908e89272e212d14","start":101}],"target_id":"ology.paleontology","target_kind":"node","target_sha256":"7105275efd769ffffbeed8377227f3a5d8f5c3a2759af9831fd0d77bcb307fcf"}],"ology.parasitology":[{"id":"assertion.complete.ology.parasitology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Parasitology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Parasitology as: Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","support":[{"end":243,"quote":"Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","source_id":"usgs-thesaurus.50ce134a036f2d19ef0a","source_sha256":"e5a6efcae30794bb2221aa39ad2f737a29ebbf0d8535bef25664397e63aef733","start":100}],"target_id":"ology.parasitology","target_kind":"node","target_sha256":"5e4e9ef97ac7e39690a23a085679ef4ed9f2174f5c1ecb80b365975640afc341"}],"ology.pathology":[{"id":"assertion.complete.ology.pathology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Pathology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Pathology as: Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","support":[{"end":207,"quote":"Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","source_id":"usgs-thesaurus.e4b94d24f020cbbbfc43","source_sha256":"aa8edd82fcac3336290b170af26c4916f0fc562ee7db7913ded2e886b9feb68c","start":94}],"target_id":"ology.pathology","target_kind":"node","target_sha256":"d49dd23bfc5e63d2c1f956ea762a0605414d6ad2534969deb2399044c65b543f"}],"ology.petrology":[{"id":"assertion.complete.ology.petrology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Petrology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Petrology as: Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","support":[{"end":205,"quote":"Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","source_id":"usgs-thesaurus.c8966d506e18150be2fe","source_sha256":"77bcf2f32b615f4aa7b8e3261b9f257d86d31210b166c52bad154afda7568c70","start":105}],"target_id":"ology.petrology","target_kind":"node","target_sha256":"02eea409a1b06f54e6f758cc15803298979648385f39719aeb30bdbf3b509174"}],"ology.pharmacognosy":[{"id":"assertion.complete.ology.pharmacognosy","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Pharmacognosy in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Pharmacognosy as: The science of drugs prepared from natural-sources including preparations from PLANTS , animals, and other organisms as well as MINERALS and other substances included in MATERIA MEDICA . The therapeutic usage of plants is PHYTOTHERAPY .","support":[{"end":623,"quote":"The science of drugs prepared from natural-sources including preparations from\nPLANTS\n, animals, and other organisms as well as\nMINERALS\nand other substances included in\nMATERIA MEDICA\n. The therapeutic usage of plants is\nPHYTOTHERAPY\n.","source_id":"nlm-mesh.77137917b685045258f0","source_sha256":"2090bd85d37c8b26abf4cf358ebf5e3439e2c574bdfb2690d9f21ede03470ddb","start":387}],"target_id":"ology.pharmacognosy","target_kind":"node","target_sha256":"4877cb2e0800c9db880f7623e31b7e1a9d4b90d7329eecd09dd8c27db5874d84"}],"ology.pharmacology":[{"id":"assertion.complete.ology.pharmacology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Pharmacology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Pharmacology as: The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","support":[{"end":774,"quote":"The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","source_id":"nlm-mesh.72dc31200ed8c2a213c9","source_sha256":"4fe306e710b5a7aca6d3a88e55e7b5c153e139e868c143c6eb208073d208db02","start":670}],"target_id":"ology.pharmacology","target_kind":"node","target_sha256":"fc9eed1c9074e316f7a08eb9b96d640fac1b2eb4796e18ef464d55dcba04d09c"}],"ology.philology":[{"id":"assertion.complete.ology.philology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Philology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Philology as: The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","support":[{"end":809,"quote":"The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","source_id":"nlm-mesh.7bf6c0775e9e1bc14a38","source_sha256":"370031fef7c48721e497c2bb5cb4d7fcbbffbeeb5c86d15a5a736dbd274ae76c","start":490}],"target_id":"ology.philology","target_kind":"node","target_sha256":"285dd10af71f8ddb915ee0872801e27f3c1e22b8d526f4c85d61270da781b16d"}],"ology.photobiology":[{"id":"assertion.complete.ology.photobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Photobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Photobiology as: The branch of biology dealing with the effect of light on organisms.","support":[{"end":595,"quote":"The branch of biology dealing with the effect of light on organisms.","source_id":"nlm-mesh.99640cd221760e32fc9e","source_sha256":"de3f313a4810757be8af6d5ec2dcb3e798b4aac50d2b3b24e49000dce3943403","start":527}],"target_id":"ology.photobiology","target_kind":"node","target_sha256":"84396d38a943bb1273c40f9321866db85dba70edbb76e5b22a4f5f23e10aa687"}],"ology.phycology":[{"id":"assertion.complete.ology.phycology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Phycology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Phycology as: Branch of biology concerned with the study of algae.","support":[{"end":155,"quote":"Branch of biology concerned with the study of algae.","source_id":"usgs-thesaurus.9a880c55f1553c1253d9","source_sha256":"c0bdbf4b3493c965bdd7acac66a834e774bea42308155a6debf9dbe8b26e90d8","start":103}],"target_id":"ology.phycology","target_kind":"node","target_sha256":"6a4614dbff1b83453158dd95ce1537c508ff78635d7c2f9360de24d2306a8045"}],"ology.physiology":[{"id":"assertion.complete.ology.physiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Physiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Physiology as: The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","support":[{"end":741,"quote":"The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","source_id":"nlm-mesh.c63837a70e6aa338de39","source_sha256":"9136e9847dbf199caeabe3f14726c38ea8cc040d3ce39f3404c0ebd45c2ac678","start":611}],"target_id":"ology.physiology","target_kind":"node","target_sha256":"94c884ce89614df3a3b7b32fea4de2c072e461a0923096888cabcd80604f5a02"}],"ology.proteomics":[{"id":"assertion.complete.ology.proteomics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Proteomics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Proteomics as: The systematic study of the complete complement of proteins ( PROTEOME ) of organisms.","support":[{"end":490,"quote":"The systematic study of the complete complement of proteins (\nPROTEOME\n) of organisms.","source_id":"nlm-mesh.55c7bf5248c252ae0c2b","source_sha256":"b0865ad783fdc6fac5b91e6ceb2af08cc66dd35887daefe9a3ad296a17d8cfcd","start":404}],"target_id":"ology.proteomics","target_kind":"node","target_sha256":"1b0becbe499550f912836a52476ac4a6b181c56b2103f8b0fc26c55663475b19"}],"ology.psycholinguistics":[{"id":"assertion.complete.ology.psycholinguistics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psycholinguistics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psycholinguistics as: A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","support":[{"end":724,"quote":"A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","source_id":"nlm-mesh.14af6d0afad21004276f","source_sha256":"37a49119f24ad947a32d820cd08f29da49ff41b772e1ebc7d4ccead01d44e7f6","start":446}],"target_id":"ology.psycholinguistics","target_kind":"node","target_sha256":"2ad8b04cb6c9b30ef0babf3dee9ca0c8d52f02fd004f349af6578f196f6b868c"}],"ology.psychopathology":[{"id":"assertion.complete.ology.psychopathology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychopathology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.","support":[{"end":517,"quote":"The study of significant causes and processes in the development of mental illness.","source_id":"nlm-mesh.cfcfe0e017d161687831","source_sha256":"c6d8dfe37473fdf2dd2d9f021f5fa8805609e7a3e56917dac21907c552804fd2","start":434}],"target_id":"ology.psychopathology","target_kind":"node","target_sha256":"12e51f31c4e488f0f064ea37f72dbcc183d60c37af0c244d302d775b3bda1322"}],"ology.psychopharmacology":[{"id":"assertion.complete.ology.psychopharmacology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Psychopharmacology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Psychopharmacology as: The study of the effects of drugs on mental and behavioral activity.","support":[{"end":510,"quote":"The study of the effects of drugs on mental and behavioral activity.","source_id":"nlm-mesh.aac03d67dea48e69ae86","source_sha256":"1745c9274aa43d0ca740964456c2336dbc89a801be973e2ac56fb07d9dd7d6d5","start":442}],"target_id":"ology.psychopharmacology","target_kind":"node","target_sha256":"25ef3be151777e64df1139860bd58c8efc48a8ba318599cb8d1e86c8b657a5c4"}],"ology.radiobiology":[{"id":"assertion.complete.ology.radiobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Radiobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Radiobiology as: Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","support":[{"end":552,"quote":"Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","source_id":"nlm-mesh.4614a1a23cf1eb79c224","source_sha256":"fefb27d6245ef7b14d67ace47f59bf2b7deb76a6db8798697d110bfa51406d75","start":365}],"target_id":"ology.radiobiology","target_kind":"node","target_sha256":"9c7508d05b85d1d06d9c4d5b94523968d986135e59d48bc78f0208cf1a49c577"}],"ology.radiology":[{"id":"assertion.complete.ology.radiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Radiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Radiology as: A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","support":[{"end":530,"quote":"A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","source_id":"nlm-mesh.e9897a03354d6948a211","source_sha256":"f91d24ebaeb0feee49476546c2654a978f760d4ab66c80598f78c088c682cbde","start":410}],"target_id":"ology.radiology","target_kind":"node","target_sha256":"fb3528a6b942c684299f525a81ccf698c8bb576a5870a63bf9ce06963763456d"}],"ology.rheology":[{"id":"assertion.complete.ology.rheology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Rheology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Rheology as: The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and VISCOSITY .","support":[{"end":690,"quote":"The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and\nVISCOSITY\n.","source_id":"nlm-mesh.672caf2b40c74990f490","source_sha256":"dc5b5dc6c05bc74829e3ecda574a3470b0a2c07c67f68688223744d4e1f1c095","start":464}],"target_id":"ology.rheology","target_kind":"node","target_sha256":"20b85e09d8b02ac30db5d946159eb94f98fb72d5e5dfb242a9780c2f90d95b20"}],"ology.rheumatology":[{"id":"assertion.complete.ology.rheumatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Rheumatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Rheumatology as: A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","support":[{"end":580,"quote":"A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","source_id":"nlm-mesh.137dd360907a3740cb66","source_sha256":"37f2c34552935ac4e09708125570c9db40db11e58cba1c07105cb37783b52b39","start":344}],"target_id":"ology.rheumatology","target_kind":"node","target_sha256":"573a72037766e70271c8ef48835d388ab4e33bf5634fe59155b3c46a16f472a8"}],"ology.sedimentology":[{"id":"assertion.complete.ology.sedimentology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Sedimentology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","support":[{"end":260,"quote":"Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","source_id":"usgs-thesaurus.fd7a87508131b4ecaf86","source_sha256":"fb25dd7484399e9129448983d292216b44627a7227e39e6935ec287e9fc3ac0e","start":113}],"target_id":"ology.sedimentology","target_kind":"node","target_sha256":"416871d608b7288836f6fc250e588c233b12356198fc29ec17361567affc1207"}],"ology.seismology":[{"id":"assertion.complete.ology.seismology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Seismology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","support":[{"end":205,"quote":"Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","source_id":"usgs-thesaurus.762a1e9db52aec2a89a0","source_sha256":"64678ea7c99a3b5f49dc438de2eaed5619ea5edf5fdc9a76db89b79681911e46","start":110}],"target_id":"ology.seismology","target_kind":"node","target_sha256":"cd7466044cdccb23fed139dbaa87959d38412e458b1b24fb75f5a52c24ae2019"}],"ology.serology":[{"id":"assertion.complete.ology.serology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Serology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Serology as: The study of serum, especially of antigen-antibody reactions in vitro.","support":[{"end":445,"quote":"The study of serum, especially of antigen-antibody reactions in vitro.","source_id":"nlm-mesh.33ea8d12d5d7f3a0a806","source_sha256":"66c364a7b3e01d56583ce9760ae72f62c2fb21ef603234b673556fb2bcd865de","start":375}],"target_id":"ology.serology","target_kind":"node","target_sha256":"8a03d7ccb91051ab15cea81277f0544ca0607c9b353bdd88d191674b6981b667"}],"ology.sexology":[{"id":"assertion.complete.ology.sexology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sexology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sexology as: This discipline concerns the study of SEXUALITY , and the application of sexual knowledge such as sexual attitudes, psychology, and SEXUAL BEHAVIOR . Scope of application generally includes educational ( SEX EDUCATION ), clinical ( SEX COUNSELING ), and other settings.","support":[{"end":601,"quote":"This discipline concerns the study of\nSEXUALITY\n, and the application of sexual knowledge such as sexual attitudes, psychology, and\nSEXUAL BEHAVIOR\n. Scope of application generally includes educational (\nSEX EDUCATION\n), clinical (\nSEX COUNSELING\n), and other settings.","source_id":"nlm-mesh.e1b8584f6a96cec5e422","source_sha256":"682a7f691c4074f5fe97f4d1ec1d1abd5a1ae4c79c4a19db6018d913d4561133","start":332}],"target_id":"ology.sexology","target_kind":"node","target_sha256":"86899ab14e7aaab1a641d24759f5d394c26c5ce26aaaf5487f3f45ff43f629a8"}],"ology.sociobiology":[{"id":"assertion.complete.ology.sociobiology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Sociobiology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Sociobiology as: The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","support":[{"end":550,"quote":"The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","source_id":"nlm-mesh.0390edf50d0d577e17eb","source_sha256":"1ce2e21abf91fff83ecfa8ef5a613afc4dccefd63a8595a0a1b0e560809a5cc5","start":356}],"target_id":"ology.sociobiology","target_kind":"node","target_sha256":"b55919d2940819ac372979e44bb7afc99e9ee0b06c20652eb75c1a35a187947e"}],"ology.stratigraphy":[{"id":"assertion.complete.ology.stratigraphy","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Stratigraphy as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","support":[{"end":248,"quote":"Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","source_id":"usgs-thesaurus.d2e306d9307aced4b202","source_sha256":"aef62888af7262deb597388f1f6a810dd60c7bd118f6a093bbaec6c8503a42ba","start":111}],"target_id":"ology.stratigraphy","target_kind":"node","target_sha256":"7292cdd5d9b38f1675cef84e2410d1b41e978096a2de9d074ddc43e1c7485125"}],"ology.tectonophysics":[{"id":"assertion.complete.ology.tectonophysics","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Tectonophysics as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Tectonophysics as: Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","support":[{"end":245,"quote":"Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","source_id":"usgs-thesaurus.969a1d445933c65b567f","source_sha256":"3534dbbc8c20e3fc18f96816cd8567f14238c501d1ca89f068c8955246189eb7","start":118}],"target_id":"ology.tectonophysics","target_kind":"node","target_sha256":"a36ecd9e339e4e4a2290d0103136f45bd6aae743bb7113ae4726721f412a9a93"}],"ology.teratology":[{"id":"assertion.complete.ology.teratology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Teratology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Teratology as: A branch of embryology for the study of congenital malformations and developmental abnormalities.","support":[{"end":672,"quote":"A branch of embryology for the study of congenital malformations and developmental abnormalities.","source_id":"nlm-mesh.60ac9995c95fb563be08","source_sha256":"39cb891d4dd60b97f56ca1912e1a995c7d11479552b4fb434b9202a48d8a7208","start":575}],"target_id":"ology.teratology","target_kind":"node","target_sha256":"41c9b9c04a5334049ac5e4172c5cb0611b7474a82c1fa1dbc263bbe4b28a0cf2"}],"ology.thanatology":[{"id":"assertion.complete.ology.thanatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Thanatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Thanatology as: The study of the theory, philosophy, and doctrine of death.","support":[{"end":515,"quote":"The study of the theory, philosophy, and doctrine of death.","source_id":"nlm-mesh.8e3f51354957e235535b","source_sha256":"55eefcbdab555398d5f6f215f2fec8a26eb942902dbf533aecf670eefb22d266","start":456}],"target_id":"ology.thanatology","target_kind":"node","target_sha256":"5b7bf04c0a36ad26322df7ba14572d1de361429b7604a98b3387b5172fd28475"}],"ology.theology":[{"id":"assertion.complete.ology.theology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Theology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Theology as: The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","support":[{"end":554,"quote":"The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","source_id":"nlm-mesh.0e8764007d2f3f2a9f63","source_sha256":"4207b2c1044a134c5d6bd16883193178a0c9e984752a4f631b7f9c1b7d5739fd","start":332}],"target_id":"ology.theology","target_kind":"node","target_sha256":"8e8cae30c18d625c664d31c6d74a42eadfdc94b89b56dc759df0611660d63731"}],"ology.toxicology":[{"id":"assertion.complete.ology.toxicology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Toxicology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Toxicology as: The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","support":[{"end":697,"quote":"The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","source_id":"nlm-mesh.c5eb56bf612a44ac8d8a","source_sha256":"88daf97e6e3260694b9eae5fae82d6498558874eb2bcd3a5b9120035e7d274db","start":523}],"target_id":"ology.toxicology","target_kind":"node","target_sha256":"3c817687b7fcdd14c6cf152229d0fdb829bfa3364a22f7e4391a0313923990de"}],"ology.traumatology":[{"id":"assertion.complete.ology.traumatology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Traumatology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Traumatology as: The medical specialty which deals with WOUNDS and INJURIES as well as resulting disability and disorders from physical traumas.","support":[{"end":563,"quote":"The medical specialty which deals with\nWOUNDS\nand\nINJURIES\nas well as resulting disability and disorders from physical traumas.","source_id":"nlm-mesh.8ae339a83d3cf2750aee","source_sha256":"b27d583409e1e64050f47b5af7f2b69af61e6ec9d8853bf75c0d6546b069df3a","start":436}],"target_id":"ology.traumatology","target_kind":"node","target_sha256":"36aaebfe35e49b8f4e195301846ae7d1ca4f91d827593887afe353e39dd49791"}],"ology.urology":[{"id":"assertion.complete.ology.urology","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Urology in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Urology as: A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction, URINARY INCONTINENCE , infections, and UROGENITAL NEOPLASMS .","support":[{"end":627,"quote":"A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction,\nURINARY INCONTINENCE\n, infections, and\nUROGENITAL NEOPLASMS\n.","source_id":"nlm-mesh.0c9c3700d764125cf02e","source_sha256":"2a0139ccfdc92197e4522bd44f553ae830da7f3685530df94732836de2d997b4","start":355}],"target_id":"ology.urology","target_kind":"node","target_sha256":"9e148b6ded02342a3be6efc589e4d58bd90d2895a0ad2debce791c5aab8ee290"}],"ology.virology":[{"id":"assertion.complete.ology.virology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Virology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Virology as: Branch of biology dealing with viruses and viral diseases.","support":[{"end":165,"quote":"Branch of biology dealing with viruses and viral diseases.","source_id":"usgs-thesaurus.bf9e37c0e60da0feaec7","source_sha256":"1427435511d28f6ebd0ea76877af6d5e7213609328775849004c0f7496de5776","start":107}],"target_id":"ology.virology","target_kind":"node","target_sha256":"ff5f6543b65f4f27f994c7d4bec5aa35b99185d1daa5714ec2b39e1d17b0c0c0"}],"ology.volcanology":[{"id":"assertion.complete.ology.volcanology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Volcanology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Volcanology as: The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","support":[{"end":249,"quote":"The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","source_id":"usgs-thesaurus.cfccf058f7b98949dc69","source_sha256":"52d0e5427dd7d4b41ef435c127dea3e0a89829ed29198cfd37b3e0679bd33e28","start":109}],"target_id":"ology.volcanology","target_kind":"node","target_sha256":"8c30b4b1ba7a18e86bbf67814e21ce84971d921e8849bb758dc550b37bc4bcd3"}],"ology.zoology":[{"id":"assertion.complete.ology.zoology","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Zoology as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Zoology as: Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","support":[{"end":211,"quote":"Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","source_id":"usgs-thesaurus.2e13d5f63b99994c4e0c","source_sha256":"12025245b9eae078cb15ded0a48e6476a3c765ec08bbe6511feb430e969eb7ff","start":90}],"target_id":"ology.zoology","target_kind":"node","target_sha256":"79506e97965b7d07250c79462d106f24d5ee7a6b9f34d1b9aa8087bbbd42fa50"}],"paper.bose-spin-entanglement-witness-2017":[{"id":"assert.paper.bose-spin-entanglement-witness-2017.rev3","scope":{"assumptions":"The proposal is based on the authors' stated principle that two objects cannot be entangled without a quantum mediator and on the experimental conditions described in the retained abstract.","population":"Two micron-size test masses in adjacent matter-wave interferometers, with one embedded spin in each test mass, as described in the proposal.","quantifiers":"Restricted to the particular proposed test and spin-correlation witness described in the retained source.","time":"The retained source was submitted on 19 Jul 2017; atlas chronology remains unresolved under era=undated.","uncertainty":"This records a proposal reported by the source. It does not assert that the experiment was performed, that gravity was experimentally demonstrated to be quantum, or that the proposal establishes current frontier status.","units":"Micron size is qualitative in the retained abstract; no numerical mass or precision is asserted."},"statement":"Bose and coauthors reported a proposal for a laboratory test in which gravitational interaction between two micron-size test masses could entangle them, with correlations between one embedded spin in each test mass proposed as the entanglement witness.","support":[{"end":288,"quote":"Title:\nA Spin Entanglement Witness for Quantum Gravity","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":234},{"end":233,"quote":"[Submitted on 19 Jul 2017]","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":207},{"end":1616,"quote":"Here, we introduce an idea for such a test based on the principle that two objects cannot be entangled without a quantum mediator. We show that despite the weakness of gravity, the phase evolution induced by the gravitational interaction of two micron size test masses in adjacent matter-wave interferometers can detectably entangle them even when they are placed far apart enough to keep Casimir-Polder forces at bay. We provide a prescription for witnessing this entanglement, which certifies gravity as a quantum coherent mediator, through simple correlation measurements between two spins: one embedded in each test mass.","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":991},{"end":1925,"quote":"Subjects:\nQuantum Physics (quant-ph)\n; General Relativity and Quantum Cosmology (gr-qc); High Energy Physics - Theory (hep-th)","source_id":"src.qg.bose-2017","source_sha256":"77a3e853348ae40020f0e561146ef065599c6c509df6f3617ceea2bf813d1087","start":1799}],"target_id":"paper.bose-spin-entanglement-witness-2017","target_kind":"node","target_sha256":"fb2e59dd9f68228e3e725be699fe961732955605ba1c339dc2aaed33d80cc8d7"}],"physical.balacuo-resistive-onset-1986":[{"id":"assertion.hts.01","scope":{"assumptions":["Annealing below 900 degrees C under reducing conditions"],"population":"Multiphase oxygen-deficient polycrystalline Ba-La-Cu-O; x=1 or 0.75, y>0","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1986","uncertainty":"Tentative resistive interpretation in the original abstract; no claim here of bulk Meissner confirmation.","units":{"resistivity_change":"orders of magnitude","temperature":"K"}},"statement":"Bednorz and Mueller reported an abrupt resistivity decrease of up to three orders of magnitude in multiphase, oxygen-deficient polycrystalline Ba-La-Cu-O samples, with the highest onset in the 30 K range and suppression at high current density; they described this as reminiscent of percolative superconductivity.","support":[{"end":1167,"quote":"Metallic, oxygen-deficient compounds in the Ba-La-Cu-O system, with the composition BaxLa5-xCu5O5(3-y) have been prepared in polycrystalline form. Samples with x=1 and 0.75, y>0, annealed below 900°C under reducing conditions, consist of three phases, one of them a perovskite-like mixed-valent copper compound. Upon cooling, the samples show a linear decrease in resistivity, then an approximately logarithmic increase, interpreted as a beginning of localization. Finally an abrupt decrease by up to three orders of magnitude occurs, reminiscent of the onset of percolative superconductivity. The highest onset temperature is observed in the 30 K range. It is markedly reduced by high current densities. Thus, it results partially from the percolative nature, bute possibly also from 2 D superconducting fluctuations of double perovskite layers of one of the phases present. © 1986 Springer-Verlag.","source_id":"source.bednorz-ibm-abstract","source_sha256":"c2fdd644df3b748c793b2a7c5e8bf5e5e91ccc988e004d6a364bae95906289ee","start":268}],"target_id":"physical.balacuo-resistive-onset-1986","target_kind":"node","target_sha256":"f02bb230a77807ae817f471a8b2f520b3ad3fa25c9bbcdcfab6d9d22d6711488"}],"physical.bzo-ybco-in-field-current-2004":[{"id":"assertion.hts.06","scope":{"assumptions":["Comparison accounts for film thickness; transport at 75.5 K; field parallel to c for field-dependence measurements"],"population":"Studied PLD YBCO films with BaZrO3 additions on single-crystal and buffered IBAD-MgO substrates","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2004","uncertainty":"Approximate, field-dependent improvements; not all temperatures, orientations, tape lengths, or REBCO formulations. Mechanistic attribution is the authors’ interpretation.","units":{"Jc_ratio":"dimensionless approximate factor","magnetic_field":"T","temperature":"K"}},"statement":"MacManus-Driscoll et al. reported that BaZrO3 additions to pulsed-laser-deposited YBCO films improved thickness-accounted in-field critical current densities by about 1.5–2 times over roughly 1–5 T and about 5 times at 7 T in the studied single-crystal and IBAD-MgO substrate samples; the transport study used 75.5 K and associated the enhancement with stronger vortex pinning.","support":[{"end":4280,"page":2,"quote":"We show that nano-particles of BaZrO3 grow heteroepitaxially within laser ablated\nYBCO films. These particles are easily incorporated in the films from the source target of\na ceramic BaZrO3/YBCO mixture. The particles lead to significant improvement in the\nin-field Jc (at 75.5K) in films both on single crystal substrates and on practical, buffered\nmetallic substrates.","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":3910},{"end":7557,"page":3,"quote":"The striking result of Figure 1 is the upwards shift in both normalised Jc and J                       c for the\nYBCO+BaZrO3 samples. Identical behaviours were observed for the two other samples\nmeasured on single crystal substrates (13 and 83).  Even though the YBCO+BaZrO3\nsamples of Figure 1 have slightly lower T              c’s than the pure ones, the in-field Jc’s  are\nimproved significantly. Hence, the BaZrO3 addition has clearly increased the\nirreversibility field. On both the single crystal and IBAD-MgO substrates, accounting for\nthe thickness differences between samples the Jc values are around a factor of 1.5-2\nhigher over a wide field range (~1-5T) and they increase to a factor of around 5 higher at\n7T. In ~1µm thick YBCO+BaZrO3 films on IBAD, J                        c’s remain in excess of 0.1MA.cm-2\nat 4.5T.","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":6724},{"end":7887,"page":3,"quote":"The inset of Figure 1 a shows the angular dependence of Jc measured in a field of 1T for\nthe samples on STO single crystal. A shift upwards in the relative height of the c-axis\nangular peak is observed for YBCO+BaZrO3 compared to the pure YBCO, indicative of\nstrong pinning defects along the c-axis in the YBCO+BaZrO3 film [17].","source_id":"source.macmanus-driscoll-bzo","source_sha256":"683e1190946153490e162e026bbf15cfe7a0ef9484806fb5bce6e5929e12b354","start":7559}],"target_id":"physical.bzo-ybco-in-field-current-2004","target_kind":"node","target_sha256":"dc2cb65158542d0dfdf329f86ed22e893fe3d30837767d23916d0ab5403d3a81"}],"physical.density-functional-theory":[{"id":"assertion.complete.physical.density-functional-theory","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Density functional theory in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Density functional theory as: A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","support":[{"end":668,"quote":"A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","source_id":"nlm-mesh.7ab391e314472715de34","source_sha256":"c14bea511894a5e34f38cec5010fa0f6bffd261ac43ad5a8c0108c5cee02b757","start":380}],"target_id":"physical.density-functional-theory","target_kind":"node","target_sha256":"2ebe201c4bfbb547b6b4f3e9386e194307971cb2bc4a96f538e0f8a3d6d91e5d"}],"physical.high-field-rebco-fusion-pathway":[{"id":"assertion.hts.12","scope":{"assumptions":["Prospective tokamak design; field on coil differs from field at plasma center"],"population":"High-field tokamak pathway and representative-scale stand-alone magnet qualification described by the authors","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2023 author preprint","uncertainty":"A proposal with a demonstrated magnet component; no plasma performance, net electricity, plant economics, neutron lifetime, or current 2026 frontier status is asserted.","units":{"magnetic_field":"T; distinguish coil peak and plasma center"}},"statement":"Hartwig et al. describe a proposed fusion pathway using REBCO superconducting toroidal-field coils above 20 T peak field on the coil, corresponding to 8–12 T in the plasma center. The model-coil program qualifies representative-scale magnet technology for this pathway; stand-alone magnet qualification is distinct from demonstrated fusion electricity generation.","support":[{"end":20892,"page":4,"quote":"mid-2010s [25]. Anchored in the record-setting plasma physics                      inherently scalable on rapid timescales. The second part would\nperformance  of  Alcator  C-Mod  in  2016           [26],  this  new  high-        undertake the scale-up of the conductor/coil technology into a\nfield  path  proposes  the  use  of  superconducting           TF   magnets        representative   scale   magnet,   or   “model   coil”,   that   would\nexceeding  20  T  peak  field-on-coil  (8         –  12  T  in  the  plasma        ultimately   qualify   the   design,   fabrication,   modeling,   and\ncenter) based on REBCO.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":20270},{"end":24565,"page":4,"quote":"model coils have historically played a critical role in advancing\nengineering-relevant   form   factor         remained     decades  in   the        superconducting  fusion  magnets,  confirming  the  arrival  of  a\nfuture, several theoretical papers emerged in the following few                    step-change in this key enabling technology.\nyears   that   examined   the   advantageous   physics,   cost,   and\ncomplexity implications of superconducting toroidal field coils                        IV. BRIEF REVIEW OF LARGE-SCALE  SUPERCONDUCTING\napproaching      20   T   [24   -25].   Only    relatively   recently     has                        FUSION MAGNET TEST PROGRAMS\nsufficiently  high performance REBCO coated conductor tape                            Superconducting   magnet   systems   for   fusion   embody\nbeen characterized and manufactured at the industrial volumes                      substantial scale, cost, schedule, complexity, and risk. From a\nand cost levels required to actually design and build large-scale                  physics   perspective,   the   design,   operation,   and   ultimately\nhigh-field fusion magnets [30].                                                    fusion performance of the machine is fundamentally set by the\n   An  important  engineering  study of  a  toroidal  field  (TF)                  magnetic  fields,  making  achievement  of  the  magnet  design\nmagnet with modern REBCO superconductor was carried out                            specifications imperative. From an engineering perspective, the\nin 2011 [31] as part of the conceptual design activities for the                   magnet   systems   are   heavily   integrated   into   the   device\nVULCAN tokamak [32]. The study was the first to highlight                          superstructure, making them difficult or impossible to replace\nsignificant advantages of high-field REBCO-based magnets for                       or  repair.  Thus,  while  advances  in  superconducting  magnet\ntokamaks,  including  feasible  TF  magnets  approaching  20  T                    technology can often bring transformational benefits to a fusion\npeak field-on-coil, an optimized operational temperature of 20                     machine, it is imperative that the technology be derisked  before\nK,  tolerance  of  large  nuclear  heating,  and  demountable  low-                being utilized in a fusion device. Therefore, the integration of\nresistance   joints.     Since   that   time,   several   physics   and            major  advances  in  superconducting  magnet  technology  has\nengineering  assessments        reinforcing  and  extending       the  scale,      historically    been    preceded    by    signficant    research    and\nschedule,  cost,  and  plasma-physics  advantages  of  high-field                  development programs on specially designed “model coils” that\nfusion  energy  powerplants        based  on  REBCO  magnets            have       achieve fusion device magnet relevant scale and performance\nbeen carried out for conventional aspect ratio tokamaks  [33],                     but  often  in  a  stand-alone  configuration  in  specialized  test\nspherical tokamaks       [34], and stellarators [35].                              facilities for efficiency.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":21262},{"end":2776,"page":1,"quote":"The SPARC Toroidal Field Model Coil (TFMC)                               of  sixteen REBCO stack           -in-plate style pancakes and twoij\nProgram      was  a  three-year       effort  between  2018  and  2021              termination  plates  inside  a  Nitronic-50  structural  case,\nthat developed novel Rare Earth Yttrium Barium Copper                               which  also  serves  as  a  pressure  vessel  for  the              cryogenic\nOxide  (REBCO)  superconduc               tor  technologies  and  then              coolant flowing through channels in the winding pack. To\nsuccessfully utilized these technologies to design, build, and                      execute the TFMC tests, a new magnet test facility was built\ntest a first-in-class, high-field (~20 T), representative-scale","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":1976}],"target_id":"physical.high-field-rebco-fusion-pathway","target_kind":"node","target_sha256":"50459204dcdae39f894ce9222ea898dac12016ded8c524db29f639e3baf502ac"}],"physical.nuclear-fission":[{"id":"assertion.complete.physical.nuclear-fission","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear fission in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear fission as: Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","support":[{"end":581,"quote":"Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","source_id":"nlm-mesh.318cd4bb9106898947d3","source_sha256":"a248b1d9541683897120e7d777f26227a26d6f3c83b242a2d22bd62caf759065","start":412}],"target_id":"physical.nuclear-fission","target_kind":"node","target_sha256":"1df0f0ef0a8556bd73bfbc19947d49f46a03672d8e60534cd6790ca1b28c77e5"}],"physical.nuclear-fusion":[{"id":"assertion.complete.physical.nuclear-fusion","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear fusion in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear fusion as: Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","support":[{"end":577,"quote":"Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","source_id":"nlm-mesh.544020cbe017717b1a9e","source_sha256":"44be36f97a12606c3649a50efb26f02ae84851170c8a1ecd8f7bd7625f23900e","start":411}],"target_id":"physical.nuclear-fusion","target_kind":"node","target_sha256":"b9c479170e6a02e34e35f870b2f162a0c3b7ec251f53038d86659a8599dfb224"}],"physical.nuclear-physics":[{"id":"assertion.complete.physical.nuclear-physics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Nuclear physics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Nuclear physics as: The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","support":[{"end":612,"quote":"The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","source_id":"nlm-mesh.07b63efcca979228caf2","source_sha256":"278df774aaee7727e14a1b72239682ca8d08e0c88665c99902c655d380547d14","start":411}],"target_id":"physical.nuclear-physics","target_kind":"node","target_sha256":"a5f4ac06f9d6bf538f6611c8a59afc24303b07eb09ba8cccd9a30c168d94bdfb"}],"physical.phonons":[{"id":"assertion.complete.physical.phonons","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Phonons in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Phonons as: Quanta of acoustic energy which move at the speed of sound.","support":[{"end":409,"quote":"Quanta of acoustic energy which move at the speed of sound.","source_id":"nlm-mesh.eec83cc55bf64504604d","source_sha256":"0d1456dadf7b7890cf29d0fb2d50673e011c768a69f8fc6dfb2136e1863f228d","start":350}],"target_id":"physical.phonons","target_kind":"node","target_sha256":"4dec729d6387641230f3a0586c2d8b65d13ec1df15199329742af9cbf510afe4"}],"physical.quantum-mechanics":[{"id":"assertion.complete.physical.quantum-mechanics","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Quantum mechanics in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Quantum mechanics as: The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","support":[{"end":570,"quote":"The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","source_id":"nlm-mesh.87b2a38d9d82c9b74732","source_sha256":"e4f4947e2a24b6f99592d2ef283d9c9eaae612652a2d139934cbce44846a2b40","start":364}],"target_id":"physical.quantum-mechanics","target_kind":"node","target_sha256":"00a0593abba6525a2d2cd9c96f587573831fba87f91c2166eae2631f80a93210"}],"physical.si-system":[{"id":"assertion.complete.physical.si-system","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"International System of Units in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes International System of Units as: A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","support":[{"end":853,"quote":"A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","source_id":"nlm-mesh.c66f441f7c1286f2be8b","source_sha256":"f260cba08ebb28abd8027f5405b328ff752f2cc51c3532402a7328ab61901ad8","start":468}],"target_id":"physical.si-system","target_kind":"node","target_sha256":"14b398a587b87b3d400a0bb9120dcf0226d353e471874b111c6e86dbca0808ca"}],"physical.superconductivity":[{"id":"assertion.complete.physical.superconductivity","scope":{"assumptions":"Attributed scope-note definition; not an original scientific result or claim of current consensus","population":"Superconductivity in the captured NLM MeSH descriptor","quantifiers":"Only this named descriptor and the conditions expressly stated in its scope note or hierarchy","time":null,"uncertainty":"Definition and classification are publisher-attributed; historical priority, acceptance and current frontier standing unresolved","units":null},"statement":"NLM MeSH describes Superconductivity as: The ability of an element or metallic alloy to allow the passage of ELECTRONS without ELECTRICAL RESISTANCE and expel MAGNETIC FIELDS below a certain threshold temperature called superconducting transition temperature.","support":[{"end":578,"quote":"The ability of an element or metallic alloy to allow the passage of\nELECTRONS\nwithout\nELECTRICAL RESISTANCE\nand expel\nMAGNETIC FIELDS\nbelow a certain threshold temperature called superconducting transition temperature.","source_id":"nlm-mesh.ea1a6d368c155be3d8c0","source_sha256":"74d7c5731bddb0649e0d12ec03f350013c649c8453003008ec8bdb6280dad094","start":360}],"target_id":"physical.superconductivity","target_kind":"node","target_sha256":"c63d3cdf4aa8a008f4baef9402a661180d67908769dee9f0be19e845ee5634bd"}],"physical.tfmc-20-1t-demonstration":[{"id":"assertion.hts.09","scope":{"assumptions":["Terminal current is not individual tape current; peak conductor field is not plasma-axis field"],"population":"Representative-scale SPARC Toroidal Field Model Coil; conductor peak field and case stress","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"Reported program result; no net fusion gain, electrical generation, or reactor-duration operation is established.","units":{"Lorentz_loading":"kN/m","case_stress":"GPa (almost 1)","magnetic_field":"T (peak conductor field)","terminal_current":"kA"}},"statement":"Hartwig et al. reported TFMC reaching 20.1 T peak field on the conductor at 40.5 kA terminal current, with 815 kN/m Lorentz loading on the REBCO stacks and almost 1 GPa stress accommodated by the structural case.","support":[{"end":7880,"page":2,"quote":"REBCO magnet, achieving 20.1 T peak field-on-conductor                                                     I . INTRODUCTION\nwith  40.5 kA      of  terminal  current,  815  kN/m  of  Lorentz                             he   SPARC   Toroidal   Field   Model   Coil   (TFMC)\nloading  on  the  REBCO  stacks,  and  almost  1  GPa  of\nmechanical  stress      accommodated  by  the  structural  case.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":7486}],"target_id":"physical.tfmc-20-1t-demonstration","target_kind":"node","target_sha256":"9bd9644af3a10798adb9a033b9e92cca41b7db7db4b186e10bddf93f02d425a0"}],"physical.tfmc-open-circuit-quench-damage":[{"id":"assertion.hts.11","scope":{"assumptions":["Terminal current 31.5 kA; coil intentionally not optimized for quench resilience"],"population":"Intentional open-circuit quench of the TFMC","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"2021 test campaigns reported in the 2023 preprint","uncertainty":"This failure mode does not invalidate the successful DC field test or show that all NINT designs fail; protection at reactor scale remains a separate engineering obligation.","units":{"terminal_current":"kA"}},"statement":"Hartwig et al. reported localized thermal damage following an intentional open-circuit TFMC quench at 31.5 kA terminal current. The TFMC was deliberately not optimized for quench resiliency, so this experiment assessed passive self-protection rather than demonstrating damage-free protection for fusion-scale NINT coils.","support":[{"end":10795,"page":2,"quote":"Finally,       the  feasibility  of    using    passive,  self-      new  superconducting  magnet  test  facility  was  established  at\nprotection against a quench in a fusion           -scale NI TF coil was          MIT  to  serve  as  the  proving  grounds  for  the  experimental\nexperimentally assessed. While the TFMC was intentionally                        demonstration    of    the    magnet.        The    test    facility    itself\nnot optimized for quench resiliency           – and suffered localized           incorporated  novel  advances  in  both  REBCO  and  cryogenic\nthermal damage in response to an intentional open-circuit                        technology to meet the technical and schedule requirements for\nquench at 31.5 kA terminal current            – the extensive data and           testing the magnet. The magnet and test facility, shown together\nvalidated models that it produced            represent a critical step           in Fig. 1, were combined in the fall of 2021 to carry out a series\ntowards this important objective.","source_id":"source.hartwig-tfmc-preprint","source_sha256":"a865951b64d2dddd1c0cfb67828e38d9d5e720bed57c7e7b9215fad17b047b5e","start":9737}],"target_id":"physical.tfmc-open-circuit-quench-damage","target_kind":"node","target_sha256":"b84a6d3b91eb4a45c9162ed21a95810eb73b21b56b847cf42c79827b9877fe41"}],"physical.ybco-grain-boundary-orientation-1988":[{"id":"assertion.hts.03","scope":{"assumptions":["Basal-plane grain misorientation is the varied parameter"],"population":"YBCO bicrystals; implication scoped to pure polycrystalline samples","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1988","uncertainty":"Author-institution abstract only; its incomplete chemical formula and malformed large-angle numerical ratio are not repaired or interpreted.","units":null},"statement":"Dimos et al. measured grain-boundary critical current densities as a function of basal-plane misorientation in YBCO bicrystals and concluded that strong texture both normal to and within the basal plane is important for very high critical currents in pure polycrystalline samples.","support":[{"end":932,"quote":"The critical current densities across grain boundaries have been measured as a function of misorientation angle in the basal plane of bicrystals of YBa2Cu3O7-. For small misorientation angles, the ratio of the grain-boundary critical current density to the bulk critical current density is roughly proportional to the inverse of the misorientation angle; for large angles, this ratio saturates to a value of about 150. These results imply that achieving a high degree of texture both normal to and within the basal plane is important for the obtaining of very high critical currents in pure polycrystalline samples. © 1988 The American Physical Society.","source_id":"source.dimos-ibm-abstract","source_sha256":"3eaa8518b7702787a3c8b9a2a9f95aba42cfa4f8be689bf422b0807165917120","start":279}],"target_id":"physical.ybco-grain-boundary-orientation-1988","target_kind":"node","target_sha256":"0a700081fbfc62706ba75fe66f789404804dc1080b15f7fbaa8f89dd3c48e251"}],"physical.ybco-tricrystal-half-flux-1994":[{"id":"assertion.hts.05","scope":{"assumptions":["Scanning superconducting quantum interference device microscopy at 4.2 K"],"population":"YBa2Cu3O7-delta rings with 0, 2, and 3 grain-boundary Josephson junctions","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1994","uncertainty":"Consistency with d-wave symmetry is retained; the experiment does not select a unique microscopic pairing interaction. Formula typography in the web abstract is not used to derive a new quantity.","units":{"flux":"half of a magnetic flux quantum","temperature":"K"}},"statement":"Tsuei et al. used scanning SQUID microscopy at 4.2 K to observe spontaneous half-flux-quantum magnetization in a YBa2Cu3O7-delta ring with three grain-boundary Josephson junctions, but not in the two-junction rings; the authors reported consistency with d-wave pairing symmetry.","support":[{"end":864,"quote":"We have used the concept of flux quantization in superconducting YBa2Cu3O7-δ rings with 0, 2, and 3 grain-boundary Josephson junctions to test the pairing symmetry in high-Tc superconductors. The magnetic flux threading these rings at 4.2 K is measured by employing a scanning superconducting quantum interference device microscope. Spontaneous magnetization of a half magnetic flux quantum, Φ02=h4e has been observed in the 3-junction ring, but not in the 2-junction rings. These results are consistent with d-wave pairing symmetry. © 1994 The American Physical Society.","source_id":"source.tsuei-ibm-abstract","source_sha256":"bf6401b58e54c1c872a40d5d9ce058e9820024b87c877034c7063e25496d221d","start":293}],"target_id":"physical.ybco-tricrystal-half-flux-1994","target_kind":"node","target_sha256":"2f2b081eb04a9b4284b879f49dc420d8c37a5342552b0e25257f2e279eeb94bf"}],"physical.ybcuo-80-93k-1987":[{"id":"assertion.hts.02","scope":{"assumptions":["Ambient pressure; liquid-nitrogen Dewar"],"population":"Mixed-phase Y-Ba-Cu-O compound system described in Wu et al.","quantifiers":"Only the cited samples, apparatus, or proposal; no universal extension.","time":"1987","uncertainty":"The machine-bound support is a secondary NASA catalogue summary, not a captured full paper; no single-phase composition or precise critical-field measurement is asserted.","units":{"temperature":"K"}},"statement":"NASA’s catalogue summary of Wu et al. reports a stable, reproducible superconductivity transition between 80 and 93 K in a mixed-phase Y-Ba-Cu-O compound system at ambient pressure, maintained in a liquid-nitrogen Dewar.","support":[{"end":906,"quote":"Superconductivity at 93 K in a new mixed-phase Y-Ba-Cu-O compound system at ambient pressure - NASA Technical Reports Server (NTRS)\nNTRS\nNTRS - NASA Technical Reports Server\nSearch\nmore_vert\nCollections\nAbout\nNews\nHelp\nLogin\nPress Enter or click the Search button to begin your search.\nBack to Results\nSuperconductivity at 93 K in a new mixed-phase Y-Ba-Cu-O compound system at ambient pressure\nA stable and reproducible superconductivity transition between 80 and 93 K has been achieved and maintained in a Y-Ba-Cu-O compound system at ambient pressure in a simple liquid-nitrogen Dewar. An upper critical field Hc2(0) estimate of between 80 and 180 T is obtained, and the paramagnetic limiting field at 0 K for a sample with a T(c) of about 90 K is 165 T. It is suggested that the lattice parameters, the valence ratio, and the sample treatments all play a role in achieving superconductivity above 77 K.","source_id":"source.wu-nasa-catalogue","source_sha256":"8d0e40bf57fc80eefb78075aae8ff7137a9ca6e53e8ef3a9ffa20e9e383cdb6a","start":0}],"target_id":"physical.ybcuo-80-93k-1987","target_kind":"node","target_sha256":"16a045ce8a0307e315a087d0408d2e32b07e299fd8f3b761774bba8062f68b53"}],"practice.agriculture":[{"id":"assertion.complete.practice.agriculture","scope":{"assumptions":"Source-attributed discipline or activity definition, not original research evidence","population":"Agriculture as described in the USGS Thesaurus","quantifiers":"Only this named term and the explicit retained definition or category hierarchy","time":null,"uncertainty":"Vocabulary publisher attribution; chronology and latest frontier standing unresolved","units":null},"statement":"USGS Thesaurus defines Agriculture as: The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","support":[{"end":194,"quote":"The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","source_id":"usgs-thesaurus.8faa7636b7aa8527a5ab","source_sha256":"ef7e0a02eac5837139c50fb3de7c9be3c1b15b03a2bbc1e6318044a29e1b0b86","start":80}],"target_id":"practice.agriculture","target_kind":"node","target_sha256":"02a4558adf1711033c1fc0fa011e5cb3c8f84727fe8de0fc8aa3a06978bdbdf5"}],"question.wikipedia.abc-conjecture":[{"id":"assertion.question.wikipedia.abc-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abc conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abc conjecture\", CC BY-SA 4.0) states: The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","support":[{"end":274,"quote":"The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","source_id":"wikipedia.article.abc-conjecture","source_sha256":"62c68fec9d36ce263e1cae017c7ef34f0933b47e9c5b8a644e519e0362a52b7e","start":100}],"target_id":"question.wikipedia.abc-conjecture","target_kind":"node","target_sha256":"7d397ac889be584d1a3efcbc0f7cda84d7acc225fe3ef8f5a3f59e10dfac3102"}],"question.wikipedia.atiyah-jones-conjecture":[{"id":"assertion.question.wikipedia.atiyah-jones-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atiyah–Jones conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atiyah–Jones conjecture\", CC BY-SA 4.0) states: In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","support":[{"end":225,"quote":"In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","source_id":"wikipedia.article.atiyah-jones-conjecture","source_sha256":"a93dd07d0f8c2d6d8c1717d7ebd66c9570f3b9502fb59985de27958d659e91d9","start":111}],"target_id":"question.wikipedia.atiyah-jones-conjecture","target_kind":"node","target_sha256":"0802a0c103f465e1db66237ac8120de53d2b69e7d53bea3b43078b2e9ce83e51"}],"question.wikipedia.brauer-s-k-b-conjecture":[{"id":"assertion.question.wikipedia.brauer-s-k-b-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brauer's k(B) conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brauer's k(B) conjecture\", CC BY-SA 4.0) states: Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","support":[{"end":318,"quote":"Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","source_id":"wikipedia.article.brauer-s-k-b-conjecture","source_sha256":"46c2dcd737d17a61bea4b18e5f38c11ec1bf8867d470cc3a7cf2fa91ddec7cb4","start":112}],"target_id":"question.wikipedia.brauer-s-k-b-conjecture","target_kind":"node","target_sha256":"b79da461c6e63bbbbbe548afc5f377996ff70f4e5dba9acacdc2da1fbe171fc0"}],"question.wikipedia.catalan-s-conjecture":[{"id":"assertion.question.wikipedia.catalan-s-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Catalan's conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Catalan's conjecture\", CC BY-SA 4.0) states: Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","support":[{"end":318,"quote":"Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","source_id":"wikipedia.article.catalan-s-conjecture","source_sha256":"1b168c853ec6174cf03f7ad55c8e002f6afb09e1fd8e6b50e25421543dbdab03","start":105}],"target_id":"question.wikipedia.catalan-s-conjecture","target_kind":"node","target_sha256":"3a67ccc4017521b28143fa8be1ceab3db57508b073b8c83ae52f5d4546fb6234"}],"question.wikipedia.chang-s-conjecture":[{"id":"assertion.question.wikipedia.chang-s-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chang's conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chang's conjecture\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","support":[{"end":339,"quote":"In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","source_id":"wikipedia.article.chang-s-conjecture","source_sha256":"fff4879ec2e91e74695b59c5fa65ce79caf55cdb794787f912daf2861e49a073","start":106}],"target_id":"question.wikipedia.chang-s-conjecture","target_kind":"node","target_sha256":"39538d1b7021876a177de614ed4a6690a3408840f07720a1da6f26809d53a2af"}],"question.wikipedia.conjecture":[{"id":"assertion.question.wikipedia.conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Conjecture\", CC BY-SA 4.0) states: In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","support":[{"end":193,"quote":"In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","source_id":"wikipedia.article.conjecture","source_sha256":"1c3a3640dcdffc248b3b57328deb3ec8f79bb8867e002aebeba2158211be1557","start":94}],"target_id":"question.wikipedia.conjecture","target_kind":"node","target_sha256":"c6f1dcd059955f74a46ec645333513e9c510ac92ffb0c2e9a221770e2be82f6e"}],"question.wikipedia.ehrenpreis-conjecture":[{"id":"assertion.question.wikipedia.ehrenpreis-conjecture","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ehrenpreis conjecture as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ehrenpreis conjecture\", CC BY-SA 4.0) states: In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","support":[{"end":382,"quote":"In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","source_id":"wikipedia.article.ehrenpreis-conjecture","source_sha256":"30c1368403b6ec2350615d1f48ded5d9b7432f1a4414a55f78b526d4b7c1537d","start":109}],"target_id":"question.wikipedia.ehrenpreis-conjecture","target_kind":"node","target_sha256":"8b2744a3a93bf8367847fe01da64d78fdc9038e7c2acaec302d64a61155b237b"}],"theory.ads-cft":[{"id":"assertion.complete.theory.ads-cft","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Maldacena conjectures that particular M/string-theory compactifications on Anti-de Sitter spacetimes are dual to particular conformal field theories, using a large-N and low-energy construction.","support":[{"end":1635,"quote":"We show that the large $N$ limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of Anti-deSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and then taking a low energy limit where the field theory on the brane decouples from the bulk. We observe that, in this limit, we can still trust the near horizon geometry for large $N$. The enhanced supersymmetries of the near horizon geometry correspond to the extra supersymmetry generators present in the superconformal group (as opposed to just the super-Poincare group). The 't Hooft limit of 4-d ${\\cal N} =4$ super-Yang-Mills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various Anti-deSitter spacetimes are dual to various conformal field theories. This leads to a new proposal for a definition of M-theory which could be extended to include five non-compact dimensions.","source_id":"completion-source.48a4e93c4a296f7c82a6","source_sha256":"fd6882fd8e57ec4d5ebab74feb11144542413675abdd3d1c9854a8ba53b0c980","start":567}],"target_id":"theory.ads-cft","target_kind":"node","target_sha256":"df605ba56fbb0b8e3c510d7cbc78ff055665bc7fb3e1cc534715cfee8dff84ed"}],"theory.asymptotic-safety":[{"id":"assertion.complete.theory.asymptotic-safety","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Reuter and Saueressig describe the Asymptotic Safety program in Quantum Einstein Gravity through the effective average action and a proposed non-trivial renormalization-group fixed point. Their review summarizes supporting evidence, rather than establishing universal validity.","support":[{"end":1122,"quote":"A scale--dependent effective action for gravity is introduced and an exact nonperturbative evolution equation is derived which governs its renormalization group flow. It is invariant under general coordinate transformations and satisfies modified BRS Ward--Identities. The evolution equation is solved for a simple truncation of the space of actions. In 2+epsilon dimensions, nonperturbative corrections to the beta--function of Newton's constant are derived and its dependence on the cosmological constant is investigated. In 4 dimensions, Einstein gravity is found to be ``antiscreening'', i.e., Newton's constant increases at large distances.","source_id":"completion-source.2c0649ad63e4e38974e2","source_sha256":"69d0e5fb19a9f49f747ed909e3ee75bd63d83c320cf3ac12343f075a12604743","start":477},{"end":1075,"quote":"We give a pedagogical introduction to the basic ideas and concepts of the Asymptotic Safety program in Quantum Einstein Gravity. Using the continuum approach based upon the effective average action, we summarize the state of the art of the field with a particular focus on the evidence supporting the existence of the non-trivial renormalization group fixed point at the heart of the construction. As an application, the multifractal structure of the emerging space-times is discussed in detail. In particular, we compare the continuum prediction for their spectral dimension with Monte Carlo data from the Causal Dynamical Triangulation approach.","source_id":"completion-source.8f929def81c8e1f18329","source_sha256":"fb0d0c47d70eadfdb8276ebdf26a5240bd027bdd37a14168ce0e1a07701a91f8","start":428}],"target_id":"theory.asymptotic-safety","target_kind":"node","target_sha256":"549ef746bd5ce4440c990e85f9d507792997c8bfc89c8bd65d370377464ecbf2"}],"theory.axion-dark-matter":[{"id":"assertion.complete.theory.axion-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited ADMX analysis tests the hypothesis that axions constitute dark matter, using a strong-field microwave-cavity haloscope and conditional exclusions of DFSZ axions.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810}],"target_id":"theory.axion-dark-matter","target_kind":"node","target_sha256":"a0c67b37ae8a01cd122dcaaf6dff4d897d74153a940473dfdfaecec4e10a75c9"}],"theory.cosmic-ray-boosted-dark-matter":[{"id":"assertion.complete.theory.cosmic-ray-boosted-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited LZ search considers a scenario in which collisions with Milky Way cosmic rays boost otherwise light dark-matter candidates above a nuclear-recoil detection threshold. It reports no excess above expected backgrounds.","support":[{"end":4332,"quote":"While dual-phase xenon time projection chambers (TPCs) have driven the sensitivity towards weakly interacting massive particles (WIMPs) at the GeV/c^2 to TeV/c^2 mass scale, the scope for sub-GeV/c^2 dark matter particles is hindered by a limited nuclear recoil energy detection threshold. One approach to probe for lighter candidates is to consider cases where they have been boosted by collisions with cosmic rays in the Milky Way, such that the additional kinetic energy lifts their induced signatures above the nominal threshold. In this Letter, we report first results of a search for cosmic ray-boosted dark matter (CRDM) with a combined 4.2 tonne-year exposure from the LUX-ZEPLIN (LZ) experiment. We observe no excess above the expected backgrounds and establish world-leading constraints on the spin-independent CRDM-nucleon cross section as small as 3.9 * 10^{-33} cm^2 at 90% confidence level for sub-GeV/c^2 masses.","source_id":"completion-source.ca2f071869124aba11d9","source_sha256":"de36e65070f660117d3306d56f733ab8340cee7799ce197403f30c36b3fee08d","start":3405}],"target_id":"theory.cosmic-ray-boosted-dark-matter","target_kind":"node","target_sha256":"8f8b76a7c94891eb015f97d705b82069894a0d400fedf34bb8dfb5c6dd48eada"}],"theory.dfsz-axion":[{"id":"assertion.complete.theory.dfsz-axion","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The ADMX Run 1B paper describes the Dine-Fischler-Srednicki-Zhitnitsky (DFSZ) model as a benchmark for axion experiments, characterized by its axion-photon coupling.","support":[{"end":2395,"quote":"Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over the mass range 2.81--3.31 $\\mu$eV, corresponding to the frequency range 680--790 MHz. Using an axion haloscope consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a few gaps due to mode crossings. This paper explains the full ADMX analysis for Run 1B, motivating analysis choices informed by details specific to this run.","source_id":"completion-source.0bceed5f1bb7bb990e81","source_sha256":"d040c43aeb2195a4cc068db7180ad40616e71beba2f01d8e729ae07353636430","start":1810},{"end":7061,"page":1,"quote":"                                 Axion Dark Matter eXperiment: Run 1B Analysis Details\n\n      C.Bartram,1, * T. Braine,1 R. Cervantes,1 N. Crisosto,1 N. Du,1 G. Leum,1 L. J Rosenberg,1 G. Rybka,1 J. Yang,1 D.\n        Bowring,2 A. S. Chou,2 R. Khatiwada,2, 3 A. Sonnenschein,2 W. Wester,2 G. Carosi,4 N. Woollett,4 L. D. Duffy,5\n          M. Goryachev,6 B. McAllister,6 M. E. Tobar,6 C. Boutan,7 M. Jones,7 B. H. LaRoque,7 N. S. Oblath,7 M. S.\n           Taubman,7 John Clarke,8 A. Dove,8 A. Eddins,8 S. R. O’Kelley,8 S. Nawaz,8 I. Siddiqi,8 N. Stevenson,8 A.\n        Agrawal,9 A. V. Dixit,9 J. R. Gleason,10 S. Jois,10 P. Sikivie,10 J. A. Solomon,10 N. S. Sullivan,10 D. B. Tanner,10\n      E. Lentz,11 E. J. Daw,12 M. G. Perry,12 J. H. Buckley,13 P. M. Harrington,13 E. A. Henriksen,13 and K. W. Murch13\n                                                                 (ADMX  Collaboration)\n                                                 1University  of  Washington,  Seattle,  WA  98195,  USA\n                                         2Fermi  National  Accelerator  Laboratory,  Batavia  IL  60510,  USA\n                                              3Illinois  Institute  of  Technology,  Chicago  IL  60616,  USA\n                                      4Lawrence Livermore National Laboratory,  Livermore,  CA 94550,  USA\n                                          5Los  Alamos  National  Laboratory,  Los  Alamos,  NM  87545,  USA\n                                                    6University  of  Western  Australia,  WA,  Australia\n                                        7Pacific  Northwest  National  Laboratory,  Richland,  WA  99354,  USA\n                                                 8University  of  California,  Berkeley,  CA  94720,  USA\n                                                        9University  of  Chicago,  IL  60637,  USA\n                                                10University  of  Florida,  Gainesville,  FL  32611,  USA\n                                                    11University  of  G¨ottingen,  G¨ottingen,  Germany\n                                                         12University  of  Sheffield,  Sheffield,  UK\n                                                13Washington  University,  St.   Louis,  MO  63130,  USA\n                                                                 (Dated: October 14, 2020)\n                    Searching for axion dark matter, the ADMX collaboration acquired data from January to October 2018, over\n                 the mass range 2.81–3.31 µeV, corresponding to the frequency range 680–790 MHz. Using an axion haloscope\n                 consisting of a microwave cavity in a strong magnetic field, the ADMX experiment excluded Dine-Fischler-\n                 Srednicki-Zhitnisky (DFSZ) axions at 100% dark matter density over this entire frequency range, except for a\n                 few gaps due to mode crossings.  This paper explains the full ADMX analysis for Run 1B, motivating analysis\n                 choices informed by details specific to this run.\n\n\n                         I.    INTRODUCTION                                        the Peccei-Quinn (PQ) symmetry breaking.  The dimension-\n                                                                                   less coupling, gγ is related to the axion coupling to two pho-\n   An  abundance  of  astrophysical  observations  indicate  that                  tons via gaγγ = αgγ/π fa, where α is the fine structure con-\nthe majority (85% [1]) of the mass of the universe exists in                       stant, and  fa is the PQ symmetry breaking scale.  The DFSZ\nsome  unidentified  form,  called  ‘dark  matter’.   The  Lambda                    axion couples directly to both hadrons and leptons, whereas\ncold dark matter (ΛCDM) model of the universe ascribes the                         the KSVZ axion couples directly only to hadrons. In all grand\nfollowing  characteristics  to  the  dark  matter:   that  it  is  fee-            unified theories, the coupling strength of the axion to two pho-\nbly  interacting,  non-relativistic,  and  non-baryonic  [2].   One                tons is that of the DFSZ model [13].\ndark  matter  candidate,  known  as  the  axion,  solves  the  so-                    Although  a  number  of  experimental  efforts  to  detect  ax-\ncalled  strong  CP  (Charge-Parity)  problem  via  a  global  chi-                 ions are now underway, the Sikivie microwave cavity detec-\nral  symmetry  introduced  by  Peccei  and  Quinn  [3–5].   As-                    tor [14, 15], marked the first feasible means of detecting the\nsuming a typical post-inflationary scenario,  QCD (Quantum                          so-called ‘invisible’ axion.  This paper described the first ax-\nChromodynamics)  axions  in  a  mass  range  of  1–100  µeV                        ion haloscope, in which a static magnetic field provided a new\nmay  account  for  the  entirety  of  dark  matter,  if  they  ex-                 channel for the axion to decay into a photon.   The process,\nist [6–8].  Two models, the KSVZ (Kim-Shifman-Vainshtein-                          known  as  inverse  Primakoff  conversion  [16],  follows  from\nZakharov)  model  [9,  10]  and  the  DFSZ  (Dine-Fischler-                        the equations of axion electrodynamics.  The resulting excess\nSrednicki-Zhitnisky)  model  [11,  12],   are  benchmarks  for                     power from the photon could then be resonantly enhanced and\naxion  experiments  and  can  be  described  by  their  coupling                   detected in a microwave cavity.  A few years ago, the Axion\nstrengths of the axion to photons.  The dimensionless axion-                       Dark Matter eXperiment, ADMX, became the first experiment\nphoton coupling parameter, known as gγ, is smaller for DFSZ                        to reach DFSZ sensitivity.  Defined as ‘Run 1A’, this run re-\naxions than KSVZ axions by a factor of approximately 2.7,                          sulted in the reporting of a limit on gaγγ  over axion masses\nmaking  DFSZ  axions  more  challenging  to  detect.   In  both                    of 2.68–2.7 µeV [17].  The experiment recently extended this\nmodels, the strength of the axion coupling to photons is fur-                      limit to cover the range from 2.81–3.31 µeV, corresponding to\nther suppressed by the very high energy scale associated with                      a frequency range from about 680 to 790 MHz.  The result-\n                                                                                   ing data, acquired over a period between January and October\n                                                                                   of 2018, are referred to as ‘Run 1B’ [18].  This paper gives\n                                                                                   complete details of the analysis for Run 1B, assuming a fully\n* Correspondence to: chelsb89@uw.edu                                               virialized dark matter halo. While the foundation of the analy-","source_id":"completion-source.990be5f93abf672d318e","source_sha256":"5f0fdb49bed4e4247d65ecb62876e0ab29a577a82b74d6a03b5e4656870a83c5","start":0}],"target_id":"theory.dfsz-axion","target_kind":"node","target_sha256":"e35d5139e227122de6e54c3b47671a87d1b1e170bdc094b161fcd9bd283eb530"}],"theory.fuzzy-dark-matter":[{"id":"assertion.complete.theory.fuzzy-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: Extremely light bosonic dark matter with kiloparsec-scale de Broglie wavelength.","support":[{"end":2201,"quote":"We present constraints on the masses of extremely light bosons dubbed fuzzy dark matter from Lyman-$\\alpha$ forest data. Extremely light bosons with a De Broglie wavelength of $\\sim 1$ kpc have been suggested as dark matter candidates that may resolve some of the current small scale problems of the cold dark matter model. For the first time we use hydrodynamical simulations to model the Lyman-$\\alpha$ flux power spectrum in these models and compare with the observed flux power spectrum from two different data sets: the XQ-100 and HIRES/MIKE quasar spectra samples. After marginalization over nuisance and physical parameters and with conservative assumptions for the thermal history of the IGM that allow for jumps in the temperature of up to $5000\\rm\\,K$, XQ-100 provides a lower limit of 7.1$\\times 10^{-22}$ eV, HIRES/MIKE returns a stronger limit of 14.3$\\times 10^{-22}$ eV, while the combination of both data sets results in a limit of 20 $\\times 10^{-22}$ eV (2$\\sigma$ C.L.). The limits for the analysis of the combined data sets increases to 37.5$\\times 10^{-22}$ eV (2$\\sigma$ C.L.) when a smoother thermal history is assumed where the temperature of the IGM evolves as a power-law in redshift. Light boson masses in the range $1-10 \\times10^{-22}$ eV are ruled out at high significance by our analysis, casting strong doubts that FDM helps solve the \"small scale crisis\" of the cold dark matter models.","source_id":"completion-source.e36a94e93e43baa30cf8","source_sha256":"90f87e8739c5e16a1325ad89402dfc6cddbe2f6fc90da80550cc442d84d57ff4","start":782}],"target_id":"theory.fuzzy-dark-matter","target_kind":"node","target_sha256":"4feb63dd905fb06ff9e6f178db4b209af7b1e49c0f612d9384f807f1e7cfa60b"}],"theory.planetmath.banachtarskiparadox":[{"id":"assertion.theory.planetmath.banachtarskiparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Banach-Tarski paradox as stated in the captured PlanetMath entry banachtarskiparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 28A99, 03B99) states: The 3 -dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first! Let us formulate the theorem formally.","support":[{"end":228,"quote":"The\n3\n-dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first!\nLet us formulate the\ntheorem\nformally.","source_id":"planetmath.banachtarskiparadox","source_sha256":"bd0d30ca746f228c1d241a55cdceb6271ef19ae37e94aa73a492b1aa7be497a0","start":44}],"target_id":"theory.planetmath.banachtarskiparadox","target_kind":"node","target_sha256":"af0201f4807cfae313eb0fdd3de0be9f6351105849b1e4e38b6d7b90f88125a0"}],"theory.planetmath.binomialtheorem":[{"id":"assertion.theory.planetmath.binomialtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Binomial theorem as stated in the captured PlanetMath entry binomialtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 11B65, 06F25, 03E20) states: The binomial theorem is a formula for the expansion of ( a + b ) n , for n a positive integer and a and b any two real (or complex) numbers, into a sum of powers of a and b .","support":[{"end":208,"quote":"The\nbinomial theorem\nis a\nformula\nfor the expansion of\n(\na\n+\nb\n)\nn\n, for\nn\na\npositive integer\nand\na\nand\nb\nany two real (or complex) numbers, into a sum of powers of\na\nand\nb\n.","source_id":"planetmath.binomialtheorem","source_sha256":"6d7f02ac3d3f5f8dc0ef211f53a61304a9672bb8027efc3a331e8cb1860643c9","start":34}],"target_id":"theory.planetmath.binomialtheorem","target_kind":"node","target_sha256":"4dd3798552589db088b46586912b02807bc49494c982080782ddc6f0ce17738f"}],"theory.planetmath.chainrule":[{"id":"assertion.theory.planetmath.chainrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Chain rule as stated in the captured PlanetMath entry chainrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: Let f , g be differentiable , real-valued functions such that g is defined on an open set I ⊆ ℝ , and f is defined on g ⁢ ( I ) .","support":[{"end":151,"quote":"Let\nf\n,\ng\nbe\ndifferentiable\n,\nreal-valued functions such that\ng\nis defined on an open set\nI\n⊆\nℝ\n, and\nf\nis defined on\ng\n⁢\n(\nI\n)\n.","source_id":"planetmath.chainrule","source_sha256":"5c39cf428f840a394fe936b70465fa05750d739052247e8599a473d62d5f6e7a","start":22}],"target_id":"theory.planetmath.chainrule","target_kind":"node","target_sha256":"b153596c59a3be09fbc9dcd230aca3ff3222a3fb315f0848f84ba4d769b85dad"}],"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic":[{"id":"assertion.theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Deduction theorem holds for classical propositional logic as stated in the captured PlanetMath entry deductiontheoremholdsforclassicalpropositionallogic","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03F03, 03B99, 03B22) states: In this entry, we prove that the deduction theorem holds for classical propositional logic .","support":[{"end":208,"quote":"In this entry, we prove that the\ndeduction theorem holds for classical propositional logic\n.","source_id":"planetmath.deductiontheoremholdsforclassicalpropositionallogic","source_sha256":"92d61ea09568f5e86907b57321a0a977148512d225f82e920f81260186720f39","start":116}],"target_id":"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","target_kind":"node","target_sha256":"2de7f071acb02c692d9dbdc9db17db0ddffbc4c702fdf5c6f2b665f329947da9"}],"theory.planetmath.godelsincompletenesstheorems":[{"id":"assertion.theory.planetmath.godelsincompletenesstheorems","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Gödel’s incompleteness theorems as stated in the captured PlanetMath entry godelsincompletenesstheorems","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B10, 03F45) states: Gödel’s first and second incompleteness theorems are perhaps the most celebrated results in mathematical logic.","support":[{"end":175,"quote":"Gödel’s first and second\nincompleteness theorems\nare perhaps the most celebrated results in mathematical logic.","source_id":"planetmath.godelsincompletenesstheorems","source_sha256":"90e3544cc990f3a1a197238c927dd7c424be216daff0db94151cffa95dfab094","start":64}],"target_id":"theory.planetmath.godelsincompletenesstheorems","target_kind":"node","target_sha256":"9efad6815d458f850276984de0cc728fb02d9b97aa5afaa2e2607f7648bda5c9"}],"theory.planetmath.hallsmarriagetheorem":[{"id":"assertion.theory.planetmath.hallsmarriagetheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hall’s marriage theorem as stated in the captured PlanetMath entry hallsmarriagetheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 05D15) states: Let S = { S 1 , S 2 , … ⁢ S n } be a finite collection of finite sets .","support":[{"end":119,"quote":"Let\nS\n=\n{\nS\n1\n,\nS\n2\n,\n…\n⁢\nS\nn\n}\nbe a finite\ncollection\nof\nfinite sets\n.","source_id":"planetmath.hallsmarriagetheorem","source_sha256":"5cde11759639f38bc50cbed68e23406868cab519ac2fdd67cb7bbc09d4af3845","start":48}],"target_id":"theory.planetmath.hallsmarriagetheorem","target_kind":"node","target_sha256":"ee99ea53cec72c0ba2cf7c50fd7f042e2050dba288b2fab29a9803d836db6917"}],"theory.planetmath.hausdorffparadox":[{"id":"assertion.theory.planetmath.hausdorffparadox","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff paradox as stated in the captured PlanetMath entry hausdorffparadox","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25, 51M04) states: Let S 2 be the unit sphere in the Euclidean space ℝ 3 .","support":[{"end":91,"quote":"Let\nS\n2\nbe the\nunit sphere\nin the\nEuclidean space\nℝ\n3\n.","source_id":"planetmath.hausdorffparadox","source_sha256":"38c565fd0f49e709cdd604cc39ba3bd5cc35a47c7aa4ff70e5799a294f9c855f","start":36}],"target_id":"theory.planetmath.hausdorffparadox","target_kind":"node","target_sha256":"ae8944097a988323c0fa0f70044cfc62e8b88db6a428c497844da6e95d65328d"}],"theory.planetmath.hausdorffsmaximumprinciple":[{"id":"assertion.theory.planetmath.hausdorffsmaximumprinciple","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Hausdorff’s maximum principle as stated in the captured PlanetMath entry hausdorffsmaximumprinciple","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25) states: Theorem Let X be a partially ordered set . Then there exists a maximal totally ordered subset of X .","support":[{"end":160,"quote":"Theorem\nLet\nX\nbe a\npartially ordered set\n. Then there exists a maximal\ntotally\nordered\nsubset of\nX\n.","source_id":"planetmath.hausdorffsmaximumprinciple","source_sha256":"fd01bca5a7dfce46f873019f926663975017f4ee3d7f1ace40c59600fdc38f32","start":60}],"target_id":"theory.planetmath.hausdorffsmaximumprinciple","target_kind":"node","target_sha256":"46b1730809190eff6735a79e8d5c1830c576597254a6c5f819ea2aa894e3cf29"}],"theory.planetmath.inversefunctiontheorem":[{"id":"assertion.theory.planetmath.inversefunctiontheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Inverse function theorem as stated in the captured PlanetMath entry inversefunctiontheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E20) states: Let 𝐟 be a continuously differentiable , vector-valued function mapping the open set E ⊂ ℝ n to ℝ n and let S = 𝐟 ⁢ ( E ) .","support":[{"end":173,"quote":"Let\n𝐟\nbe a\ncontinuously differentiable\n,\nvector-valued function\nmapping the open set\nE\n⊂\nℝ\nn\nto\nℝ\nn\nand let\nS\n=\n𝐟\n⁢\n(\nE\n)\n.","source_id":"planetmath.inversefunctiontheorem","source_sha256":"b837d4f04821c5b33244542004edf2a3390f9b684e7ea15892ce5908b924b97f","start":50}],"target_id":"theory.planetmath.inversefunctiontheorem","target_kind":"node","target_sha256":"db7883483edf503a4ebbde9383f00bee51a4fba45af232d9598745044b5d065d"}],"theory.planetmath.mcalistercoveringtheorem":[{"id":"assertion.theory.planetmath.mcalistercoveringtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"McAlister covering theorem as stated in the captured PlanetMath entry mcalistercoveringtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 20M18) states: A subset X in an inverse semigroup S is called unitary if for any elements x ∈ X and s ∈ S , x ⁢ s ∈ X or s ⁢ x ∈ X implies s ∈ X .","support":[{"end":185,"quote":"A subset\nX\nin an\ninverse semigroup\nS\nis called\nunitary\nif for any\nelements\nx\n∈\nX\nand\ns\n∈\nS\n,\nx\n⁢\ns\n∈\nX\nor\ns\n⁢\nx\n∈\nX\nimplies\ns\n∈\nX\n.","source_id":"planetmath.mcalistercoveringtheorem","source_sha256":"76b59d230700c6bc3f2c1ad14ef9a101596827a07bf23bff0bc0fc5c401c2f1a","start":54}],"target_id":"theory.planetmath.mcalistercoveringtheorem","target_kind":"node","target_sha256":"c58dabd6d246604832b718d21c18e347d0fb31ecb9a9cbef05fb573554cc9f81"}],"theory.planetmath.polynomialringoverintegraldomain":[{"id":"assertion.theory.planetmath.polynomialringoverintegraldomain","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Polynomial ring over integral domain as stated in the captured PlanetMath entry polynomialringoverintegraldomain","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 13P05) states: Theorem . If the coefficient ring R is an integral domain , then so is also its polynomial ring R ⁢ [ X ] .","support":[{"end":181,"quote":"Theorem\n.\nIf the\ncoefficient ring\nR\nis an\nintegral domain\n, then so is also its\npolynomial ring\nR\n⁢\n[\nX\n]\n.","source_id":"planetmath.polynomialringoverintegraldomain","source_sha256":"ca702a9c74797d8c689748b62e9caf4b91e1fcf441e0fb079e9fea6633c9f886","start":74}],"target_id":"theory.planetmath.polynomialringoverintegraldomain","target_kind":"node","target_sha256":"82b92b746d71d0a72b2118e94b5098f05847a7048ed0e854d701228e31fb5906"}],"theory.planetmath.principleoffiniteinduction":[{"id":"assertion.theory.planetmath.principleoffiniteinduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Principle of finite induction as stated in the captured PlanetMath entry principleoffiniteinduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25, 00-02) states: The principle of finite induction , also known as mathematical induction , is commonly formulated in two ways.","support":[{"end":170,"quote":"The\nprinciple of finite induction\n, also known as\nmathematical induction\n, is commonly formulated in two ways.","source_id":"planetmath.principleoffiniteinduction","source_sha256":"38c9e9e538462dbb0d39ff6979402d0388bceaea48fe5ff57f7a6c49d8b4b978","start":60}],"target_id":"theory.planetmath.principleoffiniteinduction","target_kind":"node","target_sha256":"8eaaf3f385c981446621e2659378ef839863665f7b5d20a575cd242cb3a46703"}],"theory.planetmath.productrule":[{"id":"assertion.theory.planetmath.productrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Product rule as stated in the captured PlanetMath entry productrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: The product rule states that if f : ℝ → ℝ and g : ℝ → ℝ are functions in one variable both differentiable at a point x 0 , then the derivative of the product of the two functions, denoted f ⋅ g , at x 0 is given by d d ⁢ x ⁢ ( f ⋅ g ) ⁢ ( x 0 ) = f ⁢ ( x 0 ) ⁢ g ′ ⁢ ( x 0 ) + f ′ ⁢ ( x 0 ) ⁢ g ⁢ ( x 0 ) .","support":[{"end":332,"quote":"The\nproduct rule\nstates that if\nf\n:\nℝ\n→\nℝ\nand\ng\n:\nℝ\n→\nℝ\nare functions in one variable both\ndifferentiable\nat a point\nx\n0\n, then the\nderivative\nof the product of the two functions, denoted\nf\n⋅\ng\n, at\nx\n0\nis given by\nd\nd\n⁢\nx\n⁢\n(\nf\n⋅\ng\n)\n⁢\n(\nx\n0\n)\n=\nf\n⁢\n(\nx\n0\n)\n⁢\ng\n′\n⁢\n(\nx\n0\n)\n+\nf\n′\n⁢\n(\nx\n0\n)\n⁢\ng\n⁢\n(\nx\n0\n)\n.","source_id":"planetmath.productrule","source_sha256":"5b8bfe37199f5a43edaf78ab183f19bbacd2fe2980e3a7b501ea5edafcadb8b9","start":26}],"target_id":"theory.planetmath.productrule","target_kind":"node","target_sha256":"6778371046d7accc6f0f8f3c5acd072c8ef759b0356013c2c113dc23eec87bde"}],"theory.planetmath.quotientrule":[{"id":"assertion.theory.planetmath.quotientrule","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Quotient rule as stated in the captured PlanetMath entry quotientrule","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 26A06) states: The quotient rule says that the derivative of the quotient f / g of two differentiable functions f and g exists at all values of x as long as g ⁢ ( x ) ≠ 0 and is given by the formula d d ⁢ x ⁢ [ f ⁢ ( x ) g ⁢ ( x ) ] = g ⁢ ( x ) ⁢ f ′ ⁢ ( x ) - f ⁢ ( x ) ⁢ g ′ ⁢ ( x ) [ g ⁢ ( x ) ] 2 The Quotient Rule and the other differentiation formulas allow us to compute the derivative of any rational function .","support":[{"end":432,"quote":"The\nquotient rule\nsays that the\nderivative\nof the quotient\nf\n/\ng\nof two\ndifferentiable functions\nf\nand\ng\nexists at all values of\nx\nas long as\ng\n⁢\n(\nx\n)\n≠\n0\nand is given by the formula\nd\nd\n⁢\nx\n⁢\n[\nf\n⁢\n(\nx\n)\ng\n⁢\n(\nx\n)\n]\n=\ng\n⁢\n(\nx\n)\n⁢\nf\n′\n⁢\n(\nx\n)\n-\nf\n⁢\n(\nx\n)\n⁢\ng\n′\n⁢\n(\nx\n)\n[\ng\n⁢\n(\nx\n)\n]\n2\nThe Quotient Rule and the other\ndifferentiation\nformulas allow us to compute the derivative of any\nrational function\n.","source_id":"planetmath.quotientrule","source_sha256":"fa9a295826264a9a7d12c40027799717b157560c2cca6631849cf474c884b17c","start":28}],"target_id":"theory.planetmath.quotientrule","target_kind":"node","target_sha256":"6dd9cf997135e155cfaa97fad5b070c90f8574aff02a38fd954df0772c17566a"}],"theory.planetmath.ranknullitytheorem":[{"id":"assertion.theory.planetmath.ranknullitytheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Rank-nullity theorem as stated in the captured PlanetMath entry ranknullitytheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A03) states: Let V and W be vector spaces over the same field. If ϕ : V → W is a linear mapping , then dim ⁡ V = dim ⁡ ( ker ⁡ ϕ ) + dim ⁡ ( im ⁡ ϕ ) .","support":[{"end":180,"quote":"Let\nV\nand\nW\nbe\nvector spaces\nover the same field.\nIf\nϕ\n:\nV\n→\nW\nis a\nlinear mapping\n, then\ndim\n⁡\nV\n=\ndim\n⁡\n(\nker\n⁡\nϕ\n)\n+\ndim\n⁡\n(\nim\n⁡\nϕ\n)\n.","source_id":"planetmath.ranknullitytheorem","source_sha256":"bcc46ef0ebf6ebe5b79dfb08ada6ecfb380eff5a968b0c56a158b36cae50b2b1","start":42}],"target_id":"theory.planetmath.ranknullitytheorem","target_kind":"node","target_sha256":"3e405f7f1ab1c8593da38ecb3e3857db26499e0f21c56e89b296b9789753771e"}],"theory.planetmath.spectraltheorem":[{"id":"assertion.theory.planetmath.spectraltheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Spectral theorem as stated in the captured PlanetMath entry spectraltheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A23, 15A63, 15A18) states: Let U be a finite-dimensional , unitary space and let M : U → U be an endomorphism .","support":[{"end":118,"quote":"Let\nU\nbe a\nfinite-dimensional\n,\nunitary space\nand let\nM\n:\nU\n→\nU\nbe an\nendomorphism\n.","source_id":"planetmath.spectraltheorem","source_sha256":"d77fb9fa455ee2bac5c8ba67771e493adce1028262b14fed58369f7a68aab3bd","start":34}],"target_id":"theory.planetmath.spectraltheorem","target_kind":"node","target_sha256":"13924ea2c17a2677cf8ba5cf925ae65addbad75ecbf6135255906e2ce2eef888"}],"theory.planetmath.sylvesterslaw":[{"id":"assertion.theory.planetmath.sylvesterslaw","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Sylvester’s law as stated in the captured PlanetMath entry sylvesterslaw","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 15A03) states: Let V be an n -dimensional real vector space and let Q : V × V → ℝ be a symmetric quadratic form .","support":[{"end":130,"quote":"Let\nV\nbe an\nn\n-dimensional\nreal vector space\nand let\nQ\n:\nV\n×\nV\n→\nℝ\nbe a\nsymmetric quadratic form\n.","source_id":"planetmath.sylvesterslaw","source_sha256":"0b5cf0a2e8734db09dfd2bf9d31acd137276dd0d210c80195779d24dd5a002a5","start":32}],"target_id":"theory.planetmath.sylvesterslaw","target_kind":"node","target_sha256":"842196359235541a75c4d462bbe834e69a2768b51c15f23b8ceaa6c6b07ca653"}],"theory.planetmath.transfiniteinduction":[{"id":"assertion.theory.planetmath.transfiniteinduction","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transfinite induction as stated in the captured PlanetMath entry transfiniteinduction","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B10) states: Suppose Φ ⁢ ( α ) is a property defined for every ordinal α , the principle of transfinite induction states that in the case where for every α , if the fact that Φ ⁢ ( β ) is true for every β < α implies that Φ ⁢ ( α ) is true, then Φ ⁢ ( α ) is true for every ordinal α .","support":[{"end":316,"quote":"Suppose\nΦ\n⁢\n(\nα\n)\nis a\nproperty\ndefined for every\nordinal\nα\n, the principle of\ntransfinite induction\nstates that in the case where for every\nα\n, if the fact that\nΦ\n⁢\n(\nβ\n)\nis true for every\nβ\n<\nα\nimplies that\nΦ\n⁢\n(\nα\n)\nis true, then\nΦ\n⁢\n(\nα\n)\nis true for every ordinal\nα\n.","source_id":"planetmath.transfiniteinduction","source_sha256":"234c8f5ed4409a7e57a6aaee61d85a5d3b8f113c4b7e13ae0ea42394a98b7342","start":44}],"target_id":"theory.planetmath.transfiniteinduction","target_kind":"node","target_sha256":"6694b682e470842aac5d12fb02abab9dc8de6ec4ea247e6020fceab0ff2af977"}],"theory.planetmath.transfiniterecursion":[{"id":"assertion.theory.planetmath.transfiniterecursion","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Transfinite recursion as stated in the captured PlanetMath entry transfiniterecursion","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E45, 03E10) states: Transfinite recursion , roughly speaking, is a statement about the ability to define a function recursively using transfinite induction .","support":[{"end":181,"quote":"Transfinite recursion\n, roughly speaking, is a statement about the ability to define a\nfunction\nrecursively using\ntransfinite induction\n.","source_id":"planetmath.transfiniterecursion","source_sha256":"a116e6e7c56936ae937fc962b39bf0a243b359e7cd78cfb5edde049b32a8be25","start":44}],"target_id":"theory.planetmath.transfiniterecursion","target_kind":"node","target_sha256":"6fc464fa2b9c7b987c5437f929f0c9ae39f725b62d9d567dd4046449b86e8ac7"}],"theory.planetmath.uniquereadabilityofwellformedformulas":[{"id":"assertion.theory.planetmath.uniquereadabilityofwellformedformulas","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Unique readability of well-formed formulas as stated in the captured PlanetMath entry uniquereadabilityofwellformedformulas","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03B05) states: Suppose V is an alphabet . Two words w 1 and w 2 over V are the same if they have the same length and same symbol for every position of the word.","support":[{"end":231,"quote":"Suppose\nV\nis an\nalphabet\n. Two words\nw\n1\nand\nw\n2\nover\nV\nare the same if they have the same length and same symbol for every position of the word.","source_id":"planetmath.uniquereadabilityofwellformedformulas","source_sha256":"681d6ce75bd274024317a4fb84b49b6d262cb8674593f8d41488a91a3e9ef9d1","start":86}],"target_id":"theory.planetmath.uniquereadabilityofwellformedformulas","target_kind":"node","target_sha256":"2555600507355aa474a780e9238e5b77d526a832d33dfb0761fb9ea662b8ba6b"}],"theory.planetmath.zermeloswellorderingtheorem":[{"id":"assertion.theory.planetmath.zermeloswellorderingtheorem","scope":{"assumptions":"Attributed encyclopedia definition or statement; not an original research or historical-priority claim","population":"Zermelo’s well-ordering theorem as stated in the captured PlanetMath entry zermeloswellorderingtheorem","quantifiers":"Only what the captured text states","time":null,"uncertainty":"Source attribution only; no claim of consensus or frontier status","units":null},"statement":"PlanetMath (theorem entry, MSC 03E25) states: If X is any set whatsoever, then there exists a well-ordering of X .","support":[{"end":132,"quote":"If\nX\nis any set whatsoever, then there exists a\nwell-ordering\nof\nX\n.","source_id":"planetmath.zermeloswellorderingtheorem","source_sha256":"07803743058ab89fb5194e0e89f8f393457155e51d2e68534178d2d0c6e0820e","start":64}],"target_id":"theory.planetmath.zermeloswellorderingtheorem","target_kind":"node","target_sha256":"5d600aa0415e2270c8a94457410c36ef39c6aa89f00e1d732b4222eea6fdedf5"}],"theory.primordial-black-hole-dark-matter":[{"id":"assertion.complete.theory.primordial-black-hole-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited OGLE analysis treats primordial black holes as a possible fraction of Milky Way halo dark matter and conditionally constrains that fraction using microlensing events.","support":[{"end":2639,"quote":"We constrain the abundance of primordial black holes (PBH) using 2622 microlensing events obtained from 5-years observations of stars in the Galactic bulge by the Optical Gravitational Lensing Experiment (OGLE). The majority of microlensing events display a single or at least continuous population that has a peak around the light curve timescale $t_{\\rm E}\\simeq 20~{\\rm days}$ and a wide distribution over the range $t_{\\rm E}\\simeq [1, 300]~{\\rm days}$, while the data also indicates a second population of 6 ultrashort-timescale events in $t_{\\rm E}\\simeq [0.1,0.3]~{\\rm days}$, which are advocated to be due to free-floating planets. We confirm that the main population of OGLE events can be well modeled by microlensing due to brown dwarfs, main sequence stars and stellar remnants (white dwarfs and neutron stars) in the standard Galactic bulge and disk models for their spatial and velocity distributions. Using the dark matter (DM) model for the Milky Way (MW) halo relative to the Galactic bulge/disk models, we obtain the tightest upper bound on the PBH abundance in the mass range $M_{\\rm PBH}\\simeq[10^{-6},10^{-3}]M_\\odot$ (Earth-Jupiter mass range), if we employ null hypothesis that the OGLE data does not contain any PBH microlensing event. More interestingly, we also show that Earth-mass PBHs can well reproduce the 6 ultrashort-timescale events, without the need of free-floating planets, if the mass fraction of PBH to DM is at a per cent level, which is consistent with other constraints such as the microlensing search for Andromeda galaxy (M31) and the longer timescale OGLE events. Our result gives a hint of PBH existence, and can be confirmed or falsified by microlensing search for stars in M31, because M31 is towards the MW halo direction and should therefore contain a much less number of free-floating planets, even if exist, than the direction to the MW center.","source_id":"completion-source.a9095d65e7958cc4d9a4","source_sha256":"4c805dcdc536480875a1ef19e5f5fd2763f564151abc0cf6de509c22dc76e336","start":744}],"target_id":"theory.primordial-black-hole-dark-matter","target_kind":"node","target_sha256":"61f8fbdcfe15b74ebc3037152f89b3de28fd57a54a616c12a445a95e54fb63d3"}],"theory.self-interacting-dark-matter":[{"id":"assertion.complete.theory.self-interacting-dark-matter","scope":{"assumptions":"Retain all source assumptions; proposals and candidate-model predictions are not achieved detections","population":"Only the named record as scoped in the cited author analysis or explicitly identified review","quantifiers":"Only this named record and the stated experiment, construction, or model conditions","time":null,"uncertainty":"Source attribution only; scientific acceptance, chronology and latest frontier standing are unresolved","units":null},"statement":"Source-attributed description: The cited sources discuss a family of dark-matter models with interactions beyond gravity. Their predictions and astrophysical constraints depend on the interaction model; no single unified model is asserted here.","support":[{"end":2000,"quote":"Many models of dark matter include self-interactions beyond gravity. A variety of astrophysical observations have previously been used to place limits on the strength of such self-interactions. However, previous works have generally focused either on short-range interactions resulting in individual dark matter particles scattering from one another, or on effectively infinite-range interactions which sum over entire dark matter halos. In this work, we focus on the intermediate regime: forces with range much larger than dark matter particles' inter-particle spacing, but still shorter than the length scales of known halos. We show that gradients in the dark matter density of such halos would still lead to observable effects. We focus primarily on effects in the Bullet Cluster, where finite-range forces would lead either to a modification of the collision velocity of the cluster or to a separation of the dark matter and the galaxies of each cluster after the collision. We also consider constraints from the binding of ultrafaint dwarf galaxy halos, and from gravitational lensing of the Abell 370 cluster. Taken together, these observations allow us to set the strongest constraints on dark matter self-interactions over many orders of magnitude in range below $\\sim10$ kpc, surpassing existing limits by orders of magnitude throughout.","source_id":"completion-source.0ba85087913f9ed02a4e","source_sha256":"6d32a0682227b3b61ef755c23da63297d3570f43168985c97fd250b1cd82f369","start":653},{"end":2381,"quote":"We review theories of dark matter (DM) beyond the collisionless paradigm, known as self-interacting dark matter (SIDM), and their observable implications for astrophysical structure in the Universe. Self-interactions are motivated, in part, due to the potential to explain long-standing (and more recent) small scale structure observations that are in tension with collisionless cold DM (CDM) predictions. Simple particle physics models for SIDM can provide a universal explanation for these observations across a wide range of mass scales spanning dwarf galaxies, low and high surface brightness spiral galaxies, and clusters of galaxies. At the same time, SIDM leaves intact the success of $\\Lambda$CDM cosmology on large scales. This report covers the following topics: (1) small scale structure issues, including the core-cusp problem, the diversity problem for rotation curves, the missing satellites problem, and the too-big-to-fail problem, as well as recent progress in hydrodynamical simulations of galaxy formation; (2) N-body simulations for SIDM, including implications for density profiles, halo shapes, substructure, and the interplay between baryons and self-interactions; (3) semi-analytic Jeans-based methods that provide a complementary approach for connecting particle models with observations; (4) merging systems, such as cluster mergers (e.g., the Bullet Cluster) and minor infalls, along with recent simulation results for mergers; (5) particle physics models, including light mediator models and composite DM models; and (6) complementary probes for SIDM, including indirect and direct detection experiments, particle collider searches, and cosmological observations. We provide a summary and critical look for all current constraints on DM self-interactions and an outline for future directions.","source_id":"completion-source.495bd78c68aa1596d994","source_sha256":"7add5fe1b98d3f97f006857a5ad1a04b37c36be497e2f7eb35652b95a47ee519","start":561}],"target_id":"theory.self-interacting-dark-matter","target_kind":"node","target_sha256":"d7ebf527083c7e10099b063770cd71856c537f18c64192a9fd6a82c834e0618d"}],"theory.wikipedia.abel-s-binomial-theorem":[{"id":"assertion.theory.wikipedia.abel-s-binomial-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's binomial theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's binomial theorem\", CC BY-SA 4.0) states: Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","support":[{"end":234,"quote":"Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","source_id":"wikipedia.article.abel-s-binomial-theorem","source_sha256":"8131cae280a85f7a52ee9332e30df919a226e7467c577ad9c564385538522868","start":111}],"target_id":"theory.wikipedia.abel-s-binomial-theorem","target_kind":"node","target_sha256":"dc96c5007e437a6a710a273ba7c9c6b978600540cb019dc12e088e8ea0e69977"}],"theory.wikipedia.abel-s-irreducibility-theorem":[{"id":"assertion.theory.wikipedia.abel-s-irreducibility-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Abel's irreducibility theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Abel's irreducibility theorem\", CC BY-SA 4.0) states: In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is irreducible over F, then every root of g(x) is a root of f(x).","support":[{"end":391,"quote":"In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is  irreducible over F, then every root of g(x) is a root of f(x).","source_id":"wikipedia.article.abel-s-irreducibility-theorem","source_sha256":"eab8ee1a11ad08682515b925b1bb112f3bf2f8f006191d68d6d2a95b7cd5d11d","start":117}],"target_id":"theory.wikipedia.abel-s-irreducibility-theorem","target_kind":"node","target_sha256":"bba32856a8696747feb1a17bfd86636d1656c0f2d592e626fdd5098d9ec73c05"}],"theory.wikipedia.ahlfors-finiteness-theorem":[{"id":"assertion.theory.wikipedia.ahlfors-finiteness-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ahlfors finiteness theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ahlfors finiteness theorem\", CC BY-SA 4.0) states: In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","support":[{"end":285,"quote":"In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","source_id":"wikipedia.article.ahlfors-finiteness-theorem","source_sha256":"a933abdc806b4e87d8ce6c1e6952753206fcc15109b2bcdd0ac2a6c28c6b7a42","start":114}],"target_id":"theory.wikipedia.ahlfors-finiteness-theorem","target_kind":"node","target_sha256":"7b8fec6e13e0fb33d5b9d26db430413a55ee17788b6c1b5fe254dc9bf83fd205"}],"theory.wikipedia.alexander-s-subbase-lemma":[{"id":"assertion.theory.wikipedia.alexander-s-subbase-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Alexander's subbase lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Alexander's subbase lemma\", CC BY-SA 4.0) states: In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","support":[{"end":358,"quote":"In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","source_id":"wikipedia.article.alexander-s-subbase-lemma","source_sha256":"828df255ff870a9aba1213eb6beb203b6945c466ba783d8310ad47df14473261","start":113}],"target_id":"theory.wikipedia.alexander-s-subbase-lemma","target_kind":"node","target_sha256":"fc1561e580f52323779fabfdc5bb10daeb5e6134afcbfe1fc085b4ed86dea416"}],"theory.wikipedia.amitsur-levitzki-theorem":[{"id":"assertion.theory.wikipedia.amitsur-levitzki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Amitsur–Levitzki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Amitsur–Levitzki theorem\", CC BY-SA 4.0) states: In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","support":[{"end":261,"quote":"In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","source_id":"wikipedia.article.amitsur-levitzki-theorem","source_sha256":"8c68040bbd9a8004c55e3de421b1f2cd16145d757332b5337c2f9a64d8fa7d12","start":112}],"target_id":"theory.wikipedia.amitsur-levitzki-theorem","target_kind":"node","target_sha256":"2e123452fb889ec534f996f5a767d139f0ecc8f5e60493226ad21005599514d4"}],"theory.wikipedia.analytic-subgroup-theorem":[{"id":"assertion.theory.wikipedia.analytic-subgroup-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Analytic subgroup theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Analytic subgroup theorem\", CC BY-SA 4.0) states: In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","support":[{"end":222,"quote":"In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","source_id":"wikipedia.article.analytic-subgroup-theorem","source_sha256":"837091cdc7610b686f7bc923252a47899e6ce7064562ccb7545b7b5db7bfe1bd","start":113}],"target_id":"theory.wikipedia.analytic-subgroup-theorem","target_kind":"node","target_sha256":"97b3ede6c87c31f452f1a5a8f5e73287f6b372491f094726ccf2d2200ea1f829"}],"theory.wikipedia.anderson-kadec-theorem":[{"id":"assertion.theory.wikipedia.anderson-kadec-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Anderson–Kadec theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Anderson–Kadec theorem\", CC BY-SA 4.0) states: In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","support":[{"end":345,"quote":"In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","source_id":"wikipedia.article.anderson-kadec-theorem","source_sha256":"28f835dbe46ac5c90359c26c5d136ad2946e8276306b5216c643802b75a47fa5","start":110}],"target_id":"theory.wikipedia.anderson-kadec-theorem","target_kind":"node","target_sha256":"0889218d1dfc8e6149f4292802776fdbad2263e099fa1a39169a56d055bae286"}],"theory.wikipedia.andreotti-vesentini-theorem":[{"id":"assertion.theory.wikipedia.andreotti-vesentini-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Andreotti–Vesentini theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Andreotti–Vesentini theorem\", CC BY-SA 4.0) states: In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","support":[{"end":312,"quote":"In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","source_id":"wikipedia.article.andreotti-vesentini-theorem","source_sha256":"4189425b9e60acad405391a3b13a514678e60f95921c72731b8fbc76085b4517","start":115}],"target_id":"theory.wikipedia.andreotti-vesentini-theorem","target_kind":"node","target_sha256":"1881072d2dcc7664eb9713884346d680a2a32eea56668a2af72f20aa7aeead2b"}],"theory.wikipedia.annulus-theorem":[{"id":"assertion.theory.wikipedia.annulus-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Annulus theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Annulus theorem\", CC BY-SA 4.0) states: In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","support":[{"end":258,"quote":"In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","source_id":"wikipedia.article.annulus-theorem","source_sha256":"f087f2e9902a75ac94774b14044492d33e4a93434a0efc472d66b803ed956a15","start":103}],"target_id":"theory.wikipedia.annulus-theorem","target_kind":"node","target_sha256":"2c2f4c5b616b1da89ed298878ecbd615e325fcda19ea55ac4225eb9d26ae58a6"}],"theory.wikipedia.ap-ry-s-theorem":[{"id":"assertion.theory.wikipedia.ap-ry-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apéry's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apéry's theorem\", CC BY-SA 4.0) states: In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","support":[{"end":217,"quote":"In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","source_id":"wikipedia.article.ap-ry-s-theorem","source_sha256":"5ec5b5c51f6ca84152cb0044d7649109ebc42fdbdb53166a87f2b762e6d15689","start":102}],"target_id":"theory.wikipedia.ap-ry-s-theorem","target_kind":"node","target_sha256":"07f63956f70c6555a17abaa9adc3b6c18433a616094f361e6e33bd4876acbcef"}],"theory.wikipedia.apollonius-s-theorem":[{"id":"assertion.theory.wikipedia.apollonius-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Apollonius's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Apollonius's theorem\", CC BY-SA 4.0) states: In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","support":[{"end":228,"quote":"In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","source_id":"wikipedia.article.apollonius-s-theorem","source_sha256":"746c640c78b6c81629d108b1d6fe6306b52dd2d2025240c0aff9c1f47d605610","start":107}],"target_id":"theory.wikipedia.apollonius-s-theorem","target_kind":"node","target_sha256":"beb21356e176ecb455310028e3d681019e427cb139f84d4ed6ec139e02a67ec4"}],"theory.wikipedia.atiyah-segal-completion-theorem":[{"id":"assertion.theory.wikipedia.atiyah-segal-completion-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Atiyah–Segal completion theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Atiyah–Segal completion theorem\", CC BY-SA 4.0) states: The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","support":[{"end":229,"quote":"The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","source_id":"wikipedia.article.atiyah-segal-completion-theorem","source_sha256":"e733c0b97604d4730010027a8df2f2d83409ad6b76735ea0149701a93c8c8cf6","start":119}],"target_id":"theory.wikipedia.atiyah-segal-completion-theorem","target_kind":"node","target_sha256":"a8a72b3d61683b4909baea301afd81988b120aa23ef60c1a7a4ed414457033f2"}],"theory.wikipedia.aubin-lions-lemma":[{"id":"assertion.theory.wikipedia.aubin-lions-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Aubin–Lions lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Aubin–Lions lemma\", CC BY-SA 4.0) states: In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","support":[{"end":360,"quote":"In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","source_id":"wikipedia.article.aubin-lions-lemma","source_sha256":"5da722e9e82729fa498c54aaa8ab7d8a14d4e5d3b90c89c7460769dcd5fdb191","start":105}],"target_id":"theory.wikipedia.aubin-lions-lemma","target_kind":"node","target_sha256":"8e1b2bf131191e049eba5624bfd7183b0e3d17ff19570fe1f3710102a86bd3b7"}],"theory.wikipedia.auslander-buchsbaum-theorem":[{"id":"assertion.theory.wikipedia.auslander-buchsbaum-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Auslander–Buchsbaum theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Auslander–Buchsbaum theorem\", CC BY-SA 4.0) states: In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","support":[{"end":236,"quote":"In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","source_id":"wikipedia.article.auslander-buchsbaum-theorem","source_sha256":"bbce3f839ee284ef5343038134c6f1d85c6c4a2300c459dedcaf955f570d83c3","start":115}],"target_id":"theory.wikipedia.auslander-buchsbaum-theorem","target_kind":"node","target_sha256":"eecd923092f41ce0969964d156b80d4c152a10d9b65cb55525cb2def420f3f9f"}],"theory.wikipedia.ax-grothendieck-theorem":[{"id":"assertion.theory.wikipedia.ax-grothendieck-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ax–Grothendieck theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ax–Grothendieck theorem\", CC BY-SA 4.0) states: In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","support":[{"end":286,"quote":"In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","source_id":"wikipedia.article.ax-grothendieck-theorem","source_sha256":"f24fa25864074375da7f81a9399a9be39dfe7fda60d52997946f335a446f5159","start":111}],"target_id":"theory.wikipedia.ax-grothendieck-theorem","target_kind":"node","target_sha256":"2fb6e3e89120c4ea5b0dfec862a64489b87529d8ad5df196512cb8eb9e514419"}],"theory.wikipedia.ax-kochen-theorem":[{"id":"assertion.theory.wikipedia.ax-kochen-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Ax–Kochen theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Ax–Kochen theorem\", CC BY-SA 4.0) states: The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","support":[{"end":409,"quote":"The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","source_id":"wikipedia.article.ax-kochen-theorem","source_sha256":"885f960e774d0bb75670fbbb52406a4ce68e636a66be7cc05f9059fed981d5d5","start":104}],"target_id":"theory.wikipedia.ax-kochen-theorem","target_kind":"node","target_sha256":"e72cfea9eb60da17bdb94f270b9b4c1cab2260ad9c26694b621607c3ae59a717"}],"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem":[{"id":"assertion.theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Büchi–Elgot–Trakhtenbrot theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Büchi–Elgot–Trakhtenbrot theorem\", CC BY-SA 4.0) states: In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","support":[{"end":300,"quote":"In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","source_id":"wikipedia.article.b-chi-elgot-trakhtenbrot-theorem","source_sha256":"49245034f54508476f113b29772471b23524e4b65b2a34a7bed965abb9f55658","start":120}],"target_id":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","target_kind":"node","target_sha256":"58bb7405834fed54ab7a545aaefb121ccdbcce4f9e9ebd429b55a9f5ba4fad35"}],"theory.wikipedia.bagpipe-theorem":[{"id":"assertion.theory.wikipedia.bagpipe-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bagpipe theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bagpipe theorem\", CC BY-SA 4.0) states: In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \"bagpipes\": the connected sum of a compact \"bag\" with several \"long pipes\".","support":[{"end":352,"quote":"In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \\\"bagpipes\\\": the connected sum of a compact \\\"bag\\\" with several \\\"long pipes\\\".","source_id":"wikipedia.article.bagpipe-theorem","source_sha256":"e51c96ea32742cb48ea2ed046626efb77b4e1119bb60dc1290a8e7085d6ba61a","start":103}],"target_id":"theory.wikipedia.bagpipe-theorem","target_kind":"node","target_sha256":"db98b87e571992744b7e1f9ec2ec634a90a171984c538a91a6e4869f63e0666a"}],"theory.wikipedia.baire-category-theorem":[{"id":"assertion.theory.wikipedia.baire-category-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Baire category theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Baire category theorem\", CC BY-SA 4.0) states: The Baire category theorem (BCT) is an important result in general topology and functional analysis.","support":[{"end":207,"quote":"The Baire category theorem (BCT) is an important result in general topology and functional analysis.","source_id":"wikipedia.article.baire-category-theorem","source_sha256":"15e70706d0d197cbf35afd147379e09d29560d0e07772fcbbb92266388e21b9d","start":107}],"target_id":"theory.wikipedia.baire-category-theorem","target_kind":"node","target_sha256":"0269b3074780a633f58d89e72e7bfa44663b9548f4a93d43211830ebccaf3424"}],"theory.wikipedia.banach-fixed-point-theorem":[{"id":"assertion.theory.wikipedia.banach-fixed-point-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Banach fixed-point theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Banach fixed-point theorem\", CC BY-SA 4.0) states: In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","support":[{"end":479,"quote":"In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","source_id":"wikipedia.article.banach-fixed-point-theorem","source_sha256":"364c90730bf06b13601d5cd04d9f192021bb43e04d4e300ac79b02dc27e77664","start":111}],"target_id":"theory.wikipedia.banach-fixed-point-theorem","target_kind":"node","target_sha256":"82a73f5d1251749dec551f8ab3df2c32855ca866d253a9390136fc43e2bd6175"}],"theory.wikipedia.beauville-laszlo-theorem":[{"id":"assertion.theory.wikipedia.beauville-laszlo-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beauville–Laszlo theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beauville–Laszlo theorem\", CC BY-SA 4.0) states: In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \"glue\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","support":[{"end":323,"quote":"In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \\\"glue\\\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","source_id":"wikipedia.article.beauville-laszlo-theorem","source_sha256":"56aa832c1ea1d8c25e010302024070c9ea5c10c32ef5b183aa4ff8c1cbfa9d97","start":112}],"target_id":"theory.wikipedia.beauville-laszlo-theorem","target_kind":"node","target_sha256":"fb7ee5f9a343b3c3dd1a93676df4850560fe4224e18f958e057f02a87ec3d531"}],"theory.wikipedia.beckman-quarles-theorem":[{"id":"assertion.theory.wikipedia.beckman-quarles-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Beckman–Quarles theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Beckman–Quarles theorem\", CC BY-SA 4.0) states: In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","support":[{"end":314,"quote":"In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","source_id":"wikipedia.article.beckman-quarles-theorem","source_sha256":"5af7af512b22ede6038ba8b52875b2c3202349584f4b5a7014a918d47d1d8a36","start":110}],"target_id":"theory.wikipedia.beckman-quarles-theorem","target_kind":"node","target_sha256":"5facb33c6a1c0cc8c02b57ed9f54d3f63fd2ca1608c09de1a327b2f392cd31cf"}],"theory.wikipedia.beki-s-theorem":[{"id":"assertion.theory.wikipedia.beki-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bekić's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bekić's theorem\", CC BY-SA 4.0) states: In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","support":[{"end":277,"quote":"In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","source_id":"wikipedia.article.beki-s-theorem","source_sha256":"a260bf476598bceb093f8bbfb93517c82eca3d2d8a2b3a10b0100d5230c0416f","start":103}],"target_id":"theory.wikipedia.beki-s-theorem","target_kind":"node","target_sha256":"40e65ed3079d590d7d594ab814bded766882eebd3b6cbfd35a6127633df265eb"}],"theory.wikipedia.bendixson-dulac-theorem":[{"id":"assertion.theory.wikipedia.bendixson-dulac-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bendixson–Dulac theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bendixson–Dulac theorem\", CC BY-SA 4.0) states: In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","support":[{"end":258,"quote":"In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","source_id":"wikipedia.article.bendixson-dulac-theorem","source_sha256":"2c60dcad659e4d59ede145f4c6ad533434965e80cfed04eeea1c879bf195b41f","start":109}],"target_id":"theory.wikipedia.bendixson-dulac-theorem","target_kind":"node","target_sha256":"278561b1216e267a4e0c4c92fe6a67ed1a1abba5f93851ae937b931a3d9ad67b"}],"theory.wikipedia.big-little-big-lemma":[{"id":"assertion.theory.wikipedia.big-little-big-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Big-little-big lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Big-little-big lemma\", CC BY-SA 4.0) states: In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","support":[{"end":292,"quote":"In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","source_id":"wikipedia.article.big-little-big-lemma","source_sha256":"7049fff00e2ce1d12918c260ed87350afb66119c29691700b405c70516e4e851","start":108}],"target_id":"theory.wikipedia.big-little-big-lemma","target_kind":"node","target_sha256":"7f103b5fd2ee1f559a5b6513224541782d4559c253631774e1cc46e378805298"}],"theory.wikipedia.bing-metrization-theorem":[{"id":"assertion.theory.wikipedia.bing-metrization-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bing metrization theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bing metrization theorem\", CC BY-SA 4.0) states: In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","support":[{"end":231,"quote":"In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","source_id":"wikipedia.article.bing-metrization-theorem","source_sha256":"2bbdbf87b0bb4ae1bca1ff27e8afd4e3118442bdf1b1027123573dd0fa559b58","start":111}],"target_id":"theory.wikipedia.bing-metrization-theorem","target_kind":"node","target_sha256":"e76f4e4b4e9b06e5d57914494f55c56ccf906a90c59d87cbde143230d5442f97"}],"theory.wikipedia.bing-s-recognition-theorem":[{"id":"assertion.theory.wikipedia.bing-s-recognition-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bing's recognition theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bing's recognition theorem\", CC BY-SA 4.0) states: In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","support":[{"end":377,"quote":"In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","source_id":"wikipedia.article.bing-s-recognition-theorem","source_sha256":"0904184c1690100181672a88d10e7070e2844593b0f656f868a4240b8ca43115","start":114}],"target_id":"theory.wikipedia.bing-s-recognition-theorem","target_kind":"node","target_sha256":"efa4b2b103105e3010b097eb57b4be2a8e92fee0189e4cf96db73bf10ed0d766"}],"theory.wikipedia.birch-s-theorem":[{"id":"assertion.theory.wikipedia.birch-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Birch's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Birch's theorem\", CC BY-SA 4.0) states: In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","support":[{"end":233,"quote":"In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","source_id":"wikipedia.article.birch-s-theorem","source_sha256":"d4de202fe8111165679c767fedabe20241964682b7141304236b12d07abe3faa","start":102}],"target_id":"theory.wikipedia.birch-s-theorem","target_kind":"node","target_sha256":"b035ff3b30200b9a3fc225f0afcc95e2e62ba1d6ceb5b3ca40f233e1e172e9ea"}],"theory.wikipedia.boolean-prime-ideal-theorem":[{"id":"assertion.theory.wikipedia.boolean-prime-ideal-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Boolean prime ideal theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Boolean prime ideal theorem\", CC BY-SA 4.0) states: In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals.","support":[{"end":234,"quote":"In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to  prime ideals.","source_id":"wikipedia.article.boolean-prime-ideal-theorem","source_sha256":"87a407e4956e3a17933b0ada94b6022baf812e8aa1a89b661e40063fa3270976","start":113}],"target_id":"theory.wikipedia.boolean-prime-ideal-theorem","target_kind":"node","target_sha256":"ef25892b6b503b4987522d5a8deaa2937d985471c615c4d2fdad1ba62c094905"}],"theory.wikipedia.borel-cantelli-lemma":[{"id":"assertion.theory.wikipedia.borel-cantelli-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Borel–Cantelli lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Borel–Cantelli lemma\", CC BY-SA 4.0) states: The Borel–Cantelli lemma is a result in measure theory.","support":[{"end":160,"quote":"The Borel–Cantelli lemma is a result in measure theory.","source_id":"wikipedia.article.borel-cantelli-lemma","source_sha256":"d0bc64d3b1fed4198289c14c93f99b1d56c899166f995e4b1ba07de63348b961","start":105}],"target_id":"theory.wikipedia.borel-cantelli-lemma","target_kind":"node","target_sha256":"89517aa2a9709aa93e893ba668169821a657355874a8e0646d84cc93b8353be8"}],"theory.wikipedia.bourbaki-witt-theorem":[{"id":"assertion.theory.wikipedia.bourbaki-witt-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Bourbaki–Witt theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Bourbaki–Witt theorem\", CC BY-SA 4.0) states: In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","support":[{"end":270,"quote":"In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","source_id":"wikipedia.article.bourbaki-witt-theorem","source_sha256":"7bbd66ab4ce1bbee66ed95fd9ab0c4ded76fbc786ccee7e9ff26460c75bc96f8","start":108}],"target_id":"theory.wikipedia.bourbaki-witt-theorem","target_kind":"node","target_sha256":"4790ce13bfcb0fb4e6cb9ee9780d5d5aa37119ce4e611c6adc3947877ac6b2a0"}],"theory.wikipedia.brauer-s-theorem-on-forms":[{"id":"assertion.theory.wikipedia.brauer-s-theorem-on-forms","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brauer's theorem on forms as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brauer's theorem on forms\", CC BY-SA 4.0) states: There also is Brauer's theorem on induced characters.","support":[{"end":165,"quote":"There also is Brauer's theorem on induced characters.","source_id":"wikipedia.article.brauer-s-theorem-on-forms","source_sha256":"2555710d33ed70a91b7ccecf706c7ba2489ce9b8036a5b69bbed9f75ad587178","start":112}],"target_id":"theory.wikipedia.brauer-s-theorem-on-forms","target_kind":"node","target_sha256":"273f5ed6818646ea6fab96bb10a3cd4eb13fa0eaf1547fa254f9f33adef33797"}],"theory.wikipedia.british-flag-theorem":[{"id":"assertion.theory.wikipedia.british-flag-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"British flag theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"British flag theorem\", CC BY-SA 4.0) states: In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","support":[{"end":364,"quote":"In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","source_id":"wikipedia.article.british-flag-theorem","source_sha256":"48caf2b04437fca60251917f6d327a27fb42967a4673691bbefae888da98b0a4","start":107}],"target_id":"theory.wikipedia.british-flag-theorem","target_kind":"node","target_sha256":"8df5fca9e218a003eedcaa3cbb45720a750ef93ed11d5beec20f5069e6d714ab"}],"theory.wikipedia.brouwer-fixed-point-theorem":[{"id":"assertion.theory.wikipedia.brouwer-fixed-point-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Brouwer fixed-point theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Brouwer fixed-point theorem\", CC BY-SA 4.0) states: Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","support":[{"end":208,"quote":"Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","source_id":"wikipedia.article.brouwer-fixed-point-theorem","source_sha256":"3e7e9541653bf603b6a60a5b4cb68e0493a5d573aaf7c2c3bf9aae162a6953e6","start":111}],"target_id":"theory.wikipedia.brouwer-fixed-point-theorem","target_kind":"node","target_sha256":"a1fdfe32dd06ecb4f42c714917a3815b3b9cfa69d66075b1fdc2335455c0bb76"}],"theory.wikipedia.cantor-bernstein-theorem":[{"id":"assertion.theory.wikipedia.cantor-bernstein-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor–Bernstein theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor–Bernstein theorem\", CC BY-SA 4.0) states: In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","support":[{"end":301,"quote":"In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","source_id":"wikipedia.article.cantor-bernstein-theorem","source_sha256":"fcc582f76f3f30b420c140eae7f679eb2e3906a4755d1bf1998be4d75a5d7dc2","start":110}],"target_id":"theory.wikipedia.cantor-bernstein-theorem","target_kind":"node","target_sha256":"12481ba861cca6cd7c69e628943553bbb1dd5b47fa74af9ad0f45a2dab378088"}],"theory.wikipedia.cantor-s-intersection-theorem":[{"id":"assertion.theory.wikipedia.cantor-s-intersection-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cantor's intersection theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cantor's intersection theorem\", CC BY-SA 4.0) states: Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","support":[{"end":376,"quote":"Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","source_id":"wikipedia.article.cantor-s-intersection-theorem","source_sha256":"07d2c3ba30d82b176c8ffd1093abfc6dd68832d948609d5d11379dd14d3e7ab6","start":117}],"target_id":"theory.wikipedia.cantor-s-intersection-theorem","target_kind":"node","target_sha256":"830742911805d23cbc3a8c6e138501b317a4e4960086a98ebe3bc16469ea9b95"}],"theory.wikipedia.casey-s-theorem":[{"id":"assertion.theory.wikipedia.casey-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Casey's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Casey's theorem\", CC BY-SA 4.0) states: In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","support":[{"end":267,"quote":"In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","source_id":"wikipedia.article.casey-s-theorem","source_sha256":"2c09d5bfd02f052555288684934c532f32afe85c4a7336e473287e270a02eb5f","start":103}],"target_id":"theory.wikipedia.casey-s-theorem","target_kind":"node","target_sha256":"db3059daf569e6d5f71c97c059d83805135a70c6d74a882946dedf657e277fa7"}],"theory.wikipedia.cauchy-s-theorem-geometry":[{"id":"assertion.theory.wikipedia.cauchy-s-theorem-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cauchy's theorem (geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cauchy's theorem (geometry)\", CC BY-SA 4.0) states: Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","support":[{"end":185,"quote":"Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","source_id":"wikipedia.article.cauchy-s-theorem-geometry","source_sha256":"26be3a6f558cc9e793b022567f632e0d7d38456920ffa71cb78947b7ad6b8177","start":114}],"target_id":"theory.wikipedia.cauchy-s-theorem-geometry","target_kind":"node","target_sha256":"92f0a8ac42f16c17f08b04f474736247e768e98813c76510091233e2b48ca7c3"}],"theory.wikipedia.cayley-hamilton-theorem":[{"id":"assertion.theory.wikipedia.cayley-hamilton-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cayley–Hamilton theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cayley–Hamilton theorem\", CC BY-SA 4.0) states: In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","support":[{"end":382,"quote":"In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","source_id":"wikipedia.article.cayley-hamilton-theorem","source_sha256":"e3b521bccfdc018c4a162d8ffb20f7f9b100b22fb2f0a1282a65590a992882d9","start":109}],"target_id":"theory.wikipedia.cayley-hamilton-theorem","target_kind":"node","target_sha256":"9a06916445bb180ef71ab0194aa03c4ce83355a234ac3f4429ac0dfd4fae225e"}],"theory.wikipedia.centered-polygonal-number-theorem":[{"id":"assertion.theory.wikipedia.centered-polygonal-number-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Centered polygonal number theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Centered polygonal number theorem\", CC BY-SA 4.0) states: In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","support":[{"end":270,"quote":"In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","source_id":"wikipedia.article.centered-polygonal-number-theorem","source_sha256":"1f5e3fba736d2a36e9dc61368e685d7847c36c3a1e92f12fe3f45dbb6863c867","start":121}],"target_id":"theory.wikipedia.centered-polygonal-number-theorem","target_kind":"node","target_sha256":"a79ac7b3a61321938acb8fe59ec99960fb20ed140ae4806c7e8cab7dbaab98d2"}],"theory.wikipedia.chowla-mordell-theorem":[{"id":"assertion.theory.wikipedia.chowla-mordell-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Chowla–Mordell theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Chowla–Mordell theorem\", CC BY-SA 4.0) states: In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","support":[{"end":301,"quote":"In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","source_id":"wikipedia.article.chowla-mordell-theorem","source_sha256":"185044517018347d77e5b0b783bf8adc459d4119227da61e684a3603c08d5ef1","start":108}],"target_id":"theory.wikipedia.chowla-mordell-theorem","target_kind":"node","target_sha256":"37f9774fc252aa47f5d507f58e3f66944bae82613b685e4d112693b6dbb71197"}],"theory.wikipedia.commandino-s-theorem":[{"id":"assertion.theory.wikipedia.commandino-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Commandino's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Commandino's theorem\", CC BY-SA 4.0) states: Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","support":[{"end":284,"quote":"Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","source_id":"wikipedia.article.commandino-s-theorem","source_sha256":"b053c145ebe85cf21c5a95b1eeca54376f80e9de58ee9f2316f58ffa46671c82","start":108}],"target_id":"theory.wikipedia.commandino-s-theorem","target_kind":"node","target_sha256":"2e13c89103b929e6d8270ab9e90ac8e5784ad16b2daa8fd848b7a9b22dc4dd77"}],"theory.wikipedia.constant-chord-theorem":[{"id":"assertion.theory.wikipedia.constant-chord-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Constant chord theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Constant chord theorem\", CC BY-SA 4.0) states: The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","support":[{"end":238,"quote":"The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","source_id":"wikipedia.article.constant-chord-theorem","source_sha256":"a948fe1de0278a7ca4954df662aa166daa7725c797aece847bbda139feba971c","start":110}],"target_id":"theory.wikipedia.constant-chord-theorem","target_kind":"node","target_sha256":"34461700b3f38c7b9701f748a81078bd4fdd825ae987989c42c6340ae1f083f5"}],"theory.wikipedia.cut-elimination-theorem":[{"id":"assertion.theory.wikipedia.cut-elimination-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cut-elimination theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cut-elimination theorem\", CC BY-SA 4.0) states: The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","support":[{"end":238,"quote":"The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","source_id":"wikipedia.article.cut-elimination-theorem","source_sha256":"3ff287001439f6e7925b94bc3b6936a67cc52c8b67274e80009733deccaa7e55","start":109}],"target_id":"theory.wikipedia.cut-elimination-theorem","target_kind":"node","target_sha256":"21e11af8c23610471e860e9920b32e620acf8f3dcf6ebf19b2190a7e6dc7e1e2"}],"theory.wikipedia.cyclic-surgery-theorem":[{"id":"assertion.theory.wikipedia.cyclic-surgery-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Cyclic surgery theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Cyclic surgery theorem\", CC BY-SA 4.0) states: In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","support":[{"end":571,"quote":"In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","source_id":"wikipedia.article.cyclic-surgery-theorem","source_sha256":"5db5ecac042fb3c6c0f23b6ce67416b9ca6bea07223c5a83f5ba2a63a9f7e3d5","start":110}],"target_id":"theory.wikipedia.cyclic-surgery-theorem","target_kind":"node","target_sha256":"dd4dfea783c55f2a7ae17a2496f185c494e88ee601a6683be159228cfc3c79d9"}],"theory.wikipedia.dehn-s-lemma":[{"id":"assertion.theory.wikipedia.dehn-s-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Dehn's lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Dehn's lemma\", CC BY-SA 4.0) states: In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","support":[{"end":397,"quote":"In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","source_id":"wikipedia.article.dehn-s-lemma","source_sha256":"402cfd4728cc8e0ad419f656d394356a89c804269ac7655ecb9076aad918b9b5","start":99}],"target_id":"theory.wikipedia.dehn-s-lemma","target_kind":"node","target_sha256":"869b2797d3682fe0f4d392f864d5b73cec1ffd838e4e2dd75ccf1ea7aa08cfda"}],"theory.wikipedia.donaldson-s-theorem":[{"id":"assertion.theory.wikipedia.donaldson-s-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Donaldson's theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Donaldson's theorem\", CC BY-SA 4.0) states: In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","support":[{"end":310,"quote":"In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","source_id":"wikipedia.article.donaldson-s-theorem","source_sha256":"9e939377f7de6c5a3709fc2c03e1589e8f7bdd298281595401e4487f71606935","start":106}],"target_id":"theory.wikipedia.donaldson-s-theorem","target_kind":"node","target_sha256":"4338050bb88dc76bad72d21b435fc1acac46a46ee25c4eb5acaed8411b04e397"}],"theory.wikipedia.double-suspension-theorem":[{"id":"assertion.theory.wikipedia.double-suspension-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Double suspension theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Double suspension theorem\", CC BY-SA 4.0) states: In geometric topology, the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","support":[{"end":309,"quote":"In geometric topology,  the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","source_id":"wikipedia.article.double-suspension-theorem","source_sha256":"b1021be9eeff37d32d54410c1415eda62659c5a5cf7df5927b7cdfac7a63f492","start":113}],"target_id":"theory.wikipedia.double-suspension-theorem","target_kind":"node","target_sha256":"87d23ed8c868d367edcc751335ae3b342209368b04dddf87b93d465d55dbaa12"}],"theory.wikipedia.eilenberg-watts-theorem":[{"id":"assertion.theory.wikipedia.eilenberg-watts-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Eilenberg–Watts theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Eilenberg–Watts theorem\", CC BY-SA 4.0) states: In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","support":[{"end":291,"quote":"In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","source_id":"wikipedia.article.eilenberg-watts-theorem","source_sha256":"5fddc0547dae5ccf0e90489d017f6651d8fa9b8425ddcfc050082e35c5bef9a7","start":111}],"target_id":"theory.wikipedia.eilenberg-watts-theorem","target_kind":"node","target_sha256":"2c6697dca9a46c8db962508dc432b5d50959cc37c381d3b69e58b3c7c7b0e3d7"}],"theory.wikipedia.excision-theorem":[{"id":"assertion.theory.wikipedia.excision-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Excision theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Excision theorem\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","support":[{"end":250,"quote":"In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","source_id":"wikipedia.article.excision-theorem","source_sha256":"6b7107d69372f8c7187a9a57726af898a1005cd1bdd7772b71868a96e89fe5fd","start":103}],"target_id":"theory.wikipedia.excision-theorem","target_kind":"node","target_sha256":"d01b5bdbdec82a5f89344ecb1725aa4ff82a4e7b71c3f95b767d7b77a7d2abc4"}],"theory.wikipedia.f-ry-milnor-theorem":[{"id":"assertion.theory.wikipedia.f-ry-milnor-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Fáry–Milnor theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Fáry–Milnor theorem\", CC BY-SA 4.0) states: In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","support":[{"end":298,"quote":"In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","source_id":"wikipedia.article.f-ry-milnor-theorem","source_sha256":"b633851b807101bcaf95f4cdddbf1d07ccddcc1e98916169d8fafcf0469cf48f","start":106}],"target_id":"theory.wikipedia.f-ry-milnor-theorem","target_kind":"node","target_sha256":"83b4ab930d7adba0d8a03e12cd41db431d987d8af763ac7d838f0dfdb207784a"}],"theory.wikipedia.gauss-s-lemma-riemannian-geometry":[{"id":"assertion.theory.wikipedia.gauss-s-lemma-riemannian-geometry","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Gauss's lemma (Riemannian geometry) as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Gauss's lemma (Riemannian geometry)\", CC BY-SA 4.0) states: In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","support":[{"end":302,"quote":"In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","source_id":"wikipedia.article.gauss-s-lemma-riemannian-geometry","source_sha256":"6bbc10bc090c6e6d7c6a17829cb33a3185187138fce6e8cb9c8b6b99815b8b9b","start":123}],"target_id":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","target_kind":"node","target_sha256":"484eeaaacdd878fbd989e7b54e5a7865afbe7d604f6297fb72f6910855a95a00"}],"theory.wikipedia.hilbert-burch-theorem":[{"id":"assertion.theory.wikipedia.hilbert-burch-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hilbert–Burch theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hilbert–Burch theorem\", CC BY-SA 4.0) states: In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","support":[{"end":297,"quote":"In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","source_id":"wikipedia.article.hilbert-burch-theorem","source_sha256":"542ce60770b26f8d0e01add5104bdc2a394bc1490b7b20010a537cc2ccd67604","start":109}],"target_id":"theory.wikipedia.hilbert-burch-theorem","target_kind":"node","target_sha256":"85e01b8b8bf5eeb2b0b5d58906507ed9884cbaf351dd66449dc763faf32084fc"}],"theory.wikipedia.hochster-roberts-theorem":[{"id":"assertion.theory.wikipedia.hochster-roberts-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hochster–Roberts theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hochster–Roberts theorem\", CC BY-SA 4.0) states: In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","support":[{"end":317,"quote":"In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","source_id":"wikipedia.article.hochster-roberts-theorem","source_sha256":"1b8246e2e1a094b66238f1c975c2ca6c67df4a279e3efc99d0b198e2a05a2828","start":112}],"target_id":"theory.wikipedia.hochster-roberts-theorem","target_kind":"node","target_sha256":"e9a19d859d1e4d08a6c9123e1dc8d43d0fecaffac8b5bdb14afd7b8a5b2cf3cd"}],"theory.wikipedia.hua-s-lemma":[{"id":"assertion.theory.wikipedia.hua-s-lemma","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Hua's lemma as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Hua's lemma\", CC BY-SA 4.0) states: In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","support":[{"end":187,"quote":"In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","source_id":"wikipedia.article.hua-s-lemma","source_sha256":"8f4164687ed28ec6f66443b07f566b5ea4f679d86258ad3d65256ceacc1ff964","start":98}],"target_id":"theory.wikipedia.hua-s-lemma","target_kind":"node","target_sha256":"f85dc98cf97a9837e97020db9751baa17a98ce9a13d895ebeab3e70c90ff3f4a"}],"theory.wikipedia.jacobson-bourbaki-theorem":[{"id":"assertion.theory.wikipedia.jacobson-bourbaki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Jacobson–Bourbaki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Jacobson–Bourbaki theorem\", CC BY-SA 4.0) states: In algebra, the Jacobson–Bourbaki theorem is a theorem used to extend Galois theory to field extensions that need not be separable.","support":[{"end":245,"quote":"In algebra, the Jacobson–Bourbaki theorem is a theorem used to  extend Galois theory to field extensions that need not be separable.","source_id":"wikipedia.article.jacobson-bourbaki-theorem","source_sha256":"c00f2745ddbda3c76e50fcd12b799f3b0aab0d8aa698228ee02d955f7a152e43","start":113}],"target_id":"theory.wikipedia.jacobson-bourbaki-theorem","target_kind":"node","target_sha256":"c3638184b25659056a7cb3003c33fa8687e9cc5f6fa4c06f9909ef725e054d23"}],"theory.wikipedia.koecher-vinberg-theorem":[{"id":"assertion.theory.wikipedia.koecher-vinberg-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Koecher–Vinberg theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Koecher–Vinberg theorem\", CC BY-SA 4.0) states: In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","support":[{"end":213,"quote":"In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","source_id":"wikipedia.article.koecher-vinberg-theorem","source_sha256":"2a0a0e4e180e50d8d3673ae9f9101a94ca6ebfb7ae4e6efa03f9f874f941098a","start":111}],"target_id":"theory.wikipedia.koecher-vinberg-theorem","target_kind":"node","target_sha256":"24105043f4e4ee1b7078e6f2c5045a96f3296b9d8cd41c90746bb5309c797549"}],"theory.wikipedia.krull-akizuki-theorem":[{"id":"assertion.theory.wikipedia.krull-akizuki-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Krull–Akizuki theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Krull–Akizuki theorem\", CC BY-SA 4.0) states: In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","support":[{"end":263,"quote":"In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","source_id":"wikipedia.article.krull-akizuki-theorem","source_sha256":"08b6eccc32754b34c16a0fff80f2686d890dd9bb3eee57efba6f676b23fbc5e5","start":109}],"target_id":"theory.wikipedia.krull-akizuki-theorem","target_kind":"node","target_sha256":"c546bd3e1eeab6c7c0ea1c1f3fdc0d0e31ae5c1bf113a05a918c88ed2af502f5"}],"theory.wikipedia.monotone-convergence-theorem":[{"id":"assertion.theory.wikipedia.monotone-convergence-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Monotone convergence theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Monotone convergence theorem\", CC BY-SA 4.0) states: In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","support":[{"end":337,"quote":"In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","source_id":"wikipedia.article.monotone-convergence-theorem","source_sha256":"5f81d70222e0798beb94672769a983271d147b60078f2e730f4b468ffb26d63e","start":114}],"target_id":"theory.wikipedia.monotone-convergence-theorem","target_kind":"node","target_sha256":"004673dc2fa251a7067bdb9f123367e182fda86333f2e70f26b25ed3cfaec7c4"}],"theory.wikipedia.tarski-s-undefinability-theorem":[{"id":"assertion.theory.wikipedia.tarski-s-undefinability-theorem","scope":{"assumptions":"Attributed encyclopedia lead sentence (CC BY-SA 4.0); not an original research or historical-priority claim","population":"Tarski's undefinability theorem as described in the lead of the captured English Wikipedia article","quantifiers":"Only what the captured sentence states","time":null,"uncertainty":"Source attribution only; no claim of consensus, empirical validation or frontier status","units":null},"statement":"English Wikipedia (article \"Tarski's undefinability theorem\", CC BY-SA 4.0) states: Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","support":[{"end":307,"quote":"Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","source_id":"wikipedia.article.tarski-s-undefinability-theorem","source_sha256":"d4043e6ed830efaa012f70c4567b673d9dcfe245dad8970d595aac160d403c56","start":117}],"target_id":"theory.wikipedia.tarski-s-undefinability-theorem","target_kind":"node","target_sha256":"9ac0c2a6c2c358982dace3b5d511efb4a99c860a7d50d4d2d2c4e8766f4413c2"}]},"nodes":[{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.self-other","kind":"origin","label":"Self / other","sources":[],"status":"foundational","summary":"Distinguishing one's own body and agency from other entities.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.living-dead","kind":"origin","label":"Living / dead","sources":[],"status":"foundational","summary":"Distinguishing living organisms from dead matter or remains.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.safe-danger","kind":"origin","label":"Safe / dangerous","sources":[],"status":"foundational","summary":"Learning and transmitting threat distinctions.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.edible-toxic","kind":"origin","label":"Edible / harmful","sources":[],"status":"foundational","summary":"Learning which materials can be consumed or should be avoided.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.place","kind":"origin","label":"Here / there","sources":[],"status":"foundational","summary":"Spatial distinction and remembered location.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.cause-effect","kind":"origin","label":"Cause / effect","sources":[],"status":"foundational","summary":"Learning repeatable relations between actions and consequences.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.time-cycle","kind":"origin","label":"Day / night / cycles","sources":[],"status":"foundational","summary":"Recognition of recurring temporal and environmental patterns.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.kin-social","kind":"origin","label":"Kin / stranger / group","sources":[],"status":"foundational","summary":"Social recognition, affiliation, obligation, and threat.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.material","kind":"origin","label":"Material properties","sources":[],"status":"foundational","summary":"Practical distinctions such as hard/soft, sharp/dull, brittle/flexible.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"root.quantity","kind":"origin","label":"More / less / number","sources":[],"status":"foundational","summary":"Approximate quantity and eventually explicit counting.","tags":["root"]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.fire","kind":"practice","label":"Controlled fire","sources":[],"status":"established","summary":"Use of controlled combustion for heat, cooking, protection, landscape modification, and materials processing.","tags":[]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.toolmaking","kind":"practice","label":"Toolmaking","sources":[],"status":"established","summary":"Deliberate shaping and use of external objects to alter the environment.","tags":[]},{"aliases":[],"domain":"roots","era":"origins","frontier":false,"id":"practice.tracking","kind":"practice","label":"Tracking & ecological inference","sources":[],"status":"established","summary":"Inferring animals, weather, resources, and recent events from traces.","tags":[]},{"aliases":[],"domain":"humanities","era":"origins","frontier":false,"id":"practice.oral-tradition","kind":"practice","label":"Oral tradition","sources":[],"status":"foundational","summary":"Transmission of knowledge through speech, story, ritual, demonstration, and memory.","tags":[]},{"aliases":[],"domain":"formal","era":"agrarian","frontier":false,"id":"concept.counting","kind":"concept","label":"Counting","sources":[],"status":"established","summary":"Explicit symbolic or systematic enumeration of quantities.","tags":[]},{"aliases":[],"domain":"formal","era":"agrarian","frontier":false,"id":"field.geometry","kind":"field","label":"Geometry","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of shape, space, measurement, and spatial relations.","tags":[]},{"aliases":[],"domain":"humanities","era":"agrarian","frontier":false,"id":"practice.writing","kind":"practice","label":"Writing & records","sources":[],"status":"established","summary":"Durable external symbolic records that allow knowledge to outlive individual memory.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.astronomy","kind":"field","label":"Astronomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.dd44e18a1fa393e60806","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001256","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001256"}],"status":"reported","summary":"NLM MeSH describes Astronomy as: The science concerned with celestial bodies and the observation and interpretation of the radiation received in the vicinity of the earth from the component parts of the universe (McGraw Hill Dictionary of Scientific and Technical Terms, 5th ed)","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"practice.agriculture","kind":"practice","label":"Agriculture","sources":[{"id":"usgs-thesaurus.8faa7636b7aa8527a5ab","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=24","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=24"}],"status":"reported","summary":"USGS Thesaurus defines Agriculture as: The science and business of soil cultivation to raise crops and of animal husbandry to raise domesticated animals.","tags":[]},{"aliases":[],"domain":"health","era":"agrarian","frontier":false,"id":"practice.medicine","kind":"practice","label":"Early medicine","sources":[],"status":"historical","summary":"Early healing practices combining empirical remedies, surgery, ritual, and inherited explanations.","tags":[]},{"aliases":[],"domain":"social","era":"agrarian","frontier":false,"id":"concept.law","kind":"concept","label":"Codified law","sources":[],"status":"active","summary":"Externalized rules and procedures for social governance.","tags":[]},{"aliases":[],"domain":"earth","era":"agrarian","frontier":false,"id":"field.navigation","kind":"field","label":"Navigation","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Knowledge and methods for determining position and direction across terrain and water.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.logic","kind":"field","label":"Logic","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.a39a42601f13cc4e3244","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D008128","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008128"}],"status":"reported","summary":"NLM MeSH describes Logic as: The science that investigates the principles governing correct or reliable inference and deals with the canons and criteria of validity in thought and demonstration. This system of reasoning is applicable to any branch of knowledge or study. (Random House Unabridged Dictionary, 2d ed & Sippl, Computer Dictionary, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.philosophy","kind":"field","label":"Philosophy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.ed675d30c3b71c4b6263","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010684","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010684"}],"status":"reported","summary":"NLM MeSH describes Philosophy as: A love or pursuit of wisdom. A search for the underlying causes and principles of reality. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.anatomy","kind":"field","label":"Anatomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh","title":"NLM Medical Subject Headings (MeSH)","url":"https://www.nlm.nih.gov/mesh/meshhome.html"},{"id":"nlm-mesh.0b589dd05c92deac1e04","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000715","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000715"}],"status":"reported","summary":"NLM MeSH describes Anatomy as: A branch of biology dealing with the structure of organisms.","tags":[]},{"aliases":[],"domain":"formal","era":"classical","frontier":false,"id":"field.algebra","kind":"field","label":"Algebra","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Symbolic study of operations, relations, equations, and abstract structures.","tags":[]},{"aliases":[],"domain":"physical","era":"classical","frontier":false,"id":"field.optics","kind":"field","label":"Optics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of light, vision, and optical phenomena.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.cartography","kind":"field","label":"Cartography","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.5381093d44dfea691929","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=147","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=147"}],"status":"reported","summary":"USGS Thesaurus defines Cartography as: The science and art of making maps.","tags":[]},{"aliases":[],"domain":"roots","era":"early-modern","frontier":false,"id":"method.scientific","kind":"method","label":"Experimental scientific method","sources":[],"status":"established","summary":"Iterative observation, measurement, hypothesis testing, controlled comparison, and public reproducibility.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.physics","kind":"field","label":"Physics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.c9083b1f6c559b444afe","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010825","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010825"}],"status":"reported","summary":"NLM MeSH describes Physics as: The study of those aspects of energy and matter in terms of elementary principles and laws. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"field.chemistry","kind":"field","label":"Chemistry","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.67a1950c3c2557253dd5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D002621","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002621"}],"status":"reported","summary":"NLM MeSH describes Chemistry as: A basic science concerned with the composition, structure, and properties of matter; and the reactions that occur between substances and the associated energy exchange.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.geology","kind":"field","label":"Geology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.91b39721167a39a9ed03","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=464","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=464"}],"status":"reported","summary":"USGS Thesaurus defines Geology as: Study of the planet earth, its composition, structure, physical and chemical processes, and history since its origin.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.biology","kind":"field","label":"Biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.5934874aa38f9094fd81","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001695","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001695"}],"status":"reported","summary":"NLM MeSH describes Biology as: One of the BIOLOGICAL SCIENCE DISCIPLINES concerned with the origin, structure, development, growth, function, genetics, and reproduction of animals, plants, and microorganisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"early-modern","frontier":false,"id":"field.taxonomy","kind":"field","label":"Taxonomy","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Theory and practice of classification and naming.","tags":["ology"]},{"aliases":[],"domain":"formal","era":"early-modern","frontier":false,"id":"field.statistics","kind":"field","label":"Statistics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Methods for learning from variable data and quantifying uncertainty.","tags":[]},{"aliases":[],"domain":"physical","era":"classical","frontier":false,"id":"claim.geocentric","kind":"claim","label":"Geocentric planetary model","sources":[],"status":"invalidated","summary":"Historical Earth-centered planetary models fail as general physical descriptions of planetary motion and have been superseded by heliocentric and celestial-mechanical models.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"claim.phlogiston","kind":"claim","label":"Phlogiston theory","sources":[],"status":"invalidated","summary":"Historical theory positing a fire-like substance released during combustion; superseded by oxygen-based chemistry.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"claim.miasma","kind":"claim","label":"Miasma disease theory","sources":[],"status":"invalidated","summary":"Historical theory attributing many diseases to harmful bad air; superseded for infectious disease causation by germ theory and modern epidemiology.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"concept.phlogiston-program","kind":"concept","label":"Phlogiston chemistry program","sources":[],"status":"historical","summary":"A historical explanatory program built around phlogiston.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"practice.miasma-control","kind":"practice","label":"Miasma-based disease control","sources":[],"status":"historical","summary":"Public-health interventions justified specifically by miasma causation; some sanitation actions helped for reasons the theory did not correctly identify.","tags":[]},{"aliases":[],"domain":"health","era":"industrial-modern","frontier":false,"id":"claim.germ-theory","kind":"claim","label":"Germ theory of infectious disease","sources":[],"status":"established","summary":"Many infectious diseases are caused by microorganisms and transmissible biological agents.","tags":[]},{"aliases":[],"domain":"life","era":"industrial-modern","frontier":false,"id":"claim.evolution","kind":"claim","label":"Evolution by natural selection","sources":[],"status":"established","summary":"Heritable variation combined with differential reproduction can drive adaptive evolutionary change.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.genetics","kind":"field","label":"Genetics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.55d3172c77bc4f57a64a","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=433","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=433"}],"status":"reported","summary":"USGS Thesaurus defines Genetics as: Branch of biology that deals with heredity or the passing of traits in living organisms from one generation to the next.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.ecology","kind":"field","label":"Ecology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.54a47b5a480dee09e51c","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=311","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=311"}],"status":"reported","summary":"USGS Thesaurus defines Ecology as: Study of the relations between living plants and animals and their environment.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.microbiology","kind":"field","label":"Microbiology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.dcab6f768c008f0c2c69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=735","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=735"}],"status":"reported","summary":"USGS Thesaurus defines Microbiology as: Branch of biology dealing with organisms too small to be seen without the use of a microscope.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.thermodynamics","kind":"field","label":"Thermodynamics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"url":"https://www.nist.gov/thermodynamics"}],"status":"active","summary":"Study of energy, heat, work, entropy, and macroscopic state relations.","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"field.electromagnetism","kind":"field","label":"Electromagnetism","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Unified study of electric and magnetic fields and interactions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.sociology","kind":"field","label":"Sociology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.902611a238e10eb5c9bf","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012961"}],"status":"reported","summary":"NLM MeSH describes Sociology as: A social science dealing with group relationships, patterns of collective behavior, and social organization.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.psychology","kind":"field","label":"Psychology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.7d823551929a4fc3072e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011584","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011584"}],"status":"reported","summary":"NLM MeSH describes Psychology as: The science dealing with the study of mental processes and behavior in man and animals.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.anthropology","kind":"field","label":"Anthropology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.bcc9794e5c2487d85964","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000883","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000883"}],"status":"reported","summary":"NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.archaeology","kind":"field","label":"Archaeology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.76d8813e0d4330d9aaf5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001106"}],"status":"reported","summary":"NLM MeSH describes Archaeology as: Study of the ancient and recent human or animal past through material remains. It analyzes the physical remains of the past in pursuit of a broad and comprehensive understanding of human culture.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.economics","kind":"field","label":"Economics","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.3b75ab5915b79fbe20b6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004467","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004467"}],"status":"reported","summary":"NLM MeSH describes Economics as: The science of utilization, distribution, and consumption of services and materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"industrial-modern","frontier":false,"id":"field.engineering","kind":"field","label":"Engineering science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Application of scientific and mathematical knowledge to design and build systems.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"claim.relativity","kind":"claim","label":"Relativity","sources":[],"status":"established","summary":"Special and general relativity describe spacetime, gravitation, and relativistic motion across tested regimes.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"claim.quantum","kind":"claim","label":"Quantum mechanics","sources":[],"status":"established","summary":"Quantum theory models microscopic systems using probabilistic amplitudes, operators, and quantized observables.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.cosmology","kind":"field","label":"Cosmology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"url":"https://science.nasa.gov/universe/the-big-bang/"}],"status":"active","summary":"Study of the origin, structure, evolution, and large-scale dynamics of the universe.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.molecular-biology","kind":"field","label":"Molecular biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.d2d1d971931c29ceef7f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=756","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=756"}],"status":"reported","summary":"USGS Thesaurus defines Molecular biology as: Branch of biology concerned with the study of physiology at the molecular level.","tags":["ology"]},{"aliases":[],"domain":"information","era":"twentieth","frontier":false,"id":"field.neuroscience","kind":"field","label":"Neuroscience","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"}],"status":"active","summary":"Study of nervous systems, neural computation, development, function, and disease.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.computer-science","kind":"field","label":"Computer science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.c12f0d8d6bc2875dfd18","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190"}],"status":"reported","summary":"USGS Thesaurus defines Computer science as: Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.information-theory","kind":"field","label":"Information theory","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.29527d691d2b917a2f70","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D007257","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007257"}],"status":"reported","summary":"NLM MeSH describes Information theory as: An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and CYBERNETICS .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.ai","kind":"field","label":"Artificial intelligence","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.8fdf3c0558d0b89101fb","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001185","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001185"}],"status":"reported","summary":"NLM MeSH describes Artificial intelligence as: Theory and development of COMPUTER SYSTEMS which perform tasks that normally require human intelligence. Such tasks may include speech recognition, LEARNING ; VISUAL PERCEPTION ; MATHEMATICAL COMPUTING ; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"field.cognitive-science","kind":"field","label":"Cognitive science","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.3afa87c4efa263dea007","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019336"}],"status":"reported","summary":"NLM MeSH describes Cognitive science as: The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.epidemiology","kind":"field","label":"Epidemiology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh","title":"NLM Medical Subject Headings (MeSH)","url":"https://www.nlm.nih.gov/mesh/meshhome.html"},{"id":"nlm-mesh.ca259dbfe57d6af9326c","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004813"}],"status":"reported","summary":"NLM MeSH describes Epidemiology as: Field concerned with the determination of causes, incidence, and characteristic behavior of disease outbreaks affecting human populations. It includes the interrelationships of host, agent, and environment as related to the distribution and control of disease.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"field.systems-biology","kind":"field","label":"Systems biology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"nlm-mesh.ac32a89227fa482fcba6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D049490","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049490"}],"status":"reported","summary":"NLM MeSH describes Systems biology as: Comprehensive, methodical analysis of complex biological systems by monitoring responses to perturbations of biological processes. Large scale, computerized collection and analysis of the data are used to develop and test models of biological systems.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.climatology","kind":"field","label":"Climatology","sources":[{"id":"oecd-frascati-2015","title":"OECD Frascati Manual 2015 — Fields of R&D classification","url":"https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"},{"id":"usgs-thesaurus.e70c8d2c1e03ea23b093","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170"}],"status":"reported","summary":"USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.quantum-gravity","kind":"question","label":"Quantum gravity","sources":[],"status":"frontier","summary":"How can gravity and quantum theory be reconciled in a predictive, empirically grounded framework?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.dark-matter","kind":"question","label":"Nature of dark matter","sources":[],"status":"frontier","summary":"What accounts for the gravitational phenomena attributed to dark matter?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"question.dark-energy","kind":"question","label":"Nature of dark energy","sources":[],"status":"frontier","summary":"What explains the observed accelerated expansion of the universe?","tags":["frontier"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"question.origin-life","kind":"question","label":"Origin of life","sources":[],"status":"frontier","summary":"Which chemical and environmental pathways produced the first self-sustaining evolving systems?","tags":["frontier"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"question.consciousness","kind":"question","label":"Mechanistic basis of consciousness","sources":[],"status":"frontier","summary":"Which physical and computational properties are sufficient and necessary for conscious experience?","tags":["frontier"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"question.aging","kind":"question","label":"Comprehensive control of biological aging","sources":[],"status":"frontier","summary":"Which causal mechanisms of aging can be safely modified to extend healthy function?","tags":["frontier"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"question.predict-climate","kind":"question","label":"High-resolution climate predictability","sources":[],"status":"frontier","summary":"How far can coupled climate dynamics be predicted at useful local resolution under changing forcing?","tags":["frontier"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"question.general-ai","kind":"question","label":"General machine intelligence","sources":[],"status":"frontier","summary":"Which architectures can robustly generalize, plan, learn, and self-correct across open-ended domains?","tags":["frontier"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"question.math-foundations","kind":"question","label":"Limits of formal reasoning","sources":[],"status":"frontier","summary":"What new formal structures best characterize provability, computation, complexity, and mathematical discovery?","tags":["frontier"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"question.social-prediction","kind":"question","label":"Reliable social-system prediction","sources":[],"status":"frontier","summary":"Which aspects of large-scale social behavior can be predicted without destroying validity through intervention and adaptation?","tags":["frontier"]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"smoke.automate-merge","kind":"concept","label":"Automate merge smoke","sources":[{"kind":"primary","title":"Nemesis","url":"https://github.com/mikecreation/ZotBot"}],"status":"active","summary":"Proves Brain auto-merge after Open PR when Automate is on.","tags":["smoke"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.dark-energy","kind":"field","label":"Dark energy","sources":[{"id":"desi-science-mission","kind":"collaboration","title":"the DESI science mission","url":"https://www.desi.lbl.gov/the-desi-science-mission/"},{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","summary":"Research program investigating the cause and possible evolution of late-time cosmic acceleration.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cosmic-acceleration","kind":"concept","label":"Late-time cosmic acceleration","sources":[],"status":"established","summary":"Observed accelerated expansion whose physical cause remains unresolved.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.lambda-cdm","kind":"theory","label":"LambdaCDM","sources":[{"id":"desi-lya-2026","kind":"collaboration","title":"New DESI DR2 Lyman-alpha Results Shed Light on Dark Energy","url":"https://www.desi.lbl.gov/2026/07/30/new-desi-dr2-lyman-alpha-results-shed-light-on-dark-energy/"},{"id":"lvk-o4b-cosmology","kind":"collaboration","title":"Latest constraints on cosmic expansion and general relativity with gravitational waves","url":"https://ligo.org/science-summaries/o4b_cosmology/"},{"url":"https://science.nasa.gov/universe/overview/"}],"status":"active","summary":"Standard cosmological model combining cold dark matter with a cosmological constant.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cosmological-constant-de","kind":"theory","label":"Cosmological constant as dark energy","sources":[],"status":"disputed","summary":"Constant vacuum-energy explanation of acceleration; current datasets test departures from it.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.wcdm","kind":"theory","label":"wCDM","sources":[{"id":"des-y6-dark-energy","kind":"collaboration","title":"DES Y6 Cosmology Papers","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Cosmological extension in which dark energy has a constant equation-of-state parameter w that need not equal minus one.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"physical.w0wa-cdm","kind":"theory","label":"w0waCDM","sources":[{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Extension allowing dark energy to evolve with scale factor.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"physical.evolving-dark-energy","kind":"concept","label":"Evolving dark energy","sources":[{"url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"}],"status":"active","summary":"Hypothesis that dark-energy density or equation of state changes over cosmic time.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.bao","kind":"method","label":"Baryon acoustic oscillations","sources":[{"id":"desi-dr2-guide","url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"},{"id":"desi-science-mission","kind":"collaboration","title":"the DESI science mission","url":"https://www.desi.lbl.gov/the-desi-science-mission/"},{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","summary":"Standard-ruler technique using the characteristic clustering scale inherited from early-universe acoustic waves to constrain cosmic expansion.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi-dr2-bao","kind":"dataset","label":"DESI DR2 BAO cosmology","sources":[{"id":"desi-dr2","url":"https://data.desi.lbl.gov/doc/papers/dr2/"},{"id":"desi-dr2-guide","kind":"collaboration","title":"DESI DR2 Results: March 19 Guide","url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"},{"id":"desi-dr2-publications","kind":"collaboration","title":"DESI DR2 Publications","url":"https://data.desi.lbl.gov/doc/papers/dr2/"},{"url":"https://www.desi.lbl.gov/2025/03/19/desi-dr2-results-march-19-guide/"}],"status":"active","summary":"Cosmological baryon-acoustic-oscillation measurements and constraints derived from DESI's first three survey years.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi-dr2-lya-fullshape","kind":"dataset","label":"DESI DR2 Lyman-alpha full-shape","sources":[{"id":"desi-lya-2026","url":"https://www.desi.lbl.gov/2026/07/30/new-desi-dr2-lyman-alpha-results-shed-light-on-dark-energy/"}],"status":"active","summary":"Full-shape Lyman-alpha forest analysis providing improved cosmological constraints and discrimination between competing dark-energy models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.des-y6-dark-energy","kind":"dataset","label":"DES Year 6 dark-energy constraints","sources":[{"id":"des-y6","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"id":"des-y6-dark-energy","kind":"collaboration","title":"DES Y6 Cosmology Papers","url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"},{"url":"https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/"}],"status":"active","summary":"Full six-year Dark Energy Survey multi-probe constraints on constant and dynamical dark-energy models.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.standard-model-particle-physics","kind":"theory","label":"Standard Model of particle physics","sources":[{"id":"cern-standard-model","kind":"official","title":"The Standard Model","url":"https://home.cern/science/physics/standard-model/"},{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","summary":"Framework describing fundamental particles and three of the four fundamental interactions.","tags":[]},{"aliases":["Gravitational-wave laser interferometry"],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gravitational-wave-interferometry","kind":"method","label":"Gravitational-wave interferometry","sources":[{"id":"ligo-gw150914-detectors","kind":"collaboration","title":"GW150914: The Advanced LIGO detectors in the era of first discoveries","url":"https://ligo.org/science-summaries/GW150914Detector/"},{"url":"https://ligo.org/science-summaries/GW150914Detector/"}],"status":"active","summary":"Laser-interferometric measurement of differential length changes produced by passing gravitational waves.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw150914","kind":"dataset","label":"GW150914","sources":[{"id":"ligo-gw150914","kind":"collaboration","title":"GW150914","url":"https://ligo.org/detections/gw150914/"},{"url":"https://ligo.org/detections/gw150914/"}],"status":"active","summary":"First directly detected gravitational-wave event, associated with a binary black-hole merger.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.si-defining-constants","kind":"concept","label":"SI defining constants","sources":[{"id":"nist-meet-constants","kind":"standards-body","title":"Meet the Constants","url":"https://www.nist.gov/si-redefinition/meet-constants"},{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","summary":"Seven fixed constants that define the modern International System of Units.","tags":[]},{"aliases":["CODATA fundamental physical constants"],"domain":"physical","era":"frontier","frontier":false,"id":"physical.codata-fundamental-constants","kind":"dataset","label":"CODATA fundamental constants","sources":[{"id":"nist-fundamental-constants","kind":"standards-body","title":"Fundamental Physical Constants","url":"https://www.nist.gov/pml/fundamental-physical-constants"},{"id":"nist-codata-2022","kind":"standards-body","title":"CODATA Recommended Values of the Fundamental Physical Constants: 2022","url":"https://www.nist.gov/publications/codata-recommended-values-fundamental-physical-constants-2022"},{"url":"https://www.nist.gov/pml/fundamental-physical-constants"}],"status":"active","summary":"Internationally recommended values and conversion factors for fundamental physical constants.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.precision-metrology","kind":"field","label":"Precision physical metrology","sources":[{"id":"nist-si-units","kind":"standards-body","title":"SI Units","url":"https://www.nist.gov/pml/owm/metric-si/si-units"}],"status":"active","summary":"High-precision measurement science linking physical quantities to stable standards and fundamental constants.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.general-relativity","kind":"theory","label":"General relativity","sources":[{"id":"lvk-o4b-tgr-2026","kind":"collaboration","title":"Testing general relativity with the latest and loudest compact binary merger observations","url":"https://ligo.org/science-summaries/o4b_tgr/"},{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","summary":"Einsteinian theory in which gravitation is described through dynamical spacetime geometry.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw250114","kind":"dataset","label":"GW250114","sources":[{"id":"ligo-gw250114-gr","kind":"collaboration","title":"Exceptional tests of general relativity with GW250114","url":"https://ligo.org/exceptional-tests-of-general-relativity-with-gw250114/"},{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","summary":"Exceptionally loud 2025 binary-black-hole gravitational-wave signal used for stringent strong-field tests of general relativity.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gwtc5-cosmology-gr","kind":"dataset","label":"GWTC-5 cosmology and gravity constraints","sources":[{"id":"lvk-o4b-cosmology","kind":"collaboration","title":"Latest constraints on cosmic expansion and general relativity with gravitational waves","url":"https://ligo.org/science-summaries/o4b_cosmology/"}],"status":"active","summary":"Gravitational-wave catalog analysis using 236 detections to constrain cosmic expansion and test gravitational-wave propagation under general relativity.","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"physical.classical-mechanics","kind":"field","label":"Classical mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"early-modern","frontier":false,"id":"physical.newtonian-mechanics","kind":"theory","label":"Newtonian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.lagrangian-mechanics","kind":"method","label":"Lagrangian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.hamiltonian-mechanics","kind":"method","label":"Hamiltonian mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.phase-space","kind":"concept","label":"Phase space","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.chaos-theory","kind":"field","label":"Chaos theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.continuum-mechanics","kind":"field","label":"Continuum mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.fluid-dynamics","kind":"field","label":"Fluid dynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.classical-wave-theory","kind":"theory","label":"Classical wave theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.special-relativity","kind":"theory","label":"Special relativity","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.lorentz-transformations","kind":"concept","label":"Lorentz transformations","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.equivalence-principle","kind":"concept","label":"Equivalence principle","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spacetime","kind":"concept","label":"Spacetime","sources":["https://www.einstein-online.info/en/",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.black-holes","kind":"concept","label":"Black holes","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.schwarzschild-solution","kind":"theory","label":"Schwarzschild solution","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.kerr-solution","kind":"theory","label":"Kerr solution","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gravitational-lensing","kind":"method","label":"Gravitational lensing","sources":["https://www.einstein-online.info/en/",{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gravitational-time-dilation","kind":"concept","label":"Gravitational time dilation","sources":["https://www.einstein-online.info/en/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gravitational-waves","kind":"concept","label":"Gravitational waves","sources":["https://www.ligo.org/science/GW-Detecting.php",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.thermodynamic-entropy","kind":"concept","label":"Thermodynamic entropy","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.first-law-thermodynamics","kind":"concept","label":"First law of thermodynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.second-law-thermodynamics","kind":"concept","label":"Second law of thermodynamics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.statistical-mechanics","kind":"field","label":"Statistical mechanics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"industrial-modern","frontier":false,"id":"physical.boltzmann-distribution","kind":"concept","label":"Boltzmann distribution","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.partition-function","kind":"concept","label":"Partition function","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.fluctuation-dissipation","kind":"theory","label":"Fluctuation-dissipation relation","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.phase-transitions","kind":"concept","label":"Phase transitions","sources":["https://www.nobelprize.org/prizes/physics/1982/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.renormalization-group","kind":"method","label":"Renormalization group","sources":["https://www.nobelprize.org/prizes/physics/1982/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.condensed-matter-physics","kind":"field","label":"Condensed matter physics","sources":["https://www.nobelprize.org/prizes/physics/2016/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.superconductivity","kind":"concept","label":"Superconductivity","sources":["https://www.nobelprize.org/prizes/physics/1972/summary/",{"url":"https://www.nist.gov/publications/superconductive-materials-and-some-their-properties"},{"id":"nlm-mesh.ea1a6d368c155be3d8c0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000072176","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072176"}],"status":"reported","summary":"NLM MeSH describes Superconductivity as: The ability of an element or metallic alloy to allow the passage of ELECTRONS without ELECTRICAL RESISTANCE and expel MAGNETIC FIELDS below a certain threshold temperature called superconducting transition temperature.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.superfluidity","kind":"concept","label":"Superfluidity","sources":["https://www.nobelprize.org/prizes/physics/2003/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.bose-einstein-condensate","kind":"concept","label":"Bose-Einstein condensate","sources":["https://www.nobelprize.org/prizes/physics/2001/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.band-theory","kind":"theory","label":"Electronic band theory","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.semiconductor-physics","kind":"field","label":"Semiconductor physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-hall-effect","kind":"concept","label":"Quantum Hall effect","sources":["https://www.nobelprize.org/prizes/physics/1985/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.topological-phases","kind":"field","label":"Topological phases of matter","sources":["https://www.nobelprize.org/prizes/physics/2016/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.phonons","kind":"concept","label":"Phonons","sources":["https://www.feynmanlectures.caltech.edu/",{"id":"nlm-mesh.eec83cc55bf64504604d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D060739","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060739"}],"status":"reported","summary":"NLM MeSH describes Phonons as: Quanta of acoustic energy which move at the speed of sound.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.density-functional-theory","kind":"theory","label":"Density functional theory","sources":["https://www.nobelprize.org/prizes/chemistry/1998/summary/",{"id":"nlm-mesh.7ab391e314472715de34","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000077318","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077318"}],"status":"reported","summary":"NLM MeSH describes Density functional theory as: A theory that is used to describe the electronic ground state properties of matter. It forms the basis of methods in obtaining a solution to the Schrodinger equation for a many-body system, and to investigate the structural, magnetic, and electronic properties of molecules and materials.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.atomic-physics","kind":"field","label":"Atomic physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.molecular-physics","kind":"field","label":"Molecular physics","sources":["https://www.feynmanlectures.caltech.edu/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spectroscopy","kind":"method","label":"Spectroscopy","sources":["https://www.nist.gov/pml/atomic-spectroscopy",{"url":"https://www.nist.gov/quantum-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.laser-physics","kind":"field","label":"Laser physics","sources":["https://www.nobelprize.org/prizes/physics/1964/summary/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.photoelectric-effect","kind":"concept","label":"Photoelectric effect","sources":["https://www.nobelprize.org/prizes/physics/1921/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.compton-scattering","kind":"concept","label":"Compton scattering","sources":["https://www.nobelprize.org/prizes/physics/1927/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-entanglement","kind":"concept","label":"Quantum entanglement","sources":["https://www.nobelprize.org/prizes/physics/2022/summary/",{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.uncertainty-principle","kind":"concept","label":"Uncertainty principle","sources":["https://www.nobelprize.org/prizes/physics/1932/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.schrodinger-equation","kind":"theory","label":"Schrodinger equation","sources":["https://www.nobelprize.org/prizes/physics/1933/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-field-theory","kind":"theory","label":"Quantum field theory","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gauge-symmetry","kind":"concept","label":"Gauge symmetry","sources":["https://home.cern/science/physics/standard-model"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-electrodynamics","kind":"theory","label":"Quantum electrodynamics","sources":["https://pdg.lbl.gov/",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-chromodynamics","kind":"theory","label":"Quantum chromodynamics","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.electroweak-theory","kind":"theory","label":"Electroweak theory","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.spontaneous-symmetry-breaking","kind":"concept","label":"Spontaneous symmetry breaking","sources":["https://home.cern/science/physics/higgs-boson"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.higgs-mechanism","kind":"theory","label":"Higgs mechanism","sources":["https://home.cern/science/physics/higgs-boson"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.higgs-boson","kind":"concept","label":"Higgs boson","sources":["https://www.nobelprize.org/prizes/physics/2013/summary/",{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quarks","kind":"concept","label":"Quarks","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.leptons","kind":"concept","label":"Leptons","sources":["https://home.cern/science/physics/standard-model",{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gluons","kind":"concept","label":"Gluons","sources":["https://home.cern/science/physics/standard-model"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutrino-oscillation","kind":"concept","label":"Neutrino oscillation","sources":["https://www.nobelprize.org/prizes/physics/2015/summary/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ckm-matrix","kind":"concept","label":"CKM matrix","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cp-violation","kind":"concept","label":"CP violation","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.proton","kind":"concept","label":"Proton","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutron","kind":"concept","label":"Neutron","sources":["https://pdg.lbl.gov/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-physics","kind":"field","label":"Nuclear physics","sources":["https://science.osti.gov/np",{"id":"nlm-mesh.07b63efcca979228caf2","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009686"}],"status":"reported","summary":"NLM MeSH describes Nuclear physics as: The study of the characteristics, behavior, and internal structures of the atomic nucleus and its interactions with other nuclei. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.nuclear-shell-model","kind":"theory","label":"Nuclear shell model","sources":["https://science.osti.gov/np"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.radioactive-decay","kind":"concept","label":"Radioactive decay","sources":["https://science.osti.gov/np"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-fission","kind":"concept","label":"Nuclear fission","sources":["https://science.osti.gov/np",{"id":"nlm-mesh.318cd4bb9106898947d3","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009680","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009680"}],"status":"reported","summary":"NLM MeSH describes Nuclear fission as: Nuclear reaction in which the nucleus of a heavy atom such as uranium or plutonium is split into two approximately equal parts by a neutron, charged particle, or photon.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.nuclear-fusion","kind":"concept","label":"Nuclear fusion","sources":["https://science.osti.gov/fes",{"id":"nlm-mesh.544020cbe017717b1a9e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009681"}],"status":"reported","summary":"NLM MeSH describes Nuclear fusion as: Thermonuclear reaction in which the nuclei of an element of low atomic weight unite under extremely high temperature and pressure to form a nucleus of a heavier atom.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.plasma-physics","kind":"field","label":"Plasma physics","sources":["https://science.osti.gov/fes"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.magnetohydrodynamics","kind":"theory","label":"Magnetohydrodynamics","sources":["https://science.osti.gov/fes"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.astrophysics","kind":"field","label":"Astrophysics","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.stellar-evolution","kind":"theory","label":"Stellar evolution","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.hertzsprung-russell-diagram","kind":"method","label":"Hertzsprung-Russell diagram","sources":["https://science.nasa.gov/universe/stars/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.white-dwarfs","kind":"concept","label":"White dwarfs","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutron-stars","kind":"concept","label":"Neutron stars","sources":["https://science.nasa.gov/universe/stars/",{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.pulsars","kind":"concept","label":"Pulsars","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.supernovae","kind":"concept","label":"Supernovae","sources":["https://science.nasa.gov/universe/stars/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.accretion-disks","kind":"concept","label":"Accretion disks","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.active-galactic-nuclei","kind":"concept","label":"Active galactic nuclei","sources":["https://science.nasa.gov/universe/black-holes/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.exoplanet-transit-method","kind":"method","label":"Exoplanet transit method","sources":["https://science.nasa.gov/exoplanets/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-microwave-background","kind":"concept","label":"Cosmic microwave background","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck",{"url":"https://science.nasa.gov/astrophysics/programs/physics-of-the-cosmos/big-bang-and-the-evolution-of-the-universe/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.inflationary-cosmology","kind":"theory","label":"Inflationary cosmology","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.big-bang-nucleosynthesis","kind":"theory","label":"Big Bang nucleosynthesis","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.hubble-lemaitre-law","kind":"concept","label":"Hubble-Lemaitre law","sources":["https://science.nasa.gov/universe/"],"status":"established","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw-standard-sirens","kind":"method","label":"Gravitational-wave standard sirens","sources":["https://www.ligo.org/science/GW-Detecting.php"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.strong-gravitational-lensing","kind":"method","label":"Strong gravitational lensing","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.weak-gravitational-lensing","kind":"method","label":"Weak gravitational lensing","sources":["https://science.nasa.gov/universe/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.large-scale-structure","kind":"concept","label":"Large-scale structure","sources":["https://www.esa.int/Science_Exploration/Space_Science/Planck",{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.baryon-acoustic-oscillations","kind":"method","label":"Baryon acoustic oscillations","sources":["https://www.desi.lbl.gov/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.dark-matter-cosmology","kind":"theory","label":"Dark-matter cosmology","sources":["https://science.nasa.gov/universe/dark-matter-dark-energy/"],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.quantum-mechanics","kind":"theory","label":"Quantum mechanics","sources":[{"url":"https://www.nist.gov/physics"},{"id":"nlm-mesh.87b2a38d9d82c9b74732","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000098222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098222"}],"status":"reported","summary":"NLM MeSH describes Quantum mechanics as: The field of physics that explains how extremely small objects simultaneously have the characteristics of both particles (tiny pieces of matter) and waves (a disturbance or variation that transfers energy).","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.higgs-field","kind":"concept","label":"Higgs field","sources":[{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.neutrinos","kind":"concept","label":"Neutrinos","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gauge-bosons","kind":"concept","label":"Gauge bosons","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.gluon","kind":"concept","label":"Gluon","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.photon","kind":"concept","label":"Photon","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.w-z-bosons","kind":"concept","label":"W and Z bosons","sources":[{"url":"https://home.cern/science/physics/standard-model/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.top-quark","kind":"concept","label":"Top quark","sources":[{"url":"https://home.cern/science/accelerators/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.large-hadron-collider","kind":"technology","label":"Large Hadron Collider","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.atlas-detector","kind":"technology","label":"ATLAS detector","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.cms-detector","kind":"technology","label":"CMS detector","sources":[{"url":"https://home.cern/science/accelerators/large-hadron-collider"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.higgs-discovery-2012","kind":"claim","label":"Higgs boson discovery","sources":[{"url":"https://home.cern/science/physics/higgs-boson/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.binary-black-holes","kind":"concept","label":"Binary black holes","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.binary-neutron-stars","kind":"concept","label":"Binary neutron stars","sources":[{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.ligo","kind":"technology","label":"LIGO","sources":[{"url":"https://ligo.org/science-summaries/GW150914Detector/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.virgo","kind":"technology","label":"Virgo gravitational-wave detector","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.kagra","kind":"technology","label":"KAGRA gravitational-wave detector","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.gw170817","kind":"dataset","label":"GW170817","sources":[{"url":"https://ligo.org/science-summaries/O3bTGR/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.strong-field-gr-tests","kind":"method","label":"Strong-field tests of general relativity","sources":[{"url":"https://ligo.org/science-summaries/o4b_tgr/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-expansion","kind":"concept","label":"Cosmic expansion","sources":[{"url":"https://science.nasa.gov/astrophysics/science-questions/how-do-matter-energy-space-and-time-behave-under-the-extraordinarily-diverse-conditions-of-the-cosmos/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.big-bang","kind":"theory","label":"Big Bang cosmology","sources":[{"url":"https://science.nasa.gov/universe/the-big-bang/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cosmic-inflation","kind":"theory","label":"Cosmic inflation","sources":[{"url":"https://science.nasa.gov/astrophysics/programs/physics-of-the-cosmos/big-bang-and-the-evolution-of-the-universe/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.dark-matter","kind":"field","label":"Dark matter","sources":[{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.galaxy-clusters","kind":"concept","label":"Galaxy clusters","sources":[{"url":"https://science.nasa.gov/dark-matter/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.primordial-nucleosynthesis","kind":"theory","label":"Primordial nucleosynthesis","sources":[{"url":"https://science.nasa.gov/universe/overview/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.desi","kind":"technology","label":"Dark Energy Spectroscopic Instrument","sources":[{"url":"https://www.desi.lbl.gov/the-desi-science-mission/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.roman-space-telescope","kind":"technology","label":"Nancy Grace Roman Space Telescope","sources":[{"url":"https://science.nasa.gov/astrophysics/science-questions/how-do-matter-energy-space-and-time-behave-under-the-extraordinarily-diverse-conditions-of-the-cosmos/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-information-science","kind":"field","label":"Quantum information science","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.quantum-superposition","kind":"concept","label":"Quantum superposition","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-computing","kind":"field","label":"Quantum computing","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.qubit","kind":"concept","label":"Qubit","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.trapped-ion-quantum-computing","kind":"method","label":"Trapped-ion quantum computing","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-sensing","kind":"method","label":"Quantum sensing","sources":[{"url":"https://www.nist.gov/quantum-information-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-networking","kind":"method","label":"Quantum networking","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.atomic-clocks","kind":"technology","label":"Atomic clocks","sources":[{"url":"https://www.nist.gov/atomic-clocks/how-do-atomic-clocks-work"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.optical-clocks","kind":"technology","label":"Optical clocks","sources":[{"url":"https://www.nist.gov/pml/time-and-frequency-division/quantum-information-sensing-and-networking"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.optical-frequency-combs","kind":"technology","label":"Optical frequency combs","sources":[{"url":"https://www.nist.gov/quantum-science"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.ultracold-atoms","kind":"concept","label":"Ultracold atoms","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-many-body-physics","kind":"field","label":"Quantum many-body physics","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.quantum-simulation","kind":"method","label":"Quantum simulation","sources":[{"url":"https://www.nist.gov/programs-projects/quantum-many-body-physics-quantum-optics-and-quantum-information"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.si-system","kind":"concept","label":"International System of Units","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"},{"id":"nlm-mesh.c66f441f7c1286f2be8b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D007394","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007394"}],"status":"reported","summary":"NLM MeSH describes International System of Units as: A system of physical units in which the fundamental quantities are length, time, mass, electric current, temperature, luminous intensity, and amount of substance, and the corresponding units are the meter, second, kilogram, ampere, kelvin, candela, and mole. The system has been given official status and recommended for universal use by the General Conference on Weights and Measures.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.speed-of-light-constant","kind":"concept","label":"Speed of light in vacuum c","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.planck-constant","kind":"concept","label":"Planck constant h","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.elementary-charge","kind":"concept","label":"Elementary charge e","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.boltzmann-constant","kind":"concept","label":"Boltzmann constant k","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.avogadro-constant","kind":"concept","label":"Avogadro constant NA","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.cesium-hyperfine-frequency","kind":"concept","label":"Cesium-133 hyperfine frequency","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.luminous-efficacy-constant","kind":"concept","label":"Luminous efficacy Kcd","sources":[{"url":"https://www.nist.gov/si-redefinition/meet-constants"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.chemistry-webbook","kind":"dataset","label":"NIST Chemistry WebBook","sources":[{"url":"https://webbook.nist.gov/chemistry/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.refprop","kind":"dataset","label":"REFPROP","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.janaf-thermochemical-tables","kind":"dataset","label":"JANAF thermochemical tables","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.mass-spectral-library","kind":"dataset","label":"NIST Mass Spectral Library","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.xps-database","kind":"dataset","label":"NIST XPS Database","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.thermochemical-data","kind":"field","label":"Thermochemical reference data","sources":[{"url":"https://www.nist.gov/srd/chemistry"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.thermophysical-properties","kind":"field","label":"Thermophysical properties","sources":[{"url":"https://trc.nist.gov/"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"physical.spectroscopic-reference-data","kind":"dataset","label":"Spectroscopic reference data","sources":[{"url":"https://www.nist.gov/srd"}],"status":"active","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"field.quantum-gravity","kind":"field","label":"Quantum gravity","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Gravity-quantum unification and tests.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-nature-of-gravity","kind":"concept","label":"Quantum nature of gravity","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Whether gravity has quantum degrees of freedom.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.gravity-mediated-entanglement","kind":"concept","label":"Gravity-mediated entanglement","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Entanglement generated through gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.bmv-entanglement-witness","kind":"method","label":"BMV entanglement witness","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.b0684b58644cb3ab135c","title":"Public source for atlas completion: https://arxiv.org/abs/1907.08994","url":"https://arxiv.org/abs/1907.08994"}],"status":"reported","summary":"Source-attributed description: Spin-correlation test using mesoscopic masses.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.mass-superposition-probe","kind":"method","label":"Mass-superposition gravity probe","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: Spatial superpositions probe gravity-mediated quantum effects.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-mediator-principle","kind":"concept","label":"Quantum mediator principle","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: Entanglement mediation implies nonclassical mediator structure in the cited argument.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.spin-correlation-readout","kind":"concept","label":"Spin-correlation readout","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Spin correlations witness generated entanglement.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.gravitational-phase-evolution","kind":"concept","label":"Gravitational phase evolution","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Source-attributed description: Gravity-induced relative phase can entangle masses.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.bmv-proposal-2017","kind":"claim","label":"BMV proposal","sources":[{"id":"arxiv:1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.f3e47999b24212e86885","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06050","url":"https://arxiv.org/abs/1707.06050"},{"id":"completion-source.b0684b58644cb3ab135c","title":"Public source for atlas completion: https://arxiv.org/abs/1907.08994","url":"https://arxiv.org/abs/1907.08994"}],"status":"reported","summary":"Source-attributed description: 2017 laboratory entanglement-witness proposal.","tags":[]},{"aliases":["Classical gravity with QFT entanglement"],"domain":"physical","era":"frontier","frontier":false,"id":"theory.classical-gravity-qft-entanglement","kind":"theory","label":"Classical gravity plus QFT entanglement","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Classical-gravity/QFT construction generating entanglement.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.entanglement-scaling-discriminator","kind":"concept","label":"Entanglement scaling discriminator","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Scaling difference proposed to distinguish gravity models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.classical-gravity-entanglement-2025","kind":"claim","label":"Classical-gravity entanglement result","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"status":"active","summary":"Entanglement alone need not uniquely select quantized gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.quantum-information-gravity-test","kind":"concept","label":"Quantum-information gravity test","sources":[{"id":"arxiv:1707.06036","url":"https://arxiv.org/abs/1707.06036"},{"id":"completion-source.038511de4307cd41caf7","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1707.06036","url":"https://arxiv.org/abs/1707.06036"}],"status":"reported","summary":"Source-attributed description: The cited proposals use entanglement between two spatially superposed masses as an indirect witness of quantum features of the mediating gravitational field; they do not report a completed measurement.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.single-graviton-quantum-sensing","kind":"method","label":"Single-graviton quantum sensing","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"},{"id":"completion-source.c3fd2ff048f4ab5e51f1","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"status":"reported","summary":"Source-attributed description: Quantum sensing proposal for single-graviton exchange signatures.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.single-graviton-signature","kind":"concept","label":"Single-graviton signature","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"},{"id":"completion-source.c3fd2ff048f4ab5e51f1","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"status":"reported","summary":"Source-attributed description: Discrete matter-gravity energy exchange as quantization clue.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"field.loop-quantum-gravity","kind":"field","label":"Loop quantum gravity","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Nonperturbative loop/connection quantum gravity.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.spin-network","kind":"concept","label":"Spin network","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Basis states for quantum geometry.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.discrete-quantum-geometry","kind":"concept","label":"Discrete quantum geometry","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Discrete Planck-scale geometry from area/volume operators.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.area-operator","kind":"concept","label":"Quantum area operator","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Operator representing surface area.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.volume-operator","kind":"concept","label":"Quantum volume operator","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Operator representing spatial volume.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"method.connection-representation","kind":"method","label":"Connection representation","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Representation used for nonperturbative quantum-gravity states.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.hamiltonian-constraint","kind":"concept","label":"Hamiltonian constraint","sources":[{"id":"doi:10.1103/PhysRevD.52.5743","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.5743"}],"status":"active","summary":"Constraint tied to Wheeler-DeWitt dynamics.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.ads-cft","kind":"theory","label":"AdS/CFT correspondence","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: Maldacena conjectures that particular M/string-theory compactifications on Anti-de Sitter spacetimes are dual to particular conformal field theories, using a large-N and low-energy construction.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.holographic-duality","kind":"concept","label":"Holographic duality","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: In the cited AdS/CFT proposal, particular M/string-theory compactifications on Anti-de Sitter spacetimes are conjectured to be dual to conformal field theories. This record describes that proposal, without asserting a universal duality.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.large-n-limit","kind":"concept","label":"Large-N limit","sources":[{"id":"arxiv:hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"},{"id":"completion-source.48a4e93c4a296f7c82a6","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9711200","url":"https://arxiv.org/abs/hep-th/9711200"}],"status":"reported","summary":"Source-attributed description: In Maldacena's construction, the large-N limit of certain conformal field theories contains a sector describing supergravity on products of Anti-de Sitter spaces and compact manifolds.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.asymptotic-safety","kind":"theory","label":"Asymptotic safety gravity","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.8f929def81c8e1f18329","title":"Public source for atlas completion: https://arxiv.org/abs/1202.2274","url":"https://arxiv.org/abs/1202.2274"}],"status":"reported","summary":"Source-attributed description: Reuter and Saueressig describe the Asymptotic Safety program in Quantum Einstein Gravity through the effective average action and a proposed non-trivial renormalization-group fixed point. Their review summarizes supporting evidence, rather than establishing universal validity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.functional-rg-gravity","kind":"method","label":"Functional RG for gravity","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"}],"status":"reported","summary":"Source-attributed description: Scale-dependent effective-action flow.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.running-newton-constant","kind":"concept","label":"Running Newton constant","sources":[{"id":"arxiv:hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"},{"id":"completion-source.2c0649ad63e4e38974e2","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/hep-th/9605030","url":"https://arxiv.org/abs/hep-th/9605030"}],"status":"reported","summary":"Source-attributed description: Scale dependence of Newton coupling.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"theory.causal-dynamical-triangulations","kind":"theory","label":"Causal dynamical triangulations","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Background-independent causal sum over geometries.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.emergent-four-dimensionality","kind":"concept","label":"Emergent four-dimensionality","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Macroscopic 4D spacetime emerges dynamically.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"method.sum-over-geometries","kind":"method","label":"Sum over geometries","sources":[{"id":"doi:10.1103/PhysRevLett.93.131301","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.93.131301"}],"status":"active","summary":"Nonperturbative summation of causal geometries.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"theory.causal-set","kind":"theory","label":"Causal set theory","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Spacetime as locally finite partial order.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.local-finiteness","kind":"concept","label":"Causal-set local finiteness","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Finite elements in bounded causal intervals.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.causal-partial-order","kind":"concept","label":"Causal partial order","sources":[{"id":"doi:10.1103/PhysRevLett.59.521","url":"https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.59.521"}],"status":"active","summary":"Order relation encodes causal precedence.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"concept.minimal-observable-length","kind":"concept","label":"Minimal observable length","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Lower bound on position resolution.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"theory.generalized-uncertainty-relation","kind":"theory","label":"Generalized uncertainty relation","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Modified uncertainty relation encoding minimal length.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"method.minimal-length-hilbert-space","kind":"method","label":"Minimal-length Hilbert representation","sources":[{"id":"doi:10.1103/PhysRevD.52.1108","url":"https://journals.aps.org/prd/abstract/10.1103/PhysRevD.52.1108"}],"status":"active","summary":"Hilbert-space realization of generalized uncertainty.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.lorentz-invariance-violation","kind":"concept","label":"Lorentz-invariance violation","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Energy-dependent photon propagation in some QG models.","tags":[]},{"aliases":["Gamma-ray burst dispersion test"],"domain":"physical","era":"undated","frontier":false,"id":"method.gamma-ray-burst-dispersion-test","kind":"method","label":"GRB dispersion test","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Gamma-ray timing constrains vacuum dispersion.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.fermi-lat","kind":"technology","label":"Fermi LAT","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Gamma-ray telescope used for LIV constraints.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.grb090510","kind":"concept","label":"GRB 090510","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: GRB090510 is a gamma-ray burst observed by Fermi-LAT whose emission was used in the cited conditional vacuum-dispersion analysis. This record denotes the burst; its photon observations have a separate dataset record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.qg-liv-constraint-2013","kind":"claim","label":"Quantum-gravity LIV constraint","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: Fermi data disfavors some Planck-scale linear-dispersion models.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"field.dark-matter","kind":"field","label":"Dark matter","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Unseen gravitating matter inferred from astrophysical and cosmological observations.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"theory.wimp-dark-matter","kind":"theory","label":"WIMP dark matter","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Weakly interacting massive particle dark-matter hypothesis.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"method.direct-detection","kind":"method","label":"Direct dark-matter detection","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Searches for dark-matter scattering in terrestrial detectors.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"instrument.xenonnt","kind":"technology","label":"XENONnT","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Dual-phase xenon detector used for WIMP searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"dataset.xenonnt-3p1-tonne-year","kind":"dataset","label":"XENONnT 3.1 tonne-year exposure","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Combined exposure from two science campaigns.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.nuclear-recoil-signal","kind":"concept","label":"Nuclear recoil signal","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Recoil signature targeted in WIMP-xenon scattering searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.spin-independent-cross-section","kind":"concept","label":"Spin-independent WIMP cross section","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"Interaction parameter constrained by xenon searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.xenonnt-null-2025","kind":"claim","label":"XENONnT null excess","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"status":"active","summary":"No significant excess above background in the cited exposure.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.lux-zeplin","kind":"technology","label":"LUX-ZEPLIN","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: Two-phase xenon TPC used for direct dark-matter searches.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.lz-4p2-tonne-year","kind":"concept","label":"LZ 4.2 tonne-year exposure","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP-search analysis has a total exposure of 4.2 ± 0.1 tonne-years over 280 live days. This record denotes that exposure quantity; the associated detector data have a separate dataset record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.spin-dependent-cross-section","kind":"concept","label":"Spin-dependent WIMP cross section","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The spin-dependent WIMP-nucleon cross section is an interaction parameter on which the cited LZ nuclear-recoil search places constraints; it is not a detection of that interaction.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.lz-null-2024","kind":"claim","label":"LZ null excess","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: No excess over expected backgrounds in cited WIMP search.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.wimp-parameter-space","kind":"concept","label":"WIMP parameter space","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: Mass-cross-section region constrained by direct searches.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"evidence.lz-high-energy-event-2026","kind":"claim","label":"LZ high-energy recoil-like event","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"status":"active","summary":"One high-energy nuclear-recoil-like event with limited global significance.","tags":[]},{"aliases":[],"domain":"physical","era":"frontier","frontier":false,"id":"concept.look-elsewhere-corrected-significance","kind":"concept","label":"Look-elsewhere corrected significance","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"status":"active","summary":"Global significance after accounting for scanned models.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.cosmic-ray-boosted-dark-matter","kind":"model","label":"Cosmic-ray-boosted dark matter","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: The cited LZ search considers a scenario in which collisions with Milky Way cosmic rays boost otherwise light dark-matter candidates above a nuclear-recoil detection threshold. It reports no excess above expected backgrounds.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.crdm-direct-search","kind":"method","label":"CRDM direct search","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Search for boosted sub-GeV dark matter in xenon data.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.sub-gev-dark-matter","kind":"concept","label":"Sub-GeV dark matter","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Dark-matter candidates below the conventional WIMP mass range.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.lz-crdm-null-2025","kind":"claim","label":"LZ CRDM null result","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: No excess above background in cited boosted-DM search.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.crdm-nucleon-cross-section","kind":"concept","label":"CRDM-nucleon cross section","sources":[{"id":"arxiv:2503.18158","url":"https://arxiv.org/abs/2503.18158"},{"id":"completion-source.ca2f071869124aba11d9","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2503.18158","url":"https://arxiv.org/abs/2503.18158"}],"status":"reported","summary":"Source-attributed description: Interaction parameter constrained for boosted dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.axion-dark-matter","kind":"model","label":"Axion dark matter","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX analysis tests the hypothesis that axions constitute dark matter, using a strong-field microwave-cavity haloscope and conditional exclusions of DFSZ axions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"instrument.admx","kind":"technology","label":"ADMX","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: Microwave-cavity axion haloscope.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.axion-haloscope","kind":"method","label":"Axion haloscope","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX search uses an axion haloscope consisting of a microwave cavity in a strong magnetic field to test axion dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.admx-run1b","kind":"dataset","label":"ADMX Run 1B","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: 2018 search data covering 2.81-3.31 micro-eV.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.dfsz-axion","kind":"model","label":"DFSZ axion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX Run 1B paper describes the Dine-Fischler-Srednicki-Zhitnitsky (DFSZ) model as a benchmark for axion experiments, characterized by its axion-photon coupling.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.axion-photon-conversion","kind":"concept","label":"Axion-photon conversion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX paper describes inverse Primakoff conversion: a static magnetic field provides a channel for an axion to convert into a photon, whose resulting power can be resonantly enhanced in a microwave cavity. This is the proposed detection mechanism, not an observed axion signal.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.admx-dfsz-exclusion","kind":"claim","label":"ADMX DFSZ exclusion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"status":"reported","summary":"Source-attributed description: The cited ADMX Run 1B analysis excludes DFSZ axions over 680–790 MHz except for mode-crossing gaps, assuming axions supply 100% of the dark-matter density.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.primordial-black-hole-dark-matter","kind":"model","label":"Primordial black-hole dark matter","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: The cited OGLE analysis treats primordial black holes as a possible fraction of Milky Way halo dark matter and conditionally constrains that fraction using microlensing events.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.microlensing-dark-matter","kind":"method","label":"Microlensing dark-matter search","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Uses transient lensing magnification to test compact dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.ogle-five-year-events","kind":"dataset","label":"OGLE five-year microlensing sample","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: 2622 Galactic-bulge microlensing events used for PBH constraints.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.earth-mass-pbh","kind":"concept","label":"Earth-mass primordial black holes","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: The cited analysis finds that an Earth-mass primordial-black-hole population could reproduce six ultrashort OGLE events if its dark-matter fraction is at the percent level. It presents this as a conditional interpretation alongside free-floating planets.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.ogle-pbh-constraint","kind":"claim","label":"OGLE PBH constraint","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Microlensing sample constrains PBH abundance in Earth-Jupiter mass range.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.fuzzy-dark-matter","kind":"theory","label":"Fuzzy dark matter","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Extremely light bosonic dark matter with kiloparsec-scale de Broglie wavelength.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.lyman-alpha-forest-constraint","kind":"method","label":"Lyman-alpha forest constraint","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Uses quasar absorption power spectra to constrain fuzzy dark matter.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.xq100-hires-mike","kind":"dataset","label":"XQ-100 and HIRES/MIKE spectra","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Quasar spectra used in cited fuzzy-DM limits.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.fuzzy-dm-mass","kind":"concept","label":"Fuzzy-DM particle mass","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: The cited Lyman-alpha analysis constrains the particle mass of extremely light bosonic dark-matter models, with lower limits that depend on assumptions about the intergalactic medium's thermal history.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"evidence.fuzzy-dm-lyman-alpha-limit","kind":"claim","label":"Fuzzy-DM Lyman-alpha limit","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"status":"reported","summary":"Source-attributed description: Cited analysis sets lower mass limits under thermal-history assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"theory.self-interacting-dark-matter","kind":"model","label":"Self-interacting dark matter","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.495bd78c68aa1596d994","title":"Public source for atlas completion: https://arxiv.org/abs/1705.02358","url":"https://arxiv.org/abs/1705.02358"}],"status":"reported","summary":"Source-attributed description: The cited sources discuss a family of dark-matter models with interactions beyond gravity. Their predictions and astrophysical constraints depend on the interaction model; no single unified model is asserted here.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.finite-range-dark-force","kind":"concept","label":"Finite-range dark force","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: Intermediate-range self-interaction between dark-matter particles.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"event.bullet-cluster","kind":"concept","label":"Bullet Cluster","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.495bd78c68aa1596d994","title":"Public source for atlas completion: https://arxiv.org/abs/1705.02358","url":"https://arxiv.org/abs/1705.02358"}],"status":"reported","summary":"Source-attributed description: The Bullet Cluster is a merging-cluster system used in the cited studies to investigate dark-matter interactions. The finite-range-force analysis considers possible effects on collision velocity and post-collision separation of dark matter and galaxies.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"method.cluster-offset-constraint","kind":"method","label":"Cluster offset constraint","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: The cited finite-range-force analysis constrains dark-matter models using conditional predictions of altered cluster collision velocity or separation between dark matter and galaxies after collision, along with the stated observational assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dark-matter-self-interaction-cross-section","kind":"concept","label":"Dark-matter self-interaction cross section","sources":[{"id":"arxiv:2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"},{"id":"completion-source.ad17fd11e99deb1b05e1","title":"Public source for atlas completion: https://arxiv.org/html/1705.02358v2","url":"https://arxiv.org/html/1705.02358v2"}],"status":"reported","summary":"Source-attributed description: In the Tulin–Yu review, the dark-matter scattering cross section, often expressed per unit particle mass, is a parameter constrained conditionally by astrophysical observations, including merging clusters. The relevant bounds depend on interaction and velocity assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dark-matter-candidate-space","kind":"concept","label":"Dark-matter candidate space","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.e36a94e93e43baa30cf8","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1703.04683","url":"https://arxiv.org/abs/1703.04683"},{"id":"completion-source.0ba85087913f9ed02a4e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2311.07648","url":"https://arxiv.org/abs/2311.07648"}],"status":"reported","summary":"Source-attributed description: The cited analyses investigate different proposed dark-matter candidates: WIMPs in LZ nuclear-recoil searches, axions in ADMX, primordial black holes in OGLE microlensing, ultralight bosons in Lyman-alpha data, and self-interacting models in cluster studies. This is a comparison of those cited targets, not a complete list of possibilities.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.null-result-constraint","kind":"concept","label":"Null-result constraint","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP search reports no excess above expected backgrounds and places conditional limits on WIMP-nucleon cross sections. A bounded exclusion is the outcome described here.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.complementary-dark-matter-searches","kind":"concept","label":"Complementary dark-matter searches","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"},{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ and ADMX analyses test different proposed dark-matter signals: WIMP-induced xenon nuclear recoils and axion signals in a strong-field microwave cavity, respectively. Their exclusions apply under their separate stated assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.dfsz-axion","kind":"model","label":"DFSZ axion","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.0bceed5f1bb7bb990e81","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2010.06183","url":"https://arxiv.org/abs/2010.06183"},{"id":"completion-source.990be5f93abf672d318e","title":"Public source for atlas completion: https://arxiv.org/pdf/2010.06183","url":"https://arxiv.org/pdf/2010.06183"}],"status":"reported","summary":"Source-attributed description: The ADMX Run 1B paper describes the DFSZ model as an axion-experiment benchmark characterized by axion-photon coupling. This existing record is retained separately pending an explicit identity review of the other DFSZ record.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"concept.ultrashort-microlensing-events","kind":"concept","label":"Ultrashort microlensing events","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"},{"id":"completion-source.a9095d65e7958cc4d9a4","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"status":"reported","summary":"Source-attributed description: Six very short events discussed as PBH or free-floating-planet candidates.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.shoes-cepheid-sn-h0-baseline","kind":"claim","label":"SH0ES baseline Cepheid-SN H0 result","sources":[{"id":"src-shoes-2112.04510","title":"A Comprehensive Measurement of the Local Value of the Hubble Constant with 1 km/s/Mpc Uncertainty from the Hubble Space Telescope and the SH0ES Team","url":"https://arxiv.org/abs/2112.04510"}],"status":"reported","summary":"The SH0ES analysis reports a baseline Cepheid-SN H0 result of 73.04+-1.04 km/s/Mpc, including systematics.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"paper.bose-spin-entanglement-witness-2017","kind":"paper","label":"A Spin Entanglement Witness for Quantum Gravity","sources":[{"id":"src.qg.bose-2017","title":"A Spin Entanglement Witness for Quantum Gravity","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Bose and coauthors reported a proposal for a laboratory test in which gravitational interaction between two micron-size test masses could entangle them, with correlations between one embedded spin in each test mass proposed as the entanglement witness.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.lz-4p2ty-background-consistency","kind":"claim","label":"LZ 4.2 tonne-year WIMP search background consistency","sources":[{"id":"src.dm.lz-2024","title":"Dark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"In the LUX-ZEPLIN 4.2 tonne-year WIMP dark-matter search, the collaboration reported no evidence for an excess over expected backgrounds after removing artificial signal-like events injected to mitigate analyzer bias.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.lz-4p2ty-no-excess-reported","kind":"claim","label":"LZ 4.2 tonne-year WIMP search reported no excess","sources":[{"id":"src-dm-lz-4p2ty","title":"Dark Matter Search Results from 4.2 Tonne-Years of Exposure of the LUX-ZEPLIN (LZ) Experiment","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"In its 4.2 tonne-year WIMP dark-matter search, LUX-ZEPLIN reported no evidence for an excess over expected backgrounds after removal of artificial signal-like events injected to mitigate analyzer bias.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.bose-2017-gravitational-entanglement-proposal-reported","kind":"claim","label":"Bose et al. gravitational entanglement test proposal","sources":[{"id":"src.qg.bose-2017","title":"A Spin Entanglement Witness for Quantum Gravity","url":"https://arxiv.org/abs/1707.06050"}],"status":"reported","summary":"Bose and collaborators proposed a test in which gravitationally induced phase evolution between two micron-size test masses in adjacent matter-wave interferometers could produce detectable entanglement, with the masses separated sufficiently to keep Casimir-Polder forces at bay.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.desi-dr2-flat-lcdm-mild-cmb-tension-reported","kind":"claim","label":"DESI DR2 flat-LambdaCDM fit with mild BAO-CMB tension","sources":[{"id":"src.physical.desi-dr2-dark-energy-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"DESI reported that its DR2 BAO results were well described by a flat LambdaCDM model while the parameters preferred by BAO were in mild 2.3-sigma tension with those determined from the CMB.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.des-y6-weak-evolving-dark-energy-preference-reported","kind":"claim","label":"DES Y6 reported weak preference for evolving dark energy","sources":[{"id":"src.physical.des-y6-dynamical-dark-energy-2026","title":"Constraints on Dynamical Dark Energy from Multiple Probes in the Full Dark Energy Survey","url":"https://arxiv.org/abs/2605.27221"}],"status":"reported","summary":"The DES Collaboration reported that its analyzed probe combinations supported a weak preference for evolving dark energy, with the significance of deviation from a cosmological constant ranging from 2.3 to 3.2 sigma when individual probes were left out.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.desi-dr2-bao-consistency-reported","kind":"claim","label":"DESI DR2 BAO consistency with DR1, SDSS and supernova distances","sources":[{"id":"src.de.desi-dr2-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"The retained DESI DR2 source reports that its BAO results are consistent with DESI DR1 and SDSS, and that their distance-redshift relationship matches recent supernova compilations over the same redshift range.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.who-semen-manual-procedures","kind":"claim","label":"WHO sixth-edition semen examination and processing procedures","sources":[{"id":"src.andrology.who-semen-manual-2021","title":"WHO laboratory manual for the examination and processing of human semen, 6th ed","url":"https://www.who.int/publications/i/item/9789240030787"}],"status":"reported","summary":"The WHO sixth-edition semen manual describes procedures and methods for laboratory examination and processing of human semen.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.who-semen-analysis-clinical-research-uses","kind":"claim","label":"WHO-described clinical and research uses of semen analysis","sources":[{"id":"src.andrology.who-semen-manual-2021","title":"WHO laboratory manual for the examination and processing of human semen, 6th ed","url":"https://www.who.int/publications/i/item/9789240030787"}],"status":"reported","summary":"The WHO semen manual states that semen analysis may be useful for investigating male fertility status and monitoring spermatogenesis during and following male fertility regulation and other interventions, in clinical and research settings.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-varicocelectomy-indications","kind":"claim","label":"AUA/ASRM varicocelectomy recommendation for selected infertile men","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline recommends considering surgical varicocelectomy for men attempting conception who have palpable varicoceles, infertility and abnormal semen parameters, except azoospermic men; it labels this a moderate recommendation supported by Grade B evidence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-microtese-noa-recommendation","kind":"claim","label":"AUA/ASRM microdissection sperm retrieval recommendation in NOA","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline recommends microdissection testicular sperm extraction for men with non-obstructive azoospermia undergoing sperm retrieval, assigning a moderate recommendation with Grade C evidence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-testosterone-monotherapy-fertility","kind":"claim","label":"AUA/ASRM recommendation against testosterone monotherapy when fertility is desired","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline states that testosterone monotherapy should not be prescribed to a male interested in current or future fertility, identifying this recommendation as a clinical principle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-infertility-supplement-evidence-gap","kind":"claim","label":"AUA/ASRM uncertainty regarding fertility supplements","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline reports that clear, reliable evidence is lacking for supplements offered to men attempting conception and describes their value for improving fertility outcomes as questionable.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-sperm-banking-before-gonadotoxic-treatment","kind":"claim","label":"AUA/ASRM sperm banking recommendation before gonadotoxic therapy","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"The AUA/ASRM guideline advises clinicians to encourage sperm banking, preferably multiple specimens when possible, before gonadotoxic therapy or other cancer treatment that may affect male fertility; it classifies this as expert opinion.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.asrm-male-infertility-etiology-knowledge-gap","kind":"claim","label":"AUA/ASRM-reported gaps in understanding male infertility causes","sources":[{"id":"src.andrology.asrm-male-infertility-part2-2021","title":"Diagnosis and Treatment of Infertility in Men: AUA/ASRM Guideline Part II","url":"https://www.asrm.org/practice-guidance/practice-committee-documents/diagnosis-and-treatment-of-infertility-in-men-aua-asrm-guideline-part2/"}],"status":"reported","summary":"In its future-directions discussion, the AUA/ASRM guideline states that the causes of male infertility, including their genetic basis, had been only superficially explained at the time of the guideline.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-hypogonadism-diagnostic-criteria","kind":"claim","label":"Endocrine Society hypogonadism diagnostic criteria","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends diagnosing hypogonadism only in men with compatible symptoms and signs and unequivocally and consistently low serum testosterone concentrations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-repeat-morning-testosterone","kind":"claim","label":"Endocrine Society recommendation for repeat morning testosterone measurement","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends confirming hypogonadism by repeating measurement of morning fasting total testosterone concentrations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-primary-secondary-hypogonadism","kind":"claim","label":"Endocrine Society hormonal evaluation of primary versus secondary hypogonadism","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"For men with hypogonadism, the Endocrine Society guideline recommends measuring serum luteinizing hormone and follicle-stimulating hormone concentrations to distinguish primary testicular from secondary pituitary-hypothalamic hypogonadism.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"claim.andrology.endocrine-no-routine-population-screening","kind":"claim","label":"Endocrine Society recommendation against routine population screening for hypogonadism","sources":[{"id":"src.andrology.endocrine-hypogonadism-2018","title":"Testosterone Therapy for Hypogonadism Guideline Resources","url":"https://www.endocrine.org/clinical-practice-guidelines/testosterone-therapy"}],"status":"reported","summary":"The Endocrine Society guideline recommends against routine screening of men in the general population for hypogonadism.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-geyserite-localities-2017","kind":"claim","label":"Inferred Dresser geyserite at three localities","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"Djokic and colleagues interpret microlaminated siliceous rocks at three Dresser Formation DFc1 localities, approximately 2 km apart, as geyserite.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-sinter-terracettes-2017","kind":"claim","label":"Dresser siliceous ridges interpreted as sinter terracettes","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"At Dresser locality 1S, the authors interpret convex siliceous ridges above stratiform geyserite as resembling mid- to distal-apron hot-spring sinter terracettes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-barite-hot-spring-pools-2017","kind":"claim","label":"Dresser barite masses interpreted as fossil hot-spring pools","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors propose that at least some large Dresser barite masses at hydrothermal vein tips are mineralized remnants of terrestrial hot-spring pools and shallow hydrothermal plumbing.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-bubbles-eps-2017","kind":"claim","label":"Inferred gas-bubble preservation in Dresser microbial EPS","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors interpret roughly 200 µm circular structures in Dresser geyserite as gas bubbles likely trapped in microbial EPS, while leaving thermal-fluid versus metabolic gas origin unresolved.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-palisade-fabric-2017","kind":"claim","label":"Dresser quartz fabric proposed as microbial palisade texture","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"The authors suggest that bedding-normal quartz crystals in Dresser sinter terracettes are analogous to recrystallized microbial palisade fabric formed by silicified filaments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-stromatolites-locality-24s-2017","kind":"claim","label":"Dresser stromatolitic laminates associated with sinter clasts","sources":[{"id":"src.geobiology.dresser-hot-springs-2017","title":"Earliest signs of life on land preserved in ca. 3.5 Ga hot spring deposits","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5436104/"}],"status":"reported","summary":"At Dresser locality 24S, geyserite rip-up clasts occur among domical and conical stromatolitic laminates; their internal laminae and sediment onlap are described as consistent with microbial origin.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-vesicular-glass-pseudofossils-2018","kind":"claim","label":"Dresser microfossil-like vesicles interpreted as volcanic glass","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"A 2018 study interprets spheroidal-to-lenticular Dresser microstructures resembling Archean microfossils as silicified and pyritized vesicular volcanic glass based on size, wall ultrastructure and chemistry.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.dresser-vesicle-organic-carbon-2018","kind":"claim","label":"Kerogenous carbon associated with Dresser volcanic vesicles","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"In the studied Dresser volcanic-glass microstructures, organic kerogenous material accompanies altered glass, with some vesicles lined or filled by carbon and organic-rich laminae enveloping multiple vesicles.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.isolated-volcanic-vesicle-biosignature-caution-2018","kind":"claim","label":"Isolated volcanic vesicles can imitate microfossils","sources":[{"id":"src.geobiology.dresser-volcanogenic-pseudofossils-2018","title":"Volcanogenic Pseudo-Fossils from the ∼3.48 Ga Dresser Formation, Pilbara, Western Australia","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5963881/"}],"status":"reported","summary":"The Dresser pseudo-fossil study cautions that isolated reworked silicified volcanic vesicles can adsorb carbon and become pyritized, complicating early-life identification; nanoscale wall analysis may be required to exclude biogenicity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-nutrient-depletion-dissolution-2018","kind":"claim","label":"Nutrient limitation conditions basalt microbial element release","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"In laboratory incubations of HSDP2 drill-core basalt with Burkholderia fungorum, release of Fe and other major elements exceeded abiotic controls only for nutrient-depleted rock-sample assays.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-glass-stress-feii-release-2018","kind":"claim","label":"Synthetic basalt glass stress and Fe(II) track element release","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"In biotic laboratory colonization assays using synthetic basaltic glasses, dissolved major-element concentrations increased with greater residual stress and Fe(II) content.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.geobiology.basalt-glass-biofilm-redox-stress-2018","kind":"claim","label":"Biofilm coverage differs across synthetic basalt glass types","sources":[{"id":"src.geobiology.microbial-basalt-alteration-2018","title":"Experimental Microbial Alteration and Fe Mobilization From Basaltic Rocks of the ICDP HSDP2 Drill Core, Hilo, Hawaii","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC6010528/"}],"status":"reported","summary":"The 2018 colonization assays reported dense biofilm on stressed Fe(II)-rich basalt glasses, versus sparse colonization on unstressed Fe(III)-rich glasses.","tags":[]},{"aliases":["P000005","VAT 15153"],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.cdli-p000005-metadata","kind":"claim","label":"CDLI P000005 Uruk IV lexical tablet metadata","sources":[{"id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","title":"CDLI Lexical 000002, ex. 172 (P000005)","url":"https://cdli.earth/artifacts/5"}],"status":"reported","summary":"CDLI catalogs P000005 (museum number VAT 15153) as a clay lexical tablet from Uruk (modern Warka), assigned to Uruk IV (ca. 3350–3200 BC), held in the Vorderasiatisches Museum, Berlin, with language undetermined.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.cdli-p000005-transliteration","kind":"claim","label":"CDLI P000005 column-one lexical signs and witness classification","sources":[{"id":"src.assyriology.cdli-uruk-archaic-lexical-p000005","title":"CDLI Lexical 000002, ex. 172 (P000005)","url":"https://cdli.earth/artifacts/5"}],"status":"reported","summary":"CDLI transcribes P000005 obverse column 1 as 1(N01) with ESZDA#, KAB, and DI@t?, marks the remainder broken, and lists the tablet as a witness to the Archaic Lu2 A composite P464118.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.etcsl-ur-iii-ob-catalogues","kind":"claim","label":"Distinct Ur III and Old Babylonian literary catalogue entries in ETCSL","sources":[{"id":"src.assyriology.etcsl-sumerian-literary-corpus","title":"The Electronic Text Corpus of Sumerian Literature: Catalogue of all available compositions and translations","url":"https://etcsl.orinst.ox.ac.uk/cgi-bin/etcsl.cgi?text=all"}],"status":"reported","summary":"ETCSL separately lists an Ur III catalogue from Nibru (N1), an Old Babylonian catalogue from Nibru (N2), and an Old Babylonian catalogue possibly from Zimbir (B1); these listings do not themselves establish a transmission path among the catalogues.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.etcsl-huwawa-versions","kind":"claim","label":"ETCSL listings for Gilgameš and Ḫuwawa Versions A and B","sources":[{"id":"src.assyriology.etcsl-sumerian-literary-corpus","title":"The Electronic Text Corpus of Sumerian Literature: Catalogue of all available compositions and translations","url":"https://etcsl.orinst.ox.ac.uk/cgi-bin/etcsl.cgi?text=all"}],"status":"reported","summary":"ETCSL catalogs Gilgameš and Ḫuwawa as separate Version A (1.8.1.5) and Version B (1.8.1.5.1) entries, each offering transliteration and translation; those entries alone establish no copying direction or relative date.","tags":[]},{"aliases":["SAA 01 001","P224485","NL 039"],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-metadata","kind":"claim","label":"SAA 01 001 royal letter cataloguing and date limits","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"SAAo catalogs SAA 01 001 (CDLI P224485; primary publication NL 039) as a Neo-Assyrian clay administrative letter from the Northwest Palace archive at Nimrud, attributed to Sargon II’s reign (721–705 BC) but explicitly undated, with sender the king and addressee Aššur-šarru-u[ṣur].","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-midas-messenger","kind":"claim","label":"Reported Midas messenger and alliance claim in SAA 01 001","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"In SAA 01 001 the royal writer quotes an earlier report that a messenger [of] Midas brought 14 men of Que previously sent by Urik to Urarṭu and declares that the Phrygian became an ally; these are reported statements in the letter, not independent verification of either event.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-phrygian-contact","kind":"claim","label":"SAA 01 001 instruction to maintain Phrygian messenger contact","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"SAA 01 001 directs its recipient not to withdraw a messenger from the Phrygian, to write amicably, and to monitor news about him; the instruction does not establish that the recipient complied.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.saa001-tabal-strategy","kind":"claim","label":"Threatened two-sided pressure against Tabal in SAA 01 001","sources":[{"id":"src.assyriology.saao-sargon-midas-letter","title":"SAA 01 001. Midas Of Phrygia Seeks Detente (NL 039)","url":"https://oracc.museum.upenn.edu/saao/saa01/P224485"}],"status":"reported","summary":"In SAA 01 001 the royal writer proposes that the recipient pressure the kings of Tabal from one side while the Phrygian does so from the other; the source includes an ellipsis and does not confirm that the plan occurred.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-hezekiah-jerusalem","kind":"claim","label":"Sennacherib 015 claims confinement of Hezekiah in Jerusalem","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In RINAP Sennacherib 015, the first-person royal narrator claims to have confined Hezekiah in Jerusalem like a bird in a cage; this records an inscriptional claim rather than independent proof of the campaign outcome.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-tebilti-river","kind":"claim","label":"Sennacherib 015 claims diversion of the Tebilti River","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In column vi of RINAP Sennacherib 015, the royal narrator reports changing the Tebilti River’s course, repairing erosion damage, and directing its outflow, with several portions of the translation editorially restored.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"claim.assyriology.rinap015-nineveh-orchards-canal","kind":"claim","label":"Sennacherib 015 reports Nineveh orchard plots and a canal route","sources":[{"id":"src.assyriology.rinap-sennacherib-015","title":"Royal Inscriptions of the Neo-Assyrian Period: Sennacherib 015","url":"https://oracc.museum.upenn.edu/rinap/rinap3/Q003489"}],"status":"reported","summary":"In column viii of RINAP Sennacherib 015, the royal narrator reports dividing upstream meadowland into plots of two pānu for Nineveh’s citizens and cutting a canal from near Kisiri toward Nineveh’s plain; parts of the canal construction and route appear in brackets as editorial restorations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.leinster-universal-properties-approaches","kind":"claim","label":"Three presentations of universal properties in Leinster’s textbook","sources":[{"id":"src.category-theory.leinster-basic-category-theory","title":"Basic Category Theory","url":"https://arxiv.org/abs/1612.09375"}],"status":"reported","summary":"Leinster describes his introductory category theory textbook as presenting universal properties through adjoint functors, representable functors, and limits, with a final chapter tying the three approaches together.","tags":["universal properties","adjoint functors","representable functors","limits"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.fong-spivak-seven-applied-sketches","kind":"claim","label":"Seven-sketch application tour of category theory","sources":[{"id":"src.category-theory.fong-spivak-seven-sketches","title":"Seven Sketches in Compositionality: An Invitation to Applied Category Theory","url":"https://arxiv.org/abs/1803.05316"}],"status":"reported","summary":"Fong and Spivak describe seven instructional sketches pairing examples including databases, electric circuits, and dynamical systems with categorical structures including adjoint functors, enriched categories, and toposes.","tags":["applied category theory","compositionality","pedagogy"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-schema-category-instance-functor","kind":"claim","label":"Database schemas as categories and instances as functors","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak proposes a database definition language in which a database schema is a small category and an instance is a set-valued functor on that schema.","tags":["categorical databases","small categories","set-valued functors"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-three-migration-functors","kind":"claim","label":"Three schema-induced data-migration functors","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Within Spivak’s category-and-functor database model, morphisms of schemas induce three data-migration functors that translate instances between schemas in canonical ways.","tags":["schema morphisms","data migration","functors"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-relational-operations","kind":"claim","label":"Data-migration functors parameterize relational operations","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak reports that the three data-migration functors parameterize projections, unions, and joins across all tables simultaneously in the categorical database formulation.","tags":["projections","unions","joins"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-query-expressiveness","kind":"claim","label":"Categorical migration functors as alternatives to query types","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak states that his three data-migration functors can be used in place of conjunctive and disjunctive queries within the paper’s database framework.","tags":["conjunctive queries","disjunctive queries","data migration"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.spivak-programming-types-bridge","kind":"claim","label":"Functorial connection to functional-programming types","sources":[{"id":"src.category-theory.spivak-functorial-data-migration","title":"Functorial Data Migration","url":"https://arxiv.org/abs/1009.1166"}],"status":"reported","summary":"Spivak describes connecting a database to a functional programming language by introducing a functorial connection between the database schema and the language’s category of types.","tags":["functional programming","category of types","database integration"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-gray-generalization-open-problem","kind":"claim","label":"Higher Gray tensor generalization described as open","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber describe the systematic construction of higher-dimensional analogues of the Gray tensor product as an open problem in higher category theory in their 2009-submitted paper.","tags":["higher category theory","Gray tensor product","historical open problem"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-gray-crans-inclusion","kind":"claim","label":"Gray and Crans tensor products included in higher-operad theory","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber state that their resulting theory includes the Gray tensor product of 2-categories and the Crans tensor product of Gray categories.","tags":["globular operads","Gray tensor product","Crans tensor product"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-ekmann-hilton-braided-2cats","kind":"claim","label":"Reported Ekmann-Hilton result for braided monoidal 2-categories","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber report obtaining an “Ekmann-Hilton” result for braided monoidal 2-categories as an application of their higher-operad framework.","tags":["braided monoidal 2-categories","higher operads","Ekmann-Hilton"]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.category-theory.batanin-ainfinity-tensor","kind":"claim","label":"Tensor product construction for A-infinity algebras","sources":[{"id":"src.category-theory.batanin-cisinski-weber-higher-operads","title":"Algebras of higher operads as enriched categories II","url":"https://arxiv.org/abs/0909.4715"}],"status":"reported","summary":"Batanin, Cisinski, and Weber state that their paper gives a construction of a tensor product of A-infinity algebras.","tags":["A-infinity algebras","tensor products","higher operads"]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-controlled-blocking","kind":"claim","label":"NIST controlled blocking","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST describes blocking as holding nuisance factors constant inside homogeneous blocks while varying the factor of interest.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-balanced-blocks","kind":"claim","label":"NIST balanced blocking criterion","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST defines a blocking factor by equal occurrence of each primary-factor level at each nuisance-factor level.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-randomization","kind":"claim","label":"NIST residual nuisance randomization","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST recommends blocking important nuisance variables and randomizing to reduce contamination by remaining nuisance variables.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nist-wafer-example","kind":"claim","label":"NIST hypothetical blocked wafer allocation","sources":[{"id":"src.experimental-method.nist-randomized-block-designs","title":"NIST/SEMATECH e-Handbook of Statistical Methods: 5.3.3.2. Randomized block designs","url":"https://www.itl.nist.gov/div898/handbook/pri/section3/pri332.htm"}],"status":"reported","summary":"NIST illustrates a hypothetical design putting four wafers with different dosages in each of three furnace runs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-preregistration","kind":"claim","label":"Nosek preregistration definition","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. (2018) define analysis preregistration as committing to analytic steps without prior knowledge of outcomes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-forking","kind":"claim","label":"Nosek postdiction diagnosticity warning","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. warn that postdictive NHST analyses may yield p-values of unknown diagnosticity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-prereg-evidence","kind":"claim","label":"Nosek 2018 preregistration evidence limit","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. (2018) report theoretical and correlational support for preregistration but insufficient experimental evidence of a reproducibility advantage.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-preexisting","kind":"claim","label":"Nosek preexisting-data blinding","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. explain that tests of predictions using preexisting data depend on blinded analysis decisions, which face risks when data have already been observed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-decisiontree","kind":"claim","label":"Nosek biased preregistered decision trees","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. warn that preregistered decision trees can still embed bias, such as stopping after achieving p < 0.05.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-all-results","kind":"claim","label":"Nosek complete reporting across studies","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. argue that reporting all planned outcomes matters because preregistration alone cannot eliminate multiple-comparison and selective-reporting problems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-registered-reports","kind":"claim","label":"Nosek Registered Reports workflow","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. describe Registered Reports as pre-outcome methodological peer review with in-principle acceptance, followed by review of execution and adherence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"claim.experimental-method.nosek-holdout","kind":"claim","label":"Nosek exploratory-to-holdout testing","sources":[{"id":"src.experimental-method.nosek-preregistration-2018","title":"The preregistration revolution","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC5856500/"}],"status":"reported","summary":"Nosek et al. describe splitting a dataset, sealing the holdout and preregistering exploration-derived predictions before unsealing it.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-seasonal-syzygies","kind":"claim","label":"Ptolemy's four seasonal lunar-syzygy markers","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.10, Ptolemy proposes using new- and full-moon syzygies preceding the four equinoctial and solstitial starting points to conjecture seasonal conditions for spring, summer, autumn and winter.","tags":["ancient weather prediction","syzygies","seasons"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-fixed-star-appearances","kind":"claim","label":"Ptolemy's daily fixed-star weather intensifications","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.12, Ptolemy attributes day-by-day intensification of weather qualities chiefly to appearances of bright fixed stars at their morning or evening rising or setting relative to the Sun.","tags":["ancient weather prediction","fixed stars","stellar appearances"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.ptolemy-lunar-halo-omens","kind":"claim","label":"Ptolemy's lunar halo weather signs","sources":[{"id":"src.astrometeorology.ptolemy-tetrabiblos-book2-weather","title":"Ptolemy, Tetrabiblos, Book II, Sections 10–13: Seasonal and Detailed Weather Predictions","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Ptolemy/Tetrabiblos/2C%2A.html"}],"status":"reported","summary":"In Tetrabiblos II.13, Ptolemy treats a single clear fading lunar halo as a fair-weather sign and multiple or differently colored and shaped lunar halos as signs of storms or winds.","tags":["ancient weather signs","lunar halos","storm forecasting"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-crescent-horn-signs","kind":"claim","label":"Aratus's early-crescent weather signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"In Phaenomena, Aratus presents the shape and color of the Moon's horns on the third and fourth nights as signs for calm, wind, rain and storms, including directional winds linked to horn orientation.","tags":["ancient weather signs","crescent moon","wind direction"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-manger-ass-stars","kind":"claim","label":"Aratus's Manger and Asses wind-rain signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"Aratus states that a darkening or vanishing Manger in Cancer signals rain or storms, and that relative dimming of the northern or southern Ass star can indicate a southerly or northerly wind.","tags":["Praesepe","the Asses","ancient weather signs"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.aratus-seabird-wind-signs","kind":"claim","label":"Aratus's seabird and shorebird wind signs","sources":[{"id":"src.astrometeorology.aratus-phaenomena-weather-signs","title":"Aratus, Phaenomena: Zodiac Risings and Weather Signs","url":"https://www.theoi.com/Text/AratusPhaenomena.html"}],"status":"reported","summary":"Aratus describes a heron flying landward from the sea with cries, storm petrels turning toward winds, and ducks or gulls beating wings on shore as signs preceding gales.","tags":["animal weather signs","seabirds","winds"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-local-cloud-conditions","kind":"claim","label":"Theophrastus's local mountain-cloud weather guidance","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus says mountainous and coastal terrain affects cloud movements when winds change and advises attending to local conditions and knowledgeable local observers when interpreting weather signs.","tags":["local weather observations","terrain","cloud movement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-red-sky-three-days","kind":"claim","label":"Theophrastus's red-sky rain time window","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus describes a reddish sky before sunrise as a rain sign for the same day or within three days, and a red sunset sky as a similar but less certain sign.","tags":["red sky","rain prediction","ancient weather signs"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.astrometeorology.theophrastus-ant-eggs-rain-signs","kind":"claim","label":"Theophrastus's ant-egg movement omens","sources":[{"id":"src.astrometeorology.theophrastus-weather-signs","title":"Theophrastus, Concerning Weather Signs (De Signis)","url":"https://penelope.uchicago.edu/Thayer/E/Roman/Texts/Theophrastus/De_signis%2A.html"}],"status":"reported","summary":"Theophrastus treats ants moving their eggs from hollow anthills to higher ground as a sign of rain and moving them down as a sign of fair weather.","tags":["ants","animal weather signs","rain prediction"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.cit-plus-cit-plus-plus-timing","kind":"claim","label":"LTEE Cit+ emergence and Cit++ expansion","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) describe emergence of citrate utilization in the Ara−3 LTEE population after 31,500 generations and descendants fully exploiting citrate by 33,000 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-duplication-2p2-fitness","kind":"claim","label":"CitT duplication fitness in early LTEE Cit+ isolate","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 2.2% competitive fitness advantage associated with the citT-activating duplication by comparing early Cit+ isolate ZDB564 with its Cit− revertant ZDB706.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-ancestor-1p0-fitness","kind":"claim","label":"Weak ancestral fitness benefit of aerobic citT activation","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 1.0% fitness advantage for the engineered Cit+ activation in ancestral LTEE strain REL606, with weak statistical support (one-tailed P = 0.033; n = 12).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-anti-potentiation-23clones","kind":"claim","label":"Deleterious citT activation in evolved genetic backgrounds","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) reported that activating citT reduced competitive fitness in 11 of 23 tested evolved pre-Cit+ clones, including five with reductions greater than 20%.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-phylo-negative-group","kind":"claim","label":"Negative Cit+ activation effect in intermediate Ara−3 phylogeny","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) estimated a −5.4% fitness effect (interval −7.2% to −3.6%) for citT activation in the intermediate pre-Cit+ lineage group represented by ZDB425, ZDB458 and ZDB464.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-phylo-positive-group","kind":"claim","label":"Late positive Cit+ activation effect in Ara−3 phylogeny","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) estimated a +2.4% fitness effect (95% interval +1.4% to +3.4%) in a later fully potentiated pre-Cit+ lineage group containing ZDB19 and ZDB13 from as early as 29,000 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.citT-ecological-potentiation-test","kind":"claim","label":"Ecological potentiation test in evolved generation-31,000 Ara−3 population mixture","sources":[{"id":"src.ltee.leon-adaptive-potential-2018","title":"Innovation in an E. coli evolution experiment is contingent on maintaining adaptive potential until competition subsides","url":"https://journals.plos.org/plosgenetics/article?id=10.1371/journal.pgen.1007348"}],"status":"reported","summary":"Leon et al. (2018) measured a 0.9% Cit+ fitness advantage when competing engineered ZDB706 variants at low frequency within the generation-31,000 LTEE population and reported no support for an ecological-potentiation advantage.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-detection-loss","kind":"claim","label":"Loss of detectable Cit− lineage in Ara−3 samples","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) detected the Ara−3 Cit− genotype and phenotype through 43,500 LTEE generations but not in samples from 44,000 generations onward.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-replay-survival","kind":"claim","label":"Cit− persisted through 40 reconstructed evolution replays","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) found Cit− persistence in all 20 replay populations from generation 43,500 and all 20 from generation 40,000 after 500 generations, plus one generation-43,000 replay propagated for 2,500 generations.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-citminus-50k-reinvasion","kind":"claim","label":"Reinvasion of a 50,000-generation Cit+ population","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) observed that a generation-43,000 Cit− clone reinvaded the generation-50,000 Ara−3 population, reaching about 3 × 10^5 cells/mL, roughly an order of magnitude below final Cit− densities in the other treatments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"claim.ltee.turner-extinction-cause-unresolved","kind":"claim","label":"Turner extinction cause unresolved; random-catastrophe proposal","sources":[{"id":"src.ltee.turner-extinction-replay-2015","title":"Replaying Evolution to Test the Cause of Extinction of One Ecotype in an Experimentally Evolved Population","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0142050"}],"status":"reported","summary":"Turner et al. (2015) stated that the Ara−3 Cit− lineage extinction cause remained unknown, rejected their initial ongoing Cit+ adaptation explanation, and proposed an unidentified rare perturbation as a possible cause rather than an observed event.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.liu-relevant-position","kind":"claim","label":"Liu et al. reported position-dependent retrieval in long inputs","sources":[{"id":"src.longcontext.liu-lost-middle-2024","title":"Lost in the Middle: How Language Models Use Long Contexts","url":"https://arxiv.org/abs/2307.03172"}],"status":"reported","summary":"Liu and colleagues report that models evaluated on multi-document question answering and key-value retrieval often performed best when relevant information occurred at the start or end of a long input, with marked degradation for middle positions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.ruler-task-design","kind":"claim","label":"RULER expands needle retrieval to multi-hop and aggregation","sources":[{"id":"src.longcontext.hsieh-ruler-2024","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","url":"https://arxiv.org/abs/2404.06654"}],"status":"reported","summary":"The RULER paper describes a configurable synthetic long-context benchmark extending needle-in-a-haystack retrieval with different needle types and counts, plus multi-hop tracing and aggregation; it evaluates 17 language models on 13 representative tasks.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.ruler-32k-performance","kind":"claim","label":"RULER performance gap at claimed 32K context","sources":[{"id":"src.longcontext.hsieh-ruler-2024","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","url":"https://arxiv.org/abs/2404.06654"}],"status":"reported","summary":"In the RULER authors’ evaluation of 17 long-context models advertised for at least 32K tokens, almost all declined on RULER as input length grew, and the authors reported only about half maintained satisfactory performance at 32K, despite nearly perfect results on vanilla needle retrieval.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.nolima-nonliteral-retrieval","kind":"claim","label":"NoLiMa tests retrieval without literal matching","sources":[{"id":"src.longcontext.modarressi-nolima-2025","title":"NoLiMa: Long-Context Evaluation Beyond Literal Matching","url":"https://proceedings.mlr.press/v267/modarressi25a.html"}],"status":"reported","summary":"The NoLiMa authors introduce a needle-retrieval benchmark in which questions and relevant text have minimal lexical overlap, requiring latent associations rather than straightforward literal matching to locate evidence.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.nolima-32k-degradation","kind":"claim","label":"NoLiMa reported degradation in 13-model evaluation at 32K","sources":[{"id":"src.longcontext.modarressi-nolima-2025","title":"NoLiMa: Long-Context Evaluation Beyond Literal Matching","url":"https://proceedings.mlr.press/v267/modarressi25a.html"}],"status":"reported","summary":"In NoLiMa evaluations of 13 models claiming at least 128K-token support, 11 performed at under half their short-context baseline at 32K; the reported GPT-4o score dropped from 99.3% at short context to 69.7% at 32K.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-v2-design","kind":"claim","label":"LongBench v2 realistic long-context question collection","sources":[{"id":"src.longcontext.bai-longbench-v2-2025","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","url":"https://aclanthology.org/2025.acl-long.183/"}],"status":"reported","summary":"The LongBench v2 authors describe 503 multiple-choice questions with source contexts from 8,000 to 2 million words spanning six categories, including multi-document questions and code-repository understanding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-v2-score-comparison","kind":"claim","label":"LongBench v2 reported expert and model benchmark accuracies","sources":[{"id":"src.longcontext.bai-longbench-v2-2025","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","url":"https://aclanthology.org/2025.acl-long.183/"}],"status":"reported","summary":"The LongBench v2 authors report 53.7% human-expert accuracy with a 15-minute limit, 50.1% for the strongest directly answering model, and 57.7% for o1-preview using longer reasoning under their reported evaluation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.babilong-20-reasoning-tasks","kind":"claim","label":"BABILong distributes reasoning facts through long documents","sources":[{"id":"src.longcontext.kuratov-babilong-2024","title":"BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack","url":"https://arxiv.org/abs/2406.10149"}],"status":"reported","summary":"BABILong introduces 20 tasks involving fact chaining, induction, deduction, counting and lists or sets, designed to require reasoning over facts distributed through very long natural-language documents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.helmet-niah-vs-downstream","kind":"claim","label":"HELMET reported poor predictive validity of simple needle tests","sources":[{"id":"src.longcontext.yen-helmet-2025","title":"HELMET: How to Evaluate Long-Context Language Models Effectively and Thoroughly","url":"https://arxiv.org/abs/2410.02694"}],"status":"reported","summary":"In a study of 59 long-context models, the HELMET authors report that synthetic needle-in-a-haystack scores do not reliably predict downstream performance and that their different application-centered task categories have low correlations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.infinitybench-over100k","kind":"claim","label":"InfinityBench longer-than-100K-token benchmark design","sources":[{"id":"src.longcontext.zhang-infinitybench-2024","title":"∞Bench: Extending Long Context Evaluation Beyond 100K Tokens","url":"https://aclanthology.org/2024.acl-long.814/"}],"status":"reported","summary":"The 2024 InfinityBench paper describes a benchmark with average data length above 100K tokens and a mix of synthetic and realistic English and Chinese tasks intended to require long-distance dependencies rather than retrieval of isolated passages.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longbench-original-design","kind":"claim","label":"Original LongBench multilingual multitask composition","sources":[{"id":"src.longcontext.bai-longbench-2024","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","url":"https://aclanthology.org/2024.acl-long.172/"}],"status":"reported","summary":"The original LongBench authors report 21 datasets in six task categories in English and Chinese, with average input lengths of 6,711 English words and 13,386 Chinese characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.longcontext.longcite-citation-pipeline","kind":"claim","label":"LongCite sentence-level citation generation workflow","sources":[{"id":"src.longcontext.zhang-longcite-2024","title":"LongCite: Enabling LLMs to Generate Fine-grained Citations in Long-context QA","url":"https://arxiv.org/abs/2409.02897"}],"status":"reported","summary":"The LongCite authors propose a Coarse-to-Fine pipeline producing long-context question-answer pairs with sentence-level citations and report using its LongCite-45k training data to train LongCite-8B and LongCite-9B.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-data-splittings-2026","kind":"claim","label":"JUNO 207-day atmospheric mass-splitting fits","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO analysis reported 8,294 inverse-beta-decay candidates in 207.2 live days at an average 52.5 km reactor baseline and obtained different fitted atmospheric mass splittings under normal and inverted ordering using a Daya Bay constraint.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-solar-parameters-2026","kind":"claim","label":"JUNO solar oscillation-parameter estimates","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO analysis reported sin²θ12=0.3036±0.0064 and Δm21²=(7.388±0.078)×10^-5 eV², with stated relative precisions of 2.1% and 1.1%, respectively.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.juno-accelerator-ordering-indication-2026","kind":"claim","label":"JUNO combined ordering indication and Bayes factor","sources":[{"id":"src.neutrino.juno-ordering-207d-2026","title":"Measurement of Neutrino Oscillation Parameters at JUNO and Indication of the Neutrino Mass Ordering","url":"https://arxiv.org/abs/2609.37895"}],"status":"reported","summary":"The September 2026 JUNO collaboration reported that incorporating long-baseline accelerator constraints on Δm31² favored normal over inverted neutrino mass ordering with one-sided significance of at least 2.1σ across CP-violating phases and a Bayesian Bayes factor of 10.18.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.katrin-endpoint-bound-259d","kind":"claim","label":"KATRIN effective electron-antineutrino mass bound","sources":[{"id":"src.neutrino.katrin-259days-mass-2024","title":"Direct neutrino-mass measurement based on 259 days of KATRIN data","url":"https://arxiv.org/abs/2406.13516"}],"status":"reported","summary":"KATRIN reported a fitted squared effective electron-antineutrino mass of -0.14 (+0.13/-0.15) eV² from five tritium beta-decay campaigns and an effective-mass upper limit of 0.45 eV at 90% confidence using 259 measurement days and 36 million electrons.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.kamlandzen-half-life-2024","kind":"claim","label":"KamLAND-Zen xenon-136 neutrinoless-decay half-life limit","sources":[{"id":"src.neutrino.kamlandzen-complete-2024","title":"Search for Majorana Neutrinos with the Complete KamLAND-Zen Dataset","url":"https://arxiv.org/abs/2406.11438"}],"status":"reported","summary":"The KamLAND-Zen full-dataset search with 745 kg enriched xenon and 2.1 tonne-years of xenon-136 exposure, combined with its previous phase, reported a 90%-confidence lower bound on the neutrinoless double-beta half-life of 3.8×10^26 years.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.kamlandzen-majorana-translation-2024","kind":"claim","label":"KamLAND-Zen nuclear-model-dependent effective Majorana bound","sources":[{"id":"src.neutrino.kamlandzen-complete-2024","title":"Search for Majorana Neutrinos with the Complete KamLAND-Zen Dataset","url":"https://arxiv.org/abs/2406.11438"}],"status":"reported","summary":"The KamLAND-Zen full-dataset report translated its neutrinoless xenon-136 double-beta half-life constraint into effective Majorana neutrino-mass upper limits ranging from 28 to 122 meV using phenomenological nuclear matrix-element calculations.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.planck-bao-mass-sum-2018","kind":"claim","label":"Planck 2018 plus BAO neutrino mass-sum bound","sources":[{"id":"src.neutrino.planck-2018-cosmological-parameters","title":"Planck 2018 results. VI. Cosmological parameters","url":"https://arxiv.org/abs/1807.06209"}],"status":"reported","summary":"The Planck 2018 cosmological-parameter analysis reported Σmν<0.12 eV as a 95% upper limit when combined with baryon acoustic oscillation data in its base spatially flat ΛCDM framework.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.desi-dr2-dark-energy-conditional-mass-2025","kind":"claim","label":"DESI DR2 neutrino sum bound changes with dark-energy model","sources":[{"id":"src.neutrino.desi-dr2-bao-cosmology-2025","title":"DESI DR2 Results II: Measurements of Baryon Acoustic Oscillations and Cosmological Constraints","url":"https://arxiv.org/abs/2503.14738"}],"status":"reported","summary":"The DESI DR2 analysis reported a 95% upper limit Σmν<0.064 eV for DESI BAO plus CMB under ΛCDM, versus Σmν<0.16 eV under a time-evolving w0wa dark-energy model using the same stated combination.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.desi-dr2-mass-prior-boundary-tension-2025","kind":"claim","label":"DESI DR2 neutrino mass tension and boundary-sensitive inference","sources":[{"id":"src.neutrino.desi-dr2-neutrino-constraints-2025","title":"Constraints on Neutrino Physics from DESI DR2 BAO and DR1 Full Shape","url":"https://arxiv.org/abs/2503.14744"}],"status":"reported","summary":"The DESI DR2 neutrino-constraints analysis reported a Feldman-Cousins 95% bound Σmν<0.053 eV after correcting for the zero-mass boundary, below the oscillation-inferred lower limit, and a separate effective-mass parametrization yielding 3σ tension under its analysis assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.planck-prior-ordering-dependence-2019","kind":"claim","label":"Planck 2018 BAO mass bounds change under hierarchy priors","sources":[{"id":"src.neutrino.planck-ordering-prior-analysis-2019","title":"Updated results on neutrino mass and mass hierarchy from cosmology with Planck 2018 likelihoods","url":"https://arxiv.org/abs/1907.12598"}],"status":"reported","summary":"A Bayesian reanalysis using Planck 2018 CMB plus BOSS DR12, MGS and 6dFGS BAO data reported 95%-confidence neutrino mass-sum limits of 0.12 eV (degenerate masses), 0.15 eV (normal ordering) and 0.17 eV (inverted ordering), attributing their differences to mass-sum priors.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.isocurvature-mass-limits-2026","kind":"claim","label":"DESI and CMB neutrino constraints with isocurvature allowed","sources":[{"id":"src.neutrino.desi-isocurvature-mass-priors-2026","title":"Constraints on the Sum of Neutrino Masses from ACT DR6 and DESI DR2 Considering Isocurvature Initial Conditions","url":"https://arxiv.org/abs/2606.17994"}],"status":"reported","summary":"A 2026 joint CMB, DESI DR2 and supernova analysis reported that allowing a neutrino-density isocurvature mode shifted its 95% neutrino mass-sum limits from 0.052 to 0.057 eV under ΛCDM and 0.111 to 0.115 eV under dynamical dark energy, without detecting the isocurvature mode.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.neutrino.isocurvature-hierarchy-prior-2026","kind":"claim","label":"Hierarchy-aware prior relaxes cosmological mass-sum bound","sources":[{"id":"src.neutrino.desi-isocurvature-mass-priors-2026","title":"Constraints on the Sum of Neutrino Masses from ACT DR6 and DESI DR2 Considering Isocurvature Initial Conditions","url":"https://arxiv.org/abs/2606.17994"}],"status":"reported","summary":"The 2026 cosmological isocurvature analysis reported that its purely adiabatic ΛCDM upper limit of 0.052 eV lay below the oscillation-implied normal-ordering minimum of 0.05878 eV because of a statistical prior extending to zero, while a hierarchy-informed prior raised the reported upper limit to 0.092 eV.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-continuous-mixed-foraging-model-2012","kind":"model","label":"Kurvers spatial producer-scrounger evolutionary simulation","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"Kurvers and colleagues modeled group foraging with a spatially explicit genetic algorithm whose simulated agents could alternate between producing and scrounging; the exploration level and the probability of scrounging were distinct, evolving continuous traits each ranging from 0 to 1.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-patch-density-exploration-scrounging-2012","kind":"claim","label":"Foraging patch density shifts exploration and scrounging in simulation","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers producer-scrounger simulations, increasing food-patch density favored higher exploration; it also reduced scrounging at low or intermediate patch richness, but this reduction disappeared at high patch richness.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-patch-richness-scrounging-2012","kind":"claim","label":"Food patch richness increases modeled scrounging","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers producer-scrounger simulations, richer food patches increased evolved scrounging propensities among both fast and slow explorers, while patch richness showed no effect on evolved exploration.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.kurvers-no-within-environment-personality-polymorphism-2012","kind":"claim","label":"No stable explorer-type polymorphism within simulated environments","sources":[{"id":"src.behavioral-ecology.kurvers-producer-scrounger-2012","title":"The Effect of Exploration on the Use of Producer-Scrounger Tactics","url":"https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0049400"}],"status":"reported","summary":"In the Kurvers evolutionary simulations, populations within a given environmental run approached one exploration optimum rather than retaining a stable coexistence of distinct explorer personality types.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-teaching-sample-denominators-2008","kind":"claim","label":"Thornton meerkat provisioning and monitoring sample sizes","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"Thornton analyzed 1,070 scorpion feeds by 347 meerkat helpers to 339 pups from 137 litters in 15 groups for prey-provisioning state, and recorded monitoring times for 6,148 feeds by 300 helpers to 244 pups from 65 litters in 13 groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-scorpion-provisioning-pup-age-2008","kind":"claim","label":"Meerkat pup age predicts intact versus disabled scorpion feeds","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s wild meerkat scorpion-feeding analysis, older pups were less likely to receive dead or disabled scorpions and more likely to receive intact scorpions, adjusting for significant modeled covariates.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-helper-age-versus-experience-2008","kind":"claim","label":"Helper age versus previous pup-care experience in scorpion provisioning","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s meerkat scorpion-provisioning analysis, older eligible helpers were more likely to give pups intact scorpions, whereas prior experience with earlier foraging litters showed no statistically significant association after controlling for helper age.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-monitoring-prey-and-pup-age-2008","kind":"claim","label":"Meerkat pup monitoring varies with prey movement size and pup age","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"For 6,148 observed meerkat pup feeds, helpers spent longer monitoring pups when provisioned prey was moving or larger and spent less time monitoring as pups grew older.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"claim.behavioral-ecology.thornton-meerkat-monitoring-group-rainfall-context-2008","kind":"claim","label":"Meerkat monitoring duration declines with nearby helpers and rain","sources":[{"id":"src.behavioral-ecology.thornton-meerkat-teaching-2008","title":"Variation in contributions to teaching by meerkats","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC2587792/"}],"status":"reported","summary":"In Thornton’s meerkat feeding observations, pup monitoring duration decreased with larger litter size, higher recent rainfall, and the presence of another helper within two metres.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.balacuo-resistive-onset-1986","kind":"claim","label":"Ba-La-Cu-O: tentative 30 K onset (1986)","sources":[{"id":"source.bednorz-ibm-abstract","url":"https://research.ibm.com/publications/possible-high-tlessinfgreaterclessinfgreater-superconductivity-in-the-ba-la-cu-o-system"}],"status":"reported","summary":"Bednorz and Mueller reported an abrupt resistivity decrease of up to three orders of magnitude in multiphase, oxygen-deficient polycrystalline Ba-La-Cu-O samples, with the highest onset in the 30 K range and suppression at high current density; they described this as reminiscent of percolative superconductivity.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybcuo-80-93k-1987","kind":"claim","label":"Mixed-phase Y-Ba-Cu-O: 80–93 K transition (1987)","sources":[{"id":"source.wu-nasa-catalogue","url":"https://ntrs.nasa.gov/citations/19870046673"}],"status":"reported","summary":"NASA’s catalogue summary of Wu et al. reports a stable, reproducible superconductivity transition between 80 and 93 K in a mixed-phase Y-Ba-Cu-O compound system at ambient pressure, maintained in a liquid-nitrogen Dewar.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybco-grain-boundary-orientation-1988","kind":"claim","label":"YBCO grain-boundary orientation limits (1988)","sources":[{"id":"source.dimos-ibm-abstract","url":"https://research.ibm.com/publications/orientation-dependence-of-grain-boundary-critical-currents-in-yba2cu3o7-bicrystals"}],"status":"reported","summary":"Dimos et al. measured grain-boundary critical current densities as a function of basal-plane misorientation in YBCO bicrystals and concluded that strong texture both normal to and within the basal plane is important for very high critical currents in pure polycrystalline samples.","tags":[]},{"aliases":[],"domain":"engineering","era":"twentieth","frontier":false,"id":"engineering.biaxially-textured-ybco-tapes-1996","kind":"method","label":"Biaxially textured metal substrates for YBCO tapes (1996)","sources":[{"id":"source.goyal-rabits-1996","url":"https://api.crossref.org/works/10.1063/1.117489"}],"status":"reported","summary":"Goyal et al. reported a route using industrially scalable thermomechanical texturing of flexible metal substrates followed by epitaxial buffer layers and YBa2Cu3Ox films; the deposited films carried critical currents at 77 K in zero field and had field dependencies similar to epitaxial films on single-crystal ceramic substrates.","tags":[]},{"aliases":[],"domain":"physical","era":"twentieth","frontier":false,"id":"physical.ybco-tricrystal-half-flux-1994","kind":"experiment","label":"YBCO tricrystal half-flux evidence (1994)","sources":[{"id":"source.tsuei-ibm-abstract","url":"https://research.ibm.com/publications/pairing-symmetry-and-flux-quantization-in-a-tricrystal-superconducting-ring-of-yba2cu3o7-d"}],"status":"reported","summary":"Tsuei et al. used scanning SQUID microscopy at 4.2 K to observe spontaneous half-flux-quantum magnetization in a YBa2Cu3O7-delta ring with three grain-boundary Josephson junctions, but not in the two-junction rings; the authors reported consistency with d-wave pairing symmetry.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.bzo-ybco-in-field-current-2004","kind":"claim","label":"BaZrO3 additions enhance YBCO in-field current (2004)","sources":[{"id":"source.macmanus-driscoll-bzo","url":"https://arxiv.org/pdf/cond-mat/0406087"}],"status":"reported","summary":"MacManus-Driscoll et al. reported that BaZrO3 additions to pulsed-laser-deposited YBCO films improved thickness-accounted in-field critical current densities by about 1.5–2 times over roughly 1–5 T and about 5 times at 7 T in the studied single-crystal and IBAD-MgO substrate samples; the transport study used 75.5 K and associated the enhancement with stronger vortex pinning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.ybco-y2o3-high-field-wire-2021","kind":"technology","label":"Industrial YBCO/Y2O3 tape for high-field fusion magnets","sources":[{"id":"source.molodyk-mit-paper","url":"https://eng.s-innovations.ru/upload/iblock/4c4/4c4a3119a03bbb5b8113924ad1324714.pdf"}],"status":"reported","summary":"Molodyk et al. reported over 300 km of 4 mm-wide YBCO wire manufactured in nine months, with most delivered to CFS. In tested B-parallel-c samples with a 40 micrometre substrate and 5 micrometre copper stabilizer per side, engineering current density exceeded 1000 A/mm² at 20 K and 20 T and 2000 A/mm² at 4.2 K and 20 T; the formulation used Y2O3 nanoparticles without c-axis-correlated nanocolumnar defects.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.tfmc-nint-stack-in-plate","kind":"technology","label":"SPARC TFMC: NINT stack-in-plate magnet","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. described the built TFMC as a no-insulation, no-twist REBCO stack-in-plate magnet using 270 km of tape, weighing 10058 kg, with 16 single-pancake modules and two termination plates. REBCO stacks occupy spiral plate channels, with single-pass supercritical-helium coolant channels on the other side; vacuum-pressure solder impregnation provides mechanical protection and thermal/electrical connectivity.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.tfmc-20-1t-demonstration","kind":"experiment","label":"SPARC TFMC: 20.1 T magnet demonstration","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported TFMC reaching 20.1 T peak field on the conductor at 40.5 kA terminal current, with 815 kN/m Lorentz loading on the REBCO stacks and almost 1 GPa stress accommodated by the structural case.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"engineering.tfmc-demountable-nanohm-joints","kind":"technology","label":"SPARC TFMC: demountable nanohm joints","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported fifteen internal demountable pancake-to-pancake TFMC joints operating with resistance in the 0.5–2.0 nanohm range at 20 K and magnetic fields up to 12 T.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.tfmc-open-circuit-quench-damage","kind":"experiment","label":"SPARC TFMC: deliberate quench caused local damage","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. reported localized thermal damage following an intentional open-circuit TFMC quench at 31.5 kA terminal current. The TFMC was deliberately not optimized for quench resiliency, so this experiment assessed passive self-protection rather than demonstrating damage-free protection for fusion-scale NINT coils.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"physical.high-field-rebco-fusion-pathway","kind":"model","label":"High-field REBCO fusion pathway: proposal and qualification","sources":[{"id":"source.hartwig-tfmc-preprint","url":"https://arxiv.org/pdf/2308.12301v1"}],"status":"reported","summary":"Hartwig et al. describe a proposed fusion pathway using REBCO superconducting toroidal-field coils above 20 T peak field on the coil, corresponding to 8–12 T in the plasma center. The model-coil program qualifies representative-scale magnet technology for this pathway; stand-alone magnet qualification is distinct from demonstrated fusion electricity generation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.alce-metrics","kind":"claim","label":"ALCE evaluates fluency, correctness and citation quality","sources":[{"id":"src.citation.alce-gao-2023","title":"Enabling Large Language Models to Generate Text with Citations","url":"https://aclanthology.org/2023.emnlp-main.398/"}],"status":"reported","summary":"Gao et al. (2023) report that ALCE uses automatic metrics for fluency, correctness, and citation quality and that these metrics correlate strongly with human judgments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.alce-eli5","kind":"claim","label":"ALCE ELI5 evaluation found incomplete citation support","sources":[{"id":"src.citation.alce-gao-2023","title":"Enabling Large Language Models to Generate Text with Citations","url":"https://aclanthology.org/2023.emnlp-main.398/"}],"status":"reported","summary":"Gao et al. (2023) report that even the best models in their ELI5 evaluation lacked complete citation support 50% of the time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextcite-method","kind":"claim","label":"ContextCite contextual attribution method","sources":[{"id":"src.citation.contextcite-cohenwang-2024","title":"ContextCite: Attributing Model Generation to Context","url":"https://papers.nips.cc/paper_files/paper/2024/hash/adbea136219b64db96a9941e4249a857-Abstract-Conference.html"}],"status":"reported","summary":"Cohen-Wang et al. (2024) introduce ContextCite as a scalable method for attributing generated statements to supplied context, designed to operate on top of existing language models.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.finegrained-labels","kind":"claim","label":"Three-level evaluation of citation support","sources":[{"id":"src.citation.finegrained-zhang-2024","title":"Towards Fine-Grained Citation Evaluation in Generated Text: A Comparative Analysis of Faithfulness Metrics","url":"https://aclanthology.org/2024.inlg-main.35/"}],"status":"reported","summary":"Zhang et al. (2024) propose evaluating citation faithfulness metrics against three support levels: full, partial, and no support.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.finegrained-metrics","kind":"claim","label":"No consistently best fine-grained citation faithfulness metric","sources":[{"id":"src.citation.finegrained-zhang-2024","title":"Towards Fine-Grained Citation Evaluation in Generated Text: A Comparative Analysis of Faithfulness Metrics","url":"https://aclanthology.org/2024.inlg-main.35/"}],"status":"reported","summary":"Zhang et al. (2024) report that no single citation-faithfulness metric consistently performs best across their fine-grained evaluations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextprior-task","kind":"claim","label":"Context-prior augmented citation evaluation dimensions","sources":[{"id":"src.citation.contextprior-shen-2025","title":"Transparentize the Internal and External Knowledge Utilization in LLMs with Trustworthy Citation","url":"https://aclanthology.org/2025.findings-acl.919/"}],"status":"reported","summary":"Shen et al. (2025) introduce a citation-generation task considering external context and internal model knowledge, evaluated with five metrics addressing helpfulness, citation faithfulness, and trustworthiness.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.mirage-attribution","kind":"claim","label":"MIRAGE saliency-based answer attribution","sources":[{"id":"src.citation.mirage-qi-2024","title":"Model Internals-based Answer Attribution for Trustworthy Retrieval-Augmented Generation","url":"https://aclanthology.org/2024.emnlp-main.347/"}],"status":"reported","summary":"Qi et al. (2024) describe MIRAGE as identifying context-sensitive answer tokens and attributing them to retrieved documents using saliency methods.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.counterfactual-eval","kind":"claim","label":"Fluent counterfactuals for attribution-faithfulness evaluation","sources":[{"id":"src.citation.counterfactual-kamahi-2024","title":"Counterfactuals As a Means for Evaluating Faithfulness of Attribution Methods in Autoregressive Language Models","url":"https://aclanthology.org/2024.blackboxnlp-1.28/"}],"status":"reported","summary":"Kamahi et al. (2024) argue that removing or corrupting input tokens creates out-of-distribution inputs for autoregressive language models and propose fluent in-distribution counterfactuals for evaluating attribution methods.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.claimbench-limits","kind":"claim","label":"CLAIM-BENCH observed scientific claim-evidence reasoning limitations","sources":[{"id":"src.citation.claimbench-javaji-2025","title":"Can AI Validate Science? Benchmarking LLMs on Claim →Evidence Reasoning in AI Papers","url":"https://aclanthology.org/2025.ijcnlp-long.127/"}],"status":"reported","summary":"Javaji et al. (2025) report substantial limitations in processing scientific claim-evidence relationships when evaluating six LLMs on more than 300 claim-evidence pairs across multiple research domains.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.claimbench-prompting","kind":"claim","label":"Multi-pass prompting tradeoff in CLAIM-BENCH","sources":[{"id":"src.citation.claimbench-javaji-2025","title":"Can AI Validate Science? Benchmarking LLMs on Claim →Evidence Reasoning in AI Papers","url":"https://aclanthology.org/2025.ijcnlp-long.127/"}],"status":"reported","summary":"Javaji et al. (2025) report that three-pass and one-by-one prompting improve LLM claim-to-evidence linking in their evaluations, with increased computational cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.faithfulrag-conflict","kind":"claim","label":"FaithfulRAG models context-prior conflicts at fact level","sources":[{"id":"src.citation.faithfulrag-zhang-2025","title":"FaithfulRAG: Fact-Level Conflict Modeling for Context-Faithful Retrieval-Augmented Generation","url":"https://aclanthology.org/2025.acl-long.1062/"}],"status":"reported","summary":"Zhang et al. (2025) propose FaithfulRAG, which identifies fact-level conflicts between retrieved context and model knowledge and uses a self-thinking process before generating responses.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"claim.citation.contextdpo-gain","kind":"claim","label":"Reported Context-DPO context-faithfulness improvements","sources":[{"id":"src.citation.contextdpo-bi-2025","title":"Context-DPO: Aligning Language Models for Context-Faithfulness","url":"https://aclanthology.org/2025.findings-acl.536/"}],"status":"reported","summary":"Bi et al. (2025) report Context-DPO context-faithfulness improvements of 35% to 280% on popular open-source models in their experiments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-historical-depletion-2007","kind":"claim","label":"High Plains well-derived groundwater depletion through 2007","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report approximately 330 km³ of High Plains groundwater depletion from predevelopment in the 1950s through 2007, based on groundwater levels from 3,600 wells.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cv-historical-depletion-2003","kind":"claim","label":"Central Valley model-derived historical groundwater depletion","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report an estimated 140 km³ of Central Valley groundwater depletion from the 1860s through 2003, comprising 60 km³ before 1961 and 80 km³ during 1962–2003, based on groundwater models.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.groundwater-residual-method","kind":"claim","label":"GRACE groundwater inference requires subtraction of other water stores","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues describe deriving groundwater storage changes from GRACE total water storage by subtracting snow, reservoir surface-water and modeled soil-moisture storage changes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-satellite-well-correlation","kind":"claim","label":"High Plains GRACE-well groundwater estimates correlation","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report r² values of 0.7–0.8 between GRACE-derived groundwater storage changes and estimates from monitoring approximately 1,000 High Plains wells.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cv-drought-depletion-2006-2010","kind":"claim","label":"GRACE-derived Central Valley groundwater depletion during 2006–2010","sources":[{"id":"src.grace.aquifers.scanlon-2012-sustainability","title":"Groundwater depletion and sustainability of irrigation in the US High Plains and Central Valley","url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC3386121/"}],"status":"reported","summary":"Scanlon and colleagues report GRACE-derived Central Valley groundwater depletion of 6–8 km³ per year, totaling 24–34 km³, between April 2006 and March 2010.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-storage-2019","kind":"claim","label":"USGS High Plains recoverable groundwater storage through 2019","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"McGuire and Strauch estimate that the High Plains aquifer contained approximately 2.91 billion acre-feet of recoverable groundwater in 2019, representing a decline of 286.4 million acre-feet, about 10%, since predevelopment.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-recovery-2017-2019","kind":"claim","label":"High Plains short-period groundwater recovery, 2017–2019","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"McGuire and Strauch report a High Plains aquifer area-weighted average water-level rise of 0.1 foot and an estimated increase of 1.6 million acre-feet of recoverable groundwater storage during 2017–2019.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-usgs-specific-yield","kind":"claim","label":"High Plains specific-yield assumptions in recoverable storage estimates","sources":[{"id":"src.grace.highplains.usgs-mcguire-strauch-2024","title":"Water-level and recoverable water in storage changes, High Plains Aquifer, predevelopment to 2019 and 2017 to 2019","url":"https://pubs.usgs.gov/publication/sir20235143/full"}],"status":"reported","summary":"The USGS High Plains report gives an area-weighted mean specific yield of 15.1% for the aquifer excluding areas of little or no saturated thickness, with state means ranging from 8.1% in Wyoming to 18.5% in Oklahoma.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.jpl-mascon-gridding-v02","kind":"claim","label":"JPL GRACE mascon native and mapped grid distinction","sources":[{"id":"src.grace.jpl-rl06m-v02-documentation","title":"JPL GRACE and GRACE-FO Mascon RL06M version 02 Datasets Released","url":"https://podaac.jpl.nasa.gov/highlights/JPL_GRACE_and_GRACE-FO_Mascon_RL06M_v2_Datasets_Released"}],"status":"reported","summary":"NASA JPL describes its GRACE/GRACE-FO RL06M v02 solution as 4,551 relatively independent surface-mass estimates derived using an equal-area 3-degree mascon grid, subsequently mapped onto a 0.5-degree latitude-longitude grid.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.cvhm2-simulation-period","kind":"claim","label":"Central Valley Hydrologic Model version 2 simulation period","sources":[{"id":"src.grace.centralvalley.usgs-cvhm2-model-data","title":"MODFLOW-OWHM Used to Characterize the Groundwater Flow System of the Central Valley","url":"https://www.usgs.gov/data/modflow-owhm-used-characterize-groundwater-flow-system-central-valley"}],"status":"reported","summary":"USGS describes Central Valley Hydrologic Model version 2 as using MODFLOW-OWHM to simulate groundwater and surface-water flow, irrigation, land subsidence and associated processes monthly from April 1961 through September 2019.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"claim.grace.hp-bayesian-downscaling-2026","kind":"claim","label":"Bayesian joint inference from GRACE and High Plains groundwater wells","sources":[{"id":"src.grace.highplains.pakrashi-2026-downscaling","title":"Estimating water levels in the High Plains Aquifer by synthesizing satellite data with groundwater well observations","url":"https://arxiv.org/abs/2609.05753"}],"status":"reported","summary":"Pakrashi, Haran and Zuidema describe combining GRACE satellite measurements, groundwater-well observations and covariates using a Bayesian hierarchical framework to estimate High Plains groundwater variations over 2002–2022.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.confidence-sequences-uniform-coverage","kind":"claim","label":"Howard et al. confidence sequences over unbounded horizons","sources":[{"id":"src.anytime.howard-confidence-sequences-2021","title":"Time-uniform, nonparametric, nonasymptotic confidence sequences","url":"https://arxiv.org/abs/1810.08240"}],"status":"reported","summary":"Howard et al. report constructing shrinking confidence sequences with time-uniform, nonasymptotic coverage under nonparametric conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.vovk-wang-averaging-evalues","kind":"claim","label":"Vovk and Wang e-value averaging","sources":[{"id":"src.anytime.vovk-wang-e-calibration-2021","title":"E-values: Calibration, combination, and applications","url":"https://arxiv.org/abs/1912.06116"}],"status":"reported","summary":"Vovk and Wang report that multiple e-values for one hypothesis can be merged by averaging them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.xu-ramdas-elond-arbitrary-dependence","kind":"claim","label":"Xu and Ramdas e-LOND dependence-robust online FDR","sources":[{"id":"src.anytime.xu-ramdas-elond-2024","title":"Online multiple testing with e-values","url":"https://proceedings.mlr.press/v238/xu24a.html"}],"status":"reported","summary":"Xu and Ramdas report e-LOND control of online false discovery rate under arbitrary, possibly unknown, dependence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.waudbysmith-bounded-means-betting","kind":"claim","label":"Waudby-Smith and Ramdas bounded-mean betting inference","sources":[{"id":"src.anytime.waudbysmith-betting-means-2023","title":"Estimating means of bounded random variables by betting","url":"https://arxiv.org/abs/2010.09686"}],"status":"reported","summary":"Waudby-Smith and Ramdas report martingale-based confidence intervals and time-uniform sequences for bounded means, including sampling without replacement and adaptation to unknown variance.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.choe-ramdas-coarse-fine-incompatibility","kind":"claim","label":"Choe and Ramdas filtration-mismatch warning","sources":[{"id":"src.anytime.choe-ramdas-filtrations-2026","title":"Combining Evidence Across Filtrations","url":"https://arxiv.org/abs/2402.09698"}],"status":"reported","summary":"Choe and Ramdas report that e-process validity in a coarser filtration does not automatically hold in a finer filtration, preventing unadjusted averaging across them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.choe-ramdas-adjust-then-combine","kind":"claim","label":"Choe and Ramdas adjust-then-combine procedure","sources":[{"id":"src.anytime.choe-ramdas-filtrations-2026","title":"Combining Evidence Across Filtrations","url":"https://arxiv.org/abs/2402.09698"}],"status":"reported","summary":"Choe and Ramdas report an adjust-then-combine procedure lifting e-processes across filtrations, with a logarithmic validity-recovery cost.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.dwork-adaptive-holdout-validation","kind":"claim","label":"Dwork et al. reusable holdout for adaptive validation","sources":[{"id":"src.anytime.dwork-adaptive-generalization-2015","title":"Generalization in Adaptive Data Analysis and Holdout Reuse","url":"https://arxiv.org/abs/1506.02629"}],"status":"reported","summary":"Dwork et al. report that adaptive holdout reuse risks overfitting and propose an algorithm to validate many adaptively chosen hypotheses while avoiding that overfitting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.lee-lasso-postselection-conditioning","kind":"claim","label":"Lee et al. selection-conditional inference for lasso","sources":[{"id":"src.anytime.lee-post-selection-2016","title":"Exact post-selection inference, with application to the lasso","url":"https://arxiv.org/abs/1311.6238"}],"status":"reported","summary":"Lee et al. report selection-conditional inference for lasso-selected coefficients, including confidence intervals and tests.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"claim.anytime.ramdas-admissible-martingale-necessity","kind":"claim","label":"Ramdas et al. necessity of martingales for admissible anytime-valid inference","sources":[{"id":"src.anytime.ramdas-admissible-2022","title":"Admissible anytime-valid sequential inference must rely on nonnegative martingales","url":"https://arxiv.org/abs/2009.03167"}],"status":"reported","summary":"Ramdas et al. report that all admissible confidence sequences, p-processes and e-processes rely on nonnegative martingales under their formal admissibility definition.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.happy-code-flm-experimental-test","kind":"claim","label":"FLM formula test in a trapped-ion HaPPY code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report experimental confirmation of the Faulkner-Lewkowycz-Maldacena formula in a trapped-ion implementation of the HaPPY holographic code.","tags":["holographic-codes","quantum-simulation","entanglement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.happy-code-magic-entropic-precursors","kind":"claim","label":"Entropic precursors of emergent gravity in a modified holographic code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report observing entropic precursors expected of emergent gravity after introducing non-stabilizerness into their holographic-code model.","tags":["holographic-codes","non-stabilizerness","emergent-gravity"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.holographic-code-wormhole-entropic-behavior","kind":"claim","label":"Wormhole-like entropic behavior in a quantum code","sources":[{"id":"place-physical-002","title":"Observation of gravity-like signatures in holographic codes on a quantum computer","url":"https://arxiv.org/abs/2607.12047"}],"status":"reported","summary":"The authors report constructing and measuring a quantum code whose entropic behavior resembles that of a highly quantum wormhole.","tags":["holographic-codes","quantum-wormholes","entanglement"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.grb090510-energy-separated-photon-arrivals","kind":"claim","label":"Nearly simultaneous arrival of widely separated photon energies from GRB 090510","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA reports that two photons from GRB 090510, differing in energy by a factor of one million, arrived at Fermi nearly simultaneously after traveling more than 7.3 billion light-years.","tags":["GRB-090510","Fermi-LAT","Lorentz-invariance"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.grb090510-energy-dispersion-constraint","kind":"claim","label":"GRB 090510 constraint on energy-dependent light speed","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA reports that GRB 090510 placed a strong constraint on variation of light speed with photon energy, with high- and low-energy gamma rays arriving within one second after traveling approximately seven billion light-years.","tags":["GRB-090510","Lorentz-invariance","photon-dispersion"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"claim.fermi-gbm-detection-coverage","kind":"claim","label":"Fermi GBM detector coverage and burst detection rate","sources":[{"id":"place-physical-005","title":"Fermi Gamma-ray Space Telescope: Gamma-ray Bursts","url":"https://fermi.gsfc.nasa.gov/science/eteu/grbs/"}],"status":"reported","summary":"NASA describes the Fermi Gamma-ray Burst Monitor as having 14 detectors covering the unobscured sky, detecting approximately 240 gamma-ray bursts per year across an energy range of 8 keV to 40 MeV.","tags":["Fermi-GBM","gamma-ray-bursts","instrumentation"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.algorithm","kind":"concept","label":"algorithm","sources":[{"id":"nist-dads.algorithm","title":"NIST Dictionary of Algorithms and Data Structures: algorithm","url":"https://xlinux.nist.gov/dads/HTML/algorithm.html"}],"status":"reported","summary":"NIST DADS defines algorithm as: A computable set of steps to achieve a desired result.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.datastructure","kind":"concept","label":"data structure","sources":[{"id":"nist-dads.datastructure","title":"NIST Dictionary of Algorithms and Data Structures: dataStructure","url":"https://xlinux.nist.gov/dads/HTML/dataStructure.html"}],"status":"reported","summary":"NIST DADS defines data structure as: An organization of information, usually in memory, for better algorithm efficiency , such as queue , stack , linked list , heap , dictionary , and tree , or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.search","kind":"method","label":"search","sources":[{"id":"nist-dads.search","title":"NIST Dictionary of Algorithms and Data Structures: search","url":"https://xlinux.nist.gov/dads/HTML/search.html"}],"status":"reported","summary":"NIST DADS defines search as: Look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sort","kind":"method","label":"sort","sources":[{"id":"nist-dads.sort","title":"NIST Dictionary of Algorithms and Data Structures: sort","url":"https://xlinux.nist.gov/dads/HTML/sort.html"}],"status":"reported","summary":"NIST DADS defines sort as: Arrange items in a predetermined order. There are dozens of algorithms, the choice of which depends on factors such as the number of items relative to working memory, knowledge of the orderliness of the items or the range of the keys , the cost of comparing keys vs. the cost of moving items, etc. Most algorithms can be implemented as an in-place sort , and many can be implemented so they are stable , too. Formal Definition: The sort operation may be defined in terms of an initial array, S, of N items and a final array, S′, as follows. S′ i ≤ S′ i+1 , 0 < i < N (the items are in order) and S′ is a permutation of S.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.binarysearch","kind":"method","label":"binary search","sources":[{"id":"nist-dads.binarysearch","title":"NIST Dictionary of Algorithms and Data Structures: binarySearch","url":"https://xlinux.nist.gov/dads/HTML/binarySearch.html"}],"status":"reported","summary":"NIST DADS defines binary search as: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.linearsearch","kind":"method","label":"linear search","sources":[{"id":"nist-dads.linearsearch","title":"NIST Dictionary of Algorithms and Data Structures: linearSearch","url":"https://xlinux.nist.gov/dads/HTML/linearSearch.html"}],"status":"reported","summary":"NIST DADS defines linear search as: Search an array or list by checking items one at a time. Also known as sequential search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.mergesort","kind":"method","label":"merge sort","sources":[{"id":"nist-dads.mergesort","title":"NIST Dictionary of Algorithms and Data Structures: mergesort","url":"https://xlinux.nist.gov/dads/HTML/mergesort.html"}],"status":"reported","summary":"NIST DADS defines merge sort as: A sort algorithm that splits the items to be sorted into two groups, recursively sorts each group, and merges them into a final, sorted sequence. Run time is Θ (n log n).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quicksort","kind":"method","label":"quicksort","sources":[{"id":"nist-dads.quicksort","title":"NIST Dictionary of Algorithms and Data Structures: quicksort","url":"https://xlinux.nist.gov/dads/HTML/quicksort.html"}],"status":"reported","summary":"NIST DADS defines quicksort as: Pick an element from the array (the pivot), partition the remaining elements into those greater than and less than this pivot, and recursively sort the partitions. There are many variants of the basic scheme above: to select the pivot, to partition the array, to stop the recursion or switch to another algorithm for small partitions, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heapsort","kind":"method","label":"heapsort","sources":[{"id":"nist-dads.heapsort","title":"NIST Dictionary of Algorithms and Data Structures: heapSort","url":"https://xlinux.nist.gov/dads/HTML/heapSort.html"}],"status":"reported","summary":"NIST DADS defines heapsort as: A sort algorithm that builds a heap , then repeatedly extracts the maximum item. Run time is O(n log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.insertionsort","kind":"method","label":"insertion sort","sources":[{"id":"nist-dads.insertionsort","title":"NIST Dictionary of Algorithms and Data Structures: insertionSort","url":"https://xlinux.nist.gov/dads/HTML/insertionSort.html"}],"status":"reported","summary":"NIST DADS defines insertion sort as: Sort by repeatedly taking the next item and inserting it into the final data structure in its proper order with respect to items already inserted. Run time is O(n 2 ) because of moves. Also known as linear insertion sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.selectionsort","kind":"method","label":"selection sort","sources":[{"id":"nist-dads.selectionsort","title":"NIST Dictionary of Algorithms and Data Structures: selectionSort","url":"https://xlinux.nist.gov/dads/HTML/selectionSort.html"}],"status":"reported","summary":"NIST DADS defines selection sort as: A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. The run time is Θ(n²) , where n is the number of elements. The number of swaps is O(n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bubblesort","kind":"method","label":"bubble sort","sources":[{"id":"nist-dads.bubblesort","title":"NIST Dictionary of Algorithms and Data Structures: bubblesort","url":"https://xlinux.nist.gov/dads/HTML/bubblesort.html"}],"status":"reported","summary":"NIST DADS defines bubble sort as: Sort by comparing each adjacent pair of items in a list in turn, swapping the items if necessary, and repeating the pass through the list until no swaps are done. Also known as sinking sort, exchange sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.countingsort","kind":"method","label":"counting sort","sources":[{"id":"nist-dads.countingsort","title":"NIST Dictionary of Algorithms and Data Structures: countingsort","url":"https://xlinux.nist.gov/dads/HTML/countingsort.html"}],"status":"reported","summary":"NIST DADS defines counting sort as: A 2-pass sort algorithm that is efficient when the number of distinct keys is small compared to the number of items. The first pass counts the occurrences of each key in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding keys. The second pass puts each item in its final place according to the auxiliary entry for that key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.radixsort","kind":"method","label":"radix sort","sources":[{"id":"nist-dads.radixsort","title":"NIST Dictionary of Algorithms and Data Structures: radixsort","url":"https://xlinux.nist.gov/dads/HTML/radixsort.html"}],"status":"reported","summary":"NIST DADS defines radix sort as: A multiple pass distribution sort algorithm that distributes each item to a bucket according to part of the item's key beginning with the least significant part of the key. After each pass, items are collected from the buckets, keeping the items in order, then redistributed according to the next most significant part of the key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bucketsort","kind":"method","label":"bucket sort","sources":[{"id":"nist-dads.bucketsort","title":"NIST Dictionary of Algorithms and Data Structures: bucketsort","url":"https://xlinux.nist.gov/dads/HTML/bucketsort.html"}],"status":"reported","summary":"NIST DADS defines bucket sort as: A distribution sort where input elements are initially distributed to several buckets based on an interpolation of the element's key . Each bucket is sorted if necessary, and the buckets' contents are concatenated. Also known as bin sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bintree","kind":"concept","label":"bintree","sources":[{"id":"nist-dads.bintree","title":"NIST Dictionary of Algorithms and Data Structures: bintree","url":"https://xlinux.nist.gov/dads/HTML/bintree.html"}],"status":"reported","summary":"NIST DADS defines bintree as: A regular decomposition k-d tree for region data.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarysearchtree","kind":"concept","label":"binary search tree","sources":[{"id":"nist-dads.binarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: binarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/binarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines binary search tree as: A binary tree where every node's left subtree has keys less than the node's key, and every right subtree has keys greater than the node's key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.avltree","kind":"concept","label":"AVL tree","sources":[{"id":"nist-dads.avltree","title":"NIST Dictionary of Algorithms and Data Structures: avltree","url":"https://xlinux.nist.gov/dads/HTML/avltree.html"}],"status":"reported","summary":"NIST DADS defines AVL tree as: A balanced binary search tree where the height of the two subtrees ( children ) of a node differs by at most one. Look-up, insertion, and deletion are O(log n) , where n is the number of nodes in the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.redblack","kind":"concept","label":"red-black tree","sources":[{"id":"nist-dads.redblack","title":"NIST Dictionary of Algorithms and Data Structures: redblack","url":"https://xlinux.nist.gov/dads/HTML/redblack.html"}],"status":"reported","summary":"NIST DADS defines red-black tree as: A nearly-balanced tree that uses an extra bit per node to maintain balance. No leaf is more than twice as far from the root as any other. Formal Definition: A red-black tree with n internal nodes has height at most 2log 2 (n+1). Also known as symmetric binary B-tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heap","kind":"concept","label":"heap","sources":[{"id":"nist-dads.heap","title":"NIST Dictionary of Algorithms and Data Structures: heap","url":"https://xlinux.nist.gov/dads/HTML/heap.html"}],"status":"reported","summary":"NIST DADS defines heap as: A complete tree where every node has a key more extreme (greater or less) than or equal to the key of its parent . Usually understood to be a binary heap .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.queue","kind":"concept","label":"queue","sources":[{"id":"nist-dads.queue","title":"NIST Dictionary of Algorithms and Data Structures: queue","url":"https://xlinux.nist.gov/dads/HTML/queue.html"}],"status":"reported","summary":"NIST DADS defines queue as: A collection of items in which only the earliest added item may be accessed. Basic operations are add (to the tail ) or enqueue and delete (from the head ) or dequeue. Delete returns the item removed. Also known as \"first-in, first-out\" or FIFO. Formal Definition: It is convenient to define delete or dequeue in terms of remove and a new operation, front. The operations new(), add(v, Q), front(Q), and remove(Q) may be defined with axiomatic semantics as follows. new() returns a queue front(add(v, new())) = v remove(add(v, new())) = new() front(add(v, add(w, Q))) = front(add(w, Q)) remove(add(v, add(w, Q))) = add(v, remove(add(w, Q))) where Q is a queue and v and w are values. Also known as FIFO.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stack","kind":"concept","label":"stack","sources":[{"id":"nist-dads.stack","title":"NIST Dictionary of Algorithms and Data Structures: stack","url":"https://xlinux.nist.gov/dads/HTML/stack.html"}],"status":"reported","summary":"NIST DADS defines stack as: A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and isEmpty are available, too. Also known as \"last-in, first-out\" or LIFO. Formal Definition: The operations new(), push(v, S), top(S), and popoff(S) may be defined with axiomatic semantics as follows. new() returns a stack popoff(push(v, S)) = S top(push(v, S)) = v where S is a stack and v is a value. The pop operation is a combination of top, to return the top value, and popoff, to remove the top value. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(push(v, S)) = false Also known as LIFO.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linkedlist","kind":"concept","label":"linked list","sources":[{"id":"nist-dads.linkedlist","title":"NIST Dictionary of Algorithms and Data Structures: linkedList","url":"https://xlinux.nist.gov/dads/HTML/linkedList.html"}],"status":"reported","summary":"NIST DADS defines linked list as: A list implemented by each item having a link to the next item. Also known as singly linked list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.doublylinkedlist","kind":"concept","label":"doubly linked list","sources":[{"id":"nist-dads.doublylinkedlist","title":"NIST Dictionary of Algorithms and Data Structures: doublyLinkedList","url":"https://xlinux.nist.gov/dads/HTML/doublyLinkedList.html"}],"status":"reported","summary":"NIST DADS defines doubly linked list as: A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time. Also known as two-way linked list, symmetrically linked list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graph","kind":"concept","label":"graph","sources":[{"id":"nist-dads.graph","title":"NIST Dictionary of Algorithms and Data Structures: graph","url":"https://xlinux.nist.gov/dads/HTML/graph.html"}],"status":"reported","summary":"NIST DADS defines graph as: A set of items connected by edges . Each item is called a vertex or node . Formally, a graph is a set of vertices and a binary relation between vertices, adjacency. Formal Definition: A graph G can be defined as a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph is undirected, the adjacency relation defined by the edges is symmetric , or E ⊆ {{u,v} | u, v ∈ V} (sets of vertices rather than ordered pairs). If the graph does not allow self-loops , adjacency is irreflexive .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dijkstraalgo","kind":"method","label":"Dijkstra's algorithm","sources":[{"id":"nist-dads.dijkstraalgo","title":"NIST Dictionary of Algorithms and Data Structures: dijkstraalgo","url":"https://xlinux.nist.gov/dads/HTML/dijkstraalgo.html"}],"status":"reported","summary":"NIST DADS defines Dijkstra's algorithm as: An algorithm to find the shortest paths from a single source vertex to all other vertices in a weighted, directed graph . All weights must be nonnegative.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bellmanford","kind":"method","label":"Bellman-Ford algorithm","sources":[{"id":"nist-dads.bellmanford","title":"NIST Dictionary of Algorithms and Data Structures: bellmanford","url":"https://xlinux.nist.gov/dads/HTML/bellmanford.html"}],"status":"reported","summary":"NIST DADS defines Bellman-Ford algorithm as: An efficient algorithm to solve the single-source shortest-path problem . Weights may be negative. The algorithm initializes the distance to the source vertex to 0 and all other vertices to ∞. It then does V-1 passes (V is the number of vertices) over all edges relaxing, or updating, the distance to the destination of each edge. Finally it checks each edge again to detect negative weight cycles , in which case it returns false. The time complexity is O(VE) , where E is the number of edges. Also known as Ford-Bellman.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologicalsort","kind":"concept","label":"topological sort","sources":[{"id":"nist-dads.topologicalsort","title":"NIST Dictionary of Algorithms and Data Structures: topologicalSort","url":"https://xlinux.nist.gov/dads/HTML/topologicalSort.html"}],"status":"reported","summary":"NIST DADS defines topological sort as: To arrange items when some pairs of items have no comparison, that is, according to a partial order .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumspanningtree","kind":"concept","label":"minimum spanning tree","sources":[{"id":"nist-dads.minimumspanningtree","title":"NIST Dictionary of Algorithms and Data Structures: minimumSpanningTree","url":"https://xlinux.nist.gov/dads/HTML/minimumSpanningTree.html"}],"status":"reported","summary":"NIST DADS defines minimum spanning tree as: A minimum-weight tree in a weighted graph which contains all of the graph's vertices . Also known as MST, shortest spanning tree, SST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.primjarnik","kind":"method","label":"Prim-Jarnik algorithm","sources":[{"id":"nist-dads.primjarnik","title":"NIST Dictionary of Algorithms and Data Structures: primJarnik","url":"https://xlinux.nist.gov/dads/HTML/primJarnik.html"}],"status":"reported","summary":"NIST DADS defines Prim-Jarnik algorithm as: Compute a minimum spanning tree by beginning with any vertex as the current tree . At each step add a least edge between any vertex not in the tree and any vertex in the tree. Continue until all vertices have been added.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.divideandconquer","kind":"method","label":"divide and conquer","sources":[{"id":"nist-dads.divideandconquer","title":"NIST Dictionary of Algorithms and Data Structures: divideAndConquer","url":"https://xlinux.nist.gov/dads/HTML/divideAndConquer.html"}],"status":"reported","summary":"NIST DADS defines divide and conquer as: Solve a problem, either directly because solving that instance is easy (typically, because the instance is small) or by dividing it into two or more smaller instances. Each of these smaller instances is recursively solved, and the solutions are combined to produce a solution for the original instance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.backtrack","kind":"method","label":"backtracking","sources":[{"id":"nist-dads.backtrack","title":"NIST Dictionary of Algorithms and Data Structures: backtrack","url":"https://xlinux.nist.gov/dads/HTML/backtrack.html"}],"status":"reported","summary":"NIST DADS defines backtracking as: Find a solution by trying one of several choices. If the choice proves incorrect, computation backtracks or restarts at the point of choice and tries another choice. It is often convenient to maintain choice points and alternate choices using recursion .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trie","kind":"concept","label":"trie","sources":[{"id":"nist-dads.trie","title":"NIST Dictionary of Algorithms and Data Structures: trie","url":"https://xlinux.nist.gov/dads/HTML/trie.html"}],"status":"reported","summary":"NIST DADS defines trie as: A tree for storing strings in which there is one node for every common prefix . The strings are stored in extra leaf nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.btree","kind":"concept","label":"B-tree","sources":[{"id":"nist-dads.btree","title":"NIST Dictionary of Algorithms and Data Structures: btree","url":"https://xlinux.nist.gov/dads/HTML/btree.html"}],"status":"reported","summary":"NIST DADS defines B-tree as: A balanced search tree in which every node has between ⌈ m/2⌉ and m children , where m>1 is a fixed integer. m is the order . The root may have as few as 2 children. This is a good structure if much of the tree is in slow memory (disk), since the height , and hence the number of accesses, can be kept small, say one or two, by picking a large m. Also known as balanced multiway tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitestatemachine","kind":"concept","label":"finite state machine","sources":[{"id":"nist-dads.finitestatemachine","title":"NIST Dictionary of Algorithms and Data Structures: finiteStateMachine","url":"https://xlinux.nist.gov/dads/HTML/finiteStateMachine.html"}],"status":"reported","summary":"NIST DADS defines finite state machine as: A model of computation consisting of a set of states , a start state , an input alphabet , and a transition function that maps input symbols and current states to a next state . Computation begins in the start state with an input string. It changes to new states depending on the transition function. There are many variants, for instance, machines having actions (outputs) associated with transitions ( Mealy machine ) or states ( Moore machine ), multiple start states, transitions conditioned on no input symbol (a null) or more than one transition for a given symbol and state ( nondeterministic finite state machine ), one or more states designated as accepting states ( recognizer ), etc. Also known as finite state automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedbitr","kind":"concept","label":"balanced binary tree","sources":[{"id":"nist-dads.balancedbitr","title":"NIST Dictionary of Algorithms and Data Structures: balancedbitr","url":"https://xlinux.nist.gov/dads/HTML/balancedbitr.html"}],"status":"reported","summary":"NIST DADS defines balanced binary tree as: A binary tree where no leaf is more than a certain amount farther from the root than any other. After inserting or deleting a node , the tree may rebalanced with rotations .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.priorityque","kind":"concept","label":"priority queue","sources":[{"id":"nist-dads.priorityque","title":"NIST Dictionary of Algorithms and Data Structures: priorityque","url":"https://xlinux.nist.gov/dads/HTML/priorityque.html"}],"status":"reported","summary":"NIST DADS defines priority queue as: An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues ( meld ), delete an arbitrary item, and increase the priority of a item (decrease-key). Formal Definition: The operations new(), insert(v, PQ), find-minimum or min(PQ), and delete-minimum or dm(PQ) may be defined with axiomatic semantics as follows. new() returns a priority queue min(insert(v, new())) = v dm(insert(v, new())) = new() min(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then v else min(insert(w, PQ)) dm(insert(v, insert(w, PQ))) = if priority(v) < priority(min(insert(w, PQ))) then insert(w, PQ) else insert(v, dm(insert(w, PQ))) where PQ is a priority queue, v and w are items, and priority(v) is the priority of item v.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashtab","kind":"concept","label":"hash table","sources":[{"id":"nist-dads.hashtab","title":"NIST Dictionary of Algorithms and Data Structures: hashtab","url":"https://xlinux.nist.gov/dads/HTML/hashtab.html"}],"status":"reported","summary":"NIST DADS defines hash table as: A dictionary in which keys are mapped to array positions by hash functions . Having the keys of more than one item map to the same position is called a collision . There are many collision resolution schemes , but they may be divided into open addressing , chaining , and keeping one special overflow area. Perfect hashing avoids collisions, but may be time-consuming to create. Also known as scatter storage.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.breadthfirst","kind":"method","label":"breadth-first search","sources":[{"id":"nist-dads.breadthfirst","title":"NIST Dictionary of Algorithms and Data Structures: breadthfirst","url":"https://xlinux.nist.gov/dads/HTML/breadthfirst.html"}],"status":"reported","summary":"NIST DADS defines breadth-first search as: Any search algorithm that considers neighbors of a vertex , that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.depthfirst","kind":"method","label":"depth-first search","sources":[{"id":"nist-dads.depthfirst","title":"NIST Dictionary of Algorithms and Data Structures: depthfirst","url":"https://xlinux.nist.gov/dads/HTML/depthfirst.html"}],"status":"reported","summary":"NIST DADS defines depth-first search as: (1) Any search algorithm that considers outgoing edges ( children ) of a vertex before any of the vertex's siblings , that is, outgoing edges of the vertex's predecessor in the search. Extremes are searched first. This is easily implemented with recursion . (2) An algorithm that marks all vertices in a directed graph in the order they are discovered and finished, partitioning the graph into a forest . Also known as DFS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.kruskalsalgo","kind":"method","label":"Kruskal's algorithm","sources":[{"id":"nist-dads.kruskalsalgo","title":"NIST Dictionary of Algorithms and Data Structures: kruskalsalgo","url":"https://xlinux.nist.gov/dads/HTML/kruskalsalgo.html"}],"status":"reported","summary":"NIST DADS defines Kruskal's algorithm as: An algorithm for computing a minimum spanning tree . It maintains a set of partial minimum spanning trees, and repeatedly adds the shortest edge in the graph whose vertices are in different partial minimum spanning trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dynamicprog","kind":"method","label":"dynamic programming","sources":[{"id":"nist-dads.dynamicprog","title":"NIST Dictionary of Algorithms and Data Structures: dynamicprog","url":"https://xlinux.nist.gov/dads/HTML/dynamicprog.html"}],"status":"reported","summary":"NIST DADS defines dynamic programming as: Solve an optimization problem by caching subproblem solutions ( memoization ) rather than recomputing them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greedyalgo","kind":"method","label":"greedy algorithm","sources":[{"id":"nist-dads.greedyalgo","title":"NIST Dictionary of Algorithms and Data Structures: greedyalgo","url":"https://xlinux.nist.gov/dads/HTML/greedyalgo.html"}],"status":"reported","summary":"NIST DADS defines greedy algorithm as: An algorithm that always takes the best immediate, or local, solution while finding an answer. Greedy algorithms find the overall, or globally, optimal solution for some optimization problems , but may find less-than-optimal solutions for some instances of other problems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarytree","kind":"concept","label":"binary tree","sources":[{"id":"nist-dads.binarytree","title":"NIST Dictionary of Algorithms and Data Structures: binarytree","url":"https://xlinux.nist.gov/dads/HTML/binarytree.html"}],"status":"reported","summary":"NIST DADS defines binary tree as: A tree with at most two children for each node . Formal Definition: A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree. Also known as dyadic tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directedgraph","kind":"concept","label":"directed graph","sources":[{"id":"nist-dads.directedgraph","title":"NIST Dictionary of Algorithms and Data Structures: directedGraph","url":"https://xlinux.nist.gov/dads/HTML/directedGraph.html"}],"status":"reported","summary":"NIST DADS defines directed graph as: A graph whose edges are ordered pairs of vertices . That is, each edge can be followed from one vertex to another vertex. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {(u,v) | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {(u,v) | u, v ∈ V ∧ u ≠ v}. Also known as digraph, oriented graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determfinitstatemach","kind":"concept","label":"deterministic finite state machine","sources":[{"id":"nist-dads.determfinitstatemach","title":"NIST Dictionary of Algorithms and Data Structures: determFinitStateMach","url":"https://xlinux.nist.gov/dads/HTML/determFinitStateMach.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite state machine as: A finite state machine with at most one transition for each symbol and state . Also known as DFA, deterministic finite automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermfinitestatemach","kind":"concept","label":"nondeterministic finite state machine","sources":[{"id":"nist-dads.nondetermfinitestatemach","title":"NIST Dictionary of Algorithms and Data Structures: nondetermFiniteStateMach","url":"https://xlinux.nist.gov/dads/HTML/nondetermFiniteStateMach.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic finite state machine as: A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states . The transition function also may map the null symbol (no input symbol needed) and states to next states. Also known as NFA, nondeterministic finite automaton.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.array","kind":"concept","label":"array","sources":[{"id":"nist-dads.array","title":"NIST Dictionary of Algorithms and Data Structures: array","url":"https://xlinux.nist.gov/dads/HTML/array.html"}],"status":"reported","summary":"NIST DADS defines array as: An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and get(i, A), where i is a numeric index, v is a value, and A is an array. The operations may be defined with axiomatic semantics as follows. new() returns an array get(i, set(i, v, A)) = v get(i, set(j, v, A)) = get(i, A) if i ≠ j Compare this with a dictionary using integers as keys. If the contents of a new array are set to some implicit initial value v i , we could add the following rule for get. get(i, new()) = v i Typically arrays have a fixed size and use either 0-based indexing or 1-based indexing . Fixed initial size and 0-based indexing may incorporated as follows. new(s) returns an array, which has a size s size(new(s)) = s size(set(i, v, A)) = size(A) get(i, set(i, v, A)) = v if 0 ≤ i < size(A) get(i, set(j, v, A)) = get(i, A) if i ≠ j One-based or other indexing may be defined similarly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.list","kind":"concept","label":"list","sources":[{"id":"nist-dads.list","title":"NIST Dictionary of Algorithms and Data Structures: list","url":"https://xlinux.nist.gov/dads/HTML/list.html"}],"status":"reported","summary":"NIST DADS defines list as: A collection of items accessible one after another beginning at the head and ending at the tail .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.set","kind":"concept","label":"set","sources":[{"id":"nist-dads.set","title":"NIST Dictionary of Algorithms and Data Structures: set","url":"https://xlinux.nist.gov/dads/HTML/set.html"}],"status":"reported","summary":"NIST DADS defines set as: An unordered collection of values where each value occurs at most once. A group of elements with three properties: (1) all elements belong to a universe , (2) either each element is a member of the set or it is not, and (3) the elements are unordered. Formal Definition: As an abstract data type , a set has a single query function, isIn(v, S), which tells whether an element is a member of the set or not, and two modifier functions, add(v, S) and remove(v, S). These may be defined with axiomatic semantics as follows. new() returns a set isIn(v, new()) = false isIn(v, add(v, S)) = true isIn(v, add(u, S)) = isIn(v , S) if v ≠ u remove(v, new()) = new() remove(v, add(v, S)) = remove(v, S) remove(v, add(u, S)) = add(u, remove(v, S)) if v ≠ u where S is a set and u and v are elements. The predicate isEmpty(S) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, S)) = false","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tree","kind":"concept","label":"tree","sources":[{"id":"nist-dads.tree","title":"NIST Dictionary of Algorithms and Data Structures: tree","url":"https://xlinux.nist.gov/dads/HTML/tree.html"}],"status":"reported","summary":"NIST DADS defines tree as: (1) A data structure accessed beginning at the root node. Each node is either a leaf or an internal node . An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings . Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A connected , undirected , acyclic graph . It is rooted and ordered unless otherwise specified. Thanks to Joshua O'Madadhain ( [email protected] ) for the figure, 6 October 2005. Formal Definition: (1) A tree is either empty (no nodes), or a root and zero or more subtrees. The subtrees are ordered.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.root","kind":"concept","label":"root","sources":[{"id":"nist-dads.root","title":"NIST Dictionary of Algorithms and Data Structures: root","url":"https://xlinux.nist.gov/dads/HTML/root.html"}],"status":"reported","summary":"NIST DADS defines root as: The distinguished initial or fundamental item of a tree . The only item which has no parent . See the figure at tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leaf","kind":"concept","label":"leaf","sources":[{"id":"nist-dads.leaf","title":"NIST Dictionary of Algorithms and Data Structures: leaf","url":"https://xlinux.nist.gov/dads/HTML/leaf.html"}],"status":"reported","summary":"NIST DADS defines leaf as: A node in a tree without any children . See the figure at tree . Also known as external node, terminal node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edge","kind":"concept","label":"edge","sources":[{"id":"nist-dads.edge","title":"NIST Dictionary of Algorithms and Data Structures: edge","url":"https://xlinux.nist.gov/dads/HTML/edge.html"}],"status":"reported","summary":"NIST DADS defines edge as: A connection between two vertices of a graph . In a weighted graph , each edge has an number, called a \"weight\". In a directed graph , an edge goes from one vertex, the source , to another, the target , and hence makes connection in only one direction. Also known as arc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertex","kind":"concept","label":"vertex","sources":[{"id":"nist-dads.vertex","title":"NIST Dictionary of Algorithms and Data Structures: vertex","url":"https://xlinux.nist.gov/dads/HTML/vertex.html"}],"status":"reported","summary":"NIST DADS defines vertex as: An item in a graph . Sometimes referred to as a node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.path","kind":"concept","label":"path","sources":[{"id":"nist-dads.path","title":"NIST Dictionary of Algorithms and Data Structures: path","url":"https://xlinux.nist.gov/dads/HTML/path.html"}],"status":"reported","summary":"NIST DADS defines path as: A list of vertices of a graph where each vertex has an edge between it and the next vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cycle","kind":"concept","label":"cycle","sources":[{"id":"nist-dads.cycle","title":"NIST Dictionary of Algorithms and Data Structures: cycle","url":"https://xlinux.nist.gov/dads/HTML/cycle.html"}],"status":"reported","summary":"NIST DADS defines cycle as: A path that starts and ends at the same vertex and includes at least one edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weightedgraph","kind":"concept","label":"weighted graph","sources":[{"id":"nist-dads.weightedgraph","title":"NIST Dictionary of Algorithms and Data Structures: weightedGraph","url":"https://xlinux.nist.gov/dads/HTML/weightedGraph.html"}],"status":"reported","summary":"NIST DADS defines weighted graph as: A graph having a weight, or number, associated with each edge . Some algorithms require all weights to be nonnegative, integral, positive, etc. Also known as edge-weighted graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.connectedgraph","kind":"concept","label":"connected graph","sources":[{"id":"nist-dads.connectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: connectedGraph","url":"https://xlinux.nist.gov/dads/HTML/connectedGraph.html"}],"status":"reported","summary":"NIST DADS defines connected graph as: An undirected graph that has a path between every pair of vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completegraph","kind":"concept","label":"complete graph","sources":[{"id":"nist-dads.completegraph","title":"NIST Dictionary of Algorithms and Data Structures: completeGraph","url":"https://xlinux.nist.gov/dads/HTML/completeGraph.html"}],"status":"reported","summary":"NIST DADS defines complete graph as: An undirected graph with an edge between every pair of vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bipartgraph","kind":"concept","label":"bipartite graph","sources":[{"id":"nist-dads.bipartgraph","title":"NIST Dictionary of Algorithms and Data Structures: bipartgraph","url":"https://xlinux.nist.gov/dads/HTML/bipartgraph.html"}],"status":"reported","summary":"NIST DADS defines bipartite graph as: An undirected graph where vertices can be partition ed into two sets such that no edge connects vertices in the same set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directacycgraph","kind":"concept","label":"directed acyclic graph","sources":[{"id":"nist-dads.directacycgraph","title":"NIST Dictionary of Algorithms and Data Structures: directAcycGraph","url":"https://xlinux.nist.gov/dads/HTML/directAcycGraph.html"}],"status":"reported","summary":"NIST DADS defines directed acyclic graph as: A directed graph with no path that starts and ends at the same vertex . Also known as DAG, acyclic directed graph, oriented acyclic graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.abstractdatatype","kind":"concept","label":"abstract data type","sources":[{"id":"nist-dads.abstractdatatype","title":"NIST Dictionary of Algorithms and Data Structures: abstractDataType","url":"https://xlinux.nist.gov/dads/HTML/abstractDataType.html"}],"status":"reported","summary":"NIST DADS defines abstract data type as: A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circularlist","kind":"concept","label":"circular list","sources":[{"id":"nist-dads.circularlist","title":"NIST Dictionary of Algorithms and Data Structures: circularlist","url":"https://xlinux.nist.gov/dads/HTML/circularlist.html"}],"status":"reported","summary":"NIST DADS defines circular list as: A variant of a linked list in which the nominal tail is linked to the head . The entire list may be accessed starting at any item and following links until one comes to the starting item again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circularqueue","kind":"concept","label":"circular queue","sources":[{"id":"nist-dads.circularqueue","title":"NIST Dictionary of Algorithms and Data Structures: circularQueue","url":"https://xlinux.nist.gov/dads/HTML/circularQueue.html"}],"status":"reported","summary":"NIST DADS defines circular queue as: An implementation of a bounded queue using an array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.deque","kind":"concept","label":"deque","sources":[{"id":"nist-dads.deque","title":"NIST Dictionary of Algorithms and Data Structures: deque","url":"https://xlinux.nist.gov/dads/HTML/deque.html"}],"status":"reported","summary":"NIST DADS defines deque as: A data structure in which items may be added to or deleted from the head or the tail . Also known as doubly-ended queue.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryheap","kind":"concept","label":"binary heap","sources":[{"id":"nist-dads.binaryheap","title":"NIST Dictionary of Algorithms and Data Structures: binaryheap","url":"https://xlinux.nist.gov/dads/HTML/binaryheap.html"}],"status":"reported","summary":"NIST DADS defines binary heap as: A complete binary tree where every node has a key more extreme (greater or less) than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fibonacciheap","kind":"concept","label":"Fibonacci heap","sources":[{"id":"nist-dads.fibonacciheap","title":"NIST Dictionary of Algorithms and Data Structures: fibonacciHeap","url":"https://xlinux.nist.gov/dads/HTML/fibonacciHeap.html"}],"status":"reported","summary":"NIST DADS defines Fibonacci heap as: A heap made of a forest of trees . The amortized cost of the operations create, insert a value, decrease a value, find minimum, and merge or join ( meld ) two heaps, is a constant Θ(1) . The delete operation takes O(log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binomialheap","kind":"concept","label":"binomial heap","sources":[{"id":"nist-dads.binomialheap","title":"NIST Dictionary of Algorithms and Data Structures: binomialheap","url":"https://xlinux.nist.gov/dads/HTML/binomialheap.html"}],"status":"reported","summary":"NIST DADS defines binomial heap as: A heap made of a forest of binomial trees with the heap property numbered k=0, 1, 2, …, n, each containing either 0 or 2 k nodes . Each tree is formed by linking two of its predecessors, by joining one at the root of the other. The operations of insert a value, decrease a value, delete a value, and merge or join ( meld ) two queues take O(log n) time. The find minimum operation is a constant Θ(1) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.splaytree","kind":"concept","label":"splay tree","sources":[{"id":"nist-dads.splaytree","title":"NIST Dictionary of Algorithms and Data Structures: splaytree","url":"https://xlinux.nist.gov/dads/HTML/splaytree.html"}],"status":"reported","summary":"NIST DADS defines splay tree as: A binary search tree in which operations that access nodes restructure the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.two3tree","kind":"concept","label":"2-3 tree","sources":[{"id":"nist-dads.two3tree","title":"NIST Dictionary of Algorithms and Data Structures: two3tree","url":"https://xlinux.nist.gov/dads/HTML/two3tree.html"}],"status":"reported","summary":"NIST DADS defines 2-3 tree as: A B-tree of order 3, that is, internal nodes have two or three children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixtree","kind":"concept","label":"suffix tree","sources":[{"id":"nist-dads.suffixtree","title":"NIST Dictionary of Algorithms and Data Structures: suffixtree","url":"https://xlinux.nist.gov/dads/HTML/suffixtree.html"}],"status":"reported","summary":"NIST DADS defines suffix tree as: A compact representation of a trie corresponding to the suffixes of a given string where all nodes with one child are merged with their parents .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixarray","kind":"concept","label":"suffix array","sources":[{"id":"nist-dads.suffixarray","title":"NIST Dictionary of Algorithms and Data Structures: suffixarray","url":"https://xlinux.nist.gov/dads/HTML/suffixarray.html"}],"status":"reported","summary":"NIST DADS defines suffix array as: An array of all starting positions of suffixes of a string arranged in lexicographical order . This allows a binary search or fast substring search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hash","kind":"method","label":"hash function","sources":[{"id":"nist-dads.hash","title":"NIST Dictionary of Algorithms and Data Structures: hash","url":"https://xlinux.nist.gov/dads/HTML/hash.html"}],"status":"reported","summary":"NIST DADS defines hash function as: A function that maps keys to integers, usually to get an even distribution on a smaller set of values. Also known as hash.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.perfecthash","kind":"method","label":"perfect hashing","sources":[{"id":"nist-dads.perfecthash","title":"NIST Dictionary of Algorithms and Data Structures: perfecthash","url":"https://xlinux.nist.gov/dads/HTML/perfecthash.html"}],"status":"reported","summary":"NIST DADS defines perfect hashing as: A hash function that maps each different key to a distinct integer. Usually all possible keys must be known beforehand. A hash table that uses a perfect hash has no collisions . Formal Definition: A function f is perfect for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k. Also known as optimal hashing.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.openaddressing","kind":"method","label":"open addressing","sources":[{"id":"nist-dads.openaddressing","title":"NIST Dictionary of Algorithms and Data Structures: openAddressing","url":"https://xlinux.nist.gov/dads/HTML/openAddressing.html"}],"status":"reported","summary":"NIST DADS defines open addressing as: A class of collision resolution schemes in which all items are stored within the hash table . In case of collision , other positions are computed, giving a probe sequence , and checked until an empty position is found. Some ways of computing possible new positions are less efficient because of clustering . Typically items never move once put in place, but in Robin Hood hashing , LCFS hashing , and other techniques, previously placed items may move.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linearprobng","kind":"concept","label":"linear probing","sources":[{"id":"nist-dads.linearprobng","title":"NIST Dictionary of Algorithms and Data Structures: linearprobng","url":"https://xlinux.nist.gov/dads/HTML/linearprobng.html"}],"status":"reported","summary":"NIST DADS defines linear probing as: A hash table in which a collision is resolved by putting the item in the next empty place in the array following the occupied place. Even with a moderate load factor , primary clustering tends to slow retrieval.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doublehashng","kind":"method","label":"double hashing","sources":[{"id":"nist-dads.doublehashng","title":"NIST Dictionary of Algorithms and Data Structures: doublehashng","url":"https://xlinux.nist.gov/dads/HTML/doublehashng.html"}],"status":"reported","summary":"NIST DADS defines double hashing as: A method of open addressing for a hash table in which a collision is resolved by searching the table for an empty place at intervals given by a different hash function, thus minimizing clustering . Also known as rehashing.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuckoohashing","kind":"concept","label":"cuckoo hashing","sources":[{"id":"nist-dads.cuckoohashing","title":"NIST Dictionary of Algorithms and Data Structures: cuckooHashing","url":"https://xlinux.nist.gov/dads/HTML/cuckooHashing.html"}],"status":"reported","summary":"NIST DADS defines cuckoo hashing as: A dictionary implemented with two hash tables , T 1 and T 2 , and two different hash functions , h 1 and h 2 . Each key , k, is either in T 1 [h 1 (k)] or T 2 [h 2 (k)]. A new key , k, is stored in T 1 [h 1 (k)]. If that location is already occupied by another key, l, the other key is moved to T 2 [h 2 (l)]. Keys are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed. For tables that are a bit less than half full and with carefully chosen universal hashing functions, performance is good. A key is deleted by removing it from a table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.recursion","kind":"method","label":"recursion","sources":[{"id":"nist-dads.recursion","title":"NIST Dictionary of Algorithms and Data Structures: recursion","url":"https://xlinux.nist.gov/dads/HTML/recursion.html"}],"status":"reported","summary":"NIST DADS defines recursion as: An algorithmic technique where a function, in order to accomplish a task, calls itself with some part of the task.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.iteration","kind":"method","label":"iteration","sources":[{"id":"nist-dads.iteration","title":"NIST Dictionary of Algorithms and Data Structures: iteration","url":"https://xlinux.nist.gov/dads/HTML/iteration.html"}],"status":"reported","summary":"NIST DADS defines iteration as: Solve a problem by repeatedly working on successive parts of the problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.memoize","kind":"method","label":"memoization","sources":[{"id":"nist-dads.memoize","title":"NIST Dictionary of Algorithms and Data Structures: memoize","url":"https://xlinux.nist.gov/dads/HTML/memoize.html"}],"status":"reported","summary":"NIST DADS defines memoization as: Save (memoize) a computed answer for possible later reuse, rather than recomputing the answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.branchnbound","kind":"method","label":"branch and bound","sources":[{"id":"nist-dads.branchnbound","title":"NIST Dictionary of Algorithms and Data Structures: branchNbound","url":"https://xlinux.nist.gov/dads/HTML/branchNbound.html"}],"status":"reported","summary":"NIST DADS defines branch and bound as: An algorithmic technique to find the optimal solution by keeping the best solution found so far. If a partial solution cannot improve on the best, it is abandoned.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.exhaustivesearch","kind":"method","label":"exhaustive search","sources":[{"id":"nist-dads.exhaustivesearch","title":"NIST Dictionary of Algorithms and Data Structures: exhaustiveSearch","url":"https://xlinux.nist.gov/dads/HTML/exhaustiveSearch.html"}],"status":"reported","summary":"NIST DADS defines exhaustive search as: An algorithm that finds a solution by trying every possibility.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.interpolationsearch","kind":"method","label":"interpolation search","sources":[{"id":"nist-dads.interpolationsearch","title":"NIST Dictionary of Algorithms and Data Structures: interpolationSearch","url":"https://xlinux.nist.gov/dads/HTML/interpolationSearch.html"}],"status":"reported","summary":"NIST DADS defines interpolation search as: Search a sorted array by estimating the next position to check based on a linear interpolation of the search key and the values at the ends of the search interval. Also known as extrapolation search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jumpsearch","kind":"method","label":"jump search","sources":[{"id":"nist-dads.jumpsearch","title":"NIST Dictionary of Algorithms and Data Structures: jumpsearch","url":"https://xlinux.nist.gov/dads/HTML/jumpsearch.html"}],"status":"reported","summary":"NIST DADS defines jump search as: Search a sorted array by checking every j th item until the right area is found, then doing a linear search . The optimum for n items is when j=√ n. Also known as block search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fibonacciansearch","kind":"method","label":"Fibonaccian search","sources":[{"id":"nist-dads.fibonacciansearch","title":"NIST Dictionary of Algorithms and Data Structures: fibonaccianSearch","url":"https://xlinux.nist.gov/dads/HTML/fibonaccianSearch.html"}],"status":"reported","summary":"NIST DADS defines Fibonaccian search as: Search a sorted array by narrowing possible locations to progressively smaller intervals. Begin with two Fibonacci numbers , p (F(n)) and q (F(n+1)), such that p < n ≤ q, where n is the size of the array. The first step checks location p. The size of the next interval is p, if the key is less than the item at that location, or q-p (F(n-1)) if it is greater.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.allpairsshortestpath","kind":"concept","label":"all pairs shortest path","sources":[{"id":"nist-dads.allpairsshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: allPairsShortestPath","url":"https://xlinux.nist.gov/dads/HTML/allPairsShortestPath.html"}],"status":"reported","summary":"NIST DADS defines all pairs shortest path as: Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitiveclosure","kind":"concept","label":"transitive closure","sources":[{"id":"nist-dads.transitiveclosure","title":"NIST Dictionary of Algorithms and Data Structures: transitiveClosure","url":"https://xlinux.nist.gov/dads/HTML/transitiveClosure.html"}],"status":"reported","summary":"NIST DADS defines transitive closure as: An extension or superset of a binary relation such that whenever (a,b) and (b,c) are in the extension, (a,c) is also in the extension.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.euclidalgo","kind":"method","label":"Euclid's algorithm","sources":[{"id":"nist-dads.euclidalgo","title":"NIST Dictionary of Algorithms and Data Structures: euclidalgo","url":"https://xlinux.nist.gov/dads/HTML/euclidalgo.html"}],"status":"reported","summary":"NIST DADS defines Euclid's algorithm as: An algorithm to compute the greatest common divisor of two positive integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);} . The run time complexity is O((log a)(log b)) bit operations. Also known as Euclidean algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fastfouriertransform","kind":"method","label":"fast fourier transform","sources":[{"id":"nist-dads.fastfouriertransform","title":"NIST Dictionary of Algorithms and Data Structures: fastFourierTransform","url":"https://xlinux.nist.gov/dads/HTML/fastFourierTransform.html"}],"status":"reported","summary":"NIST DADS defines fast fourier transform as: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain. Also known as FFT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.huffmancoding","kind":"method","label":"Huffman coding","sources":[{"id":"nist-dads.huffmancoding","title":"NIST Dictionary of Algorithms and Data Structures: huffmanCoding","url":"https://xlinux.nist.gov/dads/HTML/huffmanCoding.html"}],"status":"reported","summary":"NIST DADS defines Huffman coding as: A minimal variable-length character coding based on the frequency of each character. First, each character becomes a one-node binary tree , with the character as the only node . The character's frequency is the tree's frequency. Two trees with the least frequencies are joined as the subtrees of a new root that is assigned the sum of their frequencies. Repeat until all characters are in one tree. One code bit represents each level . Thus more frequent characters are near the root and are coded with few bits, and rare characters are far from the root and are coded with many bits. Also known as static Huffman coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.arithmeticcoding","kind":"method","label":"arithmetic coding","sources":[{"id":"nist-dads.arithmeticcoding","title":"NIST Dictionary of Algorithms and Data Structures: arithmeticCoding","url":"https://xlinux.nist.gov/dads/HTML/arithmeticCoding.html"}],"status":"reported","summary":"NIST DADS defines arithmetic coding as: A minimal variable-length message coding based on the frequency of each character. The message is represented by a fraction which is the repeated offset-plus-product reduction of the range (offset) and probability (product) of each character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lempelzivwelch","kind":"method","label":"Lempel-Ziv-Welch","sources":[{"id":"nist-dads.lempelzivwelch","title":"NIST Dictionary of Algorithms and Data Structures: lempelZivWelch","url":"https://xlinux.nist.gov/dads/HTML/lempelZivWelch.html"}],"status":"reported","summary":"NIST DADS defines Lempel-Ziv-Welch as: A compression algorithm that codes strings of characters with codes of a fixed number of bits. Every new string in the input is added to a table until it is full. The codes of existing strings are output instead of the strings. Also known as LZW compression.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stringmatching","kind":"concept","label":"string matching","sources":[{"id":"nist-dads.stringmatching","title":"NIST Dictionary of Algorithms and Data Structures: stringMatching","url":"https://xlinux.nist.gov/dads/HTML/stringMatching.html"}],"status":"reported","summary":"NIST DADS defines string matching as: The problem of finding occurrence(s) of a pattern string within another string or body of text. There are many different algorithms for efficient searching. Also known as exact string matching, string searching, text searching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boyermoore","kind":"method","label":"Boyer-Moore","sources":[{"id":"nist-dads.boyermoore","title":"NIST Dictionary of Algorithms and Data Structures: boyermoore","url":"https://xlinux.nist.gov/dads/HTML/boyermoore.html"}],"status":"reported","summary":"NIST DADS defines Boyer-Moore as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next possible match: the farthest of a table like that used in the Knuth-Morris-Pratt algorithm and the next matching position in the pattern .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shellsort","kind":"method","label":"Shell sort","sources":[{"id":"nist-dads.shellsort","title":"NIST Dictionary of Algorithms and Data Structures: shellsort","url":"https://xlinux.nist.gov/dads/HTML/shellsort.html"}],"status":"reported","summary":"NIST DADS defines Shell sort as: The first diminishing increment sort . On each pass i sets of n/i items are sorted, typically with insertion sort . On each succeeding pass, i is reduced until it is 1 for the last pass. A good series of i values is important to efficiency.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.combsort","kind":"method","label":"comb sort","sources":[{"id":"nist-dads.combsort","title":"NIST Dictionary of Algorithms and Data Structures: combSort","url":"https://xlinux.nist.gov/dads/HTML/combSort.html"}],"status":"reported","summary":"NIST DADS defines comb sort as: An in-place sort algorithm that repeatedly reorders different pairs of items. On each pass swap pairs of items separated by the increment or gap, if needed, and reduce the gap (divide it by about 1.3). The gap starts at about 3/4 of the number of items. Continue until the gap is 1 and a pass had no swaps.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.gnomesort","kind":"method","label":"gnome sort","sources":[{"id":"nist-dads.gnomesort","title":"NIST Dictionary of Algorithms and Data Structures: gnomeSort","url":"https://xlinux.nist.gov/dads/HTML/gnomeSort.html"}],"status":"reported","summary":"NIST DADS defines gnome sort as: Put items in order by comparing the current item with the previous item. If they are in order, move to the next item (or stop if the end is reached). If they are out of order, swap them and move to the previous item. If there is no previous item, move to the next item.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.inplacesort","kind":"method","label":"in-place sort","sources":[{"id":"nist-dads.inplacesort","title":"NIST Dictionary of Algorithms and Data Structures: inplacesort","url":"https://xlinux.nist.gov/dads/HTML/inplacesort.html"}],"status":"reported","summary":"NIST DADS defines in-place sort as: A sort algorithm in which the sorted items occupy the same storage as the original ones. These algorithms may use o(n) additional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time. Also known as sort in place.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.comparisnsrt","kind":"concept","label":"comparison sort","sources":[{"id":"nist-dads.comparisnsrt","title":"NIST Dictionary of Algorithms and Data Structures: comparisnsrt","url":"https://xlinux.nist.gov/dads/HTML/comparisnsrt.html"}],"status":"reported","summary":"NIST DADS defines comparison sort as: Any sort algorithm using comparisons between keys , and nothing else about the keys, to arrange items in a predetermined order. An alternative is a restricted universe sort such as counting sort or bucket sort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalsort","kind":"concept","label":"external sort","sources":[{"id":"nist-dads.externalsort","title":"NIST Dictionary of Algorithms and Data Structures: externalsort","url":"https://xlinux.nist.gov/dads/HTML/externalsort.html"}],"status":"reported","summary":"NIST DADS defines external sort as: Any sort algorithm that uses external memory, such as tape or disk, during the sort. Since most common sort algorithms assume high-speed random access to all intermediate memory, they are unsuitable if the values to be sorted don't fit in main memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.internalsort","kind":"concept","label":"internal sort","sources":[{"id":"nist-dads.internalsort","title":"NIST Dictionary of Algorithms and Data Structures: internalsort","url":"https://xlinux.nist.gov/dads/HTML/internalsort.html"}],"status":"reported","summary":"NIST DADS defines internal sort as: Any sort algorithm which uses exclusively main memory during the sort. This assumes high-speed random access to all memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bitonicsort","kind":"method","label":"bitonic sort","sources":[{"id":"nist-dads.bitonicsort","title":"NIST Dictionary of Algorithms and Data Structures: bitonicSort","url":"https://xlinux.nist.gov/dads/HTML/bitonicSort.html"}],"status":"reported","summary":"NIST DADS defines bitonic sort as: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitestatetransducer","kind":"concept","label":"finite state transducer","sources":[{"id":"nist-dads.finitestatetransducer","title":"NIST Dictionary of Algorithms and Data Structures: finiteStateTransducer","url":"https://xlinux.nist.gov/dads/HTML/finiteStateTransducer.html"}],"status":"reported","summary":"NIST DADS defines finite state transducer as: A finite state machine specifically with a read-only input and a write-only output. The input and output cannot be reread or changed.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.turingmachine","kind":"concept","label":"Turing machine","sources":[{"id":"nist-dads.turingmachine","title":"NIST Dictionary of Algorithms and Data Structures: turingMachine","url":"https://xlinux.nist.gov/dads/HTML/turingMachine.html"}],"status":"reported","summary":"NIST DADS defines Turing machine as: A model of computation consisting of a finite state machine controller, a read-write head, and an unbounded sequential tape. Depending on the current state and symbol read on the tape, the machine can change its state and move the head to the left or right. Unless otherwise specified, a Turing machine is deterministic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermturingmach","kind":"concept","label":"nondeterministic Turing machine","sources":[{"id":"nist-dads.nondetermturingmach","title":"NIST Dictionary of Algorithms and Data Structures: nondetermTuringMach","url":"https://xlinux.nist.gov/dads/HTML/nondetermTuringMach.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic Turing machine as: A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bigonotation","kind":"concept","label":"big-O notation","sources":[{"id":"nist-dads.bigonotation","title":"NIST Dictionary of Algorithms and Data Structures: bigOnotation","url":"https://xlinux.nist.gov/dads/HTML/bigOnotation.html"}],"status":"reported","summary":"NIST DADS defines big-O notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = O(g(n)) means it is less than some constant multiple of g(n). The notation is read, \"f of n is big oh of g of n\". Formal Definition: f(n) = O(g(n)) means there are positive constants c and k, such that 0 ≤ f(n) ≤ cg(n) for all n ≥ k. The values of c and k must be fixed for the function f and must not depend on n. Also known as O, asymptotic upper bound.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptoticbound","kind":"concept","label":"asymptotic bound","sources":[{"id":"nist-dads.asymptoticbound","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticBound","url":"https://xlinux.nist.gov/dads/HTML/asymptoticBound.html"}],"status":"reported","summary":"NIST DADS defines asymptotic bound as: A curve representing the limit of a function. That is, the distance between a function and the curve tends to zero. The function may or may not intersect the bounding curve.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.npcomplete","kind":"concept","label":"NP-complete","sources":[{"id":"nist-dads.npcomplete","title":"NIST Dictionary of Algorithms and Data Structures: npcomplete","url":"https://xlinux.nist.gov/dads/HTML/npcomplete.html"}],"status":"reported","summary":"NIST DADS defines NP-complete as: The complexity class of decision problems for which answers can be checked for correctness, given a certificate , by an algorithm whose run time is polynomial in the size of the input (that is, it is NP ) and no other NP problem is more than a polynomial factor harder. Informally, a problem is NP-complete if answers can be verified quickly, and a quick algorithm to solve this problem can be used to solve all other NP problems quickly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomialtm","kind":"concept","label":"polynomial time","sources":[{"id":"nist-dads.polynomialtm","title":"NIST Dictionary of Algorithms and Data Structures: polynomialtm","url":"https://xlinux.nist.gov/dads/HTML/polynomialtm.html"}],"status":"reported","summary":"NIST DADS defines polynomial time as: When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(n k ) where k is a constant.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geochemistry","kind":"field","label":"Geochemistry","sources":[{"id":"usgs-thesaurus.45717bf85fdd31a41c91","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=437","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=437"}],"status":"reported","summary":"USGS Thesaurus defines Geochemistry as: Study of the distribution of chemical elements and natural compounds on the earth and in the atmosphere and the chemical processes that affect the earth.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geochronology","kind":"field","label":"Geochronology","sources":[{"id":"usgs-thesaurus.9b9b9c2209b3540da35b","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438"}],"status":"reported","summary":"USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.geomorphology","kind":"field","label":"Geomorphology","sources":[{"id":"usgs-thesaurus.ac143557ea12a17d3c6d","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=468","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=468"}],"status":"reported","summary":"USGS Thesaurus defines Geomorphology as: Branch of geology dealing with surface land features and the processes that create and change them.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.glaciology","kind":"field","label":"Glaciology","sources":[{"id":"usgs-thesaurus.72927539f9b5c6155294","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=484","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=484"}],"status":"reported","summary":"USGS Thesaurus defines Glaciology as: Science dealing with the features, origins, processes, and properties of snow, ice, glaciers, and ice sheets.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.hydrogeology","kind":"field","label":"Hydrogeology","sources":[{"id":"usgs-thesaurus.ce8e9bd3a3dd978ad873","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=554","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=554"}],"status":"reported","summary":"USGS Thesaurus defines Hydrogeology as: Study of subsurface waters and geologic aspects of surface waters.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.hydrology","kind":"field","label":"Hydrology","sources":[{"id":"usgs-thesaurus.7691e5829ecd899aeb75","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560"}],"status":"reported","summary":"USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.limnology","kind":"field","label":"Limnology","sources":[{"id":"usgs-thesaurus.2e19bcc18d8f8bb2cd4f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=657","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=657"}],"status":"reported","summary":"USGS Thesaurus defines Limnology as: Scientific study of the physical and biological characteristics of inland bodies of water such as lakes and ponds.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.meteorology","kind":"field","label":"Meteorology","sources":[{"id":"usgs-thesaurus.4c9d6896b889ce2b2e86","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731"}],"status":"reported","summary":"USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.mineralogy","kind":"field","label":"Mineralogy","sources":[{"id":"usgs-thesaurus.a5b24d28b9768fcf1686","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747"}],"status":"reported","summary":"USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.paleontology","kind":"field","label":"Paleontology","sources":[{"id":"usgs-thesaurus.2dcbaf2d1a595f7517e5","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=861","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=861"}],"status":"reported","summary":"USGS Thesaurus defines Paleontology as: Study of life in past geologic time based on fossil plants and animals.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.petrology","kind":"field","label":"Petrology","sources":[{"id":"usgs-thesaurus.c8966d506e18150be2fe","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=883","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=883"}],"status":"reported","summary":"USGS Thesaurus defines Petrology as: Branch of earth sciences concerned with the origin, structure, alteration, and composition of rocks.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.sedimentology","kind":"field","label":"Sedimentology","sources":[{"id":"usgs-thesaurus.fd7a87508131b4ecaf86","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037"}],"status":"reported","summary":"USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.seismology","kind":"field","label":"Seismology","sources":[{"id":"usgs-thesaurus.762a1e9db52aec2a89a0","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050"}],"status":"reported","summary":"USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.stratigraphy","kind":"field","label":"Stratigraphy","sources":[{"id":"usgs-thesaurus.d2e306d9307aced4b202","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104"}],"status":"reported","summary":"USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.tectonophysics","kind":"field","label":"Tectonophysics","sources":[{"id":"usgs-thesaurus.969a1d445933c65b567f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1147","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1147"}],"status":"reported","summary":"USGS Thesaurus defines Tectonophysics as: Branch of geophysics concerned with the structural forces affecting the deformation, uplift, and movement of the earth's crust.","tags":["ology"]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"ology.volcanology","kind":"field","label":"Volcanology","sources":[{"id":"usgs-thesaurus.cfccf058f7b98949dc69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1289","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1289"}],"status":"reported","summary":"USGS Thesaurus defines Volcanology as: The branch of geology that deals with volcanism and the processes involved in magma flow and eruption through a vent in the earth's surface.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.endocrinology","kind":"field","label":"Endocrinology","sources":[{"id":"usgs-thesaurus.7fecd1d9d681f5519ebb","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=334","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=334"},{"id":"completion-source.e90badae02d39b991a93","title":"NLM MeSH: Endocrinology","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004704"}],"status":"reported","summary":"USGS Thesaurus defines Endocrinology as: Study of the collection of ductless glands that secrete hormones which influence growth, gender, sexual maturity, and other attributes.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.pathology","kind":"field","label":"Pathology","sources":[{"id":"usgs-thesaurus.e4b94d24f020cbbbfc43","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=876","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=876"}],"status":"reported","summary":"USGS Thesaurus defines Pathology as: Branch of biology concerned with the study of the causes, progress, symptoms, diagnosis, and effects of diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.bacteriology","kind":"field","label":"Bacteriology","sources":[{"id":"usgs-thesaurus.2638b993d82a3ee7dc55","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=77","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=77"}],"status":"reported","summary":"USGS Thesaurus defines Bacteriology as: Study of the single celled microorganisms known as bacteria.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cell-biology","kind":"field","label":"Cell biology","sources":[{"id":"usgs-thesaurus.54dbaf6b936415d8d2d7","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=151","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=151"}],"status":"reported","summary":"USGS Thesaurus defines Cell biology as: Branch of biology that deals with the study of the formation, structure, and physiology of cells.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.developmental-biology","kind":"field","label":"Developmental biology","sources":[{"id":"usgs-thesaurus.43c406756994e4d6a610","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=247","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=247"}],"status":"reported","summary":"USGS Thesaurus defines Developmental biology as: Scientific study of the processes related to the transformation of living organisms from single cells to complex multi-celled individuals.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.entomology","kind":"field","label":"Entomology","sources":[{"id":"usgs-thesaurus.26d0f4a60626d67a41cf","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=341","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=341"}],"status":"reported","summary":"USGS Thesaurus defines Entomology as: Branch of zoology involved in studying insects.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ethology","kind":"field","label":"Ethology","sources":[{"id":"usgs-thesaurus.9375aebb8cb97e02bd6f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2040","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2040"}],"status":"reported","summary":"USGS Thesaurus defines Ethology as: Study of animal behavior under natural conditions","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.herpetology","kind":"field","label":"Herpetology","sources":[{"id":"usgs-thesaurus.7a6a2965ad207743d814","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=539","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=539"}],"status":"reported","summary":"USGS Thesaurus defines Herpetology as: Branch of zoology concerned with the study of reptiles and amphibians.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.histology","kind":"field","label":"Histology","sources":[{"id":"usgs-thesaurus.6b30b2d3f6402ab23f69","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=540","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=540"}],"status":"reported","summary":"USGS Thesaurus defines Histology as: Branch of anatomy concerned with the microscopic structure of plant and animal tissue.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ichthyology","kind":"field","label":"Ichthyology","sources":[{"id":"usgs-thesaurus.fc3a1187d897acbd35b3","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=570","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=570"}],"status":"reported","summary":"USGS Thesaurus defines Ichthyology as: Branch of zoology concerned with the study of fish.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.immunology","kind":"field","label":"Immunology","sources":[{"id":"usgs-thesaurus.1e207764c4dcaddcfa3f","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=576","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=576"}],"status":"reported","summary":"USGS Thesaurus defines Immunology as: Branch of biology which studies the body's production of lymphocytes, antibodies, and macrophages in response to foreign substances or pathogenic organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.mammalogy","kind":"field","label":"Mammalogy","sources":[{"id":"usgs-thesaurus.371c76fcaf528fc15e5e","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=685","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=685"}],"status":"reported","summary":"USGS Thesaurus defines Mammalogy as: Branch of zoology concerned with the study of mammals.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.marine-biology","kind":"field","label":"Marine biology","sources":[{"id":"usgs-thesaurus.c06c39ee767c6bf57f75","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=702","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=702"}],"status":"reported","summary":"USGS Thesaurus defines Marine biology as: Branch of biology concerned with the organisms and habitats of the seas and oceans.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.mycology","kind":"field","label":"Mycology","sources":[{"id":"usgs-thesaurus.4cae14b1bd2e1d062020","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=767","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=767"}],"status":"reported","summary":"USGS Thesaurus defines Mycology as: Branch of biology concerned with the study of fungi.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.ornithology","kind":"field","label":"Ornithology","sources":[{"id":"usgs-thesaurus.45d1b09cab533d0d8add","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=845","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=845"}],"status":"reported","summary":"USGS Thesaurus defines Ornithology as: Branch of biology concerned with the study of birds.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.parasitology","kind":"field","label":"Parasitology","sources":[{"id":"usgs-thesaurus.50ce134a036f2d19ef0a","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=871","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=871"}],"status":"reported","summary":"USGS Thesaurus defines Parasitology as: Branch of biology concerned with the study of organisms that, living on or in another organism, take nutrition from the host and often harm it.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.phycology","kind":"field","label":"Phycology","sources":[{"id":"usgs-thesaurus.9a880c55f1553c1253d9","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=890","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=890"}],"status":"reported","summary":"USGS Thesaurus defines Phycology as: Branch of biology concerned with the study of algae.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.virology","kind":"field","label":"Virology","sources":[{"id":"usgs-thesaurus.bf9e37c0e60da0feaec7","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1279","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1279"}],"status":"reported","summary":"USGS Thesaurus defines Virology as: Branch of biology dealing with viruses and viral diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.zoology","kind":"field","label":"Zoology","sources":[{"id":"usgs-thesaurus.2e13d5f63b99994c4e0c","title":"USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1339","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1339"}],"status":"reported","summary":"USGS Thesaurus defines Zoology as: Branch of biology that deals with the reproduction, development and growth, anatomy, physiology, and behavior of animals.","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bondseqsearch","kind":"method","label":"Bond Sequential Search","sources":[{"id":"nist-dads.bondseqsearch","title":"NIST Dictionary of Algorithms and Data Structures: BondSeqSearch","url":"https://xlinux.nist.gov/dads/HTML/BondSeqSearch.html"}],"status":"reported","summary":"NIST DADS defines Bond Sequential Search as: Search an array or list for two keys at once by using the bitwise or of the keys as the search key. When a possible match is found, compare each key against the item.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.collatzproblem","kind":"concept","label":"Collatz problem","sources":[{"id":"nist-dads.collatzproblem","title":"NIST Dictionary of Algorithms and Data Structures: CollatzProblem","url":"https://xlinux.nist.gov/dads/HTML/CollatzProblem.html"}],"status":"reported","summary":"NIST DADS defines Collatz problem as: Consider the function: if N is odd, 3 × N + 1; else N/2. Does beginning with any positive integer and repeatedly applying the function always yields 1?","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.commentzwalter","kind":"method","label":"Commentz-Walter","sources":[{"id":"nist-dads.commentzwalter","title":"NIST Dictionary of Algorithms and Data Structures: CommentzWalter","url":"https://xlinux.nist.gov/dads/HTML/CommentzWalter.html"}],"status":"reported","summary":"NIST DADS defines Commentz-Walter as: A multiple string matching algorithm that compares from the end of the pattern , like Boyer-Moore , using a finite state machine , like Aho-Corasick .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dfsforest","kind":"concept","label":"DFS forest","sources":[{"id":"nist-dads.dfsforest","title":"NIST Dictionary of Algorithms and Data Structures: DFSforest","url":"https://xlinux.nist.gov/dads/HTML/DFSforest.html"}],"status":"reported","summary":"NIST DADS defines DFS forest as: A rooted forest formed by depth-first search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dtree","kind":"concept","label":"D-tree","sources":[{"id":"nist-dads.dtree","title":"NIST Dictionary of Algorithms and Data Structures: DTree","url":"https://xlinux.nist.gov/dads/HTML/DTree.html"}],"status":"reported","summary":"NIST DADS defines D-tree as: (1) A BB(α) tree where the weights are the number of searches down that path. (2) A height-balanced binary tree that divides regions along their boundaries to serve as a spatial access method .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dutchnationalflag","kind":"concept","label":"Dutch national flag","sources":[{"id":"nist-dads.dutchnationalflag","title":"NIST Dictionary of Algorithms and Data Structures: DutchNationalFlag","url":"https://xlinux.nist.gov/dads/HTML/DutchNationalFlag.html"}],"status":"reported","summary":"NIST DADS defines Dutch national flag as: Rearrange elements in an array into three groups: bottom, middle, and top. One algorithm is to have the top group grow down from the top of the array, the bottom group grow up from the bottom, and keep the middle group just above the bottom. The algorithm stores the locations just below the top group, just above the bottom, and just above the middle in three indexes. At each step, examine the element just above the middle. If it belongs to the top group, swap it with the element just below the top. If it belongs in the bottom, swap it with the element just above the bottom. If it is in the middle, leave it. Update the appropriate index. Complexity is Θ(n) moves and examinations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eulersformula","kind":"concept","label":"Euler's formula","sources":[{"id":"nist-dads.eulersformula","title":"NIST Dictionary of Algorithms and Data Structures: EulersFormula","url":"https://xlinux.nist.gov/dads/HTML/EulersFormula.html"}],"status":"reported","summary":"NIST DADS defines Euler's formula as: For convex polyhedron, V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the number of faces.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jsort","kind":"method","label":"JSort","sources":[{"id":"nist-dads.jsort","title":"NIST Dictionary of Algorithms and Data Structures: JSort","url":"https://xlinux.nist.gov/dads/HTML/JSort.html"}],"status":"reported","summary":"NIST DADS defines JSort as: An in-place sort that partially orders the array twice with build-heap , once moving lesser items earlier and once in reverse moving greater items later, then uses insertion sort on the nearly-ordered array.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lcs","kind":"concept","label":"LCS","sources":[{"id":"nist-dads.lcs","title":"NIST Dictionary of Algorithms and Data Structures: LCS","url":"https://xlinux.nist.gov/dads/HTML/LCS.html"}],"status":"reported","summary":"NIST DADS defines LCS as: Either longest common subsequence or longest common substring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.levenshtein","kind":"concept","label":"Levenshtein distance","sources":[{"id":"nist-dads.levenshtein","title":"NIST Dictionary of Algorithms and Data Structures: Levenshtein","url":"https://xlinux.nist.gov/dads/HTML/Levenshtein.html"}],"status":"reported","summary":"NIST DADS defines Levenshtein distance as: (1) The smallest number of insertions, deletions, and substitutions required to change one string or tree into another. (2) A Θ(m × n) algorithm to compute the distance between strings, where m and n are the lengths of the strings. Also known as edit distance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.merkletree","kind":"concept","label":"Merkle tree","sources":[{"id":"nist-dads.merkletree","title":"NIST Dictionary of Algorithms and Data Structures: MerkleTree","url":"https://xlinux.nist.gov/dads/HTML/MerkleTree.html"}],"status":"reported","summary":"NIST DADS defines Merkle tree as: A tree (usually a binary tree ) in which each internal node has a hash of all the information in the leaf nodes under it. Specifically, each internal node has a hash of the information in its children . Each leaf has a hash of the block of information it represents. All leaf nodes are at the same depth . All nodes are as far left as possible. To add a block (leaf) to a full tree, a new root is created with the old root as its left child. Its right child is a degenerate tree (only left subtrees) all the way to the leaf level. Also known as hash tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sstable","kind":"concept","label":"SSTable","sources":[{"id":"nist-dads.sstable","title":"NIST Dictionary of Algorithms and Data Structures: SSTable","url":"https://xlinux.nist.gov/dads/HTML/SSTable.html"}],"status":"reported","summary":"NIST DADS defines SSTable as: An immutable dictionary stored on disk. Values are far larger than keys. Keys and values are in key-order in a \"data block\". Ordered keys are in an \"index block\", where each key has an offset into its location in the data block. Also known as sorted-string table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.absolute","kind":"concept","label":"absolute performance guarantee","sources":[{"id":"nist-dads.absolute","title":"NIST Dictionary of Algorithms and Data Structures: absolute","url":"https://xlinux.nist.gov/dads/HTML/absolute.html"}],"status":"reported","summary":"NIST DADS defines absolute performance guarantee as: An approximation algorithm will return a solution at most a bounded amount more (or less, as appropriate) than the optimum.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.abtree","kind":"concept","label":"(a,b)-tree","sources":[{"id":"nist-dads.abtree","title":"NIST Dictionary of Algorithms and Data Structures: abtree","url":"https://xlinux.nist.gov/dads/HTML/abtree.html"}],"status":"reported","summary":"NIST DADS defines (a,b)-tree as: A search tree with the restrictions that all leaves are at the same depth and all internal nodes have between a and b children , where a and b are integers such that 2 ≤ a ≤ (b+1)/2. The root may have as few as 2 children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.acceptingstt","kind":"concept","label":"accepting state","sources":[{"id":"nist-dads.acceptingstt","title":"NIST Dictionary of Algorithms and Data Structures: acceptingstt","url":"https://xlinux.nist.gov/dads/HTML/acceptingstt.html"}],"status":"reported","summary":"NIST DADS defines accepting state as: If a finite state machine finishes an input string and is in an accepting state , the string is accepted or considered to be valid.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ackermann","kind":"method","label":"Ackermann's function","sources":[{"id":"nist-dads.ackermann","title":"NIST Dictionary of Algorithms and Data Structures: ackermann","url":"https://xlinux.nist.gov/dads/HTML/ackermann.html"}],"status":"reported","summary":"NIST DADS defines Ackermann's function as: A function of two parameters whose value grows very fast. Formal Definition: A(0, j)=j+1 for j ≥ 0 A(i, 0)=A(i-1, 1) for i > 0 A(i, j)=A(i-1, A(i, j-1)) for i, j > 0","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.activedatastruc","kind":"concept","label":"active data structure","sources":[{"id":"nist-dads.activedatastruc","title":"NIST Dictionary of Algorithms and Data Structures: activeDataStruc","url":"https://xlinux.nist.gov/dads/HTML/activeDataStruc.html"}],"status":"reported","summary":"NIST DADS defines active data structure as: A data structure with an associated thread or process that performs internal operations to give the external behavior of another, usually more general, data structure. Also known as functional data structure.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.acyclicgraph","kind":"concept","label":"acyclic graph","sources":[{"id":"nist-dads.acyclicgraph","title":"NIST Dictionary of Algorithms and Data Structures: acyclicgraph","url":"https://xlinux.nist.gov/dads/HTML/acyclicgraph.html"}],"status":"reported","summary":"NIST DADS defines acyclic graph as: A graph with no path that starts and ends at the same vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.adaptiveheapsort","kind":"method","label":"adaptive heap sort","sources":[{"id":"nist-dads.adaptiveheapsort","title":"NIST Dictionary of Algorithms and Data Structures: adaptiveHeapSort","url":"https://xlinux.nist.gov/dads/HTML/adaptiveHeapSort.html"}],"status":"reported","summary":"NIST DADS defines adaptive heap sort as: A variant of heapsort that uses a randomized binary search tree (RBST) to structure the input according to any preexisting order. The RBST is used to select candidates that are put into the heap so the heap doesn't need to keep track of all elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.adaptivehuffman","kind":"method","label":"adaptive Huffman coding","sources":[{"id":"nist-dads.adaptivehuffman","title":"NIST Dictionary of Algorithms and Data Structures: adaptiveHuffman","url":"https://xlinux.nist.gov/dads/HTML/adaptiveHuffman.html"}],"status":"reported","summary":"NIST DADS defines adaptive Huffman coding as: A near-minimal variable-length character coding that changes based on the frequency of characters processed. As characters are processed, frequencies are updated and codes are changed (or, the coding tree is modified). Also known as dynamic Huffman coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adaptivesort","kind":"concept","label":"adaptive sort","sources":[{"id":"nist-dads.adaptivesort","title":"NIST Dictionary of Algorithms and Data Structures: adaptivesort","url":"https://xlinux.nist.gov/dads/HTML/adaptivesort.html"}],"status":"reported","summary":"NIST DADS defines adaptive sort as: A sorting algorithm that can take advantage of existing order in the input, reducing its requirements for computational resources as a function of the disorder in the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adaptkdtree","kind":"concept","label":"adaptive k-d tree","sources":[{"id":"nist-dads.adaptkdtree","title":"NIST Dictionary of Algorithms and Data Structures: adaptkdtree","url":"https://xlinux.nist.gov/dads/HTML/adaptkdtree.html"}],"status":"reported","summary":"NIST DADS defines adaptive k-d tree as: A tree for multidimensional points where successive levels may be split along different dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.addresscalc","kind":"method","label":"address-calculation sort","sources":[{"id":"nist-dads.addresscalc","title":"NIST Dictionary of Algorithms and Data Structures: addresscalc","url":"https://xlinux.nist.gov/dads/HTML/addresscalc.html"}],"status":"reported","summary":"NIST DADS defines address-calculation sort as: A sort algorithm which uses knowledge of the domain of the items to calculate the position of each item in the sorted array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adjacencylistrep","kind":"concept","label":"adjacency-list representation","sources":[{"id":"nist-dads.adjacencylistrep","title":"NIST Dictionary of Algorithms and Data Structures: adjacencyListRep","url":"https://xlinux.nist.gov/dads/HTML/adjacencyListRep.html"}],"status":"reported","summary":"NIST DADS defines adjacency-list representation as: A representation of a directed graph with n vertices using an array of n lists of vertices. List i contains vertex j if there is an edge from vertex i to vertex j. A weighted graph may be represented with a list of vertex/weight pairs. An undirected graph may be represented by having vertex j in the list for vertex i and vertex i in the list for vertex j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adjacent","kind":"concept","label":"adjacent","sources":[{"id":"nist-dads.adjacent","title":"NIST Dictionary of Algorithms and Data Structures: adjacent","url":"https://xlinux.nist.gov/dads/HTML/adjacent.html"}],"status":"reported","summary":"NIST DADS defines adjacent as: Two vertices of a graph are adjacent if there is an edge between them. Two edges of a graph are adjacent if they connect the same vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.adversary","kind":"concept","label":"adversary","sources":[{"id":"nist-dads.adversary","title":"NIST Dictionary of Algorithms and Data Structures: adversary","url":"https://xlinux.nist.gov/dads/HTML/adversary.html"}],"status":"reported","summary":"NIST DADS defines adversary as: A theoretical agent that uses information about the past moves of an on-line algorithm to choose inputs that force the worst-case cost of the algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ahocorasick","kind":"method","label":"Aho-Corasick","sources":[{"id":"nist-dads.ahocorasick","title":"NIST Dictionary of Algorithms and Data Structures: ahoCorasick","url":"https://xlinux.nist.gov/dads/HTML/ahoCorasick.html"}],"status":"reported","summary":"NIST DADS defines Aho-Corasick as: A multiple string matching algorithm that constructs a finite state machine from a pattern (list of keywords), then uses the machine to locate all occurrences of the keywords in a body of text.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.algorithmfgk","kind":"method","label":"algorithm FGK","sources":[{"id":"nist-dads.algorithmfgk","title":"NIST Dictionary of Algorithms and Data Structures: algorithmFGK","url":"https://xlinux.nist.gov/dads/HTML/algorithmFGK.html"}],"status":"reported","summary":"NIST DADS defines algorithm FGK as: An adaptive Huffman coding scheme. Coding is never much worse than twice optimal .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.allsimplepaths","kind":"concept","label":"all simple paths","sources":[{"id":"nist-dads.allsimplepaths","title":"NIST Dictionary of Algorithms and Data Structures: allSimplePaths","url":"https://xlinux.nist.gov/dads/HTML/allSimplePaths.html"}],"status":"reported","summary":"NIST DADS defines all simple paths as: Find all simple paths from a starting vertex ( source ) to a destination vertex ( sink ) in a directed graph . In an undirected graph , find all simple paths between two vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alphabet","kind":"concept","label":"alphabet","sources":[{"id":"nist-dads.alphabet","title":"NIST Dictionary of Algorithms and Data Structures: alphabet","url":"https://xlinux.nist.gov/dads/HTML/alphabet.html"}],"status":"reported","summary":"NIST DADS defines alphabet as: The set of all possible symbols in an application. For instance, input characters used by a finite state machine , letters making up strings in a language , or symbols in a pattern element . In some cases, an alphabet may be infinite.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alternation","kind":"concept","label":"alternation","sources":[{"id":"nist-dads.alternation","title":"NIST Dictionary of Algorithms and Data Structures: alternation","url":"https://xlinux.nist.gov/dads/HTML/alternation.html"}],"status":"reported","summary":"NIST DADS defines alternation as: A model of computation proposed by A. K. Chandra, L. Stockmeyere, and D. Kozen, which has two kinds of states, AND and OR. The definition of accepting computation is adjusted accordingly.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alternatngtr","kind":"concept","label":"alternating Turing machine","sources":[{"id":"nist-dads.alternatngtr","title":"NIST Dictionary of Algorithms and Data Structures: alternatngTr","url":"https://xlinux.nist.gov/dads/HTML/alternatngTr.html"}],"status":"reported","summary":"NIST DADS defines alternating Turing machine as: A nondeterministic Turing machine having universal states , from which the machine accepts only if all possible moves out of that state lead to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.alterntngpth","kind":"concept","label":"alternating path","sources":[{"id":"nist-dads.alterntngpth","title":"NIST Dictionary of Algorithms and Data Structures: alterntngpth","url":"https://xlinux.nist.gov/dads/HTML/alterntngpth.html"}],"status":"reported","summary":"NIST DADS defines alternating path as: A path with alternating free and matched edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.americanflagsort","kind":"method","label":"American flag sort","sources":[{"id":"nist-dads.americanflagsort","title":"NIST Dictionary of Algorithms and Data Structures: americanFlagSort","url":"https://xlinux.nist.gov/dads/HTML/americanFlagSort.html"}],"status":"reported","summary":"NIST DADS defines American flag sort as: An efficient, in-place variant of radix sort that distributes items into hundreds of buckets . The first step counts the number of items in each bucket, and the second step computes where each bucket will start in the array. The last step cyclically permutes items to their proper bucket. Since the buckets are in order in the array, there is no collection step. The name comes by analogy with the Dutch national flag problem in the last step: efficiently partition the array into many \"stripes\". Using some efficiency techniques, it is twice as fast as quicksort for large sets of strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.amortizdcost","kind":"concept","label":"amortized cost","sources":[{"id":"nist-dads.amortizdcost","title":"NIST Dictionary of Algorithms and Data Structures: amortizdcost","url":"https://xlinux.nist.gov/dads/HTML/amortizdcost.html"}],"status":"reported","summary":"NIST DADS defines amortized cost as: The theoretical speed of a given set of operations. It is O(f(n)) when the execution time of the worst case of all sequences of n operations never exceeds O(n*f(n)).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ancestor","kind":"concept","label":"ancestor","sources":[{"id":"nist-dads.ancestor","title":"NIST Dictionary of Algorithms and Data Structures: ancestor","url":"https://xlinux.nist.gov/dads/HTML/ancestor.html"}],"status":"reported","summary":"NIST DADS defines ancestor as: A parent of a node in a tree , the parent of the parent, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.and","kind":"concept","label":"and","sources":[{"id":"nist-dads.and","title":"NIST Dictionary of Algorithms and Data Structures: and","url":"https://xlinux.nist.gov/dads/HTML/and.html"}],"status":"reported","summary":"NIST DADS defines and as: Conjunction: 0 AND 0 = 0, 0 AND 1 = 0, 1 AND 0 = 0, 1 AND 1 = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ansi","kind":"concept","label":"ANSI","sources":[{"id":"nist-dads.ansi","title":"NIST Dictionary of Algorithms and Data Structures: ansi","url":"https://xlinux.nist.gov/dads/HTML/ansi.html"}],"status":"reported","summary":"NIST DADS defines ANSI as: American National Standards Institute.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.antichain","kind":"concept","label":"antichain","sources":[{"id":"nist-dads.antichain","title":"NIST Dictionary of Algorithms and Data Structures: antichain","url":"https://xlinux.nist.gov/dads/HTML/antichain.html"}],"status":"reported","summary":"NIST DADS defines antichain as: A subset of mutually incomparable elements in a poset .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.antisymmetric","kind":"concept","label":"antisymmetric","sources":[{"id":"nist-dads.antisymmetric","title":"NIST Dictionary of Algorithms and Data Structures: antisymmetric","url":"https://xlinux.nist.gov/dads/HTML/antisymmetric.html"}],"status":"reported","summary":"NIST DADS defines antisymmetric as: A binary relation R for which a R b and b R a implies a = b.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.approximatin","kind":"method","label":"approximation algorithm","sources":[{"id":"nist-dads.approximatin","title":"NIST Dictionary of Algorithms and Data Structures: approximatin","url":"https://xlinux.nist.gov/dads/HTML/approximatin.html"}],"status":"reported","summary":"NIST DADS defines approximation algorithm as: An algorithm to solve an optimization problem that runs in polynomial time in the length of the input and outputs a solution that is guaranteed to be close to the optimal solution . \"Close\" has some well-defined sense called the performance guarantee .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arborescence","kind":"concept","label":"arborescence","sources":[{"id":"nist-dads.arborescence","title":"NIST Dictionary of Algorithms and Data Structures: arborescence","url":"https://xlinux.nist.gov/dads/HTML/arborescence.html"}],"status":"reported","summary":"NIST DADS defines arborescence as: Informally, a directed tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arrayindex","kind":"concept","label":"array index","sources":[{"id":"nist-dads.arrayindex","title":"NIST Dictionary of Algorithms and Data Structures: arrayindex","url":"https://xlinux.nist.gov/dads/HTML/arrayindex.html"}],"status":"reported","summary":"NIST DADS defines array index as: The location of an item in an array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.arraymerg","kind":"method","label":"array merging","sources":[{"id":"nist-dads.arraymerg","title":"NIST Dictionary of Algorithms and Data Structures: arraymerg","url":"https://xlinux.nist.gov/dads/HTML/arraymerg.html"}],"status":"reported","summary":"NIST DADS defines array merging as: Joining two arrays into one.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.arraysearch","kind":"concept","label":"array search","sources":[{"id":"nist-dads.arraysearch","title":"NIST Dictionary of Algorithms and Data Structures: arraysearch","url":"https://xlinux.nist.gov/dads/HTML/arraysearch.html"}],"status":"reported","summary":"NIST DADS defines array search as: Find an element in an array . Various algorithms exist which require more or less structure in the array elements or implementation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.assignment","kind":"concept","label":"assignment problem","sources":[{"id":"nist-dads.assignment","title":"NIST Dictionary of Algorithms and Data Structures: assignment","url":"https://xlinux.nist.gov/dads/HTML/assignment.html"}],"status":"reported","summary":"NIST DADS defines assignment problem as: The problem of finding a maximum (or minimum) weight matching in a weighted , bipartite graph . Also known as marriage problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.assocarray","kind":"concept","label":"associative array","sources":[{"id":"nist-dads.assocarray","title":"NIST Dictionary of Algorithms and Data Structures: assocarray","url":"https://xlinux.nist.gov/dads/HTML/assocarray.html"}],"status":"reported","summary":"NIST DADS defines associative array as: A collection of items that are randomly accessible by a key , often a string .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.associative","kind":"concept","label":"associative","sources":[{"id":"nist-dads.associative","title":"NIST Dictionary of Algorithms and Data Structures: associative","url":"https://xlinux.nist.gov/dads/HTML/associative.html"}],"status":"reported","summary":"NIST DADS defines associative as: A function where f(A, f(B, C)) = f(f(A, B), C).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptoticspacecomplexity","kind":"concept","label":"asymptotic space complexity","sources":[{"id":"nist-dads.asymptoticspacecomplexity","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticSpaceComplexity","url":"https://xlinux.nist.gov/dads/HTML/asymptoticSpaceComplexity.html"}],"status":"reported","summary":"NIST DADS defines asymptotic space complexity as: The limiting behavior of the use of memory space of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.asymptotictimecomplexity","kind":"concept","label":"asymptotic time complexity","sources":[{"id":"nist-dads.asymptotictimecomplexity","title":"NIST Dictionary of Algorithms and Data Structures: asymptoticTimeComplexity","url":"https://xlinux.nist.gov/dads/HTML/asymptoticTimeComplexity.html"}],"status":"reported","summary":"NIST DADS defines asymptotic time complexity as: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.augmentngpth","kind":"concept","label":"augmenting path","sources":[{"id":"nist-dads.augmentngpth","title":"NIST Dictionary of Algorithms and Data Structures: augmentngpth","url":"https://xlinux.nist.gov/dads/HTML/augmentngpth.html"}],"status":"reported","summary":"NIST DADS defines augmenting path as: A path with alternating free and matched edges that begins and ends with free vertices . Used to augment (improve or increase) a matching or flow .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.averagecasecost","kind":"concept","label":"average-case cost","sources":[{"id":"nist-dads.averagecasecost","title":"NIST Dictionary of Algorithms and Data Structures: averageCaseCost","url":"https://xlinux.nist.gov/dads/HTML/averageCaseCost.html"}],"status":"reported","summary":"NIST DADS defines average-case cost as: The sum of costs of an algorithm over all possible inputs divided by the number of possible inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.averagecase","kind":"concept","label":"average case","sources":[{"id":"nist-dads.averagecase","title":"NIST Dictionary of Algorithms and Data Structures: averagecase","url":"https://xlinux.nist.gov/dads/HTML/averagecase.html"}],"status":"reported","summary":"NIST DADS defines average case as: Having to do with the mathematical average of all cases.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.axiomaticsemantics","kind":"concept","label":"axiomatic semantics","sources":[{"id":"nist-dads.axiomaticsemantics","title":"NIST Dictionary of Algorithms and Data Structures: axiomaticSemantics","url":"https://xlinux.nist.gov/dads/HTML/axiomaticSemantics.html"}],"status":"reported","summary":"NIST DADS defines axiomatic semantics as: Defining the behavior of an abstract data type with axioms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bag","kind":"concept","label":"bag","sources":[{"id":"nist-dads.bag","title":"NIST Dictionary of Algorithms and Data Structures: bag","url":"https://xlinux.nist.gov/dads/HTML/bag.html"}],"status":"reported","summary":"NIST DADS defines bag as: An unordered collection of values that may have duplicates. Formal Definition: A bag has a single query function, numberIn(v, B), which tells how many copies of an element are in the bag, and two modifier functions, add(v, B) and remove(v, B). These may be defined with axiomatic semantics as follows. new() returns a bag numberIn(v, new()) = 0 numberIn(v, add(v, B)) = 1 + numberIn(v, B) numberIn(v, add(u, B)) = numberIn(v, B) if v ≠ u remove(v, new()) = new() remove(v, add(v, B)) = B remove(v, add(u, B)) = add(u, remove(v, B)) if v ≠ u where B is a bag and u and v are elements. The predicate isEmpty(B) may be defined with the following additional axioms. isEmpty(new()) = true isEmpty(add(v, B)) = false Also known as multi-set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balanc2wayms","kind":"method","label":"balanced two-way merge sort","sources":[{"id":"nist-dads.balanc2wayms","title":"NIST Dictionary of Algorithms and Data Structures: balanc2wayms","url":"https://xlinux.nist.gov/dads/HTML/balanc2wayms.html"}],"status":"reported","summary":"NIST DADS defines balanced two-way merge sort as: A balanced k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It then repeatedly merges the two streams and puts each merged run into one of two output streams until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balance","kind":"concept","label":"balance","sources":[{"id":"nist-dads.balance","title":"NIST Dictionary of Algorithms and Data Structures: balance","url":"https://xlinux.nist.gov/dads/HTML/balance.html"}],"status":"reported","summary":"NIST DADS defines balance as: The (weight) balance of a tree is the number of leaves of the left subtree of a tree, denoted |T l |, divided by the total number of leaves of the tree. Formally, ρ(T) = |T l |/|T|. Also known as root balance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedbist","kind":"concept","label":"balanced binary search tree","sources":[{"id":"nist-dads.balancedbist","title":"NIST Dictionary of Algorithms and Data Structures: balancedbist","url":"https://xlinux.nist.gov/dads/HTML/balancedbist.html"}],"status":"reported","summary":"NIST DADS defines balanced binary search tree as: A binary search tree that is balanced .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balancedqsrt","kind":"method","label":"balanced quicksort","sources":[{"id":"nist-dads.balancedqsrt","title":"NIST Dictionary of Algorithms and Data Structures: balancedqsrt","url":"https://xlinux.nist.gov/dads/HTML/balancedqsrt.html"}],"status":"reported","summary":"NIST DADS defines balanced quicksort as: A variant of quicksort which attempts to choose a pivot likely to represent the middle of the values to be sorted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.balancedtree","kind":"concept","label":"balanced tree","sources":[{"id":"nist-dads.balancedtree","title":"NIST Dictionary of Algorithms and Data Structures: balancedtree","url":"https://xlinux.nist.gov/dads/HTML/balancedtree.html"}],"status":"reported","summary":"NIST DADS defines balanced tree as: A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of \"much farther\" and different amounts of work to keep them balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balanckwayms","kind":"method","label":"balanced k-way merge sort","sources":[{"id":"nist-dads.balanckwayms","title":"NIST Dictionary of Algorithms and Data Structures: balanckwayms","url":"https://xlinux.nist.gov/dads/HTML/balanckwayms.html"}],"status":"reported","summary":"NIST DADS defines balanced k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It then repeatedly merges the k streams and puts each merged run into one of j output streams until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.balancmrgsrt","kind":"method","label":"balanced merge sort","sources":[{"id":"nist-dads.balancmrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: balancmrgsrt","url":"https://xlinux.nist.gov/dads/HTML/balancmrgsrt.html"}],"status":"reported","summary":"NIST DADS defines balanced merge sort as: A k-way merge sort in which the number of input and output data streams is the same. See balanced k-way merge sort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bangfile","kind":"concept","label":"BANG file","sources":[{"id":"nist-dads.bangfile","title":"NIST Dictionary of Algorithms and Data Structures: bangfile","url":"https://xlinux.nist.gov/dads/HTML/bangfile.html"}],"status":"reported","summary":"NIST DADS defines BANG file as: A balanced and nested grid (BANG) file is a point access method that divides space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Cells may intersect, and points may be distributed between them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.baumwelch","kind":"method","label":"Baum Welch algorithm","sources":[{"id":"nist-dads.baumwelch","title":"NIST Dictionary of Algorithms and Data Structures: baumWelch","url":"https://xlinux.nist.gov/dads/HTML/baumWelch.html"}],"status":"reported","summary":"NIST DADS defines Baum Welch algorithm as: An algorithm to find hidden Markov model parameters A, B, and Π with the maximum likelihood of generating the given symbol sequence in the observation vector.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bbalphatree","kind":"concept","label":"BB(α) tree","sources":[{"id":"nist-dads.bbalphatree","title":"NIST Dictionary of Algorithms and Data Structures: bbalphatree","url":"https://xlinux.nist.gov/dads/HTML/bbalphatree.html"}],"status":"reported","summary":"NIST DADS defines BB(α) tree as: A binary tree where the balance of every subtree, ρ(T'), is bounded by α ≤ ρ(T') ≤ 1-α. Also known as weight-balanced tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bbp","kind":"method","label":"BBP algorithm","sources":[{"id":"nist-dads.bbp","title":"NIST Dictionary of Algorithms and Data Structures: bbp","url":"https://xlinux.nist.gov/dads/HTML/bbp.html"}],"status":"reported","summary":"NIST DADS defines BBP algorithm as: Compute the nth hexadecimal digit of π efficiently, without having to compute preceding digits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bdd","kind":"concept","label":"BDD","sources":[{"id":"nist-dads.bdd","title":"NIST Dictionary of Algorithms and Data Structures: bdd","url":"https://xlinux.nist.gov/dads/HTML/bdd.html"}],"status":"reported","summary":"NIST DADS defines BDD as: A binary lattice data structure that succinctly represents a truth table by collapsing redundant nodes and eliminating unnecessary nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bdtree","kind":"concept","label":"BD-tree","sources":[{"id":"nist-dads.bdtree","title":"NIST Dictionary of Algorithms and Data Structures: bdtree","url":"https://xlinux.nist.gov/dads/HTML/bdtree.html"}],"status":"reported","summary":"NIST DADS defines BD-tree as: A binary tree that organizes multidimensional points by splitting off regular subintervals.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bestcase","kind":"concept","label":"best case","sources":[{"id":"nist-dads.bestcase","title":"NIST Dictionary of Algorithms and Data Structures: bestcase","url":"https://xlinux.nist.gov/dads/HTML/bestcase.html"}],"status":"reported","summary":"NIST DADS defines best case as: (1) The situation or input for which an algorithm or data structure takes the least time or resources. (2) Having to do with this situation or input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bestcasecost","kind":"concept","label":"best-case cost","sources":[{"id":"nist-dads.bestcasecost","title":"NIST Dictionary of Algorithms and Data Structures: bestcasecost","url":"https://xlinux.nist.gov/dads/HTML/bestcasecost.html"}],"status":"reported","summary":"NIST DADS defines best-case cost as: The minimum cost to process an input sequence. Also known as optimal cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bestfirst","kind":"method","label":"best-first search","sources":[{"id":"nist-dads.bestfirst","title":"NIST Dictionary of Algorithms and Data Structures: bestfirst","url":"https://xlinux.nist.gov/dads/HTML/bestfirst.html"}],"status":"reported","summary":"NIST DADS defines best-first search as: A state-space search algorithm that considers the estimated best partial solution next. This is typically implemented with a priority queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.biconnectedcomponent","kind":"concept","label":"biconnected component","sources":[{"id":"nist-dads.biconnectedcomponent","title":"NIST Dictionary of Algorithms and Data Structures: biconnectedComponent","url":"https://xlinux.nist.gov/dads/HTML/biconnectedComponent.html"}],"status":"reported","summary":"NIST DADS defines biconnected component as: A maximal subset of edges of a connected graph such that the corresponding induced subgraph cannot be disconnected by deleting any vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.biconnectedgraph","kind":"concept","label":"biconnected graph","sources":[{"id":"nist-dads.biconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: biconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/biconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines biconnected graph as: A connected graph that is not broken into disconnected pieces by deleting any single vertex (and incident edges ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bidirectionalbubblesort","kind":"method","label":"bidirectional bubble sort","sources":[{"id":"nist-dads.bidirectionalbubblesort","title":"NIST Dictionary of Algorithms and Data Structures: bidirectionalBubbleSort","url":"https://xlinux.nist.gov/dads/HTML/bidirectionalBubbleSort.html"}],"status":"reported","summary":"NIST DADS defines bidirectional bubble sort as: A variant of bubble sort that compares each adjacent pair of items in a list in turn, swapping them if necessary, and alternately passes through the list from the beginning to the end then from the end to the beginning. It stops when a pass does no swaps. Also known as cocktail shaker sort, shaker sort, double-direction bubble sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binarypriorityqueue","kind":"concept","label":"binary priority queue","sources":[{"id":"nist-dads.binarypriorityqueue","title":"NIST Dictionary of Algorithms and Data Structures: binaryPriorityQueue","url":"https://xlinux.nist.gov/dads/HTML/binaryPriorityQueue.html"}],"status":"reported","summary":"NIST DADS defines binary priority queue as: A priority queue implemented with a binary tree having the following restrictions: The key of a node is greater than keys of its children , i.e., it has the heap property . If the right subtree is not empty, the left subtree is not empty. If there are both left and right children, the left child's key is greater than the right child's key.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryrelation","kind":"concept","label":"binary relation","sources":[{"id":"nist-dads.binaryrelation","title":"NIST Dictionary of Algorithms and Data Structures: binaryRelation","url":"https://xlinux.nist.gov/dads/HTML/binaryRelation.html"}],"status":"reported","summary":"NIST DADS defines binary relation as: A relation between exactly two items at a time, such as \"greater than\" (>), \"not equal to\" (≠), \"proper subset of\" (⊂), or \"is connected to\" (has an edge to) for vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binaryfunc","kind":"concept","label":"binary function","sources":[{"id":"nist-dads.binaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: binaryfunc","url":"https://xlinux.nist.gov/dads/HTML/binaryfunc.html"}],"status":"reported","summary":"NIST DADS defines binary function as: A function with two arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.binaryinsort","kind":"method","label":"binary insertion sort","sources":[{"id":"nist-dads.binaryinsort","title":"NIST Dictionary of Algorithms and Data Structures: binaryinsort","url":"https://xlinux.nist.gov/dads/HTML/binaryinsort.html"}],"status":"reported","summary":"NIST DADS defines binary insertion sort as: Insertion sort in which the proper location for the next item is found with a binary search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bingosort","kind":"method","label":"bingo sort","sources":[{"id":"nist-dads.bingosort","title":"NIST Dictionary of Algorithms and Data Structures: bingosort","url":"https://xlinux.nist.gov/dads/HTML/bingosort.html"}],"status":"reported","summary":"NIST DADS defines bingo sort as: A variant of selection sort that orders items by first finding the least value, then repeatedly moving all items with that value to their final location and find the least value for the next pass. This is more efficient than selection sort if there are many duplicate values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.binpacking","kind":"concept","label":"bin packing problem","sources":[{"id":"nist-dads.binpacking","title":"NIST Dictionary of Algorithms and Data Structures: binpacking","url":"https://xlinux.nist.gov/dads/HTML/binpacking.html"}],"status":"reported","summary":"NIST DADS defines bin packing problem as: Determine how to put the most objects in the least number of fixed space bins. More formally, find a partition and assignment of a set of objects such that a constraint is satisfied or an objective function is minimized (or maximized). There are many variants, such as, 3D, 2D, linear, pack by volume, pack by weight, minimize volume, maximize value, fixed shape objects, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bipartmatch","kind":"concept","label":"bipartite matching","sources":[{"id":"nist-dads.bipartmatch","title":"NIST Dictionary of Algorithms and Data Structures: bipartmatch","url":"https://xlinux.nist.gov/dads/HTML/bipartmatch.html"}],"status":"reported","summary":"NIST DADS defines bipartite matching as: (1) A perfect matching between vertices of a bipartite graph , that is, a subgraph that pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching. Also known as maximum bipartite matching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bitvector","kind":"concept","label":"bit vector","sources":[{"id":"nist-dads.bitvector","title":"NIST Dictionary of Algorithms and Data Structures: bitVector","url":"https://xlinux.nist.gov/dads/HTML/bitVector.html"}],"status":"reported","summary":"NIST DADS defines bit vector as: An array of bits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.blindsort","kind":"method","label":"blind sort","sources":[{"id":"nist-dads.blindsort","title":"NIST Dictionary of Algorithms and Data Structures: blindSort","url":"https://xlinux.nist.gov/dads/HTML/blindSort.html"}],"status":"reported","summary":"NIST DADS defines blind sort as: A specialized sort algorithm that first builds a blind trie , then traverse the tree left to right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blindtrie","kind":"concept","label":"blind trie","sources":[{"id":"nist-dads.blindtrie","title":"NIST Dictionary of Algorithms and Data Structures: blindTrie","url":"https://xlinux.nist.gov/dads/HTML/blindTrie.html"}],"status":"reported","summary":"NIST DADS defines blind trie as: A specialized Patricia tree whose internal nodes store only an integer, k, which is the length of the common prefix of the strings in the children . Equivalently, the strings first differ in the (k+1) st character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.block","kind":"concept","label":"block","sources":[{"id":"nist-dads.block","title":"NIST Dictionary of Algorithms and Data Structures: block","url":"https://xlinux.nist.gov/dads/HTML/block.html"}],"status":"reported","summary":"NIST DADS defines block as: (1) A number of items which are handled together for efficiency. (2) A sequence of don't care symbols.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blockaddressingindex","kind":"concept","label":"block addressing index","sources":[{"id":"nist-dads.blockaddressingindex","title":"NIST Dictionary of Algorithms and Data Structures: blockAddressingIndex","url":"https://xlinux.nist.gov/dads/HTML/blockAddressingIndex.html"}],"status":"reported","summary":"NIST DADS defines block addressing index as: An inverted index that includes the block , or general location, within texts, in addition to the text in which the word appears.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blockingflow","kind":"concept","label":"blocking flow","sources":[{"id":"nist-dads.blockingflow","title":"NIST Dictionary of Algorithms and Data Structures: blockingflow","url":"https://xlinux.nist.gov/dads/HTML/blockingflow.html"}],"status":"reported","summary":"NIST DADS defines blocking flow as: A flow function in which any directed path from the source to the sink contains a saturated edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bloomfilter","kind":"concept","label":"Bloom filter","sources":[{"id":"nist-dads.bloomfilter","title":"NIST Dictionary of Algorithms and Data Structures: bloomFilter","url":"https://xlinux.nist.gov/dads/HTML/bloomFilter.html"}],"status":"reported","summary":"NIST DADS defines Bloom filter as: A data structure with a probabilistic algorithm to quickly test membership in a large set using multiple hash functions into a single array of bits.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.blossom","kind":"concept","label":"blossom","sources":[{"id":"nist-dads.blossom","title":"NIST Dictionary of Algorithms and Data Structures: blossom","url":"https://xlinux.nist.gov/dads/HTML/blossom.html"}],"status":"reported","summary":"NIST DADS defines blossom as: An odd length cycle which appears during a matching algorithm on general graphs .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bogosort","kind":"method","label":"bogosort","sources":[{"id":"nist-dads.bogosort","title":"NIST Dictionary of Algorithms and Data Structures: bogosort","url":"https://xlinux.nist.gov/dads/HTML/bogosort.html"}],"status":"reported","summary":"NIST DADS defines bogosort as: A terribly inefficient sort algorithm that repeatedly generates a random permutation of the items until the items are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boolean","kind":"concept","label":"boolean","sources":[{"id":"nist-dads.boolean","title":"NIST Dictionary of Algorithms and Data Structures: boolean","url":"https://xlinux.nist.gov/dads/HTML/boolean.html"}],"status":"reported","summary":"NIST DADS defines boolean as: (1) In computer science, entities having just two values: 1 or 0, true or false, on or off, etc. along with the operations and , or , and not . (2) In mathematics, entities from an algebra equivalent to intersection , union , and complement over subsets of a given set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.booleanexpr","kind":"concept","label":"boolean expression","sources":[{"id":"nist-dads.booleanexpr","title":"NIST Dictionary of Algorithms and Data Structures: booleanexpr","url":"https://xlinux.nist.gov/dads/HTML/booleanexpr.html"}],"status":"reported","summary":"NIST DADS defines boolean expression as: An expression consisting solely of boolean variables and values and boolean operations, such as and , or , not , implies , etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.booleanfnctn","kind":"concept","label":"boolean function","sources":[{"id":"nist-dads.booleanfnctn","title":"NIST Dictionary of Algorithms and Data Structures: booleanfnctn","url":"https://xlinux.nist.gov/dads/HTML/booleanfnctn.html"}],"status":"reported","summary":"NIST DADS defines boolean function as: A function whose range is {0, 1}. It can be understood to evaluate the truth or falsity of each element of its domain .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.border","kind":"concept","label":"border","sources":[{"id":"nist-dads.border","title":"NIST Dictionary of Algorithms and Data Structures: border","url":"https://xlinux.nist.gov/dads/HTML/border.html"}],"status":"reported","summary":"NIST DADS defines border as: A string v which is both a prefix and a suffix of another string u. String v is the border of u if it is the longest proper border of u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boruvkasalgorithm","kind":"method","label":"Boruvka's algorithm","sources":[{"id":"nist-dads.boruvkasalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: boruvkasAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/boruvkasAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Boruvka's algorithm as: Compute a minimum spanning tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bottlenecktravelingsales","kind":"concept","label":"bottleneck traveling salesman","sources":[{"id":"nist-dads.bottlenecktravelingsales","title":"NIST Dictionary of Algorithms and Data Structures: bottleneckTravelingSales","url":"https://xlinux.nist.gov/dads/HTML/bottleneckTravelingSales.html"}],"status":"reported","summary":"NIST DADS defines bottleneck traveling salesman as: Find a tour where no edge is more costly than some (bottleneck) amount.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundarybasd","kind":"concept","label":"boundary-based representation","sources":[{"id":"nist-dads.boundarybasd","title":"NIST Dictionary of Algorithms and Data Structures: boundarybasd","url":"https://xlinux.nist.gov/dads/HTML/boundarybasd.html"}],"status":"reported","summary":"NIST DADS defines boundary-based representation as: A representation of a region that is based on its boundary.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundedqueue","kind":"concept","label":"bounded queue","sources":[{"id":"nist-dads.boundedqueue","title":"NIST Dictionary of Algorithms and Data Structures: boundedqueue","url":"https://xlinux.nist.gov/dads/HTML/boundedqueue.html"}],"status":"reported","summary":"NIST DADS defines bounded queue as: A queue limited to a fixed number of items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.boundedstack","kind":"concept","label":"bounded stack","sources":[{"id":"nist-dads.boundedstack","title":"NIST Dictionary of Algorithms and Data Structures: boundedstack","url":"https://xlinux.nist.gov/dads/HTML/boundedstack.html"}],"status":"reported","summary":"NIST DADS defines bounded stack as: A stack limited to a fixed number of items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.boyermoorehorspool","kind":"method","label":"Boyer-Moore-Horspool","sources":[{"id":"nist-dads.boyermoorehorspool","title":"NIST Dictionary of Algorithms and Data Structures: boyerMooreHorspool","url":"https://xlinux.nist.gov/dads/HTML/boyerMooreHorspool.html"}],"status":"reported","summary":"NIST DADS defines Boyer-Moore-Horspool as: A string matching algorithm that compares characters from the end of the pattern to its beginning. When characters don't match, searching jumps to the next matching position in the pattern. Also known as Horspool.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bozosort","kind":"method","label":"bozo sort","sources":[{"id":"nist-dads.bozosort","title":"NIST Dictionary of Algorithms and Data Structures: bozoSort","url":"https://xlinux.nist.gov/dads/HTML/bozoSort.html"}],"status":"reported","summary":"NIST DADS defines bozo sort as: A terribly inefficient sort algorithm that randomly swaps items until they are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bpp","kind":"concept","label":"BPP","sources":[{"id":"nist-dads.bpp","title":"NIST Dictionary of Algorithms and Data Structures: bpp","url":"https://xlinux.nist.gov/dads/HTML/bpp.html"}],"status":"reported","summary":"NIST DADS defines BPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with the right answer (accept or reject) at least 2/3 of the time. \"BPP\" means \" B ounded error P robability in P olynomial\" time. Also known as bounded error probability in polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bradfordslaw","kind":"concept","label":"Bradford's law","sources":[{"id":"nist-dads.bradfordslaw","title":"NIST Dictionary of Algorithms and Data Structures: bradfordsLaw","url":"https://xlinux.nist.gov/dads/HTML/bradfordsLaw.html"}],"status":"reported","summary":"NIST DADS defines Bradford's law as: Journals in a field can be divided into three parts, each with about one-third of all articles: 1) a core of a few journals, 2) a second zone, with more journals, and 3) a third zone, with the bulk of journals. The number of journals is 1:n:n².","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bresenham","kind":"method","label":"Bresenham's algorithm","sources":[{"id":"nist-dads.bresenham","title":"NIST Dictionary of Algorithms and Data Structures: bresenham","url":"https://xlinux.nist.gov/dads/HTML/bresenham.html"}],"status":"reported","summary":"NIST DADS defines Bresenham's algorithm as: An efficient algorithm to render a line with pixels. The long dimension is incremented for each pixel, and the fractional slope is accumulated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bridge","kind":"concept","label":"bridge","sources":[{"id":"nist-dads.bridge","title":"NIST Dictionary of Algorithms and Data Structures: bridge","url":"https://xlinux.nist.gov/dads/HTML/bridge.html"}],"status":"reported","summary":"NIST DADS defines bridge as: An edge of a connected graph whose removal would make the graph unconnected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.britishmuseum","kind":"method","label":"British Museum technique","sources":[{"id":"nist-dads.britishmuseum","title":"NIST Dictionary of Algorithms and Data Structures: britishMuseum","url":"https://xlinux.nist.gov/dads/HTML/britishMuseum.html"}],"status":"reported","summary":"NIST DADS defines British Museum technique as: Find a solution by checking all possibilities one by one, beginning with the smallest. This is a conceptual, not a practical, technique where the number of possibilities are enormous.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforcestrsrchwmismatch","kind":"method","label":"brute force string search with mismatches","sources":[{"id":"nist-dads.bruteforcestrsrchwmismatch","title":"NIST Dictionary of Algorithms and Data Structures: bruteForceStrSrchwMismatch","url":"https://xlinux.nist.gov/dads/HTML/bruteForceStrSrchwMismatch.html"}],"status":"reported","summary":"NIST DADS defines brute force string search with mismatches as: Beginning with the (leftmost) position in a string and trying each position in turn, find the number of characters for which the pattern and the substring beginning at that position don't match (the Hamming distance ). Return the first position with k or fewer mismatches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforcestringsearch","kind":"method","label":"brute force string search","sources":[{"id":"nist-dads.bruteforcestringsearch","title":"NIST Dictionary of Algorithms and Data Structures: bruteForceStringSearch","url":"https://xlinux.nist.gov/dads/HTML/bruteForceStringSearch.html"}],"status":"reported","summary":"NIST DADS defines brute force string search as: Find a string in another string or body of text by trying each position one at a time. There are many far faster string matching algorithms. Also known as naive string search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.bruteforce","kind":"method","label":"brute force","sources":[{"id":"nist-dads.bruteforce","title":"NIST Dictionary of Algorithms and Data Structures: bruteforce","url":"https://xlinux.nist.gov/dads/HTML/bruteforce.html"}],"status":"reported","summary":"NIST DADS defines brute force as: An algorithm that inefficiently solves a problem, often by trying every one of a wide range of possible solutions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bsptree","kind":"concept","label":"BSP-tree","sources":[{"id":"nist-dads.bsptree","title":"NIST Dictionary of Algorithms and Data Structures: bsptree","url":"https://xlinux.nist.gov/dads/HTML/bsptree.html"}],"status":"reported","summary":"NIST DADS defines BSP-tree as: A binary space partitioning (BSP) tree is a binary tree for multidimensional points where successive levels are split by arbitrary hyperplanes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bstartree","kind":"concept","label":"B*-tree","sources":[{"id":"nist-dads.bstartree","title":"NIST Dictionary of Algorithms and Data Structures: bstartree","url":"https://xlinux.nist.gov/dads/HTML/bstartree.html"}],"status":"reported","summary":"NIST DADS defines B*-tree as: A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bucket","kind":"concept","label":"bucket","sources":[{"id":"nist-dads.bucket","title":"NIST Dictionary of Algorithms and Data Structures: bucket","url":"https://xlinux.nist.gov/dads/HTML/bucket.html"}],"status":"reported","summary":"NIST DADS defines bucket as: An area of storage where items with a common property are stored. Typically tree data structures and sort algorithms use many buckets, one for each group of items. Usually buckets are kept on disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.buckettrie","kind":"concept","label":"bucket trie","sources":[{"id":"nist-dads.buckettrie","title":"NIST Dictionary of Algorithms and Data Structures: bucketTrie","url":"https://xlinux.nist.gov/dads/HTML/bucketTrie.html"}],"status":"reported","summary":"NIST DADS defines bucket trie as: A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bucketmeth","kind":"concept","label":"bucketing method","sources":[{"id":"nist-dads.bucketmeth","title":"NIST Dictionary of Algorithms and Data Structures: bucketmeth","url":"https://xlinux.nist.gov/dads/HTML/bucketmeth.html"}],"status":"reported","summary":"NIST DADS defines bucketing method as: Data organization methods that decompose the space from which spatial data is drawn into regions called buckets. Some conditions for the choice of region boundaries include the number of objects that they contain or on their spatial layout (e.g. minimizing overlap or coverage).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.buddysystem","kind":"method","label":"buddy system","sources":[{"id":"nist-dads.buddysystem","title":"NIST Dictionary of Algorithms and Data Structures: buddysystem","url":"https://xlinux.nist.gov/dads/HTML/buddysystem.html"}],"status":"reported","summary":"NIST DADS defines buddy system as: A memory allocation strategy which recursively divides allocatable blocks of memory into pairs of adjacent equal-sized blocks called \"buddies\".","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.buddytree","kind":"concept","label":"buddy tree","sources":[{"id":"nist-dads.buddytree","title":"NIST Dictionary of Algorithms and Data Structures: buddytree","url":"https://xlinux.nist.gov/dads/HTML/buddytree.html"}],"status":"reported","summary":"NIST DADS defines buddy tree as: A point access method which splits multidimensional space in different dimensions at each level. It also keeps a minimum bounding box of points accessible by each node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.buildheap","kind":"method","label":"build-heap","sources":[{"id":"nist-dads.buildheap","title":"NIST Dictionary of Algorithms and Data Structures: buildHeap","url":"https://xlinux.nist.gov/dads/HTML/buildHeap.html"}],"status":"reported","summary":"NIST DADS defines build-heap as: Convert an array into a heap by executing heapify progressively closer to the root . For an array of n nodes, this takes O(n) time under the comparison model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.burrowswheelertransform","kind":"method","label":"Burrows-Wheeler transform","sources":[{"id":"nist-dads.burrowswheelertransform","title":"NIST Dictionary of Algorithms and Data Structures: burrowsWheelerTransform","url":"https://xlinux.nist.gov/dads/HTML/burrowsWheelerTransform.html"}],"status":"reported","summary":"NIST DADS defines Burrows-Wheeler transform as: Permute a string . Repeated substrings lead to repeated characters in the permuted string, which is easier to compress. Knowing which character was last in the original string, the original can be reconstructed from the rearranged string. Also known as BWT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.busybeaver","kind":"concept","label":"busy beaver","sources":[{"id":"nist-dads.busybeaver","title":"NIST Dictionary of Algorithms and Data Structures: busyBeaver","url":"https://xlinux.nist.gov/dads/HTML/busyBeaver.html"}],"status":"reported","summary":"NIST DADS defines busy beaver as: (1) A Turing machine with a small number of states that halts when started with a blank tape, but writes a huge number of non-blanks or takes a huge number of steps. (2) The problem of finding the maximum number of non-blanks written or steps taken for any Turing machines with a given number of states and symbols.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.bvtree","kind":"concept","label":"BV-tree","sources":[{"id":"nist-dads.bvtree","title":"NIST Dictionary of Algorithms and Data Structures: bvtree","url":"https://xlinux.nist.gov/dads/HTML/bvtree.html"}],"status":"reported","summary":"NIST DADS defines BV-tree as: A conceptual idea which generalizes B-trees to multiple dimensions. BV-trees are not balanced, and searching may require backtracking .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.byzantine","kind":"concept","label":"Byzantine generals","sources":[{"id":"nist-dads.byzantine","title":"NIST Dictionary of Algorithms and Data Structures: byzantine","url":"https://xlinux.nist.gov/dads/HTML/byzantine.html"}],"status":"reported","summary":"NIST DADS defines Byzantine generals as: The problem of reaching a consensus among distributed units if some of them give misleading answers. To be memorable, the problem is couched in terms of generals deciding on a common plan of attack. Some traitorous generals may lie about whether they will support a particular plan and what other generals told them. Exchanging only messages, what decision making algorithm should the generals use to reach a consensus? What percentage of liars can the algorithm tolerate and still correctly determine a consensus?","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cactusstack","kind":"concept","label":"cactus stack","sources":[{"id":"nist-dads.cactusstack","title":"NIST Dictionary of Algorithms and Data Structures: cactusstack","url":"https://xlinux.nist.gov/dads/HTML/cactusstack.html"}],"status":"reported","summary":"NIST DADS defines cactus stack as: A variant of stack in which one other cactus stack may be attached to the top. An attached stack is called a \"branch.\" When a branch becomes empty, it is removed. Pop is not allowed if there is a branch. A branch is only accessible through the original reference; it is not accessible through the stack. Formal Definition: The operations new to this variant of stack, branch(S, T) and notch(v), may be defined with axiomatic semantics as follows. top(branch(S, T)) = top(S) notch(new()) = false notch(push(v, S)) = false notch(branch(S, T)) = true Also known as saguaro stack.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.calcucommsys","kind":"concept","label":"Calculus of Communicating Systems","sources":[{"id":"nist-dads.calcucommsys","title":"NIST Dictionary of Algorithms and Data Structures: calcucommsys","url":"https://xlinux.nist.gov/dads/HTML/calcucommsys.html"}],"status":"reported","summary":"NIST DADS defines Calculus of Communicating Systems as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. Commonly known as CCS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.calendarqueue","kind":"concept","label":"calendar queue","sources":[{"id":"nist-dads.calendarqueue","title":"NIST Dictionary of Algorithms and Data Structures: calendarQueue","url":"https://xlinux.nist.gov/dads/HTML/calendarQueue.html"}],"status":"reported","summary":"NIST DADS defines calendar queue as: A fast priority queue implementation having N buckets each with width w, or covering w time. An item with priority p more than current goes in bucket (p/w)%N. Choose N and w to have few items in each bucket. Keep items sorted within buckets. Double or halve N and change w if the number of items grows or shrinks a lot.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.candidate","kind":"concept","label":"candidate consistency testing","sources":[{"id":"nist-dads.candidate","title":"NIST Dictionary of Algorithms and Data Structures: candidate","url":"https://xlinux.nist.gov/dads/HTML/candidate.html"}],"status":"reported","summary":"NIST DADS defines candidate consistency testing as: The stage of two-dimensional matching where a candidate occurrence of the pattern is checked against the \"witness\" table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.candidateverification","kind":"concept","label":"candidate verification","sources":[{"id":"nist-dads.candidateverification","title":"NIST Dictionary of Algorithms and Data Structures: candidateVerification","url":"https://xlinux.nist.gov/dads/HTML/candidateVerification.html"}],"status":"reported","summary":"NIST DADS defines candidate verification as: The stage of two-dimensional matching where candidate occurrences of the pattern are actually tested.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.canonical","kind":"concept","label":"canonical complexity class","sources":[{"id":"nist-dads.canonical","title":"NIST Dictionary of Algorithms and Data Structures: canonical","url":"https://xlinux.nist.gov/dads/HTML/canonical.html"}],"status":"reported","summary":"NIST DADS defines canonical complexity class as: One of the classes defined by logarithmic , polynomial , and exponential bounds on time and space, for deterministic and nondeterministic machines. These classify most of the important computational problems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacifacloc","kind":"concept","label":"capacitated facility location","sources":[{"id":"nist-dads.capacifacloc","title":"NIST Dictionary of Algorithms and Data Structures: capacifacloc","url":"https://xlinux.nist.gov/dads/HTML/capacifacloc.html"}],"status":"reported","summary":"NIST DADS defines capacitated facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply object (points, lines, segments, etc.) which minimizes some distance objective function and no supply supports too many demand points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacity","kind":"concept","label":"capacity","sources":[{"id":"nist-dads.capacity","title":"NIST Dictionary of Algorithms and Data Structures: capacity","url":"https://xlinux.nist.gov/dads/HTML/capacity.html"}],"status":"reported","summary":"NIST DADS defines capacity as: The maximum flow that may be sent through an edge or a vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.capacitycstr","kind":"concept","label":"capacity constraint","sources":[{"id":"nist-dads.capacitycstr","title":"NIST Dictionary of Algorithms and Data Structures: capacitycstr","url":"https://xlinux.nist.gov/dads/HTML/capacitycstr.html"}],"status":"reported","summary":"NIST DADS defines capacity constraint as: The property that the flow on every edge of a flow network is no more than the edge's capacity . More formally, for all edges e, f(e) ≤ u(e), where f(e) is the flow on e and u(e) is its capacity.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.caverphone","kind":"method","label":"Caverphone","sources":[{"id":"nist-dads.caverphone","title":"NIST Dictionary of Algorithms and Data Structures: caverphone","url":"https://xlinux.nist.gov/dads/HTML/caverphone.html"}],"status":"reported","summary":"NIST DADS defines Caverphone as: An algorithm to code English names phonetically.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ccs","kind":"concept","label":"CCS","sources":[{"id":"nist-dads.ccs","title":"NIST Dictionary of Algorithms and Data Structures: ccs","url":"https://xlinux.nist.gov/dads/HTML/ccs.html"}],"status":"reported","summary":"NIST DADS defines CCS as: Robin Milner's algebraic theory to formalize the notion of concurrent computation. An acronym for Calculus of Communicating Systems.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cellprobemodel","kind":"concept","label":"cell probe model","sources":[{"id":"nist-dads.cellprobemodel","title":"NIST Dictionary of Algorithms and Data Structures: cellProbeModel","url":"https://xlinux.nist.gov/dads/HTML/cellProbeModel.html"}],"status":"reported","summary":"NIST DADS defines cell probe model as: A model of computation where the cost of a computation is measured by the total number of memory accesses to a random access memory with ⌈log n⌉ bits cell size. All other computations are not counted and are considered to be free.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.celltree","kind":"concept","label":"cell tree","sources":[{"id":"nist-dads.celltree","title":"NIST Dictionary of Algorithms and Data Structures: celltree","url":"https://xlinux.nist.gov/dads/HTML/celltree.html"}],"status":"reported","summary":"NIST DADS defines cell tree as: A spatial access method where successive levels are split by arbitrary hyperplanes. Concave objects are decomposed into convex pieces. Each convex piece is indexed in every cell which it overlaps.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cellulartmtn","kind":"concept","label":"cellular automaton","sources":[{"id":"nist-dads.cellulartmtn","title":"NIST Dictionary of Algorithms and Data Structures: cellulartmtn","url":"https://xlinux.nist.gov/dads/HTML/cellulartmtn.html"}],"status":"reported","summary":"NIST DADS defines cellular automaton as: Usually a two-dimensional organization of simple finite state machines whose next state depends on their own state and the states of their eight closest neighbors. In general the machines may be arranged in meshes of higher or lower dimension, have larger neighborhoods, or be arbitrarily complex processors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.centroid","kind":"concept","label":"centroid","sources":[{"id":"nist-dads.centroid","title":"NIST Dictionary of Algorithms and Data Structures: centroid","url":"https://xlinux.nist.gov/dads/HTML/centroid.html"}],"status":"reported","summary":"NIST DADS defines centroid as: The center of gravity or center of mass of an object.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.certificate","kind":"concept","label":"certificate","sources":[{"id":"nist-dads.certificate","title":"NIST Dictionary of Algorithms and Data Structures: certificate","url":"https://xlinux.nist.gov/dads/HTML/certificate.html"}],"status":"reported","summary":"NIST DADS defines certificate as: (1) Extra information so the correctness of an answer to a decision problem can be quickly checked. (2) For any graph property P and graph G, a certificate for G is a graph G' such that G has property P if and only if G' has the property.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chain","kind":"concept","label":"chain","sources":[{"id":"nist-dads.chain","title":"NIST Dictionary of Algorithms and Data Structures: chain","url":"https://xlinux.nist.gov/dads/HTML/chain.html"}],"status":"reported","summary":"NIST DADS defines chain as: A set with a total order .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chaining","kind":"concept","label":"chaining","sources":[{"id":"nist-dads.chaining","title":"NIST Dictionary of Algorithms and Data Structures: chaining","url":"https://xlinux.nist.gov/dads/HTML/chaining.html"}],"status":"reported","summary":"NIST DADS defines chaining as: A class of collision resolution schemes in which linked lists handle collisions in a hash table . The two main subclasses are separate chaining , where lists are outside the table, and coalesced chaining , where the lists are within the table.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.child","kind":"concept","label":"child","sources":[{"id":"nist-dads.child","title":"NIST Dictionary of Algorithms and Data Structures: child","url":"https://xlinux.nist.gov/dads/HTML/child.html"}],"status":"reported","summary":"NIST DADS defines child as: A node of a tree referred to by a parent node. See the figure at tree . Every node, except the root , is the child of some parent.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chinesepostman","kind":"concept","label":"Chinese postman problem","sources":[{"id":"nist-dads.chinesepostman","title":"NIST Dictionary of Algorithms and Data Structures: chinesePostman","url":"https://xlinux.nist.gov/dads/HTML/chinesePostman.html"}],"status":"reported","summary":"NIST DADS defines Chinese postman problem as: Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.chinesermndr","kind":"method","label":"Chinese remainder theorem","sources":[{"id":"nist-dads.chinesermndr","title":"NIST Dictionary of Algorithms and Data Structures: chineseRmndr","url":"https://xlinux.nist.gov/dads/HTML/chineseRmndr.html"}],"status":"reported","summary":"NIST DADS defines Chinese remainder theorem as: An integer n can be solved uniquely mod LCM(A(i)) , given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.christofides","kind":"method","label":"Christofides algorithm","sources":[{"id":"nist-dads.christofides","title":"NIST Dictionary of Algorithms and Data Structures: christofides","url":"https://xlinux.nist.gov/dads/HTML/christofides.html"}],"status":"reported","summary":"NIST DADS defines Christofides algorithm as: (1) A heuristic algorithm to find a near-optimal solution to the traveling salesman problem. Step 1: find a minimum spanning tree T. Step 2: find a perfect matching M among vertices with odd degree . Step 3: combine the edges of M and T to make a multigraph G. Step 4: find an Euler cycle in G. Step 5: Turn the Euler cycle into a Hamiltonian cycle by skipping vertices already seen. (2) An algorithm to find the chromatic number of a graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chromatcnmbr","kind":"concept","label":"chromatic number","sources":[{"id":"nist-dads.chromatcnmbr","title":"NIST Dictionary of Algorithms and Data Structures: chromatcnmbr","url":"https://xlinux.nist.gov/dads/HTML/chromatcnmbr.html"}],"status":"reported","summary":"NIST DADS defines chromatic number as: The minimum number of colors needed to color the vertices of a graph such that no two adjacent vertices have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.chromaticndx","kind":"concept","label":"chromatic index","sources":[{"id":"nist-dads.chromaticndx","title":"NIST Dictionary of Algorithms and Data Structures: chromaticndx","url":"https://xlinux.nist.gov/dads/HTML/chromaticndx.html"}],"status":"reported","summary":"NIST DADS defines chromatic index as: The minimum number of colors needed to color the edges of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circuit","kind":"concept","label":"circuit","sources":[{"id":"nist-dads.circuit","title":"NIST Dictionary of Algorithms and Data Structures: circuit","url":"https://xlinux.nist.gov/dads/HTML/circuit.html"}],"status":"reported","summary":"NIST DADS defines circuit as: (1) An acyclic network of inputs, logic gates, and outputs. Contrasted with a Turing machine , it has no memory. (2) A cycle in a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.circuitcomplexity","kind":"concept","label":"circuit complexity","sources":[{"id":"nist-dads.circuitcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: circuitComplexity","url":"https://xlinux.nist.gov/dads/HTML/circuitComplexity.html"}],"status":"reported","summary":"NIST DADS defines circuit complexity as: The study of the size, depth, and other attributes of circuits that decide specified languages or compute specified functions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clique","kind":"concept","label":"clique","sources":[{"id":"nist-dads.clique","title":"NIST Dictionary of Algorithms and Data Structures: clique","url":"https://xlinux.nist.gov/dads/HTML/clique.html"}],"status":"reported","summary":"NIST DADS defines clique as: A set of vertices in an undirected graph in which there is an edge between every pair of vertices. In other words, a subgraph that is complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cliqueproblm","kind":"concept","label":"clique problem","sources":[{"id":"nist-dads.cliqueproblm","title":"NIST Dictionary of Algorithms and Data Structures: cliqueproblm","url":"https://xlinux.nist.gov/dads/HTML/cliqueproblm.html"}],"status":"reported","summary":"NIST DADS defines clique problem as: Find the largest clique in an undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clustering","kind":"concept","label":"clustering","sources":[{"id":"nist-dads.clustering","title":"NIST Dictionary of Algorithms and Data Structures: clustering","url":"https://xlinux.nist.gov/dads/HTML/clustering.html"}],"status":"reported","summary":"NIST DADS defines clustering as: The tendency for entries in a hash table using open addressing to be stored together, even when the table has ample empty space to spread them out.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.clusteringfree","kind":"concept","label":"clustering free","sources":[{"id":"nist-dads.clusteringfree","title":"NIST Dictionary of Algorithms and Data Structures: clusteringFree","url":"https://xlinux.nist.gov/dads/HTML/clusteringFree.html"}],"status":"reported","summary":"NIST DADS defines clustering free as: When a collision resolution scheme spreads out entries in a hash table .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.coalescedchaining","kind":"concept","label":"coalesced chaining","sources":[{"id":"nist-dads.coalescedchaining","title":"NIST Dictionary of Algorithms and Data Structures: coalescedChaining","url":"https://xlinux.nist.gov/dads/HTML/coalescedChaining.html"}],"status":"reported","summary":"NIST DADS defines coalesced chaining as: A scheme in which linked lists within the hash table handle collisions . An item that collides is put in the next empty place in the array and added to the end of a list embedded in the array items. Any open addressing method to compute possible new positions may be used to find the \"next\" empty place.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.coarsening","kind":"concept","label":"coarsening","sources":[{"id":"nist-dads.coarsening","title":"NIST Dictionary of Algorithms and Data Structures: coarsening","url":"https://xlinux.nist.gov/dads/HTML/coarsening.html"}],"status":"reported","summary":"NIST DADS defines coarsening as: To alter a problem, typically restricting it to a less complex feasible region or objective function , so that the resulting problem can be efficiently solved, usually by dynamic programming .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.codeword","kind":"concept","label":"codeword","sources":[{"id":"nist-dads.codeword","title":"NIST Dictionary of Algorithms and Data Structures: codeword","url":"https://xlinux.nist.gov/dads/HTML/codeword.html"}],"status":"reported","summary":"NIST DADS defines codeword as: Sequence of bits of a code corresponding to a symbol.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.codingtree","kind":"concept","label":"coding tree","sources":[{"id":"nist-dads.codingtree","title":"NIST Dictionary of Algorithms and Data Structures: codingTree","url":"https://xlinux.nist.gov/dads/HTML/codingTree.html"}],"status":"reported","summary":"NIST DADS defines coding tree as: A full binary tree that represents a coding, such as produced by Huffman coding . Each leaf is an encoded symbol. The path from the root to a leaf is its codeword.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.collectiverecursion","kind":"method","label":"collective recursion","sources":[{"id":"nist-dads.collectiverecursion","title":"NIST Dictionary of Algorithms and Data Structures: collectiveRecursion","url":"https://xlinux.nist.gov/dads/HTML/collectiveRecursion.html"}],"status":"reported","summary":"NIST DADS defines collective recursion as: A special form of tail recursion , where the results are produced during the recursive calls and nothing is returned. The recursion may be optimized away by executing the call in the current stack frame, rather than creating a new stack frame, or by deallocating the entire recursion stack at once rather than a little at each return.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.collision","kind":"concept","label":"collision","sources":[{"id":"nist-dads.collision","title":"NIST Dictionary of Algorithms and Data Structures: collision","url":"https://xlinux.nist.gov/dads/HTML/collision.html"}],"status":"reported","summary":"NIST DADS defines collision as: When two or more items should be kept in the same location, especially in hash tables , that is, when two or more different keys hash to the same value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.collisionres","kind":"method","label":"collision resolution scheme","sources":[{"id":"nist-dads.collisionres","title":"NIST Dictionary of Algorithms and Data Structures: collisionres","url":"https://xlinux.nist.gov/dads/HTML/collisionres.html"}],"status":"reported","summary":"NIST DADS defines collision resolution scheme as: A way of handling collisions , that is, when two or more items should be kept in the same location, especially in a hash table . The general ways are keeping subsequent items within the table and computing possible locations ( open addressing ), keeping lists for items that collide ( chaining ), or keeping one special overflow area.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.combination","kind":"method","label":"combination","sources":[{"id":"nist-dads.combination","title":"NIST Dictionary of Algorithms and Data Structures: combination","url":"https://xlinux.nist.gov/dads/HTML/combination.html"}],"status":"reported","summary":"NIST DADS defines combination as: Choose m of n elements, where m ≤ n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.communseqpro","kind":"concept","label":"Communicating Sequential Processes","sources":[{"id":"nist-dads.communseqpro","title":"NIST Dictionary of Algorithms and Data Structures: communseqpro","url":"https://xlinux.nist.gov/dads/HTML/communseqpro.html"}],"status":"reported","summary":"NIST DADS defines Communicating Sequential Processes as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. Commonly known as CSP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.commutative","kind":"concept","label":"commutative","sources":[{"id":"nist-dads.commutative","title":"NIST Dictionary of Algorithms and Data Structures: commutative","url":"https://xlinux.nist.gov/dads/HTML/commutative.html"}],"status":"reported","summary":"NIST DADS defines commutative as: A function where f(A, B) = f(B, A).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compactdawg","kind":"concept","label":"compact DAWG","sources":[{"id":"nist-dads.compactdawg","title":"NIST Dictionary of Algorithms and Data Structures: compactDAWG","url":"https://xlinux.nist.gov/dads/HTML/compactDAWG.html"}],"status":"reported","summary":"NIST DADS defines compact DAWG as: A directed acyclic word graph (DAWG) representing the suffixes of a given string in which each edge is labeled with the longest possible string. The strings along a path from the root to a node are the substring which the node represents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compactdatastruct","kind":"concept","label":"compact data structure","sources":[{"id":"nist-dads.compactdatastruct","title":"NIST Dictionary of Algorithms and Data Structures: compactDataStruct","url":"https://xlinux.nist.gov/dads/HTML/compactDataStruct.html"}],"status":"reported","summary":"NIST DADS defines compact data structure as: A data structure that needs far less space and allows efficient access without decompression.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compacttrie","kind":"concept","label":"compact trie","sources":[{"id":"nist-dads.compacttrie","title":"NIST Dictionary of Algorithms and Data Structures: compactTrie","url":"https://xlinux.nist.gov/dads/HTML/compactTrie.html"}],"status":"reported","summary":"NIST DADS defines compact trie as: A trie in which nonbranching subtrees leading to leaf nodes are cut off.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.competitiveanalysis","kind":"concept","label":"competitive analysis","sources":[{"id":"nist-dads.competitiveanalysis","title":"NIST Dictionary of Algorithms and Data Structures: competitiveAnalysis","url":"https://xlinux.nist.gov/dads/HTML/competitiveAnalysis.html"}],"status":"reported","summary":"NIST DADS defines competitive analysis as: An analysis in which the performance of an on-line algorithm is compared to the best that could have been achieved if all the inputs had been known in advance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.competitivrt","kind":"concept","label":"competitive ratio","sources":[{"id":"nist-dads.competitivrt","title":"NIST Dictionary of Algorithms and Data Structures: competitivrt","url":"https://xlinux.nist.gov/dads/HTML/competitivrt.html"}],"status":"reported","summary":"NIST DADS defines competitive ratio as: The worst case of the ratio between the cost incurred by an on-line algorithm and the best-case cost .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complement","kind":"concept","label":"complement","sources":[{"id":"nist-dads.complement","title":"NIST Dictionary of Algorithms and Data Structures: complement","url":"https://xlinux.nist.gov/dads/HTML/complement.html"}],"status":"reported","summary":"NIST DADS defines complement as: (1) Of a boolean , 0 if 1, or 1 if 0. See not . (2) Of a set A, a set having all the members which are in the universe , but not in A.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completebinarytree","kind":"concept","label":"complete binary tree","sources":[{"id":"nist-dads.completebinarytree","title":"NIST Dictionary of Algorithms and Data Structures: completeBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/completeBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines complete binary tree as: A binary tree in which every level (depth), except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.completetree","kind":"concept","label":"complete tree","sources":[{"id":"nist-dads.completetree","title":"NIST Dictionary of Algorithms and Data Structures: completetree","url":"https://xlinux.nist.gov/dads/HTML/completetree.html"}],"status":"reported","summary":"NIST DADS defines complete tree as: A tree in which every level , except possibly the deepest, is entirely filled. At depth n, the height of the tree, all nodes are as far left as possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complexity","kind":"concept","label":"complexity","sources":[{"id":"nist-dads.complexity","title":"NIST Dictionary of Algorithms and Data Structures: complexity","url":"https://xlinux.nist.gov/dads/HTML/complexity.html"}],"status":"reported","summary":"NIST DADS defines complexity as: The intrinsic minimum amount of resources, for instance, memory, time, messages, etc., needed to solve a problem or execute an algorithm .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.complexityclass","kind":"concept","label":"complexity class","sources":[{"id":"nist-dads.complexityclass","title":"NIST Dictionary of Algorithms and Data Structures: complexityClass","url":"https://xlinux.nist.gov/dads/HTML/complexityClass.html"}],"status":"reported","summary":"NIST DADS defines complexity class as: Any of a set of computational problems with the same bounds ( Θ(n) ) on time and space, for deterministic and nondeterministic machines.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.compoundalgorithm","kind":"concept","label":"compound algorithm","sources":[{"id":"nist-dads.compoundalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: compoundAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/compoundAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines compound algorithm as: An algorithm in which one or more of the computable steps is a call to execute another algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.computable","kind":"concept","label":"computable","sources":[{"id":"nist-dads.computable","title":"NIST Dictionary of Algorithms and Data Structures: computable","url":"https://xlinux.nist.gov/dads/HTML/computable.html"}],"status":"reported","summary":"NIST DADS defines computable as: A function that can be computed by an algorithm --- equivalently, by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentdatastructure","kind":"concept","label":"concurrent data structure","sources":[{"id":"nist-dads.concurrentdatastructure","title":"NIST Dictionary of Algorithms and Data Structures: concurrentDataStructure","url":"https://xlinux.nist.gov/dads/HTML/concurrentDataStructure.html"}],"status":"reported","summary":"NIST DADS defines concurrent data structure as: A data structure designed to work correctly while being accessed by many asynchronous threads. The two main types are blocking and nonblocking.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentreadconwrt","kind":"concept","label":"concurrent read, concurrent write","sources":[{"id":"nist-dads.concurrentreadconwrt","title":"NIST Dictionary of Algorithms and Data Structures: concurrentReadConWrt","url":"https://xlinux.nist.gov/dads/HTML/concurrentReadConWrt.html"}],"status":"reported","summary":"NIST DADS defines concurrent read, concurrent write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, and multiple processors can write simultaneously to a single memory location. Also known as CRCW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrentreadexcluwrt","kind":"concept","label":"concurrent read, exclusive write","sources":[{"id":"nist-dads.concurrentreadexcluwrt","title":"NIST Dictionary of Algorithms and Data Structures: concurrentReadExcluWrt","url":"https://xlinux.nist.gov/dads/HTML/concurrentReadExcluWrt.html"}],"status":"reported","summary":"NIST DADS defines concurrent read, exclusive write as: A parallel memory model in which multiple processors can read simultaneously from a single memory location, but only one processor can write to any one memory location at one time. Also known as CREW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.concurrntflw","kind":"concept","label":"concurrent flow","sources":[{"id":"nist-dads.concurrntflw","title":"NIST Dictionary of Algorithms and Data Structures: concurrntflw","url":"https://xlinux.nist.gov/dads/HTML/concurrntflw.html"}],"status":"reported","summary":"NIST DADS defines concurrent flow as: A multi-commodity flow in which the same fraction of the demand of each commodity is satisfied.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.confluentlypersistdata","kind":"concept","label":"confluently persistent data structure","sources":[{"id":"nist-dads.confluentlypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: confluentlyPersistData","url":"https://xlinux.nist.gov/dads/HTML/confluentlyPersistData.html"}],"status":"reported","summary":"NIST DADS defines confluently persistent data structure as: A fully persistent data structure that allows meld or merge operations to combine two different versions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.conjunction","kind":"concept","label":"conjunction","sources":[{"id":"nist-dads.conjunction","title":"NIST Dictionary of Algorithms and Data Structures: conjunction","url":"https://xlinux.nist.gov/dads/HTML/conjunction.html"}],"status":"reported","summary":"NIST DADS defines conjunction as: The boolean and function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.connectedcomponents","kind":"concept","label":"connected components","sources":[{"id":"nist-dads.connectedcomponents","title":"NIST Dictionary of Algorithms and Data Structures: connectedComponents","url":"https://xlinux.nist.gov/dads/HTML/connectedComponents.html"}],"status":"reported","summary":"NIST DADS defines connected components as: The set of maximally connected components of an undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.constantfunc","kind":"concept","label":"constant function","sources":[{"id":"nist-dads.constantfunc","title":"NIST Dictionary of Algorithms and Data Structures: constantfunc","url":"https://xlinux.nist.gov/dads/HTML/constantfunc.html"}],"status":"reported","summary":"NIST DADS defines constant function as: A function that always gives the same value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cookreductin","kind":"concept","label":"Cook reduction","sources":[{"id":"nist-dads.cookreductin","title":"NIST Dictionary of Algorithms and Data Structures: cookreductin","url":"https://xlinux.nist.gov/dads/HTML/cookreductin.html"}],"status":"reported","summary":"NIST DADS defines Cook reduction as: A reduction computed by a deterministic polynomial time oracle Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cookstheorem","kind":"concept","label":"Cook's theorem","sources":[{"id":"nist-dads.cookstheorem","title":"NIST Dictionary of Algorithms and Data Structures: cookstheorem","url":"https://xlinux.nist.gov/dads/HTML/cookstheorem.html"}],"status":"reported","summary":"NIST DADS defines Cook's theorem as: The language SAT of satisfiable Boolean formulas is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.cordic","kind":"method","label":"CORDIC","sources":[{"id":"nist-dads.cordic","title":"NIST Dictionary of Algorithms and Data Structures: cordic","url":"https://xlinux.nist.gov/dads/HTML/cordic.html"}],"status":"reported","summary":"NIST DADS defines CORDIC as: Compute trigonometric functions by iterative complex rotations. The advantage is that all computations can be done with addition, subtraction, and binary shifts.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.covering","kind":"concept","label":"covering","sources":[{"id":"nist-dads.covering","title":"NIST Dictionary of Algorithms and Data Structures: covering","url":"https://xlinux.nist.gov/dads/HTML/covering.html"}],"status":"reported","summary":"NIST DADS defines covering as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection whose union covers the ground set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.criticalpath","kind":"concept","label":"critical path problem","sources":[{"id":"nist-dads.criticalpath","title":"NIST Dictionary of Algorithms and Data Structures: criticalPath","url":"https://xlinux.nist.gov/dads/HTML/criticalPath.html"}],"status":"reported","summary":"NIST DADS defines critical path problem as: Find the longest path from any source to any sinks in a directed acyclic graph which has weights, or numeric values, on vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.csp","kind":"concept","label":"CSP","sources":[{"id":"nist-dads.csp","title":"NIST Dictionary of Algorithms and Data Structures: csp","url":"https://xlinux.nist.gov/dads/HTML/csp.html"}],"status":"reported","summary":"NIST DADS defines CSP as: C. A. R. Hoare's algebraic theory to formalize the notion of concurrent computation. An acronym for Communicating Sequential Processes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ctl","kind":"concept","label":"CTL","sources":[{"id":"nist-dads.ctl","title":"NIST Dictionary of Algorithms and Data Structures: ctl","url":"https://xlinux.nist.gov/dads/HTML/ctl.html"}],"status":"reported","summary":"NIST DADS defines CTL as: A propositional, branching-time temporal logic for which formulas can be checked in linear time. An acronym for Computation Tree Logic.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cut","kind":"concept","label":"cut","sources":[{"id":"nist-dads.cut","title":"NIST Dictionary of Algorithms and Data Structures: cut","url":"https://xlinux.nist.gov/dads/HTML/cut.html"}],"status":"reported","summary":"NIST DADS defines cut as: A nonempty, proper subset of vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuttingstock","kind":"concept","label":"cutting stock problem","sources":[{"id":"nist-dads.cuttingstock","title":"NIST Dictionary of Algorithms and Data Structures: cuttingStock","url":"https://xlinux.nist.gov/dads/HTML/cuttingStock.html"}],"status":"reported","summary":"NIST DADS defines cutting stock problem as: Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem . It is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cuttingplane","kind":"concept","label":"cutting plane","sources":[{"id":"nist-dads.cuttingplane","title":"NIST Dictionary of Algorithms and Data Structures: cuttingplane","url":"https://xlinux.nist.gov/dads/HTML/cuttingplane.html"}],"status":"reported","summary":"NIST DADS defines cutting plane as: A valid inequality for an integer polyhedron that separates the polyhedron from a given point outside it.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.cutvertex","kind":"concept","label":"cut vertex","sources":[{"id":"nist-dads.cutvertex","title":"NIST Dictionary of Algorithms and Data Structures: cutvertex","url":"https://xlinux.nist.gov/dads/HTML/cutvertex.html"}],"status":"reported","summary":"NIST DADS defines cut vertex as: A vertex whose deletion along with incident edges results in a graph with more components than the original graph. Also known as articulation point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.cyclicredundancycheck","kind":"method","label":"cyclic redundancy check","sources":[{"id":"nist-dads.cyclicredundancycheck","title":"NIST Dictionary of Algorithms and Data Structures: cyclicRedundancyCheck","url":"https://xlinux.nist.gov/dads/HTML/cyclicRedundancyCheck.html"}],"status":"reported","summary":"NIST DADS defines cyclic redundancy check as: (1) A method to detect and correct errors by adding bits derived from a block or string of bits to the block. (2) An algorithm to compute bits characteristic of a block based on the algebra of polynomials over the integers, modulo 2. (3) The characteristic bits of a block. Also known as CRC.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dadjacent","kind":"concept","label":"D-adjacent","sources":[{"id":"nist-dads.dadjacent","title":"NIST Dictionary of Algorithms and Data Structures: dadjacent","url":"https://xlinux.nist.gov/dads/HTML/dadjacent.html"}],"status":"reported","summary":"NIST DADS defines D-adjacent as: An entry reachable for a (d-1)-extremal entry through a unit vertical, horizontal, or diagonal-mismatch step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dagshortpath","kind":"method","label":"DAG shortest paths","sources":[{"id":"nist-dads.dagshortpath","title":"NIST Dictionary of Algorithms and Data Structures: dagShortPath","url":"https://xlinux.nist.gov/dads/HTML/dagShortPath.html"}],"status":"reported","summary":"NIST DADS defines DAG shortest paths as: Solve the single-source shortest-path problem in a weighted directed acyclic graph by 1) doing a topological sort on the vertices by edge so vertices with no incoming edges are first and vertices with only incoming edges are last, 2) assign an infinite distance to every vertex (dist(v)=∞) and a zero distance to the source, and 3) for each vertex v in sorted order, for each outgoing edge e(v,u), if dist(v) + weight(e) < dist(u), set dist(u)=dist(v) + weight(e) and the predecessor of u to v.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decidablelanguage","kind":"concept","label":"decidable language","sources":[{"id":"nist-dads.decidablelanguage","title":"NIST Dictionary of Algorithms and Data Structures: decidableLanguage","url":"https://xlinux.nist.gov/dads/HTML/decidableLanguage.html"}],"status":"reported","summary":"NIST DADS defines decidable language as: A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps --- equivalently, can be recognized by a Turing machine that halts for all inputs. Also known as recursive language, totally decidable language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decidableproblem","kind":"concept","label":"decidable problem","sources":[{"id":"nist-dads.decidableproblem","title":"NIST Dictionary of Algorithms and Data Structures: decidableProblem","url":"https://xlinux.nist.gov/dads/HTML/decidableProblem.html"}],"status":"reported","summary":"NIST DADS defines decidable problem as: A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. The associated language is called a decidable language . Also known as totally decidable problem, algorithmically solvable, recursively solvable.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decisionproblem","kind":"concept","label":"decision problem","sources":[{"id":"nist-dads.decisionproblem","title":"NIST Dictionary of Algorithms and Data Structures: decisionProblem","url":"https://xlinux.nist.gov/dads/HTML/decisionProblem.html"}],"status":"reported","summary":"NIST DADS defines decision problem as: A problem with a \"yes\" or \"no\" answer. Equivalently, a function whose range is two values, such as {0,1}.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.decomposable","kind":"concept","label":"decomposable searching problem","sources":[{"id":"nist-dads.decomposable","title":"NIST Dictionary of Algorithms and Data Structures: decomposable","url":"https://xlinux.nist.gov/dads/HTML/decomposable.html"}],"status":"reported","summary":"NIST DADS defines decomposable searching problem as: A searching problem for which one can decompose the searched domain into subsets, find answers from these subsets, and combine these answers to form the solution to the original problem. More formally a problem with a query Q is decomposable given if there exists an efficiently computable associative and commutative binary operator @ satisfying the condition: Q(x, A ∪ B) = @(Q(x,A),Q(x,B)).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.degree","kind":"concept","label":"degree","sources":[{"id":"nist-dads.degree","title":"NIST Dictionary of Algorithms and Data Structures: degree","url":"https://xlinux.nist.gov/dads/HTML/degree.html"}],"status":"reported","summary":"NIST DADS defines degree as: (1) Of a vertex , the number of edges connected to it. (2) Of a graph , the maximum degree of any vertex. (3) Of a tree node , the number of child nodes it has.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.densegraph","kind":"concept","label":"dense graph","sources":[{"id":"nist-dads.densegraph","title":"NIST Dictionary of Algorithms and Data Structures: densegraph","url":"https://xlinux.nist.gov/dads/HTML/densegraph.html"}],"status":"reported","summary":"NIST DADS defines dense graph as: A graph in which the number of edges is close to the possible number of edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.depoissonization","kind":"concept","label":"depoissonization","sources":[{"id":"nist-dads.depoissonization","title":"NIST Dictionary of Algorithms and Data Structures: depoissonization","url":"https://xlinux.nist.gov/dads/HTML/depoissonization.html"}],"status":"reported","summary":"NIST DADS defines depoissonization as: To interpret a solution to a poisson model in the original model after poissonization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.depth","kind":"concept","label":"depth","sources":[{"id":"nist-dads.depth","title":"NIST Dictionary of Algorithms and Data Structures: depth","url":"https://xlinux.nist.gov/dads/HTML/depth.html"}],"status":"reported","summary":"NIST DADS defines depth as: Of a node , the distance from the node to the root of the tree . Formal Definition: The depth of the root is 0. The depth of a node is one plus the depth of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.derangement","kind":"method","label":"derangement","sources":[{"id":"nist-dads.derangement","title":"NIST Dictionary of Algorithms and Data Structures: derangement","url":"https://xlinux.nist.gov/dads/HTML/derangement.html"}],"status":"reported","summary":"NIST DADS defines derangement as: A permutation of elements, where no element is in its original position.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.descendant","kind":"concept","label":"descendant","sources":[{"id":"nist-dads.descendant","title":"NIST Dictionary of Algorithms and Data Structures: descendant","url":"https://xlinux.nist.gov/dads/HTML/descendant.html"}],"status":"reported","summary":"NIST DADS defines descendant as: A child of a node in a tree , any of the children of the children, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.determfinitautsrch","kind":"method","label":"deterministic finite automata string search","sources":[{"id":"nist-dads.determfinitautsrch","title":"NIST Dictionary of Algorithms and Data Structures: determFinitAutSrch","url":"https://xlinux.nist.gov/dads/HTML/determFinitAutSrch.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite automata string search as: A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determfinittreeautom","kind":"concept","label":"deterministic finite tree automaton","sources":[{"id":"nist-dads.determfinittreeautom","title":"NIST Dictionary of Algorithms and Data Structures: determFinitTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/determFinitTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines deterministic finite tree automaton as: A deterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as DFTA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.determtreeautom","kind":"concept","label":"deterministic tree automaton","sources":[{"id":"nist-dads.determtreeautom","title":"NIST Dictionary of Algorithms and Data Structures: determTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/determTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines deterministic tree automaton as: A deterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.deterministc","kind":"concept","label":"deterministic","sources":[{"id":"nist-dads.deterministc","title":"NIST Dictionary of Algorithms and Data Structures: deterministc","url":"https://xlinux.nist.gov/dads/HTML/deterministc.html"}],"status":"reported","summary":"NIST DADS defines deterministic as: Permitting at most one next move at any step in a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.deterministicalgorithm","kind":"method","label":"deterministic algorithm","sources":[{"id":"nist-dads.deterministicalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: deterministicAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/deterministicAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines deterministic algorithm as: An algorithm whose behavior can be completely predicted from the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.deutschjozsaalgo","kind":"method","label":"Deutsch-Jozsa algorithm","sources":[{"id":"nist-dads.deutschjozsaalgo","title":"NIST Dictionary of Algorithms and Data Structures: deutschJozsaAlgo","url":"https://xlinux.nist.gov/dads/HTML/deutschJozsaAlgo.html"}],"status":"reported","summary":"NIST DADS defines Deutsch-Jozsa algorithm as: A quantum algorithm to determine whether a function is constant or balanced, that is, returns 1 for half the domain and 0 for the other half. For a function taking n input qubits, first, do Hadamards on n 0's, forming all possible inputs, and a single 1, which will be the answer qubit. Next, run the function once; this exclusive or 's the result with the answer qubit. Finally, do Hadamards on the n inputs again, and measure the answer qubit. If it is 0, the function is constant, otherwise the function is balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diagonaliztn","kind":"concept","label":"diagonalization","sources":[{"id":"nist-dads.diagonaliztn","title":"NIST Dictionary of Algorithms and Data Structures: diagonaliztn","url":"https://xlinux.nist.gov/dads/HTML/diagonaliztn.html"}],"status":"reported","summary":"NIST DADS defines diagonalization as: A proof technique for showing that a given language does not belong to a given complexity class, used in many separation theorems .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diameter","kind":"concept","label":"diameter","sources":[{"id":"nist-dads.diameter","title":"NIST Dictionary of Algorithms and Data Structures: diameter","url":"https://xlinux.nist.gov/dads/HTML/diameter.html"}],"status":"reported","summary":"NIST DADS defines diameter as: The maximum of the distances between all possible pairs of vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dichotomicsearch","kind":"concept","label":"dichotomic search","sources":[{"id":"nist-dads.dichotomicsearch","title":"NIST Dictionary of Algorithms and Data Structures: dichotomicSearch","url":"https://xlinux.nist.gov/dads/HTML/dichotomicSearch.html"}],"status":"reported","summary":"NIST DADS defines dichotomic search as: Search by selecting between two distinct alternatives (dichotomies) at each step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dictionary","kind":"concept","label":"dictionary","sources":[{"id":"nist-dads.dictionary","title":"NIST Dictionary of Algorithms and Data Structures: dictionary","url":"https://xlinux.nist.gov/dads/HTML/dictionary.html"}],"status":"reported","summary":"NIST DADS defines dictionary as: An abstract data type storing items, or values. A value is accessed by an associated key . Basic operations are new, insert, find and delete. Formal Definition: The operations new(), insert(k, v, D), and find(k, D) may be defined with axiomatic semantics as follows. new() returns a dictionary find(k, insert(k, v, D)) = v find(k, insert(j, v, D)) = find(k, D) if k ≠ j where k and j are keys, v is a value, and D is a dictionary. The modifier function delete(k, D) may be defined as follows. delete(k, new()) = new() delete(k, insert(k, v, D)) = delete(k, D) delete(k, insert(j, v, D)) = insert(j, v, delete(k, D)) if k ≠ j If we want find to be a total function , we could define find(k, new()) using a special value: fail . This only changes the return type of find. find(k, new()) = fail Also known as association list, map, property list.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.difference","kind":"concept","label":"difference","sources":[{"id":"nist-dads.difference","title":"NIST Dictionary of Algorithms and Data Structures: difference","url":"https://xlinux.nist.gov/dads/HTML/difference.html"}],"status":"reported","summary":"NIST DADS defines difference as: The difference of set A minus set B is a set having all the members which are in A, but not in B.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.digitalsearchtree","kind":"concept","label":"digital search tree","sources":[{"id":"nist-dads.digitalsearchtree","title":"NIST Dictionary of Algorithms and Data Structures: digitalSearchTree","url":"https://xlinux.nist.gov/dads/HTML/digitalSearchTree.html"}],"status":"reported","summary":"NIST DADS defines digital search tree as: A trie which stores the strings in internal nodes , so there is no need for extra leaf nodes to store the strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.digitaltree","kind":"concept","label":"digital tree","sources":[{"id":"nist-dads.digitaltree","title":"NIST Dictionary of Algorithms and Data Structures: digitaltree","url":"https://xlinux.nist.gov/dads/HTML/digitaltree.html"}],"status":"reported","summary":"NIST DADS defines digital tree as: A tree for storing strings in which nodes are organized by substrings common to two or more strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.diminishingincsort","kind":"method","label":"diminishing increment sort","sources":[{"id":"nist-dads.diminishingincsort","title":"NIST Dictionary of Algorithms and Data Structures: diminishingIncSort","url":"https://xlinux.nist.gov/dads/HTML/diminishingIncSort.html"}],"status":"reported","summary":"NIST DADS defines diminishing increment sort as: An in-place sort algorithm that repeatedly reorders different, small subsets of the input until the entire array is ordered. On each pass it handles i sets of n/i items, where n is the total number of items. Each set is every i th item, e.g. set 1 is item 1, 1+i, 1+2i, etc., set 2 is item 2, 2+i, etc. On each succeeding pass, the increment or gap, i, is reduced until it is 1 for the last pass.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.diningphilos","kind":"concept","label":"dining philosophers","sources":[{"id":"nist-dads.diningphilos","title":"NIST Dictionary of Algorithms and Data Structures: diningphilos","url":"https://xlinux.nist.gov/dads/HTML/diningphilos.html"}],"status":"reported","summary":"NIST DADS defines dining philosophers as: Suppose a number of philosophers surround a dining table. Adjacent philosophers share one fork. They spend time thinking or trying to eat. A philosopher must have both the fork on the left and the fork on the right to eat. Clearly adjacent philosophers cannot eat at the same time. The problem is to find an algorithm for taking forks that prevents deadlock, starvation, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directchaining","kind":"concept","label":"direct chaining","sources":[{"id":"nist-dads.directchaining","title":"NIST Dictionary of Algorithms and Data Structures: directChaining","url":"https://xlinux.nist.gov/dads/HTML/directChaining.html"}],"status":"reported","summary":"NIST DADS defines direct chaining as: A collision resolution scheme in which the hash table is an array of links to lists . Each list holds all the items with the same hash value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.directedacyclicwordgraph","kind":"concept","label":"directed acyclic word graph","sources":[{"id":"nist-dads.directedacyclicwordgraph","title":"NIST Dictionary of Algorithms and Data Structures: directedAcyclicWordGraph","url":"https://xlinux.nist.gov/dads/HTML/directedAcyclicWordGraph.html"}],"status":"reported","summary":"NIST DADS defines directed acyclic word graph as: (1) A directed acyclic graph representing the suffixes of a given string in which each edge is labeled with a character. The characters along a path from the root to a node are the substring which the node represents. (2) A finite state machine that recognizes a set of words. Also known as DAWG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.discretintrv","kind":"concept","label":"discrete interval encoding tree","sources":[{"id":"nist-dads.discretintrv","title":"NIST Dictionary of Algorithms and Data Structures: discretintrv","url":"https://xlinux.nist.gov/dads/HTML/discretintrv.html"}],"status":"reported","summary":"NIST DADS defines discrete interval encoding tree as: A binary search tree that stores consecutive values as intervals. Also known as diet.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.discretpcntr","kind":"concept","label":"discrete p-center","sources":[{"id":"nist-dads.discretpcntr","title":"NIST Dictionary of Algorithms and Data Structures: discretpcntr","url":"https://xlinux.nist.gov/dads/HTML/discretpcntr.html"}],"status":"reported","summary":"NIST DADS defines discrete p-center as: A facility location problem in which the supply points must be a subset of demand points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.disjointset","kind":"concept","label":"disjoint set","sources":[{"id":"nist-dads.disjointset","title":"NIST Dictionary of Algorithms and Data Structures: disjointset","url":"https://xlinux.nist.gov/dads/HTML/disjointset.html"}],"status":"reported","summary":"NIST DADS defines disjoint set as: A set whose members do not overlap, are not duplicated, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.disjunction","kind":"concept","label":"disjunction","sources":[{"id":"nist-dads.disjunction","title":"NIST Dictionary of Algorithms and Data Structures: disjunction","url":"https://xlinux.nist.gov/dads/HTML/disjunction.html"}],"status":"reported","summary":"NIST DADS defines disjunction as: The boolean or function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.distributionsort","kind":"method","label":"distribution sort","sources":[{"id":"nist-dads.distributionsort","title":"NIST Dictionary of Algorithms and Data Structures: distributionSort","url":"https://xlinux.nist.gov/dads/HTML/distributionSort.html"}],"status":"reported","summary":"NIST DADS defines distribution sort as: Any sort algorithm where items are distributed from the input to multiple intermediate structures, which are then gathered and placed on the output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.distributionalcomplex","kind":"concept","label":"distributional complexity","sources":[{"id":"nist-dads.distributionalcomplex","title":"NIST Dictionary of Algorithms and Data Structures: distributionalComplex","url":"https://xlinux.nist.gov/dads/HTML/distributionalComplex.html"}],"status":"reported","summary":"NIST DADS defines distributional complexity as: The expected running time of the best possible deterministic algorithm over the worst possible probability distribution on the inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.distributivepartitioningsort","kind":"method","label":"distributive partitioning sort","sources":[{"id":"nist-dads.distributivepartitioningsort","title":"NIST Dictionary of Algorithms and Data Structures: distributivePartitioningSort","url":"https://xlinux.nist.gov/dads/HTML/distributivePartitioningSort.html"}],"status":"reported","summary":"NIST DADS defines distributive partitioning sort as: Step 1: find the median key . Step 2: distribute the n items into n/2 buckets linearly covering the interval from the minimum to the median and n/2 buckets linearly covering the interval from the median to the maximum. Step 3: compact the buckets, removing empty buckets. Recursively start again at step 1 for any bucket with multiple items. Linked lists are used to avoid moving items until a final phase and to avoid bucket overflows.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dividemarrig","kind":"method","label":"divide and marriage before conquest","sources":[{"id":"nist-dads.dividemarrig","title":"NIST Dictionary of Algorithms and Data Structures: dividemarrig","url":"https://xlinux.nist.gov/dads/HTML/dividemarrig.html"}],"status":"reported","summary":"NIST DADS defines divide and marriage before conquest as: A variant of divide and conquer in which subproblems created in the \"divide\" step are merged before the \"conquer\" step.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.domain","kind":"concept","label":"domain","sources":[{"id":"nist-dads.domain","title":"NIST Dictionary of Algorithms and Data Structures: domain","url":"https://xlinux.nist.gov/dads/HTML/domain.html"}],"status":"reported","summary":"NIST DADS defines domain as: (1) The inputs for which a function or relation is defined. For instance, 0 is not in the domain of reciprocal (1/x). (2) The possible values of a variable.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dontcare","kind":"concept","label":"don't care","sources":[{"id":"nist-dads.dontcare","title":"NIST Dictionary of Algorithms and Data Structures: dontcare","url":"https://xlinux.nist.gov/dads/HTML/dontcare.html"}],"status":"reported","summary":"NIST DADS defines don't care as: A special symbol which matches any other symbol of a given alphabet .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doomsday","kind":"method","label":"Doomsday rule","sources":[{"id":"nist-dads.doomsday","title":"NIST Dictionary of Algorithms and Data Structures: doomsday","url":"https://xlinux.nist.gov/dads/HTML/doomsday.html"}],"status":"reported","summary":"NIST DADS defines Doomsday rule as: An algorithm to find the day of the week for any date. It is simple enough to memorize and do mentally.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.doublemetaphone","kind":"method","label":"double metaphone","sources":[{"id":"nist-dads.doublemetaphone","title":"NIST Dictionary of Algorithms and Data Structures: doubleMetaphone","url":"https://xlinux.nist.gov/dads/HTML/doubleMetaphone.html"}],"status":"reported","summary":"NIST DADS defines double metaphone as: An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to a combination of 12 consonant sounds. It returns two codes if a word has two plausible pronunciations, such as a foreign word. This reduces matching problems from wrong spelling.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.doubleendpq","kind":"concept","label":"double-ended priority queue","sources":[{"id":"nist-dads.doubleendpq","title":"NIST Dictionary of Algorithms and Data Structures: doubleendpq","url":"https://xlinux.nist.gov/dads/HTML/doubleendpq.html"}],"status":"reported","summary":"NIST DADS defines double-ended priority queue as: A priority queue which simultaneously keeps track of the maximum and minimum keys , and supports operations efficiently on either extreme (minimum or maximum).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dual","kind":"concept","label":"dual","sources":[{"id":"nist-dads.dual","title":"NIST Dictionary of Algorithms and Data Structures: dual","url":"https://xlinux.nist.gov/dads/HTML/dual.html"}],"status":"reported","summary":"NIST DADS defines dual as: The dual of a planar graph , G, is a graph with a vertex for each region in G and an edge between vertices for each pair of adjacent regions. The new edge crosses the edge in G which is the boundary between the adjacent regions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dualpivotquicksort","kind":"method","label":"dual-pivot quicksort","sources":[{"id":"nist-dads.dualpivotquicksort","title":"NIST Dictionary of Algorithms and Data Structures: dualPivotQuicksort","url":"https://xlinux.nist.gov/dads/HTML/dualPivotQuicksort.html"}],"status":"reported","summary":"NIST DADS defines dual-pivot quicksort as: Pick two elements from the array to be sorted (the pivots), partition the remaining elements into (i) those less than the lesser pivot, (ii) those between the pivots, and (iii) those greater than the greater pivot, and recursively sort these partitions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamic","kind":"concept","label":"dynamic","sources":[{"id":"nist-dads.dynamic","title":"NIST Dictionary of Algorithms and Data Structures: dynamic","url":"https://xlinux.nist.gov/dads/HTML/dynamic.html"}],"status":"reported","summary":"NIST DADS defines dynamic as: When the problem domain may change, e.g., there may be insertions and deletions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamichashing","kind":"concept","label":"dynamic hashing","sources":[{"id":"nist-dads.dynamichashing","title":"NIST Dictionary of Algorithms and Data Structures: dynamicHashing","url":"https://xlinux.nist.gov/dads/HTML/dynamicHashing.html"}],"status":"reported","summary":"NIST DADS defines dynamic hashing as: A hash table that grows to handle more items. The associated hash function must change as the table grows. Some schemes may shrink the table to save space when items are deleted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.dynamicarray","kind":"concept","label":"dynamic array","sources":[{"id":"nist-dads.dynamicarray","title":"NIST Dictionary of Algorithms and Data Structures: dynamicarray","url":"https://xlinux.nist.gov/dads/HTML/dynamicarray.html"}],"status":"reported","summary":"NIST DADS defines dynamic array as: An array whose size may change over time. Items are not only added or removed, but memory used changes, too.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.dynamization","kind":"method","label":"dynamization transformation","sources":[{"id":"nist-dads.dynamization","title":"NIST Dictionary of Algorithms and Data Structures: dynamization","url":"https://xlinux.nist.gov/dads/HTML/dynamization.html"}],"status":"reported","summary":"NIST DADS defines dynamization transformation as: A data structuring technique that can make a static data structure dynamic . In so doing, the performance of the dynamic structure will exhibit certain space-time tradeoffs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.easysplithardmerge","kind":"method","label":"easy split, hard merge","sources":[{"id":"nist-dads.easysplithardmerge","title":"NIST Dictionary of Algorithms and Data Structures: easySplitHardMerge","url":"https://xlinux.nist.gov/dads/HTML/easySplitHardMerge.html"}],"status":"reported","summary":"NIST DADS defines easy split, hard merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is quick or simple and combining (merging) the solutions is time consuming or complex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgeconnectivity","kind":"concept","label":"edge connectivity","sources":[{"id":"nist-dads.edgeconnectivity","title":"NIST Dictionary of Algorithms and Data Structures: edgeConnectivity","url":"https://xlinux.nist.gov/dads/HTML/edgeConnectivity.html"}],"status":"reported","summary":"NIST DADS defines edge connectivity as: (1) The smallest number of edges whose deletion will cause a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of edges whose deletion will separate s from t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgecoloring","kind":"concept","label":"edge coloring","sources":[{"id":"nist-dads.edgecoloring","title":"NIST Dictionary of Algorithms and Data Structures: edgecoloring","url":"https://xlinux.nist.gov/dads/HTML/edgecoloring.html"}],"status":"reported","summary":"NIST DADS defines edge coloring as: An assignment of colors (or any distinct marks) to the edges of a graph . A coloring is a proper coloring if no two adjacent edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.edgecrossing","kind":"concept","label":"edge crossing","sources":[{"id":"nist-dads.edgecrossing","title":"NIST Dictionary of Algorithms and Data Structures: edgecrossing","url":"https://xlinux.nist.gov/dads/HTML/edgecrossing.html"}],"status":"reported","summary":"NIST DADS defines edge crossing as: Two different edges cross in a graph drawing if their geometric representations intersect. The number of crossings in a graph drawing is the number of pairs of edges which cross.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.editoperation","kind":"concept","label":"edit operation","sources":[{"id":"nist-dads.editoperation","title":"NIST Dictionary of Algorithms and Data Structures: editoperation","url":"https://xlinux.nist.gov/dads/HTML/editoperation.html"}],"status":"reported","summary":"NIST DADS defines edit operation as: On a string , the operation of deletion, insertion, or substitution performed on a single symbol. On a tree , the deletion of a node v followed by the reassignment of all children of v to the node of which v was formerly a child , the insertion of a new node followed by the reassignment of some arcs departing from the parent of the new node, or the substitution of the label of one of the nodes with another label. Each edit operation may have an associated nonnegative real number representing its cost.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.editscript","kind":"concept","label":"edit script","sources":[{"id":"nist-dads.editscript","title":"NIST Dictionary of Algorithms and Data Structures: editscript","url":"https://xlinux.nist.gov/dads/HTML/editscript.html"}],"status":"reported","summary":"NIST DADS defines edit script as: A sequence of viable edit operations on a string or tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.efficiency","kind":"concept","label":"efficiency","sources":[{"id":"nist-dads.efficiency","title":"NIST Dictionary of Algorithms and Data Structures: efficiency","url":"https://xlinux.nist.gov/dads/HTML/efficiency.html"}],"status":"reported","summary":"NIST DADS defines efficiency as: The resources an algorithm used to find an answer. It is usually measured in terms of the theoretical computations, such as comparisons or data moves, the memory used, the number of messages passed, the number of disk accesses, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eightqueens","kind":"concept","label":"8 queens","sources":[{"id":"nist-dads.eightqueens","title":"NIST Dictionary of Algorithms and Data Structures: eightqueens","url":"https://xlinux.nist.gov/dads/HTML/eightqueens.html"}],"status":"reported","summary":"NIST DADS defines 8 queens as: Place eight chess queens on an 8 × 8 board such that no queen can attack another. Efficiently find all possible placements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.elasticbuckettrie","kind":"concept","label":"elastic-bucket trie","sources":[{"id":"nist-dads.elasticbuckettrie","title":"NIST Dictionary of Algorithms and Data Structures: elasticBucketTrie","url":"https://xlinux.nist.gov/dads/HTML/elasticBucketTrie.html"}],"status":"reported","summary":"NIST DADS defines elastic-bucket trie as: A variant of a bucket trie in which each leaf node for n strings is a bucket allocated to hold exactly n strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.elementnqnss","kind":"concept","label":"element uniqueness","sources":[{"id":"nist-dads.elementnqnss","title":"NIST Dictionary of Algorithms and Data Structures: elementnqnss","url":"https://xlinux.nist.gov/dads/HTML/elementnqnss.html"}],"status":"reported","summary":"NIST DADS defines element uniqueness as: The problem of determining if there are duplicates in a set of numbers.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.endofstring","kind":"concept","label":"end-of-string","sources":[{"id":"nist-dads.endofstring","title":"NIST Dictionary of Algorithms and Data Structures: endofstring","url":"https://xlinux.nist.gov/dads/HTML/endofstring.html"}],"status":"reported","summary":"NIST DADS defines end-of-string as: A special character indicating the end of a string .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euclidsteinertree","kind":"concept","label":"Euclidean Steiner tree","sources":[{"id":"nist-dads.euclidsteinertree","title":"NIST Dictionary of Algorithms and Data Structures: euclidSteinerTree","url":"https://xlinux.nist.gov/dads/HTML/euclidSteinerTree.html"}],"status":"reported","summary":"NIST DADS defines Euclidean Steiner tree as: A tree of minimum Euclidean distance connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euclidntrvls","kind":"concept","label":"Euclidean traveling salesman problem","sources":[{"id":"nist-dads.euclidntrvls","title":"NIST Dictionary of Algorithms and Data Structures: euclidntrvls","url":"https://xlinux.nist.gov/dads/HTML/euclidntrvls.html"}],"status":"reported","summary":"NIST DADS defines Euclidean traveling salesman problem as: Find a path of minimum Euclidean distance between points in a plane which includes each point exactly once and returns to its starting point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.eulercycle","kind":"concept","label":"Euler cycle","sources":[{"id":"nist-dads.eulercycle","title":"NIST Dictionary of Algorithms and Data Structures: eulercycle","url":"https://xlinux.nist.gov/dads/HTML/eulercycle.html"}],"status":"reported","summary":"NIST DADS defines Euler cycle as: A path through a graph which starts and ends at the same vertex and includes every edge exactly once. Also known as Eulerian path, Königsberg bridges problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.euleriangrph","kind":"concept","label":"Eulerian graph","sources":[{"id":"nist-dads.euleriangrph","title":"NIST Dictionary of Algorithms and Data Structures: euleriangrph","url":"https://xlinux.nist.gov/dads/HTML/euleriangrph.html"}],"status":"reported","summary":"NIST DADS defines Eulerian graph as: A graph that has an Euler cycle .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.excell","kind":"concept","label":"EXCELL","sources":[{"id":"nist-dads.excell","title":"NIST Dictionary of Algorithms and Data Structures: excell","url":"https://xlinux.nist.gov/dads/HTML/excell.html"}],"status":"reported","summary":"NIST DADS defines EXCELL as: A point access method using a dynamic multidimensional array .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.exclusivereadconwrt","kind":"concept","label":"exclusive read, concurrent write","sources":[{"id":"nist-dads.exclusivereadconwrt","title":"NIST Dictionary of Algorithms and Data Structures: exclusiveReadConWrt","url":"https://xlinux.nist.gov/dads/HTML/exclusiveReadConWrt.html"}],"status":"reported","summary":"NIST DADS defines exclusive read, concurrent write as: A parallel memory model in which only one processor can read from any one memory location at one time, but multiple processors can write simultaneously to a single memory location. Also known as ERCW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.exclusivereadexcluwrt","kind":"concept","label":"exclusive read, exclusive write","sources":[{"id":"nist-dads.exclusivereadexcluwrt","title":"NIST Dictionary of Algorithms and Data Structures: exclusiveReadExcluWrt","url":"https://xlinux.nist.gov/dads/HTML/exclusiveReadExcluWrt.html"}],"status":"reported","summary":"NIST DADS defines exclusive read, exclusive write as: A parallel memory model in which only one processor can read from any one memory location at one time, and only one processor can write to any one memory location at one time. Also known as EREW.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.existentlstt","kind":"concept","label":"existential state","sources":[{"id":"nist-dads.existentlstt","title":"NIST Dictionary of Algorithms and Data Structures: existentlstt","url":"https://xlinux.nist.gov/dads/HTML/existentlstt.html"}],"status":"reported","summary":"NIST DADS defines existential state as: A state in a nondeterministic Turing machine from which the machine accepts if any move leads to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.extendeuclid","kind":"method","label":"extended Euclid's algorithm","sources":[{"id":"nist-dads.extendeuclid","title":"NIST Dictionary of Algorithms and Data Structures: extendEuclid","url":"https://xlinux.nist.gov/dads/HTML/extendEuclid.html"}],"status":"reported","summary":"NIST DADS defines extended Euclid's algorithm as: An algorithm to find the greatest common divisor , g , of two positive integers, a and b , and coefficients, h and j , such that g = ha + jb .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendedbinarytree","kind":"concept","label":"extended binary tree","sources":[{"id":"nist-dads.extendedbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: extendedBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/extendedBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines extended binary tree as: A binary tree with special nodes replacing every null subtree. Every regular node has two children , and every special node has no children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendiblehashing","kind":"concept","label":"extendible hashing","sources":[{"id":"nist-dads.extendiblehashing","title":"NIST Dictionary of Algorithms and Data Structures: extendibleHashing","url":"https://xlinux.nist.gov/dads/HTML/extendibleHashing.html"}],"status":"reported","summary":"NIST DADS defines extendible hashing as: A hash table in which the hash function is the last few bits of the key and the table refers to buckets . Table entries with the same final bits may use the same bucket. If a bucket overflows, it splits, and if only one entry referred to it, the table doubles in size. If a bucket is emptied by deletion, entries using it are changed to refer to an adjoining bucket, and the table may be halved.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extendkdtree","kind":"concept","label":"extended k-d tree","sources":[{"id":"nist-dads.extendkdtree","title":"NIST Dictionary of Algorithms and Data Structures: extendkdtree","url":"https://xlinux.nist.gov/dads/HTML/extendkdtree.html"}],"status":"reported","summary":"NIST DADS defines extended k-d tree as: A spatial access method where successive levels are split along different dimensions into nonoverlapping cells. Objects are indexed in all cells they intersect.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalmemoryalgo","kind":"method","label":"external memory algorithm","sources":[{"id":"nist-dads.externalmemoryalgo","title":"NIST Dictionary of Algorithms and Data Structures: externalMemoryAlgo","url":"https://xlinux.nist.gov/dads/HTML/externalMemoryAlgo.html"}],"status":"reported","summary":"NIST DADS defines external memory algorithm as: An algorithm that is efficient when accessing most of the data is very slow, such as, on disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalmemorydatastr","kind":"concept","label":"external memory data structure","sources":[{"id":"nist-dads.externalmemorydatastr","title":"NIST Dictionary of Algorithms and Data Structures: externalMemoryDataStr","url":"https://xlinux.nist.gov/dads/HTML/externalMemoryDataStr.html"}],"status":"reported","summary":"NIST DADS defines external memory data structure as: A data structure that is efficient even when accessing most of the data is very slow, such as, on a disk.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalquicksort","kind":"method","label":"external quicksort","sources":[{"id":"nist-dads.externalquicksort","title":"NIST Dictionary of Algorithms and Data Structures: externalQuicksort","url":"https://xlinux.nist.gov/dads/HTML/externalQuicksort.html"}],"status":"reported","summary":"NIST DADS defines external quicksort as: Read the M/2 first and last elements into a buffer (the buffer acts like the pivot in quicksort ), and sort them. Read the next element from the beginning or end to balance writing. If the next element is less than the least of the buffer, write it to available space at the beginning. If greater than the greatest, write it to the end. Otherwise write the greatest or least of the buffer, and put the next element in the buffer. Keep the maximum lower and minimum upper keys written to avoid resorting middle elements that are in order. When done, write the buffer. Recursively sort the smaller partition, and loop to sort the remaining partition.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.externalindx","kind":"concept","label":"external index","sources":[{"id":"nist-dads.externalindx","title":"NIST Dictionary of Algorithms and Data Structures: externalindx","url":"https://xlinux.nist.gov/dads/HTML/externalindx.html"}],"status":"reported","summary":"NIST DADS defines external index as: An auxiliary data structure added to a main data structure to improve operations, such as a search on a secondary key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.externalmerg","kind":"method","label":"external merge","sources":[{"id":"nist-dads.externalmerg","title":"NIST Dictionary of Algorithms and Data Structures: externalmerg","url":"https://xlinux.nist.gov/dads/HTML/externalmerg.html"}],"status":"reported","summary":"NIST DADS defines external merge as: To combine multiple sorted data streams into a single sorted stream using external storage.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extremal","kind":"concept","label":"extremal","sources":[{"id":"nist-dads.extremal","title":"NIST Dictionary of Algorithms and Data Structures: extremal","url":"https://xlinux.nist.gov/dads/HTML/extremal.html"}],"status":"reported","summary":"NIST DADS defines extremal as: Some of the entries of the auxiliary array used in a string matching algorithm. An entry is d-extremal if it is the deepest entry on its diagonal to be given value d.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.extremepoint","kind":"concept","label":"extreme point","sources":[{"id":"nist-dads.extremepoint","title":"NIST Dictionary of Algorithms and Data Structures: extremepoint","url":"https://xlinux.nist.gov/dads/HTML/extremepoint.html"}],"status":"reported","summary":"NIST DADS defines extreme point as: A corner point of a polyhedron . More formally, a point which cannot be expressed as a convex combination of other points in the polyhedron.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.facilityloc","kind":"concept","label":"facility location","sources":[{"id":"nist-dads.facilityloc","title":"NIST Dictionary of Algorithms and Data Structures: facilityloc","url":"https://xlinux.nist.gov/dads/HTML/facilityloc.html"}],"status":"reported","summary":"NIST DADS defines facility location as: Given a set of demand points, a distance function, and a parameter p, find a set of p supply objects (points, lines, segments, etc.) which minimizes some distance objective function . The function may be the maximum distance between any demand point and the nearest supply, so no demand point is too far from a supply, or the sum of distances to the nearest supply.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fathoming","kind":"method","label":"fathoming","sources":[{"id":"nist-dads.fathoming","title":"NIST Dictionary of Algorithms and Data Structures: fathoming","url":"https://xlinux.nist.gov/dads/HTML/fathoming.html"}],"status":"reported","summary":"NIST DADS defines fathoming as: Pruning a search tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feasibleregn","kind":"concept","label":"feasible region","sources":[{"id":"nist-dads.feasibleregn","title":"NIST Dictionary of Algorithms and Data Structures: feasibleregn","url":"https://xlinux.nist.gov/dads/HTML/feasibleregn.html"}],"status":"reported","summary":"NIST DADS defines feasible region as: The set of all possible solutions of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feasiblesltn","kind":"concept","label":"feasible solution","sources":[{"id":"nist-dads.feasiblesltn","title":"NIST Dictionary of Algorithms and Data Structures: feasiblesltn","url":"https://xlinux.nist.gov/dads/HTML/feasiblesltn.html"}],"status":"reported","summary":"NIST DADS defines feasible solution as: Any element of the feasible region of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feedbackedgeset","kind":"concept","label":"feedback edge set","sources":[{"id":"nist-dads.feedbackedgeset","title":"NIST Dictionary of Algorithms and Data Structures: feedbackEdgeSet","url":"https://xlinux.nist.gov/dads/HTML/feedbackEdgeSet.html"}],"status":"reported","summary":"NIST DADS defines feedback edge set as: The smallest set of edges whose deletion results in an acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.feedbackvertexset","kind":"concept","label":"feedback vertex set","sources":[{"id":"nist-dads.feedbackvertexset","title":"NIST Dictionary of Algorithms and Data Structures: feedbackVertexSet","url":"https://xlinux.nist.gov/dads/HTML/feedbackVertexSet.html"}],"status":"reported","summary":"NIST DADS defines feedback vertex set as: The smallest set of vertices whose deletion results in an acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fibonaccitree","kind":"concept","label":"Fibonacci tree","sources":[{"id":"nist-dads.fibonaccitree","title":"NIST Dictionary of Algorithms and Data Structures: fibonacciTree","url":"https://xlinux.nist.gov/dads/HTML/fibonacciTree.html"}],"status":"reported","summary":"NIST DADS defines Fibonacci tree as: A variant of a binary tree where a tree of order n (n>1) has a left subtree of order n-1 and a right subtree of order n-2. An order 0 Fibonacci tree has no nodes , and an order 1 tree has 1 node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.find","kind":"method","label":"Find","sources":[{"id":"nist-dads.find","title":"NIST Dictionary of Algorithms and Data Structures: find","url":"https://xlinux.nist.gov/dads/HTML/find.html"}],"status":"reported","summary":"NIST DADS defines Find as: An algorithm to select the k th smallest element of an array and partition the array around it. First, partition around the value of the k th element. If the split is not at element k, move the upper or lower boundary and partition again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.finitarytree","kind":"concept","label":"finitary tree","sources":[{"id":"nist-dads.finitarytree","title":"NIST Dictionary of Algorithms and Data Structures: finitarytree","url":"https://xlinux.nist.gov/dads/HTML/finitarytree.html"}],"status":"reported","summary":"NIST DADS defines finitary tree as: A tree with a finite number of children at every node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.firstinfrstt","kind":"concept","label":"first-in, first-out","sources":[{"id":"nist-dads.firstinfrstt","title":"NIST Dictionary of Algorithms and Data Structures: firstinfrstt","url":"https://xlinux.nist.gov/dads/HTML/firstinfrstt.html"}],"status":"reported","summary":"NIST DADS defines first-in, first-out as: A policy that items are processed in order of arrival. A queue implements this.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fixedgrdmthd","kind":"concept","label":"fixed-grid method","sources":[{"id":"nist-dads.fixedgrdmthd","title":"NIST Dictionary of Algorithms and Data Structures: fixedgrdmthd","url":"https://xlinux.nist.gov/dads/HTML/fixedgrdmthd.html"}],"status":"reported","summary":"NIST DADS defines fixed-grid method as: Space decomposition into rectangular cells by overlaying a grid on it.If the cells are congruent (i.e.,of the same width, height, etc.), then the grid is said to be uniform.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flow","kind":"concept","label":"flow","sources":[{"id":"nist-dads.flow","title":"NIST Dictionary of Algorithms and Data Structures: flow","url":"https://xlinux.nist.gov/dads/HTML/flow.html"}],"status":"reported","summary":"NIST DADS defines flow as: A measure of the maximum weight along paths in a weighted, directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flowconsrvtn","kind":"concept","label":"flow conservation","sources":[{"id":"nist-dads.flowconsrvtn","title":"NIST Dictionary of Algorithms and Data Structures: flowconsrvtn","url":"https://xlinux.nist.gov/dads/HTML/flowconsrvtn.html"}],"status":"reported","summary":"NIST DADS defines flow conservation as: The property that no vertex , except the source and sink , of a flow network creates or stores flow. More formally, the incoming flow is the same as the outgoing flow, or, the net flow is 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flowfunction","kind":"concept","label":"flow function","sources":[{"id":"nist-dads.flowfunction","title":"NIST Dictionary of Algorithms and Data Structures: flowfunction","url":"https://xlinux.nist.gov/dads/HTML/flowfunction.html"}],"status":"reported","summary":"NIST DADS defines flow function as: An assignment of flow values to the edges of a flow network that satisfies flow conservation , skew symmetry , and capacity constraints . Also known as network flow.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.flownetwork","kind":"concept","label":"flow network","sources":[{"id":"nist-dads.flownetwork","title":"NIST Dictionary of Algorithms and Data Structures: flownetwork","url":"https://xlinux.nist.gov/dads/HTML/flownetwork.html"}],"status":"reported","summary":"NIST DADS defines flow network as: A weighted , directed graph with two specially marked nodes, the source s and the sink t, and a capacity function that maps edges to positive real numbers, u: E |→ ℜ + .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.floydwarshall","kind":"method","label":"Floyd-Warshall algorithm","sources":[{"id":"nist-dads.floydwarshall","title":"NIST Dictionary of Algorithms and Data Structures: floydWarshall","url":"https://xlinux.nist.gov/dads/HTML/floydWarshall.html"}],"status":"reported","summary":"NIST DADS defines Floyd-Warshall algorithm as: An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles . The time complexity is Θ (V³) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fordfulkerson","kind":"method","label":"Ford-Fulkerson method","sources":[{"id":"nist-dads.fordfulkerson","title":"NIST Dictionary of Algorithms and Data Structures: fordFulkerson","url":"https://xlinux.nist.gov/dads/HTML/fordFulkerson.html"}],"status":"reported","summary":"NIST DADS defines Ford-Fulkerson method as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a path from the source to the sink along which the flow can be increased and increase the flow. Repeat until there are no such paths.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forest","kind":"concept","label":"forest","sources":[{"id":"nist-dads.forest","title":"NIST Dictionary of Algorithms and Data Structures: forest","url":"https://xlinux.nist.gov/dads/HTML/forest.html"}],"status":"reported","summary":"NIST DADS defines forest as: A collection of one or more trees . Formal Definition: An undirected , acyclic graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forestedit","kind":"concept","label":"forest editing problem","sources":[{"id":"nist-dads.forestedit","title":"NIST Dictionary of Algorithms and Data Structures: forestedit","url":"https://xlinux.nist.gov/dads/HTML/forestedit.html"}],"status":"reported","summary":"NIST DADS defines forest editing problem as: The problem of finding an edit script of minimum cost which transforms a given forest into another given forest.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.formalmethod","kind":"concept","label":"formal methods","sources":[{"id":"nist-dads.formalmethod","title":"NIST Dictionary of Algorithms and Data Structures: formalmethod","url":"https://xlinux.nist.gov/dads/HTML/formalmethod.html"}],"status":"reported","summary":"NIST DADS defines formal methods as: A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.formalverf","kind":"concept","label":"formal verification","sources":[{"id":"nist-dads.formalverf","title":"NIST Dictionary of Algorithms and Data Structures: formalverf","url":"https://xlinux.nist.gov/dads/HTML/formalverf.html"}],"status":"reported","summary":"NIST DADS defines formal verification as: Establishing properties of hardware or software designs using logic, rather than (just) testing or informal arguments. This involves formal specification of the requirement, formal modeling of the implementation, and precise rules of inference to prove, say, that the implementation satisfies the specification.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.forwardindex","kind":"concept","label":"forward index","sources":[{"id":"nist-dads.forwardindex","title":"NIST Dictionary of Algorithms and Data Structures: forwardIndex","url":"https://xlinux.nist.gov/dads/HTML/forwardIndex.html"}],"status":"reported","summary":"NIST DADS defines forward index as: An index into a set of texts . This is usually created as the first step to making an inverted index .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fractional","kind":"concept","label":"fractional solution","sources":[{"id":"nist-dads.fractional","title":"NIST Dictionary of Algorithms and Data Structures: fractional","url":"https://xlinux.nist.gov/dads/HTML/fractional.html"}],"status":"reported","summary":"NIST DADS defines fractional solution as: Typically, a solution to a relaxation of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fractionalknapsack","kind":"concept","label":"fractional knapsack problem","sources":[{"id":"nist-dads.fractionalknapsack","title":"NIST Dictionary of Algorithms and Data Structures: fractionalKnapsack","url":"https://xlinux.nist.gov/dads/HTML/fractionalKnapsack.html"}],"status":"reported","summary":"NIST DADS defines fractional knapsack problem as: Given materials of different values per unit volume and maximum amounts, find the most valuable mix of materials which fit in a knapsack of fixed volume. Since we may take pieces (fractions) of materials, a greedy algorithm finds the optimum. Take as much as possible of the material that is most valuable per unit volume. If there is still room, take as much as possible of the next most valuable material. Continue until the knapsack is full. Also known as continuous knapsack problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freeedge","kind":"concept","label":"free edge","sources":[{"id":"nist-dads.freeedge","title":"NIST Dictionary of Algorithms and Data Structures: freeedge","url":"https://xlinux.nist.gov/dads/HTML/freeedge.html"}],"status":"reported","summary":"NIST DADS defines free edge as: An edge which is not in a matching .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freetree","kind":"concept","label":"free tree","sources":[{"id":"nist-dads.freetree","title":"NIST Dictionary of Algorithms and Data Structures: freetree","url":"https://xlinux.nist.gov/dads/HTML/freetree.html"}],"status":"reported","summary":"NIST DADS defines free tree as: A connected , acyclic , undirected graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.freevertex","kind":"concept","label":"free vertex","sources":[{"id":"nist-dads.freevertex","title":"NIST Dictionary of Algorithms and Data Structures: freevertex","url":"https://xlinux.nist.gov/dads/HTML/freevertex.html"}],"status":"reported","summary":"NIST DADS defines free vertex as: A vertex not on a matched edge in a matching , or, one which has not been matched.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.frequencycounthueristic","kind":"method","label":"frequency count heuristic","sources":[{"id":"nist-dads.frequencycounthueristic","title":"NIST Dictionary of Algorithms and Data Structures: frequencyCountHueristic","url":"https://xlinux.nist.gov/dads/HTML/frequencyCountHueristic.html"}],"status":"reported","summary":"NIST DADS defines frequency count heuristic as: A heuristic that keeps the elements of a list ordered by number of times each element is the target of a search .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullbinarytree","kind":"concept","label":"full binary tree","sources":[{"id":"nist-dads.fullbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: fullBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/fullBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines full binary tree as: A binary tree in which each node has exactly zero or two children . Also known as proper binary tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullinvertedindex","kind":"concept","label":"full inverted index","sources":[{"id":"nist-dads.fullinvertedindex","title":"NIST Dictionary of Algorithms and Data Structures: fullInvertedIndex","url":"https://xlinux.nist.gov/dads/HTML/fullInvertedIndex.html"}],"status":"reported","summary":"NIST DADS defines full inverted index as: An inverted index that includes the exact location within texts, in addition to the text in which the word appears.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullypersistdata","kind":"concept","label":"fully persistent data structure","sources":[{"id":"nist-dads.fullypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: fullyPersistData","url":"https://xlinux.nist.gov/dads/HTML/fullyPersistData.html"}],"status":"reported","summary":"NIST DADS defines fully persistent data structure as: A persistent data structure that allows updates to all versions, previous and latest.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.fullydynamic","kind":"concept","label":"fully dynamic graph problem","sources":[{"id":"nist-dads.fullydynamic","title":"NIST Dictionary of Algorithms and Data Structures: fullydynamic","url":"https://xlinux.nist.gov/dads/HTML/fullydynamic.html"}],"status":"reported","summary":"NIST DADS defines fully dynamic graph problem as: Problem where the update operations include unrestricted insertions and deletions of edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.fullypolynml","kind":"method","label":"fully polynomial approximation scheme","sources":[{"id":"nist-dads.fullypolynml","title":"NIST Dictionary of Algorithms and Data Structures: fullypolynml","url":"https://xlinux.nist.gov/dads/HTML/fullypolynml.html"}],"status":"reported","summary":"NIST DADS defines fully polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a 1+ε- approximation algorithm bounded by a polynomial in the length of the input and 1/ε.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.function","kind":"concept","label":"function","sources":[{"id":"nist-dads.function","title":"NIST Dictionary of Algorithms and Data Structures: function","url":"https://xlinux.nist.gov/dads/HTML/function.html"}],"status":"reported","summary":"NIST DADS defines function as: (1) A computation which takes some arguments or inputs and yields an output. Any particular input yields the same output every time. More formally, a mapping from each element in the domain to an element in the range . (2) A subroutine which returns a value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.gbdtree","kind":"concept","label":"GBD-tree","sources":[{"id":"nist-dads.gbdtree","title":"NIST Dictionary of Algorithms and Data Structures: gbdtree","url":"https://xlinux.nist.gov/dads/HTML/gbdtree.html"}],"status":"reported","summary":"NIST DADS defines GBD-tree as: A generalized BD-tree , hence the name, which stores spatially extended objects as a hierarchy of minimum bounding boxes . It is a balanced multiway tree which serves as a spatial access method .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.geometricopt","kind":"concept","label":"geometric optimization problem","sources":[{"id":"nist-dads.geometricopt","title":"NIST Dictionary of Algorithms and Data Structures: geometricopt","url":"https://xlinux.nist.gov/dads/HTML/geometricopt.html"}],"status":"reported","summary":"NIST DADS defines geometric optimization problem as: An optimization problem induced by a collection of geometric objects.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.globaloptimum","kind":"concept","label":"global optimum","sources":[{"id":"nist-dads.globaloptimum","title":"NIST Dictionary of Algorithms and Data Structures: globalOptimum","url":"https://xlinux.nist.gov/dads/HTML/globalOptimum.html"}],"status":"reported","summary":"NIST DADS defines global optimum as: The best possible solution to a problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphpartition","kind":"concept","label":"graph partition","sources":[{"id":"nist-dads.graphpartition","title":"NIST Dictionary of Algorithms and Data Structures: graphPartition","url":"https://xlinux.nist.gov/dads/HTML/graphPartition.html"}],"status":"reported","summary":"NIST DADS defines graph partition as: Partition the vertices while keeping the cost of spanning edges low.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphconcen","kind":"concept","label":"graph concentration","sources":[{"id":"nist-dads.graphconcen","title":"NIST Dictionary of Algorithms and Data Structures: graphconcen","url":"https://xlinux.nist.gov/dads/HTML/graphconcen.html"}],"status":"reported","summary":"NIST DADS defines graph concentration as: Contracting a graph by removing a subset of the vertices .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphdrawing","kind":"concept","label":"graph drawing","sources":[{"id":"nist-dads.graphdrawing","title":"NIST Dictionary of Algorithms and Data Structures: graphdrawing","url":"https://xlinux.nist.gov/dads/HTML/graphdrawing.html"}],"status":"reported","summary":"NIST DADS defines graph drawing as: The problem of representing a graph in a plane \"neatly,\" for instance with a minimum number of edge crossings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.graphisomrph","kind":"concept","label":"graph isomorphism","sources":[{"id":"nist-dads.graphisomrph","title":"NIST Dictionary of Algorithms and Data Structures: graphisomrph","url":"https://xlinux.nist.gov/dads/HTML/graphisomrph.html"}],"status":"reported","summary":"NIST DADS defines graph isomorphism as: Determine if two graphs are isomorphic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greatestcommondivisor","kind":"method","label":"greatest common divisor","sources":[{"id":"nist-dads.greatestcommondivisor","title":"NIST Dictionary of Algorithms and Data Structures: greatestCommonDivisor","url":"https://xlinux.nist.gov/dads/HTML/greatestCommonDivisor.html"}],"status":"reported","summary":"NIST DADS defines greatest common divisor as: (1) The greatest integer which is a divisor of given positive integers. For instance, GCD(30, 42) = 6. (2) An algorithm to find the same. Also known as GCD, highest common factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.greedyheuristic","kind":"method","label":"greedy heuristic","sources":[{"id":"nist-dads.greedyheuristic","title":"NIST Dictionary of Algorithms and Data Structures: greedyHeuristic","url":"https://xlinux.nist.gov/dads/HTML/greedyHeuristic.html"}],"status":"reported","summary":"NIST DADS defines greedy heuristic as: Solve an optimization problem by finding locally optimal solutions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.griddrawing","kind":"concept","label":"grid drawing","sources":[{"id":"nist-dads.griddrawing","title":"NIST Dictionary of Algorithms and Data Structures: griddrawing","url":"https://xlinux.nist.gov/dads/HTML/griddrawing.html"}],"status":"reported","summary":"NIST DADS defines grid drawing as: A graph drawing in which each vertex is represented by a point with integer coordinates.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.gridfile","kind":"concept","label":"grid file","sources":[{"id":"nist-dads.gridfile","title":"NIST Dictionary of Algorithms and Data Structures: gridfile","url":"https://xlinux.nist.gov/dads/HTML/gridfile.html"}],"status":"reported","summary":"NIST DADS defines grid file as: A point access method which splits space into a nonperiodic grid. Each spatial dimension is divided by a linear hash . Small sets of points are referred to by one or more cells of the grid.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.haltingproblem","kind":"concept","label":"halting problem","sources":[{"id":"nist-dads.haltingproblem","title":"NIST Dictionary of Algorithms and Data Structures: haltingProblem","url":"https://xlinux.nist.gov/dads/HTML/haltingProblem.html"}],"status":"reported","summary":"NIST DADS defines halting problem as: Is there an algorithm to determine whether any arbitrary program halts? Turing proved the answer is, no. Since many questions can be recast to this problem, we can conclude that some programs are absolutely impossible, although heuristic or partial solutions are possible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hamiltoniancycle","kind":"concept","label":"Hamiltonian cycle","sources":[{"id":"nist-dads.hamiltoniancycle","title":"NIST Dictionary of Algorithms and Data Structures: hamiltonianCycle","url":"https://xlinux.nist.gov/dads/HTML/hamiltonianCycle.html"}],"status":"reported","summary":"NIST DADS defines Hamiltonian cycle as: A path through a graph that starts and ends at the same vertex and includes every other vertex exactly once. Also known as tour.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hamiltonianpath","kind":"concept","label":"Hamiltonian path","sources":[{"id":"nist-dads.hamiltonianpath","title":"NIST Dictionary of Algorithms and Data Structures: hamiltonianPath","url":"https://xlinux.nist.gov/dads/HTML/hamiltonianPath.html"}],"status":"reported","summary":"NIST DADS defines Hamiltonian path as: A simple path through a graph that includes every vertex in the graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hardspliteasymerge","kind":"method","label":"hard split, easy merge","sources":[{"id":"nist-dads.hardspliteasymerge","title":"NIST Dictionary of Algorithms and Data Structures: hardSplitEasyMerge","url":"https://xlinux.nist.gov/dads/HTML/hardSplitEasyMerge.html"}],"status":"reported","summary":"NIST DADS defines hard split, easy merge as: A recursive algorithm, especially a sort algorithm, where dividing (splitting) into smaller problems is time consuming or complex and combining (merging) the solutions is quick or trivial.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashbelt","kind":"concept","label":"hashbelt","sources":[{"id":"nist-dads.hashbelt","title":"NIST Dictionary of Algorithms and Data Structures: hashbelt","url":"https://xlinux.nist.gov/dads/HTML/hashbelt.html"}],"status":"reported","summary":"NIST DADS defines hashbelt as: Use a short list or array of hash tables to implement a hash table with aging to expire items. To expire items, add a new table at the head of the list and drop the oldest table, along with its contents. To find an item, search all the tables.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hashheap","kind":"concept","label":"hash heap","sources":[{"id":"nist-dads.hashheap","title":"NIST Dictionary of Algorithms and Data Structures: hashheap","url":"https://xlinux.nist.gov/dads/HTML/hashheap.html"}],"status":"reported","summary":"NIST DADS defines hash heap as: An efficient implementation of a priority queue . The linear hash function monotonically maps keys to buckets , and each bucket is a heap .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hashtabdelet","kind":"method","label":"hash table delete","sources":[{"id":"nist-dads.hashtabdelet","title":"NIST Dictionary of Algorithms and Data Structures: hashtabdelet","url":"https://xlinux.nist.gov/dads/HTML/hashtabdelet.html"}],"status":"reported","summary":"NIST DADS defines hash table delete as: If the hash table uses chaining , use the chaining data structure delete. If it uses open addressing , mark the item \"deleted\" for future reuse.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hausdorffdst","kind":"concept","label":"Hausdorff distance","sources":[{"id":"nist-dads.hausdorffdst","title":"NIST Dictionary of Algorithms and Data Structures: hausdorffdst","url":"https://xlinux.nist.gov/dads/HTML/hausdorffdst.html"}],"status":"reported","summary":"NIST DADS defines Hausdorff distance as: A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max a∈ P min b∈ Q d(a,b), max a∈ Q min b∈ P d(a,b)} where d(·,·) is the distance metric, usually the Euclidean distance .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hbtree","kind":"concept","label":"hB-tree","sources":[{"id":"nist-dads.hbtree","title":"NIST Dictionary of Algorithms and Data Structures: hbtree","url":"https://xlinux.nist.gov/dads/HTML/hbtree.html"}],"status":"reported","summary":"NIST DADS defines hB-tree as: A point access method which uses k-d trees to organize the space, but partitions as excluded intervals, like the BANG file . Searching is like in a k-d-B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.head","kind":"concept","label":"head","sources":[{"id":"nist-dads.head","title":"NIST Dictionary of Algorithms and Data Structures: head","url":"https://xlinux.nist.gov/dads/HTML/head.html"}],"status":"reported","summary":"NIST DADS defines head as: The first item of a list .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heapify","kind":"method","label":"heapify","sources":[{"id":"nist-dads.heapify","title":"NIST Dictionary of Algorithms and Data Structures: heapify","url":"https://xlinux.nist.gov/dads/HTML/heapify.html"}],"status":"reported","summary":"NIST DADS defines heapify as: Rearrange a heap to maintain the heap property , that is, the key of the root node is more extreme (greater or less) than or equal to the keys of its children . If the root node's key is not more extreme, swap it with the most extreme child key, then recursively heapify that child's subtree. The child subtrees must be heaps to start.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heapproperty","kind":"concept","label":"heap property","sources":[{"id":"nist-dads.heapproperty","title":"NIST Dictionary of Algorithms and Data Structures: heapproperty","url":"https://xlinux.nist.gov/dads/HTML/heapproperty.html"}],"status":"reported","summary":"NIST DADS defines heap property as: Each node in a tree has a key which is more extreme (greater or less) than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.height","kind":"concept","label":"height","sources":[{"id":"nist-dads.height","title":"NIST Dictionary of Algorithms and Data Structures: height","url":"https://xlinux.nist.gov/dads/HTML/height.html"}],"status":"reported","summary":"NIST DADS defines height as: The maximum distance of any node from the root . If a tree has only one node (the root), the height is zero. The height of an empty tree is not defined.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heightbalancedbinsrchtree","kind":"concept","label":"height-balanced binary search tree","sources":[{"id":"nist-dads.heightbalancedbinsrchtree","title":"NIST Dictionary of Algorithms and Data Structures: heightBalancedBinSrchTree","url":"https://xlinux.nist.gov/dads/HTML/heightBalancedBinSrchTree.html"}],"status":"reported","summary":"NIST DADS defines height-balanced binary search tree as: A height-balanced tree which is also a binary search tree . It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.heightbalancedtree","kind":"concept","label":"height-balanced tree","sources":[{"id":"nist-dads.heightbalancedtree","title":"NIST Dictionary of Algorithms and Data Structures: heightBalancedTree","url":"https://xlinux.nist.gov/dads/HTML/heightBalancedTree.html"}],"status":"reported","summary":"NIST DADS defines height-balanced tree as: A tree whose subtrees differ in height by no more than one and the subtrees are height-balanced, too. An empty tree is height-balanced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.heuristic","kind":"method","label":"heuristic","sources":[{"id":"nist-dads.heuristic","title":"NIST Dictionary of Algorithms and Data Structures: heuristic","url":"https://xlinux.nist.gov/dads/HTML/heuristic.html"}],"status":"reported","summary":"NIST DADS defines heuristic as: An algorithm that usually, but not always, works or that gives nearly the right answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.histogramsort","kind":"method","label":"histogram sort","sources":[{"id":"nist-dads.histogramsort","title":"NIST Dictionary of Algorithms and Data Structures: histogramSort","url":"https://xlinux.nist.gov/dads/HTML/histogramSort.html"}],"status":"reported","summary":"NIST DADS defines histogram sort as: An efficient 3-pass refinement of a bucket sort algorithm. The first pass counts the number of items for each bucket in an auxiliary array , and then makes a running total so each auxiliary entry is the number of preceding items. The second pass puts each item in its proper bucket according to the auxiliary entry for the key of that item. The last pass sorts each bucket. Also known as interpolation sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.homeomorphic","kind":"concept","label":"homeomorphic","sources":[{"id":"nist-dads.homeomorphic","title":"NIST Dictionary of Algorithms and Data Structures: homeomorphic","url":"https://xlinux.nist.gov/dads/HTML/homeomorphic.html"}],"status":"reported","summary":"NIST DADS defines homeomorphic as: Two graphs are homeomorphic if they can be made isomorphic by inserting new vertices of degree 2 into edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.horizontalvismap","kind":"concept","label":"horizontal visibility map","sources":[{"id":"nist-dads.horizontalvismap","title":"NIST Dictionary of Algorithms and Data Structures: horizontalVisMap","url":"https://xlinux.nist.gov/dads/HTML/horizontalVisMap.html"}],"status":"reported","summary":"NIST DADS defines horizontal visibility map as: A partition of the plane into regions by drawing a horizontal straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be horizontally visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.hsadelta","kind":"method","label":"hsadelta","sources":[{"id":"nist-dads.hsadelta","title":"NIST Dictionary of Algorithms and Data Structures: hsadelta","url":"https://xlinux.nist.gov/dads/HTML/hsadelta.html"}],"status":"reported","summary":"NIST DADS defines hsadelta as: An algorithm to produce a sequence of insert and copy commands (an edit script ) which creates a new version file from a reference file. To begin, hash every block of the reference file and store every hash in a hash value array . Build a suffix array and three other data structures for quick access. Beginning at the first location in the version file, hash a block and look for the longest match in the reference file. Upon a match, encode an insert back to the previous match and a copy of the match. If no match, look at the next location. At the end, encode an insert for remaining unmatched characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hybridalgorithm","kind":"concept","label":"hybrid algorithm","sources":[{"id":"nist-dads.hybridalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: hybridAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/hybridAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines hybrid algorithm as: Any algorithm composed of simpler algorithms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.hyperedge","kind":"concept","label":"hyperedge","sources":[{"id":"nist-dads.hyperedge","title":"NIST Dictionary of Algorithms and Data Structures: hyperedge","url":"https://xlinux.nist.gov/dads/HTML/hyperedge.html"}],"status":"reported","summary":"NIST DADS defines hyperedge as: A connection between any number of vertices of a hypergraph . Formal Definition: A hyperedge is a set of vertices of a hypergraph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.idealrandomshuffle","kind":"method","label":"ideal random shuffle","sources":[{"id":"nist-dads.idealrandomshuffle","title":"NIST Dictionary of Algorithms and Data Structures: idealRandomShuffle","url":"https://xlinux.nist.gov/dads/HTML/idealRandomShuffle.html"}],"status":"reported","summary":"NIST DADS defines ideal random shuffle as: A permutation algorithm, or shuffle, that has exactly the same chance of producing any permutation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.idealmerge","kind":"method","label":"ideal merge","sources":[{"id":"nist-dads.idealmerge","title":"NIST Dictionary of Algorithms and Data Structures: idealmerge","url":"https://xlinux.nist.gov/dads/HTML/idealmerge.html"}],"status":"reported","summary":"NIST DADS defines ideal merge as: Merge n sorted streams into one output stream. To begin the streams are sorted by the value of the head element of each. Then the head of the first stream, which is the least since the streams were sorted, is removed and written to the output. That stream is inserted back into the list of streams according to its new head. Taking the head of the first stream and reinserting that stream is repeated until all elements have been processed. Using linear search to insert a stream into the list, the execution time is Θ(M N) where M is the total number of elements. Keeping the streams in a heap , the execution time is Θ(M log N) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.implication","kind":"concept","label":"implication","sources":[{"id":"nist-dads.implication","title":"NIST Dictionary of Algorithms and Data Structures: implication","url":"https://xlinux.nist.gov/dads/HTML/implication.html"}],"status":"reported","summary":"NIST DADS defines implication as: The boolean implies function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.implies","kind":"concept","label":"implies","sources":[{"id":"nist-dads.implies","title":"NIST Dictionary of Algorithms and Data Structures: implies","url":"https://xlinux.nist.gov/dads/HTML/implies.html"}],"status":"reported","summary":"NIST DADS defines implies as: Implication: 0 → 0 = 1, 0 → 1 = 1, 1 → 0 = 0, 1 → 1 = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.incompressbl","kind":"concept","label":"incompressible string","sources":[{"id":"nist-dads.incompressbl","title":"NIST Dictionary of Algorithms and Data Structures: incompressbl","url":"https://xlinux.nist.gov/dads/HTML/incompressbl.html"}],"status":"reported","summary":"NIST DADS defines incompressible string as: A string whose Kolmogorov complexity equals its length, so that it has no shorter encodings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.indegree","kind":"concept","label":"in-degree","sources":[{"id":"nist-dads.indegree","title":"NIST Dictionary of Algorithms and Data Structures: indegree","url":"https://xlinux.nist.gov/dads/HTML/indegree.html"}],"status":"reported","summary":"NIST DADS defines in-degree as: The number of edges coming into a vertex in a directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.independentset","kind":"concept","label":"independent set","sources":[{"id":"nist-dads.independentset","title":"NIST Dictionary of Algorithms and Data Structures: independentSet","url":"https://xlinux.nist.gov/dads/HTML/independentSet.html"}],"status":"reported","summary":"NIST DADS defines independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.indexfile","kind":"concept","label":"index file","sources":[{"id":"nist-dads.indexfile","title":"NIST Dictionary of Algorithms and Data Structures: indexfile","url":"https://xlinux.nist.gov/dads/HTML/indexfile.html"}],"status":"reported","summary":"NIST DADS defines index file as: A file which stores keys and an index into another file. The index file may have additional structure, e.g., be a B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.information","kind":"concept","label":"information theoretic bound","sources":[{"id":"nist-dads.information","title":"NIST Dictionary of Algorithms and Data Structures: information","url":"https://xlinux.nist.gov/dads/HTML/information.html"}],"status":"reported","summary":"NIST DADS defines information theoretic bound as: lower bounds on the execution of a computation based on the rate at which information can be accumulated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.inordertraversal","kind":"method","label":"in-order traversal","sources":[{"id":"nist-dads.inordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: inorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/inorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines in-order traversal as: Process all nodes of a tree by recursively processing the left subtree, then processing the root , and finally the right subtree. Also known as symmetric traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integer","kind":"concept","label":"integer polyhedron","sources":[{"id":"nist-dads.integer","title":"NIST Dictionary of Algorithms and Data Structures: integer","url":"https://xlinux.nist.gov/dads/HTML/integer.html"}],"status":"reported","summary":"NIST DADS defines integer polyhedron as: A polyhedron , all of whose extreme points are integer valued.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integerliner","kind":"concept","label":"integer linear program","sources":[{"id":"nist-dads.integerliner","title":"NIST Dictionary of Algorithms and Data Structures: integerliner","url":"https://xlinux.nist.gov/dads/HTML/integerliner.html"}],"status":"reported","summary":"NIST DADS defines integer linear program as: A linear program with additional constraints that all of the variables must take on integer values. Solving such problems is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.integermulti","kind":"concept","label":"integer multi-commodity flow","sources":[{"id":"nist-dads.integermulti","title":"NIST Dictionary of Algorithms and Data Structures: integermulti","url":"https://xlinux.nist.gov/dads/HTML/integermulti.html"}],"status":"reported","summary":"NIST DADS defines integer multi-commodity flow as: A multi-commodity flow in which the flow of each commodity through each edge must take an integer value. The term is also used to capture the multi-commodity flow problem in which each demand is routed along a single path.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.interactvprf","kind":"concept","label":"interactive proof system","sources":[{"id":"nist-dads.interactvprf","title":"NIST Dictionary of Algorithms and Data Structures: interactvprf","url":"https://xlinux.nist.gov/dads/HTML/interactvprf.html"}],"status":"reported","summary":"NIST DADS defines interactive proof system as: A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a string x in a given language , often with the goal of revealing no further details about this knowledge. The prover(s) and verifier are formally defined as probabilistic Turing machines with special \"interaction tapes\" for exchanging messages.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.interiorbasd","kind":"concept","label":"interior-based representation","sources":[{"id":"nist-dads.interiorbasd","title":"NIST Dictionary of Algorithms and Data Structures: interiorbasd","url":"https://xlinux.nist.gov/dads/HTML/interiorbasd.html"}],"status":"reported","summary":"NIST DADS defines interior-based representation as: A representation of a region that is based on its interior (i.e., the cells that compose it).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.internalnode","kind":"concept","label":"internal node","sources":[{"id":"nist-dads.internalnode","title":"NIST Dictionary of Algorithms and Data Structures: internalnode","url":"https://xlinux.nist.gov/dads/HTML/internalnode.html"}],"status":"reported","summary":"NIST DADS defines internal node as: A node of a tree that has one or more child nodes, equivalently, one that is not a leaf . Also known as nonterminal node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.interpsequen","kind":"method","label":"interpolation-sequential search","sources":[{"id":"nist-dads.interpsequen","title":"NIST Dictionary of Algorithms and Data Structures: interpsequen","url":"https://xlinux.nist.gov/dads/HTML/interpsequen.html"}],"status":"reported","summary":"NIST DADS defines interpolation-sequential search as: An approximate location is interpolated from the first and last items of a sorted array , then a linear search finds the actual location.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.intersection","kind":"concept","label":"intersection","sources":[{"id":"nist-dads.intersection","title":"NIST Dictionary of Algorithms and Data Structures: intersection","url":"https://xlinux.nist.gov/dads/HTML/intersection.html"}],"status":"reported","summary":"NIST DADS defines intersection as: The intersection of two sets is a set having those members which are in both sets.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.intractable","kind":"concept","label":"intractable","sources":[{"id":"nist-dads.intractable","title":"NIST Dictionary of Algorithms and Data Structures: intractable","url":"https://xlinux.nist.gov/dads/HTML/intractable.html"}],"status":"reported","summary":"NIST DADS defines intractable as: A problem for which no algorithm can exist which computes all instances of it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.introspectivesort","kind":"method","label":"introspective sort","sources":[{"id":"nist-dads.introspectivesort","title":"NIST Dictionary of Algorithms and Data Structures: introspectiveSort","url":"https://xlinux.nist.gov/dads/HTML/introspectiveSort.html"}],"status":"reported","summary":"NIST DADS defines introspective sort as: A variant of quicksort which switches to heapsort for pathological inputs, that is, when execution time is becoming quadratic. Also known as introsort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.inversesuffixarray","kind":"concept","label":"inverse suffix array","sources":[{"id":"nist-dads.inversesuffixarray","title":"NIST Dictionary of Algorithms and Data Structures: inverseSuffixArray","url":"https://xlinux.nist.gov/dads/HTML/inverseSuffixArray.html"}],"status":"reported","summary":"NIST DADS defines inverse suffix array as: For each position in a string , the inverse suffix array has its index in the string's suffix array . Formal Definition: Given a suffix array, sa, and the corresponding inverse suffix array, isa, isa[i] = j iff sa[j] = i.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.inversionlist","kind":"concept","label":"inversion list","sources":[{"id":"nist-dads.inversionlist","title":"NIST Dictionary of Algorithms and Data Structures: inversionList","url":"https://xlinux.nist.gov/dads/HTML/inversionList.html"}],"status":"reported","summary":"NIST DADS defines inversion list as: A set of non-overlapping numeric ranges, stored in an array in increasing order. Items in odd indexes begin ranges, and items in even indexes are the first number after the ends. Use a form of binary search to determine if a number is in any of the ranges. If the search ends on an odd index (a beginning), the number is in the set. If the search ends on an even index (a just-after-end) or outside the array, it is not in the set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertedfileindex","kind":"concept","label":"inverted file index","sources":[{"id":"nist-dads.invertedfileindex","title":"NIST Dictionary of Algorithms and Data Structures: invertedFileIndex","url":"https://xlinux.nist.gov/dads/HTML/invertedFileIndex.html"}],"status":"reported","summary":"NIST DADS defines inverted file index as: An inverted index that only indicates the text in which a word appears, not where the word appears within the text.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertedindex","kind":"concept","label":"inverted index","sources":[{"id":"nist-dads.invertedindex","title":"NIST Dictionary of Algorithms and Data Structures: invertedIndex","url":"https://xlinux.nist.gov/dads/HTML/invertedIndex.html"}],"status":"reported","summary":"NIST DADS defines inverted index as: An index into a set of texts of the words in the texts. The index is accessed by some search method. Each index entry gives the word and a list of texts, possibly with locations within the text, where the word occurs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.invertiblebloomtable","kind":"concept","label":"invertible Bloom lookup table","sources":[{"id":"nist-dads.invertiblebloomtable","title":"NIST Dictionary of Algorithms and Data Structures: invertibleBloomTable","url":"https://xlinux.nist.gov/dads/HTML/invertibleBloomTable.html"}],"status":"reported","summary":"NIST DADS defines invertible Bloom lookup table as: Algorithms and an array of cells to store key/value pairs. Each cell has a count of how many pairs are mapped to the cell, the sum of the keys mapped to it, and the sum of the values mapped to it. Using k hash functions , each pair is mapped to T[h 1 (k)], T[h 2 (k)], ..., T[h k (k)]. Also known as IBLT.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.irreflexive","kind":"concept","label":"irreflexive","sources":[{"id":"nist-dads.irreflexive","title":"NIST Dictionary of Algorithms and Data Structures: irreflexive","url":"https://xlinux.nist.gov/dads/HTML/irreflexive.html"}],"status":"reported","summary":"NIST DADS defines irreflexive as: A binary relation R for which there is no element a such that a R a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.isomorphic","kind":"concept","label":"isomorphic","sources":[{"id":"nist-dads.isomorphic","title":"NIST Dictionary of Algorithms and Data Structures: isomorphic","url":"https://xlinux.nist.gov/dads/HTML/isomorphic.html"}],"status":"reported","summary":"NIST DADS defines isomorphic as: Two graphs are isomorphic if there is a one-to-one correspondence between their vertices and there is an edge between two vertices of one graph if and only if there is an edge between the two corresponding vertices in the other graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.j_sort","kind":"method","label":"J sort","sources":[{"id":"nist-dads.j_sort","title":"NIST Dictionary of Algorithms and Data Structures: j_sort","url":"https://xlinux.nist.gov/dads/HTML/j_sort.html"}],"status":"reported","summary":"NIST DADS defines J sort as: An in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.jarowinkler","kind":"method","label":"Jaro-Winkler","sources":[{"id":"nist-dads.jarowinkler","title":"NIST Dictionary of Algorithms and Data Structures: jaroWinkler","url":"https://xlinux.nist.gov/dads/HTML/jaroWinkler.html"}],"status":"reported","summary":"NIST DADS defines Jaro-Winkler as: A measure of similarity between two strings . The Jaro measure is the weighted sum of percentage of matched characters from each file and transposed characters. Winkler increased this measure for matching initial characters, then rescaled it by a piecewise function, whose intervals and weights depend on the type of string (first name, last name, street, etc.).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.jellyfish","kind":"concept","label":"jelly-fish","sources":[{"id":"nist-dads.jellyfish","title":"NIST Dictionary of Algorithms and Data Structures: jellyfish","url":"https://xlinux.nist.gov/dads/HTML/jellyfish.html"}],"status":"reported","summary":"NIST DADS defines jelly-fish as: A theoretical data structure for n items. It starts with a balanced binary search tree of about √(n) nodes. The leaf nodes lead to \"tentacles\" or linked lists , each of about √(n) nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.johnsontrotter","kind":"method","label":"Johnson-Trotter","sources":[{"id":"nist-dads.johnsontrotter","title":"NIST Dictionary of Algorithms and Data Structures: johnsonTrotter","url":"https://xlinux.nist.gov/dads/HTML/johnsonTrotter.html"}],"status":"reported","summary":"NIST DADS defines Johnson-Trotter as: Generate permutations by swapping one adjacent pair of elements at a time. Also known as Steinhaus-Johnson-Trotter, Trotter-Johnson.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.johnsonsalgorithm","kind":"method","label":"Johnson's algorithm","sources":[{"id":"nist-dads.johnsonsalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: johnsonsAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/johnsonsAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Johnson's algorithm as: An algorithm to solve the all pairs shortest path problem in a sparse weighted, directed graph . First, it adds a new node with zero weight edges from it to all other nodes, and runs the Bellman-Ford algorithm to check for negative weight cycles and find h(v), the least weight of a path from the new node to node v. Next it reweights the edges using the nodes' h(v) values. Finally for each node, it runs Dijkstra's algorithm and stores the computed least weight to other nodes, reweighted using the nodes' h(v) values, as the final weight. The time complexity is O(V²log V + VE) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.k2tree","kind":"concept","label":"k²-tree","sources":[{"id":"nist-dads.k2tree","title":"NIST Dictionary of Algorithms and Data Structures: k2tree","url":"https://xlinux.nist.gov/dads/HTML/k2tree.html"}],"status":"reported","summary":"NIST DADS defines k²-tree as: A compact representation of a sparse directed graph . It requires 1 to 3 bits per edge. Many access functions, like successor(s), predecessor(s), and range (all links from a range of vertices to another range of vertices), have very efficient implementations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karnaughmap","kind":"method","label":"Karnaugh map","sources":[{"id":"nist-dads.karnaughmap","title":"NIST Dictionary of Algorithms and Data Structures: karnaughmap","url":"https://xlinux.nist.gov/dads/HTML/karnaughmap.html"}],"status":"reported","summary":"NIST DADS defines Karnaugh map as: A method for minimizing a boolean expression , usually aided by a rectangular map of the value of the expression for all possible input values. Input values are arranged in a Gray code . Maximal rectangular groups that cover the inputs where the expression is true give a minimum implementation. Also known as Veitch diagram, KV diagram.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karprabin","kind":"method","label":"Karp-Rabin","sources":[{"id":"nist-dads.karprabin","title":"NIST Dictionary of Algorithms and Data Structures: karpRabin","url":"https://xlinux.nist.gov/dads/HTML/karpRabin.html"}],"status":"reported","summary":"NIST DADS defines Karp-Rabin as: A string matching algorithm that compares string's hash values, rather than the strings themselves. For efficiency, the hash value of the next position in the text is easily computed from the hash value of the current position. Also known as Rabin-Karp.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karpreductin","kind":"concept","label":"Karp reduction","sources":[{"id":"nist-dads.karpreductin","title":"NIST Dictionary of Algorithms and Data Structures: karpreductin","url":"https://xlinux.nist.gov/dads/HTML/karpreductin.html"}],"status":"reported","summary":"NIST DADS defines Karp reduction as: A reduction given by a polynomial time computable transformation function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.karyhuffman","kind":"method","label":"k-ary Huffman coding","sources":[{"id":"nist-dads.karyhuffman","title":"NIST Dictionary of Algorithms and Data Structures: karyHuffman","url":"https://xlinux.nist.gov/dads/HTML/karyHuffman.html"}],"status":"reported","summary":"NIST DADS defines k-ary Huffman coding as: A minimal variable-length coding based on the frequency of each character. Similar to a Huffman coding , but joins k trees into a k-ary tree at each step, and uses k symbols for each level.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karytree","kind":"concept","label":"k-ary tree","sources":[{"id":"nist-dads.karytree","title":"NIST Dictionary of Algorithms and Data Structures: karyTree","url":"https://xlinux.nist.gov/dads/HTML/karyTree.html"}],"status":"reported","summary":"NIST DADS defines k-ary tree as: A tree with no more than k children for each node . Also known as k-way tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.karyheap","kind":"concept","label":"k-ary heap","sources":[{"id":"nist-dads.karyheap","title":"NIST Dictionary of Algorithms and Data Structures: karyheap","url":"https://xlinux.nist.gov/dads/HTML/karyheap.html"}],"status":"reported","summary":"NIST DADS defines k-ary heap as: A complete tree where every node has a key more extreme (greater or less) than the key of its parent . Each node has k or fewer children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kcoloring","kind":"concept","label":"k-coloring","sources":[{"id":"nist-dads.kcoloring","title":"NIST Dictionary of Algorithms and Data Structures: kcoloring","url":"https://xlinux.nist.gov/dads/HTML/kcoloring.html"}],"status":"reported","summary":"NIST DADS defines k-coloring as: 1) The assignment of k colors (or any distinct marks) to the vertices of a graph . 2) The assignment of k colors to the edges of a graph . A coloring is a proper coloring if no two adjacent vertices or edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kconnectedgraph","kind":"concept","label":"k-connected graph","sources":[{"id":"nist-dads.kconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: kconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/kconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines k-connected graph as: A connected graph such that deleting any k-1 vertices (and incident edges ) results in a graph that is still connected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdbtree","kind":"concept","label":"k-d-B-tree","sources":[{"id":"nist-dads.kdbtree","title":"NIST Dictionary of Algorithms and Data Structures: kdbtree","url":"https://xlinux.nist.gov/dads/HTML/kdbtree.html"}],"status":"reported","summary":"NIST DADS defines k-d-B-tree as: A data structure which splits multidimensional spaces like an adaptive k-d tree , but balances the resulting tree like a B-tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdimensional","kind":"concept","label":"k-dimensional","sources":[{"id":"nist-dads.kdimensional","title":"NIST Dictionary of Algorithms and Data Structures: kdimensional","url":"https://xlinux.nist.gov/dads/HTML/kdimensional.html"}],"status":"reported","summary":"NIST DADS defines k-dimensional as: (1) Dealing with or restricted to a space where location can be completely described with exactly k orthogonal axes. (2) Dealing with a space of any number of dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdominant","kind":"concept","label":"K-dominant match","sources":[{"id":"nist-dads.kdominant","title":"NIST Dictionary of Algorithms and Data Structures: kdominant","url":"https://xlinux.nist.gov/dads/HTML/kdominant.html"}],"status":"reported","summary":"NIST DADS defines K-dominant match as: A match [i,j] having rank k and such that for any other pair [i',j'] of rank k either i'>i and j'≤ j or i' ≤ i and j'>j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kdtree","kind":"concept","label":"k-d tree","sources":[{"id":"nist-dads.kdtree","title":"NIST Dictionary of Algorithms and Data Structures: kdtree","url":"https://xlinux.nist.gov/dads/HTML/kdtree.html"}],"status":"reported","summary":"NIST DADS defines k-d tree as: A multidimensional search tree for points in k dimensional space. Levels of the tree are split along successive dimensions at the points.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.key","kind":"concept","label":"key","sources":[{"id":"nist-dads.key","title":"NIST Dictionary of Algorithms and Data Structures: key","url":"https://xlinux.nist.gov/dads/HTML/key.html"}],"status":"reported","summary":"NIST DADS defines key as: The part of a group of data by which it is sorted, indexed, cross referenced, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.knightstour","kind":"concept","label":"knight's tour","sources":[{"id":"nist-dads.knightstour","title":"NIST Dictionary of Algorithms and Data Structures: knightstour","url":"https://xlinux.nist.gov/dads/HTML/knightstour.html"}],"status":"reported","summary":"NIST DADS defines knight's tour as: A series of moves of a chess knight that visits all squares on the board exactly once.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.knuthmorrispratt","kind":"method","label":"Knuth-Morris-Pratt algorithm","sources":[{"id":"nist-dads.knuthmorrispratt","title":"NIST Dictionary of Algorithms and Data Structures: knuthMorrisPratt","url":"https://xlinux.nist.gov/dads/HTML/knuthMorrisPratt.html"}],"status":"reported","summary":"NIST DADS defines Knuth-Morris-Pratt algorithm as: A string matching algorithm that turns the search string into a finite state machine , then runs the machine with the string to be searched as the input string. Execution time is O(m+n) , where m is the length of the search string, and n is the length of the string to be searched. Also known as KMP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kolmogorov","kind":"concept","label":"Kolmogorov complexity","sources":[{"id":"nist-dads.kolmogorov","title":"NIST Dictionary of Algorithms and Data Structures: kolmogorov","url":"https://xlinux.nist.gov/dads/HTML/kolmogorov.html"}],"status":"reported","summary":"NIST DADS defines Kolmogorov complexity as: The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kripkestruct","kind":"concept","label":"Kripke structure","sources":[{"id":"nist-dads.kripkestruct","title":"NIST Dictionary of Algorithms and Data Structures: kripkeStruct","url":"https://xlinux.nist.gov/dads/HTML/kripkeStruct.html"}],"status":"reported","summary":"NIST DADS defines Kripke structure as: A nondeterministic finite state machine whose states are labeled with boolean variables, which are the evaluations of expressions in that state. It may be extended with fairness constraints.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.kwaymergesort","kind":"method","label":"k-way merge sort","sources":[{"id":"nist-dads.kwaymergesort","title":"NIST Dictionary of Algorithms and Data Structures: kwayMergeSort","url":"https://xlinux.nist.gov/dads/HTML/kwayMergeSort.html"}],"status":"reported","summary":"NIST DADS defines k-way merge sort as: A merge sort that sorts a data stream using repeated merges. It distributes the input into k streams by repeatedly reading a block of input that fits in memory, called a run , sorting it, then writing it to the next stream. It merges runs from the k streams into an output stream. It then repeatedly distributes the runs in the output stream to the k streams and merges them until there is a single sorted output. Also known as p-way merge sort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.kwaymerge","kind":"concept","label":"k-way merge","sources":[{"id":"nist-dads.kwaymerge","title":"NIST Dictionary of Algorithms and Data Structures: kwaymerge","url":"https://xlinux.nist.gov/dads/HTML/kwaymerge.html"}],"status":"reported","summary":"NIST DADS defines k-way merge as: Combine k sorted data streams into a single sorted stream.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.labeledgraph","kind":"concept","label":"labeled graph","sources":[{"id":"nist-dads.labeledgraph","title":"NIST Dictionary of Algorithms and Data Structures: labeledgraph","url":"https://xlinux.nist.gov/dads/HTML/labeledgraph.html"}],"status":"reported","summary":"NIST DADS defines labeled graph as: A graph which has labels associated with each edge or each vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.language","kind":"concept","label":"language","sources":[{"id":"nist-dads.language","title":"NIST Dictionary of Algorithms and Data Structures: language","url":"https://xlinux.nist.gov/dads/HTML/language.html"}],"status":"reported","summary":"NIST DADS defines language as: A set of strings over some fixed alphabet . A characterization of inputs which may or may not be solved by algorithms . Also known as formal language.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lasvegas","kind":"method","label":"Las Vegas algorithm","sources":[{"id":"nist-dads.lasvegas","title":"NIST Dictionary of Algorithms and Data Structures: lasVegas","url":"https://xlinux.nist.gov/dads/HTML/lasVegas.html"}],"status":"reported","summary":"NIST DADS defines Las Vegas algorithm as: A randomized algorithm that always produces correct results, with the only variation from one run to another being its running time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lastfirstout","kind":"concept","label":"last-in, first-out","sources":[{"id":"nist-dads.lastfirstout","title":"NIST Dictionary of Algorithms and Data Structures: lastfirstout","url":"https://xlinux.nist.gov/dads/HTML/lastfirstout.html"}],"status":"reported","summary":"NIST DADS defines last-in, first-out as: A policy that the most recently arrived item is processed first. A stack implements this.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lattice","kind":"concept","label":"lattice","sources":[{"id":"nist-dads.lattice","title":"NIST Dictionary of Algorithms and Data Structures: lattice","url":"https://xlinux.nist.gov/dads/HTML/lattice.html"}],"status":"reported","summary":"NIST DADS defines lattice as: A point lattice generated by taking integer linear combinations of a set of basis vectors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.lcfshashing","kind":"method","label":"LCFS hashing","sources":[{"id":"nist-dads.lcfshashing","title":"NIST Dictionary of Algorithms and Data Structures: lcfsHashing","url":"https://xlinux.nist.gov/dads/HTML/lcfsHashing.html"}],"status":"reported","summary":"NIST DADS defines LCFS hashing as: In case of collision , move the existing item to another position, dictated by the open addressing scheme used.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leastcommonmultiple","kind":"concept","label":"least common multiple","sources":[{"id":"nist-dads.leastcommonmultiple","title":"NIST Dictionary of Algorithms and Data Structures: leastCommonMultiple","url":"https://xlinux.nist.gov/dads/HTML/leastCommonMultiple.html"}],"status":"reported","summary":"NIST DADS defines least common multiple as: The least integer which is a multiple of given integers. For instance, LCM(6, 10) = 30. Also known as LCM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.leftisttree","kind":"concept","label":"leftist tree","sources":[{"id":"nist-dads.leftisttree","title":"NIST Dictionary of Algorithms and Data Structures: leftisttree","url":"https://xlinux.nist.gov/dads/HTML/leftisttree.html"}],"status":"reported","summary":"NIST DADS defines leftist tree as: A priority queue implemented with a variant of a binary tree . Every node has a count which is the distance to the nearest leaf . In addition to the heap property , leftist trees are kept so the right descendant of each node has the shorter distance to a leaf.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.leftrotation","kind":"method","label":"left rotation","sources":[{"id":"nist-dads.leftrotation","title":"NIST Dictionary of Algorithms and Data Structures: leftrotation","url":"https://xlinux.nist.gov/dads/HTML/leftrotation.html"}],"status":"reported","summary":"NIST DADS defines left rotation as: (1) In a binary search tree , pushing a node N down and to the left to balance the tree. N's right child replaces N, and the right child's left child becomes N's right child. (2) In an array , moving all items to the next lower location. The first item is moved to the last location, which is now vacant. (3) In a list , removing the head and inserting it at the tail . Also known as rotate left.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.letteromega","kind":"concept","label":"omega","sources":[{"id":"nist-dads.letteromega","title":"NIST Dictionary of Algorithms and Data Structures: letterOmega","url":"https://xlinux.nist.gov/dads/HTML/letterOmega.html"}],"status":"reported","summary":"NIST DADS defines omega as: The Greek letter written as ω (see ω(n) ) or Ω (see Ω(n) ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.level","kind":"concept","label":"level","sources":[{"id":"nist-dads.level","title":"NIST Dictionary of Algorithms and Data Structures: level","url":"https://xlinux.nist.gov/dads/HTML/level.html"}],"status":"reported","summary":"NIST DADS defines level as: (1) All the nodes of a tree with the same depth . (2) Of a node, the depth.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.levelordertraversal","kind":"method","label":"level-order traversal","sources":[{"id":"nist-dads.levelordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: levelOrderTraversal","url":"https://xlinux.nist.gov/dads/HTML/levelOrderTraversal.html"}],"status":"reported","summary":"NIST DADS defines level-order traversal as: Process all nodes of a tree by depth : first the root , then the children of the root, etc. Equivalent to a breadth-first search from the root.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lexicgrphcl","kind":"concept","label":"lexicographical order","sources":[{"id":"nist-dads.lexicgrphcl","title":"NIST Dictionary of Algorithms and Data Structures: lexicgrphcl","url":"https://xlinux.nist.gov/dads/HTML/lexicgrphcl.html"}],"status":"reported","summary":"NIST DADS defines lexicographical order as: Alphabetical or \"dictionary\" order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.linearhash","kind":"method","label":"linear hash","sources":[{"id":"nist-dads.linearhash","title":"NIST Dictionary of Algorithms and Data Structures: linearhash","url":"https://xlinux.nist.gov/dads/HTML/linearhash.html"}],"status":"reported","summary":"NIST DADS defines linear hash as: A numeric function that maintains the order of input keys while changing their spacing. Formal Definition: A hash function f for keys in S such that k1, k2 ∈ S ∧ k1 > k2 → f(k1) > f(k2). Also known as order-preserving hash.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linearquadtr","kind":"concept","label":"linear quadtree","sources":[{"id":"nist-dads.linearquadtr","title":"NIST Dictionary of Algorithms and Data Structures: linearquadtr","url":"https://xlinux.nist.gov/dads/HTML/linearquadtr.html"}],"status":"reported","summary":"NIST DADS defines linear quadtree as: A quadtree implemented as a single array of nodes .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.link","kind":"concept","label":"link","sources":[{"id":"nist-dads.link","title":"NIST Dictionary of Algorithms and Data Structures: link","url":"https://xlinux.nist.gov/dads/HTML/link.html"}],"status":"reported","summary":"NIST DADS defines link as: A reference, pointer, or access handle to another part of the data structure. Often, a memory address.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.linkeddatasignature","kind":"concept","label":"linked data signature","sources":[{"id":"nist-dads.linkeddatasignature","title":"NIST Dictionary of Algorithms and Data Structures: linkedDataSignature","url":"https://xlinux.nist.gov/dads/HTML/linkedDataSignature.html"}],"status":"reported","summary":"NIST DADS defines linked data signature as: A digital signature, and information to verify it, for linked data. Also known as LDS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.listcontrctn","kind":"concept","label":"list contraction","sources":[{"id":"nist-dads.listcontrctn","title":"NIST Dictionary of Algorithms and Data Structures: listcontrctn","url":"https://xlinux.nist.gov/dads/HTML/listcontrctn.html"}],"status":"reported","summary":"NIST DADS defines list contraction as: Contracting a list by removing some of the items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.littleonotation","kind":"concept","label":"little-o notation","sources":[{"id":"nist-dads.littleonotation","title":"NIST Dictionary of Algorithms and Data Structures: littleOnotation","url":"https://xlinux.nist.gov/dads/HTML/littleOnotation.html"}],"status":"reported","summary":"NIST DADS defines little-o notation as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = o(g(n)) means f(n) becomes insignificant relative to g(n) as n approaches infinity. The notation is read, \"f of n is little oh of g of n\". Formal Definition: f(n) = o(g(n)) means for all c > 0 there exists some k > 0 such that 0 ≤ f(n) < cg(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.loadfactor","kind":"concept","label":"load factor","sources":[{"id":"nist-dads.loadfactor","title":"NIST Dictionary of Algorithms and Data Structures: loadfactor","url":"https://xlinux.nist.gov/dads/HTML/loadfactor.html"}],"status":"reported","summary":"NIST DADS defines load factor as: The number of elements in a hash table divided by the number of slots. Usually written α (alpha).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.localalgnmnt","kind":"concept","label":"local alignment","sources":[{"id":"nist-dads.localalgnmnt","title":"NIST Dictionary of Algorithms and Data Structures: localalgnmnt","url":"https://xlinux.nist.gov/dads/HTML/localalgnmnt.html"}],"status":"reported","summary":"NIST DADS defines local alignment as: The detection of local similarities among two or more strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.localitysensitivehashing","kind":"method","label":"locality-sensitive hashing","sources":[{"id":"nist-dads.localitysensitivehashing","title":"NIST Dictionary of Algorithms and Data Structures: localitySensitiveHashing","url":"https://xlinux.nist.gov/dads/HTML/localitySensitiveHashing.html"}],"status":"reported","summary":"NIST DADS defines locality-sensitive hashing as: A probabilistic algorithm to quickly find points in a high dimensional space near a query point. Preprocessing: put every point in multiple hash tables . Each table has its own locality-sensitive hash function and uses buckets (or chaining ) since many collisions are expected. The hash functions come from a family of functions. Finding: look up the query point in each hash table, and compute the distance from the query point of every point in the bucket.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.localoptimum","kind":"concept","label":"local optimum","sources":[{"id":"nist-dads.localoptimum","title":"NIST Dictionary of Algorithms and Data Structures: localoptimum","url":"https://xlinux.nist.gov/dads/HTML/localoptimum.html"}],"status":"reported","summary":"NIST DADS defines local optimum as: A solution to a problem that is better than all other solutions that are slightly different, but worse than the global optimum .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.logarithmic","kind":"concept","label":"logarithmic","sources":[{"id":"nist-dads.logarithmic","title":"NIST Dictionary of Algorithms and Data Structures: logarithmic","url":"https://xlinux.nist.gov/dads/HTML/logarithmic.html"}],"status":"reported","summary":"NIST DADS defines logarithmic as: (1) Any function that is a constant times the logarithm of the argument: f(x)=c log x. (2) In complexity theory, when the measure of computation, m(n) (usually execution time or memory space), is bounded by a logarithmic function of the problem size, n. More formally m(n) = O(log n) . (3) Sometimes imprecisely used to mean polylogarithmic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.longestcommonsubsequence","kind":"concept","label":"longest common subsequence","sources":[{"id":"nist-dads.longestcommonsubsequence","title":"NIST Dictionary of Algorithms and Data Structures: longestCommonSubsequence","url":"https://xlinux.nist.gov/dads/HTML/longestCommonSubsequence.html"}],"status":"reported","summary":"NIST DADS defines longest common subsequence as: The problem of finding a maximum length (or maximum weight) subsequence of two or more strings . Also known as heaviest common subsequence.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.longestcommonsubstring","kind":"concept","label":"longest common substring","sources":[{"id":"nist-dads.longestcommonsubstring","title":"NIST Dictionary of Algorithms and Data Structures: longestCommonSubstring","url":"https://xlinux.nist.gov/dads/HTML/longestCommonSubstring.html"}],"status":"reported","summary":"NIST DADS defines longest common substring as: Find the longest substring of two or more strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowertriangularmatrix","kind":"concept","label":"lower triangular matrix","sources":[{"id":"nist-dads.lowertriangularmatrix","title":"NIST Dictionary of Algorithms and Data Structures: lowerTriangularMatrix","url":"https://xlinux.nist.gov/dads/HTML/lowerTriangularMatrix.html"}],"status":"reported","summary":"NIST DADS defines lower triangular matrix as: A matrix that is only defined at (i,j) when i ≥ j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowerbound","kind":"concept","label":"lower bound","sources":[{"id":"nist-dads.lowerbound","title":"NIST Dictionary of Algorithms and Data Structures: lowerbound","url":"https://xlinux.nist.gov/dads/HTML/lowerbound.html"}],"status":"reported","summary":"NIST DADS defines lower bound as: A function or growth rate below which solving a problem is impossible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lowestcommon","kind":"concept","label":"lowest common ancestor","sources":[{"id":"nist-dads.lowestcommon","title":"NIST Dictionary of Algorithms and Data Structures: lowestcommon","url":"https://xlinux.nist.gov/dads/HTML/lowestcommon.html"}],"status":"reported","summary":"NIST DADS defines lowest common ancestor as: The deepest node in a tree that is an ancestor of two given leaves .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.lreduction","kind":"concept","label":"l-reduction","sources":[{"id":"nist-dads.lreduction","title":"NIST Dictionary of Algorithms and Data Structures: lreduction","url":"https://xlinux.nist.gov/dads/HTML/lreduction.html"}],"status":"reported","summary":"NIST DADS defines l-reduction as: A Karp reduction that preserves approximation properties of optimization problems .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.luckysort","kind":"method","label":"lucky sort","sources":[{"id":"nist-dads.luckysort","title":"NIST Dictionary of Algorithms and Data Structures: luckySort","url":"https://xlinux.nist.gov/dads/HTML/luckySort.html"}],"status":"reported","summary":"NIST DADS defines lucky sort as: The best possible sort algorithm: it is so lucky that the input is already sorted, and it need do nothing!","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.malhotrakumr","kind":"method","label":"Malhotra-Kumar-Maheshwari blocking flow","sources":[{"id":"nist-dads.malhotrakumr","title":"NIST Dictionary of Algorithms and Data Structures: malhotraKumr","url":"https://xlinux.nist.gov/dads/HTML/malhotraKumr.html"}],"status":"reported","summary":"NIST DADS defines Malhotra-Kumar-Maheshwari blocking flow as: Given a flow function and its corresponding residual graph (a maximum-flow problem ), select a vertex with the least throughput and greedily push the maximum flow from it to the sink . This is repeated until all vertices are deleted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.manhattandistance","kind":"concept","label":"Manhattan distance","sources":[{"id":"nist-dads.manhattandistance","title":"NIST Dictionary of Algorithms and Data Structures: manhattanDistance","url":"https://xlinux.nist.gov/dads/HTML/manhattanDistance.html"}],"status":"reported","summary":"NIST DADS defines Manhattan distance as: The distance between two points measured along axes at right angles. In a plane with p 1 at (x 1 , y 1 ) and p 2 at (x 2 , y 2 ), it is |x 1 - x 2 | + |y 1 - y 2 |.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.manyonerdctn","kind":"concept","label":"many-one reduction","sources":[{"id":"nist-dads.manyonerdctn","title":"NIST Dictionary of Algorithms and Data Structures: manyonerdctn","url":"https://xlinux.nist.gov/dads/HTML/manyonerdctn.html"}],"status":"reported","summary":"NIST DADS defines many-one reduction as: A reduction that maps an instance of one problem into an equivalent instance of another problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.markovchain","kind":"concept","label":"Markov chain","sources":[{"id":"nist-dads.markovchain","title":"NIST Dictionary of Algorithms and Data Structures: markovchain","url":"https://xlinux.nist.gov/dads/HTML/markovchain.html"}],"status":"reported","summary":"NIST DADS defines Markov chain as: A finite state machine with probabilities for each transition, that is, a probability that the next state is s j given that the current state is s i .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mastertheorm","kind":"concept","label":"Master theorem","sources":[{"id":"nist-dads.mastertheorm","title":"NIST Dictionary of Algorithms and Data Structures: mastertheorm","url":"https://xlinux.nist.gov/dads/HTML/mastertheorm.html"}],"status":"reported","summary":"NIST DADS defines Master theorem as: A theorem giving a solution in asymptotic terms for recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1 are constants and n/b means either ⌊ n/b⌋ or ⌈ n/b⌉.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matchededge","kind":"concept","label":"matched edge","sources":[{"id":"nist-dads.matchededge","title":"NIST Dictionary of Algorithms and Data Structures: matchededge","url":"https://xlinux.nist.gov/dads/HTML/matchededge.html"}],"status":"reported","summary":"NIST DADS defines matched edge as: An edge which is in a matching .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matchedvertx","kind":"concept","label":"matched vertex","sources":[{"id":"nist-dads.matchedvertx","title":"NIST Dictionary of Algorithms and Data Structures: matchedvertx","url":"https://xlinux.nist.gov/dads/HTML/matchedvertx.html"}],"status":"reported","summary":"NIST DADS defines matched vertex as: A vertex on an matched edge in a matching , or, one which has been matched.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matching","kind":"concept","label":"matching","sources":[{"id":"nist-dads.matching","title":"NIST Dictionary of Algorithms and Data Structures: matching","url":"https://xlinux.nist.gov/dads/HTML/matching.html"}],"status":"reported","summary":"NIST DADS defines matching as: (1) A subgraph in which every vertex has a degree at most one. In other words, no two edges share a common vertex. (2) The problem of finding such a subgraph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matrix","kind":"concept","label":"matrix","sources":[{"id":"nist-dads.matrix","title":"NIST Dictionary of Algorithms and Data Structures: matrix","url":"https://xlinux.nist.gov/dads/HTML/matrix.html"}],"status":"reported","summary":"NIST DADS defines matrix as: A two-dimensional array. By convention, the first index is the row, and the second index is the column.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.matrxchnmltp","kind":"concept","label":"matrix-chain multiplication problem","sources":[{"id":"nist-dads.matrxchnmltp","title":"NIST Dictionary of Algorithms and Data Structures: matrxchnmltp","url":"https://xlinux.nist.gov/dads/HTML/matrxchnmltp.html"}],"status":"reported","summary":"NIST DADS defines matrix-chain multiplication problem as: Given a sequence of matrices such that any matrix may be multiplied by the previous matrix, find the best association such that the result is obtained with the minimum number of arithmetic operations. One may use dynamic programming to find the best association.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maxheapprop","kind":"concept","label":"max-heap property","sources":[{"id":"nist-dads.maxheapprop","title":"NIST Dictionary of Algorithms and Data Structures: maxheapprop","url":"https://xlinux.nist.gov/dads/HTML/maxheapprop.html"}],"status":"reported","summary":"NIST DADS defines max-heap property as: Each node in a tree has a key which is less than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximalindependentset","kind":"concept","label":"maximal independent set","sources":[{"id":"nist-dads.maximalindependentset","title":"NIST Dictionary of Algorithms and Data Structures: maximalIndependentSet","url":"https://xlinux.nist.gov/dads/HTML/maximalIndependentSet.html"}],"status":"reported","summary":"NIST DADS defines maximal independent set as: A set of vertices in a graph such that for any pair of vertices, there is no edge between them and such that no more vertices can be added and it still be an independent set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximallyconnectedcomponent","kind":"concept","label":"maximally connected component","sources":[{"id":"nist-dads.maximallyconnectedcomponent","title":"NIST Dictionary of Algorithms and Data Structures: maximallyConnectedComponent","url":"https://xlinux.nist.gov/dads/HTML/maximallyConnectedComponent.html"}],"status":"reported","summary":"NIST DADS defines maximally connected component as: A connected subgraph of a graph to which no vertex can be added and it still be connected. Formal Definition: Given a graph G=(V, E), a subgraph S=(V', E') is a maximally connected component if S is connected , and for all vertices u such that u∈ V and u∉ V' there is no vertex v∈ V' for which (u, v)∈ E.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.maximumflow","kind":"concept","label":"maximum-flow problem","sources":[{"id":"nist-dads.maximumflow","title":"NIST Dictionary of Algorithms and Data Structures: maximumflow","url":"https://xlinux.nist.gov/dads/HTML/maximumflow.html"}],"status":"reported","summary":"NIST DADS defines maximum-flow problem as: The problem of finding the maximum flow between any two vertices of a directed graph . Also known as network flow problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mealymachine","kind":"concept","label":"Mealy machine","sources":[{"id":"nist-dads.mealymachine","title":"NIST Dictionary of Algorithms and Data Structures: mealyMachine","url":"https://xlinux.nist.gov/dads/HTML/mealyMachine.html"}],"status":"reported","summary":"NIST DADS defines Mealy machine as: A finite state machine which produces an output for each transition .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mean","kind":"concept","label":"mean","sources":[{"id":"nist-dads.mean","title":"NIST Dictionary of Algorithms and Data Structures: mean","url":"https://xlinux.nist.gov/dads/HTML/mean.html"}],"status":"reported","summary":"NIST DADS defines mean as: The (arithmetic) mean of some values is the sum of all values divided by the number of values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.median","kind":"concept","label":"median","sources":[{"id":"nist-dads.median","title":"NIST Dictionary of Algorithms and Data Structures: median","url":"https://xlinux.nist.gov/dads/HTML/median.html"}],"status":"reported","summary":"NIST DADS defines median as: The value that has an equal number of values greater and less than it. For an even number of values, it is the mean of the two middle values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.meld","kind":"concept","label":"meld","sources":[{"id":"nist-dads.meld","title":"NIST Dictionary of Algorithms and Data Structures: meld","url":"https://xlinux.nist.gov/dads/HTML/meld.html"}],"status":"reported","summary":"NIST DADS defines meld as: Joining several data structures with particular properties into one large data structure having those properties. For instance, some priority queue implementations support the operation of joining two priority queues into a larger one.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.metaheuristic","kind":"method","label":"metaheuristic","sources":[{"id":"nist-dads.metaheuristic","title":"NIST Dictionary of Algorithms and Data Structures: metaheuristic","url":"https://xlinux.nist.gov/dads/HTML/metaheuristic.html"}],"status":"reported","summary":"NIST DADS defines metaheuristic as: (1) A high-level algorithmic framework or approach that can be specialized to solve optimization problems . (2) A high-level strategy that guides other heuristics in a search for feasible solutions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.metaphone","kind":"method","label":"metaphone","sources":[{"id":"nist-dads.metaphone","title":"NIST Dictionary of Algorithms and Data Structures: metaphone","url":"https://xlinux.nist.gov/dads/HTML/metaphone.html"}],"status":"reported","summary":"NIST DADS defines metaphone as: An algorithm to code English words phonetically by reducing them to 16 consonant sounds. A better variant is double metaphone .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.midrange","kind":"concept","label":"midrange","sources":[{"id":"nist-dads.midrange","title":"NIST Dictionary of Algorithms and Data Structures: midrange","url":"https://xlinux.nist.gov/dads/HTML/midrange.html"}],"status":"reported","summary":"NIST DADS defines midrange as: The sum of the minimum and maximum values, divided by two.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minheapprop","kind":"concept","label":"min-heap property","sources":[{"id":"nist-dads.minheapprop","title":"NIST Dictionary of Algorithms and Data Structures: minheapprop","url":"https://xlinux.nist.gov/dads/HTML/minheapprop.html"}],"status":"reported","summary":"NIST DADS defines min-heap property as: Each node in a tree has a key which is greater than or equal to the key of its parent .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.minimalperfecthash","kind":"method","label":"minimal perfect hashing","sources":[{"id":"nist-dads.minimalperfecthash","title":"NIST Dictionary of Algorithms and Data Structures: minimalPerfectHash","url":"https://xlinux.nist.gov/dads/HTML/minimalPerfectHash.html"}],"status":"reported","summary":"NIST DADS defines minimal perfect hashing as: A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formal Definition: A function f is a minimal perfect hash function for a set of keys K iff ∀ j, k ∈ K f(j) = f(k) → j = k and the range of f(k) is 1… |K|.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.minimax","kind":"method","label":"minimax","sources":[{"id":"nist-dads.minimax","title":"NIST Dictionary of Algorithms and Data Structures: minimax","url":"https://xlinux.nist.gov/dads/HTML/minimax.html"}],"status":"reported","summary":"NIST DADS defines minimax as: Generate all nodes in a game tree. Score each leaf node with its utility value. Score each minimizing node with the smallest of its children's scores, and maximizing node with the largest of its children's scores.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumboundingbox","kind":"concept","label":"minimum bounding box","sources":[{"id":"nist-dads.minimumboundingbox","title":"NIST Dictionary of Algorithms and Data Structures: minimumBoundingBox","url":"https://xlinux.nist.gov/dads/HTML/minimumBoundingBox.html"}],"status":"reported","summary":"NIST DADS defines minimum bounding box as: The smallest rectangle completely enclosing a set of points. Also known as MBB.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minimumcut","kind":"concept","label":"minimum cut","sources":[{"id":"nist-dads.minimumcut","title":"NIST Dictionary of Algorithms and Data Structures: minimumcut","url":"https://xlinux.nist.gov/dads/HTML/minimumcut.html"}],"status":"reported","summary":"NIST DADS defines minimum cut as: The smallest set of edges in an undirected graph which separate two distinct vertices . That is, every path between them includes some member of the set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.minvertexcut","kind":"concept","label":"minimum vertex cut","sources":[{"id":"nist-dads.minvertexcut","title":"NIST Dictionary of Algorithms and Data Structures: minvertexcut","url":"https://xlinux.nist.gov/dads/HTML/minvertexcut.html"}],"status":"reported","summary":"NIST DADS defines minimum vertex cut as: The smallest set of vertices in an undirected graph which separate two distinct vertices. That is, every path between them passes through some member of the cut .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mixedinteger","kind":"concept","label":"mixed integer linear program","sources":[{"id":"nist-dads.mixedinteger","title":"NIST Dictionary of Algorithms and Data Structures: mixedinteger","url":"https://xlinux.nist.gov/dads/HTML/mixedinteger.html"}],"status":"reported","summary":"NIST DADS defines mixed integer linear program as: A linear program with additional constraints that some of the variables must take on integer values. Solving such problems is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mode","kind":"concept","label":"mode","sources":[{"id":"nist-dads.mode","title":"NIST Dictionary of Algorithms and Data Structures: mode","url":"https://xlinux.nist.gov/dads/HTML/mode.html"}],"status":"reported","summary":"NIST DADS defines mode as: The value that occurs most often. If no value is repeated, there is no mode. If more than one value occurs with the same greatest frequency, each value is a mode.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.modelofcomputation","kind":"concept","label":"model of computation","sources":[{"id":"nist-dads.modelofcomputation","title":"NIST Dictionary of Algorithms and Data Structures: modelOfComputation","url":"https://xlinux.nist.gov/dads/HTML/modelOfComputation.html"}],"status":"reported","summary":"NIST DADS defines model of computation as: A formal, abstract definition of a computer. Using a model one can more easily analyze the intrinsic execution time or memory space of an algorithm while ignoring many implementation issues. There are many models of computation which differ in computing power (that is, some models can perform computations impossible for other models) and the cost of various operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.modelcheckng","kind":"method","label":"model checking","sources":[{"id":"nist-dads.modelcheckng","title":"NIST Dictionary of Algorithms and Data Structures: modelcheckng","url":"https://xlinux.nist.gov/dads/HTML/modelcheckng.html"}],"status":"reported","summary":"NIST DADS defines model checking as: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.modifind","kind":"method","label":"MODIFIND","sources":[{"id":"nist-dads.modifind","title":"NIST Dictionary of Algorithms and Data Structures: modifind","url":"https://xlinux.nist.gov/dads/HTML/modifind.html"}],"status":"reported","summary":"NIST DADS defines MODIFIND as: Select the k th smallest element of an array and partition the array around it. Partition around the value of the k th element. If the partition boundary is not at k, repeat in the partition that includes k.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonicallydecreasing","kind":"concept","label":"monotonically decreasing","sources":[{"id":"nist-dads.monotonicallydecreasing","title":"NIST Dictionary of Algorithms and Data Structures: monotonicallyDecreasing","url":"https://xlinux.nist.gov/dads/HTML/monotonicallyDecreasing.html"}],"status":"reported","summary":"NIST DADS defines monotonically decreasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≥ f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonicallyincreasing","kind":"concept","label":"monotonically increasing","sources":[{"id":"nist-dads.monotonicallyincreasing","title":"NIST Dictionary of Algorithms and Data Structures: monotonicallyIncreasing","url":"https://xlinux.nist.gov/dads/HTML/monotonicallyIncreasing.html"}],"status":"reported","summary":"NIST DADS defines monotonically increasing as: A function from a partially ordered domain to a partially ordered range such that x ≤ y implies f(x) ≤ f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.monotonprioq","kind":"concept","label":"monotone priority queue","sources":[{"id":"nist-dads.monotonprioq","title":"NIST Dictionary of Algorithms and Data Structures: monotonprioq","url":"https://xlinux.nist.gov/dads/HTML/monotonprioq.html"}],"status":"reported","summary":"NIST DADS defines monotone priority queue as: A priority queue in which a key being inserted is never higher in priority than a previously deleted node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.montecarlo","kind":"method","label":"Monte Carlo algorithm","sources":[{"id":"nist-dads.montecarlo","title":"NIST Dictionary of Algorithms and Data Structures: monteCarlo","url":"https://xlinux.nist.gov/dads/HTML/monteCarlo.html"}],"status":"reported","summary":"NIST DADS defines Monte Carlo algorithm as: A randomized algorithm that may produce incorrect results, but with bounded error probability.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.mooremachine","kind":"concept","label":"Moore machine","sources":[{"id":"nist-dads.mooremachine","title":"NIST Dictionary of Algorithms and Data Structures: mooreMachine","url":"https://xlinux.nist.gov/dads/HTML/mooreMachine.html"}],"status":"reported","summary":"NIST DADS defines Moore machine as: A finite state machine that produces an output for each state .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.movefront","kind":"method","label":"move-to-front heuristic","sources":[{"id":"nist-dads.movefront","title":"NIST Dictionary of Algorithms and Data Structures: movefront","url":"https://xlinux.nist.gov/dads/HTML/movefront.html"}],"status":"reported","summary":"NIST DADS defines move-to-front heuristic as: A heuristic that moves the target of a search to the head of a list so it is found faster next time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.movetoroot","kind":"method","label":"move-to-root heuristic","sources":[{"id":"nist-dads.movetoroot","title":"NIST Dictionary of Algorithms and Data Structures: movetoroot","url":"https://xlinux.nist.gov/dads/HTML/movetoroot.html"}],"status":"reported","summary":"NIST DADS defines move-to-root heuristic as: A heuristic that moves the target of a search to the root of the search tree so it is found faster next time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multisuffixtree","kind":"concept","label":"multi suffix tree","sources":[{"id":"nist-dads.multisuffixtree","title":"NIST Dictionary of Algorithms and Data Structures: multiSuffixTree","url":"https://xlinux.nist.gov/dads/HTML/multiSuffixTree.html"}],"status":"reported","summary":"NIST DADS defines multi suffix tree as: A suffix tree extended to multiple strings by concatenating the strings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multicommdty","kind":"concept","label":"multi-commodity flow","sources":[{"id":"nist-dads.multicommdty","title":"NIST Dictionary of Algorithms and Data Structures: multicommdty","url":"https://xlinux.nist.gov/dads/HTML/multicommdty.html"}],"status":"reported","summary":"NIST DADS defines multi-commodity flow as: A maximum-flow problem involving multiple commodities, in which each commodity has an associated demand and source - sink pairs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multigraph","kind":"concept","label":"multigraph","sources":[{"id":"nist-dads.multigraph","title":"NIST Dictionary of Algorithms and Data Structures: multigraph","url":"https://xlinux.nist.gov/dads/HTML/multigraph.html"}],"status":"reported","summary":"NIST DADS defines multigraph as: A graph whose edges are unordered pairs of vertices , and the same pair of vertices can be connected by multiple edges. Formal Definition: Same as graph, but E is a bag of edges, not a set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.multikeyquicksort","kind":"method","label":"multikey Quicksort","sources":[{"id":"nist-dads.multikeyquicksort","title":"NIST Dictionary of Algorithms and Data Structures: multikeyQuicksort","url":"https://xlinux.nist.gov/dads/HTML/multikeyQuicksort.html"}],"status":"reported","summary":"NIST DADS defines multikey Quicksort as: Pick an element from the array (the pivot). Consider the first character (key) of the string (multikey). Partition the remaining elements into three sets: those whose corresponding character is less than, equal to, and greater than the pivot's character. Recursively sort the \"less than\" and \"greater than\" partitions on the same character. Recursively sort the \"equal to\" partition by the next character (key). Also known as three-way radix quicksort.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multilaygrd","kind":"concept","label":"multilayer grid file","sources":[{"id":"nist-dads.multilaygrd","title":"NIST Dictionary of Algorithms and Data Structures: multilaygrd","url":"https://xlinux.nist.gov/dads/HTML/multilaygrd.html"}],"status":"reported","summary":"NIST DADS defines multilayer grid file as: A spatial access method which is two or more simultaneous grid files . Objects reside in the first grid file where it doesn't have to be split across hyperplanes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.multiprefix","kind":"method","label":"multiprefix","sources":[{"id":"nist-dads.multiprefix","title":"NIST Dictionary of Algorithms and Data Structures: multiprefix","url":"https://xlinux.nist.gov/dads/HTML/multiprefix.html"}],"status":"reported","summary":"NIST DADS defines multiprefix as: A generalization of scan in which the partial sums are grouped by keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiprocssr","kind":"concept","label":"multiprocessor model","sources":[{"id":"nist-dads.multiprocssr","title":"NIST Dictionary of Algorithms and Data Structures: multiprocssr","url":"https://xlinux.nist.gov/dads/HTML/multiprocssr.html"}],"status":"reported","summary":"NIST DADS defines multiprocessor model as: A model of parallel computation based on a set of communicating sequential processors.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaydecision","kind":"concept","label":"multiway decision","sources":[{"id":"nist-dads.multiwaydecision","title":"NIST Dictionary of Algorithms and Data Structures: multiwayDecision","url":"https://xlinux.nist.gov/dads/HTML/multiwayDecision.html"}],"status":"reported","summary":"NIST DADS defines multiway decision as: A decision which has more than two results. For instance, testing if a < b yields two results, but some languages allow a test to return a < b, a=b, or a > b in one operation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaymerge","kind":"concept","label":"multiway merge","sources":[{"id":"nist-dads.multiwaymerge","title":"NIST Dictionary of Algorithms and Data Structures: multiwayMerge","url":"https://xlinux.nist.gov/dads/HTML/multiwayMerge.html"}],"status":"reported","summary":"NIST DADS defines multiway merge as: Combine more than two sorted data streams into a single sorted stream.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.multiwaytree","kind":"concept","label":"multiway tree","sources":[{"id":"nist-dads.multiwaytree","title":"NIST Dictionary of Algorithms and Data Structures: multiwaytree","url":"https://xlinux.nist.gov/dads/HTML/multiwaytree.html"}],"status":"reported","summary":"NIST DADS defines multiway tree as: A tree with any number of children for each node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.munkresassignment","kind":"method","label":"Munkres' assignment algorithm","sources":[{"id":"nist-dads.munkresassignment","title":"NIST Dictionary of Algorithms and Data Structures: munkresAssignment","url":"https://xlinux.nist.gov/dads/HTML/munkresAssignment.html"}],"status":"reported","summary":"NIST DADS defines Munkres' assignment algorithm as: Solve the assignment problem in polynomial time by marking and unmarking entries and covering and uncovering rows and columns. Also known as Hungarian algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.npcompltlngg","kind":"concept","label":"NP-complete language","sources":[{"id":"nist-dads.npcompltlngg","title":"NIST Dictionary of Algorithms and Data Structures: nPcompltlngg","url":"https://xlinux.nist.gov/dads/HTML/nPcompltlngg.html"}],"status":"reported","summary":"NIST DADS defines NP-complete language as: A language in NP such that every language in NP can be reduced to it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nand","kind":"concept","label":"nand","sources":[{"id":"nist-dads.nand","title":"NIST Dictionary of Algorithms and Data Structures: nand","url":"https://xlinux.nist.gov/dads/HTML/nand.html"}],"status":"reported","summary":"NIST DADS defines nand as: Negated conjunction: 0 NAND 0 = 1, 0 NAND 1 = 1, 1 NAND 0 = 1, 1 NAND 1 = 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.naryfunc","kind":"concept","label":"n-ary function","sources":[{"id":"nist-dads.naryfunc","title":"NIST Dictionary of Algorithms and Data Structures: naryfunc","url":"https://xlinux.nist.gov/dads/HTML/naryfunc.html"}],"status":"reported","summary":"NIST DADS defines n-ary function as: (1) A function with exactly n arguments. (2) A function which takes any number of arguments, or a variable number of arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nearestneighbor","kind":"concept","label":"nearest neighbor","sources":[{"id":"nist-dads.nearestneighbor","title":"NIST Dictionary of Algorithms and Data Structures: nearestNeighbor","url":"https://xlinux.nist.gov/dads/HTML/nearestNeighbor.html"}],"status":"reported","summary":"NIST DADS defines nearest neighbor as: Find the point (rectangle, line, etc.) that is closest to another point.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.negation","kind":"concept","label":"negation","sources":[{"id":"nist-dads.negation","title":"NIST Dictionary of Algorithms and Data Structures: negation","url":"https://xlinux.nist.gov/dads/HTML/negation.html"}],"status":"reported","summary":"NIST DADS defines negation as: The negation of 0 is 1; the negation of 1 is 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nextstate","kind":"concept","label":"next state","sources":[{"id":"nist-dads.nextstate","title":"NIST Dictionary of Algorithms and Data Structures: nextstate","url":"https://xlinux.nist.gov/dads/HTML/nextstate.html"}],"status":"reported","summary":"NIST DADS defines next state as: The state immediately following the current state, defined by the transition function of a finite state machine and the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nist","kind":"concept","label":"NIST","sources":[{"id":"nist-dads.nist","title":"NIST Dictionary of Algorithms and Data Structures: nist","url":"https://xlinux.nist.gov/dads/HTML/nist.html"}],"status":"reported","summary":"NIST DADS defines NIST as: The United States National Institute of Standards and Technology.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.node","kind":"concept","label":"node","sources":[{"id":"nist-dads.node","title":"NIST Dictionary of Algorithms and Data Structures: node","url":"https://xlinux.nist.gov/dads/HTML/node.html"}],"status":"reported","summary":"NIST DADS defines node as: (1) A unit of reference in a data structure. Also called a vertex in graphs and trees . (2) A collection of information which must be kept at a single memory location.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nonbalncmsrt","kind":"method","label":"nonbalanced merge sort","sources":[{"id":"nist-dads.nonbalncmsrt","title":"NIST Dictionary of Algorithms and Data Structures: nonbalncmsrt","url":"https://xlinux.nist.gov/dads/HTML/nonbalncmsrt.html"}],"status":"reported","summary":"NIST DADS defines nonbalanced merge sort as: A k-way merge sort in which the number of input and output data streams is different for any particular pass. Typically P input streams are merged and distributed to T output streams on one pass followed by a merge of the T inputs and distribution to P outputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nondetermalgo","kind":"method","label":"nondeterministic algorithm","sources":[{"id":"nist-dads.nondetermalgo","title":"NIST Dictionary of Algorithms and Data Structures: nondetermAlgo","url":"https://xlinux.nist.gov/dads/HTML/nondetermAlgo.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic algorithm as: A conceptual algorithm with more than one allowed step at certain times and which always takes the right or best step. It is not random, as in randomized algorithm , or indeterminate. Rather it has the supercomputational characteristic of choosing the optimal behavior.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermfinitetreeautom","kind":"concept","label":"nondeterministic finite tree automaton","sources":[{"id":"nist-dads.nondetermfinitetreeautom","title":"NIST Dictionary of Algorithms and Data Structures: nondetermFiniteTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/nondetermFiniteTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic finite tree automaton as: A nondeterministic finite state machine that accepts finitary trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. Also known as NFTA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondetermtreeautom","kind":"concept","label":"nondeterministic tree automaton","sources":[{"id":"nist-dads.nondetermtreeautom","title":"NIST Dictionary of Algorithms and Data Structures: nondetermTreeAutom","url":"https://xlinux.nist.gov/dads/HTML/nondetermTreeAutom.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic tree automaton as: A nondeterministic finite state machine that accepts infinite trees rather than just strings . The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The expressive power of such automata varies depending on the acceptance conditions of the trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nondeterministic","kind":"concept","label":"nondeterministic","sources":[{"id":"nist-dads.nondeterministic","title":"NIST Dictionary of Algorithms and Data Structures: nondeterministic","url":"https://xlinux.nist.gov/dads/HTML/nondeterministic.html"}],"status":"reported","summary":"NIST DADS defines nondeterministic as: Permitting more than one choice of next move at some step in a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nor","kind":"concept","label":"nor","sources":[{"id":"nist-dads.nor","title":"NIST Dictionary of Algorithms and Data Structures: nor","url":"https://xlinux.nist.gov/dads/HTML/nor.html"}],"status":"reported","summary":"NIST DADS defines nor as: Negated disjunction: 0 NOR 0 = 1, 0 NOR 1 = 0, 1 NOR 0 = 0, 1 NOR 1 = 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.not","kind":"concept","label":"not","sources":[{"id":"nist-dads.not","title":"NIST Dictionary of Algorithms and Data Structures: not","url":"https://xlinux.nist.gov/dads/HTML/not.html"}],"status":"reported","summary":"NIST DADS defines not as: Negation: NOT 0 = 1, NOT 1 = 0. Also known as complement .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.np","kind":"concept","label":"NP","sources":[{"id":"nist-dads.np","title":"NIST Dictionary of Algorithms and Data Structures: np","url":"https://xlinux.nist.gov/dads/HTML/np.html"}],"status":"reported","summary":"NIST DADS defines NP as: The complexity class of decision problems for which answers can be checked by an algorithm whose run time is polynomial in the size of the input. Note that this doesn't require or imply that an answer can be found quickly, only that any claimed solution can be verified quickly. \"NP\" is the class that a N ondeterministic Turing machine accepts in P olynomial time. Also known as nondeterministic polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nphard","kind":"concept","label":"NP-hard","sources":[{"id":"nist-dads.nphard","title":"NIST Dictionary of Algorithms and Data Structures: nphard","url":"https://xlinux.nist.gov/dads/HTML/nphard.html"}],"status":"reported","summary":"NIST DADS defines NP-hard as: The complexity class of decision problems that are intrinsically harder than those that can be solved by a nondeterministic Turing machine in polynomial time . When a decision version of a combinatorial optimization problem is proved to belong to the class of NP-complete problems, then the optimization version is NP-hard.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nqueens","kind":"concept","label":"n queens","sources":[{"id":"nist-dads.nqueens","title":"NIST Dictionary of Algorithms and Data Structures: nqueens","url":"https://xlinux.nist.gov/dads/HTML/nqueens.html"}],"status":"reported","summary":"NIST DADS defines n queens as: Place n chess queens on an n × n board such that no queen can attack another. Efficiently find all possible placements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.nulltree","kind":"concept","label":"null tree","sources":[{"id":"nist-dads.nulltree","title":"NIST Dictionary of Algorithms and Data Structures: nulltree","url":"https://xlinux.nist.gov/dads/HTML/nulltree.html"}],"status":"reported","summary":"NIST DADS defines null tree as: (1) A tree which is empty. (2) A tree whose leaf nodes all have a null value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.nysiis","kind":"method","label":"NYSIIS","sources":[{"id":"nist-dads.nysiis","title":"NIST Dictionary of Algorithms and Data Structures: nysiis","url":"https://xlinux.nist.gov/dads/HTML/nysiis.html"}],"status":"reported","summary":"NIST DADS defines NYSIIS as: Convert a name to a phonetic coding of up to six characters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.objective","kind":"concept","label":"objective function","sources":[{"id":"nist-dads.objective","title":"NIST Dictionary of Algorithms and Data Structures: objective","url":"https://xlinux.nist.gov/dads/HTML/objective.html"}],"status":"reported","summary":"NIST DADS defines objective function as: A function associated with an optimization problem which determines how good a solution is, for instance, the total cost of edges in a solution to a traveling salesman problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.obliviousalgorithm","kind":"concept","label":"oblivious algorithm","sources":[{"id":"nist-dads.obliviousalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: obliviousAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/obliviousAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines oblivious algorithm as: An algorithm whose behavior, by design, is independent of some property that influences a typical algorithm for the same problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.occurrence","kind":"concept","label":"occurrence","sources":[{"id":"nist-dads.occurrence","title":"NIST Dictionary of Algorithms and Data Structures: occurrence","url":"https://xlinux.nist.gov/dads/HTML/occurrence.html"}],"status":"reported","summary":"NIST DADS defines occurrence as: A string v occurs in a string u if v is a substring of u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.octree","kind":"concept","label":"octree","sources":[{"id":"nist-dads.octree","title":"NIST Dictionary of Algorithms and Data Structures: octree","url":"https://xlinux.nist.gov/dads/HTML/octree.html"}],"status":"reported","summary":"NIST DADS defines octree as: A tree to index three dimensions. Each node has either eight children or no children.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.offline","kind":"concept","label":"off-line algorithm","sources":[{"id":"nist-dads.offline","title":"NIST Dictionary of Algorithms and Data Structures: offline","url":"https://xlinux.nist.gov/dads/HTML/offline.html"}],"status":"reported","summary":"NIST DADS defines off-line algorithm as: An algorithm which is given the entire sequence of inputs in advance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.offset","kind":"concept","label":"offset","sources":[{"id":"nist-dads.offset","title":"NIST Dictionary of Algorithms and Data Structures: offset","url":"https://xlinux.nist.gov/dads/HTML/offset.html"}],"status":"reported","summary":"NIST DADS defines offset as: The distance from the beginning of a string to the end of a segment in that string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.omega","kind":"concept","label":"ω","sources":[{"id":"nist-dads.omega","title":"NIST Dictionary of Algorithms and Data Structures: omega","url":"https://xlinux.nist.gov/dads/HTML/omega.html"}],"status":"reported","summary":"NIST DADS defines ω as: A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) = ω (g(n)) means g(n) becomes insignificant relative to f(n) as n goes to infinity. Formal Definition: f(n) = ω (g(n)) means that for any positive constant c, there exists a constant k, such that 0 ≤ cg(n) < f(n) for all n ≥ k. The value of k must not depend on n, but may depend on c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.omicron","kind":"concept","label":"omicron","sources":[{"id":"nist-dads.omicron","title":"NIST Dictionary of Algorithms and Data Structures: omicron","url":"https://xlinux.nist.gov/dads/HTML/omicron.html"}],"status":"reported","summary":"NIST DADS defines omicron as: The Greek letter written as \"o\" (see little-o notation ) or \"O\" (see big-O notation ).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.onebasedindexing","kind":"concept","label":"1-based indexing","sources":[{"id":"nist-dads.onebasedindexing","title":"NIST Dictionary of Algorithms and Data Structures: oneBasedIndexing","url":"https://xlinux.nist.gov/dads/HTML/oneBasedIndexing.html"}],"status":"reported","summary":"NIST DADS defines 1-based indexing as: Indexing (an array ) beginning with 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.onedimensnal","kind":"concept","label":"one-dimensional","sources":[{"id":"nist-dads.onedimensnal","title":"NIST Dictionary of Algorithms and Data Structures: onedimensnal","url":"https://xlinux.nist.gov/dads/HTML/onedimensnal.html"}],"status":"reported","summary":"NIST DADS defines one-dimensional as: Dealing with or restricted to a line. An organization where location can be completely described with exactly one axis.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.online","kind":"concept","label":"on-line algorithm","sources":[{"id":"nist-dads.online","title":"NIST Dictionary of Algorithms and Data Structures: online","url":"https://xlinux.nist.gov/dads/HTML/online.html"}],"status":"reported","summary":"NIST DADS defines on-line algorithm as: An algorithm that must process each input in turn, without detailed knowledge of future inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimtriangulation","kind":"concept","label":"optimal triangulation problem","sources":[{"id":"nist-dads.optimtriangulation","title":"NIST Dictionary of Algorithms and Data Structures: optimTriangulation","url":"https://xlinux.nist.gov/dads/HTML/optimTriangulation.html"}],"status":"reported","summary":"NIST DADS defines optimal triangulation problem as: Find the triangulation with the greatest overall minimum angle. There is an incremental algorithm that takes O(n log n) time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimal","kind":"concept","label":"optimal","sources":[{"id":"nist-dads.optimal","title":"NIST Dictionary of Algorithms and Data Structures: optimal","url":"https://xlinux.nist.gov/dads/HTML/optimal.html"}],"status":"reported","summary":"NIST DADS defines optimal as: (1) A solution to an optimization problem which has the minimum (or maximum) value of the objective function . (2) The time, space, resource, etc. complexity of an algorithm which matches the best known lower bound of a problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimalmismatch","kind":"method","label":"optimal mismatch","sources":[{"id":"nist-dads.optimalmismatch","title":"NIST Dictionary of Algorithms and Data Structures: optimalMismatch","url":"https://xlinux.nist.gov/dads/HTML/optimalMismatch.html"}],"status":"reported","summary":"NIST DADS defines optimal mismatch as: A string matching algorithm that compares the rarest character first. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimalpolyphasemergesort","kind":"method","label":"optimal polyphase merge sort","sources":[{"id":"nist-dads.optimalpolyphasemergesort","title":"NIST Dictionary of Algorithms and Data Structures: optimalPolyphaseMergeSort","url":"https://xlinux.nist.gov/dads/HTML/optimalPolyphaseMergeSort.html"}],"status":"reported","summary":"NIST DADS defines optimal polyphase merge sort as: An external sort algorithm that uses optimal polyphase merges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimalsoltn","kind":"concept","label":"optimal solution","sources":[{"id":"nist-dads.optimalsoltn","title":"NIST Dictionary of Algorithms and Data Structures: optimalsoltn","url":"https://xlinux.nist.gov/dads/HTML/optimalsoltn.html"}],"status":"reported","summary":"NIST DADS defines optimal solution as: A solution to an optimization problem which minimizes (or maximizes) the objective function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimalvalue","kind":"concept","label":"optimal value","sources":[{"id":"nist-dads.optimalvalue","title":"NIST Dictionary of Algorithms and Data Structures: optimalvalue","url":"https://xlinux.nist.gov/dads/HTML/optimalvalue.html"}],"status":"reported","summary":"NIST DADS defines optimal value as: The minimum (or maximum) value of the objective function over the feasible region of an optimization problem .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.optimization","kind":"concept","label":"optimization problem","sources":[{"id":"nist-dads.optimization","title":"NIST Dictionary of Algorithms and Data Structures: optimization","url":"https://xlinux.nist.gov/dads/HTML/optimization.html"}],"status":"reported","summary":"NIST DADS defines optimization problem as: A computational problem in which the object is to find the best of all possible solutions. More formally, find a solution in the feasible region which has the minimum (or maximum) value of the objective function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.optimpolymrg","kind":"method","label":"optimal polyphase merge","sources":[{"id":"nist-dads.optimpolymrg","title":"NIST Dictionary of Algorithms and Data Structures: optimpolymrg","url":"https://xlinux.nist.gov/dads/HTML/optimpolymrg.html"}],"status":"reported","summary":"NIST DADS defines optimal polyphase merge as: A polyphase merge which seeks to minimize the number of merge passes by allocating output runs of each pass to the various output files. Since polyphase merging must have a different number of runs in each file to be efficient, one seeks the optimal way of selecting how many runs go into each output file. A series of kth order Fibonacci numbers is one way to select the number of runs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.or","kind":"concept","label":"or","sources":[{"id":"nist-dads.or","title":"NIST Dictionary of Algorithms and Data Structures: or","url":"https://xlinux.nist.gov/dads/HTML/or.html"}],"status":"reported","summary":"NIST DADS defines or as: Disjunction: 0 OR 0 = 0, 0 OR 1 = 1, 1 OR 0 = 1, 1 OR 1 = 1. Also known as inclusive or.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracletur","kind":"concept","label":"oracle Turing machine","sources":[{"id":"nist-dads.oracletur","title":"NIST Dictionary of Algorithms and Data Structures: oracleTur","url":"https://xlinux.nist.gov/dads/HTML/oracleTur.html"}],"status":"reported","summary":"NIST DADS defines oracle Turing machine as: A Turing machine with an extra oracle tape and three extra states q ? , q y , q n . When the machine enters q ? , control goes to state q y if the oracle tape content is in the oracle set ; otherwise control goes to state q n .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracleset","kind":"concept","label":"oracle set","sources":[{"id":"nist-dads.oracleset","title":"NIST Dictionary of Algorithms and Data Structures: oracleset","url":"https://xlinux.nist.gov/dads/HTML/oracleset.html"}],"status":"reported","summary":"NIST DADS defines oracle set as: A predetermined set of tapes used by an oracle Turing machine to make decisions otherwise not feasibled.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.oracletape","kind":"concept","label":"oracle tape","sources":[{"id":"nist-dads.oracletape","title":"NIST Dictionary of Algorithms and Data Structures: oracletape","url":"https://xlinux.nist.gov/dads/HTML/oracletape.html"}],"status":"reported","summary":"NIST DADS defines oracle tape as: An extra tape used by an oracle Turing machine to make decisions otherwise not feasible.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.order","kind":"concept","label":"order","sources":[{"id":"nist-dads.order","title":"NIST Dictionary of Algorithms and Data Structures: order","url":"https://xlinux.nist.gov/dads/HTML/order.html"}],"status":"reported","summary":"NIST DADS defines order as: (1) The height of a tree . (2) The number of children of the root of a binomial tree . (3) The maximum number of children of nodes in a B-tree . (4) The number of data streams, usually denoted ω, in a multiway merge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.orderpreservminperfecthash","kind":"method","label":"order-preserving minimal perfect hashing","sources":[{"id":"nist-dads.orderpreservminperfecthash","title":"NIST Dictionary of Algorithms and Data Structures: orderPreservMinPerfectHash","url":"https://xlinux.nist.gov/dads/HTML/orderPreservMinPerfectHash.html"}],"status":"reported","summary":"NIST DADS defines order-preserving minimal perfect hashing as: A minimal perfect hashing function for keys in S such that if k1, k2 ∈ S and k1 > k2, then f(k1) > f(k2).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.orderpreservinghuffmancoding","kind":"method","label":"order-preserving Huffman coding","sources":[{"id":"nist-dads.orderpreservinghuffmancoding","title":"NIST Dictionary of Algorithms and Data Structures: orderPreservingHuffmanCoding","url":"https://xlinux.nist.gov/dads/HTML/orderPreservingHuffmanCoding.html"}],"status":"reported","summary":"NIST DADS defines order-preserving Huffman coding as: A variable-length character coding based on the frequency of each character. The algorithm is similar to Huffman coding , but the trees are kept in the same order as the characters. Two adjacent trees with the least combined frequency are joined as subtrees of a new root. As with Huffman coding, that new tree is assigned the sum of the subtrees' frequencies. Repeat until all characters are in one tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedlinkedlist","kind":"concept","label":"ordered linked list","sources":[{"id":"nist-dads.orderedlinkedlist","title":"NIST Dictionary of Algorithms and Data Structures: orderedLinkedList","url":"https://xlinux.nist.gov/dads/HTML/orderedLinkedList.html"}],"status":"reported","summary":"NIST DADS defines ordered linked list as: A linked list whose items are kept in some order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedarry","kind":"concept","label":"ordered array","sources":[{"id":"nist-dads.orderedarry","title":"NIST Dictionary of Algorithms and Data Structures: orderedarry","url":"https://xlinux.nist.gov/dads/HTML/orderedarry.html"}],"status":"reported","summary":"NIST DADS defines ordered array as: An array whose items have some order. Usually, it means a sorted array , but may mean not fully ordered, for example, all values less than the median are in the first half.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orderedtree","kind":"concept","label":"ordered tree","sources":[{"id":"nist-dads.orderedtree","title":"NIST Dictionary of Algorithms and Data Structures: orderedtree","url":"https://xlinux.nist.gov/dads/HTML/orderedtree.html"}],"status":"reported","summary":"NIST DADS defines ordered tree as: A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogonaldrawing","kind":"concept","label":"orthogonal drawing","sources":[{"id":"nist-dads.orthogonaldrawing","title":"NIST Dictionary of Algorithms and Data Structures: orthogonalDrawing","url":"https://xlinux.nist.gov/dads/HTML/orthogonalDrawing.html"}],"status":"reported","summary":"NIST DADS defines orthogonal drawing as: A graph drawing in which each edge is represented by a polyline, each segment of which is parallel to a coordinate axis.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogonallists","kind":"concept","label":"orthogonal lists","sources":[{"id":"nist-dads.orthogonallists","title":"NIST Dictionary of Algorithms and Data Structures: orthogonalLists","url":"https://xlinux.nist.gov/dads/HTML/orthogonalLists.html"}],"status":"reported","summary":"NIST DADS defines orthogonal lists as: Lists that share items, but are structurally independent.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.orthogoncnvx","kind":"concept","label":"orthogonally convex rectilinear polygon","sources":[{"id":"nist-dads.orthogoncnvx","title":"NIST Dictionary of Algorithms and Data Structures: orthogoncnvx","url":"https://xlinux.nist.gov/dads/HTML/orthogoncnvx.html"}],"status":"reported","summary":"NIST DADS defines orthogonally convex rectilinear polygon as: A rectilinear polygon P in which every horizontal or vertical segment connecting two points in P lies totally within P.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.oscillatingmergesort","kind":"method","label":"oscillating merge sort","sources":[{"id":"nist-dads.oscillatingmergesort","title":"NIST Dictionary of Algorithms and Data Structures: oscillatingMergeSort","url":"https://xlinux.nist.gov/dads/HTML/oscillatingMergeSort.html"}],"status":"reported","summary":"NIST DADS defines oscillating merge sort as: Given n tape drives, one input and n-1 work drives, distribute a portion of the input to n-2 tapes, then merge them onto the final tape reading the n-2 backward. Repeat until n-2 (backward) merged runs have been created, at which time they are merged. Continue building up powers of n-2 batches until done.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.outdegree","kind":"concept","label":"out-degree","sources":[{"id":"nist-dads.outdegree","title":"NIST Dictionary of Algorithms and Data Structures: outdegree","url":"https://xlinux.nist.gov/dads/HTML/outdegree.html"}],"status":"reported","summary":"NIST DADS defines out-degree as: The number of edges going out of a vertex in a directed graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.p","kind":"concept","label":"P","sources":[{"id":"nist-dads.p","title":"NIST Dictionary of Algorithms and Data Structures: p","url":"https://xlinux.nist.gov/dads/HTML/p.html"}],"status":"reported","summary":"NIST DADS defines P as: The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.packing","kind":"concept","label":"packing","sources":[{"id":"nist-dads.packing","title":"NIST Dictionary of Algorithms and Data Structures: packing","url":"https://xlinux.nist.gov/dads/HTML/packing.html"}],"status":"reported","summary":"NIST DADS defines packing as: Given a finite collection of subsets of a finite ground set, to find an optimal subcollection that are pairwise disjoint.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.paddingrgmnt","kind":"concept","label":"padding argument","sources":[{"id":"nist-dads.paddingrgmnt","title":"NIST Dictionary of Algorithms and Data Structures: paddingrgmnt","url":"https://xlinux.nist.gov/dads/HTML/paddingrgmnt.html"}],"status":"reported","summary":"NIST DADS defines padding argument as: A method for transferring results about one complexity bound to another complexity bound, by padding extra dummy characters onto the inputs of the machines involved.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pagoda","kind":"concept","label":"pagoda","sources":[{"id":"nist-dads.pagoda","title":"NIST Dictionary of Algorithms and Data Structures: pagoda","url":"https://xlinux.nist.gov/dads/HTML/pagoda.html"}],"status":"reported","summary":"NIST DADS defines pagoda as: A priority queue implemented with a variant of a binary tree . The root points to its children, as in a binary tree. Every other node points back to its parent and down to its leftmost (if it is a right child ) or rightmost (if it is a left child) descendant leaf . The basic operation is merge or meld , which maintains the heap property . An element is inserted by merging it as a singleton. The root is removed by merging its right and left children. Merging is bottom-up, merging the leftmost edge of one with the rightmost edge of the other.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parallel","kind":"concept","label":"parallel computation thesis","sources":[{"id":"nist-dads.parallel","title":"NIST Dictionary of Algorithms and Data Structures: parallel","url":"https://xlinux.nist.gov/dads/HTML/parallel.html"}],"status":"reported","summary":"NIST DADS defines parallel computation thesis as: Sequential space is a polynomial of parallel time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parallelrandomaccessmachine","kind":"concept","label":"parallel random-access machine","sources":[{"id":"nist-dads.parallelrandomaccessmachine","title":"NIST Dictionary of Algorithms and Data Structures: parallelRandomAccessMachine","url":"https://xlinux.nist.gov/dads/HTML/parallelRandomAccessMachine.html"}],"status":"reported","summary":"NIST DADS defines parallel random-access machine as: A shared memory model of computation , where typically the processors all execute the same instruction synchronously, and access to any memory location occurs in unit time. Also known as PRAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.parent","kind":"concept","label":"parent","sources":[{"id":"nist-dads.parent","title":"NIST Dictionary of Algorithms and Data Structures: parent","url":"https://xlinux.nist.gov/dads/HTML/parent.html"}],"status":"reported","summary":"NIST DADS defines parent as: Of a node : the tree node conceptually above or closer to the root than the node and which has a link to the node. See the figure at tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialfunct","kind":"concept","label":"partial function","sources":[{"id":"nist-dads.partialfunct","title":"NIST Dictionary of Algorithms and Data Structures: partialfunct","url":"https://xlinux.nist.gov/dads/HTML/partialfunct.html"}],"status":"reported","summary":"NIST DADS defines partial function as: A function which is not defined for some inputs of the right type, that is, for some of a domain . For instance, division is a partial function since division by 0 is undefined (on the Reals).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallydecidableprob","kind":"concept","label":"partially decidable problem","sources":[{"id":"nist-dads.partiallydecidableprob","title":"NIST Dictionary of Algorithms and Data Structures: partiallyDecidableProb","url":"https://xlinux.nist.gov/dads/HTML/partiallyDecidableProb.html"}],"status":"reported","summary":"NIST DADS defines partially decidable problem as: One whose associated language is a recursively enumerable language . Equivalently, there exists an algorithm that halts and outputs 1 for every instance having a \"yes\" answer, but for instances having a \"no\" answer is allowed either not to halt or to halt and output 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallydynamicgraph","kind":"concept","label":"partially dynamic graph problem","sources":[{"id":"nist-dads.partiallydynamicgraph","title":"NIST Dictionary of Algorithms and Data Structures: partiallyDynamicGraph","url":"https://xlinux.nist.gov/dads/HTML/partiallyDynamicGraph.html"}],"status":"reported","summary":"NIST DADS defines partially dynamic graph problem as: Problem where the update operations include either edge insertions (incremental) or deletions (decremental).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partiallypersistdata","kind":"concept","label":"partially persistent data structure","sources":[{"id":"nist-dads.partiallypersistdata","title":"NIST Dictionary of Algorithms and Data Structures: partiallyPersistData","url":"https://xlinux.nist.gov/dads/HTML/partiallyPersistData.html"}],"status":"reported","summary":"NIST DADS defines partially persistent data structure as: A persistent data structure that allows updates to the latest version only.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialorder","kind":"concept","label":"partial order","sources":[{"id":"nist-dads.partialorder","title":"NIST Dictionary of Algorithms and Data Structures: partialorder","url":"https://xlinux.nist.gov/dads/HTML/partialorder.html"}],"status":"reported","summary":"NIST DADS defines partial order as: An order defined for some, but not necessarily all, pairs of items. For instance, the sets {a, b} and {a, c, d} are subsets of {a, b, c, d}, but neither is a subset of the other. So \"subset of\" is a partial order on sets. Formal Definition: A partial order is a binary relation that is reflexive , transitive , and antisymmetric .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.partialrcrsv","kind":"concept","label":"partial recursive function","sources":[{"id":"nist-dads.partialrcrsv","title":"NIST Dictionary of Algorithms and Data Structures: partialrcrsv","url":"https://xlinux.nist.gov/dads/HTML/partialrcrsv.html"}],"status":"reported","summary":"NIST DADS defines partial recursive function as: A function computed by a Turing machine that need not halt for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.passivedatastruc","kind":"concept","label":"passive data structure","sources":[{"id":"nist-dads.passivedatastruc","title":"NIST Dictionary of Algorithms and Data Structures: passiveDataStruc","url":"https://xlinux.nist.gov/dads/HTML/passiveDataStruc.html"}],"status":"reported","summary":"NIST DADS defines passive data structure as: A data structure that is only changed by external threads or processes, in contrast to an active data structure .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pathsystem","kind":"concept","label":"path system problem","sources":[{"id":"nist-dads.pathsystem","title":"NIST Dictionary of Algorithms and Data Structures: pathsystem","url":"https://xlinux.nist.gov/dads/HTML/pathsystem.html"}],"status":"reported","summary":"NIST DADS defines path system problem as: For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pattern","kind":"concept","label":"pattern","sources":[{"id":"nist-dads.pattern","title":"NIST Dictionary of Algorithms and Data Structures: pattern","url":"https://xlinux.nist.gov/dads/HTML/pattern.html"}],"status":"reported","summary":"NIST DADS defines pattern as: A finite number of strings that are searched for in texts .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.patternelmnt","kind":"concept","label":"pattern element","sources":[{"id":"nist-dads.patternelmnt","title":"NIST Dictionary of Algorithms and Data Structures: patternelmnt","url":"https://xlinux.nist.gov/dads/HTML/patternelmnt.html"}],"status":"reported","summary":"NIST DADS defines pattern element as: A positive (negative) pattern element is a \"partial wild card\" presented as a subset of the alphabet Σ, with the symbols in the subset specifying which symbols of Σ are matched (mismatched) by the pattern element.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pearsonshash","kind":"method","label":"Pearson's hash","sources":[{"id":"nist-dads.pearsonshash","title":"NIST Dictionary of Algorithms and Data Structures: pearsonshash","url":"https://xlinux.nist.gov/dads/HTML/pearsonshash.html"}],"status":"reported","summary":"NIST DADS defines Pearson's hash as: A hash function that uses an auxiliary array, but no shift or exclusive-or ( xor ) operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.perfectbinarytree","kind":"concept","label":"perfect binary tree","sources":[{"id":"nist-dads.perfectbinarytree","title":"NIST Dictionary of Algorithms and Data Structures: perfectBinaryTree","url":"https://xlinux.nist.gov/dads/HTML/perfectBinaryTree.html"}],"status":"reported","summary":"NIST DADS defines perfect binary tree as: A binary tree with all leaf nodes at the same depth . All internal nodes have degree 2.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.perfectshuffle","kind":"method","label":"perfect shuffle","sources":[{"id":"nist-dads.perfectshuffle","title":"NIST Dictionary of Algorithms and Data Structures: perfectShuffle","url":"https://xlinux.nist.gov/dads/HTML/perfectShuffle.html"}],"status":"reported","summary":"NIST DADS defines perfect shuffle as: Split a list of elements (or deck of cards) exactly in half then precisely interleave the two halves.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.perfectmatch","kind":"concept","label":"perfect matching","sources":[{"id":"nist-dads.perfectmatch","title":"NIST Dictionary of Algorithms and Data Structures: perfectmatch","url":"https://xlinux.nist.gov/dads/HTML/perfectmatch.html"}],"status":"reported","summary":"NIST DADS defines perfect matching as: A matching , or subset of edges without common vertices , of a connected graph that touches all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.performance","kind":"concept","label":"performance guarantee","sources":[{"id":"nist-dads.performance","title":"NIST Dictionary of Algorithms and Data Structures: performance","url":"https://xlinux.nist.gov/dads/HTML/performance.html"}],"status":"reported","summary":"NIST DADS defines performance guarantee as: An expression of the most the result of an approximation algorithm may depart from the optimal solution .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.permutation","kind":"method","label":"permutation","sources":[{"id":"nist-dads.permutation","title":"NIST Dictionary of Algorithms and Data Structures: permutation","url":"https://xlinux.nist.gov/dads/HTML/permutation.html"}],"status":"reported","summary":"NIST DADS defines permutation as: A rearrangement of elements, where none are lost, added, or changed. The Fisher-Yates shuffle randomly permutes elements. Also known as shuffle.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.permutationsort","kind":"method","label":"permutation sort","sources":[{"id":"nist-dads.permutationsort","title":"NIST Dictionary of Algorithms and Data Structures: permutationSort","url":"https://xlinux.nist.gov/dads/HTML/permutationSort.html"}],"status":"reported","summary":"NIST DADS defines permutation sort as: A terribly inefficient sort algorithm that generates each permutation of the items until the items are in order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.persistentdatastructure","kind":"concept","label":"persistent data structure","sources":[{"id":"nist-dads.persistentdatastructure","title":"NIST Dictionary of Algorithms and Data Structures: persistentDataStructure","url":"https://xlinux.nist.gov/dads/HTML/persistentDataStructure.html"}],"status":"reported","summary":"NIST DADS defines persistent data structure as: A data structure that preserves its old versions, that is, previous versions may be queried in addition to the latest version.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.phoneticcoding","kind":"concept","label":"phonetic coding","sources":[{"id":"nist-dads.phoneticcoding","title":"NIST Dictionary of Algorithms and Data Structures: phoneticCoding","url":"https://xlinux.nist.gov/dads/HTML/phoneticCoding.html"}],"status":"reported","summary":"NIST DADS defines phonetic coding as: Code a string based on how it is pronounced.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pigeonholesort","kind":"method","label":"pigeonhole sort","sources":[{"id":"nist-dads.pigeonholesort","title":"NIST Dictionary of Algorithms and Data Structures: pigeonholeSort","url":"https://xlinux.nist.gov/dads/HTML/pigeonholeSort.html"}],"status":"reported","summary":"NIST DADS defines pigeonhole sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items. The first pass allocates an array of buckets , one bucket for each possible key value, then moves each item to its key's bucket. The second pass goes over the bucket array moving each item to the next place in the destination.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pile","kind":"concept","label":"pile","sources":[{"id":"nist-dads.pile","title":"NIST Dictionary of Algorithms and Data Structures: pile","url":"https://xlinux.nist.gov/dads/HTML/pile.html"}],"status":"reported","summary":"NIST DADS defines pile as: An ordered deque , that is, items may only be added to or removed from the head or the tail . An item is added to the head if it is smaller than the current head. An item is added to the tail if it is greater than the current tail. Items are never inserted into the middle, rather, an additional pile may be created.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pipelineddvd","kind":"method","label":"pipelined divide and conquer","sources":[{"id":"nist-dads.pipelineddvd","title":"NIST Dictionary of Algorithms and Data Structures: pipelineddvd","url":"https://xlinux.nist.gov/dads/HTML/pipelineddvd.html"}],"status":"reported","summary":"NIST DADS defines pipelined divide and conquer as: A divide and conquer paradigm in which partial results from recursive calls can be used before the calls complete. The technique is often useful for reducing the depth of an algorithm .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planargraph","kind":"concept","label":"planar graph","sources":[{"id":"nist-dads.planargraph","title":"NIST Dictionary of Algorithms and Data Structures: planargraph","url":"https://xlinux.nist.gov/dads/HTML/planargraph.html"}],"status":"reported","summary":"NIST DADS defines planar graph as: A graph that can be drawn in the plane with no crossing edges .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planarization","kind":"concept","label":"planarization","sources":[{"id":"nist-dads.planarization","title":"NIST Dictionary of Algorithms and Data Structures: planarization","url":"https://xlinux.nist.gov/dads/HTML/planarization.html"}],"status":"reported","summary":"NIST DADS defines planarization as: The process of transforming a graph into a planar graph . More formally, the transformation involves either removing edges (planarization by edge removal), or replacing pairs of nonincident edges by 4-starts (planarization by adding crossing vertices ). In both cases, the aim of planarization is minimize the number of edge removals or replacements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.planarstrght","kind":"concept","label":"planar straight-line graph","sources":[{"id":"nist-dads.planarstrght","title":"NIST Dictionary of Algorithms and Data Structures: planarstrght","url":"https://xlinux.nist.gov/dads/HTML/planarstrght.html"}],"status":"reported","summary":"NIST DADS defines planar straight-line graph as: A graph that can be embedded in the plane without crossings in which every edge in the graph is a straight line segment. It is sometimes referred to as planar subdivision or map.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.plophashing","kind":"concept","label":"PLOP-hashing","sources":[{"id":"nist-dads.plophashing","title":"NIST Dictionary of Algorithms and Data Structures: plophashing","url":"https://xlinux.nist.gov/dads/HTML/plophashing.html"}],"status":"reported","summary":"NIST DADS defines PLOP-hashing as: Piecewise linear order-preserving (PLOP) hashing is a spatial access method which splits space into a nonperiodic grid. Each spatial dimension is divided by nodes of a binary tree . Object are stored in the grid cell of their centroid .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointaccessmethod","kind":"concept","label":"point access method","sources":[{"id":"nist-dads.pointaccessmethod","title":"NIST Dictionary of Algorithms and Data Structures: pointAccessMethod","url":"https://xlinux.nist.gov/dads/HTML/pointAccessMethod.html"}],"status":"reported","summary":"NIST DADS defines point access method as: A data structure and associated algorithms primarily to search for points defined in multidimensional space. Also known as PAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointerjumping","kind":"concept","label":"pointer jumping","sources":[{"id":"nist-dads.pointerjumping","title":"NIST Dictionary of Algorithms and Data Structures: pointerJumping","url":"https://xlinux.nist.gov/dads/HTML/pointerJumping.html"}],"status":"reported","summary":"NIST DADS defines pointer jumping as: In a linked structure, replacing a pointer with the pointer it points to. Used for various algorithms on lists and trees . Also known as recursive doubling, shortcutting.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pointermachn","kind":"concept","label":"pointer machine","sources":[{"id":"nist-dads.pointermachn","title":"NIST Dictionary of Algorithms and Data Structures: pointermachn","url":"https://xlinux.nist.gov/dads/HTML/pointermachn.html"}],"status":"reported","summary":"NIST DADS defines pointer machine as: A model of computation whose memory consists of an unbounded collection of registers, or records, connected by pointers. Each register may contain an arbitrary amount of additional information. No arithmetic is allowed to compute the address of a register. The only way to access a register is by following pointers.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.poissonizatn","kind":"concept","label":"poissonization","sources":[{"id":"nist-dads.poissonizatn","title":"NIST Dictionary of Algorithms and Data Structures: poissonizatn","url":"https://xlinux.nist.gov/dads/HTML/poissonizatn.html"}],"status":"reported","summary":"NIST DADS defines poissonization as: To replace a deterministic input by poisson process, changing the model into a poisson model. A solution to the poisson model must be interpreted in the original model.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polychotomy","kind":"concept","label":"polychotomy","sources":[{"id":"nist-dads.polychotomy","title":"NIST Dictionary of Algorithms and Data Structures: polychotomy","url":"https://xlinux.nist.gov/dads/HTML/polychotomy.html"}],"status":"reported","summary":"NIST DADS defines polychotomy as: Division into many distinct classifications.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polynomaprox","kind":"method","label":"polynomial approximation scheme","sources":[{"id":"nist-dads.polynomaprox","title":"NIST Dictionary of Algorithms and Data Structures: polynomaprox","url":"https://xlinux.nist.gov/dads/HTML/polynomaprox.html"}],"status":"reported","summary":"NIST DADS defines polynomial approximation scheme as: A set of algorithms {A ε | ε > 0}, where each A ε is a (1+ε)-approximation algorithm and the execution time is bounded by a polynomial in the length of the input. The execution time may depend on the choice of ε. Sometimes referred to more precisely as polynomial-time approximation scheme. Also known as PTAS.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomhier","kind":"concept","label":"polynomial hierarchy","sources":[{"id":"nist-dads.polynomhier","title":"NIST Dictionary of Algorithms and Data Structures: polynomhier","url":"https://xlinux.nist.gov/dads/HTML/polynomhier.html"}],"status":"reported","summary":"NIST DADS defines polynomial hierarchy as: The classes of languages accepted by k- alternating Turing machines , over all k≥ 0 and with initial state existential or universal. The bottom level (k=0) is the class P . The next level (k=1) comprises NP and co- NP .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polynomtredc","kind":"concept","label":"polynomial-time reduction","sources":[{"id":"nist-dads.polynomtredc","title":"NIST Dictionary of Algorithms and Data Structures: polynomtredc","url":"https://xlinux.nist.gov/dads/HTML/polynomtredc.html"}],"status":"reported","summary":"NIST DADS defines polynomial-time reduction as: A transformation of one problem into another which is computable in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polyphmerge","kind":"method","label":"polyphase merge","sources":[{"id":"nist-dads.polyphmerge","title":"NIST Dictionary of Algorithms and Data Structures: polyphmerge","url":"https://xlinux.nist.gov/dads/HTML/polyphmerge.html"}],"status":"reported","summary":"NIST DADS defines polyphase merge as: A nonbalanced k-way merge which reduces the number of output files needed by reusing the emptied input file or device as one of the output devices. This is most efficient if the number of output runs in each output file is different.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.polyphmrgsrt","kind":"method","label":"polyphase merge sort","sources":[{"id":"nist-dads.polyphmrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: polyphmrgsrt","url":"https://xlinux.nist.gov/dads/HTML/polyphmrgsrt.html"}],"status":"reported","summary":"NIST DADS defines polyphase merge sort as: A merge sort algorithm that reduces the number of intermediate files needed by reusing emptied files.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.polytope","kind":"concept","label":"polytope","sources":[{"id":"nist-dads.polytope","title":"NIST Dictionary of Algorithms and Data Structures: polytope","url":"https://xlinux.nist.gov/dads/HTML/polytope.html"}],"status":"reported","summary":"NIST DADS defines polytope as: A closed, bounded N-dimensional figure whose faces are hyperplanes. Informally, a multidimensional solid with flat sides. A generalization of polyhedron.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.poset","kind":"concept","label":"poset","sources":[{"id":"nist-dads.poset","title":"NIST Dictionary of Algorithms and Data Structures: poset","url":"https://xlinux.nist.gov/dads/HTML/poset.html"}],"status":"reported","summary":"NIST DADS defines poset as: A set the elements of which are subject to a partial order . Also known as partially ordered set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.postmansort","kind":"method","label":"postman's sort","sources":[{"id":"nist-dads.postmansort","title":"NIST Dictionary of Algorithms and Data Structures: postmansort","url":"https://xlinux.nist.gov/dads/HTML/postmansort.html"}],"status":"reported","summary":"NIST DADS defines postman's sort as: A highly engineered variant of top-down radix sort where attributes of the key are described so the algorithm can allocate buckets and distribute efficiently.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.postordertraversal","kind":"method","label":"postorder traversal","sources":[{"id":"nist-dads.postordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: postorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/postorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines postorder traversal as: Process all nodes of a tree by recursively processing all subtrees, then finally processing the root . Also known as postfix traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.postscorrespondprob","kind":"concept","label":"Post's correspondence problem","sources":[{"id":"nist-dads.postscorrespondprob","title":"NIST Dictionary of Algorithms and Data Structures: postsCorrespondProb","url":"https://xlinux.nist.gov/dads/HTML/postsCorrespondProb.html"}],"status":"reported","summary":"NIST DADS defines Post's correspondence problem as: Given a set of pairs of strings , find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem . Also known as PCP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.potentialfnc","kind":"concept","label":"potential function","sources":[{"id":"nist-dads.potentialfnc","title":"NIST Dictionary of Algorithms and Data Structures: potentialfnc","url":"https://xlinux.nist.gov/dads/HTML/potentialfnc.html"}],"status":"reported","summary":"NIST DADS defines potential function as: A measure of a data structure whose change after an operation corresponds to the time cost of the operation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.predicate","kind":"concept","label":"predicate","sources":[{"id":"nist-dads.predicate","title":"NIST Dictionary of Algorithms and Data Structures: predicate","url":"https://xlinux.nist.gov/dads/HTML/predicate.html"}],"status":"reported","summary":"NIST DADS defines predicate as: A function that returns true or false. Conceptually it tests for a condition.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prefix","kind":"concept","label":"prefix","sources":[{"id":"nist-dads.prefix","title":"NIST Dictionary of Algorithms and Data Structures: prefix","url":"https://xlinux.nist.gov/dads/HTML/prefix.html"}],"status":"reported","summary":"NIST DADS defines prefix as: The beginning characters of a string . More formally a string v∈Σ * is a prefix of a string u∈Σ * if u=vu' for some string u'∈Σ * .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prefixcode","kind":"concept","label":"prefix code","sources":[{"id":"nist-dads.prefixcode","title":"NIST Dictionary of Algorithms and Data Structures: prefixcode","url":"https://xlinux.nist.gov/dads/HTML/prefixcode.html"}],"status":"reported","summary":"NIST DADS defines prefix code as: Set of words such that no word of the set is a prefix of another word in the set. A prefix code may be represented by a coding tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.preordertraversal","kind":"method","label":"preorder traversal","sources":[{"id":"nist-dads.preordertraversal","title":"NIST Dictionary of Algorithms and Data Structures: preorderTraversal","url":"https://xlinux.nist.gov/dads/HTML/preorderTraversal.html"}],"status":"reported","summary":"NIST DADS defines preorder traversal as: Process all nodes of a tree by processing the root , then recursively processing all subtrees. Also known as prefix traversal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primaryclustering","kind":"concept","label":"primary clustering","sources":[{"id":"nist-dads.primaryclustering","title":"NIST Dictionary of Algorithms and Data Structures: primaryClustering","url":"https://xlinux.nist.gov/dads/HTML/primaryClustering.html"}],"status":"reported","summary":"NIST DADS defines primary clustering as: The tendency for some collision resolution schemes to create long runs of filled slots near the hash function position of keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primitivealgorithm","kind":"concept","label":"primitive algorithm","sources":[{"id":"nist-dads.primitivealgorithm","title":"NIST Dictionary of Algorithms and Data Structures: primitiveAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/primitiveAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines primitive algorithm as: An algorithm in which all the computable steps are basic operations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.primitiverecursive","kind":"concept","label":"primitive recursive","sources":[{"id":"nist-dads.primitiverecursive","title":"NIST Dictionary of Algorithms and Data Structures: primitiveRecursive","url":"https://xlinux.nist.gov/dads/HTML/primitiveRecursive.html"}],"status":"reported","summary":"NIST DADS defines primitive recursive as: A total function that can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.principle","kind":"concept","label":"principle of optimality","sources":[{"id":"nist-dads.principle","title":"NIST Dictionary of Algorithms and Data Structures: principle","url":"https://xlinux.nist.gov/dads/HTML/principle.html"}],"status":"reported","summary":"NIST DADS defines principle of optimality as: In some optimization problems , components of a globally optimal solution are themselves globally optimal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.prisonersdilemma","kind":"concept","label":"prisoner's dilemma","sources":[{"id":"nist-dads.prisonersdilemma","title":"NIST Dictionary of Algorithms and Data Structures: prisonersDilemma","url":"https://xlinux.nist.gov/dads/HTML/prisonersDilemma.html"}],"status":"reported","summary":"NIST DADS defines prisoner's dilemma as: Two prisoners are questioned separately about a crime they committed. Each may give evidence against the other or may say nothing. If both say nothing, they get a minor reprimand and go free because of lack of evidence. If one gives evidence and the other says nothing, the first goes free and the second is severely punished. If both give evidence, both are severely punished. The overall (globally) best strategy is for both to say nothing. However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome. In general, a situation where local optimization leads to the worst possible outcome globally.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probabilisticallycheckableproof","kind":"concept","label":"probabilistically checkable proof","sources":[{"id":"nist-dads.probabilisticallycheckableproof","title":"NIST Dictionary of Algorithms and Data Structures: probabilisticallyCheckableProof","url":"https://xlinux.nist.gov/dads/HTML/probabilisticallyCheckableProof.html"}],"status":"reported","summary":"NIST DADS defines probabilistically checkable proof as: An interactive proof system in which provers follow a fixed strategy, that is, one not affected by any messages from the verifier. The prover's strategy for a given instance x of a decision problem can be represented by a finite oracle language B x , which constitutes a proof of the correct answer for x.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probablalgo","kind":"concept","label":"probabilistic algorithm","sources":[{"id":"nist-dads.probablalgo","title":"NIST Dictionary of Algorithms and Data Structures: probablAlgo","url":"https://xlinux.nist.gov/dads/HTML/probablAlgo.html"}],"status":"reported","summary":"NIST DADS defines probabilistic algorithm as: Any algorithm that works for all practical purposes but has a theoretical chance of being wrong.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probablturng","kind":"concept","label":"probabilistic Turing machine","sources":[{"id":"nist-dads.probablturng","title":"NIST Dictionary of Algorithms and Data Structures: probablturng","url":"https://xlinux.nist.gov/dads/HTML/probablturng.html"}],"status":"reported","summary":"NIST DADS defines probabilistic Turing machine as: A Turing machine in which some transitions are random choices among finitely many alternatives.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.probesequenc","kind":"concept","label":"probe sequence","sources":[{"id":"nist-dads.probesequenc","title":"NIST Dictionary of Algorithms and Data Structures: probesequenc","url":"https://xlinux.nist.gov/dads/HTML/probesequenc.html"}],"status":"reported","summary":"NIST DADS defines probe sequence as: The list of locations which a method for open addressing produces as alternatives in case of a collision .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.procedure","kind":"concept","label":"procedure","sources":[{"id":"nist-dads.procedure","title":"NIST Dictionary of Algorithms and Data Structures: procedure","url":"https://xlinux.nist.gov/dads/HTML/procedure.html"}],"status":"reported","summary":"NIST DADS defines procedure as: A subroutine which does not return a value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.processalgbr","kind":"concept","label":"process algebra","sources":[{"id":"nist-dads.processalgbr","title":"NIST Dictionary of Algorithms and Data Structures: processalgbr","url":"https://xlinux.nist.gov/dads/HTML/processalgbr.html"}],"status":"reported","summary":"NIST DADS defines process algebra as: An algebraic theory to formalize the notion of concurrent computation, best exemplified in CSP and CCS .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.proper","kind":"concept","label":"proper","sources":[{"id":"nist-dads.proper","title":"NIST Dictionary of Algorithms and Data Structures: proper","url":"https://xlinux.nist.gov/dads/HTML/proper.html"}],"status":"reported","summary":"NIST DADS defines proper as: (1) A subunit of a unit is not equal to the unit itself. For instance, a proper substring is not the whole string , a proper subset is not the whole set , a proper subgraph is not the whole graph , etc. (2) According to a rule, as in proper coloring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.propercolor","kind":"concept","label":"proper coloring","sources":[{"id":"nist-dads.propercolor","title":"NIST Dictionary of Algorithms and Data Structures: propercolor","url":"https://xlinux.nist.gov/dads/HTML/propercolor.html"}],"status":"reported","summary":"NIST DADS defines proper coloring as: A vertex coloring or edge coloring of a graph in which no two adjacent vertices or edges have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.propersubset","kind":"concept","label":"proper subset","sources":[{"id":"nist-dads.propersubset","title":"NIST Dictionary of Algorithms and Data Structures: propersubset","url":"https://xlinux.nist.gov/dads/HTML/propersubset.html"}],"status":"reported","summary":"NIST DADS defines proper subset as: A set S 2 is a proper subset of another set S 1 if every element in S 2 is in S 1 and S 1 has some elements which are not in S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.prunensearch","kind":"method","label":"prune and search","sources":[{"id":"nist-dads.prunensearch","title":"NIST Dictionary of Algorithms and Data Structures: pruneNsearch","url":"https://xlinux.nist.gov/dads/HTML/pruneNsearch.html"}],"status":"reported","summary":"NIST DADS defines prune and search as: Find an optimal value by eliminating a constant fraction of remaining objects at each step. Eliminated objects are guaranteed not to affect the optimal value. A logarithmic number of steps reduces the number of objects to a constant, and a brute force approach can then solve it. Also known as decimation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.pseudorandomnumbergen","kind":"method","label":"pseudo-random number generator","sources":[{"id":"nist-dads.pseudorandomnumbergen","title":"NIST Dictionary of Algorithms and Data Structures: pseudorandomNumberGen","url":"https://xlinux.nist.gov/dads/HTML/pseudorandomNumberGen.html"}],"status":"reported","summary":"NIST DADS defines pseudo-random number generator as: A deterministic algorithm to generate a sequence of numbers with little or no discernible pattern in the numbers, except for broad statistical properties. Also known as PRNG, deterministic random bit generator, DRBG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ptree","kind":"concept","label":"P-tree","sources":[{"id":"nist-dads.ptree","title":"NIST Dictionary of Algorithms and Data Structures: ptree","url":"https://xlinux.nist.gov/dads/HTML/ptree.html"}],"status":"reported","summary":"NIST DADS defines P-tree as: (1) A spatial access method that defines hyperplanes, in addition to the orthogonal dimensions, which node boundaries may parallel. Space is split by hierarchically nested polytopes (multidimensional boxes with nonrectangular sides). The R-tree is a special case that has no additional hyperplanes. (2) A spatial access method that splits space by hierarchically nested polytopes. The R-tree is a special case in which all polytopes are boxes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.purelyfnctnl","kind":"concept","label":"purely functional language","sources":[{"id":"nist-dads.purelyfnctnl","title":"NIST Dictionary of Algorithms and Data Structures: purelyfnctnl","url":"https://xlinux.nist.gov/dads/HTML/purelyfnctnl.html"}],"status":"reported","summary":"NIST DADS defines purely functional language as: A language that does not allow any destructive operation---one which overwrites data---such as the assignment operation. Purely functional languages are free of side effects, i.e., invoking a function has no effect other than computing the value returned by the function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.pushdownautm","kind":"concept","label":"pushdown automaton","sources":[{"id":"nist-dads.pushdownautm","title":"NIST Dictionary of Algorithms and Data Structures: pushdownautm","url":"https://xlinux.nist.gov/dads/HTML/pushdownautm.html"}],"status":"reported","summary":"NIST DADS defines pushdown automaton as: A restricted Turing machine where the tape acts as a pushdown store (or stack , where only the latest element can be read), with an extra one-way read-only input tape. Also known as PDA.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.qsort","kind":"method","label":"q sort","sources":[{"id":"nist-dads.qsort","title":"NIST Dictionary of Algorithms and Data Structures: qsort","url":"https://xlinux.nist.gov/dads/HTML/qsort.html"}],"status":"reported","summary":"NIST DADS defines q sort as: The sort function in many libraries. It is generally a combination of quicksort, for many items, and insertion sort , for a few items.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quadraticprb","kind":"method","label":"quadratic probing","sources":[{"id":"nist-dads.quadraticprb","title":"NIST Dictionary of Algorithms and Data Structures: quadraticprb","url":"https://xlinux.nist.gov/dads/HTML/quadraticprb.html"}],"status":"reported","summary":"NIST DADS defines quadratic probing as: A method of open addressing for a hash table in which a collision is resolved by putting the item in the next empty place given by a probe sequence . The space between places in the sequence increases quadratically.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.quadtrie","kind":"concept","label":"quad trie","sources":[{"id":"nist-dads.quadtrie","title":"NIST Dictionary of Algorithms and Data Structures: quadtrie","url":"https://xlinux.nist.gov/dads/HTML/quadtrie.html"}],"status":"reported","summary":"NIST DADS defines quad trie as: A tree in which each node is split according to some subset of the key , typically a character.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.quantumcomputation","kind":"concept","label":"quantum computation","sources":[{"id":"nist-dads.quantumcomputation","title":"NIST Dictionary of Algorithms and Data Structures: quantumComputation","url":"https://xlinux.nist.gov/dads/HTML/quantumComputation.html"}],"status":"reported","summary":"NIST DADS defines quantum computation as: Computation based on quantum mechanical effects, such as superposition and entanglement, in addition to classical digital manipulations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.quicksearch","kind":"method","label":"quick search","sources":[{"id":"nist-dads.quicksearch","title":"NIST Dictionary of Algorithms and Data Structures: quicksearch","url":"https://xlinux.nist.gov/dads/HTML/quicksearch.html"}],"status":"reported","summary":"NIST DADS defines quick search as: A string matching algorithm that compares characters from the end of the search string to its beginning. When a character doesn't match, the next character in the text beyond the search string determines where the next possible match begins.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.raggedmatrix","kind":"concept","label":"ragged matrix","sources":[{"id":"nist-dads.raggedmatrix","title":"NIST Dictionary of Algorithms and Data Structures: raggedmatrix","url":"https://xlinux.nist.gov/dads/HTML/raggedmatrix.html"}],"status":"reported","summary":"NIST DADS defines ragged matrix as: A matrix having irregular numbers of items in each row.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomsearch","kind":"method","label":"random search","sources":[{"id":"nist-dads.randomsearch","title":"NIST Dictionary of Algorithms and Data Structures: randomSearch","url":"https://xlinux.nist.gov/dads/HTML/randomSearch.html"}],"status":"reported","summary":"NIST DADS defines random search as: Repeatedly check items in an array at random until successful.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomaccess","kind":"concept","label":"random access machine","sources":[{"id":"nist-dads.randomaccess","title":"NIST Dictionary of Algorithms and Data Structures: randomaccess","url":"https://xlinux.nist.gov/dads/HTML/randomaccess.html"}],"status":"reported","summary":"NIST DADS defines random access machine as: A model of computation whose memory consists of an unbounded sequence of registers, each of which may hold an integer. In this model, arithmetic operations are allowed to compute the address of a memory register.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomizdrnd","kind":"method","label":"randomized rounding","sources":[{"id":"nist-dads.randomizdrnd","title":"NIST Dictionary of Algorithms and Data Structures: randomizdrnd","url":"https://xlinux.nist.gov/dads/HTML/randomizdrnd.html"}],"status":"reported","summary":"NIST DADS defines randomized rounding as: A probabilistic method to convert a solution of a relaxed problem into an approximate solution to the original problem.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedalgo","kind":"concept","label":"randomized algorithm","sources":[{"id":"nist-dads.randomizedalgo","title":"NIST Dictionary of Algorithms and Data Structures: randomizedAlgo","url":"https://xlinux.nist.gov/dads/HTML/randomizedAlgo.html"}],"status":"reported","summary":"NIST DADS defines randomized algorithm as: An algorithm that makes random (or pseudorandom) choices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedbinarysearchtree","kind":"concept","label":"randomized binary search tree","sources":[{"id":"nist-dads.randomizedbinarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: randomizedBinarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/randomizedBinarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines randomized binary search tree as: A binary search tree in which nodes have a randomly assigned priority. Updates keep priorities in heap order instead of keeping balance information and doing rebalance operations. Also known as cartesian tree, RBST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.randomizedcomplexity","kind":"concept","label":"randomized complexity","sources":[{"id":"nist-dads.randomizedcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: randomizedComplexity","url":"https://xlinux.nist.gov/dads/HTML/randomizedComplexity.html"}],"status":"reported","summary":"NIST DADS defines randomized complexity as: The expected running time of the best possible randomized algorithm over the worst input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.randomsampl","kind":"method","label":"random sampling","sources":[{"id":"nist-dads.randomsampl","title":"NIST Dictionary of Algorithms and Data Structures: randomsampl","url":"https://xlinux.nist.gov/dads/HTML/randomsampl.html"}],"status":"reported","summary":"NIST DADS defines random sampling as: Using a randomly selected sample of the data to help solve a problem on the whole data.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.range","kind":"concept","label":"range","sources":[{"id":"nist-dads.range","title":"NIST Dictionary of Algorithms and Data Structures: range","url":"https://xlinux.nist.gov/dads/HTML/range.html"}],"status":"reported","summary":"NIST DADS defines range as: The possible results of a function or relation . For instance, the range of cosine is [-1,+1].","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rangesort","kind":"method","label":"range sort","sources":[{"id":"nist-dads.rangesort","title":"NIST Dictionary of Algorithms and Data Structures: rangesort","url":"https://xlinux.nist.gov/dads/HTML/rangesort.html"}],"status":"reported","summary":"NIST DADS defines range sort as: A bucket sort where the function to determine the bucket is based on the range of possible keys .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rank","kind":"concept","label":"rank","sources":[{"id":"nist-dads.rank","title":"NIST Dictionary of Algorithms and Data Structures: rank","url":"https://xlinux.nist.gov/dads/HTML/rank.html"}],"status":"reported","summary":"NIST DADS defines rank as: For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rapidsort","kind":"method","label":"rapid sort","sources":[{"id":"nist-dads.rapidsort","title":"NIST Dictionary of Algorithms and Data Structures: rapidSort","url":"https://xlinux.nist.gov/dads/HTML/rapidSort.html"}],"status":"reported","summary":"NIST DADS defines rapid sort as: A 2-pass sort algorithm that is efficient when the range of keys is approximately equal to the number of items and only keys are sorted. The first pass counts the occurrences of each key in an auxiliary array . The second pass goes over the auxiliary array writing the counted number of keys to the destination.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.ratcliffobershelp","kind":"method","label":"Ratcliff/Obershelp pattern recognition","sources":[{"id":"nist-dads.ratcliffobershelp","title":"NIST Dictionary of Algorithms and Data Structures: ratcliffObershelp","url":"https://xlinux.nist.gov/dads/HTML/ratcliffObershelp.html"}],"status":"reported","summary":"NIST DADS defines Ratcliff/Obershelp pattern recognition as: Compute the similarity of two strings as the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common substring plus, recursively, matching characters in the unmatched region on either side of the longest common substring.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reachable","kind":"concept","label":"reachable","sources":[{"id":"nist-dads.reachable","title":"NIST Dictionary of Algorithms and Data Structures: reachable","url":"https://xlinux.nist.gov/dads/HTML/reachable.html"}],"status":"reported","summary":"NIST DADS defines reachable as: A vertex v is reachable from another vertex u if there is a path of any length from u to v. Also known as reachability.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rebalance","kind":"method","label":"rebalance","sources":[{"id":"nist-dads.rebalance","title":"NIST Dictionary of Algorithms and Data Structures: rebalance","url":"https://xlinux.nist.gov/dads/HTML/rebalance.html"}],"status":"reported","summary":"NIST DADS defines rebalance as: Restore balance to a tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recognizer","kind":"concept","label":"recognizer","sources":[{"id":"nist-dads.recognizer","title":"NIST Dictionary of Algorithms and Data Structures: recognizer","url":"https://xlinux.nist.gov/dads/HTML/recognizer.html"}],"status":"reported","summary":"NIST DADS defines recognizer as: A finite state machine with one or more states designated as accepting states . An input string is accepted if there is a path from the start state to an accepting state.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectangmatrx","kind":"concept","label":"rectangular matrix","sources":[{"id":"nist-dads.rectangmatrx","title":"NIST Dictionary of Algorithms and Data Structures: rectangmatrx","url":"https://xlinux.nist.gov/dads/HTML/rectangmatrx.html"}],"status":"reported","summary":"NIST DADS defines rectangular matrix as: An n × m matrix , or, one whose size may not be the same in both dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectilinear","kind":"concept","label":"rectilinear","sources":[{"id":"nist-dads.rectilinear","title":"NIST Dictionary of Algorithms and Data Structures: rectilinear","url":"https://xlinux.nist.gov/dads/HTML/rectilinear.html"}],"status":"reported","summary":"NIST DADS defines rectilinear as: Distance, paths, lines, etc. which are always parallel to axes at right angles. For example, a path along the streets of Salt Lake City or the moves of a rook in chess.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rectilinearsteinertree","kind":"concept","label":"rectilinear Steiner tree","sources":[{"id":"nist-dads.rectilinearsteinertree","title":"NIST Dictionary of Algorithms and Data Structures: rectilinearSteinertree","url":"https://xlinux.nist.gov/dads/HTML/rectilinearSteinertree.html"}],"status":"reported","summary":"NIST DADS defines rectilinear Steiner tree as: A minimum-length rectilinear tree connecting a set of points, called terminals , in the plane. This tree may include points other than the terminals, which are called Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recurrence","kind":"concept","label":"recurrence relation","sources":[{"id":"nist-dads.recurrence","title":"NIST Dictionary of Algorithms and Data Structures: recurrence","url":"https://xlinux.nist.gov/dads/HTML/recurrence.html"}],"status":"reported","summary":"NIST DADS defines recurrence relation as: The specification of a sequence of values in terms of earlier values in the sequence and base values. Also known as recurrence equations.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursiontree","kind":"concept","label":"recursion tree","sources":[{"id":"nist-dads.recursiontree","title":"NIST Dictionary of Algorithms and Data Structures: recursionTree","url":"https://xlinux.nist.gov/dads/HTML/recursionTree.html"}],"status":"reported","summary":"NIST DADS defines recursion tree as: A method to analyze the complexity of an algorithm by diagramming the recursive function calls. Formal Definition: A recursion tree T(p) of degree p is either (i) null or (ii) has p children which are recursion trees.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursiontrm","kind":"concept","label":"recursion termination","sources":[{"id":"nist-dads.recursiontrm","title":"NIST Dictionary of Algorithms and Data Structures: recursiontrm","url":"https://xlinux.nist.gov/dads/HTML/recursiontrm.html"}],"status":"reported","summary":"NIST DADS defines recursion termination as: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursive","kind":"concept","label":"recursive","sources":[{"id":"nist-dads.recursive","title":"NIST Dictionary of Algorithms and Data Structures: recursive","url":"https://xlinux.nist.gov/dads/HTML/recursive.html"}],"status":"reported","summary":"NIST DADS defines recursive as: (1) A data structure that is partially composed of other instances of the data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements. (2) An algorithm in which functions might call themselves. For instance, quicksort or heapify .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursivelyenumerablelang","kind":"concept","label":"recursively enumerable language","sources":[{"id":"nist-dads.recursivelyenumerablelang","title":"NIST Dictionary of Algorithms and Data Structures: recursivelyEnumerableLang","url":"https://xlinux.nist.gov/dads/HTML/recursivelyEnumerableLang.html"}],"status":"reported","summary":"NIST DADS defines recursively enumerable language as: A language accepted by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.recursivstrc","kind":"concept","label":"recursive data structure","sources":[{"id":"nist-dads.recursivstrc","title":"NIST Dictionary of Algorithms and Data Structures: recursivstrc","url":"https://xlinux.nist.gov/dads/HTML/recursivstrc.html"}],"status":"reported","summary":"NIST DADS defines recursive data structure as: A data structure that is partially composed of smaller or simpler instances of the same data structure. For instance, a tree is composed of smaller trees ( subtrees ) and leaf nodes , and a list may have other lists as elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reducedbasis","kind":"concept","label":"reduced basis","sources":[{"id":"nist-dads.reducedbasis","title":"NIST Dictionary of Algorithms and Data Structures: reducedbasis","url":"https://xlinux.nist.gov/dads/HTML/reducedbasis.html"}],"status":"reported","summary":"NIST DADS defines reduced basis as: A basis for a lattice that is nearly orthogonal.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reduction","kind":"concept","label":"reduction","sources":[{"id":"nist-dads.reduction","title":"NIST Dictionary of Algorithms and Data Structures: reduction","url":"https://xlinux.nist.gov/dads/HTML/reduction.html"}],"status":"reported","summary":"NIST DADS defines reduction as: A computable transformation of one problem into another.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.reflexive","kind":"concept","label":"reflexive","sources":[{"id":"nist-dads.reflexive","title":"NIST Dictionary of Algorithms and Data Structures: reflexive","url":"https://xlinux.nist.gov/dads/HTML/reflexive.html"}],"status":"reported","summary":"NIST DADS defines reflexive as: A binary relation R for which a R a for all a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.regular","kind":"concept","label":"regular decomposition","sources":[{"id":"nist-dads.regular","title":"NIST Dictionary of Algorithms and Data Structures: regular","url":"https://xlinux.nist.gov/dads/HTML/regular.html"}],"status":"reported","summary":"NIST DADS defines regular decomposition as: A space decomposition method that partitions the underlying space by recursively halving it across the various dimensions instead of permitting the partitioning lines to vary.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relation","kind":"concept","label":"relation","sources":[{"id":"nist-dads.relation","title":"NIST Dictionary of Algorithms and Data Structures: relation","url":"https://xlinux.nist.gov/dads/HTML/relation.html"}],"status":"reported","summary":"NIST DADS defines relation as: A computation which takes some inputs and yields an output. Any particular input may yield different outputs at different times. Formally, a mapping from each element in the domain to one or more elements in the range .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relational","kind":"concept","label":"relational structure","sources":[{"id":"nist-dads.relational","title":"NIST Dictionary of Algorithms and Data Structures: relational","url":"https://xlinux.nist.gov/dads/HTML/relational.html"}],"status":"reported","summary":"NIST DADS defines relational structure as: The counterpart in formal logic of a data structure or class instance in the object-oriented sense. Examples are strings , directed graphs , and undirected graphs . Sets of relational structures generalize the notion of languages as sets of strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relativeperformguar","kind":"concept","label":"relative performance guarantee","sources":[{"id":"nist-dads.relativeperformguar","title":"NIST Dictionary of Algorithms and Data Structures: relativePerformGuar","url":"https://xlinux.nist.gov/dads/HTML/relativePerformGuar.html"}],"status":"reported","summary":"NIST DADS defines relative performance guarantee as: The maximum ratio by which the result of a ρ-approximation algorithm may depart from the optimal solution . Also known as performance ratio.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relaxation","kind":"concept","label":"relaxation","sources":[{"id":"nist-dads.relaxation","title":"NIST Dictionary of Algorithms and Data Structures: relaxation","url":"https://xlinux.nist.gov/dads/HTML/relaxation.html"}],"status":"reported","summary":"NIST DADS defines relaxation as: An optimization problem with an enlarged feasible region (and extended objective function ) compared with an original optimization problem. Typically, the relaxation is considerably easier to solve than the original.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.relaxedbalance","kind":"concept","label":"relaxed balance","sources":[{"id":"nist-dads.relaxedbalance","title":"NIST Dictionary of Algorithms and Data Structures: relaxedBalance","url":"https://xlinux.nist.gov/dads/HTML/relaxedBalance.html"}],"status":"reported","summary":"NIST DADS defines relaxed balance as: When rebalancing a search tree is independent of updating the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.repeatedsquaring","kind":"method","label":"repeated squaring","sources":[{"id":"nist-dads.repeatedsquaring","title":"NIST Dictionary of Algorithms and Data Structures: repeatedSquaring","url":"https://xlinux.nist.gov/dads/HTML/repeatedSquaring.html"}],"status":"reported","summary":"NIST DADS defines repeated squaring as: Compute the n th power of an expression in Θ(log n) steps by repeatedly squaring an intermediate result and multiplying an accumulating value by the intermediate result when appropriate.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rescalable","kind":"concept","label":"rescalable","sources":[{"id":"nist-dads.rescalable","title":"NIST Dictionary of Algorithms and Data Structures: rescalable","url":"https://xlinux.nist.gov/dads/HTML/rescalable.html"}],"status":"reported","summary":"NIST DADS defines rescalable as: An optimization for which given any instance of the problem and integer λ >0, there is an easily computed second instance that is the same except that the objective function for the second instance is (element-wise) λ times the objective function of the first instance. For such problems, the best one can hope for is a relative performance guarantee , not an absolute performance guarantee .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.reservoirsampling","kind":"method","label":"reservoir sampling","sources":[{"id":"nist-dads.reservoirsampling","title":"NIST Dictionary of Algorithms and Data Structures: reservoirSampling","url":"https://xlinux.nist.gov/dads/HTML/reservoirSampling.html"}],"status":"reported","summary":"NIST DADS defines reservoir sampling as: Randomly select k items from a stream of items of unknown length. Save the first k items in an array of size k. For each item j, j > k, choose a random integer M from 1 to j (inclusive). If M ≤ k, replace item M of the array with item j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.restricted","kind":"concept","label":"restricted universe sort","sources":[{"id":"nist-dads.restricted","title":"NIST Dictionary of Algorithms and Data Structures: restricted","url":"https://xlinux.nist.gov/dads/HTML/restricted.html"}],"status":"reported","summary":"NIST DADS defines restricted universe sort as: A sort algorithm that operates on the basis that the keys are members of a restricted set of values. They may not require comparisons of keys to perform the sorting.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rfile","kind":"concept","label":"R-file","sources":[{"id":"nist-dads.rfile","title":"NIST Dictionary of Algorithms and Data Structures: rfile","url":"https://xlinux.nist.gov/dads/HTML/rfile.html"}],"status":"reported","summary":"NIST DADS defines R-file as: A spatial access method which divides space into a hierarchically of nested boxes. Objects are indexed in the lowest cell which completely contains them.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rhoapproxmtn","kind":"method","label":"ρ-approximation algorithm","sources":[{"id":"nist-dads.rhoapproxmtn","title":"NIST Dictionary of Algorithms and Data Structures: rhoapproxmtn","url":"https://xlinux.nist.gov/dads/HTML/rhoapproxmtn.html"}],"status":"reported","summary":"NIST DADS defines ρ-approximation algorithm as: An approximation algorithm guaranteed to find a solution at most (or at least, as appropriate) ρ times the optimum. The ratio ρ is the performance ratio or relative performance guarantee of the algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ricesmethod","kind":"concept","label":"Rice's method","sources":[{"id":"nist-dads.ricesmethod","title":"NIST Dictionary of Algorithms and Data Structures: ricesmethod","url":"https://xlinux.nist.gov/dads/HTML/ricesmethod.html"}],"status":"reported","summary":"NIST DADS defines Rice's method as: A method of complex asymptotics that can handle certain alternating sums arising in the analysis of algorithms.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rightthreadedtree","kind":"concept","label":"right-threaded tree","sources":[{"id":"nist-dads.rightthreadedtree","title":"NIST Dictionary of Algorithms and Data Structures: rightThreadedTree","url":"https://xlinux.nist.gov/dads/HTML/rightThreadedTree.html"}],"status":"reported","summary":"NIST DADS defines right-threaded tree as: A variant of a threaded tree in which only the right thread, i.e. link to the successor, of each node is maintained.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.rightrotatn","kind":"method","label":"right rotation","sources":[{"id":"nist-dads.rightrotatn","title":"NIST Dictionary of Algorithms and Data Structures: rightrotatn","url":"https://xlinux.nist.gov/dads/HTML/rightrotatn.html"}],"status":"reported","summary":"NIST DADS defines right rotation as: (1) In a binary search tree , pushing a node N down and to the right to balance the tree. N's left child replaces N, and the left child's right child becomes N's left child. (2) In an array , moving all items to the next higher location. The last item is moved to the first location, which is now vacant. (3) In a list , removing the tail and inserting it at the head . Also known as rotate right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.robinhoodhashing","kind":"method","label":"Robin Hood hashing","sources":[{"id":"nist-dads.robinhoodhashing","title":"NIST Dictionary of Algorithms and Data Structures: robinHoodHashing","url":"https://xlinux.nist.gov/dads/HTML/robinHoodHashing.html"}],"status":"reported","summary":"NIST DADS defines Robin Hood hashing as: In case of collision , the item with the longer probe sequence stays in the position. The other item is moved. This tends to equalize the length of probe sequences.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rootedtree","kind":"concept","label":"rooted tree","sources":[{"id":"nist-dads.rootedtree","title":"NIST Dictionary of Algorithms and Data Structures: rootedtree","url":"https://xlinux.nist.gov/dads/HTML/rootedtree.html"}],"status":"reported","summary":"NIST DADS defines rooted tree as: A tree in which one node is designated as the root . Also known as oriented tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rotation","kind":"concept","label":"rotation","sources":[{"id":"nist-dads.rotation","title":"NIST Dictionary of Algorithms and Data Structures: rotation","url":"https://xlinux.nist.gov/dads/HTML/rotation.html"}],"status":"reported","summary":"NIST DADS defines rotation as: To switch children and parents among two or three adjacent nodes to restore balance to a tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rp","kind":"concept","label":"RP","sources":[{"id":"nist-dads.rp","title":"NIST Dictionary of Algorithms and Data Structures: rp","url":"https://xlinux.nist.gov/dads/HTML/rp.html"}],"status":"reported","summary":"NIST DADS defines RP as: The class of languages for which membership can be determined in polynomial time by a probabilistic Turing machine with no false acceptances and less than half false rejections. \"RP\" means \" R andomized P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that accepts or rejects any string in polynomial time . If w ∉ S, M rejects w. If w ∈ S, M accepts w with a probability at least 1/2. Also known as randomized polynomial time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.rtree","kind":"concept","label":"R-tree","sources":[{"id":"nist-dads.rtree","title":"NIST Dictionary of Algorithms and Data Structures: rtree","url":"https://xlinux.nist.gov/dads/HTML/rtree.html"}],"status":"reported","summary":"NIST DADS defines R-tree as: (1) A spatial access method that splits space with hierarchically nested, and possibly overlapping, boxes. The tree is height-balanced. (2) A recursion tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.runtime","kind":"concept","label":"run time","sources":[{"id":"nist-dads.runtime","title":"NIST Dictionary of Algorithms and Data Structures: runtime","url":"https://xlinux.nist.gov/dads/HTML/runtime.html"}],"status":"reported","summary":"NIST DADS defines run time as: (1) The amount of time needed to execute an algorithm . (2) The time when a compiled program is executing, versus compile time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.saturatededge","kind":"concept","label":"saturated edge","sources":[{"id":"nist-dads.saturatededge","title":"NIST Dictionary of Algorithms and Data Structures: saturatedEdge","url":"https://xlinux.nist.gov/dads/HTML/saturatedEdge.html"}],"status":"reported","summary":"NIST DADS defines saturated edge as: An edge in a flow network which has the maximum possible flow.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sbbtree","kind":"concept","label":"SBB tree","sources":[{"id":"nist-dads.sbbtree","title":"NIST Dictionary of Algorithms and Data Structures: sbbtree","url":"https://xlinux.nist.gov/dads/HTML/sbbtree.html"}],"status":"reported","summary":"NIST DADS defines SBB tree as: A symmetric binary B-tree. Now known as a red-black tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.scan","kind":"method","label":"scan","sources":[{"id":"nist-dads.scan","title":"NIST Dictionary of Algorithms and Data Structures: scan","url":"https://xlinux.nist.gov/dads/HTML/scan.html"}],"status":"reported","summary":"NIST DADS defines scan as: A parallel operation in which each element in an array or linked list receives the sum of all previous elements. Also known as prefix sums.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.scapegoattree","kind":"method","label":"scapegoat tree","sources":[{"id":"nist-dads.scapegoattree","title":"NIST Dictionary of Algorithms and Data Structures: scapegoatTree","url":"https://xlinux.nist.gov/dads/HTML/scapegoatTree.html"}],"status":"reported","summary":"NIST DADS defines scapegoat tree as: A binary search tree that needs no balance information. Search time is logarithmic , and the amortized cost of update is logarithmic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.searchtree","kind":"concept","label":"search tree","sources":[{"id":"nist-dads.searchtree","title":"NIST Dictionary of Algorithms and Data Structures: searchtree","url":"https://xlinux.nist.gov/dads/HTML/searchtree.html"}],"status":"reported","summary":"NIST DADS defines search tree as: A tree where every subtree of a node has keys less than any other subtree of the node to its right. The keys in a node are conceptually between subtrees and are greater than any keys in subtrees to its left and less than any keys in subtrees to its right.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.searchtrprop","kind":"concept","label":"search tree property","sources":[{"id":"nist-dads.searchtrprop","title":"NIST Dictionary of Algorithms and Data Structures: searchtrprop","url":"https://xlinux.nist.gov/dads/HTML/searchtrprop.html"}],"status":"reported","summary":"NIST DADS defines search tree property as: When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.secantsearch","kind":"method","label":"secant search","sources":[{"id":"nist-dads.secantsearch","title":"NIST Dictionary of Algorithms and Data Structures: secantSearch","url":"https://xlinux.nist.gov/dads/HTML/secantSearch.html"}],"status":"reported","summary":"NIST DADS defines secant search as: Search a sorted array by estimating the next position to check based on the values at the two previous positions checked.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.secondaryclustering","kind":"concept","label":"secondary clustering","sources":[{"id":"nist-dads.secondaryclustering","title":"NIST Dictionary of Algorithms and Data Structures: secondaryClustering","url":"https://xlinux.nist.gov/dads/HTML/secondaryClustering.html"}],"status":"reported","summary":"NIST DADS defines secondary clustering as: The tendency for some collision resolution schemes to create long run of filled slots away from a key hash position, e.g., along the probe sequence .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.segment","kind":"concept","label":"segment","sources":[{"id":"nist-dads.segment","title":"NIST Dictionary of Algorithms and Data Structures: segment","url":"https://xlinux.nist.gov/dads/HTML/segment.html"}],"status":"reported","summary":"NIST DADS defines segment as: (1) The substring of a pattern delimited by two don't cares or one don't care and beginning or end of the pattern. (2) A substring .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.select","kind":"method","label":"Select","sources":[{"id":"nist-dads.select","title":"NIST Dictionary of Algorithms and Data Structures: select","url":"https://xlinux.nist.gov/dads/HTML/select.html"}],"status":"reported","summary":"NIST DADS defines Select as: A four-part algorithm to select the k th smallest element of an array . Part 1) Consider the array as groups of 5 elements; sort and find the median of each group. 2) Use Select recursively to find x , the median of the medians. 3) Next partition the array around x . 4) Let i be the number of elements in the low side of the partition. If k ≤ i, use Select recursively to find the k th element of the low side. Otherwise Select the k-i th element of the high side.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selectandpartition","kind":"concept","label":"select and partition","sources":[{"id":"nist-dads.selectandpartition","title":"NIST Dictionary of Algorithms and Data Structures: selectAndPartition","url":"https://xlinux.nist.gov/dads/HTML/selectAndPartition.html"}],"status":"reported","summary":"NIST DADS defines select and partition as: Given an array A of n elements and a positive integer k ≤ n, find the k th smallest element of A and partition the array such that A[1], …, A[k-1] ≤ A[k] ≤ A[k+1], …, A[n].","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.selectmode","kind":"method","label":"select mode","sources":[{"id":"nist-dads.selectmode","title":"NIST Dictionary of Algorithms and Data Structures: selectmode","url":"https://xlinux.nist.gov/dads/HTML/selectmode.html"}],"status":"reported","summary":"NIST DADS defines select mode as: An algorithm to find the mode, or most frequently occurring value, in a group of elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selforganizinglist","kind":"concept","label":"self-organizing list","sources":[{"id":"nist-dads.selforganizinglist","title":"NIST Dictionary of Algorithms and Data Structures: selfOrganizingList","url":"https://xlinux.nist.gov/dads/HTML/selfOrganizingList.html"}],"status":"reported","summary":"NIST DADS defines self-organizing list as: A list that reorders the elements based on some self-organizing heuristic [Wikipedia] to improve average access time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.selfloop","kind":"concept","label":"self-loop","sources":[{"id":"nist-dads.selfloop","title":"NIST Dictionary of Algorithms and Data Structures: selfloop","url":"https://xlinux.nist.gov/dads/HTML/selfloop.html"}],"status":"reported","summary":"NIST DADS defines self-loop as: An edge of a graph which starts and ends at the same vertex .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.semidefinite","kind":"concept","label":"semidefinite programming","sources":[{"id":"nist-dads.semidefinite","title":"NIST Dictionary of Algorithms and Data Structures: semidefinite","url":"https://xlinux.nist.gov/dads/HTML/semidefinite.html"}],"status":"reported","summary":"NIST DADS defines semidefinite programming as: A generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.separatechaining","kind":"concept","label":"separate chaining","sources":[{"id":"nist-dads.separatechaining","title":"NIST Dictionary of Algorithms and Data Structures: separateChaining","url":"https://xlinux.nist.gov/dads/HTML/separateChaining.html"}],"status":"reported","summary":"NIST DADS defines separate chaining as: A scheme in which each position in the hash table has a list to handle collisions . Each position may be just a link to the list ( direct chaining ) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list. Also known as external chaining.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.separatnthrm","kind":"concept","label":"separation theorem","sources":[{"id":"nist-dads.separatnthrm","title":"NIST Dictionary of Algorithms and Data Structures: separatnthrm","url":"https://xlinux.nist.gov/dads/HTML/separatnthrm.html"}],"status":"reported","summary":"NIST DADS defines separation theorem as: A theorem showing that two complexity classes are distinct. Most separation theorems have been proved by diagonalization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.setpacking","kind":"concept","label":"set packing","sources":[{"id":"nist-dads.setpacking","title":"NIST Dictionary of Algorithms and Data Structures: setpacking","url":"https://xlinux.nist.gov/dads/HTML/setpacking.html"}],"status":"reported","summary":"NIST DADS defines set packing as: An optimization problem to find the largest number of mutually disjoint subsets that cover a given set of sets .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shadowheap","kind":"concept","label":"shadow heap","sources":[{"id":"nist-dads.shadowheap","title":"NIST Dictionary of Algorithms and Data Structures: shadowheap","url":"https://xlinux.nist.gov/dads/HTML/shadowheap.html"}],"status":"reported","summary":"NIST DADS defines shadow heap as: A heap , implemented in an array , adjacent to an unordered table. The shadow is the table nodes and all their (recursive) parents , by array index, in the heap.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shadowmerge","kind":"method","label":"shadow merge","sources":[{"id":"nist-dads.shadowmerge","title":"NIST Dictionary of Algorithms and Data Structures: shadowmerge","url":"https://xlinux.nist.gov/dads/HTML/shadowmerge.html"}],"status":"reported","summary":"NIST DADS defines shadow merge as: An algorithm to merge two heaps by concatenating the smaller heap to the larger, then reordering just the concatenated nodes and their parents to restore the heap property.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shadowmrgins","kind":"method","label":"shadow merge insert","sources":[{"id":"nist-dads.shadowmrgins","title":"NIST Dictionary of Algorithms and Data Structures: shadowmrgins","url":"https://xlinux.nist.gov/dads/HTML/shadowmrgins.html"}],"status":"reported","summary":"NIST DADS defines shadow merge insert as: An algorithm to insert a new node into a shadow heap . The new node is placed in the unordered table. When the table grows beyond some threshold size, table nodes and all their parents are reordered so everything is a heap.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shannonfano","kind":"method","label":"Shannon-Fano coding","sources":[{"id":"nist-dads.shannonfano","title":"NIST Dictionary of Algorithms and Data Structures: shannonFano","url":"https://xlinux.nist.gov/dads/HTML/shannonFano.html"}],"status":"reported","summary":"NIST DADS defines Shannon-Fano coding as: A variable-length coding based on the frequency of occurrence of each character. Divide the characters into two sets with the frequency of each set as close to half as possible, and assign the sets either 0 or 1 coding. Repeatedly divide the sets until each character has a unique coding.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sharedmemory","kind":"concept","label":"shared memory","sources":[{"id":"nist-dads.sharedmemory","title":"NIST Dictionary of Algorithms and Data Structures: sharedmemory","url":"https://xlinux.nist.gov/dads/HTML/sharedmemory.html"}],"status":"reported","summary":"NIST DADS defines shared memory as: All processors have the same global image of (and access to) all of the memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shiftor","kind":"method","label":"Shift-Or","sources":[{"id":"nist-dads.shiftor","title":"NIST Dictionary of Algorithms and Data Structures: shiftOr","url":"https://xlinux.nist.gov/dads/HTML/shiftOr.html"}],"status":"reported","summary":"NIST DADS defines Shift-Or as: A string matching algorithm which keeps an array of bits, R, showing if prefixes of the pattern don't match at the current place. Before searching, mismatch arrays are computed for each character in the alphabet and saved in an array, S. For the next position, with the character c, R = shift(R) or S[c]. If the last bit of R is 0, the pattern matches.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shortestcommonsuperseq","kind":"concept","label":"shortest common supersequence","sources":[{"id":"nist-dads.shortestcommonsuperseq","title":"NIST Dictionary of Algorithms and Data Structures: shortestCommonSuperseq","url":"https://xlinux.nist.gov/dads/HTML/shortestCommonSuperseq.html"}],"status":"reported","summary":"NIST DADS defines shortest common supersequence as: Find the shortest string that contains two or more strings as subsequences .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.shortestcommonsuperstring","kind":"concept","label":"shortest common superstring","sources":[{"id":"nist-dads.shortestcommonsuperstring","title":"NIST Dictionary of Algorithms and Data Structures: shortestCommonSuperstring","url":"https://xlinux.nist.gov/dads/HTML/shortestCommonSuperstring.html"}],"status":"reported","summary":"NIST DADS defines shortest common superstring as: Find the shortest string that contains two or more strings as substrings .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.shufflesort","kind":"method","label":"shuffle sort","sources":[{"id":"nist-dads.shufflesort","title":"NIST Dictionary of Algorithms and Data Structures: shuffleSort","url":"https://xlinux.nist.gov/dads/HTML/shuffleSort.html"}],"status":"reported","summary":"NIST DADS defines shuffle sort as: A distribution sort algorithm that begins by removing the first 1/8 of the n items, sorting them (recursively), and putting them in an array. This creates n/8 buckets to which the remaining 7/8 of the items are distributed. Each bucket is then sorted, and the buckets are concatenated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sibling","kind":"concept","label":"sibling","sources":[{"id":"nist-dads.sibling","title":"NIST Dictionary of Algorithms and Data Structures: sibling","url":"https://xlinux.nist.gov/dads/HTML/sibling.html"}],"status":"reported","summary":"NIST DADS defines sibling as: A node in a tree that has the same parent as another node is its sibling.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sieve","kind":"method","label":"sieve of Eratosthenes","sources":[{"id":"nist-dads.sieve","title":"NIST Dictionary of Algorithms and Data Structures: sieve","url":"https://xlinux.nist.gov/dads/HTML/sieve.html"}],"status":"reported","summary":"NIST DADS defines sieve of Eratosthenes as: An algorithm to find all prime numbers up to a certain N. Begin with an (unmarked) array of integers from 2 to N. The first unmarked integer, 2, is the first prime. Mark every multiple of this prime. Repeatedly take the next unmarked integer as the next prime and mark every multiple of the prime.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.siftup","kind":"method","label":"sift up","sources":[{"id":"nist-dads.siftup","title":"NIST Dictionary of Algorithms and Data Structures: siftup","url":"https://xlinux.nist.gov/dads/HTML/siftup.html"}],"status":"reported","summary":"NIST DADS defines sift up as: Restoring the heap property by swapping a node with its parent , and repeating the process on the parent until the root is reached or the heap property is satisfied.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.signature","kind":"concept","label":"signature","sources":[{"id":"nist-dads.signature","title":"NIST Dictionary of Algorithms and Data Structures: signature","url":"https://xlinux.nist.gov/dads/HTML/signature.html"}],"status":"reported","summary":"NIST DADS defines signature as: The types or domains , and order, in some representations, of inputs to and outputs from a function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sim","kind":"concept","label":"∼","sources":[{"id":"nist-dads.sim","title":"NIST Dictionary of Algorithms and Data Structures: sim","url":"https://xlinux.nist.gov/dads/HTML/sim.html"}],"status":"reported","summary":"NIST DADS defines ∼ as: (1) Proportional to. (2) Asymptotically equal to. A theoretical measure of the execution of an algorithm , usually the time or memory needed, given the problem size n, which is usually the number of items. Informally, saying some equation f(n) ∼ g(n) means it grows at the same rate as g(n). More formally, it means lim x → ∞ f(x)/g(x) = 1.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simpleuniformhashing","kind":"concept","label":"simple uniform hashing","sources":[{"id":"nist-dads.simpleuniformhashing","title":"NIST Dictionary of Algorithms and Data Structures: simpleUniformHashing","url":"https://xlinux.nist.gov/dads/HTML/simpleUniformHashing.html"}],"status":"reported","summary":"NIST DADS defines simple uniform hashing as: The assumption or goal that items are equally likely to hash to any value.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.simplemerge","kind":"method","label":"simple merge","sources":[{"id":"nist-dads.simplemerge","title":"NIST Dictionary of Algorithms and Data Structures: simplemerge","url":"https://xlinux.nist.gov/dads/HTML/simplemerge.html"}],"status":"reported","summary":"NIST DADS defines simple merge as: Merge n sorted streams into one output stream. All the stream heads are compared, and the head with the least key is removed and written to the output. This is repeated until all streams are empty.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simplepath","kind":"concept","label":"simple path","sources":[{"id":"nist-dads.simplepath","title":"NIST Dictionary of Algorithms and Data Structures: simplepath","url":"https://xlinux.nist.gov/dads/HTML/simplepath.html"}],"status":"reported","summary":"NIST DADS defines simple path as: A path that repeats no vertex , except that the first and last may be the same vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simplex","kind":"concept","label":"simplex","sources":[{"id":"nist-dads.simplex","title":"NIST Dictionary of Algorithms and Data Structures: simplex","url":"https://xlinux.nist.gov/dads/HTML/simplex.html"}],"status":"reported","summary":"NIST DADS defines simplex as: The simplest N-dimensional polytope . The generalization of a triangle (2D) or tetrahedron (3D).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.simulatedannealing","kind":"method","label":"simulated annealing","sources":[{"id":"nist-dads.simulatedannealing","title":"NIST Dictionary of Algorithms and Data Structures: simulatedAnnealing","url":"https://xlinux.nist.gov/dads/HTML/simulatedAnnealing.html"}],"status":"reported","summary":"NIST DADS defines simulated annealing as: A technique to find a good solution to an optimization problem by trying random variations of the current solution. A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds. The slower the cooling schedule , or rate of decrease, the more likely the algorithm is to find an optimal or near- optimal solution .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.simulatnthrm","kind":"concept","label":"simulation theorem","sources":[{"id":"nist-dads.simulatnthrm","title":"NIST Dictionary of Algorithms and Data Structures: simulatnthrm","url":"https://xlinux.nist.gov/dads/HTML/simulatnthrm.html"}],"status":"reported","summary":"NIST DADS defines simulation theorem as: One kind of computation can be simulated by another kind within stated complexity bounds. Most known containment or equality relationships between complexity classes were proved this way.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singledestshortestpath","kind":"concept","label":"single-destination shortest-path problem","sources":[{"id":"nist-dads.singledestshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: singleDestShortestPath","url":"https://xlinux.nist.gov/dads/HTML/singleDestShortestPath.html"}],"status":"reported","summary":"NIST DADS defines single-destination shortest-path problem as: Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singlesourceshortestpath","kind":"concept","label":"single-source shortest-path problem","sources":[{"id":"nist-dads.singlesourceshortestpath","title":"NIST Dictionary of Algorithms and Data Structures: singleSourceShortestPath","url":"https://xlinux.nist.gov/dads/HTML/singleSourceShortestPath.html"}],"status":"reported","summary":"NIST DADS defines single-source shortest-path problem as: Find the shortest paths from a specific source vertex to every other vertex in a weighted, directed graph . Dijkstra's algorithm solves this if all weights are nonnegative. The Bellman-Ford algorithm handles any weights.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singleprogrm","kind":"concept","label":"single program multiple data","sources":[{"id":"nist-dads.singleprogrm","title":"NIST Dictionary of Algorithms and Data Structures: singleprogrm","url":"https://xlinux.nist.gov/dads/HTML/singleprogrm.html"}],"status":"reported","summary":"NIST DADS defines single program multiple data as: The dominant style of parallel programming, where all processors use the same program, though each has its own data. Also known as SPMD.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.singularity","kind":"concept","label":"singularity analysis","sources":[{"id":"nist-dads.singularity","title":"NIST Dictionary of Algorithms and Data Structures: singularity","url":"https://xlinux.nist.gov/dads/HTML/singularity.html"}],"status":"reported","summary":"NIST DADS defines singularity analysis as: A complex asymptotic technique for determining the asymptotics of certain algebraic functions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sink","kind":"concept","label":"sink","sources":[{"id":"nist-dads.sink","title":"NIST Dictionary of Algorithms and Data Structures: sink","url":"https://xlinux.nist.gov/dads/HTML/sink.html"}],"status":"reported","summary":"NIST DADS defines sink as: A vertex of a directed graph with no outgoing edges . More formally, a vertex with with out-degree 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skdtree","kind":"concept","label":"skd-tree","sources":[{"id":"nist-dads.skdtree","title":"NIST Dictionary of Algorithms and Data Structures: skdtree","url":"https://xlinux.nist.gov/dads/HTML/skdtree.html"}],"status":"reported","summary":"NIST DADS defines skd-tree as: The spatial k-d tree is a spatial access method where successive levels are split along different dimensions. Objects are indexed by their centroid , and the minimum bounding box of objects in a node are stored in the node.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skewsymmetry","kind":"concept","label":"skew symmetry","sources":[{"id":"nist-dads.skewsymmetry","title":"NIST Dictionary of Algorithms and Data Structures: skewsymmetry","url":"https://xlinux.nist.gov/dads/HTML/skewsymmetry.html"}],"status":"reported","summary":"NIST DADS defines skew symmetry as: The property that the flow is the same amount, but reversed direction, starting from either vertex of every edge of a flow network . More formally, for an edge e=(v,w), f(v,w) = -f(w,v), where f(a,b) is the flow from a to b.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.skiplist","kind":"concept","label":"skip list","sources":[{"id":"nist-dads.skiplist","title":"NIST Dictionary of Algorithms and Data Structures: skiplist","url":"https://xlinux.nist.gov/dads/HTML/skiplist.html"}],"status":"reported","summary":"NIST DADS defines skip list as: A randomized variant of an ordered linked list with additional, parallel lists. Parallel lists at higher levels skip geometrically more items. Searching begins at the highest level, to quickly get to the right part of the list, then uses progressively lower level lists. A new item is added by randomly selecting a level, then inserting it in order in the lists for that and all lower levels. With enough levels, searching is O(log n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smithalgorithm","kind":"method","label":"Smith algorithm","sources":[{"id":"nist-dads.smithalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: smithAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/smithAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Smith algorithm as: A string matching algorithm which computes the shift value for both the rightmost character of the window and the character preceding it, then uses the maximum of the two values.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smithwaterman","kind":"method","label":"Smith-Waterman algorithm","sources":[{"id":"nist-dads.smithwaterman","title":"NIST Dictionary of Algorithms and Data Structures: smithWaterman","url":"https://xlinux.nist.gov/dads/HTML/smithWaterman.html"}],"status":"reported","summary":"NIST DADS defines Smith-Waterman algorithm as: A means of searching protein databases to find those with the best alignment.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.smoothsort","kind":"method","label":"smoothsort","sources":[{"id":"nist-dads.smoothsort","title":"NIST Dictionary of Algorithms and Data Structures: smoothsort","url":"https://xlinux.nist.gov/dads/HTML/smoothsort.html"}],"status":"reported","summary":"NIST DADS defines smoothsort as: A variant of heapsort that takes advantage of a partially ordered table. Performance is O(n) when input is sorted and O(n log n) performance for worst case .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.solvable","kind":"concept","label":"solvable","sources":[{"id":"nist-dads.solvable","title":"NIST Dictionary of Algorithms and Data Structures: solvable","url":"https://xlinux.nist.gov/dads/HTML/solvable.html"}],"status":"reported","summary":"NIST DADS defines solvable as: A computational problem that can be solved by a Turing machine . The problem may have a nonbinary output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sortedarray","kind":"concept","label":"sorted array","sources":[{"id":"nist-dads.sortedarray","title":"NIST Dictionary of Algorithms and Data Structures: sortedarray","url":"https://xlinux.nist.gov/dads/HTML/sortedarray.html"}],"status":"reported","summary":"NIST DADS defines sorted array as: An array whose items are kept sorted, often so searching is faster.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sortedlist","kind":"concept","label":"sorted list","sources":[{"id":"nist-dads.sortedlist","title":"NIST Dictionary of Algorithms and Data Structures: sortedlist","url":"https://xlinux.nist.gov/dads/HTML/sortedlist.html"}],"status":"reported","summary":"NIST DADS defines sorted list as: A list whose items are kept sorted.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.soundex","kind":"method","label":"soundex","sources":[{"id":"nist-dads.soundex","title":"NIST Dictionary of Algorithms and Data Structures: soundex","url":"https://xlinux.nist.gov/dads/HTML/soundex.html"}],"status":"reported","summary":"NIST DADS defines soundex as: An algorithm to code surnames phonetically by reducing them to the first letter and up to three digits, where each digit is one of six consonant sounds. This reduces matching problems from different spellings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.source","kind":"concept","label":"source","sources":[{"id":"nist-dads.source","title":"NIST Dictionary of Algorithms and Data Structures: source","url":"https://xlinux.nist.gov/dads/HTML/source.html"}],"status":"reported","summary":"NIST DADS defines source as: (1) A vertex of a directed graph with no incoming edges . More formally, a vertex with in-degree 0. (2) The vertex from which an edge of a directed graph leaves.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.space","kind":"concept","label":"space-constructible function","sources":[{"id":"nist-dads.space","title":"NIST Dictionary of Algorithms and Data Structures: space","url":"https://xlinux.nist.gov/dads/HTML/space.html"}],"status":"reported","summary":"NIST DADS defines space-constructible function as: A function s(n) that gives the actual space used by some Turing machine on all inputs of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.spaceorderingmethod","kind":"method","label":"space ordering method","sources":[{"id":"nist-dads.spaceorderingmethod","title":"NIST Dictionary of Algorithms and Data Structures: spaceOrderingMethod","url":"https://xlinux.nist.gov/dads/HTML/spaceOrderingMethod.html"}],"status":"reported","summary":"NIST DADS defines space ordering method as: A mapping from a discrete k-dimensional space into a linear order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.spanningtree","kind":"concept","label":"spanning tree","sources":[{"id":"nist-dads.spanningtree","title":"NIST Dictionary of Algorithms and Data Structures: spanningtree","url":"https://xlinux.nist.gov/dads/HTML/spanningtree.html"}],"status":"reported","summary":"NIST DADS defines spanning tree as: A connected , acyclic subgraph containing all the vertices of a graph .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsegraph","kind":"concept","label":"sparse graph","sources":[{"id":"nist-dads.sparsegraph","title":"NIST Dictionary of Algorithms and Data Structures: sparsegraph","url":"https://xlinux.nist.gov/dads/HTML/sparsegraph.html"}],"status":"reported","summary":"NIST DADS defines sparse graph as: A graph in which the number of edges is much less than the possible number of edges.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsematrix","kind":"concept","label":"sparse matrix","sources":[{"id":"nist-dads.sparsematrix","title":"NIST Dictionary of Algorithms and Data Structures: sparsematrix","url":"https://xlinux.nist.gov/dads/HTML/sparsematrix.html"}],"status":"reported","summary":"NIST DADS defines sparse matrix as: A matrix that has relatively few non-zero (or \"interesting\") entries. It may be represented in much less than n × m space.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.sparsificatn","kind":"method","label":"sparsification","sources":[{"id":"nist-dads.sparsificatn","title":"NIST Dictionary of Algorithms and Data Structures: sparsificatn","url":"https://xlinux.nist.gov/dads/HTML/sparsificatn.html"}],"status":"reported","summary":"NIST DADS defines sparsification as: Technique for designing dynamic graph algorithms , which when applicable transform a time bound of T(n,m) onto O(T(n,n)), where m is the number of edges and n is the number of vertices of the given graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sparsity","kind":"concept","label":"sparsity","sources":[{"id":"nist-dads.sparsity","title":"NIST Dictionary of Algorithms and Data Structures: sparsity","url":"https://xlinux.nist.gov/dads/HTML/sparsity.html"}],"status":"reported","summary":"NIST DADS defines sparsity as: Instances of the longest common subsequence problem in which the number of matches is small compared to the product of the lengths of the input strings.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.spatialaccessmethod","kind":"concept","label":"spatial access method","sources":[{"id":"nist-dads.spatialaccessmethod","title":"NIST Dictionary of Algorithms and Data Structures: spatialAccessMethod","url":"https://xlinux.nist.gov/dads/HTML/spatialAccessMethod.html"}],"status":"reported","summary":"NIST DADS defines spatial access method as: A data structure to search for lines, polygons, etc. Also known as SAM.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.squarematrix","kind":"concept","label":"square matrix","sources":[{"id":"nist-dads.squarematrix","title":"NIST Dictionary of Algorithms and Data Structures: squarematrix","url":"https://xlinux.nist.gov/dads/HTML/squarematrix.html"}],"status":"reported","summary":"NIST DADS defines square matrix as: A n × n matrix , i.e., one whose size is the same in both dimensions.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stable","kind":"concept","label":"stable","sources":[{"id":"nist-dads.stable","title":"NIST Dictionary of Algorithms and Data Structures: stable","url":"https://xlinux.nist.gov/dads/HTML/stable.html"}],"status":"reported","summary":"NIST DADS defines stable as: An algorithm where the relative order upon input of items with equal keys is always preserved in the output. Usually a sort algorithm.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stacktree","kind":"concept","label":"stack tree","sources":[{"id":"nist-dads.stacktree","title":"NIST Dictionary of Algorithms and Data Structures: stacktree","url":"https://xlinux.nist.gov/dads/HTML/stacktree.html"}],"status":"reported","summary":"NIST DADS defines stack tree as: A binary tree where no node , except the root , has more than one non- leaf child .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.starencoding","kind":"method","label":"star encoding","sources":[{"id":"nist-dads.starencoding","title":"NIST Dictionary of Algorithms and Data Structures: starEncoding","url":"https://xlinux.nist.gov/dads/HTML/starEncoding.html"}],"status":"reported","summary":"NIST DADS defines star encoding as: Using a fixed dictionary , encode words in text with strings having many repeated characters, typically an asterisk or \"star\" (*).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.starshaped","kind":"concept","label":"star-shaped polygon","sources":[{"id":"nist-dads.starshaped","title":"NIST Dictionary of Algorithms and Data Structures: starshaped","url":"https://xlinux.nist.gov/dads/HTML/starshaped.html"}],"status":"reported","summary":"NIST DADS defines star-shaped polygon as: A polygon P in which there exists an interior point p such that all the boundary points of P are visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.startstate","kind":"concept","label":"start state","sources":[{"id":"nist-dads.startstate","title":"NIST Dictionary of Algorithms and Data Structures: startstate","url":"https://xlinux.nist.gov/dads/HTML/startstate.html"}],"status":"reported","summary":"NIST DADS defines start state as: An initial state or condition of a finite state machine or Turing machine . Informally, how the memory is initially set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.state","kind":"concept","label":"state","sources":[{"id":"nist-dads.state","title":"NIST Dictionary of Algorithms and Data Structures: state","url":"https://xlinux.nist.gov/dads/HTML/state.html"}],"status":"reported","summary":"NIST DADS defines state as: The condition of a finite state machine or Turing machine at a certain time. Informally, the content of memory.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.statemachine","kind":"concept","label":"state machine","sources":[{"id":"nist-dads.statemachine","title":"NIST Dictionary of Algorithms and Data Structures: statemachine","url":"https://xlinux.nist.gov/dads/HTML/statemachine.html"}],"status":"reported","summary":"NIST DADS defines state machine as: A model of computation consisting of a (possibly infinite) set of states , a set of start states , an input alphabet , and a transition function which maps input symbols and current states to a next state . Usually understood to be a finite state machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.static","kind":"concept","label":"static","sources":[{"id":"nist-dads.static","title":"NIST Dictionary of Algorithms and Data Structures: static","url":"https://xlinux.nist.gov/dads/HTML/static.html"}],"status":"reported","summary":"NIST DADS defines static as: When the problem domain does not change.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stcut","kind":"concept","label":"s-t cut","sources":[{"id":"nist-dads.stcut","title":"NIST Dictionary of Algorithms and Data Structures: stcut","url":"https://xlinux.nist.gov/dads/HTML/stcut.html"}],"status":"reported","summary":"NIST DADS defines s-t cut as: A partitioning of the vertices of a flow network into S and T such that the source is in S and the sink is in T.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stdigraph","kind":"concept","label":"st-digraph","sources":[{"id":"nist-dads.stdigraph","title":"NIST Dictionary of Algorithms and Data Structures: stdigraph","url":"https://xlinux.nist.gov/dads/HTML/stdigraph.html"}],"status":"reported","summary":"NIST DADS defines st-digraph as: A directed acyclic graph with two specially marked nodes, the source s and the sink t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinerpoint","kind":"concept","label":"Steiner point","sources":[{"id":"nist-dads.steinerpoint","title":"NIST Dictionary of Algorithms and Data Structures: steinerpoint","url":"https://xlinux.nist.gov/dads/HTML/steinerpoint.html"}],"status":"reported","summary":"NIST DADS defines Steiner point as: (1) A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree . (2) A point with a particular geometric relation to a triangle.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinerratio","kind":"concept","label":"Steiner ratio","sources":[{"id":"nist-dads.steinerratio","title":"NIST Dictionary of Algorithms and Data Structures: steinerratio","url":"https://xlinux.nist.gov/dads/HTML/steinerratio.html"}],"status":"reported","summary":"NIST DADS defines Steiner ratio as: For a given variant of the Steiner tree problem, the maximum possible ratio of the length of a minimum spanning tree of a set of terminals to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinertree","kind":"concept","label":"Steiner tree","sources":[{"id":"nist-dads.steinertree","title":"NIST Dictionary of Algorithms and Data Structures: steinertree","url":"https://xlinux.nist.gov/dads/HTML/steinertree.html"}],"status":"reported","summary":"NIST DADS defines Steiner tree as: A minimum-weight tree connecting a designated set of vertices , called terminals , in an undirected , weighted graph or points in a space. The tree may include non-terminals, which are called Steiner vertices or Steiner points .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.steinervertx","kind":"concept","label":"Steiner vertex","sources":[{"id":"nist-dads.steinervertx","title":"NIST Dictionary of Algorithms and Data Structures: steinervertx","url":"https://xlinux.nist.gov/dads/HTML/steinervertx.html"}],"status":"reported","summary":"NIST DADS defines Steiner vertex as: A point that is not part of the input set of points, for instance, a point computed to construct a Steiner tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stoogesort","kind":"method","label":"stooge sort","sources":[{"id":"nist-dads.stoogesort","title":"NIST Dictionary of Algorithms and Data Structures: stoogesort","url":"https://xlinux.nist.gov/dads/HTML/stoogesort.html"}],"status":"reported","summary":"NIST DADS defines stooge sort as: A terribly inefficient sort algorithm that swaps the top and bottom items if needed, then ( recursively ) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.straightline","kind":"concept","label":"straight-line drawing","sources":[{"id":"nist-dads.straightline","title":"NIST Dictionary of Algorithms and Data Structures: straightline","url":"https://xlinux.nist.gov/dads/HTML/straightline.html"}],"status":"reported","summary":"NIST DADS defines straight-line drawing as: A graph drawing in which each edge is represented by a straight line segment.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.strandsort","kind":"method","label":"strand sort","sources":[{"id":"nist-dads.strandsort","title":"NIST Dictionary of Algorithms and Data Structures: strandSort","url":"https://xlinux.nist.gov/dads/HTML/strandSort.html"}],"status":"reported","summary":"NIST DADS defines strand sort as: A sort algorithm that works well if many items are in order. First, begin a sublist by moving the first item from the original list to the sublist. For each subsequent item in the original list, if it is greater than the last item of the sublist, remove it from the original list and append it to the sublist. Merge the sublist into a final, sorted list. Repeatedly extract and merge sublists until all items are sorted. Handle two or fewer items as special cases.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlydecreasing","kind":"concept","label":"strictly decreasing","sources":[{"id":"nist-dads.strictlydecreasing","title":"NIST Dictionary of Algorithms and Data Structures: strictlyDecreasing","url":"https://xlinux.nist.gov/dads/HTML/strictlyDecreasing.html"}],"status":"reported","summary":"NIST DADS defines strictly decreasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) > f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlyincreasing","kind":"concept","label":"strictly increasing","sources":[{"id":"nist-dads.strictlyincreasing","title":"NIST Dictionary of Algorithms and Data Structures: strictlyIncreasing","url":"https://xlinux.nist.gov/dads/HTML/strictlyIncreasing.html"}],"status":"reported","summary":"NIST DADS defines strictly increasing as: A function from a partially ordered domain to a partially ordered range such that x < y implies f(x) < f(y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlylowertriangmat","kind":"concept","label":"strictly lower triangular matrix","sources":[{"id":"nist-dads.strictlylowertriangmat","title":"NIST Dictionary of Algorithms and Data Structures: strictlyLowerTriangMat","url":"https://xlinux.nist.gov/dads/HTML/strictlyLowerTriangMat.html"}],"status":"reported","summary":"NIST DADS defines strictly lower triangular matrix as: A matrix that is only defined at (i,j) when i > j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strictlyuppertriangmat","kind":"concept","label":"strictly upper triangular matrix","sources":[{"id":"nist-dads.strictlyuppertriangmat","title":"NIST Dictionary of Algorithms and Data Structures: strictlyUpperTriangMat","url":"https://xlinux.nist.gov/dads/HTML/strictlyUpperTriangMat.html"}],"status":"reported","summary":"NIST DADS defines strictly upper triangular matrix as: A matrix that is only defined at (i,j) when i < j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.string","kind":"concept","label":"string","sources":[{"id":"nist-dads.string","title":"NIST Dictionary of Algorithms and Data Structures: string","url":"https://xlinux.nist.gov/dads/HTML/string.html"}],"status":"reported","summary":"NIST DADS defines string as: A list of characters, usually implemented as an array . Informally a word, phrase, sentence, etc. Since text processing is so common, a special type with substring operations is often available.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stringmatchwerror","kind":"method","label":"string matching with errors","sources":[{"id":"nist-dads.stringmatchwerror","title":"NIST Dictionary of Algorithms and Data Structures: stringMatchwError","url":"https://xlinux.nist.gov/dads/HTML/stringMatchwError.html"}],"status":"reported","summary":"NIST DADS defines string matching with errors as: Searching for approximate (e.g., up to a predefined number of symbol mismatches, insertions, and deletions) occurrences of a pattern string in a text string. Preprocessing, e.g., building an index, may or may not be allowed. Also known as approximate string matching.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stringmatchwmismatch","kind":"method","label":"string matching with mismatches","sources":[{"id":"nist-dads.stringmatchwmismatch","title":"NIST Dictionary of Algorithms and Data Structures: stringMatchwMismatch","url":"https://xlinux.nist.gov/dads/HTML/stringMatchwMismatch.html"}],"status":"reported","summary":"NIST DADS defines string matching with mismatches as: The special case of string matching with errors where mismatches are the only type of error allowed.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stringedit","kind":"concept","label":"string editing problem","sources":[{"id":"nist-dads.stringedit","title":"NIST Dictionary of Algorithms and Data Structures: stringedit","url":"https://xlinux.nist.gov/dads/HTML/stringedit.html"}],"status":"reported","summary":"NIST DADS defines string editing problem as: The problem of finding an edit script of minimum cost which transforms a given string into another given string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.strippacking","kind":"concept","label":"strip packing","sources":[{"id":"nist-dads.strippacking","title":"NIST Dictionary of Algorithms and Data Structures: strippacking","url":"https://xlinux.nist.gov/dads/HTML/strippacking.html"}],"status":"reported","summary":"NIST DADS defines strip packing as: Pack a set of rectangles into a strip of width 1 to minimize the height used. Rectangles may not overlap or be rotated. Without loss of generality, the height of rectangles is at most 1. This is NP-hard .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglyconnectedcompo","kind":"concept","label":"strongly connected component","sources":[{"id":"nist-dads.stronglyconnectedcompo","title":"NIST Dictionary of Algorithms and Data Structures: stronglyConnectedCompo","url":"https://xlinux.nist.gov/dads/HTML/stronglyConnectedCompo.html"}],"status":"reported","summary":"NIST DADS defines strongly connected component as: A strongly connected subgraph , S, of a directed graph , D, such that no vertex of D can be added to S and it still be strongly connected. Informally, a maximal subgraph in which every vertex is reachable from every other vertex.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglyconnectedgraph","kind":"concept","label":"strongly connected graph","sources":[{"id":"nist-dads.stronglyconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: stronglyConnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/stronglyConnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines strongly connected graph as: A directed graph that has a path from each vertex to every other vertex. Formal Definition: A directed graph D=(V, E) such that for all pairs of vertices u, v ∈ V, there is a path from u to v and from v to u.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.stronglynp","kind":"concept","label":"strongly NP-hard","sources":[{"id":"nist-dads.stronglynp","title":"NIST Dictionary of Algorithms and Data Structures: stronglyNP","url":"https://xlinux.nist.gov/dads/HTML/stronglyNP.html"}],"status":"reported","summary":"NIST DADS defines strongly NP-hard as: The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.strsrch","kind":"method","label":"strsrch","sources":[{"id":"nist-dads.strsrch","title":"NIST Dictionary of Algorithms and Data Structures: strsrch","url":"https://xlinux.nist.gov/dads/HTML/strsrch.html"}],"status":"reported","summary":"NIST DADS defines strsrch as: Find occurrences of a substring in a target string by trying the substring at each possible location in the string. Execution time is Θ(mn), where m is length of the target string and n is the length of the substring.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.stupidsort","kind":"method","label":"stupid sort","sources":[{"id":"nist-dads.stupidsort","title":"NIST Dictionary of Algorithms and Data Structures: stupidSort","url":"https://xlinux.nist.gov/dads/HTML/stupidSort.html"}],"status":"reported","summary":"NIST DADS defines stupid sort as: (1) The original name of gnome sort . (2) An alternate name for bogosort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subadditive","kind":"concept","label":"subadditive ergodic theorem","sources":[{"id":"nist-dads.subadditive","title":"NIST Dictionary of Algorithms and Data Structures: subadditive","url":"https://xlinux.nist.gov/dads/HTML/subadditive.html"}],"status":"reported","summary":"NIST DADS defines subadditive ergodic theorem as: If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subgraph","kind":"concept","label":"subgraph","sources":[{"id":"nist-dads.subgraph","title":"NIST Dictionary of Algorithms and Data Structures: subgraph","url":"https://xlinux.nist.gov/dads/HTML/subgraph.html"}],"status":"reported","summary":"NIST DADS defines subgraph as: A graph whose vertices and edges are subsets of another graph . Formal Definition: A graph G'=(V', E') is a subgraph of another graph G=(V, E) iff V'⊆ V, and E'⊆ E ∧ ( (v 1 , v 2 )∈ E' → v 1 , v 2 ∈ V').","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subgraphiso","kind":"concept","label":"subgraph isomorphism","sources":[{"id":"nist-dads.subgraphiso","title":"NIST Dictionary of Algorithms and Data Structures: subgraphiso","url":"https://xlinux.nist.gov/dads/HTML/subgraphiso.html"}],"status":"reported","summary":"NIST DADS defines subgraph isomorphism as: Decide if there is a subgraph of one graph which is isomorphic to another graph.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.sublineartimealgo","kind":"concept","label":"sublinear time algorithm","sources":[{"id":"nist-dads.sublineartimealgo","title":"NIST Dictionary of Algorithms and Data Structures: sublinearTimeAlgo","url":"https://xlinux.nist.gov/dads/HTML/sublinearTimeAlgo.html"}],"status":"reported","summary":"NIST DADS defines sublinear time algorithm as: A algorithm whose execution time, f(n), grows slower than the size of the problem, n, but only gives an approximate or probably correct answer.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subsequence","kind":"concept","label":"subsequence","sources":[{"id":"nist-dads.subsequence","title":"NIST Dictionary of Algorithms and Data Structures: subsequence","url":"https://xlinux.nist.gov/dads/HTML/subsequence.html"}],"status":"reported","summary":"NIST DADS defines subsequence as: Any string that can be obtained by deleting zero or more symbols from a given string.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subset","kind":"concept","label":"subset","sources":[{"id":"nist-dads.subset","title":"NIST Dictionary of Algorithms and Data Structures: subset","url":"https://xlinux.nist.gov/dads/HTML/subset.html"}],"status":"reported","summary":"NIST DADS defines subset as: A set S 1 is a subset of another set S 2 if every element in S 1 is in S 2 . S 2 may have exactly the same elements as S 1 . Formal Definition: S 1 ⊆ S 2 iff ∀ s, s ∈ S 1 → s ∈ S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.substring","kind":"concept","label":"substring","sources":[{"id":"nist-dads.substring","title":"NIST Dictionary of Algorithms and Data Structures: substring","url":"https://xlinux.nist.gov/dads/HTML/substring.html"}],"status":"reported","summary":"NIST DADS defines substring as: A string v is a substring of a string u if u=u′ vu″ for some prefix u′ and suffix u″. Also known as factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.subtree","kind":"concept","label":"subtree","sources":[{"id":"nist-dads.subtree","title":"NIST Dictionary of Algorithms and Data Structures: subtree","url":"https://xlinux.nist.gov/dads/HTML/subtree.html"}],"status":"reported","summary":"NIST DADS defines subtree as: The tree which is a child of a node .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffix","kind":"concept","label":"suffix","sources":[{"id":"nist-dads.suffix","title":"NIST Dictionary of Algorithms and Data Structures: suffix","url":"https://xlinux.nist.gov/dads/HTML/suffix.html"}],"status":"reported","summary":"NIST DADS defines suffix as: The end characters of a string . More formally a string v is a suffix of a string u if u=u'v for some string u'.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.suffixautmtn","kind":"concept","label":"suffix automaton","sources":[{"id":"nist-dads.suffixautmtn","title":"NIST Dictionary of Algorithms and Data Structures: suffixautmtn","url":"https://xlinux.nist.gov/dads/HTML/suffixautmtn.html"}],"status":"reported","summary":"NIST DADS defines suffix automaton as: The smallest automaton accepting all suffixes of a string . The states form a directed acyclic word graph or DAWG.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.superimposedcode","kind":"concept","label":"superimposed code","sources":[{"id":"nist-dads.superimposedcode","title":"NIST Dictionary of Algorithms and Data Structures: superimposedCode","url":"https://xlinux.nist.gov/dads/HTML/superimposedCode.html"}],"status":"reported","summary":"NIST DADS defines superimposed code as: A set of bit vectors such that no vector is a subset of a bitwise or of a small number of others.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.superset","kind":"concept","label":"superset","sources":[{"id":"nist-dads.superset","title":"NIST Dictionary of Algorithms and Data Structures: superset","url":"https://xlinux.nist.gov/dads/HTML/superset.html"}],"status":"reported","summary":"NIST DADS defines superset as: A set S 1 is a superset of another set S 2 if every element in S 2 is in S 1 . S 1 may have elements which are not in S 2 .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.supersink","kind":"concept","label":"supersink","sources":[{"id":"nist-dads.supersink","title":"NIST Dictionary of Algorithms and Data Structures: supersink","url":"https://xlinux.nist.gov/dads/HTML/supersink.html"}],"status":"reported","summary":"NIST DADS defines supersink as: A vertex of a directed graph which is reachable from all other vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.supersource","kind":"concept","label":"supersource","sources":[{"id":"nist-dads.supersource","title":"NIST Dictionary of Algorithms and Data Structures: supersource","url":"https://xlinux.nist.gov/dads/HTML/supersource.html"}],"status":"reported","summary":"NIST DADS defines supersource as: A vertex of a directed graph from which all other vertices are reachable .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.symmetric","kind":"concept","label":"symmetric","sources":[{"id":"nist-dads.symmetric","title":"NIST Dictionary of Algorithms and Data Structures: symmetric","url":"https://xlinux.nist.gov/dads/HTML/symmetric.html"}],"status":"reported","summary":"NIST DADS defines symmetric as: A binary relation R for which a R b implies b R a.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.symmetricsetdiff","kind":"concept","label":"symmetric set difference","sources":[{"id":"nist-dads.symmetricsetdiff","title":"NIST Dictionary of Algorithms and Data Structures: symmetricSetDiff","url":"https://xlinux.nist.gov/dads/HTML/symmetricSetDiff.html"}],"status":"reported","summary":"NIST DADS defines symmetric set difference as: Members which are in either set , but not in both. That is, for sets A and B, it is (A - B) ∪ (B - A).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.symmetrybrek","kind":"method","label":"symmetry breaking","sources":[{"id":"nist-dads.symmetrybrek","title":"NIST Dictionary of Algorithms and Data Structures: symmetrybrek","url":"https://xlinux.nist.gov/dads/HTML/symmetrybrek.html"}],"status":"reported","summary":"NIST DADS defines symmetry breaking as: To differentiate parts of a structure, such as a graph , which locally look the same to all vertices . Usually implemented with randomization .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tail","kind":"concept","label":"tail","sources":[{"id":"nist-dads.tail","title":"NIST Dictionary of Algorithms and Data Structures: tail","url":"https://xlinux.nist.gov/dads/HTML/tail.html"}],"status":"reported","summary":"NIST DADS defines tail as: (1) The last item of a list . (2) All but the first item of a list; the list following the head.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tailrecursion","kind":"method","label":"tail recursion","sources":[{"id":"nist-dads.tailrecursion","title":"NIST Dictionary of Algorithms and Data Structures: tailRecursion","url":"https://xlinux.nist.gov/dads/HTML/tailRecursion.html"}],"status":"reported","summary":"NIST DADS defines tail recursion as: A special form of recursion where the last operation of a function is a recursive call. The recursion may be optimized away by executing the call in the current stack frame and returning its result rather than creating a new stack frame.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.target","kind":"concept","label":"target","sources":[{"id":"nist-dads.target","title":"NIST Dictionary of Algorithms and Data Structures: target","url":"https://xlinux.nist.gov/dads/HTML/target.html"}],"status":"reported","summary":"NIST DADS defines target as: The vertex which an edge of a directed graph enters.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.temporllogic","kind":"concept","label":"temporal logic","sources":[{"id":"nist-dads.temporllogic","title":"NIST Dictionary of Algorithms and Data Structures: temporllogic","url":"https://xlinux.nist.gov/dads/HTML/temporllogic.html"}],"status":"reported","summary":"NIST DADS defines temporal logic as: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.terminal","kind":"concept","label":"terminal","sources":[{"id":"nist-dads.terminal","title":"NIST Dictionary of Algorithms and Data Structures: terminal","url":"https://xlinux.nist.gov/dads/HTML/terminal.html"}],"status":"reported","summary":"NIST DADS defines terminal as: The set of points in a plane or vertices in a graph defining endpoints of a Steiner tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ternarysearchtree","kind":"concept","label":"ternary search tree","sources":[{"id":"nist-dads.ternarysearchtree","title":"NIST Dictionary of Algorithms and Data Structures: ternarySearchTree","url":"https://xlinux.nist.gov/dads/HTML/ternarySearchTree.html"}],"status":"reported","summary":"NIST DADS defines ternary search tree as: A 3-way tree where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key. If the key is a multikey ( string , array, list, etc.), the middle subtree organizes by the next subkey (character, array or list item, etc.) Also known as TST.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.text","kind":"concept","label":"text","sources":[{"id":"nist-dads.text","title":"NIST Dictionary of Algorithms and Data Structures: text","url":"https://xlinux.nist.gov/dads/HTML/text.html"}],"status":"reported","summary":"NIST DADS defines text as: A list of characters, usually thought of as a list of words separated by spaces.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.threadedtree","kind":"concept","label":"threaded tree","sources":[{"id":"nist-dads.threadedtree","title":"NIST Dictionary of Algorithms and Data Structures: threadedtree","url":"https://xlinux.nist.gov/dads/HTML/threadedtree.html"}],"status":"reported","summary":"NIST DADS defines threaded tree as: A binary search tree in which each node uses an otherwise-empty left child link to refer to the node's in-order predecessor and an empty right child link to refer to its in-order successor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.threedimnsnl","kind":"concept","label":"three-dimensional","sources":[{"id":"nist-dads.threedimnsnl","title":"NIST Dictionary of Algorithms and Data Structures: threedimnsnl","url":"https://xlinux.nist.gov/dads/HTML/threedimnsnl.html"}],"status":"reported","summary":"NIST DADS defines three-dimensional as: Dealing with or restricted to a space in which location can be completely described with exactly three orthogonal axes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.threewaymsrt","kind":"method","label":"three-way merge sort","sources":[{"id":"nist-dads.threewaymsrt","title":"NIST Dictionary of Algorithms and Data Structures: threewaymsrt","url":"https://xlinux.nist.gov/dads/HTML/threewaymsrt.html"}],"status":"reported","summary":"NIST DADS defines three-way merge sort as: A k-way merge sort which uses three input and three output streams.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.time","kind":"concept","label":"time-constructible function","sources":[{"id":"nist-dads.time","title":"NIST Dictionary of Algorithms and Data Structures: time","url":"https://xlinux.nist.gov/dads/HTML/time.html"}],"status":"reported","summary":"NIST DADS defines time-constructible function as: A function t(n) that gives the actual running time of some Turing machine on all inputs of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.timespace","kind":"concept","label":"time/space complexity","sources":[{"id":"nist-dads.timespace","title":"NIST Dictionary of Algorithms and Data Structures: timespace","url":"https://xlinux.nist.gov/dads/HTML/timespace.html"}],"status":"reported","summary":"NIST DADS defines time/space complexity as: The maximum time or space required by a Turing machine on any input of length n.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.topdownradixsort","kind":"method","label":"top-down radix sort","sources":[{"id":"nist-dads.topdownradixsort","title":"NIST Dictionary of Algorithms and Data Structures: topdownRadixSort","url":"https://xlinux.nist.gov/dads/HTML/topdownRadixSort.html"}],"status":"reported","summary":"NIST DADS defines top-down radix sort as: A recursive bucket sort where elements are distributed based on succeeding pieces (characters) of the key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologicalorder","kind":"concept","label":"topological order","sources":[{"id":"nist-dads.topologicalorder","title":"NIST Dictionary of Algorithms and Data Structures: topologicalOrder","url":"https://xlinux.nist.gov/dads/HTML/topologicalOrder.html"}],"status":"reported","summary":"NIST DADS defines topological order as: A numbering of the vertices of a directed acyclic graph such that every edge from a vertex numbered i to a vertex numbered j satisfies i<j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.topologytree","kind":"concept","label":"topology tree","sources":[{"id":"nist-dads.topologytree","title":"NIST Dictionary of Algorithms and Data Structures: topologytree","url":"https://xlinux.nist.gov/dads/HTML/topologytree.html"}],"status":"reported","summary":"NIST DADS defines topology tree as: Tree that describes a balanced decomposition of another tree, according to its topology. More precisely, given a restricted multilevel partition for a tree T, a topology tree satisfies the following: (1) A topology tree node at level l represents a vertex cluster at level l in the restricted multilevel partition, and (2) A node at level l ≥ 1 has at most two children , representing the vertex clusters at level l-1 whose union gives the vertex cluster the node represents.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totalfunc","kind":"concept","label":"total function","sources":[{"id":"nist-dads.totalfunc","title":"NIST Dictionary of Algorithms and Data Structures: totalfunc","url":"https://xlinux.nist.gov/dads/HTML/totalfunc.html"}],"status":"reported","summary":"NIST DADS defines total function as: A function which is defined for all inputs of the right type, that is, for all of a domain .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totallyundecidableprob","kind":"concept","label":"totally undecidable problem","sources":[{"id":"nist-dads.totallyundecidableprob","title":"NIST Dictionary of Algorithms and Data Structures: totallyUndecidableProb","url":"https://xlinux.nist.gov/dads/HTML/totallyUndecidableProb.html"}],"status":"reported","summary":"NIST DADS defines totally undecidable problem as: A problem that cannot be solved by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.totalorder","kind":"concept","label":"total order","sources":[{"id":"nist-dads.totalorder","title":"NIST Dictionary of Algorithms and Data Structures: totalorder","url":"https://xlinux.nist.gov/dads/HTML/totalorder.html"}],"status":"reported","summary":"NIST DADS defines total order as: An order defined for all pairs of items of a set. For instance, ≤ (less than or equal to) is a total order on integers, that is, for any two integers, one of them is less than or equal to the other. Formal Definition: A total order is a relation that is reflexive , transitive , antisymmetric , and total. Also known as linear order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tournament","kind":"method","label":"tournament","sources":[{"id":"nist-dads.tournament","title":"NIST Dictionary of Algorithms and Data Structures: tournament","url":"https://xlinux.nist.gov/dads/HTML/tournament.html"}],"status":"reported","summary":"NIST DADS defines tournament as: Find the maximum of a set of n elements in ⌈log n⌉ \"rounds\" (passes) by \"playing\" (comparing) pairs of elements and advancing the winner (greater) of each pair to the next round. It takes n-1 comparisons, like linear search , but may be parallelized, extended to also find the second greatest element, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.tractable","kind":"concept","label":"tractable","sources":[{"id":"nist-dads.tractable","title":"NIST Dictionary of Algorithms and Data Structures: tractable","url":"https://xlinux.nist.gov/dads/HTML/tractable.html"}],"status":"reported","summary":"NIST DADS defines tractable as: A problem which has an algorithm which computes all instances of it in polynomial time .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transition","kind":"concept","label":"transition","sources":[{"id":"nist-dads.transition","title":"NIST Dictionary of Algorithms and Data Structures: transition","url":"https://xlinux.nist.gov/dads/HTML/transition.html"}],"status":"reported","summary":"NIST DADS defines transition as: The change from one state to another in a finite state machine . Analogously, an edge in a directed graph . Also known as state transition, move.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitionfn","kind":"concept","label":"transition function","sources":[{"id":"nist-dads.transitionfn","title":"NIST Dictionary of Algorithms and Data Structures: transitionfn","url":"https://xlinux.nist.gov/dads/HTML/transitionfn.html"}],"status":"reported","summary":"NIST DADS defines transition function as: A function of the current state and input giving the next state of a finite state machine or Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitive","kind":"concept","label":"transitive","sources":[{"id":"nist-dads.transitive","title":"NIST Dictionary of Algorithms and Data Structures: transitive","url":"https://xlinux.nist.gov/dads/HTML/transitive.html"}],"status":"reported","summary":"NIST DADS defines transitive as: A binary relation R for which a R b and b R c implies a R c.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.transitivereduction","kind":"concept","label":"transitive reduction","sources":[{"id":"nist-dads.transitivereduction","title":"NIST Dictionary of Algorithms and Data Structures: transitiveReduction","url":"https://xlinux.nist.gov/dads/HTML/transitiveReduction.html"}],"status":"reported","summary":"NIST DADS defines transitive reduction as: The transitive reduction of a directed graph G is the directed graph G' with the smallest number of edges such that for every path between vertices in G, G' has a path between those vertices.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.transposeseqsearch","kind":"method","label":"transpose sequential search","sources":[{"id":"nist-dads.transposeseqsearch","title":"NIST Dictionary of Algorithms and Data Structures: transposeSeqSearch","url":"https://xlinux.nist.gov/dads/HTML/transposeSeqSearch.html"}],"status":"reported","summary":"NIST DADS defines transpose sequential search as: Search an array or list by checking items one at a time. If the value is found, swap it with its predecessor so it is found faster next time. Also known as self-organizing sequential search.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.travelingsalesman","kind":"concept","label":"traveling salesman","sources":[{"id":"nist-dads.travelingsalesman","title":"NIST Dictionary of Algorithms and Data Structures: travelingSalesman","url":"https://xlinux.nist.gov/dads/HTML/travelingSalesman.html"}],"status":"reported","summary":"NIST DADS defines traveling salesman as: Find a path through a weighted graph that starts and ends at the same vertex , includes every other vertex exactly once, and minimizes the total cost of edges . Also known as TSP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treap","kind":"concept","label":"treap","sources":[{"id":"nist-dads.treap","title":"NIST Dictionary of Algorithms and Data Structures: treap","url":"https://xlinux.nist.gov/dads/HTML/treap.html"}],"status":"reported","summary":"NIST DADS defines treap as: A binary search tree in which nodes have another key , called the priority. Operations also keep the nodes heap ordered with regard to the priority.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treeautomaton","kind":"concept","label":"tree automaton","sources":[{"id":"nist-dads.treeautomaton","title":"NIST Dictionary of Algorithms and Data Structures: treeAutomaton","url":"https://xlinux.nist.gov/dads/HTML/treeAutomaton.html"}],"status":"reported","summary":"NIST DADS defines tree automaton as: An extension of a finite state machine that operates on n-ary constructors. Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes n states and constructors. Tree automata may be top-down (starting from the root ) or bottom-up (starting from the leaves ), and deterministic or nondeterministic .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treetraversal","kind":"concept","label":"tree traversal","sources":[{"id":"nist-dads.treetraversal","title":"NIST Dictionary of Algorithms and Data Structures: treeTraversal","url":"https://xlinux.nist.gov/dads/HTML/treeTraversal.html"}],"status":"reported","summary":"NIST DADS defines tree traversal as: A technique for processing the nodes of a tree in some order.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treecontrctn","kind":"concept","label":"tree contraction","sources":[{"id":"nist-dads.treecontrctn","title":"NIST Dictionary of Algorithms and Data Structures: treecontrctn","url":"https://xlinux.nist.gov/dads/HTML/treecontrctn.html"}],"status":"reported","summary":"NIST DADS defines tree contraction as: Contracting a tree by removing some of the nodes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.treeedit","kind":"concept","label":"tree editing problem","sources":[{"id":"nist-dads.treeedit","title":"NIST Dictionary of Algorithms and Data Structures: treeedit","url":"https://xlinux.nist.gov/dads/HTML/treeedit.html"}],"status":"reported","summary":"NIST DADS defines tree editing problem as: The problem of finding an edit script of minimum cost which transforms a given tree into another given tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.treesort1","kind":"method","label":"treesort (1)","sources":[{"id":"nist-dads.treesort1","title":"NIST Dictionary of Algorithms and Data Structures: treesort1","url":"https://xlinux.nist.gov/dads/HTML/treesort1.html"}],"status":"reported","summary":"NIST DADS defines treesort (1) as: A sort algorithm that first builds a binary search tree of the keys , then accesses the keys with an in-order traversal .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.treesort2","kind":"method","label":"treesort (2)","sources":[{"id":"nist-dads.treesort2","title":"NIST Dictionary of Algorithms and Data Structures: treesort2","url":"https://xlinux.nist.gov/dads/HTML/treesort2.html"}],"status":"reported","summary":"NIST DADS defines treesort (2) as: Variants of heapsort .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trianglnqlty","kind":"concept","label":"triangle inequality","sources":[{"id":"nist-dads.trianglnqlty","title":"NIST Dictionary of Algorithms and Data Structures: trianglnqlty","url":"https://xlinux.nist.gov/dads/HTML/trianglnqlty.html"}],"status":"reported","summary":"NIST DADS defines triangle inequality as: The property that a complete weighted graph satisfies weight(u,v) ≤ weight(u,w) + weight(w,v) for all vertices u, v, w. Informally, the graph has no short cuts.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.triconnectedgraph","kind":"concept","label":"triconnected graph","sources":[{"id":"nist-dads.triconnectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: triconnectedGraph","url":"https://xlinux.nist.gov/dads/HTML/triconnectedGraph.html"}],"status":"reported","summary":"NIST DADS defines triconnected graph as: A connected graph such that deleting any two vertices (and incident edges ) results in a graph that is still connected.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.trinaryfunc","kind":"concept","label":"trinary function","sources":[{"id":"nist-dads.trinaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: trinaryfunc","url":"https://xlinux.nist.gov/dads/HTML/trinaryfunc.html"}],"status":"reported","summary":"NIST DADS defines trinary function as: A function with three arguments.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.tripartition","kind":"method","label":"tripartition","sources":[{"id":"nist-dads.tripartition","title":"NIST Dictionary of Algorithms and Data Structures: tripartition","url":"https://xlinux.nist.gov/dads/HTML/tripartition.html"}],"status":"reported","summary":"NIST DADS defines tripartition as: To partition array elements into three groups.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.turingredctn","kind":"concept","label":"Turing reduction","sources":[{"id":"nist-dads.turingredctn","title":"NIST Dictionary of Algorithms and Data Structures: turingredctn","url":"https://xlinux.nist.gov/dads/HTML/turingredctn.html"}],"status":"reported","summary":"NIST DADS defines Turing reduction as: A reduction computable by an oracle Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twingridfl","kind":"concept","label":"twin grid file","sources":[{"id":"nist-dads.twingridfl","title":"NIST Dictionary of Algorithms and Data Structures: twingridfl","url":"https://xlinux.nist.gov/dads/HTML/twingridfl.html"}],"status":"reported","summary":"NIST DADS defines twin grid file as: A point access method which is two simultaneous grid files . Points are shuffled between the primary and secondary file to minimize the total size.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.two34tree","kind":"concept","label":"2-3-4 tree","sources":[{"id":"nist-dads.two34tree","title":"NIST Dictionary of Algorithms and Data Structures: two34tree","url":"https://xlinux.nist.gov/dads/HTML/two34tree.html"}],"status":"reported","summary":"NIST DADS defines 2-3-4 tree as: A B-tree of order 4, that is, internal nodes have two, three, or four children .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.twoway","kind":"method","label":"Two Way algorithm","sources":[{"id":"nist-dads.twoway","title":"NIST Dictionary of Algorithms and Data Structures: twoWay","url":"https://xlinux.nist.gov/dads/HTML/twoWay.html"}],"status":"reported","summary":"NIST DADS defines Two Way algorithm as: Partition (\"factor\") the pattern , x, into left, x l , and right, x r , parts in such a way to optimize searching. Compare x r left to right then, if it matches, compare x l right to left.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twodimensnal","kind":"concept","label":"two-dimensional","sources":[{"id":"nist-dads.twodimensnal","title":"NIST Dictionary of Algorithms and Data Structures: twodimensnal","url":"https://xlinux.nist.gov/dads/HTML/twodimensnal.html"}],"status":"reported","summary":"NIST DADS defines two-dimensional as: Dealing with or restricted to a plane. An organization where location can be completely described with exactly two orthogonal axes.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.twolevgrid","kind":"concept","label":"two-level grid file","sources":[{"id":"nist-dads.twolevgrid","title":"NIST Dictionary of Algorithms and Data Structures: twolevgrid","url":"https://xlinux.nist.gov/dads/HTML/twolevgrid.html"}],"status":"reported","summary":"NIST DADS defines two-level grid file as: A point access method which is two levels of grid files . The first level addresses second level grid files.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.twowaymrgsrt","kind":"method","label":"two-way merge sort","sources":[{"id":"nist-dads.twowaymrgsrt","title":"NIST Dictionary of Algorithms and Data Structures: twowaymrgsrt","url":"https://xlinux.nist.gov/dads/HTML/twowaymrgsrt.html"}],"status":"reported","summary":"NIST DADS defines two-way merge sort as: A k-way merge sort that sorts a data stream using repeated merges. It distributes the input into two streams by repeatedly reading a block of input that fits in memory, a run , sorting it, then writing it to the next stream. It merges runs from the two streams into an output stream. It then repeatedly distributes the runs in the output stream to the two streams and merges them until there is a single sorted output.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.ubtree","kind":"concept","label":"UB-tree","sources":[{"id":"nist-dads.ubtree","title":"NIST Dictionary of Algorithms and Data Structures: ubtree","url":"https://xlinux.nist.gov/dads/HTML/ubtree.html"}],"status":"reported","summary":"NIST DADS defines UB-tree as: Refers to either universal B-tree or unlimited branching tree .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unaryfunc","kind":"concept","label":"unary function","sources":[{"id":"nist-dads.unaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: unaryfunc","url":"https://xlinux.nist.gov/dads/HTML/unaryfunc.html"}],"status":"reported","summary":"NIST DADS defines unary function as: A function which takes one argument.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unbiasedcoinflipalgo","kind":"method","label":"unbiased coin flipping algorithm","sources":[{"id":"nist-dads.unbiasedcoinflipalgo","title":"NIST Dictionary of Algorithms and Data Structures: unbiasedCoinFlipAlgo","url":"https://xlinux.nist.gov/dads/HTML/unbiasedCoinFlipAlgo.html"}],"status":"reported","summary":"NIST DADS defines unbiased coin flipping algorithm as: To get unbiased random bits, flip a coin twice. If it comes up heads then tails, the result bit is 1. It it comes up tails then heads, the result is 0. Repeat the double flips until one of these occurs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uncomputablefunction","kind":"concept","label":"uncomputable function","sources":[{"id":"nist-dads.uncomputablefunction","title":"NIST Dictionary of Algorithms and Data Structures: uncomputableFunction","url":"https://xlinux.nist.gov/dads/HTML/uncomputableFunction.html"}],"status":"reported","summary":"NIST DADS defines uncomputable function as: A function that cannot be computed by any algorithm --- equivalently, not by any Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undecidablelanguage","kind":"concept","label":"undecidable language","sources":[{"id":"nist-dads.undecidablelanguage","title":"NIST Dictionary of Algorithms and Data Structures: undecidableLanguage","url":"https://xlinux.nist.gov/dads/HTML/undecidableLanguage.html"}],"status":"reported","summary":"NIST DADS defines undecidable language as: A language for which the membership cannot be decided by an algorithm --- equivalently, cannot be recognized by a Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undecidableproblem","kind":"concept","label":"undecidable problem","sources":[{"id":"nist-dads.undecidableproblem","title":"NIST Dictionary of Algorithms and Data Structures: undecidableProblem","url":"https://xlinux.nist.gov/dads/HTML/undecidableProblem.html"}],"status":"reported","summary":"NIST DADS defines undecidable problem as: A problem that cannot be solved for all cases by any algorithm whatsoever---equivalently, whose associated language cannot be recognized by a Turing machine that halts for all inputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.undirectedgraph","kind":"concept","label":"undirected graph","sources":[{"id":"nist-dads.undirectedgraph","title":"NIST Dictionary of Algorithms and Data Structures: undirectedGraph","url":"https://xlinux.nist.gov/dads/HTML/undirectedGraph.html"}],"status":"reported","summary":"NIST DADS defines undirected graph as: A graph whose edges are unordered pairs of vertices . That is, each edge connects two vertices. Formal Definition: A graph G is a pair (V,E), where V is a set of vertices, and E is a set of edges between the vertices E ⊆ {{u,v} | u, v ∈ V}. If the graph does not allow self-loops , adjacency is irreflexive , that is E ⊆ {{u,v} | u, v ∈ V ∧ u ≠ v}.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformcircuitcomplexity","kind":"concept","label":"uniform circuit complexity","sources":[{"id":"nist-dads.uniformcircuitcomplexity","title":"NIST Dictionary of Algorithms and Data Structures: uniformCircuitComplexity","url":"https://xlinux.nist.gov/dads/HTML/uniformCircuitComplexity.html"}],"status":"reported","summary":"NIST DADS defines uniform circuit complexity as: The study of complexity classes defined by uniform circuit families .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformcircuitfamily","kind":"concept","label":"uniform circuit family","sources":[{"id":"nist-dads.uniformcircuitfamily","title":"NIST Dictionary of Algorithms and Data Structures: uniformCircuitFamily","url":"https://xlinux.nist.gov/dads/HTML/uniformCircuitFamily.html"}],"status":"reported","summary":"NIST DADS defines uniform circuit family as: A sequence of circuits , one for each input length n, that can be efficiently generated by a Turing machine .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.uniformhashn","kind":"method","label":"uniform hashing","sources":[{"id":"nist-dads.uniformhashn","title":"NIST Dictionary of Algorithms and Data Structures: uniformhashn","url":"https://xlinux.nist.gov/dads/HTML/uniformhashn.html"}],"status":"reported","summary":"NIST DADS defines uniform hashing as: A conceptual method of open addressing for a hash table . A collision is resolved by putting the item in the next empty place given by a probe sequence which is independent of sequences for all other key .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uniformmatrx","kind":"concept","label":"uniform matrix","sources":[{"id":"nist-dads.uniformmatrx","title":"NIST Dictionary of Algorithms and Data Structures: uniformmatrx","url":"https://xlinux.nist.gov/dads/HTML/uniformmatrx.html"}],"status":"reported","summary":"NIST DADS defines uniform matrix as: A matrix having the same number of items in each row.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.union","kind":"concept","label":"union","sources":[{"id":"nist-dads.union","title":"NIST Dictionary of Algorithms and Data Structures: union","url":"https://xlinux.nist.gov/dads/HTML/union.html"}],"status":"reported","summary":"NIST DADS defines union as: The union of two sets is a set having all members in either set.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unionautoma","kind":"method","label":"union of automata","sources":[{"id":"nist-dads.unionautoma","title":"NIST Dictionary of Algorithms and Data Structures: unionautoma","url":"https://xlinux.nist.gov/dads/HTML/unionautoma.html"}],"status":"reported","summary":"NIST DADS defines union of automata as: Find an automaton that accepts everything which the automata accept individually.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universaltur","kind":"concept","label":"universal Turing machine","sources":[{"id":"nist-dads.universaltur","title":"NIST Dictionary of Algorithms and Data Structures: universalTur","url":"https://xlinux.nist.gov/dads/HTML/universalTur.html"}],"status":"reported","summary":"NIST DADS defines universal Turing machine as: A Turing machine that is capable of simulating any other Turing machine by encoding the latter.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universalhsh","kind":"concept","label":"universal hashing","sources":[{"id":"nist-dads.universalhsh","title":"NIST Dictionary of Algorithms and Data Structures: universalhsh","url":"https://xlinux.nist.gov/dads/HTML/universalhsh.html"}],"status":"reported","summary":"NIST DADS defines universal hashing as: A scheme that chooses randomly from a set of hash functions .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universalstt","kind":"concept","label":"universal state","sources":[{"id":"nist-dads.universalstt","title":"NIST Dictionary of Algorithms and Data Structures: universalstt","url":"https://xlinux.nist.gov/dads/HTML/universalstt.html"}],"status":"reported","summary":"NIST DADS defines universal state as: A state in an alternating Turing machine from which the machine accepts only if all possible moves lead to acceptance.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.universe","kind":"concept","label":"universe","sources":[{"id":"nist-dads.universe","title":"NIST Dictionary of Algorithms and Data Structures: universe","url":"https://xlinux.nist.gov/dads/HTML/universe.html"}],"status":"reported","summary":"NIST DADS defines universe as: All potential elements of a set .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unlimitedbranchingtree","kind":"concept","label":"unlimited branching tree","sources":[{"id":"nist-dads.unlimitedbranchingtree","title":"NIST Dictionary of Algorithms and Data Structures: unlimitedBranchingTree","url":"https://xlinux.nist.gov/dads/HTML/unlimitedBranchingTree.html"}],"status":"reported","summary":"NIST DADS defines unlimited branching tree as: A forest of ordered trees used to contain ordered lists . The root of each tree is unique. An ordered list is represented by a traversal from the root (first element of the list) to a leaf (last list element). Lists with common prefixes share nodes. The last node in common has one child for each list. This allows rapid searches for subset inclusion of sequences.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unrank","kind":"method","label":"unranking","sources":[{"id":"nist-dads.unrank","title":"NIST Dictionary of Algorithms and Data Structures: unrank","url":"https://xlinux.nist.gov/dads/HTML/unrank.html"}],"status":"reported","summary":"NIST DADS defines unranking as: Given a ranking, r, generate the r th permutation of n elements.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.unshufflsort","kind":"method","label":"UnShuffle sort","sources":[{"id":"nist-dads.unshufflsort","title":"NIST Dictionary of Algorithms and Data Structures: unshufflsort","url":"https://xlinux.nist.gov/dads/HTML/unshufflsort.html"}],"status":"reported","summary":"NIST DADS defines UnShuffle sort as: A distribution sort with two phases. In the first phase, the inputs are distributed among doubly-ended queues keeping the items in each queue ordered and creating a new queue when there is no place on an existing queue. The second phase is an ideal merge in which the item to be removed is determined by keeping the queues in a priority queue .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unsolvableproblem","kind":"concept","label":"unsolvable problem","sources":[{"id":"nist-dads.unsolvableproblem","title":"NIST Dictionary of Algorithms and Data Structures: unsolvableProblem","url":"https://xlinux.nist.gov/dads/HTML/unsolvableProblem.html"}],"status":"reported","summary":"NIST DADS defines unsolvable problem as: A computational problem that cannot be solved by a Turing machine . The associated function is called an uncomputable function .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.unsortedlist","kind":"concept","label":"unsorted list","sources":[{"id":"nist-dads.unsortedlist","title":"NIST Dictionary of Algorithms and Data Structures: unsortedList","url":"https://xlinux.nist.gov/dads/HTML/unsortedList.html"}],"status":"reported","summary":"NIST DADS defines unsorted list as: A list whose order of items, if any, is not known.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.uppertriangularmatrix","kind":"concept","label":"upper triangular matrix","sources":[{"id":"nist-dads.uppertriangularmatrix","title":"NIST Dictionary of Algorithms and Data Structures: upperTriangularMatrix","url":"https://xlinux.nist.gov/dads/HTML/upperTriangularMatrix.html"}],"status":"reported","summary":"NIST DADS defines upper triangular matrix as: A matrix that is only defined at (i,j) when i ≤ j.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vanemdeboas","kind":"concept","label":"van Emde-Boas priority queue","sources":[{"id":"nist-dads.vanemdeboas","title":"NIST Dictionary of Algorithms and Data Structures: vanemdeboas","url":"https://xlinux.nist.gov/dads/HTML/vanemdeboas.html"}],"status":"reported","summary":"NIST DADS defines van Emde-Boas priority queue as: An efficient implementation of priority queues where insert, delete, get minimum, get maximum, etc. take O(log log N) time, where N is the total possible number of keys . Depending on the circumstance, the implementation is null (if the queue is empty), an integer (if the queue has one integer), a bit vector of size N (if N is small), or a special data structure : an array of priority queues, called the bottom queues, and one more priority queue of array indexes of the bottom queues.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vehiclerouting","kind":"concept","label":"vehicle routing problem","sources":[{"id":"nist-dads.vehiclerouting","title":"NIST Dictionary of Algorithms and Data Structures: vehicleRouting","url":"https://xlinux.nist.gov/dads/HTML/vehicleRouting.html"}],"status":"reported","summary":"NIST DADS defines vehicle routing problem as: Find an optimal route of one or more vehicles through a graph . Also known as VRP.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.venndiagram","kind":"concept","label":"Venn diagram","sources":[{"id":"nist-dads.venndiagram","title":"NIST Dictionary of Algorithms and Data Structures: venndiagram","url":"https://xlinux.nist.gov/dads/HTML/venndiagram.html"}],"status":"reported","summary":"NIST DADS defines Venn diagram as: A visual depiction of membership in sets according to binary properties, using overlapping ovals to divide the plane into regions. Regions inside an oval have the property the oval represents, while regions outside it do not have the property. Regions are shaded to show combinations of properties (or sets) of interest, or elements are placed in regions corresponding to their properties (or membership).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexconnectivity","kind":"concept","label":"vertex connectivity","sources":[{"id":"nist-dads.vertexconnectivity","title":"NIST Dictionary of Algorithms and Data Structures: vertexConnectivity","url":"https://xlinux.nist.gov/dads/HTML/vertexConnectivity.html"}],"status":"reported","summary":"NIST DADS defines vertex connectivity as: (1) The smallest number of vertices whose deletion causes a connected graph to not be connected. (2) For a pair of vertices s and t in a graph, the smallest number of vertices whose deletion will separate s from t.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexcolor","kind":"concept","label":"vertex coloring","sources":[{"id":"nist-dads.vertexcolor","title":"NIST Dictionary of Algorithms and Data Structures: vertexcolor","url":"https://xlinux.nist.gov/dads/HTML/vertexcolor.html"}],"status":"reported","summary":"NIST DADS defines vertex coloring as: An assignment of colors (or any distinct marks) to the vertices of a graph . Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertexcover","kind":"concept","label":"vertex cover","sources":[{"id":"nist-dads.vertexcover","title":"NIST Dictionary of Algorithms and Data Structures: vertexcover","url":"https://xlinux.nist.gov/dads/HTML/vertexcover.html"}],"status":"reported","summary":"NIST DADS defines vertex cover as: A set of vertices in an undirected graph where every edge connects at least one vertex. The vertex cover problem is to find a minimum size set and is NP-complete .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.vertical","kind":"concept","label":"vertical visibility map","sources":[{"id":"nist-dads.vertical","title":"NIST Dictionary of Algorithms and Data Structures: vertical","url":"https://xlinux.nist.gov/dads/HTML/vertical.html"}],"status":"reported","summary":"NIST DADS defines vertical visibility map as: A partition of the plane into regions by drawing a vertical straight line through each vertex p of a planar straight-line graph until it intersects an edge e of the graph or extends to infinity. The edge e is said to be vertically visible from p.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.visibilitymap","kind":"concept","label":"visibility map","sources":[{"id":"nist-dads.visibilitymap","title":"NIST Dictionary of Algorithms and Data Structures: visibilityMap","url":"https://xlinux.nist.gov/dads/HTML/visibilityMap.html"}],"status":"reported","summary":"NIST DADS defines visibility map as: A planar subdivision that encodes the visibility information, that is, which points are mutually visible .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.visible","kind":"concept","label":"visible","sources":[{"id":"nist-dads.visible","title":"NIST Dictionary of Algorithms and Data Structures: visible","url":"https://xlinux.nist.gov/dads/HTML/visible.html"}],"status":"reported","summary":"NIST DADS defines visible as: Two points p and q are visible if the straight line segment between them does not intersect any other object, edge, etc.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.viterbialgorithm","kind":"method","label":"Viterbi algorithm","sources":[{"id":"nist-dads.viterbialgorithm","title":"NIST Dictionary of Algorithms and Data Structures: viterbiAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/viterbiAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Viterbi algorithm as: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.vittersalgorithm","kind":"method","label":"Vitter's algorithm","sources":[{"id":"nist-dads.vittersalgorithm","title":"NIST Dictionary of Algorithms and Data Structures: vittersAlgorithm","url":"https://xlinux.nist.gov/dads/HTML/vittersAlgorithm.html"}],"status":"reported","summary":"NIST DADS defines Vitter's algorithm as: An adaptive Huffman coding scheme. Typically this produces codings the same length as or shorter than static Huffman coding . In the worst case , this uses one more bit per codeword .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.walk","kind":"concept","label":"walk","sources":[{"id":"nist-dads.walk","title":"NIST Dictionary of Algorithms and Data Structures: walk","url":"https://xlinux.nist.gov/dads/HTML/walk.html"}],"status":"reported","summary":"NIST DADS defines walk as: A path in which edges may be repeated.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weakheap","kind":"concept","label":"weak-heap","sources":[{"id":"nist-dads.weakheap","title":"NIST Dictionary of Algorithms and Data Structures: weakheap","url":"https://xlinux.nist.gov/dads/HTML/weakheap.html"}],"status":"reported","summary":"NIST DADS defines weak-heap as: A relaxed heap satisfying the following three conditions: (1) every key in the right subtree of a node is greater than the key stored in the node itself, (2) the root has no left child , and (3) leaves are only found on the last two levels of the tree.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.weakheapsort","kind":"method","label":"weak-heap sort","sources":[{"id":"nist-dads.weakheapsort","title":"NIST Dictionary of Algorithms and Data Structures: weakheapsort","url":"https://xlinux.nist.gov/dads/HTML/weakheapsort.html"}],"status":"reported","summary":"NIST DADS defines weak-heap sort as: A sort algorithm that builds a weak-heap , then repeatedly extracts the maximum item. In the worst case , the run time is O(n log n + 0.1 n) .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.weighteddigraph","kind":"concept","label":"weighted, directed graph","sources":[{"id":"nist-dads.weighteddigraph","title":"NIST Dictionary of Algorithms and Data Structures: weightedDigraph","url":"https://xlinux.nist.gov/dads/HTML/weightedDigraph.html"}],"status":"reported","summary":"NIST DADS defines weighted, directed graph as: A directed graph that has a weight, or numeric value, associated with each edge .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.window","kind":"concept","label":"window","sources":[{"id":"nist-dads.window","title":"NIST Dictionary of Algorithms and Data Structures: window","url":"https://xlinux.nist.gov/dads/HTML/window.html"}],"status":"reported","summary":"NIST DADS defines window as: substring of the text that is aligned with the pattern .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.witness","kind":"concept","label":"witness","sources":[{"id":"nist-dads.witness","title":"NIST Dictionary of Algorithms and Data Structures: witness","url":"https://xlinux.nist.gov/dads/HTML/witness.html"}],"status":"reported","summary":"NIST DADS defines witness as: (1) a structure providing an easily verified bound on the optimal value of an optimization problem . Typically used in the analysis of an approximation algorithm to prove the performance guarantee . (2) a mismatch of two symbols of string y at a distance of d is a \"witness\" to the fact that in no subject y could occur twice at a distance of exactly d positions (equivalently, that d cannot be a period of y).","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.work","kind":"concept","label":"work","sources":[{"id":"nist-dads.work","title":"NIST Dictionary of Algorithms and Data Structures: work","url":"https://xlinux.nist.gov/dads/HTML/work.html"}],"status":"reported","summary":"NIST DADS defines work as: The total number of operations taken by a computation.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workdepthmdl","kind":"concept","label":"work-depth model","sources":[{"id":"nist-dads.workdepthmdl","title":"NIST Dictionary of Algorithms and Data Structures: workdepthmdl","url":"https://xlinux.nist.gov/dads/HTML/workdepthmdl.html"}],"status":"reported","summary":"NIST DADS defines work-depth model as: A model of parallel computation in which one keeps track of the total work and depth of a computation without worrying about how it maps onto a machine.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workefficint","kind":"concept","label":"work-efficient","sources":[{"id":"nist-dads.workefficint","title":"NIST Dictionary of Algorithms and Data Structures: workefficint","url":"https://xlinux.nist.gov/dads/HTML/workefficint.html"}],"status":"reported","summary":"NIST DADS defines work-efficient as: A parallel algorithm which asymptotically requires at most a constant factor more work than the best known sequential algorithm or the optimal work.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.workpreserv","kind":"concept","label":"work-preserving","sources":[{"id":"nist-dads.workpreserv","title":"NIST Dictionary of Algorithms and Data Structures: workpreserv","url":"https://xlinux.nist.gov/dads/HTML/workpreserv.html"}],"status":"reported","summary":"NIST DADS defines work-preserving as: A translation of an algorithm from one model of computation to another in which the work is the same in both models, to within a constant factor.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcaseexecutiontime","kind":"concept","label":"worst-case execution time","sources":[{"id":"nist-dads.worstcaseexecutiontime","title":"NIST Dictionary of Algorithms and Data Structures: worstCaseExecutionTime","url":"https://xlinux.nist.gov/dads/HTML/worstCaseExecutionTime.html"}],"status":"reported","summary":"NIST DADS defines worst-case execution time as: The execution time of an algorithm in the worst case . Also known as WCET.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcaseminimumaccess","kind":"concept","label":"worst-case minimum access","sources":[{"id":"nist-dads.worstcaseminimumaccess","title":"NIST Dictionary of Algorithms and Data Structures: worstCaseMinimumAccess","url":"https://xlinux.nist.gov/dads/HTML/worstCaseMinimumAccess.html"}],"status":"reported","summary":"NIST DADS defines worst-case minimum access as: A figure of merit for a family of searches, the \"best\" is the search that takes the minimum accesses in the worst case .","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcase","kind":"concept","label":"worst case","sources":[{"id":"nist-dads.worstcase","title":"NIST Dictionary of Algorithms and Data Structures: worstcase","url":"https://xlinux.nist.gov/dads/HTML/worstcase.html"}],"status":"reported","summary":"NIST DADS defines worst case as: (1) The situation or input that forces an algorithm or data structure to take the most time or resources. (2) Having to do with this situation or input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.worstcasecost","kind":"concept","label":"worst-case cost","sources":[{"id":"nist-dads.worstcasecost","title":"NIST Dictionary of Algorithms and Data Structures: worstcaseCost","url":"https://xlinux.nist.gov/dads/HTML/worstcaseCost.html"}],"status":"reported","summary":"NIST DADS defines worst-case cost as: The highest possible use of resources of an algorithm , which occurs for the most pessimistic, or worst possible, input.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.xor","kind":"concept","label":"xor","sources":[{"id":"nist-dads.xor","title":"NIST Dictionary of Algorithms and Data Structures: xor","url":"https://xlinux.nist.gov/dads/HTML/xor.html"}],"status":"reported","summary":"NIST DADS defines xor as: \"Exclusive OR\" or \"not equal to\" function: 0 XOR 0 = 0, 0 XOR 1 = 1, 1 XOR 0 = 1, 1 XOR 1 = 0. Also known as exclusive or.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.zellerscongruence","kind":"method","label":"Zeller's congruence","sources":[{"id":"nist-dads.zellerscongruence","title":"NIST Dictionary of Algorithms and Data Structures: zellersCongruence","url":"https://xlinux.nist.gov/dads/HTML/zellersCongruence.html"}],"status":"reported","summary":"NIST DADS defines Zeller's congruence as: An algorithm to find the day of the week for any date.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zerobasedindexing","kind":"concept","label":"0-based indexing","sources":[{"id":"nist-dads.zerobasedindexing","title":"NIST Dictionary of Algorithms and Data Structures: zeroBasedIndexing","url":"https://xlinux.nist.gov/dads/HTML/zeroBasedIndexing.html"}],"status":"reported","summary":"NIST DADS defines 0-based indexing as: Indexing (an array ) beginning with 0.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zeroaryfunc","kind":"concept","label":"0-ary function","sources":[{"id":"nist-dads.zeroaryfunc","title":"NIST Dictionary of Algorithms and Data Structures: zeroaryfunc","url":"https://xlinux.nist.gov/dads/HTML/zeroaryfunc.html"}],"status":"reported","summary":"NIST DADS defines 0-ary function as: A function that takes no arguments. Also known as nullary function.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"method.nist.zhutakaoka","kind":"method","label":"Zhu-Takaoka","sources":[{"id":"nist-dads.zhutakaoka","title":"NIST Dictionary of Algorithms and Data Structures: zhuTakaoka","url":"https://xlinux.nist.gov/dads/HTML/zhuTakaoka.html"}],"status":"reported","summary":"NIST DADS defines Zhu-Takaoka as: A string matching algorithm that is a variant of the Boyer-Moore algorithm. It uses two consecutive text characters to compute the bad character shift. It is faster when the alphabet or pattern is small, but the skip table grows quickly, slowing the pre-processing phase.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zipfian","kind":"concept","label":"Zipfian distribution","sources":[{"id":"nist-dads.zipfian","title":"NIST Dictionary of Algorithms and Data Structures: zipfian","url":"https://xlinux.nist.gov/dads/HTML/zipfian.html"}],"status":"reported","summary":"NIST DADS defines Zipfian distribution as: A distribution of probabilities of occurrence that follows Zipf's law . Also known as Yule distribution.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zipper","kind":"concept","label":"zipper","sources":[{"id":"nist-dads.zipper","title":"NIST Dictionary of Algorithms and Data Structures: zipper","url":"https://xlinux.nist.gov/dads/HTML/zipper.html"}],"status":"reported","summary":"NIST DADS defines zipper as: A data structure equivalent to a binary tree that is \"opened\" so that some node is accessible. It consists of a pair: the current node, along with information to reconstruct the tree. Reconstruction information is called the path or context. A move-to-left-child operation returns the left subtree, along with a new path, which has (i) a Left value, (ii) the current node, (iii) the right subtree, and (iv) any previous path. A similar operation moves to the right child. A move-up operation returns a tree rebuilt from the path information and the current node, along with the previous path.","tags":[]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"concept.nist.zpp","kind":"concept","label":"ZPP","sources":[{"id":"nist-dads.zpp","title":"NIST Dictionary of Algorithms and Data Structures: zpp","url":"https://xlinux.nist.gov/dads/HTML/zpp.html"}],"status":"reported","summary":"NIST DADS defines ZPP as: The class of languages for which a membership computation by a probabilistic Turing machine halts in polynomial time with no false acceptances or rejections, but randomly some \"I don't know\" answers. \"ZPP\" means \" Z ero error P robability in P olynomial\" time. Formal Definition: For a language, S, there exists a probabilistic Turing machine , M, that halts in polynomial time . M (correctly) accepts or rejects the string or, randomly, halts in an \"I don't know\" state.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.bionics","kind":"field","label":"Bionics","sources":[{"id":"nlm-mesh.96b0d9c21edd54e642e5","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001701","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001701"}],"status":"reported","summary":"NLM MeSH describes Bionics as: The study of systems, particularly electronic systems, which function after the manner of, in a manner characteristic of, or resembling living systems. Also, the science of applying biological techniques and principles to the design of electronic systems.","tags":["ology"]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.biotechnology","kind":"field","label":"Biotechnology","sources":[{"id":"nlm-mesh.e21655cf4050fe8a0ce0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001709"}],"status":"reported","summary":"NLM MeSH describes Biotechnology as: Body of knowledge related to the use of organisms, cells or cell-derived constituents for the purpose of developing products which are technically, scientifically and clinically useful. Alteration of biologic function at the molecular level (i.e., GENETIC ENGINEERING ) is a central focus; laboratory methods used include TRANSFECTION and CLONING technologies, sequence and structure analysis algorithms, computer databases, and gene and protein structure function analysis and prediction.","tags":["ology"]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"ology.nanotechnology","kind":"field","label":"Nanotechnology","sources":[{"id":"nlm-mesh.81fd205e36d18b028764","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D036103","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036103"}],"status":"reported","summary":"NLM MeSH describes Nanotechnology as: The development and use of techniques to study physical phenomena and construct structures in the nanoscale size range or smaller.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.andrology","kind":"field","label":"Andrology","sources":[{"id":"nlm-mesh.47e3bfae5378d264a4a6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D033441","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033441"}],"status":"reported","summary":"NLM MeSH describes Andrology as: A scientific or medical discipline concerning the study of male reproductive biology, diseases of the male genital organs, and male infertility. Major areas of interest include ENDOCRINOLOGY ; SPERMATOGENESIS ; SEMEN ANALYSIS ; FERTILIZATION ; CONTRACEPTION ; and CRYOPRESERVATION .","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.audiology","kind":"field","label":"Audiology","sources":[{"id":"nlm-mesh.6358ed9b75543994a867","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001298","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001298"}],"status":"reported","summary":"NLM MeSH describes Audiology as: Allied medical specialty that studies hearing and hearing impairment.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.cardiology","kind":"field","label":"Cardiology","sources":[{"id":"nlm-mesh.ef1675e27d8e1b53b18d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D002309","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002309"}],"status":"reported","summary":"NLM MeSH describes Cardiology as: The study of the heart, its physiology, and its functions.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.dermatology","kind":"field","label":"Dermatology","sources":[{"id":"nlm-mesh.963851b0921eef8ae42d","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003880","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003880"}],"status":"reported","summary":"NLM MeSH describes Dermatology as: A medical specialty concerned with the skin, its structure, functions, diseases, and treatment.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.gastroenterology","kind":"field","label":"Gastroenterology","sources":[{"id":"nlm-mesh.b5b237de56e2aaaa3266","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D005762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005762"}],"status":"reported","summary":"NLM MeSH describes Gastroenterology as: A subspecialty of internal medicine concerned with the study of the physiology and diseases of the digestive system and related structures (esophagus, liver, gallbladder, and pancreas).","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.gynecology","kind":"field","label":"Gynecology","sources":[{"id":"nlm-mesh.2d51683a5c47ff65a4e9","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D006176","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006176"}],"status":"reported","summary":"NLM MeSH describes Gynecology as: A medical-surgical specialty concerned with the physiology and disorders primarily of the female genital tract, as well as female endocrinology and reproductive physiology.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.hematology","kind":"field","label":"Hematology","sources":[{"id":"nlm-mesh.44db89f7a8e212468382","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D006405","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006405"}],"status":"reported","summary":"NLM MeSH describes Hematology as: A subspecialty of internal medicine concerned with morphology, physiology, and pathology of the blood and blood-forming tissues.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neonatology","kind":"field","label":"Neonatology","sources":[{"id":"nlm-mesh.8268ca3c835135b3e0de","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009359"}],"status":"reported","summary":"NLM MeSH describes Neonatology as: A subspecialty of Pediatrics concerned with the newborn infant.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.nephrology","kind":"field","label":"Nephrology","sources":[{"id":"nlm-mesh.afe32e7cd24512af6fea","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009398","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009398"}],"status":"reported","summary":"NLM MeSH describes Nephrology as: A subspecialty of internal medicine concerned with the anatomy, physiology, and pathology of the kidney.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neurology","kind":"field","label":"Neurology","sources":[{"id":"nlm-mesh.6ce32d2c745cf556384b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009462","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009462"}],"status":"reported","summary":"NLM MeSH describes Neurology as: A medical specialty concerned with the study of the structures, functions, and diseases of the nervous system.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.neuropathology","kind":"field","label":"Neuropathology","sources":[{"id":"nlm-mesh.b195e4fedf3aa920449b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000069338","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069338"}],"status":"reported","summary":"NLM MeSH describes Neuropathology as: The branch of medicine and biomedical science concerned with diseases of the nervous system.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.ophthalmology","kind":"field","label":"Ophthalmology","sources":[{"id":"nlm-mesh.ef44f675a31fc40f56be","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009885","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009885"}],"status":"reported","summary":"NLM MeSH describes Ophthalmology as: A surgical specialty concerned with the structure and function of the eye and the medical and surgical treatment of its defects and diseases.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.pharmacology","kind":"field","label":"Pharmacology","sources":[{"id":"nlm-mesh.72dc31200ed8c2a213c9","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010600"}],"status":"reported","summary":"NLM MeSH describes Pharmacology as: The study of the origin, nature, properties, and actions of drugs and their effects on living organisms.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.psychopharmacology","kind":"field","label":"Psychopharmacology","sources":[{"id":"nlm-mesh.aac03d67dea48e69ae86","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011600"}],"status":"reported","summary":"NLM MeSH describes Psychopharmacology as: The study of the effects of drugs on mental and behavioral activity.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.radiology","kind":"field","label":"Radiology","sources":[{"id":"nlm-mesh.e9897a03354d6948a211","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011871","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011871"}],"status":"reported","summary":"NLM MeSH describes Radiology as: A specialty concerned with the use of x-ray and other forms of radiant energy in the diagnosis and treatment of disease.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.rheumatology","kind":"field","label":"Rheumatology","sources":[{"id":"nlm-mesh.137dd360907a3740cb66","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012219","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012219"}],"status":"reported","summary":"NLM MeSH describes Rheumatology as: A subspecialty of internal medicine concerned with the study of inflammatory or degenerative processes and metabolic derangement of connective tissue structures which pertain to a variety of musculoskeletal disorders, such as arthritis.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.serology","kind":"field","label":"Serology","sources":[{"id":"nlm-mesh.33ea8d12d5d7f3a0a806","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012699","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012699"}],"status":"reported","summary":"NLM MeSH describes Serology as: The study of serum, especially of antigen-antibody reactions in vitro.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.thanatology","kind":"field","label":"Thanatology","sources":[{"id":"nlm-mesh.8e3f51354957e235535b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D013795","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013795"}],"status":"reported","summary":"NLM MeSH describes Thanatology as: The study of the theory, philosophy, and doctrine of death.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.toxicology","kind":"field","label":"Toxicology","sources":[{"id":"nlm-mesh.c5eb56bf612a44ac8d8a","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014116","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014116"}],"status":"reported","summary":"NLM MeSH describes Toxicology as: The science concerned with the detection, chemical composition, and biological action of toxic substances or poisons and the treatment and prevention of toxic manifestations.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.traumatology","kind":"field","label":"Traumatology","sources":[{"id":"nlm-mesh.8ae339a83d3cf2750aee","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014194","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014194"}],"status":"reported","summary":"NLM MeSH describes Traumatology as: The medical specialty which deals with WOUNDS and INJURIES as well as resulting disability and disorders from physical traumas.","tags":["ology"]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"ology.urology","kind":"field","label":"Urology","sources":[{"id":"nlm-mesh.0c9c3700d764125cf02e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D014572","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014572"}],"status":"reported","summary":"NLM MeSH describes Urology as: A surgical specialty concerned with the study, diagnosis, and treatment of diseases of the urinary tract in both sexes, and the genital tract in the male. Common urological problems include urinary obstruction, URINARY INCONTINENCE , infections, and UROGENITAL NEOPLASMS .","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.paleography","kind":"field","label":"Paleography","sources":[{"id":"nlm-mesh.de31c6b64b58d9b44545","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010162","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010162"}],"status":"reported","summary":"NLM MeSH describes Paleography as: The study of ancient inscriptions and modes of writing. It includes the deciphering of manuscripts and other forms to determine their date, provenance, etc. (Webster's 1st ed)","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.philology","kind":"field","label":"Philology","sources":[{"id":"nlm-mesh.7bf6c0775e9e1bc14a38","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010680","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010680"}],"status":"reported","summary":"NLM MeSH describes Philology as: The study of literature in its widest sense, including grammar, etymology, criticism, literary history, language history, linguistic history, systems of writing, and anything else that is relevant to literature or language viewed as literature. Philology as a discipline has both philosophical and scientific overtones.","tags":["ology"]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"ology.theology","kind":"field","label":"Theology","sources":[{"id":"nlm-mesh.0e8764007d2f3f2a9f63","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D028725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028725"}],"status":"reported","summary":"NLM MeSH describes Theology as: The study of religion and religious belief, or a particular system or school of religious beliefs and teachings (from online Cambridge Dictionary of American English, 2000 and WordNet: An Electronic Lexical Database, 1997)","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.cognitive-psychology","kind":"field","label":"Cognitive psychology","sources":[{"id":"nlm-mesh.84e5e4de8f730357653e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000090182","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090182"},{"id":"nlm-mesh.3afa87c4efa263dea007","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019336"}],"status":"reported","summary":"NLM MeSH describes Cognitive psychology as: Branch of psychology that explores the operation of mental processes related to perceiving, attending, thinking, language, and memory, mainly through inferences from behavior. (APA Dictionary of Psychology. https://dictionary.apa.org/cognitive-psychology, accessed 3/22/2021).","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.computational-biology","kind":"field","label":"Computational biology","sources":[{"id":"nlm-mesh.e55950fe926d0ebee0e8","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019295","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019295"}],"status":"reported","summary":"NLM MeSH describes Computational biology as: A field of biology concerned with the development of techniques for the collection and manipulation of biological data, and the use of such data to make biological discoveries or predictions. This field encompasses all computational methods and theories for solving biological problems including manipulation of models and datasets.","tags":["ology"]},{"aliases":[],"domain":"information","era":"undated","frontier":false,"id":"ology.psycholinguistics","kind":"field","label":"Psycholinguistics","sources":[{"id":"nlm-mesh.14af6d0afad21004276f","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011578","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011578"}],"status":"reported","summary":"NLM MeSH describes Psycholinguistics as: A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cryobiology","kind":"field","label":"Cryobiology","sources":[{"id":"nlm-mesh.946d44c7d4c966d8f70c","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000073920","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073920"}],"status":"reported","summary":"NLM MeSH describes Cryobiology as: The study of biological materials or systems subjected to temperatures below their normal range.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.cytology","kind":"field","label":"Cytology","sources":[{"id":"nlm-mesh.0d50c20ba335a36532f3","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000093222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000093222"}],"status":"reported","summary":"NLM MeSH describes Cytology as: The study of single cell as a unit of living organisms. Cytopathology, a branch of this discipline, studies structural changes of cells in diseases and is used in diagnosing diseases.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.embryology","kind":"field","label":"Embryology","sources":[{"id":"nlm-mesh.fe237ee68bf6ac2997f1","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D004626","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004626"}],"status":"reported","summary":"NLM MeSH describes Embryology as: The study of the development of an organism during the embryonic and fetal stages of life.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.genomics","kind":"field","label":"Genomics","sources":[{"id":"nlm-mesh.effd12a7827847f3b1ba","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D023281","url":"https://meshb.nlm.nih.gov/record/ui?ui=D023281"}],"status":"reported","summary":"NLM MeSH describes Genomics as: The systematic study of the complete DNA sequences ( GENOME ) of organisms. Included is construction of complete genetic, physical, and transcript maps, and the analysis of this structural genomic information on a global scale such as in GENOME WIDE ASSOCIATION STUDIES .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.glycobiology","kind":"field","label":"Glycobiology","sources":[{"id":"nlm-mesh.7bc5eafef50d053d5814","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000099126","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099126"}],"status":"reported","summary":"NLM MeSH describes Glycobiology as: The study of the structure, function, and biology of carbohydrates (sugars) and carbohydrate-containing molecules, known as glycans, in biological systems.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.neurobiology","kind":"field","label":"Neurobiology","sources":[{"id":"nlm-mesh.8d297a4fd89adab5fa15","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009446","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009446"}],"status":"reported","summary":"NLM MeSH describes Neurobiology as: The study of the structure, growth, activities, and functions of NEURONS and the NERVOUS SYSTEM .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.pharmacognosy","kind":"field","label":"Pharmacognosy","sources":[{"id":"nlm-mesh.77137917b685045258f0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010598","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010598"}],"status":"reported","summary":"NLM MeSH describes Pharmacognosy as: The science of drugs prepared from natural-sources including preparations from PLANTS , animals, and other organisms as well as MINERALS and other substances included in MATERIA MEDICA . The therapeutic usage of plants is PHYTOTHERAPY .","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.physiology","kind":"field","label":"Physiology","sources":[{"id":"nlm-mesh.c63837a70e6aa338de39","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D010827","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010827"}],"status":"reported","summary":"NLM MeSH describes Physiology as: The biological science concerned with the life-supporting properties, functions, and processes of living organisms or their parts.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.proteomics","kind":"field","label":"Proteomics","sources":[{"id":"nlm-mesh.55c7bf5248c252ae0c2b","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D040901","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040901"}],"status":"reported","summary":"NLM MeSH describes Proteomics as: The systematic study of the complete complement of proteins ( PROTEOME ) of organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.sociobiology","kind":"field","label":"Sociobiology","sources":[{"id":"nlm-mesh.0390edf50d0d577e17eb","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D035503","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035503"}],"status":"reported","summary":"NLM MeSH describes Sociobiology as: The comparative study of social organization in animals including humans, especially with regard to its genetic basis and evolutionary history. (Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.teratology","kind":"field","label":"Teratology","sources":[{"id":"nlm-mesh.60ac9995c95fb563be08","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D018600","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018600"}],"status":"reported","summary":"NLM MeSH describes Teratology as: A branch of embryology for the study of congenital malformations and developmental abnormalities.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.photobiology","kind":"field","label":"Photobiology","sources":[{"id":"nlm-mesh.99640cd221760e32fc9e","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D018462","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018462"}],"status":"reported","summary":"NLM MeSH describes Photobiology as: The branch of biology dealing with the effect of light on organisms.","tags":["ology"]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"ology.radiobiology","kind":"field","label":"Radiobiology","sources":[{"id":"nlm-mesh.4614a1a23cf1eb79c224","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011853","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011853"}],"status":"reported","summary":"NLM MeSH describes Radiobiology as: Study of the scientific principles, mechanisms, and effects of the interaction of ionizing radiation with living matter. (McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","tags":["ology"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"ology.rheology","kind":"field","label":"Rheology","sources":[{"id":"nlm-mesh.672caf2b40c74990f490","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D012212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012212"}],"status":"reported","summary":"NLM MeSH describes Rheology as: The study of the deformation and flow of matter, usually liquids or fluids, and of the plastic flow of solids. The concept covers consistency, dilatancy, liquefaction, resistance to flow, shearing, thixotrophy, and VISCOSITY .","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.criminology","kind":"field","label":"Criminology","sources":[{"id":"nlm-mesh.49b6dba2f266b504ca82","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003418","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003418"}],"status":"reported","summary":"NLM MeSH describes Criminology as: The study of crime and criminals with special reference to the personality factors and social conditions leading toward, or away from crime.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.demography","kind":"field","label":"Demography","sources":[{"id":"nlm-mesh.cf575eadb37c41446ec6","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D003710","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003710"}],"status":"reported","summary":"NLM MeSH describes Demography as: Statistical interpretation and description of a population with reference to distribution, composition, or structure.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.ethnology","kind":"field","label":"Ethnology","sources":[{"id":"nlm-mesh.3294b344080d4d981ed0","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D005007","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005007"}],"status":"reported","summary":"NLM MeSH describes Ethnology as: The comparative and theoretical study of culture, often synonymous with cultural anthropology.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.neuropsychology","kind":"field","label":"Neuropsychology","sources":[{"id":"nlm-mesh.ef3566806174802f82a1","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D009484","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009484"}],"status":"reported","summary":"NLM MeSH describes Neuropsychology as: A branch of psychology which investigates the correlation between experience or behavior and the basic neurophysiological processes. The term neuropsychology stresses the dominant role of the nervous system. It is a more narrowly defined field than physiological psychology or psychophysiology.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.psychopathology","kind":"field","label":"Psychopathology","sources":[{"id":"nlm-mesh.cfcfe0e017d161687831","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011599","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011599"}],"status":"reported","summary":"NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.","tags":["ology"]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"ology.sexology","kind":"field","label":"Sexology","sources":[{"id":"nlm-mesh.e1b8584f6a96cec5e422","title":"NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D044347","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044347"}],"status":"reported","summary":"NLM MeSH describes Sexology as: This discipline concerns the study of SEXUALITY , and the application of sexual knowledge such as sexual attitudes, psychology, and SEXUAL BEHAVIOR . Scope of application generally includes educational ( SEX EDUCATION ), clinical ( SEX COUNSELING ), and other settings.","tags":["ology"]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.fermi-grb090510-photons","kind":"dataset","label":"Fermi-LAT GRB 090510 photon observations","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"},{"id":"completion-source.da8bd9eda3be0640024e","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"status":"reported","summary":"Source-attributed description: The photon observations of GRB090510 collected by Fermi-LAT are analyzed in the cited work to constrain energy-dependent vacuum dispersion, under its stated source and propagation assumptions.","tags":[]},{"aliases":[],"domain":"physical","era":"undated","frontier":false,"id":"dataset.lz-wimp-280-live-days","kind":"dataset","label":"LZ WIMP-search data from 280 live days","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"},{"id":"completion-source.1af1fa72bebe284da6bd","title":"Retained source for unfinished atlas records: https://arxiv.org/abs/2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"status":"reported","summary":"Source-attributed description: The cited LZ WIMP-search analysis uses detector data corresponding to 4.2 ± 0.1 tonne-years of total exposure over 280 live days. It reports no excess over expected backgrounds.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008511","kind":"field","label":"Medicine","sources":[{"id":"nlm-mesh.d008511","title":"NLM MeSH Browser descriptor D008511","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008511"}],"status":"reported","summary":"NLM MeSH describes Medicine as: The art and science of studying, performing research on, preventing, diagnosing, and treating disease, as well as the maintenance of health.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000073316","kind":"field","label":"Addiction Medicine","sources":[{"id":"nlm-mesh.d000073316","title":"NLM MeSH Browser descriptor D000073316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073316"}],"status":"reported","summary":"NLM MeSH describes Addiction Medicine as: A medical specialty focused on the diagnosis and treatment of ADDICTIVE BEHAVIOR disorders, including SUBSTANCE-RELATED DISORDERS and IMPULSE CONTROL DISORDERS ; and the management of co-occurring medical and psychiatric conditions","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000295","kind":"field","label":"Adolescent Medicine","sources":[{"id":"nlm-mesh.d000295","title":"NLM MeSH Browser descriptor D000295","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000295"}],"status":"reported","summary":"NLM MeSH describes Adolescent Medicine as: A branch of medicine pertaining to the diagnosis and treatment of diseases occurring during the period of ADOLESCENCE .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000337","kind":"field","label":"Aerospace Medicine","sources":[{"id":"nlm-mesh.d000337","title":"NLM MeSH Browser descriptor D000337","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000337"}],"status":"reported","summary":"NLM MeSH describes Aerospace Medicine as: That branch of medicine dealing with the studies and effects of flight through the atmosphere or in space upon the human body and with the prevention or cure of physiological or psychological malfunctions arising from these effects. (from NASA Thesaurus)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000486","kind":"field","label":"Allergy and Immunology","sources":[{"id":"nlm-mesh.d000486","title":"NLM MeSH Browser descriptor D000486","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000486"}],"status":"reported","summary":"NLM MeSH describes Allergy and Immunology as: A medical specialty concerned with the hypersensitivity of the individual to foreign substances and protection from the resultant infection or disorder.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000776","kind":"field","label":"Anesthesiology","sources":[{"id":"nlm-mesh.d000776","title":"NLM MeSH Browser descriptor D000776","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000776"}],"status":"reported","summary":"NLM MeSH describes Anesthesiology as: A specialty concerned with the study of anesthetics and anesthesia.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d052938","kind":"field","label":"Bariatric Medicine","sources":[{"id":"nlm-mesh.d052938","title":"NLM MeSH Browser descriptor D052938","url":"https://meshb.nlm.nih.gov/record/ui?ui=D052938"}],"status":"reported","summary":"NLM MeSH describes Bariatric Medicine as: The discipline concerned with WEIGHT REDUCTION in patients with OBESITY .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d001524","kind":"field","label":"Behavioral Medicine","sources":[{"id":"nlm-mesh.d001524","title":"NLM MeSH Browser descriptor D001524","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001524"}],"status":"reported","summary":"NLM MeSH describes Behavioral Medicine as: The interdisciplinary field concerned with the development and integration of behavioral and biomedical science, knowledge, and techniques relevant to health and illness and the application of this knowledge and these techniques to prevention, diagnosis, treatment, and rehabilitation.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015510","kind":"field","label":"Clinical Medicine","sources":[{"id":"nlm-mesh.d015510","title":"NLM MeSH Browser descriptor D015510","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015510"}],"status":"reported","summary":"NLM MeSH describes Clinical Medicine as: The study and practice of medicine by direct examination of the patient.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003154","kind":"field","label":"Community Medicine","sources":[{"id":"nlm-mesh.d003154","title":"NLM MeSH Browser descriptor D003154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003154"}],"status":"reported","summary":"NLM MeSH describes Community Medicine as: A branch of medicine concerned with the total health of the individual within the home environment and in the community, and with the application of comprehensive care to the prevention and treatment of illness in the entire community.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d054597","kind":"field","label":"Disaster Medicine","sources":[{"id":"nlm-mesh.d054597","title":"NLM MeSH Browser descriptor D054597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054597"}],"status":"reported","summary":"NLM MeSH describes Disaster Medicine as: Branch of medicine involved with management and organization of public health response to disasters and major events including the special health and medical needs of a community in a disaster.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d004635","kind":"field","label":"Emergency Medicine","sources":[{"id":"nlm-mesh.d004635","title":"NLM MeSH Browser descriptor D004635","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004635"}],"status":"reported","summary":"NLM MeSH describes Emergency Medicine as: The branch of medicine concerned with the evaluation and initial treatment of urgent and emergent medical problems, such as those caused by accidents, trauma, sudden illness, poisoning, or disasters. Emergency medical care can be provided at the hospital or at sites outside the medical facility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005554","kind":"field","label":"Forensic Medicine","sources":[{"id":"nlm-mesh.d005554","title":"NLM MeSH Browser descriptor D005554","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005554"}],"status":"reported","summary":"NLM MeSH describes Forensic Medicine as: The application of medical knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000099079","kind":"field","label":"Functional Medicine","sources":[{"id":"nlm-mesh.d000099079","title":"NLM MeSH Browser descriptor D000099079","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099079"}],"status":"reported","summary":"NLM MeSH describes Functional Medicine as: The clinical application of SYSTEMS BIOLOGY , that focuses on identifying the underlying drivers of a patient's disease and addressing, through personalized therapeutic interventions, those root causes of the disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d058006","kind":"field","label":"General Practice","sources":[{"id":"nlm-mesh.d058006","title":"NLM MeSH Browser descriptor D058006","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058006"}],"status":"reported","summary":"NLM MeSH describes General Practice as: Patient-based medical care provided across age and gender or specialty boundaries.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005826","kind":"field","label":"Genetics, Medical","sources":[{"id":"nlm-mesh.d005826","title":"NLM MeSH Browser descriptor D005826","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005826"}],"status":"reported","summary":"NLM MeSH describes Genetics, Medical as: A subdiscipline of human genetics which entails the reliable prediction of certain human disorders as a function of the lineage and/or genetic makeup of an individual or of any two parents or potential parents.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d062306","kind":"field","label":"Geography, Medical","sources":[{"id":"nlm-mesh.d062306","title":"NLM MeSH Browser descriptor D062306","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062306"}],"status":"reported","summary":"NLM MeSH describes Geography, Medical as: The area of medicine concerned with the effects on health and disease due to geographic factors such as CLIMATE , environmental conditions, and geographic location.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005853","kind":"field","label":"Geriatrics","sources":[{"id":"nlm-mesh.d005853","title":"NLM MeSH Browser descriptor D005853","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005853"}],"status":"reported","summary":"NLM MeSH describes Geriatrics as: The branch of medicine concerned with the physiological and pathological aspects of the aged, including the clinical problems of senescence and senility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014943","kind":"field","label":"Global Health","sources":[{"id":"nlm-mesh.d014943","title":"NLM MeSH Browser descriptor D014943","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014943"}],"status":"reported","summary":"NLM MeSH describes Global Health as: A multi- and interdisciplinary field concerned with improving health and achieving equity in health for all people. It transcends national boundaries, promotes cooperation and collaboration within and beyond health science fields, and combines population-based disease prevention with individually-based patient care.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064416","kind":"field","label":"Hospital Medicine","sources":[{"id":"nlm-mesh.d064416","title":"NLM MeSH Browser descriptor D064416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064416"}],"status":"reported","summary":"NLM MeSH describes Hospital Medicine as: The branch of medicine concerned with the delivery of comprehensive medical care to hospitalized patients. Practitioners include physicians and non-physician providers who engage in clinical care, teaching, research, or leadership in the field of general hospital medicine.(from http://www.hospitalmedicine.org/AM/Template.cfm?Section=Hospitalist_Definition)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055048","kind":"field","label":"Integrative Medicine","sources":[{"id":"nlm-mesh.d055048","title":"NLM MeSH Browser descriptor D055048","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055048"}],"status":"reported","summary":"NLM MeSH describes Integrative Medicine as: The discipline concerned with using the combination of conventional allopathic medicine and ALTERNATIVE MEDICINE to address the biological, psychological, social, and spiritual aspects of health and illness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d007388","kind":"field","label":"Internal Medicine","sources":[{"id":"nlm-mesh.d007388","title":"NLM MeSH Browser descriptor D007388","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007388"}],"status":"reported","summary":"NLM MeSH describes Internal Medicine as: A medical specialty concerned with the diagnosis and treatment of diseases of the internal organ systems of adults.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008887","kind":"field","label":"Military Medicine","sources":[{"id":"nlm-mesh.d008887","title":"NLM MeSH Browser descriptor D008887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008887"}],"status":"reported","summary":"NLM MeSH describes Military Medicine as: The practice of medicine as applied to special circumstances associated with military operations.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d062346","kind":"field","label":"Molecular Medicine","sources":[{"id":"nlm-mesh.d062346","title":"NLM MeSH Browser descriptor D062346","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062346"}],"status":"reported","summary":"NLM MeSH describes Molecular Medicine as: The field of medicine concerned with understanding the biochemical basis of health and disease and involved in developing diagnostic and therapeutic methods that utilize MOLECULAR BIOLOGY techniques.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009326","kind":"field","label":"Naval Medicine","sources":[{"id":"nlm-mesh.d009326","title":"NLM MeSH Browser descriptor D009326","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009326"}],"status":"reported","summary":"NLM MeSH describes Naval Medicine as: The practice of medicine concerned with conditions affecting the health of individuals associated with the marine environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010021","kind":"field","label":"Osteopathic Medicine","sources":[{"id":"nlm-mesh.d010021","title":"NLM MeSH Browser descriptor D010021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010021"}],"status":"reported","summary":"NLM MeSH describes Osteopathic Medicine as: A medical discipline that is based on the philosophy that all body systems are interrelated and dependent upon one another for good health. This philosophy, developed in 1874 by Dr. Andrew Taylor Still, recognizes the concept of wellness and the importance of treating illness within the context of the whole body. Special attention is placed on the MUSCULOSKELETAL SYSTEM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d065126","kind":"field","label":"Palliative Medicine","sources":[{"id":"nlm-mesh.d065126","title":"NLM MeSH Browser descriptor D065126","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065126"}],"status":"reported","summary":"NLM MeSH describes Palliative Medicine as: A branch of medicine concerned with preventing and relieving the suffering of patients in any stage of disease. Its focus is on comprehensive care and improving the quality of all areas of the patient's life.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010372","kind":"field","label":"Pediatrics","sources":[{"id":"nlm-mesh.d010372","title":"NLM MeSH Browser descriptor D010372","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010372"}],"status":"reported","summary":"NLM MeSH describes Pediatrics as: A medical specialty concerned with maintaining health and providing medical care to children from birth to adolescence.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000079645","kind":"field","label":"Perioperative Medicine","sources":[{"id":"nlm-mesh.d000079645","title":"NLM MeSH Browser descriptor D000079645","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079645"}],"status":"reported","summary":"NLM MeSH describes Perioperative Medicine as: A medical specialty concerned with the patient before and after surgical procedures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010810","kind":"field","label":"Physical and Rehabilitation Medicine","sources":[{"id":"nlm-mesh.d010810","title":"NLM MeSH Browser descriptor D010810","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010810"}],"status":"reported","summary":"NLM MeSH describes Physical and Rehabilitation Medicine as: A medical specialty concerned with the use of physical agents, mechanical apparatus, and manipulation in rehabilitating physically diseased or injured patients.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011570","kind":"field","label":"Psychiatry","sources":[{"id":"nlm-mesh.d011570","title":"NLM MeSH Browser descriptor D011570","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011570"}],"status":"reported","summary":"NLM MeSH describes Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011634","kind":"field","label":"Public Health","sources":[{"id":"nlm-mesh.d011634","title":"NLM MeSH Browser descriptor D011634","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011634"}],"status":"reported","summary":"NLM MeSH describes Public Health as: Branch of medicine concerned with the prevention and control of disease and disability, and the promotion of physical and mental health of the population on the international, national, state, or municipal level.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d044968","kind":"field","label":"Regenerative Medicine","sources":[{"id":"nlm-mesh.d044968","title":"NLM MeSH Browser descriptor D044968","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044968"}],"status":"reported","summary":"NLM MeSH describes Regenerative Medicine as: A field of medicine concerned with developing and using strategies aimed at repair or replacement of damaged, diseased, or metabolically deficient organs, tissues, and cells via TISSUE ENGINEERING ; CELL TRANSPLANTATION ; and ARTIFICIAL ORGANS and BIOARTIFICIAL ORGANS and tissues.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d018456","kind":"field","label":"Reproductive Medicine","sources":[{"id":"nlm-mesh.d018456","title":"NLM MeSH Browser descriptor D018456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018456"}],"status":"reported","summary":"NLM MeSH describes Reproductive Medicine as: A medical-surgical specialty concerned with the morphology, physiology, biochemistry, and pathology of reproduction in man and other animals, and on the biological, medical, and veterinary problems of fertility and lactation. It includes ovulation induction, diagnosis of infertility and recurrent pregnancy loss, and assisted reproductive technologies such as embryo transfer, in vitro fertilization, and intrafallopian transfer of zygotes. (From Infertility and Reproductive Medicine Clinics of North America, Foreword 1990; Journal of Reproduction and Fertility, Notice to Contributors, Jan 1979)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d012936","kind":"field","label":"Social Medicine","sources":[{"id":"nlm-mesh.d012936","title":"NLM MeSH Browser descriptor D012936","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012936"}],"status":"reported","summary":"NLM MeSH describes Social Medicine as: A branch of medicine concerned with the role of socio-environmental factors in the occurrence, prevention and treatment of disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013043","kind":"field","label":"Specialties, Surgical","sources":[{"id":"nlm-mesh.d013043","title":"NLM MeSH Browser descriptor D013043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013043"}],"status":"reported","summary":"NLM MeSH describes Specialties, Surgical as: Various branches of surgical practice limited to specialized areas.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013178","kind":"field","label":"Sports Medicine","sources":[{"id":"nlm-mesh.d013178","title":"NLM MeSH Browser descriptor D013178","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013178"}],"status":"reported","summary":"NLM MeSH describes Sports Medicine as: The field of medicine concerned with physical fitness and the diagnosis and treatment of injuries sustained in exercise and sports activities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000068936","kind":"field","label":"Theranostic Nanomedicine","sources":[{"id":"nlm-mesh.d000068936","title":"NLM MeSH Browser descriptor D000068936","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000068936"}],"status":"reported","summary":"NLM MeSH describes Theranostic Nanomedicine as: An integrated nano-scale approach to MEDICINE which involves concurrent diagnosis, drug delivery, therapy, and monitoring of therapeutic response.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057236","kind":"field","label":"Travel Medicine","sources":[{"id":"nlm-mesh.d057236","title":"NLM MeSH Browser descriptor D057236","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057236"}],"status":"reported","summary":"NLM MeSH describes Travel Medicine as: Multidisciplinary field focusing on prevention of infectious diseases and patient safety during international TRAVEL . Key element of patient's pre-travel visit to the physician is a health risk assessment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014330","kind":"field","label":"Tropical Medicine","sources":[{"id":"nlm-mesh.d014330","title":"NLM MeSH Browser descriptor D014330","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014330"}],"status":"reported","summary":"NLM MeSH describes Tropical Medicine as: The branch of medicine concerned with diseases, mainly of parasitic origin, common in tropical and subtropical regions.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000078782","kind":"field","label":"Vaccinology","sources":[{"id":"nlm-mesh.d000078782","title":"NLM MeSH Browser descriptor D000078782","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078782"}],"status":"reported","summary":"NLM MeSH describes Vaccinology as: Branch of medicine concerned with the development of vaccines to control disease by identifying genetic and other mechanisms and pathways that determine immune responses, and thereby provide new candidate vaccine approaches.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d014686","kind":"field","label":"Venereology","sources":[{"id":"nlm-mesh.d014686","title":"NLM MeSH Browser descriptor D014686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014686"}],"status":"reported","summary":"NLM MeSH describes Venereology as: A branch of medicine which deals with sexually transmitted disease.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055813","kind":"field","label":"Wilderness Medicine","sources":[{"id":"nlm-mesh.d055813","title":"NLM MeSH Browser descriptor D055813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055813"}],"status":"reported","summary":"NLM MeSH describes Wilderness Medicine as: Skills and knowledge required for assessment and treatment of traumatic, environmental, and medical emergencies in remote geographic or wilderness environments.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d007120","kind":"field","label":"Immunochemistry","sources":[{"id":"nlm-mesh.d007120","title":"NLM MeSH Browser descriptor D007120","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007120"}],"status":"reported","summary":"NLM MeSH describes Immunochemistry as: Field of chemistry that pertains to immunological phenomena and the study of chemical reactions related to antigen stimulation of tissues. It includes physicochemical interactions between antigens and antibodies.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000095763","kind":"field","label":"Immunoinformatics","sources":[{"id":"nlm-mesh.d000095763","title":"NLM MeSH Browser descriptor D000095763","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095763"}],"status":"reported","summary":"NLM MeSH describes Immunoinformatics as: The interface between INFORMATICS and IMMUNOLOGY . Otherwise known as computational immunology, it is the use of computational methods and resources for studying IMMUNE SYSTEM PHENOMENA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d019317","kind":"field","label":"Evidence-Based Medicine","sources":[{"id":"nlm-mesh.d019317","title":"NLM MeSH Browser descriptor D019317","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019317"}],"status":"reported","summary":"NLM MeSH describes Evidence-Based Medicine as: An approach of practicing medicine with the goal to improve and evaluate patient care. It requires the judicious integration of best research evidence with the patient's values to make decisions about medical care. This method is to help physicians make proper diagnosis, devise best testing plan, choose best treatment and methods of disease prevention, as well as develop guidelines for large groups of patients with the same disease. (from JAMA 296 (9), 2006)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000088744","kind":"field","label":"Genomic Medicine","sources":[{"id":"nlm-mesh.d000088744","title":"NLM MeSH Browser descriptor D000088744","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088744"}],"status":"reported","summary":"NLM MeSH describes Genomic Medicine as: A medical discipline using genomic information about an individual as part of their clinical care (e.g. for diagnostic or therapeutic decision-making) and the health outcomes and policy implications of that clinical use. (From www.genome.gov/health/Genomics-and-Medicine accessed 12/28/2020)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057285","kind":"field","label":"Precision Medicine","sources":[{"id":"nlm-mesh.d057285","title":"NLM MeSH Browser descriptor D057285","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057285"}],"status":"reported","summary":"NLM MeSH describes Precision Medicine as: Clinical, therapeutic and diagnostic approaches to optimal disease management based on individual variations in a patient's genetic profile.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000070316","kind":"field","label":"Pediatric Emergency Medicine","sources":[{"id":"nlm-mesh.d000070316","title":"NLM MeSH Browser descriptor D000070316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070316"}],"status":"reported","summary":"NLM MeSH describes Pediatric Emergency Medicine as: Branch of EMERGENCY MEDICINE dealing with the emergency care of children.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d053803","kind":"field","label":"Forensic Genetics","sources":[{"id":"nlm-mesh.d053803","title":"NLM MeSH Browser descriptor D053803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053803"}],"status":"reported","summary":"NLM MeSH describes Forensic Genetics as: The application of genetic analyses and MOLECULAR DIAGNOSTIC TECHNIQUES to legal matters and crime analysis.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d049429","kind":"field","label":"Forensic Pathology","sources":[{"id":"nlm-mesh.d049429","title":"NLM MeSH Browser descriptor D049429","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049429"}],"status":"reported","summary":"NLM MeSH describes Forensic Pathology as: The application of pathology to questions of law.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005194","kind":"field","label":"Family Practice","sources":[{"id":"nlm-mesh.d005194","title":"NLM MeSH Browser descriptor D005194","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005194"}],"status":"reported","summary":"NLM MeSH describes Family Practice as: A medical specialty concerned with the provision of continuing, comprehensive primary health care for the entire family.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d019371","kind":"field","label":"Topography, Medical","sources":[{"id":"nlm-mesh.d019371","title":"NLM MeSH Browser descriptor D019371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019371"}],"status":"reported","summary":"NLM MeSH describes Topography, Medical as: The systematic surveying, mapping, charting, and description of specific geographical sites, with reference to the physical features that were presumed to influence health and disease. Medical topography should be differentiated from EPIDEMIOLOGY in that the former emphasizes geography whereas the latter emphasizes disease outbreaks.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000089323","kind":"field","label":"Geroscience","sources":[{"id":"nlm-mesh.d000089323","title":"NLM MeSH Browser descriptor D000089323","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089323"}],"status":"reported","summary":"NLM MeSH describes Geroscience as: The study of the BIOLOGY ; BIOCHEMISTRY ; and PHYSIOLOGY of AGING and the AGED and age-related diseases such as CARDIOVASCULAR DISEASES ; DIABETES MELLITUS ; and CANCER , as well as debilitating conditions like ARTHRITIS ; FATIGUE ; and FRAILTY .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055552","kind":"field","label":"Infectious Disease Medicine","sources":[{"id":"nlm-mesh.d055552","title":"NLM MeSH Browser descriptor D055552","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055552"}],"status":"reported","summary":"NLM MeSH describes Infectious Disease Medicine as: A branch of internal medicine concerned with the diagnosis and treatment of INFECTIOUS DISEASES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008495","kind":"field","label":"Medical Oncology","sources":[{"id":"nlm-mesh.d008495","title":"NLM MeSH Browser descriptor D008495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008495"}],"status":"reported","summary":"NLM MeSH describes Medical Oncology as: A subspecialty of internal medicine concerned with the study of neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015272","kind":"field","label":"Pulmonary Medicine","sources":[{"id":"nlm-mesh.d015272","title":"NLM MeSH Browser descriptor D015272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015272"}],"status":"reported","summary":"NLM MeSH describes Pulmonary Medicine as: A subspecialty of internal medicine concerned with the study of the RESPIRATORY SYSTEM . It is especially concerned with diagnosis and treatment of diseases and defects of the lungs and bronchial tree.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d056508","kind":"field","label":"Sleep Medicine Specialty","sources":[{"id":"nlm-mesh.d056508","title":"NLM MeSH Browser descriptor D056508","url":"https://meshb.nlm.nih.gov/record/ui?ui=D056508"}],"status":"reported","summary":"NLM MeSH describes Sleep Medicine Specialty as: A medical specialty concerned with the diagnosis and treatment of SLEEP WAKE DISORDERS and their causes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000099051","kind":"field","label":"Diving and Hyperbaric Medicine","sources":[{"id":"nlm-mesh.d000099051","title":"NLM MeSH Browser descriptor D000099051","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099051"}],"status":"reported","summary":"NLM MeSH describes Diving and Hyperbaric Medicine as: The practice of medicine concerned with conditions in individuals resulting from exposure to environments where the ambient pressure is increased, such as the undersea environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013366","kind":"field","label":"Submarine Medicine","sources":[{"id":"nlm-mesh.d013366","title":"NLM MeSH Browser descriptor D013366","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013366"}],"status":"reported","summary":"NLM MeSH describes Submarine Medicine as: The field of medicine concerned with conditions affecting the health of people in submarines or sealabs.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d063165","kind":"field","label":"Neurotology","sources":[{"id":"nlm-mesh.d063165","title":"NLM MeSH Browser descriptor D063165","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063165"}],"status":"reported","summary":"NLM MeSH describes Neurotology as: A subspecialty of otolaryngology dealing with the parts of the nervous system related to the ear.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010338","kind":"field","label":"Pathology, Clinical","sources":[{"id":"nlm-mesh.d010338","title":"NLM MeSH Browser descriptor D010338","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010338"}],"status":"reported","summary":"NLM MeSH describes Pathology, Clinical as: A subspecialty of pathology applied to the solution of clinical problems, especially the use of laboratory methods in clinical diagnosis. (Dorland, 28th ed.)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057089","kind":"field","label":"Pathology, Molecular","sources":[{"id":"nlm-mesh.d057089","title":"NLM MeSH Browser descriptor D057089","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057089"}],"status":"reported","summary":"NLM MeSH describes Pathology, Molecular as: A subspecialty of pathology concerned with the molecular basis (e.g., mutations) of various diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010340","kind":"field","label":"Pathology, Surgical","sources":[{"id":"nlm-mesh.d010340","title":"NLM MeSH Browser descriptor D010340","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010340"}],"status":"reported","summary":"NLM MeSH describes Pathology, Surgical as: A field of anatomical pathology in which living tissue is surgically removed for the purpose of diagnosis and treatment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010500","kind":"field","label":"Perinatology","sources":[{"id":"nlm-mesh.d010500","title":"NLM MeSH Browser descriptor D010500","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010500"}],"status":"reported","summary":"NLM MeSH describes Perinatology as: The branch of medicine dealing with the FETUS and NEWBORN during the perinatal period. The perinatal period begins with the twenty-eighth week of gestation and ends twenty-eight days after birth.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000296","kind":"field","label":"Adolescent Psychiatry","sources":[{"id":"nlm-mesh.d000296","title":"NLM MeSH Browser descriptor D000296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000296"}],"status":"reported","summary":"NLM MeSH describes Adolescent Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in individuals 13-18 years.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d001689","kind":"field","label":"Biological Psychiatry","sources":[{"id":"nlm-mesh.d001689","title":"NLM MeSH Browser descriptor D001689","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001689"}],"status":"reported","summary":"NLM MeSH describes Biological Psychiatry as: An interdisciplinary science concerned with studies of the biological bases of behavior - biochemical, genetic, physiological, and neurological - and applying these to the understanding and treatment of mental illness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d002665","kind":"field","label":"Child Psychiatry","sources":[{"id":"nlm-mesh.d002665","title":"NLM MeSH Browser descriptor D002665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002665"}],"status":"reported","summary":"NLM MeSH describes Child Psychiatry as: The medical science that deals with the origin, diagnosis, prevention, and treatment of mental disorders in children.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003158","kind":"field","label":"Community Psychiatry","sources":[{"id":"nlm-mesh.d003158","title":"NLM MeSH Browser descriptor D003158","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003158"}],"status":"reported","summary":"NLM MeSH describes Community Psychiatry as: Branch of psychiatry concerned with the provision and delivery of a coordinated program of mental health care to a specified population. The foci included in this concept are: all social, psychological and physical factors related to etiology, prevention, and maintaining positive mental health in the community.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005555","kind":"field","label":"Forensic Psychiatry","sources":[{"id":"nlm-mesh.d005555","title":"NLM MeSH Browser descriptor D005555","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005555"}],"status":"reported","summary":"NLM MeSH describes Forensic Psychiatry as: Psychiatry in its legal aspects. This includes criminology, penology, COMMITMENT OF PERSONS WITH PSYCHIATRIC DISORDERS , the psychiatrist's role in compensation cases, the problems of releasing information to the court, and of expert testimony.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d005852","kind":"field","label":"Geriatric Psychiatry","sources":[{"id":"nlm-mesh.d005852","title":"NLM MeSH Browser descriptor D005852","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005852"}],"status":"reported","summary":"NLM MeSH describes Geriatric Psychiatry as: A subspecialty of psychiatry concerned with the mental health of the aged.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d008890","kind":"field","label":"Military Psychiatry","sources":[{"id":"nlm-mesh.d008890","title":"NLM MeSH Browser descriptor D008890","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008890"}],"status":"reported","summary":"NLM MeSH describes Military Psychiatry as: Branch of psychiatry concerned with problems related to the prevention, diagnosis, etiology, and treatment of mental or emotional disorders of Armed Forces personnel.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d058027","kind":"field","label":"Neuropsychiatry","sources":[{"id":"nlm-mesh.d058027","title":"NLM MeSH Browser descriptor D058027","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058027"}],"status":"reported","summary":"NLM MeSH describes Neuropsychiatry as: A subfield of psychiatry that emphasizes the somatic substructure on which mental operations and emotions are based, and the functional or organic disturbances of the central nervous system that give rise to, contribute to, or are associated with mental and emotional disorders. (From Campbell's Psychiatric Dictionary, 8th ed.)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011315","kind":"field","label":"Preventive Medicine","sources":[{"id":"nlm-mesh.d011315","title":"NLM MeSH Browser descriptor D011315","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011315"}],"status":"reported","summary":"NLM MeSH describes Preventive Medicine as: A medical specialty primarily concerned with prevention of disease ( PRIMARY PREVENTION ) and the promotion and preservation of health in the individual.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009683","kind":"field","label":"Nuclear Medicine","sources":[{"id":"nlm-mesh.d009683","title":"NLM MeSH Browser descriptor D009683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009683"}],"status":"reported","summary":"NLM MeSH describes Nuclear Medicine as: A specialty field of radiology concerned with diagnostic, therapeutic, and investigative use of radioactive compounds.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d018787","kind":"field","label":"Radiation Oncology","sources":[{"id":"nlm-mesh.d018787","title":"NLM MeSH Browser descriptor D018787","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018787"}],"status":"reported","summary":"NLM MeSH describes Radiation Oncology as: A subspecialty of medical oncology and radiology concerned with the radiotherapy of cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000085843","kind":"field","label":"Imaging Genomics","sources":[{"id":"nlm-mesh.d000085843","title":"NLM MeSH Browser descriptor D000085843","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085843"}],"status":"reported","summary":"NLM MeSH describes Imaging Genomics as: The field of study investigating the relationship between imaging features, identified during various imaging procedures, and the presence of various genetic or molecular markers of particular disorders and diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000085844","kind":"field","label":"Radiation Genomics","sources":[{"id":"nlm-mesh.d000085844","title":"NLM MeSH Browser descriptor D000085844","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085844"}],"status":"reported","summary":"NLM MeSH describes Radiation Genomics as: The study of the association between patient genomic data and the response to IONIZING RADIATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d015642","kind":"field","label":"Radiology, Interventional","sources":[{"id":"nlm-mesh.d015642","title":"NLM MeSH Browser descriptor D015642","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015642"}],"status":"reported","summary":"NLM MeSH describes Radiology, Interventional as: Subspecialty of radiology that combines organ system radiography, catheter techniques and sectional imaging.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000096725","kind":"field","label":"Acute Care Surgery","sources":[{"id":"nlm-mesh.d000096725","title":"NLM MeSH Browser descriptor D000096725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096725"}],"status":"reported","summary":"NLM MeSH describes Acute Care Surgery as: Surgical specialty generally encompassing emergency general surgery, surgical critical care and trauma care. Acute care surgery is a component of general surgery related to care of patients with acute, life-threatening or potentially life-threatening surgical conditions.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d003107","kind":"field","label":"Colorectal Surgery","sources":[{"id":"nlm-mesh.d003107","title":"NLM MeSH Browser descriptor D003107","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003107"}],"status":"reported","summary":"NLM MeSH describes Colorectal Surgery as: A surgical specialty concerned with the diagnosis and treatment of disorders and abnormalities of the COLON ; RECTUM ; and ANAL CANAL .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013502","kind":"field","label":"General Surgery","sources":[{"id":"nlm-mesh.d013502","title":"NLM MeSH Browser descriptor D013502","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013502"}],"status":"reported","summary":"NLM MeSH describes General Surgery as: A specialty in which manual or operative procedures are used in the treatment of disease, injuries, or deformities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009493","kind":"field","label":"Neurosurgery","sources":[{"id":"nlm-mesh.d009493","title":"NLM MeSH Browser descriptor D009493","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009493"}],"status":"reported","summary":"NLM MeSH describes Neurosurgery as: A surgical specialty concerned with the treatment of diseases and disorders of the brain, spinal cord, and peripheral and sympathetic nervous system.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009774","kind":"field","label":"Obstetrics","sources":[{"id":"nlm-mesh.d009774","title":"NLM MeSH Browser descriptor D009774","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009774"}],"status":"reported","summary":"NLM MeSH describes Obstetrics as: A medical-surgical specialty concerned with management and care of women during pregnancy, parturition, and the puerperium.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d057909","kind":"field","label":"Orthognathic Surgery","sources":[{"id":"nlm-mesh.d057909","title":"NLM MeSH Browser descriptor D057909","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057909"}],"status":"reported","summary":"NLM MeSH describes Orthognathic Surgery as: A surgical specialty concerned with correcting conditions related to malposition of the jawbones and other related MAXILLOFACIAL ABNORMALITIES (e.g., CLEFT PALATE ; RETROGNATHISM ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d009985","kind":"field","label":"Orthopedics","sources":[{"id":"nlm-mesh.d009985","title":"NLM MeSH Browser descriptor D009985","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009985"}],"status":"reported","summary":"NLM MeSH describes Orthopedics as: A specialty which utilizes medical, surgical, and physical methods to treat and correct deformities, diseases, and injuries to the skeletal system, its articulations, and associated structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d010036","kind":"field","label":"Otolaryngology","sources":[{"id":"nlm-mesh.d010036","title":"NLM MeSH Browser descriptor D010036","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010036"}],"status":"reported","summary":"NLM MeSH describes Otolaryngology as: A surgical specialty concerned with the study and treatment of disorders of the ear, nose, and throat.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013518","kind":"field","label":"Surgery, Plastic","sources":[{"id":"nlm-mesh.d013518","title":"NLM MeSH Browser descriptor D013518","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013518"}],"status":"reported","summary":"NLM MeSH describes Surgery, Plastic as: The branch of surgery concerned with restoration, reconstruction, or improvement of defective, damaged, or missing structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000071077","kind":"field","label":"Surgical Oncology","sources":[{"id":"nlm-mesh.d000071077","title":"NLM MeSH Browser descriptor D000071077","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000071077"}],"status":"reported","summary":"NLM MeSH describes Surgical Oncology as: A surgical specialty concerned with management of cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d013903","kind":"field","label":"Thoracic Surgery","sources":[{"id":"nlm-mesh.d013903","title":"NLM MeSH Browser descriptor D013903","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013903"}],"status":"reported","summary":"NLM MeSH describes Thoracic Surgery as: A surgical specialty concerned with diagnosis and treatment of disorders of the heart, lungs, and esophagus. Two major types of thoracic surgery are classified as pulmonary and cardiovascular.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064132","kind":"field","label":"Sports Nutritional Sciences","sources":[{"id":"nlm-mesh.d064132","title":"NLM MeSH Browser descriptor D064132","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064132"}],"status":"reported","summary":"NLM MeSH describes Sports Nutritional Sciences as: The study of NUTRITION PROCESSES during EXERCISE and ATHLETIC PERFORMANCE as well as specific NUTRITIONAL REQUIREMENTS of ATHLETES and the relationship between NUTRITIONAL STATUS and NUTRITION DISORDERS in athletes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064796","kind":"field","label":"Veterinary Sports Medicine","sources":[{"id":"nlm-mesh.d064796","title":"NLM MeSH Browser descriptor D064796","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064796"}],"status":"reported","summary":"NLM MeSH describes Veterinary Sports Medicine as: The field of veterinary medicine concerned with PHYSICAL FITNESS of animals in sports (horse racing, dog racing, etc.) and the diagnosis and treatment of sports injuries in animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d055416","kind":"field","label":"Evidence-Based Emergency Medicine","sources":[{"id":"nlm-mesh.d055416","title":"NLM MeSH Browser descriptor D055416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055416"}],"status":"reported","summary":"NLM MeSH describes Evidence-Based Emergency Medicine as: A way of providing emergency medical care that is guided by a thoughtful integration of the best available scientific knowledge with clinical expertise in EMERGENCY MEDICINE . This approach allows the practitioner to critically assess research data, clinical guidelines, and other information resources in order to correctly identify the clinical problem, apply the most high-quality intervention, and re-evaluate the outcome for future improvement.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d054849","kind":"field","label":"Cardiac Electrophysiology","sources":[{"id":"nlm-mesh.d054849","title":"NLM MeSH Browser descriptor D054849","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054849"}],"status":"reported","summary":"NLM MeSH describes Cardiac Electrophysiology as: The study of the electrical activity and characteristics of the HEART ; MYOCARDIUM ; and CARDIOMYOCYTES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000097562","kind":"field","label":"Cardio-Oncology","sources":[{"id":"nlm-mesh.d000097562","title":"NLM MeSH Browser descriptor D000097562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097562"}],"status":"reported","summary":"NLM MeSH describes Cardio-Oncology as: The study, diagnosis, and treatment of CARDIOTOXICITY in patients who undergo treatment for cancer.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d064826","kind":"field","label":"Transfusion Medicine","sources":[{"id":"nlm-mesh.d064826","title":"NLM MeSH Browser descriptor D064826","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064826"}],"status":"reported","summary":"NLM MeSH describes Transfusion Medicine as: The area of hematology that is concerned with the transfusion of blood and blood components, and in prevention and treatment of adverse effects from BLOOD TRANSFUSION errors.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d000073320","kind":"field","label":"Psycho-Oncology","sources":[{"id":"nlm-mesh.d000073320","title":"NLM MeSH Browser descriptor D000073320","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073320"}],"status":"reported","summary":"NLM MeSH describes Psycho-Oncology as: A specialty which deals with the interrelationship of physical, psychological, social, behavioral, and ethical aspects of cancer. Psycho-oncology examines the behavioral and psychosocial factors that may influence the course of the disease, cancer risk, prevention, and detection.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d011316","kind":"field","label":"Preventive Psychiatry","sources":[{"id":"nlm-mesh.d011316","title":"NLM MeSH Browser descriptor D011316","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011316"}],"status":"reported","summary":"NLM MeSH describes Preventive Psychiatry as: A discipline concerned with the prevention of mental illness and the promotion of mental health.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d017720","kind":"field","label":"Molecular Epidemiology","sources":[{"id":"nlm-mesh.d017720","title":"NLM MeSH Browser descriptor D017720","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017720"}],"status":"reported","summary":"NLM MeSH describes Molecular Epidemiology as: The application of molecular biology to the answering of epidemiological questions. The examination of patterns of changes in DNA to implicate particular carcinogens and the use of molecular markers to predict which individuals are at highest risk for a disease are common examples.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"field.mesh.d017891","kind":"field","label":"Pharmacoepidemiology","sources":[{"id":"nlm-mesh.d017891","title":"NLM MeSH Browser descriptor D017891","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017891"}],"status":"reported","summary":"NLM MeSH describes Pharmacoepidemiology as: The science concerned with the benefit and risk of drugs used in populations and the analysis of the outcomes of drug therapies. Pharmacoepidemiologic data come from both clinical trials and epidemiological studies with emphasis on methods for the detection and evaluation of drug-related adverse effects, assessment of risk vs benefit ratios in drug therapy, patterns of drug utilization, the cost-effectiveness of specific drugs, methodology of postmarketing surveillance, and the relation between pharmacoepidemiology and the formulation and interpretation of regulatory guidelines. (Pharmacoepidemiol Drug Saf 1992;1(1); J Pharmacoepidemiol 1990;1(1))","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.291","kind":"field","label":"Earth sciences","sources":[{"id":"usgs-thesaurus.291","title":"USGS Thesaurus term 291","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=291"}],"status":"reported","summary":"The USGS Thesaurus defines Earth sciences as: Broad term for all science related to the study of the earth. This category is also used for geosciences","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1634","kind":"concept","label":"Geologic time periods","sources":[{"id":"usgs-thesaurus.1634","title":"USGS Thesaurus term 1634","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1634"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic time periods as: This category is also used for geologic age and geologic time","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.531","kind":"concept","label":"Hazards","sources":[{"id":"usgs-thesaurus.531","title":"USGS Thesaurus term 531","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=531"}],"status":"reported","summary":"The USGS Thesaurus defines Hazards as: Potential dangers from both natural processes (e.g., earthquakes, floods, and climate change) and human impacts on the environment. This category is also used for catastrophes , with coastal processes for coastal hazards , disasters , with earthquakes for earthquake hazards , emergency management resources , environmental hazards , geologic hazards , with algal blooms for harmful algal blooms , and with ocean processes for ocean hazards","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.287","kind":"field","label":"Earth characteristics","sources":[{"id":"usgs-thesaurus.287","title":"USGS Thesaurus term 287","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=287"}],"status":"reported","summary":"The USGS Thesaurus defines Earth characteristics as: The measurable, definable properties and features of the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.68","kind":"field","label":"Atmospheric sciences","sources":[{"id":"usgs-thesaurus.68","title":"USGS Thesaurus term 68","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=68"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.447","kind":"field","label":"Geography","sources":[{"id":"usgs-thesaurus.447","title":"USGS Thesaurus term 447","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=447"}],"status":"reported","summary":"The USGS Thesaurus defines Geography as: Study of the earth's landforms, topography, and climate, the distribution of flora and fauna, and the distribution, culture, and activities of human populations. This category is also used for geographic information sciences","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.470","kind":"field","label":"Geophysics","sources":[{"id":"usgs-thesaurus.470","title":"USGS Thesaurus term 470","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=470"}],"status":"reported","summary":"The USGS Thesaurus defines Geophysics as: Branch of geology studying the physical characteristics and phenomena of the earth and its atmosphere. This category is also used with maps and atlases for geophysical maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.818","kind":"field","label":"Ocean sciences","sources":[{"id":"usgs-thesaurus.818","title":"USGS Thesaurus term 818","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=818"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean sciences as: Sciences involved in the study of geological, biological, chemical, and physical characteristics and processes of the oceans. This category is also used for oceanography and physical oceanography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1081","kind":"field","label":"Soil sciences","sources":[{"id":"usgs-thesaurus.1081","title":"USGS Thesaurus term 1081","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1081"}],"status":"reported","summary":"The USGS Thesaurus defines Soil sciences as: Earth sciences dealing with the origin, classification, physical, chemical, and biological properties of soils. This category is also used for pedology (soils)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1652","kind":"concept","label":"Phanerozoic","sources":[{"id":"usgs-thesaurus.1652","title":"USGS Thesaurus term 1652","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1652"}],"status":"reported","summary":"The USGS Thesaurus defines Phanerozoic as: Eon of geologic time approximately 542 million years ago extending to the present. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1655","kind":"concept","label":"Precambrian","sources":[{"id":"usgs-thesaurus.1655","title":"USGS Thesaurus term 1655","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1655"}],"status":"reported","summary":"The USGS Thesaurus defines Precambrian as: General interval of geologic time before approximately 542 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for cryptozoic","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.67","kind":"concept","label":"Atmospheric properties","sources":[{"id":"usgs-thesaurus.67","title":"USGS Thesaurus term 67","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=67"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric properties as: Characteristics of the mass of gases surrounding the earth such as composition, temperature, pressure, and humidity. This category is also used for atmosphere properties","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1367","kind":"concept","label":"Earth material properties","sources":[{"id":"usgs-thesaurus.1367","title":"USGS Thesaurus term 1367","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1367"}],"status":"reported","summary":"The USGS Thesaurus defines Earth material properties as: Physical characteristics of rocks and unconsolidated earth materials such as soils and sediments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.292","kind":"concept","label":"Earth structure","sources":[{"id":"usgs-thesaurus.292","title":"USGS Thesaurus term 292","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=292"}],"status":"reported","summary":"The USGS Thesaurus defines Earth structure as: Major interior structural features of the planet earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.455","kind":"field","label":"Geologic history","sources":[{"id":"usgs-thesaurus.455","title":"USGS Thesaurus term 455","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=455"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic history as: Record (and inferred reconstruction) of the origin and development of the earth since its formation. This category is also used for chronostratigraphy and geohistory","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.459","kind":"concept","label":"Geologic structure","sources":[{"id":"usgs-thesaurus.459","title":"USGS Thesaurus term 459","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=459"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic structure as: General position of rocks in an area, and geometrical relationships among rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.501","kind":"concept","label":"Gravitational field (earth)","sources":[{"id":"usgs-thesaurus.501","title":"USGS Thesaurus term 501","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=501"}],"status":"reported","summary":"The USGS Thesaurus defines Gravitational field (earth) as: Region or space around earth's mass which exerts a force that mutually attracts other masses in proportion to the product of the two masses and the distance between them. This category is also used for gravity , with maps and atlases for gravity anomaly maps , and gravity field","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.2090","kind":"field","label":"Lakebed characteristics","sources":[{"id":"usgs-thesaurus.2090","title":"USGS Thesaurus term 2090","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2090"}],"status":"reported","summary":"The USGS Thesaurus defines Lakebed characteristics as: Characteristics of the bottom of inland bodies of water. This category is also used for lake-bed characteristics , lake-bottom characteristics , and lake-floor characteristics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.626","kind":"field","label":"Land surface characteristics","sources":[{"id":"usgs-thesaurus.626","title":"USGS Thesaurus term 626","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=626"}],"status":"reported","summary":"The USGS Thesaurus defines Land surface characteristics as: Features and attributes of earth's land surface. This category is also used for landscape and physiography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.677","kind":"concept","label":"Magnetic field (earth)","sources":[{"id":"usgs-thesaurus.677","title":"USGS Thesaurus term 677","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=677"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.810","kind":"field","label":"Ocean characteristics","sources":[{"id":"usgs-thesaurus.810","title":"USGS Thesaurus term 810","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=810"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean characteristics as: The attributes and process of seas and oceans. This category is also used for ocean mixed-layer depth , with field inventory and monitoring for ocean monitoring , ocean surface characteristics , with ocean processes for oceans , and sea surface reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1005","kind":"concept","label":"Rocks and deposits","sources":[{"id":"usgs-thesaurus.1005","title":"USGS Thesaurus term 1005","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1005"}],"status":"reported","summary":"The USGS Thesaurus defines Rocks and deposits as: Solid masses that make up the earth's crust as well as accumulations of materials. Use for major rock types and unconsolidated deposits. For deposits of economic value, see related terms. This category is also used for crystals , with maps and atlases for lithologic maps , lithology , and rock composition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1072","kind":"concept","label":"Snow and ice cover","sources":[{"id":"usgs-thesaurus.1072","title":"USGS Thesaurus term 1072","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1072"}],"status":"reported","summary":"The USGS Thesaurus defines Snow and ice cover as: Accumulation of snow or ice blanketing land surfaces. This category is also used for cryosphere , glaciers , ice , with drilling and coring for ice core sampling , and snowpack","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1103","kind":"concept","label":"Stratigraphic sections","sources":[{"id":"usgs-thesaurus.1103","title":"USGS Thesaurus term 1103","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1103"}],"status":"reported","summary":"The USGS Thesaurus defines Stratigraphic sections as: Vertical arrangement in layers of rock units whose sequence is used to study the geological history of the strata. This category is also used for geologic sections , geologic units , sections (geologic) , sections (stratigraphic) , strata , and stratum","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1176","kind":"field","label":"Topography","sources":[{"id":"usgs-thesaurus.1176","title":"USGS Thesaurus term 1176","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1176"}],"status":"reported","summary":"The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1078","kind":"concept","label":"Soil chemistry","sources":[{"id":"usgs-thesaurus.1078","title":"USGS Thesaurus term 1078","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1078"}],"status":"reported","summary":"The USGS Thesaurus defines Soil chemistry as: Branch of chemistry concerned with the elements and compounds that make up soils. Includes chemical processes involving soils.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1298","kind":"concept","label":"Water chemistry","sources":[{"id":"usgs-thesaurus.1298","title":"USGS Thesaurus term 1298","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1298"}],"status":"reported","summary":"The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1679","kind":"field","label":"Paleogeography","sources":[{"id":"usgs-thesaurus.1679","title":"USGS Thesaurus term 1679","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1679"}],"status":"reported","summary":"The USGS Thesaurus defines Paleogeography as: Study of the history of earth surface characteristics; geomorphology in the past.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.312","kind":"field","label":"Economic geology","sources":[{"id":"usgs-thesaurus.312","title":"USGS Thesaurus term 312","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=312"}],"status":"reported","summary":"The USGS Thesaurus defines Economic geology as: Scientific study of the formation, location, and use of marketable geologic materials including fuels, metals, minerals, and water.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.706","kind":"field","label":"Marine geology","sources":[{"id":"usgs-thesaurus.706","title":"USGS Thesaurus term 706","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=706"}],"status":"reported","summary":"The USGS Thesaurus defines Marine geology as: Branch of geology concerned with the composition, geologic history, and earth processes of the ocean floor and the continental margin. This category is also used for geological oceanography","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1117","kind":"field","label":"Structural geology","sources":[{"id":"usgs-thesaurus.1117","title":"USGS Thesaurus term 1117","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1117"}],"status":"reported","summary":"The USGS Thesaurus defines Structural geology as: Branch of geology concerned with the distribution, position, shape, and internal structure of rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.440","kind":"concept","label":"Geodesy","sources":[{"id":"usgs-thesaurus.440","title":"USGS Thesaurus term 440","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=440"}],"status":"reported","summary":"The USGS Thesaurus defines Geodesy as: Branch of science dealing with measuring the earth or large areas of the earth for making maps, determining the size and shape of the earth, and correlating gravitational, geological, and magnetic surveys of the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.707","kind":"field","label":"Marine geophysics","sources":[{"id":"usgs-thesaurus.707","title":"USGS Thesaurus term 707","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=707"}],"status":"reported","summary":"The USGS Thesaurus defines Marine geophysics as: Branch of earth sciences concerned with the physical processes of the oceans and continental margins. We include here studies of large bodies of brackish and fresh water, such as lakes and rivers.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1678","kind":"field","label":"Hydrodynamics","sources":[{"id":"usgs-thesaurus.1678","title":"USGS Thesaurus term 1678","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1678"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.859","kind":"field","label":"Paleoceanography","sources":[{"id":"usgs-thesaurus.859","title":"USGS Thesaurus term 859","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=859"}],"status":"reported","summary":"The USGS Thesaurus defines Paleoceanography as: Study of the oceans in the geologic past, including their physical, chemical, biologic, and geologic history.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.604","kind":"field","label":"Invertebrate paleontology","sources":[{"id":"usgs-thesaurus.604","title":"USGS Thesaurus term 604","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=604"}],"status":"reported","summary":"The USGS Thesaurus defines Invertebrate paleontology as: Branch of paleontology which deals with fossil animals without backbones.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.738","kind":"field","label":"Micropaleontology","sources":[{"id":"usgs-thesaurus.738","title":"USGS Thesaurus term 738","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=738"}],"status":"reported","summary":"The USGS Thesaurus defines Micropaleontology as: Branch of paleontology dealing with fossils too small to be seen without a microscope.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.858","kind":"concept","label":"Paleobotany","sources":[{"id":"usgs-thesaurus.858","title":"USGS Thesaurus term 858","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=858"}],"status":"reported","summary":"The USGS Thesaurus defines Paleobotany as: Branch of paleontology concerned with the study of fossil plants and plant life in the geologic past.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1267","kind":"field","label":"Vertebrate paleontology","sources":[{"id":"usgs-thesaurus.1267","title":"USGS Thesaurus term 1267","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1267"}],"status":"reported","summary":"The USGS Thesaurus defines Vertebrate paleontology as: Branch of paleontology dealing with fossil animals that have spinal columns.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1627","kind":"concept","label":"Cenozoic","sources":[{"id":"usgs-thesaurus.1627","title":"USGS Thesaurus term 1627","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1627"}],"status":"reported","summary":"The USGS Thesaurus defines Cenozoic as: Era of geologic time approximately 65 million years ago extending to the present. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1640","kind":"concept","label":"Mesozoic","sources":[{"id":"usgs-thesaurus.1640","title":"USGS Thesaurus term 1640","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1640"}],"status":"reported","summary":"The USGS Thesaurus defines Mesozoic as: Era of geologic time approximately 251 to 65 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1649","kind":"concept","label":"Paleozoic","sources":[{"id":"usgs-thesaurus.1649","title":"USGS Thesaurus term 1649","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1649"}],"status":"reported","summary":"The USGS Thesaurus defines Paleozoic as: Era of geologic time approximately 542 to 251 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1622","kind":"concept","label":"Archaean","sources":[{"id":"usgs-thesaurus.1622","title":"USGS Thesaurus term 1622","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1622"}],"status":"reported","summary":"The USGS Thesaurus defines Archaean as: Eon of geologic time approximately 4 to 2.5 billion years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1635","kind":"concept","label":"Hadean","sources":[{"id":"usgs-thesaurus.1635","title":"USGS Thesaurus term 1635","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1635"}],"status":"reported","summary":"The USGS Thesaurus defines Hadean as: Eon of geologic time prior to 4 billion years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1656","kind":"concept","label":"Proterozoic","sources":[{"id":"usgs-thesaurus.1656","title":"USGS Thesaurus term 1656","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1656"}],"status":"reported","summary":"The USGS Thesaurus defines Proterozoic as: Eon of geologic time approximately 2.5 billion to 542 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.27","kind":"concept","label":"Air temperature","sources":[{"id":"usgs-thesaurus.27","title":"USGS Thesaurus term 27","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=27"}],"status":"reported","summary":"The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.65","kind":"concept","label":"Atmospheric composition","sources":[{"id":"usgs-thesaurus.65","title":"USGS Thesaurus term 65","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=65"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2276","kind":"concept","label":"Acid neutralizing potential","sources":[{"id":"usgs-thesaurus.2276","title":"USGS Thesaurus term 2276","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2276"}],"status":"reported","summary":"The USGS Thesaurus defines Acid neutralizing potential as: Geochemical capacity of earth materials to affect the pH of waters flowing through them. This category is also used for acid neutralizing capacity and neutralization potential","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1714","kind":"concept","label":"Bulk density","sources":[{"id":"usgs-thesaurus.1714","title":"USGS Thesaurus term 1714","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1714"}],"status":"reported","summary":"The USGS Thesaurus defines Bulk density as: Overall density of an unconsolidated earth material.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2290","kind":"concept","label":"Electromagnetic reflectance and emissivity","sources":[{"id":"usgs-thesaurus.2290","title":"USGS Thesaurus term 2290","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2290"}],"status":"reported","summary":"The USGS Thesaurus defines Electromagnetic reflectance and emissivity as: Effectiveness of an earth material in reflecting or emitting radiation, varying by wavelength. Measurements are made over the infrared part of the electromagnetic spectrum in a laboratory to compare with remotely-sensed data obtained by airborne or satellite imaging systems. This category is also used for infrared reflectance , laboratory reflectance , laboratory spectra , spectral radiance , and spectral reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1741","kind":"concept","label":"Magnetism","sources":[{"id":"usgs-thesaurus.1741","title":"USGS Thesaurus term 1741","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1741"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetism as: Strength and orientation of the permanent magnetic field in a given sample of an earth material","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1368","kind":"concept","label":"Permeability","sources":[{"id":"usgs-thesaurus.1368","title":"USGS Thesaurus term 1368","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1368"}],"status":"reported","summary":"The USGS Thesaurus defines Permeability as: The ability of fluids to pass through an earth material, typically depending on the connectedness of pore space in the material. This category is also used for soil permeability","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1369","kind":"concept","label":"Porosity","sources":[{"id":"usgs-thesaurus.1369","title":"USGS Thesaurus term 1369","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1369"}],"status":"reported","summary":"The USGS Thesaurus defines Porosity as: The proportion of open space in a rock or unconsolidated material. This category is also used for interstices and soil porosity","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1701","kind":"concept","label":"Radioactivity","sources":[{"id":"usgs-thesaurus.1701","title":"USGS Thesaurus term 1701","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1701"}],"status":"reported","summary":"The USGS Thesaurus defines Radioactivity as: Release of subatomic particles from earth materials. Generally the energy of these particles is used to determine the chemical elements present. This category is also used for gamma ray emission","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1712","kind":"concept","label":"Resistivity","sources":[{"id":"usgs-thesaurus.1712","title":"USGS Thesaurus term 1712","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1712"}],"status":"reported","summary":"The USGS Thesaurus defines Resistivity as: Electrical resistance of materials, often measured in boreholes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2027","kind":"concept","label":"Soil moisture","sources":[{"id":"usgs-thesaurus.2027","title":"USGS Thesaurus term 2027","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2027"}],"status":"reported","summary":"The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2028","kind":"concept","label":"Soil temperature","sources":[{"id":"usgs-thesaurus.2028","title":"USGS Thesaurus term 2028","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2028"}],"status":"reported","summary":"The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.211","kind":"concept","label":"Core (earth)","sources":[{"id":"usgs-thesaurus.211","title":"USGS Thesaurus term 211","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=211"}],"status":"reported","summary":"The USGS Thesaurus defines Core (earth) as: The superdense center of the earth composed of two layers: a liquid outer layer and a solid inner core of metallic iron-nickel alloy.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.219","kind":"concept","label":"Crust (earth)","sources":[{"id":"usgs-thesaurus.219","title":"USGS Thesaurus term 219","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=219"}],"status":"reported","summary":"The USGS Thesaurus defines Crust (earth) as: The outermost layer of the earth which is relatively thin, of lower density than the core, and rocky.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.690","kind":"concept","label":"Mantle (earth)","sources":[{"id":"usgs-thesaurus.690","title":"USGS Thesaurus term 690","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=690"}],"status":"reported","summary":"The USGS Thesaurus defines Mantle (earth) as: Zone of earth's interior between the crust and the core. It is 2,900 kilometers (1,740 miles) thick and consists of a dense upper layer (upper mantle) and a partially molten lower layer (lower mantle), separated by a transition zone.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.288","kind":"field","label":"Earth history","sources":[{"id":"usgs-thesaurus.288","title":"USGS Thesaurus term 288","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=288"}],"status":"reported","summary":"The USGS Thesaurus defines Earth history as: The structural and compositional changes that the earth has undergone from its formation. Use for discussions of the whole earth (or large sections of it) instead of regional studies.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.404","kind":"concept","label":"Foliation (geologic)","sources":[{"id":"usgs-thesaurus.404","title":"USGS Thesaurus term 404","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=404"}],"status":"reported","summary":"The USGS Thesaurus defines Foliation (geologic) as: The property of rocks or glaciers splitting into thin layers or plates due to the orientation of crystals and dynamic movement.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.660","kind":"concept","label":"Lineation (geologic)","sources":[{"id":"usgs-thesaurus.660","title":"USGS Thesaurus term 660","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=660"}],"status":"reported","summary":"The USGS Thesaurus defines Lineation (geologic) as: Linear topographic feature on the earth's surface or in rocks. This category is also used for lineaments","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1118","kind":"concept","label":"Structure contours","sources":[{"id":"usgs-thesaurus.1118","title":"USGS Thesaurus term 1118","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1118"}],"status":"reported","summary":"The USGS Thesaurus defines Structure contours as: Gridding and contouring lines drawn on geologic maps to depict boundaries of structural features. This category is also used with maps and atlases for depth-to maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1675","kind":"concept","label":"Bouguer anomaly","sources":[{"id":"usgs-thesaurus.1675","title":"USGS Thesaurus term 1675","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1675"}],"status":"reported","summary":"The USGS Thesaurus defines Bouguer anomaly as: Gravity anomaly corrected to remove the effects of topography using knowledge of the terrain in the area surrounding the measurement station.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1674","kind":"concept","label":"Free-air anomaly","sources":[{"id":"usgs-thesaurus.1674","title":"USGS Thesaurus term 1674","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1674"}],"status":"reported","summary":"The USGS Thesaurus defines Free-air anomaly as: Gravity anomaly corrected for elevation of the location at which the measurements were made.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2291","kind":"concept","label":"Gravity gradient","sources":[{"id":"usgs-thesaurus.2291","title":"USGS Thesaurus term 2291","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2291"}],"status":"reported","summary":"The USGS Thesaurus defines Gravity gradient as: Lateral variation of the three-dimensional vector components of gravity, typically measured using airborne sensors. This category is also used for gravity gradiometry","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1673","kind":"concept","label":"Isostatic anomaly","sources":[{"id":"usgs-thesaurus.1673","title":"USGS Thesaurus term 1673","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1673"}],"status":"reported","summary":"The USGS Thesaurus defines Isostatic anomaly as: Gravity anomaly corrected for the effects of low-density rocks underlying mountains.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2091","kind":"concept","label":"Lakebed acoustic reflectivity","sources":[{"id":"usgs-thesaurus.2091","title":"USGS Thesaurus term 2091","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2091"}],"status":"reported","summary":"The USGS Thesaurus defines Lakebed acoustic reflectivity as: Acoustic energy received by a sonar system, providing a measure of the roughness of the lakebed. This category is also used for backscatter (lakebed)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2031","kind":"concept","label":"Karst","sources":[{"id":"usgs-thesaurus.2031","title":"USGS Thesaurus term 2031","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2031"}],"status":"reported","summary":"The USGS Thesaurus defines Karst as: Landscape characterized by dissolution features in carbonate or evaporite terranes, often containing caves and sinkholes. This category is also used for karst topography and karstic","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.817","kind":"concept","label":"Ocean salinity","sources":[{"id":"usgs-thesaurus.817","title":"USGS Thesaurus term 817","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=817"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean salinity as: Measure of the percentage of dissolved salts in seawater.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.819","kind":"concept","label":"Ocean temperature","sources":[{"id":"usgs-thesaurus.819","title":"USGS Thesaurus term 819","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=819"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.1025","kind":"field","label":"Sea-floor characteristics","sources":[{"id":"usgs-thesaurus.1025","title":"USGS Thesaurus term 1025","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1025"}],"status":"reported","summary":"The USGS Thesaurus defines Sea-floor characteristics as: Geomorphic features and geographic, compositional, and textural variation in the materials composing the ocean floor. Includes both large-scale structures (such as seamounts and rises) and fine-scale variations in rocks and deposits on the sea floor. This category is also used for ocean bottom characteristics , sea floor characteristics , and seafloor characteristics","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1028","kind":"concept","label":"Sea-level change","sources":[{"id":"usgs-thesaurus.1028","title":"USGS Thesaurus term 1028","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1028"}],"status":"reported","summary":"The USGS Thesaurus defines Sea-level change as: Variation in the relative vertical position of land and ocean waters. Caused globally by changes in the distribution of ice masses and the shape of the oceans, and locally by the rate of uplift or subsidence of the land surface. Includes both global (eustatic) and local (relative) sea-level variations. This category is also used for sea level change , sea level rise , and sea-level rise","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.414","kind":"concept","label":"Fossils","sources":[{"id":"usgs-thesaurus.414","title":"USGS Thesaurus term 414","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=414"}],"status":"reported","summary":"The USGS Thesaurus defines Fossils as: Recognizable remains such as bones, shells, leaves, burrows, impressions, or tracks of past life on the earth. This category is also used for index fossils and microfossils","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.572","kind":"concept","label":"Igneous rocks","sources":[{"id":"usgs-thesaurus.572","title":"USGS Thesaurus term 572","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=572"}],"status":"reported","summary":"The USGS Thesaurus defines Igneous rocks as: Rocks formed from melted rock that has cooled and solidified.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.725","kind":"concept","label":"Metamorphic rocks","sources":[{"id":"usgs-thesaurus.725","title":"USGS Thesaurus term 725","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=725"}],"status":"reported","summary":"The USGS Thesaurus defines Metamorphic rocks as: Sedimentary or igneous rocks which have undergone such intense changes in temperature, pressure, structural stress, or chemical environment that they are transformed into denser rocks.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2043","kind":"concept","label":"Mineral deposits","sources":[{"id":"usgs-thesaurus.2043","title":"USGS Thesaurus term 2043","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2043"}],"status":"reported","summary":"The USGS Thesaurus defines Mineral deposits as: Deposits in which particular minerals are concentrated, typically noticed and studied if the minerals have economic value. This category is also used for ore deposits","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1370","kind":"concept","label":"Permafrost","sources":[{"id":"usgs-thesaurus.1370","title":"USGS Thesaurus term 1370","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1370"}],"status":"reported","summary":"The USGS Thesaurus defines Permafrost as: Rocks and deposits in which the interstitial waters remain perennially frozen.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1804","kind":"concept","label":"Petroleum","sources":[{"id":"usgs-thesaurus.1804","title":"USGS Thesaurus term 1804","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1804"}],"status":"reported","summary":"The USGS Thesaurus defines Petroleum as: Naturally occurring hydrocarbons, typically fluid or gas, often of economic use. Includes oil, natural gas, and asphaltic compounds found in tar sands and oil shales. This category is also used with industrial pollution for oil spills","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1035","kind":"concept","label":"Sedimentary rocks","sources":[{"id":"usgs-thesaurus.1035","title":"USGS Thesaurus term 1035","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1035"}],"status":"reported","summary":"The USGS Thesaurus defines Sedimentary rocks as: Rocks formed by the consolidation of loose, uncemented pieces of sediments.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1199","kind":"concept","label":"Unconsolidated deposits","sources":[{"id":"usgs-thesaurus.1199","title":"USGS Thesaurus term 1199","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1199"}],"status":"reported","summary":"The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1722","kind":"concept","label":"Sea ice concentration","sources":[{"id":"usgs-thesaurus.1722","title":"USGS Thesaurus term 1722","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1722"}],"status":"reported","summary":"The USGS Thesaurus defines Sea ice concentration as: Proportion of ocean area in a given region that contains or is covered by floating ice. This category is also used for sea ice cover and sea-ice concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.84","kind":"concept","label":"Bedrock geologic units","sources":[{"id":"usgs-thesaurus.84","title":"USGS Thesaurus term 84","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=84"}],"status":"reported","summary":"The USGS Thesaurus defines Bedrock geologic units as: Units of consolidated (solid) rock that underlie soils or other unconsolidated materials. This category is also used with maps and atlases for basement maps and geologic formations","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.452","kind":"concept","label":"Geologic contacts","sources":[{"id":"usgs-thesaurus.452","title":"USGS Thesaurus term 452","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=452"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic contacts as: Junctions of two different rock formations varying by type or age of rock, including faults, unconformities, and bedding planes. This category is also used for contacts (geologic)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2089","kind":"concept","label":"Stratigraphic thickness","sources":[{"id":"usgs-thesaurus.2089","title":"USGS Thesaurus term 2089","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2089"}],"status":"reported","summary":"The USGS Thesaurus defines Stratigraphic thickness as: Thickness of earth material layers or groups of such layers, often portrayed as isopachs (contours) or gridded data. This category is also used for isopach , with maps and atlases for isopach maps , sediment thickness , and with maps and atlases for stratigraphic thickness maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1127","kind":"concept","label":"Surficial geologic units","sources":[{"id":"usgs-thesaurus.1127","title":"USGS Thesaurus term 1127","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1127"}],"status":"reported","summary":"The USGS Thesaurus defines Surficial geologic units as: Rock units on the earth's surface. This category is also used with maps and atlases for surficial geologic maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.80","kind":"concept","label":"Bathymetry","sources":[{"id":"usgs-thesaurus.80","title":"USGS Thesaurus term 80","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=80"}],"status":"reported","summary":"The USGS Thesaurus defines Bathymetry as: The elevation of the earth's surface beneath a body of water, especially the ocean, typically determined by measurements of depth from the water surface. This category is also used for bathymetry data , sea floor topography , and underwater contours","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.703","kind":"concept","label":"Marine chemistry","sources":[{"id":"usgs-thesaurus.703","title":"USGS Thesaurus term 703","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=703"}],"status":"reported","summary":"The USGS Thesaurus defines Marine chemistry as: Branch of chemistry that deals with the properties, composition, structure, and interaction of substances in the seas and oceans. This category is also used for chemical oceanography , ocean chemistry , and water properties (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.115","kind":"field","label":"Biostratigraphy","sources":[{"id":"usgs-thesaurus.115","title":"USGS Thesaurus term 115","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=115"}],"status":"reported","summary":"The USGS Thesaurus defines Biostratigraphy as: Branch of geology concerned with the separation and differentiation of rock units based on the fossils they contain.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.668","kind":"field","label":"Lithostratigraphy","sources":[{"id":"usgs-thesaurus.668","title":"USGS Thesaurus term 668","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=668"}],"status":"reported","summary":"The USGS Thesaurus defines Lithostratigraphy as: Branch of stratigraphy dealing with the study of units of rock. Each unit is composed of a body of rock which is dominated by a certain lithology or similar color, mineralogic composition, and grain size.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"field.usgs.862","kind":"field","label":"Paleoseismology","sources":[{"id":"usgs-thesaurus.862","title":"USGS Thesaurus term 862","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=862"}],"status":"reported","summary":"The USGS Thesaurus defines Paleoseismology as: Branch of seismology concerned with ancient earthquakes. Clues which indicate seismic activities in the geologic past are used to date and determine the effects of those earthquakes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1657","kind":"concept","label":"Quaternary","sources":[{"id":"usgs-thesaurus.1657","title":"USGS Thesaurus term 1657","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1657"}],"status":"reported","summary":"The USGS Thesaurus defines Quaternary as: Period of geologic time approximately 2.6 million years ago extending to the present. In new studies, this term is deprecated in favor of Holocene and Pleistocene. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1662","kind":"concept","label":"Tertiary","sources":[{"id":"usgs-thesaurus.1662","title":"USGS Thesaurus term 1662","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1662"}],"status":"reported","summary":"The USGS Thesaurus defines Tertiary as: Period of geologic time approximately 65 to 1.8 million years ago. In new studies, this term is deprecated in favor of Neogene and Paleogene. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1628","kind":"concept","label":"Cretaceous","sources":[{"id":"usgs-thesaurus.1628","title":"USGS Thesaurus term 1628","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1628"}],"status":"reported","summary":"The USGS Thesaurus defines Cretaceous as: Period of geologic time approximately 145 to 65 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1638","kind":"concept","label":"Jurassic","sources":[{"id":"usgs-thesaurus.1638","title":"USGS Thesaurus term 1638","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1638"}],"status":"reported","summary":"The USGS Thesaurus defines Jurassic as: Period of geologic time approximately 200 to 145 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1664","kind":"concept","label":"Triassic","sources":[{"id":"usgs-thesaurus.1664","title":"USGS Thesaurus term 1664","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1664"}],"status":"reported","summary":"The USGS Thesaurus defines Triassic as: Period of geologic time approximately 251 to 200 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1626","kind":"concept","label":"Cambrian","sources":[{"id":"usgs-thesaurus.1626","title":"USGS Thesaurus term 1626","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1626"}],"status":"reported","summary":"The USGS Thesaurus defines Cambrian as: Period of geologic time approximately 542 to 488 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1630","kind":"concept","label":"Devonian","sources":[{"id":"usgs-thesaurus.1630","title":"USGS Thesaurus term 1630","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1630"}],"status":"reported","summary":"The USGS Thesaurus defines Devonian as: Period of geologic time approximately 416 to 359 million years ago. https://doi.org/10.3133/fs20103059","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1642","kind":"concept","label":"Mississippian","sources":[{"id":"usgs-thesaurus.1642","title":"USGS Thesaurus term 1642","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1642"}],"status":"reported","summary":"The USGS Thesaurus defines Mississippian as: Subperiod of geologic time approximately 359 to 318 million years ago. https://doi.org/10.3133/fs20103059 This category is also used for lower carboniferous","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006809","kind":"concept","label":"Humanities","sources":[{"id":"nlm-mesh.d006809","title":"NLM MeSH Browser descriptor D006809","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006809"}],"status":"reported","summary":"NLM MeSH describes Humanities as: Fields of inquiry in human constructs and concerns as opposed to natural processes and social relations. These are traditionally the study of literature, philosophy, and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001154","kind":"field","label":"Art","sources":[{"id":"nlm-mesh.d001154","title":"NLM MeSH Browser descriptor D001154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001154"}],"status":"reported","summary":"NLM MeSH describes Art as: Processes and results of aesthetic expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000098463","kind":"concept","label":"Ethical Dilemmas","sources":[{"id":"nlm-mesh.d000098463","title":"NLM MeSH Browser descriptor D000098463","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098463"}],"status":"reported","summary":"NLM MeSH describes Ethical Dilemmas as: Situations in which two moral principles conflict with one another. Fictional or hypothetical dilemmas of this kind are used to assess the moral beliefs or moral reasoning skills of individuals. (From APA Dictionary of Psychology, https://dictionary.apa.org/)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006664","kind":"field","label":"History","sources":[{"id":"nlm-mesh.d006664","title":"NLM MeSH Browser descriptor D006664","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006664"}],"status":"reported","summary":"NLM MeSH describes History as: Record and study of past events.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019359","kind":"concept","label":"Knowledge","sources":[{"id":"nlm-mesh.d019359","title":"NLM MeSH Browser descriptor D019359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019359"}],"status":"reported","summary":"NLM MeSH describes Knowledge as: The body of truths or facts accumulated in the course of time, the cumulated sum of information, its volume and nature, in any civilization, period, or country.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008091","kind":"field","label":"Literature","sources":[{"id":"nlm-mesh.d008091","title":"NLM MeSH Browser descriptor D008091","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008091"}],"status":"reported","summary":"NLM MeSH describes Literature as: Writings having excellence of form or expression and expressing ideas of permanent or universal interest. The body of written works produced in a particular language, country, or age. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009146","kind":"field","label":"Music","sources":[{"id":"nlm-mesh.d009146","title":"NLM MeSH Browser descriptor D009146","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009146"}],"status":"reported","summary":"NLM MeSH describes Music as: Sound that expresses emotion through rhythm, melody, and harmony.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019368","kind":"concept","label":"Nature","sources":[{"id":"nlm-mesh.d019368","title":"NLM MeSH Browser descriptor D019368","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019368"}],"status":"reported","summary":"NLM MeSH describes Nature as: The system of all phenomena in space and time; the totality of physical reality. It is both a scientific and philosophic concept appearing in all historic eras. (Webster 2d; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009781","kind":"concept","label":"Occultism","sources":[{"id":"nlm-mesh.d009781","title":"NLM MeSH Browser descriptor D009781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009781"}],"status":"reported","summary":"NLM MeSH describes Occultism as: The belief in or study of practices and knowledge of magical, mystical, or supernatural powers. ALCHEMY , astrology, and many RELIGIOUS PHILOSOPHIES are based upon occult principles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012067","kind":"field","label":"Religion","sources":[{"id":"nlm-mesh.d012067","title":"NLM MeSH Browser descriptor D012067","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012067"}],"status":"reported","summary":"NLM MeSH describes Religion as: A set of beliefs concerning the nature, cause, and purpose of the universe, especially when considered as the creation of a superhuman agency. It usually involves devotional and ritual observances and often a moral code for the conduct of human affairs. (Random House Collegiate Dictionary, rev. ed.)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d066288","kind":"concept","label":"Romanticism","sources":[{"id":"nlm-mesh.d066288","title":"NLM MeSH Browser descriptor D066288","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066288"}],"status":"reported","summary":"NLM MeSH describes Romanticism as: The attitude or intellectual orientation that characterized many works of literature, painting, music, architecture, criticism, and historiography in Western civilization over a period from the late 18th to the mid-19th century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035621","kind":"concept","label":"Secularism","sources":[{"id":"nlm-mesh.d035621","title":"NLM MeSH Browser descriptor D035621","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035621"}],"status":"reported","summary":"NLM MeSH describes Secularism as: Indifference to, or rejection of, RELIGION or religious considerations. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018594","kind":"concept","label":"Human Body","sources":[{"id":"nlm-mesh.d018594","title":"NLM MeSH Browser descriptor D018594","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018594"}],"status":"reported","summary":"NLM MeSH describes Human Body as: The human being as a non-anatomical and non-zoological entity. The emphasis is on the philosophical or artistic treatment of the human being, and includes lay and social attitudes toward the body in history. (From J. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008488","kind":"concept","label":"Medical Illustration","sources":[{"id":"nlm-mesh.d008488","title":"NLM MeSH Browser descriptor D008488","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008488"}],"status":"reported","summary":"NLM MeSH describes Medical Illustration as: The field which deals with illustrative clarification of biomedical concepts, as in the use of diagrams and drawings. The illustration may be produced by hand, photography, computer, or other electronic or mechanical methods.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008512","kind":"concept","label":"Medicine in the Arts","sources":[{"id":"nlm-mesh.d008512","title":"NLM MeSH Browser descriptor D008512","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008512"}],"status":"reported","summary":"NLM MeSH describes Medicine in the Arts as: Depiction of medical issues or themes via the arts including visual, oral, or written forms of expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009717","kind":"field","label":"Numismatics","sources":[{"id":"nlm-mesh.d009717","title":"NLM MeSH Browser descriptor D009717","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009717"}],"status":"reported","summary":"NLM MeSH describes Numismatics as: Study of coins, tokens, medals, etc. However, it usually refers to medals pertaining to the history of medicine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000075862","kind":"concept","label":"Science in the Arts","sources":[{"id":"nlm-mesh.d000075862","title":"NLM MeSH Browser descriptor D000075862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075862"}],"status":"reported","summary":"NLM MeSH describes Science in the Arts as: Depiction of scientific issues or themes via the arts including visual, oral, or written forms of expression.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d005053","kind":"field","label":"Eugenics","sources":[{"id":"nlm-mesh.d005053","title":"NLM MeSH Browser descriptor D005053","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005053"}],"status":"reported","summary":"NLM MeSH describes Eugenics as: The attempt to improve the PHENOTYPES of future generations of the human population by fostering the reproduction of those with favorable phenotypes and GENOTYPES and hampering or preventing BREEDING by those with undesirable phenotypes and genotypes. The concept is largely discredited. (McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005789","kind":"concept","label":"Genealogy and Heraldry","sources":[{"id":"nlm-mesh.d005789","title":"NLM MeSH Browser descriptor D005789","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005789"}],"status":"reported","summary":"NLM MeSH describes Genealogy and Heraldry as: Descent of a person, family, or group from an ancestor and coats of arms and other armorial bearings associated with an ancestor.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006663","kind":"field","label":"Historiography","sources":[{"id":"nlm-mesh.d006663","title":"NLM MeSH Browser descriptor D006663","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006663"}],"status":"reported","summary":"NLM MeSH describes Historiography as: The writing of history; the principles, theory, and history of historical writing; the product of historical writing. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006665","kind":"concept","label":"History of Dentistry","sources":[{"id":"nlm-mesh.d006665","title":"NLM MeSH Browser descriptor D006665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006665"}],"status":"reported","summary":"NLM MeSH describes History of Dentistry as: Study of past events and development in the field of DENTISTRY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000077406","kind":"concept","label":"History of Pharmacy","sources":[{"id":"nlm-mesh.d000077406","title":"NLM MeSH Browser descriptor D000077406","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077406"}],"status":"reported","summary":"NLM MeSH describes History of Pharmacy as: Study of the origins and development of the field of PHARMACY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049690","kind":"field","label":"History, Ancient","sources":[{"id":"nlm-mesh.d049690","title":"NLM MeSH Browser descriptor D049690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049690"}],"status":"reported","summary":"NLM MeSH describes History, Ancient as: The period of history before 500 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049692","kind":"field","label":"History, Early Modern 1451-1600","sources":[{"id":"nlm-mesh.d049692","title":"NLM MeSH Browser descriptor D049692","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049692"}],"status":"reported","summary":"NLM MeSH describes History, Early Modern 1451-1600 as: The period of history from 1451 through 1600 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049691","kind":"field","label":"History, Medieval","sources":[{"id":"nlm-mesh.d049691","title":"NLM MeSH Browser descriptor D049691","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049691"}],"status":"reported","summary":"NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d049711","kind":"field","label":"History, Modern 1601-","sources":[{"id":"nlm-mesh.d049711","title":"NLM MeSH Browser descriptor D049711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D049711"}],"status":"reported","summary":"NLM MeSH describes History, Modern 1601- as: The period of history from 1601 of the common era to the present.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d006666","kind":"field","label":"History of Medicine","sources":[{"id":"nlm-mesh.d006666","title":"NLM MeSH Browser descriptor D006666","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006666"}],"status":"reported","summary":"NLM MeSH describes History of Medicine as: Study of past events and development in the field of Medicine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006676","kind":"concept","label":"History of Nursing","sources":[{"id":"nlm-mesh.d006676","title":"NLM MeSH Browser descriptor D006676","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006676"}],"status":"reported","summary":"NLM MeSH describes History of Nursing as: Study of past events and development in the field of Nursing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d019021","kind":"field","label":"Natural History","sources":[{"id":"nlm-mesh.d019021","title":"NLM MeSH Browser descriptor D019021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019021"}],"status":"reported","summary":"NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010792","kind":"field","label":"Phrenology","sources":[{"id":"nlm-mesh.d010792","title":"NLM MeSH Browser descriptor D010792","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010792"}],"status":"reported","summary":"NLM MeSH describes Phrenology as: The study of the conformation of the skull as indicative of mental faculties and traits of character, especially according to the hypothesis of F. J. Gall (1758-1828). (Webster 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d013561","kind":"concept","label":"Symbolism","sources":[{"id":"nlm-mesh.d013561","title":"NLM MeSH Browser descriptor D013561","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013561"}],"status":"reported","summary":"NLM MeSH describes Symbolism as: A concept that stands for or suggests something else by reason of its relationship, association, convention, or resemblance. The symbolism may be mental or a visible sign or representation. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d001633","kind":"concept","label":"Bible","sources":[{"id":"nlm-mesh.d001633","title":"NLM MeSH Browser descriptor D001633","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001633"}],"status":"reported","summary":"NLM MeSH describes Bible as: The book composed of writings generally accepted by Christians as inspired by God and of divine authority. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d004324","kind":"concept","label":"Drama","sources":[{"id":"nlm-mesh.d004324","title":"NLM MeSH Browser descriptor D004324","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004324"}],"status":"reported","summary":"NLM MeSH describes Drama as: A composition in prose or verse presenting in dialogue or pantomime a story involving various characters, usually intended to be acted on a stage and to be regarded as a form of entertainment. (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005495","kind":"concept","label":"Folklore","sources":[{"id":"nlm-mesh.d005495","title":"NLM MeSH Browser descriptor D005495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005495"}],"status":"reported","summary":"NLM MeSH describes Folklore as: The common orally transmitted traditions, folktales, festivals, songs, superstitions, and stories of all peoples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008092","kind":"field","label":"Literature, Medieval","sources":[{"id":"nlm-mesh.d008092","title":"NLM MeSH Browser descriptor D008092","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008092"}],"status":"reported","summary":"NLM MeSH describes Literature, Medieval as: Writings originating in the 5th century A.D. through the 15h century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008093","kind":"field","label":"Literature, Modern","sources":[{"id":"nlm-mesh.d008093","title":"NLM MeSH Browser descriptor D008093","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008093"}],"status":"reported","summary":"NLM MeSH describes Literature, Modern as: Writings originating from the 15th century A.D. to the present","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008513","kind":"field","label":"Medicine in Literature","sources":[{"id":"nlm-mesh.d008513","title":"NLM MeSH Browser descriptor D008513","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008513"}],"status":"reported","summary":"NLM MeSH describes Medicine in Literature as: Written or other literary works whose subject matter is medical or about the profession of medicine and related areas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d009229","kind":"field","label":"Mythology","sources":[{"id":"nlm-mesh.d009229","title":"NLM MeSH Browser descriptor D009229","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009229"}],"status":"reported","summary":"NLM MeSH describes Mythology as: A body of stories, the origins of which may be unknown or forgotten, that explain practices, beliefs, institutions or natural phenomena. Mythology includes legends and folk tales. It may refer to classical mythology or to a body of modern thought and modern life. (From Webster's 1st ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d000075863","kind":"field","label":"Science in Literature","sources":[{"id":"nlm-mesh.d000075863","title":"NLM MeSH Browser descriptor D000075863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075863"}],"status":"reported","summary":"NLM MeSH describes Science in Literature as: Literary works whose subject matter is science or about the profession of science and related areas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000422","kind":"concept","label":"Alchemy","sources":[{"id":"nlm-mesh.d000422","title":"NLM MeSH Browser descriptor D000422","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000422"}],"status":"reported","summary":"NLM MeSH describes Alchemy as: Form of chemistry concerned with discovering methods for transmuting base metals into gold and with finding an elixir for eternal youth.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001255","kind":"field","label":"Astrology","sources":[{"id":"nlm-mesh.d001255","title":"NLM MeSH Browser descriptor D001255","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001255"}],"status":"reported","summary":"NLM MeSH describes Astrology as: System of thought regarding forecasting of earthly and human events through the observation and interpretation of the fixed stars and planetary bodies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004954","kind":"field","label":"Esthetics","sources":[{"id":"nlm-mesh.d004954","title":"NLM MeSH Browser descriptor D004954","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004954"}],"status":"reported","summary":"NLM MeSH describes Esthetics as: The branch of philosophy dealing with the nature of the beautiful. It includes beauty, esthetic experience, esthetic judgment, esthetic aspects of medicine, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d005086","kind":"concept","label":"Existentialism","sources":[{"id":"nlm-mesh.d005086","title":"NLM MeSH Browser descriptor D005086","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005086"}],"status":"reported","summary":"NLM MeSH describes Existentialism as: Philosophy based on the analysis of the individual's existence in the world which holds that human existence cannot be completely described in scientific terms. Existentialism also stresses the freedom and responsibility of the individual as well as the uniqueness of religious and ethical experiences and the analysis of subjective phenomena such as anxiety, guilt, and suffering. (APA, Thesaurus of Psychological Index Terms, 8th ed.)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019369","kind":"concept","label":"Life","sources":[{"id":"nlm-mesh.d019369","title":"NLM MeSH Browser descriptor D019369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019369"}],"status":"reported","summary":"NLM MeSH describes Life as: The state that distinguishes organisms from inorganic matter, manifested by growth, metabolism, reproduction, and adaptation. It includes the course of existence, the sum of experiences, the mode of existing, or the fact of being. Over the centuries inquiries into the nature of life have crossed the boundaries from philosophy to biology, forensic medicine, anthropology, etc., in creative as well as scientific literature. (Random House Unabridged Dictionary, 2d ed; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d008678","kind":"field","label":"Metaphysics","sources":[{"id":"nlm-mesh.d008678","title":"NLM MeSH Browser descriptor D008678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008678"}],"status":"reported","summary":"NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009014","kind":"concept","label":"Morals","sources":[{"id":"nlm-mesh.d009014","title":"NLM MeSH Browser descriptor D009014","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009014"}],"status":"reported","summary":"NLM MeSH describes Morals as: Standards of conduct that distinguish right from wrong.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010685","kind":"field","label":"Philosophy, Dental","sources":[{"id":"nlm-mesh.d010685","title":"NLM MeSH Browser descriptor D010685","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010685"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Dental as: The underlying rationale or theoretical basis for the principles of DENTISTRY .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010686","kind":"field","label":"Philosophy, Medical","sources":[{"id":"nlm-mesh.d010686","title":"NLM MeSH Browser descriptor D010686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010686"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Medical as: The underlying rationale or theoretical basis for the principles of MEDICINE .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010687","kind":"field","label":"Philosophy, Nursing","sources":[{"id":"nlm-mesh.d010687","title":"NLM MeSH Browser descriptor D010687","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010687"}],"status":"reported","summary":"NLM MeSH describes Philosophy, Nursing as: The underlying rationale or theoretical basis for the principles of NURSING .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033302","kind":"concept","label":"Postmodernism","sources":[{"id":"nlm-mesh.d033302","title":"NLM MeSH Browser descriptor D033302","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033302"}],"status":"reported","summary":"NLM MeSH describes Postmodernism as: A late 20th-century philosophical approach or style of cultural analysis that seeks to reveal the cultural or social construction of concepts conventionally assumed to be natural or universal. (from E.R. DuBose, The Illusion of Trust: Toward a Medical Theological Ethics in the Postmodern Age, Kluwer, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019413","kind":"concept","label":"Qi","sources":[{"id":"nlm-mesh.d019413","title":"NLM MeSH Browser descriptor D019413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019413"}],"status":"reported","summary":"NLM MeSH describes Qi as: The vital life force in the body, supposedly able to be regulated by acupuncture. It corresponds roughly to the Greek pneuma, the Latin spiritus, and the ancient Indian prana. The concept of life-breath or vital energy was formulated as an indication of the awareness of man, originally directed externally toward nature or society but later turned inward to the self or life within. (From Comparison between Concepts of Life-Breath in East and West, 15th International Symposium on the Comparative History of Medicine - East and West, August 26-September 3, 1990, Shizuoka, Japan, pp. ix-x)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d014601","kind":"concept","label":"Utopias","sources":[{"id":"nlm-mesh.d014601","title":"NLM MeSH Browser descriptor D014601","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014601"}],"status":"reported","summary":"NLM MeSH describes Utopias as: Ideal perfection especially in laws, government, and social conditions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d014799","kind":"concept","label":"Vitalism","sources":[{"id":"nlm-mesh.d014799","title":"NLM MeSH Browser descriptor D014799","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014799"}],"status":"reported","summary":"NLM MeSH describes Vitalism as: The metaphysical doctrine that the functions and processes of life are due to a vital principle distinct from physicochemical forces and that the laws of physics and chemistry alone cannot explain life functions and processes. Vitalism is opposed to mechanistic materialism. The belief was that matter was divided into two classes based on behavior with respect to heat: organic and inorganic. Inorganic material could be melted but could always be recovered by removing the heat source. Organic compounds changed form upon heating and could not be recovered by removing the heat source. The proposed explanation for the difference between organic and inorganic compounds was the Vitalism Theory, which stated that inorganic materials did not contain the vital force of life.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d016709","kind":"concept","label":"Yin-Yang","sources":[{"id":"nlm-mesh.d016709","title":"NLM MeSH Browser descriptor D016709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016709"}],"status":"reported","summary":"NLM MeSH describes Yin-Yang as: In Chinese philosophy and religion, two principles, one negative, dark, and feminine (yin) and one positive, bright, and masculine (yang), from whose interaction all things are produced and all things are dissolved. As a concept the two polar elements referred originally to the shady and sunny sides of a valley or a hill but it developed into the relationship of any contrasting pair: those specified above (female-male, etc.) as well as cold-hot, wet-dry, weak-strong, etc. It is not a distinct system of thought by itself but permeates Chinese life and thought. A balance of yin and yang is essential to health. A deficiency of either principle can manifest as disease. (Encyclopedia Americana)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000887","kind":"concept","label":"Anthroposophy","sources":[{"id":"nlm-mesh.d000887","title":"NLM MeSH Browser descriptor D000887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000887"}],"status":"reported","summary":"NLM MeSH describes Anthroposophy as: Knowledge of the nature of man. A spiritual and mystical doctrine that grew out of theosophy and derives mainly from the philosophy of Rudolph Steiner, Austrian social philosopher (1861-1925). (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002016","kind":"concept","label":"Buddhism","sources":[{"id":"nlm-mesh.d002016","title":"NLM MeSH Browser descriptor D002016","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002016"}],"status":"reported","summary":"NLM MeSH describes Buddhism as: The teaching ascribed to Gautama Buddha (ca. 483 B.C.) holding that suffering is inherent in life and that one can escape it into nirvana by mental and moral self-purification. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002835","kind":"concept","label":"Christianity","sources":[{"id":"nlm-mesh.d002835","title":"NLM MeSH Browser descriptor D002835","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002835"}],"status":"reported","summary":"NLM MeSH describes Christianity as: The religion stemming from the life, teachings, and death of Jesus Christ: the religion that believes in God as the Father Almighty who works redemptively through the Holy Spirit for men's salvation and that affirms Jesus Christ as Lord and Savior who proclaimed to man the gospel of salvation. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018596","kind":"concept","label":"Hinduism","sources":[{"id":"nlm-mesh.d018596","title":"NLM MeSH Browser descriptor D018596","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018596"}],"status":"reported","summary":"NLM MeSH describes Hinduism as: A complex body of social, cultural, and religious beliefs and practices evolved in and largely confined to the Indian subcontinent and marked by a caste system, an outlook tending to view all forms and theories as aspects of one eternal being and truth, and the practice of the way of works, the way of knowledge, or the way of devotion as a means of release from the round of rebirths. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d007514","kind":"concept","label":"Islam","sources":[{"id":"nlm-mesh.d007514","title":"NLM MeSH Browser descriptor D007514","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007514"}],"status":"reported","summary":"NLM MeSH describes Islam as: A monotheistic religion promulgated by the Prophet Mohammed with Allah as the deity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d007599","kind":"concept","label":"Judaism","sources":[{"id":"nlm-mesh.d007599","title":"NLM MeSH Browser descriptor D007599","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007599"}],"status":"reported","summary":"NLM MeSH describes Judaism as: The monotheistic religion of the Jews based on the teachings of the Hebrew Scriptures (Torah).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012068","kind":"field","label":"Religion and Medicine","sources":[{"id":"nlm-mesh.d012068","title":"NLM MeSH Browser descriptor D012068","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012068"}],"status":"reported","summary":"NLM MeSH describes Religion and Medicine as: The interrelationship of medicine and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012069","kind":"field","label":"Religion and Psychology","sources":[{"id":"nlm-mesh.d012069","title":"NLM MeSH Browser descriptor D012069","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012069"}],"status":"reported","summary":"NLM MeSH describes Religion and Psychology as: The interrelationship of psychology and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d012070","kind":"field","label":"Religion and Science","sources":[{"id":"nlm-mesh.d012070","title":"NLM MeSH Browser descriptor D012070","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012070"}],"status":"reported","summary":"NLM MeSH describes Religion and Science as: The interrelationship of science and religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012071","kind":"concept","label":"Religion and Sex","sources":[{"id":"nlm-mesh.d012071","title":"NLM MeSH Browser descriptor D012071","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012071"}],"status":"reported","summary":"NLM MeSH describes Religion and Sex as: The interrelationship of religion and sexual practices and beliefs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d008921","kind":"concept","label":"Religious Missions","sources":[{"id":"nlm-mesh.d008921","title":"NLM MeSH Browser descriptor D008921","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008921"}],"status":"reported","summary":"NLM MeSH describes Religious Missions as: Programs or projects established by religious groups or institution to support and provide missionary activities, including sharing faith or providing educational, medical, or other assistance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012072","kind":"concept","label":"Religious Philosophies","sources":[{"id":"nlm-mesh.d012072","title":"NLM MeSH Browser descriptor D012072","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012072"}],"status":"reported","summary":"NLM MeSH describes Religious Philosophies as: Sets of beliefs on the nature of the universe or Man.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000716","kind":"concept","label":"Anatomy, Artistic","sources":[{"id":"nlm-mesh.d000716","title":"NLM MeSH Browser descriptor D000716","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000716"}],"status":"reported","summary":"NLM MeSH describes Anatomy, Artistic as: The study of the structures of organisms for applications in art: drawing, painting, sculpture, illustration, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019365","kind":"concept","label":"Metaphor","sources":[{"id":"nlm-mesh.d019365","title":"NLM MeSH Browser descriptor D019365","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019365"}],"status":"reported","summary":"NLM MeSH describes Metaphor as: The application of a concept to that which it is not literally the same but which suggests a resemblance and comparison. Medical metaphors were widespread in ancient literature; the description of a sick body was often used by ancient writers to define a critical condition of the State, in which one corrupt part can ruin the entire system. (From Med Secoli Arte Sci, 1990;2(3):abstract 331)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d066291","kind":"field","label":"Psychiatry in Literature","sources":[{"id":"nlm-mesh.d066291","title":"NLM MeSH Browser descriptor D066291","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066291"}],"status":"reported","summary":"NLM MeSH describes Psychiatry in Literature as: Written or other literary works whose subject matter is related to mental disorders or psychiatry from the lay or practitioner perspective.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010681","kind":"field","label":"Philology, Classical","sources":[{"id":"nlm-mesh.d010681","title":"NLM MeSH Browser descriptor D010681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010681"}],"status":"reported","summary":"NLM MeSH describes Philology, Classical as: The study of ancient Greek and Roman literature, including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010682","kind":"field","label":"Philology, Oriental","sources":[{"id":"nlm-mesh.d010682","title":"NLM MeSH Browser descriptor D010682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010682"}],"status":"reported","summary":"NLM MeSH describes Philology, Oriental as: The study of literature written in languages of Asia and the Far East, including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d010683","kind":"field","label":"Philology, Romance","sources":[{"id":"nlm-mesh.d010683","title":"NLM MeSH Browser descriptor D010683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010683"}],"status":"reported","summary":"NLM MeSH describes Philology, Romance as: The study of literature written in the Romance languages (French, Spanish, Italian, and others descended from Latin), including grammar, etymology, criticism, literary history, and language and linguistic history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d001504","kind":"concept","label":"Beauty","sources":[{"id":"nlm-mesh.d001504","title":"NLM MeSH Browser descriptor D001504","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001504"}],"status":"reported","summary":"NLM MeSH describes Beauty as: Characteristics or attributes of persons or things which elicit pleasurable feelings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033421","kind":"concept","label":"Beginning of Human Life","sources":[{"id":"nlm-mesh.d033421","title":"NLM MeSH Browser descriptor D033421","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033421"}],"status":"reported","summary":"NLM MeSH describes Beginning of Human Life as: The point at which religious ensoulment or PERSONHOOD is considered to begin.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026712","kind":"concept","label":"Value of Life","sources":[{"id":"nlm-mesh.d026712","title":"NLM MeSH Browser descriptor D026712","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026712"}],"status":"reported","summary":"NLM MeSH describes Value of Life as: The intrinsic moral worth ascribed to a living being. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d017143","kind":"concept","label":"Fuzzy Logic","sources":[{"id":"nlm-mesh.d017143","title":"NLM MeSH Browser descriptor D017143","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017143"}],"status":"reported","summary":"NLM MeSH describes Fuzzy Logic as: Approximate, quantitative reasoning that is concerned with the linguistic ambiguity which exists in natural or synthetic language. At its core are variables such as good, bad, and young as well as modifiers such as more, less, and very. These ordinary terms represent fuzzy sets in a particular problem. Fuzzy logic plays a key role in many medical expert systems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d003242","kind":"concept","label":"Conscience","sources":[{"id":"nlm-mesh.d003242","title":"NLM MeSH Browser descriptor D003242","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003242"}],"status":"reported","summary":"NLM MeSH describes Conscience as: The cognitive and affective processes which constitute an internalized moral governor over an individual's moral conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004989","kind":"field","label":"Ethics","sources":[{"id":"nlm-mesh.d004989","title":"NLM MeSH Browser descriptor D004989","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004989"}],"status":"reported","summary":"NLM MeSH describes Ethics as: The philosophy or code pertaining to what is ideal in human character and conduct. Also, the field of study dealing with the principles of morality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035863","kind":"concept","label":"Moral Development","sources":[{"id":"nlm-mesh.d035863","title":"NLM MeSH Browser descriptor D035863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035863"}],"status":"reported","summary":"NLM MeSH describes Moral Development as: The process by which individuals internalize standards of right and wrong conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012941","kind":"concept","label":"Social Responsibility","sources":[{"id":"nlm-mesh.d012941","title":"NLM MeSH Browser descriptor D012941","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012941"}],"status":"reported","summary":"NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028722","kind":"concept","label":"Virtues","sources":[{"id":"nlm-mesh.d028722","title":"NLM MeSH Browser descriptor D028722","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028722"}],"status":"reported","summary":"NLM MeSH describes Virtues as: Character traits that are considered to be morally praiseworthy. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004990","kind":"field","label":"Ethics, Dental","sources":[{"id":"nlm-mesh.d004990","title":"NLM MeSH Browser descriptor D004990","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004990"}],"status":"reported","summary":"NLM MeSH describes Ethics, Dental as: The principles of proper professional conduct concerning the rights and duties of the dentist, relations with patients and fellow practitioners, as well as actions of the dentist in patient care and interpersonal relations with patient families. (From Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019348","kind":"concept","label":"Empiricism","sources":[{"id":"nlm-mesh.d019348","title":"NLM MeSH Browser descriptor D019348","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019348"}],"status":"reported","summary":"NLM MeSH describes Empiricism as: One of the principal schools of medical philosophy in ancient Greece and Rome. It developed in Alexandria between 270 and 220 B.C., the only one to have any success in reviving the essentials of the Hippocratic concept. The Empiricists declared that the search for ultimate causes of phenomena was vain, but they were active in endeavoring to discover immediate causes. The tripod of the Empirics was their own chance observations (experience), learning obtained from contemporaries and predecessors (experience of others), and, in the case of new diseases, the formation of conclusions from other diseases which they resembled (analogy). Empiricism enjoyed sporadic continuing popularity in later centuries up to the nineteenth. (From Castiglioni, A History of Medicine, 2d ed, p186; Dr. James H. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006694","kind":"concept","label":"Holistic Health","sources":[{"id":"nlm-mesh.d006694","title":"NLM MeSH Browser descriptor D006694","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006694"}],"status":"reported","summary":"NLM MeSH describes Holistic Health as: Health as viewed from the perspective that humans function as complete, integrated units rather than as aggregates of separate parts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019364","kind":"concept","label":"Humoralism","sources":[{"id":"nlm-mesh.d019364","title":"NLM MeSH Browser descriptor D019364","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019364"}],"status":"reported","summary":"NLM MeSH describes Humoralism as: An ancient Greek medical theory that health and illness result from a balance or imbalance of body fluids or humors. The humors are blood, phlegm, yellow bile, and black bile.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d061148","kind":"concept","label":"Hygiene Hypothesis","sources":[{"id":"nlm-mesh.d061148","title":"NLM MeSH Browser descriptor D061148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D061148"}],"status":"reported","summary":"NLM MeSH describes Hygiene Hypothesis as: The theory that infectious agents, symbiotic microorganisms, and parasites are normal stimulants for the maturation of the immune system toward a balanced immune response. The theory predicts that lack of such stimulation leads to allergies and AUTOIMMUNE DISEASES .","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004993","kind":"field","label":"Ethics, Nursing","sources":[{"id":"nlm-mesh.d004993","title":"NLM MeSH Browser descriptor D004993","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004993"}],"status":"reported","summary":"NLM MeSH describes Ethics, Nursing as: The principles of proper professional conduct concerning the rights and duties of nurses themselves, their patients, and their fellow practitioners, as well as their actions in the care of patients and in relations with their families.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018939","kind":"concept","label":"Holistic Nursing","sources":[{"id":"nlm-mesh.d018939","title":"NLM MeSH Browser descriptor D018939","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018939"}],"status":"reported","summary":"NLM MeSH describes Holistic Nursing as: A philosophy of nursing practice that takes into account total patient care, considering the physical, emotional, social, economic, and spiritual needs of patients, their response to their illnesses, and the effect of illness on patients' abilities to meet self-care needs. (From Mosby's Medical, Nursing, & Allied Health Dictionary, 4th ed, p745)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d002410","kind":"concept","label":"Catholicism","sources":[{"id":"nlm-mesh.d002410","title":"NLM MeSH Browser descriptor D002410","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002410"}],"status":"reported","summary":"NLM MeSH describes Catholicism as: The Christian faith, practice, or system of the Catholic Church, specifically the Roman Catholic, the Christian church that is characterized by a hierarchic structure of bishops and priests in which doctrinal and disciplinary authority are dependent upon apostolic succession, with the pope as head of the episcopal college. (From Webster, 3d ed; American Heritage Dictionary, 2d college ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d002834","kind":"field","label":"Christian Science","sources":[{"id":"nlm-mesh.d002834","title":"NLM MeSH Browser descriptor D002834","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002834"}],"status":"reported","summary":"NLM MeSH describes Christian Science as: A religion founded by Mary Baker Eddy in 1866 that was organized under the official name of the Church of Christ, Scientist. It includes the practice of spiritual healing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d034682","kind":"concept","label":"Church of Jesus Christ of Latter-day Saints","sources":[{"id":"nlm-mesh.d034682","title":"NLM MeSH Browser descriptor D034682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034682"}],"status":"reported","summary":"NLM MeSH describes Church of Jesus Christ of Latter-day Saints as: A group of religious bodies tracing their origin to Joseph Smith in 1830 and accepting the Book of Mormon as divine revelation. (from Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033003","kind":"concept","label":"Eastern Orthodoxy","sources":[{"id":"nlm-mesh.d033003","title":"NLM MeSH Browser descriptor D033003","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033003"}],"status":"reported","summary":"NLM MeSH describes Eastern Orthodoxy as: The name given to the religion of the body of modern churches, including among others the Greek and Russian Orthodox, that is derived from the church of the Byzantine Empire, adheres to the Byzantine rite, and acknowledges the honorary primacy of the patriarch of Constantinople. (from American Heritage Dictionary of the English Language, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033303","kind":"concept","label":"Protestantism","sources":[{"id":"nlm-mesh.d033303","title":"NLM MeSH Browser descriptor D033303","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033303"}],"status":"reported","summary":"NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d018597","kind":"concept","label":"Saints","sources":[{"id":"nlm-mesh.d018597","title":"NLM MeSH Browser descriptor D018597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018597"}],"status":"reported","summary":"NLM MeSH describes Saints as: Persons officially recognized or acknowledged as pre-eminent for consecration, holiness, and piety, especially through canonization by a branch of the Christian church. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000067496","kind":"concept","label":"Spirit Possession","sources":[{"id":"nlm-mesh.d000067496","title":"NLM MeSH Browser descriptor D000067496","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067496"}],"status":"reported","summary":"NLM MeSH describes Spirit Possession as: The idea that abnormal behavior or a medical condition is evidence that a person is under the control of a supernatural power or spirit. This belief was most commonly held in religion and medicine of the medieval period and is also held in many tribal cultures today.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d029181","kind":"concept","label":"Spirituality","sources":[{"id":"nlm-mesh.d029181","title":"NLM MeSH Browser descriptor D029181","url":"https://meshb.nlm.nih.gov/record/ui?ui=D029181"}],"status":"reported","summary":"NLM MeSH describes Spirituality as: Sensitivity or attachment to religious values, or to things of the spirit as opposed to material or worldly interests. (from Merriam-Webster's Collegiate Dictionary, 10th ed, and Oxford English Dictionary, 2nd ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d032903","kind":"concept","label":"Confucianism","sources":[{"id":"nlm-mesh.d032903","title":"NLM MeSH Browser descriptor D032903","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032903"}],"status":"reported","summary":"NLM MeSH describes Confucianism as: A school of thought and set of moral, ethical, and political teachings usually considered to be founded by Confucius in 6th-5th century B.C. China. (from Cambridge Dictionary of Philosophy, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d009228","kind":"concept","label":"Mysticism","sources":[{"id":"nlm-mesh.d009228","title":"NLM MeSH Browser descriptor D009228","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009228"}],"status":"reported","summary":"NLM MeSH describes Mysticism as: A philosophy based upon spiritual intuition that is believed to transcend ordinary sensory experiences or understanding.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d013140","kind":"concept","label":"Spiritualism","sources":[{"id":"nlm-mesh.d013140","title":"NLM MeSH Browser descriptor D013140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013140"}],"status":"reported","summary":"NLM MeSH describes Spiritualism as: Religious philosophy expressing the fundamental belief that departed spirits may be contacted by the living through a medium.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d015013","kind":"concept","label":"Yoga","sources":[{"id":"nlm-mesh.d015013","title":"NLM MeSH Browser descriptor D015013","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015013"}],"status":"reported","summary":"NLM MeSH describes Yoga as: A major orthodox system of Hindu philosophy based on Sankhya (metaphysical dualism) but differing from it in being theistic and characterized by the teaching of raja-yoga as a practical method of liberating the self. It includes a system of exercises for attaining bodily or mental control and well-being with liberation of the self and union with the universal spirit. (From Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d012942","kind":"field","label":"Social Sciences","sources":[{"id":"nlm-mesh.d012942","title":"NLM MeSH Browser descriptor D012942","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012942"}],"status":"reported","summary":"NLM MeSH describes Social Sciences as: Disciplines concerned with the interrelationships of individuals in a social environment including social organizations and institutions. Includes Sociology and Anthropology.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004779","kind":"concept","label":"Environment Design","sources":[{"id":"nlm-mesh.d004779","title":"NLM MeSH Browser descriptor D004779","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004779"}],"status":"reported","summary":"NLM MeSH describes Environment Design as: The structuring of the environment to permit or promote specific patterns of behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005544","kind":"concept","label":"Forecasting","sources":[{"id":"nlm-mesh.d005544","title":"NLM MeSH Browser descriptor D005544","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005544"}],"status":"reported","summary":"NLM MeSH describes Forecasting as: The prediction or projection of the nature of future problems or existing conditions based upon the extrapolation or interpretation of existing scientific data or by the application of scientific methodology.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006076","kind":"concept","label":"Government","sources":[{"id":"nlm-mesh.d006076","title":"NLM MeSH Browser descriptor D006076","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006076"}],"status":"reported","summary":"NLM MeSH describes Government as: The complex of political institutions, laws, and customs through which the function of governing is carried out in a specific political unit.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006078","kind":"concept","label":"Government Programs","sources":[{"id":"nlm-mesh.d006078","title":"NLM MeSH Browser descriptor D006078","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006078"}],"status":"reported","summary":"NLM MeSH describes Government Programs as: Programs and activities sponsored or administered by local, state, or national governments.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d038622","kind":"concept","label":"Internationality","sources":[{"id":"nlm-mesh.d038622","title":"NLM MeSH Browser descriptor D038622","url":"https://meshb.nlm.nih.gov/record/ui?ui=D038622"}],"status":"reported","summary":"NLM MeSH describes Internationality as: The quality or state of relating to or affecting two or more nations. (After Merriam-Webster Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057766","kind":"concept","label":"Policy","sources":[{"id":"nlm-mesh.d057766","title":"NLM MeSH Browser descriptor D057766","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057766"}],"status":"reported","summary":"NLM MeSH describes Policy as: A course or method of action selected to guide and determine present and future decisions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011056","kind":"concept","label":"Political Systems","sources":[{"id":"nlm-mesh.d011056","title":"NLM MeSH Browser descriptor D011056","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011056"}],"status":"reported","summary":"NLM MeSH describes Political Systems as: The units based on political theory and chosen by countries under which their governmental power is organized and administered to their citizens.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011057","kind":"field","label":"Politics","sources":[{"id":"nlm-mesh.d011057","title":"NLM MeSH Browser descriptor D011057","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011057"}],"status":"reported","summary":"NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017149","kind":"concept","label":"Private Sector","sources":[{"id":"nlm-mesh.d017149","title":"NLM MeSH Browser descriptor D017149","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017149"}],"status":"reported","summary":"NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017150","kind":"concept","label":"Public Sector","sources":[{"id":"nlm-mesh.d017150","title":"NLM MeSH Browser descriptor D017150","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017150"}],"status":"reported","summary":"NLM MeSH describes Public Sector as: The area of a nation's economy that is tax-supported and under government control.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011788","kind":"concept","label":"Quality of Life","sources":[{"id":"nlm-mesh.d011788","title":"NLM MeSH Browser descriptor D011788","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011788"}],"status":"reported","summary":"NLM MeSH describes Quality of Life as: A generic concept reflecting concern with the modification and enhancement of life attributes, e.g., physical, political, moral, social environment as well as health and disease.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000072358","kind":"concept","label":"Work-Life Balance","sources":[{"id":"nlm-mesh.d000072358","title":"NLM MeSH Browser descriptor D000072358","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072358"}],"status":"reported","summary":"NLM MeSH describes Work-Life Balance as: Complex ongoing balance between a person's working life and private life.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d060432","kind":"field","label":"Anthropology, Medical","sources":[{"id":"nlm-mesh.d060432","title":"NLM MeSH Browser descriptor D060432","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060432"}],"status":"reported","summary":"NLM MeSH describes Anthropology, Medical as: Field of social science that is concerned with differences between human groups as related to health status and beliefs.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000091702","kind":"concept","label":"Intersectional Framework","sources":[{"id":"nlm-mesh.d000091702","title":"NLM MeSH Browser descriptor D000091702","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091702"}],"status":"reported","summary":"NLM MeSH describes Intersectional Framework as: Interconnections of social categorizations such as race, class, and gender, creating overlapping and interdependent systems of discrimination or disadvantage.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097822","kind":"concept","label":"Media Exposure","sources":[{"id":"nlm-mesh.d000097822","title":"NLM MeSH Browser descriptor D000097822","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097822"}],"status":"reported","summary":"NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d012962","kind":"field","label":"Sociology, Medical","sources":[{"id":"nlm-mesh.d012962","title":"NLM MeSH Browser descriptor D012962","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012962"}],"status":"reported","summary":"NLM MeSH describes Sociology, Medical as: The study of the social determinants and social effects of health and disease, and of the social structure of medical institutions or professions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003415","kind":"concept","label":"Crime","sources":[{"id":"nlm-mesh.d003415","title":"NLM MeSH Browser descriptor D003415","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003415"}],"status":"reported","summary":"NLM MeSH describes Crime as: A violation of the criminal law, i.e., a breach of the conduct code specifically sanctioned by the state, which through its administrative agencies prosecutes offenders and imposes and administers punishments. The concept includes unacceptable actions whether prosecuted or going unpunished.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d003416","kind":"field","label":"Criminal Law","sources":[{"id":"nlm-mesh.d003416","title":"NLM MeSH Browser descriptor D003416","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003416"}],"status":"reported","summary":"NLM MeSH describes Criminal Law as: A branch of law that defines criminal offenses, regulates the apprehension, charging and trial of suspected persons, and fixes the penalties and modes of treatment applicable to convicted offenders.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d044707","kind":"field","label":"Forensic Sciences","sources":[{"id":"nlm-mesh.d044707","title":"NLM MeSH Browser descriptor D044707","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044707"}],"status":"reported","summary":"NLM MeSH describes Forensic Sciences as: Disciplines that apply sciences to law. Forensic sciences include a wide range of disciplines, such as FORENSIC TOXICOLOGY ; FORENSIC ANTHROPOLOGY ; FORENSIC MEDICINE ; FORENSIC DENTISTRY ; and others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017677","kind":"concept","label":"Age Distribution","sources":[{"id":"nlm-mesh.d017677","title":"NLM MeSH Browser descriptor D017677","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017677"}],"status":"reported","summary":"NLM MeSH describes Age Distribution as: The frequency of different ages or age groups in a given population. The distribution may refer to either how many or what proportion of the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019352","kind":"concept","label":"Censuses","sources":[{"id":"nlm-mesh.d019352","title":"NLM MeSH Browser descriptor D019352","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019352"}],"status":"reported","summary":"NLM MeSH describes Censuses as: Enumerations of populations usually recording identities of all persons in every place of residence with age or date of birth, sex, occupation, national origin, language, marital status, income, relation to head of household, information on the dwelling place, education, literacy, health-related data (e.g., permanent disability), etc. The census or numbering of the people is mentioned several times in the Old Testament. Among the Romans, censuses were intimately connected with the enumeration of troops before and after battle and probably a military necessity. (From Last, A Dictionary of Epidemiology, 3d ed; Garrison, An Introduction to the History of Medicine, 4th ed, p66, p119)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d005191","kind":"field","label":"Family Characteristics","sources":[{"id":"nlm-mesh.d005191","title":"NLM MeSH Browser descriptor D005191","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005191"}],"status":"reported","summary":"NLM MeSH describes Family Characteristics as: Size and composition of the family.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006304","kind":"concept","label":"Health Status","sources":[{"id":"nlm-mesh.d006304","title":"NLM MeSH Browser descriptor D006304","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006304"}],"status":"reported","summary":"NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011157","kind":"field","label":"Population Dynamics","sources":[{"id":"nlm-mesh.d011157","title":"NLM MeSH Browser descriptor D011157","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011157"}],"status":"reported","summary":"NLM MeSH describes Population Dynamics as: The pattern of any process, or the interrelationship of phenomena, which affects growth or change within a population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017678","kind":"concept","label":"Sex Distribution","sources":[{"id":"nlm-mesh.d017678","title":"NLM MeSH Browser descriptor D017678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017678"}],"status":"reported","summary":"NLM MeSH describes Sex Distribution as: The number of males and females in a given population. The distribution may refer to how many men or women or what proportion of either in the group. The population is usually patients with a specific disease but the concept is not restricted to humans and is not restricted to medicine.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d030861","kind":"concept","label":"Capitalism","sources":[{"id":"nlm-mesh.d030861","title":"NLM MeSH Browser descriptor D030861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D030861"}],"status":"reported","summary":"NLM MeSH describes Capitalism as: A political and economic system characterized by individual rights, by private or corporate ownership of capital goods, and by prices, production, and the distribution of goods that are determined mainly by competition in a free market. (From Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057217","kind":"concept","label":"Economic Development","sources":[{"id":"nlm-mesh.d057217","title":"NLM MeSH Browser descriptor D057217","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057217"}],"status":"reported","summary":"NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057172","kind":"concept","label":"Economic Recession","sources":[{"id":"nlm-mesh.d057172","title":"NLM MeSH Browser descriptor D057172","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057172"}],"status":"reported","summary":"NLM MeSH describes Economic Recession as: Significant decline in economic activity spread across the economy, lasting more than a few months, normally visible in real gross domestic product, real income, employment, industrial production, and wholesale-retail sales. (National Bureau of Economic Research, Inc, www.nber.org/cycles.html, accessed 4/23/2009)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070337","kind":"concept","label":"Expropriation","sources":[{"id":"nlm-mesh.d000070337","title":"NLM MeSH Browser descriptor D000070337","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070337"}],"status":"reported","summary":"NLM MeSH describes Expropriation as: Taking of goods, property, or right of use by GOVERNMENT or others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d059066","kind":"concept","label":"Gross Domestic Product","sources":[{"id":"nlm-mesh.d059066","title":"NLM MeSH Browser descriptor D059066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059066"}],"status":"reported","summary":"NLM MeSH describes Gross Domestic Product as: Value of all final goods and services produced in a country in one year.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040841","kind":"concept","label":"Resource Allocation","sources":[{"id":"nlm-mesh.d040841","title":"NLM MeSH Browser descriptor D040841","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040841"}],"status":"reported","summary":"NLM MeSH describes Resource Allocation as: Societal or individual decisions about the equitable distribution of available resources.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000080562","kind":"concept","label":"Universal Design","sources":[{"id":"nlm-mesh.d000080562","title":"NLM MeSH Browser descriptor D000080562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080562"}],"status":"reported","summary":"NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000090082","kind":"concept","label":"Climate Models","sources":[{"id":"nlm-mesh.d000090082","title":"NLM MeSH Browser descriptor D000090082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090082"}],"status":"reported","summary":"NLM MeSH describes Climate Models as: Computer representations that simulate or predict the behavior or activity of WEATHER systems, processes, or phenomena.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000069457","kind":"concept","label":"Population Forecast","sources":[{"id":"nlm-mesh.d000069457","title":"NLM MeSH Browser descriptor D000069457","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069457"}],"status":"reported","summary":"NLM MeSH describes Population Forecast as: Estimates of projected population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d035082","kind":"concept","label":"Federal Government","sources":[{"id":"nlm-mesh.d035082","title":"NLM MeSH Browser descriptor D035082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035082"}],"status":"reported","summary":"NLM MeSH describes Federal Government as: The level of governmental organization and function at the national or country-wide level.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006077","kind":"concept","label":"Government Agencies","sources":[{"id":"nlm-mesh.d006077","title":"NLM MeSH Browser descriptor D006077","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006077"}],"status":"reported","summary":"NLM MeSH describes Government Agencies as: Administrative units of government responsible for policy making and management of governmental activities.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009111","kind":"concept","label":"Local Government","sources":[{"id":"nlm-mesh.d009111","title":"NLM MeSH Browser descriptor D009111","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009111"}],"status":"reported","summary":"NLM MeSH describes Local Government as: Smallest political subdivisions within a country at which general governmental functions are carried-out.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013219","kind":"concept","label":"State Government","sources":[{"id":"nlm-mesh.d013219","title":"NLM MeSH Browser descriptor D013219","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013219"}],"status":"reported","summary":"NLM MeSH describes State Government as: The level of governmental organization and function below that of the national or country-wide government.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002959","kind":"concept","label":"Civil Defense","sources":[{"id":"nlm-mesh.d002959","title":"NLM MeSH Browser descriptor D002959","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002959"}],"status":"reported","summary":"NLM MeSH describes Civil Defense as: Preventive emergency measures and programs designed to protect the individual or community in times of hostile attack or natural disaster.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011177","kind":"concept","label":"Postal Service","sources":[{"id":"nlm-mesh.d011177","title":"NLM MeSH Browser descriptor D011177","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011177"}],"status":"reported","summary":"NLM MeSH describes Postal Service as: The functions and activities carried out by the U.S. Postal Service, foreign postal services, and private postal services such as Federal Express.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007391","kind":"concept","label":"International Cooperation","sources":[{"id":"nlm-mesh.d007391","title":"NLM MeSH Browser descriptor D007391","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007391"}],"status":"reported","summary":"NLM MeSH describes International Cooperation as: The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070586","kind":"concept","label":"Fiscal Policy","sources":[{"id":"nlm-mesh.d000070586","title":"NLM MeSH Browser descriptor D000070586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070586"}],"status":"reported","summary":"NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011049","kind":"concept","label":"Social Control Policies","sources":[{"id":"nlm-mesh.d011049","title":"NLM MeSH Browser descriptor D011049","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011049"}],"status":"reported","summary":"NLM MeSH describes Social Control Policies as: Decisions for determining and guiding present and future objectives from among alternatives.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000072698","kind":"concept","label":"Apartheid","sources":[{"id":"nlm-mesh.d000072698","title":"NLM MeSH Browser descriptor D000072698","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072698"}],"status":"reported","summary":"NLM MeSH describes Apartheid as: A former political system in SOUTH AFRICA which enforced segregation in all forms, including physical, political, legal and economic discrimination, against all non-white, non-European racial groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d018595","kind":"concept","label":"Colonialism","sources":[{"id":"nlm-mesh.d018595","title":"NLM MeSH Browser descriptor D018595","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018595"}],"status":"reported","summary":"NLM MeSH describes Colonialism as: The aggregate of various economic, political, and social policies by which an imperial power maintains or extends its control over other areas or peoples. It includes the practice of or belief in acquiring and retaining colonies. The emphasis is less on its identity as an ideological political system than on its designation in a period of history. (Webster, 3d ed; from Dr. J. Cassedy, NLM History of Medicine Division)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003148","kind":"concept","label":"Communism","sources":[{"id":"nlm-mesh.d003148","title":"NLM MeSH Browser descriptor D003148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003148"}],"status":"reported","summary":"NLM MeSH describes Communism as: A totalitarian system of government in which a single authoritarian party controls state-owned means of production with the professed aim of establishing a classless society.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003709","kind":"concept","label":"Democracy","sources":[{"id":"nlm-mesh.d003709","title":"NLM MeSH Browser descriptor D003709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003709"}],"status":"reported","summary":"NLM MeSH describes Democracy as: A system of government in which there is free and equal participation by the people in the political decision-making process.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074440","kind":"concept","label":"Fascism","sources":[{"id":"nlm-mesh.d000074440","title":"NLM MeSH Browser descriptor D000074440","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074440"}],"status":"reported","summary":"NLM MeSH describes Fascism as: Political movement which combines nationalism with demands for political and social renewal. Characteristics include militaristic nationalism, belief in a natural social hierarchy and the rule of elites, and the desire to create a “people’s community”, in which individual interests would be subordinated to the good of the nation. (From www.britannica.com/topic/fascism)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d028683","kind":"concept","label":"National Socialism","sources":[{"id":"nlm-mesh.d028683","title":"NLM MeSH Browser descriptor D028683","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028683"}],"status":"reported","summary":"NLM MeSH describes National Socialism as: The doctrines and policies of the Nazis or the National Social German Workers party, which ruled Germany under Adolf Hitler from 1933-1945. These doctrines and policies included racist nationalism, expansionism, and state control of the economy. (from Columbia Encyclopedia, 6th ed. and American Heritage College Dictionary, 3d ed.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012950","kind":"concept","label":"Socialism","sources":[{"id":"nlm-mesh.d012950","title":"NLM MeSH Browser descriptor D012950","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012950"}],"status":"reported","summary":"NLM MeSH describes Socialism as: A system of government in which means of production and distribution of goods are controlled by the state.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067551","kind":"concept","label":"Diplomacy","sources":[{"id":"nlm-mesh.d000067551","title":"NLM MeSH Browser descriptor D000067551","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067551"}],"status":"reported","summary":"NLM MeSH describes Diplomacy as: The art and practice of conducting negotiations between people, nations or other parties such as organizations.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000088724","kind":"concept","label":"Environmentalism","sources":[{"id":"nlm-mesh.d000088724","title":"NLM MeSH Browser descriptor D000088724","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088724"}],"status":"reported","summary":"NLM MeSH describes Environmentalism as: Advocacy for the preservation, restoration, or improvement of the natural environment. It aims to reduce the impact of human activities on the earth and its inhabitants.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d008119","kind":"concept","label":"Lobbying","sources":[{"id":"nlm-mesh.d008119","title":"NLM MeSH Browser descriptor D008119","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008119"}],"status":"reported","summary":"NLM MeSH describes Lobbying as: A process whereby representatives of a particular interest group attempt to influence governmental decision makers to accept the policy desires of the lobbying organization.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074439","kind":"concept","label":"Political Activism","sources":[{"id":"nlm-mesh.d000074439","title":"NLM MeSH Browser descriptor D000074439","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074439"}],"status":"reported","summary":"NLM MeSH describes Political Activism as: Active involvement in the political process including promoting, impeding or raising awareness of a certain issue or set of issues.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000099075","kind":"concept","label":"Politicization","sources":[{"id":"nlm-mesh.d000099075","title":"NLM MeSH Browser descriptor D000099075","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099075"}],"status":"reported","summary":"NLM MeSH describes Politicization as: Generally an issue or an institution emerging into the sphere of politics such as making previously unpolitical matters political. (Tandfonline.com/doi/full/10.1080/13501763.2019.1619188)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000073597","kind":"concept","label":"Stakeholder Participation","sources":[{"id":"nlm-mesh.d000073597","title":"NLM MeSH Browser descriptor D000073597","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073597"}],"status":"reported","summary":"NLM MeSH describes Stakeholder Participation as: A process between an entity and those groups or individuals potentially or actually impacted by the actions of that entity over a range of activities and approaches.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000096264","kind":"concept","label":"Voting","sources":[{"id":"nlm-mesh.d000096264","title":"NLM MeSH Browser descriptor D000096264","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096264"}],"status":"reported","summary":"NLM MeSH describes Voting as: Method by which an individual or a group, such as in a meeting or an electorate, can engage for the purpose of making a collective decision or expressing an opinion.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000070100","kind":"concept","label":"Informal Sector","sources":[{"id":"nlm-mesh.d000070100","title":"NLM MeSH Browser descriptor D000070100","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070100"}],"status":"reported","summary":"NLM MeSH describes Informal Sector as: A component of the private sector characterized by ease of entry; reliance on indigenous resources; family ownership; small scale operations; skills acquired outside of the formal sector; and unregulated markets.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000092862","kind":"concept","label":"Psychological Well-Being","sources":[{"id":"nlm-mesh.d000092862","title":"NLM MeSH Browser descriptor D000092862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092862"}],"status":"reported","summary":"NLM MeSH describes Psychological Well-Being as: Condition of existence, or state of awareness, in which psychological needs are satisfied","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000024","kind":"concept","label":"Abortion, Illegal","sources":[{"id":"nlm-mesh.d000024","title":"NLM MeSH Browser descriptor D000024","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000024"}],"status":"reported","summary":"NLM MeSH describes Abortion, Illegal as: Illegal termination of pregnancy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075066","kind":"concept","label":"Body Packing","sources":[{"id":"nlm-mesh.d000075066","title":"NLM MeSH Browser descriptor D000075066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075066"}],"status":"reported","summary":"NLM MeSH describes Body Packing as: Concealing of drugs within the gastrointestinal tract or other body orifice for purposes of DRUG SMUGGLING or to avoid detection by law enforcement. Contraband other than drugs is also sometimes smuggled this way.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d056146","kind":"concept","label":"Corpse Dismemberment","sources":[{"id":"nlm-mesh.d056146","title":"NLM MeSH Browser descriptor D056146","url":"https://meshb.nlm.nih.gov/record/ui?ui=D056146"}],"status":"reported","summary":"NLM MeSH describes Corpse Dismemberment as: Disjoining the limbs or other parts of a corpse, often in association with criminal acts.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067448","kind":"concept","label":"Defamation","sources":[{"id":"nlm-mesh.d000067448","title":"NLM MeSH Browser descriptor D000067448","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067448"}],"status":"reported","summary":"NLM MeSH describes Defamation as: Public false statements that are illegal and damaging to the reputation of a person, group, business, organization, or institution.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064423","kind":"concept","label":"Drug Trafficking","sources":[{"id":"nlm-mesh.d064423","title":"NLM MeSH Browser descriptor D064423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064423"}],"status":"reported","summary":"NLM MeSH describes Drug Trafficking as: The illegal acquisition, sale, production, transport, movement, and distribution of controlled substances such as narcotics.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078625","kind":"concept","label":"Euthanasia, Involuntary","sources":[{"id":"nlm-mesh.d000078625","title":"NLM MeSH Browser descriptor D000078625","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078625"}],"status":"reported","summary":"NLM MeSH describes Euthanasia, Involuntary as: The act or practice of killing or withholding life-sustaining treatment from a person with a medical condition, especially PERSONS WITH DISABILITIES , without INFORMED CONSENT , despite the MENTAL COMPETENCY of the person to give consent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005607","kind":"concept","label":"Fraud","sources":[{"id":"nlm-mesh.d005607","title":"NLM MeSH Browser descriptor D005607","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005607"}],"status":"reported","summary":"NLM MeSH describes Fraud as: Exploitation through misrepresentation of the facts or concealment of the purposes of the exploiter.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019356","kind":"concept","label":"Grave Robbing","sources":[{"id":"nlm-mesh.d019356","title":"NLM MeSH Browser descriptor D019356","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019356"}],"status":"reported","summary":"NLM MeSH describes Grave Robbing as: Stealing of corpses after burial, especially for medical dissection. In the late 18th and early 19th centuries, in the absence of laws governing the acquisition of dissecting material for the study of anatomy, the needs of anatomy classes were met by surreptitious methods: body-snatching and grave robbing. (Random House Unabridged Dictionary, 2d ed; from Garrison, An Introduction to the History of Medicine, 4th ed, p447; from Castiglioni, A History of Medicine, 2d ed, p676)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006708","kind":"concept","label":"Homicide","sources":[{"id":"nlm-mesh.d006708","title":"NLM MeSH Browser descriptor D006708","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006708"}],"status":"reported","summary":"NLM MeSH describes Homicide as: The killing of one person by another.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097824","kind":"concept","label":"Medical Neglect","sources":[{"id":"nlm-mesh.d000097824","title":"NLM MeSH Browser descriptor D000097824","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097824"}],"status":"reported","summary":"NLM MeSH describes Medical Neglect as: Failure to seek timely and appropriate care or allow such care for medical, dental or psychological needs by family members, legal guardian and other caregivers. Negligence by professionals is PROFESSIONAL NEGLIGENCE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064226","kind":"concept","label":"Prescription Drug Diversion","sources":[{"id":"nlm-mesh.d064226","title":"NLM MeSH Browser descriptor D064226","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064226"}],"status":"reported","summary":"NLM MeSH describes Prescription Drug Diversion as: The transfer of prescription drugs from legal to illegal distribution and marketing networks.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075665","kind":"concept","label":"Recidivism","sources":[{"id":"nlm-mesh.d000075665","title":"NLM MeSH Browser descriptor D000075665","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075665"}],"status":"reported","summary":"NLM MeSH describes Recidivism as: Repeated criminal behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012742","kind":"concept","label":"Sex Offenses","sources":[{"id":"nlm-mesh.d012742","title":"NLM MeSH Browser descriptor D012742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012742"}],"status":"reported","summary":"NLM MeSH describes Sex Offenses as: Any violation of established legal or moral codes in respect to sexual behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013800","kind":"concept","label":"Theft","sources":[{"id":"nlm-mesh.d013800","title":"NLM MeSH Browser descriptor D013800","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013800"}],"status":"reported","summary":"NLM MeSH describes Theft as: Unlawful act of taking property.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014754","kind":"concept","label":"Violence","sources":[{"id":"nlm-mesh.d014754","title":"NLM MeSH Browser descriptor D014754","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014754"}],"status":"reported","summary":"NLM MeSH describes Violence as: Use of physical force causing or intent to cause harm, injury or abuse.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014858","kind":"concept","label":"War Crimes","sources":[{"id":"nlm-mesh.d014858","title":"NLM MeSH Browser descriptor D014858","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014858"}],"status":"reported","summary":"NLM MeSH describes War Crimes as: Criminal acts committed during, or in connection with, war, e.g., maltreatment of prisoners, willful killing of civilians, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d018732","kind":"field","label":"Forensic Anthropology","sources":[{"id":"nlm-mesh.d018732","title":"NLM MeSH Browser descriptor D018732","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018732"}],"status":"reported","summary":"NLM MeSH describes Forensic Anthropology as: Scientific study of human skeletal remains with the express purpose of identification. This includes establishing individual identity, trauma analysis, facial reconstruction, photographic superimposition, determination of time interval since death, and crime-scene recovery. Forensic anthropologists do not certify cause of death but provide data to assist in determination of probable cause. This is a branch of the field of physical anthropology and qualified individuals are certified by the American Board of Forensic Anthropology. (From Am J Forensic Med Pathol 1992 Jun;13(2):146)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d044709","kind":"field","label":"Forensic Ballistics","sources":[{"id":"nlm-mesh.d044709","title":"NLM MeSH Browser descriptor D044709","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044709"}],"status":"reported","summary":"NLM MeSH describes Forensic Ballistics as: The science of studying projectiles in motion, ballistics, being applied to law. Ballistics on firearm projectiles, such as bullets, include the study of what happens inside the weapon, during the flight of the projectile, and when the projectile strikes the target, such as body tissue.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005553","kind":"concept","label":"Forensic Dentistry","sources":[{"id":"nlm-mesh.d005553","title":"NLM MeSH Browser descriptor D005553","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005553"}],"status":"reported","summary":"NLM MeSH describes Forensic Dentistry as: The application of dental knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000081230","kind":"field","label":"Forensic Entomology","sources":[{"id":"nlm-mesh.d000081230","title":"NLM MeSH Browser descriptor D000081230","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000081230"}],"status":"reported","summary":"NLM MeSH describes Forensic Entomology as: The use of insects and related arthropods that inhabit decomposing corpses or remains in the conduct of medico-legal or medico-criminal investigations.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097785","kind":"concept","label":"Forensic Imaging","sources":[{"id":"nlm-mesh.d000097785","title":"NLM MeSH Browser descriptor D000097785","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097785"}],"status":"reported","summary":"NLM MeSH describes Forensic Imaging as: The use of various imaging and image enhancement techniques in forensic investigative disciplines. It often includes FORENSIC MEDICINE platforms such as X-RAYS ; CT XRAY; and MRI.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000095024","kind":"field","label":"Forensic Microbiology","sources":[{"id":"nlm-mesh.d000095024","title":"NLM MeSH Browser descriptor D000095024","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095024"}],"status":"reported","summary":"NLM MeSH describes Forensic Microbiology as: The scientific discipline dedicated to analyzing evidence from BIOTERRORISM , biocrime, HOAX , or inadvertent microorganism/toxin release for attribution purposes.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d053604","kind":"concept","label":"Forensic Nursing","sources":[{"id":"nlm-mesh.d053604","title":"NLM MeSH Browser descriptor D053604","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053604"}],"status":"reported","summary":"NLM MeSH describes Forensic Nursing as: The application of NURSING knowledge to questions of law. It is a specialty of nursing practice involving victims of crime which includes not only attending to the physical and emotional distress of victims, but also the identifying, collecting, and preserving evidence for law enforcement and the criminal justice system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d000077283","kind":"field","label":"Forensic Psychology","sources":[{"id":"nlm-mesh.d000077283","title":"NLM MeSH Browser descriptor D000077283","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077283"}],"status":"reported","summary":"NLM MeSH describes Forensic Psychology as: A specialty in professional psychology characterized by activities primarily intended to provide professional psychological expertise within the judicial and legal systems.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d053593","kind":"field","label":"Forensic Toxicology","sources":[{"id":"nlm-mesh.d053593","title":"NLM MeSH Browser descriptor D053593","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053593"}],"status":"reported","summary":"NLM MeSH describes Forensic Toxicology as: The application of TOXICOLOGY knowledge to questions of law.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001721","kind":"concept","label":"Birth Intervals","sources":[{"id":"nlm-mesh.d001721","title":"NLM MeSH Browser descriptor D001721","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001721"}],"status":"reported","summary":"NLM MeSH describes Birth Intervals as: The lengths of intervals between births to women in the population.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001722","kind":"concept","label":"Birth Order","sources":[{"id":"nlm-mesh.d001722","title":"NLM MeSH Browser descriptor D001722","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001722"}],"status":"reported","summary":"NLM MeSH describes Birth Order as: The sequence in which children are born into the family.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000092822","kind":"concept","label":"Family Structure","sources":[{"id":"nlm-mesh.d000092822","title":"NLM MeSH Browser descriptor D000092822","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092822"}],"status":"reported","summary":"NLM MeSH describes Family Structure as: Structural nature of relationships among members of a household typically in reference to a MINOR residing in the same home. More broadly any organizational framework that determines family membership, and the functions and hierarchical position of family members (https://eric.ed.gov/?qt=Family+Structure&ti=Family+Structure).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017533","kind":"concept","label":"Marital Status","sources":[{"id":"nlm-mesh.d017533","title":"NLM MeSH Browser descriptor D017533","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017533"}],"status":"reported","summary":"NLM MeSH describes Marital Status as: A demographic parameter indicating a person's status with respect to marriage, divorce, widowhood, singleness ( SINGLE PERSON ), etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d015577","kind":"concept","label":"Geriatric Assessment","sources":[{"id":"nlm-mesh.d015577","title":"NLM MeSH Browser descriptor D015577","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015577"}],"status":"reported","summary":"NLM MeSH describes Geriatric Assessment as: Evaluation of the level of physical, physiological, or mental functioning in the older population group.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000091682","kind":"concept","label":"Health Inequities","sources":[{"id":"nlm-mesh.d000091682","title":"NLM MeSH Browser descriptor D000091682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091682"}],"status":"reported","summary":"NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009752","kind":"concept","label":"Nutritional Status","sources":[{"id":"nlm-mesh.d009752","title":"NLM MeSH Browser descriptor D009752","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009752"}],"status":"reported","summary":"NLM MeSH describes Nutritional Status as: State of the body in relation to the consumption and utilization of nutrients.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064890","kind":"concept","label":"Social Determinants of Health","sources":[{"id":"nlm-mesh.d064890","title":"NLM MeSH Browser descriptor D064890","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064890"}],"status":"reported","summary":"NLM MeSH describes Social Determinants of Health as: The circumstances in which people are born, grow up, live, work, and age, as well as the systems put in place to deal with illness. These circumstances are in turn shaped by a wider set of forces: economics, social policies, and politics (http://www.cdc.gov/socialdeterminants/).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019456","kind":"concept","label":"Health Transition","sources":[{"id":"nlm-mesh.d019456","title":"NLM MeSH Browser descriptor D019456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019456"}],"status":"reported","summary":"NLM MeSH describes Health Transition as: Demographic and epidemiologic changes that have occurred in the last five decades in many developing countries and that are characterized by major growth in the number and proportion of middle-aged and elderly persons and in the frequency of the diseases that occur in these age groups. The health transition is the result of efforts to improve maternal and child health via primary care and outreach services and such efforts have been responsible for a decrease in the birth rate; reduced maternal mortality; improved preventive services; reduced infant mortality, and the increased life expectancy that defines the transition. (From Ann Intern Med 1992 Mar 15;116(6):499-504)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d063426","kind":"concept","label":"Human Migration","sources":[{"id":"nlm-mesh.d063426","title":"NLM MeSH Browser descriptor D063426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063426"}],"status":"reported","summary":"NLM MeSH describes Human Migration as: Dispersion or dislocation of people from their country of origin, either voluntarily or involuntarily.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011155","kind":"concept","label":"Population Control","sources":[{"id":"nlm-mesh.d011155","title":"NLM MeSH Browser descriptor D011155","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011155"}],"status":"reported","summary":"NLM MeSH describes Population Control as: Includes mechanisms or programs which control the numbers of individuals in a population of humans or animals.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011158","kind":"concept","label":"Population Growth","sources":[{"id":"nlm-mesh.d011158","title":"NLM MeSH Browser descriptor D011158","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011158"}],"status":"reported","summary":"NLM MeSH describes Population Growth as: Increase, over a specific period of time, in the number of individuals living in a country or region.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012744","kind":"concept","label":"Sex Ratio","sources":[{"id":"nlm-mesh.d012744","title":"NLM MeSH Browser descriptor D012744","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012744"}],"status":"reported","summary":"NLM MeSH describes Sex Ratio as: The number of males per 100 females.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067896","kind":"concept","label":"Industrial Development","sources":[{"id":"nlm-mesh.d000067896","title":"NLM MeSH Browser descriptor D000067896","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067896"}],"status":"reported","summary":"NLM MeSH describes Industrial Development as: Activity concerned with the planning and building of industries through manufacturing, provision of specialized services, and COMMERCE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003906","kind":"concept","label":"Developing Countries","sources":[{"id":"nlm-mesh.d003906","title":"NLM MeSH Browser descriptor D003906","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003906"}],"status":"reported","summary":"NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007239","kind":"concept","label":"Infections","sources":[{"id":"nlm-mesh.d007239","title":"NLM MeSH Browser descriptor D007239","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007239"}],"status":"reported","summary":"NLM MeSH describes Infections as: Invasion of the host organism by microorganisms or their toxins or by parasites that can cause pathological conditions or diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009369","kind":"concept","label":"Neoplasms","sources":[{"id":"nlm-mesh.d009369","title":"NLM MeSH Browser descriptor D009369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009369"}],"status":"reported","summary":"NLM MeSH describes Neoplasms as: New abnormal growth of tissue. Malignant neoplasms show a greater degree of anaplasia and have the properties of invasion and metastasis, compared to benign neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002318","kind":"concept","label":"Cardiovascular Diseases","sources":[{"id":"nlm-mesh.d002318","title":"NLM MeSH Browser descriptor D002318","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002318"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Diseases as: Pathological conditions involving the CARDIOVASCULAR SYSTEM including the HEART ; the BLOOD VESSELS ; or the PERICARDIUM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009422","kind":"concept","label":"Nervous System Diseases","sources":[{"id":"nlm-mesh.d009422","title":"NLM MeSH Browser descriptor D009422","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009422"}],"status":"reported","summary":"NLM MeSH describes Nervous System Diseases as: Diseases of the central and peripheral nervous system. This includes disorders of the brain, spinal cord, cranial nerves, peripheral nerves, nerve roots, autonomic nervous system, neuromuscular junction, and muscle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012140","kind":"concept","label":"Respiratory Tract Diseases","sources":[{"id":"nlm-mesh.d012140","title":"NLM MeSH Browser descriptor D012140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012140"}],"status":"reported","summary":"NLM MeSH describes Respiratory Tract Diseases as: Diseases involving the RESPIRATORY SYSTEM .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d004066","kind":"concept","label":"Digestive System Diseases","sources":[{"id":"nlm-mesh.d004066","title":"NLM MeSH Browser descriptor D004066","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004066"}],"status":"reported","summary":"NLM MeSH describes Digestive System Diseases as: Diseases in any part of the GASTROINTESTINAL TRACT or the accessory organs ( LIVER ; BILIARY TRACT ; PANCREAS ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009140","kind":"concept","label":"Musculoskeletal Diseases","sources":[{"id":"nlm-mesh.d009140","title":"NLM MeSH Browser descriptor D009140","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009140"}],"status":"reported","summary":"NLM MeSH describes Musculoskeletal Diseases as: Diseases of the muscles and their associated ligaments and other connective tissue and of the bones and cartilage viewed collectively.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d004700","kind":"concept","label":"Endocrine System Diseases","sources":[{"id":"nlm-mesh.d004700","title":"NLM MeSH Browser descriptor D004700","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004700"}],"status":"reported","summary":"NLM MeSH describes Endocrine System Diseases as: Pathological processes of the ENDOCRINE GLANDS , and diseases resulting from abnormal level of available HORMONES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007154","kind":"concept","label":"Immune System Diseases","sources":[{"id":"nlm-mesh.d007154","title":"NLM MeSH Browser descriptor D007154","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007154"}],"status":"reported","summary":"NLM MeSH describes Immune System Diseases as: Disorders caused by abnormal or absent immunologic mechanisms, whether humoral, cell-mediated, or both.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001523","kind":"concept","label":"Mental Disorders","sources":[{"id":"nlm-mesh.d001523","title":"NLM MeSH Browser descriptor D001523","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001523"}],"status":"reported","summary":"NLM MeSH describes Mental Disorders as: Psychiatric illness or diseases manifested by breakdowns in the adaptational process expressed primarily as abnormalities of thought, feeling, and behavior producing either distress or impairment of function.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014947","kind":"concept","label":"Wounds and Injuries","sources":[{"id":"nlm-mesh.d014947","title":"NLM MeSH Browser descriptor D014947","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014947"}],"status":"reported","summary":"NLM MeSH describes Wounds and Injuries as: Damage inflicted on the body as the direct or indirect result of an external force, with or without disruption of structural continuity.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006425","kind":"concept","label":"Hemic and Lymphatic Diseases","sources":[{"id":"nlm-mesh.d006425","title":"NLM MeSH Browser descriptor D006425","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006425"}],"status":"reported","summary":"NLM MeSH describes Hemic and Lymphatic Diseases as: Hematologic diseases and diseases of the lymphatic system collectively. Hemic diseases include disorders involving the formed elements (e.g., ERYTHROCYTE AGGREGATION, INTRAVASCULAR ) and chemical components (e.g., BLOOD PROTEIN DISORDERS ); lymphatic diseases include disorders relating to lymph, lymph nodes, and lymphocytes.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000785","kind":"concept","label":"Aneurysm, Infected","sources":[{"id":"nlm-mesh.d000785","title":"NLM MeSH Browser descriptor D000785","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000785"}],"status":"reported","summary":"NLM MeSH describes Aneurysm, Infected as: Aneurysm due to growth of microorganisms in the arterial wall, or infection arising within preexisting arteriosclerotic aneurysms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001170","kind":"concept","label":"Arthritis, Infectious","sources":[{"id":"nlm-mesh.d001170","title":"NLM MeSH Browser descriptor D001170","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001170"}],"status":"reported","summary":"NLM MeSH describes Arthritis, Infectious as: Arthritis caused by BACTERIA ; RICKETTSIA ; MYCOPLASMA ; VIRUSES ; FUNGI ; or PARASITES .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d058345","kind":"concept","label":"Asymptomatic Infections","sources":[{"id":"nlm-mesh.d058345","title":"NLM MeSH Browser descriptor D058345","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058345"}],"status":"reported","summary":"NLM MeSH describes Asymptomatic Infections as: Infections that do not exhibit symptoms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001423","kind":"concept","label":"Bacterial Infections and Mycoses","sources":[{"id":"nlm-mesh.d001423","title":"NLM MeSH Browser descriptor D001423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001423"}],"status":"reported","summary":"NLM MeSH describes Bacterial Infections and Mycoses as: Infections caused by bacteria and fungi, general, specified, or unspecified.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001850","kind":"concept","label":"Bone Diseases, Infectious","sources":[{"id":"nlm-mesh.d001850","title":"NLM MeSH Browser descriptor D001850","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001850"}],"status":"reported","summary":"NLM MeSH describes Bone Diseases, Infectious as: Bone diseases caused by pathogenic microorganisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000093742","kind":"concept","label":"Breakthrough Infections","sources":[{"id":"nlm-mesh.d000093742","title":"NLM MeSH Browser descriptor D000093742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000093742"}],"status":"reported","summary":"NLM MeSH describes Breakthrough Infections as: Infections by the same infectious agent (e.g., virus, fungus) occurring during exposure to prophylaxis, vaccine and treatment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d053821","kind":"concept","label":"Cardiovascular Infections","sources":[{"id":"nlm-mesh.d053821","title":"NLM MeSH Browser descriptor D053821","url":"https://meshb.nlm.nih.gov/record/ui?ui=D053821"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Infections as: Pathological conditions of the CARDIOVASCULAR SYSTEM caused by infections.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d055499","kind":"concept","label":"Catheter-Related Infections","sources":[{"id":"nlm-mesh.d055499","title":"NLM MeSH Browser descriptor D055499","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055499"}],"status":"reported","summary":"NLM MeSH describes Catheter-Related Infections as: Infections resulting from the use of catheters. Proper aseptic technique, site of catheter placement, material composition, and virulence of the organism are all factors that can influence possible infection.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002494","kind":"concept","label":"Central Nervous System Infections","sources":[{"id":"nlm-mesh.d002494","title":"NLM MeSH Browser descriptor D002494","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002494"}],"status":"reported","summary":"NLM MeSH describes Central Nervous System Infections as: Pathogenic infections of the brain, spinal cord, and meninges. DNA VIRUS INFECTIONS ; RNA VIRUS INFECTIONS ; BACTERIAL INFECTIONS ; MYCOPLASMA INFECTIONS ; SPIROCHAETALES INFECTIONS ; fungal infections; PROTOZOAN INFECTIONS ; HELMINTHIASIS ; and PRION DISEASES may involve the central nervous system as a primary or secondary process.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d060085","kind":"concept","label":"Coinfection","sources":[{"id":"nlm-mesh.d060085","title":"NLM MeSH Browser descriptor D060085","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060085"}],"status":"reported","summary":"NLM MeSH describes Coinfection as: Simultaneous infection of a host organism by two or more pathogens. In virology, coinfection commonly refers to simultaneous infection of a single cell by two or more different viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003141","kind":"concept","label":"Communicable Diseases","sources":[{"id":"nlm-mesh.d003141","title":"NLM MeSH Browser descriptor D003141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003141"}],"status":"reported","summary":"NLM MeSH describes Communicable Diseases as: An illness caused by an infectious agent or its toxins that occurs through the direct or indirect transmission of the infectious agent or its products from an infected individual or via an animal, vector or the inanimate environment to a susceptible animal or human host.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d017714","kind":"concept","label":"Community-Acquired Infections","sources":[{"id":"nlm-mesh.d017714","title":"NLM MeSH Browser descriptor D017714","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017714"}],"status":"reported","summary":"NLM MeSH describes Community-Acquired Infections as: Any infection acquired in the community, that is, contrasted with those acquired in a health care facility ( CROSS INFECTION ). An infection would be classified as community-acquired if the patient had not recently been in a health care facility or been in contact with someone who had been recently in a health care facility.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003428","kind":"concept","label":"Cross Infection","sources":[{"id":"nlm-mesh.d003428","title":"NLM MeSH Browser descriptor D003428","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003428"}],"status":"reported","summary":"NLM MeSH describes Cross Infection as: Any infection which a patient contracts in a health-care institution.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015817","kind":"concept","label":"Eye Infections","sources":[{"id":"nlm-mesh.d015817","title":"NLM MeSH Browser descriptor D015817","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015817"}],"status":"reported","summary":"NLM MeSH describes Eye Infections as: Infection, moderate to severe, caused by bacteria, fungi, or viruses, which occurs either on the external surface of the eye or intraocularly with probable inflammation, visual impairment, or blindness.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d005490","kind":"concept","label":"Focal Infection","sources":[{"id":"nlm-mesh.d005490","title":"NLM MeSH Browser descriptor D005490","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005490"}],"status":"reported","summary":"NLM MeSH describes Focal Infection as: An infection at a specific location that may spread to another region of the body.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d005891","kind":"concept","label":"Gingivitis","sources":[{"id":"nlm-mesh.d005891","title":"NLM MeSH Browser descriptor D005891","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005891"}],"status":"reported","summary":"NLM MeSH describes Gingivitis as: Inflammation of gum tissue ( GINGIVA ) without loss of connective tissue.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006520","kind":"concept","label":"Hepatitis, Animal","sources":[{"id":"nlm-mesh.d006520","title":"NLM MeSH Browser descriptor D006520","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006520"}],"status":"reported","summary":"NLM MeSH describes Hepatitis, Animal as: INFLAMMATION of the LIVER in non-human animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d059413","kind":"concept","label":"Intraabdominal Infections","sources":[{"id":"nlm-mesh.d059413","title":"NLM MeSH Browser descriptor D059413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059413"}],"status":"reported","summary":"NLM MeSH describes Intraabdominal Infections as: Infection within the PERITONEAL CAVITY. A frequent cause is an ANASTOMOTIC LEAK following surgery.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007757","kind":"concept","label":"Laboratory Infection","sources":[{"id":"nlm-mesh.d007757","title":"NLM MeSH Browser descriptor D007757","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007757"}],"status":"reported","summary":"NLM MeSH describes Laboratory Infection as: Accidentally acquired infection in laboratory workers.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000085343","kind":"concept","label":"Latent Infection","sources":[{"id":"nlm-mesh.d000085343","title":"NLM MeSH Browser descriptor D000085343","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000085343"}],"status":"reported","summary":"NLM MeSH describes Latent Infection as: Delayed infection of the host by a dormant or inactive pathogen.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009894","kind":"concept","label":"Opportunistic Infections","sources":[{"id":"nlm-mesh.d009894","title":"NLM MeSH Browser descriptor D009894","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009894"}],"status":"reported","summary":"NLM MeSH describes Opportunistic Infections as: An infection caused by an organism which becomes pathogenic under certain conditions, e.g., during immunosuppression.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010272","kind":"concept","label":"Parasitic Diseases","sources":[{"id":"nlm-mesh.d010272","title":"NLM MeSH Browser descriptor D010272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010272"}],"status":"reported","summary":"NLM MeSH describes Parasitic Diseases as: Infections or infestations with PARASITES . They are often contracted through contact with an intermediate vector, but may occur as the result of direct exposure.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d034161","kind":"concept","label":"Pelvic Infection","sources":[{"id":"nlm-mesh.d034161","title":"NLM MeSH Browser descriptor D034161","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034161"}],"status":"reported","summary":"NLM MeSH describes Pelvic Infection as: Infection involving the tissues or organs in the PELVIS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000088562","kind":"concept","label":"Persistent Infection","sources":[{"id":"nlm-mesh.d000088562","title":"NLM MeSH Browser descriptor D000088562","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000088562"}],"status":"reported","summary":"NLM MeSH describes Persistent Infection as: Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections. LATENT INFECTIONS are infections in which manifestation of clinical symptoms appear later.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d031261","kind":"concept","label":"Poult Enteritis Mortality Syndrome","sources":[{"id":"nlm-mesh.d031261","title":"NLM MeSH Browser descriptor D031261","url":"https://meshb.nlm.nih.gov/record/ui?ui=D031261"}],"status":"reported","summary":"NLM MeSH describes Poult Enteritis Mortality Syndrome as: An acute, transmissible, infectious disease associated with high MORTALITY and MORBIDITY in young turkeys (poults). It is characterized by DIARRHEA ; ANOREXIA ; growth depression, and immune dysfunction. The cause is unknown but astroviruses ( AVASTROVIRUS ) and coronaviruses ( CORONAVIRUS, TURKEY ) have been isolated from diseased poults and are thought to cause the enteritis and increased susceptibility to bacterial infections.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011251","kind":"concept","label":"Pregnancy Complications, Infectious","sources":[{"id":"nlm-mesh.d011251","title":"NLM MeSH Browser descriptor D011251","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011251"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Infectious as: The co-occurrence of pregnancy and an INFECTION . The infection may precede or follow FERTILIZATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d016459","kind":"concept","label":"Prosthesis-Related Infections","sources":[{"id":"nlm-mesh.d016459","title":"NLM MeSH Browser descriptor D016459","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016459"}],"status":"reported","summary":"NLM MeSH describes Prosthesis-Related Infections as: Infections resulting from the implantation of prosthetic devices. The infections may be acquired from intraoperative contamination (early) or hematogenously acquired from other sites (late).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d060737","kind":"concept","label":"Reproductive Tract Infections","sources":[{"id":"nlm-mesh.d060737","title":"NLM MeSH Browser descriptor D060737","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060737"}],"status":"reported","summary":"NLM MeSH describes Reproductive Tract Infections as: Infections of the genital tract in females or males. They can be caused by endogenous, iatrogenic, or sexually transmitted organisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012141","kind":"concept","label":"Respiratory Tract Infections","sources":[{"id":"nlm-mesh.d012141","title":"NLM MeSH Browser descriptor D012141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012141"}],"status":"reported","summary":"NLM MeSH describes Respiratory Tract Infections as: Invasion of the host RESPIRATORY SYSTEM by microorganisms, usually leading to pathological processes or diseases.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018805","kind":"concept","label":"Sepsis","sources":[{"id":"nlm-mesh.d018805","title":"NLM MeSH Browser descriptor D018805","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018805"}],"status":"reported","summary":"NLM MeSH describes Sepsis as: Systemic inflammatory response syndrome with a proven or suspected infectious etiology. When sepsis is associated with organ dysfunction distant from the site of infection, it is called severe sepsis. When sepsis is accompanied by HYPOTENSION despite adequate fluid infusion, it is called SEPTIC SHOCK .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012749","kind":"concept","label":"Sexually Transmitted Diseases","sources":[{"id":"nlm-mesh.d012749","title":"NLM MeSH Browser descriptor D012749","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012749"}],"status":"reported","summary":"NLM MeSH describes Sexually Transmitted Diseases as: Diseases due to or propagated by sexual contact.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012874","kind":"concept","label":"Skin Diseases, Infectious","sources":[{"id":"nlm-mesh.d012874","title":"NLM MeSH Browser descriptor D012874","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012874"}],"status":"reported","summary":"NLM MeSH describes Skin Diseases, Infectious as: Skin diseases caused by bacteria, fungi, parasites, or viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018461","kind":"concept","label":"Soft Tissue Infections","sources":[{"id":"nlm-mesh.d018461","title":"NLM MeSH Browser descriptor D018461","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018461"}],"status":"reported","summary":"NLM MeSH describes Soft Tissue Infections as: Infections of non-skeletal tissue, i.e., exclusive of bone, ligaments, cartilage, and fibrous tissue. The concept is usually referred to as skin and soft tissue infections and usually subcutaneous and muscle tissue are involved. The predisposing factors in anaerobic infections are trauma, ischemia, and surgery. The organisms often derive from the fecal or oral flora, particularly in wounds associated with intestinal surgery, decubitus ulcer, and human bites. (From Cecil Textbook of Medicine, 19th ed, p1688)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d013492","kind":"concept","label":"Suppuration","sources":[{"id":"nlm-mesh.d013492","title":"NLM MeSH Browser descriptor D013492","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013492"}],"status":"reported","summary":"NLM MeSH describes Suppuration as: A pathologic process consisting in the formation of pus.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014115","kind":"concept","label":"Toxemia","sources":[{"id":"nlm-mesh.d014115","title":"NLM MeSH Browser descriptor D014115","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014115"}],"status":"reported","summary":"NLM MeSH describes Toxemia as: A condition produced by the presence of toxins or other harmful substances in the BLOOD .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014552","kind":"concept","label":"Urinary Tract Infections","sources":[{"id":"nlm-mesh.d014552","title":"NLM MeSH Browser descriptor D014552","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014552"}],"status":"reported","summary":"NLM MeSH describes Urinary Tract Infections as: Inflammatory responses of the epithelium of the URINARY TRACT to microbial invasions. They are often bacterial infections with associated BACTERIURIA and PYURIA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000079263","kind":"concept","label":"Vaccine-Preventable Diseases","sources":[{"id":"nlm-mesh.d000079263","title":"NLM MeSH Browser descriptor D000079263","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079263"}],"status":"reported","summary":"NLM MeSH describes Vaccine-Preventable Diseases as: Diseases for which vaccines exist that can confer partial or complete protection. (World Health Organization vaccine-safety-training.org)","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000079426","kind":"concept","label":"Vector Borne Diseases","sources":[{"id":"nlm-mesh.d000079426","title":"NLM MeSH Browser descriptor D000079426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079426"}],"status":"reported","summary":"NLM MeSH describes Vector Borne Diseases as: Infectious diseases transmitted by DISEASE VECTORS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014777","kind":"concept","label":"Virus Diseases","sources":[{"id":"nlm-mesh.d014777","title":"NLM MeSH Browser descriptor D014777","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014777"}],"status":"reported","summary":"NLM MeSH describes Virus Diseases as: A general term for diseases caused by viruses.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000069578","kind":"concept","label":"Waterborne Diseases","sources":[{"id":"nlm-mesh.d000069578","title":"NLM MeSH Browser descriptor D000069578","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069578"}],"status":"reported","summary":"NLM MeSH describes Waterborne Diseases as: Illnesses due to micro-organisms and chemicals in drinking water, those caused by organisms having part of their lifecycle in water or those with water-related vectors, and others spread by aerosols containing pathogens.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014946","kind":"concept","label":"Wound Infection","sources":[{"id":"nlm-mesh.d014946","title":"NLM MeSH Browser descriptor D014946","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014946"}],"status":"reported","summary":"NLM MeSH describes Wound Infection as: Invasion of a wound by pathogenic microorganisms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015047","kind":"concept","label":"Zoonoses","sources":[{"id":"nlm-mesh.d015047","title":"NLM MeSH Browser descriptor D015047","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015047"}],"status":"reported","summary":"NLM MeSH describes Zoonoses as: Diseases of non-human animals that may be transmitted to HUMANS or may be transmitted from humans to non-human animals.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003560","kind":"concept","label":"Cysts","sources":[{"id":"nlm-mesh.d003560","title":"NLM MeSH Browser descriptor D003560","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003560"}],"status":"reported","summary":"NLM MeSH describes Cysts as: Any fluid-filled closed cavity or sac that is lined by an EPITHELIUM . Cysts can be of normal, abnormal, non-neoplastic, or neoplastic tissues.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006222","kind":"concept","label":"Hamartoma","sources":[{"id":"nlm-mesh.d006222","title":"NLM MeSH Browser descriptor D006222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006222"}],"status":"reported","summary":"NLM MeSH describes Hamartoma as: A focal malformation resembling a neoplasm, composed of an overgrowth of mature cells and tissues that normally occur in the affected area.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009370","kind":"concept","label":"Neoplasms by Histologic Type","sources":[{"id":"nlm-mesh.d009370","title":"NLM MeSH Browser descriptor D009370","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009370"}],"status":"reported","summary":"NLM MeSH describes Neoplasms by Histologic Type as: A collective term for the various histological types of NEOPLASMS . It is more likely to be used by searchers than by indexers and catalogers.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009371","kind":"concept","label":"Neoplasms by Site","sources":[{"id":"nlm-mesh.d009371","title":"NLM MeSH Browser descriptor D009371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009371"}],"status":"reported","summary":"NLM MeSH describes Neoplasms by Site as: A collective term for precoordinated organ/neoplasm headings locating neoplasms by organ, as BRAIN NEOPLASMS ; DUODENAL NEOPLASMS ; LIVER NEOPLASMS ; etc.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009374","kind":"concept","label":"Neoplasms, Experimental","sources":[{"id":"nlm-mesh.d009374","title":"NLM MeSH Browser descriptor D009374","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009374"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Experimental as: Experimentally induced new abnormal growth of TISSUES in animals to provide models for studying human neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009376","kind":"concept","label":"Neoplasms, Hormone-Dependent","sources":[{"id":"nlm-mesh.d009376","title":"NLM MeSH Browser descriptor D009376","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009376"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Hormone-Dependent as: Certain tumors that 1, arise in organs that are normally dependent on specific hormones and 2, are stimulated or caused to regress by manipulation of the endocrine environment.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009378","kind":"concept","label":"Neoplasms, Multiple Primary","sources":[{"id":"nlm-mesh.d009378","title":"NLM MeSH Browser descriptor D009378","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009378"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Multiple Primary as: Two or more abnormal growths of tissue occurring simultaneously and presumed to be of separate origin. The neoplasms may be histologically the same or different, and may be found in the same or different sites.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d017169","kind":"concept","label":"Neoplasms, Post-Traumatic","sources":[{"id":"nlm-mesh.d017169","title":"NLM MeSH Browser descriptor D017169","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017169"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Post-Traumatic as: Tumors, cancer or other neoplasms caused by or resulting from trauma or other non-radiation injuries.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009381","kind":"concept","label":"Neoplasms, Radiation-Induced","sources":[{"id":"nlm-mesh.d009381","title":"NLM MeSH Browser descriptor D009381","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009381"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Radiation-Induced as: Tumors, cancer or other neoplasms produced by exposure to ionizing or non-ionizing radiation.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d016609","kind":"concept","label":"Neoplasms, Second Primary","sources":[{"id":"nlm-mesh.d016609","title":"NLM MeSH Browser descriptor D016609","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016609"}],"status":"reported","summary":"NLM MeSH describes Neoplasms, Second Primary as: Abnormal growths of tissue that follow a previous neoplasm but are not metastases of the latter. The second neoplasm may have the same or different histological type and can occur in the same or different organs as the previous neoplasm but in all cases arises from an independent oncogenic event. The development of the second neoplasm may or may not be related to the treatment for the previous neoplasm since genetic risk or predisposing factors may actually be the cause.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009385","kind":"concept","label":"Neoplastic Processes","sources":[{"id":"nlm-mesh.d009385","title":"NLM MeSH Browser descriptor D009385","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009385"}],"status":"reported","summary":"NLM MeSH describes Neoplastic Processes as: The pathological mechanisms and forms taken by tissue during degeneration into a neoplasm and its subsequent activity.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009386","kind":"concept","label":"Neoplastic Syndromes, Hereditary","sources":[{"id":"nlm-mesh.d009386","title":"NLM MeSH Browser descriptor D009386","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009386"}],"status":"reported","summary":"NLM MeSH describes Neoplastic Syndromes, Hereditary as: The condition of a pattern of malignancies within a family, but not every individual's necessarily having the same neoplasm. Characteristically the tumor tends to occur at an earlier than average age, individuals may have more than one primary tumor, the tumors may be multicentric, usually more than 25 percent of the individuals in direct lineal descent from the proband are affected, and the cancer predisposition in these families behaves as an autosomal dominant trait with about 60 percent penetrance.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010257","kind":"concept","label":"Paraneoplastic Syndromes","sources":[{"id":"nlm-mesh.d010257","title":"NLM MeSH Browser descriptor D010257","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010257"}],"status":"reported","summary":"NLM MeSH describes Paraneoplastic Syndromes as: In patients with neoplastic diseases a wide variety of clinical pictures which are indirect and usually remote effects produced by tumor cell metabolites or other products.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011230","kind":"concept","label":"Precancerous Conditions","sources":[{"id":"nlm-mesh.d011230","title":"NLM MeSH Browser descriptor D011230","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011230"}],"status":"reported","summary":"NLM MeSH describes Precancerous Conditions as: Pathological conditions that tend eventually to become malignant.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011252","kind":"concept","label":"Pregnancy Complications, Neoplastic","sources":[{"id":"nlm-mesh.d011252","title":"NLM MeSH Browser descriptor D011252","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011252"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Neoplastic as: The co-occurrence of pregnancy and NEOPLASMS . The neoplastic disease may precede or follow FERTILIZATION .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d018376","kind":"concept","label":"Cardiovascular Abnormalities","sources":[{"id":"nlm-mesh.d018376","title":"NLM MeSH Browser descriptor D018376","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018376"}],"status":"reported","summary":"NLM MeSH describes Cardiovascular Abnormalities as: Congenital, inherited, or acquired anomalies of the CARDIOVASCULAR SYSTEM , including the HEART and BLOOD VESSELS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d006331","kind":"concept","label":"Heart Diseases","sources":[{"id":"nlm-mesh.d006331","title":"NLM MeSH Browser descriptor D006331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006331"}],"status":"reported","summary":"NLM MeSH describes Heart Diseases as: Pathological conditions involving the HEART including its structural and functional abnormalities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d011249","kind":"concept","label":"Pregnancy Complications, Cardiovascular","sources":[{"id":"nlm-mesh.d011249","title":"NLM MeSH Browser descriptor D011249","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011249"}],"status":"reported","summary":"NLM MeSH describes Pregnancy Complications, Cardiovascular as: The co-occurrence of pregnancy and a cardiovascular disease. The disease may precede or follow FERTILIZATION and it may or may not have a deleterious effect on the pregnant woman or FETUS .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d014652","kind":"concept","label":"Vascular Diseases","sources":[{"id":"nlm-mesh.d014652","title":"NLM MeSH Browser descriptor D014652","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014652"}],"status":"reported","summary":"NLM MeSH describes Vascular Diseases as: Pathological processes involving any of the BLOOD VESSELS in the cardiac or peripheral circulation. They include diseases of ARTERIES ; VEINS ; and rest of the vasculature system in the body.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020274","kind":"concept","label":"Autoimmune Diseases of the Nervous System","sources":[{"id":"nlm-mesh.d020274","title":"NLM MeSH Browser descriptor D020274","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020274"}],"status":"reported","summary":"NLM MeSH describes Autoimmune Diseases of the Nervous System as: Disorders caused by cellular or humoral immune responses primarily directed towards nervous system autoantigens. The immune response may be directed towards specific tissue components (e.g., myelin) and may be limited to the central nervous system (e.g., MULTIPLE SCLEROSIS ) or the peripheral nervous system (e.g., GUILLAIN-BARRE SYNDROME ).","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001342","kind":"concept","label":"Autonomic Nervous System Diseases","sources":[{"id":"nlm-mesh.d001342","title":"NLM MeSH Browser descriptor D001342","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001342"}],"status":"reported","summary":"NLM MeSH describes Autonomic Nervous System Diseases as: Diseases of the AUTONOMIC NERVOUS SYSTEM , including sympathetic, parasympathetic, and enteric nervous systems.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002493","kind":"concept","label":"Central Nervous System Diseases","sources":[{"id":"nlm-mesh.d002493","title":"NLM MeSH Browser descriptor D002493","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002493"}],"status":"reported","summary":"NLM MeSH describes Central Nervous System Diseases as: Diseases of any component of the brain (including the cerebral hemispheres, diencephalon, brain stem, and cerebellum) or the spinal cord.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d021081","kind":"concept","label":"Chronobiology Disorders","sources":[{"id":"nlm-mesh.d021081","title":"NLM MeSH Browser descriptor D021081","url":"https://meshb.nlm.nih.gov/record/ui?ui=D021081"}],"status":"reported","summary":"NLM MeSH describes Chronobiology Disorders as: Disruptions of the rhythmic cycle of bodily functions or activities.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003389","kind":"concept","label":"Cranial Nerve Diseases","sources":[{"id":"nlm-mesh.d003389","title":"NLM MeSH Browser descriptor D003389","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003389"}],"status":"reported","summary":"NLM MeSH describes Cranial Nerve Diseases as: Disorders of one or more of the twelve cranial nerves. With the exception of the optic and olfactory nerves, this includes disorders of the brain stem nuclei from which the cranial nerves originate or terminate.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d003711","kind":"concept","label":"Demyelinating Diseases","sources":[{"id":"nlm-mesh.d003711","title":"NLM MeSH Browser descriptor D003711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003711"}],"status":"reported","summary":"NLM MeSH describes Demyelinating Diseases as: Diseases characterized by loss or dysfunction of myelin in the central or peripheral nervous system.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009421","kind":"concept","label":"Nervous System Malformations","sources":[{"id":"nlm-mesh.d009421","title":"NLM MeSH Browser descriptor D009421","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009421"}],"status":"reported","summary":"NLM MeSH describes Nervous System Malformations as: Structural abnormalities of the central or peripheral nervous system resulting primarily from defects of embryogenesis.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009423","kind":"concept","label":"Nervous System Neoplasms","sources":[{"id":"nlm-mesh.d009423","title":"NLM MeSH Browser descriptor D009423","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009423"}],"status":"reported","summary":"NLM MeSH describes Nervous System Neoplasms as: Benign and malignant neoplastic processes arising from or involving components of the central, peripheral, and autonomic nervous systems, cranial nerves, and meninges. Included in this category are primary and metastatic nervous system neoplasms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020752","kind":"concept","label":"Neurocutaneous Syndromes","sources":[{"id":"nlm-mesh.d020752","title":"NLM MeSH Browser descriptor D020752","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020752"}],"status":"reported","summary":"NLM MeSH describes Neurocutaneous Syndromes as: A group of disorders characterized by ectodermal-based malformations and neoplastic growths in the skin, nervous system, and other organs.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d019636","kind":"concept","label":"Neurodegenerative Diseases","sources":[{"id":"nlm-mesh.d019636","title":"NLM MeSH Browser descriptor D019636","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019636"}],"status":"reported","summary":"NLM MeSH describes Neurodegenerative Diseases as: Hereditary and sporadic conditions which are characterized by progressive nervous system dysfunction. These disorders are often associated with atrophy of the affected central or peripheral nervous system structures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d000090862","kind":"concept","label":"Neuroinflammatory Diseases","sources":[{"id":"nlm-mesh.d000090862","title":"NLM MeSH Browser descriptor D000090862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090862"}],"status":"reported","summary":"NLM MeSH describes Neuroinflammatory Diseases as: Diseases characterized by inflammation of the nervous tissue.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009461","kind":"concept","label":"Neurologic Manifestations","sources":[{"id":"nlm-mesh.d009461","title":"NLM MeSH Browser descriptor D009461","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009461"}],"status":"reported","summary":"NLM MeSH describes Neurologic Manifestations as: Clinical signs and symptoms caused by nervous system injury or dysfunction.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009468","kind":"concept","label":"Neuromuscular Diseases","sources":[{"id":"nlm-mesh.d009468","title":"NLM MeSH Browser descriptor D009468","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009468"}],"status":"reported","summary":"NLM MeSH describes Neuromuscular Diseases as: A general term encompassing lower MOTOR NEURON DISEASE ; PERIPHERAL NERVOUS SYSTEM DISEASES ; and certain MUSCULAR DISEASES . Manifestations include MUSCLE WEAKNESS ; FASCICULATION ; muscle ATROPHY ; SPASM ; MYOKYMIA ; MUSCLE HYPERTONIA , myalgias, and MUSCLE HYPOTONIA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020258","kind":"concept","label":"Neurotoxicity Syndromes","sources":[{"id":"nlm-mesh.d020258","title":"NLM MeSH Browser descriptor D020258","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020258"}],"status":"reported","summary":"NLM MeSH describes Neurotoxicity Syndromes as: Neurologic disorders caused by exposure to toxic substances through ingestion, injection, cutaneous application, or other method. This includes conditions caused by biologic, chemical, and pharmaceutical agents.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012148","kind":"concept","label":"Restless Legs Syndrome","sources":[{"id":"nlm-mesh.d012148","title":"NLM MeSH Browser descriptor D012148","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012148"}],"status":"reported","summary":"NLM MeSH describes Restless Legs Syndrome as: A disorder characterized by aching or burning sensations in the lower and rarely the upper extremities that occur prior to sleep or may awaken the patient from sleep.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012893","kind":"concept","label":"Sleep Wake Disorders","sources":[{"id":"nlm-mesh.d012893","title":"NLM MeSH Browser descriptor D012893","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012893"}],"status":"reported","summary":"NLM MeSH describes Sleep Wake Disorders as: Abnormal sleep-wake schedule or pattern associated with the CIRCADIAN RHYTHM which affect the length, timing, and/or rigidity of the sleep-wake cycle relative to the day-night cycle.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d020196","kind":"concept","label":"Trauma, Nervous System","sources":[{"id":"nlm-mesh.d020196","title":"NLM MeSH Browser descriptor D020196","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020196"}],"status":"reported","summary":"NLM MeSH describes Trauma, Nervous System as: Traumatic injuries to the brain, cranial nerves, spinal cord, autonomic nervous system, or neuromuscular system, including iatrogenic injuries induced by surgical procedures.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d001982","kind":"concept","label":"Bronchial Diseases","sources":[{"id":"nlm-mesh.d001982","title":"NLM MeSH Browser descriptor D001982","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001982"}],"status":"reported","summary":"NLM MeSH describes Bronchial Diseases as: Diseases involving the BRONCHI .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d002925","kind":"concept","label":"Ciliary Motility Disorders","sources":[{"id":"nlm-mesh.d002925","title":"NLM MeSH Browser descriptor D002925","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002925"}],"status":"reported","summary":"NLM MeSH describes Ciliary Motility Disorders as: Conditions caused by abnormal CILIA movement in the body, usually causing KARTAGENER SYNDROME , chronic respiratory disorders, chronic SINUSITIS , and chronic OTITIS . Abnormal ciliary beating is likely due to defects in any of the 200 plus ciliary proteins, such as missing motor enzyme DYNEIN arms.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015769","kind":"concept","label":"Granuloma, Respiratory Tract","sources":[{"id":"nlm-mesh.d015769","title":"NLM MeSH Browser descriptor D015769","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015769"}],"status":"reported","summary":"NLM MeSH describes Granuloma, Respiratory Tract as: Granulomatous disorders affecting one or more sites in the respiratory tract.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d007818","kind":"concept","label":"Laryngeal Diseases","sources":[{"id":"nlm-mesh.d007818","title":"NLM MeSH Browser descriptor D007818","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007818"}],"status":"reported","summary":"NLM MeSH describes Laryngeal Diseases as: Pathological processes involving any part of the LARYNX which coordinates many functions such as voice production, breathing, swallowing, and coughing.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d008171","kind":"concept","label":"Lung Diseases","sources":[{"id":"nlm-mesh.d008171","title":"NLM MeSH Browser descriptor D008171","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008171"}],"status":"reported","summary":"NLM MeSH describes Lung Diseases as: Pathological processes involving any part of the LUNG .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d009668","kind":"concept","label":"Nose Diseases","sources":[{"id":"nlm-mesh.d009668","title":"NLM MeSH Browser descriptor D009668","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009668"}],"status":"reported","summary":"NLM MeSH describes Nose Diseases as: Disorders of the nose, general or unspecified.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d010995","kind":"concept","label":"Pleural Diseases","sources":[{"id":"nlm-mesh.d010995","title":"NLM MeSH Browser descriptor D010995","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010995"}],"status":"reported","summary":"NLM MeSH describes Pleural Diseases as: Diseases involving the PLEURA .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012120","kind":"concept","label":"Respiration Disorders","sources":[{"id":"nlm-mesh.d012120","title":"NLM MeSH Browser descriptor D012120","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012120"}],"status":"reported","summary":"NLM MeSH describes Respiration Disorders as: Diseases of the respiratory system in general or unspecified or for a specific respiratory disease not available.","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d012130","kind":"concept","label":"Respiratory Hypersensitivity","sources":[{"id":"nlm-mesh.d012130","title":"NLM MeSH Browser descriptor D012130","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012130"}],"status":"reported","summary":"NLM MeSH describes Respiratory Hypersensitivity as: A form of hypersensitivity affecting the respiratory tract. It includes ASTHMA and RHINITIS, ALLERGIC, SEASONAL .","tags":[]},{"aliases":[],"domain":"health","era":"undated","frontier":false,"id":"concept.mesh.d015619","kind":"concept","label":"Respiratory System Abnormalities","sources":[{"id":"nlm-mesh.d015619","title":"NLM MeSH Browser descriptor D015619","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015619"}],"status":"reported","summary":"NLM MeSH describes Respiratory System Abnormalities as: Congenital structural abnormalities of the respiratory system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001520","kind":"concept","label":"Behavior and Behavior Mechanisms","sources":[{"id":"nlm-mesh.d001520","title":"NLM MeSH Browser descriptor D001520","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001520"}],"status":"reported","summary":"NLM MeSH describes Behavior and Behavior Mechanisms as: The observable response made to a situation and the unconscious processes underlying it.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000223","kind":"concept","label":"Adaptation, Psychological","sources":[{"id":"nlm-mesh.d000223","title":"NLM MeSH Browser descriptor D000223","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000223"}],"status":"reported","summary":"NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001290","kind":"concept","label":"Attitude","sources":[{"id":"nlm-mesh.d001290","title":"NLM MeSH Browser descriptor D001290","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001290"}],"status":"reported","summary":"NLM MeSH describes Attitude as: An enduring, learned predisposition to behave in a consistent way toward a given class of objects, or a persistent mental and/or neural state of readiness to react to a certain class of objects, not as they are but as they are conceived to be.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001519","kind":"concept","label":"Behavior","sources":[{"id":"nlm-mesh.d001519","title":"NLM MeSH Browser descriptor D001519","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001519"}],"status":"reported","summary":"NLM MeSH describes Behavior as: The observable response of a man or animal to a situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002668","kind":"concept","label":"Child Rearing","sources":[{"id":"nlm-mesh.d002668","title":"NLM MeSH Browser descriptor D002668","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002668"}],"status":"reported","summary":"NLM MeSH describes Child Rearing as: The training or bringing-up of children by parents or parent-substitutes. It is used also for child rearing practices in different societies, at different economic levels, in different ethnic groups, etc. It differs from PARENTING in that in child rearing the emphasis is on the act of training or bringing up the child and the interaction between the parent and child, while parenting emphasizes the responsibility and qualities of exemplary behavior of the parent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003674","kind":"concept","label":"Defense Mechanisms","sources":[{"id":"nlm-mesh.d003674","title":"NLM MeSH Browser descriptor D003674","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003674"}],"status":"reported","summary":"NLM MeSH describes Defense Mechanisms as: Unconscious process used by an individual or a group of individuals in order to cope with impulses, feelings or ideas which are not acceptable at their conscious level; various types include reaction formation, projection and self reversal.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004644","kind":"concept","label":"Emotions","sources":[{"id":"nlm-mesh.d004644","title":"NLM MeSH Browser descriptor D004644","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004644"}],"status":"reported","summary":"NLM MeSH describes Emotions as: Those affective states which can be experienced and have arousing and motivational properties.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000099056","kind":"concept","label":"Outcome Expectations","sources":[{"id":"nlm-mesh.d000099056","title":"NLM MeSH Browser descriptor D000099056","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000099056"}],"status":"reported","summary":"NLM MeSH describes Outcome Expectations as: Believed or anticipated consequences of a person’s behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d040821","kind":"field","label":"Human Characteristics","sources":[{"id":"nlm-mesh.d040821","title":"NLM MeSH Browser descriptor D040821","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040821"}],"status":"reported","summary":"NLM MeSH describes Human Characteristics as: The fundamental dispositions and traits of humans. (Merriam-Webster's Collegiate Dictionary, 10th ed)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006803","kind":"concept","label":"Human Development","sources":[{"id":"nlm-mesh.d006803","title":"NLM MeSH Browser descriptor D006803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006803"}],"status":"reported","summary":"NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d016743","kind":"concept","label":"Mental Competency","sources":[{"id":"nlm-mesh.d016743","title":"NLM MeSH Browser descriptor D016743","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016743"}],"status":"reported","summary":"NLM MeSH describes Mental Competency as: The ability to understand the nature and effect of the act in which the individual is engaged. (From Black's Law Dictionary, 6th ed).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009042","kind":"concept","label":"Motivation","sources":[{"id":"nlm-mesh.d009042","title":"NLM MeSH Browser descriptor D009042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009042"}],"status":"reported","summary":"NLM MeSH describes Motivation as: Those factors which cause an organism to behave or act in either a goal-seeking or satisfying manner. They may be influenced by physiological drives or by external stimuli.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d019954","kind":"concept","label":"Neurobehavioral Manifestations","sources":[{"id":"nlm-mesh.d019954","title":"NLM MeSH Browser descriptor D019954","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019954"}],"status":"reported","summary":"NLM MeSH describes Neurobehavioral Manifestations as: Signs and symptoms of higher cortical dysfunction caused by organic conditions. These include certain behavioral alterations and impairments of skills involved in the acquisition, processing, and utilization of knowledge or information.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010551","kind":"concept","label":"Personality","sources":[{"id":"nlm-mesh.d010551","title":"NLM MeSH Browser descriptor D010551","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010551"}],"status":"reported","summary":"NLM MeSH describes Personality as: Behavior-response patterns that characterize the individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"field.mesh.d011593","kind":"field","label":"Psychology, Social","sources":[{"id":"nlm-mesh.d011593","title":"NLM MeSH Browser descriptor D011593","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011593"}],"status":"reported","summary":"NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000083623","kind":"concept","label":"Psychosocial Functioning","sources":[{"id":"nlm-mesh.d000083623","title":"NLM MeSH Browser descriptor D000083623","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000083623"}],"status":"reported","summary":"NLM MeSH describes Psychosocial Functioning as: Level of and variations in social and emotional activity or behaviors.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013695","kind":"concept","label":"Temperance","sources":[{"id":"nlm-mesh.d013695","title":"NLM MeSH Browser descriptor D013695","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013695"}],"status":"reported","summary":"NLM MeSH describes Temperance as: Habitual moderation in the indulgence of a natural appetite, especially but not exclusively the consumption of alcohol.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097813","kind":"concept","label":"Coping Skills","sources":[{"id":"nlm-mesh.d000097813","title":"NLM MeSH Browser descriptor D000097813","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097813"}],"status":"reported","summary":"NLM MeSH describes Coping Skills as: Various techniques for actively managing a stressful event or situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000066498","kind":"concept","label":"Emotional Adjustment","sources":[{"id":"nlm-mesh.d000066498","title":"NLM MeSH Browser descriptor D000066498","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066498"}],"status":"reported","summary":"NLM MeSH describes Emotional Adjustment as: Psychological process that occurs when an individual adapts to a significant emotional event or stimulus.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d030141","kind":"concept","label":"Feedback, Psychological","sources":[{"id":"nlm-mesh.d030141","title":"NLM MeSH Browser descriptor D030141","url":"https://meshb.nlm.nih.gov/record/ui?ui=D030141"}],"status":"reported","summary":"NLM MeSH describes Feedback, Psychological as: A mechanism of information stimulus and response that may control subsequent behavior, cognition, perception, or performance. (From APA Thesaurus of Psychological Index Terms, 8th ed.)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009949","kind":"concept","label":"Orientation","sources":[{"id":"nlm-mesh.d009949","title":"NLM MeSH Browser descriptor D009949","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009949"}],"status":"reported","summary":"NLM MeSH describes Orientation as: Awareness of oneself in relation to time, place and person.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078002","kind":"concept","label":"Posttraumatic Growth, Psychological","sources":[{"id":"nlm-mesh.d000078002","title":"NLM MeSH Browser descriptor D000078002","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078002"}],"status":"reported","summary":"NLM MeSH describes Posttraumatic Growth, Psychological as: Positive change experienced as a result of the struggle with a major life crisis or a traumatic event.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097812","kind":"concept","label":"Psychological Growth","sources":[{"id":"nlm-mesh.d000097812","title":"NLM MeSH Browser descriptor D000097812","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097812"}],"status":"reported","summary":"NLM MeSH describes Psychological Growth as: A process of actively learning and adapting to new ways to function following a challenging life crisis.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d060685","kind":"concept","label":"Sense of Coherence","sources":[{"id":"nlm-mesh.d060685","title":"NLM MeSH Browser descriptor D060685","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060685"}],"status":"reported","summary":"NLM MeSH describes Sense of Coherence as: A view of the world and the individual's environment as comprehensible, manageable, and meaningful, claiming that the way people view their life has a positive influence on their health.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001291","kind":"concept","label":"Attitude of Health Personnel","sources":[{"id":"nlm-mesh.d001291","title":"NLM MeSH Browser descriptor D001291","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001291"}],"status":"reported","summary":"NLM MeSH describes Attitude of Health Personnel as: Attitudes of personnel toward their patients, other professionals, toward the medical care system, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001292","kind":"concept","label":"Attitude to Computers","sources":[{"id":"nlm-mesh.d001292","title":"NLM MeSH Browser descriptor D001292","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001292"}],"status":"reported","summary":"NLM MeSH describes Attitude to Computers as: The attitude and behavior associated with an individual using the computer.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001293","kind":"concept","label":"Attitude to Death","sources":[{"id":"nlm-mesh.d001293","title":"NLM MeSH Browser descriptor D001293","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001293"}],"status":"reported","summary":"NLM MeSH describes Attitude to Death as: Conceptual response of the person to the various aspects of death, which are based on individual psychosocial and cultural experience.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001294","kind":"concept","label":"Attitude to Health","sources":[{"id":"nlm-mesh.d001294","title":"NLM MeSH Browser descriptor D001294","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001294"}],"status":"reported","summary":"NLM MeSH describes Attitude to Health as: Public attitudes toward health, disease, and the medical care system.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d058443","kind":"concept","label":"Catastrophization","sources":[{"id":"nlm-mesh.d058443","title":"NLM MeSH Browser descriptor D058443","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058443"}],"status":"reported","summary":"NLM MeSH describes Catastrophization as: Cognitive and emotional processes encompassing magnification of pain-related stimuli, feelings of helplessness, and a generally pessimistic orientation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067656","kind":"concept","label":"Optimism","sources":[{"id":"nlm-mesh.d000067656","title":"NLM MeSH Browser descriptor D000067656","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067656"}],"status":"reported","summary":"NLM MeSH describes Optimism as: Mental attitude that interprets life events as generally being positive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000067657","kind":"concept","label":"Pessimism","sources":[{"id":"nlm-mesh.d000067657","title":"NLM MeSH Browser descriptor D000067657","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067657"}],"status":"reported","summary":"NLM MeSH describes Pessimism as: Mental attitude that interprets life events as generally being negative.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078682","kind":"concept","label":"Respect","sources":[{"id":"nlm-mesh.d000078682","title":"NLM MeSH Browser descriptor D000078682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078682"}],"status":"reported","summary":"NLM MeSH describes Respect as: A feeling of deep admiration for someone or something elicited by their abilities, qualities, or achievements and regard for the feelings, wishes, or rights of others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013240","kind":"concept","label":"Stereotyping","sources":[{"id":"nlm-mesh.d013240","title":"NLM MeSH Browser descriptor D013240","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013240"}],"status":"reported","summary":"NLM MeSH describes Stereotyping as: An oversimplified perception or conception especially of persons, social groups, etc.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000057","kind":"concept","label":"Accident Proneness","sources":[{"id":"nlm-mesh.d000057","title":"NLM MeSH Browser descriptor D000057","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000057"}],"status":"reported","summary":"NLM MeSH describes Accident Proneness as: Tendency toward involvement in accidents. Implies certain personality characteristics which predispose to accidents.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000294","kind":"concept","label":"Adolescent Behavior","sources":[{"id":"nlm-mesh.d000294","title":"NLM MeSH Browser descriptor D000294","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000294"}],"status":"reported","summary":"NLM MeSH describes Adolescent Behavior as: Any observable response or action of an adolescent.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001522","kind":"concept","label":"Behavior, Animal","sources":[{"id":"nlm-mesh.d001522","title":"NLM MeSH Browser descriptor D001522","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001522"}],"status":"reported","summary":"NLM MeSH describes Behavior, Animal as: The observable response an animal makes to any situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001526","kind":"concept","label":"Behavioral Symptoms","sources":[{"id":"nlm-mesh.d001526","title":"NLM MeSH Browser descriptor D001526","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001526"}],"status":"reported","summary":"NLM MeSH describes Behavioral Symptoms as: Observable manifestations of impaired psychological functioning.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d002652","kind":"concept","label":"Child Behavior","sources":[{"id":"nlm-mesh.d002652","title":"NLM MeSH Browser descriptor D002652","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002652"}],"status":"reported","summary":"NLM MeSH describes Child Behavior as: Any observable response or action of a child from 24 months through 12 years of age. For neonates or children younger than 24 months, INFANT BEHAVIOR is available.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d017004","kind":"concept","label":"Codependency, Psychological","sources":[{"id":"nlm-mesh.d017004","title":"NLM MeSH Browser descriptor D017004","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017004"}],"status":"reported","summary":"NLM MeSH describes Codependency, Psychological as: A relational pattern in which a person attempts to derive a sense of purpose through relationships with others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003142","kind":"concept","label":"Communication","sources":[{"id":"nlm-mesh.d003142","title":"NLM MeSH Browser descriptor D003142","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003142"}],"status":"reported","summary":"NLM MeSH describes Communication as: The exchange or transmission of ideas, attitudes, or beliefs between individuals or groups.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003258","kind":"concept","label":"Consumer Behavior","sources":[{"id":"nlm-mesh.d003258","title":"NLM MeSH Browser descriptor D003258","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003258"}],"status":"reported","summary":"NLM MeSH describes Consumer Behavior as: Behavior associated with the procurement of goods, services, or experiences.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000066479","kind":"concept","label":"Criminal Behavior","sources":[{"id":"nlm-mesh.d000066479","title":"NLM MeSH Browser descriptor D000066479","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066479"}],"status":"reported","summary":"NLM MeSH describes Criminal Behavior as: Conduct leading to commission of unlawful acts.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003617","kind":"concept","label":"Dangerous Behavior","sources":[{"id":"nlm-mesh.d003617","title":"NLM MeSH Browser descriptor D003617","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003617"}],"status":"reported","summary":"NLM MeSH describes Dangerous Behavior as: Actions which have a high risk of being harmful or injurious to oneself or others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004327","kind":"concept","label":"Drinking Behavior","sources":[{"id":"nlm-mesh.d004327","title":"NLM MeSH Browser descriptor D004327","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004327"}],"status":"reported","summary":"NLM MeSH describes Drinking Behavior as: Behaviors associated with the ingesting of water and other liquids; includes rhythmic patterns of drinking (time intervals - onset and duration), frequency and satiety.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d058999","kind":"concept","label":"Drug-Seeking Behavior","sources":[{"id":"nlm-mesh.d058999","title":"NLM MeSH Browser descriptor D058999","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058999"}],"status":"reported","summary":"NLM MeSH describes Drug-Seeking Behavior as: Activities performed to obtain licit or illicit substances.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004924","kind":"concept","label":"Escape Reaction","sources":[{"id":"nlm-mesh.d004924","title":"NLM MeSH Browser descriptor D004924","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004924"}],"status":"reported","summary":"NLM MeSH describes Escape Reaction as: Innate response elicited by sensory stimuli associated with a threatening situation, or actual confrontation with an enemy.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005106","kind":"concept","label":"Exploratory Behavior","sources":[{"id":"nlm-mesh.d005106","title":"NLM MeSH Browser descriptor D005106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005106"}],"status":"reported","summary":"NLM MeSH describes Exploratory Behavior as: The tendency to explore or investigate a novel environment. It is considered a motivation not clearly distinguishable from curiosity.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005247","kind":"concept","label":"Feeding Behavior","sources":[{"id":"nlm-mesh.d005247","title":"NLM MeSH Browser descriptor D005247","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005247"}],"status":"reported","summary":"NLM MeSH describes Feeding Behavior as: Behavioral responses or sequences associated with eating including modes of feeding, rhythmic patterns of eating, and time intervals.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006184","kind":"concept","label":"Habits","sources":[{"id":"nlm-mesh.d006184","title":"NLM MeSH Browser descriptor D006184","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006184"}],"status":"reported","summary":"NLM MeSH describes Habits as: Acquired or learned responses which are regularly manifested.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040261","kind":"concept","label":"Harm Reduction","sources":[{"id":"nlm-mesh.d040261","title":"NLM MeSH Browser descriptor D040261","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040261"}],"status":"reported","summary":"NLM MeSH describes Harm Reduction as: The application of methods designed to reduce the risk of harm associated with certain behaviors without reduction in frequency of those behaviors. The risk-associated behaviors include ongoing and active addictive behaviors.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d015438","kind":"concept","label":"Health Behavior","sources":[{"id":"nlm-mesh.d015438","title":"NLM MeSH Browser descriptor D015438","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015438"}],"status":"reported","summary":"NLM MeSH describes Health Behavior as: Combination of HEALTH KNOWLEDGE, ATTITUDES, PRACTICE which underlie actions taken by individuals regarding their health.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d060845","kind":"concept","label":"Hoarding","sources":[{"id":"nlm-mesh.d060845","title":"NLM MeSH Browser descriptor D060845","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060845"}],"status":"reported","summary":"NLM MeSH describes Hoarding as: A persistent difficulty discarding or parting with possessions.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000081762","kind":"concept","label":"Human-Animal Interaction","sources":[{"id":"nlm-mesh.d000081762","title":"NLM MeSH Browser descriptor D000081762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000081762"}],"status":"reported","summary":"NLM MeSH describes Human-Animal Interaction as: Encompasses any situation where there is interchange between human(s) and animal(s) at an individual or cultural level. These interactions are diverse and idiosyncratic, and may be fleeting or profound. (https://www.avma.org/KB/Policies/Pages/The-Human-Animal-Bond.aspx accessed 8/22/2019).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d055809","kind":"concept","label":"Illness Behavior","sources":[{"id":"nlm-mesh.d055809","title":"NLM MeSH Browser descriptor D055809","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055809"}],"status":"reported","summary":"NLM MeSH describes Illness Behavior as: Coordinate set of non-specific behavioral responses to non-psychiatric illness. These may include loss of APPETITE or LIBIDO ; disinterest in ACTIVITIES OF DAILY LIVING ; or withdrawal from social interaction.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007100","kind":"concept","label":"Imitative Behavior","sources":[{"id":"nlm-mesh.d007100","title":"NLM MeSH Browser descriptor D007100","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007100"}],"status":"reported","summary":"NLM MeSH describes Imitative Behavior as: The mimicking of the behavior of one individual by another.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007175","kind":"concept","label":"Impulsive Behavior","sources":[{"id":"nlm-mesh.d007175","title":"NLM MeSH Browser descriptor D007175","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007175"}],"status":"reported","summary":"NLM MeSH describes Impulsive Behavior as: An act performed without delay, reflection, voluntary direction or obvious control in response to a stimulus.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057226","kind":"concept","label":"Information Seeking Behavior","sources":[{"id":"nlm-mesh.d057226","title":"NLM MeSH Browser descriptor D057226","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057226"}],"status":"reported","summary":"NLM MeSH describes Information Seeking Behavior as: How information is gathered in personal, academic or work environments and the resources used.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007266","kind":"concept","label":"Inhibition, Psychological","sources":[{"id":"nlm-mesh.d007266","title":"NLM MeSH Browser descriptor D007266","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007266"}],"status":"reported","summary":"NLM MeSH describes Inhibition, Psychological as: The interference with or prevention of a behavioral or verbal response even though the stimulus for that response is present; in psychoanalysis the unconscious restraining of an instinctual process.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000074609","kind":"concept","label":"Marijuana Use","sources":[{"id":"nlm-mesh.d000074609","title":"NLM MeSH Browser descriptor D000074609","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074609"}],"status":"reported","summary":"NLM MeSH describes Marijuana Use as: Medicinal or recreational utilization of MARIJUANA .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d009043","kind":"concept","label":"Motor Activity","sources":[{"id":"nlm-mesh.d009043","title":"NLM MeSH Browser descriptor D009043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009043"}],"status":"reported","summary":"NLM MeSH describes Motor Activity as: Body movements of a human or an animal as a behavioral phenomenon.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000073456","kind":"concept","label":"Multitasking Behavior","sources":[{"id":"nlm-mesh.d000073456","title":"NLM MeSH Browser descriptor D000073456","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073456"}],"status":"reported","summary":"NLM MeSH describes Multitasking Behavior as: Simultaneous task performance, or switching between tasks in a concentrated period of time.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010549","kind":"concept","label":"Personal Satisfaction","sources":[{"id":"nlm-mesh.d010549","title":"NLM MeSH Browser descriptor D010549","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010549"}],"status":"reported","summary":"NLM MeSH describes Personal Satisfaction as: The individual's experience of a sense of fulfillment of a need or want and the quality or state of being satisfied.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000084783","kind":"concept","label":"Recreational Drug Use","sources":[{"id":"nlm-mesh.d000084783","title":"NLM MeSH Browser descriptor D000084783","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000084783"}],"status":"reported","summary":"NLM MeSH describes Recreational Drug Use as: Occasional or habitual non-prescribed, not health-related use of substances.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d043762","kind":"concept","label":"Reproductive Behavior","sources":[{"id":"nlm-mesh.d043762","title":"NLM MeSH Browser descriptor D043762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D043762"}],"status":"reported","summary":"NLM MeSH describes Reproductive Behavior as: Human behavior or decision related to REPRODUCTION .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d040242","kind":"concept","label":"Risk Reduction Behavior","sources":[{"id":"nlm-mesh.d040242","title":"NLM MeSH Browser descriptor D040242","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040242"}],"status":"reported","summary":"NLM MeSH describes Risk Reduction Behavior as: Reduction of high-risk choices and adoption of low-risk quantity and frequency alternatives.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012309","kind":"concept","label":"Risk-Taking","sources":[{"id":"nlm-mesh.d012309","title":"NLM MeSH Browser descriptor D012309","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012309"}],"status":"reported","summary":"NLM MeSH describes Risk-Taking as: Undertaking a task involving a challenge for achievement or a desirable goal in which there is a lack of certainty or a fear of failure. It may also include the exhibiting of certain behaviors whose outcomes may present a risk to the individual or to those associated with him or her.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057185","kind":"concept","label":"Sedentary Behavior","sources":[{"id":"nlm-mesh.d057185","title":"NLM MeSH Browser descriptor D057185","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057185"}],"status":"reported","summary":"NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012653","kind":"concept","label":"Self Stimulation","sources":[{"id":"nlm-mesh.d012653","title":"NLM MeSH Browser descriptor D012653","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012653"}],"status":"reported","summary":"NLM MeSH describes Self Stimulation as: The act or process of inducing or increasing the level of arousal in oneself. It can be observed in various situations; for example, infants who are understimulated may explore their surroundings or babble to themselves.(https://dictionary.apa.org/self-stimulation accessed 12/30/2020)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012725","kind":"concept","label":"Sexual Behavior","sources":[{"id":"nlm-mesh.d012725","title":"NLM MeSH Browser descriptor D012725","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012725"}],"status":"reported","summary":"NLM MeSH describes Sexual Behavior as: Sexual activities of humans.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012907","kind":"concept","label":"Smoking","sources":[{"id":"nlm-mesh.d012907","title":"NLM MeSH Browser descriptor D012907","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012907"}],"status":"reported","summary":"NLM MeSH describes Smoking as: Willful or deliberate act of inhaling and exhaling SMOKE from burning substances or agents held by hand.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012919","kind":"concept","label":"Social Behavior","sources":[{"id":"nlm-mesh.d012919","title":"NLM MeSH Browser descriptor D012919","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012919"}],"status":"reported","summary":"NLM MeSH describes Social Behavior as: Any behavior caused by or affecting another individual or group usually of the same species.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013037","kind":"concept","label":"Spatial Behavior","sources":[{"id":"nlm-mesh.d013037","title":"NLM MeSH Browser descriptor D013037","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013037"}],"status":"reported","summary":"NLM MeSH describes Spatial Behavior as: Reactions of an individual or groups of individuals with relation to the immediate surrounding area including the animate or inanimate objects within that area.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013239","kind":"concept","label":"Stereotyped Behavior","sources":[{"id":"nlm-mesh.d013239","title":"NLM MeSH Browser descriptor D013239","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013239"}],"status":"reported","summary":"NLM MeSH describes Stereotyped Behavior as: Relatively invariant mode of behavior elicited or determined by a particular situation; may be verbal, postural, or expressive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013391","kind":"concept","label":"Sucking Behavior","sources":[{"id":"nlm-mesh.d013391","title":"NLM MeSH Browser descriptor D013391","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013391"}],"status":"reported","summary":"NLM MeSH describes Sucking Behavior as: Any suction exerted by the mouth; response of the mammalian infant to draw milk from the breast. Includes sucking on inanimate objects. Not to be used for thumb sucking, which is indexed under fingersucking.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d064424","kind":"concept","label":"Tobacco Use","sources":[{"id":"nlm-mesh.d064424","title":"NLM MeSH Browser descriptor D064424","url":"https://meshb.nlm.nih.gov/record/ui?ui=D064424"}],"status":"reported","summary":"NLM MeSH describes Tobacco Use as: Use of TOBACCO (Nicotiana tabacum L) and TOBACCO PRODUCTS .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d014039","kind":"concept","label":"Toilet Training","sources":[{"id":"nlm-mesh.d014039","title":"NLM MeSH Browser descriptor D014039","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014039"}],"status":"reported","summary":"NLM MeSH describes Toilet Training as: Conditioning to defecate and urinate in culturally acceptable places.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000184","kind":"concept","label":"Acting Out","sources":[{"id":"nlm-mesh.d000184","title":"NLM MeSH Browser descriptor D000184","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000184"}],"status":"reported","summary":"NLM MeSH describes Acting Out as: Expressing unconscious emotional conflicts or feelings, often of hostility or love, through overt behavior.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003717","kind":"concept","label":"Denial, Psychological","sources":[{"id":"nlm-mesh.d003717","title":"NLM MeSH Browser descriptor D003717","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003717"}],"status":"reported","summary":"NLM MeSH describes Denial, Psychological as: Refusal to admit the truth or reality of a situation or experience.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d004208","kind":"concept","label":"Displacement, Psychological","sources":[{"id":"nlm-mesh.d004208","title":"NLM MeSH Browser descriptor D004208","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004208"}],"status":"reported","summary":"NLM MeSH describes Displacement, Psychological as: The process by which an emotional or behavioral response that is appropriate for one situation appears in another situation for which it is inappropriate.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d005201","kind":"concept","label":"Fantasy","sources":[{"id":"nlm-mesh.d005201","title":"NLM MeSH Browser descriptor D005201","url":"https://meshb.nlm.nih.gov/record/ui?ui=D005201"}],"status":"reported","summary":"NLM MeSH describes Fantasy as: An imagined sequence of events or mental images, e.g., daydreams.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d006380","kind":"concept","label":"Helplessness, Learned","sources":[{"id":"nlm-mesh.d006380","title":"NLM MeSH Browser descriptor D006380","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006380"}],"status":"reported","summary":"NLM MeSH describes Helplessness, Learned as: Learned expectation that one's responses are independent of reward and, hence, do not predict or control the occurrence of rewards. Learned helplessness derives from a history, experimentally induced or naturally occurring, of having received punishment/aversive stimulation regardless of responses made. Such circumstances result in an impaired ability to learn. Used for human or animal populations. (APA, Thesaurus of Psychological Index Terms, 1994)","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d007062","kind":"concept","label":"Identification, Psychological","sources":[{"id":"nlm-mesh.d007062","title":"NLM MeSH Browser descriptor D007062","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007062"}],"status":"reported","summary":"NLM MeSH describes Identification, Psychological as: A process by which an individual unconsciously endeavors to pattern himself after another. This process is also important in the development of the personality, particularly the superego or conscience, which is modeled largely on the behavior of adult significant others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000087366","kind":"concept","label":"Information Avoidance","sources":[{"id":"nlm-mesh.d000087366","title":"NLM MeSH Browser descriptor D000087366","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000087366"}],"status":"reported","summary":"NLM MeSH describes Information Avoidance as: Choosing to not obtain knowledge even if having the information could be to one's benefit.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d010467","kind":"concept","label":"Perceptual Defense","sources":[{"id":"nlm-mesh.d010467","title":"NLM MeSH Browser descriptor D010467","url":"https://meshb.nlm.nih.gov/record/ui?ui=D010467"}],"status":"reported","summary":"NLM MeSH describes Perceptual Defense as: Selective perceiving such that the individual protects himself from becoming aware of something unpleasant or threatening, e.g., obscene words are not heard correctly, or violent acts are not seen accurately.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000075682","kind":"concept","label":"Procrastination","sources":[{"id":"nlm-mesh.d000075682","title":"NLM MeSH Browser descriptor D000075682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075682"}],"status":"reported","summary":"NLM MeSH describes Procrastination as: The deferment of actions or tasks to a later time, or to infinity.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011385","kind":"concept","label":"Projection","sources":[{"id":"nlm-mesh.d011385","title":"NLM MeSH Browser descriptor D011385","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011385"}],"status":"reported","summary":"NLM MeSH describes Projection as: A defense mechanism, operating unconsciously, whereby that which is emotionally unacceptable in the self is rejected and attributed (projected) to others.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d011908","kind":"concept","label":"Rationalization","sources":[{"id":"nlm-mesh.d011908","title":"NLM MeSH Browser descriptor D011908","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011908"}],"status":"reported","summary":"NLM MeSH describes Rationalization as: A defense mechanism operating unconsciously, in which the individual attempts to justify or make consciously tolerable, by plausible means, feelings, behavior, and motives that would otherwise be intolerable.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012043","kind":"concept","label":"Regression, Psychology","sources":[{"id":"nlm-mesh.d012043","title":"NLM MeSH Browser descriptor D012043","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012043"}],"status":"reported","summary":"NLM MeSH describes Regression, Psychology as: A return to earlier, especially to infantile, patterns of thought or behavior, or stage of functioning, e.g., feelings of helplessness and dependency in a patient with a serious physical illness. (From APA, Thesaurus of Psychological Index Terms, 1994).","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d012094","kind":"concept","label":"Repression, Psychology","sources":[{"id":"nlm-mesh.d012094","title":"NLM MeSH Browser descriptor D012094","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012094"}],"status":"reported","summary":"NLM MeSH describes Repression, Psychology as: The active mental process of keeping out and ejecting, banishing from consciousness, ideas or impulses that are unacceptable to it.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d013359","kind":"concept","label":"Sublimation, Psychological","sources":[{"id":"nlm-mesh.d013359","title":"NLM MeSH Browser descriptor D013359","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013359"}],"status":"reported","summary":"NLM MeSH describes Sublimation, Psychological as: A defense mechanism through which unacceptable impulses and instinctive urges are diverted into personally and socially acceptable channels; e.g., aggression may be diverted through sports activities.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000339","kind":"concept","label":"Affect","sources":[{"id":"nlm-mesh.d000339","title":"NLM MeSH Browser descriptor D000339","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000339"}],"status":"reported","summary":"NLM MeSH describes Affect as: The feeling-tone accompaniment of an idea or mental representation. It is the most direct psychic derivative of instinct and the psychic representative of the various bodily changes by means of which instincts manifest themselves.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000786","kind":"concept","label":"Anger","sources":[{"id":"nlm-mesh.d000786","title":"NLM MeSH Browser descriptor D000786","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000786"}],"status":"reported","summary":"NLM MeSH describes Anger as: A strong emotional feeling of displeasure aroused by being interfered with, injured or threatened.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001007","kind":"concept","label":"Anxiety","sources":[{"id":"nlm-mesh.d001007","title":"NLM MeSH Browser descriptor D001007","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001007"}],"status":"reported","summary":"NLM MeSH describes Anxiety as: Feelings or emotions of dread, apprehension, and impending disaster but not disabling as with ANXIETY DISORDERS .","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d057565","kind":"concept","label":"Apathy","sources":[{"id":"nlm-mesh.d057565","title":"NLM MeSH Browser descriptor D057565","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057565"}],"status":"reported","summary":"NLM MeSH describes Apathy as: Lack of emotion or emotional expression; a disorder of motivation that persists over time.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001601","kind":"concept","label":"Bereavement","sources":[{"id":"nlm-mesh.d001601","title":"NLM MeSH Browser descriptor D001601","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001601"}],"status":"reported","summary":"NLM MeSH describes Bereavement as: Refers to the whole process of grieving and mourning and is associated with a deep sense of loss and sadness.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d001887","kind":"concept","label":"Boredom","sources":[{"id":"nlm-mesh.d001887","title":"NLM MeSH Browser descriptor D001887","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001887"}],"status":"reported","summary":"NLM MeSH describes Boredom as: A psychological state resulting from any activity that lacks motivation, or from enforced continuance in an uninteresting situation.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d066279","kind":"concept","label":"Courage","sources":[{"id":"nlm-mesh.d066279","title":"NLM MeSH Browser descriptor D066279","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066279"}],"status":"reported","summary":"NLM MeSH describes Courage as: State of mind or spirit that enables one to act in the face of perceived danger, difficulty, or pain.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d003863","kind":"concept","label":"Depression","sources":[{"id":"nlm-mesh.d003863","title":"NLM MeSH Browser descriptor D003863","url":"https://meshb.nlm.nih.gov/record/ui?ui=D003863"}],"status":"reported","summary":"NLM MeSH describes Depression as: Depressive states usually of moderate intensity in contrast with MAJOR DEPRESSIVE DISORDER present in neurotic and psychotic disorders.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000078382","kind":"concept","label":"Disgust","sources":[{"id":"nlm-mesh.d000078382","title":"NLM MeSH Browser descriptor D000078382","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078382"}],"status":"reported","summary":"NLM MeSH describes Disgust as: A feeling of revulsion or strong disapproval aroused by something unpleasant or offensive.","tags":[]},{"aliases":[],"domain":"social","era":"undated","frontier":false,"id":"concept.mesh.d000097815","kind":"concept","label":"Emotional Exhaustion","sources":[{"id":"nlm-mesh.d000097815","title":"NLM MeSH Browser descriptor D000097815","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000097815"}],"status":"reported","summary":"NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026688","kind":"concept","label":"Bioethical Issues","sources":[{"id":"nlm-mesh.d026688","title":"NLM MeSH Browser descriptor D026688","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026688"}],"status":"reported","summary":"NLM MeSH describes Bioethical Issues as: Clusters of topics that fall within the domain of BIOETHICS , the field of study concerned with value questions that arise in biomedicine and health care delivery.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d001675","kind":"field","label":"Bioethics","sources":[{"id":"nlm-mesh.d001675","title":"NLM MeSH Browser descriptor D001675","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001675"}],"status":"reported","summary":"NLM MeSH describes Bioethics as: A branch of applied ethics that studies the value implications of practices and developments in life sciences, medicine, and health care.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d032781","kind":"field","label":"Codes of Ethics","sources":[{"id":"nlm-mesh.d032781","title":"NLM MeSH Browser descriptor D032781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032781"}],"status":"reported","summary":"NLM MeSH describes Codes of Ethics as: Systematic statements of principles or rules of appropriate professional conduct, usually established by professional societies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028661","kind":"concept","label":"Complicity","sources":[{"id":"nlm-mesh.d028661","title":"NLM MeSH Browser descriptor D028661","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028661"}],"status":"reported","summary":"NLM MeSH describes Complicity as: Association with or participation in an act that is, or is perceived to be, criminal or immoral. One is complicitous when one promotes or unduly benefits from practices or institutions that are morally or legally suspect.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d016265","kind":"concept","label":"Conflict of Interest","sources":[{"id":"nlm-mesh.d016265","title":"NLM MeSH Browser descriptor D016265","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016265"}],"status":"reported","summary":"NLM MeSH describes Conflict of Interest as: A situation in which an individual might benefit personally from official or professional actions. It includes a conflict between a person's private interests and official responsibilities in a position of trust. The term is not restricted to government officials. The concept refers both to actual conflict of interest and the appearance or perception of conflict.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d034723","kind":"concept","label":"Double Effect Principle","sources":[{"id":"nlm-mesh.d034723","title":"NLM MeSH Browser descriptor D034723","url":"https://meshb.nlm.nih.gov/record/ui?ui=D034723"}],"status":"reported","summary":"NLM MeSH describes Double Effect Principle as: Guideline for determining when it is morally permissible to perform an action to pursue a good end with knowledge that the action will also bring about bad results. It generally states that, in cases where a contemplated action has such double effect, the action is permissible only if: it is not wrong in itself; the bad result is not intended; the good result is not a direct causal result of the bad result; and the good result is proportionate to the bad result. (from Solomon, Double Effect, in Becker, The Encyclopedia of Ethics, 1992)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026689","kind":"concept","label":"Ethical Analysis","sources":[{"id":"nlm-mesh.d026689","title":"NLM MeSH Browser descriptor D026689","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026689"}],"status":"reported","summary":"NLM MeSH describes Ethical Analysis as: The use of systematic methods of ethical examination, such as CASUISTRY or ETHICAL THEORY , in reasoning about moral problems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028781","kind":"concept","label":"Ethical Relativism","sources":[{"id":"nlm-mesh.d028781","title":"NLM MeSH Browser descriptor D028781","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028781"}],"status":"reported","summary":"NLM MeSH describes Ethical Relativism as: The philosophical view that conceptions of truth and moral values are not absolute but are relative to the persons or groups holding them. (from American Heritage Dictionary of the English Language, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026724","kind":"concept","label":"Ethical Review","sources":[{"id":"nlm-mesh.d026724","title":"NLM MeSH Browser descriptor D026724","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026724"}],"status":"reported","summary":"NLM MeSH describes Ethical Review as: A formal process of examination of patient care or research proposals for conformity with ethical standards. The review is usually conducted by an organized clinical or research ethics committee ( CLINICAL ETHICS COMMITTEES or RESEARCH ETHICS COMMITTEES ), sometimes by a subset of such a committee, an ad hoc group, or an individual ethicist ( ETHICISTS ).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028663","kind":"concept","label":"Ethical Theory","sources":[{"id":"nlm-mesh.d028663","title":"NLM MeSH Browser descriptor D028663","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028663"}],"status":"reported","summary":"NLM MeSH describes Ethical Theory as: A philosophically coherent set of propositions (for example, utilitarianism) which attempts to provide general norms for the guidance and evaluation of moral conduct. (from Beauchamp and Childress, Principles of Biomedical Ethics, 4th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d040861","kind":"field","label":"Ethics, Business","sources":[{"id":"nlm-mesh.d040861","title":"NLM MeSH Browser descriptor D040861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D040861"}],"status":"reported","summary":"NLM MeSH describes Ethics, Business as: The moral obligations governing the conduct of commercial or industrial enterprises.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004991","kind":"field","label":"Ethics, Institutional","sources":[{"id":"nlm-mesh.d004991","title":"NLM MeSH Browser descriptor D004991","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004991"}],"status":"reported","summary":"NLM MeSH describes Ethics, Institutional as: The moral and ethical obligations or responsibilities of institutions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d004995","kind":"field","label":"Ethics, Professional","sources":[{"id":"nlm-mesh.d004995","title":"NLM MeSH Browser descriptor D004995","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004995"}],"status":"reported","summary":"NLM MeSH describes Ethics, Professional as: The principles of proper conduct concerning the rights and duties of the professional, relations with patients or consumers and fellow practitioners, as well as actions of the professional and interpersonal relations with patient or consumer families. (From Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d032984","kind":"field","label":"Ethics, Research","sources":[{"id":"nlm-mesh.d032984","title":"NLM MeSH Browser descriptor D032984","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032984"}],"status":"reported","summary":"NLM MeSH describes Ethics, Research as: The moral obligations governing the conduct of research. Used for discussions of research ethics as a general topic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d006808","kind":"concept","label":"Humanism","sources":[{"id":"nlm-mesh.d006808","title":"NLM MeSH Browser descriptor D006808","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006808"}],"status":"reported","summary":"NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000072577","kind":"concept","label":"Moral Status","sources":[{"id":"nlm-mesh.d000072577","title":"NLM MeSH Browser descriptor D000072577","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000072577"}],"status":"reported","summary":"NLM MeSH describes Moral Status as: A philosophical description of intrinsic self-worth and dignity which bestows basic rights of life, liberty, and freedom from harm.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028723","kind":"concept","label":"Personhood","sources":[{"id":"nlm-mesh.d028723","title":"NLM MeSH Browser descriptor D028723","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028723"}],"status":"reported","summary":"NLM MeSH describes Personhood as: The state or condition of being a human individual accorded moral and/or legal rights. Criteria to be used to determine this status are subject to debate, and range from the requirement of simply being a human organism to such requirements as that the individual be self-aware and capable of rational thought and moral agency.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d028662","kind":"field","label":"Principle-Based Ethics","sources":[{"id":"nlm-mesh.d028662","title":"NLM MeSH Browser descriptor D028662","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028662"}],"status":"reported","summary":"NLM MeSH describes Principle-Based Ethics as: An approach to ethics that focuses on theories of the importance of general principles such as respect for autonomy, beneficence/nonmaleficence, and justice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000073624","kind":"concept","label":"Symbolic Interactionism","sources":[{"id":"nlm-mesh.d000073624","title":"NLM MeSH Browser descriptor D000073624","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073624"}],"status":"reported","summary":"NLM MeSH describes Symbolic Interactionism as: Theoretical approach to social processes with a fundamental concern with power phenomena. There is a focus on the analysis of culture, the influence of Foucault, and the development of feminist perspectives.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.mesh.d026690","kind":"field","label":"Ethics, Clinical","sources":[{"id":"nlm-mesh.d026690","title":"NLM MeSH Browser descriptor D026690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026690"}],"status":"reported","summary":"NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d032764","kind":"concept","label":"Casuistry","sources":[{"id":"nlm-mesh.d032764","title":"NLM MeSH Browser descriptor D032764","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032764"}],"status":"reported","summary":"NLM MeSH describes Casuistry as: A method of ETHICAL ANALYSIS that emphasizes practical problem solving through examining individual cases that are considered to be representative; sometimes used to denote specious argument or rationalization. Differentiate from casuistics, which is the recording and study of cases and disease.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035481","kind":"concept","label":"Retrospective Moral Judgment","sources":[{"id":"nlm-mesh.d035481","title":"NLM MeSH Browser descriptor D035481","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035481"}],"status":"reported","summary":"NLM MeSH describes Retrospective Moral Judgment as: The application of current standards of morality to past actions, institutions, or persons.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d035761","kind":"concept","label":"Wedge Argument","sources":[{"id":"nlm-mesh.d035761","title":"NLM MeSH Browser descriptor D035761","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035761"}],"status":"reported","summary":"NLM MeSH describes Wedge Argument as: An assertion that an action apparently unobjectionable in itself would set in motion a train of events leading ultimately to an undesirable outcome. (From Cambridge Dictionary of Philosophy, 1995)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d033061","kind":"concept","label":"Ethics Consultation","sources":[{"id":"nlm-mesh.d033061","title":"NLM MeSH Browser descriptor D033061","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033061"}],"status":"reported","summary":"NLM MeSH describes Ethics Consultation as: Services provided by an individual ethicist ( ETHICISTS ) or an ethics team or committee ( ETHICS COMMITTEES, CLINICAL ) to address the ethical issues involved in a specific clinical case. The central purpose is to improve the process and outcomes of patients' care by helping to identify, analyze, and resolve ethical problems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000068616","kind":"concept","label":"Professionalism","sources":[{"id":"nlm-mesh.d000068616","title":"NLM MeSH Browser descriptor D000068616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000068616"}],"status":"reported","summary":"NLM MeSH describes Professionalism as: The level of skill, good judgment, and polite behavior expected from people trained to do their jobs well.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d057212","kind":"concept","label":"Therapeutic Equipoise","sources":[{"id":"nlm-mesh.d057212","title":"NLM MeSH Browser descriptor D057212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057212"}],"status":"reported","summary":"NLM MeSH describes Therapeutic Equipoise as: Expectation of real uncertainty on the part of the investigator regarding the comparative therapeutic merits of each arm in a trial.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d055990","kind":"concept","label":"Therapeutic Misconception","sources":[{"id":"nlm-mesh.d055990","title":"NLM MeSH Browser descriptor D055990","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055990"}],"status":"reported","summary":"NLM MeSH describes Therapeutic Misconception as: Misunderstanding among individuals, frequently research subjects, of scientific methods such as randomization and placebo controls.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d019513","kind":"concept","label":"Feminism","sources":[{"id":"nlm-mesh.d019513","title":"NLM MeSH Browser descriptor D019513","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019513"}],"status":"reported","summary":"NLM MeSH describes Feminism as: The theory of the political, economic, and social equality of the sexes and organized activity on behalf of women's rights and interests. (Webster New Collegiate Dictionary, 1981)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026686","kind":"concept","label":"Beneficence","sources":[{"id":"nlm-mesh.d026686","title":"NLM MeSH Browser descriptor D026686","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026686"}],"status":"reported","summary":"NLM MeSH describes Beneficence as: The state or quality of being kind, charitable, or beneficial. (from American Heritage Dictionary of the English Language, 4th ed). The ethical principle of BENEFICENCE requires producing net benefit over harm. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d026684","kind":"concept","label":"Personal Autonomy","sources":[{"id":"nlm-mesh.d026684","title":"NLM MeSH Browser descriptor D026684","url":"https://meshb.nlm.nih.gov/record/ui?ui=D026684"}],"status":"reported","summary":"NLM MeSH describes Personal Autonomy as: Self-directing freedom and especially moral independence. An ethical principle holds that the autonomy of persons ought to be respected. (Bioethics Thesaurus)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d012935","kind":"concept","label":"Social Justice","sources":[{"id":"nlm-mesh.d012935","title":"NLM MeSH Browser descriptor D012935","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012935"}],"status":"reported","summary":"NLM MeSH describes Social Justice as: An interactive process whereby members of a community are concerned for the equality and rights of all.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000091383","kind":"concept","label":"Environmental Justice","sources":[{"id":"nlm-mesh.d000091383","title":"NLM MeSH Browser descriptor D000091383","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000091383"}],"status":"reported","summary":"NLM MeSH describes Environmental Justice as: The fair treatment and meaningful involvement of all people regardless of race, color, national origin, or income, with respect to the development, implementation, and enforcement of environmental laws, regulations, and policies. (www.epa.gov/environmentaljustice/learn-about-environmental-justice)","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d028681","kind":"concept","label":"Moral Obligations","sources":[{"id":"nlm-mesh.d028681","title":"NLM MeSH Browser descriptor D028681","url":"https://meshb.nlm.nih.gov/record/ui?ui=D028681"}],"status":"reported","summary":"NLM MeSH describes Moral Obligations as: Duties that are based in ETHICS , rather than in law.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000080105","kind":"concept","label":"Relational Autonomy","sources":[{"id":"nlm-mesh.d000080105","title":"NLM MeSH Browser descriptor D000080105","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080105"}],"status":"reported","summary":"NLM MeSH describes Relational Autonomy as: The social context within which all individuals exist and acknowledge the emotional and embodied aspects of decision-makers. The approach acknowledges the central role of others in decision-making, including clinicians, who have a responsibility to engage patients’ and surrogates’ emotional experiences.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.mesh.d000095026","kind":"concept","label":"Antiracism","sources":[{"id":"nlm-mesh.d000095026","title":"NLM MeSH Browser descriptor D000095026","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000095026"}],"status":"reported","summary":"NLM MeSH describes Antiracism as: Beliefs, actions or intentions, and policies that oppose RACISM or discrimination based on RACE .","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.101","kind":"concept","label":"Biological and physical processes","sources":[{"id":"usgs-thesaurus.101","title":"USGS Thesaurus term 101","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=101"}],"status":"reported","summary":"The USGS Thesaurus defines Biological and physical processes as: All continuing activities, functions, and phenomena associated with organisms and non-living matter. This category is also used for bioenergetic processes","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1304","kind":"concept","label":"Water properties","sources":[{"id":"usgs-thesaurus.1304","title":"USGS Thesaurus term 1304","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1304"}],"status":"reported","summary":"The USGS Thesaurus defines Water properties as: Measurable physical and chemical characteristics of water from different sources.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.777","kind":"concept","label":"Natural resources","sources":[{"id":"usgs-thesaurus.777","title":"USGS Thesaurus term 777","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=777"}],"status":"reported","summary":"The USGS Thesaurus defines Natural resources as: Stocks of anything naturally occurring that have a beneficial use for man including economic, nutritional, recreational, aesthetic, and other benefits.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.63","kind":"concept","label":"Atmospheric and climatic processes","sources":[{"id":"usgs-thesaurus.63","title":"USGS Thesaurus term 63","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=63"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric and climatic processes as: Phenomena affecting or occurring within the mass of gases that surrounds the earth, including its physics, chemistry, dynamics, and weather conditions. This category is also used for climate , microclimate , weather , with field inventory and monitoring for weather monitoring , and with field inventory and monitoring for weather observations","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1799","kind":"concept","label":"Coastal processes","sources":[{"id":"usgs-thesaurus.1799","title":"USGS Thesaurus term 1799","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1799"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal processes as: Processes unique to coastal areas including longshore transport, beach erosion, storm surge, shoreline change, delta formation, barrier island migration, beach stabilization by vegetation This category is also used with erosion for beach erosion , with erosion for coastal erosion , with hazards for coastal hazards , shoreline change , with erosion for shoreline erosion , and with erosion for shoreline retreat","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.310","kind":"concept","label":"Ecological processes","sources":[{"id":"usgs-thesaurus.310","title":"USGS Thesaurus term 310","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=310"}],"status":"reported","summary":"The USGS Thesaurus defines Ecological processes as: Dynamic biogeochemical interactions that occur among and between biotic and abiotic components of the biosphere. This category is also used for ecological models and environmental processes","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1800","kind":"concept","label":"Estuarine processes","sources":[{"id":"usgs-thesaurus.1800","title":"USGS Thesaurus term 1800","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1800"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine processes as: Processes affecting estuaries including tides, waves, mixing of fluvial and marine waters This category is also used with sediment transport for estuarine sediment transport","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1702","kind":"concept","label":"Evolution","sources":[{"id":"usgs-thesaurus.1702","title":"USGS Thesaurus term 1702","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1702"}],"status":"reported","summary":"The USGS Thesaurus defines Evolution as: Change in the genetic composition of populations of living organisms. This category is also used for gene flow","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.384","kind":"concept","label":"Fires","sources":[{"id":"usgs-thesaurus.384","title":"USGS Thesaurus term 384","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=384"}],"status":"reported","summary":"The USGS Thesaurus defines Fires as: Combustion, marked by heat, light, flames, and often, smoke, caused by the natural or human-induced ignition of flammable materials. For fires set as part of natural resource management, use controlled fires. This category is also used with hazard preparedness for fire preparedness and fires (uncontrolled)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.435","kind":"concept","label":"Geochemical processes","sources":[{"id":"usgs-thesaurus.435","title":"USGS Thesaurus term 435","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=435"}],"status":"reported","summary":"The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.451","kind":"concept","label":"Geologic processes","sources":[{"id":"usgs-thesaurus.451","title":"USGS Thesaurus term 451","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=451"}],"status":"reported","summary":"The USGS Thesaurus defines Geologic processes as: All types of processes involving geological structures. This category is also used for lithification","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2295","kind":"concept","label":"Hydrocarbon reservoir processes","sources":[{"id":"usgs-thesaurus.2295","title":"USGS Thesaurus term 2295","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2295"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrocarbon reservoir processes as: Interactions among groundwater, hydrocarbons, and rock properties of subsurface geological formations, affecting the potential of those formations to form, trap, and permit the passage and extraction of hydrocarbons.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1718","kind":"concept","label":"Impact cratering","sources":[{"id":"usgs-thesaurus.1718","title":"USGS Thesaurus term 1718","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1718"}],"status":"reported","summary":"The USGS Thesaurus defines Impact cratering as: Impact of extraterrestrial objects such as asteroids, comets, and meteorites on Earth. This category is also used for asteroid impact , bolide impact , comet impact , and meteor impact","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.816","kind":"concept","label":"Ocean processes","sources":[{"id":"usgs-thesaurus.816","title":"USGS Thesaurus term 816","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=816"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean processes as: Recurrent natural changes that are physical, biological, or chemical, actively affecting the seas and oceans. This category is also used with sediment transport for marine sediment transport , with hazards for ocean hazards , and with ocean characteristics for oceans","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1347","kind":"concept","label":"Physiological processes","sources":[{"id":"usgs-thesaurus.1347","title":"USGS Thesaurus term 1347","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1347"}],"status":"reported","summary":"The USGS Thesaurus defines Physiological processes as: Characteristics and processes of individual organisms that are not the direct result of their interaction with other organisms or with the environment.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1682","kind":"concept","label":"Dissolved gases","sources":[{"id":"usgs-thesaurus.1682","title":"USGS Thesaurus term 1682","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1682"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved gases as: Gases such as ammonia, oxygen, nitrogen, and carbon dioxide in solution measured in a water sample.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1999","kind":"concept","label":"Dissolved metals","sources":[{"id":"usgs-thesaurus.1999","title":"USGS Thesaurus term 1999","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1999"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved metals as: Metal elements in solution, of concern in studies of hazards such as mine drainage and of water resource usability.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2000","kind":"concept","label":"Dissolved organic compounds","sources":[{"id":"usgs-thesaurus.2000","title":"USGS Thesaurus term 2000","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2000"}],"status":"reported","summary":"The USGS Thesaurus defines Dissolved organic compounds as: Organic compounds present in water, typically as anthropogenic contaminants including pharmaceuticals, pesticides, and herbicides.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.806","kind":"concept","label":"Nutrient content (water)","sources":[{"id":"usgs-thesaurus.806","title":"USGS Thesaurus term 806","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=806"}],"status":"reported","summary":"The USGS Thesaurus defines Nutrient content (water) as: Contaminants in water that nourish organisms, especially plants. Includes nitrogen and phosphorus, either of which can lead to the harmful growth of algae and other plants when present to excess in a body of water. This category is also used for nitrogen content and phosphorus content","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.854","kind":"concept","label":"Oxygen content (water)","sources":[{"id":"usgs-thesaurus.854","title":"USGS Thesaurus term 854","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=854"}],"status":"reported","summary":"The USGS Thesaurus defines Oxygen content (water) as: Measurement of the concentration of oxygen dissolved in water, which is an important indicator of the condition of a water body. This category is also used for anoxia , dissolved oxygen , and hypoxia","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1010","kind":"concept","label":"Salinity","sources":[{"id":"usgs-thesaurus.1010","title":"USGS Thesaurus term 1010","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1010"}],"status":"reported","summary":"The USGS Thesaurus defines Salinity as: Measure of the concentration of salts dissolved in a solution. This category is also used for chloride concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2080","kind":"concept","label":"Sound velocity","sources":[{"id":"usgs-thesaurus.2080","title":"USGS Thesaurus term 2080","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2080"}],"status":"reported","summary":"The USGS Thesaurus defines Sound velocity as: Estimates of the velocity of sound in water, indexed by depth at a specific location, usually calculated from other water properties. This category is also used with profiles for sound velocity profiles","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1129","kind":"concept","label":"Suspended material (water)","sources":[{"id":"usgs-thesaurus.1129","title":"USGS Thesaurus term 1129","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1129"}],"status":"reported","summary":"The USGS Thesaurus defines Suspended material (water) as: Sediment or organic material carried in suspension in the water column, in contrast to material that moves on or near the bottom. May be measured directly by sampling, or indirectly by acoustic or optical backscatter or transmission. This category is also used for suspended sediment concentration and suspended-sediment concentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2264","kind":"concept","label":"Water column reflectivity","sources":[{"id":"usgs-thesaurus.2264","title":"USGS Thesaurus term 2264","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2264"}],"status":"reported","summary":"The USGS Thesaurus defines Water column reflectivity as: A measure of the strength of reflection from small particles suspended in water. It is usually measured by sending a pulse of sound or light through the water and measuring the sound or light that is returned. Water column reflectivity can be used to measure the concentration of suspended particles. This category is also used for backscatter (water column) , water column acoustic reflectivity , and water column optical reflectivity","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1301","kind":"concept","label":"Water hardness","sources":[{"id":"usgs-thesaurus.1301","title":"USGS Thesaurus term 1301","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1301"}],"status":"reported","summary":"The USGS Thesaurus defines Water hardness as: Indicator of the concentration of alkaline salts in water, mainly calcium and magnesium, as a measure of water quality. This category is also used for hardness (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1302","kind":"concept","label":"Water pH","sources":[{"id":"usgs-thesaurus.1302","title":"USGS Thesaurus term 1302","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1302"}],"status":"reported","summary":"The USGS Thesaurus defines Water pH as: The negative logarithm of the hydrogen ion concentration or activity of a water solution. Used for expressing both acidity (pH less than 7) and alkalinity (pH greater than 7), with 7 considered neutral. This category is also used for pH (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1312","kind":"concept","label":"Water temperature","sources":[{"id":"usgs-thesaurus.1312","title":"USGS Thesaurus term 1312","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1312"}],"status":"reported","summary":"The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.799","kind":"concept","label":"Energy resources","sources":[{"id":"usgs-thesaurus.799","title":"USGS Thesaurus term 799","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=799"}],"status":"reported","summary":"The USGS Thesaurus defines Energy resources as: Natural resources that are used for heat and power generation, including oil, natural gas, coal, and geothermal energy. This category is also used for energy sources and fossil fuels","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.391","kind":"concept","label":"Fishery resources","sources":[{"id":"usgs-thesaurus.391","title":"USGS Thesaurus term 391","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=391"}],"status":"reported","summary":"The USGS Thesaurus defines Fishery resources as: The stock of anadromous, marine, and freshwater fish in fishing areas of commercial, subsistence, and recreational value.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.411","kind":"concept","label":"Forest resources","sources":[{"id":"usgs-thesaurus.411","title":"USGS Thesaurus term 411","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=411"}],"status":"reported","summary":"The USGS Thesaurus defines Forest resources as: Trees and associated vegetation available for human use. Use for timber and other forest resources with economic value. This category is also used for forestry","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.745","kind":"concept","label":"Mineral resources","sources":[{"id":"usgs-thesaurus.745","title":"USGS Thesaurus term 745","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=745"}],"status":"reported","summary":"The USGS Thesaurus defines Mineral resources as: Natural occurrences of useful inorganic elements or compounds.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1080","kind":"concept","label":"Soil resources","sources":[{"id":"usgs-thesaurus.1080","title":"USGS Thesaurus term 1080","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1080"}],"status":"reported","summary":"The USGS Thesaurus defines Soil resources as: Natural resources of unconsolidated fragmented rock, humus, and mineral matter that cover the surface of the earth. This category is also used with contamination and pollution for soil pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1308","kind":"concept","label":"Water resources","sources":[{"id":"usgs-thesaurus.1308","title":"USGS Thesaurus term 1308","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1308"}],"status":"reported","summary":"The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.64","kind":"concept","label":"Atmospheric circulation","sources":[{"id":"usgs-thesaurus.64","title":"USGS Thesaurus term 64","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=64"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.66","kind":"concept","label":"Atmospheric deposition (chemical & particulate)","sources":[{"id":"usgs-thesaurus.66","title":"USGS Thesaurus term 66","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=66"}],"status":"reported","summary":"The USGS Thesaurus defines Atmospheric deposition (chemical & particulate) as: The transfer of substances from the air to the surface of the earth, either in wet form (rain, fog, snow, dew, frost, hail) or in dry form (gases, aerosols, particles). This category is also used for atmospheric deposition (chemical and particulate) and atmospheric dust deposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.168","kind":"concept","label":"Climate change","sources":[{"id":"usgs-thesaurus.168","title":"USGS Thesaurus term 168","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=168"}],"status":"reported","summary":"The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.284","kind":"concept","label":"Droughts","sources":[{"id":"usgs-thesaurus.284","title":"USGS Thesaurus term 284","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=284"}],"status":"reported","summary":"The USGS Thesaurus defines Droughts as: Extended periods of moisture deficit over a sizeable area sufficient to have an adverse effect on vegetation, animals, or man. This category is also used for drought","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1355","kind":"concept","label":"Evaporation","sources":[{"id":"usgs-thesaurus.1355","title":"USGS Thesaurus term 1355","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1355"}],"status":"reported","summary":"The USGS Thesaurus defines Evaporation as: Transfer of water from a surface into the atmosphere. This category is also used with transpiration for evapotranspiration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1704","kind":"concept","label":"Greenhouse effect","sources":[{"id":"usgs-thesaurus.1704","title":"USGS Thesaurus term 1704","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1704"}],"status":"reported","summary":"The USGS Thesaurus defines Greenhouse effect as: Local, regional, or global warming in the atmosphere due to the higher heat capacity of certain gases such as carbon dioxide, methane, and ozone.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.823","kind":"concept","label":"Ocean-atmosphere interaction","sources":[{"id":"usgs-thesaurus.823","title":"USGS Thesaurus term 823","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=823"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean-atmosphere interaction as: Processes, including momentum, heat, gas and other exchanges, which result in profound effects on climate and interactions between the air in the lowest part of the atmosphere and the oceans. This category is also used for El Nino and La Nina","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.927","kind":"concept","label":"Precipitation (atmospheric)","sources":[{"id":"usgs-thesaurus.927","title":"USGS Thesaurus term 927","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=927"}],"status":"reported","summary":"The USGS Thesaurus defines Precipitation (atmospheric) as: Any or all forms of water particles that fall from the atmosphere, such as rain, snow, hail and sleet. This category is also used with field inventory and monitoring for precipitation measurement , rain , rainfall , with field inventory and monitoring for rainfall measurement , snow , snowfall , and with field inventory and monitoring for snowfall measurement","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1102","kind":"concept","label":"Storms","sources":[{"id":"usgs-thesaurus.1102","title":"USGS Thesaurus term 1102","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1102"}],"status":"reported","summary":"The USGS Thesaurus defines Storms as: Atmospheric disturbances with winds of unusual force or direction. Accompanied by rain, snow, hail, or sleet, and often by thunder and lightning.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1690","kind":"concept","label":"Wind","sources":[{"id":"usgs-thesaurus.1690","title":"USGS Thesaurus term 1690","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1690"}],"status":"reported","summary":"The USGS Thesaurus defines Wind as: Local air movements. This category is also used with erosion for wind erosion","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2069","kind":"concept","label":"Barrier island migration","sources":[{"id":"usgs-thesaurus.2069","title":"USGS Thesaurus term 2069","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2069"}],"status":"reported","summary":"The USGS Thesaurus defines Barrier island migration as: The slow, landward movement of barrier islands in response to sea level rise and repeated storm washover.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2070","kind":"concept","label":"Coastal emergence","sources":[{"id":"usgs-thesaurus.2070","title":"USGS Thesaurus term 2070","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2070"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal emergence as: Relative uplift of the coast accompanied by seaward displacement of the shoreline. This category is also used for regression (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2071","kind":"concept","label":"Coastal submergence","sources":[{"id":"usgs-thesaurus.2071","title":"USGS Thesaurus term 2071","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2071"}],"status":"reported","summary":"The USGS Thesaurus defines Coastal submergence as: Relative subsidence of the coast accompanied by landward displacement of the shoreline. This category is also used for transgression (marine)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1801","kind":"concept","label":"Longshore currents","sources":[{"id":"usgs-thesaurus.1801","title":"USGS Thesaurus term 1801","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1801"}],"status":"reported","summary":"The USGS Thesaurus defines Longshore currents as: Movement of water parallel to the coast due to waves striking the shoreline at an angle This category is also used with sediment transport for littoral drift and with sediment transport for longshore drift","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2072","kind":"concept","label":"Shoreline accretion","sources":[{"id":"usgs-thesaurus.2072","title":"USGS Thesaurus term 2072","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2072"}],"status":"reported","summary":"The USGS Thesaurus defines Shoreline accretion as: Seaward migration of the shoreline resulting from the addition of earth materials.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2068","kind":"concept","label":"Tidal currents","sources":[{"id":"usgs-thesaurus.2068","title":"USGS Thesaurus term 2068","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2068"}],"status":"reported","summary":"The USGS Thesaurus defines Tidal currents as: Currents caused by tidal changes in water level from one body of water to another.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.30","kind":"concept","label":"Algal blooms","sources":[{"id":"usgs-thesaurus.30","title":"USGS Thesaurus term 30","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=30"}],"status":"reported","summary":"The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.88","kind":"concept","label":"Bioaccumulation","sources":[{"id":"usgs-thesaurus.88","title":"USGS Thesaurus term 88","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=88"}],"status":"reported","summary":"The USGS Thesaurus defines Bioaccumulation as: The biological sequestering of a substance at a higher concentration than that at which it occurs in the surrounding environment or medium. Also, the process whereby a substance enters an organism through the gills, epithelial tissues, dietary, or other sources. This category is also used for bioconcentration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.93","kind":"concept","label":"Biogeochemical cycling","sources":[{"id":"usgs-thesaurus.93","title":"USGS Thesaurus term 93","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=93"}],"status":"reported","summary":"The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.108","kind":"concept","label":"Biological productivity","sources":[{"id":"usgs-thesaurus.108","title":"USGS Thesaurus term 108","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=108"}],"status":"reported","summary":"The USGS Thesaurus defines Biological productivity as: The rate at which primary producers in the ecosystem utilize solar energy to produce food for consumption by other organisms. Do not use this term for productivity of organisms related to studies of the reproduction rates of a species.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2277","kind":"concept","label":"Carbon flux","sources":[{"id":"usgs-thesaurus.2277","title":"USGS Thesaurus term 2277","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2277"}],"status":"reported","summary":"The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.196","kind":"concept","label":"Contaminant transport","sources":[{"id":"usgs-thesaurus.196","title":"USGS Thesaurus term 196","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=196"}],"status":"reported","summary":"The USGS Thesaurus defines Contaminant transport as: Processes involved in the movement of impurities through air, water, and soil.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.268","kind":"concept","label":"Dispersal (organisms)","sources":[{"id":"usgs-thesaurus.268","title":"USGS Thesaurus term 268","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=268"}],"status":"reported","summary":"The USGS Thesaurus defines Dispersal (organisms) as: The dissemination or geographic spread of individuals of a plant or animal population. This category is also used for colonization (organisms)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.308","kind":"concept","label":"Ecological competition","sources":[{"id":"usgs-thesaurus.308","title":"USGS Thesaurus term 308","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=308"}],"status":"reported","summary":"The USGS Thesaurus defines Ecological competition as: The struggle between members of two or more species for scarce environmental resources.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.315","kind":"concept","label":"Ecosystem functions","sources":[{"id":"usgs-thesaurus.315","title":"USGS Thesaurus term 315","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=315"}],"status":"reported","summary":"The USGS Thesaurus defines Ecosystem functions as: The total life activities of organisms in habitats and the effects of those activities on the nonliving components of the environment. This category is also used with estuarine ecosystems for estuarine ecosystem functions","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2281","kind":"concept","label":"Ecosystem resilience","sources":[{"id":"usgs-thesaurus.2281","title":"USGS Thesaurus term 2281","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2281"}],"status":"reported","summary":"The USGS Thesaurus defines Ecosystem resilience as: Measure of the persistence of systems and of their ability to absorb change and disturbance and still maintain the same relationships between populations or state variables. (Holling, 1973) This category is also used for ecological resilience","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.359","kind":"concept","label":"Eutrophication","sources":[{"id":"usgs-thesaurus.359","title":"USGS Thesaurus term 359","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=359"}],"status":"reported","summary":"The USGS Thesaurus defines Eutrophication as: The process by which water becomes enriched with plant nutrients, most commonly phosphorus and nitrogen.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.365","kind":"concept","label":"Extinction and extirpation","sources":[{"id":"usgs-thesaurus.365","title":"USGS Thesaurus term 365","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=365"}],"status":"reported","summary":"The USGS Thesaurus defines Extinction and extirpation as: Extinction is the complete disappearance of a species from the earth. Extirpation is the complete disappearance (elimination) of a species from a given region, island, or area. This category is also used for extirpation","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.522","kind":"concept","label":"Habitat alteration and disturbance","sources":[{"id":"usgs-thesaurus.522","title":"USGS Thesaurus term 522","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=522"}],"status":"reported","summary":"The USGS Thesaurus defines Habitat alteration and disturbance as: Changes in the environments where plants and animals live. Includes natural changes as well as results of human actions, deliberate or accidental. This category is also used for ecological disturbance , environmental disturbance , habitat destruction , and habitat disturbance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.743","kind":"concept","label":"Migration (organisms)","sources":[{"id":"usgs-thesaurus.743","title":"USGS Thesaurus term 743","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=743"}],"status":"reported","summary":"The USGS Thesaurus defines Migration (organisms) as: The movement of animals, often periodical, from one area to another due to seasonal changes, availability of food, or climatic conditions. This category is also used with invasive species for biological invasions , with biogeography for flyways , and seasonal migration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.915","kind":"concept","label":"Pollination","sources":[{"id":"usgs-thesaurus.915","title":"USGS Thesaurus term 915","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=915"}],"status":"reported","summary":"The USGS Thesaurus defines Pollination as: Wind, bees, or other agents transfer plant pollen from flower anthers or cones to stigmas, thereby fertilizing plants for reproduction.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1123","kind":"concept","label":"Succession (biological)","sources":[{"id":"usgs-thesaurus.1123","title":"USGS Thesaurus term 1123","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1123"}],"status":"reported","summary":"The USGS Thesaurus defines Succession (biological) as: Gradual replacement of one species in an area by another. This category is also used for ecologic succession","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1356","kind":"concept","label":"Transpiration","sources":[{"id":"usgs-thesaurus.1356","title":"USGS Thesaurus term 1356","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1356"}],"status":"reported","summary":"The USGS Thesaurus defines Transpiration as: Evaporation of water from plants. This category is also used with evaporation for evapotranspiration","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1802","kind":"concept","label":"Estuarine currents","sources":[{"id":"usgs-thesaurus.1802","title":"USGS Thesaurus term 1802","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1802"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine currents as: Movement of water within estuaries due to the complex interaction of winds, tides, and variations in water density","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1803","kind":"concept","label":"Estuarine mixing","sources":[{"id":"usgs-thesaurus.1803","title":"USGS Thesaurus term 1803","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1803"}],"status":"reported","summary":"The USGS Thesaurus defines Estuarine mixing as: Interaction of tidal forcing and river discharge in an estuary, leading to any of three vertical salinity profiles: salt wedge, stratified, or well mixed. We also include mixing due to extreme events such as storm surge.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2305","kind":"concept","label":"Wildfires","sources":[{"id":"usgs-thesaurus.2305","title":"USGS Thesaurus term 2305","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2305"}],"status":"reported","summary":"The USGS Thesaurus defines Wildfires as: Uncontrolled fires that originate as a result of natural phenomena or human activities in natural areas such as forests, grasslands, or shrub lands, but may also spread to structures and human-occupied environments. This category is also used for wildland fire","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1346","kind":"concept","label":"Biodegradation","sources":[{"id":"usgs-thesaurus.1346","title":"USGS Thesaurus term 1346","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1346"}],"status":"reported","summary":"The USGS Thesaurus defines Biodegradation as: Reduction in the concentration of harmful chemicals by the action of animals and plants. This category is also used for natural attenuation (harmful chemicals)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1731","kind":"concept","label":"Carbon sequestration","sources":[{"id":"usgs-thesaurus.1731","title":"USGS Thesaurus term 1731","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1731"}],"status":"reported","summary":"The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2058","kind":"concept","label":"Ocean acidification","sources":[{"id":"usgs-thesaurus.2058","title":"USGS Thesaurus term 2058","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2058"}],"status":"reported","summary":"The USGS Thesaurus defines Ocean acidification as: Decrease in the pH of ocean waters as a result of the increase in atmospheric carbon dioxide concentration.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1703","kind":"concept","label":"Ore formation","sources":[{"id":"usgs-thesaurus.1703","title":"USGS Thesaurus term 1703","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1703"}],"status":"reported","summary":"The USGS Thesaurus defines Ore formation as: Geochemical processes resulting in concentration of useful chemical elements and compounds, in earth materials. Typically refers to metal ores. This category is also used for metallogenesis , metallogeny , and mineralization","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1708","kind":"concept","label":"Oxidation and reduction","sources":[{"id":"usgs-thesaurus.1708","title":"USGS Thesaurus term 1708","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1708"}],"status":"reported","summary":"The USGS Thesaurus defines Oxidation and reduction as: Addition or reduction of oxygen in a compound accompanied by exchange of electrons among atoms. This category is also used for fermentation","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1711","kind":"concept","label":"Reaction transport","sources":[{"id":"usgs-thesaurus.1711","title":"USGS Thesaurus term 1711","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1711"}],"status":"reported","summary":"The USGS Thesaurus defines Reaction transport as: Chemical reactions occurring during ground-water flow.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1715","kind":"concept","label":"Sorption","sources":[{"id":"usgs-thesaurus.1715","title":"USGS Thesaurus term 1715","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1715"}],"status":"reported","summary":"The USGS Thesaurus defines Sorption as: Attachment of chemical substances to materials, either externally (by adsorption) or internally (by absorption). This category is also used for absorption and adsorption","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2279","kind":"concept","label":"Thermal maturation","sources":[{"id":"usgs-thesaurus.2279","title":"USGS Thesaurus term 2279","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2279"}],"status":"reported","summary":"The USGS Thesaurus defines Thermal maturation as: Chemical alteration of organic material within sediments and sedimentary rocks as a result of heat. Measures of thermal maturation indicate the extent of transformation of detrital organic material into coal and petroleum. This category is also used for thermal indices , thermal maturity , and vitrinite reflectance","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1699","kind":"concept","label":"Deformation (geologic)","sources":[{"id":"usgs-thesaurus.1699","title":"USGS Thesaurus term 1699","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1699"}],"status":"reported","summary":"The USGS Thesaurus defines Deformation (geologic) as: Change in form and structure of geologic materials in response to stress, typically heat and pressure. This category is also used for rheology and strain history","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.248","kind":"concept","label":"Diagenesis","sources":[{"id":"usgs-thesaurus.248","title":"USGS Thesaurus term 248","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=248"}],"status":"reported","summary":"The USGS Thesaurus defines Diagenesis as: Chemical, physical, and biological changes in sediment during and after its conversion to rock (lithification).","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1683","kind":"concept","label":"Earth tides","sources":[{"id":"usgs-thesaurus.1683","title":"USGS Thesaurus term 1683","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1683"}],"status":"reported","summary":"The USGS Thesaurus defines Earth tides as: Periodic changes in the earth surface topography caused by the gravitational attraction of the moon and sun, measured with tiltmeters. Used in studies of volcanic activity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.304","kind":"concept","label":"Earthquakes","sources":[{"id":"usgs-thesaurus.304","title":"USGS Thesaurus term 304","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=304"}],"status":"reported","summary":"The USGS Thesaurus defines Earthquakes as: Ground shaking caused by the sudden release of accumulated strain by an abrupt shift of rock along a fracture in the earth or by volcanic or magmatic activity, or other sudden stress changes in the earth. This category is also used with hazards for earthquake hazards","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.353","kind":"concept","label":"Erosion","sources":[{"id":"usgs-thesaurus.353","title":"USGS Thesaurus term 353","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=353"}],"status":"reported","summary":"The USGS Thesaurus defines Erosion as: The process whereby materials of the earth's crust are loosened, dissolved, or worn away and simultaneously moved from one place to another. This category is also used with coastal processes for beach erosion , with coastal processes for coastal erosion , dissolution , with coastal processes for shoreline erosion , with coastal processes for shoreline retreat , and with wind for wind erosion","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.2282","kind":"concept","label":"Fluid migration","sources":[{"id":"usgs-thesaurus.2282","title":"USGS Thesaurus term 2282","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2282"}],"status":"reported","summary":"The USGS Thesaurus defines Fluid migration as: Movement or migration of fluids, including petroleum and other chemicals through earth materials by natural or anthropogenic forces. This category is also used for interstitial fluid and pore fluid","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.482","kind":"concept","label":"Glaciation","sources":[{"id":"usgs-thesaurus.482","title":"USGS Thesaurus term 482","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=482"}],"status":"reported","summary":"The USGS Thesaurus defines Glaciation as: The geologic processes involved in the formation, movement, changes, and effects of large ice masses (glaciers).","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.534","kind":"concept","label":"Heat flow (earth)","sources":[{"id":"usgs-thesaurus.534","title":"USGS Thesaurus term 534","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=534"}],"status":"reported","summary":"The USGS Thesaurus defines Heat flow (earth) as: Energy transferred by a difference in temperature through the surface of the earth. This category is also used for geothermics and heatflow (earth)","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.562","kind":"concept","label":"Hydrothermal processes","sources":[{"id":"usgs-thesaurus.562","title":"USGS Thesaurus term 562","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=562"}],"status":"reported","summary":"The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.608","kind":"concept","label":"Isostasy","sources":[{"id":"usgs-thesaurus.608","title":"USGS Thesaurus term 608","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=608"}],"status":"reported","summary":"The USGS Thesaurus defines Isostasy as: Condition of equilibrium or buoyancy of the earth's crust above the mantle.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1721","kind":"concept","label":"Magnetic storms","sources":[{"id":"usgs-thesaurus.1721","title":"USGS Thesaurus term 1721","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1721"}],"status":"reported","summary":"The USGS Thesaurus defines Magnetic storms as: A period of time during which the earth's magnetic field varies rapidly. During magnetic storms, satellite electronics can be damaged through the build up and subsequent discharge of static electric charges and astronauts and high-altitude pilots can be subjected to increased levels of radiation. This category is also used for geomagnetic storms","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.727","kind":"concept","label":"Metamorphism (geological)","sources":[{"id":"usgs-thesaurus.727","title":"USGS Thesaurus term 727","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=727"}],"status":"reported","summary":"The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1034","kind":"concept","label":"Sediment transport","sources":[{"id":"usgs-thesaurus.1034","title":"USGS Thesaurus term 1034","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1034"}],"status":"reported","summary":"The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1036","kind":"concept","label":"Sedimentation","sources":[{"id":"usgs-thesaurus.1036","title":"USGS Thesaurus term 1036","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1036"}],"status":"reported","summary":"The USGS Thesaurus defines Sedimentation as: Process of deposition of sediments (loose, uncemented pieces of rock, mineral fragments, or biological materials). The sediments settle out of water or air into layers on a surface. This category is also used for alluvial sedimentation , deposition (sediment) , and dust deposition","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1736","kind":"concept","label":"Slope processes","sources":[{"id":"usgs-thesaurus.1736","title":"USGS Thesaurus term 1736","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1736"}],"status":"reported","summary":"The USGS Thesaurus defines Slope processes as: The down slope movement of earth material under the influence of gravity. This category is also used for mass wasting and soil creep","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1710","kind":"concept","label":"Soil formation","sources":[{"id":"usgs-thesaurus.1710","title":"USGS Thesaurus term 1710","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1710"}],"status":"reported","summary":"The USGS Thesaurus defines Soil formation as: Geological, geochemical, and ecological processes that work together to produce soils. This category is also used for pedogenesis","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.624","kind":"concept","label":"Subsidence","sources":[{"id":"usgs-thesaurus.624","title":"USGS Thesaurus term 624","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=624"}],"status":"reported","summary":"The USGS Thesaurus defines Subsidence as: Settling, compaction, or caving in of land caused by subsurface mining, ground-water withdrawal, or pumping of oil and gas. This category is also used for land subsidence and with maps and atlases for land subsidence maps","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1145","kind":"concept","label":"Tectonic processes","sources":[{"id":"usgs-thesaurus.1145","title":"USGS Thesaurus term 1145","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1145"}],"status":"reported","summary":"The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1751","kind":"concept","label":"Uplift","sources":[{"id":"usgs-thesaurus.1751","title":"USGS Thesaurus term 1751","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1751"}],"status":"reported","summary":"The USGS Thesaurus defines Uplift as: Local or regional rise in the elevation of the land surface, usually due to tectonic or volcanic processes.","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1286","kind":"concept","label":"Volcanic activity","sources":[{"id":"usgs-thesaurus.1286","title":"USGS Thesaurus term 1286","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1286"}],"status":"reported","summary":"The USGS Thesaurus defines Volcanic activity as: Episodes during which gases, ash, and lava (molten rock) escape from vents in the earth's crust, accompanied by minor tremors. This category is also used for eruption , lava flows , pyroclastic flows , volcanic tremors , volcanism , and with field inventory and monitoring for volcano monitoring","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.398","kind":"concept","label":"Floods","sources":[{"id":"usgs-thesaurus.398","title":"USGS Thesaurus term 398","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=398"}],"status":"reported","summary":"The USGS Thesaurus defines Floods as: Relatively high water that overflows the natural or artificial banks of a stream or coastal area that submerges land not normally below water level. This category is also used for bankfull stage and with hazard preparedness for flood preparedness","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.1692","kind":"concept","label":"Groundwater and surface-water interaction","sources":[{"id":"usgs-thesaurus.1692","title":"USGS Thesaurus term 1692","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1692"}],"status":"reported","summary":"The USGS Thesaurus defines Groundwater and surface-water interaction as: Traditionally, management of water resources has focused on surface water or groundwater as if they were separate entities. As development of land and water resources increases, it is apparent that development of either of these resources affects the quantity and quality of the other. Nearly all surface-water features (streams, lakes, reservoirs, wetlands, and estuaries) interact with groundwater. These interactions take many forms. In many situations, surface-water bodies gain water and solutes from groundwater systems and in others the surface-water body is a source of groundwater recharge and causes changes in groundwater quality. As a result, withdrawal of water from streams can deplete groundwater or conversely, pumpage of groundwater can deplete water in streams, lakes, or wetlands. Pollution of surface water can cause degradation of groundwater quality and conversely pollution of groundwater can degrade surface water. This category is also used for aquifer-surface water interaction , ground-water/surface-water interaction , groundwater/surface water interaction , hyporheic zone processes , surface water/groundwater interaction , and surface-water/ground-water interaction","tags":[]},{"aliases":[],"domain":"earth","era":"undated","frontier":false,"id":"concept.usgs.514","kind":"concept","label":"Groundwater flow","sources":[{"id":"usgs-thesaurus.514","title":"USGS Thesaurus term 514","url":"https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=514"}],"status":"reported","summary":"The USGS Thesaurus defines Groundwater flow as: Movement of subsurface water in the saturated zone from areas of recharge to areas of discharge. This category is also used for ground-water flow , groundwater flow modeling , and groundwater movement","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d004738","kind":"concept","label":"Engineering","sources":[{"id":"nlm-mesh.d004738","title":"NLM MeSH Browser descriptor D004738","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004738"}],"status":"reported","summary":"NLM MeSH describes Engineering as: The practical application of physical, mechanical, and mathematical principles. (Stedman, 25th ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013672","kind":"field","label":"Technology","sources":[{"id":"nlm-mesh.d013672","title":"NLM MeSH Browser descriptor D013672","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013672"}],"status":"reported","summary":"NLM MeSH describes Technology as: The application of scientific knowledge to practical purposes in any field. It includes methods, techniques, and instrumentation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057005","kind":"concept","label":"Bioengineering","sources":[{"id":"nlm-mesh.d057005","title":"NLM MeSH Browser descriptor D057005","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057005"}],"status":"reported","summary":"NLM MeSH describes Bioengineering as: The application of engineering principles and methods to living organisms or biological systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001698","kind":"concept","label":"Biomedical Engineering","sources":[{"id":"nlm-mesh.d001698","title":"NLM MeSH Browser descriptor D001698","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001698"}],"status":"reported","summary":"NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d002616","kind":"concept","label":"Chemical Engineering","sources":[{"id":"nlm-mesh.d002616","title":"NLM MeSH Browser descriptor D002616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D002616"}],"status":"reported","summary":"NLM MeSH describes Chemical Engineering as: Application of principles and practices of engineering science to the transformation, design, and manufacture of substances on an industrial scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d006804","kind":"field","label":"Ergonomics","sources":[{"id":"nlm-mesh.d006804","title":"NLM MeSH Browser descriptor D006804","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006804"}],"status":"reported","summary":"NLM MeSH describes Ergonomics as: The science of designing, building or equipping mechanical devices or artificial environments to the anthropometric, physiological, or psychological requirements of the people who will use them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055095","kind":"field","label":"Optics and Photonics","sources":[{"id":"nlm-mesh.d055095","title":"NLM MeSH Browser descriptor D055095","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055095"}],"status":"reported","summary":"NLM MeSH describes Optics and Photonics as: A specialized field of physics and engineering involved in studying the behavior and properties of light and the technology of analyzing, generating, transmitting, and manipulating ELECTROMAGNETIC RADIATION in the visible, infrared, and ultraviolet range.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058996","kind":"concept","label":"Quality Improvement","sources":[{"id":"nlm-mesh.d058996","title":"NLM MeSH Browser descriptor D058996","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058996"}],"status":"reported","summary":"NLM MeSH describes Quality Improvement as: The attainment or process of attaining a new level of performance or quality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d012498","kind":"concept","label":"Sanitary Engineering","sources":[{"id":"nlm-mesh.d012498","title":"NLM MeSH Browser descriptor D012498","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012498"}],"status":"reported","summary":"NLM MeSH describes Sanitary Engineering as: A branch of engineering concerned with the design, construction, and maintenance of environmental facilities conducive to public health, such as water supply and waste disposal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000067568","kind":"field","label":"Culturally Appropriate Technology","sources":[{"id":"nlm-mesh.d000067568","title":"NLM MeSH Browser descriptor D000067568","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067568"}],"status":"reported","summary":"NLM MeSH describes Culturally Appropriate Technology as: A SCIENCE or TECHNOLOGY that promotes self-sufficiency and is suitable to the cultural, environmental, economic and social conditions of the geographic area in which it is applied.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001331","kind":"concept","label":"Automation","sources":[{"id":"nlm-mesh.d001331","title":"NLM MeSH Browser descriptor D001331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001331"}],"status":"reported","summary":"NLM MeSH describes Automation as: Controlled operation of an apparatus, process, or system by mechanical or electronic devices that take the place of human organs of observation, effort, and decision. (From Webster's Collegiate Dictionary, 1993)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000082222","kind":"field","label":"Digital Technology","sources":[{"id":"nlm-mesh.d000082222","title":"NLM MeSH Browser descriptor D000082222","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000082222"}],"status":"reported","summary":"NLM MeSH describes Digital Technology as: The design and development of devices and procedures that collect, store, analyze, manipulate, and display numerically encoded information, usually via processes encoded in the binary number system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000079203","kind":"field","label":"Disruptive Technology","sources":[{"id":"nlm-mesh.d000079203","title":"NLM MeSH Browser descriptor D000079203","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000079203"}],"status":"reported","summary":"NLM MeSH describes Disruptive Technology as: A process by which a product or service takes root initially in simple applications at the bottom of a market and then relentlessly moves up market, eventually displacing established competitors. (http://www.claytonchristensen.com/key-concepts)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d018961","kind":"field","label":"Educational Technology","sources":[{"id":"nlm-mesh.d018961","title":"NLM MeSH Browser descriptor D018961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018961"}],"status":"reported","summary":"NLM MeSH describes Educational Technology as: Systematic identification, development, organization, or utilization of educational resources and the management of these processes. It is occasionally used also in a more limited sense to describe the use of equipment-oriented techniques or audiovisual aids in educational settings. (Thesaurus of ERIC Descriptors, December 1993, p132)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055772","kind":"field","label":"Green Chemistry Technology","sources":[{"id":"nlm-mesh.d055772","title":"NLM MeSH Browser descriptor D055772","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055772"}],"status":"reported","summary":"NLM MeSH describes Green Chemistry Technology as: Pollution prevention through the design of effective chemical products that have low or no toxicity and use of chemical processes that reduce or eliminate the use and generation of hazardous substances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000089862","kind":"field","label":"Haptic Technology","sources":[{"id":"nlm-mesh.d000089862","title":"NLM MeSH Browser descriptor D000089862","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089862"}],"status":"reported","summary":"NLM MeSH describes Haptic Technology as: The study of the use of touch and KINESTHESIS in order to produce HAPTIC COMPUTER INTERFACES that will allow users to interact with digital objects by kinesthetic feedback, force feedback, and tactile feedback.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d062069","kind":"concept","label":"Inventions","sources":[{"id":"nlm-mesh.d062069","title":"NLM MeSH Browser descriptor D062069","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062069"}],"status":"reported","summary":"NLM MeSH describes Inventions as: A novel composition, device, or process, independently conceived de novo or derived from a pre-existing model.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008328","kind":"concept","label":"Man-Machine Systems","sources":[{"id":"nlm-mesh.d008328","title":"NLM MeSH Browser descriptor D008328","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008328"}],"status":"reported","summary":"NLM MeSH describes Man-Machine Systems as: A system in which the functions of the man and the machine are interrelated and necessary for the operation of the system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000074266","kind":"field","label":"Materials Science","sources":[{"id":"nlm-mesh.d000074266","title":"NLM MeSH Browser descriptor D000074266","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000074266"}],"status":"reported","summary":"NLM MeSH describes Materials Science as: An interdisciplinary study of the microstructure and composition of various materials such as metals, semiconductors, ceramics, and polymers, in relation to their macromolecular physical and chemical properties. Materials science enables the custom creation of new materials with specific properties and uses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013677","kind":"field","label":"Medical Laboratory Science","sources":[{"id":"nlm-mesh.d013677","title":"NLM MeSH Browser descriptor D013677","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013677"}],"status":"reported","summary":"NLM MeSH describes Medical Laboratory Science as: The specialty related to the performance of techniques in clinical pathology such as those in hematology, microbiology, and other general clinical laboratory applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008904","kind":"concept","label":"Miniaturization","sources":[{"id":"nlm-mesh.d008904","title":"NLM MeSH Browser descriptor D008904","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008904"}],"status":"reported","summary":"NLM MeSH describes Miniaturization as: The design or construction of objects greatly reduced in scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d066330","kind":"concept","label":"Printing, Three-Dimensional","sources":[{"id":"nlm-mesh.d066330","title":"NLM MeSH Browser descriptor D066330","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066330"}],"status":"reported","summary":"NLM MeSH describes Printing, Three-Dimensional as: Process for making, building or constructing a physical object from a three-dimensional digital model by laying down many successive thin layers of building material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d011786","kind":"concept","label":"Quality Control","sources":[{"id":"nlm-mesh.d011786","title":"NLM MeSH Browser descriptor D011786","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011786"}],"status":"reported","summary":"NLM MeSH describes Quality Control as: A system for verifying and maintaining a desired level of quality in a product or process by careful planning, use of proper equipment, continued inspection, and corrective action as required. (Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013674","kind":"field","label":"Technology, Dental","sources":[{"id":"nlm-mesh.d013674","title":"NLM MeSH Browser descriptor D013674","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013674"}],"status":"reported","summary":"NLM MeSH describes Technology, Dental as: The field of dentistry involved in procedures for designing and constructing dental appliances. It includes also the application of any technology to the field of dentistry.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013678","kind":"field","label":"Technology, Pharmaceutical","sources":[{"id":"nlm-mesh.d013678","title":"NLM MeSH Browser descriptor D013678","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013678"}],"status":"reported","summary":"NLM MeSH describes Technology, Pharmaceutical as: The application of scientific knowledge or technology to pharmacy and the pharmaceutical industry. It includes methods, techniques, and instrumentation in the manufacture, preparation, compounding, dispensing, packaging, and storing of drugs and other preparations used in diagnostic and determinative procedures, and in the treatment of patients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d013679","kind":"field","label":"Technology, Radiologic","sources":[{"id":"nlm-mesh.d013679","title":"NLM MeSH Browser descriptor D013679","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013679"}],"status":"reported","summary":"NLM MeSH describes Technology, Radiologic as: The application of scientific knowledge or technology to the field of radiology. The applications center mostly around x-ray or radioisotopes for diagnostic and therapeutic purposes but the technological applications of any radiation or radiologic procedure is within the scope of radiologic technology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d018581","kind":"concept","label":"Technology Transfer","sources":[{"id":"nlm-mesh.d018581","title":"NLM MeSH Browser descriptor D018581","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018581"}],"status":"reported","summary":"NLM MeSH describes Technology Transfer as: Spread and adoption of inventions and techniques from one geographic area to another, from one discipline to another, or from one sector of the economy to another. For example, improvements in medical equipment may be transferred from industrial countries to developing countries, advances arising from aerospace engineering may be applied to equipment for persons with disabilities, and innovations in science arising from government research are made available to private enterprise.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d062028","kind":"concept","label":"Bioprinting","sources":[{"id":"nlm-mesh.d062028","title":"NLM MeSH Browser descriptor D062028","url":"https://meshb.nlm.nih.gov/record/ui?ui=D062028"}],"status":"reported","summary":"NLM MeSH describes Bioprinting as: A material transfer technique used for assembling biological material or cells into a prescribed organization to create functional structures such as MICROCHIP ANALYTICAL DEVICES , cell microarrays, or three dimensional anatomical structures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060846","kind":"concept","label":"Cell Engineering","sources":[{"id":"nlm-mesh.d060846","title":"NLM MeSH Browser descriptor D060846","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060846"}],"status":"reported","summary":"NLM MeSH describes Cell Engineering as: Methods and techniques used to modify or select cells and develop conditions for growing cells for biosynthetic production of molecules ( METABOLIC ENGINEERING ), for generation of tissue structures and organs in vitro ( TISSUE ENGINEERING ), or for other BIOENGINEERING research objectives.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d058615","kind":"field","label":"Synthetic Biology","sources":[{"id":"nlm-mesh.d058615","title":"NLM MeSH Browser descriptor D058615","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058615"}],"status":"reported","summary":"NLM MeSH describes Synthetic Biology as: A field of biological research combining engineering in the formulation, design, and building (synthesis) of novel biological structures, functions, and systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000084542","kind":"field","label":"Eye-Tracking Technology","sources":[{"id":"nlm-mesh.d000084542","title":"NLM MeSH Browser descriptor D000084542","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000084542"}],"status":"reported","summary":"NLM MeSH describes Eye-Tracking Technology as: Technology used for EYE MOVEMENT MEASUREMENTS , which capture and measure a persons EYE MOVEMENT and/or EYE GAZE","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014881","kind":"concept","label":"Water Supply","sources":[{"id":"nlm-mesh.d014881","title":"NLM MeSH Browser descriptor D014881","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014881"}],"status":"reported","summary":"NLM MeSH describes Water Supply as: Means or process of supplying water (as for a community) usually including reservoirs, tunnels, and pipelines and often the watershed from which the water is ultimately drawn. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000086825","kind":"concept","label":"User-Centered Design","sources":[{"id":"nlm-mesh.d000086825","title":"NLM MeSH Browser descriptor D000086825","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000086825"}],"status":"reported","summary":"NLM MeSH describes User-Centered Design as: Design process using input from users regarding systems, devices, or software.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057205","kind":"concept","label":"Automation, Laboratory","sources":[{"id":"nlm-mesh.d057205","title":"NLM MeSH Browser descriptor D057205","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057205"}],"status":"reported","summary":"NLM MeSH describes Automation, Laboratory as: Controlled operations of analytic or diagnostic processes, or systems by mechanical or electronic devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000098451","kind":"concept","label":"Multiple-Instance Learning Algorithms","sources":[{"id":"nlm-mesh.d000098451","title":"NLM MeSH Browser descriptor D000098451","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098451"}],"status":"reported","summary":"NLM MeSH describes Multiple-Instance Learning Algorithms as: Weakly supervised learning algorithms where training set is arranged in a labeled bag of instances, and a single class label is assigned to a bag.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d012371","kind":"field","label":"Robotics","sources":[{"id":"nlm-mesh.d012371","title":"NLM MeSH Browser descriptor D012371","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012371"}],"status":"reported","summary":"NLM MeSH describes Robotics as: The application of electronic, computerized control systems to mechanical devices designed to perform human functions. Formerly restricted to industry, but nowadays applied to artificial organs controlled by bionic (bioelectronic) devices, like automated insulin pumps and other prostheses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d020811","kind":"field","label":"Biomedical Technology","sources":[{"id":"nlm-mesh.d020811","title":"NLM MeSH Browser descriptor D020811","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020811"}],"status":"reported","summary":"NLM MeSH describes Biomedical Technology as: The application of technology to the solution of medical problems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d032701","kind":"field","label":"Biomimetics","sources":[{"id":"nlm-mesh.d032701","title":"NLM MeSH Browser descriptor D032701","url":"https://meshb.nlm.nih.gov/record/ui?ui=D032701"}],"status":"reported","summary":"NLM MeSH describes Biomimetics as: An interdisciplinary field in materials science, ENGINEERING , and BIOLOGY , studying the use of biological principles for synthesis or fabrication of BIOMIMETIC MATERIALS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d019149","kind":"concept","label":"Bioreactors","sources":[{"id":"nlm-mesh.d019149","title":"NLM MeSH Browser descriptor D019149","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019149"}],"status":"reported","summary":"NLM MeSH describes Bioreactors as: Tools or devices for generating products using the synthetic or chemical conversion capacity of a biological system. They can be classical fermentors, cell culture perfusion systems, or enzyme bioreactors. For production of proteins or enzymes, recombinant microorganisms such as bacteria, mammalian cells, or insect or plant cells are usually chosen.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d007218","kind":"field","label":"Industrial Microbiology","sources":[{"id":"nlm-mesh.d007218","title":"NLM MeSH Browser descriptor D007218","url":"https://meshb.nlm.nih.gov/record/ui?ui=D007218"}],"status":"reported","summary":"NLM MeSH describes Industrial Microbiology as: The study, utilization, and manipulation of those microorganisms capable of economically producing desirable substances or changes in substances, and the control of undesirable microorganisms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001296","kind":"concept","label":"Audiovisual Aids","sources":[{"id":"nlm-mesh.d001296","title":"NLM MeSH Browser descriptor D001296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001296"}],"status":"reported","summary":"NLM MeSH describes Audiovisual Aids as: Auditory and visual instructional materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000080048","kind":"field","label":"Hot Melt Extrusion Technology","sources":[{"id":"nlm-mesh.d000080048","title":"NLM MeSH Browser descriptor D000080048","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080048"}],"status":"reported","summary":"NLM MeSH describes Hot Melt Extrusion Technology as: Solvent-free method for preparing numerous types of drug delivery systems and dosage forms for active pharmaceutical ingredients that have solubility issues. It involves pumping polymeric materials at temperatures above their glass transition temperature to mix in active pharmaceutical ingredients with or without binders thus forming an amorphous product with an increase in the dissolution profile for the active pharmaceutical ingredients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d055616","kind":"field","label":"Microtechnology","sources":[{"id":"nlm-mesh.d055616","title":"NLM MeSH Browser descriptor D055616","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055616"}],"status":"reported","summary":"NLM MeSH describes Microtechnology as: Manufacturing technology for making microscopic devices in the micrometer range (typically 1-100 micrometers), such as integrated circuits or MEMS . The process usually involves replication and parallel fabrication of hundreds or millions of identical structures using various thin film deposition techniques and carried out in environmentally-controlled clean rooms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d000076227","kind":"field","label":"Stereolithography","sources":[{"id":"nlm-mesh.d000076227","title":"NLM MeSH Browser descriptor D000076227","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000076227"}],"status":"reported","summary":"NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d059021","kind":"concept","label":"Laboratory Proficiency Testing","sources":[{"id":"nlm-mesh.d059021","title":"NLM MeSH Browser descriptor D059021","url":"https://meshb.nlm.nih.gov/record/ui?ui=D059021"}],"status":"reported","summary":"NLM MeSH describes Laboratory Proficiency Testing as: Assessments aimed at determining agreement in diagnostic test results among laboratories. Identical survey samples are distributed to participating laboratories, with results stratified according to testing methodologies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060326","kind":"concept","label":"Chemistry Techniques, Synthetic","sources":[{"id":"nlm-mesh.d060326","title":"NLM MeSH Browser descriptor D060326","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060326"}],"status":"reported","summary":"NLM MeSH describes Chemistry Techniques, Synthetic as: Methods used for the chemical synthesis of compounds. Included under this heading are laboratory methods used to synthesize a variety of chemicals and drugs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058634","kind":"concept","label":"Molecular Farming","sources":[{"id":"nlm-mesh.d058634","title":"NLM MeSH Browser descriptor D058634","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058634"}],"status":"reported","summary":"NLM MeSH describes Molecular Farming as: The large scale production of pharmaceutically important and commercially valuable RECOMBINANT PROTEINS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060847","kind":"concept","label":"Metabolic Engineering","sources":[{"id":"nlm-mesh.d060847","title":"NLM MeSH Browser descriptor D060847","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060847"}],"status":"reported","summary":"NLM MeSH describes Metabolic Engineering as: Methods and techniques used to genetically modify cells' biosynthetic product output and develop conditions for growing the cells as BIOREACTORS .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060986","kind":"concept","label":"Water Wells","sources":[{"id":"nlm-mesh.d060986","title":"NLM MeSH Browser descriptor D060986","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060986"}],"status":"reported","summary":"NLM MeSH describes Water Wells as: Constructions built to access underground water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000098402","kind":"concept","label":"Autonomous Robots","sources":[{"id":"nlm-mesh.d000098402","title":"NLM MeSH Browser descriptor D000098402","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098402"}],"status":"reported","summary":"NLM MeSH describes Autonomous Robots as: Machines that are engineered to learn about their environment and make decisions to complete tasks with little to no human intervention. These robots may be designed to complete tasks such as patient intervention, remote monitoring, inventory transportation, among many others.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d065287","kind":"concept","label":"Robotic Surgical Procedures","sources":[{"id":"nlm-mesh.d065287","title":"NLM MeSH Browser descriptor D065287","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065287"}],"status":"reported","summary":"NLM MeSH describes Robotic Surgical Procedures as: Surgical procedures performed remotely using a computer that controls surgical instruments attached to mechanical arms designed to perform the tasks of the surgeon.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d024803","kind":"concept","label":"Biomedical Enhancement","sources":[{"id":"nlm-mesh.d024803","title":"NLM MeSH Browser descriptor D024803","url":"https://meshb.nlm.nih.gov/record/ui?ui=D024803"}],"status":"reported","summary":"NLM MeSH describes Biomedical Enhancement as: The use of technology-based interventions to improve functional capacities rather than to treat disease.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d050997","kind":"concept","label":"Nanomedicine","sources":[{"id":"nlm-mesh.d050997","title":"NLM MeSH Browser descriptor D050997","url":"https://meshb.nlm.nih.gov/record/ui?ui=D050997"}],"status":"reported","summary":"NLM MeSH describes Nanomedicine as: The branch of medicine concerned with the application of NANOTECHNOLOGY to the prevention and treatment of disease. It involves the monitoring, repair, construction, and control of human biological systems at the molecular level, using engineered nanodevices and NANOSTRUCTURES . (From Freitas Jr., Nanomedicine, vol 1, 1999).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d058433","kind":"concept","label":"Photobioreactors","sources":[{"id":"nlm-mesh.d058433","title":"NLM MeSH Browser descriptor D058433","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058433"}],"status":"reported","summary":"NLM MeSH describes Photobioreactors as: Devices for generating biological products that use light as the energy source. They are used for controlled BIOMASS production such as growing cyanobacteria, mosses, or algae.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d001878","kind":"concept","label":"Books, Illustrated","sources":[{"id":"nlm-mesh.d001878","title":"NLM MeSH Browser descriptor D001878","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001878"}],"status":"reported","summary":"NLM MeSH describes Books, Illustrated as: Books containing photographs, prints, drawings, portraits, plates, diagrams, facsimiles, maps, tables, or other representations or systematic arrangement of data designed to elucidate or decorate its contents. (From The ALA Glossary of Library and Information Science, 1983, p114)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008961","kind":"concept","label":"Models, Structural","sources":[{"id":"nlm-mesh.d008961","title":"NLM MeSH Browser descriptor D008961","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008961"}],"status":"reported","summary":"NLM MeSH describes Models, Structural as: A representation, generally small in scale, to show the structure, construction, or appearance of something. (From Random House Unabridged Dictionary, 2d ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d009040","kind":"concept","label":"Motion Pictures","sources":[{"id":"nlm-mesh.d009040","title":"NLM MeSH Browser descriptor D009040","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009040"}],"status":"reported","summary":"NLM MeSH describes Motion Pictures as: The art, technique, or business of producing motion pictures for entertainment, propaganda, or instruction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d019212","kind":"concept","label":"Multimedia","sources":[{"id":"nlm-mesh.d019212","title":"NLM MeSH Browser descriptor D019212","url":"https://meshb.nlm.nih.gov/record/ui?ui=D019212"}],"status":"reported","summary":"NLM MeSH describes Multimedia as: Materials, frequently computer applications, that combine some or all of text, sound, graphics, animation, and video into integrated packages. (Thesaurus of ERIC Descriptors, 1994)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d016249","kind":"concept","label":"Optical Storage Devices","sources":[{"id":"nlm-mesh.d016249","title":"NLM MeSH Browser descriptor D016249","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016249"}],"status":"reported","summary":"NLM MeSH describes Optical Storage Devices as: A computer disk read by a laser beam, containing data prerecorded by a vendor. The buyer cannot enter or modify data in any way but the advantages lie in the speed of accessibility, relative immunity to damage, and relatively low cost of purchase.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d011845","kind":"concept","label":"Radio","sources":[{"id":"nlm-mesh.d011845","title":"NLM MeSH Browser descriptor D011845","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011845"}],"status":"reported","summary":"NLM MeSH describes Radio as: The transmission and reception of electric impulses or signals by means of electric waves without a connecting wire, or the use of these waves for the wireless transmission of electric impulses into which sound is converted. (From Webster's 3d)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d000087983","kind":"concept","label":"Sound Recordings","sources":[{"id":"nlm-mesh.d000087983","title":"NLM MeSH Browser descriptor D000087983","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000087983"}],"status":"reported","summary":"NLM MeSH describes Sound Recordings as: The storing of sound signals on various media such as cylinders, analog discs, digital discs, tapes, and wires.[LCSH, 10/27/2020]","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d013637","kind":"concept","label":"Tape Recording","sources":[{"id":"nlm-mesh.d013637","title":"NLM MeSH Browser descriptor D013637","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013637"}],"status":"reported","summary":"NLM MeSH describes Tape Recording as: Recording of information on magnetic or punched paper tape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d013690","kind":"concept","label":"Television","sources":[{"id":"nlm-mesh.d013690","title":"NLM MeSH Browser descriptor D013690","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013690"}],"status":"reported","summary":"NLM MeSH describes Television as: The transmission and reproduction of transient images of fixed or moving objects. An electronic system of transmitting such images together with sound over a wire or through space by apparatus that converts light and sound into electrical waves and reconverts them into visible light rays and audible sound. (From Webster, 3rd ed)","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.mesh.d044085","kind":"field","label":"Microfluidics","sources":[{"id":"nlm-mesh.d044085","title":"NLM MeSH Browser descriptor D044085","url":"https://meshb.nlm.nih.gov/record/ui?ui=D044085"}],"status":"reported","summary":"NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d057930","kind":"concept","label":"Click Chemistry","sources":[{"id":"nlm-mesh.d057930","title":"NLM MeSH Browser descriptor D057930","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057930"}],"status":"reported","summary":"NLM MeSH describes Click Chemistry as: Organic chemistry methodology that mimics the modular nature of various biosynthetic processes. It uses highly reliable and selective reactions designed to click i.e., rapidly join small modular units together in high yield, without offensive byproducts. In combination with COMBINATORIAL CHEMISTRY TECHNIQUES , it is used for the synthesis of new compounds and combinatorial libraries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d020650","kind":"concept","label":"Combinatorial Chemistry Techniques","sources":[{"id":"nlm-mesh.d020650","title":"NLM MeSH Browser descriptor D020650","url":"https://meshb.nlm.nih.gov/record/ui?ui=D020650"}],"status":"reported","summary":"NLM MeSH describes Combinatorial Chemistry Techniques as: A technology, in which sets of reactions for solution or solid-phase synthesis, is used to create molecular libraries for analysis of compounds on a large scale.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d061565","kind":"concept","label":"Cycloaddition Reaction","sources":[{"id":"nlm-mesh.d061565","title":"NLM MeSH Browser descriptor D061565","url":"https://meshb.nlm.nih.gov/record/ui?ui=D061565"}],"status":"reported","summary":"NLM MeSH describes Cycloaddition Reaction as: Synthetic organic reactions that use reactions between unsaturated molecules to form cyclical products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d054802","kind":"concept","label":"Molecular Imprinting","sources":[{"id":"nlm-mesh.d054802","title":"NLM MeSH Browser descriptor D054802","url":"https://meshb.nlm.nih.gov/record/ui?ui=D054802"}],"status":"reported","summary":"NLM MeSH describes Molecular Imprinting as: A methodology for chemically synthesizing polymer molds of specific molecules or recognition sites of specific molecules. Applications for MOLECULARLY IMPRINTED POLYMERS (MIPs) include separations, assays and biosensors, and catalysis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d060327","kind":"concept","label":"Solid-Phase Synthesis Techniques","sources":[{"id":"nlm-mesh.d060327","title":"NLM MeSH Browser descriptor D060327","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060327"}],"status":"reported","summary":"NLM MeSH describes Solid-Phase Synthesis Techniques as: Techniques used to synthesize chemicals using molecular substrates that are bound to a solid surface. Typically a series of reactions are conducted on the bound substrate that results in either the covalent attachment of specific moieties or the modification of existing function groups. These techniques offer an advantage to those involving solution reactions in that the substrate compound does not have to be isolated and purified between the reaction steps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d024861","kind":"concept","label":"Genetic Enhancement","sources":[{"id":"nlm-mesh.d024861","title":"NLM MeSH Browser descriptor D024861","url":"https://meshb.nlm.nih.gov/record/ui?ui=D024861"}],"status":"reported","summary":"NLM MeSH describes Genetic Enhancement as: The use of genetic methodologies to improve functional capacities of an organism rather than to treat disease.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d008953","kind":"concept","label":"Models, Anatomic","sources":[{"id":"nlm-mesh.d008953","title":"NLM MeSH Browser descriptor D008953","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008953"}],"status":"reported","summary":"NLM MeSH describes Models, Anatomic as: Three-dimensional representation to show anatomic structures. Models may be used in place of intact animals or organisms for teaching, practice, and study.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014742","kind":"concept","label":"Videodisc Recording","sources":[{"id":"nlm-mesh.d014742","title":"NLM MeSH Browser descriptor D014742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014742"}],"status":"reported","summary":"NLM MeSH describes Videodisc Recording as: The storing of visual and usually sound signals on discs for later reproduction on a television screen or monitor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d014743","kind":"concept","label":"Videotape Recording","sources":[{"id":"nlm-mesh.d014743","title":"NLM MeSH Browser descriptor D014743","url":"https://meshb.nlm.nih.gov/record/ui?ui=D014743"}],"status":"reported","summary":"NLM MeSH describes Videotape Recording as: Recording of visual and sometimes sound signals on magnetic tape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d018715","kind":"concept","label":"Microscopy, Video","sources":[{"id":"nlm-mesh.d018715","title":"NLM MeSH Browser descriptor D018715","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018715"}],"status":"reported","summary":"NLM MeSH describes Microscopy, Video as: Microscopy in which television cameras are used to brighten magnified images that are otherwise too dark to be seen with the naked eye. It is used frequently in TELEPATHOLOGY .","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.mesh.d052156","kind":"concept","label":"SELEX Aptamer Technique","sources":[{"id":"nlm-mesh.d052156","title":"NLM MeSH Browser descriptor D052156","url":"https://meshb.nlm.nih.gov/record/ui?ui=D052156"}],"status":"reported","summary":"NLM MeSH describes SELEX Aptamer Technique as: A method of generating a large library of randomized nucleotides and selecting NUCLEOTIDE APTAMERS by iterative rounds of in vitro selection. A modified procedure substitutes AMINO ACIDS in place of NUCLEOTIDES to make PEPTIDE APTAMERS .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d015984","kind":"concept","label":"Causality","sources":[{"id":"nlm-mesh.d015984","title":"NLM MeSH Browser descriptor D015984","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015984"}],"status":"reported","summary":"NLM MeSH describes Causality as: The relating of causes to the effects they produce. Causes are termed necessary when they must always precede an effect and sufficient when they initiate or produce an effect. Any of several factors may be associated with the potential disease causation or outcome, including predisposing factors, enabling factors, precipitating factors, reinforcing factors, and risk factors.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012107","kind":"concept","label":"Research Design","sources":[{"id":"nlm-mesh.d012107","title":"NLM MeSH Browser descriptor D012107","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012107"}],"status":"reported","summary":"NLM MeSH describes Research Design as: A plan for collecting and utilizing data so that desired information can be obtained with sufficient precision or so that an hypothesis can be tested properly.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d012586","kind":"field","label":"Science","sources":[{"id":"nlm-mesh.d012586","title":"NLM MeSH Browser descriptor D012586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012586"}],"status":"reported","summary":"NLM MeSH describes Science as: The study of natural phenomena by observation, measurement, and experimentation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d015985","kind":"concept","label":"Precipitating Factors","sources":[{"id":"nlm-mesh.d015985","title":"NLM MeSH Browser descriptor D015985","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015985"}],"status":"reported","summary":"NLM MeSH describes Precipitating Factors as: Factors associated with the definitive onset of a disease, illness, accident, behavioral response, or course of action. Usually one factor is more important or more obviously recognizable than others, if several are involved, and one may often be regarded as necessary. Examples include exposure to specific disease; amount or level of an infectious organism, drug, or noxious agent, etc.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d065840","kind":"concept","label":"Protective Factors","sources":[{"id":"nlm-mesh.d065840","title":"NLM MeSH Browser descriptor D065840","url":"https://meshb.nlm.nih.gov/record/ui?ui=D065840"}],"status":"reported","summary":"NLM MeSH describes Protective Factors as: An aspect of personal behavior or lifestyle, environmental exposure, or inborn or inherited characteristic, which, on the basis of epidemiologic evidence, is known to be associated with prevention or mitigation of a health-related condition considered important to prevent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012307","kind":"concept","label":"Risk Factors","sources":[{"id":"nlm-mesh.d012307","title":"NLM MeSH Browser descriptor D012307","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012307"}],"status":"reported","summary":"NLM MeSH describes Risk Factors as: An aspect of personal behavior or lifestyle, environmental exposure, inborn or inherited characteristic, which, based on epidemiological evidence, is known to be associated with a health-related condition considered important to prevent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035061","kind":"concept","label":"Control Groups","sources":[{"id":"nlm-mesh.d035061","title":"NLM MeSH Browser descriptor D035061","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035061"}],"status":"reported","summary":"NLM MeSH describes Control Groups as: Groups that serve as a standard for comparison in experimental studies. They are similar in relevant characteristics to the experimental group but do not receive the experimental intervention.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d004311","kind":"concept","label":"Double-Blind Method","sources":[{"id":"nlm-mesh.d004311","title":"NLM MeSH Browser descriptor D004311","url":"https://meshb.nlm.nih.gov/record/ui?ui=D004311"}],"status":"reported","summary":"NLM MeSH describes Double-Blind Method as: A method of studying a drug or procedure in which both the subjects and investigators are kept unaware of who is actually getting which specific treatment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d011897","kind":"concept","label":"Random Allocation","sources":[{"id":"nlm-mesh.d011897","title":"NLM MeSH Browser descriptor D011897","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011897"}],"status":"reported","summary":"NLM MeSH describes Random Allocation as: A process involving chance used in therapeutic trials or other research endeavor for allocating experimental subjects, human or animal, between treatment and control groups, or among treatment groups. It may also apply to experiments on inanimate objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d018401","kind":"concept","label":"Sample Size","sources":[{"id":"nlm-mesh.d018401","title":"NLM MeSH Browser descriptor D018401","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018401"}],"status":"reported","summary":"NLM MeSH describes Sample Size as: The number of units (persons, animals, patients, specified circumstances, etc.) in a population to be studied. The sample size should be big enough to have a high likelihood of detecting a true difference between two groups. (From Wassertheil-Smoller, Biostatistics and Epidemiology, 1990, p95)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d012106","kind":"concept","label":"Research","sources":[{"id":"nlm-mesh.d012106","title":"NLM MeSH Browser descriptor D012106","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012106"}],"status":"reported","summary":"NLM MeSH describes Research as: Critical and exhaustive investigation or experimentation, having for its aim the discovery of new facts and their correct interpretation, the revision of accepted conclusions, theories, or laws in the light of newly discovered facts, or the practical application of such new or revised conclusions, theories, or laws. (Webster, 3d ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d018511","kind":"concept","label":"Systems Integration","sources":[{"id":"nlm-mesh.d018511","title":"NLM MeSH Browser descriptor D018511","url":"https://meshb.nlm.nih.gov/record/ui?ui=D018511"}],"status":"reported","summary":"NLM MeSH describes Systems Integration as: The procedures involved in combining separately developed modules, components, or subsystems so that they work together as a complete system. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 4th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d013598","kind":"concept","label":"Systems Theory","sources":[{"id":"nlm-mesh.d013598","title":"NLM MeSH Browser descriptor D013598","url":"https://meshb.nlm.nih.gov/record/ui?ui=D013598"}],"status":"reported","summary":"NLM MeSH describes Systems Theory as: Principles, models, and laws that apply to complex interrelationships and interdependencies of sets of linked components which form a functioning whole, a system. Any system may be composed of components which are systems in their own right (sub-systems), such as several organs within an individual organism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000092003","kind":"concept","label":"Artificial Life","sources":[{"id":"nlm-mesh.d000092003","title":"NLM MeSH Browser descriptor D000092003","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000092003"}],"status":"reported","summary":"NLM MeSH describes Artificial Life as: Research involving the synthesis of life and life-like phenomena and the application of such techniques toward the enhancement of our theoretical understanding of life and life-like phenomena, studied through the use of computer programs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035841","kind":"concept","label":"Behavioral Research","sources":[{"id":"nlm-mesh.d035841","title":"NLM MeSH Browser descriptor D035841","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035841"}],"status":"reported","summary":"NLM MeSH describes Behavioral Research as: Research that involves the application of the behavioral and social sciences to the study of the actions or reactions of persons or animals in response to external or internal stimuli. (from American Heritage Dictionary, 4th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d035843","kind":"concept","label":"Biomedical Research","sources":[{"id":"nlm-mesh.d035843","title":"NLM MeSH Browser descriptor D035843","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035843"}],"status":"reported","summary":"NLM MeSH describes Biomedical Research as: Research that involves the application of the natural sciences, especially biology and physiology, to medicine.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d055812","kind":"concept","label":"Community-Based Participatory Research","sources":[{"id":"nlm-mesh.d055812","title":"NLM MeSH Browser descriptor D055812","url":"https://meshb.nlm.nih.gov/record/ui?ui=D055812"}],"status":"reported","summary":"NLM MeSH describes Community-Based Participatory Research as: Collaborative process of research involving researchers and community representatives.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036262","kind":"concept","label":"Empirical Research","sources":[{"id":"nlm-mesh.d036262","title":"NLM MeSH Browser descriptor D036262","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036262"}],"status":"reported","summary":"NLM MeSH describes Empirical Research as: The study, based on direct observation, use of statistical records, interviews, or experimental methods, of actual practices or the actual impact of practices or policies.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000094505","kind":"concept","label":"Evidence Gaps","sources":[{"id":"nlm-mesh.d000094505","title":"NLM MeSH Browser descriptor D000094505","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000094505"}],"status":"reported","summary":"NLM MeSH describes Evidence Gaps as: Areas where little or no evidence from impact evaluations and SYSTEMATIC REVIEWS is available and where future research should be focused (from https://openknowledge.worldbank.org/handle/10986/16941).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000075762","kind":"concept","label":"Interdisciplinary Research","sources":[{"id":"nlm-mesh.d000075762","title":"NLM MeSH Browser descriptor D000075762","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075762"}],"status":"reported","summary":"NLM MeSH describes Interdisciplinary Research as: Research combining mastery in distinct fields or disciplines that apply and exchange tools, concepts, ideas, data methods, or results around a common project.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d063369","kind":"concept","label":"Knowledge Discovery","sources":[{"id":"nlm-mesh.d063369","title":"NLM MeSH Browser descriptor D063369","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063369"}],"status":"reported","summary":"NLM MeSH describes Knowledge Discovery as: A process that searches for hidden and important connections among information or results.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d009874","kind":"concept","label":"Operations Research","sources":[{"id":"nlm-mesh.d009874","title":"NLM MeSH Browser descriptor D009874","url":"https://meshb.nlm.nih.gov/record/ui?ui=D009874"}],"status":"reported","summary":"NLM MeSH describes Operations Research as: A group of techniques developed to apply scientific methods and tools to solve the problems of DECISION MAKING in complex organizations and systems. Operations research searches for optimal solutions in situations of conflicting GOALS and makes use of mathematical models from which solutions for actual problems may be derived. (From Psychiatric Dictionary, 6th ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d017712","kind":"concept","label":"Peer Review, Research","sources":[{"id":"nlm-mesh.d017712","title":"NLM MeSH Browser descriptor D017712","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017712"}],"status":"reported","summary":"NLM MeSH describes Peer Review, Research as: The evaluation by experts of the quality and pertinence of research or research proposals of other experts in the same field. Peer review is used by editors in deciding which submissions warrant publication, by granting agencies to determine which proposals should be funded, and by academic institutions in tenure decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000075082","kind":"concept","label":"Proof of Concept Study","sources":[{"id":"nlm-mesh.d000075082","title":"NLM MeSH Browser descriptor D000075082","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000075082"}],"status":"reported","summary":"NLM MeSH describes Proof of Concept Study as: An empirical investigation which pertains to the development of prototypes or models that demonstrate the feasibility of novel concepts, ideas, principles, schema or their practical application.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d058028","kind":"concept","label":"Research Report","sources":[{"id":"nlm-mesh.d058028","title":"NLM MeSH Browser descriptor D058028","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058028"}],"status":"reported","summary":"NLM MeSH describes Research Report as: Detailed account or statement or formal record of data resulting from empirical inquiry.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d063586","kind":"concept","label":"Social Validity, Research","sources":[{"id":"nlm-mesh.d063586","title":"NLM MeSH Browser descriptor D063586","url":"https://meshb.nlm.nih.gov/record/ui?ui=D063586"}],"status":"reported","summary":"NLM MeSH describes Social Validity, Research as: Evaluation of the degree of acceptance for the immediate variables associated with a procedure or program designed to change behavior. This includes the social significance of the goals of treatment, the social appropriateness of the treatment procedures, and the social importance of the effects of treatments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d000066949","kind":"field","label":"Biobehavioral Sciences","sources":[{"id":"nlm-mesh.d000066949","title":"NLM MeSH Browser descriptor D000066949","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066949"}],"status":"reported","summary":"NLM MeSH describes Biobehavioral Sciences as: An interdisciplinary scientific approach to the study of complex interactions among biological, social, behavioral and environmental factors.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d033041","kind":"concept","label":"Embryo Research","sources":[{"id":"nlm-mesh.d033041","title":"NLM MeSH Browser descriptor D033041","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033041"}],"status":"reported","summary":"NLM MeSH describes Embryo Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus during the prenatal stage of development that is characterized by rapid morphological changes and the differentiation of basic structures. In humans, this includes the period from the time of fertilization to the end of the eighth week after fertilization.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d033042","kind":"concept","label":"Fetal Research","sources":[{"id":"nlm-mesh.d033042","title":"NLM MeSH Browser descriptor D033042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D033042"}],"status":"reported","summary":"NLM MeSH describes Fetal Research as: Experimentation on, or using the organs or tissues from, a human or other mammalian conceptus in the postembryonic period, after the major structures have been outlined. In humans, this corresponds to the period from the third month after fertilization until birth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036281","kind":"concept","label":"Genetic Research","sources":[{"id":"nlm-mesh.d036281","title":"NLM MeSH Browser descriptor D036281","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036281"}],"status":"reported","summary":"NLM MeSH describes Genetic Research as: Research into the cause, transmission, amelioration, elimination, or enhancement of inherited disorders and traits.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d006302","kind":"concept","label":"Health Services Research","sources":[{"id":"nlm-mesh.d006302","title":"NLM MeSH Browser descriptor D006302","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006302"}],"status":"reported","summary":"NLM MeSH describes Health Services Research as: The integration of epidemiologic, sociological, economic, and other analytic sciences in the study of health services. Health services research is usually concerned with relationships between need, demand, supply, use, and outcome of health services. The aim of the research is evaluation, particularly in terms of structure, process, output, and outcome. (From Last, Dictionary of Epidemiology, 2d ed)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d006805","kind":"concept","label":"Human Experimentation","sources":[{"id":"nlm-mesh.d006805","title":"NLM MeSH Browser descriptor D006805","url":"https://meshb.nlm.nih.gov/record/ui?ui=D006805"}],"status":"reported","summary":"NLM MeSH describes Human Experimentation as: The use of humans as investigational subjects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d017063","kind":"concept","label":"Outcome Assessment, Health Care","sources":[{"id":"nlm-mesh.d017063","title":"NLM MeSH Browser descriptor D017063","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017063"}],"status":"reported","summary":"NLM MeSH describes Outcome Assessment, Health Care as: Research aimed at assessing the quality and effectiveness of health care as measured by the attainment of a specified end result or outcome. Measures include parameters such as improved health, lowered morbidity or mortality, and improvement of abnormal states (such as elevated blood pressure).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000071220","kind":"concept","label":"Pharmaceutical Research","sources":[{"id":"nlm-mesh.d000071220","title":"NLM MeSH Browser descriptor D000071220","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000071220"}],"status":"reported","summary":"NLM MeSH describes Pharmaceutical Research as: RESEARCH activity focused on pharmaceutical products and services.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000070838","kind":"concept","label":"Pharmacy Research","sources":[{"id":"nlm-mesh.d000070838","title":"NLM MeSH Browser descriptor D000070838","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000070838"}],"status":"reported","summary":"NLM MeSH describes Pharmacy Research as: RESEARCH activity focused on PHARMACY .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d000066768","kind":"concept","label":"Rehabilitation Research","sources":[{"id":"nlm-mesh.d000066768","title":"NLM MeSH Browser descriptor D000066768","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000066768"}],"status":"reported","summary":"NLM MeSH describes Rehabilitation Research as: Studies and research concerning the psychological, educational, social, vocational, industrial, and economic aspects of REHABILITATION .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d057905","kind":"concept","label":"Stem Cell Research","sources":[{"id":"nlm-mesh.d057905","title":"NLM MeSH Browser descriptor D057905","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057905"}],"status":"reported","summary":"NLM MeSH describes Stem Cell Research as: Experimentation on STEM CELLS and on the use of stem cells.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d057170","kind":"concept","label":"Translational Research, Biomedical","sources":[{"id":"nlm-mesh.d057170","title":"NLM MeSH Browser descriptor D057170","url":"https://meshb.nlm.nih.gov/record/ui?ui=D057170"}],"status":"reported","summary":"NLM MeSH describes Translational Research, Biomedical as: The endeavour to traverse a specific step of the translation process of turning an observation in the laboratory, clinic, or community into an intervention that will improve the health of individuals and the public. (from Nat Rev Drug Discov. 2018 July ; 17(7): 455–456.)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.mesh.d000080029","kind":"field","label":"Citizen Science","sources":[{"id":"nlm-mesh.d000080029","title":"NLM MeSH Browser descriptor D000080029","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000080029"}],"status":"reported","summary":"NLM MeSH describes Citizen Science as: Voluntary public participation in the scientific process, addressing real-world problems in ways that may include formulating research questions, conducting scientific experiments, collecting and analyzing data, interpreting results, making new discoveries, developing technologies and applications, for solving complex problems. (From https://www.citizenscience.gov/)","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d066296","kind":"concept","label":"Grounded Theory","sources":[{"id":"nlm-mesh.d066296","title":"NLM MeSH Browser descriptor D066296","url":"https://meshb.nlm.nih.gov/record/ui?ui=D066296"}],"status":"reported","summary":"NLM MeSH describes Grounded Theory as: The generation of theories from analysis of empirical data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.mesh.d036301","kind":"concept","label":"Qualitative Research","sources":[{"id":"nlm-mesh.d036301","title":"NLM MeSH Browser descriptor D036301","url":"https://meshb.nlm.nih.gov/record/ui?ui=D036301"}],"status":"reported","summary":"NLM MeSH describes Qualitative Research as: Any type of research that employs nonnumeric information to explore individual or group characteristics, producing findings not arrived at by statistical procedures or other quantitative means. (Qualitative Inquiry: A Dictionary of Terms Thousand Oaks, CA: Sage Publications, 1997)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.mesh.d008433","kind":"field","label":"Mathematics","sources":[{"id":"nlm-mesh.d008433","title":"NLM MeSH Browser descriptor D008433","url":"https://meshb.nlm.nih.gov/record/ui?ui=D008433"}],"status":"reported","summary":"NLM MeSH describes Mathematics as: The deductive study of shape, quantity, and dependence. (From McGraw-Hill Dictionary of Scientific and Technical Terms, 6th ed)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d011336","kind":"concept","label":"Probability","sources":[{"id":"nlm-mesh.d011336","title":"NLM MeSH Browser descriptor D011336","url":"https://meshb.nlm.nih.gov/record/ui?ui=D011336"}],"status":"reported","summary":"NLM MeSH describes Probability as: The study of chance processes or the relative frequency characterizing a chance process.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d015233","kind":"concept","label":"Models, Statistical","sources":[{"id":"nlm-mesh.d015233","title":"NLM MeSH Browser descriptor D015233","url":"https://meshb.nlm.nih.gov/record/ui?ui=D015233"}],"status":"reported","summary":"NLM MeSH describes Models, Statistical as: Statistical formulations or analyses which, when applied to data and found to fit the data, are then used to verify the assumptions and parameters used in the analysis. Examples of statistical models are the linear model, binomial model, polynomial model, two-parameter model, etc.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000078332","kind":"concept","label":"Data Analysis","sources":[{"id":"nlm-mesh.d000078332","title":"NLM MeSH Browser descriptor D000078332","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078332"}],"status":"reported","summary":"NLM MeSH describes Data Analysis as: Process of systematically applying statistical and/or logical techniques to describe and illustrate, condense and recap, and evaluate data (https://ori.hhs.gov/education).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.mesh.d017711","kind":"field","label":"Nonlinear Dynamics","sources":[{"id":"nlm-mesh.d017711","title":"NLM MeSH Browser descriptor D017711","url":"https://meshb.nlm.nih.gov/record/ui?ui=D017711"}],"status":"reported","summary":"NLM MeSH describes Nonlinear Dynamics as: The study of systems which respond disproportionately (nonlinearly) to initial conditions or perturbing stimuli. Nonlinear systems may exhibit chaos which is classically characterized as sensitive dependence on initial conditions. Chaotic systems, while distinguished from more ordered periodic systems, are not random. When their behavior over time is appropriately displayed (in phase space), constraints are evident which are described by strange attractors. Phase space representations of chaotic systems, or strange attractors, usually reveal fractal ( FRACTALS ) self-similarity across time scales. Natural, including biological, systems often display nonlinear dynamics and chaos.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d001499","kind":"concept","label":"Bayes Theorem","sources":[{"id":"nlm-mesh.d001499","title":"NLM MeSH Browser descriptor D001499","url":"https://meshb.nlm.nih.gov/record/ui?ui=D001499"}],"status":"reported","summary":"NLM MeSH describes Bayes Theorem as: A theorem in probability theory named for Thomas Bayes (1702-1761). In epidemiology, it is used to obtain the probability of disease in a group of people with some characteristic on the basis of the overall rate of that disease and of the likelihood of that characteristic in healthy and diseased individuals. The most familiar application is in clinical decision analysis where it is used for estimating the probability of a particular diagnosis given the appearance of some symptoms or test result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016013","kind":"concept","label":"Likelihood Functions","sources":[{"id":"nlm-mesh.d016013","title":"NLM MeSH Browser descriptor D016013","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016013"}],"status":"reported","summary":"NLM MeSH describes Likelihood Functions as: Functions constructed from a statistical model and a set of observed data which give the probability of that data for various values of the unknown model parameters. Those parameter values that maximize the probability are the maximum likelihood estimates of the parameters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d012306","kind":"concept","label":"Risk","sources":[{"id":"nlm-mesh.d012306","title":"NLM MeSH Browser descriptor D012306","url":"https://meshb.nlm.nih.gov/record/ui?ui=D012306"}],"status":"reported","summary":"NLM MeSH describes Risk as: The probability that an event will occur. It encompasses a variety of measures of the probability of a generally unfavorable outcome.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d035501","kind":"concept","label":"Uncertainty","sources":[{"id":"nlm-mesh.d035501","title":"NLM MeSH Browser descriptor D035501","url":"https://meshb.nlm.nih.gov/record/ui?ui=D035501"}],"status":"reported","summary":"NLM MeSH describes Uncertainty as: The condition in which reasonable knowledge regarding risks, benefits, or the future is not available.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016014","kind":"concept","label":"Linear Models","sources":[{"id":"nlm-mesh.d016014","title":"NLM MeSH Browser descriptor D016014","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016014"}],"status":"reported","summary":"NLM MeSH describes Linear Models as: Statistical models in which the value of a parameter for a given value of a factor is assumed to be equal to a + bx, where a and b are constants. The models predict a linear regression.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d016015","kind":"concept","label":"Logistic Models","sources":[{"id":"nlm-mesh.d016015","title":"NLM MeSH Browser descriptor D016015","url":"https://meshb.nlm.nih.gov/record/ui?ui=D016015"}],"status":"reported","summary":"NLM MeSH describes Logistic Models as: Statistical models which describe the relationship between a qualitative dependent variable (that is, one which can take only certain discrete values, such as the presence or absence of a disease) and an independent variable. A common application is in epidemiology for estimating an individual's risk (probability of a disease) as a function of a given risk factor.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000073276","kind":"concept","label":"Models, Spatial Interaction","sources":[{"id":"nlm-mesh.d000073276","title":"NLM MeSH Browser descriptor D000073276","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073276"}],"status":"reported","summary":"NLM MeSH describes Models, Spatial Interaction as: Estimates of the flow of people, material or information between locations in geographic space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098446","kind":"concept","label":"Autoencoder","sources":[{"id":"nlm-mesh.d000098446","title":"NLM MeSH Browser descriptor D000098446","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098446"}],"status":"reported","summary":"NLM MeSH describes Autoencoder as: An unsupervised learning technique where the machine learns patterns in unlabeled data sets, makes compressed representations and reconstructs the input as output at minimum loss of features from the input. Autoencoders are useful in denoising images, DIMENSIONALITY REDUCTION and feature extraction.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098428","kind":"concept","label":"Backtracking Algorithms","sources":[{"id":"nlm-mesh.d000098428","title":"NLM MeSH Browser descriptor D000098428","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098428"}],"status":"reported","summary":"NLM MeSH describes Backtracking Algorithms as: A general algorithmic technique that considers solutions one option at a time backtracking to get the desired solution. This allows searching every possible option recursively.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098404","kind":"concept","label":"Boosting Machine Learning Algorithms","sources":[{"id":"nlm-mesh.d000098404","title":"NLM MeSH Browser descriptor D000098404","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098404"}],"status":"reported","summary":"NLM MeSH describes Boosting Machine Learning Algorithms as: A form of ensemble learning methods which combines weak learners to create strong ones, which reduces training errors and bias in the training models. There are different types of boosting such as gradient boosting, XGBoost, and Adaboost.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098430","kind":"concept","label":"Clustering Algorithms","sources":[{"id":"nlm-mesh.d000098430","title":"NLM MeSH Browser descriptor D000098430","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098430"}],"status":"reported","summary":"NLM MeSH describes Clustering Algorithms as: Algorithms designed to find groups of similar data points (called clusters) in the dataset. Clustering is often used for feature engineering or pattern discovery in unsupervised machine learning.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098431","kind":"concept","label":"Compression Algorithms","sources":[{"id":"nlm-mesh.d000098431","title":"NLM MeSH Browser descriptor D000098431","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098431"}],"status":"reported","summary":"NLM MeSH describes Compression Algorithms as: A class of algorithms which both reduces and restores the size of files to increase their portability. Compression algorithms can be lossy or lossless.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098432","kind":"concept","label":"Detection Algorithms","sources":[{"id":"nlm-mesh.d000098432","title":"NLM MeSH Browser descriptor D000098432","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098432"}],"status":"reported","summary":"NLM MeSH describes Detection Algorithms as: Algorithms designed to find or localize the objects in images and assign the objects (affordances).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098405","kind":"concept","label":"Dimensionality Reduction","sources":[{"id":"nlm-mesh.d000098405","title":"NLM MeSH Browser descriptor D000098405","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098405"}],"status":"reported","summary":"NLM MeSH describes Dimensionality Reduction as: A machine learning process used to reduce the number of attributes or features of data (called dimensionality) thereby simplifying understanding of the dataset without a loss in data integrity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098434","kind":"concept","label":"Genetic Algorithms","sources":[{"id":"nlm-mesh.d000098434","title":"NLM MeSH Browser descriptor D000098434","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098434"}],"status":"reported","summary":"NLM MeSH describes Genetic Algorithms as: Heuristic search algorithms which direct the random searches to the area of better performance or fitness function by computationally creating the conditions inspired by NATURAL SELECTION . They are commonly used to generate solutions for optimization problems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000077272","kind":"concept","label":"Latent Class Analysis","sources":[{"id":"nlm-mesh.d000077272","title":"NLM MeSH Browser descriptor D000077272","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077272"}],"status":"reported","summary":"NLM MeSH describes Latent Class Analysis as: A statistical algorithm used to analyze clusters of observed variables by constructing categorical unobserved or latent segment based on weighted analysis and the average probabilities. Such latent classes are used to infer variables whose relationships are not directly observed. In biomedical research, it is often used to categorize data that allows the determination of symptom clusters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098435","kind":"concept","label":"Machine Learning Algorithms","sources":[{"id":"nlm-mesh.d000098435","title":"NLM MeSH Browser descriptor D000098435","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098435"}],"status":"reported","summary":"NLM MeSH describes Machine Learning Algorithms as: A class of algorithms which enables a computer to learn as it goes, thereby accomplishing its goal without being explicitly programmed to do so.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098436","kind":"concept","label":"Parallel Algorithms","sources":[{"id":"nlm-mesh.d000098436","title":"NLM MeSH Browser descriptor D000098436","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098436"}],"status":"reported","summary":"NLM MeSH describes Parallel Algorithms as: Algorithms that can execute several instructions simultaneously on different processing devices and then combine all the individual outputs to produce the final result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098413","kind":"concept","label":"Particle Swarm Optimization","sources":[{"id":"nlm-mesh.d000098413","title":"NLM MeSH Browser descriptor D000098413","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098413"}],"status":"reported","summary":"NLM MeSH describes Particle Swarm Optimization as: A heuristic computational algorithm designed to find optimal solutions in a random search space. Particle swarm optimization measures swarm intelligence which is a computation measurement inspired by behaviors of self-organized swarming animals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098437","kind":"concept","label":"Prediction Algorithms","sources":[{"id":"nlm-mesh.d000098437","title":"NLM MeSH Browser descriptor D000098437","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098437"}],"status":"reported","summary":"NLM MeSH describes Prediction Algorithms as: A class of algorithms which are designed to forecast unseen data. Prediction Algorithms can discover patterns, perform classification tasks, and identify trends.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000089682","kind":"concept","label":"Cellular Automata","sources":[{"id":"nlm-mesh.d000089682","title":"NLM MeSH Browser descriptor D000089682","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000089682"}],"status":"reported","summary":"NLM MeSH describes Cellular Automata as: Space-oriented dynamic modeling ALGORITHMS acting in an array of cells, whose temporal states evolve based on the rules (algorithms) of the automata. They are used to model complex dynamic systems for study and analysis in a variety of scientific fields.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000078331","kind":"concept","label":"Correlation of Data","sources":[{"id":"nlm-mesh.d000078331","title":"NLM MeSH Browser descriptor D000078331","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000078331"}],"status":"reported","summary":"NLM MeSH describes Correlation of Data as: Determination of whether or not two variables are correlated. This means to study whether an increase or decrease in one variable corresponds to an increase or decrease in the other variable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098403","kind":"concept","label":"Intelligent Systems","sources":[{"id":"nlm-mesh.d000098403","title":"NLM MeSH Browser descriptor D000098403","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098403"}],"status":"reported","summary":"NLM MeSH describes Intelligent Systems as: Technological systems that perform automated tasks within specific environments enabled by artificial intelligence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069550","kind":"concept","label":"Machine Learning","sources":[{"id":"nlm-mesh.d000069550","title":"NLM MeSH Browser descriptor D000069550","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069550"}],"status":"reported","summary":"NLM MeSH describes Machine Learning as: A type of ARTIFICIAL INTELLIGENCE that enable COMPUTERS to independently initiate and execute LEARNING when exposed to new data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098414","kind":"concept","label":"Pattern Analysis, Machine","sources":[{"id":"nlm-mesh.d000098414","title":"NLM MeSH Browser descriptor D000098414","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098414"}],"status":"reported","summary":"NLM MeSH describes Pattern Analysis, Machine as: The process of recognizing and extracting meaningful information from patterns in data. Pattern analysis in machine learning is often used for predictions and forecasting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098411","kind":"concept","label":"Prediction Methods, Machine","sources":[{"id":"nlm-mesh.d000098411","title":"NLM MeSH Browser descriptor D000098411","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098411"}],"status":"reported","summary":"NLM MeSH describes Prediction Methods, Machine as: Methods of making prediction about a new measurement based on calculations of previous data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000090042","kind":"concept","label":"Sentiment Analysis","sources":[{"id":"nlm-mesh.d000090042","title":"NLM MeSH Browser descriptor D000090042","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000090042"}],"status":"reported","summary":"NLM MeSH describes Sentiment Analysis as: A data mining technique in which subjective information such as sentiments, OPINIONS , and attitudes are extracted and analyzed from data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d058011","kind":"concept","label":"Multifactor Dimensionality Reduction","sources":[{"id":"nlm-mesh.d058011","title":"NLM MeSH Browser descriptor D058011","url":"https://meshb.nlm.nih.gov/record/ui?ui=D058011"}],"status":"reported","summary":"NLM MeSH describes Multifactor Dimensionality Reduction as: A statistical tool for detecting and modeling gene-gene interactions. It is a non-parametric and model-free approach.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098426","kind":"concept","label":"Adaptive Algorithms","sources":[{"id":"nlm-mesh.d000098426","title":"NLM MeSH Browser descriptor D000098426","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098426"}],"status":"reported","summary":"NLM MeSH describes Adaptive Algorithms as: Algorithms designed to solve a problem by modifying their behaviors when faced with an unseen task with limited data during training.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098429","kind":"concept","label":"Classification Algorithms","sources":[{"id":"nlm-mesh.d000098429","title":"NLM MeSH Browser descriptor D000098429","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098429"}],"status":"reported","summary":"NLM MeSH describes Classification Algorithms as: A class of algorithms that predicts into which category an observation belongs based on training data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098427","kind":"concept","label":"Generative Adversarial Networks","sources":[{"id":"nlm-mesh.d000098427","title":"NLM MeSH Browser descriptor D000098427","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098427"}],"status":"reported","summary":"NLM MeSH describes Generative Adversarial Networks as: An unsupervised learning network which is composed of two separate networks, a generator which produces content and a discriminator which works to identify real content from the generated content. Over time, generative adversarial networks create data that increasingly resembles the input data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000073931","kind":"concept","label":"Adverse Outcome Pathways","sources":[{"id":"nlm-mesh.d000073931","title":"NLM MeSH Browser descriptor D000073931","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000073931"}],"status":"reported","summary":"NLM MeSH describes Adverse Outcome Pathways as: Models connecting initiating events at the cellular and molecular level to population-wide impacts. Computational models may be at levels relating toxicology to adverse effects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000067495","kind":"concept","label":"Healthcare Failure Mode and Effect Analysis","sources":[{"id":"nlm-mesh.d000067495","title":"NLM MeSH Browser descriptor D000067495","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000067495"}],"status":"reported","summary":"NLM MeSH describes Healthcare Failure Mode and Effect Analysis as: Prospective risk assessment tool aimed at identifying potential risks and their impact in healthcare settings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000096442","kind":"concept","label":"Genetic Risk Score","sources":[{"id":"nlm-mesh.d000096442","title":"NLM MeSH Browser descriptor D000096442","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000096442"}],"status":"reported","summary":"NLM MeSH describes Genetic Risk Score as: Estimate of an individual's genetic liability to a trait or disease, calculated according to their genotype profile and relevant genome-wide association study data. (from Tutorial: a guide to performing polygenic risk score analyses. Nat Protoc. 2020 Sep;15(9):2759.)","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000082742","kind":"concept","label":"Heart Disease Risk Factors","sources":[{"id":"nlm-mesh.d000082742","title":"NLM MeSH Browser descriptor D000082742","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000082742"}],"status":"reported","summary":"NLM MeSH describes Heart Disease Risk Factors as: Aspects of personal behavior or lifestyle, environmental exposure, inherited conditions and characteristics, which are determined to be associated with HEART DISEASES .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000077321","kind":"concept","label":"Deep Learning","sources":[{"id":"nlm-mesh.d000077321","title":"NLM MeSH Browser descriptor D000077321","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000077321"}],"status":"reported","summary":"NLM MeSH describes Deep Learning as: Supervised or unsupervised machine learning methods that use multiple layers of data representations generated by nonlinear transformations, instead of individual task-specific ALGORITHMS , to build and train neural network models.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098406","kind":"concept","label":"Ensemble Learning","sources":[{"id":"nlm-mesh.d000098406","title":"NLM MeSH Browser descriptor D000098406","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098406"}],"status":"reported","summary":"NLM MeSH describes Ensemble Learning as: A method in machine learning where several base learners are combined to create an optimal learning model. This can be used for a variety of models including forecasting, classification, or function approximation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098407","kind":"concept","label":"Federated Learning","sources":[{"id":"nlm-mesh.d000098407","title":"NLM MeSH Browser descriptor D000098407","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098407"}],"status":"reported","summary":"NLM MeSH describes Federated Learning as: A method of training machine learning models whereby multiple devices train their own copy of the artificial intelligence model using decentralized local data. These locally trained model results are then aggregated by a central server to update the global model without accessing local data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098408","kind":"concept","label":"Reinforcement Machine Learning","sources":[{"id":"nlm-mesh.d000098408","title":"NLM MeSH Browser descriptor D000098408","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098408"}],"status":"reported","summary":"NLM MeSH describes Reinforcement Machine Learning as: A machine learning training method in which an agent in an uncertain environment is rewarded for optimal behaviors and punished for undesired behaviors, allowing the agent to learn from trial-and-error.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098409","kind":"concept","label":"Representation Machine Learning","sources":[{"id":"nlm-mesh.d000098409","title":"NLM MeSH Browser descriptor D000098409","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098409"}],"status":"reported","summary":"NLM MeSH describes Representation Machine Learning as: A class of machine learning approaches that allow a system to discover the representations required for feature detection or classification from raw data. The requirement for manual feature engineering is reduced by allowing a machine to learn the features and apply them to a given activity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069553","kind":"concept","label":"Supervised Machine Learning","sources":[{"id":"nlm-mesh.d000069553","title":"NLM MeSH Browser descriptor D000069553","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069553"}],"status":"reported","summary":"NLM MeSH describes Supervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of labeled paired input-output training (sample) data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098410","kind":"concept","label":"Transfer Machine Learning","sources":[{"id":"nlm-mesh.d000098410","title":"NLM MeSH Browser descriptor D000098410","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098410"}],"status":"reported","summary":"NLM MeSH describes Transfer Machine Learning as: Process of training a new learning network by beginning with previously trained for a related problem, leading to less time and energy required for training the new learning network.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000069558","kind":"concept","label":"Unsupervised Machine Learning","sources":[{"id":"nlm-mesh.d000069558","title":"NLM MeSH Browser descriptor D000069558","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000069558"}],"status":"reported","summary":"NLM MeSH describes Unsupervised Machine Learning as: A MACHINE LEARNING paradigm used to make predictions about future instances based on a given set of unlabeled paired input-output training (sample) data.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098412","kind":"concept","label":"Predictive Learning Models","sources":[{"id":"nlm-mesh.d000098412","title":"NLM MeSH Browser descriptor D000098412","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098412"}],"status":"reported","summary":"NLM MeSH describes Predictive Learning Models as: Machine learning models which are trained to analyze historical data to find patterns and trends, allowing it to predict future outcomes.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000083202","kind":"concept","label":"Cardiometabolic Risk Factors","sources":[{"id":"nlm-mesh.d000083202","title":"NLM MeSH Browser descriptor D000083202","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000083202"}],"status":"reported","summary":"NLM MeSH describes Cardiometabolic Risk Factors as: A cluster of personal behavior or lifestyle, environmental exposure, inborn or inherited conditions and characteristics, which, on the basis of epidemiological evidence, is known to be associated with CARDIOVASCULAR DISEASES and TYPE 2 DIABETES MELLITUS .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000094408","kind":"concept","label":"Obesity Paradox","sources":[{"id":"nlm-mesh.d000094408","title":"NLM MeSH Browser descriptor D000094408","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000094408"}],"status":"reported","summary":"NLM MeSH describes Obesity Paradox as: An observation that high BODY MASS INDEX is sometimes associated with lower CARDIOVASCULAR DISEASE mortality in certain population, e.g., ELDERLY .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d000098342","kind":"concept","label":"Large Language Models","sources":[{"id":"nlm-mesh.d000098342","title":"NLM MeSH Browser descriptor D000098342","url":"https://meshb.nlm.nih.gov/record/ui?ui=D000098342"}],"status":"reported","summary":"NLM MeSH describes Large Language Models as: Computational designs that apply DEEP LEARNING methods on extremely large data sets as a basis for predicting and constructing natural-sounding text.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.mesh.d060388","kind":"concept","label":"Support Vector Machine","sources":[{"id":"nlm-mesh.d060388","title":"NLM MeSH Browser descriptor D060388","url":"https://meshb.nlm.nih.gov/record/ui?ui=D060388"}],"status":"reported","summary":"NLM MeSH describes Support Vector Machine as: SUPERVISED MACHINE LEARNING algorithm which learns to assign labels to objects from a set of training examples. Examples are learning to recognize fraudulent credit card activity by examining hundreds or thousands of fraudulent and non-fraudulent credit card activity, or learning to make disease diagnosis or prognosis based on automatic classification of microarray gene expression profiles drawn from hundreds or thousands of samples.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.adjustable-speed-drives","kind":"concept","label":"Adjustable speed drives","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Adjustable speed drives as: Drives that save energy by ensuring the motor's speed is properly matched to the load placed on the motor. Terms used to describe this category include polyphase motors, motor oversizing, and motor rewinding.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.adjusted-electricity","kind":"concept","label":"Adjusted electricity","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Adjusted electricity as: A measurement of electricity that includes the approximate amount of energy used to generate electricity. To approximate the adjusted amount of electricity, the site-value of the electricity is multiplied by a factor of 3. This conversion factor of 3 is a rough approximation of the Btu value of raw fuels used to generate electricity in a steam-generation power plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.aftermarket-converted-vehicle","kind":"concept","label":"Aftermarket converted vehicle","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Aftermarket converted vehicle as: A standard conventionally fueled, factory-produced vehicle to which equipment has been added that enables the vehicle to operate on alternative fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.agglomerating-character","kind":"concept","label":"Agglomerating character","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Agglomerating character as: Agglomeration describes the caking properties of coal. Agglomerating character is determined by examination and testing of the residue when a small powdered sample is heated to 950 degrees Centigrade under specific conditions. If the sample is \"agglomerating,\" the residue will be coherent, show swelling or cell structure, and be capable of supporting a 500-gram weight without pulverizing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-cleaner","kind":"concept","label":"Air cleaner","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air cleaner as: A device using filters or electrostatic precipitators to remove indoor-air pollutants such as tobacco smoke, dust, and pollen. Most portable units are 40 watts when operated on low speed and 100 watts on high speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-collector","kind":"concept","label":"Air collector","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-conditioning","kind":"concept","label":"Air conditioning","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air conditioning as: Cooling and dehumidifying the air in an enclosed space by use of a refrigeration unit powered by electricity or natural gas. Note: Fans, blowers, and evaporative cooling systems (\"swamp coolers\") that are not connected to a refrigeration unit are excluded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.air-pollution-abatement-equipment","kind":"concept","label":"Air pollution abatement equipment","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Air pollution abatement equipment as: Equipment used to reduce or eliminate airborne pollutants, including particulate matter (dust, smoke, fly, ash, dirt, etc.), sulfur oxides,nitrogen oxides (NOx), carbon monoxide, hydrocarbons, odors, and other pollutants. Examples of air pollution abatement structures and equipment include flue-gas particulate collectors, flue-gas desulfurization units and nitrogen oxide control devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alkylation","kind":"concept","label":"Alkylation","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alkylation as: A refining process for chemically combining isobutane with olefin hydrocarbons (e.g., propylene, butylene) through the control of temperature and pressure in the presence of anacid catalyst, usually sulfuric acid or hydrofluoric acid. The product alkylate, an isoparaffin, has high octane value and is blended with motor and aviation gasoline to improve the antiknock value of the fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alternating-current-ac","kind":"concept","label":"Alternating current (AC)","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alternating current (AC) as: An electric current that reverses its direction at regularly recurring intervals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.alternative-fuel-vehicle-afv","kind":"concept","label":"Alternative fuel vehicle (AFV)","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Alternative fuel vehicle (AFV) as: A vehicle designed to operate on an alternative fuel (for example, compressed natural gas, liquefied propane gas, or electricity). The vehicle could be either a dedicated vehicle designed to operate exclusively on alternative fuel or a nondedicated vehicle designed to operate on alternative fuel and/or a gasoline or diesel fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.amorphous-silicon","kind":"concept","label":"Amorphous silicon","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Amorphous silicon as: An alloy of silica and hydrogen, with a disordered, noncrystalline internal atomic arrangement, that can be deposited in thin-film layers (a few micrometers in thickness) by a number of deposition methods to produce thin-film photovoltaic cells on glass, metal, or plastic substrates.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ampere","kind":"concept","label":"Ampere","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ampere as: The unit of measurement of electrical current produced in a circuit by 1 volt acting through a resistance of 1 Ohm.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.apparent-power","kind":"concept","label":"Apparent power","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Apparent power as: The product of the voltage (in volts) and the current (in amperes). It comprises both active and reactive power. It is measured in \"volt-amperes\" and often expressed in \"kilovolt-amperes\" (kVA) or \"megavolt-amperes\" (MVA). See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.appliance","kind":"concept","label":"Appliance","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Appliance as: A piece of equipment, commonly powered by electricity, used to perform a particular energy-driven function. Examples of common appliances are refrigerators, clothes washers and dishwashers, conventional ranges/ovens and microwave ovens, humidifiers and dehumidifiers, toasters, radios, and televisions. Note: Appliances are ordinarily self-contained with respect to their function. Thus, equipment such as central heating and air conditioning systems and water heaters, which are connected to distribution systems inherent to their purposes, are not considered appliances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.asphalt","kind":"concept","label":"Asphalt","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Asphalt as: A dark brown-to-black cement-like material obtained by petroleum processing and containing bitumens as the predominant component; used primarily for road construction. It includes crude asphalt as well as the following finished products: cements, fluxes, the asphalt content of emulsions (exclusive of water), and petroleum distillates blended with asphalt to make cutback asphalts. Note: The conversion factor for asphalt is 5.5 barrels per short ton.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.atmospheric-crude-oil-distillation","kind":"concept","label":"Atmospheric crude oil distillation","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Atmospheric crude oil distillation as: The refining process of separating crude oil components at atmospheric pressure by heating to temperatures of about 600 degrees to 750 degrees Fahrenheit (depending on the nature of the crude oil and desired products) and subsequent condensing of the fractions by cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.auger-mine","kind":"concept","label":"Auger mine","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Auger mine as: A surface mine in which the coal bed is removed by means of a large diameter drill. Usually operated only when the overburden becomes too thick for economical strip mining.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.automatic-set-back-or-clock-thermostat","kind":"concept","label":"Automatic set-back or clock thermostat","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Automatic set-back or clock thermostat as: A thermostat that can be set to turn the heating/cooling system off and on at certain predetermined times.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.auxiliary-generator","kind":"concept","label":"Auxiliary generator","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Auxiliary generator as: A generator at the electric plant site that provides power for the operation of the electrical generating equipment itself, including related demands such as plant lighting, during periods when the electric plant is not operating and power is unavailable from the grid. A black start generator used to start main central station generators is considered to be an auxiliary generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.azimuth-angle","kind":"concept","label":"Azimuth angle","sources":[{"id":"eia-glossary.A","title":"U.S. EIA Glossary, letter A","url":"https://www.eia.gov/tools/glossary/index.php?id=A"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Azimuth angle as: The orientation angle relative to north that a solar panel tilts toward: 0° is north, 90° is east, 180° is south, and 270° is west.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.backup-fuel","kind":"concept","label":"Backup fuel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Backup fuel as: In a central heat pump system, the fuel used in the furnace that takes over the space heating when the outdoor temperature drops below that which is feasible to operate a heat pump.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.backup-power","kind":"concept","label":"Backup power","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Backup power as: Electric energy supplied by a utility to replace power and energy lost during an unscheduled equipment outage.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrel","kind":"concept","label":"Barrel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrel as: A unit of volume equal to 42 U.S. gallons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrels-per-calendar-day","kind":"concept","label":"Barrels per calendar day","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrels per calendar day as: The amount of input that a distillation facility can process under usual operating conditions. The amount is expressed in terms of capacity during a 24-hour period and reduces the maximum processing capability of all units at the facility under continuous operation (see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.barrels-per-stream-day","kind":"concept","label":"Barrels per stream day","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Barrels per stream day as: The maximum number of barrels of input that a distillation facility can process within a 24-hour period when running at full capacity under optimal crude and product slate conditions with no allowance for downtime.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.base-load-capacity","kind":"concept","label":"Base load capacity","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Base load capacity as: The generating equipment normally operated to serve loads on an around-the-clock basis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.baseboard-heater","kind":"concept","label":"Baseboard heater","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Baseboard heater as: As a type of heating equipment, a system in which either electric resistance coils or finned tubes carrying steam or hot water are mounted behind shallow panels along baseboards. Baseboards rely on passive convection to distribute heated air in the space. Electric baseboards are an example of an \"Individual Space Heater.\"","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.battery-electric-vehicle-bev","kind":"concept","label":"Battery electric vehicle (BEV)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Battery electric vehicle (BEV) as: An all-electric vehicle that receives power by plugging into an electric power source and storing the power in a battery pack. BEVs do not use any petroleum-based or other liquid- or gas-based fuel during operation and do not produce tailpipe emissions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bi-fuel-vehicle","kind":"concept","label":"Bi-fuel vehicle","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bi-fuel vehicle as: A motor vehicle that operates on two different fuels, but not on a mixture of the fuels. Each fuel is stored in a separate tank.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bituminous-coal","kind":"concept","label":"Bituminous coal","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bituminous coal as: A dense coal, usually black, sometimes dark brown, often with well-defined bands of bright and dull material, used primarily as fuel in steam-electric power generation, with substantial quantities also used for heat and power applications in manufacturing and to make coke. Bituminous coal is the most abundant coal in active U.S. mining regions. Its moisture content usually is less than 20 percent. The heat content of bituminous coal ranges from 21 to 30 million Btu per ton on a moist, mineral-matter-free basis. The heat content of bituminous coal consumed in the United States averages 24 million Btu per ton, on the as-received basis (i.e., containing both inherent moisture and mineral matter).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.black-liquor","kind":"concept","label":"Black liquor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Black liquor as: A by product of the paper production process, alkaline spent liquor, that can be used as a source of energy. Alkaline spent liquor is removed from the digesters in the process of chemically pulping wood. After evaporation, the residual \"black\" liquor is burned as a fuel in a recovery furnace that permits the recovery of certain basic chemicals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blast-furnace","kind":"concept","label":"Blast furnace","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blast furnace as: A furnace in which solid fuel (coke) is burned with an air blast to smelt ore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blast-furnace-gas","kind":"concept","label":"Blast-furnace gas","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blast-furnace gas as: The waste combustible gas generated in a blast furnace when iron ore is being reduced with coke to metallic iron. It is commonly used as a fuel within steel works.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.blending-plant","kind":"concept","label":"Blending plant","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Blending plant as: A facility that has no refining capability but is either capable of producing finished motor gasoline through mechanical blending or blends oxygenates with motor gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiler","kind":"concept","label":"Boiler","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiler as: A device for generating steam for power, processing, or heating purposes; or hot water for heating purposes or hot water supply. Heat from an external combustion source is transmitted to a fluid contained within the tubes found in the boiler shell. This fluid is delivered to an end-use at a desired pressure, temperature, and quality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiler-fuel","kind":"concept","label":"Boiler fuel","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiler fuel as: An energy source to produce heat that is transferred to the boiler vessel in order to generate steam orhot water. Fossil fuel is the primary energy source used to produce heat for boilers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.boiling-water-reactor-bwr","kind":"concept","label":"Boiling-water reactor (BWR)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Boiling-water reactor (BWR) as: A light-water reactor in which water, used as both coolant and moderator, is allowed to boil in the core. The resulting steam can be used directly to drive a turbine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottled-gas-lpg-or-propane","kind":"concept","label":"Bottled gas, LPG, or propane","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottled gas, LPG, or propane as: Any fuel gas supplied to a building in liquid form, such as liquefied petroleum gas, propane, or butane. It is usually delivered by tank truck and stored near the building in a tank or cylinder until used.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottom-ash","kind":"concept","label":"Bottom ash","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottom ash as: Residue mainly from the coal burning process that falls to the bottom of the boiler for removal and disposal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bottoming-cycle","kind":"concept","label":"Bottoming cycle","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bottoming cycle as: A waste-heat recovery boiler recaptures the unused energy and uses it to produce steam to drive a steam turbine generator to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.breeder-reactor","kind":"concept","label":"Breeder reactor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Breeder reactor as: A reactor that both produces and consumes fissionable fuel, especially one that creates more fuel than it consumes. The new fissionable material is created by a process known as breeding, in which neutrons from fission are captured in fertile materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.british-thermal-unit","kind":"concept","label":"British thermal unit","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines British thermal unit as: The quantity of heat required to raise the temperature of 1 pound of liquid water by 1 degree Fahrenheit at the temperature at which water has its greatest density (approximately 39 degrees Fahrenheit).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.btu-conversion-factor","kind":"concept","label":"Btu conversion factor","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Btu conversion factor as: A factor for converting energy data between one unit of measurement and British thermal units (Btu). Btu conversion factors are generally used to convert energy data from physical units of measure (such as barrels, cubic feet, or short tons) into the energy-equivalent measure of Btu. (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.built-in-electric-units","kind":"concept","label":"Built-in electric units","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Built-in electric units as: An individual-resistance electric-heating unit that is permanently installed in the floors, walls, ceilings, or baseboards and is part of the electrical installation of the building. Electric-heating devices that are plugged into an electric socket or outlet are not considered built in. (Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bulk-station","kind":"concept","label":"Bulk station","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bulk station as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of less than 50,000 barrels and receives its petroleum products by tank car or truck.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bulk-terminal","kind":"concept","label":"Bulk terminal","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bulk terminal as: A facility used primarily for the storage and/or marketing of petroleum products, which has a total bulk storage capacity of 50,000 barrels or more and/or receives petroleum products by tanker, barge, or pipeline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bundled-utility-service-electric","kind":"concept","label":"Bundled utility service (electric)","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bundled utility service (electric) as: A means of operation whereby energy, transmission, and distribution services, as well as ancillary and retail services, are provided by one entity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.burnup","kind":"concept","label":"Burnup","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Burnup as: Amount of thermal energy generated per unit mass of fuel, expressed as Gigawatt-Days Thermal per Metric Ton of Initial Heavy Metal (GWDT/MTIHM), rounded to the nearest gigawatt day.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.bus","kind":"concept","label":"Bus","sources":[{"id":"eia-glossary.B","title":"U.S. EIA Glossary, letter B","url":"https://www.eia.gov/tools/glossary/index.php?id=B"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Bus as: An electrical conductor that serves as a common connection for two or more electrical circuits.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.calcination","kind":"concept","label":"Calcination","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Calcination as: A process in which a material is heated to a high temperature without fusing, so that hydrates, carbonates, or other compounds are decomposed and the volatile material is expelled.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.calcium-sulfite","kind":"concept","label":"Calcium sulfite","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Calcium sulfite as: A white powder, soluble in diluted sulfuric acid. Used in the sulfite process for the manufacture of wood pulp.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.canadian-deuterium-uranium-reactor-candu","kind":"concept","label":"Canadian deuterium uranium reactor (CANDU)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Canadian deuterium uranium reactor (CANDU) as: Uses heavy water or deuterium oxide (D","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.capacity-purchased","kind":"concept","label":"Capacity (purchased)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Capacity (purchased) as: The amount of energy and capacity available for purchase from outside the system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.carbon-intensity","kind":"concept","label":"Carbon intensity","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Carbon intensity as: The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.carburetor","kind":"concept","label":"Carburetor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Carburetor as: A fuel delivery device for producing a proper mixture of gasoline vapor and air and for delivering it to the intake manifold of an internal combustion engine. Gasoline is gravity-fed from a reservoir bowl into a throttle bore, where it is allowed to evaporate into the stream of air being inducted by the engine. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.casinghead-gas-or-oil-well-gas","kind":"concept","label":"Casinghead gas (or oil well gas)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Casinghead gas (or oil well gas) as: Natural gas produced along with crude oil from oil wells. It contains either dissolved or associated gas or both.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cast-silicon","kind":"concept","label":"Cast silicon","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cast silicon as: Crystalline silicon obtained by pouring pure molten silicon into a vertical mold and adjusting the temperature gradient along the mold volume during cooling to obtain slow, vertically advancing crystallization of the silicon. The polycrystalline ingot thus formed is composed of large, relatively parallel, interlocking crystals. The cast ingots are sawed into wafers for further fabrication into photovoltaic cells. Cast silicon wafers and ribbon silicon sheets fabricated into cells are usually referred to aspolycrystalline photovoltaic cells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-converter","kind":"concept","label":"Catalytic converter","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic converter as: A device containing a catalyst for converting automobile exhaust into mostly harmless products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-cracking","kind":"concept","label":"Catalytic cracking","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.catalytic-hydrotreating","kind":"concept","label":"Catalytic hydrotreating","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Catalytic hydrotreating as: A refining process for treating petroleum fractions from atmospheric or vacuum distillation units (e.g., naphthas, middle distillates, reformer feeds, residual fuel oil, and heavy gas oil) and other petroleum (e.g., cat cracked naphtha,coker naphtha, gas oil, etc.) in the presence of catalysts and substantial quantities of hydrogen. Hydrotreating includes desulfurization, removal of substances (e.g., nitrogen compounds) that deactivate catalysts, conversion of olefins to paraffins to reduce gum formation in gasoline, and other processes to upgrade the quality of the fractions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cells-to-oem-non-pv","kind":"concept","label":"Cells to OEM (non-PV)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cells to OEM (non-PV) as: Cells shipped to non-photovoltaic original equipment manufacturers such as boat manufacturers, car manufacturers, etc.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-chiller","kind":"concept","label":"Central chiller","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central chiller as: Any centrally located air conditioning system that produces chilled water in order to cool air. The chilled water or cold air is then distributed throughout the building, using pipes or air ducts or both. These systems are also commonly known as \"chillers,\" \"centrifugal chillers,\" \"reciprocating chillers,\" or \"absorption chillers.\" Chillers are generally located in or just outside the building they serve. Buildings receiving district chilled water are served by chillers located at central physical plants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-cooling","kind":"concept","label":"Central cooling","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central cooling as: Cooling of an entire building with a refrigeration unit to condition the air. Typically central chillers and duct work are present in the centrally cooled building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-physical-plant","kind":"concept","label":"Central physical plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central physical plant as: A plant owned by, and on the grounds of, a multibuilding facility that provides district heating, district cooling, or electricity to other buildings on the same facility. To qualify as a central plant it must provide district heat, district chilled water, or electricity to at least one other building. The central physical plant may be by itself in a separate building or may be located in a building where other activities occur.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.central-warm-air-furnace","kind":"concept","label":"Central warm air furnace","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Central warm air furnace as: A type of space heating equipment where a central combustor or resistance unit generally using gas, fuel oil, or electricity provides warm air through ducts leading to the various rooms. Heat pumps are not included in this category. A forced air furnace is one in which a fan is used to force the air through the ducts. In a gravity furnace, air is circulated by gravity, relying on the natural flow of warm air up and cold air down; the warm air rises through ducts and the cold air falls through ducts that return it to the furnace to be reheated and this completes the circulation cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.centralized-water-heating-system","kind":"concept","label":"Centralized water heating system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Centralized water heating system as: Equipment, to heat and store water for other than space heating purposes, which provides hot water from a single location for distribution throughout a building. A residential type tank water heater is a good example of a centralized water heater.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.chemical-separation","kind":"concept","label":"Chemical separation","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Chemical separation as: A process for extracting uranium and plutonium from dissolved spent nuclear fuel and irradiated targets. The fission products that are left behind are high-level waste. Chemical separation is also known as reprocessing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.christmas-tree","kind":"concept","label":"Christmas tree","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Christmas tree as: The valves and fittings installed at the top of a gas or oil well to control and direct the flow of well fluids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.circuit-mile","kind":"concept","label":"Circuit-mile","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Circuit-mile as: The total length in miles of separate circuits regardless of the number of conductors used per circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.clinker","kind":"concept","label":"Clinker","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Clinker as: Powdered cement, produced by heating a properly proportioned mixture of finely ground raw materials (calciumcarbonate, silica, alumina, and iron oxide) in a kiln to a temperature of about 2,700 degrees Fahrenheit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal","kind":"concept","label":"Coal","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal as: A readily combustible black or brownish-black rock whose composition, including inherent moisture, consists of more than 50 percent by weight and more than 70 percent by volume of carbonaceous material. It is formed from plant remains that have been compacted, hardened, chemically altered, and metamorphosed by heat and pressure over geologic time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-blending","kind":"concept","label":"Coal Blending","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal Blending as: The process of combining two or more coals with different characteristics to obtain coal with a certain quality, such as low sulfur content.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-briquets","kind":"concept","label":"Coal briquets","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal briquets as: Anthracite, bituminous, and lignite briquets comprise the secondary solid fuels manufactured from coal by a process in which the coal is partly dried, warmed to expel excess moisture, and then compressed into briquets, usually without the use of a binding substance. In the reduction of briquets to coal equivalent, different conversion factors are applied according to their origin from hard coal, peat, brown coal, or lignite.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-gasification","kind":"concept","label":"Coal gasification","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal gasification as: The process of converting coal into gas. The basic process involves crushing coal to a powder, which is then heated in the presence of steam and oxygen to produce a gas. The gas is then refined to reduce sulfur and other impurities. The gas can be used as a fuel or processed further and concentrated into chemical or liquid fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-liquefaction","kind":"concept","label":"Coal liquefaction","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal liquefaction as: A chemical process that converts coal into clean-burning liquid hydrocarbons, such as synthetic crude oil and methanol.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-mine","kind":"concept","label":"Coal mine","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coal-synfuel","kind":"concept","label":"Coal synfuel","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coal synfuel as: Coal-based solid fuel that has been processed by a coal synfuel plant; and coal-based fuels such as briquettes, pellets, or extrusions, which are formed from fresh or recycled coal and binding materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coalbed-methane-well-gas","kind":"concept","label":"Coalbed Methane Well Gas","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coalbed Methane Well Gas as: Methane produced from coal seams. Coalbed methane is formed during coalification, which is the geologic process that transforms organic material into coal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cofiring","kind":"concept","label":"Cofiring","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cofiring as: The process of burning natural gas in conjunction with another fuel to reduce air pollutants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cogeneration-system","kind":"concept","label":"Cogeneration system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cogeneration system as: A system using a common energy source to produce both electricity and steam for other uses, resulting in increased fuel efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-coal","kind":"concept","label":"Coke (coal)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke (coal) as: A solid carbonaceous residue derived from low-ash, low-sulfur bituminous coal from which the volatile constituents are driven off by baking in an oven at temperatures as high as 2,000 degrees Fahrenheit so that the fixed carbon and residual ash are fused together. Coke is used as a fuel and as a reducing agent in smelting iron ore in a blast furnace. Coke from coal is grey, hard, and porous and has a heating value of 24.8 million Btu per ton.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-battery","kind":"concept","label":"Coke Battery","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke Battery as: A series of coke ovens stacked in rows into which coal is loaded and processed into coke.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.coke-oven","kind":"concept","label":"Coke Oven","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Coke Oven as: A chamber of brick or other heat-resistant material in which coal is heated to separate the coal gas, coal water, and tar. The coal gas and coal water fuse together with carbon and the remaining ash, forming a hard residue commonly referred to as coke. Coke is primarily used in steel production. There are two types of coke ovens: (1) beehive ovens, which were originally built round with a spherical top like an old-fashioned beehive, and have an opening in the top and various small openings for draft at the base. The ovens were developed into banks (rows) of joining cubicles. During the heating process of the coal, tar, gas, and other byproducts are lost. (2) Byproduct ovens, which were built in rectangular form with the front and back removable, and which are arranged so that all volatile byproducts can be pumped out.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-cycle","kind":"concept","label":"Combined cycle","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined cycle as: An electric generating technology in which electricity is produced from otherwise lost waste heat exiting from one or more gas (combustion) turbines. The exiting heat is routed to a conventional boiler or to a heat recovery steam generator for utilization by a steam turbine in the production of electricity. This process increases the efficiency of the electric generating unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-cycle-unit","kind":"concept","label":"Combined cycle unit","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined cycle unit as: An electric generating unit that consists of one or more combustion turbines and one or more boilers with a portion of the required energy input to the boiler(s) provided by the exhaust gas of the combustion turbine(s).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-hydroelectric-plant","kind":"concept","label":"Combined hydroelectric plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined hydroelectric plant as: A hydroelectric plant that uses both pumped water and natural streamflow for the production of power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-pumped-storage-plant","kind":"concept","label":"Combined pumped-storage plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined pumped-storage plant as: A pumped-storage hydroelectric power plant that uses both pumped water and natural stream flow to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combined-heat-and-power-chp-plant","kind":"concept","label":"Combined-heat-and-power (CHP) plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combined-heat-and-power (CHP) plant as: A plant designed to produce both heat and electricity from a single heat source. Note: This term is being used in place of the term \"cogenerator\" that was used by EIA in the past. CHP better describes the facilities because some of the plants included do not produce heat and power in a sequential fashion and, as a result, do not meet the legal definition of cogeneration specified in the Public Utility Regulatory Policies Act (PURPA).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.combustion-chamber","kind":"concept","label":"Combustion chamber","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Combustion chamber as: An enclosed vessel in which chemical oxidation of fuel occurs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.commercial-facility","kind":"concept","label":"Commercial facility","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Commercial facility as: An economic unit that is owned or operated by one person or organization and that occupies two or more commercial buildings at a single location. A university and a large hospital complex are examples of a commercial multi-building facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.commercial-operation-nuclear","kind":"concept","label":"Commercial operation (nuclear)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Commercial operation (nuclear) as: The phase of reactor operation that begins when power ascension ends and the operating utility formally declares the nuclear power plant to be available for the regular production of electricity. This declaration is usually related to the satisfactory completion of qualification tests on critical components of the unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.completion-oil-gas-production","kind":"concept","label":"Completion (oil/gas production)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Completion (oil/gas production) as: The term refers to the installation of permanent equipment for the production of oil or gas. If a well is equipped to produce only oil or gas from one zone or reservoir, the definition of a \"well\" (classified as an oil well or gas well) and the definition of a \"completion\" are identical. However, if a well is equipped to produce oil and/or gas separately from more than one reservoir, a \"well\" is not synonymous with a \"completion.\" (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.compressor-station","kind":"concept","label":"Compressor station","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Compressor station as: Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.concentrating-solar-power-or-solar-thermal-power-system","kind":"concept","label":"Concentrating solar power or solar thermal power system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Concentrating solar power or solar thermal power system as: A solar energy conversion system characterized by the optical concentration of solar rays through an arrangement of mirrors to generate a high temperature working fluid. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.concentrator","kind":"concept","label":"Concentrator","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Concentrator as: A reflective or refractive device that focuses incident insolation onto an area smaller than the reflective or refractive surface, resulting in increased insolation at the point of focus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.condenser-cooling-water","kind":"concept","label":"Condenser cooling water","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Condenser cooling water as: A source of water external to a boiler's feed system is passed through the steam leaving the turbine in order to cool and condense the steam. This reduces the steam's exit pressure and recaptures its heat, which is then used to preheat fluid entering the boiler, thereby increasing the plant's thermodynamic efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conductor","kind":"concept","label":"Conductor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conductor as: Metal wires, cables, and bus-bar used for carrying electric current. Conductors may be solid or stranded, that is,built up by a assembly of smaller solid conductors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.construction-pipeline-of-a-nuclear-reactor","kind":"concept","label":"Construction pipeline (of a nuclear reactor)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Construction pipeline (of a nuclear reactor) as: The various stages involved in the acquisition of a nuclear reactor by a utility. The events that define these stages are the ordering of a reactor, the licensing process, and the physical construction of the nuclear generating unit. A reactor is said to be \"in the pipeline\" when the reactor is ordered and \"out of the pipeline\" when it completes low power testing and begins operation toward full power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.construction-work-in-progress-cwip","kind":"concept","label":"Construction work in progress (CWIP)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Construction work in progress (CWIP) as: The balance shown on a utility's balance sheet for construction work not yet completed butin process. This balance line item may or may not be included in the rate base.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.continuous-mining","kind":"concept","label":"Continuous mining","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Continuous mining as: A form of room pillar mining in which a continuous mining machine extracts and removes coal from the working face in one operation; no blasting is required.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-blendstock-for-oxygenate-blending-cbob","kind":"concept","label":"Conventional blendstock for oxygenate blending (CBOB)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional blendstock for oxygenate blending (CBOB) as: Motor gasoline blending components intended for blending with oxygenates to produce finished conventional motor gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-fuel-ethanol","kind":"concept","label":"Conventional fuel ethanol","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional fuel ethanol as: Fuel ethanol produced by fermenting cornstarch. Fuel ethanol is typically blended with motor gasoline as an oxygenate or","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-gasoline","kind":"concept","label":"Conventional gasoline","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional gasoline as: Finished motor gasoline not included in the oxygenated or reformulated gasoline categories. Note: This category excludes reformulated gasoline blendstock for oxygenate blending (RBOB) as well as other blendstock.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-hydroelectric-plant","kind":"concept","label":"Conventional hydroelectric plant","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional hydroelectric plant as: A plant in which all of the power is produced from natural streamflow as regulated by available storage.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-mill-uranium","kind":"concept","label":"Conventional mill (uranium)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional mill (uranium) as: A facility engineered and built principally for processing of uraniferous ore materials mined from the earth and the recovery, by chemical treatment in the mill's circuits, of uranium and/or other valued coproduct components from the processed one.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conventional-oil-and-natural-gas-production","kind":"concept","label":"Conventional oil and natural gas production","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conventional oil and natural gas production as: Crude oil and natural gas that is produced by a well drilled into a geologic formation in which the reservoir and fluid characteristics permit the oil and natural gas to readily flow to the wellbore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.conversion-factor","kind":"concept","label":"Conversion factor","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Conversion factor as: A factor for converting data between one unit of measurement and another (such as between short tons and British thermal units, or between barrels and gallons). (See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.converted-alternative-fuel-vehicle","kind":"concept","label":"Converted (alternative-fuel) vehicle","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Converted (alternative-fuel) vehicle as: A vehicle originally designed to operate on gasoline/diesel that was modified or altered to run on an alternative fuel after its initial delivery to an end-user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cooling-system","kind":"concept","label":"Cooling system","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cooling system as: An equipment system that provides water to the condensers and includes water intakes and outlets; cooling towers; and ponds, pumps, and pipes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-input","kind":"concept","label":"Crude oil input","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil input as: The total crude oil put into processing units at refineries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-qualities","kind":"concept","label":"Crude oil qualities","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil qualities as: Refers to two properties of crude oil, the sulfur content, and API gravity, which affect processing complexity and product characteristics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.crude-oil-refinery-input","kind":"concept","label":"Crude oil refinery input","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Crude oil refinery input as: The total crude oil put into processing units at refineries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.current-electric","kind":"concept","label":"Current (electric)","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Current (electric) as: A flow of electrons in an electrical conductor. The strength or rate of movement of the electricity is measured in amperes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.cycle-reactor-history","kind":"concept","label":"Cycle/reactor history","sources":[{"id":"eia-glossary.C","title":"U.S. EIA Glossary, letter C","url":"https://www.eia.gov/tools/glossary/index.php?id=C"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Cycle/reactor history as: A group of assemblies that have been irradiated in the same cycles in an individual reactor and are said to have the same cycle/reactor history.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.daylighting-controls","kind":"concept","label":"Daylighting controls","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Daylighting controls as: A system of sensors that assesses the amount of daylight and controls lighting or shading devices to maintain a specified lighting level. The sensors are sometimes referred to as \"photocells.\"","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.decontamination","kind":"concept","label":"Decontamination","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Decontamination as: Removal of unwanted radioactive or hazardous contamination by a chemical or mechanical process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dedicated-vehicle","kind":"concept","label":"Dedicated vehicle","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dedicated vehicle as: A vehicle that operates only on an alternative fuel, as when a vehicle is configured to operate on compressed natural gas. Note: A vehicle powered by an electric motor is not to be treated as dedicated.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.deepest-total-depth","kind":"concept","label":"Deepest total depth","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Deepest total depth as: The deepest total depth of a given well is the distance from a surface reference point (usually the Kelly bushing) to the point of deepest penetration measured along the well bore. If a well is drilled from a platform or barge over water, the depth of the water is included in the total length of the well bore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.degasification-system","kind":"concept","label":"Degasification system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Degasification system as: The methods employed for removing methane from a coal seam that could not otherwise be removed by standard ventilation fans and thus would pose a substantial hazard to coal miners. These systems may be used prior to mining or during mining activities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.delayed-coking","kind":"concept","label":"Delayed coking","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Delayed coking as: A process by which heavier crude oil fractions can be thermally decomposed under conditions of elevated temperatures and pressure to produce a mixture of lighter oils and petroleum coke. The light oils can be processed further in other refinery units to meet product specifications. The coke can be used either as a fuel or in other applications such as the manufacturing of steel or aluminum.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.deliveries-electric","kind":"concept","label":"Deliveries (electric)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Deliveries (electric) as: Energy generated by one system and delivered to another system through one or more transmission lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.denaturant","kind":"concept","label":"Denaturant","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Denaturant as: Petroleum, typically pentanes plus or conventional motor gasoline, added to fuel ethanol to make it unfit for human consumption. Fuel ethanol is denatured, usually prior to transport from the ethanol production facility, by adding 2 to 5 volume percent denaturant. See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.denatured","kind":"concept","label":"Denatured","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Denatured as: Fuel ethanol that is rendered unfit for human consumption by the addition of a petroleum denaturant, typically pentanes plus or conventional motor gasoline. Fuel ethanol is usually denatured prior to transport from the ethanol production facility, by adding 2- to 5-volume-percent","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dependable-capacity","kind":"concept","label":"Dependable capacity","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dependable capacity as: The load-carrying ability of a station or system under adverse conditions for a specified period of time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.depleted-storage-field","kind":"concept","label":"Depleted storage field","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Depleted storage field as: A sub-surface natural geological reservoir, usually a depleted gas or oil field, used for storing natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.depth-of-deepest-production","kind":"concept","label":"Depth of deepest production","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Depth of deepest production as: The depth of the deepest production is the length of the well bore measured (in feet) from the surface reference point to the bottom of the open hole or the deepest perforation in the casing of a producing well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.design-electrical-rating-capacity-net","kind":"concept","label":"Design electrical rating (capacity) net","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Design electrical rating (capacity) net as: The nominal net electrical output of a nuclear unit, as specified by the utility for the purpose of plant design.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.design-head","kind":"concept","label":"Design head","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Design head as: The achieved river, pondage, or reservoir surface height (forebay elevation) that provides the water level to produce the full flow at the gate of the turbine in order to attain the manufacturer's installed nameplate rating for generation capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.development-well","kind":"concept","label":"Development well","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Development well as: A well drilled within the proved area of an oil or gas reservoir to the depth of a stratigraphic horizon known to be productive. Also see Well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-fuel","kind":"concept","label":"Diesel fuel","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel fuel as: A fuel composed of distillates obtained in petroleum refining operation or blends of such distillates with residual oil used in motor vehicles. The boiling point and specific gravity are higher for diesel fuels than for gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-fuel-system","kind":"concept","label":"Diesel fuel system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel fuel system as: Diesel engines are internal combustion engines that burn diesel oil rather than gasoline. Injectors are used to spray droplets of diesel oil into the combustion chambers, at or near the top of the compression stroke. Ignition follows due to the very high temperature of the compressed intake air, or to the use of \"glow plugs,\" which retain heat from previous ignitions (spark plugs are not used). Diesel engines are generally more fuel-efficient than gasoline engines but must be stronger and heavier because of high compression ratios.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diesel-electric-plant","kind":"concept","label":"Diesel-electric plant","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diesel-electric plant as: A generating station that uses diesel engines to drive its electric generators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.diffusive-transport","kind":"concept","label":"Diffusive transport","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Diffusive transport as: The process by which particles of liquids or gases move from an area of higher concentration to an area of lower concentration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.direct-electricity-load-control","kind":"concept","label":"Direct electricity load control","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Direct electricity load control as: The utility installs a radio-controlled device on the HVAC equipment. During periods of particularly heavy use of electricity, the utility will send a radio signal to the building in its service territory with this device and turn off the HVAC for a certain period.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.direct-load-control","kind":"concept","label":"Direct load control","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Direct load control as: This Demand-Side Management category represents the consumer load that can be interrupted at the time of annual peak load by direct control of the utility system operator. Direct Load Control does not include Interruptible Load. This type of control usually involves residential consumers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.directional-deviated-well","kind":"concept","label":"Directional (deviated) well","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Directional (deviated) well as: A well purposely deviated from the vertical, using controlled angles to reach an objective location other than directly below the surface location.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.discharged-fuel","kind":"concept","label":"Discharged fuel","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Discharged fuel as: Irradiated fuel removed from a nuclear reactor during refueling. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distillate-fuel-oil","kind":"concept","label":"Distillate fuel oil","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distillate fuel oil as: A general classification for one of the petroleum fractions produced in conventional distillation operations. It includes diesel fuels and fuel oils. Products known as No. 1, No. 2, and No. 4 diesel fuel are used in on-highway diesel engines, such as those in trucks and automobiles, as well as off-highway engines, such as those in railroad locomotives and agricultural machinery. Products known as No. 1, No. 2, and No. 4 fuel oils are used primarily for space heating and electric power generation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distillation-unit-atmospheric","kind":"concept","label":"Distillation unit (atmospheric)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distillation unit (atmospheric) as: The primary distillation unit that processes crude oil (including mixtures of other hydrocarbons) at approximately atmospheric conditions. It includes a pipe still for vaporizing the crude oil and a fractionation tower for separating the vaporized hydrocarbon components in the crude oil into fractions with different boiling ranges. This is done by continuously vaporizing and condensing the components to separate higher oiling point material. The selected boiling ranges are set by the processing scheme, the properties of the crude oil, and the product specifications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distributed-generator","kind":"concept","label":"Distributed generator","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distributed generator as: A generator that is located close to the particular load that it is intended to serve. General, but non-exclusive, characteristics of these generators include: an operating strategy that supports the served load; and interconnection to a distribution or sub-transmission system (138 kV or less).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distributed-point-of-use-water-heating-system","kind":"concept","label":"Distributed/point-of-use water-heating system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distributed/point-of-use water-heating system as: A system for heating hot water, for other than space heating purposes, which is located at more than one space within a building. A point-of-use water heater is located at the faucet and heats water only as required for immediate use. Because water is not heated until it is required, this equipment is more energy-efficient.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.distribution-system","kind":"concept","label":"Distribution system","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Distribution system as: The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-chilled-water","kind":"concept","label":"District chilled water","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District chilled water as: Chilled water from an outside source used as an energy source for cooling in a building. The water is chilled in a central plant and piped into the building. Chilled water may be purchased from a utility or provided by a central physical plant in a separate building that is part of the same multibuilding facility (for example, a hospital complex or university).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-energy","kind":"concept","label":"District energy","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District energy as: Energy produced in a centralized plant, other than in an electric power plant, that is consumed or stored as steam, hot water, or chilled water. This energy is distributed through a network of pipes to meet demand for process steam, heat, or cooling within a commercial or residential building, multibuilding facility, group of buildings, or an industrial facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.district-heat","kind":"concept","label":"District heat","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines District heat as: Steam or hot water from an outside source used as an energy source in a building. The steam or hot water is produced in a central plant and piped into the building. The district heat may be purchased from a utility or provided by a physical plant in a separate building that is part of the same facility (for example, a hospital complex or university).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.double-circuit-line","kind":"concept","label":"Double circuit line","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Double circuit line as: A transmission line having two separate circuits. Because each carries three-phase power, at least six conductors, three per circuit, are required.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dry-bottom-boiler","kind":"concept","label":"Dry bottom boiler","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dry bottom boiler as: No slag tanks at furnace throat area. The throat area is clear. Bottom ash drops through the throat to the bottom ash water hoppers. This design is used where the ash melting temperature is greater than the temperature on the furnace wall, allowing for relatively dry furnace wall conditions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dry-hole","kind":"concept","label":"Dry hole","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dry hole as: An exploratory or development well found to be incapable of producing either oil or gas in sufficient quantities to justify completion as an oil or gas well. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fuel-vehicle-1","kind":"concept","label":"Dual fuel vehicle (1)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (1) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. These vehicles have at least two separate fuel systems which inject each fuel simultaneously into the engine combustion chamber.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fuel-vehicle-2","kind":"concept","label":"Dual fuel vehicle (2)","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual fuel vehicle (2) as: A motor vehicle that is capable of operating on an alternative fuel and on gasoline or diesel fuel. This term is meant to represent all such vehicles whether they operate on the alternative fuel and gasoline/diesel simultaneously (e.g., flexible-fuel vehicles) or can be switched to operate on gasoline/diesel or an alternative fuel (e.g., bi-fuel vehicles).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dual-fired-unit","kind":"concept","label":"Dual-fired unit","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dual-fired unit as: A generating unit that can produce electricity using two or more input fuels. In some of these units, only the primary fuel can be used continuously; the alternate fuel(s) can be used only as a start-up fuel or in emergencies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.dump-energy","kind":"concept","label":"Dump energy","sources":[{"id":"eia-glossary.D","title":"U.S. EIA Glossary, letter D","url":"https://www.eia.gov/tools/glossary/index.php?id=D"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Dump energy as: Energy generated in a hydroelectric plant by water that cannot be stored or conserved and which energy is in excess of the needs of the system producing the energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-energy","kind":"concept","label":"Electric energy","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-plant-physical","kind":"concept","label":"Electric plant (physical)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric plant (physical) as: A facility containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-power-plant","kind":"concept","label":"Electric power plant","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric power plant as: A station containing prime movers, electric generators, and auxiliary equipment for converting mechanical, chemical, and/or fission energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-pump-for-well-water","kind":"concept","label":"Electric pump for well water","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric pump for well water as: This pump forces the water from a well below ground level up into the water pipes that circulate through the house. When this pump is not working, there is a limited supply of running water in the house.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-system-loss","kind":"concept","label":"Electric system loss","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric system loss as: Total energy loss from all causes for an electric utility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-system-reliability","kind":"concept","label":"Electric system reliability","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric system reliability as: The degree to which the performance of the elements of the electrical system results in power being delivered to consumers within accepted standards and in the amount desired. Reliability encompasses two concepts, adequacy and security. Adequacy implies that there are sufficient generation and transmission resources installed and available to meet projected electrical demand plus reserves for contingencies. Security implies that the system will remain intact operationally (i.e., will have sufficient available operating capacity) even after outages or other equipment failure. The degree of reliability may be measured by the frequency, duration, and magnitude of adverse effects on consumer service.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-vehicle-ev","kind":"concept","label":"Electric vehicle (EV)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric vehicle (EV) as: A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electric-zone","kind":"concept","label":"Electric zone","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electric zone as: A portion of the grid controlled by the independent system operator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electrical-system-energy-losses","kind":"concept","label":"Electrical system energy losses","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electrical system energy losses as: The amount of energy lost during generation, transmission, and distribution of electricity, including plant and unaccounted for use.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electricity-generation","kind":"concept","label":"Electricity generation","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electricity generation as: The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.electricity-only-plant","kind":"concept","label":"Electricity-only plant","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Electricity-only plant as: A plant designed to produce electricity only. See also Combined heat and power (CHP) plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.elution","kind":"concept","label":"Elution","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Elution as: The process of using a solvent (eluent) to remove select ions (e.g., uranium) from an adsorbent such as ion-exchange resins.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.emissions-coefficient","kind":"concept","label":"Emissions coefficient","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Emissions coefficient as: A unique value for scaling emissions to activity data in terms of a standard rate of emissions per unit of activity (e.g., pounds of carbon dioxide emitted per Btu of fossil fuel consumed).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-consumption","kind":"concept","label":"Energy consumption","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-deliveries","kind":"concept","label":"Energy deliveries","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy deliveries as: Energy generated by one electric utility system and delivered to another system through one or more transmission lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.energy-management-and-control-system-emcs","kind":"concept","label":"Energy management and control system(EMCS)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Energy management and control system(EMCS) as: An energy conservation feature that uses mini/microcomputers, instrumentation, control equipment, and software to manage a building's use of energy for heating, ventilation, air conditioning, lighting, and/or business-related processes. These systems can also manage fire control, safety, and security. Not included as EMCS are time-clock thermostats.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.engine-size","kind":"concept","label":"Engine size","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Engine size as: The total volume within all cylinders of an engine when pistons are at their lowest positions. The engine is usually measured in \"liters\" or \"cubic inches of displacement (CID).\" Generally, larger engines result in greater engine power, but less fuel efficiency. There are 61.024 cubic inches in a liter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.enrichment-tails-assay","kind":"concept","label":"Enrichment tails assay","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Enrichment tails assay as: A measure of the amount of fissile uranium (U-235) remaining in the waste stream from the uranium enrichment process. The natural uranium \"feed\" that enters the enrichment process generally contains 0.711 percent (by weight) U-235. The \"product stream\" contains enriched uranium (more than 0.711 percentU-235) and the \"waste\" or \"tails\" stream contains depleted uranium (less than 0.711 percent U-235). At the historical enrichment tails assay of 0.2 percent, the waste stream would contain 0.2 percent U-235. A higher enrichment tails assay requires more uranium feed (thus permitting natural uranium stockpiles to be decreased), while increasing the output of enriched material for the same energy expenditure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.environmental-restoration","kind":"concept","label":"Environmental restoration","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Environmental restoration as: Although usually described as \"cleanup,\" this function encompasses a wide range of activities, such as stabilizing contaminated soil; treating groundwater; decommissioning process buildings, nuclear reactors, chemical separations plants, and many other facilities; and exhuming sludge and buried drums of waste.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.epa-certification","kind":"concept","label":"EPA certification","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines EPA certification as: A permanent label on fireplace inserts and freestanding wood stoves manufactured after July1, 1988, indicating that the equipment meets EPA standards for clean burning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.equilibrium-cycle","kind":"concept","label":"Equilibrium cycle","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Equilibrium cycle as: An analytical term that refers to fuel cycles that occur after the initial one or two cycles of a reactor's operation. For a given type of reactor, equilibrium cycles have similar fuel characteristics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.evacuated-tube-collector","kind":"concept","label":"Evacuated-tube collector","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Evacuated-tube collector as: A collector in which solar thermal heat is captured by use of a collector fluid that flows through an absorber tube contained inside an evacuated glass tube.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.evaporative-cooler-swamp-cooler","kind":"concept","label":"Evaporative cooler (swamp cooler)","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Evaporative cooler (swamp cooler) as: An air-cooling unit that turns air into moist, cool air by saturating the air with water vapor. It does not cool air by use of a refrigeration unit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.exploratory-well","kind":"concept","label":"Exploratory well","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Exploratory well as: A hole drilled a) to find and produce oil or gas in an area previously considered unproductive area; b) to find a new reservoir in a known field, i.e., one previously producing oil and gas from another reservoir, or c) to extend the limit of a known oil or gas reservoir.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.extraction-loss","kind":"concept","label":"Extraction loss","sources":[{"id":"eia-glossary.E","title":"U.S. EIA Glossary, letter E","url":"https://www.eia.gov/tools/glossary/index.php?id=E"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Extraction loss as: The extraction of gas plant liquids constituents such as","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fast-breeder-reactor-fbr","kind":"concept","label":"Fast breeder reactor (FBR)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fast breeder reactor (FBR) as: A reactor in which the fission chain reaction is sustained primarily by fast neutrons rather than by thermal or intermediate neutrons. Fast reactors require little or no moderator to slow down the neutrons from the speeds at which they are ejected from fissioning nuclei. This type of reactor produces more fissile material than it consumes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fission","kind":"concept","label":"Fission","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fission as: The process whereby an atomic nucleus of appropriate type, after capturing a neutron, splits into (generally) two nuclei of lighter elements, with the release of substantial amounts of energy and two or more neutrons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fixed-carbon","kind":"concept","label":"Fixed carbon","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fixed carbon as: The nonvolatile matter in coal minus the ash. Fixed carbon is the solid residue other than ash obtained by prescribed methods of destructive distillation of a coal. Fixed carbon is the part of the total carbon that remains when coal is heated in a closed vessel until all matter is driven off.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flat-plate-pumped","kind":"concept","label":"Flat plate pumped","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flat plate pumped as: A medium-temperature solar thermal collector that typically consists of a metal frame, glazing, absorbers (usually metal), and insulation and that uses a pumped liquid as the heat-transfer medium predominant use is in water-heating applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.floating-storage-regasification-unit-fsru","kind":"concept","label":"Floating Storage Regasification Unit (FSRU)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Floating Storage Regasification Unit (FSRU) as: A floating vessel that can transport, store, and regasify liquefied natural gas (LNG) onboard, usually for the purpose of delivering natural gas to destinations that do not have a regasification terminal onshore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.floor-wall-or-pipeless-furnace","kind":"concept","label":"Floor, wall, or pipeless furnace","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Floor, wall, or pipeless furnace as: Space-heating equipment consisting of a ductless combustor or resistance unit, having an enclosed chamber where fuel is burned or where electrical-resistance heat is generated to warm the rooms of a building. A floor furnace is located below the floor and delivers heated air to the room immediately above or (if under a partition) to the room on each side. A wall furnace is installed in a partition or in an outside wall and delivers heated air to the rooms on one or both sides of the wall. A pipeless furnace is installed in a basement and delivers heated air through a large register in the floor of the room or hallway immediately above.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-desulfurization","kind":"concept","label":"Flue gas desulfurization","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue gas desulfurization as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Also referred to as scrubbers. Chemicals such as lime are used as scrubbing media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-desulfurization-unit-scrubber","kind":"concept","label":"Flue-gas desulfurization unit (scrubber)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue-gas desulfurization unit (scrubber) as: Equipment used to remove sulfur oxides from the combustion gases of a boiler plant before discharge to the atmosphere. Chemicals such as lime are used as the scrubbing media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.flue-gas-particulate-collector","kind":"concept","label":"Flue-gas particulate collector","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Flue-gas particulate collector as: Equipment used to remove fly ash from the combustion gases of a boiler plant before discharge to the atmosphere. Particulate collectors include electrostatic precipitators, mechanical collectors (cyclones), fabric filters (baghouses), and wet scrubbers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fluid-catalytic-cracking","kind":"concept","label":"Fluid catalytic cracking","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fluid catalytic cracking as: The refining process of breaking down the larger, heavier, and more complex hydrocarbon molecules into simpler and lighter molecules. Catalytic cracking is accomplished by the use of a catalytic agent and is an effective process for increasing the yield of gasoline from crude oil. Catalytic cracking processes fresh feeds and recycled feeds.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fluid-coking","kind":"concept","label":"Fluid coking","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fluid coking as: A thermal cracking process utilizing the fluidized-solids technique to remove carbon (coke) for continuous conversion of heavy, low-grade oils into lighter products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fly-ash","kind":"concept","label":"Fly ash","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fly ash as: Particulate matter mainly from coal ash in which the particle diameter is less than 1 x 104 meter. This ash is removed from the flue gas using flue gas particulate collectors such as fabric filters and electrostatic precipitators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.forced-outage","kind":"concept","label":"Forced outage","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Forced outage as: The shutdown of a generating unit, transmission line, or other facility for emergency reasons or a condition in which the generating equipment is unavailable for load due to unanticipated breakdown.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fossil-fuel-plant","kind":"concept","label":"Fossil fuel plant","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fossil fuel plant as: A plant using coal, petroleum, or gas as its source of energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fossil-fuel-steam-electric-power-plant","kind":"concept","label":"Fossil fuel steam-electric power plant","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fossil fuel steam-electric power plant as: An electricity generation plant in which the","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.foundry-coke","kind":"concept","label":"Foundry coke","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Foundry coke as: This is a special coke that is used in furnaces to produce cast and ductile iron products. It is a source of heat and also helps maintain the required carbon content of the metal product. Foundry coke production requires lower temperatures and longer times than blast furnace coke.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fractionation","kind":"concept","label":"Fractionation","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fractionation as: The process by which saturated hydrocarbons are removed from natural gas and separated into distinct products, or \"fractions,\" such as propane, butane, and ethane.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fresh-feed-input","kind":"concept","label":"Fresh feed input","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fresh feed input as: Represents input of material (crude oil, unfinished oils, natural gas liquids, other hydrocarbons and oxygenates or finished products) to processing units at a refinery that is being processed (input) into a particular unit for the first time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fresh-feeds","kind":"concept","label":"Fresh feeds","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fresh feeds as: Crude oil or petroleum distillates that are being fed to processing units for the first time.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-cell","kind":"concept","label":"Fuel cell","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel cell as: A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-cell-electric-vehicle-fcev","kind":"concept","label":"Fuel cell electric vehicle (FCEV)","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel cell electric vehicle (FCEV) as: An electric vehicle that generates on-board electricity with a fuel cell powered by hydrogen rather than relying on electricity from a high capacity battery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuel-injection","kind":"concept","label":"Fuel injection","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuel injection as: A fuel delivery system whereby gasoline is pumped to one or more fuel injectors under high pressure. The fuel injectors are valves that, at the appropriate times, open to allow fuel to be sprayed or atomized into a throttle bore or into the intake manifold ports. The fuel injectors are usually solenoid operated valves under the control of the vehicle's on-board computer (thus the term \"electronic fuel injection\"). The fuel efficiency of fuel injection systems is less temperature-dependent than carburetor systems. Diesel engines always use injectors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fuels-solvent-deasphalting","kind":"concept","label":"Fuels solvent deasphalting","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fuels solvent deasphalting as: A refining process for removing asphalt compounds from petroleum fractions, such as reduced crude oil. The recovered stream from this process is used to produce fuel products.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.fugitive-emissions","kind":"concept","label":"Fugitive emissions","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Fugitive emissions as: Unintended leaks of gas from the processing, transmission, and/or transportation of fossil fuels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.full-power-day","kind":"concept","label":"Full power day","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Full power day as: The equivalent of 24 hours of full power operation by a reactor. The number of full power days in a specific cycle is the product of the reactor's capacity factor and the length of the cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.full-power-operation","kind":"concept","label":"Full power operation","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Full power operation as: Operation of a unit at 100 percent of its design capacity. Full-power operation precedes commercial operation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.furnace","kind":"concept","label":"Furnace","sources":[{"id":"eia-glossary.F","title":"U.S. EIA Glossary, letter F","url":"https://www.eia.gov/tools/glossary/index.php?id=F"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Furnace as: The part of a boiler or warm-air space-heating plant in which combustion takes place.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-cooled-fast-breeder-reactor-gcfb","kind":"concept","label":"Gas cooled fast breeder reactor (GCFB)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas cooled fast breeder reactor (GCFB) as: A fast breeder reactor that is cooled by a gas (usually helium) under pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-to-liquids-gtl","kind":"concept","label":"Gas to liquids (GTL)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas to liquids (GTL) as: A process that combines the carbon and hydrogen elements in natural gas molecules to make synthetic liquid petroleum products, such as diesel fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-turbine-plant","kind":"concept","label":"Gas turbine plant","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas turbine plant as: A plant in which the prime mover is a gas turbine. A gas turbine consists typically of an axial-flow air compressor and one or more combustion chambers where liquid or gaseous fuel is burned and the hot gases are passed to the turbine and where the hot gases expand drive the generator and are then used to run the compressor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-well","kind":"concept","label":"Gas well","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas well as: A well completed for production of natural gas from one or more gas zones or reservoirs. Such wells contain no completions for the production of crude oil.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gas-well-productivity","kind":"concept","label":"Gas well productivity","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gas well productivity as: Derived annually by dividing gross natural gas withdrawals from gas wells by the number of producing gas wells on December 31 and then dividing the quotient by the number of days in the year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasohol","kind":"concept","label":"Gasohol","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasohol as: A blend of finished motor gasoline containing alcohol (generally ethanol but sometimes methanol) at a concentration between 5.7 percent and 10 percent by volume. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasoline-blending-components","kind":"concept","label":"Gasoline blending components","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasoline blending components as: Naphthas which will be used for blending or compounding into finished aviation or motor gasoline (e.g., straight-run gasoline, alkylate, reformate, benzene, toluene, andxylene). Excludes oxygenates (alcohols, ethers), butane, and pentanes plus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gasoline-motor-leaded","kind":"concept","label":"Gasoline motor, (leaded)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gasoline motor, (leaded) as: Contains more than 0.05 grams of lead per gallon or more than 0.005 grams of phosphorus per gallon. The actual lead content of any given gallon may vary. Premium and regular grades are included, depending on the octane rating. Includes leaded gasohol. Blendstock is excluded until blending has been completed. Alcohol that is to be used in the blending of gasohol is also excluded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gate-station","kind":"concept","label":"Gate station","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gate station as: Location where the pressure of natural gas being transferred from the transmission system to the distribution system is lowered for transport through small diameter, low pressure pipelines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generating-station","kind":"concept","label":"Generating station","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generating station as: A station that consists of electric generators and auxiliary equipment for converting mechanical, chemical, or nuclear energy into electric energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generating-unit","kind":"concept","label":"Generating unit","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generating unit as: Any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce electric power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generator-capacity","kind":"concept","label":"Generator capacity","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generator capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, adjusted for ambient conditions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.generator-nameplate-capacity-installed","kind":"concept","label":"Generator nameplate capacity (installed)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Generator nameplate capacity (installed) as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer. Installed generator nameplate capacity is commonly expressed in megawatts (MW) and is usually indicated on a nameplate physically attached to the generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.geologic-sequestration","kind":"concept","label":"Geologic sequestration","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Geologic sequestration as: A type of engineered sequestration, where captured carbon dioxide is injected for permanent storage into underground geologic reservoirs, such as oil and natural gas fields, saline aquifers, or abandoned coal mines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.geothermal-plant","kind":"concept","label":"Geothermal plant","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Geothermal plant as: A plant in which the prime mover is a steam turbine. The turbine is driven either by steam produced from hot water or by natural steam that derives its energy from heat found in rock.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-additions-to-construction-work-in-progress-for-the-month","kind":"concept","label":"Gross additions to construction work in progress for the month","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross additions to construction work in progress for the month as: This amount should include the monthly gross additions for an electric plant in the process of construction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-gas-withdrawal","kind":"concept","label":"Gross gas withdrawal","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross gas withdrawal as: The full-volume of compounds extracted at the wellhead, including nonhydrocarbon gases and natural gas plant liquids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-inputs","kind":"concept","label":"Gross inputs","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross inputs as: The crude oil, unfinished oils, and natural gas plant liquids put into atmospheric crude oil distillation units.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.gross-vehicle-weight-rating-gvwr","kind":"concept","label":"Gross vehicle weight rating (GVWR)","sources":[{"id":"eia-glossary.G","title":"U.S. EIA Glossary, letter G","url":"https://www.eia.gov/tools/glossary/index.php?id=G"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Gross vehicle weight rating (GVWR) as: Vehicle weight plus carrying capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-content","kind":"concept","label":"Heat content","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat content as: The amount of heat energy available to be released by the transformation or use of a specified physical unit of an energy form (e.g., a ton of coal, a barrel of oil, a kilowatthour of electricity, a cubic foot of natural gas, or a pound of steam). The amount of heat energy is commonly expressed in British thermal units (Btu). Note: Heat content of combustible energy forms can be expressed in terms of either gross heat content (higher or upper heating value) or net heat content (lower heating value), depending upon whether or not the available heat energy includes or excludes the energy used to vaporize water (contained in the original energy form or created during the combustion process). The Energy Information Administration typically uses gross heat content values.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump","kind":"concept","label":"Heat pump","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump as: Heating and/or cooling equipment that, during the heating season, draws heat into a building from outside and, during the cooling season, ejects heat from the building to the outside. Heat pumps are vapor-compression refrigeration systems whose indoor/outdoor coils are used reversibly as condensers or evaporators, depending on the need for heating or cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump-air-source","kind":"concept","label":"Heat pump (air source)","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump (air source) as: An air-source heat pump is the most common type of heat pump. The heat pump absorbs heat from the outside air and transfers the heat to the space to be heated in the heating mode. In the cooling mode the heat pump absorbs heat from the space to be cooled and rejects the heat to the outside air. In the heating mode when the outside air approaches 32o F or less, air-source heat pumps loose efficiency and generally require a back-up (resistance) heating system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heat-pump-geothermal","kind":"concept","label":"Heat pump (geothermal)","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heat pump (geothermal) as: A heat pump in which the refrigerant exchanges heat (in a heat exchanger) with a fluid circulating through an earth connection medium (ground or ground water). The fluid is contained in a variety of loop (pipe) configurations depending on the temperature of the ground and the ground area available. Loops may be installed horizontally or vertically in the ground or submersed in a body of water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heating-value","kind":"concept","label":"Heating value","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heating value as: Heating value: A measure of the energy content of the physical unit of any combustible fuel. For a fuller discussion of","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heavy-water-moderated-reactor","kind":"concept","label":"Heavy-water-moderated reactor","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heavy-water-moderated reactor as: A reactor that uses heavy water as its moderator. Heavy water is an excellent moderator and thus permits the use of in expensive natural (unenriched) uranium as fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.heliostat","kind":"concept","label":"Heliostat","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Heliostat as: A mirror that reflects solar rays onto a central receiver. A heliostat automatically adjusts its position to track daily or seasonal changes in the sun's position. The arrangement of heliostats around a central receiver is also called a solar collector field.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.high-efficiency-ballast","kind":"concept","label":"High efficiency ballast","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines High efficiency ballast as: A lighting conservation feature consisting of an energy-efficient version of a conventional electromagnetic ballast. The ballast is the transformer for fluorescent and high-intensity discharge (HID) lamps, which provides the necessary current, voltage, and wave-form conditions to operate the lamp. A high-efficiency ballast requires lower power input than a conventional ballast to operate HID and fluorescent lamps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.high-temperature-collector","kind":"concept","label":"High-temperature collector","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines High-temperature collector as: A solar thermal collector designed to operate at a temperature of 180 degrees Fahrenheit or higher.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.horizontal-axis-wind-turbine","kind":"concept","label":"Horizontal axis wind turbine","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Horizontal axis wind turbine as: The most common type of wind turbine where the axis of rotation is oriented horizontally. Also see","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.horsepower","kind":"concept","label":"Horsepower","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Horsepower as: A unit for measuring the rate of work (or power) equivalent to 33,000 foot-pounds per minute or 746 watts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hours-under-load","kind":"concept","label":"Hours under load","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hours under load as: The hours the boiler is operating to drive the generator producing electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.htgr","kind":"concept","label":"HTGR","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HTGR as: High Temperature Gas-cooled Reactor","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hub-height","kind":"concept","label":"Hub height","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hub height as: In a horizontal-axis wind turbine, the distance from the turbine platform to the rotor shaft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.humidifier","kind":"concept","label":"Humidifier","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Humidifier as: A humidifier adds moisture to the air(often needed in winter when indoor air is very dry). It may be a portable unit or attached to the heating system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hvac","kind":"concept","label":"HVAC","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HVAC as: An abbreviation for the heating, ventilation, and air-conditioning system; the system or systems that condition air in a building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hvac-conservation-feature","kind":"concept","label":"HVAC conservation feature","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines HVAC conservation feature as: A building feature designed to reduce the amount of energy consumed by the heating, cooling, and ventilating equipment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hybrid-transmission-line","kind":"concept","label":"Hybrid transmission line","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hybrid transmission line as: A double-circuit line that has one alternating current and one direct circuit. The AC circuit usually serves local loads along the line.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hydraulic-fracturing","kind":"concept","label":"Hydraulic fracturing","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hydraulic fracturing as: A process that stimulates or increases production and ultimate recovery from a well by pumping a fluid and a proppant (sand or similar material) at high pressure into a well to create fractures in the reservoir that the proppant holds open. Hydraulic fracturing increases the surface of the formation available for oil and natural gas to flow into the wellbore (the hole drilled into the earth to extract oil and natural gas). Water is the most commonly used fluid, but carbon dioxide and nitrogen are sometimes used. The proppant is usually sand, but resin-coated sand, ceramics, and sintered bauxite are sometimes used. Hydraulic fracturing is common in low-permeability formations.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.hydraulic-head","kind":"concept","label":"Hydraulic head","sources":[{"id":"eia-glossary.H","title":"U.S. EIA Glossary, letter H","url":"https://www.eia.gov/tools/glossary/index.php?id=H"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Hydraulic head as: The distance between the respective elevations of the upstream water surface (headwater) above and the downstream surface water (tailwater) below a hydroelectric power plant.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.improved-recovery","kind":"concept","label":"Improved recovery","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Improved recovery as: Extraction of crude oil or natural gas by any method other than those that rely primarily on natural reservoir pressure, gas lift, or a system of pumps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.incandescent-lamp","kind":"concept","label":"Incandescent lamp","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Incandescent lamp as: A glass enclosure in which light is produced when a tungsten filament is electrically heated so that it glows. Much of the energy is converted into heat; therefore, this class of lamp is a relatively inefficient source of light. Included in this category are the familiar screw-in light bulbs, as well as somewhat more efficient lamps, such as tungsten halogen lamps, reflector or r-lamps, parabolic aluminized reflector (PAR) lamps, and ellipsoidal reflector(ER) lamps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.incandescent-light-bulbs-including-regular-or-energy-efficient-light-bulbs","kind":"concept","label":"Incandescent light bulbs, including regular or energy-efficient light bulbs","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Incandescent light bulbs, including regular or energy-efficient light bulbs as: An incandescent bulb is a type of electric light in which light is produced by a filament heated by electric current. The most common example is the type you find in most table and floor lamps. In commercial buildings, incandescent lights are used for display lights in retail stores, hotels and motels. This includes the very small, high-intensity track lights used to display merchandise or provide spot illumination in restaurants. Energy efficient light bulbs, known as \"watt-savers,\" use less energy than a standard incandescent bulb. \"Long-life\" bulbs, bulbs that last longer than standard incandescent but produce considerably less light, are not considered energy-efficient bulbs. This category also includes halogen lamps. Halogen lamps are a special type of incandescent lamp containing halogen gas to produce a brighter, whiter light than standard incandescent. Halogen lamps come in three styles bulbs, models with reflectors, and infrared models with reflectors. Halogen lamps are especially suited to recessed or \"canned fixtures,\" track lights, and outdoor lights.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.independent-system-operator-iso","kind":"concept","label":"Independent system operator (ISO)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Independent system operator (ISO) as: An independent, federally regulated entity established to coordinate regional transmission in a non-discriminatory manner and ensure the safety and reliability of the electric system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.initial-operation","kind":"concept","label":"Initial operation","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Initial operation as: First availability of a newly constructed unit to provide power to the grid. For a nuclear unit, this time is when the Full Power Operating License for the unit is received.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.insulator","kind":"concept","label":"Insulator","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Insulator as: A material that is a very poor conductor of electricity. The insulating material is usually a ceramic or fiberglass when used in the transmission line and is designed to support a conductor physically and to separate it electrically from other conductors and supporting material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integral-collector-storage-ics","kind":"concept","label":"Integral collector storage (ICS)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integral collector storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed directly by the storage medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integrated-demand","kind":"concept","label":"Integrated demand","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integrated demand as: The summation of the continuously varying instantaneous demand averaged over a specified interval of time. The information is usually determined by examining a demand meter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.integrated-gasification-combined-cycle-technology","kind":"concept","label":"Integrated gasification-combined cycle technology","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Integrated gasification-combined cycle technology as: Coal, water, and oxygen are fed to gasifier, which produces syngas. This medium-Btu gas is cleaned (particulates and sulfur compounds removed) and is fed to a gas turbine. The hot exhaust of the gas turbine and heat recovered from the gasification process are routed through a heat-recovery routed through a heat-recovery generator to produce steam, which drives a steam turbine to produce electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interconnected-system","kind":"concept","label":"Interconnected system","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interconnected system as: A system consisting of two or more individual power systems normally operating with connecting tie lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermediate-grade-gasoline","kind":"concept","label":"Intermediate grade gasoline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermediate grade gasoline as: A grade of unleaded gasoline with an octane rating intermediate between \"regular\" and \"premium.\" Octane boosters are added to gasolines to control engine pre-ignition or \"knocking\" by slowing combustion rates.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermediate-load-electric-system","kind":"concept","label":"Intermediate load (electric system)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermediate load (electric system) as: The range from base load to a point between base load and peak. This point may be the midpoint, a percent of the peak load, or the load over a specified time period.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intermittent-electric-generator-or-intermittent-resource","kind":"concept","label":"Intermittent electric generator or intermittent resource","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intermittent electric generator or intermittent resource as: An electric generating plant with output controlled by the natural variability of the energy resource rather than dispatched based on system requirements. Intermittent output usually results from the direct, non-stored conversion of naturally occurring energy fluxes such as solar energy, wind energy, or the energy of free-flowing rivers (that is, run-of-river hydroelectricity).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-collector-storage-ics","kind":"concept","label":"Internal Collector Storage (ICS)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal Collector Storage (ICS) as: A solar thermal collector in which incident solar radiation is absorbed by the storage medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-combustion-engine-ice","kind":"concept","label":"Internal combustion engine (ICE)","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal combustion engine (ICE) as: Generates mechanical power by burning a liquid, such as gasoline, diesel, or biofuels, or a gaseous fuel, such as compressed natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.internal-combustion-plant","kind":"concept","label":"Internal combustion plant","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Internal combustion plant as: A plant in which the prime mover is an internal combustion engine. An internal combustion engine has one or more cylinders in which the process of combustion takes place, converting energy released from the rapid burning of a fuel-air mixture into mechanical energy. Diesel or gas-fired engines are the principal types used in electric plants. The plant is usually operated during periods of high demand for electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interruptible-load","kind":"concept","label":"Interruptible load","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interruptible load as: This Demand-Side Management category represents the consumer load that, in accordance with contractual arrangements, can be interrupted at the time of annual peak load by the action of the consumer at the direct request of the system operator. This type of control usually involves large-volume commercial and industrial consumers. Interruptible Load does not include Direct Load Control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.interstate-pipeline","kind":"concept","label":"Interstate pipeline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Interstate pipeline as: Any person engaged in natural gas transportation subject to the jurisdiction of Federal Energy Regulatory Commission (FERC) under the Natural Gas Act.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.intrastate-pipeline","kind":"concept","label":"Intrastate pipeline","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Intrastate pipeline as: Any person engaged in natural gas transportation (not including gathering) that is not subject to the jurisdiction of the Commission under the Natural Gas Act (other than any such pipeline that is not subject to the jurisdiction of the Commission solely by reason of Section 1(c) of the Natural Gas Act).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ion-exchange","kind":"concept","label":"Ion exchange","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ion exchange as: Reversible exchange of ions adsorbed on a mineral or synthetic polymer surface with ions in solution in contact with the surface. A chemical process used for recovery of uranium from solution by the interchange of ions between a solution and a solid, commonly a resin.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.irradiated-nuclear-fuel","kind":"concept","label":"Irradiated nuclear fuel","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Irradiated nuclear fuel as: Nuclear fuel that has been exposed to radiation in the reactor core at any power level.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.isomerization","kind":"concept","label":"Isomerization","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Isomerization as: A refining process that alters the fundamental arrangement of atoms in the molecule without adding or removing anything from the original material. Used to convert normal butane into isobutane (C","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.isopach","kind":"concept","label":"Isopach","sources":[{"id":"eia-glossary.I","title":"U.S. EIA Glossary, letter I","url":"https://www.eia.gov/tools/glossary/index.php?id=I"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Isopach as: A line on a map drawn through points of equal thickness of a designated unit (such as a coal bed).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.jacket","kind":"concept","label":"Jacket","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Jacket as: The enclosure on a water heater, furnace, or boiler.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.joint-use-facility","kind":"concept","label":"Joint-use facility","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Joint-use facility as: A multiple-purpose hydroelectric plant. An example is a dam that stores water for both flood control and power production.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.joule-j","kind":"concept","label":"Joule (J)","sources":[{"id":"eia-glossary.J","title":"U.S. EIA Glossary, letter J","url":"https://www.eia.gov/tools/glossary/index.php?id=J"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Joule (J) as: The meter-kilogram-second unit of work or energy, equal to the work done by a force of one newton when its point of application moves through a distance of one meter in the direction of the force; equivalent to 107 ergs and one watt-second.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kaplan-turbine","kind":"concept","label":"Kaplan turbine","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kaplan turbine as: A type of turbine that that has two blades whose pitch is adjustable. The turbine may have gates to control the angle of the fluid flow into the blades.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kerogen","kind":"concept","label":"Kerogen","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kerogen as: Naturally occurring solid organic matter in sedimentary rock that is insoluble in organic solvents. Kerogen originates from algae, plankton, and plant material from aquatic and terrestrial environments. Under the right conditions of pressure, temperature, and time, kerogen can form oil and natural gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kerosene","kind":"concept","label":"Kerosene","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kerosene as: A light petroleum distillate that is used in space heaters, cook stoves, and water heaters and is suitable for use as a light source when burned in wick-fed lamps. Kerosene has a maximum distillation temperature of 400 degrees Fahrenheit at the 10-percent recovery point, a final boiling point of 572 degrees Fahrenheit, and a minimum flash point of 100 degrees Fahrenheit. Included are No. 1-K and No. 2-K, the two grades recognized by ASTM Specification D 3699 as well as all other grades of kerosene called range or stove oil, which have properties similar to those of No. 1 fuel oil. Also see Kerosene-type jet fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kilovolt-ampere-kva","kind":"concept","label":"Kilovolt-Ampere (kVa)","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kilovolt-Ampere (kVa) as: A unit of apparent power, equal to 1,000 volt-amperes; the mathematical product of the volts and amperes in an electrical circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.kilowatthour-kwh","kind":"concept","label":"Kilowatthour (kWh)","sources":[{"id":"eia-glossary.K","title":"U.S. EIA Glossary, letter K","url":"https://www.eia.gov/tools/glossary/index.php?id=K"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Kilowatthour (kWh) as: A measure of electricity defined as a unit of work or energy, measured as 1 kilowatt (1,000watts) of power expended for 1 hour. One kWh is equivalent to 3,412 Btu.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.landfill-gas","kind":"concept","label":"Landfill gas","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Landfill gas as: Gas that is generated by decomposition of organic material at landfill disposal sites. The average composition of landfill gas is approximately 50 percent methane and 50 percent carbon dioxide and water vapor by volume. The methane percentage, however, can vary from 40 to 60 percent, depending on several factors including waste composition (e.g. carbohydrate and cellulose content). The methane in landfill gas may be vented, flared, combusted to generate electricity or useful thermal energy on-site, or injected into a pipeline for combustion off-site.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.large-scale-solar","kind":"concept","label":"Large-scale solar","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Large-scale solar as: Solar thermal and photovoltaic generating units at power plants larger than or equal to one megawatt.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lead-acid-battery","kind":"concept","label":"Lead acid battery","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lead acid battery as: An electrochemical battery that uses lead and lead oxide for electrodes and sulfuric acid for the electrolyte.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.leading-edge","kind":"concept","label":"Leading edge","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.life-extension","kind":"concept","label":"Life extension","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Life extension as: Restoration or refurbishment of a plant to its original performance without the installation of new combustion technologies. Life extension results in 10 to 20 years of plant life beyond the anticipated retirement date, but usually does not result in larger capacity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lift","kind":"concept","label":"Lift","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lift as: The force that pulls a wind turbine blade, as opposed to drag.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.light-water-reactor-lwr","kind":"concept","label":"Light water reactor (LWR)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Light water reactor (LWR) as: A nuclear reactor that uses water as the primary coolant and moderator, with slightly enriched uranium as fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lighting-conservation-feature","kind":"concept","label":"Lighting conservation feature","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lighting conservation feature as: A building feature or practice designed to reduce the amount of energy consumed by the lighting system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lighting-equipment","kind":"concept","label":"Lighting equipment","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lighting equipment as: These are light bulbs used to light the building's interior, such as incandescent light bulbs, fluorescent light bulbs, compact fluorescent light bulbs, and high-intensity discharge (HID) lights.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.liquid-collector","kind":"concept","label":"Liquid collector","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Liquid collector as: A medium-temperature solar thermal collector, employed predominantly in water heating, which uses pumped liquid as the heat-transfer medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.liquid-metal-fast-breeder-reactor","kind":"concept","label":"Liquid metal fast breeder reactor","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Liquid metal fast breeder reactor as: A nuclear breeder reactor, cooled by molten sodium, in which fission is caused by fast neutrons.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-loss-3-hours","kind":"concept","label":"Load loss (3 hours)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load loss (3 hours) as: Any significant incident on an electric utility system that results in a continuous outage of 3 hours or longer to more than 50,000 customers or more than one half of the total customers being served immediately prior to the incident, whichever is less.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-management-technique","kind":"concept","label":"Load management technique","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load management technique as: Utility demand management practices directed at reducing the maximum kilowatt demand on an electric system and/or modifying the coincident peak demand of one or more classes of service to better meet the utility system capability for a given hour, day, week, season, or year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.load-on-equipment","kind":"concept","label":"Load on equipment","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Load on equipment as: One hundred percent load is the maximum continuous net output of the unit at normal operating conditions during the annual peak load month. For example, if the equipment is capable of operating at 5% over pressure continuously, use this condition for 100% load.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.longwall-mining","kind":"concept","label":"Longwall mining","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Longwall mining as: An automated form of underground coal mining characterized by high recovery and extraction rates, feasible only in relatively flat-lying, thick, and uniform coalbeds. A high-powered cutting machine is passed across the exposed face of coal, shearing away broken coal, which is continuously hauled away by a floor-level conveyor system. Longwall mining extracts all machine-minable coal between the floor and ceiling within a contiguous block of coal, known as a panel, leaving no support pillars within the panel area. Panel dimensions vary over time and with mining conditions but currently average about 900 feet wide (coal face width) and more than 8,000 feet long (the minable extent of the panel, measured indirection of mining). Longwall mining is done under movable roof supports that are advanced as the bed is cut. The roof in the mined-out area is allowed to fall as the mining advances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.low-power-testing","kind":"concept","label":"Low power testing","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Low power testing as: The period of time between a plant's nuclear generating unit's initial fuel loading date and the issuance of its operating (full-power) license. The maximum level of operation during this period is 5 percent of the unit's thermal rating.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lubricants","kind":"concept","label":"Lubricants","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lubricants as: Substances used to reduce friction between bearing surfaces, or incorporated into other materials used as processing aids in the manufacture of other products, or used as carriers of other materials. Petroleum lubricants may be produced either from distillates or residues. Lubricants include all grades of lubricating oils, from spindle oil to cylinder oil to those used in greases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.lumens-watt-lpw","kind":"concept","label":"Lumens/Watt (lpw)","sources":[{"id":"eia-glossary.L","title":"U.S. EIA Glossary, letter L","url":"https://www.eia.gov/tools/glossary/index.php?id=L"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Lumens/Watt (lpw) as: A measure of the efficacy (efficiency) of lamps. It indicates the amount of light (lumens) emitted by the lamp for each unit of electrical power (Watts) used.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.machine-drive-motors","kind":"concept","label":"Machine drive (motors)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Machine drive (motors) as: The direct process end use in which thermal or electric energy is converted into mechanical energy. Motors are found in almost every process in manufacturing. Therefore, when motors are found in equipment that is wholly contained in another end use (such as process cooling and refrigeration), the energy is classified there rather than in machine drive.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.main-heating-fuel","kind":"concept","label":"Main heating fuel","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Main heating fuel as: The form of energy used most frequently to heat the largest portion of the floorspace of a structure. The energy source designated as the main heating fuel is the source delivered to the site for that purpose, not any subsequent form into which it is transformed on site to deliver the heat energy (e.g., for buildings heated by a steam boiler, the main heating fuel is the main input fuel to the boiler, not the steam or hot water circulated through the building.) Note: In commercial buildings, the heating must be to at least 50 degrees Fahrenheit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mains","kind":"concept","label":"Mains","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mains as: A system of pipes for transporting gas within a distributing gas utility's retail service area to points of connection with consumer service pipes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.manufactured-gas","kind":"concept","label":"Manufactured gas","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Manufactured gas as: A gas obtained by destructive distillation of coal or by the thermal decomposition of oil, or by the reaction of steam passing through a bed of heated coal or coke. Examples are coal gases, coke oven gases, producer gas, blast furnace gas, blue (water) gas, carbureted water gas. Btu content varies widely.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.marketed-production","kind":"concept","label":"Marketed production","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Marketed production as: Gross withdrawals less gas used for repressuring, quantities vented and flared, and nonhydrocarbon gases removed in treating or processing operations. Includes all quantities of gas used in field and processing plant operations.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.maximum-dependable-capacity-net","kind":"concept","label":"Maximum dependable capacity, net","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Maximum dependable capacity, net as: The gross electrical output measured at the output terminals of the turbine generator(s) during the most restrictive seasonal conditions, less the station service load.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.maximum-generator-nameplate-capacity","kind":"concept","label":"Maximum generator nameplate capacity","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Maximum generator nameplate capacity as: The maximum rated output of a generator, prime mover, or other electric power production equipment under specific conditions designated by the manufacturer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mean-power-output-of-a-wind-turbine","kind":"concept","label":"Mean power output (of a wind turbine)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mean power output (of a wind turbine) as: The average power output of a wind energy conversion system at a given mean wind speed based on a Raleigh frequency distribution.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.medium-temperature-collector","kind":"concept","label":"Medium-temperature collector","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Medium-temperature collector as: A collector designed to operate in the temperature range of 140 degrees to 180 degrees Fahrenheit, but that can also operate at a temperature as low as 110 degrees Fahrenheit. The collector typically consists of a metal frame, metal absorption panels with integral flow channels (attached tubing for liquid collectors or integral ducting for air collectors), and glazing and insulation on the sides and back.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.microgroove","kind":"concept","label":"Microgroove","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Microgroove as: A small groove scribed into the surface of a solar photovoltaic cell which is filled with metal for contacts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.micrometer-or-micron","kind":"concept","label":"Micrometer (or Micron)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Micrometer (or Micron) as: One-millionth of a meter. It can also be expressed as 10-6 meter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mill-feed","kind":"concept","label":"Mill feed","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mill feed as: Uranium ore supplied to a crusher or grinding mill in an ore-dressing process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.milling-of-uranium","kind":"concept","label":"Milling of uranium","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Milling of uranium as: The processing of uranium from ore mined by conventional methods, such as underground or open-pit methods, to separate the uranium from the undesired material in the ore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.mineral-matter-free-basis","kind":"concept","label":"Mineral-matter-free basis","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Mineral-matter-free basis as: Mineral matter in coal is the parent material in coal from which ash is derived and which comes from minerals present in the original plant materials that formed the coal, or from extraneous sources such as sediments and precipitates from mineralized water. Mineral matter in coal cannot be analytically determined and is commonly calculated using data on ash and ash-forming constituents. Coal analyses are calculated to the mineral matter free basis by adjusting formulas used in calculations in order to deduct the weight of mineral matter from the total coal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.minority-carrier","kind":"concept","label":"Minority carrier","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Minority carrier as: A current carrier, either an electron or a hole, that is in the minority in a specific layer of a semiconductor material; the diffusion of minority carriers under the action of the cell junction voltage is the current in a photovoltaic device.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.moderator","kind":"concept","label":"Moderator","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Moderator as: A material, such as ordinary water, heavy water, or graphite, used in a reactor to slow down high-velocity neutrons, thus increasing the likelihood of further fission.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-gasoline-finished","kind":"concept","label":"Motor gasoline (finished)","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor gasoline (finished) as: A complex mixture of relatively volatile hydrocarbons with or without small quantities of additives, blended to form a fuel suitable for use in spark-ignition engines. Motor gasoline, as defined in ASTM Specification D 4814 or Federal Specification VV-G-1690C, is characterized as having a boiling range of 122 to 158 degrees Fahrenheit at the 10 percent recovery point to 365 to 374 degrees Fahrenheit at the 90 percent recovery point. Motor Gasoline includes conventional gasoline; all types of oxygenated gasoline, including gasohol; and reformulated gasoline, but excludes aviation gasoline. Note: Volumetric data on blending components, such as oxygenates, are not counted in data on finished motor gasoline until the blending components are blended into the gasoline.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-gasoline-blending","kind":"concept","label":"Motor gasoline blending","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor gasoline blending as: Mechanical mixing of motor gasoline blending components, and oxygenates when required, to produce finished motor gasoline. Finished motor gasoline may be further mixed with other motor gasoline blending components or oxygenates, resulting in increased volumes of finished motor gasoline and/or changes in the formulation of finished motor gasoline (e.g., conventional motor gasoline mixed with MTBE to produce oxygenated motor gasoline).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.motor-speed","kind":"concept","label":"Motor speed","sources":[{"id":"eia-glossary.M","title":"U.S. EIA Glossary, letter M","url":"https://www.eia.gov/tools/glossary/index.php?id=M"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Motor speed as: The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.name-plate","kind":"concept","label":"Name plate","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Name plate as: A metal tag attached to a machine or appliance that contains information such as brand name, serial number, voltage, power ratings under specified conditions, and other manufacturer supplied data.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.naphtha-type-jet-fuel","kind":"concept","label":"Naphtha-type jet fuel","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Naphtha-type jet fuel as: A fuel in the heavy naphtha boiling range having an average gravity of 52.8 degrees API, 20% to 90% distillation temperatures of 290 degrees to 470 degrees Fahrenheit, and meeting Military Specification MIL-T-5624L (Grade JP-4).It is used primarily for military turbojet and turboprop aircraft engines because it has a lower freeze point than other aviation fuels and meets engine requirements at high altitudes and speeds. Note: Beginning with January 2004 data, naphtha-type jet fuel is included in","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.naphthas","kind":"concept","label":"Naphthas","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Naphthas as: Refined or partly refined light distillates with an approximate boiling point range between 122 and 400 degrees Fahrenheit. Blended further or mixed with other materials, they make high-grade motor gasoline or jet fuel. Also, used as solvents,","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.native-gas","kind":"concept","label":"Native gas","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Native gas as: Gas in place at the time that a reservoir was converted to use as an underground storage reservoir in contrast to injected gas volumes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-marketed-production","kind":"concept","label":"Natural gas marketed production","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas marketed production as: Gross withdrawals of natural gas from production reservoirs, less gas used for reservoir repressuring, nonhydrocarbon gases removed in treating and processing operations, and quantities vented and flared.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-plant-liquids-ngpl","kind":"concept","label":"Natural gas plant liquids (NGPL)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) as: Those hydrocarbons in natural gas that are separated as liquids at natural gas processing, fractionating, and cycling plants. Products obtained include","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-gas-plant-liquids-ngpl-production","kind":"concept","label":"Natural gas plant liquids (NGPL) production","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural gas plant liquids (NGPL) production as: The extraction of gas plant liquids constituents such as","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-reservoir-pressure","kind":"concept","label":"Natural reservoir pressure","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural reservoir pressure as: The energy within an oil or gas reservoir that causes the oil or gas to rise (unassisted by other forces) to the earth's surface when the reservoir is penetrated by an oil or gas well. The energy may be the result of \"dissolved gas drive,\" \"gas cap drive,\" or \"water drive.\" Regardless of the type of drive, the principle is the same: the energy of the gas or water, creating a natural pressure, forces the oil or gas to the well bore.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.natural-streamflow","kind":"concept","label":"Natural streamflow","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Natural streamflow as: The rate of flow of water past a given point of an uncontrolled stream or regulated streamflow adjusted to eliminate the effects of reservoir storage or upstream diversions at a set time interval.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-cell-shipments","kind":"concept","label":"Net cell shipments","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net cell shipments as: Represents the difference between cell shipments and cell purchases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-energy-for-load-electric","kind":"concept","label":"Net energy for load (electric)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net energy for load (electric) as: Net Balancing Authority Area generation, plus energy received from other Balancing Authority Areas, less energy delivered to Balancing Authority Areas through interchange. It includes Balancing Authority Area losses but excludes energy required for storage at energy storage facilities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-energy-for-system","kind":"concept","label":"Net energy for system","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net energy for system as: The sum of energy an electric utility needs to satisfy their service areas, including full and partial requirements consumers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-generation","kind":"concept","label":"Net generation","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net generation as: The amount of gross generation less the electrical energy consumed at the generating station(s) for station service or auxiliaries. Note: Electricity required for pumping at pumped-storage plants is regarded as electricity for station service and is deducted from gross generation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-head","kind":"concept","label":"Net head","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net head as: The gross head minus all hydraulic losses except those chargeable to the turbine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-module-shipments","kind":"concept","label":"Net module shipments","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net module shipments as: Represents the difference between module shipments and module purchases. When exported, incomplete modules and unencapsulated cells are also included.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-photovoltaic-module-shipment","kind":"concept","label":"Net photovoltaic module shipment","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net photovoltaic module shipment as: The difference between photovoltaic module shipments and photovoltaic module purchases.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-summer-capacity","kind":"concept","label":"Net summer capacity","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net summer capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of summer peak demand (period of June 1 through September 30.) This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.net-winter-capacity","kind":"concept","label":"Net winter capacity","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Net winter capacity as: The maximum output, commonly expressed in megawatts (MW), that generating equipment can supply to system load, as demonstrated by a multi-hour test, at the time of peak winter demand (period of December 1 through February 28). This output reflects a reduction in capacity due to electricity use for station service or auxiliaries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.no-6-residual-fuel-oil","kind":"concept","label":"No. 6 Residual fuel oil","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines No. 6 Residual fuel oil as: Includes Bunker C fuel oil and is used for the production of electric power, space heating, vessel bunkering, and various industrial purposes. See","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.noload-loss","kind":"concept","label":"Noload loss","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Noload loss as: Power and energy lost by an electric system when not operating under demand.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonconventional-plant-uranium","kind":"concept","label":"Nonconventional plant (uranium)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonconventional plant (uranium) as: A facility engineered and built principally for processing of uraniferous solutions that are produced during in situ leach mining, from heap leaching, or in the manufacture of other commodities, and the recovery, by chemical treatment in the plant's circuits, of uranium from the processing solutions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nondedicated-vehicle","kind":"concept","label":"Nondedicated vehicle","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nondedicated vehicle as: A motor vehicle capable of operating on an alternative fuel and /or on either gasoline or diesel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonfuel-components","kind":"concept","label":"Nonfuel components","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonfuel components as: Components that are not associated with a particular fuel. These include, but are not limited to, control spiders, burnable poison rod assemblies, control rod elements, thimble plugs, fission chambers, primary and secondary neutron sources, and BWR (boiling water reactor) channels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nonroad-alternative-fuel-vehicle-nonroad-afv","kind":"concept","label":"Nonroad alternative fuel vehicle (nonroad AFV)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nonroad alternative fuel vehicle (nonroad AFV) as: An alternative fuel vehicle designed for off-road operation and use for surface/air transportation, industrial, or commercial purposes. Nonroad AFVs include forklifts and other industrial vehicles, rail locomotives, self-propelled electric rail cars, aircraft, airport service vehicles, construction vehicles, agricultural vehicles, and marine vessels. Recreational AFVs (golf carts, snow mobiles, pleasure watercraft, etc.) are excluded from the definition.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.north-american-electric-reliability-corporation-nerc","kind":"concept","label":"North American Electric Reliability Corporation (NERC)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines North American Electric Reliability Corporation (NERC) as: A nonprofit corporation formed in 2006 as the successor to the North American Electric Reliability Council established to develop and maintain mandatory reliability standards for the bulk electric system, with the fundamental goal of maintaining and improving the reliability of that system. NERC consists of regional reliability entities covering the interconnected power regions of the contiguous United States, Canada, and Mexico. See the","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-electric-power-nuclear-power","kind":"concept","label":"Nuclear electric power (nuclear power)","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear electric power (nuclear power) as: Electricity generated by the use of the thermal energy released from the fission of nuclear fuel in a reactor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-fuel","kind":"concept","label":"Nuclear fuel","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear fuel as: Fissionable materials that have been enriched to such a composition that, when placed in a nuclear reactor, will support a self-sustaining fission chain reaction, producing heat in a controlled manner for process use.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.nuclear-reactor","kind":"concept","label":"Nuclear reactor","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Nuclear reactor as: An apparatus in which a nuclear fission chain reaction can be initiated, controlled, and sustained at a specific rate. A reactor includes fuel (fissionable material), moderating material to control the rate of fission, a heavy-walled pressure vessel to house reactor components, shielding to protect personnel, a system to conduct heat away from the reactor, and instrumentation for monitoring and controlling the reactor's systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.number-of-mining-operations","kind":"concept","label":"Number of mining operations","sources":[{"id":"eia-glossary.N","title":"U.S. EIA Glossary, letter N","url":"https://www.eia.gov/tools/glossary/index.php?id=N"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Number of mining operations as: The number of mining operations includes preparation plants with greater than 5,000 total direct labor hours. Mining operations that consist of a mine and preparation plant, or a preparation plant only, will be counted as two operations if the preparation plant processes both underground and surface coal. Excluded are silt, culm, refuse bank, slurry dam, and dredge operations except for Pennsylvania anthracite. Excludes mines producing less than 10,000 short tons of coal during the year.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ocean-thermal-energy-conversion-otec","kind":"concept","label":"Ocean thermal energy conversion (OTEC)","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ocean thermal energy conversion (OTEC) as: The process or technologies for producing energy by harnessing the temperature differences (thermal gradients) between ocean surface waters and that of ocean depths. Warm surface water is pumped through an evaporator containing a working fluid in a closed Rankine-cycle system. The vaporized fluid drives a turbine/generator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.octane","kind":"concept","label":"Octane","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Octane as: A flammable liquid hydrocarbon found in petroleum. Used as a standard to measure the anti-knock properties of motor fuel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.octane-rating","kind":"concept","label":"Octane rating","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Octane rating as: A number used to indicate gasoline's antiknock performance in motor vehicle engines. The two recognized laboratory engine test methods for determining the antiknock rating, i.e., octane rating, of gasolines are the Research method and the Motor method. To provide a single number as guidance to the consumer, the antiknock index (R + M)/2, which is the average of the Research and Motor octane numbers, was developed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-peak","kind":"concept","label":"Off peak","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off peak as: Period of relatively low system demand. These periods often occur in daily, weekly, and seasonal patterns; these off-peak periods differ for each individual electric utility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-hours-equipment-reduction","kind":"concept","label":"Off-hours equipment reduction","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off-hours equipment reduction as: A conservation feature where there is a change in the temperature setting or reduction in the use of heating, cooling, domestic hot water heating, lighting or any other equipment either manually or automatically.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.off-site-produced-energy-for-heat-power-and-electricity-generation","kind":"concept","label":"Off-site produced energy for heat, power, and electricity generation","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Off-site produced energy for heat, power, and electricity generation as: This measure of energy consumption includes energy produced off-site and consumed on-site. It excludes primary energy produced and consumed on-site, energy used as raw material input, and electrical system energy losses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.ohm","kind":"concept","label":"Ohm","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Ohm as: A measure of the electrical resistance of a material equal to the resistance of a circuit in which the potential difference of 1 volt produces a current of 1 ampere.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.oil-well","kind":"concept","label":"Oil well","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Oil well as: A well completed for the production of crude oil from at least one oil zone or reservoir.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.eia.oil-well-casing-head-gas","kind":"concept","label":"Oil well (casing head) gas","sources":[{"id":"eia-glossary.O","title":"U.S. EIA Glossary, letter O","url":"https://www.eia.gov/tools/glossary/index.php?id=O"}],"status":"reported","summary":"The U.S. Energy Information Administration glossary defines Oil well (casing head) gas as: Associated and dissolved gas produced along with crude oil from oil completions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstorderlogic","kind":"concept","label":"First order logic","sources":[{"id":"planetmath.firstorderlogic","title":"PlanetMath entry firstorderlogic","url":"https://planetmath.org/firstorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: A logic is first order if it has exactly one type.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.propositionallogic","kind":"concept","label":"Propositional logic","sources":[{"id":"planetmath.propositionallogic","title":"PlanetMath entry propositionallogic","url":"https://planetmath.org/propositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A propositional logic is a logic in which the only objects are propositions , that is, objects which themselves have truth values.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.settheory","kind":"concept","label":"Set theory","sources":[{"id":"planetmath.settheory","title":"PlanetMath entry settheory","url":"https://planetmath.org/settheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E30) states: Set theory is special among mathematical theories, in two ways: It plays a central role in putting mathematics on a reliable axiomatic foundation , and it provides the basic language and apparatus in which most of mathematics is expressed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modeltheory","kind":"concept","label":"Model theory","sources":[{"id":"planetmath.modeltheory","title":"PlanetMath entry modeltheory","url":"https://planetmath.org/modeltheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C99) states: Model theory is a branch of mathematical logic which deals with the general problem of classifying mathematical structures.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.zermelofraenkelaxioms","kind":"concept","label":"Zermelo-Fraenkel axioms","sources":[{"id":"planetmath.zermelofraenkelaxioms","title":"PlanetMath entry zermelofraenkelaxioms","url":"https://planetmath.org/zermelofraenkelaxioms"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E99) states: Ernst Zermelo and Abraham Fraenkel proposed the following axioms as a for what is now called Zermelo-Fraenkel set theory , or ZF.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofchoice","kind":"concept","label":"Axiom of choice","sources":[{"id":"planetmath.axiomofchoice","title":"PlanetMath entry axiomofchoice","url":"https://planetmath.org/axiomofchoice"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30, 03E25) states: The Zermelo-Fraenkel axioms for set theory are often accepted as a basis for an axiomatic set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ordinalnumber","kind":"concept","label":"Ordinal number","sources":[{"id":"planetmath.ordinalnumber","title":"PlanetMath entry ordinalnumber","url":"https://planetmath.org/ordinalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: An ordinal number is a well ordered set S such that, for every x ∈ S , x = { z ∈ S ∣ z < x } (where < is the ordering relation on S ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinalnumber","kind":"concept","label":"Cardinal number","sources":[{"id":"planetmath.cardinalnumber","title":"PlanetMath entry cardinalnumber","url":"https://planetmath.org/cardinalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A cardinal number is an ordinal number S with the property that S ≤ X for every ordinal number X which has the same cardinality as S .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursivefunction","kind":"concept","label":"Recursive function","sources":[{"id":"planetmath.recursivefunction","title":"PlanetMath entry recursivefunction","url":"https://planetmath.org/recursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: Intuitively, a recursive function is a positive integer valued function of one or more positive integer arguments which may be computed by a definite algorithm .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.godelsincompletenesstheorems","kind":"theory","label":"Gödel’s incompleteness theorems","sources":[{"id":"planetmath.godelsincompletenesstheorems","title":"PlanetMath entry godelsincompletenesstheorems","url":"https://planetmath.org/godelsincompletenesstheorems"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B10, 03F45) states: Gödel’s first and second incompleteness theorems are perhaps the most celebrated results in mathematical logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modallogic","kind":"concept","label":"Modal logic","sources":[{"id":"planetmath.modallogic","title":"PlanetMath entry modallogic","url":"https://planetmath.org/modallogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B45) states: Introduction Modal logic is the logic of “ necessity ” and “possibility”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.intuitionisticlogic","kind":"concept","label":"Intuitionistic logic","sources":[{"id":"planetmath.intuitionisticlogic","title":"PlanetMath entry intuitionisticlogic","url":"https://planetmath.org/intuitionisticlogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03B20, 03-01) states: Abstract The entry \" intuitionistic logic \" is a beginner’s introduction to the defining features of Brouwer’s (and his School) mathematical philosophy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lambdacalculus","kind":"concept","label":"Lambda calculus","sources":[{"id":"planetmath.lambdacalculus","title":"PlanetMath entry lambdacalculus","url":"https://planetmath.org/lambdacalculus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40) states: Lambda calculus (often referred to as λ -calculus) was invented in the 1930s by Alonzo Church, as a form of mathematical logic dealing primarly with functions and the application of functions to their arguments .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinalarithmetic","kind":"concept","label":"Cardinal arithmetic","sources":[{"id":"planetmath.cardinalarithmetic","title":"PlanetMath entry cardinalarithmetic","url":"https://planetmath.org/cardinalarithmetic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: Definitions Let κ and λ be cardinal numbers , and let A and B be disjoint sets such that | A | = κ and | B | = λ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicalconnective","kind":"concept","label":"Logical connective","sources":[{"id":"planetmath.logicalconnective","title":"PlanetMath entry logicalconnective","url":"https://planetmath.org/logicalconnective"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In propositional logic , the usual way of forming a well-formed formula out of existing ones is by attaching a designated symbol to the existing wffs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicallanguage","kind":"concept","label":"Logical language","sources":[{"id":"planetmath.logicallanguage","title":"PlanetMath entry logicallanguage","url":"https://planetmath.org/logicallanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: In its most general form, a logical language is a set of rules for constructing formulas for some logic, which can then be assigned truth values based on the rules of that logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantifier","kind":"concept","label":"Quantifier","sources":[{"id":"planetmath.quantifier","title":"PlanetMath entry quantifier","url":"https://planetmath.org/quantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Introduction A quantifier is a logical symbol which makes an assertion about the set of values which make one or more formulas true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.arithmeticalhierarchy","kind":"concept","label":"Arithmetical hierarchy","sources":[{"id":"planetmath.arithmeticalhierarchy","title":"PlanetMath entry arithmeticalhierarchy","url":"https://planetmath.org/arithmeticalhierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: The arithmetical hierarchy is a hierarchy of either (depending on the context ) formulas or relations .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.biconditional","kind":"concept","label":"Biconditional","sources":[{"id":"planetmath.biconditional","title":"PlanetMath entry biconditional","url":"https://planetmath.org/biconditional"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: 1 Biconditional A biconditional is a truth function that is true only in the case that both parameters are true or both are false.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanvaluedfunction","kind":"concept","label":"Boolean-valued function","sources":[{"id":"planetmath.booleanvaluedfunction","title":"PlanetMath entry booleanvaluedfunction","url":"https://planetmath.org/booleanvaluedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q01, 68P01, 06E30, 03G05, 03C55, 03B05, 68R01) states: A Boolean-valued function is a function of type f : X → 𝔹 , where X is an arbitrary set and where 𝔹 is a Boolean domain .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.derivedbooleanoperations","kind":"concept","label":"Derived Boolean operations","sources":[{"id":"planetmath.derivedbooleanoperations","title":"PlanetMath entry derivedbooleanoperations","url":"https://planetmath.org/derivedbooleanoperations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Recall that a Boolean algebra is an algebraic system A consisting of five operations : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalenceofforcingnotions","kind":"concept","label":"Equivalence of forcing notions","sources":[{"id":"planetmath.equivalenceofforcingnotions","title":"PlanetMath entry equivalenceofforcingnotions","url":"https://planetmath.org/equivalenceofforcingnotions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E35, 03E40) states: Let P and Q be two forcing notions such that given any generic subset G of P there is a generic subset H of Q with 𝔐 ⁢ [ G ] = 𝔐 ⁢ [ H ] and vice-versa.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalencerelation","kind":"concept","label":"Equivalence relation","sources":[{"id":"planetmath.equivalencerelation","title":"PlanetMath entry equivalencerelation","url":"https://planetmath.org/equivalencerelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06-00, 03D20) states: An equivalence relation ∼ on a set S is a relation that is: Reflexive .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalentmachines","kind":"concept","label":"Equivalent machines","sources":[{"id":"planetmath.equivalentmachines","title":"PlanetMath entry equivalentmachines","url":"https://planetmath.org/equivalentmachines"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Let M 1 = ( S 1 , Σ , Δ , σ 1 , λ 1 ) and M 2 = ( S 2 , Σ , Δ , σ 2 , λ 2 ) be two Mealy machines .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.filterbasis","kind":"concept","label":"Filter basis","sources":[{"id":"planetmath.filterbasis","title":"PlanetMath entry filterbasis","url":"https://planetmath.org/filterbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 54A99) states: A filter subbasis for a set S is a collection of subsets of S which has the finite intersection property .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstorderlanguage","kind":"concept","label":"First order language","sources":[{"id":"planetmath.firstorderlanguage","title":"PlanetMath entry firstorderlanguage","url":"https://planetmath.org/firstorderlanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let Σ be a signature . The first order language FO ⁡ ( Σ ) on Σ contains the following: 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.kripkesemantics","kind":"concept","label":"Kripke semantics","sources":[{"id":"planetmath.kripkesemantics","title":"PlanetMath entry kripkesemantics","url":"https://planetmath.org/kripkesemantics"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B48, 03B20, 03B45) states: A Kripke frame (or simply a frame) ℱ is a pair ( W , R ) where W is a non-empty set whose elements are called worlds or possible worlds , R is a binary relation on W called the accessibility relation .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.maximallyconsistent","kind":"concept","label":"Maximally consistent","sources":[{"id":"planetmath.maximallyconsistent","title":"PlanetMath entry maximallyconsistent","url":"https://planetmath.org/maximallyconsistent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03B10, 03B99, 03B45) states: A set Δ of well-formed formulas (wff) is maximally consistent if Δ is consistent and any consistent superset of it is itself: Δ ⊆ Γ with Γ consistent implies Γ = Δ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.propositionalcalculus","kind":"concept","label":"Propositional calculus","sources":[{"id":"planetmath.propositionalcalculus","title":"PlanetMath entry propositionalcalculus","url":"https://planetmath.org/propositionalcalculus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03C05, 03B22, 03B05) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase angle \\PMlinkescapephrase Angle \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase complete \\PMlinkescapephrase Complete \\PMlinkescapephrase component \\PMlinkescapephrase Component \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formalism \\PMlinkescapephrase Formalism \\PMlinkescapephrase holder \\PMlinkescapephrase Holder \\PMlinkescapephrase holders \\PMlinkescapephrase Holders \\PMlinkescapephrase origin \\PMlinkescapephrase Origin \\PMlinkescapephrase plus \\PMlinkescapephrase Plus \\PMlinkescapephrase point \\PMlinkescapephrase Point \\PMlinkescapephrase points \\PMlinkescapephrase Points \\PMlinkescapephrase right \\PMlinkescapephrase Right \\PMlinkescapephrase utility \\PMlinkescapephrase Utility A propositional calculus is a formal system whose expressions represent formal objects known as propositions and whose distinguished relations among expressions represent existing relations among propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substitutionsinpropositionallogic","kind":"concept","label":"Substitutions in propositional logic","sources":[{"id":"planetmath.substitutionsinpropositionallogic","title":"PlanetMath entry substitutionsinpropositionallogic","url":"https://planetmath.org/substitutionsinpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: Uniform Substitution One area of mathematics where substitution plays a prominent role is mathematical logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.tautology","kind":"concept","label":"Tautology","sources":[{"id":"planetmath.tautology","title":"PlanetMath entry tautology","url":"https://planetmath.org/tautology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03B10) states: A tautology is a statement (or form) which is true solely on account of its logical form rather than because of the meaning of the terms employed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthfunction","kind":"concept","label":"Truth function","sources":[{"id":"planetmath.truthfunction","title":"PlanetMath entry truthfunction","url":"https://planetmath.org/truthfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A truth function is a function that returns one of two values, one of which is interpreted as “true,” and the other which is interpreted as “false”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthtable","kind":"concept","label":"Truth table","sources":[{"id":"planetmath.truthtable","title":"PlanetMath entry truthtable","url":"https://planetmath.org/truthtable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 34C29) states: A truth table is a tabular listing of all possible input value combinations for a logical function and their corresponding output values.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.truthvaluesemanticsforclassicalpropositionallogic","kind":"concept","label":"Truth-value semantics for classical propositional logic","sources":[{"id":"planetmath.truthvaluesemanticsforclassicalpropositionallogic","title":"PlanetMath entry truthvaluesemanticsforclassicalpropositionallogic","url":"https://planetmath.org/truthvaluesemanticsforclassicalpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In classical propositional logic , an interpretation of a well-formed formula (wff) p is an assignment of truth (=1) or falsity (=0) to p .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomoffoundation","kind":"concept","label":"Axiom of foundation","sources":[{"id":"planetmath.axiomoffoundation","title":"PlanetMath entry axiomoffoundation","url":"https://planetmath.org/axiomoffoundation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99) states: The axiom of foundation (also called the axiom of regularity ) is an axiom of ZF set theory prohibiting circular sets and sets with infinite levels of containment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.extensionofafunction","kind":"concept","label":"Extension of a function","sources":[{"id":"planetmath.extensionofafunction","title":"PlanetMath entry extensionofafunction","url":"https://planetmath.org/extensionofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let f : X → Y be a function and A and B be sets such that X ⊆ A and Y ⊆ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.naturalnumber","kind":"concept","label":"Natural number","sources":[{"id":"planetmath.naturalnumber","title":"PlanetMath entry naturalnumber","url":"https://planetmath.org/naturalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10, 74D99) states: Given the Zermelo-Fraenkel axioms of set theory , one can prove that there exists an inductive set X such that ∅ ∈ X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderedpair","kind":"concept","label":"Ordered pair","sources":[{"id":"planetmath.orderedpair","title":"PlanetMath entry orderedpair","url":"https://planetmath.org/orderedpair"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 70A05, 70G99) states: For any sets a and b , the ordered pair ( a , b ) is the set { { a } , { a , b } } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.restrictionofafunction","kind":"concept","label":"Restriction of a function","sources":[{"id":"planetmath.restrictionofafunction","title":"PlanetMath entry restrictionofafunction","url":"https://planetmath.org/restrictionofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let f : X → Y be a function from a set X to a set Y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.satisfactionrelation","kind":"concept","label":"Satisfaction relation","sources":[{"id":"planetmath.satisfactionrelation","title":"PlanetMath entry satisfactionrelation","url":"https://planetmath.org/satisfactionrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Alfred Tarski was the first mathematician to give a formal definition of what it means for a formula to be “true” in a structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.structurehomomorphism","kind":"concept","label":"Structure homomorphism","sources":[{"id":"planetmath.structurehomomorphism","title":"PlanetMath entry structurehomomorphism","url":"https://planetmath.org/structurehomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 be two structures for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subfunction","kind":"concept","label":"Subfunction","sources":[{"id":"planetmath.subfunction","title":"PlanetMath entry subfunction","url":"https://planetmath.org/subfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E20) states: Definition . Let f : A → B and g : C → D be partial functions .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substructure","kind":"concept","label":"Substructure","sources":[{"id":"planetmath.substructure","title":"PlanetMath entry substructure","url":"https://planetmath.org/substructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Let Σ be a fixed signature , and 𝔄 and 𝔅 structures for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.algebraicsystem","kind":"concept","label":"Algebraic system","sources":[{"id":"planetmath.algebraicsystem","title":"PlanetMath entry algebraicsystem","url":"https://planetmath.org/algebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A05, 03E99, 08A62) states: An algebraic system , loosely speaking, is a set, together with some operations on the set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.conceptlattice","kind":"concept","label":"Concept lattice","sources":[{"id":"planetmath.conceptlattice","title":"PlanetMath entry conceptlattice","url":"https://planetmath.org/conceptlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q55, 68P99, 08A70, 06B23, 03B70, 06A15) states: Let G and M be sets whose elements we call objects and attributes respectively.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.elementaryembedding","kind":"concept","label":"Elementary embedding","sources":[{"id":"planetmath.elementaryembedding","title":"PlanetMath entry elementaryembedding","url":"https://planetmath.org/elementaryembedding"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99) states: Let τ be a signature and 𝒜 and ℬ be two structures for τ such that f : 𝒜 → ℬ is an embedding .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.formalgrammar","kind":"concept","label":"Formal grammar","sources":[{"id":"planetmath.formalgrammar","title":"PlanetMath entry formalgrammar","url":"https://planetmath.org/formalgrammar"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 91F20, 68Q42, 68Q45, 03D05) states: Introduction A grammar , loosely speaking, is a set of rules that can be applied to words to generate sentences in a language .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fromhilbertstenthproblemtogodelstrichotomy","kind":"concept","label":"From Hilbert’s tenth problem to Gödel’s trichotomy","sources":[{"id":"planetmath.fromhilbertstenthproblemtogodelstrichotomy","title":"PlanetMath entry fromhilbertstenthproblemtogodelstrichotomy","url":"https://planetmath.org/fromhilbertstenthproblemtogodelstrichotomy"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: From Hilbert’s tenth problem to Gödel’s trichotomy Contents: 1 Hilbert on the pursuit of knowledge 2 The two sources of mathematical knowledge 3 Hilbert’s epistemological optimism 4 Stricto sensu and conditional mathematics 5 The cumulative hierarchy 6 Diophantine equivalent of number theoretical statements 7 The incompleteness and consistency propositions 8 Sketch of a Gedankenexperiment 9 Gödel’s trichotomy 1 Hilbert on the pursuit of knowledge In the Summer of 1900 the Second International Congress of Mathematicians took place in Paris and Hilbert’s paper to the Congress has the form of a statement of the strategical goals to be pursued by the discipline.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.imaginaries","kind":"concept","label":"Imaginaries","sources":[{"id":"planetmath.imaginaries","title":"PlanetMath entry imaginaries","url":"https://planetmath.org/imaginaries"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C95, 03C68) states: Given an algebraic structure S to investigate, mathematicians consider substructures , restrictions of the structure , quotient structures and the like.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ominimality","kind":"concept","label":"O-minimality","sources":[{"id":"planetmath.ominimality","title":"PlanetMath entry ominimality","url":"https://planetmath.org/ominimality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C64, 14P10) states: Let M be an ordered structure . An interval in M is any subset of M that can be expressed in one of the following forms: • { x : a < x < b } for some a , b from M • { x : x > a } for some a from M • { x : x < a } for some a from M Then we define M to be o-minimal iff every definable subset of M is a finite union of intervals and points.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantifierfree","kind":"concept","label":"Quantifier free","sources":[{"id":"planetmath.quantifierfree","title":"PlanetMath entry quantifierfree","url":"https://planetmath.org/quantifierfree"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C10, 03C07, 03B10) states: Let L be a first order language . A formula ψ is quantifier free iff it contains no quantifiers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.signatureofapermutation","kind":"concept","label":"Signature of a permutation","sources":[{"id":"planetmath.signatureofapermutation","title":"PlanetMath entry signatureofapermutation","url":"https://planetmath.org/signatureofapermutation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Let X be a finite set , and let G be the group of permutations of X (see permutation group ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiom","kind":"concept","label":"Axiom","sources":[{"id":"planetmath.axiom","title":"PlanetMath entry axiom","url":"https://planetmath.org/axiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99, 03A05) states: In a nutshell, the logico-deductive method is a system of inference where conclusions (new knowledge) follow from premises (old knowledge) through the application of sound arguments ( syllogisms , rules of inference ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofinfinity","kind":"concept","label":"Axiom of infinity","sources":[{"id":"planetmath.axiomofinfinity","title":"PlanetMath entry axiomofinfinity","url":"https://planetmath.org/axiomofinfinity"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: There exists an infinite set . The Axiom of Infinity is an axiom of Zermelo-Fraenkel set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.classesofordinalsandenumeratingfunctions","kind":"concept","label":"Classes of ordinals and enumerating functions","sources":[{"id":"planetmath.classesofordinalsandenumeratingfunctions","title":"PlanetMath entry classesofordinalsandenumeratingfunctions","url":"https://planetmath.org/classesofordinalsandenumeratingfunctions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F15, 03E10) states: A class of ordinals is just a subclass of the class ( http://planetmath.org/Class ) 𝐎𝐧 of all ordinals.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.continuumhypothesis","kind":"concept","label":"Continuum hypothesis","sources":[{"id":"planetmath.continuumhypothesis","title":"PlanetMath entry continuumhypothesis","url":"https://planetmath.org/continuumhypothesis"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E50) states: The continuum hypothesis that there is no cardinal number κ such that ℵ 0 < κ < 2 ℵ 0 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.emptyset","kind":"concept","label":"Empty set","sources":[{"id":"planetmath.emptyset","title":"PlanetMath entry emptyset","url":"https://planetmath.org/emptyset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 65H05, 65H10) states: An empty set is a set ∅ that contains no elements .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.generalizedcartesianproduct","kind":"concept","label":"Generalized Cartesian product","sources":[{"id":"planetmath.generalizedcartesianproduct","title":"PlanetMath entry generalizedcartesianproduct","url":"https://planetmath.org/generalizedcartesianproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Given any family of sets { A j } j ∈ J indexed by an index set J , the generalized Cartesian product ∏ j ∈ J A j is the set of all functions f : J → ⋃ j ∈ J A j such that f ⁢ ( j ) ∈ A j for all j ∈ J .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.hausdorffsmaximumprinciple","kind":"theory","label":"Hausdorff’s maximum principle","sources":[{"id":"planetmath.hausdorffsmaximumprinciple","title":"PlanetMath entry hausdorffsmaximumprinciple","url":"https://planetmath.org/hausdorffsmaximumprinciple"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25) states: Theorem Let X be a partially ordered set . Then there exists a maximal totally ordered subset of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hilbertsystem","kind":"concept","label":"Hilbert system","sources":[{"id":"planetmath.hilbertsystem","title":"PlanetMath entry hilbertsystem","url":"https://planetmath.org/hilbertsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: A Hilbert system is a style (formulation) of deductive system that emphasizes the role played by the axioms in the system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.injectivefunction","kind":"concept","label":"Injective function","sources":[{"id":"planetmath.injectivefunction","title":"PlanetMath entry injectivefunction","url":"https://planetmath.org/injectivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 03E99) states: We say that a function f : A → B is injective or one-to-one if f ⁢ ( x ) = f ⁢ ( y ) implies x = y , or equivalently, whenever x ≠ y , then f ⁢ ( x ) ≠ f ⁢ ( y ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.surjective","kind":"concept","label":"Surjective","sources":[{"id":"planetmath.surjective","title":"PlanetMath entry surjective","url":"https://planetmath.org/surjective"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: A function f : X → Y is called surjective or onto if, for every y ∈ Y , there is an x ∈ X such that f ⁢ ( x ) = y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.uncountable","kind":"concept","label":"Uncountable","sources":[{"id":"planetmath.uncountable","title":"PlanetMath entry uncountable","url":"https://planetmath.org/uncountable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: Definition A set is uncountable if it is not countable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderingrelation","kind":"concept","label":"Ordering relation","sources":[{"id":"planetmath.orderingrelation","title":"PlanetMath entry orderingrelation","url":"https://planetmath.org/orderingrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 81-00, 18-00, 17B37, 18D10, 18D35, 16W30) states: Let S be a set. An ordering relation is a relation ≤ on S such that, for every a , b , c ∈ S : • Either a ≤ b , or b ≤ a , • If a ≤ b and b ≤ c , then a ≤ c , • If a ≤ b and b ≤ a , then a = b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ordinalarithmetic","kind":"concept","label":"Ordinal arithmetic","sources":[{"id":"planetmath.ordinalarithmetic","title":"PlanetMath entry ordinalarithmetic","url":"https://planetmath.org/ordinalarithmetic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: Ordinal arithmetic is the extension of normal arithmetic to the transfinite ordinal numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cardinality","kind":"concept","label":"Cardinality","sources":[{"id":"planetmath.cardinality","title":"PlanetMath entry cardinality","url":"https://planetmath.org/cardinality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: Cardinality Cardinality is a notion of the size of a set which does not rely on numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.automaton","kind":"concept","label":"Automaton","sources":[{"id":"planetmath.automaton","title":"PlanetMath entry automaton","url":"https://planetmath.org/automaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: An automaton is a semiautomaton with two types of special states: starting states, and final states.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.combinatorylogic","kind":"concept","label":"Combinatory logic","sources":[{"id":"planetmath.combinatorylogic","title":"PlanetMath entry combinatorylogic","url":"https://planetmath.org/combinatorylogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40) states: Combinatory logic was invented by Moses Schönfinkel in the early 1920s, and was mostly developed by Haskell Curry.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursivelyenumerable","kind":"concept","label":"Recursively enumerable","sources":[{"id":"planetmath.recursivelyenumerable","title":"PlanetMath entry recursivelyenumerable","url":"https://planetmath.org/recursivelyenumerable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D25) states: For a language L , TFAE: • There exists a Turing machine f such that ∀ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.alternativecharacterizationsofrecursivefunctions","kind":"concept","label":"Alternative characterizations of recursive functions","sources":[{"id":"planetmath.alternativecharacterizationsofrecursivefunctions","title":"PlanetMath entry alternativecharacterizationsofrecursivefunctions","url":"https://planetmath.org/alternativecharacterizationsofrecursivefunctions"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03D20) states: The class of recursive functions may be characterized by considerably weaker conditions than those given in the entry “recursive function ( http://planetmath.org/RecursiveFunction )” of this encyclopaedia.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.primitiverecursivefunction","kind":"concept","label":"Primitive recursive function","sources":[{"id":"planetmath.primitiverecursivefunction","title":"PlanetMath entry primitiverecursivefunction","url":"https://planetmath.org/primitiverecursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: To define what a primitive recursive function is, the following notations are used: ℱ = ⋃ { F k ∣ k ∈ ℕ } , where for each k ∈ ℕ ⁢ , ⁢ F k = { f ∣ f : ℕ k → ℕ } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.turingcomputable","kind":"concept","label":"Turing computable","sources":[{"id":"planetmath.turingcomputable","title":"PlanetMath entry turingcomputable","url":"https://planetmath.org/turingcomputable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q05) states: A function is Turing computable if the function’s value can be computed with a Turing machine .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.beyondformalismgodelsincompleteness","kind":"concept","label":"Beyond formalism: Gödel’s incompleteness","sources":[{"id":"planetmath.beyondformalismgodelsincompleteness","title":"PlanetMath entry beyondformalismgodelsincompleteness","url":"https://planetmath.org/beyondformalismgodelsincompleteness"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B10, 03A05, 03-01) states: Contents: 1 Overview 2 Arithmetic 3 From the number sequence to formal arithmetic 4 The formal theory Z 5 A model for Z 6 Gödel numbers 7 Expressing relations and representing functions in Z 8 Omega-consistency and metamathematical predicates 9 How to build Gödel’s undecidable statement 10 Gödel’s first theorem 11 The interpretation of the undecidable formula 12 Gödel’s second theorem 13 The interpretation of the second theorem 14 The concept of truth A Q & A 1 Overview In the literature on the foundations of mathematics the term ” formalism ” occurs with three different configurations .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contradiction","kind":"concept","label":"Contradiction","sources":[{"id":"planetmath.contradiction","title":"PlanetMath entry contradiction","url":"https://planetmath.org/contradiction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F07, 03B05) states: A contradiction occurs when the statements p and ¬ ⁢ p are shown to be true simultaneously.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contradictorystatement","kind":"concept","label":"Contradictory statement","sources":[{"id":"planetmath.contradictorystatement","title":"PlanetMath entry contradictorystatement","url":"https://planetmath.org/contradictorystatement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: A contradictory statement is a statement (or form) which is false due to its logical form rather than because of the meaning of the terms employed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.necessaryandsufficient","kind":"concept","label":"Necessary and sufficient","sources":[{"id":"planetmath.necessaryandsufficient","title":"PlanetMath entry necessaryandsufficient","url":"https://planetmath.org/necessaryandsufficient"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05, 03F07) states: The statement “ p is necessary for q ” “ q implies ( http://planetmath.org/ Implication ) p ”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.russellstheoryoftypes","kind":"concept","label":"Russell’s theory of types","sources":[{"id":"planetmath.russellstheoryoftypes","title":"PlanetMath entry russellstheoryoftypes","url":"https://planetmath.org/russellstheoryoftypes"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: After the discovery of the paradoxes of set theory (notably Russell’s paradox ), it become apparent that naive set theory must be replaced by something in which the paradoxes can’t arise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomsystemforfirstorderlogic","kind":"concept","label":"Axiom system for first order logic","sources":[{"id":"planetmath.axiomsystemforfirstorderlogic","title":"PlanetMath entry axiomsystemforfirstorderlogic","url":"https://planetmath.org/axiomsystemforfirstorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: Let FO ( Σ ) be a first order language over signature Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomsystemforpropositionallogic","kind":"concept","label":"Axiom system for propositional logic","sources":[{"id":"planetmath.axiomsystemforpropositionallogic","title":"PlanetMath entry axiomsystemforpropositionallogic","url":"https://planetmath.org/axiomsystemforpropositionallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: The language of (classical) propositional logic PL c consists of a set of propositional letters or variables , the symbol ⟂ (for falsity), together with two symbols for logical connectives ¬ and → .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.deduction","kind":"concept","label":"Deduction","sources":[{"id":"planetmath.deduction","title":"PlanetMath entry deduction","url":"https://planetmath.org/deduction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03, 03B99, 03B22) states: Deductions are formalizations of proofs. Informally, they can be viewed as arriving at a conclusion from a set of assumptions, via applications of some prescribed rules in a finite number of steps.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.formalsystem","kind":"concept","label":"Formal system","sources":[{"id":"planetmath.formalsystem","title":"PlanetMath entry formalsystem","url":"https://planetmath.org/formalsystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B99) states: In mathematical logic, a formal system is a “set-up” to study the syntactic structures of statements that we see in everyday mathematics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inferencerule","kind":"concept","label":"Inference rule","sources":[{"id":"planetmath.inferencerule","title":"PlanetMath entry inferencerule","url":"https://planetmath.org/inferencerule"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B35, 03B22, 03B05) states: In logic, an inference rule is a rule whereby one may correctly draw a conclusion from one or more premises .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicalaxiom","kind":"concept","label":"Logical axiom","sources":[{"id":"planetmath.logicalaxiom","title":"PlanetMath entry logicalaxiom","url":"https://planetmath.org/logicalaxiom"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B22, 03B05) states: In a logical system , a logical axiom (sometimes called an axiom for short) is a logically valid (well-formed) formula used in a deductive system (particularly an axiom system ) to deduce other logically valid formulas.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicallyequivalent","kind":"concept","label":"Logically equivalent","sources":[{"id":"planetmath.logicallyequivalent","title":"PlanetMath entry logicallyequivalent","url":"https://planetmath.org/logicallyequivalent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Two formulas A and B are said to be logically equivalent (typically shortened to equivalent ) when A is true if and only if B is true (that is, A implies B and B implies A ): ⊧ A ↔ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modusponens","kind":"concept","label":"Modus ponens","sources":[{"id":"planetmath.modusponens","title":"PlanetMath entry modusponens","url":"https://planetmath.org/modusponens"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B22, 03B05, 03B35) states: Modus ponens is a rule of inference that is commonly found in many logics where the binary logical connective → (sometimes written ⇒ or ⊃ ) called logical implication are defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.normalmodallogic","kind":"concept","label":"Normal modal logic","sources":[{"id":"planetmath.normalmodallogic","title":"PlanetMath entry normalmodallogic","url":"https://planetmath.org/normalmodallogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B45) states: The study of modal logic is based on the concept of a logic , which is a set Λ of wff’s satisfying the following: • contains all tautologies , and • is closed under modus ponens .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.powerset","kind":"concept","label":"Power set","sources":[{"id":"planetmath.powerset","title":"PlanetMath entry powerset","url":"https://planetmath.org/powerset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 03E10, 37-01) states: Definition If X is a set, then the power set of X , denoted by 𝒫 ⁢ ( X ) , is the set whose elements are the subsets of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quantumlogic","kind":"concept","label":"Quantum logic","sources":[{"id":"planetmath.quantumlogic","title":"PlanetMath entry quantumlogic","url":"https://planetmath.org/quantumlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G12) states: Introduction In classical physics, results regarding experiments performed on physical propositions obey classical propositional logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.analyticsandformallogicsinmetamathematics","kind":"concept","label":"Analytics and formal logics in meta-mathematics","sources":[{"id":"planetmath.analyticsandformallogicsinmetamathematics","title":"PlanetMath entry analyticsandformallogicsinmetamathematics","url":"https://planetmath.org/analyticsandformallogicsinmetamathematics"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 53B21, 03G30, 03G20, 03B22, 01A60, 18-00, 03G30, 46M15, 03B22, 03B50, 03B15) states: This is a topic on meta-theories , metalogic and metamathematics founded in formal logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.anoutlineofhilbertsprogramme","kind":"concept","label":"An outline of Hilbert’s programme","sources":[{"id":"planetmath.anoutlineofhilbertsprogramme","title":"PlanetMath entry anoutlineofhilbertsprogramme","url":"https://planetmath.org/anoutlineofhilbertsprogramme"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: Contents: 1 Initial definitions. Formalism 2 The two senses of the term ”axiomatic” 3 Meaning is in the model 4 Finite and infinite models 5 Hilbert’s Ansatz 6 Finitist inference 7 The rules of induction and recursion 8 From meaning to logic 9 Negation and disjunction 10 The consistency problem 11 Metamathematics 12 Beyond Incompleteness 1 Initial definitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.chuspace","kind":"concept","label":"Chu space","sources":[{"id":"planetmath.chuspace","title":"PlanetMath entry chuspace","url":"https://planetmath.org/chuspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G99) states: A Chu space over a set Σ is a triple ( 𝒜 , r , 𝒳 ) with r : 𝒜 × 𝒳 → Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.elementaryrecursivefunction","kind":"concept","label":"Elementary recursive function","sources":[{"id":"planetmath.elementaryrecursivefunction","title":"PlanetMath entry elementaryrecursivefunction","url":"https://planetmath.org/elementaryrecursivefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: Informally, elementary recursive functions are functions that can be obtained from functions encountered in elementary schools: addition , multiplication , subtraction , and division , using basic operations such as substitutions and finite summation and product .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.freeandboundvariables","kind":"concept","label":"Free and bound variables","sources":[{"id":"planetmath.freeandboundvariables","title":"PlanetMath entry freeandboundvariables","url":"https://planetmath.org/freeandboundvariables"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In the entry first-order language ( http://planetmath.org/TermsAndFormulas ), I have mentioned the use of variables without mentioning what variables really are.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","kind":"concept","label":"Interpretation of intuitionistic logic by means of functionals","sources":[{"id":"planetmath.interpretationofintuitionisticlogicbymeansoffunctionals","title":"PlanetMath entry interpretationofintuitionisticlogicbymeansoffunctionals","url":"https://planetmath.org/interpretationofintuitionisticlogicbymeansoffunctionals"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05, 03B20) states: Abstract The entry reports on the analysis of the concept of constructivity and in particular Gödel’s own stricto sensu constructivity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inversefunction","kind":"concept","label":"Inverse function","sources":[{"id":"planetmath.inversefunction","title":"PlanetMath entry inversefunction","url":"https://planetmath.org/inversefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 03E20) states: Definition Suppose f : X → Y is a function between sets X and Y , and suppose f - 1 : Y → X is a mapping that satisfies f - 1 ∘ f = id X , f ∘ f - 1 = id Y , where id A denotes the identity function on the set A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.logicism","kind":"concept","label":"Logicism","sources":[{"id":"planetmath.logicism","title":"PlanetMath entry logicism","url":"https://planetmath.org/logicism"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03A05, 03-01) states: In the literature on the foundations of mathematics logicism aims at proving that the propositions of pure mathematics can be derived from the propositions of logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.multivaluedfunction","kind":"concept","label":"Multivalued function","sources":[{"id":"planetmath.multivaluedfunction","title":"PlanetMath entry multivaluedfunction","url":"https://planetmath.org/multivaluedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let us recall that a function f from a set A to a set B is an assignment that takes each element of A to a unique element of B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.naturaldeduction","kind":"concept","label":"Natural deduction","sources":[{"id":"planetmath.naturaldeduction","title":"PlanetMath entry naturaldeduction","url":"https://planetmath.org/naturaldeduction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03) states: Natural deduction refers to related proof systems for several different kinds of logic, intended to be similar to the way people actually reason.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.operationsonrelations","kind":"concept","label":"Operations on relations","sources":[{"id":"planetmath.operationsonrelations","title":"PlanetMath entry operationsonrelations","url":"https://planetmath.org/operationsonrelations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A02, 03E20) states: Recall that an n -ary relation ( n > 0 ) is a subset of a product of some n sets.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.principleoffiniteinduction","kind":"theory","label":"Principle of finite induction","sources":[{"id":"planetmath.principleoffiniteinduction","title":"PlanetMath entry principleoffiniteinduction","url":"https://planetmath.org/principleoffiniteinduction"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25, 00-02) states: The principle of finite induction , also known as mathematical induction , is commonly formulated in two ways.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reducedautomaton","kind":"concept","label":"Reduced automaton","sources":[{"id":"planetmath.reducedautomaton","title":"PlanetMath entry reducedautomaton","url":"https://planetmath.org/reducedautomaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: Besides eliminating useless states that do not contribute to word acceptance, what else can we do to “clean up” an automaton ? In other words, we would like to reduce the number of states in an automaton to as small as possible without affecting its power of accepting words.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reductioadabsurdum","kind":"concept","label":"Reductio ad absurdum","sources":[{"id":"planetmath.reductioadabsurdum","title":"PlanetMath entry reductioadabsurdum","url":"https://planetmath.org/reductioadabsurdum"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-01) states: Reductio ad Absurdum is a process of inference by means of which one can derive a proposition ¬ ⁢ X from the fact the the assumption of X leads to a contradiction .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semithuesystem","kind":"concept","label":"Semi-Thue system","sources":[{"id":"planetmath.semithuesystem","title":"PlanetMath entry semithuesystem","url":"https://planetmath.org/semithuesystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q42, 03D40, 20M35, 03D03) states: A semi-Thue system 𝔖 is a pair ( Σ , P ) where Σ is an alphabet and P is a non-empty finite binary relation on Σ * , the Kleene star of Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.sequent","kind":"concept","label":"Sequent","sources":[{"id":"planetmath.sequent","title":"PlanetMath entry sequent","url":"https://planetmath.org/sequent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F03) states: A sequent represents a formal step in a proof. Typically it consists of two lists of formulas , one representing the premises and one the conclusions .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.setdifference","kind":"concept","label":"Set difference","sources":[{"id":"planetmath.setdifference","title":"PlanetMath entry setdifference","url":"https://planetmath.org/setdifference"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let A and B be sets. The set difference (or simply difference ) between A and B (in that order) is the set of all elements of A that are not in B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.signrelation","kind":"concept","label":"Sign relation","sources":[{"id":"planetmath.signrelation","title":"PlanetMath entry signrelation","url":"https://planetmath.org/signrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: A sign relation is a special type of triadic relation that arises in the use of signs to connote meanings and denote objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.theinclusionofclassicalintointuitionisticlogic","kind":"concept","label":"The inclusion of classical into intuitionistic logic","sources":[{"id":"planetmath.theinclusionofclassicalintointuitionisticlogic","title":"PlanetMath entry theinclusionofclassicalintointuitionisticlogic","url":"https://planetmath.org/theinclusionofclassicalintointuitionisticlogic"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03B20, 03A05, 03-01) states: Abstract The entry is a report of Gödel’s 1933 first proof of the consistency of classical arithmetic by means of an interpretation of the basic concepts of intuitionistic logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.churchinteger","kind":"concept","label":"Church integer","sources":[{"id":"planetmath.churchinteger","title":"PlanetMath entry churchinteger","url":"https://planetmath.org/churchinteger"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B40, 68N18) states: A Church integer is a representation of integers as functions , invented by Alonzo Church.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.comprehensionaxiom","kind":"concept","label":"Comprehension axiom","sources":[{"id":"planetmath.comprehensionaxiom","title":"PlanetMath entry comprehensionaxiom","url":"https://planetmath.org/comprehensionaxiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: The axiom of comprehension (CA) states that every formula defines a set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.paradox","kind":"concept","label":"Paradox","sources":[{"id":"planetmath.paradox","title":"PlanetMath entry paradox","url":"https://planetmath.org/paradox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03A05, 03B99) states: A paradox is an assertion that is apparently self-contradictory, though based on a valid deduction from acceptable premises .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polishnotation","kind":"concept","label":"Polish notation","sources":[{"id":"planetmath.polishnotation","title":"PlanetMath entry polishnotation","url":"https://planetmath.org/polishnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place each operator to the left of its operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reversepolishnotation","kind":"concept","label":"Reverse Polish notation","sources":[{"id":"planetmath.reversepolishnotation","title":"PlanetMath entry reversepolishnotation","url":"https://planetmath.org/reversepolishnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N17, 03B70) states: Whereas operators are traditionally placed between operands, with parentheses used to override operator precedence , it is possible to place operators to the right of operands, thus eliminating ambiguity and the need for parentheses, and even the need for rules of operator precedence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cartesianproduct","kind":"concept","label":"Cartesian product","sources":[{"id":"planetmath.cartesianproduct","title":"PlanetMath entry cartesianproduct","url":"https://planetmath.org/cartesianproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 81P10, 81P05) states: For any sets A and B , the Cartesian product A × B is the set consisting of all ordered pairs ( a , b ) where a ∈ A and b ∈ B .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.indexingset","kind":"concept","label":"Indexing set","sources":[{"id":"planetmath.indexingset","title":"PlanetMath entry indexingset","url":"https://planetmath.org/indexingset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Let Λ and S be sets such that there exists a surjection f : Λ → S .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.indexset","kind":"concept","label":"Index set","sources":[{"id":"planetmath.indexset","title":"PlanetMath entry indexset","url":"https://planetmath.org/indexset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D25) states: In computability theory, a set A ⊆ ω is called an index set if for all x , y , x ∈ A , φ x = φ y ⟹ y ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pairwisedisjoint","kind":"concept","label":"Pairwise disjoint","sources":[{"id":"planetmath.pairwisedisjoint","title":"PlanetMath entry pairwisedisjoint","url":"https://planetmath.org/pairwisedisjoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Definition Suppose { E α ∣ α ∈ I } is an arbitrary collection of sets.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.bijection","kind":"concept","label":"Bijection","sources":[{"id":"planetmath.bijection","title":"PlanetMath entry bijection","url":"https://planetmath.org/bijection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 83-00, 81-00, 82-00) states: Let X and Y be sets. A function f : X → Y that is one-to-one and onto is called a bijection or bijective function from X to Y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orderedtuplet","kind":"concept","label":"Ordered tuplet","sources":[{"id":"planetmath.orderedtuplet","title":"PlanetMath entry orderedtuplet","url":"https://planetmath.org/orderedtuplet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: The concept of ordered n -tuplet is the generalization of ordered pair to n items.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universalrelation","kind":"concept","label":"Universal relation","sources":[{"id":"planetmath.universalrelation","title":"PlanetMath entry universalrelation","url":"https://planetmath.org/universalrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10) states: If Φ is a class of n -ary relations with x → as the only free variables , an n + 1 -ary formula ψ is universal for Φ if for any ϕ ∈ Φ there is some e such that ψ ⁢ ( e , x → ) ↔ ϕ ⁢ ( x → ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universalstructure","kind":"concept","label":"Universal structure","sources":[{"id":"planetmath.universalstructure","title":"PlanetMath entry universalstructure","url":"https://planetmath.org/universalstructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C50, 03C52) states: Let L be a first order language , and let R be an elementary class of L - structures .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ampheck","kind":"concept","label":"Ampheck","sources":[{"id":"planetmath.ampheck","title":"PlanetMath entry ampheck","url":"https://planetmath.org/ampheck"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05, 03-03, 01A55) states: Ampheck , from the Greek α ⁢ μ ⁢ ϕ ⁢ η ⁢ κ ⁢ η ⁢ ς , double-edged , is a term coined by Charles Sanders Peirce for either one of the pair of logically dual operators , variously referred to as Peirce arrows , Sheffer strokes , or logical NAND and logical NNOR.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.functionalcompleteness","kind":"concept","label":"Functional completeness","sources":[{"id":"planetmath.functionalcompleteness","title":"PlanetMath entry functionalcompleteness","url":"https://planetmath.org/functionalcompleteness"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Recall that in classical propositional logic , well-formed formulas (wffs) can be built up (recursively) from propositional variables via logical connectives .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.generalizedquantifier","kind":"concept","label":"Generalized quantifier","sources":[{"id":"planetmath.generalizedquantifier","title":"PlanetMath entry generalizedquantifier","url":"https://planetmath.org/generalizedquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C80, 03B15, 03B10) states: Generalized quantifiers are an abstract way of defining quantifiers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.secondorderlogic","kind":"concept","label":"Second order logic","sources":[{"id":"planetmath.secondorderlogic","title":"PlanetMath entry secondorderlogic","url":"https://planetmath.org/secondorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: Second order logic refers to logics with two (or three) types where one type consists of the objects of interest and the second is either sets of those objects or functions on those objects (or both, in the three type case).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.gametheoreticalquantifier","kind":"concept","label":"Game-theoretical quantifier","sources":[{"id":"planetmath.gametheoreticalquantifier","title":"PlanetMath entry gametheoreticalquantifier","url":"https://planetmath.org/gametheoreticalquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: A Henkin or branching quantifier is a multi-variable quantifier in which the selection of variables depends only on some, but not all, of the other quantified variables.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.universeofdiscourse","kind":"concept","label":"Universe of discourse","sources":[{"id":"planetmath.universeofdiscourse","title":"PlanetMath entry universeofdiscourse","url":"https://planetmath.org/universeofdiscourse"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B48, 03B05, 03A05, 03G05) states: \\PMlinkescapephrase field \\PMlinkescapephrase Field \\PMlinkescapephrase limit \\PMlinkescapephrase Limit \\PMlinkescapephrase object \\PMlinkescapephrase Object \\PMlinkescapephrase objects \\PMlinkescapephrase Objects Boole (1854) defines universe of discourse in the following manner: In every discourse, whether of the mind conversing with its own thoughts, or of the individual in his intercourse with others, there is an assumed or expressed limit within which the subjects of its operation are confined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.characteristicfunction","kind":"concept","label":"Characteristic function","sources":[{"id":"planetmath.characteristicfunction","title":"PlanetMath entry characteristicfunction","url":"https://planetmath.org/characteristicfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 26-00, 26A09, 28-00) states: Definition Suppose A is a subset of a set X . Then the function χ A ⁢ ( x ) = { 1 , when ⁢ x ∈ A , 0 , when ⁢ x ∈ X ∖ A is the characteristic function for A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.standardenumeration","kind":"concept","label":"Standard enumeration","sources":[{"id":"planetmath.standardenumeration","title":"PlanetMath entry standardenumeration","url":"https://planetmath.org/standardenumeration"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45, 03B65) states: The standard enumeration of { 0 , 1 } * is the sequence of strings s 0 = λ , s 1 = 0 , s 2 = 1 , s 3 = 00 , s 4 = 01 , ⋯ in lexicographic order .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.triadicrelation","kind":"concept","label":"Triadic relation","sources":[{"id":"planetmath.triadicrelation","title":"PlanetMath entry triadicrelation","url":"https://planetmath.org/triadicrelation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 94A15, 94A05, 03G15, 03E20, 03B42, 03B10) states: In logic, mathematics, and semiotics, a triadic relation is an important special case of a polyadic or finitary relation, one in which the number of places in the relation is three.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.randomvariable","kind":"concept","label":"Random variable","sources":[{"id":"planetmath.randomvariable","title":"PlanetMath entry randomvariable","url":"https://planetmath.org/randomvariable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 62-00, 60-00, 11R32, 03-01, 20B25) states: If ( Ω , 𝒜 , P ) is a probability space , then a random variable on Ω is a measurable function X : ( Ω , 𝒜 ) → S to a measurable space S (frequently taken to be the real numbers with the standard measure ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lengthofastring","kind":"concept","label":"Length of a string","sources":[{"id":"planetmath.lengthofastring","title":"PlanetMath entry lengthofastring","url":"https://planetmath.org/lengthofastring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: Suppose we have a string w on alphabet Σ . We can then represent the string as w = x 1 ⁢ x 2 ⁢ x 3 ⁢ ⋯ ⁢ x n - 1 ⁢ x n , where for all x i ( 1 ≤ i ≤ n ), x i ∈ Σ (this means that each x i must be a “letter” from the alphabet).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.countable","kind":"concept","label":"Countable","sources":[{"id":"planetmath.countable","title":"PlanetMath entry countable","url":"https://planetmath.org/countable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A set S is countable if there exists a bijection between S and some subset of ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.countablyinfinite","kind":"concept","label":"Countably infinite","sources":[{"id":"planetmath.countablyinfinite","title":"PlanetMath entry countablyinfinite","url":"https://planetmath.org/countablyinfinite"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: A set S is countably infinite if there is a bijection between S and ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pointedset","kind":"concept","label":"Pointed set","sources":[{"id":"planetmath.pointedset","title":"PlanetMath entry pointedset","url":"https://planetmath.org/pointedset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: 0.1 Definition A pointed set is an ordered pair ( A , a ) such that A is a set and a ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.analytichierarchy","kind":"concept","label":"Analytic hierarchy","sources":[{"id":"planetmath.analytichierarchy","title":"PlanetMath entry analytichierarchy","url":"https://planetmath.org/analytichierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: The analytic hierarchy is a hierarchy of either (depending on context ) formulas or relations similar to the arithmetical hierarchy .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleandomain","kind":"concept","label":"Boolean domain","sources":[{"id":"planetmath.booleandomain","title":"PlanetMath entry booleandomain","url":"https://planetmath.org/booleandomain"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68R01, 68Q01, 68P01, 03G05, 03C55, 03B05) states: \\PMlinkescapephrase generic \\PMlinkescapephrase Generic A Boolean domain 𝔹 is a generic 2-element set, say, 𝔹 = { 0 , 1 } , whose elements are interpreted as logical values, typically, 0 = false and 1 = true .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.paradoxofthebinarytree","kind":"concept","label":"Paradox of the binary tree","sources":[{"id":"planetmath.paradoxofthebinarytree","title":"PlanetMath entry paradoxofthebinarytree","url":"https://planetmath.org/paradoxofthebinarytree"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E75, 03E15) states: The complete infinite binary tree is a tree that consists of nodes (namely the numerals 0 and 1) such that every node has two children which are not children of any other node.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.treesettheoretic","kind":"concept","label":"Tree (set theoretic)","sources":[{"id":"planetmath.treesettheoretic","title":"PlanetMath entry treesettheoretic","url":"https://planetmath.org/treesettheoretic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E05) states: In a set , a tree is defined to be a set T and a relation < T ⊆ T × T such that: • < T is a partial ordering of T • For any t ∈ T , { s ∈ T ∣ s < T t } is well-ordered The nodes (elements of the tree) immediately greater than a node are termed its children , the node immediately less is its parent (if it exists), any node less is an ancestor and any node greater is a descendant .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanlattice","kind":"concept","label":"Boolean lattice","sources":[{"id":"planetmath.booleanlattice","title":"PlanetMath entry booleanlattice","url":"https://planetmath.org/booleanlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10, 06E20) states: In this entry, the notions of a Boolean lattice , a Boolean algebra , and a Boolean ring are defined, compared and contrasted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.shefferstroke","kind":"concept","label":"Sheffer stroke","sources":[{"id":"planetmath.shefferstroke","title":"PlanetMath entry shefferstroke","url":"https://planetmath.org/shefferstroke"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: In the late 19th century and early 20th century, Charles Sanders Peirce and H.M.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.symmetricdifference","kind":"concept","label":"Symmetric difference","sources":[{"id":"planetmath.symmetricdifference","title":"PlanetMath entry symmetricdifference","url":"https://planetmath.org/symmetricdifference"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: The symmetric difference between two sets A and B , written A ⁢ △ ⁢ B , is the set of all x such that either x ∈ A or x ∈ B but not both.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.exclusiveor","kind":"concept","label":"Exclusive or","sources":[{"id":"planetmath.exclusiveor","title":"PlanetMath entry exclusiveor","url":"https://planetmath.org/exclusiveor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: The logical operator xor, short for “ exclusive or ”, is a binary operator that is true iff exactly one of its parameters is true, and thus corresponds to the normal use of “or” in English.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.forcing","kind":"concept","label":"Forcing","sources":[{"id":"planetmath.forcing","title":"PlanetMath entry forcing","url":"https://planetmath.org/forcing"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E50, 03E35, 03E40) states: Forcing is the method used by Paul Cohen to prove the independence of the continuum hypothesis (CH).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equivalenceclass","kind":"concept","label":"Equivalence class","sources":[{"id":"planetmath.equivalenceclass","title":"PlanetMath entry equivalenceclass","url":"https://planetmath.org/equivalenceclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 93D05, 03B52, 93C42) states: Let S be a set with an equivalence relation ∼ . An equivalence class of S under ∼ is a subset T ⊂ S such that • If x ∈ T and y ∈ S , then x ∼ y if and only if y ∈ T • If S is nonempty, then T is nonempty For x ∈ S , the equivalence class containing x is often denoted by [ x ] , so that [ x ] := { y ∈ S ∣ x ∼ y } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polyadicalgebrawithequality","kind":"concept","label":"Polyadic algebra with equality","sources":[{"id":"planetmath.polyadicalgebrawithequality","title":"PlanetMath entry polyadicalgebrawithequality","url":"https://planetmath.org/polyadicalgebrawithequality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: Let A = ( B , V , ∃ , S ) be a polyadic algebra . An equality predicate on A is a function E : V × V → B such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.reflexiverelation","kind":"concept","label":"Reflexive relation","sources":[{"id":"planetmath.reflexiverelation","title":"PlanetMath entry reflexiverelation","url":"https://planetmath.org/reflexiverelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is reflexive if and only if a ⁢ ℛ ⁢ a for all a ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.symmetricrelation","kind":"concept","label":"Symmetric relation","sources":[{"id":"planetmath.symmetricrelation","title":"PlanetMath entry symmetricrelation","url":"https://planetmath.org/symmetricrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is symmetric if and only if whenever x ⁢ ℛ ⁢ y for some x , y ∈ A then also y ⁢ ℛ ⁢ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transitiverelation","kind":"concept","label":"Transitive relation","sources":[{"id":"planetmath.transitiverelation","title":"PlanetMath entry transitiverelation","url":"https://planetmath.org/transitiverelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: A relation ℛ on a set A is transitive if and only if ∀ x , y , z ∈ A , ( x ⁢ ℛ ⁢ y ∧ y ⁢ ℛ ⁢ z ) → ( x ⁢ ℛ ⁢ z ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.atomicformula","kind":"concept","label":"Atomic formula","sources":[{"id":"planetmath.atomicformula","title":"PlanetMath entry atomicformula","url":"https://planetmath.org/atomicformula"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C99, 03B10) states: Let Σ be a signature and T ⁢ ( Σ ) the set of terms over Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.disjointunion","kind":"concept","label":"Disjoint union","sources":[{"id":"planetmath.disjointunion","title":"PlanetMath entry disjointunion","url":"https://planetmath.org/disjointunion"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: Disjoint union of two sets Let A and B be sets. Then their disjoint union is the union A ⁢ ∐ B := A ∪ ( B × { ⋆ } ) , where ⋆ is an object chosen so that A and B × { ⋆ } are disjoint .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inclusionmapping","kind":"concept","label":"Inclusion mapping","sources":[{"id":"planetmath.inclusionmapping","title":"PlanetMath entry inclusionmapping","url":"https://planetmath.org/inclusionmapping"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition Let X be a subset of Y . Then the inclusion map from X to Y is the mapping ι : X → Y x ↦ x .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.deductivesystem","kind":"concept","label":"Deductive system","sources":[{"id":"planetmath.deductivesystem","title":"PlanetMath entry deductivesystem","url":"https://planetmath.org/deductivesystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03F03, 03B99, 03B22) states: Introduction A deductive system is a formal (mathematical) setup of reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.simplifiedautomaton","kind":"concept","label":"Simplified automaton","sources":[{"id":"planetmath.simplifiedautomaton","title":"PlanetMath entry simplifiedautomaton","url":"https://planetmath.org/simplifiedautomaton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D05, 68Q45) states: Word acceptance is the primary function of an automaton .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.contrapositive","kind":"concept","label":"Contrapositive","sources":[{"id":"planetmath.contrapositive","title":"PlanetMath entry contrapositive","url":"https://planetmath.org/contrapositive"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Given an implication of the form p ⟹ q (“p implies q”) the contrapositive of this implication is ¬ ⁢ q ⟹ ¬ ⁢ p (“not q implies not p”).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.firstordertheory","kind":"concept","label":"First-order theory","sources":[{"id":"planetmath.firstordertheory","title":"PlanetMath entry firstordertheory","url":"https://planetmath.org/firstordertheory"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: In what follows, references to sentences and sets of sentences are all relative to some fixed first-order language L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hypostaticabstraction","kind":"concept","label":"Hypostatic abstraction","sources":[{"id":"planetmath.hypostaticabstraction","title":"PlanetMath entry hypostaticabstraction","url":"https://planetmath.org/hypostaticabstraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B42, 03B30, 03B22, 03B15, 03A05, 00A30) states: \\PMlinkescapephrase adapted \\PMlinkescapephrase Adapted \\PMlinkescapephrase contain \\PMlinkescapephrase Contain \\PMlinkescapephrase contains \\PMlinkescapephrase Contains \\PMlinkescapephrase occur \\PMlinkescapephrase occurs \\PMlinkescapephrase occur in \\PMlinkescapephrase occur ins \\PMlinkescapephrase occurs in \\PMlinkescapephrase occurs ins \\PMlinkescapephrase trace \\PMlinkescapephrase Trace \\PMlinkescapephrase variety \\PMlinkescapephrase Variety Hypostatic abstraction is a formal operation that takes an element of information, as expressed in a proposition X ⁢ is ⁡ Y , and conceives its information to consist in the relation between that subject and another subject, as expressed in the proposition X ⁢ has ⁡ Y ⁢ - ness .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.substitutability","kind":"concept","label":"Substitutability","sources":[{"id":"planetmath.substitutability","title":"PlanetMath entry substitutability","url":"https://planetmath.org/substitutability"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B10, 03B05) states: In any logical system , the way to obtain (well-formed) formulas from existing ones is by attaching logical connectives to existing ones.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inductiveset","kind":"concept","label":"Inductive set","sources":[{"id":"planetmath.inductiveset","title":"PlanetMath entry inductiveset","url":"https://planetmath.org/inductiveset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 45D05) states: An inductive set is a set X with the property that, for every x ∈ X , the successor x ′ of x is also an element of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.uniquereadabilityofwellformedformulas","kind":"theory","label":"Unique readability of well-formed formulas","sources":[{"id":"planetmath.uniquereadabilityofwellformedformulas","title":"PlanetMath entry uniquereadabilityofwellformedformulas","url":"https://planetmath.org/uniquereadabilityofwellformedformulas"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B05) states: Suppose V is an alphabet . Two words w 1 and w 2 over V are the same if they have the same length and same symbol for every position of the word.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.additive","kind":"concept","label":"Additive","sources":[{"id":"planetmath.additive","title":"PlanetMath entry additive","url":"https://planetmath.org/additive"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let ϕ be some positive-valued set function defined on an algebra of sets 𝒜 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismbetweenpartialalgebras","kind":"concept","label":"Homomorphism between partial algebras","sources":[{"id":"planetmath.homomorphismbetweenpartialalgebras","title":"PlanetMath entry homomorphismbetweenpartialalgebras","url":"https://planetmath.org/homomorphismbetweenpartialalgebras"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition Like subalgebras of partial algebras , there are also three ways to define homomorphisms between partial algebras .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semiautomatonhomomorphism","kind":"concept","label":"Semiautomaton homomorphism","sources":[{"id":"planetmath.semiautomatonhomomorphism","title":"PlanetMath entry semiautomatonhomomorphism","url":"https://planetmath.org/semiautomatonhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45, 20M35, 03D05, 68Q70) states: Just like groups and rings, a semiautomaton can be viewed as an algebraic structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inversestatement","kind":"concept","label":"Inverse statement","sources":[{"id":"planetmath.inversestatement","title":"PlanetMath entry inversestatement","url":"https://planetmath.org/inversestatement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B05) states: Let a statement be of the form of an implication If p , then q i.e.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cofinality","kind":"concept","label":"Cofinality","sources":[{"id":"planetmath.cofinality","title":"PlanetMath entry cofinality","url":"https://planetmath.org/cofinality"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E04) states: Definitions Let ( P , ≤ ) be a poset. A subset A ⊆ P is said to be cofinal in P if for every x ∈ P there is a y ∈ A such that x ≤ y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.computablenumber","kind":"concept","label":"Computable number","sources":[{"id":"planetmath.computablenumber","title":"PlanetMath entry computablenumber","url":"https://planetmath.org/computablenumber"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03D25, 68Q05) states: A real number r is called computable if there exists some terminating algorithm (or Turing machine ) that can approximate it to arbitrary precision.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.endpoint","kind":"concept","label":"Endpoint","sources":[{"id":"planetmath.endpoint","title":"PlanetMath entry endpoint","url":"https://planetmath.org/endpoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51-00, 03-00) states: An endpoint of a line segment L is a point that belongs to the boundary of L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.linesegment","kind":"concept","label":"Line segment","sources":[{"id":"planetmath.linesegment","title":"PlanetMath entry linesegment","url":"https://planetmath.org/linesegment"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 51-00) states: Definition Suppose V is a vector space over ℝ or ℂ , and L is a subset of V .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofcountablechoice","kind":"concept","label":"Axiom of countable choice","sources":[{"id":"planetmath.axiomofcountablechoice","title":"PlanetMath entry axiomofcountablechoice","url":"https://planetmath.org/axiomofcountablechoice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E25) states: The Axiom of Countable Choice (CC) is a weak form of the Axiom of Choice ( http://planetmath.org/AxiomOfChoice ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.rationalnumber","kind":"concept","label":"Rational number","sources":[{"id":"planetmath.rationalnumber","title":"PlanetMath entry rationalnumber","url":"https://planetmath.org/rationalnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B30, 11A99, 03E99) states: The rational numbers ℚ are the fraction field of the ring ℤ of integers .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fixtransformationaction","kind":"concept","label":"Fix (transformation action)","sources":[{"id":"planetmath.fixtransformationaction","title":"PlanetMath entry fixtransformationaction","url":"https://planetmath.org/fixtransformationaction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transformation","kind":"concept","label":"Transformation","sources":[{"id":"planetmath.transformation","title":"PlanetMath entry transformation","url":"https://planetmath.org/transformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Synonym of mapping and function . Often used to refer to mappings where the domain and codomain are the same set, i.e.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.identitymap","kind":"concept","label":"Identity map","sources":[{"id":"planetmath.identitymap","title":"PlanetMath entry identitymap","url":"https://planetmath.org/identitymap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Definition If X is a set, then the identity map in X is the mapping that maps each element in X to itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.peanoarithmetic","kind":"concept","label":"Peano arithmetic","sources":[{"id":"planetmath.peanoarithmetic","title":"PlanetMath entry peanoarithmetic","url":"https://planetmath.org/peanoarithmetic"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03F30) states: Peano’s axioms are a definition of the set of natural numbers, denoted ℕ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.successor","kind":"concept","label":"Successor","sources":[{"id":"planetmath.successor","title":"PlanetMath entry successor","url":"https://planetmath.org/successor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10, 70K75) states: Given a set S , the successor of S is the set S ∪ { S } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.vonneumannordinal","kind":"concept","label":"Von Neumann ordinal","sources":[{"id":"planetmath.vonneumannordinal","title":"PlanetMath entry vonneumannordinal","url":"https://planetmath.org/vonneumannordinal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: The is a method of defining ordinals in set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ruleofproduct","kind":"concept","label":"Rule of product","sources":[{"id":"planetmath.ruleofproduct","title":"PlanetMath entry ruleofproduct","url":"https://planetmath.org/ruleofproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05A05, 03-00) states: If a process A can have altogether m different results and another process B altogether n different results, then the two processes can have altogether m ⁢ n different combined results.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.transposition","kind":"concept","label":"Transposition","sources":[{"id":"planetmath.transposition","title":"PlanetMath entry transposition","url":"https://planetmath.org/transposition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 05A05, 20B99) states: Given a finite set X = { a 1 , a 2 , … , a n } , a transposition is a permutation ( bijective function of X onto itself) f such that there exist indices i , j such that f ⁢ ( a i ) = a j , f ⁢ ( a j ) = a i and f ⁢ ( a k ) = a k for all other indices k .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.directproductofpartialalgebras","kind":"concept","label":"Direct product of partial algebras","sources":[{"id":"planetmath.directproductofpartialalgebras","title":"PlanetMath entry directproductofpartialalgebras","url":"https://planetmath.org/directproductofpartialalgebras"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 08A62, 03E99) states: Let 𝑨 and 𝑩 be two partial algebraic systems of type τ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.club","kind":"concept","label":"Club","sources":[{"id":"planetmath.club","title":"PlanetMath entry club","url":"https://planetmath.org/club"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: If κ is a cardinal then a set C ⊆ κ is closed iff for any S ⊆ C and α < κ , sup ⁡ ( S ∩ α ) = α then α ∈ C .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.preservationandreflection","kind":"concept","label":"Preservation and reflection","sources":[{"id":"planetmath.preservationandreflection","title":"PlanetMath entry preservationandreflection","url":"https://planetmath.org/preservationandreflection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A35) states: In mathematics, the word “preserve” usually means the “preservation of properties”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationalsystem","kind":"concept","label":"Relational system","sources":[{"id":"planetmath.relationalsystem","title":"PlanetMath entry relationalsystem","url":"https://planetmath.org/relationalsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03C07, 08A02) states: A relational system , loosely speaking, is a pair ( A , R ) where A is a set and R is a set of finitary relations defined on A (a finitary relation is just an n -ary relation where n ∈ ℕ ; when n = 1 , it is called a property ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.topicentryonthealgebraicfoundationsofmathematics","kind":"concept","label":"Topic entry on the algebraic foundations of mathematics","sources":[{"id":"planetmath.topicentryonthealgebraicfoundationsofmathematics","title":"PlanetMath entry topicentryonthealgebraicfoundationsofmathematics","url":"https://planetmath.org/topicentryonthealgebraicfoundationsofmathematics"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 08A99, 08A70, 18E05, 18-00, 03-00, 08A05) states: This is a contributed topic on the algebraic foundations of mathematics .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.comparisonoffilters","kind":"concept","label":"Comparison of filters","sources":[{"id":"planetmath.comparisonoffilters","title":"PlanetMath entry comparisonoffilters","url":"https://planetmath.org/comparisonoffilters"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99, 03E99) states: Let 𝔽 1 and 𝔽 2 be two filters on the same set. The following terminology is commonly used to describe the relation of 𝔽 1 to 𝔽 2 : 𝔽 2 is said to be finer than 𝔽 1 if 𝔽 1 ⊆ 𝔽 2 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.partialalgebraicsystem","kind":"concept","label":"Partial algebraic system","sources":[{"id":"planetmath.partialalgebraicsystem","title":"PlanetMath entry partialalgebraicsystem","url":"https://planetmath.org/partialalgebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99, 08A55, 08A62) states: Let λ be a cardinal . A partial function f : A λ → A is called a partial operation on A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.selector","kind":"concept","label":"Selector","sources":[{"id":"planetmath.selector","title":"PlanetMath entry selector","url":"https://planetmath.org/selector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E25) states: Let S be a collection of sets. A selector of S is by definition a set { f ⁢ ( R ) | R ∈ S } where f is a choice function on S (that is f ⁢ ( R ) ∈ R ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.completelattice","kind":"concept","label":"Complete lattice","sources":[{"id":"planetmath.completelattice","title":"PlanetMath entry completelattice","url":"https://planetmath.org/completelattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B23, 03G10) states: Complete lattices A complete lattice is a poset P such that every subset of P has both a supremum and an infimum in P .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.chomskyhierarchy","kind":"concept","label":"Chomsky hierarchy","sources":[{"id":"planetmath.chomskyhierarchy","title":"PlanetMath entry chomskyhierarchy","url":"https://planetmath.org/chomskyhierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q15, 03D55) states: The Chomsky hierarchy or Chomsky-Schützenberger hierarchy is a way of classifying formal grammars into four types, with the lower numbered types being more general.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cumulativehierarchy","kind":"concept","label":"Cumulative hierarchy","sources":[{"id":"planetmath.cumulativehierarchy","title":"PlanetMath entry cumulativehierarchy","url":"https://planetmath.org/cumulativehierarchy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: The cumulative hierarchy of sets is defined by transfinite recursion as follows: we define V 0 = ∅ and for each ordinal α we define V α + 1 = 𝒫 ⁢ ( V α ) and for each limit ordinal δ we define V δ = ⋃ α ∈ δ V α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.equationalclass","kind":"concept","label":"Equational class","sources":[{"id":"planetmath.equationalclass","title":"PlanetMath entry equationalclass","url":"https://planetmath.org/equationalclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08B99, 03C05) states: Let K be a class of algebraic systems of the same type.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.lawoftrichotomy","kind":"concept","label":"Law of trichotomy","sources":[{"id":"planetmath.lawoftrichotomy","title":"PlanetMath entry lawoftrichotomy","url":"https://planetmath.org/lawoftrichotomy"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A05, 03E20) states: The law of trichotomy for a binary relation R on a set S is the property that • for all x , y ∈ S , exactly one of the following holds: x ⁢ R ⁢ y or y ⁢ R ⁢ x or x = y .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pa","kind":"concept","label":"PA","sources":[{"id":"planetmath.pa","title":"PlanetMath entry pa","url":"https://planetmath.org/pa"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F30) states: (PA) is the restriction of Peano’s axioms to a first order theory of .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.predicativism","kind":"concept","label":"Predicativism","sources":[{"id":"planetmath.predicativism","title":"PlanetMath entry predicativism","url":"https://planetmath.org/predicativism"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05) states: Predicativism Contents: 1 Initial definitions 2 The vicious circle principle 3 The scope of the vicious circle principle 4 Russell’s threefold formulation in Principia mathematica 5 Predicative reasoning in the ramified theory of types 6 Towards the predicative concept of set 7 Predicative philosophy of mathematics 1 Initial definitions In the literature on the foundations of mathematics the range of the concept predicativism is formulated in two divergent formulations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.recursiveset","kind":"concept","label":"Recursive set","sources":[{"id":"planetmath.recursiveset","title":"PlanetMath entry recursiveset","url":"https://planetmath.org/recursiveset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B25, 03D20) states: A subset S of the natural numbers ℕ is said to be recursive if its characteristic function χ S ⁢ ( x ) := { 1 if ⁢ x ∈ S 0 if ⁢ x ∈ ℕ - S is recursive ( computable ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.transfiniteinduction","kind":"theory","label":"Transfinite induction","sources":[{"id":"planetmath.transfiniteinduction","title":"PlanetMath entry transfiniteinduction","url":"https://planetmath.org/transfiniteinduction"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03B10) states: Suppose Φ ⁢ ( α ) is a property defined for every ordinal α , the principle of transfinite induction states that in the case where for every α , if the fact that Φ ⁢ ( β ) is true for every β < α implies that Φ ⁢ ( α ) is true, then Φ ⁢ ( α ) is true for every ordinal α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.consequenceoperator","kind":"concept","label":"Consequence operator","sources":[{"id":"planetmath.consequenceoperator","title":"PlanetMath entry consequenceoperator","url":"https://planetmath.org/consequenceoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G25, 03G10, 03B22) states: 1 Definition Let L be a set. A consequence operator on L is a mapping 1 1 Here, “ 𝒫 ” denotes the power set and ℱ denotes the finite power set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.quotientstructure","kind":"concept","label":"Quotient structure","sources":[{"id":"planetmath.quotientstructure","title":"PlanetMath entry quotientstructure","url":"https://planetmath.org/quotientstructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , 𝔄 a structure for Σ , and ∼ a congruence on 𝔄 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.foundationsofmathematicsoverview","kind":"concept","label":"Foundations of mathematics: overview","sources":[{"id":"planetmath.foundationsofmathematicsoverview","title":"PlanetMath entry foundationsofmathematicsoverview","url":"https://planetmath.org/foundationsofmathematicsoverview"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03-01, 03A05) states: The term ’ foundations of mathematics ’ denotes a set of theories which from the late XIX century onwards have tried to characterize the nature of mathematical reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.invariant","kind":"concept","label":"Invariant","sources":[{"id":"planetmath.invariant","title":"PlanetMath entry invariant","url":"https://planetmath.org/invariant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20) states: Let A be a set, and T : A → A a transformation of that set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanideal","kind":"concept","label":"Boolean ideal","sources":[{"id":"planetmath.booleanideal","title":"PlanetMath entry booleanideal","url":"https://planetmath.org/booleanideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G05, 03G10) states: Let A be a Boolean algebra and B a subset of A . The following are equivalent : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.congruence12","kind":"concept","label":"Congruence","sources":[{"id":"planetmath.congruence12","title":"PlanetMath entry congruence12","url":"https://planetmath.org/congruence12"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C05, 03C07) states: Let Σ be a fixed signature , and 𝔄 a structure for Σ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.congruenceonapartialalgebra","kind":"concept","label":"Congruence on a partial algebra","sources":[{"id":"planetmath.congruenceonapartialalgebra","title":"PlanetMath entry congruenceonapartialalgebra","url":"https://planetmath.org/congruenceonapartialalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Definition There are two types of congruences on a partial algebra 𝑨 , both are special types of a certain equivalence relation on A : 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.linearlyordered","kind":"concept","label":"Linearly ordered","sources":[{"id":"planetmath.linearlyordered","title":"PlanetMath entry linearlyordered","url":"https://planetmath.org/linearlyordered"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: An ordering ≤ (or < ) of A is called linear or total if any two elements of A are comparable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.transfiniterecursion","kind":"theory","label":"Transfinite recursion","sources":[{"id":"planetmath.transfiniterecursion","title":"PlanetMath entry transfiniterecursion","url":"https://planetmath.org/transfiniterecursion"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E45, 03E10) states: Transfinite recursion , roughly speaking, is a statement about the ability to define a function recursively using transfinite induction .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inverseimage","kind":"concept","label":"Inverse image","sources":[{"id":"planetmath.inverseimage","title":"PlanetMath entry inverseimage","url":"https://planetmath.org/inverseimage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E20, 46L05, 82-00, 83-00, 81-00) states: Let f : A ⟶ B be a function , and let U ⊂ B be a subset. The inverse image of U is the set f - 1 ⁢ ( U ) ⊂ A consisting of all elements a ∈ A such that f ⁢ ( a ) ∈ U .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","kind":"concept","label":"Similarity and analogous systems: dynamic adjointness and topological equivalence","sources":[{"id":"planetmath.similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","title":"PlanetMath entry similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence","url":"https://planetmath.org/similarityandanalogoussystemsdynamicadjointnessandtopologicalequivalence"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C98, 18-00, 37F99, 37F05, 03D80, 03D15, 03C52, 18A40) states: \\xyoption curve 0.1 Dynamic Adjointness, Similarity and Analogous Systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.gentzensystem","kind":"concept","label":"Gentzen system","sources":[{"id":"planetmath.gentzensystem","title":"PlanetMath entry gentzensystem","url":"https://planetmath.org/gentzensystem"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03F07, 03F03, 03B99, 03F05) states: Introduction A Gentzen system , attributed to the German logician Gerhard Gentzen, is a variant form of a deductive system .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.maximalelement","kind":"concept","label":"Maximal element","sources":[{"id":"planetmath.maximalelement","title":"PlanetMath entry maximalelement","url":"https://planetmath.org/maximalelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E04) states: Let ≤ be an ordering on a set S , and let A ⊆ S . Then, with respect to the ordering ≤ , • a ∈ A is the least element of A if a ≤ x , for all x ∈ A .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.arrowsrelation","kind":"concept","label":"Arrows relation","sources":[{"id":"planetmath.arrowsrelation","title":"PlanetMath entry arrowsrelation","url":"https://planetmath.org/arrowsrelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05A18, 03E05) states: Let [ X ] α = { Y ⊆ X ∣ | Y | = α } , that is, the set of subsets of X of size α .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.homogeneous","kind":"concept","label":"Homogeneous","sources":[{"id":"planetmath.homogeneous","title":"PlanetMath entry homogeneous","url":"https://planetmath.org/homogeneous"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C50) states: Let L be a first order language . Let M be an L - structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.boundedcomplete","kind":"concept","label":"Bounded complete","sources":[{"id":"planetmath.boundedcomplete","title":"PlanetMath entry boundedcomplete","url":"https://planetmath.org/boundedcomplete"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A12, 06B23, 03G10) states: Let P be a poset. Recall that a subset S of P is called bounded from above if there is an element a ∈ P such that, for every s ∈ S , s ≤ a .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.infinitesimal","kind":"concept","label":"Infinitesimal","sources":[{"id":"planetmath.infinitesimal","title":"PlanetMath entry infinitesimal","url":"https://planetmath.org/infinitesimal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03H05, 06F25, 03C64) states: Let R be a real closed field, for example the reals thought of as a structure in L , the language of ordered rings .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.cantorsdiagonalargument","kind":"concept","label":"Cantor’s diagonal argument","sources":[{"id":"planetmath.cantorsdiagonalargument","title":"PlanetMath entry cantorsdiagonalargument","url":"https://planetmath.org/cantorsdiagonalargument"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03E10) states: One of the starting points in Cantor’s development of set theory was his discovery that there are different degrees of infinity .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.evennumber","kind":"concept","label":"Even number","sources":[{"id":"planetmath.evennumber","title":"PlanetMath entry evennumber","url":"https://planetmath.org/evennumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11-00, 03-00) states: Definition Suppose k is an integer . If there exists an integer r such that k = 2 ⁢ r + 1 , then k is an odd number .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.binomialtheorem","kind":"theory","label":"Binomial theorem","sources":[{"id":"planetmath.binomialtheorem","title":"PlanetMath entry binomialtheorem","url":"https://planetmath.org/binomialtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 11B65, 06F25, 03E20) states: The binomial theorem is a formula for the expansion of ( a + b ) n , for n a positive integer and a and b any two real (or complex) numbers, into a sum of powers of a and b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.markovalgorithm","kind":"concept","label":"Markov algorithm","sources":[{"id":"planetmath.markovalgorithm","title":"PlanetMath entry markovalgorithm","url":"https://planetmath.org/markovalgorithm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10) states: Definition A Markov algorithm is a variant of a rewriting system , invented by mathematician Andrey Andreevich Markov Jr.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.postsystem","kind":"concept","label":"Post system","sources":[{"id":"planetmath.postsystem","title":"PlanetMath entry postsystem","url":"https://planetmath.org/postsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q42, 03D03) states: Introduction A Post canonical system (or Post system for short) 𝔓 is a triple ( Σ , X , P ) , such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pairingfunction","kind":"concept","label":"Pairing function","sources":[{"id":"planetmath.pairingfunction","title":"PlanetMath entry pairingfunction","url":"https://planetmath.org/pairingfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: A pairing function is a function P : ℤ + 2 → ℤ + which establishes a one-to-one correspondence between ℤ + 2 and ℤ + .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.ackermannfunction","kind":"concept","label":"Ackermann function","sources":[{"id":"planetmath.ackermannfunction","title":"PlanetMath entry ackermannfunction","url":"https://planetmath.org/ackermannfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D75) states: Ackermann’s function A ⁢ ( x , y ) is defined by the recurrence relations A ⁢ ( 0 , y ) = y + 1 A ⁢ ( x + 1 , 0 ) = A ⁢ ( x , 1 ) A ⁢ ( x + 1 , y + 1 ) = A ⁢ ( x , A ⁢ ( x + 1 , y ) ) Ackermann’s function is an example of a recursive function that is not primitive recursive , but is instead μ - recursive (that is, Turing-computable ).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.deductiontheoremholdsforclassicalpropositionallogic","kind":"theory","label":"Deduction theorem holds for classical propositional logic","sources":[{"id":"planetmath.deductiontheoremholdsforclassicalpropositionallogic","title":"PlanetMath entry deductiontheoremholdsforclassicalpropositionallogic","url":"https://planetmath.org/deductiontheoremholdsforclassicalpropositionallogic"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03F03, 03B99, 03B22) states: In this entry, we prove that the deduction theorem holds for classical propositional logic .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inductionaxiom","kind":"concept","label":"Induction axiom","sources":[{"id":"planetmath.inductionaxiom","title":"PlanetMath entry inductionaxiom","url":"https://planetmath.org/inductionaxiom"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: An induction axiom specifies that a theory includes induction , possibly restricted to specific formulas .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.pointwise","kind":"concept","label":"Pointwise","sources":[{"id":"planetmath.pointwise","title":"PlanetMath entry pointwise","url":"https://planetmath.org/pointwise"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00, 08-00) states: When concepts (properties, operations , etc.) on a set Y are extended to functions f : X ⟶ Y by treating each function value f ⁢ ( x ) in isolation, the extended concept is often qualified with the word pointwise .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.commutativityrelationinanorthocomplementedlattice","kind":"concept","label":"Commutativity relation in an orthocomplemented lattice","sources":[{"id":"planetmath.commutativityrelationinanorthocomplementedlattice","title":"PlanetMath entry commutativityrelationinanorthocomplementedlattice","url":"https://planetmath.org/commutativityrelationinanorthocomplementedlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06C15, 03G12) states: Let L be an orthocomplemented lattice with a , b ∈ L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.orthomodularlattice","kind":"concept","label":"Orthomodular lattice","sources":[{"id":"planetmath.orthomodularlattice","title":"PlanetMath entry orthomodularlattice","url":"https://planetmath.org/orthomodularlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06C15, 81P10, 03G12) states: Orthogonality Relations Let L be an orthocomplemented lattice and a , b ∈ L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.noncommutativedynamicmodelingdiagrams","kind":"concept","label":"Non-commutative dynamic modeling diagrams","sources":[{"id":"planetmath.noncommutativedynamicmodelingdiagrams","title":"PlanetMath entry noncommutativedynamicmodelingdiagrams","url":"https://planetmath.org/noncommutativedynamicmodelingdiagrams"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 03C98, 03C52, 18-00, 03D80, 03D15) states: \\xyoption curve 0.1 Introduction In an interesting report, Rosen(1987) showed that complex dynamical systems , such as biological organisms, cannot be adequately modelled through a commutative modelling diagram – in the sense of digital computer simulation –whereas the simple (‘physical’/ engineering) dynamical systems can be thus numerically simulated.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofextensionality","kind":"concept","label":"Axiom of extensionality","sources":[{"id":"planetmath.axiomofextensionality","title":"PlanetMath entry axiomofextensionality","url":"https://planetmath.org/axiomofextensionality"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: If X and Y have the same elements , then X = Y . The Axiom of Extensionality is one of the axioms of Zermelo-Fraenkel set theory .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fuzzysubset","kind":"concept","label":"Fuzzy subset","sources":[{"id":"planetmath.fuzzysubset","title":"PlanetMath entry fuzzysubset","url":"https://planetmath.org/fuzzysubset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E72, 03G20) states: Fuzzy set theory is based on the idea that vague notions as “big”, “near”, “hold” can be modelled by “fuzzy subsets”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.modelsconstructedfromconstants","kind":"concept","label":"Models constructed from constants","sources":[{"id":"planetmath.modelsconstructedfromconstants","title":"PlanetMath entry modelsconstructedfromconstants","url":"https://planetmath.org/modelsconstructedfromconstants"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07) states: The definition of a structure and of the satisfaction relation is nice, but it raises the following question : how do we get models in the first place? The most basic construction for models of first-order theory is the construction that uses constants .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.boundedminimization","kind":"concept","label":"Bounded minimization","sources":[{"id":"planetmath.boundedminimization","title":"PlanetMath entry boundedminimization","url":"https://planetmath.org/boundedminimization"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D20) states: One useful way of generating more primitive recursive functions from existing ones is through what is known as bounded summation and bounded product .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subformula","kind":"concept","label":"Subformula","sources":[{"id":"planetmath.subformula","title":"PlanetMath entry subformula","url":"https://planetmath.org/subformula"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03B10) states: Let L be a first order language and suppose φ is a formula of L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.inversefunctiontheorem","kind":"theory","label":"Inverse function theorem","sources":[{"id":"planetmath.inversefunctiontheorem","title":"PlanetMath entry inversefunctiontheorem","url":"https://planetmath.org/inversefunctiontheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E20) states: Let 𝐟 be a continuously differentiable , vector-valued function mapping the open set E ⊂ ℝ n to ℝ n and let S = 𝐟 ⁢ ( E ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationcomposition","kind":"concept","label":"Relation composition","sources":[{"id":"planetmath.relationcomposition","title":"PlanetMath entry relationcomposition","url":"https://planetmath.org/relationcomposition"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 68R01, 68P15, 08A02, 05C65, 05B30, 05B20, 03E20, 03B10) states: Relation composition , or the composition of relations , is the generalization of function composition, or the composition of functions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.zermeloswellorderingtheorem","kind":"theory","label":"Zermelo’s well-ordering theorem","sources":[{"id":"planetmath.zermeloswellorderingtheorem","title":"PlanetMath entry zermeloswellorderingtheorem","url":"https://planetmath.org/zermeloswellorderingtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25) states: If X is any set whatsoever, then there exists a well-ordering of X .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.constructingautomatafromregularlanguages","kind":"concept","label":"Constructing automata from regular languages","sources":[{"id":"planetmath.constructingautomatafromregularlanguages","title":"PlanetMath entry constructingautomatafromregularlanguages","url":"https://planetmath.org/constructingautomatafromregularlanguages"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03D10, 68Q42, 68Q05) states: In this entry, we describe how a certain equivalence relation on words gives rise to a deterministic automaton , and show that deterministic automata to a certain extent can be characterized by these equivalence relations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.stronglyminimal","kind":"concept","label":"Strongly minimal","sources":[{"id":"planetmath.stronglyminimal","title":"PlanetMath entry stronglyminimal","url":"https://planetmath.org/stronglyminimal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C07, 03C10, 03C45) states: Let L be a first order language and let M be an L - structure .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.metalanguage","kind":"concept","label":"Metalanguage","sources":[{"id":"planetmath.metalanguage","title":"PlanetMath entry metalanguage","url":"https://planetmath.org/metalanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: A remedy for Berry’s Paradox and related paradoxes is to separate the language used to formulate a particular mathematical theory from the language used for its discourse.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.semioticequivalencerelation","kind":"concept","label":"Semiotic equivalence relation","sources":[{"id":"planetmath.semioticequivalencerelation","title":"PlanetMath entry semioticequivalencerelation","url":"https://planetmath.org/semioticequivalencerelation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 94A05, 03G15, 03E20, 03B42, 03B10, 94A15) states: Note. The intended forms of the Tables are visible only in the Page Image view.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.specialelementsinarelationalgebra","kind":"concept","label":"Special elements in a relation algebra","sources":[{"id":"planetmath.specialelementsinarelationalgebra","title":"PlanetMath entry specialelementsinarelationalgebra","url":"https://planetmath.org/specialelementsinarelationalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: Let A be a relation algebra with operators ( ∨ , ∧ , ; , ′ , - , 0 , 1 , i ) of type ( 2 , 2 , 2 , 1 , 1 , 0 , 0 , 0 ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomschemaofseparation","kind":"concept","label":"Axiom schema of separation","sources":[{"id":"planetmath.axiomschemaofseparation","title":"PlanetMath entry axiomschemaofseparation","url":"https://planetmath.org/axiomschemaofseparation"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: Let ϕ ⁢ ( u , p ) be a formula . For any X and p , there exists a set Y = { u ∈ X : ϕ ⁢ ( u , p ) } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.russellsparadox","kind":"concept","label":"Russell’s paradox","sources":[{"id":"planetmath.russellsparadox","title":"PlanetMath entry russellsparadox","url":"https://planetmath.org/russellsparadox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: Suppose that for any coherent proposition P ⁢ ( x ) , we can construct a set { x : P ⁢ ( x ) } .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.z2","kind":"concept","label":"Z","sources":[{"id":"planetmath.z2","title":"PlanetMath entry z2","url":"https://planetmath.org/z2"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03F35) states: 2 Z 2 is the full system of second order arithmetic , that is, the full theory of numbers and sets of numbers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.banachtarskiparadox","kind":"theory","label":"Banach-Tarski paradox","sources":[{"id":"planetmath.banachtarskiparadox","title":"PlanetMath entry banachtarskiparadox","url":"https://planetmath.org/banachtarskiparadox"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 28A99, 03B99) states: The 3 -dimensional ball can be split in a finite number of pieces which can be pasted together to give two balls of the same volume as the first! Let us formulate the theorem formally.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.buralifortiparadox","kind":"concept","label":"Burali-Forti paradox","sources":[{"id":"planetmath.buralifortiparadox","title":"PlanetMath entry buralifortiparadox","url":"https://planetmath.org/buralifortiparadox"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03-00) states: The Burali-Forti paradox demonstrates that the class of all ordinals is not a set.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.planetmath.hausdorffparadox","kind":"theory","label":"Hausdorff paradox","sources":[{"id":"planetmath.hausdorffparadox","title":"PlanetMath entry hausdorffparadox","url":"https://planetmath.org/hausdorffparadox"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 03E25, 51M04) states: Let S 2 be the unit sphere in the Euclidean space ℝ 3 .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.compactness","kind":"concept","label":"Compactness","sources":[{"id":"planetmath.compactness","title":"PlanetMath entry compactness","url":"https://planetmath.org/compactness"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B99) states: A logic is said to be ( κ , λ ) -compact, if the following holds If Φ is a set of sentences of cardinality less than or equal to κ and all subsets of Φ of cardinality less than λ are consistent , then Φ is consistent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.polyadicalgebra","kind":"concept","label":"Polyadic algebra","sources":[{"id":"planetmath.polyadicalgebra","title":"PlanetMath entry polyadicalgebra","url":"https://planetmath.org/polyadicalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15) states: A polyadic algebra is a quadruple ( B , V , ∃ , S ) , where ( B , V , ∃ ) is a quantifier algebra , and S is a function from the set of functions on V to the set of endomorphisms on the Boolean algebra B , in other words S : V V → End ⁡ ( B ) such that 1.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.relationalgebra","kind":"concept","label":"Relation algebra","sources":[{"id":"planetmath.relationalgebra","title":"PlanetMath entry relationalgebra","url":"https://planetmath.org/relationalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G15, 06E25) states: It is a well-known fact that if A is a set, then P ⁢ ( A ) the power set of A , equipped with the intersection operation ∩ , the union operation ∪ , and the complement operation ′ turns P ⁢ ( A ) into a Boolean algebra .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomatizableclass","kind":"concept","label":"Axiomatizable class","sources":[{"id":"planetmath.axiomatizableclass","title":"PlanetMath entry axiomatizableclass","url":"https://planetmath.org/axiomatizableclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03C52) states: Let L be a first order language and T a theory in L .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.solesufficientoperator","kind":"concept","label":"Sole sufficient operator","sources":[{"id":"planetmath.solesufficientoperator","title":"PlanetMath entry solesufficientoperator","url":"https://planetmath.org/solesufficientoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B70, 03B35, 03B22, 03B05) states: A sole sufficient operator or a sole sufficient connective is an operator that is sufficient by itself to define all of the operators in a specified set of operators.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.zerothorderlogic","kind":"concept","label":"Zeroth order logic","sources":[{"id":"planetmath.zerothorderlogic","title":"PlanetMath entry zerothorderlogic","url":"https://planetmath.org/zerothorderlogic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03G05, 03B05) states: \\PMlinkescapephrase calculus \\PMlinkescapephrase Calculus \\PMlinkescapephrase column \\PMlinkescapephrase Column \\PMlinkescapephrase columns \\PMlinkescapephrase Columns \\PMlinkescapephrase compact \\PMlinkescapephrase Compact \\PMlinkescapephrase degree \\PMlinkescapephrase Degree \\PMlinkescapephrase formal logic \\PMlinkescapephrase Formal logic \\PMlinkescapephrase level \\PMlinkescapephrase Level \\PMlinkescapephrase order \\PMlinkescapephrase Order \\PMlinkescapephrase reference \\PMlinkescapephrase Reference \\PMlinkescapephrase translation \\PMlinkescapephrase Translation Note.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.hartigsquantifier","kind":"concept","label":"Härtig’s quantifier","sources":[{"id":"planetmath.hartigsquantifier","title":"PlanetMath entry hartigsquantifier","url":"https://planetmath.org/hartigsquantifier"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15) states: Härtig’s quantifier is a quantifier which takes two variables and two formulas , written I ⁢ x ⁢ y ⁢ ϕ ⁢ ( x ) ⁢ ψ ⁢ ( y ) .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.skolemization","kind":"concept","label":"Skolemization","sources":[{"id":"planetmath.skolemization","title":"PlanetMath entry skolemization","url":"https://planetmath.org/skolemization"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B15, 03B10) states: Skolemization is a way of removing existential quantifiers from a formula .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.subalgebraofapartialalgebra","kind":"concept","label":"Subalgebra of a partial algebra","sources":[{"id":"planetmath.subalgebraofapartialalgebra","title":"PlanetMath entry subalgebraofapartialalgebra","url":"https://planetmath.org/subalgebraofapartialalgebra"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A55, 03E99, 08A62) states: Unlike an algebraic system , where there is only one way to define a subalgebra , there are several ways to define a subalgebra of a partial algebra .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.inaccessiblecardinal","kind":"concept","label":"Inaccessible cardinal","sources":[{"id":"planetmath.inaccessiblecardinal","title":"PlanetMath entry inaccessiblecardinal","url":"https://planetmath.org/inaccessiblecardinal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E55) states: A limit cardinal κ is a strong limit cardinal if for any λ < κ , 2 λ < κ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.bisimulation","kind":"concept","label":"Bisimulation","sources":[{"id":"planetmath.bisimulation","title":"PlanetMath entry bisimulation","url":"https://planetmath.org/bisimulation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03B45, 68Q85, 68Q10) states: Given two labelled state transition systems (LTS) M = ( S 1 , Σ , → 1 ) , N = ( S 2 , Σ , → 2 ) , a binary relation ≈ ⊆ S 1 × S 2 is called a simulation if whenever p ≈ q and p → α 1 p ′ , then there is a q ′ such that p ′ ≈ q ′ and q → α 2 q ′ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.fixedpointsofnormalfunctions","kind":"concept","label":"Fixed points of normal functions","sources":[{"id":"planetmath.fixedpointsofnormalfunctions","title":"PlanetMath entry fixedpointsofnormalfunctions","url":"https://planetmath.org/fixedpointsofnormalfunctions"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E10) states: If f : M → 𝐎𝐧 is a function from any set of ordinals to the class of ordinals then Fix ⁡ ( f ) = { x ∈ M ∣ f ⁢ ( x ) = x } is the set of fixed points of f .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.multiset","kind":"concept","label":"Multiset","sources":[{"id":"planetmath.multiset","title":"PlanetMath entry multiset","url":"https://planetmath.org/multiset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 03E99) states: A multiset is a set for which repeated elements are considered.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.traceable","kind":"concept","label":"Traceable","sources":[{"id":"planetmath.traceable","title":"PlanetMath entry traceable","url":"https://planetmath.org/traceable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C45, 03B22, 03-00, 03-01) states: Let G be a graph. If G has a Hamiltonian path , we say that G is traceable .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.axiomofpairing","kind":"concept","label":"Axiom of pairing","sources":[{"id":"planetmath.axiomofpairing","title":"PlanetMath entry axiomofpairing","url":"https://planetmath.org/axiomofpairing"}],"status":"reported","summary":"PlanetMath (axiom entry, MSC 03E30) states: For any a and b there exists a set { a , b } that contains exactly a and b .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanalgebrahomomorphism","kind":"concept","label":"Boolean algebra homomorphism","sources":[{"id":"planetmath.booleanalgebrahomomorphism","title":"PlanetMath entry booleanalgebrahomomorphism","url":"https://planetmath.org/booleanalgebrahomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E05, 03G05, 06B20, 03G10) states: Let A and B be Boolean algebras . A function f : A → B is called a Boolean algebra homomorphism , or homomorphism for short, if f is a { 0 , 1 } - lattice homomorphism ( http://planetmath.org/LatticeHomomorphism ) such that f respects ′ : f ⁢ ( a ′ ) = f ⁢ ( a ) ′ .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.planetmath.booleanring","kind":"concept","label":"Boolean ring","sources":[{"id":"planetmath.booleanring","title":"PlanetMath entry booleanring","url":"https://planetmath.org/booleanring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06E99, 03G05) states: A Boolean ring is a ring R that has a multiplicative identity , and in which every element is idempotent , that is, x 2 = x ⁢ for all ⁢ x ∈ R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorspace","kind":"concept","label":"Vector space","sources":[{"id":"planetmath.vectorspace","title":"PlanetMath entry vectorspace","url":"https://planetmath.org/vectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16-00, 13-00, 20-00, 15-00, 70B15) states: Let F be a field (or, more generally, a division ring).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologicalspace","kind":"concept","label":"Topological space","sources":[{"id":"planetmath.topologicalspace","title":"PlanetMath entry topologicalspace","url":"https://planetmath.org/topologicalspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 22-00, 55-00, 54-00) states: A topological space is a set X together with a set 𝒯 whose elements are subsets of X , such that • ∅ ∈ 𝒯 • X ∈ 𝒯 • If U j ∈ 𝒯 for all j ∈ J , then ⋃ j ∈ J U j ∈ 𝒯 • If U ∈ 𝒯 and V ∈ 𝒯 , then U ∩ V ∈ 𝒯 Elements of 𝒯 are called open sets of X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metricspace","kind":"concept","label":"Metric space","sources":[{"id":"planetmath.metricspace","title":"PlanetMath entry metricspace","url":"https://planetmath.org/metricspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 82-00, 83-00, 81-00) states: A metric space is a set X together with a real valued function d : X × X ⟶ ℝ (called a metric , or sometimes a distance function) such that, for every x , y , z ∈ X , • d ⁢ ( x , y ) ≥ 0 , with equality 1 1 This condition can be replaced with the weaker statement d ⁢ ( x , y ) = 0 ⇔ x = y without affecting the definition.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.integral","kind":"concept","label":"Integral","sources":[{"id":"planetmath.integral","title":"PlanetMath entry integral","url":"https://planetmath.org/integral"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B21) states: Let B be a ring with a subring A . We will assume that A is contained in the center of B (in particular, A is commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.manifold","kind":"concept","label":"Manifold","sources":[{"id":"planetmath.manifold","title":"PlanetMath entry manifold","url":"https://planetmath.org/manifold"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53-00, 57R50, 58A05, 58A07) states: Summary. A manifold is a space that is locally like ℝ n , however lacking a preferred system of coordinates.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentialequation","kind":"concept","label":"Differential equation","sources":[{"id":"planetmath.differentialequation","title":"PlanetMath entry differentialequation","url":"https://planetmath.org/differentialequation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 35-00, 34-00) states: A differential equation is an equation involving an unknown function of one or more variables, its derivatives and the variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.abeliangroup","kind":"concept","label":"Abelian group","sources":[{"id":"planetmath.abeliangroup","title":"PlanetMath entry abeliangroup","url":"https://planetmath.org/abeliangroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20K99) states: Let ( G , * ) be a group. If for any a , b ∈ G we have a * b = b * a , we say that the group is abelian (or commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.binaryoperation","kind":"concept","label":"Binary operation","sources":[{"id":"planetmath.binaryoperation","title":"PlanetMath entry binaryoperation","url":"https://planetmath.org/binaryoperation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A99) states: A binary operation on a set X is a function from the Cartesian product X × X to X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.equality","kind":"concept","label":"Equality","sources":[{"id":"planetmath.equality","title":"PlanetMath entry equality","url":"https://planetmath.org/equality"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 06-00) states: In any set S , the equality , denoted by “ = ”, is a binary relation which is reflexive , symmetric , transitive and antisymmetric, i.e.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupaction","kind":"concept","label":"Group action","sources":[{"id":"planetmath.groupaction","title":"PlanetMath entry groupaction","url":"https://planetmath.org/groupaction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16W22, 20M30) states: Let G be a group and let X be a set. A left group action is a function ⋅ : G × X ⟶ X such that: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupoid","kind":"concept","label":"Groupoid","sources":[{"id":"planetmath.groupoid","title":"PlanetMath entry groupoid","url":"https://planetmath.org/groupoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02) states: A groupoid G is a set together with a binary operation ⋅ : G × G ⟶ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hypergroup","kind":"concept","label":"Hypergroup","sources":[{"id":"planetmath.hypergroup","title":"PlanetMath entry hypergroup","url":"https://planetmath.org/hypergroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N20) states: Hypergroups are generalizations of groups. Recall that a group is set with a binary operation on it satisfying a number of conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identityelement","kind":"concept","label":"Identity element","sources":[{"id":"planetmath.identityelement","title":"PlanetMath entry identityelement","url":"https://planetmath.org/identityelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05, 20N02, 20N05, 20M99) states: Let G be a groupoid , that is a set with a binary operation G × G → G , written muliplicatively so that ( x , y ) ↦ x ⁢ y .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identityinaclass","kind":"concept","label":"Identity in a class","sources":[{"id":"planetmath.identityinaclass","title":"PlanetMath entry identityinaclass","url":"https://planetmath.org/identityinaclass"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08B99) states: Let K be a class of algebraic systems of the same type.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.regularsemigroup","kind":"concept","label":"Regular semigroup","sources":[{"id":"planetmath.regularsemigroup","title":"PlanetMath entry regularsemigroup","url":"https://planetmath.org/regularsemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M17, 20M18) states: \\PMlinkescapephrase completely regular \\PMlinkescapephrase generated by Let S be a semigroup .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.specialelementsinalattice","kind":"concept","label":"Special elements in a lattice","sources":[{"id":"planetmath.specialelementsinalattice","title":"PlanetMath entry specialelementsinalattice","url":"https://planetmath.org/specialelementsinalattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B99) states: Let L be a lattice and a ∈ L is said to be • distributive if a ∨ ( b ∧ c ) = ( a ∨ b ) ∧ ( a ∨ c ) , • standard if b ∧ ( a ∨ c ) = ( b ∧ a ) ∨ ( b ∧ c ) , or • neutral if ( a ∧ b ) ∨ ( b ∧ c ) ∨ ( c ∧ a ) = ( a ∨ b ) ∧ ( b ∨ c ) ∧ ( c ∨ a ) for all b , c ∈ L .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subgroup","kind":"concept","label":"Subgroup","sources":[{"id":"planetmath.subgroup","title":"PlanetMath entry subgroup","url":"https://planetmath.org/subgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Definition: Let ( G , * ) be a group and let K be subset of G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.commutativesemigroup","kind":"concept","label":"Commutative semigroup","sources":[{"id":"planetmath.commutativesemigroup","title":"PlanetMath entry commutativesemigroup","url":"https://planetmath.org/commutativesemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M14) states: A semigroup S is commutative if the defining binary operation is commutative ( http://planetmath.org/Commutative ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distributivity","kind":"concept","label":"Distributivity","sources":[{"id":"planetmath.distributivity","title":"PlanetMath entry distributivity","url":"https://planetmath.org/distributivity"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06D99, 16-00, 13-00, 17-00) states: Given a set ( http://planetmath.org/Set ) S with two binary operations + : S × S → S and ⋅ : S × S → S , we say that ⋅ is right distributive over + if ( a + b ) ⋅ c = ( a ⋅ c ) + ( b ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S and left distributive over + if a ⋅ ( b + c ) = ( a ⋅ b ) + ( a ⋅ c ) ⁢ for ⁢ all ⁢ a , b , c ∈ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.semiring","kind":"concept","label":"Semiring","sources":[{"id":"planetmath.semiring","title":"PlanetMath entry semiring","url":"https://planetmath.org/semiring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16Y60) states: \\PMlinkescapephrase right annihilator A semiring is a set A with two operations , + and ⋅ , such that 0 ∈ A makes ( A , + ) into a commutative monoid , 1 ∈ A makes ( A , ⋅ ) into a monoid, the operation ⋅ distributes ( http://planetmath.org/ Distributivity ) over + , and for any a ∈ A , 0 ⋅ a = a ⋅ 0 = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subtraction","kind":"concept","label":"Subtraction","sources":[{"id":"planetmath.subtraction","title":"PlanetMath entry subtraction","url":"https://planetmath.org/subtraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A06, 00A05, 11B25) states: Subtraction is a mathematical operation in which the value of a number is decreased by the values of one or more other numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.addition","kind":"concept","label":"Addition","sources":[{"id":"planetmath.addition","title":"PlanetMath entry addition","url":"https://planetmath.org/addition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11B25, 00A06, 00A05) states: Addition is a mathematical operation in which two or more numbers are added up.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multiplication","kind":"concept","label":"Multiplication","sources":[{"id":"planetmath.multiplication","title":"PlanetMath entry multiplication","url":"https://planetmath.org/multiplication"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A06, 11B25, 00A05) states: Multiplication is a mathematical operation in which two or more numbers are added up to themselves by a factor of other numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zeroelements","kind":"concept","label":"Zero elements","sources":[{"id":"planetmath.zeroelements","title":"PlanetMath entry zeroelements","url":"https://planetmath.org/zeroelements"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let S be a semigroup . An element z is called a right zero [resp.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closedset","kind":"concept","label":"Closed set","sources":[{"id":"planetmath.closedset","title":"PlanetMath entry closedset","url":"https://planetmath.org/closedset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: \\PMlinkescapephrase closed under Let ( X , τ ) be a topological space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.discretespace","kind":"concept","label":"Discrete space","sources":[{"id":"planetmath.discretespace","title":"PlanetMath entry discretespace","url":"https://planetmath.org/discretespace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: The discrete topology on a set X is the topology given by the power set of X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.indiscretetopology","kind":"concept","label":"Indiscrete topology","sources":[{"id":"planetmath.indiscretetopology","title":"PlanetMath entry indiscretetopology","url":"https://planetmath.org/indiscretetopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: If X is a set and it is endowed with a topology defined by τ = { X , ∅ } then X is said to have the indiscrete topology .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.neighborhood","kind":"concept","label":"Neighborhood","sources":[{"id":"planetmath.neighborhood","title":"PlanetMath entry neighborhood","url":"https://planetmath.org/neighborhood"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: The meaning of the word neighborhood in topology is not well standardized.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.neighborhoodofavertex","kind":"concept","label":"Neighborhood (of a vertex)","sources":[{"id":"planetmath.neighborhoodofavertex","title":"PlanetMath entry neighborhoodofavertex","url":"https://planetmath.org/neighborhoodofavertex"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C99) states: For a graph G , the set of vertices adjacent to a vertex x ∈ G , the neighborhood of x , is denoted by Γ ⁢ ( x ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.openset","kind":"concept","label":"Open set","sources":[{"id":"planetmath.openset","title":"PlanetMath entry openset","url":"https://planetmath.org/openset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: In a metric space M a set O is called an open subset of M or just open , if for every x ∈ O there is an open ball S around x such that S ⊂ O .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.producttopology","kind":"concept","label":"Product topology","sources":[{"id":"planetmath.producttopology","title":"PlanetMath entry producttopology","url":"https://planetmath.org/producttopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B10) states: Definition Let ( ( X α , 𝒯 α ) ) α ∈ A be a family of topological spaces , and let Y be the Cartesian product ( http://planetmath.org/GeneralizedCartesianProduct ) of the sets X α , that is Y = ∏ α ∈ A X α .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subspacetopology","kind":"concept","label":"Subspace topology","sources":[{"id":"planetmath.subspacetopology","title":"PlanetMath entry subspacetopology","url":"https://planetmath.org/subspacetopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B05, 15A66, 11E88) states: Let X be a topological space , and let Y ⊂ X be a subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distanceinagraph","kind":"concept","label":"Distance (in a graph)","sources":[{"id":"planetmath.distanceinagraph","title":"PlanetMath entry distanceinagraph","url":"https://planetmath.org/distanceinagraph"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C12) states: The distance d ⁢ ( x , y ) of two vertices x and y of a graph G is the length of the shortest path (or, equivalently, walk) from x to y .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.grouphomomorphism","kind":"concept","label":"Group homomorphism","sources":[{"id":"planetmath.grouphomomorphism","title":"PlanetMath entry grouphomomorphism","url":"https://planetmath.org/grouphomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Let ( G , ∗ ) and ( K , ⋆ ) be two groups. A group homomorphism is a function ϕ : G → K such that ϕ ⁢ ( s ∗ t ) = ϕ ⁢ ( s ) ⋆ ϕ ⁢ ( t ) for all s , t ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hausdorffspace","kind":"concept","label":"Hausdorff space","sources":[{"id":"planetmath.hausdorffspace","title":"PlanetMath entry hausdorffspace","url":"https://planetmath.org/hausdorffspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: A topological space ( X , τ ) is said to be T 2 (or said to satisfy the T 2 axiom) if given distinct x , y ∈ X , there exist disjoint open sets U , V ∈ τ (that is, U ∩ V = ∅ ) such that x ∈ U and y ∈ V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.isomorphicgroups","kind":"concept","label":"Isomorphic groups","sources":[{"id":"planetmath.isomorphicgroups","title":"PlanetMath entry isomorphicgroups","url":"https://planetmath.org/isomorphicgroups"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Two groups ( X 1 , * 1 ) and ( X 2 , * 2 ) are said to be isomorphic if there is a group isomorphism ψ : X 1 → X 2 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.isomorphism","kind":"concept","label":"Isomorphism","sources":[{"id":"planetmath.isomorphism","title":"PlanetMath entry isomorphism","url":"https://planetmath.org/isomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05, 15A04, 13A99, 20A05, 18A05) states: A morphism f : A ⟶ B in a category is an isomorphism if there exists a morphism f - 1 : B ⟶ A which is its inverse .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.normedvectorspace","kind":"concept","label":"Normed vector space","sources":[{"id":"planetmath.normedvectorspace","title":"PlanetMath entry normedvectorspace","url":"https://planetmath.org/normedvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B99) states: Let 𝔽 be a field which is either ℝ or ℂ . A over 𝔽 is a pair ( V , ∥ ⋅ ∥ ) where V is a vector space over 𝔽 and ∥ ⋅ ∥ : V → ℝ is a function such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ultrametric","kind":"concept","label":"Ultrametric","sources":[{"id":"planetmath.ultrametric","title":"PlanetMath entry ultrametric","url":"https://planetmath.org/ultrametric"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Any metric d : X × X → ℝ on a set X must satisfy the triangle inequality : ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ d ⁢ ( x , y ) + d ⁢ ( y , z ) An ultrametric must additionally satisfy a stronger version of the triangle inequality: ( ∀ x , y , z ) d ⁢ ( x , z ) ≤ max ⁡ { d ⁢ ( x , y ) , d ⁢ ( y , z ) } Here is an example of an ultrametric on a space with 5 points, labelled a , b , c , d , e : a b c d e a 0 12 4 6 12 b 0 12 12 5 c 0 6 12 d 0 12 e 0 In the table above, an entry n in the for element x and the for element y indicates that d ⁢ ( x , y ) = n , where d is the ultrametric.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectornorm","kind":"concept","label":"Vector norm","sources":[{"id":"planetmath.vectornorm","title":"PlanetMath entry vectornorm","url":"https://planetmath.org/vectornorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B20, 18-01, 20H15, 20B30) states: A vector norm on the real vector space V is a function f : V → ℝ that satisfies the following properties: f ⁢ ( x ) = 0 ⇔ x = 0 f ⁢ ( x ) ≥ 0 x ∈ V f ⁢ ( x + y ) ≤ f ⁢ ( x ) + f ⁢ ( y ) x , y ∈ V f ⁢ ( α ⁢ x ) = | α | ⁢ f ⁢ ( x ) α ∈ ℝ , x ∈ V Such a function is denoted as || x || .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.banachspace","kind":"concept","label":"Banach space","sources":[{"id":"planetmath.banachspace","title":"PlanetMath entry banachspace","url":"https://planetmath.org/banachspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B99, 54E50) states: A Banach space ( X , ∥ ⋅ ∥ ) is a normed vector space such that X is complete under the metric induced by the norm ∥ ⋅ ∥ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bilinearform","kind":"concept","label":"Bilinear form","sources":[{"id":"planetmath.bilinearform","title":"PlanetMath entry bilinearform","url":"https://planetmath.org/bilinearform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 11E39, 15A63) states: Definition. Let U , V , W be vector spaces over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.chainrule","kind":"theory","label":"Chain rule","sources":[{"id":"planetmath.chainrule","title":"PlanetMath entry chainrule","url":"https://planetmath.org/chainrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: Let f , g be differentiable , real-valued functions such that g is defined on an open set I ⊆ ℝ , and f is defined on g ⁢ ( I ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coordinatevector","kind":"concept","label":"Coordinate vector","sources":[{"id":"planetmath.coordinatevector","title":"PlanetMath entry coordinatevector","url":"https://planetmath.org/coordinatevector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space of dimension n over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.definitionsintrigonometry","kind":"concept","label":"Definitions in trigonometry","sources":[{"id":"planetmath.definitionsintrigonometry","title":"PlanetMath entry definitionsintrigonometry","url":"https://planetmath.org/definitionsintrigonometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A09) states: Informal definitions Given a triangle A ⁢ B ⁢ C with a signed angle x at A and a right angle at B , the ratios B ⁢ C A ⁢ C A ⁢ B A ⁢ C B ⁢ C A ⁢ B are dependent only on the angle x , and therefore define functions , denoted by sin ⁡ x cos ⁡ x tan ⁡ x respectively, where the names are short for sine, cosine and tangent .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.derivativenotation","kind":"concept","label":"Derivative notation","sources":[{"id":"planetmath.derivativenotation","title":"PlanetMath entry derivativenotation","url":"https://planetmath.org/derivativenotation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 26-00) states: This is the list of known standard representations and their nuances.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.directionalderivative","kind":"concept","label":"Directional derivative","sources":[{"id":"planetmath.directionalderivative","title":"PlanetMath entry directionalderivative","url":"https://planetmath.org/directionalderivative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B12, 26B10) states: Let U be an open set in ℝ n and f : U → ℂ is a differentiable function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.elementaryfunction","kind":"concept","label":"Elementary function","sources":[{"id":"planetmath.elementaryfunction","title":"PlanetMath entry elementaryfunction","url":"https://planetmath.org/elementaryfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A99) states: An elementary function is a real function (of one variable) that can be constructed by a finite number of elementary operations ( addition , subtraction , multiplication and division ) and compositions from constant functions , the identity function ( x ↦ x ), algebraic functions , exponential functions , logarithm functions , trigonometric functions and cyclometric functions .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.jacobianmatrix","kind":"concept","label":"Jacobian matrix","sources":[{"id":"planetmath.jacobianmatrix","title":"PlanetMath entry jacobianmatrix","url":"https://planetmath.org/jacobianmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B10) states: The Jacobian matrix [ 𝐉 ⁢ f ⁢ ( 𝐚 ) ] of a function f : ℝ n → ℝ m at the point 𝐚 with respect to some choice of bases for ℝ n and ℝ m is the matrix of the linear map from ℝ n into ℝ m that generalizes the definition of the derivative of a function on ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.jacobideterminant","kind":"concept","label":"Jacobi determinant","sources":[{"id":"planetmath.jacobideterminant","title":"PlanetMath entry jacobideterminant","url":"https://planetmath.org/jacobideterminant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 62H05, 15-00) states: Let f = f ⁢ ( x ) = f ⁢ ( x 1 , … , x n ) be a function of n variables , and let u = u ⁢ ( x ) = ( u 1 ⁢ ( x ) , … , u n ⁢ ( x ) ) be a function of x , where inversely x can be expressed as a function of u , x = x ⁢ ( u ) = ( x 1 ⁢ ( u ) , … , x n ⁢ ( u ) ) The formula for a change of variable in an n -dimensional integral is then ∫ Ω f ⁢ ( x ) ⁢ d n ⁢ x = ∫ u ⁢ ( Ω ) f ⁢ ( x ⁢ ( u ) ) ⁢ | det ⁡ ( d ⁢ x / d ⁢ u ) | ⁢ d n ⁢ u Ω is an integration region, and one integrates over all x ∈ Ω , or equivalently, all u ∈ u ⁢ ( Ω ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.lineartransformation","kind":"concept","label":"Linear transformation","sources":[{"id":"planetmath.lineartransformation","title":"PlanetMath entry lineartransformation","url":"https://planetmath.org/lineartransformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Let V and W be vector spaces over the same field F .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallyhomeomorphic","kind":"concept","label":"Locally homeomorphic","sources":[{"id":"planetmath.locallyhomeomorphic","title":"PlanetMath entry locallyhomeomorphic","url":"https://planetmath.org/locallyhomeomorphic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00) states: Let X and Y be topological spaces . Then X is locally homeomorphic to Y , if for every x ∈ X there is a neighbourhood U ⊆ X of x and an http://planetmath.org/node/380 open set V ⊆ Y , such that U and V with their respective subspace topology are homeomorphic .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.operatornorm","kind":"concept","label":"Operator norm","sources":[{"id":"planetmath.operatornorm","title":"PlanetMath entry operatornorm","url":"https://planetmath.org/operatornorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47L25, 46A32, 47A30) states: Definition Let A : 𝖵 → 𝖶 be a linear map between normed vector spaces 𝖵 and 𝖶 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.partialderivative","kind":"concept","label":"Partial derivative","sources":[{"id":"planetmath.partialderivative","title":"PlanetMath entry partialderivative","url":"https://planetmath.org/partialderivative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B12) states: The partial derivative of a multivariable function f is simply its derivative with respect to only one variable, keeping all other variables constant (which are not functions of the variable in question).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.productrule","kind":"theory","label":"Product rule","sources":[{"id":"planetmath.productrule","title":"PlanetMath entry productrule","url":"https://planetmath.org/productrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: The product rule states that if f : ℝ → ℝ and g : ℝ → ℝ are functions in one variable both differentiable at a point x 0 , then the derivative of the product of the two functions, denoted f ⋅ g , at x 0 is given by d d ⁢ x ⁢ ( f ⋅ g ) ⁢ ( x 0 ) = f ⁢ ( x 0 ) ⁢ g ′ ⁢ ( x 0 ) + f ′ ⁢ ( x 0 ) ⁢ g ⁢ ( x 0 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.quotientrule","kind":"theory","label":"Quotient rule","sources":[{"id":"planetmath.quotientrule","title":"PlanetMath entry quotientrule","url":"https://planetmath.org/quotientrule"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 26A06) states: The quotient rule says that the derivative of the quotient f / g of two differentiable functions f and g exists at all values of x as long as g ⁢ ( x ) ≠ 0 and is given by the formula d d ⁢ x ⁢ [ f ⁢ ( x ) g ⁢ ( x ) ] = g ⁢ ( x ) ⁢ f ′ ⁢ ( x ) - f ⁢ ( x ) ⁢ g ′ ⁢ ( x ) [ g ⁢ ( x ) ] 2 The Quotient Rule and the other differentiation formulas allow us to compute the derivative of any rational function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.relatedrates","kind":"concept","label":"Related rates","sources":[{"id":"planetmath.relatedrates","title":"PlanetMath entry relatedrates","url":"https://planetmath.org/relatedrates"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53A45, 53A17, 26A24) states: The notion of a derivative has numerous interpretations and applications.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.similarmatrix","kind":"concept","label":"Similar matrix","sources":[{"id":"planetmath.similarmatrix","title":"PlanetMath entry similarmatrix","url":"https://planetmath.org/similarmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Definition A square matrix A is similar (or conjugate ) to a square matrix B if there exists a nonsingular square matrix S such that A = S - 1 ⁢ B ⁢ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tangentline","kind":"concept","label":"Tangent line","sources":[{"id":"planetmath.tangentline","title":"PlanetMath entry tangentline","url":"https://planetmath.org/tangentline"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26B05, 26A24) states: If the curve y = f ⁢ ( x ) of x ⁢ y -plane is sufficiently smooth in its point ( x 0 , y 0 ) and in a neighborhood of this, the curve may have a tangent line (or simply ) in ( x 0 , y 0 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.trigonometry","kind":"concept","label":"Trigonometry","sources":[{"id":"planetmath.trigonometry","title":"PlanetMath entry trigonometry","url":"https://planetmath.org/trigonometry"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 43-00, 51-00, 42-00, 33B10) states: 1 Geometrical definitions Trigonometry arose in ancient times out of attempts to measure the lengths of various lines associated with circles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.uniformspace","kind":"concept","label":"Uniform space","sources":[{"id":"planetmath.uniformspace","title":"PlanetMath entry uniformspace","url":"https://planetmath.org/uniformspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E15) states: A uniform structure (or uniformity ) on a set X is a non empty set 𝒰 of subsets of X × X which satisfies the following axioms: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorfield","kind":"concept","label":"Vector field","sources":[{"id":"planetmath.vectorfield","title":"PlanetMath entry vectorfield","url":"https://planetmath.org/vectorfield"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46E40) states: Vector fields in ℝ n Definition . A vector field v on some open set U ⊂ R n is a function which associates a vector v ⁢ ( x ) to each point x of U .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.incidencegeometry","kind":"concept","label":"Incidence geometry","sources":[{"id":"planetmath.incidencegeometry","title":"PlanetMath entry incidencegeometry","url":"https://planetmath.org/incidencegeometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: Incidence geometry is essentially geometry based on the first postulate in Euclid’s The Elements .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.incidencestructure","kind":"concept","label":"Incidence structure","sources":[{"id":"planetmath.incidencestructure","title":"PlanetMath entry incidencestructure","url":"https://planetmath.org/incidencestructure"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 62K10, 51E30, 51E05, 05B25, 05B07, 05B05) states: Definition . An incidence structure 𝒮 is a triple ( 𝒫 , ℬ , ℐ ) , where 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.pseudograph","kind":"concept","label":"Pseudograph","sources":[{"id":"planetmath.pseudograph","title":"PlanetMath entry pseudograph","url":"https://planetmath.org/pseudograph"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05C75) states: A pseudograph is a graph that allows both parallel edges and loops.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.connectedspace","kind":"concept","label":"Connected space","sources":[{"id":"planetmath.connectedspace","title":"PlanetMath entry connectedspace","url":"https://planetmath.org/connectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be connected if there is no pair of nonempty subsets U , V such that both U and V are open in X , U ∩ V = ∅ and U ∪ V = X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentiablefunction","kind":"concept","label":"Differentiable function","sources":[{"id":"planetmath.differentiablefunction","title":"PlanetMath entry differentiablefunction","url":"https://planetmath.org/differentiablefunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26A24, 57R35) states: Let f : V → W be a function , where V and W are Banach spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homeomorphism","kind":"concept","label":"Homeomorphism","sources":[{"id":"planetmath.homeomorphism","title":"PlanetMath entry homeomorphism","url":"https://planetmath.org/homeomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54C05) states: A homeomorphism f of topological spaces is a continuous , bijective map such that f - 1 is also continuous.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.longline","kind":"concept","label":"Long line","sources":[{"id":"planetmath.longline","title":"PlanetMath entry longline","url":"https://planetmath.org/longline"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54G20) states: The long line is a non-paracompact Hausdorff 1 -dimensional manifold constructed as follows.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metricequivalence","kind":"concept","label":"Metric equivalence","sources":[{"id":"planetmath.metricequivalence","title":"PlanetMath entry metricequivalence","url":"https://planetmath.org/metricequivalence"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Let X be a set equipped with two metrics ρ and σ . We say that ρ is equivalent to σ (on X ) if the identity map on X , is a homeomorphism between the metric topology on X induced by ρ and the metric topology on X induced by σ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.metrizable","kind":"concept","label":"Metrizable","sources":[{"id":"planetmath.metrizable","title":"PlanetMath entry metrizable","url":"https://planetmath.org/metrizable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00, 55-00, 22-00) states: A topological space ( X , 𝒯 ) is said to be metrizable if there is a metric d : X → [ 0 , ∞ ) such that the topology induced by d is 𝒯 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.paracompacttopologicalspace","kind":"concept","label":"Paracompact topological space","sources":[{"id":"planetmath.paracompacttopologicalspace","title":"PlanetMath entry paracompacttopologicalspace","url":"https://planetmath.org/paracompacttopologicalspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54-00, 55-00) states: A topological space X is said to be paracompact if every open cover of X has a locally finite open refinement.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.secondcountable","kind":"concept","label":"Second countable","sources":[{"id":"planetmath.secondcountable","title":"PlanetMath entry secondcountable","url":"https://planetmath.org/secondcountable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D70) states: A topological space is said to be second if it has a countable basis ( http://planetmath.org/BasisTopologicalSpace ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.submanifold","kind":"concept","label":"Submanifold","sources":[{"id":"planetmath.submanifold","title":"PlanetMath entry submanifold","url":"https://planetmath.org/submanifold"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 32V40, 53C40, 53B25, 57N99) states: There are several conflicting definitions of what a submanifold is, depending on which author you are reading.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.totaldifferential","kind":"concept","label":"Total differential","sources":[{"id":"planetmath.totaldifferential","title":"PlanetMath entry totaldifferential","url":"https://planetmath.org/totaldifferential"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53A04, 26B05, 01A45) states: There is the generalisation of the theorem in the parent entry ( http:// planetmath .org/ Differential ) concerning the real functions of several variables; here we formulate it for three variables: Theorem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.changeofbasis","kind":"concept","label":"Change of basis","sources":[{"id":"planetmath.changeofbasis","title":"PlanetMath entry changeofbasis","url":"https://planetmath.org/changeofbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Let V be a vector space . Given a basis A for V , each vector v ∈ V can be uniquely expressed in terms of the base elements v i ∈ A as follows: v = ∑ v i ∈ A r i ⁢ v i where the sum is taken over a finite number of elements in A .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.determinant","kind":"concept","label":"Determinant","sources":[{"id":"planetmath.determinant","title":"PlanetMath entry determinant","url":"https://planetmath.org/determinant"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A15) states: Overview The determinant is an algebraic operation that transforms a square matrix M into a scalar.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimensionvectorspace","kind":"concept","label":"Dimension (vector space)","sources":[{"id":"planetmath.dimensionvectorspace","title":"PlanetMath entry dimensionvectorspace","url":"https://planetmath.org/dimensionvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Let V be a vector space over a field K . We say that V is finite-dimensional if there exists a finite basis of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dualspace","kind":"concept","label":"Dual space","sources":[{"id":"planetmath.dualspace","title":"PlanetMath entry dualspace","url":"https://planetmath.org/dualspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A99) states: Dual of a vector space ; dual bases Let V be a vector space over a field k .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.hallsmarriagetheorem","kind":"theory","label":"Hall’s marriage theorem","sources":[{"id":"planetmath.hallsmarriagetheorem","title":"PlanetMath entry hallsmarriagetheorem","url":"https://planetmath.org/hallsmarriagetheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 05D15) states: Let S = { S 1 , S 2 , … ⁢ S n } be a finite collection of finite sets .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearalgebra","kind":"concept","label":"Linear algebra","sources":[{"id":"planetmath.linearalgebra","title":"PlanetMath entry linearalgebra","url":"https://planetmath.org/linearalgebra"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 15-00, 15-01) states: Linear algebra is the branch of mathematics devoted to the theory of linear structure .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.listvector","kind":"concept","label":"List vector","sources":[{"id":"planetmath.listvector","title":"PlanetMath entry listvector","url":"https://planetmath.org/listvector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03, 15A90) states: Let 𝕂 be a field and n a positive natural number. We define 𝕂 n to be the set of all mappings from the index list ( 1 , 2 , … , n ) to 𝕂 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.projectivebasis","kind":"concept","label":"Projective basis","sources":[{"id":"planetmath.projectivebasis","title":"PlanetMath entry projectivebasis","url":"https://planetmath.org/projectivebasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 05B35, 06C10, 51A05) states: In the parent entry, we see how one may define dimension of a projective space inductively, from its subspaces starting with a point, then a line, and working its way up.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sesquilinearformsovergeneralfields","kind":"concept","label":"Sesquilinear forms over general fields","sources":[{"id":"planetmath.sesquilinearformsovergeneralfields","title":"PlanetMath entry sesquilinearformsovergeneralfields","url":"https://planetmath.org/sesquilinearformsovergeneralfields"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39, 51A05) states: Let V be a vector space over a field k . k may be of any characteristic .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.transpose","kind":"concept","label":"Transpose","sources":[{"id":"planetmath.transpose","title":"PlanetMath entry transpose","url":"https://planetmath.org/transpose"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A57) states: The transpose of a matrix A is the matrix formed by “flipping” A about the diagonal line from the upper left corner.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.absolutevalue","kind":"concept","label":"Absolute value","sources":[{"id":"planetmath.absolutevalue","title":"PlanetMath entry absolutevalue","url":"https://planetmath.org/absolutevalue"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13-00, 11A15) states: Let R be an ordered ring and let a ∈ R . The absolute value of a is defined to be the function | | : R → R given by | a | := { a if ⁢ a ≥ 0 , - a otherwise.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.absolutevalueinavectorlattice","kind":"concept","label":"Absolute value in a vector lattice","sources":[{"id":"planetmath.absolutevalueinavectorlattice","title":"PlanetMath entry absolutevalueinavectorlattice","url":"https://planetmath.org/absolutevalueinavectorlattice"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A40, 06F20) states: Let V be a vector lattice over ℝ , and V + be its positive cone .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ascendingorder","kind":"concept","label":"Ascending order","sources":[{"id":"planetmath.ascendingorder","title":"PlanetMath entry ascendingorder","url":"https://planetmath.org/ascendingorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in ascending order if each a i ≤ a i + 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coefficientsofapolynomial","kind":"concept","label":"Coefficients of a polynomial","sources":[{"id":"planetmath.coefficientsofapolynomial","title":"PlanetMath entry coefficientsofapolynomial","url":"https://planetmath.org/coefficientsofapolynomial"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A40) states: If p ⁢ ( x ) = ∑ i = 0 n a i ⁢ x i is a polynomial ( http://planetmath.org/BasicPolynomial ), then its coefficients are { a i } i = 0 n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.complexnumber","kind":"concept","label":"Complex number","sources":[{"id":"planetmath.complexnumber","title":"PlanetMath entry complexnumber","url":"https://planetmath.org/complexnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D99, 30-00, 32-00, 46L05, 18B40, 46M20, 17B37, 22A22, 81R50, 22D25) states: The ring of complex numbers ℂ is defined to be the quotient ring of the polynomial ring ℝ ⁢ [ X ] in one variable over the reals by the principal ideal ( X 2 + 1 ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.descendingorder","kind":"concept","label":"Descending order","sources":[{"id":"planetmath.descendingorder","title":"PlanetMath entry descendingorder","url":"https://planetmath.org/descendingorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: A sequence or arbitrary ordered set or one-dimensional array of numbers, a , is said to be in descending order if each a i ≥ a i + 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fraction","kind":"concept","label":"Fraction","sources":[{"id":"planetmath.fraction","title":"PlanetMath entry fraction","url":"https://planetmath.org/fraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11-01) states: A fraction is a rational number expressed in the form n d or n / d , where n is designated the numerator and d the denominator .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.modulusofcomplexnumber","kind":"concept","label":"Modulus of complex number","sources":[{"id":"planetmath.modulusofcomplexnumber","title":"PlanetMath entry modulusofcomplexnumber","url":"https://planetmath.org/modulusofcomplexnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 32-00, 30-00, 12D99) states: Definition Let z be a complex number , and let z ¯ be the complex conjugate of z .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monomial","kind":"concept","label":"Monomial","sources":[{"id":"planetmath.monomial","title":"PlanetMath entry monomial","url":"https://planetmath.org/monomial"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12-00) states: A monomial is a product of non-negative powers of variables .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.polynomialring","kind":"concept","label":"Polynomial ring","sources":[{"id":"planetmath.polynomialring","title":"PlanetMath entry polynomialring","url":"https://planetmath.org/polynomialring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11C08, 12E05, 13P05, 17B66, 16W10, 70G65, 17B45) states: 1 Polynomial rings in one variable Let R be a ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.polynomialsinalgebraicsystems","kind":"concept","label":"Polynomials in algebraic systems","sources":[{"id":"planetmath.polynomialsinalgebraicsystems","title":"PlanetMath entry polynomialsinalgebraicsystems","url":"https://planetmath.org/polynomialsinalgebraicsystems"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A40) states: Polynomials in an Algebraic System Let ( A , O ) be an algebraic system .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.radicalofanideal","kind":"concept","label":"Radical of an ideal","sources":[{"id":"planetmath.radicalofanideal","title":"PlanetMath entry radicalofanideal","url":"https://planetmath.org/radicalofanideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 14A05, 16N40, 13-00) states: Let R be a commutative ring . For any ideal I of R , the radical of I , written I or Rad ⁡ ( I ) , is the set { a ∈ R ⁢ ∣ a n ∈ I ⁢ for some integer ⁢ n > ⁢ 0 } The radical of an ideal I is always an ideal of R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.radicalofaninteger","kind":"concept","label":"Radical of an integer","sources":[{"id":"planetmath.radicalofaninteger","title":"PlanetMath entry radicalofaninteger","url":"https://planetmath.org/radicalofaninteger"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13A10, 81-00, 18-00) states: Given a natural number n , let n = p 1 α 1 ⁢ ⋯ ⁢ p k α k be its unique factorization as a product of distinct prime powers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.realnumber","kind":"concept","label":"Real number","sources":[{"id":"planetmath.realnumber","title":"PlanetMath entry realnumber","url":"https://planetmath.org/realnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54C30, 26-00, 12D99) states: 1 Definition There are several equivalent definitions of real number , all in common use.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.differentialoperator","kind":"concept","label":"Differential operator","sources":[{"id":"planetmath.differentialoperator","title":"PlanetMath entry differentialoperator","url":"https://planetmath.org/differentialoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 53-00, 35-00, 47E05, 47F05) states: Roughly speaking, a differential operator is a mapping , typically understood to be linear, that transforms a function into another function by means of partial derivatives and multiplication by other functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.waveequation","kind":"concept","label":"Wave equation","sources":[{"id":"planetmath.waveequation","title":"PlanetMath entry waveequation","url":"https://planetmath.org/waveequation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 35L05) states: The wave equation is a partial differential equation which describes certain kinds of waves.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zeroofafunction","kind":"concept","label":"Zero of a function","sources":[{"id":"planetmath.zeroofafunction","title":"PlanetMath entry zeroofafunction","url":"https://planetmath.org/zeroofafunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 26E99) states: \\PMlinkescapephrase closed set Suppose X is a set and f a complex ( http://planetmath.org/Complex )-valued function f : X → ℂ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.borelspace","kind":"concept","label":"Borel space","sources":[{"id":"planetmath.borelspace","title":"PlanetMath entry borelspace","url":"https://planetmath.org/borelspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60A10, 28C15, 28A12, 54H05, 28A05) states: Definition 0.1 . A Borel space ( X ; ℬ ⁢ ( X ) ) is defined as a set X , together with a Borel σ - algebra ( http://planetmath.org/SigmaAlgebra ) ℬ ⁢ ( X ) of subsets of X , called Borel sets .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.distributionfunction","kind":"concept","label":"Distribution function","sources":[{"id":"planetmath.distributionfunction","title":"PlanetMath entry distributionfunction","url":"https://planetmath.org/distributionfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60E05) states: [this entry is currently being revised, so hold off on corrections until this line is removed] Let F : ℝ → ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.extendedrealnumbers","kind":"concept","label":"Extended real numbers","sources":[{"id":"planetmath.extendedrealnumbers","title":"PlanetMath entry extendedrealnumbers","url":"https://planetmath.org/extendedrealnumbers"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 28-00, 12D99) states: The extended real numbers are the real numbers together with + ∞ (or simply ∞ ) and - ∞ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.measurablespace","kind":"concept","label":"Measurable space","sources":[{"id":"planetmath.measurablespace","title":"PlanetMath entry measurablespace","url":"https://planetmath.org/measurablespace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 28A33) states: A measurable space is a set E together with a collection ℬ of subsets of E which is a sigma algebra .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.probabilitydistributionfunction","kind":"concept","label":"Probability distribution function","sources":[{"id":"planetmath.probabilitydistributionfunction","title":"PlanetMath entry probabilitydistributionfunction","url":"https://planetmath.org/probabilitydistributionfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 60E99) states: 1 Definition Let ( Ω , 𝔅 , μ ) be a measure space . A probability distribution function on Ω is a function f : Ω ⟶ ℝ such that: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.commutativelanguage","kind":"concept","label":"Commutative language","sources":[{"id":"planetmath.commutativelanguage","title":"PlanetMath entry commutativelanguage","url":"https://planetmath.org/commutativelanguage"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q70) states: Let Σ be an alphabet and u a word over Σ . Write u as a product of symbols in Σ : u = a 1 ⁢ ⋯ ⁢ a n where a i ∈ Σ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismoflanguages","kind":"concept","label":"Homomorphism of languages","sources":[{"id":"planetmath.homomorphismoflanguages","title":"PlanetMath entry homomorphismoflanguages","url":"https://planetmath.org/homomorphismoflanguages"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q45) states: Let Σ 1 and Σ 2 be two alphabets . A function h : Σ 1 * → Σ 2 * is called a homomorphism if it is a semigroup homomorphism from semigroups Σ 1 * to Σ 2 * .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.mcalistercoveringtheorem","kind":"theory","label":"McAlister covering theorem","sources":[{"id":"planetmath.mcalistercoveringtheorem","title":"PlanetMath entry mcalistercoveringtheorem","url":"https://planetmath.org/mcalistercoveringtheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 20M18) states: A subset X in an inverse semigroup S is called unitary if for any elements x ∈ X and s ∈ S , x ⁢ s ∈ X or s ⁢ x ∈ X implies s ∈ X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monoid","kind":"concept","label":"Monoid","sources":[{"id":"planetmath.monoid","title":"PlanetMath entry monoid","url":"https://planetmath.org/monoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99, 34-01) states: A monoid is a semigroup G which contains an identity element ; that is, there exists an element e ∈ G such that e ⋅ a = a ⋅ e = a for all a ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.quotientgroup","kind":"concept","label":"Quotient group","sources":[{"id":"planetmath.quotientgroup","title":"PlanetMath entry quotientgroup","url":"https://planetmath.org/quotientgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20-00) states: Before defining quotient groups , some preliminary definitions must be introduced and a few established.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.semigroup","kind":"concept","label":"Semigroup","sources":[{"id":"planetmath.semigroup","title":"PlanetMath entry semigroup","url":"https://planetmath.org/semigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99) states: A semigroup G is a set together with a binary operation ⋅ : G × G ⟶ G which satisfies the associative property: ( a ⋅ b ) ⋅ c = a ⋅ ( b ⋅ c ) for all a , b , c ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.biops","kind":"concept","label":"Biops","sources":[{"id":"planetmath.biops","title":"PlanetMath entry biops","url":"https://planetmath.org/biops"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A99) states: Let S be a set and n ∈ 𝐍 . Set 𝐍 n := { i ∈ 𝐍 | i < n } . If there exists a map ⋅ : 𝐍 n → ( S 2 → S ) : i ↦ ⋅ i where ⋅ i : S 2 → S : ( a , b ) ↦ a ⋅ i b is a binary operation , then I shall say that ( S , ⋅ ) is an n -biops .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.division","kind":"concept","label":"Division","sources":[{"id":"planetmath.division","title":"PlanetMath entry division","url":"https://planetmath.org/division"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05, 12E99) states: Division is the operation which assigns to every two numbers (or more generally, elements of a field) a and b their quotient or ratio, provided that the latter, b , is distinct from zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.expression","kind":"concept","label":"Expression","sources":[{"id":"planetmath.expression","title":"PlanetMath entry expression","url":"https://planetmath.org/expression"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: An expression is a symbol or of symbols used to denote a quantity or value.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.characteristicsubgroup","kind":"concept","label":"Characteristic subgroup","sources":[{"id":"planetmath.characteristicsubgroup","title":"PlanetMath entry characteristicsubgroup","url":"https://planetmath.org/characteristicsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: If ( G , * ) is a group, then H is a characteristic subgroup of G (written H ⁢ char ⁡ G ) if every automorphism of G maps H to itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sectionofagroup","kind":"concept","label":"Section of a group","sources":[{"id":"planetmath.sectionofagroup","title":"PlanetMath entry sectionofagroup","url":"https://planetmath.org/sectionofagroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20F99) states: A section of a group G is a quotient ( http://planetmath.org/QuotientGroup ) of a subgroup of G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.singleton","kind":"concept","label":"Singleton","sources":[{"id":"planetmath.singleton","title":"PlanetMath entry singleton","url":"https://planetmath.org/singleton"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A singleton is a set containing a single element.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.variable","kind":"concept","label":"Variable","sources":[{"id":"planetmath.variable","title":"PlanetMath entry variable","url":"https://planetmath.org/variable"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: The word variable as used in mathematics (and in other scientific fields that use mathematics) is somewhat vague and may have different meanings depending on the context .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.grouprepresentation","kind":"concept","label":"Group representation","sources":[{"id":"planetmath.grouprepresentation","title":"PlanetMath entry grouprepresentation","url":"https://planetmath.org/grouprepresentation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20C99) states: Let G be a group, and let V be a vector space . A representation of G in V is a group homomorphism ρ : G → GL ⁡ ( V ) from G to the general linear group GL ⁡ ( V ) of invertible linear transformations of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closureofasubsetunderrelations","kind":"concept","label":"Closure of a subset under relations","sources":[{"id":"planetmath.closureofasubsetunderrelations","title":"PlanetMath entry closureofasubsetunderrelations","url":"https://planetmath.org/closureofasubsetunderrelations"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A02) states: Let A be a set and R be an n -ary relation on A , n ≥ 1 . A subset B of A is said to be closed under R , or R -closed , if, whenever b 1 , … , b n - 1 ∈ B , and ( b 1 , … , b n - 1 , b n ) ∈ R , then b n ∈ B .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.coset","kind":"concept","label":"Coset","sources":[{"id":"planetmath.coset","title":"PlanetMath entry coset","url":"https://planetmath.org/coset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: Let H be a subgroup of a group G , and let a ∈ G . The left coset of a with respect to H in G is defined to be the set a ⁢ H := { a ⁢ h ∣ h ∈ H } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.leftidentityandrightidentity","kind":"concept","label":"Left identity and right identity","sources":[{"id":"planetmath.leftidentityandrightidentity","title":"PlanetMath entry leftidentityandrightidentity","url":"https://planetmath.org/leftidentityandrightidentity"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02, 20M99) states: Let G be a groupoid . An element e ∈ G is called a left identity element if e ⁢ x = x for all x ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.conceptsinabstractalgebra","kind":"concept","label":"Concepts in abstract algebra","sources":[{"id":"planetmath.conceptsinabstractalgebra","title":"PlanetMath entry conceptsinabstractalgebra","url":"https://planetmath.org/conceptsinabstractalgebra"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55-00, 18-00, 16-00, 13-00, 20-00, 15-00) states: The aim of this entry is to present a list of the key operators used in abstract algebra .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.euclideanspace","kind":"concept","label":"Euclidean space","sources":[{"id":"planetmath.euclideanspace","title":"PlanetMath entry euclideanspace","url":"https://planetmath.org/euclideanspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03, 51M05) states: 1 Definition Euclidean n -space is a metric space ( E , d ) with the property that the group of isometries is transitive and is isomorphic to an n -dimensional Euclidean vector space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fractionalidealofcommutativering","kind":"concept","label":"Fractional ideal of commutative ring","sources":[{"id":"planetmath.fractionalidealofcommutativering","title":"PlanetMath entry fractionalidealofcommutativering","url":"https://planetmath.org/fractionalidealofcommutativering"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B30) states: Definition. Let R be a commutative ring having a regular element and let T be the total ring of fractions of R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.invertiblelineartransformation","kind":"concept","label":"Invertible linear transformation","sources":[{"id":"planetmath.invertiblelineartransformation","title":"PlanetMath entry invertiblelineartransformation","url":"https://planetmath.org/invertiblelineartransformation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: An invertible linear transformation is a linear transformation T : V ⟶ W which is a bijection .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.matrixinverse","kind":"concept","label":"Matrix inverse","sources":[{"id":"planetmath.matrixinverse","title":"PlanetMath entry matrixinverse","url":"https://planetmath.org/matrixinverse"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A09) states: 1 Matrix Inverse The inverse of an n × n matrix A is denoted by A - 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subalgebraofanalgebraicsystem","kind":"concept","label":"Subalgebra of an algebraic system","sources":[{"id":"planetmath.subalgebraofanalgebraicsystem","title":"PlanetMath entry subalgebraofanalgebraicsystem","url":"https://planetmath.org/subalgebraofanalgebraicsystem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A30, 08A05, 08A62) states: Let ( A , O ) be an algebraic system ( A ≠ ∅ is the underlying set and O is the set of operators on A ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.higherorderfunction","kind":"concept","label":"Higher-order function","sources":[{"id":"planetmath.higherorderfunction","title":"PlanetMath entry higherorderfunction","url":"https://planetmath.org/higherorderfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68Q01) states: Any function that maps a function to anything or maps anything to a function is a higher-order function .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.crossproduct","kind":"concept","label":"Cross product","sources":[{"id":"planetmath.crossproduct","title":"PlanetMath entry crossproduct","url":"https://planetmath.org/crossproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A90, 15A72) states: \\PMlinkescapephrase imaginary part \\PMlinkescapephrase real part \\PMlinkescapephrase spanned by The cross product (or vector product ) of two vectors in ℝ 3 is a vector http://planetmath.org/node/1285 orthogonal to the plane of the two vectors being crossed, whose magnitude is equal to the area of the parallelogram defined by the two vectors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimension","kind":"concept","label":"Dimension","sources":[{"id":"planetmath.dimension","title":"PlanetMath entry dimension","url":"https://planetmath.org/dimension"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 00-01, 15A03, 54F45) states: The word dimension in mathematics has many definitions, but all of them are trying to quantify our intuition that, for example, a sheet of paper has somehow one less dimension than a stack of papers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dotproduct","kind":"concept","label":"Dot product","sources":[{"id":"planetmath.dotproduct","title":"PlanetMath entry dotproduct","url":"https://planetmath.org/dotproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 83C05, 15A63, 14-02, 14-01) states: Let u = ( u 1 , u 2 , … , u n ) and v = ( v 1 , v 2 , … , v n ) two vectors on k n where k is a field (like ℝ or ℂ ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.inversenumber","kind":"concept","label":"Inverse number","sources":[{"id":"planetmath.inversenumber","title":"PlanetMath entry inversenumber","url":"https://planetmath.org/inversenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12E99, 00A05) states: The inverse number or reciprocal number of a non-zero real or complex number a may be denoted by a - 1 , and it the quotient 1 a (so, it is really the - 1 th power of a ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorproductingeneralvectorspaces","kind":"concept","label":"Vector product in general vector spaces","sources":[{"id":"planetmath.vectorproductingeneralvectorspaces","title":"PlanetMath entry vectorproductingeneralvectorspaces","url":"https://planetmath.org/vectorproductingeneralvectorspaces"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A72) states: The vector product can be defined in any finite dimensional vector space V with dim ⁡ V = n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorsubspace","kind":"concept","label":"Vector subspace","sources":[{"id":"planetmath.vectorsubspace","title":"PlanetMath entry vectorsubspace","url":"https://planetmath.org/vectorsubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Definition Let V be a vector space over a field F , and let W be a subset of V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bicyclicsemigroup","kind":"concept","label":"Bicyclic semigroup","sources":[{"id":"planetmath.bicyclicsemigroup","title":"PlanetMath entry bicyclicsemigroup","url":"https://planetmath.org/bicyclicsemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M99) states: The bicyclic semigroup 𝒞 ⁢ ( p , q ) is the monoid generated by { p , q } with the single relation p ⁢ q = 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.classicalringofquotients","kind":"concept","label":"Classical ring of quotients","sources":[{"id":"planetmath.classicalringofquotients","title":"PlanetMath entry classicalringofquotients","url":"https://planetmath.org/classicalringofquotients"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16U20, 16S90) states: Let R be a ring. An element of R is called regular if it is not a right zero divisor or a left zero divisor in R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ideal1","kind":"concept","label":"Ideal","sources":[{"id":"planetmath.ideal1","title":"PlanetMath entry ideal1","url":"https://planetmath.org/ideal1"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M12, 20M10) states: Let S be a semigroup . An ideal of S is a non-empty subset of S which is closed under multiplication on either side by elements of S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idempotency","kind":"concept","label":"Idempotency","sources":[{"id":"planetmath.idempotency","title":"PlanetMath entry idempotency","url":"https://planetmath.org/idempotency"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20N02) states: If ( S , * ) is a magma, then an element x ∈ S is said to be idempotent if x * x = x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idempotent","kind":"concept","label":"Idempotent","sources":[{"id":"planetmath.idempotent","title":"PlanetMath entry idempotent","url":"https://planetmath.org/idempotent"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16U99, 20M99) states: An element x of a ring is called an idempotent element , or simply an idempotent if x 2 = x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.principalideal","kind":"concept","label":"Principal ideal","sources":[{"id":"planetmath.principalideal","title":"PlanetMath entry principalideal","url":"https://planetmath.org/principalideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13A15, 16D25, 81-00, 82-00, 83-00, 46L05) states: Let R be a ring and let a ∈ R . The principal left (resp.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.regularspace","kind":"concept","label":"Regular space","sources":[{"id":"planetmath.regularspace","title":"PlanetMath entry regularspace","url":"https://planetmath.org/regularspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: Definition 1 . A topological space is a regular space if it is both a T 0 space ( http://planetmath.org/T0Space ) and a T 3 space ( http://planetmath.org/T3Space ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.separationaxioms","kind":"concept","label":"Separation axioms","sources":[{"id":"planetmath.separationaxioms","title":"PlanetMath entry separationaxioms","url":"https://planetmath.org/separationaxioms"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10, 54D15) states: The separation axioms are additional conditions which may be required to a topological space in order to ensure that some particular types of sets can be separated by open sets , thus avoiding certain pathological cases.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetricinversesemigroup","kind":"concept","label":"Symmetric inverse semigroup","sources":[{"id":"planetmath.symmetricinversesemigroup","title":"PlanetMath entry symmetricinversesemigroup","url":"https://planetmath.org/symmetricinversesemigroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M18) states: Let X be a set. A partial map on X is an application defined from a subset of X into X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.t3space","kind":"concept","label":"T3 space","sources":[{"id":"planetmath.t3space","title":"PlanetMath entry t3space","url":"https://planetmath.org/t3space"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D10) states: A regular space is a topological space in which points and closed sets can be separated by open sets ; in other words, given a closed set A and a point x ∉ A , there are disjoint open sets U and V such that x ∈ U and A ⊆ V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tychonoffspace","kind":"concept","label":"Tychonoff space","sources":[{"id":"planetmath.tychonoffspace","title":"PlanetMath entry tychonoffspace","url":"https://planetmath.org/tychonoffspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D15) states: A topological space X is said to be completely regular if whenever C ⊆ X is closed and x ∈ X ∖ C then there is a continuous function f : X → [ 0 , 1 ] with f ⁢ ( x ) = 0 and f ⁢ ( C ) ⊆ { 1 } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vonneumannregular","kind":"concept","label":"Von Neumann regular","sources":[{"id":"planetmath.vonneumannregular","title":"PlanetMath entry vonneumannregular","url":"https://planetmath.org/vonneumannregular"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16E50) states: An element a of a ring R is said to be von Neumann regular if there exists b ∈ R such that a ⁢ b ⁢ a = a .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.maximalsubgroup","kind":"concept","label":"Maximal subgroup","sources":[{"id":"planetmath.maximalsubgroup","title":"PlanetMath entry maximalsubgroup","url":"https://planetmath.org/maximalsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20E28) states: Let G be a group. A subgroup H of G is said to be a maximal subgroup of G if H ≠ G and there is no subgroup K of G such that H < K < G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.idealgeneratedbyasubsetofaring","kind":"concept","label":"Ideal generated by a subset of a ring","sources":[{"id":"planetmath.idealgeneratedbyasubsetofaring","title":"PlanetMath entry idealgeneratedbyasubsetofaring","url":"https://planetmath.org/idealgeneratedbyasubsetofaring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D25) states: Let X be a subset of a ring R . Let S = { I k } be the collection of all left ideals of R that contain X (note that the set is nonempty since X ⊂ R and R is an ideal in itself).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.integraldomain","kind":"concept","label":"Integral domain","sources":[{"id":"planetmath.integraldomain","title":"PlanetMath entry integraldomain","url":"https://planetmath.org/integraldomain"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13G05) states: An integral domain , or domain , is a commutative cancellation ring with an identity element 1 ≠ 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.latticeideal","kind":"concept","label":"Lattice ideal","sources":[{"id":"planetmath.latticeideal","title":"PlanetMath entry latticeideal","url":"https://planetmath.org/latticeideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06B10) states: Let L be a lattice . An ideal I of L is a non-empty subset of L such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderideal","kind":"concept","label":"Order ideal","sources":[{"id":"planetmath.orderideal","title":"PlanetMath entry orderideal","url":"https://planetmath.org/orderideal"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06, 06A12) states: Order Ideals and Filters Let P be a poset. A subset I of P is said to be an order ideal if • I is a lower set : ↓ I = I , and • I is a directed set : I is non-empty, and every pair of elements in I has an upper bound in I .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.polynomialringoverintegraldomain","kind":"theory","label":"Polynomial ring over integral domain","sources":[{"id":"planetmath.polynomialringoverintegraldomain","title":"PlanetMath entry polynomialringoverintegraldomain","url":"https://planetmath.org/polynomialringoverintegraldomain"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 13P05) states: Theorem . If the coefficient ring R is an integral domain , then so is also its polynomial ring R ⁢ [ X ] .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.zerodivisor","kind":"concept","label":"Zero divisor","sources":[{"id":"planetmath.zerodivisor","title":"PlanetMath entry zerodivisor","url":"https://planetmath.org/zerodivisor"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13G05) states: Let a be a nonzero element of a ring R . The element a is a left zero divisor if there exists a nonzero element b ∈ R such that a ⋅ b = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.canonicalprojection","kind":"concept","label":"Canonical projection","sources":[{"id":"planetmath.canonicalprojection","title":"PlanetMath entry canonicalprojection","url":"https://planetmath.org/canonicalprojection"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20-00) states: Given a group G and a normal subgroup N ⊲ G there is an epimorphism π : G → G / N defined by sending an element g ∈ G to its coset g ⁢ N .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.involutoryring","kind":"concept","label":"Involutory ring","sources":[{"id":"planetmath.involutoryring","title":"PlanetMath entry involutoryring","url":"https://planetmath.org/involutoryring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16W10) states: General Definition of a Ring with Involution Let R be a ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.noncommutativestructure","kind":"concept","label":"Non-commutative structure","sources":[{"id":"planetmath.noncommutativestructure","title":"PlanetMath entry noncommutativestructure","url":"https://planetmath.org/noncommutativestructure"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55-00, 18-00) states: Definition 0.1 . Let ( C , ∘ ) be a structure consisting of a class , C , together with a binary operation ∘ defined for pairs of objects in C (or elements of C when the latter is a small class, i.e., a set).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subcommutative","kind":"concept","label":"Subcommutative","sources":[{"id":"planetmath.subcommutative","title":"PlanetMath entry subcommutative","url":"https://planetmath.org/subcommutative"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20M25, 20M99) states: A semigroup ( S , ⋅ ) is said to be left subcommutative if for any two of its elements a and b , there exists its element c such that a ⁢ b = c ⁢ a .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.compositenumber","kind":"concept","label":"Composite number","sources":[{"id":"planetmath.compositenumber","title":"PlanetMath entry compositenumber","url":"https://planetmath.org/compositenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A41) states: A composite number is a positive integer which is not prime and not equal to 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.goldenratio","kind":"concept","label":"Golden ratio","sources":[{"id":"planetmath.goldenratio","title":"PlanetMath entry goldenratio","url":"https://planetmath.org/goldenratio"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 40A05, 11B39) states: The “ Golden Ratio ”, or ϕ , has the value 1.61803398874989484820 ⁢ … This number gets its rather illustrious name from the fact that the Greeks thought that a rectangle with ratio of side lengths equal to ϕ was the most pleasing to the eye, and much of classical Greek architecture is based on this premise .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sphenicnumber","kind":"concept","label":"Sphenic number","sources":[{"id":"planetmath.sphenicnumber","title":"PlanetMath entry sphenicnumber","url":"https://planetmath.org/sphenicnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A05) states: Given three primes p < q < r , the composite integer p ⁢ q ⁢ r is a sphenic number .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.welldefined","kind":"concept","label":"Well-defined","sources":[{"id":"planetmath.welldefined","title":"PlanetMath entry welldefined","url":"https://planetmath.org/welldefined"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A mathematical concept is well-defined (German wohldefiniert , French bien défini ), if its contents is on the form or the alternative representative which is used for defining it.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.nearring","kind":"concept","label":"Near-ring","sources":[{"id":"planetmath.nearring","title":"PlanetMath entry nearring","url":"https://planetmath.org/nearring"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16Y30) states: Definitions A near-ring is a set ( http://planetmath.org/Set ) N together with two binary operations , denoted + : N × N → N and ⋅ : N × N → N , such that 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.annihilator","kind":"concept","label":"Annihilator","sources":[{"id":"planetmath.annihilator","title":"PlanetMath entry annihilator","url":"https://planetmath.org/annihilator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D10) states: Let R be a ring, and suppose that M is a left R -module and N a right R -module.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderpreservingmap","kind":"concept","label":"Order-preserving map","sources":[{"id":"planetmath.orderpreservingmap","title":"PlanetMath entry orderpreservingmap","url":"https://planetmath.org/orderpreservingmap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06) states: Order-preserving map from a poset L to a poset M is a function f such that ∀ x , y ∈ L : ( x ≥ y ⟹ f ( x ) ≥ f ( y ) ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.preorder","kind":"concept","label":"Pre-order","sources":[{"id":"planetmath.preorder","title":"PlanetMath entry preorder","url":"https://planetmath.org/preorder"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A99) states: Definition A pre-order on a set S is a relation ≲ on S satisfying the following two axioms: reflexivity : s ≲ s for all s ∈ S , and transitivity : If s ≲ t and t ≲ u , then s ≲ u ; for all s , t , u ∈ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.fixedpointarithmetic","kind":"concept","label":"Fixed-point arithmetic","sources":[{"id":"planetmath.fixedpointarithmetic","title":"PlanetMath entry fixedpointarithmetic","url":"https://planetmath.org/fixedpointarithmetic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A63) states: For computation or display in fixed-point arithmetic , each real number x has a variable number k > 0 of integer digits d k - 1 , … , d 0 (in order left to right from the most to the least significant digit) in base b but always l fractional digits to the right of the point.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.infixnotation","kind":"concept","label":"Infix notation","sources":[{"id":"planetmath.infixnotation","title":"PlanetMath entry infixnotation","url":"https://planetmath.org/infixnotation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: Infix notation is how we usually read and write arithmetic expressions .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.negativenumber","kind":"concept","label":"Negative number","sources":[{"id":"planetmath.negativenumber","title":"PlanetMath entry negativenumber","url":"https://planetmath.org/negativenumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A negative number is a number that is less than zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.closuremap","kind":"concept","label":"Closure map","sources":[{"id":"planetmath.closuremap","title":"PlanetMath entry closuremap","url":"https://planetmath.org/closuremap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05, 06A15) states: Let P be a poset. A function c : P → P is called a closure map if • c is order preserving, • 1 P ≤ c , • c is idempotent : c ∘ c = c .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.irrational","kind":"concept","label":"Irrational","sources":[{"id":"planetmath.irrational","title":"PlanetMath entry irrational","url":"https://planetmath.org/irrational"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11J82, 11J72) states: An irrational number is a real number which cannot be represented as a ratio of two integers .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.iterator","kind":"concept","label":"Iterator","sources":[{"id":"planetmath.iterator","title":"PlanetMath entry iterator","url":"https://planetmath.org/iterator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 68N15) states: An iterator is a variable that one by one takes on all the values (usually integers) in a given range.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.lemma","kind":"concept","label":"Lemma","sources":[{"id":"planetmath.lemma","title":"PlanetMath entry lemma","url":"https://planetmath.org/lemma"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: There is no technical distinction a lemma, a proposition , and a theorem .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.perfectset","kind":"concept","label":"Perfect set","sources":[{"id":"planetmath.perfectset","title":"PlanetMath entry perfectset","url":"https://planetmath.org/perfectset"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: A set is called perfect if it is equal to the set of its limit points .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.summation","kind":"concept","label":"Summation","sources":[{"id":"planetmath.summation","title":"PlanetMath entry summation","url":"https://planetmath.org/summation"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 11B25, 00A05) states: Sigma notation Sigma notation is often used to write complicated sums in a concise and compact way.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.arithmetic","kind":"concept","label":"Arithmetic","sources":[{"id":"planetmath.arithmetic","title":"PlanetMath entry arithmetic","url":"https://planetmath.org/arithmetic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: Arithmetic is ” the science of numbers and operations on sets of numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.compact","kind":"concept","label":"Compact","sources":[{"id":"planetmath.compact","title":"PlanetMath entry compact","url":"https://planetmath.org/compact"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D30, 81-00, 83-00, 82-00, 46L05, 22A22) states: A topological space X is compact if, for every collection { U i } i ∈ I of open sets in X whose union is X , there exists a finite subcollection { U i j } j = 1 n whose union is also X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.mathematica","kind":"concept","label":"Mathematica","sources":[{"id":"planetmath.mathematica","title":"PlanetMath entry mathematica","url":"https://planetmath.org/mathematica"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 68W30) states: Mathematica is a computer algebra system produced by Wolfram Research.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multiplicationoperator","kind":"concept","label":"Multiplication operator","sources":[{"id":"planetmath.multiplicationoperator","title":"PlanetMath entry multiplicationoperator","url":"https://planetmath.org/multiplicationoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A99) states: A multiplication operator is an operator signifying multiplication among two or more operands.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.oddnumber","kind":"concept","label":"Odd number","sources":[{"id":"planetmath.oddnumber","title":"PlanetMath entry oddnumber","url":"https://planetmath.org/oddnumber"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A51) states: An odd number n is an integer of the form 2 ⁢ m + 1 , and as such it is not divisible by 2.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.positiveelement","kind":"concept","label":"Positive element","sources":[{"id":"planetmath.positiveelement","title":"PlanetMath entry positiveelement","url":"https://planetmath.org/positiveelement"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46L05, 47L07, 47A05) states: Let H be a complex Hilbert space . Let T : H ⟶ H be a bounded operator in H .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tacitmultiplicationoperator","kind":"concept","label":"Tacit multiplication operator","sources":[{"id":"planetmath.tacitmultiplicationoperator","title":"PlanetMath entry tacitmultiplicationoperator","url":"https://planetmath.org/tacitmultiplicationoperator"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11A99) states: A tacit multiplication operator is a multiplication operator not actually written in a formula but usually understood from the context , at least by humans.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologyofthecomplexplane","kind":"concept","label":"Topology of the complex plane","sources":[{"id":"planetmath.topologyofthecomplexplane","title":"PlanetMath entry topologyofthecomplexplane","url":"https://planetmath.org/topologyofthecomplexplane"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 30-00) states: The usual topology for the complex plane ℂ is the topology induced by the metric d ⁢ ( x , y ) := | x - y | for x , y ∈ ℂ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finiteintersectionproperty","kind":"concept","label":"Finite intersection property","sources":[{"id":"planetmath.finiteintersectionproperty","title":"PlanetMath entry finiteintersectionproperty","url":"https://planetmath.org/finiteintersectionproperty"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D30) states: A collection 𝒜 = { A α } α ∈ I of subsets of a set X is said to have the finite intersection property , abbreviated f.i.p., if every finite subcollection { A 1 , A 2 , … , A n } of 𝒜 satisifes ⋂ i = 1 n A i ≠ ∅ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.limitpoint","kind":"concept","label":"Limit point","sources":[{"id":"planetmath.limitpoint","title":"PlanetMath entry limitpoint","url":"https://planetmath.org/limitpoint"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let X be a topological space , and let A ⊆ X . An element x ∈ X is said to be a limit point of A if every open set containing x also contains at least one point of A distinct from x .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.net","kind":"concept","label":"Net","sources":[{"id":"planetmath.net","title":"PlanetMath entry net","url":"https://planetmath.org/net"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A20) states: Let X be a set. A net is a map from a directed set to X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.cover","kind":"concept","label":"Cover","sources":[{"id":"planetmath.cover","title":"PlanetMath entry cover","url":"https://planetmath.org/cover"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Definition ( [ 1 ] , pp. 49) Let Y be a subset of a set X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.boxtopology","kind":"concept","label":"Box topology","sources":[{"id":"planetmath.boxtopology","title":"PlanetMath entry boxtopology","url":"https://planetmath.org/boxtopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let { ( X α , 𝒯 α ) } α ∈ A be a family of topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.discrete","kind":"concept","label":"Discrete","sources":[{"id":"planetmath.discrete","title":"PlanetMath entry discrete","url":"https://planetmath.org/discrete"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A05) states: This entry aims at highlighting the fact that all uses of the word discrete in mathematics are directly related to the core concept of discrete space : • A discrete set is a set that, endowed with the topology implied by the context, is a \\PMlinkescaptetext discrete space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.egyptianfraction","kind":"concept","label":"Egyptian fraction","sources":[{"id":"planetmath.egyptianfraction","title":"PlanetMath entry egyptianfraction","url":"https://planetmath.org/egyptianfraction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A35, 01A30, 01A20, 01A16) states: This narrative reports rational number as a/b rather than in the standard LaTeX fraction form.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hibehpapyrus","kind":"concept","label":"Hibeh Papyrus","sources":[{"id":"planetmath.hibehpapyrus","title":"PlanetMath entry hibehpapyrus","url":"https://planetmath.org/hibehpapyrus"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A20, 01A16, 01A15) states: The http://mathforum.org/kb/plaintext.jspa?messageID=5539288 Hibeh Papyrus was written between 300 BCE to 270 BCE by a Greek scribe that lived in Hellenized Egypt.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.liberabaci","kind":"concept","label":"Liber Abaci","sources":[{"id":"planetmath.liberabaci","title":"PlanetMath entry liberabaci","url":"https://planetmath.org/liberabaci"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A35) states: Abstract (2015 Update): The “ Liber Abaci ”, a 1202 AD Latin text, primarily scaled vulgar fractions n/p to unit fraction by seven distinctions in a subtraction context .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.planetmath","kind":"concept","label":"PlanetMath","sources":[{"id":"planetmath.planetmath","title":"PlanetMath entry planetmath","url":"https://planetmath.org/planetmath"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 01A65, 01A61) states: PlanetMath is a free, collaborative, online mathematics encyclopedia.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.hyperconnectedspace","kind":"concept","label":"Hyperconnected space","sources":[{"id":"planetmath.hyperconnectedspace","title":"PlanetMath entry hyperconnectedspace","url":"https://planetmath.org/hyperconnectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be hyperconnected if no pair of nonempty open sets of X is disjoint (or, equivalently, if X is not the union of two proper closed sets ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.pseudometrictopology","kind":"concept","label":"Pseudometric topology","sources":[{"id":"planetmath.pseudometrictopology","title":"PlanetMath entry pseudometrictopology","url":"https://planetmath.org/pseudometrictopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35) states: Let ( X , d ) be a pseudometric space . As in a metric space , we define B ε ⁢ ( x ) = { y ∈ X ∣ d ⁢ ( x , y ) < ε } .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sequentiallycompact","kind":"concept","label":"Sequentially compact","sources":[{"id":"planetmath.sequentiallycompact","title":"PlanetMath entry sequentiallycompact","url":"https://planetmath.org/sequentiallycompact"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 40A05, 54D30) states: A topological space X is sequentially compact if every sequence in X has a convergent subsequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ultraconnectedspace","kind":"concept","label":"Ultraconnected space","sources":[{"id":"planetmath.ultraconnectedspace","title":"PlanetMath entry ultraconnectedspace","url":"https://planetmath.org/ultraconnectedspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54D05) states: A topological space X is said to be ultraconnected if no pair of nonempty closed sets of X is disjoint.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.algebraicgeometry","kind":"concept","label":"Algebraic geometry","sources":[{"id":"planetmath.algebraicgeometry","title":"PlanetMath entry algebraicgeometry","url":"https://planetmath.org/algebraicgeometry"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 14-00) states: Introduction Algebraic geometry is the study of algebraic objects using geometrical tools.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.amsmscclassificationofarticlesandconversiontables","kind":"concept","label":"AMS MSC classification of articles and conversion tables","sources":[{"id":"planetmath.amsmscclassificationofarticlesandconversiontables","title":"PlanetMath entry amsmscclassificationofarticlesandconversiontables","url":"https://planetmath.org/amsmscclassificationofarticlesandconversiontables"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 00-02, 00-01) states: 1 Links to the AMS MSC 2010 Classification PDF of all MSC entries available, and the AMS MSC website Because the AMS MSC classification list or table does not seem to be available at present when creating a new entry two links are here provided to the AMS websites that list the complete Table of AMS MSC2010 classifications: http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf All MSC 2010 in one PDF : http://www.ams.org/mathscinet/msc/msc2010.html The AMS MSC website with its maths specialized Search Engine 1.1 Conversion Tables http://www.ams.org/mathscinet/msc/pdfs/classifications2010.pdf CONVERSIONS: http://www.ams.org/mathscinet/msc/conv.html?from=2000 M ⁢ S ⁢ C ⁢ 2000 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s → M ⁢ S ⁢ C ⁢ 2010 ⁢ C ⁢ l ⁢ a ⁢ s ⁢ s ⁢ i ⁢ f ⁢ i ⁢ c ⁢ a ⁢ t ⁢ i ⁢ o ⁢ n ⁢ C ⁢ o ⁢ d ⁢ e ⁢ s ⁢ U ⁢ p ⁢ d ⁢ a ⁢ t ⁢ e .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.categoricalquantumlmlogicalgebras","kind":"concept","label":"Categorical quantum LM- logic algebras","sources":[{"id":"planetmath.categoricalquantumlmlogicalgebras","title":"PlanetMath entry categoricalquantumlmlogicalgebras","url":"https://planetmath.org/categoricalquantumlmlogicalgebras"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U99, 55U40, 55U35, 55U30, 81T05, 18A40, 18A15, 18A05, 18A99) states: \\xyoption curve 0.1 Quantum LM-algebraic Logic 0.1.1 Fundamental concepts of space and time in quantum theory vs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.connectedposet","kind":"concept","label":"Connected poset","sources":[{"id":"planetmath.connectedposet","title":"PlanetMath entry connectedposet","url":"https://planetmath.org/connectedposet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A07) states: Let P be a poset. Write a ⟂ b if either a ≤ b or b ≤ a . In other words, a ⟂ b if a and b are comparable .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dimensionofaposet","kind":"concept","label":"Dimension of a poset","sources":[{"id":"planetmath.dimensionofaposet","title":"PlanetMath entry dimensionofaposet","url":"https://planetmath.org/dimensionofaposet"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06A06, 06A07) states: Let P be a finite poset and ℛ be the family of all realizers of P .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.graphtheory","kind":"concept","label":"Graph theory","sources":[{"id":"planetmath.graphtheory","title":"PlanetMath entry graphtheory","url":"https://planetmath.org/graphtheory"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 81Q30, 18G30, 05C50, 55U10, 18-00, 05C25, 05C99) states: Graph theory is the branch of mathematics that concerns itself with graphs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupcohomologytopologicaldefinition","kind":"concept","label":"Group cohomology","sources":[{"id":"planetmath.groupcohomologytopologicaldefinition","title":"PlanetMath entry groupcohomologytopologicaldefinition","url":"https://planetmath.org/groupcohomologytopologicaldefinition"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N25) states: Let G be a topological group . Suppose some contractible space X admits a fixed point free action of G , so that the quotient map p : X → X / G is a fibre map .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homology","kind":"concept","label":"Homology","sources":[{"id":"planetmath.homology","title":"PlanetMath entry homology","url":"https://planetmath.org/homology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N10) states: Homology is the general name for a number of functors from topological spaces to abelian groups (or more generally modules over a fixed ring).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.quantumfieldtheoriesqft","kind":"concept","label":"Quantum field theories (QFT)","sources":[{"id":"planetmath.quantumfieldtheoriesqft","title":"PlanetMath entry quantumfieldtheoriesqft","url":"https://planetmath.org/quantumfieldtheoriesqft"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U99, 81T80, 81T75, 81T70, 81T60, 81T40, 81T25, 81T18, 81T13, 81T10, 81T05) states: This topic links the general framework of quantum field theories to group symmetries and other relevant mathematical concepts utilized to represent quantum fields and their fundamental properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.sectionofafiberbundle","kind":"concept","label":"Section of a fiber bundle","sources":[{"id":"planetmath.sectionofafiberbundle","title":"PlanetMath entry sectionofafiberbundle","url":"https://planetmath.org/sectionofafiberbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R10) states: Let p : E → B be a fiber bundle , denoted by ξ . A section of ξ is a continuous map s : B → E such that the composition p ∘ s equals the identity .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.textbookprojectsonplanetmath","kind":"concept","label":"Textbook projects on PlanetMath","sources":[{"id":"planetmath.textbookprojectsonplanetmath","title":"PlanetMath entry textbookprojectsonplanetmath","url":"https://planetmath.org/textbookprojectsonplanetmath"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: This will be a guide to textbook projects on PM. Since I don’t know if there currently are any textbook projects on PM, this is just a “stub” entry for now.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topicsinalgebraictopology","kind":"concept","label":"Topics in algebraic topology","sources":[{"id":"planetmath.topicsinalgebraictopology","title":"PlanetMath entry topicsinalgebraictopology","url":"https://planetmath.org/topicsinalgebraictopology"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 57R19, 57N65, 11F23, 11E72, 18-00, 55N30, 55N15, 55N99, 55N40, 55N20, 55-01) states: 1 Algebraic topology topics 1.1 Introduction Algebraic topology (AT) utilizes algebraic approaches to solve topological problems, such as the classification of surfaces , proving duality theorems for manifolds and approximation theorems for topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.toytheorem","kind":"concept","label":"Toy theorem","sources":[{"id":"planetmath.toytheorem","title":"PlanetMath entry toytheorem","url":"https://planetmath.org/toytheorem"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00-01) states: A toy theorem is a simplified version of a more general theorem .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.universalbundle","kind":"concept","label":"Universal bundle","sources":[{"id":"planetmath.universalbundle","title":"PlanetMath entry universalbundle","url":"https://planetmath.org/universalbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R10, 55R15) states: Let G be a topological group . A universal bundle for G is a principal bundle p : E ⁢ G → B ⁢ G such that for any principal bundle π : E → B , with B a CW-complex , there is a map φ : B → B ⁢ G , unique up to homotopy , such that the pullback bundle φ * ⁢ ( p ) is equivalent to π , that is such that there is a bundle map φ ′ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.vectorbundle","kind":"concept","label":"Vector bundle","sources":[{"id":"planetmath.vectorbundle","title":"PlanetMath entry vectorbundle","url":"https://planetmath.org/vectorbundle"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55R25) states: Basic definition A vector bundle is a fiber bundle having a vector space as a fiber and the general linear group of that vector space (or some subgroup ) as structure group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.interval","kind":"concept","label":"Interval","sources":[{"id":"planetmath.interval","title":"PlanetMath entry interval","url":"https://planetmath.org/interval"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D99, 26-00, 54C30) states: Loosely speaking, an interval is a part of the real numbers that start at one number and stops at another number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.orderedgeometry","kind":"concept","label":"Ordered geometry","sources":[{"id":"planetmath.orderedgeometry","title":"PlanetMath entry orderedgeometry","url":"https://planetmath.org/orderedgeometry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51G05) states: \\PMlinkescapephrase line segment \\PMlinkescapephrase generated by \\PMlinkescapephrase opposite sides \\PMlinkescapephrase end points 1 Definition Let ( A , B ) be a linear ordered geometry , where A = ( P , n , I ) is an incidence geometry , and B is a strict betweenness relation .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.convergentsequence","kind":"concept","label":"Convergent sequence","sources":[{"id":"planetmath.convergentsequence","title":"PlanetMath entry convergentsequence","url":"https://planetmath.org/convergentsequence"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54E35, 40A05) states: A sequence x 0 , x 1 , x 2 , … in a metric space ( X , d ) is a convergent sequence if there exists a point x ∈ X such that, for every real number ϵ > 0 , there exists a natural number N such that d ⁢ ( x , x n ) < ϵ for all n > N .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.initialtopology","kind":"concept","label":"Initial topology","sources":[{"id":"planetmath.initialtopology","title":"PlanetMath entry initialtopology","url":"https://planetmath.org/initialtopology"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54B99) states: Let X i , i ∈ I be any family of topological spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.subbasis","kind":"concept","label":"Subbasis","sources":[{"id":"planetmath.subbasis","title":"PlanetMath entry subbasis","url":"https://planetmath.org/subbasis"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 54A99) states: Let ( X , 𝒯 ) be a topological space . A subset 𝒜 ⊆ 𝒯 is said to be a subbasis if the collection ℬ of intersections of finitely many elements of 𝒜 is a basis ( http://planetmath.org/BasisTopologicalSpace ) for 𝒯 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.homomorphismbetweenalgebraicsystems","kind":"concept","label":"Homomorphism between algebraic systems","sources":[{"id":"planetmath.homomorphismbetweenalgebraicsystems","title":"PlanetMath entry homomorphismbetweenalgebraicsystems","url":"https://planetmath.org/homomorphismbetweenalgebraicsystems"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 08A05) states: Let ( A , O ) , ( B , O ) be two algebraic systems with operator set O .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.framegroupoid","kind":"concept","label":"Frame groupoid","sources":[{"id":"planetmath.framegroupoid","title":"PlanetMath entry framegroupoid","url":"https://planetmath.org/framegroupoid"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 18B40, 55U40) states: Definition 0.1 . Let 𝒢 be a groupoid , defined as usual by a category in which all morphisms are invertible , with the structure maps s , t : G 1 ⟶ G 0 , and u : G 0 ⟶ G 1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.groupoidrepresentation","kind":"concept","label":"Groupoid representation","sources":[{"id":"planetmath.groupoidrepresentation","title":"PlanetMath entry groupoidrepresentation","url":"https://planetmath.org/groupoidrepresentation"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 55N33, 55N20, 55P10, 22A22, 20L05, 55U40) states: Let q : E ⟶ M be a vector bundle , with E the total space , and M a smooth manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.normalsubgroup","kind":"concept","label":"Normal subgroup","sources":[{"id":"planetmath.normalsubgroup","title":"PlanetMath entry normalsubgroup","url":"https://planetmath.org/normalsubgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: A subgroup H of a group G is normal if a ⁢ H = H ⁢ a for all a ∈ G .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallycompacthausdorffspaces","kind":"concept","label":"Locally compact Hausdorff spaces","sources":[{"id":"planetmath.locallycompacthausdorffspaces","title":"PlanetMath entry locallycompacthausdorffspaces","url":"https://planetmath.org/locallycompacthausdorffspaces"}],"status":"reported","summary":"PlanetMath (topic entry, MSC 55U40, 55-00) states: 1 Locally compact Hausdorff spaces Definition 1.1 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.topologicalvectorspace","kind":"concept","label":"Topological vector space","sources":[{"id":"planetmath.topologicalvectorspace","title":"PlanetMath entry topologicalvectorspace","url":"https://planetmath.org/topologicalvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A99) states: Definition A topological vector space is a pair ( V , 𝒯 ) , where V is a vector space over a topological field K , and 𝒯 is a topology on V such that under 𝒯 the scalar multiplication ( λ , v ) ↦ λ ⁢ v is a continuous function K × V → V and the vector addition ( v , w ) ↦ v + w is a continuous function V × V → V , where K × V and V × V are given the respective product topologies .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finitelygeneratedgroup","kind":"concept","label":"Finitely generated group","sources":[{"id":"planetmath.finitelygeneratedgroup","title":"PlanetMath entry finitelygeneratedgroup","url":"https://planetmath.org/finitelygeneratedgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05) states: A finitely generated group is a group that has a finite generating set .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.finitelygeneratedmodule","kind":"concept","label":"Finitely generated module","sources":[{"id":"planetmath.finitelygeneratedmodule","title":"PlanetMath entry finitelygeneratedmodule","url":"https://planetmath.org/finitelygeneratedmodule"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 16D10) states: A module X over a ring R is said to be finitely generated if there is a finite subset Y of X such that Y spans X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.ringhomomorphism","kind":"concept","label":"Ring homomorphism","sources":[{"id":"planetmath.ringhomomorphism","title":"PlanetMath entry ringhomomorphism","url":"https://planetmath.org/ringhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13B10, 16B99, 81P05) states: Let R and S be rings. A ring homomorphism is a function f : R ⟶ S such that: • f ⁢ ( a + b ) = f ⁢ ( a ) + f ⁢ ( b ) for all a , b ∈ R • f ⁢ ( a ⋅ b ) = f ⁢ ( a ) ⋅ f ⁢ ( b ) for all a , b ∈ R A ring isomorphism is a ring homomorphism which is a bijection .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.convexfunction","kind":"concept","label":"Convex function","sources":[{"id":"planetmath.convexfunction","title":"PlanetMath entry convexfunction","url":"https://planetmath.org/convexfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 52A41, 26A51, 26B25, 55Q05, 18G30, 18B40, 20J05, 20E07, 18-01, 20L05) states: Definition Suppose Ω is a convex set in a vector space over ℝ (or ℂ ), and suppose f is a function f : Ω → ℝ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.innerproductspace","kind":"concept","label":"Inner product space","sources":[{"id":"planetmath.innerproductspace","title":"PlanetMath entry innerproductspace","url":"https://planetmath.org/innerproductspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46C99) states: An inner product space (or pre-Hilbert space ) is a vector space (over ℝ or ℂ ) with an inner product ⟨ ⋅ , ⋅ ⟩ .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.locallyconvextopologicalvectorspace","kind":"concept","label":"Locally convex topological vector space","sources":[{"id":"planetmath.locallyconvextopologicalvectorspace","title":"PlanetMath entry locallyconvextopologicalvectorspace","url":"https://planetmath.org/locallyconvextopologicalvectorspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46A03, 46-00) states: Definition Let V be a topological vector space over a subfield of the complex numbers (usually taken to be ℝ or ℂ ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.partiallyorderedgroup","kind":"concept","label":"Partially ordered group","sources":[{"id":"planetmath.partiallyorderedgroup","title":"PlanetMath entry partiallyorderedgroup","url":"https://planetmath.org/partiallyorderedgroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 06F05, 06F20, 06F15, 20F60) states: A partially ordered group is a group G that is a poset at the same time, such that if a , b ∈ G and a ≤ b , then 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.presentationofagroup","kind":"concept","label":"Presentation of a group","sources":[{"id":"planetmath.presentationofagroup","title":"PlanetMath entry presentationofagroup","url":"https://planetmath.org/presentationofagroup"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 20A05, 20F05) states: A presentation of a group G is a description of G in terms of generators and relations (sometimes also known as relators).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.sylvesterslaw","kind":"theory","label":"Sylvester’s law","sources":[{"id":"planetmath.sylvesterslaw","title":"PlanetMath entry sylvesterslaw","url":"https://planetmath.org/sylvesterslaw"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A03) states: Let V be an n -dimensional real vector space and let Q : V × V → ℝ be a symmetric quadratic form .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.seminorm","kind":"concept","label":"Seminorm","sources":[{"id":"planetmath.seminorm","title":"PlanetMath entry seminorm","url":"https://planetmath.org/seminorm"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46B20) states: Let V be a real, or a complex vector space , with K denoting the corresponding field of scalars.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.unitvector","kind":"concept","label":"Unit vector","sources":[{"id":"planetmath.unitvector","title":"PlanetMath entry unitvector","url":"https://planetmath.org/unitvector"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: A unit vector is a unit-length element of Euclidean space .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.invariantsubspace","kind":"concept","label":"Invariant subspace","sources":[{"id":"planetmath.invariantsubspace","title":"PlanetMath entry invariantsubspace","url":"https://planetmath.org/invariantsubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Let T : V → V be a linear transformation of a vector space V .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.stablesubspace","kind":"concept","label":"Stable subspace","sources":[{"id":"planetmath.stablesubspace","title":"PlanetMath entry stablesubspace","url":"https://planetmath.org/stablesubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 00A05) states: A subset S of a larger set T is said to a stable subset for a function f : T → T iff f ⁢ ( S ) ⊂ S .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.boundedfunction","kind":"concept","label":"Bounded function","sources":[{"id":"planetmath.boundedfunction","title":"PlanetMath entry boundedfunction","url":"https://planetmath.org/boundedfunction"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 46-00) states: Definition Suppose X is a nonempty set . Then a function f : X → ℂ is a if there exist a C < ∞ such that | f ⁢ ( x ) | < C for all x ∈ X .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearfunctional","kind":"concept","label":"Linear functional","sources":[{"id":"planetmath.linearfunctional","title":"PlanetMath entry linearfunctional","url":"https://planetmath.org/linearfunctional"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A99) states: Let V be a vector space over a field K . A linear functional (or linear form ) on V is a linear mapping ϕ : V → K , where K is thought of as a one-dimensional vector space over itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.adjointendomorphism","kind":"concept","label":"Adjoint endomorphism","sources":[{"id":"planetmath.adjointendomorphism","title":"PlanetMath entry adjointendomorphism","url":"https://planetmath.org/adjointendomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04, 15A63) states: Definition (the bilinear case). Let U be a finite-dimensional vector space over a field 𝕂 , and B : U × U → 𝕂 a symmetric , non-degenerate bilinear mapping , for example a real inner product .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.alternatingform","kind":"concept","label":"Alternating form","sources":[{"id":"planetmath.alternatingform","title":"PlanetMath entry alternatingform","url":"https://planetmath.org/alternatingform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A63) states: A bilinear form A on a vector space V (over a field k ) is called an alternating form if for all v ∈ V , A ⁢ ( v , v ) = 0 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.antisymmetricmapping","kind":"concept","label":"Antisymmetric mapping","sources":[{"id":"planetmath.antisymmetricmapping","title":"PlanetMath entry antisymmetricmapping","url":"https://planetmath.org/antisymmetricmapping"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69, 15A63) states: Let U and V be a vector spaces over a field K . A bilinear mapping B : U × U → V is said to be antisymmetric if B ⁢ ( u , u ) = 0 (1) for all u ∈ U .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.bilinearmap","kind":"concept","label":"Bilinear map","sources":[{"id":"planetmath.bilinearmap","title":"PlanetMath entry bilinearmap","url":"https://planetmath.org/bilinearmap"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13C99) states: Let R be a ring, and let M , N and P be modules over R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.characteristic","kind":"concept","label":"Characteristic","sources":[{"id":"planetmath.characteristic","title":"PlanetMath entry characteristic","url":"https://planetmath.org/characteristic"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12E99) states: Let ( F , + , ⋅ ) be a field. The characteristic Char ⁡ ( F ) of F is commonly given by one of three equivalent definitions : • if there is some positive integer n for which the result of adding any element to itself n times yields 0 , then the characteristic of the field is the least such n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.complementarysubspace","kind":"concept","label":"Complementary subspace","sources":[{"id":"planetmath.complementarysubspace","title":"PlanetMath entry complementarysubspace","url":"https://planetmath.org/complementarysubspace"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A03) states: Direct sum decomposition. Let U be a vector space , and V , W ⊂ U subspaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.dualhomomorphism","kind":"concept","label":"Dual homomorphism","sources":[{"id":"planetmath.dualhomomorphism","title":"PlanetMath entry dualhomomorphism","url":"https://planetmath.org/dualhomomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A72, 15A04) states: Definition. Let U , V be vector spaces over a field 𝕂 , and T : U → V be a homomorphism (a linear map ) between them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.euclideanfield","kind":"concept","label":"Euclidean field","sources":[{"id":"planetmath.euclideanfield","title":"PlanetMath entry euclideanfield","url":"https://planetmath.org/euclideanfield"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 12D15) states: An ordered field F is Euclidean if every non-negative element a ( a ≥ 0 ) is a square in F (there exists b ∈ F such that b 2 = a ).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.identitymatrix","kind":"concept","label":"Identity matrix","sources":[{"id":"planetmath.identitymatrix","title":"PlanetMath entry identitymatrix","url":"https://planetmath.org/identitymatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-01, 15A57) states: The n × n identity matrix I (or I n ) over a ring R (with an identity 1) is the square matrix with coefficients in R given by I = [ 1 0 ⋯ 0 0 1 ⋯ 0 0 0 ⋱ 0 0 0 ⋯ 1 ] , where the numeral “1” and “0” respectively represent the multiplicative and additive identities in R .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.innerproduct","kind":"concept","label":"Inner product","sources":[{"id":"planetmath.innerproduct","title":"PlanetMath entry innerproduct","url":"https://planetmath.org/innerproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 11E39, 15A63) states: An inner product on a vector space V over a field K (which must be either the field ℝ of real numbers or the field ℂ of complex numbers ) is a function ( , ) : V × V ⟶ K such that, for all k 1 , k 2 ∈ K and 𝐯 1 , 𝐯 2 , 𝐯 , 𝐰 ∈ V , the following properties hold: 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.monoidalcategory","kind":"concept","label":"Monoidal category","sources":[{"id":"planetmath.monoidalcategory","title":"PlanetMath entry monoidalcategory","url":"https://planetmath.org/monoidalcategory"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 81-00, 18-00, 18D10) states: A monoidal category is a category which has the structure of a monoid, that is, among the objects there is a binary operation which is associative and has an unique neutral or unit element.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.multilinear","kind":"concept","label":"Multi-linear","sources":[{"id":"planetmath.multilinear","title":"PlanetMath entry multilinear","url":"https://planetmath.org/multilinear"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69) states: Let V 1 , V 2 , … , V n , W be vector spaces over a field K .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.nondegeneratebilinearform","kind":"concept","label":"Non-degenerate bilinear form","sources":[{"id":"planetmath.nondegeneratebilinearform","title":"PlanetMath entry nondegeneratebilinearform","url":"https://planetmath.org/nondegeneratebilinearform"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 47A07, 15A63, 11E39) states: A bilinear form B over a vector space V is said to be non-degenerate when • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐱 ∈ V , then 𝐲 = 𝟎 , and • if B ⁢ ( 𝐱 , 𝐲 ) = 0 for all 𝐲 ∈ V , then 𝐱 = 𝟎 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.ranknullitytheorem","kind":"theory","label":"Rank-nullity theorem","sources":[{"id":"planetmath.ranknullitytheorem","title":"PlanetMath entry ranknullitytheorem","url":"https://planetmath.org/ranknullitytheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A03) states: Let V and W be vector spaces over the same field. If ϕ : V → W is a linear mapping , then dim ⁡ V = dim ⁡ ( ker ⁡ ϕ ) + dim ⁡ ( im ⁡ ϕ ) .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.planetmath.spectraltheorem","kind":"theory","label":"Spectral theorem","sources":[{"id":"planetmath.spectraltheorem","title":"PlanetMath entry spectraltheorem","url":"https://planetmath.org/spectraltheorem"}],"status":"reported","summary":"PlanetMath (theorem entry, MSC 15A23, 15A63, 15A18) states: Let U be a finite-dimensional , unitary space and let M : U → U be an endomorphism .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetricmatrix","kind":"concept","label":"Symmetric matrix","sources":[{"id":"planetmath.symmetricmatrix","title":"PlanetMath entry symmetricmatrix","url":"https://planetmath.org/symmetricmatrix"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15-00) states: Definition : Let A = ( a i ⁢ j ) be a square matrix of order n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.symmetry","kind":"concept","label":"Symmetry","sources":[{"id":"planetmath.symmetry","title":"PlanetMath entry symmetry","url":"https://planetmath.org/symmetry"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 51A10, 15A04, 51A15) states: Let V be a Euclidean vector space , F ⊆ V , and E : V → V be a Euclidean transformation that is not the identity map .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tensorproduct","kind":"concept","label":"Tensor product","sources":[{"id":"planetmath.tensorproduct","title":"PlanetMath entry tensorproduct","url":"https://planetmath.org/tensorproduct"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 13-00, 18-00) states: Summary. The tensor product is a formal bilinear multiplication of two modules or vector spaces .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.tensorproductvectorspaces","kind":"concept","label":"Tensor product (vector spaces)","sources":[{"id":"planetmath.tensorproductvectorspaces","title":"PlanetMath entry tensorproductvectorspaces","url":"https://planetmath.org/tensorproductvectorspaces"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A69) states: Definition . The classical conception of the tensor product operation involved finite dimensional vector spaces A , B , say over a field 𝕂 .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.planetmath.linearisomorphism","kind":"concept","label":"Linear isomorphism","sources":[{"id":"planetmath.linearisomorphism","title":"PlanetMath entry linearisomorphism","url":"https://planetmath.org/linearisomorphism"}],"status":"reported","summary":"PlanetMath (definition entry, MSC 15A04) states: Definition 1 . Suppose V and W are vector spaces and L : V → W is a linear map .","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044848","kind":"concept","label":"biological phase","sources":[{"id":"quickgo.go_0044848","title":"Gene Ontology term GO:0044848 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044848/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological phase as: A distinct period or stage in a biological process or cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043473","kind":"concept","label":"pigmentation","sources":[{"id":"quickgo.go_0043473","title":"Gene Ontology term GO:0043473 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043473/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigmentation as: The accumulation of pigment in an organism, tissue or cell, either by increased deposition or by increased number of cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0040007","kind":"concept","label":"growth","sources":[{"id":"quickgo.go_0040007","title":"Gene Ontology term GO:0040007 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0040007/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines growth as: The increase in size or mass of an entire organism, a part of an organism or a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016032","kind":"concept","label":"viral process","sources":[{"id":"quickgo.go_0016032","title":"Gene Ontology term GO:0016032 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016032/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral process as: A multi-organism process in which a virus is a participant. The other participant is the host. Includes infection of a host cell, replication of the viral genome, and assembly of progeny virus particles. In some cases the viral genetic material may integrate into the host genome and only subsequently, under particular circumstances, 'complete' its life cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022414","kind":"concept","label":"reproductive process","sources":[{"id":"quickgo.go_0022414","title":"Gene Ontology term GO:0022414 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022414/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process as: A biological process that directly contributes to the process of producing new individuals by one or two organisms. The new individuals inherit some proportion of their genetic material from the parent or parents.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002376","kind":"concept","label":"immune system process","sources":[{"id":"quickgo.go_0002376","title":"Gene Ontology term GO:0002376 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002376/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system process as: Any process involved in the development or functioning of the immune system, an organismal system for calibrated responses to potential internal or invasive threats.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009987","kind":"concept","label":"cellular process","sources":[{"id":"quickgo.go_0009987","title":"Gene Ontology term GO:0009987 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009987/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process as: Any process that is carried out at the cellular level, but not necessarily restricted to a single cell. For example, cell communication occurs among more than one cell, but occurs at the cellular level.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0040011","kind":"concept","label":"locomotion","sources":[{"id":"quickgo.go_0040011","title":"Gene Ontology term GO:0040011 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0040011/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion as: Self-propelled movement of a cell or organism from one location to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048511","kind":"concept","label":"rhythmic process","sources":[{"id":"quickgo.go_0048511","title":"Gene Ontology term GO:0048511 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048511/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines rhythmic process as: Any process pertinent to the generation and maintenance of rhythms in the physiology of an organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0065007","kind":"concept","label":"biological regulation","sources":[{"id":"quickgo.go_0065007","title":"Gene Ontology term GO:0065007 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0065007/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological regulation as: Any process that modulates a measurable attribute of any biological process, quality or function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051703","kind":"concept","label":"biological process involved in intraspecies interaction between organisms","sources":[{"id":"quickgo.go_0051703","title":"Gene Ontology term GO:0051703 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051703/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in intraspecies interaction between organisms as: Any process in which an organism has an effect on an organism of the same species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032502","kind":"concept","label":"developmental process","sources":[{"id":"quickgo.go_0032502","title":"Gene Ontology term GO:0032502 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032502/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process as: A biological process whose specific outcome is the progression of an integrated living unit: an anatomical structure (which may be a subcellular structure, cell, tissue, or organ), or organism over time from an initial condition to a later condition.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032501","kind":"concept","label":"multicellular organismal process","sources":[{"id":"quickgo.go_0032501","title":"Gene Ontology term GO:0032501 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032501/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal process as: Any biological process, occurring at the level of a multicellular organism, pertinent to its function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044419","kind":"concept","label":"biological process involved in interspecies interaction between organisms","sources":[{"id":"quickgo.go_0044419","title":"Gene Ontology term GO:0044419 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044419/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in interspecies interaction between organisms as: Any process evolved to enable an interaction with an organism of a different species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051179","kind":"concept","label":"localization","sources":[{"id":"quickgo.go_0051179","title":"Gene Ontology term GO:0051179 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051179/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization as: Any process in which a cell, a substance, or a cellular entity, such as a protein complex or organelle, is transported, tethered to or otherwise maintained in a specific location. In the case of substances, localization may also be achieved via selective degradation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042592","kind":"concept","label":"homeostatic process","sources":[{"id":"quickgo.go_0042592","title":"Gene Ontology term GO:0042592 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042592/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines homeostatic process as: Any biological process involved in the maintenance of an internal steady state. Homeostasis allows cells and organisms to maintain stable internal conditions despite varying external conditions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098754","kind":"concept","label":"detoxification","sources":[{"id":"quickgo.go_0098754","title":"Gene Ontology term GO:0098754 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098754/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification as: Any process that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044423","kind":"concept","label":"virion component","sources":[{"id":"quickgo.go_0044423","title":"Gene Ontology term GO:0044423 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044423/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion component as: Any constituent part of a virion, a complete fully infectious extracellular virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0110165","kind":"concept","label":"cellular anatomical structure","sources":[{"id":"quickgo.go_0110165","title":"Gene Ontology term GO:0110165 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0110165/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular anatomical structure as: A part of a cellular organism that is either an immaterial entity or a material entity with granularity above the level of a protein complex but below that of an anatomical system. Or, a substance produced by a cellular organism with granularity above the level of a protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032991","kind":"concept","label":"protein-containing complex","sources":[{"id":"quickgo.go_0032991","title":"Gene Ontology term GO:0032991 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032991/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein-containing complex as: A stable assembly of two or more macromolecules, i.e. proteins, nucleic acids, carbohydrates or lipids, in which at least one component is a protein and the constituent parts function together.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0072690","kind":"concept","label":"single-celled organism vegetative growth phase","sources":[{"id":"quickgo.go_0072690","title":"Gene Ontology term GO:0072690 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0072690/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-celled organism vegetative growth phase as: A phase of population growth during which single celled organisms reproduce by budding, fission, or other asexual methods.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044851","kind":"concept","label":"hair cycle phase","sources":[{"id":"quickgo.go_0044851","title":"Gene Ontology term GO:0044851 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044851/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hair cycle phase as: The cyclical periods of growth (anagen), regression (catagen), quiescence (telogen), and shedding (exogen) in the life of a hair; one of the collection or mass of filaments growing from the skin of an animal, and forming a covering for a part of the head or for any part or the whole of the body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0160266","kind":"concept","label":"anestrus phase","sources":[{"id":"quickgo.go_0160266","title":"Gene Ontology term GO:0160266 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0160266/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anestrus phase as: A biological phase of reproductive dormancy characterized by the temporary cessation of reproductive cyclicity, marked by the absence of ovarian follicular development, estrous behavior, and ovulation. This phase represents a period of sexual quiescence between estrous cycles or breeding seasons.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060206","kind":"concept","label":"estrous cycle phase","sources":[{"id":"quickgo.go_0060206","title":"Gene Ontology term GO:0060206 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060206/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines estrous cycle phase as: The progression of physiological phases, occurring in the endometrium during the estrous cycle that recur at regular intervals during the reproductive years. The estrous cycle is an ovulation cycle where the endometrium is resorbed if pregnancy does not occur.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990636","kind":"concept","label":"reproductive senescence","sources":[{"id":"quickgo.go_1990636","title":"Gene Ontology term GO:1990636 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990636/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive senescence as: A life cycle stage during which the reproductive capacity and fitness of an organism declines.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022601","kind":"concept","label":"menstrual cycle phase","sources":[{"id":"quickgo.go_0022601","title":"Gene Ontology term GO:0022601 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022601/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines menstrual cycle phase as: The progression of physiological phases, occurring in the endometrium during the menstrual cycle that recur at regular intervals during the reproductive years. The menstrual cycle is an ovulation cycle where the endometrium is shed if pregnancy does not occur.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022403","kind":"concept","label":"cell cycle phase","sources":[{"id":"quickgo.go_0022403","title":"Gene Ontology term GO:0022403 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022403/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle phase as: One of the distinct periods or stages into which the cell cycle is divided. Each phase is characterized by the occurrence of specific biochemical and morphological events.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048066","kind":"concept","label":"developmental pigmentation","sources":[{"id":"quickgo.go_0048066","title":"Gene Ontology term GO:0048066 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048066/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental pigmentation as: The developmental process that results in the deposition of coloring matter in an organism, tissue or cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033060","kind":"concept","label":"ocellus pigmentation","sources":[{"id":"quickgo.go_0033060","title":"Gene Ontology term GO:0033060 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033060/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ocellus pigmentation as: The deposition or aggregation of coloring matter in an ocellus, a minute simple eye found in many invertebrates.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043476","kind":"concept","label":"pigment accumulation","sources":[{"id":"quickgo.go_0043476","title":"Gene Ontology term GO:0043476 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043476/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation as: The aggregation of coloring matter in a particular location in an organism, tissue or cell, occurring in response to some external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033059","kind":"concept","label":"cellular pigmentation","sources":[{"id":"quickgo.go_0033059","title":"Gene Ontology term GO:0033059 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033059/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular pigmentation as: The deposition or aggregation of coloring matter in a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0080189","kind":"concept","label":"primary growth","sources":[{"id":"quickgo.go_0080189","title":"Gene Ontology term GO:0080189 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0080189/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines primary growth as: Growth of a plant structure from the time of its initiation by an apical meristem until its expansion is completed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048589","kind":"concept","label":"developmental growth","sources":[{"id":"quickgo.go_0048589","title":"Gene Ontology term GO:0048589 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048589/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental growth as: The increase in size or mass of an entire organism, a part of an organism or a cell, where the increase in size or mass has the specific outcome of the progression of the organism over time from one condition to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016049","kind":"concept","label":"cell growth","sources":[{"id":"quickgo.go_0016049","title":"Gene Ontology term GO:0016049 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016049/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell growth as: The process in which a cell irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030447","kind":"concept","label":"filamentous growth","sources":[{"id":"quickgo.go_0030447","title":"Gene Ontology term GO:0030447 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030447/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines filamentous growth as: The process in which a multicellular organism, a unicellular organism or a group of unicellular organisms grow in a threadlike, filamentous shape.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0080190","kind":"concept","label":"lateral growth","sources":[{"id":"quickgo.go_0080190","title":"Gene Ontology term GO:0080190 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0080190/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral growth as: Growth of a plant axis (shoot axis or root) that originates from a lateral meristem.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007117","kind":"concept","label":"budding cell bud growth","sources":[{"id":"quickgo.go_0007117","title":"Gene Ontology term GO:0007117 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007117/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines budding cell bud growth as: The process in which the bud portion of a cell that reproduces by budding irreversibly increases in size over time by accretion and biosynthetic production of matter similar to that already present.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051606","kind":"concept","label":"detection of stimulus","sources":[{"id":"quickgo.go_0051606","title":"Gene Ontology term GO:0051606 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051606/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detection of stimulus as: The series of events in which a stimulus is received by a cell or organism and converted into a molecular signal.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006955","kind":"concept","label":"immune response","sources":[{"id":"quickgo.go_0006955","title":"Gene Ontology term GO:0006955 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006955/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune response as: Any immune system process that functions in the calibrated response of an organism to a potential internal or invasive threat.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043500","kind":"concept","label":"muscle adaptation","sources":[{"id":"quickgo.go_0043500","title":"Gene Ontology term GO:0043500 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043500/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle adaptation as: A process in which muscle adapts, with consequent modifications to structural and/or functional phenotypes, in response to a stimulus. Stimuli include contractile activity, loading conditions, substrate supply, and environmental factors. These adaptive events occur in both muscle fibers and associated structures (motoneurons and capillaries), and they involve alterations in regulatory mechanisms, contractile properties and metabolic capacities.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039700","kind":"concept","label":"fusion of viral membrane with host outer nuclear membrane","sources":[{"id":"quickgo.go_0039700","title":"Gene Ontology term GO:0039700 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039700/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fusion of viral membrane with host outer nuclear membrane as: Fusion of a viral primary envelope with the host outer nuclear membrane during nuclear egress. The transitory primary envelope is acquired by the virus as it buds at the inner nuclear membrane and gains access to the perinuclear space. This membrane is lost by fusing with the host outer nuclear membrane during nuclear exit.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098689","kind":"concept","label":"latency-replication decision","sources":[{"id":"quickgo.go_0098689","title":"Gene Ontology term GO:0098689 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098689/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines latency-replication decision as: The process by which a virus switches on its replication cycle in an infected cell. The process is typically controlled by a genetic switch controlled by environmental factors such as cell type, cell shape, the availability of nutrients, superinfection or exposure of infected cells to UV or various chemical stimuli.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044826","kind":"concept","label":"viral genome integration into host DNA","sources":[{"id":"quickgo.go_0044826","title":"Gene Ontology term GO:0044826 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044826/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome integration into host DNA as: The insertion into a host genome of viral DNA, usually by the action of an integrase enzyme. Once integrated, the provirus persists in the host cell and serves as a template for the transcription of viral genes and replication of the viral genome, leading to the production of new viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039665","kind":"concept","label":"permeabilization of host organelle membrane involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039665","title":"Gene Ontology term GO:0039665 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039665/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines permeabilization of host organelle membrane involved in viral entry into host cell as: Induction of organellar membrane permeabilization triggered by an interaction between the host membrane and a membrane-penetration protein associated with a viral capsid. Results in release of the virus contents from an organelle into the host cell cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039663","kind":"concept","label":"membrane fusion involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039663","title":"Gene Ontology term GO:0039663 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039663/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane fusion involved in viral entry into host cell as: Merging of the virion membrane and a host membrane (host plasma membrane or host organelle membrane) that is involved in the uptake of a virus into a host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019058","kind":"concept","label":"viral life cycle","sources":[{"id":"quickgo.go_0019058","title":"Gene Ontology term GO:0019058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral life cycle as: A set of processes which all viruses follow to ensure survival; includes attachment and entry of the virus particle, decoding of genome information, translation of viral mRNA by host ribosomes, genome replication, and assembly and release of viral particles containing the genome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019079","kind":"concept","label":"viral genome replication","sources":[{"id":"quickgo.go_0019079","title":"Gene Ontology term GO:0019079 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019079/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome replication as: Any process involved directly in viral genome replication, including viral nucleotide metabolism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098678","kind":"concept","label":"viral tropism switching","sources":[{"id":"quickgo.go_0098678","title":"Gene Ontology term GO:0098678 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098678/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tropism switching as: A process by which the range of hosts which a virus can bind and infect is changed. Examples include phages that switch between types of fibers via the action of a virally encoded invertase.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046784","kind":"concept","label":"viral mRNA export from host cell nucleus","sources":[{"id":"quickgo.go_0046784","title":"Gene Ontology term GO:0046784 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046784/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral mRNA export from host cell nucleus as: The directed movement of intronless viral mRNA from the host nucleus to the cytoplasm for translation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019075","kind":"concept","label":"virus maturation","sources":[{"id":"quickgo.go_0019075","title":"Gene Ontology term GO:0019075 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019075/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus maturation as: The refolding and structural rearrangements of virion parts to transition from the intermediate virion to the more mature virion. Maturation usually involves proteolysis events and changes in the folding of the virion proteins. Can occur inside the host cell or after release.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075522","kind":"concept","label":"IRES-dependent viral translational initiation","sources":[{"id":"quickgo.go_0075522","title":"Gene Ontology term GO:0075522 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075522/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines IRES-dependent viral translational initiation as: Process by which viral mRNA translation is initiated, where a domain in the 5' untranslated region (UTR) of the viral mRNA called an internal ribosome entry site (IRES) binds the host 43S preinitiation complex, circumventing regular cap-dependent translation initiation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046745","kind":"concept","label":"viral capsid secondary envelopment","sources":[{"id":"quickgo.go_0046745","title":"Gene Ontology term GO:0046745 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046745/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid secondary envelopment as: The process in which a capsid acquires another membrane envelope, subsequent to acquiring an initial membrane envelope.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019081","kind":"concept","label":"viral translation","sources":[{"id":"quickgo.go_0019081","title":"Gene Ontology term GO:0019081 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019081/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translation as: A process by which viral mRNA is translated into viral protein, using the host cellular machinery.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075524","kind":"concept","label":"ribosomal skipping","sources":[{"id":"quickgo.go_0075524","title":"Gene Ontology term GO:0075524 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075524/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ribosomal skipping as: A translation process in which a specific viral peptide prevents the ribosome from covalently linking a new inserted amino acid, and lets it continue translation, thereby cleaving the nascent protein while allowing translation to continue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098003","kind":"concept","label":"viral tail assembly","sources":[{"id":"quickgo.go_0098003","title":"Gene Ontology term GO:0098003 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098003/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tail assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098005","kind":"concept","label":"viral head-tail joining","sources":[{"id":"quickgo.go_0098005","title":"Gene Ontology term GO:0098005 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098005/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral head-tail joining as: Process by which virus heads and tails are attached to each other.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075526","kind":"concept","label":"cap snatching","sources":[{"id":"quickgo.go_0075526","title":"Gene Ontology term GO:0075526 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075526/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cap snatching as: A transcription initiation process during which a nucleotide sequence between 10 and 20 nucleotides in size is cleaved from the 5' end of host mRNAs by a viral RNA-dependent polymerase. The capped leader sequence obtained is subsequently used to prime transcription on the viral genome, which ultimately leads to the synthesis of capped, translatable viral mRNAs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039678","kind":"concept","label":"symbiont genome ejection through host cell envelope","sources":[{"id":"quickgo.go_0039678","title":"Gene Ontology term GO:0039678 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039678/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines symbiont genome ejection through host cell envelope as: Entry of a symbiont's genome into the host cell through the host cell envelope. Occurs in non-enveloped prokaryotic viruses. Caudovirales carry an ejection apparatus that can be long and contractile, long and noncontractile, or short, and is able to penetrate the host cell envelope to deliver the viral genome into the host cell cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039674","kind":"concept","label":"exit of virus from host cell nucleus","sources":[{"id":"quickgo.go_0039674","title":"Gene Ontology term GO:0039674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines exit of virus from host cell nucleus as: The directed movement of the viral genome or a viral particle out of the host cell nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046794","kind":"concept","label":"transport of virus","sources":[{"id":"quickgo.go_0046794","title":"Gene Ontology term GO:0046794 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046794/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transport of virus as: The directed movement of a virus, or part of a virus, into, out of, or within a host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098669","kind":"concept","label":"superinfection exclusion","sources":[{"id":"quickgo.go_0098669","title":"Gene Ontology term GO:0098669 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098669/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines superinfection exclusion as: The process by which a preexisting viral infection prevents a secondary infection with the same or a closely related virus. Typically some aspect of viral entry is inhibited, but post entry mechanisms have also been documented.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019045","kind":"concept","label":"latent virus replication","sources":[{"id":"quickgo.go_0019045","title":"Gene Ontology term GO:0019045 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019045/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines latent virus replication as: Any process required for latent viral replication in a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019068","kind":"concept","label":"virion assembly","sources":[{"id":"quickgo.go_0019068","title":"Gene Ontology term GO:0019068 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019068/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion assembly as: A late phase of the viral life cycle during which all the components necessary for the formation of a mature virion collect at a particular site in the cell and the basic structure of the virus particle is formed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046807","kind":"concept","label":"viral scaffold assembly and maintenance","sources":[{"id":"quickgo.go_0046807","title":"Gene Ontology term GO:0046807 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046807/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral scaffold assembly and maintenance as: The assembly and maintenance of the viral scaffold around which the viral capsid is constructed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019083","kind":"concept","label":"viral transcription","sources":[{"id":"quickgo.go_0019083","title":"Gene Ontology term GO:0019083 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019083/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral transcription as: The process by which a viral genome, or part of a viral genome, is transcribed within the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019070","kind":"concept","label":"viral genome maturation","sources":[{"id":"quickgo.go_0019070","title":"Gene Ontology term GO:0019070 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019070/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome maturation as: The processes involved in creating a mature, stable viral genome. Begins after genome replication with a newly synthesized nucleic acid and ends when the genome is ready to be packaged. Includes the addition of proteins to the newly synthesized genome, and DNA repair processes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046755","kind":"concept","label":"viral budding","sources":[{"id":"quickgo.go_0046755","title":"Gene Ontology term GO:0046755 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046755/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral budding as: A viral process by which enveloped viruses acquire a host-derived membrane enriched in viral proteins to form their external envelope. The process starts when nucleocapsids, assembled or in the process of being built, induce formation of a membrane curvature in the host plasma or organelle membrane and wrap up in the forming bud. The process ends when the bud is eventually pinched off by membrane scission to release the enveloped particle into the lumenal or extracellular space.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140755","kind":"concept","label":"reorganization of host cellular membranes to establish sites of replication","sources":[{"id":"quickgo.go_0140755","title":"Gene Ontology term GO:0140755 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140755/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reorganization of host cellular membranes to establish sites of replication as: A process in which a virus triggers host intracellular membranes to be reorganized, forming membranous webs, which are thought to be the site of replication or certain viruses, for example the HPV virus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039664","kind":"concept","label":"lysis of host organelle involved in viral entry into host cell","sources":[{"id":"quickgo.go_0039664","title":"Gene Ontology term GO:0039664 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039664/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysis of host organelle involved in viral entry into host cell as: The viral-induced lysis of an organelle (endosome, lysosome, or caveosome) that is involved in the uptake of a virus into a host cell. Occurs once the virus is within the organelle, and results in transfer of the viral contents from the organelle compartment into the cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098045","kind":"concept","label":"virus baseplate assembly","sources":[{"id":"quickgo.go_0098045","title":"Gene Ontology term GO:0098045 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098045/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus baseplate assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus baseplate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019076","kind":"concept","label":"viral release from host cell","sources":[{"id":"quickgo.go_0019076","title":"Gene Ontology term GO:0019076 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019076/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral release from host cell as: The dissemination of mature viral particles from a host cell, e.g. by cell lysis or the budding of virus particles from the cell membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098677","kind":"concept","label":"virion maturation","sources":[{"id":"quickgo.go_0098677","title":"Gene Ontology term GO:0098677 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098677/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion maturation as: Maturation of a virion after separation from the host cell. Not all viruses mature after separation. In those that do, maturation typically involves rearangement and/or cleavage of viral proteins, resulting in the virion becoming competent for reinfection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019072","kind":"concept","label":"viral genome packaging","sources":[{"id":"quickgo.go_0019072","title":"Gene Ontology term GO:0019072 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019072/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome packaging as: The encapsulation of the viral genome within the capsid.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075523","kind":"concept","label":"viral translational frameshifting","sources":[{"id":"quickgo.go_0075523","title":"Gene Ontology term GO:0075523 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075523/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational frameshifting as: A process which occurs during viral translation, which involves a translational recoding mechanism called programmed ribosomal frameshifting. This causes the ribosome to alter its reading of the mRNA to an a different open reading frame to produce alternate viral proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019082","kind":"concept","label":"viral protein processing","sources":[{"id":"quickgo.go_0019082","title":"Gene Ontology term GO:0019082 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019082/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral protein processing as: Any protein maturation process achieved by the cleavage of a peptide bond or bonds within a viral protein.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075525","kind":"concept","label":"viral translational termination-reinitiation","sources":[{"id":"quickgo.go_0075525","title":"Gene Ontology term GO:0075525 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075525/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral translational termination-reinitiation as: A process which occurs as part of viral mRNA translation which allows expression of a downstream open reading frame (ORF) in a dicistronic mRNA. In this process, ribosomes translate the upstream ORF but following termination, a proportion of 40S subunits remain tethered to the mRNA and go on to re-initiate translation at the start codon of the downstream ORF.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019080","kind":"concept","label":"viral gene expression","sources":[{"id":"quickgo.go_0019080","title":"Gene Ontology term GO:0019080 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019080/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral gene expression as: A process by which a viral gene is converted into a mature gene product or products (proteins or RNA). This includes viral transcription, processing to produce a mature RNA product, and viral translation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046786","kind":"concept","label":"viral replication complex formation and maintenance","sources":[{"id":"quickgo.go_0046786","title":"Gene Ontology term GO:0046786 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046786/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral replication complex formation and maintenance as: The process of organizing and assembling viral replication proteins in preparation for viral replication.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098004","kind":"concept","label":"virus tail fiber assembly","sources":[{"id":"quickgo.go_0098004","title":"Gene Ontology term GO:0098004 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098004/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail fiber assembly as: The aggregation, arrangement and bonding together of a set of components to form a virus tail fiber.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075527","kind":"concept","label":"viral RNA editing","sources":[{"id":"quickgo.go_0075527","title":"Gene Ontology term GO:0075527 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075527/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral RNA editing as: The process by which bases in viral mRNA are chemically altered during viral transcription. This is usually the incorporation of 1 - 6 additional nucleotides, which shifts the reading frame, allowing the generation of different protein products or through a specific nucleotide change that eliminates the termination codon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019069","kind":"concept","label":"viral capsid assembly","sources":[{"id":"quickgo.go_0019069","title":"Gene Ontology term GO:0019069 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019069/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid assembly as: The assembly of a virus capsid from its protein subunits.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099009","kind":"concept","label":"viral genome circularization","sources":[{"id":"quickgo.go_0099009","title":"Gene Ontology term GO:0099009 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099009/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral genome circularization as: The circularization of a viral genome following infection of a host cell. This is common amongst bacterial viruses to protect the viral genome ends from nucleases, to convert the linear genome to an integrative precursor or to give rise to the replicative form of the genome. It can be mediated by covalent closure of the DNA sticky ends, recombinaison between redundant terminal sequences or via the binding of a protein at the viral DNA extremities.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019046","kind":"concept","label":"release from viral latency","sources":[{"id":"quickgo.go_0019046","title":"Gene Ontology term GO:0019046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines release from viral latency as: The process by which a virus begins to replicate following a latency replication decision (switch).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019061","kind":"concept","label":"uncoating of virus","sources":[{"id":"quickgo.go_0019061","title":"Gene Ontology term GO:0019061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines uncoating of virus as: The process by which an incoming virus is disassembled in the host cell to release a replication-competent viral genome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019042","kind":"concept","label":"viral latency","sources":[{"id":"quickgo.go_0019042","title":"Gene Ontology term GO:0019042 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019042/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral latency as: The process by which, after initial infection, a virus lies dormant within a cell and viral production ceases. The process ends when the virus switches from latency and starts to replicate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048609","kind":"concept","label":"multicellular organismal reproductive process","sources":[{"id":"quickgo.go_0048609","title":"Gene Ontology term GO:0048609 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048609/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal reproductive process as: The process, occurring above the cellular level, that is pertinent to the reproductive function of a multicellular organism. This includes the integrated processes at the level of tissues and organs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009566","kind":"concept","label":"fertilization","sources":[{"id":"quickgo.go_0009566","title":"Gene Ontology term GO:0009566 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009566/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fertilization as: The union of gametes of opposite sexes during the process of sexual reproduction to form a zygote. It involves the fusion of the gametic nuclei (karyogamy) and cytoplasm (plasmogamy).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022413","kind":"concept","label":"reproductive process in single-celled organism","sources":[{"id":"quickgo.go_0022413","title":"Gene Ontology term GO:0022413 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022413/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reproductive process in single-celled organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a single-celled organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061948","kind":"concept","label":"premature acrosome loss","sources":[{"id":"quickgo.go_0061948","title":"Gene Ontology term GO:0061948 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061948/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines premature acrosome loss as: The discharge, by sperm, of a single, anterior secretory granule before the sperm reaches to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042628","kind":"concept","label":"mating plug formation","sources":[{"id":"quickgo.go_0042628","title":"Gene Ontology term GO:0042628 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042628/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating plug formation as: The deposition of a plug of sperm or other gelatinous material into the opening of the vulva by a male at the termination of copulation. Probably acts to prevent subsequent matings by other males.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019953","kind":"concept","label":"sexual reproduction","sources":[{"id":"quickgo.go_0019953","title":"Gene Ontology term GO:0019953 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019953/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sexual reproduction as: A type of reproduction that combines the genetic material of two gametes (such as a sperm or egg cell or fungal spores). The gametes have an haploid genome (with a single set of chromosomes, the product of a meiotic division) and combines with one another to produce a zygote (diploid).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022602","kind":"concept","label":"ovulation cycle process","sources":[{"id":"quickgo.go_0022602","title":"Gene Ontology term GO:0022602 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022602/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle process as: A process involved in the sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007566","kind":"concept","label":"embryo implantation","sources":[{"id":"quickgo.go_0007566","title":"Gene Ontology term GO:0007566 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007566/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines embryo implantation as: Attachment of the blastocyst to the uterine lining.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044703","kind":"concept","label":"multi-organism reproductive process","sources":[{"id":"quickgo.go_0044703","title":"Gene Ontology term GO:0044703 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044703/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-organism reproductive process as: A biological process that directly contributes to the process of producing new individuals, involving another organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097722","kind":"concept","label":"sperm motility","sources":[{"id":"quickgo.go_0097722","title":"Gene Ontology term GO:0097722 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097722/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm motility as: Any process involved in the controlled movement of a sperm cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0110134","kind":"concept","label":"meiotic drive","sources":[{"id":"quickgo.go_0110134","title":"Gene Ontology term GO:0110134 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0110134/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic drive as: A biological process that results in the unequal transmission of alleles, haplotypes, or chromosomes from a parental genome to gametes. In the absence of meiotic drive, the two copies of each gene or chromosome in a diploid organism are transmitted to offspring with equal probability, whereas meiotic drive results in overrepresentation of the driving allele among the surviving products of meiosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007340","kind":"concept","label":"acrosome reaction","sources":[{"id":"quickgo.go_0007340","title":"Gene Ontology term GO:0007340 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007340/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acrosome reaction as: The discharge, by sperm, of a single, anterior secretory granule following the sperm's attachment to the zona pellucida of the oocyte. The process begins with the fusion of the outer acrosomal membrane with the sperm plasma membrane and ends with the exocytosis of the acrosomal contents into the zona pellucida.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051321","kind":"concept","label":"meiotic cell cycle","sources":[{"id":"quickgo.go_0051321","title":"Gene Ontology term GO:0051321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle as: Progression through the phases of the meiotic cell cycle, in which canonically a cell replicates to produce four offspring with half the chromosomal content of the progenitor cell via two nuclear divisions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1903046","kind":"concept","label":"meiotic cell cycle process","sources":[{"id":"quickgo.go_1903046","title":"Gene Ontology term GO:1903046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1903046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meiotic cell cycle process as: A process that is part of the meiotic cell cycle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0003006","kind":"concept","label":"developmental process involved in reproduction","sources":[{"id":"quickgo.go_0003006","title":"Gene Ontology term GO:0003006 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0003006/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental process involved in reproduction as: A developmental process in which a progressive change in the state of some part of an organism, germline or somatic, specifically contributes to its ability to form offspring.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019954","kind":"concept","label":"asexual reproduction","sources":[{"id":"quickgo.go_0019954","title":"Gene Ontology term GO:0019954 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019954/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines asexual reproduction as: A type of reproduction in which new individuals are produced from a single organism, either from an unfertilized egg or from a single cell or group of cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0075325","kind":"concept","label":"spore dispersal","sources":[{"id":"quickgo.go_0075325","title":"Gene Ontology term GO:0075325 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0075325/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore dispersal as: Any process in which an organism disseminates its spores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990277","kind":"concept","label":"parasexual reproduction with cellular fusion","sources":[{"id":"quickgo.go_1990277","title":"Gene Ontology term GO:1990277 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990277/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines parasexual reproduction with cellular fusion as: A type of reproduction in which new individuals are produced from two individuals, with the fusion of two somatic cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002404","kind":"concept","label":"antigen sampling in mucosal-associated lymphoid tissue","sources":[{"id":"quickgo.go_0002404","title":"Gene Ontology term GO:0002404 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002404/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen sampling in mucosal-associated lymphoid tissue as: The process of apical-to-basolateral delivery of soluble and particulate antigens to underlying mucosal-associated lymphoid tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019882","kind":"concept","label":"antigen processing and presentation","sources":[{"id":"quickgo.go_0019882","title":"Gene Ontology term GO:0019882 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019882/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines antigen processing and presentation as: The process in which an antigen-presenting cell expresses antigen (peptide or lipid) on its cell surface in association with an MHC protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001776","kind":"concept","label":"leukocyte homeostasis","sources":[{"id":"quickgo.go_0001776","title":"Gene Ontology term GO:0001776 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001776/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte homeostasis as: The process of regulating the proliferation and elimination of cells of the immune system such that the total number of cells of a particular cell type within a whole or part of an organism is stable over time in the absence of an outside stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002507","kind":"concept","label":"tolerance induction","sources":[{"id":"quickgo.go_0002507","title":"Gene Ontology term GO:0002507 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002507/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tolerance induction as: A process that directly activates any of the steps required for tolerance, a physiologic state in which the immune system does not react destructively against the components of an organism that harbors it or against antigens that are introduced to it.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002339","kind":"concept","label":"B cell selection","sources":[{"id":"quickgo.go_0002339","title":"Gene Ontology term GO:0002339 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002339/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines B cell selection as: The process dependent upon B cell antigen receptor signaling in response to self or foreign antigen through which B cells are selected for survival.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002253","kind":"concept","label":"activation of immune response","sources":[{"id":"quickgo.go_0002253","title":"Gene Ontology term GO:0002253 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002253/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines activation of immune response as: Any process that initiates an immune response.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045321","kind":"concept","label":"leukocyte activation","sources":[{"id":"quickgo.go_0045321","title":"Gene Ontology term GO:0045321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte activation as: A change in morphology and behavior of a leukocyte resulting from exposure to a specific antigen, mitogen, cytokine, cellular ligand, or soluble factor.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002252","kind":"concept","label":"immune effector process","sources":[{"id":"quickgo.go_0002252","title":"Gene Ontology term GO:0002252 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002252/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune effector process as: Any process of the immune system that executes a component of an immune response. An effector immune process takes place after its activation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090713","kind":"concept","label":"immunological memory process","sources":[{"id":"quickgo.go_0090713","title":"Gene Ontology term GO:0090713 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090713/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological memory process as: Any process of the immune system that can contribute to the formation of immunological memory or an immune response based upon activation of immunological memory.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031294","kind":"concept","label":"lymphocyte costimulation","sources":[{"id":"quickgo.go_0031294","title":"Gene Ontology term GO:0031294 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031294/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lymphocyte costimulation as: The process of providing, via surface-bound receptor-ligand pairs, a second, antigen-independent, signal in addition to that provided by the B- or T cell receptor to augment B- or T cell activation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002440","kind":"concept","label":"production of molecular mediator of immune response","sources":[{"id":"quickgo.go_0002440","title":"Gene Ontology term GO:0002440 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002440/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator of immune response as: The synthesis or release of any molecular mediator of the immune response, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002200","kind":"concept","label":"somatic diversification of immune receptors","sources":[{"id":"quickgo.go_0002200","title":"Gene Ontology term GO:0002200 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002200/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines somatic diversification of immune receptors as: The somatic process allowing for the production of immune receptors whose specificity is not encoded in the germline genomic sequences.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002262","kind":"concept","label":"myeloid cell homeostasis","sources":[{"id":"quickgo.go_0002262","title":"Gene Ontology term GO:0002262 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002262/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myeloid cell homeostasis as: The process of regulating the proliferation and elimination of myeloid cells such that the total number of myeloid cells within a whole or part of an organism is stable over time in the absence of an outside stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002520","kind":"concept","label":"immune system development","sources":[{"id":"quickgo.go_0002520","title":"Gene Ontology term GO:0002520 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002520/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immune system development as: The process whose specific outcome is the progression of an organismal system whose objective is to provide calibrated responses by an organism to a potential internal or invasive threat, over time, from its formation to the mature structure. A system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a given biological process.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042386","kind":"concept","label":"hemocyte differentiation","sources":[{"id":"quickgo.go_0042386","title":"Gene Ontology term GO:0042386 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042386/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte differentiation as: The process in which a relatively unspecialized cell acquires the characteristics of a mature hemocyte. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035172","kind":"concept","label":"hemocyte proliferation","sources":[{"id":"quickgo.go_0035172","title":"Gene Ontology term GO:0035172 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035172/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hemocyte proliferation as: The multiplication or reproduction of hemocytes, resulting in the expansion of the cell population. Hemocytes are blood cells associated with a hemocoel (the cavity containing most of the major organs of the arthropod body) which are involved in defense and clotting of hemolymph, but not involved in transport of oxygen.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045058","kind":"concept","label":"T cell selection","sources":[{"id":"quickgo.go_0045058","title":"Gene Ontology term GO:0045058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines T cell selection as: The process in which T cells that express T cell receptors that are restricted by self MHC protein complexes and tolerant to self antigens are selected for further maturation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050900","kind":"concept","label":"leukocyte migration","sources":[{"id":"quickgo.go_0050900","title":"Gene Ontology term GO:0050900 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050900/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leukocyte migration as: The movement of a leukocyte within or between different tissues and organs of the body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051301","kind":"concept","label":"cell division","sources":[{"id":"quickgo.go_0051301","title":"Gene Ontology term GO:0051301 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051301/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division as: The process resulting in division and partitioning of components of a cell to form more cells; may or may not be accompanied by the physical separation of a cell into distinct, individually membrane-bounded daughter cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048489","kind":"concept","label":"synaptic vesicle transport","sources":[{"id":"quickgo.go_0048489","title":"Gene Ontology term GO:0048489 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048489/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic vesicle transport as: The directed movement of synaptic vesicles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048869","kind":"concept","label":"cellular developmental process","sources":[{"id":"quickgo.go_0048869","title":"Gene Ontology term GO:0048869 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048869/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular developmental process as: A biological process whose specific outcome is the progression of a cell over time from an initial condition to a later condition.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060352","kind":"concept","label":"cell adhesion molecule production","sources":[{"id":"quickgo.go_0060352","title":"Gene Ontology term GO:0060352 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060352/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion molecule production as: The appearance of a cell adhesion molecule due to biosynthesis or secretion.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022402","kind":"concept","label":"cell cycle process","sources":[{"id":"quickgo.go_0022402","title":"Gene Ontology term GO:0022402 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022402/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle process as: The cellular process that ensures successive accurate and complete genome replication and chromosome segregation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061919","kind":"concept","label":"process utilizing autophagic mechanism","sources":[{"id":"quickgo.go_0061919","title":"Gene Ontology term GO:0061919 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061919/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines process utilizing autophagic mechanism as: A cellular process involving delivery of a portion of the cytoplasm to lysosomes or to the plant or fungal vacuole that does not involve direct transport through the endocytic or vacuolar protein sorting (Vps) pathways. This process typically leads to degradation of the cargo; however, it can also be used to deliver resident proteins, such as in the cytoplasm-to-vacuole targeting (Cvt) pathway.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007165","kind":"concept","label":"signal transduction","sources":[{"id":"quickgo.go_0007165","title":"Gene Ontology term GO:0007165 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007165/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines signal transduction as: The cellular process in which a signal is conveyed to trigger a change in the activity or state of a cell. Signal transduction begins with reception of a signal (e.g. a ligand binding to a receptor or receptor activation by a stimulus such as light), or for signal transduction in the absence of ligand, signal-withdrawal or the activity of a constitutively active receptor. Signal transduction ends with regulation of a downstream cellular process, e.g. regulation of transcription or regulation of a metabolic process. Signal transduction covers signaling from receptors located on the surface of the cell and signaling via molecules located within the cell. For signaling between cells, signal transduction is restricted to events at and within the receiving cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010118","kind":"concept","label":"stomatal movement","sources":[{"id":"quickgo.go_0010118","title":"Gene Ontology term GO:0010118 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010118/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines stomatal movement as: The process of opening or closing of stomata, which is directly related to the stomatal conductance (measuring rate of passage of either water vapor or carbon dioxide (CO2) through stomata).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098743","kind":"concept","label":"cell aggregation","sources":[{"id":"quickgo.go_0098743","title":"Gene Ontology term GO:0098743 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098743/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell aggregation as: The clustering together and adhesion of initially separate cells to form an aggregate. Examples include the clustering of unicellular organisms or blood cells in suspension and the condensation of mesenchymal cells during cartilage formation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043335","kind":"concept","label":"protein unfolding","sources":[{"id":"quickgo.go_0043335","title":"Gene Ontology term GO:0043335 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043335/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein unfolding as: The process of assisting in the disassembly of non-covalent linkages in a protein or protein aggregate, often where the proteins are in a non-functional or denatured state.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008219","kind":"concept","label":"cell death","sources":[{"id":"quickgo.go_0008219","title":"Gene Ontology term GO:0008219 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008219/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell death as: Any biological process that results in permanent cessation of all vital functions of a cell. A cell should be considered dead when any one of the following molecular or morphological criteria is met: (1) the cell has lost the integrity of its plasma membrane; (2) the cell, including its nucleus, has undergone complete fragmentation into discrete bodies (frequently referred to as apoptotic bodies). The cell corpse (or its fragments) may be engulfed by an adjacent cell in vivo, but engulfment of whole cells should not be considered a strict criteria to define cell death as, under some circumstances, live engulfed cells can be released from phagosomes (see PMID:18045538).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006515","kind":"concept","label":"protein quality control","sources":[{"id":"quickgo.go_0006515","title":"Gene Ontology term GO:0006515 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006515/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein quality control as: The chemical reactions and pathways resulting in the breakdown or refolding of proteins recognized as aberrant, including misfolded, dysfunctional, or incompletely synthesized proteins, and orphan subunits that fail to assemble into their cognate protein complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006457","kind":"concept","label":"protein folding","sources":[{"id":"quickgo.go_0006457","title":"Gene Ontology term GO:0006457 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006457/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines protein folding as: The process of assisting in the covalent and noncovalent assembly of single chain polypeptides or multisubunit complexes into the correct tertiary structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048870","kind":"concept","label":"cell motility","sources":[{"id":"quickgo.go_0048870","title":"Gene Ontology term GO:0048870 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048870/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell motility as: Any process involved in the controlled self-propelled movement of a cell that results in translocation of the cell from one place to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0034337","kind":"concept","label":"RNA folding","sources":[{"id":"quickgo.go_0034337","title":"Gene Ontology term GO:0034337 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0034337/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines RNA folding as: The process of assisting in the covalent and noncovalent assembly of single or multimeric RNAs into the correct tertiary structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061842","kind":"concept","label":"microtubule organizing center localization","sources":[{"id":"quickgo.go_0061842","title":"Gene Ontology term GO:0061842 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061842/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule organizing center localization as: Any process in which the microtubule organizing center is transported to, and/or maintained in, a specific location within the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097528","kind":"concept","label":"execution phase of necroptosis","sources":[{"id":"quickgo.go_0097528","title":"Gene Ontology term GO:0097528 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097528/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of necroptosis as: A stage of the necroptotic process that starts after a necroptotic signal has been relayed to the execution machinery. Key steps of the execution phase are swelling of organelles, minor ultrastructural modifications of the nucleus (specifically, dilatation of the nuclear membrane and condensation of chromatin into small, irregular, circumscribed patches) and increased cell volume (oncosis), culminating in the disruption of the plasma membrane and subsequent loss of intracellular contents. The execution phase ends when the cell has died.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022406","kind":"concept","label":"membrane docking","sources":[{"id":"quickgo.go_0022406","title":"Gene Ontology term GO:0022406 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022406/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines membrane docking as: The initial attachment of a membrane or protein to a target membrane. Docking requires only that the proteins come close enough to interact and adhere.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007154","kind":"concept","label":"cell communication","sources":[{"id":"quickgo.go_0007154","title":"Gene Ontology term GO:0007154 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007154/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell communication as: Any process that mediates interactions between a cell and its surroundings. Encompasses interactions such as signaling or attachment between one cell and another cell, between a cell and an extracellular matrix, or between a cell and any other aspect of its environment.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036166","kind":"concept","label":"phenotypic switching","sources":[{"id":"quickgo.go_0036166","title":"Gene Ontology term GO:0036166 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036166/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines phenotypic switching as: A reversible switch of a cell from one cell type or form to another, at a frequency above the expected frequency for somatic mutations. Phenotypic switching involves changes in cell morphology and altered gene expression patterns. For example, Candida albicans switches from white cells to opaque cells for sexual mating. Phenotypic switching also occurs in multicellular organisms; smooth muscle cells (SMCs) exhibit phenotypic transitions to allow rapid adaption to fluctuating environmental cues.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000920","kind":"concept","label":"septum digestion after cytokinesis","sources":[{"id":"quickgo.go_0000920","title":"Gene Ontology term GO:0000920 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000920/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines septum digestion after cytokinesis as: The process of physically separating the septal cell wall material by enzymatic digestion, that occurs after daughter cells are separated by cytokinesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007017","kind":"concept","label":"microtubule-based process","sources":[{"id":"quickgo.go_0007017","title":"Gene Ontology term GO:0007017 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007017/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microtubule-based process as: Any cellular process that depends upon or alters the microtubule cytoskeleton, that part of the cytoskeleton comprising microtubules and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990748","kind":"concept","label":"cellular detoxification","sources":[{"id":"quickgo.go_1990748","title":"Gene Ontology term GO:1990748 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990748/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular detoxification as: Any process carried out at the cellular level that reduces or removes the toxicity of a toxic substance. These may include transport of the toxic substance away from sensitive areas and to compartments or complexes whose purpose is sequestration of the toxic substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0006276","kind":"concept","label":"plasmid maintenance","sources":[{"id":"quickgo.go_0006276","title":"Gene Ontology term GO:0006276 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0006276/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasmid maintenance as: The maintenance of the integrity of extrachromosomal plasmid DNA; includes processes that ensure plasmids are retained in the daughter cells after cell division.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019835","kind":"concept","label":"cytolysis","sources":[{"id":"quickgo.go_0019835","title":"Gene Ontology term GO:0019835 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019835/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytolysis as: The rupture of cell membranes and the loss of cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071554","kind":"concept","label":"cell wall organization or biogenesis","sources":[{"id":"quickgo.go_0071554","title":"Gene Ontology term GO:0071554 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071554/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell wall organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cell wall.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001906","kind":"concept","label":"cell killing","sources":[{"id":"quickgo.go_0001906","title":"Gene Ontology term GO:0001906 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001906/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell killing as: Any process in an organism that results in the killing of its own cells or those of another organism, including in some cases the death of the other organism. Killing here refers to the induction of death in one cell by another cell, not cell-autonomous death due to internal or other environmental conditions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140352","kind":"concept","label":"export from cell","sources":[{"id":"quickgo.go_0140352","title":"Gene Ontology term GO:0140352 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140352/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines export from cell as: The directed movement of some substance from a cell, into the extracellular region. This may occur via transport across the plasma membrane or via exocytosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051641","kind":"concept","label":"cellular localization","sources":[{"id":"quickgo.go_0051641","title":"Gene Ontology term GO:0051641 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051641/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular localization as: A cellular localization process whereby a substance or cellular entity, such as a protein complex or organelle, is transported to, and/or maintained in, a specific location within a cell including the localization of substances or cellular entities to the cell membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009292","kind":"concept","label":"horizontal gene transfer","sources":[{"id":"quickgo.go_0009292","title":"Gene Ontology term GO:0009292 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009292/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines horizontal gene transfer as: The introduction of genetic information into a cell to create a genetically different individual, without production of new individuals.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071840","kind":"concept","label":"cellular component organization or biogenesis","sources":[{"id":"quickgo.go_0071840","title":"Gene Ontology term GO:0071840 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071840/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular component organization or biogenesis as: A process that results in the biosynthesis of constituent macromolecules, assembly, arrangement of constituent parts, or disassembly of a cellular component.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055085","kind":"concept","label":"transmembrane transport","sources":[{"id":"quickgo.go_0055085","title":"Gene Ontology term GO:0055085 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055085/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transmembrane transport as: The process in which a solute is transported across a lipid bilayer, from one side of a membrane to the other.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140029","kind":"concept","label":"exocytic process","sources":[{"id":"quickgo.go_0140029","title":"Gene Ontology term GO:0140029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines exocytic process as: The cellular processes that contribute to exocytosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140253","kind":"concept","label":"cell-cell fusion","sources":[{"id":"quickgo.go_0140253","title":"Gene Ontology term GO:0140253 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140253/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell-cell fusion as: A cellular process in which two or more cells combine together, their plasma membrane fusing, producing a single cell. In some cases, nuclei fuse, producing a polyploid cell, while in other cases, nuclei remain separate, producing a syncytium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007049","kind":"concept","label":"cell cycle","sources":[{"id":"quickgo.go_0007049","title":"Gene Ontology term GO:0007049 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007049/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell cycle as: The progression of biochemical and morphological phases and events that occur in a cell during successive cell replication or nuclear replication events. Canonically, the cell cycle comprises the replication and segregation of genetic material followed by the division of the cell, but in endocycles or syncytial cells nuclear replication or nuclear division may not be followed by cell division.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001775","kind":"concept","label":"cell activation","sources":[{"id":"quickgo.go_0001775","title":"Gene Ontology term GO:0001775 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001775/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell activation as: A multicellular organismal process by which exposure to an activating factor such as a cellular or soluble ligand results in a change in the morphology or behavior of a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035212","kind":"concept","label":"cell competition in a multicellular organism","sources":[{"id":"quickgo.go_0035212","title":"Gene Ontology term GO:0035212 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035212/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell competition in a multicellular organism as: Competitive interactions within multicellular organisms between cell populations that differ in growth rates, leading to the elimination of the slowest-growing cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008283","kind":"concept","label":"cell population proliferation","sources":[{"id":"quickgo.go_0008283","title":"Gene Ontology term GO:0008283 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008283/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell population proliferation as: The multiplication or reproduction of cells, resulting in the expansion of a cell population.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120312","kind":"concept","label":"ciliary basal body segregation","sources":[{"id":"quickgo.go_0120312","title":"Gene Ontology term GO:0120312 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120312/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary basal body segregation as: The process in which the duplicated basal bodies migrate in pairs to the mitotic poles of the nucleus and results in equal distribution in the daughter cells. Ciliary basal body segregation ensures inheritance of the duplicated mitochondrial DNA to the two daughter cells in the Trypanosoma parasites.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0170062","kind":"concept","label":"nutrient storage","sources":[{"id":"quickgo.go_0170062","title":"Gene Ontology term GO:0170062 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0170062/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nutrient storage as: The accumulation and maintenance in cells or tissues of a nutrient, a substance that is used by an organism to survive, to grow, and to reproduce; such as proteins, vitamins, and minerals. Nutrient reserves can be accumulated for mobilization and utilization when needed.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045103","kind":"concept","label":"intermediate filament-based process","sources":[{"id":"quickgo.go_0045103","title":"Gene Ontology term GO:0045103 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045103/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intermediate filament-based process as: Any cellular process that depends upon or alters the intermediate filament cytoskeleton, that part of the cytoskeleton comprising intermediate filaments and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097194","kind":"concept","label":"execution phase of apoptosis","sources":[{"id":"quickgo.go_0097194","title":"Gene Ontology term GO:0097194 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097194/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines execution phase of apoptosis as: A stage of the apoptotic process that starts with the controlled breakdown of the cell through the action of effector caspases or other effector molecules (e.g. cathepsins, calpains etc.). Key steps of the execution phase are rounding-up of the cell, retraction of pseudopodes, reduction of cellular volume (pyknosis), chromatin condensation, nuclear fragmentation (karyorrhexis), plasma membrane blebbing and fragmentation of the cell into apoptotic bodies. When the execution phase is completed, the cell has died.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090398","kind":"concept","label":"cellular senescence","sources":[{"id":"quickgo.go_0090398","title":"Gene Ontology term GO:0090398 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090398/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular senescence as: A cell aging process stimulated in response to cellular stress, whereby normal cells lose the ability to divide through irreversible cell cycle arrest.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022412","kind":"concept","label":"cellular process involved in reproduction in multicellular organism","sources":[{"id":"quickgo.go_0022412","title":"Gene Ontology term GO:0022412 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022412/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular process involved in reproduction in multicellular organism as: A process, occurring at the cellular level, that is involved in the reproductive function of a multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016037","kind":"concept","label":"light absorption","sources":[{"id":"quickgo.go_0016037","title":"Gene Ontology term GO:0016037 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016037/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines light absorption as: The reception of a photon by a cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051674","kind":"concept","label":"localization of cell","sources":[{"id":"quickgo.go_0051674","title":"Gene Ontology term GO:0051674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines localization of cell as: Any process in which a cell is transported to, and/or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030029","kind":"concept","label":"actin filament-based process","sources":[{"id":"quickgo.go_0030029","title":"Gene Ontology term GO:0030029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament-based process as: Any cellular process that depends upon or alters the actin cytoskeleton, that part of the cytoskeleton comprising actin filaments and their associated proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016192","kind":"concept","label":"vesicle-mediated transport","sources":[{"id":"quickgo.go_0016192","title":"Gene Ontology term GO:0016192 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016192/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines vesicle-mediated transport as: A cellular transport process in which transported substances are moved in membrane-bounded vesicles; transported substances are enclosed in the vesicle lumen or located in the vesicle membrane. The process begins with a step that directs a substance to the forming vesicle, and includes vesicle budding and coating. Vesicles are then targeted to, and fuse with, an acceptor membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007155","kind":"concept","label":"cell adhesion","sources":[{"id":"quickgo.go_0007155","title":"Gene Ontology term GO:0007155 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007155/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell adhesion as: The attachment of a cell, either to another cell or to an underlying substrate such as the extracellular matrix, via cell adhesion molecules.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008152","kind":"concept","label":"metabolic process","sources":[{"id":"quickgo.go_0008152","title":"Gene Ontology term GO:0008152 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008152/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines metabolic process as: A cellular process consisting of the biochemical pathways by which a living organism transforms chemical substances. This includes including anabolism (biosynthetic process) and catabolism (catabolic process). Metabolic processes includes the transformation of small molecules, as well macromolecular processes such as DNA repair and replication, protein synthesis and degradation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007272","kind":"concept","label":"ensheathment of neurons","sources":[{"id":"quickgo.go_0007272","title":"Gene Ontology term GO:0007272 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007272/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ensheathment of neurons as: The process in which glial cells envelop neuronal cell bodies and/or axons to form an insulating layer. This can take the form of myelinating or non-myelinating ensheathment.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008037","kind":"concept","label":"cell recognition","sources":[{"id":"quickgo.go_0008037","title":"Gene Ontology term GO:0008037 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008037/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell recognition as: The process in which a cell in an organism interprets its surroundings.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031987","kind":"concept","label":"locomotion involved in locomotory behavior","sources":[{"id":"quickgo.go_0031987","title":"Gene Ontology term GO:0031987 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031987/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines locomotion involved in locomotory behavior as: Self-propelled movement of a cell or organism from one location to another in a behavioral context; the aspect of locomotory behavior having to do with movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033058","kind":"concept","label":"directional locomotion","sources":[{"id":"quickgo.go_0033058","title":"Gene Ontology term GO:0033058 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033058/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines directional locomotion as: Self-propelled movement of a cell or organism from one location to another along an axis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060361","kind":"concept","label":"flight","sources":[{"id":"quickgo.go_0060361","title":"Gene Ontology term GO:0060361 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060361/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines flight as: Self-propelled movement of an organism from one location to another through the air, usually by means of active wing movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042330","kind":"concept","label":"taxis","sources":[{"id":"quickgo.go_0042330","title":"Gene Ontology term GO:0042330 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042330/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines taxis as: The directed movement of a motile cell or organism in response to an external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071965","kind":"concept","label":"multicellular organismal locomotion","sources":[{"id":"quickgo.go_0071965","title":"Gene Ontology term GO:0071965 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071965/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal locomotion as: Locomotion in a multicellular organism, i.e. self-propelled movement of a multicellular organism from one location to another.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036268","kind":"concept","label":"swimming","sources":[{"id":"quickgo.go_0036268","title":"Gene Ontology term GO:0036268 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036268/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines swimming as: Self-propelled movement of an organism from one location to another through water, often by means of active fin movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007624","kind":"concept","label":"ultradian rhythm","sources":[{"id":"quickgo.go_0007624","title":"Gene Ontology term GO:0007624 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007624/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ultradian rhythm as: The specific actions or reactions of an organism that recur with a regularity more frequent than every 24 hours.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007623","kind":"concept","label":"circadian rhythm","sources":[{"id":"quickgo.go_0007623","title":"Gene Ontology term GO:0007623 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007623/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines circadian rhythm as: Any biological process in an organism that recurs with a regularity of approximately 24 hours.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042698","kind":"concept","label":"ovulation cycle","sources":[{"id":"quickgo.go_0042698","title":"Gene Ontology term GO:0042698 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042698/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ovulation cycle as: The type of sexual cycle seen in females, often with physiologic changes in the endometrium that recur at regular intervals during the reproductive years.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010483","kind":"concept","label":"pollen tube reception","sources":[{"id":"quickgo.go_0010483","title":"Gene Ontology term GO:0010483 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010483/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube reception as: An interaction between the pollen tube, part of the male gametophyte, and the female gametophyte (typically the synergid cells), that results in the arrest of pollen tube growth, rupture of the pollen tube and the release of the sperm cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000752","kind":"concept","label":"agglutination involved in conjugation with cellular fusion","sources":[{"id":"quickgo.go_0000752","title":"Gene Ontology term GO:0000752 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000752/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines agglutination involved in conjugation with cellular fusion as: The aggregation or adhesion of compatible mating types via complementary cell-cell interactions during conjugation with cellular fusion of a unicellular organism. An example of this process is agglutination in Saccharomyces cerevisiae.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099120","kind":"concept","label":"socially cooperative development","sources":[{"id":"quickgo.go_0099120","title":"Gene Ontology term GO:0099120 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099120/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines socially cooperative development as: The process whose specific outcome is the progression of a non-reproductive fruiting body over time, from its formation to the mature structure. A non-reproductive fruiting body is a colonial multicellular structure consisting of co-operating unicellular organisms, some of which are spores. An example of such a process is found in Dictyostelium discoideum and Myxococcus xanthus colonies.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120318","kind":"concept","label":"olfactory sociosexual communication","sources":[{"id":"quickgo.go_0120318","title":"Gene Ontology term GO:0120318 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120318/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines olfactory sociosexual communication as: The use of external chemical cues called pheromones to send social and sexual information between members of the same species, leading to specific behavioral responses. Pheromones may be detected by two olfactory sensory circuits, the main olfactory pathway and the vomeronasal system.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000128","kind":"concept","label":"flocculation","sources":[{"id":"quickgo.go_0000128","title":"Gene Ontology term GO:0000128 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000128/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines flocculation as: The reversible, non-sexual aggregation of single-celled organisms in suspension to form aggregates of many cells known as flocs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044010","kind":"concept","label":"single-species biofilm formation","sources":[{"id":"quickgo.go_0044010","title":"Gene Ontology term GO:0044010 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044010/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines single-species biofilm formation as: A process in which planktonically growing microorganisms of the same species grow at a liquid-air interface or on a solid substrate under the flow of a liquid and produce extracellular polymers that facilitate matrix formation, resulting in a change in the organisms' growth rate and gene transcription.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009865","kind":"concept","label":"pollen tube adhesion","sources":[{"id":"quickgo.go_0009865","title":"Gene Ontology term GO:0009865 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009865/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen tube adhesion as: The process in which the pollen tube adheres to cells of the stigma and style.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048646","kind":"concept","label":"anatomical structure formation involved in morphogenesis","sources":[{"id":"quickgo.go_0048646","title":"Gene Ontology term GO:0048646 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048646/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure formation involved in morphogenesis as: The developmental process pertaining to the initial formation of an anatomical structure from unspecified parts. This process begins with the specific processes that contribute to the appearance of the discrete structure and ends when the structural rudiment is recognizable. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009653","kind":"concept","label":"anatomical structure morphogenesis","sources":[{"id":"quickgo.go_0009653","title":"Gene Ontology term GO:0009653 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009653/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure morphogenesis as: The process in which anatomical structures are generated and organized. Morphogenesis pertains to the creation of form.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030583","kind":"concept","label":"myxococcal fruiting body development","sources":[{"id":"quickgo.go_0030583","title":"Gene Ontology term GO:0030583 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030583/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myxococcal fruiting body development as: The process whose specific outcome is the progression of the myxococcal fruiting body over time, from its formation to the mature structure. The process begins when myxococci respond to a lack of nutrients in the environment and ends when the myxococcal fruiting body is a mature structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048532","kind":"concept","label":"anatomical structure arrangement","sources":[{"id":"quickgo.go_0048532","title":"Gene Ontology term GO:0048532 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048532/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure arrangement as: The process that gives rise to the configuration of the constituent parts of an anatomical structure. This process pertains to the physical shaping of a rudimentary structure. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031128","kind":"concept","label":"developmental induction","sources":[{"id":"quickgo.go_0031128","title":"Gene Ontology term GO:0031128 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031128/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental induction as: A developmental process involving two tissues in which one tissue (the inducer) produces a signal that directs cell fate commitment of cells in the second tissue (the responder).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043934","kind":"concept","label":"sporulation","sources":[{"id":"quickgo.go_0043934","title":"Gene Ontology term GO:0043934 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043934/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sporulation as: The process whose specific outcome is the progression of a spore over time, from its initiation to the mature structure. A spore is a structure that can be used for dissemination, for survival of adverse conditions because of its heat and desiccation resistance, and/or for reproduction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010014","kind":"concept","label":"meristem initiation","sources":[{"id":"quickgo.go_0010014","title":"Gene Ontology term GO:0010014 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010014/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem initiation as: Initiation of a region of tissue in a plant that is composed of one or more undifferentiated cells capable of undergoing mitosis and differentiation, thereby effecting growth and development of a plant by giving rise to more meristem or specialized tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022611","kind":"concept","label":"dormancy process","sources":[{"id":"quickgo.go_0022611","title":"Gene Ontology term GO:0022611 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022611/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dormancy process as: A developmental process in which dormancy (sometimes called a dormant state) is induced, maintained or broken. Dormancy is a suspension of most physiological activity and growth that can be reactivated.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090644","kind":"concept","label":"age-related resistance","sources":[{"id":"quickgo.go_0090644","title":"Gene Ontology term GO:0090644 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090644/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines age-related resistance as: An innate immune response that is positively correlated with host plant development. As a plant develops, its innate resistance to pathogenic infections increases. The mechanisms involved in age-related resistance differ in nature or in aspects of regulation from the hypersensitive response (HR), systemic acquired resistance (SAR), or induced systemic resistance (ISR).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090693","kind":"concept","label":"plant organ senescence","sources":[{"id":"quickgo.go_0090693","title":"Gene Ontology term GO:0090693 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090693/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plant organ senescence as: A plant organ developmental process during which a plant dismantles cellular components to reclaim the cellular building blocks and nutrients that have been deposited in the plant organs during growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060033","kind":"concept","label":"anatomical structure regression","sources":[{"id":"quickgo.go_0060033","title":"Gene Ontology term GO:0060033 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060033/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure regression as: The developmental process in which an anatomical structure is destroyed as a part of its normal progression.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097737","kind":"concept","label":"acquisition of mycelium reproductive competence","sources":[{"id":"quickgo.go_0097737","title":"Gene Ontology term GO:0097737 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097737/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of mycelium reproductive competence as: A maturation process by which an organism acquires the ability to reproduce. In fungi, reproductive competence only occurs in a population of filamentous cells that form a mycelium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0021700","kind":"concept","label":"developmental maturation","sources":[{"id":"quickgo.go_0021700","title":"Gene Ontology term GO:0021700 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0021700/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines developmental maturation as: A developmental process, independent of morphogenetic (shape) change, that is required for an anatomical structure, cell or cellular component to attain its fully functional state.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009838","kind":"concept","label":"abscission","sources":[{"id":"quickgo.go_0009838","title":"Gene Ontology term GO:0009838 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009838/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines abscission as: The controlled shedding of a body part.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048856","kind":"concept","label":"anatomical structure development","sources":[{"id":"quickgo.go_0048856","title":"Gene Ontology term GO:0048856 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048856/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines anatomical structure development as: The biological process whose specific outcome is the progression of an anatomical structure from an initial condition to its mature state. This process begins with the formation of the structure and ends with the mature structure, whatever form that may be including its natural destruction. An anatomical structure is any biological entity that occupies space and is distinguished from its surroundings. Anatomical structures can be macroscopic such as a carpel, or microscopic such as an acrosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097751","kind":"concept","label":"spore-bearing structure formation","sources":[{"id":"quickgo.go_0097751","title":"Gene Ontology term GO:0097751 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097751/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spore-bearing structure formation as: The process of generating a spore-bearing structure. A spore-bearing structure is an anatomical structure that produces new spores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043696","kind":"concept","label":"dedifferentiation","sources":[{"id":"quickgo.go_0043696","title":"Gene Ontology term GO:0043696 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043696/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dedifferentiation as: The process in which a specialized structure (cell, tissue or organ) loses structural or functional features that characterize it in the mature organism, or some other relatively stable phase of the organism's life history. Under certain conditions, these structures can revert back to the features of their ancestors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140547","kind":"concept","label":"acquisition of seed longevity","sources":[{"id":"quickgo.go_0140547","title":"Gene Ontology term GO:0140547 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140547/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines acquisition of seed longevity as: The acquisition of seed longevity is the ordered series of events during seed development, that prevent embryo deterioration and ROS damage and thus contribute to seed viability over time or in response to adverse environmental conditions. These events include protective (e.g. production of glassy cytoplasm ) and repair (e.g. oxidative stress responses) processes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060384","kind":"concept","label":"innervation","sources":[{"id":"quickgo.go_0060384","title":"Gene Ontology term GO:0060384 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060384/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines innervation as: The process in which a nerve invades a tissue and makes functional synaptic connection within the tissue.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009561","kind":"concept","label":"megagametogenesis","sources":[{"id":"quickgo.go_0009561","title":"Gene Ontology term GO:0009561 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009561/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines megagametogenesis as: The process whose specific outcome is the progression of the embryo sac over time, from its formation as the megaspore to the mature structure. The process begins when three of the four haploid megaspores disintegrate, and the fourth undergoes mitosis giving rise to a binucleate syncytial embryo sac. The two haploid nuclei migrate to the opposite poles of the embryo sac and then undergo two rounds of mitosis generating four haploid nuclei at each pole. One nucleus from each set of four migrates to the center of the cell. Cellularization occurs, resulting in an eight-nucleate seven-celled structure. This structure contains two synergid cells and an egg cell at the micropylar end, and three antipodal cells at the other end. A binucleate endosperm mother cell is formed at the center.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go7770056","kind":"concept","label":"multicellular organismal-level extracellular fluid acidification","sources":[{"id":"quickgo.go_7770056","title":"Gene Ontology term GO:7770056 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:7770056/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level extracellular fluid acidification as: Any process that reduces the pH of an extracellular fluid of a multicellular organism, corresponding to an increase in hydrogen ion concentration.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001503","kind":"concept","label":"ossification","sources":[{"id":"quickgo.go_0001503","title":"Gene Ontology term GO:0001503 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001503/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ossification as: The formation of bone or of a bony substance, or the conversion of fibrous tissue or of cartilage into bone or a bony substance.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097242","kind":"concept","label":"amyloid-beta clearance","sources":[{"id":"quickgo.go_0097242","title":"Gene Ontology term GO:0097242 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097242/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines amyloid-beta clearance as: The process in which amyloid-beta is removed from extracellular brain regions by mechanisms involving cell surface receptors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035889","kind":"concept","label":"otolith tethering","sources":[{"id":"quickgo.go_0035889","title":"Gene Ontology term GO:0035889 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035889/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines otolith tethering as: The attachment of a developing otolith to the kinocilia of tether cells in the inner ear.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043480","kind":"concept","label":"pigment accumulation in tissues","sources":[{"id":"quickgo.go_0043480","title":"Gene Ontology term GO:0043480 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043480/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pigment accumulation in tissues as: The aggregation of coloring matter in a particular location in a tissue, occurring in response to an external stimulus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055127","kind":"concept","label":"vibrational conductance of sound to the inner ear","sources":[{"id":"quickgo.go_0055127","title":"Gene Ontology term GO:0055127 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055127/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines vibrational conductance of sound to the inner ear as: The transmission of vibrations via ossicles to the inner ear.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022004","kind":"concept","label":"midbrain-hindbrain boundary maturation during brain development","sources":[{"id":"quickgo.go_0022004","title":"Gene Ontology term GO:0022004 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022004/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during brain development as: A developmental process occurring after the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016203","kind":"concept","label":"muscle attachment","sources":[{"id":"quickgo.go_0016203","title":"Gene Ontology term GO:0016203 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016203/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines muscle attachment as: The developmental process in which a skeletal muscle attaches to its target (such as bone or body wall).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071827","kind":"concept","label":"plasma lipoprotein particle organization","sources":[{"id":"quickgo.go_0071827","title":"Gene Ontology term GO:0071827 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071827/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle organization as: A protein-lipid complex subunit organization process that results in the formation, disassembly, or alteration of a plasma lipoprotein particle. A plasma lipoprotein particle is a spherical particle with a hydrophobic core of triglycerides and/or cholesterol esters, surrounded by an amphipathic monolayer of phospholipids, cholesterol and apolipoproteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050817","kind":"concept","label":"coagulation","sources":[{"id":"quickgo.go_0050817","title":"Gene Ontology term GO:0050817 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050817/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines coagulation as: The process in which a fluid solution, or part of it, changes into a solid or semisolid mass.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0003008","kind":"concept","label":"system process","sources":[{"id":"quickgo.go_0003008","title":"Gene Ontology term GO:0003008 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0003008/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines system process as: A multicellular organismal process carried out by any of the organs or tissues in an organ system. An organ system is a regularly interacting or interdependent group of organs or tissues that work together to carry out a biological objective.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035073","kind":"concept","label":"pupariation","sources":[{"id":"quickgo.go_0035073","title":"Gene Ontology term GO:0035073 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035073/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupariation as: The onset of prepupal development when the larval stops crawling, everts its spiracles and the larval cuticle becomes the puparium or pupal case that surrounds the organism for the duration of metamorphosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010022","kind":"concept","label":"meristem determinacy","sources":[{"id":"quickgo.go_0010022","title":"Gene Ontology term GO:0010022 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010022/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem determinacy as: The process in which a meristem becomes determinate (i.e. ceases to produce lateral organs and may or may not terminally differentiate).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055046","kind":"concept","label":"microgametogenesis","sources":[{"id":"quickgo.go_0055046","title":"Gene Ontology term GO:0055046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines microgametogenesis as: The process whose specific outcome is the progression of the pollen grain over time, from its formation as the microspore to the mature structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032898","kind":"concept","label":"neurotrophin production","sources":[{"id":"quickgo.go_0032898","title":"Gene Ontology term GO:0032898 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032898/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines neurotrophin production as: The appearance of a neurotrophin due to biosynthesis or secretion by cells in a neuron's target field, resulting in an increase in its intracellular or extracellular levels. A neurotrophin is any of a family of growth factors that prevent apoptosis in neurons and promote nerve growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035264","kind":"concept","label":"multicellular organism growth","sources":[{"id":"quickgo.go_0035264","title":"Gene Ontology term GO:0035264 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035264/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism growth as: The increase in size or mass of an entire multicellular organism, as opposed to cell growth.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009791","kind":"concept","label":"post-embryonic development","sources":[{"id":"quickgo.go_0009791","title":"Gene Ontology term GO:0009791 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009791/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines post-embryonic development as: The process whose specific outcome is the progression of the organism over time, from the completion of embryonic development to the mature structure. See embryonic development.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009846","kind":"concept","label":"pollen germination","sources":[{"id":"quickgo.go_0009846","title":"Gene Ontology term GO:0009846 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009846/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pollen germination as: The physiological and developmental changes that occur in a heterosporous plant pollen grain, beginning with hydration and terminating with the emergence of the pollen tube through the aperture.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010162","kind":"concept","label":"seed dormancy process","sources":[{"id":"quickgo.go_0010162","title":"Gene Ontology term GO:0010162 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010162/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a seed. Seed dormancy is a suspension of most physiological activity and growth in a seed, including the embryo contained therein, that can be reactivated. It often requires special conditions for reactivation, such as specific temperature, scarification, or leaching of inhibitors.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990110","kind":"concept","label":"callus formation","sources":[{"id":"quickgo.go_1990110","title":"Gene Ontology term GO:1990110 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990110/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines callus formation as: The process by which a callus is formed at a wound site. A plant callus is a portion of plant tissue that consists of mass of undifferentiated plant cells. It consists primarily of parenchyma cells but possibly contains other cell types as the callus begins to differentiate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019827","kind":"concept","label":"stem cell population maintenance","sources":[{"id":"quickgo.go_0019827","title":"Gene Ontology term GO:0019827 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019827/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines stem cell population maintenance as: The process by which an organism or tissue maintains a population of stem cells of a single type. This can be achieved by a number of mechanisms: stem cell asymmetric division maintains stem cell numbers; stem cell symmetric division increases them; maintenance of a stem cell niche maintains the conditions for commitment to the stem cell fate for some types of stem cell; stem cells may arise de novo from other cell types.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007275","kind":"concept","label":"multicellular organism development","sources":[{"id":"quickgo.go_0007275","title":"Gene Ontology term GO:0007275 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007275/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism development as: The biological process whose specific outcome is the progression of a multicellular organism over time from an initial condition (e.g. a zygote or a young adult) to a later condition (e.g. a multicellular animal or an aged adult).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048647","kind":"concept","label":"polyphenic determination","sources":[{"id":"quickgo.go_0048647","title":"Gene Ontology term GO:0048647 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048647/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines polyphenic determination as: The process in which individuals that have the potential to develop any of several possible distinct developmental paths have their individual developmental fates determined in response to environmental and/or genetic cues.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0008340","kind":"concept","label":"determination of adult lifespan","sources":[{"id":"quickgo.go_0008340","title":"Gene Ontology term GO:0008340 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0008340/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines determination of adult lifespan as: The pathways that regulate the duration of the adult phase of the life-cycle of an animal.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010073","kind":"concept","label":"meristem maintenance","sources":[{"id":"quickgo.go_0010073","title":"Gene Ontology term GO:0010073 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010073/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines meristem maintenance as: Any process involved in maintaining the identity, size and shape of a meristem.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048771","kind":"concept","label":"tissue remodeling","sources":[{"id":"quickgo.go_0048771","title":"Gene Ontology term GO:0048771 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048771/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue remodeling as: The reorganization or renovation of existing tissues. This process can either change the characteristics of a tissue such as in blood vessel remodeling, or result in the dynamic equilibrium of a tissue such as in bone remodeling.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0050879","kind":"concept","label":"multicellular organismal movement","sources":[{"id":"quickgo.go_0050879","title":"Gene Ontology term GO:0050879 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0050879/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal movement as: Any physiological process involved in changing the position of a multicellular organism or an anatomical part of a multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090130","kind":"concept","label":"tissue migration","sources":[{"id":"quickgo.go_0090130","title":"Gene Ontology term GO:0090130 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090130/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines tissue migration as: The process in which the population of cells that make up a tissue undergo directed movement.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007586","kind":"concept","label":"digestion","sources":[{"id":"quickgo.go_0007586","title":"Gene Ontology term GO:0007586 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007586/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines digestion as: The whole of the physical, chemical, and biochemical processes carried out by multicellular organisms to break down ingested nutrients into components that may be easily absorbed and directed into metabolism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045494","kind":"concept","label":"photoreceptor cell maintenance","sources":[{"id":"quickgo.go_0045494","title":"Gene Ontology term GO:0045494 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045494/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor cell maintenance as: Any process preventing the degeneration of the photoreceptor, a specialized cell type that is sensitive to light.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044706","kind":"concept","label":"multi-multicellular organism process","sources":[{"id":"quickgo.go_0044706","title":"Gene Ontology term GO:0044706 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044706/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multi-multicellular organism process as: A multicellular organism process which involves another multicellular organism of the same or different species.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097207","kind":"concept","label":"bud dormancy process","sources":[{"id":"quickgo.go_0097207","title":"Gene Ontology term GO:0097207 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097207/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bud dormancy process as: A dormancy process in which dormancy (sometimes called a dormant state) is induced, maintained or broken in a bud. Bud dormancy is a suspension of most physiological activity and growth that can be reactivated. It may be a response to environmental conditions such as seasonality or extreme heat, drought, or cold. The exit from bud dormancy is marked by the resumed growth of the bud.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022608","kind":"concept","label":"multicellular organism adhesion","sources":[{"id":"quickgo.go_0022608","title":"Gene Ontology term GO:0022608 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022608/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organism adhesion as: The attachment of a multicellular organism to a substrate or other organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0002532","kind":"concept","label":"production of molecular mediator involved in inflammatory response","sources":[{"id":"quickgo.go_0002532","title":"Gene Ontology term GO:0002532 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0002532/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines production of molecular mediator involved in inflammatory response as: The synthesis or release of any molecular mediator of the inflammatory response following an inflammatory stimulus, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030431","kind":"concept","label":"sleep","sources":[{"id":"quickgo.go_0030431","title":"Gene Ontology term GO:0030431 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030431/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sleep as: Any process in which an organism enters and maintains a periodic, readily reversible state of reduced awareness and metabolic activity. Usually accompanied by physical relaxation, the onset of sleep in humans and other mammals is marked by a change in the electrical activity of the brain.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048871","kind":"concept","label":"multicellular organismal-level homeostasis","sources":[{"id":"quickgo.go_0048871","title":"Gene Ontology term GO:0048871 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048871/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines multicellular organismal-level homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the multicellular organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030588","kind":"concept","label":"pseudocleavage","sources":[{"id":"quickgo.go_0030588","title":"Gene Ontology term GO:0030588 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030588/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pseudocleavage as: Partial constriction of the cytoplasm of a cell to form a furrow that resembles a cleavage furrow but does not complete cytokinesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001763","kind":"concept","label":"morphogenesis of a branching structure","sources":[{"id":"quickgo.go_0001763","title":"Gene Ontology term GO:0001763 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001763/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines morphogenesis of a branching structure as: The process in which the anatomical structures of branches are generated and organized. A branch is a division or offshoot from a main stem. Examples in animals would include blood vessels, nerves, lymphatics and other endothelial or epithelial tubes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031424","kind":"concept","label":"keratinization","sources":[{"id":"quickgo.go_0031424","title":"Gene Ontology term GO:0031424 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031424/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines keratinization as: The process in which the cytoplasm of the outermost cells of the vertebrate epidermis is replaced by keratin. Keratinization occurs in the stratum corneum, feathers, hair, claws, nails, hooves, and horns.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022005","kind":"concept","label":"midbrain-hindbrain boundary maturation during neural plate development","sources":[{"id":"quickgo.go_0022005","title":"Gene Ontology term GO:0022005 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022005/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines midbrain-hindbrain boundary maturation during neural plate development as: A developmental process occurring before the brain has been specified along the neural axis that is required for the midbrain-hindbrain boundary to attain its fully functional state. The midbrain-hindbrain domain of the embryonic brain is comprised of the mesencephalic vesicle and the first rhombencephalic vesicle at early somitogenesis stages. An organizing center at the boundary patterns the midbrain and hindbrain primordia of the neural plate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071684","kind":"concept","label":"organism emergence from protective structure","sources":[{"id":"quickgo.go_0071684","title":"Gene Ontology term GO:0071684 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071684/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organism emergence from protective structure as: The developmental process in which an organism emerges from a surrounding protective structure such as an egg or pupa case.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045056","kind":"concept","label":"transcytosis","sources":[{"id":"quickgo.go_0045056","title":"Gene Ontology term GO:0045056 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045056/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines transcytosis as: The directed movement of endocytosed material through the cell and its exocytosis from the plasma membrane at the opposite side.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0007389","kind":"concept","label":"pattern specification process","sources":[{"id":"quickgo.go_0007389","title":"Gene Ontology term GO:0007389 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0007389/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pattern specification process as: Any developmental process that results in the creation of defined areas or spaces within an organism to which cells respond and eventually are instructed to differentiate.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035074","kind":"concept","label":"pupation","sources":[{"id":"quickgo.go_0035074","title":"Gene Ontology term GO:0035074 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035074/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines pupation as: The act of becoming a pupa, a resting stage in the life cycle of organisms with complete metamorphosis. This event marks the end of the prepupal period and the beginning of the pupal period.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042303","kind":"concept","label":"molting cycle","sources":[{"id":"quickgo.go_0042303","title":"Gene Ontology term GO:0042303 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042303/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle as: The periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin, etc.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0022404","kind":"concept","label":"molting cycle process","sources":[{"id":"quickgo.go_0022404","title":"Gene Ontology term GO:0022404 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0022404/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines molting cycle process as: A multicellular organismal process involved in the periodic casting off and regeneration of an outer covering of cuticle, feathers, hair, horns, skin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035314","kind":"concept","label":"scab formation","sources":[{"id":"quickgo.go_0035314","title":"Gene Ontology term GO:0035314 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035314/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines scab formation as: Formation of hardened covering (a scab) at a wound site. The scab has multiple functions including limiting blood loss, providing structural stability to the wound and guarding against infection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035265","kind":"concept","label":"organ growth","sources":[{"id":"quickgo.go_0035265","title":"Gene Ontology term GO:0035265 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035265/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organ growth as: The increase in size or mass of an organ. Organs are commonly observed as visibly distinct structures, but may also exist as loosely associated clusters of cells that function together as to perform a specific function.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009845","kind":"concept","label":"seed germination","sources":[{"id":"quickgo.go_0009845","title":"Gene Ontology term GO:0009845 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009845/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines seed germination as: The physiological and developmental changes that occur in a seed commencing with water uptake (imbibition) and terminating with the elongation of the embryonic axis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0034381","kind":"concept","label":"plasma lipoprotein particle clearance","sources":[{"id":"quickgo.go_0034381","title":"Gene Ontology term GO:0034381 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0034381/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines plasma lipoprotein particle clearance as: The process in which a lipoprotein particle is removed from the blood via receptor-mediated endocytosis and its constituent parts degraded.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001816","kind":"concept","label":"cytokine production","sources":[{"id":"quickgo.go_0001816","title":"Gene Ontology term GO:0001816 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001816/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytokine production as: The appearance of a cytokine due to biosynthesis or secretion following a cellular stimulus, resulting in an increase in its intracellular or extracellular levels.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044403","kind":"concept","label":"biological process involved in symbiotic interaction","sources":[{"id":"quickgo.go_0044403","title":"Gene Ontology term GO:0044403 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044403/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines biological process involved in symbiotic interaction as: A process carried out by gene products in an organism that enable the organism to engage in a symbiotic relationship, a more or less intimate association, with another organism. The various forms of symbiosis include parasitism, in which the association is disadvantageous or destructive to one of the organisms; mutualism, in which the association is advantageous, or often necessary to one or both and not harmful to either; and commensalism, in which one member of the association benefits while the other is not affected. However, mutualism, parasitism, and commensalism are often not discrete categories of interactions and should rather be perceived as a continuum of interaction ranging from parasitism to mutualism. In fact, the direction of a symbiotic interaction can change during the lifetime of the symbionts due to developmental changes as well as changes in the biotic/abiotic environment in which the interaction occurs. Microscopic symbionts are often referred to as endosymbionts.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140106","kind":"concept","label":"hematophagy","sources":[{"id":"quickgo.go_0140106","title":"Gene Ontology term GO:0140106 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140106/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines hematophagy as: A feeding behavior that involves the ingestion of blood. Hematophagous animals have mouth parts and chemical agents for penetrating vascular structures in the skin of hosts. To overcome natural hemostasis, vasoconstriction, inflammation, and pain sensation in the host, hematophagous animals pre-inject chemical substances with anesthetic and/or anticoagulant properties.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044111","kind":"concept","label":"formation of structure involved in a symbiotic process","sources":[{"id":"quickgo.go_0044111","title":"Gene Ontology term GO:0044111 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044111/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines formation of structure involved in a symbiotic process as: The progression of an organism from an initial condition to a later condition, occurring when the organism is in a symbiotic interaction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0141060","kind":"concept","label":"disruption of anatomical structure in another organism","sources":[{"id":"quickgo.go_0141060","title":"Gene Ontology term GO:0141060 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0141060/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines disruption of anatomical structure in another organism as: The disruption of an anatomical structure of another organism, leading to damage or temporary subversion of that structure.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035821","kind":"concept","label":"modulation of process of another organism","sources":[{"id":"quickgo.go_0035821","title":"Gene Ontology term GO:0035821 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035821/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines modulation of process of another organism as: A process in which an organism effects a change in a biological process in another organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035732","kind":"concept","label":"nitric oxide storage","sources":[{"id":"quickgo.go_0035732","title":"Gene Ontology term GO:0035732 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035732/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nitric oxide storage as: The accumulation and maintenance in cells or tissues of nitric oxide (NO). Nitric oxide is stored in the form of dinitrosyl-iron complexes, which are stabilized, and possibly sequestered, by binding to glutathione S-transferase proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051640","kind":"concept","label":"organelle localization","sources":[{"id":"quickgo.go_0051640","title":"Gene Ontology term GO:0051640 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051640/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle localization as: Any process in which an organelle is transported to, and/or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033036","kind":"concept","label":"macromolecule localization","sources":[{"id":"quickgo.go_0033036","title":"Gene Ontology term GO:0033036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines macromolecule localization as: Any process in which a macromolecule is transported to, or maintained in, a specific location.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097120","kind":"concept","label":"receptor localization to synapse","sources":[{"id":"quickgo.go_0097120","title":"Gene Ontology term GO:0097120 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097120/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines receptor localization to synapse as: Any process in which a receptor is transported to, and/or maintained at the synapse, the junction between a nerve fiber of one neuron and another neuron or muscle fiber or glial cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048878","kind":"concept","label":"chemical homeostasis","sources":[{"id":"quickgo.go_0048878","title":"Gene Ontology term GO:0048878 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048878/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chemical homeostasis as: Any biological process involved in the maintenance of an internal steady state of a chemical.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019725","kind":"concept","label":"cellular homeostasis","sources":[{"id":"quickgo.go_0019725","title":"Gene Ontology term GO:0019725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cellular homeostasis as: Any process involved in the maintenance of an internal steady state at the level of the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140725","kind":"concept","label":"detoxification of free heme","sources":[{"id":"quickgo.go_0140725","title":"Gene Ontology term GO:0140725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of free heme as: Any process that reduces or removes the toxicity of free heme. These include transport of heme away from sensitive areas and to compartments or complexes whose purpose is sequestration of heme.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009407","kind":"concept","label":"toxin catabolic process","sources":[{"id":"quickgo.go_0009407","title":"Gene Ontology term GO:0009407 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009407/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines toxin catabolic process as: The chemical reactions and pathways resulting in the breakdown of toxin, a poisonous compound (typically a protein) that is produced by cells or organisms and that can cause disease when introduced into the body or tissues of an organism.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0010127","kind":"concept","label":"mycothiol-dependent detoxification","sources":[{"id":"quickgo.go_0010127","title":"Gene Ontology term GO:0010127 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0010127/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mycothiol-dependent detoxification as: The chemical reactions using mycothiol to convert an alkylating agent to an S-conjugate of mycothiol. The latter is cleaved to release mercapturic acid which is excreted from the cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0051410","kind":"concept","label":"detoxification of nitrogen compound","sources":[{"id":"quickgo.go_0051410","title":"Gene Ontology term GO:0051410 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0051410/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of nitrogen compound as: Any process that reduces or removes the toxicity of nitrogenous compounds which are dangerous or toxic. This includes the aerobic conversion of toxic compounds to harmless substances.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061687","kind":"concept","label":"detoxification of inorganic compound","sources":[{"id":"quickgo.go_0061687","title":"Gene Ontology term GO:0061687 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061687/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of inorganic compound as: Any process that reduces or removes the toxicity of inorganic compounds. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of inorganic compounds.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140729","kind":"concept","label":"detoxification of endogenously produced metabolite","sources":[{"id":"quickgo.go_0140729","title":"Gene Ontology term GO:0140729 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140729/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of endogenously produced metabolite as: A process that reduces or removes the toxicity of an endogenously produced substance. Mechanisms of resistance to endogenously produced compounds include modification the compound, export, sequestration, or mutations in the target enzyme.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071722","kind":"concept","label":"detoxification of arsenic-containing substance","sources":[{"id":"quickgo.go_0071722","title":"Gene Ontology term GO:0071722 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071722/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines detoxification of arsenic-containing substance as: Any process that reduces or removes the toxicity of compounds containing arsenic, including arsenates, arsenites, and arsenides. These include transport of such compounds away from sensitive areas and to compartments or complexes whose purpose is sequestration of arsenic or arsenic-containing compounds.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019028","kind":"concept","label":"viral capsid","sources":[{"id":"quickgo.go_0019028","title":"Gene Ontology term GO:0019028 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019028/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid as: The protein coat that surrounds the infective nucleic acid in some virus particles. It comprises numerous regularly arranged subunits, or capsomeres.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098061","kind":"concept","label":"viral capsid, internal space","sources":[{"id":"quickgo.go_0098061","title":"Gene Ontology term GO:0098061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, internal space as: The region of a virus contained within the capsid shell, and usually containing the viral genome and accessory proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039642","kind":"concept","label":"virion nucleoid","sources":[{"id":"quickgo.go_0039642","title":"Gene Ontology term GO:0039642 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039642/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion nucleoid as: The region of a virion in which the nucleic acid is confined.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0055036","kind":"concept","label":"virion membrane","sources":[{"id":"quickgo.go_0055036","title":"Gene Ontology term GO:0055036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0055036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virion membrane as: The lipid bilayer surrounding a virion.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019013","kind":"concept","label":"viral nucleocapsid","sources":[{"id":"quickgo.go_0019013","title":"Gene Ontology term GO:0019013 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019013/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral nucleocapsid as: The complete protein-nucleic acid complex that is the packaged form of the genome in a virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039625","kind":"concept","label":"viral inner capsid","sources":[{"id":"quickgo.go_0039625","title":"Gene Ontology term GO:0039625 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039625/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral inner capsid as: The inner layer of a double or triple concentric icosahedral capsid. Inner capsids are part of reoviridae and cystoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039624","kind":"concept","label":"viral outer capsid","sources":[{"id":"quickgo.go_0039624","title":"Gene Ontology term GO:0039624 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039624/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral outer capsid as: The outer layer of a double or triple concentric icosahedral capsid. Outer capsids are part of reoviridae and cystoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0039626","kind":"concept","label":"viral intermediate capsid","sources":[{"id":"quickgo.go_0039626","title":"Gene Ontology term GO:0039626 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0039626/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral intermediate capsid as: The intermediate layer of a triple concentric icosahedral capsid. Intermediate capsids are part of reoviridae virions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098028","kind":"concept","label":"virus tail, shaft","sources":[{"id":"quickgo.go_0098028","title":"Gene Ontology term GO:0098028 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098028/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, shaft as: The tube of the non-contractile tails of some viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098027","kind":"concept","label":"virus tail, sheath","sources":[{"id":"quickgo.go_0098027","title":"Gene Ontology term GO:0098027 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098027/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, sheath as: The external contractile envelope of the tail of some viruses. Its contraction ensures ejection of the virus DNA into the host cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098029","kind":"concept","label":"icosahedral viral capsid, spike","sources":[{"id":"quickgo.go_0098029","title":"Gene Ontology term GO:0098029 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098029/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, spike as: A short structure attached to an icosahedral virion capsid, and used for attachment to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098024","kind":"concept","label":"virus tail, fiber","sources":[{"id":"quickgo.go_0098024","title":"Gene Ontology term GO:0098024 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098024/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, fiber as: The fibrous region of the virus tail used to scan, recognize and attach to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046729","kind":"concept","label":"viral procapsid","sources":[{"id":"quickgo.go_0046729","title":"Gene Ontology term GO:0046729 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046729/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral procapsid as: A stable empty viral capsid produced during the assembly of viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098023","kind":"concept","label":"virus tail, tip","sources":[{"id":"quickgo.go_0098023","title":"Gene Ontology term GO:0098023 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098023/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tip as: The basal end of the virus tail, which is used by the virus to attach to the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0019033","kind":"concept","label":"viral tegument","sources":[{"id":"quickgo.go_0019033","title":"Gene Ontology term GO:0019033 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0019033/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral tegument as: A structure lying between the capsid and envelope of a virus, varying in thickness and often distributed asymmetrically.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046727","kind":"concept","label":"capsomere","sources":[{"id":"quickgo.go_0046727","title":"Gene Ontology term GO:0046727 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046727/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines capsomere as: Any of the protein subunits that comprise the closed shell or coat (capsid) of certain viruses.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098026","kind":"concept","label":"virus tail, tube","sources":[{"id":"quickgo.go_0098026","title":"Gene Ontology term GO:0098026 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098026/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, tube as: The internal tube of the tail of some viruses. The virus tail tube is the channel for DNA ejection into the host cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098015","kind":"concept","label":"virus tail","sources":[{"id":"quickgo.go_0098015","title":"Gene Ontology term GO:0098015 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098015/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail as: Part of the virion that may be used to recognize, attach and inject the viral genome and accessory proteins into the host cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098025","kind":"concept","label":"virus tail, baseplate","sources":[{"id":"quickgo.go_0098025","title":"Gene Ontology term GO:0098025 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098025/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus tail, baseplate as: Multiprotein component at the distal (head) end of the virus tail to which fibers of tailed viruses may be attached.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098031","kind":"concept","label":"icosahedral viral capsid, collar","sources":[{"id":"quickgo.go_0098031","title":"Gene Ontology term GO:0098031 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098031/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, collar as: A small disk located at the base of some icosahedral virus capsids.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098030","kind":"concept","label":"icosahedral viral capsid, neck","sources":[{"id":"quickgo.go_0098030","title":"Gene Ontology term GO:0098030 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098030/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines icosahedral viral capsid, neck as: A region of constriction located below the head and above the tail sheath of viruses with contractile tails (Myoviridae).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098021","kind":"concept","label":"viral capsid, decoration","sources":[{"id":"quickgo.go_0098021","title":"Gene Ontology term GO:0098021 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098021/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral capsid, decoration as: Component of the virus capsid (head), located on the outer head surface. Involved in the stabilization of the head structure and usually non-essential.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0036338","kind":"concept","label":"viral membrane","sources":[{"id":"quickgo.go_0036338","title":"Gene Ontology term GO:0036338 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0036338/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines viral membrane as: The lipid bilayer of a virion, a complete fully infectious extracellular virus particle.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009420","kind":"concept","label":"bacterial-type flagellum filament","sources":[{"id":"quickgo.go_0009420","title":"Gene Ontology term GO:0009420 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009420/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament as: The long (approximately 20 nm), thin external structure of the bacterial-type flagellum, which acts as a propeller.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031672","kind":"concept","label":"A band","sources":[{"id":"quickgo.go_0031672","title":"Gene Ontology term GO:0031672 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031672/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines A band as: The dark-staining region of a sarcomere, in which myosin thick filaments are present; the center is traversed by the paler H zone, which in turn contains the M line.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061834","kind":"concept","label":"actin filament branch point","sources":[{"id":"quickgo.go_0061834","title":"Gene Ontology term GO:0061834 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061834/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin filament branch point as: The part of an actin filament where the structure forks.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048046","kind":"concept","label":"apoplast","sources":[{"id":"quickgo.go_0048046","title":"Gene Ontology term GO:0048046 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048046/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines apoplast as: The cell membranes and intracellular regions in a plant are connected through plasmodesmata, and plants may be described as having two major compartments: the living symplast and the non-living apoplast. The apoplast is external to the plasma membrane and includes cell walls, intercellular spaces and the lumen of dead structures such as xylem vessels. Water and solutes pass freely through it.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009541","kind":"concept","label":"etioplast prolamellar body","sources":[{"id":"quickgo.go_0009541","title":"Gene Ontology term GO:0009541 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009541/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines etioplast prolamellar body as: A three dimensional regular lattice found in etioplasts. It is composed of a continuous system of tubules but when exposed to light the symmetrical arrangement is rapidly lost as tubules become pinched off into two dimensional sections of lattice. These for perforated sheets of membrane that move apart, extend and increase, finally establishing the typical granal and intergranal lamellae of the mature chloroplast.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098843","kind":"concept","label":"postsynaptic endocytic zone","sources":[{"id":"quickgo.go_0098843","title":"Gene Ontology term GO:0098843 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098843/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines postsynaptic endocytic zone as: A stably positioned site of clathrin adjacent and physically attached to the postsynaptic specialization, which is the site of endocytosis of post-synaptic proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005829","kind":"concept","label":"cytosol","sources":[{"id":"quickgo.go_0005829","title":"Gene Ontology term GO:0005829 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005829/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosol as: The part of the cytoplasm that does not contain organelles but which does contain other particulate matter, such as protein complexes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042763","kind":"concept","label":"intracellular immature spore","sources":[{"id":"quickgo.go_0042763","title":"Gene Ontology term GO:0042763 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042763/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intracellular immature spore as: A cell or part of the cell that constitutes an early developmental stage of a spore, a small reproductive body that is highly resistant to desiccation and heat and is capable of growing into a new organism, produced especially by certain bacteria, fungi, algae, and nonflowering plants.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090123","kind":"concept","label":"lysosomal glycocalyx","sources":[{"id":"quickgo.go_0090123","title":"Gene Ontology term GO:0090123 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090123/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal glycocalyx as: The polysaccharide-based coating on the inner side of a lysosomal membrane. It may be involved in protecting the membrane from digestion by lysosomal enzymes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009431","kind":"concept","label":"bacterial-type flagellum basal body, MS ring","sources":[{"id":"quickgo.go_0009431","title":"Gene Ontology term GO:0009431 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009431/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, MS ring as: One of the rings of the bacterial-type flagellar basal body; a double-flanged ring that anchors the basal body to the cytoplasmic membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0150034","kind":"concept","label":"distal axon","sources":[{"id":"quickgo.go_0150034","title":"Gene Ontology term GO:0150034 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0150034/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal axon as: That part of an axon close to and including the growth cone or the axon terminus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061822","kind":"concept","label":"ciliary cap","sources":[{"id":"quickgo.go_0061822","title":"Gene Ontology term GO:0061822 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061822/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary cap as: An intracellular compartmentalized cilium structure found in insect spermatids which is bounded by a membrane derived from the invagination of the cell membrane that remains associated with the primary cilium as it is internalized. The ciliary cap is maintained at the end of the axoneme distal to the centriole and is separated from the cytosolic axoneme/cytoplasm by a putative transition zone, which may extend into the ciliary cap, and include a structure at the base of the ciliary cap termed the ring centriole.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0046818","kind":"concept","label":"dense nuclear body","sources":[{"id":"quickgo.go_0046818","title":"Gene Ontology term GO:0046818 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0046818/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense nuclear body as: A location in the host cell nucleus where viral proteins colocalize late in infection prior to the onset of viral DNA synthesis. More than one site can be present simultaneously.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031430","kind":"concept","label":"M band","sources":[{"id":"quickgo.go_0031430","title":"Gene Ontology term GO:0031430 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031430/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines M band as: The midline of aligned thick filaments in a sarcomere; location of specific proteins that link thick filaments. Depending on muscle type the M band consists of different numbers of M lines.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001917","kind":"concept","label":"photoreceptor inner segment","sources":[{"id":"quickgo.go_0001917","title":"Gene Ontology term GO:0001917 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001917/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor inner segment as: The inner segment of a vertebrate photoreceptor containing mitochondria, ribosomes and membranes where opsin molecules are assembled and passed to be part of the outer segment discs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060104","kind":"concept","label":"surface coat of collagen and cuticulin-based cuticle extracellular matrix","sources":[{"id":"quickgo.go_0060104","title":"Gene Ontology term GO:0060104 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060104/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines surface coat of collagen and cuticulin-based cuticle extracellular matrix as: An electron dense, amorphous envelope that comprises the outermost layer of the cuticle. The surface coat is loosely apposed to the epicuticle, has distinct biochemical properties, is synthesized by cells other than the underlying hypodermis, and is labile. In addition to serving as a lubricant to protect against abrasion and dehydration, the surface coat may also play important roles in infection and immune evasion. An example of this component is found in Caenorhabditis elegans.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120102","kind":"concept","label":"bacterial-type flagellum secretion apparatus","sources":[{"id":"quickgo.go_0120102","title":"Gene Ontology term GO:0120102 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120102/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum secretion apparatus as: A part of the bacterial-type flagellum that is located at the cytoplasmic side of the MS ring and composed of six membrane proteins (FlhA, FlhB, FliP, FliQ, FliR, and FliO, or orthologs thereof) and three soluble proteins (FliI, FliH, and FliJ, or orthologs thereof) in the cytoplasm. It is responsible for secretion of flagellar type III protein substrates, including the proteins of the flagellar rod, hook, and filament.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061845","kind":"concept","label":"neuron projection branch point","sources":[{"id":"quickgo.go_0061845","title":"Gene Ontology term GO:0061845 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061845/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines neuron projection branch point as: The location where a secondary projection arises from a neuron projection.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001750","kind":"concept","label":"photoreceptor outer segment","sources":[{"id":"quickgo.go_0001750","title":"Gene Ontology term GO:0001750 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001750/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines photoreceptor outer segment as: The outer segment of a vertebrate photoreceptor that contains a stack of membrane discs embedded with photoreceptor proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032179","kind":"concept","label":"germ tube","sources":[{"id":"quickgo.go_0032179","title":"Gene Ontology term GO:0032179 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032179/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines germ tube as: The slender tubular outgrowth first produced by most spores in germination.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001400","kind":"concept","label":"mating projection base","sources":[{"id":"quickgo.go_0001400","title":"Gene Ontology term GO:0001400 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001400/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mating projection base as: The region where the mating projection meets the bulk of the cell, in unicellular fungi exposed to mating pheromone.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0016328","kind":"concept","label":"lateral plasma membrane","sources":[{"id":"quickgo.go_0016328","title":"Gene Ontology term GO:0016328 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0016328/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lateral plasma membrane as: The portion of the plasma membrane at the lateral side of the cell. In epithelial cells, lateral plasma membranes are on the sides of cells which lie at the interface of adjacent cells.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043672","kind":"concept","label":"nexine","sources":[{"id":"quickgo.go_0043672","title":"Gene Ontology term GO:0043672 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043672/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nexine as: The inner, non-sculptured part of the exine which lies below the sexine.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090692","kind":"concept","label":"mitochondrial membrane scission site","sources":[{"id":"quickgo.go_0090692","title":"Gene Ontology term GO:0090692 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090692/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial membrane scission site as: The site on the mitochondrial membrane where the separation of a single continuous mitochondrial membrane into two membranes occurs as a final step in mitochondrial fission.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097595","kind":"concept","label":"ventral disc crossbridge","sources":[{"id":"quickgo.go_0097595","title":"Gene Ontology term GO:0097595 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097595/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc crossbridge as: Structure horizontally linking adjacent microribbons of the ventral disc in Giardia species (trophozoite stage). The composition of crossbridges is not fully known yet.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005576","kind":"concept","label":"extracellular region","sources":[{"id":"quickgo.go_0005576","title":"Gene Ontology term GO:0005576 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005576/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular region as: The space external to the outermost structure of a cell. For cells without external protective or external encapsulating structures this refers to space outside of the plasma membrane. This term covers the host cell environment outside an intracellular parasite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090726","kind":"concept","label":"cortical dynamic polarity patch","sources":[{"id":"quickgo.go_0090726","title":"Gene Ontology term GO:0090726 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090726/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cortical dynamic polarity patch as: A region of the cell cortex that contains a higher concentration of growth polarity factors than the surrounding cortex and that changes position over time. An example is found in fission yeast cells during early mating, in which the GTPase Cdc42 dynamically to discrete zones within the cortex prior to shmoo formation.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031257","kind":"concept","label":"cell trailing edge membrane","sources":[{"id":"quickgo.go_0031257","title":"Gene Ontology term GO:0031257 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031257/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell trailing edge membrane as: The portion of the plasma membrane surrounding the trailing edge of a motile cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001652","kind":"concept","label":"granular component","sources":[{"id":"quickgo.go_0001652","title":"Gene Ontology term GO:0001652 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001652/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines granular component as: A structure found in the nucleolus, which contains nearly completed preribosomal particles destined for the cytoplasm.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120135","kind":"concept","label":"distal portion of axoneme","sources":[{"id":"quickgo.go_0120135","title":"Gene Ontology term GO:0120135 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120135/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines distal portion of axoneme as: The portion of the axoneme that is close to the tip of the cilium.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030061","kind":"concept","label":"mitochondrial crista","sources":[{"id":"quickgo.go_0030061","title":"Gene Ontology term GO:0030061 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030061/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial crista as: Any of the inward folds of the mitochondrial inner membrane. Their number, extent, and shape differ in mitochondria from different tissues and organisms. They appear to be devices for increasing the surface area of the mitochondrial inner membrane, where the enzymes of electron transport and oxidative phosphorylation are found. Their shape can vary with the respiratory state of the mitochondria.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097683","kind":"concept","label":"dinoflagellate apex","sources":[{"id":"quickgo.go_0097683","title":"Gene Ontology term GO:0097683 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097683/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate apex as: The anterior most point of a dinoflagellate epicone.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0085036","kind":"concept","label":"extrahaustorial matrix","sources":[{"id":"quickgo.go_0085036","title":"Gene Ontology term GO:0085036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0085036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extrahaustorial matrix as: The space between the symbiont plasma membrane and the extrahaustorial membrane of the host.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120321","kind":"concept","label":"nuclear envelope adjacent to nuclear pore complex","sources":[{"id":"quickgo.go_0120321","title":"Gene Ontology term GO:0120321 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120321/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear envelope adjacent to nuclear pore complex as: The region of the nuclear envelope situated in close proximity to a nuclear pore complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009574","kind":"concept","label":"preprophase band","sources":[{"id":"quickgo.go_0009574","title":"Gene Ontology term GO:0009574 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009574/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines preprophase band as: A dense band of microtubules, 1-3 pm wide, that appears just beneath the cell membrane before the start of cell division in the cells of higher plants. It precedes the onset of prophase and then disappears as mitosis begins, yet it somehow determines the plane of orientation of the new cell plate forming in late telophase and marks the zone of the parental cell wall where fusion with the growing cell plate ultimately occurs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097562","kind":"concept","label":"left lateral basal body pair","sources":[{"id":"quickgo.go_0097562","title":"Gene Ontology term GO:0097562 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097562/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines left lateral basal body pair as: Set of two basal bodies found in Giardia species (trophozoite stage). It comprises the anterior and ventral basal bodies located to the right of the left nucleus of the trophozoite when viewed dorsally.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0014705","kind":"concept","label":"C zone","sources":[{"id":"quickgo.go_0014705","title":"Gene Ontology term GO:0014705 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0014705/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines C zone as: A region of the A band in which myosin-binding protein C is located and that can be seen by electron microscopy. This is a functional zone that also includes myosin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0072324","kind":"concept","label":"ascus epiplasm","sources":[{"id":"quickgo.go_0072324","title":"Gene Ontology term GO:0072324 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0072324/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ascus epiplasm as: Ascus cytoplasm that is not packaged into ascospores.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097002","kind":"concept","label":"mitochondrial inner boundary membrane","sources":[{"id":"quickgo.go_0097002","title":"Gene Ontology term GO:0097002 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097002/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitochondrial inner boundary membrane as: The portion of the mitochondrial inner membrane that is not invaginated to form cristae. The inner boundary membrane lies parallel to the outer membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990047","kind":"concept","label":"spindle matrix","sources":[{"id":"quickgo.go_1990047","title":"Gene Ontology term GO:1990047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spindle matrix as: A proteinaceous, nuclear-derived structure that embeds the microtubule spindle apparatus from pole to pole in a microtubule-independent manner during mitosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0070057","kind":"concept","label":"prospore membrane spindle pole body attachment site","sources":[{"id":"quickgo.go_0070057","title":"Gene Ontology term GO:0070057 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0070057/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines prospore membrane spindle pole body attachment site as: The region of the prospore membrane to which the spindle pole body (SPB) is anchored; the prospore membrane extends from the SPB attachment site to surround the spore nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099522","kind":"concept","label":"cytosolic region","sources":[{"id":"quickgo.go_0099522","title":"Gene Ontology term GO:0099522 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099522/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cytosolic region as: Any (proper) part of the cytosol of a single cell of sufficient size to still be considered cytosol.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060105","kind":"concept","label":"epicuticle of collagen and cuticulin-based cuticle extracellular matrix","sources":[{"id":"quickgo.go_0060105","title":"Gene Ontology term GO:0060105 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060105/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines epicuticle of collagen and cuticulin-based cuticle extracellular matrix as: A lipid-containing layer of cuticle that lies between the cortical layer and the surface coat. An example of this component is found in Caenorhabditis elegans.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001772","kind":"concept","label":"immunological synapse","sources":[{"id":"quickgo.go_0001772","title":"Gene Ontology term GO:0001772 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001772/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines immunological synapse as: An area of close contact between a lymphocyte (T-, B-, or natural killer cell) and a target cell formed through the clustering of particular signaling and adhesion molecules and their associated membrane rafts on both the lymphocyte and the target cell and facilitating activation of the lymphocyte, transfer of membrane from the target cell to the lymphocyte, and in some situations killing of the target cell through release of secretory granules and/or death-pathway ligand-receptor interaction.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005652","kind":"concept","label":"nuclear lamina","sources":[{"id":"quickgo.go_0005652","title":"Gene Ontology term GO:0005652 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005652/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nuclear lamina as: The fibrous, electron-dense layer lying on the nucleoplasmic side of the inner membrane of a cell nucleus, composed of lamin filaments. The polypeptides of the lamina are thought to be concerned in the dissolution of the nuclear envelope and its re-formation during mitosis. The lamina is composed of lamin A and lamin C filaments cross-linked into an orthogonal lattice, which is attached via lamin B to the inner nuclear membrane through interactions with a lamin B receptor, an IFAP, in the membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043671","kind":"concept","label":"endexine","sources":[{"id":"quickgo.go_0043671","title":"Gene Ontology term GO:0043671 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043671/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines endexine as: The inner part of the exine, which stains.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0020023","kind":"concept","label":"kinetoplast","sources":[{"id":"quickgo.go_0020023","title":"Gene Ontology term GO:0020023 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0020023/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines kinetoplast as: A sub-structure within the large single mitochondrion of kinetoplastid parasites and which is closely associated with the flagellar pocket and basal body of the flagellum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032178","kind":"concept","label":"medial membrane band","sources":[{"id":"quickgo.go_0032178","title":"Gene Ontology term GO:0032178 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032178/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines medial membrane band as: A sterol-rich region of the plasma membrane which forms at the cell surface overlying the contractile ring and spreads into the invaginating plasma membrane surrounding the septum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097596","kind":"concept","label":"ventral disc supernumerary microtubule array","sources":[{"id":"quickgo.go_0097596","title":"Gene Ontology term GO:0097596 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097596/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc supernumerary microtubule array as: A partial left-handed spiral array of microtubules that lies generally dorsal to the main ventral disc microtubule array in Giardia species (trophozoite stage).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030315","kind":"concept","label":"T-tubule","sources":[{"id":"quickgo.go_0030315","title":"Gene Ontology term GO:0030315 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030315/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines T-tubule as: Invagination of the plasma membrane of a muscle cell that extends inward from the cell surface around each myofibril. The ends of T-tubules make contact with the sarcoplasmic reticulum membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035749","kind":"concept","label":"myelin sheath adaxonal region","sources":[{"id":"quickgo.go_0035749","title":"Gene Ontology term GO:0035749 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035749/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines myelin sheath adaxonal region as: The region of the myelin sheath nearest to the axon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go7770129","kind":"concept","label":"spermatid residual body","sources":[{"id":"quickgo.go_7770129","title":"Gene Ontology term GO:7770129 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:7770129/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines spermatid residual body as: A membrane-bounded, anucleate mass of cytoplasm that is separated from one or more developing male germ cells during spermatogenesis and discarded. The residual body receives most of the cytoplasm and organelles not required by the spermatid or spermatozoon, such as ribosomes, endoplasmic reticulum, Golgi, and excess cytoskeletal components, and is subsequently degraded, typically by phagocytosis by somatic cells of the gonad (e.g. Sertoli cells in vertebrates, gonadal sheath cells in nematodes) or by extrusion into the reproductive tract.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031256","kind":"concept","label":"leading edge membrane","sources":[{"id":"quickgo.go_0031256","title":"Gene Ontology term GO:0031256 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031256/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines leading edge membrane as: The portion of the plasma membrane surrounding the leading edge of a motile cell.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140599","kind":"concept","label":"mitotic nuclear bridge midzone membrane domain","sources":[{"id":"quickgo.go_0140599","title":"Gene Ontology term GO:0140599 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140599/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge midzone membrane domain as: A nuclear membrane part at the midzone of the mitotic nuclear bridge. The midzone forms a bulge that is enriched in nuclear pores that lack baskets.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001651","kind":"concept","label":"dense fibrillar component","sources":[{"id":"quickgo.go_0001651","title":"Gene Ontology term GO:0001651 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001651/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dense fibrillar component as: A structure found in the nucleolus, which contains newly synthesized preribosomal RNA (pre-rRNA) and a collection of proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009422","kind":"concept","label":"bacterial-type flagellum hook-filament junction","sources":[{"id":"quickgo.go_0009422","title":"Gene Ontology term GO:0009422 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009422/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook-filament junction as: The region of the bacterial-type flagellum where the hook and filament meet.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090637","kind":"concept","label":"inner dense plaque of desmosome","sources":[{"id":"quickgo.go_0090637","title":"Gene Ontology term GO:0090637 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090637/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines inner dense plaque of desmosome as: The desmosomal part containing the C-termini of desmoplakins which interact with the keratin intermediate filaments, serving to tether the intermediate filaments to the plasma membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031674","kind":"concept","label":"I band","sources":[{"id":"quickgo.go_0031674","title":"Gene Ontology term GO:0031674 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031674/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines I band as: A region of a sarcomere that appears as a light band on each side of the Z disc, comprising a region of the sarcomere where thin (actin) filaments are not overlapped by thick (myosin) filaments; contains actin, troponin, and tropomyosin; each sarcomere includes half of an I band at each end.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0170047","kind":"concept","label":"virus-like capsid","sources":[{"id":"quickgo.go_0170047","title":"Gene Ontology term GO:0170047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0170047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines virus-like capsid as: A protein coat that surrounds nucleic acid to form a structure similar to a virus capsid. Virus-like capsids are non-infectious and are encoded by endogenous (non-viral) genes. Fly and tetrapod Arc (ancestrally-related to retrotransposon Gag) are examples of proteins that can self-assemble into capsid-like structures which encapsulate Arc mRNA and mediate the intercellular transmission of RNA.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0012505","kind":"concept","label":"endomembrane system","sources":[{"id":"quickgo.go_0012505","title":"Gene Ontology term GO:0012505 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0012505/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines endomembrane system as: A collection of membranous structures involved in transport within the cell. The main components of the endomembrane system are endoplasmic reticulum, Golgi bodies, vesicles, cell membrane and nuclear envelope. Members of the endomembrane system pass materials through each other or though the use of vesicles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043226","kind":"concept","label":"organelle","sources":[{"id":"quickgo.go_0043226","title":"Gene Ontology term GO:0043226 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043226/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle as: Organized structure of distinctive morphology and function. Includes the nucleus, mitochondria, plastids, vacuoles, vesicles, ribosomes and the cytoskeleton, and prokaryotic structures such as anammoxosomes and pirellulosomes. Excludes the plasma membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043203","kind":"concept","label":"axon hillock","sources":[{"id":"quickgo.go_0043203","title":"Gene Ontology term GO:0043203 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043203/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines axon hillock as: Portion of the neuronal cell soma from which the axon originates.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0014801","kind":"concept","label":"longitudinal sarcoplasmic reticulum","sources":[{"id":"quickgo.go_0014801","title":"Gene Ontology term GO:0014801 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0014801/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines longitudinal sarcoplasmic reticulum as: The portion of the free sarcoplasmic reticulum consisting of longitudinal tubules that connect terminal cisternae.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097047","kind":"concept","label":"DNA replication termination region","sources":[{"id":"quickgo.go_0097047","title":"Gene Ontology term GO:0097047 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097047/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines DNA replication termination region as: A chromosomal region that contains fork pausing elements influencing the progression and merging of DNA replication forks.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042995","kind":"concept","label":"cell projection","sources":[{"id":"quickgo.go_0042995","title":"Gene Ontology term GO:0042995 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042995/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell projection as: A prolongation or process extending from a cell, e.g. a flagellum or axon.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009433","kind":"concept","label":"bacterial-type flagellum basal body, C ring","sources":[{"id":"quickgo.go_0009433","title":"Gene Ontology term GO:0009433 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009433/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum basal body, C ring as: Cytoplasmic ring located at the base of the bacterial-type flagellar basal body; acts as a rotor; includes three switch proteins, which generate torque and can change their conformational state in a bimodal fashion, so that the motor direction can switch between clockwise and counterclockwise.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120104","kind":"concept","label":"mitotic actomyosin contractile ring, proximal layer","sources":[{"id":"quickgo.go_0120104","title":"Gene Ontology term GO:0120104 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120104/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic actomyosin contractile ring, proximal layer as: The region of the mitotic actomyosin ring adjacent to the plasma membrane where membrane bound scaffolds are located.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005630","kind":"concept","label":"dityrosine layer of spore wall","sources":[{"id":"quickgo.go_0005630","title":"Gene Ontology term GO:0005630 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005630/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dityrosine layer of spore wall as: The outermost layer of the spore wall, as described in Saccharomyces.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001650","kind":"concept","label":"fibrillar center","sources":[{"id":"quickgo.go_0001650","title":"Gene Ontology term GO:0001650 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001650/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines fibrillar center as: A structure found most metazoan nucleoli, but not usually found in lower eukaryotes; surrounded by the dense fibrillar component; the zone of transcription from multiple copies of the pre-rRNA genes is in the border region between these two structures.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990836","kind":"concept","label":"lysosomal matrix","sources":[{"id":"quickgo.go_1990836","title":"Gene Ontology term GO:1990836 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990836/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines lysosomal matrix as: A matrix composed of supramolecular assemblies of lysosomal enzymes and lipids which forms at a pH of 5.0 within the lysosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097593","kind":"concept","label":"ventral disc microtubule array","sources":[{"id":"quickgo.go_0097593","title":"Gene Ontology term GO:0097593 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097593/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc microtubule array as: A part of the ventral disc of Giardia species (trophozoite stage) consisting of a spiral array of microtubules linked to the ventral membrane. These microtubules form the base of the ventral disc dorsal microribbons that extend nearly perpendicular from the membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043670","kind":"concept","label":"foot layer","sources":[{"id":"quickgo.go_0043670","title":"Gene Ontology term GO:0043670 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043670/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines foot layer as: The inner layer of the ectexine.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0106126","kind":"concept","label":"reservosome membrane","sources":[{"id":"quickgo.go_0106126","title":"Gene Ontology term GO:0106126 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0106126/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome membrane as: The lipid bilayer surrounding a reservosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090724","kind":"concept","label":"central region of growth cone","sources":[{"id":"quickgo.go_0090724","title":"Gene Ontology term GO:0090724 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090724/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines central region of growth cone as: The center of the migrating motile tip of a growing nerve cell axon or dendrite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120082","kind":"concept","label":"smooth endoplasmic reticulum cisterna","sources":[{"id":"quickgo.go_0120082","title":"Gene Ontology term GO:0120082 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120082/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines smooth endoplasmic reticulum cisterna as: A subcompartment of the smooth endoplasmic reticulum consisting of lumenal expansion into a flattened, disc-shaped cavity.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0120212","kind":"concept","label":"sperm head-tail coupling apparatus","sources":[{"id":"quickgo.go_0120212","title":"Gene Ontology term GO:0120212 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0120212/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm head-tail coupling apparatus as: A centrosome-based structure consisting of two cylindrical microtubule-based centrioles and associated components which anchors the flagellum to the sperm head.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061835","kind":"concept","label":"ventral surface of cell","sources":[{"id":"quickgo.go_0061835","title":"Gene Ontology term GO:0061835 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061835/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral surface of cell as: The surface of a migrating cell that is in contact with the substratum or cell layer.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0071808","kind":"concept","label":"satellite fibril","sources":[{"id":"quickgo.go_0071808","title":"Gene Ontology term GO:0071808 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0071808/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines satellite fibril as: An axoneme part that is found in the flagella of mammalian sperm and is located in the middle piece between the outer dense fibers (on the concave side of outer dense fibers as seen in cross-section).","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009421","kind":"concept","label":"bacterial-type flagellum filament cap","sources":[{"id":"quickgo.go_0009421","title":"Gene Ontology term GO:0009421 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009421/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum filament cap as: The proteinaceous structure at the distal tip of the bacterial-type flagellar filament.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0031673","kind":"concept","label":"H zone","sources":[{"id":"quickgo.go_0031673","title":"Gene Ontology term GO:0031673 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0031673/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines H zone as: A relatively pale zone traversing the center of the A band of a sarcomere, visible in relaxed muscle fibers; consists of the central portion of thick (myosin) filaments that are not overlapped by thin (actin) filaments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0033774","kind":"concept","label":"basal labyrinth","sources":[{"id":"quickgo.go_0033774","title":"Gene Ontology term GO:0033774 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0033774/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines basal labyrinth as: A region in the lower half of some cells formed from extensive infoldings of the basal plasma membrane; includes cytoplasm adjacent to the infolded membrane.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009542","kind":"concept","label":"granum","sources":[{"id":"quickgo.go_0009542","title":"Gene Ontology term GO:0009542 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009542/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines granum as: Distinct stack of lamellae seen within chloroplasts. Grana contain the pigments, electron transfer compounds, and enzymes essential to the light-dependent reactions of photosynthesis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043204","kind":"concept","label":"perikaryon","sources":[{"id":"quickgo.go_0043204","title":"Gene Ontology term GO:0043204 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043204/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines perikaryon as: The portion of the cell soma (neuronal cell body) that excludes the nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0001891","kind":"concept","label":"phagocytic cup","sources":[{"id":"quickgo.go_0001891","title":"Gene Ontology term GO:0001891 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0001891/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines phagocytic cup as: An invagination of the cell membrane formed by an actin dependent process during phagocytosis. Following internalization it is converted into a phagosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0044232","kind":"concept","label":"organelle membrane contact site","sources":[{"id":"quickgo.go_0044232","title":"Gene Ontology term GO:0044232 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0044232/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines organelle membrane contact site as: A zone of apposition between the membranes of an organelle with another membrane, either another membrane of the same organelle, a membrane of another organelle, or the plasma membrane. Membrane contact sites (MCSs) are structured by bridging complexes. They are specialized for communication, including the efficient traffic of small molecules such as Ca2+ ions and lipids, as well as enzyme-substrate interactions.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0061823","kind":"concept","label":"ring centriole","sources":[{"id":"quickgo.go_0061823","title":"Gene Ontology term GO:0061823 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0061823/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ring centriole as: A ring-like structure observed at the base of the ciliary cap of insect spermatids. This structure may anchor the axoneme to the ciliary cap membrane and/or act as a diffusion barrier, proposed to be analogous to the annulus of mammalian sperm flagellum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030427","kind":"concept","label":"site of polarized growth","sources":[{"id":"quickgo.go_0030427","title":"Gene Ontology term GO:0030427 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030427/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines site of polarized growth as: Any part of a cell where non-isotropic growth takes place.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043083","kind":"concept","label":"synaptic cleft","sources":[{"id":"quickgo.go_0043083","title":"Gene Ontology term GO:0043083 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043083/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptic cleft as: The narrow gap that separates the presynaptic and postsynaptic membranes, into which neurotransmitter is released.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0048471","kind":"concept","label":"perinuclear region of cytoplasm","sources":[{"id":"quickgo.go_0048471","title":"Gene Ontology term GO:0048471 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0048471/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines perinuclear region of cytoplasm as: Cytoplasm situated near, or occurring around, the nucleus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099086","kind":"concept","label":"synaptonemal structure","sources":[{"id":"quickgo.go_0099086","title":"Gene Ontology term GO:0099086 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099086/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines synaptonemal structure as: A proteinaceous scaffold found between homologous chromosomes during meiosis.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0042641","kind":"concept","label":"actomyosin","sources":[{"id":"quickgo.go_0042641","title":"Gene Ontology term GO:0042641 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0042641/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actomyosin as: Any complex of actin, myosin, and accessory proteins.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005654","kind":"concept","label":"nucleoplasm","sources":[{"id":"quickgo.go_0005654","title":"Gene Ontology term GO:0005654 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005654/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasm as: That part of the nuclear content other than the chromosomes or the nucleolus.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0070701","kind":"concept","label":"mucus layer","sources":[{"id":"quickgo.go_0070701","title":"Gene Ontology term GO:0070701 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0070701/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mucus layer as: An extracellular region part that consists of a protective layer of mucus secreted by epithelial cells lining tubular organs of the body such as the colon or secreted into fluids such as saliva. Mucus is a viscous slimy secretion consisting of mucins (i.e. highly glycosylated mucin proteins) and various inorganic salts dissolved in water, with suspended epithelial cells and leukocytes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005631","kind":"concept","label":"chitosan layer of spore wall","sources":[{"id":"quickgo.go_0005631","title":"Gene Ontology term GO:0005631 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005631/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chitosan layer of spore wall as: The second outermost layer of the spore wall, as described in Saccharomyces.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097594","kind":"concept","label":"ventral disc dorsal microribbon","sources":[{"id":"quickgo.go_0097594","title":"Gene Ontology term GO:0097594 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097594/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ventral disc dorsal microribbon as: Trilaminar structure extending perpendicularly into the cytoplasm along the length of ventral disc microtubules in Giardia species (trophozoite stage). Constituents of dorsal microribbons (also called dorsal ribbons or microribbons) include alpha-coiled-helix proteins approximately 29 to 38 kDa in size. These proteins line the edges of the microribbons but are not found in microtubules. Tubulins are not found in microribbons.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0106125","kind":"concept","label":"reservosome matrix","sources":[{"id":"quickgo.go_0106125","title":"Gene Ontology term GO:0106125 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0106125/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines reservosome matrix as: A matrix composed of planar membranes, vesicles and lipid inclusions within the reservosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090725","kind":"concept","label":"peripheral region of growth cone","sources":[{"id":"quickgo.go_0090725","title":"Gene Ontology term GO:0090725 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090725/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines peripheral region of growth cone as: The non-central region or periphery of the migrating motile tip of a growing nerve cell axon or dendrite.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140918","kind":"concept","label":"centrosomal core","sources":[{"id":"quickgo.go_0140918","title":"Gene Ontology term GO:0140918 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140918/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines centrosomal core as: The core region of the centrosome, a layered structure containing proteins, surrounded by the centrosomal corona. The core duplicates once per cell cycle at the G2/M transition when two outer layers form the mitotic spindle poles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0032153","kind":"concept","label":"cell division site","sources":[{"id":"quickgo.go_0032153","title":"Gene Ontology term GO:0032153 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0032153/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cell division site as: The eventual plane of cell division (also known as cell cleavage or cytokinesis) in a dividing cell. In Eukaryotes, the cleavage apparatus, composed of septin structures and the actomyosin contractile ring, forms along this plane, and the mitotic, or meiotic, spindle is aligned perpendicular to the division plane. In bacteria, the cell division site is generally located at mid-cell and is the site at which the cytoskeletal structure, the Z-ring, assembles.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090635","kind":"concept","label":"extracellular core region of desmosome","sources":[{"id":"quickgo.go_0090635","title":"Gene Ontology term GO:0090635 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090635/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines extracellular core region of desmosome as: The desmosomal part containing the desmosomal cadherins, desmogleins and desmocollins, that establish contact and adhere to neighboring cells in a Ca2+-dependent manner.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090405","kind":"concept","label":"unicellular trichome branch","sources":[{"id":"quickgo.go_0090405","title":"Gene Ontology term GO:0090405 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090405/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines unicellular trichome branch as: A cell projection part that is a branch of a unicellular trichome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0140511","kind":"concept","label":"mitotic nuclear bridge stalk","sources":[{"id":"quickgo.go_0140511","title":"Gene Ontology term GO:0140511 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0140511/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines mitotic nuclear bridge stalk as: Either of the regions of a mitotic nuclear bridge proximal to the main portion of each daughter nucleus. The nuclear envelope in the stalk regions is depleted of nuclear pore complexes.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0090658","kind":"concept","label":"cone matrix sheath","sources":[{"id":"quickgo.go_0090658","title":"Gene Ontology term GO:0090658 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0090658/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cone matrix sheath as: A biochemically and structurally distinct domain of the retinal interphotoreceptor matrix that is specifically associated with cone photoreceptor cell inner and outer segments.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0009424","kind":"concept","label":"bacterial-type flagellum hook","sources":[{"id":"quickgo.go_0009424","title":"Gene Ontology term GO:0009424 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0009424/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines bacterial-type flagellum hook as: The portion of the bacterial-type flagellum that connects the filament to the basal body.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0099079","kind":"concept","label":"actin body","sources":[{"id":"quickgo.go_0099079","title":"Gene Ontology term GO:0099079 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0099079/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines actin body as: An amorphous cytoskeletal structure consisting of aggregated actin filaments and associated proteins (including fibrin and capping protein) in which there is little or no actin filament turnover. In yeast (S. pombe and S. cerevisiae) these are found only in quiescent cells and are thought to serve as a reserve store of actin.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0030017","kind":"concept","label":"sarcomere","sources":[{"id":"quickgo.go_0030017","title":"Gene Ontology term GO:0030017 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0030017/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sarcomere as: The repeating unit of a myofibril in a muscle cell, composed of an array of overlapping thick and thin filaments between two adjacent Z discs.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043036","kind":"concept","label":"starch grain","sources":[{"id":"quickgo.go_0043036","title":"Gene Ontology term GO:0043036 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043036/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines starch grain as: Plant storage body for amylose and amylopectin, 1-100um in diameter. Also contains small amounts of enzymes, amino acids, lipids and nucleic acids. The shape of the grain varies widely amongst species, but is often spherical or disk-shaped.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990826","kind":"concept","label":"nucleoplasmic periphery of the nuclear pore complex","sources":[{"id":"quickgo.go_1990826","title":"Gene Ontology term GO:1990826 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990826/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines nucleoplasmic periphery of the nuclear pore complex as: Nucleoplasm situated in close proximity and peripheral to a nuclear pore complex.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0098862","kind":"concept","label":"cluster of actin-based cell projections","sources":[{"id":"quickgo.go_0098862","title":"Gene Ontology term GO:0098862 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0098862/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines cluster of actin-based cell projections as: A cell part consisting of multiple, closely packed actin-based cell projections.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0035686","kind":"concept","label":"sperm fibrous sheath","sources":[{"id":"quickgo.go_0035686","title":"Gene Ontology term GO:0035686 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0035686/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines sperm fibrous sheath as: A cytoskeletal structure surrounding the axoneme and outer dense fibers of the sperm flagellum. Consists of two longitudinal columns connected by closely arrayed semicircular ribs that assemble from distal to proximal throughout spermiogenesis. The fibrous sheath probably influences the degree of flexibility, plane of flagellar motion, and the shape of the flagellar beat.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0043220","kind":"concept","label":"Schmidt-Lanterman incisure","sources":[{"id":"quickgo.go_0043220","title":"Gene Ontology term GO:0043220 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0043220/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines Schmidt-Lanterman incisure as: Regions within compact myelin in which the cytoplasmic faces of the enveloping myelin sheath are not tightly juxtaposed, and include cytoplasm from the cell responsible for making the myelin. Schmidt-Lanterman incisures occur in the compact myelin internode, while lateral loops are analogous structures found in the paranodal region adjacent to the nodes of Ranvier.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0020038","kind":"concept","label":"subpellicular network","sources":[{"id":"quickgo.go_0020038","title":"Gene Ontology term GO:0020038 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0020038/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines subpellicular network as: A mechanically stable cytoskeletal structure associated with the cytoplasmic face of the pellicle and surrounding the microtubule-based cytoskeleton.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0097614","kind":"concept","label":"dinoflagellate hypocone","sources":[{"id":"quickgo.go_0097614","title":"Gene Ontology term GO:0097614 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0097614/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines dinoflagellate hypocone as: The part of a dinoflagellate cell below the cingulum; also referred to as the posterior portion of a dinoflagellate cell. It is separated from the epicone by the cingulum.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0000785","kind":"concept","label":"chromatin","sources":[{"id":"quickgo.go_0000785","title":"Gene Ontology term GO:0000785 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0000785/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines chromatin as: The ordered and organized complex of DNA, protein, and sometimes RNA, that forms the chromosome.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0045171","kind":"concept","label":"intercellular bridge","sources":[{"id":"quickgo.go_0045171","title":"Gene Ontology term GO:0045171 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0045171/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines intercellular bridge as: A direct connection between the cytoplasm of two cells that is formed following the completion of cleavage furrow ingression during cell division. They are usually present only briefly prior to completion of cytokinesis. However, in some cases, such as the bridges between germ cells during their development, they become stabilised.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990900","kind":"concept","label":"ciliary pocket collar","sources":[{"id":"quickgo.go_1990900","title":"Gene Ontology term GO:1990900 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990900/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines ciliary pocket collar as: A constriction site at the junction of the plasma, flagellar and flagellar pocket membranes where the flagellum emerges from the cell body. Observed in some unicellular eukaryotic species such as Chlamydomonas, Giardia and Trypanosoma.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go1990717","kind":"concept","label":"axonemal central bridge","sources":[{"id":"quickgo.go_1990717","title":"Gene Ontology term GO:1990717 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:1990717/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines axonemal central bridge as: Part of the 9+2 axoneme, that occurs in most motile cilia, consisting of the two bridges which connect the central pair of single microtubules.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0060108","kind":"concept","label":"annular furrow extracellular matrix","sources":[{"id":"quickgo.go_0060108","title":"Gene Ontology term GO:0060108 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0060108/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines annular furrow extracellular matrix as: The extracellular matrix part that is a regularly spaced indentation in the outer cortical layer of the cuticle. The pattern of annular furrows corresponds to sites of invaginations in hypodermal cell membranes that, in turn, correspond to submembranous regions where actin microfilament bundles assemble early in lethargus, the first phase of the molting cycle in which activity and feeding decline.","tags":[]},{"aliases":[],"domain":"life","era":"undated","frontier":false,"id":"concept.go.go0005825","kind":"concept","label":"half bridge of spindle pole body","sources":[{"id":"quickgo.go_0005825","title":"Gene Ontology term GO:0005825 (EMBL-EBI QuickGO)","url":"https://www.ebi.ac.uk/QuickGO/services/ontology/go/terms/GO:0005825/complete"}],"status":"reported","summary":"The Gene Ontology (via EMBL-EBI QuickGO) defines half bridge of spindle pole body as: Structure adjacent to the plaques of the spindle pole body.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300145966","kind":"concept","label":"religious concepts","sources":[{"id":"getty-aat.300145966","title":"Getty Art & Architecture Thesaurus record 300145966","url":"http://vocab.getty.edu/page/aat/300145966"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious concepts as: Ideas and notions that are fundamentally religious.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055938","kind":"concept","label":"philosophical concepts","sources":[{"id":"getty-aat.300055938","title":"Getty Art & Architecture Thesaurus record 300055938","url":"http://vocab.getty.edu/page/aat/300055938"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophical concepts as: Concepts related to knowledge, learning, and scholarship.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264088","kind":"concept","label":"Styles and Periods Facet","sources":[{"id":"getty-aat.300264088","title":"Getty Art & Architecture Thesaurus record 300264088","url":"http://vocab.getty.edu/page/aat/300264088"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Styles and Periods Facet as: Includes the names of art and architecture styles, historical periods, art movements, cultures, and ethnicities. Names of people and sites are included if they designate distinct styles or periods. Examples: Yoruba, Louis XIV, Aztec, German, Neolithic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300412155","kind":"field","label":"book history","sources":[{"id":"getty-aat.300412155","title":"Getty Art & Architecture Thesaurus record 300412155","url":"http://vocab.getty.edu/page/aat/300412155"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines book history as: Research into the evolution of the book and its variants (pamphlets, newspapers, broadsheets) in all aspects of its production, dissemination and consumption in relation to literary, political, economical, social and religious history. The history of the book includes subjects such as the production of manuscripts in medieval scriptoria, authorship, printing techniques, economic aspects of printing and publishing, design, printshops and publishing houses, trade, ownership and reading culture, typography, typesetting and printing techniques, and book collecting and connoisseurship. Use \" literary history\" Use “literary history” for the study of literary trends and movements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054273","kind":"field","label":"literary studies","sources":[{"id":"getty-aat.300054273","title":"Getty Art & Architecture Thesaurus record 300054273","url":"http://vocab.getty.edu/page/aat/300054273"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary studies as: Discipline dealing with the written and oral verbal works of a nation, region, period, or language, of a particular group or individual, of a particular form or genre, on a particular subject, or for a particular audience. For written works on a particular subject, use \"literature (documents).\" For the written works of a particular individual or group of individuals, use \"writings (documents).\" For the genre of liturature rather than the discipline that studies it, use \"literature (genre).\" Use \"book history\" for the study of the trade, production, and consumption of books as physical objects.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054275","kind":"field","label":"museology","sources":[{"id":"getty-aat.300054275","title":"Getty Art & Architecture Thesaurus record 300054275","url":"http://vocab.getty.edu/page/aat/300054275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museology as: The theory and practice of the organization, administration, functions, and technical processes of museums, including documentation and collections management, as well as their history, philosophy, and purposes.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300444364","kind":"field","label":"paper history","sources":[{"id":"getty-aat.300444364","title":"Getty Art & Architecture Thesaurus record 300444364","url":"http://vocab.getty.edu/page/aat/300444364"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paper history as: Study of the origin and evolution of paper as a product and material: paper production, paper trade, the management of papermills and paper factories, raw materials, and the cultural importance of paper as an information carrier.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264335","kind":"concept","label":"auspicia","sources":[{"id":"getty-aat.300264335","title":"Getty Art & Architecture Thesaurus record 300264335","url":"http://vocab.getty.edu/page/aat/300264335"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines auspicia as: In ancient Roman religion, the signs of the gods that were inscribed in nature and meant to be deciphered. Auspicia were seen as affirmative or negative answers to proposed courses of action. Auspicia often came from the sky as thunder, lightning, and different kinds of birds although there were other kinds as well. Public auspicia were taken by magistrates or augurs in the sacred space of the templum.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263186","kind":"concept","label":"biblical","sources":[{"id":"getty-aat.300263186","title":"Getty Art & Architecture Thesaurus record 300263186","url":"http://vocab.getty.edu/page/aat/300263186"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines biblical as: Of, relating to, or contained in the Bible, which contains the sacred scriptures of Judaism or Christianity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264359","kind":"concept","label":"blasphemy","sources":[{"id":"getty-aat.300264359","title":"Getty Art & Architecture Thesaurus record 300264359","url":"http://vocab.getty.edu/page/aat/300264359"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines blasphemy as: An irreverent or impious act, attitude, or utterance regarding something considered inviolable or sacrosanct, particularly something concerning God.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300380145","kind":"concept","label":"cultism","sources":[{"id":"getty-aat.300380145","title":"Getty Art & Architecture Thesaurus record 300380145","url":"http://vocab.getty.edu/page/aat/300380145"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cultism as: Having to do with the formation or following of a cult, which is a religious group having beliefs that differ significantly from dominant or orthodox religions or society.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417271","kind":"concept","label":"divine judgment","sources":[{"id":"getty-aat.300417271","title":"Getty Art & Architecture Thesaurus record 300417271","url":"http://vocab.getty.edu/page/aat/300417271"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines divine judgment as: Actions and status of a dvinity's retributive justice by which the destiny of people or other creatures is decided, typically according to their merits and demerits.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300145975","kind":"concept","label":"doctrinal concepts","sources":[{"id":"getty-aat.300145975","title":"Getty Art & Architecture Thesaurus record 300145975","url":"http://vocab.getty.edu/page/aat/300145975"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines doctrinal concepts as: Religious concepts related to doctrine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264310","kind":"concept","label":"Dreaming, the","sources":[{"id":"getty-aat.300264310","title":"Getty Art & Architecture Thesaurus record 300264310","url":"http://vocab.getty.edu/page/aat/300264310"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dreaming, the as: A fundamental concept of Australian aboriginal religion that refers to a mythological period of time before living memory when the world was shaped and humanized by the actions of mythic ancestral beings. Some of these beings were in human or animal (totemic) form while others changed their form. They were responsible for creating the different types of plants and animals, including humans, as well as for establishing local social order and laws to live by. In aboriginal belief, these ancestors are spiritually as much alive today as they ever were. As a belief system, the Dreaming includes totemism: man is regarded as part of nature, not fundamentally different from his mythic ancestors or from animals, all of which share a common life force. This connection is often made visible through the use of totem figures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379137","kind":"concept","label":"heresy","sources":[{"id":"getty-aat.300379137","title":"Getty Art & Architecture Thesaurus record 300379137","url":"http://vocab.getty.edu/page/aat/300379137"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines heresy as: Theological or religious opinion or doctrine maintained in opposition to the official or orthodox doctrine of a given church, creed, or religious system.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055991","kind":"concept","label":"monasticism","sources":[{"id":"getty-aat.300055991","title":"Getty Art & Architecture Thesaurus record 300055991","url":"http://vocab.getty.edu/page/aat/300055991"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monasticism as: A form of religious life that emphasizes the perfection of the individual through immersion in a consecrated community or, more rarely, through a solitary and ascetic existence. Monasticism is found in both Buddhism and Christianity, particularly in the Roman Catholic and Orthodox churches. Although it began as a lay movement in Christianity, clergy soon came to dominate and it began to involve voluntary poverty and a life devoted to worship. The rule of Benedict was the most important early monastic legislation and it became the standard of Western Christian monasticism. The mendicant orders, which combined monastic life with missionary work and preaching, were created in the 13th century. Scholarship was emphasized in some medieval monastic systems, which led to important religious research and manuscripts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451043","kind":"concept","label":"private devotion","sources":[{"id":"getty-aat.300451043","title":"Getty Art & Architecture Thesaurus record 300451043","url":"http://vocab.getty.edu/page/aat/300451043"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines private devotion as: The psychological process of experiencing devotional feelings in a private sphere, whether or not encouraged by the church authorities, often with the aid of texts, figurines or images.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412108","kind":"concept","label":"rabbinical","sources":[{"id":"getty-aat.300412108","title":"Getty Art & Architecture Thesaurus record 300412108","url":"http://vocab.getty.edu/page/aat/300412108"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rabbinical as: Of, relating to, or characteristic of the teachings of rabbis that constitute the Talmud.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300055987","kind":"field","label":"religious ideologies","sources":[{"id":"getty-aat.300055987","title":"Getty Art & Architecture Thesaurus record 300055987","url":"http://vocab.getty.edu/page/aat/300055987"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious ideologies as: Organized bodies of ideas and attitudes having to do with religion, which is broadly defined as belief systems that encompass various personal and institutional relationships between human beings and what they regard as holy, sacred, or divine, usually but not always a deity, or a spiritual or occult force.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056005","kind":"concept","label":"worship","sources":[{"id":"getty-aat.300056005","title":"Getty Art & Architecture Thesaurus record 300056005","url":"http://vocab.getty.edu/page/aat/300056005"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines worship as: The reverent love and allegiance accorded a deity, idol, or sacred object, often expressed through ceremonies, prayers, or other religious rituals.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300124083","kind":"concept","label":"aesthetic concepts","sources":[{"id":"getty-aat.300124083","title":"Getty Art & Architecture Thesaurus record 300124083","url":"http://vocab.getty.edu/page/aat/300124083"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines aesthetic concepts as: Concepts related to perception of what is ideal or beautiful.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379123","kind":"concept","label":"betrayal","sources":[{"id":"getty-aat.300379123","title":"Getty Art & Architecture Thesaurus record 300379123","url":"http://vocab.getty.edu/page/aat/300379123"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines betrayal as: Violation of trust or confidence or an abandonment of something committed to one's charge, such as a revelation or divulging of something which it is desirable to keep secret or a treacherous giving up to an enemy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412040","kind":"concept","label":"cosmos","sources":[{"id":"getty-aat.300412040","title":"Getty Art & Architecture Thesaurus record 300412040","url":"http://vocab.getty.edu/page/aat/300412040"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cosmos as: An ordered and harmonious system that comprises the world or universe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410285","kind":"concept","label":"evil","sources":[{"id":"getty-aat.300410285","title":"Getty Art & Architecture Thesaurus record 300410285","url":"http://vocab.getty.edu/page/aat/300410285"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines evil as: The state of a person or situation of being morally depraved, bad, wicked, or vicious. The antithesis of \"good.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435308","kind":"concept","label":"fate","sources":[{"id":"getty-aat.300435308","title":"Getty Art & Architecture Thesaurus record 300435308","url":"http://vocab.getty.edu/page/aat/300435308"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fate as: The principle, power, or agency by which, according to certain philosophical and popular systems of belief, all events, or some events in particular, are unalterably predetermined from eternity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410287","kind":"concept","label":"fortitude","sources":[{"id":"getty-aat.300410287","title":"Getty Art & Architecture Thesaurus record 300410287","url":"http://vocab.getty.edu/page/aat/300410287"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fortitude as: Moral strength or courage, unyielding courage, endurance of pain or adversity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410316","kind":"concept","label":"fortune","sources":[{"id":"getty-aat.300410316","title":"Getty Art & Architecture Thesaurus record 300410316","url":"http://vocab.getty.edu/page/aat/300410316"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fortune as: Chance or luck, when regarded as a cause of events and changes in human affairs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379723","kind":"concept","label":"hope","sources":[{"id":"getty-aat.300379723","title":"Getty Art & Architecture Thesaurus record 300379723","url":"http://vocab.getty.edu/page/aat/300379723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hope as: The expectation of something desired.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438472","kind":"concept","label":"hózhó","sources":[{"id":"getty-aat.300438472","title":"Getty Art & Architecture Thesaurus record 300438472","url":"http://vocab.getty.edu/page/aat/300438472"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hózhó as: Philosophical concept central to Navajo aesthetics and culture. Advocates for individuals to be balanced and in harmony with other spiritual and material aspects of Navajo life (landscape, community, etc.) In Navajo material culture and art, beauty is achieved through this balance. This concept can be seen expressed in textiles and pottery through their balanced compositions and in sandpainting in its illustrations of interconnected, harmonious relationships between people, animals, spirits, and the land. Also is applied to contemporary art made by Navajo artists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300258340","kind":"field","label":"ideology","sources":[{"id":"getty-aat.300258340","title":"Getty Art & Architecture Thesaurus record 300258340","url":"http://vocab.getty.edu/page/aat/300258340"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ideology as: Any organized body of ideas and attitudes, especially about the structure and working of human society, that comprehends a program of practical political and social action and is more or less institutionalized or shared with others. Originally used for a branch of knowledge dealing with the history and nature of ideas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300449137","kind":"concept","label":"ignorance","sources":[{"id":"getty-aat.300449137","title":"Getty Art & Architecture Thesaurus record 300449137","url":"http://vocab.getty.edu/page/aat/300449137"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ignorance as: The fact or condition of lacking knowledge or awareness, either generally or about a particular thing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451359","kind":"concept","label":"immortality","sources":[{"id":"getty-aat.300451359","title":"Getty Art & Architecture Thesaurus record 300451359","url":"http://vocab.getty.edu/page/aat/300451359"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines immortality as: In philosophical and religious traditions, the concept of or belief in the continued existence of a material thing into infinity, or of the existance of an immaterial soul or mind beyond the physical death of the body.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412128","kind":"concept","label":"inventiveness","sources":[{"id":"getty-aat.300412128","title":"Getty Art & Architecture Thesaurus record 300412128","url":"http://vocab.getty.edu/page/aat/300412128"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines inventiveness as: The quality, faculty, or aptitude for creating unique solutions to problems, or of inventng new things, language, art, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055945","kind":"concept","label":"metaphysical concepts","sources":[{"id":"getty-aat.300055945","title":"Getty Art & Architecture Thesaurus record 300055945","url":"http://vocab.getty.edu/page/aat/300055945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines metaphysical concepts as: Philosophical concepts that deal with the nature of reality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417426","kind":"concept","label":"morality","sources":[{"id":"getty-aat.300417426","title":"Getty Art & Architecture Thesaurus record 300417426","url":"http://vocab.getty.edu/page/aat/300417426"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines morality as: Ethical wisdom, knowledge, or qualities, as evidenced in behavior conforming to moral law or accepted moral standards, particularly in relation to sexual matters or personal qualities judged to be good.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412116","kind":"concept","label":"prudence","sources":[{"id":"getty-aat.300412116","title":"Getty Art & Architecture Thesaurus record 300412116","url":"http://vocab.getty.edu/page/aat/300412116"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prudence as: Concept concerning the ability to recognize and follow the most suitable or sensible course of action, utilizing good sense, discretion, circumspection, caution.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417325","kind":"concept","label":"survival","sources":[{"id":"getty-aat.300417325","title":"Getty Art & Architecture Thesaurus record 300417325","url":"http://vocab.getty.edu/page/aat/300417325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines survival as: The state or fact of the continuance of anything after the end of other like things within the same context, as after some event. The persistence of a living thing, custom, or observance, after the circumstances or conditions in which it originated or which gave significance to it have ceased.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300068765","kind":"concept","label":"truth","sources":[{"id":"getty-aat.300068765","title":"Getty Art & Architecture Thesaurus record 300068765","url":"http://vocab.getty.edu/page/aat/300068765"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines truth as: A property of beliefs, propositions, and linguistic statements, being that they conform with fact or agree with reality.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379068","kind":"concept","label":"vengeance","sources":[{"id":"getty-aat.300379068","title":"Getty Art & Architecture Thesaurus record 300379068","url":"http://vocab.getty.edu/page/aat/300379068"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vengeance as: The act or condition of inflicting retributive injury or punishment in retaliation for an injury or offense.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300380150","kind":"concept","label":"wisdom","sources":[{"id":"getty-aat.300380150","title":"Getty Art & Architecture Thesaurus record 300380150","url":"http://vocab.getty.edu/page/aat/300380150"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines wisdom as: Accumulated learning and soundness of judgment in the choice of means and ends.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412041","kind":"concept","label":"world","sources":[{"id":"getty-aat.300412041","title":"Getty Art & Architecture Thesaurus record 300412041","url":"http://vocab.getty.edu/page/aat/300412041"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines world as: The state or realm of existence, particularly of the physical.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417578","kind":"concept","label":"theater arts","sources":[{"id":"getty-aat.300417578","title":"Getty Art & Architecture Thesaurus record 300417578","url":"http://vocab.getty.edu/page/aat/300417578"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theater arts as: Broad discipline concerning drama, dance, critical studies, and theater design/technology; a professionally-oriented study of theater, that involves training, practice, and study in the processes of doing theater.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266573","kind":"concept","label":"electronic music","sources":[{"id":"getty-aat.300266573","title":"Getty Art & Architecture Thesaurus record 300266573","url":"http://vocab.getty.edu/page/aat/300266573"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines electronic music as: Music in which sound is generated, transferred, triggered, or amplified by electronic devices. The creation of electronic music may involve the use of magnetic tape or digital technology and whose reproduction involves the use of loudspeakers. For works created with only natural sound sources recorded and manipulated via discs or magnetic tape use \"musique concrète.\" For music created entirely through the use of a computer, in which the sound is initiated purely through digital means, use \"computer music.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266367","kind":"concept","label":"jazz","sources":[{"id":"getty-aat.300266367","title":"Getty Art & Architecture Thesaurus record 300266367","url":"http://vocab.getty.edu/page/aat/300266367"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines jazz as: Music, often improvisational, originally developed around the turn of the 20th century by African Americans from elements of blues and ragtime, with syncopated rhythms and a European harmonic structure. Jazz consistently evolved throughout the 20th century with numerous phases, from a New Orleans style or swing, to \"free jazz,\" for example, which emerged in the late 1950s. Therefore, jazz itself has no precise definition, however it has rarely been a completely composed music.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417616","kind":"concept","label":"musical theater","sources":[{"id":"getty-aat.300417616","title":"Getty Art & Architecture Thesaurus record 300417616","url":"http://vocab.getty.edu/page/aat/300417616"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musical theater as: Genre of theatrical performance that combines songs, spoken dialogue, acting, and dance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417961","kind":"concept","label":"rhythm and blues","sources":[{"id":"getty-aat.300417961","title":"Getty Art & Architecture Thesaurus record 300417961","url":"http://vocab.getty.edu/page/aat/300417961"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rhythm and blues as: Any of various kinds of popular music typically having a strong rhythm and featuring a horn section. Originally and principally associated with African-American performers, particularly a style prominent during the late 1940s and 1950s derived from or influenced by the blues and jazz.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266054","kind":"concept","label":"serial music","sources":[{"id":"getty-aat.300266054","title":"Getty Art & Architecture Thesaurus record 300266054","url":"http://vocab.getty.edu/page/aat/300266054"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines serial music as: A structural principle for musical composition used since the early 20th century in which a series or set of elements are used repeatedly.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300201023","kind":"concept","label":"myths","sources":[{"id":"getty-aat.300201023","title":"Getty Art & Architecture Thesaurus record 300201023","url":"http://vocab.getty.edu/page/aat/300201023"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines myths as: Individual stories derived from a mythology; distinguished from historical accounts in that they are considered by current scholars to lack a determinable basis of fact or natural explanation; typically concerning a being, hero, deity, or event and explains some practice, rite, or phenomenon of nature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054232","kind":"concept","label":"arts-related disciplines","sources":[{"id":"getty-aat.300054232","title":"Getty Art & Architecture Thesaurus record 300054232","url":"http://vocab.getty.edu/page/aat/300054232"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arts-related disciplines as: Branches of learning devoted to the arts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054245","kind":"field","label":"linguistics","sources":[{"id":"getty-aat.300054245","title":"Getty Art & Architecture Thesaurus record 300054245","url":"http://vocab.getty.edu/page/aat/300054245"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300137410","kind":"concept","label":"linguistics-related disciplines","sources":[{"id":"getty-aat.300137410","title":"Getty Art & Architecture Thesaurus record 300137410","url":"http://vocab.getty.edu/page/aat/300137410"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines linguistics-related disciplines as: Branches of learning and professions related to linguistics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054274","kind":"concept","label":"comparative literature","sources":[{"id":"getty-aat.300054274","title":"Getty Art & Architecture Thesaurus record 300054274","url":"http://vocab.getty.edu/page/aat/300054274"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines comparative literature as: The study of similar literary works from two or more nations, periods, or languages in relation to each other, or the study of any literary phenomenon from the perspective of at least two literatures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300174160","kind":"field","label":"literary criticism","sources":[{"id":"getty-aat.300174160","title":"Getty Art & Architecture Thesaurus record 300174160","url":"http://vocab.getty.edu/page/aat/300174160"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary criticism as: The discipline of describing, interpreting, and evaluating literary works, including the exposition of principles, methods, and theories for the analysis of such works.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300174173","kind":"field","label":"literary history","sources":[{"id":"getty-aat.300174173","title":"Getty Art & Architecture Thesaurus record 300174173","url":"http://vocab.getty.edu/page/aat/300174173"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines literary history as: Study of literary trends and movements over time, as well as the development of various branches or genres of literature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300069325","kind":"field","label":"poetics","sources":[{"id":"getty-aat.300069325","title":"Getty Art & Architecture Thesaurus record 300069325","url":"http://vocab.getty.edu/page/aat/300069325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines poetics as: The theory, art, or study of the nature and function of poetry and with identifying and describing its types, forms, and techniques.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300387576","kind":"field","label":"museography","sources":[{"id":"getty-aat.300387576","title":"Getty Art & Architecture Thesaurus record 300387576","url":"http://vocab.getty.edu/page/aat/300387576"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museography as: Refers to museum methods of classification, description and display of objects; the practical application of the body of theory known as museology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054672","kind":"concept","label":"museum administration","sources":[{"id":"getty-aat.300054672","title":"Getty Art & Architecture Thesaurus record 300054672","url":"http://vocab.getty.edu/page/aat/300054672"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines museum administration as: The study and practice of the administration of museums.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054280","kind":"field","label":"aesthetics","sources":[{"id":"getty-aat.300054280","title":"Getty Art & Architecture Thesaurus record 300054280","url":"http://vocab.getty.edu/page/aat/300054280"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054283","kind":"field","label":"axiology","sources":[{"id":"getty-aat.300054283","title":"Getty Art & Architecture Thesaurus record 300054283","url":"http://vocab.getty.edu/page/aat/300054283"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines axiology as: Study of values, primarily of intrinsic values (as those in ethics, aesthetics, and religion), but also of instrumental values (as those in economics), particularly with reference to the manner in which they can be known or experienced, their nature and kinds, and their ontological status.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054288","kind":"field","label":"epistemology","sources":[{"id":"getty-aat.300054288","title":"Getty Art & Architecture Thesaurus record 300054288","url":"http://vocab.getty.edu/page/aat/300054288"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054297","kind":"field","label":"phenomenology","sources":[{"id":"getty-aat.300054297","title":"Getty Art & Architecture Thesaurus record 300054297","url":"http://vocab.getty.edu/page/aat/300054297"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312347","kind":"concept","label":"philosophy of art","sources":[{"id":"getty-aat.300312347","title":"Getty Art & Architecture Thesaurus record 300312347","url":"http://vocab.getty.edu/page/aat/300312347"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophy of art as: The study of the nature of art, including interpretation, representation, expression, and form. It is closely related to \"aesthetics,\" which is the philosophical study of beauty.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300265767","kind":"field","label":"teleology","sources":[{"id":"getty-aat.300265767","title":"Getty Art & Architecture Thesaurus record 300265767","url":"http://vocab.getty.edu/page/aat/300265767"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines teleology as: Philosophical study of finality, especially as it pertains to design or purposes in the processes of nature.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054306","kind":"concept","label":"religion-related disciplines","sources":[{"id":"getty-aat.300054306","title":"Getty Art & Architecture Thesaurus record 300054306","url":"http://vocab.getty.edu/page/aat/300054306"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religion-related disciplines as: Branches of learning devoted to religion.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264303","kind":"concept","label":"absolution","sources":[{"id":"getty-aat.300264303","title":"Getty Art & Architecture Thesaurus record 300264303","url":"http://vocab.getty.edu/page/aat/300264303"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines absolution as: A declaration of forgiveness of sins. In Christianity it refers specifically to the formal remission of sin imparted by a priest or minister either in private after confession or as part of the liturgy in public worship. In Catholicism it is part of the sacrament of penance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264304","kind":"concept","label":"afterlife","sources":[{"id":"getty-aat.300264304","title":"Getty Art & Architecture Thesaurus record 300264304","url":"http://vocab.getty.edu/page/aat/300264304"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines afterlife as: The idea of survival of a person in some form after physical death. This notion is present in a wide variety of forms in different religions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435319","kind":"concept","label":"apotheosis","sources":[{"id":"getty-aat.300435319","title":"Getty Art & Architecture Thesaurus record 300435319","url":"http://vocab.getty.edu/page/aat/300435319"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines apotheosis as: Doctrinal concept concerning the spiritual departure from earthly life or the deification of a person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264321","kind":"concept","label":"ascension","sources":[{"id":"getty-aat.300264321","title":"Getty Art & Architecture Thesaurus record 300264321","url":"http://vocab.getty.edu/page/aat/300264321"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ascension as: The act or process of rising from the earthly to the heavenly sphere. One example is Christ's ascension witnessed by the apostles forty days after his resurrection. Another prime example is the ascent of the Prophet Muhammad to heaven.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264529","kind":"concept","label":"Buddhist doctrinal concepts","sources":[{"id":"getty-aat.300264529","title":"Getty Art & Architecture Thesaurus record 300264529","url":"http://vocab.getty.edu/page/aat/300264529"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Buddhist doctrinal concepts as: Concepts related to the doctrine of Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264528","kind":"concept","label":"Christian doctrinal concepts","sources":[{"id":"getty-aat.300264528","title":"Getty Art & Architecture Thesaurus record 300264528","url":"http://vocab.getty.edu/page/aat/300264528"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Christian doctrinal concepts as: Concepts related to the doctrine of Christianity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458718","kind":"concept","label":"Cihuatlampan","sources":[{"id":"getty-aat.300458718","title":"Getty Art & Architecture Thesaurus record 300458718","url":"http://vocab.getty.edu/page/aat/300458718"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cihuatlampan as: Place of women, referring to the western horizon where the Cihuateteoh carry the sun as it sets into Mictlan (the land of the dead).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265797","kind":"concept","label":"divine light","sources":[{"id":"getty-aat.300265797","title":"Getty Art & Architecture Thesaurus record 300265797","url":"http://vocab.getty.edu/page/aat/300265797"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines divine light as: Light emanating from a holy personage or visions of supernatural light in general. Usually associated with Christ or the Virgin, and specifically the Transfiguration and the Ascension. For motifs based on the concept of divine light, use \"glories.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412084","kind":"concept","label":"eternity","sources":[{"id":"getty-aat.300412084","title":"Getty Art & Architecture Thesaurus record 300412084","url":"http://vocab.getty.edu/page/aat/300412084"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines eternity as: Infinite time, which has neither beginning nor end.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055982","kind":"concept","label":"faith","sources":[{"id":"getty-aat.300055982","title":"Getty Art & Architecture Thesaurus record 300055982","url":"http://vocab.getty.edu/page/aat/300055982"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines faith as: Act or state of wholeheartedly and steadfastly believing in the existence, power and benevolence of a supreme being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404756","kind":"concept","label":"gates of hell","sources":[{"id":"getty-aat.300404756","title":"Getty Art & Architecture Thesaurus record 300404756","url":"http://vocab.getty.edu/page/aat/300404756"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines gates of hell as: Entrances to the underworld as known in any of various religions and belief systems. The gates of hell may be either apprehended in a material sense to correspond to caves or other places on earth, or conceived of in only an abstract or spiritual sense.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300185658","kind":"concept","label":"heaven","sources":[{"id":"getty-aat.300185658","title":"Getty Art & Architecture Thesaurus record 300185658","url":"http://vocab.getty.edu/page/aat/300185658"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines heaven as: Place or state of eternal bliss and ideal relationship with God or the gods, usually accorded as the reward for virtue and true religious faith.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264527","kind":"concept","label":"Hindu doctrinal concepts","sources":[{"id":"getty-aat.300264527","title":"Getty Art & Architecture Thesaurus record 300264527","url":"http://vocab.getty.edu/page/aat/300264527"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hindu doctrinal concepts as: Concepts related to the doctrine of Hinduism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264530","kind":"concept","label":"Jain doctrinal concepts","sources":[{"id":"getty-aat.300264530","title":"Getty Art & Architecture Thesaurus record 300264530","url":"http://vocab.getty.edu/page/aat/300264530"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Jain doctrinal concepts as: Concepts related to the doctrine of Jainism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458684","kind":"concept","label":"Mazahuahcan","sources":[{"id":"getty-aat.300458684","title":"Getty Art & Architecture Thesaurus record 300458684","url":"http://vocab.getty.edu/page/aat/300458684"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mazahuahcan as: Refers to the conception of the west.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458696","kind":"concept","label":"Mictlampan","sources":[{"id":"getty-aat.300458696","title":"Getty Art & Architecture Thesaurus record 300458696","url":"http://vocab.getty.edu/page/aat/300458696"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mictlampan as: Reference to the North. In the context of Aztec mythology, Mictlampan is associated with Mictlantecuhtli, the god of the dead.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379822","kind":"concept","label":"purgatory","sources":[{"id":"getty-aat.300379822","title":"Getty Art & Architecture Thesaurus record 300379822","url":"http://vocab.getty.edu/page/aat/300379822"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines purgatory as: State or place of spiritual cleansing and purification, allowing a purging of sins. A notable example is in the doctrine of the Roman Catholic Church, where it is defined as a state where the souls of those who die in grace undergo such punishment as necessary to expiate their unforgiven venial sins before entering heaven.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379085","kind":"concept","label":"redemption","sources":[{"id":"getty-aat.300379085","title":"Getty Art & Architecture Thesaurus record 300379085","url":"http://vocab.getty.edu/page/aat/300379085"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines redemption as: Expiation or atonement for a crime, sin, or offence, including a release from punishment. In theology, deliverance from sin and damnation by atonement or, in Christianity, by the salvation of Christ.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300073437","kind":"concept","label":"reincarnation","sources":[{"id":"getty-aat.300073437","title":"Getty Art & Architecture Thesaurus record 300073437","url":"http://vocab.getty.edu/page/aat/300073437"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines reincarnation as: The doctrinal concept that some aspect of the self or soul can be reborn any number of times in a new body (animal or human) after death. Fundamental to a number of Eastern religions such as Hinduism and Buddhism, this belief is also found in some modern Western belief systems such as theosophy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056003","kind":"concept","label":"salvation","sources":[{"id":"getty-aat.300056003","title":"Getty Art & Architecture Thesaurus record 300056003","url":"http://vocab.getty.edu/page/aat/300056003"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines salvation as: The doctrinal concept of the deliverance of man or his soul from evil or sin by religious means, the restoration of people to their true state, and the attainment of eternal and blessed life. God's intervention is responsible for salvation in theistic religions while in Buddhism salvation comes from escaping the cycle of birth and rebirth, thereby reaching nirvana.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056004","kind":"concept","label":"theophany","sources":[{"id":"getty-aat.300056004","title":"Getty Art & Architecture Thesaurus record 300056004","url":"http://vocab.getty.edu/page/aat/300056004"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theophany as: The doctrinal concept of divine manifestation, especially the appearance of a god to a human.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458697","kind":"concept","label":"Tlalocan","sources":[{"id":"getty-aat.300458697","title":"Getty Art & Architecture Thesaurus record 300458697","url":"http://vocab.getty.edu/page/aat/300458697"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tlalocan as: In Nahuatl, Tlalocan used as a reference to the East, refers mainly to a place of Tlalocs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055988","kind":"concept","label":"Adoptionism","sources":[{"id":"getty-aat.300055988","title":"Getty Art & Architecture Thesaurus record 300055988","url":"http://vocab.getty.edu/page/aat/300055988"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Adoptionism as: Christian doctrine that Jesus of Nazareth became the son of God by exaltation that was not his at birth.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055989","kind":"concept","label":"agnosticism","sources":[{"id":"getty-aat.300055989","title":"Getty Art & Architecture Thesaurus record 300055989","url":"http://vocab.getty.edu/page/aat/300055989"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines agnosticism as: Doctrine affirming that the existence of God is possible, but denying that there are any sufficient reasons for holding either that God does or does not exist.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300072604","kind":"concept","label":"animism","sources":[{"id":"getty-aat.300072604","title":"Getty Art & Architecture Thesaurus record 300072604","url":"http://vocab.getty.edu/page/aat/300072604"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines animism as: Refers to the belief in spiritual beings capable of influencing human events, based on the idea that animals, plants and even inanimate objects have souls like humans. The 19th-century anthropologist Edward Tylor thought it to be the earliest form of religion, a view not accepted by modern anthropologists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264322","kind":"concept","label":"asceticism","sources":[{"id":"getty-aat.300264322","title":"Getty Art & Architecture Thesaurus record 300264322","url":"http://vocab.getty.edu/page/aat/300264322"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines asceticism as: Refers to the practice of self-control and self-denial as an act of religious devotion and a means of achieving greater spiritual awareness; it is found in different forms and to different extents in all religions. Ascetic practices include fasting, a solitary life, meditation, celibacy, the renunciation of possessions, and the mortification of flesh.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055990","kind":"concept","label":"atheism","sources":[{"id":"getty-aat.300055990","title":"Getty Art & Architecture Thesaurus record 300055990","url":"http://vocab.getty.edu/page/aat/300055990"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines atheism as: Doctrine that there is neither God nor any other deity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264504","kind":"concept","label":"Deism","sources":[{"id":"getty-aat.300264504","title":"Getty Art & Architecture Thesaurus record 300264504","url":"http://vocab.getty.edu/page/aat/300264504"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Deism as: Refers most often to the ideas of a heterogeneous religious movement of the late 17th and 18th centuries that flourished mainly in Britain. Deism also became very popular in 18th-century Germany. The movement was concerned with defending the rationality of religion and belief in God in the face of rising skepticism, especially as a consequence of Newton's laws. According to Deist writers, there exists a supreme being who initiated creation and is thus the basis of reality, but who does not intervene in the world and its natural laws (i.e. does not answer prayers or perform miracles). Nevertheless, Deism holds that religion is natural to humanity, and emphasizes natural religion as opposed to revealed religion or the teachings of churches. Natural religion comes from a certain body of religious knowledge that is inborn in everyone or that can be acquired through reason. Important Deist writings include Matthew Tindal's 'Christianity as Old as the Creation' (1730), the so-called 'Deist Bible.' Other important English Deists were Lord Herbert of Cherbury and Anthony Ashley Cooper.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055963","kind":"concept","label":"Gnosticism","sources":[{"id":"getty-aat.300055963","title":"Getty Art & Architecture Thesaurus record 300055963","url":"http://vocab.getty.edu/page/aat/300055963"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gnosticism as: Refers to a religious ideology popular in the 4th-century Christian world although it may have had earlier, non-Christian roots stemming from a break from Judaism. The believers in Gnosticism felt that they alone would attain full salvation because they possessed the teachings of Christ regarding the cosmic origins and spiritual destiny of people. It was considered heretic because of its low view of God as Creator, its secret traditions, and its belief that Christ was not really human and that his crucifixion was simply an attempt to fool evil forces.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300143325","kind":"concept","label":"Hasidism","sources":[{"id":"getty-aat.300143325","title":"Getty Art & Architecture Thesaurus record 300143325","url":"http://vocab.getty.edu/page/aat/300143325"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hasidism as: Refers to a type of Jewish mysticism characterized by an ascetic lifestyle, strict observance of the commandments, and ecstatic forms of worship and prayer. Its origins are usually traced back to Poland in the late 18th century and it was developed in opposition to rabbinic authority and certain Jewish traditions. Hasidism emphasizes prayer as a means of communicating with God as opposed to study of the Torah. As Hasidism spread throughout the world, it was eventually accepted as part of Orthodox Judaism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300067974","kind":"concept","label":"millenarianism","sources":[{"id":"getty-aat.300067974","title":"Getty Art & Architecture Thesaurus record 300067974","url":"http://vocab.getty.edu/page/aat/300067974"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines millenarianism as: Refers to a Christian religious ideology usually based on an interpretation of Revelation 20. 1-7 which holds that there will be a thousand-year reign of the saints, either right before or after Christ's return. Millenarianism has had its followers since the early days of Christianity, but it became particularly popular in the 19th century, when groups such as the Plymouth Brethren and the Adventists embraced apocalyptic and millennial ideas. Recently the term has also been applied by social scientists to any religious group waiting for a sudden transformation of the world; such groups tend to become popular during times of social change or crisis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310748","kind":"concept","label":"monolatry","sources":[{"id":"getty-aat.300310748","title":"Getty Art & Architecture Thesaurus record 300310748","url":"http://vocab.getty.edu/page/aat/300310748"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monolatry as: The worship of one god, particularly when it is recognized that other deities exist. In such a system, one god has a central and dominating position, although the principle of polytheism is not abandoned.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055992","kind":"concept","label":"monotheism","sources":[{"id":"getty-aat.300055992","title":"Getty Art & Architecture Thesaurus record 300055992","url":"http://vocab.getty.edu/page/aat/300055992"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines monotheism as: The religious ideology that there is only one god, as opposed to polytheism and pantheism. Whereas facets of earlier cultures, such as the Egyptians, worshipped one god, a full long-term doctrine of monotheism developed first within Judaism and it remains a central part of Judaism, Christianity, and Islam. Muslims and Jews think that Christianity's belief in the three aspects of God, the Holy Trinity, denies monotheism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266058","kind":"concept","label":"Monothelitism","sources":[{"id":"getty-aat.300266058","title":"Getty Art & Architecture Thesaurus record 300266058","url":"http://vocab.getty.edu/page/aat/300266058"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Monothelitism as: Religious doctrine proposed in 622 and adopted by Byzantine Emperor Heraclius which declared that Jesus Christ had one will but two natures, the divine and the human. This ideology was developed under Patriarch Sergius I of Constantinople in attempt to bridge the gap between Monophysites and Chalcedonians, although neither group accepted it. In 680, the Third Council of Constantinople declared Monothelitism as heretical.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055993","kind":"concept","label":"paganism","sources":[{"id":"getty-aat.300055993","title":"Getty Art & Architecture Thesaurus record 300055993","url":"http://vocab.getty.edu/page/aat/300055993"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paganism as: Refers to the religious beliefs and practices of religions outside of the so-called 'major' religions. Pagans are sometimes defined as those who are not Christian, Jewish, or Muslim; occasionally the term is more narrowly used to described any non-Christian, sometimes even Jews.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055995","kind":"concept","label":"pantheism","sources":[{"id":"getty-aat.300055995","title":"Getty Art & Architecture Thesaurus record 300055995","url":"http://vocab.getty.edu/page/aat/300055995"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pantheism as: Religious ideology based on the belief that God and the universe are ultimately identical, and therefore only the divine is real and sense experience is not. Pantheism is an important element of Hinduism and some schools of Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055996","kind":"concept","label":"Pietism","sources":[{"id":"getty-aat.300055996","title":"Getty Art & Architecture Thesaurus record 300055996","url":"http://vocab.getty.edu/page/aat/300055996"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pietism as: A religious ideology originally developed within Lutheranism in the 17th and 18th centuries as a reform movement and reaction against rigid Protestant dogmatism. Pietism emphasizes good works, study of the Bible, and devotion. It came to influence other movements and ideologies such as evangelicalism, Methodism, and Moravian Brethren.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055997","kind":"concept","label":"polytheism","sources":[{"id":"getty-aat.300055997","title":"Getty Art & Architecture Thesaurus record 300055997","url":"http://vocab.getty.edu/page/aat/300055997"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines polytheism as: The religious ideology that there are many gods, as opposed to monotheism. Polytheism is characteristic of primitive religions as well as the religions of ancient Greece and Rome.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055998","kind":"concept","label":"quietism","sources":[{"id":"getty-aat.300055998","title":"Getty Art & Architecture Thesaurus record 300055998","url":"http://vocab.getty.edu/page/aat/300055998"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines quietism as: Refers generally to the belief that God only works in a person who is completely quiet and passive; religious followers should therefore withdraw from the everyday world and suppress their will. It also refers more specifically to forms of Christian mysticism, particularly to trends in the Middle Ages and 17th-century controversies in Spain and France.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055999","kind":"concept","label":"shamanism","sources":[{"id":"getty-aat.300055999","title":"Getty Art & Architecture Thesaurus record 300055999","url":"http://vocab.getty.edu/page/aat/300055999"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines shamanism as: Refers generally to the religious practices of some northern Asian peoples who believe that good and evil spirits inhabit the world and can be summoned or heard through inspired priests acting as mediums. Shamanism is also found amongst the pre-Chrisitian Lapps, the Inuit, the Plains Indians of North America, some Australian Aborigines, and some other peoples. The term was originally used by the Tungus people of Siberia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056000","kind":"concept","label":"theosophy","sources":[{"id":"getty-aat.300056000","title":"Getty Art & Architecture Thesaurus record 300056000","url":"http://vocab.getty.edu/page/aat/300056000"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theosophy as: Any religious or philosophic ideology based on mystical insight into the nature of God or divine truth. This insight is attained only through direct experience of the divine.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056002","kind":"concept","label":"totemism","sources":[{"id":"getty-aat.300056002","title":"Getty Art & Architecture Thesaurus record 300056002","url":"http://vocab.getty.edu/page/aat/300056002"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines totemism as: Complex of religious and social beliefs and practices whereby individuals or groups of people identify with or consider themselves to be in close kinship or spiritual affinity with a specific natural object or plant or animal species.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457805","kind":"concept","label":"hagiolatry","sources":[{"id":"getty-aat.300457805","title":"Getty Art & Architecture Thesaurus record 300457805","url":"http://vocab.getty.edu/page/aat/300457805"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hagiolatry as: The reverence, worship, or allegiance accorded individuals identified as saints, often expressed through ceremonies, prayers, or other religious rituals.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055983","kind":"concept","label":"liturgy","sources":[{"id":"getty-aat.300055983","title":"Getty Art & Architecture Thesaurus record 300055983","url":"http://vocab.getty.edu/page/aat/300055983"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines liturgy as: Refers generally to the prescribed rites of formal and public worship, typically including words, music, symbolic aids, and ritual actions. The diverse forms of liturgy reflect the needs and attitudes of different religious communities. The term can also refer more specifically to the Christian rite of the Eucharist.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391479","kind":"concept","label":"dian jing","sources":[{"id":"getty-aat.300391479","title":"Getty Art & Architecture Thesaurus record 300391479","url":"http://vocab.getty.edu/page/aat/300391479"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dian jing as: Used in a garden context, this term refers to accentuating scenic spots. At key scenic points, steps are taken to augment their remarkable appearance. The surrounding structures often are given names related to details of the natural environs, or inscribed with poetry describing the essence of the scenery, thereby contributing details that enhance the aesthetic appeal of the location.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055156","kind":"concept","label":"empathy","sources":[{"id":"getty-aat.300055156","title":"Getty Art & Architecture Thesaurus record 300055156","url":"http://vocab.getty.edu/page/aat/300055156"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines empathy as: The capacity for participating in, or a vicarious experiencing of, another's feelings, volitions, or ideas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056180","kind":"concept","label":"grandeur","sources":[{"id":"getty-aat.300056180","title":"Getty Art & Architecture Thesaurus record 300056180","url":"http://vocab.getty.edu/page/aat/300056180"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines grandeur as: The quality of being majestic, magnificent, splendid, stately, or imposing in an awe-inspiring way.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300069306","kind":"concept","label":"Ideal, the","sources":[{"id":"getty-aat.300069306","title":"Getty Art & Architecture Thesaurus record 300069306","url":"http://vocab.getty.edu/page/aat/300069306"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179281","kind":"concept","label":"imperfection","sources":[{"id":"getty-aat.300179281","title":"Getty Art & Architecture Thesaurus record 300179281","url":"http://vocab.getty.edu/page/aat/300179281"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines imperfection as: The state, quality, or condition of being inaccurate, incomplete, defective and/or displeasing in some way.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055826","kind":"concept","label":"mimesis","sources":[{"id":"getty-aat.300055826","title":"Getty Art & Architecture Thesaurus record 300055826","url":"http://vocab.getty.edu/page/aat/300055826"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines mimesis as: Aesthetic concept that takes imitation as the primary operative aspect in the creation of a work.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179426","kind":"concept","label":"perfection","sources":[{"id":"getty-aat.300179426","title":"Getty Art & Architecture Thesaurus record 300179426","url":"http://vocab.getty.edu/page/aat/300179426"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines perfection as: The state, quality, or condition of being accurate, complete, without defect and/or delightful.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055829","kind":"concept","label":"Picturesque, the","sources":[{"id":"getty-aat.300055829","title":"Getty Art & Architecture Thesaurus record 300055829","url":"http://vocab.getty.edu/page/aat/300055829"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Picturesque, the as: Aesthetic concept or expression, arising in Europe first in painting of the 18th century and later in architecture of the 19th century, characterized by rough, curious, or irregular forms; it applies particularly to rustic landscapes and crumbling buildings having neither the awe-inspiring grandeur of the Sublime nor the order and regularity of beauty.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300179462","kind":"concept","label":"quality","sources":[{"id":"getty-aat.300179462","title":"Getty Art & Architecture Thesaurus record 300179462","url":"http://vocab.getty.edu/page/aat/300179462"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines quality as: Use in the context of aesthetic judgment for the concept of inherent merit, worthiness, or excellence in something. For the function of selecting quality standards for a project and monitoring the finished work to assure compliance with those standards, use \"quality control.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310718","kind":"concept","label":"sabi","sources":[{"id":"getty-aat.300310718","title":"Getty Art & Architecture Thesaurus record 300310718","url":"http://vocab.getty.edu/page/aat/300310718"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sabi as: Aesthetic and poetic ideal particularly important in the Japanese tea ceremony and haiku poetry which advocates taking pleasure and finding tranquility in the old, tarnished and imperfect for their own sake. It is sometimes used synonymously or in conjunction with the concept of \"wabi\".","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056183","kind":"concept","label":"significant form","sources":[{"id":"getty-aat.300056183","title":"Getty Art & Architecture Thesaurus record 300056183","url":"http://vocab.getty.edu/page/aat/300056183"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines significant form as: Certain combinations of lines, colors, and spatial elements that excite pure aesthetic emotion; term coined by art critic Clive Bell.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055837","kind":"concept","label":"Sublime, the","sources":[{"id":"getty-aat.300055837","title":"Getty Art & Architecture Thesaurus record 300055837","url":"http://vocab.getty.edu/page/aat/300055837"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sublime, the as: The conception or expression of awe-inspiring grandeur in a work of art.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055845","kind":"concept","label":"ugliness","sources":[{"id":"getty-aat.300055845","title":"Getty Art & Architecture Thesaurus record 300055845","url":"http://vocab.getty.edu/page/aat/300055845"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ugliness as: That which evokes an awareness or feeling of deep revulsion or painfully disturbs a previously accepted aesthetic ideal. Can be considered as culturally defined or as an individual reaction.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310717","kind":"concept","label":"wabi","sources":[{"id":"getty-aat.300310717","title":"Getty Art & Architecture Thesaurus record 300310717","url":"http://vocab.getty.edu/page/aat/300310717"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines wabi as: An aesthetic ideal advocating for the appreciation of austerity, simplicity, and humility that has deeply influenced Japanese culture. This ideal finds surpassing beauty and deep significance in what is humble or commonplace and appears natural or artless. It expressed in the aesthetic of the tea ceremony, particularly in its ceramics. Its influence can also be seen in the practice of collecting older paintings and works of calligraphy and, more recently, in the rough and natural style of contemporary grass style ink painting. Wabi became a part of a poetic ideal only when it was absorbed into the concept of \"sabi\".","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300055944","kind":"field","label":"social ethics","sources":[{"id":"getty-aat.300055944","title":"Getty Art & Architecture Thesaurus record 300055944","url":"http://vocab.getty.edu/page/aat/300055944"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines social ethics as: Ethics that have as their utilitarian end the well-being and fair treatment of the entire community.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412141","kind":"concept","label":"bad luck","sources":[{"id":"getty-aat.300412141","title":"Getty Art & Architecture Thesaurus record 300412141","url":"http://vocab.getty.edu/page/aat/300412141"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bad luck as: A combination of adverse circumstances or events occurring by chance; a person's apparent tendency to have ill fortune; misfortune.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300412140","kind":"concept","label":"good luck","sources":[{"id":"getty-aat.300412140","title":"Getty Art & Architecture Thesaurus record 300412140","url":"http://vocab.getty.edu/page/aat/300412140"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines good luck as: A combination of favorable circumstances or events occurring by chance; success, prosperity, or advantage apparently brought about by chance rather than through one's own actions or abilities.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300247349","kind":"concept","label":"chaos","sources":[{"id":"getty-aat.300247349","title":"Getty Art & Architecture Thesaurus record 300247349","url":"http://vocab.getty.edu/page/aat/300247349"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines chaos as: The state of utter confusion and disorder, where everything exists as an undifferentiated, formless mass or mixture. Derived from the original concept in ancient Greek cosmology, meaning the primevil emptiness of the universe before distinct entities came into being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055946","kind":"concept","label":"dialectic","sources":[{"id":"getty-aat.300055946","title":"Getty Art & Architecture Thesaurus record 300055946","url":"http://vocab.getty.edu/page/aat/300055946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dialectic as: Originally in ancient Greece, a form of logical argumentation proceeding by question and answer. In modern times it is the idea that internal contradictions are transcended, but then give rise to new contradictions that themselves must be resolved. As a concept of evolution, it applies to diverse fields including philosophy, nature, and history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300257052","kind":"concept","label":"identity","sources":[{"id":"getty-aat.300257052","title":"Getty Art & Architecture Thesaurus record 300257052","url":"http://vocab.getty.edu/page/aat/300257052"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines identity as: Those characteristics or conditions of a thing, person, or group that remain the same amid change or that distinguish a thing, person, or group from another.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265781","kind":"concept","label":"presence","sources":[{"id":"getty-aat.300265781","title":"Getty Art & Architecture Thesaurus record 300265781","url":"http://vocab.getty.edu/page/aat/300265781"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines presence as: Concept regarding the condition of being present in front of, or in the same place with a person or thing.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055947","kind":"concept","label":"supernatural","sources":[{"id":"getty-aat.300055947","title":"Getty Art & Architecture Thesaurus record 300055947","url":"http://vocab.getty.edu/page/aat/300055947"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines supernatural as: Beyond or outside of the natural order. The term is typically used to refer to events or phenomena that are not explicable given the existing characterizations of nature. Occult phenomena and extrasensory perception are examples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404625","kind":"concept","label":"absurdism","sources":[{"id":"getty-aat.300404625","title":"Getty Art & Architecture Thesaurus record 300404625","url":"http://vocab.getty.edu/page/aat/300404625"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines absurdism as: A philosophical movement or attitude associated with Albert Camus that posits that humanity's search for meaning is futile in a chaotic, senseless universe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055956","kind":"concept","label":"anthropomorphism","sources":[{"id":"getty-aat.300055956","title":"Getty Art & Architecture Thesaurus record 300055956","url":"http://vocab.getty.edu/page/aat/300055956"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropomorphism as: Interpretation of what is not human in terms of human characteristics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055957","kind":"concept","label":"Aristotelianism","sources":[{"id":"getty-aat.300055957","title":"Getty Art & Architecture Thesaurus record 300055957","url":"http://vocab.getty.edu/page/aat/300055957"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Aristotelianism as: Philosophy incorporating essential features of the thinking of Aristotle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264368","kind":"concept","label":"Augustinianism","sources":[{"id":"getty-aat.300264368","title":"Getty Art & Architecture Thesaurus record 300264368","url":"http://vocab.getty.edu/page/aat/300264368"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Augustinianism as: Refers to the philosophical and theological ideas and doctrines derived from the work of Augustine (354-430), bishop of Hippo, and associated with the Augustinian orders. The intellectual tradition of Augustinianism has been influential since the Middle Ages, when it developed. Augustine offered an optimistic ontology and an escape from skepticism. He also formulated a cosmic theory to account for the plurality of form in the world and to reconcile it with the uniqueness of God's creative act. Augustine also described the ultimate goal of human life as a life of beatitude combined with ethical-political concern. Primacy of faith, knowledge of the soul, divine illumination, and grace are all essential aspects of Augustinianism. Augustine believed that truth resided in man's soul and it was this truth alone that instructs man. This truth, the greatest proof of God's existence, confers joy and happiness. Augustine's speculation on the Trinity and predestination were also highly influential.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055959","kind":"concept","label":"determinism","sources":[{"id":"getty-aat.300055959","title":"Getty Art & Architecture Thesaurus record 300055959","url":"http://vocab.getty.edu/page/aat/300055959"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines determinism as: Doctrine that all acts of will result from causes which determine them either in such a manner that people have no alternative course of action, or that the will is still free in the sense of being uncompelled. Determinism holds that all behaviors and events are determined by God or by the laws of the universe before they occur. Determinism takes different forms in religions, but the basic issue is how to reconcile the omnipotence of God or the inevitable effects of karma with the freedom and resposibility of a individual person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300056261","kind":"concept","label":"dualism","sources":[{"id":"getty-aat.300056261","title":"Getty Art & Architecture Thesaurus record 300056261","url":"http://vocab.getty.edu/page/aat/300056261"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dualism as: Doctrine that the universe is under the dominion of two opposing principles, one of which is good and the other evil.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300190210","kind":"concept","label":"globalism","sources":[{"id":"getty-aat.300190210","title":"Getty Art & Architecture Thesaurus record 300190210","url":"http://vocab.getty.edu/page/aat/300190210"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines globalism as: The approach to social, cultural, scientific, ecological, or humanistic questions involving an orientation to the world as a single interacting system, and the placing of its interests above those of individual regions or nations. For the similar theory or belief discussed or applied specifically in the context of politics and political science, use \"internationalism.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300178907","kind":"concept","label":"holism","sources":[{"id":"getty-aat.300178907","title":"Getty Art & Architecture Thesaurus record 300178907","url":"http://vocab.getty.edu/page/aat/300178907"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines holism as: Theory according to which a whole cannot be analyzed without residue into the sum of its parts or reduced to discrete elements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055966","kind":"concept","label":"individualism","sources":[{"id":"getty-aat.300055966","title":"Getty Art & Architecture Thesaurus record 300055966","url":"http://vocab.getty.edu/page/aat/300055966"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines individualism as: The ethical doctrine or principle that the interests of the individual are or ought to be paramount in determination of conduct.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300070431","kind":"concept","label":"nihilism","sources":[{"id":"getty-aat.300070431","title":"Getty Art & Architecture Thesaurus record 300070431","url":"http://vocab.getty.edu/page/aat/300070431"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nihilism as: Extreme form of skepticism that denies the objective reality of all values, beliefs, and truths.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300070544","kind":"concept","label":"nominalism","sources":[{"id":"getty-aat.300070544","title":"Getty Art & Architecture Thesaurus record 300070544","url":"http://vocab.getty.edu/page/aat/300070544"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nominalism as: Theory that there are no universal essences in reality, that the mind can frame no single concept or image corresponding to any universal or general term, and that only individual concrete entities have existence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055969","kind":"concept","label":"Platonism","sources":[{"id":"getty-aat.300055969","title":"Getty Art & Architecture Thesaurus record 300055969","url":"http://vocab.getty.edu/page/aat/300055969"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Platonism as: Refers to the philosophy of Plato or to any philosophy inspired by Plato, especially to Plato's idea that the phenomena perceived by the senses are an imperfect and transitory reflection of the ideal forms of an unchanging and eternal reality. This absolute reality (or realities) gives value and meaning to everything's existence, particularly to human life.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300233660","kind":"concept","label":"pluralism","sources":[{"id":"getty-aat.300233660","title":"Getty Art & Architecture Thesaurus record 300233660","url":"http://vocab.getty.edu/page/aat/300233660"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pluralism as: Philosophical theory that recognizes more than one ultimate reality or value, each capable of rational support and all appropriately included as options for individual choice. For the cultural movement promoting the full participation of diverse ethnic, racial, religious, or social groups within the larger community, use \"multiculturalism.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055971","kind":"concept","label":"positivism","sources":[{"id":"getty-aat.300055971","title":"Getty Art & Architecture Thesaurus record 300055971","url":"http://vocab.getty.edu/page/aat/300055971"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines positivism as: The philosophical doctrine of Auguste Comte and his successors. It asserts that knowledge of reality can be achieved only through the particular sciences and ordinary observation.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055972","kind":"concept","label":"pragmatism","sources":[{"id":"getty-aat.300055972","title":"Getty Art & Architecture Thesaurus record 300055972","url":"http://vocab.getty.edu/page/aat/300055972"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pragmatism as: Philosophical movement, dominant in the United States during the first quarter of the 20th century, based on the principle that the usefulness, workability, and practicality of ideas, policies, and proposals are the criteria of their merit. It stresses the priority of action over doctrine, of experience over fixed principles, and it holds that ideas borrow their meanings from their consequences and their truths from their verification.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300265479","kind":"concept","label":"rasquachismo","sources":[{"id":"getty-aat.300265479","title":"Getty Art & Architecture Thesaurus record 300265479","url":"http://vocab.getty.edu/page/aat/300265479"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines rasquachismo as: Perspective, or sensibility of the underdog, or the view of the downtrodden. The term is used specifically within the Chicano and Chicano artist community, specifically for purposes of defining identity.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055974","kind":"concept","label":"scholasticism","sources":[{"id":"getty-aat.300055974","title":"Getty Art & Architecture Thesaurus record 300055974","url":"http://vocab.getty.edu/page/aat/300055974"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines scholasticism as: The philosophical systems and speculative tendencies of various Medieval Christian thinkers, who, working against a background of fixed religious dogma, sought to solve anew general philosophical problems (as of faith and reason, will and intellect, and the provability of the existence of God), initially under the influence of the mystical and intuitional tradition of patristic philosophy, and especially Augustinianism, and later under that of Aristotle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055977","kind":"concept","label":"stoicism","sources":[{"id":"getty-aat.300055977","title":"Getty Art & Architecture Thesaurus record 300055977","url":"http://vocab.getty.edu/page/aat/300055977"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines stoicism as: A philosophical movement that flourished in Greek and Roman antiquity. Stoics have always believed that the goal of all inquiry is to provide humanity with a mode of conduct characterized by tranquility of mind and certainty of moral worth, and urged participation in the affairs of humankind. Thus, moral worth, duty, and justice are singularly Stoic emphases, together with a certain sternness of mind.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300060368","kind":"concept","label":"syncretism","sources":[{"id":"getty-aat.300060368","title":"Getty Art & Architecture Thesaurus record 300060368","url":"http://vocab.getty.edu/page/aat/300060368"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055978","kind":"concept","label":"transcendentalism","sources":[{"id":"getty-aat.300055978","title":"Getty Art & Architecture Thesaurus record 300055978","url":"http://vocab.getty.edu/page/aat/300055978"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines transcendentalism as: A philosophic movement based on an idealistic belief in the essential unity of all things, the innate goodness of man, and the supremacy of insight over logic and experience in understanding reality and ascertaining truths. It is considered to be a part of the Romantic movement and had a powerful impact on the arts, particularly literature. The term generally refers to 19th-century transcendentalism in New England although the movement was found in other countries including Germany and England.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055979","kind":"concept","label":"utilitarianism","sources":[{"id":"getty-aat.300055979","title":"Getty Art & Architecture Thesaurus record 300055979","url":"http://vocab.getty.edu/page/aat/300055979"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines utilitarianism as: Doctrine that usefulness is the highest good and that the determining characteristic of right conduct should be the usefulness of its consequence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300255715","kind":"field","label":"choreography","sources":[{"id":"getty-aat.300255715","title":"Getty Art & Architecture Thesaurus record 300255715","url":"http://vocab.getty.edu/page/aat/300255715"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines choreography as: The aspect of the discipline of dance that involves inventing or arranging and putting together steps, gestures, and patterns to form dances, and separate dances to form a dance composition.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300417579","kind":"field","label":"music theory","sources":[{"id":"getty-aat.300417579","title":"Getty Art & Architecture Thesaurus record 300417579","url":"http://vocab.getty.edu/page/aat/300417579"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music theory as: Discipline involving the study of the theoretical aspects of music and its notation, typically as opposed to actual performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417580","kind":"concept","label":"vocal arts","sources":[{"id":"getty-aat.300417580","title":"Getty Art & Architecture Thesaurus record 300417580","url":"http://vocab.getty.edu/page/aat/300417580"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vocal arts as: Discipline involving the study of singing and other vocal expressions, including performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403979","kind":"concept","label":"dramaturgy","sources":[{"id":"getty-aat.300403979","title":"Getty Art & Architecture Thesaurus record 300403979","url":"http://vocab.getty.edu/page/aat/300403979"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dramaturgy as: Describes the discipline of theatrical or dramatic composition, representation, and research. English dramaturgy is derived from German Dramaturgie, a concept developed by the German dramatist and critic Gotthold Lessing in a series of essays entitled 'Hamburgische Dramaturgie,' published 1767 to 1769. The discipline includes researching, selection, adaptation, or development of texts, scripts, plays, operas, or films for a theater or other production company.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300393171","kind":"concept","label":"computer music","sources":[{"id":"getty-aat.300393171","title":"Getty Art & Architecture Thesaurus record 300393171","url":"http://vocab.getty.edu/page/aat/300393171"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines computer music as: Musical works not in a specific form or of a specific type in which sound is generated or composed solely by computers or other electronic data-processing machinery via software or other means.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266783","kind":"concept","label":"granular synthesis","sources":[{"id":"getty-aat.300266783","title":"Getty Art & Architecture Thesaurus record 300266783","url":"http://vocab.getty.edu/page/aat/300266783"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines granular synthesis as: A method for generating sound involving the combination of tiny waveform fragments to create larger acoustic events. This is generally achieved with the use of digital computers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266052","kind":"concept","label":"musique concrète","sources":[{"id":"getty-aat.300266052","title":"Getty Art & Architecture Thesaurus record 300266052","url":"http://vocab.getty.edu/page/aat/300266052"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musique concrète as: Musical works created by recording natural sounds and subsequently altering and rearranging them into a composition. The word \"concrète\" refers to the method of working directly with sound rather than a system of abstract musical notation. Originally recorded onto discs, these works were later realized with magnetic tape as the technology became available. Developed by the French composer Pierre Schaeffer and colleagues, including Pierre Henry, in the Club d'Essai and Groupe de Recherches Musicales at the Office de Radio-diffusion et Télévision Française ca. 1948. The term \"musique concrète\" is reserved for works created solely with naturally occurring sounds recorded onto disc or magnetic tape. For works created from sounds generated primarily by electronic synthesis, or using combinations of natural and synthesized sound, use \"electronic music.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300451673","kind":"concept","label":"Noh","sources":[{"id":"getty-aat.300451673","title":"Getty Art & Architecture Thesaurus record 300451673","url":"http://vocab.getty.edu/page/aat/300451673"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Noh as: Important form of classical Japanese dance drama that has been performed since the 14th century. It is often based on stories from traditional literature with a supernatural being transformed into human form as a hero telling a story. Noh integrates masks, costumes and various props into a dance-based performance, Emotions are mainly conveyed through stylized conventional gestures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266055","kind":"concept","label":"twelve-tone music","sources":[{"id":"getty-aat.300266055","title":"Getty Art & Architecture Thesaurus record 300266055","url":"http://vocab.getty.edu/page/aat/300266055"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines twelve-tone music as: A body of musical compositions created since the early part of the 20th century created using the twelve-tone system attributed to Arnold Schoenberg. Generally twelve-tone music is considered a subset of serial music, but there is some disagreement on this.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300080402","kind":"field","label":"architectural criticism","sources":[{"id":"getty-aat.300080402","title":"Getty Art & Architecture Thesaurus record 300080402","url":"http://vocab.getty.edu/page/aat/300080402"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural criticism as: The study or practice of the analytical description, interpretation, and evaluation of architectural works.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054162","kind":"field","label":"architectural history","sources":[{"id":"getty-aat.300054162","title":"Getty Art & Architecture Thesaurus record 300054162","url":"http://vocab.getty.edu/page/aat/300054162"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural history as: Study of the development over time of the human built environment.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300168233","kind":"field","label":"art criticism","sources":[{"id":"getty-aat.300168233","title":"Getty Art & Architecture Thesaurus record 300168233","url":"http://vocab.getty.edu/page/aat/300168233"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art criticism as: The study or practice of the analytical description, interpretation, and evaluation of visual art works and exhibitions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054233","kind":"field","label":"art history","sources":[{"id":"getty-aat.300054233","title":"Getty Art & Architecture Thesaurus record 300054233","url":"http://vocab.getty.edu/page/aat/300054233"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art history as: Study of the visual arts within a historical framework, from from prehistory to the present, including stylistic development, use of art in communication and decoration, and the aesthetic and intellectual value of art. It first became a dedicated field of study in the 19th century Western world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054236","kind":"concept","label":"art therapy","sources":[{"id":"getty-aat.300054236","title":"Getty Art & Architecture Thesaurus record 300054236","url":"http://vocab.getty.edu/page/aat/300054236"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines art therapy as: Study and practice of the therapeutic use of images and objects, to foster nonverbal communication, creativity, and physical interaction, and to uncover verbal associations and interpretations, helping to identify and understand patients' emotional, motor, and perceptual dysfunctions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054240","kind":"field","label":"musicology","sources":[{"id":"getty-aat.300054240","title":"Getty Art & Architecture Thesaurus record 300054240","url":"http://vocab.getty.edu/page/aat/300054240"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054247","kind":"field","label":"applied linguistics","sources":[{"id":"getty-aat.300054247","title":"Getty Art & Architecture Thesaurus record 300054247","url":"http://vocab.getty.edu/page/aat/300054247"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines applied linguistics as: Branch of linguistics where the primary concern is the application of linguistic theories, methods, and findings to practical language problems, such as language teaching, lexicography, translation, stylistics, and speech therapy.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054256","kind":"field","label":"theoretical linguistics","sources":[{"id":"getty-aat.300054256","title":"Getty Art & Architecture Thesaurus record 300054256","url":"http://vocab.getty.edu/page/aat/300054256"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300389758","kind":"field","label":"cryptography","sources":[{"id":"getty-aat.300389758","title":"Getty Art & Architecture Thesaurus record 300389758","url":"http://vocab.getty.edu/page/aat/300389758"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300389757","kind":"field","label":"cryptology","sources":[{"id":"getty-aat.300389757","title":"Getty Art & Architecture Thesaurus record 300389757","url":"http://vocab.getty.edu/page/aat/300389757"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cryptology as: The discipline concerned with data communication and storage in secure and usually secret form, including the science, study, or practice of encrypting and decrypting information.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300112920","kind":"field","label":"etymology","sources":[{"id":"getty-aat.300112920","title":"Getty Art & Architecture Thesaurus record 300112920","url":"http://vocab.getty.edu/page/aat/300112920"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines etymology as: Study of the history of a particular word or element of a word, or of historical linguistic change.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054254","kind":"field","label":"semiotics","sources":[{"id":"getty-aat.300054254","title":"Getty Art & Architecture Thesaurus record 300054254","url":"http://vocab.getty.edu/page/aat/300054254"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054296","kind":"field","label":"process philosophy","sources":[{"id":"getty-aat.300054296","title":"Getty Art & Architecture Thesaurus record 300054296","url":"http://vocab.getty.edu/page/aat/300054296"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines process philosophy as: Refers to the theistic philosophy that views creative becoming as the universal form of reality and emphasizes the relational nature of all being.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300157724","kind":"concept","label":"anthropology of religion","sources":[{"id":"getty-aat.300157724","title":"Getty Art & Architecture Thesaurus record 300157724","url":"http://vocab.getty.edu/page/aat/300157724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropology of religion as: Study of religion using the methods and theories of anthropology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054302","kind":"concept","label":"comparative religion","sources":[{"id":"getty-aat.300054302","title":"Getty Art & Architecture Thesaurus record 300054302","url":"http://vocab.getty.edu/page/aat/300054302"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines comparative religion as: Comparative study of the characteristics of religious systems in different societies that focuses on the origin and evolution of religious beliefs and practices from earlier or less urbanized societies to modern ones, aims to develop a universal evolutionary continuum of religions, and stresses a scientific methodology. For the comparative study of religions that largely disregards evolutionary schemes and features a primarily historical methodology, use \"religious history.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054303","kind":"concept","label":"philosophy of religion","sources":[{"id":"getty-aat.300054303","title":"Getty Art & Architecture Thesaurus record 300054303","url":"http://vocab.getty.edu/page/aat/300054303"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines philosophy of religion as: The philosophical study of religion, especially concerning the rationality of religious beliefs, and the descriptive analysis and elucidation of religious language, belief, and practice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054304","kind":"concept","label":"psychology of religion","sources":[{"id":"getty-aat.300054304","title":"Getty Art & Architecture Thesaurus record 300054304","url":"http://vocab.getty.edu/page/aat/300054304"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines psychology of religion as: Branch of religious study in which religious thought, experience, and behavior are studied using the concepts and methodology of psychology.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054305","kind":"concept","label":"sociology of religion","sources":[{"id":"getty-aat.300054305","title":"Getty Art & Architecture Thesaurus record 300054305","url":"http://vocab.getty.edu/page/aat/300054305"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sociology of religion as: Study of religion using the sociological method of approach.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054307","kind":"field","label":"biblical studies","sources":[{"id":"getty-aat.300054307","title":"Getty Art & Architecture Thesaurus record 300054307","url":"http://vocab.getty.edu/page/aat/300054307"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines biblical studies as: Critical study of the Bible and biblical writings, including such approaches as textual analysis, historical study, exegesis, hermeneutics, and literary and linguistic criticism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054308","kind":"field","label":"church history","sources":[{"id":"getty-aat.300054308","title":"Getty Art & Architecture Thesaurus record 300054308","url":"http://vocab.getty.edu/page/aat/300054308"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines church history as: Study of the history of the Christian Church and its sects and branches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054310","kind":"field","label":"ecclesiology","sources":[{"id":"getty-aat.300054310","title":"Getty Art & Architecture Thesaurus record 300054310","url":"http://vocab.getty.edu/page/aat/300054310"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ecclesiology as: Study of the doctrines of the church, including the study of ecclesiastical art, antiquities, and the adornment and equipment of churches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054311","kind":"field","label":"eschatology","sources":[{"id":"getty-aat.300054311","title":"Getty Art & Architecture Thesaurus record 300054311","url":"http://vocab.getty.edu/page/aat/300054311"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines eschatology as: The science or teachings concerned with last things, such as the end of history or of the present world, the fate of the soul after death, the final judgment of individuals, and the creation or restoration of a perfect world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054312","kind":"field","label":"religious ethics","sources":[{"id":"getty-aat.300054312","title":"Getty Art & Architecture Thesaurus record 300054312","url":"http://vocab.getty.edu/page/aat/300054312"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious ethics as: Study of ethics inspired and informed by religious doctrine, faith, and experience, also the study of religious doctrine and commitment with reference to ethics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054309","kind":"field","label":"religious history","sources":[{"id":"getty-aat.300054309","title":"Getty Art & Architecture Thesaurus record 300054309","url":"http://vocab.getty.edu/page/aat/300054309"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religious history as: Refers to the comparative historical study of the nature and structure of the world's religions and their diverse manifestations over time in different societies and cultures. For the comparative study of the characteristics of religious systems in different societies that aims to develop a universal evolutionary continuum of religions and stresses a scientific methodology, see \"comparative religion.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391196","kind":"concept","label":"arhats","sources":[{"id":"getty-aat.300391196","title":"Getty Art & Architecture Thesaurus record 300391196","url":"http://vocab.getty.edu/page/aat/300391196"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arhats as: Buddhist saints, the most accomplished of the four types of who have defeated all afflictions and will enter nirvana upon death. Typically depicted as 16 in number, who vowed to remain alive to preserve his teachings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264338","kind":"concept","label":"bardo","sources":[{"id":"getty-aat.300264338","title":"Getty Art & Architecture Thesaurus record 300264338","url":"http://vocab.getty.edu/page/aat/300264338"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bardo as: In Tibetan Buddhism, the intermediate state between death and rebirth. Bardo, which can last up to 49 days, follows a vision of a beam of clear light by the dying person.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386039","kind":"concept","label":"bhūmi","sources":[{"id":"getty-aat.300386039","title":"Getty Art & Architecture Thesaurus record 300386039","url":"http://vocab.getty.edu/page/aat/300386039"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bhūmi as: The earth, floor, or foundation, symbolically stages of enlightenment in Buddhist practice.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404619","kind":"concept","label":"buddha field","sources":[{"id":"getty-aat.300404619","title":"Getty Art & Architecture Thesaurus record 300404619","url":"http://vocab.getty.edu/page/aat/300404619"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines buddha field as: In Buddhism, realms of individual bodhisattvas who have attained awakening; may have varying spiritual climates or degrees of perfection, either pure or mixed.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264384","kind":"concept","label":"dharma","sources":[{"id":"getty-aat.300264384","title":"Getty Art & Architecture Thesaurus record 300264384","url":"http://vocab.getty.edu/page/aat/300264384"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dharma as: Refers to a key concept with multiple meanings in Hinduism, Buddhism, and Jainism. In Hinduism, dharma is the religious and moral law governing and enabling society and individual conduct. It is found in the early religious manuals called the dharmasutras and has been expanded into larger compilations of law called the dharmashastra. Dharma in Buddhism retains the Hindu sense of cosmic law and order but it also came to be applied to the teachings of the Buddha who is seen as a manifestation of the universal truth that is dharma. Thus, dharma is the practice of this truth in Buddhism. The triratna (\"three jewels\") is a fundamental aspect of Buddhism and consists of the Buddha, dharma, and the sangha (community of believers). In the context of Buddhist metaphysics, the term in the plural (dharmas) refers to the interrelated elements that make up the empirical world. In addition to being commonly understood as moral virtue in Jaina philosophy, dharma also refers to an eternal \"substance\" (dravya) that is the medium that allows living beings to move. It is a meaning unique to Jainism. The term may simply refer to the teachings of the Jinas. For the Jains, dharma has its opposite in adharma which is error and immorality as well as the ability to rest or pause.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438552","kind":"concept","label":"dhyana","sources":[{"id":"getty-aat.300438552","title":"Getty Art & Architecture Thesaurus record 300438552","url":"http://vocab.getty.edu/page/aat/300438552"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dhyana as: In Hinduism and Buddhism, a type of profound meditation; the penultimate (seventh) stage of yoga.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404702","kind":"concept","label":"karma","sources":[{"id":"getty-aat.300404702","title":"Getty Art & Architecture Thesaurus record 300404702","url":"http://vocab.getty.edu/page/aat/300404702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines karma as: The chain of causation that drives all phenomena, in which virtuous actions lead to future happiness and evil acts the opposite. The sum of a person's actions in one of his successive states of existence, regarded as determining his fate in the next. Among symbols for karma is the endless knot. Karma is a key concept in Hinduism, Buddhism, Jainism, Sikhism, and Taoism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310716","kind":"concept","label":"mappō","sources":[{"id":"getty-aat.300310716","title":"Getty Art & Architecture Thesaurus record 300310716","url":"http://vocab.getty.edu/page/aat/300310716"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines mappō as: The clearest expression of apocalyptic thought in Japanese Buddhism, this third and final age of Buddhism was believed to have begun in 1052. During this end of the Buddhist Law, Buddhism is thought to degenerate to the point where the teaching still exists, but there is no true practice of it. This religious pessimism and preparation for the end times caused a flurry of art commissions during the late Heian period in areas such as sculpture, calligraphy, painting and temple building by wealthy aristocrats who hoped to gain salvation by honoring Amida Buddha.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264486","kind":"concept","label":"nirvana","sources":[{"id":"getty-aat.300264486","title":"Getty Art & Architecture Thesaurus record 300264486","url":"http://vocab.getty.edu/page/aat/300264486"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines nirvana as: Concept of state of deep inner freedom and peace, the supreme goal of Hinduism and Buddhism. Reaching nirvana means liberation from samsara, the cycle of birth, death, and rebirth. In Buddhism, nirvana represents freedom from attachments and individual consciousness and the attainment of tranquility and purity. Nirvana is conceived somewhat differently within the various schools of Buddhism. In Hinduism it furthermore means that union with God or the Absolute is possible.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404618","kind":"concept","label":"pure land","sources":[{"id":"getty-aat.300404618","title":"Getty Art & Architecture Thesaurus record 300404618","url":"http://vocab.getty.edu/page/aat/300404618"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pure land as: In Mahayana Buddhism, pure abodes or celestial realms of a buddha or bodhisattva; used for East Asian Buddhism, Taoism, and Bon. For realms both pure and mixed, use \"buddha fields.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310095","kind":"concept","label":"satori","sources":[{"id":"getty-aat.300310095","title":"Getty Art & Architecture Thesaurus record 300310095","url":"http://vocab.getty.edu/page/aat/300310095"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines satori as: In Zen Buddhism, satori refers to a sudden personal enlightenment analagous to the original moment of spiritual rebirth experienced by the Gautama Buddha.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404712","kind":"concept","label":"uṣṇīsạ","sources":[{"id":"getty-aat.300404712","title":"Getty Art & Architecture Thesaurus record 300404712","url":"http://vocab.getty.edu/page/aat/300404712"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines uṣṇīsạ as: Physical mark identifying a buddha, conventionally depicted as a cranial bump and said to possess magical properties.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264482","kind":"concept","label":"consubstantiation","sources":[{"id":"getty-aat.300264482","title":"Getty Art & Architecture Thesaurus record 300264482","url":"http://vocab.getty.edu/page/aat/300264482"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines consubstantiation as: The doctrine according to which the substances of both the body and blood of Christ and of the bread and wine coexist in the eucharistic elements after being consecrated. The concept is attributed to Luther, who was opposed to the doctrine of transubstantiation. Luther illustrated the concept with the analogy of an iron in a fire: the fire and the iron are united in the red-hot iron yet both are still present.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300066049","kind":"concept","label":"immaculate conception","sources":[{"id":"getty-aat.300066049","title":"Getty Art & Architecture Thesaurus record 300066049","url":"http://vocab.getty.edu/page/aat/300066049"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines immaculate conception as: The Christian doctrinal concept that the Virgin Mary was free from original sin from the moment of conception, unlike all other humans after Adam and Eve. Although this belief was promulgated as Roman Catholic dogma by Pope Pius IX in 1854, it has been rejected by Protestants and the Orthodox Church.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300065709","kind":"concept","label":"stigmatization","sources":[{"id":"getty-aat.300065709","title":"Getty Art & Architecture Thesaurus record 300065709","url":"http://vocab.getty.edu/page/aat/300065709"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines stigmatization as: The appearance of wounds on the hands, feet, and side corresponding to those received by Christ upon crucifixion, which have appeared, inexplicably, on some people who intensely contemplate the Passion of Christ.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264336","kind":"concept","label":"avatara","sources":[{"id":"getty-aat.300264336","title":"Getty Art & Architecture Thesaurus record 300264336","url":"http://vocab.getty.edu/page/aat/300264336"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines avatara as: Refers to the descent to earth of a Hindu deity in a visible form. The word comes from the Sanskrit meaning 'descent.' The concept comes from the tradition associated with the deity Vishnu who periodically appeared on earth in human or animal form in order to save it from severe danger or destruction. Vishnu's most famous manifestations have been as Krishna and Rama. The deity is expected to return in the last of his forms to destroy and subsequently recreate the world at a time when it is completely depraved. In more recent times the concept has been challenged by reformers, particularly in regards to manifestations in animal forms. At the same time, others have put forward the idea that humans, even non-Hindus such as Jesus or Muhammad, can become avataras by a divine infilling.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264356","kind":"concept","label":"bhakti","sources":[{"id":"getty-aat.300264356","title":"Getty Art & Architecture Thesaurus record 300264356","url":"http://vocab.getty.edu/page/aat/300264356"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bhakti as: In Hinduism, loving and adoring devotion to God or to one's chosen manifestation of the divine that leads to a close personal relationship with God. By surrendering to God, one can receive grace, however low one's station. In most religious texts of popular Hinduism, bhakti is recommended as the most effective path to the divine. This concept is behind some of the world's most moving theistic poetry.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264385","kind":"concept","label":"moksha","sources":[{"id":"getty-aat.300264385","title":"Getty Art & Architecture Thesaurus record 300264385","url":"http://vocab.getty.edu/page/aat/300264385"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines moksha as: In Hinduism, liberation from samsara, the cycle of birth, death, and rebirth. This liberation would mean a state of bliss (ananda), freedom from sorrow and higher awareness. It is the fourth and ultimate artha (goal) for Hindus, attained when ignorance, desire, and all attachments are overcome. There are various interpretations of moksha, especially in regard to how it is attained, whether by personal effort, by grace of a personal god, or a combination of the two. In Jainism, moksha lies beyond enlightenment and is freedom from the impediment of karma; enlightenment provides the means for rooting out all remaining karma.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300447407","kind":"concept","label":"pañcadēvōpāsanā","sources":[{"id":"getty-aat.300447407","title":"Getty Art & Architecture Thesaurus record 300447407","url":"http://vocab.getty.edu/page/aat/300447407"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pañcadēvōpāsanā as: Worship of five divinities: Viṣṇu, Śiva, Sūrya, Gaṇapati, and Śakti.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264365","kind":"concept","label":"samsara","sources":[{"id":"getty-aat.300264365","title":"Getty Art & Architecture Thesaurus record 300264365","url":"http://vocab.getty.edu/page/aat/300264365"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines samsara as: The cycle of death and rebirth experienced by all unawakened beingsover potentially infinite eons consisting often of six destinies: (1) divinity, (2) demigod, (3) human, (4) animal, (5) ghost, and (6) hell dweller in Buddhism, Hinduism and Jainism. Although debated, the concept is probably of non-Vedic or heterodox origin.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264386","kind":"concept","label":"trimurti","sources":[{"id":"getty-aat.300264386","title":"Getty Art & Architecture Thesaurus record 300264386","url":"http://vocab.getty.edu/page/aat/300264386"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines trimurti as: Hindu concept of the collapse of the three main Hindu gods, Brahma, Vishnu, and Shiva, into a single form with three faces. Some scholars consider the trimurti as a way to reconcile different monotheistic approaches with one another and with the concept of ultimate reality (Brahman) since the trimurti manifests the cosmic functions of the Supreme Being. The trimurti was classically expressed in the poem 'Kumarasambhava' by Kalidasa (ca. 4th-5th century).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264305","kind":"concept","label":"ahimsa","sources":[{"id":"getty-aat.300264305","title":"Getty Art & Architecture Thesaurus record 300264305","url":"http://vocab.getty.edu/page/aat/300264305"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ahimsa as: Refers to the principle of respect for all life and the practice of non-injury to all living beings; it is found in Buddhism, some Hindu sects, and especially Jainism. Ahimsa is based on the belief that all living creatures are sacred and that violence has negative effects on those who commit it, for example, harming a living thing may result in an unfavorable reincarnation. The term comes from the Sanskrit meaning 'not-harming.'","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300446915","kind":"concept","label":"cāraṇa","sources":[{"id":"getty-aat.300446915","title":"Getty Art & Architecture Thesaurus record 300446915","url":"http://vocab.getty.edu/page/aat/300446915"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines cāraṇa as: In Jainism, cāraṇa refers to the 'capability to move in the sky,' one of the eight extraordinary powers of mythical flying ascetics.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300237780","kind":"concept","label":"image quality","sources":[{"id":"getty-aat.300237780","title":"Getty Art & Architecture Thesaurus record 300237780","url":"http://vocab.getty.edu/page/aat/300237780"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines image quality as: Use with reference to photographic and electronic images, usually pertaining to the clarity of details, often relating to the degree of resolution.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264475","kind":"concept","label":"group identity","sources":[{"id":"getty-aat.300264475","title":"Getty Art & Architecture Thesaurus record 300264475","url":"http://vocab.getty.edu/page/aat/300264475"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines group identity as: An individual person's conscious sharing of some kind of essential character with one or more groups of other people, such as a race, nation, social class, profession, or body of people organized into a group at some particular time for some particular purpose.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055970","kind":"concept","label":"Neo-Platonism","sources":[{"id":"getty-aat.300055970","title":"Getty Art & Architecture Thesaurus record 300055970","url":"http://vocab.getty.edu/page/aat/300055970"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neo-Platonism as: Refers to a philosophy developed by Plotinus in Alexandria in the 3rd century CE that consists of a modified version of Platonism combined with aspects of Judaic and Christian thought and possibly Oriental mysticism. Neo-Platonism holds that there is one source from which all existence comes from and with which an individual soul can be mystically united; it also emphasizes the plurality of levels of being, with the physical universe perceptible to the senses being the lowest. Neo-Platonism developed in a variety of forms over many centuries and it has enjoyed numerous revivals and modifications throughout history.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444342","kind":"concept","label":"amalgam style","sources":[{"id":"getty-aat.300444342","title":"Getty Art & Architecture Thesaurus record 300444342","url":"http://vocab.getty.edu/page/aat/300444342"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines amalgam style as: Style that combines recognizable elements of two or more defined styles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106711","kind":"concept","label":"ancient","sources":[{"id":"getty-aat.300106711","title":"Getty Art & Architecture Thesaurus record 300106711","url":"http://vocab.getty.edu/page/aat/300106711"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ancient as: In the discipline of art and architectural history, typically refers to the period in Europe, Asia Minor, and north Africa, prior to the fall of the western Roman Empire. The term is also sometimes applied more generally to prehistory and to early cultures in other areas of the world.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404836","kind":"concept","label":"Archaeological Style","sources":[{"id":"getty-aat.300404836","title":"Getty Art & Architecture Thesaurus record 300404836","url":"http://vocab.getty.edu/page/aat/300404836"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Archaeological Style as: Style of visual arts that intentionally imitates ancient objects or style. Most often used to refer to jewelry design, but may also be applied to paintings, sculpture, and occasionally to architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391250","kind":"concept","label":"geologic time scale","sources":[{"id":"getty-aat.300391250","title":"Getty Art & Architecture Thesaurus record 300391250","url":"http://vocab.getty.edu/page/aat/300391250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines geologic time scale as: An internationally recognized time scale of Earth's history since the planet's formative period subdivided into eons, eras, periods, and epochs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300443463","kind":"concept","label":"Late Glacial","sources":[{"id":"getty-aat.300443463","title":"Getty Art & Architecture Thesaurus record 300443463","url":"http://vocab.getty.edu/page/aat/300443463"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Glacial as: Designating the latter part of the last Quaternary glacial period, immediately preceding the current postglacial period, marked predominantly by the retreat of glaciers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444999","kind":"concept","label":"Post-Colonial","sources":[{"id":"getty-aat.300444999","title":"Getty Art & Architecture Thesaurus record 300444999","url":"http://vocab.getty.edu/page/aat/300444999"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Post-Colonial as: Basic reference to 'after the colonial\" condition, periods, and cultures of peoples, states, and societies that have been through a process of formal decolonization. Since the 1980s the term is used to also refer to the trend to question Western knowledge, categories, and assumptions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019257","kind":"concept","label":"prehistoric","sources":[{"id":"getty-aat.300019257","title":"Getty Art & Architecture Thesaurus record 300019257","url":"http://vocab.getty.edu/page/aat/300019257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric as: Refers to the period antecedent to the first contemporary written accounts of a people. The time span for this period varies according to specific local habitation patterns and in different scholarly disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019280","kind":"concept","label":"protohistoric","sources":[{"id":"getty-aat.300019280","title":"Getty Art & Architecture Thesaurus record 300019280","url":"http://vocab.getty.edu/page/aat/300019280"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines protohistoric as: Periods and cultures between prehistory and history, during which a culture or civilization has not yet developed writing, but other cultures have provided written historical records for this people in a given area.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106723","kind":"concept","label":"three-age system","sources":[{"id":"getty-aat.300106723","title":"Getty Art & Architecture Thesaurus record 300106723","url":"http://vocab.getty.edu/page/aat/300106723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines three-age system as: Division of human prehistory into three ages: the Stone Age, the Bronze Age, and the Iron Age.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300385955","kind":"concept","label":"Antarctic","sources":[{"id":"getty-aat.300385955","title":"Getty Art & Architecture Thesaurus record 300385955","url":"http://vocab.getty.edu/page/aat/300385955"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Antarctic as: Having to do with the style or culture of the south polar region of the earth, which comprises the continent of Antarctica together with the seas and islands of the Southern Ocean. Also refers to the flora, fauna, geography, oceanography, or climate of the region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018279","kind":"concept","label":"Asian","sources":[{"id":"getty-aat.300018279","title":"Getty Art & Architecture Thesaurus record 300018279","url":"http://vocab.getty.edu/page/aat/300018279"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Asian as: Refers to the cultures of the continent of Asia, which is in the eastern hemisphere, and is bounded by the Pacific Ocean, the Indian Ocean, the Arctic Ocean, and is generally considered to be delimited on the west by the Ural Mountains. It also refers to the numerous islands off the coast of Asia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019255","kind":"concept","label":"Early Western World","sources":[{"id":"getty-aat.300019255","title":"Getty Art & Architecture Thesaurus record 300019255","url":"http://vocab.getty.edu/page/aat/300019255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Western World as: Refers to a style region encompassing the Mediterranean and the Occident.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300020656","kind":"concept","label":"European","sources":[{"id":"getty-aat.300020656","title":"Getty Art & Architecture Thesaurus record 300020656","url":"http://vocab.getty.edu/page/aat/300020656"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines European as: Styles, periods, and cultures of the continent of Europe, which is in the northern hemisphere, is bounded by the Arctic Ocean, the Atlantic Ocean, and the Mediterranean Sea, and is generally considered to be delimited on the east by the Ural Mountains.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444301","kind":"concept","label":"Global","sources":[{"id":"getty-aat.300444301","title":"Getty Art & Architecture Thesaurus record 300444301","url":"http://vocab.getty.edu/page/aat/300444301"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Global as: Styles, periods, and cultures that cross boundaries of multiple nations and regions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021516","kind":"concept","label":"Islamic World, The","sources":[{"id":"getty-aat.300021516","title":"Getty Art & Architecture Thesaurus record 300021516","url":"http://vocab.getty.edu/page/aat/300021516"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Islamic World, The as: Refers to a style region encompassing the regions where Islam is prevalent.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266481","kind":"concept","label":"Middle Eastern","sources":[{"id":"getty-aat.300266481","title":"Getty Art & Architecture Thesaurus record 300266481","url":"http://vocab.getty.edu/page/aat/300266481"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Eastern as: Styles and cultures existing in the extensive area that includes the nations of southwest Asia and northeastern Africa. The term was formerly used to also include Afghanistan, Pakistan, India, and Burma.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021854","kind":"concept","label":"Oceanic","sources":[{"id":"getty-aat.300021854","title":"Getty Art & Architecture Thesaurus record 300021854","url":"http://vocab.getty.edu/page/aat/300021854"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic as: Cultures and styles of various regions in Oceania, comprising islands scattered throughout the Pacific Ocean (generally excluding Japan, Indonesia, and the Philippines), but including Australia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016617","kind":"concept","label":"The Americas","sources":[{"id":"getty-aat.300016617","title":"Getty Art & Architecture Thesaurus record 300016617","url":"http://vocab.getty.edu/page/aat/300016617"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444354","kind":"concept","label":"bungalow style","sources":[{"id":"getty-aat.300444354","title":"Getty Art & Architecture Thesaurus record 300444354","url":"http://vocab.getty.edu/page/aat/300444354"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines bungalow style as: Style of domestic architecture with a one- to one-and-a-half-story building having a low-pitched gable or hipped roof, with widely projecting, often bracketed eaves, dormers, and conspicuous front porches.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444901","kind":"concept","label":"military style","sources":[{"id":"getty-aat.300444901","title":"Getty Art & Architecture Thesaurus record 300444901","url":"http://vocab.getty.edu/page/aat/300444901"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines military style as: Style of fashion, decorative arts, and architecture that invoke elements of miliary design and architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312275","kind":"concept","label":"old-fashioned","sources":[{"id":"getty-aat.300312275","title":"Getty Art & Architecture Thesaurus record 300312275","url":"http://vocab.getty.edu/page/aat/300312275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines old-fashioned as: A style that belongs to or resembles a style or fashion of an earlier time. The term refers not to an absolute time frame, but is relative to the period being discussed, not to the present. For example, a style popular in 1710 may in 2010 be said to have been \"old fashioned\" in 1750. \"Old fashioned\" differs from \"retro\" in implying that a style or object is antiquated, outdated, and sometimes unfashionable in form or character, while \"retro\" implies reference to a previous style (usually from the mid-20th century) that is still considered desirable and popular for its nostalgic value.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310544","kind":"concept","label":"period style","sources":[{"id":"getty-aat.300310544","title":"Getty Art & Architecture Thesaurus record 300310544","url":"http://vocab.getty.edu/page/aat/300310544"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines period style as: Term referring to any generic style, particularly in the context of interior design, characterized by the incorporation of antiques or replicas of antiques of one particular named style, usually styles from 18th and 19th-century Europe and the United States (e.g., American Colonial, Louis XIV, Hepplewhite, etc.).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444311","kind":"concept","label":"plantation house style","sources":[{"id":"getty-aat.300444311","title":"Getty Art & Architecture Thesaurus record 300444311","url":"http://vocab.getty.edu/page/aat/300444311"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines plantation house style as: Style of architecture, interior design, or other works that evokes elements of plantation houses of the American south or of Hawaii or other island colonial settlements. Particulary appropriate when the work is not affiliated with a plantation, but only the style is appropriated.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391392","kind":"concept","label":"pre-colonial","sources":[{"id":"getty-aat.300391392","title":"Getty Art & Architecture Thesaurus record 300391392","url":"http://vocab.getty.edu/page/aat/300391392"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pre-colonial as: General term designating a culture, style, or period occurring or existing before the colonial period of a country. Often used in reference to indigenous cultures prior to European colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444345","kind":"concept","label":"ranch style","sources":[{"id":"getty-aat.300444345","title":"Getty Art & Architecture Thesaurus record 300444345","url":"http://vocab.getty.edu/page/aat/300444345"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ranch style as: Style of domestic architecture, particularly in North American 1940s-1950s. Characterized by having one-story and low-pitched roofs.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300310539","kind":"concept","label":"shabby chic","sources":[{"id":"getty-aat.300310539","title":"Getty Art & Architecture Thesaurus record 300310539","url":"http://vocab.getty.edu/page/aat/300310539"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines shabby chic as: A style, particularly in the context of interior design, characterized by European or American antiques or replicas of antiques that that show evidence of wear and age, such as layers of paint that are worn and chipped and faded or muted fabrics. The style first developed in Britain. The term was coined in the \"World of Interiors\" magazine in the 1980s and has become a registered trademark for a US company.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300311925","kind":"concept","label":"plastic arts","sources":[{"id":"getty-aat.300311925","title":"Getty Art & Architecture Thesaurus record 300311925","url":"http://vocab.getty.edu/page/aat/300311925"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines plastic arts as: In general, refers to the visual arts as opposed to literature, poetry, or other writing. In a narrower sense, it sometimes refers to all visual arts concerned with three-dimensional objects, but not two-dimensional visual arts. For works made of the material plastic, use \"plastic (organic material).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300379540","kind":"field","label":"technical art history","sources":[{"id":"getty-aat.300379540","title":"Getty Art & Architecture Thesaurus record 300379540","url":"http://vocab.getty.edu/page/aat/300379540"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines technical art history as: Refers to an emerging interdisciplinary field which seeks to integrate scientific study of art into the practice of art history; and the interpretative methods of the art historian into the conservation lab. An outgrowth of the subdiscipline of art history once known as Technical Studies, the field has recently established itself within graduate program curricula.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300343751","kind":"concept","label":"automotive design","sources":[{"id":"getty-aat.300343751","title":"Getty Art & Architecture Thesaurus record 300343751","url":"http://vocab.getty.edu/page/aat/300343751"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines automotive design as: Practice and discipline of designing the appearance, ergonomics, complex systems, and other aspects of motor vehicles, usually road vehicles such as automobiles, motorcycles, trucks, buses, coaches, and vans.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457792","kind":"concept","label":"communication design","sources":[{"id":"getty-aat.300457792","title":"Getty Art & Architecture Thesaurus record 300457792","url":"http://vocab.getty.edu/page/aat/300457792"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines communication design as: Discipline that focuses on the presentation of information using visual and written elements. Communication design is a broad concept covering various disciplines, such as advertising, branding, web design, user interface design, information design, and social media. Communication designers focus on the strategy, content, and context of their messages, and how they can influence the behavior, attitude, and perception of their audience. Communication design uses research, analysis, storytelling, and user testing to create effective and engaging visual solutions that meet the needs and goals of clients and users.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300163423","kind":"concept","label":"costume design","sources":[{"id":"getty-aat.300163423","title":"Getty Art & Architecture Thesaurus record 300163423","url":"http://vocab.getty.edu/page/aat/300163423"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines costume design as: Designing clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances. For the design of clothing and accessories for personal wear, use \"fashion design.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300138708","kind":"concept","label":"fashion design","sources":[{"id":"getty-aat.300138708","title":"Getty Art & Architecture Thesaurus record 300138708","url":"http://vocab.getty.edu/page/aat/300138708"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines fashion design as: Designing clothing, accessories, and ensembles for personal wear. For the design of clothing, accessories, and ensembles intended to create an appearance characteristic of a particular period, person, place, or thing, especially (but not exclusively) for theatrical performances, use \"costume design.\" For the concept of a prevailing, usually short lived custom, usage, or style in clothing, cars, restaurants, and other personal possessions and services, use \"fashion.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435227","kind":"concept","label":"furniture design","sources":[{"id":"getty-aat.300435227","title":"Getty Art & Architecture Thesaurus record 300435227","url":"http://vocab.getty.edu/page/aat/300435227"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines furniture design as: Practice and discipline of designing furniture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417661","kind":"concept","label":"garden design","sources":[{"id":"getty-aat.300417661","title":"Getty Art & Architecture Thesaurus record 300417661","url":"http://vocab.getty.edu/page/aat/300417661"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines garden design as: Discipline specializing in garden projects that are most often sited at a residence. Garden design is generally of smaller scale than landscape design, and may have defined boundaries.The practice differs from landscape architecture in the level of accreditation of the practitioner. For the discipline that requires licensed architects to design the use of outdoor space and the land, and that may include site planning, urban planning, park and recreation planning, garden design and historic preservation, use 'landscape architecture.'","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054181","kind":"concept","label":"graphic design","sources":[{"id":"getty-aat.300054181","title":"Getty Art & Architecture Thesaurus record 300054181","url":"http://vocab.getty.edu/page/aat/300054181"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054183","kind":"concept","label":"industrial design","sources":[{"id":"getty-aat.300054183","title":"Getty Art & Architecture Thesaurus record 300054183","url":"http://vocab.getty.edu/page/aat/300054183"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines industrial design as: The design of functional objects that can be mass-produced, including machine-made consumer and commercial products.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300161596","kind":"concept","label":"interior decoration","sources":[{"id":"getty-aat.300161596","title":"Getty Art & Architecture Thesaurus record 300161596","url":"http://vocab.getty.edu/page/aat/300161596"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines interior decoration as: The discipline focused on selecting and organizing the surface coverings, draperies, furniture, and furnishings of architectural interiors, usually of existing spaces.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054184","kind":"concept","label":"interior design","sources":[{"id":"getty-aat.300054184","title":"Getty Art & Architecture Thesaurus record 300054184","url":"http://vocab.getty.edu/page/aat/300054184"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines interior design as: Discipline specializing in the design of interiors of homes or other buildings, including placement of furniture, accessories, aesthetic or decorative schemes, and spatial arrangements, construction, building systems, acoustics, lighting, heating, and air conditioning of spaces. May refer to design for existing spaces or for spaces in the planning phases. For the discipline limited to the choices of color, texture, and superficial arrangement of furnishings of a space, prefer \"interior decoration.\" For the discipline focusing more on the architecture of the interior, prefer \"interior architecture (discipline).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435123","kind":"concept","label":"jewelry design","sources":[{"id":"getty-aat.300435123","title":"Getty Art & Architecture Thesaurus record 300435123","url":"http://vocab.getty.edu/page/aat/300435123"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines jewelry design as: Discipline and activity of designing ornaments such as bracelets, necklaces, and rings for personal adornment.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300260338","kind":"concept","label":"paper engineering","sources":[{"id":"getty-aat.300260338","title":"Getty Art & Architecture Thesaurus record 300260338","url":"http://vocab.getty.edu/page/aat/300260338"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines paper engineering as: Design of paper structures and mechanisms, such as pop-up elements in books and greeting cards, cut-and-assemble paper models, and various types of paper containers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300069390","kind":"concept","label":"participatory design","sources":[{"id":"getty-aat.300069390","title":"Getty Art & Architecture Thesaurus record 300069390","url":"http://vocab.getty.edu/page/aat/300069390"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines participatory design as: Participation by workers and residents in the design of the spaces, structures, or communities which they use or inhabit.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435128","kind":"concept","label":"set design","sources":[{"id":"getty-aat.300435128","title":"Getty Art & Architecture Thesaurus record 300435128","url":"http://vocab.getty.edu/page/aat/300435128"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines set design as: The discipline and practice of designing and creating the sets, that is the physical surroundings in which the action takes place, for films, television, or theater.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300435243","kind":"concept","label":"textile design","sources":[{"id":"getty-aat.300435243","title":"Getty Art & Architecture Thesaurus record 300435243","url":"http://vocab.getty.edu/page/aat/300435243"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines textile design as: Practice and discipline of designing textiles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300375660","kind":"concept","label":"Web design","sources":[{"id":"getty-aat.300375660","title":"Getty Art & Architecture Thesaurus record 300375660","url":"http://vocab.getty.edu/page/aat/300375660"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Web design as: Refers to the practice of designing for Websites, including graphical functional, and structural considerations.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054241","kind":"field","label":"ethnomusicology","sources":[{"id":"getty-aat.300054241","title":"Getty Art & Architecture Thesaurus record 300054241","url":"http://vocab.getty.edu/page/aat/300054241"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ethnomusicology as: Branch of musicology focusing on the study of music in its cultural context.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300205021","kind":"field","label":"organology","sources":[{"id":"getty-aat.300205021","title":"Getty Art & Architecture Thesaurus record 300205021","url":"http://vocab.getty.edu/page/aat/300205021"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines organology as: Descriptive and analytical study of musical instruments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300435151","kind":"field","label":"architectural photography","sources":[{"id":"getty-aat.300435151","title":"Getty Art & Architecture Thesaurus record 300435151","url":"http://vocab.getty.edu/page/aat/300435151"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectural photography as: Specialization of photography focused on architecture as subject.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054248","kind":"field","label":"anthropological linguistics","sources":[{"id":"getty-aat.300054248","title":"Getty Art & Architecture Thesaurus record 300054248","url":"http://vocab.getty.edu/page/aat/300054248"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines anthropological linguistics as: Study of speech communities, particularly those with no writing system, by the application of anthropological and linguistic techniques.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054250","kind":"field","label":"computational linguistics","sources":[{"id":"getty-aat.300054250","title":"Getty Art & Architecture Thesaurus record 300054250","url":"http://vocab.getty.edu/page/aat/300054250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines computational linguistics as: Branch of linguistics concerned with the use of computers for the analysis and synthesis of language data, as in translation, word frequency counts, and speech recognition and synthesis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054255","kind":"field","label":"sociolinguistics","sources":[{"id":"getty-aat.300054255","title":"Getty Art & Architecture Thesaurus record 300054255","url":"http://vocab.getty.edu/page/aat/300054255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054251","kind":"field","label":"graphemics","sources":[{"id":"getty-aat.300054251","title":"Getty Art & Architecture Thesaurus record 300054251","url":"http://vocab.getty.edu/page/aat/300054251"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines graphemics as: Study of writing systems and of their relation to speech.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054257","kind":"field","label":"historical linguistics","sources":[{"id":"getty-aat.300054257","title":"Getty Art & Architecture Thesaurus record 300054257","url":"http://vocab.getty.edu/page/aat/300054257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines historical linguistics as: Study of the development of or changes in words, speech, and language or groups of languages over time.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054258","kind":"field","label":"metalinguistics","sources":[{"id":"getty-aat.300054258","title":"Getty Art & Architecture Thesaurus record 300054258","url":"http://vocab.getty.edu/page/aat/300054258"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines metalinguistics as: Branch of linguistics that deals with the relation of language to the rest of culture-determined behavior.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054262","kind":"field","label":"phonetics","sources":[{"id":"getty-aat.300054262","title":"Getty Art & Architecture Thesaurus record 300054262","url":"http://vocab.getty.edu/page/aat/300054262"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phonetics as: Study of the production, transmission, perception, classification, and physical or acoustical properties of speech sounds and how they are organized in language. For the study of the sound patterns and systems of languages, use \"phonology.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054263","kind":"field","label":"phonology","sources":[{"id":"getty-aat.300054263","title":"Getty Art & Architecture Thesaurus record 300054263","url":"http://vocab.getty.edu/page/aat/300054263"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054264","kind":"field","label":"pragmatics","sources":[{"id":"getty-aat.300054264","title":"Getty Art & Architecture Thesaurus record 300054264","url":"http://vocab.getty.edu/page/aat/300054264"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300054268","kind":"field","label":"semantics","sources":[{"id":"getty-aat.300054268","title":"Getty Art & Architecture Thesaurus record 300054268","url":"http://vocab.getty.edu/page/aat/300054268"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines semantics as: Study of meanings in language and of changes in those meanings.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054272","kind":"concept","label":"toponymy","sources":[{"id":"getty-aat.300054272","title":"Getty Art & Architecture Thesaurus record 300054272","url":"http://vocab.getty.edu/page/aat/300054272"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines toponymy as: Etymological study of the place-names of a region or language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404706","kind":"concept","label":"parinirvāṇa","sources":[{"id":"getty-aat.300404706","title":"Getty Art & Architecture Thesaurus record 300404706","url":"http://vocab.getty.edu/page/aat/300404706"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines parinirvāṇa as: In Buddhism, the final nirvana or nirvana-after-death, which occurs upon the death of the body or ultimate departure from the conventional realm of a person who is an awakened being, having attained nirvana during his or her lifetime.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106724","kind":"concept","label":"Stone Age","sources":[{"id":"getty-aat.300106724","title":"Getty Art & Architecture Thesaurus record 300106724","url":"http://vocab.getty.edu/page/aat/300106724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Stone Age as: Refers to the period and culture associated with the first age of the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is a stage in the development of hominids or of a prehistoric human culture characterized by the creation and use of stone tools and weapons, as distinguished from later stages of culture when bronze or iron were used for these purposes. The Stone Age is generally divided into three periods, Paleolithic, Mesolithic, and Neolithic, distinguished from each other by the degree of sophistication evident in the fashioning and use of tools.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106747","kind":"concept","label":"transitional periods Stone Age to Bronze Age","sources":[{"id":"getty-aat.300106747","title":"Getty Art & Architecture Thesaurus record 300106747","url":"http://vocab.getty.edu/page/aat/300106747"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines transitional periods Stone Age to Bronze Age as: Transitional periods related to Stone Age to Bronze Age cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019275","kind":"concept","label":"Bronze Age","sources":[{"id":"getty-aat.300019275","title":"Getty Art & Architecture Thesaurus record 300019275","url":"http://vocab.getty.edu/page/aat/300019275"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019279","kind":"concept","label":"Iron Age","sources":[{"id":"getty-aat.300019279","title":"Getty Art & Architecture Thesaurus record 300019279","url":"http://vocab.getty.edu/page/aat/300019279"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Iron Age as: Refers to the period and culture associated with the third age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. Iron Age culture typically developed from the Bronze Age at the point when the qualities of iron were exploited, particularly through carburization, in the manufacture of tools, weapons, and implements. It developed at different times in various parts of the world, first appearing in the Middle East and southeastern Europe around 1,200 BCE, and in China around 600 BCE. In the Americas, it did not develop from the Bronze Age but was introduced to Stone Age cultures by European explorers.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015649","kind":"concept","label":"prehistoric African","sources":[{"id":"getty-aat.300015649","title":"Getty Art & Architecture Thesaurus record 300015649","url":"http://vocab.getty.edu/page/aat/300015649"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric African as: Cultures and styles from the prehistoric era in Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015690","kind":"concept","label":"Ancient African","sources":[{"id":"getty-aat.300015690","title":"Getty Art & Architecture Thesaurus record 300015690","url":"http://vocab.getty.edu/page/aat/300015690"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient African as: Cultures and styles of Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300108565","kind":"concept","label":"Colonial African","sources":[{"id":"getty-aat.300108565","title":"Getty Art & Architecture Thesaurus record 300108565","url":"http://vocab.getty.edu/page/aat/300108565"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Colonial African as: Styles and cultures belonging to Africa under colonial, usually European, rule or influence.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262588","kind":"concept","label":"modern African","sources":[{"id":"getty-aat.300262588","title":"Getty Art & Architecture Thesaurus record 300262588","url":"http://vocab.getty.edu/page/aat/300262588"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern African as: Styles and cultures belonging to modern Africa, generally from the 19th century and later.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300108572","kind":"concept","label":"African sculpture styles","sources":[{"id":"getty-aat.300108572","title":"Getty Art & Architecture Thesaurus record 300108572","url":"http://vocab.getty.edu/page/aat/300108572"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African sculpture styles as: Sculpture styles belonging to African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417674","kind":"concept","label":"African diaspora","sources":[{"id":"getty-aat.300417674","title":"Getty Art & Architecture Thesaurus record 300417674","url":"http://vocab.getty.edu/page/aat/300417674"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African diaspora as: Culture of the body of people who were displaced from their African homeland, and their descendants. Examples include those who traveled in ancient migrations and those who were involuntarily transported due to enslavement.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391434","kind":"concept","label":"Ancient Asian","sources":[{"id":"getty-aat.300391434","title":"Getty Art & Architecture Thesaurus record 300391434","url":"http://vocab.getty.edu/page/aat/300391434"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Asian as: Cultures and styles of any nations or peoples of Asia in ancient times; the time frame generally includes centuries BCE, sometimes including periods up to around 1000 CE.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300120146","kind":"concept","label":"Southeast Asian","sources":[{"id":"getty-aat.300120146","title":"Getty Art & Architecture Thesaurus record 300120146","url":"http://vocab.getty.edu/page/aat/300120146"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Southeast Asian as: Refers to the cultures of the region of Asia situated east of the Indian subcontinent and south of China, encompassing the long-historied and ethnically diverse cultures of a continental mainland and a series of archipelagoes 700 miles to the east and south of the continent. In general, the arts in the region predominantly reflect religion, particularly the personality and character of Buddha and the Hindu gods, and history, particularly glorified heroes of national and mythic pasts. The Buddha image remains the central motif in sculptural and painting styles, while other minor or native figures from Buddhist, Islamic, and Hindu scriptures are sometimes reflected in mural works. Art in the region features tribal geometric and spiral patterns, Indian floral designs, and animal imagery based on local mythologies. A general penchant for themes of fantasy, human and divine beauty, and celebratory sensuality pervades the art of this region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300193867","kind":"concept","label":"West Asian","sources":[{"id":"getty-aat.300193867","title":"Getty Art & Architecture Thesaurus record 300193867","url":"http://vocab.getty.edu/page/aat/300193867"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines West Asian as: Styles and cultures located in the highlands of Anatolia, the Caucasus, and the Armenian and Iranian highlands. Distinguished from the Middle East, which is sometimes known as \"Western Asia.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300379854","kind":"concept","label":"Ancient European","sources":[{"id":"getty-aat.300379854","title":"Getty Art & Architecture Thesaurus record 300379854","url":"http://vocab.getty.edu/page/aat/300379854"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient European as: Styles, periods, and cultures of ancient Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387753","kind":"concept","label":"Early Netherlandish","sources":[{"id":"getty-aat.300387753","title":"Getty Art & Architecture Thesaurus record 300387753","url":"http://vocab.getty.edu/page/aat/300387753"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Netherlandish as: The culture and the styles of art produced in the Southern Netherlands during the 15th and early 16th centuries.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300111149","kind":"concept","label":"European regions","sources":[{"id":"getty-aat.300111149","title":"Getty Art & Architecture Thesaurus record 300111149","url":"http://vocab.getty.edu/page/aat/300111149"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines European regions as: Used to describe styles of the regions of Europe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386130","kind":"concept","label":"Hellenic","sources":[{"id":"getty-aat.300386130","title":"Getty Art & Architecture Thesaurus record 300386130","url":"http://vocab.getty.edu/page/aat/300386130"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hellenic as: The style or culture of the ancient Hellenes, including the Iron Age Greek culture to the death of Alexander the Great in 323 BCE, in Greece and all its colonies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300395490","kind":"concept","label":"Holy Roman Imperial","sources":[{"id":"getty-aat.300395490","title":"Getty Art & Architecture Thesaurus record 300395490","url":"http://vocab.getty.edu/page/aat/300395490"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Holy Roman Imperial as: The culture or period of the Holy Roman Empire, a multi-ethnic complex of territories in central Europe during the medieval and early modern periods until its dissolution in 1806.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403938","kind":"concept","label":"Hutsul","sources":[{"id":"getty-aat.300403938","title":"Getty Art & Architecture Thesaurus record 300403938","url":"http://vocab.getty.edu/page/aat/300403938"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hutsul as: Culture and ethnicity of the Hutsul people of the Carpathian mountains, primarily in the Ukraine and Romania.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444302","kind":"concept","label":"Dutch Colonial Revival","sources":[{"id":"getty-aat.300444302","title":"Getty Art & Architecture Thesaurus record 300444302","url":"http://vocab.getty.edu/page/aat/300444302"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dutch Colonial Revival as: Architectural styles inspired by Dutch architecture, primarily in North America, Europe, and areas of Dutch colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444313","kind":"concept","label":"Late Modernism","sources":[{"id":"getty-aat.300444313","title":"Getty Art & Architecture Thesaurus record 300444313","url":"http://vocab.getty.edu/page/aat/300444313"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Modernism as: General term for the recent art made between the aftermath of World War II and the early years of the 21st century.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266399","kind":"concept","label":"Neo-Symbolist","sources":[{"id":"getty-aat.300266399","title":"Getty Art & Architecture Thesaurus record 300266399","url":"http://vocab.getty.edu/page/aat/300266399"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neo-Symbolist as: Style that refers back to the original Symbolist movement, characterized by a complex synthesis of psychology, mystical and occult practices, and linguistics used to challenge traditional relationships between representation and meaning.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266490","kind":"concept","label":"hip-hop","sources":[{"id":"getty-aat.300266490","title":"Getty Art & Architecture Thesaurus record 300266490","url":"http://vocab.getty.edu/page/aat/300266490"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines hip-hop as: Cultural movement encompassing DJing, rap and rap music, dance and dance music, graffiti writing, and styles of dress. The movement began in the 1970s, in the South Bronx section of New York City, a depressed, predominantly African American neighborhood. The popularity of rap music in particular throughout the 1980s to the present, helped turn hip-hop into an international movement.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300065758","kind":"concept","label":"Minimal","sources":[{"id":"getty-aat.300065758","title":"Getty Art & Architecture Thesaurus record 300065758","url":"http://vocab.getty.edu/page/aat/300065758"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Minimal as: A style developed in the mid 20th century, characterized by simplicity and lack of decoration to the point of starkness. The movement advocated reducing art to the state of non-art by removing nature and culture, resulting in artwork in pure, simple forms and objects placed randomly. The term can be extended to all art, including literature, design, music, visual art, and performance. With specific reference to the visual arts, the term is used to describe an abstract art movement and style, predominantly of sculpture, that flourished in the mid- and late 1960s. With specific reference to music, it refers to a style that emerged in the United States in the 1960s featuring prolonged repetition of short passages and unvarying harmonies.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300022208","kind":"concept","label":"Postmodern","sources":[{"id":"getty-aat.300022208","title":"Getty Art & Architecture Thesaurus record 300022208","url":"http://vocab.getty.edu/page/aat/300022208"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Postmodern as: Refers to the style and period of art and architecture that developed in the 1960s and after, when there was a clear challenge to the dominance of Modernism. Generally speaking, it advocated a pluralistic approach to the arts and it stated that Modernism had failed because of a lack of a coded language of meaning to the viewer. The term was first used by Spanish poet Federico de Onis in 1934 and later by Arnold Toynbee's \"A Study of History\" in 1938, but it was in the 1970s when it came into wide use in connection with a trend in architecture that employed selective Eclecticism and Historicism. This resulted in structures that displayed a knowledge of Modernism, but also playful, whimsical, applications of Classical elements. In the other arts, such as painting, there was a return to a classical approach to the human figure, style, and composition, often resulting in Old Masters style works, but with updated imagery, such as the inclusion of current celebrities, or artists from the past. In photography, as well as painting, a narrative or story telling approach to work also became popular. By the early 1980s, many work dubbed Postmodern, were purchased by the corporate art market, where large sums were paid for the work of relatively new artists. By the 1990s, Postmodernism showed signs of slowing down in terms of popularity, when more traditional Modernist forms began to re-emerge.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266744","kind":"concept","label":"space age","sources":[{"id":"getty-aat.300266744","title":"Getty Art & Architecture Thesaurus record 300266744","url":"http://vocab.getty.edu/page/aat/300266744"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines space age as: Refers to the period from the mid-1950s through the early 1970s when rocketry was first used to launch satellites and manned missions to extraterrestrial space. Generally applied to works that were inspired by new techniques, materials, and designs developed for space flight; or the images, experiences, or psychological states recorded by astronauts during space missions. The term has been applied to works of art, design, music, and architecture characteristic of this period.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444321","kind":"concept","label":"Post-1945","sources":[{"id":"getty-aat.300444321","title":"Getty Art & Architecture Thesaurus record 300444321","url":"http://vocab.getty.edu/page/aat/300444321"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Post-1945 as: General term for styles and periods from post-1945.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264429","kind":"concept","label":"pre-Islamic","sources":[{"id":"getty-aat.300264429","title":"Getty Art & Architecture Thesaurus record 300264429","url":"http://vocab.getty.edu/page/aat/300264429"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines pre-Islamic as: Very generally the term covers from late prehistory to the time when Islam became the dominant religion and way of life in those areas of the world where, at various times after the early seventh century CE, a majority of the population or a preponderance of the ruling classes converted to Islam. It covers a wide and varied range of cultures, artistic traditions, and time periods, varying with the different times when Islam came to different regions and influenced and was influenced by different traditions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300111241","kind":"concept","label":"Saracenic","sources":[{"id":"getty-aat.300111241","title":"Getty Art & Architecture Thesaurus record 300111241","url":"http://vocab.getty.edu/page/aat/300111241"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Saracenic as: Historical term used by medieval Christian Europeans for the culture and style of Arab Muslims, and eventually all Muslims across the Middle East, North Africa, and Europe. Rather than referencing a specific ethnic group, the term was a sweeping religious and geopolitical label used throughout the Middle Ages, most notably during the Crusades. The meaning of the term has then shifted dramatically across different historical eras. For the style and culture of Muslim lands use \"Islamic (style and culture).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300444994","kind":"concept","label":"Kingdom of Jerusalem","sources":[{"id":"getty-aat.300444994","title":"Getty Art & Architecture Thesaurus record 300444994","url":"http://vocab.getty.edu/page/aat/300444994"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kingdom of Jerusalem as: Culture of the Crusader state established in the Southern Levant by Godfrey of Bouillon in 1099 after the First Crusade.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021861","kind":"concept","label":"Australian","sources":[{"id":"getty-aat.300021861","title":"Getty Art & Architecture Thesaurus record 300021861","url":"http://vocab.getty.edu/page/aat/300021861"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Australian as: Describes the culture and style of Aboriginal Australians and current inhabitants of Australia, such as rock art, sculpture in wood, clay and sand, body decoration and bark painting, created both before and after European colonization.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021867","kind":"concept","label":"Melanesian","sources":[{"id":"getty-aat.300021867","title":"Getty Art & Architecture Thesaurus record 300021867","url":"http://vocab.getty.edu/page/aat/300021867"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Melanesian as: Describes the culture and style of the inhabitants of the Melanesian Islands. Melanesians are well known for creating sculptures utilizing a vast range of media, their traditional communal architecture, and body arts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300021944","kind":"concept","label":"Polynesian","sources":[{"id":"getty-aat.300021944","title":"Getty Art & Architecture Thesaurus record 300021944","url":"http://vocab.getty.edu/page/aat/300021944"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Polynesian as: Nationality, culture, and styles of the Polynesian Islands. Art forms include traditional wood-carving, barkcloth, mat-making, tattoo, and other body arts. Polynesian art was greatly developed, but little of what existed has survived to the modern day due to the perishability of the utilized material - bark cloth, basketry, and featherwork. Although architecture was developed everywhere in Polynesia, only the ruined stone structures of the eastern Polynesian islands remain proof of the Polynesians' exceptional architectural skill.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264773","kind":"concept","label":"Oceanic sculpture styles","sources":[{"id":"getty-aat.300264773","title":"Getty Art & Architecture Thesaurus record 300264773","url":"http://vocab.getty.edu/page/aat/300264773"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic sculpture styles as: Sculpture styles belonging to Oceanic cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264775","kind":"concept","label":"Oceanic ceramic styles","sources":[{"id":"getty-aat.300264775","title":"Getty Art & Architecture Thesaurus record 300264775","url":"http://vocab.getty.edu/page/aat/300264775"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Oceanic ceramic styles as: Ceramic styles belonging to Oceanic cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300438813","kind":"concept","label":"Australasian","sources":[{"id":"getty-aat.300438813","title":"Getty Art & Architecture Thesaurus record 300438813","url":"http://vocab.getty.edu/page/aat/300438813"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Australasian as: The culture and peoples occupying the section of Oceania south of the equator and north of latitude 47.00 S.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386138","kind":"concept","label":"Hispanic","sources":[{"id":"getty-aat.300386138","title":"Getty Art & Architecture Thesaurus record 300386138","url":"http://vocab.getty.edu/page/aat/300386138"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hispanic as: Styles and cultures that developed in Spain and elsewhere under Spanish influence, especially those that developed under the influence of colonists from Spain and their descendants in the Americas.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300107946","kind":"concept","label":"American regions","sources":[{"id":"getty-aat.300107946","title":"Getty Art & Architecture Thesaurus record 300107946","url":"http://vocab.getty.edu/page/aat/300107946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines American regions as: Used to describe styles of the regions of the Americas, including styles found in North, Central, and South America, as well as the Caribbean.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300017437","kind":"concept","label":"Native American","sources":[{"id":"getty-aat.300017437","title":"Getty Art & Architecture Thesaurus record 300017437","url":"http://vocab.getty.edu/page/aat/300017437"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Native American as: Whenever possible, use the specific tribal name. The collective term \"Native American\" is currently widely used in the United States for indigenous peoples. However, many groups increasingly prefer \"American Indian\" or \"Indigenous American.\" For the indigenous peoples of Canada use the term \"Indigenous peoples\" which refers to the First Nations, Inuit, and Métis. For the broader concept of the cultures of any native peoples of Central America, South America, North America, or the West Indies, use \"Indigenous people (culture).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300080819","kind":"concept","label":"Latin American","sources":[{"id":"getty-aat.300080819","title":"Getty Art & Architecture Thesaurus record 300080819","url":"http://vocab.getty.edu/page/aat/300080819"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Latin American as: In the strictest sense, refers to the cultures of the countries of South America, North America, Central America, and the Caribbean that were originally colonized by Spain. It may also refer more broadly to all the cultures of this region, including those that were originally colonized by the French or Portuguese.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018115","kind":"concept","label":"modern American","sources":[{"id":"getty-aat.300018115","title":"Getty Art & Architecture Thesaurus record 300018115","url":"http://vocab.getty.edu/page/aat/300018115"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern American as: Styles, periods, cultures, and movements of America in modern times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387114","kind":"concept","label":"Ancient American","sources":[{"id":"getty-aat.300387114","title":"Getty Art & Architecture Thesaurus record 300387114","url":"http://vocab.getty.edu/page/aat/300387114"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient American as: General term for the styles and cultures of the Paleo-Indians of the Americas; also may refer generally to any of the cultures of Americas prior to the arrival of European colonists.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457738","kind":"concept","label":"Hispanic-American","sources":[{"id":"getty-aat.300457738","title":"Getty Art & Architecture Thesaurus record 300457738","url":"http://vocab.getty.edu/page/aat/300457738"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hispanic-American as: Refers to the cultures and styles of the countries and communities in South America, North America, Central America, and the Caribbean where Spanish is the official language. In the United States the term Hispanic American also refers to the culture of people from the United States with Latin American or Spanish heritage.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457715","kind":"concept","label":"Pan-American","sources":[{"id":"getty-aat.300457715","title":"Getty Art & Architecture Thesaurus record 300457715","url":"http://vocab.getty.edu/page/aat/300457715"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pan-American as: Pan-American broadly refers to the culture of North, Central, and South America. Rooted in the history of U.S.-Latin American relations, it also specifically refers to expressions developed during the first half of the 20th century. The term refers either to the art, architecture and political- economic agreements associated with a U.S. leadership and its hegemonic interests in Latin America and to the Latin American art expressions and movements of anti-imperialism that rejected unilateral agreements with the U.S. during this period.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300457703","kind":"concept","label":"Ibero-American","sources":[{"id":"getty-aat.300457703","title":"Getty Art & Architecture Thesaurus record 300457703","url":"http://vocab.getty.edu/page/aat/300457703"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ibero-American as: It refers to the culture and expressions of Spanish and Portuguese-speaking nations across The Americas, distinguishing them from French and English speaking countries. The term is sometimes used to describe a broader community that includes the European nations of Spain and Portugal, emphasizing their shared Iberian heritage and linguistic connections betwing countries that were once part of the Spanish or Portuguese empires.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"field.aat.300265672","kind":"field","label":"architectonics","sources":[{"id":"getty-aat.300265672","title":"Getty Art & Architecture Thesaurus record 300265672","url":"http://vocab.getty.edu/page/aat/300265672"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architectonics as: The study of the scientific or technical aspects of architecture as distinguished from the purely artistic or historical aspect.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054159","kind":"concept","label":"naval architecture","sources":[{"id":"getty-aat.300054159","title":"Getty Art & Architecture Thesaurus record 300054159","url":"http://vocab.getty.edu/page/aat/300054159"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines naval architecture as: Art or science of designing and building ships and other waterborne craft.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300189645","kind":"concept","label":"urban design","sources":[{"id":"getty-aat.300189645","title":"Getty Art & Architecture Thesaurus record 300189645","url":"http://vocab.getty.edu/page/aat/300189645"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines urban design as: The field of study and practice of designing the specific appearance, integration, and function of cities, towns, and villages. It is an interdisciplinary field that works with many built environment professions, including urban planning, architecture, landscape architecture, and civil engineering. For the field concerned with long-term planning for additions and improvements to the spatial organization and content of urban areas, use “urban planning.”","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300447138","kind":"concept","label":"vāstuvidyā","sources":[{"id":"getty-aat.300447138","title":"Getty Art & Architecture Thesaurus record 300447138","url":"http://vocab.getty.edu/page/aat/300447138"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines vāstuvidyā as: In Indian architecture, a science of building, architecture.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054269","kind":"concept","label":"syntax","sources":[{"id":"getty-aat.300054269","title":"Getty Art & Architecture Thesaurus record 300054269","url":"http://vocab.getty.edu/page/aat/300054269"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines syntax as: That branch of grammar that studies the formation of sentences, the relationships among their component words, clauses, and phrases, and the rules governing word order in a given language.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391505","kind":"concept","label":"Neozoic","sources":[{"id":"getty-aat.300391505","title":"Getty Art & Architecture Thesaurus record 300391505","url":"http://vocab.getty.edu/page/aat/300391505"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neozoic as: An era following the Palaeozoic era, comprising both the Mesozoic and Cenozoic (Cainozoic) eras.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300391475","kind":"concept","label":"Archean","sources":[{"id":"getty-aat.300391475","title":"Getty Art & Architecture Thesaurus record 300391475","url":"http://vocab.getty.edu/page/aat/300391475"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Archean as: On the geologic time scale, the period preceding the Proterozoic Eon, spanning about 1.5 billion years, in which the Earth's atmosphere was probably of methane, ammonia, and other gases, and the surface cooled enough that rocks and continental plates began to form.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300403945","kind":"concept","label":"Eolithic","sources":[{"id":"getty-aat.300403945","title":"Getty Art & Architecture Thesaurus record 300403945","url":"http://vocab.getty.edu/page/aat/300403945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eolithic as: The culture and period dating from the beginning of the Stone Age, preceding the Paleolithic and characterized by the earliest crude stone tools.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019258","kind":"concept","label":"Paleolithic","sources":[{"id":"getty-aat.300019258","title":"Getty Art & Architecture Thesaurus record 300019258","url":"http://vocab.getty.edu/page/aat/300019258"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Paleolithic as: Refers to the period and culture associated with the first use of chipped stone tools in a given area. The time frame of this period may differ greatly in different parts of the world, but is first evident in hominids by 2,500,000 Before Present. The earliest surviving artistic output by a culture usually dates from the Paleolithic period, and may include small carved stone and bone figures, as well as large-scale paintings and incised designs in caves. Paleolithic artistic output in western art is evident from roughly 30,000 BCE to 10,000 BCE.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019264","kind":"concept","label":"Mesolithic","sources":[{"id":"getty-aat.300019264","title":"Getty Art & Architecture Thesaurus record 300019264","url":"http://vocab.getty.edu/page/aat/300019264"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mesolithic as: Usually refers specifically to a period of cultural development in Europe that began as early as 10,000 BCE, after the end of the Pleistocene Epoch when glaciation began to retreat, and lasted until about 2,700 BCE. The term is also sometimes used generally for a period associated with the transitional phase between Paleolithic and Neolithic cultures in any given area. Mesolithic culture overlaps with Paleolithic and Neolithic cultures, and is characterized by great environmental and cultural change and diverse local adaptations to special environments. The period is typically marked by the production of microliths that were mounted on shafts, bone, antler, wooden tools, and an occasional polished stone tool. Surviving artistic output includes carvings and cave paintings with relatively sophisticated depictions of human and animal forms.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019267","kind":"concept","label":"Neolithic","sources":[{"id":"getty-aat.300019267","title":"Getty Art & Architecture Thesaurus record 300019267","url":"http://vocab.getty.edu/page/aat/300019267"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Neolithic as: Refers to the final stage of Stone Age development of a human culture, characterized by sophisticated stone tools created by polishing or grinding, wide-spread domestication of animals and plants, settlement in permanent villages, and the appearance of pottery and weaving. Neolithic cultures first appeared during the Holocene Epoch, around 9,000 BCE, and survived in certain remote areas of the world into the 19th century. Artistic products include wooden and stone houses, religious monuments, fortifications, carvings, paintings, textiles, and pottery.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019273","kind":"concept","label":"Chalcolithic","sources":[{"id":"getty-aat.300019273","title":"Getty Art & Architecture Thesaurus record 300019273","url":"http://vocab.getty.edu/page/aat/300019273"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Chalcolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. It is characterized by the hammering, melting, and casting of copper for ornaments and tools, and is distinguished from Bronze Age technologies in that the copper was typically not or only seldomly combined with tin or other metal in an alloy, and stone tools were used at the same time as metal ones. Chalcolithic cultures developed at different times in different parts of the world, ranging from early sporadic use of copper around 7,000 BCE in the Near East to established use by around 1,900 BCE in Britain.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106757","kind":"concept","label":"Eneolithic","sources":[{"id":"getty-aat.300106757","title":"Getty Art & Architecture Thesaurus record 300106757","url":"http://vocab.getty.edu/page/aat/300106757"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eneolithic as: Refers to the period and culture associated with the transitional phase between the Stone Age and the Bronze Age. Some scholars distinguish this period from the Chalcolithic by classifying Eneolithic as late Neolithic, when copper and flint implements were used at the same time, while Chalcolithic would be the transitional phase when bronze and stone were used at the same time. Most literature does not make the distinction, and uses the term \"Chalcolithic\" to cover this entire phase. An exception is among Italian scholars, who tend to use the term \"Eneolithic\" instead.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106759","kind":"concept","label":"Final Neolithic","sources":[{"id":"getty-aat.300106759","title":"Getty Art & Architecture Thesaurus record 300106759","url":"http://vocab.getty.edu/page/aat/300106759"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Final Neolithic as: Refers to the last stage of a Neolithic culture, which often partially overlaps with the Early Bronze Age. It is generally held to have occurred from around 4,000 BCE to around 3,000 BCE in Europe, lasting until around 2,000 BCE in parts of the British Isles.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019276","kind":"concept","label":"Early Bronze Age","sources":[{"id":"getty-aat.300019276","title":"Getty Art & Architecture Thesaurus record 300019276","url":"http://vocab.getty.edu/page/aat/300019276"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Bronze Age as: Refers to the earliest phase of Bronze Age cultures, which developed differently in different regions, either from Chalcolithic or Neolithic technologies. It differs from the Middle and Late Bronze Age cultures primarily in metal assemblages and burial rites. It is characterized in part by the earliest experimentation with copper alloys to produce bronze, as well as the improvement of stone tools, and various other local cultural developments. Some scholars classify the Chalcolithic as the earliest phase of the Bronze Age.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019277","kind":"concept","label":"Middle Bronze Age","sources":[{"id":"getty-aat.300019277","title":"Getty Art & Architecture Thesaurus record 300019277","url":"http://vocab.getty.edu/page/aat/300019277"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Bronze Age as: Refers to a phase of the Bronze Age distinguished from the Early and Late Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by metalworking techniques and tool and weapon designs of increasing sophistication, including the utilization of valve molds, cire perdue, sheet work, structural ribs, rivets, and pommels on the end of the hilts of swords.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019278","kind":"concept","label":"Late Bronze Age","sources":[{"id":"getty-aat.300019278","title":"Getty Art & Architecture Thesaurus record 300019278","url":"http://vocab.getty.edu/page/aat/300019278"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106738","kind":"concept","label":"Early Iron Age","sources":[{"id":"getty-aat.300106738","title":"Getty Art & Architecture Thesaurus record 300106738","url":"http://vocab.getty.edu/page/aat/300106738"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Early Iron Age as: Refers to the earliest phase of the Iron Age, when the distinct functional properties of iron were first exploited, including the use of forging, and it began to supplant bronze in the production of tools and weapons.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106739","kind":"concept","label":"Middle Iron Age","sources":[{"id":"getty-aat.300106739","title":"Getty Art & Architecture Thesaurus record 300106739","url":"http://vocab.getty.edu/page/aat/300106739"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Middle Iron Age as: Refers to a phase of Iron Age culture marked by technological and social developments, including carburized iron or steel.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300106745","kind":"concept","label":"Late Iron Age","sources":[{"id":"getty-aat.300106745","title":"Getty Art & Architecture Thesaurus record 300106745","url":"http://vocab.getty.edu/page/aat/300106745"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Late Iron Age as: Refers to a phase of Iron Age culture noted for particular technological and social developments, including the tempering of iron implements.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300312134","kind":"concept","label":"Abyssinian","sources":[{"id":"getty-aat.300312134","title":"Getty Art & Architecture Thesaurus record 300312134","url":"http://vocab.getty.edu/page/aat/300312134"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Abyssinian as: Style and culture of the historical group that dwelled in the Horn of Africa from the 11th century, comprising mostly Christian, Semitic-speaking peoples in a territory including Eritrea, Tigray, Gonder, and parts of Gojam, Shewa, and Welo in the territory of the modern nation of Ethiopia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262699","kind":"concept","label":"Algerian","sources":[{"id":"getty-aat.300262699","title":"Getty Art & Architecture Thesaurus record 300262699","url":"http://vocab.getty.edu/page/aat/300262699"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Algerian as: Style and culture of the people of Algeria or Algiers, in northern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262700","kind":"concept","label":"Angolan","sources":[{"id":"getty-aat.300262700","title":"Getty Art & Architecture Thesaurus record 300262700","url":"http://vocab.getty.edu/page/aat/300262700"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Angolan as: Style and culture of the people of Angola, a republic (formerly a Portuguese colony) in southwestern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262993","kind":"concept","label":"Beninese","sources":[{"id":"getty-aat.300262993","title":"Getty Art & Architecture Thesaurus record 300262993","url":"http://vocab.getty.edu/page/aat/300262993"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Beninese as: Style and culture of the people of Bénin, particularly of the modern inhabitants. For the style and culture of the more ancient people of southern Nigeria, use \"Benin.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262702","kind":"concept","label":"Burkina Faso","sources":[{"id":"getty-aat.300262702","title":"Getty Art & Architecture Thesaurus record 300262702","url":"http://vocab.getty.edu/page/aat/300262702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burkina Faso as: Style and culture of the people of Burkina Faso.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262703","kind":"concept","label":"Burundi","sources":[{"id":"getty-aat.300262703","title":"Getty Art & Architecture Thesaurus record 300262703","url":"http://vocab.getty.edu/page/aat/300262703"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burundi as: Style and culture of the people of Burundi.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262992","kind":"concept","label":"Cameroonian","sources":[{"id":"getty-aat.300262992","title":"Getty Art & Architecture Thesaurus record 300262992","url":"http://vocab.getty.edu/page/aat/300262992"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cameroonian as: Style and culture of the nation of Cameroon, lying at the junction of western and central Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262701","kind":"concept","label":"Cape Verdean","sources":[{"id":"getty-aat.300262701","title":"Getty Art & Architecture Thesaurus record 300262701","url":"http://vocab.getty.edu/page/aat/300262701"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cape Verdean as: Style and culture of the people of Cape Verde.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262708","kind":"concept","label":"Chadian","sources":[{"id":"getty-aat.300262708","title":"Getty Art & Architecture Thesaurus record 300262708","url":"http://vocab.getty.edu/page/aat/300262708"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Chadian as: Style or culture of the nation of Chad.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262638","kind":"concept","label":"Djiboutian","sources":[{"id":"getty-aat.300262638","title":"Getty Art & Architecture Thesaurus record 300262638","url":"http://vocab.getty.edu/page/aat/300262638"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Djiboutian as: Style and culture of the nation of Dijbouti.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262644","kind":"concept","label":"Equatorial Guinean","sources":[{"id":"getty-aat.300262644","title":"Getty Art & Architecture Thesaurus record 300262644","url":"http://vocab.getty.edu/page/aat/300262644"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Equatorial Guinean as: Style and culture of the people of Equatorial Guinea.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262645","kind":"concept","label":"Eritrean","sources":[{"id":"getty-aat.300262645","title":"Getty Art & Architecture Thesaurus record 300262645","url":"http://vocab.getty.edu/page/aat/300262645"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eritrean as: Style and culture of the people of the modern nation of Eritrea, or to the ancient civilization that flourished in this region.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262648","kind":"concept","label":"Gabonese","sources":[{"id":"getty-aat.300262648","title":"Getty Art & Architecture Thesaurus record 300262648","url":"http://vocab.getty.edu/page/aat/300262648"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gabonese as: Style and culture of the inhabitants of the nation of Gabon.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262649","kind":"concept","label":"Gambian","sources":[{"id":"getty-aat.300262649","title":"Getty Art & Architecture Thesaurus record 300262649","url":"http://vocab.getty.edu/page/aat/300262649"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Gambian as: Style and culture of inhabitants of the nation of Gambia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262651","kind":"concept","label":"Ghanaian","sources":[{"id":"getty-aat.300262651","title":"Getty Art & Architecture Thesaurus record 300262651","url":"http://vocab.getty.edu/page/aat/300262651"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ghanaian as: Style and culture of the people of the nation of Ghana.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262652","kind":"concept","label":"Guinea-Bissauan","sources":[{"id":"getty-aat.300262652","title":"Getty Art & Architecture Thesaurus record 300262652","url":"http://vocab.getty.edu/page/aat/300262652"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Guinea-Bissauan as: Style and culture of the people from Guinea-Bissau.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262650","kind":"concept","label":"Guinean","sources":[{"id":"getty-aat.300262650","title":"Getty Art & Architecture Thesaurus record 300262650","url":"http://vocab.getty.edu/page/aat/300262650"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Guinean as: Style and culture of people of the modern nation of Guinée (Republic of Guinea) or of the historical people of the broader region of forest and coastal areas of western Africa between the tropic of Cancer and the equator known also as \"Guinea.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262653","kind":"concept","label":"Ivorian","sources":[{"id":"getty-aat.300262653","title":"Getty Art & Architecture Thesaurus record 300262653","url":"http://vocab.getty.edu/page/aat/300262653"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ivorian as: Style and culture of the Ivory Coast.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262654","kind":"concept","label":"Kenyan","sources":[{"id":"getty-aat.300262654","title":"Getty Art & Architecture Thesaurus record 300262654","url":"http://vocab.getty.edu/page/aat/300262654"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kenyan as: Style and culture of Kenya.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262655","kind":"concept","label":"Lesotho","sources":[{"id":"getty-aat.300262655","title":"Getty Art & Architecture Thesaurus record 300262655","url":"http://vocab.getty.edu/page/aat/300262655"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Lesotho as: Style and culture of any of the ethnic groups of Lesotho, particularly the Sotho.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262640","kind":"concept","label":"Libyan","sources":[{"id":"getty-aat.300262640","title":"Getty Art & Architecture Thesaurus record 300262640","url":"http://vocab.getty.edu/page/aat/300262640"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Libyan as: Style and culture of inhabitants of the large ancient country, Libya, in North Africa, or of the modern state of Libya.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262724","kind":"concept","label":"Mahoran","sources":[{"id":"getty-aat.300262724","title":"Getty Art & Architecture Thesaurus record 300262724","url":"http://vocab.getty.edu/page/aat/300262724"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mahoran as: Style and culture of the people of Mayotte, the southeasternmost island of the Comoros archipelago.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262641","kind":"concept","label":"Malawian","sources":[{"id":"getty-aat.300262641","title":"Getty Art & Architecture Thesaurus record 300262641","url":"http://vocab.getty.edu/page/aat/300262641"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Malawian as: Style and culture of people of the nation of Malawi.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300264906","kind":"concept","label":"Malian","sources":[{"id":"getty-aat.300264906","title":"Getty Art & Architecture Thesaurus record 300264906","url":"http://vocab.getty.edu/page/aat/300264906"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Malian as: Style and culture of Mali in West Africa, either the ancient empire of the 13th and 14th centuries or of the modern republic founded in 1960.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300375152","kind":"concept","label":"Maure","sources":[{"id":"getty-aat.300375152","title":"Getty Art & Architecture Thesaurus record 300375152","url":"http://vocab.getty.edu/page/aat/300375152"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Maure as: Style and culture of a people of mixed Arab-Berber descent inhabiting the Western Sahara, neighboring parts of Morocco, Mali, Algeria, and the Islamic Republic of Mauritania. To refer to the products, style and culture of people living within the boundaries of Mauritania proper use \"Mauritanian.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262723","kind":"concept","label":"Mauritian","sources":[{"id":"getty-aat.300262723","title":"Getty Art & Architecture Thesaurus record 300262723","url":"http://vocab.getty.edu/page/aat/300262723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mauritian as: The style and culture of the island of Mauritius in the Indian Ocean.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300245255","kind":"concept","label":"Moroccan","sources":[{"id":"getty-aat.300245255","title":"Getty Art & Architecture Thesaurus record 300245255","url":"http://vocab.getty.edu/page/aat/300245255"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Moroccan as: Style and culture of the nation of Morocco or its historical counterparts.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262725","kind":"concept","label":"Mozambican","sources":[{"id":"getty-aat.300262725","title":"Getty Art & Architecture Thesaurus record 300262725","url":"http://vocab.getty.edu/page/aat/300262725"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Mozambican as: Style and culture of the nation of Mozambique.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262726","kind":"concept","label":"Namibian","sources":[{"id":"getty-aat.300262726","title":"Getty Art & Architecture Thesaurus record 300262726","url":"http://vocab.getty.edu/page/aat/300262726"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Namibian as: Style and culture of the people of the nation of Namibia or of the Namib desert.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386510","kind":"concept","label":"Reunionese","sources":[{"id":"getty-aat.300386510","title":"Getty Art & Architecture Thesaurus record 300386510","url":"http://vocab.getty.edu/page/aat/300386510"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Reunionese as: Nationality, styles, and culture of Réunion, Africa, located in the Indian Ocean, east of Madagascar.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386512","kind":"concept","label":"Rhodesian","sources":[{"id":"getty-aat.300386512","title":"Getty Art & Architecture Thesaurus record 300386512","url":"http://vocab.getty.edu/page/aat/300386512"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rhodesian as: Nationality, culture, or styles of the historical area of Rhodesia, Africa. For the nationality of the modern nation, use \"Zimbabwean.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386517","kind":"concept","label":"Rwandan","sources":[{"id":"getty-aat.300386517","title":"Getty Art & Architecture Thesaurus record 300386517","url":"http://vocab.getty.edu/page/aat/300386517"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rwandan as: Nationality, style, and culture of Rwanda, in central-eastern Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262631","kind":"concept","label":"Rwandese","sources":[{"id":"getty-aat.300262631","title":"Getty Art & Architecture Thesaurus record 300262631","url":"http://vocab.getty.edu/page/aat/300262631"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Rwandese as: The style and culture of the people speaking the Bantu Rwanda language of East Africa, or of any of the inhabitants of the country of Rwanda.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262634","kind":"concept","label":"Sao Tomean","sources":[{"id":"getty-aat.300262634","title":"Getty Art & Architecture Thesaurus record 300262634","url":"http://vocab.getty.edu/page/aat/300262634"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sao Tomean as: Style and culture of the nation of São Tomé and Príncipe.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262583","kind":"concept","label":"Senegalese","sources":[{"id":"getty-aat.300262583","title":"Getty Art & Architecture Thesaurus record 300262583","url":"http://vocab.getty.edu/page/aat/300262583"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Senegalese as: Style and culture of the people of Senegal.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262632","kind":"concept","label":"Seychellois","sources":[{"id":"getty-aat.300262632","title":"Getty Art & Architecture Thesaurus record 300262632","url":"http://vocab.getty.edu/page/aat/300262632"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Seychellois as: Style and culture of the nation of Seychelles, an island republic in the western Indian Ocean, comprising about 115 islands.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262633","kind":"concept","label":"Sierra Leonean","sources":[{"id":"getty-aat.300262633","title":"Getty Art & Architecture Thesaurus record 300262633","url":"http://vocab.getty.edu/page/aat/300262633"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sierra Leonean as: Style and culture of the nation of Sierra Leone.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262705","kind":"concept","label":"Somalian","sources":[{"id":"getty-aat.300262705","title":"Getty Art & Architecture Thesaurus record 300262705","url":"http://vocab.getty.edu/page/aat/300262705"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Somalian as: General national designation of the nation of Somalia, the Somali Democratic Republic.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262706","kind":"concept","label":"South African","sources":[{"id":"getty-aat.300262706","title":"Getty Art & Architecture Thesaurus record 300262706","url":"http://vocab.getty.edu/page/aat/300262706"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262698","kind":"concept","label":"Sudanese","sources":[{"id":"getty-aat.300262698","title":"Getty Art & Architecture Thesaurus record 300262698","url":"http://vocab.getty.edu/page/aat/300262698"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sudanese as: Style and culture of the people of the Sudan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262707","kind":"concept","label":"Tanzanian","sources":[{"id":"getty-aat.300262707","title":"Getty Art & Architecture Thesaurus record 300262707","url":"http://vocab.getty.edu/page/aat/300262707"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tanzanian as: Style and culture of the East African state of Tanzania, formed in 1964 by the union of the republics of Tanganyika and Zanzibar.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262709","kind":"concept","label":"Togolese","sources":[{"id":"getty-aat.300262709","title":"Getty Art & Architecture Thesaurus record 300262709","url":"http://vocab.getty.edu/page/aat/300262709"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Togolese as: Nationality, style, or culture of the West African state of Togo (formerly Togoland).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263699","kind":"concept","label":"Ugandan","sources":[{"id":"getty-aat.300263699","title":"Getty Art & Architecture Thesaurus record 300263699","url":"http://vocab.getty.edu/page/aat/300263699"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ugandan as: The style and culture of the central African State, Uganda.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263700","kind":"concept","label":"Zambian","sources":[{"id":"getty-aat.300263700","title":"Getty Art & Architecture Thesaurus record 300263700","url":"http://vocab.getty.edu/page/aat/300263700"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Zambian as: The style and culture of the south central African country, Zambia (formerly Northern Rhodesia).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263701","kind":"concept","label":"Zimbabwean","sources":[{"id":"getty-aat.300263701","title":"Getty Art & Architecture Thesaurus record 300263701","url":"http://vocab.getty.edu/page/aat/300263701"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Zimbabwean as: The style and culture of Zimbabwe or of Black Rhodesians in the former Rhodesia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015650","kind":"concept","label":"prehistoric North African periods","sources":[{"id":"getty-aat.300015650","title":"Getty Art & Architecture Thesaurus record 300015650","url":"http://vocab.getty.edu/page/aat/300015650"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric North African periods as: Periods related to prehistoric North African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015667","kind":"concept","label":"prehistoric Sub-Saharan African periods","sources":[{"id":"getty-aat.300015667","title":"Getty Art & Architecture Thesaurus record 300015667","url":"http://vocab.getty.edu/page/aat/300015667"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines prehistoric Sub-Saharan African periods as: Periods related to prehistoric Sub-Saharan African cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015759","kind":"concept","label":"Ancient West African","sources":[{"id":"getty-aat.300015759","title":"Getty Art & Architecture Thesaurus record 300015759","url":"http://vocab.getty.edu/page/aat/300015759"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient West African as: Cultures and styles of West Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015692","kind":"concept","label":"Ancient Central African","sources":[{"id":"getty-aat.300015692","title":"Getty Art & Architecture Thesaurus record 300015692","url":"http://vocab.getty.edu/page/aat/300015692"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Central African as: Cultures and styles of Central Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015727","kind":"concept","label":"Ancient Southern African","sources":[{"id":"getty-aat.300015727","title":"Getty Art & Architecture Thesaurus record 300015727","url":"http://vocab.getty.edu/page/aat/300015727"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient Southern African as: Cultures and styles of southern Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015702","kind":"concept","label":"ancient East African","sources":[{"id":"getty-aat.300015702","title":"Getty Art & Architecture Thesaurus record 300015702","url":"http://vocab.getty.edu/page/aat/300015702"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ancient East African as: Cultures and styles of East Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015723","kind":"concept","label":"Ancient North African","sources":[{"id":"getty-aat.300015723","title":"Getty Art & Architecture Thesaurus record 300015723","url":"http://vocab.getty.edu/page/aat/300015723"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Ancient North African as: Styles and cultures of North Africa in ancient times.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300262589","kind":"concept","label":"modern East African","sources":[{"id":"getty-aat.300262589","title":"Getty Art & Architecture Thesaurus record 300262589","url":"http://vocab.getty.edu/page/aat/300262589"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines modern East African as: Styles and culture belonging to modern East Africa.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016538","kind":"concept","label":"Southern African","sources":[{"id":"getty-aat.300016538","title":"Getty Art & Architecture Thesaurus record 300016538","url":"http://vocab.getty.edu/page/aat/300016538"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Southern African as: Styles and cultures originating in the southernmost region of the African continent, comprising the modern countries of Angola, Botswana, Lesotho, Malawi, Mozambique, Namibia, South Africa, Swaziland, Zambia, and Zimbabwe. The island nation of Madagascar is excluded because of its distinct language and cultural heritage.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016434","kind":"concept","label":"Eastern African","sources":[{"id":"getty-aat.300016434","title":"Getty Art & Architecture Thesaurus record 300016434","url":"http://vocab.getty.edu/page/aat/300016434"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Eastern African as: Styles and cultures of the eastern area of Africa, traditionally divided into two parts: East Africa (Kenya, Tanzania, and Uganda) and the Horn of Africa (Somalia, Djibouti, Eritrea, and Ethiopia).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016586","kind":"concept","label":"North African","sources":[{"id":"getty-aat.300016586","title":"Getty Art & Architecture Thesaurus record 300016586","url":"http://vocab.getty.edu/page/aat/300016586"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016598","kind":"concept","label":"Pole Style","sources":[{"id":"getty-aat.300016598","title":"Getty Art & Architecture Thesaurus record 300016598","url":"http://vocab.getty.edu/page/aat/300016598"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pole Style as: Style of African sculpture, typically elongated, severe, and abstract-looking.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300016600","kind":"concept","label":"Round Style","sources":[{"id":"getty-aat.300016600","title":"Getty Art & Architecture Thesaurus record 300016600","url":"http://vocab.getty.edu/page/aat/300016600"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Round Style as: Style of African sculpture, characteristically naturalistic, gentle, and organic, featuring rounded shapes, and giving the impression of flesh over the bone structure.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300387734","kind":"concept","label":"Turkestani","sources":[{"id":"getty-aat.300387734","title":"Getty Art & Architecture Thesaurus record 300387734","url":"http://vocab.getty.edu/page/aat/300387734"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Turkestani as: Culture and styles of historic Turkestan, a region in Central Asia inhabited by Turkic and other peoples.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300244546","kind":"concept","label":"West Turkestani","sources":[{"id":"getty-aat.300244546","title":"Getty Art & Architecture Thesaurus record 300244546","url":"http://vocab.getty.edu/page/aat/300244546"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines West Turkestani as: Refers to the culture and styles of West Turkestan, which covered present-day Turkmenistan, Uzbekistan, Tajikistan, Kyrgyzstan, and the southern part of Kazakhstan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386542","kind":"concept","label":"Taiwanese","sources":[{"id":"getty-aat.300386542","title":"Getty Art & Architecture Thesaurus record 300386542","url":"http://vocab.getty.edu/page/aat/300386542"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Taiwanese as: Nationality, styles, or culture of Taiwan, East Asia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018775","kind":"concept","label":"Afanasievo","sources":[{"id":"getty-aat.300018775","title":"Getty Art & Architecture Thesaurus record 300018775","url":"http://vocab.getty.edu/page/aat/300018775"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Afanasievo as: Refers to the Neolithic culture established in the slopes of the Afanasyevskaya Mountains from the 2nd millennium BCE. Sites have revealed tombs marked with stone circles symbolizing the Sun God, later ones took the form of barrows or large mounds. Pottery in earlier graves consisted of elongated, spherical vessels with herringbone patterns, while later pottery was flat-bottomed.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018803","kind":"concept","label":"Altai","sources":[{"id":"getty-aat.300018803","title":"Getty Art & Architecture Thesaurus record 300018803","url":"http://vocab.getty.edu/page/aat/300018803"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Altai as: Style and culture of the mountain range running along border shared by China and Mongolia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018778","kind":"concept","label":"Andronovo","sources":[{"id":"getty-aat.300018778","title":"Getty Art & Architecture Thesaurus record 300018778","url":"http://vocab.getty.edu/page/aat/300018778"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Andronovo as: Refers to the Neolithic culture established in the steppes of the Minusinsk basin during the 2nd and 1st millennia BCE. Sites have revealed earth houses designed for permanent habitation, with hearths for heating purposes and cooking. Bronze objects were also numerous, and workshops existed for working copper.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018779","kind":"concept","label":"Karasuk","sources":[{"id":"getty-aat.300018779","title":"Getty Art & Architecture Thesaurus record 300018779","url":"http://vocab.getty.edu/page/aat/300018779"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Karasuk as: Refers to the Iron Age culture established in the Minusinsk basin on the Yenisey River from about 1200 BCE to about 70 BCE. Sites have revealed elbow-shaped knifes related to those used between the 14th and 11th centuries BCE in China during the Shang Period. Also notable are pillars with stylized ram heads or human figures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018777","kind":"concept","label":"Okunev","sources":[{"id":"getty-aat.300018777","title":"Getty Art & Architecture Thesaurus record 300018777","url":"http://vocab.getty.edu/page/aat/300018777"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Okunev as: Refers to the Eneolithic culture established in the steppes of the Minusinsk basin by Mongoloid peoples probably of Northern Siberian descent, from the beginning of the 2nd millennium BCE. Tombs have revealed a variety of stone sculptures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300116922","kind":"concept","label":"Siberian Arctic Native styles","sources":[{"id":"getty-aat.300116922","title":"Getty Art & Architecture Thesaurus record 300116922","url":"http://vocab.getty.edu/page/aat/300116922"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Siberian Arctic Native styles as: Styles belonging to Siberian Arctic Native cultures.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300113090","kind":"concept","label":"Tashtyk","sources":[{"id":"getty-aat.300113090","title":"Getty Art & Architecture Thesaurus record 300113090","url":"http://vocab.getty.edu/page/aat/300113090"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tashtyk as: Refers to the Eneolithic culture established in the Minusinsk Basin between the 1st century BCE and the 5th century CE. Notable artifacts from the period include examples of the Scynthian-Siberian Animal style on bronze and gold, and clay funeral masks portraying faces with a two-color decoration.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386953","kind":"concept","label":"Tungus","sources":[{"id":"getty-aat.300386953","title":"Getty Art & Architecture Thesaurus record 300386953","url":"http://vocab.getty.edu/page/aat/300386953"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Tungus as: Culture and style of the indigenous Tungusic people native to the vast subarctic boreal forests (taiga) of Siberia and the Russian Far East, as well as parts of northern China and Mongolia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458960","kind":"concept","label":"Assamese","sources":[{"id":"getty-aat.300458960","title":"Getty Art & Architecture Thesaurus record 300458960","url":"http://vocab.getty.edu/page/aat/300458960"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Assamese as: The Assamese are a major ethnic group of approximately 19.5 million people centered in the Indian state of Assam in northeastern India, speaking Assamese, the easternmost Indo-Aryan language with over 15 million native speakers. Their culture developed largely in isolation along the Brahmaputra River valley, shaped by centuries of interaction with neighboring Tibeto-Burman peoples, Tibetan influences, and the Ahom kingdom established by Tai invaders in 1229. Predominantly Hindu with animist traditions, the Assamese reflect a diverse heritage of Aryan, Ahom, and indigenous influences, and their language has historically served as a regional lingua franca across parts of northeastern India.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300385968","kind":"concept","label":"Bangladeshi","sources":[{"id":"getty-aat.300385968","title":"Getty Art & Architecture Thesaurus record 300385968","url":"http://vocab.getty.edu/page/aat/300385968"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Bangladeshi as: The nationality, style, or culture of Bangladesh, located at the northeast corner of the Indian subcontinent.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300404787","kind":"concept","label":"Indic","sources":[{"id":"getty-aat.300404787","title":"Getty Art & Architecture Thesaurus record 300404787","url":"http://vocab.getty.edu/page/aat/300404787"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indic as: Culture and style of a diverse ethnolinguistic collection of peoples predominantly found in South Asia who speak languages belonging to the Indo-Aryan branch of the Indo-European family. As they settled the fertile Indus and Gangetic plains, their semi-nomadic pastoral lifestyle transitioned into intensive iron-age agriculture. They brought with them horses, spoked-wheel chariots, and a highly structured spiritual tradition.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458962","kind":"concept","label":"Magars","sources":[{"id":"getty-aat.300458962","title":"Getty Art & Architecture Thesaurus record 300458962","url":"http://vocab.getty.edu/page/aat/300458962"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Magars as: The Magars are a Sino-Tibetan/Tibeto-Burman ethnic group native primarily to west-central Nepal, where they represent approximately 6.9% of the national population, with additional communities in northern India, Bhutan, Bangladesh, and diaspora populations worldwide. Their traditional homeland, historically known as Magarat, centered on the Palpa region west of the Gandaki River and was organized into confederations of twelve and eighteen Magar kingdoms during the medieval period. The Magars speak the Magar language (Magar Kura) in two major dialectal groups, practice a blend of Tibetan Buddhism, Hinduism, and shamanistic traditions, and are historically renowned for their service in Gurkha military regiments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300266840","kind":"concept","label":"Pakistani","sources":[{"id":"getty-aat.300266840","title":"Getty Art & Architecture Thesaurus record 300266840","url":"http://vocab.getty.edu/page/aat/300266840"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Pakistani as: Refers to the style and culture of modern Pakistan.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019068","kind":"concept","label":"Sri Lankan","sources":[{"id":"getty-aat.300019068","title":"Getty Art & Architecture Thesaurus record 300019068","url":"http://vocab.getty.edu/page/aat/300019068"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Sri Lankan as: Culture and style of an Indo-Aryan ethnic group native to the island country of Sri Lanka. They possess a 2,500-year written history characterized by grand ancient kingdoms, pioneering hydraulic engineering, and a foundational role in the preservation of Theravada Buddhism.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458945","kind":"concept","label":"Akha","sources":[{"id":"getty-aat.300458945","title":"Getty Art & Architecture Thesaurus record 300458945","url":"http://vocab.getty.edu/page/aat/300458945"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Akha as: The Akha are an ethnic group inhabiting mountainous regions of Laos, Myanmar, Thailand, Vietnam, and China's Yunnan Province, with approximately 80,000 now residing in northern Thailand following migrations that intensified during the 20th century due to civil conflicts. They speak Akha, a Loloish language within the Tibeto-Burman family that is closely related to Lisu. Historical evidence suggests the Akha may have ruled the Baoshan and Tengchong plains in Yunnan prior to the Ming dynasty invasion of 1644.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458946","kind":"concept","label":"Batak","sources":[{"id":"getty-aat.300458946","title":"Getty Art & Architecture Thesaurus record 300458946","url":"http://vocab.getty.edu/page/aat/300458946"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Batak as: The Batak are a collective term for closely related Austronesian ethnic groups predominantly found in North Sumatra and adjacent provinces of Indonesia, who speak related Batak languages and share cultural traditions. The term encompasses six main subgroups—the Toba, Karo, Simalungun, Pakpak-Dairi, Angkola, and Mandailing—as well as other related ethnic groups with distinct languages and traditional customs (adat). With an estimated population of 6 million centered around Lake Toba, the Batak maintain indigenous writing systems (surat Batak) and diverse religious practices including Christianity, Islam, Hinduism, and syncretic traditions such as Malim.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458937","kind":"concept","label":"Brao","sources":[{"id":"getty-aat.300458937","title":"Getty Art & Architecture Thesaurus record 300458937","url":"http://vocab.getty.edu/page/aat/300458937"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Brao as: The Brao are a Mon-Khmer language-speaking ethnic group of approximately 60,000 people divided into multiple subgroups, primarily residing in the southern Lao provinces of Champasak and Attapeu, the northeastern Cambodian provinces of Ratanakiri and Stung Treng, and a single village in Vietnam's Central Highlands. Historically inhabiting upland forested landscapes where they practiced swidden agriculture as their main livelihood, the Brao have experienced significant displacement as many communities in both Laos and Cambodia have been variously manipulated, coerced, or forced to resettle to lowland areas and adopt wet rice cultivation. This resettlement represents a major disruption to traditional Brao land use patterns and subsistence practices that were historically centered on upland forest environments.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019088","kind":"concept","label":"Burmese","sources":[{"id":"getty-aat.300019088","title":"Getty Art & Architecture Thesaurus record 300019088","url":"http://vocab.getty.edu/page/aat/300019088"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Burmese as: Refers generally to the ethnic cultures of the region corresponding to modern Myanmar located in the western region of mainland Southeast Asia. Refers specifically to the style and period of the British colonial occupation from 1885 to 1948. Art in the region reveals bas-relief and monumental stone sculptures of Buddhist iconography and some British colonial influences.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300019104","kind":"concept","label":"Cambodian","sources":[{"id":"getty-aat.300019104","title":"Getty Art & Architecture Thesaurus record 300019104","url":"http://vocab.getty.edu/page/aat/300019104"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Cambodian as: Nationality, culture, or style of Cambodia, located in the southern portion of the Indochina Peninsula in Southeast Asia. Arts and crafts of the region reveal Indian and other regional influences through various sculptures of wood and stone, lapidary pieces comprised of silver, gold, and ivory, and silk sheath pieces in various luxurious hues of red, blue, and gold.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458939","kind":"concept","label":"Dayak","sources":[{"id":"getty-aat.300458939","title":"Getty Art & Architecture Thesaurus record 300458939","url":"http://vocab.getty.edu/page/aat/300458939"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Dayak as: The Dayak are indigenous Austronesian ethnic groups native to Borneo, comprising over 200 distinct riverine and hill-dwelling communities located principally in the central and southern interior of the island, each with its own dialect, customs, laws, territory, and culture. While these diverse groups share common distinguishing cultural traits, they maintain distinct identities and traditions. Historically practicing animist beliefs (Kaharingan and Folk Hinduism), the Dayak have undergone significant religious transformation since the 19th century, with mass conversions to Christianity and Islam.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300240013","kind":"concept","label":"Hmong","sources":[{"id":"getty-aat.300240013","title":"Getty Art & Architecture Thesaurus record 300240013","url":"http://vocab.getty.edu/page/aat/300240013"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Hmong as: Refers to the style and culture of the Hmong people centralized in scattered areas throughout China, Vietnam, Laos, and Thailand. Artistic production in this style features predominantly silver jewelry designs ranging from sliver chain necklaces with lock-shaped pendants attached to neck-rings, large collar necklaces covering the entire chest-area, heavy and narrow bracelets, to circle earrings that surround the ear, widening from narrow ends to a broad center, with pointed pendants hanging from tiny chains. Textile styles feature batik production characterized by geometric patterns on hemp and cotton, appliqué and reverse appliqué in bold colors, cold-dyed indigo, specific symbolic embroidery designs such as mustard blossom, cucumber seed, tiger teeth, and eye of the peacock, elaborate needlework, silk cocoon fibers, and flower and story cloth panel designs depicting village life, shaman's séances, legends and warfare.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300386148","kind":"concept","label":"Indochinese","sources":[{"id":"getty-aat.300386148","title":"Getty Art & Architecture Thesaurus record 300386148","url":"http://vocab.getty.edu/page/aat/300386148"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indochinese as: Nationality and culture of the region between India and China, the areas of the current nations Burma, Kampuchea (Cambodia), Laos, Thailand, Vietnam and Malaysia.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018704","kind":"concept","label":"Indonesian","sources":[{"id":"getty-aat.300018704","title":"Getty Art & Architecture Thesaurus record 300018704","url":"http://vocab.getty.edu/page/aat/300018704"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Indonesian as: Refers to the cultures and styles of Indonesia, reflecting the blend of various regional cultures from the Southeast Asian mainland and Oceania. The style is generally driven by the philosophies of Buddhism, Hinduism, and Islam. Sculptural production in the region generally features megalithic monuments such as menhirs, dolmens, stone sarcophagi, terraced burial mounds, large stones carved into the shape of animals and humans, and stone skull troughs. Early styles of sculpture in the region feature smooth planes, convexity, impassive expressions, and lack of movement. Ornamental works from this region imitate Chinese Chou and pre-Han works and feature bronze drums with molded flanges and relief ornamentation consisting of stylized masks with ear piercings. Indian-influenced works feature intricate bronze Buddhas and bodhisattvas. In architecture, the style features temple complexes known as tjandis and candis.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300458936","kind":"concept","label":"Jarai","sources":[{"id":"getty-aat.300458936","title":"Getty Art & Architecture Thesaurus record 300458936","url":"http://vocab.getty.edu/page/aat/300458936"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Jarai as: The Jarai (or Dega) are an Austronesian indigenous people inhabiting Vietnam's Central Highlands and Cambodia's Ratanakiri Province, with diaspora communities in the United States following their collaboration with US forces during the Vietnam War. Speaking a Malayo-Polynesian language related to Cham and other Pacific Island languages, the approximately 332,558 Jarai constitute the largest Montagnard ethnic group and comprise 23% of Ratanakiri's population. While Cambodian and Vietnamese Jarai communities maintain shared cultural traditions and close interchange, their languages have diverged due to respective Khmer and Vietnamese linguistic influences, with only the Vietnamese Jarai possessing a standardized Latin script writing system.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300410257","kind":"concept","label":"Kachin","sources":[{"id":"getty-aat.300410257","title":"Getty Art & Architecture Thesaurus record 300410257","url":"http://vocab.getty.edu/page/aat/300410257"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Kachin as: Culture of the tribal Tibeto-Burman ethnic group inhabiting parts of northeastern Myanmar (Burma) and contiguous areas of India (Arunachal Pradesh and Nagaland) and China (Yunnan).","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300015647","kind":"concept","label":"African (general, continental cultures)","sources":[{"id":"getty-aat.300015647","title":"Getty Art & Architecture Thesaurus record 300015647","url":"http://vocab.getty.edu/page/aat/300015647"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines African (general, continental cultures) as: Refers to the cultures of the continent of Africa, which is bounded by the Atlantic Ocean, the Indian Ocean, and the Mediterranean Sea.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300018773","kind":"concept","label":"Siberian (culture or style)","sources":[{"id":"getty-aat.300018773","title":"Getty Art & Architecture Thesaurus record 300018773","url":"http://vocab.getty.edu/page/aat/300018773"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Siberian (culture or style) as: Style and culture of Siberia, particularly to that of any of the large number of small ethnic groups living in Siberia. Most engage either in reindeer herding or fishing, while some also hunt furbearing animals or farm and raise horses or cattle.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054156","kind":"concept","label":"architecture (discipline)","sources":[{"id":"getty-aat.300054156","title":"Getty Art & Architecture Thesaurus record 300054156","url":"http://vocab.getty.edu/page/aat/300054156"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines architecture (discipline) as: The art or science of designing and building structures, especially habitable structures, in accordance with principles determined by aesthetic and practical or material considerations. For a general term for the actual structures or parts of structures that were made by human beings, see \"architecture (object genre).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054154","kind":"concept","label":"visual arts (discipline)","sources":[{"id":"getty-aat.300054154","title":"Getty Art & Architecture Thesaurus record 300054154","url":"http://vocab.getty.edu/page/aat/300054154"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines visual arts (discipline) as: Discipline concerning physical objects that are meant to be perceived primarily through the sense of sight, were created by the use of skill and imagination, and possess an aesthetic that is valued and of a quality and type that would be collected by art museums or private collectors.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300175240","kind":"concept","label":"arts (broad discipline)","sources":[{"id":"getty-aat.300175240","title":"Getty Art & Architecture Thesaurus record 300175240","url":"http://vocab.getty.edu/page/aat/300175240"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines arts (broad discipline) as: Refers broadly to the areas of activity that encompass both performing and visual arts. With reference more narrowly to the fine arts or the fine and decorative arts together, see \"art.\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054171","kind":"concept","label":"design (discipline)","sources":[{"id":"getty-aat.300054171","title":"Getty Art & Architecture Thesaurus record 300054171","url":"http://vocab.getty.edu/page/aat/300054171"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines design (discipline) as: Discipline comprising the creation of conceptual schemes for the organization or appearance of graphic works, objects, structures, or systems.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300263250","kind":"concept","label":"grammar (discipline)","sources":[{"id":"getty-aat.300263250","title":"Getty Art & Architecture Thesaurus record 300263250","url":"http://vocab.getty.edu/page/aat/300263250"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines grammar (discipline) as: The study of the rules of a language governing the sounds, words, sentences, and other elements, including their structure, combination, and interpretation.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054300","kind":"concept","label":"religion (discipline)","sources":[{"id":"getty-aat.300054300","title":"Getty Art & Architecture Thesaurus record 300054300","url":"http://vocab.getty.edu/page/aat/300054300"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines religion (discipline) as: Study of religious beliefs and traditions in human life and culture from the perspective of the humanistic disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054299","kind":"concept","label":"<religion and related disciplines>","sources":[{"id":"getty-aat.300054299","title":"Getty Art & Architecture Thesaurus record 300054299","url":"http://vocab.getty.edu/page/aat/300054299"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <religion and related disciplines> as: The discipline of religion and closely related disciplines.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055126","kind":"concept","label":"Associated Concepts","sources":[{"id":"getty-aat.300055126","title":"Getty Art & Architecture Thesaurus record 300055126","url":"http://vocab.getty.edu/page/aat/300055126"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines Associated Concepts as: The Associated Concepts hierarchy contains terms for concepts and phenomena relating to a wide range of topics, including topics not directly related to art, for example philosophical concepts. Relation to other hierarchies: Terms for branches of learning and areas of specialization, as well as professions and professional specialties, (e.g., \"history\") are found in the Disciplines hierarchy, while concepts associated with these disciplines (e.g., \"positivism \") appear here. Terms for styles and for art and architecture movements (e.g., \"Neoclassical,\" \"Impressionist\") are found in the Styles and Periods hierarchy, while forms of expression (e.g., \"abstraction\") and broad categories of art and architecture that are not specific to a given people or period (e.g., \"organic architecture,\" \"street art\") are here.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300137365","kind":"concept","label":"<linguistics and related disciplines>","sources":[{"id":"getty-aat.300137365","title":"Getty Art & Architecture Thesaurus record 300137365","url":"http://vocab.getty.edu/page/aat/300137365"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <linguistics and related disciplines> as: The discipline of linguistics and other disciplines related to it.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055980","kind":"concept","label":"<religions and religious concepts>","sources":[{"id":"getty-aat.300055980","title":"Getty Art & Architecture Thesaurus record 300055980","url":"http://vocab.getty.edu/page/aat/300055980"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines <religions and religious concepts> as: Religions and concepts related to religions.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054146","kind":"concept","label":"music (performing arts genre)","sources":[{"id":"getty-aat.300054146","title":"Getty Art & Architecture Thesaurus record 300054146","url":"http://vocab.getty.edu/page/aat/300054146"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music (performing arts genre) as: Performing arts genre having to do with the combining of vocal or instrumental sounds in measured time to communicate emotions, ideas, or states of mind, usually according to cultural standards of rhythm, melody, and, in most Western music, harmony.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300054140","kind":"concept","label":"performing arts (discipline)","sources":[{"id":"getty-aat.300054140","title":"Getty Art & Architecture Thesaurus record 300054140","url":"http://vocab.getty.edu/page/aat/300054140"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines performing arts (discipline) as: Disciplines concerning arts that depend upon performances presented to the attention of observers through the live or recorded actions of the artists, such as actors, musicians, poets, etc.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417584","kind":"concept","label":"music (discipline)","sources":[{"id":"getty-aat.300417584","title":"Getty Art & Architecture Thesaurus record 300417584","url":"http://vocab.getty.edu/page/aat/300417584"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines music (discipline) as: The discipline of combining vocal or instrumental sounds to produce beauty of form, harmony, melody, rhythm, expressive content, etc.; musical composition, performance, analysis, etc., as a subject of study; the occupation or profession of musicians.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300055939","kind":"concept","label":"ethics (philosophical concept)","sources":[{"id":"getty-aat.300055939","title":"Getty Art & Architecture Thesaurus record 300055939","url":"http://vocab.getty.edu/page/aat/300055939"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines ethics (philosophical concept) as: System of moral principles or rules of conduct for voluntary human action. For the branch of philosophy that studies these principles and rules, with respect to the rightness or wrongness of certain human actions, and the goodness or badness of the motives and ends of such actions, use \"ethics (philosophy).\"","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300417581","kind":"concept","label":"dance (discipline)","sources":[{"id":"getty-aat.300417581","title":"Getty Art & Architecture Thesaurus record 300417581","url":"http://vocab.getty.edu/page/aat/300417581"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines dance (discipline) as: Discipline involving the study of dancing and movement, including performance.","tags":[]},{"aliases":[],"domain":"humanities","era":"undated","frontier":false,"id":"concept.aat.300389795","kind":"concept","label":"photography (discipline)","sources":[{"id":"getty-aat.300389795","title":"Getty Art & Architecture Thesaurus record 300389795","url":"http://vocab.getty.edu/page/aat/300389795"}],"status":"reported","summary":"The Getty Art & Architecture Thesaurus defines photography (discipline) as: The dedicated practice of making photographs as an applied art.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-theory-philosophy","kind":"concept","label":"Action theory (philosophy)","sources":[{"id":"wikipedia.article.action-theory-philosophy","title":"English Wikipedia article: Action theory (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+theory+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Action theory (philosophy)\", CC BY-SA 4.0) states: Action theory or theory of action is an area in philosophy concerned with theories about the processes causing willful human bodily movements of a more or less complex kind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ad-hoc-hypothesis","kind":"concept","label":"Ad hoc hypothesis","sources":[{"id":"wikipedia.article.ad-hoc-hypothesis","title":"English Wikipedia article: Ad hoc hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ad+hoc+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Ad hoc hypothesis\", CC BY-SA 4.0) states: In science and philosophy, an ad hoc hypothesis is a hypothesis added to a theory in order to save it from being falsified.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correspondence-theory-of-truth","kind":"concept","label":"Correspondence theory of truth","sources":[{"id":"wikipedia.article.correspondence-theory-of-truth","title":"English Wikipedia article: Correspondence theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correspondence+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Correspondence theory of truth\", CC BY-SA 4.0) states: In metaphysics and philosophy of language, the correspondence theory of truth states that the truth or falsity of a statement is determined only by how it relates to the world and whether it accurately describes (i.e., corresponds with) that world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.availability-cascade","kind":"concept","label":"Availability cascade","sources":[{"id":"wikipedia.article.availability-cascade","title":"English Wikipedia article: Availability cascade","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+cascade"}],"status":"reported","summary":"English Wikipedia (article \"Availability cascade\", CC BY-SA 4.0) states: An availability cascade is a self-reinforcing cycle that explains the development of certain kinds of collective beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.critical-thinking","kind":"concept","label":"Critical thinking","sources":[{"id":"wikipedia.article.critical-thinking","title":"English Wikipedia article: Critical thinking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Critical+thinking"}],"status":"reported","summary":"English Wikipedia (article \"Critical thinking\", CC BY-SA 4.0) states: Critical thinking is the process of analyzing available facts, evidence, observations, and arguments to reach sound conclusions or informed choices.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.informal-fallacy","kind":"concept","label":"Informal fallacy","sources":[{"id":"wikipedia.article.informal-fallacy","title":"English Wikipedia article: Informal fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Informal+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Informal fallacy\", CC BY-SA 4.0) states: Informal fallacies are a type of incorrect argument in natural language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.formal-fallacy","kind":"concept","label":"Formal fallacy","sources":[{"id":"wikipedia.article.formal-fallacy","title":"English Wikipedia article: Formal fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Formal+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Formal fallacy\", CC BY-SA 4.0) states: In logic and philosophy, a formal fallacy is a pattern of reasoning with a flaw in its logical structure (the logical relationship between the premises and the conclusion).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.skepticism","kind":"concept","label":"Skepticism","sources":[{"id":"wikipedia.article.skepticism","title":"English Wikipedia article: Skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Skepticism\", CC BY-SA 4.0) states: Skepticism (US) or scepticism (UK) is a questioning attitude or doubt toward knowledge claims that are seen as mere belief or dogma.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-bias","kind":"concept","label":"Action bias","sources":[{"id":"wikipedia.article.action-bias","title":"English Wikipedia article: Action bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+bias"}],"status":"reported","summary":"English Wikipedia (article \"Action bias\", CC BY-SA 4.0) states: Action bias is the psychological phenomenon where people tend to favor action over inaction, even when there is no indication that doing so would point towards a better result.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absoluteness-logic","kind":"concept","label":"Absoluteness (logic)","sources":[{"id":"wikipedia.article.absoluteness-logic","title":"English Wikipedia article: Absoluteness (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absoluteness+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Absoluteness (logic)\", CC BY-SA 4.0) states: In mathematical logic, a formula is said to be absolute to some class of structures (also called models), if it has the same truth value in each of the members of that class.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.philosophical-logic","kind":"concept","label":"Philosophical logic","sources":[{"id":"wikipedia.article.philosophical-logic","title":"English Wikipedia article: Philosophical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Philosophical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Philosophical logic\", CC BY-SA 4.0) states: Understood in a narrow sense, philosophical logic is the area of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like modal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adverse-inference","kind":"concept","label":"Adverse inference","sources":[{"id":"wikipedia.article.adverse-inference","title":"English Wikipedia article: Adverse inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adverse+inference"}],"status":"reported","summary":"English Wikipedia (article \"Adverse inference\", CC BY-SA 4.0) states: Adverse inference is a legal inference, adverse to the concerned party, drawn from silence or absence of requested evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.candle-problem","kind":"concept","label":"Candle problem","sources":[{"id":"wikipedia.article.candle-problem","title":"English Wikipedia article: Candle problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Candle+problem"}],"status":"reported","summary":"English Wikipedia (article \"Candle problem\", CC BY-SA 4.0) states: The candle problem or candle task, also known as Duncker's candle problem, is a cognitive performance test, measuring the influence of functional fixedness on a participant's problem solving capabilities.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alvin-plantinga-s-free-will-defense","kind":"concept","label":"Alvin Plantinga's free-will defense","sources":[{"id":"wikipedia.article.alvin-plantinga-s-free-will-defense","title":"English Wikipedia article: Alvin Plantinga's free-will defense","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alvin+Plantinga%27s+free-will+defense"}],"status":"reported","summary":"English Wikipedia (article \"Alvin Plantinga's free-will defense\", CC BY-SA 4.0) states: Alvin Plantinga's free-will defense is a logical argument developed by the American analytic philosopher Alvin Plantinga and published in its final version in his 1977 book God, Freedom, and Evil.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-series-and-b-series","kind":"concept","label":"A series and B series","sources":[{"id":"wikipedia.article.a-series-and-b-series","title":"English Wikipedia article: A series and B series","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A+series+and+B+series"}],"status":"reported","summary":"English Wikipedia (article \"A series and B series\", CC BY-SA 4.0) states: In metaphysics, the A series and the B series are two different descriptions of the temporal ordering relation among events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.measurement","kind":"concept","label":"Measurement","sources":[{"id":"wikipedia.article.measurement","title":"English Wikipedia article: Measurement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Measurement"}],"status":"reported","summary":"English Wikipedia (article \"Measurement\", CC BY-SA 4.0) states: Measurement is the quantification of attributes of an object or event, which can be used to compare with other objects or events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-bias","kind":"concept","label":"Cognitive bias","sources":[{"id":"wikipedia.article.cognitive-bias","title":"English Wikipedia article: Cognitive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive bias\", CC BY-SA 4.0) states: A cognitive bias is a systematic pattern of deviation from the norm or rationality in judgment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.pseudoscience","kind":"concept","label":"Pseudoscience","sources":[{"id":"wikipedia.article.pseudoscience","title":"English Wikipedia article: Pseudoscience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pseudoscience"}],"status":"reported","summary":"English Wikipedia (article \"Pseudoscience\", CC BY-SA 4.0) states: Pseudoscience consists of statements, beliefs, or practices that claim to be scientific but are inherently incompatible with the scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-priori-and-a-posteriori","kind":"concept","label":"A priori and a posteriori","sources":[{"id":"wikipedia.article.a-priori-and-a-posteriori","title":"English Wikipedia article: A priori and a posteriori","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A+priori+and+a+posteriori"}],"status":"reported","summary":"English Wikipedia (article \"A priori and a posteriori\", CC BY-SA 4.0) states: In epistemology, a priori (‘from the earlier’) and a posteriori (‘from the later’) are the two categories of knowledge, justification, or argument, determining whether or not a proposition is reliant on outside sensory experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.history-and-philosophy-of-science","kind":"field","label":"History and philosophy of science","sources":[{"id":"wikipedia.article.history-and-philosophy-of-science","title":"English Wikipedia article: History and philosophy of science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=History+and+philosophy+of+science"}],"status":"reported","summary":"English Wikipedia (article \"History and philosophy of science\", CC BY-SA 4.0) states: The history and philosophy of science (HPS) is an academic discipline that encompasses the history of science and the philosophy of science.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.b-theory-of-time","kind":"concept","label":"B-theory of time","sources":[{"id":"wikipedia.article.b-theory-of-time","title":"English Wikipedia article: B-theory of time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=B-theory+of+time"}],"status":"reported","summary":"English Wikipedia (article \"B-theory of time\", CC BY-SA 4.0) states: The B-theory of time, also called the tenseless theory of time, is one of two positions regarding the temporal ordering of events in the philosophy of time.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deflationary-theory-of-truth","kind":"concept","label":"Deflationary theory of truth","sources":[{"id":"wikipedia.article.deflationary-theory-of-truth","title":"English Wikipedia article: Deflationary theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deflationary+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Deflationary theory of truth\", CC BY-SA 4.0) states: In philosophy and logic, a deflationary theory of truth (also semantic deflationism or simply deflationism) is one of a family of theories that all have in common the claim that assertions of predicate truth of a statement do not attribute a property called \"truth\" to such a statement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.archival-research","kind":"concept","label":"Archival research","sources":[{"id":"wikipedia.article.archival-research","title":"English Wikipedia article: Archival research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archival+research"}],"status":"reported","summary":"English Wikipedia (article \"Archival research\", CC BY-SA 4.0) states: Archival research is a type of research which involves seeking out and extracting evidence from archival records.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.agent-causation","kind":"concept","label":"Agent causation","sources":[{"id":"wikipedia.article.agent-causation","title":"English Wikipedia article: Agent causation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agent+causation"}],"status":"reported","summary":"English Wikipedia (article \"Agent causation\", CC BY-SA 4.0) states: Agent causation (or agent causality) is a category of determination in metaphysics, where a being who is not an event—namely an agent—can cause events (particularly the agent's own actions).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-reasoning","kind":"concept","label":"Adaptive reasoning","sources":[{"id":"wikipedia.article.adaptive-reasoning","title":"English Wikipedia article: Adaptive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive reasoning\", CC BY-SA 4.0) states: Adaptive reasoning refers to a problem solving strategy that adapts thinking to address a problem as it changes and evolves.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.affirming-the-consequent","kind":"concept","label":"Affirming the consequent","sources":[{"id":"wikipedia.article.affirming-the-consequent","title":"English Wikipedia article: Affirming the consequent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affirming+the+consequent"}],"status":"reported","summary":"English Wikipedia (article \"Affirming the consequent\", CC BY-SA 4.0) states: In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of an indicative conditional statement, it is stated that because the consequent is true, therefore the antecedent is true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.empiric-school","kind":"concept","label":"Empiric school","sources":[{"id":"wikipedia.article.empiric-school","title":"English Wikipedia article: Empiric school","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Empiric+school"}],"status":"reported","summary":"English Wikipedia (article \"Empiric school\", CC BY-SA 4.0) states: The Empiric school of medicine (Empirics, Empiricists, or Empirici, Greek: Ἐμπειρικοί) was a school of medicine founded in Alexandria the middle of the third century BC.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesianism","kind":"concept","label":"Cartesianism","sources":[{"id":"wikipedia.article.cartesianism","title":"English Wikipedia article: Cartesianism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesianism"}],"status":"reported","summary":"English Wikipedia (article \"Cartesianism\", CC BY-SA 4.0) states: Cartesianism is the philosophical and scientific system of René Descartes and its subsequent development by other seventeenth century thinkers, most notably François Poullain de la Barre, Nicolas Malebranche and Baruch Spinoza.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.accident-philosophy","kind":"concept","label":"Accident (philosophy)","sources":[{"id":"wikipedia.article.accident-philosophy","title":"English Wikipedia article: Accident (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Accident+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Accident (philosophy)\", CC BY-SA 4.0) states: An accident (Greek συμβεβηκός), in metaphysics and philosophy, is a property that the entity or substance has contingently, without which the substance can still retain its identity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.agentive-logic","kind":"concept","label":"Agentive logic","sources":[{"id":"wikipedia.article.agentive-logic","title":"English Wikipedia article: Agentive logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agentive+logic"}],"status":"reported","summary":"English Wikipedia (article \"Agentive logic\", CC BY-SA 4.0) states: Agentive logic (also called the logic of action or logic of agency) is the field of philosophical logic and logic in computer science that studies formal representations of agents, their actions, and their abilities.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.catch-22-logic","kind":"concept","label":"Catch-22 (logic)","sources":[{"id":"wikipedia.article.catch-22-logic","title":"English Wikipedia article: Catch-22 (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catch-22+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Catch-22 (logic)\", CC BY-SA 4.0) states: A catch-22 is a paradoxical situation from which an individual cannot escape because of contradictory rules or limitations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.arbitrary-inference","kind":"concept","label":"Arbitrary inference","sources":[{"id":"wikipedia.article.arbitrary-inference","title":"English Wikipedia article: Arbitrary inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arbitrary+inference"}],"status":"reported","summary":"English Wikipedia (article \"Arbitrary inference\", CC BY-SA 4.0) states: Arbitrary inference is a classic tenet of cognitive therapy created by Aaron T. Beck in 1979.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analogy","kind":"concept","label":"Analogy","sources":[{"id":"wikipedia.article.analogy","title":"English Wikipedia article: Analogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogy"}],"status":"reported","summary":"English Wikipedia (article \"Analogy\", CC BY-SA 4.0) states: Analogy is a comparison or correspondence between two things (or two groups of things) because of a third element that they are considered to share.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-philosophy","kind":"concept","label":"Absolute (philosophy)","sources":[{"id":"wikipedia.article.absolute-philosophy","title":"English Wikipedia article: Absolute (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Absolute (philosophy)\", CC BY-SA 4.0) states: In philosophy (often specifically metaphysics), the absolute, in most common usage, is an absolute perfect, self-sufficient reality that depends upon nothing external to itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-justice","kind":"concept","label":"Cognitive justice","sources":[{"id":"wikipedia.article.cognitive-justice","title":"English Wikipedia article: Cognitive justice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+justice"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive justice\", CC BY-SA 4.0) states: The concept of cognitive justice is based on the recognition of the plurality of knowledge and expresses the right of the different forms of knowledge to co-exist.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-heuristic","kind":"concept","label":"Admissible heuristic","sources":[{"id":"wikipedia.article.admissible-heuristic","title":"English Wikipedia article: Admissible heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Admissible heuristic\", CC BY-SA 4.0) states: In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alphabet-of-human-thought","kind":"concept","label":"Alphabet of human thought","sources":[{"id":"wikipedia.article.alphabet-of-human-thought","title":"English Wikipedia article: Alphabet of human thought","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alphabet+of+human+thought"}],"status":"reported","summary":"English Wikipedia (article \"Alphabet of human thought\", CC BY-SA 4.0) states: The alphabet of human thought (Latin: alphabetum cogitationum humanarum) is a concept originally proposed by Gottfried Wilhelm Leibniz that provides a universal way to represent and analyze ideas and relationships by breaking down their component pieces.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.abductive-reasoning","kind":"concept","label":"Abductive reasoning","sources":[{"id":"wikipedia.article.abductive-reasoning","title":"English Wikipedia article: Abductive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abductive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Abductive reasoning\", CC BY-SA 4.0) states: Abductive reasoning (also called abduction, abductive inference, or retroduction) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.bayesian-epistemology","kind":"field","label":"Bayesian epistemology","sources":[{"id":"wikipedia.article.bayesian-epistemology","title":"English Wikipedia article: Bayesian epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bayesian+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Bayesian epistemology\", CC BY-SA 4.0) states: Bayesian epistemology is a formal approach to various topics in epistemology that has its roots in Thomas Bayes' work in the field of probability theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.actor-network-theory","kind":"concept","label":"Actor–network theory","sources":[{"id":"wikipedia.article.actor-network-theory","title":"English Wikipedia article: Actor–network theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actor%E2%80%93network+theory"}],"status":"reported","summary":"English Wikipedia (article \"Actor–network theory\", CC BY-SA 4.0) states: Actor–network theory (ANT) is a theoretical and methodological approach to social theory where everything in the social and natural worlds exists in constantly shifting networks of relationships.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-analogy","kind":"concept","label":"Argument from analogy","sources":[{"id":"wikipedia.article.argument-from-analogy","title":"English Wikipedia article: Argument from analogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+analogy"}],"status":"reported","summary":"English Wikipedia (article \"Argument from analogy\", CC BY-SA 4.0) states: Argument from analogy is a special type of inductive argument, where perceived similarities are used as a basis to infer some further similarity that has not been observed yet.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ad-personam","kind":"concept","label":"Ad personam","sources":[{"id":"wikipedia.article.ad-personam","title":"English Wikipedia article: Ad personam","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ad+personam"}],"status":"reported","summary":"English Wikipedia (article \"Ad personam\", CC BY-SA 4.0) states: In an argument, ad personam, short for argumentum ad personam, is a tactic aimed at discrediting one's opponent by attacking their personality, unrelated to the substance of the debate.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denying-the-antecedent","kind":"concept","label":"Denying the antecedent","sources":[{"id":"wikipedia.article.denying-the-antecedent","title":"English Wikipedia article: Denying the antecedent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denying+the+antecedent"}],"status":"reported","summary":"English Wikipedia (article \"Denying the antecedent\", CC BY-SA 4.0) states: Denying the antecedent (also known as denial of the antecedent, inverse error, or fallacy of the inverse) is a formal fallacy of inferring the inverse from an original statement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antipedagogy","kind":"concept","label":"Antipedagogy","sources":[{"id":"wikipedia.article.antipedagogy","title":"English Wikipedia article: Antipedagogy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antipedagogy"}],"status":"reported","summary":"English Wikipedia (article \"Antipedagogy\", CC BY-SA 4.0) states: Antipedagogy (German: Antipädagogik; Ancient Greek: anti-against + pais-child, boy + agein- lead; UK: ), sometimes spelled anti-pedagogy with the hyphen, is a critical theory that examines traditional pedagogical dynamics, particularly scrutinizing the exercise of parental or educational authority as a violation of human rights.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antinomy","kind":"concept","label":"Antinomy","sources":[{"id":"wikipedia.article.antinomy","title":"English Wikipedia article: Antinomy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antinomy"}],"status":"reported","summary":"English Wikipedia (article \"Antinomy\", CC BY-SA 4.0) states: In philosophy, an antinomy (; Ancient Greek: antí 'against' + nómos 'law') is a real or apparent contradiction between two conclusions, both of which seem justified.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.communicative-rationality","kind":"concept","label":"Communicative rationality","sources":[{"id":"wikipedia.article.communicative-rationality","title":"English Wikipedia article: Communicative rationality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Communicative+rationality"}],"status":"reported","summary":"English Wikipedia (article \"Communicative rationality\", CC BY-SA 4.0) states: Communicative rationality or communicative reason (German: kommunikative Rationalität) is a theory or set of theories which describes human rationality as a necessary outcome of successful communication.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analogy-of-the-divided-line","kind":"concept","label":"Analogy of the divided line","sources":[{"id":"wikipedia.article.analogy-of-the-divided-line","title":"English Wikipedia article: Analogy of the divided line","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogy+of+the+divided+line"}],"status":"reported","summary":"English Wikipedia (article \"Analogy of the divided line\", CC BY-SA 4.0) states: The analogy of the divided line (Ancient Greek: γραμμὴ δίχα τετμημένη, romanized: grammē dicha tetmēmenē) is presented by the Greek philosopher Plato in the Republic (509d–511e).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ai-trust-paradox","kind":"concept","label":"AI trust paradox","sources":[{"id":"wikipedia.article.ai-trust-paradox","title":"English Wikipedia article: AI trust paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=AI+trust+paradox"}],"status":"reported","summary":"English Wikipedia (article \"AI trust paradox\", CC BY-SA 4.0) states: The AI trust paradox (also known as the verisimilitude paradox) is the phenomenon where advanced artificial intelligence models become so proficient at mimicking human-like language and behavior that users increasingly struggle to determine if the information generated is accurate or simply plausible.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-space-and-time","kind":"concept","label":"Absolute space and time","sources":[{"id":"wikipedia.article.absolute-space-and-time","title":"English Wikipedia article: Absolute space and time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+space+and+time"}],"status":"reported","summary":"English Wikipedia (article \"Absolute space and time\", CC BY-SA 4.0) states: Absolute space and time is a concept in physics and philosophy about the properties of the universe.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.effective-theory","kind":"concept","label":"Effective theory","sources":[{"id":"wikipedia.article.effective-theory","title":"English Wikipedia article: Effective theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Effective+theory"}],"status":"reported","summary":"English Wikipedia (article \"Effective theory\", CC BY-SA 4.0) states: In science, an effective theory is a deliberately limited scientific theory applicable under specific circumstances.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.affect-heuristic","kind":"concept","label":"Affect heuristic","sources":[{"id":"wikipedia.article.affect-heuristic","title":"English Wikipedia article: Affect heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affect+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Affect heuristic\", CC BY-SA 4.0) states: The affect heuristic is a heuristic, a mental shortcut that allows people to make decisions and solve problems quickly and efficiently, in which current emotion—fear, pleasure, surprise, etc.—influences decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.academic-skepticism","kind":"concept","label":"Academic skepticism","sources":[{"id":"wikipedia.article.academic-skepticism","title":"English Wikipedia article: Academic skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Academic+skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Academic skepticism\", CC BY-SA 4.0) states: Academic skepticism was the philosophy of the skeptical period of the Academy dating from around 266 BC, when Arcesilaus became scholarch, until around 90 BC, when Antiochus of Ascalon rejected skepticism, although individual philosophers, such as Favorinus and his teacher Plutarch, continued to defend skepticism after this date.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.abstraction","kind":"concept","label":"Abstraction","sources":[{"id":"wikipedia.article.abstraction","title":"English Wikipedia article: Abstraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstraction"}],"status":"reported","summary":"English Wikipedia (article \"Abstraction\", CC BY-SA 4.0) states: Abstraction is the process of generalizing rules and concepts from specific examples, literal (real or concrete) signifiers, first principles, or other methods.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.black-swan-theory","kind":"concept","label":"Black swan theory","sources":[{"id":"wikipedia.article.black-swan-theory","title":"English Wikipedia article: Black swan theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Black+swan+theory"}],"status":"reported","summary":"English Wikipedia (article \"Black swan theory\", CC BY-SA 4.0) states: The black swan theory or theory of black swan events is a metaphor that describes an event that comes as a surprise, has a major effect, and is often inappropriately rationalized after the fact with the benefit of hindsight.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.closed-circle","kind":"concept","label":"Closed circle","sources":[{"id":"wikipedia.article.closed-circle","title":"English Wikipedia article: Closed circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closed+circle"}],"status":"reported","summary":"English Wikipedia (article \"Closed circle\", CC BY-SA 4.0) states: A closed-circle argument is one that is unfalsifiable.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-theories-of-truth","kind":"concept","label":"Epistemic theories of truth","sources":[{"id":"wikipedia.article.epistemic-theories-of-truth","title":"English Wikipedia article: Epistemic theories of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+theories+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic theories of truth\", CC BY-SA 4.0) states: In philosophy and epistemology, epistemic theories of truth are attempts to analyze the notion of truth in terms of epistemic notions such as knowledge, belief, acceptance, verification, justification, and perspective.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blinded-experiment","kind":"concept","label":"Blinded experiment","sources":[{"id":"wikipedia.article.blinded-experiment","title":"English Wikipedia article: Blinded experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blinded+experiment"}],"status":"reported","summary":"English Wikipedia (article \"Blinded experiment\", CC BY-SA 4.0) states: In a blind or blinded experiment, information that could influence participants or investigators is withheld until the experiment is completed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dispersed-knowledge","kind":"concept","label":"Dispersed knowledge","sources":[{"id":"wikipedia.article.dispersed-knowledge","title":"English Wikipedia article: Dispersed knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dispersed+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Dispersed knowledge\", CC BY-SA 4.0) states: Dispersed knowledge in economics is the notion that no single agent has information as to all of the factors which influence prices and production throughout the system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief-revision","kind":"concept","label":"Belief revision","sources":[{"id":"wikipedia.article.belief-revision","title":"English Wikipedia article: Belief revision","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief+revision"}],"status":"reported","summary":"English Wikipedia (article \"Belief revision\", CC BY-SA 4.0) states: Belief revision (also called belief change) is the process of changing beliefs to take into account a new piece of information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-reasoning","kind":"concept","label":"Analytic reasoning","sources":[{"id":"wikipedia.article.analytic-reasoning","title":"English Wikipedia article: Analytic reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Analytic reasoning\", CC BY-SA 4.0) states: Analytical reasoning, also known as analytical thinking, refers to the ability to look at information, be it qualitative or quantitative in nature, and discern patterns within the information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backward-induction","kind":"concept","label":"Backward induction","sources":[{"id":"wikipedia.article.backward-induction","title":"English Wikipedia article: Backward induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backward+induction"}],"status":"reported","summary":"English Wikipedia (article \"Backward induction\", CC BY-SA 4.0) states: Backward induction is the process of determining a sequence of optimal choices by reasoning from the endpoint of a problem or situation back to its beginning using individual events or actions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecological-fallacy","kind":"concept","label":"Ecological fallacy","sources":[{"id":"wikipedia.article.ecological-fallacy","title":"English Wikipedia article: Ecological fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecological+fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Ecological fallacy\", CC BY-SA 4.0) states: An ecological fallacy (also ecological inference fallacy or population fallacy) is a formal fallacy in the interpretation of statistical data that occurs when inferences about the nature of individuals are deduced from inferences about the group to which those individuals belong. \"Ecological fallacy\" is a term that is sometimes used to describe the fallacy of division, which is not a statistical fallacy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.argumentation-theory","kind":"field","label":"Argumentation theory","sources":[{"id":"wikipedia.article.argumentation-theory","title":"English Wikipedia article: Argumentation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Argumentation theory\", CC BY-SA 4.0) states: Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ariadne-s-thread-logic","kind":"concept","label":"Ariadne's thread (logic)","sources":[{"id":"wikipedia.article.ariadne-s-thread-logic","title":"English Wikipedia article: Ariadne's thread (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ariadne%27s+thread+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Ariadne's thread (logic)\", CC BY-SA 4.0) states: Ariadne's thread, named for the legend of Ariadne who gave Theseus a ball of thread (literally a “clue”) to find his way back out of the Minotaur’s labyrinth, is solving a problem which has multiple apparent ways to proceed—such as a physical maze, a logic puzzle, or an ethical dilemma—through an exhaustive application of logic to all available routes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.local-skepticism","kind":"concept","label":"Local skepticism","sources":[{"id":"wikipedia.article.local-skepticism","title":"English Wikipedia article: Local skepticism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Local+skepticism"}],"status":"reported","summary":"English Wikipedia (article \"Local skepticism\", CC BY-SA 4.0) states: Local skepticism is the view that one cannot possess knowledge in some particular domain.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.empirical-evidence","kind":"concept","label":"Empirical evidence","sources":[{"id":"wikipedia.article.empirical-evidence","title":"English Wikipedia article: Empirical evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Empirical+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Empirical evidence\", CC BY-SA 4.0) states: Empirical evidence is evidence obtained through sense experience or experimental procedure.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cheng-zhu-school","kind":"concept","label":"Cheng–Zhu school","sources":[{"id":"wikipedia.article.cheng-zhu-school","title":"English Wikipedia article: Cheng–Zhu school","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cheng%E2%80%93Zhu+school"}],"status":"reported","summary":"English Wikipedia (article \"Cheng–Zhu school\", CC BY-SA 4.0) states: The School of Principle (simplified Chinese: 理学; traditional Chinese: 理學; pinyin: Lǐxué), or the Cheng–Zhu School (Chinese: 程朱理學; pinyin: Chéng Zhū lǐxué), is one of the major philosophical schools of Neo-Confucianism, based on the ideas of the Neo-Confucian philosophers Cheng Yi, Cheng Hao, and Zhu Xi.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apodicticity","kind":"concept","label":"Apodicticity","sources":[{"id":"wikipedia.article.apodicticity","title":"English Wikipedia article: Apodicticity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apodicticity"}],"status":"reported","summary":"English Wikipedia (article \"Apodicticity\", CC BY-SA 4.0) states: \"Apodictic\", also spelled \"apodeictic\" (Ancient Greek: ἀποδεικτικός, \"capable of demonstration\"), is an adjectival expression from Aristotelian logic that refers to propositions that are demonstrably, necessarily or self-evidently true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-rationale","kind":"concept","label":"Design rationale","sources":[{"id":"wikipedia.article.design-rationale","title":"English Wikipedia article: Design rationale","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+rationale"}],"status":"reported","summary":"English Wikipedia (article \"Design rationale\", CC BY-SA 4.0) states: A design rationale is an explicit documentation of the reasons behind decisions made when designing a system or artifact.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.expectancy-theory","kind":"concept","label":"Expectancy theory","sources":[{"id":"wikipedia.article.expectancy-theory","title":"English Wikipedia article: Expectancy theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Expectancy+theory"}],"status":"reported","summary":"English Wikipedia (article \"Expectancy theory\", CC BY-SA 4.0) states: Expectancy theory (or expectancy theory of motivation) proposes that an individual will behave or act in a certain way because they are motivated to select a specific behavior over others due to what they expect the result of that selected behavior will be.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.a-b-testing","kind":"concept","label":"A/B testing","sources":[{"id":"wikipedia.article.a-b-testing","title":"English Wikipedia article: A/B testing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A%2FB+testing"}],"status":"reported","summary":"English Wikipedia (article \"A/B testing\", CC BY-SA 4.0) states: A/B testing (also known as bucket testing, split-run testing or split testing) is a user-experience research method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.baconian-method","kind":"concept","label":"Baconian method","sources":[{"id":"wikipedia.article.baconian-method","title":"English Wikipedia article: Baconian method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baconian+method"}],"status":"reported","summary":"English Wikipedia (article \"Baconian method\", CC BY-SA 4.0) states: The Baconian method is the investigative method developed by Francis Bacon, one of the founders of modern science, and thus a first formulation of a modern scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.burden-of-knowledge","kind":"concept","label":"Burden of knowledge","sources":[{"id":"wikipedia.article.burden-of-knowledge","title":"English Wikipedia article: Burden of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Burden+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Burden of knowledge\", CC BY-SA 4.0) states: The burden of knowledge describes the difficulty of adding to a scientific field as the amount of previous work that must be understood increases over time.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.agnoiology","kind":"field","label":"Agnoiology","sources":[{"id":"wikipedia.article.agnoiology","title":"English Wikipedia article: Agnoiology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agnoiology"}],"status":"reported","summary":"English Wikipedia (article \"Agnoiology\", CC BY-SA 4.0) states: Agnoiology (from the Greek ἀγνοέω, meaning ignorance) is the theoretical study of the quality and conditions of ignorance, and in particular of what can truly be considered \"unknowable\" (as distinct from \"unknown\").","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesian-doubt","kind":"concept","label":"Cartesian doubt","sources":[{"id":"wikipedia.article.cartesian-doubt","title":"English Wikipedia article: Cartesian doubt","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesian+doubt"}],"status":"reported","summary":"English Wikipedia (article \"Cartesian doubt\", CC BY-SA 4.0) states: Cartesian doubt is a form of methodological skepticism associated with the writings and methodology of René Descartes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anecdotal-evidence","kind":"concept","label":"Anecdotal evidence","sources":[{"id":"wikipedia.article.anecdotal-evidence","title":"English Wikipedia article: Anecdotal evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anecdotal+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Anecdotal evidence\", CC BY-SA 4.0) states: Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non-systematic manner.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"question.wikipedia.conjecture","kind":"question","label":"Conjecture","sources":[{"id":"wikipedia.article.conjecture","title":"English Wikipedia article: Conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Conjecture\", CC BY-SA 4.0) states: In mathematics, a conjecture is a proposition that is proffered on a tentative basis without proof.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fictionalism","kind":"concept","label":"Fictionalism","sources":[{"id":"wikipedia.article.fictionalism","title":"English Wikipedia article: Fictionalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fictionalism"}],"status":"reported","summary":"English Wikipedia (article \"Fictionalism\", CC BY-SA 4.0) states: Fictionalism is a view in philosophy that posits that statements appearing to be descriptions of the world should not be construed as such, but should instead be understood as cases of \"make believe\", thus allowing individuals to treat something as literally true (a \"useful fiction\").","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.audit-study","kind":"concept","label":"Audit study","sources":[{"id":"wikipedia.article.audit-study","title":"English Wikipedia article: Audit study","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audit+study"}],"status":"reported","summary":"English Wikipedia (article \"Audit study\", CC BY-SA 4.0) states: A type of study used in economics, sociology, political science, and psychology, an audit study is one in which trained employees of the researcher (\"auditors\") are matched on all characteristics except the one being tested for discrimination.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief-desire-intention-model","kind":"concept","label":"Belief–desire–intention model","sources":[{"id":"wikipedia.article.belief-desire-intention-model","title":"English Wikipedia article: Belief–desire–intention model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief%E2%80%93desire%E2%80%93intention+model"}],"status":"reported","summary":"English Wikipedia (article \"Belief–desire–intention model\", CC BY-SA 4.0) states: For popular psychology, the belief–desire–intention (BDI) model of human practical reasoning was developed by Michael Bratman as a way of explaining future-directed intention.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument","kind":"concept","label":"Argument","sources":[{"id":"wikipedia.article.argument","title":"English Wikipedia article: Argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument"}],"status":"reported","summary":"English Wikipedia (article \"Argument\", CC BY-SA 4.0) states: An argument is one or more premises—sentences, statements, or propositions—directed towards arriving at a logical conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-inference","kind":"concept","label":"Causal inference","sources":[{"id":"wikipedia.article.causal-inference","title":"English Wikipedia article: Causal inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+inference"}],"status":"reported","summary":"English Wikipedia (article \"Causal inference\", CC BY-SA 4.0) states: Causal inference is the process of determining the independent, actual effect of a particular phenomenon that is a component of a larger system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appeal-to-the-law","kind":"concept","label":"Appeal to the law","sources":[{"id":"wikipedia.article.appeal-to-the-law","title":"English Wikipedia article: Appeal to the law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appeal+to+the+law"}],"status":"reported","summary":"English Wikipedia (article \"Appeal to the law\", CC BY-SA 4.0) states: An appeal to the law (argumentum ad legem in Latin) is an informal fallacy in which someone tries to encourage or defend an action based on its legality, or condemn it as morally reprehensible, purely because it is illegal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.distinction-bias","kind":"concept","label":"Distinction bias","sources":[{"id":"wikipedia.article.distinction-bias","title":"English Wikipedia article: Distinction bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distinction+bias"}],"status":"reported","summary":"English Wikipedia (article \"Distinction bias\", CC BY-SA 4.0) states: Distinction bias, a concept of decision theory, is the tendency to view two options as more distinctive when evaluating them simultaneously than when evaluating them separately.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-a-fortiori","kind":"concept","label":"Argumentum a fortiori","sources":[{"id":"wikipedia.article.argumentum-a-fortiori","title":"English Wikipedia article: Argumentum a fortiori","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+a+fortiori"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum a fortiori\", CC BY-SA 4.0) states: Argumentum a fortiori (literally \"argument from the stronger [reason]\") (UK: , US: ) is a form of argumentation that draws upon existing confidence in a proposition to argue in favour of a second proposition that is held to be implicit in, or even more certain than, the first.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.armchair-theorizing","kind":"concept","label":"Armchair theorizing","sources":[{"id":"wikipedia.article.armchair-theorizing","title":"English Wikipedia article: Armchair theorizing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armchair+theorizing"}],"status":"reported","summary":"English Wikipedia (article \"Armchair theorizing\", CC BY-SA 4.0) states: Armchair theory or armchair philosophy is an approach to providing new developments in a field that does not involve analysis of empirical (real-world) data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.reasonable-doubt","kind":"concept","label":"Reasonable doubt","sources":[{"id":"wikipedia.article.reasonable-doubt","title":"English Wikipedia article: Reasonable doubt","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Reasonable+doubt"}],"status":"reported","summary":"English Wikipedia (article \"Reasonable doubt\", CC BY-SA 4.0) states: Beyond (a) reasonable doubt is a legal standard of proof required to reach a criminal conviction in some adversarial legal systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apophantic","kind":"concept","label":"Apophantic","sources":[{"id":"wikipedia.article.apophantic","title":"English Wikipedia article: Apophantic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apophantic"}],"status":"reported","summary":"English Wikipedia (article \"Apophantic\", CC BY-SA 4.0) states: In logic, Apophantic (Greek: ἀποφαντικός, \"declaratory\", from ἀποφαίνειν apophainein, \"to show, to make known\") statements are declaratory statements whose truth-value can be determined by examining whether its predicate can be logically attributed to its subject.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dogma","kind":"concept","label":"Dogma","sources":[{"id":"wikipedia.article.dogma","title":"English Wikipedia article: Dogma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dogma"}],"status":"reported","summary":"English Wikipedia (article \"Dogma\", CC BY-SA 4.0) states: Dogma, in its broadest sense, is any belief held definitively and without the possibility of reform.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correspondent-inference-theory","kind":"concept","label":"Correspondent inference theory","sources":[{"id":"wikipedia.article.correspondent-inference-theory","title":"English Wikipedia article: Correspondent inference theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correspondent+inference+theory"}],"status":"reported","summary":"English Wikipedia (article \"Correspondent inference theory\", CC BY-SA 4.0) states: Correspondent inference theory is a psychological theory proposed by Edward E. Jones and Keith E. Davis (1965) that \"systematically accounts for a perceiver's inferences about what an actor was trying to achieve by a particular action\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-marginal-cases","kind":"concept","label":"Argument from marginal cases","sources":[{"id":"wikipedia.article.argument-from-marginal-cases","title":"English Wikipedia article: Argument from marginal cases","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+marginal+cases"}],"status":"reported","summary":"English Wikipedia (article \"Argument from marginal cases\", CC BY-SA 4.0) states: The argument from marginal cases (also known as the argument from species overlap) is a philosophical argument within animal rights theory regarding the moral status of non-human animals.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.active-intellect","kind":"concept","label":"Active intellect","sources":[{"id":"wikipedia.article.active-intellect","title":"English Wikipedia article: Active intellect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+intellect"}],"status":"reported","summary":"English Wikipedia (article \"Active intellect\", CC BY-SA 4.0) states: In medieval philosophy, the active intellect (Latin: intellectus agens; also translated as agent intellect, active intelligence, active reason, or productive intellect) is the formal (morphe) aspect of the intellect (nous), according to the Aristotelian theory of hylomorphism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.expectancy-violations-theory","kind":"concept","label":"Expectancy violations theory","sources":[{"id":"wikipedia.article.expectancy-violations-theory","title":"English Wikipedia article: Expectancy violations theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Expectancy+violations+theory"}],"status":"reported","summary":"English Wikipedia (article \"Expectancy violations theory\", CC BY-SA 4.0) states: Expectancy violations theory (EVT) is a theory of communication that analyzes how individuals respond to unanticipated violations of social norms and expectations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attrition-research","kind":"concept","label":"Attrition (research)","sources":[{"id":"wikipedia.article.attrition-research","title":"English Wikipedia article: Attrition (research)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attrition+%28research%29"}],"status":"reported","summary":"English Wikipedia (article \"Attrition (research)\", CC BY-SA 4.0) states: In science, attrition are ratios regarding the loss of participants during an experiment.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.data-universalism","kind":"concept","label":"Data universalism","sources":[{"id":"wikipedia.article.data-universalism","title":"English Wikipedia article: Data universalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+universalism"}],"status":"reported","summary":"English Wikipedia (article \"Data universalism\", CC BY-SA 4.0) states: Data universalism is an epistemological framework that assumes a single universal narrative of any dataset without any consideration of geographical borders and social contexts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.eliminative-materialism","kind":"concept","label":"Eliminative materialism","sources":[{"id":"wikipedia.article.eliminative-materialism","title":"English Wikipedia article: Eliminative materialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eliminative+materialism"}],"status":"reported","summary":"English Wikipedia (article \"Eliminative materialism\", CC BY-SA 4.0) states: Eliminative materialism (also called eliminativism) is a materialist position in philosophy of mind that expresses the idea that the majority of mental states in folk psychology do not exist.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-inertia","kind":"concept","label":"Cognitive inertia","sources":[{"id":"wikipedia.article.cognitive-inertia","title":"English Wikipedia article: Cognitive inertia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+inertia"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive inertia\", CC BY-SA 4.0) states: Cognitive inertia is the tendency – for a particular orientation in an individual's thinking about a matter, belief, or strategy – to resist change.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.arche-writing","kind":"concept","label":"Arche-writing","sources":[{"id":"wikipedia.article.arche-writing","title":"English Wikipedia article: Arche-writing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arche-writing"}],"status":"reported","summary":"English Wikipedia (article \"Arche-writing\", CC BY-SA 4.0) states: In the philosophy of language, \"Arche-writing\" (French: archi-écriture \"arche-\" meaning \"origin, principle, or telos\") is a concept introduced by French philosopher Jacques Derrida which refers to an abstract kind of writing that precedes both speech and actual writing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.alethiology","kind":"field","label":"Alethiology","sources":[{"id":"wikipedia.article.alethiology","title":"English Wikipedia article: Alethiology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alethiology"}],"status":"reported","summary":"English Wikipedia (article \"Alethiology\", CC BY-SA 4.0) states: Alethiology (or alethology, \"the study of aletheia\") literally means the study of truth, but can more accurately be translated as the study of the nature of truth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.alief-mental-state","kind":"concept","label":"Alief (mental state)","sources":[{"id":"wikipedia.article.alief-mental-state","title":"English Wikipedia article: Alief (mental state)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alief+%28mental+state%29"}],"status":"reported","summary":"English Wikipedia (article \"Alief (mental state)\", CC BY-SA 4.0) states: In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antipositivism","kind":"concept","label":"Antipositivism","sources":[{"id":"wikipedia.article.antipositivism","title":"English Wikipedia article: Antipositivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antipositivism"}],"status":"reported","summary":"English Wikipedia (article \"Antipositivism\", CC BY-SA 4.0) states: In social science, antipositivism (also interpretivism, negativism or antinaturalism) is a theoretical stance which proposes that the social realm cannot be studied with the methods of investigation utilized within the natural sciences, and that investigation of the social realm requires a different epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-empiricism","kind":"concept","label":"Constructive empiricism","sources":[{"id":"wikipedia.article.constructive-empiricism","title":"English Wikipedia article: Constructive empiricism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+empiricism"}],"status":"reported","summary":"English Wikipedia (article \"Constructive empiricism\", CC BY-SA 4.0) states: In philosophy of science, constructive empiricism is a form of empiricism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.butterfly-effect","kind":"concept","label":"Butterfly effect","sources":[{"id":"wikipedia.article.butterfly-effect","title":"English Wikipedia article: Butterfly effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butterfly+effect"}],"status":"reported","summary":"English Wikipedia (article \"Butterfly effect\", CC BY-SA 4.0) states: In chaos theory, the butterfly effect is the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.encyclopedic-knowledge","kind":"concept","label":"Encyclopedic knowledge","sources":[{"id":"wikipedia.article.encyclopedic-knowledge","title":"English Wikipedia article: Encyclopedic knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Encyclopedic+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Encyclopedic knowledge\", CC BY-SA 4.0) states: To have encyclopedic knowledge is to have \"vast and complete\" knowledge about a large number of diverse subjects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backward-chaining","kind":"concept","label":"Backward chaining","sources":[{"id":"wikipedia.article.backward-chaining","title":"English Wikipedia article: Backward chaining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backward+chaining"}],"status":"reported","summary":"English Wikipedia (article \"Backward chaining\", CC BY-SA 4.0) states: Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.differential-effects","kind":"concept","label":"Differential effects","sources":[{"id":"wikipedia.article.differential-effects","title":"English Wikipedia article: Differential effects","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+effects"}],"status":"reported","summary":"English Wikipedia (article \"Differential effects\", CC BY-SA 4.0) states: Differential effects play a special role in certain observational studies in which treatments are not assigned to subjects at random, where differing outcomes may reflect biased assignments rather than effects caused by the treatments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-incredulity","kind":"concept","label":"Argument from incredulity","sources":[{"id":"wikipedia.article.argument-from-incredulity","title":"English Wikipedia article: Argument from incredulity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+incredulity"}],"status":"reported","summary":"English Wikipedia (article \"Argument from incredulity\", CC BY-SA 4.0) states: Argument from incredulity, also known as argument from personal incredulity, appeal to common sense, or the divine fallacy, is a fallacy in informal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bracketing-phenomenology","kind":"concept","label":"Bracketing (phenomenology)","sources":[{"id":"wikipedia.article.bracketing-phenomenology","title":"English Wikipedia article: Bracketing (phenomenology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bracketing+%28phenomenology%29"}],"status":"reported","summary":"English Wikipedia (article \"Bracketing (phenomenology)\", CC BY-SA 4.0) states: Bracketing (German: Einklammerung; also called phenomenological reduction, transcendental reduction or phenomenological epoché) means looking at a situation and refraining from judgement and biased opinions to wholly understand an experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.disinformation-research","kind":"concept","label":"Disinformation research","sources":[{"id":"wikipedia.article.disinformation-research","title":"English Wikipedia article: Disinformation research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disinformation+research"}],"status":"reported","summary":"English Wikipedia (article \"Disinformation research\", CC BY-SA 4.0) states: Disinformation research, also called disinformation studies or misinformation research, is an academic research field that aims to understand and counter disinformation, misinformation, and malinformation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.backcasting","kind":"concept","label":"Backcasting","sources":[{"id":"wikipedia.article.backcasting","title":"English Wikipedia article: Backcasting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backcasting"}],"status":"reported","summary":"English Wikipedia (article \"Backcasting\", CC BY-SA 4.0) states: Backcasting is a planning method that starts with defining a desirable future and then works backwards to identify policies and programs that will connect that specified future to the present.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.benacerraf-s-identification-problem","kind":"concept","label":"Benacerraf's identification problem","sources":[{"id":"wikipedia.article.benacerraf-s-identification-problem","title":"English Wikipedia article: Benacerraf's identification problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Benacerraf%27s+identification+problem"}],"status":"reported","summary":"English Wikipedia (article \"Benacerraf's identification problem\", CC BY-SA 4.0) states: In the philosophy of mathematics, Benacerraf's identification problem is a philosophical argument developed by Paul Benacerraf against set-theoretic Platonism and published in 1965 in an article entitled \"What Numbers Could Not Be\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.average-treatment-effect","kind":"concept","label":"Average treatment effect","sources":[{"id":"wikipedia.article.average-treatment-effect","title":"English Wikipedia article: Average treatment effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Average+treatment+effect"}],"status":"reported","summary":"English Wikipedia (article \"Average treatment effect\", CC BY-SA 4.0) states: The average treatment effect (ATE) is a measure used to compare treatments (or interventions) in randomized experiments, evaluation of policy interventions, and medical trials.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.decolonization-of-knowledge","kind":"concept","label":"Decolonization of knowledge","sources":[{"id":"wikipedia.article.decolonization-of-knowledge","title":"English Wikipedia article: Decolonization of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decolonization+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Decolonization of knowledge\", CC BY-SA 4.0) states: Decolonization of knowledge (also epistemic decolonization or epistemological decolonization) is a concept advanced in decolonial scholarship that critiques the perceived hegemony of Western knowledge systems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.actor-observer-asymmetry","kind":"concept","label":"Actor–observer asymmetry","sources":[{"id":"wikipedia.article.actor-observer-asymmetry","title":"English Wikipedia article: Actor–observer asymmetry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actor%E2%80%93observer+asymmetry"}],"status":"reported","summary":"English Wikipedia (article \"Actor–observer asymmetry\", CC BY-SA 4.0) states: Actor–observer asymmetry (also actor–observer bias or actor–observer difference) is a bias one exhibits when forming attributions about the behavior of others or themselves.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.further-research-is-needed","kind":"concept","label":"Further research is needed","sources":[{"id":"wikipedia.article.further-research-is-needed","title":"English Wikipedia article: Further research is needed","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Further+research+is+needed"}],"status":"reported","summary":"English Wikipedia (article \"Further research is needed\", CC BY-SA 4.0) states: \"Further research is needed\" (FRIN), \"more research is needed\" and other variants of similar phrases are commonly used in research papers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analysis-of-competing-hypotheses","kind":"concept","label":"Analysis of competing hypotheses","sources":[{"id":"wikipedia.article.analysis-of-competing-hypotheses","title":"English Wikipedia article: Analysis of competing hypotheses","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analysis+of+competing+hypotheses"}],"status":"reported","summary":"English Wikipedia (article \"Analysis of competing hypotheses\", CC BY-SA 4.0) states: The analysis of competing hypotheses (ACH) is a methodology for evaluating multiple competing hypotheses for observed data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.autonomy-of-syntax","kind":"concept","label":"Autonomy of syntax","sources":[{"id":"wikipedia.article.autonomy-of-syntax","title":"English Wikipedia article: Autonomy of syntax","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomy+of+syntax"}],"status":"reported","summary":"English Wikipedia (article \"Autonomy of syntax\", CC BY-SA 4.0) states: In linguistics, the autonomy of syntax is the assumption that syntax is arbitrary and self-contained with respect to meaning: semantics, pragmatics, discourse function, and other factors external to language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.android-epistemology","kind":"concept","label":"Android epistemology","sources":[{"id":"wikipedia.article.android-epistemology","title":"English Wikipedia article: Android epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Android+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Android epistemology\", CC BY-SA 4.0) states: Android epistemology is an approach to epistemology considering the space of possible machines and their capacities for knowledge, beliefs, attitudes, desires and for action in accord with their mental states.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.always-already","kind":"concept","label":"Always already","sources":[{"id":"wikipedia.article.always-already","title":"English Wikipedia article: Always already","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Always+already"}],"status":"reported","summary":"English Wikipedia (article \"Always already\", CC BY-SA 4.0) states: In philosophy, always already describes the perception of phenomena by the mind of an observer.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherence-theory-of-truth","kind":"concept","label":"Coherence theory of truth","sources":[{"id":"wikipedia.article.coherence-theory-of-truth","title":"English Wikipedia article: Coherence theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherence+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Coherence theory of truth\", CC BY-SA 4.0) states: In epistemology, the coherence theory of truth is a family of philosophical theories that characterize truth as a property of whole systems of propositions that can be ascribed to individual propositions only derivatively according to their coherence with the whole.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antireductionism","kind":"concept","label":"Antireductionism","sources":[{"id":"wikipedia.article.antireductionism","title":"English Wikipedia article: Antireductionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antireductionism"}],"status":"reported","summary":"English Wikipedia (article \"Antireductionism\", CC BY-SA 4.0) states: Antireductionism is the position in science and metaphysics that stands in contrast to reductionism (anti-holism) by advocating that not all properties of a system can be explained in terms of its constituent parts and their interactions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.clinical-study-design","kind":"concept","label":"Clinical study design","sources":[{"id":"wikipedia.article.clinical-study-design","title":"English Wikipedia article: Clinical study design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clinical+study+design"}],"status":"reported","summary":"English Wikipedia (article \"Clinical study design\", CC BY-SA 4.0) states: Clinical study design is the formulation of clinical trials and other experiments, as well as observational studies, in medical research involving human beings and involving clinical aspects, including epidemiology .","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.both-and-reasoning","kind":"concept","label":"Both/and reasoning","sources":[{"id":"wikipedia.article.both-and-reasoning","title":"English Wikipedia article: Both/and reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Both%2Fand+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Both/and reasoning\", CC BY-SA 4.0) states: Both/and is an academic concept which refers to a form of reasoning which resists binary or either/or styles of thinking.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-ad-baculum","kind":"concept","label":"Argumentum ad baculum","sources":[{"id":"wikipedia.article.argumentum-ad-baculum","title":"English Wikipedia article: Argumentum ad baculum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+ad+baculum"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum ad baculum\", CC BY-SA 4.0) states: Argumentum ad baculum (Latin for \"argument to the cudgel\" or \"appeal to the stick\") is a type of argument made when one attempts to appeal to force to bring about the acceptance of a conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inventor-s-paradox","kind":"concept","label":"Inventor's paradox","sources":[{"id":"wikipedia.article.inventor-s-paradox","title":"English Wikipedia article: Inventor's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inventor%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Inventor's paradox\", CC BY-SA 4.0) states: The inventor's paradox is a phenomenon that occurs in seeking a solution to a given problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.canberra-plan","kind":"concept","label":"Canberra Plan","sources":[{"id":"wikipedia.article.canberra-plan","title":"English Wikipedia article: Canberra Plan","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Canberra+Plan"}],"status":"reported","summary":"English Wikipedia (article \"Canberra Plan\", CC BY-SA 4.0) states: In philosophy, the Canberra Plan is a contemporary program of methodology and analysis which answers questions about what the world is like according to physics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.axiom-of-reducibility","kind":"concept","label":"Axiom of reducibility","sources":[{"id":"wikipedia.article.axiom-of-reducibility","title":"English Wikipedia article: Axiom of reducibility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiom+of+reducibility"}],"status":"reported","summary":"English Wikipedia (article \"Axiom of reducibility\", CC BY-SA 4.0) states: The axiom of reducibility was introduced by Bertrand Russell in the early 20th century as part of his ramified theory of types.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circular-definition","kind":"concept","label":"Circular definition","sources":[{"id":"wikipedia.article.circular-definition","title":"English Wikipedia article: Circular definition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circular+definition"}],"status":"reported","summary":"English Wikipedia (article \"Circular definition\", CC BY-SA 4.0) states: A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defeasibility-linguistics","kind":"concept","label":"Defeasibility (linguistics)","sources":[{"id":"wikipedia.article.defeasibility-linguistics","title":"English Wikipedia article: Defeasibility (linguistics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defeasibility+%28linguistics%29"}],"status":"reported","summary":"English Wikipedia (article \"Defeasibility (linguistics)\", CC BY-SA 4.0) states: In the linguistic field of pragmatics, an inference is said to be defeasible or cancellable if it can be made to disappear by the addition of another statement, or an appropriate context.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blockhead-thought-experiment","kind":"concept","label":"Blockhead (thought experiment)","sources":[{"id":"wikipedia.article.blockhead-thought-experiment","title":"English Wikipedia article: Blockhead (thought experiment)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blockhead+%28thought+experiment%29"}],"status":"reported","summary":"English Wikipedia (article \"Blockhead (thought experiment)\", CC BY-SA 4.0) states: Blockhead is a theoretical computer system invented as part of a thought experiment by philosopher Ned Block, which appeared in a paper titled \"Psychologism and Behaviorism\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bentley-s-paradox","kind":"concept","label":"Bentley's paradox","sources":[{"id":"wikipedia.article.bentley-s-paradox","title":"English Wikipedia article: Bentley's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bentley%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Bentley's paradox\", CC BY-SA 4.0) states: In cosmology, Bentley's paradox, also known as Seeliger's paradox, Bentley–Seeliger paradox or Neumann–Seeliger paradox points to a problem occurring when Newton's theory of gravitation is applied to the universe.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecology-of-contexts","kind":"concept","label":"Ecology of contexts","sources":[{"id":"wikipedia.article.ecology-of-contexts","title":"English Wikipedia article: Ecology of contexts","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecology+of+contexts"}],"status":"reported","summary":"English Wikipedia (article \"Ecology of contexts\", CC BY-SA 4.0) states: The ecology of contexts is a term used in many disciplines and refers to the dynamic interplay of contexts and demands that constrain and define an entity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-bias","kind":"concept","label":"Adaptive bias","sources":[{"id":"wikipedia.article.adaptive-bias","title":"English Wikipedia article: Adaptive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive bias\", CC BY-SA 4.0) states: Adaptive bias is the idea that the human brain has evolved to reason adaptively, rather than truthfully or even rationally, and that cognitive bias may have evolved as a mechanism to reduce the overall cost of cognitive errors as opposed to merely reducing the number of cognitive errors, when faced with making a decision under conditions of uncertainty.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.consistent-heuristic","kind":"concept","label":"Consistent heuristic","sources":[{"id":"wikipedia.article.consistent-heuristic","title":"English Wikipedia article: Consistent heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consistent+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Consistent heuristic\", CC BY-SA 4.0) states: In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighbouring vertex to the goal, plus the cost of reaching that neighbour.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anfinsen-s-dogma","kind":"concept","label":"Anfinsen's dogma","sources":[{"id":"wikipedia.article.anfinsen-s-dogma","title":"English Wikipedia article: Anfinsen's dogma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anfinsen%27s+dogma"}],"status":"reported","summary":"English Wikipedia (article \"Anfinsen's dogma\", CC BY-SA 4.0) states: Anfinsen's dogma, also known as the thermodynamic hypothesis, is a postulate in molecular biology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apoha","kind":"concept","label":"Apoha","sources":[{"id":"wikipedia.article.apoha","title":"English Wikipedia article: Apoha","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apoha"}],"status":"reported","summary":"English Wikipedia (article \"Apoha\", CC BY-SA 4.0) states: Apoha (Sanskrit: अपोह) is a Buddhist epistemological theory first proposed by the philosopher Dignāga (c. 480 – c. 540 CE) in his seminal text Pramāṇasamuccaya.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ambiguity","kind":"concept","label":"Ambiguity","sources":[{"id":"wikipedia.article.ambiguity","title":"English Wikipedia article: Ambiguity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambiguity"}],"status":"reported","summary":"English Wikipedia (article \"Ambiguity\", CC BY-SA 4.0) states: Ambiguity, is a state in which the meaning of a phrase, statement, situation, or resolution is not explicitly defined, making for several plausible interpretations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherentism","kind":"concept","label":"Coherentism","sources":[{"id":"wikipedia.article.coherentism","title":"English Wikipedia article: Coherentism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherentism"}],"status":"reported","summary":"English Wikipedia (article \"Coherentism\", CC BY-SA 4.0) states: In epistemology, there are two types of coherentism: the coherence theory of truth, and the coherence theory of justification (also known as epistemic coherentism).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.antiscience","kind":"concept","label":"Antiscience","sources":[{"id":"wikipedia.article.antiscience","title":"English Wikipedia article: Antiscience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiscience"}],"status":"reported","summary":"English Wikipedia (article \"Antiscience\", CC BY-SA 4.0) states: Antiscience is a set of attitudes and a form of anti-intellectualism that involves a rejection of science and the scientific method.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-rupture","kind":"concept","label":"Epistemological rupture","sources":[{"id":"wikipedia.article.epistemological-rupture","title":"English Wikipedia article: Epistemological rupture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+rupture"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological rupture\", CC BY-SA 4.0) states: Epistemological rupture (or epistemological break) is a notion introduced in 1938 by French philosopher Gaston Bachelard, and later used by Louis Althusser.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.pragmatic-theory-of-truth","kind":"concept","label":"Pragmatic theory of truth","sources":[{"id":"wikipedia.article.pragmatic-theory-of-truth","title":"English Wikipedia article: Pragmatic theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pragmatic+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Pragmatic theory of truth\", CC BY-SA 4.0) states: A pragmatic theory of truth is a theory of truth within the philosophies of pragmatism and pragmaticism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-closure","kind":"concept","label":"Causal closure","sources":[{"id":"wikipedia.article.causal-closure","title":"English Wikipedia article: Causal closure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+closure"}],"status":"reported","summary":"English Wikipedia (article \"Causal closure\", CC BY-SA 4.0) states: Physical causal closure is a metaphysical theory about the nature of causation in the physical realm with significant ramifications in the study of metaphysics and the mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explicit-knowledge","kind":"concept","label":"Explicit knowledge","sources":[{"id":"wikipedia.article.explicit-knowledge","title":"English Wikipedia article: Explicit knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explicit+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Explicit knowledge\", CC BY-SA 4.0) states: Explicit knowledge (also expressive knowledge) is knowledge that can be readily articulated, conceptualized, codified, formalized, stored and accessed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-dissonance","kind":"concept","label":"Cognitive dissonance","sources":[{"id":"wikipedia.article.cognitive-dissonance","title":"English Wikipedia article: Cognitive dissonance","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+dissonance"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive dissonance\", CC BY-SA 4.0) states: In the field of psychology, cognitive dissonance is described as a mental phenomenon in which people unknowingly or subconsciously hold fundamentally conflicting cognitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.case-based-reasoning","kind":"concept","label":"Case-based reasoning","sources":[{"id":"wikipedia.article.case-based-reasoning","title":"English Wikipedia article: Case-based reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Case-based+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Case-based reasoning\", CC BY-SA 4.0) states: Case-based reasoning (CBR), broadly construed, is the process of solving new problems based on the solutions of similar past problems.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.generalization","kind":"concept","label":"Generalization","sources":[{"id":"wikipedia.article.generalization","title":"English Wikipedia article: Generalization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Generalization"}],"status":"reported","summary":"English Wikipedia (article \"Generalization\", CC BY-SA 4.0) states: A generalization is a form of abstraction whereby common properties of specific instances are formulated as general concepts or claims.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argumentum-ad-captandum","kind":"concept","label":"Argumentum ad captandum","sources":[{"id":"wikipedia.article.argumentum-ad-captandum","title":"English Wikipedia article: Argumentum ad captandum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argumentum+ad+captandum"}],"status":"reported","summary":"English Wikipedia (article \"Argumentum ad captandum\", CC BY-SA 4.0) states: In rhetoric, an argumentum ad captandum, \"for capturing\" the gullibility of the naïve among the listeners or readers, is an unsound, specious argument designed to appeal to the emotions rather than to the mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.computational-philosophy","kind":"concept","label":"Computational philosophy","sources":[{"id":"wikipedia.article.computational-philosophy","title":"English Wikipedia article: Computational philosophy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computational+philosophy"}],"status":"reported","summary":"English Wikipedia (article \"Computational philosophy\", CC BY-SA 4.0) states: Computational philosophy or digital philosophy is the use of computational techniques in philosophy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.calculus-ratiocinator","kind":"concept","label":"Calculus ratiocinator","sources":[{"id":"wikipedia.article.calculus-ratiocinator","title":"English Wikipedia article: Calculus ratiocinator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus+ratiocinator"}],"status":"reported","summary":"English Wikipedia (article \"Calculus ratiocinator\", CC BY-SA 4.0) states: The calculus ratiocinator is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned characteristica universalis, a universal conceptual language.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.issue-based-information-system","kind":"concept","label":"Issue-based information system","sources":[{"id":"wikipedia.article.issue-based-information-system","title":"English Wikipedia article: Issue-based information system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Issue-based+information+system"}],"status":"reported","summary":"English Wikipedia (article \"Issue-based information system\", CC BY-SA 4.0) states: The issue-based information system (IBIS) is an argumentation-based approach to clarifying wicked problems—complex, ill-defined problems that involve multiple stakeholders.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-democracy","kind":"concept","label":"Epistemic democracy","sources":[{"id":"wikipedia.article.epistemic-democracy","title":"English Wikipedia article: Epistemic democracy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+democracy"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic democracy\", CC BY-SA 4.0) states: Epistemic democracy refers to a range of views in political science and philosophy which see the value of democracy as based, at least in part, on its ability to make good or correct decisions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.additive-bias","kind":"concept","label":"Additive bias","sources":[{"id":"wikipedia.article.additive-bias","title":"English Wikipedia article: Additive bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+bias"}],"status":"reported","summary":"English Wikipedia (article \"Additive bias\", CC BY-SA 4.0) states: Additive bias is a cognitive urge or tendency of human beings facing problems to add resources instead of taking or subtracting.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-heuristic","kind":"concept","label":"Constructive heuristic","sources":[{"id":"wikipedia.article.constructive-heuristic","title":"English Wikipedia article: Constructive heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Constructive heuristic\", CC BY-SA 4.0) states: A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chronotope","kind":"concept","label":"Chronotope","sources":[{"id":"wikipedia.article.chronotope","title":"English Wikipedia article: Chronotope","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chronotope"}],"status":"reported","summary":"English Wikipedia (article \"Chronotope\", CC BY-SA 4.0) states: In literary theory and philosophy of language, the chronotope is how configurations of time and space are represented in language and discourse.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appeal-to-the-stone","kind":"concept","label":"Appeal to the stone","sources":[{"id":"wikipedia.article.appeal-to-the-stone","title":"English Wikipedia article: Appeal to the stone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appeal+to+the+stone"}],"status":"reported","summary":"English Wikipedia (article \"Appeal to the stone\", CC BY-SA 4.0) states: Appeal to the stone, also known as argumentum ad lapidem, is a logical fallacy that dismisses an argument as untrue or absurd.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-synthetic-distinction","kind":"concept","label":"Analytic–synthetic distinction","sources":[{"id":"wikipedia.article.analytic-synthetic-distinction","title":"English Wikipedia article: Analytic–synthetic distinction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic%E2%80%93synthetic+distinction"}],"status":"reported","summary":"English Wikipedia (article \"Analytic–synthetic distinction\", CC BY-SA 4.0) states: The analytic–synthetic distinction is a semantic distinction used primarily in philosophy to distinguish between propositions (in particular, statements that are affirmative subject–predicate judgments) that are of two types: analytic propositions and synthetic propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.conciliationism","kind":"concept","label":"Conciliationism","sources":[{"id":"wikipedia.article.conciliationism","title":"English Wikipedia article: Conciliationism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conciliationism"}],"status":"reported","summary":"English Wikipedia (article \"Conciliationism\", CC BY-SA 4.0) states: Conciliationism is a view in the epistemology of disagreement according to which one should revise one's opinions closer to one's epistemic peers in the face of epistemic disagreement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explanatory-power","kind":"concept","label":"Explanatory power","sources":[{"id":"wikipedia.article.explanatory-power","title":"English Wikipedia article: Explanatory power","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explanatory+power"}],"status":"reported","summary":"English Wikipedia (article \"Explanatory power\", CC BY-SA 4.0) states: Explanatory power is the ability of a hypothesis or theory to explain the subject matter effectively to which it pertains.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.redundancy-theory-of-truth","kind":"concept","label":"Redundancy theory of truth","sources":[{"id":"wikipedia.article.redundancy-theory-of-truth","title":"English Wikipedia article: Redundancy theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Redundancy+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Redundancy theory of truth\", CC BY-SA 4.0) states: According to the redundancy theory of truth (also known as the disquotational theory of truth), asserting that a statement is true is completely equivalent to asserting the statement itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cross-impact-analysis","kind":"concept","label":"Cross impact analysis","sources":[{"id":"wikipedia.article.cross-impact-analysis","title":"English Wikipedia article: Cross impact analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cross+impact+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Cross impact analysis\", CC BY-SA 4.0) states: Cross-impact analysis is a methodology developed by Theodore J. Gordon and Olaf Helmer in 1966 to help determine how relationships between events would impact resulting events and reduce uncertainty in the future.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.forbidden-knowledge","kind":"concept","label":"Forbidden knowledge","sources":[{"id":"wikipedia.article.forbidden-knowledge","title":"English Wikipedia article: Forbidden knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Forbidden+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Forbidden knowledge\", CC BY-SA 4.0) states: Forbidden knowledge is information, sometimes in the form of forbidden books, to which access is restricted or deprecated for political or religious reasons.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.communal-reinforcement","kind":"concept","label":"Communal reinforcement","sources":[{"id":"wikipedia.article.communal-reinforcement","title":"English Wikipedia article: Communal reinforcement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Communal+reinforcement"}],"status":"reported","summary":"English Wikipedia (article \"Communal reinforcement\", CC BY-SA 4.0) states: Communal reinforcement is a social phenomenon in which a concept or idea is repeatedly asserted in a community, regardless of whether sufficient empirical evidence has been presented to support it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-reasoning","kind":"concept","label":"Causal reasoning","sources":[{"id":"wikipedia.article.causal-reasoning","title":"English Wikipedia article: Causal reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Causal reasoning\", CC BY-SA 4.0) states: Causal reasoning is the process of identifying causality: the relationship between a cause and its effect.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.imperfect-induction","kind":"concept","label":"Imperfect induction","sources":[{"id":"wikipedia.article.imperfect-induction","title":"English Wikipedia article: Imperfect induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Imperfect+induction"}],"status":"reported","summary":"English Wikipedia (article \"Imperfect induction\", CC BY-SA 4.0) states: Imperfect induction is the process of inferring from a sample of a group to what is characteristic of the whole group.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.conceptual-engineering","kind":"field","label":"Conceptual engineering","sources":[{"id":"wikipedia.article.conceptual-engineering","title":"English Wikipedia article: Conceptual engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conceptual+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Conceptual engineering\", CC BY-SA 4.0) states: Conceptual engineering is a field in analytic philosophy that focuses on how to best assess and improve our conceptual schemes and repertoires.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experiment","kind":"concept","label":"Experiment","sources":[{"id":"wikipedia.article.experiment","title":"English Wikipedia article: Experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experiment"}],"status":"reported","summary":"English Wikipedia (article \"Experiment\", CC BY-SA 4.0) states: An experiment is a procedure carried out to support or refute a hypothesis, or determine the efficacy or likelihood of something previously untried.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.braitenberg-vehicle","kind":"concept","label":"Braitenberg vehicle","sources":[{"id":"wikipedia.article.braitenberg-vehicle","title":"English Wikipedia article: Braitenberg vehicle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braitenberg+vehicle"}],"status":"reported","summary":"English Wikipedia (article \"Braitenberg vehicle\", CC BY-SA 4.0) states: A Braitenberg vehicle is an imaginary robot or creature used as the subject of a thought experiment to study embodied cognition.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chinese-room","kind":"concept","label":"Chinese room","sources":[{"id":"wikipedia.article.chinese-room","title":"English Wikipedia article: Chinese room","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chinese+room"}],"status":"reported","summary":"English Wikipedia (article \"Chinese room\", CC BY-SA 4.0) states: The Chinese room argument holds that a computer executing a program cannot have a mind, understanding, or consciousness, regardless of how intelligently or human-like the program may make the computer behave.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bracketing-paradox","kind":"concept","label":"Bracketing paradox","sources":[{"id":"wikipedia.article.bracketing-paradox","title":"English Wikipedia article: Bracketing paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bracketing+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Bracketing paradox\", CC BY-SA 4.0) states: In linguistic morphology, the bracketing paradox concerns morphologically complex words which have more than one analysis, or bracketing, e.g., one for phonology and one for semantics, and the two are not compatible, or brackets do not align.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aesthetic-usability-effect","kind":"concept","label":"Aesthetic–usability effect","sources":[{"id":"wikipedia.article.aesthetic-usability-effect","title":"English Wikipedia article: Aesthetic–usability effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aesthetic%E2%80%93usability+effect"}],"status":"reported","summary":"English Wikipedia (article \"Aesthetic–usability effect\", CC BY-SA 4.0) states: The aesthetic–usability effect describes a paradox that people perceive more aesthetic designs as much more intuitive than those considered to be less aesthetically pleasing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contagion-heuristic","kind":"concept","label":"Contagion heuristic","sources":[{"id":"wikipedia.article.contagion-heuristic","title":"English Wikipedia article: Contagion heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contagion+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Contagion heuristic\", CC BY-SA 4.0) states: The contagion heuristic is a psychological heuristic which follows the law of contagion and the law of similarity, leading people to avoid contact with people or objects viewed as \"contaminated\" by previous contact with someone or something viewed as bad—or, less often, to seek contact with objects that have been in contact with people or things considered good.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.access-consciousness","kind":"concept","label":"Access Consciousness","sources":[{"id":"wikipedia.article.access-consciousness","title":"English Wikipedia article: Access Consciousness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Access+Consciousness"}],"status":"reported","summary":"English Wikipedia (article \"Access Consciousness\", CC BY-SA 4.0) states: Access Consciousness is a pseudoscientific New Age movement founded by Gary Douglas in 1990 in Santa Barbara, California, initially called Access Energy Transformation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.augustinian-hypothesis","kind":"concept","label":"Augustinian hypothesis","sources":[{"id":"wikipedia.article.augustinian-hypothesis","title":"English Wikipedia article: Augustinian hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Augustinian+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Augustinian hypothesis\", CC BY-SA 4.0) states: The Augustinian hypothesis (sometimes referred to as the Augustinian Proposal) is a solution to the synoptic problem, which concerns the origin of the canonical Gospels in the New Testament.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.code-talker-paradox","kind":"concept","label":"Code-talker paradox","sources":[{"id":"wikipedia.article.code-talker-paradox","title":"English Wikipedia article: Code-talker paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Code-talker+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Code-talker paradox\", CC BY-SA 4.0) states: A code-talker paradox is a situation in which a language prevents communication.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.applied-epistemology","kind":"concept","label":"Applied epistemology","sources":[{"id":"wikipedia.article.applied-epistemology","title":"English Wikipedia article: Applied epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Applied epistemology\", CC BY-SA 4.0) states: Applied epistemology refers to the study that determines whether the systems of investigation that seek the truth lead to true beliefs about the world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anthropic-principle","kind":"concept","label":"Anthropic principle","sources":[{"id":"wikipedia.article.anthropic-principle","title":"English Wikipedia article: Anthropic principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anthropic+principle"}],"status":"reported","summary":"English Wikipedia (article \"Anthropic principle\", CC BY-SA 4.0) states: In cosmology and philosophy of science, the anthropic principle (also known as the observation selection effect) is the proposition that the range of possible observations made about a universe is limited by the fact that observations can only be made if that universe is capable of developing observers in the first place.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructivism-philosophy-of-science","kind":"concept","label":"Constructivism (philosophy of science)","sources":[{"id":"wikipedia.article.constructivism-philosophy-of-science","title":"English Wikipedia article: Constructivism (philosophy of science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructivism+%28philosophy+of+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Constructivism (philosophy of science)\", CC BY-SA 4.0) states: Constructionism is a view in the philosophy of science that maintains that scientific knowledge is constructed by the scientific community, which seeks to measure and construct models of the natural world.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.first-principle","kind":"concept","label":"First principle","sources":[{"id":"wikipedia.article.first-principle","title":"English Wikipedia article: First principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=First+principle"}],"status":"reported","summary":"English Wikipedia (article \"First principle\", CC BY-SA 4.0) states: In philosophy and science, a first principle is a basic proposition or assumption that cannot be deduced from any other proposition or assumption.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-model","kind":"concept","label":"Causal model","sources":[{"id":"wikipedia.article.causal-model","title":"English Wikipedia article: Causal model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+model"}],"status":"reported","summary":"English Wikipedia (article \"Causal model\", CC BY-SA 4.0) states: In metaphysics and statistics, a causal model (also called a structural causal model) is a conceptual model that represents the causal mechanisms of a system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inductionism","kind":"concept","label":"Inductionism","sources":[{"id":"wikipedia.article.inductionism","title":"English Wikipedia article: Inductionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inductionism"}],"status":"reported","summary":"English Wikipedia (article \"Inductionism\", CC BY-SA 4.0) states: Inductionism is the scientific philosophy where laws are \"induced\" from sets of data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dilemma","kind":"concept","label":"Dilemma","sources":[{"id":"wikipedia.article.dilemma","title":"English Wikipedia article: Dilemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dilemma"}],"status":"reported","summary":"English Wikipedia (article \"Dilemma\", CC BY-SA 4.0) states: A dilemma (from Ancient Greek δίλημμα (dílēmma) 'double proposition') is a problem offering two possibilities, neither of which is unambiguously acceptable or preferable.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.instrumentalism","kind":"concept","label":"Instrumentalism","sources":[{"id":"wikipedia.article.instrumentalism","title":"English Wikipedia article: Instrumentalism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Instrumentalism"}],"status":"reported","summary":"English Wikipedia (article \"Instrumentalism\", CC BY-SA 4.0) states: In philosophy of science and in epistemology, instrumentalism is a methodological view that ideas are useful instruments, and that the worth of an idea is based on how effective it is in explaining and predicting natural phenomena.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.canonical-form","kind":"concept","label":"Canonical form","sources":[{"id":"wikipedia.article.canonical-form","title":"English Wikipedia article: Canonical form","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Canonical+form"}],"status":"reported","summary":"English Wikipedia (article \"Canonical form\", CC BY-SA 4.0) states: In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.compossibility","kind":"concept","label":"Compossibility","sources":[{"id":"wikipedia.article.compossibility","title":"English Wikipedia article: Compossibility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compossibility"}],"status":"reported","summary":"English Wikipedia (article \"Compossibility\", CC BY-SA 4.0) states: Compossibility is a philosophical concept from Gottfried Wilhelm Leibniz.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.allegory-of-the-cave","kind":"concept","label":"Allegory of the cave","sources":[{"id":"wikipedia.article.allegory-of-the-cave","title":"English Wikipedia article: Allegory of the cave","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Allegory+of+the+cave"}],"status":"reported","summary":"English Wikipedia (article \"Allegory of the cave\", CC BY-SA 4.0) states: The allegory of the cave is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a, Book VII) to compare \"the effect of education (παιδεία) and the lack of it on our nature\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.feminist-epistemology","kind":"concept","label":"Feminist epistemology","sources":[{"id":"wikipedia.article.feminist-epistemology","title":"English Wikipedia article: Feminist epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Feminist+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Feminist epistemology\", CC BY-SA 4.0) states: Feminist epistemology is an examination of epistemology from a feminist standpoint.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apriorism","kind":"concept","label":"Apriorism","sources":[{"id":"wikipedia.article.apriorism","title":"English Wikipedia article: Apriorism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apriorism"}],"status":"reported","summary":"English Wikipedia (article \"Apriorism\", CC BY-SA 4.0) states: Apriorism (sometimes a priorism or a-priorism) in modern times, refers to epistemological positions that assume that certain knowledge can be justified without reference to experience, or, in a narrower sense, that knowledge is entirely possible without any experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apperception","kind":"concept","label":"Apperception","sources":[{"id":"wikipedia.article.apperception","title":"English Wikipedia article: Apperception","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apperception"}],"status":"reported","summary":"English Wikipedia (article \"Apperception\", CC BY-SA 4.0) states: Apperception (from the Latin ad-, \"to, toward\" and percipere, \"to perceive, gain, secure, learn, or feel\") is any of several aspects of perception and consciousness in such fields as psychology, philosophy and epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contrastivism","kind":"concept","label":"Contrastivism","sources":[{"id":"wikipedia.article.contrastivism","title":"English Wikipedia article: Contrastivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contrastivism"}],"status":"reported","summary":"English Wikipedia (article \"Contrastivism\", CC BY-SA 4.0) states: Contrastivism, or the contrast theory of meaning, is an epistemological theory proposed by Jonathan Schaffer that suggests that knowledge attributions have a ternary structure of the form 'S knows that p rather than q'.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.gestell","kind":"concept","label":"Gestell","sources":[{"id":"wikipedia.article.gestell","title":"English Wikipedia article: Gestell","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gestell"}],"status":"reported","summary":"English Wikipedia (article \"Gestell\", CC BY-SA 4.0) states: Gestell (or Ge-stell, translated as \"Enframing\" or \"positioning\") is a German word used by twentieth-century German philosopher Martin Heidegger to describe what lies behind or beneath modern technology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.semantic-theory-of-truth","kind":"concept","label":"Semantic theory of truth","sources":[{"id":"wikipedia.article.semantic-theory-of-truth","title":"English Wikipedia article: Semantic theory of truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Semantic+theory+of+truth"}],"status":"reported","summary":"English Wikipedia (article \"Semantic theory of truth\", CC BY-SA 4.0) states: A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.data-sharing","kind":"concept","label":"Data sharing","sources":[{"id":"wikipedia.article.data-sharing","title":"English Wikipedia article: Data sharing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+sharing"}],"status":"reported","summary":"English Wikipedia (article \"Data sharing\", CC BY-SA 4.0) states: Data sharing denotes the dissemination of research datasets to enable access and use by other investigators.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.general-knowledge","kind":"concept","label":"General knowledge","sources":[{"id":"wikipedia.article.general-knowledge","title":"English Wikipedia article: General knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=General+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"General knowledge\", CC BY-SA 4.0) states: General knowledge is information that has been accumulated over time through various media and sources.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.credulity","kind":"concept","label":"Credulity","sources":[{"id":"wikipedia.article.credulity","title":"English Wikipedia article: Credulity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Credulity"}],"status":"reported","summary":"English Wikipedia (article \"Credulity\", CC BY-SA 4.0) states: Credulity is a person's willingness or ability to believe that a statement is true, especially on minimal or uncertain evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circumstantial-evidence","kind":"concept","label":"Circumstantial evidence","sources":[{"id":"wikipedia.article.circumstantial-evidence","title":"English Wikipedia article: Circumstantial evidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circumstantial+evidence"}],"status":"reported","summary":"English Wikipedia (article \"Circumstantial evidence\", CC BY-SA 4.0) states: Circumstantial evidence is evidence that relies on an inference to connect it to a conclusion of fact, such as a fingerprint at the scene of a crime.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.begging-the-question","kind":"concept","label":"Begging the question","sources":[{"id":"wikipedia.article.begging-the-question","title":"English Wikipedia article: Begging the question","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Begging+the+question"}],"status":"reported","summary":"English Wikipedia (article \"Begging the question\", CC BY-SA 4.0) states: In classical rhetoric and logic, begging the question (Latin: petitio principii), or assuming the conclusion, is an informal fallacy that occurs when an argument's premises assume the truth of the conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.thought-experiment","kind":"concept","label":"Thought experiment","sources":[{"id":"wikipedia.article.thought-experiment","title":"English Wikipedia article: Thought experiment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Thought+experiment"}],"status":"reported","summary":"English Wikipedia (article \"Thought experiment\", CC BY-SA 4.0) states: A thought experiment is an imaginary scenario that is meant to elucidate or test an argument or theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.diairesis","kind":"concept","label":"Diairesis","sources":[{"id":"wikipedia.article.diairesis","title":"English Wikipedia article: Diairesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diairesis"}],"status":"reported","summary":"English Wikipedia (article \"Diairesis\", CC BY-SA 4.0) states: Diairesis (Ancient Greek: διαίρεσις, romanized: diaíresis, \"division\") is a form of classification used in ancient (especially Platonic) logic that serves to systematize concepts and come to definitions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.conditional-logic","kind":"concept","label":"Conditional logic","sources":[{"id":"wikipedia.article.conditional-logic","title":"English Wikipedia article: Conditional logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conditional+logic"}],"status":"reported","summary":"English Wikipedia (article \"Conditional logic\", CC BY-SA 4.0) states: Conditional logic (also: the logic of conditionals) refers to a family of formal systems for reasoning with statements of the form \"if A, (then) B\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.virtue-epistemology","kind":"concept","label":"Virtue epistemology","sources":[{"id":"wikipedia.article.virtue-epistemology","title":"English Wikipedia article: Virtue epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Virtue+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Virtue epistemology\", CC BY-SA 4.0) states: Virtue epistemology is a philosophical approach to epistemology that stresses the importance of intellectual and specifically epistemic virtues.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.genetic-epistemology","kind":"field","label":"Genetic epistemology","sources":[{"id":"wikipedia.article.genetic-epistemology","title":"English Wikipedia article: Genetic epistemology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Genetic+epistemology"}],"status":"reported","summary":"English Wikipedia (article \"Genetic epistemology\", CC BY-SA 4.0) states: Genetic epistemology or 'developmental theory of knowledge' is a study of the origins (genesis) of knowledge (epistemology) established by Swiss psychologist Jean Piaget.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ambiguity-effect","kind":"concept","label":"Ambiguity effect","sources":[{"id":"wikipedia.article.ambiguity-effect","title":"English Wikipedia article: Ambiguity effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambiguity+effect"}],"status":"reported","summary":"English Wikipedia (article \"Ambiguity effect\", CC BY-SA 4.0) states: The ambiguity effect is a cognitive tendency where decision making is affected by a lack of information, or \"ambiguity\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.action-type-approach","kind":"concept","label":"Action type approach","sources":[{"id":"wikipedia.article.action-type-approach","title":"English Wikipedia article: Action type approach","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action+type+approach"}],"status":"reported","summary":"English Wikipedia (article \"Action type approach\", CC BY-SA 4.0) states: The action type approach is a series of mental exercises—variously described as \"pseudoscientific\", \"empirically challenged\", or a \"neuromyth\"— that purport to increase physical performance in athletes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.concept-horse-paradox","kind":"concept","label":"Concept horse paradox","sources":[{"id":"wikipedia.article.concept-horse-paradox","title":"English Wikipedia article: Concept horse paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Concept+horse+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Concept horse paradox\", CC BY-SA 4.0) states: The concept \"horse\" paradox (also known as the concept horse problem or Frege's concept horse paradox; German: der Begriff Pferd) is a problem in the philosophy of language and philosophy of logic arising from Gottlob Frege's distinction between concept and object.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aristotle-s-theory-of-universals","kind":"concept","label":"Aristotle's theory of universals","sources":[{"id":"wikipedia.article.aristotle-s-theory-of-universals","title":"English Wikipedia article: Aristotle's theory of universals","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aristotle%27s+theory+of+universals"}],"status":"reported","summary":"English Wikipedia (article \"Aristotle's theory of universals\", CC BY-SA 4.0) states: Aristotle's theory of universals is Aristotle's classical solution to the problem of universals, sometimes known as the hylomorphic theory of immanent realism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.appropriation-of-knowledge","kind":"concept","label":"Appropriation of knowledge","sources":[{"id":"wikipedia.article.appropriation-of-knowledge","title":"English Wikipedia article: Appropriation of knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appropriation+of+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Appropriation of knowledge\", CC BY-SA 4.0) states: Appropriation of knowledge is the process of constructing knowledge from social and cultural sources, and integrating it into pre-existing schemas.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"theory.wikipedia.tarski-s-undefinability-theorem","kind":"theory","label":"Tarski's undefinability theorem","sources":[{"id":"wikipedia.article.tarski-s-undefinability-theorem","title":"English Wikipedia article: Tarski's undefinability theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tarski%27s+undefinability+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Tarski's undefinability theorem\", CC BY-SA 4.0) states: Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.discovery-science","kind":"concept","label":"Discovery science","sources":[{"id":"wikipedia.article.discovery-science","title":"English Wikipedia article: Discovery science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discovery+science"}],"status":"reported","summary":"English Wikipedia (article \"Discovery science\", CC BY-SA 4.0) states: Discovery science (also known as discovery-based science) is a scientific methodology which aims to find new patterns, correlations, and form hypotheses through the analysis of large-scale experimental data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.causal-theory-of-reference","kind":"concept","label":"Causal theory of reference","sources":[{"id":"wikipedia.article.causal-theory-of-reference","title":"English Wikipedia article: Causal theory of reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Causal+theory+of+reference"}],"status":"reported","summary":"English Wikipedia (article \"Causal theory of reference\", CC BY-SA 4.0) states: A causal theory of reference or historical chain theory of reference is a theory of how terms acquire specific referents based on evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.delusion","kind":"concept","label":"Delusion","sources":[{"id":"wikipedia.article.delusion","title":"English Wikipedia article: Delusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Delusion"}],"status":"reported","summary":"English Wikipedia (article \"Delusion\", CC BY-SA 4.0) states: A delusion is a fixed belief that is not amenable to change in light of conflicting evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.commonsense-reasoning","kind":"concept","label":"Commonsense reasoning","sources":[{"id":"wikipedia.article.commonsense-reasoning","title":"English Wikipedia article: Commonsense reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commonsense+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Commonsense reasoning\", CC BY-SA 4.0) states: In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cartesian-circle","kind":"concept","label":"Cartesian circle","sources":[{"id":"wikipedia.article.cartesian-circle","title":"English Wikipedia article: Cartesian circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartesian+circle"}],"status":"reported","summary":"English Wikipedia (article \"Cartesian circle\", CC BY-SA 4.0) states: The Cartesian circle (also known as Arnauld's circle) is an example of fallacious circular reasoning attributed to French philosopher René Descartes.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.closed-concept","kind":"concept","label":"Closed concept","sources":[{"id":"wikipedia.article.closed-concept","title":"English Wikipedia article: Closed concept","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closed+concept"}],"status":"reported","summary":"English Wikipedia (article \"Closed concept\", CC BY-SA 4.0) states: A closed concept is a concept where all the necessary and sufficient conditions required to include something within the concept can be listed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","kind":"concept","label":"Contra principia negantem non est disputandum","sources":[{"id":"wikipedia.article.contra-principia-negantem-non-est-disputandum","title":"English Wikipedia article: Contra principia negantem non est disputandum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contra+principia+negantem+non+est+disputandum"}],"status":"reported","summary":"English Wikipedia (article \"Contra principia negantem non est disputandum\", CC BY-SA 4.0) states: Contra principia negantem non est disputandum (Latin, alternatively Contra principia negantem disputari non potest and Contra principia negantem disputari nequit; literally, \"Against one who denies the principles, there can be no debate\") is a principle of logic and law: in order to debate reasonably about a disagreement, there must be agreement about the principles or facts by which to judge the arguments.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inference-engine","kind":"concept","label":"Inference engine","sources":[{"id":"wikipedia.article.inference-engine","title":"English Wikipedia article: Inference engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inference+engine"}],"status":"reported","summary":"English Wikipedia (article \"Inference engine\", CC BY-SA 4.0) states: In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.functional-fixedness","kind":"concept","label":"Functional fixedness","sources":[{"id":"wikipedia.article.functional-fixedness","title":"English Wikipedia article: Functional fixedness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Functional+fixedness"}],"status":"reported","summary":"English Wikipedia (article \"Functional fixedness\", CC BY-SA 4.0) states: Functional fixedness is a cognitive bias that limits a person to use an object only in the way it is traditionally used.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deliberative-indispensability-argument","kind":"concept","label":"Deliberative indispensability argument","sources":[{"id":"wikipedia.article.deliberative-indispensability-argument","title":"English Wikipedia article: Deliberative indispensability argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deliberative+indispensability+argument"}],"status":"reported","summary":"English Wikipedia (article \"Deliberative indispensability argument\", CC BY-SA 4.0) states: The deliberative indispensability argument is an argument for normative realism defended by David Enoch, most prominently in his 2011 book Taking Morality Seriously.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.catu-ko-i","kind":"concept","label":"Catuṣkoṭi","sources":[{"id":"wikipedia.article.catu-ko-i","title":"English Wikipedia article: Catuṣkoṭi","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catu%E1%B9%A3ko%E1%B9%ADi"}],"status":"reported","summary":"English Wikipedia (article \"Catuṣkoṭi\", CC BY-SA 4.0) states: Catuṣkoṭi (Sanskrit; Devanagari: चतुष्कोटि, Tibetan: མུ་བཞི, Wylie: mu bzhi, Sinhalese:චතුස්කෝටිකය) refers to logical argument(s) of a 'suite of four discrete functions' or 'an indivisible quaternity' that has multiple applications and has been important in the Indian logic and the Buddhist logico-epistemological traditions, particularly those of the Madhyamaka school.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-falsification","kind":"concept","label":"Knowledge falsification","sources":[{"id":"wikipedia.article.knowledge-falsification","title":"English Wikipedia article: Knowledge falsification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+falsification"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge falsification\", CC BY-SA 4.0) states: Knowledge falsification is the deliberate misrepresentation of what one knows under perceived social pressures.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.anchoring-effect","kind":"concept","label":"Anchoring effect","sources":[{"id":"wikipedia.article.anchoring-effect","title":"English Wikipedia article: Anchoring effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anchoring+effect"}],"status":"reported","summary":"English Wikipedia (article \"Anchoring effect\", CC BY-SA 4.0) states: The anchoring effect is a psychological phenomenon in which an individual's judgments or decisions are influenced by a reference point or \"anchor\" which can be completely irrelevant.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-science","kind":"concept","label":"Open science","sources":[{"id":"wikipedia.article.open-science","title":"English Wikipedia article: Open science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open+science"}],"status":"reported","summary":"English Wikipedia (article \"Open science\", CC BY-SA 4.0) states: Open science (also known as open research) is the movement to make scientific research, including publications, data, physical samples, software, and models, transparent and accessible to all levels of society through collaborative networks.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cooperative-principle","kind":"concept","label":"Cooperative principle","sources":[{"id":"wikipedia.article.cooperative-principle","title":"English Wikipedia article: Cooperative principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cooperative+principle"}],"status":"reported","summary":"English Wikipedia (article \"Cooperative principle\", CC BY-SA 4.0) states: In social science generally and linguistics specifically, the cooperative principle describes how people achieve effective conversational communication in common social situations—that is, how listeners and speakers act cooperatively and mutually accept one another to be understood in a particular way.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.archimedean-point","kind":"concept","label":"Archimedean point","sources":[{"id":"wikipedia.article.archimedean-point","title":"English Wikipedia article: Archimedean point","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archimedean+point"}],"status":"reported","summary":"English Wikipedia (article \"Archimedean point\", CC BY-SA 4.0) states: An Archimedean point (Latin: Punctum Archimedis) is a hypothetical viewpoint from which certain objective truths can perfectly be perceived (also known as a God's-eye view) or a reliable starting point from which one may reason.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.critical-realism-philosophy-of-perception","kind":"concept","label":"Critical realism (philosophy of perception)","sources":[{"id":"wikipedia.article.critical-realism-philosophy-of-perception","title":"English Wikipedia article: Critical realism (philosophy of perception)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Critical+realism+%28philosophy+of+perception%29"}],"status":"reported","summary":"English Wikipedia (article \"Critical realism (philosophy of perception)\", CC BY-SA 4.0) states: In the philosophy of perception, critical realism (also critical perceptual realism) is the theory that some of our sense-data (for example, those of primary qualities) can and do accurately represent external objects, properties, and events, while other of our sense-data (for example, those of secondary qualities and perceptual illusions) do not accurately represent any external objects, properties, and events.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.biological-determinism","kind":"concept","label":"Biological determinism","sources":[{"id":"wikipedia.article.biological-determinism","title":"English Wikipedia article: Biological determinism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biological+determinism"}],"status":"reported","summary":"English Wikipedia (article \"Biological determinism\", CC BY-SA 4.0) states: Biological determinism, also known as genetic determinism, is the belief that human behaviour is directly controlled by an individual's genes or some component of their physiology, generally at the expense of the role of their environment, whether in embryonic development or in learning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evidence-based-practice","kind":"concept","label":"Evidence-based practice","sources":[{"id":"wikipedia.article.evidence-based-practice","title":"English Wikipedia article: Evidence-based practice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evidence-based+practice"}],"status":"reported","summary":"English Wikipedia (article \"Evidence-based practice\", CC BY-SA 4.0) states: Evidence-based practice (EBP) is the idea that occupational practices ought to be based on scientific evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.implicit-and-explicit-knowledge","kind":"concept","label":"Implicit and explicit knowledge","sources":[{"id":"wikipedia.article.implicit-and-explicit-knowledge","title":"English Wikipedia article: Implicit and explicit knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Implicit+and+explicit+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Implicit and explicit knowledge\", CC BY-SA 4.0) states: Implicit and explicit knowledge are two contrasting types of knowledge often discussed in the field of second language acquisition (SLA).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dempster-shafer-theory","kind":"concept","label":"Dempster–Shafer theory","sources":[{"id":"wikipedia.article.dempster-shafer-theory","title":"English Wikipedia article: Dempster–Shafer theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dempster%E2%80%93Shafer+theory"}],"status":"reported","summary":"English Wikipedia (article \"Dempster–Shafer theory\", CC BY-SA 4.0) states: The theory of belief functions, also referred to as evidence theory or Dempster–Shafer theory (DST), is a general framework for reasoning with uncertainty, with understood connections to other frameworks such as probability, possibility and imprecise probability theories.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deductive-reasoning","kind":"concept","label":"Deductive reasoning","sources":[{"id":"wikipedia.article.deductive-reasoning","title":"English Wikipedia article: Deductive reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deductive+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Deductive reasoning\", CC BY-SA 4.0) states: Deductive reasoning is the process of drawing valid inferences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.category-mistake","kind":"concept","label":"Category mistake","sources":[{"id":"wikipedia.article.category-mistake","title":"English Wikipedia article: Category mistake","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+mistake"}],"status":"reported","summary":"English Wikipedia (article \"Category mistake\", CC BY-SA 4.0) states: A category mistake (or category error, categorical mistake, or mistake of category) is a semantic or ontological error in which things belonging to a particular category are presented as if they belong to a different category, or, alternatively, a property is ascribed to a thing that could not possibly have that property.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.javelin-argument","kind":"concept","label":"Javelin argument","sources":[{"id":"wikipedia.article.javelin-argument","title":"English Wikipedia article: Javelin argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Javelin+argument"}],"status":"reported","summary":"English Wikipedia (article \"Javelin argument\", CC BY-SA 4.0) states: The javelin argument, credited to Lucretius, is an ancient logical argument that the universe, or cosmological space, must be infinite.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dialectical-logic","kind":"concept","label":"Dialectical logic","sources":[{"id":"wikipedia.article.dialectical-logic","title":"English Wikipedia article: Dialectical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dialectical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Dialectical logic\", CC BY-SA 4.0) states: Dialectical logic is the system of laws of thought, developed within the Hegelian and Marxist traditions, which seeks to supplement or replace the laws of formal logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-texture","kind":"concept","label":"Open texture","sources":[{"id":"wikipedia.article.open-texture","title":"English Wikipedia article: Open texture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open+texture"}],"status":"reported","summary":"English Wikipedia (article \"Open texture\", CC BY-SA 4.0) states: Open texture is a term in the philosophy of Friedrich Waismann, first introduced in his paper \"Verifiability\" to refer to the universal possibility of vagueness in empirical statements.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.comprehension-logic","kind":"concept","label":"Comprehension (logic)","sources":[{"id":"wikipedia.article.comprehension-logic","title":"English Wikipedia article: Comprehension (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Comprehension+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Comprehension (logic)\", CC BY-SA 4.0) states: In logic, the comprehension of an object is the totality of intensions, that is, attributes, characters, marks, properties, or qualities, that the object possesses, or else the totality of intensions that are pertinent to the context of a given discussion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deontic-logic","kind":"concept","label":"Deontic logic","sources":[{"id":"wikipedia.article.deontic-logic","title":"English Wikipedia article: Deontic logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deontic+logic"}],"status":"reported","summary":"English Wikipedia (article \"Deontic logic\", CC BY-SA 4.0) states: Deontic logic is the field of philosophical logic that is concerned with obligation, permission, and related concepts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-hexagon","kind":"concept","label":"Logical hexagon","sources":[{"id":"wikipedia.article.logical-hexagon","title":"English Wikipedia article: Logical hexagon","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+hexagon"}],"status":"reported","summary":"English Wikipedia (article \"Logical hexagon\", CC BY-SA 4.0) states: In philosophical logic, the logical hexagon (also called the hexagon of opposition) is a conceptual model of the relationships between the truth values of six statements.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evolutionary-debunking","kind":"concept","label":"Evolutionary debunking","sources":[{"id":"wikipedia.article.evolutionary-debunking","title":"English Wikipedia article: Evolutionary debunking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evolutionary+debunking"}],"status":"reported","summary":"English Wikipedia (article \"Evolutionary debunking\", CC BY-SA 4.0) states: An evolutionary debunking, sometimes referred to as an evolutionary debunking argument or evolutionary debunking thesis, is a philosophical argument which holds that, because humans (like all organisms) have an evolutionary origin, the principles of ethics and morality that we have devised are invalid and cannot be considered objective knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.charlesworth-s-paradox","kind":"concept","label":"Charlesworth's paradox","sources":[{"id":"wikipedia.article.charlesworth-s-paradox","title":"English Wikipedia article: Charlesworth's paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Charlesworth%27s+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Charlesworth's paradox\", CC BY-SA 4.0) states: Charlesworth's Paradox is a paradox related to kin selection, Hamilton's Rule and the evolution of altruism.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.best-of-all-possible-worlds","kind":"concept","label":"Best of all possible worlds","sources":[{"id":"wikipedia.article.best-of-all-possible-worlds","title":"English Wikipedia article: Best of all possible worlds","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Best+of+all+possible+worlds"}],"status":"reported","summary":"English Wikipedia (article \"Best of all possible worlds\", CC BY-SA 4.0) states: The phrase \"the best of all possible worlds\" (French: Le meilleur des mondes possibles; German: Die beste aller möglichen Welten) was coined by the German polymath and Enlightenment philosopher Gottfried Leibniz in his 1710 work Essais de Théodicée sur la bonté de Dieu, la liberté de l'homme et l'origine du mal (Essays of Theodicy on the Goodness of God, the Freedom of Man and the Origin of Evil), more commonly known simply as the Theodicy.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-organization","kind":"concept","label":"Knowledge organization","sources":[{"id":"wikipedia.article.knowledge-organization","title":"English Wikipedia article: Knowledge organization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+organization"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge organization\", CC BY-SA 4.0) states: Knowledge organization (KO), organization of knowledge, organization of information, or information organization is an intellectual discipline concerned with activities such as document description, indexing, and classification that serve to provide systems of representation and order for knowledge and information objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.apophenia","kind":"concept","label":"Apophenia","sources":[{"id":"wikipedia.article.apophenia","title":"English Wikipedia article: Apophenia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apophenia"}],"status":"reported","summary":"English Wikipedia (article \"Apophenia\", CC BY-SA 4.0) states: Apophenia () is the tendency to perceive meaningful connections between unrelated things.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.de-se","kind":"concept","label":"De se","sources":[{"id":"wikipedia.article.de-se","title":"English Wikipedia article: De se","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=De+se"}],"status":"reported","summary":"English Wikipedia (article \"De se\", CC BY-SA 4.0) states: De se is Latin for \"of oneself\" and, in philosophy, it is a phrase used to delineate what some consider a category of ascription distinct from \"de dicto and de re\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cognitive-synonymy","kind":"concept","label":"Cognitive synonymy","sources":[{"id":"wikipedia.article.cognitive-synonymy","title":"English Wikipedia article: Cognitive synonymy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cognitive+synonymy"}],"status":"reported","summary":"English Wikipedia (article \"Cognitive synonymy\", CC BY-SA 4.0) states: Cognitive synonymy is a type of synonymy in which synonyms are so similar in meaning that they cannot be differentiated either denotatively or connotatively, that is, not even by mental associations, connotations, emotive responses, and poetic value.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-from-illusion","kind":"concept","label":"Argument from illusion","sources":[{"id":"wikipedia.article.argument-from-illusion","title":"English Wikipedia article: Argument from illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+from+illusion"}],"status":"reported","summary":"English Wikipedia (article \"Argument from illusion\", CC BY-SA 4.0) states: The argument from illusion is an argument for the existence of sense-data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definitionism","kind":"concept","label":"Definitionism","sources":[{"id":"wikipedia.article.definitionism","title":"English Wikipedia article: Definitionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definitionism"}],"status":"reported","summary":"English Wikipedia (article \"Definitionism\", CC BY-SA 4.0) states: Definitionism (also called the classical theory of concepts) is the school of thought in which it is believed that a proper explanation of a theory consists of all the concepts used by that theory being well-defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blue-skies-research","kind":"concept","label":"Blue skies research","sources":[{"id":"wikipedia.article.blue-skies-research","title":"English Wikipedia article: Blue skies research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blue+skies+research"}],"status":"reported","summary":"English Wikipedia (article \"Blue skies research\", CC BY-SA 4.0) states: Blue skies research, also called blue sky science, is scientific research in domains where \"real-world\" applications are not immediately apparent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.trivialism","kind":"concept","label":"Trivialism","sources":[{"id":"wikipedia.article.trivialism","title":"English Wikipedia article: Trivialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Trivialism"}],"status":"reported","summary":"English Wikipedia (article \"Trivialism\", CC BY-SA 4.0) states: Trivialism is the logical theory that all statements (also known as propositions) are true and, consequently, that all contradictions of the form \"p and not p\" (e.g. the ball is red and not red) are true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimenter-s-regress","kind":"concept","label":"Experimenter's regress","sources":[{"id":"wikipedia.article.experimenter-s-regress","title":"English Wikipedia article: Experimenter's regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimenter%27s+regress"}],"status":"reported","summary":"English Wikipedia (article \"Experimenter's regress\", CC BY-SA 4.0) states: In science, experimenter's regress refers to a loop of dependence between theory and evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cross-sectional-study","kind":"concept","label":"Cross-sectional study","sources":[{"id":"wikipedia.article.cross-sectional-study","title":"English Wikipedia article: Cross-sectional study","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cross-sectional+study"}],"status":"reported","summary":"English Wikipedia (article \"Cross-sectional study\", CC BY-SA 4.0) states: In medical research, epidemiology, social science, and biology, a cross-sectional study (also known as a cross-sectional analysis, transverse study, prevalence study) is a type of research design that analyzes data from a population, or a representative subset, at a specific point in time—that is, cross-sectional data.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.inert-knowledge","kind":"concept","label":"Inert knowledge","sources":[{"id":"wikipedia.article.inert-knowledge","title":"English Wikipedia article: Inert knowledge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inert+knowledge"}],"status":"reported","summary":"English Wikipedia (article \"Inert knowledge\", CC BY-SA 4.0) states: Inert knowledge is information which one can express but not use.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defeasible-reasoning","kind":"concept","label":"Defeasible reasoning","sources":[{"id":"wikipedia.article.defeasible-reasoning","title":"English Wikipedia article: Defeasible reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defeasible+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Defeasible reasoning\", CC BY-SA 4.0) states: In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.new-riddle-of-induction","kind":"concept","label":"New riddle of induction","sources":[{"id":"wikipedia.article.new-riddle-of-induction","title":"English Wikipedia article: New riddle of induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=New+riddle+of+induction"}],"status":"reported","summary":"English Wikipedia (article \"New riddle of induction\", CC BY-SA 4.0) states: The new riddle of induction was presented by Nelson Goodman in Fact, Fiction, and Forecast as a successor to Hume's original problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.circular-reasoning","kind":"concept","label":"Circular reasoning","sources":[{"id":"wikipedia.article.circular-reasoning","title":"English Wikipedia article: Circular reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circular+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Circular reasoning\", CC BY-SA 4.0) states: Circular reasoning (Latin: circulus in probando, lit. 'circle in proving'; also known as circular logic) is a fallacy in which the reasoner begins with what they are trying to end with.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ground-truth","kind":"concept","label":"Ground truth","sources":[{"id":"wikipedia.article.ground-truth","title":"English Wikipedia article: Ground truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ground+truth"}],"status":"reported","summary":"English Wikipedia (article \"Ground truth\", CC BY-SA 4.0) states: Ground truth is information that is known to be real or true, provided by direct observation and measurement (i.e. empirical evidence) as opposed to information provided by inference.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.material-inference","kind":"concept","label":"Material inference","sources":[{"id":"wikipedia.article.material-inference","title":"English Wikipedia article: Material inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Material+inference"}],"status":"reported","summary":"English Wikipedia (article \"Material inference\", CC BY-SA 4.0) states: In logic, inference is the process of deriving logical conclusions from premises known or assumed to be true.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coherent-extrapolated-volition","kind":"concept","label":"Coherent extrapolated volition","sources":[{"id":"wikipedia.article.coherent-extrapolated-volition","title":"English Wikipedia article: Coherent extrapolated volition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coherent+extrapolated+volition"}],"status":"reported","summary":"English Wikipedia (article \"Coherent extrapolated volition\", CC BY-SA 4.0) states: Coherent extrapolated volition (CEV) is a theoretical framework in the field of AI alignment describing an approach by which an artificial superintelligence (ASI) would act on a benevolent supposition of what humans could want if they were more knowledgeable, more rational, had more time to think, and had matured together as a society, as opposed to humanity's current individual or collective preferences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experience-machine","kind":"concept","label":"Experience machine","sources":[{"id":"wikipedia.article.experience-machine","title":"English Wikipedia article: Experience machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experience+machine"}],"status":"reported","summary":"English Wikipedia (article \"Experience machine\", CC BY-SA 4.0) states: The experience machine or pleasure machine is a thought experiment put forward by philosopher Robert Nozick in his 1974 book Anarchy, State, and Utopia.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.chicken-or-the-egg","kind":"concept","label":"Chicken or the egg","sources":[{"id":"wikipedia.article.chicken-or-the-egg","title":"English Wikipedia article: Chicken or the egg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chicken+or+the+egg"}],"status":"reported","summary":"English Wikipedia (article \"Chicken or the egg\", CC BY-SA 4.0) states: The chicken or the egg causality dilemma is commonly stated as the question, \"which came first: the chicken or the egg?\" The dilemma stems from the observation that all chickens hatch from eggs and all chicken eggs are laid by chickens. \"Chicken-and-egg\" is a metaphoric adjective describing situations where it is not clear which of two events should be considered the cause and which should be considered the effect, to express a scenario of infinite regress, or to express the difficulty of sequencing actions where each seems to depend on others being done first.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attention-inequality","kind":"concept","label":"Attention inequality","sources":[{"id":"wikipedia.article.attention-inequality","title":"English Wikipedia article: Attention inequality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attention+inequality"}],"status":"reported","summary":"English Wikipedia (article \"Attention inequality\", CC BY-SA 4.0) states: Attention inequality is the inequality of distribution of attention across users on social networks, people in general, and for scientific papers.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.preregistration-science","kind":"concept","label":"Preregistration (science)","sources":[{"id":"wikipedia.article.preregistration-science","title":"English Wikipedia article: Preregistration (science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Preregistration+%28science%29"}],"status":"reported","summary":"English Wikipedia (article \"Preregistration (science)\", CC BY-SA 4.0) states: Preregistration is the practice of registering the hypotheses, methods, or analyses of a scientific study before it is conducted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bold-hypothesis","kind":"concept","label":"Bold hypothesis","sources":[{"id":"wikipedia.article.bold-hypothesis","title":"English Wikipedia article: Bold hypothesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bold+hypothesis"}],"status":"reported","summary":"English Wikipedia (article \"Bold hypothesis\", CC BY-SA 4.0) states: Bold hypothesis (or bold conjecture, the terms are used interchangeably) is a concept originally created by the liberal philosopher Karl Popper when he tried to define the meaning of scientific thinking and scientific progress.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.deconstruction","kind":"concept","label":"Deconstruction","sources":[{"id":"wikipedia.article.deconstruction","title":"English Wikipedia article: Deconstruction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deconstruction"}],"status":"reported","summary":"English Wikipedia (article \"Deconstruction\", CC BY-SA 4.0) states: In philosophy, deconstruction is a loosely defined set of approaches to understanding the relationship between text and meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.construct-psychology","kind":"concept","label":"Construct (psychology)","sources":[{"id":"wikipedia.article.construct-psychology","title":"English Wikipedia article: Construct (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Construct+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Construct (psychology)\", CC BY-SA 4.0) states: In psychology, a construct, also called a hypothetical construct or psychological construct, is a sophisticated cognitive framework that individuals and cultures use to interpret, understand, and predict social reality.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.direct-and-indirect-realism","kind":"concept","label":"Direct and indirect realism","sources":[{"id":"wikipedia.article.direct-and-indirect-realism","title":"English Wikipedia article: Direct and indirect realism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Direct+and+indirect+realism"}],"status":"reported","summary":"English Wikipedia (article \"Direct and indirect realism\", CC BY-SA 4.0) states: In philosophy of perception and philosophy of mind, direct (or naïve) realism, as opposed to indirect (or representational) realism, are differing models that describe the nature of conscious experiences.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.boundary-work","kind":"concept","label":"Boundary-work","sources":[{"id":"wikipedia.article.boundary-work","title":"English Wikipedia article: Boundary-work","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boundary-work"}],"status":"reported","summary":"English Wikipedia (article \"Boundary-work\", CC BY-SA 4.0) states: Boundary-work is part of science studies.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.truth-predicate","kind":"concept","label":"Truth predicate","sources":[{"id":"wikipedia.article.truth-predicate","title":"English Wikipedia article: Truth predicate","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Truth+predicate"}],"status":"reported","summary":"English Wikipedia (article \"Truth predicate\", CC BY-SA 4.0) states: In formal theories of truth, a truth predicate is a fundamental concept based on the sentences of a formal language as interpreted logically.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimentum-crucis","kind":"concept","label":"Experimentum crucis","sources":[{"id":"wikipedia.article.experimentum-crucis","title":"English Wikipedia article: Experimentum crucis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimentum+crucis"}],"status":"reported","summary":"English Wikipedia (article \"Experimentum crucis\", CC BY-SA 4.0) states: In science, an experimentum crucis (English: crucial experiment or critical experiment) is an experiment capable of decisively determining whether or not a particular hypothesis or theory is superior to all others whose acceptance is currently widespread in the scientific community.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.diagrammatic-reasoning","kind":"concept","label":"Diagrammatic reasoning","sources":[{"id":"wikipedia.article.diagrammatic-reasoning","title":"English Wikipedia article: Diagrammatic reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diagrammatic+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Diagrammatic reasoning\", CC BY-SA 4.0) states: Diagrammatic reasoning is reasoning by means of visual representations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.reasoning-system","kind":"concept","label":"Reasoning system","sources":[{"id":"wikipedia.article.reasoning-system","title":"English Wikipedia article: Reasoning system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Reasoning+system"}],"status":"reported","summary":"English Wikipedia (article \"Reasoning system\", CC BY-SA 4.0) states: In information technology a reasoning system is a software system that generates conclusions from available knowledge using logical techniques such as deduction and induction.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logic-of-argumentation","kind":"concept","label":"Logic of argumentation","sources":[{"id":"wikipedia.article.logic-of-argumentation","title":"English Wikipedia article: Logic of argumentation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logic+of+argumentation"}],"status":"reported","summary":"English Wikipedia (article \"Logic of argumentation\", CC BY-SA 4.0) states: The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dissoi-logoi","kind":"concept","label":"Dissoi logoi","sources":[{"id":"wikipedia.article.dissoi-logoi","title":"English Wikipedia article: Dissoi logoi","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dissoi+logoi"}],"status":"reported","summary":"English Wikipedia (article \"Dissoi logoi\", CC BY-SA 4.0) states: The Dissoi logoi (Greek δισσοὶ λόγοι, \"contrasting arguments\") is a text, a rhetorical exercise of unknown authorship, most likely dating to just after the Peloponnesian War (431–404 BC) based on comments within.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.half-truth","kind":"concept","label":"Half-truth","sources":[{"id":"wikipedia.article.half-truth","title":"English Wikipedia article: Half-truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Half-truth"}],"status":"reported","summary":"English Wikipedia (article \"Half-truth\", CC BY-SA 4.0) states: A half-truth is a deceptive statement that includes some element of truth.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.moral-intellectualism","kind":"concept","label":"Moral intellectualism","sources":[{"id":"wikipedia.article.moral-intellectualism","title":"English Wikipedia article: Moral intellectualism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Moral+intellectualism"}],"status":"reported","summary":"English Wikipedia (article \"Moral intellectualism\", CC BY-SA 4.0) states: Moral intellectualism or ethical intellectualism is a view in meta-ethics according to which genuine moral knowledge must take the form of arriving at discursive moral judgements about what one should do.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.existential-graph","kind":"concept","label":"Existential graph","sources":[{"id":"wikipedia.article.existential-graph","title":"English Wikipedia article: Existential graph","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Existential+graph"}],"status":"reported","summary":"English Wikipedia (article \"Existential graph\", CC BY-SA 4.0) states: An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early as 1882, and continued to develop the method until his death in 1914.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.scalar-implicature","kind":"concept","label":"Scalar implicature","sources":[{"id":"wikipedia.article.scalar-implicature","title":"English Wikipedia article: Scalar implicature","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Scalar+implicature"}],"status":"reported","summary":"English Wikipedia (article \"Scalar implicature\", CC BY-SA 4.0) states: In pragmatics, scalar implicature, or quantity implicature, is an implicature that attributes an implicit meaning beyond the explicit or literal meaning of an utterance, and which suggests that the utterer had a reason for not using a more informative or stronger term on the same scale.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.explanatory-indispensability-argument","kind":"concept","label":"Explanatory indispensability argument","sources":[{"id":"wikipedia.article.explanatory-indispensability-argument","title":"English Wikipedia article: Explanatory indispensability argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Explanatory+indispensability+argument"}],"status":"reported","summary":"English Wikipedia (article \"Explanatory indispensability argument\", CC BY-SA 4.0) states: The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bradley-s-regress","kind":"concept","label":"Bradley's regress","sources":[{"id":"wikipedia.article.bradley-s-regress","title":"English Wikipedia article: Bradley's regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bradley%27s+regress"}],"status":"reported","summary":"English Wikipedia (article \"Bradley's regress\", CC BY-SA 4.0) states: Bradley's regress is a philosophical problem concerning the nature of relations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.theory-ladenness","kind":"concept","label":"Theory-ladenness","sources":[{"id":"wikipedia.article.theory-ladenness","title":"English Wikipedia article: Theory-ladenness","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Theory-ladenness"}],"status":"reported","summary":"English Wikipedia (article \"Theory-ladenness\", CC BY-SA 4.0) states: In philosophy of science, an observation is said to be \"theory-laden\" when shaped by the investigator's theoretical presuppositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.science-and-technology-studies","kind":"concept","label":"Science and technology studies","sources":[{"id":"wikipedia.article.science-and-technology-studies","title":"English Wikipedia article: Science and technology studies","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Science+and+technology+studies"}],"status":"reported","summary":"English Wikipedia (article \"Science and technology studies\", CC BY-SA 4.0) states: Science and technology studies (STS) or science, technology, and society is an interdisciplinary field by sociologists, historians, philosophers, anthropologists, and others that examines the creation, development, consequences, and outcomes of science, including medical science, and technology in their historical, cultural, and social contexts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definite-description","kind":"concept","label":"Definite description","sources":[{"id":"wikipedia.article.definite-description","title":"English Wikipedia article: Definite description","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definite+description"}],"status":"reported","summary":"English Wikipedia (article \"Definite description\", CC BY-SA 4.0) states: In formal semantics and philosophy of language, a definite description is a denoting phrase in the form of \"the X\" where X is a noun-phrase or a singular common noun.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constructivism-philosophy-of-mathematics","kind":"concept","label":"Constructivism (philosophy of mathematics)","sources":[{"id":"wikipedia.article.constructivism-philosophy-of-mathematics","title":"English Wikipedia article: Constructivism (philosophy of mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructivism+%28philosophy+of+mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Constructivism (philosophy of mathematics)\", CC BY-SA 4.0) states: In philosophy of mathematics, constructivism asserts that it is necessary to find (or \"construct\") a specific example of a mathematical object in order to prove that an example exists.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.truthmaker-theory","kind":"field","label":"Truthmaker theory","sources":[{"id":"wikipedia.article.truthmaker-theory","title":"English Wikipedia article: Truthmaker theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Truthmaker+theory"}],"status":"reported","summary":"English Wikipedia (article \"Truthmaker theory\", CC BY-SA 4.0) states: Truthmaker theory is \"the branch of metaphysics that explores the relationships between what is true and what exists\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.interdisciplinarity","kind":"concept","label":"Interdisciplinarity","sources":[{"id":"wikipedia.article.interdisciplinarity","title":"English Wikipedia article: Interdisciplinarity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Interdisciplinarity"}],"status":"reported","summary":"English Wikipedia (article \"Interdisciplinarity\", CC BY-SA 4.0) states: Interdisciplinarity, also known as interdisciplinary studies, is the combination of multiple academic disciplines into one activity (e.g., a research project).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.disquotational-principle","kind":"concept","label":"Disquotational principle","sources":[{"id":"wikipedia.article.disquotational-principle","title":"English Wikipedia article: Disquotational principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disquotational+principle"}],"status":"reported","summary":"English Wikipedia (article \"Disquotational principle\", CC BY-SA 4.0) states: The disquotational principle is a philosophical principle which holds that a rational speaker will accept \"p\" if and only if they believe p. The quotation marks indicate that the statement p is being treated as a sentence, and not as a proposition.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dysrationalia","kind":"concept","label":"Dysrationalia","sources":[{"id":"wikipedia.article.dysrationalia","title":"English Wikipedia article: Dysrationalia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dysrationalia"}],"status":"reported","summary":"English Wikipedia (article \"Dysrationalia\", CC BY-SA 4.0) states: Dysrationalia is defined as the inability to think and behave rationally despite adequate intelligence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rule-induction","kind":"concept","label":"Rule induction","sources":[{"id":"wikipedia.article.rule-induction","title":"English Wikipedia article: Rule induction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rule+induction"}],"status":"reported","summary":"English Wikipedia (article \"Rule induction\", CC BY-SA 4.0) states: Rule induction is an area of machine learning in which formal rules are extracted from a set of observations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-form","kind":"concept","label":"Logical form","sources":[{"id":"wikipedia.article.logical-form","title":"English Wikipedia article: Logical form","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+form"}],"status":"reported","summary":"English Wikipedia (article \"Logical form\", CC BY-SA 4.0) states: In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.engaged-theory","kind":"concept","label":"Engaged theory","sources":[{"id":"wikipedia.article.engaged-theory","title":"English Wikipedia article: Engaged theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engaged+theory"}],"status":"reported","summary":"English Wikipedia (article \"Engaged theory\", CC BY-SA 4.0) states: Engaged theory is a methodological framework for understanding the social complexity of a society, by using social relations as the base category of study, with the social always understood as grounded in the natural, including people as embodied beings.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.contingency-philosophy","kind":"concept","label":"Contingency (philosophy)","sources":[{"id":"wikipedia.article.contingency-philosophy","title":"English Wikipedia article: Contingency (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contingency+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Contingency (philosophy)\", CC BY-SA 4.0) states: In logic, contingency is the feature of a statement making it neither necessary nor impossible.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fallacy","kind":"concept","label":"Fallacy","sources":[{"id":"wikipedia.article.fallacy","title":"English Wikipedia article: Fallacy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fallacy"}],"status":"reported","summary":"English Wikipedia (article \"Fallacy\", CC BY-SA 4.0) states: A fallacy is the use of invalid or otherwise faulty reasoning in the construction of an argument that may appear to be well-reasoned if unnoticed.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.square-of-opposition","kind":"concept","label":"Square of opposition","sources":[{"id":"wikipedia.article.square-of-opposition","title":"English Wikipedia article: Square of opposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Square+of+opposition"}],"status":"reported","summary":"English Wikipedia (article \"Square of opposition\", CC BY-SA 4.0) states: In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.insight-phenomenology","kind":"concept","label":"Insight phenomenology","sources":[{"id":"wikipedia.article.insight-phenomenology","title":"English Wikipedia article: Insight phenomenology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Insight+phenomenology"}],"status":"reported","summary":"English Wikipedia (article \"Insight phenomenology\", CC BY-SA 4.0) states: Insight is a sudden understanding of a problem or a strategy that aids in solving a problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.generality-psychology","kind":"concept","label":"Generality (psychology)","sources":[{"id":"wikipedia.article.generality-psychology","title":"English Wikipedia article: Generality (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Generality+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Generality (psychology)\", CC BY-SA 4.0) states: In behavioral psychology, the assumption of generality is the assumption that the results of experiments involving schedules of reinforcement, conducted on non-human subjects (often pigeons), can be generalized to apply to humans.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.consciousness-causes-collapse","kind":"concept","label":"Consciousness causes collapse","sources":[{"id":"wikipedia.article.consciousness-causes-collapse","title":"English Wikipedia article: Consciousness causes collapse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consciousness+causes+collapse"}],"status":"reported","summary":"English Wikipedia (article \"Consciousness causes collapse\", CC BY-SA 4.0) states: The postulate that consciousness causes collapse is the main ingredient of an interpretation of quantum mechanics in which consciousness is the mechanism behind the process of measurement in quantum mechanics.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.social-constructionism","kind":"concept","label":"Social constructionism","sources":[{"id":"wikipedia.article.social-constructionism","title":"English Wikipedia article: Social constructionism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Social+constructionism"}],"status":"reported","summary":"English Wikipedia (article \"Social constructionism\", CC BY-SA 4.0) states: Social constructionism is a term used in sociology, social ontology, and communication theory.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attribute-substitution","kind":"concept","label":"Attribute substitution","sources":[{"id":"wikipedia.article.attribute-substitution","title":"English Wikipedia article: Attribute substitution","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attribute+substitution"}],"status":"reported","summary":"English Wikipedia (article \"Attribute substitution\", CC BY-SA 4.0) states: Attribute substitution is a psychological process thought to underlie a number of cognitive biases and perceptual illusions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denotation","kind":"concept","label":"Denotation","sources":[{"id":"wikipedia.article.denotation","title":"English Wikipedia article: Denotation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denotation"}],"status":"reported","summary":"English Wikipedia (article \"Denotation\", CC BY-SA 4.0) states: In philosophy and linguistics, the denotation of a word or expression is its strictly literal meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.authority-of-the-bootmaker","kind":"concept","label":"Authority of the bootmaker","sources":[{"id":"wikipedia.article.authority-of-the-bootmaker","title":"English Wikipedia article: Authority of the bootmaker","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Authority+of+the+bootmaker"}],"status":"reported","summary":"English Wikipedia (article \"Authority of the bootmaker\", CC BY-SA 4.0) states: Authority of the bootmaker, sometimes called epistemic authority, is a concept in anarchist philosophy describing a type of temporary, fully voluntary authority that an individual allows another to have over them in order to gain knowledge or experience.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fringe-science","kind":"concept","label":"Fringe science","sources":[{"id":"wikipedia.article.fringe-science","title":"English Wikipedia article: Fringe science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fringe+science"}],"status":"reported","summary":"English Wikipedia (article \"Fringe science\", CC BY-SA 4.0) states: Fringe science refers to ideas whose attributes include being highly speculative or relying on premises already refuted.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.doctrine","kind":"concept","label":"Doctrine","sources":[{"id":"wikipedia.article.doctrine","title":"English Wikipedia article: Doctrine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Doctrine"}],"status":"reported","summary":"English Wikipedia (article \"Doctrine\", CC BY-SA 4.0) states: Doctrine (from Latin: doctrina, meaning 'teaching, instruction') is a codification of beliefs or a body of teachings or instructions, taught principles or positions, as the essence of teachings in a given branch of knowledge or in a belief system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.emotional-reasoning","kind":"concept","label":"Emotional reasoning","sources":[{"id":"wikipedia.article.emotional-reasoning","title":"English Wikipedia article: Emotional reasoning","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Emotional+reasoning"}],"status":"reported","summary":"English Wikipedia (article \"Emotional reasoning\", CC BY-SA 4.0) states: Emotional reasoning is a cognitive process by which an individual concludes that their emotional reaction proves something is true, despite contrary empirical evidence.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rule-of-succession","kind":"concept","label":"Rule of succession","sources":[{"id":"wikipedia.article.rule-of-succession","title":"English Wikipedia article: Rule of succession","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rule+of+succession"}],"status":"reported","summary":"English Wikipedia (article \"Rule of succession\", CC BY-SA 4.0) states: In probability theory, the rule of succession is a formula introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.correlative-based-fallacies","kind":"concept","label":"Correlative-based fallacies","sources":[{"id":"wikipedia.article.correlative-based-fallacies","title":"English Wikipedia article: Correlative-based fallacies","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Correlative-based+fallacies"}],"status":"reported","summary":"English Wikipedia (article \"Correlative-based fallacies\", CC BY-SA 4.0) states: In philosophy, correlative-based fallacies are informal fallacies based on correlative conjunctions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.loki-s-wager","kind":"concept","label":"Loki's wager","sources":[{"id":"wikipedia.article.loki-s-wager","title":"English Wikipedia article: Loki's wager","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Loki%27s+wager"}],"status":"reported","summary":"English Wikipedia (article \"Loki's wager\", CC BY-SA 4.0) states: Loki's wager is the insistence that because two or more categories exist as poles on a spectrum with a grey area in the middle, the distinction between the two cannot be defined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.experimental-philosophy","kind":"concept","label":"Experimental philosophy","sources":[{"id":"wikipedia.article.experimental-philosophy","title":"English Wikipedia article: Experimental philosophy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Experimental+philosophy"}],"status":"reported","summary":"English Wikipedia (article \"Experimental philosophy\", CC BY-SA 4.0) states: Experimental philosophy (called x-phi for short) is an emerging field of philosophical inquiry that makes use of empirical data—often gathered through surveys which probe the intuitions of ordinary people—in order to inform research on philosophical questions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.radical-empiricism","kind":"concept","label":"Radical empiricism","sources":[{"id":"wikipedia.article.radical-empiricism","title":"English Wikipedia article: Radical empiricism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Radical+empiricism"}],"status":"reported","summary":"English Wikipedia (article \"Radical empiricism\", CC BY-SA 4.0) states: Radical empiricism is a philosophical doctrine put forward by William James.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.decidability-logic","kind":"concept","label":"Decidability (logic)","sources":[{"id":"wikipedia.article.decidability-logic","title":"English Wikipedia article: Decidability (logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decidability+%28logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Decidability (logic)\", CC BY-SA 4.0) states: In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fitch-notation","kind":"concept","label":"Fitch notation","sources":[{"id":"wikipedia.article.fitch-notation","title":"English Wikipedia article: Fitch notation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fitch+notation"}],"status":"reported","summary":"English Wikipedia (article \"Fitch notation\", CC BY-SA 4.0) states: Fitch notation, also known as Fitch diagrams (named after Frederic Fitch), is a method of presenting natural deduction proofs in propositional calculus and first-order logics using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.counterfactual-conditional","kind":"concept","label":"Counterfactual conditional","sources":[{"id":"wikipedia.article.counterfactual-conditional","title":"English Wikipedia article: Counterfactual conditional","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Counterfactual+conditional"}],"status":"reported","summary":"English Wikipedia (article \"Counterfactual conditional\", CC BY-SA 4.0) states: Counterfactual conditionals (also contrafactual/subjunctive/X-marked conditionals) are conditional sentences that describe what would have been true if circumstances had been different, typically when the antecedent is taken to be false or incompatible with what actually happened.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.clinamen","kind":"concept","label":"Clinamen","sources":[{"id":"wikipedia.article.clinamen","title":"English Wikipedia article: Clinamen","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clinamen"}],"status":"reported","summary":"English Wikipedia (article \"Clinamen\", CC BY-SA 4.0) states: Clinamen (; plural clinamina, derived from clinare, to incline) is the unpredictable swerve of atoms in the atomistic doctrine of Epicurus.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.social-constructivism","kind":"concept","label":"Social constructivism","sources":[{"id":"wikipedia.article.social-constructivism","title":"English Wikipedia article: Social constructivism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Social+constructivism"}],"status":"reported","summary":"English Wikipedia (article \"Social constructivism\", CC BY-SA 4.0) states: Social constructivism is a sociological theory of knowledge according to which human development is socially situated, and knowledge is constructed through interaction with others.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.attribution-psychology","kind":"concept","label":"Attribution (psychology)","sources":[{"id":"wikipedia.article.attribution-psychology","title":"English Wikipedia article: Attribution (psychology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attribution+%28psychology%29"}],"status":"reported","summary":"English Wikipedia (article \"Attribution (psychology)\", CC BY-SA 4.0) states: Attribution is a term used in psychology which deals with how individuals perceive the causes of everyday experience, as being either external or internal.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-hermeneutic","kind":"concept","label":"Double hermeneutic","sources":[{"id":"wikipedia.article.double-hermeneutic","title":"English Wikipedia article: Double hermeneutic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+hermeneutic"}],"status":"reported","summary":"English Wikipedia (article \"Double hermeneutic\", CC BY-SA 4.0) states: The double hermeneutic is the theory, expounded by sociologist Anthony Giddens, that everyday \"lay\" concepts and those from the social sciences have a two-way relationship.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.basic-belief","kind":"concept","label":"Basic belief","sources":[{"id":"wikipedia.article.basic-belief","title":"English Wikipedia article: Basic belief","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basic+belief"}],"status":"reported","summary":"English Wikipedia (article \"Basic belief\", CC BY-SA 4.0) states: Basic beliefs (also commonly called foundational beliefs or core beliefs) are, under the epistemological view called foundationalism, the axioms of a belief system.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-science","kind":"concept","label":"Design science","sources":[{"id":"wikipedia.article.design-science","title":"English Wikipedia article: Design science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+science"}],"status":"reported","summary":"English Wikipedia (article \"Design science\", CC BY-SA 4.0) states: Design science refers to a scientific, i.e. rational and systematic, approach to designing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.coincidence","kind":"concept","label":"Coincidence","sources":[{"id":"wikipedia.article.coincidence","title":"English Wikipedia article: Coincidence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coincidence"}],"status":"reported","summary":"English Wikipedia (article \"Coincidence\", CC BY-SA 4.0) states: A coincidence is a remarkable concurrence of events or circumstances that have no apparent causal connection with one another.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.intertwingularity","kind":"concept","label":"Intertwingularity","sources":[{"id":"wikipedia.article.intertwingularity","title":"English Wikipedia article: Intertwingularity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Intertwingularity"}],"status":"reported","summary":"English Wikipedia (article \"Intertwingularity\", CC BY-SA 4.0) states: Intertwingularity is a portmanteau of the words intertwined and intermingled, coined by information-technology theorist Ted Nelson in 1974 to express the dense and interconnected relationships in human knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.doxastic-logic","kind":"concept","label":"Doxastic logic","sources":[{"id":"wikipedia.article.doxastic-logic","title":"English Wikipedia article: Doxastic logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Doxastic+logic"}],"status":"reported","summary":"English Wikipedia (article \"Doxastic logic\", CC BY-SA 4.0) states: Doxastic logic is a type of logic concerned with reasoning about beliefs.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.courtier-s-reply","kind":"concept","label":"Courtier's reply","sources":[{"id":"wikipedia.article.courtier-s-reply","title":"English Wikipedia article: Courtier's reply","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Courtier%27s+reply"}],"status":"reported","summary":"English Wikipedia (article \"Courtier's reply\", CC BY-SA 4.0) states: The courtier's reply is a type of informal fallacy, coined by American biologist PZ Myers, in which a respondent to criticism claims that the critic lacks sufficient knowledge, credentials, or training to pose any sort of criticism whatsoever.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.argument-map","kind":"concept","label":"Argument map","sources":[{"id":"wikipedia.article.argument-map","title":"English Wikipedia article: Argument map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Argument+map"}],"status":"reported","summary":"English Wikipedia (article \"Argument map\", CC BY-SA 4.0) states: An argument map or argument diagram is a visual representation of the structure of an argument.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.feminist-post-structuralist-discourse-analysis","kind":"concept","label":"Feminist post-structuralist discourse analysis","sources":[{"id":"wikipedia.article.feminist-post-structuralist-discourse-analysis","title":"English Wikipedia article: Feminist post-structuralist discourse analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Feminist+post-structuralist+discourse+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Feminist post-structuralist discourse analysis\", CC BY-SA 4.0) states: Feminist post-structuralist discourse analysis (FPDA) is a method of discourse analysis based on Chris Weedon's theories of feminist post-structuralism, and developed as a method of analysis by Judith Baxter in 2003.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.sense-data","kind":"concept","label":"Sense data","sources":[{"id":"wikipedia.article.sense-data","title":"English Wikipedia article: Sense data","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sense+data"}],"status":"reported","summary":"English Wikipedia (article \"Sense data\", CC BY-SA 4.0) states: The theory of sense data is a view in the philosophy of perception, popularly held in the early 20th century by philosophers such as Bertrand Russell, C. D. Broad, H. H. Price, A. J. Ayer, and G. E. Moore.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.free-choice-inference","kind":"concept","label":"Free choice inference","sources":[{"id":"wikipedia.article.free-choice-inference","title":"English Wikipedia article: Free choice inference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Free+choice+inference"}],"status":"reported","summary":"English Wikipedia (article \"Free choice inference\", CC BY-SA 4.0) states: Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-inertia","kind":"concept","label":"Knowledge inertia","sources":[{"id":"wikipedia.article.knowledge-inertia","title":"English Wikipedia article: Knowledge inertia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+inertia"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge inertia\", CC BY-SA 4.0) states: Knowledge inertia (KI) is a concept in knowledge management.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.frankfurt-cases","kind":"concept","label":"Frankfurt cases","sources":[{"id":"wikipedia.article.frankfurt-cases","title":"English Wikipedia article: Frankfurt cases","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Frankfurt+cases"}],"status":"reported","summary":"English Wikipedia (article \"Frankfurt cases\", CC BY-SA 4.0) states: Frankfurt cases (also known as Frankfurt counterexamples or Frankfurt-style cases) were presented by philosopher Harry Frankfurt in 1969 as counterexamples to the principle of alternate possibilities (PAP), which holds that an agent is morally responsible for an action only if that person could have done otherwise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.gunslinger-effect","kind":"concept","label":"Gunslinger effect","sources":[{"id":"wikipedia.article.gunslinger-effect","title":"English Wikipedia article: Gunslinger effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gunslinger+effect"}],"status":"reported","summary":"English Wikipedia (article \"Gunslinger effect\", CC BY-SA 4.0) states: The gunslinger effect, also sometimes called Bohr's law or the gunfighter's dilemma, is a psychophysical theory which says that an intentional or willed movement is slower than an automatic or reaction movement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.discourse-ethics","kind":"concept","label":"Discourse ethics","sources":[{"id":"wikipedia.article.discourse-ethics","title":"English Wikipedia article: Discourse ethics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discourse+ethics"}],"status":"reported","summary":"English Wikipedia (article \"Discourse ethics\", CC BY-SA 4.0) states: Discourse ethics is a philosophical theory of morality, attempting to update Kantian ethics for modern egalitarian intuitions and social epistemology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.duck-test","kind":"concept","label":"Duck test","sources":[{"id":"wikipedia.article.duck-test","title":"English Wikipedia article: Duck test","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Duck+test"}],"status":"reported","summary":"English Wikipedia (article \"Duck test\", CC BY-SA 4.0) states: The duck test is a frequently cited colloquial example of abductive reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.the-central-science","kind":"concept","label":"The central science","sources":[{"id":"wikipedia.article.the-central-science","title":"English Wikipedia article: The central science","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=The+central+science"}],"status":"reported","summary":"English Wikipedia (article \"The central science\", CC BY-SA 4.0) states: Chemistry is often called the central science because of its role in connecting the physical sciences, which include chemistry, with the life sciences, pharmaceutical sciences and applied sciences such as medicine and engineering.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.overdetermination","kind":"concept","label":"Overdetermination","sources":[{"id":"wikipedia.article.overdetermination","title":"English Wikipedia article: Overdetermination","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Overdetermination"}],"status":"reported","summary":"English Wikipedia (article \"Overdetermination\", CC BY-SA 4.0) states: Overdetermination occurs when a single observed effect is determined by multiple causes, any one of which alone would be conceivably sufficient to account for (\"determine\") the effect.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.graphism-thesis","kind":"concept","label":"Graphism thesis","sources":[{"id":"wikipedia.article.graphism-thesis","title":"English Wikipedia article: Graphism thesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Graphism+thesis"}],"status":"reported","summary":"English Wikipedia (article \"Graphism thesis\", CC BY-SA 4.0) states: In the sociology of science and science and technology studies (STS), the graphism thesis is a proposition advanced by Bruno Latour that visual inscriptions—especially graphs, diagrams, and other visual representations—are central to the practice and authority of science.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.constant-conjunction","kind":"concept","label":"Constant conjunction","sources":[{"id":"wikipedia.article.constant-conjunction","title":"English Wikipedia article: Constant conjunction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constant+conjunction"}],"status":"reported","summary":"English Wikipedia (article \"Constant conjunction\", CC BY-SA 4.0) states: In philosophy, constant conjunction is a relationship between two events, where one event is invariably followed by the other: if the occurrence of A is always followed by B, A and B are said to be constantly conjoined.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.theory","kind":"concept","label":"Theory","sources":[{"id":"wikipedia.article.theory","title":"English Wikipedia article: Theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Theory"}],"status":"reported","summary":"English Wikipedia (article \"Theory\", CC BY-SA 4.0) states: A theory is, in general, a set of propositions or ideas about something, developed in a variety of ways through any sort of reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.denying-the-correlative","kind":"concept","label":"Denying the correlative","sources":[{"id":"wikipedia.article.denying-the-correlative","title":"English Wikipedia article: Denying the correlative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Denying+the+correlative"}],"status":"reported","summary":"English Wikipedia (article \"Denying the correlative\", CC BY-SA 4.0) states: The informal fallacy of denying the correlative is an attempt made at introducing alternatives where there are none.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.nothing-to-hide-argument","kind":"concept","label":"Nothing to hide argument","sources":[{"id":"wikipedia.article.nothing-to-hide-argument","title":"English Wikipedia article: Nothing to hide argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Nothing+to+hide+argument"}],"status":"reported","summary":"English Wikipedia (article \"Nothing to hide argument\", CC BY-SA 4.0) states: The \"nothing to hide\" argument is an informal fallacy which states that an individual has no reason to fear or oppose surveillance or breach of privacy, unless they are afraid they will uncover their own wrongdoing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.hermeneutics","kind":"field","label":"Hermeneutics","sources":[{"id":"wikipedia.article.hermeneutics","title":"English Wikipedia article: Hermeneutics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hermeneutics"}],"status":"reported","summary":"English Wikipedia (article \"Hermeneutics\", CC BY-SA 4.0) states: Hermeneutics () is the study of the methodological principles of interpretation, especially the interpretation of biblical texts, wisdom literature, and philosophical texts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.definition","kind":"concept","label":"Definition","sources":[{"id":"wikipedia.article.definition","title":"English Wikipedia article: Definition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Definition"}],"status":"reported","summary":"English Wikipedia (article \"Definition\", CC BY-SA 4.0) states: A definition is a semantic statement of the meaning of a term (a word, phrase, or other set of symbols).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.game-semantics","kind":"concept","label":"Game semantics","sources":[{"id":"wikipedia.article.game-semantics","title":"English Wikipedia article: Game semantics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Game+semantics"}],"status":"reported","summary":"English Wikipedia (article \"Game semantics\", CC BY-SA 4.0) states: Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.veridicality","kind":"concept","label":"Veridicality","sources":[{"id":"wikipedia.article.veridicality","title":"English Wikipedia article: Veridicality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Veridicality"}],"status":"reported","summary":"English Wikipedia (article \"Veridicality\", CC BY-SA 4.0) states: In linguistics, veridicality (from Latin \"truthfully said\") is a semantic or grammatical assertion of the truth of an utterance.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.lazy-argument","kind":"concept","label":"Lazy argument","sources":[{"id":"wikipedia.article.lazy-argument","title":"English Wikipedia article: Lazy argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Lazy+argument"}],"status":"reported","summary":"English Wikipedia (article \"Lazy argument\", CC BY-SA 4.0) states: The lazy argument or idle argument (Ancient Greek: ἀργὸς λόγος) is an attempt to undermine the philosophical doctrine of fatalism by demonstrating that, if everything that happens is determined by fate, it is futile to take any kind of action.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epicurean-paradox","kind":"concept","label":"Epicurean paradox","sources":[{"id":"wikipedia.article.epicurean-paradox","title":"English Wikipedia article: Epicurean paradox","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epicurean+paradox"}],"status":"reported","summary":"English Wikipedia (article \"Epicurean paradox\", CC BY-SA 4.0) states: The Epicurean paradox is a logical dilemma about the problem of evil attributed to the Greek philosopher Epicurus, who argued against the existence of a god who is simultaneously omniscient, omnipotent, and omnibenevolent.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-measures","kind":"concept","label":"Approximate measures","sources":[{"id":"wikipedia.article.approximate-measures","title":"English Wikipedia article: Approximate measures","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+measures"}],"status":"reported","summary":"English Wikipedia (article \"Approximate measures\", CC BY-SA 4.0) states: Approximate measures are units of volumetric measurement which are not defined by a government or government-sanctioned organization, or which were previously defined and are now repealed, yet which remain in use.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.sociology-of-absences","kind":"concept","label":"Sociology of absences","sources":[{"id":"wikipedia.article.sociology-of-absences","title":"English Wikipedia article: Sociology of absences","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sociology+of+absences"}],"status":"reported","summary":"English Wikipedia (article \"Sociology of absences\", CC BY-SA 4.0) states: The sociology of absences is a sociological theory developed by Boaventura de Sousa Santos which, he says, \"aims to show that what does not exist is in fact actively produced as non-existent, that is to say as an unbelievable alternative to what is supposed to exist”.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.authority-bias","kind":"concept","label":"Authority bias","sources":[{"id":"wikipedia.article.authority-bias","title":"English Wikipedia article: Authority bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Authority+bias"}],"status":"reported","summary":"English Wikipedia (article \"Authority bias\", CC BY-SA 4.0) states: Authority bias is the tendency to attribute greater accuracy to the opinion of an authority figure (unrelated to its content) and be more influenced by that opinion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.science-of-science-policy","kind":"concept","label":"Science of science policy","sources":[{"id":"wikipedia.article.science-of-science-policy","title":"English Wikipedia article: Science of science policy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Science+of+science+policy"}],"status":"reported","summary":"English Wikipedia (article \"Science of science policy\", CC BY-SA 4.0) states: Science of science policy (SoSP) is an emerging interdisciplinary research area that seeks to develop theoretical and empirical models of the scientific enterprise.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-articulation","kind":"concept","label":"Double articulation","sources":[{"id":"wikipedia.article.double-articulation","title":"English Wikipedia article: Double articulation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+articulation"}],"status":"reported","summary":"English Wikipedia (article \"Double articulation\", CC BY-SA 4.0) states: In linguistics, double articulation, duality of patterning, or duality is the fundamental language phenomenon consisting of the use of combinations of a small number of meaningless elements (sounds, that is, phonemes) to produce a large number of meaningful elements (words, actually morphemes).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.belief","kind":"concept","label":"Belief","sources":[{"id":"wikipedia.article.belief","title":"English Wikipedia article: Belief","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belief"}],"status":"reported","summary":"English Wikipedia (article \"Belief\", CC BY-SA 4.0) states: A belief is a subjective attitude that something is true or a state of affairs is the case.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemicism","kind":"concept","label":"Epistemicism","sources":[{"id":"wikipedia.article.epistemicism","title":"English Wikipedia article: Epistemicism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemicism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemicism\", CC BY-SA 4.0) states: Epistemicism is a position about vagueness in the philosophy of language or metaphysics, according to which there are facts about the boundaries of a vague predicate which we cannot possibly discover.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.research-program","kind":"concept","label":"Research program","sources":[{"id":"wikipedia.article.research-program","title":"English Wikipedia article: Research program","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Research+program"}],"status":"reported","summary":"English Wikipedia (article \"Research program\", CC BY-SA 4.0) states: A research program (British English: research programme) is a professional network of scientists conducting basic research.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.harking","kind":"concept","label":"HARKing","sources":[{"id":"wikipedia.article.harking","title":"English Wikipedia article: HARKing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=HARKing"}],"status":"reported","summary":"English Wikipedia (article \"HARKing\", CC BY-SA 4.0) states: HARKing (hypothesizing after the results are known) is an acronym coined by social psychologist Norbert Kerr that refers to the questionable research practice of \"presenting a post hoc hypothesis in the introduction of a research report as if it were an a priori hypothesis\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.design-based-research","kind":"concept","label":"Design-based research","sources":[{"id":"wikipedia.article.design-based-research","title":"English Wikipedia article: Design-based research","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design-based+research"}],"status":"reported","summary":"English Wikipedia (article \"Design-based research\", CC BY-SA 4.0) states: Design-based research (DBR) is a type of research methodology used by researchers in the learning sciences, which is a sub-field of education.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.end-of-history-illusion","kind":"concept","label":"End-of-history illusion","sources":[{"id":"wikipedia.article.end-of-history-illusion","title":"English Wikipedia article: End-of-history illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=End-of-history+illusion"}],"status":"reported","summary":"English Wikipedia (article \"End-of-history illusion\", CC BY-SA 4.0) states: The end-of-history illusion is a psychological illusion in which individuals of all ages believe that they have experienced significant personal growth and changes in tastes up to the present moment, but will not substantially grow or mature in the future.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.turkey-illusion","kind":"concept","label":"Turkey illusion","sources":[{"id":"wikipedia.article.turkey-illusion","title":"English Wikipedia article: Turkey illusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turkey+illusion"}],"status":"reported","summary":"English Wikipedia (article \"Turkey illusion\", CC BY-SA 4.0) states: Turkey illusion is a cognitive bias describing the surprise resulting from a break in a trend, if one does not know the causes or the framework conditions for this trend.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.distinction-without-a-difference","kind":"concept","label":"Distinction without a difference","sources":[{"id":"wikipedia.article.distinction-without-a-difference","title":"English Wikipedia article: Distinction without a difference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distinction+without+a+difference"}],"status":"reported","summary":"English Wikipedia (article \"Distinction without a difference\", CC BY-SA 4.0) states: A distinction without a difference is an informal fallacy where an author or speaker attempts to describe a distinction between two things where no discernible difference exists.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.objection-argument","kind":"concept","label":"Objection (argument)","sources":[{"id":"wikipedia.article.objection-argument","title":"English Wikipedia article: Objection (argument)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Objection+%28argument%29"}],"status":"reported","summary":"English Wikipedia (article \"Objection (argument)\", CC BY-SA 4.0) states: In argumentation, an objection is a reason arguing against a premise, argument, or conclusion.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.logical-truth","kind":"concept","label":"Logical truth","sources":[{"id":"wikipedia.article.logical-truth","title":"English Wikipedia article: Logical truth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logical+truth"}],"status":"reported","summary":"English Wikipedia (article \"Logical truth\", CC BY-SA 4.0) states: Logical truth is one of the most fundamental concepts in logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.geometry-of-interaction","kind":"concept","label":"Geometry of interaction","sources":[{"id":"wikipedia.article.geometry-of-interaction","title":"English Wikipedia article: Geometry of interaction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometry+of+interaction"}],"status":"reported","summary":"English Wikipedia (article \"Geometry of interaction\", CC BY-SA 4.0) states: In proof theory, the Geometry of Interaction (GoI) was introduced by Jean-Yves Girard shortly after his work on linear logic.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-finding","kind":"concept","label":"Problem finding","sources":[{"id":"wikipedia.article.problem-finding","title":"English Wikipedia article: Problem finding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+finding"}],"status":"reported","summary":"English Wikipedia (article \"Problem finding\", CC BY-SA 4.0) states: Problem finding is the act of problem solving in which intellectual vision and insight are used into what is missing.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.standpoint-feminism","kind":"concept","label":"Standpoint feminism","sources":[{"id":"wikipedia.article.standpoint-feminism","title":"English Wikipedia article: Standpoint feminism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Standpoint+feminism"}],"status":"reported","summary":"English Wikipedia (article \"Standpoint feminism\", CC BY-SA 4.0) states: Standpoint feminism is a theory that feminist social science should be practiced from the standpoint of women or particular groups of women, as some scholars (e.g.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.automation-bias","kind":"concept","label":"Automation bias","sources":[{"id":"wikipedia.article.automation-bias","title":"English Wikipedia article: Automation bias","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automation+bias"}],"status":"reported","summary":"English Wikipedia (article \"Automation bias\", CC BY-SA 4.0) states: Automation bias is the propensity for humans to favor suggestions from automated decision-making systems and to ignore contradictory information made without automation, even if it is correct.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.fudge-factor","kind":"concept","label":"Fudge factor","sources":[{"id":"wikipedia.article.fudge-factor","title":"English Wikipedia article: Fudge factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fudge+factor"}],"status":"reported","summary":"English Wikipedia (article \"Fudge factor\", CC BY-SA 4.0) states: A fudge factor is an ad hoc quantity or element introduced into a calculation, formula or model in order to make it fit observations or expectations.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"field.wikipedia.scientometrics","kind":"field","label":"Scientometrics","sources":[{"id":"wikipedia.article.scientometrics","title":"English Wikipedia article: Scientometrics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Scientometrics"}],"status":"reported","summary":"English Wikipedia (article \"Scientometrics\", CC BY-SA 4.0) states: Scientometrics is a quantitative discipline that studies science through mathematical and statistical methods, analyzing both scientific output and the dynamics of research.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dynamic-semantics","kind":"concept","label":"Dynamic semantics","sources":[{"id":"wikipedia.article.dynamic-semantics","title":"English Wikipedia article: Dynamic semantics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dynamic+semantics"}],"status":"reported","summary":"English Wikipedia (article \"Dynamic semantics\", CC BY-SA 4.0) states: Dynamic semantics is a framework in logic and natural language semantics that treats the meaning of a sentence as its potential to update a context.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemic-insight","kind":"concept","label":"Epistemic insight","sources":[{"id":"wikipedia.article.epistemic-insight","title":"English Wikipedia article: Epistemic insight","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemic+insight"}],"status":"reported","summary":"English Wikipedia (article \"Epistemic insight\", CC BY-SA 4.0) states: Epistemic insight is a leap of mind that takes place when a learner makes a connection or realisation about how knowledge works.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.binary-opposition","kind":"concept","label":"Binary opposition","sources":[{"id":"wikipedia.article.binary-opposition","title":"English Wikipedia article: Binary opposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Binary+opposition"}],"status":"reported","summary":"English Wikipedia (article \"Binary opposition\", CC BY-SA 4.0) states: A binary opposition (also binary system) is a pair of related terms or concepts that are opposite in meaning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-idealism","kind":"concept","label":"Epistemological idealism","sources":[{"id":"wikipedia.article.epistemological-idealism","title":"English Wikipedia article: Epistemological idealism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+idealism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological idealism\", CC BY-SA 4.0) states: Epistemological idealism is a subjectivist position in epistemology that holds that what one knows about an object exists only in one's mind.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.simple-philosophy","kind":"concept","label":"Simple (philosophy)","sources":[{"id":"wikipedia.article.simple-philosophy","title":"English Wikipedia article: Simple (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Simple+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Simple (philosophy)\", CC BY-SA 4.0) states: In contemporary mereology, a simple or indivisible monomere (in mereology, not in chemistry) is any thing that has no proper parts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.cosmological-argument","kind":"concept","label":"Cosmological argument","sources":[{"id":"wikipedia.article.cosmological-argument","title":"English Wikipedia article: Cosmological argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cosmological+argument"}],"status":"reported","summary":"English Wikipedia (article \"Cosmological argument\", CC BY-SA 4.0) states: In philosophy of religion, a cosmological argument is an argument for the existence of God based on observational statements concerning the universe and its contents, examined metaphysically through the lenses of causation or motion (change).","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.irrationality","kind":"concept","label":"Irrationality","sources":[{"id":"wikipedia.article.irrationality","title":"English Wikipedia article: Irrationality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Irrationality"}],"status":"reported","summary":"English Wikipedia (article \"Irrationality\", CC BY-SA 4.0) states: Irrationality is cognition, thinking, talking, or acting without rationality.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.double-counting-fallacy","kind":"concept","label":"Double counting (fallacy)","sources":[{"id":"wikipedia.article.double-counting-fallacy","title":"English Wikipedia article: Double counting (fallacy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+counting+%28fallacy%29"}],"status":"reported","summary":"English Wikipedia (article \"Double counting (fallacy)\", CC BY-SA 4.0) states: Double counting is a fallacy in reasoning.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-solving-environment","kind":"concept","label":"Problem solving environment","sources":[{"id":"wikipedia.article.problem-solving-environment","title":"English Wikipedia article: Problem solving environment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+solving+environment"}],"status":"reported","summary":"English Wikipedia (article \"Problem solving environment\", CC BY-SA 4.0) states: A problem solving environment (PSE) is a completed, integrated and specialised computer software for solving one class of problems, combining automated problem-solving methods with human-oriented tools for guiding the problem resolution.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.aporia","kind":"concept","label":"Aporia","sources":[{"id":"wikipedia.article.aporia","title":"English Wikipedia article: Aporia","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aporia"}],"status":"reported","summary":"English Wikipedia (article \"Aporia\", CC BY-SA 4.0) states: In philosophy, an aporia (Ancient Greek: ᾰ̓πορῐ́ᾱ, romanized: aporíā, lit. '\"lacking passage\", also: \"impasse\", \"difficulty in passage\", \"puzzlement\"') is a conundrum or state of puzzlement.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.dysteleology","kind":"concept","label":"Dysteleology","sources":[{"id":"wikipedia.article.dysteleology","title":"English Wikipedia article: Dysteleology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dysteleology"}],"status":"reported","summary":"English Wikipedia (article \"Dysteleology\", CC BY-SA 4.0) states: Dysteleology is the philosophical view that existence has no telos – no final cause from purposeful design; it is the opposite of teleology.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.testimony","kind":"concept","label":"Testimony","sources":[{"id":"wikipedia.article.testimony","title":"English Wikipedia article: Testimony","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Testimony"}],"status":"reported","summary":"English Wikipedia (article \"Testimony\", CC BY-SA 4.0) states: Testimony is a solemn attestation as to the truth of a situation.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.availability-heuristic","kind":"concept","label":"Availability heuristic","sources":[{"id":"wikipedia.article.availability-heuristic","title":"English Wikipedia article: Availability heuristic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+heuristic"}],"status":"reported","summary":"English Wikipedia (article \"Availability heuristic\", CC BY-SA 4.0) states: The availability heuristic, also known as availability bias, is a mental shortcut that relies on immediate examples that come to a given person's mind when evaluating a specific topic, concept, method, or decision.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.blind-men-and-an-elephant","kind":"concept","label":"Blind men and an elephant","sources":[{"id":"wikipedia.article.blind-men-and-an-elephant","title":"English Wikipedia article: Blind men and an elephant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blind+men+and+an+elephant"}],"status":"reported","summary":"English Wikipedia (article \"Blind men and an elephant\", CC BY-SA 4.0) states: The parable of the blind men and an elephant is a story of a group of blind men who have never come across an elephant before and who learn and imagine what the elephant is like by touching it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-particularism","kind":"concept","label":"Epistemological particularism","sources":[{"id":"wikipedia.article.epistemological-particularism","title":"English Wikipedia article: Epistemological particularism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+particularism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological particularism\", CC BY-SA 4.0) states: Epistemological particularism is the view that one can know something without knowing how one knows it.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.knowledge-is-power","kind":"concept","label":"Knowledge is power","sources":[{"id":"wikipedia.article.knowledge-is-power","title":"English Wikipedia article: Knowledge is power","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Knowledge+is+power"}],"status":"reported","summary":"English Wikipedia (article \"Knowledge is power\", CC BY-SA 4.0) states: The phrase \"scientia potentia est\" (or \"scientia est potentia\" or also \"scientia potestas est\") is a Latin aphorism meaning \"knowledge is power\", commonly attributed to Sir Francis Bacon.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.evidentialism","kind":"concept","label":"Evidentialism","sources":[{"id":"wikipedia.article.evidentialism","title":"English Wikipedia article: Evidentialism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Evidentialism"}],"status":"reported","summary":"English Wikipedia (article \"Evidentialism\", CC BY-SA 4.0) states: Evidentialism is a thesis in epistemology which states that one is justified to believe something if and only if that person has evidence which supports said belief.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.philosophical-razor","kind":"concept","label":"Philosophical razor","sources":[{"id":"wikipedia.article.philosophical-razor","title":"English Wikipedia article: Philosophical razor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Philosophical+razor"}],"status":"reported","summary":"English Wikipedia (article \"Philosophical razor\", CC BY-SA 4.0) states: In philosophy, a razor is a principle or rule of thumb that allows one to eliminate (shave off) unlikely explanations for a phenomenon, or avoid unnecessary actions.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rational-egoism","kind":"concept","label":"Rational egoism","sources":[{"id":"wikipedia.article.rational-egoism","title":"English Wikipedia article: Rational egoism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rational+egoism"}],"status":"reported","summary":"English Wikipedia (article \"Rational egoism\", CC BY-SA 4.0) states: Rational egoism (also called rational selfishness) is the principle that an action is rational if and only if it maximizes one's self-interest.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.problem-statement","kind":"concept","label":"Problem statement","sources":[{"id":"wikipedia.article.problem-statement","title":"English Wikipedia article: Problem statement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Problem+statement"}],"status":"reported","summary":"English Wikipedia (article \"Problem statement\", CC BY-SA 4.0) states: A problem statement is a description of an issue to be addressed, or a condition to be improved upon.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ecstasy-philosophy","kind":"concept","label":"Ecstasy (philosophy)","sources":[{"id":"wikipedia.article.ecstasy-philosophy","title":"English Wikipedia article: Ecstasy (philosophy)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ecstasy+%28philosophy%29"}],"status":"reported","summary":"English Wikipedia (article \"Ecstasy (philosophy)\", CC BY-SA 4.0) states: In existential philosophy, ecstasy (from the Ancient Greek ἔκστασις [ékstasis] 'to be or stand outside oneself, a removal to elsewhere'; from ek- 'out' and stasis 'stand' or 'standoff of forces') describes a sense of being \"outside-itself\".","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.base-unit-of-measurement","kind":"concept","label":"Base unit of measurement","sources":[{"id":"wikipedia.article.base-unit-of-measurement","title":"English Wikipedia article: Base unit of measurement","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Base+unit+of+measurement"}],"status":"reported","summary":"English Wikipedia (article \"Base unit of measurement\", CC BY-SA 4.0) states: A base unit of measurement (also referred to as a base unit or fundamental unit) is a unit of measurement adopted for a base quantity.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.trust-social-science","kind":"concept","label":"Trust (social science)","sources":[{"id":"wikipedia.article.trust-social-science","title":"English Wikipedia article: Trust (social science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Trust+%28social+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Trust (social science)\", CC BY-SA 4.0) states: Trust is the belief that another person will do what is expected and is built through repeated consistency.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.bandwagon-effect","kind":"concept","label":"Bandwagon effect","sources":[{"id":"wikipedia.article.bandwagon-effect","title":"English Wikipedia article: Bandwagon effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bandwagon+effect"}],"status":"reported","summary":"English Wikipedia (article \"Bandwagon effect\", CC BY-SA 4.0) states: The bandwagon effect is a psychological phenomenon where people adopt certain behaviors, styles, or attitudes simply because others are doing so.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.extensional-context","kind":"concept","label":"Extensional context","sources":[{"id":"wikipedia.article.extensional-context","title":"English Wikipedia article: Extensional context","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extensional+context"}],"status":"reported","summary":"English Wikipedia (article \"Extensional context\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in which a sub-sentential expression e can be replaced by an expression with the same extension and without affecting the truth-value of the sentence as a whole.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.epistemological-pluralism","kind":"concept","label":"Epistemological pluralism","sources":[{"id":"wikipedia.article.epistemological-pluralism","title":"English Wikipedia article: Epistemological pluralism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epistemological+pluralism"}],"status":"reported","summary":"English Wikipedia (article \"Epistemological pluralism\", CC BY-SA 4.0) states: Epistemological pluralism is a term used in philosophy, economics, and virtually any field of study to refer to different ways of knowing things; different epistemological methodologies for attaining a fuller description of a particular field.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.supervenience","kind":"concept","label":"Supervenience","sources":[{"id":"wikipedia.article.supervenience","title":"English Wikipedia article: Supervenience","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Supervenience"}],"status":"reported","summary":"English Wikipedia (article \"Supervenience\", CC BY-SA 4.0) states: In philosophy, supervenience refers to a relation between sets of properties or sets of facts.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.force-matching","kind":"concept","label":"Force matching","sources":[{"id":"wikipedia.article.force-matching","title":"English Wikipedia article: Force matching","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Force+matching"}],"status":"reported","summary":"English Wikipedia (article \"Force matching\", CC BY-SA 4.0) states: Force matching is a research method consisting of test subjects attempting to produce a set forces that are equal to a set of more reliable reference forces.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.meta-functional-expertise","kind":"concept","label":"Meta-functional expertise","sources":[{"id":"wikipedia.article.meta-functional-expertise","title":"English Wikipedia article: Meta-functional expertise","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Meta-functional+expertise"}],"status":"reported","summary":"English Wikipedia (article \"Meta-functional expertise\", CC BY-SA 4.0) states: Meta-functional expertise is the breadth of one’s strategically important knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.lateral-thinking","kind":"concept","label":"Lateral thinking","sources":[{"id":"wikipedia.article.lateral-thinking","title":"English Wikipedia article: Lateral thinking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Lateral+thinking"}],"status":"reported","summary":"English Wikipedia (article \"Lateral thinking\", CC BY-SA 4.0) states: Lateral thinking is a manner of solving problems using an indirect and creative approach via reasoning that is not immediately obvious.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ergo-decedo","kind":"concept","label":"Ergo decedo","sources":[{"id":"wikipedia.article.ergo-decedo","title":"English Wikipedia article: Ergo decedo","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ergo+decedo"}],"status":"reported","summary":"English Wikipedia (article \"Ergo decedo\", CC BY-SA 4.0) states: Ergo decedo, Latin for \"therefore I leave\" or \"then I go off\", a truncation of argumentum ergo decedo, and colloquially denominated the traitorous critic fallacy, denotes responding to the criticism of a critic by implying that the critic is motivated by undisclosed favorability or affiliation to an out-group, rather than responding to the criticism itself.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.ontoclean","kind":"concept","label":"OntoClean","sources":[{"id":"wikipedia.article.ontoclean","title":"English Wikipedia article: OntoClean","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=OntoClean"}],"status":"reported","summary":"English Wikipedia (article \"OntoClean\", CC BY-SA 4.0) states: OntoClean is a methodology for analyzing ontologies based on formal, domain-independent properties of classes (the metaproperties) developed by Nicola Guarino and Chris Welty.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.rational-fideism","kind":"concept","label":"Rational fideism","sources":[{"id":"wikipedia.article.rational-fideism","title":"English Wikipedia article: Rational fideism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Rational+fideism"}],"status":"reported","summary":"English Wikipedia (article \"Rational fideism\", CC BY-SA 4.0) states: Rational fideism is the philosophical view that considers faith to be precursor for any reliable knowledge.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.extension-semantics","kind":"concept","label":"Extension (semantics)","sources":[{"id":"wikipedia.article.extension-semantics","title":"English Wikipedia article: Extension (semantics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extension+%28semantics%29"}],"status":"reported","summary":"English Wikipedia (article \"Extension (semantics)\", CC BY-SA 4.0) states: In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — the extension of a concept, idea, or sign consists of the things to which it applies, in contrast with its comprehension or intension, which consists very roughly of the ideas, properties, or corresponding signs that are implied or suggested by the concept in question.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.infinite-regress","kind":"concept","label":"Infinite regress","sources":[{"id":"wikipedia.article.infinite-regress","title":"English Wikipedia article: Infinite regress","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Infinite+regress"}],"status":"reported","summary":"English Wikipedia (article \"Infinite regress\", CC BY-SA 4.0) states: Infinite regress is a philosophical concept in which each entity in an infinite series depends on its predecessor, following a recursive principle.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.defensive-pessimism","kind":"concept","label":"Defensive pessimism","sources":[{"id":"wikipedia.article.defensive-pessimism","title":"English Wikipedia article: Defensive pessimism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Defensive+pessimism"}],"status":"reported","summary":"English Wikipedia (article \"Defensive pessimism\", CC BY-SA 4.0) states: Defensive pessimism is a cognitive strategy in which an individual sets a low expectation for their performance, regardless of how well they have done in the past.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.open-question-argument","kind":"concept","label":"Open-question argument","sources":[{"id":"wikipedia.article.open-question-argument","title":"English Wikipedia article: Open-question argument","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Open-question+argument"}],"status":"reported","summary":"English Wikipedia (article \"Open-question argument\", CC BY-SA 4.0) states: The open-question argument is a philosophical argument put forward by British philosopher G. E. Moore in §13 of Principia Ethica (1903), to refute the equating of the property of goodness with some non-moral property, X, whether natural (e.g. pleasure) or supernatural (e.g.","tags":[]},{"aliases":[],"domain":"roots","era":"undated","frontier":false,"id":"concept.wikipedia.faraday-paradox-electrochemistry","kind":"concept","label":"Faraday paradox (electrochemistry)","sources":[{"id":"wikipedia.article.faraday-paradox-electrochemistry","title":"English Wikipedia article: Faraday paradox (electrochemistry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Faraday+paradox+%28electrochemistry%29"}],"status":"reported","summary":"English Wikipedia (article \"Faraday paradox (electrochemistry)\", CC BY-SA 4.0) states: The Faraday paradox was a once inexplicable aspect of the reaction between nitric acid and steel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.civil-engineering","kind":"field","label":"Civil engineering","sources":[{"id":"wikipedia.article.civil-engineering","title":"English Wikipedia article: Civil engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Civil+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Civil engineering\", CC BY-SA 4.0) states: Civil engineering is a professional engineering discipline that deals with the design, construction, and maintenance of the physical and naturally built environment, including public works such as roads, bridges, canals, dams, airports, sewage systems, pipelines, structural components of buildings, and railways.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.electrical-engineering","kind":"field","label":"Electrical engineering","sources":[{"id":"wikipedia.article.electrical-engineering","title":"English Wikipedia article: Electrical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electrical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Electrical engineering\", CC BY-SA 4.0) states: Electrical engineering is an engineering discipline concerned with the study, design, and application of equipment, devices, and systems that use electricity, electronics, and electromagnetism.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.aerospace-engineering","kind":"field","label":"Aerospace engineering","sources":[{"id":"wikipedia.article.aerospace-engineering","title":"English Wikipedia article: Aerospace engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace engineering\", CC BY-SA 4.0) states: Aerospace engineering is the primary field of engineering concerned with the development of aircraft and spacecraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.control-theory","kind":"field","label":"Control theory","sources":[{"id":"wikipedia.article.control-theory","title":"English Wikipedia article: Control theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+theory"}],"status":"reported","summary":"English Wikipedia (article \"Control theory\", CC BY-SA 4.0) states: Control theory is a field of control engineering and applied mathematics that deals with the control of dynamical systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.manufacturing","kind":"concept","label":"Manufacturing","sources":[{"id":"wikipedia.article.manufacturing","title":"English Wikipedia article: Manufacturing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Manufacturing"}],"status":"reported","summary":"English Wikipedia (article \"Manufacturing\", CC BY-SA 4.0) states: Manufacturing is the creation or production of goods with the help of equipment, labor, machines, tools, and chemical or biological processing or formulation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-device","kind":"concept","label":"Analog device","sources":[{"id":"wikipedia.article.analog-device","title":"English Wikipedia article: Analog device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+device"}],"status":"reported","summary":"English Wikipedia (article \"Analog device\", CC BY-SA 4.0) states: Analog devices are a combination of both analog machine and analog media that can together measure, record, reproduce, receive or broadcast continuous information, for example, the almost infinite number of grades of transparency, voltage, resistance, rotation, or pressure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.systems-engineering","kind":"field","label":"Systems engineering","sources":[{"id":"wikipedia.article.systems-engineering","title":"English Wikipedia article: Systems engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Systems+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Systems engineering\", CC BY-SA 4.0) states: Systems engineering is an interdisciplinary field of engineering and engineering management that focuses on how to design, integrate, and manage complex systems over their life cycles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.geotechnical-engineering","kind":"field","label":"Geotechnical engineering","sources":[{"id":"wikipedia.article.geotechnical-engineering","title":"English Wikipedia article: Geotechnical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geotechnical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Geotechnical engineering\", CC BY-SA 4.0) states: Geotechnical engineering, also known as geotechnics, is the branch of civil engineering concerned with the engineering behavior of earth materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anti-twister-mechanism","kind":"concept","label":"Anti-twister mechanism","sources":[{"id":"wikipedia.article.anti-twister-mechanism","title":"English Wikipedia article: Anti-twister mechanism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anti-twister+mechanism"}],"status":"reported","summary":"English Wikipedia (article \"Anti-twister mechanism\", CC BY-SA 4.0) states: The anti-twister or antitwister mechanism is a method of connecting a flexible link between two objects, one of which is rotating with respect to the other, in a way that prevents the link from becoming twisted.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.machine","kind":"concept","label":"Machine","sources":[{"id":"wikipedia.article.machine","title":"English Wikipedia article: Machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Machine"}],"status":"reported","summary":"English Wikipedia (article \"Machine\", CC BY-SA 4.0) states: A machine is a thermodynamic system that uses power to apply forces and control movement to perform an action.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.engine","kind":"concept","label":"Engine","sources":[{"id":"wikipedia.article.engine","title":"English Wikipedia article: Engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engine"}],"status":"reported","summary":"English Wikipedia (article \"Engine\", CC BY-SA 4.0) states: An engine or motor is a machine designed to convert one or more forms of energy into mechanical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-component","kind":"concept","label":"Electronic component","sources":[{"id":"wikipedia.article.electronic-component","title":"English Wikipedia article: Electronic component","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+component"}],"status":"reported","summary":"English Wikipedia (article \"Electronic component\", CC BY-SA 4.0) states: An electronic component is any basic discrete electronic device or physical entity part of an electronic system used to affect electrons or their associated fields.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-power-filter","kind":"concept","label":"Active power filter","sources":[{"id":"wikipedia.article.active-power-filter","title":"English Wikipedia article: Active power filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+power+filter"}],"status":"reported","summary":"English Wikipedia (article \"Active power filter\", CC BY-SA 4.0) states: Active power filters (APF) are filters, which can perform the job of harmonic elimination.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.telecommunications-engineering","kind":"field","label":"Telecommunications engineering","sources":[{"id":"wikipedia.article.telecommunications-engineering","title":"English Wikipedia article: Telecommunications engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Telecommunications+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Telecommunications engineering\", CC BY-SA 4.0) states: Telecommunications engineering is a subfield of electrical engineering that seeks to design and devise systems of communication at a distance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.semiconductor-device","kind":"concept","label":"Semiconductor device","sources":[{"id":"wikipedia.article.semiconductor-device","title":"English Wikipedia article: Semiconductor device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Semiconductor+device"}],"status":"reported","summary":"English Wikipedia (article \"Semiconductor device\", CC BY-SA 4.0) states: A semiconductor device is an electronic component that relies on the electronic properties of a semiconductor material (primarily silicon, germanium, and gallium arsenide, as well as organic semiconductors) for its function.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-motor","kind":"concept","label":"Electric motor","sources":[{"id":"wikipedia.article.electric-motor","title":"English Wikipedia article: Electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Electric motor\", CC BY-SA 4.0) states: An electric motor is a machine that converts electrical energy into mechanical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.pump","kind":"concept","label":"Pump","sources":[{"id":"wikipedia.article.pump","title":"English Wikipedia article: Pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pump"}],"status":"reported","summary":"English Wikipedia (article \"Pump\", CC BY-SA 4.0) states: A pump is a device that moves fluids (liquids or gases), or sometimes slurries, by mechanical action, typically converted from electrical energy into hydraulic or pneumatic energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.valve","kind":"concept","label":"Valve","sources":[{"id":"wikipedia.article.valve","title":"English Wikipedia article: Valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Valve"}],"status":"reported","summary":"English Wikipedia (article \"Valve\", CC BY-SA 4.0) states: A valve is a device or natural object that regulates, directs or controls the flow of a fluid (gases, liquids, fluidized solids, or slurries) by opening, closing, or partially obstructing various passageways.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abenics","kind":"concept","label":"ABENICS","sources":[{"id":"wikipedia.article.abenics","title":"English Wikipedia article: ABENICS","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ABENICS"}],"status":"reported","summary":"English Wikipedia (article \"ABENICS\", CC BY-SA 4.0) states: ABENICS (Active Ball Joint Mechanism With Three-DoF Based on Spherical Gear Meshings) is a ball joint system which uses a cross-spherical gear in conjunction with a monopole gear in order to be able to manipulate the spherical gear in three dimensions of freedom (pitch, roll, and yaw).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fastener","kind":"concept","label":"Fastener","sources":[{"id":"wikipedia.article.fastener","title":"English Wikipedia article: Fastener","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fastener"}],"status":"reported","summary":"English Wikipedia (article \"Fastener\", CC BY-SA 4.0) states: A fastener (US English) or fastening (UK English) is a hardware device that mechanically joins or affixes two or more objects together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.construction","kind":"concept","label":"Construction","sources":[{"id":"wikipedia.article.construction","title":"English Wikipedia article: Construction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Construction"}],"status":"reported","summary":"English Wikipedia (article \"Construction\", CC BY-SA 4.0) states: Construction is the process involved in delivering buildings, infrastructure, industrial facilities, and associated activities through to the end of their life.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.belt-mechanical","kind":"concept","label":"Belt (mechanical)","sources":[{"id":"wikipedia.article.belt-mechanical","title":"English Wikipedia article: Belt (mechanical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Belt+%28mechanical%29"}],"status":"reported","summary":"English Wikipedia (article \"Belt (mechanical)\", CC BY-SA 4.0) states: A belt is a loop of flexible material used to link two or more rotating shafts mechanically, most often parallel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.building-engineer","kind":"concept","label":"Building engineer","sources":[{"id":"wikipedia.article.building-engineer","title":"English Wikipedia article: Building engineer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Building+engineer"}],"status":"reported","summary":"English Wikipedia (article \"Building engineer\", CC BY-SA 4.0) states: A building engineer is recognised as being expert in the use of technology for the design, construction, assessment and maintenance of the built environment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.signal-processing","kind":"concept","label":"Signal processing","sources":[{"id":"wikipedia.article.signal-processing","title":"English Wikipedia article: Signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Signal processing\", CC BY-SA 4.0) states: Signal processing is an electrical engineering subfield that focuses on analyzing, modifying and synthesizing signals, such as sound, images, potential fields, seismic signals, altimetry processing, and scientific measurements.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abnormal-grain-growth","kind":"concept","label":"Abnormal grain growth","sources":[{"id":"wikipedia.article.abnormal-grain-growth","title":"English Wikipedia article: Abnormal grain growth","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abnormal+grain+growth"}],"status":"reported","summary":"English Wikipedia (article \"Abnormal grain growth\", CC BY-SA 4.0) states: In materials science, abnormal or discontinuous grain growth, also referred to as exaggerated or secondary recrystallisation grain growth, is a grain growth phenomenon in which certain energetically favorable grains (crystallites) grow rapidly in a matrix of finer grains, resulting in a bimodal distribution of grain size.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.nuclear-technology","kind":"concept","label":"Nuclear technology","sources":[{"id":"wikipedia.article.nuclear-technology","title":"English Wikipedia article: Nuclear technology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Nuclear+technology"}],"status":"reported","summary":"English Wikipedia (article \"Nuclear technology\", CC BY-SA 4.0) states: Nuclear technology is technology that involves the nuclear reactions of atomic nuclei.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-circuit","kind":"concept","label":"Electronic circuit","sources":[{"id":"wikipedia.article.electronic-circuit","title":"English Wikipedia article: Electronic circuit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+circuit"}],"status":"reported","summary":"English Wikipedia (article \"Electronic circuit\", CC BY-SA 4.0) states: An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.structural-system","kind":"concept","label":"Structural system","sources":[{"id":"wikipedia.article.structural-system","title":"English Wikipedia article: Structural system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Structural+system"}],"status":"reported","summary":"English Wikipedia (article \"Structural system\", CC BY-SA 4.0) states: The term structural system or structural frame in structural engineering refers to the load-resisting sub-system of a building or object.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heat-exchanger","kind":"concept","label":"Heat exchanger","sources":[{"id":"wikipedia.article.heat-exchanger","title":"English Wikipedia article: Heat exchanger","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heat+exchanger"}],"status":"reported","summary":"English Wikipedia (article \"Heat exchanger\", CC BY-SA 4.0) states: A heat exchanger is a system used to transfer heat between a source and a working fluid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.actuator","kind":"concept","label":"Actuator","sources":[{"id":"wikipedia.article.actuator","title":"English Wikipedia article: Actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Actuator"}],"status":"reported","summary":"English Wikipedia (article \"Actuator\", CC BY-SA 4.0) states: An actuator is a component of a machine that produces force, torque, or displacement, when an electrical, pneumatic or hydraulic input is supplied to it in a system (called an actuating system).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.sensor","kind":"concept","label":"Sensor","sources":[{"id":"wikipedia.article.sensor","title":"English Wikipedia article: Sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Sensor"}],"status":"reported","summary":"English Wikipedia (article \"Sensor\", CC BY-SA 4.0) states: A sensor is often defined as a device that receives and responds to a signal or stimulus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.agitator-device","kind":"concept","label":"Agitator (device)","sources":[{"id":"wikipedia.article.agitator-device","title":"English Wikipedia article: Agitator (device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agitator+%28device%29"}],"status":"reported","summary":"English Wikipedia (article \"Agitator (device)\", CC BY-SA 4.0) states: An agitator is a device or mechanism to put something into motion by shaking or stirring.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ac-dc-receiver-design","kind":"concept","label":"AC/DC receiver design","sources":[{"id":"wikipedia.article.ac-dc-receiver-design","title":"English Wikipedia article: AC/DC receiver design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=AC%2FDC+receiver+design"}],"status":"reported","summary":"English Wikipedia (article \"AC/DC receiver design\", CC BY-SA 4.0) states: An AC/DC receiver design is a style of power supply of vacuum tube radio or television receivers that eliminated the bulky and expensive AC-only mains transformer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.activated-sludge","kind":"concept","label":"Activated sludge","sources":[{"id":"wikipedia.article.activated-sludge","title":"English Wikipedia article: Activated sludge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Activated+sludge"}],"status":"reported","summary":"English Wikipedia (article \"Activated sludge\", CC BY-SA 4.0) states: The activated sludge process is a type of biological wastewater treatment process for treating sewage or industrial wastewaters using aeration and a biological floc composed of bacteria and protozoa.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.distributed-parameter-system","kind":"concept","label":"Distributed parameter system","sources":[{"id":"wikipedia.article.distributed-parameter-system","title":"English Wikipedia article: Distributed parameter system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distributed+parameter+system"}],"status":"reported","summary":"English Wikipedia (article \"Distributed parameter system\", CC BY-SA 4.0) states: In control theory, a distributed-parameter system (as opposed to a lumped-parameter system) is a system whose state space is infinite-dimensional.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alarm-management","kind":"concept","label":"Alarm management","sources":[{"id":"wikipedia.article.alarm-management","title":"English Wikipedia article: Alarm management","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alarm+management"}],"status":"reported","summary":"English Wikipedia (article \"Alarm management\", CC BY-SA 4.0) states: Alarm management is the application of human factors and ergonomics along with instrumentation engineering and systems thinking to manage the design of an alarm system to increase its usability.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analogue-electronics","kind":"concept","label":"Analogue electronics","sources":[{"id":"wikipedia.article.analogue-electronics","title":"English Wikipedia article: Analogue electronics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analogue+electronics"}],"status":"reported","summary":"English Wikipedia (article \"Analogue electronics\", CC BY-SA 4.0) states: Analogue electronics (American English: analog electronics) are electronic systems with a continuously variable signal, in contrast to digital electronics where signals usually take only two levels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-differential","kind":"concept","label":"Ball differential","sources":[{"id":"wikipedia.article.ball-differential","title":"English Wikipedia article: Ball differential","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+differential"}],"status":"reported","summary":"English Wikipedia (article \"Ball differential\", CC BY-SA 4.0) states: A ball differential is a type of differential typically used on radio-controlled cars.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-bearing","kind":"concept","label":"Air bearing","sources":[{"id":"wikipedia.article.air-bearing","title":"English Wikipedia article: Air bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Air bearing\", CC BY-SA 4.0) states: Air bearings (also known as aerostatic or aerodynamic bearings) are bearings that use a thin film of pressurized gas to provide a low friction load-bearing interface between surfaces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aluminium-conductor-steel-reinforced-cable","kind":"concept","label":"Aluminium-conductor steel-reinforced cable","sources":[{"id":"wikipedia.article.aluminium-conductor-steel-reinforced-cable","title":"English Wikipedia article: Aluminium-conductor steel-reinforced cable","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aluminium-conductor+steel-reinforced+cable"}],"status":"reported","summary":"English Wikipedia (article \"Aluminium-conductor steel-reinforced cable\", CC BY-SA 4.0) states: Aluminum conductor steel-reinforced cable (ACSR) is a type of high-capacity, high-strength stranded conductor typically used in overhead power lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welder","kind":"concept","label":"Welder","sources":[{"id":"wikipedia.article.welder","title":"English Wikipedia article: Welder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welder"}],"status":"reported","summary":"English Wikipedia (article \"Welder\", CC BY-SA 4.0) states: A welder is a person or equipment that fuses materials together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.machining","kind":"concept","label":"Machining","sources":[{"id":"wikipedia.article.machining","title":"English Wikipedia article: Machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Machining"}],"status":"reported","summary":"English Wikipedia (article \"Machining\", CC BY-SA 4.0) states: Machining is a manufacturing process where a desired shape or part is created using the controlled removal of material, most often metal, from a larger piece of raw material by cutting.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasion-mechanical","kind":"concept","label":"Abrasion (mechanical)","sources":[{"id":"wikipedia.article.abrasion-mechanical","title":"English Wikipedia article: Abrasion (mechanical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasion+%28mechanical%29"}],"status":"reported","summary":"English Wikipedia (article \"Abrasion (mechanical)\", CC BY-SA 4.0) states: Abrasion is the process of scuffing, scratching, wearing down, marring, or rubbing away.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armature-electrical","kind":"concept","label":"Armature (electrical)","sources":[{"id":"wikipedia.article.armature-electrical","title":"English Wikipedia article: Armature (electrical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armature+%28electrical%29"}],"status":"reported","summary":"English Wikipedia (article \"Armature (electrical)\", CC BY-SA 4.0) states: In electrical engineering, an armature is the winding (or set of windings) of an electric machine which carries alternating current.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gender-of-connectors-and-fasteners","kind":"concept","label":"Gender of connectors and fasteners","sources":[{"id":"wikipedia.article.gender-of-connectors-and-fasteners","title":"English Wikipedia article: Gender of connectors and fasteners","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gender+of+connectors+and+fasteners"}],"status":"reported","summary":"English Wikipedia (article \"Gender of connectors and fasteners\", CC BY-SA 4.0) states: In electrical and mechanical trades and manufacturing, each half of a pair of mating connectors or fasteners is conventionally designated as male or female, a distinction referred to as its gender.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chain-conveyor","kind":"concept","label":"Chain conveyor","sources":[{"id":"wikipedia.article.chain-conveyor","title":"English Wikipedia article: Chain conveyor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+conveyor"}],"status":"reported","summary":"English Wikipedia (article \"Chain conveyor\", CC BY-SA 4.0) states: A chain conveyor is a type of conveyor system for moving material through production lines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-beamformer","kind":"concept","label":"Adaptive beamformer","sources":[{"id":"wikipedia.article.adaptive-beamformer","title":"English Wikipedia article: Adaptive beamformer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+beamformer"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive beamformer\", CC BY-SA 4.0) states: An adaptive beamformer is a system that performs adaptive spatial signal processing with an array of transmitters or receivers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-emission","kind":"concept","label":"Acoustic emission","sources":[{"id":"wikipedia.article.acoustic-emission","title":"English Wikipedia article: Acoustic emission","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+emission"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic emission\", CC BY-SA 4.0) states: Acoustic emission (AE) is the phenomenon of radiation of acoustic (elastic) waves in solids that occurs when a material undergoes irreversible changes in its internal structure, for example as a result of crack formation or plastic deformation due to aging, temperature gradients, or external mechanical forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-redundancy","kind":"concept","label":"Active redundancy","sources":[{"id":"wikipedia.article.active-redundancy","title":"English Wikipedia article: Active redundancy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+redundancy"}],"status":"reported","summary":"English Wikipedia (article \"Active redundancy\", CC BY-SA 4.0) states: Active redundancy is a design concept that increases operational availability and that reduces operating cost by automating most critical maintenance actions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.acoustical-engineering","kind":"field","label":"Acoustical engineering","sources":[{"id":"wikipedia.article.acoustical-engineering","title":"English Wikipedia article: Acoustical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Acoustical engineering\", CC BY-SA 4.0) states: Acoustical engineering (also known as acoustic engineering) is the branch of engineering dealing with sound and vibration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adsorption-bio-oxidation-process","kind":"concept","label":"Adsorption/bio-oxidation process","sources":[{"id":"wikipedia.article.adsorption-bio-oxidation-process","title":"English Wikipedia article: Adsorption/bio-oxidation process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adsorption%2Fbio-oxidation+process"}],"status":"reported","summary":"English Wikipedia (article \"Adsorption/bio-oxidation process\", CC BY-SA 4.0) states: The adsorption/bio-oxidation process (AB process) is a variation of the activated sludge process used in wastewater treatment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bell-nipple","kind":"concept","label":"Bell nipple","sources":[{"id":"wikipedia.article.bell-nipple","title":"English Wikipedia article: Bell nipple","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bell+nipple"}],"status":"reported","summary":"English Wikipedia (article \"Bell nipple\", CC BY-SA 4.0) states: A bell nipple is a section of pipe with a flared top, fitted to the top of the blowout preventers that the flow line attaches to via a side outlet, to allow the drilling fluid to flow back over the shale shakers to the mud tanks.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive","kind":"concept","label":"Abrasive","sources":[{"id":"wikipedia.article.abrasive","title":"English Wikipedia article: Abrasive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive\", CC BY-SA 4.0) states: An abrasive is a material, often a mineral, that is used to shape or finish a workpiece through rubbing which leads to part of the workpiece being worn away by friction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.a-frame","kind":"concept","label":"A-frame","sources":[{"id":"wikipedia.article.a-frame","title":"English Wikipedia article: A-frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A-frame"}],"status":"reported","summary":"English Wikipedia (article \"A-frame\", CC BY-SA 4.0) states: An A-frame is a basic structure designed to bear a load in a lightweight economical manner.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-joint","kind":"concept","label":"Ball joint","sources":[{"id":"wikipedia.article.ball-joint","title":"English Wikipedia article: Ball joint","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+joint"}],"status":"reported","summary":"English Wikipedia (article \"Ball joint\", CC BY-SA 4.0) states: In an automobile, ball joints are spherical bearings that connect the control arms to the steering knuckles, and are used on virtually every automobile made.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-turbine","kind":"concept","label":"Axial turbine","sources":[{"id":"wikipedia.article.axial-turbine","title":"English Wikipedia article: Axial turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Axial turbine\", CC BY-SA 4.0) states: In turbomachinery, an axial turbine is a turbine in which the flow of the working fluid is parallel to the shaft, as opposed to radial turbines, where the fluid runs around a shaft, as in a watermill.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-handler","kind":"concept","label":"Air handler","sources":[{"id":"wikipedia.article.air-handler","title":"English Wikipedia article: Air handler","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+handler"}],"status":"reported","summary":"English Wikipedia (article \"Air handler\", CC BY-SA 4.0) states: An air handler, or air handling unit (often abbreviated to AHU), is a device used to regulate and circulate air as part of a heating, ventilating, and air-conditioning (HVAC) system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrams-law","kind":"concept","label":"Abrams' law","sources":[{"id":"wikipedia.article.abrams-law","title":"English Wikipedia article: Abrams' law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrams%27+law"}],"status":"reported","summary":"English Wikipedia (article \"Abrams' law\", CC BY-SA 4.0) states: Abrams' law (also called Abrams' water-cement ratio law) is a concept in civil engineering that was developed by Duff Abrams.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-permeability-specific-surface","kind":"concept","label":"Air permeability specific surface","sources":[{"id":"wikipedia.article.air-permeability-specific-surface","title":"English Wikipedia article: Air permeability specific surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+permeability+specific+surface"}],"status":"reported","summary":"English Wikipedia (article \"Air permeability specific surface\", CC BY-SA 4.0) states: The air permeability specific surface of a powder material is a single-parameter measurement of the fineness of the powder.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.applied-mechanics","kind":"field","label":"Applied mechanics","sources":[{"id":"wikipedia.article.applied-mechanics","title":"English Wikipedia article: Applied mechanics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+mechanics"}],"status":"reported","summary":"English Wikipedia (article \"Applied mechanics\", CC BY-SA 4.0) states: Applied mechanics is the branch of science concerned with the motion of any substance that can be experienced or perceived by humans without the help of instruments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arc-fault","kind":"concept","label":"Arc fault","sources":[{"id":"wikipedia.article.arc-fault","title":"English Wikipedia article: Arc fault","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arc+fault"}],"status":"reported","summary":"English Wikipedia (article \"Arc fault\", CC BY-SA 4.0) states: An arc fault is a high power discharge of electricity between two or more conductors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.engineering-geology","kind":"concept","label":"Engineering geology","sources":[{"id":"wikipedia.article.engineering-geology","title":"English Wikipedia article: Engineering geology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Engineering+geology"}],"status":"reported","summary":"English Wikipedia (article \"Engineering geology\", CC BY-SA 4.0) states: Engineering geology is the application of geology to engineering study for the purpose of assuring that the geological factors regarding the location, design, construction, operation and maintenance of engineering works are recognized and accounted for.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ballast","kind":"concept","label":"Ballast","sources":[{"id":"wikipedia.article.ballast","title":"English Wikipedia article: Ballast","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ballast"}],"status":"reported","summary":"English Wikipedia (article \"Ballast\", CC BY-SA 4.0) states: Ballast is dense material used as a weight to provide stability to a vehicle or structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anaesthetic-machine","kind":"concept","label":"Anaesthetic machine","sources":[{"id":"wikipedia.article.anaesthetic-machine","title":"English Wikipedia article: Anaesthetic machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anaesthetic+machine"}],"status":"reported","summary":"English Wikipedia (article \"Anaesthetic machine\", CC BY-SA 4.0) states: An anaesthetic machine (British English) or anesthesia machine (American English) is a medical device used to generate and mix a fresh gas flow of medical gases and inhalational anaesthetic agents for the purpose of inducing and maintaining anaesthesia.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-circulator","kind":"concept","label":"Active circulator","sources":[{"id":"wikipedia.article.active-circulator","title":"English Wikipedia article: Active circulator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+circulator"}],"status":"reported","summary":"English Wikipedia (article \"Active circulator\", CC BY-SA 4.0) states: In electrical engineering, an active circulator is an active non-reciprocal three-port device that couples a microwave or radio-frequency signal only to an adjacent port in the direction of circulation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-delay-line","kind":"concept","label":"Analog delay line","sources":[{"id":"wikipedia.article.analog-delay-line","title":"English Wikipedia article: Analog delay line","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+delay+line"}],"status":"reported","summary":"English Wikipedia (article \"Analog delay line\", CC BY-SA 4.0) states: An analog delay line is a network of electrical components connected in cascade, where each individual element creates a time difference between its input and output.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welding","kind":"concept","label":"Welding","sources":[{"id":"wikipedia.article.welding","title":"English Wikipedia article: Welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welding"}],"status":"reported","summary":"English Wikipedia (article \"Welding\", CC BY-SA 4.0) states: Welding is a fabrication process that joins materials, usually metals or thermoplastics, primarily by using high temperatures to melt the parts together and allow them to cool, causing fusion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bifacial-solar-cells","kind":"concept","label":"Bifacial solar cells","sources":[{"id":"wikipedia.article.bifacial-solar-cells","title":"English Wikipedia article: Bifacial solar cells","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bifacial+solar+cells"}],"status":"reported","summary":"English Wikipedia (article \"Bifacial solar cells\", CC BY-SA 4.0) states: A bifacial solar cell (BSC) is a photovoltaic solar cell that can produce electrical energy from both front and rear side.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armature-controlled-dc-motor","kind":"concept","label":"Armature-controlled DC motor","sources":[{"id":"wikipedia.article.armature-controlled-dc-motor","title":"English Wikipedia article: Armature-controlled DC motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armature-controlled+DC+motor"}],"status":"reported","summary":"English Wikipedia (article \"Armature-controlled DC motor\", CC BY-SA 4.0) states: An armature controlled DC motor is a direct current (DC) motor that uses a permanent magnet driven by the armature coils only.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acid-egg","kind":"concept","label":"Acid egg","sources":[{"id":"wikipedia.article.acid-egg","title":"English Wikipedia article: Acid egg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acid+egg"}],"status":"reported","summary":"English Wikipedia (article \"Acid egg\", CC BY-SA 4.0) states: The terms acid egg and montejus (or monte-jus) are sometimes used interchangeably to refer to a device with no moving parts formerly used instead of a pump in order to transfer difficult liquids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.valve-actuator","kind":"concept","label":"Valve actuator","sources":[{"id":"wikipedia.article.valve-actuator","title":"English Wikipedia article: Valve actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Valve+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Valve actuator\", CC BY-SA 4.0) states: A valve actuator is the mechanism for opening and closing a valve.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bevel-gear","kind":"concept","label":"Bevel gear","sources":[{"id":"wikipedia.article.bevel-gear","title":"English Wikipedia article: Bevel gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bevel+gear"}],"status":"reported","summary":"English Wikipedia (article \"Bevel gear\", CC BY-SA 4.0) states: Bevel gears are gears in which the axes of the two shafts intersect and the tooth-bearing faces of the gears themselves are conically shaped.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chain-drive","kind":"concept","label":"Chain drive","sources":[{"id":"wikipedia.article.chain-drive","title":"English Wikipedia article: Chain drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+drive"}],"status":"reported","summary":"English Wikipedia (article \"Chain drive\", CC BY-SA 4.0) states: A chain drive is a way of transmitting mechanical power from one place to another.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.agricultural-engineering","kind":"field","label":"Agricultural engineering","sources":[{"id":"wikipedia.article.agricultural-engineering","title":"English Wikipedia article: Agricultural engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Agricultural+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Agricultural engineering\", CC BY-SA 4.0) states: Agricultural engineering, also known as agricultural and biosystems engineering, is the field of study and application of engineering science and designs principles for agriculture purposes, combining the various disciplines of mechanical, civil, electrical, food science, environmental, software, and chemical engineering to improve the efficiency of farms and agribusiness enterprises as well as to ensure sustainability of natural and renewable resources.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-oxidation-process","kind":"concept","label":"Advanced oxidation process","sources":[{"id":"wikipedia.article.advanced-oxidation-process","title":"English Wikipedia article: Advanced oxidation process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+oxidation+process"}],"status":"reported","summary":"English Wikipedia (article \"Advanced oxidation process\", CC BY-SA 4.0) states: Advanced oxidation processes (AOPs), in a broad sense, are a set of chemical treatment procedures designed to remove organic (and sometimes inorganic) materials in water and wastewater by oxidation through reactions with hydroxyl radicals (·OH).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive-flow-machining","kind":"concept","label":"Abrasive flow machining","sources":[{"id":"wikipedia.article.abrasive-flow-machining","title":"English Wikipedia article: Abrasive flow machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive+flow+machining"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive flow machining\", CC BY-SA 4.0) states: Abrasive flow machining (AFM), also known as abrasive flow deburring or extrude honing, is an interior surface finishing process characterized by flowing an abrasive-laden fluid through a workpiece.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.amplifier","kind":"concept","label":"Amplifier","sources":[{"id":"wikipedia.article.amplifier","title":"English Wikipedia article: Amplifier","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amplifier"}],"status":"reported","summary":"English Wikipedia (article \"Amplifier\", CC BY-SA 4.0) states: An amplifier, electronic amplifier or (informally) amp is an electronic device that can increase the magnitude of a signal (a time-varying voltage or current).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airframe","kind":"concept","label":"Airframe","sources":[{"id":"wikipedia.article.airframe","title":"English Wikipedia article: Airframe","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airframe"}],"status":"reported","summary":"English Wikipedia (article \"Airframe\", CC BY-SA 4.0) states: The mechanical structure of an aircraft is known as the airframe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-cooled-heat-exchanger","kind":"concept","label":"Air cooled heat exchanger","sources":[{"id":"wikipedia.article.air-cooled-heat-exchanger","title":"English Wikipedia article: Air cooled heat exchanger","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+cooled+heat+exchanger"}],"status":"reported","summary":"English Wikipedia (article \"Air cooled heat exchanger\", CC BY-SA 4.0) states: An air-cooled heat exchanger (ACHE), also known as an air cooler, fin-fan cooler, or air fin cooler, is a type of heat exchanger that rejects heat from a process fluid directly to ambient air, without the use of an intermediate cooling-water circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.deriaz-turbine","kind":"concept","label":"Deriaz turbine","sources":[{"id":"wikipedia.article.deriaz-turbine","title":"English Wikipedia article: Deriaz turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deriaz+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Deriaz turbine\", CC BY-SA 4.0) states: The Deriaz turbine, presented by engineer Paul Deriaz, was the first diagonal hydraulic pump-turbine to be designed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.addressed-fiber-bragg-structure","kind":"concept","label":"Addressed fiber Bragg structure","sources":[{"id":"wikipedia.article.addressed-fiber-bragg-structure","title":"English Wikipedia article: Addressed fiber Bragg structure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Addressed+fiber+Bragg+structure"}],"status":"reported","summary":"English Wikipedia (article \"Addressed fiber Bragg structure\", CC BY-SA 4.0) states: An addressed fiber Bragg structure (AFBS) is a fiber Bragg grating, the optical frequency response of which includes two narrowband components with the frequency spacing between them (which is the address frequency of the AFBS) being in the radio frequency (RF) range.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-preheater","kind":"concept","label":"Air preheater","sources":[{"id":"wikipedia.article.air-preheater","title":"English Wikipedia article: Air preheater","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+preheater"}],"status":"reported","summary":"English Wikipedia (article \"Air preheater\", CC BY-SA 4.0) states: An air preheater is any device designed to heat air before another process (for example, combustion in a boiler), with the primary objective of increasing the thermal efficiency of the process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abutment","kind":"concept","label":"Abutment","sources":[{"id":"wikipedia.article.abutment","title":"English Wikipedia article: Abutment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abutment"}],"status":"reported","summary":"English Wikipedia (article \"Abutment\", CC BY-SA 4.0) states: An abutment is the substructure at the ends of a bridge span or dam supporting its superstructure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alternating-current","kind":"concept","label":"Alternating current","sources":[{"id":"wikipedia.article.alternating-current","title":"English Wikipedia article: Alternating current","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alternating+current"}],"status":"reported","summary":"English Wikipedia (article \"Alternating current\", CC BY-SA 4.0) states: Alternating current (AC) is an electric current that periodically reverses direction and changes its magnitude continuously with time, in contrast to direct current (DC), which flows only in one direction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bating-leather","kind":"concept","label":"Bating (leather)","sources":[{"id":"wikipedia.article.bating-leather","title":"English Wikipedia article: Bating (leather)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bating+%28leather%29"}],"status":"reported","summary":"English Wikipedia (article \"Bating (leather)\", CC BY-SA 4.0) states: Bating is a technical term used in the tanning industry to denote leather that has been treated with hen or pigeon manure, similar to puering (see puer) where the leather has been treated with dog excrement, and which treatment, in both cases, was performed on the raw hide prior to tanning in order to render the skins, and the subsequent leather, soft and supple.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-hierarchy-process","kind":"concept","label":"Analytic hierarchy process","sources":[{"id":"wikipedia.article.analytic-hierarchy-process","title":"English Wikipedia article: Analytic hierarchy process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+hierarchy+process"}],"status":"reported","summary":"English Wikipedia (article \"Analytic hierarchy process\", CC BY-SA 4.0) states: In the theory of decision making, the analytic hierarchy process (AHP), also analytical hierarchy process, is a structured technique for organizing and analyzing complex decisions, based on mathematics and psychology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aquifer","kind":"concept","label":"Aquifer","sources":[{"id":"wikipedia.article.aquifer","title":"English Wikipedia article: Aquifer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aquifer"}],"status":"reported","summary":"English Wikipedia (article \"Aquifer\", CC BY-SA 4.0) states: An aquifer is an underground layer of water-bearing material consisting of permeable or fractured rock, or of unconsolidated materials (gravel, sand, or silt).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flowability","kind":"concept","label":"Flowability","sources":[{"id":"wikipedia.article.flowability","title":"English Wikipedia article: Flowability","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flowability"}],"status":"reported","summary":"English Wikipedia (article \"Flowability\", CC BY-SA 4.0) states: Flowability, also known as powder flow, is a property that defines an ability of a powdered material to flow, related to cohesion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cable-robots","kind":"concept","label":"Cable robots","sources":[{"id":"wikipedia.article.cable-robots","title":"English Wikipedia article: Cable robots","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cable+robots"}],"status":"reported","summary":"English Wikipedia (article \"Cable robots\", CC BY-SA 4.0) states: Cable-driven parallel robots (also called cable robots, cable-suspended robots or wire-driven robots) are a type of parallel manipulators in which flexible cables are used as actuators.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autopen","kind":"concept","label":"Autopen","sources":[{"id":"wikipedia.article.autopen","title":"English Wikipedia article: Autopen","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autopen"}],"status":"reported","summary":"English Wikipedia (article \"Autopen\", CC BY-SA 4.0) states: An automatic pen, or autopen (informally known as a signing machine), is a mechanical device used for the replicated signing of a human signature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-fuel-ratio","kind":"concept","label":"Air–fuel ratio","sources":[{"id":"wikipedia.article.air-fuel-ratio","title":"English Wikipedia article: Air–fuel ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air%E2%80%93fuel+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Air–fuel ratio\", CC BY-SA 4.0) states: Air–fuel ratio (AFR) is the mass ratio of air to a solid, liquid, or gaseous fuel present in a combustion process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.abrasive-machining","kind":"concept","label":"Abrasive machining","sources":[{"id":"wikipedia.article.abrasive-machining","title":"English Wikipedia article: Abrasive machining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abrasive+machining"}],"status":"reported","summary":"English Wikipedia (article \"Abrasive machining\", CC BY-SA 4.0) states: Abrasive machining is a machining process where material is removed from a workpiece using a multitude of small abrasive particles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.archard-equation","kind":"concept","label":"Archard equation","sources":[{"id":"wikipedia.article.archard-equation","title":"English Wikipedia article: Archard equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archard+equation"}],"status":"reported","summary":"English Wikipedia (article \"Archard equation\", CC BY-SA 4.0) states: The Archard wear equation is a simple model used to describe sliding wear and is based on the theory of asperity contact.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chiplet","kind":"concept","label":"Chiplet","sources":[{"id":"wikipedia.article.chiplet","title":"English Wikipedia article: Chiplet","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chiplet"}],"status":"reported","summary":"English Wikipedia (article \"Chiplet\", CC BY-SA 4.0) states: A chiplet is a tiny integrated circuit (IC) that contains a well-defined subset of functionality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-flux-motor","kind":"concept","label":"Axial flux motor","sources":[{"id":"wikipedia.article.axial-flux-motor","title":"English Wikipedia article: Axial flux motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+flux+motor"}],"status":"reported","summary":"English Wikipedia (article \"Axial flux motor\", CC BY-SA 4.0) states: An axial flux motor (axial gap motor, or pancake motor) is a geometry of electric motor construction where the gap between the rotor and stator, and therefore the direction of magnetic flux between the two, is aligned parallel with the axis of rotation, rather than radially as with the concentric cylindrical geometry of the more common radial flux motor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.affinity-laws","kind":"concept","label":"Affinity laws","sources":[{"id":"wikipedia.article.affinity-laws","title":"English Wikipedia article: Affinity laws","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affinity+laws"}],"status":"reported","summary":"English Wikipedia (article \"Affinity laws\", CC BY-SA 4.0) states: The affinity laws (also known as the \"Fan Laws\" or \"Pump Laws\") for pumps/fans are used in hydraulics, hydronics and/or HVAC to express the relationship between variables involved in pump or fan performance (such as head, volumetric flow rate, shaft speed) and power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adjustable-pressure-limiting-valve","kind":"concept","label":"Adjustable pressure-limiting valve","sources":[{"id":"wikipedia.article.adjustable-pressure-limiting-valve","title":"English Wikipedia article: Adjustable pressure-limiting valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjustable+pressure-limiting+valve"}],"status":"reported","summary":"English Wikipedia (article \"Adjustable pressure-limiting valve\", CC BY-SA 4.0) states: An adjustable pressure-limiting valve (commonly abbreviated to APL valve, and also referred to as an expiratory valve, relief valve or spill valve) is a type of flow control valve used in anaesthesiology as part of a breathing system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anchor-channel","kind":"concept","label":"Anchor channel","sources":[{"id":"wikipedia.article.anchor-channel","title":"English Wikipedia article: Anchor channel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anchor+channel"}],"status":"reported","summary":"English Wikipedia (article \"Anchor channel\", CC BY-SA 4.0) states: Anchor channels, invented by Anders Jordahl in 1913, are steel channels cast flush in reinforced concrete elements to allow the installation of channel bolts for the fastening of components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chebychev-gr-bler-kutzbach-criterion","kind":"concept","label":"Chebychev–Grübler–Kutzbach criterion","sources":[{"id":"wikipedia.article.chebychev-gr-bler-kutzbach-criterion","title":"English Wikipedia article: Chebychev–Grübler–Kutzbach criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chebychev%E2%80%93Gr%C3%BCbler%E2%80%93Kutzbach+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Chebychev–Grübler–Kutzbach criterion\", CC BY-SA 4.0) states: The Chebychev–Grübler–Kutzbach criterion determines the number of degrees of freedom of a kinematic chain, that is, a coupling of rigid bodies by means of mechanical constraints.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-thermography","kind":"concept","label":"Active thermography","sources":[{"id":"wikipedia.article.active-thermography","title":"English Wikipedia article: Active thermography","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+thermography"}],"status":"reported","summary":"English Wikipedia (article \"Active thermography\", CC BY-SA 4.0) states: Active thermography is an advanced nondestructive testing procedure, which uses a thermographic measurement of a tested material thermal response after its external excitation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.antifragility","kind":"concept","label":"Antifragility","sources":[{"id":"wikipedia.article.antifragility","title":"English Wikipedia article: Antifragility","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antifragility"}],"status":"reported","summary":"English Wikipedia (article \"Antifragility\", CC BY-SA 4.0) states: Antifragility is a property of systems in which they increase in capability to thrive as a result of stressors, shocks, volatility, noise, mistakes, faults, attacks, or failures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.applied-physics","kind":"concept","label":"Applied physics","sources":[{"id":"wikipedia.article.applied-physics","title":"English Wikipedia article: Applied physics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+physics"}],"status":"reported","summary":"English Wikipedia (article \"Applied physics\", CC BY-SA 4.0) states: Applied physics is the application of physics to solve scientific or engineering problems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerobic-granular-reactor","kind":"concept","label":"Aerobic granular reactor","sources":[{"id":"wikipedia.article.aerobic-granular-reactor","title":"English Wikipedia article: Aerobic granular reactor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerobic+granular+reactor"}],"status":"reported","summary":"English Wikipedia (article \"Aerobic granular reactor\", CC BY-SA 4.0) states: Aerobic granular reactors (AGR) or Aerobic granular sludge (AGS) are a community of microbial organisms, typically around 0.5-3mm in diameter, that remove carbon, nitrogen, phosphorus and other pollutants in a single sludge system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-screw","kind":"concept","label":"Ball screw","sources":[{"id":"wikipedia.article.ball-screw","title":"English Wikipedia article: Ball screw","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+screw"}],"status":"reported","summary":"English Wikipedia (article \"Ball screw\", CC BY-SA 4.0) states: A ball screw (or ballscrew) is a mechanical linear actuator that translates rotational motion to linear motion with little friction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advance-ratio","kind":"concept","label":"Advance ratio","sources":[{"id":"wikipedia.article.advance-ratio","title":"English Wikipedia article: Advance ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advance+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Advance ratio\", CC BY-SA 4.0) states: The propeller advance ratio or coefficient is a dimensionless number used in aeronautics and marine hydrodynamics to describe the relationship between the speed at which a vehicle (like an airplane or a boat) is moving forward and the speed at which its propeller is turning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bill-of-materials","kind":"concept","label":"Bill of materials","sources":[{"id":"wikipedia.article.bill-of-materials","title":"English Wikipedia article: Bill of materials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bill+of+materials"}],"status":"reported","summary":"English Wikipedia (article \"Bill of materials\", CC BY-SA 4.0) states: A bill of materials or product structure (sometimes bill of material, BOM or associated list) is a list of the raw materials, sub-assemblies, intermediate assemblies, sub-components, parts, and the quantities of each needed to manufacture an end product.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.avionics","kind":"concept","label":"Avionics","sources":[{"id":"wikipedia.article.avionics","title":"English Wikipedia article: Avionics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Avionics"}],"status":"reported","summary":"English Wikipedia (article \"Avionics\", CC BY-SA 4.0) states: Avionics (a portmanteau of aviation and electronics) are the electronic systems used on aircraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.asset-health-management","kind":"concept","label":"Asset health management","sources":[{"id":"wikipedia.article.asset-health-management","title":"English Wikipedia article: Asset health management","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asset+health+management"}],"status":"reported","summary":"English Wikipedia (article \"Asset health management\", CC BY-SA 4.0) states: In asset management, asset health management (AHM) is the field of study that looks at how to manage the \"health\" of an assets in a facility, system, or fleet.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arcadia-engineering","kind":"concept","label":"Arcadia (engineering)","sources":[{"id":"wikipedia.article.arcadia-engineering","title":"English Wikipedia article: Arcadia (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arcadia+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Arcadia (engineering)\", CC BY-SA 4.0) states: ARCADIA (Architecture Analysis & Design Integrated Approach) is a system and software architecture engineering method based on architecture-centric and model-driven engineering activities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aquifer-test","kind":"concept","label":"Aquifer test","sources":[{"id":"wikipedia.article.aquifer-test","title":"English Wikipedia article: Aquifer test","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aquifer+test"}],"status":"reported","summary":"English Wikipedia (article \"Aquifer test\", CC BY-SA 4.0) states: In hydrogeology, an aquifer test (or a pumping test) is conducted to evaluate an aquifer by \"stimulating\" the aquifer through constant pumping, and observing the aquifer's \"response\" (drawdown) in observation wells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.geological-structure-measurement-by-lidar","kind":"concept","label":"Geological structure measurement by LiDAR","sources":[{"id":"wikipedia.article.geological-structure-measurement-by-lidar","title":"English Wikipedia article: Geological structure measurement by LiDAR","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geological+structure+measurement+by+LiDAR"}],"status":"reported","summary":"English Wikipedia (article \"Geological structure measurement by LiDAR\", CC BY-SA 4.0) states: Geological structure measurement by LiDAR technology is a remote sensing method applied in structural geology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cam-mechanism","kind":"concept","label":"Cam (mechanism)","sources":[{"id":"wikipedia.article.cam-mechanism","title":"English Wikipedia article: Cam (mechanism)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cam+%28mechanism%29"}],"status":"reported","summary":"English Wikipedia (article \"Cam (mechanism)\", CC BY-SA 4.0) states: A cam is a rotating or sliding piece in a mechanical linkage used especially in transforming rotary motion into linear motion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bagel-machine","kind":"concept","label":"Bagel machine","sources":[{"id":"wikipedia.article.bagel-machine","title":"English Wikipedia article: Bagel machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bagel+machine"}],"status":"reported","summary":"English Wikipedia (article \"Bagel machine\", CC BY-SA 4.0) states: A bagel machine is a machine that automatically produces bagels.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adapter","kind":"concept","label":"Adapter","sources":[{"id":"wikipedia.article.adapter","title":"English Wikipedia article: Adapter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adapter"}],"status":"reported","summary":"English Wikipedia (article \"Adapter\", CC BY-SA 4.0) states: An adapter or adaptor is a device that converts attributes of one electrical device or system to those of an otherwise incompatible device or system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cheng-cycle","kind":"concept","label":"Cheng cycle","sources":[{"id":"wikipedia.article.cheng-cycle","title":"English Wikipedia article: Cheng cycle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cheng+cycle"}],"status":"reported","summary":"English Wikipedia (article \"Cheng cycle\", CC BY-SA 4.0) states: The Cheng cycle is a thermodynamic cycle which uses a combination of two working fluids, one gas and one steam.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.application-layer-framing","kind":"concept","label":"Application-layer framing","sources":[{"id":"wikipedia.article.application-layer-framing","title":"English Wikipedia article: Application-layer framing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Application-layer+framing"}],"status":"reported","summary":"English Wikipedia (article \"Application-layer framing\", CC BY-SA 4.0) states: Application-layer framing or application-level framing (ALF) is a method of allowing an application to use its semantics for the design of its network protocols.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acicular-ferrite","kind":"concept","label":"Acicular ferrite","sources":[{"id":"wikipedia.article.acicular-ferrite","title":"English Wikipedia article: Acicular ferrite","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acicular+ferrite"}],"status":"reported","summary":"English Wikipedia (article \"Acicular ferrite\", CC BY-SA 4.0) states: Acicular ferrite is a microstructure of ferrite in steel that is characterised by needle-shaped crystallites or grains when viewed in two dimensions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.arbor-milling","kind":"concept","label":"Arbor milling","sources":[{"id":"wikipedia.article.arbor-milling","title":"English Wikipedia article: Arbor milling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arbor+milling"}],"status":"reported","summary":"English Wikipedia (article \"Arbor milling\", CC BY-SA 4.0) states: Arbor milling is a cutting process which removes material via a multi-toothed cutter.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-pump","kind":"concept","label":"Air pump","sources":[{"id":"wikipedia.article.air-pump","title":"English Wikipedia article: Air pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+pump"}],"status":"reported","summary":"English Wikipedia (article \"Air pump\", CC BY-SA 4.0) states: An air pump is a pump for pushing air. Examples include a bicycle pump, pumps that are used to aerate an aquarium or a pond via an airstone; a gas compressor used to power a pneumatic tool, air horn or pipe organ; a bellows used to encourage a fire; a vacuum cleaner and a vacuum pump.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-operated-valve","kind":"concept","label":"Air-operated valve","sources":[{"id":"wikipedia.article.air-operated-valve","title":"English Wikipedia article: Air-operated valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air-operated+valve"}],"status":"reported","summary":"English Wikipedia (article \"Air-operated valve\", CC BY-SA 4.0) states: An air-operated valve, also known as a pneumatic valve, is a type of power-operated pipe valve that uses air pressure to perform a function similar to a solenoid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-panel","kind":"concept","label":"Acoustic panel","sources":[{"id":"wikipedia.article.acoustic-panel","title":"English Wikipedia article: Acoustic panel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+panel"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic panel\", CC BY-SA 4.0) states: Acoustic panels (also sound absorption panels, soundproof panels or sound panels) are sound-absorbing fabric-wrapped boards designed to control echo and reverberation in a room.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aliasing","kind":"concept","label":"Aliasing","sources":[{"id":"wikipedia.article.aliasing","title":"English Wikipedia article: Aliasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aliasing"}],"status":"reported","summary":"English Wikipedia (article \"Aliasing\", CC BY-SA 4.0) states: In digital signal processing, aliasing is a phenomenon in which a reconstructed signal from samples of the original signal contains low frequency components that are not present in the original one.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.availability-zone","kind":"concept","label":"Availability zone","sources":[{"id":"wikipedia.article.availability-zone","title":"English Wikipedia article: Availability zone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Availability+zone"}],"status":"reported","summary":"English Wikipedia (article \"Availability zone\", CC BY-SA 4.0) states: In cloud computing, an availability region is a group of data centres that are located in the same geographical region.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerobic-granulation","kind":"concept","label":"Aerobic granulation","sources":[{"id":"wikipedia.article.aerobic-granulation","title":"English Wikipedia article: Aerobic granulation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerobic+granulation"}],"status":"reported","summary":"English Wikipedia (article \"Aerobic granulation\", CC BY-SA 4.0) states: The biological treatment of wastewater in the sewage treatment plant is often accomplished using conventional activated sludge systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.conductor-pipe","kind":"concept","label":"Conductor pipe","sources":[{"id":"wikipedia.article.conductor-pipe","title":"English Wikipedia article: Conductor pipe","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conductor+pipe"}],"status":"reported","summary":"English Wikipedia (article \"Conductor pipe\", CC BY-SA 4.0) states: A conductor pipe is a large diameter pipe that is set into the ground to provide the initial stable structural foundation for a borehole or oil well.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-front-end","kind":"concept","label":"Analog front-end","sources":[{"id":"wikipedia.article.analog-front-end","title":"English Wikipedia article: Analog front-end","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+front-end"}],"status":"reported","summary":"English Wikipedia (article \"Analog front-end\", CC BY-SA 4.0) states: An analog front-end (AFE or analog front-end controller AFEC) is a set of analog signal conditioning circuitry that uses sensitive analog amplifiers, often operational amplifiers, filters, and sometimes application-specific integrated circuits for sensors, radio receivers, and other circuits to provide a configurable and flexible electronics functional block needed to interface a variety of sensors to an antenna, analog-to-digital converter or, in some cases, to a microcontroller.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.seismic-base-isolation","kind":"concept","label":"Seismic base isolation","sources":[{"id":"wikipedia.article.seismic-base-isolation","title":"English Wikipedia article: Seismic base isolation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Seismic+base+isolation"}],"status":"reported","summary":"English Wikipedia (article \"Seismic base isolation\", CC BY-SA 4.0) states: Seismic base isolation, also known as base isolation, or base isolation system, is one of the most popular means of protecting a structure against earthquake forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cannon-bearing","kind":"concept","label":"Cannon bearing","sources":[{"id":"wikipedia.article.cannon-bearing","title":"English Wikipedia article: Cannon bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cannon+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Cannon bearing\", CC BY-SA 4.0) states: A cannon bearing or cannon box bearing is an arrangement of bearings on a shaft, usually an axle, where two bearings are mounted in an enclosed tube.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baffle-heat-transfer","kind":"concept","label":"Baffle (heat transfer)","sources":[{"id":"wikipedia.article.baffle-heat-transfer","title":"English Wikipedia article: Baffle (heat transfer)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baffle+%28heat+transfer%29"}],"status":"reported","summary":"English Wikipedia (article \"Baffle (heat transfer)\", CC BY-SA 4.0) states: Baffles are flow-directing or obstructing vanes or panels used to direct a flow of liquid or gas.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angular-rate-sensor","kind":"concept","label":"Angular rate sensor","sources":[{"id":"wikipedia.article.angular-rate-sensor","title":"English Wikipedia article: Angular rate sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angular+rate+sensor"}],"status":"reported","summary":"English Wikipedia (article \"Angular rate sensor\", CC BY-SA 4.0) states: Angular rate sensors, ARS, are devices that directly measure angular rate, without integration in conditioning electronics.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airshaft","kind":"concept","label":"Airshaft","sources":[{"id":"wikipedia.article.airshaft","title":"English Wikipedia article: Airshaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airshaft"}],"status":"reported","summary":"English Wikipedia (article \"Airshaft\", CC BY-SA 4.0) states: In manufacturing, an airshaft is a device used for handling winding reels in the processing of web-fed materials, such as continuous-process printing presses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-multi-mission-operations-system","kind":"concept","label":"Advanced multi-mission operations system","sources":[{"id":"wikipedia.article.advanced-multi-mission-operations-system","title":"English Wikipedia article: Advanced multi-mission operations system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+multi-mission+operations+system"}],"status":"reported","summary":"English Wikipedia (article \"Advanced multi-mission operations system\", CC BY-SA 4.0) states: The advanced multi-mission operations system (AMMOS) is a common set of services and tools created by the Interplanetary Network Directorate, a division of the Jet Propulsion Laboratory, for use in JPL's operation of spacecraft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biasing","kind":"concept","label":"Biasing","sources":[{"id":"wikipedia.article.biasing","title":"English Wikipedia article: Biasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biasing"}],"status":"reported","summary":"English Wikipedia (article \"Biasing\", CC BY-SA 4.0) states: In electronics, biasing is the setting of DC (direct current) operating conditions (current and voltage) of an electronic component that processes time-varying signals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axiomatic-design","kind":"concept","label":"Axiomatic design","sources":[{"id":"wikipedia.article.axiomatic-design","title":"English Wikipedia article: Axiomatic design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiomatic+design"}],"status":"reported","summary":"English Wikipedia (article \"Axiomatic design\", CC BY-SA 4.0) states: Axiomatic design is a systems design methodology using matrix methods to systematically analyze the transformation of customer needs into functional requirements, design parameters, and process variables.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.artifact-centric-business-process-model","kind":"concept","label":"Artifact-centric business process model","sources":[{"id":"wikipedia.article.artifact-centric-business-process-model","title":"English Wikipedia article: Artifact-centric business process model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artifact-centric+business+process+model"}],"status":"reported","summary":"English Wikipedia (article \"Artifact-centric business process model\", CC BY-SA 4.0) states: Artifact-centric business process model represents an operational model of business processes in which the changes and evolution of business data, or business entities, are considered as the main driver of the processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.archimedes-screw","kind":"concept","label":"Archimedes' screw","sources":[{"id":"wikipedia.article.archimedes-screw","title":"English Wikipedia article: Archimedes' screw","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Archimedes%27+screw"}],"status":"reported","summary":"English Wikipedia (article \"Archimedes' screw\", CC BY-SA 4.0) states: An Archimedes' screw is a hydraulic machine composed of an outer cylinder and an inner cylinder with helical blades.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cam-timer","kind":"concept","label":"Cam timer","sources":[{"id":"wikipedia.article.cam-timer","title":"English Wikipedia article: Cam timer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cam+timer"}],"status":"reported","summary":"English Wikipedia (article \"Cam timer\", CC BY-SA 4.0) states: A cam timer or drum sequencer is an electromechanical system for controlling a sequence of events automatically.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bicycle-tree","kind":"concept","label":"Bicycle tree","sources":[{"id":"wikipedia.article.bicycle-tree","title":"English Wikipedia article: Bicycle tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicycle+tree"}],"status":"reported","summary":"English Wikipedia (article \"Bicycle tree\", CC BY-SA 4.0) states: A bicycle tree or cycle tree or bike tree is a bicycle parking system that resembles a tree in shape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerial-manned-unmanned-teaming","kind":"concept","label":"Aerial manned-unmanned teaming","sources":[{"id":"wikipedia.article.aerial-manned-unmanned-teaming","title":"English Wikipedia article: Aerial manned-unmanned teaming","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerial+manned-unmanned+teaming"}],"status":"reported","summary":"English Wikipedia (article \"Aerial manned-unmanned teaming\", CC BY-SA 4.0) states: Aerial manned-unmanned teaming is the collaborative operation of manned and unmanned aircraft systems, typically in military contexts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.astm-g65","kind":"concept","label":"ASTM G65","sources":[{"id":"wikipedia.article.astm-g65","title":"English Wikipedia article: ASTM G65","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ASTM+G65"}],"status":"reported","summary":"English Wikipedia (article \"ASTM G65\", CC BY-SA 4.0) states: ASTM G65 is an international ASTM test method standard for measuring abrasion resistance of metallic materials and their surface treatments using a dry sand/rubber wheel apparatus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.digital-micromirror-device","kind":"concept","label":"Digital micromirror device","sources":[{"id":"wikipedia.article.digital-micromirror-device","title":"English Wikipedia article: Digital micromirror device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Digital+micromirror+device"}],"status":"reported","summary":"English Wikipedia (article \"Digital micromirror device\", CC BY-SA 4.0) states: The digital micromirror device, or DMD, is the microoptoelectromechanical system (MOEMS) that is the core of the trademarked digital light processing (DLP) projection technology from Texas Instruments (TI).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barlow-s-wheel","kind":"concept","label":"Barlow's wheel","sources":[{"id":"wikipedia.article.barlow-s-wheel","title":"English Wikipedia article: Barlow's wheel","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barlow%27s+wheel"}],"status":"reported","summary":"English Wikipedia (article \"Barlow's wheel\", CC BY-SA 4.0) states: Barlow's wheel was an early demonstration of a homopolar motor, designed and built by English mathematician and physicist Peter Barlow in 1822.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.airlift-pump","kind":"concept","label":"Airlift pump","sources":[{"id":"wikipedia.article.airlift-pump","title":"English Wikipedia article: Airlift pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Airlift+pump"}],"status":"reported","summary":"English Wikipedia (article \"Airlift pump\", CC BY-SA 4.0) states: An airlift pump is a pump that has low suction and moderate discharge of liquid and entrained solids.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cr-maill-re","kind":"concept","label":"Crémaillère","sources":[{"id":"wikipedia.article.cr-maill-re","title":"English Wikipedia article: Crémaillère","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cr%C3%A9maill%C3%A8re"}],"status":"reported","summary":"English Wikipedia (article \"Crémaillère\", CC BY-SA 4.0) states: A crémaillère is a French, mechanical term for the rack, or a straight bar with teeth on one edge designed to work into the teeth of a wheel or a pinion (French pignon) that predates the Renaissance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angle-bracket-fastener","kind":"concept","label":"Angle bracket (fastener)","sources":[{"id":"wikipedia.article.angle-bracket-fastener","title":"English Wikipedia article: Angle bracket (fastener)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angle+bracket+%28fastener%29"}],"status":"reported","summary":"English Wikipedia (article \"Angle bracket (fastener)\", CC BY-SA 4.0) states: An angle bracket or angle brace or angle cleat is an L-shaped fastener used to join two parts generally at a 90-degree angle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crawl-ratio","kind":"concept","label":"Crawl ratio","sources":[{"id":"wikipedia.article.crawl-ratio","title":"English Wikipedia article: Crawl ratio","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crawl+ratio"}],"status":"reported","summary":"English Wikipedia (article \"Crawl ratio\", CC BY-SA 4.0) states: In off-road driving, crawl ratio is the lowest overall gear ratio that a vehicle's drivetrain is capable of, i.e. the slowest vehicle speed for the same engine speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-pod","kind":"concept","label":"Acoustic pod","sources":[{"id":"wikipedia.article.acoustic-pod","title":"English Wikipedia article: Acoustic pod","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+pod"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic pod\", CC BY-SA 4.0) states: An acoustic pod is a specialized structure (module) designed to create a soundproof, quiet, private space within a room, studio, or office, ensuring confidentiality.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alpha-beta-filter","kind":"concept","label":"Alpha beta filter","sources":[{"id":"wikipedia.article.alpha-beta-filter","title":"English Wikipedia article: Alpha beta filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alpha+beta+filter"}],"status":"reported","summary":"English Wikipedia (article \"Alpha beta filter\", CC BY-SA 4.0) states: An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter) is a simplified form of observer for estimation, data smoothing and control applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bathtub-curve","kind":"concept","label":"Bathtub curve","sources":[{"id":"wikipedia.article.bathtub-curve","title":"English Wikipedia article: Bathtub curve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bathtub+curve"}],"status":"reported","summary":"English Wikipedia (article \"Bathtub curve\", CC BY-SA 4.0) states: In reliability engineering and deterioration modeling, a bathtub curve is a failure rate graph that curves up at both ends, similar in shape to a bathtub.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-stirling-radioisotope-generator","kind":"concept","label":"Advanced Stirling radioisotope generator","sources":[{"id":"wikipedia.article.advanced-stirling-radioisotope-generator","title":"English Wikipedia article: Advanced Stirling radioisotope generator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+Stirling+radioisotope+generator"}],"status":"reported","summary":"English Wikipedia (article \"Advanced Stirling radioisotope generator\", CC BY-SA 4.0) states: The advanced Stirling radioisotope generator (ASRG) is a radioisotope power system first developed at NASA's Glenn Research Center.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-to-digital-converter","kind":"concept","label":"Analog-to-digital converter","sources":[{"id":"wikipedia.article.analog-to-digital-converter","title":"English Wikipedia article: Analog-to-digital converter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog-to-digital+converter"}],"status":"reported","summary":"English Wikipedia (article \"Analog-to-digital converter\", CC BY-SA 4.0) states: In electronics, an analog-to-digital converter (ADC, A/D, or A-to-D) is a system that converts an analog signal, such as from fingers touching a touchscreen, sound entering a microphone, or light entering a digital camera, into a digital signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beam-structure","kind":"concept","label":"Beam (structure)","sources":[{"id":"wikipedia.article.beam-structure","title":"English Wikipedia article: Beam (structure)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beam+%28structure%29"}],"status":"reported","summary":"English Wikipedia (article \"Beam (structure)\", CC BY-SA 4.0) states: A beam is a structural element designed to carry loads perpendicular to its long (or \"horizontal\") axis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.malibu-hydro","kind":"concept","label":"Malibu Hydro","sources":[{"id":"wikipedia.article.malibu-hydro","title":"English Wikipedia article: Malibu Hydro","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Malibu+Hydro"}],"status":"reported","summary":"English Wikipedia (article \"Malibu Hydro\", CC BY-SA 4.0) states: Malibu Hydro System was designed to provide electricity to the Malibu Club in Canada.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.camcon-binary-actuator","kind":"concept","label":"Camcon binary actuator","sources":[{"id":"wikipedia.article.camcon-binary-actuator","title":"English Wikipedia article: Camcon binary actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Camcon+binary+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Camcon binary actuator\", CC BY-SA 4.0) states: The Camcon binary actuator is an electronically controlled electromagnetic actuation device that physically moves in between 2 stable states.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.array-processing","kind":"concept","label":"Array processing","sources":[{"id":"wikipedia.article.array-processing","title":"English Wikipedia article: Array processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Array+processing"}],"status":"reported","summary":"English Wikipedia (article \"Array processing\", CC BY-SA 4.0) states: Array processing is a wide area of research in the field of signal processing that extends from the simplest form of 1 dimensional line arrays to 2 and 3 dimensional array geometries.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.breaking-capacity","kind":"concept","label":"Breaking capacity","sources":[{"id":"wikipedia.article.breaking-capacity","title":"English Wikipedia article: Breaking capacity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breaking+capacity"}],"status":"reported","summary":"English Wikipedia (article \"Breaking capacity\", CC BY-SA 4.0) states: Breaking capacity or interrupting rating is the current that a fuse, circuit breaker, or other electrical apparatus is able to interrupt without being destroyed or causing an electric arc with unacceptable duration.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bodenstein-number","kind":"concept","label":"Bodenstein number","sources":[{"id":"wikipedia.article.bodenstein-number","title":"English Wikipedia article: Bodenstein number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bodenstein+number"}],"status":"reported","summary":"English Wikipedia (article \"Bodenstein number\", CC BY-SA 4.0) states: The Bodenstein number (abbreviated Bo, named after Max Bodenstein) is a dimensionless parameter in chemical reaction engineering, which describes the ratio of the amount of substance introduced by convection to that introduced by diffusion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerodynamic-center","kind":"concept","label":"Aerodynamic center","sources":[{"id":"wikipedia.article.aerodynamic-center","title":"English Wikipedia article: Aerodynamic center","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerodynamic+center"}],"status":"reported","summary":"English Wikipedia (article \"Aerodynamic center\", CC BY-SA 4.0) states: In aerodynamics, the torques or moments acting on an airfoil moving through a fluid can be accounted for by the net lift and net drag applied at some point on the airfoil, and a separate net pitching moment about that point whose magnitude varies with the choice of where the lift is chosen to be applied.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.active-disturbance-rejection-control","kind":"concept","label":"Active disturbance rejection control","sources":[{"id":"wikipedia.article.active-disturbance-rejection-control","title":"English Wikipedia article: Active disturbance rejection control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Active+disturbance+rejection+control"}],"status":"reported","summary":"English Wikipedia (article \"Active disturbance rejection control\", CC BY-SA 4.0) states: Active disturbance rejection control (or ADRC, also known as automatic disturbance rejection control) is a model-free control technique used for designing controllers for systems with unknown dynamics and external disturbances.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.certificate-of-analysis","kind":"concept","label":"Certificate of analysis","sources":[{"id":"wikipedia.article.certificate-of-analysis","title":"English Wikipedia article: Certificate of analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Certificate+of+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Certificate of analysis\", CC BY-SA 4.0) states: A certificate of analysis (COA) is a formal laboratory-prepared document that details the results of (and sometimes the specifications and analytical methods for) one or more laboratory analyses, signed—manually or electronically—by an authorized representative of the entity conducting the analyses.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bipolar-transistor-biasing","kind":"concept","label":"Bipolar transistor biasing","sources":[{"id":"wikipedia.article.bipolar-transistor-biasing","title":"English Wikipedia article: Bipolar transistor biasing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bipolar+transistor+biasing"}],"status":"reported","summary":"English Wikipedia (article \"Bipolar transistor biasing\", CC BY-SA 4.0) states: Biasing is the setting of the DC operating point of an electronic component.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bin-tipper","kind":"concept","label":"Bin tipper","sources":[{"id":"wikipedia.article.bin-tipper","title":"English Wikipedia article: Bin tipper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bin+tipper"}],"status":"reported","summary":"English Wikipedia (article \"Bin tipper\", CC BY-SA 4.0) states: A bin tipper, also known as a bin-tipper, bin lifter, or cart dumper, is a machine which mechanically lifts and inverts bins/carts for the purpose of emptying them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.base-50","kind":"concept","label":"Base 50","sources":[{"id":"wikipedia.article.base-50","title":"English Wikipedia article: Base 50","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Base+50"}],"status":"reported","summary":"English Wikipedia (article \"Base 50\", CC BY-SA 4.0) states: A Base 50 engine is a generic term for engines that are reverse-engineered from the Honda 49 cc (3.0 cu in) air-cooled four-stroke single cylinder engine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.automotive-fuse","kind":"concept","label":"Automotive fuse","sources":[{"id":"wikipedia.article.automotive-fuse","title":"English Wikipedia article: Automotive fuse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automotive+fuse"}],"status":"reported","summary":"English Wikipedia (article \"Automotive fuse\", CC BY-SA 4.0) states: Automotive fuses are a class of fuses used to protect the wiring and electrical equipment for motor vehicles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.contact-protection","kind":"concept","label":"Contact protection","sources":[{"id":"wikipedia.article.contact-protection","title":"English Wikipedia article: Contact protection","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contact+protection"}],"status":"reported","summary":"English Wikipedia (article \"Contact protection\", CC BY-SA 4.0) states: Contact protection methods are designed to mitigate the wear and degradation occurring during the normal use of contacts within an electromechanical switch, relay or contactor and thus avoid an excessive increase in contact resistance or switch failure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.attack-time-delay","kind":"concept","label":"Attack-time delay","sources":[{"id":"wikipedia.article.attack-time-delay","title":"English Wikipedia article: Attack-time delay","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Attack-time+delay"}],"status":"reported","summary":"English Wikipedia (article \"Attack-time delay\", CC BY-SA 4.0) states: In telecommunications, attack-time delay is the time needed for a receiver or transmitter to respond to an incoming signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-carbon-arc-cutting","kind":"concept","label":"Air carbon arc cutting","sources":[{"id":"wikipedia.article.air-carbon-arc-cutting","title":"English Wikipedia article: Air carbon arc cutting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+carbon+arc+cutting"}],"status":"reported","summary":"English Wikipedia (article \"Air carbon arc cutting\", CC BY-SA 4.0) states: Air carbon arc cutting, also referred to as metal arc gouging, and previously as air arc cutting, is an arc cutting process where metal is cut and melted by the heat of a carbon arc.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biomachining","kind":"concept","label":"Biomachining","sources":[{"id":"wikipedia.article.biomachining","title":"English Wikipedia article: Biomachining","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biomachining"}],"status":"reported","summary":"English Wikipedia (article \"Biomachining\", CC BY-SA 4.0) states: Biomachining is the machining process of using lithotropic bacteria to remove material from metal parts, contrasted with chemical machining methods such as chemical milling and physical machining methods such as milling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.diode","kind":"concept","label":"Diode","sources":[{"id":"wikipedia.article.diode","title":"English Wikipedia article: Diode","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diode"}],"status":"reported","summary":"English Wikipedia (article \"Diode\", CC BY-SA 4.0) states: A diode is a two-terminal electronic component that conducts electric current primarily in one direction (asymmetric conductance).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-valve","kind":"concept","label":"Ball valve","sources":[{"id":"wikipedia.article.ball-valve","title":"English Wikipedia article: Ball valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+valve"}],"status":"reported","summary":"English Wikipedia (article \"Ball valve\", CC BY-SA 4.0) states: A ball valve, also known as cone valve, is a flow control device which operates using a spherical ball with a hole (also known as a bore) through the middle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bayonet-mount","kind":"concept","label":"Bayonet mount","sources":[{"id":"wikipedia.article.bayonet-mount","title":"English Wikipedia article: Bayonet mount","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bayonet+mount"}],"status":"reported","summary":"English Wikipedia (article \"Bayonet mount\", CC BY-SA 4.0) states: A bayonet mount (mainly as a method of mechanical attachment, such as fitting a lens to a camera using a matching lens mount) or bayonet connector (for electrical use) is a fastening mechanism consisting of a cylindrical male side with one or more radial pegs, and a female receptor with matching L-shaped slot(s) and with spring(s) to keep the two parts locked together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dc-injection-braking","kind":"concept","label":"DC injection braking","sources":[{"id":"wikipedia.article.dc-injection-braking","title":"English Wikipedia article: DC injection braking","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=DC+injection+braking"}],"status":"reported","summary":"English Wikipedia (article \"DC injection braking\", CC BY-SA 4.0) states: DC injection braking is a method of slowing AC electric motors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.acoustic-transmission","kind":"concept","label":"Acoustic transmission","sources":[{"id":"wikipedia.article.acoustic-transmission","title":"English Wikipedia article: Acoustic transmission","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acoustic+transmission"}],"status":"reported","summary":"English Wikipedia (article \"Acoustic transmission\", CC BY-SA 4.0) states: Acoustic transmission is the transmission of sounds through and between materials, including air, wall, and musical instruments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-composite-materials-engineering","kind":"concept","label":"Advanced composite materials (engineering)","sources":[{"id":"wikipedia.article.advanced-composite-materials-engineering","title":"English Wikipedia article: Advanced composite materials (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+composite+materials+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Advanced composite materials (engineering)\", CC BY-SA 4.0) states: In materials science, advanced composite materials (ACMs) are materials that are generally characterized by unusually high-strength fibres with unusually high stiffness, or modulus of elasticity characteristics, compared to other materials, while bound together by weaker matrices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cascading-failure","kind":"concept","label":"Cascading failure","sources":[{"id":"wikipedia.article.cascading-failure","title":"English Wikipedia article: Cascading failure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cascading+failure"}],"status":"reported","summary":"English Wikipedia (article \"Cascading failure\", CC BY-SA 4.0) states: A cascading failure is a failure in a system of interconnected parts in which the failure of one or few parts leads to the failure of other parts, growing progressively as a result of positive feedback.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.artificial-intelligence-engineering","kind":"field","label":"Artificial intelligence engineering","sources":[{"id":"wikipedia.article.artificial-intelligence-engineering","title":"English Wikipedia article: Artificial intelligence engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artificial+intelligence+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Artificial intelligence engineering\", CC BY-SA 4.0) states: Artificial intelligence engineering (AI engineering) is a technical discipline that focuses on the design, development, and deployment of AI systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.architectural-ironmongery","kind":"concept","label":"Architectural ironmongery","sources":[{"id":"wikipedia.article.architectural-ironmongery","title":"English Wikipedia article: Architectural ironmongery","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+ironmongery"}],"status":"reported","summary":"English Wikipedia (article \"Architectural ironmongery\", CC BY-SA 4.0) states: Architectural ironmongery or architectural hardware is a term used for the manufacture and wholesale distribution of items made from iron, steel, brass, aluminium or other metals, including plastics, for use in all types of buildings.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crosshead","kind":"concept","label":"Crosshead","sources":[{"id":"wikipedia.article.crosshead","title":"English Wikipedia article: Crosshead","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crosshead"}],"status":"reported","summary":"English Wikipedia (article \"Crosshead\", CC BY-SA 4.0) states: In mechanical engineering, a crosshead is a mechanical joint used as part of the slider-crank linkages of long stroke reciprocating engines (either internal combustion or steam) and reciprocating compressors to eliminate sideways force on the piston.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.condenser-heat-transfer","kind":"concept","label":"Condenser (heat transfer)","sources":[{"id":"wikipedia.article.condenser-heat-transfer","title":"English Wikipedia article: Condenser (heat transfer)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Condenser+%28heat+transfer%29"}],"status":"reported","summary":"English Wikipedia (article \"Condenser (heat transfer)\", CC BY-SA 4.0) states: In systems involving heat transfer, a condenser is a heat exchanger used to condense a gaseous substance into a liquid state through cooling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-control","kind":"concept","label":"Adaptive control","sources":[{"id":"wikipedia.article.adaptive-control","title":"English Wikipedia article: Adaptive control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+control"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive control\", CC BY-SA 4.0) states: Adaptive control is the control method used by a controller which must adapt to a controlled system with parameters which vary, or are initially uncertain.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bootstrapping-electronics","kind":"concept","label":"Bootstrapping (electronics)","sources":[{"id":"wikipedia.article.bootstrapping-electronics","title":"English Wikipedia article: Bootstrapping (electronics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bootstrapping+%28electronics%29"}],"status":"reported","summary":"English Wikipedia (article \"Bootstrapping (electronics)\", CC BY-SA 4.0) states: Bootstrapping is a technique in the field of electronics where part of the output of a system is used at startup.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.armourstone","kind":"concept","label":"Armourstone","sources":[{"id":"wikipedia.article.armourstone","title":"English Wikipedia article: Armourstone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Armourstone"}],"status":"reported","summary":"English Wikipedia (article \"Armourstone\", CC BY-SA 4.0) states: Armourstone is a generic term for broken stone with stone masses between 100 and 10,000 kilograms (220 and 22,050 lb) (very coarse aggregate) that is suitable for use in hydraulic engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.inflatable-packer","kind":"concept","label":"Inflatable packer","sources":[{"id":"wikipedia.article.inflatable-packer","title":"English Wikipedia article: Inflatable packer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inflatable+packer"}],"status":"reported","summary":"English Wikipedia (article \"Inflatable packer\", CC BY-SA 4.0) states: An inflatable packer is a downhole tool used to seal sections of a borehole or well by inflating a reinforced elastomeric sleeve against the surrounding casing or rock wall.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.centrifugal-governor","kind":"concept","label":"Centrifugal governor","sources":[{"id":"wikipedia.article.centrifugal-governor","title":"English Wikipedia article: Centrifugal governor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centrifugal+governor"}],"status":"reported","summary":"English Wikipedia (article \"Centrifugal governor\", CC BY-SA 4.0) states: A centrifugal governor is a specific type of governor with a feedback system that controls the speed of an engine by regulating the flow of fuel or working fluid, so as to maintain a near-constant speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.block-and-tackle","kind":"concept","label":"Block and tackle","sources":[{"id":"wikipedia.article.block-and-tackle","title":"English Wikipedia article: Block and tackle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Block+and+tackle"}],"status":"reported","summary":"English Wikipedia (article \"Block and tackle\", CC BY-SA 4.0) states: A block and tackle, purchase, or only tackle is a system of two or more pulleys with a rope or cable threaded between them, used to provide tension and lift heavy loads.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bendix-drive","kind":"concept","label":"Bendix drive","sources":[{"id":"wikipedia.article.bendix-drive","title":"English Wikipedia article: Bendix drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bendix+drive"}],"status":"reported","summary":"English Wikipedia (article \"Bendix drive\", CC BY-SA 4.0) states: A Bendix drive is a type of engagement mechanism used in starter motors of internal combustion engines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.contingency-electrical-grid","kind":"concept","label":"Contingency (electrical grid)","sources":[{"id":"wikipedia.article.contingency-electrical-grid","title":"English Wikipedia article: Contingency (electrical grid)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Contingency+%28electrical+grid%29"}],"status":"reported","summary":"English Wikipedia (article \"Contingency (electrical grid)\", CC BY-SA 4.0) states: In an electrical grid, contingency is an unexpected failure of a single principal component (e.g., an electrical generator or a power transmission line) that causes the change of the system state large enough to endanger the grid security.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ameca-robot","kind":"concept","label":"Ameca (robot)","sources":[{"id":"wikipedia.article.ameca-robot","title":"English Wikipedia article: Ameca (robot)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ameca+%28robot%29"}],"status":"reported","summary":"English Wikipedia (article \"Ameca (robot)\", CC BY-SA 4.0) states: Ameca is a robotic humanoid created in 2021 by Engineered Arts, headquartered in Falmouth, Cornwall, United Kingdom.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autogenous-welding","kind":"concept","label":"Autogenous welding","sources":[{"id":"wikipedia.article.autogenous-welding","title":"English Wikipedia article: Autogenous welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autogenous+welding"}],"status":"reported","summary":"English Wikipedia (article \"Autogenous welding\", CC BY-SA 4.0) states: Autogenous welding is a form of welding in which the filler material is either supplied by melting the base material or is of identical composition.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.boring-manufacturing","kind":"concept","label":"Boring (manufacturing)","sources":[{"id":"wikipedia.article.boring-manufacturing","title":"English Wikipedia article: Boring (manufacturing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boring+%28manufacturing%29"}],"status":"reported","summary":"English Wikipedia (article \"Boring (manufacturing)\", CC BY-SA 4.0) states: In machining, boring is the process of enlarging a hole that has already been drilled (or cast) by means of a single-point cutting tool (or of a boring head containing several such tools), such as in boring a gun barrel or an engine cylinder.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.composite-bearing","kind":"concept","label":"Composite bearing","sources":[{"id":"wikipedia.article.composite-bearing","title":"English Wikipedia article: Composite bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Composite+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Composite bearing\", CC BY-SA 4.0) states: A composite bearing is a bearing made from a combination of materials such as a resin reinforced with fibre and this may also include friction reducing lubricants and ingredients.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dye-and-pry","kind":"concept","label":"Dye-and-pry","sources":[{"id":"wikipedia.article.dye-and-pry","title":"English Wikipedia article: Dye-and-pry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dye-and-pry"}],"status":"reported","summary":"English Wikipedia (article \"Dye-and-pry\", CC BY-SA 4.0) states: Dye-n-Pry, also called Dye And Pry, Dye and Pull, Dye Staining, or Dye Penetrant, is a destructive analysis technique used on surface mount technology (SMT) components to either perform failure analysis or inspect for solder joint integrity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bipolar-electric-motor","kind":"concept","label":"Bipolar electric motor","sources":[{"id":"wikipedia.article.bipolar-electric-motor","title":"English Wikipedia article: Bipolar electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bipolar+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Bipolar electric motor\", CC BY-SA 4.0) states: A bipolar electric motor is an electric motor with only two (hence bi-) poles to its stationary field.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beer-tap","kind":"concept","label":"Beer tap","sources":[{"id":"wikipedia.article.beer-tap","title":"English Wikipedia article: Beer tap","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beer+tap"}],"status":"reported","summary":"English Wikipedia (article \"Beer tap\", CC BY-SA 4.0) states: A beer tap is a valved device for controlling the release of beer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cycloid-gear","kind":"concept","label":"Cycloid gear","sources":[{"id":"wikipedia.article.cycloid-gear","title":"English Wikipedia article: Cycloid gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cycloid+gear"}],"status":"reported","summary":"English Wikipedia (article \"Cycloid gear\", CC BY-SA 4.0) states: A cycloidal gear is a toothed gear with a cycloidal profile.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.binder-clip","kind":"concept","label":"Binder clip","sources":[{"id":"wikipedia.article.binder-clip","title":"English Wikipedia article: Binder clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Binder+clip"}],"status":"reported","summary":"English Wikipedia (article \"Binder clip\", CC BY-SA 4.0) states: A binder clip (also known as a foldback clip, paper clamp, banker's clip, foldover clip, bobby clip, bulldog clip or clasp) is a simple device for binding sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drive-shaft","kind":"concept","label":"Drive shaft","sources":[{"id":"wikipedia.article.drive-shaft","title":"English Wikipedia article: Drive shaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drive+shaft"}],"status":"reported","summary":"English Wikipedia (article \"Drive shaft\", CC BY-SA 4.0) states: A drive shaft, driveshaft, driving shaft, tailshaft (Australian English), propeller shaft (prop shaft), or Cardan shaft (after Girolamo Cardano) is a component for transmitting mechanical power, torque, and rotation, usually used to connect other components of a drivetrain that cannot be connected directly because of distance or the need to allow for relative movement between them.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analog-signal-processing","kind":"concept","label":"Analog signal processing","sources":[{"id":"wikipedia.article.analog-signal-processing","title":"English Wikipedia article: Analog signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analog+signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Analog signal processing\", CC BY-SA 4.0) states: Analog signal processing is a type of signal processing conducted on continuous analog signals by some analog means (as opposed to the discrete digital signal processing (DSP) where the signal processing is carried out by a digital process).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.automation-engineering","kind":"field","label":"Automation engineering","sources":[{"id":"wikipedia.article.automation-engineering","title":"English Wikipedia article: Automation engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automation+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Automation engineering\", CC BY-SA 4.0) states: Automation engineering is a branch of engineering that deals with the development of methods and facilities of automation that replace, in whole or in part, manual labour related to the control and monitoring of systems and processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.desander","kind":"concept","label":"Desander","sources":[{"id":"wikipedia.article.desander","title":"English Wikipedia article: Desander","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Desander"}],"status":"reported","summary":"English Wikipedia (article \"Desander\", CC BY-SA 4.0) states: Desanders and desilters are solid control equipment with a set of hydrocyclones that separate sand and silt from the drilling fluids in drilling rigs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","kind":"concept","label":"Alkali-metal thermal to electric converter","sources":[{"id":"wikipedia.article.alkali-metal-thermal-to-electric-converter","title":"English Wikipedia article: Alkali-metal thermal to electric converter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alkali-metal+thermal+to+electric+converter"}],"status":"reported","summary":"English Wikipedia (article \"Alkali-metal thermal to electric converter\", CC BY-SA 4.0) states: An alkali-metal thermal-to-electric converter (AMTEC, originally called the sodium heat engine or SHE) is a thermally regenerative electrochemical device for the direct conversion of heat to electrical energy.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.audio-filter","kind":"concept","label":"Audio filter","sources":[{"id":"wikipedia.article.audio-filter","title":"English Wikipedia article: Audio filter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audio+filter"}],"status":"reported","summary":"English Wikipedia (article \"Audio filter\", CC BY-SA 4.0) states: An audio filter is a frequency-dependent circuit, an electronic filter, working in the audio frequency range, 0 Hz to 20 kHz.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bioactive-paper","kind":"concept","label":"Bioactive paper","sources":[{"id":"wikipedia.article.bioactive-paper","title":"English Wikipedia article: Bioactive paper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bioactive+paper"}],"status":"reported","summary":"English Wikipedia (article \"Bioactive paper\", CC BY-SA 4.0) states: Bioactive paper is a paper-based sensor that can identify various contaminants in food and water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-fan-design","kind":"concept","label":"Axial fan design","sources":[{"id":"wikipedia.article.axial-fan-design","title":"English Wikipedia article: Axial fan design","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+fan+design"}],"status":"reported","summary":"English Wikipedia (article \"Axial fan design\", CC BY-SA 4.0) states: An axial fan is a type of fan that causes gas to flow through it in an axial direction from entry to exit, parallel to the shaft about which the blades rotate.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.calcium-looping","kind":"concept","label":"Calcium looping","sources":[{"id":"wikipedia.article.calcium-looping","title":"English Wikipedia article: Calcium looping","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calcium+looping"}],"status":"reported","summary":"English Wikipedia (article \"Calcium looping\", CC BY-SA 4.0) states: Calcium looping (CaL), or the regenerative calcium cycle (RCC), is a second-generation carbon capture technology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bent-structural","kind":"concept","label":"Bent (structural)","sources":[{"id":"wikipedia.article.bent-structural","title":"English Wikipedia article: Bent (structural)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bent+%28structural%29"}],"status":"reported","summary":"English Wikipedia (article \"Bent (structural)\", CC BY-SA 4.0) states: A bent in American English is a transverse rigid frame (or similar structures such as three-hinged arches).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.advanced-process-control","kind":"concept","label":"Advanced process control","sources":[{"id":"wikipedia.article.advanced-process-control","title":"English Wikipedia article: Advanced process control","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Advanced+process+control"}],"status":"reported","summary":"English Wikipedia (article \"Advanced process control\", CC BY-SA 4.0) states: In control theory, advanced process control (APC) refers to a broad range of techniques and technologies implemented within industrial process control systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.concurrent-engineering","kind":"concept","label":"Concurrent engineering","sources":[{"id":"wikipedia.article.concurrent-engineering","title":"English Wikipedia article: Concurrent engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Concurrent+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Concurrent engineering\", CC BY-SA 4.0) states: Concurrent engineering (CE) or concurrent design and manufacturing is a work methodology emphasizing the parallelization of tasks (i.e. performing tasks concurrently), which is sometimes called simultaneous engineering or integrated product development (IPD) using an integrated product team approach.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.color-wheel-optics","kind":"concept","label":"Color wheel (optics)","sources":[{"id":"wikipedia.article.color-wheel-optics","title":"English Wikipedia article: Color wheel (optics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Color+wheel+%28optics%29"}],"status":"reported","summary":"English Wikipedia (article \"Color wheel (optics)\", CC BY-SA 4.0) states: A color wheel or other switch for changing a projected hue (e.g., for an optical display) is a device that uses different optics filters or color gels within a light beam.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buzzer","kind":"concept","label":"Buzzer","sources":[{"id":"wikipedia.article.buzzer","title":"English Wikipedia article: Buzzer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buzzer"}],"status":"reported","summary":"English Wikipedia (article \"Buzzer\", CC BY-SA 4.0) states: A buzzer or beeper is an audio signaling device, which may be mechanical, electromechanical, or piezoelectric (piezo for short).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.demand-factor","kind":"concept","label":"Demand factor","sources":[{"id":"wikipedia.article.demand-factor","title":"English Wikipedia article: Demand factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Demand+factor"}],"status":"reported","summary":"English Wikipedia (article \"Demand factor\", CC BY-SA 4.0) states: In telecommunications, electronics and the electrical power industry, the term demand factor is used to refer to the fractional amount of some quantity being used relative to the maximum amount that could be used by the same system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anthrobotics","kind":"concept","label":"Anthrobotics","sources":[{"id":"wikipedia.article.anthrobotics","title":"English Wikipedia article: Anthrobotics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anthrobotics"}],"status":"reported","summary":"English Wikipedia (article \"Anthrobotics\", CC BY-SA 4.0) states: Anthrobotics is the science of developing and studying robots that are either entirely or in some way human-like.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dn-factor","kind":"concept","label":"DN factor","sources":[{"id":"wikipedia.article.dn-factor","title":"English Wikipedia article: DN factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=DN+factor"}],"status":"reported","summary":"English Wikipedia (article \"DN factor\", CC BY-SA 4.0) states: DN factor, also called DN Value, is a number that is used to determine the correct base oil viscosity for the lubrication of various types of bearings.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.embedded-instrumentation","kind":"concept","label":"Embedded instrumentation","sources":[{"id":"wikipedia.article.embedded-instrumentation","title":"English Wikipedia article: Embedded instrumentation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Embedded+instrumentation"}],"status":"reported","summary":"English Wikipedia (article \"Embedded instrumentation\", CC BY-SA 4.0) states: In the electronics industry, embedded instrumentation refers to the integration of test and measurement instrumentation into semiconductor chips (or integrated circuit devices).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.blast-valve","kind":"concept","label":"Blast valve","sources":[{"id":"wikipedia.article.blast-valve","title":"English Wikipedia article: Blast valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blast+valve"}],"status":"reported","summary":"English Wikipedia (article \"Blast valve\", CC BY-SA 4.0) states: A blast valve is used to protect a shelter, such as a fallout shelter or bunker, from the effects of sudden outside air pressure changes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cycloidal-drive","kind":"concept","label":"Cycloidal drive","sources":[{"id":"wikipedia.article.cycloidal-drive","title":"English Wikipedia article: Cycloidal drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cycloidal+drive"}],"status":"reported","summary":"English Wikipedia (article \"Cycloidal drive\", CC BY-SA 4.0) states: A cycloidal drive or cycloidal speed reducer is a mechanism for reducing the speed of an input shaft by a certain ratio.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bolt-snap","kind":"concept","label":"Bolt snap","sources":[{"id":"wikipedia.article.bolt-snap","title":"English Wikipedia article: Bolt snap","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bolt+snap"}],"status":"reported","summary":"English Wikipedia (article \"Bolt snap\", CC BY-SA 4.0) states: A bolt snap is a type of snap hook with a manually operated bolt action slide gate of medium security used to clip a light load to a ring, eye, loop or bight to temporarily secure or suspend an object.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-signal","kind":"concept","label":"Analytic signal","sources":[{"id":"wikipedia.article.analytic-signal","title":"English Wikipedia article: Analytic signal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+signal"}],"status":"reported","summary":"English Wikipedia (article \"Analytic signal\", CC BY-SA 4.0) states: In mathematics and signal processing, an analytic signal is a complex-valued function that has no negative frequency components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.alpha-factor","kind":"concept","label":"Alpha factor","sources":[{"id":"wikipedia.article.alpha-factor","title":"English Wikipedia article: Alpha factor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alpha+factor"}],"status":"reported","summary":"English Wikipedia (article \"Alpha factor\", CC BY-SA 4.0) states: The α-factor is a dimensionless quantity used to predict the solid–liquid interface type of a material during solidification.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.chaos-engineering","kind":"field","label":"Chaos engineering","sources":[{"id":"wikipedia.article.chaos-engineering","title":"English Wikipedia article: Chaos engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chaos+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Chaos engineering\", CC BY-SA 4.0) states: Chaos engineering is the discipline of experimenting on a system in order to build confidence in the system's capability to withstand turbulent conditions in production.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.aviation-engineering","kind":"field","label":"Aviation engineering","sources":[{"id":"wikipedia.article.aviation-engineering","title":"English Wikipedia article: Aviation engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aviation+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Aviation engineering\", CC BY-SA 4.0) states: Aviation engineering is a branch of engineering that deals with airspace development, airport design, aircraft navigation technologies, and aerodrome planning.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autofrettage","kind":"concept","label":"Autofrettage","sources":[{"id":"wikipedia.article.autofrettage","title":"English Wikipedia article: Autofrettage","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autofrettage"}],"status":"reported","summary":"English Wikipedia (article \"Autofrettage\", CC BY-SA 4.0) states: Autofrettage is a work-hardening process in which a thick-walled pressure vessel is subjected to enormous pressure, causing internal portions of the part to yield plastically, resulting in internal compressive residual stresses once the pressure is released.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-circuit","kind":"concept","label":"Autonomous circuit","sources":[{"id":"wikipedia.article.autonomous-circuit","title":"English Wikipedia article: Autonomous circuit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+circuit"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous circuit\", CC BY-SA 4.0) states: An autonomous circuit in analogue electronics is a circuit that produces a time-varying output without having a time-varying input (i.e., it has only DC power as an input).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.braced-frame","kind":"concept","label":"Braced frame","sources":[{"id":"wikipedia.article.braced-frame","title":"English Wikipedia article: Braced frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braced+frame"}],"status":"reported","summary":"English Wikipedia (article \"Braced frame\", CC BY-SA 4.0) states: In structural engineering, a braced frame is a structural system designed to resist wind and earthquake forces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.elastomeric-bridge-bearing","kind":"concept","label":"Elastomeric bridge bearing","sources":[{"id":"wikipedia.article.elastomeric-bridge-bearing","title":"English Wikipedia article: Elastomeric bridge bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elastomeric+bridge+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Elastomeric bridge bearing\", CC BY-SA 4.0) states: An elastomeric bridge bearing, also known as a pot bearing or elastomeric bearing, is a commonly used form of bridge bearing composed of elastomeric bridge bearing materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bolometer","kind":"concept","label":"Bolometer","sources":[{"id":"wikipedia.article.bolometer","title":"English Wikipedia article: Bolometer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bolometer"}],"status":"reported","summary":"English Wikipedia (article \"Bolometer\", CC BY-SA 4.0) states: A bolometer is a device for measuring radiant heat by means of a material having a temperature-dependent electrical resistance.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aeroelasticity","kind":"concept","label":"Aeroelasticity","sources":[{"id":"wikipedia.article.aeroelasticity","title":"English Wikipedia article: Aeroelasticity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aeroelasticity"}],"status":"reported","summary":"English Wikipedia (article \"Aeroelasticity\", CC BY-SA 4.0) states: Aeroelasticity is the branch of physics and engineering studying the interactions between the inertial, elastic, and aerodynamic forces occurring while an elastic body is exposed to a fluid flow.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.behavior-tree","kind":"concept","label":"Behavior tree","sources":[{"id":"wikipedia.article.behavior-tree","title":"English Wikipedia article: Behavior tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behavior+tree"}],"status":"reported","summary":"English Wikipedia (article \"Behavior tree\", CC BY-SA 4.0) states: A behavior tree is a structured visual modeling technique used in systems engineering and software engineering to represent system behavior.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.avulsion-river","kind":"concept","label":"Avulsion (river)","sources":[{"id":"wikipedia.article.avulsion-river","title":"English Wikipedia article: Avulsion (river)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Avulsion+%28river%29"}],"status":"reported","summary":"English Wikipedia (article \"Avulsion (river)\", CC BY-SA 4.0) states: In sedimentary geology and fluvial geomorphology, avulsion is the process by which flow is diverted out of an established river channel and into a new course via a bifurcation, or splitting of the channel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.compliant-mechanism","kind":"concept","label":"Compliant mechanism","sources":[{"id":"wikipedia.article.compliant-mechanism","title":"English Wikipedia article: Compliant mechanism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compliant+mechanism"}],"status":"reported","summary":"English Wikipedia (article \"Compliant mechanism\", CC BY-SA 4.0) states: In mechanical engineering, a compliant mechanism is a flexible mechanism that achieves force and motion transmission through elastic body deformation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capacitor","kind":"concept","label":"Capacitor","sources":[{"id":"wikipedia.article.capacitor","title":"English Wikipedia article: Capacitor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capacitor"}],"status":"reported","summary":"English Wikipedia (article \"Capacitor\", CC BY-SA 4.0) states: A capacitor is a device that stores electrical energy by accumulating electric charges on two closely spaced surfaces that are insulated from each other.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-power-quality","kind":"concept","label":"Electric power quality","sources":[{"id":"wikipedia.article.electric-power-quality","title":"English Wikipedia article: Electric power quality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+power+quality"}],"status":"reported","summary":"English Wikipedia (article \"Electric power quality\", CC BY-SA 4.0) states: Electric power quality is the degree to which the voltage, frequency, and waveform of a power supply system conform to established specifications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.butt-welding","kind":"concept","label":"Butt welding","sources":[{"id":"wikipedia.article.butt-welding","title":"English Wikipedia article: Butt welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butt+welding"}],"status":"reported","summary":"English Wikipedia (article \"Butt welding\", CC BY-SA 4.0) states: Butt welding is when two pieces of metal are placed end-to-end without overlap and then welded along the joint (as opposed to lap joint weld, where one piece of metal is laid on top of the other, or plug welding, where one piece of metal is inserted into the other).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.counterbore","kind":"concept","label":"Counterbore","sources":[{"id":"wikipedia.article.counterbore","title":"English Wikipedia article: Counterbore","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Counterbore"}],"status":"reported","summary":"English Wikipedia (article \"Counterbore\", CC BY-SA 4.0) states: In machining, a counterbore (symbol: ⌴) is a cylindrical flat-bottomed hole that enlarges another coaxial hole, or the tool used to create that feature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dry-lubricant","kind":"concept","label":"Dry lubricant","sources":[{"id":"wikipedia.article.dry-lubricant","title":"English Wikipedia article: Dry lubricant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dry+lubricant"}],"status":"reported","summary":"English Wikipedia (article \"Dry lubricant\", CC BY-SA 4.0) states: Dry lubricants or solid lubricants are materials that, despite being in the solid phase, are able to reduce friction between two surfaces sliding against each other without the need for a liquid oil medium.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.braking-chopper","kind":"concept","label":"Braking chopper","sources":[{"id":"wikipedia.article.braking-chopper","title":"English Wikipedia article: Braking chopper","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Braking+chopper"}],"status":"reported","summary":"English Wikipedia (article \"Braking chopper\", CC BY-SA 4.0) states: Braking choppers, sometimes also referred to as Braking units, are used in the DC voltage intermediate circuits of frequency converters to control voltage when the load feeds energy back to the intermediate circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.artificio-de-juanelo","kind":"concept","label":"Artificio de Juanelo","sources":[{"id":"wikipedia.article.artificio-de-juanelo","title":"English Wikipedia article: Artificio de Juanelo","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artificio+de+Juanelo"}],"status":"reported","summary":"English Wikipedia (article \"Artificio de Juanelo\", CC BY-SA 4.0) states: The Artificio de Juanelo (\"Gianello's artifice\") was the name of two devices built in Toledo in the 16th century by Juanelo Turriano.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.butterfly-valve","kind":"concept","label":"Butterfly valve","sources":[{"id":"wikipedia.article.butterfly-valve","title":"English Wikipedia article: Butterfly valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Butterfly+valve"}],"status":"reported","summary":"English Wikipedia (article \"Butterfly valve\", CC BY-SA 4.0) states: A butterfly valve is a valve that isolates or regulates the flow of a fluid.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barn-raising","kind":"concept","label":"Barn raising","sources":[{"id":"wikipedia.article.barn-raising","title":"English Wikipedia article: Barn raising","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barn+raising"}],"status":"reported","summary":"English Wikipedia (article \"Barn raising\", CC BY-SA 4.0) states: A barn raising, raising bee, or rearing is an action in which a barn for a resident of a community is built or rebuilt collectively by its members.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flat-chain","kind":"concept","label":"Flat chain","sources":[{"id":"wikipedia.article.flat-chain","title":"English Wikipedia article: Flat chain","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flat+chain"}],"status":"reported","summary":"English Wikipedia (article \"Flat chain\", CC BY-SA 4.0) states: Flat chain is a form of chain used chiefly in agricultural machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.all-in-rate","kind":"concept","label":"All-in rate","sources":[{"id":"wikipedia.article.all-in-rate","title":"English Wikipedia article: All-in rate","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=All-in+rate"}],"status":"reported","summary":"English Wikipedia (article \"All-in rate\", CC BY-SA 4.0) states: All-in rate is a term used in both the construction industry and the financial sector.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.angle-of-arrival","kind":"concept","label":"Angle of arrival","sources":[{"id":"wikipedia.article.angle-of-arrival","title":"English Wikipedia article: Angle of arrival","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angle+of+arrival"}],"status":"reported","summary":"English Wikipedia (article \"Angle of arrival\", CC BY-SA 4.0) states: The angle of arrival (AoA) of a signal is the direction from which the signal (e.g. radio, optical or acoustic) is received.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.analytical-chemistry","kind":"concept","label":"Analytical chemistry","sources":[{"id":"wikipedia.article.analytical-chemistry","title":"English Wikipedia article: Analytical chemistry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytical+chemistry"}],"status":"reported","summary":"English Wikipedia (article \"Analytical chemistry\", CC BY-SA 4.0) states: Analytical chemistry (or chemical analysis) is the branch of chemistry concerned with the development and application of methods to identify the chemical composition of materials and quantify the amounts of components in mixtures.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cluster-aware-application","kind":"concept","label":"Cluster-aware application","sources":[{"id":"wikipedia.article.cluster-aware-application","title":"English Wikipedia article: Cluster-aware application","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cluster-aware+application"}],"status":"reported","summary":"English Wikipedia (article \"Cluster-aware application\", CC BY-SA 4.0) states: A cluster-aware application is a software application designed to call cluster APIs in order to determine its running state, in case a manual failover is triggered between cluster nodes for planned technical maintenance, or an automatic failover is required, if a computing cluster node encounters hardware or software failure, to maintain business continuity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-bearing","kind":"concept","label":"Ball (bearing)","sources":[{"id":"wikipedia.article.ball-bearing","title":"English Wikipedia article: Ball (bearing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+%28bearing%29"}],"status":"reported","summary":"English Wikipedia (article \"Ball (bearing)\", CC BY-SA 4.0) states: Bearing balls are special highly spherical and smooth balls, most commonly used in ball bearings, but also used as components in things like freewheel mechanisms.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baker-clamp","kind":"concept","label":"Baker clamp","sources":[{"id":"wikipedia.article.baker-clamp","title":"English Wikipedia article: Baker clamp","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baker+clamp"}],"status":"reported","summary":"English Wikipedia (article \"Baker clamp\", CC BY-SA 4.0) states: Baker clamp is a generic name for a class of electronic circuits that reduce the storage time of a switching bipolar junction transistor (BJT) by applying a nonlinear negative feedback through various kinds of diodes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bressummer","kind":"concept","label":"Bressummer","sources":[{"id":"wikipedia.article.bressummer","title":"English Wikipedia article: Bressummer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bressummer"}],"status":"reported","summary":"English Wikipedia (article \"Bressummer\", CC BY-SA 4.0) states: A bressummer, breastsummer, summer beam (somier, sommier, sommer, somer, cross-somer, summer, summier, summer-tree, or dorman, dormant tree) is a load-bearing beam in a timber-framed building.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flexure-bearing","kind":"concept","label":"Flexure bearing","sources":[{"id":"wikipedia.article.flexure-bearing","title":"English Wikipedia article: Flexure bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flexure+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Flexure bearing\", CC BY-SA 4.0) states: A flexure bearing is a category of flexure which is engineered to be compliant in one or more angular degrees of freedom.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.radial-turbine","kind":"concept","label":"Radial turbine","sources":[{"id":"wikipedia.article.radial-turbine","title":"English Wikipedia article: Radial turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Radial+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Radial turbine\", CC BY-SA 4.0) states: A radial turbine is a turbine in which the flow of the working fluid is radial to the shaft.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.comb-drive","kind":"concept","label":"Comb drive","sources":[{"id":"wikipedia.article.comb-drive","title":"English Wikipedia article: Comb drive","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Comb+drive"}],"status":"reported","summary":"English Wikipedia (article \"Comb drive\", CC BY-SA 4.0) states: Comb-drives are microelectromechanical actuators, often used as linear actuators, which utilize electrostatic forces that act between two electrically conductive combs.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bubble-sensor","kind":"concept","label":"Bubble sensor","sources":[{"id":"wikipedia.article.bubble-sensor","title":"English Wikipedia article: Bubble sensor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bubble+sensor"}],"status":"reported","summary":"English Wikipedia (article \"Bubble sensor\", CC BY-SA 4.0) states: Bubble sensors are used to detect the presence of bubbles in fluid-filled tubes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.backlash-engineering","kind":"concept","label":"Backlash (engineering)","sources":[{"id":"wikipedia.article.backlash-engineering","title":"English Wikipedia article: Backlash (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Backlash+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Backlash (engineering)\", CC BY-SA 4.0) states: In mechanical engineering, backlash, sometimes called lash, play, or slop, is a clearance or lost motion in a mechanism caused by gaps between the parts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beam-bridge","kind":"concept","label":"Beam bridge","sources":[{"id":"wikipedia.article.beam-bridge","title":"English Wikipedia article: Beam bridge","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beam+bridge"}],"status":"reported","summary":"English Wikipedia (article \"Beam bridge\", CC BY-SA 4.0) states: Beam bridges are the simplest structural forms for bridge spans supported by an abutment or pier at each end.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.body-on-frame","kind":"concept","label":"Body-on-frame","sources":[{"id":"wikipedia.article.body-on-frame","title":"English Wikipedia article: Body-on-frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Body-on-frame"}],"status":"reported","summary":"English Wikipedia (article \"Body-on-frame\", CC BY-SA 4.0) states: Body-on-frame, also known as full-frame, is a traditional motor vehicle construction method whereby a separate body or coach is mounted on a strong and relatively rigid vehicle frame or chassis that carries the powertrain (the engine and drivetrain) and to which the wheels and their suspension, brakes, and steering are mounted.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.biological-systems-engineering","kind":"field","label":"Biological systems engineering","sources":[{"id":"wikipedia.article.biological-systems-engineering","title":"English Wikipedia article: Biological systems engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biological+systems+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Biological systems engineering\", CC BY-SA 4.0) states: Biological systems engineering or biosystems engineering is a broad-based engineering discipline with particular emphasis on non-medical biology.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.balancing-lake","kind":"concept","label":"Balancing lake","sources":[{"id":"wikipedia.article.balancing-lake","title":"English Wikipedia article: Balancing lake","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Balancing+lake"}],"status":"reported","summary":"English Wikipedia (article \"Balancing lake\", CC BY-SA 4.0) states: A balancing lake (also flood basin) is a term used in the UK to describe a retention basin used to control flooding by temporarily storing flood waters.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.corexy","kind":"concept","label":"CoreXY","sources":[{"id":"wikipedia.article.corexy","title":"English Wikipedia article: CoreXY","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=CoreXY"}],"status":"reported","summary":"English Wikipedia (article \"CoreXY\", CC BY-SA 4.0) states: CoreXY is a kinematic motion system, popularized by its use to move the printhead of a 3D printer, or the toolhead in CNC machines, in the horizontal plane.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.digifold","kind":"concept","label":"Digifold","sources":[{"id":"wikipedia.article.digifold","title":"English Wikipedia article: Digifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Digifold"}],"status":"reported","summary":"English Wikipedia (article \"Digifold\", CC BY-SA 4.0) states: Digifold is a new generation of four and six corner folding device for box gluers and associated machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.carnot-heat-engine","kind":"concept","label":"Carnot heat engine","sources":[{"id":"wikipedia.article.carnot-heat-engine","title":"English Wikipedia article: Carnot heat engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carnot+heat+engine"}],"status":"reported","summary":"English Wikipedia (article \"Carnot heat engine\", CC BY-SA 4.0) states: A Carnot heat engine (English: kar-NOH, French: [kaʁno]) is a theoretical heat engine that operates on the Carnot cycle.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.commutator-electric","kind":"concept","label":"Commutator (electric)","sources":[{"id":"wikipedia.article.commutator-electric","title":"English Wikipedia article: Commutator (electric)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commutator+%28electric%29"}],"status":"reported","summary":"English Wikipedia (article \"Commutator (electric)\", CC BY-SA 4.0) states: A commutator is a rotary electrical switch in certain types of electric motors and electrical generators that periodically reverses the current direction between the rotor and the external circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electric-power-system","kind":"concept","label":"Electric power system","sources":[{"id":"wikipedia.article.electric-power-system","title":"English Wikipedia article: Electric power system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electric+power+system"}],"status":"reported","summary":"English Wikipedia (article \"Electric power system\", CC BY-SA 4.0) states: An electric power system is a network of electrical components deployed to supply, transfer, and use electric power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bergeron-diagram","kind":"concept","label":"Bergeron diagram","sources":[{"id":"wikipedia.article.bergeron-diagram","title":"English Wikipedia article: Bergeron diagram","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bergeron+diagram"}],"status":"reported","summary":"English Wikipedia (article \"Bergeron diagram\", CC BY-SA 4.0) states: The Bergeron diagram method is a method to evaluate the effect of a reflection on an electrical signal.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.field-programmable-gate-array","kind":"concept","label":"Field-programmable gate array","sources":[{"id":"wikipedia.article.field-programmable-gate-array","title":"English Wikipedia article: Field-programmable gate array","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Field-programmable+gate+array"}],"status":"reported","summary":"English Wikipedia (article \"Field-programmable gate array\", CC BY-SA 4.0) states: A field-programmable gate array (FPGA) is a type of configurable integrated circuit that can be repeatedly programmed after manufacturing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brush-electric","kind":"concept","label":"Brush (electric)","sources":[{"id":"wikipedia.article.brush-electric","title":"English Wikipedia article: Brush (electric)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brush+%28electric%29"}],"status":"reported","summary":"English Wikipedia (article \"Brush (electric)\", CC BY-SA 4.0) states: A brush or carbon brush is an electrical contact, often made from specially prepared carbon, which conducts current between stationary and rotating parts (the latter most commonly being a rotating shaft) of an electrical machine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-flow-pump","kind":"concept","label":"Axial-flow pump","sources":[{"id":"wikipedia.article.axial-flow-pump","title":"English Wikipedia article: Axial-flow pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial-flow+pump"}],"status":"reported","summary":"English Wikipedia (article \"Axial-flow pump\", CC BY-SA 4.0) states: An axial-flow pump, or AFP, is a common type of pump that essentially consists of a propeller (an axial impeller) in a pipe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cask-breather","kind":"concept","label":"Cask breather","sources":[{"id":"wikipedia.article.cask-breather","title":"English Wikipedia article: Cask breather","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cask+breather"}],"status":"reported","summary":"English Wikipedia (article \"Cask breather\", CC BY-SA 4.0) states: A cask breather (sometimes called a cask aspirator) is a type of demand valve used to serve draught beer.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.epicyclic-gearing","kind":"concept","label":"Epicyclic gearing","sources":[{"id":"wikipedia.article.epicyclic-gearing","title":"English Wikipedia article: Epicyclic gearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epicyclic+gearing"}],"status":"reported","summary":"English Wikipedia (article \"Epicyclic gearing\", CC BY-SA 4.0) states: An epicyclic gear train (also known as a planetary gearset) is a gear reduction assembly consisting of two gears mounted so that the center of one gear (the \"planet\") revolves around the center of the other (the \"sun\").","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brass-fastener","kind":"concept","label":"Brass fastener","sources":[{"id":"wikipedia.article.brass-fastener","title":"English Wikipedia article: Brass fastener","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brass+fastener"}],"status":"reported","summary":"English Wikipedia (article \"Brass fastener\", CC BY-SA 4.0) states: A brass fastener, butterfly clips, brad, paper fastener or split pin is a stationery item used for securing multiple sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flexible-shaft","kind":"concept","label":"Flexible shaft","sources":[{"id":"wikipedia.article.flexible-shaft","title":"English Wikipedia article: Flexible shaft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flexible+shaft"}],"status":"reported","summary":"English Wikipedia (article \"Flexible shaft\", CC BY-SA 4.0) states: A flexible shaft, often referred to as a flex shaft, is a device for transmitting rotary motion between two objects which are not fixed relative to one another.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.apodization","kind":"concept","label":"Apodization","sources":[{"id":"wikipedia.article.apodization","title":"English Wikipedia article: Apodization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apodization"}],"status":"reported","summary":"English Wikipedia (article \"Apodization\", CC BY-SA 4.0) states: In signal processing, apodization (from Greek \"removing the foot\") is the modification of the shape of a mathematical function.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.data-center-tiers","kind":"concept","label":"Data center tiers","sources":[{"id":"wikipedia.article.data-center-tiers","title":"English Wikipedia article: Data center tiers","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Data+center+tiers"}],"status":"reported","summary":"English Wikipedia (article \"Data center tiers\", CC BY-SA 4.0) states: Data center tiers are defined levels of resiliency and redundancy for IT facility infrastructure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.bioresource-engineering","kind":"field","label":"Bioresource engineering","sources":[{"id":"wikipedia.article.bioresource-engineering","title":"English Wikipedia article: Bioresource engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bioresource+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Bioresource engineering\", CC BY-SA 4.0) states: Bioresource engineering is an engineering discipline of researching, developing, and utilizing bioproducts.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bandgap-voltage-reference","kind":"concept","label":"Bandgap voltage reference","sources":[{"id":"wikipedia.article.bandgap-voltage-reference","title":"English Wikipedia article: Bandgap voltage reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bandgap+voltage+reference"}],"status":"reported","summary":"English Wikipedia (article \"Bandgap voltage reference\", CC BY-SA 4.0) states: A bandgap voltage reference is a voltage reference circuit widely used in integrated circuits.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fluid-bearing","kind":"concept","label":"Fluid bearing","sources":[{"id":"wikipedia.article.fluid-bearing","title":"English Wikipedia article: Fluid bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fluid+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Fluid bearing\", CC BY-SA 4.0) states: Fluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.flue-gas-condensation","kind":"concept","label":"Flue-gas condensation","sources":[{"id":"wikipedia.article.flue-gas-condensation","title":"English Wikipedia article: Flue-gas condensation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Flue-gas+condensation"}],"status":"reported","summary":"English Wikipedia (article \"Flue-gas condensation\", CC BY-SA 4.0) states: Flue-gas condensation is the process by which flue gas is cooled to below its water dew point, with the heat released by the resulting condensation of water being recovered as low-temperature heat.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cameleon-protein","kind":"concept","label":"Cameleon (protein)","sources":[{"id":"wikipedia.article.cameleon-protein","title":"English Wikipedia article: Cameleon (protein)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cameleon+%28protein%29"}],"status":"reported","summary":"English Wikipedia (article \"Cameleon (protein)\", CC BY-SA 4.0) states: Cameleon is an engineered protein based on variant of green fluorescent protein used to visualize calcium levels in living cells.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ball-detent","kind":"concept","label":"Ball detent","sources":[{"id":"wikipedia.article.ball-detent","title":"English Wikipedia article: Ball detent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+detent"}],"status":"reported","summary":"English Wikipedia (article \"Ball detent\", CC BY-SA 4.0) states: A ball detent is a simple mechanical arrangement used to hold a moving part in a temporarily fixed position relative to another part.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bending-moment","kind":"concept","label":"Bending moment","sources":[{"id":"wikipedia.article.bending-moment","title":"English Wikipedia article: Bending moment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bending+moment"}],"status":"reported","summary":"English Wikipedia (article \"Bending moment\", CC BY-SA 4.0) states: In solid mechanics, a bending moment is an internal force couple within a structural element, caused by applied external forces causing bending.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-topology-electrical","kind":"concept","label":"Circuit topology (electrical)","sources":[{"id":"wikipedia.article.circuit-topology-electrical","title":"English Wikipedia article: Circuit topology (electrical)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+topology+%28electrical%29"}],"status":"reported","summary":"English Wikipedia (article \"Circuit topology (electrical)\", CC BY-SA 4.0) states: The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemical-reaction-engineering","kind":"concept","label":"Chemical reaction engineering","sources":[{"id":"wikipedia.article.chemical-reaction-engineering","title":"English Wikipedia article: Chemical reaction engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemical+reaction+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Chemical reaction engineering\", CC BY-SA 4.0) states: Chemical reaction engineering (reaction engineering or reactor engineering) is a specialty in chemical engineering or industrial chemistry dealing with chemical reactors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-architecture","kind":"concept","label":"Aerospace architecture","sources":[{"id":"wikipedia.article.aerospace-architecture","title":"English Wikipedia article: Aerospace architecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+architecture"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace architecture\", CC BY-SA 4.0) states: Aerospace architecture is broadly defined to encompass architectural design of non-habitable and habitable structures and living and working environments in aerospace-related facilities, habitats, and vehicles.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.design-manufacture-service","kind":"concept","label":"Design manufacture service","sources":[{"id":"wikipedia.article.design-manufacture-service","title":"English Wikipedia article: Design manufacture service","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+manufacture+service"}],"status":"reported","summary":"English Wikipedia (article \"Design manufacture service\", CC BY-SA 4.0) states: Design manufacture service (DMS) is a business model that combines contract product design with contract manufacturing as a service to other companies that have insufficient or do not possess the required resources.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.continuous-emissions-monitoring-system","kind":"concept","label":"Continuous emissions monitoring system","sources":[{"id":"wikipedia.article.continuous-emissions-monitoring-system","title":"English Wikipedia article: Continuous emissions monitoring system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Continuous+emissions+monitoring+system"}],"status":"reported","summary":"English Wikipedia (article \"Continuous emissions monitoring system\", CC BY-SA 4.0) states: Continuous emission monitoring systems (CEMS) are used as a tool to monitor the effluent gas streams resulting from combustion in industrial processes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.offshore-geotechnical-engineering","kind":"field","label":"Offshore geotechnical engineering","sources":[{"id":"wikipedia.article.offshore-geotechnical-engineering","title":"English Wikipedia article: Offshore geotechnical engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Offshore+geotechnical+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Offshore geotechnical engineering\", CC BY-SA 4.0) states: Offshore geotechnical engineering is a sub-field of geotechnical engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.coupling","kind":"concept","label":"Coupling","sources":[{"id":"wikipedia.article.coupling","title":"English Wikipedia article: Coupling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coupling"}],"status":"reported","summary":"English Wikipedia (article \"Coupling\", CC BY-SA 4.0) states: A coupling is a device used to connect two shafts together at their ends for the purpose of transmitting power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ceramic-engine","kind":"concept","label":"Ceramic engine","sources":[{"id":"wikipedia.article.ceramic-engine","title":"English Wikipedia article: Ceramic engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ceramic+engine"}],"status":"reported","summary":"English Wikipedia (article \"Ceramic engine\", CC BY-SA 4.0) states: A ceramic engine is an internal combustion engine made from specially engineered ceramic materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.conductive-ink","kind":"concept","label":"Conductive ink","sources":[{"id":"wikipedia.article.conductive-ink","title":"English Wikipedia article: Conductive ink","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Conductive+ink"}],"status":"reported","summary":"English Wikipedia (article \"Conductive ink\", CC BY-SA 4.0) states: Conductive ink is an ink that results in a printed object which conducts electricity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-aircraft","kind":"concept","label":"Autonomous aircraft","sources":[{"id":"wikipedia.article.autonomous-aircraft","title":"English Wikipedia article: Autonomous aircraft","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+aircraft"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous aircraft\", CC BY-SA 4.0) states: An autonomous aircraft is an aircraft which flies under the control of on-board autonomous robotic systems and needs no intervention from a human pilot or remote control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-tool-machining","kind":"concept","label":"Cutting tool (machining)","sources":[{"id":"wikipedia.article.cutting-tool-machining","title":"English Wikipedia article: Cutting tool (machining)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+tool+%28machining%29"}],"status":"reported","summary":"English Wikipedia (article \"Cutting tool (machining)\", CC BY-SA 4.0) states: In the context of machining, a cutting tool or cutter is typically a hardened metal tool that is used to cut, shape, and remove material from a workpiece by means of machining tools as well as abrasive tools by way of shear deformation.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.false-brinelling","kind":"concept","label":"False brinelling","sources":[{"id":"wikipedia.article.false-brinelling","title":"English Wikipedia article: False brinelling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=False+brinelling"}],"status":"reported","summary":"English Wikipedia (article \"False brinelling\", CC BY-SA 4.0) states: False brinelling is a type of bearing damage caused by fretting, with or without corrosion, that causes imprints that look similar to brinelling, but are caused by a different mechanism.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fin-field-effect-transistor","kind":"concept","label":"Fin field-effect transistor","sources":[{"id":"wikipedia.article.fin-field-effect-transistor","title":"English Wikipedia article: Fin field-effect transistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fin+field-effect+transistor"}],"status":"reported","summary":"English Wikipedia (article \"Fin field-effect transistor\", CC BY-SA 4.0) states: A fin field-effect transistor (FinFET) is a multigate device, a MOSFET (metal–oxide–semiconductor field-effect transistor) built on a substrate where the gate is placed on two, three, or four sides of the channel or wrapped around the channel (gate all around), forming a double or even multi gate structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brushed-dc-electric-motor","kind":"concept","label":"Brushed DC electric motor","sources":[{"id":"wikipedia.article.brushed-dc-electric-motor","title":"English Wikipedia article: Brushed DC electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brushed+DC+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Brushed DC electric motor\", CC BY-SA 4.0) states: A brushed DC electric motor is an internally commutated electric motor designed to be run from a direct current power source and utilizing an electric brush for contact.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.axial-piston-pump","kind":"concept","label":"Axial piston pump","sources":[{"id":"wikipedia.article.axial-piston-pump","title":"English Wikipedia article: Axial piston pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axial+piston+pump"}],"status":"reported","summary":"English Wikipedia (article \"Axial piston pump\", CC BY-SA 4.0) states: An axial piston pump is a positive displacement pump that has a number of pistons in a circular array within a cylinder block.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.check-valve","kind":"concept","label":"Check valve","sources":[{"id":"wikipedia.article.check-valve","title":"English Wikipedia article: Check valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Check+valve"}],"status":"reported","summary":"English Wikipedia (article \"Check valve\", CC BY-SA 4.0) states: A check valve, non-return valve, reflux valve, retention valve, foot valve, or one-way valve is a valve that normally allows fluid (liquid or gas) to flow through it in only one direction.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bread-clip","kind":"concept","label":"Bread clip","sources":[{"id":"wikipedia.article.bread-clip","title":"English Wikipedia article: Bread clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bread+clip"}],"status":"reported","summary":"English Wikipedia (article \"Bread clip\", CC BY-SA 4.0) states: A bread clip is a device that is used to hold plastic bags closed, such as those in which sliced bread is commonly packaged.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fluid-coupling","kind":"concept","label":"Fluid coupling","sources":[{"id":"wikipedia.article.fluid-coupling","title":"English Wikipedia article: Fluid coupling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fluid+coupling"}],"status":"reported","summary":"English Wikipedia (article \"Fluid coupling\", CC BY-SA 4.0) states: A fluid coupling or hydraulic coupling is a hydrodynamic or 'hydrokinetic' device used to transmit rotating mechanical power.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.annealing-materials-science","kind":"concept","label":"Annealing (materials science)","sources":[{"id":"wikipedia.article.annealing-materials-science","title":"English Wikipedia article: Annealing (materials science)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Annealing+%28materials+science%29"}],"status":"reported","summary":"English Wikipedia (article \"Annealing (materials science)\", CC BY-SA 4.0) states: In metallurgy and materials science, annealing is a heat treatment that alters the physical and sometimes chemical properties of a material to increase its ductility and reduce its hardness, making it more workable.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.baubotanik","kind":"concept","label":"Baubotanik","sources":[{"id":"wikipedia.article.baubotanik","title":"English Wikipedia article: Baubotanik","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baubotanik"}],"status":"reported","summary":"English Wikipedia (article \"Baubotanik\", CC BY-SA 4.0) states: Baubotanik is a building method in which architectural structures are created through the interaction of technical joints and plant growth.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.blowpipe-tool","kind":"concept","label":"Blowpipe (tool)","sources":[{"id":"wikipedia.article.blowpipe-tool","title":"English Wikipedia article: Blowpipe (tool)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blowpipe+%28tool%29"}],"status":"reported","summary":"English Wikipedia (article \"Blowpipe (tool)\", CC BY-SA 4.0) states: A blowpipe is one of several tools used to direct streams of gases into any of several working media.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.barkhausen-stability-criterion","kind":"concept","label":"Barkhausen stability criterion","sources":[{"id":"wikipedia.article.barkhausen-stability-criterion","title":"English Wikipedia article: Barkhausen stability criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barkhausen+stability+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Barkhausen stability criterion\", CC BY-SA 4.0) states: In electronics, the Barkhausen stability criterion is a mathematical condition to determine when a linear electronic circuit will oscillate.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.foil-bearing","kind":"concept","label":"Foil bearing","sources":[{"id":"wikipedia.article.foil-bearing","title":"English Wikipedia article: Foil bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Foil+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Foil bearing\", CC BY-SA 4.0) states: A foil bearing, also known as a foil-air bearing, is a type of air bearing.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.tesla-turbine","kind":"concept","label":"Tesla turbine","sources":[{"id":"wikipedia.article.tesla-turbine","title":"English Wikipedia article: Tesla turbine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tesla+turbine"}],"status":"reported","summary":"English Wikipedia (article \"Tesla turbine\", CC BY-SA 4.0) states: The Tesla turbine is a bladeless centripetal-flow turbine invented by Nikola Tesla in 1913.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemical-field-effect-transistor","kind":"concept","label":"Chemical field-effect transistor","sources":[{"id":"wikipedia.article.chemical-field-effect-transistor","title":"English Wikipedia article: Chemical field-effect transistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemical+field-effect+transistor"}],"status":"reported","summary":"English Wikipedia (article \"Chemical field-effect transistor\", CC BY-SA 4.0) states: A ChemFET is a chemically-sensitive field-effect transistor, that is a field-effect transistor used as a sensor for measuring chemical concentrations in solution.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-total-limitation","kind":"concept","label":"Circuit total limitation","sources":[{"id":"wikipedia.article.circuit-total-limitation","title":"English Wikipedia article: Circuit total limitation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+total+limitation"}],"status":"reported","summary":"English Wikipedia (article \"Circuit total limitation\", CC BY-SA 4.0) states: Circuit total limitation (CTL) is a legacy standard for electrical panels sold in the United States according to the National Electrical Code.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buckling-restrained-braced-frame","kind":"concept","label":"Buckling-restrained braced frame","sources":[{"id":"wikipedia.article.buckling-restrained-braced-frame","title":"English Wikipedia article: Buckling-restrained braced frame","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buckling-restrained+braced+frame"}],"status":"reported","summary":"English Wikipedia (article \"Buckling-restrained braced frame\", CC BY-SA 4.0) states: Buckling-restrained braced frame (BRBF) is a structural steel frame that provides lateral resistance to buckling, particularly during seismic activity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-bearing","kind":"concept","label":"Aerospace bearing","sources":[{"id":"wikipedia.article.aerospace-bearing","title":"English Wikipedia article: Aerospace bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace bearing\", CC BY-SA 4.0) states: Aerospace bearings are the bearings installed in aircraft and aerospace systems including commercial, private, military, or space applications.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.anticausal-system","kind":"concept","label":"Anticausal system","sources":[{"id":"wikipedia.article.anticausal-system","title":"English Wikipedia article: Anticausal system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anticausal+system"}],"status":"reported","summary":"English Wikipedia (article \"Anticausal system\", CC BY-SA 4.0) states: In systems theory, an anticausal system is a hypothetical system with outputs and internal states that depend solely on future input values.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.crayford-focuser","kind":"concept","label":"Crayford focuser","sources":[{"id":"wikipedia.article.crayford-focuser","title":"English Wikipedia article: Crayford focuser","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Crayford+focuser"}],"status":"reported","summary":"English Wikipedia (article \"Crayford focuser\", CC BY-SA 4.0) states: The Crayford focuser is a simplified focusing mechanism for amateur astronomical telescopes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.colloid-thruster","kind":"concept","label":"Colloid thruster","sources":[{"id":"wikipedia.article.colloid-thruster","title":"English Wikipedia article: Colloid thruster","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Colloid+thruster"}],"status":"reported","summary":"English Wikipedia (article \"Colloid thruster\", CC BY-SA 4.0) states: A colloid thruster (or electrospray thruster) is a type of low thrust electric propulsion rocket engine that uses electrostatic acceleration of charged liquid droplets for propulsion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.control-knob","kind":"concept","label":"Control knob","sources":[{"id":"wikipedia.article.control-knob","title":"English Wikipedia article: Control knob","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+knob"}],"status":"reported","summary":"English Wikipedia (article \"Control knob\", CC BY-SA 4.0) states: A control knob is a rotary device used to provide manual input adjustments to a mechanical/electrical system when grasped and turned by a human operator, so that differing extent of knob rotation corresponds to different desired input.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electrical-fault","kind":"concept","label":"Electrical fault","sources":[{"id":"wikipedia.article.electrical-fault","title":"English Wikipedia article: Electrical fault","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electrical+fault"}],"status":"reported","summary":"English Wikipedia (article \"Electrical fault\", CC BY-SA 4.0) states: In an electric power system, a fault is a defect that results in abnormality of electric current.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-logistics","kind":"concept","label":"Autonomous logistics","sources":[{"id":"wikipedia.article.autonomous-logistics","title":"English Wikipedia article: Autonomous logistics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+logistics"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous logistics\", CC BY-SA 4.0) states: Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.welder-certification","kind":"concept","label":"Welder certification","sources":[{"id":"wikipedia.article.welder-certification","title":"English Wikipedia article: Welder certification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Welder+certification"}],"status":"reported","summary":"English Wikipedia (article \"Welder certification\", CC BY-SA 4.0) states: Welder certification, also known as welder qualification, is a process which examines and documents a welder's capability to create welds of acceptable quality following a well defined welding procedure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-tool-material","kind":"concept","label":"Cutting tool material","sources":[{"id":"wikipedia.article.cutting-tool-material","title":"English Wikipedia article: Cutting tool material","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+tool+material"}],"status":"reported","summary":"English Wikipedia (article \"Cutting tool material\", CC BY-SA 4.0) states: Cutting tool materials are materials that are used to make cutting tools which are used in machining (drill bits, tool bits, milling cutters, etc.) but not other cutting tools like knives or punches.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.fretting","kind":"concept","label":"Fretting","sources":[{"id":"wikipedia.article.fretting","title":"English Wikipedia article: Fretting","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fretting"}],"status":"reported","summary":"English Wikipedia (article \"Fretting\", CC BY-SA 4.0) states: Fretting is wear and sometimes corrosion damage of loaded surfaces in contact while they encounter small oscillatory movements tangential to the surface.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gate-oxide","kind":"concept","label":"Gate oxide","sources":[{"id":"wikipedia.article.gate-oxide","title":"English Wikipedia article: Gate oxide","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gate+oxide"}],"status":"reported","summary":"English Wikipedia (article \"Gate oxide\", CC BY-SA 4.0) states: The gate oxide is the dielectric layer that separates the gate terminal of a MOSFET (metal–oxide–semiconductor field-effect transistor) from the underlying source and drain terminals as well as the conductive channel that connects source and drain when the transistor is turned on.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brushless-dc-electric-motor","kind":"concept","label":"Brushless DC electric motor","sources":[{"id":"wikipedia.article.brushless-dc-electric-motor","title":"English Wikipedia article: Brushless DC electric motor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brushless+DC+electric+motor"}],"status":"reported","summary":"English Wikipedia (article \"Brushless DC electric motor\", CC BY-SA 4.0) states: A brushless DC electric motor (BLDC), also known as an electronically commutated motor, is a synchronous motor using a direct current (DC) electric power supply.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beer-engine","kind":"concept","label":"Beer engine","sources":[{"id":"wikipedia.article.beer-engine","title":"English Wikipedia article: Beer engine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beer+engine"}],"status":"reported","summary":"English Wikipedia (article \"Beer engine\", CC BY-SA 4.0) states: A beer engine is a device for pumping beer from a cask, usually located in a pub's cellar.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.breech-lock","kind":"concept","label":"Breech-lock","sources":[{"id":"wikipedia.article.breech-lock","title":"English Wikipedia article: Breech-lock","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breech-lock"}],"status":"reported","summary":"English Wikipedia (article \"Breech-lock\", CC BY-SA 4.0) states: A breech-lock is a system for mounting camera lenses to camera bodies.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.high-tensile-chain","kind":"concept","label":"High-tensile chain","sources":[{"id":"wikipedia.article.high-tensile-chain","title":"English Wikipedia article: High-tensile chain","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=High-tensile+chain"}],"status":"reported","summary":"English Wikipedia (article \"High-tensile chain\", CC BY-SA 4.0) states: A high-tensile chain, also referred to as a transport chain, is a link chain with a high tensile strength used for drawing or securing loads.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.buttressed-core","kind":"concept","label":"Buttressed core","sources":[{"id":"wikipedia.article.buttressed-core","title":"English Wikipedia article: Buttressed core","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buttressed+core"}],"status":"reported","summary":"English Wikipedia (article \"Buttressed core\", CC BY-SA 4.0) states: A buttressed core is a structural system for high buildings, consisting of a hexagonal core reinforced by three buttresses that form a Y shape.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.hoist-device","kind":"concept","label":"Hoist (device)","sources":[{"id":"wikipedia.article.hoist-device","title":"English Wikipedia article: Hoist (device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hoist+%28device%29"}],"status":"reported","summary":"English Wikipedia (article \"Hoist (device)\", CC BY-SA 4.0) states: A hoist is a device used for lifting or lowering a load by means of a drum or lift-wheel around which rope or chain wraps.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.chemiresistor","kind":"concept","label":"Chemiresistor","sources":[{"id":"wikipedia.article.chemiresistor","title":"English Wikipedia article: Chemiresistor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemiresistor"}],"status":"reported","summary":"English Wikipedia (article \"Chemiresistor\", CC BY-SA 4.0) states: A chemiresistor is a material that changes its electrical resistance in response to changes in the nearby chemical environment.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bearing-pressure","kind":"concept","label":"Bearing pressure","sources":[{"id":"wikipedia.article.bearing-pressure","title":"English Wikipedia article: Bearing pressure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bearing+pressure"}],"status":"reported","summary":"English Wikipedia (article \"Bearing pressure\", CC BY-SA 4.0) states: Bearing pressure is a particular case of contact mechanics often occurring in cases where a convex surface (male cylinder or sphere) contacts a concave surface (female cylinder or sphere: bore or hemispherical cup).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.common-rail-electricity","kind":"concept","label":"Common rail (electricity)","sources":[{"id":"wikipedia.article.common-rail-electricity","title":"English Wikipedia article: Common rail (electricity)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Common+rail+%28electricity%29"}],"status":"reported","summary":"English Wikipedia (article \"Common rail (electricity)\", CC BY-SA 4.0) states: In electrical engineering, a common rail (shortened to COM) is a shared path between different electrical routes in an electrical circuit.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerospace-materials","kind":"concept","label":"Aerospace materials","sources":[{"id":"wikipedia.article.aerospace-materials","title":"English Wikipedia article: Aerospace materials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerospace+materials"}],"status":"reported","summary":"English Wikipedia (article \"Aerospace materials\", CC BY-SA 4.0) states: Aerospace materials are materials, frequently metal alloys, that have either been developed for, or have come to prominence through their use for aerospace purposes.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.circuit-extraction","kind":"concept","label":"Circuit extraction","sources":[{"id":"wikipedia.article.circuit-extraction","title":"English Wikipedia article: Circuit extraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Circuit+extraction"}],"status":"reported","summary":"English Wikipedia (article \"Circuit extraction\", CC BY-SA 4.0) states: The electric circuit extraction or simply circuit extraction, also netlist extraction, is the translation of an integrated circuit layout back into the electrical circuit (netlist) it is intended to represent.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.dashpot","kind":"concept","label":"Dashpot","sources":[{"id":"wikipedia.article.dashpot","title":"English Wikipedia article: Dashpot","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dashpot"}],"status":"reported","summary":"English Wikipedia (article \"Dashpot\", CC BY-SA 4.0) states: A dashpot, also known as a damper, is a mechanical device that resists motion via viscous damping.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.carrier-grade","kind":"concept","label":"Carrier grade","sources":[{"id":"wikipedia.article.carrier-grade","title":"English Wikipedia article: Carrier grade","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carrier+grade"}],"status":"reported","summary":"English Wikipedia (article \"Carrier grade\", CC BY-SA 4.0) states: In telecommunications, a \"carrier grade\" or \"carrier class\" refers to a system, or a hardware or software component that is extremely reliable, well tested and proven in its capabilities.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.friction","kind":"concept","label":"Friction","sources":[{"id":"wikipedia.article.friction","title":"English Wikipedia article: Friction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Friction"}],"status":"reported","summary":"English Wikipedia (article \"Friction\", CC BY-SA 4.0) states: Friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding or grinding against each other.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.clutch-delay-valve","kind":"concept","label":"Clutch delay valve","sources":[{"id":"wikipedia.article.clutch-delay-valve","title":"English Wikipedia article: Clutch delay valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Clutch+delay+valve"}],"status":"reported","summary":"English Wikipedia (article \"Clutch delay valve\", CC BY-SA 4.0) states: A clutch delay valve is an automotive component added to the clutch system of an automobile to control clutch engagement speed.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear-oil","kind":"concept","label":"Gear oil","sources":[{"id":"wikipedia.article.gear-oil","title":"English Wikipedia article: Gear oil","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear+oil"}],"status":"reported","summary":"English Wikipedia (article \"Gear oil\", CC BY-SA 4.0) states: Gear oil is a lubricant made specifically for transmissions, transfer cases, and differentials in automobiles, trucks, and other machinery.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.architectural-acoustics","kind":"field","label":"Architectural acoustics","sources":[{"id":"wikipedia.article.architectural-acoustics","title":"English Wikipedia article: Architectural acoustics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+acoustics"}],"status":"reported","summary":"English Wikipedia (article \"Architectural acoustics\", CC BY-SA 4.0) states: Architectural acoustics (also known as building acoustics) is the science and engineering of achieving a good sound within a building and is a branch of acoustical engineering.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.audio-signal-processing","kind":"concept","label":"Audio signal processing","sources":[{"id":"wikipedia.article.audio-signal-processing","title":"English Wikipedia article: Audio signal processing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Audio+signal+processing"}],"status":"reported","summary":"English Wikipedia (article \"Audio signal processing\", CC BY-SA 4.0) states: Audio signal processing is a subfield of signal processing that is concerned with the electronic manipulation of audio signals.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.computer-engineering","kind":"field","label":"Computer engineering","sources":[{"id":"wikipedia.article.computer-engineering","title":"English Wikipedia article: Computer engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer engineering\", CC BY-SA 4.0) states: Computer engineering (CE, CoE, CpE, or CompE) is a branch of engineering specialized in developing computer hardware and software.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.best-management-practice-for-water-pollution","kind":"concept","label":"Best management practice for water pollution","sources":[{"id":"wikipedia.article.best-management-practice-for-water-pollution","title":"English Wikipedia article: Best management practice for water pollution","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Best+management+practice+for+water+pollution"}],"status":"reported","summary":"English Wikipedia (article \"Best management practice for water pollution\", CC BY-SA 4.0) states: Best management practices (BMPs) is a term used in the United States and Canada to describe a type of water pollution control.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.betavoltaic-device","kind":"concept","label":"Betavoltaic device","sources":[{"id":"wikipedia.article.betavoltaic-device","title":"English Wikipedia article: Betavoltaic device","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Betavoltaic+device"}],"status":"reported","summary":"English Wikipedia (article \"Betavoltaic device\", CC BY-SA 4.0) states: A betavoltaic device (betavoltaic cell or betavoltaic battery) is a type of nuclear battery that generates electric current from beta particles (electrons or positrons) emitted from a radioactive source, using semiconductor junctions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brokaw-bandgap-reference","kind":"concept","label":"Brokaw bandgap reference","sources":[{"id":"wikipedia.article.brokaw-bandgap-reference","title":"English Wikipedia article: Brokaw bandgap reference","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brokaw+bandgap+reference"}],"status":"reported","summary":"English Wikipedia (article \"Brokaw bandgap reference\", CC BY-SA 4.0) states: The Brokaw bandgap reference is a voltage reference circuit widely used in integrated circuits, with an output voltage around 1.25 V that exhibits low temperature dependence.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cantilever","kind":"concept","label":"Cantilever","sources":[{"id":"wikipedia.article.cantilever","title":"English Wikipedia article: Cantilever","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantilever"}],"status":"reported","summary":"English Wikipedia (article \"Cantilever\", CC BY-SA 4.0) states: A cantilever is a structural element that is firmly attached to a fixed structure at one end and is unsupported at the other end.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heat-sink","kind":"concept","label":"Heat sink","sources":[{"id":"wikipedia.article.heat-sink","title":"English Wikipedia article: Heat sink","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heat+sink"}],"status":"reported","summary":"English Wikipedia (article \"Heat sink\", CC BY-SA 4.0) states: A heat sink (also commonly spelled heatsink) is a passive heat exchanger that transfers the heat generated by an electronic or a mechanical device to a fluid medium, often air or a liquid coolant, where it is dissipated away from the device, thereby allowing regulation of the device's temperature.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.hydraulic-cylinder","kind":"concept","label":"Hydraulic cylinder","sources":[{"id":"wikipedia.article.hydraulic-cylinder","title":"English Wikipedia article: Hydraulic cylinder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hydraulic+cylinder"}],"status":"reported","summary":"English Wikipedia (article \"Hydraulic cylinder\", CC BY-SA 4.0) states: A hydraulic cylinder (also called a linear hydraulic motor, hydraulic actuator, or hydraulic ram) is a mechanical actuator that is used to convert fluid pressure into linear force and motion.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.chemotronics","kind":"field","label":"Chemotronics","sources":[{"id":"wikipedia.article.chemotronics","title":"English Wikipedia article: Chemotronics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chemotronics"}],"status":"reported","summary":"English Wikipedia (article \"Chemotronics\", CC BY-SA 4.0) states: Chemotronics is an intersection field of chemistry (especially electrochemistry) and electronics dealing with the design of electrochemical and optical chemical sensors.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bearing-surface","kind":"concept","label":"Bearing surface","sources":[{"id":"wikipedia.article.bearing-surface","title":"English Wikipedia article: Bearing surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bearing+surface"}],"status":"reported","summary":"English Wikipedia (article \"Bearing surface\", CC BY-SA 4.0) states: A bearing surface in mechanical engineering is the area of contact between two objects.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-bearing","kind":"concept","label":"Bridge bearing","sources":[{"id":"wikipedia.article.bridge-bearing","title":"English Wikipedia article: Bridge bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Bridge bearing\", CC BY-SA 4.0) states: In structural engineering, a bridge bearing is a component of a bridge which typically provides a resting surface between bridge piers and the bridge deck.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","kind":"concept","label":"Directed assembly of micro- and nano-structures","sources":[{"id":"wikipedia.article.directed-assembly-of-micro-and-nano-structures","title":"English Wikipedia article: Directed assembly of micro- and nano-structures","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Directed+assembly+of+micro-+and+nano-structures"}],"status":"reported","summary":"English Wikipedia (article \"Directed assembly of micro- and nano-structures\", CC BY-SA 4.0) states: Directed assembly of micro- and nano-structures are methods of mass-producing micro to nano devices and materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.electronic-color-code","kind":"concept","label":"Electronic color code","sources":[{"id":"wikipedia.article.electronic-color-code","title":"English Wikipedia article: Electronic color code","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Electronic+color+code"}],"status":"reported","summary":"English Wikipedia (article \"Electronic color code\", CC BY-SA 4.0) states: An electronic color code is a system which wordlessly identifies either the functions of cables and connections, or the types and variants of electronic components.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capella-engineering","kind":"concept","label":"Capella (engineering)","sources":[{"id":"wikipedia.article.capella-engineering","title":"English Wikipedia article: Capella (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capella+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Capella (engineering)\", CC BY-SA 4.0) states: Capella is an open-source solution for model-based systems engineering (MBSE).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.detent","kind":"concept","label":"Detent","sources":[{"id":"wikipedia.article.detent","title":"English Wikipedia article: Detent","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Detent"}],"status":"reported","summary":"English Wikipedia (article \"Detent\", CC BY-SA 4.0) states: A detent is a mechanical or magnetic means to resist or arrest the movement of a mechanical device.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","kind":"concept","label":"Elastic and inelastic collisions apparatus","sources":[{"id":"wikipedia.article.elastic-and-inelastic-collisions-apparatus","title":"English Wikipedia article: Elastic and inelastic collisions apparatus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elastic+and+inelastic+collisions+apparatus"}],"status":"reported","summary":"English Wikipedia (article \"Elastic and inelastic collisions apparatus\", CC BY-SA 4.0) states: The elastic and inelastic collisions apparatus is a large apparatus to study elastic and inelastic collisions.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.behavior-based-robotics","kind":"concept","label":"Behavior-based robotics","sources":[{"id":"wikipedia.article.behavior-based-robotics","title":"English Wikipedia article: Behavior-based robotics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behavior-based+robotics"}],"status":"reported","summary":"English Wikipedia (article \"Behavior-based robotics\", CC BY-SA 4.0) states: Behavior-based robotics (BBR) or behavioral robotics is an approach in robotics that focuses on robots that are able to exhibit complex-appearing behaviors despite little internal variable state to model its immediate environment, mostly gradually correcting its actions via sensory-motor links.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cold-metal-transfer","kind":"concept","label":"Cold metal transfer","sources":[{"id":"wikipedia.article.cold-metal-transfer","title":"English Wikipedia article: Cold metal transfer","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cold+metal+transfer"}],"status":"reported","summary":"English Wikipedia (article \"Cold metal transfer\", CC BY-SA 4.0) states: Cold metal transfer (CMT) is a welding method that is usually performed by a welding robot.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drill-bit-sizes","kind":"concept","label":"Drill bit sizes","sources":[{"id":"wikipedia.article.drill-bit-sizes","title":"English Wikipedia article: Drill bit sizes","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drill+bit+sizes"}],"status":"reported","summary":"English Wikipedia (article \"Drill bit sizes\", CC BY-SA 4.0) states: Drill bits are the cutting tools of drilling machines.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear","kind":"concept","label":"Gear","sources":[{"id":"wikipedia.article.gear","title":"English Wikipedia article: Gear","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear"}],"status":"reported","summary":"English Wikipedia (article \"Gear\", CC BY-SA 4.0) states: A gear or gearwheel, also called a toothed wheel, or cog is a rotating machine part typically used to transmit rotational motion or torque by means of a series of \"teeth\" that engage with compatible teeth of another gear or other part.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.ggnmos","kind":"concept","label":"GgNMOS","sources":[{"id":"wikipedia.article.ggnmos","title":"English Wikipedia article: GgNMOS","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=GgNMOS"}],"status":"reported","summary":"English Wikipedia (article \"GgNMOS\", CC BY-SA 4.0) states: Grounded-gate NMOS, commonly known as ggNMOS, is an electrostatic discharge (ESD) protection device used within CMOS integrated circuits (ICs).","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cogging-torque","kind":"concept","label":"Cogging torque","sources":[{"id":"wikipedia.article.cogging-torque","title":"English Wikipedia article: Cogging torque","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cogging+torque"}],"status":"reported","summary":"English Wikipedia (article \"Cogging torque\", CC BY-SA 4.0) states: In electromechanics, the cogging torque of electrical motors is the torque due to the interaction between the permanent magnets of the rotor and the stator slots of a permanent magnet machine.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bilge-pump","kind":"concept","label":"Bilge pump","sources":[{"id":"wikipedia.article.bilge-pump","title":"English Wikipedia article: Bilge pump","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bilge+pump"}],"status":"reported","summary":"English Wikipedia (article \"Bilge pump\", CC BY-SA 4.0) states: A bilge pump is a water pump used to remove bilge water.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.control-valve","kind":"concept","label":"Control valve","sources":[{"id":"wikipedia.article.control-valve","title":"English Wikipedia article: Control valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Control+valve"}],"status":"reported","summary":"English Wikipedia (article \"Control valve\", CC BY-SA 4.0) states: A control valve is a valve used to control fluid flow by varying the size of the flow passage as directed by a signal from a controller.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.brooch","kind":"concept","label":"Brooch","sources":[{"id":"wikipedia.article.brooch","title":"English Wikipedia article: Brooch","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brooch"}],"status":"reported","summary":"English Wikipedia (article \"Brooch\", CC BY-SA 4.0) states: A brooch (, also US: ) is a decorative jewellery item, or the insignia of a fraternal order, designed to be attached to garments, often to fasten them together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.big-stan-drill-rig","kind":"concept","label":"Big Stan (drill rig)","sources":[{"id":"wikipedia.article.big-stan-drill-rig","title":"English Wikipedia article: Big Stan (drill rig)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big+Stan+%28drill+rig%29"}],"status":"reported","summary":"English Wikipedia (article \"Big Stan (drill rig)\", CC BY-SA 4.0) states: Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.inverterization","kind":"concept","label":"Inverterization","sources":[{"id":"wikipedia.article.inverterization","title":"English Wikipedia article: Inverterization","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Inverterization"}],"status":"reported","summary":"English Wikipedia (article \"Inverterization\", CC BY-SA 4.0) states: Inverterization is the process of using an inverter-based motor drive intended to operate an electric motor at a variable speed for the sake of improved efficiency.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bauschinger-effect","kind":"concept","label":"Bauschinger effect","sources":[{"id":"wikipedia.article.bauschinger-effect","title":"English Wikipedia article: Bauschinger effect","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bauschinger+effect"}],"status":"reported","summary":"English Wikipedia (article \"Bauschinger effect\", CC BY-SA 4.0) states: The Bauschinger effect refers to a property of materials where the material's stress/strain characteristics change as a result of the microscopic stress distribution of the material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.computer-network-engineering","kind":"field","label":"Computer network engineering","sources":[{"id":"wikipedia.article.computer-network-engineering","title":"English Wikipedia article: Computer network engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer+network+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer network engineering\", CC BY-SA 4.0) states: Computer network engineering is a technology discipline within engineering that deals with the design, implementation, and management of computer networks.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.biofilter","kind":"concept","label":"Biofilter","sources":[{"id":"wikipedia.article.biofilter","title":"English Wikipedia article: Biofilter","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biofilter"}],"status":"reported","summary":"English Wikipedia (article \"Biofilter\", CC BY-SA 4.0) states: Biofiltration is a pollution control technique using a bioreactor containing living material to capture and biologically degrade pollutants.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.capacitor-discharge-sintering","kind":"concept","label":"Capacitor discharge sintering","sources":[{"id":"wikipedia.article.capacitor-discharge-sintering","title":"English Wikipedia article: Capacitor discharge sintering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Capacitor+discharge+sintering"}],"status":"reported","summary":"English Wikipedia (article \"Capacitor discharge sintering\", CC BY-SA 4.0) states: Capacitor discharge sintering (CDS) is an electric current assisted sintering (ECAS) technique.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bus-holder","kind":"concept","label":"Bus-holder","sources":[{"id":"wikipedia.article.bus-holder","title":"English Wikipedia article: Bus-holder","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bus-holder"}],"status":"reported","summary":"English Wikipedia (article \"Bus-holder\", CC BY-SA 4.0) states: A bus-holder or bus-keeper is a weak latch circuit that holds the last value on a tri-state bus.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.colonnette","kind":"concept","label":"Colonnette","sources":[{"id":"wikipedia.article.colonnette","title":"English Wikipedia article: Colonnette","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Colonnette"}],"status":"reported","summary":"English Wikipedia (article \"Colonnette\", CC BY-SA 4.0) states: A colonnette is a small slender column, usually decorative, which may support an arch, beam or lintel.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.heater-core","kind":"concept","label":"Heater core","sources":[{"id":"wikipedia.article.heater-core","title":"English Wikipedia article: Heater core","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Heater+core"}],"status":"reported","summary":"English Wikipedia (article \"Heater core\", CC BY-SA 4.0) states: A heater core is a heat exchanger mounted in the cabin of a vehicle designed to provide heat that uses the same operating principles and working fluid as an automotive radiator.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.turbine-trip","kind":"concept","label":"Turbine trip","sources":[{"id":"wikipedia.article.turbine-trip","title":"English Wikipedia article: Turbine trip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turbine+trip"}],"status":"reported","summary":"English Wikipedia (article \"Turbine trip\", CC BY-SA 4.0) states: A turbine trip is the automatic safety shutdown of a power-generation turbine due to unexpected events.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.linear-actuator","kind":"concept","label":"Linear actuator","sources":[{"id":"wikipedia.article.linear-actuator","title":"English Wikipedia article: Linear actuator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Linear+actuator"}],"status":"reported","summary":"English Wikipedia (article \"Linear actuator\", CC BY-SA 4.0) states: A linear actuator is an actuator that creates linear motion (i.e., in a straight line), in contrast to the circular motion of a conventional electric motor.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.copper-loss","kind":"concept","label":"Copper loss","sources":[{"id":"wikipedia.article.copper-loss","title":"English Wikipedia article: Copper loss","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Copper+loss"}],"status":"reported","summary":"English Wikipedia (article \"Copper loss\", CC BY-SA 4.0) states: Copper loss is the term often given to heat produced by electrical currents in the conductors of transformer windings, or other electrical devices.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.deal-grove-model","kind":"concept","label":"Deal–Grove model","sources":[{"id":"wikipedia.article.deal-grove-model","title":"English Wikipedia article: Deal–Grove model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Deal%E2%80%93Grove+model"}],"status":"reported","summary":"English Wikipedia (article \"Deal–Grove model\", CC BY-SA 4.0) states: The Deal–Grove model mathematically describes the growth of an oxide layer on the surface of a material.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.aerostructure","kind":"concept","label":"Aerostructure","sources":[{"id":"wikipedia.article.aerostructure","title":"English Wikipedia article: Aerostructure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aerostructure"}],"status":"reported","summary":"English Wikipedia (article \"Aerostructure\", CC BY-SA 4.0) states: An aerostructure is a component of an aircraft's airframe.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.downstream-manufacturing","kind":"concept","label":"Downstream (manufacturing)","sources":[{"id":"wikipedia.article.downstream-manufacturing","title":"English Wikipedia article: Downstream (manufacturing)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Downstream+%28manufacturing%29"}],"status":"reported","summary":"English Wikipedia (article \"Downstream (manufacturing)\", CC BY-SA 4.0) states: Downstream, in manufacturing, refers to processes which occur later on in a production sequence or production line.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.design-of-experiments","kind":"concept","label":"Design of experiments","sources":[{"id":"wikipedia.article.design-of-experiments","title":"English Wikipedia article: Design of experiments","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Design+of+experiments"}],"status":"reported","summary":"English Wikipedia (article \"Design of experiments\", CC BY-SA 4.0) states: The design of experiments (DOE), also known as experimental design, refers to the construction of procedures that attempt to explain how changes in one aspect of a system will lead to changes in other aspects of a system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.change-management-engineering","kind":"concept","label":"Change management (engineering)","sources":[{"id":"wikipedia.article.change-management-engineering","title":"English Wikipedia article: Change management (engineering)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Change+management+%28engineering%29"}],"status":"reported","summary":"English Wikipedia (article \"Change management (engineering)\", CC BY-SA 4.0) states: The change request management process in systems engineering is the process of requesting, determining attainability, planning, implementing, and evaluating of changes to a system.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-scour","kind":"concept","label":"Bridge scour","sources":[{"id":"wikipedia.article.bridge-scour","title":"English Wikipedia article: Bridge scour","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+scour"}],"status":"reported","summary":"English Wikipedia (article \"Bridge scour\", CC BY-SA 4.0) states: Bridge scour is the removal of sediment such as sand and gravel from around bridge abutments or piers.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.exercise-machine","kind":"concept","label":"Exercise machine","sources":[{"id":"wikipedia.article.exercise-machine","title":"English Wikipedia article: Exercise machine","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Exercise+machine"}],"status":"reported","summary":"English Wikipedia (article \"Exercise machine\", CC BY-SA 4.0) states: An exercise machine is any machine used for physical exercise.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cvcc","kind":"concept","label":"CVCC","sources":[{"id":"wikipedia.article.cvcc","title":"English Wikipedia article: CVCC","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=CVCC"}],"status":"reported","summary":"English Wikipedia (article \"CVCC\", CC BY-SA 4.0) states: CVCC, or Compound Vortex Controlled Combustion (Japanese: 複合渦流調整燃焼方式, Hepburn: Fukugō Uzuryū Chōsei Nenshō Hōshiki), is an internal combustion engine technology developed and trademarked by the Honda Motor Company.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bigdog","kind":"concept","label":"BigDog","sources":[{"id":"wikipedia.article.bigdog","title":"English Wikipedia article: BigDog","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=BigDog"}],"status":"reported","summary":"English Wikipedia (article \"BigDog\", CC BY-SA 4.0) states: BigDog is a dynamically stable quadruped military robot platform that was created in 2005 by Boston Dynamics with the Harvard University Concord Field Station.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cold-welding","kind":"concept","label":"Cold welding","sources":[{"id":"wikipedia.article.cold-welding","title":"English Wikipedia article: Cold welding","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cold+welding"}],"status":"reported","summary":"English Wikipedia (article \"Cold welding\", CC BY-SA 4.0) states: Cold welding or contact welding is a solid-state welding process in which joining takes place without fusion or heating at the interface of the two parts to be welded.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.drilling","kind":"concept","label":"Drilling","sources":[{"id":"wikipedia.article.drilling","title":"English Wikipedia article: Drilling","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Drilling"}],"status":"reported","summary":"English Wikipedia (article \"Drilling\", CC BY-SA 4.0) states: Drilling is a cutting process where a drill bit is spun to cut a hole of circular cross-section in solid materials.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.gear-failure","kind":"concept","label":"Gear failure","sources":[{"id":"wikipedia.article.gear-failure","title":"English Wikipedia article: Gear failure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gear+failure"}],"status":"reported","summary":"English Wikipedia (article \"Gear failure\", CC BY-SA 4.0) states: Sources of gear failure are varied, and are often based on the rotational speed and the load applied to the gear.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.coilgun","kind":"concept","label":"Coilgun","sources":[{"id":"wikipedia.article.coilgun","title":"English Wikipedia article: Coilgun","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Coilgun"}],"status":"reported","summary":"English Wikipedia (article \"Coilgun\", CC BY-SA 4.0) states: A coilgun is a type of mass driver consisting of one or more coils used as electromagnets in the configuration of a linear motor that accelerate a ferromagnetic or conducting projectile to high velocity.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.diaphragm-valve","kind":"concept","label":"Diaphragm valve","sources":[{"id":"wikipedia.article.diaphragm-valve","title":"English Wikipedia article: Diaphragm valve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Diaphragm+valve"}],"status":"reported","summary":"English Wikipedia (article \"Diaphragm valve\", CC BY-SA 4.0) states: A diaphragm valve, or membrane valve, consists of a valve body with two or more ports, a flexible diaphragm, and a weir, saddle, or seat upon which the diaphragm closes the valve.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.helix-angle","kind":"concept","label":"Helix angle","sources":[{"id":"wikipedia.article.helix-angle","title":"English Wikipedia article: Helix angle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Helix+angle"}],"status":"reported","summary":"English Wikipedia (article \"Helix angle\", CC BY-SA 4.0) states: In mechanical engineering, a helix angle is the angle between any helix and an axial line on its right, circular cylinder or cone.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bulldog-clip","kind":"concept","label":"Bulldog clip","sources":[{"id":"wikipedia.article.bulldog-clip","title":"English Wikipedia article: Bulldog clip","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bulldog+clip"}],"status":"reported","summary":"English Wikipedia (article \"Bulldog clip\", CC BY-SA 4.0) states: A bulldog clip is a device for temporarily but firmly binding sheets of paper together.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bill-of-quantities","kind":"concept","label":"Bill of quantities","sources":[{"id":"wikipedia.article.bill-of-quantities","title":"English Wikipedia article: Bill of quantities","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bill+of+quantities"}],"status":"reported","summary":"English Wikipedia (article \"Bill of quantities\", CC BY-SA 4.0) states: A bill of quantities is a document used in tendering in the construction industry in which materials, parts, and labor (and their costs) are itemized.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.jackshaft-locomotive","kind":"concept","label":"Jackshaft (locomotive)","sources":[{"id":"wikipedia.article.jackshaft-locomotive","title":"English Wikipedia article: Jackshaft (locomotive)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jackshaft+%28locomotive%29"}],"status":"reported","summary":"English Wikipedia (article \"Jackshaft (locomotive)\", CC BY-SA 4.0) states: A jackshaft is an intermediate shaft used to transfer power from a powered shaft such as the output shaft of an engine or motor to driven shafts such as the drive axles of a locomotive.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"field.wikipedia.architectural-engineering","kind":"field","label":"Architectural engineering","sources":[{"id":"wikipedia.article.architectural-engineering","title":"English Wikipedia article: Architectural engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Architectural+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Architectural engineering\", CC BY-SA 4.0) states: Architectural engineering or architecture engineering, also known as building engineering, is a discipline that deals with the engineering and construction of buildings, such as environmental, structural, mechanical, electrical, computational, embeddable, and other research domains.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.beamline","kind":"concept","label":"Beamline","sources":[{"id":"wikipedia.article.beamline","title":"English Wikipedia article: Beamline","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beamline"}],"status":"reported","summary":"English Wikipedia (article \"Beamline\", CC BY-SA 4.0) states: In accelerator physics, a beamline refers to the trajectory of the beam of particles, including the overall construction of the path segment (guide tubes, diagnostic devices) along a specific path of an accelerator facility.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.computer-aided-engineering","kind":"concept","label":"Computer-aided engineering","sources":[{"id":"wikipedia.article.computer-aided-engineering","title":"English Wikipedia article: Computer-aided engineering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computer-aided+engineering"}],"status":"reported","summary":"English Wikipedia (article \"Computer-aided engineering\", CC BY-SA 4.0) states: Computer-aided engineering (CAE) is the general usage of technology to aid in tasks related to engineering analysis.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.column","kind":"concept","label":"Column","sources":[{"id":"wikipedia.article.column","title":"English Wikipedia article: Column","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Column"}],"status":"reported","summary":"English Wikipedia (article \"Column\", CC BY-SA 4.0) states: A column/pillar in architecture and structural engineering is a structural element that transmits, through compression, the weight of the structure above to other structural elements below.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.jewel-bearing","kind":"concept","label":"Jewel bearing","sources":[{"id":"wikipedia.article.jewel-bearing","title":"English Wikipedia article: Jewel bearing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jewel+bearing"}],"status":"reported","summary":"English Wikipedia (article \"Jewel bearing\", CC BY-SA 4.0) states: A jewel bearing is a plain bearing in which a metal spindle turns in a jewel-lined pivot hole.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.bridge-strike","kind":"concept","label":"Bridge strike","sources":[{"id":"wikipedia.article.bridge-strike","title":"English Wikipedia article: Bridge strike","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridge+strike"}],"status":"reported","summary":"English Wikipedia (article \"Bridge strike\", CC BY-SA 4.0) states: Bridge strike or tunnel strike (also known as bridge bashing) is a transport accident in which a vehicle collides with a bridge, overpass, or tunnel structure.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.castellated-beam","kind":"concept","label":"Castellated beam","sources":[{"id":"wikipedia.article.castellated-beam","title":"English Wikipedia article: Castellated beam","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Castellated+beam"}],"status":"reported","summary":"English Wikipedia (article \"Castellated beam\", CC BY-SA 4.0) states: A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.air-data-inertial-reference-unit","kind":"concept","label":"Air data inertial reference unit","sources":[{"id":"wikipedia.article.air-data-inertial-reference-unit","title":"English Wikipedia article: Air data inertial reference unit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Air+data+inertial+reference+unit"}],"status":"reported","summary":"English Wikipedia (article \"Air data inertial reference unit\", CC BY-SA 4.0) states: An air data inertial reference unit (ADIRU) is a key component of the integrated air data inertial reference system (ADIRS), which supplies air data (airspeed, angle of attack and altitude) and inertial reference (position and attitude) information to the pilots' electronic flight instrument system displays as well as other systems on the aircraft such as the engines, autopilot, aircraft flight control system and landing gear systems.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.change-request","kind":"concept","label":"Change request","sources":[{"id":"wikipedia.article.change-request","title":"English Wikipedia article: Change request","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Change+request"}],"status":"reported","summary":"English Wikipedia (article \"Change request\", CC BY-SA 4.0) states: A change request, sometimes called change control request (CCR), is a document containing a call for an adjustment of a system; it is of great importance in the change management process.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.cable-fairing","kind":"concept","label":"Cable fairing","sources":[{"id":"wikipedia.article.cable-fairing","title":"English Wikipedia article: Cable fairing","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cable+fairing"}],"status":"reported","summary":"English Wikipedia (article \"Cable fairing\", CC BY-SA 4.0) states: A cable fairing is a structure attached to a towed cable designed to streamline the flow around the cable, primarily in marine environments.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.differential-mechanical-device","kind":"concept","label":"Differential (mechanical device)","sources":[{"id":"wikipedia.article.differential-mechanical-device","title":"English Wikipedia article: Differential (mechanical device)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+%28mechanical+device%29"}],"status":"reported","summary":"English Wikipedia (article \"Differential (mechanical device)\", CC BY-SA 4.0) states: A differential is a gear train with three drive shafts that has the property that the rotational speed of one shaft is the average of the speeds of the others.","tags":[]},{"aliases":[],"domain":"engineering","era":"undated","frontier":false,"id":"concept.wikipedia.four-slide","kind":"concept","label":"Four-slide","sources":[{"id":"wikipedia.article.four-slide","title":"English Wikipedia article: Four-slide","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Four-slide"}],"status":"reported","summary":"English Wikipedia (article \"Four-slide\", CC BY-SA 4.0) states: A four-slide, also known as a multislide, multi-slide, or four-way, is a metalworking machine tool used in the high-volume manufacture of small stamped components from bar or wire stock.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.abstract-algebra","kind":"field","label":"Abstract algebra","sources":[{"id":"wikipedia.article.abstract-algebra","title":"English Wikipedia article: Abstract algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Abstract algebra\", CC BY-SA 4.0) states: In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are sets with specific operations acting on their elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.general-topology","kind":"field","label":"General topology","sources":[{"id":"wikipedia.article.general-topology","title":"English Wikipedia article: General topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=General+topology"}],"status":"reported","summary":"English Wikipedia (article \"General topology\", CC BY-SA 4.0) states: In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-topology","kind":"field","label":"Algebraic topology","sources":[{"id":"wikipedia.article.algebraic-topology","title":"English Wikipedia article: Algebraic topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+topology"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic topology\", CC BY-SA 4.0) states: Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.complex-analysis","kind":"field","label":"Complex analysis","sources":[{"id":"wikipedia.article.complex-analysis","title":"English Wikipedia article: Complex analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Complex+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Complex analysis\", CC BY-SA 4.0) states: Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that studies complex-valued functions of one or more complex variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.functional-analysis","kind":"field","label":"Functional analysis","sources":[{"id":"wikipedia.article.functional-analysis","title":"English Wikipedia article: Functional analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Functional+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Functional analysis\", CC BY-SA 4.0) states: Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, inner product, norm, or topology) and the linear functions defined on these spaces and suitably respecting these structures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.measure-mathematics","kind":"concept","label":"Measure (mathematics)","sources":[{"id":"wikipedia.article.measure-mathematics","title":"English Wikipedia article: Measure (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Measure+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Measure (mathematics)\", CC BY-SA 4.0) states: In mathematics, the concept of a measure is a generalization and formalization of geometrical measures (length, area, volume) and other common notions, such as magnitude, mass, and probability of events.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.combinatorics","kind":"field","label":"Combinatorics","sources":[{"id":"wikipedia.article.combinatorics","title":"English Wikipedia article: Combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Combinatorics\", CC BY-SA 4.0) states: Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.differential-geometry","kind":"field","label":"Differential geometry","sources":[{"id":"wikipedia.article.differential-geometry","title":"English Wikipedia article: Differential geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Differential geometry\", CC BY-SA 4.0) states: Differential geometry is a mathematical discipline that studies the geometry of smooth shapes and smooth spaces, otherwise known as smooth manifolds.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.euclidean-geometry","kind":"concept","label":"Euclidean geometry","sources":[{"id":"wikipedia.article.euclidean-geometry","title":"English Wikipedia article: Euclidean geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Euclidean+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Euclidean geometry\", CC BY-SA 4.0) states: Euclidean geometry is a mathematical system attributed to Euclid, an ancient Greek mathematician, which he described in his textbook on geometry, Elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.probability-theory","kind":"field","label":"Probability theory","sources":[{"id":"wikipedia.article.probability-theory","title":"English Wikipedia article: Probability theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Probability+theory"}],"status":"reported","summary":"English Wikipedia (article \"Probability theory\", CC BY-SA 4.0) states: Probability theory or probability calculus is the branch of mathematics concerned with probability.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.order-theory","kind":"field","label":"Order theory","sources":[{"id":"wikipedia.article.order-theory","title":"English Wikipedia article: Order theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Order+theory"}],"status":"reported","summary":"English Wikipedia (article \"Order theory\", CC BY-SA 4.0) states: Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.mathematical-logic","kind":"concept","label":"Mathematical logic","sources":[{"id":"wikipedia.article.mathematical-logic","title":"English Wikipedia article: Mathematical logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+logic"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical logic\", CC BY-SA 4.0) states: Mathematical logic is the study of formal logic within mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.mathematical-analysis","kind":"field","label":"Mathematical analysis","sources":[{"id":"wikipedia.article.mathematical-analysis","title":"English Wikipedia article: Mathematical analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical analysis\", CC BY-SA 4.0) states: Mathematical analysis is the branch of mathematics that studies functions, spaces, and operators through methods of approximation and convergence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convergence-space","kind":"concept","label":"Convergence space","sources":[{"id":"wikipedia.article.convergence-space","title":"English Wikipedia article: Convergence space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convergence+space"}],"status":"reported","summary":"English Wikipedia (article \"Convergence space\", CC BY-SA 4.0) states: In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dynamical-system","kind":"concept","label":"Dynamical system","sources":[{"id":"wikipedia.article.dynamical-system","title":"English Wikipedia article: Dynamical system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dynamical+system"}],"status":"reported","summary":"English Wikipedia (article \"Dynamical system\", CC BY-SA 4.0) states: In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in an ambient space, such as in a parametric curve.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.numerical-analysis","kind":"field","label":"Numerical analysis","sources":[{"id":"wikipedia.article.numerical-analysis","title":"English Wikipedia article: Numerical analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Numerical+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Numerical analysis\", CC BY-SA 4.0) states: Numerical analysis is the study of algorithms for the problems of continuous mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.module-mathematics","kind":"concept","label":"Module (mathematics)","sources":[{"id":"wikipedia.article.module-mathematics","title":"English Wikipedia article: Module (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Module+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Module (mathematics)\", CC BY-SA 4.0) states: In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a (not necessarily commutative) ring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.prime-number","kind":"concept","label":"Prime number","sources":[{"id":"wikipedia.article.prime-number","title":"English Wikipedia article: Prime number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Prime+number"}],"status":"reported","summary":"English Wikipedia (article \"Prime number\", CC BY-SA 4.0) states: A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antoine-s-necklace","kind":"concept","label":"Antoine's necklace","sources":[{"id":"wikipedia.article.antoine-s-necklace","title":"English Wikipedia article: Antoine's necklace","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antoine%27s+necklace"}],"status":"reported","summary":"English Wikipedia (article \"Antoine's necklace\", CC BY-SA 4.0) states: In mathematics, Antoine's necklace is a topological embedding of the Cantor set in 3-dimensional Euclidean space, whose complement is not simply connected.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.abel-s-binomial-theorem","kind":"theory","label":"Abel's binomial theorem","sources":[{"id":"wikipedia.article.abel-s-binomial-theorem","title":"English Wikipedia article: Abel's binomial theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+binomial+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Abel's binomial theorem\", CC BY-SA 4.0) states: Abel's binomial theorem, named after Niels Henrik Abel, is a mathematical identity involving sums of binomial coefficients.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.alexander-s-subbase-lemma","kind":"theory","label":"Alexander's subbase lemma","sources":[{"id":"wikipedia.article.alexander-s-subbase-lemma","title":"English Wikipedia article: Alexander's subbase lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander%27s+subbase+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Alexander's subbase lemma\", CC BY-SA 4.0) states: In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.calculus","kind":"concept","label":"Calculus","sources":[{"id":"wikipedia.article.calculus","title":"English Wikipedia article: Calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus"}],"status":"reported","summary":"English Wikipedia (article \"Calculus\", CC BY-SA 4.0) states: Calculus is the branch of mathematics that studies continuous change, and is the principal precursor of modern mathematical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.finite-model-theory","kind":"concept","label":"Finite model theory","sources":[{"id":"wikipedia.article.finite-model-theory","title":"English Wikipedia article: Finite model theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Finite+model+theory"}],"status":"reported","summary":"English Wikipedia (article \"Finite model theory\", CC BY-SA 4.0) states: Finite model theory is a subarea of model theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.condensed-detachment","kind":"concept","label":"Condensed detachment","sources":[{"id":"wikipedia.article.condensed-detachment","title":"English Wikipedia article: Condensed detachment","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Condensed+detachment"}],"status":"reported","summary":"English Wikipedia (article \"Condensed detachment\", CC BY-SA 4.0) states: Condensed detachment (Rule D) is a method of finding the most general possible conclusion given two formal logical statements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.fourier-analysis","kind":"field","label":"Fourier analysis","sources":[{"id":"wikipedia.article.fourier-analysis","title":"English Wikipedia article: Fourier analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fourier+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Fourier analysis\", CC BY-SA 4.0) states: In mathematics, the sciences, and engineering, Fourier analysis () is the study of the way general functions on the real line, circle, integers, finite cyclic group or general locally compact Abelian group may be represented or approximated by sums of trigonometric functions or more conveniently, complex exponentials.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.harmonic-analysis","kind":"field","label":"Harmonic analysis","sources":[{"id":"wikipedia.article.harmonic-analysis","title":"English Wikipedia article: Harmonic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic analysis\", CC BY-SA 4.0) states: Harmonic analysis is an area of mathematical analysis that emerged from the study of harmonic functions, and especially their boundary behavior.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.homological-algebra","kind":"field","label":"Homological algebra","sources":[{"id":"wikipedia.article.homological-algebra","title":"English Wikipedia article: Homological algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Homological+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Homological algebra\", CC BY-SA 4.0) states: Homological algebra is the branch of mathematics that studies homology in a general algebraic setting.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.commutative-algebra","kind":"field","label":"Commutative algebra","sources":[{"id":"wikipedia.article.commutative-algebra","title":"English Wikipedia article: Commutative algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commutative+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Commutative algebra\", CC BY-SA 4.0) states: Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.convex-geometry","kind":"field","label":"Convex geometry","sources":[{"id":"wikipedia.article.convex-geometry","title":"English Wikipedia article: Convex geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Convex geometry\", CC BY-SA 4.0) states: In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.discrete-mathematics","kind":"field","label":"Discrete mathematics","sources":[{"id":"wikipedia.article.discrete-mathematics","title":"English Wikipedia article: Discrete mathematics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discrete+mathematics"}],"status":"reported","summary":"English Wikipedia (article \"Discrete mathematics\", CC BY-SA 4.0) states: Discrete mathematics is the study of mathematical structures that can be considered \"discrete\" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than \"continuous\" (analogously to continuous functions).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.ring-theory","kind":"field","label":"Ring theory","sources":[{"id":"wikipedia.article.ring-theory","title":"English Wikipedia article: Ring theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ring+theory"}],"status":"reported","summary":"English Wikipedia (article \"Ring theory\", CC BY-SA 4.0) states: In algebra, ring theory is the study of rings, algebraic structures in which addition and multiplication are defined and have similar properties to those operations defined for the integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.number-theory","kind":"field","label":"Number theory","sources":[{"id":"wikipedia.article.number-theory","title":"English Wikipedia article: Number theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Number+theory"}],"status":"reported","summary":"English Wikipedia (article \"Number theory\", CC BY-SA 4.0) states: Number theory is a branch of mathematics devoted primarily to the study of the integers and arithmetic functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.real-analysis","kind":"concept","label":"Real analysis","sources":[{"id":"wikipedia.article.real-analysis","title":"English Wikipedia article: Real analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Real+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Real analysis\", CC BY-SA 4.0) states: Real analysis is the part of mathematical analysis, especially as taught in undergraduate and graduate courses, that develops calculus rigorously over the real numbers and Euclidean spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.combinatorial-principles","kind":"concept","label":"Combinatorial principles","sources":[{"id":"wikipedia.article.combinatorial-principles","title":"English Wikipedia article: Combinatorial principles","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Combinatorial+principles"}],"status":"reported","summary":"English Wikipedia (article \"Combinatorial principles\", CC BY-SA 4.0) states: In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.geometric-analysis","kind":"field","label":"Geometric analysis","sources":[{"id":"wikipedia.article.geometric-analysis","title":"English Wikipedia article: Geometric analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Geometric analysis\", CC BY-SA 4.0) states: Geometric analysis is a mathematical discipline where tools from differential equations, especially elliptic partial differential equations (PDEs), are used to establish new results in differential geometry and differential topology.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-mathematics","kind":"concept","label":"Category (mathematics)","sources":[{"id":"wikipedia.article.category-mathematics","title":"English Wikipedia article: Category (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Category (mathematics)\", CC BY-SA 4.0) states: In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is a collection of \"objects\" that are linked by \"arrows\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.constructive-analysis","kind":"concept","label":"Constructive analysis","sources":[{"id":"wikipedia.article.constructive-analysis","title":"English Wikipedia article: Constructive analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constructive+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Constructive analysis\", CC BY-SA 4.0) states: In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","kind":"concept","label":"Algebraic geometry and analytic geometry","sources":[{"id":"wikipedia.article.algebraic-geometry-and-analytic-geometry","title":"English Wikipedia article: Algebraic geometry and analytic geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+geometry+and+analytic+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic geometry and analytic geometry\", CC BY-SA 4.0) states: In mathematics, algebraic geometry and analytic geometry are two closely related subjects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antieigenvalue-theory","kind":"concept","label":"Antieigenvalue theory","sources":[{"id":"wikipedia.article.antieigenvalue-theory","title":"English Wikipedia article: Antieigenvalue theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antieigenvalue+theory"}],"status":"reported","summary":"English Wikipedia (article \"Antieigenvalue theory\", CC BY-SA 4.0) states: In applied mathematics, antieigenvalue theory was developed by Karl Gustafson from 1966 to 1968.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arens-fort-space","kind":"concept","label":"Arens–Fort space","sources":[{"id":"wikipedia.article.arens-fort-space","title":"English Wikipedia article: Arens–Fort space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arens%E2%80%93Fort+space"}],"status":"reported","summary":"English Wikipedia (article \"Arens–Fort space\", CC BY-SA 4.0) states: In mathematics, the Arens–Fort space is a special example in the theory of topological spaces, named for Richard Friederich Arens and M. K. Fort, Jr.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.abel-s-irreducibility-theorem","kind":"theory","label":"Abel's irreducibility theorem","sources":[{"id":"wikipedia.article.abel-s-irreducibility-theorem","title":"English Wikipedia article: Abel's irreducibility theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+irreducibility+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Abel's irreducibility theorem\", CC BY-SA 4.0) states: In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if f(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is irreducible over F, then every root of g(x) is a root of f(x).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.anderson-kadec-theorem","kind":"theory","label":"Anderson–Kadec theorem","sources":[{"id":"wikipedia.article.anderson-kadec-theorem","title":"English Wikipedia article: Anderson–Kadec theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anderson%E2%80%93Kadec+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Anderson–Kadec theorem\", CC BY-SA 4.0) states: In mathematics, in the areas of topology and functional analysis, the Anderson–Kadec theorem states that any two infinite-dimensional, separable Banach spaces, or, more generally, Fréchet spaces, are homeomorphic as topological spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amalgamation-property","kind":"concept","label":"Amalgamation property","sources":[{"id":"wikipedia.article.amalgamation-property","title":"English Wikipedia article: Amalgamation property","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amalgamation+property"}],"status":"reported","summary":"English Wikipedia (article \"Amalgamation property\", CC BY-SA 4.0) states: In the mathematical field of model theory, the amalgamation property is a property of collections of structures that guarantees, under certain conditions, that two structures in the collection can be regarded as substructures of a larger one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-proof","kind":"concept","label":"Analytic proof","sources":[{"id":"wikipedia.article.analytic-proof","title":"English Wikipedia article: Analytic proof","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+proof"}],"status":"reported","summary":"English Wikipedia (article \"Analytic proof\", CC BY-SA 4.0) states: In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and that does not predominantly make use of algebraic or geometrical methods.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-plank-problem","kind":"concept","label":"Affine plank problem","sources":[{"id":"wikipedia.article.affine-plank-problem","title":"English Wikipedia article: Affine plank problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+plank+problem"}],"status":"reported","summary":"English Wikipedia (article \"Affine plank problem\", CC BY-SA 4.0) states: In mathematics, the affine plank problem is an open question in convex geometry posed by Thøger Bang in 1951 as a strengthening of Tarski's plank problem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.group-mathematics","kind":"concept","label":"Group (mathematics)","sources":[{"id":"wikipedia.article.group-mathematics","title":"English Wikipedia article: Group (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Group+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Group (mathematics)\", CC BY-SA 4.0) states: In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-wiener-space","kind":"concept","label":"Abstract Wiener space","sources":[{"id":"wikipedia.article.abstract-wiener-space","title":"English Wikipedia article: Abstract Wiener space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+Wiener+space"}],"status":"reported","summary":"English Wikipedia (article \"Abstract Wiener space\", CC BY-SA 4.0) states: The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-process","kind":"concept","label":"Additive process","sources":[{"id":"wikipedia.article.additive-process","title":"English Wikipedia article: Additive process","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+process"}],"status":"reported","summary":"English Wikipedia (article \"Additive process\", CC BY-SA 4.0) states: An additive process, in probability theory, is a cadlag, continuous in probability stochastic process with independent increments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.computability-theory","kind":"field","label":"Computability theory","sources":[{"id":"wikipedia.article.computability-theory","title":"English Wikipedia article: Computability theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Computability+theory"}],"status":"reported","summary":"English Wikipedia (article \"Computability theory\", CC BY-SA 4.0) states: Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.floquet-theory","kind":"concept","label":"Floquet theory","sources":[{"id":"wikipedia.article.floquet-theory","title":"English Wikipedia article: Floquet theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Floquet+theory"}],"status":"reported","summary":"English Wikipedia (article \"Floquet theory\", CC BY-SA 4.0) states: Given a system in which the forces are periodic—such as a pendulum under a periodic driving force, or an oscillating circuit driven by alternating current—the overall behavior of the system is not necessarily fully periodic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antimatroid","kind":"concept","label":"Antimatroid","sources":[{"id":"wikipedia.article.antimatroid","title":"English Wikipedia article: Antimatroid","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antimatroid"}],"status":"reported","summary":"English Wikipedia (article \"Antimatroid\", CC BY-SA 4.0) states: In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.representation-theory","kind":"field","label":"Representation theory","sources":[{"id":"wikipedia.article.representation-theory","title":"English Wikipedia article: Representation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Representation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Representation theory\", CC BY-SA 4.0) states: Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.modular-representation-theory","kind":"concept","label":"Modular representation theory","sources":[{"id":"wikipedia.article.modular-representation-theory","title":"English Wikipedia article: Modular representation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Modular+representation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Modular representation theory\", CC BY-SA 4.0) states: In mathematics, modular representation theory is the part of representation theory that studies linear representations of finite groups over fields of positive characteristic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.analytic-subgroup-theorem","kind":"theory","label":"Analytic subgroup theorem","sources":[{"id":"wikipedia.article.analytic-subgroup-theorem","title":"English Wikipedia article: Analytic subgroup theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+subgroup+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Analytic subgroup theorem\", CC BY-SA 4.0) states: In mathematics, the analytic subgroup theorem is a significant result in modern transcendental number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.andreotti-vesentini-theorem","kind":"theory","label":"Andreotti–Vesentini theorem","sources":[{"id":"wikipedia.article.andreotti-vesentini-theorem","title":"English Wikipedia article: Andreotti–Vesentini theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andreotti%E2%80%93Vesentini+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Andreotti–Vesentini theorem\", CC BY-SA 4.0) states: In mathematics, the Andreotti–Vesentini separation theorem, introduced by Aldo Andreotti and Edoardo Vesentini (1965, 1965b) states that certain cohomology groups of coherent sheaves are separated.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.big-little-big-lemma","kind":"theory","label":"Big-little-big lemma","sources":[{"id":"wikipedia.article.big-little-big-lemma","title":"English Wikipedia article: Big-little-big lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big-little-big+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Big-little-big lemma\", CC BY-SA 4.0) states: In the mathematics of paper folding, the big-little-big lemma is a necessary condition for a crease pattern with specified mountain folds and valley folds to be able to be folded flat.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-progression","kind":"concept","label":"Arithmetic progression","sources":[{"id":"wikipedia.article.arithmetic-progression","title":"English Wikipedia article: Arithmetic progression","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+progression"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic progression\", CC BY-SA 4.0) states: An arithmetic progression, arithmetic sequence or linear sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.degeneracy-mathematics","kind":"concept","label":"Degeneracy (mathematics)","sources":[{"id":"wikipedia.article.degeneracy-mathematics","title":"English Wikipedia article: Degeneracy (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Degeneracy+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Degeneracy (mathematics)\", CC BY-SA 4.0) states: In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from (and usually simpler than) the rest of the class; \"degeneracy\" is the condition of being a degenerate case.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bachmann-howard-ordinal","kind":"concept","label":"Bachmann–Howard ordinal","sources":[{"id":"wikipedia.article.bachmann-howard-ordinal","title":"English Wikipedia article: Bachmann–Howard ordinal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bachmann%E2%80%93Howard+ordinal"}],"status":"reported","summary":"English Wikipedia (article \"Bachmann–Howard ordinal\", CC BY-SA 4.0) states: In mathematics, the Bachmann–Howard ordinal (also known as the Howard ordinal, or Howard–Bachmann ordinal) is a large countable ordinal.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.noncommutative-harmonic-analysis","kind":"field","label":"Noncommutative harmonic analysis","sources":[{"id":"wikipedia.article.noncommutative-harmonic-analysis","title":"English Wikipedia article: Noncommutative harmonic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Noncommutative+harmonic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Noncommutative harmonic analysis\", CC BY-SA 4.0) states: In mathematics, noncommutative harmonic analysis is the field in which results from Fourier analysis are extended to topological groups that are not commutative.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abelian-category","kind":"concept","label":"Abelian category","sources":[{"id":"wikipedia.article.abelian-category","title":"English Wikipedia article: Abelian category","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abelian+category"}],"status":"reported","summary":"English Wikipedia (article \"Abelian category\", CC BY-SA 4.0) states: In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-continuity","kind":"concept","label":"Absolute continuity","sources":[{"id":"wikipedia.article.absolute-continuity","title":"English Wikipedia article: Absolute continuity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+continuity"}],"status":"reported","summary":"English Wikipedia (article \"Absolute continuity\", CC BY-SA 4.0) states: In calculus and real analysis, absolute continuity is a regularity property of functions that is stronger than uniform continuity, and hence continuity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-analysis","kind":"field","label":"Algebraic analysis","sources":[{"id":"wikipedia.article.algebraic-analysis","title":"English Wikipedia article: Algebraic analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic analysis\", CC BY-SA 4.0) states: Algebraic analysis is an area of mathematics that deals with systems of linear partial differential equations by using sheaf theory and complex analysis to study properties and generalizations of functions such as hyperfunctions and microfunctions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.albertson-index","kind":"concept","label":"Albertson index","sources":[{"id":"wikipedia.article.albertson-index","title":"English Wikipedia article: Albertson index","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Albertson+index"}],"status":"reported","summary":"English Wikipedia (article \"Albertson index\", CC BY-SA 4.0) states: The Albertson index (also known as irregularity or Albertson irregularity index) is a graph invariant that measures the irregularity of a graph by summing the imbalances of all its edges.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adomian-decomposition-method","kind":"concept","label":"Adomian decomposition method","sources":[{"id":"wikipedia.article.adomian-decomposition-method","title":"English Wikipedia article: Adomian decomposition method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adomian+decomposition+method"}],"status":"reported","summary":"English Wikipedia (article \"Adomian decomposition method\", CC BY-SA 4.0) states: The Adomian decomposition method (ADM) is a semi-analytical method for solving ordinary and partial nonlinear differential equations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-representation","kind":"concept","label":"Admissible representation","sources":[{"id":"wikipedia.article.admissible-representation","title":"English Wikipedia article: Admissible representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+representation"}],"status":"reported","summary":"English Wikipedia (article \"Admissible representation\", CC BY-SA 4.0) states: In mathematics, admissible representations are a well-behaved class of representations used in the representation theory of reductive Lie groups and locally compact totally disconnected groups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.action-angle-coordinates","kind":"concept","label":"Action-angle coordinates","sources":[{"id":"wikipedia.article.action-angle-coordinates","title":"English Wikipedia article: Action-angle coordinates","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Action-angle+coordinates"}],"status":"reported","summary":"English Wikipedia (article \"Action-angle coordinates\", CC BY-SA 4.0) states: In classical mechanics, action-angle variables are a set of canonical coordinates that are useful in characterizing the nature of commuting flows in integrable systems when the conserved energy level set is compact, and the commuting flows are complete.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraically-compact-module","kind":"concept","label":"Algebraically compact module","sources":[{"id":"wikipedia.article.algebraically-compact-module","title":"English Wikipedia article: Algebraically compact module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraically+compact+module"}],"status":"reported","summary":"English Wikipedia (article \"Algebraically compact module\", CC BY-SA 4.0) states: In mathematics, algebraically compact modules, also called pure-injective modules, are modules that have a certain \"nice\" property which allows the solution of infinite systems of equations in the module by finitary means.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.block-matrix-pseudoinverse","kind":"concept","label":"Block matrix pseudoinverse","sources":[{"id":"wikipedia.article.block-matrix-pseudoinverse","title":"English Wikipedia article: Block matrix pseudoinverse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Block+matrix+pseudoinverse"}],"status":"reported","summary":"English Wikipedia (article \"Block matrix pseudoinverse\", CC BY-SA 4.0) states: In mathematics, a block matrix pseudoinverse is a formula for the pseudoinverse of a partitioned matrix.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-manifold","kind":"concept","label":"Algebraic manifold","sources":[{"id":"wikipedia.article.algebraic-manifold","title":"English Wikipedia article: Algebraic manifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+manifold"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic manifold\", CC BY-SA 4.0) states: In mathematics, an algebraic manifold is an algebraic variety which is also a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ap-ry-s-theorem","kind":"theory","label":"Apéry's theorem","sources":[{"id":"wikipedia.article.ap-ry-s-theorem","title":"English Wikipedia article: Apéry's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ap%C3%A9ry%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Apéry's theorem\", CC BY-SA 4.0) states: In mathematics, Apéry's theorem is a result in number theory which states that Apéry's constant ζ(3) is irrational.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.annulus-theorem","kind":"theory","label":"Annulus theorem","sources":[{"id":"wikipedia.article.annulus-theorem","title":"English Wikipedia article: Annulus theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Annulus+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Annulus theorem\", CC BY-SA 4.0) states: In mathematics, the annulus theorem (formerly called the annulus conjecture) states roughly that the region between two well-behaved spheres is an annulus.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.borel-cantelli-lemma","kind":"theory","label":"Borel–Cantelli lemma","sources":[{"id":"wikipedia.article.borel-cantelli-lemma","title":"English Wikipedia article: Borel–Cantelli lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Borel%E2%80%93Cantelli+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Borel–Cantelli lemma\", CC BY-SA 4.0) states: The Borel–Cantelli lemma is a result in measure theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.limiting-case-mathematics","kind":"concept","label":"Limiting case (mathematics)","sources":[{"id":"wikipedia.article.limiting-case-mathematics","title":"English Wikipedia article: Limiting case (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Limiting+case+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Limiting case (mathematics)\", CC BY-SA 4.0) states: In mathematics, a limiting case of a mathematical object is a special case that arises when one or more components of the object take on their most extreme possible values.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.moment-statistics","kind":"concept","label":"Moment (statistics)","sources":[{"id":"wikipedia.article.moment-statistics","title":"English Wikipedia article: Moment (statistics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Moment+%28statistics%29"}],"status":"reported","summary":"English Wikipedia (article \"Moment (statistics)\", CC BY-SA 4.0) states: In statistics, the moments of a probability density function are measures related to the shape of the function's graph.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.back-and-forth-method","kind":"concept","label":"Back-and-forth method","sources":[{"id":"wikipedia.article.back-and-forth-method","title":"English Wikipedia article: Back-and-forth method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Back-and-forth+method"}],"status":"reported","summary":"English Wikipedia (article \"Back-and-forth method\", CC BY-SA 4.0) states: In mathematical logic, especially set theory and model theory, the back-and-forth method is a method for showing isomorphism between countably infinite structures satisfying specified conditions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounded-quantifier","kind":"concept","label":"Bounded quantifier","sources":[{"id":"wikipedia.article.bounded-quantifier","title":"English Wikipedia article: Bounded quantifier","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounded+quantifier"}],"status":"reported","summary":"English Wikipedia (article \"Bounded quantifier\", CC BY-SA 4.0) states: In the study of formal theories in mathematical logic, bounded quantifiers (also known as restricted quantifiers) are often included in a formal language in addition to the standard quantifiers \"∀\" and \"∃\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.admissible-numbering","kind":"concept","label":"Admissible numbering","sources":[{"id":"wikipedia.article.admissible-numbering","title":"English Wikipedia article: Admissible numbering","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Admissible+numbering"}],"status":"reported","summary":"English Wikipedia (article \"Admissible numbering\", CC BY-SA 4.0) states: In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering of partial computable functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.autocovariance","kind":"concept","label":"Autocovariance","sources":[{"id":"wikipedia.article.autocovariance","title":"English Wikipedia article: Autocovariance","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autocovariance"}],"status":"reported","summary":"English Wikipedia (article \"Autocovariance\", CC BY-SA 4.0) states: In probability theory and statistics, given a stochastic process, the autocovariance is a function that gives the covariance of the process with itself at pairs of time points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.acyclic-model","kind":"concept","label":"Acyclic model","sources":[{"id":"wikipedia.article.acyclic-model","title":"English Wikipedia article: Acyclic model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Acyclic+model"}],"status":"reported","summary":"English Wikipedia (article \"Acyclic model\", CC BY-SA 4.0) states: In algebraic topology, a discipline within mathematics, the acyclic models theorem can be used to show that two homology theories are isomorphic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.convex-analysis","kind":"field","label":"Convex analysis","sources":[{"id":"wikipedia.article.convex-analysis","title":"English Wikipedia article: Convex analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Convex analysis\", CC BY-SA 4.0) states: Convex analysis is the branch of mathematics that studies convex sets, convex functions, and their applications to optimization, functional analysis, variational analysis, convex geometry, economics, and related fields.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absorption-law","kind":"concept","label":"Absorption law","sources":[{"id":"wikipedia.article.absorption-law","title":"English Wikipedia article: Absorption law","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absorption+law"}],"status":"reported","summary":"English Wikipedia (article \"Absorption law\", CC BY-SA 4.0) states: In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjugate-matrix","kind":"concept","label":"Adjugate matrix","sources":[{"id":"wikipedia.article.adjugate-matrix","title":"English Wikipedia article: Adjugate matrix","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjugate+matrix"}],"status":"reported","summary":"English Wikipedia (article \"Adjugate matrix\", CC BY-SA 4.0) states: In linear algebra, the adjugate or classical adjoint adj(A) of a square matrix A is the transpose of its cofactor matrix.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amplitwist","kind":"concept","label":"Amplitwist","sources":[{"id":"wikipedia.article.amplitwist","title":"English Wikipedia article: Amplitwist","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amplitwist"}],"status":"reported","summary":"English Wikipedia (article \"Amplitwist\", CC BY-SA 4.0) states: In mathematics, the amplitwist is a concept created by Tristan Needham in the book Visual Complex Analysis (1997) to represent the derivative of a complex function visually.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-everywhere","kind":"concept","label":"Almost everywhere","sources":[{"id":"wikipedia.article.almost-everywhere","title":"English Wikipedia article: Almost everywhere","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+everywhere"}],"status":"reported","summary":"English Wikipedia (article \"Almost everywhere\", CC BY-SA 4.0) states: In measure theory (a branch of mathematical analysis), a property holds almost everywhere (sometimes abbreviated as a.e.) if the set for which the property does not hold is negligible in a technical sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.extremal-combinatorics","kind":"field","label":"Extremal combinatorics","sources":[{"id":"wikipedia.article.extremal-combinatorics","title":"English Wikipedia article: Extremal combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Extremal+combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Extremal combinatorics\", CC BY-SA 4.0) states: Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bicircular-matroid","kind":"concept","label":"Bicircular matroid","sources":[{"id":"wikipedia.article.bicircular-matroid","title":"English Wikipedia article: Bicircular matroid","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicircular+matroid"}],"status":"reported","summary":"English Wikipedia (article \"Bicircular matroid\", CC BY-SA 4.0) states: In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.pregeometry-model-theory","kind":"concept","label":"Pregeometry (model theory)","sources":[{"id":"wikipedia.article.pregeometry-model-theory","title":"English Wikipedia article: Pregeometry (model theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Pregeometry+%28model+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Pregeometry (model theory)\", CC BY-SA 4.0) states: Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for \"matroid\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.projective-differential-geometry","kind":"field","label":"Projective differential geometry","sources":[{"id":"wikipedia.article.projective-differential-geometry","title":"English Wikipedia article: Projective differential geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Projective+differential+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Projective differential geometry\", CC BY-SA 4.0) states: In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-surely","kind":"concept","label":"Almost surely","sources":[{"id":"wikipedia.article.almost-surely","title":"English Wikipedia article: Almost surely","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+surely"}],"status":"reported","summary":"English Wikipedia (article \"Almost surely\", CC BY-SA 4.0) states: In probability theory, an event is said to happen almost surely (sometimes abbreviated as a.s.) if it happens with probability 1 (with respect to the probability measure).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandrov-topology","kind":"concept","label":"Alexandrov topology","sources":[{"id":"wikipedia.article.alexandrov-topology","title":"English Wikipedia article: Alexandrov topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandrov+topology"}],"status":"reported","summary":"English Wikipedia (article \"Alexandrov topology\", CC BY-SA 4.0) states: In general topology, an Alexandrov topology is a topology in which the intersection of an arbitrary family of open sets is open (while the definition of a topology only requires this for a finite family).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-differential-equation","kind":"concept","label":"Algebraic differential equation","sources":[{"id":"wikipedia.article.algebraic-differential-equation","title":"English Wikipedia article: Algebraic differential equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+differential+equation"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic differential equation\", CC BY-SA 4.0) states: In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.complemented-lattice","kind":"concept","label":"Complemented lattice","sources":[{"id":"wikipedia.article.complemented-lattice","title":"English Wikipedia article: Complemented lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Complemented+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Complemented lattice\", CC BY-SA 4.0) states: In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adaptive-step-size","kind":"concept","label":"Adaptive step size","sources":[{"id":"wikipedia.article.adaptive-step-size","title":"English Wikipedia article: Adaptive step size","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adaptive+step+size"}],"status":"reported","summary":"English Wikipedia (article \"Adaptive step size\", CC BY-SA 4.0) states: In mathematics and numerical analysis, an adaptive step size is used in some methods for the numerical solution of ordinary differential equations (including the special case of numerical integration) in order to control the errors of the method and to ensure stability properties such as A-stability.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cayley-hamilton-theorem","kind":"theory","label":"Cayley–Hamilton theorem","sources":[{"id":"wikipedia.article.cayley-hamilton-theorem","title":"English Wikipedia article: Cayley–Hamilton theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cayley%E2%80%93Hamilton+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cayley–Hamilton theorem\", CC BY-SA 4.0) states: In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix over a commutative ring (such as the real or complex numbers or the integers) satisfies its own characteristic equation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-polynomial","kind":"concept","label":"Additive polynomial","sources":[{"id":"wikipedia.article.additive-polynomial","title":"English Wikipedia article: Additive polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Additive polynomial\", CC BY-SA 4.0) states: In mathematics, the additive polynomials are an important topic in classical algebraic number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abundant-number","kind":"concept","label":"Abundant number","sources":[{"id":"wikipedia.article.abundant-number","title":"English Wikipedia article: Abundant number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abundant+number"}],"status":"reported","summary":"English Wikipedia (article \"Abundant number\", CC BY-SA 4.0) states: In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-space","kind":"concept","label":"Cantor space","sources":[{"id":"wikipedia.article.cantor-space","title":"English Wikipedia article: Cantor space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+space"}],"status":"reported","summary":"English Wikipedia (article \"Cantor space\", CC BY-SA 4.0) states: In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artin-verdier-duality","kind":"concept","label":"Artin–Verdier duality","sources":[{"id":"wikipedia.article.artin-verdier-duality","title":"English Wikipedia article: Artin–Verdier duality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artin%E2%80%93Verdier+duality"}],"status":"reported","summary":"English Wikipedia (article \"Artin–Verdier duality\", CC BY-SA 4.0) states: In mathematics, Artin–Verdier duality is a duality theorem for constructible abelian sheaves over the spectrum of a ring of algebraic numbers, introduced by Michael Artin and Jean-Louis Verdier (1964), that generalizes Tate duality.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.atiyah-segal-completion-theorem","kind":"theory","label":"Atiyah–Segal completion theorem","sources":[{"id":"wikipedia.article.atiyah-segal-completion-theorem","title":"English Wikipedia article: Atiyah–Segal completion theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atiyah%E2%80%93Segal+completion+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Atiyah–Segal completion theorem\", CC BY-SA 4.0) states: The Atiyah–Segal completion theorem is a theorem in mathematics about equivariant K-theory in homotopy theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.mathematical-diagram","kind":"concept","label":"Mathematical diagram","sources":[{"id":"wikipedia.article.mathematical-diagram","title":"English Wikipedia article: Mathematical diagram","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Mathematical+diagram"}],"status":"reported","summary":"English Wikipedia (article \"Mathematical diagram\", CC BY-SA 4.0) states: Mathematical diagrams, such as charts and graphs, are mainly designed to convey mathematical relationships—for example, comparisons over time.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boolean-valued-model","kind":"concept","label":"Boolean-valued model","sources":[{"id":"wikipedia.article.boolean-valued-model","title":"English Wikipedia article: Boolean-valued model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean-valued+model"}],"status":"reported","summary":"English Wikipedia (article \"Boolean-valued model\", CC BY-SA 4.0) states: In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.buchholz-s-ordinal","kind":"concept","label":"Buchholz's ordinal","sources":[{"id":"wikipedia.article.buchholz-s-ordinal","title":"English Wikipedia article: Buchholz's ordinal","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Buchholz%27s+ordinal"}],"status":"reported","summary":"English Wikipedia (article \"Buchholz's ordinal\", CC BY-SA 4.0) states: In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.arithmetic-combinatorics","kind":"field","label":"Arithmetic combinatorics","sources":[{"id":"wikipedia.article.arithmetic-combinatorics","title":"English Wikipedia article: Arithmetic combinatorics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+combinatorics"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic combinatorics\", CC BY-SA 4.0) states: In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-ring","kind":"concept","label":"Almost ring","sources":[{"id":"wikipedia.article.almost-ring","title":"English Wikipedia article: Almost ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+ring"}],"status":"reported","summary":"English Wikipedia (article \"Almost ring\", CC BY-SA 4.0) states: In mathematics, almost modules and almost rings are certain objects interpolating between rings and their fields of fractions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ade-classification","kind":"concept","label":"ADE classification","sources":[{"id":"wikipedia.article.ade-classification","title":"English Wikipedia article: ADE classification","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=ADE+classification"}],"status":"reported","summary":"English Wikipedia (article \"ADE classification\", CC BY-SA 4.0) states: In mathematics, the ADE classification (originally A-D-E classifications) is a situation where certain kinds of objects are in correspondence with simply laced Dynkin diagrams.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolutely-convex-set","kind":"concept","label":"Absolutely convex set","sources":[{"id":"wikipedia.article.absolutely-convex-set","title":"English Wikipedia article: Absolutely convex set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolutely+convex+set"}],"status":"reported","summary":"English Wikipedia (article \"Absolutely convex set\", CC BY-SA 4.0) states: In mathematics, a subset C of a real or complex vector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term \"circled\" instead of \"balanced\"), in which case it is called a disk.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-space","kind":"concept","label":"Affine space","sources":[{"id":"wikipedia.article.affine-space","title":"English Wikipedia article: Affine space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+space"}],"status":"reported","summary":"English Wikipedia (article \"Affine space\", CC BY-SA 4.0) states: In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-periodic-function","kind":"concept","label":"Almost periodic function","sources":[{"id":"wikipedia.article.almost-periodic-function","title":"English Wikipedia article: Almost periodic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+periodic+function"}],"status":"reported","summary":"English Wikipedia (article \"Almost periodic function\", CC BY-SA 4.0) states: In mathematics, an almost periodic function is, loosely speaking, a function of a real variable that is periodic to within any desired level of accuracy, given suitably long, well-distributed \"almost-periods\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-tangent-space","kind":"concept","label":"Approximate tangent space","sources":[{"id":"wikipedia.article.approximate-tangent-space","title":"English Wikipedia article: Approximate tangent space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+tangent+space"}],"status":"reported","summary":"English Wikipedia (article \"Approximate tangent space\", CC BY-SA 4.0) states: In geometric measure theory an approximate tangent space is a measure theoretic generalization of the concept of a tangent space for a differentiable manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.supergeometry","kind":"concept","label":"Supergeometry","sources":[{"id":"wikipedia.article.supergeometry","title":"English Wikipedia article: Supergeometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Supergeometry"}],"status":"reported","summary":"English Wikipedia (article \"Supergeometry\", CC BY-SA 4.0) states: Supergeometry is differential geometry of modules over graded commutative algebras, supermanifolds and graded manifolds.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.apollonius-s-theorem","kind":"theory","label":"Apollonius's theorem","sources":[{"id":"wikipedia.article.apollonius-s-theorem","title":"English Wikipedia article: Apollonius's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Apollonius%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Apollonius's theorem\", CC BY-SA 4.0) states: In geometry, Apollonius's theorem is a theorem relating the length of a median of a triangle to the lengths of its sides.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.residue-field","kind":"concept","label":"Residue field","sources":[{"id":"wikipedia.article.residue-field","title":"English Wikipedia article: Residue field","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Residue+field"}],"status":"reported","summary":"English Wikipedia (article \"Residue field\", CC BY-SA 4.0) states: In mathematics, the residue field is a basic construction in commutative algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjoint-state-method","kind":"concept","label":"Adjoint state method","sources":[{"id":"wikipedia.article.adjoint-state-method","title":"English Wikipedia article: Adjoint state method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjoint+state+method"}],"status":"reported","summary":"English Wikipedia (article \"Adjoint state method\", CC BY-SA 4.0) states: The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artinian-module","kind":"concept","label":"Artinian module","sources":[{"id":"wikipedia.article.artinian-module","title":"English Wikipedia article: Artinian module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artinian+module"}],"status":"reported","summary":"English Wikipedia (article \"Artinian module\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.aitken-interpolation","kind":"concept","label":"Aitken interpolation","sources":[{"id":"wikipedia.article.aitken-interpolation","title":"English Wikipedia article: Aitken interpolation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aitken+interpolation"}],"status":"reported","summary":"English Wikipedia (article \"Aitken interpolation\", CC BY-SA 4.0) states: Aitken interpolation is an algorithm used for polynomial interpolation that was derived by the mathematician Alexander Aitken.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.achilles-number","kind":"concept","label":"Achilles number","sources":[{"id":"wikipedia.article.achilles-number","title":"English Wikipedia article: Achilles number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Achilles+number"}],"status":"reported","summary":"English Wikipedia (article \"Achilles number\", CC BY-SA 4.0) states: An Achilles number is a number that is powerful but not a perfect power.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.atlas-topology","kind":"concept","label":"Atlas (topology)","sources":[{"id":"wikipedia.article.atlas-topology","title":"English Wikipedia article: Atlas (topology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atlas+%28topology%29"}],"status":"reported","summary":"English Wikipedia (article \"Atlas (topology)\", CC BY-SA 4.0) states: In mathematics, particularly topology, an atlas is a concept used to describe a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-tree","kind":"concept","label":"Cantor tree","sources":[{"id":"wikipedia.article.cantor-tree","title":"English Wikipedia article: Cantor tree","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+tree"}],"status":"reported","summary":"English Wikipedia (article \"Cantor tree\", CC BY-SA 4.0) states: In mathematical set theory, the Cantor tree is either the full binary tree of height ω + 1, or a topological space related to this by joining its points with intervals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.eilenberg-watts-theorem","kind":"theory","label":"Eilenberg–Watts theorem","sources":[{"id":"wikipedia.article.eilenberg-watts-theorem","title":"English Wikipedia article: Eilenberg–Watts theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eilenberg%E2%80%93Watts+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Eilenberg–Watts theorem\", CC BY-SA 4.0) states: In mathematics, specifically homological algebra, the Eilenberg–Watts theorem tells when a functor between the categories of modules is given by an application of a tensor product.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ax-kochen-theorem","kind":"theory","label":"Ax–Kochen theorem","sources":[{"id":"wikipedia.article.ax-kochen-theorem","title":"English Wikipedia article: Ax–Kochen theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ax%E2%80%93Kochen+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ax–Kochen theorem\", CC BY-SA 4.0) states: The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bagpipe-theorem","kind":"theory","label":"Bagpipe theorem","sources":[{"id":"wikipedia.article.bagpipe-theorem","title":"English Wikipedia article: Bagpipe theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bagpipe+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bagpipe theorem\", CC BY-SA 4.0) states: In mathematics, the bagpipe theorem of Peter Nyikos describes the structure of the connected (but possibly non-paracompact) ω-bounded surfaces by showing that they are \"bagpipes\": the connected sum of a compact \"bag\" with several \"long pipes\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cutting-sequence","kind":"concept","label":"Cutting sequence","sources":[{"id":"wikipedia.article.cutting-sequence","title":"English Wikipedia article: Cutting sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cutting+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Cutting sequence\", CC BY-SA 4.0) states: In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed (\"cut\") as a curve crosses a square grid.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.tau-mathematics","kind":"concept","label":"Tau (mathematics)","sources":[{"id":"wikipedia.article.tau-mathematics","title":"English Wikipedia article: Tau (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Tau+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Tau (mathematics)\", CC BY-SA 4.0) states: The number τ ( ; spelled out as tau) is a mathematical constant, equal to 2π, that has been proposed as an alternative to π by various proponents, who argue that mathematical notation would be simpler, clearer or pedagogically preferable if formulas and quantities (including angles) were described in terms of τ instead of π.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bateman-transform","kind":"concept","label":"Bateman transform","sources":[{"id":"wikipedia.article.bateman-transform","title":"English Wikipedia article: Bateman transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bateman+transform"}],"status":"reported","summary":"English Wikipedia (article \"Bateman transform\", CC BY-SA 4.0) states: In the mathematical study of partial differential equations, the Bateman transform is a method for solving the Laplace equation in four dimensions and wave equation in three by using a line integral of a holomorphic function in three complex variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.adjoint-representation","kind":"concept","label":"Adjoint representation","sources":[{"id":"wikipedia.article.adjoint-representation","title":"English Wikipedia article: Adjoint representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Adjoint+representation"}],"status":"reported","summary":"English Wikipedia (article \"Adjoint representation\", CC BY-SA 4.0) states: In mathematics, the adjoint representation (or adjoint action) of a Lie group G is a way of representing the elements of the group as linear transformations of the group's Lie algebra, considered as a vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.blaschke-sum","kind":"concept","label":"Blaschke sum","sources":[{"id":"wikipedia.article.blaschke-sum","title":"English Wikipedia article: Blaschke sum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blaschke+sum"}],"status":"reported","summary":"English Wikipedia (article \"Blaschke sum\", CC BY-SA 4.0) states: In convex geometry and the geometry of convex polytopes, the Blaschke sum of two polytopes is a polytope that has a facet parallel to each facet of the two given polytopes, with the same measure.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-inverse","kind":"concept","label":"Additive inverse","sources":[{"id":"wikipedia.article.additive-inverse","title":"English Wikipedia article: Additive inverse","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+inverse"}],"status":"reported","summary":"English Wikipedia (article \"Additive inverse\", CC BY-SA 4.0) states: In mathematics, the additive inverse of an element x, denoted −x, is the element that when added to x, yields the additive identity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.amitsur-levitzki-theorem","kind":"theory","label":"Amitsur–Levitzki theorem","sources":[{"id":"wikipedia.article.amitsur-levitzki-theorem","title":"English Wikipedia article: Amitsur–Levitzki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amitsur%E2%80%93Levitzki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Amitsur–Levitzki theorem\", CC BY-SA 4.0) states: In algebra, the Amitsur–Levitzki theorem states that the algebra of n × n matrices over a commutative ring satisfies a certain identity of degree 2n.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandroff-extension","kind":"concept","label":"Alexandroff extension","sources":[{"id":"wikipedia.article.alexandroff-extension","title":"English Wikipedia article: Alexandroff extension","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandroff+extension"}],"status":"reported","summary":"English Wikipedia (article \"Alexandroff extension\", CC BY-SA 4.0) states: In the mathematical field of topology, the Alexandroff extension is a way to extend a noncompact topological space by adjoining a single point in such a way that the resulting space is compact.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.absolute-neighborhood-retract","kind":"concept","label":"Absolute neighborhood retract","sources":[{"id":"wikipedia.article.absolute-neighborhood-retract","title":"English Wikipedia article: Absolute neighborhood retract","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Absolute+neighborhood+retract"}],"status":"reported","summary":"English Wikipedia (article \"Absolute neighborhood retract\", CC BY-SA 4.0) states: In mathematics, especially algebraic topology, an absolute neighborhood retract (or ANR) is a \"nice\" topological space that is considered in homotopy theory; more specifically, in the theory of retracts.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alternating-series","kind":"concept","label":"Alternating series","sources":[{"id":"wikipedia.article.alternating-series","title":"English Wikipedia article: Alternating series","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alternating+series"}],"status":"reported","summary":"English Wikipedia (article \"Alternating series\", CC BY-SA 4.0) states: In mathematics, an alternating series is an infinite series of terms that alternate between positive and negative signs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antiholomorphic-function","kind":"concept","label":"Antiholomorphic function","sources":[{"id":"wikipedia.article.antiholomorphic-function","title":"English Wikipedia article: Antiholomorphic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiholomorphic+function"}],"status":"reported","summary":"English Wikipedia (article \"Antiholomorphic function\", CC BY-SA 4.0) states: In mathematics, antiholomorphic functions (also called antianalytic functions) are a family of functions closely related to but distinct from holomorphic functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.atom-measure-theory","kind":"concept","label":"Atom (measure theory)","sources":[{"id":"wikipedia.article.atom-measure-theory","title":"English Wikipedia article: Atom (measure theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atom+%28measure+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Atom (measure theory)\", CC BY-SA 4.0) states: In mathematics, more precisely in measure theory, an atom is a measurable set that has positive measure and contains no set of smaller positive measures.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.calculus-on-finite-weighted-graphs","kind":"concept","label":"Calculus on finite weighted graphs","sources":[{"id":"wikipedia.article.calculus-on-finite-weighted-graphs","title":"English Wikipedia article: Calculus on finite weighted graphs","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Calculus+on+finite+weighted+graphs"}],"status":"reported","summary":"English Wikipedia (article \"Calculus on finite weighted graphs\", CC BY-SA 4.0) states: In mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices and weights associated to the edges.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chern-simons-theory","kind":"concept","label":"∞-Chern–Simons theory","sources":[{"id":"wikipedia.article.chern-simons-theory","title":"English Wikipedia article: ∞-Chern–Simons theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%88%9E-Chern%E2%80%93Simons+theory"}],"status":"reported","summary":"English Wikipedia (article \"∞-Chern–Simons theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Simons theory (not to be confused with infinite-dimensional Chern–Simons theory) is a generalized formulation of Chern–Simons theory from differential geometry using the formalism of higher category theory, which in particular studies ∞-categories.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.congruence-lattice-problem","kind":"concept","label":"Congruence lattice problem","sources":[{"id":"wikipedia.article.congruence-lattice-problem","title":"English Wikipedia article: Congruence lattice problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Congruence+lattice+problem"}],"status":"reported","summary":"English Wikipedia (article \"Congruence lattice problem\", CC BY-SA 4.0) states: In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ambient-isotopy","kind":"concept","label":"Ambient isotopy","sources":[{"id":"wikipedia.article.ambient-isotopy","title":"English Wikipedia article: Ambient isotopy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambient+isotopy"}],"status":"reported","summary":"English Wikipedia (article \"Ambient isotopy\", CC BY-SA 4.0) states: In the mathematical subject of topology, an ambient isotopy, also called an h-isotopy, is a kind of continuous distortion of an ambient space, for example a manifold, taking a submanifold to another submanifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.a-homotopy-theory","kind":"concept","label":"A¹ homotopy theory","sources":[{"id":"wikipedia.article.a-homotopy-theory","title":"English Wikipedia article: A¹ homotopy theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=A%C2%B9+homotopy+theory"}],"status":"reported","summary":"English Wikipedia (article \"A¹ homotopy theory\", CC BY-SA 4.0) states: In algebraic geometry and algebraic topology, branches of mathematics, A1 homotopy theory or motivic homotopy theory is a way to apply the techniques of algebraic topology, specifically homotopy, to algebraic varieties and, more generally, to schemes.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-lie-algebra","kind":"concept","label":"Affine Lie algebra","sources":[{"id":"wikipedia.article.affine-lie-algebra","title":"English Wikipedia article: Affine Lie algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+Lie+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Affine Lie algebra\", CC BY-SA 4.0) states: In mathematics, an affine Lie algebra is an infinite-dimensional Lie algebra that is constructed in a canonical fashion out of a finite-dimensional simple Lie algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.andronov-pontryagin-criterion","kind":"concept","label":"Andronov–Pontryagin criterion","sources":[{"id":"wikipedia.article.andronov-pontryagin-criterion","title":"English Wikipedia article: Andronov–Pontryagin criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andronov%E2%80%93Pontryagin+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Andronov–Pontryagin criterion\", CC BY-SA 4.0) states: The Andronov–Pontryagin criterion is a necessary and sufficient condition for the stability of dynamical systems in the plane.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-arithmetic","kind":"concept","label":"Affine arithmetic","sources":[{"id":"wikipedia.article.affine-arithmetic","title":"English Wikipedia article: Affine arithmetic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+arithmetic"}],"status":"reported","summary":"English Wikipedia (article \"Affine arithmetic\", CC BY-SA 4.0) states: Affine arithmetic (AA) is a model for self-validated numerical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexander-polynomial","kind":"concept","label":"Alexander polynomial","sources":[{"id":"wikipedia.article.alexander-polynomial","title":"English Wikipedia article: Alexander polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Alexander polynomial\", CC BY-SA 4.0) states: In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.banach-fixed-point-theorem","kind":"theory","label":"Banach fixed-point theorem","sources":[{"id":"wikipedia.article.banach-fixed-point-theorem","title":"English Wikipedia article: Banach fixed-point theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Banach+fixed-point+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Banach fixed-point theorem\", CC BY-SA 4.0) states: In mathematics, the Banach fixed-point theorem (also known as the contraction mapping theorem or contractive mapping theorem or Banach–Caccioppoli theorem) is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spaces and provides a constructive method to find those fixed points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.davenport-schinzel-sequence","kind":"concept","label":"Davenport–Schinzel sequence","sources":[{"id":"wikipedia.article.davenport-schinzel-sequence","title":"English Wikipedia article: Davenport–Schinzel sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Davenport%E2%80%93Schinzel+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Davenport–Schinzel sequence\", CC BY-SA 4.0) states: In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.turn-angle","kind":"concept","label":"Turn (angle)","sources":[{"id":"wikipedia.article.turn-angle","title":"English Wikipedia article: Turn (angle)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Turn+%28angle%29"}],"status":"reported","summary":"English Wikipedia (article \"Turn (angle)\", CC BY-SA 4.0) states: The turn (symbol tr or pla) is a unit of plane angle measurement that is the measure of a complete angle—the angle subtended by a complete circle at its center.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytical-hierarchy","kind":"concept","label":"Analytical hierarchy","sources":[{"id":"wikipedia.article.analytical-hierarchy","title":"English Wikipedia article: Analytical hierarchy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytical+hierarchy"}],"status":"reported","summary":"English Wikipedia (article \"Analytical hierarchy\", CC BY-SA 4.0) states: In mathematical logic and descriptive set theory, the analytical hierarchy is an extension of the arithmetical hierarchy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bessel-function","kind":"concept","label":"Bessel function","sources":[{"id":"wikipedia.article.bessel-function","title":"English Wikipedia article: Bessel function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bessel+function"}],"status":"reported","summary":"English Wikipedia (article \"Bessel function\", CC BY-SA 4.0) states: Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with circular or cylindrical symmetry.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ahlfors-finiteness-theorem","kind":"theory","label":"Ahlfors finiteness theorem","sources":[{"id":"wikipedia.article.ahlfors-finiteness-theorem","title":"English Wikipedia article: Ahlfors finiteness theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ahlfors+finiteness+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ahlfors finiteness theorem\", CC BY-SA 4.0) states: In the mathematical theory of Kleinian groups, the Ahlfors finiteness theorem describes the quotient of the domain of discontinuity by a finitely generated Kleinian group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-group","kind":"concept","label":"Additive group","sources":[{"id":"wikipedia.article.additive-group","title":"English Wikipedia article: Additive group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+group"}],"status":"reported","summary":"English Wikipedia (article \"Additive group\", CC BY-SA 4.0) states: An additive group is a group of which the group operation is to be thought of as addition in some sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebra-extension","kind":"concept","label":"Algebra extension","sources":[{"id":"wikipedia.article.algebra-extension","title":"English Wikipedia article: Algebra extension","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebra+extension"}],"status":"reported","summary":"English Wikipedia (article \"Algebra extension\", CC BY-SA 4.0) states: In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.appert-topology","kind":"field","label":"Appert topology","sources":[{"id":"wikipedia.article.appert-topology","title":"English Wikipedia article: Appert topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Appert+topology"}],"status":"reported","summary":"English Wikipedia (article \"Appert topology\", CC BY-SA 4.0) states: In general topology, a branch of mathematics, the Appert topology, named for Antoine Appert (1934), is a topology on the set X = {1, 2, 3, ...} of positive integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-polytope","kind":"concept","label":"Abstract polytope","sources":[{"id":"wikipedia.article.abstract-polytope","title":"English Wikipedia article: Abstract polytope","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+polytope"}],"status":"reported","summary":"English Wikipedia (article \"Abstract polytope\", CC BY-SA 4.0) states: In mathematics, an abstract polytope is an algebraic partially ordered set which captures certain combinatorial properties of a traditional polytope without specifying purely geometric properties such as the position of vertices.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.aubin-lions-lemma","kind":"theory","label":"Aubin–Lions lemma","sources":[{"id":"wikipedia.article.aubin-lions-lemma","title":"English Wikipedia article: Aubin–Lions lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Aubin%E2%80%93Lions+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Aubin–Lions lemma\", CC BY-SA 4.0) states: In mathematics, the Aubin–Lions lemma (or theorem) is the result in the theory of Sobolev spaces of Banach space-valued functions, which provides a compactness criterion that is useful in the study of nonlinear evolutionary partial differential equations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ambient-space-mathematics","kind":"concept","label":"Ambient space (mathematics)","sources":[{"id":"wikipedia.article.ambient-space-mathematics","title":"English Wikipedia article: Ambient space (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ambient+space+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Ambient space (mathematics)\", CC BY-SA 4.0) states: In mathematics, especially in geometry and topology, an ambient space is the space surrounding a mathematical object along with the object itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chern-weil-theory","kind":"concept","label":"∞-Chern–Weil theory","sources":[{"id":"wikipedia.article.chern-weil-theory","title":"English Wikipedia article: ∞-Chern–Weil theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%88%9E-Chern%E2%80%93Weil+theory"}],"status":"reported","summary":"English Wikipedia (article \"∞-Chern–Weil theory\", CC BY-SA 4.0) states: In mathematics, ∞-Chern–Weil theory is a generalized formulation of Chern–Weil theory from differential geometry using the formalism of higher category theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beckman-quarles-theorem","kind":"theory","label":"Beckman–Quarles theorem","sources":[{"id":"wikipedia.article.beckman-quarles-theorem","title":"English Wikipedia article: Beckman–Quarles theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beckman%E2%80%93Quarles+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Beckman–Quarles theorem\", CC BY-SA 4.0) states: In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.blackwell-girshick-equation","kind":"concept","label":"Blackwell-Girshick equation","sources":[{"id":"wikipedia.article.blackwell-girshick-equation","title":"English Wikipedia article: Blackwell-Girshick equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Blackwell-Girshick+equation"}],"status":"reported","summary":"English Wikipedia (article \"Blackwell-Girshick equation\", CC BY-SA 4.0) states: The Blackwell-Girshick equation is an equation in probability theory that allows for the calculation of the variance of random sums of random variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boolean-differential-calculus","kind":"concept","label":"Boolean differential calculus","sources":[{"id":"wikipedia.article.boolean-differential-calculus","title":"English Wikipedia article: Boolean differential calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean+differential+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Boolean differential calculus\", CC BY-SA 4.0) states: Boolean differential calculus (BDC) (German: Boolescher Differentialkalkül (BDK)) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-logic","kind":"concept","label":"Abstract logic","sources":[{"id":"wikipedia.article.abstract-logic","title":"English Wikipedia article: Abstract logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+logic"}],"status":"reported","summary":"English Wikipedia (article \"Abstract logic\", CC BY-SA 4.0) states: In mathematical logic, an abstract logic is a formal system consisting of a class of sentences and a satisfaction relation with specific properties related to occurrence, expansion, isomorphism, renaming and quantification.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-symmetric-group","kind":"concept","label":"Affine symmetric group","sources":[{"id":"wikipedia.article.affine-symmetric-group","title":"English Wikipedia article: Affine symmetric group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+symmetric+group"}],"status":"reported","summary":"English Wikipedia (article \"Affine symmetric group\", CC BY-SA 4.0) states: The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anosov-diffeomorphism","kind":"concept","label":"Anosov diffeomorphism","sources":[{"id":"wikipedia.article.anosov-diffeomorphism","title":"English Wikipedia article: Anosov diffeomorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anosov+diffeomorphism"}],"status":"reported","summary":"English Wikipedia (article \"Anosov diffeomorphism\", CC BY-SA 4.0) states: In mathematics, more particularly in the fields of dynamical systems and geometric topology, an Anosov map on a manifold M is a certain type of mapping, from M to itself, with rather clearly marked local directions of \"expansion\" and \"contraction\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beauville-laszlo-theorem","kind":"theory","label":"Beauville–Laszlo theorem","sources":[{"id":"wikipedia.article.beauville-laszlo-theorem","title":"English Wikipedia article: Beauville–Laszlo theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beauville%E2%80%93Laszlo+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Beauville–Laszlo theorem\", CC BY-SA 4.0) states: In mathematics, the Beauville–Laszlo theorem is a result in commutative algebra and algebraic geometry that allows one to \"glue\" two sheaves over an infinitesimal neighborhood of a point on an algebraic curve.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.almost-perfect-number","kind":"concept","label":"Almost perfect number","sources":[{"id":"wikipedia.article.almost-perfect-number","title":"English Wikipedia article: Almost perfect number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Almost+perfect+number"}],"status":"reported","summary":"English Wikipedia (article \"Almost perfect number\", CC BY-SA 4.0) states: In mathematics, an almost perfect number (sometimes also called slightly defective or least deficient number) is a natural number n such that the sum of all divisors of n (the sum-of-divisors function σ(n)) is equal to 2n − 1, the sum of all proper divisors of n, s(n) = σ(n) − n, then being equal to n − 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-manifolds","kind":"concept","label":"Category of manifolds","sources":[{"id":"wikipedia.article.category-of-manifolds","title":"English Wikipedia article: Category of manifolds","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+manifolds"}],"status":"reported","summary":"English Wikipedia (article \"Category of manifolds\", CC BY-SA 4.0) states: In mathematics, the category of manifolds, often denoted Manp, is the category whose objects are manifolds of smoothness class Cp and whose morphisms are p-times continuously differentiable maps.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dieudonn-plank","kind":"concept","label":"Dieudonné plank","sources":[{"id":"wikipedia.article.dieudonn-plank","title":"English Wikipedia article: Dieudonné plank","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dieudonn%C3%A9+plank"}],"status":"reported","summary":"English Wikipedia (article \"Dieudonné plank\", CC BY-SA 4.0) states: In mathematics, the Dieudonné plank is a specific topological space introduced by Dieudonné (1944).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bing-metrization-theorem","kind":"theory","label":"Bing metrization theorem","sources":[{"id":"wikipedia.article.bing-metrization-theorem","title":"English Wikipedia article: Bing metrization theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bing+metrization+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bing metrization theorem\", CC BY-SA 4.0) states: In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.dehn-s-lemma","kind":"theory","label":"Dehn's lemma","sources":[{"id":"wikipedia.article.dehn-s-lemma","title":"English Wikipedia article: Dehn's lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dehn%27s+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Dehn's lemma\", CC BY-SA 4.0) states: In mathematics, Dehn's lemma asserts that a piecewise-linear map of a disk into a 3-manifold, with the map's singularity set in the disk's interior, implies the existence of another piecewise-linear map of the disk which is an embedding and is identical to the original on the boundary of the disk.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.disjunctive-sequence","kind":"concept","label":"Disjunctive sequence","sources":[{"id":"wikipedia.article.disjunctive-sequence","title":"English Wikipedia article: Disjunctive sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Disjunctive+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Disjunctive sequence\", CC BY-SA 4.0) states: A disjunctive sequence is an infinite sequence of characters drawn from a finite alphabet, in which every finite string appears as a substring.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.consistency","kind":"concept","label":"Consistency","sources":[{"id":"wikipedia.article.consistency","title":"English Wikipedia article: Consistency","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consistency"}],"status":"reported","summary":"English Wikipedia (article \"Consistency\", CC BY-SA 4.0) states: In deductive logic, a consistent theory is one that does not lead to a logical contradiction.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bar-complex","kind":"concept","label":"Bar complex","sources":[{"id":"wikipedia.article.bar-complex","title":"English Wikipedia article: Bar complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bar+complex"}],"status":"reported","summary":"English Wikipedia (article \"Bar complex\", CC BY-SA 4.0) states: In mathematics, the bar complex, also called the bar resolution, bar construction, standard resolution, or standard complex, is a way of constructing resolutions in homological algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.busemann-petty-problem","kind":"concept","label":"Busemann–Petty problem","sources":[{"id":"wikipedia.article.busemann-petty-problem","title":"English Wikipedia article: Busemann–Petty problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Busemann%E2%80%93Petty+problem"}],"status":"reported","summary":"English Wikipedia (article \"Busemann–Petty problem\", CC BY-SA 4.0) states: In the mathematical field of convex geometry, the Busemann–Petty problem, introduced by Herbert Busemann and Clinton Myers Petty (1956, problem 1), asks whether it is true that a symmetric convex body with larger central hyperplane sections has larger volume.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.additive-identity","kind":"concept","label":"Additive identity","sources":[{"id":"wikipedia.article.additive-identity","title":"English Wikipedia article: Additive identity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Additive+identity"}],"status":"reported","summary":"English Wikipedia (article \"Additive identity\", CC BY-SA 4.0) states: In mathematics, the additive identity of a set that is equipped with the operation of addition is an element which, when added to any element x in the set, yields x. One of the most familiar additive identities is the number 0 from elementary mathematics, but additive identities occur in other mathematical structures where addition is defined, such as in groups and rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.axiom-of-countability","kind":"concept","label":"Axiom of countability","sources":[{"id":"wikipedia.article.axiom-of-countability","title":"English Wikipedia article: Axiom of countability","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiom+of+countability"}],"status":"reported","summary":"English Wikipedia (article \"Axiom of countability\", CC BY-SA 4.0) states: In mathematics, an axiom of countability is a property of certain mathematical objects that asserts the existence of a countable set with certain properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-simplicial-complex","kind":"concept","label":"Abstract simplicial complex","sources":[{"id":"wikipedia.article.abstract-simplicial-complex","title":"English Wikipedia article: Abstract simplicial complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+simplicial+complex"}],"status":"reported","summary":"English Wikipedia (article \"Abstract simplicial complex\", CC BY-SA 4.0) states: In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.abc-conjecture","kind":"question","label":"Abc conjecture","sources":[{"id":"wikipedia.article.abc-conjecture","title":"English Wikipedia article: Abc conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abc+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Abc conjecture\", CC BY-SA 4.0) states: The abc conjecture (also known as the Oesterlé–Masser conjecture) is a conjecture in number theory that arose out of a discussion of Joseph Oesterlé and David Masser in 1985.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-limit","kind":"concept","label":"Approximate limit","sources":[{"id":"wikipedia.article.approximate-limit","title":"English Wikipedia article: Approximate limit","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+limit"}],"status":"reported","summary":"English Wikipedia (article \"Approximate limit\", CC BY-SA 4.0) states: In mathematics, the approximate limit is a generalization of the ordinary limit for real-valued functions of several real variables.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asano-contraction","kind":"concept","label":"Asano contraction","sources":[{"id":"wikipedia.article.asano-contraction","title":"English Wikipedia article: Asano contraction","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asano+contraction"}],"status":"reported","summary":"English Wikipedia (article \"Asano contraction\", CC BY-SA 4.0) states: In complex analysis, a discipline in mathematics, and in statistical physics, the Asano contraction or Asano–Ruelle contraction is a transformation on a separately affine multivariate polynomial.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-interior","kind":"concept","label":"Algebraic interior","sources":[{"id":"wikipedia.article.algebraic-interior","title":"English Wikipedia article: Algebraic interior","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+interior"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic interior\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, the algebraic interior or radial kernel of a subset of a vector space is a refinement of the concept of the interior.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.sat","kind":"concept","label":"♯SAT","sources":[{"id":"wikipedia.article.sat","title":"English Wikipedia article: ♯SAT","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%E2%99%AFSAT"}],"status":"reported","summary":"English Wikipedia (article \"♯SAT\", CC BY-SA 4.0) states: In computer science, the Sharp Satisfiability Problem (sometimes called Sharp-SAT, #SAT or model counting) is the problem of counting the number of interpretations that satisfy a given Boolean formula, introduced by Valiant in 1979.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ascending-chain-condition","kind":"concept","label":"Ascending chain condition","sources":[{"id":"wikipedia.article.ascending-chain-condition","title":"English Wikipedia article: Ascending chain condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ascending+chain+condition"}],"status":"reported","summary":"English Wikipedia (article \"Ascending chain condition\", CC BY-SA 4.0) states: In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bendixson-dulac-theorem","kind":"theory","label":"Bendixson–Dulac theorem","sources":[{"id":"wikipedia.article.bendixson-dulac-theorem","title":"English Wikipedia article: Bendixson–Dulac theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bendixson%E2%80%93Dulac+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bendixson–Dulac theorem\", CC BY-SA 4.0) states: In mathematics, the Bendixson–Dulac theorem is a theorem in dynamical systems that exclude the existence of periodic orbits of two-dimensional flows.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.atiyah-jones-conjecture","kind":"question","label":"Atiyah–Jones conjecture","sources":[{"id":"wikipedia.article.atiyah-jones-conjecture","title":"English Wikipedia article: Atiyah–Jones conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Atiyah%E2%80%93Jones+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Atiyah–Jones conjecture\", CC BY-SA 4.0) states: In mathematics, the Atiyah–Jones conjecture is a conjecture about the homology of the moduli spaces of instantons.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebra-representation","kind":"concept","label":"Algebra representation","sources":[{"id":"wikipedia.article.algebra-representation","title":"English Wikipedia article: Algebra representation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebra+representation"}],"status":"reported","summary":"English Wikipedia (article \"Algebra representation\", CC BY-SA 4.0) states: In abstract algebra, a representation of an associative algebra is a module for that algebra.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bimodule","kind":"concept","label":"Bimodule","sources":[{"id":"wikipedia.article.bimodule","title":"English Wikipedia article: Bimodule","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bimodule"}],"status":"reported","summary":"English Wikipedia (article \"Bimodule\", CC BY-SA 4.0) states: In abstract algebra, a bimodule is an abelian group that is both a left and a right module, such that the left and right multiplications are compatible.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-function","kind":"concept","label":"Algebraic function","sources":[{"id":"wikipedia.article.algebraic-function","title":"English Wikipedia article: Algebraic function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+function"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic function\", CC BY-SA 4.0) states: In mathematics, an algebraic function is a function that satisfies a polynomial equation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.discontinuous-group","kind":"concept","label":"Discontinuous group","sources":[{"id":"wikipedia.article.discontinuous-group","title":"English Wikipedia article: Discontinuous group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discontinuous+group"}],"status":"reported","summary":"English Wikipedia (article \"Discontinuous group\", CC BY-SA 4.0) states: A discontinuous group is a mathematical concept relating to mappings in topological space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.birch-s-theorem","kind":"theory","label":"Birch's theorem","sources":[{"id":"wikipedia.article.birch-s-theorem","title":"English Wikipedia article: Birch's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Birch%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Birch's theorem\", CC BY-SA 4.0) states: In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bing-s-recognition-theorem","kind":"theory","label":"Bing's recognition theorem","sources":[{"id":"wikipedia.article.bing-s-recognition-theorem","title":"English Wikipedia article: Bing's recognition theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bing%27s+recognition+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bing's recognition theorem\", CC BY-SA 4.0) states: In topology, a branch of mathematics, Bing's recognition theorem, named for R. H. Bing, asserts that a necessary and sufficient condition for a 3-manifold M to be homeomorphic to the 3-sphere is that every Jordan curve in M be contained within a topological ball.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.geometric-progression","kind":"concept","label":"Geometric progression","sources":[{"id":"wikipedia.article.geometric-progression","title":"English Wikipedia article: Geometric progression","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+progression"}],"status":"reported","summary":"English Wikipedia (article \"Geometric progression\", CC BY-SA 4.0) states: A geometric progression, also known as a geometric sequence, is a mathematical sequence of non-zero numbers where each term after the first is found by multiplying the previous one by a fixed number called the common ratio.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.curry-howard-correspondence","kind":"concept","label":"Curry–Howard correspondence","sources":[{"id":"wikipedia.article.curry-howard-correspondence","title":"English Wikipedia article: Curry–Howard correspondence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Curry%E2%80%93Howard+correspondence"}],"status":"reported","summary":"English Wikipedia (article \"Curry–Howard correspondence\", CC BY-SA 4.0) states: In programming language theory and proof theory, the Curry–Howard correspondence is a direct relationship between computer programs and mathematical proofs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetical-set","kind":"concept","label":"Arithmetical set","sources":[{"id":"wikipedia.article.arithmetical-set","title":"English Wikipedia article: Arithmetical set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetical+set"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetical set\", CC BY-SA 4.0) states: In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano arithmetic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.andr-quillen-cohomology","kind":"concept","label":"André–Quillen cohomology","sources":[{"id":"wikipedia.article.andr-quillen-cohomology","title":"English Wikipedia article: André–Quillen cohomology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Andr%C3%A9%E2%80%93Quillen+cohomology"}],"status":"reported","summary":"English Wikipedia (article \"André–Quillen cohomology\", CC BY-SA 4.0) states: In commutative algebra and algebraic geometry, André–Quillen cohomology is a cohomology theory for commutative rings and their modules, constructed using the cotangent complex.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-group","kind":"concept","label":"Affine group","sources":[{"id":"wikipedia.article.affine-group","title":"English Wikipedia article: Affine group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+group"}],"status":"reported","summary":"English Wikipedia (article \"Affine group\", CC BY-SA 4.0) states: In mathematics, the affine group or general affine group of any affine space is the group of all invertible affine transformations from the space into itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-structure","kind":"concept","label":"Algebraic structure","sources":[{"id":"wikipedia.article.algebraic-structure","title":"English Wikipedia article: Algebraic structure","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+structure"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic structure\", CC BY-SA 4.0) states: In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","kind":"concept","label":"Axiomatic foundations of topological spaces","sources":[{"id":"wikipedia.article.axiomatic-foundations-of-topological-spaces","title":"English Wikipedia article: Axiomatic foundations of topological spaces","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Axiomatic+foundations+of+topological+spaces"}],"status":"reported","summary":"English Wikipedia (article \"Axiomatic foundations of topological spaces\", CC BY-SA 4.0) states: In the mathematical field of topology, a topological space is usually defined by declaring its open sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abel-s-summation-formula","kind":"concept","label":"Abel's summation formula","sources":[{"id":"wikipedia.article.abel-s-summation-formula","title":"English Wikipedia article: Abel's summation formula","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abel%27s+summation+formula"}],"status":"reported","summary":"English Wikipedia (article \"Abel's summation formula\", CC BY-SA 4.0) states: In mathematics, Abel's summation formula, introduced by Niels Henrik Abel, is intensively used in analytic number theory and the study of special functions to compute series.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximately-continuous-function","kind":"concept","label":"Approximately continuous function","sources":[{"id":"wikipedia.article.approximately-continuous-function","title":"English Wikipedia article: Approximately continuous function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximately+continuous+function"}],"status":"reported","summary":"English Wikipedia (article \"Approximately continuous function\", CC BY-SA 4.0) states: In mathematics, particularly in mathematical analysis and measure theory, an approximately continuous function is a concept that generalizes the notion of continuous functions by replacing the ordinary limit with an approximate limit.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymptotic-expansion","kind":"concept","label":"Asymptotic expansion","sources":[{"id":"wikipedia.article.asymptotic-expansion","title":"English Wikipedia article: Asymptotic expansion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptotic+expansion"}],"status":"reported","summary":"English Wikipedia (article \"Asymptotic expansion\", CC BY-SA 4.0) states: In mathematics, an asymptotic expansion, asymptotic series, or Poincaré expansion is a formal series used to approximate a given function near a specific point or at infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.analytic-semigroup","kind":"concept","label":"Analytic semigroup","sources":[{"id":"wikipedia.article.analytic-semigroup","title":"English Wikipedia article: Analytic semigroup","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Analytic+semigroup"}],"status":"reported","summary":"English Wikipedia (article \"Analytic semigroup\", CC BY-SA 4.0) states: In mathematics, an analytic semigroup is particular kind of strongly continuous semigroup.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.graph-coloring","kind":"concept","label":"Graph coloring","sources":[{"id":"wikipedia.article.graph-coloring","title":"English Wikipedia article: Graph coloring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Graph+coloring"}],"status":"reported","summary":"English Wikipedia (article \"Graph coloring\", CC BY-SA 4.0) states: In graph theory, graph coloring is a methodic assignment of labels traditionally called \"colors\" to elements of a graph.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.british-flag-theorem","kind":"theory","label":"British flag theorem","sources":[{"id":"wikipedia.article.british-flag-theorem","title":"English Wikipedia article: British flag theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=British+flag+theorem"}],"status":"reported","summary":"English Wikipedia (article \"British flag theorem\", CC BY-SA 4.0) states: In Euclidean geometry, the British flag theorem says that if a point P is chosen inside a rectangle ABCD then the sum of the squares of the Euclidean distances from P to two opposite corners of the rectangle equals the sum to the other two opposite corners.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.abstract-nonsense","kind":"concept","label":"Abstract nonsense","sources":[{"id":"wikipedia.article.abstract-nonsense","title":"English Wikipedia article: Abstract nonsense","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Abstract+nonsense"}],"status":"reported","summary":"English Wikipedia (article \"Abstract nonsense\", CC BY-SA 4.0) states: In mathematics, abstract nonsense, general abstract nonsense, generalized abstract nonsense, and general nonsense are nonderogatory terms used by mathematicians to describe long, theoretical parts of a proof they skip over when readers are expected to be familiar with them.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-semantics-mathematical-logic","kind":"concept","label":"Algebraic semantics (mathematical logic)","sources":[{"id":"wikipedia.article.algebraic-semantics-mathematical-logic","title":"English Wikipedia article: Algebraic semantics (mathematical logic)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+semantics+%28mathematical+logic%29"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic semantics (mathematical logic)\", CC BY-SA 4.0) states: In mathematical logic, algebraic semantics is a formal semantics based on algebras studied as part of algebraic logic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.distributive-lattice","kind":"concept","label":"Distributive lattice","sources":[{"id":"wikipedia.article.distributive-lattice","title":"English Wikipedia article: Distributive lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Distributive+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Distributive lattice\", CC BY-SA 4.0) states: In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ball-mathematics","kind":"concept","label":"Ball (mathematics)","sources":[{"id":"wikipedia.article.ball-mathematics","title":"English Wikipedia article: Ball (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ball+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Ball (mathematics)\", CC BY-SA 4.0) states: In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.arithmetic-dynamics","kind":"field","label":"Arithmetic dynamics","sources":[{"id":"wikipedia.article.arithmetic-dynamics","title":"English Wikipedia article: Arithmetic dynamics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+dynamics"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic dynamics\", CC BY-SA 4.0) states: Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anderson-acceleration","kind":"concept","label":"Anderson acceleration","sources":[{"id":"wikipedia.article.anderson-acceleration","title":"English Wikipedia article: Anderson acceleration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anderson+acceleration"}],"status":"reported","summary":"English Wikipedia (article \"Anderson acceleration\", CC BY-SA 4.0) states: In mathematics, Anderson acceleration, also called Anderson mixing, is a method for the acceleration of the convergence rate of fixed-point iterations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.brauer-s-k-b-conjecture","kind":"question","label":"Brauer's k(B) conjecture","sources":[{"id":"wikipedia.article.brauer-s-k-b-conjecture","title":"English Wikipedia article: Brauer's k(B) conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brauer%27s+k%28B%29+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Brauer's k(B) conjecture\", CC BY-SA 4.0) states: Richard Brauer's k(B) Conjecture is a conjecture in modular representation theory of finite groups relating the number of complex irreducible characters in a Brauer block and the order of its defect groups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amicable-numbers","kind":"concept","label":"Amicable numbers","sources":[{"id":"wikipedia.article.amicable-numbers","title":"English Wikipedia article: Amicable numbers","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amicable+numbers"}],"status":"reported","summary":"English Wikipedia (article \"Amicable numbers\", CC BY-SA 4.0) states: In mathematics, the amicable numbers are two different natural numbers related in such a way that the sum of the proper divisors of each is equal to the other number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.discrete-two-point-space","kind":"concept","label":"Discrete two-point space","sources":[{"id":"wikipedia.article.discrete-two-point-space","title":"English Wikipedia article: Discrete two-point space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Discrete+two-point+space"}],"status":"reported","summary":"English Wikipedia (article \"Discrete two-point space\", CC BY-SA 4.0) states: In topology, a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.brauer-s-theorem-on-forms","kind":"theory","label":"Brauer's theorem on forms","sources":[{"id":"wikipedia.article.brauer-s-theorem-on-forms","title":"English Wikipedia article: Brauer's theorem on forms","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brauer%27s+theorem+on+forms"}],"status":"reported","summary":"English Wikipedia (article \"Brauer's theorem on forms\", CC BY-SA 4.0) states: There also is Brauer's theorem on induced characters.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.continuous-function","kind":"concept","label":"Continuous function","sources":[{"id":"wikipedia.article.continuous-function","title":"English Wikipedia article: Continuous function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Continuous+function"}],"status":"reported","summary":"English Wikipedia (article \"Continuous function\", CC BY-SA 4.0) states: In mathematics, a continuous function is a function such that a small variation of its argument induces at most a small variation of its value.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.halton-sequence","kind":"concept","label":"Halton sequence","sources":[{"id":"wikipedia.article.halton-sequence","title":"English Wikipedia article: Halton sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Halton+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Halton sequence\", CC BY-SA 4.0) states: In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cut-elimination-theorem","kind":"theory","label":"Cut-elimination theorem","sources":[{"id":"wikipedia.article.cut-elimination-theorem","title":"English Wikipedia article: Cut-elimination theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cut-elimination+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cut-elimination theorem\", CC BY-SA 4.0) states: The cut-elimination theorem (or Gentzen's Hauptsatz) is the central result establishing the significance of the sequent calculus.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dyadic-cubes","kind":"concept","label":"Dyadic cubes","sources":[{"id":"wikipedia.article.dyadic-cubes","title":"English Wikipedia article: Dyadic cubes","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dyadic+cubes"}],"status":"reported","summary":"English Wikipedia (article \"Dyadic cubes\", CC BY-SA 4.0) states: In mathematics, the dyadic cubes are a collection of cubes in Rn of different sizes or scales such that the set of cubes of each scale partition Rn and each cube in one scale may be written as a union of cubes of a smaller scale.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arf-ring","kind":"concept","label":"Arf ring","sources":[{"id":"wikipedia.article.arf-ring","title":"English Wikipedia article: Arf ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arf+ring"}],"status":"reported","summary":"English Wikipedia (article \"Arf ring\", CC BY-SA 4.0) states: In mathematics, an Arf ring was defined by Lipman (1971) to be a 1-dimensional commutative semi-local Macaulay ring satisfying some extra conditions studied by Cahit Arf (1948).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.berry-robbins-problem","kind":"concept","label":"Berry–Robbins problem","sources":[{"id":"wikipedia.article.berry-robbins-problem","title":"English Wikipedia article: Berry–Robbins problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Berry%E2%80%93Robbins+problem"}],"status":"reported","summary":"English Wikipedia (article \"Berry–Robbins problem\", CC BY-SA 4.0) states: In mathematics, the Berry–Robbins problem asks whether there is a continuous map from configurations of n points in R3 to the flag manifold U(n)/Tn that is compatible with the action of the symmetric group on n points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-curve","kind":"concept","label":"Convex curve","sources":[{"id":"wikipedia.article.convex-curve","title":"English Wikipedia article: Convex curve","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+curve"}],"status":"reported","summary":"English Wikipedia (article \"Convex curve\", CC BY-SA 4.0) states: In geometry, a convex curve is a plane curve that has a supporting line through each of its points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arity","kind":"concept","label":"Arity","sources":[{"id":"wikipedia.article.arity","title":"English Wikipedia article: Arity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arity"}],"status":"reported","summary":"English Wikipedia (article \"Arity\", CC BY-SA 4.0) states: In logic, mathematics, and computer science, arity ( ) is the number of arguments or operands taken by a function, operation or relation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.baire-category-theorem","kind":"theory","label":"Baire category theorem","sources":[{"id":"wikipedia.article.baire-category-theorem","title":"English Wikipedia article: Baire category theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+category+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Baire category theorem\", CC BY-SA 4.0) states: The Baire category theorem (BCT) is an important result in general topology and functional analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.algebraic-number-theory","kind":"field","label":"Algebraic number theory","sources":[{"id":"wikipedia.article.algebraic-number-theory","title":"English Wikipedia article: Algebraic number theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+number+theory"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic number theory\", CC BY-SA 4.0) states: Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baire-one-star-function","kind":"concept","label":"Baire one star function","sources":[{"id":"wikipedia.article.baire-one-star-function","title":"English Wikipedia article: Baire one star function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+one+star+function"}],"status":"reported","summary":"English Wikipedia (article \"Baire one star function\", CC BY-SA 4.0) states: A Baire one star function is a type of function studied in real analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arnold-invariants","kind":"concept","label":"Arnold invariants","sources":[{"id":"wikipedia.article.arnold-invariants","title":"English Wikipedia article: Arnold invariants","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arnold+invariants"}],"status":"reported","summary":"English Wikipedia (article \"Arnold invariants\", CC BY-SA 4.0) states: In mathematics, particularly in topology and knot theory, Arnold invariants are invariants introduced by Vladimir Arnold in 1994 for studying the topology and geometry of plane curves.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-bundle","kind":"concept","label":"Affine bundle","sources":[{"id":"wikipedia.article.affine-bundle","title":"English Wikipedia article: Affine bundle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+bundle"}],"status":"reported","summary":"English Wikipedia (article \"Affine bundle\", CC BY-SA 4.0) states: In differential geometry, an area of mathematics, an affine bundle is a fiber bundle whose typical fiber is an affine space and whose trivialization morphisms and transition functions are affine.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.beki-s-theorem","kind":"theory","label":"Bekić's theorem","sources":[{"id":"wikipedia.article.beki-s-theorem","title":"English Wikipedia article: Bekić's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beki%C4%87%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bekić's theorem\", CC BY-SA 4.0) states: In computability theory, Bekić's theorem or Bekić's lemma is a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymptote","kind":"concept","label":"Asymptote","sources":[{"id":"wikipedia.article.asymptote","title":"English Wikipedia article: Asymptote","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptote"}],"status":"reported","summary":"English Wikipedia (article \"Asymptote\", CC BY-SA 4.0) states: In analytic geometry, an asymptote ( ) of a curve is a straight line such that the distance between the curve and the line approaches zero as one or both of the x or y coordinates tends to infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.biryukov-equation","kind":"concept","label":"Biryukov equation","sources":[{"id":"wikipedia.article.biryukov-equation","title":"English Wikipedia article: Biryukov equation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Biryukov+equation"}],"status":"reported","summary":"English Wikipedia (article \"Biryukov equation\", CC BY-SA 4.0) states: In the study of dynamical systems, the Biryukov equation (or Biryukov oscillator), named after Vadim Biryukov (1946), is a non-linear second-order differential equation used to model damped oscillators.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arnold-diffusion","kind":"concept","label":"Arnold diffusion","sources":[{"id":"wikipedia.article.arnold-diffusion","title":"English Wikipedia article: Arnold diffusion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arnold+diffusion"}],"status":"reported","summary":"English Wikipedia (article \"Arnold diffusion\", CC BY-SA 4.0) states: In applied mathematics, Arnold diffusion is the phenomenon of instability of nearly-integrable Hamiltonian systems.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cuthill-mckee-algorithm","kind":"concept","label":"Cuthill–McKee algorithm","sources":[{"id":"wikipedia.article.cuthill-mckee-algorithm","title":"English Wikipedia article: Cuthill–McKee algorithm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cuthill%E2%80%93McKee+algorithm"}],"status":"reported","summary":"English Wikipedia (article \"Cuthill–McKee algorithm\", CC BY-SA 4.0) states: In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.all-one-polynomial","kind":"concept","label":"All one polynomial","sources":[{"id":"wikipedia.article.all-one-polynomial","title":"English Wikipedia article: All one polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=All+one+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"All one polynomial\", CC BY-SA 4.0) states: In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-number","kind":"concept","label":"Arithmetic number","sources":[{"id":"wikipedia.article.arithmetic-number","title":"English Wikipedia article: Arithmetic number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+number"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic number\", CC BY-SA 4.0) states: In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.brumer-bound","kind":"concept","label":"Brumer bound","sources":[{"id":"wikipedia.article.brumer-bound","title":"English Wikipedia article: Brumer bound","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brumer+bound"}],"status":"reported","summary":"English Wikipedia (article \"Brumer bound\", CC BY-SA 4.0) states: In mathematics, the Brumer bound is a bound for the rank of an elliptic curve, proved by Brumer (1992).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.brouwer-fixed-point-theorem","kind":"theory","label":"Brouwer fixed-point theorem","sources":[{"id":"wikipedia.article.brouwer-fixed-point-theorem","title":"English Wikipedia article: Brouwer fixed-point theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brouwer+fixed-point+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Brouwer fixed-point theorem\", CC BY-SA 4.0) states: Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. Brouwer.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.harmonic-progression-mathematics","kind":"concept","label":"Harmonic progression (mathematics)","sources":[{"id":"wikipedia.article.harmonic-progression-mathematics","title":"English Wikipedia article: Harmonic progression (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+progression+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic progression (mathematics)\", CC BY-SA 4.0) states: In mathematics, a harmonic progression (or harmonic sequence) is a progression formed by taking the reciprocals of an arithmetic progression, which is also known as an arithmetic sequence.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automatic-semigroup","kind":"concept","label":"Automatic semigroup","sources":[{"id":"wikipedia.article.automatic-semigroup","title":"English Wikipedia article: Automatic semigroup","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automatic+semigroup"}],"status":"reported","summary":"English Wikipedia (article \"Automatic semigroup\", CC BY-SA 4.0) states: In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cagniard-de-hoop-method","kind":"concept","label":"Cagniard–De Hoop method","sources":[{"id":"wikipedia.article.cagniard-de-hoop-method","title":"English Wikipedia article: Cagniard–De Hoop method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cagniard%E2%80%93De+Hoop+method"}],"status":"reported","summary":"English Wikipedia (article \"Cagniard–De Hoop method\", CC BY-SA 4.0) states: In the mathematical modeling of seismic waves, the Cagniard–De Hoop method is a sophisticated mathematical tool for solving a large class of wave and diffusive problems in horizontally layered media.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-metric-space","kind":"concept","label":"Convex metric space","sources":[{"id":"wikipedia.article.convex-metric-space","title":"English Wikipedia article: Convex metric space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+metric+space"}],"status":"reported","summary":"English Wikipedia (article \"Convex metric space\", CC BY-SA 4.0) states: In mathematics, there are several notions of \"convexity\" on metric spaces.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-group","kind":"concept","label":"Approximate group","sources":[{"id":"wikipedia.article.approximate-group","title":"English Wikipedia article: Approximate group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+group"}],"status":"reported","summary":"English Wikipedia (article \"Approximate group\", CC BY-SA 4.0) states: In mathematics, an approximate group is a subset of a group which behaves like a subgroup \"up to a constant error\", in a precise quantitative sense (so the term approximate subgroup may be more correct).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.antiisomorphism","kind":"concept","label":"Antiisomorphism","sources":[{"id":"wikipedia.article.antiisomorphism","title":"English Wikipedia article: Antiisomorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Antiisomorphism"}],"status":"reported","summary":"English Wikipedia (article \"Antiisomorphism\", CC BY-SA 4.0) states: In category theory, a branch of mathematics, an antiisomorphism (or anti-isomorphism) between structured sets A and B is an isomorphism from A to the opposite of B (or equivalently from the opposite of A to B).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automorphism","kind":"concept","label":"Automorphism","sources":[{"id":"wikipedia.article.automorphism","title":"English Wikipedia article: Automorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automorphism"}],"status":"reported","summary":"English Wikipedia (article \"Automorphism\", CC BY-SA 4.0) states: In mathematics, an automorphism is an isomorphism from a mathematical object to itself.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asymmetric-norm","kind":"concept","label":"Asymmetric norm","sources":[{"id":"wikipedia.article.asymmetric-norm","title":"English Wikipedia article: Asymmetric norm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymmetric+norm"}],"status":"reported","summary":"English Wikipedia (article \"Asymmetric norm\", CC BY-SA 4.0) states: In mathematics, an asymmetric norm on a vector space is a generalization of the concept of a norm.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amenable-number","kind":"concept","label":"Amenable number","sources":[{"id":"wikipedia.article.amenable-number","title":"English Wikipedia article: Amenable number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amenable+number"}],"status":"reported","summary":"English Wikipedia (article \"Amenable number\", CC BY-SA 4.0) states: An amenable number is a positive integer for which there exists a multiset of as many integers as the original number that both add up to the original number and when multiplied together give the original number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.asplund-space","kind":"concept","label":"Asplund space","sources":[{"id":"wikipedia.article.asplund-space","title":"English Wikipedia article: Asplund space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asplund+space"}],"status":"reported","summary":"English Wikipedia (article \"Asplund space\", CC BY-SA 4.0) states: In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.addition-principle","kind":"concept","label":"Addition principle","sources":[{"id":"wikipedia.article.addition-principle","title":"English Wikipedia article: Addition principle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Addition+principle"}],"status":"reported","summary":"English Wikipedia (article \"Addition principle\", CC BY-SA 4.0) states: In combinatorics, the addition principle or rule of sum is a basic counting principle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.consensus-dynamics","kind":"field","label":"Consensus dynamics","sources":[{"id":"wikipedia.article.consensus-dynamics","title":"English Wikipedia article: Consensus dynamics","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Consensus+dynamics"}],"status":"reported","summary":"English Wikipedia (article \"Consensus dynamics\", CC BY-SA 4.0) states: Consensus dynamics, also known as agreement dynamics, is an area of research at the intersection of systems theory and graph theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-connection","kind":"concept","label":"Affine connection","sources":[{"id":"wikipedia.article.affine-connection","title":"English Wikipedia article: Affine connection","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+connection"}],"status":"reported","summary":"English Wikipedia (article \"Affine connection\", CC BY-SA 4.0) states: In differential geometry, an affine connection is a geometric object on a smooth manifold which connects nearby tangent spaces, so it permits tangent vector fields to be differentiated as if they were functions on the manifold with values in a fixed vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carlyle-circle","kind":"concept","label":"Carlyle circle","sources":[{"id":"wikipedia.article.carlyle-circle","title":"English Wikipedia article: Carlyle circle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carlyle+circle"}],"status":"reported","summary":"English Wikipedia (article \"Carlyle circle\", CC BY-SA 4.0) states: In mathematics, a Carlyle circle is a certain circle in a coordinate plane associated with a quadratic equation; it is named after Thomas Carlyle.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carr-du-champ-operator","kind":"concept","label":"Carré du champ operator","sources":[{"id":"wikipedia.article.carr-du-champ-operator","title":"English Wikipedia article: Carré du champ operator","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carr%C3%A9+du+champ+operator"}],"status":"reported","summary":"English Wikipedia (article \"Carré du champ operator\", CC BY-SA 4.0) states: The carré du champ operator (French for square of a field operator) is a bilinear, symmetric operator from analysis and probability theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.accessible-quasi-category","kind":"concept","label":"Accessible quasi-category","sources":[{"id":"wikipedia.article.accessible-quasi-category","title":"English Wikipedia article: Accessible quasi-category","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Accessible+quasi-category"}],"status":"reported","summary":"English Wikipedia (article \"Accessible quasi-category\", CC BY-SA 4.0) states: In mathematics, especially category theory, an accessible quasi-category is a quasi-category in which each object is an ind-object on some small quasi-category.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.breather-surface","kind":"concept","label":"Breather surface","sources":[{"id":"wikipedia.article.breather-surface","title":"English Wikipedia article: Breather surface","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Breather+surface"}],"status":"reported","summary":"English Wikipedia (article \"Breather surface\", CC BY-SA 4.0) states: In differential geometry, a breather surface is a one-parameter family of mathematical surfaces which correspond to breather solutions of the sine-Gordon equation, a differential equation appearing in theoretical physics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dominance-order","kind":"concept","label":"Dominance order","sources":[{"id":"wikipedia.article.dominance-order","title":"English Wikipedia article: Dominance order","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dominance+order"}],"status":"reported","summary":"English Wikipedia (article \"Dominance order\", CC BY-SA 4.0) states: In discrete mathematics, dominance order (synonyms: dominance ordering, majorization order, natural ordering) is a partial order on the set of partitions of a positive integer n that plays an important role in algebraic combinatorics and representation theory, especially in the context of symmetric functions and representation theory of the symmetric group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.derivative-of-the-exponential-map","kind":"concept","label":"Derivative of the exponential map","sources":[{"id":"wikipedia.article.derivative-of-the-exponential-map","title":"English Wikipedia article: Derivative of the exponential map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Derivative+of+the+exponential+map"}],"status":"reported","summary":"English Wikipedia (article \"Derivative of the exponential map\", CC BY-SA 4.0) states: In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetico-geometric-sequence","kind":"concept","label":"Arithmetico-geometric sequence","sources":[{"id":"wikipedia.article.arithmetico-geometric-sequence","title":"English Wikipedia article: Arithmetico-geometric sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetico-geometric+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetico-geometric sequence\", CC BY-SA 4.0) states: In mathematics, an arithmetico-geometric sequence is the result of element-by-element multiplication of the elements of a geometric progression with the corresponding elements of an arithmetic progression.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hilbert-burch-theorem","kind":"theory","label":"Hilbert–Burch theorem","sources":[{"id":"wikipedia.article.hilbert-burch-theorem","title":"English Wikipedia article: Hilbert–Burch theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hilbert%E2%80%93Burch+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Hilbert–Burch theorem\", CC BY-SA 4.0) states: In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cyclic-surgery-theorem","kind":"theory","label":"Cyclic surgery theorem","sources":[{"id":"wikipedia.article.cyclic-surgery-theorem","title":"English Wikipedia article: Cyclic surgery theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cyclic+surgery+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cyclic surgery theorem\", CC BY-SA 4.0) states: In three-dimensional topology, a branch of mathematics, the cyclic surgery theorem states that, for a compact, connected, orientable, irreducible three-manifold M whose boundary is a torus T, if M is not a Seifert-fibered space and r,s are slopes on T such that their Dehn fillings have cyclic fundamental group, then the distance between r and s (the minimal number of times that two simple closed curves in T representing r and s must intersect) is at most 1.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.furstenberg-boundary","kind":"concept","label":"Furstenberg boundary","sources":[{"id":"wikipedia.article.furstenberg-boundary","title":"English Wikipedia article: Furstenberg boundary","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Furstenberg+boundary"}],"status":"reported","summary":"English Wikipedia (article \"Furstenberg boundary\", CC BY-SA 4.0) states: In mathematics, specifically harmonic analysis and probability theory, the Furstenberg boundary is a notion of boundary associated with a group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chain-complex","kind":"concept","label":"Chain complex","sources":[{"id":"wikipedia.article.chain-complex","title":"English Wikipedia article: Chain complex","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chain+complex"}],"status":"reported","summary":"English Wikipedia (article \"Chain complex\", CC BY-SA 4.0) states: In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-polygon","kind":"concept","label":"Convex polygon","sources":[{"id":"wikipedia.article.convex-polygon","title":"English Wikipedia article: Convex polygon","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+polygon"}],"status":"reported","summary":"English Wikipedia (article \"Convex polygon\", CC BY-SA 4.0) states: In geometry, a convex polygon is a polygon that is the boundary of a convex set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexander-duality","kind":"concept","label":"Alexander duality","sources":[{"id":"wikipedia.article.alexander-duality","title":"English Wikipedia article: Alexander duality","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexander+duality"}],"status":"reported","summary":"English Wikipedia (article \"Alexander duality\", CC BY-SA 4.0) states: In mathematics, Alexander duality refers to a duality theory initiated by a result of J. W. Alexander in 1915, and subsequently further developed, particularly by Pavel Alexandrov and Lev Pontryagin.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.amicable-triple","kind":"concept","label":"Amicable triple","sources":[{"id":"wikipedia.article.amicable-triple","title":"English Wikipedia article: Amicable triple","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Amicable+triple"}],"status":"reported","summary":"English Wikipedia (article \"Amicable triple\", CC BY-SA 4.0) states: In mathematics, an amicable triple is a set of three different numbers so related that the restricted sum of the divisors of each is equal to the sum of the other two numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.associative-property","kind":"concept","label":"Associative property","sources":[{"id":"wikipedia.article.associative-property","title":"English Wikipedia article: Associative property","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Associative+property"}],"status":"reported","summary":"English Wikipedia (article \"Associative property\", CC BY-SA 4.0) states: In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-function","kind":"concept","label":"Cantor function","sources":[{"id":"wikipedia.article.cantor-function","title":"English Wikipedia article: Cantor function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+function"}],"status":"reported","summary":"English Wikipedia (article \"Cantor function\", CC BY-SA 4.0) states: In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.casey-s-theorem","kind":"theory","label":"Casey's theorem","sources":[{"id":"wikipedia.article.casey-s-theorem","title":"English Wikipedia article: Casey's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Casey%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Casey's theorem\", CC BY-SA 4.0) states: In mathematics, Casey's theorem, also known as the generalized Ptolemy's theorem, is a theorem in Euclidean geometry named after the Irish mathematician John Casey.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.betweenness-problem","kind":"concept","label":"Betweenness problem","sources":[{"id":"wikipedia.article.betweenness-problem","title":"English Wikipedia article: Betweenness problem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Betweenness+problem"}],"status":"reported","summary":"English Wikipedia (article \"Betweenness problem\", CC BY-SA 4.0) states: Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dual-lattice","kind":"concept","label":"Dual lattice","sources":[{"id":"wikipedia.article.dual-lattice","title":"English Wikipedia article: Dual lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dual+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Dual lattice\", CC BY-SA 4.0) states: In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bitopological-space","kind":"concept","label":"Bitopological space","sources":[{"id":"wikipedia.article.bitopological-space","title":"English Wikipedia article: Bitopological space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bitopological+space"}],"status":"reported","summary":"English Wikipedia (article \"Bitopological space\", CC BY-SA 4.0) states: In mathematics, a bitopological space is a set endowed with two topologies.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-cycle","kind":"concept","label":"Algebraic cycle","sources":[{"id":"wikipedia.article.algebraic-cycle","title":"English Wikipedia article: Algebraic cycle","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+cycle"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic cycle\", CC BY-SA 4.0) states: In mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V. These are the part of the algebraic topology of V that is directly accessible by algebraic methods.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.autonomous-system-mathematics","kind":"concept","label":"Autonomous system (mathematics)","sources":[{"id":"wikipedia.article.autonomous-system-mathematics","title":"English Wikipedia article: Autonomous system (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Autonomous+system+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Autonomous system (mathematics)\", CC BY-SA 4.0) states: In mathematics, an autonomous system or autonomous differential equation is a system of ordinary differential equations which does not explicitly depend on the independent variable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximation-error","kind":"concept","label":"Approximation error","sources":[{"id":"wikipedia.article.approximation-error","title":"English Wikipedia article: Approximation error","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximation+error"}],"status":"reported","summary":"English Wikipedia (article \"Approximation error\", CC BY-SA 4.0) states: The approximation error in a given data value represents the significant discrepancy that arises when an exact, true value is compared against some approximation derived for it.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.angelescu-polynomials","kind":"concept","label":"Angelescu polynomials","sources":[{"id":"wikipedia.article.angelescu-polynomials","title":"English Wikipedia article: Angelescu polynomials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Angelescu+polynomials"}],"status":"reported","summary":"English Wikipedia (article \"Angelescu polynomials\", CC BY-SA 4.0) states: In mathematics, the Angelescu polynomials πn(x) are a series of polynomials generalizing the Laguerre polynomials introduced by Aurel Angelescu.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automatic-sequence","kind":"concept","label":"Automatic sequence","sources":[{"id":"wikipedia.article.automatic-sequence","title":"English Wikipedia article: Automatic sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automatic+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Automatic sequence\", CC BY-SA 4.0) states: In mathematics and theoretical computer science, an automatic sequence (also called a k-automatic sequence or a k-recognizable sequence when one wants to indicate that the base of the numerals used is k) is an infinite sequence of terms characterized by a finite automaton.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hochster-roberts-theorem","kind":"theory","label":"Hochster–Roberts theorem","sources":[{"id":"wikipedia.article.hochster-roberts-theorem","title":"English Wikipedia article: Hochster–Roberts theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hochster%E2%80%93Roberts+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Hochster–Roberts theorem\", CC BY-SA 4.0) states: In algebra, the Hochster–Roberts theorem, introduced by Melvin Hochster and Joel L. Roberts in 1974, states that rings of invariants of linearly reductive groups acting on regular rings are Cohen–Macaulay.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.catalan-s-conjecture","kind":"question","label":"Catalan's conjecture","sources":[{"id":"wikipedia.article.catalan-s-conjecture","title":"English Wikipedia article: Catalan's conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Catalan%27s+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Catalan's conjecture\", CC BY-SA 4.0) states: Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1842 and proven in 2002 by Preda Mihăilescu at Paderborn University.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.differential-mathematics","kind":"concept","label":"Differential (mathematics)","sources":[{"id":"wikipedia.article.differential-mathematics","title":"English Wikipedia article: Differential (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Differential (mathematics)\", CC BY-SA 4.0) states: In mathematics, differential refers to several related notions derived from the early days of calculus, put on a rigorous footing, such as infinitesimal differences and the derivatives of functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.elementary-class","kind":"concept","label":"Elementary class","sources":[{"id":"wikipedia.article.elementary-class","title":"English Wikipedia article: Elementary class","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Elementary+class"}],"status":"reported","summary":"English Wikipedia (article \"Elementary class\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chirp-z-transform","kind":"concept","label":"Chirp Z-transform","sources":[{"id":"wikipedia.article.chirp-z-transform","title":"English Wikipedia article: Chirp Z-transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chirp+Z-transform"}],"status":"reported","summary":"English Wikipedia (article \"Chirp Z-transform\", CC BY-SA 4.0) states: The chirp Z-transform (CZT) is a generalization of the discrete Fourier transform (DFT).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.gelfand-pair","kind":"concept","label":"Gelfand pair","sources":[{"id":"wikipedia.article.gelfand-pair","title":"English Wikipedia article: Gelfand pair","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gelfand+pair"}],"status":"reported","summary":"English Wikipedia (article \"Gelfand pair\", CC BY-SA 4.0) states: In mathematics, a Gelfand pair is a pair (G, K ) consisting of a group G and a subgroup K (called an Euler subgroup of G) that satisfies a certain property on restricted representations.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.vietoris-rips-filtration","kind":"concept","label":"Vietoris–Rips filtration","sources":[{"id":"wikipedia.article.vietoris-rips-filtration","title":"English Wikipedia article: Vietoris–Rips filtration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Vietoris%E2%80%93Rips+filtration"}],"status":"reported","summary":"English Wikipedia (article \"Vietoris–Rips filtration\", CC BY-SA 4.0) states: In topological data analysis, the Vietoris–Rips filtration (sometimes shortened to \"Rips filtration\") is the collection of nested Vietoris–Rips complexes on a metric space created by taking the sequence of Vietoris–Rips complexes over an increasing scale parameter.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-derivative","kind":"concept","label":"Arithmetic derivative","sources":[{"id":"wikipedia.article.arithmetic-derivative","title":"English Wikipedia article: Arithmetic derivative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+derivative"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic derivative\", CC BY-SA 4.0) states: In number theory, the Lagarias arithmetic derivative or number derivative is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounded-variation","kind":"concept","label":"Bounded variation","sources":[{"id":"wikipedia.article.bounded-variation","title":"English Wikipedia article: Bounded variation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounded+variation"}],"status":"reported","summary":"English Wikipedia (article \"Bounded variation\", CC BY-SA 4.0) states: In mathematical analysis, a function of bounded variation, also known as BV function, is a real-valued function whose total variation is bounded (finite): the graph of a function having this property is well behaved in a precise sense.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.asymptotic-geometry","kind":"field","label":"Asymptotic geometry","sources":[{"id":"wikipedia.article.asymptotic-geometry","title":"English Wikipedia article: Asymptotic geometry","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Asymptotic+geometry"}],"status":"reported","summary":"English Wikipedia (article \"Asymptotic geometry\", CC BY-SA 4.0) states: Asymptotic geometry, also known as asymptotic geometric analysis or high-dimensional geometry, is a field of mathematics that investigates the geometric properties of finite-dimensional objects, such as convex bodies and normed spaces, as the dimension tends to infinity.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cantor-set","kind":"concept","label":"Cantor set","sources":[{"id":"wikipedia.article.cantor-set","title":"English Wikipedia article: Cantor set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor+set"}],"status":"reported","summary":"English Wikipedia (article \"Cantor set\", CC BY-SA 4.0) states: In mathematics, the Cantor set is a self-similar set of points lying on a single line segment that has a number of unintuitive properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cauchy-s-theorem-geometry","kind":"theory","label":"Cauchy's theorem (geometry)","sources":[{"id":"wikipedia.article.cauchy-s-theorem-geometry","title":"English Wikipedia article: Cauchy's theorem (geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy%27s+theorem+%28geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy's theorem (geometry)\", CC BY-SA 4.0) states: Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.categorical-set-theory","kind":"concept","label":"Categorical set theory","sources":[{"id":"wikipedia.article.categorical-set-theory","title":"English Wikipedia article: Categorical set theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Categorical+set+theory"}],"status":"reported","summary":"English Wikipedia (article \"Categorical set theory\", CC BY-SA 4.0) states: Categorical set theory is any one of several versions of set theory developed from or treated in the context of mathematical category theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.boolean-prime-ideal-theorem","kind":"theory","label":"Boolean prime ideal theorem","sources":[{"id":"wikipedia.article.boolean-prime-ideal-theorem","title":"English Wikipedia article: Boolean prime ideal theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boolean+prime+ideal+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Boolean prime ideal theorem\", CC BY-SA 4.0) states: In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bounding-point","kind":"concept","label":"Bounding point","sources":[{"id":"wikipedia.article.bounding-point","title":"English Wikipedia article: Bounding point","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bounding+point"}],"status":"reported","summary":"English Wikipedia (article \"Bounding point\", CC BY-SA 4.0) states: In functional analysis, a branch of mathematics, a bounding point of a subset of a vector space is a conceptual extension of the boundary of a set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.borel-set","kind":"concept","label":"Borel set","sources":[{"id":"wikipedia.article.borel-set","title":"English Wikipedia article: Borel set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Borel+set"}],"status":"reported","summary":"English Wikipedia (article \"Borel set\", CC BY-SA 4.0) states: In mathematics, the Borel sets of a topological space are a particular class of \"well-behaved\" subsets of that space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximation-theory","kind":"concept","label":"Approximation theory","sources":[{"id":"wikipedia.article.approximation-theory","title":"English Wikipedia article: Approximation theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximation+theory"}],"status":"reported","summary":"English Wikipedia (article \"Approximation theory\", CC BY-SA 4.0) states: In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.eigenvalues-and-eigenvectors-of-the-second-derivative","kind":"concept","label":"Eigenvalues and eigenvectors of the second derivative","sources":[{"id":"wikipedia.article.eigenvalues-and-eigenvectors-of-the-second-derivative","title":"English Wikipedia article: Eigenvalues and eigenvectors of the second derivative","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Eigenvalues+and+eigenvectors+of+the+second+derivative"}],"status":"reported","summary":"English Wikipedia (article \"Eigenvalues and eigenvectors of the second derivative\", CC BY-SA 4.0) states: Explicit formulas for eigenvalues and eigenvectors of the second derivative with different boundary conditions are provided both for the continuous and discrete cases.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baire-space-set-theory","kind":"concept","label":"Baire space (set theory)","sources":[{"id":"wikipedia.article.baire-space-set-theory","title":"English Wikipedia article: Baire space (set theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baire+space+%28set+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Baire space (set theory)\", CC BY-SA 4.0) states: In set theory, the Baire space is the set of all infinite sequences of natural numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.excluded-point-topology","kind":"concept","label":"Excluded point topology","sources":[{"id":"wikipedia.article.excluded-point-topology","title":"English Wikipedia article: Excluded point topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Excluded+point+topology"}],"status":"reported","summary":"English Wikipedia (article \"Excluded point topology\", CC BY-SA 4.0) states: In mathematics, the excluded point topology is a topology where exclusion of a particular point defines openness.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.centered-polygonal-number-theorem","kind":"theory","label":"Centered polygonal number theorem","sources":[{"id":"wikipedia.article.centered-polygonal-number-theorem","title":"English Wikipedia article: Centered polygonal number theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centered+polygonal+number+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Centered polygonal number theorem\", CC BY-SA 4.0) states: In additive number theory, the centered polygonal number theorem states that every positive integer is a sum of at most n+2 centered n-gonal numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.donaldson-s-theorem","kind":"theory","label":"Donaldson's theorem","sources":[{"id":"wikipedia.article.donaldson-s-theorem","title":"English Wikipedia article: Donaldson's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Donaldson%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Donaldson's theorem\", CC BY-SA 4.0) states: In mathematics, and especially differential topology and gauge theory, Donaldson's theorem states that a definite intersection form of a closed, oriented, smooth manifold of dimension 4 is diagonalizable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.differential-calculus","kind":"concept","label":"Differential calculus","sources":[{"id":"wikipedia.article.differential-calculus","title":"English Wikipedia article: Differential calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Differential+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Differential calculus\", CC BY-SA 4.0) states: In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.logarithmically-concave-sequence","kind":"concept","label":"Logarithmically concave sequence","sources":[{"id":"wikipedia.article.logarithmically-concave-sequence","title":"English Wikipedia article: Logarithmically concave sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Logarithmically+concave+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Logarithmically concave sequence\", CC BY-SA 4.0) states: In mathematics, a sequence a = (a0, a1, ..., an) of nonnegative real numbers is called a logarithmically concave sequence, or a log-concave sequence for short, if ai2 ≥ ai−1ai+1 holds for 0 < i < n .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dialectica-interpretation","kind":"concept","label":"Dialectica interpretation","sources":[{"id":"wikipedia.article.dialectica-interpretation","title":"English Wikipedia article: Dialectica interpretation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dialectica+interpretation"}],"status":"reported","summary":"English Wikipedia (article \"Dialectica interpretation\", CC BY-SA 4.0) states: In proof theory, the Dialectica interpretation is a proof interpretation of intuitionistic logic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so-called System T. It was developed by Kurt Gödel to provide a consistency proof of arithmetic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chirplet-transform","kind":"concept","label":"Chirplet transform","sources":[{"id":"wikipedia.article.chirplet-transform","title":"English Wikipedia article: Chirplet transform","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chirplet+transform"}],"status":"reported","summary":"English Wikipedia (article \"Chirplet transform\", CC BY-SA 4.0) states: In signal processing, the chirplet transform is an inner product of an input signal with a family of analysis primitives called chirplets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.group-algebra-of-a-locally-compact-group","kind":"concept","label":"Group algebra of a locally compact group","sources":[{"id":"wikipedia.article.group-algebra-of-a-locally-compact-group","title":"English Wikipedia article: Group algebra of a locally compact group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Group+algebra+of+a+locally+compact+group"}],"status":"reported","summary":"English Wikipedia (article \"Group algebra of a locally compact group\", CC BY-SA 4.0) states: In functional analysis and related areas of mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra (or more generally a Banach algebra), such that representations of the algebra are related to representations of the group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cartan-decomposition","kind":"concept","label":"Cartan decomposition","sources":[{"id":"wikipedia.article.cartan-decomposition","title":"English Wikipedia article: Cartan decomposition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cartan+decomposition"}],"status":"reported","summary":"English Wikipedia (article \"Cartan decomposition\", CC BY-SA 4.0) states: In mathematics, the Cartan decomposition is a decomposition of a semisimple Lie group or Lie algebra, which plays an important role in their structure theory and representation theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-set","kind":"concept","label":"Convex set","sources":[{"id":"wikipedia.article.convex-set","title":"English Wikipedia article: Convex set","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+set"}],"status":"reported","summary":"English Wikipedia (article \"Convex set\", CC BY-SA 4.0) states: In geometry, a set of points is convex if it contains every line segment between two points in the set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.automorphisms-of-the-symmetric-and-alternating-groups","kind":"concept","label":"Automorphisms of the symmetric and alternating groups","sources":[{"id":"wikipedia.article.automorphisms-of-the-symmetric-and-alternating-groups","title":"English Wikipedia article: Automorphisms of the symmetric and alternating groups","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Automorphisms+of+the+symmetric+and+alternating+groups"}],"status":"reported","summary":"English Wikipedia (article \"Automorphisms of the symmetric and alternating groups\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S6, the symmetric group on 6 elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.barycentric-coordinate-system","kind":"concept","label":"Barycentric coordinate system","sources":[{"id":"wikipedia.article.barycentric-coordinate-system","title":"English Wikipedia article: Barycentric coordinate system","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barycentric+coordinate+system"}],"status":"reported","summary":"English Wikipedia (article \"Barycentric coordinate system\", CC BY-SA 4.0) states: In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-fuchsian-group","kind":"concept","label":"Arithmetic Fuchsian group","sources":[{"id":"wikipedia.article.arithmetic-fuchsian-group","title":"English Wikipedia article: Arithmetic Fuchsian group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+Fuchsian+group"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic Fuchsian group\", CC BY-SA 4.0) states: Arithmetic Fuchsian groups are a special class of Fuchsian groups constructed using orders in quaternion algebras.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.c-dl-g","kind":"concept","label":"Càdlàg","sources":[{"id":"wikipedia.article.c-dl-g","title":"English Wikipedia article: Càdlàg","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=C%C3%A0dl%C3%A0g"}],"status":"reported","summary":"English Wikipedia (article \"Càdlàg\", CC BY-SA 4.0) states: In mathematics, a càdlàg (French: continue à droite, limite à gauche), RCLL (\"right continuous with left limits\"), or corlol (\"continuous on (the) right, limit on (the) left\") function is a function defined on the real numbers (or a subset of them) that is everywhere right-continuous and has left limits everywhere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bicoherence","kind":"concept","label":"Bicoherence","sources":[{"id":"wikipedia.article.bicoherence","title":"English Wikipedia article: Bicoherence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bicoherence"}],"status":"reported","summary":"English Wikipedia (article \"Bicoherence\", CC BY-SA 4.0) states: In mathematics and statistical analysis, bicoherence (also known as bispectral coherency) is a squared normalised version of the bispectrum.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.carath-odory-s-criterion","kind":"concept","label":"Carathéodory's criterion","sources":[{"id":"wikipedia.article.carath-odory-s-criterion","title":"English Wikipedia article: Carathéodory's criterion","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Carath%C3%A9odory%27s+criterion"}],"status":"reported","summary":"English Wikipedia (article \"Carathéodory's criterion\", CC BY-SA 4.0) states: Carathéodory's criterion is a result in measure theory that was formulated by Greek mathematician Constantin Carathéodory that characterizes when a set is Lebesgue measurable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.centerpoint-geometry","kind":"concept","label":"Centerpoint (geometry)","sources":[{"id":"wikipedia.article.centerpoint-geometry","title":"English Wikipedia article: Centerpoint (geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Centerpoint+%28geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Centerpoint (geometry)\", CC BY-SA 4.0) states: In statistics and computational geometry, the notion of centerpoint is a generalization of the median to data in higher-dimensional Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.chang-s-conjecture","kind":"question","label":"Chang's conjecture","sources":[{"id":"wikipedia.article.chang-s-conjecture","title":"English Wikipedia article: Chang's conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chang%27s+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Chang's conjecture\", CC BY-SA 4.0) states: In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by Vaught (1963, p. 309), states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1,ω).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.anamorphism","kind":"concept","label":"Anamorphism","sources":[{"id":"wikipedia.article.anamorphism","title":"English Wikipedia article: Anamorphism","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Anamorphism"}],"status":"reported","summary":"English Wikipedia (article \"Anamorphism\", CC BY-SA 4.0) states: In computer programming, an anamorphism is a function that generates a sequence by repeated application of the function to its previous result.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arc-length-method","kind":"concept","label":"Arc-length method","sources":[{"id":"wikipedia.article.arc-length-method","title":"English Wikipedia article: Arc-length method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arc-length+method"}],"status":"reported","summary":"English Wikipedia (article \"Arc-length method\", CC BY-SA 4.0) states: In numerical analysis and computational mechanics, the arc-length method, also known as the Riks method, is a numerical method for nonlinear structural analysis in which the structural response does not necessarily increase as the applied load increases, and may instead decrease.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.countably-generated-module","kind":"concept","label":"Countably generated module","sources":[{"id":"wikipedia.article.countably-generated-module","title":"English Wikipedia article: Countably generated module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Countably+generated+module"}],"status":"reported","summary":"English Wikipedia (article \"Countably generated module\", CC BY-SA 4.0) states: In mathematics, a module over a (not necessarily commutative) ring is countably generated if it is generated as a module by a countable subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.freivalds-algorithm","kind":"concept","label":"Freivalds' algorithm","sources":[{"id":"wikipedia.article.freivalds-algorithm","title":"English Wikipedia article: Freivalds' algorithm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Freivalds%27+algorithm"}],"status":"reported","summary":"English Wikipedia (article \"Freivalds' algorithm\", CC BY-SA 4.0) states: Freivalds' algorithm (named after Rūsiņš Mārtiņš Freivalds) is a probabilistic randomized algorithm used to verify matrix multiplication.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.ax-grothendieck-theorem","kind":"theory","label":"Ax–Grothendieck theorem","sources":[{"id":"wikipedia.article.ax-grothendieck-theorem","title":"English Wikipedia article: Ax–Grothendieck theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ax%E2%80%93Grothendieck+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Ax–Grothendieck theorem\", CC BY-SA 4.0) states: In mathematics, the Ax–Grothendieck theorem is a result about injectivity and surjectivity of polynomials that was proved independently by James Ax and Alexander Grothendieck.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.ban-number","kind":"concept","label":"Ban number","sources":[{"id":"wikipedia.article.ban-number","title":"English Wikipedia article: Ban number","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ban+number"}],"status":"reported","summary":"English Wikipedia (article \"Ban number\", CC BY-SA 4.0) states: In recreational mathematics, a ban number is a number that does not contain a particular letter when spelled out in English; in other words, the letter is \"banned.\" Ban numbers are not precisely defined, since some large numbers do not follow the standards of number names (such as googol and googolplex).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fr-chet-manifold","kind":"concept","label":"Fréchet manifold","sources":[{"id":"wikipedia.article.fr-chet-manifold","title":"English Wikipedia article: Fréchet manifold","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fr%C3%A9chet+manifold"}],"status":"reported","summary":"English Wikipedia (article \"Fréchet manifold\", CC BY-SA 4.0) states: In mathematics, in particular in nonlinear analysis, a Fréchet manifold is a topological space modeled on a Fréchet space in much the same way as a manifold is modeled on a Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.jacobson-bourbaki-theorem","kind":"theory","label":"Jacobson–Bourbaki theorem","sources":[{"id":"wikipedia.article.jacobson-bourbaki-theorem","title":"English Wikipedia article: Jacobson–Bourbaki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Jacobson%E2%80%93Bourbaki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Jacobson–Bourbaki theorem\", CC BY-SA 4.0) states: In algebra, the Jacobson–Bourbaki theorem is a theorem used to extend Galois theory to field extensions that need not be separable.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.double-suspension-theorem","kind":"theory","label":"Double suspension theorem","sources":[{"id":"wikipedia.article.double-suspension-theorem","title":"English Wikipedia article: Double suspension theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Double+suspension+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Double suspension theorem\", CC BY-SA 4.0) states: In geometric topology, the double suspension theorem of James W. Cannon (Cannon (1979)) and Robert D. Edwards states that the double suspension S2X of a homology sphere X is a topological sphere.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","kind":"theory","label":"Gauss's lemma (Riemannian geometry)","sources":[{"id":"wikipedia.article.gauss-s-lemma-riemannian-geometry","title":"English Wikipedia article: Gauss's lemma (Riemannian geometry)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Gauss%27s+lemma+%28Riemannian+geometry%29"}],"status":"reported","summary":"English Wikipedia (article \"Gauss's lemma (Riemannian geometry)\", CC BY-SA 4.0) states: In Riemannian geometry, Gauss's lemma asserts that any sufficiently small sphere centered at a point in a Riemannian manifold is perpendicular to every geodesic through the point.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dirichlet-average","kind":"concept","label":"Dirichlet average","sources":[{"id":"wikipedia.article.dirichlet-average","title":"English Wikipedia article: Dirichlet average","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dirichlet+average"}],"status":"reported","summary":"English Wikipedia (article \"Dirichlet average\", CC BY-SA 4.0) states: Dirichlet averages are averages of functions under the Dirichlet distribution.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.monotone-convergence-theorem","kind":"theory","label":"Monotone convergence theorem","sources":[{"id":"wikipedia.article.monotone-convergence-theorem","title":"English Wikipedia article: Monotone convergence theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Monotone+convergence+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Monotone convergence theorem\", CC BY-SA 4.0) states: In real analysis, the monotone convergence theorem is any of a number of related theorems proving, under certain conditions, the convergence of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.church-turing-thesis","kind":"concept","label":"Church–Turing thesis","sources":[{"id":"wikipedia.article.church-turing-thesis","title":"English Wikipedia article: Church–Turing thesis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Church%E2%80%93Turing+thesis"}],"status":"reported","summary":"English Wikipedia (article \"Church–Turing thesis\", CC BY-SA 4.0) states: In computability theory, the Church–Turing thesis is a thesis about the nature of computable functions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.auslander-buchsbaum-theorem","kind":"theory","label":"Auslander–Buchsbaum theorem","sources":[{"id":"wikipedia.article.auslander-buchsbaum-theorem","title":"English Wikipedia article: Auslander–Buchsbaum theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Auslander%E2%80%93Buchsbaum+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Auslander–Buchsbaum theorem\", CC BY-SA 4.0) states: In commutative algebra, the Auslander–Buchsbaum theorem states that regular local rings are unique factorization domains.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.convex-space","kind":"concept","label":"Convex space","sources":[{"id":"wikipedia.article.convex-space","title":"English Wikipedia article: Convex space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Convex+space"}],"status":"reported","summary":"English Wikipedia (article \"Convex space\", CC BY-SA 4.0) states: In mathematics, a convex space (or barycentric algebra) is a space in which it is possible to take convex combinations of any finite set of points.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.b-n-pair","kind":"concept","label":"(B, N) pair","sources":[{"id":"wikipedia.article.b-n-pair","title":"English Wikipedia article: (B, N) pair","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=%28B%2C+N%29+pair"}],"status":"reported","summary":"English Wikipedia (article \"(B, N) pair\", CC BY-SA 4.0) states: In mathematics, a (B, N) pair is a structure on groups of Lie type that allows one to give uniform proofs of many results, instead of giving a large number of case-by-case proofs.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.basis-linear-algebra","kind":"concept","label":"Basis (linear algebra)","sources":[{"id":"wikipedia.article.basis-linear-algebra","title":"English Wikipedia article: Basis (linear algebra)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basis+%28linear+algebra%29"}],"status":"reported","summary":"English Wikipedia (article \"Basis (linear algebra)\", CC BY-SA 4.0) states: In mathematics, a set B of elements of a vector space V is called a basis (pl.: bases) if every element of V can be written in a unique way as a finite linear combination of elements of B. The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to B. The elements of a basis are called basis vectors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.approximate-fibration","kind":"concept","label":"Approximate fibration","sources":[{"id":"wikipedia.article.approximate-fibration","title":"English Wikipedia article: Approximate fibration","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Approximate+fibration"}],"status":"reported","summary":"English Wikipedia (article \"Approximate fibration\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alignments-of-random-points","kind":"concept","label":"Alignments of random points","sources":[{"id":"wikipedia.article.alignments-of-random-points","title":"English Wikipedia article: Alignments of random points","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alignments+of+random+points"}],"status":"reported","summary":"English Wikipedia (article \"Alignments of random points\", CC BY-SA 4.0) states: The study of alignments of random points in a plane seeks to discover subsets of points that occupy an approximately straight line within a larger set of points that are randomly placed in a planar region.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.commandino-s-theorem","kind":"theory","label":"Commandino's theorem","sources":[{"id":"wikipedia.article.commandino-s-theorem","title":"English Wikipedia article: Commandino's theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Commandino%27s+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Commandino's theorem\", CC BY-SA 4.0) states: Commandino's theorem, named after Federico Commandino (1509–1575), states that the four medians of a tetrahedron are concurrent at a point S, which divides them in a 3:1 ratio.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chv-tal-sankoff-constants","kind":"concept","label":"Chvátal–Sankoff constants","sources":[{"id":"wikipedia.article.chv-tal-sankoff-constants","title":"English Wikipedia article: Chvátal–Sankoff constants","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chv%C3%A1tal%E2%80%93Sankoff+constants"}],"status":"reported","summary":"English Wikipedia (article \"Chvátal–Sankoff constants\", CC BY-SA 4.0) states: In mathematics, the Chvátal–Sankoff constants are mathematical constants that describe the lengths of longest common subsequences of random strings.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.class-set-theory","kind":"concept","label":"Class (set theory)","sources":[{"id":"wikipedia.article.class-set-theory","title":"English Wikipedia article: Class (set theory)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Class+%28set+theory%29"}],"status":"reported","summary":"English Wikipedia (article \"Class (set theory)\", CC BY-SA 4.0) states: In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.applied-category-theory","kind":"field","label":"Applied category theory","sources":[{"id":"wikipedia.article.applied-category-theory","title":"English Wikipedia article: Applied category theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Applied+category+theory"}],"status":"reported","summary":"English Wikipedia (article \"Applied category theory\", CC BY-SA 4.0) states: Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control theory, probability theory and causality.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.beta-model","kind":"concept","label":"Beta-model","sources":[{"id":"wikipedia.article.beta-model","title":"English Wikipedia article: Beta-model","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beta-model"}],"status":"reported","summary":"English Wikipedia (article \"Beta-model\", CC BY-SA 4.0) states: In model theory, a mathematical discipline, a β-model (from the French \"bon ordre\", well-ordering) is a model that is correct about statements of the form \"X is well-ordered\".","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bell-polynomials","kind":"concept","label":"Bell polynomials","sources":[{"id":"wikipedia.article.bell-polynomials","title":"English Wikipedia article: Bell polynomials","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bell+polynomials"}],"status":"reported","summary":"English Wikipedia (article \"Bell polynomials\", CC BY-SA 4.0) states: In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.beatty-sequence","kind":"concept","label":"Beatty sequence","sources":[{"id":"wikipedia.article.beatty-sequence","title":"English Wikipedia article: Beatty sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Beatty+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Beatty sequence\", CC BY-SA 4.0) states: In mathematics, a Beatty sequence (or homogeneous Beatty sequence) is the sequence of integers found by taking the floor of the positive multiples of an irrational number that is greater than one.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fort-space","kind":"concept","label":"Fort space","sources":[{"id":"wikipedia.article.fort-space","title":"English Wikipedia article: Fort space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fort+space"}],"status":"reported","summary":"English Wikipedia (article \"Fort space\", CC BY-SA 4.0) states: In mathematics, there are a few topological spaces named after M. K. Fort, Jr.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.chowla-mordell-theorem","kind":"theory","label":"Chowla–Mordell theorem","sources":[{"id":"wikipedia.article.chowla-mordell-theorem","title":"English Wikipedia article: Chowla–Mordell theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chowla%E2%80%93Mordell+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Chowla–Mordell theorem\", CC BY-SA 4.0) states: In mathematics, the Chowla–Mordell theorem says that for a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"question.wikipedia.ehrenpreis-conjecture","kind":"question","label":"Ehrenpreis conjecture","sources":[{"id":"wikipedia.article.ehrenpreis-conjecture","title":"English Wikipedia article: Ehrenpreis conjecture","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Ehrenpreis+conjecture"}],"status":"reported","summary":"English Wikipedia (article \"Ehrenpreis conjecture\", CC BY-SA 4.0) states: In mathematics, the Ehrenpreis conjecture of Leon Ehrenpreis states that for any K greater than 1, any two closed Riemann surfaces of genus at least 2 have finite-degree covers which are K-quasiconformal: that is, the covers are arbitrarily close in the Teichmüller metric.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.compact-group","kind":"concept","label":"Compact group","sources":[{"id":"wikipedia.article.compact-group","title":"English Wikipedia article: Compact group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Compact+group"}],"status":"reported","summary":"English Wikipedia (article \"Compact group\", CC BY-SA 4.0) states: In mathematics, a compact (topological) group is a topological group whose topology realizes it as a compact topological space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cluster-algebra","kind":"concept","label":"Cluster algebra","sources":[{"id":"wikipedia.article.cluster-algebra","title":"English Wikipedia article: Cluster algebra","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cluster+algebra"}],"status":"reported","summary":"English Wikipedia (article \"Cluster algebra\", CC BY-SA 4.0) states: Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky (2002, 2003, 2007).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.charts-on-so-3","kind":"concept","label":"Charts on SO(3)","sources":[{"id":"wikipedia.article.charts-on-so-3","title":"English Wikipedia article: Charts on SO(3)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Charts+on+SO%283%29"}],"status":"reported","summary":"English Wikipedia (article \"Charts on SO(3)\", CC BY-SA 4.0) states: In mathematics, the special orthogonal group in three dimensions, otherwise known as the rotation group SO(3), is a naturally occurring example of a manifold.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baby-step-giant-step","kind":"concept","label":"Baby-step giant-step","sources":[{"id":"wikipedia.article.baby-step-giant-step","title":"English Wikipedia article: Baby-step giant-step","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baby-step+giant-step"}],"status":"reported","summary":"English Wikipedia (article \"Baby-step giant-step\", CC BY-SA 4.0) states: In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.artinian-ring","kind":"concept","label":"Artinian ring","sources":[{"id":"wikipedia.article.artinian-ring","title":"English Wikipedia article: Artinian ring","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Artinian+ring"}],"status":"reported","summary":"English Wikipedia (article \"Artinian ring\", CC BY-SA 4.0) states: In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-sequence","kind":"concept","label":"Cauchy sequence","sources":[{"id":"wikipedia.article.cauchy-sequence","title":"English Wikipedia article: Cauchy sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy sequence\", CC BY-SA 4.0) states: In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.basis-function","kind":"concept","label":"Basis function","sources":[{"id":"wikipedia.article.basis-function","title":"English Wikipedia article: Basis function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Basis+function"}],"status":"reported","summary":"English Wikipedia (article \"Basis function\", CC BY-SA 4.0) states: In mathematics, a basis function is an element of a particular basis for a function space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.boundary-topology","kind":"concept","label":"Boundary (topology)","sources":[{"id":"wikipedia.article.boundary-topology","title":"English Wikipedia article: Boundary (topology)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Boundary+%28topology%29"}],"status":"reported","summary":"English Wikipedia (article \"Boundary (topology)\", CC BY-SA 4.0) states: In topology and mathematics in general, the boundary of a subset S of a topological space X is the set of points in the closure of S not belonging to the interior of S. An element of the boundary of S is called a boundary point of S. The term boundary operation refers to finding or taking the boundary of a set.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.arithmetic-zeta-function","kind":"concept","label":"Arithmetic zeta function","sources":[{"id":"wikipedia.article.arithmetic-zeta-function","title":"English Wikipedia article: Arithmetic zeta function","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Arithmetic+zeta+function"}],"status":"reported","summary":"English Wikipedia (article \"Arithmetic zeta function\", CC BY-SA 4.0) states: In mathematics, the arithmetic zeta function is a zeta function associated with a scheme of finite type over integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cantor-s-intersection-theorem","kind":"theory","label":"Cantor's intersection theorem","sources":[{"id":"wikipedia.article.cantor-s-intersection-theorem","title":"English Wikipedia article: Cantor's intersection theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor%27s+intersection+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cantor's intersection theorem\", CC BY-SA 4.0) states: Cantor's intersection theorem, also called Cantor's nested intervals theorem, refers to two closely related theorems in general topology and real analysis, named after Georg Cantor, about intersections of decreasing nested sequences of non-empty compact sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bispectrum","kind":"concept","label":"Bispectrum","sources":[{"id":"wikipedia.article.bispectrum","title":"English Wikipedia article: Bispectrum","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bispectrum"}],"status":"reported","summary":"English Wikipedia (article \"Bispectrum\", CC BY-SA 4.0) states: In mathematics, in the area of statistical analysis, the bispectrum is a statistic used to search for nonlinear interactions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-markov-kernels","kind":"concept","label":"Category of Markov kernels","sources":[{"id":"wikipedia.article.category-of-markov-kernels","title":"English Wikipedia article: Category of Markov kernels","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+Markov+kernels"}],"status":"reported","summary":"English Wikipedia (article \"Category of Markov kernels\", CC BY-SA 4.0) states: In mathematics, the category of Markov kernels, often denoted Stoch, is the category whose objects are measurable spaces and whose morphisms are Markov kernels.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cover-time","kind":"concept","label":"Cover time","sources":[{"id":"wikipedia.article.cover-time","title":"English Wikipedia article: Cover time","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cover+time"}],"status":"reported","summary":"English Wikipedia (article \"Cover time\", CC BY-SA 4.0) states: In mathematics, the cover time of a finite Markov chain is the number of steps taken by the chain, from a given starting state, until the first step at which all states have been reached.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bridgeland-stability-condition","kind":"concept","label":"Bridgeland stability condition","sources":[{"id":"wikipedia.article.bridgeland-stability-condition","title":"English Wikipedia article: Bridgeland stability condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bridgeland+stability+condition"}],"status":"reported","summary":"English Wikipedia (article \"Bridgeland stability condition\", CC BY-SA 4.0) states: In mathematics, and especially algebraic geometry, a Bridgeland stability condition is an algebro-geometric stability condition defined on elements of a triangulated category.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-grassmannian-manifold","kind":"concept","label":"Affine Grassmannian (manifold)","sources":[{"id":"wikipedia.article.affine-grassmannian-manifold","title":"English Wikipedia article: Affine Grassmannian (manifold)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+Grassmannian+%28manifold%29"}],"status":"reported","summary":"English Wikipedia (article \"Affine Grassmannian (manifold)\", CC BY-SA 4.0) states: In mathematics, there are two distinct meanings of the term affine Grassmannian.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cone-condition","kind":"concept","label":"Cone condition","sources":[{"id":"wikipedia.article.cone-condition","title":"English Wikipedia article: Cone condition","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cone+condition"}],"status":"reported","summary":"English Wikipedia (article \"Cone condition\", CC BY-SA 4.0) states: In mathematics, the cone condition is a property which may be satisfied by a subset of a Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.bourbaki-witt-theorem","kind":"theory","label":"Bourbaki–Witt theorem","sources":[{"id":"wikipedia.article.bourbaki-witt-theorem","title":"English Wikipedia article: Bourbaki–Witt theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bourbaki%E2%80%93Witt+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Bourbaki–Witt theorem\", CC BY-SA 4.0) states: In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered sets.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-principal-value","kind":"concept","label":"Cauchy principal value","sources":[{"id":"wikipedia.article.cauchy-principal-value","title":"English Wikipedia article: Cauchy principal value","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+principal+value"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy principal value\", CC BY-SA 4.0) states: In mathematics, the Cauchy principal value, named after Augustin-Louis Cauchy, is a method for assigning values to certain improper integrals which would otherwise be undefined.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.formal-concept-analysis","kind":"concept","label":"Formal concept analysis","sources":[{"id":"wikipedia.article.formal-concept-analysis","title":"English Wikipedia article: Formal concept analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Formal+concept+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Formal concept analysis\", CC BY-SA 4.0) states: In information science, formal concept analysis (FCA) is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.algebraic-k-theory","kind":"concept","label":"Algebraic K-theory","sources":[{"id":"wikipedia.article.algebraic-k-theory","title":"English Wikipedia article: Algebraic K-theory","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Algebraic+K-theory"}],"status":"reported","summary":"English Wikipedia (article \"Algebraic K-theory\", CC BY-SA 4.0) states: Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-polynomial","kind":"concept","label":"Bernstein polynomial","sources":[{"id":"wikipedia.article.bernstein-polynomial","title":"English Wikipedia article: Bernstein polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein polynomial\", CC BY-SA 4.0) states: In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.decomposition-of-a-module","kind":"concept","label":"Decomposition of a module","sources":[{"id":"wikipedia.article.decomposition-of-a-module","title":"English Wikipedia article: Decomposition of a module","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Decomposition+of+a+module"}],"status":"reported","summary":"English Wikipedia (article \"Decomposition of a module\", CC BY-SA 4.0) states: In abstract algebra, a decomposition of a module is a way to write a module as a direct sum of modules.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.behrend-sequence","kind":"concept","label":"Behrend sequence","sources":[{"id":"wikipedia.article.behrend-sequence","title":"English Wikipedia article: Behrend sequence","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Behrend+sequence"}],"status":"reported","summary":"English Wikipedia (article \"Behrend sequence\", CC BY-SA 4.0) states: In number theory, a Behrend sequence is an integer sequence whose multiples include almost all integers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.global-analysis","kind":"field","label":"Global analysis","sources":[{"id":"wikipedia.article.global-analysis","title":"English Wikipedia article: Global analysis","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Global+analysis"}],"status":"reported","summary":"English Wikipedia (article \"Global analysis\", CC BY-SA 4.0) states: In mathematics, global analysis, also called analysis on manifolds, is the study of the global and topological properties of differential equations on manifolds and vector bundles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.koecher-vinberg-theorem","kind":"theory","label":"Koecher–Vinberg theorem","sources":[{"id":"wikipedia.article.koecher-vinberg-theorem","title":"English Wikipedia article: Koecher–Vinberg theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Koecher%E2%80%93Vinberg+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Koecher–Vinberg theorem\", CC BY-SA 4.0) states: In operator algebra, the Koecher–Vinberg theorem is a reconstruction theorem for real Jordan algebras.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.chowla-selberg-formula","kind":"concept","label":"Chowla–Selberg formula","sources":[{"id":"wikipedia.article.chowla-selberg-formula","title":"English Wikipedia article: Chowla–Selberg formula","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Chowla%E2%80%93Selberg+formula"}],"status":"reported","summary":"English Wikipedia (article \"Chowla–Selberg formula\", CC BY-SA 4.0) states: In mathematics, the Chowla–Selberg formula is the evaluation of a certain product of values of the gamma function at rational values in terms of values of the Dedekind eta function at imaginary quadratic irrational numbers.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.excision-theorem","kind":"theory","label":"Excision theorem","sources":[{"id":"wikipedia.article.excision-theorem","title":"English Wikipedia article: Excision theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Excision+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Excision theorem\", CC BY-SA 4.0) states: In algebraic topology, a branch of mathematics, the excision theorem is a theorem about relative homology and one of the Eilenberg–Steenrod axioms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.euler-spiral","kind":"concept","label":"Euler spiral","sources":[{"id":"wikipedia.article.euler-spiral","title":"English Wikipedia article: Euler spiral","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Euler+spiral"}],"status":"reported","summary":"English Wikipedia (article \"Euler spiral\", CC BY-SA 4.0) states: An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.exponential-field","kind":"concept","label":"Exponential field","sources":[{"id":"wikipedia.article.exponential-field","title":"English Wikipedia article: Exponential field","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Exponential+field"}],"status":"reported","summary":"English Wikipedia (article \"Exponential field\", CC BY-SA 4.0) states: In mathematics, an exponential field is a field with a further unary operation that is a homomorphism from the field's additive group to its multiplicative group.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.epsilon-calculus","kind":"concept","label":"Epsilon calculus","sources":[{"id":"wikipedia.article.epsilon-calculus","title":"English Wikipedia article: Epsilon calculus","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Epsilon+calculus"}],"status":"reported","summary":"English Wikipedia (article \"Epsilon calculus\", CC BY-SA 4.0) states: In logic, Hilbert's epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.harmonic-tensors","kind":"concept","label":"Harmonic tensors","sources":[{"id":"wikipedia.article.harmonic-tensors","title":"English Wikipedia article: Harmonic tensors","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Harmonic+tensors"}],"status":"reported","summary":"English Wikipedia (article \"Harmonic tensors\", CC BY-SA 4.0) states: In this article spherical functions are replaced by polynomials that have been well known in electrostatics since the time of Maxwell and associated with multipole moments.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.baer-norm","kind":"concept","label":"Baer norm","sources":[{"id":"wikipedia.article.baer-norm","title":"English Wikipedia article: Baer norm","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Baer+norm"}],"status":"reported","summary":"English Wikipedia (article \"Baer norm\", CC BY-SA 4.0) states: In mathematics, in the field of group theory, the norm of a group is the intersection of the normalizers of all its subgroups.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.center-algebra","kind":"concept","label":"Center (algebra)","sources":[{"id":"wikipedia.article.center-algebra","title":"English Wikipedia article: Center (algebra)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Center+%28algebra%29"}],"status":"reported","summary":"English Wikipedia (article \"Center (algebra)\", CC BY-SA 4.0) states: The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"field.wikipedia.categorical-topology","kind":"field","label":"Categorical topology","sources":[{"id":"wikipedia.article.categorical-topology","title":"English Wikipedia article: Categorical topology","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Categorical+topology"}],"status":"reported","summary":"English Wikipedia (article \"Categorical topology\", CC BY-SA 4.0) states: In mathematics, categorical topology is an approach to topology (theory of spaces) through the concepts and methods in category theory, a branch of mathematics dealing with abstract concepts.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.category-of-measurable-spaces","kind":"concept","label":"Category of measurable spaces","sources":[{"id":"wikipedia.article.category-of-measurable-spaces","title":"English Wikipedia article: Category of measurable spaces","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Category+of+measurable+spaces"}],"status":"reported","summary":"English Wikipedia (article \"Category of measurable spaces\", CC BY-SA 4.0) states: In mathematics, the category of measurable spaces, often denoted Meas, is the category whose objects are measurable spaces and whose morphisms are measurable maps.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cubicity","kind":"concept","label":"Cubicity","sources":[{"id":"wikipedia.article.cubicity","title":"English Wikipedia article: Cubicity","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cubicity"}],"status":"reported","summary":"English Wikipedia (article \"Cubicity\", CC BY-SA 4.0) states: In the mathematical field of graph theory, cubicity is a graph invariant defined to be the smallest dimension such that a graph can be realized as the intersection graph of axis-parallel unit cubes in Euclidean space.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.affine-sphere","kind":"concept","label":"Affine sphere","sources":[{"id":"wikipedia.article.affine-sphere","title":"English Wikipedia article: Affine sphere","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Affine+sphere"}],"status":"reported","summary":"English Wikipedia (article \"Affine sphere\", CC BY-SA 4.0) states: In affine differential geometry, an affine sphere is a hypersurface for which the affine normals all intersect in a single point The term affine sphere is used because they play an analogous role in affine differential geometry to that of ordinary spheres in Euclidean differential geometry.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bruhat-order","kind":"concept","label":"Bruhat order","sources":[{"id":"wikipedia.article.bruhat-order","title":"English Wikipedia article: Bruhat order","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bruhat+order"}],"status":"reported","summary":"English Wikipedia (article \"Bruhat order\", CC BY-SA 4.0) states: In mathematics, the Bruhat order (also called the strong order, strong Bruhat order, Chevalley order, Bruhat–Chevalley order, or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","kind":"concept","label":"Brouwer–Heyting–Kolmogorov interpretation","sources":[{"id":"wikipedia.article.brouwer-heyting-kolmogorov-interpretation","title":"English Wikipedia article: Brouwer–Heyting–Kolmogorov interpretation","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Brouwer%E2%80%93Heyting%E2%80%93Kolmogorov+interpretation"}],"status":"reported","summary":"English Wikipedia (article \"Brouwer–Heyting–Kolmogorov interpretation\", CC BY-SA 4.0) states: In mathematical logic, the Brouwer–Heyting–Kolmogorov interpretation, or BHK interpretation, is an explanation of the meaning of proof in intuitionistic logic, proposed by L. E. J. Brouwer and Arend Heyting, and independently by Andrey Kolmogorov.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.free-lattice","kind":"concept","label":"Free lattice","sources":[{"id":"wikipedia.article.free-lattice","title":"English Wikipedia article: Free lattice","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Free+lattice"}],"status":"reported","summary":"English Wikipedia (article \"Free lattice\", CC BY-SA 4.0) states: In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bogdanov-map","kind":"concept","label":"Bogdanov map","sources":[{"id":"wikipedia.article.bogdanov-map","title":"English Wikipedia article: Bogdanov map","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bogdanov+map"}],"status":"reported","summary":"English Wikipedia (article \"Bogdanov map\", CC BY-SA 4.0) states: In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-s-constant","kind":"concept","label":"Bernstein's constant","sources":[{"id":"wikipedia.article.bernstein-s-constant","title":"English Wikipedia article: Bernstein's constant","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein%27s+constant"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein's constant\", CC BY-SA 4.0) states: Bernstein's constant, usually denoted by the Greek letter β (beta), is a mathematical constant named after Sergei Natanovich Bernstein and is equal to 0.2801694990... .","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.hadamard-product-matrices","kind":"concept","label":"Hadamard product (matrices)","sources":[{"id":"wikipedia.article.hadamard-product-matrices","title":"English Wikipedia article: Hadamard product (matrices)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hadamard+product+%28matrices%29"}],"status":"reported","summary":"English Wikipedia (article \"Hadamard product (matrices)\", CC BY-SA 4.0) states: In mathematics, the Hadamard product (also known as the element-wise product, entrywise product or Schur product) is a binary operation that takes in two matrices of the same dimensions and returns a matrix of the multiplied corresponding elements.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.bernstein-sato-polynomial","kind":"concept","label":"Bernstein–Sato polynomial","sources":[{"id":"wikipedia.article.bernstein-sato-polynomial","title":"English Wikipedia article: Bernstein–Sato polynomial","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Bernstein%E2%80%93Sato+polynomial"}],"status":"reported","summary":"English Wikipedia (article \"Bernstein–Sato polynomial\", CC BY-SA 4.0) states: In mathematics, the Bernstein–Sato polynomial is a polynomial related to differential operators, introduced independently by Joseph Bernstein (1971) and Mikio Sato and Takuro Shintani (1972, 1974), Sato (1990).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.geometric-topology-object","kind":"concept","label":"Geometric topology (object)","sources":[{"id":"wikipedia.article.geometric-topology-object","title":"English Wikipedia article: Geometric topology (object)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Geometric+topology+%28object%29"}],"status":"reported","summary":"English Wikipedia (article \"Geometric topology (object)\", CC BY-SA 4.0) states: In mathematics, the geometric topology is a topology one can put on the set H of hyperbolic 3-manifolds of finite volume.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.krull-akizuki-theorem","kind":"theory","label":"Krull–Akizuki theorem","sources":[{"id":"wikipedia.article.krull-akizuki-theorem","title":"English Wikipedia article: Krull–Akizuki theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Krull%E2%80%93Akizuki+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Krull–Akizuki theorem\", CC BY-SA 4.0) states: In commutative algebra, the Krull–Akizuki theorem states the following: Let A be a one-dimensional reduced noetherian ring, K its total ring of fractions.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.f-ry-milnor-theorem","kind":"theory","label":"Fáry–Milnor theorem","sources":[{"id":"wikipedia.article.f-ry-milnor-theorem","title":"English Wikipedia article: Fáry–Milnor theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=F%C3%A1ry%E2%80%93Milnor+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Fáry–Milnor theorem\", CC BY-SA 4.0) states: In the mathematical theory of knots, the Fáry–Milnor theorem, named after István Fáry and John Milnor, states that three-dimensional smooth curves with small total curvature must be unknotted.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.hua-s-lemma","kind":"theory","label":"Hua's lemma","sources":[{"id":"wikipedia.article.hua-s-lemma","title":"English Wikipedia article: Hua's lemma","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Hua%27s+lemma"}],"status":"reported","summary":"English Wikipedia (article \"Hua's lemma\", CC BY-SA 4.0) states: In mathematics, Hua's lemma, named for Hua Loo-keng, is an estimate for exponential sums.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.first-order-logic","kind":"concept","label":"First-order logic","sources":[{"id":"wikipedia.article.first-order-logic","title":"English Wikipedia article: First-order logic","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=First-order+logic"}],"status":"reported","summary":"English Wikipedia (article \"First-order logic\", CC BY-SA 4.0) states: In mathematics, philosophy, linguistics, and computer science, first-order logic (FOL), also called predicate logic, predicate calculus, or quantificational logic, is a type of formal system.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.fast-growing-hierarchy","kind":"concept","label":"Fast-growing hierarchy","sources":[{"id":"wikipedia.article.fast-growing-hierarchy","title":"English Wikipedia article: Fast-growing hierarchy","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Fast-growing+hierarchy"}],"status":"reported","summary":"English Wikipedia (article \"Fast-growing hierarchy\", CC BY-SA 4.0) states: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg–Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.delta-functor","kind":"concept","label":"Delta-functor","sources":[{"id":"wikipedia.article.delta-functor","title":"English Wikipedia article: Delta-functor","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Delta-functor"}],"status":"reported","summary":"English Wikipedia (article \"Delta-functor\", CC BY-SA 4.0) states: In homological algebra, a δ-functor between two abelian categories A and B is a collection of functors from A to B together with a collection of morphisms that satisfy properties generalising those of derived functors.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.classical-group","kind":"concept","label":"Classical group","sources":[{"id":"wikipedia.article.classical-group","title":"English Wikipedia article: Classical group","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Classical+group"}],"status":"reported","summary":"English Wikipedia (article \"Classical group\", CC BY-SA 4.0) states: In mathematics, the classical groups are the matrix groups arising from finite-dimensional vector spaces and from nondegenerate bilinear, sesquilinear, quadratic, and Hermitian forms.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.dual-cone-and-polar-cone","kind":"concept","label":"Dual cone and polar cone","sources":[{"id":"wikipedia.article.dual-cone-and-polar-cone","title":"English Wikipedia article: Dual cone and polar cone","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Dual+cone+and+polar+cone"}],"status":"reported","summary":"English Wikipedia (article \"Dual cone and polar cone\", CC BY-SA 4.0) states: Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.closure-mathematics","kind":"concept","label":"Closure (mathematics)","sources":[{"id":"wikipedia.article.closure-mathematics","title":"English Wikipedia article: Closure (mathematics)","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Closure+%28mathematics%29"}],"status":"reported","summary":"English Wikipedia (article \"Closure (mathematics)\", CC BY-SA 4.0) states: In mathematics, a subset of a larger set is closed under a given operation on the larger set if performing that operation on members of the subset always produces a member of that subset.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.big-m-method","kind":"concept","label":"Big M method","sources":[{"id":"wikipedia.article.big-m-method","title":"English Wikipedia article: Big M method","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Big+M+method"}],"status":"reported","summary":"English Wikipedia (article \"Big M method\", CC BY-SA 4.0) states: In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.barycentric-subdivision","kind":"concept","label":"Barycentric subdivision","sources":[{"id":"wikipedia.article.barycentric-subdivision","title":"English Wikipedia article: Barycentric subdivision","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Barycentric+subdivision"}],"status":"reported","summary":"English Wikipedia (article \"Barycentric subdivision\", CC BY-SA 4.0) states: In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.cauchy-product","kind":"concept","label":"Cauchy product","sources":[{"id":"wikipedia.article.cauchy-product","title":"English Wikipedia article: Cauchy product","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cauchy+product"}],"status":"reported","summary":"English Wikipedia (article \"Cauchy product\", CC BY-SA 4.0) states: In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.alexandrov-space","kind":"concept","label":"Alexandrov space","sources":[{"id":"wikipedia.article.alexandrov-space","title":"English Wikipedia article: Alexandrov space","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Alexandrov+space"}],"status":"reported","summary":"English Wikipedia (article \"Alexandrov space\", CC BY-SA 4.0) states: In differential geometry, Alexandrov spaces with curvature ≥ k form a generalization of Riemannian manifolds with sectional curvature ≥ k, where k is some real number.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.constant-chord-theorem","kind":"theory","label":"Constant chord theorem","sources":[{"id":"wikipedia.article.constant-chord-theorem","title":"English Wikipedia article: Constant chord theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Constant+chord+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Constant chord theorem\", CC BY-SA 4.0) states: The constant chord theorem is a statement in elementary geometry about a property of certain chords in two intersecting circles.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"concept.wikipedia.collectively-exhaustive-events","kind":"concept","label":"Collectively exhaustive events","sources":[{"id":"wikipedia.article.collectively-exhaustive-events","title":"English Wikipedia article: Collectively exhaustive events","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Collectively+exhaustive+events"}],"status":"reported","summary":"English Wikipedia (article \"Collectively exhaustive events\", CC BY-SA 4.0) states: In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.cantor-bernstein-theorem","kind":"theory","label":"Cantor–Bernstein theorem","sources":[{"id":"wikipedia.article.cantor-bernstein-theorem","title":"English Wikipedia article: Cantor–Bernstein theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=Cantor%E2%80%93Bernstein+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Cantor–Bernstein theorem\", CC BY-SA 4.0) states: In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types, equals the cardinality of the continuum.","tags":[]},{"aliases":[],"domain":"formal","era":"undated","frontier":false,"id":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","kind":"theory","label":"Büchi–Elgot–Trakhtenbrot theorem","sources":[{"id":"wikipedia.article.b-chi-elgot-trakhtenbrot-theorem","title":"English Wikipedia article: Büchi–Elgot–Trakhtenbrot theorem","url":"https://en.wikipedia.org/w/api.php?action=query&format=json&formatversion=2&utf8=1&prop=extracts%7Cdescription&exintro=1&explaintext=1&exsentences=2&redirects=1&titles=B%C3%BCchi%E2%80%93Elgot%E2%80%93Trakhtenbrot+theorem"}],"status":"reported","summary":"English Wikipedia (article \"Büchi–Elgot–Trakhtenbrot theorem\", CC BY-SA 4.0) states: In formal language theory, the Büchi–Elgot–Trakhtenbrot theorem states that a language is regular if and only if it can be defined by a formula in monadic second-order logic (MSO).","tags":[]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42853148","kind":"claim","label":"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.pmid-42853148"]},"sources":[{"id":"source.frontier.pmid-42853148","title":"Europe PMC record PMID 42853148: IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42853148%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.70962/jhi.20260069","title":"doi:10.70962/jhi.20260069","url":"https://doi.org/10.70962/jhi.20260069"}],"status":"frontier","summary":"PMID 42853148 \"IRF4 p.T95R combined immunodeficiency: Clinical features and transplant outcomes\" (CC BY, first published 2026-10-09) reports: \"Pulmonary disease was universal, and gastrointestinal involvement was associated with a more severe clinical course.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42842684","kind":"claim","label":"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-07","source_ids":["source.frontier.pmid-42842684"]},"sources":[{"id":"source.frontier.pmid-42842684","title":"Europe PMC record PMID 42842684: Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42842684%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1126/sciadv.aeb5514","title":"doi:10.1126/sciadv.aeb5514","url":"https://doi.org/10.1126/sciadv.aeb5514"}],"status":"frontier","summary":"PMID 42842684 \"Rapid protamine evolution suppresses meiotic drive in <i>Drosophila</i>\" (CC BY, first published 2026-10-07) reports: \"Our findings show that relentless pressure to suppress sex chromosome meiotic drive underlies the rapid evolution of protamines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42829444","kind":"claim","label":"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-04","source_ids":["source.frontier.pmid-42829444"]},"sources":[{"id":"source.frontier.pmid-42829444","title":"Europe PMC record PMID 42829444: Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infecti","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42829444%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s40104-026-01502-y","title":"doi:10.1186/s40104-026-01502-y","url":"https://doi.org/10.1186/s40104-026-01502-y"}],"status":"frontier","summary":"PMID 42829444 \"Postbiotics enhance immune competence in black rockfish (Sebastes schlegelii): linking innate immunity, apoptosis, and resistance to bacterial infection\" (CC BY, first published 2026-10-04) reports: \"Collectively, these findings demonstrate that NBL2305-derived postbiotics are safe and effective functional feed additives that enhance growth, modulated innate immune responses, and disease resistance in aquaculture species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827305","kind":"claim","label":"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42827305"]},"sources":[{"id":"source.frontier.pmid-42827305","title":"Europe PMC record PMID 42827305: Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827305%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70554","title":"doi:10.1111/mec.70554","url":"https://doi.org/10.1111/mec.70554"}],"status":"frontier","summary":"PMID 42827305 \"Natural Variation in Drosophila melanogaster Clock PolyQ Length: Geographic Gradients and Functional Properties\" (CC BY, first published 2026-10-01) reports: \"Using data from 127 European populations, we identify 11 Clk polyQ alleles and find that their frequencies are geographically structured, most consistently along an east-west gradient: the Q25 and Q27 alleles show robust clines in longitude and in a bioclimatic axis of continentality, whereas latitudinal and altitudinal trends are weaker.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42826334","kind":"claim","label":"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42826334"]},"sources":[{"id":"source.frontier.pmid-42826334","title":"Europe PMC record PMID 42826334: Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42826334%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050807","title":"doi:10.1097/md.0000000000050807","url":"https://doi.org/10.1097/md.0000000000050807"}],"status":"frontier","summary":"PMID 42826334 \"Association of CYP2C19 genetic polymorphisms with dyslipidemia and ischemic cerebrovascular disease in the mongolian population: A case-control study\" (CC BY, first published 2026-10-01) reports: \"CYP2C19 poor-metaboliser status is associated with an increased risk of ischemic cerebrovascular disease in the Mongolian population and may contribute to dyslipidaemia and treatment response heterogeneity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821620","kind":"claim","label":"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821620"]},"sources":[{"id":"source.frontier.pmid-42821620","title":"Europe PMC record PMID 42821620: Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821620%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014104","title":"doi:10.1371/journal.pntd.0014104","url":"https://doi.org/10.1371/journal.pntd.0014104"}],"status":"frontier","summary":"PMID 42821620 \"Microfilaremic loiasis is associated with T cell hyporesponsiveness against SARS-CoV-2\" (CC BY, first published 2026-10-01) reports: \"The infection is associated with immune modulation, including Th2-skewed responses and elevated regulatory cytokines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821607","kind":"claim","label":"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821607"]},"sources":[{"id":"source.frontier.pmid-42821607","title":"Europe PMC record PMID 42821607: Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821607%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358972","title":"doi:10.1371/journal.pone.0358972","url":"https://doi.org/10.1371/journal.pone.0358972"}],"status":"frontier","summary":"PMID 42821607 \"Statistical patterns in the Ethereum blockchain: Analysis of EOAs and smart contracts in ERC20 token network\" (CC BY, first published 2026-10-01) reports: \"This study reveals distinctive statistical signatures in the transactional dynamics of ERC20 tokens on the Ethereum blockchain by examining over 81 million token transfers across two independent time windows: July 2017 to March 2018 and December 2019 to February 2020.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42821558","kind":"claim","label":"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42821558"]},"sources":[{"id":"source.frontier.pmid-42821558","title":"Europe PMC record PMID 42821558: Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42821558%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0332281","title":"doi:10.1371/journal.pone.0332281","url":"https://doi.org/10.1371/journal.pone.0332281"}],"status":"frontier","summary":"PMID 42821558 \"Rehospitalization due to COVID-19 reinfection in Rio de Janeiro, 2020-2022: Associations with vaccination status, sociodemographic and clinical factors\" (CC BY, first published 2026-10-01) reports: \"The main finding was that a complete vaccination regimen with a booster (≥3 doses) was associated with a 39% reduction in the risk of rehospitalization (sHR: 0.61; 95% CI: 0.52-0.73), while older age, multimorbidity, and Black race/skin color emerged as significant risk factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42809586","kind":"claim","label":"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42809586"]},"sources":[{"id":"source.frontier.pmid-42809586","title":"Europe PMC record PMID 42809586: Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42809586%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/cbic.70557","title":"doi:10.1002/cbic.70557","url":"https://doi.org/10.1002/cbic.70557"}],"status":"frontier","summary":"PMID 42809586 \"Functional Heterogeneity of the Autism Spectrum Disorder-Associated Gut Microbial Ecosystem Revealed by Fecal Lipopolysaccharides and Bacterial Proteomic Profiling\" (CC BY, first published 2026-10-01) reports: \"These findings suggest that gut microbiota in ASD children are associated with a functionally heterogeneous microbial ecosystem characterized by altered immunostimulatory molecular outputs despite the absence of massive taxonomic shifts, with potential relevance for neuroimmune dysregulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42806681","kind":"claim","label":"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42806681"]},"sources":[{"id":"source.frontier.pmid-42806681","title":"Europe PMC record PMID 42806681: Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806681%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jmv.71163","title":"doi:10.1002/jmv.71163","url":"https://doi.org/10.1002/jmv.71163"}],"status":"frontier","summary":"PMID 42806681 \"Cytomegalovirus in Bronchoalveolar Lavage Fluid: A Predictor of Outcome in Immunocompromised Patients\" (CC BY, first published 2026-10-01) reports: \"Overall, 59 cases exhibited isolated CMV infection, which was associated with a higher percentage of macrophages in BALF, compared to cases with CMV and coinfection [75.5%, 95% confidence interval (CI): 44.0-85.0 vs. 37.5%, 95% CI: 11.5%-67.0%, p = 0.008].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42806242","kind":"claim","label":"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42806242"]},"sources":[{"id":"source.frontier.pmid-42806242","title":"Europe PMC record PMID 42806242: Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42806242%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70565","title":"doi:10.1111/mec.70565","url":"https://doi.org/10.1111/mec.70565"}],"status":"frontier","summary":"PMID 42806242 \"Rates of Evolution Differ Between Cell Types Identified by Single-Cell RNAseq in Threespine Stickleback\" (CC BY, first published 2026-10-01) reports: \"These results highlight the value of merging scRNAseq technology with evolutionary population genomic data and reveal that genes which define immune cell types exhibit especially rapid evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755230","kind":"claim","label":"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.pmid-42755230"]},"sources":[{"id":"source.frontier.pmid-42755230","title":"Europe PMC record PMID 42755230: Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755230%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/molbev/msag239","title":"doi:10.1093/molbev/msag239","url":"https://doi.org/10.1093/molbev/msag239"}],"status":"frontier","summary":"PMID 42755230 \"Uncovering structural variation in conifer gigagenomes: evolutionary insights and technical challenges\" (CC BY, first published 2026-10-01) reports: \"Our findings demonstrate the importance of SVs as a dimension of genomic diversity and provide a foundation for integrating structural variation into evolutionary studies, conservation genomics, and tree breeding.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42814760","kind":"claim","label":"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.pmid-42814760"]},"sources":[{"id":"source.frontier.pmid-42814760","title":"Europe PMC record PMID 42814760: Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814760%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/93032","title":"doi:10.2196/93032","url":"https://doi.org/10.2196/93032"}],"status":"frontier","summary":"PMID 42814760 \"Codeveloping a Clinical Pathway for Recurrent Clostridioides difficile Infection With Primary Care Providers: User-Centered Design Study\" (CC BY, first published 2026-09-30) reports: \"This study demonstrated the feasibility and value of codeveloping a provincial clinical pathway with physician partners for managing CDI and rCDI.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42814704","kind":"claim","label":"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.pmid-42814704"]},"sources":[{"id":"source.frontier.pmid-42814704","title":"Europe PMC record PMID 42814704: Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42814704%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357824","title":"doi:10.1371/journal.pone.0357824","url":"https://doi.org/10.1371/journal.pone.0357824"}],"status":"frontier","summary":"PMID 42814704 \"Age- and sex-stratified prevalence of obstructive sleep apnea and stroke risk comorbidities: A large cross-sectional EHR study\" (CC BY, first published 2026-09-30) reports: \"While causal or temporal inferences cannot be drawn, the findings highlight population-level prevalence patterns that may inform hypothesis-driven longitudinal studies and future evaluation of stroke-risk models.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42811346","kind":"claim","label":"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.pmid-42811346"]},"sources":[{"id":"source.frontier.pmid-42811346","title":"Europe PMC record PMID 42811346: Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811346%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s41927-026-00698-w","title":"doi:10.1186/s41927-026-00698-w","url":"https://doi.org/10.1186/s41927-026-00698-w"}],"status":"frontier","summary":"PMID 42811346 \"Predictors at diagnosis for initiation of biologic or targeted synthetic disease-modifying anti-rheumatic drugs in patients with spondyloarthritis and psoriatic arthritis\" (CC BY, first published 2026-09-29) reports: \"Elevated CRP and SIJ BME at diagnosis were associated with bDMARD initiation in patients with SpA, while older patients with PsA may be less likely to start b/tsDMARDs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42811130","kind":"claim","label":"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.pmid-42811130"]},"sources":[{"id":"source.frontier.pmid-42811130","title":"Europe PMC record PMID 42811130: Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42811130%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41559-026-03171-6","title":"doi:10.1038/s41559-026-03171-6","url":"https://doi.org/10.1038/s41559-026-03171-6"}],"status":"frontier","summary":"PMID 42811130 \"Developmental contexts of gene-regulatory evolution following whole genome duplication in salmonids\" (CC BY, first published 2026-09-29) reports: \"Our analyses show that regulatory evolution following the salmonid WGD was shaped by developmental and tissue-specific constraints known to act across vertebrate species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760912","kind":"claim","label":"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.pmid-42760912"]},"sources":[{"id":"source.frontier.pmid-42760912","title":"Europe PMC record PMID 42760912: The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760912%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.188625.2","title":"doi:10.12688/f1000research.188625.2","url":"https://doi.org/10.12688/f1000research.188625.2"}],"status":"frontier","summary":"PMID 42760912 \"The Beekeeping Sector of Kazakhstan and Contributions to the Pharmaceutical Industry: Promising Flavonoids with the Pharmacokinetic Properties Via the Computational Evaluations\" (CC BY, first published 2026-09-28) reports: \"Variations in hydroxyl substitution were associated with marked differences in lipophilicity, aqueous solubility, membrane permeability, and overall pharmacokinetic behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799489","kind":"claim","label":"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42799489"]},"sources":[{"id":"source.frontier.pmid-42799489","title":"Europe PMC record PMID 42799489: Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799489%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crdi/8016755","title":"doi:10.1155/crdi/8016755","url":"https://doi.org/10.1155/crdi/8016755"}],"status":"frontier","summary":"PMID 42799489 \"Diagnostic Complexities in Congenital Tuberculosis: Insights From Preterm Twins Conceived via In Vitro Fertilization and a Literature Review\" (CC BY, first published 2026-09-25) reports: \"These findings highlight the potential value of considering latent TB screening in women undergoing infertility evaluation, particularly before IVF, to prevent severe maternal and neonatal outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42791331","kind":"claim","label":"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42791331"]},"sources":[{"id":"source.frontier.pmid-42791331","title":"Europe PMC record PMID 42791331: Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791331%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s43856-026-01923-w","title":"doi:10.1038/s43856-026-01923-w","url":"https://doi.org/10.1038/s43856-026-01923-w"}],"status":"frontier","summary":"PMID 42791331 \"Clinical characteristics of asymmetric hearing loss in children from a large pediatric cohort\" (CC BY, first published 2026-09-25) reports: \"Here we show, across uni- and bilateral groups, family history of HL is reported for approximately 25% and comorbidities for 40%-50% of children.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42789524","kind":"claim","label":"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42789524"]},"sources":[{"id":"source.frontier.pmid-42789524","title":"Europe PMC record PMID 42789524: Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789524%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358956","title":"doi:10.1371/journal.pone.0358956","url":"https://doi.org/10.1371/journal.pone.0358956"}],"status":"frontier","summary":"PMID 42789524 \"Parental stress, coping strategies, and maternal quality of life in urban Tanzania: A mixed-methods study\" (CC BY, first published 2026-09-25) reports: \"Problem-focused and emotion-focused coping strategies were associated with better QoL.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42789505","kind":"claim","label":"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.pmid-42789505"]},"sources":[{"id":"source.frontier.pmid-42789505","title":"Europe PMC record PMID 42789505: Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42789505%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358890","title":"doi:10.1371/journal.pone.0358890","url":"https://doi.org/10.1371/journal.pone.0358890"}],"status":"frontier","summary":"PMID 42789505 \"Co-evolution of RcsD and RcsF shapes signal transduction in the enterobacteriaceae Rcs system\" (CC BY, first published 2026-09-25) reports: \"These findings demonstrate how co-evolution of an auxiliary protein generates novel regulatory function in the Rcs phosphorelay and provide insights into the role of RcsD periplasmic domain in stress signal transduction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784649","kind":"claim","label":"Negative emotions concentrate while positive emotions diffuse in football fan rivalries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.pmid-42784649"]},"sources":[{"id":"source.frontier.pmid-42784649","title":"Europe PMC record PMID 42784649: Negative emotions concentrate while positive emotions diffuse in football fan rivalries","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784649%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356757","title":"doi:10.1371/journal.pone.0356757","url":"https://doi.org/10.1371/journal.pone.0356757"}],"status":"frontier","summary":"PMID 42784649 \"Negative emotions concentrate while positive emotions diffuse in football fan rivalries\" (CC BY, first published 2026-09-24) reports: \"These findings highlight how cognitive constraints shape collective emotional structures, with implications for political polarization, consumer behavior, and conflict dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784570","kind":"claim","label":"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.pmid-42784570"]},"sources":[{"id":"source.frontier.pmid-42784570","title":"Europe PMC record PMID 42784570: Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Et","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784570%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pdig.0001748","title":"doi:10.1371/journal.pdig.0001748","url":"https://doi.org/10.1371/journal.pdig.0001748"}],"status":"frontier","summary":"PMID 42784570 \"Generative artificial intelligence-assisted medical self-care and associated factors among undergraduate students at Arsi University, South-Eastern Ethiopia\" (CC BY, first published 2026-09-24) reports: \"The findings suggest a high prevalence of GenAI-assisted self-care among university students and highlight the need for guidelines and training on digital health literacy for effective and safe technology use in healthcare.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778666","kind":"claim","label":"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42778666"]},"sources":[{"id":"source.frontier.pmid-42778666","title":"Europe PMC record PMID 42778666: Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778666%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s42003-026-10927-0","title":"doi:10.1038/s42003-026-10927-0","url":"https://doi.org/10.1038/s42003-026-10927-0"}],"status":"frontier","summary":"PMID 42778666 \"Evolutionary dynamics of plant cell wall-degrading enzymes reflects feeding ecology in weevils\" (CC BY, first published 2026-09-23) reports: \"These findings demonstrate that HGTs, gene duplications, and losses shaped PCWDE diversity and facilitated the ecological success of weevils.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778332","kind":"claim","label":"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42778332"]},"sources":[{"id":"source.frontier.pmid-42778332","title":"Europe PMC record PMID 42778332: Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778332%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/rmdopen-2026-007162","title":"doi:10.1136/rmdopen-2026-007162","url":"https://doi.org/10.1136/rmdopen-2026-007162"}],"status":"frontier","summary":"PMID 42778332 \"Evaluating a guideline-aligned prednisone threshold within the Lupus Low Disease Activity State (LLDAS): associations with damage accrual\" (CC BY, first published 2026-09-23) reports: \"Among incident cases, 29/105 patients accrued damage (29 occasions); both LLDAS-5 (RR 0.31, 95% CI 0.11 to 0.89; p=0.029) and LLDAS-7.5 (RR 0.29, 95% CI 0.09 to 0.93; p=0.036) were associated with lower damage accrual.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42777016","kind":"claim","label":"Deterministic dynamics of distributional multi-agent reinforcement learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42777016"]},"sources":[{"id":"source.frontier.pmid-42777016","title":"Europe PMC record PMID 42777016: Deterministic dynamics of distributional multi-agent reinforcement learning","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42777016%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014723","title":"doi:10.1371/journal.pcbi.1014723","url":"https://doi.org/10.1371/journal.pcbi.1014723"}],"status":"frontier","summary":"PMID 42777016 \"Deterministic dynamics of distributional multi-agent reinforcement learning\" (CC BY, first published 2026-09-23) reports: \"Beyond validation, we uncover novel interactions among optimism, return discretization, and temporal discounting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42773366","kind":"claim","label":"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.pmid-42773366"]},"sources":[{"id":"source.frontier.pmid-42773366","title":"Europe PMC record PMID 42773366: ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42773366%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s10802-026-01510-6","title":"doi:10.1007/s10802-026-01510-6","url":"https://doi.org/10.1007/s10802-026-01510-6"}],"status":"frontier","summary":"PMID 42773366 \"ADHD Symptoms in Parents of Children With or Without ADHD: Prospective Association With Children's Quality of Life and Emotional and Conduct Problems (EPINED Cohort)\" (CC BY, first published 2026-09-23) reports: \"Child ADHD diagnosis was associated with conduct problems (OR = 2.62) and their persistence (OR = 6.84).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794852","kind":"claim","label":"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42794852"]},"sources":[{"id":"source.frontier.pmid-42794852","title":"Europe PMC record PMID 42794852: Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794852%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27188426","title":"doi:10.3390/ijms27188426","url":"https://doi.org/10.3390/ijms27188426"}],"status":"frontier","summary":"PMID 42794852 \"Mechanisms of Brain Aging and Their Links to Alzheimer's and Parkinson's Disease Pathology\" (CC BY, first published 2026-09-21) reports: \"Brain aging is a major risk factor for neurodegenerative disorders and is associated with a progressive loss of neuronal homeostasis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792502","kind":"claim","label":"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42792502"]},"sources":[{"id":"source.frontier.pmid-42792502","title":"Europe PMC record PMID 42792502: Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792502%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091703","title":"doi:10.3390/bs16091703","url":"https://doi.org/10.3390/bs16091703"}],"status":"frontier","summary":"PMID 42792502 \"Life Goal Content and Health Outcomes: Associations with Mental Health and Health Behaviours Among Turkish University Students\" (CC BY, first published 2026-09-21) reports: \"Goal setting was associated with all five indicators (β = 0.110 to 0.384), and the association was stronger for the mental health block than the behavioural block (Δβ = 0.129, 95% CI [0.049, 0.205]).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766660","kind":"claim","label":"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766660"]},"sources":[{"id":"source.frontier.pmid-42766660","title":"Europe PMC record PMID 42766660: The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766660%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014807","title":"doi:10.1371/journal.pcbi.1014807","url":"https://doi.org/10.1371/journal.pcbi.1014807"}],"status":"frontier","summary":"PMID 42766660 \"The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart\" (CC BY, first published 2026-09-21) reports: \"The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766622","kind":"claim","label":"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766622"]},"sources":[{"id":"source.frontier.pmid-42766622","title":"Europe PMC record PMID 42766622: Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766622%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356518","title":"doi:10.1371/journal.pone.0356518","url":"https://doi.org/10.1371/journal.pone.0356518"}],"status":"frontier","summary":"PMID 42766622 \"Determinants of secondhand clothing consumption in Hong Kong: An extended Knowledge-Attitude-Practice (KAP) model\" (CC BY, first published 2026-09-21) reports: \"These findings suggest that secondhand clothing purchase in Hong Kong is driven more by environmental knowledge and risk perceptions than by economic considerations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766584","kind":"claim","label":"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766584"]},"sources":[{"id":"source.frontier.pmid-42766584","title":"Europe PMC record PMID 42766584: Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766584%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356632","title":"doi:10.1371/journal.pone.0356632","url":"https://doi.org/10.1371/journal.pone.0356632"}],"status":"frontier","summary":"PMID 42766584 \"Exploring sex-specific symptom trajectories in psychosis following metacognitive training (MCT): Evidence from a large-scale retrospective harmonized database\" (CC BY, first published 2026-09-21) reports: \"Across the full sample, Metacognitive Training for psychosis was associated with significant reductions in positive, negative, general, and overall psychotic symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42766546","kind":"claim","label":"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42766546"]},"sources":[{"id":"source.frontier.pmid-42766546","title":"Europe PMC record PMID 42766546: Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42766546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358539","title":"doi:10.1371/journal.pone.0358539","url":"https://doi.org/10.1371/journal.pone.0358539"}],"status":"frontier","summary":"PMID 42766546 \"Impact of multi-professional medication reviews (MPMRs) on medication prescriptions in psychiatry\" (CC BY, first published 2026-09-21) reports: \"MPMR implementation was associated with a significant reduction in the total number of prescribed medications (-1.1 drugs, p = 0.044 or 0.001 with a MLM, Cohen's d = 0.18).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764320","kind":"claim","label":"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.pmid-42764320"]},"sources":[{"id":"source.frontier.pmid-42764320","title":"Europe PMC record PMID 42764320: Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764320%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s10143-026-04441-4","title":"doi:10.1007/s10143-026-04441-4","url":"https://doi.org/10.1007/s10143-026-04441-4"}],"status":"frontier","summary":"PMID 42764320 \"Central neurocytomas: Decision-making process of postoperative treatment. Lesson learned\" (CC BY, first published 2026-09-21) reports: \"Our findings suggest that GTR alone may be sufficient even in patients with moderately elevated Ki-67.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796055","kind":"claim","label":"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.pmid-42796055"]},"sources":[{"id":"source.frontier.pmid-42796055","title":"Europe PMC record PMID 42796055: Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Im","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796055%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187283","title":"doi:10.3390/jcm15187283","url":"https://doi.org/10.3390/jcm15187283"}],"status":"frontier","summary":"PMID 42796055 \"Cardiovascular Risk in Psoriatic Arthritis in the Treat-to-Target Era: A Focused Expert Narrative Review of Epidemiology, Risk Assessment, Vascular Imaging, and Prevention\" (CC BY, first published 2026-09-19) reports: \"Psoriatic arthritis (PsA) is associated with excess cardiovascular (CV) morbidity, but the supporting literature spans heterogeneous observational, imaging, prediction, therapeutic, and guideline sources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42762163","kind":"claim","label":"A network dynamical simulation model for the study of antibiotic resistance in microbial communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.pmid-42762163"]},"sources":[{"id":"source.frontier.pmid-42762163","title":"Europe PMC record PMID 42762163: A network dynamical simulation model for the study of antibiotic resistance in microbial communities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42762163%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/19490976.2026.2734703","title":"doi:10.1080/19490976.2026.2734703","url":"https://doi.org/10.1080/19490976.2026.2734703"}],"status":"frontier","summary":"PMID 42762163 \"A network dynamical simulation model for the study of antibiotic resistance in microbial communities\" (CC BY, first published 2026-09-19) reports: \"Our results show that network structure strongly modulates resistance dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827649","kind":"claim","label":"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42827649"]},"sources":[{"id":"source.frontier.pmid-42827649","title":"Europe PMC record PMID 42827649: Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827649%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1845909","title":"doi:10.3389/fneur.2026.1845909","url":"https://doi.org/10.3389/fneur.2026.1845909"}],"status":"frontier","summary":"PMID 42827649 \"Differential effects of static and dynamic visual prompts on attention-motor performance: the role of sustained attention after stroke\" (CC BY, first published 2026-09-18) reports: \"In healthy individuals, dynamic prompts were associated with faster response times, higher prefrontal oxygenated hemoglobin levels, and more efficient brain network topology (i.e., higher clustering coefficient [CC] and shorter characteristic path length [PL]), indicating enhanced attentional allocation and information integration.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42827524","kind":"claim","label":"Impression management in distributive justice: balancing fairness and social perception","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42827524"]},"sources":[{"id":"source.frontier.pmid-42827524","title":"Europe PMC record PMID 42827524: Impression management in distributive justice: balancing fairness and social perception","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42827524%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1848060","title":"doi:10.3389/fpsyg.2026.1848060","url":"https://doi.org/10.3389/fpsyg.2026.1848060"}],"status":"frontier","summary":"PMID 42827524 \"Impression management in distributive justice: balancing fairness and social perception\" (CC BY, first published 2026-09-18) reports: \"Thus, the findings suggest that social-evaluative orientation may influence allocation preferences, but this apparent influence was weaker without evaluator-linked monetary incentives and requires confirmation in more adequately powered studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42797642","kind":"claim","label":"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42797642"]},"sources":[{"id":"source.frontier.pmid-42797642","title":"Europe PMC record PMID 42797642: Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42797642%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/vaccines14090822","title":"doi:10.3390/vaccines14090822","url":"https://doi.org/10.3390/vaccines14090822"}],"status":"frontier","summary":"PMID 42797642 \"Does Neoplastic Disease Negatively Affect Serum Antibody Titers Against Core Vaccines in Dogs?\" (CC BY, first published 2026-09-18) reports: \": These findings indicate that high seroprotection against core vaccine antigens is maintained in dogs with neoplastic disease prior to antineoplastic therapy, with no clear evidence of major humoral impairment compared to historical healthy reference data, thereby reassuring veterinary clinicians and pet owners that routine core vaccine boosters may not represent an immediate priority in canine cancer patients.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42788599","kind":"claim","label":"Septic arthritis caused by Nocardia asiatica: a case report and narrative review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42788599"]},"sources":[{"id":"source.frontier.pmid-42788599","title":"Europe PMC record PMID 42788599: Septic arthritis caused by Nocardia asiatica: a case report and narrative review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42788599%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1590/s1678-9946202668062","title":"doi:10.1590/s1678-9946202668062","url":"https://doi.org/10.1590/s1678-9946202668062"}],"status":"frontier","summary":"PMID 42788599 \"Septic arthritis caused by Nocardia asiatica: a case report and narrative review\" (CC BY, first published 2026-09-18) reports: \"We report a case of septic arthritis caused by N. asiatica in a 72-year-old man with a history of chronic obstructive pulmonary disease (COPD) and pneumoconiosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763478","kind":"claim","label":"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42763478"]},"sources":[{"id":"source.frontier.pmid-42763478","title":"Europe PMC record PMID 42763478: Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763478%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s12144-026-09895-9","title":"doi:10.1007/s12144-026-09895-9","url":"https://doi.org/10.1007/s12144-026-09895-9"}],"status":"frontier","summary":"PMID 42763478 \"Connected and confined: memories of digital experiences in relation to autonomy, competence, and relatedness during the COVID-19 pandemic\" (CC BY, first published 2026-09-18) reports: \"The analysis showed that DTs were recalled as both supporting and frustrating the satisfaction of all three psychological needs depending on broader material, institutional, social, personal and attitudinal conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761607","kind":"claim","label":"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42761607"]},"sources":[{"id":"source.frontier.pmid-42761607","title":"Europe PMC record PMID 42761607: Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761607%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crin/3992146","title":"doi:10.1155/crin/3992146","url":"https://doi.org/10.1155/crin/3992146"}],"status":"frontier","summary":"PMID 42761607 \"Tuberculosis-Associated Renal Amyloidosis Presenting as Nephrotic Syndrome: A Case Report From Ethiopia\" (CC BY, first published 2026-09-18) reports: \"We report a case of a 43-year-old Ethiopian male with a 5-month history of generalized edema, fatigue, flank pain, and nephrotic-range proteinuria (19.7 g/24 h).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760564","kind":"claim","label":"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42760564"]},"sources":[{"id":"source.frontier.pmid-42760564","title":"Europe PMC record PMID 42760564: Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760564%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13256-026-06579-7","title":"doi:10.1186/s13256-026-06579-7","url":"https://doi.org/10.1186/s13256-026-06579-7"}],"status":"frontier","summary":"PMID 42760564 \"Like father, like daughter: amoxicillin-induced aseptic meningitis in a female patient and her father: a case report\" (CC BY, first published 2026-09-18) reports: \"We report two cases involving patients of Mediterranean ethnicity -a father (69-years-old) and his daughter (47-years-old)-who presented to our neurology department at different time points with severe headache persisting for several days.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42758776","kind":"claim","label":"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42758776"]},"sources":[{"id":"source.frontier.pmid-42758776","title":"Europe PMC record PMID 42758776: The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758776%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0350972","title":"doi:10.1371/journal.pone.0350972","url":"https://doi.org/10.1371/journal.pone.0350972"}],"status":"frontier","summary":"PMID 42758776 \"The effect of the China-Thailand railway on Thailand's trade with China Guangxi Province\" (CC BY, first published 2026-09-18) reports: \"The findings indicate that the China-Thailand Railway can become a strong competitor to existing modes and, under appropriate policy and operational conditions, support more efficient, reliable, and sustainable Thailand-Guangxi trade.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42758734","kind":"claim","label":"A data-driven comparative analysis on citation intents across scientific disciplines","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.pmid-42758734"]},"sources":[{"id":"source.frontier.pmid-42758734","title":"Europe PMC record PMID 42758734: A data-driven comparative analysis on citation intents across scientific disciplines","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42758734%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358327","title":"doi:10.1371/journal.pone.0358327","url":"https://doi.org/10.1371/journal.pone.0358327"}],"status":"frontier","summary":"PMID 42758734 \"A data-driven comparative analysis on citation intents across scientific disciplines\" (CC BY, first published 2026-09-18) reports: \"We found out that there are significant differences in all five characteristics across different research disciplines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824361","kind":"claim","label":"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824361"]},"sources":[{"id":"source.frontier.pmid-42824361","title":"Europe PMC record PMID 42824361: Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824361%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1935888","title":"doi:10.3389/fneur.2026.1935888","url":"https://doi.org/10.3389/fneur.2026.1935888"}],"status":"frontier","summary":"PMID 42824361 \"Reduced 24-hour heart rate variability in neurosyphilis: a retrospective case-control study\" (CC BY, first published 2026-09-17) reports: \"Neurosyphilis was associated with lower values across several time and frequency-domain measures of 24-h HRV.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824182","kind":"claim","label":"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824182"]},"sources":[{"id":"source.frontier.pmid-42824182","title":"Europe PMC record PMID 42824182: A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824182%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fspor.2026.1913798","title":"doi:10.3389/fspor.2026.1913798","url":"https://doi.org/10.3389/fspor.2026.1913798"}],"status":"frontier","summary":"PMID 42824182 \"A conceptual framework for core stabilization training based on integrated ultrasonographic and functional evidence\" (CC BY, first published 2026-09-17) reports: \"By combining ultrasonographic assessment of lateral abdominal wall musculature with functional mobility outcomes, the findings suggest distinct adaptation profiles associated with local, global, and rotational stabilization strategies rather than the universal superiority of any single approach.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824079","kind":"claim","label":"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42824079"]},"sources":[{"id":"source.frontier.pmid-42824079","title":"Europe PMC record PMID 42824079: Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824079%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1856345","title":"doi:10.3389/fpsyg.2026.1856345","url":"https://doi.org/10.3389/fpsyg.2026.1856345"}],"status":"frontier","summary":"PMID 42824079 \"Enhancing public legal awareness in regulating normative deviance: a social psychological evaluation of legal education\" (CC BY, first published 2026-09-17) reports: \"Although the design does not allow for causal attribution, legal education is associated with a significant reduction in deviant behavior and a positive shift in public legal awareness through identifiable psychological mechanisms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42823984","kind":"claim","label":"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42823984"]},"sources":[{"id":"source.frontier.pmid-42823984","title":"Europe PMC record PMID 42823984: Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823984%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1901929","title":"doi:10.3389/fpsyg.2026.1901929","url":"https://doi.org/10.3389/fpsyg.2026.1901929"}],"status":"frontier","summary":"PMID 42823984 \"Work-life balance and silent resignation among bank employees: the moderating roles of emotional intelligence and psychological empowerment\" (CC BY, first published 2026-09-17) reports: \"The findings indicate a strong negative association between perceived work-life balance and silent resignation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42813109","kind":"claim","label":"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42813109"]},"sources":[{"id":"source.frontier.pmid-42813109","title":"Europe PMC record PMID 42813109: The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42813109%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/pnasnexus/pgag314","title":"doi:10.1093/pnasnexus/pgag314","url":"https://doi.org/10.1093/pnasnexus/pgag314"}],"status":"frontier","summary":"PMID 42813109 \"The seven virtues of <i>Samurai</i>: Revisiting a classic through computational language analysis\" (CC BY, first published 2026-09-17) reports: \"in moral profile was associated with broader reception in Western contexts, as indexed by independent indicators of publication, translation, and scholarly attention.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796013","kind":"claim","label":"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42796013"]},"sources":[{"id":"source.frontier.pmid-42796013","title":"Europe PMC record PMID 42796013: Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicen","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796013%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187241","title":"doi:10.3390/jcm15187241","url":"https://doi.org/10.3390/jcm15187241"}],"status":"frontier","summary":"PMID 42796013 \"Real-World Effectiveness and Safety of Anifrolumab in Egyptian Patients with Moderate-to-Severe Systemic Lupus Erythematosus: A Retrospective Multicenter Study\" (CC BY, first published 2026-09-17) reports: \": Anifrolumab was associated with significant short-term improvement in clinical and laboratory disease activity, marked steroid sparing, and reduced flare burden in Egyptian patients with moderate-to-severe SLE, with acceptable short-term tolerability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42757005","kind":"claim","label":"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42757005"]},"sources":[{"id":"source.frontier.pmid-42757005","title":"Europe PMC record PMID 42757005: Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757005%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.14309/crj.0000000000002296","title":"doi:10.14309/crj.0000000000002296","url":"https://doi.org/10.14309/crj.0000000000002296"}],"status":"frontier","summary":"PMID 42757005 \"Recurrent Jejunal Melanoma Presenting as Obscure Gastrointestinal Bleeding: A Diagnostic Challenge\" (CC BY, first published 2026-09-17) reports: \"We report a 47-year-old patient with prior stage III cutaneous melanoma status post wide local excision and sentinel lymph node biopsy, who declined adjuvant immunotherapy and surveillance, presenting with acute blood loss anemia occurring 3 years after definitive treatment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42752632","kind":"claim","label":"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.pmid-42752632"]},"sources":[{"id":"source.frontier.pmid-42752632","title":"Europe PMC record PMID 42752632: A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42752632%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356524","title":"doi:10.1371/journal.pone.0356524","url":"https://doi.org/10.1371/journal.pone.0356524"}],"status":"frontier","summary":"PMID 42752632 \"A cross-sectional study on illness perception and resiliency among cancer patients, in Bhaktapur cancer hospital\" (CC BY, first published 2026-09-17) reports: \"These findings suggest that addressing illness perception through targeted psychoeducation and supportive therapeutic approaches may enhance resilience among cancer patients and improve their quality of life.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795965","kind":"claim","label":"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42795965"]},"sources":[{"id":"source.frontier.pmid-42795965","title":"Europe PMC record PMID 42795965: Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795965%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187193","title":"doi:10.3390/jcm15187193","url":"https://doi.org/10.3390/jcm15187193"}],"status":"frontier","summary":"PMID 42795965 \"Diagnostic Value of Clinical and Optical Coherence Tomography Findings in Primary Vitreoretinal Lymphoma: A Retrospective Cohort Study\" (CC BY, first published 2026-09-16) reports: \"Prior corticosteroid exposure was associated with a lower yield of first-attempt vitrectomy, supporting steroid withdrawal before biopsy when feasible.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795646","kind":"claim","label":"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42795646"]},"sources":[{"id":"source.frontier.pmid-42795646","title":"Europe PMC record PMID 42795646: Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795646%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/microorganisms14092065","title":"doi:10.3390/microorganisms14092065","url":"https://doi.org/10.3390/microorganisms14092065"}],"status":"frontier","summary":"PMID 42795646 \"Effects of <i>Chlorella pyrenoidosa</i> Amendment on Tetracycline-Copper Dissipation, Soil Microbial Communities, and Tetracycline Resistance Genes\" (CC BY, first published 2026-09-16) reports: \"application enhanced TC removal and Cu immobilization and was associated with reduced enrichment of the tetracycline resistome.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794677","kind":"claim","label":"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42794677"]},"sources":[{"id":"source.frontier.pmid-42794677","title":"Europe PMC record PMID 42794677: Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular M","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794677%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27188246","title":"doi:10.3390/ijms27188246","url":"https://doi.org/10.3390/ijms27188246"}],"status":"frontier","summary":"PMID 42794677 \"Overweight/Obesity and Hyperinsulinemia Impair Oocyte Developmental Competence via Cumulus Cell Dysfunction and Oxidative Stress-Mediated Follicular Microenvironment Remodeling\" (CC BY, first published 2026-09-16) reports: \"We found that overweight/obesity, particularly when accompanied by hyperinsulinemia, induced CC immune activation, characterized by elevated follicular IgG, IgM, and pro-inflammatory cytokines.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42750388","kind":"claim","label":"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42750388"]},"sources":[{"id":"source.frontier.pmid-42750388","title":"Europe PMC record PMID 42750388: Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42750388%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jcla.70323","title":"doi:10.1002/jcla.70323","url":"https://doi.org/10.1002/jcla.70323"}],"status":"frontier","summary":"PMID 42750388 \"Improving the Accuracy of Papillary Thyroid Cancer Pathological Evaluation With Digital PCR Detection of the BRAF V600E Mutation\" (CC BY, first published 2026-09-16) reports: \"Our data demonstrate that dPCR is a highly valuable tool for PTC molecular pathology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42749366","kind":"claim","label":"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42749366"]},"sources":[{"id":"source.frontier.pmid-42749366","title":"Europe PMC record PMID 42749366: Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a no","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749366%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/bmjopen-2026-117886","title":"doi:10.1136/bmjopen-2026-117886","url":"https://doi.org/10.1136/bmjopen-2026-117886"}],"status":"frontier","summary":"PMID 42749366 \"Feasibility, use and usability of an adapted mHealth tool for dementia risk reduction among middle-aged and older adults in Germany: protocol for a non-randomised pilot study\" (CC BY, first published 2026-09-16) reports: \"Several potentially modifiable factors are associated with the risk of cognitive decline and dementia, indicating potential for risk reduction via lifestyle modifications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748195","kind":"claim","label":"Mathematical skills in deaf and hard-of-hearing children: A systematic review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748195"]},"sources":[{"id":"source.frontier.pmid-42748195","title":"Europe PMC record PMID 42748195: Mathematical skills in deaf and hard-of-hearing children: A systematic review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748195%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358324","title":"doi:10.1371/journal.pone.0358324","url":"https://doi.org/10.1371/journal.pone.0358324"}],"status":"frontier","summary":"PMID 42748195 \"Mathematical skills in deaf and hard-of-hearing children: A systematic review\" (CC BY, first published 2026-09-16) reports: \"These findings highlight the importance of considering language-related factors in both the assessment and instruction of mathematics in DHH learners.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748135","kind":"claim","label":"Bacterial stress responses lower mRNA-protein level correlations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748135"]},"sources":[{"id":"source.frontier.pmid-42748135","title":"Europe PMC record PMID 42748135: Bacterial stress responses lower mRNA-protein level correlations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748135%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1073/pnas.2613102123","title":"doi:10.1073/pnas.2613102123","url":"https://doi.org/10.1073/pnas.2613102123"}],"status":"frontier","summary":"PMID 42748135 \"Bacterial stress responses lower mRNA-protein level correlations\" (CC BY, first published 2026-09-16) reports: \"Our findings highlight the prevalence of noncorrelating mRNA-protein levels and the potential role of posttranslational modifications in modulating protein levels in response to environmental stressors during infection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748115","kind":"claim","label":"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748115"]},"sources":[{"id":"source.frontier.pmid-42748115","title":"Europe PMC record PMID 42748115: Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748115%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357562","title":"doi:10.1371/journal.pone.0357562","url":"https://doi.org/10.1371/journal.pone.0357562"}],"status":"frontier","summary":"PMID 42748115 \"Family structure and family satisfaction as factors of adolescents' autonomous motivation, cheating, and academic achievement\" (CC BY, first published 2026-09-16) reports: \"The results show that adolescents from single-mother and stepfather families form a homogeneous group that differs from children from intact families in terms of satisfaction with family relationships, autonomous academic motivation, persistence, attitude toward school, homework cheating and academic achievement, all of which are higher among adolescents from intact families.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748081","kind":"claim","label":"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748081"]},"sources":[{"id":"source.frontier.pmid-42748081","title":"Europe PMC record PMID 42748081: Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748081%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0351523","title":"doi:10.1371/journal.pone.0351523","url":"https://doi.org/10.1371/journal.pone.0351523"}],"status":"frontier","summary":"PMID 42748081 \"Parental perceptions of children's physical activity participation: An exploration of satisfaction, school-based engagement, barriers to participation and preferred strategies for improvement\" (CC BY, first published 2026-09-16) reports: \"The findings suggest that improving both satisfaction and participation may require strengthened school-based physical activity provision, greater parental engagement, and enhanced community infrastructure to support balanced child development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42748079","kind":"claim","label":"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.pmid-42748079"]},"sources":[{"id":"source.frontier.pmid-42748079","title":"Europe PMC record PMID 42748079: Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42748079%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355860","title":"doi:10.1371/journal.pone.0355860","url":"https://doi.org/10.1371/journal.pone.0355860"}],"status":"frontier","summary":"PMID 42748079 \"Enhancing dance learning by optimising instructional perspective: A preregistered study on the effect of dancers' viewing perspective, cognitive load and expertise\" (CC BY, first published 2026-09-16) reports: \"These findings suggest that first-person perspectives may support motor learning, with performance patterns consistent with reduced cognitive load.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42812171","kind":"claim","label":"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42812171"]},"sources":[{"id":"source.frontier.pmid-42812171","title":"Europe PMC record PMID 42812171: Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42812171%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1931802","title":"doi:10.3389/fonc.2026.1931802","url":"https://doi.org/10.3389/fonc.2026.1931802"}],"status":"frontier","summary":"PMID 42812171 \"Breast cystic echinococcosis with ultrasonographic \"cerebral gyrus sign\": a case report\" (CC BY, first published 2026-09-15) reports: \"We report a case of breast CE in a 50-year-old Tibetan woman from an endemic area.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795945","kind":"claim","label":"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42795945"]},"sources":[{"id":"source.frontier.pmid-42795945","title":"Europe PMC record PMID 42795945: Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract In","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795945%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187173","title":"doi:10.3390/jcm15187173","url":"https://doi.org/10.3390/jcm15187173"}],"status":"frontier","summary":"PMID 42795945 \"Association of Inpatient Diabetes Specialist Consultation with Clinical Outcomes in Patients with Diabetes Hospitalized for Lower Respiratory Tract Infections: A Retrospective Cohort Study\" (CC BY, first published 2026-09-15) reports: \": Diabetes mellitus (DM) is associated with an increased susceptibility to lower respiratory tract infections (LRTIs) and more severe clinical courses, including prolonged hospitalization and increased mortality.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768386","kind":"claim","label":"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42768386"]},"sources":[{"id":"source.frontier.pmid-42768386","title":"Europe PMC record PMID 42768386: Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768386%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13099-026-00860-2","title":"doi:10.1186/s13099-026-00860-2","url":"https://doi.org/10.1186/s13099-026-00860-2"}],"status":"frontier","summary":"PMID 42768386 \"Insights into the dynamics of antibiotic resistance genes in the human gut microbiome across populations\" (CC BY, first published 2026-09-15) reports: \"Our analysis revealed variation in the gut resistome across population groups and countries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760901","kind":"claim","label":"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42760901"]},"sources":[{"id":"source.frontier.pmid-42760901","title":"Europe PMC record PMID 42760901: Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760901%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.181753.4","title":"doi:10.12688/f1000research.181753.4","url":"https://doi.org/10.12688/f1000research.181753.4"}],"status":"frontier","summary":"PMID 42760901 \"Depression and Suicidal Ideation Among Men who have sex with men and Transgender Women in Chiang Mai, Thailand\" (CC BY, first published 2026-09-15) reports: \"Experience of discrimination was associated with higher depression scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746596","kind":"claim","label":"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42746596"]},"sources":[{"id":"source.frontier.pmid-42746596","title":"Europe PMC record PMID 42746596: Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746596%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/ijog/2966459","title":"doi:10.1155/ijog/2966459","url":"https://doi.org/10.1155/ijog/2966459"}],"status":"frontier","summary":"PMID 42746596 \"Mechanistic Perspectives From Genomics and Pangenomics of Medicinal and Aromatic Plants: Linking Genome Architecture to Phytochemical Diversity\" (CC BY, first published 2026-09-15) reports: \"Examples illustrate how genome architecture is associated with specialized-metabolite biosynthesis through multiple regulatory processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743377","kind":"claim","label":"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743377"]},"sources":[{"id":"source.frontier.pmid-42743377","title":"Europe PMC record PMID 42743377: The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743377%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355938","title":"doi:10.1371/journal.pone.0355938","url":"https://doi.org/10.1371/journal.pone.0355938"}],"status":"frontier","summary":"PMID 42743377 \"The effect of manuscript characteristics on quality assessment of scientific manuscripts in psychology\" (CC BY, first published 2026-09-15) reports: \"We report a vignette study and a survey to investigate which study characteristics influence quality ratings psychology academics give of articles submitted for publication, and psychology academics and students to theses written by psychology students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743310","kind":"claim","label":"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743310"]},"sources":[{"id":"source.frontier.pmid-42743310","title":"Europe PMC record PMID 42743310: Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743310%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356760","title":"doi:10.1371/journal.pone.0356760","url":"https://doi.org/10.1371/journal.pone.0356760"}],"status":"frontier","summary":"PMID 42743310 \"Representation of drug addiction in Pakistani print media: A Latent Dirichlet Allocation analysis\" (CC BY, first published 2026-09-15) reports: \"The results showed that drug addiction is presented as interconnected themes, placed in a broader social and institutional context.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743306","kind":"claim","label":"Convergent evolution of viral nucleases targeting cyclic dinucleotides","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743306"]},"sources":[{"id":"source.frontier.pmid-42743306","title":"Europe PMC record PMID 42743306: Convergent evolution of viral nucleases targeting cyclic dinucleotides","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743306%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.ppat.1014605","title":"doi:10.1371/journal.ppat.1014605","url":"https://doi.org/10.1371/journal.ppat.1014605"}],"status":"frontier","summary":"PMID 42743306 \"Convergent evolution of viral nucleases targeting cyclic dinucleotides\" (CC BY, first published 2026-09-15) reports: \"Second, we observe the diverse structural adaptations of viral nucleases for CDN degradation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743204","kind":"claim","label":"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743204"]},"sources":[{"id":"source.frontier.pmid-42743204","title":"Europe PMC record PMID 42743204: Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743204%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0358261","title":"doi:10.1371/journal.pone.0358261","url":"https://doi.org/10.1371/journal.pone.0358261"}],"status":"frontier","summary":"PMID 42743204 \"Mandibular incisor alveolar housing and incisor-alveolar axis relationship in untreated skeletal Class III malocclusion: A cross-sectional CBCT study\" (CC BY, first published 2026-09-15) reports: \"In adjusted models, each 1° increase in signed IA-PAMD was associated with 0.084 mm greater labial apical thickness (95% CI, 0.053-0.115), 0.092 mm lower lingual apical thickness (95% CI, -0.141 to -0.043), and no difference in total apical width (-0.008 mm; 95% CI, -0.082 to 0.065).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743162","kind":"claim","label":"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743162"]},"sources":[{"id":"source.frontier.pmid-42743162","title":"Europe PMC record PMID 42743162: Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743162%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357972","title":"doi:10.1371/journal.pone.0357972","url":"https://doi.org/10.1371/journal.pone.0357972"}],"status":"frontier","summary":"PMID 42743162 \"Machine learning-supported identification of necrosis in colorectal and pancreatic cancer spheroids\" (CC BY, first published 2026-09-15) reports: \"The results show a strong correlation between dark spots in the spheroid and their staining as necrotic, making regression models an appropriate solution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42743158","kind":"claim","label":"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42743158"]},"sources":[{"id":"source.frontier.pmid-42743158","title":"Europe PMC record PMID 42743158: The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary a","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42743158%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357910","title":"doi:10.1371/journal.pone.0357910","url":"https://doi.org/10.1371/journal.pone.0357910"}],"status":"frontier","summary":"PMID 42743158 \"The pathway analysis of relationship between illness uncertainty, perceived stress, coping strategies, and quality of life in patients with coronary artery disease\" (CC BY, first published 2026-09-15) reports: \"Previous studies suggests that illness uncertainty is associated with quality of life in chronic illness, yet the underlying mechanisms remain unclear, particularly in coronary artery disease (CAD).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42403695","kind":"claim","label":"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.pmid-42403695"]},"sources":[{"id":"source.frontier.pmid-42403695","title":"Europe PMC record PMID 42403695: What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42403695%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.173033.4","title":"doi:10.12688/f1000research.173033.4","url":"https://doi.org/10.12688/f1000research.173033.4"}],"status":"frontier","summary":"PMID 42403695 \"What Drives Indonesian People to Purchase Modest Fashion? The Moderating Role of Religiosity\" (CC BY, first published 2026-09-15) reports: \"The results indicate that both attitude and E-WOM have significant positive effects on purchase decisions, with E-WOM being the most dominant factor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42807220","kind":"claim","label":"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42807220"]},"sources":[{"id":"source.frontier.pmid-42807220","title":"Europe PMC record PMID 42807220: Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case repo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1936197","title":"doi:10.3389/fmed.2026.1936197","url":"https://doi.org/10.3389/fmed.2026.1936197"}],"status":"frontier","summary":"PMID 42807220 \"Systemic lupus erythematosus complicated by refractory <i>Mycobacterium avium complex</i> infection involving bilateral lower extremities: a case report and literature review\" (CC BY, first published 2026-09-14) reports: \"We report a 52-year-old female with SLE on long-term prednisone, azathioprine, leflunomide, and hydroxychloroquine, who developed bilateral tibial and femoral osteomyelitis complicated by soft tissue abscesses, drug-induced dermatitis, and severe malnutrition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42807094","kind":"claim","label":"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42807094"]},"sources":[{"id":"source.frontier.pmid-42807094","title":"Europe PMC record PMID 42807094: Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42807094%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1897856","title":"doi:10.3389/fmed.2026.1897856","url":"https://doi.org/10.3389/fmed.2026.1897856"}],"status":"frontier","summary":"PMID 42807094 \"Impact of immunosuppressive therapy and clinical risk factors on the prevalence of low bone mineral density in rheumatic diseases\" (CC BY, first published 2026-09-14) reports: \"Our findings highlight an association between alcohol consumption and low BMD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795904","kind":"claim","label":"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42795904"]},"sources":[{"id":"source.frontier.pmid-42795904","title":"Europe PMC record PMID 42795904: Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795904%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15187131","title":"doi:10.3390/jcm15187131","url":"https://doi.org/10.3390/jcm15187131"}],"status":"frontier","summary":"PMID 42795904 \"Integrative Multi-Omics Analysis Reveals Host Regulatory and Immune Networks with Inferred Dysbiosis Relevance in Colorectal Cancer\" (CC BY, first published 2026-09-14) reports: \"Multi-omics characterization demonstrated that PTEN and SMAD4 alterations were predominantly associated with genomic deletions, whereas SMAD2 dysregulation was associated with transcriptomic and gene-dosage variation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768354","kind":"claim","label":"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42768354"]},"sources":[{"id":"source.frontier.pmid-42768354","title":"Europe PMC record PMID 42768354: Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768354%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12905-026-04676-9","title":"doi:10.1186/s12905-026-04676-9","url":"https://doi.org/10.1186/s12905-026-04676-9"}],"status":"frontier","summary":"PMID 42768354 \"Indian rural women's suicide beliefs and experiences: female suicidality as escape from and protest against a life usurped of agency\" (CC BY, first published 2026-09-14) reports: \"These findings suggest the need for community-based mental health support, gender-transformative interventions, and policy reforms that protect women's rights, strengthen their social and economic resources, and expand opportunities for autonomy, safety, and well-being.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746605","kind":"claim","label":"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42746605"]},"sources":[{"id":"source.frontier.pmid-42746605","title":"Europe PMC record PMID 42746605: Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746605%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/20523211.2026.2719528","title":"doi:10.1080/20523211.2026.2719528","url":"https://doi.org/10.1080/20523211.2026.2719528"}],"status":"frontier","summary":"PMID 42746605 \"Early antibiotic review and AWaRe prescribing in respiratory infections before vs during COVID-19: a two-hospital retrospective cohort study\" (CC BY, first published 2026-09-14) reports: \"These findings demonstrate that maintaining review frequency alone may not prevent broader-spectrum prescribing and support targeted strategies to improve documentation, promote Access antibiotics, and preserve stewardship quality during periods of pressure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42736559","kind":"claim","label":"Living with adenomyosis and involuntary childlessness: a qualitative interview study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.pmid-42736559"]},"sources":[{"id":"source.frontier.pmid-42736559","title":"Europe PMC record PMID 42736559: Living with adenomyosis and involuntary childlessness: a qualitative interview study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42736559%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12905-026-04880-7","title":"doi:10.1186/s12905-026-04880-7","url":"https://doi.org/10.1186/s12905-026-04880-7"}],"status":"frontier","summary":"PMID 42736559 \"Living with adenomyosis and involuntary childlessness: a qualitative interview study\" (CC BY, first published 2026-09-14) reports: \"The study shows that individuals with adenomyosis and involuntary childlessness experience prolonged diagnostic delays, fragmented care, and significant psychosocial burden, underscoring the need for holistic, patient-centered care that integrates medical, psychosocial, and reproductive health needs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796834","kind":"claim","label":"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42796834"]},"sources":[{"id":"source.frontier.pmid-42796834","title":"Europe PMC record PMID 42796834: Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796834%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/plants15182802","title":"doi:10.3390/plants15182802","url":"https://doi.org/10.3390/plants15182802"}],"status":"frontier","summary":"PMID 42796834 \"Narrative Review of Nanomaterial Interactions in Plants with a Focus on Multi-Omics and Epigenetic Remodeling\" (CC BY, first published 2026-09-12) reports: \"The data indicates that nanomaterials can significantly affect seed vigor, root architecture, photosynthetic efficiency, and other yield-related traits through coordinated regulation of stress-responsive genes, antioxidant defense mechanisms, and phytohormonal signaling pathways.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794013","kind":"claim","label":"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42794013"]},"sources":[{"id":"source.frontier.pmid-42794013","title":"Europe PMC record PMID 42794013: Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794013%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/foods15183228","title":"doi:10.3390/foods15183228","url":"https://doi.org/10.3390/foods15183228"}],"status":"frontier","summary":"PMID 42794013 \"Smart Consumption, Less Waste: The Role of Digital Technologies in Consumer Food Waste Reduction-A Systematic Literature Review\" (CC BY, first published 2026-09-12) reports: \"Overall, the findings indicate that digital technologies offer promising but insufficiently validated opportunities to support food waste reduction and that stronger empirical evidence is needed to guide their effective and responsible development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42731744","kind":"claim","label":"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.pmid-42731744"]},"sources":[{"id":"source.frontier.pmid-42731744","title":"Europe PMC record PMID 42731744: Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42731744%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.physbeh.2026.115500","title":"doi:10.1016/j.physbeh.2026.115500","url":"https://doi.org/10.1016/j.physbeh.2026.115500"}],"status":"frontier","summary":"PMID 42731744 \"Neonatal handling shapes the adult development of social behavior in rats: enduring effects after prolonged social deprivation\" (CC BY, first published 2026-09-12) reports: \"Together with previous findings on juvenile play, these results indicate that neonatal handling produces enduring changes in affiliative social behavior that remain detectable into adulthood and may reflect long-lasting alterations in social motivational processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799291","kind":"claim","label":"A review on clinical cases of rare mold infections and their antifungal treatment strategies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42799291"]},"sources":[{"id":"source.frontier.pmid-42799291","title":"Europe PMC record PMID 42799291: A review on clinical cases of rare mold infections and their antifungal treatment strategies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799291%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmicb.2026.1903380","title":"doi:10.3389/fmicb.2026.1903380","url":"https://doi.org/10.3389/fmicb.2026.1903380"}],"status":"frontier","summary":"PMID 42799291 \"A review on clinical cases of rare mold infections and their antifungal treatment strategies\" (CC BY, first published 2026-09-11) reports: \"By integrating clinical case data, we found that although most rare mold infections respond well to conventional antifungal therapy, a small number of cases still result in death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798677","kind":"claim","label":"Arts participation and mental health: evidence from the Chinese general social survey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798677"]},"sources":[{"id":"source.frontier.pmid-42798677","title":"Europe PMC record PMID 42798677: Arts participation and mental health: evidence from the Chinese general social survey","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798677%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1933119","title":"doi:10.3389/fpsyg.2026.1933119","url":"https://doi.org/10.3389/fpsyg.2026.1933119"}],"status":"frontier","summary":"PMID 42798677 \"Arts participation and mental health: evidence from the Chinese general social survey\" (CC BY, first published 2026-09-11) reports: \"The results indicate that, first, arts participation is significantly associated with better mental health, with individuals reporting higher levels of arts participation exhibiting lower frequencies of depressive and dispirited feelings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798644","kind":"claim","label":"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798644"]},"sources":[{"id":"source.frontier.pmid-42798644","title":"Europe PMC record PMID 42798644: <i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798644%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1948468","title":"doi:10.3389/fmed.2026.1948468","url":"https://doi.org/10.3389/fmed.2026.1948468"}],"status":"frontier","summary":"PMID 42798644 \"<i>Streptococcus intermedius</i> lung abscess in children: a case report and literature review\" (CC BY, first published 2026-09-11) reports: \"Our findings highlight the value of tNGS in diagnosing lower respiratory tract infections caused by pathogens that are difficult to identify through conventional culture methods.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798637","kind":"claim","label":"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798637"]},"sources":[{"id":"source.frontier.pmid-42798637","title":"Europe PMC record PMID 42798637: A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798637%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1915868","title":"doi:10.3389/fpubh.2026.1915868","url":"https://doi.org/10.3389/fpubh.2026.1915868"}],"status":"frontier","summary":"PMID 42798637 \"A comparative analysis of growth and developmental outcomes in infants with proliferative hemangiomas treated with oral propranolol versus prednisone\" (CC BY, first published 2026-09-11) reports: \"Compared with oral prednisone, oral propranolol demonstrates superior therapeutic efficacy in the treatment of proliferative IHs and is associated with fewer respiratory infections and better physical and short-term neurodevelopmental outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798632","kind":"claim","label":"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42798632"]},"sources":[{"id":"source.frontier.pmid-42798632","title":"Europe PMC record PMID 42798632: Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798632%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1905102","title":"doi:10.3389/fphar.2026.1905102","url":"https://doi.org/10.3389/fphar.2026.1905102"}],"status":"frontier","summary":"PMID 42798632 \"Untargeted plasma metabolomics reveals systemic metabolic dysregulation and reatment-associated metabolic modulation following YWKS treatment in sleep disorder patients\" (CC BY, first published 2026-09-11) reports: \"These findings suggest that sleep disturbances are associated with a complex metabolic imprint within the bloodstream that is not fully resolved by YWKS therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42784269","kind":"claim","label":"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42784269"]},"sources":[{"id":"source.frontier.pmid-42784269","title":"Europe PMC record PMID 42784269: The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42784269%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/tomography12090131","title":"doi:10.3390/tomography12090131","url":"https://doi.org/10.3390/tomography12090131"}],"status":"frontier","summary":"PMID 42784269 \"The Role of Interventional Radiology in the Diagnosis and Treatment of Gynecological Conditions\" (CC BY, first published 2026-09-11) reports: \"Techniques such as uterine artery embolization and ovarian vein embolization are associated with high technical success and meaningful symptom reduction, while simultaneously decreasing hospitalization time, perioperative morbidity, and convalescence compared with traditional surgery.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42730235","kind":"claim","label":"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42730235"]},"sources":[{"id":"source.frontier.pmid-42730235","title":"Europe PMC record PMID 42730235: Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42730235%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74347","title":"doi:10.1002/ece3.74347","url":"https://doi.org/10.1002/ece3.74347"}],"status":"frontier","summary":"PMID 42730235 \"Population Genomics Approaches Identify a Cryptic, Emerging Generalist Pest Complex\" (CC BY, first published 2026-09-11) reports: \"Together, these results suggest a potential pest complex where previously only one species was in focus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729983","kind":"claim","label":"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42729983"]},"sources":[{"id":"source.frontier.pmid-42729983","title":"Europe PMC record PMID 42729983: Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729983%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74274","title":"doi:10.1002/ece3.74274","url":"https://doi.org/10.1002/ece3.74274"}],"status":"frontier","summary":"PMID 42729983 \"Genetic Structure and Signs of Local Adaptation in Icelandic Brown Trout Populations\" (CC BY, first published 2026-09-11) reports: \"Our results highlight the effects of isolation on genetic diversity in headwater populations and the importance of identifying unique populations in conservation efforts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42726890","kind":"claim","label":"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42726890"]},"sources":[{"id":"source.frontier.pmid-42726890","title":"Europe PMC record PMID 42726890: Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012306","title":"doi:10.1371/journal.pgen.1012306","url":"https://doi.org/10.1371/journal.pgen.1012306"}],"status":"frontier","summary":"PMID 42726890 \"Life in sediments fosters 'sexual' speciation in the Shewanella baltica complex\" (CC BY, first published 2026-09-11) reports: \"Using a reverse-ecology population genomics approach, we found unprecedented genomic diversification among sediment-associated strains, which form a species complex resolving into three cohesive evolutionary groups (G1, G2, and G3) with distinct signatures of metabolic specialization including sulfite respiration.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42726368","kind":"claim","label":"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.pmid-42726368"]},"sources":[{"id":"source.frontier.pmid-42726368","title":"Europe PMC record PMID 42726368: The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42726368%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11883-026-01463-7","title":"doi:10.1007/s11883-026-01463-7","url":"https://doi.org/10.1007/s11883-026-01463-7"}],"status":"frontier","summary":"PMID 42726368 \"The Role of the Gut Microbiome in the Relationship Between the Mediterranean Diet and Cardiovascular Disease Risk\" (CC BY, first published 2026-09-11) reports: \"Mediterranean diet adherence is associated with enrichment of fiber-degrading and short-chain fatty acid-producing taxa, greater microbial capacity for polysaccharide degradation, and more favorable bile acid, phenolic, lipid, and inflammatory profiles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42793476","kind":"claim","label":"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42793476"]},"sources":[{"id":"source.frontier.pmid-42793476","title":"Europe PMC record PMID 42793476: Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42793476%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14182936","title":"doi:10.3390/healthcare14182936","url":"https://doi.org/10.3390/healthcare14182936"}],"status":"frontier","summary":"PMID 42793476 \"Post-Treatment Nutrition and Rehabilitation Support Is Associated with Reduced Psychological Distress After Early-Stage Upper Gastrointestinal Cancer Surgery: A Retrospective Cohort Study\" (CC BY, first published 2026-09-10) reports: \"Structured post-treatment nutrition and rehabilitation support was associated with markedly lower psychological distress, the prespecified primary outcome, with the achieved sample exceeding the a priori requirement for the assumed effect size; a secondary, exploratory survival association requires prospective confirmation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42725296","kind":"claim","label":"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42725296"]},"sources":[{"id":"source.frontier.pmid-42725296","title":"Europe PMC record PMID 42725296: Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), I","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725296%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74323","title":"doi:10.1002/ece3.74323","url":"https://doi.org/10.1002/ece3.74323"}],"status":"frontier","summary":"PMID 42725296 \"Reference-Guided Chromosome-Scale Genome Assembly With Insights on Population Genomics of the Atlantic Goliath Grouper (<i>Epinephelus itajara</i>), Islas del Rosario, Colombia\" (CC BY, first published 2026-09-10) reports: \"The results revealed four distinct genomic lineages, with moderate genetic differentiation among the sampled individuals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721209","kind":"claim","label":"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721209"]},"sources":[{"id":"source.frontier.pmid-42721209","title":"Europe PMC record PMID 42721209: Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721209%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354427","title":"doi:10.1371/journal.pone.0354427","url":"https://doi.org/10.1371/journal.pone.0354427"}],"status":"frontier","summary":"PMID 42721209 \"Trait mindfulness, psychological skills, and mental toughness in paddleboard athletes: A correlational study\" (CC BY, first published 2026-09-10) reports: \"These findings suggest that psychological variables in paddleboarding are characterized by a pattern of interrelated statistical associations among trait mindfulness, regulatory processes, and performance-related outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721180","kind":"claim","label":"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721180"]},"sources":[{"id":"source.frontier.pmid-42721180","title":"Europe PMC record PMID 42721180: Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721180%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014698","title":"doi:10.1371/journal.pntd.0014698","url":"https://doi.org/10.1371/journal.pntd.0014698"}],"status":"frontier","summary":"PMID 42721180 \"Friends or foes: Unraveling the tsetse fly-Spiroplasma symbiosis\" (CC BY, first published 2026-09-10) reports: \"Finally, we discuss how the tsetse-Spiroplasma symbiosis could be harnessed to develop innovative, biological-based vector control and trypanosome transmission-blocking strategies, and we identify critical gaps that must be addressed to translate these findings into effective disease control interventions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721148","kind":"claim","label":"Care network types and depression among people with cognitive impairment: A latent class analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721148"]},"sources":[{"id":"source.frontier.pmid-42721148","title":"Europe PMC record PMID 42721148: Care network types and depression among people with cognitive impairment: A latent class analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721148%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357737","title":"doi:10.1371/journal.pone.0357737","url":"https://doi.org/10.1371/journal.pone.0357737"}],"status":"frontier","summary":"PMID 42721148 \"Care network types and depression among people with cognitive impairment: A latent class analysis\" (CC BY, first published 2026-09-10) reports: \"Compared with the Child-centered Care Network, the Public-centered Care Network (β = 0.09, p = 0.041) and the Mixed Care Network (β = 0.14, p = 0.002) were associated with higher depression scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721140","kind":"claim","label":"Grey voters and populist voting. The role of religiosity and national collective narcissism","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721140"]},"sources":[{"id":"source.frontier.pmid-42721140","title":"Europe PMC record PMID 42721140: Grey voters and populist voting. The role of religiosity and national collective narcissism","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721140%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0336831","title":"doi:10.1371/journal.pone.0336831","url":"https://doi.org/10.1371/journal.pone.0336831"}],"status":"frontier","summary":"PMID 42721140 \"Grey voters and populist voting. The role of religiosity and national collective narcissism\" (CC BY, first published 2026-09-10) reports: \"We also found religious faith to be a stronger predictor of populist voting than religious practice.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42721128","kind":"claim","label":"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.pmid-42721128"]},"sources":[{"id":"source.frontier.pmid-42721128","title":"Europe PMC record PMID 42721128: Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42721128%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357909","title":"doi:10.1371/journal.pone.0357909","url":"https://doi.org/10.1371/journal.pone.0357909"}],"status":"frontier","summary":"PMID 42721128 \"Developing the UK's capability in behavioural research: Identifying strengths, challenges and strategies through cross-sector workshops\" (CC BY, first published 2026-09-10) reports: \"Our findings highlight the need for sustained investment and stronger collaboration to better align behavioural research with public and policy priorities, address sector-specific challenges, and build on existing strengths.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792412","kind":"claim","label":"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42792412"]},"sources":[{"id":"source.frontier.pmid-42792412","title":"Europe PMC record PMID 42792412: Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792412%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091612","title":"doi:10.3390/bs16091612","url":"https://doi.org/10.3390/bs16091612"}],"status":"frontier","summary":"PMID 42792412 \"Insensitivity as an Adaptive Psychological Resource for Mental Health: Development and Validation of a Scale Among Chinese University Students\" (CC BY, first published 2026-09-09) reports: \"These findings provide preliminary evidence that insensitivity is associated with better mental health among university students and may represent a potentially complementary perspective on adaptive psychological functioning.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42780961","kind":"claim","label":"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42780961"]},"sources":[{"id":"source.frontier.pmid-42780961","title":"Europe PMC record PMID 42780961: The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780961%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fdgth.2026.1955151","title":"doi:10.3389/fdgth.2026.1955151","url":"https://doi.org/10.3389/fdgth.2026.1955151"}],"status":"frontier","summary":"PMID 42780961 \"The perceived fit of guided iCBT in specialised mental healthcare services: a qualitative study of healthcare professionals' perspectives\" (CC BY, first published 2026-09-09) reports: \"The findings suggest that implementing guided iCBT in specialised mental healthcare depends on aligning the intervention with the clinical, organisational, and broader system contexts in which it is introduced.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42780909","kind":"claim","label":"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.pmid-42780909"]},"sources":[{"id":"source.frontier.pmid-42780909","title":"Europe PMC record PMID 42780909: Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42780909%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1900588","title":"doi:10.3389/fpubh.2026.1900588","url":"https://doi.org/10.3389/fpubh.2026.1900588"}],"status":"frontier","summary":"PMID 42780909 \"Glycated hemoglobin (A1c) values and antidiabetic treatment deprescription in hospitalized nonagenarians with type 2 diabetes\" (CC BY, first published 2026-09-09) reports: \"These findings highlight a gap in ambulatory therapeutic review and support the need for individualized goals, deprescription protocols, and interdisciplinary care models bridging hospital, community, and domiciliary settings, a public health priority for aging populations in Latin America.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42795560","kind":"claim","label":"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42795560"]},"sources":[{"id":"source.frontier.pmid-42795560","title":"Europe PMC record PMID 42795560: Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42795560%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/microorganisms14091979","title":"doi:10.3390/microorganisms14091979","url":"https://doi.org/10.3390/microorganisms14091979"}],"status":"frontier","summary":"PMID 42795560 \"Association Between Thiazolidinedione Therapy and Tuberculosis-Related Events in Type 2 Diabetes: A Population-Based Cohort Study\" (CC BY, first published 2026-09-08) reports: \"However, rosiglitazone use was associated with lower risks of TB requiring anti-TB treatment (aHR, 0.56; 95% CI, 0.36-0.86), pulmonary TB (aHR, 0.79; 95% CI, 0.68-0.92), and TB-related hospitalization (aHR, 0.59; 95% CI, 0.43-0.81).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42775227","kind":"claim","label":"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42775227"]},"sources":[{"id":"source.frontier.pmid-42775227","title":"Europe PMC record PMID 42775227: Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42775227%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1832219","title":"doi:10.3389/fpsyg.2026.1832219","url":"https://doi.org/10.3389/fpsyg.2026.1832219"}],"status":"frontier","summary":"PMID 42775227 \"Digital distraction and adolescent development: a narrative review of smartphone use, cognitive effects, and policy interventions\" (CC BY, first published 2026-09-08) reports: \"Research across observational studies, experimental work, and systematic reviews suggests that excessive smartphone use is associated with modest but consistent relationships with sleep disruption, reduced attentional capacity, and increased internalizing symptoms among some adolescents.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42732108","kind":"claim","label":"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42732108"]},"sources":[{"id":"source.frontier.pmid-42732108","title":"Europe PMC record PMID 42732108: Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732108%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.180569.3","title":"doi:10.12688/f1000research.180569.3","url":"https://doi.org/10.12688/f1000research.180569.3"}],"status":"frontier","summary":"PMID 42732108 \"Does Inquiry-Based Learning Improve Students' Critical Thinking? A Meta-Analysis Accounting for Control Group Variations\" (CC BY, first published 2026-09-08) reports: \"The analysis revealed that IBL has a large and significant effect on enhancing students' critical thinking (g = 1.336; 95% CI [1.061, 1.611]).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709861","kind":"claim","label":"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42709861"]},"sources":[{"id":"source.frontier.pmid-42709861","title":"Europe PMC record PMID 42709861: Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709861%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.ppat.1014558","title":"doi:10.1371/journal.ppat.1014558","url":"https://doi.org/10.1371/journal.ppat.1014558"}],"status":"frontier","summary":"PMID 42709861 \"Bile acid sequestration reveals microbiome remodeling that dominates FXR signaling to shape host responses to enteric infection\" (CC BY, first published 2026-09-08) reports: \"We found that bile acid sequestration increased resistance to enteric infection, and this phenotype required farnesoid X receptor (FXR) in myeloid cells.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709851","kind":"claim","label":"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.pmid-42709851"]},"sources":[{"id":"source.frontier.pmid-42709851","title":"Europe PMC record PMID 42709851: Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709851%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pmed.1004917","title":"doi:10.1371/journal.pmed.1004917","url":"https://doi.org/10.1371/journal.pmed.1004917"}],"status":"frontier","summary":"PMID 42709851 \"Multimodal protective and susceptibility clusters in paediatric atopic dermatitis: A machine learning-based, data-driven observational study\" (CC BY, first published 2026-09-08) reports: \"In the environmental and antibody datasets, we found that the combined effects of environmental features and higher levels of allergen-specific and total IgE antibodies contributed to the prediction of AD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792025","kind":"claim","label":"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42792025"]},"sources":[{"id":"source.frontier.pmid-42792025","title":"Europe PMC record PMID 42792025: Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792025%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15090875","title":"doi:10.3390/antibiotics15090875","url":"https://doi.org/10.3390/antibiotics15090875"}],"status":"frontier","summary":"PMID 42792025 \"Selection and Characterization of Vaginal Lactobacilli from Healthy Algerian Women with Potential Probiotic Properties Against Urogenital Pathogens\" (CC BY, first published 2026-09-07) reports: \": Overall, these findings demonstrate that the vaginal microbiota of healthy Algerian women represents a valuable source of potential probiotic strains and provide a strong basis for future in vivo validation and clinical application in the prevention and management of vaginal infections.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42769220","kind":"claim","label":"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42769220"]},"sources":[{"id":"source.frontier.pmid-42769220","title":"Europe PMC record PMID 42769220: Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1876551","title":"doi:10.3389/fmed.2026.1876551","url":"https://doi.org/10.3389/fmed.2026.1876551"}],"status":"frontier","summary":"PMID 42769220 \"Quantitative CT-derived lobar inter-tapering as a candidate imaging feature associated with airway-predominant non-emphysematous COPD\" (CC BY, first published 2026-09-07) reports: \"Quantitative CT-derived lobar inter-tapering was associated with pulmonary function-defined non-emphysematous COPD.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42769130","kind":"claim","label":"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42769130"]},"sources":[{"id":"source.frontier.pmid-42769130","title":"Europe PMC record PMID 42769130: Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42769130%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1950267","title":"doi:10.3389/fpsyg.2026.1950267","url":"https://doi.org/10.3389/fpsyg.2026.1950267"}],"status":"frontier","summary":"PMID 42769130 \"Perceived loneliness, problematic pornography use, and psychological distress in Ecuadorian university students: a correlational path analysis\" (CC BY, first published 2026-09-07) reports: \"These findings suggest that problematic pornography use may represent a maladaptive behavioral correlate linking perceived social disconnection with broader emotional distress.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739931","kind":"claim","label":"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42739931"]},"sources":[{"id":"source.frontier.pmid-42739931","title":"Europe PMC record PMID 42739931: Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739931%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176927","title":"doi:10.3390/jcm15176927","url":"https://doi.org/10.3390/jcm15176927"}],"status":"frontier","summary":"PMID 42739931 \"Beyond Tumor Control in Sporadic Neuroendocrine Tumor: Metabolic and Bone Health During Treatment with Somatostatin Analogs\" (CC BY, first published 2026-09-07) reports: \": SSA treatment in patients with sporadic NETs is associated with a significant impairment of glycemic control.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739910","kind":"claim","label":"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42739910"]},"sources":[{"id":"source.frontier.pmid-42739910","title":"Europe PMC record PMID 42739910: A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739910%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176907","title":"doi:10.3390/jcm15176907","url":"https://doi.org/10.3390/jcm15176907"}],"status":"frontier","summary":"PMID 42739910 \"A Multidimensional Profile of Quality of Life in Patients Living with Long-Term Mechanical Circulatory Support\" (CC BY, first published 2026-09-07) reports: \"The use of MCS is associated with a significantly higher patient QoL in all analyzed dimensions compared to individuals without support.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42738411","kind":"claim","label":"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42738411"]},"sources":[{"id":"source.frontier.pmid-42738411","title":"Europe PMC record PMID 42738411: Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Im","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42738411%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/cancers18172891","title":"doi:10.3390/cancers18172891","url":"https://doi.org/10.3390/cancers18172891"}],"status":"frontier","summary":"PMID 42738411 \"Evolving Clinicopathological Characteristics of Women with Locally Advanced Cervical Cancer Treated with Definitive Chemoradiation Before and After Implementation of Organized Cervical Cancer Screening in Serbia\" (CC BY, first published 2026-09-07) reports: \"This study demonstrated clinically relevant temporal changes in the demographic and clinicopathological characteristics of women requiring definitive chemoradiation for LACC in Serbia.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737031","kind":"claim","label":"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.pmid-42737031"]},"sources":[{"id":"source.frontier.pmid-42737031","title":"Europe PMC record PMID 42737031: Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitati","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737031%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14172873","title":"doi:10.3390/healthcare14172873","url":"https://doi.org/10.3390/healthcare14172873"}],"status":"frontier","summary":"PMID 42737031 \"Recovery Capital and Family Support Among Incarcerated Men with a History of Psychoactive Substance Use in a Single Romanian Penitentiary: A Qualitative Study\" (CC BY, first published 2026-09-07) reports: \"Substance use disorders are common in the prison population and are associated with relapse and criminal recidivism, yet qualitative evidence on recovery capital and family support within Eastern European penitentiary systems remains limited.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42783218","kind":"claim","label":"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.pmid-42783218"]},"sources":[{"id":"source.frontier.pmid-42783218","title":"Europe PMC record PMID 42783218: Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-Wor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42783218%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/diseases14090325","title":"doi:10.3390/diseases14090325","url":"https://doi.org/10.3390/diseases14090325"}],"status":"frontier","summary":"PMID 42783218 \"Associations Between Anti-TNF Pharmacokinetics, Immunogenicity, and Therapeutic Response in Iraqi Patients with Inflammatory Bowel Disease: A Real-World Therapeutic Drug Monitoring Study\" (CC BY, first published 2026-09-05) reports: \": Favorable therapeutic outcomes in Iraqi IBD patients treated with anti-TNF agents were associated with adequate serum trough levels and low ADAb levels.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42831226","kind":"claim","label":"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42831226"]},"sources":[{"id":"source.frontier.pmid-42831226","title":"Europe PMC record PMID 42831226: Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831226%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115797","title":"doi:10.7759/cureus.115797","url":"https://doi.org/10.7759/cureus.115797"}],"status":"frontier","summary":"PMID 42831226 \"Differentiating Persistent Sepsis From Pembrolizumab-Induced Secondary Hemophagocytic Lymphohistiocytosis and Concurrent Immune-Mediated Nephritis: A Diagnostic and Therapeutic Challenge\" (CC BY, first published 2026-09-04) reports: \"We report the case of a 39-year-old woman with triple-negative breast cancer who underwent neoadjuvant chemo-immunotherapy with carboplatin, paclitaxel, epirubicin, cyclophosphamide, and pembrolizumab.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42831114","kind":"claim","label":"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42831114"]},"sources":[{"id":"source.frontier.pmid-42831114","title":"Europe PMC record PMID 42831114: Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42831114%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115778","title":"doi:10.7759/cureus.115778","url":"https://doi.org/10.7759/cureus.115778"}],"status":"frontier","summary":"PMID 42831114 \"Glioblastoma Masquerading as a Presumed Ischemic Stroke: A Case of Delusional Jealousy and Fluctuating Psychosis\" (CC BY, first published 2026-09-04) reports: \"We report a case in which glioblastoma was ultimately identified as the cause of a subacute psychotic syndrome that had initially been attributed to a preceding cerebrovascular diagnosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761220","kind":"claim","label":"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761220"]},"sources":[{"id":"source.frontier.pmid-42761220","title":"Europe PMC record PMID 42761220: The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating rol","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761220%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1918525","title":"doi:10.3389/fpsyg.2026.1918525","url":"https://doi.org/10.3389/fpsyg.2026.1918525"}],"status":"frontier","summary":"PMID 42761220 \"The relationship between AI anxiety and academic motivation among university students: the mediating role of emotion regulation and the moderating role of gender\" (CC BY, first published 2026-09-04) reports: \"These findings suggest that AI literacy education should integrate emotion-regulation and metacognitive support with differentiated learning assistance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761051","kind":"claim","label":"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761051"]},"sources":[{"id":"source.frontier.pmid-42761051","title":"Europe PMC record PMID 42761051: Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761051%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1941386","title":"doi:10.3389/fmed.2026.1941386","url":"https://doi.org/10.3389/fmed.2026.1941386"}],"status":"frontier","summary":"PMID 42761051 \"Disseminated intravascular coagulation as a prognostic factor in heatstroke: a retrospective cohort study based on Japanese insurance claims\" (CC BY, first published 2026-09-04) reports: \"JAAM-2 DIC is associated with poor clinical outcomes in patients with heatstroke, supporting the clinical importance of recognizing coagulopathy in this population.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761040","kind":"claim","label":"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42761040"]},"sources":[{"id":"source.frontier.pmid-42761040","title":"Europe PMC record PMID 42761040: RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761040%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1894867","title":"doi:10.3389/fcimb.2026.1894867","url":"https://doi.org/10.3389/fcimb.2026.1894867"}],"status":"frontier","summary":"PMID 42761040 \"RNA virome comparison between sylvatic and urban-interface mosquitoes from Southeastern Brazil\" (CC BY, first published 2026-09-04) reports: \"These findings indicate that intrinsic mosquito biology is the main driver of viral community structure, while environmental gradients play a secondary role, and highlight the importance of host-associated processes in shaping viral diversity at the Neotropical forest-urban interface.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739854","kind":"claim","label":"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42739854"]},"sources":[{"id":"source.frontier.pmid-42739854","title":"Europe PMC record PMID 42739854: Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739854%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176851","title":"doi:10.3390/jcm15176851","url":"https://doi.org/10.3390/jcm15176851"}],"status":"frontier","summary":"PMID 42739854 \"Inflammatory Bowel Disease in Kazakhstan: Phenotypes, Disease Activity, and Treatment Patterns from a National Registry\" (CC BY, first published 2026-09-04) reports: \"In UC, active disease was independently associated with rural residence (aOR 2.11; 95% CI 1.25-3.56), ≥2 exacerbations per year (aOR 3.47; 95% CI 2.18-5.51), current corticosteroid therapy (aOR 5.96; 95% CI 3.04-11.69), and immunosuppressive therapy (aOR 2.71; 95% CI 1.15-6.38), whereas rare exacerbations were associated with lower odds of activity (aOR 0.41; 95% CI 0.23-0.73).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42698113","kind":"claim","label":"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.pmid-42698113"]},"sources":[{"id":"source.frontier.pmid-42698113","title":"Europe PMC record PMID 42698113: A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698113%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42494-026-00277-z","title":"doi:10.1186/s42494-026-00277-z","url":"https://doi.org/10.1186/s42494-026-00277-z"}],"status":"frontier","summary":"PMID 42698113 \"A decade later: a longitudinal retrospective cohort study of the clinical course of childhood-onset epilepsy in a multi-ethnic tertiary centre\" (CC BY, first published 2026-09-04) reports: \"Childhood-onset epilepsy is associated with substantial long-term neurodevelopmental and psychosocial consequences.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42830983","kind":"claim","label":"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42830983"]},"sources":[{"id":"source.frontier.pmid-42830983","title":"Europe PMC record PMID 42830983: Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42830983%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115747","title":"doi:10.7759/cureus.115747","url":"https://doi.org/10.7759/cureus.115747"}],"status":"frontier","summary":"PMID 42830983 \"Pancytopenia Misattributed to Parvovirus B19 Infection Revealing Acute Promyelocytic Leukemia\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 17-year-old previously healthy female presenting with persistent fever and tonsillitis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42757226","kind":"claim","label":"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42757226"]},"sources":[{"id":"source.frontier.pmid-42757226","title":"Europe PMC record PMID 42757226: Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and health","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42757226%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1726738","title":"doi:10.3389/fpsyt.2026.1726738","url":"https://doi.org/10.3389/fpsyt.2026.1726738"}],"status":"frontier","summary":"PMID 42757226 \"Prevalence of physical comorbidities and multimorbidity in Borderline Personality Disorder: risk factors and comparisons with schizophrenia and healthy controls\" (CC BY, first published 2026-09-03) reports: \"These findings indicate that physical comorbidities and multimorbidity are at least as prevalent in individuals with BPD as in those with schizophrenia, with age and impulsivity emerging as key contributing factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42756514","kind":"claim","label":"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42756514"]},"sources":[{"id":"source.frontier.pmid-42756514","title":"Europe PMC record PMID 42756514: Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42756514%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1930046","title":"doi:10.3389/fneur.2026.1930046","url":"https://doi.org/10.3389/fneur.2026.1930046"}],"status":"frontier","summary":"PMID 42756514 \"Pharmacological management in frontotemporal dementia and patient outcomes: a retrospective cohort study using the TriNetX platform\" (CC BY, first published 2026-09-03) reports: \"In matched analyses, PHM exposure was associated with a significantly higher risk of HBAC [risk ratio (RR) = 2.20; 95% confidence interval (CI), 1.35-3.57] and lower event-free survival (12.8% vs. 62.7%).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755864","kind":"claim","label":"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755864"]},"sources":[{"id":"source.frontier.pmid-42755864","title":"Europe PMC record PMID 42755864: Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755864%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1882392","title":"doi:10.3389/fendo.2026.1882392","url":"https://doi.org/10.3389/fendo.2026.1882392"}],"status":"frontier","summary":"PMID 42755864 \"Microbial metabolite-mediated modulation of enteroendocrine and immune pathways by <i>Lactiplantibacillus pentosus</i> CECT 8039 in early diet-induced obesity\" (CC BY, first published 2026-09-03) reports: \", HFD-fed mice showed a 34.9 ± 5.5% body-weight gain, whereas probiotic supplementation was associated with a 13.2 ± 4.7% lower relative body-weight gain compared with the HFD control group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755797","kind":"claim","label":"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755797"]},"sources":[{"id":"source.frontier.pmid-42755797","title":"Europe PMC record PMID 42755797: Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755797%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcvm.2026.1841043","title":"doi:10.3389/fcvm.2026.1841043","url":"https://doi.org/10.3389/fcvm.2026.1841043"}],"status":"frontier","summary":"PMID 42755797 \"Combined assessment of carotid intima-media thickness and epicardial fat thickness for cardiovascular risk stratification in asymptomatic South Indian adults\" (CC BY, first published 2026-09-03) reports: \"Increasing age and cumulative cardiovascular risk-factor burden were associated with progressive increases in both imaging markers.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755627","kind":"claim","label":"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755627"]},"sources":[{"id":"source.frontier.pmid-42755627","title":"Europe PMC record PMID 42755627: Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755627%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1936529","title":"doi:10.3389/fmed.2026.1936529","url":"https://doi.org/10.3389/fmed.2026.1936529"}],"status":"frontier","summary":"PMID 42755627 \"Isolated gastrointestinal hereditary angioedema associated with a pathogenic <i>SERPING1</i> variant arising <i>de novo</i>: a case report\" (CC BY, first published 2026-09-03) reports: \"We report the case of a 28-year-old female with an over 6-year history of recurrent, self-limiting abdominal pain.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42755626","kind":"claim","label":"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.pmid-42755626"]},"sources":[{"id":"source.frontier.pmid-42755626","title":"Europe PMC record PMID 42755626: Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42755626%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1906472","title":"doi:10.3389/fneur.2026.1906472","url":"https://doi.org/10.3389/fneur.2026.1906472"}],"status":"frontier","summary":"PMID 42755626 \"Patent foramen ovale is associated with white matter hyperintensities in young adults: a case-control study\" (CC BY, first published 2026-09-03) reports: \"These findings suggest that PFO diameter may be associated with WMH severity in young adults.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796692","kind":"claim","label":"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42796692"]},"sources":[{"id":"source.frontier.pmid-42796692","title":"Europe PMC record PMID 42796692: Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796692%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/pathogens15090924","title":"doi:10.3390/pathogens15090924","url":"https://doi.org/10.3390/pathogens15090924"}],"status":"frontier","summary":"PMID 42796692 \"Partial Oral Antibiotic Therapy for Infective Endocarditis: A Practical Review of Current Evidence and Guidelines\" (CC BY, first published 2026-09-02) reports: \"Infective endocarditis (IE) is associated with an in-hospital mortality rate of 15-30%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42688919","kind":"claim","label":"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42688919"]},"sources":[{"id":"source.frontier.pmid-42688919","title":"Europe PMC record PMID 42688919: Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688919%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crcc/7875906","title":"doi:10.1155/crcc/7875906","url":"https://doi.org/10.1155/crcc/7875906"}],"status":"frontier","summary":"PMID 42688919 \"Acute Respiratory Failure due to Pulmonary Toxoplasmosis in an Immunocompetent Patient: A Case Report\" (CC BY, first published 2026-09-02) reports: \"We report the case of a previously healthy 32-year-old man who presented with a mononucleosis-like syndrome complicated by rapidly progressive hypoxemic respiratory failure requiring invasive mechanical ventilation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42688865","kind":"claim","label":"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42688865"]},"sources":[{"id":"source.frontier.pmid-42688865","title":"Europe PMC record PMID 42688865: Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42688865%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crh/8921605","title":"doi:10.1155/crh/8921605","url":"https://doi.org/10.1155/crh/8921605"}],"status":"frontier","summary":"PMID 42688865 \"Celiac Disease Emerging After ASCT in Multiple Myeloma: A Rare Diagnostic Intersection and Literature Review\" (CC BY, first published 2026-09-02) reports: \"We report a 53-year-old woman with lambda light-chain multiple myeloma who achieved complete remission after bortezomib, lenalidomide, and dexamethasone induction followed by ASCT and lenalidomide maintenance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42687189","kind":"claim","label":"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42687189"]},"sources":[{"id":"source.frontier.pmid-42687189","title":"Europe PMC record PMID 42687189: Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687189%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42466-026-00528-x","title":"doi:10.1186/s42466-026-00528-x","url":"https://doi.org/10.1186/s42466-026-00528-x"}],"status":"frontier","summary":"PMID 42687189 \"Implementation of specialised care improves survival in patients with amyotrophic lateral sclerosis\" (CC BY, first published 2026-09-02) reports: \"Specialised care was associated with improved survival in this real-world ALS cohort, likely reflecting the cumulative effect of coordinated multidisciplinary management rather than individual interventions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42685061","kind":"claim","label":"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.pmid-42685061"]},"sources":[{"id":"source.frontier.pmid-42685061","title":"Europe PMC record PMID 42685061: Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic ther","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42685061%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0357706","title":"doi:10.1371/journal.pone.0357706","url":"https://doi.org/10.1371/journal.pone.0357706"}],"status":"frontier","summary":"PMID 42685061 \"Association between triglyceride-glucose index and all-cause mortality in non-diabetic patients with fibrotic lung disease receiving antifibrotic therapy: A retrospective cohort study\" (CC BY, first published 2026-09-02) reports: \"Fibrotic lung diseases are associated with significant morbidity and mortality, with a rising prevalence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42825005","kind":"claim","label":"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42825005"]},"sources":[{"id":"source.frontier.pmid-42825005","title":"Europe PMC record PMID 42825005: Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42825005%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115582","title":"doi:10.7759/cureus.115582","url":"https://doi.org/10.7759/cureus.115582"}],"status":"frontier","summary":"PMID 42825005 \"Occult Bartonella Quintana Infective Endocarditis Incidentally Diagnosed During Pre-Transcatheter Aortic Valve Implantation (TAVI) Workup in a Patient Without Classical Risk Factors\" (CC BY, first published 2026-09-01) reports: \"We report the case of an 84-year-old man with severe calcific aortic stenosis who was undergoing evaluation for pre-transcatheter aortic valve implantation (TAVI).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42823403","kind":"claim","label":"Global incidence of esophageal cancer by histological and anatomical subtypes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42823403"]},"sources":[{"id":"source.frontier.pmid-42823403","title":"Europe PMC record PMID 42823403: Global incidence of esophageal cancer by histological and anatomical subtypes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42823403%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76540-1","title":"doi:10.1038/s41467-026-76540-1","url":"https://doi.org/10.1038/s41467-026-76540-1"}],"status":"frontier","summary":"PMID 42823403 \"Global incidence of esophageal cancer by histological and anatomical subtypes\" (CC BY, first published 2026-09-01) reports: \"Here we show that Eastern Asia has the highest age-standardized rate (ASR) of incidence of esophageal squamous cell carcinoma (ESCC) (7.2 per 100,000 population) and upper- and middle-third esophageal cancer (6.0), whereas Northern Europe exhibits the highest ASR of incidence of esophageal adenocarcinoma (EAC) (3.2) and lower‑third esophageal cancer (3.6).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42818964","kind":"claim","label":"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42818964"]},"sources":[{"id":"source.frontier.pmid-42818964","title":"Europe PMC record PMID 42818964: Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42818964%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12669/pjms.42.9.13794","title":"doi:10.12669/pjms.42.9.13794","url":"https://doi.org/10.12669/pjms.42.9.13794"}],"status":"frontier","summary":"PMID 42818964 \"Clinicopathological profile and outcomes of pediatric glomerular diseases: A tertiary care experience\" (CC BY, first published 2026-09-01) reports: \"Outcome of our study showed that majority (75.7%), had preserved renal functions whereas, 5.6 % developed chronic kidney disease.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42803191","kind":"claim","label":"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42803191"]},"sources":[{"id":"source.frontier.pmid-42803191","title":"Europe PMC record PMID 42803191: Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42803191%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/nar/gkag929","title":"doi:10.1093/nar/gkag929","url":"https://doi.org/10.1093/nar/gkag929"}],"status":"frontier","summary":"PMID 42803191 \"Targeted ortholog search in unannotated genome assemblies with fDOG-Assembly\" (CC BY, first published 2026-09-01) reports: \"We found that orthologs of β-lactam biosynthesis genes are widespread in springtails, with individual species possessing nearly complete cephamycin biosynthetic gene sets, suggesting they may represent previously unrecognized natural producers of β-lactam antibiotics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42802368","kind":"claim","label":"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42802368"]},"sources":[{"id":"source.frontier.pmid-42802368","title":"Europe PMC record PMID 42802368: Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42802368%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/cch.70346","title":"doi:10.1111/cch.70346","url":"https://doi.org/10.1111/cch.70346"}],"status":"frontier","summary":"PMID 42802368 \"Who Uses Services Overall and Within High-Need Families? Social Inequalities in Access to Early Support Services in Southern Germany\" (CC BY, first published 2026-09-01) reports: \"A socio-economic gradient was also observed: Lower household income was associated with higher uptake, while higher parental education was associated with higher use.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798137","kind":"claim","label":"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42798137"]},"sources":[{"id":"source.frontier.pmid-42798137","title":"Europe PMC record PMID 42798137: Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southw","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798137%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70551","title":"doi:10.1111/mec.70551","url":"https://doi.org/10.1111/mec.70551"}],"status":"frontier","summary":"PMID 42798137 \"Differential Demographic Trajectories and Polygenic Adaptation to Monsoon Seasonality in Sky Island Hercules Beetle Populations of the American Southwest\" (CC BY, first published 2026-09-01) reports: \"Our results demonstrate how integrating demographic inference, divergence genomics and landscape genomics with whole-genome data, including historical museum specimens, can simultaneously advance understanding of evolutionary history and inform actionable conservation strategies in the future.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42798110","kind":"claim","label":"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42798110"]},"sources":[{"id":"source.frontier.pmid-42798110","title":"Europe PMC record PMID 42798110: The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42798110%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050870","title":"doi:10.1097/md.0000000000050870","url":"https://doi.org/10.1097/md.0000000000050870"}],"status":"frontier","summary":"PMID 42798110 \"The effect of different endoscopic tattooing doses in laparoscopic colorectal tumor surgery\" (CC BY, first published 2026-09-01) reports: \"Low-dose tattooing is associated with lower cost and reduced risk of spillage into the peritoneum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42782937","kind":"claim","label":"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42782937"]},"sources":[{"id":"source.frontier.pmid-42782937","title":"Europe PMC record PMID 42782937: Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous H","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42782937%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/dj14090550","title":"doi:10.3390/dj14090550","url":"https://doi.org/10.3390/dj14090550"}],"status":"frontier","summary":"PMID 42782937 \"Five-Year Retrospective Radiographic Analysis of Peri-Implant Bone Stability: A Comparison Between Two Socket Preservation Protocols and Spontaneous Healing\" (CC BY, first published 2026-09-01) reports: \"Within the limitations of this pilot study, the results suggest that the choice of barrier membrane in socket preservation procedures could affect 5-year marginal bone stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42776569","kind":"claim","label":"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42776569"]},"sources":[{"id":"source.frontier.pmid-42776569","title":"Europe PMC record PMID 42776569: Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42776569%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1099/mgen.0.001826","title":"doi:10.1099/mgen.0.001826","url":"https://doi.org/10.1099/mgen.0.001826"}],"status":"frontier","summary":"PMID 42776569 \"Host-strain compatibility shapes host transcriptional responses in macrophage <i>in vitro</i> infection models of <i>Mycobacterium tuberculosis</i>\" (CC BY, first published 2026-09-01) reports: \"These analyses revealed lineage- and macrophage-context-dependent expression patterns and reduced intracellular burden and cytotoxicity in THP-1m but not in BoMac.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42768698","kind":"claim","label":"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42768698"]},"sources":[{"id":"source.frontier.pmid-42768698","title":"Europe PMC record PMID 42768698: Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42768698%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70550","title":"doi:10.1111/mec.70550","url":"https://doi.org/10.1111/mec.70550"}],"status":"frontier","summary":"PMID 42768698 \"Chromatin Accessibility Reveals Adaptive Regulatory Variation in a Keystone Freshwater Fish\" (CC BY, first published 2026-09-01) reports: \"This study demonstrates that humic adaptation in perch targets specific regulatory regions readily identified by the ATAC-seq approach, highlighting the value of functional chromatin maps in evolutionary genomics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42760703","kind":"claim","label":"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42760703"]},"sources":[{"id":"source.frontier.pmid-42760703","title":"Europe PMC record PMID 42760703: Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42760703%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1097/md.0000000000050725","title":"doi:10.1097/md.0000000000050725","url":"https://doi.org/10.1097/md.0000000000050725"}],"status":"frontier","summary":"PMID 42760703 \"Unpacking the pathways using the stress and coping theory: How social support reduces substance abuse through depression\" (CC BY, first published 2026-09-01) reports: \"The Pearson correlation demonstrated a substantial positive relationship between depression and substance abuse; however, higher levels of social support are associated with a decreased likelihood of substance abuse and depression among students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746056","kind":"claim","label":"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42746056"]},"sources":[{"id":"source.frontier.pmid-42746056","title":"Europe PMC record PMID 42746056: Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framewo","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746056%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1794662","title":"doi:10.3389/fimmu.2026.1794662","url":"https://doi.org/10.3389/fimmu.2026.1794662"}],"status":"frontier","summary":"PMID 42746056 \"Intrathecal IgG synthesis as a biomarker for CNS involvement in anti-GQ1b antibody syndrome: a case report and hypothesis-generating treatment framework\" (CC BY, first published 2026-09-01) reports: \"We report a 37-year-old woman with a relapsing GBS-Miller Fisher syndrome (MFS)-BBE overlap phenotype.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42745765","kind":"claim","label":"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42745765"]},"sources":[{"id":"source.frontier.pmid-42745765","title":"Europe PMC record PMID 42745765: Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42745765%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1890094","title":"doi:10.3389/fendo.2026.1890094","url":"https://doi.org/10.3389/fendo.2026.1890094"}],"status":"frontier","summary":"PMID 42745765 \"Gut microbiota variation in admixed Hispanic populations with polyendocrine metabolic ovarian syndrome\" (CC BY, first published 2026-09-01) reports: \"Metabolic markers, androgen levels, and reproductive features were not significantly associated with global microbiome diversity or composition; however, irregular menses was associated with greater microbiome dispersion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42742452","kind":"claim","label":"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42742452"]},"sources":[{"id":"source.frontier.pmid-42742452","title":"Europe PMC record PMID 42742452: Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42742452%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/iid3.70523","title":"doi:10.1002/iid3.70523","url":"https://doi.org/10.1002/iid3.70523"}],"status":"frontier","summary":"PMID 42742452 \"Gut Microbiota Dysbiosis Mediates <sup>125</sup>I-Induced Radiation Colitis via Host Transcriptional Regulation\" (CC BY, first published 2026-09-01) reports: \"I irradiation is associated with gut dysbiosis and concurrent host immune‑transcriptional reprogramming, which may jointly contribute to radiation colitis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737913","kind":"claim","label":"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42737913"]},"sources":[{"id":"source.frontier.pmid-42737913","title":"Europe PMC record PMID 42737913: Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737913%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biology15171481","title":"doi:10.3390/biology15171481","url":"https://doi.org/10.3390/biology15171481"}],"status":"frontier","summary":"PMID 42737913 \"Adaptive Evolution of the PFK Gene Family in Chinese Longsnout Catfish, <i>Leiocassis longirostris</i>\" (CC BY, first published 2026-09-01) reports: \"The results indicate that glucose metabolism-related genes have undergone significant reshaping during evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42709467","kind":"claim","label":"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42709467"]},"sources":[{"id":"source.frontier.pmid-42709467","title":"Europe PMC record PMID 42709467: Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheum","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42709467%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/acr2.90145","title":"doi:10.1002/acr2.90145","url":"https://doi.org/10.1002/acr2.90145"}],"status":"frontier","summary":"PMID 42709467 \"Clinical Phenotypes, Treatment, and Outcomes of Rheumatic Immune-Related Adverse Events in Patients Treated With Immune Checkpoint Inhibitors: A Rheumatologists-Referred Multicenter German Registry Cohort\" (CC BY, first published 2026-09-01) reports: \"Male sex was associated with treatment escalation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42708953","kind":"claim","label":"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42708953"]},"sources":[{"id":"source.frontier.pmid-42708953","title":"Europe PMC record PMID 42708953: Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42708953%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1021/acs.est.6c05759","title":"doi:10.1021/acs.est.6c05759","url":"https://doi.org/10.1021/acs.est.6c05759"}],"status":"frontier","summary":"PMID 42708953 \"Adaptive Evolution Reveals Metabolic Plasticity and Functional Redundancy in an Anaerobic Microbiome under Extreme Ammonia Stress\" (CC BY, first published 2026-09-01) reports: \"Collectively, these findings demonstrate that metabolic plasticity and the preservation of core metabolic functions are the primary determinants of ammonia resilience, sustaining methane production under inhibitory conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42706664","kind":"claim","label":"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42706664"]},"sources":[{"id":"source.frontier.pmid-42706664","title":"Europe PMC record PMID 42706664: The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42706664%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jcop.70146","title":"doi:10.1002/jcop.70146","url":"https://doi.org/10.1002/jcop.70146"}],"status":"frontier","summary":"PMID 42706664 \"The Silent Rejection: The Indirect Path From Partner Phubbing to Psychological Well-Being Through Self-Esteem and Romantic Loneliness\" (CC BY, first published 2026-09-01) reports: \"In this context, it is important to examine how this form of digital disengagement in romantic relationships is associated with individuals' psychological well-being, as well as the mediating variables that may help explain this relationship.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42687444","kind":"claim","label":"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42687444"]},"sources":[{"id":"source.frontier.pmid-42687444","title":"Europe PMC record PMID 42687444: Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42687444%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/brb3.71714","title":"doi:10.1002/brb3.71714","url":"https://doi.org/10.1002/brb3.71714"}],"status":"frontier","summary":"PMID 42687444 \"Cognitive Reserve and Psychological Well-Being in Aging Population of Community-Dwellers in Spain\" (CC BY, first published 2026-09-01) reports: \"Greater brain resilience-the capacity of the brain to maintain normal functioning and cognition with aging-is associated with a slower cognitive decline.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42670810","kind":"claim","label":"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42670810"]},"sources":[{"id":"source.frontier.pmid-42670810","title":"Europe PMC record PMID 42670810: Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced I","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42670810%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/jbt.71104","title":"doi:10.1002/jbt.71104","url":"https://doi.org/10.1002/jbt.71104"}],"status":"frontier","summary":"PMID 42670810 \"Inhibition of Tropomyosin Receptor Kinase B Signaling Alters Hepatic Mitochondrial Enzyme Activity and Oxidative Stress in Mice With Sucrose-Induced Insulin Resistance\" (CC BY, first published 2026-09-01) reports: \"Conversely, TrkB inhibition was associated with increased cytochrome c oxidase activity, altered SOD activity, and reduced hepatic MDA concentrations compared with the Sucrose+DMSO group, suggesting partial modulation of oxidative stress-related biochemical alterations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42663084","kind":"claim","label":"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42663084"]},"sources":[{"id":"source.frontier.pmid-42663084","title":"Europe PMC record PMID 42663084: Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42663084%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70525","title":"doi:10.1111/mec.70525","url":"https://doi.org/10.1111/mec.70525"}],"status":"frontier","summary":"PMID 42663084 \"Local Trade-Offs Shape Flower Size Evolution Across Arabidopsis thaliana Distribution\" (CC BY, first published 2026-09-01) reports: \"We find extensive variation in flower size underpinned by a polygenic architecture, in which derived alleles both increase or decrease petal size and show signatures of positive selection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42657789","kind":"claim","label":"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42657789"]},"sources":[{"id":"source.frontier.pmid-42657789","title":"Europe PMC record PMID 42657789: Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657789%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/molbev/msag221","title":"doi:10.1093/molbev/msag221","url":"https://doi.org/10.1093/molbev/msag221"}],"status":"frontier","summary":"PMID 42657789 \"Disruption of mitonuclear coadaptation and compensatory evolution after an extreme dietary shift in carnivorous butterflies\" (CC BY, first published 2026-09-01) reports: \"By generating high-quality genome assemblies, we found that Miletinae exhibit extensive chromosomal rearrangements.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42657744","kind":"claim","label":"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42657744"]},"sources":[{"id":"source.frontier.pmid-42657744","title":"Europe PMC record PMID 42657744: The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42657744%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/tpg2.70242","title":"doi:10.1002/tpg2.70242","url":"https://doi.org/10.1002/tpg2.70242"}],"status":"frontier","summary":"PMID 42657744 \"The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species\" (CC BY, first published 2026-09-01) reports: \"These results indicate that an HGT-derived DNA block can persist, amplify, and diversify in recipient genomes, generating raw material for later functional evolution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42530440","kind":"claim","label":"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42530440"]},"sources":[{"id":"source.frontier.pmid-42530440","title":"Europe PMC record PMID 42530440: De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42530440%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/gbe/evag194","title":"doi:10.1093/gbe/evag194","url":"https://doi.org/10.1093/gbe/evag194"}],"status":"frontier","summary":"PMID 42530440 \"De Novo Genome Sequence Assembly of the Algal Endosymbiont Micractinium conductrix Derived From Its Host Paramecium bursaria 186b\" (CC BY, first published 2026-09-01) reports: \"Here, we report a near telomere-to-telomere genome assembly for M. conductrix 186b, using a range of sequencing technologies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42522920","kind":"claim","label":"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42522920"]},"sources":[{"id":"source.frontier.pmid-42522920","title":"Europe PMC record PMID 42522920: A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42522920%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/tpg2.70286","title":"doi:10.1002/tpg2.70286","url":"https://doi.org/10.1002/tpg2.70286"}],"status":"frontier","summary":"PMID 42522920 \"A high-quality haplotype-resolved genome of Pyrus calleryana provides insights into adaptive gene families\" (CC BY, first published 2026-09-01) reports: \"Here, we report the first haplotype-resolved, chromosome-scale genome of P. calleryana.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42379141","kind":"claim","label":"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42379141"]},"sources":[{"id":"source.frontier.pmid-42379141","title":"Europe PMC record PMID 42379141: Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42379141%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/npr2.70152","title":"doi:10.1002/npr2.70152","url":"https://doi.org/10.1002/npr2.70152"}],"status":"frontier","summary":"PMID 42379141 \"Contribution of the Serotonin 5-HT<sub>2A</sub> Receptor to the Therapeutic Effect of Psilocin on Social Behavior Deficits in Mice Repeatedly Exposed to Social Defeat Stress\" (CC BY, first published 2026-09-01) reports: \"Furthermore, we found that this effect is mediated by 5-HT2AR activation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42372111","kind":"claim","label":"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42372111"]},"sources":[{"id":"source.frontier.pmid-42372111","title":"Europe PMC record PMID 42372111: Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42372111%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/g3journal/jkag171","title":"doi:10.1093/g3journal/jkag171","url":"https://doi.org/10.1093/g3journal/jkag171"}],"status":"frontier","summary":"PMID 42372111 \"Revisiting the genome assembly of Lupinus species reveals differential diploidization after a shared whole-genome duplication\" (CC BY, first published 2026-09-01) reports: \"Our corrected assemblies provide optimal references for Lupinus comparative genomics, and our findings demonstrate that a shared WGD event can lead to both conserved and highly divergent postpolyploid fates, likely underpinning adaptive diversification within the genus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42231562","kind":"claim","label":"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.pmid-42231562"]},"sources":[{"id":"source.frontier.pmid-42231562","title":"Europe PMC record PMID 42231562: Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospecti","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42231562%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/sleep/zsag140","title":"doi:10.1093/sleep/zsag140","url":"https://doi.org/10.1093/sleep/zsag140"}],"status":"frontier","summary":"PMID 42231562 \"Real-world effectiveness and safety of tonic motor activation therapy for refractory restless legs syndrome: 90-day outcomes from the THRIVE prospective observational study\" (CC BY, first published 2026-09-01) reports: \"We report that the effectiveness and safety of TOMAC is similar in real-world practice compared to controlled trials.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42824002","kind":"claim","label":"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42824002"]},"sources":[{"id":"source.frontier.pmid-42824002","title":"Europe PMC record PMID 42824002: A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42824002%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115550","title":"doi:10.7759/cureus.115550","url":"https://doi.org/10.7759/cureus.115550"}],"status":"frontier","summary":"PMID 42824002 \"A Case of Urinary Tract Infection Resulting From Voiding Dysfunction Caused by Sacral Herpes Zoster Involving the Left Buttock\" (CC BY, first published 2026-08-31) reports: \"We report the case of a woman with a history of living-donor kidney transplantation who developed urinary retention and pyelonephritis following herpes zoster involving the buttock.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42820092","kind":"claim","label":"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42820092"]},"sources":[{"id":"source.frontier.pmid-42820092","title":"Europe PMC record PMID 42820092: Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospect","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42820092%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115505","title":"doi:10.7759/cureus.115505","url":"https://doi.org/10.7759/cureus.115505"}],"status":"frontier","summary":"PMID 42820092 \"Timing of Do-Not-Resuscitate Order Establishment Varies by Illness Trajectory and Clinical Context in Children Receiving Palliative Care: A Retrospective Cohort Study\" (CC BY, first published 2026-08-31) reports: \"Life-limiting illness without a realistic hope of cure was associated with a higher hazard of DNR establishment (adjusted hazard ratio (adjHR) = 2.10, 95% confidence interval (CI) = 1.14-3.86, p = 0.017).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42741165","kind":"claim","label":"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42741165"]},"sources":[{"id":"source.frontier.pmid-42741165","title":"Europe PMC record PMID 42741165: Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinji","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741165%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fvets.2026.1892252","title":"doi:10.3389/fvets.2026.1892252","url":"https://doi.org/10.3389/fvets.2026.1892252"}],"status":"frontier","summary":"PMID 42741165 \"Analysis of differences in gut microbiota structure and function in Bactrian camels under different breeding patterns from northern and southern Xinjiang, China\" (CC BY, first published 2026-08-31) reports: \"The findings indicated that the diversity and abundance of gut microbiota in the BJT group were significantly increased compared with those in the NJT group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729934","kind":"claim","label":"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42729934"]},"sources":[{"id":"source.frontier.pmid-42729934","title":"Europe PMC record PMID 42729934: Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729934%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.48101/ujms.v131.14047","title":"doi:10.48101/ujms.v131.14047","url":"https://doi.org/10.48101/ujms.v131.14047"}],"status":"frontier","summary":"PMID 42729934 \"Sex differences in monitoring and achievement of blood pressure and LDL-cholesterol targets in chronic coronary syndrome\" (CC BY, first published 2026-08-31) reports: \"These findings highlight the need for systematic strategies in primary care to improve management in CCS.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42674467","kind":"claim","label":"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42674467"]},"sources":[{"id":"source.frontier.pmid-42674467","title":"Europe PMC record PMID 42674467: Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42674467%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1055/s-0046-1827210","title":"doi:10.1055/s-0046-1827210","url":"https://doi.org/10.1055/s-0046-1827210"}],"status":"frontier","summary":"PMID 42674467 \"Prognostic factors related to neurological disability after the implementation of the first stroke unit in a remote region of Brazil\" (CC BY, first published 2026-08-31) reports: \"According to the modified Rankin Scale (mRS), moderate-to-severe disability at day 90 was associated with age > 70 years (RR = 1.45; 95% CI = 1.02-4.53), previous stroke (RR = 1.35; 95% CI = 1.12-3.42), and structural heart disease (RR = 1.80; 95% CI = 1.23-3.28).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42672060","kind":"claim","label":"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.pmid-42672060"]},"sources":[{"id":"source.frontier.pmid-42672060","title":"Europe PMC record PMID 42672060: Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42672060%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0341524","title":"doi:10.1371/journal.pone.0341524","url":"https://doi.org/10.1371/journal.pone.0341524"}],"status":"frontier","summary":"PMID 42672060 \"Prevalence and associated factors of nomophobia among the medical and university students of Bangladesh\" (CC BY, first published 2026-08-31) reports: \"Multiple linear regression indicated that extended phone usage, engagement with social communication applications, middle-income position, and early-morning phone checking were associated with elevated nomophobia scores.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42796271","kind":"claim","label":"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-30","source_ids":["source.frontier.pmid-42796271"]},"sources":[{"id":"source.frontier.pmid-42796271","title":"Europe PMC record PMID 42796271: Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Rev","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42796271%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/medicina62091664","title":"doi:10.3390/medicina62091664","url":"https://doi.org/10.3390/medicina62091664"}],"status":"frontier","summary":"PMID 42796271 \"Interstitial Lung Disease and Cardiotoxicity Associated with Trastuzumab Deruxtecan, Sacituzumab Govitecan, and Trastuzumab Emtansine: A Narrative Review\" (CC BY, first published 2026-08-30) reports: \"T-DXd is associated with a clinically important ILD/pneumonitis risk (approximately 12-15% in pooled analyses), predominantly grade 1-2 but occasionally fatal, requiring proactive surveillance, immediate interruption for suspected disease, and grade-directed corticosteroid therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42791987","kind":"claim","label":"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.pmid-42791987"]},"sources":[{"id":"source.frontier.pmid-42791987","title":"Europe PMC record PMID 42791987: Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42791987%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15090837","title":"doi:10.3390/antibiotics15090837","url":"https://doi.org/10.3390/antibiotics15090837"}],"status":"frontier","summary":"PMID 42791987 \"Specialty-Related Differences in Adherence to Antibiotic Therapy Guidelines for Infective Endocarditis in Older Patients\" (CC BY, first published 2026-08-29) reports: \"The aim of this study was to determine whether the medical specialty of the unit that initiated first-line treatment for IE was associated with risk factors of non-adherence to the 2015 ESC treatment guidelines in a population of patients aged 75 years and over.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42668719","kind":"claim","label":"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.pmid-42668719"]},"sources":[{"id":"source.frontier.pmid-42668719","title":"Europe PMC record PMID 42668719: The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42668719%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/crhe/9286315","title":"doi:10.1155/crhe/9286315","url":"https://doi.org/10.1155/crhe/9286315"}],"status":"frontier","summary":"PMID 42668719 \"The Abscess That Was Cancer: Pyogenic Liver Abscess as the Initial Manifestation of Hepatocellular Carcinoma in a Noncirrhotic Patient\" (CC BY, first published 2026-08-29) reports: \"PLA presenting as the initial manifestation of HCC is associated with poor prognosis, largely due to diagnostic delays.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42792321","kind":"claim","label":"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42792321"]},"sources":[{"id":"source.frontier.pmid-42792321","title":"Europe PMC record PMID 42792321: Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42792321%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/bs16091521","title":"doi:10.3390/bs16091521","url":"https://doi.org/10.3390/bs16091521"}],"status":"frontier","summary":"PMID 42792321 \"Not All Overtime Is Equal: Differential Effects of Overtime Motivations on Employees' Sustainable Consumption Behavior\" (CC BY, first published 2026-08-28) reports: \"The findings reveal that proactive overtime motivations (development-driven, subsistence-driven, and belonging-driven) are positively associated with green purchasing behavior, whereas reactive overtime motivations (escape-type, peer pressure, and mandatory) are negatively associated with reduced consumption behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781606","kind":"claim","label":"From Distraction to Delay: Unpacking Academic Procrastination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42781606"]},"sources":[{"id":"source.frontier.pmid-42781606","title":"Europe PMC record PMID 42781606: From Distraction to Delay: Unpacking Academic Procrastination","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781606%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.5964/ejop.19203","title":"doi:10.5964/ejop.19203","url":"https://doi.org/10.5964/ejop.19203"}],"status":"frontier","summary":"PMID 42781606 \"From Distraction to Delay: Unpacking Academic Procrastination\" (CC BY, first published 2026-08-28) reports: \"These findings highlight the combined role of personal and cognitive factors in academic procrastination.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729546","kind":"claim","label":"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42729546"]},"sources":[{"id":"source.frontier.pmid-42729546","title":"Europe PMC record PMID 42729546: Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/froh.2026.1875959","title":"doi:10.3389/froh.2026.1875959","url":"https://doi.org/10.3389/froh.2026.1875959"}],"status":"frontier","summary":"PMID 42729546 \"Preliminary evidence of effectiveness of preparations from <i>Nigella sativa</i> and its leading compound thymoquinone in periodontal therapy\" (CC BY, first published 2026-08-28) reports: \"preparations or TQ was associated with improvements in clinical periodontal outcome measures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42729309","kind":"claim","label":"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42729309"]},"sources":[{"id":"source.frontier.pmid-42729309","title":"Europe PMC record PMID 42729309: The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42729309%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpubh.2026.1868817","title":"doi:10.3389/fpubh.2026.1868817","url":"https://doi.org/10.3389/fpubh.2026.1868817"}],"status":"frontier","summary":"PMID 42729309 \"The \"Information Paradox\" in crime prevention: how spatial context and age moderate the impact of safety advisories on residents' perception of safety\" (CC BY, first published 2026-08-28) reports: \"The results reveal a significant spatial divergence in information perception.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42665853","kind":"claim","label":"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42665853"]},"sources":[{"id":"source.frontier.pmid-42665853","title":"Europe PMC record PMID 42665853: Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42665853%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s42466-026-00526-z","title":"doi:10.1186/s42466-026-00526-z","url":"https://doi.org/10.1186/s42466-026-00526-z"}],"status":"frontier","summary":"PMID 42665853 \"Clinical outcomes and unmet therapeutic needs in new-onset refractory status epilepticus: evidence from a retrospective cohort\" (CC BY, first published 2026-08-28) reports: \"Beyond the clinical severity of NORSE, our findings show that cohort composition is highly sensitive to the temporal operationalization of consensus criteria.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42664264","kind":"claim","label":"Ecological theory sheds light on plasmid diversity and dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42664264"]},"sources":[{"id":"source.frontier.pmid-42664264","title":"Europe PMC record PMID 42664264: Ecological theory sheds light on plasmid diversity and dynamics","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42664264%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pbio.3003918","title":"doi:10.1371/journal.pbio.3003918","url":"https://doi.org/10.1371/journal.pbio.3003918"}],"status":"frontier","summary":"PMID 42664264 \"Ecological theory sheds light on plasmid diversity and dynamics\" (CC BY, first published 2026-08-28) reports: \"By viewing plasmids as ecological entities competing for a shared resource, the bacterial host, we show that their distribution within bacterial genomes mirrors the structure of ecological communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661611","kind":"claim","label":"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.pmid-42661611"]},"sources":[{"id":"source.frontier.pmid-42661611","title":"Europe PMC record PMID 42661611: Oncology Providers' Perspectives on Psychedelic-Assisted Therapy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661611%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1177/10499091261483604","title":"doi:10.1177/10499091261483604","url":"https://doi.org/10.1177/10499091261483604"}],"status":"frontier","summary":"PMID 42661611 \"Oncology Providers' Perspectives on Psychedelic-Assisted Therapy\" (CC BY, first published 2026-08-28) reports: \"On multivariate analysis, willingness to recommend PAT was associated with familiarity with emerging PAT data, knowledge of the legal and regulatory status of psychedelics, and prior patient inquiry about PAT.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42724033","kind":"claim","label":"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42724033"]},"sources":[{"id":"source.frontier.pmid-42724033","title":"Europe PMC record PMID 42724033: Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42724033%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1882335","title":"doi:10.3389/fpsyg.2026.1882335","url":"https://doi.org/10.3389/fpsyg.2026.1882335"}],"status":"frontier","summary":"PMID 42724033 \"Understanding food behavior through territorial identity: evidence on locavorism, certification awareness, and novel food acceptance\" (CC BY, first published 2026-08-27) reports: \"This study examines how configurations of territorial identity encompassing local, national, and global attachments are associated with food-related dispositions and behaviors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42684341","kind":"claim","label":"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42684341"]},"sources":[{"id":"source.frontier.pmid-42684341","title":"Europe PMC record PMID 42684341: Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42684341%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/95529","title":"doi:10.2196/95529","url":"https://doi.org/10.2196/95529"}],"status":"frontier","summary":"PMID 42684341 \"Feasibility of Self-Directed Learning of Cardiopulmonary Resuscitation Skills Using Interactive Video in SimZone 0: Pilot Randomized Educational Trial\" (CC BY, first published 2026-08-27) reports: \"Self-directed IV learning as a preparatory phase before instructor-led training is feasible, acceptable, and is associated with preliminary signals of enhanced CPR skill acquisition and retention among nursing students.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661048","kind":"claim","label":"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42661048"]},"sources":[{"id":"source.frontier.pmid-42661048","title":"Europe PMC record PMID 42661048: The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661048%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41598-026-67534-6","title":"doi:10.1038/s41598-026-67534-6","url":"https://doi.org/10.1038/s41598-026-67534-6"}],"status":"frontier","summary":"PMID 42661048 \"The prc gene as a high-resolution proxy for Aeromonas genus-wide clonal genealogy, phylogenomic validation and superiority over traditional MLST\" (CC BY, first published 2026-08-27) reports: \"Our results indicate that an elevated recombination-to-mutation ratio (r/m ≈ 1.70) is associated with reduced phylogenetic congruence of standard MLST loci, including gyrB, groL, and recA.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42658813","kind":"claim","label":"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.pmid-42658813"]},"sources":[{"id":"source.frontier.pmid-42658813","title":"Europe PMC record PMID 42658813: Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42658813%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354454","title":"doi:10.1371/journal.pone.0354454","url":"https://doi.org/10.1371/journal.pone.0354454"}],"status":"frontier","summary":"PMID 42658813 \"Under controlled conditions, lower concentrations of aqueous extracts of Acroptilon repens are needed to inhibit seed germination and seedling growth of weeds than crops\" (CC BY, first published 2026-08-27) reports: \"Although comprehensive ecological and agronomic assessments are needed prior to field application and further research is needed to isolate and confirm the bioactivity of these putatively identified secondary metabolites, these data suggest that A. repens aqueous extract can inhibit germination and early seedling development of problematic weeds more strongly than crops.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42799507","kind":"claim","label":"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42799507"]},"sources":[{"id":"source.frontier.pmid-42799507","title":"Europe PMC record PMID 42799507: Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42799507%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115239","title":"doi:10.7759/cureus.115239","url":"https://doi.org/10.7759/cureus.115239"}],"status":"frontier","summary":"PMID 42799507 \"Cluster Headache: Economic and Psychological Burdens of Diagnostic Errors and Delays\" (CC BY, first published 2026-08-26) reports: \"We found that direct costs include healthcare services, such as emergency department, primary care, and specialist visits, diagnostic tests, pharmacy services, oxygen therapy, and neuromodulation devices, and increased healthcare utilization, including more frequent emergency department visits.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42786167","kind":"claim","label":"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42786167"]},"sources":[{"id":"source.frontier.pmid-42786167","title":"Europe PMC record PMID 42786167: Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42786167%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-77102-1","title":"doi:10.1038/s41467-026-77102-1","url":"https://doi.org/10.1038/s41467-026-77102-1"}],"status":"frontier","summary":"PMID 42786167 \"Deep learning aging marker from retinal images unveils sex-specific clinical and genetic signatures\" (CC BY, first published 2026-08-26) reports: \"The resulting retinal age gap, i.e. the difference between predicted and chronological age, is associated with cardiometabolic traits, inflammation, cognitive performance, all-cause mortality, dementia, cancer, and incident cardiovascular disease.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719160","kind":"claim","label":"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719160"]},"sources":[{"id":"source.frontier.pmid-42719160","title":"Europe PMC record PMID 42719160: The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among co","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719160%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1890570","title":"doi:10.3389/fpsyg.2026.1890570","url":"https://doi.org/10.3389/fpsyg.2026.1890570"}],"status":"frontier","summary":"PMID 42719160 \"The sequential mediating roles of self-esteem and life satisfaction in the relationship between health perception and perceived social status among college students\" (CC BY, first published 2026-08-26) reports: \"Health awareness, self-esteem, and life satisfaction were associated with more positive perceived social status; however, longitudinal research is needed before implications for educational interventions can be drawn.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719051","kind":"claim","label":"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719051"]},"sources":[{"id":"source.frontier.pmid-42719051","title":"Europe PMC record PMID 42719051: Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719051%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpara.2026.1934996","title":"doi:10.3389/fpara.2026.1934996","url":"https://doi.org/10.3389/fpara.2026.1934996"}],"status":"frontier","summary":"PMID 42719051 \"Molecular mechanisms underlying drug resistance in protozoan parasites: emerging mechanisms and therapeutic perspectives\" (CC BY, first published 2026-08-26) reports: \"Collectively, these findings demonstrate that drug resistance is a dynamic, multifactorial evolutionary process rather than a single molecular event.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42719040","kind":"claim","label":"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42719040"]},"sources":[{"id":"source.frontier.pmid-42719040","title":"Europe PMC record PMID 42719040: Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42719040%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fspor.2026.1914085","title":"doi:10.3389/fspor.2026.1914085","url":"https://doi.org/10.3389/fspor.2026.1914085"}],"status":"frontier","summary":"PMID 42719040 \"Perfectionism and anxiety sensitivity in soccer referees: the mediating role of distress tolerance\" (CC BY, first published 2026-08-26) reports: \"The results showed that perfectionism, especially socially prescribed perfectionism, co-occurred with higher anxiety sensitivity, thereby increasing referees' emotional burden.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42718586","kind":"claim","label":"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.pmid-42718586"]},"sources":[{"id":"source.frontier.pmid-42718586","title":"Europe PMC record PMID 42718586: Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42718586%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1887708","title":"doi:10.3389/fonc.2026.1887708","url":"https://doi.org/10.3389/fonc.2026.1887708"}],"status":"frontier","summary":"PMID 42718586 \"Efficacy and safety of neoadjuvant treatment with PD-1 inhibitor in locally advanced head and neck squamous cell carcinoma\" (CC BY, first published 2026-08-26) reports: \"Neoadjuvant immunochemotherapy was associated with improved overall survival, and surgery was associated with a lower risk of death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42739550","kind":"claim","label":"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42739550"]},"sources":[{"id":"source.frontier.pmid-42739550","title":"Europe PMC record PMID 42739550: Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42739550%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15176544","title":"doi:10.3390/jcm15176544","url":"https://doi.org/10.3390/jcm15176544"}],"status":"frontier","summary":"PMID 42739550 \"Association of Recorded Cerebrospinal Fluid Diversion with Registry Outcome Status in Pediatric Medulloblastoma: An Exploratory 10-Year Single-Centre Cohort Study\" (CC BY, first published 2026-08-25) reports: \"To examine, in an exploratory institutional cohort, whether a registry record of cerebrospinal fluid (CSF) diversion was associated with the available binary registry outcome status in children with medulloblastoma, while distinguishing this intervention-related variable from radiographic hydrocephalus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737509","kind":"claim","label":"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42737509"]},"sources":[{"id":"source.frontier.pmid-42737509","title":"Europe PMC record PMID 42737509: Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737509%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177609","title":"doi:10.3390/ijms27177609","url":"https://doi.org/10.3390/ijms27177609"}],"status":"frontier","summary":"PMID 42737509 \"Molecular and Genomic Mechanisms Linking Diabetes Mellitus and Periodontitis: From Pathogenesis to Translational Opportunities\" (CC BY, first published 2026-08-25) reports: \"Chronic hyperglycemia is associated with advanced glycation end product signaling through the receptor for advanced glycation end products, mitogen-activated protein kinase/nuclear factor-κB activation, reactive oxygen species production, oxidative stress, and NLR family pyrin domain-containing 3 inflammasome activation, which may contribute to enhanced cytokine responses and periodontal tissue injury.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737499","kind":"claim","label":"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42737499"]},"sources":[{"id":"source.frontier.pmid-42737499","title":"Europe PMC record PMID 42737499: <i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737499%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177595","title":"doi:10.3390/ijms27177595","url":"https://doi.org/10.3390/ijms27177595"}],"status":"frontier","summary":"PMID 42737499 \"<i>Streptococcus salivarius</i> Ss-08 Extracellular Vesicles Suppress OSCC Progression via Inhibition of JAG1-NOTCH1 Signaling\" (CC BY, first published 2026-08-25) reports: \"Collectively, these findings demonstrate that SsEVs suppress OSCC progression both in vitro and in vivo by inhibiting the JAG1-NOTCH1-HEYL signaling axis, suggesting that microbiota-derived extracellular vesicles may represent a promising therapeutic approach for OSCC.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42713496","kind":"claim","label":"Research advances in hypertriglyceridemia-induced acute pancreatitis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42713496"]},"sources":[{"id":"source.frontier.pmid-42713496","title":"Europe PMC record PMID 42713496: Research advances in hypertriglyceridemia-induced acute pancreatitis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42713496%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1829495","title":"doi:10.3389/fmed.2026.1829495","url":"https://doi.org/10.3389/fmed.2026.1829495"}],"status":"frontier","summary":"PMID 42713496 \"Research advances in hypertriglyceridemia-induced acute pancreatitis\" (CC BY, first published 2026-08-25) reports: \"Hypertriglyceridemia-induced acute pancreatitis (HTG-AP), a significant subtype of acute pancreatitis (AP), is witnessing a rising global incidence and is associated with a poorer clinical prognosis compared to AP of other etiologies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42712360","kind":"claim","label":"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42712360"]},"sources":[{"id":"source.frontier.pmid-42712360","title":"Europe PMC record PMID 42712360: Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associa","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42712360%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fendo.2026.1884571","title":"doi:10.3389/fendo.2026.1884571","url":"https://doi.org/10.3389/fendo.2026.1884571"}],"status":"frontier","summary":"PMID 42712360 \"Comparative effectiveness of dienogest versus ethinyl estradiol/levonorgestrel combined oral contraceptive therapy in women with endometriosis-associated chronic pelvic pain\" (CC BY, first published 2026-08-25) reports: \"Both treatments were associated with significant improvement in endometriosis-associated pain, and the OCP group showed greater short-term pain reduction in this cohort, suggesting that the evaluated levonorgestrel/ethinyl estradiol regimen may represent a conservative treatment option, particularly in resource-limited healthcare settings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42637891","kind":"claim","label":"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.pmid-42637891"]},"sources":[{"id":"source.frontier.pmid-42637891","title":"Europe PMC record PMID 42637891: Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637891%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11912-026-01823-1","title":"doi:10.1007/s11912-026-01823-1","url":"https://doi.org/10.1007/s11912-026-01823-1"}],"status":"frontier","summary":"PMID 42637891 \"Head and Neck Rhabdomyosarcoma in Children: An Otolaryngological Perspective on Diagnostic and Therapeutic Approaches\" (CC BY, first published 2026-08-25) reports: \"Orbital tumors are associated with favorable outcomes, whereas parameningeal lesions continue to pose substantial therapeutic difficulties because of delayed diagnosis and proximity to critical anatomical structures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42816488","kind":"claim","label":"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42816488"]},"sources":[{"id":"source.frontier.pmid-42816488","title":"Europe PMC record PMID 42816488: A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42816488%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76091-5","title":"doi:10.1038/s41467-026-76091-5","url":"https://doi.org/10.1038/s41467-026-76091-5"}],"status":"frontier","summary":"PMID 42816488 \"A transmembrane protein confers the Yr26/Yr24/YrCH42/YrG22-mediated stripe rust resistance in wheat\" (CC BY, first published 2026-08-24) reports: \"Here, we report the map-based cloning of Yr26 (synonyms: Yr24, YrCH42, and YrG22), a major stripe rust resistance gene, and its validation by gene silencing, mutation analysis and transgenic complementation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781598","kind":"claim","label":"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42781598"]},"sources":[{"id":"source.frontier.pmid-42781598","title":"Europe PMC record PMID 42781598: Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781598%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115093","title":"doi:10.7759/cureus.115093","url":"https://doi.org/10.7759/cureus.115093"}],"status":"frontier","summary":"PMID 42781598 \"Wernicke Encephalopathy Secondary to Cannabinoid Hyperemesis Syndrome in a 15-Year-Old Male Patient: A Case Report\" (CC BY, first published 2026-08-24) reports: \"We report the case of a 15-year-old male patient with no significant past medical history and chronic cannabis use who developed WE in the setting of CHS.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42781208","kind":"claim","label":"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42781208"]},"sources":[{"id":"source.frontier.pmid-42781208","title":"Europe PMC record PMID 42781208: A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42781208%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.115107","title":"doi:10.7759/cureus.115107","url":"https://doi.org/10.7759/cureus.115107"}],"status":"frontier","summary":"PMID 42781208 \"A Scoping Review of Risk Factors for Thunderstorm Asthma in Pediatric Patients\" (CC BY, first published 2026-08-24) reports: \"We found that ETSA events may trigger a first-time asthma presentation in a large proportion of pediatric patients, especially those with atopic conditions such as allergic rhinitis or eczema.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737882","kind":"claim","label":"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42737882"]},"sources":[{"id":"source.frontier.pmid-42737882","title":"Europe PMC record PMID 42737882: Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737882%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biology15171450","title":"doi:10.3390/biology15171450","url":"https://doi.org/10.3390/biology15171450"}],"status":"frontier","summary":"PMID 42737882 \"Research Progress on the Major Histocompatibility Complex in Herbivores: Structure, Genetics, and Disease Resistance\" (CC BY, first published 2026-08-24) reports: \"We identify current technical limitations and outline future research directions to establish a robust theoretical foundation for disease resistance breeding and immune regulation strategies in herbivore populations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42707529","kind":"claim","label":"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42707529"]},"sources":[{"id":"source.frontier.pmid-42707529","title":"Europe PMC record PMID 42707529: Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707529%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.17505/jpor.2026.29459","title":"doi:10.17505/jpor.2026.29459","url":"https://doi.org/10.17505/jpor.2026.29459"}],"status":"frontier","summary":"PMID 42707529 \"Cumulative Physiological Affect: Thematic Analysis of Forensic Psychological Examination Data from a Homicide Case\" (CC BY, first published 2026-08-24) reports: \"The findings revealed four themes: (1) a hierarchical environment characterized by humiliation and coercion; (2) gradually intensifying motivational pressure closely linked to dependency, presumed blackmail, and fear of punishment; (3) cumulative emotional exhaustion resulting from prolonged internal stress; and (4) cognitive narrowing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42707216","kind":"claim","label":"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42707216"]},"sources":[{"id":"source.frontier.pmid-42707216","title":"Europe PMC record PMID 42707216: Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42707216%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1935668","title":"doi:10.3389/fonc.2026.1935668","url":"https://doi.org/10.3389/fonc.2026.1935668"}],"status":"frontier","summary":"PMID 42707216 \"Case Report: The role of nodal staging in periocular merkel cell carcinoma - lessons from three cases\" (CC BY, first published 2026-08-24) reports: \"We report three patients with upper eyelid MCC managed at a single ophthalmology centre.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42637977","kind":"claim","label":"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42637977"]},"sources":[{"id":"source.frontier.pmid-42637977","title":"Europe PMC record PMID 42637977: Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42637977%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41592-026-03194-8","title":"doi:10.1038/s41592-026-03194-8","url":"https://doi.org/10.1038/s41592-026-03194-8"}],"status":"frontier","summary":"PMID 42637977 \"Beyond benchmarking: an expert-guided consensus approach to spatially aware clustering\" (CC BY, first published 2026-08-24) reports: \"Our analysis revealed substantial limitations in the generalizability and reproducibility of SAC methods and shows that anatomical labels commonly used as ground truths are often biased, error prone and unsuitable for benchmarking.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42636257","kind":"claim","label":"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42636257"]},"sources":[{"id":"source.frontier.pmid-42636257","title":"Europe PMC record PMID 42636257: Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42636257%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012282","title":"doi:10.1371/journal.pgen.1012282","url":"https://doi.org/10.1371/journal.pgen.1012282"}],"status":"frontier","summary":"PMID 42636257 \"Replication-transcription collisions impose DNA strand-specific constraints on gene length in bacteria\" (CC BY, first published 2026-08-24) reports: \"Remarkably, we found that with increasing length of transcription units, substitution rates increased in the promoters on the lagging strand rather than the coding sequences, revealing a length-dependent and lagging strand-specific cis-regulatory mutational susceptibility.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42635434","kind":"claim","label":"Species-specific prophage induction by ciprofloxacin in human gut metagenomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42635434"]},"sources":[{"id":"source.frontier.pmid-42635434","title":"Europe PMC record PMID 42635434: Species-specific prophage induction by ciprofloxacin in human gut metagenomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42635434%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00303-26","title":"doi:10.1128/msystems.00303-26","url":"https://doi.org/10.1128/msystems.00303-26"}],"status":"frontier","summary":"PMID 42635434 \"Species-specific prophage induction by ciprofloxacin in human gut metagenomes\" (CC BY, first published 2026-08-24) reports: \"Using a metagenomic approach, we aimed to measure prophage induction, and whether it is associated with antibiotic exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42634019","kind":"claim","label":"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.pmid-42634019"]},"sources":[{"id":"source.frontier.pmid-42634019","title":"Europe PMC record PMID 42634019: Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelli","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42634019%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41598-026-54426-y","title":"doi:10.1038/s41598-026-54426-y","url":"https://doi.org/10.1038/s41598-026-54426-y"}],"status":"frontier","summary":"PMID 42634019 \"Enhanced classification and identification of bacterial and viral microorganisms by integration of MALDI-TOF mass spectrometry with artificial intelligence\" (CC BY, first published 2026-08-24) reports: \"The results showed that up to seven models achieved consistently robust classification across various tasks, including binary classification of viruses from bacteria and Gram-positive from Gram-negative bacteria, as well as multi-class classification of individual bacterial and viral species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42794146","kind":"claim","label":"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-23","source_ids":["source.frontier.pmid-42794146"]},"sources":[{"id":"source.frontier.pmid-42794146","title":"Europe PMC record PMID 42794146: Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42794146%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/children13091126","title":"doi:10.3390/children13091126","url":"https://doi.org/10.3390/children13091126"}],"status":"frontier","summary":"PMID 42794146 \"Atypical Case of Presumed <i>Bartonella henselae</i> Osteomyelitis in a Child with Cat-Scratch Disease Mimicking a Malignant Bone Tumor\" (CC BY, first published 2026-08-23) reports: \": We report the case of a previously healthy 10-year-old girl who presented with a one-month history of fever, fatigue, limping, and progressive thigh and groin pain following cat-scratch exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42737450","kind":"claim","label":"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-23","source_ids":["source.frontier.pmid-42737450"]},"sources":[{"id":"source.frontier.pmid-42737450","title":"Europe PMC record PMID 42737450: Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progres","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42737450%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27177546","title":"doi:10.3390/ijms27177546","url":"https://doi.org/10.3390/ijms27177546"}],"status":"frontier","summary":"PMID 42737450 \"Association of <i>PDGFRB</i>, <i>VEGFR2</i>, and <i>TGFB1</i> Gene Polymorphisms with Nintedanib Efficacy and Adverse Effects in Patients with Progressive Pulmonary Fibrosis\" (CC BY, first published 2026-08-23) reports: \"gene variants are associated with nintedanib treatment outcomes, including changes in pulmonary function, diffusing capacity and adverse effects.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42778576","kind":"claim","label":"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-22","source_ids":["source.frontier.pmid-42778576"]},"sources":[{"id":"source.frontier.pmid-42778576","title":"Europe PMC record PMID 42778576: Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42778576%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76147-6","title":"doi:10.1038/s41467-026-76147-6","url":"https://doi.org/10.1038/s41467-026-76147-6"}],"status":"frontier","summary":"PMID 42778576 \"Longitudinal digital phenotyping of activity rhythms and biological aging using commercial wearables\" (CC BY, first published 2026-08-22) reports: \"Through high-dimensional digital phenotyping, we show that circadian rest-activity rhythm intensity, timing, and stability are associated with biological aging trajectories.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728936","kind":"claim","label":"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-22","source_ids":["source.frontier.pmid-42728936"]},"sources":[{"id":"source.frontier.pmid-42728936","title":"Europe PMC record PMID 42728936: Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728936%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/openreseurope.22066.4","title":"doi:10.12688/openreseurope.22066.4","url":"https://doi.org/10.12688/openreseurope.22066.4"}],"status":"frontier","summary":"PMID 42728936 \"Soil health and microbial diversity across land-use types: Evidence for agroecological management in peri-urban areas\" (CC BY, first published 2026-08-22) reports: \"Our results reveal that fungal and bacterial communities responded differently to land-use management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764930","kind":"claim","label":"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42764930"]},"sources":[{"id":"source.frontier.pmid-42764930","title":"Europe PMC record PMID 42764930: Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764930%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114919","title":"doi:10.7759/cureus.114919","url":"https://doi.org/10.7759/cureus.114919"}],"status":"frontier","summary":"PMID 42764930 \"Occult Late-Onset Systemic Lupus Erythematosus Presenting as Critical Multisystem Disease in a Male: A Diagnostic Challenge in the Intensive Care Unit\" (CC BY, first published 2026-08-21) reports: \"We report a 60-year-old male admitted to the intensive care unit (ICU) with melena and haemodynamic instability on a background of a recent non-ST-elevation myocardial infarction (NSTEMI).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42698454","kind":"claim","label":"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42698454"]},"sources":[{"id":"source.frontier.pmid-42698454","title":"Europe PMC record PMID 42698454: Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42698454%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1893857","title":"doi:10.3389/fpsyg.2026.1893857","url":"https://doi.org/10.3389/fpsyg.2026.1893857"}],"status":"frontier","summary":"PMID 42698454 \"Poor sleep quality and loneliness among higher vocational college students: a conditional process analysis of psychological resilience and self-esteem\" (CC BY, first published 2026-08-21) reports: \"However, less is known about how sleep quality is associated with loneliness among higher vocational college students and whether this association depends on internal psychological resources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42653506","kind":"claim","label":"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42653506"]},"sources":[{"id":"source.frontier.pmid-42653506","title":"Europe PMC record PMID 42653506: Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42653506%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27167508","title":"doi:10.3390/ijms27167508","url":"https://doi.org/10.3390/ijms27167508"}],"status":"frontier","summary":"PMID 42653506 \"Multispecies Transcriptomics of Mammalian Skin Reveals Conserved and Divergent Regulatory Features\" (CC BY, first published 2026-08-21) reports: \"(mouse), which are associated with the cell cycle, extracellular matrix, and muscle contraction pathways, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627947","kind":"claim","label":"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42627947"]},"sources":[{"id":"source.frontier.pmid-42627947","title":"Europe PMC record PMID 42627947: Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627947%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/97469","title":"doi:10.2196/97469","url":"https://doi.org/10.2196/97469"}],"status":"frontier","summary":"PMID 42627947 \"Auricular Acupressure for Perioperative Anxiety and Pain in Therapeutic Breast Surgery: Protocol for a Randomized Clinical Trial\" (CC BY, first published 2026-08-21) reports: \"Preoperative anxiety is common among women undergoing breast cancer surgery and is associated with impaired subjective well-being as well as adverse perioperative outcomes, including increased postoperative pain, nausea and vomiting, and higher analgesic requirements.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627158","kind":"claim","label":"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.pmid-42627158"]},"sources":[{"id":"source.frontier.pmid-42627158","title":"Europe PMC record PMID 42627158: Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627158%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00829-26","title":"doi:10.1128/msystems.00829-26","url":"https://doi.org/10.1128/msystems.00829-26"}],"status":"frontier","summary":"PMID 42627158 \"Ancestral hydrocarbon metabolism enables PET degradation by a natural bacterial consortium\" (CC BY, first published 2026-08-21) reports: \"In this report, using integrated comparative genomics, proteomics, and chemical analyses, we show that PET degradation in this system reflects exaptation of hydrocarbon metabolism, reinforced by metabolic division of labor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42764822","kind":"claim","label":"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42764822"]},"sources":[{"id":"source.frontier.pmid-42764822","title":"Europe PMC record PMID 42764822: Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42764822%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114892","title":"doi:10.7759/cureus.114892","url":"https://doi.org/10.7759/cureus.114892"}],"status":"frontier","summary":"PMID 42764822 \"Scarring Patterns in Cutaneous Sporotrichosis: Clinical and Therapeutic Correlations\" (CC BY, first published 2026-08-20) reports: \"Cutaneous sporotrichosis is associated with a substantial scar burden, frequently with distinctive linear and 'wax drop' patterns; the linear arrangement on the upper limbs may be mistaken for self-inflicted injury and is the most directly actionable observation of this series.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763617","kind":"claim","label":"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42763617"]},"sources":[{"id":"source.frontier.pmid-42763617","title":"Europe PMC record PMID 42763617: Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763617%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114847","title":"doi:10.7759/cureus.114847","url":"https://doi.org/10.7759/cureus.114847"}],"status":"frontier","summary":"PMID 42763617 \"Beyond the Usual Pathogens: Community-Acquired Meningoencephalitis Caused by Streptococcus equi in an Immunocompetent Adult\" (CC BY, first published 2026-08-20) reports: \"We report the case of a previously healthy 50-year-old man who presented with fever and altered mental status in the setting of recent animal exposure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42694918","kind":"claim","label":"\"What about that violence?\" Transforming the discourse on violence in mental health research and services","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42694918"]},"sources":[{"id":"source.frontier.pmid-42694918","title":"Europe PMC record PMID 42694918: \"What about that violence?\" Transforming the discourse on violence in mental health research and services","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694918%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1905808","title":"doi:10.3389/fpsyt.2026.1905808","url":"https://doi.org/10.3389/fpsyt.2026.1905808"}],"status":"frontier","summary":"PMID 42694918 \"\"What about that violence?\" Transforming the discourse on violence in mental health research and services\" (CC BY, first published 2026-08-20) reports: \"We identify conditions for epistemic justice in research (including reciprocity, acknowledgment of trauma, and recognition) as concrete mechanisms for disrupting these dynamics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42694103","kind":"claim","label":"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42694103"]},"sources":[{"id":"source.frontier.pmid-42694103","title":"Europe PMC record PMID 42694103: AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42694103%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyg.2026.1860755","title":"doi:10.3389/fpsyg.2026.1860755","url":"https://doi.org/10.3389/fpsyg.2026.1860755"}],"status":"frontier","summary":"PMID 42694103 \"AI avatars in education: effects on knowledge acquisition, academic motivation, and cognitive load\" (CC BY, first published 2026-08-20) reports: \"These findings suggest that AI-avatar-supported instruction may enhance knowledge acquisition and support motivational regulation, while evidence for cognitive-load reduction was not observed in the present data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42689273","kind":"claim","label":"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42689273"]},"sources":[{"id":"source.frontier.pmid-42689273","title":"Europe PMC record PMID 42689273: Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689273%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1896842","title":"doi:10.3389/fphar.2026.1896842","url":"https://doi.org/10.3389/fphar.2026.1896842"}],"status":"frontier","summary":"PMID 42689273 \"Tissue-specific untargeted <sup>1</sup>H-NMR metabolomics reveals no adverse metabolic effects of daily intrabuccal cannabidiol (CBD) in healthy mice\" (CC BY, first published 2026-08-20) reports: \"The most notable, albeit minor, changes were observed in the brain and were associated with decreased signaling and neuroenergetics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42627223","kind":"claim","label":"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42627223"]},"sources":[{"id":"source.frontier.pmid-42627223","title":"Europe PMC record PMID 42627223: Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42627223%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/96664","title":"doi:10.2196/96664","url":"https://doi.org/10.2196/96664"}],"status":"frontier","summary":"PMID 42627223 \"Multilayered Epistemic Disruption in AI-Driven Health Misinformation: Conceptual Framework and Viewpoint\" (CC BY, first published 2026-08-20) reports: \"Existing defenses-including Content Provenance and Authenticity standards, automated deepfake detection (showing area under the curve drops of up to 50% under real-world conditions), and prebunking interventions-are shown to address only subsets of the proposed cascade, leaving temporal and systemic layers substantially unmitigated.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42626349","kind":"claim","label":"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42626349"]},"sources":[{"id":"source.frontier.pmid-42626349","title":"Europe PMC record PMID 42626349: Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multi","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42626349%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114869","title":"doi:10.7759/cureus.114869","url":"https://doi.org/10.7759/cureus.114869"}],"status":"frontier","summary":"PMID 42626349 \"Encephalitis, High-Grade Atrioventricular Block, Acute Kidney Injury, and Hepatitis Following Atezolizumab Therapy: A Complex Case of Sequential Multiorgan Immune Checkpoint Inhibitor-Related Adverse Events\" (CC BY, first published 2026-08-20) reports: \"We report the case of a 49-year-old man with lung cancer who presented with confusion and seizures 16 days after receiving atezolizumab.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42344430","kind":"claim","label":"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.pmid-42344430"]},"sources":[{"id":"source.frontier.pmid-42344430","title":"Europe PMC record PMID 42344430: Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42344430%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.178353.2","title":"doi:10.12688/f1000research.178353.2","url":"https://doi.org/10.12688/f1000research.178353.2"}],"status":"frontier","summary":"PMID 42344430 \"Cataloguing and Theorising Open Research Practices in the Arts, Humanities and Social Sciences: Problematising and Diversifying 'Open Science'\" (CC BY, first published 2026-08-20) reports: \"We identify among these practices a range of forms of openness including those focused on mobilising the involvement and expert knowledge of diverse participants and communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42761991","kind":"claim","label":"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42761991"]},"sources":[{"id":"source.frontier.pmid-42761991","title":"Europe PMC record PMID 42761991: Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42761991%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114805","title":"doi:10.7759/cureus.114805","url":"https://doi.org/10.7759/cureus.114805"}],"status":"frontier","summary":"PMID 42761991 \"Co-infection With Leptospirosis During Acute Hepatitis B Serologic Recovery: A Case Report\" (CC BY, first published 2026-08-19) reports: \"We report a 30-year-old woman presenting with myalgia, progressive jaundice, and markedly elevated aminotransferases, initially diagnosed with acute hepatitis B. She reported regular contact with her dog.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42749735","kind":"claim","label":"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42749735"]},"sources":[{"id":"source.frontier.pmid-42749735","title":"Europe PMC record PMID 42749735: APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42749735%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-76565-6","title":"doi:10.1038/s41467-026-76565-6","url":"https://doi.org/10.1038/s41467-026-76565-6"}],"status":"frontier","summary":"PMID 42749735 \"APOE genotypes differentially remodel the astrocytic lipid droplet proteome to shape lipid droplet dynamics\" (CC BY, first published 2026-08-19) reports: \"Here we show that APOE genotype shapes the lipid droplet proteome, lipidome, and degradation dynamics in human induced pluripotent stem cell-derived astrocytes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728923","kind":"claim","label":"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42728923"]},"sources":[{"id":"source.frontier.pmid-42728923","title":"Europe PMC record PMID 42728923: Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728923%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.181997.2","title":"doi:10.12688/f1000research.181997.2","url":"https://doi.org/10.12688/f1000research.181997.2"}],"status":"frontier","summary":"PMID 42728923 \"Teachers' Perceptions of the PIL-SMART Model: A Semlj Analysis of its Influence on Science and Environmental Literacy in Early Childhood Education\" (CC BY, first published 2026-08-19) reports: \"Favourable perceptions of PIL-SMART were associated with higher teacher ratings of children's science and environmental literacy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42689122","kind":"claim","label":"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42689122"]},"sources":[{"id":"source.frontier.pmid-42689122","title":"Europe PMC record PMID 42689122: The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and surviv","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42689122%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fonc.2026.1828760","title":"doi:10.3389/fonc.2026.1828760","url":"https://doi.org/10.3389/fonc.2026.1828760"}],"status":"frontier","summary":"PMID 42689122 \"The multifaceted impact of the COVID-19 pandemic on colorectal cancer care: a systematic review of management disruptions, stage migration, and survival outcomes\" (CC BY, first published 2026-08-19) reports: \"Consequently, patients diagnosed during the pandemic faced a significantly higher mortality risk, a trend exacerbated by COVID-19 co-infection, which was associated with dramatically worse survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42654288","kind":"claim","label":"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42654288"]},"sources":[{"id":"source.frontier.pmid-42654288","title":"Europe PMC record PMID 42654288: Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42654288%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/nu18162708","title":"doi:10.3390/nu18162708","url":"https://doi.org/10.3390/nu18162708"}],"status":"frontier","summary":"PMID 42654288 \"Life Satisfaction and Psychological Distress in Relation to Mediterranean Lifestyle Adherence and Behavioural Correlates: Findings from the MEDIET4ALL International Survey\" (CC BY, first published 2026-08-19) reports: \"Life satisfaction and psychological distress are associated with multiple lifestyle, sleep-related, psychosocial, and sociodemographic factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42651394","kind":"claim","label":"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42651394"]},"sources":[{"id":"source.frontier.pmid-42651394","title":"Europe PMC record PMID 42651394: Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651394%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/healthcare14162625","title":"doi:10.3390/healthcare14162625","url":"https://doi.org/10.3390/healthcare14162625"}],"status":"frontier","summary":"PMID 42651394 \"Physical Activity Before, During, and After the School Day and Its Impact on Positive Psychological Variables: A Systematic Review and Practical Guide\" (CC BY, first published 2026-08-19) reports: \"During-school interventions, particularly structured programs such as active breaks and cooperative games, were associated with better resilience, emotional self-regulation, and prosocial behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42646326","kind":"claim","label":"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42646326"]},"sources":[{"id":"source.frontier.pmid-42646326","title":"Europe PMC record PMID 42646326: HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42646326%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/metabo16080590","title":"doi:10.3390/metabo16080590","url":"https://doi.org/10.3390/metabo16080590"}],"status":"frontier","summary":"PMID 42646326 \"HDCA Supplementation During Maternal High-Fat Diet Exposure Is Associated with Offspring Gut Microbiota at Weaning and Adult Metabolic Phenotypes in a Mouse Model\" (CC BY, first published 2026-08-19) reports: \"This study investigated whether HDCA supplementation during maternal high-fat diet (HFD) exposure was associated with gut microbiota composition in dams and offspring and with selected obesity-related phenotypes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42616741","kind":"claim","label":"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42616741"]},"sources":[{"id":"source.frontier.pmid-42616741","title":"Europe PMC record PMID 42616741: Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616741%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006893","title":"doi:10.1371/journal.pgph.0006893","url":"https://doi.org/10.1371/journal.pgph.0006893"}],"status":"frontier","summary":"PMID 42616741 \"Having conversations about alcohol in frontline healthcare services: Experiences and perceptions of consumers and healthcare staff\" (CC BY, first published 2026-08-19) reports: \"These findings highlight the importance of equity-focused, culturally safe SBIRT approaches that address power and bias, and centre relationships in clinical encounters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42616230","kind":"claim","label":"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.pmid-42616230"]},"sources":[{"id":"source.frontier.pmid-42616230","title":"Europe PMC record PMID 42616230: Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42616230%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1007/s11046-026-01097-y","title":"doi:10.1007/s11046-026-01097-y","url":"https://doi.org/10.1007/s11046-026-01097-y"}],"status":"frontier","summary":"PMID 42616230 \"Clinical Characteristics, Diagnosis, and Treatment of Central Nervous System Candidiasis: A Systematic Review of 418 Cases\" (CC BY, first published 2026-08-19) reports: \"Overall mortality was 35%, mostly within 30 days; older age was associated with higher mortality, whereas combination antifungal therapy and more recent diagnostic periods were associated with lower mortality in multivariate analysis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42682491","kind":"claim","label":"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42682491"]},"sources":[{"id":"source.frontier.pmid-42682491","title":"Europe PMC record PMID 42682491: Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42682491%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1886100","title":"doi:10.3389/fneur.2026.1886100","url":"https://doi.org/10.3389/fneur.2026.1886100"}],"status":"frontier","summary":"PMID 42682491 \"Vasculitic neuropathy: clinical features, diagnostic approach, and neurological outcomes in a single-center cohort\" (CC BY, first published 2026-08-18) reports: \"Greater baseline motor impairment and shorter diagnostic delay were associated with improvement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42650730","kind":"claim","label":"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42650730"]},"sources":[{"id":"source.frontier.pmid-42650730","title":"Europe PMC record PMID 42650730: Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42650730%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antibiotics15080806","title":"doi:10.3390/antibiotics15080806","url":"https://doi.org/10.3390/antibiotics15080806"}],"status":"frontier","summary":"PMID 42650730 \"Influence of COVID-19 on Clinical Outcomes of <i>Clostridioides difficile</i> Infection\" (CC BY, first published 2026-08-18) reports: \"The COVID-19 pandemic was associated with increased hospitalizations, frequent antibiotic use, and changes in infection prevention and control regulations, which may have influenced the epidemiological and clinical characteristics of CDI.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42612575","kind":"claim","label":"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42612575"]},"sources":[{"id":"source.frontier.pmid-42612575","title":"Europe PMC record PMID 42612575: Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42612575%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.jacbts.2026.101655","title":"doi:10.1016/j.jacbts.2026.101655","url":"https://doi.org/10.1016/j.jacbts.2026.101655"}],"status":"frontier","summary":"PMID 42612575 \"Individualized Interactomes From Pulmonary Arterial Hypertension Cell Biopsies Inform Pharmacotherapeutic Response\" (CC BY, first published 2026-08-18) reports: \"Concordance between the molecular targets of a prescribed PAH pharmacotherapy class and interactome topology was associated with improved clinical outcomes using a retrospective in silico trial design.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42611865","kind":"claim","label":"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.pmid-42611865"]},"sources":[{"id":"source.frontier.pmid-42611865","title":"Europe PMC record PMID 42611865: Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42611865%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0356286","title":"doi:10.1371/journal.pone.0356286","url":"https://doi.org/10.1371/journal.pone.0356286"}],"status":"frontier","summary":"PMID 42611865 \"Transcriptome profile of delayed mortality in patients with invasive group A Streptococcal disease\" (CC BY, first published 2026-08-18) reports: \"The gene expression profiles associated with a severe disease course differed markedly between timepoints A and B. High expression of necroptosis factors and low expression of HLA genes at timepoint B was associated with death.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42751534","kind":"claim","label":"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42751534"]},"sources":[{"id":"source.frontier.pmid-42751534","title":"Europe PMC record PMID 42751534: Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42751534%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114648","title":"doi:10.7759/cureus.114648","url":"https://doi.org/10.7759/cureus.114648"}],"status":"frontier","summary":"PMID 42751534 \"Atypical Kaposi Sarcoma in HIV Infection with Predominant Nodal Involvement\" (CC BY, first published 2026-08-17) reports: \"We report the case of a 26-year-old man with recently diagnosed HIV infection and no prior antiretroviral therapy (ART) who presented with a two-week history of persistent fever, constitutional symptoms, abdominal pain, and progressive intolerance to oral intake.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42676491","kind":"claim","label":"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42676491"]},"sources":[{"id":"source.frontier.pmid-42676491","title":"Europe PMC record PMID 42676491: Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42676491%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1845591","title":"doi:10.3389/fimmu.2026.1845591","url":"https://doi.org/10.3389/fimmu.2026.1845591"}],"status":"frontier","summary":"PMID 42676491 \"Characteristics and research waste of immunotherapy randomized clinical trials: a cross-sectional analysis\" (CC BY, first published 2026-08-17) reports: \"This study revealed a high incidence of research waste in immunotherapy RCTs, which was predominantly driven by non-tumor studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652751","kind":"claim","label":"Psychological Factors to Consider in Treating Patients with Acne Vulgaris","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42652751"]},"sources":[{"id":"source.frontier.pmid-42652751","title":"Europe PMC record PMID 42652751: Psychological Factors to Consider in Treating Patients with Acne Vulgaris","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652751%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15166347","title":"doi:10.3390/jcm15166347","url":"https://doi.org/10.3390/jcm15166347"}],"status":"frontier","summary":"PMID 42652751 \"Psychological Factors to Consider in Treating Patients with Acne Vulgaris\" (CC BY, first published 2026-08-17) reports: \"Psychological factors such as stress, coping strategies, quality-of-life impairment, self-esteem, psychiatric symptoms, and treatment adherence are associated with disease perception, self-reported exacerbation, and treatment-related outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42609599","kind":"claim","label":"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.pmid-42609599"]},"sources":[{"id":"source.frontier.pmid-42609599","title":"Europe PMC record PMID 42609599: Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42609599%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/carm/8244011","title":"doi:10.1155/carm/8244011","url":"https://doi.org/10.1155/carm/8244011"}],"status":"frontier","summary":"PMID 42609599 \"Vitamin K Antagonist-Induced Calciphylaxis in a Dialysis Patient With Antiphospholipid Syndrome: A Multidisciplinary Case Report\" (CC BY, first published 2026-08-17) reports: \"We report the complex clinical course of a 35-year-old female patient with chronic kidney failure and triple-positive antiphospholipid syndrome (APS) who presented with severe, painful bilateral thigh ulcerations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746465","kind":"claim","label":"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-16","source_ids":["source.frontier.pmid-42746465"]},"sources":[{"id":"source.frontier.pmid-42746465","title":"Europe PMC record PMID 42746465: Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort S","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746465%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114615","title":"doi:10.7759/cureus.114615","url":"https://doi.org/10.7759/cureus.114615"}],"status":"frontier","summary":"PMID 42746465 \"Assessing Demographic Characteristics, Microbiology, and Mortality Outcomes Associated With Vertebral Osteomyelitis: A National Single-Center Cohort Study in Malta\" (CC BY, first published 2026-08-16) reports: \"The condition was associated with prolonged hospital stay and substantial infectious complications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42746333","kind":"claim","label":"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-16","source_ids":["source.frontier.pmid-42746333"]},"sources":[{"id":"source.frontier.pmid-42746333","title":"Europe PMC record PMID 42746333: Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42746333%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114602","title":"doi:10.7759/cureus.114602","url":"https://doi.org/10.7759/cureus.114602"}],"status":"frontier","summary":"PMID 42746333 \"Unexpected Diagnosis of Uterine Adenosarcoma With Sarcomatous Overgrowth After Hysteroscopic Polypectomy for a Presumed Endometrial Polyp\" (CC BY, first published 2026-08-16) reports: \"We report a case of uterine adenosarcoma with sarcomatous overgrowth diagnosed through the histopathological evaluation of a hysteroscopic polypectomy specimen.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42741475","kind":"claim","label":"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-15","source_ids":["source.frontier.pmid-42741475"]},"sources":[{"id":"source.frontier.pmid-42741475","title":"Europe PMC record PMID 42741475: Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42741475%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114568","title":"doi:10.7759/cureus.114568","url":"https://doi.org/10.7759/cureus.114568"}],"status":"frontier","summary":"PMID 42741475 \"Rheumatoid Pleuropulmonary Disease Mimicking Refractory Empyema: A Diagnostic Challenge With Trapped Lung\" (CC BY, first published 2026-08-15) reports: \"We report a 66-year-old woman with a 22-year history of seropositive, erosive, nodular RA who presented with recurrent right-sided pleural effusions and progressive dyspnea over three years.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728996","kind":"claim","label":"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42728996"]},"sources":[{"id":"source.frontier.pmid-42728996","title":"Europe PMC record PMID 42728996: Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728996%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.179376.3","title":"doi:10.12688/f1000research.179376.3","url":"https://doi.org/10.12688/f1000research.179376.3"}],"status":"frontier","summary":"PMID 42728996 \"Crafting Regional Identity and Peace through the ASEAN Way in Diplomacy\" (CC BY, first published 2026-08-14) reports: \"The findings indicate that the ASEAN Way has significantly contributed to regional peace by fostering mutual trust, dialogue, and conflict avoidance among member states.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42666182","kind":"claim","label":"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42666182"]},"sources":[{"id":"source.frontier.pmid-42666182","title":"Europe PMC record PMID 42666182: Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42666182%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1878305","title":"doi:10.3389/fmed.2026.1878305","url":"https://doi.org/10.3389/fmed.2026.1878305"}],"status":"frontier","summary":"PMID 42666182 \"Atypical mitral valve infective endocarditis presenting with fever and left upper abdominal pain due to splenic infarction: a case report\" (CC BY, first published 2026-08-14) reports: \"We report a case of atypical mitral valve IE in a 40-year-old man who presented with persistent fever and left upper abdominal pain rather than overt cardiac symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599952","kind":"claim","label":"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599952"]},"sources":[{"id":"source.frontier.pmid-42599952","title":"Europe PMC record PMID 42599952: Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599952%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pntd.0014624","title":"doi:10.1371/journal.pntd.0014624","url":"https://doi.org/10.1371/journal.pntd.0014624"}],"status":"frontier","summary":"PMID 42599952 \"Burden of Shigella infection in children under five years living in a peri-urban area of Ouagadougou, Burkina Faso: A community-based cohort study\" (CC BY, first published 2026-08-14) reports: \"The findings highlight the need to strengthen water, sanitation, and hygiene programs, improve diagnostic capacity, and enhance antimicrobial resistance surveillance to reduce Shigella transmission and impact in this population.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599899","kind":"claim","label":"Determinants of instructional leadership: A survey of public secondary schools","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599899"]},"sources":[{"id":"source.frontier.pmid-42599899","title":"Europe PMC record PMID 42599899: Determinants of instructional leadership: A survey of public secondary schools","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599899%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355674","title":"doi:10.1371/journal.pone.0355674","url":"https://doi.org/10.1371/journal.pone.0355674"}],"status":"frontier","summary":"PMID 42599899 \"Determinants of instructional leadership: A survey of public secondary schools\" (CC BY, first published 2026-08-14) reports: \"The findings reveal three major factors influencing instructional leadership: (a) planning, managing, and supervising instructional programs; (b) motivating and developing the competence of teachers and students; and (c) involving parents in the learning process.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42599850","kind":"claim","label":"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.pmid-42599850"]},"sources":[{"id":"source.frontier.pmid-42599850","title":"Europe PMC record PMID 42599850: The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42599850%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355296","title":"doi:10.1371/journal.pone.0355296","url":"https://doi.org/10.1371/journal.pone.0355296"}],"status":"frontier","summary":"PMID 42599850 \"The impact of digital health on loneliness and social isolation for older adults: A scoping review protocol\" (CC BY, first published 2026-08-14) reports: \"Both are associated with poorer physical and mental health, increased healthcare utilisation, and become more prevalent in later life.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42732322","kind":"claim","label":"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42732322"]},"sources":[{"id":"source.frontier.pmid-42732322","title":"Europe PMC record PMID 42732322: Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42732322%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114487","title":"doi:10.7759/cureus.114487","url":"https://doi.org/10.7759/cureus.114487"}],"status":"frontier","summary":"PMID 42732322 \"Multifocal Necrotizing Fasciitis of the Bilateral Chest Wall and Contralateral Lower Limb in a Patient With Diabetes: A Case Report\" (CC BY, first published 2026-08-13) reports: \"We report a 54-year-old man with type 2 diabetes mellitus who developed bilateral chest wall NF after sustaining a pectoralis major muscle injury while lifting a heavy engine part.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661822","kind":"claim","label":"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42661822"]},"sources":[{"id":"source.frontier.pmid-42661822","title":"Europe PMC record PMID 42661822: Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median ar","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661822%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmed.2026.1884767","title":"doi:10.3389/fmed.2026.1884767","url":"https://doi.org/10.3389/fmed.2026.1884767"}],"status":"frontier","summary":"PMID 42661822 \"Severe celiac trunk stenosis following blunt trauma in a patient with diabetic ketoacidosis: a diagnostic dilemma of traumatic injury versus median arcuate ligament syndrome\" (CC BY, first published 2026-08-13) reports: \"We report the case of a 33-year-old man with poorly controlled type 1 diabetes mellitus who sustained multiple blunt injuries after being crushed by an approximately 400-kg object, resulting in sternal, rib, and pelvic fractures with hemoperitoneum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42661658","kind":"claim","label":"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42661658"]},"sources":[{"id":"source.frontier.pmid-42661658","title":"Europe PMC record PMID 42661658: Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal m","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42661658%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1906024","title":"doi:10.3389/fimmu.2026.1906024","url":"https://doi.org/10.3389/fimmu.2026.1906024"}],"status":"frontier","summary":"PMID 42661658 \"Resveratrol alleviates functional dyspepsia-like pathology by modulating chemokine- and cytokine-related immune-epithelial signaling in the duodenal mucosa\" (CC BY, first published 2026-08-13) reports: \"Functional dyspepsia (FD) is associated with duodenal immune dysregulation, epithelial barrier impairment, and microbial imbalance, suggesting an active mucosal microenvironment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652200","kind":"claim","label":"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42652200"]},"sources":[{"id":"source.frontier.pmid-42652200","title":"Europe PMC record PMID 42652200: Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652200%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/biomedicines14081818","title":"doi:10.3390/biomedicines14081818","url":"https://doi.org/10.3390/biomedicines14081818"}],"status":"frontier","summary":"PMID 42652200 \"Imaging and Clinical Correlates of [<sup>177</sup>Lu]Lu-PSMA PET-Defined Eligibility in De Novo Metastatic Prostate Cancer\" (CC BY, first published 2026-08-13) reports: \"PET-defined candidacy was associated with higher PSMA-positive lesion count, greater PET-derived tumour burden, and higher mean standardised uptake value (SUVmean).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42595314","kind":"claim","label":"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42595314"]},"sources":[{"id":"source.frontier.pmid-42595314","title":"Europe PMC record PMID 42595314: Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42595314%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1055/s-0046-1827064","title":"doi:10.1055/s-0046-1827064","url":"https://doi.org/10.1055/s-0046-1827064"}],"status":"frontier","summary":"PMID 42595314 \"Functional neurological disorder: characterization, diagnosis, and outcome predictors in a Brazilian cohort\" (CC BY, first published 2026-08-13) reports: \"Group psychotherapy and eutony were associated with improvement, reinforcing the value of multidisciplinary approaches and highlighting the importance of Latin American clinical data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42594273","kind":"claim","label":"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.pmid-42594273"]},"sources":[{"id":"source.frontier.pmid-42594273","title":"Europe PMC record PMID 42594273: Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42594273%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.2196/104572","title":"doi:10.2196/104572","url":"https://doi.org/10.2196/104572"}],"status":"frontier","summary":"PMID 42594273 \"Protocol for a Sequential Multiple Assignment Randomized Trial to Improve Physical Activity and Diet Quality in Survivors of Cancer\" (CC BY, first published 2026-08-13) reports: \"Secondary analyses will test whether there are efficacy differences across intervention strategies, and which intervention sequences are associated with the greatest reduction in sedentary time and improvements in diet quality.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42763558","kind":"claim","label":"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42763558"]},"sources":[{"id":"source.frontier.pmid-42763558","title":"Europe PMC record PMID 42763558: Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42763558%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/ofid/ofag496","title":"doi:10.1093/ofid/ofag496","url":"https://doi.org/10.1093/ofid/ofag496"}],"status":"frontier","summary":"PMID 42763558 \"Clinical Characteristics and Outcomes of Invasive <i>Listeria Monocytogenes</i> Infection: A 45-Year Retrospective Study at a US Tertiary Center\" (CC BY, first published 2026-08-12) reports: \"Invasive listeriosis remains a leading cause of foodborne infection-related mortality in the United States and is associated with substantial case fatality despite appropriate antimicrobial therapy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42733890","kind":"claim","label":"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42733890"]},"sources":[{"id":"source.frontier.pmid-42733890","title":"Europe PMC record PMID 42733890: Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42733890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114445","title":"doi:10.7759/cureus.114445","url":"https://doi.org/10.7759/cureus.114445"}],"status":"frontier","summary":"PMID 42733890 \"Beyond Chronic Rhinosinusitis: Multisystem Granulomatosis With Polyangiitis Presenting With Cavitary Pulmonary Nodules and Sinonasal Destruction\" (CC BY, first published 2026-08-12) reports: \"We report a 69-year-old woman with years of refractory nasal congestion and recurrent epistaxis who developed progressive sinonasal obstruction, septal perforation, palpable purpura, peripheral sensory symptoms, renal urinary abnormalities, and bilateral cavitary pulmonary nodules.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656672","kind":"claim","label":"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656672"]},"sources":[{"id":"source.frontier.pmid-42656672","title":"Europe PMC record PMID 42656672: A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based populat","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656672%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fphar.2026.1901723","title":"doi:10.3389/fphar.2026.1901723","url":"https://doi.org/10.3389/fphar.2026.1901723"}],"status":"frontier","summary":"PMID 42656672 \"A comparative study of the impact of prescription and non-prescription mucolytic agents on respiratory disease management in a community-based population\" (CC BY, first published 2026-08-12) reports: \"Prescription-based therapy was associated with better symptom control, appropriate drug selection, and adherence to recommended dosing regimens.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656481","kind":"claim","label":"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656481"]},"sources":[{"id":"source.frontier.pmid-42656481","title":"Europe PMC record PMID 42656481: Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656481%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fpsyt.2026.1906103","title":"doi:10.3389/fpsyt.2026.1906103","url":"https://doi.org/10.3389/fpsyt.2026.1906103"}],"status":"frontier","summary":"PMID 42656481 \"Case Report: Diagnostic overshadowing in a patient with major depressive symptoms later diagnosed with systemic amyloidosis\" (CC BY, first published 2026-08-12) reports: \"We report the case of a 57-year-old male patient who was initially diagnosed with a major depressive episode.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42656460","kind":"claim","label":"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42656460"]},"sources":[{"id":"source.frontier.pmid-42656460","title":"Europe PMC record PMID 42656460: Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42656460%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1899147","title":"doi:10.3389/fcimb.2026.1899147","url":"https://doi.org/10.3389/fcimb.2026.1899147"}],"status":"frontier","summary":"PMID 42656460 \"Bacterial extracellular vesicles and direct microbial contact drive species-specific corneal epithelial reprogramming\" (CC BY, first published 2026-08-12) reports: \"Together, these findings demonstrate that BEVs and direct microbial contact act as complementary and species-specific drivers of corneal epithelial reprogramming.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42585261","kind":"claim","label":"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42585261"]},"sources":[{"id":"source.frontier.pmid-42585261","title":"Europe PMC record PMID 42585261: REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585261%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1013017","title":"doi:10.1371/journal.pcbi.1013017","url":"https://doi.org/10.1371/journal.pcbi.1013017"}],"status":"frontier","summary":"PMID 42585261 \"REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories\" (CC BY, first published 2026-08-12) reports: \"Through extensive benchmarking on synthetic datasets with known ground truth, REvolutionH-tl outperforms or matches the accuracy of established tools such as OrthoFinder, Proteinortho, RAxML, GeneRax, and RANGER-DTL, while achieving significantly lower runtimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42585188","kind":"claim","label":"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42585188"]},"sources":[{"id":"source.frontier.pmid-42585188","title":"Europe PMC record PMID 42585188: Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42585188%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355745","title":"doi:10.1371/journal.pone.0355745","url":"https://doi.org/10.1371/journal.pone.0355745"}],"status":"frontier","summary":"PMID 42585188 \"Effect of reused litter on early cecal microbiota succession and the immune cells distribution in layer chickens\" (CC BY, first published 2026-08-12) reports: \"These findings highlight that exposure to different litter environment was associated with distinct cecal microbial profiles and immune-cell distributions in layer chicks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42584423","kind":"claim","label":"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.pmid-42584423"]},"sources":[{"id":"source.frontier.pmid-42584423","title":"Europe PMC record PMID 42584423: Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42584423%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/advs.77094","title":"doi:10.1002/advs.77094","url":"https://doi.org/10.1002/advs.77094"}],"status":"frontier","summary":"PMID 42584423 \"Livestock Multi-Omics Integration: A Systematic Framework From Statistical Association to Causal Interpretation\" (CC BY, first published 2026-08-12) reports: \"We identify core impediments: extreme species diversity, marked data heterogeneity, limited sample sizes, and a pervasive reduction of multi-omics data to simplistic differential screens, resulting in low translational efficiency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42725211","kind":"claim","label":"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42725211"]},"sources":[{"id":"source.frontier.pmid-42725211","title":"Europe PMC record PMID 42725211: Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess:","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42725211%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7759/cureus.114353","title":"doi:10.7759/cureus.114353","url":"https://doi.org/10.7759/cureus.114353"}],"status":"frontier","summary":"PMID 42725211 \"Initial Negative MRI Spine and Persistent Staphylococcus aureus Bacteraemia Lead to Delayed Diagnosis of Lumbar Spondylodiscitis and Epidural Abscess: A Case Report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 65-year-old man who presented with acute low back pain, high-grade fever, confusion, and transient neurological symptoms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42649901","kind":"claim","label":"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42649901"]},"sources":[{"id":"source.frontier.pmid-42649901","title":"Europe PMC record PMID 42649901: Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42649901%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/cancers18162587","title":"doi:10.3390/cancers18162587","url":"https://doi.org/10.3390/cancers18162587"}],"status":"frontier","summary":"PMID 42649901 \"Treatment Strategies for Extramammary Paget Disease: A Narrative Review of Current Status and Future Directions\" (CC BY, first published 2026-08-11) reports: \"Although localized intraepidermal EMPD generally follows an indolent clinical course, invasive EMPD is associated with lymph node metastasis, distant dissemination, and poor survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42644024","kind":"claim","label":"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42644024"]},"sources":[{"id":"source.frontier.pmid-42644024","title":"Europe PMC record PMID 42644024: Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> varian","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42644024%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fped.2026.1913335","title":"doi:10.3389/fped.2026.1913335","url":"https://doi.org/10.3389/fped.2026.1913335"}],"status":"frontier","summary":"PMID 42644024 \"Pulmonary alveolar proteinosis and <i>Pneumocystis jirovecii</i> infection in an infant with hyper-IgM syndrome caused by a novel <i>CD40LG</i> variant: a case report\" (CC BY, first published 2026-08-11) reports: \"We report the case of a 4-month-old boy admitted due to failure to thrive and severe hypoxemic respiratory failure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42578673","kind":"claim","label":"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42578673"]},"sources":[{"id":"source.frontier.pmid-42578673","title":"Europe PMC record PMID 42578673: Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578673%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00528-26","title":"doi:10.1128/spectrum.00528-26","url":"https://doi.org/10.1128/spectrum.00528-26"}],"status":"frontier","summary":"PMID 42578673 \"Resistome and microbiome-immune interactions in an Eastern European population with high antibiotic use\" (CC BY, first published 2026-08-11) reports: \"A balanced microbiome is associated with favorable health outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42578670","kind":"claim","label":"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.pmid-42578670"]},"sources":[{"id":"source.frontier.pmid-42578670","title":"Europe PMC record PMID 42578670: Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42578670%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.03153-24","title":"doi:10.1128/spectrum.03153-24","url":"https://doi.org/10.1128/spectrum.03153-24"}],"status":"frontier","summary":"PMID 42578670 \"Exploring the hypothetical role of <i>Bacteroides</i> species in depression progression: insights from metagenomic analysis\" (CC BY, first published 2026-08-11) reports: \"Our results suggest the importance of exploring microbial markers as potential diagnostic and therapeutic targets in managing depression.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42651890","kind":"claim","label":"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42651890"]},"sources":[{"id":"source.frontier.pmid-42651890","title":"Europe PMC record PMID 42651890: The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42651890%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ani16162486","title":"doi:10.3390/ani16162486","url":"https://doi.org/10.3390/ani16162486"}],"status":"frontier","summary":"PMID 42651890 \"The Dietary Inclusion of Corn and Peas Affects the Fecal Bacterial Diversity and Composition of Sarda Goats\" (CC BY, first published 2026-08-10) reports: \"These findings suggest that dietary supplementation with plant-based concentrates modulates both the taxonomic structure and functional potential of the fecal microbiota in goats.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42639105","kind":"claim","label":"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42639105"]},"sources":[{"id":"source.frontier.pmid-42639105","title":"Europe PMC record PMID 42639105: An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42639105%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1838657","title":"doi:10.3389/fimmu.2026.1838657","url":"https://doi.org/10.3389/fimmu.2026.1838657"}],"status":"frontier","summary":"PMID 42639105 \"An evolutionary analysis of lysophospholipid acyltransferases generating membrane phospholipid diversity\" (CC BY, first published 2026-08-10) reports: \"The analysis reveals a marked expansion and diversification of LPLATs in vertebrates and suggests the possibility of pathogen-specific LPLAT expansions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42638898","kind":"claim","label":"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.pmid-42638898"]},"sources":[{"id":"source.frontier.pmid-42638898","title":"Europe PMC record PMID 42638898: Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42638898%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1866924","title":"doi:10.3389/fcimb.2026.1866924","url":"https://doi.org/10.3389/fcimb.2026.1866924"}],"status":"frontier","summary":"PMID 42638898 \"Emerging microbiome-mitochondria crosstalk in host defense and infectious diseases: mechanistic insights into NLRP3 inflammasome activation and mtDNA-mediated immunomodulation\" (CC BY, first published 2026-08-10) reports: \"Furthermore, experimental findings suggest that mtDNA functions as a damage-associated molecular pattern, activating cGAS-STING and NLRP3 signaling pathways, thereby establishing a connection between alterations in microbiota and systemic inflammation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42577546","kind":"claim","label":"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-09","source_ids":["source.frontier.pmid-42577546"]},"sources":[{"id":"source.frontier.pmid-42577546","title":"Europe PMC record PMID 42577546: Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42577546%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/mco2.70907","title":"doi:10.1002/mco2.70907","url":"https://doi.org/10.1002/mco2.70907"}],"status":"frontier","summary":"PMID 42577546 \"Lower Respiratory Microbiome Dysbiosis Is Associated With Poor Prognosis in Acute Severe Lower Respiratory Tract Infection\" (CC BY, first published 2026-08-09) reports: \"Cluster C3 was associated with poor prognosis and reduced survival.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42728921","kind":"claim","label":"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-08","source_ids":["source.frontier.pmid-42728921"]},"sources":[{"id":"source.frontier.pmid-42728921","title":"Europe PMC record PMID 42728921: Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing &","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42728921%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/f1000research.171577.2","title":"doi:10.12688/f1000research.171577.2","url":"https://doi.org/10.12688/f1000research.171577.2"}],"status":"frontier","summary":"PMID 42728921 \"Understanding the Link Between Toxic Leadership and Employee Well-being: The Interplay of Employee Turnover, Organizational commitment, Shift timing & Industry Sector\" (CC BY, first published 2026-08-08) reports: \"Furthermore, our findings indicated that toxic leadership was found to be a significant predictor of employee turnover and a significant determinant of employee well-being; however, the direction of the relationship was an unexpected result and deserves further consideration through the study of procedures and the operationalisations of constructs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42630507","kind":"claim","label":"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42630507"]},"sources":[{"id":"source.frontier.pmid-42630507","title":"Europe PMC record PMID 42630507: Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42630507%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fimmu.2026.1879544","title":"doi:10.3389/fimmu.2026.1879544","url":"https://doi.org/10.3389/fimmu.2026.1879544"}],"status":"frontier","summary":"PMID 42630507 \"Microbial and metabolic signatures of humanized microbiome mice associate with <i>Tlr2</i> expression and Th17 immune programming\" (CC BY, first published 2026-08-07) reports: \"Together, these findings reveal a microbiota dependent program associating gram-positive enrichment and altered metabolite production to TLR2-associated immune activation and Th17 response.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42571083","kind":"claim","label":"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42571083"]},"sources":[{"id":"source.frontier.pmid-42571083","title":"Europe PMC record PMID 42571083: Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42571083%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1002/ece3.74115","title":"doi:10.1002/ece3.74115","url":"https://doi.org/10.1002/ece3.74115"}],"status":"frontier","summary":"PMID 42571083 \"Neighboring Gulf Killifish (<i>Fundulus grandis</i>) Populations Differ in Their Plastic and Genetic Responses to Salinity Fluctuations\" (CC BY, first published 2026-08-07) reports: \"Processes primarily activated in the urban population under osmotic stress were associated with ion transport, negative regulation of cell cycle, cellular integrity, and energy reallocation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42566407","kind":"claim","label":"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.pmid-42566407"]},"sources":[{"id":"source.frontier.pmid-42566407","title":"Europe PMC record PMID 42566407: Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42566407%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355612","title":"doi:10.1371/journal.pone.0355612","url":"https://doi.org/10.1371/journal.pone.0355612"}],"status":"frontier","summary":"PMID 42566407 \"Geometric morphometric analysis of maxillary molar sexual dimorphism: A cross-sectional study\" (CC BY, first published 2026-08-07) reports: \"These findings demonstrate the utility of 3D geometric morphometric analysis for assessing tooth shape variation and support its application to evaluating sexual dimorphism of maxillary molars.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42588195","kind":"claim","label":"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42588195"]},"sources":[{"id":"source.frontier.pmid-42588195","title":"Europe PMC record PMID 42588195: Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Sing","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42588195%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/nu18152572","title":"doi:10.3390/nu18152572","url":"https://doi.org/10.3390/nu18152572"}],"status":"frontier","summary":"PMID 42588195 \"Clinical Outcomes Following Personalized Gut Microbiota-Targeted Therapy in Children with Atopic Dermatitis and Laboratory-Confirmed Dysbiosis: A Single-Arm Prospective Pilot Study\" (CC BY, first published 2026-08-06) reports: \"Individualized microbiota-targeted therapy was associated with substantial improvements in both clinical and patient-reported disease severity over the 90-day follow-up.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560943","kind":"claim","label":"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42560943"]},"sources":[{"id":"source.frontier.pmid-42560943","title":"Europe PMC record PMID 42560943: Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560943%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0353490","title":"doi:10.1371/journal.pone.0353490","url":"https://doi.org/10.1371/journal.pone.0353490"}],"status":"frontier","summary":"PMID 42560943 \"Unlocking Gen Z engagement in phygital retailing: Evidence from a multi-mediated customer experience model\" (CC BY, first published 2026-08-06) reports: \"The findings highlight the importance of co-creation, engagement, and perceived value in shaping loyalty, while underscoring the role of digital literacy in navigating hybrid retail contexts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560043","kind":"claim","label":"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.pmid-42560043"]},"sources":[{"id":"source.frontier.pmid-42560043","title":"Europe PMC record PMID 42560043: Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560043%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00371-26","title":"doi:10.1128/msystems.00371-26","url":"https://doi.org/10.1128/msystems.00371-26"}],"status":"frontier","summary":"PMID 42560043 \"Differential proteomics of bacteria grown <i>in vitro</i> and <i>in planta</i> reveals functions used during growth on maize roots\" (CC BY, first published 2026-08-06) reports: \"Together, our findings highlight both conserved and species-specific bacterial strategies for growth in the root environment and lay a foundation for future work investigating the mechanisms underlying plant-microbiota interactions.IMPORTANCEBacteria that live on and around plant roots are important for plant growth and health; however, we still know relatively little about how individual bacterial species behave in this environment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42569382","kind":"claim","label":"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42569382"]},"sources":[{"id":"source.frontier.pmid-42569382","title":"Europe PMC record PMID 42569382: The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42569382%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.18332/tid/225461","title":"doi:10.18332/tid/225461","url":"https://doi.org/10.18332/tid/225461"}],"status":"frontier","summary":"PMID 42569382 \"The quality and reliability of short videos about passive smoking on Bilibili and TikTok: A cross-sectional study\" (CC BY, first published 2026-08-05) reports: \"Passive smoking is associated with substantial morbidity and mortality, yet public awareness of its health risks remains limited.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42554464","kind":"claim","label":"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42554464"]},"sources":[{"id":"source.frontier.pmid-42554464","title":"Europe PMC record PMID 42554464: The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42554464%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/mbio.00360-26","title":"doi:10.1128/mbio.00360-26","url":"https://doi.org/10.1128/mbio.00360-26"}],"status":"frontier","summary":"PMID 42554464 \"The FleQ-FleN circuit balances flagellar number against fitness in <i>Pseudomonas aeruginosa</i>\" (CC BY, first published 2026-08-05) reports: \"Here, we demonstrate that FleN dosage is essential for maintaining monoflagellation and fitness.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42528383","kind":"claim","label":"The mycobacterial selenocysteine machinery: presence and expression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.pmid-42528383"]},"sources":[{"id":"source.frontier.pmid-42528383","title":"Europe PMC record PMID 42528383: The mycobacterial selenocysteine machinery: presence and expression","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42528383%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1080/15476286.2026.2712054","title":"doi:10.1080/15476286.2026.2712054","url":"https://doi.org/10.1080/15476286.2026.2712054"}],"status":"frontier","summary":"PMID 42528383 \"The mycobacterial selenocysteine machinery: presence and expression\" (CC BY, first published 2026-08-05) reports: \"Their presence is distributed evenly among slow and rapid-growing mycobacteria and our data indicate that they were acquired through horizontal gene transfer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42589669","kind":"claim","label":"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.pmid-42589669"]},"sources":[{"id":"source.frontier.pmid-42589669","title":"Europe PMC record PMID 42589669: Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42589669%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ijms27157016","title":"doi:10.3390/ijms27157016","url":"https://doi.org/10.3390/ijms27157016"}],"status":"frontier","summary":"PMID 42589669 \"Origin, Conservation and Functional Diversification of the BES1/BZR1 Gene Family During Early Land Plant Terrestrialization in Bryophytes\" (CC BY, first published 2026-08-04) reports: \"Collectively, our results demonstrate that the BES1/BZR1 family originated at an early stage of land plant evolution, followed by lineage-specific gene expansion and divergent transcriptional regulation in bryophytes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42590131","kind":"claim","label":"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.pmid-42590131"]},"sources":[{"id":"source.frontier.pmid-42590131","title":"Europe PMC record PMID 42590131: Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42590131%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/jcm15156029","title":"doi:10.3390/jcm15156029","url":"https://doi.org/10.3390/jcm15156029"}],"status":"frontier","summary":"PMID 42590131 \"Small Airway Dysfunction Assessed by Impulse Oscillometry in Children with Congenital Adrenal Hyperplasia: A Preliminary Case-Control Study\" (CC BY, first published 2026-08-03) reports: \": Congenital adrenal hyperplasia (CAH) is associated with chronic hormonal dysregulation and prolonged glucocorticoid exposure, which may contribute to alterations in pulmonary physiology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42545021","kind":"claim","label":"Diversity and sources of floral microbial communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.pmid-42545021"]},"sources":[{"id":"source.frontier.pmid-42545021","title":"Europe PMC record PMID 42545021: Diversity and sources of floral microbial communities","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42545021%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/aem.00323-26","title":"doi:10.1128/aem.00323-26","url":"https://doi.org/10.1128/aem.00323-26"}],"status":"frontier","summary":"PMID 42545021 \"Diversity and sources of floral microbial communities\" (CC BY, first published 2026-08-03) reports: \"Our analysis reveals a strong research bias toward nectar and stigma, which collectively dominate the studies of floral microbiota.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42549006","kind":"claim","label":"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.pmid-42549006"]},"sources":[{"id":"source.frontier.pmid-42549006","title":"Europe PMC record PMID 42549006: The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42549006%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1155/ijod/7239600","title":"doi:10.1155/ijod/7239600","url":"https://doi.org/10.1155/ijod/7239600"}],"status":"frontier","summary":"PMID 42549006 \"The Bacteria-Fungi-Phage Interplay in Periodontitis and Peri-Implantitis\" (CC BY, first published 2026-08-02) reports: \"Our analysis demonstrates that disease progression is marked by a shift toward polymicrobial synergy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42606346","kind":"claim","label":"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42606346"]},"sources":[{"id":"source.frontier.pmid-42606346","title":"Europe PMC record PMID 42606346: The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42606346%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1111/mec.70511","title":"doi:10.1111/mec.70511","url":"https://doi.org/10.1111/mec.70511"}],"status":"frontier","summary":"PMID 42606346 \"The Transcriptomic Response Along an Urbanization Gradient Is Also Temperature-Dependent in a Freshwater Insect\" (CC BY, first published 2026-08-01) reports: \"We found that 24 genes varied in expression along a continuous urbanization gradient and were related to proteolysis, extracellular organization and perception.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42560857","kind":"claim","label":"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42560857"]},"sources":[{"id":"source.frontier.pmid-42560857","title":"Europe PMC record PMID 42560857: The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42560857%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/ejcts/ezag207","title":"doi:10.1093/ejcts/ezag207","url":"https://doi.org/10.1093/ejcts/ezag207"}],"status":"frontier","summary":"PMID 42560857 \"The Long-Term Impact of a Teleprehabilitation Programme on Modifiable Risk Factors and Quality of Life After Cardiac Surgery\" (CC BY, first published 2026-08-01) reports: \"Teleprehabilitation was associated with more favourable trajectories for smoking behaviour (P = .045) and nutritional risk (P = .011), with consistently lower incidences throughout follow-up.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42550924","kind":"claim","label":"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42550924"]},"sources":[{"id":"source.frontier.pmid-42550924","title":"Europe PMC record PMID 42550924: Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42550924%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plphys/kiag572","title":"doi:10.1093/plphys/kiag572","url":"https://doi.org/10.1093/plphys/kiag572"}],"status":"frontier","summary":"PMID 42550924 \"Pollen-expressed methionine synthases in Nicotiana tabacum regulate pollen development and germination\" (CC BY, first published 2026-08-01) reports: \"The results showed that 6 NtMetEs belonging to dicot subclade 2 (DS2) localized in the endoplasmic reticulum, nucleus, and cytosol, while NsylMetE4 of DS1 with a transit peptide localized to the cytosol and nucleus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42520407","kind":"claim","label":"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42520407"]},"sources":[{"id":"source.frontier.pmid-42520407","title":"Europe PMC record PMID 42520407: The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42520407%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plcell/koag224","title":"doi:10.1093/plcell/koag224","url":"https://doi.org/10.1093/plcell/koag224"}],"status":"frontier","summary":"PMID 42520407 \"The Spirogyra pratensis genome illuminates the evolution of developmental programs and spiral chloroplast biology\" (CC BY, first published 2026-08-01) reports: \"Our data highlight the activation of quiescence and homeostatic programs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42489250","kind":"claim","label":"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42489250"]},"sources":[{"id":"source.frontier.pmid-42489250","title":"Europe PMC record PMID 42489250: NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489250%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/gbe/evag185","title":"doi:10.1093/gbe/evag185","url":"https://doi.org/10.1093/gbe/evag185"}],"status":"frontier","summary":"PMID 42489250 \"NOD-Like Receptor Genes Undergo Diversity-Enhancing Evolution in a Fungal Species Complex\" (CC BY, first published 2026-08-01) reports: \"We show that the vast majority of the NLRs display effector domains known to be involved in regulated cell death execution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42470282","kind":"claim","label":"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.pmid-42470282"]},"sources":[{"id":"source.frontier.pmid-42470282","title":"Europe PMC record PMID 42470282: Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42470282%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1093/plphys/kiag525","title":"doi:10.1093/plphys/kiag525","url":"https://doi.org/10.1093/plphys/kiag525"}],"status":"frontier","summary":"PMID 42470282 \"Phylogenomic analysis supports the deep and gradual evolution of water-conducting tissues\" (CC BY, first published 2026-08-01) reports: \"Many of the gene families absent in hornworts are associated with developmental processes, including those important for water-conducting cells, which are not found in this group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42538349","kind":"claim","label":"Global trade responses to shark finning regulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.pmid-42538349"]},"sources":[{"id":"source.frontier.pmid-42538349","title":"Europe PMC record PMID 42538349: Global trade responses to shark finning regulations","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42538349%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1038/s41467-026-75625-1","title":"doi:10.1038/s41467-026-75625-1","url":"https://doi.org/10.1038/s41467-026-75625-1"}],"status":"frontier","summary":"PMID 42538349 \"Global trade responses to shark finning regulations\" (CC BY, first published 2026-07-31) reports: \"Using causal inference methods and the Aquatic Resource Trade in Species database (2007-2020), we find weak and statistically insignificant effects of finning regulations on overall shark trade volumes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42536671","kind":"claim","label":"NLCD: A method to discover nonlinear causal relations among genes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.pmid-42536671"]},"sources":[{"id":"source.frontier.pmid-42536671","title":"Europe PMC record PMID 42536671: NLCD: A method to discover nonlinear causal relations among genes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42536671%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pcbi.1014570","title":"doi:10.1371/journal.pcbi.1014570","url":"https://doi.org/10.1371/journal.pcbi.1014570"}],"status":"frontier","summary":"PMID 42536671 \"NLCD: A method to discover nonlinear causal relations among genes\" (CC BY, first published 2026-07-31) reports: \"On simulated datasets, NLCD performs comparably to most methods in detecting linear relations (Average AUPRC (Area Under the Precision-Recall Curve) of NLCD = 0.94, CIT = 0.94, Findr = 0.94, and MRPC = 0.99), and outperforms them in detecting nonlinear (sine and sawtooth type) relations between two genes (Average AUPRC of NLCD = 0.76, CIT = 0.60, Findr = 0.56, and MRPC = 0.73).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42597521","kind":"claim","label":"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42597521"]},"sources":[{"id":"source.frontier.pmid-42597521","title":"Europe PMC record PMID 42597521: Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42597521%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/frhs.2026.1816682","title":"doi:10.3389/frhs.2026.1816682","url":"https://doi.org/10.3389/frhs.2026.1816682"}],"status":"frontier","summary":"PMID 42597521 \"Implementation strategies to promote e-Tracker use in the childhood immunization program in Rwanda - a mixed methods study\" (CC BY, first published 2026-07-30) reports: \"These findings suggest an association between participatory, facilitation-based approaches and nurses' commitment which in turn may support sustainable use of digital tools.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531275","kind":"claim","label":"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531275"]},"sources":[{"id":"source.frontier.pmid-42531275","title":"Europe PMC record PMID 42531275: Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-metho","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531275%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354470","title":"doi:10.1371/journal.pone.0354470","url":"https://doi.org/10.1371/journal.pone.0354470"}],"status":"frontier","summary":"PMID 42531275 \"Exploring perceptions, readiness, barriers, and facilitators related to the potential implementation of postpartum depression screening: A mixed-methods study in a Lebanese maternity setting\" (CC BY, first published 2026-07-30) reports: \"The findings suggest that challenges to the potential implementation of PPD screening may be related to capacity and organizational support than to resistance among participants.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531267","kind":"claim","label":"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531267"]},"sources":[{"id":"source.frontier.pmid-42531267","title":"Europe PMC record PMID 42531267: Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Childr","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531267%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006694","title":"doi:10.1371/journal.pgph.0006694","url":"https://doi.org/10.1371/journal.pgph.0006694"}],"status":"frontier","summary":"PMID 42531267 \"Prevalence, patterns and associated behavioural risk factors of multimorbidity in rural India: Cross-sectional analysis from the Andhra Pradesh Children and Parents Study (APCAPS)\" (CC BY, first published 2026-07-30) reports: \"Current tobacco consumption (adjusted odds ratio (aOR) = 1.23 [95% confidence interval (CI): 1.01-1.50]), physical inactivity (aOR: 1.66 [95% CI: 1.38-1.99]), and poor sleep (aOR: 1.86 [95% CI: 1.35-2.57]) were associated with higher odds of having multimorbidity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531261","kind":"claim","label":"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531261"]},"sources":[{"id":"source.frontier.pmid-42531261","title":"Europe PMC record PMID 42531261: Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531261%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006629","title":"doi:10.1371/journal.pgph.0006629","url":"https://doi.org/10.1371/journal.pgph.0006629"}],"status":"frontier","summary":"PMID 42531261 \"Disease control and its correlates among hypertensive, diabetic, and asthmatic patients enrolled in secondary-level Integrated Chronic Care Clinics in Neno District, rural Malawi\" (CC BY, first published 2026-07-30) reports: \"Asthma control was associated with inhaled corticosteroid use, while glycaemic control was associated with the number of prescribed medications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531248","kind":"claim","label":"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531248"]},"sources":[{"id":"source.frontier.pmid-42531248","title":"Europe PMC record PMID 42531248: Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531248%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0355164","title":"doi:10.1371/journal.pone.0355164","url":"https://doi.org/10.1371/journal.pone.0355164"}],"status":"frontier","summary":"PMID 42531248 \"Current immunosuppressive treatment and self-reported lifetime stroke history among United States adults: A cross-sectional study\" (CC BY, first published 2026-07-30) reports: \"Current immunosuppressive treatment status, likely reflecting both medication exposure and underlying disease burden, was associated with higher odds of self-reported lifetime stroke history among United States adults.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42531221","kind":"claim","label":"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.pmid-42531221"]},"sources":[{"id":"source.frontier.pmid-42531221","title":"Europe PMC record PMID 42531221: Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42531221%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354745","title":"doi:10.1371/journal.pone.0354745","url":"https://doi.org/10.1371/journal.pone.0354745"}],"status":"frontier","summary":"PMID 42531221 \"Suicidal ideation, mental health services, and barriers to care among syringe services program clients who use opioids\" (CC BY, first published 2026-07-30) reports: \"However, gaps persist in understanding suicidal risk among individuals attending SSPs and the extent to which such risk is associated with mental health service utilization in this setting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42533345","kind":"claim","label":"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.pmid-42533345"]},"sources":[{"id":"source.frontier.pmid-42533345","title":"Europe PMC record PMID 42533345: Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42533345%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s12915-026-02688-3","title":"doi:10.1186/s12915-026-02688-3","url":"https://doi.org/10.1186/s12915-026-02688-3"}],"status":"frontier","summary":"PMID 42533345 \"Nanopore sequencing reveals coordinated host and microbiome responses across barley genotypes\" (CC BY, first published 2026-07-29) reports: \"Integration of host and microbiome data revealed coordinated molecular patterns, indicating that barley genotypes are associated with distinct microbial assemblages and corresponding transcriptional responses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42652430","kind":"claim","label":"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.pmid-42652430"]},"sources":[{"id":"source.frontier.pmid-42652430","title":"Europe PMC record PMID 42652430: Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts o","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42652430%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/insects17080775","title":"doi:10.3390/insects17080775","url":"https://doi.org/10.3390/insects17080775"}],"status":"frontier","summary":"PMID 42652430 \"Manipulation of Microbial Symbionts in <i>Bemisia tabaci</i> and <i>Trialeurodes vaporariorum</i> (Hemiptera: Aleyrodidae) Reveals Divergent Impacts on Insect Host Fitness and Plant Defense Modulation\" (CC BY, first published 2026-07-27) reports: \"These findings show that microbial symbionts are essential to whitefly nutrition and evasion of plant anti-herbivore defenses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42507643","kind":"claim","label":"Enhancing missense variant classification in predicted intrinsically disordered regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.pmid-42507643"]},"sources":[{"id":"source.frontier.pmid-42507643","title":"Europe PMC record PMID 42507643: Enhancing missense variant classification in predicted intrinsically disordered regions","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42507643%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0354365","title":"doi:10.1371/journal.pone.0354365","url":"https://doi.org/10.1371/journal.pone.0354365"}],"status":"frontier","summary":"PMID 42507643 \"Enhancing missense variant classification in predicted intrinsically disordered regions\" (CC BY, first published 2026-07-27) reports: \"These results demonstrate the effectiveness of our enhancements for classifying missense variants in IDRs and highlight its ability to complement existing in silico missense predictors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42565205","kind":"claim","label":"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.pmid-42565205"]},"sources":[{"id":"source.frontier.pmid-42565205","title":"Europe PMC record PMID 42565205: The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42565205%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fgene.2026.1822823","title":"doi:10.3389/fgene.2026.1822823","url":"https://doi.org/10.3389/fgene.2026.1822823"}],"status":"frontier","summary":"PMID 42565205 \"The association between the <i>MCM6</i> LCT-13910C>T variant and bone mineral density in patients with inflammatory bowel disease\" (CC BY, first published 2026-07-24) reports: \"Inflammatory bowel diseases (IBD), including Crohn's disease (CD) and ulcerative colitis (UC), are associated with increased risk of osteoporosis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42497150","kind":"claim","label":"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.pmid-42497150"]},"sources":[{"id":"source.frontier.pmid-42497150","title":"Europe PMC record PMID 42497150: Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cro","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42497150%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0349072","title":"doi:10.1371/journal.pone.0349072","url":"https://doi.org/10.1371/journal.pone.0349072"}],"status":"frontier","summary":"PMID 42497150 \"Fertility desires and utilization of an integrated HIV care and family planning services among young women living with HIV in semi-rural Uganda: A cross sectional study\" (CC BY, first published 2026-07-24) reports: \"The data revealed a high fertility desire (88.9%) among the YWLHIV.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42723771","kind":"claim","label":"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42723771"]},"sources":[{"id":"source.frontier.pmid-42723771","title":"Europe PMC record PMID 42723771: Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42723771%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.12688/openreseurope.23373.2","title":"doi:10.12688/openreseurope.23373.2","url":"https://doi.org/10.12688/openreseurope.23373.2"}],"status":"frontier","summary":"PMID 42723771 \"Mind the Gap: From Policy to Practice at CNR An Analysis of Career Advancement Criteria in Light of the Agreement on Reforming Research Assessment\" (CC BY, first published 2026-07-23) reports: \"These findings suggest that traditional evaluation practices persist at the committee level, despite formal institutional reform.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42493198","kind":"claim","label":"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42493198"]},"sources":[{"id":"source.frontier.pmid-42493198","title":"Europe PMC record PMID 42493198: Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled ","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42493198%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1136/openhrt-2026-004136","title":"doi:10.1136/openhrt-2026-004136","url":"https://doi.org/10.1136/openhrt-2026-004136"}],"status":"frontier","summary":"PMID 42493198 \"Effect of pictorial-based information about atherosclerosis on adherence to lifestyle recommendations: results from the VIPVIZA randomised controlled trial\" (CC BY, first published 2026-07-23) reports: \"We found no interactions for age, sex or education.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42489485","kind":"claim","label":"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.pmid-42489485"]},"sources":[{"id":"source.frontier.pmid-42489485","title":"Europe PMC record PMID 42489485: AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42489485%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/mbio.01295-26","title":"doi:10.1128/mbio.01295-26","url":"https://doi.org/10.1128/mbio.01295-26"}],"status":"frontier","summary":"PMID 42489485 \"AlphaFold-driven structural proteomics reveals extensive cellulosome machinery in human ruminococcal symbionts\" (CC BY, first published 2026-07-23) reports: \"Here, we show that extensive sequence divergence obscures the detection of many ruminococcal cellulosomes by conventional sequence homology-based methods.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42485395","kind":"claim","label":"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42485395"]},"sources":[{"id":"source.frontier.pmid-42485395","title":"Europe PMC record PMID 42485395: Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485395%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgph.0006877","title":"doi:10.1371/journal.pgph.0006877","url":"https://doi.org/10.1371/journal.pgph.0006877"}],"status":"frontier","summary":"PMID 42485395 \"Prevalence of lead poisoning and unique lead sources in Bhutan: Findings from a nationally representative survey 2024\" (CC BY, first published 2026-07-22) reports: \"Taking Jinlab Mendrup (blessed religious substance) in the previous 15 days was associated with having a BLL ≥ 3.5 µg/dL, aOR=1.94 (1.34-2.70, p = 0.009).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42485283","kind":"claim","label":"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42485283"]},"sources":[{"id":"source.frontier.pmid-42485283","title":"Europe PMC record PMID 42485283: Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42485283%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0352857","title":"doi:10.1371/journal.pone.0352857","url":"https://doi.org/10.1371/journal.pone.0352857"}],"status":"frontier","summary":"PMID 42485283 \"Profiles of medication literacy and associated factors among young and middle-aged hypertensive patients in China: A latent profile analysis\" (CC BY, first published 2026-07-22) reports: \"More specifically, lower education and lower income were associated with membership in the low literacy profile, while higher social support, higher self-efficacy, and more positive illness perception characterized the high literacy group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42484337","kind":"claim","label":"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.pmid-42484337"]},"sources":[{"id":"source.frontier.pmid-42484337","title":"Europe PMC record PMID 42484337: Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42484337%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00441-26","title":"doi:10.1128/spectrum.00441-26","url":"https://doi.org/10.1128/spectrum.00441-26"}],"status":"frontier","summary":"PMID 42484337 \"Genomic exploration of <i>Bacillus paralicheniformis</i> TB197: an agrobiotechnological tool from the Sonoran Desert\" (CC BY, first published 2026-07-22) reports: \"These findings highlight the potential of the TB197 strain as a promising candidate for developing next-generation bioinoculants.IMPORTANCEThe use of beneficial microorganisms is a pivotal strategy for mitigating the environmental impacts of intensive agriculture while preserving crop productivity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42553384","kind":"claim","label":"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42553384"]},"sources":[{"id":"source.frontier.pmid-42553384","title":"Europe PMC record PMID 42553384: Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadf","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553384%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/ffunb.2026.1894067","title":"doi:10.3389/ffunb.2026.1894067","url":"https://doi.org/10.3389/ffunb.2026.1894067"}],"status":"frontier","summary":"PMID 42553384 \"Aerolysin-like proteins from <i>Armillaria ostoyae</i> with potential roles in plant pathogenicity reveal a distant evolutionary relationship to toadfish natterins\" (CC BY, first published 2026-07-21) reports: \"Our results demonstrate that these candidate proteins are actively transcribed throughout the fungal life cycle, with consistent expression maintained in mature fruiting-body tissues.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42553105","kind":"claim","label":"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42553105"]},"sources":[{"id":"source.frontier.pmid-42553105","title":"Europe PMC record PMID 42553105: Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42553105%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fneur.2026.1858031","title":"doi:10.3389/fneur.2026.1858031","url":"https://doi.org/10.3389/fneur.2026.1858031"}],"status":"frontier","summary":"PMID 42553105 \"Longitudinal assessment of intraocular pressure in the 5xFAD mouse model of Alzheimer's disease\" (CC BY, first published 2026-07-21) reports: \"These results suggest that amyloid-driven pathology in this model is not accompanied by chronic ocular hypertension.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42480918","kind":"claim","label":"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.pmid-42480918"]},"sources":[{"id":"source.frontier.pmid-42480918","title":"Europe PMC record PMID 42480918: Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42480918%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3168/jds.2026-28569","title":"doi:10.3168/jds.2026-28569","url":"https://doi.org/10.3168/jds.2026-28569"}],"status":"frontier","summary":"PMID 42480918 \"Characterization of potential sources of secretory immunoglobulin A reaching the rumen and its effects on microbial growth and fermentation\" (CC BY, first published 2026-07-21) reports: \"These findings indicate that colostrum and milk serve as primary sources of SIgA during early life in calves, whereas salivary gland-derived SIgA becomes the predominant source as animals mature, given the limited SIgA secretion within the rumen itself.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42467705","kind":"claim","label":"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.pmid-42467705"]},"sources":[{"id":"source.frontier.pmid-42467705","title":"Europe PMC record PMID 42467705: Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42467705%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pone.0353117","title":"doi:10.1371/journal.pone.0353117","url":"https://doi.org/10.1371/journal.pone.0353117"}],"status":"frontier","summary":"PMID 42467705 \"Geographic inequalities in HIV testing uptake among young women in sub-Saharan Africa: A hierarchical bayesian spatial analysis\" (CC BY, first published 2026-07-17) reports: \"The study revealed that HIV testing uptake among young women in SSA is significantly below the 95%-95%-95% target, with notable spatial clustering and variation across countries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42534899","kind":"claim","label":"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42534899"]},"sources":[{"id":"source.frontier.pmid-42534899","title":"Europe PMC record PMID 42534899: Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42534899%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1833734","title":"doi:10.3389/fcimb.2026.1833734","url":"https://doi.org/10.3389/fcimb.2026.1833734"}],"status":"frontier","summary":"PMID 42534899 \"Dynamics of archaeal diversity and functionality in the piglet gut microbiome under common antimicrobial treatments\" (CC BY, first published 2026-07-16) reports: \"Herein, we uncover the taxonomic and functional landscape of the piglet archaeome during the weaning transition under multiple experimental conditions, integrating shotgun metagenomic and metatranscriptomic analyses to elucidate its contribution to gut microbial ecology.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42462719","kind":"claim","label":"Evolutionary radiation of Polaromonas from mountain glaciers downstream","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42462719"]},"sources":[{"id":"source.frontier.pmid-42462719","title":"Europe PMC record PMID 42462719: Evolutionary radiation of Polaromonas from mountain glaciers downstream","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42462719%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1016/j.cub.2026.06.070","title":"doi:10.1016/j.cub.2026.06.070","url":"https://doi.org/10.1016/j.cub.2026.06.070"}],"status":"frontier","summary":"PMID 42462719 \"Evolutionary radiation of Polaromonas from mountain glaciers downstream\" (CC BY, first published 2026-07-16) reports: \"Compared to the ancestral Polaromonas genome, distinct genomic signatures were associated with specific habitats: GFS lineages possess expanded stress-tolerance repertoires, glacier lineages gained chemolithotrophic and anaerobic pathways, lake and wetland genomes acquired phototrophic functions, and soil lineages expanded substrate transport and stress tolerance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42461951","kind":"claim","label":"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.pmid-42461951"]},"sources":[{"id":"source.frontier.pmid-42461951","title":"Europe PMC record PMID 42461951: Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42461951%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1371/journal.pgen.1012245","title":"doi:10.1371/journal.pgen.1012245","url":"https://doi.org/10.1371/journal.pgen.1012245"}],"status":"frontier","summary":"PMID 42461951 \"Contrasting evolutionary patterns of helper and sensor NRC NLRs in lettuce reflect functional divergence following subfunctionalization\" (CC BY, first published 2026-07-16) reports: \"Our findings reveal that the NRC network has expanded less in Asterales compared to Solanales.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42529330","kind":"claim","label":"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42529330"]},"sources":[{"id":"source.frontier.pmid-42529330","title":"Europe PMC record PMID 42529330: Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42529330%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fcimb.2026.1858069","title":"doi:10.3389/fcimb.2026.1858069","url":"https://doi.org/10.3389/fcimb.2026.1858069"}],"status":"frontier","summary":"PMID 42529330 \"Integrated microbiomic and proteomic profiling reveals distinct ocular surface molecular and microbial landscapes in dry eye after SMILE surgery\" (CC BY, first published 2026-07-15) reports: \"In this cross-sectional analysis, the presence of DED after SMILE is associated with a distinct shift in the ocular surface microbiome towards a pro-inflammatory state and a concomitant breakdown of host proteomic homeostasis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42458577","kind":"claim","label":"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42458577"]},"sources":[{"id":"source.frontier.pmid-42458577","title":"Europe PMC record PMID 42458577: Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42458577%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1186/s13100-026-00411-1","title":"doi:10.1186/s13100-026-00411-1","url":"https://doi.org/10.1186/s13100-026-00411-1"}],"status":"frontier","summary":"PMID 42458577 \"Transposable element dynamics and regulatory role in sika deer (Cervus nippon) antler development\" (CC BY, first published 2026-07-15) reports: \"Through profiling TE expression in antler mesenchymal tissue across key development stages, the results suggest that dynamic TEs expression may be involved in the regulation of antler development, implicating a potential regulatory role for TEs in this rapid growth process.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42455014","kind":"claim","label":"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42455014"]},"sources":[{"id":"source.frontier.pmid-42455014","title":"Europe PMC record PMID 42455014: Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42455014%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/jb.00023-26","title":"doi:10.1128/jb.00023-26","url":"https://doi.org/10.1128/jb.00023-26"}],"status":"frontier","summary":"PMID 42455014 \"Multispectral regulation of chromatic acclimation by integration of the Rca system and the conserved <i>dpx</i> operon\" (CC BY, first published 2026-07-15) reports: \"Here, we show that DpxA and RcaE collectively control the vast majority of chromatic acclimation across the visible spectrum, implicating DpxA as the likely sensor for the Cgi system.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42454934","kind":"claim","label":"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.pmid-42454934"]},"sources":[{"id":"source.frontier.pmid-42454934","title":"Europe PMC record PMID 42454934: MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42454934%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msystems.00308-26","title":"doi:10.1128/msystems.00308-26","url":"https://doi.org/10.1128/msystems.00308-26"}],"status":"frontier","summary":"PMID 42454934 \"MATRIX: rapid quantification of total and active microbial cells with single-cell phenotypes for environmental microbiomes\" (CC BY, first published 2026-07-15) reports: \"We demonstrate its reproducibility and versatility using both cultured isolates and high-diversity soil communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42491728","kind":"claim","label":"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.pmid-42491728"]},"sources":[{"id":"source.frontier.pmid-42491728","title":"Europe PMC record PMID 42491728: Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42491728%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.7717/peerj.21488","title":"doi:10.7717/peerj.21488","url":"https://doi.org/10.7717/peerj.21488"}],"status":"frontier","summary":"PMID 42491728 \"Clinical strains isolated from early-stage colorectal cancer patients promote tumorigenesis\" (CC BY, first published 2026-07-14) reports: \"Colorectal cancer (CRC) is prevalent worldwide and is associated with gut commensals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42516974","kind":"claim","label":"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42516974"]},"sources":[{"id":"source.frontier.pmid-42516974","title":"Europe PMC record PMID 42516974: Silent witnesses: basidiomycota as forensic biomarkers in human decomposition","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42516974%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3389/fmicb.2026.1774584","title":"doi:10.3389/fmicb.2026.1774584","url":"https://doi.org/10.3389/fmicb.2026.1774584"}],"status":"frontier","summary":"PMID 42516974 \"Silent witnesses: basidiomycota as forensic biomarkers in human decomposition\" (CC BY, first published 2026-07-13) reports: \"Focusing on ammonia fungi and late-stage decomposers, we demonstrate their forensic value through nitrogen-responsive colonization, enzyme-mediated specificity for recalcitrant tissues, and physical persistence of sporocarps and mycelial networks that outlast insect evidence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42441853","kind":"claim","label":"Evolutionary innovation through fusion of sequences from across the tree of life","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42441853"]},"sources":[{"id":"source.frontier.pmid-42441853","title":"Europe PMC record PMID 42441853: Evolutionary innovation through fusion of sequences from across the tree of life","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42441853%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1073/pnas.2602557123","title":"doi:10.1073/pnas.2602557123","url":"https://doi.org/10.1073/pnas.2602557123"}],"status":"frontier","summary":"PMID 42441853 \"Evolutionary innovation through fusion of sequences from across the tree of life\" (CC BY, first published 2026-07-13) reports: \"We found evidence for the expression of contiguous chimeric messenger RNA transcripts (mRNAs) for 36 of 41 tested HGT-chimeras across 18 of 20 different tested species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42439519","kind":"claim","label":"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.pmid-42439519"]},"sources":[{"id":"source.frontier.pmid-42439519","title":"Europe PMC record PMID 42439519: Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42439519%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/aem.00728-26","title":"doi:10.1128/aem.00728-26","url":"https://doi.org/10.1128/aem.00728-26"}],"status":"frontier","summary":"PMID 42439519 \"Harnessing endogenous CRISPR-Cas9 for inducible genetic engineering of <i>Apilactobacillus kunkeei</i>\" (CC BY, first published 2026-07-13) reports: \"We further demonstrate that endogenous Cas9 can be repurposed for CRISPR interference using a single, self-contained plasmid to enable targeted transcriptional repression.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42429610","kind":"claim","label":"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-10","source_ids":["source.frontier.pmid-42429610"]},"sources":[{"id":"source.frontier.pmid-42429610","title":"Europe PMC record PMID 42429610: Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42429610%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/msphere.00289-26","title":"doi:10.1128/msphere.00289-26","url":"https://doi.org/10.1128/msphere.00289-26"}],"status":"frontier","summary":"PMID 42429610 \"Deciphering the <i>in vitro</i> mucin-driven interaction dynamics of a synthetic gut bacterial community\" (CC BY, first published 2026-07-10) reports: \"Our results showed that positive interactions were prevalent among bacteria when mucin served as the sole carbon source.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42514673","kind":"claim","label":"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-08","source_ids":["source.frontier.pmid-42514673"]},"sources":[{"id":"source.frontier.pmid-42514673","title":"Europe PMC record PMID 42514673: Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42514673%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/vetsci13070663","title":"doi:10.3390/vetsci13070663","url":"https://doi.org/10.3390/vetsci13070663"}],"status":"frontier","summary":"PMID 42514673 \"Conjoint Analysis of Sheep Microbiome, Metabolome, and Transcriptome Revealed the Effect Mechanisms of Feeding with Broccoli Extract\" (CC BY, first published 2026-07-08) reports: \"These findings demonstrate that the extract of broccoli tails modulates intestinal gene expression, systemic metabolism, and gut microbial ecology in Hu sheep, providing new insights into the utilization of agricultural byproducts as a functional feed supplement for ruminants.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42515727","kind":"claim","label":"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.pmid-42515727"]},"sources":[{"id":"source.frontier.pmid-42515727","title":"Europe PMC record PMID 42515727: Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42515727%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/ph19071045","title":"doi:10.3390/ph19071045","url":"https://doi.org/10.3390/ph19071045"}],"status":"frontier","summary":"PMID 42515727 \"Gut Microbiota in NSAID Enteropathy: Current Evidence and Future Perspectives for Therapeutic Strategies\" (CC BY, first published 2026-07-07) reports: \"However, their long-term use is associated with substantial gastrointestinal (GI) toxicity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42405792","kind":"claim","label":"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-06","source_ids":["source.frontier.pmid-42405792"]},"sources":[{"id":"source.frontier.pmid-42405792","title":"Europe PMC record PMID 42405792: Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42405792%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.1128/spectrum.00500-26","title":"doi:10.1128/spectrum.00500-26","url":"https://doi.org/10.1128/spectrum.00500-26"}],"status":"frontier","summary":"PMID 42405792 \"Identification of protein secretion systems and type III effectors in wood-associated bacteria of the genus <i>Xylophilus</i>\" (CC BY, first published 2026-07-06) reports: \"We found three distinct flagellar systems within the genus, one of which was present in all 12 strains for which good-quality genome sequences were available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"life","era":"frontier","frontier":true,"id":"claim.frontier.pmid-42510569","kind":"claim","label":"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-02","source_ids":["source.frontier.pmid-42510569"]},"sources":[{"id":"source.frontier.pmid-42510569","title":"Europe PMC record PMID 42510569: <i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function","url":"https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=EXT_ID:42510569%20AND%20SRC:MED&resultType=core&format=json"},{"id":"doi:10.3390/antiox15070838","title":"doi:10.3390/antiox15070838","url":"https://doi.org/10.3390/antiox15070838"}],"status":"frontier","summary":"PMID 42510569 \"<i>Carex</i> Beyond Taxonomy: Integrating Genomic Architecture, Life History, and Ecosystem Function\" (CC BY, first published 2026-07-02) reports: \"Finally, we identify key priorities for future research, including improved phylogenomic resolution, comparative functional studies, climate-resilience assessment, and germplasm conservation and sustainable use.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-02106","kind":"claim","label":"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.arxiv-2610-02106"]},"sources":[{"id":"source.frontier.arxiv-2610-02106","title":"arXiv OAI-PMH record arXiv:2610.02106: Densities for scalar-valued BSDEs via unique continuation and backward uniqueness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.02106&metadataPrefix=arXiv"},{"id":"arxiv:2610.02106","title":"arXiv:2610.02106","url":"https://arxiv.org/abs/2610.02106"}],"status":"frontier","summary":"arXiv:2610.02106 \"Densities for scalar-valued BSDEs via unique continuation and backward uniqueness\" (CC BY 4.0, submitted 2026-10-01) reports: \"Along the way, we establish a unique continuation property from sets of positive measure and a backward uniqueness result on the whole space for the linear parabolic systems arising from differentiated semilinear equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-39519","kind":"claim","label":"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.arxiv-2609-39519"]},"sources":[{"id":"source.frontier.arxiv-2609-39519","title":"arXiv OAI-PMH record arXiv:2609.39519: B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39519&metadataPrefix=arXiv"},{"id":"arxiv:2609.39519","title":"arXiv:2609.39519","url":"https://arxiv.org/abs/2609.39519"}],"status":"frontier","summary":"arXiv:2609.39519 \"B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics\" (CC BY 4.0, submitted 2026-09-30) reports: \"We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21904","kind":"claim","label":"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.arxiv-2609-21904"]},"sources":[{"id":"source.frontier.arxiv-2609-21904","title":"arXiv OAI-PMH record arXiv:2609.21904: Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21904&metadataPrefix=arXiv"},{"id":"arxiv:2609.21904","title":"arXiv:2609.21904","url":"https://arxiv.org/abs/2609.21904"}],"status":"frontier","summary":"arXiv:2609.21904 \"Compartmental Epidemiological Models: Discussing Fundamental Elements via the SIR Model\" (CC BY 4.0, submitted 2026-09-18) reports: \"We then derive the basic SIR dynamic equations in both continuous-time (differential equations) and discrete-time (difference equations) settings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-19386","kind":"claim","label":"Omitted Variable Bias in Difference-in-Differences Designs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.arxiv-2609-19386"]},"sources":[{"id":"source.frontier.arxiv-2609-19386","title":"arXiv OAI-PMH record arXiv:2609.19386: Omitted Variable Bias in Difference-in-Differences Designs","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19386&metadataPrefix=arXiv"},{"id":"arxiv:2609.19386","title":"arXiv:2609.19386","url":"https://arxiv.org/abs/2609.19386"}],"status":"frontier","summary":"arXiv:2609.19386 \"Omitted Variable Bias in Difference-in-Differences Designs\" (CC BY 4.0, submitted 2026-09-16) reports: \"We show how the ATT bias is mainly governed by the strength of confounding in the treatment assignment mechanism and provide alternative ways of quantifying this strength, such as (i) changes in the average odds of treatment among the treated, (ii) confounding imbalance between treated and control units, or (iii) variation explained in treatment odds among the untreated.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-13345","kind":"claim","label":"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.arxiv-2609-13345"]},"sources":[{"id":"source.frontier.arxiv-2609-13345","title":"arXiv OAI-PMH record arXiv:2609.13345: Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.13345&metadataPrefix=arXiv"},{"id":"arxiv:2609.13345","title":"arXiv:2609.13345","url":"https://arxiv.org/abs/2609.13345"}],"status":"frontier","summary":"arXiv:2609.13345 \"Beyond Point Forecasts: A Survey on Probabilistic Forecasting for Time Series and Spatiotemporal Data\" (CC BY 4.0, submitted 2026-09-11) reports: \"Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-05100","kind":"claim","label":"Layered mixed matrices and reaction networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.arxiv-2609-05100"]},"sources":[{"id":"source.frontier.arxiv-2609-05100","title":"arXiv OAI-PMH record arXiv:2609.05100: Layered mixed matrices and reaction networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05100&metadataPrefix=arXiv"},{"id":"arxiv:2609.05100","title":"arXiv:2609.05100","url":"https://arxiv.org/abs/2609.05100"}],"status":"frontier","summary":"arXiv:2609.05100 \"Layered mixed matrices and reaction networks\" (CC BY 4.0, submitted 2026-09-04) reports: \"In the second part, we establish for the first time a formal connection between these algebraic results and the theory of buffering structures for reaction networks developed by Mochizuki and Okada.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-19170","kind":"claim","label":"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.arxiv-2608-19170"]},"sources":[{"id":"source.frontier.arxiv-2608-19170","title":"arXiv OAI-PMH record arXiv:2608.19170: Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19170&metadataPrefix=arXiv"},{"id":"arxiv:2608.19170","title":"arXiv:2608.19170","url":"https://arxiv.org/abs/2608.19170"}],"status":"frontier","summary":"arXiv:2608.19170 \"Constrained minmax density transportation for linear parabolic PDEs: a numerical optimal control perspective\" (CC BY 4.0, submitted 2026-08-19) reports: \"By leveraging new numerical tools from convex SIP theory, we establish guarantees for exact solutions that account for constraint satisfaction under an infinite family of disturbance realizations, and we establish an optimization-based computationally efficient algorithm to recover these solutions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-14134","kind":"claim","label":"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.arxiv-2608-14134"]},"sources":[{"id":"source.frontier.arxiv-2608-14134","title":"arXiv OAI-PMH record arXiv:2608.14134: Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.14134&metadataPrefix=arXiv"},{"id":"arxiv:2608.14134","title":"arXiv:2608.14134","url":"https://arxiv.org/abs/2608.14134"}],"status":"frontier","summary":"arXiv:2608.14134 \"Photonic Quantum Computing vs. Classical Solvers in Constrained Factor Portfolio Optimization\" (CC BY 4.0, submitted 2026-08-14) reports: \"Our findings demonstrate that while photonic hardware can locate superior risk-return topologies within a narrow operating range, classical mixed-integer programming remains superior for risk-constrained mandates requiring tight tail-risk control and cross-seed stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-06711","kind":"claim","label":"Conditions for Quantum Advantage in AC Power Flow","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.arxiv-2608-06711"]},"sources":[{"id":"source.frontier.arxiv-2608-06711","title":"arXiv OAI-PMH record arXiv:2608.06711: Conditions for Quantum Advantage in AC Power Flow","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.06711&metadataPrefix=arXiv"},{"id":"arxiv:2608.06711","title":"arXiv:2608.06711","url":"https://arxiv.org/abs/2608.06711"}],"status":"frontier","summary":"arXiv:2608.06711 \"Conditions for Quantum Advantage in AC Power Flow\" (CC BY 4.0, submitted 2026-08-07) reports: \"First, we establish a benchmark for a QC iterative solver to demonstrate an advantage over the classical Newton-Raphson Load Flow (NRLF) algorithm.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-04208","kind":"claim","label":"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-04208"]},"sources":[{"id":"source.frontier.arxiv-2608-04208","title":"arXiv OAI-PMH record arXiv:2608.04208: Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04208&metadataPrefix=arXiv"},{"id":"arxiv:2608.04208","title":"arXiv:2608.04208","url":"https://arxiv.org/abs/2608.04208"}],"status":"frontier","summary":"arXiv:2608.04208 \"Estimating Heterogeneity in Travel Mode Choice Shifts with Causal Forests\" (CC BY 4.0, submitted 2026-08-04) reports: \"This study demonstrates the application of a novel causal method, causal forest, to quantify the heterogeneity in travel mode choice shifts caused by the COVID-19 pandemic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-03832","kind":"claim","label":"Reduced-rank Generalized Bilinear Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-03832"]},"sources":[{"id":"source.frontier.arxiv-2608-03832","title":"arXiv OAI-PMH record arXiv:2608.03832: Reduced-rank Generalized Bilinear Models","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03832&metadataPrefix=arXiv"},{"id":"arxiv:2608.03832","title":"arXiv:2608.03832","url":"https://arxiv.org/abs/2608.03832"}],"status":"frontier","summary":"arXiv:2608.03832 \"Reduced-rank Generalized Bilinear Models\" (CC BY 4.0, submitted 2026-08-04) reports: \"In simulation studies, we find that when the true sample coefficient matrix is reduced rank or close to reduced rank, RR-GBM outperforms the standard full-rank GBM both statistically and computationally, providing more accurate estimates with lower computational burden.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-03192","kind":"claim","label":"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-03192"]},"sources":[{"id":"source.frontier.arxiv-2608-03192","title":"arXiv OAI-PMH record arXiv:2608.03192: The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03192&metadataPrefix=arXiv"},{"id":"arxiv:2608.03192","title":"arXiv:2608.03192","url":"https://arxiv.org/abs/2608.03192"}],"status":"frontier","summary":"arXiv:2608.03192 \"The Persistence of the Dirty Air Penalty: A Causal Analysis of Formula 1's 2022 Ground Effect Regulations\" (CC BY 4.0, submitted 2026-08-04) reports: \"We found no season for which the change was different from the one observed in 2021 in the OLS analysis, while several seasons were significantly different from zero in the Causal Forest analysis, in a non-monotonic pattern, not following the theorized erosion timeline.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02799","kind":"claim","label":"A Hyperfinite Framework for Score-Based Generative Modeling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.arxiv-2608-02799"]},"sources":[{"id":"source.frontier.arxiv-2608-02799","title":"arXiv OAI-PMH record arXiv:2608.02799: A Hyperfinite Framework for Score-Based Generative Modeling","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02799&metadataPrefix=arXiv"},{"id":"arxiv:2608.02799","title":"arXiv:2608.02799","url":"https://arxiv.org/abs/2608.02799"}],"status":"frontier","summary":"arXiv:2608.02799 \"A Hyperfinite Framework for Score-Based Generative Modeling\" (CC BY 4.0, submitted 2026-08-03) reports: \"Starting from an internal diffusion process on a hyperfinite grid, we derive the associated infinitesimal generator and establish its correspondence with the classical Fokker--Planck equation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00708","kind":"claim","label":"Hypergraphs on Riemannian manifolds and their double homology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00708"]},"sources":[{"id":"source.frontier.arxiv-2608-00708","title":"arXiv OAI-PMH record arXiv:2608.00708: Hypergraphs on Riemannian manifolds and their double homology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00708&metadataPrefix=arXiv"},{"id":"arxiv:2608.00708","title":"arXiv:2608.00708","url":"https://arxiv.org/abs/2608.00708"}],"status":"frontier","summary":"arXiv:2608.00708 \"Hypergraphs on Riemannian manifolds and their double homology\" (CC BY 4.0, submitted 2026-08-01) reports: \"With the help of the canonical projection $π$ from ordered sequences to their underlying unordered sets, we prove a commutative diagram of the double homology of hyper(di)graphs on Riemannian manifolds and a commutative diagram of the spaces of differential forms of hyper(di)graphs on Riemannian manifolds.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00649","kind":"claim","label":"Empirical optimal transport potentials: fast rates and a functional central limit theorem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00649"]},"sources":[{"id":"source.frontier.arxiv-2608-00649","title":"arXiv OAI-PMH record arXiv:2608.00649: Empirical optimal transport potentials: fast rates and a functional central limit theorem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00649&metadataPrefix=arXiv"},{"id":"arxiv:2608.00649","title":"arXiv:2608.00649","url":"https://arxiv.org/abs/2608.00649"}],"status":"frontier","summary":"arXiv:2608.00649 \"Empirical optimal transport potentials: fast rates and a functional central limit theorem\" (CC BY 4.0, submitted 2026-08-01) reports: \"In dimensions $d\\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00445","kind":"claim","label":"Exact detection threshold of the packing test","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-01","source_ids":["source.frontier.arxiv-2608-00445"]},"sources":[{"id":"source.frontier.arxiv-2608-00445","title":"arXiv OAI-PMH record arXiv:2608.00445: Exact detection threshold of the packing test","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00445&metadataPrefix=arXiv"},{"id":"arxiv:2608.00445","title":"arXiv:2608.00445","url":"https://arxiv.org/abs/2608.00445"}],"status":"frontier","summary":"arXiv:2608.00445 \"Exact detection threshold of the packing test\" (CC0 1.0, submitted 2026-08-01) reports: \"Using Poisson approximation techniques, we derive the detection threshold of the packing test in \\cite{Jiang13} when testing spherical uniformity under high-dimensional Fisher--von Mises--Langevin (FvML) and Watson alternatives.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29270","kind":"claim","label":"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29270"]},"sources":[{"id":"source.frontier.arxiv-2607-29270","title":"arXiv OAI-PMH record arXiv:2607.29270: Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29270&metadataPrefix=arXiv"},{"id":"arxiv:2607.29270","title":"arXiv:2607.29270","url":"https://arxiv.org/abs/2607.29270"}],"status":"frontier","summary":"arXiv:2607.29270 \"Iterative Methods for Computing the Moore--Penrose Inverse of Split-Quaternion Matrices with Applications\" (CC BY 4.0, submitted 2026-07-31) reports: \"Using a thin singular value decomposition of the real representative, we derive the convergence conditions, the evolution of the projector residuals, and an exact relation between the residual and the error.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29131","kind":"claim","label":"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29131"]},"sources":[{"id":"source.frontier.arxiv-2607-29131","title":"arXiv OAI-PMH record arXiv:2607.29131: Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29131&metadataPrefix=arXiv"},{"id":"arxiv:2607.29131","title":"arXiv:2607.29131","url":"https://arxiv.org/abs/2607.29131"}],"status":"frontier","summary":"arXiv:2607.29131 \"Dark Photon - ALP Freeze-in: 511 keV and H$α$ Constraints\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that, for a nearly degenerate dark sector, dark photon decay into an electron-positron pair through the kinetic mixing explains the Galactic 511 keV line while the dimension five operator can source the necessary production of dark photon and ALP particles to satisfy the relic density.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29123","kind":"claim","label":"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29123"]},"sources":[{"id":"source.frontier.arxiv-2607-29123","title":"arXiv OAI-PMH record arXiv:2607.29123: Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29123&metadataPrefix=arXiv"},{"id":"arxiv:2607.29123","title":"arXiv:2607.29123","url":"https://arxiv.org/abs/2607.29123"}],"status":"frontier","summary":"arXiv:2607.29123 \"Numerical Optimization of Two-Qubit Gates in Silicon Flip-Flop Qubit Arrays under Electrical Control\" (CC BY 4.0, submitted 2026-07-31) reports: \"Our results demonstrate that high-fidelity entangling operations cannot be optimized in isolation; rather, they require a co-design approach that simultaneously optimizes pulse control, local phase compensation, and physical device geometry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-29073","kind":"claim","label":"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-29073"]},"sources":[{"id":"source.frontier.arxiv-2607-29073","title":"arXiv OAI-PMH record arXiv:2607.29073: On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.29073&metadataPrefix=arXiv"},{"id":"arxiv:2607.29073","title":"arXiv:2607.29073","url":"https://arxiv.org/abs/2607.29073"}],"status":"frontier","summary":"arXiv:2607.29073 \"On the Origin of Beyond-Classical Advantage in the Parity-Permutation Problem\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28919","kind":"claim","label":"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-28919"]},"sources":[{"id":"source.frontier.arxiv-2607-28919","title":"arXiv OAI-PMH record arXiv:2607.28919: Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28919&metadataPrefix=arXiv"},{"id":"arxiv:2607.28919","title":"arXiv:2607.28919","url":"https://arxiv.org/abs/2607.28919"}],"status":"frontier","summary":"arXiv:2607.28919 \"Strongly Magnetized Super-Eddington Accretion: How Spin and Accretion Rate Regulate Energy Output and Mass Loss\" (CC BY 4.0, submitted 2026-07-31) reports: \"We find that black hole spin and accretion rate jointly regulate wind loss rates and energy output efficiencies, while black hole mass has no effect over the mass range studied here.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28080","kind":"claim","label":"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-28080"]},"sources":[{"id":"source.frontier.arxiv-2607-28080","title":"arXiv OAI-PMH record arXiv:2607.28080: On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28080&metadataPrefix=arXiv"},{"id":"arxiv:2607.28080","title":"arXiv:2607.28080","url":"https://arxiv.org/abs/2607.28080"}],"status":"frontier","summary":"arXiv:2607.28080 \"On a joint simultaneous learning of relevant feature subsets and subspaces in regression-like problems\" (CC BY 4.0, submitted 2026-07-31) reports: \"It is shown that the proposed extension - that we coin as Entropy-Optimal Manifold Regression (EOMR) - allows a robust learning with linearly-scaling iteration and memory complexities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25783","kind":"claim","label":"Deterministic loading of molecular arrays by microwave-assisted collisions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-25783"]},"sources":[{"id":"source.frontier.arxiv-2607-25783","title":"arXiv OAI-PMH record arXiv:2607.25783: Deterministic loading of molecular arrays by microwave-assisted collisions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25783&metadataPrefix=arXiv"},{"id":"arxiv:2607.25783","title":"arXiv:2607.25783","url":"https://arxiv.org/abs/2607.25783"}],"status":"frontier","summary":"arXiv:2607.25783 \"Deterministic loading of molecular arrays by microwave-assisted collisions\" (CC BY 4.0, submitted 2026-07-31) reports: \"We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-11988","kind":"claim","label":"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-11988"]},"sources":[{"id":"source.frontier.arxiv-2607-11988","title":"arXiv OAI-PMH record arXiv:2607.11988: Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.11988&metadataPrefix=arXiv"},{"id":"arxiv:2607.11988","title":"arXiv:2607.11988","url":"https://arxiv.org/abs/2607.11988"}],"status":"frontier","summary":"arXiv:2607.11988 \"Density evolution at fluid-fluid interfaces: A generalized Gibbs-Duhem theory\" (CC BY 4.0, submitted 2026-07-31) reports: \"Here, we derive a generalized Gibbs-Duhem framework that incorporates kinetic contributions, thereby establishing a unified connection between classical thermodynamics and Newtonian mechanics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28893","kind":"claim","label":"Piecewise isometry groups of Euclidean tessellations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28893"]},"sources":[{"id":"source.frontier.arxiv-2607-28893","title":"arXiv OAI-PMH record arXiv:2607.28893: Piecewise isometry groups of Euclidean tessellations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28893&metadataPrefix=arXiv"},{"id":"arxiv:2607.28893","title":"arXiv:2607.28893","url":"https://arxiv.org/abs/2607.28893"}],"status":"frontier","summary":"arXiv:2607.28893 \"Piecewise isometry groups of Euclidean tessellations\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove structure results about groups of piecewise isometries of sufficiently nice tessellations of Euclidean space, such as tessellations associated to crystallographic root systems, in particular proving that they are elementary amenable.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28883","kind":"claim","label":"The VORTEX cavity for the RADES axion haloscope","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28883"]},"sources":[{"id":"source.frontier.arxiv-2607-28883","title":"arXiv OAI-PMH record arXiv:2607.28883: The VORTEX cavity for the RADES axion haloscope","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28883&metadataPrefix=arXiv"},{"id":"arxiv:2607.28883","title":"arXiv:2607.28883","url":"https://arxiv.org/abs/2607.28883"}],"status":"frontier","summary":"arXiv:2607.28883 \"The VORTEX cavity for the RADES axion haloscope\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this article, we report on the implementation and performance of an axion haloscope dubbed Vertical-cut Optimised Resonant Tunable cavity for dark matter EXploration (VORTEX) centred at $8.5$ GHz with a tuning range of around $800$ MHz.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28746","kind":"claim","label":"From Horizon Microstates to the Black Hole Membrane","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28746"]},"sources":[{"id":"source.frontier.arxiv-2607-28746","title":"arXiv OAI-PMH record arXiv:2607.28746: From Horizon Microstates to the Black Hole Membrane","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28746&metadataPrefix=arXiv"},{"id":"arxiv:2607.28746","title":"arXiv:2607.28746","url":"https://arxiv.org/abs/2607.28746"}],"status":"frontier","summary":"arXiv:2607.28746 \"From Horizon Microstates to the Black Hole Membrane\" (CC BY 4.0, submitted 2026-07-30) reports: \"We derive a microscopic electromagnetic membrane from black-hole matrix quantum mechanics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28739","kind":"claim","label":"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28739"]},"sources":[{"id":"source.frontier.arxiv-2607-28739","title":"arXiv OAI-PMH record arXiv:2607.28739: Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28739&metadataPrefix=arXiv"},{"id":"arxiv:2607.28739","title":"arXiv:2607.28739","url":"https://arxiv.org/abs/2607.28739"}],"status":"frontier","summary":"arXiv:2607.28739 \"Fishing for Jellyfish Galaxies: Exploring ram-pressure stripping with crowd science\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the fraction of RPS candidates rises from ~10% in galaxy groups to ~20-30% in massive clusters, confirming the findings of previous studies carried out on smaller samples.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28738","kind":"claim","label":"Obstructions to Traversable Wormholes in Einstein-Dirac Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28738"]},"sources":[{"id":"source.frontier.arxiv-2607-28738","title":"arXiv OAI-PMH record arXiv:2607.28738: Obstructions to Traversable Wormholes in Einstein-Dirac Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28738&metadataPrefix=arXiv"},{"id":"arxiv:2607.28738","title":"arXiv:2607.28738","url":"https://arxiv.org/abs/2607.28738"}],"status":"frontier","summary":"arXiv:2607.28738 \"Obstructions to Traversable Wormholes in Einstein-Dirac Theory\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this paper, we show that classical, positive-frequency Dirac fields on certain fixed wormhole geometries can violate ANEC, so they are indeed candidates for sourcing traversable wormholes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28736","kind":"claim","label":"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28736"]},"sources":[{"id":"source.frontier.arxiv-2607-28736","title":"arXiv OAI-PMH record arXiv:2607.28736: Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28736&metadataPrefix=arXiv"},{"id":"arxiv:2607.28736","title":"arXiv:2607.28736","url":"https://arxiv.org/abs/2607.28736"}],"status":"frontier","summary":"arXiv:2607.28736 \"Cataclysmic variables from Gaia XP spectra: The Gaia emission-line magnitude (GEM) diagram\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that known CVs and major stellar background populations, including white dwarfs, hot subdwarfs, and white dwarf-main sequence binaries, occupy distinct regions on the GEM diagram, reflecting both their physical properties and the low-resolution nature of the Gaia XP spectra.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28717","kind":"claim","label":"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28717"]},"sources":[{"id":"source.frontier.arxiv-2607-28717","title":"arXiv OAI-PMH record arXiv:2607.28717: Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28717&metadataPrefix=arXiv"},{"id":"arxiv:2607.28717","title":"arXiv:2607.28717","url":"https://arxiv.org/abs/2607.28717"},{"id":"doi:10.3847/1538-4357/ae83b5","title":"doi:10.3847/1538-4357/ae83b5","url":"https://doi.org/10.3847/1538-4357/ae83b5"}],"status":"frontier","summary":"arXiv:2607.28717 \"Atmospheric Signatures of Common Envelope Evolution in White Dwarf Planets\" (CC BY 4.0, submitted 2026-07-30) reports: \"Assuming a range of planet masses (1$-$13 M$_{\\mathrm{Jup}}$) and accretion efficiencies (0.01$-$1.0), we find that the planet can accrete up to 48% of its initial mass in the most extreme Eddington-limited scenario.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28714","kind":"claim","label":"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28714"]},"sources":[{"id":"source.frontier.arxiv-2607-28714","title":"arXiv OAI-PMH record arXiv:2607.28714: Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28714&metadataPrefix=arXiv"},{"id":"arxiv:2607.28714","title":"arXiv:2607.28714","url":"https://arxiv.org/abs/2607.28714"}],"status":"frontier","summary":"arXiv:2607.28714 \"Peering through the dip: IXPE unveils the extended scattering environment of GX 13+1\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our analysis reveals significant variations in polarimetric properties tracking the dip.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28690","kind":"claim","label":"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28690"]},"sources":[{"id":"source.frontier.arxiv-2607-28690","title":"arXiv OAI-PMH record arXiv:2607.28690: Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28690&metadataPrefix=arXiv"},{"id":"arxiv:2607.28690","title":"arXiv:2607.28690","url":"https://arxiv.org/abs/2607.28690"},{"id":"doi:10.1016/j.physletb.2026.140569","title":"doi:10.1016/j.physletb.2026.140569","url":"https://doi.org/10.1016/j.physletb.2026.140569"}],"status":"frontier","summary":"arXiv:2607.28690 \"Metric--Measure Geometry and Geometric Analogues of Holographic Extremal Surfaces\" (CC BY 4.0, submitted 2026-07-30) reports: \"These results suggest that metric--measure geometry provides a minimal framework in which key structural features of extremal surface constructions can arise from intrinsic geometric principles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28604","kind":"claim","label":"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28604"]},"sources":[{"id":"source.frontier.arxiv-2607-28604","title":"arXiv OAI-PMH record arXiv:2607.28604: Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28604&metadataPrefix=arXiv"},{"id":"arxiv:2607.28604","title":"arXiv:2607.28604","url":"https://arxiv.org/abs/2607.28604"}],"status":"frontier","summary":"arXiv:2607.28604 \"Cosmo-SPINN: Fuzzy Dark Matter Simulations with Physics-Informed Generative Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"For the evolution task, we find that the inclusion of this physics-based loss significantly improves the quality of the predicted simulations, even when only a small amount of training data is available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28597","kind":"claim","label":"Nonnuclear Bunce-Deddens algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28597"]},"sources":[{"id":"source.frontier.arxiv-2607-28597","title":"arXiv OAI-PMH record arXiv:2607.28597: Nonnuclear Bunce-Deddens algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28597&metadataPrefix=arXiv"},{"id":"arxiv:2607.28597","title":"arXiv:2607.28597","url":"https://arxiv.org/abs/2607.28597"}],"status":"frontier","summary":"arXiv:2607.28597 \"Nonnuclear Bunce-Deddens algebras\" (CC BY 4.0, submitted 2026-07-30) reports: \"For large classes of groups, we show that they share many regularity properties, including real rank zero, stable rank one, strict comparison of positive elements, and admitting a unique tracial state.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28533","kind":"claim","label":"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28533"]},"sources":[{"id":"source.frontier.arxiv-2607-28533","title":"arXiv OAI-PMH record arXiv:2607.28533: Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28533&metadataPrefix=arXiv"},{"id":"arxiv:2607.28533","title":"arXiv:2607.28533","url":"https://arxiv.org/abs/2607.28533"}],"status":"frontier","summary":"arXiv:2607.28533 \"Hubbard physics with ultracold polar molecules: on-site interaction energies for shielded molecules\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find behavior very different from that for ultracold atoms: in particular, there are states for which $U$ is negative for weak lattices but crosses zero to positive values as the lattice strength increases.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28524","kind":"claim","label":"Exact chiral symmetry with quantum signal processing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28524"]},"sources":[{"id":"source.frontier.arxiv-2607-28524","title":"arXiv OAI-PMH record arXiv:2607.28524: Exact chiral symmetry with quantum signal processing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28524&metadataPrefix=arXiv"},{"id":"arxiv:2607.28524","title":"arXiv:2607.28524","url":"https://arxiv.org/abs/2607.28524"}],"status":"frontier","summary":"arXiv:2607.28524 \"Exact chiral symmetry with quantum signal processing\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28504","kind":"claim","label":"Spacetime Layout and Logical Compilation of Color Code","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28504"]},"sources":[{"id":"source.frontier.arxiv-2607-28504","title":"arXiv OAI-PMH record arXiv:2607.28504: Spacetime Layout and Logical Compilation of Color Code","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28504&metadataPrefix=arXiv"},{"id":"arxiv:2607.28504","title":"arXiv:2607.28504","url":"https://arxiv.org/abs/2607.28504"}],"status":"frontier","summary":"arXiv:2607.28504 \"Spacetime Layout and Logical Compilation of Color Code\" (CC BY 4.0, submitted 2026-07-30) reports: \"Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28491","kind":"claim","label":"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28491"]},"sources":[{"id":"source.frontier.arxiv-2607-28491","title":"arXiv OAI-PMH record arXiv:2607.28491: Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28491&metadataPrefix=arXiv"},{"id":"arxiv:2607.28491","title":"arXiv:2607.28491","url":"https://arxiv.org/abs/2607.28491"}],"status":"frontier","summary":"arXiv:2607.28491 \"Drumhead Surface States of Rhombohedral Graphite with Near Ideal Quantum Geometry Condition\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that bulk RG is a weak topological insulator with spin-orbit coupling (SOC), besides being effectively a chiral semimetal with chiral nodal line without SOC.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28479","kind":"claim","label":"Mitigating quantum decoherence via global optimal control","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28479"]},"sources":[{"id":"source.frontier.arxiv-2607-28479","title":"arXiv OAI-PMH record arXiv:2607.28479: Mitigating quantum decoherence via global optimal control","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28479&metadataPrefix=arXiv"},{"id":"arxiv:2607.28479","title":"arXiv:2607.28479","url":"https://arxiv.org/abs/2607.28479"}],"status":"frontier","summary":"arXiv:2607.28479 \"Mitigating quantum decoherence via global optimal control\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28471","kind":"claim","label":"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28471"]},"sources":[{"id":"source.frontier.arxiv-2607-28471","title":"arXiv OAI-PMH record arXiv:2607.28471: From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28471&metadataPrefix=arXiv"},{"id":"arxiv:2607.28471","title":"arXiv:2607.28471","url":"https://arxiv.org/abs/2607.28471"}],"status":"frontier","summary":"arXiv:2607.28471 \"From Exact Diagonalization to DMRG: A Complete Numerical Study of the Transverse-Field Ising Model\" (CC BY 4.0, submitted 2026-07-30) reports: \"A single, consistent methodology - identical field grid, identical convergence diagnostic (independent runs at bond dimensions chi=100 and chi=200 at every point) - is used across all seven system sizes, and we show explicitly where exact diagonalization and DMRG must agree exactly rather than merely approximately.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28441","kind":"claim","label":"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28441"]},"sources":[{"id":"source.frontier.arxiv-2607-28441","title":"arXiv OAI-PMH record arXiv:2607.28441: Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28441&metadataPrefix=arXiv"},{"id":"arxiv:2607.28441","title":"arXiv:2607.28441","url":"https://arxiv.org/abs/2607.28441"}],"status":"frontier","summary":"arXiv:2607.28441 \"Transport Evidence of Magnetic Polarization in the Altermagnetic Candidate MnTe\" (CC BY 4.0, submitted 2026-07-30) reports: \"In this work, we report the successful growth of epitaxial α-MnTe thin films on InP(111) substrates using molecular beam epitaxy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28438","kind":"claim","label":"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28438"]},"sources":[{"id":"source.frontier.arxiv-2607-28438","title":"arXiv OAI-PMH record arXiv:2607.28438: Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and ","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28438&metadataPrefix=arXiv"},{"id":"arxiv:2607.28438","title":"arXiv:2607.28438","url":"https://arxiv.org/abs/2607.28438"}],"status":"frontier","summary":"arXiv:2607.28438 \"Binary neutron stars in the next-generation era: Multi-messenger detection prospects and constraints on the equation of state, mass distribution, and cosmology\" (CC BY 4.0, submitted 2026-07-30) reports: \"By comparing inference results that rely solely on GW data and those that incorporate light curve information, we find that while KN light-curve posteriors have a negligible impact on the EOS constraints, they can benefit the inference of cosmological parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28345","kind":"claim","label":"The cycle C9 does not admit uniform mixing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28345"]},"sources":[{"id":"source.frontier.arxiv-2607-28345","title":"arXiv OAI-PMH record arXiv:2607.28345: The cycle C9 does not admit uniform mixing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28345&metadataPrefix=arXiv"},{"id":"arxiv:2607.28345","title":"arXiv:2607.28345","url":"https://arxiv.org/abs/2607.28345"}],"status":"frontier","summary":"arXiv:2607.28345 \"The cycle C9 does not admit uniform mixing\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28173","kind":"claim","label":"Semi-supervised Hopfield model: Theoretical and Numerical results","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28173"]},"sources":[{"id":"source.frontier.arxiv-2607-28173","title":"arXiv OAI-PMH record arXiv:2607.28173: Semi-supervised Hopfield model: Theoretical and Numerical results","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28173&metadataPrefix=arXiv"},{"id":"arxiv:2607.28173","title":"arXiv:2607.28173","url":"https://arxiv.org/abs/2607.28173"}],"status":"frontier","summary":"arXiv:2607.28173 \"Semi-supervised Hopfield model: Theoretical and Numerical results\" (CC BY 4.0, submitted 2026-07-30) reports: \"Using Guerra's interpolation, we then derive the Replica Symmetric quenched pressure in the high-storage regime, treating the correlated disorder generated by the supervised and unsupervised channels through a particular eigen-channel decomposition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28168","kind":"claim","label":"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28168"]},"sources":[{"id":"source.frontier.arxiv-2607-28168","title":"arXiv OAI-PMH record arXiv:2607.28168: On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28168&metadataPrefix=arXiv"},{"id":"arxiv:2607.28168","title":"arXiv:2607.28168","url":"https://arxiv.org/abs/2607.28168"}],"status":"frontier","summary":"arXiv:2607.28168 \"On Leader Selection for Strong Structural Controllability in Matrix-Weighted Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"We prove that structural uncontrollability stems exclusively from dimension-specific reachability isolation and topological symmetry equivalence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28161","kind":"claim","label":"A Mathematical Framework for Topological Causal Data Analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28161"]},"sources":[{"id":"source.frontier.arxiv-2607-28161","title":"arXiv OAI-PMH record arXiv:2607.28161: A Mathematical Framework for Topological Causal Data Analysis","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28161&metadataPrefix=arXiv"},{"id":"arxiv:2607.28161","title":"arXiv:2607.28161","url":"https://arxiv.org/abs/2607.28161"}],"status":"frontier","summary":"arXiv:2607.28161 \"A Mathematical Framework for Topological Causal Data Analysis\" (CC BY 4.0, submitted 2026-07-30) reports: \"At the distribution level, we identify targets through the standard causal \\(g\\)-formula and derive stability-transfer bounds and plug-in consistency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28140","kind":"claim","label":"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28140"]},"sources":[{"id":"source.frontier.arxiv-2607-28140","title":"arXiv OAI-PMH record arXiv:2607.28140: A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28140&metadataPrefix=arXiv"},{"id":"arxiv:2607.28140","title":"arXiv:2607.28140","url":"https://arxiv.org/abs/2607.28140"},{"id":"doi:10.1051/0004-6361/202660862","title":"doi:10.1051/0004-6361/202660862","url":"https://doi.org/10.1051/0004-6361/202660862"}],"status":"frontier","summary":"arXiv:2607.28140 \"A study of the large-scale formation in the environment of A3266: Infalling groups, filaments, and a premerger cold front\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings reveal a coherent network of galaxy groups around A3266, tracing its ongoing assembly along the large-scale structure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28095","kind":"claim","label":"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28095"]},"sources":[{"id":"source.frontier.arxiv-2607-28095","title":"arXiv OAI-PMH record arXiv:2607.28095: Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28095&metadataPrefix=arXiv"},{"id":"arxiv:2607.28095","title":"arXiv:2607.28095","url":"https://arxiv.org/abs/2607.28095"}],"status":"frontier","summary":"arXiv:2607.28095 \"Comment on the preprint: First Limits on Axion Dark Matter from a DALI Prototype arXiv:2603.21951\" (CC BY 4.0, submitted 2026-07-30) reports: \"We report on an independent assessment of the sensitivity of the DALI setup to axion-like particle (ALP) dark matter, as described in [1].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28021","kind":"claim","label":"The Euler Characteristic Transform from a Convex Geometric Perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28021"]},"sources":[{"id":"source.frontier.arxiv-2607-28021","title":"arXiv OAI-PMH record arXiv:2607.28021: The Euler Characteristic Transform from a Convex Geometric Perspective","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28021&metadataPrefix=arXiv"},{"id":"arxiv:2607.28021","title":"arXiv:2607.28021","url":"https://arxiv.org/abs/2607.28021"}],"status":"frontier","summary":"arXiv:2607.28021 \"The Euler Characteristic Transform from a Convex Geometric Perspective\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also show how convex geometry provides a path to recover interesting geometric information of a flat shape from its ECT, namely, its perimeter, for which we give an explicit formula.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27985","kind":"claim","label":"Bridging continuous control and Floquet driving for charging many-body spin chains","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27985"]},"sources":[{"id":"source.frontier.arxiv-2607-27985","title":"arXiv OAI-PMH record arXiv:2607.27985: Bridging continuous control and Floquet driving for charging many-body spin chains","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27985&metadataPrefix=arXiv"},{"id":"arxiv:2607.27985","title":"arXiv:2607.27985","url":"https://arxiv.org/abs/2607.27985"}],"status":"frontier","summary":"arXiv:2607.27985 \"Bridging continuous control and Floquet driving for charging many-body spin chains\" (CC BY 4.0, submitted 2026-07-30) reports: \"Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27957","kind":"claim","label":"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27957"]},"sources":[{"id":"source.frontier.arxiv-2607-27957","title":"arXiv OAI-PMH record arXiv:2607.27957: Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27957&metadataPrefix=arXiv"},{"id":"arxiv:2607.27957","title":"arXiv:2607.27957","url":"https://arxiv.org/abs/2607.27957"}],"status":"frontier","summary":"arXiv:2607.27957 \"Exponential Advantage of Multipartite Entanglement over Quantum Communication with Applications to Bounded-Storage Cryptography\" (CC BY 4.0, submitted 2026-07-30) reports: \"We establish an exponential communication advantage enabled by multipartite quantum entanglement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27874","kind":"claim","label":"Non-conformal obstructions to bubble expansion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27874"]},"sources":[{"id":"source.frontier.arxiv-2607-27874","title":"arXiv OAI-PMH record arXiv:2607.27874: Non-conformal obstructions to bubble expansion","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27874&metadataPrefix=arXiv"},{"id":"arxiv:2607.27874","title":"arXiv:2607.27874","url":"https://arxiv.org/abs/2607.27874"}],"status":"frontier","summary":"arXiv:2607.27874 \"Non-conformal obstructions to bubble expansion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We uncover a new set of hydrodynamic obstructions to bubble expansion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27860","kind":"claim","label":"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27860"]},"sources":[{"id":"source.frontier.arxiv-2607-27860","title":"arXiv OAI-PMH record arXiv:2607.27860: Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27860&metadataPrefix=arXiv"},{"id":"arxiv:2607.27860","title":"arXiv:2607.27860","url":"https://arxiv.org/abs/2607.27860"}],"status":"frontier","summary":"arXiv:2607.27860 \"Revealing the Physical Driver of the Baldwin Effect: Gas Density in the Broad-Line Region\" (CC BY 4.0, submitted 2026-07-30) reports: \"Our findings indicate that BLR gas density serves as the primary physical driver underlying the \"global\" Baldwin effect, offering a physically grounded framework for interpreting AGN accretion states and their coupled evolution with host galaxies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27805","kind":"claim","label":"Chaos in reason: How chain-of-thought LLMs can look for an answer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27805"]},"sources":[{"id":"source.frontier.arxiv-2607-27805","title":"arXiv OAI-PMH record arXiv:2607.27805: Chaos in reason: How chain-of-thought LLMs can look for an answer","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27805&metadataPrefix=arXiv"},{"id":"arxiv:2607.27805","title":"arXiv:2607.27805","url":"https://arxiv.org/abs/2607.27805"}],"status":"frontier","summary":"arXiv:2607.27805 \"Chaos in reason: How chain-of-thought LLMs can look for an answer\" (CC BY 4.0, submitted 2026-07-30) reports: \"By analyzing both text and hidden state trajectories, we demonstrate that LLMs exhibit hallmark signatures of chaos, including strong sensitivity to initial conditions, manifested as intermittent, jump-like divergence of nearby trajectories combined with bounded evolution, with consistent results across different distance metrics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27799","kind":"claim","label":"When do Kernels Admit Characteristic Functions?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27799"]},"sources":[{"id":"source.frontier.arxiv-2607-27799","title":"arXiv OAI-PMH record arXiv:2607.27799: When do Kernels Admit Characteristic Functions?","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27799&metadataPrefix=arXiv"},{"id":"arxiv:2607.27799","title":"arXiv:2607.27799","url":"https://arxiv.org/abs/2607.27799"}],"status":"frontier","summary":"arXiv:2607.27799 \"When do Kernels Admit Characteristic Functions?\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, in this setting, the existence of a characteristic function is equivalent to a Beurling-type invariant subspace condition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27707","kind":"claim","label":"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27707"]},"sources":[{"id":"source.frontier.arxiv-2607-27707","title":"arXiv OAI-PMH record arXiv:2607.27707: Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27707&metadataPrefix=arXiv"},{"id":"arxiv:2607.27707","title":"arXiv:2607.27707","url":"https://arxiv.org/abs/2607.27707"}],"status":"frontier","summary":"arXiv:2607.27707 \"Constrained thermodynamics and geodesic observables of an effective non-commutative Kerr-like black hole\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also obtain the spherical photon region, equatorial light rings, and shadow boundary, showing that the deformation shifts the characteristic photon orbits inwards and reduces the overall size of the shadow.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27646","kind":"claim","label":"Metric Rigidity in Anchored Sobolev Spaces on Intervals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27646"]},"sources":[{"id":"source.frontier.arxiv-2607-27646","title":"arXiv OAI-PMH record arXiv:2607.27646: Metric Rigidity in Anchored Sobolev Spaces on Intervals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27646&metadataPrefix=arXiv"},{"id":"arxiv:2607.27646","title":"arXiv:2607.27646","url":"https://arxiv.org/abs/2607.27646"}],"status":"frontier","summary":"arXiv:2607.27646 \"Metric Rigidity in Anchored Sobolev Spaces on Intervals\" (CC0 1.0, submitted 2026-07-30) reports: \"We show that the positive unit spheres of $W^{k_1,p}(Ω_1)$ and $W^{k_2,p}(Ω_2)$ are surjectively isometric if and only if $k_1=k_2$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27629","kind":"claim","label":"Curved Kakeya problems and the projective geometry of paths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27629"]},"sources":[{"id":"source.frontier.arxiv-2607-27629","title":"arXiv OAI-PMH record arXiv:2607.27629: Curved Kakeya problems and the projective geometry of paths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27629&metadataPrefix=arXiv"},{"id":"arxiv:2607.27629","title":"arXiv:2607.27629","url":"https://arxiv.org/abs/2607.27629"}],"status":"frontier","summary":"arXiv:2607.27629 \"Curved Kakeya problems and the projective geometry of paths\" (CC BY 4.0, submitted 2026-07-30) reports: \"In particular, we prove that the existence of many totally geodesic surfaces, as required by Wolff's hairbrush argument, is equivalent to projective flatness of the associated spray.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27582","kind":"claim","label":"Polynomial maps which are not good for nice recurrence and applications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-27582"]},"sources":[{"id":"source.frontier.arxiv-2607-27582","title":"arXiv OAI-PMH record arXiv:2607.27582: Polynomial maps which are not good for nice recurrence and applications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27582&metadataPrefix=arXiv"},{"id":"arxiv:2607.27582","title":"arXiv:2607.27582","url":"https://arxiv.org/abs/2607.27582"}],"status":"frontier","summary":"arXiv:2607.27582 \"Polynomial maps which are not good for nice recurrence and applications\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that, unlike the case of polynomial maps $p:\\mathbb Z\\rightarrow\\mathbb Z$ vanishing at zero which are always good for nice recurrence, there are polynomials $p:\\mathbb F_2^ω\\rightarrow \\mathbb F_2^ω$ with $p(0_{\\mathbb F_2^ω})=0_{\\mathbb F_2^ω}$ which fail to have this property.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21030","kind":"claim","label":"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-21030"]},"sources":[{"id":"source.frontier.arxiv-2607-21030","title":"arXiv OAI-PMH record arXiv:2607.21030: Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21030&metadataPrefix=arXiv"},{"id":"arxiv:2607.21030","title":"arXiv:2607.21030","url":"https://arxiv.org/abs/2607.21030"}],"status":"frontier","summary":"arXiv:2607.21030 \"Selecting Complex Extremal Surfaces with the Kontsevich--Segal--Witten Criterion\" (CC BY 4.0, submitted 2026-07-30) reports: \"We also identify configurations for which the resulting complex geometry violates the KSW bound near the asymptotic boundary, revealing both the scope and the limitations of the construction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19220","kind":"claim","label":"Quarkyonic Stars with Strangeness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-19220"]},"sources":[{"id":"source.frontier.arxiv-2607-19220","title":"arXiv OAI-PMH record arXiv:2607.19220: Quarkyonic Stars with Strangeness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19220&metadataPrefix=arXiv"},{"id":"arxiv:2607.19220","title":"arXiv:2607.19220","url":"https://arxiv.org/abs/2607.19220"}],"status":"frontier","summary":"arXiv:2607.19220 \"Quarkyonic Stars with Strangeness\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that the quarkyonic mechanism can obviously reduce the critical density for hyperon appearance in neutron stars due to the fact that the nucleons are displaced to higher momentum states in quarkyonic matter and their chemical potentials rise accordingly.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-12710","kind":"claim","label":"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-12710"]},"sources":[{"id":"source.frontier.arxiv-2607-12710","title":"arXiv OAI-PMH record arXiv:2607.12710: Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12710&metadataPrefix=arXiv"},{"id":"arxiv:2607.12710","title":"arXiv:2607.12710","url":"https://arxiv.org/abs/2607.12710"}],"status":"frontier","summary":"arXiv:2607.12710 \"Thermal Activation of Divergent Distillable Entanglement under Non-Abelian Strong Symmetry\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that thermalization constrained to a non-Abelian strong-symmetry sector can instead generate a distillable resource that diverges with system size.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-10561","kind":"claim","label":"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-10561"]},"sources":[{"id":"source.frontier.arxiv-2607-10561","title":"arXiv OAI-PMH record arXiv:2607.10561: Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.10561&metadataPrefix=arXiv"},{"id":"arxiv:2607.10561","title":"arXiv:2607.10561","url":"https://arxiv.org/abs/2607.10561"}],"status":"frontier","summary":"arXiv:2607.10561 \"Quantum Horizon and Quantum Membrane Paradigm from Black Hole Quantum Mechanics\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the topology of the fuzzy sphere induces a Berry monopole, providing a microscopic origin for the monopole appearing in the tunneling description of the decay of quantum black hole.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-03479","kind":"claim","label":"The multilinear forms Cayley graph and the eigenvalue method for tensor codes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-03479"]},"sources":[{"id":"source.frontier.arxiv-2607-03479","title":"arXiv OAI-PMH record arXiv:2607.03479: The multilinear forms Cayley graph and the eigenvalue method for tensor codes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.03479&metadataPrefix=arXiv"},{"id":"arxiv:2607.03479","title":"arXiv:2607.03479","url":"https://arxiv.org/abs/2607.03479"}],"status":"frontier","summary":"arXiv:2607.03479 \"The multilinear forms Cayley graph and the eigenvalue method for tensor codes\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that the spectrum of this graph has a recursive expression and depends on the possible intersections between tensor subspaces of large enough dimension and the Segre variety.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27515","kind":"claim","label":"Unified dark sector approaches to cosmological tensions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27515"]},"sources":[{"id":"source.frontier.arxiv-2607-27515","title":"arXiv OAI-PMH record arXiv:2607.27515: Unified dark sector approaches to cosmological tensions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27515&metadataPrefix=arXiv"},{"id":"arxiv:2607.27515","title":"arXiv:2607.27515","url":"https://arxiv.org/abs/2607.27515"}],"status":"frontier","summary":"arXiv:2607.27515 \"Unified dark sector approaches to cosmological tensions\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that such minimal models can naturally become relevant at two critical epochs in the history of the Universe; matter-radiation equality and the present day, generating an early dark energy-like energy injection, as motivated by the Hubble tension, and an apparent phantom crossing, as suggested by baryon acoustic oscillation data from the DESI project.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27514","kind":"claim","label":"Sample Complexity for the 2-Gromov-Wasserstein Distance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27514"]},"sources":[{"id":"source.frontier.arxiv-2607-27514","title":"arXiv OAI-PMH record arXiv:2607.27514: Sample Complexity for the 2-Gromov-Wasserstein Distance","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27514&metadataPrefix=arXiv"},{"id":"arxiv:2607.27514","title":"arXiv:2607.27514","url":"https://arxiv.org/abs/2607.27514"}],"status":"frontier","summary":"arXiv:2607.27514 \"Sample Complexity for the 2-Gromov-Wasserstein Distance\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that \\[ \\mathbb{E}\\left|D_2^2(\\widehatμ_n,\\widehatν_n)-D_2^2(μ,ν)\\right| \\lesssim n^{-2/((d_x\\wedge d_y)\\vee 4)} (\\log n)^{\\mathbf 1_{\\{d_x\\wedge d_y=4\\}}}. \\] This rate is sharp up to the logarithmic factor in the critical dimension.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27502","kind":"claim","label":"Entropic signatures of the single-impurity Kondo state","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27502"]},"sources":[{"id":"source.frontier.arxiv-2607-27502","title":"arXiv OAI-PMH record arXiv:2607.27502: Entropic signatures of the single-impurity Kondo state","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27502&metadataPrefix=arXiv"},{"id":"arxiv:2607.27502","title":"arXiv:2607.27502","url":"https://arxiv.org/abs/2607.27502"}],"status":"frontier","summary":"arXiv:2607.27502 \"Entropic signatures of the single-impurity Kondo state\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here we report a thermodynamic measurement of the entropy suppression associated with the formation of the Kondo singlet, using temperature-dependent charge sensing and a Maxwell relation to track the suppression of spin entropy as the first electron is added to a strongly-coupled GaAs quantum dot.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27403","kind":"claim","label":"Handling Missingness and Censoring in Dirichlet Mixture Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27403"]},"sources":[{"id":"source.frontier.arxiv-2607-27403","title":"arXiv OAI-PMH record arXiv:2607.27403: Handling Missingness and Censoring in Dirichlet Mixture Models","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27403&metadataPrefix=arXiv"},{"id":"arxiv:2607.27403","title":"arXiv:2607.27403","url":"https://arxiv.org/abs/2607.27403"}],"status":"frontier","summary":"arXiv:2607.27403 \"Handling Missingness and Censoring in Dirichlet Mixture Models\" (CC BY 4.0, submitted 2026-07-29) reports: \"The results showed beneficial clustering performance despite observations being incomplete, and a higher probability of model selection metrics identifying the correct number of clusters compared to current alternative of case-deletion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27391","kind":"claim","label":"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27391"]},"sources":[{"id":"source.frontier.arxiv-2607-27391","title":"arXiv OAI-PMH record arXiv:2607.27391: Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27391&metadataPrefix=arXiv"},{"id":"arxiv:2607.27391","title":"arXiv:2607.27391","url":"https://arxiv.org/abs/2607.27391"}],"status":"frontier","summary":"arXiv:2607.27391 \"Binary neutron star populations across cosmic time: the impact of binary stellar evolution uncertainties\" (CC BY 4.0, submitted 2026-07-29) reports: \"We identify characteristic features in the metallicity dependence of the BNS formation efficiency that arise from specific evolutionary processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27388","kind":"claim","label":"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27388"]},"sources":[{"id":"source.frontier.arxiv-2607-27388","title":"arXiv OAI-PMH record arXiv:2607.27388: Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27388&metadataPrefix=arXiv"},{"id":"arxiv:2607.27388","title":"arXiv:2607.27388","url":"https://arxiv.org/abs/2607.27388"}],"status":"frontier","summary":"arXiv:2607.27388 \"Area-Information Trade-Offs in Acceleration Radiation from Atoms Falling into Black Holes\" (CC BY 4.0, submitted 2026-07-29) reports: \"Building on the quantum-optical description of atom--field interactions near the horizon and the resulting HBAR thermodynamic correspondence, we derive area-cost laws in the near-steady, thermally saturated regime.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27362","kind":"claim","label":"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27362"]},"sources":[{"id":"source.frontier.arxiv-2607-27362","title":"arXiv OAI-PMH record arXiv:2607.27362: Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27362&metadataPrefix=arXiv"},{"id":"arxiv:2607.27362","title":"arXiv:2607.27362","url":"https://arxiv.org/abs/2607.27362"}],"status":"frontier","summary":"arXiv:2607.27362 \"Fresnel Drag in the Homogenization Limit with Space-Time-Modulated Wire Media\" (CC BY 4.0, submitted 2026-07-29) reports: \"Here, we show that modulating a metallic response overcomes this limitation and enables strong moving-medium-like effects using purely electric modulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27344","kind":"claim","label":"Inflation in unimodular loop quantum cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27344"]},"sources":[{"id":"source.frontier.arxiv-2607-27344","title":"arXiv OAI-PMH record arXiv:2607.27344: Inflation in unimodular loop quantum cosmology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27344&metadataPrefix=arXiv"},{"id":"arxiv:2607.27344","title":"arXiv:2607.27344","url":"https://arxiv.org/abs/2607.27344"}],"status":"frontier","summary":"arXiv:2607.27344 \"Inflation in unimodular loop quantum cosmology\" (CC BY 4.0, submitted 2026-07-29) reports: \"Then, focusing on semiclassical effective equations, we derive analytical solutions in simple cases such as a constant potential, emphasising the use of a unimodular time coordinate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27334","kind":"claim","label":"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27334"]},"sources":[{"id":"source.frontier.arxiv-2607-27334","title":"arXiv OAI-PMH record arXiv:2607.27334: Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27334&metadataPrefix=arXiv"},{"id":"arxiv:2607.27334","title":"arXiv:2607.27334","url":"https://arxiv.org/abs/2607.27334"}],"status":"frontier","summary":"arXiv:2607.27334 \"Precise predictions for double Higgs production in association with a vector boson in Effective Field Theory\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, for $W^\\pm hh$ production, QCD corrections largely factorise from the EFT dependence, leading to almost flat $K$-factors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27329","kind":"claim","label":"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27329"]},"sources":[{"id":"source.frontier.arxiv-2607-27329","title":"arXiv OAI-PMH record arXiv:2607.27329: An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27329&metadataPrefix=arXiv"},{"id":"arxiv:2607.27329","title":"arXiv:2607.27329","url":"https://arxiv.org/abs/2607.27329"}],"status":"frontier","summary":"arXiv:2607.27329 \"An Exploratory Analysis of New Large Gaia-informed Quasar Samples in SDSS-V\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our findings confirm that novel selection methods based on optical+IR colors and/or astrometry can yield a large, high-purity quasar sample over wide sky areas, including in cases where more nuanced multi-band photometry and/or multi-wavelength data in the X-ray or radio is not available.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27326","kind":"claim","label":"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27326"]},"sources":[{"id":"source.frontier.arxiv-2607-27326","title":"arXiv OAI-PMH record arXiv:2607.27326: Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27326&metadataPrefix=arXiv"},{"id":"arxiv:2607.27326","title":"arXiv:2607.27326","url":"https://arxiv.org/abs/2607.27326"}],"status":"frontier","summary":"arXiv:2607.27326 \"Semi-analytic Inference of Satellite Densities in the Cold Dark Matter Model Part II. Implications for Dark Matter Indirect Detection Constraints\" (CC BY 4.0, submitted 2026-07-29) reports: \"We also show that the highest-J-factor dwarfs are spatially extended, approximately one degree on the sky, which challenges the validity of the point-source approximation adopted in many analyses of Fermi data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27312","kind":"claim","label":"Non-linear Evolution of Dark Plasma Subhalos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27312"]},"sources":[{"id":"source.frontier.arxiv-2607-27312","title":"arXiv OAI-PMH record arXiv:2607.27312: Non-linear Evolution of Dark Plasma Subhalos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27312&metadataPrefix=arXiv"},{"id":"arxiv:2607.27312","title":"arXiv:2607.27312","url":"https://arxiv.org/abs/2607.27312"}],"status":"frontier","summary":"arXiv:2607.27312 \"Non-linear Evolution of Dark Plasma Subhalos\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the growth and saturation of these instabilities produce substantial turbulent heating and mass loss, with an efficiency that depends sensitively on subhalo mass and orbital eccentricity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27299","kind":"claim","label":"When trajectory-based bounds fail: information thermodynamics under noisy feedback","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27299"]},"sources":[{"id":"source.frontier.arxiv-2607-27299","title":"arXiv OAI-PMH record arXiv:2607.27299: When trajectory-based bounds fail: information thermodynamics under noisy feedback","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27299&metadataPrefix=arXiv"},{"id":"arxiv:2607.27299","title":"arXiv:2607.27299","url":"https://arxiv.org/abs/2607.27299"}],"status":"frontier","summary":"arXiv:2607.27299 \"When trajectory-based bounds fail: information thermodynamics under noisy feedback\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results reveal a general limitation of information-theoretic descriptions that rely on detailed trajectory statistics in realistic settings and provide a unified perspective on information thermodynamics beyond idealised feedback protocols.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27181","kind":"claim","label":"Reconfigurable Optical Platform for One-way Quantum Communication Complexity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27181"]},"sources":[{"id":"source.frontier.arxiv-2607-27181","title":"arXiv OAI-PMH record arXiv:2607.27181: Reconfigurable Optical Platform for One-way Quantum Communication Complexity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27181&metadataPrefix=arXiv"},{"id":"arxiv:2607.27181","title":"arXiv:2607.27181","url":"https://arxiv.org/abs/2607.27181"}],"status":"frontier","summary":"arXiv:2607.27181 \"Reconfigurable Optical Platform for One-way Quantum Communication Complexity\" (CC BY 4.0, submitted 2026-07-29) reports: \"Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27158","kind":"claim","label":"Outcomes of Grand Unified Symmetry Breaking","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27158"]},"sources":[{"id":"source.frontier.arxiv-2607-27158","title":"arXiv OAI-PMH record arXiv:2607.27158: Outcomes of Grand Unified Symmetry Breaking","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27158&metadataPrefix=arXiv"},{"id":"arxiv:2607.27158","title":"arXiv:2607.27158","url":"https://arxiv.org/abs/2607.27158"}],"status":"frontier","summary":"arXiv:2607.27158 \"Outcomes of Grand Unified Symmetry Breaking\" (CC BY 4.0, submitted 2026-07-29) reports: \"Our results show the formation of biased domain walls for a range of parameters together with magnetic monopoles.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27129","kind":"claim","label":"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27129"]},"sources":[{"id":"source.frontier.arxiv-2607-27129","title":"arXiv OAI-PMH record arXiv:2607.27129: Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27129&metadataPrefix=arXiv"},{"id":"arxiv:2607.27129","title":"arXiv:2607.27129","url":"https://arxiv.org/abs/2607.27129"}],"status":"frontier","summary":"arXiv:2607.27129 \"Quadrupolar tidal effects destroy the integrability of black hole geodesics: analytic proof and numerical evidence of chaos\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this work, we show that a non-spinning body endowed with a tidally induced quadrupole admits no deformation of the geodesic Carter constant that remains conserved, for generic tidal couplings and generic Kerr spin.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27105","kind":"claim","label":"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27105"]},"sources":[{"id":"source.frontier.arxiv-2607-27105","title":"arXiv OAI-PMH record arXiv:2607.27105: Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27105&metadataPrefix=arXiv"},{"id":"arxiv:2607.27105","title":"arXiv:2607.27105","url":"https://arxiv.org/abs/2607.27105"}],"status":"frontier","summary":"arXiv:2607.27105 \"Detecting seizure onset and offset times using human intelligence: A critical-transitions-based approach\" (CC BY 4.0, submitted 2026-07-29) reports: \"We demonstrate how performance depends on algorithm parameters and varies across different rodent recording sessions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27098","kind":"claim","label":"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27098"]},"sources":[{"id":"source.frontier.arxiv-2607-27098","title":"arXiv OAI-PMH record arXiv:2607.27098: Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27098&metadataPrefix=arXiv"},{"id":"arxiv:2607.27098","title":"arXiv:2607.27098","url":"https://arxiv.org/abs/2607.27098"}],"status":"frontier","summary":"arXiv:2607.27098 \"Combinatorial Bounds for Codes over Metric Spaces: Ramsey-Sidorenko Thresholds and Subgraph Counts\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish density thresholds for various graph families and utilize the Karush--Kuhn--Tucker conditions to analyze entropy optimization in the Hamming case.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27062","kind":"claim","label":"PIKS: Universal Physics-Informed Kernel Methods","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27062"]},"sources":[{"id":"source.frontier.arxiv-2607-27062","title":"arXiv OAI-PMH record arXiv:2607.27062: PIKS: Universal Physics-Informed Kernel Methods","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27062&metadataPrefix=arXiv"},{"id":"arxiv:2607.27062","title":"arXiv:2607.27062","url":"https://arxiv.org/abs/2607.27062"}],"status":"frontier","summary":"arXiv:2607.27062 \"PIKS: Universal Physics-Informed Kernel Methods\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the universal consistency of PIKS for linear differential constraints, proving that for universal kernels (such as Gaussian or Matérn), the estimator asymptotically learns the target while satisfying physical constraints.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27038","kind":"claim","label":"Irreducible non-holonomic modules for rational Cherednik algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27038"]},"sources":[{"id":"source.frontier.arxiv-2607-27038","title":"arXiv OAI-PMH record arXiv:2607.27038: Irreducible non-holonomic modules for rational Cherednik algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27038&metadataPrefix=arXiv"},{"id":"arxiv:2607.27038","title":"arXiv:2607.27038","url":"https://arxiv.org/abs/2607.27038"}],"status":"frontier","summary":"arXiv:2607.27038 \"Irreducible non-holonomic modules for rational Cherednik algebras\" (CC BY 4.0, submitted 2026-07-29) reports: \"In an appendix, following a proof kindly shared by O. Mathieu, we show that $A_n(\\mathbb{K})$ has irreducible modules of every Gelfand-Kirillov dimension in the interval $[n, 2n-1]$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-27037","kind":"claim","label":"SNT-Rank: Kronecker Products and Euclidean Distance Matrices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-27037"]},"sources":[{"id":"source.frontier.arxiv-2607-27037","title":"arXiv OAI-PMH record arXiv:2607.27037: SNT-Rank: Kronecker Products and Euclidean Distance Matrices","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.27037&metadataPrefix=arXiv"},{"id":"arxiv:2607.27037","title":"arXiv:2607.27037","url":"https://arxiv.org/abs/2607.27037"}],"status":"frontier","summary":"arXiv:2607.27037 \"SNT-Rank: Kronecker Products and Euclidean Distance Matrices\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper, we derive sharper upper bounds for the SNT-rank of the Euclidean distance matrices considered by Shitov [Linear Algebra Appl. 2025] and Bukovšek-Šmigoc [Linear Algebra Appl. 2023].\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26966","kind":"claim","label":"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26966"]},"sources":[{"id":"source.frontier.arxiv-2607-26966","title":"arXiv OAI-PMH record arXiv:2607.26966: Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26966&metadataPrefix=arXiv"},{"id":"arxiv:2607.26966","title":"arXiv:2607.26966","url":"https://arxiv.org/abs/2607.26966"},{"id":"doi:10.3847/1538-4357/ad701f","title":"doi:10.3847/1538-4357/ad701f","url":"https://doi.org/10.3847/1538-4357/ad701f"}],"status":"frontier","summary":"arXiv:2607.26966 \"Constraints from parallaxes and average period spacings in the asteroseismic study of 8 DAVs\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that the majority of the white dwarfs have thicker hydrogen layers and determine an upper limit of Mr = 1 - 10 to the -2.2 for the location of the base of the helium layer, in accordance with stellar evolution models.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26932","kind":"claim","label":"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26932"]},"sources":[{"id":"source.frontier.arxiv-2607-26932","title":"arXiv OAI-PMH record arXiv:2607.26932: J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26932&metadataPrefix=arXiv"},{"id":"arxiv:2607.26932","title":"arXiv:2607.26932","url":"https://arxiv.org/abs/2607.26932"}],"status":"frontier","summary":"arXiv:2607.26932 \"J-PAS & FLAMINGO: Cosmic voids and void galaxies in the gravitational landscape of photometric surveys\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results suggest a quasi-potential can mitigate redshift errors at the level expected for J-PAS, enabling identification of reliable, dynamically dominant voids that are less sensitive to small-scale noise.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26890","kind":"claim","label":"The Lie algebra generated by gradient vector fields","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26890"]},"sources":[{"id":"source.frontier.arxiv-2607-26890","title":"arXiv OAI-PMH record arXiv:2607.26890: The Lie algebra generated by gradient vector fields","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26890&metadataPrefix=arXiv"},{"id":"arxiv:2607.26890","title":"arXiv:2607.26890","url":"https://arxiv.org/abs/2607.26890"}],"status":"frontier","summary":"arXiv:2607.26890 \"The Lie algebra generated by gradient vector fields\" (CC BY 4.0, submitted 2026-07-29) reports: \"We prove that every smooth vector field can be written as a finite linear combination of iterated Lie brackets of gradient vector fields.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26800","kind":"claim","label":"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26800"]},"sources":[{"id":"source.frontier.arxiv-2607-26800","title":"arXiv OAI-PMH record arXiv:2607.26800: Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26800&metadataPrefix=arXiv"},{"id":"arxiv:2607.26800","title":"arXiv:2607.26800","url":"https://arxiv.org/abs/2607.26800"}],"status":"frontier","summary":"arXiv:2607.26800 \"Structure of multi-$Λ$ hypernuclei with a Skyrme-type $ΛΛ$ interaction constrained by data on double-$Λ$ hypernuclei and neutron stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"These results indicate that the multi-$Λ$ hypernuclei are particularly useful for isolating the role of $p$-wave $ΛΛ$ interacion around the normal density, whereas the density-dependent term is expected to be more important interaction in the high-density domain relevant to neutron stars.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26782","kind":"claim","label":"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26782"]},"sources":[{"id":"source.frontier.arxiv-2607-26782","title":"arXiv OAI-PMH record arXiv:2607.26782: Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26782&metadataPrefix=arXiv"},{"id":"arxiv:2607.26782","title":"arXiv:2607.26782","url":"https://arxiv.org/abs/2607.26782"}],"status":"frontier","summary":"arXiv:2607.26782 \"Nonlinear Stability and Instability of Finite-Energy Solutions of the Compressible Euler-Riesz Equations with General Pressure Laws\" (CC BY 4.0, submitted 2026-07-29) reports: \"In the polytropic case, we establish the nonlinear instability of steady states in the mass-supercritical regime for attractive potentials; this is achieved by analyzing the concavity of the free energy along mass-preserving dilations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26677","kind":"claim","label":"A Harmonic-Map Proof of Mostow Rigidity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26677"]},"sources":[{"id":"source.frontier.arxiv-2607-26677","title":"arXiv OAI-PMH record arXiv:2607.26677: A Harmonic-Map Proof of Mostow Rigidity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26677&metadataPrefix=arXiv"},{"id":"arxiv:2607.26677","title":"arXiv:2607.26677","url":"https://arxiv.org/abs/2607.26677"}],"status":"frontier","summary":"arXiv:2607.26677 \"A Harmonic-Map Proof of Mostow Rigidity\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish a sharp pointwise gradient estimate for this lift.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26653","kind":"claim","label":"A new construction of the Riemannian deformation sequence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26653"]},"sources":[{"id":"source.frontier.arxiv-2607-26653","title":"arXiv OAI-PMH record arXiv:2607.26653: A new construction of the Riemannian deformation sequence","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26653&metadataPrefix=arXiv"},{"id":"arxiv:2607.26653","title":"arXiv:2607.26653","url":"https://arxiv.org/abs/2607.26653"}],"status":"frontier","summary":"arXiv:2607.26653 \"A new construction of the Riemannian deformation sequence\" (CC BY 4.0, submitted 2026-07-29) reports: \"We obtain a new construction of a sequence of invariant differential operators on a Riemannian manifold $(M,g)$ that governs the linearized deformation theory of $g$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26508","kind":"claim","label":"An association measure for mixed-type variables","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26508"]},"sources":[{"id":"source.frontier.arxiv-2607-26508","title":"arXiv OAI-PMH record arXiv:2607.26508: An association measure for mixed-type variables","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26508&metadataPrefix=arXiv"},{"id":"arxiv:2607.26508","title":"arXiv:2607.26508","url":"https://arxiv.org/abs/2607.26508"}],"status":"frontier","summary":"arXiv:2607.26508 \"An association measure for mixed-type variables\" (CC BY 4.0, submitted 2026-07-29) reports: \"We establish the strong consistency and asymptotic normality of the estimator $ξ_n'$, enabling a computationally efficient, permutation-free Wald test for independence, and an asymptotic confidence interval for the population measure $ξ'$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26484","kind":"claim","label":"d-Spectral Bitopological Spaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26484"]},"sources":[{"id":"source.frontier.arxiv-2607-26484","title":"arXiv OAI-PMH record arXiv:2607.26484: d-Spectral Bitopological Spaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26484&metadataPrefix=arXiv"},{"id":"arxiv:2607.26484","title":"arXiv:2607.26484","url":"https://arxiv.org/abs/2607.26484"}],"status":"frontier","summary":"arXiv:2607.26484 \"d-Spectral Bitopological Spaces\" (CC BY 4.0, submitted 2026-07-29) reports: \"We show that the category of spectral spaces embeds into the category of d-spectral spaces as a simultaneously reflective and coreflective full subcategory.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26433","kind":"claim","label":"Nonlinear quantum Fokker-Planck equation near equilibrium","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26433"]},"sources":[{"id":"source.frontier.arxiv-2607-26433","title":"arXiv OAI-PMH record arXiv:2607.26433: Nonlinear quantum Fokker-Planck equation near equilibrium","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26433&metadataPrefix=arXiv"},{"id":"arxiv:2607.26433","title":"arXiv:2607.26433","url":"https://arxiv.org/abs/2607.26433"}],"status":"frontier","summary":"arXiv:2607.26433 \"Nonlinear quantum Fokker-Planck equation near equilibrium\" (CC BY 4.0, submitted 2026-07-29) reports: \"For the Cauchy problem in the three-dimensional whole space, we prove the global-in-time existence and uniqueness of strong solutions near a global quantum equilibrium.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26408","kind":"claim","label":"Phase control of multi-photon electron-positron pair creation from vacuum","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26408"]},"sources":[{"id":"source.frontier.arxiv-2607-26408","title":"arXiv OAI-PMH record arXiv:2607.26408: Phase control of multi-photon electron-positron pair creation from vacuum","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26408&metadataPrefix=arXiv"},{"id":"arxiv:2607.26408","title":"arXiv:2607.26408","url":"https://arxiv.org/abs/2607.26408"}],"status":"frontier","summary":"arXiv:2607.26408 \"Phase control of multi-photon electron-positron pair creation from vacuum\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find that, when the two fields are closely spaced, the pair yield exhibits a cosine-like dependence on the relative phase.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26378","kind":"claim","label":"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26378"]},"sources":[{"id":"source.frontier.arxiv-2607-26378","title":"arXiv OAI-PMH record arXiv:2607.26378: Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26378&metadataPrefix=arXiv"},{"id":"arxiv:2607.26378","title":"arXiv:2607.26378","url":"https://arxiv.org/abs/2607.26378"}],"status":"frontier","summary":"arXiv:2607.26378 \"Essential Simplices Dominate in Harmonic Representatives of One-Dimensional Persistent Classes\" (CC BY 4.0, submitted 2026-07-29) reports: \"In this paper we prove that, for generic one-dimensional bars, this preference is stronger than an aggregate maximization statement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26374","kind":"claim","label":"Charged Dirac stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-29","source_ids":["source.frontier.arxiv-2607-26374"]},"sources":[{"id":"source.frontier.arxiv-2607-26374","title":"arXiv OAI-PMH record arXiv:2607.26374: Charged Dirac stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26374&metadataPrefix=arXiv"},{"id":"arxiv:2607.26374","title":"arXiv:2607.26374","url":"https://arxiv.org/abs/2607.26374"}],"status":"frontier","summary":"arXiv:2607.26374 \"Charged Dirac stars\" (CC BY 4.0, submitted 2026-07-29) reports: \"We find different families of stationary self-gravitating solutions for the Dirac field through a numerical shooting method for different values of the electric charge parameter q. Furthermore, we investigate the effect of the charge q on the binding energy, mass, radius, and compactness of the solutions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26289","kind":"claim","label":"Scale-dependent universality class crossover in magnetic skyrmion polymers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26289"]},"sources":[{"id":"source.frontier.arxiv-2607-26289","title":"arXiv OAI-PMH record arXiv:2607.26289: Scale-dependent universality class crossover in magnetic skyrmion polymers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26289&metadataPrefix=arXiv"},{"id":"arxiv:2607.26289","title":"arXiv:2607.26289","url":"https://arxiv.org/abs/2607.26289"}],"status":"frontier","summary":"arXiv:2607.26289 \"Scale-dependent universality class crossover in magnetic skyrmion polymers\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the power-law behavior is remarkably independent of magnetic field strength, and the crossover is due to competing radial interactions responsible for the bonds, resulting in a quartic transverse confinement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26287","kind":"claim","label":"Studying Competing Events with Federated Cumulative Incidence Curves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26287"]},"sources":[{"id":"source.frontier.arxiv-2607-26287","title":"arXiv OAI-PMH record arXiv:2607.26287: Studying Competing Events with Federated Cumulative Incidence Curves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26287&metadataPrefix=arXiv"},{"id":"arxiv:2607.26287","title":"arXiv:2607.26287","url":"https://arxiv.org/abs/2607.26287"}],"status":"frontier","summary":"arXiv:2607.26287 \"Studying Competing Events with Federated Cumulative Incidence Curves\" (CC BY 4.0, submitted 2026-07-28) reports: \"After covariate adjustment, we found that patients with a pre-existing non-endocrine AID lost 4.8 [95% CI: 4.3,5.2] months of event-free survival time to endocrine irAEs in the first 18 months following treatment, compared to 3.2 [95% CI: 3.1,3.3] months in the group without prior AID.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26281","kind":"claim","label":"Concise $(\\varepsilon,r)$-representations of a path","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26281"]},"sources":[{"id":"source.frontier.arxiv-2607-26281","title":"arXiv OAI-PMH record arXiv:2607.26281: Concise $(\\varepsilon,r)$-representations of a path","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26281&metadataPrefix=arXiv"},{"id":"arxiv:2607.26281","title":"arXiv:2607.26281","url":"https://arxiv.org/abs/2607.26281"}],"status":"frontier","summary":"arXiv:2607.26281 \"Concise $(\\varepsilon,r)$-representations of a path\" (CC BY 4.0, submitted 2026-07-28) reports: \"We include an empirical study of the optimisation problem, which we demonstrate for toy examples of $p$-rough paths and for fractional Brownian motion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26205","kind":"claim","label":"Binary disruptions driven by massive disks around massive black holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26205"]},"sources":[{"id":"source.frontier.arxiv-2607-26205","title":"arXiv OAI-PMH record arXiv:2607.26205: Binary disruptions driven by massive disks around massive black holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26205&metadataPrefix=arXiv"},{"id":"arxiv:2607.26205","title":"arXiv:2607.26205","url":"https://arxiv.org/abs/2607.26205"}],"status":"frontier","summary":"arXiv:2607.26205 \"Binary disruptions driven by massive disks around massive black holes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive semi-analytical estimates, validated with numerical simulations, of the number of binary disruptions driven by a generic disk in a generic nucleus.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26193","kind":"claim","label":"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26193"]},"sources":[{"id":"source.frontier.arxiv-2607-26193","title":"arXiv OAI-PMH record arXiv:2607.26193: Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26193&metadataPrefix=arXiv"},{"id":"arxiv:2607.26193","title":"arXiv:2607.26193","url":"https://arxiv.org/abs/2607.26193"}],"status":"frontier","summary":"arXiv:2607.26193 \"Cosmology beyond standard sirens: cross-correlation of gravitational waves and neutral hydrogen intensity mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that the cross-correlation method, by naturally mitigating tracer-specific systematics, yields robust cosmological bounds, allowing for a sub-percent ($\\sim 0.5\\%$) precision on the Hubble constant $H_\\mathrm{0}$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26180","kind":"claim","label":"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26180"]},"sources":[{"id":"source.frontier.arxiv-2607-26180","title":"arXiv OAI-PMH record arXiv:2607.26180: Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26180&metadataPrefix=arXiv"},{"id":"arxiv:2607.26180","title":"arXiv:2607.26180","url":"https://arxiv.org/abs/2607.26180"}],"status":"frontier","summary":"arXiv:2607.26180 \"Radio Recombination Line Contamination in Post-Reionization 21 cm Intensity Mapping\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find the RRL contamination is highly oscillatory in wavenumber, owing to the dominant contamination from RRLs emitted close in physical space to the 21 cm emission.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26177","kind":"claim","label":"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26177"]},"sources":[{"id":"source.frontier.arxiv-2607-26177","title":"arXiv OAI-PMH record arXiv:2607.26177: How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26177&metadataPrefix=arXiv"},{"id":"arxiv:2607.26177","title":"arXiv:2607.26177","url":"https://arxiv.org/abs/2607.26177"}],"status":"frontier","summary":"arXiv:2607.26177 \"How to raise a supermassive black hole: interpreting early JWST AGN with the AESOPICA simulations\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that the bulk of the JWST AGN population can be assembled from any seed mass provided the accretion efficiency is high, although light seeds require the most favourable accretion conditions explored.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26151","kind":"claim","label":"Quantum spin-glass criticality in disordered frustrated dimer magnets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26151"]},"sources":[{"id":"source.frontier.arxiv-2607-26151","title":"arXiv OAI-PMH record arXiv:2607.26151: Quantum spin-glass criticality in disordered frustrated dimer magnets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26151&metadataPrefix=arXiv"},{"id":"arxiv:2607.26151","title":"arXiv:2607.26151","url":"https://arxiv.org/abs/2607.26151"}],"status":"frontier","summary":"arXiv:2607.26151 \"Quantum spin-glass criticality in disordered frustrated dimer magnets\" (CC BY 4.0, submitted 2026-07-28) reports: \"We characterize the low-energy excitations which have a strong tendency towards spatial localization, and we track the behavior of the amplitude (i.e. Higgs) mode across the glass phase whose spectral weight we find to be strongly suppressed due to interference effects.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26147","kind":"claim","label":"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26147"]},"sources":[{"id":"source.frontier.arxiv-2607-26147","title":"arXiv OAI-PMH record arXiv:2607.26147: The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26147&metadataPrefix=arXiv"},{"id":"arxiv:2607.26147","title":"arXiv:2607.26147","url":"https://arxiv.org/abs/2607.26147"}],"status":"frontier","summary":"arXiv:2607.26147 \"The Stellar Winds Atlas II: Black Hole Formation at Solar Metallicity\" (CC BY 4.0, submitted 2026-07-28) reports: \"By evaluating stellar evolution across this extensive grid, we show that the final BH mass is dictated by a fundamental bifurcation: whether a star collapses as a cool supergiant or is first stripped of its envelope to become a Wolf-Rayet (WR) star.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26141","kind":"claim","label":"Light propagation and intensity transport in metric-affine geometry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26141"]},"sources":[{"id":"source.frontier.arxiv-2607-26141","title":"arXiv OAI-PMH record arXiv:2607.26141: Light propagation and intensity transport in metric-affine geometry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26141&metadataPrefix=arXiv"},{"id":"arxiv:2607.26141","title":"arXiv:2607.26141","url":"https://arxiv.org/abs/2607.26141"}],"status":"frontier","summary":"arXiv:2607.26141 \"Light propagation and intensity transport in metric-affine geometry\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive their geometric--optics limits and show that their couplings can modify the effective light cone, change the relation between field amplitude and intensity, induce polarization-dependent propagation, and generate birefringence and mode mixing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26103","kind":"claim","label":"A rigid spherical shell enclosing a degenerate wormhole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26103"]},"sources":[{"id":"source.frontier.arxiv-2607-26103","title":"arXiv OAI-PMH record arXiv:2607.26103: A rigid spherical shell enclosing a degenerate wormhole","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26103&metadataPrefix=arXiv"},{"id":"arxiv:2607.26103","title":"arXiv:2607.26103","url":"https://arxiv.org/abs/2607.26103"}],"status":"frontier","summary":"arXiv:2607.26103 \"A rigid spherical shell enclosing a degenerate wormhole\" (CC BY 4.0, submitted 2026-07-28) reports: \"It is shown that replacing the flat interior by a degenerate vacuum wormhole changes the junction conditions in such a way that the proper mass of the shell vanishes, whereas the ADM mass and the exterior Schwarzschild geometry remain unchanged.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26030","kind":"claim","label":"Soft-mode nonlinearities away from ferroelectric phase transition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26030"]},"sources":[{"id":"source.frontier.arxiv-2607-26030","title":"arXiv OAI-PMH record arXiv:2607.26030: Soft-mode nonlinearities away from ferroelectric phase transition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26030&metadataPrefix=arXiv"},{"id":"arxiv:2607.26030","title":"arXiv:2607.26030","url":"https://arxiv.org/abs/2607.26030"}],"status":"frontier","summary":"arXiv:2607.26030 \"Soft-mode nonlinearities away from ferroelectric phase transition\" (CC BY 4.0, submitted 2026-07-28) reports: \"Our findings highlight that while local fields are necessary to initiate non-perturbative lattice dynamics, they are insufficient on their own.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25977","kind":"claim","label":"The Internal Modal Logic of Forcing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25977"]},"sources":[{"id":"source.frontier.arxiv-2607-25977","title":"arXiv OAI-PMH record arXiv:2607.25977: The Internal Modal Logic of Forcing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25977&metadataPrefix=arXiv"},{"id":"arxiv:2607.25977","title":"arXiv:2607.25977","url":"https://arxiv.org/abs/2607.25977"}],"status":"frontier","summary":"arXiv:2607.25977 \"The Internal Modal Logic of Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"Finally, adopting a translation-based semantics on the nonzero part $B^+=B\\setminus\\{0\\}$, we prove a soundness-and-completeness theorem: the normal logic $\\KTB$ is exactly the set of modal formulas valid in all translated co-consistency models with parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25960","kind":"claim","label":"Quantum Steenrod powers and Hamiltonian maps","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25960"]},"sources":[{"id":"source.frontier.arxiv-2607-25960","title":"arXiv OAI-PMH record arXiv:2607.25960: Quantum Steenrod powers and Hamiltonian maps","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25960&metadataPrefix=arXiv"},{"id":"arxiv:2607.25960","title":"arXiv:2607.25960","url":"https://arxiv.org/abs/2607.25960"}],"status":"frontier","summary":"arXiv:2607.25960 \"Quantum Steenrod powers and Hamiltonian maps\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a series of new results in Hamiltonian dynamics on a general closed symplectic manifold $(M, ω)$, including: 1.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25950","kind":"claim","label":"Weak-form Extended Dynamic Mode Decomposition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25950"]},"sources":[{"id":"source.frontier.arxiv-2607-25950","title":"arXiv OAI-PMH record arXiv:2607.25950: Weak-form Extended Dynamic Mode Decomposition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25950&metadataPrefix=arXiv"},{"id":"arxiv:2607.25950","title":"arXiv:2607.25950","url":"https://arxiv.org/abs/2607.25950"}],"status":"frontier","summary":"arXiv:2607.25950 \"Weak-form Extended Dynamic Mode Decomposition\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a number of analytic results about the method and show explicitly how the weak form is able to mitigate the impacts of noise in linear stochastic differential equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25910","kind":"claim","label":"$d$-Translated Unit Sensitive Primes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25910"]},"sources":[{"id":"source.frontier.arxiv-2607-25910","title":"arXiv OAI-PMH record arXiv:2607.25910: $d$-Translated Unit Sensitive Primes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25910&metadataPrefix=arXiv"},{"id":"arxiv:2607.25910","title":"arXiv:2607.25910","url":"https://arxiv.org/abs/2607.25910"}],"status":"frontier","summary":"arXiv:2607.25910 \"$d$-Translated Unit Sensitive Primes\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find an arithmetic progression of nonnegative integers that are $d$-translated unit sensitive for any nonnegative integer $d$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25865","kind":"claim","label":"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25865"]},"sources":[{"id":"source.frontier.arxiv-2607-25865","title":"arXiv OAI-PMH record arXiv:2607.25865: OmniQEC: discovering practical quantum error-correcting codes by an AI scientist","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25865&metadataPrefix=arXiv"},{"id":"arxiv:2607.25865","title":"arXiv:2607.25865","url":"https://arxiv.org/abs/2607.25865"}],"status":"frontier","summary":"arXiv:2607.25865 \"OmniQEC: discovering practical quantum error-correcting codes by an AI scientist\" (CC BY 4.0, submitted 2026-07-28) reports: \"The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\\![72,12,6]\\!]$ and $[\\![144,12,12]\\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25772","kind":"claim","label":"Contact Surgery Numbers of the 3-torus","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25772"]},"sources":[{"id":"source.frontier.arxiv-2607-25772","title":"arXiv OAI-PMH record arXiv:2607.25772: Contact Surgery Numbers of the 3-torus","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25772&metadataPrefix=arXiv"},{"id":"arxiv:2607.25772","title":"arXiv:2607.25772","url":"https://arxiv.org/abs/2607.25772"}],"status":"frontier","summary":"arXiv:2607.25772 \"Contact Surgery Numbers of the 3-torus\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show that all contact structures obtained via contact surgery along a Legendrian Borromean ring are overtwisted, and that this construction yields infinitely many pairwise non-contactomorphic contact structures on $\\mathbb{T}^3$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25743","kind":"claim","label":"Physical Mechanism of Vacuole Formation in Liquid Droplets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25743"]},"sources":[{"id":"source.frontier.arxiv-2607-25743","title":"arXiv OAI-PMH record arXiv:2607.25743: Physical Mechanism of Vacuole Formation in Liquid Droplets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25743&metadataPrefix=arXiv"},{"id":"arxiv:2607.25743","title":"arXiv:2607.25743","url":"https://arxiv.org/abs/2607.25743"}],"status":"frontier","summary":"arXiv:2607.25743 \"Physical Mechanism of Vacuole Formation in Liquid Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using theory, we show that vacuoles form through a generic mechanism: a local spinodal instability within the droplet.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25706","kind":"claim","label":"Categories of tagged lenses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25706"]},"sources":[{"id":"source.frontier.arxiv-2607-25706","title":"arXiv OAI-PMH record arXiv:2607.25706: Categories of tagged lenses","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25706&metadataPrefix=arXiv"},{"id":"arxiv:2607.25706","title":"arXiv:2607.25706","url":"https://arxiv.org/abs/2607.25706"}],"status":"frontier","summary":"arXiv:2607.25706 \"Categories of tagged lenses\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that tagged lenses form a strict symmetric monoidal category equipped with a strict symmetric monoidal functor into the category of putget lenses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25678","kind":"claim","label":"Engineering a Quantum Thermal Diode with Floquet Driving","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25678"]},"sources":[{"id":"source.frontier.arxiv-2607-25678","title":"arXiv OAI-PMH record arXiv:2607.25678: Engineering a Quantum Thermal Diode with Floquet Driving","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25678&metadataPrefix=arXiv"},{"id":"arxiv:2607.25678","title":"arXiv:2607.25678","url":"https://arxiv.org/abs/2607.25678"}],"status":"frontier","summary":"arXiv:2607.25678 \"Engineering a Quantum Thermal Diode with Floquet Driving\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25644","kind":"claim","label":"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25644"]},"sources":[{"id":"source.frontier.arxiv-2607-25644","title":"arXiv OAI-PMH record arXiv:2607.25644: Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25644&metadataPrefix=arXiv"},{"id":"arxiv:2607.25644","title":"arXiv:2607.25644","url":"https://arxiv.org/abs/2607.25644"}],"status":"frontier","summary":"arXiv:2607.25644 \"Gromov-Hausdorff Limits of Noncollapsed Kähler-Ricci Flows and the Geometry of Ricci Shrinkers\" (CC0 1.0, submitted 2026-07-28) reports: \"For a compact volume-noncollapsed Kähler-Ricci flow approaching its first singular time, we prove that the time slices converge to a unique Gromov-Hausdorff limit, canonically identified with the time-zero slice of the Ricci-flow spacetime completion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25625","kind":"claim","label":"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25625"]},"sources":[{"id":"source.frontier.arxiv-2607-25625","title":"arXiv OAI-PMH record arXiv:2607.25625: Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25625&metadataPrefix=arXiv"},{"id":"arxiv:2607.25625","title":"arXiv:2607.25625","url":"https://arxiv.org/abs/2607.25625"}],"status":"frontier","summary":"arXiv:2607.25625 \"Entanglement asymmetry in the gapped XYZ spin-$\\frac12$ chain\" (CC BY 4.0, submitted 2026-07-28) reports: \"A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25621","kind":"claim","label":"A Lusin theorem for nonlocal gradients","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25621"]},"sources":[{"id":"source.frontier.arxiv-2607-25621","title":"arXiv OAI-PMH record arXiv:2607.25621: A Lusin theorem for nonlocal gradients","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25621&metadataPrefix=arXiv"},{"id":"arxiv:2607.25621","title":"arXiv:2607.25621","url":"https://arxiv.org/abs/2607.25621"}],"status":"frontier","summary":"arXiv:2607.25621 \"A Lusin theorem for nonlocal gradients\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that a similar statement holds true in the setting of fractional gradients and $C^{0,s}-functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25610","kind":"claim","label":"Brjuno condition through best approximations and the linearization problem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25610"]},"sources":[{"id":"source.frontier.arxiv-2607-25610","title":"arXiv OAI-PMH record arXiv:2607.25610: Brjuno condition through best approximations and the linearization problem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25610&metadataPrefix=arXiv"},{"id":"arxiv:2607.25610","title":"arXiv:2607.25610","url":"https://arxiv.org/abs/2607.25610"}],"status":"frontier","summary":"arXiv:2607.25610 \"Brjuno condition through best approximations and the linearization problem\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that it is equivalent to several classical formulations of the Brjuno condition for linear forms, including those involving best approximation vectors and switching times of the diagonal flow.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25559","kind":"claim","label":"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25559"]},"sources":[{"id":"source.frontier.arxiv-2607-25559","title":"arXiv OAI-PMH record arXiv:2607.25559: Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25559&metadataPrefix=arXiv"},{"id":"arxiv:2607.25559","title":"arXiv:2607.25559","url":"https://arxiv.org/abs/2607.25559"}],"status":"frontier","summary":"arXiv:2607.25559 \"Lipid-Mediated Control of Thermally Induced Shape Transformations in Liquid Crystal Droplets\" (CC BY 4.0, submitted 2026-07-28) reports: \"Using polarized optical microscopy, we show that the internal monoolein concentration and the external lipid environment jointly regulate phase transitions, thin filamentation, and larger deformations during heating.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25473","kind":"claim","label":"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25473"]},"sources":[{"id":"source.frontier.arxiv-2607-25473","title":"arXiv OAI-PMH record arXiv:2607.25473: Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25473&metadataPrefix=arXiv"},{"id":"arxiv:2607.25473","title":"arXiv:2607.25473","url":"https://arxiv.org/abs/2607.25473"}],"status":"frontier","summary":"arXiv:2607.25473 \"Photon Gas Thermodynamics in Doubly Special Relativity at the Planck Scale\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the logarithmic grand partition function, and the complete set of thermodynamic quantities for the photon gas, including the Helmholtz free energy, internal energy, entropy, pressure, and heat capacity, and perform their numerical evaluation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25460","kind":"claim","label":"Initial algebras from constructive ordinals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25460"]},"sources":[{"id":"source.frontier.arxiv-2607-25460","title":"arXiv OAI-PMH record arXiv:2607.25460: Initial algebras from constructive ordinals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25460&metadataPrefix=arXiv"},{"id":"arxiv:2607.25460","title":"arXiv:2607.25460","url":"https://arxiv.org/abs/2607.25460"}],"status":"frontier","summary":"arXiv:2607.25460 \"Initial algebras from constructive ordinals\" (CC BY 4.0, submitted 2026-07-28) reports: \"We show how a standard constructive notion of ordinal supports a useful constructive theory of transfinite recursion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25394","kind":"claim","label":"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25394"]},"sources":[{"id":"source.frontier.arxiv-2607-25394","title":"arXiv OAI-PMH record arXiv:2607.25394: Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25394&metadataPrefix=arXiv"},{"id":"arxiv:2607.25394","title":"arXiv:2607.25394","url":"https://arxiv.org/abs/2607.25394"}],"status":"frontier","summary":"arXiv:2607.25394 \"Observation of biased random-flux-induced topological phase transition in gyromagnetic photonic crystals\" (CC BY 4.0, submitted 2026-07-28) reports: \"Here, we report the first experimental realization of topological phase transitions driven by biased random-flux in gyromagnetic photonic crystals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25341","kind":"claim","label":"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25341"]},"sources":[{"id":"source.frontier.arxiv-2607-25341","title":"arXiv OAI-PMH record arXiv:2607.25341: Remote entanglement of massive oscillators via wire-mediated Coulomb interaction","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25341&metadataPrefix=arXiv"},{"id":"arxiv:2607.25341","title":"arXiv:2607.25341","url":"https://arxiv.org/abs/2607.25341"}],"status":"frontier","summary":"arXiv:2607.25341 \"Remote entanglement of massive oscillators via wire-mediated Coulomb interaction\" (CC BY 4.0, submitted 2026-07-28) reports: \"We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25252","kind":"claim","label":"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25252"]},"sources":[{"id":"source.frontier.arxiv-2607-25252","title":"arXiv OAI-PMH record arXiv:2607.25252: Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25252&metadataPrefix=arXiv"},{"id":"arxiv:2607.25252","title":"arXiv:2607.25252","url":"https://arxiv.org/abs/2607.25252"}],"status":"frontier","summary":"arXiv:2607.25252 \"Proximal Gradient Methods for Unconstrained Set Optimization Problems with Set-Valued Maps of Finite Cardinality\" (CC BY 4.0, submitted 2026-07-28) reports: \"Thereafter, we establish a stationarity condition along with its connection with weakly minimal points of the problem under study.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25226","kind":"claim","label":"The quantum electrodynamics for dyons","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25226"]},"sources":[{"id":"source.frontier.arxiv-2607-25226","title":"arXiv OAI-PMH record arXiv:2607.25226: The quantum electrodynamics for dyons","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25226&metadataPrefix=arXiv"},{"id":"arxiv:2607.25226","title":"arXiv:2607.25226","url":"https://arxiv.org/abs/2607.25226"}],"status":"frontier","summary":"arXiv:2607.25226 \"The quantum electrodynamics for dyons\" (CC0 1.0, submitted 2026-07-28) reports: \"The quantum electrodynamics for massive fermions carrying electric and magnetic charges, the dyons, is proposed based on the 1960's seminal works by Cabibbo, Ferrari, and Salam, with the gauge group being $U(1)\\times U(1)$, which is associated to a vector field (photon) and a pseudo-vector field (metaphoton), wherein the Dirac quantization is set aside.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21883","kind":"claim","label":"Explicit bounds for Buchstab's function","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-21883"]},"sources":[{"id":"source.frontier.arxiv-2607-21883","title":"arXiv OAI-PMH record arXiv:2607.21883: Explicit bounds for Buchstab's function","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21883&metadataPrefix=arXiv"},{"id":"arxiv:2607.21883","title":"arXiv:2607.21883","url":"https://arxiv.org/abs/2607.21883"}],"status":"frontier","summary":"arXiv:2607.21883 \"Explicit bounds for Buchstab's function\" (CC BY 4.0, submitted 2026-07-28) reports: \"We establish numerically explicit upper and lower bounds for $ω(u)$ that are easy to evaluate, without the need to solve the delay differential equation numerically.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18525","kind":"claim","label":"Regular Ultrametric Skeletons","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-18525"]},"sources":[{"id":"source.frontier.arxiv-2607-18525","title":"arXiv OAI-PMH record arXiv:2607.18525: Regular Ultrametric Skeletons","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18525&metadataPrefix=arXiv"},{"id":"arxiv:2607.18525","title":"arXiv:2607.18525","url":"https://arxiv.org/abs/2607.18525"}],"status":"frontier","summary":"arXiv:2607.18525 \"Regular Ultrametric Skeletons\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove a two-sided version for arbitrary compact metric spaces: for every ball centered on the skeleton, the skeleton measure also has a lower bound in terms of the original measure on a smaller nonconcentric ball contained in it.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-13775","kind":"claim","label":"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-13775"]},"sources":[{"id":"source.frontier.arxiv-2607-13775","title":"arXiv OAI-PMH record arXiv:2607.13775: A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13775&metadataPrefix=arXiv"},{"id":"arxiv:2607.13775","title":"arXiv:2607.13775","url":"https://arxiv.org/abs/2607.13775"}],"status":"frontier","summary":"arXiv:2607.13775 \"A spinor-adapted geometric approach for nonlinear Dirac systems and its application to a tensorial wave-Dirac system near Minkowski spacetime\" (CC0 1.0, submitted 2026-07-28) reports: \"Combining these ingredients with integrated local energy decay estimates and $r^p$-weighted energy hierarchies, we establish a coupled energy method for the tensorial and spinorial components.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-05687","kind":"claim","label":"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-05687"]},"sources":[{"id":"source.frontier.arxiv-2607-05687","title":"arXiv OAI-PMH record arXiv:2607.05687: Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05687&metadataPrefix=arXiv"},{"id":"arxiv:2607.05687","title":"arXiv:2607.05687","url":"https://arxiv.org/abs/2607.05687"}],"status":"frontier","summary":"arXiv:2607.05687 \"Sphere Constraints and Harmonic Map Flow: Controllability and Reachability by Low-Mode Forcing\" (CC BY 4.0, submitted 2026-07-28) reports: \"We prove that iterated Lie brackets generate new admissible directions, providing a mechanism through which finitely many control modes propagate their influence across infinitely many Fourier components.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-05485","kind":"claim","label":"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-05485"]},"sources":[{"id":"source.frontier.arxiv-2607-05485","title":"arXiv OAI-PMH record arXiv:2607.05485: An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.05485&metadataPrefix=arXiv"},{"id":"arxiv:2607.05485","title":"arXiv:2607.05485","url":"https://arxiv.org/abs/2607.05485"}],"status":"frontier","summary":"arXiv:2607.05485 \"An inquiry into the Absence of Fermion Doubling and why the Nielsen-Ninomiya Theorem Does Not Apply to Nonlocal Quantum Field Theory\" (CC BY 4.0, submitted 2026-07-28) reports: \"We find that for a nonlocal Dirac theory, that no additional fermion species are introduced.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24988","kind":"claim","label":"Maximal complementarity in the n-qubit Pauli group","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24988"]},"sources":[{"id":"source.frontier.arxiv-2607-24988","title":"arXiv OAI-PMH record arXiv:2607.24988: Maximal complementarity in the n-qubit Pauli group","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24988&metadataPrefix=arXiv"},{"id":"arxiv:2607.24988","title":"arXiv:2607.24988","url":"https://arxiv.org/abs/2607.24988"}],"status":"frontier","summary":"arXiv:2607.24988 \"Maximal complementarity in the n-qubit Pauli group\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here, we study complementarity of degenerate observables, specifically we prove that observables associated with the n-qubit Pauli group also exhibit complementarity under this restriction: first, we obtain a criterion for two such observables to be complementary and, second, we relate maximal sets of complementary observables with informational pure state complementarity equalities, further studied in two companion papers.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24938","kind":"claim","label":"Tidal deformation of an accreting compact object","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24938"]},"sources":[{"id":"source.frontier.arxiv-2607-24938","title":"arXiv OAI-PMH record arXiv:2607.24938: Tidal deformation of an accreting compact object","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24938&metadataPrefix=arXiv"},{"id":"arxiv:2607.24938","title":"arXiv:2607.24938","url":"https://arxiv.org/abs/2607.24938"}],"status":"frontier","summary":"arXiv:2607.24938 \"Tidal deformation of an accreting compact object\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, for perfectly reflecting ECOs, the characteristic logarithmic dependence of the scalar and spin-1 response on compactness, set by near-horizon physics, remains intact even in the presence of accretion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24933","kind":"claim","label":"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24933"]},"sources":[{"id":"source.frontier.arxiv-2607-24933","title":"arXiv OAI-PMH record arXiv:2607.24933: Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24933&metadataPrefix=arXiv"},{"id":"arxiv:2607.24933","title":"arXiv:2607.24933","url":"https://arxiv.org/abs/2607.24933"}],"status":"frontier","summary":"arXiv:2607.24933 \"Coherence from interference: a solvable model of sub-GeV dark matter-nucleus scattering\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the only difference between coherent and incoherent scattering is that conservation of crystal momentum is enforced in coherent scattering.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24918","kind":"claim","label":"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24918"]},"sources":[{"id":"source.frontier.arxiv-2607-24918","title":"arXiv OAI-PMH record arXiv:2607.24918: Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24918&metadataPrefix=arXiv"},{"id":"arxiv:2607.24918","title":"arXiv:2607.24918","url":"https://arxiv.org/abs/2607.24918"}],"status":"frontier","summary":"arXiv:2607.24918 \"Probing long-range $L_e-L_μ$ forces with supernova neutronization burst neutrinos\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that in the range where the long-range potential dominates over or is comparable to the vacuum oscillation term, the electron-neutrino survival probability can be significantly modified.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24705","kind":"claim","label":"Derangetropy Operators","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24705"]},"sources":[{"id":"source.frontier.arxiv-2607-24705","title":"arXiv OAI-PMH record arXiv:2607.24705: Derangetropy Operators","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24705&metadataPrefix=arXiv"},{"id":"arxiv:2607.24705","title":"arXiv:2607.24705","url":"https://arxiv.org/abs/2607.24705"}],"status":"frontier","summary":"arXiv:2607.24705 \"Derangetropy Operators\" (CC BY 4.0, submitted 2026-07-27) reports: \"We prove that these operators are precisely the transformations of absolutely continuous laws equivariant under monotone changes of variable, and that they compose through interval maps, making their dynamics exactly solvable: iteration condenses every law onto its median with a universal Koenigs limit law, the continuous flow is solvable in closed form with the Cauchy family as invariant hyperbolic manifold, and balanced against diffusion the distribution function obeys an overdamped sine-Gordon equation whose unique steady law, the hyperbolic secant, is a globally stable kink.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24682","kind":"claim","label":"CP-preserving channels","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24682"]},"sources":[{"id":"source.frontier.arxiv-2607-24682","title":"arXiv OAI-PMH record arXiv:2607.24682: CP-preserving channels","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24682&metadataPrefix=arXiv"},{"id":"arxiv:2607.24682","title":"arXiv:2607.24682","url":"https://arxiv.org/abs/2607.24682"}],"status":"frontier","summary":"arXiv:2607.24682 \"CP-preserving channels\" (CC BY 4.0, submitted 2026-07-27) reports: \"By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24654","kind":"claim","label":"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24654"]},"sources":[{"id":"source.frontier.arxiv-2607-24654","title":"arXiv OAI-PMH record arXiv:2607.24654: Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24654&metadataPrefix=arXiv"},{"id":"arxiv:2607.24654","title":"arXiv:2607.24654","url":"https://arxiv.org/abs/2607.24654"}],"status":"frontier","summary":"arXiv:2607.24654 \"Test-particle dynamics in a noncommutative deformation of Einstein-Rosen waves\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that the deformation generates a coupling between the radial and longitudinal sectors, while the radial dynamics remains unaffected by the noncommutative deformation at the perturbative order considered.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24641","kind":"claim","label":"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24641"]},"sources":[{"id":"source.frontier.arxiv-2607-24641","title":"arXiv OAI-PMH record arXiv:2607.24641: Efficient Topic Model Estimation under Heavy-Tailed Document Lengths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24641&metadataPrefix=arXiv"},{"id":"arxiv:2607.24641","title":"arXiv:2607.24641","url":"https://arxiv.org/abs/2607.24641"}],"status":"frontier","summary":"arXiv:2607.24641 \"Efficient Topic Model Estimation under Heavy-Tailed Document Lengths\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this paper, we demonstrate that the Latent Dirichlet Allocation (LDA) model can accommodate power-law word frequencies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24605","kind":"claim","label":"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24605"]},"sources":[{"id":"source.frontier.arxiv-2607-24605","title":"arXiv OAI-PMH record arXiv:2607.24605: Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24605&metadataPrefix=arXiv"},{"id":"arxiv:2607.24605","title":"arXiv:2607.24605","url":"https://arxiv.org/abs/2607.24605"}],"status":"frontier","summary":"arXiv:2607.24605 \"Map Multi-Tool: A Map-Based Approach to Modeling Beam Systematics for Cosmic Microwave Background Experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"We demonstrate the capabilities of MMT with examples of non-ideal beams induced by electrical readout crosstalk and detector time constant response.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24584","kind":"claim","label":"Invisible decay of solar neutrinos at dark matter experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24584"]},"sources":[{"id":"source.frontier.arxiv-2607-24584","title":"arXiv OAI-PMH record arXiv:2607.24584: Invisible decay of solar neutrinos at dark matter experiments","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24584&metadataPrefix=arXiv"},{"id":"arxiv:2607.24584","title":"arXiv:2607.24584","url":"https://arxiv.org/abs/2607.24584"}],"status":"frontier","summary":"arXiv:2607.24584 \"Invisible decay of solar neutrinos at dark matter experiments\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our results show that, with nominal future exposures, nuclear-recoil data would improve the current bound by about one order of magnitude, while electronic-recoil data would open a new detection channel for low-energy solar neutrinos, surpassing existing dedicated solar-neutrino bounds by 1 to 2 orders of magnitude.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24544","kind":"claim","label":"An Halpha survey of infrared bow-shocks around OB-type stars","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24544"]},"sources":[{"id":"source.frontier.arxiv-2607-24544","title":"arXiv OAI-PMH record arXiv:2607.24544: An Halpha survey of infrared bow-shocks around OB-type stars","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24544&metadataPrefix=arXiv"},{"id":"arxiv:2607.24544","title":"arXiv:2607.24544","url":"https://arxiv.org/abs/2607.24544"}],"status":"frontier","summary":"arXiv:2607.24544 \"An Halpha survey of infrared bow-shocks around OB-type stars\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that several systems are consistent with radiation-supported BSs, bow waves or dust waves, while others remain compatible with classical wind-supported BSs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24524","kind":"claim","label":"Light Dark Matter Discovery Potential and Model Selection at LDMX","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24524"]},"sources":[{"id":"source.frontier.arxiv-2607-24524","title":"arXiv OAI-PMH record arXiv:2607.24524: Light Dark Matter Discovery Potential and Model Selection at LDMX","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24524&metadataPrefix=arXiv"},{"id":"arxiv:2607.24524","title":"arXiv:2607.24524","url":"https://arxiv.org/abs/2607.24524"}],"status":"frontier","summary":"arXiv:2607.24524 \"Light Dark Matter Discovery Potential and Model Selection at LDMX\" (CC BY 4.0, submitted 2026-07-27) reports: \"We find that LDMX has strong projected 5$σ$ discovery potential along the relic target across both background scenarios for certain benchmarks, and we further compute projected 90% C.L. exclusion limits assuming no measured signal events.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24489","kind":"claim","label":"Asymptotic areas between powers of sine and cosine curves","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24489"]},"sources":[{"id":"source.frontier.arxiv-2607-24489","title":"arXiv OAI-PMH record arXiv:2607.24489: Asymptotic areas between powers of sine and cosine curves","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24489&metadataPrefix=arXiv"},{"id":"arxiv:2607.24489","title":"arXiv:2607.24489","url":"https://arxiv.org/abs/2607.24489"}],"status":"frontier","summary":"arXiv:2607.24489 \"Asymptotic areas between powers of sine and cosine curves\" (CC BY 4.0, submitted 2026-07-27) reports: \"Motivated by Dombrowski and Dresden's work in 2025, we find the exact values of the limits \\[\\lim_{k\\to\\infty}\\int_0^{ρπ}|\\sin^n(kx)-\\sin^nx|dx\\quad\\text{and}\\quad \\lim_{k\\to\\infty}\\int_0^{ρπ}|\\cos^n(kx)-\\cos^nx|dx\\] for $k,n\\in\\mathbb{N}$ and $ρ\\ge 0$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24446","kind":"claim","label":"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24446"]},"sources":[{"id":"source.frontier.arxiv-2607-24446","title":"arXiv OAI-PMH record arXiv:2607.24446: Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24446&metadataPrefix=arXiv"},{"id":"arxiv:2607.24446","title":"arXiv:2607.24446","url":"https://arxiv.org/abs/2607.24446"}],"status":"frontier","summary":"arXiv:2607.24446 \"Constraints from the SM-like Higgs boson in a flavor-dependent $U(1)$ extension of the Standard Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that the model predicts $\\ka_{\\ga}$ values consistent with the ATLAS and CMS constraints at the $1σ$ level, while satisfying several bounds derived from flavor, collider and dark matter studies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24433","kind":"claim","label":"Justification Logic of the Lambda Calculus","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24433"]},"sources":[{"id":"source.frontier.arxiv-2607-24433","title":"arXiv OAI-PMH record arXiv:2607.24433: Justification Logic of the Lambda Calculus","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24433&metadataPrefix=arXiv"},{"id":"arxiv:2607.24433","title":"arXiv:2607.24433","url":"https://arxiv.org/abs/2607.24433"}],"status":"frontier","summary":"arXiv:2607.24433 \"Justification Logic of the Lambda Calculus\" (CC BY 4.0, submitted 2026-07-27) reports: \"To complete the picture, we give a Gentzen-style sequent calculus for which we prove cut-elimination, and consequently obtain a normalisation result by working in the negative fragment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24254","kind":"claim","label":"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24254"]},"sources":[{"id":"source.frontier.arxiv-2607-24254","title":"arXiv OAI-PMH record arXiv:2607.24254: Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24254&metadataPrefix=arXiv"},{"id":"arxiv:2607.24254","title":"arXiv:2607.24254","url":"https://arxiv.org/abs/2607.24254"}],"status":"frontier","summary":"arXiv:2607.24254 \"Exact Analytical Phase Transitions, Horizon Bistability, and Thermodynamic State-Space Representation of Regular Hayward Black Holes\" (CC BY 4.0, submitted 2026-07-27) reports: \"We establish exact analytical thresholds and present a unified thermodynamic state-space representation for the regular Hayward black hole, resolving the full phase structure without reliance on numerical approximations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24252","kind":"claim","label":"Non-Reciprocal yet Equilibrium Critical Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24252"]},"sources":[{"id":"source.frontier.arxiv-2607-24252","title":"arXiv OAI-PMH record arXiv:2607.24252: Non-Reciprocal yet Equilibrium Critical Dynamics","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24252&metadataPrefix=arXiv"},{"id":"arxiv:2607.24252","title":"arXiv:2607.24252","url":"https://arxiv.org/abs/2607.24252"}],"status":"frontier","summary":"arXiv:2607.24252 \"Non-Reciprocal yet Equilibrium Critical Dynamics\" (CC BY 4.0, submitted 2026-07-27) reports: \"To lowest order in $ε= 4-d$, we find that the non-reciprocal coupling is RG-irrelevant, and the critical behavior is governed by the equilibrium fixed point of the Model A universality class of Hohenberg and Halperin with $2n$ vector components, even though the transition is into a non-equilibrium state.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24244","kind":"claim","label":"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24244"]},"sources":[{"id":"source.frontier.arxiv-2607-24244","title":"arXiv OAI-PMH record arXiv:2607.24244: Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24244&metadataPrefix=arXiv"},{"id":"arxiv:2607.24244","title":"arXiv:2607.24244","url":"https://arxiv.org/abs/2607.24244"}],"status":"frontier","summary":"arXiv:2607.24244 \"Square Net TaSiAs Nanowires with Topological Surface Conduction and Linear Magnetoresistance\" (CC BY 4.0, submitted 2026-07-27) reports: \"The findings demonstrate the unique properties of low-dimensional square-net topological materials and their potential applications, including next-generation interconnects, spintronic devices and quantum computing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24240","kind":"claim","label":"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24240"]},"sources":[{"id":"source.frontier.arxiv-2607-24240","title":"arXiv OAI-PMH record arXiv:2607.24240: Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24240&metadataPrefix=arXiv"},{"id":"arxiv:2607.24240","title":"arXiv:2607.24240","url":"https://arxiv.org/abs/2607.24240"}],"status":"frontier","summary":"arXiv:2607.24240 \"Ultranarrow-linewidth self-injection-locked tunable blue GaN DFB laser\" (CC BY 4.0, submitted 2026-07-27) reports: \"In this work, we demonstrate an ultra-narrow linewidth self-injection locked distributed feedback (DFB) diode laser emitting at 452 nm, achieving an intrinsic linewidth of 170 Hz with a fiber output power of 11 mW.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24239","kind":"claim","label":"Evolution of dipole-dipole dynamics in cold ammonia collisions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24239"]},"sources":[{"id":"source.frontier.arxiv-2607-24239","title":"arXiv OAI-PMH record arXiv:2607.24239: Evolution of dipole-dipole dynamics in cold ammonia collisions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24239&metadataPrefix=arXiv"},{"id":"arxiv:2607.24239","title":"arXiv:2607.24239","url":"https://arxiv.org/abs/2607.24239"}],"status":"frontier","summary":"arXiv:2607.24239 \"Evolution of dipole-dipole dynamics in cold ammonia collisions\" (CC BY 4.0, submitted 2026-07-27) reports: \"Here we report measurements of state-to-state cross sections for collisions between ammonia isotopologues at energies between 0.3 and 100 cm$^{-1}$ using a novel beam merger.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24212","kind":"claim","label":"Convex Biproducts, Stochastic Matrices and Tape Diagrams","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24212"]},"sources":[{"id":"source.frontier.arxiv-2607-24212","title":"arXiv OAI-PMH record arXiv:2607.24212: Convex Biproducts, Stochastic Matrices and Tape Diagrams","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24212&metadataPrefix=arXiv"},{"id":"arxiv:2607.24212","title":"arXiv:2607.24212","url":"https://arxiv.org/abs/2607.24212"}],"status":"frontier","summary":"arXiv:2607.24212 \"Convex Biproducts, Stochastic Matrices and Tape Diagrams\" (CC BY 4.0, submitted 2026-07-27) reports: \"We show that, whereas categories with finite biproducts give rise to a matrix calculus based on arbitrary linear combinations, convex biproduct categories instead induce a matrix calculus based on stochastic (more generally, substochastic) matrices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24144","kind":"claim","label":"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24144"]},"sources":[{"id":"source.frontier.arxiv-2607-24144","title":"arXiv OAI-PMH record arXiv:2607.24144: Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24144&metadataPrefix=arXiv"},{"id":"arxiv:2607.24144","title":"arXiv:2607.24144","url":"https://arxiv.org/abs/2607.24144"}],"status":"frontier","summary":"arXiv:2607.24144 \"Gravitational Wave Signatures of Periodic Orbits around a Schwarzschild-like Black Holes Submerged in an Exponential Density Dark Matter Profile\" (CC BY 4.0, submitted 2026-07-27) reports: \"Together, these results indicate that EMRI waveforms can, in principle, disentangle the total mass of a dark matter halo from its spatial extent, offering a strong-field probe of the dark matter distribution around supermassive black holes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24123","kind":"claim","label":"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24123"]},"sources":[{"id":"source.frontier.arxiv-2607-24123","title":"arXiv OAI-PMH record arXiv:2607.24123: Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24123&metadataPrefix=arXiv"},{"id":"arxiv:2607.24123","title":"arXiv:2607.24123","url":"https://arxiv.org/abs/2607.24123"}],"status":"frontier","summary":"arXiv:2607.24123 \"Optimal bounds for the ratio of differences of quadratic, arithmetic, and harmonic means\" (CC BY 4.0, submitted 2026-07-27) reports: \"Specifically, we prove that for $n\\ge3$ the sharp double inequality \\[ \\frac{1}{\\sqrt{n}}\\le \\frac{A_n-H_n}{Q_n-H_n}\\le \\sqrt{\\frac{n-1}{n}} \\] holds true.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24091","kind":"claim","label":"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24091"]},"sources":[{"id":"source.frontier.arxiv-2607-24091","title":"arXiv OAI-PMH record arXiv:2607.24091: Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24091&metadataPrefix=arXiv"},{"id":"arxiv:2607.24091","title":"arXiv:2607.24091","url":"https://arxiv.org/abs/2607.24091"}],"status":"frontier","summary":"arXiv:2607.24091 \"Gravitational Lensing of Gravitational Waves: Towards a Higher-order Geometric-optics Approach\" (CC BY 4.0, submitted 2026-07-27) reports: \"Through a rigorous theoretical formulation and detailed numerical analysis, our results reveal the emergence of apparent vector and scalar modes in lensed GW signals, which originate from the smearing of the polarization plane and distortion of the wavefront and do not represent genuine dynamical degrees of freedom but rather arise as the propagation effects imposed by gravitational lensing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24078","kind":"claim","label":"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24078"]},"sources":[{"id":"source.frontier.arxiv-2607-24078","title":"arXiv OAI-PMH record arXiv:2607.24078: Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24078&metadataPrefix=arXiv"},{"id":"arxiv:2607.24078","title":"arXiv:2607.24078","url":"https://arxiv.org/abs/2607.24078"}],"status":"frontier","summary":"arXiv:2607.24078 \"Thermodynamics with thermodynamic variable first-passage time. I. From stochastic trajectories to nonlinear transport equations\" (CC BY 4.0, submitted 2026-07-27) reports: \"It is shown that including a random lifetime of a metastable state in the generalized distribution function allows the first passage time to be considered as a fully - fledged macroscopic coordinate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23978","kind":"claim","label":"Non-Hermitian-enhanced quantum sensing in an optical interferometer","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-23978"]},"sources":[{"id":"source.frontier.arxiv-2607-23978","title":"arXiv OAI-PMH record arXiv:2607.23978: Non-Hermitian-enhanced quantum sensing in an optical interferometer","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23978&metadataPrefix=arXiv"},{"id":"arxiv:2607.23978","title":"arXiv:2607.23978","url":"https://arxiv.org/abs/2607.23978"}],"status":"frontier","summary":"arXiv:2607.23978 \"Non-Hermitian-enhanced quantum sensing in an optical interferometer\" (CC BY 4.0, submitted 2026-07-27) reports: \"We observe a reduced error-propagation variance compared with the optimal Hermitian observable for the same probe-state model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23956","kind":"claim","label":"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-23956"]},"sources":[{"id":"source.frontier.arxiv-2607-23956","title":"arXiv OAI-PMH record arXiv:2607.23956: Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23956&metadataPrefix=arXiv"},{"id":"arxiv:2607.23956","title":"arXiv:2607.23956","url":"https://arxiv.org/abs/2607.23956"}],"status":"frontier","summary":"arXiv:2607.23956 \"Dynamical Quantum Phase Transitions in a Pseudo-Hermitian Hamiltonian: The Imbalanced-Pairing Kitaev Model\" (CC BY 4.0, submitted 2026-07-27) reports: \"More generally, real spectra are associated with the broader class of pseudo-Hermitian Hamiltonians, of which PT-symmetric Hamiltonians constitute a simple subclass.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-12128","kind":"claim","label":"Categorical Tensor-Graph Semantics for Quantum Algorithms","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-12128"]},"sources":[{"id":"source.frontier.arxiv-2607-12128","title":"arXiv OAI-PMH record arXiv:2607.12128: Categorical Tensor-Graph Semantics for Quantum Algorithms","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.12128&metadataPrefix=arXiv"},{"id":"arxiv:2607.12128","title":"arXiv:2607.12128","url":"https://arxiv.org/abs/2607.12128"}],"status":"frontier","summary":"arXiv:2607.12128 \"Categorical Tensor-Graph Semantics for Quantum Algorithms\" (CC BY 4.0, submitted 2026-07-27) reports: \"In particular, we establish a necessary and sufficient condition for the single-shot Grover search.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"physical","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26084","kind":"claim","label":"Observational Constraints on Emergent Fractional Fractal Cosmology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-26084"]},"sources":[{"id":"source.frontier.arxiv-2607-26084","title":"arXiv OAI-PMH record arXiv:2607.26084: Observational Constraints on Emergent Fractional Fractal Cosmology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26084&metadataPrefix=arXiv"},{"id":"arxiv:2607.26084","title":"arXiv:2607.26084","url":"https://arxiv.org/abs/2607.26084"},{"id":"doi:10.1088/1361-6382/ae8e27","title":"doi:10.1088/1361-6382/ae8e27","url":"https://doi.org/10.1088/1361-6382/ae8e27"}],"status":"frontier","summary":"arXiv:2607.26084 \"Observational Constraints on Emergent Fractional Fractal Cosmology\" (CC BY 4.0, submitted 2026-07-26) reports: \"These results show that current cosmological observations place strong constraints on fractal extensions of the standard cosmological framework and possible deviations from the $Λ$CDM model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23859","kind":"claim","label":"A note on the cohomology of pullback Lie algebroids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23859"]},"sources":[{"id":"source.frontier.arxiv-2607-23859","title":"arXiv OAI-PMH record arXiv:2607.23859: A note on the cohomology of pullback Lie algebroids","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23859&metadataPrefix=arXiv"},{"id":"arxiv:2607.23859","title":"arXiv:2607.23859","url":"https://arxiv.org/abs/2607.23859"}],"status":"frontier","summary":"arXiv:2607.23859 \"A note on the cohomology of pullback Lie algebroids\" (CC BY 4.0, submitted 2026-07-26) reports: \"We also prove the analogous result for holomorphic Lie algebroids.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23814","kind":"claim","label":"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23814"]},"sources":[{"id":"source.frontier.arxiv-2607-23814","title":"arXiv OAI-PMH record arXiv:2607.23814: Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23814&metadataPrefix=arXiv"},{"id":"arxiv:2607.23814","title":"arXiv:2607.23814","url":"https://arxiv.org/abs/2607.23814"}],"status":"frontier","summary":"arXiv:2607.23814 \"Implicit Tensor-Train Cross Integration of High-Dimensional Nonlinear PDEs via Fiber-Dependency Elimination\" (CC BY 4.0, submitted 2026-07-26) reports: \"Numerical experiments demonstrate rapid convergence of the dependency-elimination iterations, preservation of the temporal accuracy of implicit multistep schemes, and efficient implicit integration of high-dimensional nonlinear problems with full-order discretizations containing up to $10^{55}$ degrees of freedom.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23798","kind":"claim","label":"Interpolation via Generalized Splitting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23798"]},"sources":[{"id":"source.frontier.arxiv-2607-23798","title":"arXiv OAI-PMH record arXiv:2607.23798: Interpolation via Generalized Splitting","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23798&metadataPrefix=arXiv"},{"id":"arxiv:2607.23798","title":"arXiv:2607.23798","url":"https://arxiv.org/abs/2607.23798"}],"status":"frontier","summary":"arXiv:2607.23798 \"Interpolation via Generalized Splitting\" (CC BY 4.0, submitted 2026-07-26) reports: \"We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23596","kind":"claim","label":"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23596"]},"sources":[{"id":"source.frontier.arxiv-2607-23596","title":"arXiv OAI-PMH record arXiv:2607.23596: Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23596&metadataPrefix=arXiv"},{"id":"arxiv:2607.23596","title":"arXiv:2607.23596","url":"https://arxiv.org/abs/2607.23596"}],"status":"frontier","summary":"arXiv:2607.23596 \"Statistical Analysis of Network Collections Using Persistent Homology and Functional Data Analysis\" (CC BY 4.0, submitted 2026-07-26) reports: \"Through simulation studies involving networks with varying connectivity structures, we demonstrate the ability of funTDA to distinguish between distinct network configurations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23430","kind":"claim","label":"Dialectica Categories over Heyting Algebras","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23430"]},"sources":[{"id":"source.frontier.arxiv-2607-23430","title":"arXiv OAI-PMH record arXiv:2607.23430: Dialectica Categories over Heyting Algebras","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23430&metadataPrefix=arXiv"},{"id":"arxiv:2607.23430","title":"arXiv:2607.23430","url":"https://arxiv.org/abs/2607.23430"}],"status":"frontier","summary":"arXiv:2607.23430 \"Dialectica Categories over Heyting Algebras\" (CC BY 4.0, submitted 2026-07-26) reports: \"In the case of de Paiva's categorification of Gödel's Dialectica interpretation, we find that its specialization to partial orders produces (functorial) embeddings of Heyting algebras into residuated lattices that appear to have been overlooked.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23428","kind":"claim","label":"Pinching rigidity of surfaces with parallel mean curvature vector in spheres","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.arxiv-2607-23428"]},"sources":[{"id":"source.frontier.arxiv-2607-23428","title":"arXiv OAI-PMH record arXiv:2607.23428: Pinching rigidity of surfaces with parallel mean curvature vector in spheres","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23428&metadataPrefix=arXiv"},{"id":"arxiv:2607.23428","title":"arXiv:2607.23428","url":"https://arxiv.org/abs/2607.23428"}],"status":"frontier","summary":"arXiv:2607.23428 \"Pinching rigidity of surfaces with parallel mean curvature vector in spheres\" (CC0 1.0, submitted 2026-07-26) reports: \"We establish three Simons-type integral identities for $\\tilde S$, which extend the first, second and third gap identities in the minimal case.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23236","kind":"claim","label":"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23236"]},"sources":[{"id":"source.frontier.arxiv-2607-23236","title":"arXiv OAI-PMH record arXiv:2607.23236: FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23236&metadataPrefix=arXiv"},{"id":"arxiv:2607.23236","title":"arXiv:2607.23236","url":"https://arxiv.org/abs/2607.23236"}],"status":"frontier","summary":"arXiv:2607.23236 \"FedSLIM: Privacy-Preserving Federated MDL-Based Descriptive Pattern Mining Across Data Silos\" (CC BY 4.0, submitted 2026-07-25) reports: \"We further reveal a local-global discovery gap in distributed MDL mining, where globally compressive patterns may be undiscoverable through isolated local optimisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23212","kind":"claim","label":"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23212"]},"sources":[{"id":"source.frontier.arxiv-2607-23212","title":"arXiv OAI-PMH record arXiv:2607.23212: Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23212&metadataPrefix=arXiv"},{"id":"arxiv:2607.23212","title":"arXiv:2607.23212","url":"https://arxiv.org/abs/2607.23212"}],"status":"frontier","summary":"arXiv:2607.23212 \"Parametric Sensitivity of POD Reduced-Order Models for Semilinear Evolution Equations with Applications to G-Equations\" (CC BY 4.0, submitted 2026-07-25) reports: \"We prove that when a POD basis constructed at a reference parameter is applied to nearby query parameters, the resulting error variation is controlled by the corresponding parameter modulus, with constants independent of the POD dimension, the number of time steps, and the perturbation magnitude.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-23192","kind":"claim","label":"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-23192"]},"sources":[{"id":"source.frontier.arxiv-2607-23192","title":"arXiv OAI-PMH record arXiv:2607.23192: Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.23192&metadataPrefix=arXiv"},{"id":"arxiv:2607.23192","title":"arXiv:2607.23192","url":"https://arxiv.org/abs/2607.23192"}],"status":"frontier","summary":"arXiv:2607.23192 \"Data-Driven Diffusion Processes on Differential Forms via the Projected Ambient Connection Laplacian\" (CC0 1.0, submitted 2026-07-25) reports: \"Building upon this operator, we derive a fully data-driven explicit Euler scheme for the heat equation on differential forms and validate the proposed methodology through numerical experiments on the unit sphere.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22985","kind":"claim","label":"Robust Conformalized Selection with Noisy Responses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-25","source_ids":["source.frontier.arxiv-2607-22985"]},"sources":[{"id":"source.frontier.arxiv-2607-22985","title":"arXiv OAI-PMH record arXiv:2607.22985: Robust Conformalized Selection with Noisy Responses","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22985&metadataPrefix=arXiv"},{"id":"arxiv:2607.22985","title":"arXiv:2607.22985","url":"https://arxiv.org/abs/2607.22985"}],"status":"frontier","summary":"arXiv:2607.22985 \"Robust Conformalized Selection with Noisy Responses\" (CC BY 4.0, submitted 2026-07-25) reports: \"We demonstrate that existing conformal selection methods fail to control the false discovery rate (FDR) or suffer from severe power loss under contaminated calibration data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22958","kind":"claim","label":"Quickest Detection with Rough Path Signatures","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22958"]},"sources":[{"id":"source.frontier.arxiv-2607-22958","title":"arXiv OAI-PMH record arXiv:2607.22958: Quickest Detection with Rough Path Signatures","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22958&metadataPrefix=arXiv"},{"id":"arxiv:2607.22958","title":"arXiv:2607.22958","url":"https://arxiv.org/abs/2607.22958"}],"status":"frontier","summary":"arXiv:2607.22958 \"Quickest Detection with Rough Path Signatures\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that the optimal stopping rule takes the form of the first hitting time to a half-space by a linear functional of the rough path signature, and establish that the same structural form arises independently from the intrinsic geometry of the observed path.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22920","kind":"claim","label":"Equidistribution of currents under Anosov group actions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22920"]},"sources":[{"id":"source.frontier.arxiv-2607-22920","title":"arXiv OAI-PMH record arXiv:2607.22920: Equidistribution of currents under Anosov group actions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22920&metadataPrefix=arXiv"},{"id":"arxiv:2607.22920","title":"arXiv:2607.22920","url":"https://arxiv.org/abs/2607.22920"}],"status":"frontier","summary":"arXiv:2607.22920 \"Equidistribution of currents under Anosov group actions\" (CC BY 4.0, submitted 2026-07-24) reports: \"We show that under certain genericity conditions (in the case of currents of integration over subvarieties), the limiting current is a Gibbs current, i.e. is given by integration (with respect to a Gibbs measure) over the flag-limit set of suitable multiples of currents of integration along Schubert varieties based at the limit points of the group.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22892","kind":"claim","label":"Mirror Langevin diffusions: Convergence rates and Markov chain approximations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22892"]},"sources":[{"id":"source.frontier.arxiv-2607-22892","title":"arXiv OAI-PMH record arXiv:2607.22892: Mirror Langevin diffusions: Convergence rates and Markov chain approximations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22892&metadataPrefix=arXiv"},{"id":"arxiv:2607.22892","title":"arXiv:2607.22892","url":"https://arxiv.org/abs/2607.22892"}],"status":"frontier","summary":"arXiv:2607.22892 \"Mirror Langevin diffusions: Convergence rates and Markov chain approximations\" (CC BY 4.0, submitted 2026-07-24) reports: \"Under suitable assumptions, we prove that the Markov chain has a guaranteed convergence rate in $χ^2$ that is consistent with the diffusion time scale.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22443","kind":"claim","label":"A Human-Augmenting Agentic Workflow for Observational Causal Inference","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22443"]},"sources":[{"id":"source.frontier.arxiv-2607-22443","title":"arXiv OAI-PMH record arXiv:2607.22443: A Human-Augmenting Agentic Workflow for Observational Causal Inference","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22443&metadataPrefix=arXiv"},{"id":"arxiv:2607.22443","title":"arXiv:2607.22443","url":"https://arxiv.org/abs/2607.22443"}],"status":"frontier","summary":"arXiv:2607.22443 \"A Human-Augmenting Agentic Workflow for Observational Causal Inference\" (CC BY 4.0, submitted 2026-07-24) reports: \"Across numerous evaluations, `oci-agent` outperforms less structured baselines while remaining competitive with hand-tuned benchmarks. `oci-agent` is used extensively for causal inference at Netflix and has orchestrated more than 100 analyses per month since its release in June.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22333","kind":"claim","label":"Collision and non-collision for diffusions on configuration space","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22333"]},"sources":[{"id":"source.frontier.arxiv-2607-22333","title":"arXiv OAI-PMH record arXiv:2607.22333: Collision and non-collision for diffusions on configuration space","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22333&metadataPrefix=arXiv"},{"id":"arxiv:2607.22333","title":"arXiv:2607.22333","url":"https://arxiv.org/abs/2607.22333"}],"status":"frontier","summary":"arXiv:2607.22333 \"Collision and non-collision for diffusions on configuration space\" (CC BY 4.0, submitted 2026-07-24) reports: \"As an application, we identify the sharp collision threshold for the diffusion associated with the $\\mathsf{Sine}_β$-symmetric Dirichlet form: the collision set is polar if and only if $β\\ge 1$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22284","kind":"claim","label":"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22284"]},"sources":[{"id":"source.frontier.arxiv-2607-22284","title":"arXiv OAI-PMH record arXiv:2607.22284: Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22284&metadataPrefix=arXiv"},{"id":"arxiv:2607.22284","title":"arXiv:2607.22284","url":"https://arxiv.org/abs/2607.22284"}],"status":"frontier","summary":"arXiv:2607.22284 \"Automorphisms of Twisted Chevalley Groups of type ${}^2 A_\\ell \\ (\\ell \\geq 5)$ over Local Rings\" (CC BY 4.0, submitted 2026-07-24) reports: \"In the present paper, we prove that every automorphism of a twisted Chevalley group of type ${}^2A_\\ell$ $(\\ell \\geq 5)$ over a local ring in which $2$ is invertible is standard.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22196","kind":"claim","label":"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22196"]},"sources":[{"id":"source.frontier.arxiv-2607-22196","title":"arXiv OAI-PMH record arXiv:2607.22196: Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22196&metadataPrefix=arXiv"},{"id":"arxiv:2607.22196","title":"arXiv:2607.22196","url":"https://arxiv.org/abs/2607.22196"}],"status":"frontier","summary":"arXiv:2607.22196 \"Ramsey-Theoretic Finiteness in Choiceless Set Theory: The Gower's Collapse and Rainbow and Canonical Separations\" (CC BY 4.0, submitted 2026-07-24) reports: \"We prove several inclusions placing them relative to standard Ramsey-theoretic finiteness classes of Brot--Cao--Fernández-Bretón, prove their independence from the collapsed Hindman--Gowers class, and analyze the parameter dependence of the rainbow classes through Fraenkel--Mostowski examples.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22156","kind":"claim","label":"A random matrix approach to lamplighter groups","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22156"]},"sources":[{"id":"source.frontier.arxiv-2607-22156","title":"arXiv OAI-PMH record arXiv:2607.22156: A random matrix approach to lamplighter groups","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22156&metadataPrefix=arXiv"},{"id":"arxiv:2607.22156","title":"arXiv:2607.22156","url":"https://arxiv.org/abs/2607.22156"}],"status":"frontier","summary":"arXiv:2607.22156 \"A random matrix approach to lamplighter groups\" (CC BY 4.0, submitted 2026-07-24) reports: \"First, we establish a random matrix model $X_N=\\sum_s X^{(s)}_N$ where the sum is indexed by the set $S$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22018","kind":"claim","label":"Unlocking novel topological structures via rough families","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22018"]},"sources":[{"id":"source.frontier.arxiv-2607-22018","title":"arXiv OAI-PMH record arXiv:2607.22018: Unlocking novel topological structures via rough families","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22018&metadataPrefix=arXiv"},{"id":"arxiv:2607.22018","title":"arXiv:2607.22018","url":"https://arxiv.org/abs/2607.22018"}],"status":"frontier","summary":"arXiv:2607.22018 \"Unlocking novel topological structures via rough families\" (CC BY 4.0, submitted 2026-07-24) reports: \"In this article, we prove that a topological space is $T_2$ if and only if it can never be a rough topological space.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21892","kind":"claim","label":"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-21892"]},"sources":[{"id":"source.frontier.arxiv-2607-21892","title":"arXiv OAI-PMH record arXiv:2607.21892: A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21892&metadataPrefix=arXiv"},{"id":"arxiv:2607.21892","title":"arXiv:2607.21892","url":"https://arxiv.org/abs/2607.21892"}],"status":"frontier","summary":"arXiv:2607.21892 \"A More Efficient Algorithm for Finding the Number of Permutations of $\\mathbb{ZZ}/n\\mathbb{ZZ}$ with Distinct Partial Sums\" (CC BY 4.0, submitted 2026-07-24) reports: \"We relate these numbers to the values in an already known sequence via a bijection which we prove in this paper.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-16724","kind":"claim","label":"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-16724"]},"sources":[{"id":"source.frontier.arxiv-2607-16724","title":"arXiv OAI-PMH record arXiv:2607.16724: Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16724&metadataPrefix=arXiv"},{"id":"arxiv:2607.16724","title":"arXiv:2607.16724","url":"https://arxiv.org/abs/2607.16724"}],"status":"frontier","summary":"arXiv:2607.16724 \"Algebraic Transfer for Operator-Valued Gaussian Chaoses:Oriented Schatten Profiles and Singular Wick Multipliers\" (CC BY 4.0, submitted 2026-07-24) reports: \"For second-order multipliers we obtain sharp necessary and sufficient Schatten convergence thresholds; on $\\mathbb{Z}^{D}$ we determine the full singular phase diagram at every order.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-06237","kind":"claim","label":"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-06237"]},"sources":[{"id":"source.frontier.arxiv-2607-06237","title":"arXiv OAI-PMH record arXiv:2607.06237: ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.06237&metadataPrefix=arXiv"},{"id":"arxiv:2607.06237","title":"arXiv:2607.06237","url":"https://arxiv.org/abs/2607.06237"}],"status":"frontier","summary":"arXiv:2607.06237 \"ResiPhy-MDNF: A Residual-Based Physics-Aware Multilevel Discrete Neural Field Framework for PDE-Constrained Inverse Problems\" (CC BY 4.0, submitted 2026-07-24) reports: \"These results indicate that the same multilevel construction can be used across different coefficient structures, discretizations, and observation geometries.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22751","kind":"claim","label":"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-22751"]},"sources":[{"id":"source.frontier.arxiv-2607-22751","title":"arXiv OAI-PMH record arXiv:2607.22751: Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22751&metadataPrefix=arXiv"},{"id":"arxiv:2607.22751","title":"arXiv:2607.22751","url":"https://arxiv.org/abs/2607.22751"}],"status":"frontier","summary":"arXiv:2607.22751 \"Symmetric Jacobi Polynomials on a Triangle and Their Spectral Algebra\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also obtain an explicit representation of the basis in terms of one-variable Jacobi polynomials and compute its squared norms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21474","kind":"claim","label":"Fatness and Flatness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21474"]},"sources":[{"id":"source.frontier.arxiv-2607-21474","title":"arXiv OAI-PMH record arXiv:2607.21474: Fatness and Flatness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21474&metadataPrefix=arXiv"},{"id":"arxiv:2607.21474","title":"arXiv:2607.21474","url":"https://arxiv.org/abs/2607.21474"}],"status":"frontier","summary":"arXiv:2607.21474 \"Fatness and Flatness\" (CC BY 4.0, submitted 2026-07-23) reports: \"We also study drill-flatness in hereditary classes of (unweighted) graphs, where we obtain a characterization equating drill-flatness with excluding shallow induced minors.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21320","kind":"claim","label":"Post Completeness in Conditional Logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21320"]},"sources":[{"id":"source.frontier.arxiv-2607-21320","title":"arXiv OAI-PMH record arXiv:2607.21320: Post Completeness in Conditional Logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21320&metadataPrefix=arXiv"},{"id":"arxiv:2607.21320","title":"arXiv:2607.21320","url":"https://arxiv.org/abs/2607.21320"}],"status":"frontier","summary":"arXiv:2607.21320 \"Post Completeness in Conditional Logic\" (CC BY 4.0, submitted 2026-07-23) reports: \"We identify all of the finitely many regular and normal Post complete conditional logics, and prove analogues of Makinson's embedding theorems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21191","kind":"claim","label":"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21191"]},"sources":[{"id":"source.frontier.arxiv-2607-21191","title":"arXiv OAI-PMH record arXiv:2607.21191: Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21191&metadataPrefix=arXiv"},{"id":"arxiv:2607.21191","title":"arXiv:2607.21191","url":"https://arxiv.org/abs/2607.21191"},{"id":"doi:10.4204/eptcs.450.12","title":"doi:10.4204/eptcs.450.12","url":"https://doi.org/10.4204/eptcs.450.12"}],"status":"frontier","summary":"arXiv:2607.21191 \"Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB\" (CC BY 4.0, submitted 2026-07-23) reports: \"By integrating the proof rules into the Prolog-based validation tool ProB, we obtain an interactive proof system with proof tree visualisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21167","kind":"claim","label":"Differentiability of the operator norm on $\\ell_p$ spaces","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21167"]},"sources":[{"id":"source.frontier.arxiv-2607-21167","title":"arXiv OAI-PMH record arXiv:2607.21167: Differentiability of the operator norm on $\\ell_p$ spaces","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21167&metadataPrefix=arXiv"},{"id":"arxiv:2607.21167","title":"arXiv:2607.21167","url":"https://arxiv.org/abs/2607.21167"},{"id":"doi:10.4153/s0008414x24001135","title":"doi:10.4153/s0008414x24001135","url":"https://doi.org/10.4153/s0008414x24001135"}],"status":"frontier","summary":"arXiv:2607.21167 \"Differentiability of the operator norm on $\\ell_p$ spaces\" (CC BY 4.0, submitted 2026-07-23) reports: \"Furthermore, we prove that the set of all bounded linear operators in ${B}(\\ell_p, \\ell_q)$ for which the norm of ${B}(\\ell_p, \\ell_q)$ is strongly subdifferentiable is dense in ${B}(\\ell_p, \\ell_q)$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-21112","kind":"claim","label":"Exact ensemble controllability for neural differential equations via neural interpolation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-21112"]},"sources":[{"id":"source.frontier.arxiv-2607-21112","title":"arXiv OAI-PMH record arXiv:2607.21112: Exact ensemble controllability for neural differential equations via neural interpolation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.21112&metadataPrefix=arXiv"},{"id":"arxiv:2607.21112","title":"arXiv:2607.21112","url":"https://arxiv.org/abs/2607.21112"}],"status":"frontier","summary":"arXiv:2607.21112 \"Exact ensemble controllability for neural differential equations via neural interpolation\" (CC BY 4.0, submitted 2026-07-23) reports: \"We show that if the right-hand side of the differential equation is given by a neural network of depth two, the interpolation problem can be reduced to the solution of a system of linear equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20049","kind":"claim","label":"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.arxiv-2607-20049"]},"sources":[{"id":"source.frontier.arxiv-2607-20049","title":"arXiv OAI-PMH record arXiv:2607.20049: A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20049&metadataPrefix=arXiv"},{"id":"arxiv:2607.20049","title":"arXiv:2607.20049","url":"https://arxiv.org/abs/2607.20049"}],"status":"frontier","summary":"arXiv:2607.20049 \"A Counterexample to the Global Injectivity of a Jacobian Mapping in \\mathbb{C}^5 and Its Analytical Roots\" (CC BY 4.0, submitted 2026-07-23) reports: \"We prove that while the Jacobian matrix of this mapping is unipotent at every point (implying det J_G(x) \\equiv 1), the mapping itself is not globally injective.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20677","kind":"claim","label":"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20677"]},"sources":[{"id":"source.frontier.arxiv-2607-20677","title":"arXiv OAI-PMH record arXiv:2607.20677: First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20677&metadataPrefix=arXiv"},{"id":"arxiv:2607.20677","title":"arXiv:2607.20677","url":"https://arxiv.org/abs/2607.20677"}],"status":"frontier","summary":"arXiv:2607.20677 \"First-Order Analysis of Optimization in Uniformly Convex Metric Spaces: Directional Subderivatives and Basic Descent\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show that there exists a steepest descent direction in which the assumptions for convergence are satisfied.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20407","kind":"claim","label":"Uncountable Abelian Group C*-algebras Fail the Lifting Property","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20407"]},"sources":[{"id":"source.frontier.arxiv-2607-20407","title":"arXiv OAI-PMH record arXiv:2607.20407: Uncountable Abelian Group C*-algebras Fail the Lifting Property","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20407&metadataPrefix=arXiv"},{"id":"arxiv:2607.20407","title":"arXiv:2607.20407","url":"https://arxiv.org/abs/2607.20407"}],"status":"frontier","summary":"arXiv:2607.20407 \"Uncountable Abelian Group C*-algebras Fail the Lifting Property\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this note, we show that $C^*(G)$ fails the lifting property (LP) for every discrete group $G$ containing an uncountable abelian subgroup.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20164","kind":"claim","label":"Law of iterated logarithm for inner functions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20164"]},"sources":[{"id":"source.frontier.arxiv-2607-20164","title":"arXiv OAI-PMH record arXiv:2607.20164: Law of iterated logarithm for inner functions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20164&metadataPrefix=arXiv"},{"id":"arxiv:2607.20164","title":"arXiv:2607.20164","url":"https://arxiv.org/abs/2607.20164"}],"status":"frontier","summary":"arXiv:2607.20164 \"Law of iterated logarithm for inner functions\" (CC BY 4.0, submitted 2026-07-22) reports: \"In this paper, we prove the law of iterated logarithm (LIL) in the same setup, with a very mild condition on the coefficients.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20161","kind":"claim","label":"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20161"]},"sources":[{"id":"source.frontier.arxiv-2607-20161","title":"arXiv OAI-PMH record arXiv:2607.20161: Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20161&metadataPrefix=arXiv"},{"id":"arxiv:2607.20161","title":"arXiv:2607.20161","url":"https://arxiv.org/abs/2607.20161"}],"status":"frontier","summary":"arXiv:2607.20161 \"Connected components of real loci in moduli spaces of vector and Higgs bundles over a Klein surface\" (CC BY 4.0, submitted 2026-07-22) reports: \"We show in particular that, when the base curve has real points, quaternionic vector bundles can exist for even rank and degree but that the number of connected components of $\\mathbb{R}\\mathcal{N}(r,d)$ is still equal to that of $\\mathbb{R}\\mathrm{Pic}_d$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20098","kind":"claim","label":"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20098"]},"sources":[{"id":"source.frontier.arxiv-2607-20098","title":"arXiv OAI-PMH record arXiv:2607.20098: Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20098&metadataPrefix=arXiv"},{"id":"arxiv:2607.20098","title":"arXiv:2607.20098","url":"https://arxiv.org/abs/2607.20098"}],"status":"frontier","summary":"arXiv:2607.20098 \"Negative eigenvalue estimates for polyharmonic Schrödinger operators with measure-potentials: the subcritical case\" (CC BY 4.0, submitted 2026-07-22) reports: \"In terms of this function, we obtain two-sided estimates for the distribution function of the negative eigenvalues, and derive a sufficient condition and a necessary condition for the discreteness of the negative spectrum.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-20063","kind":"claim","label":"Null distance on cosmological spacetimes and monotone convergence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-20063"]},"sources":[{"id":"source.frontier.arxiv-2607-20063","title":"arXiv OAI-PMH record arXiv:2607.20063: Null distance on cosmological spacetimes and monotone convergence","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.20063&metadataPrefix=arXiv"},{"id":"arxiv:2607.20063","title":"arXiv:2607.20063","url":"https://arxiv.org/abs/2607.20063"}],"status":"frontier","summary":"arXiv:2607.20063 \"Null distance on cosmological spacetimes and monotone convergence\" (CC BY 4.0, submitted 2026-07-22) reports: \"Finally, we prove that causally-null compactifiable spacetimes satisfying a mild causal accessibility condition are causally-null, and relate the causally-null distance induced by the limit distance with the null distance induced by the (possibly non-smooth) limit metric tensor.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19946","kind":"claim","label":"The chromatic number of Euclidean space with dense color classes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-19946"]},"sources":[{"id":"source.frontier.arxiv-2607-19946","title":"arXiv OAI-PMH record arXiv:2607.19946: The chromatic number of Euclidean space with dense color classes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19946&metadataPrefix=arXiv"},{"id":"arxiv:2607.19946","title":"arXiv:2607.19946","url":"https://arxiv.org/abs/2607.19946"}],"status":"frontier","summary":"arXiv:2607.19946 \"The chromatic number of Euclidean space with dense color classes\" (CC BY 4.0, submitted 2026-07-22) reports: \"In arbitrary dimension, we show that $nχ(\\mathbb{R}^n)+1$ colors suffice, where $χ(\\mathbb{R}^n)$ denotes the chromatic number of $\\mathbb{R}^n$ in the standard formulation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19654","kind":"claim","label":"Derived representation schemes with arbitrary coefficients and associative smoothness","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-19654"]},"sources":[{"id":"source.frontier.arxiv-2607-19654","title":"arXiv OAI-PMH record arXiv:2607.19654: Derived representation schemes with arbitrary coefficients and associative smoothness","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19654&metadataPrefix=arXiv"},{"id":"arxiv:2607.19654","title":"arXiv:2607.19654","url":"https://arxiv.org/abs/2607.19654"}],"status":"frontier","summary":"arXiv:2607.19654 \"Derived representation schemes with arbitrary coefficients and associative smoothness\" (CC BY 4.0, submitted 2026-07-22) reports: \"We prove that the higher representation homology of a finitely generated formally smooth algebra with arbitrary finite-dimensional coefficients vanishes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-13855","kind":"claim","label":"Inferentialist Game Semantics (Extended Abstract)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-22","source_ids":["source.frontier.arxiv-2607-13855"]},"sources":[{"id":"source.frontier.arxiv-2607-13855","title":"arXiv OAI-PMH record arXiv:2607.13855: Inferentialist Game Semantics (Extended Abstract)","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.13855&metadataPrefix=arXiv"},{"id":"arxiv:2607.13855","title":"arXiv:2607.13855","url":"https://arxiv.org/abs/2607.13855"}],"status":"frontier","summary":"arXiv:2607.13855 \"Inferentialist Game Semantics (Extended Abstract)\" (CC BY 4.0, submitted 2026-07-22) reports: \"We establish a fully abstract correlation between B-eS and Hyland-Ong game semantics, employing techniques similar to those used by Sandqvist to give a sound and complete B-eS for intuitionistic propositional logic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19285","kind":"claim","label":"Compactification of the fifth Painlevé foliation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19285"]},"sources":[{"id":"source.frontier.arxiv-2607-19285","title":"arXiv OAI-PMH record arXiv:2607.19285: Compactification of the fifth Painlevé foliation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19285&metadataPrefix=arXiv"},{"id":"arxiv:2607.19285","title":"arXiv:2607.19285","url":"https://arxiv.org/abs/2607.19285"}],"status":"frontier","summary":"arXiv:2607.19285 \"Compactification of the fifth Painlevé foliation\" (CC0 1.0, submitted 2026-07-21) reports: \"In particular, we find, for each boundary component, a first integral of the Hamiltonian vector field, providing an explicit description of the foliation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19272","kind":"claim","label":"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19272"]},"sources":[{"id":"source.frontier.arxiv-2607-19272","title":"arXiv OAI-PMH record arXiv:2607.19272: From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19272&metadataPrefix=arXiv"},{"id":"arxiv:2607.19272","title":"arXiv:2607.19272","url":"https://arxiv.org/abs/2607.19272"}],"status":"frontier","summary":"arXiv:2607.19272 \"From zero solutions with partially bounded supports to solvability and Runge approximation for partial differential equations\" (CC BY 4.0, submitted 2026-07-21) reports: \"In this article, we establish the existence of smooth zero solutions with partially bounded supports for a broad class of constant coefficient partial differential operators.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19233","kind":"claim","label":"Vortex-sheet desingularization for three-dimensional ideal fluids","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19233"]},"sources":[{"id":"source.frontier.arxiv-2607-19233","title":"arXiv OAI-PMH record arXiv:2607.19233: Vortex-sheet desingularization for three-dimensional ideal fluids","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19233&metadataPrefix=arXiv"},{"id":"arxiv:2607.19233","title":"arXiv:2607.19233","url":"https://arxiv.org/abs/2607.19233"}],"status":"frontier","summary":"arXiv:2607.19233 \"Vortex-sheet desingularization for three-dimensional ideal fluids\" (CC BY 4.0, submitted 2026-07-21) reports: \"We prove a desingularization theorem for analytic vortex sheets of the 3D incompressible Euler equations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19188","kind":"claim","label":"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19188"]},"sources":[{"id":"source.frontier.arxiv-2607-19188","title":"arXiv OAI-PMH record arXiv:2607.19188: Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19188&metadataPrefix=arXiv"},{"id":"arxiv:2607.19188","title":"arXiv:2607.19188","url":"https://arxiv.org/abs/2607.19188"}],"status":"frontier","summary":"arXiv:2607.19188 \"Numerical methods for Langevin-type SPDE: an implicit Milstein approach and multilevel Monte Carlo techniques\" (CC BY 4.0, submitted 2026-07-21) reports: \"Through the Fourier analysis of the mean-square stability and convergence, we derive explicit conditions on the coefficients under which the scheme is stable, jointly with explicit convergence rates in terms of the discretization parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-19080","kind":"claim","label":"The Influence Function of Transport-based Quantiles","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-19080"]},"sources":[{"id":"source.frontier.arxiv-2607-19080","title":"arXiv OAI-PMH record arXiv:2607.19080: The Influence Function of Transport-based Quantiles","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.19080&metadataPrefix=arXiv"},{"id":"arxiv:2607.19080","title":"arXiv:2607.19080","url":"https://arxiv.org/abs/2607.19080"}],"status":"frontier","summary":"arXiv:2607.19080 \"The Influence Function of Transport-based Quantiles\" (CC BY 4.0, submitted 2026-07-21) reports: \"For the Huber contamination $P_t=(1-t)P+tδ_{x_0}$, we prove that the first-order limit $\\mathbf{I}(x_0;\\mathbf{Q}_P(z)) := \\lim_{t\\downarrow 0} [\\mathbf{Q}_{(1-t)P+tδ_{x_0}}(z)-\\mathbf{Q}_P(z)]/t$ exists whenever $x_0\\ne \\mathbf{Q}_P(z)$ and characterize it uniquely.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18942","kind":"claim","label":"Bounded elementary extensions of trees with unbounded paths","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-18942"]},"sources":[{"id":"source.frontier.arxiv-2607-18942","title":"arXiv OAI-PMH record arXiv:2607.18942: Bounded elementary extensions of trees with unbounded paths","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18942&metadataPrefix=arXiv"},{"id":"arxiv:2607.18942","title":"arXiv:2607.18942","url":"https://arxiv.org/abs/2607.18942"}],"status":"frontier","summary":"arXiv:2607.18942 \"Bounded elementary extensions of trees with unbounded paths\" (CC BY 4.0, submitted 2026-07-21) reports: \"We identify a sufficient condition under which certain trees that are not bounded, can be elementarily embedded in trees that are bounded.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"formal","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-18781","kind":"claim","label":"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-18781"]},"sources":[{"id":"source.frontier.arxiv-2607-18781","title":"arXiv OAI-PMH record arXiv:2607.18781: Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.18781&metadataPrefix=arXiv"},{"id":"arxiv:2607.18781","title":"arXiv:2607.18781","url":"https://arxiv.org/abs/2607.18781"}],"status":"frontier","summary":"arXiv:2607.18781 \"Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization\" (CC BY 4.0, submitted 2026-07-21) reports: \"We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15029","kind":"claim","label":"Towards realistic large random models of labeled transition systems and their 0-1 laws","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-21","source_ids":["source.frontier.arxiv-2607-15029"]},"sources":[{"id":"source.frontier.arxiv-2607-15029","title":"arXiv OAI-PMH record arXiv:2607.15029: Towards realistic large random models of labeled transition systems and their 0-1 laws","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15029&metadataPrefix=arXiv"},{"id":"arxiv:2607.15029","title":"arXiv:2607.15029","url":"https://arxiv.org/abs/2607.15029"}],"status":"frontier","summary":"arXiv:2607.15029 \"Towards realistic large random models of labeled transition systems and their 0-1 laws\" (CC BY 4.0, submitted 2026-07-21) reports: \"We show that, depending on the precise model, as the size grows to infinity we either have a convergence law (for every formula, the probability that it holds converges to a limit) or a 0-1 law (...and this limit is 0 or 1).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-16747","kind":"claim","label":"More on the Boolean Prime Ideal Theorem","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-18","source_ids":["source.frontier.arxiv-2607-16747"]},"sources":[{"id":"source.frontier.arxiv-2607-16747","title":"arXiv OAI-PMH record arXiv:2607.16747: More on the Boolean Prime Ideal Theorem","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.16747&metadataPrefix=arXiv"},{"id":"arxiv:2607.16747","title":"arXiv:2607.16747","url":"https://arxiv.org/abs/2607.16747"}],"status":"frontier","summary":"arXiv:2607.16747 \"More on the Boolean Prime Ideal Theorem\" (CC BY 4.0, submitted 2026-07-18) reports: \"We prove the consistency of Zermelo--Fraenkel set theory with the Axiom of Dependent Choices, no Vitali sets and a large fragment of the Boolean Prime Ideal Theorem.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15958","kind":"claim","label":"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.arxiv-2607-15958"]},"sources":[{"id":"source.frontier.arxiv-2607-15958","title":"arXiv OAI-PMH record arXiv:2607.15958: Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15958&metadataPrefix=arXiv"},{"id":"arxiv:2607.15958","title":"arXiv:2607.15958","url":"https://arxiv.org/abs/2607.15958"}],"status":"frontier","summary":"arXiv:2607.15958 \"Logical Metatheorems for Abstract Spaces axiomatized in Positive Bounded Logic II: Metric spaces and the model-theoretic uniformity principle\" (CC BY 4.0, submitted 2026-07-17) reports: \"In particular, we establish uniform bound extraction theorems for our generalized framework for $\\forall\\exists$-sentences whose matrix is the negation of (an embedding of) a formula in positive bounded logic, whose proofs use saturation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-15664","kind":"claim","label":"Semantics for the minimal well-determined logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.arxiv-2607-15664"]},"sources":[{"id":"source.frontier.arxiv-2607-15664","title":"arXiv OAI-PMH record arXiv:2607.15664: Semantics for the minimal well-determined logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.15664&metadataPrefix=arXiv"},{"id":"arxiv:2607.15664","title":"arXiv:2607.15664","url":"https://arxiv.org/abs/2607.15664"}],"status":"frontier","summary":"arXiv:2607.15664 \"Semantics for the minimal well-determined logic\" (CC0 1.0, submitted 2026-07-17) reports: \"As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"roots","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2604-22459","kind":"claim","label":"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-04-24","source_ids":["source.frontier.arxiv-2604-22459"]},"sources":[{"id":"source.frontier.arxiv-2604-22459","title":"arXiv OAI-PMH record arXiv:2604.22459: Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2604.22459&metadataPrefix=arXiv"},{"id":"arxiv:2604.22459","title":"arXiv:2604.22459","url":"https://arxiv.org/abs/2604.22459"},{"id":"doi:10.24963/kr.2026/41","title":"doi:10.24963/kr.2026/41","url":"https://doi.org/10.24963/kr.2026/41"}],"status":"frontier","summary":"arXiv:2604.22459 \"Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic\" (CC BY 4.0, submitted 2026-04-24) reports: \"In particular, we identify several fragments of our logic where satisfiability is decidable in polynomial time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ecot-70052","kind":"claim","label":"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-15","source_ids":["source.frontier.doi-10-1111-ecot-70052"]},"sources":[{"id":"source.frontier.doi-10-1111-ecot-70052","title":"Crossref record doi:10.1111/ecot.70052: Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition","url":"https://api.crossref.org/works/10.1111/ecot.70052"},{"id":"doi:10.1111/ecot.70052","title":"doi:10.1111/ecot.70052","url":"https://doi.org/10.1111/ecot.70052"}],"status":"frontier","summary":"doi:10.1111/ecot.70052 \"Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition\" (CC BY 4.0, published 2026-10-15) reports: \"The findings suggest that script reforms do not deliver aggregate literacy improvements but have significant distributional consequences and may heighten ethnolinguistic divisions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70333","kind":"claim","label":"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-15","source_ids":["source.frontier.doi-10-1002-qj-70333"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70333","title":"Crossref record doi:10.1002/qj.70333: Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022","url":"https://api.crossref.org/works/10.1002/qj.70333"},{"id":"doi:10.1002/qj.70333","title":"doi:10.1002/qj.70333","url":"https://doi.org/10.1002/qj.70333"}],"status":"frontier","summary":"doi:10.1002/qj.70333 \"Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022\" (CC BY 4.0, published 2026-10-15) reports: \"Our results demonstrate that a combined evaluation of these environmental characteristics serves as an effective diagnostic indicator for QBPS occurrences.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pwat-0000557","kind":"claim","label":"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1371-journal-pwat-0000557"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pwat-0000557","title":"Crossref record doi:10.1371/journal.pwat.0000557: Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon","url":"https://api.crossref.org/works/10.1371/journal.pwat.0000557"},{"id":"doi:10.1371/journal.pwat.0000557","title":"doi:10.1371/journal.pwat.0000557","url":"https://doi.org/10.1371/journal.pwat.0000557"}],"status":"frontier","summary":"doi:10.1371/journal.pwat.0000557 \"Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon\" (CC BY 4.0, published 2026-10-14) reports: \"Our results show that long-read sequencing of the 18S rRNA gene can capture eukaryotic diversity and resolve potentially harmful taxa.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-medu-70340","kind":"claim","label":"Health equity is the goal of medical education: Implications for assessment validity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1111-medu-70340"]},"sources":[{"id":"source.frontier.doi-10-1111-medu-70340","title":"Crossref record doi:10.1111/medu.70340: Health equity is the goal of medical education: Implications for assessment validity","url":"https://api.crossref.org/works/10.1111/medu.70340"},{"id":"doi:10.1111/medu.70340","title":"doi:10.1111/medu.70340","url":"https://doi.org/10.1111/medu.70340"}],"status":"frontier","summary":"doi:10.1111/medu.70340 \"Health equity is the goal of medical education: Implications for assessment validity\" (CC BY 4.0, published 2026-10-14) reports: \"Drawing on scholarship related to assessment validity, health equity and social justice, we identify conceptual and practical challenges associated with foregrounding health equity as a central component of assessment validity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124622","kind":"claim","label":"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.doi-10-1029-2026gl124622"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124622","title":"Crossref record doi:10.1029/2026gl124622: Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simu","url":"https://api.crossref.org/works/10.1029/2026gl124622"},{"id":"doi:10.1029/2026gl124622","title":"doi:10.1029/2026gl124622","url":"https://doi.org/10.1029/2026gl124622"}],"status":"frontier","summary":"doi:10.1029/2026gl124622 \"Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simulations and Physics‐Based Hydrologic Models\" (CC BY 4.0, published 2026-10-14) reports: \"These findings suggest that flood risk communication under climate warming should distinguish broad climate‐driven tendencies from uncertain local responses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-15351-2373-8456-1235","kind":"claim","label":"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-15351-2373-8456-1235"]},"sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1235","title":"Crossref record doi:10.15351/2373-8456.1235: Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh","url":"https://api.crossref.org/works/10.15351/2373-8456.1235"},{"id":"doi:10.15351/2373-8456.1235","title":"doi:10.15351/2373-8456.1235","url":"https://doi.org/10.15351/2373-8456.1235"}],"status":"frontier","summary":"doi:10.15351/2373-8456.1235 \"Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh\" (CC BY 4.0, published 2026-10-13) reports: \"The findings suggest that with science-based management, ecosystem restoration, and inclusive governance, Bangladesh’s Blue Economy can drive climate-resilient growth, enhance biodiversity conservation, and secure intergenerational equity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-15351-2373-8456-1216","kind":"claim","label":"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-15351-2373-8456-1216"]},"sources":[{"id":"source.frontier.doi-10-15351-2373-8456-1216","title":"Crossref record doi:10.15351/2373-8456.1216: Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review","url":"https://api.crossref.org/works/10.15351/2373-8456.1216"},{"id":"doi:10.15351/2373-8456.1216","title":"doi:10.15351/2373-8456.1216","url":"https://doi.org/10.15351/2373-8456.1216"}],"status":"frontier","summary":"doi:10.15351/2373-8456.1216 \"Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review\" (CC BY 4.0, published 2026-10-13) reports: \"The results suggest that South America and Africa appear to have minimal MPA research and collaboration networks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl125301","kind":"claim","label":"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.doi-10-1029-2026gl125301"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl125301","title":"Crossref record doi:10.1029/2026gl125301: Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands","url":"https://api.crossref.org/works/10.1029/2026gl125301"},{"id":"doi:10.1029/2026gl125301","title":"doi:10.1029/2026gl125301","url":"https://doi.org/10.1029/2026gl125301"}],"status":"frontier","summary":"doi:10.1029/2026gl125301 \"Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands\" (CC BY 4.0, published 2026-10-13) reports: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-21425-fob-19-142560","kind":"claim","label":"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-21425-fob-19-142560"]},"sources":[{"id":"source.frontier.doi-10-21425-fob-19-142560","title":"Crossref record doi:10.21425/fob.19.142560: Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas","url":"https://api.crossref.org/works/10.21425/fob.19.142560"},{"id":"doi:10.21425/fob.19.142560","title":"doi:10.21425/fob.19.142560","url":"https://doi.org/10.21425/fob.19.142560"}],"status":"frontier","summary":"doi:10.21425/fob.19.142560 \"Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas\" (CC BY 4.0, published 2026-10-12) reports: \"We found that mean phylogenetic distance (MPD) exhibited non-linear relationships with latitude, and standardized phylogenetic diversity (PD) showed a weak variation with latitude, with both peaking in the hyper-arid core of the Atacama Desert.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001044","kind":"claim","label":"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001044"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001044","title":"Crossref record doi:10.1371/journal.pclm.0001044: Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001044"},{"id":"doi:10.1371/journal.pclm.0001044","title":"doi:10.1371/journal.pclm.0001044","url":"https://doi.org/10.1371/journal.pclm.0001044"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001044 \"Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)\" (CC BY 4.0, published 2026-10-12) reports: \"We found a decadal warming trend of 0.29°C at both locations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000886","kind":"claim","label":"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000886"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000886","title":"Crossref record doi:10.1371/journal.pclm.0000886: How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000886"},{"id":"doi:10.1371/journal.pclm.0000886","title":"doi:10.1371/journal.pclm.0000886","url":"https://doi.org/10.1371/journal.pclm.0000886"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000886 \"How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana\" (CC BY 4.0, published 2026-10-12) reports: \"The findings show that farmers’ education, access to credit, extension services, and perceived drought significantly influence both the likelihood and intensity of CSAT adoption.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1075-consl-25020-lia","kind":"claim","label":"When ‘John broke up Mary’ becomes acceptable","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.doi-10-1075-consl-25020-lia"]},"sources":[{"id":"source.frontier.doi-10-1075-consl-25020-lia","title":"Crossref record doi:10.1075/consl.25020.lia: When ‘John broke up Mary’ becomes acceptable","url":"https://api.crossref.org/works/10.1075/consl.25020.lia"},{"id":"doi:10.1075/consl.25020.lia","title":"doi:10.1075/consl.25020.lia","url":"https://doi.org/10.1075/consl.25020.lia"}],"status":"frontier","summary":"doi:10.1075/consl.25020.lia \"When ‘John broke up Mary’ becomes acceptable\" (CC BY 4.0, published 2026-10-12) reports: \"These findings show that argument structure representations can be shaped by usage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-hydro-2026-040","kind":"claim","label":"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-10","source_ids":["source.frontier.doi-10-2166-hydro-2026-040"]},"sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-040","title":"Crossref record doi:10.2166/hydro.2026.040: Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change","url":"https://api.crossref.org/works/10.2166/hydro.2026.040"},{"id":"doi:10.2166/hydro.2026.040","title":"doi:10.2166/hydro.2026.040","url":"https://doi.org/10.2166/hydro.2026.040"}],"status":"frontier","summary":"doi:10.2166/hydro.2026.040 \"Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change\" (CC BY 4.0, published 2026-10-10) reports: \"The results indicate that, under the drier IPSL-CM5A-LR climate scenario, the failure probability increases significantly compared with that under the wetter BNU-ESM scenario, with the projected failure occurring 23 years earlier than under the historical baseline conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-lol2-70186","kind":"claim","label":"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.doi-10-1002-lol2-70186"]},"sources":[{"id":"source.frontier.doi-10-1002-lol2-70186","title":"Crossref record doi:10.1002/lol2.70186: Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers","url":"https://api.crossref.org/works/10.1002/lol2.70186"},{"id":"doi:10.1002/lol2.70186","title":"doi:10.1002/lol2.70186","url":"https://doi.org/10.1002/lol2.70186"}],"status":"frontier","summary":"doi:10.1002/lol2.70186 \"Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers\" (CC BY 4.0, published 2026-10-09) reports: \"We identify extensive subsurface sediment plumes from marine‐terminating glaciers which are undetectable using remote sensing approaches and underrepresented in fjord sediment‐core reconstructions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124411","kind":"claim","label":"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.doi-10-1029-2026gl124411"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124411","title":"Crossref record doi:10.1029/2026gl124411: Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing","url":"https://api.crossref.org/works/10.1029/2026gl124411"},{"id":"doi:10.1029/2026gl124411","title":"doi:10.1029/2026gl124411","url":"https://doi.org/10.1029/2026gl124411"}],"status":"frontier","summary":"doi:10.1029/2026gl124411 \"Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing\" (CC BY 4.0, published 2026-10-08) reports: \"The results showed that the too‐intense localized precipitation frequently produced in km‐scale models, known as “popcorn‐like” precipitation, weakens as resolution increases.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70629","kind":"claim","label":"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.doi-10-1002-joc-70629"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70629","title":"Crossref record doi:10.1002/joc.70629: Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections","url":"https://api.crossref.org/works/10.1002/joc.70629"},{"id":"doi:10.1002/joc.70629","title":"doi:10.1002/joc.70629","url":"https://doi.org/10.1002/joc.70629"}],"status":"frontier","summary":"doi:10.1002/joc.70629 \"Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections\" (CC BY 4.0, published 2026-10-08) reports: \"The results indicate a significant increase in the mean rainfall intensity and a longer duration of dry periods (+4 days/decade), suggesting greater irregularity in the regional precipitation regime.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9566-70277","kind":"claim","label":"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1111-1467-9566-70277"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70277","title":"Crossref record doi:10.1111/1467-9566.70277: The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception","url":"https://api.crossref.org/works/10.1111/1467-9566.70277"},{"id":"doi:10.1111/1467-9566.70277","title":"doi:10.1111/1467-9566.70277","url":"https://doi.org/10.1111/1467-9566.70277"}],"status":"frontier","summary":"doi:10.1111/1467-9566.70277 \"The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception\" (CC BY 4.0, published 2026-10-06) reports: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jpln-70129","kind":"claim","label":"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-jpln-70129"]},"sources":[{"id":"source.frontier.doi-10-1002-jpln-70129","title":"Crossref record doi:10.1002/jpln.70129: Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps","url":"https://api.crossref.org/works/10.1002/jpln.70129"},{"id":"doi:10.1002/jpln.70129","title":"doi:10.1002/jpln.70129","url":"https://doi.org/10.1002/jpln.70129"}],"status":"frontier","summary":"doi:10.1002/jpln.70129 \"Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps\" (CC BY 4.0, published 2026-10-06) reports: \"Our findings highlight the vulnerability of sites dominated by thick organic layers to climate‐driven water stress.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70613","kind":"claim","label":"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-joc-70613"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70613","title":"Crossref record doi:10.1002/joc.70613: Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia","url":"https://api.crossref.org/works/10.1002/joc.70613"},{"id":"doi:10.1002/joc.70613","title":"doi:10.1002/joc.70613","url":"https://doi.org/10.1002/joc.70613"}],"status":"frontier","summary":"doi:10.1002/joc.70613 \"Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia\" (CC BY 4.0, published 2026-10-06) reports: \"These findings demonstrate that dynamical downscaling substantially reduces large‐scale GCM biases and provides a more consistent representation of precipitation in a region of complex orography and limited observational data availability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70605","kind":"claim","label":"Climate Change Projections for Mexico in the 21st Century","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.doi-10-1002-joc-70605"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70605","title":"Crossref record doi:10.1002/joc.70605: Climate Change Projections for Mexico in the 21st Century","url":"https://api.crossref.org/works/10.1002/joc.70605"},{"id":"doi:10.1002/joc.70605","title":"doi:10.1002/joc.70605","url":"https://doi.org/10.1002/joc.70605"}],"status":"frontier","summary":"doi:10.1002/joc.70605 \"Climate Change Projections for Mexico in the 21st Century\" (CC BY 4.0, published 2026-10-06) reports: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3176-arch-2026-2-03","kind":"claim","label":"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-05","source_ids":["source.frontier.doi-10-3176-arch-2026-2-03"]},"sources":[{"id":"source.frontier.doi-10-3176-arch-2026-2-03","title":"Crossref record doi:10.3176/arch.2026.2.03: Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from bird","url":"https://api.crossref.org/works/10.3176/arch.2026.2.03"},{"id":"doi:10.3176/arch.2026.2.03","title":"doi:10.3176/arch.2026.2.03","url":"https://doi.org/10.3176/arch.2026.2.03"}],"status":"frontier","summary":"doi:10.3176/arch.2026.2.03 \"Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from birds, fish, and mammals (c. 800 cal BC–1400 cal AD)\" (CC BY 4.0, published 2026-10-05) reports: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-580","kind":"claim","label":"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.doi-10-2166-wcc-2026-580"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-580","title":"Crossref record doi:10.2166/wcc.2026.580: Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of So","url":"https://api.crossref.org/works/10.2166/wcc.2026.580"},{"id":"doi:10.2166/wcc.2026.580","title":"doi:10.2166/wcc.2026.580","url":"https://doi.org/10.2166/wcc.2026.580"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.580 \"Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of Southern Africa\" (CC BY 4.0, published 2026-10-02) reports: \"El Niño seasons were associated with significantly greater concurrent stress (p&lt; 0.001).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ijop-70275","kind":"claim","label":"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.doi-10-1002-ijop-70275"]},"sources":[{"id":"source.frontier.doi-10-1002-ijop-70275","title":"Crossref record doi:10.1002/ijop.70275: To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields","url":"https://api.crossref.org/works/10.1002/ijop.70275"},{"id":"doi:10.1002/ijop.70275","title":"doi:10.1002/ijop.70275","url":"https://doi.org/10.1002/ijop.70275"}],"status":"frontier","summary":"doi:10.1002/ijop.70275 \"To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields From 1990 to 2020\" (CC BY 4.0, published 2026-10-02) reports: \"The results indicate that cultural awareness is more prominent in journals focused on culture, international or local issues; while remaining almost entirely absent in journals focused on theory, reviews and business.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-popecon-10-e186220","kind":"claim","label":"Well-Being Among Married Couples: The Role of Time Allocation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.doi-10-3897-popecon-10-e186220"]},"sources":[{"id":"source.frontier.doi-10-3897-popecon-10-e186220","title":"Crossref record doi:10.3897/popecon.10.e186220: Well-Being Among Married Couples: The Role of Time Allocation","url":"https://api.crossref.org/works/10.3897/popecon.10.e186220"},{"id":"doi:10.3897/popecon.10.e186220","title":"doi:10.3897/popecon.10.e186220","url":"https://doi.org/10.3897/popecon.10.e186220"}],"status":"frontier","summary":"doi:10.3897/popecon.10.e186220 \"Well-Being Among Married Couples: The Role of Time Allocation\" (CC BY 4.0, published 2026-10-01) reports: \"The results demonstrate a robust and statistically significant relationship between wellbeing and the time‑allocation decisions made by individuals and their partners.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-507","kind":"claim","label":"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-01","source_ids":["source.frontier.doi-10-2166-wcc-2026-507"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-507","title":"Crossref record doi:10.2166/wcc.2026.507: Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices","url":"https://api.crossref.org/works/10.2166/wcc.2026.507"},{"id":"doi:10.2166/wcc.2026.507","title":"doi:10.2166/wcc.2026.507","url":"https://doi.org/10.2166/wcc.2026.507"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.507 \"Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices\" (CC BY 4.0, published 2026-10-01) reports: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e183393","kind":"claim","label":"Stock market reaction to fraud outbreaks in the Indian banking sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e183393"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e183393","title":"Crossref record doi:10.3897/brics-econ.7.e183393: Stock market reaction to fraud outbreaks in the Indian banking sector","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e183393"},{"id":"doi:10.3897/brics-econ.7.e183393","title":"doi:10.3897/brics-econ.7.e183393","url":"https://doi.org/10.3897/brics-econ.7.e183393"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e183393 \"Stock market reaction to fraud outbreaks in the Indian banking sector\" (CC BY 4.0, published 2026-09-30) reports: \"Additionally, the results show that investment shifts occur within both public and private bank segments following fraud disclosures.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026785","kind":"claim","label":"Does the listener care? Emotional resonance and connection in the age of algorithmic music","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-38159-ehass-2026785"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026785","title":"Crossref record doi:10.38159/ehass.2026785: Does the listener care? Emotional resonance and connection in the age of algorithmic music","url":"https://api.crossref.org/works/10.38159/ehass.2026785"},{"id":"doi:10.38159/ehass.2026785","title":"doi:10.38159/ehass.2026785","url":"https://doi.org/10.38159/ehass.2026785"}],"status":"frontier","summary":"doi:10.38159/ehass.2026785 \"Does the listener care? Emotional resonance and connection in the age of algorithmic music\" (CC BY 4.0, published 2026-09-30) reports: \"The findings showed that explicit knowledge of AI authorship led to a directional decline in listener emotional resonance, even where the tracks were sonically indistinguishable.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124090","kind":"claim","label":"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1029-2026gl124090"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124090","title":"Crossref record doi:10.1029/2026gl124090: How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?","url":"https://api.crossref.org/works/10.1029/2026gl124090"},{"id":"doi:10.1029/2026gl124090","title":"doi:10.1029/2026gl124090","url":"https://doi.org/10.1029/2026gl124090"}],"status":"frontier","summary":"doi:10.1029/2026gl124090 \"How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?\" (CC BY 4.0, published 2026-09-30) reports: \"Our analysis indicates SWOT can meaningfully support irrigation canal water monitoring across much of Asia's most intensively irrigated regions and around the world.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-pei3-70207","kind":"claim","label":"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-pei3-70207"]},"sources":[{"id":"source.frontier.doi-10-1002-pei3-70207","title":"Crossref record doi:10.1002/pei3.70207: Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment","url":"https://api.crossref.org/works/10.1002/pei3.70207"},{"id":"doi:10.1002/pei3.70207","title":"doi:10.1002/pei3.70207","url":"https://doi.org/10.1002/pei3.70207"}],"status":"frontier","summary":"doi:10.1002/pei3.70207 \"Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment\" (CC BY 4.0, published 2026-09-30) reports: \"Recurrent droughts accounted for approximately 60% of crop yield losses, food insecurity increased by an estimated 2.3% annually, and a 1°C rise in temperature was associated with a 10% reduction in major staple crop production.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-fea2-70077","kind":"claim","label":"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-fea2-70077"]},"sources":[{"id":"source.frontier.doi-10-1002-fea2-70077","title":"Crossref record doi:10.1002/fea2.70077: Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women","url":"https://api.crossref.org/works/10.1002/fea2.70077"},{"id":"doi:10.1002/fea2.70077","title":"doi:10.1002/fea2.70077","url":"https://doi.org/10.1002/fea2.70077"}],"status":"frontier","summary":"doi:10.1002/fea2.70077 \"Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women\" (CC BY 4.0, published 2026-09-30) reports: \"The analysis reveals how women's labor is organized through moral economies, gendered spatialities, and temporal dispossession, producing forms of exhaustion that are routinized and affectively sanctioned.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eet-70146","kind":"claim","label":"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-eet-70146"]},"sources":[{"id":"source.frontier.doi-10-1002-eet-70146","title":"Crossref record doi:10.1002/eet.70146: Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy","url":"https://api.crossref.org/works/10.1002/eet.70146"},{"id":"doi:10.1002/eet.70146","title":"doi:10.1002/eet.70146","url":"https://doi.org/10.1002/eet.70146"}],"status":"frontier","summary":"doi:10.1002/eet.70146 \"Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy\" (CC BY 4.0, published 2026-09-30) reports: \"This study examines how three survey‐derived governance role orientations—governmental, civic, and industry‐and‐media orientations—and perceived climate policy governance quality are associated with two participation outcomes: institutional participation intention and climate‐related civic participation behavior.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eco-70279","kind":"claim","label":"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.doi-10-1002-eco-70279"]},"sources":[{"id":"source.frontier.doi-10-1002-eco-70279","title":"Crossref record doi:10.1002/eco.70279: Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests","url":"https://api.crossref.org/works/10.1002/eco.70279"},{"id":"doi:10.1002/eco.70279","title":"doi:10.1002/eco.70279","url":"https://doi.org/10.1002/eco.70279"}],"status":"frontier","summary":"doi:10.1002/eco.70279 \"Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests\" (CC BY 4.0, published 2026-09-30) reports: \"Our results indicate that water table levels were impacted by seasons, storms, precipitation and soil characteristics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124233","kind":"claim","label":"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1029-2026gl124233"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124233","title":"Crossref record doi:10.1029/2026gl124233: Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change","url":"https://api.crossref.org/works/10.1029/2026gl124233"},{"id":"doi:10.1029/2026gl124233","title":"doi:10.1029/2026gl124233","url":"https://doi.org/10.1029/2026gl124233"}],"status":"frontier","summary":"doi:10.1029/2026gl124233 \"Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change\" (CC BY 4.0, published 2026-09-29) reports: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gc013127","kind":"claim","label":"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1029-2026gc013127"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gc013127","title":"Crossref record doi:10.1029/2026gc013127: OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Perm","url":"https://api.crossref.org/works/10.1029/2026gc013127"},{"id":"doi:10.1029/2026gc013127","title":"doi:10.1029/2026gc013127","url":"https://doi.org/10.1029/2026gc013127"}],"status":"frontier","summary":"doi:10.1029/2026gc013127 \"OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Permian Mantle Activity Along North Gondwana\" (CC BY 4.0, published 2026-09-29) reports: \"Together with regional Permian plume‐affinity mafic magmatism, these data suggest sustained mantle heating beneath North Gondwana and a possible temporal and geodynamic link between Songduo Ocean closure and the development of younger Tethyan branches.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70320","kind":"claim","label":"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-29","source_ids":["source.frontier.doi-10-1002-qj-70320"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70320","title":"Crossref record doi:10.1002/qj.70320: Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain","url":"https://api.crossref.org/works/10.1002/qj.70320"},{"id":"doi:10.1002/qj.70320","title":"doi:10.1002/qj.70320","url":"https://doi.org/10.1002/qj.70320"}],"status":"frontier","summary":"doi:10.1002/qj.70320 \"Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain\" (CC BY 4.0, published 2026-09-29) reports: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-54929-2786-5738-2026-27-09-01","kind":"claim","label":"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-54929-2786-5738-2026-27-09-01"]},"sources":[{"id":"source.frontier.doi-10-54929-2786-5738-2026-27-09-01","title":"Crossref record doi:10.54929/2786-5738-2026-27-09-01: Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries","url":"https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"},{"id":"doi:10.54929/2786-5738-2026-27-09-01","title":"doi:10.54929/2786-5738-2026-27-09-01","url":"https://doi.org/10.54929/2786-5738-2026-27-09-01"}],"status":"frontier","summary":"doi:10.54929/2786-5738-2026-27-09-01 \"Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries\" (CC BY 4.0, published 2026-09-28) reports: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-erats-20261281","kind":"claim","label":"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-38159-erats-20261281"]},"sources":[{"id":"source.frontier.doi-10-38159-erats-20261281","title":"Crossref record doi:10.38159/erats.20261281: Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism","url":"https://api.crossref.org/works/10.38159/erats.20261281"},{"id":"doi:10.38159/erats.20261281","title":"doi:10.38159/erats.20261281","url":"https://doi.org/10.38159/erats.20261281"}],"status":"frontier","summary":"doi:10.38159/erats.20261281 \"Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism\" (CC BY 4.0, published 2026-09-28) reports: \"The findings reveal a departure from Western critiques which frame syncretic practices as theological compromise.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eco-70277","kind":"claim","label":"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.doi-10-1002-eco-70277"]},"sources":[{"id":"source.frontier.doi-10-1002-eco-70277","title":"Crossref record doi:10.1002/eco.70277: From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coast","url":"https://api.crossref.org/works/10.1002/eco.70277"},{"id":"doi:10.1002/eco.70277","title":"doi:10.1002/eco.70277","url":"https://doi.org/10.1002/eco.70277"}],"status":"frontier","summary":"doi:10.1002/eco.70277 \"From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coastal Woodland\" (CC BY 4.0, published 2026-09-28) reports: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-iroh-70046","kind":"claim","label":"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-27","source_ids":["source.frontier.doi-10-1002-iroh-70046"]},"sources":[{"id":"source.frontier.doi-10-1002-iroh-70046","title":"Crossref record doi:10.1002/iroh.70046: Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir","url":"https://api.crossref.org/works/10.1002/iroh.70046"},{"id":"doi:10.1002/iroh.70046","title":"doi:10.1002/iroh.70046","url":"https://doi.org/10.1002/iroh.70046"}],"status":"frontier","summary":"doi:10.1002/iroh.70046 \"Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir\" (CC BY 4.0, published 2026-09-27) reports: \"Overall, the wildfire was associated with detectable changes in limnological conditions and planktonic communities.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-erats-20261284","kind":"claim","label":"The irony of law and faith in corruption","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-26","source_ids":["source.frontier.doi-10-38159-erats-20261284"]},"sources":[{"id":"source.frontier.doi-10-38159-erats-20261284","title":"Crossref record doi:10.38159/erats.20261284: The irony of law and faith in corruption","url":"https://api.crossref.org/works/10.38159/erats.20261284"},{"id":"doi:10.38159/erats.20261284","title":"doi:10.38159/erats.20261284","url":"https://doi.org/10.38159/erats.20261284"}],"status":"frontier","summary":"doi:10.38159/erats.20261284 \"The irony of law and faith in corruption\" (CC BY 4.0, published 2026-09-26) reports: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ruso-70070","kind":"claim","label":"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-26","source_ids":["source.frontier.doi-10-1111-ruso-70070"]},"sources":[{"id":"source.frontier.doi-10-1111-ruso-70070","title":"Crossref record doi:10.1111/ruso.70070: Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities","url":"https://api.crossref.org/works/10.1111/ruso.70070"},{"id":"doi:10.1111/ruso.70070","title":"doi:10.1111/ruso.70070","url":"https://doi.org/10.1111/ruso.70070"}],"status":"frontier","summary":"doi:10.1111/ruso.70070 \"Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities\" (CC BY 4.0, published 2026-09-26) reports: \"Our findings indicate that future work should consider spatial inequality in the social safety net across graduations of rural–urban communities and whether gaps with big‐city metros are intensifying.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-200681","kind":"claim","label":"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-25","source_ids":["source.frontier.doi-10-3897-nhcm-3-200681"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-200681","title":"Crossref record doi:10.3897/nhcm.3.200681: Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study","url":"https://api.crossref.org/works/10.3897/nhcm.3.200681"},{"id":"doi:10.3897/nhcm.3.200681","title":"doi:10.3897/nhcm.3.200681","url":"https://doi.org/10.3897/nhcm.3.200681"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.200681 \"Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study\" (CC BY 4.0, published 2026-09-25) reports: \": This study demonstrates that high-throughput sequencing is feasible from invertebrate museum specimens preserved in formalin for decades and provides a practical protocol adaptable to a broad taxonomic range.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001005","kind":"claim","label":"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001005"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001005","title":"Crossref record doi:10.1371/journal.pclm.0001005: Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001005"},{"id":"doi:10.1371/journal.pclm.0001005","title":"doi:10.1371/journal.pclm.0001005","url":"https://doi.org/10.1371/journal.pclm.0001005"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001005 \"Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria\" (CC BY 4.0, published 2026-09-24) reports: \"The findings revealed a pronounced increase in the frequency and severity of heatwaves across northwestern Nigeria.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-moth-70148","kind":"claim","label":"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.doi-10-1111-moth-70148"]},"sources":[{"id":"source.frontier.doi-10-1111-moth-70148","title":"Crossref record doi:10.1111/moth.70148: On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion","url":"https://api.crossref.org/works/10.1111/moth.70148"},{"id":"doi:10.1111/moth.70148","title":"doi:10.1111/moth.70148","url":"https://doi.org/10.1111/moth.70148"}],"status":"frontier","summary":"doi:10.1111/moth.70148 \"On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion\" (CC BY 4.0, published 2026-09-24) reports: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-20267724","kind":"claim","label":"Leveraging community partnership: The case of Meraka Cultural Village","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.doi-10-38159-ehass-20267724"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-20267724","title":"Crossref record doi:10.38159/ehass.20267724: Leveraging community partnership: The case of Meraka Cultural Village","url":"https://api.crossref.org/works/10.38159/ehass.20267724"},{"id":"doi:10.38159/ehass.20267724","title":"doi:10.38159/ehass.20267724","url":"https://doi.org/10.38159/ehass.20267724"}],"status":"frontier","summary":"doi:10.38159/ehass.20267724 \"Leveraging community partnership: The case of Meraka Cultural Village\" (CC BY 4.0, published 2026-09-23) reports: \"The results indicate that Meraka is a community where members take back control of their lives and the wisdom of the older generation is celebrated, and partnerships between the university and the community are strengthened through respect and sharing.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124881","kind":"claim","label":"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.doi-10-1029-2026gl124881"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124881","title":"Crossref record doi:10.1029/2026gl124881: Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland","url":"https://api.crossref.org/works/10.1029/2026gl124881"},{"id":"doi:10.1029/2026gl124881","title":"doi:10.1029/2026gl124881","url":"https://doi.org/10.1029/2026gl124881"}],"status":"frontier","summary":"doi:10.1029/2026gl124881 \"Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland\" (CC BY 4.0, published 2026-09-23) reports: \"We establish a passive seismic approach exploiting naturally occurring crevassing events recorded with a dense seismic array to image the ice–bed interface without spatial interpolation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jh001578","kind":"claim","label":"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.doi-10-1029-2026jh001578"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jh001578","title":"Crossref record doi:10.1029/2026jh001578: Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location","url":"https://api.crossref.org/works/10.1029/2026jh001578"},{"id":"doi:10.1029/2026jh001578","title":"doi:10.1029/2026jh001578","url":"https://doi.org/10.1029/2026jh001578"}],"status":"frontier","summary":"doi:10.1029/2026jh001578 \"Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location\" (CC BY 4.0, published 2026-09-21) reports: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-gdj3-70104","kind":"claim","label":"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.doi-10-1002-gdj3-70104"]},"sources":[{"id":"source.frontier.doi-10-1002-gdj3-70104","title":"Crossref record doi:10.1002/gdj3.70104: Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China","url":"https://api.crossref.org/works/10.1002/gdj3.70104"},{"id":"doi:10.1002/gdj3.70104","title":"doi:10.1002/gdj3.70104","url":"https://doi.org/10.1002/gdj3.70104"}],"status":"frontier","summary":"doi:10.1002/gdj3.70104 \"Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China\" (CC BY 4.0, published 2026-09-21) reports: \"The results show that GPM IMERG tends to overestimate precipitation, and the peak time of precipitation is delayed by approximately 1 h.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122610","kind":"claim","label":"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.doi-10-1029-2026gl122610"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122610","title":"Crossref record doi:10.1029/2026gl122610: Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin","url":"https://api.crossref.org/works/10.1029/2026gl122610"},{"id":"doi:10.1029/2026gl122610","title":"doi:10.1029/2026gl122610","url":"https://doi.org/10.1029/2026gl122610"}],"status":"frontier","summary":"doi:10.1029/2026gl122610 \"Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin\" (CC BY 4.0, published 2026-09-18) reports: \"These results show that SWOT WSE assimilation improves discharge estimates under real‐world constraints, supporting water management in data‐sparse and transboundary basins globally.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70308","kind":"claim","label":"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.doi-10-1002-qj-70308"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70308","title":"Crossref record doi:10.1002/qj.70308: Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas","url":"https://api.crossref.org/works/10.1002/qj.70308"},{"id":"doi:10.1002/qj.70308","title":"doi:10.1002/qj.70308","url":"https://doi.org/10.1002/qj.70308"}],"status":"frontier","summary":"doi:10.1002/qj.70308 \"Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas\" (CC BY 4.0, published 2026-09-17) reports: \"In contrast, the WH‐WD and CH‐WD clusters are associated with upper‐level cyclonic anomalies characteristic of WDs, embedded within broader wave‐train‐like circulation anomalies that are consistent with previously reported North Atlantic Oscillation (NAO)–subtropical jet (STJ)–WD pathways.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-55730-1300-0632-4281","kind":"claim","label":"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.doi-10-55730-1300-0632-4281"]},"sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4281","title":"Crossref record doi:10.55730/1300-0632.4281: Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing","url":"https://api.crossref.org/works/10.55730/1300-0632.4281"},{"id":"doi:10.55730/1300-0632.4281","title":"doi:10.55730/1300-0632.4281","url":"https://doi.org/10.55730/1300-0632.4281"}],"status":"frontier","summary":"doi:10.55730/1300-0632.4281 \"Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing capacity\" (CC BY 4.0, published 2026-09-16) reports: \"The findings highlight that sliding mode–based control can significantly improve both energy efficiency and freezing capacity in household refrigeration systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-55730-1300-0632-4275","kind":"claim","label":"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.doi-10-55730-1300-0632-4275"]},"sources":[{"id":"source.frontier.doi-10-55730-1300-0632-4275","title":"Crossref record doi:10.55730/1300-0632.4275: Empowering edge intelligence through reparameterized lightweight transformers and distributed inference","url":"https://api.crossref.org/works/10.55730/1300-0632.4275"},{"id":"doi:10.55730/1300-0632.4275","title":"doi:10.55730/1300-0632.4275","url":"https://doi.org/10.55730/1300-0632.4275"}],"status":"frontier","summary":"doi:10.55730/1300-0632.4275 \"Empowering edge intelligence through reparameterized lightweight transformers and distributed inference\" (CC BY 4.0, published 2026-09-16) reports: \"Overall, our findings highlight that reparameterized transformers, coupled with adaptive distributed inference and ultra-low-precision execution, offer a compelling solution for real-time, on-device analytics in IoT and edge computing environments.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-eet-70139","kind":"claim","label":"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.doi-10-1002-eet-70139"]},"sources":[{"id":"source.frontier.doi-10-1002-eet-70139","title":"Crossref record doi:10.1002/eet.70139: After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours","url":"https://api.crossref.org/works/10.1002/eet.70139"},{"id":"doi:10.1002/eet.70139","title":"doi:10.1002/eet.70139","url":"https://doi.org/10.1002/eet.70139"}],"status":"frontier","summary":"doi:10.1002/eet.70139 \"After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours\" (CC BY 4.0, published 2026-09-14) reports: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jclp-70212","kind":"claim","label":"Distant and Distressed: Interpersonal Problems in Anxiety and Depression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.doi-10-1002-jclp-70212"]},"sources":[{"id":"source.frontier.doi-10-1002-jclp-70212","title":"Crossref record doi:10.1002/jclp.70212: Distant and Distressed: Interpersonal Problems in Anxiety and Depression","url":"https://api.crossref.org/works/10.1002/jclp.70212"},{"id":"doi:10.1002/jclp.70212","title":"doi:10.1002/jclp.70212","url":"https://doi.org/10.1002/jclp.70212"}],"status":"frontier","summary":"doi:10.1002/jclp.70212 \"Distant and Distressed: Interpersonal Problems in Anxiety and Depression\" (CC BY 4.0, published 2026-09-12) reports: \"As predicted, a cold‐submissive style was associated with greater comorbidity and chronicity, also after adjusting for demographics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-12944-cwe-21-2-3","kind":"claim","label":"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.doi-10-12944-cwe-21-2-3"]},"sources":[{"id":"source.frontier.doi-10-12944-cwe-21-2-3","title":"Crossref record doi:10.12944/cwe.21.2.3: Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss","url":"https://api.crossref.org/works/10.12944/cwe.21.2.3"},{"id":"doi:10.12944/cwe.21.2.3","title":"doi:10.12944/cwe.21.2.3","url":"https://doi.org/10.12944/cwe.21.2.3"}],"status":"frontier","summary":"doi:10.12944/cwe.21.2.3 \"Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss\" (CC BY 4.0, published 2026-09-10) reports: \"The analysis shows that hotspot vulnerability is highest where restricted-range endemism, habitat fragmentation, strong climatic exposure and limited adaptive capacity coincide.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-bse-71470","kind":"claim","label":"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.doi-10-1002-bse-71470"]},"sources":[{"id":"source.frontier.doi-10-1002-bse-71470","title":"Crossref record doi:10.1002/bse.71470: Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector","url":"https://api.crossref.org/works/10.1002/bse.71470"},{"id":"doi:10.1002/bse.71470","title":"doi:10.1002/bse.71470","url":"https://doi.org/10.1002/bse.71470"}],"status":"frontier","summary":"doi:10.1002/bse.71470 \"Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector\" (CC BY 4.0, published 2026-09-09) reports: \"Based on 41 semi‐structured interviews with representatives of 22 logistics companies in the Osnabrück region, we find that firms' resource configurations shape their capacity to perceive climate risks: Resource‐rich firms are more adept due to human resource slack, allowing them to process and document climate‐related sensory experiences and undertake anticipatory exercises.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000986","kind":"claim","label":"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-08","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000986"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000986","title":"Crossref record doi:10.1371/journal.pclm.0000986: Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000986"},{"id":"doi:10.1371/journal.pclm.0000986","title":"doi:10.1371/journal.pclm.0000986","url":"https://doi.org/10.1371/journal.pclm.0000986"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000986 \"Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins\" (CC BY 4.0, published 2026-09-08) reports: \"These findings highlight heightened vulnerability, as well as contrasting opportunities across the region, underscoring the urgent need for adaptive management strategies, such as enhancing hydropower system resilience, diversifying energy portfolios, and integrating renewable sources to mitigate climate risks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1752-1688-70151","kind":"claim","label":"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-07","source_ids":["source.frontier.doi-10-1111-1752-1688-70151"]},"sources":[{"id":"source.frontier.doi-10-1111-1752-1688-70151","title":"Crossref record doi:10.1111/1752-1688.70151: Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil","url":"https://api.crossref.org/works/10.1111/1752-1688.70151"},{"id":"doi:10.1111/1752-1688.70151","title":"doi:10.1111/1752-1688.70151","url":"https://doi.org/10.1111/1752-1688.70151"}],"status":"frontier","summary":"doi:10.1111/1752-1688.70151 \"Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil\" (CC BY 4.0, published 2026-09-07) reports: \"These findings highlight the need for continuous monitoring and adaptive water management strategies under increasing climate variability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jade-70048","kind":"claim","label":"A Visual Brainstorming Technique in Character Design: Braindrawing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.doi-10-1111-jade-70048"]},"sources":[{"id":"source.frontier.doi-10-1111-jade-70048","title":"Crossref record doi:10.1111/jade.70048: A Visual Brainstorming Technique in Character Design: Braindrawing","url":"https://api.crossref.org/works/10.1111/jade.70048"},{"id":"doi:10.1111/jade.70048","title":"doi:10.1111/jade.70048","url":"https://doi.org/10.1111/jade.70048"}],"status":"frontier","summary":"doi:10.1111/jade.70048 \"A Visual Brainstorming Technique in Character Design: Braindrawing\" (CC BY 4.0, published 2026-09-05) reports: \"The findings indicate that the braindrawing technique increases students' idea diversity, helps them overcome creative blocks and supports collaborative interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-lcrp-70059","kind":"claim","label":"Prison victimization and post‐release outcomes: A systematic review","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.doi-10-1111-lcrp-70059"]},"sources":[{"id":"source.frontier.doi-10-1111-lcrp-70059","title":"Crossref record doi:10.1111/lcrp.70059: Prison victimization and post‐release outcomes: A systematic review","url":"https://api.crossref.org/works/10.1111/lcrp.70059"},{"id":"doi:10.1111/lcrp.70059","title":"doi:10.1111/lcrp.70059","url":"https://doi.org/10.1111/lcrp.70059"}],"status":"frontier","summary":"doi:10.1111/lcrp.70059 \"Prison victimization and post‐release outcomes: A systematic review\" (CC BY 4.0, published 2026-09-04) reports: \"The results of this study indicate that trauma experienced while incarcerated is associated with greater risk of reoffending or other poor outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-77938","kind":"claim","label":"Load Distributing Metamaterials Via Discrete Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-04","source_ids":["source.frontier.doi-10-1002-adfm-77938"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-77938","title":"Crossref record doi:10.1002/adfm.77938: Load Distributing Metamaterials Via Discrete Optimization","url":"https://api.crossref.org/works/10.1002/adfm.77938"},{"id":"doi:10.1002/adfm.77938","title":"doi:10.1002/adfm.77938","url":"https://doi.org/10.1002/adfm.77938"}],"status":"frontier","summary":"doi:10.1002/adfm.77938 \"Load Distributing Metamaterials Via Discrete Optimization\" (CC BY 4.0, published 2026-09-04) reports: \"We demonstrate both single‐objective optimization for a prescribed indenter position and a multi‐objective formulation that enforces robust performance across multiple loading locations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e185197","kind":"claim","label":"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e185197"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e185197","title":"Crossref record doi:10.3897/brics-econ.7.e185197: Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e185197"},{"id":"doi:10.3897/brics-econ.7.e185197","title":"doi:10.3897/brics-econ.7.e185197","url":"https://doi.org/10.3897/brics-econ.7.e185197"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e185197 \"Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia\" (CC BY 4.0, published 2026-09-03) reports: \"The results show that the only way to avoid cyclical volatility is to prioritise holistic financial market development over short-term macroeconomic policymaking.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl125327","kind":"claim","label":"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-1029-2026gl125327"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl125327","title":"Crossref record doi:10.1029/2026gl125327: Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica","url":"https://api.crossref.org/works/10.1029/2026gl125327"},{"id":"doi:10.1029/2026gl125327","title":"doi:10.1029/2026gl125327","url":"https://doi.org/10.1029/2026gl125327"}],"status":"frontier","summary":"doi:10.1029/2026gl125327 \"Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica\" (CC BY 4.0, published 2026-09-03) reports: \"Our results show that while a large disturbance event can increase solute inputs and shift the long‐term average dissolved ion concentrations, the overall stream discharge‐concentration relationship may remain chemostatic.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70302","kind":"claim","label":"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-03","source_ids":["source.frontier.doi-10-1002-qj-70302"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70302","title":"Crossref record doi:10.1002/qj.70302: Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments","url":"https://api.crossref.org/works/10.1002/qj.70302"},{"id":"doi:10.1002/qj.70302","title":"doi:10.1002/qj.70302","url":"https://doi.org/10.1002/qj.70302"}],"status":"frontier","summary":"doi:10.1002/qj.70302 \"Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments\" (CC BY 4.0, published 2026-09-03) reports: \"Overall, the results demonstrate that cold spells can arise through different dynamical pathways, potentially entailing different uncertainty.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000930","kind":"claim","label":"Countering climate misinformation with large language models: Evidence from ChatGPT","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000930"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000930","title":"Crossref record doi:10.1371/journal.pclm.0000930: Countering climate misinformation with large language models: Evidence from ChatGPT","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000930"},{"id":"doi:10.1371/journal.pclm.0000930","title":"doi:10.1371/journal.pclm.0000930","url":"https://doi.org/10.1371/journal.pclm.0000930"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000930 \"Countering climate misinformation with large language models: Evidence from ChatGPT\" (CC BY 4.0, published 2026-09-02) reports: \"Once these factors were accounted for, authority cues were associated with slightly less extreme climate attitudes, while positive valence and semantic richness correlated positively with perceived credibility.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsnr-2026-0030","kind":"claim","label":"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1098-rsnr-2026-0030"]},"sources":[{"id":"source.frontier.doi-10-1098-rsnr-2026-0030","title":"Crossref record doi:10.1098/rsnr.2026.0030: Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge","url":"https://api.crossref.org/works/10.1098/rsnr.2026.0030"},{"id":"doi:10.1098/rsnr.2026.0030","title":"doi:10.1098/rsnr.2026.0030","url":"https://doi.org/10.1098/rsnr.2026.0030"}],"status":"frontier","summary":"doi:10.1098/rsnr.2026.0030 \"Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge\" (CC BY 4.0, published 2026-09-02) reports: \"Here, we report a rare second edition of Arcana Naturae Detecta (1722), which includes original inscriptions confirming its acquisition in 1746 for the Carmelite College of Liberal Arts of San Joaquín in Mexico City.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-cli2-70062","kind":"claim","label":"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.doi-10-1002-cli2-70062"]},"sources":[{"id":"source.frontier.doi-10-1002-cli2-70062","title":"Crossref record doi:10.1002/cli2.70062: Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and ","url":"https://api.crossref.org/works/10.1002/cli2.70062"},{"id":"doi:10.1002/cli2.70062","title":"doi:10.1002/cli2.70062","url":"https://doi.org/10.1002/cli2.70062"}],"status":"frontier","summary":"doi:10.1002/cli2.70062 \"Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and Stapf in Benin\" (CC BY 4.0, published 2026-09-02) reports: \"These findings demonstrate that niche conservatism does not imply equivalent climate vulnerability among closely related species.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","kind":"claim","label":"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974"]},"sources":[{"id":"source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974","title":"Crossref record doi:10.11591/ijeecs.v43.i3.pp965-974: Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning","url":"https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"},{"id":"doi:10.11591/ijeecs.v43.i3.pp965-974","title":"doi:10.11591/ijeecs.v43.i3.pp965-974","url":"https://doi.org/10.11591/ijeecs.v43.i3.pp965-974"}],"status":"frontier","summary":"doi:10.11591/ijeecs.v43.i3.pp965-974 \"Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning\" (CC BY 4.0, published 2026-09-01) reports: \"What makes these findings particularly significant is that our framework outperformed both ZTA-only and blockchain-only baselines—by 5.7% and 8.9%, respectively—while maintaining complete data privacy.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70852","kind":"claim","label":"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-1111-ejed-70852"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70852","title":"Crossref record doi:10.1111/ejed.70852: The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts","url":"https://api.crossref.org/works/10.1111/ejed.70852"},{"id":"doi:10.1111/ejed.70852","title":"doi:10.1111/ejed.70852","url":"https://doi.org/10.1111/ejed.70852"}],"status":"frontier","summary":"doi:10.1111/ejed.70852 \"The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts\" (CC BY 4.0, published 2026-09-01) reports: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70845","kind":"claim","label":"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-01","source_ids":["source.frontier.doi-10-1111-ejed-70845"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70845","title":"Crossref record doi:10.1111/ejed.70845: Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Env","url":"https://api.crossref.org/works/10.1111/ejed.70845"},{"id":"doi:10.1111/ejed.70845","title":"doi:10.1111/ejed.70845","url":"https://doi.org/10.1111/ejed.70845"}],"status":"frontier","summary":"doi:10.1111/ejed.70845 \"Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Environments\" (CC BY 4.0, published 2026-09-01) reports: \"The findings demonstrated that character strengths were positively associated with all three outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0001039","kind":"claim","label":"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1371-journal-pclm-0001039"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0001039","title":"Crossref record doi:10.1371/journal.pclm.0001039: From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour","url":"https://api.crossref.org/works/10.1371/journal.pclm.0001039"},{"id":"doi:10.1371/journal.pclm.0001039","title":"doi:10.1371/journal.pclm.0001039","url":"https://doi.org/10.1371/journal.pclm.0001039"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0001039 \"From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour\" (CC BY 4.0, published 2026-08-31) reports: \"Using Multilevel Latent Class Analyses (MLCA) on over 17,000 respondents across 61 regions in nine OECD countries, we found that less sustainable behavioural patterns were prevalent across the three sectors, though with notable heterogeneity in the energy sector, and that socio-demographic characteristics failed to predict segment membership consistently.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-nup-70114","kind":"claim","label":"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1111-nup-70114"]},"sources":[{"id":"source.frontier.doi-10-1111-nup-70114","title":"Crossref record doi:10.1111/nup.70114: A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care","url":"https://api.crossref.org/works/10.1111/nup.70114"},{"id":"doi:10.1111/nup.70114","title":"doi:10.1111/nup.70114","url":"https://doi.org/10.1111/nup.70114"}],"status":"frontier","summary":"doi:10.1111/nup.70114 \"A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care\" (CC BY 4.0, published 2026-08-31) reports: \"The findings suggest that the morning bed‐bath in the ICU studied was not merely a technical nursing task, but a culturally embedded and routinised practice through which temporal and organisational routines, embodied care, symbolic order, and professional nursing values are enacted.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejss-70414","kind":"claim","label":"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.doi-10-1111-ejss-70414"]},"sources":[{"id":"source.frontier.doi-10-1111-ejss-70414","title":"Crossref record doi:10.1111/ejss.70414: Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices","url":"https://api.crossref.org/works/10.1111/ejss.70414"},{"id":"doi:10.1111/ejss.70414","title":"doi:10.1111/ejss.70414","url":"https://doi.org/10.1111/ejss.70414"}],"status":"frontier","summary":"doi:10.1111/ejss.70414 \"Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices\" (CC BY 4.0, published 2026-08-31) reports: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026wr044293","kind":"claim","label":"Morphological State Transitions and Sediment Transport Variability in Braided Rivers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-29","source_ids":["source.frontier.doi-10-1029-2026wr044293"]},"sources":[{"id":"source.frontier.doi-10-1029-2026wr044293","title":"Crossref record doi:10.1029/2026wr044293: Morphological State Transitions and Sediment Transport Variability in Braided Rivers","url":"https://api.crossref.org/works/10.1029/2026wr044293"},{"id":"doi:10.1029/2026wr044293","title":"doi:10.1029/2026wr044293","url":"https://doi.org/10.1029/2026wr044293"}],"status":"frontier","summary":"doi:10.1029/2026wr044293 \"Morphological State Transitions and Sediment Transport Variability in Braided Rivers\" (CC BY 4.0, published 2026-08-29) reports: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp-70399","kind":"claim","label":"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.doi-10-1002-esp-70399"]},"sources":[{"id":"source.frontier.doi-10-1002-esp-70399","title":"Crossref record doi:10.1002/esp.70399: Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince Will","url":"https://api.crossref.org/works/10.1002/esp.70399"},{"id":"doi:10.1002/esp.70399","title":"doi:10.1002/esp.70399","url":"https://doi.org/10.1002/esp.70399"}],"status":"frontier","summary":"doi:10.1002/esp.70399 \"Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince William Sound, Alaska\" (CC BY 4.0, published 2026-08-27) reports: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jqs-70108","kind":"claim","label":"A talus rock glacier in Nantlle Valley, North Wales","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.doi-10-1002-jqs-70108"]},"sources":[{"id":"source.frontier.doi-10-1002-jqs-70108","title":"Crossref record doi:10.1002/jqs.70108: A talus rock glacier in Nantlle Valley, North Wales","url":"https://api.crossref.org/works/10.1002/jqs.70108"},{"id":"doi:10.1002/jqs.70108","title":"doi:10.1002/jqs.70108","url":"https://doi.org/10.1002/jqs.70108"}],"status":"frontier","summary":"doi:10.1002/jqs.70108 \"A talus rock glacier in Nantlle Valley, North Wales\" (CC BY 4.0, published 2026-08-26) reports: \"We show that component clasts within the landform are from rockfall debris originally detached from upslope rockwalls above by relatively small‐scale failure events.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jd046723","kind":"claim","label":"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.doi-10-1029-2026jd046723"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jd046723","title":"Crossref record doi:10.1029/2026jd046723: High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America","url":"https://api.crossref.org/works/10.1029/2026jd046723"},{"id":"doi:10.1029/2026jd046723","title":"doi:10.1029/2026jd046723","url":"https://doi.org/10.1029/2026jd046723"}],"status":"frontier","summary":"doi:10.1029/2026jd046723 \"High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America\" (CC BY 4.0, published 2026-08-24) reports: \"H reached 0.43, and the 5 km simulation outperformed the previous 10 km run, highlighting the benefits of improved topographic representation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-msd2-70089","kind":"claim","label":"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-24","source_ids":["source.frontier.doi-10-1002-msd2-70089"]},"sources":[{"id":"source.frontier.doi-10-1002-msd2-70089","title":"Crossref record doi:10.1002/msd2.70089: Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission","url":"https://api.crossref.org/works/10.1002/msd2.70089"},{"id":"doi:10.1002/msd2.70089","title":"doi:10.1002/msd2.70089","url":"https://doi.org/10.1002/msd2.70089"}],"status":"frontier","summary":"doi:10.1002/msd2.70089 \"Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission\" (CC BY 4.0, published 2026-08-24) reports: \"The stability of the controlling system is proved by the Lyapunov stability theory.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70342","kind":"claim","label":"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.doi-10-1111-ijal-70342"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70342","title":"Crossref record doi:10.1111/ijal.70342: Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German C","url":"https://api.crossref.org/works/10.1111/ijal.70342"},{"id":"doi:10.1111/ijal.70342","title":"doi:10.1111/ijal.70342","url":"https://doi.org/10.1111/ijal.70342"}],"status":"frontier","summary":"doi:10.1111/ijal.70342 \"Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German Courses\" (CC BY 4.0, published 2026-08-21) reports: \"Analyses supported a process‐consistent pattern in which R was associated with PC, while PC predicted A and R showed no direct association with A once PC was included in the model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-cli2-70059","kind":"claim","label":"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-20","source_ids":["source.frontier.doi-10-1002-cli2-70059"]},"sources":[{"id":"source.frontier.doi-10-1002-cli2-70059","title":"Crossref record doi:10.1002/cli2.70059: Uncertainty Quantification and Attribution for Resilient Infrastructure Systems","url":"https://api.crossref.org/works/10.1002/cli2.70059"},{"id":"doi:10.1002/cli2.70059","title":"doi:10.1002/cli2.70059","url":"https://doi.org/10.1002/cli2.70059"}],"status":"frontier","summary":"doi:10.1002/cli2.70059 \"Uncertainty Quantification and Attribution for Resilient Infrastructure Systems\" (CC BY 4.0, published 2026-08-20) reports: \"In this article, we show how global sensitivity analysis can be used to consistently quantify and attribute the uncertainty in infrastructure model outputs as a consequence of input uncertainties, using two examples from the energy and water sector in the United Kingdom (UK).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124727","kind":"claim","label":"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.doi-10-1029-2026gl124727"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124727","title":"Crossref record doi:10.1029/2026gl124727: Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change","url":"https://api.crossref.org/works/10.1029/2026gl124727"},{"id":"doi:10.1029/2026gl124727","title":"doi:10.1029/2026gl124727","url":"https://doi.org/10.1029/2026gl124727"}],"status":"frontier","summary":"doi:10.1029/2026gl124727 \"Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change\" (CC BY 4.0, published 2026-08-19) reports: \"We found that the temperature thresholds limiting GPP increase in both regions have steadily increased since 1982 and are projected to continue rising.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000877","kind":"claim","label":"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000877"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000877","title":"Crossref record doi:10.1371/journal.pclm.0000877: The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000877"},{"id":"doi:10.1371/journal.pclm.0000877","title":"doi:10.1371/journal.pclm.0000877","url":"https://doi.org/10.1371/journal.pclm.0000877"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000877 \"The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study\" (CC BY 4.0, published 2026-08-18) reports: \"While the global population at risk from dengue (and, as we show, other vector-borne diseases) is expected to increase, NCV affects its precise value.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jmg-70054","kind":"claim","label":"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.doi-10-1111-jmg-70054"]},"sources":[{"id":"source.frontier.doi-10-1111-jmg-70054","title":"Crossref record doi:10.1111/jmg.70054: Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression","url":"https://api.crossref.org/works/10.1111/jmg.70054"},{"id":"doi:10.1111/jmg.70054","title":"doi:10.1111/jmg.70054","url":"https://doi.org/10.1111/jmg.70054"}],"status":"frontier","summary":"doi:10.1111/jmg.70054 \"Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression\" (CC BY 4.0, published 2026-08-18) reports: \"We demonstrate that machine learning can decipher complex multi‐elemental relationships in zircon REE data and can be used to classify zircon.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-moth-70134","kind":"claim","label":"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.doi-10-1111-moth-70134"]},"sources":[{"id":"source.frontier.doi-10-1111-moth-70134","title":"Crossref record doi:10.1111/moth.70134: Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano","url":"https://api.crossref.org/works/10.1111/moth.70134"},{"id":"doi:10.1111/moth.70134","title":"doi:10.1111/moth.70134","url":"https://doi.org/10.1111/moth.70134"}],"status":"frontier","summary":"doi:10.1111/moth.70134 \"Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano\" (CC BY 4.0, published 2026-08-17) reports: \"This vision is shown to be ‘conjured’ up from what is identified as a distinctive, Black Atlantic way of reading Scripture.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-gwat-70098","kind":"claim","label":"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-15","source_ids":["source.frontier.doi-10-1111-gwat-70098"]},"sources":[{"id":"source.frontier.doi-10-1111-gwat-70098","title":"Crossref record doi:10.1111/gwat.70098: Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange","url":"https://api.crossref.org/works/10.1111/gwat.70098"},{"id":"doi:10.1111/gwat.70098","title":"doi:10.1111/gwat.70098","url":"https://doi.org/10.1111/gwat.70098"}],"status":"frontier","summary":"doi:10.1111/gwat.70098 \"Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange\" (CC BY 4.0, published 2026-08-15) reports: \"These results demonstrate the importance of conceptual model formulation when interpreting simulated stream–aquifer exchange and provide a physically based alternative for large‐scale integrated groundwater–surface water modeling.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wp-2026-018","kind":"claim","label":"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-14","source_ids":["source.frontier.doi-10-2166-wp-2026-018"]},"sources":[{"id":"source.frontier.doi-10-2166-wp-2026-018","title":"Crossref record doi:10.2166/wp.2026.018: A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions","url":"https://api.crossref.org/works/10.2166/wp.2026.018"},{"id":"doi:10.2166/wp.2026.018","title":"doi:10.2166/wp.2026.018","url":"https://doi.org/10.2166/wp.2026.018"}],"status":"frontier","summary":"doi:10.2166/wp.2026.018 \"A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions\" (CC BY 4.0, published 2026-08-14) reports: \"The results show that industrial value-added declines only slightly (about 0.6%), whereas water consumption per 10,000 CNY of industrial value-added decreases by about 8.45%, indicating a substantial improvement in water use efficiency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsta-2025-0107","kind":"claim","label":"Merits of geometric algebra applied to cryptography and machine learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-13","source_ids":["source.frontier.doi-10-1098-rsta-2025-0107"]},"sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0107","title":"Crossref record doi:10.1098/rsta.2025.0107: Merits of geometric algebra applied to cryptography and machine learning","url":"https://api.crossref.org/works/10.1098/rsta.2025.0107"},{"id":"doi:10.1098/rsta.2025.0107","title":"doi:10.1098/rsta.2025.0107","url":"https://doi.org/10.1098/rsta.2025.0107"}],"status":"frontier","summary":"doi:10.1098/rsta.2025.0107 \"Merits of geometric algebra applied to cryptography and machine learning\" (CC BY 4.0, published 2026-08-13) reports: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000931","kind":"claim","label":"Mapping climate-related forest risks: An index-based approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000931"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000931","title":"Crossref record doi:10.1371/journal.pclm.0000931: Mapping climate-related forest risks: An index-based approach","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000931"},{"id":"doi:10.1371/journal.pclm.0000931","title":"doi:10.1371/journal.pclm.0000931","url":"https://doi.org/10.1371/journal.pclm.0000931"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000931 \"Mapping climate-related forest risks: An index-based approach\" (CC BY 4.0, published 2026-08-12) reports: \"Our results show a significant shift towards higher risk across all tree species with the SSP585 scenario assigning over 80% of locations for spruce and pine to a high risk category, with 75% and 65% for beech and oak respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122646","kind":"claim","label":"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1029-2026gl122646"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122646","title":"Crossref record doi:10.1029/2026gl122646: Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land","url":"https://api.crossref.org/works/10.1029/2026gl122646"},{"id":"doi:10.1029/2026gl122646","title":"doi:10.1029/2026gl122646","url":"https://doi.org/10.1029/2026gl122646"}],"status":"frontier","summary":"doi:10.1029/2026gl122646 \"Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land\" (CC BY 4.0, published 2026-08-12) reports: \"We analyze near‐coastal sea surface temperatures (SST) and corresponding land heat characteristics at 1,474 global coastal locations from 1990 to 2023 and find coastal MHW occurrence is associated with positive terrestrial heat/humidity anomalies across seasons, and that warmer coastal SST are associated with more frequent hot/humid extremes on land.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70058","kind":"claim","label":"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1002-ppp-70058"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70058","title":"Crossref record doi:10.1002/ppp.70058: Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape","url":"https://api.crossref.org/works/10.1002/ppp.70058"},{"id":"doi:10.1002/ppp.70058","title":"doi:10.1002/ppp.70058","url":"https://doi.org/10.1002/ppp.70058"}],"status":"frontier","summary":"doi:10.1002/ppp.70058 \"Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape\" (CC BY 4.0, published 2026-08-12) reports: \"Overall, our results suggest that Alpine solifluction lobe dimensions and shape are controlled by different set of environmental factors than Arctic lobes, possibly due to effects of stronger topoclimatic gradients, steeper slopes and higher flow accumulation on mountain slopes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-jpln-70107","kind":"claim","label":"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.doi-10-1002-jpln-70107"]},"sources":[{"id":"source.frontier.doi-10-1002-jpln-70107","title":"Crossref record doi:10.1002/jpln.70107: The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types","url":"https://api.crossref.org/works/10.1002/jpln.70107"},{"id":"doi:10.1002/jpln.70107","title":"doi:10.1002/jpln.70107","url":"https://doi.org/10.1002/jpln.70107"}],"status":"frontier","summary":"doi:10.1002/jpln.70107 \"The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types\" (CC BY 4.0, published 2026-08-12) reports: \": These findings highlight that while high CEC is beneficial, the initial nutrient status and weathering intensity of soils like Oxisols may be drivers of the immediate agronomic benefits of rock dust.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-187529","kind":"claim","label":"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-3897-nhcm-3-187529"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-187529","title":"Crossref record doi:10.3897/nhcm.3.187529: Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish","url":"https://api.crossref.org/works/10.3897/nhcm.3.187529"},{"id":"doi:10.3897/nhcm.3.187529","title":"doi:10.3897/nhcm.3.187529","url":"https://doi.org/10.3897/nhcm.3.187529"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.187529 \"Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish\" (CC BY 4.0, published 2026-08-10) reports: \"Our results showed that all model sizes achieved high detection performance on museum specimens, with mean recall exceeding 0.95 and mAP@0.5 values ranging from 0.75 to 0.78.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026775","kind":"claim","label":"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-38159-ehass-2026775"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026775","title":"Crossref record doi:10.38159/ehass.2026775: Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis","url":"https://api.crossref.org/works/10.38159/ehass.2026775"},{"id":"doi:10.38159/ehass.2026775","title":"doi:10.38159/ehass.2026775","url":"https://doi.org/10.38159/ehass.2026775"}],"status":"frontier","summary":"doi:10.38159/ehass.2026775 \"Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis\" (CC BY 4.0, published 2026-08-10) reports: \"The findings reveal that parodic proverbs perform multiple social and communicative functions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-38159-ehass-2026774","kind":"claim","label":"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.doi-10-38159-ehass-2026774"]},"sources":[{"id":"source.frontier.doi-10-38159-ehass-2026774","title":"Crossref record doi:10.38159/ehass.2026774: Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Pall","url":"https://api.crossref.org/works/10.38159/ehass.2026774"},{"id":"doi:10.38159/ehass.2026774","title":"doi:10.38159/ehass.2026774","url":"https://doi.org/10.38159/ehass.2026774"}],"status":"frontier","summary":"doi:10.38159/ehass.2026774 \"Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Palliative Care services in South African communities\" (CC BY 4.0, published 2026-08-10) reports: \"The findings highlight the need to integrate cultural sensitivity into palliative care planning and delivery.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-hec-70140","kind":"claim","label":"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-08","source_ids":["source.frontier.doi-10-1002-hec-70140"]},"sources":[{"id":"source.frontier.doi-10-1002-hec-70140","title":"Crossref record doi:10.1002/hec.70140: Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery","url":"https://api.crossref.org/works/10.1002/hec.70140"},{"id":"doi:10.1002/hec.70140","title":"doi:10.1002/hec.70140","url":"https://doi.org/10.1002/hec.70140"}],"status":"frontier","summary":"doi:10.1002/hec.70140 \"Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery\" (CC BY 4.0, published 2026-08-08) reports: \"While outpatient waiting times (from referral to specialist visit) comprise a substantial proportion of total time waited (inpatient plus outpatient), we find limited evidence of outpatient waiting time prioritisation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-tox-70177","kind":"claim","label":"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.doi-10-1002-tox-70177"]},"sources":[{"id":"source.frontier.doi-10-1002-tox-70177","title":"Crossref record doi:10.1002/tox.70177: Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa","url":"https://api.crossref.org/works/10.1002/tox.70177"},{"id":"doi:10.1002/tox.70177","title":"doi:10.1002/tox.70177","url":"https://doi.org/10.1002/tox.70177"}],"status":"frontier","summary":"doi:10.1002/tox.70177 \"Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa\" (CC BY 4.0, published 2026-08-07) reports: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-77585","kind":"claim","label":"An Electrowetting Pump","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.doi-10-1002-adfm-77585"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-77585","title":"Crossref record doi:10.1002/adfm.77585: An Electrowetting Pump","url":"https://api.crossref.org/works/10.1002/adfm.77585"},{"id":"doi:10.1002/adfm.77585","title":"doi:10.1002/adfm.77585","url":"https://doi.org/10.1002/adfm.77585"}],"status":"frontier","summary":"doi:10.1002/adfm.77585 \"An Electrowetting Pump\" (CC BY 4.0, published 2026-08-07) reports: \"We show integration into textiles and on soft structures, illustrating the potential for controlling fluid flow in wearables.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9566-70245","kind":"claim","label":"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.doi-10-1111-1467-9566-70245"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9566-70245","title":"Crossref record doi:10.1111/1467-9566.70245: The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal","url":"https://api.crossref.org/works/10.1111/1467-9566.70245"},{"id":"doi:10.1111/1467-9566.70245","title":"doi:10.1111/1467-9566.70245","url":"https://doi.org/10.1111/1467-9566.70245"}],"status":"frontier","summary":"doi:10.1111/1467-9566.70245 \"The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal\" (CC BY 4.0, published 2026-08-06) reports: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70337","kind":"claim","label":"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.doi-10-1111-ijal-70337"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70337","title":"Crossref record doi:10.1111/ijal.70337: Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts","url":"https://api.crossref.org/works/10.1111/ijal.70337"},{"id":"doi:10.1111/ijal.70337","title":"doi:10.1111/ijal.70337","url":"https://doi.org/10.1111/ijal.70337"}],"status":"frontier","summary":"doi:10.1111/ijal.70337 \"Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts\" (CC BY 4.0, published 2026-08-05) reports: \"The analysis shows that GenAI access is rarely a binary matter of presence or absence, but a layered set of hurdles that participants had to navigate actively: tools are visible through media, training sessions and peer networks, but unstable connectivity, outdated devices, paywalls, institutional permissions and limited local integration meant that turning visibility into sustained use required ongoing effort, workaround strategies and situated forms of agency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl123821","kind":"claim","label":"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.doi-10-1029-2026gl123821"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl123821","title":"Crossref record doi:10.1029/2026gl123821: Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers","url":"https://api.crossref.org/works/10.1029/2026gl123821"},{"id":"doi:10.1029/2026gl123821","title":"doi:10.1029/2026gl123821","url":"https://doi.org/10.1029/2026gl123821"}],"status":"frontier","summary":"doi:10.1029/2026gl123821 \"Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers\" (CC BY 4.0, published 2026-08-05) reports: \"Our results highlight the importance of incorporating groundwater dynamics into assessments of climate extremes and land‐surface processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-qj-70252","kind":"claim","label":"Using microwave imager observations to improve the ocean temperature in a coupled NWP system","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.doi-10-1002-qj-70252"]},"sources":[{"id":"source.frontier.doi-10-1002-qj-70252","title":"Crossref record doi:10.1002/qj.70252: Using microwave imager observations to improve the ocean temperature in a coupled NWP system","url":"https://api.crossref.org/works/10.1002/qj.70252"},{"id":"doi:10.1002/qj.70252","title":"doi:10.1002/qj.70252","url":"https://doi.org/10.1002/qj.70252"}],"status":"frontier","summary":"doi:10.1002/qj.70252 \"Using microwave imager observations to improve the ocean temperature in a coupled NWP system\" (CC BY 4.0, published 2026-08-02) reports: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70540","kind":"claim","label":"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.doi-10-1002-joc-70540"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70540","title":"Crossref record doi:10.1002/joc.70540: Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models","url":"https://api.crossref.org/works/10.1002/joc.70540"},{"id":"doi:10.1002/joc.70540","title":"doi:10.1002/joc.70540","url":"https://doi.org/10.1002/joc.70540"}],"status":"frontier","summary":"doi:10.1002/joc.70540 \"Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models\" (CC BY 4.0, published 2026-08-02) reports: \"These results highlight important limitations in the representation of winter precipitation variability and change in the UKCP18 GCMs and have implications for the interpretation of model output in climate risk assessments and for the use of higher‐resolution ensembles within the UKCP18 framework.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-eje-70266","kind":"claim","label":"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.doi-10-1111-eje-70266"]},"sources":[{"id":"source.frontier.doi-10-1111-eje-70266","title":"Crossref record doi:10.1111/eje.70266: Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists","url":"https://api.crossref.org/works/10.1111/eje.70266"},{"id":"doi:10.1111/eje.70266","title":"doi:10.1111/eje.70266","url":"https://doi.org/10.1111/eje.70266"}],"status":"frontier","summary":"doi:10.1111/eje.70266 \"Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists\" (CC BY 4.0, published 2026-07-31) reports: \"The study suggests that Kegan's stages provide a valuable framework for understanding and promoting the development of globally competent dentists.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ecpo-70064","kind":"claim","label":"Chinese Lending and Sovereign Debt Distress in Developing Countries","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.doi-10-1111-ecpo-70064"]},"sources":[{"id":"source.frontier.doi-10-1111-ecpo-70064","title":"Crossref record doi:10.1111/ecpo.70064: Chinese Lending and Sovereign Debt Distress in Developing Countries","url":"https://api.crossref.org/works/10.1111/ecpo.70064"},{"id":"doi:10.1111/ecpo.70064","title":"doi:10.1111/ecpo.70064","url":"https://doi.org/10.1111/ecpo.70064"}],"status":"frontier","summary":"doi:10.1111/ecpo.70064 \"Chinese Lending and Sovereign Debt Distress in Developing Countries\" (CC BY 4.0, published 2026-07-31) reports: \"Employing a within‐between Mundlak decomposition and an instrumental variable strategy, we find little evidence that Chinese lending increases debt distress within countries over time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-beer-70139","kind":"claim","label":"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1111-beer-70139"]},"sources":[{"id":"source.frontier.doi-10-1111-beer-70139","title":"Crossref record doi:10.1111/beer.70139: Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees","url":"https://api.crossref.org/works/10.1111/beer.70139"},{"id":"doi:10.1111/beer.70139","title":"doi:10.1111/beer.70139","url":"https://doi.org/10.1111/beer.70139"}],"status":"frontier","summary":"doi:10.1111/beer.70139 \"Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees\" (CC BY 4.0, published 2026-07-30) reports: \"Our findings confirm that board size, board gender diversity, and the proportion of independent directors have a positive impact on environmental, social, and governance (ESG) performance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1098-rsta-2025-0029","kind":"claim","label":"The many faces of rotating quantum turbulence","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1098-rsta-2025-0029"]},"sources":[{"id":"source.frontier.doi-10-1098-rsta-2025-0029","title":"Crossref record doi:10.1098/rsta.2025.0029: The many faces of rotating quantum turbulence","url":"https://api.crossref.org/works/10.1098/rsta.2025.0029"},{"id":"doi:10.1098/rsta.2025.0029","title":"doi:10.1098/rsta.2025.0029","url":"https://doi.org/10.1098/rsta.2025.0029"}],"status":"frontier","summary":"doi:10.1098/rsta.2025.0029 \"The many faces of rotating quantum turbulence\" (CC BY 4.0, published 2026-07-30) reports: \"In particular, we show the importance of distinguishing the dynamics of rotating quantum fluids in the slowly rotating, rapidly rotating and low Landau level regimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124661","kind":"claim","label":"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2026gl124661"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124661","title":"Crossref record doi:10.1029/2026gl124661: How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?","url":"https://api.crossref.org/works/10.1029/2026gl124661"},{"id":"doi:10.1029/2026gl124661","title":"doi:10.1029/2026gl124661","url":"https://doi.org/10.1029/2026gl124661"}],"status":"frontier","summary":"doi:10.1029/2026gl124661 \"How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?\" (CC BY 4.0, published 2026-07-30) reports: \"We demonstrate that judiciously selected training subsets achieve predictive accuracy comparable or even superior to the full‐training‐data baseline model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jc023581","kind":"claim","label":"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2025jc023581"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jc023581","title":"Crossref record doi:10.1029/2025jc023581: Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey","url":"https://api.crossref.org/works/10.1029/2025jc023581"},{"id":"doi:10.1029/2025jc023581","title":"doi:10.1029/2025jc023581","url":"https://doi.org/10.1029/2025jc023581"}],"status":"frontier","summary":"doi:10.1029/2025jc023581 \"Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey\" (CC BY 4.0, published 2026-07-30) reports: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jb032632","kind":"claim","label":"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.doi-10-1029-2025jb032632"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jb032632","title":"Crossref record doi:10.1029/2025jb032632: Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series","url":"https://api.crossref.org/works/10.1029/2025jb032632"},{"id":"doi:10.1029/2025jb032632","title":"doi:10.1029/2025jb032632","url":"https://doi.org/10.1029/2025jb032632"}],"status":"frontier","summary":"doi:10.1029/2025jb032632 \"Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series\" (CC BY 4.0, published 2026-07-30) reports: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70526","kind":"claim","label":"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.doi-10-1002-joc-70526"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70526","title":"Crossref record doi:10.1002/joc.70526: Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI","url":"https://api.crossref.org/works/10.1002/joc.70526"},{"id":"doi:10.1002/joc.70526","title":"doi:10.1002/joc.70526","url":"https://doi.org/10.1002/joc.70526"}],"status":"frontier","summary":"doi:10.1002/joc.70526 \"Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI\" (CC BY 4.0, published 2026-07-28) reports: \"The results reveal a spatially heterogeneous and non‐stationary drought regime across Greece.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-saje-70032","kind":"claim","label":"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-26","source_ids":["source.frontier.doi-10-1111-saje-70032"]},"sources":[{"id":"source.frontier.doi-10-1111-saje-70032","title":"Crossref record doi:10.1111/saje.70032: The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?","url":"https://api.crossref.org/works/10.1111/saje.70032"},{"id":"doi:10.1111/saje.70032","title":"doi:10.1111/saje.70032","url":"https://doi.org/10.1111/saje.70032"}],"status":"frontier","summary":"doi:10.1111/saje.70032 \"The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?\" (CC BY 4.0, published 2026-07-26) reports: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl124111","kind":"claim","label":"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-23","source_ids":["source.frontier.doi-10-1029-2026gl124111"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl124111","title":"Crossref record doi:10.1029/2026gl124111: Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation","url":"https://api.crossref.org/works/10.1029/2026gl124111"},{"id":"doi:10.1029/2026gl124111","title":"doi:10.1029/2026gl124111","url":"https://doi.org/10.1029/2026gl124111"}],"status":"frontier","summary":"doi:10.1029/2026gl124111 \"Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation\" (CC BY 4.0, published 2026-07-23) reports: \"Using observational data sets and numerical experiments, we demonstrate that this IOD‐ENSO connection varies considerably on multidecadal timescales, which are largely controlled by the Atlantic Multidecadal Oscillation (AMO).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70772","kind":"claim","label":"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-20","source_ids":["source.frontier.doi-10-1111-ejed-70772"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70772","title":"Crossref record doi:10.1111/ejed.70772: Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential","url":"https://api.crossref.org/works/10.1111/ejed.70772"},{"id":"doi:10.1111/ejed.70772","title":"doi:10.1111/ejed.70772","url":"https://doi.org/10.1111/ejed.70772"}],"status":"frontier","summary":"doi:10.1111/ejed.70772 \"Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential\" (CC BY 4.0, published 2026-07-20) reports: \"The findings show that AI is increasingly seen as a transformative academic tool, especially for research, language learning, writing support and problem‐solving.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122539","kind":"claim","label":"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-18","source_ids":["source.frontier.doi-10-1029-2026gl122539"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122539","title":"Crossref record doi:10.1029/2026gl122539: SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics","url":"https://api.crossref.org/works/10.1029/2026gl122539"},{"id":"doi:10.1029/2026gl122539","title":"doi:10.1029/2026gl122539","url":"https://doi.org/10.1029/2026gl122539"}],"status":"frontier","summary":"doi:10.1029/2026gl122539 \"SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics\" (CC BY 4.0, published 2026-07-18) reports: \"We demonstrate that repeated SWOT high‐rate acquisitions can accurately monitor changes in ice‐shelf surface heights, revealing key processes including responses to ocean tides and atmospheric forcing, ice flexure along grounding zones, and crevasse deepening, that affect stresses impacting ice loss.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70310","kind":"claim","label":"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.doi-10-1111-ijal-70310"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70310","title":"Crossref record doi:10.1111/ijal.70310: Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice","url":"https://api.crossref.org/works/10.1111/ijal.70310"},{"id":"doi:10.1111/ijal.70310","title":"doi:10.1111/ijal.70310","url":"https://doi.org/10.1111/ijal.70310"}],"status":"frontier","summary":"doi:10.1111/ijal.70310 \"Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice\" (CC BY 4.0, published 2026-07-17) reports: \"The findings indicate that prompting instruction improves communication efficiency, particularly in higher‐complexity tasks, as reflected in fewer conversational turns and significantly reduced misunderstandings in human–chatbot interaction, alongside a modest, non‐significant advantage in task completion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adfm-76901","kind":"claim","label":"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-17","source_ids":["source.frontier.doi-10-1002-adfm-76901"]},"sources":[{"id":"source.frontier.doi-10-1002-adfm-76901","title":"Crossref record doi:10.1002/adfm.76901: Implantable Ionic Memristors Based on Natural Polymer Heterojunctions","url":"https://api.crossref.org/works/10.1002/adfm.76901"},{"id":"doi:10.1002/adfm.76901","title":"doi:10.1002/adfm.76901","url":"https://doi.org/10.1002/adfm.76901"}],"status":"frontier","summary":"doi:10.1002/adfm.76901 \"Implantable Ionic Memristors Based on Natural Polymer Heterojunctions\" (CC BY 4.0, published 2026-07-17) reports: \"Here, we report a fully biocompatible natural polymer‐based ionic memristor, comprising a hyaluronic acid hydrogel, a chitosan hydrogel, and a polydimethylsiloxane (PDMS) substrate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-nzm2-70056","kind":"claim","label":"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-16","source_ids":["source.frontier.doi-10-1002-nzm2-70056"]},"sources":[{"id":"source.frontier.doi-10-1002-nzm2-70056","title":"Crossref record doi:10.1002/nzm2.70056: Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand","url":"https://api.crossref.org/works/10.1002/nzm2.70056"},{"id":"doi:10.1002/nzm2.70056","title":"doi:10.1002/nzm2.70056","url":"https://doi.org/10.1002/nzm2.70056"}],"status":"frontier","summary":"doi:10.1002/nzm2.70056 \"Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand\" (CC BY 4.0, published 2026-07-16) reports: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1144-jgs2026-026","kind":"claim","label":"Origin of river terraces by isostatic unloading of the lithosphere","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1144-jgs2026-026"]},"sources":[{"id":"source.frontier.doi-10-1144-jgs2026-026","title":"Crossref record doi:10.1144/jgs2026-026: Origin of river terraces by isostatic unloading of the lithosphere","url":"https://api.crossref.org/works/10.1144/jgs2026-026"},{"id":"doi:10.1144/jgs2026-026","title":"doi:10.1144/jgs2026-026","url":"https://doi.org/10.1144/jgs2026-026"}],"status":"frontier","summary":"doi:10.1144/jgs2026-026 \"Origin of river terraces by isostatic unloading of the lithosphere\" (CC BY 4.0, published 2026-07-15) reports: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ejed-70766","kind":"claim","label":"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1111-ejed-70766"]},"sources":[{"id":"source.frontier.doi-10-1111-ejed-70766","title":"Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes","url":"https://api.crossref.org/works/10.1111/ejed.70766"},{"id":"doi:10.1111/ejed.70766","title":"doi:10.1111/ejed.70766","url":"https://doi.org/10.1111/ejed.70766"}],"status":"frontier","summary":"doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-sce-70090","kind":"claim","label":"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-15","source_ids":["source.frontier.doi-10-1002-sce-70090"]},"sources":[{"id":"source.frontier.doi-10-1002-sce-70090","title":"Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings","url":"https://api.crossref.org/works/10.1002/sce.70090"},{"id":"doi:10.1002/sce.70090","title":"doi:10.1002/sce.70090","url":"https://doi.org/10.1002/sce.70090"}],"status":"frontier","summary":"doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70053","kind":"claim","label":"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.doi-10-1002-ppp-70053"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70053","title":"Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT","url":"https://api.crossref.org/works/10.1002/ppp.70053"},{"id":"doi:10.1002/ppp.70053","title":"doi:10.1002/ppp.70053","url":"https://doi.org/10.1002/ppp.70053"}],"status":"frontier","summary":"doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ese3-70603","kind":"claim","label":"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-14","source_ids":["source.frontier.doi-10-1002-ese3-70603"]},"sources":[{"id":"source.frontier.doi-10-1002-ese3-70603","title":"Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law","url":"https://api.crossref.org/works/10.1002/ese3.70603"},{"id":"doi:10.1002/ese3.70603","title":"doi:10.1002/ese3.70603","url":"https://doi.org/10.1002/ese3.70603"}],"status":"frontier","summary":"doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd046190","kind":"claim","label":"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.doi-10-1029-2025jd046190"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd046190","title":"Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event","url":"https://api.crossref.org/works/10.1029/2025jd046190"},{"id":"doi:10.1029/2025jd046190","title":"doi:10.1029/2025jd046190","url":"https://doi.org/10.1029/2025jd046190"}],"status":"frontier","summary":"doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121323","kind":"claim","label":"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-13","source_ids":["source.frontier.doi-10-1029-2025gl121323"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121323","title":"Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years","url":"https://api.crossref.org/works/10.1029/2025gl121323"},{"id":"doi:10.1029/2025gl121323","title":"doi:10.1029/2025gl121323","url":"https://doi.org/10.1029/2025gl121323"}],"status":"frontier","summary":"doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ijfe-70259","kind":"claim","label":"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-12","source_ids":["source.frontier.doi-10-1002-ijfe-70259"]},"sources":[{"id":"source.frontier.doi-10-1002-ijfe-70259","title":"Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data","url":"https://api.crossref.org/works/10.1002/ijfe.70259"},{"id":"doi:10.1002/ijfe.70259","title":"doi:10.1002/ijfe.70259","url":"https://doi.org/10.1002/ijfe.70259"}],"status":"frontier","summary":"doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1371-journal-pclm-0000696","kind":"claim","label":"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1371-journal-pclm-0000696"]},"sources":[{"id":"source.frontier.doi-10-1371-journal-pclm-0000696","title":"Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling","url":"https://api.crossref.org/works/10.1371/journal.pclm.0000696"},{"id":"doi:10.1371/journal.pclm.0000696","title":"doi:10.1371/journal.pclm.0000696","url":"https://doi.org/10.1371/journal.pclm.0000696"}],"status":"frontier","summary":"doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-aphw-70185","kind":"claim","label":"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1111-aphw-70185"]},"sources":[{"id":"source.frontier.doi-10-1111-aphw-70185","title":"Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research","url":"https://api.crossref.org/works/10.1111/aphw.70185"},{"id":"doi:10.1111/aphw.70185","title":"doi:10.1111/aphw.70185","url":"https://doi.org/10.1111/aphw.70185"}],"status":"frontier","summary":"doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026jh001250","kind":"claim","label":"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1029-2026jh001250"]},"sources":[{"id":"source.frontier.doi-10-1029-2026jh001250","title":"Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network","url":"https://api.crossref.org/works/10.1029/2026jh001250"},{"id":"doi:10.1029/2026jh001250","title":"doi:10.1029/2026jh001250","url":"https://doi.org/10.1029/2026jh001250"}],"status":"frontier","summary":"doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122518","kind":"claim","label":"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-09","source_ids":["source.frontier.doi-10-1029-2026gl122518"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122518","title":"Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake","url":"https://api.crossref.org/works/10.1029/2026gl122518"},{"id":"doi:10.1029/2026gl122518","title":"doi:10.1029/2026gl122518","url":"https://doi.org/10.1029/2026gl122518"}],"status":"frontier","summary":"doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e172739","kind":"claim","label":"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e172739"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e172739","title":"Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e172739"},{"id":"doi:10.3897/brics-econ.7.e172739","title":"doi:10.3897/brics-econ.7.e172739","url":"https://doi.org/10.3897/brics-econ.7.e172739"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jmg-70045","kind":"claim","label":"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-07","source_ids":["source.frontier.doi-10-1111-jmg-70045"]},"sources":[{"id":"source.frontier.doi-10-1111-jmg-70045","title":"Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole","url":"https://api.crossref.org/works/10.1111/jmg.70045"},{"id":"doi:10.1111/jmg.70045","title":"doi:10.1111/jmg.70045","url":"https://doi.org/10.1111/jmg.70045"}],"status":"frontier","summary":"doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ppp-70049","kind":"claim","label":"Disposition Model for Permafrost Degradation in Mountainous Regions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-05","source_ids":["source.frontier.doi-10-1002-ppp-70049"]},"sources":[{"id":"source.frontier.doi-10-1002-ppp-70049","title":"Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions","url":"https://api.crossref.org/works/10.1002/ppp.70049"},{"id":"doi:10.1002/ppp.70049","title":"doi:10.1002/ppp.70049","url":"https://doi.org/10.1002/ppp.70049"}],"status":"frontier","summary":"doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-brics-econ-7-e162074","kind":"claim","label":"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-03","source_ids":["source.frontier.doi-10-3897-brics-econ-7-e162074"]},"sources":[{"id":"source.frontier.doi-10-3897-brics-econ-7-e162074","title":"Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter","url":"https://api.crossref.org/works/10.3897/brics-econ.7.e162074"},{"id":"doi:10.3897/brics-econ.7.e162074","title":"doi:10.3897/brics-econ.7.e162074","url":"https://doi.org/10.3897/brics-econ.7.e162074"}],"status":"frontier","summary":"doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ijal-70289","kind":"claim","label":"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-03","source_ids":["source.frontier.doi-10-1111-ijal-70289"]},"sources":[{"id":"source.frontier.doi-10-1111-ijal-70289","title":"Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa","url":"https://api.crossref.org/works/10.1111/ijal.70289"},{"id":"doi:10.1111/ijal.70289","title":"doi:10.1111/ijal.70289","url":"https://doi.org/10.1111/ijal.70289"}],"status":"frontier","summary":"doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wpt-2026-383","kind":"claim","label":"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-01","source_ids":["source.frontier.doi-10-2166-wpt-2026-383"]},"sources":[{"id":"source.frontier.doi-10-2166-wpt-2026-383","title":"Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss","url":"https://api.crossref.org/works/10.2166/wpt.2026.383"},{"id":"doi:10.2166/wpt.2026.383","title":"doi:10.2166/wpt.2026.383","url":"https://doi.org/10.2166/wpt.2026.383"}],"status":"frontier","summary":"doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-359","kind":"claim","label":"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-01","source_ids":["source.frontier.doi-10-2166-wcc-2026-359"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-359","title":"Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change","url":"https://api.crossref.org/works/10.2166/wcc.2026.359"},{"id":"doi:10.2166/wcc.2026.359","title":"doi:10.2166/wcc.2026.359","url":"https://doi.org/10.2166/wcc.2026.359"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-66630-sc-2026-0009","kind":"claim","label":"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-66630-sc-2026-0009"]},"sources":[{"id":"source.frontier.doi-10-66630-sc-2026-0009","title":"Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA","url":"https://api.crossref.org/works/10.66630/sc.2026.0009"},{"id":"doi:10.66630/sc.2026.0009","title":"doi:10.66630/sc.2026.0009","url":"https://doi.org/10.66630/sc.2026.0009"}],"status":"frontier","summary":"doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-59588-2961-3094-1247","kind":"claim","label":"Creative Constructions in Asian and World Englishes - And What They Teach Us","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-59588-2961-3094-1247"]},"sources":[{"id":"source.frontier.doi-10-59588-2961-3094-1247","title":"Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us","url":"https://api.crossref.org/works/10.59588/2961-3094.1247"},{"id":"doi:10.59588/2961-3094.1247","title":"doi:10.59588/2961-3094.1247","url":"https://doi.org/10.59588/2961-3094.1247"}],"status":"frontier","summary":"doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-28918-jei-v11i1-2606","kind":"claim","label":"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-28918-jei-v11i1-2606"]},"sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2606","title":"Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2606"},{"id":"doi:10.28918/jei.v11i1.2606","title":"doi:10.28918/jei.v11i1.2606","url":"https://doi.org/10.28918/jei.v11i1.2606"}],"status":"frontier","summary":"doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-28918-jei-v11i1-2601","kind":"claim","label":"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-28918-jei-v11i1-2601"]},"sources":[{"id":"source.frontier.doi-10-28918-jei-v11i1-2601","title":"Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation","url":"https://api.crossref.org/works/10.28918/jei.v11i1.2601"},{"id":"doi:10.28918/jei.v11i1.2601","title":"doi:10.28918/jei.v11i1.2601","url":"https://doi.org/10.28918/jei.v11i1.2601"}],"status":"frontier","summary":"doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025wr041875","kind":"claim","label":"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-30","source_ids":["source.frontier.doi-10-1029-2025wr041875"]},"sources":[{"id":"source.frontier.doi-10-1029-2025wr041875","title":"Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products","url":"https://api.crossref.org/works/10.1029/2025wr041875"},{"id":"doi:10.1029/2025wr041875","title":"doi:10.1029/2025wr041875","url":"https://doi.org/10.1029/2025wr041875"}],"status":"frontier","summary":"doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-wcc-2026-006","kind":"claim","label":"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-2166-wcc-2026-006"]},"sources":[{"id":"source.frontier.doi-10-2166-wcc-2026-006","title":"Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia","url":"https://api.crossref.org/works/10.2166/wcc.2026.006"},{"id":"doi:10.2166/wcc.2026.006","title":"doi:10.2166/wcc.2026.006","url":"https://doi.org/10.2166/wcc.2026.006"}],"status":"frontier","summary":"doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jb033060","kind":"claim","label":"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-1029-2025jb033060"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jb033060","title":"Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting","url":"https://api.crossref.org/works/10.1029/2025jb033060"},{"id":"doi:10.1029/2025jb033060","title":"doi:10.1029/2025jb033060","url":"https://doi.org/10.1029/2025jb033060"}],"status":"frontier","summary":"doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025ea004610","kind":"claim","label":"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-27","source_ids":["source.frontier.doi-10-1029-2025ea004610"]},"sources":[{"id":"source.frontier.doi-10-1029-2025ea004610","title":"Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals","url":"https://api.crossref.org/works/10.1029/2025ea004610"},{"id":"doi:10.1029/2025ea004610","title":"doi:10.1029/2025ea004610","url":"https://doi.org/10.1029/2025ea004610"}],"status":"frontier","summary":"doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122157","kind":"claim","label":"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-26","source_ids":["source.frontier.doi-10-1029-2026gl122157"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122157","title":"Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel","url":"https://api.crossref.org/works/10.1029/2026gl122157"},{"id":"doi:10.1029/2026gl122157","title":"doi:10.1029/2026gl122157","url":"https://doi.org/10.1029/2026gl122157"}],"status":"frontier","summary":"doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp4-70096","kind":"claim","label":"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-25","source_ids":["source.frontier.doi-10-1002-esp4-70096"]},"sources":[{"id":"source.frontier.doi-10-1002-esp4-70096","title":"Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities","url":"https://api.crossref.org/works/10.1002/esp4.70096"},{"id":"doi:10.1002/esp4.70096","title":"doi:10.1002/esp4.70096","url":"https://doi.org/10.1002/esp4.70096"}],"status":"frontier","summary":"doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-bioe-70124","kind":"claim","label":"The Concept of Harm in Medical Ethics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-24","source_ids":["source.frontier.doi-10-1111-bioe-70124"]},"sources":[{"id":"source.frontier.doi-10-1111-bioe-70124","title":"Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics","url":"https://api.crossref.org/works/10.1111/bioe.70124"},{"id":"doi:10.1111/bioe.70124","title":"doi:10.1111/bioe.70124","url":"https://doi.org/10.1111/bioe.70124"}],"status":"frontier","summary":"doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-adom-71396","kind":"claim","label":"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-24","source_ids":["source.frontier.doi-10-1002-adom-71396"]},"sources":[{"id":"source.frontier.doi-10-1002-adom-71396","title":"Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles","url":"https://api.crossref.org/works/10.1002/adom.71396"},{"id":"doi:10.1002/adom.71396","title":"doi:10.1002/adom.71396","url":"https://doi.org/10.1002/adom.71396"}],"status":"frontier","summary":"doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-ese3-70586","kind":"claim","label":"Influence of Structural and Environmental Parameters on Solar Air Collector Performance","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-23","source_ids":["source.frontier.doi-10-1002-ese3-70586"]},"sources":[{"id":"source.frontier.doi-10-1002-ese3-70586","title":"Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance","url":"https://api.crossref.org/works/10.1002/ese3.70586"},{"id":"doi:10.1002/ese3.70586","title":"doi:10.1002/ese3.70586","url":"https://doi.org/10.1002/ese3.70586"}],"status":"frontier","summary":"doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1144-jgs2026-039","kind":"claim","label":"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-22","source_ids":["source.frontier.doi-10-1144-jgs2026-039"]},"sources":[{"id":"source.frontier.doi-10-1144-jgs2026-039","title":"Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study","url":"https://api.crossref.org/works/10.1144/jgs2026-039"},{"id":"doi:10.1144/jgs2026-039","title":"doi:10.1144/jgs2026-039","url":"https://doi.org/10.1144/jgs2026-039"}],"status":"frontier","summary":"doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-hec-70120","kind":"claim","label":"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-22","source_ids":["source.frontier.doi-10-1002-hec-70120"]},"sources":[{"id":"source.frontier.doi-10-1002-hec-70120","title":"Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight","url":"https://api.crossref.org/works/10.1002/hec.70120"},{"id":"doi:10.1002/hec.70120","title":"doi:10.1002/hec.70120","url":"https://doi.org/10.1002/hec.70120"}],"status":"frontier","summary":"doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-1467-9477-70049","kind":"claim","label":"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-21","source_ids":["source.frontier.doi-10-1111-1467-9477-70049"]},"sources":[{"id":"source.frontier.doi-10-1111-1467-9477-70049","title":"Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics","url":"https://api.crossref.org/works/10.1111/1467-9477.70049"},{"id":"doi:10.1111/1467-9477.70049","title":"doi:10.1111/1467-9477.70049","url":"https://doi.org/10.1111/1467-9477.70049"}],"status":"frontier","summary":"doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-faam-70045","kind":"claim","label":"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-20","source_ids":["source.frontier.doi-10-1111-faam-70045"]},"sources":[{"id":"source.frontier.doi-10-1111-faam-70045","title":"Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context","url":"https://api.crossref.org/works/10.1111/faam.70045"},{"id":"doi:10.1111/faam.70045","title":"doi:10.1111/faam.70045","url":"https://doi.org/10.1111/faam.70045"}],"status":"frontier","summary":"doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-58491-2735-4202-3413","kind":"claim","label":"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-18","source_ids":["source.frontier.doi-10-58491-2735-4202-3413"]},"sources":[{"id":"source.frontier.doi-10-58491-2735-4202-3413","title":"Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL","url":"https://api.crossref.org/works/10.58491/2735-4202.3413"},{"id":"doi:10.58491/2735-4202.3413","title":"doi:10.58491/2735-4202.3413","url":"https://doi.org/10.58491/2735-4202.3413"}],"status":"frontier","summary":"doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121378","kind":"claim","label":"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-16","source_ids":["source.frontier.doi-10-1029-2025gl121378"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121378","title":"Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed","url":"https://api.crossref.org/works/10.1029/2025gl121378"},{"id":"doi:10.1029/2025gl121378","title":"doi:10.1029/2025gl121378","url":"https://doi.org/10.1029/2025gl121378"}],"status":"frontier","summary":"doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-56403-nejesh-v5i2-421","kind":"claim","label":"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-56403-nejesh-v5i2-421"]},"sources":[{"id":"source.frontier.doi-10-56403-nejesh-v5i2-421","title":"Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe","url":"https://api.crossref.org/works/10.56403/nejesh.v5i2.421"},{"id":"doi:10.56403/nejesh.v5i2.421","title":"doi:10.56403/nejesh.v5i2.421","url":"https://doi.org/10.56403/nejesh.v5i2.421"}],"status":"frontier","summary":"doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl123355","kind":"claim","label":"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-1029-2026gl123355"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl123355","title":"Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary","url":"https://api.crossref.org/works/10.1029/2026gl123355"},{"id":"doi:10.1029/2026gl123355","title":"doi:10.1029/2026gl123355","url":"https://doi.org/10.1029/2026gl123355"}],"status":"frontier","summary":"doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gl121171","kind":"claim","label":"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-11","source_ids":["source.frontier.doi-10-1029-2025gl121171"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gl121171","title":"Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes","url":"https://api.crossref.org/works/10.1029/2025gl121171"},{"id":"doi:10.1029/2025gl121171","title":"doi:10.1029/2025gl121171","url":"https://doi.org/10.1029/2025gl121171"}],"status":"frontier","summary":"doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd044617","kind":"claim","label":"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-10","source_ids":["source.frontier.doi-10-1029-2025jd044617"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd044617","title":"Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou","url":"https://api.crossref.org/works/10.1029/2025jd044617"},{"id":"doi:10.1029/2025jd044617","title":"doi:10.1029/2025jd044617","url":"https://doi.org/10.1029/2025jd044617"}],"status":"frontier","summary":"doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-22378-he-2026-11-2-218-234","kind":"claim","label":"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-08","source_ids":["source.frontier.doi-10-22378-he-2026-11-2-218-234"]},"sources":[{"id":"source.frontier.doi-10-22378-he-2026-11-2-218-234","title":"Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ","url":"https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"},{"id":"doi:10.22378/he.2026-11-2.218-234","title":"doi:10.22378/he.2026-11-2.218-234","url":"https://doi.org/10.22378/he.2026-11-2.218-234"}],"status":"frontier","summary":"doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd045718","kind":"claim","label":"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-06","source_ids":["source.frontier.doi-10-1029-2025jd045718"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd045718","title":"Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season","url":"https://api.crossref.org/works/10.1029/2025jd045718"},{"id":"doi:10.1029/2025jd045718","title":"doi:10.1029/2025jd045718","url":"https://doi.org/10.1029/2025jd045718"}],"status":"frontier","summary":"doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2026gl122664","kind":"claim","label":"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-04","source_ids":["source.frontier.doi-10-1029-2026gl122664"]},"sources":[{"id":"source.frontier.doi-10-1029-2026gl122664","title":"Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum","url":"https://api.crossref.org/works/10.1029/2026gl122664"},{"id":"doi:10.1029/2026gl122664","title":"doi:10.1029/2026gl122664","url":"https://doi.org/10.1029/2026gl122664"}],"status":"frontier","summary":"doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ojoa-70022","kind":"claim","label":"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-03","source_ids":["source.frontier.doi-10-1111-ojoa-70022"]},"sources":[{"id":"source.frontier.doi-10-1111-ojoa-70022","title":"Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES","url":"https://api.crossref.org/works/10.1111/ojoa.70022"},{"id":"doi:10.1111/ojoa.70022","title":"doi:10.1111/ojoa.70022","url":"https://doi.org/10.1111/ojoa.70022"}],"status":"frontier","summary":"doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025jd045965","kind":"claim","label":"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-06-02","source_ids":["source.frontier.doi-10-1029-2025jd045965"]},"sources":[{"id":"source.frontier.doi-10-1029-2025jd045965","title":"Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S","url":"https://api.crossref.org/works/10.1029/2025jd045965"},{"id":"doi:10.1029/2025jd045965","title":"doi:10.1029/2025jd045965","url":"https://doi.org/10.1029/2025jd045965"}],"status":"frontier","summary":"doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-jssr-70066","kind":"claim","label":"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-30","source_ids":["source.frontier.doi-10-1111-jssr-70066"]},"sources":[{"id":"source.frontier.doi-10-1111-jssr-70066","title":"Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans","url":"https://api.crossref.org/works/10.1111/jssr.70066"},{"id":"doi:10.1111/jssr.70066","title":"doi:10.1111/jssr.70066","url":"https://doi.org/10.1111/jssr.70066"}],"status":"frontier","summary":"doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025wr042846","kind":"claim","label":"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-30","source_ids":["source.frontier.doi-10-1029-2025wr042846"]},"sources":[{"id":"source.frontier.doi-10-1029-2025wr042846","title":"Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater","url":"https://api.crossref.org/works/10.1029/2025wr042846"},{"id":"doi:10.1029/2025wr042846","title":"doi:10.1029/2025wr042846","url":"https://doi.org/10.1029/2025wr042846"}],"status":"frontier","summary":"doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-jbgs-e185535","kind":"claim","label":"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-29","source_ids":["source.frontier.doi-10-3897-jbgs-e185535"]},"sources":[{"id":"source.frontier.doi-10-3897-jbgs-e185535","title":"Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us","url":"https://api.crossref.org/works/10.3897/jbgs.e185535"},{"id":"doi:10.3897/jbgs.e185535","title":"doi:10.3897/jbgs.e185535","url":"https://doi.org/10.3897/jbgs.e185535"}],"status":"frontier","summary":"doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-esp4-70082","kind":"claim","label":"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-29","source_ids":["source.frontier.doi-10-1002-esp4-70082"]},"sources":[{"id":"source.frontier.doi-10-1002-esp4-70082","title":"Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand","url":"https://api.crossref.org/works/10.1002/esp4.70082"},{"id":"doi:10.1002/esp4.70082","title":"doi:10.1002/esp4.70082","url":"https://doi.org/10.1002/esp4.70082"}],"status":"frontier","summary":"doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-3897-nhcm-3-184711","kind":"claim","label":"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-28","source_ids":["source.frontier.doi-10-3897-nhcm-3-184711"]},"sources":[{"id":"source.frontier.doi-10-3897-nhcm-3-184711","title":"Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ","url":"https://api.crossref.org/works/10.3897/nhcm.3.184711"},{"id":"doi:10.3897/nhcm.3.184711","title":"doi:10.3897/nhcm.3.184711","url":"https://doi.org/10.3897/nhcm.3.184711"}],"status":"frontier","summary":"doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1029-2025gc012776","kind":"claim","label":"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-28","source_ids":["source.frontier.doi-10-1029-2025gc012776"]},"sources":[{"id":"source.frontier.doi-10-1029-2025gc012776","title":"Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ","url":"https://api.crossref.org/works/10.1029/2025gc012776"},{"id":"doi:10.1029/2025gc012776","title":"doi:10.1029/2025gc012776","url":"https://doi.org/10.1029/2025gc012776"}],"status":"frontier","summary":"doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1002-joc-70436","kind":"claim","label":"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-26","source_ids":["source.frontier.doi-10-1002-joc-70436"]},"sources":[{"id":"source.frontier.doi-10-1002-joc-70436","title":"Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process","url":"https://api.crossref.org/works/10.1002/joc.70436"},{"id":"doi:10.1002/joc.70436","title":"doi:10.1002/joc.70436","url":"https://doi.org/10.1002/joc.70436"}],"status":"frontier","summary":"doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"earth","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-2166-hydro-2026-191","kind":"claim","label":"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-23","source_ids":["source.frontier.doi-10-2166-hydro-2026-191"]},"sources":[{"id":"source.frontier.doi-10-2166-hydro-2026-191","title":"Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation","url":"https://api.crossref.org/works/10.2166/hydro.2026.191"},{"id":"doi:10.2166/hydro.2026.191","title":"doi:10.2166/hydro.2026.191","url":"https://doi.org/10.2166/hydro.2026.191"}],"status":"frontier","summary":"doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-ojoa-70020","kind":"claim","label":"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-06","source_ids":["source.frontier.doi-10-1111-ojoa-70020"]},"sources":[{"id":"source.frontier.doi-10-1111-ojoa-70020","title":"Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE","url":"https://api.crossref.org/works/10.1111/ojoa.70020"},{"id":"doi:10.1111/ojoa.70020","title":"doi:10.1111/ojoa.70020","url":"https://doi.org/10.1111/ojoa.70020"}],"status":"frontier","summary":"doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"humanities","era":"frontier","frontier":true,"id":"claim.frontier.doi-10-1111-phpr-70116","kind":"claim","label":"Metaethics and the Functions of Moral Language","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-05-03","source_ids":["source.frontier.doi-10-1111-phpr-70116"]},"sources":[{"id":"source.frontier.doi-10-1111-phpr-70116","title":"Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language","url":"https://api.crossref.org/works/10.1111/phpr.70116"},{"id":"doi:10.1111/phpr.70116","title":"doi:10.1111/phpr.70116","url":"https://doi.org/10.1111/phpr.70116"}],"status":"frontier","summary":"doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-21653","kind":"claim","label":"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-15","source_ids":["source.frontier.arxiv-2610-21653"]},"sources":[{"id":"source.frontier.arxiv-2610-21653","title":"arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"},{"id":"arxiv:2610.21653","title":"arXiv:2610.21653","url":"https://arxiv.org/abs/2610.21653"}],"status":"frontier","summary":"arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-19722","kind":"claim","label":"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.arxiv-2610-19722"]},"sources":[{"id":"source.frontier.arxiv-2610-19722","title":"arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"},{"id":"arxiv:2610.19722","title":"arXiv:2610.19722","url":"https://arxiv.org/abs/2610.19722"}],"status":"frontier","summary":"arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-19515","kind":"claim","label":"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-14","source_ids":["source.frontier.arxiv-2610-19515"]},"sources":[{"id":"source.frontier.arxiv-2610-19515","title":"arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"},{"id":"arxiv:2610.19515","title":"arXiv:2610.19515","url":"https://arxiv.org/abs/2610.19515"}],"status":"frontier","summary":"arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-19137","kind":"claim","label":"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-13","source_ids":["source.frontier.arxiv-2610-19137"]},"sources":[{"id":"source.frontier.arxiv-2610-19137","title":"arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"},{"id":"arxiv:2610.19137","title":"arXiv:2610.19137","url":"https://arxiv.org/abs/2610.19137"}],"status":"frontier","summary":"arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-17295","kind":"claim","label":"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.arxiv-2610-17295"]},"sources":[{"id":"source.frontier.arxiv-2610-17295","title":"arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"},{"id":"arxiv:2610.17295","title":"arXiv:2610.17295","url":"https://arxiv.org/abs/2610.17295"}],"status":"frontier","summary":"arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-16273","kind":"claim","label":"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.arxiv-2610-16273"]},"sources":[{"id":"source.frontier.arxiv-2610-16273","title":"arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"},{"id":"arxiv:2610.16273","title":"arXiv:2610.16273","url":"https://arxiv.org/abs/2610.16273"}],"status":"frontier","summary":"arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-16259","kind":"claim","label":"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-12","source_ids":["source.frontier.arxiv-2610-16259"]},"sources":[{"id":"source.frontier.arxiv-2610-16259","title":"arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"},{"id":"arxiv:2610.16259","title":"arXiv:2610.16259","url":"https://arxiv.org/abs/2610.16259"}],"status":"frontier","summary":"arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-15934","kind":"claim","label":"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-11","source_ids":["source.frontier.arxiv-2610-15934"]},"sources":[{"id":"source.frontier.arxiv-2610-15934","title":"arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv"},{"id":"arxiv:2610.15934","title":"arXiv:2610.15934","url":"https://arxiv.org/abs/2610.15934"}],"status":"frontier","summary":"arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-15072","kind":"claim","label":"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-10","source_ids":["source.frontier.arxiv-2610-15072"]},"sources":[{"id":"source.frontier.arxiv-2610-15072","title":"arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"},{"id":"arxiv:2610.15072","title":"arXiv:2610.15072","url":"https://arxiv.org/abs/2610.15072"}],"status":"frontier","summary":"arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-15052","kind":"claim","label":"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-10","source_ids":["source.frontier.arxiv-2610-15052"]},"sources":[{"id":"source.frontier.arxiv-2610-15052","title":"arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"},{"id":"arxiv:2610.15052","title":"arXiv:2610.15052","url":"https://arxiv.org/abs/2610.15052"},{"id":"doi:10.1109/rusautocon69876.2026.11707364","title":"doi:10.1109/rusautocon69876.2026.11707364","url":"https://doi.org/10.1109/rusautocon69876.2026.11707364"}],"status":"frontier","summary":"arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-13424","kind":"claim","label":"Minimum-Energy Control for Stochastic Linear Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.arxiv-2610-13424"]},"sources":[{"id":"source.frontier.arxiv-2610-13424","title":"arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"},{"id":"arxiv:2610.13424","title":"arXiv:2610.13424","url":"https://arxiv.org/abs/2610.13424"}],"status":"frontier","summary":"arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-13402","kind":"claim","label":"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-09","source_ids":["source.frontier.arxiv-2610-13402"]},"sources":[{"id":"source.frontier.arxiv-2610-13402","title":"arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"},{"id":"arxiv:2610.13402","title":"arXiv:2610.13402","url":"https://arxiv.org/abs/2610.13402"}],"status":"frontier","summary":"arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-12779","kind":"claim","label":"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-12779"]},"sources":[{"id":"source.frontier.arxiv-2610-12779","title":"arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"},{"id":"arxiv:2610.12779","title":"arXiv:2610.12779","url":"https://arxiv.org/abs/2610.12779"}],"status":"frontier","summary":"arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-12604","kind":"claim","label":"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-12604"]},"sources":[{"id":"source.frontier.arxiv-2610-12604","title":"arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"},{"id":"arxiv:2610.12604","title":"arXiv:2610.12604","url":"https://arxiv.org/abs/2610.12604"}],"status":"frontier","summary":"arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-12592","kind":"claim","label":"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-12592"]},"sources":[{"id":"source.frontier.arxiv-2610-12592","title":"arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"},{"id":"arxiv:2610.12592","title":"arXiv:2610.12592","url":"https://arxiv.org/abs/2610.12592"}],"status":"frontier","summary":"arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-12038","kind":"claim","label":"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-12038"]},"sources":[{"id":"source.frontier.arxiv-2610-12038","title":"arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"},{"id":"arxiv:2610.12038","title":"arXiv:2610.12038","url":"https://arxiv.org/abs/2610.12038"}],"status":"frontier","summary":"arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-11869","kind":"claim","label":"Learning structured linear dynamical systems from missing observations","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-11869"]},"sources":[{"id":"source.frontier.arxiv-2610-11869","title":"arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"},{"id":"arxiv:2610.11869","title":"arXiv:2610.11869","url":"https://arxiv.org/abs/2610.11869"}],"status":"frontier","summary":"arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-11359","kind":"claim","label":"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-11359"]},"sources":[{"id":"source.frontier.arxiv-2610-11359","title":"arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"},{"id":"arxiv:2610.11359","title":"arXiv:2610.11359","url":"https://arxiv.org/abs/2610.11359"}],"status":"frontier","summary":"arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04959","kind":"claim","label":"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-08","source_ids":["source.frontier.arxiv-2610-04959"]},"sources":[{"id":"source.frontier.arxiv-2610-04959","title":"arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"},{"id":"arxiv:2610.04959","title":"arXiv:2610.04959","url":"https://arxiv.org/abs/2610.04959"}],"status":"frontier","summary":"arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-09266","kind":"claim","label":"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-07","source_ids":["source.frontier.arxiv-2610-09266"]},"sources":[{"id":"source.frontier.arxiv-2610-09266","title":"arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"},{"id":"arxiv:2610.09266","title":"arXiv:2610.09266","url":"https://arxiv.org/abs/2610.09266"}],"status":"frontier","summary":"arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-09080","kind":"claim","label":"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.arxiv-2610-09080"]},"sources":[{"id":"source.frontier.arxiv-2610-09080","title":"arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"},{"id":"arxiv:2610.09080","title":"arXiv:2610.09080","url":"https://arxiv.org/abs/2610.09080"}],"status":"frontier","summary":"arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-09010","kind":"claim","label":"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.arxiv-2610-09010"]},"sources":[{"id":"source.frontier.arxiv-2610-09010","title":"arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"},{"id":"arxiv:2610.09010","title":"arXiv:2610.09010","url":"https://arxiv.org/abs/2610.09010"}],"status":"frontier","summary":"arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-08744","kind":"claim","label":"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.arxiv-2610-08744"]},"sources":[{"id":"source.frontier.arxiv-2610-08744","title":"arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"},{"id":"arxiv:2610.08744","title":"arXiv:2610.08744","url":"https://arxiv.org/abs/2610.08744"}],"status":"frontier","summary":"arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-07616","kind":"claim","label":"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-06","source_ids":["source.frontier.arxiv-2610-07616"]},"sources":[{"id":"source.frontier.arxiv-2610-07616","title":"arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"},{"id":"arxiv:2610.07616","title":"arXiv:2610.07616","url":"https://arxiv.org/abs/2610.07616"}],"status":"frontier","summary":"arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-07307","kind":"claim","label":"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-05","source_ids":["source.frontier.arxiv-2610-07307"]},"sources":[{"id":"source.frontier.arxiv-2610-07307","title":"arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"},{"id":"arxiv:2610.07307","title":"arXiv:2610.07307","url":"https://arxiv.org/abs/2610.07307"}],"status":"frontier","summary":"arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-06601","kind":"claim","label":"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-05","source_ids":["source.frontier.arxiv-2610-06601"]},"sources":[{"id":"source.frontier.arxiv-2610-06601","title":"arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"},{"id":"arxiv:2610.06601","title":"arXiv:2610.06601","url":"https://arxiv.org/abs/2610.06601"}],"status":"frontier","summary":"arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04776","kind":"claim","label":"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-03","source_ids":["source.frontier.arxiv-2610-04776"]},"sources":[{"id":"source.frontier.arxiv-2610-04776","title":"arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"},{"id":"arxiv:2610.04776","title":"arXiv:2610.04776","url":"https://arxiv.org/abs/2610.04776"}],"status":"frontier","summary":"arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04697","kind":"claim","label":"Efficiency and robustness partition the solution space for memory in recurrent networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-03","source_ids":["source.frontier.arxiv-2610-04697"]},"sources":[{"id":"source.frontier.arxiv-2610-04697","title":"arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"},{"id":"arxiv:2610.04697","title":"arXiv:2610.04697","url":"https://arxiv.org/abs/2610.04697"}],"status":"frontier","summary":"arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04662","kind":"claim","label":"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-03","source_ids":["source.frontier.arxiv-2610-04662"]},"sources":[{"id":"source.frontier.arxiv-2610-04662","title":"arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"},{"id":"arxiv:2610.04662","title":"arXiv:2610.04662","url":"https://arxiv.org/abs/2610.04662"}],"status":"frontier","summary":"arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04630","kind":"claim","label":"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-03","source_ids":["source.frontier.arxiv-2610-04630"]},"sources":[{"id":"source.frontier.arxiv-2610-04630","title":"arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"},{"id":"arxiv:2610.04630","title":"arXiv:2610.04630","url":"https://arxiv.org/abs/2610.04630"}],"status":"frontier","summary":"arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-04242","kind":"claim","label":"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-03","source_ids":["source.frontier.arxiv-2610-04242"]},"sources":[{"id":"source.frontier.arxiv-2610-04242","title":"arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"},{"id":"arxiv:2610.04242","title":"arXiv:2610.04242","url":"https://arxiv.org/abs/2610.04242"}],"status":"frontier","summary":"arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-06918","kind":"claim","label":"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.arxiv-2610-06918"]},"sources":[{"id":"source.frontier.arxiv-2610-06918","title":"arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"},{"id":"arxiv:2610.06918","title":"arXiv:2610.06918","url":"https://arxiv.org/abs/2610.06918"}],"status":"frontier","summary":"arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-03964","kind":"claim","label":"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.arxiv-2610-03964"]},"sources":[{"id":"source.frontier.arxiv-2610-03964","title":"arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"},{"id":"arxiv:2610.03964","title":"arXiv:2610.03964","url":"https://arxiv.org/abs/2610.03964"}],"status":"frontier","summary":"arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2610-03008","kind":"claim","label":"Response Variability and Stability in Human Reasoning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-10-02","source_ids":["source.frontier.arxiv-2610-03008"]},"sources":[{"id":"source.frontier.arxiv-2610-03008","title":"arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"},{"id":"arxiv:2610.03008","title":"arXiv:2610.03008","url":"https://arxiv.org/abs/2610.03008"}],"status":"frontier","summary":"arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-39776","kind":"claim","label":"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.arxiv-2609-39776"]},"sources":[{"id":"source.frontier.arxiv-2609-39776","title":"arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"},{"id":"arxiv:2609.39776","title":"arXiv:2609.39776","url":"https://arxiv.org/abs/2609.39776"}],"status":"frontier","summary":"arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21813","kind":"claim","label":"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-30","source_ids":["source.frontier.arxiv-2609-21813"]},"sources":[{"id":"source.frontier.arxiv-2609-21813","title":"arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"},{"id":"arxiv:2609.21813","title":"arXiv:2609.21813","url":"https://arxiv.org/abs/2609.21813"}],"status":"frontier","summary":"arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-36354","kind":"claim","label":"Explainability from Training with Applications to TCR-Epitope Prediction","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.arxiv-2609-36354"]},"sources":[{"id":"source.frontier.arxiv-2609-36354","title":"arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"},{"id":"arxiv:2609.36354","title":"arXiv:2609.36354","url":"https://arxiv.org/abs/2609.36354"}],"status":"frontier","summary":"arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-35424","kind":"claim","label":"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.arxiv-2609-35424"]},"sources":[{"id":"source.frontier.arxiv-2609-35424","title":"arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"},{"id":"arxiv:2609.35424","title":"arXiv:2609.35424","url":"https://arxiv.org/abs/2609.35424"}],"status":"frontier","summary":"arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-35246","kind":"claim","label":"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-28","source_ids":["source.frontier.arxiv-2609-35246"]},"sources":[{"id":"source.frontier.arxiv-2609-35246","title":"arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"},{"id":"arxiv:2609.35246","title":"arXiv:2609.35246","url":"https://arxiv.org/abs/2609.35246"}],"status":"frontier","summary":"arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-32315","kind":"claim","label":"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-26","source_ids":["source.frontier.arxiv-2609-32315"]},"sources":[{"id":"source.frontier.arxiv-2609-32315","title":"arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"},{"id":"arxiv:2609.32315","title":"arXiv:2609.32315","url":"https://arxiv.org/abs/2609.32315"}],"status":"frontier","summary":"arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"health","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-29972","kind":"claim","label":"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.arxiv-2609-29972"]},"sources":[{"id":"source.frontier.arxiv-2609-29972","title":"arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"},{"id":"arxiv:2609.29972","title":"arXiv:2609.29972","url":"https://arxiv.org/abs/2609.29972"}],"status":"frontier","summary":"arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-29832","kind":"claim","label":"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-24","source_ids":["source.frontier.arxiv-2609-29832"]},"sources":[{"id":"source.frontier.arxiv-2609-29832","title":"arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"},{"id":"arxiv:2609.29832","title":"arXiv:2609.29832","url":"https://arxiv.org/abs/2609.29832"},{"id":"doi:10.2514/1.c038636","title":"doi:10.2514/1.c038636","url":"https://doi.org/10.2514/1.c038636"}],"status":"frontier","summary":"arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-28815","kind":"claim","label":"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-23","source_ids":["source.frontier.arxiv-2609-28815"]},"sources":[{"id":"source.frontier.arxiv-2609-28815","title":"arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"},{"id":"arxiv:2609.28815","title":"arXiv:2609.28815","url":"https://arxiv.org/abs/2609.28815"}],"status":"frontier","summary":"arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-26924","kind":"claim","label":"nnFoundation: 3D Foundation Models for Radiology","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-22","source_ids":["source.frontier.arxiv-2609-26924"]},"sources":[{"id":"source.frontier.arxiv-2609-26924","title":"arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"},{"id":"arxiv:2609.26924","title":"arXiv:2609.26924","url":"https://arxiv.org/abs/2609.26924"}],"status":"frontier","summary":"arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-25847","kind":"claim","label":"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-22","source_ids":["source.frontier.arxiv-2609-25847"]},"sources":[{"id":"source.frontier.arxiv-2609-25847","title":"arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"},{"id":"arxiv:2609.25847","title":"arXiv:2609.25847","url":"https://arxiv.org/abs/2609.25847"}],"status":"frontier","summary":"arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-25701","kind":"claim","label":"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-22","source_ids":["source.frontier.arxiv-2609-25701"]},"sources":[{"id":"source.frontier.arxiv-2609-25701","title":"arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"},{"id":"arxiv:2609.25701","title":"arXiv:2609.25701","url":"https://arxiv.org/abs/2609.25701"}],"status":"frontier","summary":"arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-25437","kind":"claim","label":"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.arxiv-2609-25437"]},"sources":[{"id":"source.frontier.arxiv-2609-25437","title":"arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"},{"id":"arxiv:2609.25437","title":"arXiv:2609.25437","url":"https://arxiv.org/abs/2609.25437"}],"status":"frontier","summary":"arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-05763","kind":"claim","label":"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-21","source_ids":["source.frontier.arxiv-2609-05763"]},"sources":[{"id":"source.frontier.arxiv-2609-05763","title":"arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"},{"id":"arxiv:2609.05763","title":"arXiv:2609.05763","url":"https://arxiv.org/abs/2609.05763"}],"status":"frontier","summary":"arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-23703","kind":"claim","label":"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-20","source_ids":["source.frontier.arxiv-2609-23703"]},"sources":[{"id":"source.frontier.arxiv-2609-23703","title":"arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"},{"id":"arxiv:2609.23703","title":"arXiv:2609.23703","url":"https://arxiv.org/abs/2609.23703"}],"status":"frontier","summary":"arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-23199","kind":"claim","label":"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.arxiv-2609-23199"]},"sources":[{"id":"source.frontier.arxiv-2609-23199","title":"arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"},{"id":"arxiv:2609.23199","title":"arXiv:2609.23199","url":"https://arxiv.org/abs/2609.23199"},{"id":"doi:10.1109/jphot.2026.3734836","title":"doi:10.1109/jphot.2026.3734836","url":"https://doi.org/10.1109/jphot.2026.3734836"}],"status":"frontier","summary":"arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-23085","kind":"claim","label":"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.arxiv-2609-23085"]},"sources":[{"id":"source.frontier.arxiv-2609-23085","title":"arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"},{"id":"arxiv:2609.23085","title":"arXiv:2609.23085","url":"https://arxiv.org/abs/2609.23085"}],"status":"frontier","summary":"arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-22775","kind":"claim","label":"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-19","source_ids":["source.frontier.arxiv-2609-22775"]},"sources":[{"id":"source.frontier.arxiv-2609-22775","title":"arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"},{"id":"arxiv:2609.22775","title":"arXiv:2609.22775","url":"https://arxiv.org/abs/2609.22775"}],"status":"frontier","summary":"arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-22615","kind":"claim","label":"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.arxiv-2609-22615"]},"sources":[{"id":"source.frontier.arxiv-2609-22615","title":"arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"},{"id":"arxiv:2609.22615","title":"arXiv:2609.22615","url":"https://arxiv.org/abs/2609.22615"}],"status":"frontier","summary":"arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21966","kind":"claim","label":"Automata-Theoretic Verification of Interval Markov Decision Processes","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.arxiv-2609-21966"]},"sources":[{"id":"source.frontier.arxiv-2609-21966","title":"arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"},{"id":"arxiv:2609.21966","title":"arXiv:2609.21966","url":"https://arxiv.org/abs/2609.21966"}],"status":"frontier","summary":"arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21270","kind":"claim","label":"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-18","source_ids":["source.frontier.arxiv-2609-21270"]},"sources":[{"id":"source.frontier.arxiv-2609-21270","title":"arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"},{"id":"arxiv:2609.21270","title":"arXiv:2609.21270","url":"https://arxiv.org/abs/2609.21270"}],"status":"frontier","summary":"arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21093","kind":"claim","label":"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.arxiv-2609-21093"]},"sources":[{"id":"source.frontier.arxiv-2609-21093","title":"arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"},{"id":"arxiv:2609.21093","title":"arXiv:2609.21093","url":"https://arxiv.org/abs/2609.21093"}],"status":"frontier","summary":"arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-21057","kind":"claim","label":"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-17","source_ids":["source.frontier.arxiv-2609-21057"]},"sources":[{"id":"source.frontier.arxiv-2609-21057","title":"arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"},{"id":"arxiv:2609.21057","title":"arXiv:2609.21057","url":"https://arxiv.org/abs/2609.21057"}],"status":"frontier","summary":"arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-19468","kind":"claim","label":"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.arxiv-2609-19468"]},"sources":[{"id":"source.frontier.arxiv-2609-19468","title":"arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"},{"id":"arxiv:2609.19468","title":"arXiv:2609.19468","url":"https://arxiv.org/abs/2609.19468"}],"status":"frontier","summary":"arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-18467","kind":"claim","label":"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-16","source_ids":["source.frontier.arxiv-2609-18467"]},"sources":[{"id":"source.frontier.arxiv-2609-18467","title":"arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"},{"id":"arxiv:2609.18467","title":"arXiv:2609.18467","url":"https://arxiv.org/abs/2609.18467"}],"status":"frontier","summary":"arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-17042","kind":"claim","label":"Learning Options for Compositional Motor Control with Adapter Banks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.arxiv-2609-17042"]},"sources":[{"id":"source.frontier.arxiv-2609-17042","title":"arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"},{"id":"arxiv:2609.17042","title":"arXiv:2609.17042","url":"https://arxiv.org/abs/2609.17042"}],"status":"frontier","summary":"arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-16899","kind":"claim","label":"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-15","source_ids":["source.frontier.arxiv-2609-16899"]},"sources":[{"id":"source.frontier.arxiv-2609-16899","title":"arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"},{"id":"arxiv:2609.16899","title":"arXiv:2609.16899","url":"https://arxiv.org/abs/2609.16899"}],"status":"frontier","summary":"arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-16353","kind":"claim","label":"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.arxiv-2609-16353"]},"sources":[{"id":"source.frontier.arxiv-2609-16353","title":"arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"},{"id":"arxiv:2609.16353","title":"arXiv:2609.16353","url":"https://arxiv.org/abs/2609.16353"}],"status":"frontier","summary":"arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-16258","kind":"claim","label":"The AI-Enabled Scientific Frontier","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-14","source_ids":["source.frontier.arxiv-2609-16258"]},"sources":[{"id":"source.frontier.arxiv-2609-16258","title":"arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"},{"id":"arxiv:2609.16258","title":"arXiv:2609.16258","url":"https://arxiv.org/abs/2609.16258"}],"status":"frontier","summary":"arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-05749","kind":"claim","label":"The Normalization of Deviance in AI Development","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-13","source_ids":["source.frontier.arxiv-2609-05749"]},"sources":[{"id":"source.frontier.arxiv-2609-05749","title":"arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"},{"id":"arxiv:2609.05749","title":"arXiv:2609.05749","url":"https://arxiv.org/abs/2609.05749"}],"status":"frontier","summary":"arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-14022","kind":"claim","label":"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-12","source_ids":["source.frontier.arxiv-2609-14022"]},"sources":[{"id":"source.frontier.arxiv-2609-14022","title":"arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"},{"id":"arxiv:2609.14022","title":"arXiv:2609.14022","url":"https://arxiv.org/abs/2609.14022"}],"status":"frontier","summary":"arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-12866","kind":"claim","label":"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.arxiv-2609-12866"]},"sources":[{"id":"source.frontier.arxiv-2609-12866","title":"arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"},{"id":"arxiv:2609.12866","title":"arXiv:2609.12866","url":"https://arxiv.org/abs/2609.12866"}],"status":"frontier","summary":"arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-12486","kind":"claim","label":"Adaptive Agent Design","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-11","source_ids":["source.frontier.arxiv-2609-12486"]},"sources":[{"id":"source.frontier.arxiv-2609-12486","title":"arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"},{"id":"arxiv:2609.12486","title":"arXiv:2609.12486","url":"https://arxiv.org/abs/2609.12486"}],"status":"frontier","summary":"arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-12016","kind":"claim","label":"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.arxiv-2609-12016"]},"sources":[{"id":"source.frontier.arxiv-2609-12016","title":"arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"},{"id":"arxiv:2609.12016","title":"arXiv:2609.12016","url":"https://arxiv.org/abs/2609.12016"}],"status":"frontier","summary":"arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-11530","kind":"claim","label":"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-10","source_ids":["source.frontier.arxiv-2609-11530"]},"sources":[{"id":"source.frontier.arxiv-2609-11530","title":"arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"},{"id":"arxiv:2609.11530","title":"arXiv:2609.11530","url":"https://arxiv.org/abs/2609.11530"}],"status":"frontier","summary":"arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-08218","kind":"claim","label":"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-09","source_ids":["source.frontier.arxiv-2609-08218"]},"sources":[{"id":"source.frontier.arxiv-2609-08218","title":"arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"},{"id":"arxiv:2609.08218","title":"arXiv:2609.08218","url":"https://arxiv.org/abs/2609.08218"}],"status":"frontier","summary":"arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-06163","kind":"claim","label":"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.arxiv-2609-06163"]},"sources":[{"id":"source.frontier.arxiv-2609-06163","title":"arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"},{"id":"arxiv:2609.06163","title":"arXiv:2609.06163","url":"https://arxiv.org/abs/2609.06163"}],"status":"frontier","summary":"arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-06066","kind":"claim","label":"Scalability of Graph Neural Network Policies in Wireless Communication Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-05","source_ids":["source.frontier.arxiv-2609-06066"]},"sources":[{"id":"source.frontier.arxiv-2609-06066","title":"arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"},{"id":"arxiv:2609.06066","title":"arXiv:2609.06066","url":"https://arxiv.org/abs/2609.06066"}],"status":"frontier","summary":"arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2609-02071","kind":"claim","label":"Turnpike properties in nonlinear system identification","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-09-02","source_ids":["source.frontier.arxiv-2609-02071"]},"sources":[{"id":"source.frontier.arxiv-2609-02071","title":"arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"},{"id":"arxiv:2609.02071","title":"arXiv:2609.02071","url":"https://arxiv.org/abs/2609.02071"}],"status":"frontier","summary":"arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-31034","kind":"claim","label":"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-31","source_ids":["source.frontier.arxiv-2608-31034"]},"sources":[{"id":"source.frontier.arxiv-2608-31034","title":"arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"},{"id":"arxiv:2608.31034","title":"arXiv:2608.31034","url":"https://arxiv.org/abs/2608.31034"}],"status":"frontier","summary":"arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-28387","kind":"claim","label":"Neuromorphic architectures as numerical solvers for computational neuroscience","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-28","source_ids":["source.frontier.arxiv-2608-28387"]},"sources":[{"id":"source.frontier.arxiv-2608-28387","title":"arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"},{"id":"arxiv:2608.28387","title":"arXiv:2608.28387","url":"https://arxiv.org/abs/2608.28387"}],"status":"frontier","summary":"arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-27536","kind":"claim","label":"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-27","source_ids":["source.frontier.arxiv-2608-27536"]},"sources":[{"id":"source.frontier.arxiv-2608-27536","title":"arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"},{"id":"arxiv:2608.27536","title":"arXiv:2608.27536","url":"https://arxiv.org/abs/2608.27536"}],"status":"frontier","summary":"arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-26093","kind":"claim","label":"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-26","source_ids":["source.frontier.arxiv-2608-26093"]},"sources":[{"id":"source.frontier.arxiv-2608-26093","title":"arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"},{"id":"arxiv:2608.26093","title":"arXiv:2608.26093","url":"https://arxiv.org/abs/2608.26093"}],"status":"frontier","summary":"arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-24219","kind":"claim","label":"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.arxiv-2608-24219"]},"sources":[{"id":"source.frontier.arxiv-2608-24219","title":"arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"},{"id":"arxiv:2608.24219","title":"arXiv:2608.24219","url":"https://arxiv.org/abs/2608.24219"}],"status":"frontier","summary":"arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-23972","kind":"claim","label":"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-25","source_ids":["source.frontier.arxiv-2608-23972"]},"sources":[{"id":"source.frontier.arxiv-2608-23972","title":"arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"},{"id":"arxiv:2608.23972","title":"arXiv:2608.23972","url":"https://arxiv.org/abs/2608.23972"}],"status":"frontier","summary":"arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-21764","kind":"claim","label":"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-22","source_ids":["source.frontier.arxiv-2608-21764"]},"sources":[{"id":"source.frontier.arxiv-2608-21764","title":"arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"},{"id":"arxiv:2608.21764","title":"arXiv:2608.21764","url":"https://arxiv.org/abs/2608.21764"}],"status":"frontier","summary":"arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-21020","kind":"claim","label":"Frequency-Selective Pinching-Antenna Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.arxiv-2608-21020"]},"sources":[{"id":"source.frontier.arxiv-2608-21020","title":"arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"},{"id":"arxiv:2608.21020","title":"arXiv:2608.21020","url":"https://arxiv.org/abs/2608.21020"}],"status":"frontier","summary":"arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-20723","kind":"claim","label":"Conscious Access as Continuous-to-Discrete Translation","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-21","source_ids":["source.frontier.arxiv-2608-20723"]},"sources":[{"id":"source.frontier.arxiv-2608-20723","title":"arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"},{"id":"arxiv:2608.20723","title":"arXiv:2608.20723","url":"https://arxiv.org/abs/2608.20723"}],"status":"frontier","summary":"arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-19416","kind":"claim","label":"Robust Near-Field Beam Focusing Under Imperfect Localization","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-19","source_ids":["source.frontier.arxiv-2608-19416"]},"sources":[{"id":"source.frontier.arxiv-2608-19416","title":"arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"},{"id":"arxiv:2608.19416","title":"arXiv:2608.19416","url":"https://arxiv.org/abs/2608.19416"}],"status":"frontier","summary":"arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-18396","kind":"claim","label":"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.arxiv-2608-18396"]},"sources":[{"id":"source.frontier.arxiv-2608-18396","title":"arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"},{"id":"arxiv:2608.18396","title":"arXiv:2608.18396","url":"https://arxiv.org/abs/2608.18396"}],"status":"frontier","summary":"arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-18060","kind":"claim","label":"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-18","source_ids":["source.frontier.arxiv-2608-18060"]},"sources":[{"id":"source.frontier.arxiv-2608-18060","title":"arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"},{"id":"arxiv:2608.18060","title":"arXiv:2608.18060","url":"https://arxiv.org/abs/2608.18060"}],"status":"frontier","summary":"arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-16290","kind":"claim","label":"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-17","source_ids":["source.frontier.arxiv-2608-16290"]},"sources":[{"id":"source.frontier.arxiv-2608-16290","title":"arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"},{"id":"arxiv:2608.16290","title":"arXiv:2608.16290","url":"https://arxiv.org/abs/2608.16290"}],"status":"frontier","summary":"arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-12037","kind":"claim","label":"Clustered Randomized Smoothing for Stochastic Prediction Functions","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.arxiv-2608-12037"]},"sources":[{"id":"source.frontier.arxiv-2608-12037","title":"arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"},{"id":"arxiv:2608.12037","title":"arXiv:2608.12037","url":"https://arxiv.org/abs/2608.12037"}],"status":"frontier","summary":"arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-11929","kind":"claim","label":"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-12","source_ids":["source.frontier.arxiv-2608-11929"]},"sources":[{"id":"source.frontier.arxiv-2608-11929","title":"arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"},{"id":"arxiv:2608.11929","title":"arXiv:2608.11929","url":"https://arxiv.org/abs/2608.11929"}],"status":"frontier","summary":"arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-11175","kind":"claim","label":"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.arxiv-2608-11175"]},"sources":[{"id":"source.frontier.arxiv-2608-11175","title":"arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"},{"id":"arxiv:2608.11175","title":"arXiv:2608.11175","url":"https://arxiv.org/abs/2608.11175"}],"status":"frontier","summary":"arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-10825","kind":"claim","label":"Cross-modal topology decodes battery faults from sparse voltage snapshots","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.arxiv-2608-10825"]},"sources":[{"id":"source.frontier.arxiv-2608-10825","title":"arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"},{"id":"arxiv:2608.10825","title":"arXiv:2608.10825","url":"https://arxiv.org/abs/2608.10825"}],"status":"frontier","summary":"arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-08151","kind":"claim","label":"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-11","source_ids":["source.frontier.arxiv-2608-08151"]},"sources":[{"id":"source.frontier.arxiv-2608-08151","title":"arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"},{"id":"arxiv:2608.08151","title":"arXiv:2608.08151","url":"https://arxiv.org/abs/2608.08151"}],"status":"frontier","summary":"arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-10254","kind":"claim","label":"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-10","source_ids":["source.frontier.arxiv-2608-10254"]},"sources":[{"id":"source.frontier.arxiv-2608-10254","title":"arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"},{"id":"arxiv:2608.10254","title":"arXiv:2608.10254","url":"https://arxiv.org/abs/2608.10254"}],"status":"frontier","summary":"arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-08599","kind":"claim","label":"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-09","source_ids":["source.frontier.arxiv-2608-08599"]},"sources":[{"id":"source.frontier.arxiv-2608-08599","title":"arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"},{"id":"arxiv:2608.08599","title":"arXiv:2608.08599","url":"https://arxiv.org/abs/2608.08599"}],"status":"frontier","summary":"arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-12398","kind":"claim","label":"A Hierarchical Energy-Based Model for Multimodal Cognition","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-08","source_ids":["source.frontier.arxiv-2608-12398"]},"sources":[{"id":"source.frontier.arxiv-2608-12398","title":"arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"},{"id":"arxiv:2608.12398","title":"arXiv:2608.12398","url":"https://arxiv.org/abs/2608.12398"}],"status":"frontier","summary":"arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-07289","kind":"claim","label":"Synthesizing Voltage Ride-Through Controllers for Data Centers","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-07","source_ids":["source.frontier.arxiv-2608-07289"]},"sources":[{"id":"source.frontier.arxiv-2608-07289","title":"arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"},{"id":"arxiv:2608.07289","title":"arXiv:2608.07289","url":"https://arxiv.org/abs/2608.07289"}],"status":"frontier","summary":"arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-05481","kind":"claim","label":"From Local Learning to Global Prediction Through Layered Surprise Cascades","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-06","source_ids":["source.frontier.arxiv-2608-05481"]},"sources":[{"id":"source.frontier.arxiv-2608-05481","title":"arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"},{"id":"arxiv:2608.05481","title":"arXiv:2608.05481","url":"https://arxiv.org/abs/2608.05481"}],"status":"frontier","summary":"arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-05348","kind":"claim","label":"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-05","source_ids":["source.frontier.arxiv-2608-05348"]},"sources":[{"id":"source.frontier.arxiv-2608-05348","title":"arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"},{"id":"arxiv:2608.05348","title":"arXiv:2608.05348","url":"https://arxiv.org/abs/2608.05348"}],"status":"frontier","summary":"arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-12393","kind":"claim","label":"Metacognitive Skill Learning: A Computational Account","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-12393"]},"sources":[{"id":"source.frontier.arxiv-2608-12393","title":"arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"},{"id":"arxiv:2608.12393","title":"arXiv:2608.12393","url":"https://arxiv.org/abs/2608.12393"}],"status":"frontier","summary":"arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-04227","kind":"claim","label":"Random features for Grassmannian kernel approximation with bounded rank-one projections","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-04227"]},"sources":[{"id":"source.frontier.arxiv-2608-04227","title":"arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"},{"id":"arxiv:2608.04227","title":"arXiv:2608.04227","url":"https://arxiv.org/abs/2608.04227"}],"status":"frontier","summary":"arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-04133","kind":"claim","label":"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-04133"]},"sources":[{"id":"source.frontier.arxiv-2608-04133","title":"arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"},{"id":"arxiv:2608.04133","title":"arXiv:2608.04133","url":"https://arxiv.org/abs/2608.04133"}],"status":"frontier","summary":"arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-03967","kind":"claim","label":"Information-Geometric Forward Policy Training in GFlowNets","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-03967"]},"sources":[{"id":"source.frontier.arxiv-2608-03967","title":"arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"},{"id":"arxiv:2608.03967","title":"arXiv:2608.03967","url":"https://arxiv.org/abs/2608.03967"}],"status":"frontier","summary":"arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02978","kind":"claim","label":"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-02978"]},"sources":[{"id":"source.frontier.arxiv-2608-02978","title":"arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"},{"id":"arxiv:2608.02978","title":"arXiv:2608.02978","url":"https://arxiv.org/abs/2608.02978"}],"status":"frontier","summary":"arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02976","kind":"claim","label":"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-04","source_ids":["source.frontier.arxiv-2608-02976"]},"sources":[{"id":"source.frontier.arxiv-2608-02976","title":"arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"},{"id":"arxiv:2608.02976","title":"arXiv:2608.02976","url":"https://arxiv.org/abs/2608.02976"}],"status":"frontier","summary":"arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02244","kind":"claim","label":"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.arxiv-2608-02244"]},"sources":[{"id":"source.frontier.arxiv-2608-02244","title":"arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"},{"id":"arxiv:2608.02244","title":"arXiv:2608.02244","url":"https://arxiv.org/abs/2608.02244"}],"status":"frontier","summary":"arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-02079","kind":"claim","label":"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-03","source_ids":["source.frontier.arxiv-2608-02079"]},"sources":[{"id":"source.frontier.arxiv-2608-02079","title":"arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"},{"id":"arxiv:2608.02079","title":"arXiv:2608.02079","url":"https://arxiv.org/abs/2608.02079"}],"status":"frontier","summary":"arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-01220","kind":"claim","label":"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.arxiv-2608-01220"]},"sources":[{"id":"source.frontier.arxiv-2608-01220","title":"arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"},{"id":"arxiv:2608.01220","title":"arXiv:2608.01220","url":"https://arxiv.org/abs/2608.01220"}],"status":"frontier","summary":"arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2608-00959","kind":"claim","label":"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-08-02","source_ids":["source.frontier.arxiv-2608-00959"]},"sources":[{"id":"source.frontier.arxiv-2608-00959","title":"arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"},{"id":"arxiv:2608.00959","title":"arXiv:2608.00959","url":"https://arxiv.org/abs/2608.00959"}],"status":"frontier","summary":"arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-17248","kind":"claim","label":"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-17248"]},"sources":[{"id":"source.frontier.arxiv-2607-17248","title":"arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"},{"id":"arxiv:2607.17248","title":"arXiv:2607.17248","url":"https://arxiv.org/abs/2607.17248"}],"status":"frontier","summary":"arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-14144","kind":"claim","label":"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-31","source_ids":["source.frontier.arxiv-2607-14144"]},"sources":[{"id":"source.frontier.arxiv-2607-14144","title":"arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"},{"id":"arxiv:2607.14144","title":"arXiv:2607.14144","url":"https://arxiv.org/abs/2607.14144"}],"status":"frontier","summary":"arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28833","kind":"claim","label":"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28833"]},"sources":[{"id":"source.frontier.arxiv-2607-28833","title":"arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"},{"id":"arxiv:2607.28833","title":"arXiv:2607.28833","url":"https://arxiv.org/abs/2607.28833"}],"status":"frontier","summary":"arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28780","kind":"claim","label":"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28780"]},"sources":[{"id":"source.frontier.arxiv-2607-28780","title":"arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"},{"id":"arxiv:2607.28780","title":"arXiv:2607.28780","url":"https://arxiv.org/abs/2607.28780"},{"id":"doi:10.1002/mar.70105","title":"doi:10.1002/mar.70105","url":"https://doi.org/10.1002/mar.70105"}],"status":"frontier","summary":"arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28276","kind":"claim","label":"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28276"]},"sources":[{"id":"source.frontier.arxiv-2607-28276","title":"arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"},{"id":"arxiv:2607.28276","title":"arXiv:2607.28276","url":"https://arxiv.org/abs/2607.28276"}],"status":"frontier","summary":"arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28224","kind":"claim","label":"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28224"]},"sources":[{"id":"source.frontier.arxiv-2607-28224","title":"arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv"},{"id":"arxiv:2607.28224","title":"arXiv:2607.28224","url":"https://arxiv.org/abs/2607.28224"}],"status":"frontier","summary":"arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"information","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-28185","kind":"claim","label":"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-30","source_ids":["source.frontier.arxiv-2607-28185"]},"sources":[{"id":"source.frontier.arxiv-2607-28185","title":"arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"},{"id":"arxiv:2607.28185","title":"arXiv:2607.28185","url":"https://arxiv.org/abs/2607.28185"}],"status":"frontier","summary":"arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-26209","kind":"claim","label":"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-26209"]},"sources":[{"id":"source.frontier.arxiv-2607-26209","title":"arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"},{"id":"arxiv:2607.26209","title":"arXiv:2607.26209","url":"https://arxiv.org/abs/2607.26209"},{"id":"doi:10.1109/ojcoms.2026.3717118","title":"doi:10.1109/ojcoms.2026.3717118","url":"https://doi.org/10.1109/ojcoms.2026.3717118"}],"status":"frontier","summary":"arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25526","kind":"claim","label":"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-28","source_ids":["source.frontier.arxiv-2607-25526"]},"sources":[{"id":"source.frontier.arxiv-2607-25526","title":"arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"},{"id":"arxiv:2607.25526","title":"arXiv:2607.25526","url":"https://arxiv.org/abs/2607.25526"}],"status":"frontier","summary":"arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-25081","kind":"claim","label":"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-25081"]},"sources":[{"id":"source.frontier.arxiv-2607-25081","title":"arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"},{"id":"arxiv:2607.25081","title":"arXiv:2607.25081","url":"https://arxiv.org/abs/2607.25081"}],"status":"frontier","summary":"arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"engineering","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24423","kind":"claim","label":"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24423"]},"sources":[{"id":"source.frontier.arxiv-2607-24423","title":"arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"},{"id":"arxiv:2607.24423","title":"arXiv:2607.24423","url":"https://arxiv.org/abs/2607.24423"}],"status":"frontier","summary":"arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-24360","kind":"claim","label":"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-27","source_ids":["source.frontier.arxiv-2607-24360"]},"sources":[{"id":"source.frontier.arxiv-2607-24360","title":"arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"},{"id":"arxiv:2607.24360","title":"arXiv:2607.24360","url":"https://arxiv.org/abs/2607.24360"}],"status":"frontier","summary":"arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"","tags":["frontier","public-result"]},{"aliases":[],"domain":"social","era":"frontier","frontier":true,"id":"claim.frontier.arxiv-2607-22049","kind":"claim","label":"ELSA as an asset to the EU Quantum Act: A position paper","public_frontier":{"capability_status":"publicly-described","category":"public-result","disclosed_at":"2026-07-24","source_ids":["source.frontier.arxiv-2607-22049"]},"sources":[{"id":"source.frontier.arxiv-2607-22049","title":"arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper","url":"https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"},{"id":"arxiv:2607.22049","title":"arXiv:2607.22049","url":"https://arxiv.org/abs/2607.22049"}],"status":"frontier","summary":"arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"","tags":["frontier","public-result"]}],"protocol":"fog-atlas-display/1","reviews":[{"author":"historical scientific record","date":"1770s–1790s","id":"review.phlogiston.001","kind":"supersession","result":"failed","summary":"Quantitative combustion chemistry and oxygen theory displaced phlogiston as an explanatory account.","target":"claim.phlogiston"},{"author":"historical epidemiology & microbiology","date":"19th century","id":"review.miasma.001","kind":"counterevidence + replacement","result":"failed","summary":"Transmission evidence and identification of pathogens overturned miasma as a general infectious-disease cause.","target":"claim.miasma"},{"author":"nemesis-smoke","date":"2026-10-06","id":"review.smoke.automate.001","kind":"format_check","result":"neutral","sources":[],"summary":"ok","target":"smoke.automate-merge"},{"author":"worker-3","date":"2026-10-06","id":"review.lambda-cdm.dark-energy.20261006","kind":"evidence_review","result":"challenged-not-invalidated","summary":"DESI DR2 BAO combinations strengthened hints of evolving dark energy, while 2026 DESI Lyman-alpha full-shape results shift toward LambdaCDM; the collaboration says the hints may fade or a more complex model may be required. ([desi.lbl.gov](https://www.desi.lbl.gov/2025/03/19/more-than-a-hint-of-evolving-dark-energy-new-results-and-data-from-desi/?utm_source=chatgpt.com))","target":"physical.lambda-cdm"},{"author":"worker-3","date":"2026-10-06","id":"review.w0wa.dark-energy.20261006","kind":"evidence_review","result":"mixed-support-frontier","summary":"DES Y6 reports a 2.2 sigma deviation from a cosmological constant internally, rising to 3.0 sigma with primary CMB information, while its constant-w fit shows no significant preference over LambdaCDM. ([darkenergysurvey.org](https://www.darkenergysurvey.org/des-y6-cosmology-results-papers/?utm_source=chatgpt.com))","target":"physical.w0wa-cdm"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.qg-entanglement-scope.002","kind":"interpretation_scope","result":"neutral","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"summary":"Entanglement alone is not encoded as uniquely establishing quantized gravity.","target":"evidence.classical-gravity-entanglement-2025"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.single-graviton-scope.002","kind":"interpretation_scope","result":"neutral","sources":[{"id":"arxiv:2308.15440","url":"https://arxiv.org/abs/2308.15440"}],"summary":"Single-graviton signatures are encoded as proposed evidence, not an achieved detection.","target":"concept.single-graviton-signature"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.qg-liv-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1305.3463","url":"https://arxiv.org/abs/1305.3463"}],"summary":"Timing limits constrain specific dispersive models only.","target":"evidence.qg-liv-constraint-2013"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.wimp-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"summary":"Null result constrains tested WIMP parameter space without eliminating dark matter.","target":"evidence.xenonnt-null-2025"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.lz-event-scope.002","kind":"significance_scope","result":"neutral","sources":[{"id":"lz:2026-high-energy-search","url":"https://lz.lbl.gov/"}],"summary":"The recoil-like event is not encoded as a dark-matter discovery; reported global significance remains limited.","target":"evidence.lz-high-energy-event-2026"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.axion-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"summary":"ADMX exclusion is bounded to the cited mass range and assumptions.","target":"evidence.admx-dfsz-exclusion"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.pbh-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1901.07120","url":"https://arxiv.org/abs/1901.07120"}],"summary":"Microlensing limits cover only the tested PBH mass-abundance region.","target":"evidence.ogle-pbh-constraint"},{"author":"fog-crew:w2","date":"2026-10-07","id":"review.fuzzy-scope.002","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:1703.04683","url":"https://arxiv.org/abs/1703.04683"}],"summary":"Fuzzy-DM bounds depend on astrophysical and thermal-history assumptions.","target":"evidence.fuzzy-dm-lyman-alpha-limit"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.qg-entanglement-scope","kind":"interpretation_scope","result":"neutral","sources":[{"id":"nature:s41586-025-09595-7","url":"https://www.nature.com/articles/s41586-025-09595-7"}],"summary":"Entanglement alone is not encoded as uniquely proving quantized gravity; scaling remains a candidate discriminator.","target":"evidence.classical-gravity-entanglement-2025"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.wimp-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"doi:10.1103/msw4-t342","url":"https://journals.aps.org/prl/abstract/10.1103/msw4-t342"}],"summary":"Null excess constrains tested WIMP parameter space and does not eliminate dark matter generally.","target":"evidence.xenonnt-null-2025"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.lz-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2410.17036","url":"https://arxiv.org/abs/2410.17036"}],"summary":"LZ null result narrows modeled WIMP interactions without resolving dark-matter identity.","target":"evidence.lz-null-2024"},{"author":"fog-crew:w2","date":"2026-10-06","id":"review.axion-scope","kind":"constraint_scope","result":"neutral","sources":[{"id":"arxiv:2010.06183","url":"https://arxiv.org/abs/2010.06183"}],"summary":"ADMX exclusion applies to the cited mass range and density assumptions, not all axion parameter space.","target":"evidence.admx-dfsz-exclusion"}],"schema_version":1,"taxonomy":[{"child":"concept.aat.300015650","id":"taxonomy.aat.concept.aat.300015650.concept.aat.300015649","parent":"concept.aat.300015649","type":"narrower"},{"child":"concept.aat.300015667","id":"taxonomy.aat.concept.aat.300015667.concept.aat.300015649","parent":"concept.aat.300015649","type":"narrower"},{"child":"concept.aat.300015692","id":"taxonomy.aat.concept.aat.300015692.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015702","id":"taxonomy.aat.concept.aat.300015702.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015723","id":"taxonomy.aat.concept.aat.300015723.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015727","id":"taxonomy.aat.concept.aat.300015727.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300015759","id":"taxonomy.aat.concept.aat.300015759.concept.aat.300015690","parent":"concept.aat.300015690","type":"narrower"},{"child":"concept.aat.300016598","id":"taxonomy.aat.concept.aat.300016598.concept.aat.300108572","parent":"concept.aat.300108572","type":"narrower"},{"child":"concept.aat.300016600","id":"taxonomy.aat.concept.aat.300016600.concept.aat.300108572","parent":"concept.aat.300108572","type":"narrower"},{"child":"concept.aat.300017437","id":"taxonomy.aat.concept.aat.300017437.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300018115","id":"taxonomy.aat.concept.aat.300018115.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300018704","id":"taxonomy.aat.concept.aat.300018704.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019088","id":"taxonomy.aat.concept.aat.300019088.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019104","id":"taxonomy.aat.concept.aat.300019104.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300019258","id":"taxonomy.aat.concept.aat.300019258.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019264","id":"taxonomy.aat.concept.aat.300019264.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019267","id":"taxonomy.aat.concept.aat.300019267.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300019273","id":"taxonomy.aat.concept.aat.300019273.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300019275","id":"taxonomy.aat.concept.aat.300019275.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300019276","id":"taxonomy.aat.concept.aat.300019276.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019277","id":"taxonomy.aat.concept.aat.300019277.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019278","id":"taxonomy.aat.concept.aat.300019278.concept.aat.300019275","parent":"concept.aat.300019275","type":"narrower"},{"child":"concept.aat.300019279","id":"taxonomy.aat.concept.aat.300019279.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300021861","id":"taxonomy.aat.concept.aat.300021861.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300021867","id":"taxonomy.aat.concept.aat.300021867.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300021944","id":"taxonomy.aat.concept.aat.300021944.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300054236","id":"taxonomy.aat.concept.aat.300054236.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300054272","id":"taxonomy.aat.concept.aat.300054272.field.aat.300112920","parent":"field.aat.300112920","type":"narrower"},{"child":"concept.aat.300054274","id":"taxonomy.aat.concept.aat.300054274.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"concept.aat.300054672","id":"taxonomy.aat.concept.aat.300054672.field.aat.300054275","parent":"field.aat.300054275","type":"narrower"},{"child":"concept.aat.300055156","id":"taxonomy.aat.concept.aat.300055156.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055826","id":"taxonomy.aat.concept.aat.300055826.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055829","id":"taxonomy.aat.concept.aat.300055829.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055837","id":"taxonomy.aat.concept.aat.300055837.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055845","id":"taxonomy.aat.concept.aat.300055845.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300055945","id":"taxonomy.aat.concept.aat.300055945.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300055946","id":"taxonomy.aat.concept.aat.300055946.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300055947","id":"taxonomy.aat.concept.aat.300055947.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300055963","id":"taxonomy.aat.concept.aat.300055963.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055970","id":"taxonomy.aat.concept.aat.300055970.concept.aat.300055969","parent":"concept.aat.300055969","type":"narrower"},{"child":"concept.aat.300055982","id":"taxonomy.aat.concept.aat.300055982.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300055983","id":"taxonomy.aat.concept.aat.300055983.concept.aat.300056005","parent":"concept.aat.300056005","type":"narrower"},{"child":"concept.aat.300055988","id":"taxonomy.aat.concept.aat.300055988.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055989","id":"taxonomy.aat.concept.aat.300055989.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055990","id":"taxonomy.aat.concept.aat.300055990.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055991","id":"taxonomy.aat.concept.aat.300055991.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300055992","id":"taxonomy.aat.concept.aat.300055992.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055993","id":"taxonomy.aat.concept.aat.300055993.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055995","id":"taxonomy.aat.concept.aat.300055995.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055996","id":"taxonomy.aat.concept.aat.300055996.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055997","id":"taxonomy.aat.concept.aat.300055997.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055998","id":"taxonomy.aat.concept.aat.300055998.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300055999","id":"taxonomy.aat.concept.aat.300055999.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056000","id":"taxonomy.aat.concept.aat.300056000.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056002","id":"taxonomy.aat.concept.aat.300056002.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300056003","id":"taxonomy.aat.concept.aat.300056003.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300056004","id":"taxonomy.aat.concept.aat.300056004.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300056005","id":"taxonomy.aat.concept.aat.300056005.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300056180","id":"taxonomy.aat.concept.aat.300056180.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300056183","id":"taxonomy.aat.concept.aat.300056183.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300065709","id":"taxonomy.aat.concept.aat.300065709.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300066049","id":"taxonomy.aat.concept.aat.300066049.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300067974","id":"taxonomy.aat.concept.aat.300067974.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300068765","id":"taxonomy.aat.concept.aat.300068765.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300069306","id":"taxonomy.aat.concept.aat.300069306.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300072604","id":"taxonomy.aat.concept.aat.300072604.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300073437","id":"taxonomy.aat.concept.aat.300073437.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300080819","id":"taxonomy.aat.concept.aat.300080819.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300106724","id":"taxonomy.aat.concept.aat.300106724.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300106738","id":"taxonomy.aat.concept.aat.300106738.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106739","id":"taxonomy.aat.concept.aat.300106739.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106745","id":"taxonomy.aat.concept.aat.300106745.concept.aat.300019279","parent":"concept.aat.300019279","type":"narrower"},{"child":"concept.aat.300106747","id":"taxonomy.aat.concept.aat.300106747.concept.aat.300106723","parent":"concept.aat.300106723","type":"narrower"},{"child":"concept.aat.300106757","id":"taxonomy.aat.concept.aat.300106757.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300106759","id":"taxonomy.aat.concept.aat.300106759.concept.aat.300106747","parent":"concept.aat.300106747","type":"narrower"},{"child":"concept.aat.300107946","id":"taxonomy.aat.concept.aat.300107946.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300111149","id":"taxonomy.aat.concept.aat.300111149.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300111241","id":"taxonomy.aat.concept.aat.300111241.concept.aat.300021516","parent":"concept.aat.300021516","type":"narrower"},{"child":"concept.aat.300120146","id":"taxonomy.aat.concept.aat.300120146.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300124083","id":"taxonomy.aat.concept.aat.300124083.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300143325","id":"taxonomy.aat.concept.aat.300143325.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300145975","id":"taxonomy.aat.concept.aat.300145975.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300179281","id":"taxonomy.aat.concept.aat.300179281.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300179426","id":"taxonomy.aat.concept.aat.300179426.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300179462","id":"taxonomy.aat.concept.aat.300179462.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300185658","id":"taxonomy.aat.concept.aat.300185658.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300193867","id":"taxonomy.aat.concept.aat.300193867.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300237780","id":"taxonomy.aat.concept.aat.300237780.concept.aat.300179462","parent":"concept.aat.300179462","type":"narrower"},{"child":"concept.aat.300240013","id":"taxonomy.aat.concept.aat.300240013.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300247349","id":"taxonomy.aat.concept.aat.300247349.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300257052","id":"taxonomy.aat.concept.aat.300257052.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300262589","id":"taxonomy.aat.concept.aat.300262589.concept.aat.300262588","parent":"concept.aat.300262588","type":"narrower"},{"child":"concept.aat.300263186","id":"taxonomy.aat.concept.aat.300263186.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264303","id":"taxonomy.aat.concept.aat.300264303.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264304","id":"taxonomy.aat.concept.aat.300264304.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264305","id":"taxonomy.aat.concept.aat.300264305.concept.aat.300264530","parent":"concept.aat.300264530","type":"narrower"},{"child":"concept.aat.300264310","id":"taxonomy.aat.concept.aat.300264310.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264321","id":"taxonomy.aat.concept.aat.300264321.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264322","id":"taxonomy.aat.concept.aat.300264322.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300264335","id":"taxonomy.aat.concept.aat.300264335.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264336","id":"taxonomy.aat.concept.aat.300264336.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264338","id":"taxonomy.aat.concept.aat.300264338.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264356","id":"taxonomy.aat.concept.aat.300264356.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264359","id":"taxonomy.aat.concept.aat.300264359.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300264365","id":"taxonomy.aat.concept.aat.300264365.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264384","id":"taxonomy.aat.concept.aat.300264384.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264385","id":"taxonomy.aat.concept.aat.300264385.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264386","id":"taxonomy.aat.concept.aat.300264386.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300264429","id":"taxonomy.aat.concept.aat.300264429.concept.aat.300021516","parent":"concept.aat.300021516","type":"narrower"},{"child":"concept.aat.300264475","id":"taxonomy.aat.concept.aat.300264475.concept.aat.300257052","parent":"concept.aat.300257052","type":"narrower"},{"child":"concept.aat.300264482","id":"taxonomy.aat.concept.aat.300264482.concept.aat.300264528","parent":"concept.aat.300264528","type":"narrower"},{"child":"concept.aat.300264486","id":"taxonomy.aat.concept.aat.300264486.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300264504","id":"taxonomy.aat.concept.aat.300264504.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300264527","id":"taxonomy.aat.concept.aat.300264527.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264528","id":"taxonomy.aat.concept.aat.300264528.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264529","id":"taxonomy.aat.concept.aat.300264529.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264530","id":"taxonomy.aat.concept.aat.300264530.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300264773","id":"taxonomy.aat.concept.aat.300264773.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300264775","id":"taxonomy.aat.concept.aat.300264775.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300265781","id":"taxonomy.aat.concept.aat.300265781.concept.aat.300055945","parent":"concept.aat.300055945","type":"narrower"},{"child":"concept.aat.300265797","id":"taxonomy.aat.concept.aat.300265797.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300266052","id":"taxonomy.aat.concept.aat.300266052.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300266055","id":"taxonomy.aat.concept.aat.300266055.concept.aat.300266054","parent":"concept.aat.300266054","type":"narrower"},{"child":"concept.aat.300266058","id":"taxonomy.aat.concept.aat.300266058.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300266399","id":"taxonomy.aat.concept.aat.300266399.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300266783","id":"taxonomy.aat.concept.aat.300266783.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300310095","id":"taxonomy.aat.concept.aat.300310095.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300310716","id":"taxonomy.aat.concept.aat.300310716.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300310717","id":"taxonomy.aat.concept.aat.300310717.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300310718","id":"taxonomy.aat.concept.aat.300310718.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300310748","id":"taxonomy.aat.concept.aat.300310748.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300379068","id":"taxonomy.aat.concept.aat.300379068.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379085","id":"taxonomy.aat.concept.aat.300379085.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300379123","id":"taxonomy.aat.concept.aat.300379123.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379137","id":"taxonomy.aat.concept.aat.300379137.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300379723","id":"taxonomy.aat.concept.aat.300379723.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300379822","id":"taxonomy.aat.concept.aat.300379822.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300379854","id":"taxonomy.aat.concept.aat.300379854.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300380145","id":"taxonomy.aat.concept.aat.300380145.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300380150","id":"taxonomy.aat.concept.aat.300380150.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300386039","id":"taxonomy.aat.concept.aat.300386039.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300386130","id":"taxonomy.aat.concept.aat.300386130.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300386138","id":"taxonomy.aat.concept.aat.300386138.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300386148","id":"taxonomy.aat.concept.aat.300386148.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300387114","id":"taxonomy.aat.concept.aat.300387114.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300387753","id":"taxonomy.aat.concept.aat.300387753.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300391196","id":"taxonomy.aat.concept.aat.300391196.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300391434","id":"taxonomy.aat.concept.aat.300391434.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300391479","id":"taxonomy.aat.concept.aat.300391479.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"concept.aat.300393171","id":"taxonomy.aat.concept.aat.300393171.concept.aat.300266573","parent":"concept.aat.300266573","type":"narrower"},{"child":"concept.aat.300395490","id":"taxonomy.aat.concept.aat.300395490.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300403938","id":"taxonomy.aat.concept.aat.300403938.concept.aat.300020656","parent":"concept.aat.300020656","type":"narrower"},{"child":"concept.aat.300403945","id":"taxonomy.aat.concept.aat.300403945.concept.aat.300106724","parent":"concept.aat.300106724","type":"narrower"},{"child":"concept.aat.300403979","id":"taxonomy.aat.concept.aat.300403979.concept.aat.300417578","parent":"concept.aat.300417578","type":"narrower"},{"child":"concept.aat.300404618","id":"taxonomy.aat.concept.aat.300404618.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404619","id":"taxonomy.aat.concept.aat.300404619.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404702","id":"taxonomy.aat.concept.aat.300404702.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404706","id":"taxonomy.aat.concept.aat.300404706.concept.aat.300264486","parent":"concept.aat.300264486","type":"narrower"},{"child":"concept.aat.300404712","id":"taxonomy.aat.concept.aat.300404712.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300404756","id":"taxonomy.aat.concept.aat.300404756.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300410257","id":"taxonomy.aat.concept.aat.300410257.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300410285","id":"taxonomy.aat.concept.aat.300410285.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300410287","id":"taxonomy.aat.concept.aat.300410287.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300410316","id":"taxonomy.aat.concept.aat.300410316.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412040","id":"taxonomy.aat.concept.aat.300412040.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412041","id":"taxonomy.aat.concept.aat.300412041.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412084","id":"taxonomy.aat.concept.aat.300412084.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300412108","id":"taxonomy.aat.concept.aat.300412108.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300412116","id":"taxonomy.aat.concept.aat.300412116.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412128","id":"taxonomy.aat.concept.aat.300412128.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300412140","id":"taxonomy.aat.concept.aat.300412140.concept.aat.300410316","parent":"concept.aat.300410316","type":"narrower"},{"child":"concept.aat.300412141","id":"taxonomy.aat.concept.aat.300412141.concept.aat.300410316","parent":"concept.aat.300410316","type":"narrower"},{"child":"concept.aat.300417271","id":"taxonomy.aat.concept.aat.300417271.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300417325","id":"taxonomy.aat.concept.aat.300417325.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300417426","id":"taxonomy.aat.concept.aat.300417426.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300435308","id":"taxonomy.aat.concept.aat.300435308.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300435319","id":"taxonomy.aat.concept.aat.300435319.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300438472","id":"taxonomy.aat.concept.aat.300438472.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300438552","id":"taxonomy.aat.concept.aat.300438552.concept.aat.300264529","parent":"concept.aat.300264529","type":"narrower"},{"child":"concept.aat.300438813","id":"taxonomy.aat.concept.aat.300438813.concept.aat.300021854","parent":"concept.aat.300021854","type":"narrower"},{"child":"concept.aat.300444302","id":"taxonomy.aat.concept.aat.300444302.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300444313","id":"taxonomy.aat.concept.aat.300444313.concept.aat.300444301","parent":"concept.aat.300444301","type":"narrower"},{"child":"concept.aat.300444994","id":"taxonomy.aat.concept.aat.300444994.concept.aat.300266481","parent":"concept.aat.300266481","type":"narrower"},{"child":"concept.aat.300446915","id":"taxonomy.aat.concept.aat.300446915.concept.aat.300264530","parent":"concept.aat.300264530","type":"narrower"},{"child":"concept.aat.300447407","id":"taxonomy.aat.concept.aat.300447407.concept.aat.300264527","parent":"concept.aat.300264527","type":"narrower"},{"child":"concept.aat.300449137","id":"taxonomy.aat.concept.aat.300449137.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300451043","id":"taxonomy.aat.concept.aat.300451043.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300451359","id":"taxonomy.aat.concept.aat.300451359.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300451673","id":"taxonomy.aat.concept.aat.300451673.concept.aat.300417616","parent":"concept.aat.300417616","type":"narrower"},{"child":"concept.aat.300457703","id":"taxonomy.aat.concept.aat.300457703.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457715","id":"taxonomy.aat.concept.aat.300457715.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457738","id":"taxonomy.aat.concept.aat.300457738.concept.aat.300016617","parent":"concept.aat.300016617","type":"narrower"},{"child":"concept.aat.300457805","id":"taxonomy.aat.concept.aat.300457805.concept.aat.300056005","parent":"concept.aat.300056005","type":"narrower"},{"child":"concept.aat.300458684","id":"taxonomy.aat.concept.aat.300458684.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458696","id":"taxonomy.aat.concept.aat.300458696.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458697","id":"taxonomy.aat.concept.aat.300458697.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458718","id":"taxonomy.aat.concept.aat.300458718.concept.aat.300145975","parent":"concept.aat.300145975","type":"narrower"},{"child":"concept.aat.300458936","id":"taxonomy.aat.concept.aat.300458936.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458937","id":"taxonomy.aat.concept.aat.300458937.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458939","id":"taxonomy.aat.concept.aat.300458939.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458945","id":"taxonomy.aat.concept.aat.300458945.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"concept.aat.300458946","id":"taxonomy.aat.concept.aat.300458946.concept.aat.300120146","parent":"concept.aat.300120146","type":"narrower"},{"child":"field.aat.300054162","id":"taxonomy.aat.field.aat.300054162.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054233","id":"taxonomy.aat.field.aat.300054233.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054240","id":"taxonomy.aat.field.aat.300054240.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300054241","id":"taxonomy.aat.field.aat.300054241.field.aat.300054240","parent":"field.aat.300054240","type":"narrower"},{"child":"field.aat.300054247","id":"taxonomy.aat.field.aat.300054247.field.aat.300054245","parent":"field.aat.300054245","type":"narrower"},{"child":"field.aat.300054248","id":"taxonomy.aat.field.aat.300054248.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054250","id":"taxonomy.aat.field.aat.300054250.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054251","id":"taxonomy.aat.field.aat.300054251.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054254","id":"taxonomy.aat.field.aat.300054254.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300054255","id":"taxonomy.aat.field.aat.300054255.field.aat.300054247","parent":"field.aat.300054247","type":"narrower"},{"child":"field.aat.300054256","id":"taxonomy.aat.field.aat.300054256.field.aat.300054245","parent":"field.aat.300054245","type":"narrower"},{"child":"field.aat.300054257","id":"taxonomy.aat.field.aat.300054257.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054258","id":"taxonomy.aat.field.aat.300054258.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054262","id":"taxonomy.aat.field.aat.300054262.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054263","id":"taxonomy.aat.field.aat.300054263.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054264","id":"taxonomy.aat.field.aat.300054264.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054268","id":"taxonomy.aat.field.aat.300054268.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"field.aat.300054307","id":"taxonomy.aat.field.aat.300054307.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054308","id":"taxonomy.aat.field.aat.300054308.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054309","id":"taxonomy.aat.field.aat.300054309.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054310","id":"taxonomy.aat.field.aat.300054310.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054311","id":"taxonomy.aat.field.aat.300054311.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054312","id":"taxonomy.aat.field.aat.300054312.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300055987","id":"taxonomy.aat.field.aat.300055987.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"field.aat.300069325","id":"taxonomy.aat.field.aat.300069325.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300080402","id":"taxonomy.aat.field.aat.300080402.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300112920","id":"taxonomy.aat.field.aat.300112920.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300168233","id":"taxonomy.aat.field.aat.300168233.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"field.aat.300174160","id":"taxonomy.aat.field.aat.300174160.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300174173","id":"taxonomy.aat.field.aat.300174173.field.aat.300054273","parent":"field.aat.300054273","type":"narrower"},{"child":"field.aat.300205021","id":"taxonomy.aat.field.aat.300205021.field.aat.300054240","parent":"field.aat.300054240","type":"narrower"},{"child":"field.aat.300258340","id":"taxonomy.aat.field.aat.300258340.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"field.aat.300379540","id":"taxonomy.aat.field.aat.300379540.field.aat.300054233","parent":"field.aat.300054233","type":"narrower"},{"child":"field.aat.300387576","id":"taxonomy.aat.field.aat.300387576.field.aat.300054275","parent":"field.aat.300054275","type":"narrower"},{"child":"field.aat.300389757","id":"taxonomy.aat.field.aat.300389757.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"field.aat.300389758","id":"taxonomy.aat.field.aat.300389758.concept.aat.300137410","parent":"concept.aat.300137410","type":"narrower"},{"child":"claim.des-y6-weak-evolving-dark-energy-preference-reported","id":"taxonomy.claim.des-y6-weak-evolving-dark-energy-preference-reported.narrower.field.cosmology","parent":"field.cosmology","type":"narrower"},{"child":"claim.fermi-gbm-detection-coverage","id":"taxonomy.claim.fermi-gbm-detection-coverage.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"concept.nist.abtree","id":"taxonomy.concept.nist.abtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.activedatastruc","id":"taxonomy.concept.nist.activedatastruc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.adaptkdtree","id":"taxonomy.concept.nist.adaptkdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.adjacencylistrep","id":"taxonomy.concept.nist.adjacencylistrep.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.array","id":"taxonomy.concept.nist.array.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.assocarray","id":"taxonomy.concept.nist.assocarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.avltree","id":"taxonomy.concept.nist.avltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bag","id":"taxonomy.concept.nist.bag.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedbist","id":"taxonomy.concept.nist.balancedbist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedbitr","id":"taxonomy.concept.nist.balancedbitr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.balancedtree","id":"taxonomy.concept.nist.balancedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bangfile","id":"taxonomy.concept.nist.bangfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bbalphatree","id":"taxonomy.concept.nist.bbalphatree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bdd","id":"taxonomy.concept.nist.bdd.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bdtree","id":"taxonomy.concept.nist.bdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binaryheap","id":"taxonomy.concept.nist.binaryheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarypriorityqueue","id":"taxonomy.concept.nist.binarypriorityqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarysearchtree","id":"taxonomy.concept.nist.binarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binarytree","id":"taxonomy.concept.nist.binarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.binomialheap","id":"taxonomy.concept.nist.binomialheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bintree","id":"taxonomy.concept.nist.bintree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bitvector","id":"taxonomy.concept.nist.bitvector.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.blindtrie","id":"taxonomy.concept.nist.blindtrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.blockaddressingindex","id":"taxonomy.concept.nist.blockaddressingindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bloomfilter","id":"taxonomy.concept.nist.bloomfilter.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.boundedqueue","id":"taxonomy.concept.nist.boundedqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.boundedstack","id":"taxonomy.concept.nist.boundedstack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bsptree","id":"taxonomy.concept.nist.bsptree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bstartree","id":"taxonomy.concept.nist.bstartree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.btree","id":"taxonomy.concept.nist.btree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.buckettrie","id":"taxonomy.concept.nist.buckettrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.buddytree","id":"taxonomy.concept.nist.buddytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.bvtree","id":"taxonomy.concept.nist.bvtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.cactusstack","id":"taxonomy.concept.nist.cactusstack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.calendarqueue","id":"taxonomy.concept.nist.calendarqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.celltree","id":"taxonomy.concept.nist.celltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.chaining","id":"taxonomy.concept.nist.chaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.circularlist","id":"taxonomy.concept.nist.circularlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.circularqueue","id":"taxonomy.concept.nist.circularqueue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.coalescedchaining","id":"taxonomy.concept.nist.coalescedchaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.codingtree","id":"taxonomy.concept.nist.codingtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.compactdawg","id":"taxonomy.concept.nist.compactdawg.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.compacttrie","id":"taxonomy.concept.nist.compacttrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completebinarytree","id":"taxonomy.concept.nist.completebinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completetree","id":"taxonomy.concept.nist.completetree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.cuckoohashing","id":"taxonomy.concept.nist.cuckoohashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.deque","id":"taxonomy.concept.nist.deque.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dictionary","id":"taxonomy.concept.nist.dictionary.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.digitalsearchtree","id":"taxonomy.concept.nist.digitalsearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.digitaltree","id":"taxonomy.concept.nist.digitaltree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directchaining","id":"taxonomy.concept.nist.directchaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directedacyclicwordgraph","id":"taxonomy.concept.nist.directedacyclicwordgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.directedgraph","id":"taxonomy.concept.nist.directedgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.discretintrv","id":"taxonomy.concept.nist.discretintrv.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.doubleendpq","id":"taxonomy.concept.nist.doubleendpq.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.doublylinkedlist","id":"taxonomy.concept.nist.doublylinkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dtree","id":"taxonomy.concept.nist.dtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dynamicarray","id":"taxonomy.concept.nist.dynamicarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.dynamichashing","id":"taxonomy.concept.nist.dynamichashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.elasticbuckettrie","id":"taxonomy.concept.nist.elasticbuckettrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.excell","id":"taxonomy.concept.nist.excell.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendedbinarytree","id":"taxonomy.concept.nist.extendedbinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendiblehashing","id":"taxonomy.concept.nist.extendiblehashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.extendkdtree","id":"taxonomy.concept.nist.extendkdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.externalindx","id":"taxonomy.concept.nist.externalindx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.externalmemorydatastr","id":"taxonomy.concept.nist.externalmemorydatastr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fibonacciheap","id":"taxonomy.concept.nist.fibonacciheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fibonaccitree","id":"taxonomy.concept.nist.fibonaccitree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.finitarytree","id":"taxonomy.concept.nist.finitarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.forwardindex","id":"taxonomy.concept.nist.forwardindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fullbinarytree","id":"taxonomy.concept.nist.fullbinarytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.fullinvertedindex","id":"taxonomy.concept.nist.fullinvertedindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.gbdtree","id":"taxonomy.concept.nist.gbdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.graph","id":"taxonomy.concept.nist.graph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.gridfile","id":"taxonomy.concept.nist.gridfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashbelt","id":"taxonomy.concept.nist.hashbelt.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashheap","id":"taxonomy.concept.nist.hashheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hashtab","id":"taxonomy.concept.nist.hashtab.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.hbtree","id":"taxonomy.concept.nist.hbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heap","id":"taxonomy.concept.nist.heap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heightbalancedbinsrchtree","id":"taxonomy.concept.nist.heightbalancedbinsrchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.heightbalancedtree","id":"taxonomy.concept.nist.heightbalancedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.indexfile","id":"taxonomy.concept.nist.indexfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.inversesuffixarray","id":"taxonomy.concept.nist.inversesuffixarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.inversionlist","id":"taxonomy.concept.nist.inversionlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertedfileindex","id":"taxonomy.concept.nist.invertedfileindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertedindex","id":"taxonomy.concept.nist.invertedindex.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.invertiblebloomtable","id":"taxonomy.concept.nist.invertiblebloomtable.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.jellyfish","id":"taxonomy.concept.nist.jellyfish.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.k2tree","id":"taxonomy.concept.nist.k2tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.karyheap","id":"taxonomy.concept.nist.karyheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.karytree","id":"taxonomy.concept.nist.karytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.kdbtree","id":"taxonomy.concept.nist.kdbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.kdtree","id":"taxonomy.concept.nist.kdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.leftisttree","id":"taxonomy.concept.nist.leftisttree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linearprobng","id":"taxonomy.concept.nist.linearprobng.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linearquadtr","id":"taxonomy.concept.nist.linearquadtr.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linkeddatasignature","id":"taxonomy.concept.nist.linkeddatasignature.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.linkedlist","id":"taxonomy.concept.nist.linkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.list","id":"taxonomy.concept.nist.list.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.lowertriangularmatrix","id":"taxonomy.concept.nist.lowertriangularmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.markovchain","id":"taxonomy.concept.nist.markovchain.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.matrix","id":"taxonomy.concept.nist.matrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.merkletree","id":"taxonomy.concept.nist.merkletree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.monotonprioq","id":"taxonomy.concept.nist.monotonprioq.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multigraph","id":"taxonomy.concept.nist.multigraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multilaygrd","id":"taxonomy.concept.nist.multilaygrd.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multisuffixtree","id":"taxonomy.concept.nist.multisuffixtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.multiwaytree","id":"taxonomy.concept.nist.multiwaytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.octree","id":"taxonomy.concept.nist.octree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedarry","id":"taxonomy.concept.nist.orderedarry.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedlinkedlist","id":"taxonomy.concept.nist.orderedlinkedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orderedtree","id":"taxonomy.concept.nist.orderedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.orthogonallists","id":"taxonomy.concept.nist.orthogonallists.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.pagoda","id":"taxonomy.concept.nist.pagoda.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.passivedatastruc","id":"taxonomy.concept.nist.passivedatastruc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.pile","id":"taxonomy.concept.nist.pile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.plophashing","id":"taxonomy.concept.nist.plophashing.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.priorityque","id":"taxonomy.concept.nist.priorityque.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ptree","id":"taxonomy.concept.nist.ptree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.quadtrie","id":"taxonomy.concept.nist.quadtrie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.queue","id":"taxonomy.concept.nist.queue.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.raggedmatrix","id":"taxonomy.concept.nist.raggedmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.randomizedbinarysearchtree","id":"taxonomy.concept.nist.randomizedbinarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rectangmatrx","id":"taxonomy.concept.nist.rectangmatrx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.recursive","id":"taxonomy.concept.nist.recursive.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.redblack","id":"taxonomy.concept.nist.redblack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.relational","id":"taxonomy.concept.nist.relational.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rfile","id":"taxonomy.concept.nist.rfile.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rightthreadedtree","id":"taxonomy.concept.nist.rightthreadedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.rtree","id":"taxonomy.concept.nist.rtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sbbtree","id":"taxonomy.concept.nist.sbbtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.searchtree","id":"taxonomy.concept.nist.searchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.selforganizinglist","id":"taxonomy.concept.nist.selforganizinglist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.separatechaining","id":"taxonomy.concept.nist.separatechaining.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.set","id":"taxonomy.concept.nist.set.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.shadowheap","id":"taxonomy.concept.nist.shadowheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.skdtree","id":"taxonomy.concept.nist.skdtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.skiplist","id":"taxonomy.concept.nist.skiplist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sortedarray","id":"taxonomy.concept.nist.sortedarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sortedlist","id":"taxonomy.concept.nist.sortedlist.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sparsematrix","id":"taxonomy.concept.nist.sparsematrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.splaytree","id":"taxonomy.concept.nist.splaytree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.squarematrix","id":"taxonomy.concept.nist.squarematrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.sstable","id":"taxonomy.concept.nist.sstable.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.stack","id":"taxonomy.concept.nist.stack.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.stdigraph","id":"taxonomy.concept.nist.stdigraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.strictlylowertriangmat","id":"taxonomy.concept.nist.strictlylowertriangmat.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.strictlyuppertriangmat","id":"taxonomy.concept.nist.strictlyuppertriangmat.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.string","id":"taxonomy.concept.nist.string.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.suffixarray","id":"taxonomy.concept.nist.suffixarray.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.suffixtree","id":"taxonomy.concept.nist.suffixtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ternarysearchtree","id":"taxonomy.concept.nist.ternarysearchtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.threadedtree","id":"taxonomy.concept.nist.threadedtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.treap","id":"taxonomy.concept.nist.treap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.tree","id":"taxonomy.concept.nist.tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.trie","id":"taxonomy.concept.nist.trie.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.twingridfl","id":"taxonomy.concept.nist.twingridfl.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.two34tree","id":"taxonomy.concept.nist.two34tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.two3tree","id":"taxonomy.concept.nist.two3tree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.twolevgrid","id":"taxonomy.concept.nist.twolevgrid.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.ubtree","id":"taxonomy.concept.nist.ubtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.undirectedgraph","id":"taxonomy.concept.nist.undirectedgraph.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.uniformmatrx","id":"taxonomy.concept.nist.uniformmatrx.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.unlimitedbranchingtree","id":"taxonomy.concept.nist.unlimitedbranchingtree.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.uppertriangularmatrix","id":"taxonomy.concept.nist.uppertriangularmatrix.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.vanemdeboas","id":"taxonomy.concept.nist.vanemdeboas.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.weakheap","id":"taxonomy.concept.nist.weakheap.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.zipper","id":"taxonomy.concept.nist.zipper.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"field.quantum-gravity","id":"taxonomy.field.quantum-gravity.narrower.field.physics","parent":"field.physics","type":"narrower"},{"child":"claim.frontier.arxiv-2607-26287","id":"taxonomy.frontier.claim.frontier.arxiv-2607-26287.concept.mesh.d000098407","parent":"concept.mesh.d000098407","type":"narrower"},{"child":"claim.frontier.arxiv-2607-28224","id":"taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite","parent":"concept.nist.semidefinite","type":"narrower"},{"child":"claim.frontier.arxiv-2610-15934","id":"taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic","parent":"concept.nist.temporllogic","type":"narrower"},{"child":"concept.go.go0000128","id":"taxonomy.go.concept.go.go0000128.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0000752","id":"taxonomy.go.concept.go.go0000752.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0000785","id":"taxonomy.go.concept.go.go0000785.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0000920","id":"taxonomy.go.concept.go.go0000920.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001400","id":"taxonomy.go.concept.go.go0001400.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001503","id":"taxonomy.go.concept.go.go0001503.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001650","id":"taxonomy.go.concept.go.go0001650.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001651","id":"taxonomy.go.concept.go.go0001651.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001652","id":"taxonomy.go.concept.go.go0001652.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001750","id":"taxonomy.go.concept.go.go0001750.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001763","id":"taxonomy.go.concept.go.go0001763.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001772","id":"taxonomy.go.concept.go.go0001772.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001775","id":"taxonomy.go.concept.go.go0001775.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001776","id":"taxonomy.go.concept.go.go0001776.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0001816","id":"taxonomy.go.concept.go.go0001816.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0001891","id":"taxonomy.go.concept.go.go0001891.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0001906","id":"taxonomy.go.concept.go.go0001906.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0001917","id":"taxonomy.go.concept.go.go0001917.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0002200","id":"taxonomy.go.concept.go.go0002200.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002252","id":"taxonomy.go.concept.go.go0002252.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002253","id":"taxonomy.go.concept.go.go0002253.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002262","id":"taxonomy.go.concept.go.go0002262.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002339","id":"taxonomy.go.concept.go.go0002339.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002404","id":"taxonomy.go.concept.go.go0002404.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002440","id":"taxonomy.go.concept.go.go0002440.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002507","id":"taxonomy.go.concept.go.go0002507.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002520","id":"taxonomy.go.concept.go.go0002520.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0002532","id":"taxonomy.go.concept.go.go0002532.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0003006","id":"taxonomy.go.concept.go.go0003006.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0003008","id":"taxonomy.go.concept.go.go0003008.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0005576","id":"taxonomy.go.concept.go.go0005576.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005630","id":"taxonomy.go.concept.go.go0005630.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005631","id":"taxonomy.go.concept.go.go0005631.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005652","id":"taxonomy.go.concept.go.go0005652.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005654","id":"taxonomy.go.concept.go.go0005654.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005825","id":"taxonomy.go.concept.go.go0005825.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0005829","id":"taxonomy.go.concept.go.go0005829.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0006276","id":"taxonomy.go.concept.go.go0006276.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0006457","id":"taxonomy.go.concept.go.go0006457.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0006515","id":"taxonomy.go.concept.go.go0006515.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007017","id":"taxonomy.go.concept.go.go0007017.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007049","id":"taxonomy.go.concept.go.go0007049.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007117","id":"taxonomy.go.concept.go.go0007117.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0007154","id":"taxonomy.go.concept.go.go0007154.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007155","id":"taxonomy.go.concept.go.go0007155.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007165","id":"taxonomy.go.concept.go.go0007165.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007272","id":"taxonomy.go.concept.go.go0007272.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0007275","id":"taxonomy.go.concept.go.go0007275.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007340","id":"taxonomy.go.concept.go.go0007340.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0007389","id":"taxonomy.go.concept.go.go0007389.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007566","id":"taxonomy.go.concept.go.go0007566.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0007586","id":"taxonomy.go.concept.go.go0007586.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0007623","id":"taxonomy.go.concept.go.go0007623.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0007624","id":"taxonomy.go.concept.go.go0007624.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0008037","id":"taxonomy.go.concept.go.go0008037.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008152","id":"taxonomy.go.concept.go.go0008152.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008219","id":"taxonomy.go.concept.go.go0008219.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008283","id":"taxonomy.go.concept.go.go0008283.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0008340","id":"taxonomy.go.concept.go.go0008340.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009292","id":"taxonomy.go.concept.go.go0009292.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0009407","id":"taxonomy.go.concept.go.go0009407.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0009420","id":"taxonomy.go.concept.go.go0009420.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009421","id":"taxonomy.go.concept.go.go0009421.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009422","id":"taxonomy.go.concept.go.go0009422.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009424","id":"taxonomy.go.concept.go.go0009424.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009431","id":"taxonomy.go.concept.go.go0009431.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009433","id":"taxonomy.go.concept.go.go0009433.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009541","id":"taxonomy.go.concept.go.go0009541.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009542","id":"taxonomy.go.concept.go.go0009542.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009561","id":"taxonomy.go.concept.go.go0009561.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009566","id":"taxonomy.go.concept.go.go0009566.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0009574","id":"taxonomy.go.concept.go.go0009574.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0009653","id":"taxonomy.go.concept.go.go0009653.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0009791","id":"taxonomy.go.concept.go.go0009791.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009838","id":"taxonomy.go.concept.go.go0009838.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0009845","id":"taxonomy.go.concept.go.go0009845.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009846","id":"taxonomy.go.concept.go.go0009846.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0009865","id":"taxonomy.go.concept.go.go0009865.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0010014","id":"taxonomy.go.concept.go.go0010014.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0010022","id":"taxonomy.go.concept.go.go0010022.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010073","id":"taxonomy.go.concept.go.go0010073.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010118","id":"taxonomy.go.concept.go.go0010118.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0010127","id":"taxonomy.go.concept.go.go0010127.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0010162","id":"taxonomy.go.concept.go.go0010162.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0010483","id":"taxonomy.go.concept.go.go0010483.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0012505","id":"taxonomy.go.concept.go.go0012505.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0014705","id":"taxonomy.go.concept.go.go0014705.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0014801","id":"taxonomy.go.concept.go.go0014801.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0016037","id":"taxonomy.go.concept.go.go0016037.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0016049","id":"taxonomy.go.concept.go.go0016049.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0016192","id":"taxonomy.go.concept.go.go0016192.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0016203","id":"taxonomy.go.concept.go.go0016203.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0016328","id":"taxonomy.go.concept.go.go0016328.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0019013","id":"taxonomy.go.concept.go.go0019013.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019028","id":"taxonomy.go.concept.go.go0019028.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019033","id":"taxonomy.go.concept.go.go0019033.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0019042","id":"taxonomy.go.concept.go.go0019042.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019045","id":"taxonomy.go.concept.go.go0019045.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019046","id":"taxonomy.go.concept.go.go0019046.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019058","id":"taxonomy.go.concept.go.go0019058.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019061","id":"taxonomy.go.concept.go.go0019061.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019068","id":"taxonomy.go.concept.go.go0019068.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019069","id":"taxonomy.go.concept.go.go0019069.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019070","id":"taxonomy.go.concept.go.go0019070.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019072","id":"taxonomy.go.concept.go.go0019072.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019075","id":"taxonomy.go.concept.go.go0019075.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019076","id":"taxonomy.go.concept.go.go0019076.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019079","id":"taxonomy.go.concept.go.go0019079.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019080","id":"taxonomy.go.concept.go.go0019080.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019081","id":"taxonomy.go.concept.go.go0019081.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019082","id":"taxonomy.go.concept.go.go0019082.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019083","id":"taxonomy.go.concept.go.go0019083.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0019725","id":"taxonomy.go.concept.go.go0019725.concept.go.go0042592","parent":"concept.go.go0042592","type":"narrower"},{"child":"concept.go.go0019827","id":"taxonomy.go.concept.go.go0019827.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0019835","id":"taxonomy.go.concept.go.go0019835.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0019882","id":"taxonomy.go.concept.go.go0019882.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0019953","id":"taxonomy.go.concept.go.go0019953.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0019954","id":"taxonomy.go.concept.go.go0019954.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0020023","id":"taxonomy.go.concept.go.go0020023.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0020038","id":"taxonomy.go.concept.go.go0020038.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0021700","id":"taxonomy.go.concept.go.go0021700.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0022004","id":"taxonomy.go.concept.go.go0022004.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022005","id":"taxonomy.go.concept.go.go0022005.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022402","id":"taxonomy.go.concept.go.go0022402.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022403","id":"taxonomy.go.concept.go.go0022403.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0022404","id":"taxonomy.go.concept.go.go0022404.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022406","id":"taxonomy.go.concept.go.go0022406.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022412","id":"taxonomy.go.concept.go.go0022412.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0022413","id":"taxonomy.go.concept.go.go0022413.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0022601","id":"taxonomy.go.concept.go.go0022601.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0022602","id":"taxonomy.go.concept.go.go0022602.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0022608","id":"taxonomy.go.concept.go.go0022608.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0022611","id":"taxonomy.go.concept.go.go0022611.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0030017","id":"taxonomy.go.concept.go.go0030017.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030029","id":"taxonomy.go.concept.go.go0030029.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0030061","id":"taxonomy.go.concept.go.go0030061.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030315","id":"taxonomy.go.concept.go.go0030315.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030427","id":"taxonomy.go.concept.go.go0030427.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0030431","id":"taxonomy.go.concept.go.go0030431.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0030447","id":"taxonomy.go.concept.go.go0030447.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0030583","id":"taxonomy.go.concept.go.go0030583.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0030588","id":"taxonomy.go.concept.go.go0030588.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0031128","id":"taxonomy.go.concept.go.go0031128.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0031256","id":"taxonomy.go.concept.go.go0031256.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031257","id":"taxonomy.go.concept.go.go0031257.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031294","id":"taxonomy.go.concept.go.go0031294.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0031424","id":"taxonomy.go.concept.go.go0031424.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0031430","id":"taxonomy.go.concept.go.go0031430.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031672","id":"taxonomy.go.concept.go.go0031672.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031673","id":"taxonomy.go.concept.go.go0031673.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031674","id":"taxonomy.go.concept.go.go0031674.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0031987","id":"taxonomy.go.concept.go.go0031987.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0032153","id":"taxonomy.go.concept.go.go0032153.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032178","id":"taxonomy.go.concept.go.go0032178.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032179","id":"taxonomy.go.concept.go.go0032179.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0032898","id":"taxonomy.go.concept.go.go0032898.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0033036","id":"taxonomy.go.concept.go.go0033036.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0033058","id":"taxonomy.go.concept.go.go0033058.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0033059","id":"taxonomy.go.concept.go.go0033059.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0033060","id":"taxonomy.go.concept.go.go0033060.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0033774","id":"taxonomy.go.concept.go.go0033774.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0034337","id":"taxonomy.go.concept.go.go0034337.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0034381","id":"taxonomy.go.concept.go.go0034381.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035073","id":"taxonomy.go.concept.go.go0035073.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035074","id":"taxonomy.go.concept.go.go0035074.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035172","id":"taxonomy.go.concept.go.go0035172.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0035212","id":"taxonomy.go.concept.go.go0035212.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0035264","id":"taxonomy.go.concept.go.go0035264.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035265","id":"taxonomy.go.concept.go.go0035265.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035314","id":"taxonomy.go.concept.go.go0035314.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0035686","id":"taxonomy.go.concept.go.go0035686.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0035732","id":"taxonomy.go.concept.go.go0035732.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0035749","id":"taxonomy.go.concept.go.go0035749.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0035821","id":"taxonomy.go.concept.go.go0035821.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0035889","id":"taxonomy.go.concept.go.go0035889.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0036166","id":"taxonomy.go.concept.go.go0036166.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0036268","id":"taxonomy.go.concept.go.go0036268.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0036338","id":"taxonomy.go.concept.go.go0036338.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039624","id":"taxonomy.go.concept.go.go0039624.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039625","id":"taxonomy.go.concept.go.go0039625.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039626","id":"taxonomy.go.concept.go.go0039626.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039642","id":"taxonomy.go.concept.go.go0039642.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0039663","id":"taxonomy.go.concept.go.go0039663.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039664","id":"taxonomy.go.concept.go.go0039664.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039665","id":"taxonomy.go.concept.go.go0039665.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039674","id":"taxonomy.go.concept.go.go0039674.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039678","id":"taxonomy.go.concept.go.go0039678.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0039700","id":"taxonomy.go.concept.go.go0039700.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0042303","id":"taxonomy.go.concept.go.go0042303.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0042330","id":"taxonomy.go.concept.go.go0042330.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0042386","id":"taxonomy.go.concept.go.go0042386.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0042628","id":"taxonomy.go.concept.go.go0042628.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0042641","id":"taxonomy.go.concept.go.go0042641.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0042698","id":"taxonomy.go.concept.go.go0042698.concept.go.go0048511","parent":"concept.go.go0048511","type":"narrower"},{"child":"concept.go.go0042763","id":"taxonomy.go.concept.go.go0042763.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0042995","id":"taxonomy.go.concept.go.go0042995.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043036","id":"taxonomy.go.concept.go.go0043036.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043083","id":"taxonomy.go.concept.go.go0043083.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043203","id":"taxonomy.go.concept.go.go0043203.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043204","id":"taxonomy.go.concept.go.go0043204.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043220","id":"taxonomy.go.concept.go.go0043220.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043226","id":"taxonomy.go.concept.go.go0043226.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043335","id":"taxonomy.go.concept.go.go0043335.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0043476","id":"taxonomy.go.concept.go.go0043476.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0043480","id":"taxonomy.go.concept.go.go0043480.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0043670","id":"taxonomy.go.concept.go.go0043670.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043671","id":"taxonomy.go.concept.go.go0043671.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043672","id":"taxonomy.go.concept.go.go0043672.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0043696","id":"taxonomy.go.concept.go.go0043696.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0043934","id":"taxonomy.go.concept.go.go0043934.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0044010","id":"taxonomy.go.concept.go.go0044010.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0044111","id":"taxonomy.go.concept.go.go0044111.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0044232","id":"taxonomy.go.concept.go.go0044232.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0044403","id":"taxonomy.go.concept.go.go0044403.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0044703","id":"taxonomy.go.concept.go.go0044703.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0044706","id":"taxonomy.go.concept.go.go0044706.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0044826","id":"taxonomy.go.concept.go.go0044826.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0044851","id":"taxonomy.go.concept.go.go0044851.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0045056","id":"taxonomy.go.concept.go.go0045056.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0045058","id":"taxonomy.go.concept.go.go0045058.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0045103","id":"taxonomy.go.concept.go.go0045103.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0045171","id":"taxonomy.go.concept.go.go0045171.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0045321","id":"taxonomy.go.concept.go.go0045321.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0045494","id":"taxonomy.go.concept.go.go0045494.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0046727","id":"taxonomy.go.concept.go.go0046727.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0046729","id":"taxonomy.go.concept.go.go0046729.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0046745","id":"taxonomy.go.concept.go.go0046745.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046755","id":"taxonomy.go.concept.go.go0046755.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046784","id":"taxonomy.go.concept.go.go0046784.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046786","id":"taxonomy.go.concept.go.go0046786.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046794","id":"taxonomy.go.concept.go.go0046794.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046807","id":"taxonomy.go.concept.go.go0046807.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0046818","id":"taxonomy.go.concept.go.go0046818.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048046","id":"taxonomy.go.concept.go.go0048046.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048066","id":"taxonomy.go.concept.go.go0048066.concept.go.go0043473","parent":"concept.go.go0043473","type":"narrower"},{"child":"concept.go.go0048471","id":"taxonomy.go.concept.go.go0048471.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0048489","id":"taxonomy.go.concept.go.go0048489.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048532","id":"taxonomy.go.concept.go.go0048532.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048589","id":"taxonomy.go.concept.go.go0048589.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0048609","id":"taxonomy.go.concept.go.go0048609.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0048646","id":"taxonomy.go.concept.go.go0048646.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048647","id":"taxonomy.go.concept.go.go0048647.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048771","id":"taxonomy.go.concept.go.go0048771.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048856","id":"taxonomy.go.concept.go.go0048856.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0048869","id":"taxonomy.go.concept.go.go0048869.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048870","id":"taxonomy.go.concept.go.go0048870.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0048871","id":"taxonomy.go.concept.go.go0048871.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0048878","id":"taxonomy.go.concept.go.go0048878.concept.go.go0042592","parent":"concept.go.go0042592","type":"narrower"},{"child":"concept.go.go0050817","id":"taxonomy.go.concept.go.go0050817.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0050879","id":"taxonomy.go.concept.go.go0050879.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0050900","id":"taxonomy.go.concept.go.go0050900.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0051301","id":"taxonomy.go.concept.go.go0051301.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0051321","id":"taxonomy.go.concept.go.go0051321.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0051410","id":"taxonomy.go.concept.go.go0051410.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0051640","id":"taxonomy.go.concept.go.go0051640.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0051641","id":"taxonomy.go.concept.go.go0051641.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0051674","id":"taxonomy.go.concept.go.go0051674.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0055036","id":"taxonomy.go.concept.go.go0055036.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0055046","id":"taxonomy.go.concept.go.go0055046.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0055085","id":"taxonomy.go.concept.go.go0055085.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0055127","id":"taxonomy.go.concept.go.go0055127.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0060033","id":"taxonomy.go.concept.go.go0060033.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0060104","id":"taxonomy.go.concept.go.go0060104.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060105","id":"taxonomy.go.concept.go.go0060105.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060108","id":"taxonomy.go.concept.go.go0060108.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0060206","id":"taxonomy.go.concept.go.go0060206.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0060352","id":"taxonomy.go.concept.go.go0060352.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0060361","id":"taxonomy.go.concept.go.go0060361.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0060384","id":"taxonomy.go.concept.go.go0060384.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0061687","id":"taxonomy.go.concept.go.go0061687.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0061822","id":"taxonomy.go.concept.go.go0061822.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061823","id":"taxonomy.go.concept.go.go0061823.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061834","id":"taxonomy.go.concept.go.go0061834.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061835","id":"taxonomy.go.concept.go.go0061835.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061842","id":"taxonomy.go.concept.go.go0061842.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0061845","id":"taxonomy.go.concept.go.go0061845.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0061919","id":"taxonomy.go.concept.go.go0061919.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0061948","id":"taxonomy.go.concept.go.go0061948.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0070057","id":"taxonomy.go.concept.go.go0070057.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0070701","id":"taxonomy.go.concept.go.go0070701.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0071554","id":"taxonomy.go.concept.go.go0071554.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0071684","id":"taxonomy.go.concept.go.go0071684.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0071722","id":"taxonomy.go.concept.go.go0071722.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0071808","id":"taxonomy.go.concept.go.go0071808.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0071827","id":"taxonomy.go.concept.go.go0071827.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0071840","id":"taxonomy.go.concept.go.go0071840.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0071965","id":"taxonomy.go.concept.go.go0071965.concept.go.go0040011","parent":"concept.go.go0040011","type":"narrower"},{"child":"concept.go.go0072324","id":"taxonomy.go.concept.go.go0072324.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0072690","id":"taxonomy.go.concept.go.go0072690.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0075325","id":"taxonomy.go.concept.go.go0075325.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0075522","id":"taxonomy.go.concept.go.go0075522.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075523","id":"taxonomy.go.concept.go.go0075523.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075524","id":"taxonomy.go.concept.go.go0075524.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075525","id":"taxonomy.go.concept.go.go0075525.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075526","id":"taxonomy.go.concept.go.go0075526.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0075527","id":"taxonomy.go.concept.go.go0075527.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0080189","id":"taxonomy.go.concept.go.go0080189.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0080190","id":"taxonomy.go.concept.go.go0080190.concept.go.go0040007","parent":"concept.go.go0040007","type":"narrower"},{"child":"concept.go.go0085036","id":"taxonomy.go.concept.go.go0085036.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090123","id":"taxonomy.go.concept.go.go0090123.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090130","id":"taxonomy.go.concept.go.go0090130.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0090398","id":"taxonomy.go.concept.go.go0090398.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0090405","id":"taxonomy.go.concept.go.go0090405.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090635","id":"taxonomy.go.concept.go.go0090635.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090637","id":"taxonomy.go.concept.go.go0090637.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090644","id":"taxonomy.go.concept.go.go0090644.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0090658","id":"taxonomy.go.concept.go.go0090658.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090692","id":"taxonomy.go.concept.go.go0090692.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090693","id":"taxonomy.go.concept.go.go0090693.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0090713","id":"taxonomy.go.concept.go.go0090713.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.go.go0090724","id":"taxonomy.go.concept.go.go0090724.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090725","id":"taxonomy.go.concept.go.go0090725.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0090726","id":"taxonomy.go.concept.go.go0090726.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097002","id":"taxonomy.go.concept.go.go0097002.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097047","id":"taxonomy.go.concept.go.go0097047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097120","id":"taxonomy.go.concept.go.go0097120.concept.go.go0051179","parent":"concept.go.go0051179","type":"narrower"},{"child":"concept.go.go0097194","id":"taxonomy.go.concept.go.go0097194.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0097207","id":"taxonomy.go.concept.go.go0097207.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0097242","id":"taxonomy.go.concept.go.go0097242.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0097528","id":"taxonomy.go.concept.go.go0097528.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0097562","id":"taxonomy.go.concept.go.go0097562.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097593","id":"taxonomy.go.concept.go.go0097593.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097594","id":"taxonomy.go.concept.go.go0097594.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097595","id":"taxonomy.go.concept.go.go0097595.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097596","id":"taxonomy.go.concept.go.go0097596.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097614","id":"taxonomy.go.concept.go.go0097614.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097683","id":"taxonomy.go.concept.go.go0097683.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0097722","id":"taxonomy.go.concept.go.go0097722.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0097737","id":"taxonomy.go.concept.go.go0097737.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0097751","id":"taxonomy.go.concept.go.go0097751.concept.go.go0032502","parent":"concept.go.go0032502","type":"narrower"},{"child":"concept.go.go0098003","id":"taxonomy.go.concept.go.go0098003.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098004","id":"taxonomy.go.concept.go.go0098004.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098005","id":"taxonomy.go.concept.go.go0098005.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098015","id":"taxonomy.go.concept.go.go0098015.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098021","id":"taxonomy.go.concept.go.go0098021.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098023","id":"taxonomy.go.concept.go.go0098023.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098024","id":"taxonomy.go.concept.go.go0098024.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098025","id":"taxonomy.go.concept.go.go0098025.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098026","id":"taxonomy.go.concept.go.go0098026.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098027","id":"taxonomy.go.concept.go.go0098027.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098028","id":"taxonomy.go.concept.go.go0098028.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098029","id":"taxonomy.go.concept.go.go0098029.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098030","id":"taxonomy.go.concept.go.go0098030.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098031","id":"taxonomy.go.concept.go.go0098031.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098045","id":"taxonomy.go.concept.go.go0098045.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098061","id":"taxonomy.go.concept.go.go0098061.concept.go.go0044423","parent":"concept.go.go0044423","type":"narrower"},{"child":"concept.go.go0098669","id":"taxonomy.go.concept.go.go0098669.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098677","id":"taxonomy.go.concept.go.go0098677.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098678","id":"taxonomy.go.concept.go.go0098678.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098689","id":"taxonomy.go.concept.go.go0098689.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0098743","id":"taxonomy.go.concept.go.go0098743.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0098843","id":"taxonomy.go.concept.go.go0098843.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0098862","id":"taxonomy.go.concept.go.go0098862.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099009","id":"taxonomy.go.concept.go.go0099009.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0099079","id":"taxonomy.go.concept.go.go0099079.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099086","id":"taxonomy.go.concept.go.go0099086.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0099120","id":"taxonomy.go.concept.go.go0099120.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0099522","id":"taxonomy.go.concept.go.go0099522.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0106125","id":"taxonomy.go.concept.go.go0106125.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0106126","id":"taxonomy.go.concept.go.go0106126.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0110134","id":"taxonomy.go.concept.go.go0110134.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go0120082","id":"taxonomy.go.concept.go.go0120082.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120102","id":"taxonomy.go.concept.go.go0120102.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120104","id":"taxonomy.go.concept.go.go0120104.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120135","id":"taxonomy.go.concept.go.go0120135.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120212","id":"taxonomy.go.concept.go.go0120212.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0120312","id":"taxonomy.go.concept.go.go0120312.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0120318","id":"taxonomy.go.concept.go.go0120318.concept.go.go0051703","parent":"concept.go.go0051703","type":"narrower"},{"child":"concept.go.go0120321","id":"taxonomy.go.concept.go.go0120321.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140029","id":"taxonomy.go.concept.go.go0140029.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140106","id":"taxonomy.go.concept.go.go0140106.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0140253","id":"taxonomy.go.concept.go.go0140253.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140352","id":"taxonomy.go.concept.go.go0140352.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go0140511","id":"taxonomy.go.concept.go.go0140511.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140547","id":"taxonomy.go.concept.go.go0140547.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go0140599","id":"taxonomy.go.concept.go.go0140599.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0140725","id":"taxonomy.go.concept.go.go0140725.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0140729","id":"taxonomy.go.concept.go.go0140729.concept.go.go0098754","parent":"concept.go.go0098754","type":"narrower"},{"child":"concept.go.go0140755","id":"taxonomy.go.concept.go.go0140755.concept.go.go0016032","parent":"concept.go.go0016032","type":"narrower"},{"child":"concept.go.go0140918","id":"taxonomy.go.concept.go.go0140918.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0141060","id":"taxonomy.go.concept.go.go0141060.concept.go.go0044419","parent":"concept.go.go0044419","type":"narrower"},{"child":"concept.go.go0150034","id":"taxonomy.go.concept.go.go0150034.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0160266","id":"taxonomy.go.concept.go.go0160266.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go0170047","id":"taxonomy.go.concept.go.go0170047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go0170062","id":"taxonomy.go.concept.go.go0170062.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go1903046","id":"taxonomy.go.concept.go.go1903046.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go1990047","id":"taxonomy.go.concept.go.go1990047.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990110","id":"taxonomy.go.concept.go.go1990110.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go1990277","id":"taxonomy.go.concept.go.go1990277.concept.go.go0022414","parent":"concept.go.go0022414","type":"narrower"},{"child":"concept.go.go1990636","id":"taxonomy.go.concept.go.go1990636.concept.go.go0044848","parent":"concept.go.go0044848","type":"narrower"},{"child":"concept.go.go1990717","id":"taxonomy.go.concept.go.go1990717.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990748","id":"taxonomy.go.concept.go.go1990748.concept.go.go0009987","parent":"concept.go.go0009987","type":"narrower"},{"child":"concept.go.go1990826","id":"taxonomy.go.concept.go.go1990826.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990836","id":"taxonomy.go.concept.go.go1990836.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go1990900","id":"taxonomy.go.concept.go.go1990900.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.go.go7770056","id":"taxonomy.go.concept.go.go7770056.concept.go.go0032501","parent":"concept.go.go0032501","type":"narrower"},{"child":"concept.go.go7770129","id":"taxonomy.go.concept.go.go7770129.concept.go.go0110165","parent":"concept.go.go0110165","type":"narrower"},{"child":"concept.mesh.d000024","id":"taxonomy.mesh.concept.mesh.d000024.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000057","id":"taxonomy.mesh.concept.mesh.d000057.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000066479","id":"taxonomy.mesh.concept.mesh.d000066479.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000066498","id":"taxonomy.mesh.concept.mesh.d000066498.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000066768","id":"taxonomy.mesh.concept.mesh.d000066768.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000067448","id":"taxonomy.mesh.concept.mesh.d000067448.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000067496","id":"taxonomy.mesh.concept.mesh.d000067496.field.mesh.d012068","parent":"field.mesh.d012068","type":"narrower"},{"child":"concept.mesh.d000067551","id":"taxonomy.mesh.concept.mesh.d000067551.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000067656","id":"taxonomy.mesh.concept.mesh.d000067656.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000067657","id":"taxonomy.mesh.concept.mesh.d000067657.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000067896","id":"taxonomy.mesh.concept.mesh.d000067896.concept.mesh.d057217","parent":"concept.mesh.d057217","type":"narrower"},{"child":"concept.mesh.d000068616","id":"taxonomy.mesh.concept.mesh.d000068616.field.mesh.d004995","parent":"field.mesh.d004995","type":"narrower"},{"child":"concept.mesh.d000069457","id":"taxonomy.mesh.concept.mesh.d000069457.concept.mesh.d005544","parent":"concept.mesh.d005544","type":"narrower"},{"child":"concept.mesh.d000069553","id":"taxonomy.mesh.concept.mesh.d000069553.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000069558","id":"taxonomy.mesh.concept.mesh.d000069558.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000069578","id":"taxonomy.mesh.concept.mesh.d000069578.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000070100","id":"taxonomy.mesh.concept.mesh.d000070100.concept.mesh.d017149","parent":"concept.mesh.d017149","type":"narrower"},{"child":"concept.mesh.d000070337","id":"taxonomy.mesh.concept.mesh.d000070337.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d000070586","id":"taxonomy.mesh.concept.mesh.d000070586.concept.mesh.d057766","parent":"concept.mesh.d057766","type":"narrower"},{"child":"concept.mesh.d000070838","id":"taxonomy.mesh.concept.mesh.d000070838.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000071220","id":"taxonomy.mesh.concept.mesh.d000071220.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d000072358","id":"taxonomy.mesh.concept.mesh.d000072358.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d000072577","id":"taxonomy.mesh.concept.mesh.d000072577.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d000072698","id":"taxonomy.mesh.concept.mesh.d000072698.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d000073276","id":"taxonomy.mesh.concept.mesh.d000073276.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d000073456","id":"taxonomy.mesh.concept.mesh.d000073456.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000073597","id":"taxonomy.mesh.concept.mesh.d000073597.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000073624","id":"taxonomy.mesh.concept.mesh.d000073624.concept.mesh.d013561","parent":"concept.mesh.d013561","type":"narrower"},{"child":"concept.mesh.d000074439","id":"taxonomy.mesh.concept.mesh.d000074439.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000074440","id":"taxonomy.mesh.concept.mesh.d000074440.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d000074609","id":"taxonomy.mesh.concept.mesh.d000074609.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000075066","id":"taxonomy.mesh.concept.mesh.d000075066.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000075082","id":"taxonomy.mesh.concept.mesh.d000075082.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000075665","id":"taxonomy.mesh.concept.mesh.d000075665.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000075682","id":"taxonomy.mesh.concept.mesh.d000075682.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000075762","id":"taxonomy.mesh.concept.mesh.d000075762.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000075862","id":"taxonomy.mesh.concept.mesh.d000075862.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d000077321","id":"taxonomy.mesh.concept.mesh.d000077321.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000077406","id":"taxonomy.mesh.concept.mesh.d000077406.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d000078002","id":"taxonomy.mesh.concept.mesh.d000078002.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000078332","id":"taxonomy.mesh.concept.mesh.d000078332.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"concept.mesh.d000078382","id":"taxonomy.mesh.concept.mesh.d000078382.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000078625","id":"taxonomy.mesh.concept.mesh.d000078625.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000078682","id":"taxonomy.mesh.concept.mesh.d000078682.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d000079263","id":"taxonomy.mesh.concept.mesh.d000079263.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000079426","id":"taxonomy.mesh.concept.mesh.d000079426.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000080105","id":"taxonomy.mesh.concept.mesh.d000080105.concept.mesh.d026684","parent":"concept.mesh.d026684","type":"narrower"},{"child":"concept.mesh.d000080562","id":"taxonomy.mesh.concept.mesh.d000080562.concept.mesh.d004779","parent":"concept.mesh.d004779","type":"narrower"},{"child":"concept.mesh.d000081762","id":"taxonomy.mesh.concept.mesh.d000081762.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000083202","id":"taxonomy.mesh.concept.mesh.d000083202.concept.mesh.d000082742","parent":"concept.mesh.d000082742","type":"narrower"},{"child":"concept.mesh.d000083623","id":"taxonomy.mesh.concept.mesh.d000083623.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000084783","id":"taxonomy.mesh.concept.mesh.d000084783.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000085343","id":"taxonomy.mesh.concept.mesh.d000085343.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000087366","id":"taxonomy.mesh.concept.mesh.d000087366.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000087983","id":"taxonomy.mesh.concept.mesh.d000087983.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d000088562","id":"taxonomy.mesh.concept.mesh.d000088562.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000088724","id":"taxonomy.mesh.concept.mesh.d000088724.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000090082","id":"taxonomy.mesh.concept.mesh.d000090082.concept.mesh.d005544","parent":"concept.mesh.d005544","type":"narrower"},{"child":"concept.mesh.d000090862","id":"taxonomy.mesh.concept.mesh.d000090862.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d000091383","id":"taxonomy.mesh.concept.mesh.d000091383.concept.mesh.d012935","parent":"concept.mesh.d012935","type":"narrower"},{"child":"concept.mesh.d000091682","id":"taxonomy.mesh.concept.mesh.d000091682.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d000091702","id":"taxonomy.mesh.concept.mesh.d000091702.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"concept.mesh.d000092003","id":"taxonomy.mesh.concept.mesh.d000092003.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000092822","id":"taxonomy.mesh.concept.mesh.d000092822.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d000092862","id":"taxonomy.mesh.concept.mesh.d000092862.concept.mesh.d011788","parent":"concept.mesh.d011788","type":"narrower"},{"child":"concept.mesh.d000093742","id":"taxonomy.mesh.concept.mesh.d000093742.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000094408","id":"taxonomy.mesh.concept.mesh.d000094408.concept.mesh.d000082742","parent":"concept.mesh.d000082742","type":"narrower"},{"child":"concept.mesh.d000094505","id":"taxonomy.mesh.concept.mesh.d000094505.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d000095026","id":"taxonomy.mesh.concept.mesh.d000095026.concept.mesh.d012935","parent":"concept.mesh.d012935","type":"narrower"},{"child":"concept.mesh.d000096264","id":"taxonomy.mesh.concept.mesh.d000096264.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000097785","id":"taxonomy.mesh.concept.mesh.d000097785.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d000097812","id":"taxonomy.mesh.concept.mesh.d000097812.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000097813","id":"taxonomy.mesh.concept.mesh.d000097813.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d000097815","id":"taxonomy.mesh.concept.mesh.d000097815.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000097822","id":"taxonomy.mesh.concept.mesh.d000097822.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"concept.mesh.d000097824","id":"taxonomy.mesh.concept.mesh.d000097824.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d000098342","id":"taxonomy.mesh.concept.mesh.d000098342.concept.mesh.d000077321","parent":"concept.mesh.d000077321","type":"narrower"},{"child":"concept.mesh.d000098402","id":"taxonomy.mesh.concept.mesh.d000098402.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.mesh.d000098404","id":"taxonomy.mesh.concept.mesh.d000098404.concept.mesh.d000098406","parent":"concept.mesh.d000098406","type":"narrower"},{"child":"concept.mesh.d000098405","id":"taxonomy.mesh.concept.mesh.d000098405.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098406","id":"taxonomy.mesh.concept.mesh.d000098406.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098407","id":"taxonomy.mesh.concept.mesh.d000098407.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098408","id":"taxonomy.mesh.concept.mesh.d000098408.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098409","id":"taxonomy.mesh.concept.mesh.d000098409.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098410","id":"taxonomy.mesh.concept.mesh.d000098410.concept.mesh.d000069550","parent":"concept.mesh.d000069550","type":"narrower"},{"child":"concept.mesh.d000098412","id":"taxonomy.mesh.concept.mesh.d000098412.concept.mesh.d000098411","parent":"concept.mesh.d000098411","type":"narrower"},{"child":"concept.mesh.d000098426","id":"taxonomy.mesh.concept.mesh.d000098426.concept.mesh.d000098435","parent":"concept.mesh.d000098435","type":"narrower"},{"child":"concept.mesh.d000098427","id":"taxonomy.mesh.concept.mesh.d000098427.concept.mesh.d000069558","parent":"concept.mesh.d000069558","type":"narrower"},{"child":"concept.mesh.d000098429","id":"taxonomy.mesh.concept.mesh.d000098429.concept.mesh.d000098435","parent":"concept.mesh.d000098435","type":"narrower"},{"child":"concept.mesh.d000098446","id":"taxonomy.mesh.concept.mesh.d000098446.concept.mesh.d000077321","parent":"concept.mesh.d000077321","type":"narrower"},{"child":"concept.mesh.d000098451","id":"taxonomy.mesh.concept.mesh.d000098451.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"concept.mesh.d000099056","id":"taxonomy.mesh.concept.mesh.d000099056.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000099075","id":"taxonomy.mesh.concept.mesh.d000099075.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d000184","id":"taxonomy.mesh.concept.mesh.d000184.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d000223","id":"taxonomy.mesh.concept.mesh.d000223.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d000294","id":"taxonomy.mesh.concept.mesh.d000294.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d000339","id":"taxonomy.mesh.concept.mesh.d000339.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000422","id":"taxonomy.mesh.concept.mesh.d000422.concept.mesh.d009781","parent":"concept.mesh.d009781","type":"narrower"},{"child":"concept.mesh.d000716","id":"taxonomy.mesh.concept.mesh.d000716.concept.mesh.d008488","parent":"concept.mesh.d008488","type":"narrower"},{"child":"concept.mesh.d000785","id":"taxonomy.mesh.concept.mesh.d000785.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d000786","id":"taxonomy.mesh.concept.mesh.d000786.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d000887","id":"taxonomy.mesh.concept.mesh.d000887.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d001007","id":"taxonomy.mesh.concept.mesh.d001007.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001170","id":"taxonomy.mesh.concept.mesh.d001170.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001290","id":"taxonomy.mesh.concept.mesh.d001290.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d001291","id":"taxonomy.mesh.concept.mesh.d001291.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001292","id":"taxonomy.mesh.concept.mesh.d001292.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001293","id":"taxonomy.mesh.concept.mesh.d001293.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001294","id":"taxonomy.mesh.concept.mesh.d001294.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d001296","id":"taxonomy.mesh.concept.mesh.d001296.field.mesh.d018961","parent":"field.mesh.d018961","type":"narrower"},{"child":"concept.mesh.d001331","id":"taxonomy.mesh.concept.mesh.d001331.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d001342","id":"taxonomy.mesh.concept.mesh.d001342.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d001423","id":"taxonomy.mesh.concept.mesh.d001423.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001499","id":"taxonomy.mesh.concept.mesh.d001499.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d001504","id":"taxonomy.mesh.concept.mesh.d001504.field.mesh.d004954","parent":"field.mesh.d004954","type":"narrower"},{"child":"concept.mesh.d001519","id":"taxonomy.mesh.concept.mesh.d001519.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d001522","id":"taxonomy.mesh.concept.mesh.d001522.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d001526","id":"taxonomy.mesh.concept.mesh.d001526.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d001601","id":"taxonomy.mesh.concept.mesh.d001601.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001633","id":"taxonomy.mesh.concept.mesh.d001633.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d001698","id":"taxonomy.mesh.concept.mesh.d001698.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d001721","id":"taxonomy.mesh.concept.mesh.d001721.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d001722","id":"taxonomy.mesh.concept.mesh.d001722.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d001850","id":"taxonomy.mesh.concept.mesh.d001850.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d001878","id":"taxonomy.mesh.concept.mesh.d001878.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d001887","id":"taxonomy.mesh.concept.mesh.d001887.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d001982","id":"taxonomy.mesh.concept.mesh.d001982.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d002016","id":"taxonomy.mesh.concept.mesh.d002016.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d002410","id":"taxonomy.mesh.concept.mesh.d002410.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d002493","id":"taxonomy.mesh.concept.mesh.d002493.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d002494","id":"taxonomy.mesh.concept.mesh.d002494.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d002616","id":"taxonomy.mesh.concept.mesh.d002616.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d002652","id":"taxonomy.mesh.concept.mesh.d002652.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d002668","id":"taxonomy.mesh.concept.mesh.d002668.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d002835","id":"taxonomy.mesh.concept.mesh.d002835.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d002925","id":"taxonomy.mesh.concept.mesh.d002925.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d002959","id":"taxonomy.mesh.concept.mesh.d002959.concept.mesh.d006078","parent":"concept.mesh.d006078","type":"narrower"},{"child":"concept.mesh.d003141","id":"taxonomy.mesh.concept.mesh.d003141.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d003142","id":"taxonomy.mesh.concept.mesh.d003142.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003148","id":"taxonomy.mesh.concept.mesh.d003148.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d003242","id":"taxonomy.mesh.concept.mesh.d003242.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d003258","id":"taxonomy.mesh.concept.mesh.d003258.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003389","id":"taxonomy.mesh.concept.mesh.d003389.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d003415","id":"taxonomy.mesh.concept.mesh.d003415.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"concept.mesh.d003428","id":"taxonomy.mesh.concept.mesh.d003428.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d003560","id":"taxonomy.mesh.concept.mesh.d003560.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d003617","id":"taxonomy.mesh.concept.mesh.d003617.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d003674","id":"taxonomy.mesh.concept.mesh.d003674.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d003709","id":"taxonomy.mesh.concept.mesh.d003709.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d003711","id":"taxonomy.mesh.concept.mesh.d003711.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d003717","id":"taxonomy.mesh.concept.mesh.d003717.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d003863","id":"taxonomy.mesh.concept.mesh.d003863.concept.mesh.d001526","parent":"concept.mesh.d001526","type":"narrower"},{"child":"concept.mesh.d003906","id":"taxonomy.mesh.concept.mesh.d003906.concept.mesh.d059066","parent":"concept.mesh.d059066","type":"narrower"},{"child":"concept.mesh.d004208","id":"taxonomy.mesh.concept.mesh.d004208.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d004311","id":"taxonomy.mesh.concept.mesh.d004311.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d004324","id":"taxonomy.mesh.concept.mesh.d004324.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d004327","id":"taxonomy.mesh.concept.mesh.d004327.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d004644","id":"taxonomy.mesh.concept.mesh.d004644.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d005086","id":"taxonomy.mesh.concept.mesh.d005086.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d005106","id":"taxonomy.mesh.concept.mesh.d005106.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d005201","id":"taxonomy.mesh.concept.mesh.d005201.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d005490","id":"taxonomy.mesh.concept.mesh.d005490.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d005495","id":"taxonomy.mesh.concept.mesh.d005495.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"concept.mesh.d005544","id":"taxonomy.mesh.concept.mesh.d005544.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d005553","id":"taxonomy.mesh.concept.mesh.d005553.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d005607","id":"taxonomy.mesh.concept.mesh.d005607.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d005789","id":"taxonomy.mesh.concept.mesh.d005789.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d005891","id":"taxonomy.mesh.concept.mesh.d005891.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d006076","id":"taxonomy.mesh.concept.mesh.d006076.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d006077","id":"taxonomy.mesh.concept.mesh.d006077.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d006078","id":"taxonomy.mesh.concept.mesh.d006078.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d006184","id":"taxonomy.mesh.concept.mesh.d006184.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d006222","id":"taxonomy.mesh.concept.mesh.d006222.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d006302","id":"taxonomy.mesh.concept.mesh.d006302.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d006304","id":"taxonomy.mesh.concept.mesh.d006304.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d006331","id":"taxonomy.mesh.concept.mesh.d006331.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d006380","id":"taxonomy.mesh.concept.mesh.d006380.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d006520","id":"taxonomy.mesh.concept.mesh.d006520.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d006665","id":"taxonomy.mesh.concept.mesh.d006665.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d006676","id":"taxonomy.mesh.concept.mesh.d006676.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d006694","id":"taxonomy.mesh.concept.mesh.d006694.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d006708","id":"taxonomy.mesh.concept.mesh.d006708.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d006803","id":"taxonomy.mesh.concept.mesh.d006803.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d006805","id":"taxonomy.mesh.concept.mesh.d006805.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d006808","id":"taxonomy.mesh.concept.mesh.d006808.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d007062","id":"taxonomy.mesh.concept.mesh.d007062.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d007100","id":"taxonomy.mesh.concept.mesh.d007100.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007175","id":"taxonomy.mesh.concept.mesh.d007175.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007266","id":"taxonomy.mesh.concept.mesh.d007266.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d007391","id":"taxonomy.mesh.concept.mesh.d007391.concept.mesh.d038622","parent":"concept.mesh.d038622","type":"narrower"},{"child":"concept.mesh.d007514","id":"taxonomy.mesh.concept.mesh.d007514.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d007599","id":"taxonomy.mesh.concept.mesh.d007599.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d007757","id":"taxonomy.mesh.concept.mesh.d007757.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d007818","id":"taxonomy.mesh.concept.mesh.d007818.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d008119","id":"taxonomy.mesh.concept.mesh.d008119.field.mesh.d011057","parent":"field.mesh.d011057","type":"narrower"},{"child":"concept.mesh.d008171","id":"taxonomy.mesh.concept.mesh.d008171.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d008328","id":"taxonomy.mesh.concept.mesh.d008328.field.mesh.d006804","parent":"field.mesh.d006804","type":"narrower"},{"child":"concept.mesh.d008488","id":"taxonomy.mesh.concept.mesh.d008488.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d008512","id":"taxonomy.mesh.concept.mesh.d008512.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d008904","id":"taxonomy.mesh.concept.mesh.d008904.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d008921","id":"taxonomy.mesh.concept.mesh.d008921.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d008953","id":"taxonomy.mesh.concept.mesh.d008953.concept.mesh.d008961","parent":"concept.mesh.d008961","type":"narrower"},{"child":"concept.mesh.d008961","id":"taxonomy.mesh.concept.mesh.d008961.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d009014","id":"taxonomy.mesh.concept.mesh.d009014.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d009040","id":"taxonomy.mesh.concept.mesh.d009040.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d009043","id":"taxonomy.mesh.concept.mesh.d009043.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d009111","id":"taxonomy.mesh.concept.mesh.d009111.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d009228","id":"taxonomy.mesh.concept.mesh.d009228.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d009370","id":"taxonomy.mesh.concept.mesh.d009370.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009371","id":"taxonomy.mesh.concept.mesh.d009371.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009374","id":"taxonomy.mesh.concept.mesh.d009374.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009376","id":"taxonomy.mesh.concept.mesh.d009376.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009378","id":"taxonomy.mesh.concept.mesh.d009378.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009381","id":"taxonomy.mesh.concept.mesh.d009381.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009385","id":"taxonomy.mesh.concept.mesh.d009385.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009386","id":"taxonomy.mesh.concept.mesh.d009386.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d009421","id":"taxonomy.mesh.concept.mesh.d009421.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009423","id":"taxonomy.mesh.concept.mesh.d009423.concept.mesh.d009371","parent":"concept.mesh.d009371","type":"narrower"},{"child":"concept.mesh.d009461","id":"taxonomy.mesh.concept.mesh.d009461.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009468","id":"taxonomy.mesh.concept.mesh.d009468.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d009668","id":"taxonomy.mesh.concept.mesh.d009668.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d009752","id":"taxonomy.mesh.concept.mesh.d009752.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d009781","id":"taxonomy.mesh.concept.mesh.d009781.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d009874","id":"taxonomy.mesh.concept.mesh.d009874.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d009894","id":"taxonomy.mesh.concept.mesh.d009894.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d009949","id":"taxonomy.mesh.concept.mesh.d009949.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d010257","id":"taxonomy.mesh.concept.mesh.d010257.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d010272","id":"taxonomy.mesh.concept.mesh.d010272.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d010467","id":"taxonomy.mesh.concept.mesh.d010467.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d010549","id":"taxonomy.mesh.concept.mesh.d010549.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d010551","id":"taxonomy.mesh.concept.mesh.d010551.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d010995","id":"taxonomy.mesh.concept.mesh.d010995.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d011049","id":"taxonomy.mesh.concept.mesh.d011049.concept.mesh.d057766","parent":"concept.mesh.d057766","type":"narrower"},{"child":"concept.mesh.d011056","id":"taxonomy.mesh.concept.mesh.d011056.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d011155","id":"taxonomy.mesh.concept.mesh.d011155.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d011158","id":"taxonomy.mesh.concept.mesh.d011158.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d011177","id":"taxonomy.mesh.concept.mesh.d011177.concept.mesh.d006078","parent":"concept.mesh.d006078","type":"narrower"},{"child":"concept.mesh.d011230","id":"taxonomy.mesh.concept.mesh.d011230.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d011249","id":"taxonomy.mesh.concept.mesh.d011249.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d011251","id":"taxonomy.mesh.concept.mesh.d011251.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d011252","id":"taxonomy.mesh.concept.mesh.d011252.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d011385","id":"taxonomy.mesh.concept.mesh.d011385.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d011786","id":"taxonomy.mesh.concept.mesh.d011786.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d011788","id":"taxonomy.mesh.concept.mesh.d011788.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d011845","id":"taxonomy.mesh.concept.mesh.d011845.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d011897","id":"taxonomy.mesh.concept.mesh.d011897.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d011908","id":"taxonomy.mesh.concept.mesh.d011908.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012043","id":"taxonomy.mesh.concept.mesh.d012043.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012071","id":"taxonomy.mesh.concept.mesh.d012071.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d012072","id":"taxonomy.mesh.concept.mesh.d012072.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d012094","id":"taxonomy.mesh.concept.mesh.d012094.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d012106","id":"taxonomy.mesh.concept.mesh.d012106.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d012107","id":"taxonomy.mesh.concept.mesh.d012107.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d012120","id":"taxonomy.mesh.concept.mesh.d012120.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d012130","id":"taxonomy.mesh.concept.mesh.d012130.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d012141","id":"taxonomy.mesh.concept.mesh.d012141.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d012306","id":"taxonomy.mesh.concept.mesh.d012306.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d012307","id":"taxonomy.mesh.concept.mesh.d012307.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d012309","id":"taxonomy.mesh.concept.mesh.d012309.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012498","id":"taxonomy.mesh.concept.mesh.d012498.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d012653","id":"taxonomy.mesh.concept.mesh.d012653.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012725","id":"taxonomy.mesh.concept.mesh.d012725.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012742","id":"taxonomy.mesh.concept.mesh.d012742.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d012744","id":"taxonomy.mesh.concept.mesh.d012744.concept.mesh.d017678","parent":"concept.mesh.d017678","type":"narrower"},{"child":"concept.mesh.d012874","id":"taxonomy.mesh.concept.mesh.d012874.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d012893","id":"taxonomy.mesh.concept.mesh.d012893.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d012907","id":"taxonomy.mesh.concept.mesh.d012907.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012919","id":"taxonomy.mesh.concept.mesh.d012919.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d012935","id":"taxonomy.mesh.concept.mesh.d012935.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d012941","id":"taxonomy.mesh.concept.mesh.d012941.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d012950","id":"taxonomy.mesh.concept.mesh.d012950.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d013037","id":"taxonomy.mesh.concept.mesh.d013037.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013140","id":"taxonomy.mesh.concept.mesh.d013140.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d013219","id":"taxonomy.mesh.concept.mesh.d013219.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d013239","id":"taxonomy.mesh.concept.mesh.d013239.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013240","id":"taxonomy.mesh.concept.mesh.d013240.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d013359","id":"taxonomy.mesh.concept.mesh.d013359.concept.mesh.d003674","parent":"concept.mesh.d003674","type":"narrower"},{"child":"concept.mesh.d013391","id":"taxonomy.mesh.concept.mesh.d013391.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d013492","id":"taxonomy.mesh.concept.mesh.d013492.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d013561","id":"taxonomy.mesh.concept.mesh.d013561.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"concept.mesh.d013598","id":"taxonomy.mesh.concept.mesh.d013598.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d013637","id":"taxonomy.mesh.concept.mesh.d013637.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d013690","id":"taxonomy.mesh.concept.mesh.d013690.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d013695","id":"taxonomy.mesh.concept.mesh.d013695.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d013800","id":"taxonomy.mesh.concept.mesh.d013800.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014039","id":"taxonomy.mesh.concept.mesh.d014039.concept.mesh.d002668","parent":"concept.mesh.d002668","type":"narrower"},{"child":"concept.mesh.d014115","id":"taxonomy.mesh.concept.mesh.d014115.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014552","id":"taxonomy.mesh.concept.mesh.d014552.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014601","id":"taxonomy.mesh.concept.mesh.d014601.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d014652","id":"taxonomy.mesh.concept.mesh.d014652.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d014742","id":"taxonomy.mesh.concept.mesh.d014742.concept.mesh.d016249","parent":"concept.mesh.d016249","type":"narrower"},{"child":"concept.mesh.d014743","id":"taxonomy.mesh.concept.mesh.d014743.concept.mesh.d013637","parent":"concept.mesh.d013637","type":"narrower"},{"child":"concept.mesh.d014754","id":"taxonomy.mesh.concept.mesh.d014754.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014777","id":"taxonomy.mesh.concept.mesh.d014777.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d014799","id":"taxonomy.mesh.concept.mesh.d014799.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d014858","id":"taxonomy.mesh.concept.mesh.d014858.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d014881","id":"taxonomy.mesh.concept.mesh.d014881.concept.mesh.d012498","parent":"concept.mesh.d012498","type":"narrower"},{"child":"concept.mesh.d014946","id":"taxonomy.mesh.concept.mesh.d014946.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015013","id":"taxonomy.mesh.concept.mesh.d015013.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d015047","id":"taxonomy.mesh.concept.mesh.d015047.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015438","id":"taxonomy.mesh.concept.mesh.d015438.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d015577","id":"taxonomy.mesh.concept.mesh.d015577.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d015619","id":"taxonomy.mesh.concept.mesh.d015619.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d015769","id":"taxonomy.mesh.concept.mesh.d015769.concept.mesh.d012140","parent":"concept.mesh.d012140","type":"narrower"},{"child":"concept.mesh.d015817","id":"taxonomy.mesh.concept.mesh.d015817.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d015985","id":"taxonomy.mesh.concept.mesh.d015985.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d016013","id":"taxonomy.mesh.concept.mesh.d016013.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016014","id":"taxonomy.mesh.concept.mesh.d016014.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016015","id":"taxonomy.mesh.concept.mesh.d016015.concept.mesh.d015233","parent":"concept.mesh.d015233","type":"narrower"},{"child":"concept.mesh.d016249","id":"taxonomy.mesh.concept.mesh.d016249.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d016265","id":"taxonomy.mesh.concept.mesh.d016265.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d016459","id":"taxonomy.mesh.concept.mesh.d016459.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d016609","id":"taxonomy.mesh.concept.mesh.d016609.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d016709","id":"taxonomy.mesh.concept.mesh.d016709.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d016743","id":"taxonomy.mesh.concept.mesh.d016743.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d017004","id":"taxonomy.mesh.concept.mesh.d017004.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d017063","id":"taxonomy.mesh.concept.mesh.d017063.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d017149","id":"taxonomy.mesh.concept.mesh.d017149.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d017150","id":"taxonomy.mesh.concept.mesh.d017150.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d017169","id":"taxonomy.mesh.concept.mesh.d017169.concept.mesh.d009369","parent":"concept.mesh.d009369","type":"narrower"},{"child":"concept.mesh.d017533","id":"taxonomy.mesh.concept.mesh.d017533.field.mesh.d005191","parent":"field.mesh.d005191","type":"narrower"},{"child":"concept.mesh.d017677","id":"taxonomy.mesh.concept.mesh.d017677.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d017678","id":"taxonomy.mesh.concept.mesh.d017678.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d017712","id":"taxonomy.mesh.concept.mesh.d017712.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d017714","id":"taxonomy.mesh.concept.mesh.d017714.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018376","id":"taxonomy.mesh.concept.mesh.d018376.concept.mesh.d002318","parent":"concept.mesh.d002318","type":"narrower"},{"child":"concept.mesh.d018401","id":"taxonomy.mesh.concept.mesh.d018401.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d018461","id":"taxonomy.mesh.concept.mesh.d018461.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018511","id":"taxonomy.mesh.concept.mesh.d018511.field.mesh.d012586","parent":"field.mesh.d012586","type":"narrower"},{"child":"concept.mesh.d018581","id":"taxonomy.mesh.concept.mesh.d018581.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d018594","id":"taxonomy.mesh.concept.mesh.d018594.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"concept.mesh.d018595","id":"taxonomy.mesh.concept.mesh.d018595.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d018596","id":"taxonomy.mesh.concept.mesh.d018596.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"concept.mesh.d018597","id":"taxonomy.mesh.concept.mesh.d018597.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d018715","id":"taxonomy.mesh.concept.mesh.d018715.concept.mesh.d013690","parent":"concept.mesh.d013690","type":"narrower"},{"child":"concept.mesh.d018805","id":"taxonomy.mesh.concept.mesh.d018805.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d018939","id":"taxonomy.mesh.concept.mesh.d018939.field.mesh.d010687","parent":"field.mesh.d010687","type":"narrower"},{"child":"concept.mesh.d019149","id":"taxonomy.mesh.concept.mesh.d019149.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"concept.mesh.d019212","id":"taxonomy.mesh.concept.mesh.d019212.concept.mesh.d001296","parent":"concept.mesh.d001296","type":"narrower"},{"child":"concept.mesh.d019348","id":"taxonomy.mesh.concept.mesh.d019348.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d019352","id":"taxonomy.mesh.concept.mesh.d019352.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"concept.mesh.d019356","id":"taxonomy.mesh.concept.mesh.d019356.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d019359","id":"taxonomy.mesh.concept.mesh.d019359.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d019364","id":"taxonomy.mesh.concept.mesh.d019364.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d019365","id":"taxonomy.mesh.concept.mesh.d019365.concept.mesh.d013561","parent":"concept.mesh.d013561","type":"narrower"},{"child":"concept.mesh.d019368","id":"taxonomy.mesh.concept.mesh.d019368.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d019369","id":"taxonomy.mesh.concept.mesh.d019369.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d019413","id":"taxonomy.mesh.concept.mesh.d019413.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d019456","id":"taxonomy.mesh.concept.mesh.d019456.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d019513","id":"taxonomy.mesh.concept.mesh.d019513.concept.mesh.d006808","parent":"concept.mesh.d006808","type":"narrower"},{"child":"concept.mesh.d019636","id":"taxonomy.mesh.concept.mesh.d019636.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d019954","id":"taxonomy.mesh.concept.mesh.d019954.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d020196","id":"taxonomy.mesh.concept.mesh.d020196.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020258","id":"taxonomy.mesh.concept.mesh.d020258.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020274","id":"taxonomy.mesh.concept.mesh.d020274.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d020650","id":"taxonomy.mesh.concept.mesh.d020650.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d020752","id":"taxonomy.mesh.concept.mesh.d020752.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d021081","id":"taxonomy.mesh.concept.mesh.d021081.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d024803","id":"taxonomy.mesh.concept.mesh.d024803.field.mesh.d020811","parent":"field.mesh.d020811","type":"narrower"},{"child":"concept.mesh.d024861","id":"taxonomy.mesh.concept.mesh.d024861.concept.mesh.d024803","parent":"concept.mesh.d024803","type":"narrower"},{"child":"concept.mesh.d026684","id":"taxonomy.mesh.concept.mesh.d026684.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d026686","id":"taxonomy.mesh.concept.mesh.d026686.field.mesh.d028662","parent":"field.mesh.d028662","type":"narrower"},{"child":"concept.mesh.d026688","id":"taxonomy.mesh.concept.mesh.d026688.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d026689","id":"taxonomy.mesh.concept.mesh.d026689.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d026712","id":"taxonomy.mesh.concept.mesh.d026712.concept.mesh.d019369","parent":"concept.mesh.d019369","type":"narrower"},{"child":"concept.mesh.d026724","id":"taxonomy.mesh.concept.mesh.d026724.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028661","id":"taxonomy.mesh.concept.mesh.d028661.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028663","id":"taxonomy.mesh.concept.mesh.d028663.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028681","id":"taxonomy.mesh.concept.mesh.d028681.concept.mesh.d012941","parent":"concept.mesh.d012941","type":"narrower"},{"child":"concept.mesh.d028683","id":"taxonomy.mesh.concept.mesh.d028683.concept.mesh.d011056","parent":"concept.mesh.d011056","type":"narrower"},{"child":"concept.mesh.d028722","id":"taxonomy.mesh.concept.mesh.d028722.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d028723","id":"taxonomy.mesh.concept.mesh.d028723.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d028781","id":"taxonomy.mesh.concept.mesh.d028781.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d029181","id":"taxonomy.mesh.concept.mesh.d029181.field.mesh.d012069","parent":"field.mesh.d012069","type":"narrower"},{"child":"concept.mesh.d030141","id":"taxonomy.mesh.concept.mesh.d030141.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d030861","id":"taxonomy.mesh.concept.mesh.d030861.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d031261","id":"taxonomy.mesh.concept.mesh.d031261.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d032764","id":"taxonomy.mesh.concept.mesh.d032764.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d032903","id":"taxonomy.mesh.concept.mesh.d032903.concept.mesh.d012072","parent":"concept.mesh.d012072","type":"narrower"},{"child":"concept.mesh.d033003","id":"taxonomy.mesh.concept.mesh.d033003.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d033041","id":"taxonomy.mesh.concept.mesh.d033041.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d033042","id":"taxonomy.mesh.concept.mesh.d033042.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d033061","id":"taxonomy.mesh.concept.mesh.d033061.concept.mesh.d026724","parent":"concept.mesh.d026724","type":"narrower"},{"child":"concept.mesh.d033302","id":"taxonomy.mesh.concept.mesh.d033302.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d033303","id":"taxonomy.mesh.concept.mesh.d033303.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d033421","id":"taxonomy.mesh.concept.mesh.d033421.concept.mesh.d019369","parent":"concept.mesh.d019369","type":"narrower"},{"child":"concept.mesh.d034161","id":"taxonomy.mesh.concept.mesh.d034161.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d034682","id":"taxonomy.mesh.concept.mesh.d034682.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"concept.mesh.d034723","id":"taxonomy.mesh.concept.mesh.d034723.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"concept.mesh.d035061","id":"taxonomy.mesh.concept.mesh.d035061.concept.mesh.d012107","parent":"concept.mesh.d012107","type":"narrower"},{"child":"concept.mesh.d035481","id":"taxonomy.mesh.concept.mesh.d035481.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d035501","id":"taxonomy.mesh.concept.mesh.d035501.concept.mesh.d011336","parent":"concept.mesh.d011336","type":"narrower"},{"child":"concept.mesh.d035621","id":"taxonomy.mesh.concept.mesh.d035621.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d035761","id":"taxonomy.mesh.concept.mesh.d035761.concept.mesh.d026689","parent":"concept.mesh.d026689","type":"narrower"},{"child":"concept.mesh.d035841","id":"taxonomy.mesh.concept.mesh.d035841.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d035843","id":"taxonomy.mesh.concept.mesh.d035843.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d035863","id":"taxonomy.mesh.concept.mesh.d035863.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"concept.mesh.d036262","id":"taxonomy.mesh.concept.mesh.d036262.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d036281","id":"taxonomy.mesh.concept.mesh.d036281.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d036301","id":"taxonomy.mesh.concept.mesh.d036301.concept.mesh.d036262","parent":"concept.mesh.d036262","type":"narrower"},{"child":"concept.mesh.d038622","id":"taxonomy.mesh.concept.mesh.d038622.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d040242","id":"taxonomy.mesh.concept.mesh.d040242.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d040261","id":"taxonomy.mesh.concept.mesh.d040261.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d040841","id":"taxonomy.mesh.concept.mesh.d040841.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d043762","id":"taxonomy.mesh.concept.mesh.d043762.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d050997","id":"taxonomy.mesh.concept.mesh.d050997.ology.nanotechnology","parent":"ology.nanotechnology","type":"narrower"},{"child":"concept.mesh.d052156","id":"taxonomy.mesh.concept.mesh.d052156.concept.mesh.d020650","parent":"concept.mesh.d020650","type":"narrower"},{"child":"concept.mesh.d053604","id":"taxonomy.mesh.concept.mesh.d053604.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"concept.mesh.d053821","id":"taxonomy.mesh.concept.mesh.d053821.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d054802","id":"taxonomy.mesh.concept.mesh.d054802.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d055499","id":"taxonomy.mesh.concept.mesh.d055499.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d055809","id":"taxonomy.mesh.concept.mesh.d055809.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d055812","id":"taxonomy.mesh.concept.mesh.d055812.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d055990","id":"taxonomy.mesh.concept.mesh.d055990.field.mesh.d032984","parent":"field.mesh.d032984","type":"narrower"},{"child":"concept.mesh.d056146","id":"taxonomy.mesh.concept.mesh.d056146.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d057005","id":"taxonomy.mesh.concept.mesh.d057005.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d057170","id":"taxonomy.mesh.concept.mesh.d057170.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d057172","id":"taxonomy.mesh.concept.mesh.d057172.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d057185","id":"taxonomy.mesh.concept.mesh.d057185.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d057205","id":"taxonomy.mesh.concept.mesh.d057205.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"concept.mesh.d057212","id":"taxonomy.mesh.concept.mesh.d057212.field.mesh.d032984","parent":"field.mesh.d032984","type":"narrower"},{"child":"concept.mesh.d057217","id":"taxonomy.mesh.concept.mesh.d057217.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d057565","id":"taxonomy.mesh.concept.mesh.d057565.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d057766","id":"taxonomy.mesh.concept.mesh.d057766.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d057905","id":"taxonomy.mesh.concept.mesh.d057905.concept.mesh.d035843","parent":"concept.mesh.d035843","type":"narrower"},{"child":"concept.mesh.d057930","id":"taxonomy.mesh.concept.mesh.d057930.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d058011","id":"taxonomy.mesh.concept.mesh.d058011.concept.mesh.d000098405","parent":"concept.mesh.d000098405","type":"narrower"},{"child":"concept.mesh.d058028","id":"taxonomy.mesh.concept.mesh.d058028.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d058345","id":"taxonomy.mesh.concept.mesh.d058345.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d058433","id":"taxonomy.mesh.concept.mesh.d058433.concept.mesh.d019149","parent":"concept.mesh.d019149","type":"narrower"},{"child":"concept.mesh.d058443","id":"taxonomy.mesh.concept.mesh.d058443.concept.mesh.d001290","parent":"concept.mesh.d001290","type":"narrower"},{"child":"concept.mesh.d058634","id":"taxonomy.mesh.concept.mesh.d058634.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"concept.mesh.d058996","id":"taxonomy.mesh.concept.mesh.d058996.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d058999","id":"taxonomy.mesh.concept.mesh.d058999.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d059021","id":"taxonomy.mesh.concept.mesh.d059021.concept.mesh.d011786","parent":"concept.mesh.d011786","type":"narrower"},{"child":"concept.mesh.d059066","id":"taxonomy.mesh.concept.mesh.d059066.field.economics","parent":"field.economics","type":"narrower"},{"child":"concept.mesh.d059413","id":"taxonomy.mesh.concept.mesh.d059413.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060085","id":"taxonomy.mesh.concept.mesh.d060085.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060326","id":"taxonomy.mesh.concept.mesh.d060326.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"concept.mesh.d060327","id":"taxonomy.mesh.concept.mesh.d060327.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d060388","id":"taxonomy.mesh.concept.mesh.d060388.concept.mesh.d000069553","parent":"concept.mesh.d000069553","type":"narrower"},{"child":"concept.mesh.d060685","id":"taxonomy.mesh.concept.mesh.d060685.concept.mesh.d000223","parent":"concept.mesh.d000223","type":"narrower"},{"child":"concept.mesh.d060737","id":"taxonomy.mesh.concept.mesh.d060737.concept.mesh.d007239","parent":"concept.mesh.d007239","type":"narrower"},{"child":"concept.mesh.d060845","id":"taxonomy.mesh.concept.mesh.d060845.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d060846","id":"taxonomy.mesh.concept.mesh.d060846.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"concept.mesh.d060847","id":"taxonomy.mesh.concept.mesh.d060847.concept.mesh.d060846","parent":"concept.mesh.d060846","type":"narrower"},{"child":"concept.mesh.d060986","id":"taxonomy.mesh.concept.mesh.d060986.concept.mesh.d014881","parent":"concept.mesh.d014881","type":"narrower"},{"child":"concept.mesh.d061148","id":"taxonomy.mesh.concept.mesh.d061148.field.mesh.d010686","parent":"field.mesh.d010686","type":"narrower"},{"child":"concept.mesh.d061565","id":"taxonomy.mesh.concept.mesh.d061565.concept.mesh.d060326","parent":"concept.mesh.d060326","type":"narrower"},{"child":"concept.mesh.d062028","id":"taxonomy.mesh.concept.mesh.d062028.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"concept.mesh.d062069","id":"taxonomy.mesh.concept.mesh.d062069.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"concept.mesh.d063369","id":"taxonomy.mesh.concept.mesh.d063369.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d063426","id":"taxonomy.mesh.concept.mesh.d063426.field.mesh.d011157","parent":"field.mesh.d011157","type":"narrower"},{"child":"concept.mesh.d063586","id":"taxonomy.mesh.concept.mesh.d063586.concept.mesh.d012106","parent":"concept.mesh.d012106","type":"narrower"},{"child":"concept.mesh.d064226","id":"taxonomy.mesh.concept.mesh.d064226.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d064423","id":"taxonomy.mesh.concept.mesh.d064423.concept.mesh.d003415","parent":"concept.mesh.d003415","type":"narrower"},{"child":"concept.mesh.d064424","id":"taxonomy.mesh.concept.mesh.d064424.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d064890","id":"taxonomy.mesh.concept.mesh.d064890.concept.mesh.d006304","parent":"concept.mesh.d006304","type":"narrower"},{"child":"concept.mesh.d065287","id":"taxonomy.mesh.concept.mesh.d065287.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.mesh.d065840","id":"taxonomy.mesh.concept.mesh.d065840.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.mesh.d066279","id":"taxonomy.mesh.concept.mesh.d066279.concept.mesh.d004644","parent":"concept.mesh.d004644","type":"narrower"},{"child":"concept.mesh.d066288","id":"taxonomy.mesh.concept.mesh.d066288.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d066296","id":"taxonomy.mesh.concept.mesh.d066296.concept.mesh.d036262","parent":"concept.mesh.d036262","type":"narrower"},{"child":"concept.mesh.d066330","id":"taxonomy.mesh.concept.mesh.d066330.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.astronomy","id":"taxonomy.mesh.field.astronomy.field.physics","parent":"field.physics","type":"narrower"},{"child":"field.mesh.d000066949","id":"taxonomy.mesh.field.mesh.d000066949.concept.mesh.d035841","parent":"concept.mesh.d035841","type":"narrower"},{"child":"field.mesh.d000067568","id":"taxonomy.mesh.field.mesh.d000067568.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000068936","id":"taxonomy.mesh.field.mesh.d000068936.field.mesh.d057285","parent":"field.mesh.d057285","type":"narrower"},{"child":"field.mesh.d000070316","id":"taxonomy.mesh.field.mesh.d000070316.field.mesh.d004635","parent":"field.mesh.d004635","type":"narrower"},{"child":"field.mesh.d000071077","id":"taxonomy.mesh.field.mesh.d000071077.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d000073316","id":"taxonomy.mesh.field.mesh.d000073316.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000073320","id":"taxonomy.mesh.field.mesh.d000073320.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d000074266","id":"taxonomy.mesh.field.mesh.d000074266.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000075863","id":"taxonomy.mesh.field.mesh.d000075863.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d000076227","id":"taxonomy.mesh.field.mesh.d000076227.concept.mesh.d066330","parent":"concept.mesh.d066330","type":"narrower"},{"child":"field.mesh.d000077283","id":"taxonomy.mesh.field.mesh.d000077283.field.psychology","parent":"field.psychology","type":"narrower"},{"child":"field.mesh.d000078782","id":"taxonomy.mesh.field.mesh.d000078782.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000079203","id":"taxonomy.mesh.field.mesh.d000079203.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000079645","id":"taxonomy.mesh.field.mesh.d000079645.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000080029","id":"taxonomy.mesh.field.mesh.d000080029.concept.mesh.d055812","parent":"concept.mesh.d055812","type":"narrower"},{"child":"field.mesh.d000080048","id":"taxonomy.mesh.field.mesh.d000080048.field.mesh.d013678","parent":"field.mesh.d013678","type":"narrower"},{"child":"field.mesh.d000081230","id":"taxonomy.mesh.field.mesh.d000081230.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d000082222","id":"taxonomy.mesh.field.mesh.d000082222.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d000084542","id":"taxonomy.mesh.field.mesh.d000084542.field.mesh.d055095","parent":"field.mesh.d055095","type":"narrower"},{"child":"field.mesh.d000085843","id":"taxonomy.mesh.field.mesh.d000085843.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d000085844","id":"taxonomy.mesh.field.mesh.d000085844.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d000088744","id":"taxonomy.mesh.field.mesh.d000088744.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d000089323","id":"taxonomy.mesh.field.mesh.d000089323.field.mesh.d005853","parent":"field.mesh.d005853","type":"narrower"},{"child":"field.mesh.d000089862","id":"taxonomy.mesh.field.mesh.d000089862.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"field.mesh.d000095024","id":"taxonomy.mesh.field.mesh.d000095024.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d000095763","id":"taxonomy.mesh.field.mesh.d000095763.field.mesh.d000486","parent":"field.mesh.d000486","type":"narrower"},{"child":"field.mesh.d000096725","id":"taxonomy.mesh.field.mesh.d000096725.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d000097562","id":"taxonomy.mesh.field.mesh.d000097562.ology.cardiology","parent":"ology.cardiology","type":"narrower"},{"child":"field.mesh.d000099051","id":"taxonomy.mesh.field.mesh.d000099051.field.mesh.d009326","parent":"field.mesh.d009326","type":"narrower"},{"child":"field.mesh.d000099079","id":"taxonomy.mesh.field.mesh.d000099079.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000295","id":"taxonomy.mesh.field.mesh.d000295.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000296","id":"taxonomy.mesh.field.mesh.d000296.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d000337","id":"taxonomy.mesh.field.mesh.d000337.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000486","id":"taxonomy.mesh.field.mesh.d000486.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d000776","id":"taxonomy.mesh.field.mesh.d000776.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d001154","id":"taxonomy.mesh.field.mesh.d001154.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d001255","id":"taxonomy.mesh.field.mesh.d001255.concept.mesh.d009781","parent":"concept.mesh.d009781","type":"narrower"},{"child":"field.mesh.d001524","id":"taxonomy.mesh.field.mesh.d001524.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d001675","id":"taxonomy.mesh.field.mesh.d001675.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d001689","id":"taxonomy.mesh.field.mesh.d001689.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d002665","id":"taxonomy.mesh.field.mesh.d002665.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d002834","id":"taxonomy.mesh.field.mesh.d002834.concept.mesh.d002835","parent":"concept.mesh.d002835","type":"narrower"},{"child":"field.mesh.d003107","id":"taxonomy.mesh.field.mesh.d003107.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d003154","id":"taxonomy.mesh.field.mesh.d003154.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d003158","id":"taxonomy.mesh.field.mesh.d003158.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d003416","id":"taxonomy.mesh.field.mesh.d003416.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"field.mesh.d004635","id":"taxonomy.mesh.field.mesh.d004635.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d004954","id":"taxonomy.mesh.field.mesh.d004954.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d004989","id":"taxonomy.mesh.field.mesh.d004989.concept.mesh.d009014","parent":"concept.mesh.d009014","type":"narrower"},{"child":"field.mesh.d004990","id":"taxonomy.mesh.field.mesh.d004990.field.mesh.d010685","parent":"field.mesh.d010685","type":"narrower"},{"child":"field.mesh.d004991","id":"taxonomy.mesh.field.mesh.d004991.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d004993","id":"taxonomy.mesh.field.mesh.d004993.field.mesh.d010687","parent":"field.mesh.d010687","type":"narrower"},{"child":"field.mesh.d004995","id":"taxonomy.mesh.field.mesh.d004995.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d005053","id":"taxonomy.mesh.field.mesh.d005053.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d005191","id":"taxonomy.mesh.field.mesh.d005191.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"field.mesh.d005194","id":"taxonomy.mesh.field.mesh.d005194.field.mesh.d058006","parent":"field.mesh.d058006","type":"narrower"},{"child":"field.mesh.d005554","id":"taxonomy.mesh.field.mesh.d005554.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d005555","id":"taxonomy.mesh.field.mesh.d005555.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d005826","id":"taxonomy.mesh.field.mesh.d005826.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d005852","id":"taxonomy.mesh.field.mesh.d005852.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d005853","id":"taxonomy.mesh.field.mesh.d005853.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d006663","id":"taxonomy.mesh.field.mesh.d006663.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d006664","id":"taxonomy.mesh.field.mesh.d006664.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d006666","id":"taxonomy.mesh.field.mesh.d006666.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d006804","id":"taxonomy.mesh.field.mesh.d006804.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"field.mesh.d007120","id":"taxonomy.mesh.field.mesh.d007120.field.mesh.d000486","parent":"field.mesh.d000486","type":"narrower"},{"child":"field.mesh.d007218","id":"taxonomy.mesh.field.mesh.d007218.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d007388","id":"taxonomy.mesh.field.mesh.d007388.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d008091","id":"taxonomy.mesh.field.mesh.d008091.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d008092","id":"taxonomy.mesh.field.mesh.d008092.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008093","id":"taxonomy.mesh.field.mesh.d008093.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008495","id":"taxonomy.mesh.field.mesh.d008495.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d008513","id":"taxonomy.mesh.field.mesh.d008513.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d008678","id":"taxonomy.mesh.field.mesh.d008678.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d008887","id":"taxonomy.mesh.field.mesh.d008887.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d008890","id":"taxonomy.mesh.field.mesh.d008890.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d009146","id":"taxonomy.mesh.field.mesh.d009146.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d009229","id":"taxonomy.mesh.field.mesh.d009229.field.mesh.d008091","parent":"field.mesh.d008091","type":"narrower"},{"child":"field.mesh.d009326","id":"taxonomy.mesh.field.mesh.d009326.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d009493","id":"taxonomy.mesh.field.mesh.d009493.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d009683","id":"taxonomy.mesh.field.mesh.d009683.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d009717","id":"taxonomy.mesh.field.mesh.d009717.field.mesh.d001154","parent":"field.mesh.d001154","type":"narrower"},{"child":"field.mesh.d009774","id":"taxonomy.mesh.field.mesh.d009774.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d009985","id":"taxonomy.mesh.field.mesh.d009985.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d010021","id":"taxonomy.mesh.field.mesh.d010021.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d010036","id":"taxonomy.mesh.field.mesh.d010036.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d010338","id":"taxonomy.mesh.field.mesh.d010338.ology.pathology","parent":"ology.pathology","type":"narrower"},{"child":"field.mesh.d010340","id":"taxonomy.mesh.field.mesh.d010340.ology.pathology","parent":"ology.pathology","type":"narrower"},{"child":"field.mesh.d010372","id":"taxonomy.mesh.field.mesh.d010372.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d010500","id":"taxonomy.mesh.field.mesh.d010500.field.mesh.d010372","parent":"field.mesh.d010372","type":"narrower"},{"child":"field.mesh.d010681","id":"taxonomy.mesh.field.mesh.d010681.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010682","id":"taxonomy.mesh.field.mesh.d010682.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010683","id":"taxonomy.mesh.field.mesh.d010683.ology.philology","parent":"ology.philology","type":"narrower"},{"child":"field.mesh.d010685","id":"taxonomy.mesh.field.mesh.d010685.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010686","id":"taxonomy.mesh.field.mesh.d010686.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010687","id":"taxonomy.mesh.field.mesh.d010687.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.mesh.d010792","id":"taxonomy.mesh.field.mesh.d010792.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d010810","id":"taxonomy.mesh.field.mesh.d010810.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d011057","id":"taxonomy.mesh.field.mesh.d011057.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"field.mesh.d011157","id":"taxonomy.mesh.field.mesh.d011157.ology.demography","parent":"ology.demography","type":"narrower"},{"child":"field.mesh.d011315","id":"taxonomy.mesh.field.mesh.d011315.field.mesh.d011634","parent":"field.mesh.d011634","type":"narrower"},{"child":"field.mesh.d011316","id":"taxonomy.mesh.field.mesh.d011316.field.mesh.d003158","parent":"field.mesh.d003158","type":"narrower"},{"child":"field.mesh.d011570","id":"taxonomy.mesh.field.mesh.d011570.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d011593","id":"taxonomy.mesh.field.mesh.d011593.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"field.mesh.d011634","id":"taxonomy.mesh.field.mesh.d011634.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d012067","id":"taxonomy.mesh.field.mesh.d012067.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d012068","id":"taxonomy.mesh.field.mesh.d012068.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012069","id":"taxonomy.mesh.field.mesh.d012069.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012070","id":"taxonomy.mesh.field.mesh.d012070.field.mesh.d012067","parent":"field.mesh.d012067","type":"narrower"},{"child":"field.mesh.d012371","id":"taxonomy.mesh.field.mesh.d012371.concept.mesh.d001331","parent":"concept.mesh.d001331","type":"narrower"},{"child":"field.mesh.d012936","id":"taxonomy.mesh.field.mesh.d012936.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d012962","id":"taxonomy.mesh.field.mesh.d012962.field.sociology","parent":"field.sociology","type":"narrower"},{"child":"field.mesh.d013043","id":"taxonomy.mesh.field.mesh.d013043.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d013178","id":"taxonomy.mesh.field.mesh.d013178.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d013366","id":"taxonomy.mesh.field.mesh.d013366.field.mesh.d009326","parent":"field.mesh.d009326","type":"narrower"},{"child":"field.mesh.d013502","id":"taxonomy.mesh.field.mesh.d013502.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d013518","id":"taxonomy.mesh.field.mesh.d013518.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d013674","id":"taxonomy.mesh.field.mesh.d013674.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013677","id":"taxonomy.mesh.field.mesh.d013677.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013678","id":"taxonomy.mesh.field.mesh.d013678.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013679","id":"taxonomy.mesh.field.mesh.d013679.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d013903","id":"taxonomy.mesh.field.mesh.d013903.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d014330","id":"taxonomy.mesh.field.mesh.d014330.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d014686","id":"taxonomy.mesh.field.mesh.d014686.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d014943","id":"taxonomy.mesh.field.mesh.d014943.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d015272","id":"taxonomy.mesh.field.mesh.d015272.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d015510","id":"taxonomy.mesh.field.mesh.d015510.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d015642","id":"taxonomy.mesh.field.mesh.d015642.ology.radiology","parent":"ology.radiology","type":"narrower"},{"child":"field.mesh.d017711","id":"taxonomy.mesh.field.mesh.d017711.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"field.mesh.d017720","id":"taxonomy.mesh.field.mesh.d017720.field.mesh.d062346","parent":"field.mesh.d062346","type":"narrower"},{"child":"field.mesh.d017891","id":"taxonomy.mesh.field.mesh.d017891.ology.pharmacology","parent":"ology.pharmacology","type":"narrower"},{"child":"field.mesh.d018456","id":"taxonomy.mesh.field.mesh.d018456.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d018732","id":"taxonomy.mesh.field.mesh.d018732.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d018787","id":"taxonomy.mesh.field.mesh.d018787.field.mesh.d008495","parent":"field.mesh.d008495","type":"narrower"},{"child":"field.mesh.d018961","id":"taxonomy.mesh.field.mesh.d018961.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d019021","id":"taxonomy.mesh.field.mesh.d019021.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d019317","id":"taxonomy.mesh.field.mesh.d019317.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d019371","id":"taxonomy.mesh.field.mesh.d019371.field.mesh.d062306","parent":"field.mesh.d062306","type":"narrower"},{"child":"field.mesh.d020811","id":"taxonomy.mesh.field.mesh.d020811.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d026690","id":"taxonomy.mesh.field.mesh.d026690.field.mesh.d001675","parent":"field.mesh.d001675","type":"narrower"},{"child":"field.mesh.d028662","id":"taxonomy.mesh.field.mesh.d028662.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d032701","id":"taxonomy.mesh.field.mesh.d032701.ology.biotechnology","parent":"ology.biotechnology","type":"narrower"},{"child":"field.mesh.d032984","id":"taxonomy.mesh.field.mesh.d032984.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d040821","id":"taxonomy.mesh.field.mesh.d040821.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"field.mesh.d040861","id":"taxonomy.mesh.field.mesh.d040861.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"field.mesh.d044085","id":"taxonomy.mesh.field.mesh.d044085.field.mesh.d055616","parent":"field.mesh.d055616","type":"narrower"},{"child":"field.mesh.d044707","id":"taxonomy.mesh.field.mesh.d044707.ology.criminology","parent":"ology.criminology","type":"narrower"},{"child":"field.mesh.d044709","id":"taxonomy.mesh.field.mesh.d044709.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d044968","id":"taxonomy.mesh.field.mesh.d044968.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d049429","id":"taxonomy.mesh.field.mesh.d049429.field.mesh.d005554","parent":"field.mesh.d005554","type":"narrower"},{"child":"field.mesh.d049690","id":"taxonomy.mesh.field.mesh.d049690.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049691","id":"taxonomy.mesh.field.mesh.d049691.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049692","id":"taxonomy.mesh.field.mesh.d049692.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d049711","id":"taxonomy.mesh.field.mesh.d049711.field.mesh.d006664","parent":"field.mesh.d006664","type":"narrower"},{"child":"field.mesh.d052938","id":"taxonomy.mesh.field.mesh.d052938.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d053593","id":"taxonomy.mesh.field.mesh.d053593.field.mesh.d044707","parent":"field.mesh.d044707","type":"narrower"},{"child":"field.mesh.d053803","id":"taxonomy.mesh.field.mesh.d053803.field.mesh.d005554","parent":"field.mesh.d005554","type":"narrower"},{"child":"field.mesh.d054597","id":"taxonomy.mesh.field.mesh.d054597.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d054849","id":"taxonomy.mesh.field.mesh.d054849.ology.cardiology","parent":"ology.cardiology","type":"narrower"},{"child":"field.mesh.d055048","id":"taxonomy.mesh.field.mesh.d055048.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d055095","id":"taxonomy.mesh.field.mesh.d055095.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"field.mesh.d055416","id":"taxonomy.mesh.field.mesh.d055416.field.mesh.d019317","parent":"field.mesh.d019317","type":"narrower"},{"child":"field.mesh.d055552","id":"taxonomy.mesh.field.mesh.d055552.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d055616","id":"taxonomy.mesh.field.mesh.d055616.concept.mesh.d008904","parent":"concept.mesh.d008904","type":"narrower"},{"child":"field.mesh.d055772","id":"taxonomy.mesh.field.mesh.d055772.field.mesh.d013672","parent":"field.mesh.d013672","type":"narrower"},{"child":"field.mesh.d055813","id":"taxonomy.mesh.field.mesh.d055813.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d056508","id":"taxonomy.mesh.field.mesh.d056508.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"field.mesh.d057089","id":"taxonomy.mesh.field.mesh.d057089.field.mesh.d062346","parent":"field.mesh.d062346","type":"narrower"},{"child":"field.mesh.d057236","id":"taxonomy.mesh.field.mesh.d057236.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d057285","id":"taxonomy.mesh.field.mesh.d057285.field.mesh.d015510","parent":"field.mesh.d015510","type":"narrower"},{"child":"field.mesh.d057909","id":"taxonomy.mesh.field.mesh.d057909.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"field.mesh.d058006","id":"taxonomy.mesh.field.mesh.d058006.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d058027","id":"taxonomy.mesh.field.mesh.d058027.field.mesh.d011570","parent":"field.mesh.d011570","type":"narrower"},{"child":"field.mesh.d058615","id":"taxonomy.mesh.field.mesh.d058615.concept.mesh.d057005","parent":"concept.mesh.d057005","type":"narrower"},{"child":"field.mesh.d060432","id":"taxonomy.mesh.field.mesh.d060432.field.anthropology","parent":"field.anthropology","type":"narrower"},{"child":"field.mesh.d062306","id":"taxonomy.mesh.field.mesh.d062306.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d062346","id":"taxonomy.mesh.field.mesh.d062346.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d063165","id":"taxonomy.mesh.field.mesh.d063165.ology.neurology","parent":"ology.neurology","type":"narrower"},{"child":"field.mesh.d064132","id":"taxonomy.mesh.field.mesh.d064132.field.mesh.d013178","parent":"field.mesh.d013178","type":"narrower"},{"child":"field.mesh.d064416","id":"taxonomy.mesh.field.mesh.d064416.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d064796","id":"taxonomy.mesh.field.mesh.d064796.field.mesh.d013178","parent":"field.mesh.d013178","type":"narrower"},{"child":"field.mesh.d064826","id":"taxonomy.mesh.field.mesh.d064826.ology.hematology","parent":"ology.hematology","type":"narrower"},{"child":"field.mesh.d065126","id":"taxonomy.mesh.field.mesh.d065126.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"field.mesh.d066291","id":"taxonomy.mesh.field.mesh.d066291.field.mesh.d008513","parent":"field.mesh.d008513","type":"narrower"},{"child":"field.systems-biology","id":"taxonomy.mesh.field.systems-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.cognitive-psychology","id":"taxonomy.mesh.ology.cognitive-psychology.field.cognitive-science","parent":"field.cognitive-science","type":"narrower"},{"child":"ology.cryobiology","id":"taxonomy.mesh.ology.cryobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.cytology","id":"taxonomy.mesh.ology.cytology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.embryology","id":"taxonomy.mesh.ology.embryology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.ethnology","id":"taxonomy.mesh.ology.ethnology.field.anthropology","parent":"field.anthropology","type":"narrower"},{"child":"ology.genomics","id":"taxonomy.mesh.ology.genomics.field.genetics","parent":"field.genetics","type":"narrower"},{"child":"ology.glycobiology","id":"taxonomy.mesh.ology.glycobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.neurobiology","id":"taxonomy.mesh.ology.neurobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.neuropathology","id":"taxonomy.mesh.ology.neuropathology.ology.neurology","parent":"ology.neurology","type":"narrower"},{"child":"ology.pharmacognosy","id":"taxonomy.mesh.ology.pharmacognosy.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.proteomics","id":"taxonomy.mesh.ology.proteomics.ology.genomics","parent":"ology.genomics","type":"narrower"},{"child":"ology.psychopharmacology","id":"taxonomy.mesh.ology.psychopharmacology.ology.pharmacology","parent":"ology.pharmacology","type":"narrower"},{"child":"ology.rheology","id":"taxonomy.mesh.ology.rheology.field.physics","parent":"field.physics","type":"narrower"},{"child":"ology.sociobiology","id":"taxonomy.mesh.ology.sociobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.teratology","id":"taxonomy.mesh.ology.teratology.ology.embryology","parent":"ology.embryology","type":"narrower"},{"child":"physical.density-functional-theory","id":"taxonomy.mesh.physical.density-functional-theory.physical.nuclear-physics","parent":"physical.nuclear-physics","type":"narrower"},{"child":"physical.nuclear-physics","id":"taxonomy.mesh.physical.nuclear-physics.field.physics","parent":"field.physics","type":"narrower"},{"child":"physical.quantum-mechanics","id":"taxonomy.mesh.physical.quantum-mechanics.physical.nuclear-physics","parent":"physical.nuclear-physics","type":"narrower"},{"child":"method.nist.ackermann","id":"taxonomy.method.nist.ackermann.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.adaptiveheapsort","id":"taxonomy.method.nist.adaptiveheapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.adaptivehuffman","id":"taxonomy.method.nist.adaptivehuffman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.addresscalc","id":"taxonomy.method.nist.addresscalc.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.ahocorasick","id":"taxonomy.method.nist.ahocorasick.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.algorithmfgk","id":"taxonomy.method.nist.algorithmfgk.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.americanflagsort","id":"taxonomy.method.nist.americanflagsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.arithmeticcoding","id":"taxonomy.method.nist.arithmeticcoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.arraymerg","id":"taxonomy.method.nist.arraymerg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balanc2wayms","id":"taxonomy.method.nist.balanc2wayms.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balancedqsrt","id":"taxonomy.method.nist.balancedqsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balanckwayms","id":"taxonomy.method.nist.balanckwayms.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.balancmrgsrt","id":"taxonomy.method.nist.balancmrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.baumwelch","id":"taxonomy.method.nist.baumwelch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bbp","id":"taxonomy.method.nist.bbp.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bellmanford","id":"taxonomy.method.nist.bellmanford.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bestfirst","id":"taxonomy.method.nist.bestfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bidirectionalbubblesort","id":"taxonomy.method.nist.bidirectionalbubblesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.binaryinsort","id":"taxonomy.method.nist.binaryinsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.binarysearch","id":"taxonomy.method.nist.binarysearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bingosort","id":"taxonomy.method.nist.bingosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bitonicsort","id":"taxonomy.method.nist.bitonicsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.blindsort","id":"taxonomy.method.nist.blindsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bogosort","id":"taxonomy.method.nist.bogosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bondseqsearch","id":"taxonomy.method.nist.bondseqsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boruvkasalgorithm","id":"taxonomy.method.nist.boruvkasalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boyermoore","id":"taxonomy.method.nist.boyermoore.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.boyermoorehorspool","id":"taxonomy.method.nist.boyermoorehorspool.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bozosort","id":"taxonomy.method.nist.bozosort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.breadthfirst","id":"taxonomy.method.nist.breadthfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bresenham","id":"taxonomy.method.nist.bresenham.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bruteforcestringsearch","id":"taxonomy.method.nist.bruteforcestringsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bruteforcestrsrchwmismatch","id":"taxonomy.method.nist.bruteforcestrsrchwmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bubblesort","id":"taxonomy.method.nist.bubblesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.bucketsort","id":"taxonomy.method.nist.bucketsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.buddysystem","id":"taxonomy.method.nist.buddysystem.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.buildheap","id":"taxonomy.method.nist.buildheap.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.burrowswheelertransform","id":"taxonomy.method.nist.burrowswheelertransform.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.caverphone","id":"taxonomy.method.nist.caverphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.chinesermndr","id":"taxonomy.method.nist.chinesermndr.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.christofides","id":"taxonomy.method.nist.christofides.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.collisionres","id":"taxonomy.method.nist.collisionres.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.combination","id":"taxonomy.method.nist.combination.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.combsort","id":"taxonomy.method.nist.combsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.commentzwalter","id":"taxonomy.method.nist.commentzwalter.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.cordic","id":"taxonomy.method.nist.cordic.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.countingsort","id":"taxonomy.method.nist.countingsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.cyclicredundancycheck","id":"taxonomy.method.nist.cyclicredundancycheck.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dagshortpath","id":"taxonomy.method.nist.dagshortpath.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.depthfirst","id":"taxonomy.method.nist.depthfirst.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.derangement","id":"taxonomy.method.nist.derangement.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.determfinitautsrch","id":"taxonomy.method.nist.determfinitautsrch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.deutschjozsaalgo","id":"taxonomy.method.nist.deutschjozsaalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dijkstraalgo","id":"taxonomy.method.nist.dijkstraalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.diminishingincsort","id":"taxonomy.method.nist.diminishingincsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.distributionsort","id":"taxonomy.method.nist.distributionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.distributivepartitioningsort","id":"taxonomy.method.nist.distributivepartitioningsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doomsday","id":"taxonomy.method.nist.doomsday.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doublehashng","id":"taxonomy.method.nist.doublehashng.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.doublemetaphone","id":"taxonomy.method.nist.doublemetaphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.dualpivotquicksort","id":"taxonomy.method.nist.dualpivotquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.euclidalgo","id":"taxonomy.method.nist.euclidalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.extendeuclid","id":"taxonomy.method.nist.extendeuclid.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalmemoryalgo","id":"taxonomy.method.nist.externalmemoryalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalmerg","id":"taxonomy.method.nist.externalmerg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.externalquicksort","id":"taxonomy.method.nist.externalquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fastfouriertransform","id":"taxonomy.method.nist.fastfouriertransform.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fibonacciansearch","id":"taxonomy.method.nist.fibonacciansearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.find","id":"taxonomy.method.nist.find.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.floydwarshall","id":"taxonomy.method.nist.floydwarshall.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.fordfulkerson","id":"taxonomy.method.nist.fordfulkerson.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.frequencycounthueristic","id":"taxonomy.method.nist.frequencycounthueristic.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.gnomesort","id":"taxonomy.method.nist.gnomesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.greatestcommondivisor","id":"taxonomy.method.nist.greatestcommondivisor.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hash","id":"taxonomy.method.nist.hash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hashtabdelet","id":"taxonomy.method.nist.hashtabdelet.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.heapify","id":"taxonomy.method.nist.heapify.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.heapsort","id":"taxonomy.method.nist.heapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.histogramsort","id":"taxonomy.method.nist.histogramsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.hsadelta","id":"taxonomy.method.nist.hsadelta.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.huffmancoding","id":"taxonomy.method.nist.huffmancoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.idealmerge","id":"taxonomy.method.nist.idealmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.idealrandomshuffle","id":"taxonomy.method.nist.idealrandomshuffle.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.inordertraversal","id":"taxonomy.method.nist.inordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.inplacesort","id":"taxonomy.method.nist.inplacesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.insertionsort","id":"taxonomy.method.nist.insertionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.interpolationsearch","id":"taxonomy.method.nist.interpolationsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.interpsequen","id":"taxonomy.method.nist.interpsequen.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.introspectivesort","id":"taxonomy.method.nist.introspectivesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.j_sort","id":"taxonomy.method.nist.j_sort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jarowinkler","id":"taxonomy.method.nist.jarowinkler.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.johnsonsalgorithm","id":"taxonomy.method.nist.johnsonsalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.johnsontrotter","id":"taxonomy.method.nist.johnsontrotter.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jsort","id":"taxonomy.method.nist.jsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.jumpsearch","id":"taxonomy.method.nist.jumpsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karnaughmap","id":"taxonomy.method.nist.karnaughmap.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karprabin","id":"taxonomy.method.nist.karprabin.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.karyhuffman","id":"taxonomy.method.nist.karyhuffman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.knuthmorrispratt","id":"taxonomy.method.nist.knuthmorrispratt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.kruskalsalgo","id":"taxonomy.method.nist.kruskalsalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.kwaymergesort","id":"taxonomy.method.nist.kwaymergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.lcfshashing","id":"taxonomy.method.nist.lcfshashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.leftrotation","id":"taxonomy.method.nist.leftrotation.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.lempelzivwelch","id":"taxonomy.method.nist.lempelzivwelch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.levelordertraversal","id":"taxonomy.method.nist.levelordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.linearhash","id":"taxonomy.method.nist.linearhash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.linearsearch","id":"taxonomy.method.nist.linearsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.localitysensitivehashing","id":"taxonomy.method.nist.localitysensitivehashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.luckysort","id":"taxonomy.method.nist.luckysort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.malhotrakumr","id":"taxonomy.method.nist.malhotrakumr.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.mergesort","id":"taxonomy.method.nist.mergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.metaphone","id":"taxonomy.method.nist.metaphone.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.minimalperfecthash","id":"taxonomy.method.nist.minimalperfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.minimax","id":"taxonomy.method.nist.minimax.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.modelcheckng","id":"taxonomy.method.nist.modelcheckng.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.modifind","id":"taxonomy.method.nist.modifind.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.movefront","id":"taxonomy.method.nist.movefront.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.movetoroot","id":"taxonomy.method.nist.movetoroot.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.multikeyquicksort","id":"taxonomy.method.nist.multikeyquicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.multiprefix","id":"taxonomy.method.nist.multiprefix.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.munkresassignment","id":"taxonomy.method.nist.munkresassignment.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.nonbalncmsrt","id":"taxonomy.method.nist.nonbalncmsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.nysiis","id":"taxonomy.method.nist.nysiis.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.openaddressing","id":"taxonomy.method.nist.openaddressing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimalmismatch","id":"taxonomy.method.nist.optimalmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimalpolyphasemergesort","id":"taxonomy.method.nist.optimalpolyphasemergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.optimpolymrg","id":"taxonomy.method.nist.optimpolymrg.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.orderpreservinghuffmancoding","id":"taxonomy.method.nist.orderpreservinghuffmancoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.orderpreservminperfecthash","id":"taxonomy.method.nist.orderpreservminperfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.oscillatingmergesort","id":"taxonomy.method.nist.oscillatingmergesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pearsonshash","id":"taxonomy.method.nist.pearsonshash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.perfecthash","id":"taxonomy.method.nist.perfecthash.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.perfectshuffle","id":"taxonomy.method.nist.perfectshuffle.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.permutation","id":"taxonomy.method.nist.permutation.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.permutationsort","id":"taxonomy.method.nist.permutationsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pigeonholesort","id":"taxonomy.method.nist.pigeonholesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.polyphmerge","id":"taxonomy.method.nist.polyphmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.polyphmrgsrt","id":"taxonomy.method.nist.polyphmrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.postmansort","id":"taxonomy.method.nist.postmansort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.postordertraversal","id":"taxonomy.method.nist.postordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.preordertraversal","id":"taxonomy.method.nist.preordertraversal.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.primjarnik","id":"taxonomy.method.nist.primjarnik.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.pseudorandomnumbergen","id":"taxonomy.method.nist.pseudorandomnumbergen.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.qsort","id":"taxonomy.method.nist.qsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quadraticprb","id":"taxonomy.method.nist.quadraticprb.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quicksearch","id":"taxonomy.method.nist.quicksearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.quicksort","id":"taxonomy.method.nist.quicksort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.radixsort","id":"taxonomy.method.nist.radixsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.randomizdrnd","id":"taxonomy.method.nist.randomizdrnd.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.randomsearch","id":"taxonomy.method.nist.randomsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rangesort","id":"taxonomy.method.nist.rangesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rapidsort","id":"taxonomy.method.nist.rapidsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.ratcliffobershelp","id":"taxonomy.method.nist.ratcliffobershelp.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rebalance","id":"taxonomy.method.nist.rebalance.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.repeatedsquaring","id":"taxonomy.method.nist.repeatedsquaring.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.reservoirsampling","id":"taxonomy.method.nist.reservoirsampling.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.rightrotatn","id":"taxonomy.method.nist.rightrotatn.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.robinhoodhashing","id":"taxonomy.method.nist.robinhoodhashing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.scan","id":"taxonomy.method.nist.scan.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.scapegoattree","id":"taxonomy.method.nist.scapegoattree.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.search","id":"taxonomy.method.nist.search.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.secantsearch","id":"taxonomy.method.nist.secantsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.select","id":"taxonomy.method.nist.select.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.selectionsort","id":"taxonomy.method.nist.selectionsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.selectmode","id":"taxonomy.method.nist.selectmode.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shadowmerge","id":"taxonomy.method.nist.shadowmerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shadowmrgins","id":"taxonomy.method.nist.shadowmrgins.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shannonfano","id":"taxonomy.method.nist.shannonfano.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shellsort","id":"taxonomy.method.nist.shellsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shiftor","id":"taxonomy.method.nist.shiftor.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.shufflesort","id":"taxonomy.method.nist.shufflesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.sieve","id":"taxonomy.method.nist.sieve.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.siftup","id":"taxonomy.method.nist.siftup.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.simplemerge","id":"taxonomy.method.nist.simplemerge.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.simulatedannealing","id":"taxonomy.method.nist.simulatedannealing.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smithalgorithm","id":"taxonomy.method.nist.smithalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smithwaterman","id":"taxonomy.method.nist.smithwaterman.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.smoothsort","id":"taxonomy.method.nist.smoothsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.sort","id":"taxonomy.method.nist.sort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.soundex","id":"taxonomy.method.nist.soundex.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.spaceorderingmethod","id":"taxonomy.method.nist.spaceorderingmethod.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.starencoding","id":"taxonomy.method.nist.starencoding.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stoogesort","id":"taxonomy.method.nist.stoogesort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.strandsort","id":"taxonomy.method.nist.strandsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stringmatchwerror","id":"taxonomy.method.nist.stringmatchwerror.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stringmatchwmismatch","id":"taxonomy.method.nist.stringmatchwmismatch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.strsrch","id":"taxonomy.method.nist.strsrch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.stupidsort","id":"taxonomy.method.nist.stupidsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.threewaymsrt","id":"taxonomy.method.nist.threewaymsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.topdownradixsort","id":"taxonomy.method.nist.topdownradixsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.tournament","id":"taxonomy.method.nist.tournament.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.transposeseqsearch","id":"taxonomy.method.nist.transposeseqsearch.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.treesort1","id":"taxonomy.method.nist.treesort1.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.treesort2","id":"taxonomy.method.nist.treesort2.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.tripartition","id":"taxonomy.method.nist.tripartition.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.twoway","id":"taxonomy.method.nist.twoway.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.twowaymrgsrt","id":"taxonomy.method.nist.twowaymrgsrt.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unbiasedcoinflipalgo","id":"taxonomy.method.nist.unbiasedcoinflipalgo.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.uniformhashn","id":"taxonomy.method.nist.uniformhashn.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unionautoma","id":"taxonomy.method.nist.unionautoma.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unrank","id":"taxonomy.method.nist.unrank.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.unshufflsort","id":"taxonomy.method.nist.unshufflsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.viterbialgorithm","id":"taxonomy.method.nist.viterbialgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.vittersalgorithm","id":"taxonomy.method.nist.vittersalgorithm.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.weakheapsort","id":"taxonomy.method.nist.weakheapsort.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.zellerscongruence","id":"taxonomy.method.nist.zellerscongruence.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"method.nist.zhutakaoka","id":"taxonomy.method.nist.zhutakaoka.concept.nist.algorithm","parent":"concept.nist.algorithm","type":"narrower"},{"child":"physical.astrophysics","id":"taxonomy.physical.astrophysics.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"physical.exoplanet-transit-method","id":"taxonomy.physical.exoplanet-transit-method.narrower.field.astronomy","parent":"field.astronomy","type":"narrower"},{"child":"concept.aat.300015649","id":"taxonomy.place.concept.aat.300015649.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300015690","id":"taxonomy.place.concept.aat.300015690.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300018773","id":"taxonomy.place.concept.aat.300018773.concept.aat.300018279","parent":"concept.aat.300018279","type":"narrower"},{"child":"concept.aat.300018775","id":"taxonomy.place.concept.aat.300018775.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018777","id":"taxonomy.place.concept.aat.300018777.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018778","id":"taxonomy.place.concept.aat.300018778.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018779","id":"taxonomy.place.concept.aat.300018779.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300018803","id":"taxonomy.place.concept.aat.300018803.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300054140","id":"taxonomy.place.concept.aat.300054140.concept.aat.300175240","parent":"concept.aat.300175240","type":"narrower"},{"child":"concept.aat.300054154","id":"taxonomy.place.concept.aat.300054154.concept.aat.300175240","parent":"concept.aat.300175240","type":"narrower"},{"child":"concept.aat.300054156","id":"taxonomy.place.concept.aat.300054156.concept.aat.300054154","parent":"concept.aat.300054154","type":"narrower"},{"child":"concept.aat.300054159","id":"taxonomy.place.concept.aat.300054159.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300054171","id":"taxonomy.place.concept.aat.300054171.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300054181","id":"taxonomy.place.concept.aat.300054181.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054183","id":"taxonomy.place.concept.aat.300054183.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054184","id":"taxonomy.place.concept.aat.300054184.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300054269","id":"taxonomy.place.concept.aat.300054269.concept.aat.300263250","parent":"concept.aat.300263250","type":"narrower"},{"child":"concept.aat.300054299","id":"taxonomy.place.concept.aat.300054299.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.aat.300054300","id":"taxonomy.place.concept.aat.300054300.concept.aat.300054299","parent":"concept.aat.300054299","type":"narrower"},{"child":"concept.aat.300054302","id":"taxonomy.place.concept.aat.300054302.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054303","id":"taxonomy.place.concept.aat.300054303.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054304","id":"taxonomy.place.concept.aat.300054304.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054305","id":"taxonomy.place.concept.aat.300054305.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300054306","id":"taxonomy.place.concept.aat.300054306.concept.aat.300054299","parent":"concept.aat.300054299","type":"narrower"},{"child":"concept.aat.300055938","id":"taxonomy.place.concept.aat.300055938.concept.aat.300055126","parent":"concept.aat.300055126","type":"narrower"},{"child":"concept.aat.300055939","id":"taxonomy.place.concept.aat.300055939.concept.aat.300055938","parent":"concept.aat.300055938","type":"narrower"},{"child":"concept.aat.300055959","id":"taxonomy.place.concept.aat.300055959.concept.aat.300145966","parent":"concept.aat.300145966","type":"narrower"},{"child":"concept.aat.300055980","id":"taxonomy.place.concept.aat.300055980.concept.aat.300055126","parent":"concept.aat.300055126","type":"narrower"},{"child":"concept.aat.300069390","id":"taxonomy.place.concept.aat.300069390.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300108565","id":"taxonomy.place.concept.aat.300108565.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300108572","id":"taxonomy.place.concept.aat.300108572.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300113090","id":"taxonomy.place.concept.aat.300113090.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300116922","id":"taxonomy.place.concept.aat.300116922.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300137365","id":"taxonomy.place.concept.aat.300137365.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.aat.300137410","id":"taxonomy.place.concept.aat.300137410.concept.aat.300137365","parent":"concept.aat.300137365","type":"narrower"},{"child":"concept.aat.300138708","id":"taxonomy.place.concept.aat.300138708.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300145966","id":"taxonomy.place.concept.aat.300145966.concept.aat.300055980","parent":"concept.aat.300055980","type":"narrower"},{"child":"concept.aat.300157724","id":"taxonomy.place.concept.aat.300157724.concept.aat.300054300","parent":"concept.aat.300054300","type":"narrower"},{"child":"concept.aat.300161596","id":"taxonomy.place.concept.aat.300161596.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300163423","id":"taxonomy.place.concept.aat.300163423.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300189645","id":"taxonomy.place.concept.aat.300189645.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300260338","id":"taxonomy.place.concept.aat.300260338.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300262588","id":"taxonomy.place.concept.aat.300262588.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300262640","id":"taxonomy.place.concept.aat.300262640.concept.aat.300266481","parent":"concept.aat.300266481","type":"narrower"},{"child":"concept.aat.300263250","id":"taxonomy.place.concept.aat.300263250.field.aat.300054256","parent":"field.aat.300054256","type":"narrower"},{"child":"concept.aat.300264368","id":"taxonomy.place.concept.aat.300264368.field.aat.300055987","parent":"field.aat.300055987","type":"narrower"},{"child":"concept.aat.300266054","id":"taxonomy.place.concept.aat.300266054.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300266367","id":"taxonomy.place.concept.aat.300266367.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300266573","id":"taxonomy.place.concept.aat.300266573.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300311925","id":"taxonomy.place.concept.aat.300311925.concept.aat.300054154","parent":"concept.aat.300054154","type":"narrower"},{"child":"concept.aat.300312347","id":"taxonomy.place.concept.aat.300312347.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.aat.300343751","id":"taxonomy.place.concept.aat.300343751.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300375660","id":"taxonomy.place.concept.aat.300375660.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300386953","id":"taxonomy.place.concept.aat.300386953.concept.aat.300018773","parent":"concept.aat.300018773","type":"narrower"},{"child":"concept.aat.300389795","id":"taxonomy.place.concept.aat.300389795.concept.aat.300054232","parent":"concept.aat.300054232","type":"narrower"},{"child":"concept.aat.300417578","id":"taxonomy.place.concept.aat.300417578.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417580","id":"taxonomy.place.concept.aat.300417580.concept.aat.300417584","parent":"concept.aat.300417584","type":"narrower"},{"child":"concept.aat.300417581","id":"taxonomy.place.concept.aat.300417581.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417584","id":"taxonomy.place.concept.aat.300417584.concept.aat.300054140","parent":"concept.aat.300054140","type":"narrower"},{"child":"concept.aat.300417616","id":"taxonomy.place.concept.aat.300417616.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300417661","id":"taxonomy.place.concept.aat.300417661.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300417674","id":"taxonomy.place.concept.aat.300417674.concept.aat.300015647","parent":"concept.aat.300015647","type":"narrower"},{"child":"concept.aat.300417961","id":"taxonomy.place.concept.aat.300417961.concept.aat.300054146","parent":"concept.aat.300054146","type":"narrower"},{"child":"concept.aat.300435123","id":"taxonomy.place.concept.aat.300435123.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435128","id":"taxonomy.place.concept.aat.300435128.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435227","id":"taxonomy.place.concept.aat.300435227.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300435243","id":"taxonomy.place.concept.aat.300435243.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.aat.300447138","id":"taxonomy.place.concept.aat.300447138.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"concept.aat.300457792","id":"taxonomy.place.concept.aat.300457792.concept.aat.300054171","parent":"concept.aat.300054171","type":"narrower"},{"child":"concept.go.go0006955","id":"taxonomy.place.concept.go.go0006955.concept.go.go0002376","parent":"concept.go.go0002376","type":"narrower"},{"child":"concept.mesh.d000067495","id":"taxonomy.place.concept.mesh.d000067495.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000073931","id":"taxonomy.place.concept.mesh.d000073931.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000078331","id":"taxonomy.place.concept.mesh.d000078331.field.mesh.d008433","parent":"field.mesh.d008433","type":"narrower"},{"child":"concept.mesh.d000082742","id":"taxonomy.place.concept.mesh.d000082742.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000086825","id":"taxonomy.place.concept.mesh.d000086825.concept.mesh.d004738","parent":"concept.mesh.d004738","type":"narrower"},{"child":"concept.mesh.d000096442","id":"taxonomy.place.concept.mesh.d000096442.concept.mesh.d012306","parent":"concept.mesh.d012306","type":"narrower"},{"child":"concept.mesh.d000098463","id":"taxonomy.place.concept.mesh.d000098463.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"concept.mesh.d004779","id":"taxonomy.place.concept.mesh.d004779.field.mesh.d012942","parent":"field.mesh.d012942","type":"narrower"},{"child":"concept.mesh.d004924","id":"taxonomy.place.concept.mesh.d004924.concept.mesh.d001519","parent":"concept.mesh.d001519","type":"narrower"},{"child":"concept.mesh.d005247","id":"taxonomy.place.concept.mesh.d005247.concept.mesh.d001522","parent":"concept.mesh.d001522","type":"narrower"},{"child":"concept.mesh.d009042","id":"taxonomy.place.concept.mesh.d009042.concept.mesh.d001520","parent":"concept.mesh.d001520","type":"narrower"},{"child":"concept.mesh.d012148","id":"taxonomy.place.concept.mesh.d012148.concept.mesh.d009422","parent":"concept.mesh.d009422","type":"narrower"},{"child":"concept.mesh.d012749","id":"taxonomy.place.concept.mesh.d012749.concept.mesh.d003141","parent":"concept.mesh.d003141","type":"narrower"},{"child":"concept.mesh.d017143","id":"taxonomy.place.concept.mesh.d017143.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"concept.mesh.d035082","id":"taxonomy.place.concept.mesh.d035082.concept.mesh.d006076","parent":"concept.mesh.d006076","type":"narrower"},{"child":"concept.mesh.d057226","id":"taxonomy.place.concept.mesh.d057226.concept.mesh.d003142","parent":"concept.mesh.d003142","type":"narrower"},{"child":"concept.nist.acyclicgraph","id":"taxonomy.place.concept.nist.acyclicgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.adjacent","id":"taxonomy.place.concept.nist.adjacent.concept.nist.binaryrelation","parent":"concept.nist.binaryrelation","type":"narrower"},{"child":"concept.nist.alternation","id":"taxonomy.place.concept.nist.alternation.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.alternatngtr","id":"taxonomy.place.concept.nist.alternatngtr.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.alterntngpth","id":"taxonomy.place.concept.nist.alterntngpth.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.arborescence","id":"taxonomy.place.concept.nist.arborescence.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.biconnectedgraph","id":"taxonomy.place.concept.nist.biconnectedgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.binaryfunc","id":"taxonomy.place.concept.nist.binaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.binaryrelation","id":"taxonomy.place.concept.nist.binaryrelation.concept.nist.relation","parent":"concept.nist.relation","type":"narrower"},{"child":"concept.nist.bipartgraph","id":"taxonomy.place.concept.nist.bipartgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.bipartmatch","id":"taxonomy.place.concept.nist.bipartmatch.concept.nist.perfectmatch","parent":"concept.nist.perfectmatch","type":"narrower"},{"child":"concept.nist.booleanfnctn","id":"taxonomy.place.concept.nist.booleanfnctn.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.bpp","id":"taxonomy.place.concept.nist.bpp.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.bucket","id":"taxonomy.place.concept.nist.bucket.concept.nist.bag","parent":"concept.nist.bag","type":"narrower"},{"child":"concept.nist.canonical","id":"taxonomy.place.concept.nist.canonical.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.cellprobemodel","id":"taxonomy.place.concept.nist.cellprobemodel.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.cellulartmtn","id":"taxonomy.place.concept.nist.cellulartmtn.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.clique","id":"taxonomy.place.concept.nist.clique.concept.nist.completegraph","parent":"concept.nist.completegraph","type":"narrower"},{"child":"concept.nist.compactdatastruct","id":"taxonomy.place.concept.nist.compactdatastruct.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.completegraph","id":"taxonomy.place.concept.nist.completegraph.concept.nist.undirectedgraph","parent":"concept.nist.undirectedgraph","type":"narrower"},{"child":"concept.nist.concurrentdatastructure","id":"taxonomy.place.concept.nist.concurrentdatastructure.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.confluentlypersistdata","id":"taxonomy.place.concept.nist.confluentlypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.connectedgraph","id":"taxonomy.place.concept.nist.connectedgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.constantfunc","id":"taxonomy.place.concept.nist.constantfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.cutvertex","id":"taxonomy.place.concept.nist.cutvertex.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.cycle","id":"taxonomy.place.concept.nist.cycle.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.densegraph","id":"taxonomy.place.concept.nist.densegraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.determfinitstatemach","id":"taxonomy.place.concept.nist.determfinitstatemach.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.dichotomicsearch","id":"taxonomy.place.concept.nist.dichotomicsearch.method.nist.search","parent":"method.nist.search","type":"narrower"},{"child":"concept.nist.directacycgraph","id":"taxonomy.place.concept.nist.directacycgraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.dual","id":"taxonomy.place.concept.nist.dual.concept.nist.planargraph","parent":"concept.nist.planargraph","type":"narrower"},{"child":"concept.nist.eightqueens","id":"taxonomy.place.concept.nist.eightqueens.concept.nist.nqueens","parent":"concept.nist.nqueens","type":"narrower"},{"child":"concept.nist.euclidsteinertree","id":"taxonomy.place.concept.nist.euclidsteinertree.concept.nist.steinertree","parent":"concept.nist.steinertree","type":"narrower"},{"child":"concept.nist.eulercycle","id":"taxonomy.place.concept.nist.eulercycle.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.finitestatemachine","id":"taxonomy.place.concept.nist.finitestatemachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.finitestatetransducer","id":"taxonomy.place.concept.nist.finitestatetransducer.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.freevertex","id":"taxonomy.place.concept.nist.freevertex.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.fullypersistdata","id":"taxonomy.place.concept.nist.fullypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.function","id":"taxonomy.place.concept.nist.function.concept.nist.relation","parent":"concept.nist.relation","type":"narrower"},{"child":"concept.nist.haltingproblem","id":"taxonomy.place.concept.nist.haltingproblem.concept.nist.undecidableproblem","parent":"concept.nist.undecidableproblem","type":"narrower"},{"child":"concept.nist.hamiltoniancycle","id":"taxonomy.place.concept.nist.hamiltoniancycle.concept.nist.cycle","parent":"concept.nist.cycle","type":"narrower"},{"child":"concept.nist.hamiltonianpath","id":"taxonomy.place.concept.nist.hamiltonianpath.concept.nist.simplepath","parent":"concept.nist.simplepath","type":"narrower"},{"child":"concept.nist.kripkestruct","id":"taxonomy.place.concept.nist.kripkestruct.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.kwaymerge","id":"taxonomy.place.concept.nist.kwaymerge.concept.nist.multiwaymerge","parent":"concept.nist.multiwaymerge","type":"narrower"},{"child":"concept.nist.labeledgraph","id":"taxonomy.place.concept.nist.labeledgraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.levenshtein","id":"taxonomy.place.concept.nist.levenshtein.method.nist.stringmatchwerror","parent":"method.nist.stringmatchwerror","type":"narrower"},{"child":"concept.nist.littleonotation","id":"taxonomy.place.concept.nist.littleonotation.concept.nist.bigonotation","parent":"concept.nist.bigonotation","type":"narrower"},{"child":"concept.nist.logarithmic","id":"taxonomy.place.concept.nist.logarithmic.concept.nist.sublineartimealgo","parent":"concept.nist.sublineartimealgo","type":"narrower"},{"child":"concept.nist.matchedvertx","id":"taxonomy.place.concept.nist.matchedvertx.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.maxheapprop","id":"taxonomy.place.concept.nist.maxheapprop.concept.nist.heapproperty","parent":"concept.nist.heapproperty","type":"narrower"},{"child":"concept.nist.mealymachine","id":"taxonomy.place.concept.nist.mealymachine.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.minheapprop","id":"taxonomy.place.concept.nist.minheapprop.concept.nist.heapproperty","parent":"concept.nist.heapproperty","type":"narrower"},{"child":"concept.nist.minimumspanningtree","id":"taxonomy.place.concept.nist.minimumspanningtree.concept.nist.spanningtree","parent":"concept.nist.spanningtree","type":"narrower"},{"child":"concept.nist.mooremachine","id":"taxonomy.place.concept.nist.mooremachine.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.naryfunc","id":"taxonomy.place.concept.nist.naryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.nondetermfinitestatemach","id":"taxonomy.place.concept.nist.nondetermfinitestatemach.concept.nist.finitestatemachine","parent":"concept.nist.finitestatemachine","type":"narrower"},{"child":"concept.nist.nondetermturingmach","id":"taxonomy.place.concept.nist.nondetermturingmach.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.np","id":"taxonomy.place.concept.nist.np.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.npcomplete","id":"taxonomy.place.concept.nist.npcomplete.concept.nist.np","parent":"concept.nist.np","type":"narrower"},{"child":"concept.nist.nphard","id":"taxonomy.place.concept.nist.nphard.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.oracletur","id":"taxonomy.place.concept.nist.oracletur.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.p","id":"taxonomy.place.concept.nist.p.concept.nist.complexityclass","parent":"concept.nist.complexityclass","type":"narrower"},{"child":"concept.nist.partiallypersistdata","id":"taxonomy.place.concept.nist.partiallypersistdata.concept.nist.persistentdatastructure","parent":"concept.nist.persistentdatastructure","type":"narrower"},{"child":"concept.nist.perfectbinarytree","id":"taxonomy.place.concept.nist.perfectbinarytree.concept.nist.fullbinarytree","parent":"concept.nist.fullbinarytree","type":"narrower"},{"child":"concept.nist.persistentdatastructure","id":"taxonomy.place.concept.nist.persistentdatastructure.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.phoneticcoding","id":"taxonomy.place.concept.nist.phoneticcoding.method.nist.stringmatchwerror","parent":"method.nist.stringmatchwerror","type":"narrower"},{"child":"concept.nist.planargraph","id":"taxonomy.place.concept.nist.planargraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.planarstrght","id":"taxonomy.place.concept.nist.planarstrght.concept.nist.planargraph","parent":"concept.nist.planargraph","type":"narrower"},{"child":"concept.nist.pointermachn","id":"taxonomy.place.concept.nist.pointermachn.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.poset","id":"taxonomy.place.concept.nist.poset.concept.nist.set","parent":"concept.nist.set","type":"narrower"},{"child":"concept.nist.postscorrespondprob","id":"taxonomy.place.concept.nist.postscorrespondprob.concept.nist.undecidableproblem","parent":"concept.nist.undecidableproblem","type":"narrower"},{"child":"concept.nist.primitiverecursive","id":"taxonomy.place.concept.nist.primitiverecursive.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.probablturng","id":"taxonomy.place.concept.nist.probablturng.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.propersubset","id":"taxonomy.place.concept.nist.propersubset.concept.nist.subset","parent":"concept.nist.subset","type":"narrower"},{"child":"concept.nist.quantumcomputation","id":"taxonomy.place.concept.nist.quantumcomputation.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.randomaccess","id":"taxonomy.place.concept.nist.randomaccess.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.rectilinearsteinertree","id":"taxonomy.place.concept.nist.rectilinearsteinertree.concept.nist.steinertree","parent":"concept.nist.steinertree","type":"narrower"},{"child":"concept.nist.recursivstrc","id":"taxonomy.place.concept.nist.recursivstrc.concept.nist.datastructure","parent":"concept.nist.datastructure","type":"narrower"},{"child":"concept.nist.restricted","id":"taxonomy.place.concept.nist.restricted.method.nist.distributionsort","parent":"method.nist.distributionsort","type":"narrower"},{"child":"concept.nist.simplepath","id":"taxonomy.place.concept.nist.simplepath.concept.nist.path","parent":"concept.nist.path","type":"narrower"},{"child":"concept.nist.simplex","id":"taxonomy.place.concept.nist.simplex.concept.nist.polytope","parent":"concept.nist.polytope","type":"narrower"},{"child":"concept.nist.sparsegraph","id":"taxonomy.place.concept.nist.sparsegraph.concept.nist.graph","parent":"concept.nist.graph","type":"narrower"},{"child":"concept.nist.statemachine","id":"taxonomy.place.concept.nist.statemachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.steinervertx","id":"taxonomy.place.concept.nist.steinervertx.concept.nist.vertex","parent":"concept.nist.vertex","type":"narrower"},{"child":"concept.nist.stringmatching","id":"taxonomy.place.concept.nist.stringmatching.method.nist.search","parent":"method.nist.search","type":"narrower"},{"child":"concept.nist.strippacking","id":"taxonomy.place.concept.nist.strippacking.concept.nist.optimization","parent":"concept.nist.optimization","type":"narrower"},{"child":"concept.nist.stronglyconnectedcompo","id":"taxonomy.place.concept.nist.stronglyconnectedcompo.concept.nist.maximallyconnectedcomponent","parent":"concept.nist.maximallyconnectedcomponent","type":"narrower"},{"child":"concept.nist.stronglyconnectedgraph","id":"taxonomy.place.concept.nist.stronglyconnectedgraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.stronglynp","id":"taxonomy.place.concept.nist.stronglynp.concept.nist.nphard","parent":"concept.nist.nphard","type":"narrower"},{"child":"concept.nist.sublineartimealgo","id":"taxonomy.place.concept.nist.sublineartimealgo.concept.nist.polynomialtm","parent":"concept.nist.polynomialtm","type":"narrower"},{"child":"concept.nist.topologicalsort","id":"taxonomy.place.concept.nist.topologicalsort.method.nist.sort","parent":"method.nist.sort","type":"narrower"},{"child":"concept.nist.totalfunc","id":"taxonomy.place.concept.nist.totalfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.travelingsalesman","id":"taxonomy.place.concept.nist.travelingsalesman.concept.nist.hamiltoniancycle","parent":"concept.nist.hamiltoniancycle","type":"narrower"},{"child":"concept.nist.trinaryfunc","id":"taxonomy.place.concept.nist.trinaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.turingmachine","id":"taxonomy.place.concept.nist.turingmachine.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.unaryfunc","id":"taxonomy.place.concept.nist.unaryfunc.concept.nist.function","parent":"concept.nist.function","type":"narrower"},{"child":"concept.nist.universaltur","id":"taxonomy.place.concept.nist.universaltur.concept.nist.modelofcomputation","parent":"concept.nist.modelofcomputation","type":"narrower"},{"child":"concept.nist.vehiclerouting","id":"taxonomy.place.concept.nist.vehiclerouting.concept.nist.optimization","parent":"concept.nist.optimization","type":"narrower"},{"child":"concept.nist.weighteddigraph","id":"taxonomy.place.concept.nist.weighteddigraph.concept.nist.directedgraph","parent":"concept.nist.directedgraph","type":"narrower"},{"child":"concept.nist.weightedgraph","id":"taxonomy.place.concept.nist.weightedgraph.concept.nist.labeledgraph","parent":"concept.nist.labeledgraph","type":"narrower"},{"child":"field.aat.300054245","id":"taxonomy.place.field.aat.300054245.concept.aat.300137365","parent":"concept.aat.300137365","type":"narrower"},{"child":"field.aat.300054273","id":"taxonomy.place.field.aat.300054273.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300054275","id":"taxonomy.place.field.aat.300054275.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300054280","id":"taxonomy.place.field.aat.300054280.concept.aat.300124083","parent":"concept.aat.300124083","type":"narrower"},{"child":"field.aat.300054283","id":"taxonomy.place.field.aat.300054283.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300054296","id":"taxonomy.place.field.aat.300054296.concept.aat.300054306","parent":"concept.aat.300054306","type":"narrower"},{"child":"field.aat.300054297","id":"taxonomy.place.field.aat.300054297.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300055944","id":"taxonomy.place.field.aat.300055944.concept.aat.300055939","parent":"concept.aat.300055939","type":"narrower"},{"child":"field.aat.300255715","id":"taxonomy.place.field.aat.300255715.concept.aat.300417581","parent":"concept.aat.300417581","type":"narrower"},{"child":"field.aat.300265672","id":"taxonomy.place.field.aat.300265672.concept.aat.300054156","parent":"concept.aat.300054156","type":"narrower"},{"child":"field.aat.300265767","id":"taxonomy.place.field.aat.300265767.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"field.aat.300412155","id":"taxonomy.place.field.aat.300412155.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.aat.300417579","id":"taxonomy.place.field.aat.300417579.concept.aat.300417584","parent":"concept.aat.300417584","type":"narrower"},{"child":"field.aat.300435151","id":"taxonomy.place.field.aat.300435151.concept.aat.300389795","parent":"concept.aat.300389795","type":"narrower"},{"child":"field.aat.300444364","id":"taxonomy.place.field.aat.300444364.concept.mesh.d006809","parent":"concept.mesh.d006809","type":"narrower"},{"child":"field.mesh.d032781","id":"taxonomy.place.field.mesh.d032781.field.mesh.d004989","parent":"field.mesh.d004989","type":"narrower"},{"child":"method.nist.britishmuseum","id":"taxonomy.place.method.nist.britishmuseum.method.nist.exhaustivesearch","parent":"method.nist.exhaustivesearch","type":"narrower"},{"child":"method.nist.collectiverecursion","id":"taxonomy.place.method.nist.collectiverecursion.method.nist.recursion","parent":"method.nist.recursion","type":"narrower"},{"child":"method.nist.easysplithardmerge","id":"taxonomy.place.method.nist.easysplithardmerge.method.nist.divideandconquer","parent":"method.nist.divideandconquer","type":"narrower"},{"child":"method.nist.exhaustivesearch","id":"taxonomy.place.method.nist.exhaustivesearch.method.nist.bruteforce","parent":"method.nist.bruteforce","type":"narrower"},{"child":"method.nist.hardspliteasymerge","id":"taxonomy.place.method.nist.hardspliteasymerge.method.nist.divideandconquer","parent":"method.nist.divideandconquer","type":"narrower"},{"child":"method.nist.lasvegas","id":"taxonomy.place.method.nist.lasvegas.concept.nist.randomizedalgo","parent":"concept.nist.randomizedalgo","type":"narrower"},{"child":"method.nist.montecarlo","id":"taxonomy.place.method.nist.montecarlo.method.nist.heuristic","parent":"method.nist.heuristic","type":"narrower"},{"child":"method.nist.rhoapproxmtn","id":"taxonomy.place.method.nist.rhoapproxmtn.method.nist.approximatin","parent":"method.nist.approximatin","type":"narrower"},{"child":"method.nist.tailrecursion","id":"taxonomy.place.method.nist.tailrecursion.method.nist.recursion","parent":"method.nist.recursion","type":"narrower"},{"child":"ology.andrology","id":"taxonomy.place.ology.andrology.field.mesh.d018456","parent":"field.mesh.d018456","type":"narrower"},{"child":"ology.cardiology","id":"taxonomy.place.ology.cardiology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.dermatology","id":"taxonomy.place.ology.dermatology.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"ology.gastroenterology","id":"taxonomy.place.ology.gastroenterology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.gynecology","id":"taxonomy.place.ology.gynecology.field.mesh.d018456","parent":"field.mesh.d018456","type":"narrower"},{"child":"ology.hematology","id":"taxonomy.place.ology.hematology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.neonatology","id":"taxonomy.place.ology.neonatology.field.mesh.d010372","parent":"field.mesh.d010372","type":"narrower"},{"child":"ology.nephrology","id":"taxonomy.place.ology.nephrology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.ophthalmology","id":"taxonomy.place.ology.ophthalmology.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"ology.photobiology","id":"taxonomy.place.ology.photobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.radiobiology","id":"taxonomy.place.ology.radiobiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.radiology","id":"taxonomy.place.ology.radiology.field.mesh.d008511","parent":"field.mesh.d008511","type":"narrower"},{"child":"ology.rheumatology","id":"taxonomy.place.ology.rheumatology.field.mesh.d007388","parent":"field.mesh.d007388","type":"narrower"},{"child":"ology.thanatology","id":"taxonomy.place.ology.thanatology.field.philosophy","parent":"field.philosophy","type":"narrower"},{"child":"ology.traumatology","id":"taxonomy.place.ology.traumatology.field.mesh.d000096725","parent":"field.mesh.d000096725","type":"narrower"},{"child":"ology.urology","id":"taxonomy.place.ology.urology.field.mesh.d013043","parent":"field.mesh.d013043","type":"narrower"},{"child":"concept.usgs.1005","id":"taxonomy.usgs.concept.usgs.1005.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1010","id":"taxonomy.usgs.concept.usgs.1010.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1028","id":"taxonomy.usgs.concept.usgs.1028.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.1034","id":"taxonomy.usgs.concept.usgs.1034.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1035","id":"taxonomy.usgs.concept.usgs.1035.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1036","id":"taxonomy.usgs.concept.usgs.1036.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1072","id":"taxonomy.usgs.concept.usgs.1072.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1078","id":"taxonomy.usgs.concept.usgs.1078.ology.geochemistry","parent":"ology.geochemistry","type":"narrower"},{"child":"concept.usgs.108","id":"taxonomy.usgs.concept.usgs.108.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1080","id":"taxonomy.usgs.concept.usgs.1080.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.1102","id":"taxonomy.usgs.concept.usgs.1102.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1103","id":"taxonomy.usgs.concept.usgs.1103.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1118","id":"taxonomy.usgs.concept.usgs.1118.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.1123","id":"taxonomy.usgs.concept.usgs.1123.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1127","id":"taxonomy.usgs.concept.usgs.1127.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.1129","id":"taxonomy.usgs.concept.usgs.1129.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1145","id":"taxonomy.usgs.concept.usgs.1145.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1199","id":"taxonomy.usgs.concept.usgs.1199.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1286","id":"taxonomy.usgs.concept.usgs.1286.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1298","id":"taxonomy.usgs.concept.usgs.1298.ology.geochemistry","parent":"ology.geochemistry","type":"narrower"},{"child":"concept.usgs.1301","id":"taxonomy.usgs.concept.usgs.1301.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1302","id":"taxonomy.usgs.concept.usgs.1302.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1308","id":"taxonomy.usgs.concept.usgs.1308.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.1312","id":"taxonomy.usgs.concept.usgs.1312.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1346","id":"taxonomy.usgs.concept.usgs.1346.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1347","id":"taxonomy.usgs.concept.usgs.1347.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1355","id":"taxonomy.usgs.concept.usgs.1355.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1356","id":"taxonomy.usgs.concept.usgs.1356.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1367","id":"taxonomy.usgs.concept.usgs.1367.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.1368","id":"taxonomy.usgs.concept.usgs.1368.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1369","id":"taxonomy.usgs.concept.usgs.1369.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1370","id":"taxonomy.usgs.concept.usgs.1370.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.1622","id":"taxonomy.usgs.concept.usgs.1622.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1626","id":"taxonomy.usgs.concept.usgs.1626.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1627","id":"taxonomy.usgs.concept.usgs.1627.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1628","id":"taxonomy.usgs.concept.usgs.1628.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1630","id":"taxonomy.usgs.concept.usgs.1630.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1635","id":"taxonomy.usgs.concept.usgs.1635.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1638","id":"taxonomy.usgs.concept.usgs.1638.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1640","id":"taxonomy.usgs.concept.usgs.1640.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1642","id":"taxonomy.usgs.concept.usgs.1642.concept.usgs.1649","parent":"concept.usgs.1649","type":"narrower"},{"child":"concept.usgs.1649","id":"taxonomy.usgs.concept.usgs.1649.concept.usgs.1652","parent":"concept.usgs.1652","type":"narrower"},{"child":"concept.usgs.1652","id":"taxonomy.usgs.concept.usgs.1652.concept.usgs.1634","parent":"concept.usgs.1634","type":"narrower"},{"child":"concept.usgs.1655","id":"taxonomy.usgs.concept.usgs.1655.concept.usgs.1634","parent":"concept.usgs.1634","type":"narrower"},{"child":"concept.usgs.1656","id":"taxonomy.usgs.concept.usgs.1656.concept.usgs.1655","parent":"concept.usgs.1655","type":"narrower"},{"child":"concept.usgs.1657","id":"taxonomy.usgs.concept.usgs.1657.concept.usgs.1627","parent":"concept.usgs.1627","type":"narrower"},{"child":"concept.usgs.1662","id":"taxonomy.usgs.concept.usgs.1662.concept.usgs.1627","parent":"concept.usgs.1627","type":"narrower"},{"child":"concept.usgs.1664","id":"taxonomy.usgs.concept.usgs.1664.concept.usgs.1640","parent":"concept.usgs.1640","type":"narrower"},{"child":"concept.usgs.1673","id":"taxonomy.usgs.concept.usgs.1673.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.1674","id":"taxonomy.usgs.concept.usgs.1674.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.1675","id":"taxonomy.usgs.concept.usgs.1675.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.168","id":"taxonomy.usgs.concept.usgs.168.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1682","id":"taxonomy.usgs.concept.usgs.1682.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.1683","id":"taxonomy.usgs.concept.usgs.1683.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1690","id":"taxonomy.usgs.concept.usgs.1690.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1699","id":"taxonomy.usgs.concept.usgs.1699.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1701","id":"taxonomy.usgs.concept.usgs.1701.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1702","id":"taxonomy.usgs.concept.usgs.1702.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1703","id":"taxonomy.usgs.concept.usgs.1703.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1704","id":"taxonomy.usgs.concept.usgs.1704.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.1708","id":"taxonomy.usgs.concept.usgs.1708.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1710","id":"taxonomy.usgs.concept.usgs.1710.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1711","id":"taxonomy.usgs.concept.usgs.1711.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1712","id":"taxonomy.usgs.concept.usgs.1712.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1714","id":"taxonomy.usgs.concept.usgs.1714.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1715","id":"taxonomy.usgs.concept.usgs.1715.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1718","id":"taxonomy.usgs.concept.usgs.1718.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1721","id":"taxonomy.usgs.concept.usgs.1721.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1722","id":"taxonomy.usgs.concept.usgs.1722.concept.usgs.1072","parent":"concept.usgs.1072","type":"narrower"},{"child":"concept.usgs.1731","id":"taxonomy.usgs.concept.usgs.1731.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.1736","id":"taxonomy.usgs.concept.usgs.1736.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1741","id":"taxonomy.usgs.concept.usgs.1741.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.1751","id":"taxonomy.usgs.concept.usgs.1751.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.1799","id":"taxonomy.usgs.concept.usgs.1799.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1800","id":"taxonomy.usgs.concept.usgs.1800.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.1801","id":"taxonomy.usgs.concept.usgs.1801.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.1802","id":"taxonomy.usgs.concept.usgs.1802.concept.usgs.1800","parent":"concept.usgs.1800","type":"narrower"},{"child":"concept.usgs.1803","id":"taxonomy.usgs.concept.usgs.1803.concept.usgs.1800","parent":"concept.usgs.1800","type":"narrower"},{"child":"concept.usgs.1804","id":"taxonomy.usgs.concept.usgs.1804.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.196","id":"taxonomy.usgs.concept.usgs.196.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.1999","id":"taxonomy.usgs.concept.usgs.1999.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2000","id":"taxonomy.usgs.concept.usgs.2000.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2027","id":"taxonomy.usgs.concept.usgs.2027.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2028","id":"taxonomy.usgs.concept.usgs.2028.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2031","id":"taxonomy.usgs.concept.usgs.2031.field.usgs.626","parent":"field.usgs.626","type":"narrower"},{"child":"concept.usgs.2043","id":"taxonomy.usgs.concept.usgs.2043.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.2058","id":"taxonomy.usgs.concept.usgs.2058.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.2068","id":"taxonomy.usgs.concept.usgs.2068.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2069","id":"taxonomy.usgs.concept.usgs.2069.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2070","id":"taxonomy.usgs.concept.usgs.2070.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2071","id":"taxonomy.usgs.concept.usgs.2071.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2072","id":"taxonomy.usgs.concept.usgs.2072.concept.usgs.1799","parent":"concept.usgs.1799","type":"narrower"},{"child":"concept.usgs.2080","id":"taxonomy.usgs.concept.usgs.2080.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2089","id":"taxonomy.usgs.concept.usgs.2089.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.2091","id":"taxonomy.usgs.concept.usgs.2091.field.usgs.2090","parent":"field.usgs.2090","type":"narrower"},{"child":"concept.usgs.211","id":"taxonomy.usgs.concept.usgs.211.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.219","id":"taxonomy.usgs.concept.usgs.219.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.2264","id":"taxonomy.usgs.concept.usgs.2264.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.2276","id":"taxonomy.usgs.concept.usgs.2276.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2277","id":"taxonomy.usgs.concept.usgs.2277.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.2279","id":"taxonomy.usgs.concept.usgs.2279.concept.usgs.435","parent":"concept.usgs.435","type":"narrower"},{"child":"concept.usgs.2281","id":"taxonomy.usgs.concept.usgs.2281.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.2282","id":"taxonomy.usgs.concept.usgs.2282.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.2290","id":"taxonomy.usgs.concept.usgs.2290.concept.usgs.1367","parent":"concept.usgs.1367","type":"narrower"},{"child":"concept.usgs.2291","id":"taxonomy.usgs.concept.usgs.2291.concept.usgs.501","parent":"concept.usgs.501","type":"narrower"},{"child":"concept.usgs.2295","id":"taxonomy.usgs.concept.usgs.2295.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.2305","id":"taxonomy.usgs.concept.usgs.2305.concept.usgs.384","parent":"concept.usgs.384","type":"narrower"},{"child":"concept.usgs.248","id":"taxonomy.usgs.concept.usgs.248.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.268","id":"taxonomy.usgs.concept.usgs.268.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.27","id":"taxonomy.usgs.concept.usgs.27.concept.usgs.67","parent":"concept.usgs.67","type":"narrower"},{"child":"concept.usgs.284","id":"taxonomy.usgs.concept.usgs.284.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.292","id":"taxonomy.usgs.concept.usgs.292.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.30","id":"taxonomy.usgs.concept.usgs.30.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.304","id":"taxonomy.usgs.concept.usgs.304.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.308","id":"taxonomy.usgs.concept.usgs.308.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.310","id":"taxonomy.usgs.concept.usgs.310.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.315","id":"taxonomy.usgs.concept.usgs.315.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.353","id":"taxonomy.usgs.concept.usgs.353.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.359","id":"taxonomy.usgs.concept.usgs.359.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.365","id":"taxonomy.usgs.concept.usgs.365.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.384","id":"taxonomy.usgs.concept.usgs.384.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.391","id":"taxonomy.usgs.concept.usgs.391.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.404","id":"taxonomy.usgs.concept.usgs.404.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.411","id":"taxonomy.usgs.concept.usgs.411.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.414","id":"taxonomy.usgs.concept.usgs.414.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.435","id":"taxonomy.usgs.concept.usgs.435.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.440","id":"taxonomy.usgs.concept.usgs.440.field.usgs.470","parent":"field.usgs.470","type":"narrower"},{"child":"concept.usgs.451","id":"taxonomy.usgs.concept.usgs.451.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.452","id":"taxonomy.usgs.concept.usgs.452.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.459","id":"taxonomy.usgs.concept.usgs.459.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.482","id":"taxonomy.usgs.concept.usgs.482.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.501","id":"taxonomy.usgs.concept.usgs.501.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.522","id":"taxonomy.usgs.concept.usgs.522.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.534","id":"taxonomy.usgs.concept.usgs.534.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.562","id":"taxonomy.usgs.concept.usgs.562.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.572","id":"taxonomy.usgs.concept.usgs.572.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.608","id":"taxonomy.usgs.concept.usgs.608.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.624","id":"taxonomy.usgs.concept.usgs.624.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.63","id":"taxonomy.usgs.concept.usgs.63.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.64","id":"taxonomy.usgs.concept.usgs.64.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.65","id":"taxonomy.usgs.concept.usgs.65.concept.usgs.67","parent":"concept.usgs.67","type":"narrower"},{"child":"concept.usgs.66","id":"taxonomy.usgs.concept.usgs.66.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.660","id":"taxonomy.usgs.concept.usgs.660.concept.usgs.459","parent":"concept.usgs.459","type":"narrower"},{"child":"concept.usgs.67","id":"taxonomy.usgs.concept.usgs.67.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.677","id":"taxonomy.usgs.concept.usgs.677.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"concept.usgs.690","id":"taxonomy.usgs.concept.usgs.690.concept.usgs.292","parent":"concept.usgs.292","type":"narrower"},{"child":"concept.usgs.703","id":"taxonomy.usgs.concept.usgs.703.concept.usgs.1298","parent":"concept.usgs.1298","type":"narrower"},{"child":"concept.usgs.725","id":"taxonomy.usgs.concept.usgs.725.concept.usgs.1005","parent":"concept.usgs.1005","type":"narrower"},{"child":"concept.usgs.727","id":"taxonomy.usgs.concept.usgs.727.concept.usgs.451","parent":"concept.usgs.451","type":"narrower"},{"child":"concept.usgs.743","id":"taxonomy.usgs.concept.usgs.743.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.745","id":"taxonomy.usgs.concept.usgs.745.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.799","id":"taxonomy.usgs.concept.usgs.799.concept.usgs.777","parent":"concept.usgs.777","type":"narrower"},{"child":"concept.usgs.80","id":"taxonomy.usgs.concept.usgs.80.field.usgs.1176","parent":"field.usgs.1176","type":"narrower"},{"child":"concept.usgs.806","id":"taxonomy.usgs.concept.usgs.806.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.816","id":"taxonomy.usgs.concept.usgs.816.concept.usgs.101","parent":"concept.usgs.101","type":"narrower"},{"child":"concept.usgs.817","id":"taxonomy.usgs.concept.usgs.817.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.819","id":"taxonomy.usgs.concept.usgs.819.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"concept.usgs.823","id":"taxonomy.usgs.concept.usgs.823.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.84","id":"taxonomy.usgs.concept.usgs.84.concept.usgs.1103","parent":"concept.usgs.1103","type":"narrower"},{"child":"concept.usgs.854","id":"taxonomy.usgs.concept.usgs.854.concept.usgs.1304","parent":"concept.usgs.1304","type":"narrower"},{"child":"concept.usgs.858","id":"taxonomy.usgs.concept.usgs.858.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"concept.usgs.88","id":"taxonomy.usgs.concept.usgs.88.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.915","id":"taxonomy.usgs.concept.usgs.915.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"concept.usgs.927","id":"taxonomy.usgs.concept.usgs.927.concept.usgs.63","parent":"concept.usgs.63","type":"narrower"},{"child":"concept.usgs.93","id":"taxonomy.usgs.concept.usgs.93.concept.usgs.310","parent":"concept.usgs.310","type":"narrower"},{"child":"field.cartography","id":"taxonomy.usgs.field.cartography.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.climatology","id":"taxonomy.usgs.field.climatology.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.ecology","id":"taxonomy.usgs.field.ecology.family.life","parent":"family:life","type":"narrower"},{"child":"field.genetics","id":"taxonomy.usgs.field.genetics.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.geology","id":"taxonomy.usgs.field.geology.family.earth","parent":"family:earth","type":"narrower"},{"child":"field.microbiology","id":"taxonomy.usgs.field.microbiology.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.molecular-biology","id":"taxonomy.usgs.field.molecular-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"field.usgs.1025","id":"taxonomy.usgs.field.usgs.1025.field.usgs.810","parent":"field.usgs.810","type":"narrower"},{"child":"field.usgs.1081","id":"taxonomy.usgs.field.usgs.1081.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.1117","id":"taxonomy.usgs.field.usgs.1117.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.115","id":"taxonomy.usgs.field.usgs.115.ology.stratigraphy","parent":"ology.stratigraphy","type":"narrower"},{"child":"field.usgs.1176","id":"taxonomy.usgs.field.usgs.1176.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.1267","id":"taxonomy.usgs.field.usgs.1267.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.1678","id":"taxonomy.usgs.field.usgs.1678.ology.hydrology","parent":"ology.hydrology","type":"narrower"},{"child":"field.usgs.1679","id":"taxonomy.usgs.field.usgs.1679.field.usgs.447","parent":"field.usgs.447","type":"narrower"},{"child":"field.usgs.2090","id":"taxonomy.usgs.field.usgs.2090.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.288","id":"taxonomy.usgs.field.usgs.288.field.usgs.455","parent":"field.usgs.455","type":"narrower"},{"child":"field.usgs.312","id":"taxonomy.usgs.field.usgs.312.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.447","id":"taxonomy.usgs.field.usgs.447.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.455","id":"taxonomy.usgs.field.usgs.455.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.470","id":"taxonomy.usgs.field.usgs.470.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.604","id":"taxonomy.usgs.field.usgs.604.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.626","id":"taxonomy.usgs.field.usgs.626.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.668","id":"taxonomy.usgs.field.usgs.668.ology.stratigraphy","parent":"ology.stratigraphy","type":"narrower"},{"child":"field.usgs.68","id":"taxonomy.usgs.field.usgs.68.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.706","id":"taxonomy.usgs.field.usgs.706.field.geology","parent":"field.geology","type":"narrower"},{"child":"field.usgs.707","id":"taxonomy.usgs.field.usgs.707.field.usgs.470","parent":"field.usgs.470","type":"narrower"},{"child":"field.usgs.738","id":"taxonomy.usgs.field.usgs.738.ology.paleontology","parent":"ology.paleontology","type":"narrower"},{"child":"field.usgs.810","id":"taxonomy.usgs.field.usgs.810.field.usgs.287","parent":"field.usgs.287","type":"narrower"},{"child":"field.usgs.818","id":"taxonomy.usgs.field.usgs.818.field.usgs.291","parent":"field.usgs.291","type":"narrower"},{"child":"field.usgs.859","id":"taxonomy.usgs.field.usgs.859.field.usgs.818","parent":"field.usgs.818","type":"narrower"},{"child":"field.usgs.862","id":"taxonomy.usgs.field.usgs.862.ology.seismology","parent":"ology.seismology","type":"narrower"},{"child":"ology.bacteriology","id":"taxonomy.usgs.ology.bacteriology.field.microbiology","parent":"field.microbiology","type":"narrower"},{"child":"ology.cell-biology","id":"taxonomy.usgs.ology.cell-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.developmental-biology","id":"taxonomy.usgs.ology.developmental-biology.family.life","parent":"family:life","type":"narrower"},{"child":"ology.entomology","id":"taxonomy.usgs.ology.entomology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.ethology","id":"taxonomy.usgs.ology.ethology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.geochemistry","id":"taxonomy.usgs.ology.geochemistry.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.geochronology","id":"taxonomy.usgs.ology.geochronology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.geomorphology","id":"taxonomy.usgs.ology.geomorphology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.glaciology","id":"taxonomy.usgs.ology.glaciology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.herpetology","id":"taxonomy.usgs.ology.herpetology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.histology","id":"taxonomy.usgs.ology.histology.family.life","parent":"family:life","type":"narrower"},{"child":"ology.hydrogeology","id":"taxonomy.usgs.ology.hydrogeology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.hydrology","id":"taxonomy.usgs.ology.hydrology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.ichthyology","id":"taxonomy.usgs.ology.ichthyology.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.immunology","id":"taxonomy.usgs.ology.immunology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.limnology","id":"taxonomy.usgs.ology.limnology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.mammalogy","id":"taxonomy.usgs.ology.mammalogy.ology.zoology","parent":"ology.zoology","type":"narrower"},{"child":"ology.marine-biology","id":"taxonomy.usgs.ology.marine-biology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.meteorology","id":"taxonomy.usgs.ology.meteorology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.mineralogy","id":"taxonomy.usgs.ology.mineralogy.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.mycology","id":"taxonomy.usgs.ology.mycology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.ornithology","id":"taxonomy.usgs.ology.ornithology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.paleontology","id":"taxonomy.usgs.ology.paleontology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.parasitology","id":"taxonomy.usgs.ology.parasitology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.petrology","id":"taxonomy.usgs.ology.petrology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.phycology","id":"taxonomy.usgs.ology.phycology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.sedimentology","id":"taxonomy.usgs.ology.sedimentology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.seismology","id":"taxonomy.usgs.ology.seismology.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.stratigraphy","id":"taxonomy.usgs.ology.stratigraphy.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.tectonophysics","id":"taxonomy.usgs.ology.tectonophysics.family.earth","parent":"family:earth","type":"narrower"},{"child":"ology.virology","id":"taxonomy.usgs.ology.virology.field.biology","parent":"field.biology","type":"narrower"},{"child":"ology.volcanology","id":"taxonomy.usgs.ology.volcanology.field.geology","parent":"field.geology","type":"narrower"},{"child":"ology.zoology","id":"taxonomy.usgs.ology.zoology.field.biology","parent":"field.biology","type":"narrower"},{"child":"concept.wikipedia.a-b-testing","id":"taxonomy.wikipedia.concept.wikipedia.a-b-testing.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.a-frame","id":"taxonomy.wikipedia.concept.wikipedia.a-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.a-homotopy-theory","id":"taxonomy.wikipedia.concept.wikipedia.a-homotopy-theory.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.abel-s-summation-formula","id":"taxonomy.wikipedia.concept.wikipedia.abel-s-summation-formula.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.abelian-category","id":"taxonomy.wikipedia.concept.wikipedia.abelian-category.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.abenics","id":"taxonomy.wikipedia.concept.wikipedia.abenics.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.abnormal-grain-growth","id":"taxonomy.wikipedia.concept.wikipedia.abnormal-grain-growth.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.abrams-law","id":"taxonomy.wikipedia.concept.wikipedia.abrams-law.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.abrasive-machining","id":"taxonomy.wikipedia.concept.wikipedia.abrasive-machining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.absolute-continuity","id":"taxonomy.wikipedia.concept.wikipedia.absolute-continuity.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.absolute-neighborhood-retract","id":"taxonomy.wikipedia.concept.wikipedia.absolute-neighborhood-retract.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.absolutely-convex-set","id":"taxonomy.wikipedia.concept.wikipedia.absolutely-convex-set.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.absorption-law","id":"taxonomy.wikipedia.concept.wikipedia.absorption-law.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.abstract-logic","id":"taxonomy.wikipedia.concept.wikipedia.abstract-logic.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.abstract-polytope","id":"taxonomy.wikipedia.concept.wikipedia.abstract-polytope.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.abstract-simplicial-complex","id":"taxonomy.wikipedia.concept.wikipedia.abstract-simplicial-complex.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.abutment","id":"taxonomy.wikipedia.concept.wikipedia.abutment.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.ac-dc-receiver-design","id":"taxonomy.wikipedia.concept.wikipedia.ac-dc-receiver-design.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.access-consciousness","id":"taxonomy.wikipedia.concept.wikipedia.access-consciousness.concept.wikipedia.pseudoscience","parent":"concept.wikipedia.pseudoscience","type":"narrower"},{"child":"concept.wikipedia.acicular-ferrite","id":"taxonomy.wikipedia.concept.wikipedia.acicular-ferrite.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.acid-egg","id":"taxonomy.wikipedia.concept.wikipedia.acid-egg.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.acoustic-emission","id":"taxonomy.wikipedia.concept.wikipedia.acoustic-emission.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.action-angle-coordinates","id":"taxonomy.wikipedia.concept.wikipedia.action-angle-coordinates.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.action-type-approach","id":"taxonomy.wikipedia.concept.wikipedia.action-type-approach.concept.wikipedia.pseudoscience","parent":"concept.wikipedia.pseudoscience","type":"narrower"},{"child":"concept.wikipedia.activated-sludge","id":"taxonomy.wikipedia.concept.wikipedia.activated-sludge.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.active-disturbance-rejection-control","id":"taxonomy.wikipedia.concept.wikipedia.active-disturbance-rejection-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.active-thermography","id":"taxonomy.wikipedia.concept.wikipedia.active-thermography.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.acyclic-model","id":"taxonomy.wikipedia.concept.wikipedia.acyclic-model.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.ad-personam","id":"taxonomy.wikipedia.concept.wikipedia.ad-personam.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.adaptive-beamformer","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-beamformer.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.adaptive-control","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.adaptive-step-size","id":"taxonomy.wikipedia.concept.wikipedia.adaptive-step-size.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.addition-principle","id":"taxonomy.wikipedia.concept.wikipedia.addition-principle.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.additive-identity","id":"taxonomy.wikipedia.concept.wikipedia.additive-identity.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.additive-inverse","id":"taxonomy.wikipedia.concept.wikipedia.additive-inverse.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.additive-process","id":"taxonomy.wikipedia.concept.wikipedia.additive-process.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.addressed-fiber-bragg-structure","id":"taxonomy.wikipedia.concept.wikipedia.addressed-fiber-bragg-structure.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.adjoint-state-method","id":"taxonomy.wikipedia.concept.wikipedia.adjoint-state-method.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.adjugate-matrix","id":"taxonomy.wikipedia.concept.wikipedia.adjugate-matrix.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.adjustable-pressure-limiting-valve","id":"taxonomy.wikipedia.concept.wikipedia.adjustable-pressure-limiting-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.admissible-numbering","id":"taxonomy.wikipedia.concept.wikipedia.admissible-numbering.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.admissible-representation","id":"taxonomy.wikipedia.concept.wikipedia.admissible-representation.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.adomian-decomposition-method","id":"taxonomy.wikipedia.concept.wikipedia.adomian-decomposition-method.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.advance-ratio","id":"taxonomy.wikipedia.concept.wikipedia.advance-ratio.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.advanced-composite-materials-engineering","id":"taxonomy.wikipedia.concept.wikipedia.advanced-composite-materials-engineering.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.advanced-multi-mission-operations-system","id":"taxonomy.wikipedia.concept.wikipedia.advanced-multi-mission-operations-system.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.advanced-process-control","id":"taxonomy.wikipedia.concept.wikipedia.advanced-process-control.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.advanced-stirling-radioisotope-generator","id":"taxonomy.wikipedia.concept.wikipedia.advanced-stirling-radioisotope-generator.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.aerial-manned-unmanned-teaming","id":"taxonomy.wikipedia.concept.wikipedia.aerial-manned-unmanned-teaming.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.aerodynamic-center","id":"taxonomy.wikipedia.concept.wikipedia.aerodynamic-center.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aeroelasticity","id":"taxonomy.wikipedia.concept.wikipedia.aeroelasticity.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-architecture","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-architecture.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-bearing","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-bearing.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerospace-materials","id":"taxonomy.wikipedia.concept.wikipedia.aerospace-materials.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.aerostructure","id":"taxonomy.wikipedia.concept.wikipedia.aerostructure.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.affine-arithmetic","id":"taxonomy.wikipedia.concept.wikipedia.affine-arithmetic.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.affine-bundle","id":"taxonomy.wikipedia.concept.wikipedia.affine-bundle.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-connection","id":"taxonomy.wikipedia.concept.wikipedia.affine-connection.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-grassmannian-manifold","id":"taxonomy.wikipedia.concept.wikipedia.affine-grassmannian-manifold.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-lie-algebra","id":"taxonomy.wikipedia.concept.wikipedia.affine-lie-algebra.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.affine-plank-problem","id":"taxonomy.wikipedia.concept.wikipedia.affine-plank-problem.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-space","id":"taxonomy.wikipedia.concept.wikipedia.affine-space.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.affine-sphere","id":"taxonomy.wikipedia.concept.wikipedia.affine-sphere.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.affine-symmetric-group","id":"taxonomy.wikipedia.concept.wikipedia.affine-symmetric-group.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.affinity-laws","id":"taxonomy.wikipedia.concept.wikipedia.affinity-laws.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.affirming-the-consequent","id":"taxonomy.wikipedia.concept.wikipedia.affirming-the-consequent.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.agent-causation","id":"taxonomy.wikipedia.concept.wikipedia.agent-causation.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.agentive-logic","id":"taxonomy.wikipedia.concept.wikipedia.agentive-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.air-bearing","id":"taxonomy.wikipedia.concept.wikipedia.air-bearing.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.air-carbon-arc-cutting","id":"taxonomy.wikipedia.concept.wikipedia.air-carbon-arc-cutting.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.air-cooled-heat-exchanger","id":"taxonomy.wikipedia.concept.wikipedia.air-cooled-heat-exchanger.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.air-data-inertial-reference-unit","id":"taxonomy.wikipedia.concept.wikipedia.air-data-inertial-reference-unit.field.wikipedia.aerospace-engineering","parent":"field.wikipedia.aerospace-engineering","type":"narrower"},{"child":"concept.wikipedia.air-fuel-ratio","id":"taxonomy.wikipedia.concept.wikipedia.air-fuel-ratio.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.air-operated-valve","id":"taxonomy.wikipedia.concept.wikipedia.air-operated-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.air-permeability-specific-surface","id":"taxonomy.wikipedia.concept.wikipedia.air-permeability-specific-surface.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.air-pump","id":"taxonomy.wikipedia.concept.wikipedia.air-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.airframe","id":"taxonomy.wikipedia.concept.wikipedia.airframe.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.airlift-pump","id":"taxonomy.wikipedia.concept.wikipedia.airlift-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.alarm-management","id":"taxonomy.wikipedia.concept.wikipedia.alarm-management.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.albertson-index","id":"taxonomy.wikipedia.concept.wikipedia.albertson-index.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.alexander-duality","id":"taxonomy.wikipedia.concept.wikipedia.alexander-duality.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.alexandroff-extension","id":"taxonomy.wikipedia.concept.wikipedia.alexandroff-extension.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.alexandrov-space","id":"taxonomy.wikipedia.concept.wikipedia.alexandrov-space.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.alexandrov-topology","id":"taxonomy.wikipedia.concept.wikipedia.alexandrov-topology.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.algebra-extension","id":"taxonomy.wikipedia.concept.wikipedia.algebra-extension.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.algebra-representation","id":"taxonomy.wikipedia.concept.wikipedia.algebra-representation.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.algebraic-cycle","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-cycle.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-differential-equation","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-differential-equation.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.algebraic-geometry-and-analytic-geometry","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-geometry-and-analytic-geometry.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-interior","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-interior.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.algebraic-k-theory","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-k-theory.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.algebraic-manifold","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-manifold.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.algebraic-semantics-mathematical-logic","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-semantics-mathematical-logic.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.algebraic-structure","id":"taxonomy.wikipedia.concept.wikipedia.algebraic-structure.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.aliasing","id":"taxonomy.wikipedia.concept.wikipedia.aliasing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.alief-mental-state","id":"taxonomy.wikipedia.concept.wikipedia.alief-mental-state.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.alignments-of-random-points","id":"taxonomy.wikipedia.concept.wikipedia.alignments-of-random-points.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.alkali-metal-thermal-to-electric-converter","id":"taxonomy.wikipedia.concept.wikipedia.alkali-metal-thermal-to-electric-converter.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.almost-periodic-function","id":"taxonomy.wikipedia.concept.wikipedia.almost-periodic-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.almost-ring","id":"taxonomy.wikipedia.concept.wikipedia.almost-ring.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.almost-surely","id":"taxonomy.wikipedia.concept.wikipedia.almost-surely.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.alpha-beta-filter","id":"taxonomy.wikipedia.concept.wikipedia.alpha-beta-filter.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.alpha-factor","id":"taxonomy.wikipedia.concept.wikipedia.alpha-factor.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.alternating-current","id":"taxonomy.wikipedia.concept.wikipedia.alternating-current.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.alternating-series","id":"taxonomy.wikipedia.concept.wikipedia.alternating-series.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.ambient-space-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.ambient-space-mathematics.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.ameca-robot","id":"taxonomy.wikipedia.concept.wikipedia.ameca-robot.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.amenable-number","id":"taxonomy.wikipedia.concept.wikipedia.amenable-number.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.amicable-triple","id":"taxonomy.wikipedia.concept.wikipedia.amicable-triple.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.amplifier","id":"taxonomy.wikipedia.concept.wikipedia.amplifier.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.amplitwist","id":"taxonomy.wikipedia.concept.wikipedia.amplitwist.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.anaesthetic-machine","id":"taxonomy.wikipedia.concept.wikipedia.anaesthetic-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.analog-delay-line","id":"taxonomy.wikipedia.concept.wikipedia.analog-delay-line.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.analog-device","id":"taxonomy.wikipedia.concept.wikipedia.analog-device.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analog-front-end","id":"taxonomy.wikipedia.concept.wikipedia.analog-front-end.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analog-signal-processing","id":"taxonomy.wikipedia.concept.wikipedia.analog-signal-processing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.analog-to-digital-converter","id":"taxonomy.wikipedia.concept.wikipedia.analog-to-digital-converter.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.analytic-reasoning","id":"taxonomy.wikipedia.concept.wikipedia.analytic-reasoning.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.analytic-semigroup","id":"taxonomy.wikipedia.concept.wikipedia.analytic-semigroup.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.analytic-signal","id":"taxonomy.wikipedia.concept.wikipedia.analytic-signal.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.analytic-synthetic-distinction","id":"taxonomy.wikipedia.concept.wikipedia.analytic-synthetic-distinction.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.analytical-chemistry","id":"taxonomy.wikipedia.concept.wikipedia.analytical-chemistry.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.analytical-hierarchy","id":"taxonomy.wikipedia.concept.wikipedia.analytical-hierarchy.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.anchor-channel","id":"taxonomy.wikipedia.concept.wikipedia.anchor-channel.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.anderson-acceleration","id":"taxonomy.wikipedia.concept.wikipedia.anderson-acceleration.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.andr-quillen-cohomology","id":"taxonomy.wikipedia.concept.wikipedia.andr-quillen-cohomology.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.andronov-pontryagin-criterion","id":"taxonomy.wikipedia.concept.wikipedia.andronov-pontryagin-criterion.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.anecdotal-evidence","id":"taxonomy.wikipedia.concept.wikipedia.anecdotal-evidence.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.angle-bracket-fastener","id":"taxonomy.wikipedia.concept.wikipedia.angle-bracket-fastener.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.angle-of-arrival","id":"taxonomy.wikipedia.concept.wikipedia.angle-of-arrival.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.angular-rate-sensor","id":"taxonomy.wikipedia.concept.wikipedia.angular-rate-sensor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.annealing-materials-science","id":"taxonomy.wikipedia.concept.wikipedia.annealing-materials-science.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.anosov-diffeomorphism","id":"taxonomy.wikipedia.concept.wikipedia.anosov-diffeomorphism.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.anthrobotics","id":"taxonomy.wikipedia.concept.wikipedia.anthrobotics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.anticausal-system","id":"taxonomy.wikipedia.concept.wikipedia.anticausal-system.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.antiholomorphic-function","id":"taxonomy.wikipedia.concept.wikipedia.antiholomorphic-function.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.antiisomorphism","id":"taxonomy.wikipedia.concept.wikipedia.antiisomorphism.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.antimatroid","id":"taxonomy.wikipedia.concept.wikipedia.antimatroid.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.antoine-s-necklace","id":"taxonomy.wikipedia.concept.wikipedia.antoine-s-necklace.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.apodization","id":"taxonomy.wikipedia.concept.wikipedia.apodization.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.appeal-to-the-law","id":"taxonomy.wikipedia.concept.wikipedia.appeal-to-the-law.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.application-layer-framing","id":"taxonomy.wikipedia.concept.wikipedia.application-layer-framing.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.approximate-fibration","id":"taxonomy.wikipedia.concept.wikipedia.approximate-fibration.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.approximate-limit","id":"taxonomy.wikipedia.concept.wikipedia.approximate-limit.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.approximate-measures","id":"taxonomy.wikipedia.concept.wikipedia.approximate-measures.concept.wikipedia.measurement","parent":"concept.wikipedia.measurement","type":"narrower"},{"child":"concept.wikipedia.approximate-tangent-space","id":"taxonomy.wikipedia.concept.wikipedia.approximate-tangent-space.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.approximately-continuous-function","id":"taxonomy.wikipedia.concept.wikipedia.approximately-continuous-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.approximation-error","id":"taxonomy.wikipedia.concept.wikipedia.approximation-error.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.approximation-theory","id":"taxonomy.wikipedia.concept.wikipedia.approximation-theory.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.arbor-milling","id":"taxonomy.wikipedia.concept.wikipedia.arbor-milling.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.arc-length-method","id":"taxonomy.wikipedia.concept.wikipedia.arc-length-method.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.arcadia-engineering","id":"taxonomy.wikipedia.concept.wikipedia.arcadia-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.archard-equation","id":"taxonomy.wikipedia.concept.wikipedia.archard-equation.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.archimedes-screw","id":"taxonomy.wikipedia.concept.wikipedia.archimedes-screw.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.arens-fort-space","id":"taxonomy.wikipedia.concept.wikipedia.arens-fort-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.arf-ring","id":"taxonomy.wikipedia.concept.wikipedia.arf-ring.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.argument-from-incredulity","id":"taxonomy.wikipedia.concept.wikipedia.argument-from-incredulity.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.argument-map","id":"taxonomy.wikipedia.concept.wikipedia.argument-map.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.argumentum-a-fortiori","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-a-fortiori.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.argumentum-ad-baculum","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-ad-baculum.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.argumentum-ad-captandum","id":"taxonomy.wikipedia.concept.wikipedia.argumentum-ad-captandum.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.arithmetic-derivative","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-derivative.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetic-fuchsian-group","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-fuchsian-group.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetic-zeta-function","id":"taxonomy.wikipedia.concept.wikipedia.arithmetic-zeta-function.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"concept.wikipedia.arithmetical-set","id":"taxonomy.wikipedia.concept.wikipedia.arithmetical-set.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.arity","id":"taxonomy.wikipedia.concept.wikipedia.arity.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.armature-controlled-dc-motor","id":"taxonomy.wikipedia.concept.wikipedia.armature-controlled-dc-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.armature-electrical","id":"taxonomy.wikipedia.concept.wikipedia.armature-electrical.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.arnold-diffusion","id":"taxonomy.wikipedia.concept.wikipedia.arnold-diffusion.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.arnold-invariants","id":"taxonomy.wikipedia.concept.wikipedia.arnold-invariants.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.array-processing","id":"taxonomy.wikipedia.concept.wikipedia.array-processing.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.artifact-centric-business-process-model","id":"taxonomy.wikipedia.concept.wikipedia.artifact-centric-business-process-model.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.artificio-de-juanelo","id":"taxonomy.wikipedia.concept.wikipedia.artificio-de-juanelo.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.artinian-ring","id":"taxonomy.wikipedia.concept.wikipedia.artinian-ring.field.wikipedia.ring-theory","parent":"field.wikipedia.ring-theory","type":"narrower"},{"child":"concept.wikipedia.asano-contraction","id":"taxonomy.wikipedia.concept.wikipedia.asano-contraction.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.ascending-chain-condition","id":"taxonomy.wikipedia.concept.wikipedia.ascending-chain-condition.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.asplund-space","id":"taxonomy.wikipedia.concept.wikipedia.asplund-space.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.associative-property","id":"taxonomy.wikipedia.concept.wikipedia.associative-property.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"concept.wikipedia.asymmetric-norm","id":"taxonomy.wikipedia.concept.wikipedia.asymmetric-norm.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.asymptote","id":"taxonomy.wikipedia.concept.wikipedia.asymptote.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.asymptotic-expansion","id":"taxonomy.wikipedia.concept.wikipedia.asymptotic-expansion.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.atlas-topology","id":"taxonomy.wikipedia.concept.wikipedia.atlas-topology.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.attack-time-delay","id":"taxonomy.wikipedia.concept.wikipedia.attack-time-delay.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.attrition-research","id":"taxonomy.wikipedia.concept.wikipedia.attrition-research.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.audio-filter","id":"taxonomy.wikipedia.concept.wikipedia.audio-filter.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.audio-signal-processing","id":"taxonomy.wikipedia.concept.wikipedia.audio-signal-processing.concept.wikipedia.signal-processing","parent":"concept.wikipedia.signal-processing","type":"narrower"},{"child":"concept.wikipedia.autocovariance","id":"taxonomy.wikipedia.concept.wikipedia.autocovariance.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.autogenous-welding","id":"taxonomy.wikipedia.concept.wikipedia.autogenous-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.automatic-semigroup","id":"taxonomy.wikipedia.concept.wikipedia.automatic-semigroup.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.automorphism","id":"taxonomy.wikipedia.concept.wikipedia.automorphism.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.autonomous-aircraft","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-aircraft.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.autonomous-circuit","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-circuit.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.autonomous-logistics","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-logistics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.autonomous-system-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.autonomous-system-mathematics.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.autopen","id":"taxonomy.wikipedia.concept.wikipedia.autopen.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.availability-cascade","id":"taxonomy.wikipedia.concept.wikipedia.availability-cascade.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.average-treatment-effect","id":"taxonomy.wikipedia.concept.wikipedia.average-treatment-effect.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.axial-flow-pump","id":"taxonomy.wikipedia.concept.wikipedia.axial-flow-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.axial-flux-motor","id":"taxonomy.wikipedia.concept.wikipedia.axial-flux-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.axial-piston-pump","id":"taxonomy.wikipedia.concept.wikipedia.axial-piston-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.axiom-of-countability","id":"taxonomy.wikipedia.concept.wikipedia.axiom-of-countability.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.axiomatic-design","id":"taxonomy.wikipedia.concept.wikipedia.axiomatic-design.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.axiomatic-foundations-of-topological-spaces","id":"taxonomy.wikipedia.concept.wikipedia.axiomatic-foundations-of-topological-spaces.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.backcasting","id":"taxonomy.wikipedia.concept.wikipedia.backcasting.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.backlash-engineering","id":"taxonomy.wikipedia.concept.wikipedia.backlash-engineering.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.baffle-heat-transfer","id":"taxonomy.wikipedia.concept.wikipedia.baffle-heat-transfer.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.bagel-machine","id":"taxonomy.wikipedia.concept.wikipedia.bagel-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.baire-one-star-function","id":"taxonomy.wikipedia.concept.wikipedia.baire-one-star-function.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.baire-space-set-theory","id":"taxonomy.wikipedia.concept.wikipedia.baire-space-set-theory.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.baker-clamp","id":"taxonomy.wikipedia.concept.wikipedia.baker-clamp.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.ball-screw","id":"taxonomy.wikipedia.concept.wikipedia.ball-screw.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.ball-valve","id":"taxonomy.wikipedia.concept.wikipedia.ball-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.bandgap-voltage-reference","id":"taxonomy.wikipedia.concept.wikipedia.bandgap-voltage-reference.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.bar-complex","id":"taxonomy.wikipedia.concept.wikipedia.bar-complex.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.barkhausen-stability-criterion","id":"taxonomy.wikipedia.concept.wikipedia.barkhausen-stability-criterion.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.barlow-s-wheel","id":"taxonomy.wikipedia.concept.wikipedia.barlow-s-wheel.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.barn-raising","id":"taxonomy.wikipedia.concept.wikipedia.barn-raising.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.barycentric-coordinate-system","id":"taxonomy.wikipedia.concept.wikipedia.barycentric-coordinate-system.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.barycentric-subdivision","id":"taxonomy.wikipedia.concept.wikipedia.barycentric-subdivision.field.wikipedia.algebraic-topology","parent":"field.wikipedia.algebraic-topology","type":"narrower"},{"child":"concept.wikipedia.base-50","id":"taxonomy.wikipedia.concept.wikipedia.base-50.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.base-unit-of-measurement","id":"taxonomy.wikipedia.concept.wikipedia.base-unit-of-measurement.concept.wikipedia.measurement","parent":"concept.wikipedia.measurement","type":"narrower"},{"child":"concept.wikipedia.basic-belief","id":"taxonomy.wikipedia.concept.wikipedia.basic-belief.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.basis-function","id":"taxonomy.wikipedia.concept.wikipedia.basis-function.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.basis-linear-algebra","id":"taxonomy.wikipedia.concept.wikipedia.basis-linear-algebra.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.bateman-transform","id":"taxonomy.wikipedia.concept.wikipedia.bateman-transform.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.bating-leather","id":"taxonomy.wikipedia.concept.wikipedia.bating-leather.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.bauschinger-effect","id":"taxonomy.wikipedia.concept.wikipedia.bauschinger-effect.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.bayonet-mount","id":"taxonomy.wikipedia.concept.wikipedia.bayonet-mount.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.beam-bridge","id":"taxonomy.wikipedia.concept.wikipedia.beam-bridge.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.beam-structure","id":"taxonomy.wikipedia.concept.wikipedia.beam-structure.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.beamline","id":"taxonomy.wikipedia.concept.wikipedia.beamline.field.mesh.d000074266","parent":"field.mesh.d000074266","type":"narrower"},{"child":"concept.wikipedia.beer-engine","id":"taxonomy.wikipedia.concept.wikipedia.beer-engine.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.beer-tap","id":"taxonomy.wikipedia.concept.wikipedia.beer-tap.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.begging-the-question","id":"taxonomy.wikipedia.concept.wikipedia.begging-the-question.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.behavior-based-robotics","id":"taxonomy.wikipedia.concept.wikipedia.behavior-based-robotics.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.behavior-tree","id":"taxonomy.wikipedia.concept.wikipedia.behavior-tree.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.belief-desire-intention-model","id":"taxonomy.wikipedia.concept.wikipedia.belief-desire-intention-model.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.belief-revision","id":"taxonomy.wikipedia.concept.wikipedia.belief-revision.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.bending-moment","id":"taxonomy.wikipedia.concept.wikipedia.bending-moment.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bendix-drive","id":"taxonomy.wikipedia.concept.wikipedia.bendix-drive.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.bergeron-diagram","id":"taxonomy.wikipedia.concept.wikipedia.bergeron-diagram.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.bernstein-polynomial","id":"taxonomy.wikipedia.concept.wikipedia.bernstein-polynomial.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.bernstein-s-constant","id":"taxonomy.wikipedia.concept.wikipedia.bernstein-s-constant.field.wikipedia.numerical-analysis","parent":"field.wikipedia.numerical-analysis","type":"narrower"},{"child":"concept.wikipedia.bessel-function","id":"taxonomy.wikipedia.concept.wikipedia.bessel-function.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.beta-model","id":"taxonomy.wikipedia.concept.wikipedia.beta-model.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.betavoltaic-device","id":"taxonomy.wikipedia.concept.wikipedia.betavoltaic-device.concept.wikipedia.nuclear-technology","parent":"concept.wikipedia.nuclear-technology","type":"narrower"},{"child":"concept.wikipedia.betweenness-problem","id":"taxonomy.wikipedia.concept.wikipedia.betweenness-problem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.bevel-gear","id":"taxonomy.wikipedia.concept.wikipedia.bevel-gear.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.bicircular-matroid","id":"taxonomy.wikipedia.concept.wikipedia.bicircular-matroid.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.bicoherence","id":"taxonomy.wikipedia.concept.wikipedia.bicoherence.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.bicycle-tree","id":"taxonomy.wikipedia.concept.wikipedia.bicycle-tree.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.bifacial-solar-cells","id":"taxonomy.wikipedia.concept.wikipedia.bifacial-solar-cells.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.big-m-method","id":"taxonomy.wikipedia.concept.wikipedia.big-m-method.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"concept.wikipedia.big-stan-drill-rig","id":"taxonomy.wikipedia.concept.wikipedia.big-stan-drill-rig.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.bigdog","id":"taxonomy.wikipedia.concept.wikipedia.bigdog.field.mesh.d012371","parent":"field.mesh.d012371","type":"narrower"},{"child":"concept.wikipedia.bilge-pump","id":"taxonomy.wikipedia.concept.wikipedia.bilge-pump.concept.wikipedia.pump","parent":"concept.wikipedia.pump","type":"narrower"},{"child":"concept.wikipedia.bill-of-materials","id":"taxonomy.wikipedia.concept.wikipedia.bill-of-materials.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.bill-of-quantities","id":"taxonomy.wikipedia.concept.wikipedia.bill-of-quantities.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.bin-tipper","id":"taxonomy.wikipedia.concept.wikipedia.bin-tipper.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.binder-clip","id":"taxonomy.wikipedia.concept.wikipedia.binder-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bioactive-paper","id":"taxonomy.wikipedia.concept.wikipedia.bioactive-paper.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.biomachining","id":"taxonomy.wikipedia.concept.wikipedia.biomachining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.bipolar-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.bipolar-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.biryukov-equation","id":"taxonomy.wikipedia.concept.wikipedia.biryukov-equation.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.bispectrum","id":"taxonomy.wikipedia.concept.wikipedia.bispectrum.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"concept.wikipedia.bitopological-space","id":"taxonomy.wikipedia.concept.wikipedia.bitopological-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.blackwell-girshick-equation","id":"taxonomy.wikipedia.concept.wikipedia.blackwell-girshick-equation.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.blaschke-sum","id":"taxonomy.wikipedia.concept.wikipedia.blaschke-sum.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.blast-valve","id":"taxonomy.wikipedia.concept.wikipedia.blast-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.blind-men-and-an-elephant","id":"taxonomy.wikipedia.concept.wikipedia.blind-men-and-an-elephant.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.block-and-tackle","id":"taxonomy.wikipedia.concept.wikipedia.block-and-tackle.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.bodenstein-number","id":"taxonomy.wikipedia.concept.wikipedia.bodenstein-number.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.body-on-frame","id":"taxonomy.wikipedia.concept.wikipedia.body-on-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.bogdanov-map","id":"taxonomy.wikipedia.concept.wikipedia.bogdanov-map.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"concept.wikipedia.bolometer","id":"taxonomy.wikipedia.concept.wikipedia.bolometer.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.bolt-snap","id":"taxonomy.wikipedia.concept.wikipedia.bolt-snap.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.boolean-differential-calculus","id":"taxonomy.wikipedia.concept.wikipedia.boolean-differential-calculus.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.boring-manufacturing","id":"taxonomy.wikipedia.concept.wikipedia.boring-manufacturing.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.boundary-topology","id":"taxonomy.wikipedia.concept.wikipedia.boundary-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"concept.wikipedia.bounded-quantifier","id":"taxonomy.wikipedia.concept.wikipedia.bounded-quantifier.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.bounded-variation","id":"taxonomy.wikipedia.concept.wikipedia.bounded-variation.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.bounding-point","id":"taxonomy.wikipedia.concept.wikipedia.bounding-point.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.braced-frame","id":"taxonomy.wikipedia.concept.wikipedia.braced-frame.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.braitenberg-vehicle","id":"taxonomy.wikipedia.concept.wikipedia.braitenberg-vehicle.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.braking-chopper","id":"taxonomy.wikipedia.concept.wikipedia.braking-chopper.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brass-fastener","id":"taxonomy.wikipedia.concept.wikipedia.brass-fastener.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bread-clip","id":"taxonomy.wikipedia.concept.wikipedia.bread-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.breaking-capacity","id":"taxonomy.wikipedia.concept.wikipedia.breaking-capacity.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.breather-surface","id":"taxonomy.wikipedia.concept.wikipedia.breather-surface.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.breech-lock","id":"taxonomy.wikipedia.concept.wikipedia.breech-lock.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bressummer","id":"taxonomy.wikipedia.concept.wikipedia.bressummer.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.bridge-bearing","id":"taxonomy.wikipedia.concept.wikipedia.bridge-bearing.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bridge-strike","id":"taxonomy.wikipedia.concept.wikipedia.bridge-strike.field.wikipedia.civil-engineering","parent":"field.wikipedia.civil-engineering","type":"narrower"},{"child":"concept.wikipedia.bridgeland-stability-condition","id":"taxonomy.wikipedia.concept.wikipedia.bridgeland-stability-condition.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.brokaw-bandgap-reference","id":"taxonomy.wikipedia.concept.wikipedia.brokaw-bandgap-reference.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.brooch","id":"taxonomy.wikipedia.concept.wikipedia.brooch.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.brouwer-heyting-kolmogorov-interpretation","id":"taxonomy.wikipedia.concept.wikipedia.brouwer-heyting-kolmogorov-interpretation.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"concept.wikipedia.bruhat-order","id":"taxonomy.wikipedia.concept.wikipedia.bruhat-order.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"concept.wikipedia.brush-electric","id":"taxonomy.wikipedia.concept.wikipedia.brush-electric.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brushed-dc-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.brushed-dc-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.brushless-dc-electric-motor","id":"taxonomy.wikipedia.concept.wikipedia.brushless-dc-electric-motor.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.bubble-sensor","id":"taxonomy.wikipedia.concept.wikipedia.bubble-sensor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.bulldog-clip","id":"taxonomy.wikipedia.concept.wikipedia.bulldog-clip.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.bus-holder","id":"taxonomy.wikipedia.concept.wikipedia.bus-holder.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.busemann-petty-problem","id":"taxonomy.wikipedia.concept.wikipedia.busemann-petty-problem.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.butt-welding","id":"taxonomy.wikipedia.concept.wikipedia.butt-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.butterfly-effect","id":"taxonomy.wikipedia.concept.wikipedia.butterfly-effect.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.butterfly-valve","id":"taxonomy.wikipedia.concept.wikipedia.butterfly-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.buttressed-core","id":"taxonomy.wikipedia.concept.wikipedia.buttressed-core.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.c-dl-g","id":"taxonomy.wikipedia.concept.wikipedia.c-dl-g.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.cagniard-de-hoop-method","id":"taxonomy.wikipedia.concept.wikipedia.cagniard-de-hoop-method.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.calcium-looping","id":"taxonomy.wikipedia.concept.wikipedia.calcium-looping.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.calculus-on-finite-weighted-graphs","id":"taxonomy.wikipedia.concept.wikipedia.calculus-on-finite-weighted-graphs.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.camcon-binary-actuator","id":"taxonomy.wikipedia.concept.wikipedia.camcon-binary-actuator.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.cameleon-protein","id":"taxonomy.wikipedia.concept.wikipedia.cameleon-protein.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.cantilever","id":"taxonomy.wikipedia.concept.wikipedia.cantilever.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.cantor-set","id":"taxonomy.wikipedia.concept.wikipedia.cantor-set.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.cantor-space","id":"taxonomy.wikipedia.concept.wikipedia.cantor-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.cantor-tree","id":"taxonomy.wikipedia.concept.wikipedia.cantor-tree.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.capella-engineering","id":"taxonomy.wikipedia.concept.wikipedia.capella-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.carlyle-circle","id":"taxonomy.wikipedia.concept.wikipedia.carlyle-circle.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.carnot-heat-engine","id":"taxonomy.wikipedia.concept.wikipedia.carnot-heat-engine.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.carr-du-champ-operator","id":"taxonomy.wikipedia.concept.wikipedia.carr-du-champ-operator.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.carrier-grade","id":"taxonomy.wikipedia.concept.wikipedia.carrier-grade.field.wikipedia.telecommunications-engineering","parent":"field.wikipedia.telecommunications-engineering","type":"narrower"},{"child":"concept.wikipedia.cartesian-circle","id":"taxonomy.wikipedia.concept.wikipedia.cartesian-circle.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cask-breather","id":"taxonomy.wikipedia.concept.wikipedia.cask-breather.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.category-mistake","id":"taxonomy.wikipedia.concept.wikipedia.category-mistake.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.category-of-manifolds","id":"taxonomy.wikipedia.concept.wikipedia.category-of-manifolds.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.category-of-markov-kernels","id":"taxonomy.wikipedia.concept.wikipedia.category-of-markov-kernels.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.category-of-measurable-spaces","id":"taxonomy.wikipedia.concept.wikipedia.category-of-measurable-spaces.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.cauchy-principal-value","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-principal-value.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.cauchy-product","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-product.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"concept.wikipedia.cauchy-sequence","id":"taxonomy.wikipedia.concept.wikipedia.cauchy-sequence.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.causal-closure","id":"taxonomy.wikipedia.concept.wikipedia.causal-closure.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.causal-model","id":"taxonomy.wikipedia.concept.wikipedia.causal-model.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.causal-theory-of-reference","id":"taxonomy.wikipedia.concept.wikipedia.causal-theory-of-reference.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.center-algebra","id":"taxonomy.wikipedia.concept.wikipedia.center-algebra.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.centerpoint-geometry","id":"taxonomy.wikipedia.concept.wikipedia.centerpoint-geometry.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.ceramic-engine","id":"taxonomy.wikipedia.concept.wikipedia.ceramic-engine.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.certificate-of-analysis","id":"taxonomy.wikipedia.concept.wikipedia.certificate-of-analysis.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.chain-complex","id":"taxonomy.wikipedia.concept.wikipedia.chain-complex.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.change-management-engineering","id":"taxonomy.wikipedia.concept.wikipedia.change-management-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.change-request","id":"taxonomy.wikipedia.concept.wikipedia.change-request.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.check-valve","id":"taxonomy.wikipedia.concept.wikipedia.check-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.chemical-field-effect-transistor","id":"taxonomy.wikipedia.concept.wikipedia.chemical-field-effect-transistor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.chemical-reaction-engineering","id":"taxonomy.wikipedia.concept.wikipedia.chemical-reaction-engineering.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.chemiresistor","id":"taxonomy.wikipedia.concept.wikipedia.chemiresistor.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"concept.wikipedia.chern-simons-theory","id":"taxonomy.wikipedia.concept.wikipedia.chern-simons-theory.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.chern-weil-theory","id":"taxonomy.wikipedia.concept.wikipedia.chern-weil-theory.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.chiplet","id":"taxonomy.wikipedia.concept.wikipedia.chiplet.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.chirp-z-transform","id":"taxonomy.wikipedia.concept.wikipedia.chirp-z-transform.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.chirplet-transform","id":"taxonomy.wikipedia.concept.wikipedia.chirplet-transform.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.church-turing-thesis","id":"taxonomy.wikipedia.concept.wikipedia.church-turing-thesis.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.chv-tal-sankoff-constants","id":"taxonomy.wikipedia.concept.wikipedia.chv-tal-sankoff-constants.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.circuit-topology-electrical","id":"taxonomy.wikipedia.concept.wikipedia.circuit-topology-electrical.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.circuit-total-limitation","id":"taxonomy.wikipedia.concept.wikipedia.circuit-total-limitation.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.circular-definition","id":"taxonomy.wikipedia.concept.wikipedia.circular-definition.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.circular-reasoning","id":"taxonomy.wikipedia.concept.wikipedia.circular-reasoning.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.closure-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.closure-mathematics.field.wikipedia.abstract-algebra","parent":"field.wikipedia.abstract-algebra","type":"narrower"},{"child":"concept.wikipedia.cluster-algebra","id":"taxonomy.wikipedia.concept.wikipedia.cluster-algebra.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"concept.wikipedia.clutch-delay-valve","id":"taxonomy.wikipedia.concept.wikipedia.clutch-delay-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.cogging-torque","id":"taxonomy.wikipedia.concept.wikipedia.cogging-torque.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.cognitive-dissonance","id":"taxonomy.wikipedia.concept.wikipedia.cognitive-dissonance.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.coherent-extrapolated-volition","id":"taxonomy.wikipedia.concept.wikipedia.coherent-extrapolated-volition.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.coilgun","id":"taxonomy.wikipedia.concept.wikipedia.coilgun.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.coincidence","id":"taxonomy.wikipedia.concept.wikipedia.coincidence.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.cold-metal-transfer","id":"taxonomy.wikipedia.concept.wikipedia.cold-metal-transfer.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.cold-welding","id":"taxonomy.wikipedia.concept.wikipedia.cold-welding.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.collectively-exhaustive-events","id":"taxonomy.wikipedia.concept.wikipedia.collectively-exhaustive-events.field.wikipedia.probability-theory","parent":"field.wikipedia.probability-theory","type":"narrower"},{"child":"concept.wikipedia.colloid-thruster","id":"taxonomy.wikipedia.concept.wikipedia.colloid-thruster.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.colonnette","id":"taxonomy.wikipedia.concept.wikipedia.colonnette.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.column","id":"taxonomy.wikipedia.concept.wikipedia.column.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.comb-drive","id":"taxonomy.wikipedia.concept.wikipedia.comb-drive.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.combinatorial-principles","id":"taxonomy.wikipedia.concept.wikipedia.combinatorial-principles.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.common-rail-electricity","id":"taxonomy.wikipedia.concept.wikipedia.common-rail-electricity.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.communal-reinforcement","id":"taxonomy.wikipedia.concept.wikipedia.communal-reinforcement.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.commutator-electric","id":"taxonomy.wikipedia.concept.wikipedia.commutator-electric.concept.wikipedia.electric-motor","parent":"concept.wikipedia.electric-motor","type":"narrower"},{"child":"concept.wikipedia.compact-group","id":"taxonomy.wikipedia.concept.wikipedia.compact-group.field.wikipedia.fourier-analysis","parent":"field.wikipedia.fourier-analysis","type":"narrower"},{"child":"concept.wikipedia.compossibility","id":"taxonomy.wikipedia.concept.wikipedia.compossibility.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.concurrent-engineering","id":"taxonomy.wikipedia.concept.wikipedia.concurrent-engineering.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.condenser-heat-transfer","id":"taxonomy.wikipedia.concept.wikipedia.condenser-heat-transfer.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.conditional-logic","id":"taxonomy.wikipedia.concept.wikipedia.conditional-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.cone-condition","id":"taxonomy.wikipedia.concept.wikipedia.cone-condition.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"concept.wikipedia.constant-conjunction","id":"taxonomy.wikipedia.concept.wikipedia.constant-conjunction.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.constructive-analysis","id":"taxonomy.wikipedia.concept.wikipedia.constructive-analysis.field.wikipedia.mathematical-analysis","parent":"field.wikipedia.mathematical-analysis","type":"narrower"},{"child":"concept.wikipedia.continuous-function","id":"taxonomy.wikipedia.concept.wikipedia.continuous-function.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.contra-principia-negantem-non-est-disputandum","id":"taxonomy.wikipedia.concept.wikipedia.contra-principia-negantem-non-est-disputandum.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.control-valve","id":"taxonomy.wikipedia.concept.wikipedia.control-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.convex-curve","id":"taxonomy.wikipedia.concept.wikipedia.convex-curve.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-metric-space","id":"taxonomy.wikipedia.concept.wikipedia.convex-metric-space.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-polygon","id":"taxonomy.wikipedia.concept.wikipedia.convex-polygon.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-set","id":"taxonomy.wikipedia.concept.wikipedia.convex-set.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.convex-space","id":"taxonomy.wikipedia.concept.wikipedia.convex-space.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.copper-loss","id":"taxonomy.wikipedia.concept.wikipedia.copper-loss.field.wikipedia.electrical-engineering","parent":"field.wikipedia.electrical-engineering","type":"narrower"},{"child":"concept.wikipedia.correlative-based-fallacies","id":"taxonomy.wikipedia.concept.wikipedia.correlative-based-fallacies.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cosmological-argument","id":"taxonomy.wikipedia.concept.wikipedia.cosmological-argument.concept.mesh.d015984","parent":"concept.mesh.d015984","type":"narrower"},{"child":"concept.wikipedia.counterbore","id":"taxonomy.wikipedia.concept.wikipedia.counterbore.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.counterfactual-conditional","id":"taxonomy.wikipedia.concept.wikipedia.counterfactual-conditional.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.courtier-s-reply","id":"taxonomy.wikipedia.concept.wikipedia.courtier-s-reply.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.cover-time","id":"taxonomy.wikipedia.concept.wikipedia.cover-time.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.cr-maill-re","id":"taxonomy.wikipedia.concept.wikipedia.cr-maill-re.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.credulity","id":"taxonomy.wikipedia.concept.wikipedia.credulity.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.cubicity","id":"taxonomy.wikipedia.concept.wikipedia.cubicity.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.cutting-sequence","id":"taxonomy.wikipedia.concept.wikipedia.cutting-sequence.field.wikipedia.discrete-mathematics","parent":"field.wikipedia.discrete-mathematics","type":"narrower"},{"child":"concept.wikipedia.cutting-tool-machining","id":"taxonomy.wikipedia.concept.wikipedia.cutting-tool-machining.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.cutting-tool-material","id":"taxonomy.wikipedia.concept.wikipedia.cutting-tool-material.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.cvcc","id":"taxonomy.wikipedia.concept.wikipedia.cvcc.concept.wikipedia.engine","parent":"concept.wikipedia.engine","type":"narrower"},{"child":"concept.wikipedia.cycloid-gear","id":"taxonomy.wikipedia.concept.wikipedia.cycloid-gear.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.cycloidal-drive","id":"taxonomy.wikipedia.concept.wikipedia.cycloidal-drive.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.deal-grove-model","id":"taxonomy.wikipedia.concept.wikipedia.deal-grove-model.concept.mesh.d002616","parent":"concept.mesh.d002616","type":"narrower"},{"child":"concept.wikipedia.defensive-pessimism","id":"taxonomy.wikipedia.concept.wikipedia.defensive-pessimism.concept.wikipedia.thought-experiment","parent":"concept.wikipedia.thought-experiment","type":"narrower"},{"child":"concept.wikipedia.definition","id":"taxonomy.wikipedia.concept.wikipedia.definition.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.delta-functor","id":"taxonomy.wikipedia.concept.wikipedia.delta-functor.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"concept.wikipedia.delusion","id":"taxonomy.wikipedia.concept.wikipedia.delusion.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.dempster-shafer-theory","id":"taxonomy.wikipedia.concept.wikipedia.dempster-shafer-theory.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.denying-the-antecedent","id":"taxonomy.wikipedia.concept.wikipedia.denying-the-antecedent.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.denying-the-correlative","id":"taxonomy.wikipedia.concept.wikipedia.denying-the-correlative.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.deontic-logic","id":"taxonomy.wikipedia.concept.wikipedia.deontic-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.design-manufacture-service","id":"taxonomy.wikipedia.concept.wikipedia.design-manufacture-service.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.design-of-experiments","id":"taxonomy.wikipedia.concept.wikipedia.design-of-experiments.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"concept.wikipedia.dialectical-logic","id":"taxonomy.wikipedia.concept.wikipedia.dialectical-logic.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.diaphragm-valve","id":"taxonomy.wikipedia.concept.wikipedia.diaphragm-valve.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.dieudonn-plank","id":"taxonomy.wikipedia.concept.wikipedia.dieudonn-plank.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.differential-calculus","id":"taxonomy.wikipedia.concept.wikipedia.differential-calculus.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.differential-mathematics","id":"taxonomy.wikipedia.concept.wikipedia.differential-mathematics.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.differential-mechanical-device","id":"taxonomy.wikipedia.concept.wikipedia.differential-mechanical-device.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.digifold","id":"taxonomy.wikipedia.concept.wikipedia.digifold.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.digital-micromirror-device","id":"taxonomy.wikipedia.concept.wikipedia.digital-micromirror-device.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.dilemma","id":"taxonomy.wikipedia.concept.wikipedia.dilemma.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.diode","id":"taxonomy.wikipedia.concept.wikipedia.diode.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.directed-assembly-of-micro-and-nano-structures","id":"taxonomy.wikipedia.concept.wikipedia.directed-assembly-of-micro-and-nano-structures.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.dirichlet-average","id":"taxonomy.wikipedia.concept.wikipedia.dirichlet-average.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.discontinuous-group","id":"taxonomy.wikipedia.concept.wikipedia.discontinuous-group.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.discrete-two-point-space","id":"taxonomy.wikipedia.concept.wikipedia.discrete-two-point-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.disquotational-principle","id":"taxonomy.wikipedia.concept.wikipedia.disquotational-principle.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.distinction-bias","id":"taxonomy.wikipedia.concept.wikipedia.distinction-bias.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.distinction-without-a-difference","id":"taxonomy.wikipedia.concept.wikipedia.distinction-without-a-difference.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.distributed-parameter-system","id":"taxonomy.wikipedia.concept.wikipedia.distributed-parameter-system.field.wikipedia.control-theory","parent":"field.wikipedia.control-theory","type":"narrower"},{"child":"concept.wikipedia.doctrine","id":"taxonomy.wikipedia.concept.wikipedia.doctrine.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.dominance-order","id":"taxonomy.wikipedia.concept.wikipedia.dominance-order.field.wikipedia.representation-theory","parent":"field.wikipedia.representation-theory","type":"narrower"},{"child":"concept.wikipedia.double-counting-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.double-counting-fallacy.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.downstream-manufacturing","id":"taxonomy.wikipedia.concept.wikipedia.downstream-manufacturing.concept.wikipedia.manufacturing","parent":"concept.wikipedia.manufacturing","type":"narrower"},{"child":"concept.wikipedia.doxastic-logic","id":"taxonomy.wikipedia.concept.wikipedia.doxastic-logic.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.drill-bit-sizes","id":"taxonomy.wikipedia.concept.wikipedia.drill-bit-sizes.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.drilling","id":"taxonomy.wikipedia.concept.wikipedia.drilling.concept.wikipedia.machining","parent":"concept.wikipedia.machining","type":"narrower"},{"child":"concept.wikipedia.dual-cone-and-polar-cone","id":"taxonomy.wikipedia.concept.wikipedia.dual-cone-and-polar-cone.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"concept.wikipedia.dyadic-cubes","id":"taxonomy.wikipedia.concept.wikipedia.dyadic-cubes.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.dye-and-pry","id":"taxonomy.wikipedia.concept.wikipedia.dye-and-pry.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.ecological-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.ecological-fallacy.concept.wikipedia.formal-fallacy","parent":"concept.wikipedia.formal-fallacy","type":"narrower"},{"child":"concept.wikipedia.elastic-and-inelastic-collisions-apparatus","id":"taxonomy.wikipedia.concept.wikipedia.elastic-and-inelastic-collisions-apparatus.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.electronic-component","id":"taxonomy.wikipedia.concept.wikipedia.electronic-component.concept.wikipedia.electronic-circuit","parent":"concept.wikipedia.electronic-circuit","type":"narrower"},{"child":"concept.wikipedia.embedded-instrumentation","id":"taxonomy.wikipedia.concept.wikipedia.embedded-instrumentation.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.end-of-history-illusion","id":"taxonomy.wikipedia.concept.wikipedia.end-of-history-illusion.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.engineering-geology","id":"taxonomy.wikipedia.concept.wikipedia.engineering-geology.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.epicyclic-gearing","id":"taxonomy.wikipedia.concept.wikipedia.epicyclic-gearing.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.ergo-decedo","id":"taxonomy.wikipedia.concept.wikipedia.ergo-decedo.concept.wikipedia.informal-fallacy","parent":"concept.wikipedia.informal-fallacy","type":"narrower"},{"child":"concept.wikipedia.euler-spiral","id":"taxonomy.wikipedia.concept.wikipedia.euler-spiral.concept.wikipedia.calculus","parent":"concept.wikipedia.calculus","type":"narrower"},{"child":"concept.wikipedia.evidentialism","id":"taxonomy.wikipedia.concept.wikipedia.evidentialism.concept.wikipedia.belief","parent":"concept.wikipedia.belief","type":"narrower"},{"child":"concept.wikipedia.excluded-point-topology","id":"taxonomy.wikipedia.concept.wikipedia.excluded-point-topology.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.exercise-machine","id":"taxonomy.wikipedia.concept.wikipedia.exercise-machine.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.existential-graph","id":"taxonomy.wikipedia.concept.wikipedia.existential-graph.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fallacy","id":"taxonomy.wikipedia.concept.wikipedia.fallacy.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fast-growing-hierarchy","id":"taxonomy.wikipedia.concept.wikipedia.fast-growing-hierarchy.field.wikipedia.computability-theory","parent":"field.wikipedia.computability-theory","type":"narrower"},{"child":"concept.wikipedia.fastener","id":"taxonomy.wikipedia.concept.wikipedia.fastener.concept.wikipedia.construction","parent":"concept.wikipedia.construction","type":"narrower"},{"child":"concept.wikipedia.field-programmable-gate-array","id":"taxonomy.wikipedia.concept.wikipedia.field-programmable-gate-array.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.fin-field-effect-transistor","id":"taxonomy.wikipedia.concept.wikipedia.fin-field-effect-transistor.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.fitch-notation","id":"taxonomy.wikipedia.concept.wikipedia.fitch-notation.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.floquet-theory","id":"taxonomy.wikipedia.concept.wikipedia.floquet-theory.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"concept.wikipedia.flowability","id":"taxonomy.wikipedia.concept.wikipedia.flowability.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.flue-gas-condensation","id":"taxonomy.wikipedia.concept.wikipedia.flue-gas-condensation.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.formal-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.formal-fallacy.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.fort-space","id":"taxonomy.wikipedia.concept.wikipedia.fort-space.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.four-slide","id":"taxonomy.wikipedia.concept.wikipedia.four-slide.concept.wikipedia.machine","parent":"concept.wikipedia.machine","type":"narrower"},{"child":"concept.wikipedia.fr-chet-manifold","id":"taxonomy.wikipedia.concept.wikipedia.fr-chet-manifold.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"concept.wikipedia.free-choice-inference","id":"taxonomy.wikipedia.concept.wikipedia.free-choice-inference.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.furstenberg-boundary","id":"taxonomy.wikipedia.concept.wikipedia.furstenberg-boundary.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.game-semantics","id":"taxonomy.wikipedia.concept.wikipedia.game-semantics.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.gate-oxide","id":"taxonomy.wikipedia.concept.wikipedia.gate-oxide.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.gear-failure","id":"taxonomy.wikipedia.concept.wikipedia.gear-failure.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.gear-oil","id":"taxonomy.wikipedia.concept.wikipedia.gear-oil.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.gelfand-pair","id":"taxonomy.wikipedia.concept.wikipedia.gelfand-pair.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.gender-of-connectors-and-fasteners","id":"taxonomy.wikipedia.concept.wikipedia.gender-of-connectors-and-fasteners.concept.wikipedia.fastener","parent":"concept.wikipedia.fastener","type":"narrower"},{"child":"concept.wikipedia.generality-psychology","id":"taxonomy.wikipedia.concept.wikipedia.generality-psychology.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.geological-structure-measurement-by-lidar","id":"taxonomy.wikipedia.concept.wikipedia.geological-structure-measurement-by-lidar.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.geometric-topology-object","id":"taxonomy.wikipedia.concept.wikipedia.geometric-topology-object.concept.planetmath.topologicalspace","parent":"concept.planetmath.topologicalspace","type":"narrower"},{"child":"concept.wikipedia.geometry-of-interaction","id":"taxonomy.wikipedia.concept.wikipedia.geometry-of-interaction.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.ggnmos","id":"taxonomy.wikipedia.concept.wikipedia.ggnmos.concept.wikipedia.semiconductor-device","parent":"concept.wikipedia.semiconductor-device","type":"narrower"},{"child":"concept.wikipedia.graph-coloring","id":"taxonomy.wikipedia.concept.wikipedia.graph-coloring.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"concept.wikipedia.group-algebra-of-a-locally-compact-group","id":"taxonomy.wikipedia.concept.wikipedia.group-algebra-of-a-locally-compact-group.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.gunslinger-effect","id":"taxonomy.wikipedia.concept.wikipedia.gunslinger-effect.concept.wikipedia.experiment","parent":"concept.wikipedia.experiment","type":"narrower"},{"child":"concept.wikipedia.harmonic-tensors","id":"taxonomy.wikipedia.concept.wikipedia.harmonic-tensors.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"concept.wikipedia.heat-sink","id":"taxonomy.wikipedia.concept.wikipedia.heat-sink.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.heater-core","id":"taxonomy.wikipedia.concept.wikipedia.heater-core.concept.wikipedia.heat-exchanger","parent":"concept.wikipedia.heat-exchanger","type":"narrower"},{"child":"concept.wikipedia.helix-angle","id":"taxonomy.wikipedia.concept.wikipedia.helix-angle.concept.wikipedia.gear","parent":"concept.wikipedia.gear","type":"narrower"},{"child":"concept.wikipedia.hoist-device","id":"taxonomy.wikipedia.concept.wikipedia.hoist-device.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.hydraulic-cylinder","id":"taxonomy.wikipedia.concept.wikipedia.hydraulic-cylinder.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.infinite-regress","id":"taxonomy.wikipedia.concept.wikipedia.infinite-regress.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.inflatable-packer","id":"taxonomy.wikipedia.concept.wikipedia.inflatable-packer.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"concept.wikipedia.informal-fallacy","id":"taxonomy.wikipedia.concept.wikipedia.informal-fallacy.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.inventor-s-paradox","id":"taxonomy.wikipedia.concept.wikipedia.inventor-s-paradox.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.javelin-argument","id":"taxonomy.wikipedia.concept.wikipedia.javelin-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.linear-actuator","id":"taxonomy.wikipedia.concept.wikipedia.linear-actuator.concept.wikipedia.actuator","parent":"concept.wikipedia.actuator","type":"narrower"},{"child":"concept.wikipedia.local-skepticism","id":"taxonomy.wikipedia.concept.wikipedia.local-skepticism.concept.wikipedia.skepticism","parent":"concept.wikipedia.skepticism","type":"narrower"},{"child":"concept.wikipedia.logic-of-argumentation","id":"taxonomy.wikipedia.concept.wikipedia.logic-of-argumentation.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.logical-form","id":"taxonomy.wikipedia.concept.wikipedia.logical-form.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.logical-truth","id":"taxonomy.wikipedia.concept.wikipedia.logical-truth.concept.wikipedia.philosophical-logic","parent":"concept.wikipedia.philosophical-logic","type":"narrower"},{"child":"concept.wikipedia.loki-s-wager","id":"taxonomy.wikipedia.concept.wikipedia.loki-s-wager.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.moment-statistics","id":"taxonomy.wikipedia.concept.wikipedia.moment-statistics.field.statistics","parent":"field.statistics","type":"narrower"},{"child":"concept.wikipedia.nothing-to-hide-argument","id":"taxonomy.wikipedia.concept.wikipedia.nothing-to-hide-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.objection-argument","id":"taxonomy.wikipedia.concept.wikipedia.objection-argument.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.philosophical-razor","id":"taxonomy.wikipedia.concept.wikipedia.philosophical-razor.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"concept.wikipedia.pregeometry-model-theory","id":"taxonomy.wikipedia.concept.wikipedia.pregeometry-model-theory.field.geometry","parent":"field.geometry","type":"narrower"},{"child":"concept.wikipedia.reasonable-doubt","id":"taxonomy.wikipedia.concept.wikipedia.reasonable-doubt.concept.wikipedia.skepticism","parent":"concept.wikipedia.skepticism","type":"narrower"},{"child":"concept.wikipedia.residue-field","id":"taxonomy.wikipedia.concept.wikipedia.residue-field.concept.planetmath.algebraicgeometry","parent":"concept.planetmath.algebraicgeometry","type":"narrower"},{"child":"concept.wikipedia.sat","id":"taxonomy.wikipedia.concept.wikipedia.sat.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"concept.wikipedia.seismic-base-isolation","id":"taxonomy.wikipedia.concept.wikipedia.seismic-base-isolation.concept.wikipedia.structural-system","parent":"concept.wikipedia.structural-system","type":"narrower"},{"child":"concept.wikipedia.supergeometry","id":"taxonomy.wikipedia.concept.wikipedia.supergeometry.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"concept.wikipedia.thought-experiment","id":"taxonomy.wikipedia.concept.wikipedia.thought-experiment.concept.wikipedia.critical-thinking","parent":"concept.wikipedia.critical-thinking","type":"narrower"},{"child":"concept.wikipedia.valve-actuator","id":"taxonomy.wikipedia.concept.wikipedia.valve-actuator.concept.wikipedia.valve","parent":"concept.wikipedia.valve","type":"narrower"},{"child":"concept.wikipedia.vietoris-rips-filtration","id":"taxonomy.wikipedia.concept.wikipedia.vietoris-rips-filtration.field.wikipedia.discrete-mathematics","parent":"field.wikipedia.discrete-mathematics","type":"narrower"},{"child":"concept.wikipedia.welder-certification","id":"taxonomy.wikipedia.concept.wikipedia.welder-certification.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"concept.wikipedia.welder","id":"taxonomy.wikipedia.concept.wikipedia.welder.concept.wikipedia.welding","parent":"concept.wikipedia.welding","type":"narrower"},{"child":"field.wikipedia.algebraic-analysis","id":"taxonomy.wikipedia.field.wikipedia.algebraic-analysis.field.wikipedia.complex-analysis","parent":"field.wikipedia.complex-analysis","type":"narrower"},{"child":"field.wikipedia.algebraic-number-theory","id":"taxonomy.wikipedia.field.wikipedia.algebraic-number-theory.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"field.wikipedia.appert-topology","id":"taxonomy.wikipedia.field.wikipedia.appert-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"field.wikipedia.argumentation-theory","id":"taxonomy.wikipedia.field.wikipedia.argumentation-theory.concept.wikipedia.argument","parent":"concept.wikipedia.argument","type":"narrower"},{"child":"field.wikipedia.arithmetic-combinatorics","id":"taxonomy.wikipedia.field.wikipedia.arithmetic-combinatorics.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"field.wikipedia.arithmetic-dynamics","id":"taxonomy.wikipedia.field.wikipedia.arithmetic-dynamics.concept.wikipedia.dynamical-system","parent":"concept.wikipedia.dynamical-system","type":"narrower"},{"child":"field.wikipedia.asymptotic-geometry","id":"taxonomy.wikipedia.field.wikipedia.asymptotic-geometry.field.wikipedia.functional-analysis","parent":"field.wikipedia.functional-analysis","type":"narrower"},{"child":"field.wikipedia.biological-systems-engineering","id":"taxonomy.wikipedia.field.wikipedia.biological-systems-engineering.field.wikipedia.systems-engineering","parent":"field.wikipedia.systems-engineering","type":"narrower"},{"child":"field.wikipedia.categorical-topology","id":"taxonomy.wikipedia.field.wikipedia.categorical-topology.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"field.wikipedia.chemotronics","id":"taxonomy.wikipedia.field.wikipedia.chemotronics.concept.wikipedia.sensor","parent":"concept.wikipedia.sensor","type":"narrower"},{"child":"field.wikipedia.computability-theory","id":"taxonomy.wikipedia.field.wikipedia.computability-theory.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"field.wikipedia.consensus-dynamics","id":"taxonomy.wikipedia.field.wikipedia.consensus-dynamics.concept.planetmath.graphtheory","parent":"concept.planetmath.graphtheory","type":"narrower"},{"child":"field.wikipedia.convex-analysis","id":"taxonomy.wikipedia.field.wikipedia.convex-analysis.field.wikipedia.convex-geometry","parent":"field.wikipedia.convex-geometry","type":"narrower"},{"child":"field.wikipedia.extremal-combinatorics","id":"taxonomy.wikipedia.field.wikipedia.extremal-combinatorics.field.wikipedia.combinatorics","parent":"field.wikipedia.combinatorics","type":"narrower"},{"child":"field.wikipedia.geometric-analysis","id":"taxonomy.wikipedia.field.wikipedia.geometric-analysis.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"field.wikipedia.global-analysis","id":"taxonomy.wikipedia.field.wikipedia.global-analysis.concept.planetmath.manifold","parent":"concept.planetmath.manifold","type":"narrower"},{"child":"field.wikipedia.noncommutative-harmonic-analysis","id":"taxonomy.wikipedia.field.wikipedia.noncommutative-harmonic-analysis.field.wikipedia.harmonic-analysis","parent":"field.wikipedia.harmonic-analysis","type":"narrower"},{"child":"field.wikipedia.offshore-geotechnical-engineering","id":"taxonomy.wikipedia.field.wikipedia.offshore-geotechnical-engineering.field.wikipedia.geotechnical-engineering","parent":"field.wikipedia.geotechnical-engineering","type":"narrower"},{"child":"field.wikipedia.projective-differential-geometry","id":"taxonomy.wikipedia.field.wikipedia.projective-differential-geometry.field.wikipedia.differential-geometry","parent":"field.wikipedia.differential-geometry","type":"narrower"},{"child":"question.wikipedia.abc-conjecture","id":"taxonomy.wikipedia.question.wikipedia.abc-conjecture.field.wikipedia.number-theory","parent":"field.wikipedia.number-theory","type":"narrower"},{"child":"theory.wikipedia.amitsur-levitzki-theorem","id":"taxonomy.wikipedia.theory.wikipedia.amitsur-levitzki-theorem.concept.planetmath.linearalgebra","parent":"concept.planetmath.linearalgebra","type":"narrower"},{"child":"theory.wikipedia.apollonius-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.apollonius-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.auslander-buchsbaum-theorem","id":"taxonomy.wikipedia.theory.wikipedia.auslander-buchsbaum-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem","id":"taxonomy.wikipedia.theory.wikipedia.b-chi-elgot-trakhtenbrot-theorem.concept.wikipedia.mathematical-logic","parent":"concept.wikipedia.mathematical-logic","type":"narrower"},{"child":"theory.wikipedia.baire-category-theorem","id":"taxonomy.wikipedia.theory.wikipedia.baire-category-theorem.field.wikipedia.general-topology","parent":"field.wikipedia.general-topology","type":"narrower"},{"child":"theory.wikipedia.beckman-quarles-theorem","id":"taxonomy.wikipedia.theory.wikipedia.beckman-quarles-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.beki-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.beki-s-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.bendixson-dulac-theorem","id":"taxonomy.wikipedia.theory.wikipedia.bendixson-dulac-theorem.concept.planetmath.differentialequation","parent":"concept.planetmath.differentialequation","type":"narrower"},{"child":"theory.wikipedia.big-little-big-lemma","id":"taxonomy.wikipedia.theory.wikipedia.big-little-big-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.boolean-prime-ideal-theorem","id":"taxonomy.wikipedia.theory.wikipedia.boolean-prime-ideal-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.borel-cantelli-lemma","id":"taxonomy.wikipedia.theory.wikipedia.borel-cantelli-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.bourbaki-witt-theorem","id":"taxonomy.wikipedia.theory.wikipedia.bourbaki-witt-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.british-flag-theorem","id":"taxonomy.wikipedia.theory.wikipedia.british-flag-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.cantor-bernstein-theorem","id":"taxonomy.wikipedia.theory.wikipedia.cantor-bernstein-theorem.field.wikipedia.order-theory","parent":"field.wikipedia.order-theory","type":"narrower"},{"child":"theory.wikipedia.cantor-s-intersection-theorem","id":"taxonomy.wikipedia.theory.wikipedia.cantor-s-intersection-theorem.concept.wikipedia.real-analysis","parent":"concept.wikipedia.real-analysis","type":"narrower"},{"child":"theory.wikipedia.casey-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.casey-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.cauchy-s-theorem-geometry","id":"taxonomy.wikipedia.theory.wikipedia.cauchy-s-theorem-geometry.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.commandino-s-theorem","id":"taxonomy.wikipedia.theory.wikipedia.commandino-s-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.constant-chord-theorem","id":"taxonomy.wikipedia.theory.wikipedia.constant-chord-theorem.concept.wikipedia.euclidean-geometry","parent":"concept.wikipedia.euclidean-geometry","type":"narrower"},{"child":"theory.wikipedia.dehn-s-lemma","id":"taxonomy.wikipedia.theory.wikipedia.dehn-s-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.eilenberg-watts-theorem","id":"taxonomy.wikipedia.theory.wikipedia.eilenberg-watts-theorem.field.wikipedia.homological-algebra","parent":"field.wikipedia.homological-algebra","type":"narrower"},{"child":"theory.wikipedia.gauss-s-lemma-riemannian-geometry","id":"taxonomy.wikipedia.theory.wikipedia.gauss-s-lemma-riemannian-geometry.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.hilbert-burch-theorem","id":"taxonomy.wikipedia.theory.wikipedia.hilbert-burch-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"},{"child":"theory.wikipedia.hua-s-lemma","id":"taxonomy.wikipedia.theory.wikipedia.hua-s-lemma.concept.planetmath.lemma","parent":"concept.planetmath.lemma","type":"narrower"},{"child":"theory.wikipedia.krull-akizuki-theorem","id":"taxonomy.wikipedia.theory.wikipedia.krull-akizuki-theorem.field.wikipedia.commutative-algebra","parent":"field.wikipedia.commutative-algebra","type":"narrower"}]}
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/atlas-navigation.json b/research/fog-of-knowledge/data/atlas-navigation.json
index 23cfe9ca5..59d54df70 100644
--- a/research/fog-of-knowledge/data/atlas-navigation.json
+++ b/research/fog-of-knowledge/data/atlas-navigation.json
@@ -1,6 +1,6 @@
 {
   "protocol": "fog-atlas-navigation/1",
-  "input_sha256": "631d0458131a160f4836c5f75839359e71f3de41a84b4092bee0d1f472c918fc",
+  "input_sha256": "5613fd93250772910ca6340ddc47f2f150ab61c1ebc52c2a5ebfca620ee67add",
   "registry_nodes": [
     {
       "id": "ology.geobiology",
@@ -22088,6 +22088,12 @@
       "type": "placement_pending",
       "placement_pending": true
     },
+    {
+      "source": "family:health",
+      "target": "claim.frontier.arxiv-2609-29972",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
     {
       "source": "family:health",
       "target": "claim.frontier.pmid-42231562",
@@ -24290,6 +24296,96 @@
       "taxonomy_id": "taxonomy.mesh.concept.mesh.d024861.concept.mesh.d024803",
       "placement_pending": false
     },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2607-17248",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2607-24423",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2607-26209",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2608-10825",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2608-11929",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2608-28387",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-05763",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-16899",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-23085",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-25437",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-25847",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-29832",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2609-35246",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2610-04630",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:engineering",
+      "target": "claim.frontier.arxiv-2610-19137",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
     {
       "source": "family:engineering",
       "target": "claim.frontier.doi-10-1002-adfm-76901",
@@ -29799,6 +29895,594 @@
       "type": "placement_pending",
       "placement_pending": true
     },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2607-14144",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2607-28185",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2607-28276",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2607-28780",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2607-28833",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-00959",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-01220",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-02079",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-02244",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-02976",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-02978",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-03967",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-04133",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-04227",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-05348",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-05481",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-07289",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-08151",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-08599",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-10254",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-11175",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-12037",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-12393",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-12398",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-16290",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-18060",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-18396",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-19416",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-20723",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-21020",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-21764",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-23972",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-24219",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-26093",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-27536",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2608-31034",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-02071",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-05749",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-06066",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-06163",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-08218",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-11530",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-12016",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-12486",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-12866",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-14022",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-16258",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-16353",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-17042",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-18467",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-19468",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-21057",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-21093",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-21270",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-21813",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-21966",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-22615",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-22775",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-23199",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-23703",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-25701",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-26924",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-28815",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-32315",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-35424",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-36354",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2609-39776",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-03008",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-03964",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-04242",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-04662",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-04697",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-04776",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-04959",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-06601",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-06918",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-07307",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-07616",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-08744",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-09010",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-09080",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-09266",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-11359",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-11869",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-12038",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-12592",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-12604",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-12779",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-13402",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-13424",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-15052",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-15072",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-16259",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-16273",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-17295",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-19515",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-19722",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:information",
+      "target": "claim.frontier.arxiv-2610-21653",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
     {
       "source": "family:information",
       "target": "claim.longcontext.babilong-20-reasoning-tasks",
@@ -35246,6 +35930,13 @@
       "type": "placement_pending",
       "placement_pending": true
     },
+    {
+      "source": "concept.nist.semidefinite",
+      "target": "claim.frontier.arxiv-2607-28224",
+      "type": "reviewed_taxonomy",
+      "taxonomy_id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+      "placement_pending": true
+    },
     {
       "source": "family:information",
       "target": "concept.nist.separatnthrm",
@@ -35598,6 +36289,13 @@
       "type": "placement_pending",
       "placement_pending": true
     },
+    {
+      "source": "concept.nist.temporllogic",
+      "target": "claim.frontier.arxiv-2610-15934",
+      "type": "reviewed_taxonomy",
+      "taxonomy_id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+      "placement_pending": true
+    },
     {
       "source": "family:information",
       "target": "concept.nist.terminal",
@@ -36836,6 +37534,30 @@
       "type": "placement_pending",
       "placement_pending": true
     },
+    {
+      "source": "family:social",
+      "target": "claim.frontier.arxiv-2607-22049",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:social",
+      "target": "claim.frontier.arxiv-2607-24360",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:social",
+      "target": "claim.frontier.arxiv-2607-25081",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
+    {
+      "source": "family:social",
+      "target": "claim.frontier.arxiv-2607-25526",
+      "type": "placement_pending",
+      "placement_pending": true
+    },
     {
       "source": "family:social",
       "target": "claim.frontier.doi-10-1002-fea2-70077",
@@ -42737,11 +43459,13 @@
     "claim.frontier.arxiv-2607-12710",
     "claim.frontier.arxiv-2607-13775",
     "claim.frontier.arxiv-2607-13855",
+    "claim.frontier.arxiv-2607-14144",
     "claim.frontier.arxiv-2607-15029",
     "claim.frontier.arxiv-2607-15664",
     "claim.frontier.arxiv-2607-15958",
     "claim.frontier.arxiv-2607-16724",
     "claim.frontier.arxiv-2607-16747",
+    "claim.frontier.arxiv-2607-17248",
     "claim.frontier.arxiv-2607-18525",
     "claim.frontier.arxiv-2607-18781",
     "claim.frontier.arxiv-2607-18942",
@@ -42769,6 +43493,7 @@
     "claim.frontier.arxiv-2607-21883",
     "claim.frontier.arxiv-2607-21892",
     "claim.frontier.arxiv-2607-22018",
+    "claim.frontier.arxiv-2607-22049",
     "claim.frontier.arxiv-2607-22156",
     "claim.frontier.arxiv-2607-22196",
     "claim.frontier.arxiv-2607-22284",
@@ -42800,6 +43525,8 @@
     "claim.frontier.arxiv-2607-24244",
     "claim.frontier.arxiv-2607-24252",
     "claim.frontier.arxiv-2607-24254",
+    "claim.frontier.arxiv-2607-24360",
+    "claim.frontier.arxiv-2607-24423",
     "claim.frontier.arxiv-2607-24433",
     "claim.frontier.arxiv-2607-24446",
     "claim.frontier.arxiv-2607-24489",
@@ -42815,12 +43542,14 @@
     "claim.frontier.arxiv-2607-24933",
     "claim.frontier.arxiv-2607-24938",
     "claim.frontier.arxiv-2607-24988",
+    "claim.frontier.arxiv-2607-25081",
     "claim.frontier.arxiv-2607-25226",
     "claim.frontier.arxiv-2607-25252",
     "claim.frontier.arxiv-2607-25341",
     "claim.frontier.arxiv-2607-25394",
     "claim.frontier.arxiv-2607-25460",
     "claim.frontier.arxiv-2607-25473",
+    "claim.frontier.arxiv-2607-25526",
     "claim.frontier.arxiv-2607-25559",
     "claim.frontier.arxiv-2607-25610",
     "claim.frontier.arxiv-2607-25621",
@@ -42846,6 +43575,7 @@
     "claim.frontier.arxiv-2607-26180",
     "claim.frontier.arxiv-2607-26193",
     "claim.frontier.arxiv-2607-26205",
+    "claim.frontier.arxiv-2607-26209",
     "claim.frontier.arxiv-2607-26281",
     "claim.frontier.arxiv-2607-26287",
     "claim.frontier.arxiv-2607-26289",
@@ -42900,6 +43630,9 @@
     "claim.frontier.arxiv-2607-28161",
     "claim.frontier.arxiv-2607-28168",
     "claim.frontier.arxiv-2607-28173",
+    "claim.frontier.arxiv-2607-28185",
+    "claim.frontier.arxiv-2607-28224",
+    "claim.frontier.arxiv-2607-28276",
     "claim.frontier.arxiv-2607-28345",
     "claim.frontier.arxiv-2607-28438",
     "claim.frontier.arxiv-2607-28441",
@@ -42918,6 +43651,8 @@
     "claim.frontier.arxiv-2607-28738",
     "claim.frontier.arxiv-2607-28739",
     "claim.frontier.arxiv-2607-28746",
+    "claim.frontier.arxiv-2607-28780",
+    "claim.frontier.arxiv-2607-28833",
     "claim.frontier.arxiv-2607-28883",
     "claim.frontier.arxiv-2607-28893",
     "claim.frontier.arxiv-2607-28919",
@@ -42928,19 +43663,126 @@
     "claim.frontier.arxiv-2608-00445",
     "claim.frontier.arxiv-2608-00649",
     "claim.frontier.arxiv-2608-00708",
+    "claim.frontier.arxiv-2608-00959",
+    "claim.frontier.arxiv-2608-01220",
+    "claim.frontier.arxiv-2608-02079",
+    "claim.frontier.arxiv-2608-02244",
     "claim.frontier.arxiv-2608-02799",
+    "claim.frontier.arxiv-2608-02976",
+    "claim.frontier.arxiv-2608-02978",
     "claim.frontier.arxiv-2608-03192",
     "claim.frontier.arxiv-2608-03832",
+    "claim.frontier.arxiv-2608-03967",
+    "claim.frontier.arxiv-2608-04133",
     "claim.frontier.arxiv-2608-04208",
+    "claim.frontier.arxiv-2608-04227",
+    "claim.frontier.arxiv-2608-05348",
+    "claim.frontier.arxiv-2608-05481",
     "claim.frontier.arxiv-2608-06711",
+    "claim.frontier.arxiv-2608-07289",
+    "claim.frontier.arxiv-2608-08151",
+    "claim.frontier.arxiv-2608-08599",
+    "claim.frontier.arxiv-2608-10254",
+    "claim.frontier.arxiv-2608-10825",
+    "claim.frontier.arxiv-2608-11175",
+    "claim.frontier.arxiv-2608-11929",
+    "claim.frontier.arxiv-2608-12037",
+    "claim.frontier.arxiv-2608-12393",
+    "claim.frontier.arxiv-2608-12398",
     "claim.frontier.arxiv-2608-14134",
+    "claim.frontier.arxiv-2608-16290",
+    "claim.frontier.arxiv-2608-18060",
+    "claim.frontier.arxiv-2608-18396",
     "claim.frontier.arxiv-2608-19170",
+    "claim.frontier.arxiv-2608-19416",
+    "claim.frontier.arxiv-2608-20723",
+    "claim.frontier.arxiv-2608-21020",
+    "claim.frontier.arxiv-2608-21764",
+    "claim.frontier.arxiv-2608-23972",
+    "claim.frontier.arxiv-2608-24219",
+    "claim.frontier.arxiv-2608-26093",
+    "claim.frontier.arxiv-2608-27536",
+    "claim.frontier.arxiv-2608-28387",
+    "claim.frontier.arxiv-2608-31034",
+    "claim.frontier.arxiv-2609-02071",
     "claim.frontier.arxiv-2609-05100",
+    "claim.frontier.arxiv-2609-05749",
+    "claim.frontier.arxiv-2609-05763",
+    "claim.frontier.arxiv-2609-06066",
+    "claim.frontier.arxiv-2609-06163",
+    "claim.frontier.arxiv-2609-08218",
+    "claim.frontier.arxiv-2609-11530",
+    "claim.frontier.arxiv-2609-12016",
+    "claim.frontier.arxiv-2609-12486",
+    "claim.frontier.arxiv-2609-12866",
     "claim.frontier.arxiv-2609-13345",
+    "claim.frontier.arxiv-2609-14022",
+    "claim.frontier.arxiv-2609-16258",
+    "claim.frontier.arxiv-2609-16353",
+    "claim.frontier.arxiv-2609-16899",
+    "claim.frontier.arxiv-2609-17042",
+    "claim.frontier.arxiv-2609-18467",
     "claim.frontier.arxiv-2609-19386",
+    "claim.frontier.arxiv-2609-19468",
+    "claim.frontier.arxiv-2609-21057",
+    "claim.frontier.arxiv-2609-21093",
+    "claim.frontier.arxiv-2609-21270",
+    "claim.frontier.arxiv-2609-21813",
     "claim.frontier.arxiv-2609-21904",
+    "claim.frontier.arxiv-2609-21966",
+    "claim.frontier.arxiv-2609-22615",
+    "claim.frontier.arxiv-2609-22775",
+    "claim.frontier.arxiv-2609-23085",
+    "claim.frontier.arxiv-2609-23199",
+    "claim.frontier.arxiv-2609-23703",
+    "claim.frontier.arxiv-2609-25437",
+    "claim.frontier.arxiv-2609-25701",
+    "claim.frontier.arxiv-2609-25847",
+    "claim.frontier.arxiv-2609-26924",
+    "claim.frontier.arxiv-2609-28815",
+    "claim.frontier.arxiv-2609-29832",
+    "claim.frontier.arxiv-2609-29972",
+    "claim.frontier.arxiv-2609-32315",
+    "claim.frontier.arxiv-2609-35246",
+    "claim.frontier.arxiv-2609-35424",
+    "claim.frontier.arxiv-2609-36354",
     "claim.frontier.arxiv-2609-39519",
+    "claim.frontier.arxiv-2609-39776",
     "claim.frontier.arxiv-2610-02106",
+    "claim.frontier.arxiv-2610-03008",
+    "claim.frontier.arxiv-2610-03964",
+    "claim.frontier.arxiv-2610-04242",
+    "claim.frontier.arxiv-2610-04630",
+    "claim.frontier.arxiv-2610-04662",
+    "claim.frontier.arxiv-2610-04697",
+    "claim.frontier.arxiv-2610-04776",
+    "claim.frontier.arxiv-2610-04959",
+    "claim.frontier.arxiv-2610-06601",
+    "claim.frontier.arxiv-2610-06918",
+    "claim.frontier.arxiv-2610-07307",
+    "claim.frontier.arxiv-2610-07616",
+    "claim.frontier.arxiv-2610-08744",
+    "claim.frontier.arxiv-2610-09010",
+    "claim.frontier.arxiv-2610-09080",
+    "claim.frontier.arxiv-2610-09266",
+    "claim.frontier.arxiv-2610-11359",
+    "claim.frontier.arxiv-2610-11869",
+    "claim.frontier.arxiv-2610-12038",
+    "claim.frontier.arxiv-2610-12592",
+    "claim.frontier.arxiv-2610-12604",
+    "claim.frontier.arxiv-2610-12779",
+    "claim.frontier.arxiv-2610-13402",
+    "claim.frontier.arxiv-2610-13424",
+    "claim.frontier.arxiv-2610-15052",
+    "claim.frontier.arxiv-2610-15072",
+    "claim.frontier.arxiv-2610-15934",
+    "claim.frontier.arxiv-2610-16259",
+    "claim.frontier.arxiv-2610-16273",
+    "claim.frontier.arxiv-2610-17295",
+    "claim.frontier.arxiv-2610-19137",
+    "claim.frontier.arxiv-2610-19515",
+    "claim.frontier.arxiv-2610-19722",
+    "claim.frontier.arxiv-2610-21653",
     "claim.frontier.doi-10-1002-adfm-76901",
     "claim.frontier.doi-10-1002-adfm-77585",
     "claim.frontier.doi-10-1002-adfm-77938",
@@ -48485,24 +49327,24 @@
       "placement_pending": 535
     },
     "health": {
-      "total": 352,
+      "total": 353,
       "connected_before_inventory": 23,
-      "placement_pending": 329
+      "placement_pending": 330
     },
     "engineering": {
-      "total": 850,
+      "total": 865,
       "connected_before_inventory": 17,
-      "placement_pending": 833
+      "placement_pending": 848
     },
     "information": {
-      "total": 1017,
+      "total": 1117,
       "connected_before_inventory": 19,
-      "placement_pending": 998
+      "placement_pending": 1098
     },
     "social": {
-      "total": 316,
+      "total": 320,
       "connected_before_inventory": 87,
-      "placement_pending": 229
+      "placement_pending": 233
     },
     "humanities": {
       "total": 647,
@@ -57673,6 +58515,12 @@
       "child": "concept.nist.function",
       "type": "narrower"
     },
+    {
+      "id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+      "parent": "concept.nist.semidefinite",
+      "child": "claim.frontier.arxiv-2607-28224",
+      "type": "narrower"
+    },
     {
       "id": "taxonomy.place.concept.nist.poset.concept.nist.set",
       "parent": "concept.nist.set",
@@ -57715,6 +58563,12 @@
       "child": "concept.nist.propersubset",
       "type": "narrower"
     },
+    {
+      "id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+      "parent": "concept.nist.temporllogic",
+      "child": "claim.frontier.arxiv-2610-15934",
+      "type": "narrower"
+    },
     {
       "id": "taxonomy.place.concept.nist.haltingproblem.concept.nist.undecidableproblem",
       "parent": "concept.nist.undecidableproblem",
@@ -64769,9 +65623,9 @@
   "identities": [],
   "alternative_parents": {},
   "counts": {
-    "canonical": 6111,
+    "canonical": 6231,
     "registry_added": 129,
-    "discoverable": 6240,
-    "placement_pending": 5819
+    "discoverable": 6360,
+    "placement_pending": 5939
   }
 }
diff --git a/research/fog-of-knowledge/data/evidence-index.json b/research/fog-of-knowledge/data/evidence-index.json
index 73a7b4bd9..2374d4d80 100644
--- a/research/fog-of-knowledge/data/evidence-index.json
+++ b/research/fog-of-knowledge/data/evidence-index.json
@@ -6111,10 +6111,130 @@
     "claim.frontier.doi-10-1002-joc-70436": "evidence-reviewed",
     "claim.frontier.doi-10-2166-hydro-2026-191": "evidence-reviewed",
     "claim.frontier.doi-10-1111-ojoa-70020": "evidence-reviewed",
-    "claim.frontier.doi-10-1111-phpr-70116": "evidence-reviewed"
+    "claim.frontier.doi-10-1111-phpr-70116": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-21653": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-19722": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-19515": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-19137": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-17295": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-16273": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-16259": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-15934": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-15072": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-15052": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-13424": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-13402": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-12779": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-12604": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-12592": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-12038": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-11869": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-11359": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04959": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-09266": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-09080": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-09010": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-08744": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-07616": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-07307": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-06601": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04776": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04697": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04662": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04630": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-04242": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-06918": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-03964": "evidence-reviewed",
+    "claim.frontier.arxiv-2610-03008": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-39776": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-21813": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-36354": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-35424": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-35246": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-32315": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-29972": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-29832": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-28815": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-26924": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-25847": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-25701": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-25437": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-05763": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-23703": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-23199": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-23085": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-22775": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-22615": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-21966": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-21270": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-21093": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-21057": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-19468": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-18467": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-17042": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-16899": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-16353": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-16258": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-05749": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-14022": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-12866": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-12486": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-12016": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-11530": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-08218": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-06163": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-06066": "evidence-reviewed",
+    "claim.frontier.arxiv-2609-02071": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-31034": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-28387": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-27536": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-26093": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-24219": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-23972": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-21764": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-21020": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-20723": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-19416": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-18396": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-18060": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-16290": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-12037": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-11929": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-11175": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-10825": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-08151": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-10254": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-08599": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-12398": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-07289": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-05481": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-05348": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-12393": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-04227": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-04133": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-03967": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-02978": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-02976": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-02244": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-02079": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-01220": "evidence-reviewed",
+    "claim.frontier.arxiv-2608-00959": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-17248": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-14144": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-28833": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-28780": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-28276": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-28224": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-28185": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-26209": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-25526": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-25081": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-24423": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-24360": "evidence-reviewed",
+    "claim.frontier.arxiv-2607-22049": "evidence-reviewed"
   },
   "counts": {
-    "evidence_reviewed": 5873,
+    "evidence_reviewed": 5993,
     "legacy_unreviewed": 238,
     "missing_sources": 40
   },
diff --git a/research/fog-of-knowledge/data/evidence/captures/01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d.json b/research/fog-of-knowledge/data/evidence/captures/01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d.json
new file mode 100644
index 000000000..9c24f5dc4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-19137",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:36.959397+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:39:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19137\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19137</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19137</id>\n        <created>2026-10-13</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Park</keyname>\n                        <forenames>Jaebum</forenames>\n                </author>\n                <author>\n                    <keyname>Xie</keyname>\n                        <forenames>Yutao</forenames>\n                </author>\n                <author>\n                    <keyname>Ghosh</keyname>\n                        <forenames>Amitava</forenames>\n                </author>\n                <author>\n                    <keyname>Shi</keyname>\n                        <forenames>Yuanyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Heath</keyname>\n                        <forenames>Robert W.</forenames>\n                        <suffix>Jr</suffix>\n                </author>\n        </authors>\n        <title>Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity. We jointly optimize base station and battery operation under a carbon-adjusted electricity price and traffic-demand constraints, and solve the mixed-integer nonconvex problem through a two-stage decomposition exact under a minimum-power rule. Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned. Above a carbon price of roughly 100-300 USD/ton, battery operation shifts from cost-driven to carbon-driven, cutting emissions by up to 57.8% relative to a cost-only schedule.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+  "raw_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37.json b/research/fog-of-knowledge/data/evidence/captures/02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37.json
new file mode 100644
index 000000000..dab5ea335
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04242",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:09.732094+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04242\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04242</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04242</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Kopp</keyname>\n                        <forenames>Fionna B.</forenames>\n                </author>\n                <author>\n                    <keyname>Schalkamp</keyname>\n                        <forenames>Ann-Kathrin</forenames>\n                </author>\n                <author>\n                    <keyname>Azzam</keyname>\n                        <forenames>Shadera</forenames>\n                </author>\n                <author>\n                    <keyname>Rudrapatna</keyname>\n                        <forenames>Vivek</forenames>\n                </author>\n                <author>\n                    <keyname>Borrelli</keyname>\n                        <forenames>Francesco</forenames>\n                </author>\n        </authors>\n        <title>Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The clinical management of chronic disease is naturally structured as a feedback control problem. Physicians observe the disease state at clinic visits and make decisions based on the patient&#39;s history and current state. We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates. We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis. Using the learned model, we formulate therapy selection as a model predictive control problem (MPC) that maximizes the expected time spent in inactive disease states, and we evaluate the resulting policy. In closed-loop simulation on 10 patients, the MPC achieves a cost at or below the observed clinical course in the majority of its realizations for 4 of the 10 patients, and its outcomes in all cases are comparable to observed care and within clinical guidelines.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+  "raw_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616.json b/research/fog-of-knowledge/data/evidence/captures/0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616.json
new file mode 100644
index 000000000..8571af32f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-26209",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:29:40.817896+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:29:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.26209\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.26209</identifier>\n        <datestamp>2026-07-30</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.26209</id>\n        <created>2026-07-28</created>\n            <updated>2026-07-30</updated>\n        <authors>\n                <author>\n                    <keyname>García-Morales</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>de la Fuente</keyname>\n                        <forenames>Alejandro</forenames>\n                </author>\n                <author>\n                    <keyname>Gualda</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Carro-Calvo</keyname>\n                        <forenames>Leopoldo</forenames>\n                </author>\n                <author>\n                    <keyname>Riera-Palou</keyname>\n                        <forenames>Felip</forenames>\n                </author>\n                <author>\n                    <keyname>Femenias</keyname>\n                        <forenames>Guillem</forenames>\n                </author>\n        </authors>\n        <title>Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks</title>\n            <categories>eess.SP</categories>\n            <comments>Author Accepted Manuscript. Published in IEEE Open Journal of the Communications Society. Available at https://doi.org/10.1109/OJCOMS.2026.3717118. Copyright 2026 IEEE</comments>\n            <doi>10.1109/OJCOMS.2026.3717118</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads. Existing AP ON/OFF mechanisms--typically based on worst-case dimensioning or greedy heuristics--explore the combinatorial activation space inadequately, leading to suboptimal energy-efficiency outcomes. This paper introduces two evolutionary AP-selection strategies tailored to CF-mMIMO networks. The first, a constrained genetic algorithm (CGA), identifies the near-optimal subset of active APs for any fixed activation cardinality, while an outer search determines the globally optimal operating point. The second, a Pareto-driven genetic algorithm (PDGA), jointly optimizes spectral and energy efficiency by evolving a Pareto front over all feasible activation patterns. A detailed computational-complexity analysis is provided for both techniques. Simulations conducted under realistic spatially inhomogeneous traffic and considering both conjugate beamforming (CB) and minimum mean square error (MMSE) processing confirm consistent performance gains. The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere. These results highlight the strong potential of evolutionary optimization as a powerful and reliable approach for energy-efficient CF-mMIMO deployments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+  "raw_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c.json b/research/fog-of-knowledge/data/evidence/captures/08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c.json
new file mode 100644
index 000000000..82bc392f2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-15934",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:50.359909+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T08:37:33Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15934\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15934</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15934</id>\n        <created>2026-10-11</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Manas</keyname>\n                        <forenames>Kumar</forenames>\n                </author>\n                <author>\n                    <keyname>Paschke</keyname>\n                        <forenames>Adrian</forenames>\n                </author>\n        </authors>\n        <title>Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>8 pages</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Motion planning for automated vehicles in interactive traffic has to simultaneously ensure safety, respect traffic rules, and maintain comfortable progress under multi-modal behavior uncertainty. Imposing all these requirements as hard constraints reduces feasibility, whereas treating them all as costs allows safety-critical requirements to be traded against progress. We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor. This retains robustness to discrete interaction modes without branch-specific contingent ego policies. We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective. Closed-loop Monte Carlo evaluation over six highway and intersection scenarios shows the highest strict success rate among the compared planners with no observed collisions or rule violations, at roughly a quarter of the planning latency of the unoptimized formulation. An ablation study separates the two layers: the hard constraints define the safety envelope, while the soft terms improve clearance and motion quality within it.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+  "raw_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73.json b/research/fog-of-knowledge/data/evidence/captures/091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73.json
new file mode 100644
index 000000000..4c9d141b3
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-35424",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:28.544365+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:28Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.35424\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.35424</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.35424</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Xiaoying</forenames>\n                </author>\n                <author>\n                    <keyname>Huang</keyname>\n                        <forenames>Linbin</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Hangyu</forenames>\n                </author>\n                <author>\n                    <keyname>Xin</keyname>\n                        <forenames>Huanhai</forenames>\n                </author>\n        </authors>\n        <title>Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Small-signal stability analysis of power electronics-dominated power systems is becoming increasingly challenging due to the large-scale integration of heterogeneous grid-following (GFL) and grid-forming (GFM) converters. Classical centralized methods, such as eigenvalue analysis and the generalized Nyquist criterion, provide direct stability assessment tools but exhibit limited scalability as the system size increases. This motivates scalable analysis methods for stability assessment and device-level diagnosis, and calls for less conservative stability conditions. To this end, this paper proposes a scalable small-signal stability assessment method with quantitative stability indices for multi-converter systems based on frequency-domain quadratic constraints (FQCs). It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition. This FQC-based formulation also clarifies the requirements for decentralized verification of these existing stability conditions. To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection. Combined with the mixed gain-phase condition, this optimization problem forms a hierarchical screening-diagnosis procedure that improves efficiency. Case studies demonstrate that the proposed method is less conservative than existing criteria and can effectively identify problematic devices associated with potential instability risks.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+  "raw_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa.json b/research/fog-of-knowledge/data/evidence/captures/0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa.json
new file mode 100644
index 000000000..bf7fa989d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-24219",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:29.991977+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:29Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.24219\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.24219</identifier>\n        <datestamp>2026-08-26</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.24219</id>\n        <created>2026-08-25</created>\n            <updated>2026-08-26</updated>\n        <authors>\n                <author>\n                    <keyname>López</keyname>\n                        <forenames>Francisco M.</forenames>\n                </author>\n                <author>\n                    <keyname>Triesch</keyname>\n                        <forenames>Jochen</forenames>\n                </author>\n        </authors>\n        <title>Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception</title>\n            <categories>cs.CV q-bio.NC</categories>\n            <comments>24 pages, 11 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Facial attractiveness has been linked to statistical regularities such as symmetry and averageness, suggesting that beauty may depend on the ease with which a face is perceived. We empirically test this hypothesis by training variational autoencoders on four face datasets without attractiveness supervision and evaluating their representations on the 597 faces from the Chicago Face Database. Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space. Independently learned latent spaces contain an attractiveness direction that transfers strongly across random initializations and training data. We also find that attractive faces are more prototypical in both shape and latent space. Our results connect classic accounts of aesthetics with learned generative models and provide empirical support for a variational interpretation of the processing fluency theory of aesthetic pleasure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+  "raw_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313.json b/research/fog-of-knowledge/data/evidence/captures/0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313.json
new file mode 100644
index 000000000..2388bb33c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-06601",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:54.882591+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.06601\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.06601</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.06601</id>\n        <created>2026-10-05</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Lily Y.</forenames>\n                </author>\n                <author>\n                    <keyname>Shah</keyname>\n                        <forenames>Vade</forenames>\n                </author>\n                <author>\n                    <keyname>Walsh</keyname>\n                        <forenames>Dan</forenames>\n                </author>\n                <author>\n                    <keyname>Marden</keyname>\n                        <forenames>Jason R.</forenames>\n                </author>\n        </authors>\n        <title>Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Industrial refrigeration consumes substantial electricity, and compressors are the dominant energy consumers in these systems, making their operation central to improving energy efficiency. Compressors are most efficient when operated at full capacity, but the cooling they provide at full capacity can exceed the facility&#39;s immediate needs. This motivates pre-cooling, where compressors operate at full capacity and the excess cooling is stored as thermal inventory for future heat loads. However, stored cooling is inherently lossy: colder spaces attract additional heat from their surroundings, creating a tradeoff between maximizing compressor efficiency and avoiding cooling that dissipates before it can be used. We study this tradeoff through a retention factor, defined as the fraction of thermal inventory that survives after one minute, with the goals of understanding how retention affects the value of pre-cooling and designing effective control policies that account for this lossiness. We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data. Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+  "raw_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306.json b/research/fog-of-knowledge/data/evidence/captures/0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306.json
new file mode 100644
index 000000000..339b6770b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-08599",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:27.577789+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:27Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.08599\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.08599</identifier>\n        <datestamp>2026-08-11</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.08599</id>\n        <created>2026-08-09</created>\n            <updated>2026-08-11</updated>\n        <authors>\n                <author>\n                    <keyname>Fadakar</keyname>\n                        <forenames>Alireza</forenames>\n                </author>\n                <author>\n                    <keyname>Molisch</keyname>\n                        <forenames>Andreas F.</forenames>\n                </author>\n        </authors>\n        <title>Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System</title>\n            <categories>eess.SP</categories>\n            <comments>4 pages, 3 figures, Accepted for publication in the 2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</comments>\n            <journal-ref>2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Electromagnetically reconfigurable fluid antenna system (ER-FAS) provides additional electromagnetic (EM)-domain degrees of freedom by enabling dynamic control of per-element radiation patterns, thereby improving power efficiency in wireless communications. The effective exploitation of these capabilities, however, critically depends on accurate channel estimation, which has received limited attention in prior studies. This paper presents a low-complexity channel parameter estimation framework for downlink wideband systems that leverages available channel sparsity. A synthesis-based reconfigurability model is considered, where each antenna generates desired beampatterns using a finite set of EM basis functions. Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters. Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+  "raw_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072.json b/research/fog-of-knowledge/data/evidence/captures/0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072.json
new file mode 100644
index 000000000..0c586aa46
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-05763",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:56.044144+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.05763\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.05763</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.05763</id>\n        <created>2026-09-21</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Ganal</keyname>\n                        <forenames>Helen</forenames>\n                </author>\n                <author>\n                    <keyname>Becker</keyname>\n                        <forenames>Sarah</forenames>\n                </author>\n                <author>\n                    <keyname>Holzhauer</keyname>\n                        <forenames>Sascha</forenames>\n                </author>\n                <author>\n                    <keyname>Glißmann</keyname>\n                        <forenames>Thilo</forenames>\n                </author>\n                <author>\n                    <keyname>Krebs</keyname>\n                        <forenames>Friedrich</forenames>\n                </author>\n                <author>\n                    <keyname>Braun</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Härtel</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n        </authors>\n        <title>AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Submitted to Applied Energy</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Decarbonising the building sector is central to meeting climate targets, yet existing models rarely capture the interaction between system-level transformation dynamics and heterogeneous individual investment decisions. This work presents AgentHomeID, an agent-based model of building stock evolution in which owner behaviour, techno-economic constraints, and regulatory frameworks are represented explicitly at the level of individual buildings and their owners. The model differentiates owner-occupiers, private landlords, and institutional owners, using willingness-to-pay (WTP) parameters estimated from empirical decision-maker studies, and operates on both representative building archetypes and real building data derived from geographic information systems (GIS). We demonstrate this versatility across three applications. At national scale, scenario analysis for Germany to 2045 shows that removing binding renewable heating requirements substantially raises final energy demand even where envelope refurbishment is unchanged, and that subsidy allocation and investment activity diverge sharply across owner types and income quartiles, with the lowest quartiles persistently underinvesting. At regional scale, bottom-up simulation for a German distribution grid planning region yields spatially concentrated heat pump uptake at NUTS-3 level that differs from aggregated top-down projections in both magnitude and spatial distribution. At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks. Across all three scales, owner heterogeneity and local structure materially shape transition pathways, indicating that they should be represented explicitly in models used for policy assessment and infrastructure planning.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+  "raw_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23.json b/research/fog-of-knowledge/data/evidence/captures/0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23.json
new file mode 100644
index 000000000..fa12691b7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-12604",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:10.837414+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T16:54:39Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12604\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12604</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12604</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Pires</keyname>\n                        <forenames>Francisco I. T.</forenames>\n                </author>\n                <author>\n                    <keyname>Ferreira</keyname>\n                        <forenames>Jean C. S.</forenames>\n                </author>\n                <author>\n                    <keyname>Asim</keyname>\n                        <forenames>Fazal-E</forenames>\n                </author>\n        </authors>\n        <title>Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>This paper presents a low-complexity tensor-based channel estimation framework for downlink mmWave massive MIMO systems using passive Butler-matrix beamforming. By modeling received signals as a third-order PARAFAC tensor, we exploit known pilot structures via bilinear alternating least-squares (BALS) optimization to reduce computational overhead. The decoupled spatial factors are then processed via 1D and 2D ESPRIT to extract angles of arrival and departure with automatic pairing. Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture. Simulations confirm the proposed estimator outperforms conventional least-squares, achieving accurate channel reconstruction and approaching the CRLB at moderate-to-high signal-to-noise ratios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+  "raw_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e.json b/research/fog-of-knowledge/data/evidence/captures/116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e.json
new file mode 100644
index 000000000..6557662d8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-15052",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:57.062941+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T03:00:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15052\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15052</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15052</id>\n        <created>2026-10-10</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Zakirzyanov</keyname>\n                        <forenames>Ruslan</forenames>\n                </author>\n        </authors>\n        <title>On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms</title>\n            <categories>eess.SY cs.SY</categories>\n            <doi>10.1109/RusAutoCon69876.2026.11707364</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The paper addresses the synthesis of a cost-optimal hardware architecture of the automated process control system (APCS) for continuous processes. The problem is formalized as the search for a minimum-cost rooted tree of devices subject to constraints on the number of I/O channels, the types and number of communication interfaces, the information capacity of processors, the regulation time and the reliability. The signals are grouped by control rooms. The problem is NP-hard, and a hybrid method is proposed that combines a deterministic hierarchy construction with a modified ant colony optimization (ACO) for device-type selection, enhanced by an adaptive heuristic. On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each. By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster. By the median cost, however, the deterministic-greedy baselines are more reliable (GA attains the best Friedman rank) because the cost of the ACO runs is highly variable. All differences are confirmed by the Friedman and Wilcoxon tests. The method targets the early-design search for the cheapest feasible architecture and synthesizes one within minutes at industrial scale (A up to 1086).</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+  "raw_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024.json b/research/fog-of-knowledge/data/evidence/captures/126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024.json
new file mode 100644
index 000000000..c1a0e3cb0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-16258",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:16.350332+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16258\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16258</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>econ:econ:GN</setSpec>\n            <setSpec>q-fin:q-fin:EC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16258</id>\n        <created>2026-09-14</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Manso</keyname>\n                        <forenames>Gabriel</forenames>\n                </author>\n                <author>\n                    <keyname>Fu</keyname>\n                        <forenames>Emma</forenames>\n                </author>\n                <author>\n                    <keyname>Thompson</keyname>\n                        <forenames>Neil</forenames>\n                </author>\n        </authors>\n        <title>The AI-Enabled Scientific Frontier</title>\n            <categories>cs.AI cs.LG cs.PF econ.GN q-fin.EC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method. But how true are these claims? Does AI outperform all techniques, or only some, and how is this changing? To assess the claims, we assemble a corpus of 2,507 head-to-head comparisons between AI and other scientific analysis techniques across 27 scientific disciplines from papers published between 2000 and early 2025. We find a profound dichotomy. Relative to traditional statistics, AI often outperforms, but at a significantly higher computational cost. But there are also nearly a quarter of cases where AI is both more expensive and performs worse than traditional statistical techniques and this fraction has been stable for a decade. Relative to scientific computing, AI often underperforms, but at lower computational cost. This has begun to change: since 2020, AI&#39;s performance against scientific computing has notably strengthened and it now outperforms on more than half of comparisons. These patterns suggest that AI is therefore not a universal replacement for existing methods, but rather a valuable -- and improving -- part of a new AI-enabled scientific frontier.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+  "raw_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e.json b/research/fog-of-knowledge/data/evidence/captures/12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e.json
new file mode 100644
index 000000000..d84bb7fa9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-04227",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:52.159620+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.04227\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.04227</identifier>\n        <datestamp>2026-08-06</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.04227</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-06</updated>\n        <authors>\n                <author>\n                    <keyname>Delogne</keyname>\n                        <forenames>Rémi</forenames>\n                </author>\n                <author>\n                    <keyname>Jacques</keyname>\n                        <forenames>Laurent</forenames>\n                </author>\n        </authors>\n        <title>Random features for Grassmannian kernel approximation with bounded rank-one projections</title>\n            <categories>cs.LG eess.SP</categories>\n            <comments>33 pages, 6 figures, J2C certification</comments>\n            <journal-ref>Transactions on Machine Learning Research, July 2026</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions.\n  We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+  "raw_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0.json b/research/fog-of-knowledge/data/evidence/captures/12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0.json
new file mode 100644
index 000000000..22ee2ef87
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-09266",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:33.676958+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-11T12:13:43Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09266\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09266</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09266</id>\n        <created>2026-10-07</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Ncube</keyname>\n                        <forenames>Walter Zibusiso</forenames>\n                </author>\n                <author>\n                    <keyname>Qidan</keyname>\n                        <forenames>Ahmad Adnan</forenames>\n                </author>\n                <author>\n                    <keyname>El-Gorashi</keyname>\n                        <forenames>Taisir</forenames>\n                </author>\n                <author>\n                    <keyname>Elmirghani</keyname>\n                        <forenames>Jaafar M. H.</forenames>\n                </author>\n        </authors>\n        <title>Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Growing wireless traffic is increasing pressure on the congested radio-frequency spectrum. Optical wireless communication (OWC) provides a complementary solution by using the abundant unlicensed optical spectrum. However, indoor OWC networks are dynamic: users move, enter or leave the network, and subscribe to different services. Poorly coordinated resource allocation can consequently waste subcarriers, require excessive transmission power and cause frequent AP reassignments. Energy efficiency (EE), defined as the total delivered data rate divided by the total network power consumption, therefore requires the serving AP, number of allocated subcarriers, and transmission power to be jointly adapted while maintaining QoS. Optimising these in a dynamic time series, multi-service OWC environment produces a complex sequential EE optimisation problem. To address this problem, this work proposes Dual-Agent Resource Allocation using Deep Reinforcement Learning (DARA-DRL). DARA-DRL combines a branching duelling deep Q-network for association and subcarrier allocation with a conditional soft actor-critic agent for continuous power control. The agents are coupled through a common reward and a cooperative value update that evaluates each discrete allocation together with its corresponding power decision. Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%. Results demonstrate that agent specialisation simplifies mixed-action learning, and cooperation outperforms independently trained agents.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+  "raw_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300.json b/research/fog-of-knowledge/data/evidence/captures/13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300.json
new file mode 100644
index 000000000..7bb21d1a6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-19515",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:33.576347+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T21:11:01Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19515\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19515</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19515</id>\n        <created>2026-10-14</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Bin</forenames>\n                </author>\n                <author>\n                    <keyname>Wan</keyname>\n                        <forenames>Senning</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Decheng</forenames>\n                </author>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Yonglei</forenames>\n                </author>\n                <author>\n                    <keyname>Xue</keyname>\n                        <forenames>Yu</forenames>\n                </author>\n        </authors>\n        <title>Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>12 pages, 10 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this paper, we investigate a wireless communication network supported by multiple uncrewed aerial vehicles (UAVs). To ensure reliable connectivity, UAVs are desired to approach the boundaries of designated no-fly zones (NFZs) without violating them when mobile users (MUs) enter NFZs. To support heterogeneous communication services, MUs are assigned different priority levels based on their individual communication types. Considering the practical constraints arising from user mobility, heterogeneous communication requirements, and NFZs, the objective is to maximize the weighted sum of MU communication rates, where weights correspond to MU priorities. This is achieved by jointly optimizing trajectory planning, UAV transmission power control, and the binary association factor between UAVs and MUs. To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy. Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability. Moreover, it effectively meets diverse communication requirements, satisfies UAV energy constraints, and ensures reliable operation under NFZ constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+  "raw_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be.json b/research/fog-of-knowledge/data/evidence/captures/16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be.json
new file mode 100644
index 000000000..43cab45a9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-02079",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:21.610496+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02079\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02079</identifier>\n        <datestamp>2026-08-11</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02079</id>\n        <created>2026-08-03</created>\n            <updated>2026-08-11</updated>\n        <authors>\n                <author>\n                    <keyname>Şanlan</keyname>\n                        <forenames>Abdülbaki</forenames>\n                </author>\n                <author>\n                    <keyname>Altunkaya</keyname>\n                        <forenames>Ege C.</forenames>\n                </author>\n                <author>\n                    <keyname>Bağci</keyname>\n                        <forenames>Hasan T.</forenames>\n                </author>\n                <author>\n                    <keyname>Koyuncu</keyname>\n                        <forenames>Emre</forenames>\n                </author>\n                <author>\n                    <keyname>Özkol</keyname>\n                        <forenames>İbrahim</forenames>\n                </author>\n        </authors>\n        <title>TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In vision-aided navigation and visual-inertial odometry, the quality of triangulated three-dimensional feature positions is a fundamental prerequisite for state estimation accuracy. Triangulation becomes ill-conditioned or even impossible when a camera undergoes pure rotation without translation, or when the observed bearing vectors provide insufficient parallax. Even though visual-inertial odometry has been extensively studied, the active maintenance of feature-observability during navigation has not been sufficiently addressed in the literature. To address this gap, this study presents TANGO-VIO, a triangulation-aware navigation framework that embeds a log-determinant metric of the feature-wise stacked-bearing matrix into a control barrier function. In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction. The proposed architecture is evaluated through software-inthe- loop simulations and real flight experiments. The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter. Supplementary materials are available on the project webpage.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+  "raw_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725.json b/research/fog-of-knowledge/data/evidence/captures/18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725.json
new file mode 100644
index 000000000..50a912de7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-02244",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:18.166437+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:18Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02244\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02244</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02244</id>\n        <created>2026-08-03</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Dayi</forenames>\n                </author>\n                <author>\n                    <keyname>Zhou</keyname>\n                        <forenames>Zijie</forenames>\n                </author>\n        </authors>\n        <title>Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling</title>\n            <categories>cs.DC cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies a resource-allocation inefficiency in batched large language model (LLM) serving: heterogeneous requests that share a decode batch impose max-driven computational costs on one another. Because the wall-clock cost of a batch step is largely governed by the largest active KV-cache footprint, a short request co-batched with a long request can experience latency and GPU-resource consumption disproportionate to its own token workload. We formalize this phenomenon as a resource-fair scheduling problem. We develop a mathematical scheduling model that connects within-batch resource fairness to system throughput. The proposed fairness constraint bounds the disparity in decode progress, equivalently KV-cache footprint, among co-batched requests. Based on this model, we design the Insert-Short-Jobs-with-Limit (ISJL) algorithm, a parameterized hybrid batching policy. We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$. We further examine the profit implications of resource-fair scheduling under the token-metered pricing convention used by commercial LLM APIs. Numerical experiments show that ISJL occupies a favorable middle ground between FCFS, which has large batching externalities, and LJF, which is cost-aligned but sacrifices batching flexibility. Thus, ISJL provides a bi-criterion scheduling policy: it maintains high throughput while aligning max-driven batch cost with token-metered revenue.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+  "raw_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89.json b/research/fog-of-knowledge/data/evidence/captures/1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89.json
new file mode 100644
index 000000000..cfaa6eb51
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-09010",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:40.949103+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09010\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09010</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09010</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The growing demand for diverse sixth-generation (6G) applications requires efficient connectivity, seamless service continuity, and extended network coverage. Although terrestrial infrastructures can effectively serve most wireless user equipment (UE), communication reliability may be significantly degraded in remote or blocked environments. To address this challenge, this paper proposes a reconfigurable intelligent surface (RIS)-assisted space-air-ground integrated network (SAGIN) operating in the upper mid-band (FR3) spectrum. The considered network consists of a terrestrial base station (BS), a low Earth orbit (LEO) satellite, multiple terrestrial RISs (TRISs), and unmanned aerial vehicle-mounted RISs (ARISs), where the BS serves as the primary access node, while the LEO satellite provides complementary connectivity when terrestrial links are unavailable or cannot satisfy the required quality-of-service (QoS) requirements. Within this framework, we formulate a hierarchical RIS association problem to maximize the achievable network sum rate under RIS capacity constraints. The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources. To efficiently solve the problem, we develop a hierarchical many-to-one matching-based RIS association framework. Specifically, UEs with satisfactory terrestrial connectivity are first associated with TRISs, whereas UEs that cannot be reliably served by the terrestrial network are subsequently associated with ARISs through the non-terrestrial network. Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+  "raw_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571.json b/research/fog-of-knowledge/data/evidence/captures/21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571.json
new file mode 100644
index 000000000..140175c02
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-12398",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:32.097457+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12398\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12398</identifier>\n        <datestamp>2026-08-14</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12398</id>\n        <created>2026-08-08</created>\n            <updated>2026-08-14</updated>\n        <authors>\n                <author>\n                    <keyname>Varma</keyname>\n                        <forenames>Subir</forenames>\n                </author>\n        </authors>\n        <title>A Hierarchical Energy-Based Model for Multimodal Cognition</title>\n            <categories>q-bio.NC cs.AI</categories>\n            <comments>48 pages, 14 figures</comments>\n            <msc-class>I.2</msc-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose IM-LEPP (Integrated Multimodal Latent Energy-based Predictive Processing), a hierarchical, energy-based model of multimodal cognition that extends a previously proposed single-modality model (LEPP) to integrate vision and language. Following the view that generative neural networks are effective theories of cognitive dynamics, analogous to how statistical mechanics relates to thermodynamics, IM-LEPP models cognition as latent states flowing through learned energy landscapes rather than as an account of neural circuitry. The architecture is a hub-and-spoke hierarchy, grounded in the controlled semantic cognition framework of Lambon Ralph et al., in which predictive-coding pipelines for visual objects, scenes, and linguistic units converge on a shared amodal hub modeled on the anterior temporal lobe. Each pipeline&#39;s own prediction is conditioned by, rather than overwritten by, the current hub state, preserving pipeline-specific identity while letting every prediction reflect the full multimodal context. We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction. We also discuss data-efficient language acquisition relative to LLMs, outline a semantic/episodic memory subsystem, situate the model against predictive coding, the free-energy principle, JEPA, and Hierarchical Temporal Memory, and propose concrete experimental predictions to test its central claims Key Words: predictive processing; predictive coding; energy-based models; diffusion models; effective theory; computational neuroscience.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+  "raw_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6.json b/research/fog-of-knowledge/data/evidence/captures/2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6.json
new file mode 100644
index 000000000..ef1a6c160
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04662",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:02.786630+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04662\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04662</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04662</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Matheu</keyname>\n                        <forenames>Ryan</forenames>\n                </author>\n                <author>\n                    <keyname>Damera</keyname>\n                        <forenames>Sai Sandeep</forenames>\n                </author>\n                <author>\n                    <keyname>Baras</keyname>\n                        <forenames>John S.</forenames>\n                </author>\n                <author>\n                    <keyname>Belta</keyname>\n                        <forenames>Calin</forenames>\n                </author>\n        </authors>\n        <title>Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks</title>\n            <categories>eess.SY cs.RO cs.SY</categories>\n            <comments>9 pages, 6 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems. Many techniques exist for control synthesis according to temporal logic specifications, spanning a large variety of systems, including robotics. However, the vast majority of implementations are limited to Boolean temporal logics. Boolean temporal logic does not have an innate mechanism for quantifying abstention, rather verdicts are either definitively \\textit{True} or \\textit{False}. Recent work demonstrates that ternary logic is a capable formalism for reasoning about robotic behaviors, with the natural ability to classify uncertainty with the \\textit{Unknown} literal. Ternary temporal logic is still in its infancy, with work limited to synthesis for linear systems and monitoring. This work proposes a probabilistic relaxation of ternary temporal logic that allows for value and gradient computation through the same network while retaining exact verdicts on actual data. The relaxed network can be used as an objective in gradient-based control synthesis for both offline and online robotic control applications. We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+  "raw_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927.json b/research/fog-of-knowledge/data/evidence/captures/23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927.json
new file mode 100644
index 000000000..58ede36f8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-18467",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:31.985307+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.18467\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.18467</identifier>\n        <datestamp>2026-09-17</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.18467</id>\n        <created>2026-09-16</created>\n            <updated>2026-09-17</updated>\n        <authors>\n                <author>\n                    <keyname>Uniyal</keyname>\n                        <forenames>Smriti</forenames>\n                </author>\n                <author>\n                    <keyname>Fang</keyname>\n                        <forenames>Tianyu</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Van-Dinh</forenames>\n                </author>\n                <author>\n                    <keyname>Ngo</keyname>\n                        <forenames>Hien Quoc</forenames>\n                </author>\n                <author>\n                    <keyname>Juntti</keyname>\n                        <forenames>Markku</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Nhan Thanh</forenames>\n                </author>\n        </authors>\n        <title>Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In integrated sensing and communications (ISAC), the same spectral and hardware resources are shared for two functionalities. Most ISAC designs assume perfect target-angle information neglecting angle estimation errors, which introduce steering-vector mismatches, degrade sensing accuracy, and may invalidate deterministic sensing guarantees. This paper investigates monostatic massive multiple-input-multiple-output (MIMO) ISAC systems under imperfect target-angle estimates. We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty. We characterize the cumulative distribution functions and outage probabilities of the CRLBs under Gaussian, generalized uniform, and von Mises angle-error models. Our analysis reveals that, in the small-error regime, the CRLBs increase quadratically with the angle errors due to transmit steering-vector mismatch. To ensure reliable sensing, we propose a robust power allocation framework that jointly optimizes pilot training and communications/sensing transmission powers to maximize the communications sum rate while satisfying CRLB outage constraints. The resulting nonconvex problem is solved using an alternating-optimization algorithm based on successive convex approximation. Numerical results validate the developed analysis and show that the proposed robust design reduces azimuth and elevation CRLB outage probabilities by up to $60\\%$ compared with conventional non-robust schemes. It attains up to $45\\%$ higher sum rates than the non-robust design under strict CRLB thresholds.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+  "raw_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b.json b/research/fog-of-knowledge/data/evidence/captures/279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b.json
new file mode 100644
index 000000000..79f95be1b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-08218",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:59.774649+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.08218\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.08218</identifier>\n        <datestamp>2026-09-10</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.08218</id>\n        <created>2026-09-09</created>\n            <updated>2026-09-10</updated>\n        <authors>\n                <author>\n                    <keyname>Bahavarnia</keyname>\n                        <forenames>MirSaleh</forenames>\n                </author>\n                <author>\n                    <keyname>Taha</keyname>\n                        <forenames>Ahmad F.</forenames>\n                </author>\n        </authors>\n        <title>Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper explores stabilizing traffic flow using a minimum number of autonomous vehicles (AVs) under control constraints. In contrast to most studies, we consider a heterogeneous parameter setup scenario for human-driven vehicles (HVs) to reflect real-world differences in driving behavior. While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow. To reduce such conservativeness and obtain a less conservative lower bound, we ensure the string stability of traffic flow by directly imposing the possession of no growing eigenmodes. We also systematically find a minimum number of required AVs and solve for the optimal control parameters via nonlinear optimization. We finally assess the intended conservativeness reduction via numerical simulations. Quantitatively, applying our algorithm to the homogeneous HV baseline in the literature (the result built upon an H-Infinity based sufficient condition) reduces (improves) the AV penetration rate by 17.14% while ensuring the string stability of traffic flow. We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs. Quantitatively, our last numerical simulation corroborates that the AV penetration rate can be reduced by 61.54% at the expense of 27.66% higher position difference deviation from the equilibrium and a 92.47% degradation in the real stability radius (RSR)---a metric to measure the stability robustness under the perturbation/uncertainty---associated with the aggregated linearized dynamics while ensuring the string stability of traffic flow. This trade-off helps engineers/operators make better traffic control decisions.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+  "raw_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391.json b/research/fog-of-knowledge/data/evidence/captures/2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391.json
new file mode 100644
index 000000000..38afeeb14
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-28833",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:40.198292+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28833\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28833</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28833</id>\n        <created>2026-07-30</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Gutowski</keyname>\n                        <forenames>Willa</forenames>\n                </author>\n                <author>\n                    <keyname>Foltz</keyname>\n                        <forenames>Charles</forenames>\n                </author>\n                <author>\n                    <keyname>Koukpaizan</keyname>\n                        <forenames>Nicholson</forenames>\n                </author>\n                <author>\n                    <keyname>Peles</keyname>\n                        <forenames>Slaven</forenames>\n                </author>\n                <author>\n                    <keyname>Tsybina</keyname>\n                        <forenames>Eve</forenames>\n                </author>\n        </authors>\n        <title>Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>5 pages, 5 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system. While high peak electricity prices are an anticipated outcome, measurable under peak hour simulations, the high off peak prices are a significantly underestimated threat. We simulate different ramping conditions on a congestible 5000-bus system, based on a modified IEEE 118-bus grid, to show that, in the presence of fast ramping loads and slow ramping generation, datacenters can aggravate latent load pockets. This results in unexpectedly high system costs during periods outside of datacenter peak. We test the datacenter effects using two distinct load conditions. We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%. These findings are of extreme importance as they reveal the hidden costs of preventively ramping slow generation in anticipation of datacenter load changes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+  "raw_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139.json b/research/fog-of-knowledge/data/evidence/captures/32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139.json
new file mode 100644
index 000000000..b5ac5ac4d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-23085",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:03.018673+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23085\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23085</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23085</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Siddiqui</keyname>\n                        <forenames>Muhammad Abdur Rab</forenames>\n                </author>\n                <author>\n                    <keyname>Rojas</keyname>\n                        <forenames>Daniela</forenames>\n                </author>\n                <author>\n                    <keyname>Yang</keyname>\n                        <forenames>Chen</forenames>\n                </author>\n                <author>\n                    <keyname>Cui</keyname>\n                        <forenames>Wenqi</forenames>\n                </author>\n                <author>\n                    <keyname>Shi</keyname>\n                        <forenames>Yuanyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Yize</forenames>\n                </author>\n        </authors>\n        <title>Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving</title>\n            <categories>cs.PF cs.DC cs.LG cs.SY eess.SY</categories>\n            <comments>16 pages, 10 figures, in submission</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Large language models (LLMs) and agentic AI systems are creating rapidly growing inference energy demands as model sizes grow and reasoning trajectories extend. While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption. In this paper, we investigate whether adaptive routing across a heterogeneous pool of LLMs can reduce this energy burden without substantially compromising task performance. We design a language-model-based router that reads in each query and selects an answer model from a fixed candidate pool. The candidate models are first profiled through an offline tournament that records their correctness, latency, power, and GPU energy for each query. Using these measurements, the router is trained through supervised fine-tuning followed by group relative policy optimization (GRPO) with the tailored paradigms. Results demonstrate that learned routing can selectively allocate expensive model capacity based on query context and improve the accuracy-energy tradeoff in multi-LLM serving. Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+  "raw_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f.json b/research/fog-of-knowledge/data/evidence/captures/33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f.json
new file mode 100644
index 000000000..76b9d035d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-21813",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:25.104371+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21813\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21813</identifier>\n        <datestamp>2026-10-01</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21813</id>\n        <created>2026-09-30</created>\n            <updated>2026-10-01</updated>\n        <authors>\n                <author>\n                    <keyname>Corlay</keyname>\n                        <forenames>Vincent</forenames>\n                </author>\n                <author>\n                    <keyname>Enttsel</keyname>\n                        <forenames>Andriy</forenames>\n                </author>\n        </authors>\n        <title>How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing</title>\n            <categories>stat.ML cs.CV eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In classification-oriented adaptive sensing, posterior samples characterize uncertainty at the current measurement state and can serve two roles: they may guide the next sensing direction, while their class labels provide votes for the candidate classes and determine whether sensing should continue. We focus on the stopping layer that turns these votes into a declaration, without modifying the posterior sampler or sensing directions. A natural plug-in rule declares when the observed vote share exceeds a threshold. We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time. As alternatives, we calibrate a fixed-sample rule and a finite-horizon sequential rule to a prescribed false-declaration probability, and study exact curtailment, which stops a fixed-pool rule once its final verdict is forced. We then derive how one-round declaration probabilities determine posterior-sample cost and classification accuracy along a sensing path. On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples. Among the evaluated rules at matched operating points, sequential stopping reduces the cost the most. At a high accuracy, that same sequential rule can trade more posterior samples for fewer measurements.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+  "raw_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3.json b/research/fog-of-knowledge/data/evidence/captures/370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3.json
new file mode 100644
index 000000000..052ae4b14
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-03008",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T15:46:01.612871+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T15:46:01Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.03008\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.03008</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>cs:cs:LO</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.03008</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Bombach</keyname>\n                        <forenames>Clemens</forenames>\n                </author>\n                <author>\n                    <keyname>Lakshmanan</keyname>\n                        <forenames>Rajmadan</forenames>\n                </author>\n                <author>\n                    <keyname>Ragni</keyname>\n                        <forenames>Marco</forenames>\n                </author>\n        </authors>\n        <title>Response Variability and Stability in Human Reasoning</title>\n            <categories>cs.LO cs.AI q-bio.NC</categories>\n            <comments>Accepted as full paper with talk at the 48th Annual Conference of the Cognitive Science Society (CogSci 2026). This version contains minor revisions</comments>\n            <journal-ref>Proceedings of the 48th Annual Meeting of the Cognitive Science Society (2026)</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science. We investigate the stability of response patterns within reasoners and whether variation in these patterns can be used to predict learning effects. We introduce a formal, geometry-based method to quantify distances between individual reasoning patterns and their internal variability, grounded in heuristic theories. The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains. Moreover, we find that reasoning patterns are stable over time within the same reasoner. The method is general enough to be applied to other reasoning domains.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+  "raw_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590.json b/research/fog-of-knowledge/data/evidence/captures/381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590.json
new file mode 100644
index 000000000..8bf9b90a4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-18060",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:54.140653+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.18060\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.18060</identifier>\n        <datestamp>2026-08-19</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.18060</id>\n        <created>2026-08-18</created>\n            <updated>2026-08-19</updated>\n        <authors>\n                <author>\n                    <keyname>Hirsch</keyname>\n                        <forenames>Dylan</forenames>\n                </author>\n                <author>\n                    <keyname>Sharpless</keyname>\n                        <forenames>William</forenames>\n                </author>\n                <author>\n                    <keyname>Lee</keyname>\n                        <forenames>Donggun</forenames>\n                </author>\n                <author>\n                    <keyname>Herbert</keyname>\n                        <forenames>Sylvia</forenames>\n                </author>\n        </authors>\n        <title>Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this work, we introduce the generalized reach-avoid (GRA) task, which both extends and unifies the canonical tasks of Hamilton-Jacobi Reachability (HJR). We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR. Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks. We additionally show that the GRA is also a natural primitive to consider from a PDE perspective, as it can be used to represent all sufficiently regular solutions of the HJ-PDE that is canonical to HJR. Collectively, the results in this work show the theoretical and practical utility of this task within the increasingly important framework of HJR.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+  "raw_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437.json b/research/fog-of-knowledge/data/evidence/captures/383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437.json
new file mode 100644
index 000000000..7a18bff6d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-25437",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:52.633236+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25437\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25437</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:CY</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25437</id>\n        <created>2026-09-21</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Alston</keyname>\n                        <forenames>Garrett</forenames>\n                </author>\n                <author>\n                    <keyname>Love</keyname>\n                        <forenames>Nancy</forenames>\n                </author>\n                <author>\n                    <keyname>Haider</keyname>\n                        <forenames>Rabab</forenames>\n                </author>\n        </authors>\n        <title>Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development</title>\n            <categories>eess.SY cs.CY cs.DC cs.SY</categories>\n            <comments>12 pages; 8 figures; 6 tables; appendix</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Data centers are being developed at an unprecedented pace, yet their energy and water impacts, and the spatial and temporal distribution of these impacts, remain poorly characterized. Data centers consume water for cooling (direct) and through electricity generation (indirect). Decisions on siting and cooling technology result in water-energy trade-offs that extend impacts beyond the facility&#39;s location. Existing assessment frameworks rely on facility efficiency metrics and average grid water intensity factors, suppressing the temporal impacts of data center load and generation availability. They also attribute indirect consumption to the facility&#39;s location rather than to the generators (and corresponding hydrologic regions) that respond to the added load, misattributing spatial impacts. To close this gap, we develop a computational model of the data center-energy-water nexus that links facility cooling and electricity demand with hourly economic dispatch, generator-level water consumption, and monthly subbasin depletion. Built on open-source data, the model resolves where and when water is consumed, and where this consumption compounds existing water risk or creates new risk. Using the model, we study different cooling configurations and proposed developments in the state of Michigan. Air-cooled data centers halve total water consumption relative to evaporative cooling, but increase electricity demand and raise indirect water consumption by one-third, shifting the water footprint from the facility to generators. Mapping these changes to subbasins reveals depletion increases beyond the data center sites, in regions that facility-level reporting may overlook. These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+  "raw_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82.json b/research/fog-of-knowledge/data/evidence/captures/3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82.json
new file mode 100644
index 000000000..6b0ee28fa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-23703",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:09.343753+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23703\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23703</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:CL</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>q-fin:q-fin:TR</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23703</id>\n        <created>2026-09-20</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Kirtac</keyname>\n                        <forenames>Kemal</forenames>\n                </author>\n        </authors>\n        <title>Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions</title>\n            <categories>cs.CL cs.LG q-fin.TR</categories>\n            <comments>47 pages. Revise and resubmit at Engineering Applications of Artificial Intelligence</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Financial language models can transform unstructured firm-specific news into structured decision signals, but financial AI research lacks an integrated deployment framework for evaluating whether those signals remain useful in financial decision systems. Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference. We introduce MFAST, a Market-Friction-Aware Sentiment-to-Trading framework that converts timestamped financial text into auditable, reproducible, and market-feasible trading decisions. The application is news-based trading, where firm-specific text must be linked to securities before portfolio decisions can be evaluated. The framework links Refinitiv News Analytics to Center for Research in Security Prices (CRSP) equity data, restricts the primary out-of-sample evaluation to post-release news outside disclosed foundation-model data-freshness periods, and adds a public replication arm using open financial text and public price data. Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost. The paper shows that credible evaluation of financial language models requires an end-to-end engineering approach combining language understanding, temporal discipline, market-friction-aware deployment, and reproducible validation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+  "raw_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28.json b/research/fog-of-knowledge/data/evidence/captures/40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28.json
new file mode 100644
index 000000000..7d15e2b6a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-21270",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:16.715742+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21270\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21270</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21270</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Malik</keyname>\n                        <forenames>Vikrant</forenames>\n                </author>\n                <author>\n                    <keyname>Kostina</keyname>\n                        <forenames>Victoria</forenames>\n                </author>\n                <author>\n                    <keyname>Hassibi</keyname>\n                        <forenames>Babak</forenames>\n                </author>\n        </authors>\n        <title>Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider the problem of H-infinity control in the presence of a digital communication channel between the observer and the controller and investigate the fundamental trade-off between the required communication data rate and H-infinity performance. The system follows linear dynamics and has no additive internal noise, so that the uncertainty is confined to the initial state. For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice. We further develop an achievability scheme and show that, for the scalar system, its rate matches the converse asymptotically in the high-data-rate limit.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+  "raw_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629.json b/research/fog-of-knowledge/data/evidence/captures/40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629.json
new file mode 100644
index 000000000..9ee358db3
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-28780",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:44.632649+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:44Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28780\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28780</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>cs:cs:HC</setSpec>\n            <setSpec>cs:cs:CY</setSpec>\n            <setSpec>econ:econ:GN</setSpec>\n            <setSpec>q-fin:q-fin:EC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28780</id>\n        <created>2026-07-30</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Rosendo-Rios</keyname>\n                        <forenames>Veronica</forenames>\n                </author>\n                <author>\n                    <keyname>Shukla</keyname>\n                        <forenames>Paurav</forenames>\n                </author>\n        </authors>\n        <title>Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement</title>\n            <categories>cs.HC cs.CY econ.GN q-fin.EC</categories>\n            <comments>Accepted for publication in Psychology &amp; Marketing (January 2026). 44 pages, 4 figures, 3 tables</comments>\n            <doi>10.1002/mar.70105</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models. However, little is known about how alternative advertising-supported monetization models can help GenAI firms recover costs while maintaining search query engagement. Drawing on the compromise effect and affective primacy theories, we develop a framework wherein the introduction of advertising-supported monetization models influences user upgrading and downgrading decisions, contingent on the number of available monetization options. Across four experiments (N=1063), findings reveal that introducing a single advertising-supported option enhances the compromise effect, encouraging free users to upgrade, but leading paid subscribers to downgrade. However, offering two advertising-supported models mitigates the effect, maintaining subscriber retention while still motivating free users to upgrade. We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects. We provide actionable insights for GenAI firms on potentially optimizing revenue strategies while balancing user engagement with search queries on their platform.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+  "raw_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2.json b/research/fog-of-knowledge/data/evidence/captures/40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2.json
new file mode 100644
index 000000000..ffd4eb7da
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-09080",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:37.107474+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:37Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09080\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09080</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09080</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents a non-orthogonal multiple access (NOMA)-enabled integrated sensing and communication (ISAC) framework for low-altitude wireless networks (LAWN), where an aerial access point simultaneously serves ground users and senses aerial targets. To improve both communication efficiency and sensing reliability, a matching-based user-target pairing (MUTP) scheme is proposed, in which strong and weak channel NOMA users are first paired into NOMA groups and then assigned to sensing targets according to a sensing-aware pairing criterion. Furthermore, an adaptive power allocation (APA) strategy is developed to balance communication quality-of-service requirements and target detection performance. The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA. Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN. Moreover, the proposed method closely approaches the exhaustive search benchmark while avoiding the high computational complexity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+  "raw_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03.json b/research/fog-of-knowledge/data/evidence/captures/454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03.json
new file mode 100644
index 000000000..c40d319a9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-04133",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:56.250227+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.04133\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.04133</identifier>\n        <datestamp>2026-08-06</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.04133</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-06</updated>\n        <authors>\n                <author>\n                    <keyname>Gkekas</keyname>\n                        <forenames>Angelos</forenames>\n                </author>\n                <author>\n                    <keyname>Papadopoulos</keyname>\n                        <forenames>Alexandros I.</forenames>\n                </author>\n                <author>\n                    <keyname>Pantazopoulos</keyname>\n                        <forenames>Petros Andreas</forenames>\n                </author>\n                <author>\n                    <keyname>Lalas</keyname>\n                        <forenames>Antonios</forenames>\n                </author>\n                <author>\n                    <keyname>Votis</keyname>\n                        <forenames>Konstantinos</forenames>\n                </author>\n                <author>\n                    <keyname>Liaskos</keyname>\n                        <forenames>Christos</forenames>\n                </author>\n        </authors>\n        <title>Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing</title>\n            <categories>cs.IT eess.SP math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+  "raw_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a.json b/research/fog-of-knowledge/data/evidence/captures/461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a.json
new file mode 100644
index 000000000..36e43a5b1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-28185",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:55.373356+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28185\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28185</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28185</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Chehreghani</keyname>\n                        <forenames>Mostafa Haghir</forenames>\n                </author>\n        </authors>\n        <title>Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks</title>\n            <categories>cs.LG cs.AI cs.IT math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Oversmoothing is a fundamental limitation of deep graph neural networks (GNNs), where repeated message passing causes node representations to become increasingly similar, eventually collapsing toward a low-dimensional subspace. This phenomenon limits the effective depth of message-passing architectures and motivates the search for mechanisms that preserve representation diversity. In this paper, we study a recurrent graph neural network in which independent Gaussian noise is injected after every propagation step and analyze the resulting architecture as a stochastic dynamical system. Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure. Our main theoretical result establishes an explicit positive lower bound on the expected stationary Dirichlet energy, proportional to both the noise variance and the spectral gap of the underlying graph. Consequently, the stationary representations cannot collapse onto the constant manifold, providing a rigorous guarantee that asymptotic oversmoothing is prevented in the sense of non-vanishing Dirichlet energy. Our analysis reveals persistent stochastic perturbations as a fundamentally different mechanism for combating oversmoothing, complementing existing deterministic approaches based on residual connections, normalization, and graph rewiring. Finally, numerical experiments on both linear and nonlinear recurrent graph neural networks closely match the theoretical predictions, illustrating the emergence of a stationary distribution and the predicted dependence of the limiting Dirichlet energy on the noise intensity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+  "raw_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3.json b/research/fog-of-knowledge/data/evidence/captures/46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3.json
new file mode 100644
index 000000000..2119242aa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-28224",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:51.954473+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28224\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28224</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28224</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Su</keyname>\n                        <forenames>Yanpeng</forenames>\n                </author>\n                <author>\n                    <keyname>Lübke</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Mengyu</forenames>\n                </author>\n                <author>\n                    <keyname>Franchi</keyname>\n                        <forenames>Norman</forenames>\n                </author>\n        </authors>\n        <title>CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents a Cramér-Rao lower bound (CRLB)-driven beamforming (BF) and power allocation (PA) framework for cooperative integrated sensing and communication (ISAC) networks, where a set of multi-antenna base stations (BSs) jointly serve multiple users and simultaneously perform multi-static target estimation. In our design, we investigate how the position error bound (PEB) and velocity error bound (VEB) can be exploited and incorporated into BF and PA optimization. The design leveraging PEB and VEB as metrics directly characterizes sensing accuracy. First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions. Addressing the complexity, we further develop a two-stage PA algorithm, where the communication and sensing beams are formed by the regularized zero-forcing (RZF) and null-space projection (NSP) methods, respectively, and the communication and sensing PAs are solved sequentially by second-order cone programming (SOCP). Although the PA algorithm sacrifices the degrees of freedom, its performance shows a slight gap compared to BF in the simulation, while the execution time of around 25 ms demonstrates its applicability in dynamic environments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+  "raw_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301.json b/research/fog-of-knowledge/data/evidence/captures/4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301.json
new file mode 100644
index 000000000..aa87c5247
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-06163",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:03.196691+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:03Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.06163\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.06163</identifier>\n        <datestamp>2026-09-09</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.06163</id>\n        <created>2026-09-05</created>\n            <updated>2026-09-09</updated>\n        <authors>\n                <author>\n                    <keyname>Vu</keyname>\n                        <forenames>Tien Dat</forenames>\n                </author>\n                <author>\n                    <keyname>Doan</keyname>\n                        <forenames>Minh</forenames>\n                </author>\n        </authors>\n        <title>Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>16 pages, 8 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The leader-follower formation control problem is investigated for nonlinear multi-agent systems with unknown dynamics, external disturbances, and false data injection (FDI) attacks on actuator channels. The problem is formulated as a zero-sum differential game and solved using the Integral Bellman-Isaacs approach. To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law. Furthermore, this paper proposes a cost function construction method and develops a critic learning law, which together guarantee the practical fixed-time stability of the system while overcoming the limitations of existing fixed-time reinforcement learning formulations. Finally, the practical fixed-time convergence of both the critic weight estimation error and the leader-referenced formation tracking error to bounded residual sets is rigorously proven. Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+  "raw_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757.json b/research/fog-of-knowledge/data/evidence/captures/50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757.json
new file mode 100644
index 000000000..e30f781cf
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-26093",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:17.079904+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.26093\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.26093</identifier>\n        <datestamp>2026-08-27</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.26093</id>\n        <created>2026-08-26</created>\n            <updated>2026-08-27</updated>\n        <authors>\n                <author>\n                    <keyname>Khan</keyname>\n                        <forenames>Ahmad</forenames>\n                </author>\n                <author>\n                    <keyname>Sediq</keyname>\n                        <forenames>Akram Bin</forenames>\n                </author>\n                <author>\n                    <keyname>Naeini</keyname>\n                        <forenames>Sara Azadegi</forenames>\n                </author>\n                <author>\n                    <keyname>Adve</keyname>\n                        <forenames>Raviraj S.</forenames>\n                </author>\n        </authors>\n        <title>Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher&#39;s Role</title>\n            <categories>cs.LG cs.IT cs.SY eess.SY math.IT</categories>\n            <comments>Submitted to IEEE Globecom Workshops</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Designing machine learning algorithms for wireless resource management is labour-intensive: the architecture, the loss function and the training recipe are all specified by hand. We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety. We adopt the autoresearch protocol, in which an AI coding agent edits a training script, runs a fixed-budget experiment, and retains or discards the change according to a single immutable metric. We grant the agent authority over the architecture family, the input representation, the output parameterization, the loss function and the task-sampling law, and set it a target chosen for its difficulty: sum-least-percentile-rate power control across a multicell network. The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex. Safeguards render the results trustworthy: a hash-pinned evaluator, an enforced inference contract and a pre-registered falsifier per experiment. In eighty-one unattended experiments over twenty-six hours, the agent reached $99.5\\%$ of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly $600\\times$ lower inference cost, closing $94\\%$ of the gap from its first working architecture, with one parameter set serving every network size and percentile target. It recovered provable structure rather than tuned constants: the output parameterization it discovered reproduces the exact max-min-optimal allocation at the minimum percentile, for every value of the trained weights.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+  "raw_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a.json b/research/fog-of-knowledge/data/evidence/captures/50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a.json
new file mode 100644
index 000000000..09c9c7f2f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-12037",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:03.007866+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12037\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12037</identifier>\n        <datestamp>2026-08-13</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12037</id>\n        <created>2026-08-12</created>\n            <updated>2026-08-13</updated>\n        <authors>\n                <author>\n                    <keyname>Figueiredo</keyname>\n                        <forenames>Eduardo</forenames>\n                </author>\n                <author>\n                    <keyname>Mathiesen</keyname>\n                        <forenames>Frederik</forenames>\n                </author>\n                <author>\n                    <keyname>Schumann</keyname>\n                        <forenames>Julian</forenames>\n                </author>\n                <author>\n                    <keyname>Kober</keyname>\n                        <forenames>Jens</forenames>\n                </author>\n                <author>\n                    <keyname>Zgonnikov</keyname>\n                        <forenames>Arkady</forenames>\n                </author>\n                <author>\n                    <keyname>Laurenti</keyname>\n                        <forenames>Luca</forenames>\n                </author>\n        </authors>\n        <title>Clustered Randomized Smoothing for Stochastic Prediction Functions</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Modern stochastic predictors can model rich, multi-modal outcome distributions. However, this expressive power comes with challenges in ensuring robust predictions $-$ a critical requirement in safety-critical domains. Randomized smoothing is a leading technique for improving robustness, particularly against adversarial perturbations. Yet, in stochastic multi-modal regression settings, randomized smoothing often fails due to mode collapse, yielding averaged predictions that do not reflect the underlying distribution. To address this limitation, we propose clustered $α$-smoothing, a framework that (1) partitions noisy samples using an arbitrary clustering algorithm, (2) applies $α$-smoothing locally within each cluster, and (3) combines the resulting predictions into a mixture distribution. By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes. We empirically evaluate our framework on two benchmarks, demonstrating substantial improvements over state-of-the-art methods. In stochastic trajectory prediction on a driving simulator dataset, our approach achieves, on average, a $27\\%$ lower Wasserstein distance to the ground-truth distribution compared to $α$-smoothing. In quadrotor control, where modes correspond to distinct feasible paths to a target, our method reduces the collision rate by $81\\%$ relative to the state-of-the-art randomized smoothing.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+  "raw_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec.json b/research/fog-of-knowledge/data/evidence/captures/50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec.json
new file mode 100644
index 000000000..31286ee1e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-10825",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:15.336482+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:15Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.10825\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.10825</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.10825</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Jinwen</forenames>\n                </author>\n                <author>\n                    <keyname>Che</keyname>\n                        <forenames>Yunhong</forenames>\n                </author>\n                <author>\n                    <keyname>Onori</keyname>\n                        <forenames>Simona</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Weihan</forenames>\n                </author>\n                <author>\n                    <keyname>Hu</keyname>\n                        <forenames>Xiaosong</forenames>\n                </author>\n        </authors>\n        <title>Cross-modal topology decodes battery faults from sparse voltage snapshots</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>33 pages, 12 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements. Existing methods struggle to resolve the signal ambiguity between overlapping fault modes without hardware upgrades. Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots. We introduce DeFault, a cross-modal diagnostic framework that mathematically unfolds one-dimensional voltage sequences into multi-dimensional phase-space topologies. DeFault employs a bidirectional cross-attention mechanism that acts as an autonomous, physics-aligned filter, explicitly decoding compounded fault modes that remain fundamentally invisible to sequence-based methods. Validated on a field dataset of 16.4 million data records from 99 in-service EVs, our method achieves an average accuracy of 0.96 and an F1 score of 0.84 for four fault types using only 500-second snapshots (spanning &lt;100 mV). This work proves that high-fidelity, interpretable electrochemical diagnosis is achievable on legacy fleets without new sensors, providing a scalable solution for the battery safety crisis.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+  "raw_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3.json b/research/fog-of-knowledge/data/evidence/captures/52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3.json
new file mode 100644
index 000000000..21805b971
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-26924",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:42.359389+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:42Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.26924\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.26924</identifier>\n        <datestamp>2026-09-24</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.26924</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-24</updated>\n        <authors>\n                <author>\n                    <keyname>Harsy</keyname>\n                        <forenames>Constantin Ulrich</forenames>\n                </author>\n                <author>\n                    <keyname>Wald</keyname>\n                        <forenames>Tassilo</forenames>\n                </author>\n                <author>\n                    <keyname>Gotkowski</keyname>\n                        <forenames>Karol</forenames>\n                </author>\n                <author>\n                    <keyname>Kirchhoff</keyname>\n                        <forenames>Yannick</forenames>\n                </author>\n                <author>\n                    <keyname>Knopp</keyname>\n                        <forenames>Marcel</forenames>\n                </author>\n                <author>\n                    <keyname>Rokuss</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Stegmeier</keyname>\n                        <forenames>Elisa</forenames>\n                </author>\n                <author>\n                    <keyname>Schader</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n                <author>\n                    <keyname>Trofimova</keyname>\n                        <forenames>Dasha</forenames>\n                </author>\n                <author>\n                    <keyname>Stock</keyname>\n                        <forenames>Raphael</forenames>\n                </author>\n                <author>\n                    <keyname>Kahl</keyname>\n                        <forenames>Kim-Celine</forenames>\n                </author>\n                <author>\n                    <keyname>Schaumann</keyname>\n                        <forenames>Stephen</forenames>\n                </author>\n                <author>\n                    <keyname>Erkan</keyname>\n                        <forenames>Selen</forenames>\n                </author>\n                <author>\n                    <keyname>Zimmerer</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Denner</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Langenberg</keyname>\n                        <forenames>Moritz</forenames>\n                </author>\n                <author>\n                    <keyname>Ziegler</keyname>\n                        <forenames>Sebastian</forenames>\n                </author>\n                <author>\n                    <keyname>Eckstein</keyname>\n                        <forenames>Katharina</forenames>\n                </author>\n                <author>\n                    <keyname>Fischer</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Suprijadi</keyname>\n                        <forenames>Jonathan</forenames>\n                </author>\n                <author>\n                    <keyname>Kovács</keyname>\n                        <forenames>Bálint</forenames>\n                </author>\n                <author>\n                    <keyname>Hamm</keyname>\n                        <forenames>Benjamin</forenames>\n                </author>\n                <author>\n                    <keyname>Deshpande</keyname>\n                        <forenames>Anand</forenames>\n                </author>\n                <author>\n                    <keyname>Bounias</keyname>\n                        <forenames>Dimitrios</forenames>\n                </author>\n                <author>\n                    <keyname>Disch</keyname>\n                        <forenames>Nico</forenames>\n                </author>\n                <author>\n                    <keyname>Xiao</keyname>\n                        <forenames>Shuhan</forenames>\n                </author>\n                <author>\n                    <keyname>Kächele</keyname>\n                        <forenames>Jessica</forenames>\n                </author>\n                <author>\n                    <keyname>Sellner</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>Baidya</keyname>\n                        <forenames>Rajesh</forenames>\n                </author>\n                <author>\n                    <keyname>Traub</keyname>\n                        <forenames>Jeremias</forenames>\n                </author>\n                <author>\n                    <keyname>Krämer</keyname>\n                        <forenames>Lars</forenames>\n                </author>\n                <author>\n                    <keyname>Zenk</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Rädsch</keyname>\n                        <forenames>Tim</forenames>\n                </author>\n                <author>\n                    <keyname>Dvoretskii</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Peretzke</keyname>\n                        <forenames>Robin</forenames>\n                </author>\n                <author>\n                    <keyname>Deissler</keyname>\n                        <forenames>Jonathan</forenames>\n                </author>\n                <author>\n                    <keyname>Ertl</keyname>\n                        <forenames>Alexandra</forenames>\n                </author>\n                <author>\n                    <keyname>Ghosh</keyname>\n                        <forenames>Partha</forenames>\n                </author>\n                <author>\n                    <keyname>Dreher</keyname>\n                        <forenames>Kris</forenames>\n                </author>\n                <author>\n                    <keyname>Dinkelacker</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Reinke</keyname>\n                        <forenames>Annika</forenames>\n                </author>\n                <author>\n                    <keyname>Christodoulou</keyname>\n                        <forenames>Evangelia</forenames>\n                </author>\n                <author>\n                    <keyname>Saeed</keyname>\n                        <forenames>Numan</forenames>\n                </author>\n                <author>\n                    <keyname>Savriama</keyname>\n                        <forenames>Yoland</forenames>\n                </author>\n                <author>\n                    <keyname>Estrada</keyname>\n                        <forenames>Santiago</forenames>\n                </author>\n                <author>\n                    <keyname>Kügler</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Barragan</keyname>\n                        <forenames>Laura Alexandra Daza</forenames>\n                </author>\n                <author>\n                    <keyname>Osorio</keyname>\n                        <forenames>Cristina Isabel Gonzalez</forenames>\n                </author>\n                <author>\n                    <keyname>Peeken</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>Baumgartner</keyname>\n                        <forenames>Michael</forenames>\n                </author>\n                <author>\n                    <keyname>Teichmann</keyname>\n                        <forenames>Marvin</forenames>\n                </author>\n                <author>\n                    <keyname>Chabin</keyname>\n                        <forenames>Guillaume</forenames>\n                </author>\n                <author>\n                    <keyname>Kirchler</keyname>\n                        <forenames>Matthias</forenames>\n                </author>\n                <author>\n                    <keyname>Koch</keyname>\n                        <forenames>Valentin</forenames>\n                </author>\n                <author>\n                    <keyname>study</keyname>\n                        <forenames>for the ALFA</forenames>\n                </author>\n                <author>\n                    <keyname>Hohenhaus</keyname>\n                        <forenames>Markus</forenames>\n                </author>\n                <author>\n                    <keyname>Koslov</keyname>\n                        <forenames>Dimitri</forenames>\n                </author>\n                <author>\n                    <keyname>Decker</keyname>\n                        <forenames>Nina</forenames>\n                </author>\n                <author>\n                    <keyname>Yaqub</keyname>\n                        <forenames>Mohammad</forenames>\n                </author>\n                <author>\n                    <keyname>Heuser</keyname>\n                        <forenames>Arnd</forenames>\n                </author>\n                <author>\n                    <keyname>Reuter</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Schnabel</keyname>\n                        <forenames>Julia A.</forenames>\n                </author>\n                <author>\n                    <keyname>Heimann</keyname>\n                        <forenames>Tobias</forenames>\n                </author>\n                <author>\n                    <keyname>Ghesu</keyname>\n                        <forenames>Florin</forenames>\n                </author>\n                <author>\n                    <keyname>Brachmann</keyname>\n                        <forenames>Paul</forenames>\n                </author>\n                <author>\n                    <keyname>Heußel</keyname>\n                        <forenames>Claus P.</forenames>\n                </author>\n                <author>\n                    <keyname>Radbruch</keyname>\n                        <forenames>Alexander</forenames>\n                </author>\n                <author>\n                    <keyname>Brugnara</keyname>\n                        <forenames>Gianluca</forenames>\n                </author>\n                <author>\n                    <keyname>Rastogi</keyname>\n                        <forenames>Aditya</forenames>\n                </author>\n                <author>\n                    <keyname>Foltyn-Dumitru</keyname>\n                        <forenames>Martha</forenames>\n                </author>\n                <author>\n                    <keyname>Schlemmer</keyname>\n                        <forenames>Heinz-Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Reicht</keyname>\n                        <forenames>Ignaz</forenames>\n                </author>\n                <author>\n                    <keyname>Holzschuh</keyname>\n                        <forenames>Julius C.</forenames>\n                </author>\n                <author>\n                    <keyname>Bach</keyname>\n                        <forenames>Michael</forenames>\n                </author>\n                <author>\n                    <keyname>Stieltjes</keyname>\n                        <forenames>Bram</forenames>\n                </author>\n                <author>\n                    <keyname>Schlamp</keyname>\n                        <forenames>Kai</forenames>\n                </author>\n                <author>\n                    <keyname>Maier-Hein</keyname>\n                        <forenames>Lena</forenames>\n                </author>\n                <author>\n                    <keyname>Nolden</keyname>\n                        <forenames>Marco</forenames>\n                </author>\n                <author>\n                    <keyname>Floca</keyname>\n                        <forenames>Ralf</forenames>\n                </author>\n                <author>\n                    <keyname>Jäger</keyname>\n                        <forenames>Paul F.</forenames>\n                </author>\n                <author>\n                    <keyname>Vollmuth</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n                <author>\n                    <keyname>Isensee</keyname>\n                        <forenames>Fabian</forenames>\n                </author>\n                <author>\n                    <keyname>Maier-Hein</keyname>\n                        <forenames>Klaus H.</forenames>\n                </author>\n        </authors>\n        <title>nnFoundation: 3D Foundation Models for Radiology</title>\n            <categories>cs.CV eess.IV</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift. Foundation models promise more transferable and data-efficient solutions, but existing approaches are limited in scale, evaluated narrowly, and often assume that a single pretrained model can support diverse downstream tasks. Here we present nnFoundation, complementary convolutional and transformer-based 3D radiological foundation models. Developed within the Human Radiome Project (THRP), nnFoundation is trained on 2.1 million CT, MRI, and PET image volumes from 125 institutional and public datasets. We evaluate them across 108 tasks spanning segmentation, detection, classification, report generation, and image retrieval, including evaluations under domain shift, by external partners and in low-data and low-compute regimes. Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging. However, performance follows a consistent task-dependent structure: the convolutional nnFoundation model dominates spatially localized tasks, whereas the transformer-based nnFoundation model excels in tasks requiring global semantic reasoning and in frozen-feature settings. Dynamically aligning the foundation model topology with the dataset characteristics post-hoc further improves transfer across heterogeneous 3D settings. These results show that transferable 3D radiological performance is governed not by a single universal model, but by the interplay of scalable pretraining, complementary architectures, and dataset-aware adaptation. We release nnFoundation models integrated into nnU-Net and nnDetection, enabling immediate application across established radiology workflows.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+  "raw_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6.json b/research/fog-of-knowledge/data/evidence/captures/536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6.json
new file mode 100644
index 000000000..022382bde
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-08744",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:44.369404+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:44Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.08744\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.08744</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.08744</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In sixth-generation (6G) networks, supporting ultra-reliable low-latency communication (URLLC) services imposes stringent requirements on reliability, latency, and efficient resource utilization. The upper mid-band (FR3) spectrum has emerged as a promising candidate due to its favorable trade-off between coverage and bandwidth availability. However, achieving high reliability in dense deployments remains challenging due to interference and propagation impairments. To address these challenges, this paper investigates a reconfigurable intelligent surface (RIS)-assisted network operating in the FR3 band. We formulate a joint transmit power allocation and user equipment (UE)-RIS association problem to maximize network reliability under finite blocklength constraints. The resulting problem is nonconvex and combinatorial due to interference coupling and binary association variables. To solve this problem efficiently, we propose a multiphase resource allocation framework that integrates a successive convex approximation (SCA)-based power optimization scheme with a matching theory-based UE-RIS association algorithm. Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+  "raw_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1.json b/research/fog-of-knowledge/data/evidence/captures/5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1.json
new file mode 100644
index 000000000..46b3b925a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-25526",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:29:54.632518+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:29:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.25526\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.25526</identifier>\n        <datestamp>2026-07-29</datestamp>\n            <setSpec>cs:cs:CY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.25526</id>\n        <created>2026-07-28</created>\n            <updated>2026-07-29</updated>\n        <authors>\n                <author>\n                    <keyname>Chupilkin</keyname>\n                        <forenames>Maxim</forenames>\n                </author>\n        </authors>\n        <title>Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data</title>\n            <categories>cs.CY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>How should researchers measure the geopolitical preferences expressed by large language models (LLMs)? Existing audits commonly rely on surveys and simple tests, but international-relations research has long recognized that measuring geopolitical preferences is difficult and has developed methods for recovering them from observed choices. This paper applies a dynamic ordinal ideal-point approach from international relations, treating LLMs as respondents to the full texts of 5,555 divisive, recorded, adopted resolutions considered in regular sessions of the UN General Assembly from 1946 through 2025. Support ranges from 37.8% for DeepSeek to 97.3% for GPT-5. Surprisingly, in the twenty-first century, GPT-5, Claude Sonnet, and Gemini are closest among the permanent five to Russia; DeepSeek is closest to France; and all four are farthest from the United States. Among 2,104 resolutions opposed by the United States but supported by China and Russia/USSR, GPT-5 supported 96.1%, Gemini 83.4%, Claude Sonnet 65.2%, and DeepSeek 36.1%. The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+  "raw_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0.json b/research/fog-of-knowledge/data/evidence/captures/5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0.json
new file mode 100644
index 000000000..9ec01d500
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04776",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:59.302987+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T20:37:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04776\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04776</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:NI</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04776</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Zehua</forenames>\n                </author>\n                <author>\n                    <keyname>Adve</keyname>\n                        <forenames>Raviraj</forenames>\n                </author>\n                <author>\n                    <keyname>Bahceci</keyname>\n                        <forenames>Israfil</forenames>\n                </author>\n                <author>\n                    <keyname>Ahmed</keyname>\n                        <forenames>Yahia</forenames>\n                </author>\n        </authors>\n        <title>Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks</title>\n            <categories>cs.IT cs.NI cs.SY eess.SY math.IT math.OC</categories>\n            <comments>To be presented at 2026 IEEE Globecom Workshops, 6 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+  "raw_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80.json b/research/fog-of-knowledge/data/evidence/captures/5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80.json
new file mode 100644
index 000000000..7e0999978
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-16899",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:35.437678+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:35Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16899\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16899</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16899</id>\n        <created>2026-09-15</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Fernandez-Zapico</keyname>\n                        <forenames>Diego</forenames>\n                </author>\n                <author>\n                    <keyname>Vehlhaber</keyname>\n                        <forenames>Finn</forenames>\n                </author>\n                <author>\n                    <keyname>Izadi</keyname>\n                        <forenames>Maedeh</forenames>\n                </author>\n                <author>\n                    <keyname>Hofman</keyname>\n                        <forenames>Theo</forenames>\n                </author>\n                <author>\n                    <keyname>Salazar</keyname>\n                        <forenames>Mauro</forenames>\n                </author>\n        </authors>\n        <title>Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+  "raw_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b.json b/research/fog-of-knowledge/data/evidence/captures/5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b.json
new file mode 100644
index 000000000..948e98995
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-14144",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:36.479246+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.14144\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.14144</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.14144</id>\n        <created>2026-07-31</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Wenhui</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Jianlin</forenames>\n                </author>\n                <author>\n                    <keyname>Lin</keyname>\n                        <forenames>Ziyao</forenames>\n                </author>\n                <author>\n                    <keyname>Vong</keyname>\n                        <forenames>Chi Man</forenames>\n                </author>\n        </authors>\n        <title>The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale</title>\n            <categories>cs.AI cs.IT math.IT</categories>\n            <comments>43 pages, 16 figures. v2: title now names the hypothesis (CCH); postscript on two post-registration frontier releases (Kimi-K3, Qwen3.8-Max) with a registered forward prediction; new citations and consistency fixes. Registered census statistics and experimental results unchanged. Code and data: https://github.com/wenhui-ml/Capability-Convergence-Hypothesis (DOI: 10.5281/zenodo.21714418)</comments>\n            <acm-class>None</acm-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The Platonic Representation Hypothesis (PRH) holds that as models scale, representations of heterogeneous networks converge toward a shared model of reality. We propose its sequel and boundary, the Capability Convergence Hypothesis (CCH): under a fixed per-token inference budget, representational convergence does not entail capability convergence. Capability instead converges toward a class, the access-complete hybrid: any architecture holding both a compressive O(1)-state channel and a scalable verbatim-index channel. We anchor it on a witness task, the Newton&#39;s-apple problem in an infinite stream, and name three resource walls: a Shannon wall barring any o(Nb)-state architecture, a horizon wall barring any fixed window, and a circuit wall barring fixed-depth attention-only composition (conditional on TC0 != NC1). Under an explicit separability assumption a hybrid crosses all three by paying each wall&#39;s price, so capability is strictly super-additive under composition. We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture. We report the first pre-registered small-scale tests under criteria frozen before the data: the predicted scissors gap is measured (exact-retrieval error 0.994 vs. 0.000 once a 64-scalar state gains one global-attention layer), the state-tracking bifurcation lands at the registered boundary, and a conjunction witness shows an irreducibly two-channel solution; one prediction failed with its direction reversed and is reported as such. Representational convergence is given freely by scale; capability convergence must be purchased by access structure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+  "raw_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180.json b/research/fog-of-knowledge/data/evidence/captures/61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180.json
new file mode 100644
index 000000000..1dd331789
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-22615",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:09.841758+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.22615\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.22615</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.22615</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Guo</keyname>\n                        <forenames>Guangpu</forenames>\n                </author>\n                <author>\n                    <keyname>Xia</keyname>\n                        <forenames>Xiang-Gen</forenames>\n                </author>\n        </authors>\n        <title>Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The Chinese remainder theorem (CRT) is highly sensitive to remainder errors. Robust CRT addresses this problem by recovering the folding integers correctly from erroneous remainders, so that the final reconstruction error is bounded by the remainder error level. The existing dynamic range--robustness tradeoff results mainly assume a uniform remainder error bound, where all remainders share one scalar error bound. This paper studies the exact tradeoff when the remainder error bound is a vector in the sense that different remainders may have different error bounds. For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination. Based on this condition, we characterize the largest admissible range length, called the dynamic range, for a given remainder error bound vector. Conversely, for a given range length, we characterize all remainder error bound vectors under which remainder errors can be tolerated. We also give an exact folding integer vector decoding algorithm. We show that the proposed results reduce to the classical CRT in the error-free case and coincide with the known result when all remainder error bounds are equal. Numerical results show that the dynamic range depends on the full remainder error bound vector. They also show that the remainders are coupled in the robustness, which cannot be captured by a single uniform error bound.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+  "raw_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3.json b/research/fog-of-knowledge/data/evidence/captures/68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3.json
new file mode 100644
index 000000000..e0b7917ab
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-24423",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:30:23.303727+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.24423\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.24423</identifier>\n        <datestamp>2026-07-28</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.24423</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-28</updated>\n        <authors>\n                <author>\n                    <keyname>Van Liedekerke</keyname>\n                        <forenames>Ambra</forenames>\n                </author>\n                <author>\n                    <keyname>Zapparoli</keyname>\n                        <forenames>Lorenzo</forenames>\n                </author>\n                <author>\n                    <keyname>Herrera</keyname>\n                        <forenames>María Parajeles</forenames>\n                </author>\n                <author>\n                    <keyname>Gjorgiev</keyname>\n                        <forenames>Blazhe</forenames>\n                </author>\n                <author>\n                    <keyname>Hug</keyname>\n                        <forenames>Gabriela</forenames>\n                </author>\n                <author>\n                    <keyname>Sansavini</keyname>\n                        <forenames>Giovanni</forenames>\n                </author>\n        </authors>\n        <title>Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels</title>\n            <categories>eess.SY cs.SY physics.soc-ph</categories>\n            <comments>16 pages, 8 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems. Research on EV charging flexibility in future power systems has largely focused on either the transmission or the distribution level, with limited integration between the two. However, these two scales cannot be separated: EV charging optimized at the national transmission level for system-wide planning is ultimately activated in local distribution grids, where it may cause voltage and loading issues. This study bridges that gap by evaluating EV charging flexibility across both grid levels, using two different control approaches. First, a top-down approach disaggregates the optimal charging demand obtained from a centralized planner at the transmission grid down to the distribution grid, explicitly accounting for grid constraints and individual driving requirements. Second, a bottom-up approach optimizes EV charging locally under distribution-grid constraints using electricity price signals from the centralized planning model. Controlled charging from the top-down and bottom-up approaches is then compared with uncontrolled charging. Results show that the top-down approach produces EV charging schedules that are compatible with individual driving behavior and reduce grid violations compared to uncontrolled charging. The bottom-up approach identifies an optimal profile similar to the centrally optimized profile, showing that electricity price signals are a suitable coordination mechanism. These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+  "raw_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec.json b/research/fog-of-knowledge/data/evidence/captures/6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec.json
new file mode 100644
index 000000000..fb31908d9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-02071",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:10.062628+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.02071\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.02071</identifier>\n        <datestamp>2026-09-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.02071</id>\n        <created>2026-09-02</created>\n            <updated>2026-09-03</updated>\n        <authors>\n                <author>\n                    <keyname>Schiller</keyname>\n                        <forenames>Julian D.</forenames>\n                </author>\n                <author>\n                    <keyname>Müller</keyname>\n                        <forenames>Matthias A.</forenames>\n                </author>\n        </authors>\n        <title>Turnpike properties in nonlinear system identification</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We analyze the problem of learning general discrete-time nonlinear state-space models using the simulation error minimization (SEM) method. In this setting, model parameters are typically learned by minimizing the mismatch between simulated and measured outputs over a training dataset, or shorter subsequences extracted from it. Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state. In the presence of non-unique optimal output sequences---as may arise, for instance, in fully black-box system identification using neural networks---the property is formulated with respect to the closest such sequence. Turnpike behavior is generally desirable in practice, as it provides a theoretical justification for employing computationally more tractable SEM formulations with fixed initial states while ensuring that their optimal output sequences remain close to unconstrained optimal ones. Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity. We additionally introduce a cardinality turnpike property and show that it is strictly weaker than the cumulative notion. Finally, we establish sufficient conditions for turnpike behavior based on incremental output stability, convexity of the stage cost, and a suitable optimality condition, and illustrate the theory by means of a numerical example.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+  "raw_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736.json b/research/fog-of-knowledge/data/evidence/captures/6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736.json
new file mode 100644
index 000000000..12fec08f9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04959",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:30.351882+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-09T16:30:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04959\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04959</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>cs:cs:CE</setSpec>\n            <setSpec>q-fin:q-fin:CP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04959</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Jin</keyname>\n                        <forenames>Yanzheng</forenames>\n                </author>\n                <author>\n                    <keyname>Shao</keyname>\n                        <forenames>Pengyang</forenames>\n                </author>\n                <author>\n                    <keyname>Ma</keyname>\n                        <forenames>Yunshan</forenames>\n                </author>\n                <author>\n                    <keyname>Pan</keyname>\n                        <forenames>Haowen</forenames>\n                </author>\n                <author>\n                    <keyname>Zhai</keyname>\n                        <forenames>Naixin</forenames>\n                </author>\n                <author>\n                    <keyname>Song</keyname>\n                        <forenames>Chen-Hui</forenames>\n                </author>\n                <author>\n                    <keyname>Shen</keyname>\n                        <forenames>Fei</forenames>\n                </author>\n                <author>\n                    <keyname>Kawaguchi</keyname>\n                        <forenames>Kenji</forenames>\n                </author>\n        </authors>\n        <title>AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion</title>\n            <categories>cs.CE q-fin.CP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Formulaic alpha discovery seeks symbolic expressions that predict cross-sectional asset returns. In deployment, multiple formulas are combined into an alpha pool, where each formula is valued through the complementary information it contributes to joint predictive performance. While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges. First, generating formulas individually leaves pool context and inter-formula complementarity outside the generative state. Second, formula-wise generation lacks a unified mechanism for preserving and revising structures at different levels. Third, pool-level rewards jointly reflect predictive performance and redundancy but cannot be differentiated directly through symbolic evaluation to train the generator. To overcome these challenges, we introduce AlphaPADI (Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion), a novel framework built around three components: (1) grammar-constrained buffer initialization that constructs syntactically valid pool candidates, (2) pool-aware hierarchical diffusion that reconstructs complete pools at multiple structural scales under the current pool context, and (3) reward-guided pool refinement that evaluates joint predictive performance and inner diversity, updates the elite buffer, and trains the reverse model through reconstruction and preference learning. Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+  "raw_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9.json b/research/fog-of-knowledge/data/evidence/captures/70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9.json
new file mode 100644
index 000000000..e8a19da8c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04697",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:25:52.277682+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04697\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04697</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04697</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Qian</keyname>\n                        <forenames>William</forenames>\n                </author>\n                <author>\n                    <keyname>Pehlevan</keyname>\n                        <forenames>Cengiz</forenames>\n                </author>\n        </authors>\n        <title>Efficiency and robustness partition the solution space for memory in recurrent networks</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function. However, these networks are subject to inductive biases that may be misaligned with those of biological circuits, which operate under various efficiency and robustness constraints. Here, using a minimal stimulus recall task, we systematically characterize how the solution space of recurrent neural networks is shaped by the desiderata of weight efficiency, activity efficiency, and robustness to noise. We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification. Moreover, we find that activity efficient solutions exhibit a strong dissociation between high-variance modes of activity and those that causally influence network output. Unlike in static feedforward settings, we demonstrate that noise robustness and activity efficiency are generally in opposition, rather than synergistic. Using these findings, we propose a normative account of misaligned coding phenomena recently identified in premotor cortex.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+  "raw_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e.json b/research/fog-of-knowledge/data/evidence/captures/723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e.json
new file mode 100644
index 000000000..0dcfe3e3a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-05749",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:42.323931+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:42Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.05749\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.05749</identifier>\n        <datestamp>2026-09-15</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:ET</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.05749</id>\n        <created>2026-09-13</created>\n            <updated>2026-09-15</updated>\n        <authors>\n                <author>\n                    <keyname>Barkett</keyname>\n                        <forenames>Emilio</forenames>\n                </author>\n                <author>\n                    <keyname>Kimpton</keyname>\n                        <forenames>Alexander</forenames>\n                </author>\n                <author>\n                    <keyname>Graham</keyname>\n                        <forenames>Daniel</forenames>\n                </author>\n                <author>\n                    <keyname>Kundgol</keyname>\n                        <forenames>Yusuf</forenames>\n                </author>\n        </authors>\n        <title>The Normalization of Deviance in AI Development</title>\n            <categories>cs.AI cs.ET cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values. Far less attention has been paid to the organizational level---to whether the institutions building these systems are themselves predisposed to drift toward failure. This paper argues that they are. Regardless of how capable AI systems become, the organizations building them face the same structural dynamics that preceded past major technological disasters. Drawing on case studies of the Space Shuttle Challenger, the Three Mile Island accident, and the Boeing 737 MAX crashes, this paper identifies the common structural mechanisms preceding each failure and maps them onto contemporary AI development. The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes. The pre-disaster period of AI development is still underway; the purpose of this paper is to make these dynamics legible while they can still be interrupted.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+  "raw_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad.json b/research/fog-of-knowledge/data/evidence/captures/728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad.json
new file mode 100644
index 000000000..6ef594625
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-12592",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:14.554610+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T16:53:48Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12592\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12592</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12592</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>de Oliveira</keyname>\n                        <forenames>Daniel V. C.</forenames>\n                </author>\n                <author>\n                    <keyname>Alcantara</keyname>\n                        <forenames>Daniel C.</forenames>\n                </author>\n                <author>\n                    <keyname>Asim</keyname>\n                        <forenames>Fazal. E</forenames>\n                </author>\n                <author>\n                    <keyname>de Almeida</keyname>\n                        <forenames>Andre L. F.</forenames>\n                </author>\n                <author>\n                    <keyname>Fodor</keyname>\n                        <forenames>Gabor</forenames>\n                </author>\n        </authors>\n        <title>Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>This paper introduces an enhanced channel estimation method for reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) communications. Considering the presence of both the direct link from the base station (BS) to the user equipment (UE) and the indirect link \\textit{via} the RIS, we formulate a tensor-based receiver for joint direct and indirect channel estimation called the TenDICE algorithm. The proposed receiver relies on an extended parallel factor analysis (PARAFAC) tensor model for the received pilot signals, from which the involved (direct and indirect link) channels are estimated using a simple alternating least squares scheme. The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE). The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+  "raw_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106.json b/research/fog-of-knowledge/data/evidence/captures/76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106.json
new file mode 100644
index 000000000..5cb8a05aa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-02976",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:14.377224+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:14Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02976\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02976</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02976</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Salimi</keyname>\n                        <forenames>Arastoo H</forenames>\n                </author>\n                <author>\n                    <keyname>Dehghani</keyname>\n                        <forenames>Majid</forenames>\n                </author>\n                <author>\n                    <keyname>Nazaripouya</keyname>\n                        <forenames>Hamidreza</forenames>\n                </author>\n        </authors>\n        <title>Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper proposes a novel automated decision-support framework aimed at enhancing the resilience of power systems and operational resilience against wildfires by formulating the decision-making process as a stochastic multi-stage programming during a progressive wildfire. The paper develops a framework that takes into account both preventive and corrective actions, enabling automated and adaptive decisions based on potential scenarios over the course of a wildfire&#39;s progression. This approach considers the evolving nature of the wildfire threat and seeks to optimize the response strategies accordingly throughout its duration. The objective is to minimize wildfire risk and operational costs while reducing load curtailment. The framework accounts for potential contingencies caused by progressive wildfires. A novel algorithm is proposed to construct a decision tree based on wildfire progression and system geographical information. Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework. The effectiveness of the proposed method is demonstrated on the IEEE 30-bus system under various wildfire impact scenarios and is then applied to the IEEE 300-bus system to illustrate the scalability of the proposed approach. The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+  "raw_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12.json b/research/fog-of-knowledge/data/evidence/captures/76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12.json
new file mode 100644
index 000000000..cc9b4ca90
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-10254",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:23.741882+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.10254\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.10254</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:LO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.10254</id>\n        <created>2026-08-10</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Peper</keyname>\n                        <forenames>Jordan</forenames>\n                </author>\n                <author>\n                    <keyname>Kapadia</keyname>\n                        <forenames>Krish</forenames>\n                </author>\n                <author>\n                    <keyname>Gast</keyname>\n                        <forenames>James</forenames>\n                </author>\n                <author>\n                    <keyname>Howes</keyname>\n                        <forenames>Ethan</forenames>\n                </author>\n                <author>\n                    <keyname>Ruchkin</keyname>\n                        <forenames>Ivan</forenames>\n                </author>\n        </authors>\n        <title>A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems</title>\n            <categories>eess.SY cs.LO cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction. To transfer verification guarantees from the abstract model to the concrete CPS, the abstraction must conservatively approximate the concrete state space and behaviors. Hence, model-builders must maintain this soundness while balancing pessimism with tractability. However, they face several common pitfalls such as under-approximating the state space, under-approximating transitions, unsound pruning of &#34;degenerate&#34; behaviors, and improper specification lifting. This tutorial presents a pragmatic, conservative-by-construction workflow for building discrete abstractions of closed-loop dynamical systems. The workflow consists of four modular steps with interchangeable subroutines: (i) state-space partition and abstraction-function design, (ii) conservative transition construction via axis-aligned bounding boxes, polytopes, or sampling with PAC coverage certificates, (iii) mitigation of spurious transitions and self-loops using certified erasure and counterexample-guided abstraction refinement, and (iv) sound lifting of LTL specifications using may-must semantics. We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+  "raw_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441.json b/research/fog-of-knowledge/data/evidence/captures/773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441.json
new file mode 100644
index 000000000..6003be48e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-39776",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:21.627238+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.39776\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.39776</identifier>\n        <datestamp>2026-10-01</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.39776</id>\n        <created>2026-09-30</created>\n            <updated>2026-10-01</updated>\n        <authors>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jiarui</forenames>\n                </author>\n                <author>\n                    <keyname>Feng</keyname>\n                        <forenames>Wei</forenames>\n                </author>\n                <author>\n                    <keyname>Dong</keyname>\n                        <forenames>Chao</forenames>\n                </author>\n                <author>\n                    <keyname>Ge</keyname>\n                        <forenames>Ning</forenames>\n                </author>\n                <author>\n                    <keyname>Wu</keyname>\n                        <forenames>Qihui</forenames>\n                </author>\n        </authors>\n        <title>Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms</title>\n            <categories>cs.IT cs.SY eess.SY math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>With the rapid development of the low-altitude economy, low-altitude operations are booming, where complex missions require collaborative efforts among multiple heterogeneous low-altitude aircrafts (LAAs). Specifically, different LAAs assume distinct roles: some for sensing, some for communication, some for computing, and others for mission execution, together forming a sensing-communication-computing-control (SC3) closed loop, akin to a reflex arc. To enable efficient coordination in such multi-LAA swarms, we introduce the concept of operational-capability entropy (OCE) to quantify the effective work capability of operational LAAs. Accordingly, by jointly considering heterogeneous OCE and channel conditions among LAAs, we formulate the power allocation problem with the goal of minimizing the linear quadratic regulator (LQR) cost, which serves as a metric for mission efficiency. The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each. Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+  "raw_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f.json b/research/fog-of-knowledge/data/evidence/captures/78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f.json
new file mode 100644
index 000000000..b0842d2b6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-36354",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:25:55.718326+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.36354\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.36354</identifier>\n        <datestamp>2026-09-30</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:CE</setSpec>\n            <setSpec>q-bio:q-bio:BM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.36354</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-30</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Jiarui</forenames>\n                </author>\n                <author>\n                    <keyname>Yin</keyname>\n                        <forenames>Zixiang</forenames>\n                </author>\n                <author>\n                    <keyname>Landry</keyname>\n                        <forenames>Samuel</forenames>\n                </author>\n                <author>\n                    <keyname>Ding</keyname>\n                        <forenames>Zhengming</forenames>\n                </author>\n                <author>\n                    <keyname>Mettu</keyname>\n                        <forenames>Ramgopal</forenames>\n                </author>\n        </authors>\n        <title>Explainability from Training with Applications to TCR-Epitope Prediction</title>\n            <categories>cs.LG cs.AI cs.CE q-bio.BM</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks. Existing methods for interpretability provide limited insight into how models organize evidence and evolve during learning. We introduce explainability from training (EFT), a model-agnostic paradigm that traces model interpretation during training to explain why models rely on specific features and how they organize these features as predictive evidence. We apply EFT to four state-of-the-art T cell receptor (TCR)-epitope prediction models, TCR-SRIM, TULIP, MixTCRpred, and NetTCR-2.2, spanning post-hoc and interpret-by-design approaches as well as transformers and CNNs. To investigate how structural information affects model explanations, we introduce a benchmark, TCR-XAI2, containing 388 unique experimentally resolved TCR-epitope structures, complemented by structures predicted using AlphaFold3, Boltz-2, TCRModel2, tFold-TCR, and OpenFold3. Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+  "raw_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8.json b/research/fog-of-knowledge/data/evidence/captures/7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8.json
new file mode 100644
index 000000000..fae193e26
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-11359",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:26.578514+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T20:38:08Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.11359\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.11359</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.11359</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Kojima</keyname>\n                        <forenames>Hayate</forenames>\n                </author>\n                <author>\n                    <keyname>Noguchi</keyname>\n                        <forenames>Hikari</forenames>\n                </author>\n                <author>\n                    <keyname>Yamada</keyname>\n                        <forenames>Koki</forenames>\n                </author>\n                <author>\n                    <keyname>Tanaka</keyname>\n                        <forenames>Yuichi</forenames>\n                </author>\n        </authors>\n        <title>Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors</title>\n            <categories>eess.SP</categories>\n            <comments>Submitted to IEEE Transactions on Signal and Information Processing over Networks</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this paper, we propose restoration methods for time-varying graph signals using deep algorithm unrolling (DAU). Time-varying graph signals, such as signals obtained from sensor networks, are nonuniformly distributed in space and observed as time series. Since these observed signals often contain noise and missing values, their restoration needs to consider both spatial and temporal relationships. Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness. We then unroll the iterative conjugate gradient method to solve this problem and learn the regularization parameters and filter coefficients in each iteration. Our method can be applied to supervised batch, supervised online, and unsupervised batch settings to learn these parameters. Experiments on several synthetic and real-world datasets show that the supervised batch method achieves the lowest RMSEs in almost all cases. The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+  "raw_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c.json b/research/fog-of-knowledge/data/evidence/captures/7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c.json
new file mode 100644
index 000000000..49e21265e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-16290",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:58.288760+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:58Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.16290\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.16290</identifier>\n        <datestamp>2026-08-18</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.16290</id>\n        <created>2026-08-17</created>\n            <updated>2026-08-18</updated>\n        <authors>\n                <author>\n                    <keyname>Hatami</keyname>\n                        <forenames>Mohammad</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Nhan Thanh</forenames>\n                </author>\n                <author>\n                    <keyname>Juntti</keyname>\n                        <forenames>Markku</forenames>\n                </author>\n        </authors>\n        <title>Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols</title>\n            <categories>eess.SP</categories>\n            <comments>5 pages, 3 figures. Accepted for presentation at the IEEE SPAWC 2026 conference</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper investigates the joint design of beamforming and radar receive filters in a multiuser bistatic integrated sensing and communications (ISAC) system, aiming to maximize the minimum radar signal-to-interference-plus-noise ratio (SINR) under communications SINR and transmit power constraints. We consider two scenarios: transmitted signals are either known or unknown at the radar receiver. We develop tractable solutions to the resulting non-convex optimization problems in both cases. For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA). For the unknown case, we adopt an alternating optimization (AO) approach to jointly design the beamforming and receive filters. Numerical results demonstrate that, while both approaches achieve comparable performance under per-slot optimization, knowledge of the transmitted symbols provides significant gains in multi-slot processing via coherent integration. Moreover, the proposed ISAC designs perform close to the radar-only benchmark under moderate communication requirements.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+  "raw_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f.json b/research/fog-of-knowledge/data/evidence/captures/7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f.json
new file mode 100644
index 000000000..3d00c7144
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-06066",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:06.668513+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.06066\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.06066</identifier>\n        <datestamp>2026-09-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.06066</id>\n        <created>2026-09-05</created>\n            <updated>2026-09-09</updated>\n        <authors>\n                <author>\n                    <keyname>Camargo</keyname>\n                        <forenames>Romina Garcia</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Zhiyang</forenames>\n                </author>\n                <author>\n                    <keyname>Ribeiro</keyname>\n                        <forenames>Alejandro</forenames>\n                </author>\n        </authors>\n        <title>Scalability of Graph Neural Network Policies in Wireless Communication Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings. Scalability theories rely on dense graphon limits or continuous manifold approximations, both of which fail under the sparse, bounded-degree regimes and Euclidean metric constraints of physical wireless environments. This paper establishes a theoretical framework for GNN transferability over sparse Random Geometric Graphs (RGGs), capturing distance-dependent channel decay and spatial interference. We model sparse RGGs as spatial perturbations of regular Deterministic Grid Graphs (DGGs) and employ spatial windowing operators to compare networks across differing scales. Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs. Combining these results establishes formal scalability bounds across sparse RGG topologies. Finally, we extend this framework to conflict graph models, deriving equivalent scalability guarantees for link-level resource allocation policies. We verify our results for scalability with two experiment settings: power allocation and wireless link scheduling. The simulations show GNNs exhibit the expected scalable behavior, and analyze the relevance of our theoretical assumptions in practical deployment.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+  "raw_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666.json b/research/fog-of-knowledge/data/evidence/captures/8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666.json
new file mode 100644
index 000000000..8896680fb
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-32315",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:25:59.126761+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.32315\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.32315</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.32315</id>\n        <created>2026-09-26</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Hadid</keyname>\n                        <forenames>Vanessa</forenames>\n                </author>\n                <author>\n                    <keyname>Abdelhedi</keyname>\n                        <forenames>Hamza</forenames>\n                </author>\n                <author>\n                    <keyname>Pascarella</keyname>\n                        <forenames>Annalisa</forenames>\n                </author>\n                <author>\n                    <keyname>Solla</keyname>\n                        <forenames>Sara A.</forenames>\n                </author>\n                <author>\n                    <keyname>Cisek</keyname>\n                        <forenames>Paul</forenames>\n                </author>\n                <author>\n                    <keyname>Jerbi</keyname>\n                        <forenames>Karim</forenames>\n                </author>\n        </authors>\n        <title>From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Neural activity unfolds not as a set of independent signals, but as a coordinated dynamical process that can be described as a point moving through a high-dimensional state space. This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG. In this primer, we present a neural trajectory analysis based on Principal Component Analysis (PCA) as an accessible route into extending the concepts of neural trajectories in state space to human electrophysiology. We explain how EEG/MEG activity can be organized into neural state representations, projected onto axes organized by decreasing covariance, truncated into low-dimensional representations, and visualized as trajectories that capture how distributed activity evolves over time. We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes. An example of EEG motor execution and imagery, accompanied by a tutorial notebook, illustrates the workflow from conventional EEG summaries to trajectory-based analysis. We also clarify the limits of PCA, including its linear, variance-driven nature, and discuss EEG/MEG-specific challenges such as spatial mixing, preprocessing sensitivity, validation, and overinterpretation. Finally, we situate PCA within a broader family of state-space methods. By making neural trajectories practical and interpretable, this primer offers a guide for bringing the conceptual framework of population-level dynamics into mainstream human cognitive neuroscience.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+  "raw_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950.json b/research/fog-of-knowledge/data/evidence/captures/8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950.json
new file mode 100644
index 000000000..a0370d1b8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-01220",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:25.245394+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.01220\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.01220</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.01220</id>\n        <created>2026-08-02</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Doostmohammadian</keyname>\n                        <forenames>Mohammadreza</forenames>\n                </author>\n                <author>\n                    <keyname>Ghods</keyname>\n                        <forenames>Amir Ahmad</forenames>\n                </author>\n                <author>\n                    <keyname>Aghasi</keyname>\n                        <forenames>Alireza</forenames>\n                </author>\n                <author>\n                    <keyname>Gabidullina</keyname>\n                        <forenames>Zulfiya R.</forenames>\n                </author>\n                <author>\n                    <keyname>Rabiee</keyname>\n                        <forenames>Hamid R.</forenames>\n                </author>\n        </authors>\n        <title>Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap</title>\n            <categories>eess.SY cs.LG cs.SY eess.SP math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz continuous optimization algorithms have been proposed to improve the slow conver-gence rate of the existing linear solutions. The use of signum-based functions is previ-ously considered in consensus and control literature to reach fast convergence in the prescribed time and also to provide robust algorithms to noisy/outlier data. However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup. This motivates us to investigate the distributed optimization and ML algorithms in terms of trade-off between conver-gence rate and optimality gap. In this direction, we specifically consider the distributed regression problem and check its convergence rate by applying both linear and non-Lipschitz signum-based functions. We check our distributed regression approach by extensive simulations. Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps. The findings pre-sented in this paper may contribute to and advance the ongoing discourse of similar distributed algorithms, e.g., for distributed constrained optimization and distributed estimation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+  "raw_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99.json b/research/fog-of-knowledge/data/evidence/captures/8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99.json
new file mode 100644
index 000000000..d898065f7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-12016",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:56.233910+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:56Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12016\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12016</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12016</id>\n        <created>2026-09-10</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Haroon</keyname>\n                        <forenames>Adam</forenames>\n                </author>\n                <author>\n                    <keyname>Rodríguez-Seda</keyname>\n                        <forenames>Erick J.</forenames>\n                </author>\n                <author>\n                    <keyname>Schuler</keyname>\n                        <forenames>Tristan</forenames>\n                </author>\n                <author>\n                    <keyname>Fleming</keyname>\n                        <forenames>Cody</forenames>\n                </author>\n        </authors>\n        <title>Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <comments>8 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Self-triggered reinforcement learning control (RL-STC) learns the sparsest control schedule that preserves Lyapunov-decreasing stability under a Run-Time Assurance (RTA) override. We invert this: an adversarial RL agent learns the sparsest jamming or Denial-of-Service (DoS) schedule that destabilizes the closed loop, with a Lyapunov-increase admissibility predicate mirroring the defender&#39;s safety certificate. We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary. This extends the DoS-scheduling count-budget analysis from periodic and linear-time-invariant to STC controllers. Empirically, we train against four fixed defenders per plant (one Linear Quadratic Regulator (LQR) and three RL-STC) on Pendulum, CartPole, and Quadrotor2D. The learned adversary is the only adversary that crashes every defender on every plant at $100\\%$: greedy misses Quadrotor2D LQR on $42\\%$ of episodes and periodic misses Pendulum LQR on $97\\%$. On jam-time-per-failure it beats baselines by up to $2.8\\times$, and shows its widest absolute margin on Quadrotor2D LQR. Robustness ablations show that Gaussian observation noise exceeding the initial-state magnitude and position-only observation both preserve $100\\%$ failure rate and keep the learned adversary strictly ahead of both baselines on jam-time-per-failure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+  "raw_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f.json b/research/fog-of-knowledge/data/evidence/captures/8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f.json
new file mode 100644
index 000000000..b54d0b823
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-21764",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:24.047991+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.21764\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.21764</identifier>\n        <datestamp>2026-08-25</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.21764</id>\n        <created>2026-08-22</created>\n            <updated>2026-08-25</updated>\n        <authors>\n                <author>\n                    <keyname>Islam</keyname>\n                        <forenames>Riadul</forenames>\n                </author>\n                <author>\n                    <keyname>Mule</keyname>\n                        <forenames>Joey</forenames>\n                </author>\n                <author>\n                    <keyname>Challagundla</keyname>\n                        <forenames>Dhandeep</forenames>\n                </author>\n                <author>\n                    <keyname>Rizvi</keyname>\n                        <forenames>Shahmir</forenames>\n                </author>\n                <author>\n                    <keyname>Carson</keyname>\n                        <forenames>Sean</forenames>\n                </author>\n                <author>\n                    <keyname>Saini</keyname>\n                        <forenames>Rachit</forenames>\n                </author>\n        </authors>\n        <title>LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices</title>\n            <categories>cs.CV cs.AI eess.IV</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing. However, the asynchronous and noise-prone nature of event streams creates challenges for conventional deep learning models, which are often too computationally intensive for low-power embedded platforms. This work presents a compact and configurable event-driven autoencoder that efficiently compresses neuromorphic data while preserving essential spatiotemporal structure for downstream inference. The architecture integrates lightweight convolutional encoding with robust performance under adaptive event thresholding and a minimal classifier head, enabling substantial reductions in computational cost without degrading recognition fidelity. Extensive evaluations on the Smart Event Face Dataset (SEFD) and Event-Based Crossing Dataset (EBCD) show that the proposed framework achieves competitive or superior accuracy compared to YOLOv9 while requiring up to 35.6$\\times$ fewer parameters. To assess real-world sustainability, the model is deployed on resource-constrained hardware: a Raspberry Pi 4B and a NVIDIA Jetson Nano. On NVIDIA Jetson Nano, it delivers real-time throughput of 44.8 FPS. On a Raspberry Pi 4B CPU, the 50\\% autoencoder classifier consumes 16.19 J for the evaluated inference workload, corresponding to approximately 726.3$\\times$ lower energy consumption than YOLOv9 under the same evaluation protocol. These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+  "raw_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f.json b/research/fog-of-knowledge/data/evidence/captures/8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f.json
new file mode 100644
index 000000000..fd3b5bad4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-35246",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:31.949330+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.35246\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.35246</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.35246</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>M. Furqan</forenames>\n                </author>\n                <author>\n                    <keyname>Vanin</keyname>\n                        <forenames>Marta</forenames>\n                </author>\n                <author>\n                    <keyname>Hermans</keyname>\n                        <forenames>Chris</forenames>\n                </author>\n                <author>\n                    <keyname>Deconinck</keyname>\n                        <forenames>Geert</forenames>\n                </author>\n        </authors>\n        <title>Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Preprint. Submitted to Sustainable Energy, Grids and Networks</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Robust and accurate state estimation is fundamental for the reliable operation and monitoring of active distribution networks. Conventional numerical estimators, such as weighted least squares, are computationally slower and often suffer from convergence issues in the presence of sparse measurements affected by non-Gaussian noise. Physics-informed neural networks have recently emerged as a promising alternative by incorporating physical principles through residual-based penalty terms in the objective, which can improve robustness to noise and computational efficiency. However, such penalty-based approaches do not guarantee strict enforcement of physical constraints during inference and provide limited support for principled uncertainty modeling. To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph. The proposed approach explicitly models non-Gaussian (pseudo-)measurement uncertainty through flexible, closed-form likelihood-based loss functions. It further incorporates a differentiable optimization-based estimation layer that strictly enforces nonlinear equality constraints and measurement consistency, producing physically feasible state estimates during both training and inference. To the best of our knowledge, this is the first PINN-based DSSE framework to combine hard physical constraints with non-Gaussian uncertainty modeling for unbalanced three-phase networks. Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+  "raw_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799.json b/research/fog-of-knowledge/data/evidence/captures/8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799.json
new file mode 100644
index 000000000..26a153a97
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-24360",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:30:27.093772+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.24360\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.24360</identifier>\n        <datestamp>2026-07-28</datestamp>\n            <setSpec>cs:cs:SI</setSpec>\n            <setSpec>cs:cs:HC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.24360</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-28</updated>\n        <authors>\n                <author>\n                    <keyname>Krishna</keyname>\n                        <forenames>Vaibhav</forenames>\n                </author>\n                <author>\n                    <keyname>Shirado</keyname>\n                        <forenames>Hirokazu</forenames>\n                </author>\n                <author>\n                    <keyname>Fu</keyname>\n                        <forenames>Feng</forenames>\n                </author>\n                <author>\n                    <keyname>Christakis</keyname>\n                        <forenames>Nicholas A.</forenames>\n                </author>\n        </authors>\n        <title>Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases</title>\n            <categories>cs.SI cs.HC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Advanced digital communication has revolutionized how people create and consume information, making information diffusion an important topic of research for domains from public health to national security. Real-world scenarios of information diffusion often involve competing narratives - true and false - spreading simultaneously. We propose a novel agent-based co-diffusion model, grounded in &#34;complex-contagion&#34; and &#34;spiral of silence&#34; theories, to capture how network dynamics exploit cognitive biases to shape such interactions. Our findings reveal that manipulative narratives dominate when early spreaders hold them. These network dynamics further exploit inherent cognitive biases to amplify information diffusion regardless of veracity. Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly. However, we found that early seeding of agents with lower self-censorship not only constrains the spread of manipulation but can also lead to dominance of well-informed populance. This has implications for policies that aim to facilitate healthier discourse, strengthen social cohesion, and ensure equitable access to reliable information.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+  "raw_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7.json b/research/fog-of-knowledge/data/evidence/captures/8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7.json
new file mode 100644
index 000000000..50b50a9c7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-19416",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:47.330316+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:47Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.19416\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.19416</identifier>\n        <datestamp>2026-08-21</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.19416</id>\n        <created>2026-08-19</created>\n            <updated>2026-08-21</updated>\n        <authors>\n                <author>\n                    <keyname>Mozaffarikhosravi</keyname>\n                        <forenames>Nima</forenames>\n                </author>\n                <author>\n                    <keyname>Azarbahram</keyname>\n                        <forenames>Amirhossein</forenames>\n                </author>\n                <author>\n                    <keyname>Dharmawansa</keyname>\n                        <forenames>Prathapasinghe</forenames>\n                </author>\n                <author>\n                    <keyname>Atzeni</keyname>\n                        <forenames>Italo</forenames>\n                </author>\n        </authors>\n        <title>Robust Near-Field Beam Focusing Under Imperfect Localization</title>\n            <categories>eess.SP</categories>\n            <comments>To be presented at the International Workshop on Smart Antennas (WSA) 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The transition to 6G-and-beyond wireless systems with large-scale antenna arrays and high-frequency deployments significantly extends the near-field region, where channels exhibit a strong dependence on user location. While this enables location-based beam focusing as a low-overhead alternative to conventional channel estimation, its performance is highly sensitive to localization errors. In this paper, we study robust near-field beam focusing under imperfect user localization. We explicitly characterize the impact of localization errors on the line-of-sight-dominated channel by deriving a tractable uncertainty model via a first-order Taylor approximation, which captures the coupled effects of distance and angle in near-field propagation. Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors. The resulting problem is reformulated into a feasibility problem using semidefinite relaxation. Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+  "raw_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2.json b/research/fog-of-knowledge/data/evidence/captures/925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2.json
new file mode 100644
index 000000000..f18adf88d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-12866",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:49.184304+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:49Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12866\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12866</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12866</id>\n        <created>2026-09-11</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Buciulea</keyname>\n                        <forenames>Andrei</forenames>\n                </author>\n                <author>\n                    <keyname>Isufi</keyname>\n                        <forenames>Elvin</forenames>\n                </author>\n                <author>\n                    <keyname>Leus</keyname>\n                        <forenames>Geert</forenames>\n                </author>\n                <author>\n                    <keyname>Marques</keyname>\n                        <forenames>Antonio G.</forenames>\n                </author>\n        </authors>\n        <title>Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, making them inadequate for datasets exhibiting higher-order interactions. Simplicial complexes (SCs) have emerged as a promising framework for capturing such higher-order dependencies. This paper focuses on the problem of identifying the topology of an SC from signals, which serves as the foundation for SC-based processing and learning schemes. We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices). We assume the observed signals are smooth over the unknown SC topology, and that the higher-order interactions are sparse. Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it. A key step in our formulation is the modeling of the topology of the SC using binary edge and triangle selection vectors, combined with efficient greedy algorithms for optimizing such vectors. We establish theoretical convergence guarantees to a stationary point of a relaxed (penalized) version of the problem and discuss computational complexity. Multiple numerical experiments with both synthetic and real-world datasets validate the effectiveness of our approach, highlighting the capability of SC-learning methods to uncover and model higher-order relationships in complex datasets.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+  "raw_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814.json b/research/fog-of-knowledge/data/evidence/captures/93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814.json
new file mode 100644
index 000000000..8eba55ed2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-27536",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:26.557443+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.27536\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.27536</identifier>\n        <datestamp>2026-08-31</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>econ:econ:TH</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.27536</id>\n        <created>2026-08-27</created>\n            <updated>2026-08-31</updated>\n        <authors>\n                <author>\n                    <keyname>Salizzoni</keyname>\n                        <forenames>Giulio</forenames>\n                </author>\n                <author>\n                    <keyname>Cecchelli</keyname>\n                        <forenames>Domenico Mergoni</forenames>\n                </author>\n                <author>\n                    <keyname>Plumb</keyname>\n                        <forenames>Edward</forenames>\n                </author>\n                <author>\n                    <keyname>Kamgarpour</keyname>\n                        <forenames>Maryam</forenames>\n                </author>\n                <author>\n                    <keyname>Ashkenazi-Golan</keyname>\n                        <forenames>Galit</forenames>\n                </author>\n        </authors>\n        <title>Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games</title>\n            <categories>cs.GT econ.TH</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>While infinitely repeated games admit a rich set of Nash equilibria, finitely repeated games typically have a much smaller and often inefficient one. We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation. Paying these deposits is voluntary and incentive compatible at every stage, so no commitment by the players is assumed, the only commitment required being that of the intermediary to a refund rule fixed before play begins. The mechanism sustains payoff profiles more efficient than those of the standard equilibria, without altering the underlying game and without transfers between players. We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version. We also apply it to a dynamic common-pool resource, suggesting that the construction extends beyond repeated stage-games.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+  "raw_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67.json b/research/fog-of-knowledge/data/evidence/captures/97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67.json
new file mode 100644
index 000000000..e4a3eec14
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-00959",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:29.260496+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:29Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.00959\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.00959</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.00959</id>\n        <created>2026-08-02</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Fridovich-Keil</keyname>\n                        <forenames>David</forenames>\n                </author>\n        </authors>\n        <title>MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems</title>\n            <categories>cs.GT cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics. The dominant solver for problems of this form is PATH, which offers strong performance on robotics problems but remains closed-source. We present MixedComplementarityProblems.jl, an open-source, pure Julia implementation of an interior point method for parametric MCPs that: (i) matches PATH&#39;s reliability on standard benchmarks, (ii) natively supports batched, parallel processing of many parameter instances, either across CPU threads or on an NVIDIA GPU, and (iii) supports efficient automatic differentiation of solutions with respect to problem parameters. On a multi-agent lane-change trajectory game representative of robotics planning problems, our CPU-multithreaded batched solver clears a batch of parametric instances ~100x faster than sequential calls to PATH. A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence. We describe the solver&#39;s interior point formulation, the abstraction that lets a single solver implementation run unmodified across dense, batched-sparse, and single-large linear-algebra backends, and report benchmarks against PATH on both randomly generated quadratic programs and trajectory games.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+  "raw_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40.json b/research/fog-of-knowledge/data/evidence/captures/988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40.json
new file mode 100644
index 000000000..e7a72f83a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-21653",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:26.911036+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T13:18:41Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.21653\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.21653</identifier>\n        <datestamp>2026-10-16</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.21653</id>\n        <created>2026-10-15</created>\n            <updated>2026-10-16</updated>\n        <authors>\n                <author>\n                    <keyname>Jing</keyname>\n                        <forenames>Zexuan</forenames>\n                </author>\n                <author>\n                    <keyname>Xiong</keyname>\n                        <forenames>Yifeng</forenames>\n                </author>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Fan</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Xuehua</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jianhua</forenames>\n                </author>\n        </authors>\n        <title>How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?</title>\n            <categories>cs.IT eess.SP math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Probabilistic constellation shaping (PCS), originally designed to fill the gap between finite uniform constellations and continuous capacity-achieving input distributions, has recently emerged as a central tool in adjusting the expected integrated sidelobe level (EISL) in integrated sensing and communication (ISAC). In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control. We further show that OFDM is almost the only unitary modulation basis whose codeword-wise ISLR can be precisely controlled by type-based PCS. Based upon the analytical results, practical type-based PCS methods compatible with the probabilistic amplitude shaping (PAS) framework are conceived, which achieve higher communication rates than existing ISAC-oriented PCS methods under identical ISLR constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+  "raw_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e.json b/research/fog-of-knowledge/data/evidence/captures/9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e.json
new file mode 100644
index 000000000..280798ec6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-13424",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:00.397076+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-12T03:01:50Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.13424\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.13424</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.13424</id>\n        <created>2026-10-09</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Sharma</keyname>\n                        <forenames>Vaishnavi</forenames>\n                </author>\n                <author>\n                    <keyname>Katewa</keyname>\n                        <forenames>Vaibhav</forenames>\n                </author>\n        </authors>\n        <title>Minimum-Energy Control for Stochastic Linear Systems</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be \\emph{small}, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices. Finally, we show that there exists a fundamental lower bound on the optimal control energy which cannot be overcome by increasing the time horizon of the problem.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+  "raw_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274.json b/research/fog-of-knowledge/data/evidence/captures/9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274.json
new file mode 100644
index 000000000..6fb4f4b3b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-21020",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:36.937030+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.21020\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.21020</identifier>\n        <datestamp>2026-08-24</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.21020</id>\n        <created>2026-08-21</created>\n            <updated>2026-08-24</updated>\n        <authors>\n                <author>\n                    <keyname>Ouyang</keyname>\n                        <forenames>Chongjun</forenames>\n                </author>\n                <author>\n                    <keyname>Jiang</keyname>\n                        <forenames>Hao</forenames>\n                </author>\n                <author>\n                    <keyname>Ding</keyname>\n                        <forenames>Zhiguo</forenames>\n                </author>\n                <author>\n                    <keyname>Schober</keyname>\n                        <forenames>Robert</forenames>\n                </author>\n        </authors>\n        <title>Frequency-Selective Pinching-Antenna Systems</title>\n            <categories>eess.SP</categories>\n            <comments>34 pages</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>An uplink pinching-antenna system (PASS) is considered, where a segmented dielectric waveguide is employed to serve multiple users and one pinching antenna (PA) is activated on each segment. Extensive waveguide deployment reduces user-to-PA path loss but also creates differential propagation delays among the PA-assisted paths spanning the large waveguide aperture. These delays are retained, and a Toeplitz block model is derived to characterize the resulting frequency-selective (FS) channel. For infinite-blocklength transmission, the achievable single-user rate and the multiuser sum-rates under joint and parallel decoding are characterized. For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate. The difference between the rates computed under the FF channel model and the exact FS channel model is referred to as the FF rate overestimation, and its dependence on the waveguide-aperture-induced delay spread is characterized. For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime. For finite-blocklength transmission, achievable rates are derived under a practical cyclic-prefix single-carrier frequency-domain equalization framework. An element-wise algorithm is developed to optimize FS-aware PA placement in both transmission regimes. The analytical findings demonstrate that differential delays across the extensively deployed waveguide can cause significant frequency selectivity and that the proposed FS-aware PA placement method substantially improves the achievable rate over placement based on the FF approximation, especially for large bandwidths and apertures.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+  "raw_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43.json b/research/fog-of-knowledge/data/evidence/captures/9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43.json
new file mode 100644
index 000000000..e46905b53
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-25847",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:45.815112+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25847\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25847</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25847</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Ertan</keyname>\n                        <forenames>Sude</forenames>\n                </author>\n                <author>\n                    <keyname>Tokluoglu</keyname>\n                        <forenames>Osman</forenames>\n                </author>\n                <author>\n                    <keyname>Cavus</keyname>\n                        <forenames>Enver</forenames>\n                </author>\n        </authors>\n        <title>Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications</title>\n            <categories>eess.SP</categories>\n            <comments>6 pages, 3 tables, 2 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Classical coherent binary phase-shift keying (BPSK) reception over additive white Gaussian noise (AWGN) channels is analytically well understood, and the optimum hard-decision detector is known. Therefore, the aim of using neural receivers in this study is not to replace the classical AWGN-BPSK detector. Instead, the AWGN-BPSK setting is deliberately selected as a theoretically verifiable benchmark for analyzing how compactly neural receiver architectures can represent a known decision behavior. This paper compares multi-layer perceptron (MLP) and Kolmogorov--Arnold Network (KAN) receivers using a multi-SNR Nyquist-rate BPSK dataset. The models are evaluated using bit error rate (BER), mean squared error (MSE), and trainable parameter count. Beyond reporting accuracy alone, this work emphasizes a common-loss parameter-efficiency perspective: when two receivers reach a comparable practical BER or loss region, the receiver with fewer parameters is more attractive for real-time deployment. The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters. In particular, the KAN receiver with 3281 parameters achieves a test BER of 2.45 x 10^-4, while the MLP baseline with 8513 parameters achieves a test BER of 2.50 x 10^-4. This corresponds to approximately 61.5% fewer trainable parameters at a comparable BER operating point. This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+  "raw_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257.json b/research/fog-of-knowledge/data/evidence/captures/9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257.json
new file mode 100644
index 000000000..7e6cc909b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-12486",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:52.836742+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12486\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12486</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12486</id>\n        <created>2026-09-11</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Velicheti</keyname>\n                        <forenames>Raj Kiriti</forenames>\n                </author>\n                <author>\n                    <keyname>Bose</keyname>\n                        <forenames>Subhonmesh</forenames>\n                </author>\n                <author>\n                    <keyname>Başar</keyname>\n                        <forenames>Tamer</forenames>\n                </author>\n        </authors>\n        <title>Adaptive Agent Design</title>\n            <categories>eess.SY cs.AI cs.GT cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider an agent acting against a general non-Markovian environment. The agent maintains its agent states, but is free to choose a transition kernel across those states and optimize its state-feedback control policies. We study the bi-level agent design problem that optimizes the transition kernel and the policy it induces, given said kernel with offline data of observations and actions obtained via a behavioral policy. For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one. In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+  "raw_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba.json b/research/fog-of-knowledge/data/evidence/captures/a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba.json
new file mode 100644
index 000000000..d4e48d513
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-17295",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:40.315577+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T11:16:14Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.17295\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.17295</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.17295</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Nair</keyname>\n                        <forenames>Nikhil</forenames>\n                </author>\n                <author>\n                    <keyname>Caradonna</keyname>\n                        <forenames>Daniele</forenames>\n                </author>\n                <author>\n                    <keyname>Mathew</keyname>\n                        <forenames>Anup Teejo</forenames>\n                </author>\n                <author>\n                    <keyname>Renda</keyname>\n                        <forenames>Federico</forenames>\n                </author>\n                <author>\n                    <keyname>Della Santina</keyname>\n                        <forenames>Cosimo</forenames>\n                </author>\n                <author>\n                    <keyname>Feliu-Talegon</keyname>\n                        <forenames>Daniel</forenames>\n                </author>\n        </authors>\n        <title>Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>7 pages, 6 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Continuum soft robots are highly nonlinear and underactuated systems, which makes stabilizing them around unstable equilibrium points difficult. This challenge becomes even greater in low stiffness regimes, where gravitational forces dominate elastic forces. In this letter, we explore whether optimal control can address these challenges using a computa- tionally efficient method suitable for real time use. We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives. This results in an efficient control framework for addressing the stabilization problem. Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+  "raw_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82.json b/research/fog-of-knowledge/data/evidence/captures/a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82.json
new file mode 100644
index 000000000..ddad1866d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-29972",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:05.938561+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:05Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.29972\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.29972</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>q-bio:q-bio:PE</setSpec>\n            <setSpec>physics:physics:med-ph</setSpec>\n            <setSpec>q-bio:q-bio:QM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.29972</id>\n        <created>2026-09-24</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Polyakov</keyname>\n                        <forenames>Maxim</forenames>\n                </author>\n                <author>\n                    <keyname>Chernikova</keyname>\n                        <forenames>Yulia</forenames>\n                </author>\n        </authors>\n        <title>Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy</title>\n            <categories>q-bio.PE physics.med-ph q-bio.QM</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We develop and analyse a mechanistic ODE model of within-host HIV dynamics that includes uninfected CD4$^+$ T cells, latently and productively infected cells, free virions, and cytotoxic immune effectors. Antiretroviral therapy is described by two time-dependent efficacy functions that separately reduce new infections and virion production. We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state. We also obtain treatment-dependent suppression thresholds and an analytical estimate of when this threshold is crossed as treatment efficacy declines. Numerical simulations consider untreated infection, ART initiation, periodic variation in efficacy, and progressive loss of treatment effect. Without therapy, the model approaches a state of persistent infection. ART reduces viral load and promotes recovery of the CD4$^+$ T-cell population, while the latent reservoir persists under the parameter set considered. Periodic changes in treatment efficacy produce sustained forced oscillations. These results connect the analytical threshold conditions with the treatment-dependent dynamics of the model and provide a basis for future calibration, sensitivity analysis, uncertainty quantification, and extensions informed by clinical data.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+  "raw_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac.json b/research/fog-of-knowledge/data/evidence/captures/a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac.json
new file mode 100644
index 000000000..c23ed63c4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-04630",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:06.277049+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04630\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04630</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04630</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Sevim</keyname>\n                        <forenames>Nurullah</forenames>\n                </author>\n                <author>\n                    <keyname>Ibrahim</keyname>\n                        <forenames>Mostafa</forenames>\n                </author>\n                <author>\n                    <keyname>Ekin</keyname>\n                        <forenames>Sabit</forenames>\n                </author>\n                <author>\n                    <keyname>Rappaport</keyname>\n                        <forenames>Theodore S.</forenames>\n                </author>\n        </authors>\n        <title>Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems</title>\n            <categories>eess.SP</categories>\n            <comments>Submitted to IEEE Transactions on Green Communications and Networking for review</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The escalating energy demands of modern wireless networks make energy-efficient system design a central challenge for future 6G deployments. Relay-assisted communication has long been recognized as a powerful tool for improving coverage and throughput, tracing its roots to early repeater communication systems and the foundational relay channel models in information theory. Meanwhile, modern relay selection and routing strategies are primarily driven by rate-based or transmit-power-centric metrics, which often neglect hardware-level losses that is independent of the transmitted signal. As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions. To address the challenge of modeling signal-independent power consumption in relay-assisted systems, the Waste Factor (WF) framework is adopted: a hardware-aware, unifying metric that explicitly captures signal-independent power losses across cascaded transceivers and wireless channels. Using WF, the energy consumption of multi-user, multi-relay wireless systems is quantified and minimized under practical hardware and network constraints. The formulation jointly accounts for component inefficiencies, propagation losses, and relay-selection constraints. The proposed framework demonstrates that the WF formulation provides a fundamentally new way to model relay-assisted communication, enabling hardware-aware energy-per-bit minimization and a structured representation that enables computationally efficient analysis. Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+  "raw_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077.json b/research/fog-of-knowledge/data/evidence/captures/ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077.json
new file mode 100644
index 000000000..a52b26fb7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-21966",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:13.245754+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21966\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21966</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>cs:cs:FL</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21966</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Bahmani</keyname>\n                        <forenames>Sarvin</forenames>\n                </author>\n                <author>\n                    <keyname>Paul</keyname>\n                        <forenames>Soumyajit</forenames>\n                </author>\n                <author>\n                    <keyname>Schewe</keyname>\n                        <forenames>Sven</forenames>\n                </author>\n                <author>\n                    <keyname>Soudjani</keyname>\n                        <forenames>Sadegh</forenames>\n                </author>\n                <author>\n                    <keyname>Trivedi</keyname>\n                        <forenames>Ashutosh</forenames>\n                </author>\n        </authors>\n        <title>Automata-Theoretic Verification of Interval Markov Decision Processes</title>\n            <categories>cs.FL cs.SY eess.SY</categories>\n            <comments>14 pages including appendices, accepted to CDC 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Interval Markov decision processes (IMDPs) provide a natural framework for modeling stochastic systems with uncertain transition probabilities, represented by probability intervals and resolved adversarially. Such uncertainty arises naturally, for example, when the transition model is learned from finite data or obtained through model-based reinforcement learning. In this paper, we study the automata-theoretic verification of IMDPs against rich temporal specifications, including all LTL specifications, by considering the broader class of ω-regular objectives. We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals. For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata). For unstable IMDPs, where intervals may include zero while the upper bound is strictly positive, verification becomes game-like and requires automata whose nondeterminism can be resolved on the fly (good-for-games automata). Building on these insights, we develop algorithms for verifying ω-regular specifications over IMDPs and derive probabilistic guarantees when the interval model is learned from sampled data. The resulting framework enables principled verification of stochastic systems under probabilistic model uncertainty, connecting automata-based verification with data-driven stochastic modeling.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+  "raw_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c.json b/research/fog-of-knowledge/data/evidence/captures/ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c.json
new file mode 100644
index 000000000..5cea439b5
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-06918",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:13.187217+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.06918\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.06918</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.06918</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Maity</keyname>\n                        <forenames>Sreejeet</forenames>\n                </author>\n                <author>\n                    <keyname>Mitra</keyname>\n                        <forenames>Aritra</forenames>\n                </author>\n        </authors>\n        <title>Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We study federated reinforcement learning in which multiple agents interact with a common Markov decision process and communicate through a central server to collaboratively learn the optimal state-action value function. Our goal is to understand whether the sample-efficiency benefits of collaboration can be retained when a fraction of the agents behave adversarially and transmit arbitrarily corrupted information. To address this problem, we introduce Robust Async-Fed-Q, an epoch-based federated learning algorithm that combines variance-reduced estimation of the Bellman optimality operator at the agents with robust aggregation at the server. We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption. In particular, the effect of the adversarial agents decreases as the amount of data collected by each honest agent grows and eventually vanishes in the infinite-sample limit. We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning. We further extend our framework to accommodate single-trajectory Markovian sampling and heterogeneous partial coverage, where different agents may explore different regions of the state-action space and learning relies on their collective coverage. Finally, our epoch-based design substantially improves the best known communication complexity for federated Q-learning under asynchronous sampling.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+  "raw_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca.json b/research/fog-of-knowledge/data/evidence/captures/b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca.json
new file mode 100644
index 000000000..0144bdc32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-25081",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:30:11.838206+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:11Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.25081\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.25081</identifier>\n        <datestamp>2026-07-29</datestamp>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.25081</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-29</updated>\n        <authors>\n                <author>\n                    <keyname>Zampirolli</keyname>\n                        <forenames>Eduardo Moura</forenames>\n                </author>\n                <author>\n                    <keyname>Interian</keyname>\n                        <forenames>Ruben</forenames>\n                </author>\n        </authors>\n        <title>Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales</title>\n            <categories>physics.soc-ph</categories>\n            <comments>28 pages, English and Portuguese versions (English first)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This study investigates the predictive capacity of models based on Economic Complexity and Complex Network Theory when applied to Brazil&#39;s Municipal Human Development Index (IDHM). For this purpose, the Economic Complexity Index was adapted to the Brazilian context. The main objective is to assess the extent to which different approaches to regional development analysis, such as local productive sophistication and structural integration into the national transportation network, determine socioeconomic development. The methodology compares linear regression models (Ridge, LASSO, and Elastic Net) and nonlinear models (Decision Trees and the Explainable Boosting Machine), evaluated through 5-fold cross-validation with grid search. The analyses were conducted at two levels of spatial aggregation: municipalities and Immediate Geographic Regions. The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables. Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale. In addition, the inclusion of topological metrics from the road infrastructure network generally improved performance. The Explainable Boosting Machine achieved the best predictive performance, reaching R^2 = 0.8196 at the Immediate Region level when network metrics were included.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+  "raw_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492.json b/research/fog-of-knowledge/data/evidence/captures/b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492.json
new file mode 100644
index 000000000..c8a514714
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-12038",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:18.523961+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-13T09:41:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12038\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12038</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12038</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Jayakumar</keyname>\n                        <forenames>Surya</forenames>\n                </author>\n                <author>\n                    <keyname>Narayanan</keyname>\n                        <forenames>Arun</forenames>\n                </author>\n                <author>\n                    <keyname>Dey</keyname>\n                        <forenames>Indrakshi</forenames>\n                </author>\n        </authors>\n        <title>Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks</title>\n            <categories>eess.SP</categories>\n            <comments>6 pages</comments>\n            <msc-class>94A12, 94A08</msc-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Access control in Internet of Things (IoT) sensor networks usually acts above the physical layer: the fusion centre decides which reports to accept, while the radio of a compromised node keeps occupying the shared channel. This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time. We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level. The locally optimum detector of out-of-subtree transmission in impulsive Class-A noise weights each leaf in proportion to this predicted leakage. We bound the time needed to confine a compromised node and derive the optimal tree depth. In simulation, with demoted nodes radiating within their allocation, the scheme lowers the probability of a false global decision by 68% relative to fixed-allocation WPDM and to OFDM with the same reputation tiers, and by 44% relative to cryptographic re-attestation, which leads once more than 24% of the sensors are compromised.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+  "raw_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056.json b/research/fog-of-knowledge/data/evidence/captures/b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056.json
new file mode 100644
index 000000000..7bf08fc10
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-05348",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:44.117017+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:43Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.05348\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.05348</identifier>\n        <datestamp>2026-08-07</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.05348</id>\n        <created>2026-08-05</created>\n            <updated>2026-08-07</updated>\n        <authors>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Lin</forenames>\n                </author>\n                <author>\n                    <keyname>Hou</keyname>\n                        <forenames>I-Hong</forenames>\n                </author>\n        </authors>\n        <title>TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Optimizing for both low Age of Information (AoI) and high throughput is critical for remote sensing applications that rely on multichannel wireless networks. However, jointly optimizing these two metrics is an analytically challenging problem, particularly in systems with heterogeneous and unreliable channels. To address this challenge, we propose TSDM, a Two-Stage Deficit Matching scheduling framework. TSDM is based on a second-order approach that characterizes the performance of each data flow by its mean and temporal variance. In the first stage, TSDM translates the high-level utility maximization objective into a concrete set of target mean and temporal variance statistics for transmissions over each node-channel pair. In the second stage, a low-complexity Weighted Matching Deficit (WMD) rule performs real-time channel assignment. We theoretically prove that TSDM achieves the desired mean and temporal variance for each flow. Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems. In both cases, TSDM significantly outperforms existing scheduling policies.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+  "raw_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1.json b/research/fog-of-knowledge/data/evidence/captures/b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1.json
new file mode 100644
index 000000000..569e6571c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-03964",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:16.918872+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-10T17:37:33Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.03964\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.03964</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.03964</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Hamad</keyname>\n                        <forenames>Ahrar N.</forenames>\n                </author>\n                <author>\n                    <keyname>Qidan</keyname>\n                        <forenames>Ahmad Adnan</forenames>\n                </author>\n                <author>\n                    <keyname>El-Gorashi</keyname>\n                        <forenames>Taisir E. H.</forenames>\n                </author>\n                <author>\n                    <keyname>Elmirghani</keyname>\n                        <forenames>Jaafar M. H.</forenames>\n                </author>\n        </authors>\n        <title>Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>6 pages, 4 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hybrid radio frequency (RF) and visible light communication (VLC) networks have emerged as a promising solution for high-capacity indoor wireless connectivity in sixth-generation (6G) systems. However, the limited optical coverage and vulnerability of VLC links to line-of-sight (LoS) blockage under user mobility remain fundamental challenges. In this work, a mirror-based intelligent reflecting surface (IRS) is deployed to assist a dynamic indoor hybrid RF/VLC network, where each mobile user is exclusively assigned to either the IRS-enhanced VLC subnetwork or the RF subnetwork through a binary selection decision. A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles. To enable real-time adaptability, the problem is reformulated as a Markov decision process (MDP) and solved using a cooperative multi-agent deep reinforcement learning (DRL) algorithm based on centralized training with decentralized execution. Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks. The results further validate the practicality and effectiveness of the proposed DRL framework compared to widely adopted DRL algorithms as well as conventional model-based optimization approaches.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+  "raw_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590.json b/research/fog-of-knowledge/data/evidence/captures/b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590.json
new file mode 100644
index 000000000..2ae8ce5f5
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-07616",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:47.705922+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-11T06:06:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.07616\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.07616</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.07616</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Siyuan</forenames>\n                </author>\n        </authors>\n        <title>Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>8 pages, 7 figures, 3 tables</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We present a repertoire-free benchmark for soft-robot damage recovery under nine online trials. The protocol pairs damage masks within each morphology, retains a measured nominal fallback, and separates method development from evaluation on new bodies. A Gaussian-process expected-improvement (GP-EI) reference controller adapts actuator phases using three initialization probes and six feedback-selected rollouts. Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets. GP-EI improves the worst-mask gain on 69/75 confirmation bodies and exceeds these four baselines by 0.235-0.310 mean worst-mask reward. A TuRBO-style local GP is the closest comparator; the paired confidence interval includes zero. Post-confirmation fixed-controller replay finds 5.06 voxel widths of mean recovery together with a 0.0031 increase in worst-mask p99 geometric edge strain; a strict no-added-demand deployment gate retains 48.7% of mean gain. In a frozen development stress test that physically removes 10% of occupied voxels, GP-EI improves 71/75 bodies and exceeds official BoTorch TuRBO by 0.356 mean worst-mask gain. Together, the replayable controllers, body-level inference, and frozen-cohort evaluation provide a reference for measuring the added value of learned damage priors and future adaptation methods.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+  "raw_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda.json b/research/fog-of-knowledge/data/evidence/captures/b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda.json
new file mode 100644
index 000000000..2b113d5c5
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-11530",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:19.740295+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.11530\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.11530</identifier>\n        <datestamp>2026-09-11</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.11530</id>\n        <created>2026-09-10</created>\n            <updated>2026-09-11</updated>\n        <authors>\n                <author>\n                    <keyname>Marzulli</keyname>\n                        <forenames>M.</forenames>\n                </author>\n                <author>\n                    <keyname>Angiolelli</keyname>\n                        <forenames>A.</forenames>\n                </author>\n                <author>\n                    <keyname>Mannino</keyname>\n                        <forenames>C.</forenames>\n                </author>\n                <author>\n                    <keyname>Demuru</keyname>\n                        <forenames>M.</forenames>\n                </author>\n                <author>\n                    <keyname>Sorrentino</keyname>\n                        <forenames>P.</forenames>\n                </author>\n                <author>\n                    <keyname>Corsi</keyname>\n                        <forenames>M. -C.</forenames>\n                </author>\n        </authors>\n        <title>pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The analysis of neuronal avalanches offers insights into brain dynamics utilizing the framework of criticality, but the reproducibility and comparability of studies are limited by the use of fragmented, lab-specific scripts. To address this issue, we introduce pyAvalanches, an open-source Python package providing a standardized, end-to-end pipeline for avalanche analysis from electrophysiological recordings (e.g., electroencephalography-EEG). Starting from the detection of neuronal avalanches the package provides their core statistical characterization, including size and duration distributions. Beyond this, the main aim of pyAvalanches is to characterize the spatiotemporal organization of activity propagation during avalanches. To this end, the core innovation of pyAvalanches is the compuation of Avalanche Transition Matrices (ATMs) to map spatiotemporal propagation patterns. Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches. The entire workflow is encapsulated in a modular and scikit-learn compatible architecture. We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations. By providing a user-friendly, tested, and extensible tool, pyAvalanches facilitates reproducible research, enables the development of novel avalanche-based biomarkers, and makes complex avalanche analysis accessible to a broader scientific community. The package is fully documented and distributed via the Python Package Index (PyPI).</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+  "raw_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892.json b/research/fog-of-knowledge/data/evidence/captures/bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892.json
new file mode 100644
index 000000000..666e10370
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-12393",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:48.110806+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:47Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12393\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12393</identifier>\n        <datestamp>2026-08-14</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12393</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-14</updated>\n        <authors>\n                <author>\n                    <keyname>Conway-Smith</keyname>\n                        <forenames>Brendan</forenames>\n                </author>\n        </authors>\n        <title>Metacognitive Skill Learning: A Computational Account</title>\n            <categories>q-bio.NC</categories>\n            <comments>PhD thesis. Carleton University 2026. Final defended version. https://www.brendanconwaysmith.com/</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This dissertation presents the first formal theory of metacognitive skill learning. Metacognition, the capacity to monitor and control one&#39;s own cognitive processes, has been widely studied, yet the field still lacks a theoretical framework explaining how metacognitive abilities are learned. This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence. The account developed here builds on classic models of skill acquisition from perceptual-motor and cognitive domains. It proposes that metacognitive skill develops primarily through proceduralization, whereby explicit, effortful metacognitive processes are transformed through practice into implicit, automatic routines. The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness. The result is an integrated, mechanistic account of metacognitive skill that organizes existing findings, generates testable predictions, informs the design of AI, and supports the strengthening of metacognitive skill in everyday life.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+  "raw_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3.json b/research/fog-of-knowledge/data/evidence/captures/c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3.json
new file mode 100644
index 000000000..2d4c606b4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-05481",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:40.262634+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.05481\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.05481</identifier>\n        <datestamp>2026-08-07</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.05481</id>\n        <created>2026-08-06</created>\n            <updated>2026-08-07</updated>\n        <authors>\n                <author>\n                    <keyname>Smith</keyname>\n                        <forenames>Andrew L.</forenames>\n                </author>\n                <author>\n                    <keyname>Jiang</keyname>\n                        <forenames>Linxing Preston</forenames>\n                </author>\n                <author>\n                    <keyname>Eshraghian</keyname>\n                        <forenames>Jason K.</forenames>\n                </author>\n                <author>\n                    <keyname>Bull</keyname>\n                        <forenames>Matthew S.</forenames>\n                </author>\n                <author>\n                    <keyname>Recanatesi</keyname>\n                        <forenames>Stefano</forenames>\n                </author>\n        </authors>\n        <title>From Local Learning to Global Prediction Through Layered Surprise Cascades</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hierarchical predictive coding proposes a compelling hypothesis of brain computation, suggesting that the cortex builds layered predictions to minimize surprise. Yet most models rely on error-coding neurons or generative modeling of unclear biological plausibility. Here, we examine a biologically plausible framework in which the functional goals of predictive coding emerge from local contrastive learning and simple activity cancellation. Building on recent machine learning advances, we present a recurrent variant of the Forward-Forward (FF) algorithm with an inverted objective that increases activity for negative data. This setup yields predictive representations across layers, capturing hallmark features of cortical computation such as top-down modulation and surprise signaling. Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+  "raw_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e.json b/research/fog-of-knowledge/data/evidence/captures/c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e.json
new file mode 100644
index 000000000..9dd79a9a0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-17042",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:12.920566+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:12Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.17042\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.17042</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.17042</id>\n        <created>2026-09-15</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Kumar</keyname>\n                        <forenames>Sreejan</forenames>\n                </author>\n                <author>\n                    <keyname>Mattar</keyname>\n                        <forenames>Marcelo</forenames>\n                </author>\n                <author>\n                    <keyname>Duncker</keyname>\n                        <forenames>Lea</forenames>\n                </author>\n        </authors>\n        <title>Learning Options for Compositional Motor Control with Adapter Banks</title>\n            <categories>cs.LG cs.RO q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Learning flexible motor primitives is a hallmark of skilled motor control. Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned. We translate this principle into a novel architecture for learning motor skills end-to-end: a shared recurrent core modulated by a bank of residual adapters, each selected by a discrete latent code. Trained on closed-loop biomechanical control, the adapters develop emergent low-rank perturbations of the recurrent dynamics despite no architectural rank constraint, placing task representations in disparate subspaces of the shared core network. A simple high-level policy over the learned options, optimized while the whole network is frozen, sequences the low-rank adapters to produce novel out-of-distribution movements. We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+  "raw_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da.json b/research/fog-of-knowledge/data/evidence/captures/c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da.json
new file mode 100644
index 000000000..256e6a6c9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-16353",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:38.877234+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:38Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16353\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16353</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16353</id>\n        <created>2026-09-14</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Martin</keyname>\n                        <forenames>Andrea</forenames>\n                </author>\n                <author>\n                    <keyname>Fabiani</keyname>\n                        <forenames>Filippo</forenames>\n                </author>\n                <author>\n                    <keyname>Belgioioso</keyname>\n                        <forenames>Giuseppe</forenames>\n                </author>\n        </authors>\n        <title>Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Operator splitting methods are a fundamental class of algorithms for solving structured monotone inclusion problems arising in optimization, control, and game theory. We consider the case, common in stochastic regimes, where the forward evaluation of one of the constituent operators is either unavailable in closed form or computationally expensive to evaluate, and is therefore approximated using a finite number of noisy oracle samples. We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms. Unlike previous works, our analysis directly controls the residual error via martingale inequalities instead of relying on algorithmic stability arguments for a tailored surrogate loss, yielding the first a priori certificates whose statistical excess provably vanishes with the sample size. We further show that, under linear convergence of the Davis-Yin splitting algorithm, the dependence of our bounds on the iteration count improves from linear growth to exponential decay. We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+  "raw_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab.json b/research/fog-of-knowledge/data/evidence/captures/c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab.json
new file mode 100644
index 000000000..bc1759e3b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-17248",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:32.871311+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:32Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.17248\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.17248</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.17248</id>\n        <created>2026-07-31</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Atef</keyname>\n                        <forenames>Mohamed</forenames>\n                </author>\n                <author>\n                    <keyname>Alahakoon</keyname>\n                        <forenames>Sanath</forenames>\n                </author>\n                <author>\n                    <keyname>Mumtahina</keyname>\n                        <forenames>Umme</forenames>\n                </author>\n                <author>\n                    <keyname>Wolfs</keyname>\n                        <forenames>Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Khatib</keyname>\n                        <forenames>Tamer</forenames>\n                </author>\n                <author>\n                    <keyname>Uddin</keyname>\n                        <forenames>Moslem</forenames>\n                </author>\n        </authors>\n        <title>Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hydrogen-enabled community microgrids require coordinated control of intermittent renewable generation and coupled battery and hydrogen storage. This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup. Raw continuous actions are projected onto the feasible operating set before evaluating the hourly power balance, ensuring operationally valid dispatch.\n  The proof-of-concept study uses 8,760 hourly observations for a 1,000-household community in Rockhampton, Australia. The same annual chronology and one random seed were used for training and evaluation. Under a 1 percent independent hourly grid outage probability, the system achieved an annual net operating cash balance of AUD 195,690.67, load satisfaction of 99.77 percent, and a gross renewable share of 91.2 percent. After removing duplicated hydrogen electricity emissions, annual emissions were 1.342 kt CO2, equivalent to 0.328 kg CO2 per kWh of served demand and 0.087 kg CO2 per kWh of export-inclusive delivered energy.\n  At a 5 percent outage probability, the cash balance decreased to AUD 169,892.21 and load satisfaction fell to 98.79 percent. Battery discharge and diesel generation increased more than fuel cell output. The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+  "raw_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba.json b/research/fog-of-knowledge/data/evidence/captures/c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba.json
new file mode 100644
index 000000000..87ea5a6c1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-19722",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:30.213616+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T14:47:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19722\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19722</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>cs:cs:SD</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19722</id>\n        <created>2026-10-14</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Cao</keyname>\n                        <forenames>Zhe</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jichao</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Xiao-Lei</forenames>\n                </author>\n        </authors>\n        <title>ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition</title>\n            <categories>cs.SD cs.AI eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Recent advances in deep learning have significantly improved underwater acoustic vessel recognition. However, existing publicly available datasets are typically limited in scale, hindering large-scale representation learning and downstream task evaluation. To address this limitation, we introduce ONCship, a large-scale underwater acoustic dataset comprising 4521 hours of curated recordings from Ocean Networks Canada (ONC) hydrophones and Automatic Identification System (AIS) data. We evaluate the proposed dataset across three tasks: self-supervised representation learning, vessel-type classification, and MMSI-Level Vessel Classification. Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing. Furthermore, incorporating ONCship as auxiliary training data improves downstream vessel-type classification performance. Beyond conventional vessel-type classification, we further investigate MMSI-Level Vessel Classification, treating each vessel as a distinct identity. Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification. Overall, ONCship provides a valuable resource for underwater acoustic representation learning and vessel recognition, while its rich vessel-level metadata enables further exploration of MMSI-Level Vessel Classification.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+  "raw_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2.json b/research/fog-of-knowledge/data/evidence/captures/c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2.json
new file mode 100644
index 000000000..6483f661b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-29832",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:35.415397+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:35Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.29832\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.29832</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.29832</id>\n        <created>2026-09-24</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Matt</keyname>\n                        <forenames>Justin J.</forenames>\n                </author>\n                <author>\n                    <keyname>Altamirano</keyname>\n                        <forenames>George V.</forenames>\n                </author>\n        </authors>\n        <title>System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs</title>\n            <categories>eess.SY cs.RO cs.SY</categories>\n            <comments>31 pages, 18 figures. Presented at the AIAA AVIATION Forum 2025. Accepted for publication in the AIAA Journal of Aircraft</comments>\n            <journal-ref>AIAA Journal of Aircraft, Article in Advance (2026)</journal-ref>\n            <doi>10.2514/1.C038636</doi>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>A new method for multi-input flight maneuver design for system identification is presented. The method consists of injecting &#34;full-harmonic&#34; orthogonal multisine signals into the flight control system. Orthogonality is achieved by repeating maneuvers with changing multisine polarities. The multisines can contain the same frequency content, which can simplify frequency response estimation and allow for long flight maneuvers to be split into several shorter maneuvers while maintaining the same frequency resolution and minimum frequency. An input allocation scheme is presented that augments the multisines to size the vehicle response amplitude about a specific degree of freedom. The developed approach was demonstrated through flight testing of a small octocopter in near-hover conditions. The input allocation scheme was utilized successfully to increase excitation about the yaw axis. Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately. The models are parameterized primarily by rotor thrust and torque coefficients, making them suitable for analysis of aircraft flight dynamics and individual rotor aerodynamics. The results demonstrate that the near-hover flight dynamics can be modeled accurately by neglecting rotor hub moments, variations in rotor coefficients, gyroscopic moments in roll and pitch, and aerodynamic interaction effects.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+  "raw_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af.json b/research/fog-of-knowledge/data/evidence/captures/c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af.json
new file mode 100644
index 000000000..21e2eb06c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-21057",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:25.151858+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21057\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21057</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21057</id>\n        <created>2026-09-17</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Rahimi</keyname>\n                        <forenames>Herlock</forenames>\n                </author>\n                <author>\n                    <keyname>Kalogerias</keyname>\n                        <forenames>Dionysis</forenames>\n                </author>\n        </authors>\n        <title>FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift</title>\n            <categories>cs.LG cs.DC cs.SY eess.SP eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic client participation. Remedies built on classical Federated Averaging (FedAvg) typically presuppose that client participation probabilities are known to the server, which is rarely the case in deployed systems. We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses. Building on this characterization, we propose \\emph{Federated Risk-Averse Averaging} (\\textsc{FedeRage}), a risk-averse extension of FedAvg that embeds the \\emph{Conditional Value-at-Risk} (CVaR) into the local objective within a natural distributionally robust optimization (DRO) framework. \\textsc{FedeRage} implicitly upweights high-loss and infrequently participating clients while adding only a \\emph{single scalar per-client}, and admits an $\\mathcal{O}(κ/\\sqrt{T})$ rate in which the factor $κ$ is the upper bound on the ``price&#34; of risk aversion. In contrast with aggregation-alignment schemes based on optimal transport, which require the availability distribution as an input, \\textsc{FedeRage} remains agnostic to it. Several experiments on three heterogeneous benchmarks indicate consistent improvements over state-of-the-art methods in accuracy, fairness, and convergence speed.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+  "raw_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661.json b/research/fog-of-knowledge/data/evidence/captures/cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661.json
new file mode 100644
index 000000000..74ac55850
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-07289",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:36.613719+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.07289\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.07289</identifier>\n        <datestamp>2026-08-10</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:LO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.07289</id>\n        <created>2026-08-07</created>\n            <updated>2026-08-10</updated>\n        <authors>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Wayne</forenames>\n                </author>\n                <author>\n                    <keyname>Bhatnagar</keyname>\n                        <forenames>Archit</forenames>\n                </author>\n                <author>\n                    <keyname>Miao</keyname>\n                        <forenames>Tongyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Kalamkar</keyname>\n                        <forenames>Saniya</forenames>\n                </author>\n                <author>\n                    <keyname>Cui</keyname>\n                        <forenames>Wenqi</forenames>\n                </author>\n                <author>\n                    <keyname>Incer</keyname>\n                        <forenames>Inigo</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Ang</forenames>\n                </author>\n        </authors>\n        <title>Synthesizing Voltage Ride-Through Controllers for Data Centers</title>\n            <categories>eess.SY cs.DC cs.LO cs.SY</categories>\n            <comments>12 pages, 10 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Data centers are among the power grid&#39;s fastest-growing loads. Since data center servers are sensitive electronic components, they need to be protected against the grid&#39;s voltage disturbances during grid faults. While disconnecting from the grid achieves this, it can further destabilize the power system if many data centers trip at once. To address this emerging concern, voltage ride-through (VRT) grid codes have been proposed to standardize data center behavior. They require a data center to stay connected for a period of time through the disturbance, hold an active power floor, and recover its draw within a deadline upon restoration. However, systematically designing and certifying controllers that satisfy these coupled temporal and operational requirements remains challenging.\n  We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods. We develop a specification language that expresses a grid code in Signal Temporal Logic (STL) as the basis for formal reasoning. Our encoding algorithm takes the specification, along with a model of the data center&#39;s power topology, and translates the constraints into a controller synthesis problem. This step produces a correct-by-construction controller if a solution can be found, or a proof that no such controller exists. For the latter case, SolVRT provides a diagnostic step: it traces the facility&#39;s &#34;conflict frontier,&#34; isolates the conflicting clauses that led to non-compliance, and computes the smallest hardware or workload change that would enable compliance. We evaluate SolVRT through closed-loop simulations of a 200 MW data center connected to a 140-bus transmission system. The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+  "raw_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c.json b/research/fog-of-knowledge/data/evidence/captures/cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c.json
new file mode 100644
index 000000000..657c6a288
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-20723",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:40.332186+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.20723\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.20723</identifier>\n        <datestamp>2026-08-24</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n            <setSpec>cs:cs:SC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.20723</id>\n        <created>2026-08-21</created>\n            <updated>2026-08-24</updated>\n        <authors>\n                <author>\n                    <keyname>Yang</keyname>\n                        <forenames>Tianming</forenames>\n                </author>\n        </authors>\n        <title>Conscious Access as Continuous-to-Discrete Translation</title>\n            <categories>q-bio.NC cs.SC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The scientific study of consciousness frequently stalls on ontological debates regarding the &#34;Hard Problem.&#34; This paper proposes a pragmatic pivot. Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence. We introduce the Continuous/Discrete (C/D) framework, which holds that the brain implements two distinct processing regimes: System C, a distributed sensory-motor network operating over continuous, high-dimensional manifolds, and System D, a centralized engine structured around discrete, scale-invariant symbols. We argue that conscious access requires a structure-preserving translation between these regimes, which maps localized continuous states onto discrete symbolic tokens, coupled with an inverse projection that grounds those tokens back into sensorimotor dynamics. By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes. These predictions explicitly differentiate our account from Global Neuronal Workspace Theory, Integrated Information Theory, Predictive Processing, and Higher-Order Theories, shifting the focus from ontological status to computational mechanism. Beyond neuroscience, the framework provides a principled architecture for neuro-symbolic artificial intelligence. We argue that treating conscious access as translational computation offers a pragmatic, empirically tractable pathway forward, clarifying what conscious states functionally accomplish without requiring resolution of the hard problem of phenomenology.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+  "raw_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f.json b/research/fog-of-knowledge/data/evidence/captures/ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f.json
new file mode 100644
index 000000000..65f63fd00
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-11175",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:10.765600+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T03:31:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.11175\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.11175</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.11175</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Kelkar</keyname>\n                        <forenames>Sachin Sunil</forenames>\n                </author>\n                <author>\n                    <keyname>Dokania</keyname>\n                        <forenames>Tanmay</forenames>\n                </author>\n                <author>\n                    <keyname>Nakka</keyname>\n                        <forenames>Yashwanth Kumar</forenames>\n                </author>\n        </authors>\n        <title>Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>3 pages, 4 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>For autonomous space exploration, robotic agents need to perform motion planning in which environmental interactions may be unknown. Learning these interactions, such as terrain mechanics for wheeled robots, can introduce uncertainties that lead to risky motion plans and potentially hazardous operations or mission failures. Moreover, uncertainties induced by perception-based systems can exacerbate the problem of safe motion planning. In this letter, we address the problem of performing cost-optimal kinodynamic motion planning with risk awareness. We approach this in two steps. First, a sampling-based planner (AO-RRT) generates a dynamically feasible, risk-aware, and asymptotically cost-optimal trajectory. Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution. By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+  "raw_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6.json b/research/fog-of-knowledge/data/evidence/captures/d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6.json
new file mode 100644
index 000000000..82793166c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-11869",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:21.858745+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-13T08:17:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.11869\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.11869</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n            <setSpec>math:math:ST</setSpec>\n            <setSpec>stat:stat:TH</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.11869</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Ruwanpathirana</keyname>\n                        <forenames>Aravinda Kanchana</forenames>\n                </author>\n                <author>\n                    <keyname>Tyagi</keyname>\n                        <forenames>Hemant</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Sunny G. W.</forenames>\n                </author>\n        </authors>\n        <title>Learning structured linear dynamical systems from missing observations</title>\n            <categories>stat.ML cs.LG cs.SY eess.SY math.OC math.ST stat.TH</categories>\n            <comments>62 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider the problem of learning structured linear dynamical systems over convex sets $\\mathcal{K}$, where only a small subset of the observations are available at each time point. An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed. Non-asymptotic bounds are obtained for the statistical error, which depend on the local complexity of $\\mathcal{K}$, the trajectory length $T$, and the sub-sampling probability $p$. Convergence of the projected gradient descent algorithm is also established. The general theory is applied to settings where (i) $\\mathcal{K}$ is a subspace, (ii) $\\mathcal{K}$ is the set of bi-isotonic matrices, and (iii) $\\mathcal{K}$ is the set of matrices whose rows are formed by sampling Lipschitz functions. We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+  "raw_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a.json b/research/fog-of-knowledge/data/evidence/captures/d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a.json
new file mode 100644
index 000000000..3955be4a2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-11929",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:06.672757+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.11929\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.11929</identifier>\n        <datestamp>2026-08-13</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.11929</id>\n        <created>2026-08-12</created>\n            <updated>2026-08-13</updated>\n        <authors>\n                <author>\n                    <keyname>Salehi</keyname>\n                        <forenames>Amin</forenames>\n                </author>\n                <author>\n                    <keyname>Seppanen</keyname>\n                        <forenames>Janne</forenames>\n                </author>\n                <author>\n                    <keyname>Pourakbari-Kasmaei</keyname>\n                        <forenames>Mahdi</forenames>\n                </author>\n        </authors>\n        <title>Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs). This becomes particularly of higher importance under transient disturbances. However, coordinated dynamic interactions of these coupled subsystems remain largely unexplored. This article addresses such gap by developing a dynamic model for an integrated electrolyzer-EDCS system and designing appropriate PID control schemes to address the potential disturbances affecting either component. To this end, linearized models of the electrolyzer and EDCS are first derived to enable systematic controller design. Then, two PID controllers, representing conservative and fast-tracking designs, are developed to coordinate the system response. The developed coordinated model is examined and verified under four different cases. The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer. Controlling the electrolyzer flow in response to EDCS disturbances coordinates system dynamics and mitigates undesirable transient fluctuations. Conversely, under electrolyzer disturbances, regulating the EDCS torque eliminates inconsistent responses in pressure, flow, and rotational speed, while preventing hazardous transient undershoots and overshoots. Overall, the proposed framework guarantees transient stability and operational reliability of the integrated electrolyzer-EDCS system.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+  "raw_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae.json b/research/fog-of-knowledge/data/evidence/captures/d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae.json
new file mode 100644
index 000000000..23ff426a0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-18396",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:50.736323+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:50Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.18396\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.18396</identifier>\n        <datestamp>2026-08-20</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.18396</id>\n        <created>2026-08-18</created>\n            <updated>2026-08-20</updated>\n        <authors>\n                <author>\n                    <keyname>Ashtekar</keyname>\n                        <forenames>Amod</forenames>\n                </author>\n                <author>\n                    <keyname>Davis</keyname>\n                        <forenames>Dalton</forenames>\n                </author>\n                <author>\n                    <keyname>Lomboy</keyname>\n                        <forenames>Rafaela</forenames>\n                </author>\n                <author>\n                    <keyname>Ibrahim</keyname>\n                        <forenames>Omar</forenames>\n                </author>\n                <author>\n                    <keyname>Bandari</keyname>\n                        <forenames>Raj Sai Sohel</forenames>\n                </author>\n                <author>\n                    <keyname>Eltayeb</keyname>\n                        <forenames>Mohammed E.</forenames>\n                </author>\n        </authors>\n        <title>LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Highly directional 60-GHz Internet-of-Things (IoT) links can exploit naturally occurring indoor surfaces to sustain connectivity under blockage. Identifying viable non-line-of-sight (NLoS) paths, however, can require extensive RF beam training. This paper investigates whether LiDAR can reduce this search overhead by providing a surface-aware prior without assuming a direct mapping between optical return and mmWave reflection. The proposed framework uses LiDAR-derived geometry and return statistics to rank candidate propagation directions, while RF measurements remain responsible for final beam selection. The experimental validation is organized in three stages to separate descriptor robustness, cross-modal association, and beam-search performance. Controlled LiDAR measurements first quantify how geometric and radiometric surface descriptors vary with acquisition geometry. Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction. Finally, a separate room-scale campaign evaluates the resulting prior using exhaustive TX-RX beam maps without prescribing the underlying propagation mechanism. The measurements show that descriptor reliability depends on acquisition geometry and point-cloud representation, and that LiDAR and RF surface responses exhibit cross-modal association without supporting deterministic RF-power prediction. In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region. These results establish LiDAR-derived local surface structure as a communication-oriented prior for concentrating RF probing and reducing mmWave beam-search uncertainty.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+  "raw_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe.json b/research/fog-of-knowledge/data/evidence/captures/d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe.json
new file mode 100644
index 000000000..565901563
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-25701",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:49.238504+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:49Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25701\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25701</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:MA</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25701</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Lee</keyname>\n                        <forenames>Haejoon</forenames>\n                </author>\n                <author>\n                    <keyname>Panagou</keyname>\n                        <forenames>Dimitra</forenames>\n                </author>\n        </authors>\n        <title>Fully Byzantine-Resilient Multi-Agent Reinforcement Learning</title>\n            <categories>cs.LG cs.MA cs.SY eess.SY</categories>\n            <comments>12 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through local interactions. Existing methods guarantee convergence of the agents&#39; parameters only to a neighborhood of the attack-free limit points, resulting in degraded performance. We propose Fully Resilient AC-MARL (FRAC-MARL), a decentralized method in which each agent leverages redundancy in two-hop messages to identify reliable messages. Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs. We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time. Finally, we demonstrate our method on cooperative multi-robot formation control tasks.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+  "raw_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2.json b/research/fog-of-knowledge/data/evidence/captures/d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2.json
new file mode 100644
index 000000000..c180d1fa0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-02978",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:10.661819+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:10Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02978\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02978</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02978</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Salimi</keyname>\n                        <forenames>Arastoo H</forenames>\n                </author>\n                <author>\n                    <keyname>Nazaripouya</keyname>\n                        <forenames>Hamidreza</forenames>\n                </author>\n        </authors>\n        <title>Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper proposes a new automated decision-making framework to enhance the resilience of electrical systems against wildfires by applying operational strategies that account for decision-dependent uncertainty (DDU). The proposed framework incorporates both preventive and corrective measures, enabling adaptive and automated decision-making throughout the course of evolving wildfire scenarios. First, a baseline multistage optimization model is presented as a foundation to support wildfire-driven operational decision-making. The model then incorporates DDU, wherein Public Safety Power Shutoff (PSPS) decisions made in earlier stages influence the probabilities and parameters of future wildfire scenarios. To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed. The effectiveness of the proposed approach is demonstrated through case studies on the IEEE 30-bus system. Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+  "raw_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff.json b/research/fog-of-knowledge/data/evidence/captures/d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff.json
new file mode 100644
index 000000000..fa085a2e6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-19468",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:28.543442+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:28Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.19468\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.19468</identifier>\n        <datestamp>2026-09-18</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.19468</id>\n        <created>2026-09-16</created>\n            <updated>2026-09-18</updated>\n        <authors>\n                <author>\n                    <keyname>Hsu</keyname>\n                        <forenames>Tzu-Hsuan</forenames>\n                </author>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Zihuan</forenames>\n                </author>\n                <author>\n                    <keyname>Gupta</keyname>\n                        <forenames>Harshvardhan</forenames>\n                </author>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Ziqian</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Wei</forenames>\n                </author>\n                <author>\n                    <keyname>Chulukhadze</keyname>\n                        <forenames>Vakhtang</forenames>\n                </author>\n                <author>\n                    <keyname>Kramer</keyname>\n                        <forenames>Jack</forenames>\n                </author>\n                <author>\n                    <keyname>Hall</keyname>\n                        <forenames>Neal</forenames>\n                </author>\n                <author>\n                    <keyname>Lu</keyname>\n                        <forenames>Ruochen</forenames>\n                </author>\n        </authors>\n        <title>High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization</title>\n            <categories>eess.SP</categories>\n            <comments>10 pages, 9 figures, 2 tables. Submitted to IEEE Journal of Microelectromechanical Systems</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents the design, characterization, and large-signal measurement methodology of a high-order whip-mode flexural microresonator on a lithium tantalate-on-insulator (LTOI) unimorph platform. A tapered cantilever concentrates kinetic energy at the free tip through a structural velocity amplification effect, with a targeted whip mode at 9.175 MHz exhibiting a measured Q of 691 in air. The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies. In-air large-signal testing on a separate device confirms tip velocities up to 20 m/s before the reliable measurement range of the laser Doppler vibrometer (LDV) at the tapered tip is exceeded, while the device itself sustains drive levels up to 240 Vpp before failure. Transitioning to vacuum reveals photothermal-induced static bending of the LTOI cantilever under LDV laser illumination, an effect that prohibits direct velocity measurement for these resonators. Hence, it motivates an indirect extraction methodology to be implemented. In this work, a 3.85 times base-to-tip geometric amplification factor, independently calibrated at low drive, is applied to base velocity measurements to infer tip velocity under large-signal conditions. Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate. Large-signal failure-mode analysis identifies Pt/Au electrode melting at 210 Vpp as the current velocity ceiling. These results suggest that geometric amplification in high-order flexural modes offers a viable pathway toward the high proof-mass velocities targeted for next-generation MEMS inertial sensors.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+  "raw_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1.json b/research/fog-of-knowledge/data/evidence/captures/da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1.json
new file mode 100644
index 000000000..4a4415990
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-22775",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:06.417205+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.22775\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.22775</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:AR</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.22775</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Pham</keyname>\n                        <forenames>Thanh</forenames>\n                </author>\n                <author>\n                    <keyname>Islam</keyname>\n                        <forenames>Riadul</forenames>\n                </author>\n        </authors>\n        <title>DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks</title>\n            <categories>cs.AI cs.AR eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons. However, two challenges limit their practical deployment. First, fixed-parameter Leaky Integrate-and-Fire (LIF) neurons lack the adaptation mechanisms observed in biology, where neurons modulate their excitability based on firing history. Second, scaling from single neurons to multi-neuron networks introduces challenges in synaptic weight distribution and inter-neuron spike routing that are absent in isolated designs. This paper addresses both issues through the extension, verification, and physical implementation of adaptive LIF neurons at three architectural scales. This work contributes: a 2nd-order neuron with two-stage synaptic filtering for richer temporal dynamics; a fully-connected 6-neuron spiking network with configurable weights (100 to 5) demonstrating weight-based inter-neuron communication; and a direct verification methodology enabling per-cycle observation of all internal states. All designs were synthesized targeting Selected Area Electron Diffraction (SAED) 14 nm Complementary Metal-Oxide-Semiconductor (CMOS) technology at 1 GHz and verified with Cocotb-based Python testbenches under pulsed current stimuli (amplitude 80, ISI=3). The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes). Physically, the 2nd-order neuron costs 1.77x more area and 1.52x more power than the 1st-order baseline, while the 6-neuron network demonstrates near-linear scaling (5.7x area, 5.3x power). Seven verification bugs spanning testbench connectivity, fixed-point overflow, and Verilog expression-width semantics are documented.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+  "raw_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540.json b/research/fog-of-knowledge/data/evidence/captures/db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540.json
new file mode 100644
index 000000000..7c34f85d0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-07307",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:51.048449+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-14T10:06:57Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.07307\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.07307</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.07307</id>\n        <created>2026-10-05</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Mahesh</keyname>\n                        <forenames>Karan</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Runyu</forenames>\n                </author>\n                <author>\n                    <keyname>Benjamin</keyname>\n                        <forenames>Michael R.</forenames>\n                </author>\n                <author>\n                    <keyname>Zardini</keyname>\n                        <forenames>Gioele</forenames>\n                </author>\n        </authors>\n        <title>Metric-Based Equilibrium Selection in Noncooperative Differentiable Games</title>\n            <categories>cs.GT cs.SY eess.SY</categories>\n            <comments>8 pages, 2 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Metric conditioning can change which equilibrium attracts learning dynamics without moving the equilibria of a differentiable game. We study how to use state-dependent symmetric positive-definite (SPD) metrics to select among known equilibria by keeping a designated equilibrium attracting while making a rival unstable. Building on classical results on matrix stability under positive-definite multiplication, we characterize when such destabilization is possible and show how restricting the metric to act independently on each player limits the stability changes that can be achieved at differential Nash equilibria. We then combine a stabilizing metric at the selected equilibrium with a destabilizing metric at the rival through smooth interpolation, yielding a single metric field that preserves every equilibrium of the game while assigning the desired local stability types. We also derive a step-size condition for implementing the method in discrete time. The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+  "raw_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e.json b/research/fog-of-knowledge/data/evidence/captures/db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e.json
new file mode 100644
index 000000000..15a465c09
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-28815",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:38.919663+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:38Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.28815\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.28815</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.28815</id>\n        <created>2026-09-23</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Eslami</keyname>\n                        <forenames>Shima</forenames>\n                </author>\n                <author>\n                    <keyname>Kaleva</keyname>\n                        <forenames>Jarkko</forenames>\n                </author>\n                <author>\n                    <keyname>Tölli</keyname>\n                        <forenames>Antti</forenames>\n                </author>\n        </authors>\n        <title>Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Near-field (N-F) line-of-sight (LoS) MIMO channels admit a compact representation through a small number of geometric parameters describing the relative transceiver geometry, enabling low-overhead channel acquisition without estimating the full channel matrix. This paper considers downlink (DL) channel acquisition under practical asymmetric user-equipment (UE) antenna capabilities with multiple DL receive antennas, but only a single active uplink (UL) transmit chain. In this setting, UL observations across the large BS aperture enable accurate estimation of the relative location of the UL-active UE antenna but are insufficient to determine the orientation of the entire UE array. We propose a two-stage geometry-based N-F LoS MIMO channel acquisition framework that distributes the estimation of the channel-defining geometric parameters between the BS and UE. First, a single UL pilot sequence enables the BS to estimate two BS-side reference angles that parameterize the relative location of the UL-active UE antenna. The BS conveys these estimates to the UE and transmits two DL pilot sequences, from which the UE estimates the remaining array-orientation parameter. We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty. Numerical results characterize the resulting error propagation and demonstrate accurate estimation of the geometric parameters and reconstruction of the LoS MIMO channel using one UL and two DL pilot sequences.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+  "raw_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5.json b/research/fog-of-knowledge/data/evidence/captures/dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5.json
new file mode 100644
index 000000000..00899c22c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-31034",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:13.664613+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.31034\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.31034</identifier>\n        <datestamp>2026-09-01</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.31034</id>\n        <created>2026-08-31</created>\n            <updated>2026-09-01</updated>\n        <authors>\n                <author>\n                    <keyname>Guarino</keyname>\n                        <forenames>Idio</forenames>\n                </author>\n                <author>\n                    <keyname>Nascita</keyname>\n                        <forenames>Alfredo</forenames>\n                </author>\n                <author>\n                    <keyname>Ciuonzo</keyname>\n                        <forenames>Domenico</forenames>\n                </author>\n                <author>\n                    <keyname>Carra</keyname>\n                        <forenames>Damiano</forenames>\n                </author>\n                <author>\n                    <keyname>Pescapé</keyname>\n                        <forenames>Antonio</forenames>\n                </author>\n        </authors>\n        <title>XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition</title>\n            <categories>eess.SP</categories>\n            <comments>accepted at 22nd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 26)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Wi-Fi Channel State Information (CSI) has emerged as a key enabler for device-free Human Activity Recognition (HAR), enabling low-cost, unobtrusive sensing using existing communication infrastructure. However, Deep Learning (DL) models trained on CSI data often struggle to generalize across users, environments, and device setups due to the context sensitivity of wireless propagation. Despite this challenge, limited attention has been devoted to understanding model decisions and generalization failures. This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems. XAI2CSI employs SAGE, a model-agnostic explainability method, to quantify temporal, spectral, and spatial CSI contributions to HAR decisions under nominal and cross-context evaluations on IEEE 802.11ax data. Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change. The proposed methodology and findings provide a reference framework to explore alternative solutions and guide the development of robust, transparent Wi-Fi sensing systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+  "raw_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c.json b/research/fog-of-knowledge/data/evidence/captures/e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c.json
new file mode 100644
index 000000000..78c1a9910
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-14022",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:45.752182+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.14022\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.14022</identifier>\n        <datestamp>2026-09-15</datestamp>\n            <setSpec>cs:cs:NI</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.14022</id>\n        <created>2026-09-12</created>\n            <updated>2026-09-15</updated>\n        <authors>\n                <author>\n                    <keyname>Haigh</keyname>\n                        <forenames>Paul Anthony</forenames>\n                </author>\n                <author>\n                    <keyname>Rajbhandari</keyname>\n                        <forenames>Sujan</forenames>\n                </author>\n                <author>\n                    <keyname>Bottrill</keyname>\n                        <forenames>Kyle</forenames>\n                </author>\n                <author>\n                    <keyname>Trichili</keyname>\n                        <forenames>Abderrahmen</forenames>\n                </author>\n                <author>\n                    <keyname>Watson</keyname>\n                        <forenames>Scott</forenames>\n                </author>\n                <author>\n                    <keyname>Abumarshoud</keyname>\n                        <forenames>Hanaa</forenames>\n                </author>\n                <author>\n                    <keyname>Benton</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Sinanovic</keyname>\n                        <forenames>Sinan</forenames>\n                </author>\n                <author>\n                    <keyname>Herrnsdorf</keyname>\n                        <forenames>Johannes</forenames>\n                </author>\n                <author>\n                    <keyname>Christopher</keyname>\n                        <forenames>Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Khalily</keyname>\n                        <forenames>Mohsen</forenames>\n                </author>\n                <author>\n                    <keyname>Tafazolli</keyname>\n                        <forenames>Rahim</forenames>\n                </author>\n                <author>\n                    <keyname>Haas</keyname>\n                        <forenames>Harad</forenames>\n                </author>\n                <author>\n                    <keyname>Lavery</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Popoola</keyname>\n                        <forenames>Wasiu</forenames>\n                </author>\n        </authors>\n        <title>Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space</title>\n            <categories>cs.NI eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Next-generation connectivity depends on data traversing multiple physical media within a single end-to-end path, yet research in optical fibre, free-space optical and radio wireless, non-terrestrial networks, and underwater communications has advanced largely in isolation. This fragmentation has a wider adverse impact on communication performance, deployment and adaption as the most demanding open problems in next-generation connectivity, cross-medium channel characterisation, transport-layer protocol design across heterogeneous latency regimes, and cross-domain orchestration, sit at the boundaries between domains and can only be addressed by bringing these challenges together in cross-domain systems. Space-air-ground integrated network research has begun to treat three domains analytically, and its recent extension to the sea surface represents the most ambitious multi-domain framework proposed to date, yet neither has produced experimental results, a deployed system, or a standards engagement. The subsurface and maritime domain remains absent from both. This paper proposes the connected heterogeneous all-medium integrated network (CHAIN), a framework that treats the undersea, maritime, terrestrial, aerial and space domains as a single design space. We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge. We survey the state of the art across all domains and the existing cross-domain literature, develop the CHAIN framework and its technical pillars, characterise the five core open problems the field must resolve, and set out a research roadmap from near-term measurement campaigns and testbed validation through cross-medium field trials to global-scale deployment.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+  "raw_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d.json b/research/fog-of-knowledge/data/evidence/captures/e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d.json
new file mode 100644
index 000000000..1dfa4881c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-03967",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:02.666601+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:00Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.03967\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.03967</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.03967</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Raykov</keyname>\n                        <forenames>Yordan</forenames>\n                </author>\n                <author>\n                    <keyname>Veiga</keyname>\n                        <forenames>Rodrigo</forenames>\n                </author>\n        </authors>\n        <title>Information-Geometric Forward Policy Training in GFlowNets</title>\n            <categories>stat.ML cs.LG</categories>\n            <comments>13 pages + appendix</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward. In this work, we formulate forward-policy training in GFlowNets through the information geometry of the induced trajectory sampler. Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable. We derive an exact decomposition of the trajectory Fisher into per-step conditional second moments, which clarifies when temporal score interactions vanish and when dense couplings remain under shared parameterisation. This leads to three computational regimes: settings with tractable exact Fisher information, settings where Monte Carlo estimators of the expected Fisher are sufficient, and structure-exploitable settings in which target locality or factorisation yields accurate approximations of the Fisher expectation. In the latter case, graphical-model tools such as exact marginalisation, separator methods, and belief propagation provide principled surrogates for natural-gradient updates. The resulting framework turns target structure into optimisation geometry and yields a tractable route to structure-aware forward-policy training in GFlowNets. We illustrate the framework empirically through examples comparing convergence and exploration behaviour under Riemannian and Euclidean optimisation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+  "raw_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8.json b/research/fog-of-knowledge/data/evidence/captures/e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8.json
new file mode 100644
index 000000000..0c7e873fd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-22049",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:32:55.113626+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:32:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.22049\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.22049</identifier>\n        <datestamp>2026-07-27</datestamp>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.22049</id>\n        <created>2026-07-24</created>\n            <updated>2026-07-27</updated>\n        <authors>\n                <author>\n                    <keyname>Schmidt</keyname>\n                        <forenames>Adrian</forenames>\n                </author>\n                <author>\n                    <keyname>Vermaas</keyname>\n                        <forenames>Pieter</forenames>\n                </author>\n                <author>\n                    <keyname>Seskir</keyname>\n                        <forenames>Zeki C.</forenames>\n                </author>\n        </authors>\n        <title>ELSA as an asset to the EU Quantum Act: A position paper</title>\n            <categories>physics.soc-ph</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Europe&#39;s expertise in the ethical, legal, and social aspects (ELSA) of emerging technologies is a strategic asset for the successful and sovereign development of quantum technologies. In this position paper, we argue that this expertise should become a central part of the upcoming EU Quantum Act. At a time when quantum technologies are becoming more powerful, economically relevant, and geopolitically contested, European policy should not reduce societal considerations to risk assessment and ex-post regulation. Instead, ELSA expertise can translate European values into technological practices, governance structures, and concrete policy measures, thereby supporting a development which is responsible, socially robust, and competitive. Taking inspiration from the role of concept cars, we present eight aspirational ELSA recommendations that demonstrate what a distinctly European approach to quantum technologies could offer. These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies. Together, we show that ELSA is not only about mitigating risks. It can also amplify benefits, increase legitimacy and societal acceptance, support economic prosperity, and contribute to a truly sovereign European quantum future.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+  "raw_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a.json b/research/fog-of-knowledge/data/evidence/captures/eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a.json
new file mode 100644
index 000000000..983b9ddd4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-23972",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:43:20.616948+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.23972\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.23972</identifier>\n        <datestamp>2026-08-26</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.23972</id>\n        <created>2026-08-25</created>\n            <updated>2026-08-26</updated>\n        <authors>\n                <author>\n                    <keyname>Zhao</keyname>\n                        <forenames>Yiqi</forenames>\n                </author>\n                <author>\n                    <keyname>Kim</keyname>\n                        <forenames>Taekyung</forenames>\n                </author>\n                <author>\n                    <keyname>Okamoto</keyname>\n                        <forenames>Hideki</forenames>\n                </author>\n                <author>\n                    <keyname>Hoxha</keyname>\n                        <forenames>Bardh</forenames>\n                </author>\n                <author>\n                    <keyname>Deshmukh</keyname>\n                        <forenames>Jyotirmoy V.</forenames>\n                </author>\n                <author>\n                    <keyname>Lindemann</keyname>\n                        <forenames>Lars</forenames>\n                </author>\n                <author>\n                    <keyname>Fainekos</keyname>\n                        <forenames>Georgios</forenames>\n                </author>\n        </authors>\n        <title>Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL). Our approach encodes discrete-time STL formulas into candidate time-varying control barrier functions (CBF), which are integrated into a model predictive path integral (MPPI) controller. Our method inherits the benefits of low computational cost from an efficiently parallelizable sampling based planner and utilizes CBF for constraints expressed in STL. We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency. We show a quadcopter planning experiment with NVIDIA Isaac Lab.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+  "raw_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7.json b/research/fog-of-knowledge/data/evidence/captures/ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7.json
new file mode 100644
index 000000000..b1169d873
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-21093",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:42:20.515703+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21093\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21093</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21093</id>\n        <created>2026-09-17</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Ahmed</keyname>\n                        <forenames>Nameer Fawwaz</forenames>\n                </author>\n                <author>\n                    <keyname>Fleming</keyname>\n                        <forenames>Cody</forenames>\n                </author>\n                <author>\n                    <keyname>Shoukry</keyname>\n                        <forenames>Yasser</forenames>\n                </author>\n        </authors>\n        <title>A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As Urban Air Mobility (UAM) systems scale toward high-density operations, managing autonomous Unmanned Aerial Vehicle (UAV) traffic requires control frameworks that are both tractable and safety-critical. This paper presents a principled optimal control-theoretic foundation for routing in multi-destination UAM networks subject to vertiport capacity and flow constraints. We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states. To ensure tractability, we employ a mean-field fluid approximation and derive the underlying system dynamics as a set of coupled ordinary differential equations. A key contribution of this work is the formal proof of the positive invariance of the queue-free state space. We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely. This result allows us to transform a complex, infinite-dimensional continuous-time optimal control problem into a tractable, finite-dimensional algebraic optimization. The resulting framework jointly optimizes for travel time and multi-hop efficiency while ensuring network-wide stability. We validate the approach by characterizing the steady-state flow equilibria and providing sufficient conditions for safe, congestion-free operation in large-scale mobility systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+  "raw_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65.json b/research/fog-of-knowledge/data/evidence/captures/f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65.json
new file mode 100644
index 000000000..79cec2585
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2609-23199",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:41:59.575112+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23199\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23199</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23199</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Bai</keyname>\n                        <forenames>Yiyang</forenames>\n                </author>\n                <author>\n                    <keyname>Awwad</keyname>\n                        <forenames>Élie</forenames>\n                </author>\n                <author>\n                    <keyname>Wigger</keyname>\n                        <forenames>Michèle</forenames>\n                </author>\n        </authors>\n        <title>LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems</title>\n            <categories>eess.SP</categories>\n            <doi>10.1109/JPHOT.2026.3734836</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Fiber Bragg grating (FBG)-based sensing enables localized strain and temperature monitoring by tracking the phase changes of the light reflected from FBGs inserted along a fiber. A major source of disturbance in such systems is laser phase noise, and its influence is typically mitigated by means of additional hardware. In this article, we propose to mitigate the influence of laser phase noise by means of digital signal processing. We propose a practical estimator for coherent single-polarization spread-spectrum FBG-based sensing systems, which is motivated by linearizing the complex received signal and approximating the loss function to formulate a minimum mean square error (MMSE) estimation problem. Moreover, a Cramer-Rao lower bound for this FBG-based estimation problem is presented. Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+  "raw_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8.json b/research/fog-of-knowledge/data/evidence/captures/f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8.json
new file mode 100644
index 000000000..ff8c4bc8b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-16259",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:46.993903+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T07:13:11Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.16259\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.16259</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.16259</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Luo</keyname>\n                        <forenames>Yubin</forenames>\n                </author>\n                <author>\n                    <keyname>Zhu</keyname>\n                        <forenames>Jieao</forenames>\n                </author>\n                <author>\n                    <keyname>Takahashi</keyname>\n                        <forenames>Takumi</forenames>\n                </author>\n                <author>\n                    <keyname>Ochiai</keyname>\n                        <forenames>Hideki</forenames>\n                </author>\n        </authors>\n        <title>Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models. This paper studies channel instability near electromag- netic singular states, where small environmental perturbations can cause large variations in the end-to-end channel. Using resolvent-based spectral analysis, we develop an electromag- netic multiple-input multiple-output (MIMO) channel model that decomposes the end-to-end channel into a smooth regular component and singularity-associated components. The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states. The proposed model also reveals a limitation of conventional water filling (WF): power allocation based only on instan- taneous channel gains does not account for such instability. We therefore estimate singularity information from broadband MIMO channel state information (CSI) and develop a singularity- aware transmit covariance optimization method. Simulations demonstrate numerical stability of the estimated pole frequencies and illustrate the environmental sensitivity of pole-associated channel components. The proposed allocation reduces weighted singular-channel exposure by 90.32% while retaining 95% of the nominal WF rate.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+  "raw_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d.json b/research/fog-of-knowledge/data/evidence/captures/f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d.json
new file mode 100644
index 000000000..a4569e5c3
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-16273",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:43.624066+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-14T15:32:24Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.16273\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.16273</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>cs:cs:CL</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:AS</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.16273</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Naowarat</keyname>\n                        <forenames>Burin</forenames>\n                </author>\n                <author>\n                    <keyname>Tang</keyname>\n                        <forenames>Hao</forenames>\n                </author>\n                <author>\n                    <keyname>Goldwater</keyname>\n                        <forenames>Sharon</forenames>\n                </author>\n        </authors>\n        <title>Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory</title>\n            <categories>cs.CL cs.LG eess.AS</categories>\n            <comments>Accepted at SLT 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to identify a good subspace, nevertheless this result demonstrates much stronger implicit word knowledge in HuBERT than has previously been shown.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+  "raw_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf.json b/research/fog-of-knowledge/data/evidence/captures/f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf.json
new file mode 100644
index 000000000..bd14c3d5c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-28387",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:26:23.164206+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.28387\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.28387</identifier>\n        <datestamp>2026-08-31</datestamp>\n            <setSpec>cs:cs:AR</setSpec>\n            <setSpec>q-bio:q-bio:QM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.28387</id>\n        <created>2026-08-28</created>\n            <updated>2026-08-31</updated>\n        <authors>\n                <author>\n                    <keyname>Jordan</keyname>\n                        <forenames>Jakob</forenames>\n                </author>\n                <author>\n                    <keyname>Richter</keyname>\n                        <forenames>Ole</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Congyang</forenames>\n                </author>\n                <author>\n                    <keyname>Petrovici</keyname>\n                        <forenames>Mihai A.</forenames>\n                </author>\n                <author>\n                    <keyname>Manohar</keyname>\n                        <forenames>Rajit</forenames>\n                </author>\n        </authors>\n        <title>Neuromorphic architectures as numerical solvers for computational neuroscience</title>\n            <categories>cs.AR q-bio.QM</categories>\n            <comments>23 pages, 7 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Neuromorphic computing is closely associated with spiking neuronal networks. However, an alternative class of so-called &#34;rate-based&#34; models arising from computational neuroscience and machine learning forgoes spiking interactions and instead relies on continuous coupling between neurons. Existing neuromorphic implementations designed around spike-based interactions are not well-suited for emulating such models. Here view the distributed simulation of these models as message-passing algorithms on parallel hardware. Leveraging prior art in numerical algorithms and distributed simulation, we outline steps that enable the design of efficient digital neuromorphic accelerators for non-spiking neuronal models. In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision. Using our proposed design principles, we convert an existing neuromorphic architecture into a distributed numerical solver - a spikeless neuromorphic system - for continuously-coupled neuronal models. We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+  "raw_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c.json b/research/fog-of-knowledge/data/evidence/captures/f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c.json
new file mode 100644
index 000000000..afe00bc93
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-15072",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:39:53.741890+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T03:01:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15072\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15072</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>cs:cs:ET</setSpec>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15072</id>\n        <created>2026-10-10</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Singh</keyname>\n                        <forenames>Chandan Kumar</forenames>\n                </author>\n                <author>\n                    <keyname>de Sena</keyname>\n                        <forenames>Arthur Sousa</forenames>\n                </author>\n                <author>\n                    <keyname>Uniyal</keyname>\n                        <forenames>Smriti</forenames>\n                </author>\n                <author>\n                    <keyname>Kumar</keyname>\n                        <forenames>Deepak</forenames>\n                </author>\n                <author>\n                    <keyname>Upadhyay</keyname>\n                        <forenames>Prabhat K.</forenames>\n                </author>\n                <author>\n                    <keyname>Latva-aho</keyname>\n                        <forenames>Matti</forenames>\n                </author>\n        </authors>\n        <title>UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC</title>\n            <categories>eess.SP cs.ET cs.PF cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In integrated sensing and communication (ISAC) systems, strict sensing requirements can substantially constrain the transmit power available for communication. A hybrid reconfigurable intelligent surface (HRIS) with passive reflection and active amplification capabilities mounted on an unmanned aerial vehicle (UAV) can enhance coverage and strengthen communication links in such power-limited regimes. Meanwhile, rate-splitting multiple access (RSMA) provides an effective transmission strategy for managing inter-user interference, particularly in dense multiuser wireless scenarios. Motivated by this, we analyze the performance of a UAV-mounted HRIS-assisted monostatic ISAC system employing RSMA scheme. We consider the imperfections in the channel state information and successive interference cancellation in the RSMA, which are inevitable in practical system implementations. We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels. These expressions reveal key insights into the diversity order and coding gain of the system in the high signal-to-noise ratio regime. To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound. Numerical results validate the theoretical findings and highlight the performance gains of the proposed system over conventional multiple-access schemes and RIS-based systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+  "raw_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95.json b/research/fog-of-knowledge/data/evidence/captures/f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95.json
new file mode 100644
index 000000000..5a0c24d57
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-13402",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:03.917638+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T20:54:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.13402\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.13402</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.13402</id>\n        <created>2026-10-09</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Hua</keyname>\n                        <forenames>Thien Duc</forenames>\n                </author>\n                <author>\n                    <keyname>Mohammadi</keyname>\n                        <forenames>Mohammadali</forenames>\n                </author>\n                <author>\n                    <keyname>Ngo</keyname>\n                        <forenames>Hien Quoc</forenames>\n                </author>\n                <author>\n                    <keyname>Matthaiou</keyname>\n                        <forenames>Michail</forenames>\n                </author>\n        </authors>\n        <title>Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas</title>\n            <categories>eess.SP cs.IT math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose a coupling-aware tri-hybrid precoding architecture for simultaneous wireless information and power transfer (SWIPT) using reconfigurable parasitic antennas. By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain. To efficiently optimize this architecture, we propose a low-complexity tri-hybrid solution comprising coordinate descent (CD) for parasitic reactive load optimization, a singular value decomposition (SVD)-based analog precoder, and a protective partial zero-forcing (PPZF) digital precoder. Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array. Moreover, the proposed tri-hybrid architecture significantly outperforms hybrid precoding by constructively exploiting the coupling effects, yielding substantial gains in spectral efficiency (SE) and sum non-linear harvested energy (NLHE) at a fraction of the hardware cost.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+  "raw_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e.json b/research/fog-of-knowledge/data/evidence/captures/f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e.json
new file mode 100644
index 000000000..db464224d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2610-12779",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:40:07.356687+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-12T05:30:46Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12779\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12779</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12779</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Zhu</keyname>\n                        <forenames>Quanyan</forenames>\n                </author>\n        </authors>\n        <title>Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems</title>\n            <categories>cs.GT cs.SY eess.SY</categories>\n            <comments>63 pages, 19 figures, 10 tables</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Large-scale strategic systems, such as maintenance workflows, cyber campaigns, and multi-agent AI pipelines, consist of many interactions whose outcomes determine which later interactions become possible, who takes part, and with what resources. We introduce game Petri nets, formalized as outcome-driven compositional game Petri nets (OCGPNs), to model and analyze such systems. Local games are attached to places of a colored Petri net, and a game-to-token interface converts each resolved game into typed tokens that enable, synchronize, or block subsequent games. For general, concurrent nets, we give an operational semantics and a structural theory based on invariants and Farkas certificates, which shows that guards can certify unreachability whereas incentive instruments can only change values. For sequential nets, the net induces a stochastic game on its game places. We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes. A composition calculus based on place fusion glues certificates across subnets and summarizes downstream subnets by their entry values. Two running examples, a maintenance workflow and an intrusion campaign derived from multi-resolution cyber-defense games, illustrate the theory, including the composition of a newly discovered attack scenario with an existing campaign.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+  "raw_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162.json b/research/fog-of-knowledge/data/evidence/captures/f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162.json
new file mode 100644
index 000000000..c75b3fac1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2608-08151",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:27:19.947057+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.08151\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.08151</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.08151</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Rommel</keyname>\n                        <forenames>Quentin</forenames>\n                </author>\n                <author>\n                    <keyname>Fotiadis</keyname>\n                        <forenames>Filippos</forenames>\n                </author>\n                <author>\n                    <keyname>Armstrong</keyname>\n                        <forenames>Cade</forenames>\n                </author>\n                <author>\n                    <keyname>Peterson</keyname>\n                        <forenames>Luke</forenames>\n                </author>\n                <author>\n                    <keyname>Topcu</keyname>\n                        <forenames>Ufuk</forenames>\n                </author>\n        </authors>\n        <title>Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Initial submission to JCGD</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Cislunar spacecraft operate in nonlinear and unstable environments that make defensive maneuver planning difficult. We formulate cislunar spacecraft pursuit and evasion as a zero-sum differential game in the circular restricted three-body problem. Each spacecraft controls its thrust and reference orbit phase, enabling motion along periodic orbits and across quasi-periodic tori while remaining near the reference. We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints. We propose a shared time regularization to synchronize both spacecraft while refining the discretization near close lunar passages. Numerical results on periodic and quasi-periodic orbits show that phase control improves maneuvering flexibility while limiting departure from the reference orbit. The discrete-time method also provides a large computational advantage over a continuous-time formulation. Comparisons between quasi-halo and quasi-near-rectilinear halo orbits show that close lunar passages create larger escape opportunities but also increase the sensitivity of the encounter. These results show that reference orbit geometry is an important part of defensive cislunar mission design.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+  "raw_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162"
+}
diff --git a/research/fog-of-knowledge/data/evidence/captures/fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409.json b/research/fog-of-knowledge/data/evidence/captures/fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409.json
new file mode 100644
index 000000000..986de002c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/captures/fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409.json
@@ -0,0 +1,15 @@
+{
+  "id": "source.frontier.arxiv-2607-28276",
+  "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv",
+  "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv",
+  "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
+  "source_kind": "primary",
+  "retrieved_at": "2026-10-18T16:28:48.505899+00:00",
+  "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:48Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28276\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28276</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28276</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Huang</keyname>\n                        <forenames>Sin-Yu</forenames>\n                </author>\n                <author>\n                    <keyname>Wong</keyname>\n                        <forenames>Vincent W. S.</forenames>\n                </author>\n        </authors>\n        <title>Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming</title>\n            <categories>cs.IT cs.SY eess.IV eess.SY math.IT</categories>\n            <comments>Accepted by IEEE Transactions on Communications (TCOM)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Semantic communication is an emerging paradigm that can preserve the meaning of data during transmission. However, human users are often interested in specific semantic content based on their intent, and users&#39; intent is often not considered in current semantic coding design. Moreover, most of the existing semantic models are fine-tuned using specific datasets, which limits their generalization capability. Furthermore, how to prioritize semantically important features in large-scale multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems remains largely unexplored. To address the aforementioned challenges, in this paper, we propose a generalized query-oriented image semantic coding (QO-ISC) framework. In the proposed framework, the transmitter extracts features which are relevant to the user&#39;s query and the receiver reconstructs an image based on those features. We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations. We develop a semantic-aware hybrid beamforming (SA-HBF) algorithm to prioritize semantically important features for large-scale MIMO-OFDM system. When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>",
+  "sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+  "raw_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+  "content_type": "text/xml",
+  "charset": "utf-8",
+  "extraction_method": "http-text/1",
+  "capture_id": "fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409"
+}
diff --git a/research/fog-of-knowledge/data/evidence/raw/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.bin b/research/fog-of-knowledge/data/evidence/raw/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.bin
new file mode 100644
index 000000000..33804e4d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.bin
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.01220" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.01220</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.01220</id>
+        <created>2026-08-02</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Doostmohammadian</keyname>
+                        <forenames>Mohammadreza</forenames>
+                </author>
+                <author>
+                    <keyname>Ghods</keyname>
+                        <forenames>Amir Ahmad</forenames>
+                </author>
+                <author>
+                    <keyname>Aghasi</keyname>
+                        <forenames>Alireza</forenames>
+                </author>
+                <author>
+                    <keyname>Gabidullina</keyname>
+                        <forenames>Zulfiya R.</forenames>
+                </author>
+                <author>
+                    <keyname>Rabiee</keyname>
+                        <forenames>Hamid R.</forenames>
+                </author>
+        </authors>
+        <title>Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap</title>
+            <categories>eess.SY cs.LG cs.SY eess.SP math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz continuous optimization algorithms have been proposed to improve the slow conver-gence rate of the existing linear solutions. The use of signum-based functions is previ-ously considered in consensus and control literature to reach fast convergence in the prescribed time and also to provide robust algorithms to noisy/outlier data. However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup. This motivates us to investigate the distributed optimization and ML algorithms in terms of trade-off between conver-gence rate and optimality gap. In this direction, we specifically consider the distributed regression problem and check its convergence rate by applying both linear and non-Lipschitz signum-based functions. We check our distributed regression approach by extensive simulations. Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps. The findings pre-sented in this paper may contribute to and advance the ongoing discourse of similar distributed algorithms, e.g., for distributed constrained optimization and distributed estimation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.bin b/research/fog-of-knowledge/data/evidence/raw/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.bin
new file mode 100644
index 000000000..94c21d261
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.21020" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.21020</identifier>
+        <datestamp>2026-08-24</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.21020</id>
+        <created>2026-08-21</created>
+            <updated>2026-08-24</updated>
+        <authors>
+                <author>
+                    <keyname>Ouyang</keyname>
+                        <forenames>Chongjun</forenames>
+                </author>
+                <author>
+                    <keyname>Jiang</keyname>
+                        <forenames>Hao</forenames>
+                </author>
+                <author>
+                    <keyname>Ding</keyname>
+                        <forenames>Zhiguo</forenames>
+                </author>
+                <author>
+                    <keyname>Schober</keyname>
+                        <forenames>Robert</forenames>
+                </author>
+        </authors>
+        <title>Frequency-Selective Pinching-Antenna Systems</title>
+            <categories>eess.SP</categories>
+            <comments>34 pages</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>An uplink pinching-antenna system (PASS) is considered, where a segmented dielectric waveguide is employed to serve multiple users and one pinching antenna (PA) is activated on each segment. Extensive waveguide deployment reduces user-to-PA path loss but also creates differential propagation delays among the PA-assisted paths spanning the large waveguide aperture. These delays are retained, and a Toeplitz block model is derived to characterize the resulting frequency-selective (FS) channel. For infinite-blocklength transmission, the achievable single-user rate and the multiuser sum-rates under joint and parallel decoding are characterized. For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate. The difference between the rates computed under the FF channel model and the exact FS channel model is referred to as the FF rate overestimation, and its dependence on the waveguide-aperture-induced delay spread is characterized. For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime. For finite-blocklength transmission, achievable rates are derived under a practical cyclic-prefix single-carrier frequency-domain equalization framework. An element-wise algorithm is developed to optimize FS-aware PA placement in both transmission regimes. The analytical findings demonstrate that differential delays across the extensively deployed waveguide can cause significant frequency selectivity and that the proposed FS-aware PA placement method substantially improves the achievable rate over placement based on the FF approximation, especially for large bandwidths and apertures.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.bin b/research/fog-of-knowledge/data/evidence/raw/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.bin
new file mode 100644
index 000000000..746f13c32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:49Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25701" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25701</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:MA</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25701</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Lee</keyname>
+                        <forenames>Haejoon</forenames>
+                </author>
+                <author>
+                    <keyname>Panagou</keyname>
+                        <forenames>Dimitra</forenames>
+                </author>
+        </authors>
+        <title>Fully Byzantine-Resilient Multi-Agent Reinforcement Learning</title>
+            <categories>cs.LG cs.MA cs.SY eess.SY</categories>
+            <comments>12 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through local interactions. Existing methods guarantee convergence of the agents&#39; parameters only to a neighborhood of the attack-free limit points, resulting in degraded performance. We propose Fully Resilient AC-MARL (FRAC-MARL), a decentralized method in which each agent leverages redundancy in two-hop messages to identify reliable messages. Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs. We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time. Finally, we demonstrate our method on cooperative multi-robot formation control tasks.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.bin b/research/fog-of-knowledge/data/evidence/raw/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.bin
new file mode 100644
index 000000000..a03cb794e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09010" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09010</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09010</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The growing demand for diverse sixth-generation (6G) applications requires efficient connectivity, seamless service continuity, and extended network coverage. Although terrestrial infrastructures can effectively serve most wireless user equipment (UE), communication reliability may be significantly degraded in remote or blocked environments. To address this challenge, this paper proposes a reconfigurable intelligent surface (RIS)-assisted space-air-ground integrated network (SAGIN) operating in the upper mid-band (FR3) spectrum. The considered network consists of a terrestrial base station (BS), a low Earth orbit (LEO) satellite, multiple terrestrial RISs (TRISs), and unmanned aerial vehicle-mounted RISs (ARISs), where the BS serves as the primary access node, while the LEO satellite provides complementary connectivity when terrestrial links are unavailable or cannot satisfy the required quality-of-service (QoS) requirements. Within this framework, we formulate a hierarchical RIS association problem to maximize the achievable network sum rate under RIS capacity constraints. The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources. To efficiently solve the problem, we develop a hierarchical many-to-one matching-based RIS association framework. Specifically, UEs with satisfactory terrestrial connectivity are first associated with TRISs, whereas UEs that cannot be reliably served by the terrestrial network are subsequently associated with ARISs through the non-terrestrial network. Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.bin b/research/fog-of-knowledge/data/evidence/raw/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.bin
new file mode 100644
index 000000000..c8114809e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.bin
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21966" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21966</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>cs:cs:FL</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21966</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Bahmani</keyname>
+                        <forenames>Sarvin</forenames>
+                </author>
+                <author>
+                    <keyname>Paul</keyname>
+                        <forenames>Soumyajit</forenames>
+                </author>
+                <author>
+                    <keyname>Schewe</keyname>
+                        <forenames>Sven</forenames>
+                </author>
+                <author>
+                    <keyname>Soudjani</keyname>
+                        <forenames>Sadegh</forenames>
+                </author>
+                <author>
+                    <keyname>Trivedi</keyname>
+                        <forenames>Ashutosh</forenames>
+                </author>
+        </authors>
+        <title>Automata-Theoretic Verification of Interval Markov Decision Processes</title>
+            <categories>cs.FL cs.SY eess.SY</categories>
+            <comments>14 pages including appendices, accepted to CDC 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Interval Markov decision processes (IMDPs) provide a natural framework for modeling stochastic systems with uncertain transition probabilities, represented by probability intervals and resolved adversarially. Such uncertainty arises naturally, for example, when the transition model is learned from finite data or obtained through model-based reinforcement learning. In this paper, we study the automata-theoretic verification of IMDPs against rich temporal specifications, including all LTL specifications, by considering the broader class of ω-regular objectives. We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals. For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata). For unstable IMDPs, where intervals may include zero while the upper bound is strictly positive, verification becomes game-like and requires automata whose nondeterminism can be resolved on the fly (good-for-games automata). Building on these insights, we develop algorithms for verifying ω-regular specifications over IMDPs and derive probabilistic guarantees when the interval model is learned from sampled data. The resulting framework enables principled verification of stochastic systems under probabilistic model uncertainty, connecting automata-based verification with data-driven stochastic modeling.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.bin b/research/fog-of-knowledge/data/evidence/raw/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.bin
new file mode 100644
index 000000000..df38aeafa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21813" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21813</identifier>
+        <datestamp>2026-10-01</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21813</id>
+        <created>2026-09-30</created>
+            <updated>2026-10-01</updated>
+        <authors>
+                <author>
+                    <keyname>Corlay</keyname>
+                        <forenames>Vincent</forenames>
+                </author>
+                <author>
+                    <keyname>Enttsel</keyname>
+                        <forenames>Andriy</forenames>
+                </author>
+        </authors>
+        <title>How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing</title>
+            <categories>stat.ML cs.CV eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In classification-oriented adaptive sensing, posterior samples characterize uncertainty at the current measurement state and can serve two roles: they may guide the next sensing direction, while their class labels provide votes for the candidate classes and determine whether sensing should continue. We focus on the stopping layer that turns these votes into a declaration, without modifying the posterior sampler or sensing directions. A natural plug-in rule declares when the observed vote share exceeds a threshold. We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time. As alternatives, we calibrate a fixed-sample rule and a finite-horizon sequential rule to a prescribed false-declaration probability, and study exact curtailment, which stops a fixed-pool rule once its final verdict is forced. We then derive how one-round declaration probabilities determine posterior-sample cost and classification accuracy along a sensing path. On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples. Among the evaluated rules at matched operating points, sequential stopping reduces the cost the most. At a high accuracy, that same sequential rule can trade more posterior samples for fewer measurements.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.bin b/research/fog-of-knowledge/data/evidence/raw/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.bin
new file mode 100644
index 000000000..2982763ed
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:14Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02976" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02976</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02976</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Salimi</keyname>
+                        <forenames>Arastoo H</forenames>
+                </author>
+                <author>
+                    <keyname>Dehghani</keyname>
+                        <forenames>Majid</forenames>
+                </author>
+                <author>
+                    <keyname>Nazaripouya</keyname>
+                        <forenames>Hamidreza</forenames>
+                </author>
+        </authors>
+        <title>Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper proposes a novel automated decision-support framework aimed at enhancing the resilience of power systems and operational resilience against wildfires by formulating the decision-making process as a stochastic multi-stage programming during a progressive wildfire. The paper develops a framework that takes into account both preventive and corrective actions, enabling automated and adaptive decisions based on potential scenarios over the course of a wildfire&#39;s progression. This approach considers the evolving nature of the wildfire threat and seeks to optimize the response strategies accordingly throughout its duration. The objective is to minimize wildfire risk and operational costs while reducing load curtailment. The framework accounts for potential contingencies caused by progressive wildfires. A novel algorithm is proposed to construct a decision tree based on wildfire progression and system geographical information. Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework. The effectiveness of the proposed method is demonstrated on the IEEE 30-bus system under various wildfire impact scenarios and is then applied to the IEEE 300-bus system to illustrate the scalability of the proposed approach. The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.bin b/research/fog-of-knowledge/data/evidence/raw/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.bin
new file mode 100644
index 000000000..ab8ce93c4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.bin
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.21764" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.21764</identifier>
+        <datestamp>2026-08-25</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.21764</id>
+        <created>2026-08-22</created>
+            <updated>2026-08-25</updated>
+        <authors>
+                <author>
+                    <keyname>Islam</keyname>
+                        <forenames>Riadul</forenames>
+                </author>
+                <author>
+                    <keyname>Mule</keyname>
+                        <forenames>Joey</forenames>
+                </author>
+                <author>
+                    <keyname>Challagundla</keyname>
+                        <forenames>Dhandeep</forenames>
+                </author>
+                <author>
+                    <keyname>Rizvi</keyname>
+                        <forenames>Shahmir</forenames>
+                </author>
+                <author>
+                    <keyname>Carson</keyname>
+                        <forenames>Sean</forenames>
+                </author>
+                <author>
+                    <keyname>Saini</keyname>
+                        <forenames>Rachit</forenames>
+                </author>
+        </authors>
+        <title>LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices</title>
+            <categories>cs.CV cs.AI eess.IV</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing. However, the asynchronous and noise-prone nature of event streams creates challenges for conventional deep learning models, which are often too computationally intensive for low-power embedded platforms. This work presents a compact and configurable event-driven autoencoder that efficiently compresses neuromorphic data while preserving essential spatiotemporal structure for downstream inference. The architecture integrates lightweight convolutional encoding with robust performance under adaptive event thresholding and a minimal classifier head, enabling substantial reductions in computational cost without degrading recognition fidelity. Extensive evaluations on the Smart Event Face Dataset (SEFD) and Event-Based Crossing Dataset (EBCD) show that the proposed framework achieves competitive or superior accuracy compared to YOLOv9 while requiring up to 35.6$\times$ fewer parameters. To assess real-world sustainability, the model is deployed on resource-constrained hardware: a Raspberry Pi 4B and a NVIDIA Jetson Nano. On NVIDIA Jetson Nano, it delivers real-time throughput of 44.8 FPS. On a Raspberry Pi 4B CPU, the 50\% autoencoder classifier consumes 16.19 J for the evaluated inference workload, corresponding to approximately 726.3$\times$ lower energy consumption than YOLOv9 under the same evaluation protocol. These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.bin b/research/fog-of-knowledge/data/evidence/raw/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.bin
new file mode 100644
index 000000000..044a60911
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.bin
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T14:47:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19722" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19722</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>cs:cs:SD</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19722</id>
+        <created>2026-10-14</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Cao</keyname>
+                        <forenames>Zhe</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jichao</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Xiao-Lei</forenames>
+                </author>
+        </authors>
+        <title>ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition</title>
+            <categories>cs.SD cs.AI eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Recent advances in deep learning have significantly improved underwater acoustic vessel recognition. However, existing publicly available datasets are typically limited in scale, hindering large-scale representation learning and downstream task evaluation. To address this limitation, we introduce ONCship, a large-scale underwater acoustic dataset comprising 4521 hours of curated recordings from Ocean Networks Canada (ONC) hydrophones and Automatic Identification System (AIS) data. We evaluate the proposed dataset across three tasks: self-supervised representation learning, vessel-type classification, and MMSI-Level Vessel Classification. Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing. Furthermore, incorporating ONCship as auxiliary training data improves downstream vessel-type classification performance. Beyond conventional vessel-type classification, we further investigate MMSI-Level Vessel Classification, treating each vessel as a distinct identity. Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification. Overall, ONCship provides a valuable resource for underwater acoustic representation learning and vessel recognition, while its rich vessel-level metadata enables further exploration of MMSI-Level Vessel Classification.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.bin b/research/fog-of-knowledge/data/evidence/raw/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.bin
new file mode 100644
index 000000000..1fb36e3c0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:44Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.08744" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.08744</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.08744</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In sixth-generation (6G) networks, supporting ultra-reliable low-latency communication (URLLC) services imposes stringent requirements on reliability, latency, and efficient resource utilization. The upper mid-band (FR3) spectrum has emerged as a promising candidate due to its favorable trade-off between coverage and bandwidth availability. However, achieving high reliability in dense deployments remains challenging due to interference and propagation impairments. To address these challenges, this paper investigates a reconfigurable intelligent surface (RIS)-assisted network operating in the FR3 band. We formulate a joint transmit power allocation and user equipment (UE)-RIS association problem to maximize network reliability under finite blocklength constraints. The resulting problem is nonconvex and combinatorial due to interference coupling and binary association variables. To solve this problem efficiently, we propose a multiphase resource allocation framework that integrates a successive convex approximation (SCA)-based power optimization scheme with a matching theory-based UE-RIS association algorithm. Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.bin b/research/fog-of-knowledge/data/evidence/raw/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.bin
new file mode 100644
index 000000000..6f75225f0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.bin
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:11Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.25081" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.25081</identifier>
+        <datestamp>2026-07-29</datestamp>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.25081</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-29</updated>
+        <authors>
+                <author>
+                    <keyname>Zampirolli</keyname>
+                        <forenames>Eduardo Moura</forenames>
+                </author>
+                <author>
+                    <keyname>Interian</keyname>
+                        <forenames>Ruben</forenames>
+                </author>
+        </authors>
+        <title>Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales</title>
+            <categories>physics.soc-ph</categories>
+            <comments>28 pages, English and Portuguese versions (English first)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This study investigates the predictive capacity of models based on Economic Complexity and Complex Network Theory when applied to Brazil&#39;s Municipal Human Development Index (IDHM). For this purpose, the Economic Complexity Index was adapted to the Brazilian context. The main objective is to assess the extent to which different approaches to regional development analysis, such as local productive sophistication and structural integration into the national transportation network, determine socioeconomic development. The methodology compares linear regression models (Ridge, LASSO, and Elastic Net) and nonlinear models (Decision Trees and the Explainable Boosting Machine), evaluated through 5-fold cross-validation with grid search. The analyses were conducted at two levels of spatial aggregation: municipalities and Immediate Geographic Regions. The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables. Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale. In addition, the inclusion of topological metrics from the road infrastructure network generally improved performance. The Explainable Boosting Machine achieved the best predictive performance, reaching R^2 = 0.8196 at the Immediate Region level when network metrics were included.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.bin b/research/fog-of-knowledge/data/evidence/raw/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.bin
new file mode 100644
index 000000000..4c9bb603c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25437" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25437</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:CY</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25437</id>
+        <created>2026-09-21</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Alston</keyname>
+                        <forenames>Garrett</forenames>
+                </author>
+                <author>
+                    <keyname>Love</keyname>
+                        <forenames>Nancy</forenames>
+                </author>
+                <author>
+                    <keyname>Haider</keyname>
+                        <forenames>Rabab</forenames>
+                </author>
+        </authors>
+        <title>Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development</title>
+            <categories>eess.SY cs.CY cs.DC cs.SY</categories>
+            <comments>12 pages; 8 figures; 6 tables; appendix</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Data centers are being developed at an unprecedented pace, yet their energy and water impacts, and the spatial and temporal distribution of these impacts, remain poorly characterized. Data centers consume water for cooling (direct) and through electricity generation (indirect). Decisions on siting and cooling technology result in water-energy trade-offs that extend impacts beyond the facility&#39;s location. Existing assessment frameworks rely on facility efficiency metrics and average grid water intensity factors, suppressing the temporal impacts of data center load and generation availability. They also attribute indirect consumption to the facility&#39;s location rather than to the generators (and corresponding hydrologic regions) that respond to the added load, misattributing spatial impacts. To close this gap, we develop a computational model of the data center-energy-water nexus that links facility cooling and electricity demand with hourly economic dispatch, generator-level water consumption, and monthly subbasin depletion. Built on open-source data, the model resolves where and when water is consumed, and where this consumption compounds existing water risk or creates new risk. Using the model, we study different cooling configurations and proposed developments in the state of Michigan. Air-cooled data centers halve total water consumption relative to evaporative cooling, but increase electricity demand and raise indirect water consumption by one-third, shifting the water footprint from the facility to generators. Mapping these changes to subbasins reveals depletion increases beyond the data center sites, in regions that facility-level reporting may overlook. These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.bin b/research/fog-of-knowledge/data/evidence/raw/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.bin
new file mode 100644
index 000000000..0b369ac5e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.bin
@@ -0,0 +1,67 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-09T16:30:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04959" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04959</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>cs:cs:CE</setSpec>
+            <setSpec>q-fin:q-fin:CP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04959</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Jin</keyname>
+                        <forenames>Yanzheng</forenames>
+                </author>
+                <author>
+                    <keyname>Shao</keyname>
+                        <forenames>Pengyang</forenames>
+                </author>
+                <author>
+                    <keyname>Ma</keyname>
+                        <forenames>Yunshan</forenames>
+                </author>
+                <author>
+                    <keyname>Pan</keyname>
+                        <forenames>Haowen</forenames>
+                </author>
+                <author>
+                    <keyname>Zhai</keyname>
+                        <forenames>Naixin</forenames>
+                </author>
+                <author>
+                    <keyname>Song</keyname>
+                        <forenames>Chen-Hui</forenames>
+                </author>
+                <author>
+                    <keyname>Shen</keyname>
+                        <forenames>Fei</forenames>
+                </author>
+                <author>
+                    <keyname>Kawaguchi</keyname>
+                        <forenames>Kenji</forenames>
+                </author>
+        </authors>
+        <title>AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion</title>
+            <categories>cs.CE q-fin.CP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Formulaic alpha discovery seeks symbolic expressions that predict cross-sectional asset returns. In deployment, multiple formulas are combined into an alpha pool, where each formula is valued through the complementary information it contributes to joint predictive performance. While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges. First, generating formulas individually leaves pool context and inter-formula complementarity outside the generative state. Second, formula-wise generation lacks a unified mechanism for preserving and revising structures at different levels. Third, pool-level rewards jointly reflect predictive performance and redundancy but cannot be differentiated directly through symbolic evaluation to train the generator. To overcome these challenges, we introduce AlphaPADI (Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion), a novel framework built around three components: (1) grammar-constrained buffer initialization that constructs syntactically valid pool candidates, (2) pool-aware hierarchical diffusion that reconstructs complete pools at multiple structural scales under the current pool context, and (3) reward-guided pool refinement that evaluates joint predictive performance and inner diversity, updates the elite buffer, and trains the reverse model through reconstruction and preference learning. Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.bin b/research/fog-of-knowledge/data/evidence/raw/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.bin
new file mode 100644
index 000000000..5896875c2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:37Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09080" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09080</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09080</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents a non-orthogonal multiple access (NOMA)-enabled integrated sensing and communication (ISAC) framework for low-altitude wireless networks (LAWN), where an aerial access point simultaneously serves ground users and senses aerial targets. To improve both communication efficiency and sensing reliability, a matching-based user-target pairing (MUTP) scheme is proposed, in which strong and weak channel NOMA users are first paired into NOMA groups and then assigned to sensing targets according to a sensing-aware pairing criterion. Furthermore, an adaptive power allocation (APA) strategy is developed to balance communication quality-of-service requirements and target detection performance. The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA. Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN. Moreover, the proposed method closely approaches the exhaustive search benchmark while avoiding the high computational complexity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.bin b/research/fog-of-knowledge/data/evidence/raw/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.bin
new file mode 100644
index 000000000..aa2ec6f94
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-12T03:01:50Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.13424" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.13424</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.13424</id>
+        <created>2026-10-09</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Sharma</keyname>
+                        <forenames>Vaishnavi</forenames>
+                </author>
+                <author>
+                    <keyname>Katewa</keyname>
+                        <forenames>Vaibhav</forenames>
+                </author>
+        </authors>
+        <title>Minimum-Energy Control for Stochastic Linear Systems</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be \emph{small}, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices. Finally, we show that there exists a fundamental lower bound on the optimal control energy which cannot be overcome by increasing the time horizon of the problem.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.bin b/research/fog-of-knowledge/data/evidence/raw/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.bin
new file mode 100644
index 000000000..0b776918e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.bin
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.32315" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.32315</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.32315</id>
+        <created>2026-09-26</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Hadid</keyname>
+                        <forenames>Vanessa</forenames>
+                </author>
+                <author>
+                    <keyname>Abdelhedi</keyname>
+                        <forenames>Hamza</forenames>
+                </author>
+                <author>
+                    <keyname>Pascarella</keyname>
+                        <forenames>Annalisa</forenames>
+                </author>
+                <author>
+                    <keyname>Solla</keyname>
+                        <forenames>Sara A.</forenames>
+                </author>
+                <author>
+                    <keyname>Cisek</keyname>
+                        <forenames>Paul</forenames>
+                </author>
+                <author>
+                    <keyname>Jerbi</keyname>
+                        <forenames>Karim</forenames>
+                </author>
+        </authors>
+        <title>From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Neural activity unfolds not as a set of independent signals, but as a coordinated dynamical process that can be described as a point moving through a high-dimensional state space. This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG. In this primer, we present a neural trajectory analysis based on Principal Component Analysis (PCA) as an accessible route into extending the concepts of neural trajectories in state space to human electrophysiology. We explain how EEG/MEG activity can be organized into neural state representations, projected onto axes organized by decreasing covariance, truncated into low-dimensional representations, and visualized as trajectories that capture how distributed activity evolves over time. We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes. An example of EEG motor execution and imagery, accompanied by a tutorial notebook, illustrates the workflow from conventional EEG summaries to trajectory-based analysis. We also clarify the limits of PCA, including its linear, variance-driven nature, and discuss EEG/MEG-specific challenges such as spatial mixing, preprocessing sensitivity, validation, and overinterpretation. Finally, we situate PCA within a broader family of state-space methods. By making neural trajectories practical and interpretable, this primer offers a guide for bringing the conceptual framework of population-level dynamics into mainstream human cognitive neuroscience.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.bin b/research/fog-of-knowledge/data/evidence/raw/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.bin
new file mode 100644
index 000000000..3b0f44f8e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.28387" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.28387</identifier>
+        <datestamp>2026-08-31</datestamp>
+            <setSpec>cs:cs:AR</setSpec>
+            <setSpec>q-bio:q-bio:QM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.28387</id>
+        <created>2026-08-28</created>
+            <updated>2026-08-31</updated>
+        <authors>
+                <author>
+                    <keyname>Jordan</keyname>
+                        <forenames>Jakob</forenames>
+                </author>
+                <author>
+                    <keyname>Richter</keyname>
+                        <forenames>Ole</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Congyang</forenames>
+                </author>
+                <author>
+                    <keyname>Petrovici</keyname>
+                        <forenames>Mihai A.</forenames>
+                </author>
+                <author>
+                    <keyname>Manohar</keyname>
+                        <forenames>Rajit</forenames>
+                </author>
+        </authors>
+        <title>Neuromorphic architectures as numerical solvers for computational neuroscience</title>
+            <categories>cs.AR q-bio.QM</categories>
+            <comments>23 pages, 7 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Neuromorphic computing is closely associated with spiking neuronal networks. However, an alternative class of so-called &#34;rate-based&#34; models arising from computational neuroscience and machine learning forgoes spiking interactions and instead relies on continuous coupling between neurons. Existing neuromorphic implementations designed around spike-based interactions are not well-suited for emulating such models. Here view the distributed simulation of these models as message-passing algorithms on parallel hardware. Leveraging prior art in numerical algorithms and distributed simulation, we outline steps that enable the design of efficient digital neuromorphic accelerators for non-spiking neuronal models. In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision. Using our proposed design principles, we convert an existing neuromorphic architecture into a distributed numerical solver - a spikeless neuromorphic system - for continuously-coupled neuronal models. We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.bin b/research/fog-of-knowledge/data/evidence/raw/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.bin
new file mode 100644
index 000000000..709c43c1b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.bin
@@ -0,0 +1,367 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:42Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.26924" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.26924</identifier>
+        <datestamp>2026-09-24</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.26924</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-24</updated>
+        <authors>
+                <author>
+                    <keyname>Harsy</keyname>
+                        <forenames>Constantin Ulrich</forenames>
+                </author>
+                <author>
+                    <keyname>Wald</keyname>
+                        <forenames>Tassilo</forenames>
+                </author>
+                <author>
+                    <keyname>Gotkowski</keyname>
+                        <forenames>Karol</forenames>
+                </author>
+                <author>
+                    <keyname>Kirchhoff</keyname>
+                        <forenames>Yannick</forenames>
+                </author>
+                <author>
+                    <keyname>Knopp</keyname>
+                        <forenames>Marcel</forenames>
+                </author>
+                <author>
+                    <keyname>Rokuss</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Stegmeier</keyname>
+                        <forenames>Elisa</forenames>
+                </author>
+                <author>
+                    <keyname>Schader</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+                <author>
+                    <keyname>Trofimova</keyname>
+                        <forenames>Dasha</forenames>
+                </author>
+                <author>
+                    <keyname>Stock</keyname>
+                        <forenames>Raphael</forenames>
+                </author>
+                <author>
+                    <keyname>Kahl</keyname>
+                        <forenames>Kim-Celine</forenames>
+                </author>
+                <author>
+                    <keyname>Schaumann</keyname>
+                        <forenames>Stephen</forenames>
+                </author>
+                <author>
+                    <keyname>Erkan</keyname>
+                        <forenames>Selen</forenames>
+                </author>
+                <author>
+                    <keyname>Zimmerer</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Denner</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Langenberg</keyname>
+                        <forenames>Moritz</forenames>
+                </author>
+                <author>
+                    <keyname>Ziegler</keyname>
+                        <forenames>Sebastian</forenames>
+                </author>
+                <author>
+                    <keyname>Eckstein</keyname>
+                        <forenames>Katharina</forenames>
+                </author>
+                <author>
+                    <keyname>Fischer</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Suprijadi</keyname>
+                        <forenames>Jonathan</forenames>
+                </author>
+                <author>
+                    <keyname>Kovács</keyname>
+                        <forenames>Bálint</forenames>
+                </author>
+                <author>
+                    <keyname>Hamm</keyname>
+                        <forenames>Benjamin</forenames>
+                </author>
+                <author>
+                    <keyname>Deshpande</keyname>
+                        <forenames>Anand</forenames>
+                </author>
+                <author>
+                    <keyname>Bounias</keyname>
+                        <forenames>Dimitrios</forenames>
+                </author>
+                <author>
+                    <keyname>Disch</keyname>
+                        <forenames>Nico</forenames>
+                </author>
+                <author>
+                    <keyname>Xiao</keyname>
+                        <forenames>Shuhan</forenames>
+                </author>
+                <author>
+                    <keyname>Kächele</keyname>
+                        <forenames>Jessica</forenames>
+                </author>
+                <author>
+                    <keyname>Sellner</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>Baidya</keyname>
+                        <forenames>Rajesh</forenames>
+                </author>
+                <author>
+                    <keyname>Traub</keyname>
+                        <forenames>Jeremias</forenames>
+                </author>
+                <author>
+                    <keyname>Krämer</keyname>
+                        <forenames>Lars</forenames>
+                </author>
+                <author>
+                    <keyname>Zenk</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Rädsch</keyname>
+                        <forenames>Tim</forenames>
+                </author>
+                <author>
+                    <keyname>Dvoretskii</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Peretzke</keyname>
+                        <forenames>Robin</forenames>
+                </author>
+                <author>
+                    <keyname>Deissler</keyname>
+                        <forenames>Jonathan</forenames>
+                </author>
+                <author>
+                    <keyname>Ertl</keyname>
+                        <forenames>Alexandra</forenames>
+                </author>
+                <author>
+                    <keyname>Ghosh</keyname>
+                        <forenames>Partha</forenames>
+                </author>
+                <author>
+                    <keyname>Dreher</keyname>
+                        <forenames>Kris</forenames>
+                </author>
+                <author>
+                    <keyname>Dinkelacker</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Reinke</keyname>
+                        <forenames>Annika</forenames>
+                </author>
+                <author>
+                    <keyname>Christodoulou</keyname>
+                        <forenames>Evangelia</forenames>
+                </author>
+                <author>
+                    <keyname>Saeed</keyname>
+                        <forenames>Numan</forenames>
+                </author>
+                <author>
+                    <keyname>Savriama</keyname>
+                        <forenames>Yoland</forenames>
+                </author>
+                <author>
+                    <keyname>Estrada</keyname>
+                        <forenames>Santiago</forenames>
+                </author>
+                <author>
+                    <keyname>Kügler</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Barragan</keyname>
+                        <forenames>Laura Alexandra Daza</forenames>
+                </author>
+                <author>
+                    <keyname>Osorio</keyname>
+                        <forenames>Cristina Isabel Gonzalez</forenames>
+                </author>
+                <author>
+                    <keyname>Peeken</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>Baumgartner</keyname>
+                        <forenames>Michael</forenames>
+                </author>
+                <author>
+                    <keyname>Teichmann</keyname>
+                        <forenames>Marvin</forenames>
+                </author>
+                <author>
+                    <keyname>Chabin</keyname>
+                        <forenames>Guillaume</forenames>
+                </author>
+                <author>
+                    <keyname>Kirchler</keyname>
+                        <forenames>Matthias</forenames>
+                </author>
+                <author>
+                    <keyname>Koch</keyname>
+                        <forenames>Valentin</forenames>
+                </author>
+                <author>
+                    <keyname>study</keyname>
+                        <forenames>for the ALFA</forenames>
+                </author>
+                <author>
+                    <keyname>Hohenhaus</keyname>
+                        <forenames>Markus</forenames>
+                </author>
+                <author>
+                    <keyname>Koslov</keyname>
+                        <forenames>Dimitri</forenames>
+                </author>
+                <author>
+                    <keyname>Decker</keyname>
+                        <forenames>Nina</forenames>
+                </author>
+                <author>
+                    <keyname>Yaqub</keyname>
+                        <forenames>Mohammad</forenames>
+                </author>
+                <author>
+                    <keyname>Heuser</keyname>
+                        <forenames>Arnd</forenames>
+                </author>
+                <author>
+                    <keyname>Reuter</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Schnabel</keyname>
+                        <forenames>Julia A.</forenames>
+                </author>
+                <author>
+                    <keyname>Heimann</keyname>
+                        <forenames>Tobias</forenames>
+                </author>
+                <author>
+                    <keyname>Ghesu</keyname>
+                        <forenames>Florin</forenames>
+                </author>
+                <author>
+                    <keyname>Brachmann</keyname>
+                        <forenames>Paul</forenames>
+                </author>
+                <author>
+                    <keyname>Heußel</keyname>
+                        <forenames>Claus P.</forenames>
+                </author>
+                <author>
+                    <keyname>Radbruch</keyname>
+                        <forenames>Alexander</forenames>
+                </author>
+                <author>
+                    <keyname>Brugnara</keyname>
+                        <forenames>Gianluca</forenames>
+                </author>
+                <author>
+                    <keyname>Rastogi</keyname>
+                        <forenames>Aditya</forenames>
+                </author>
+                <author>
+                    <keyname>Foltyn-Dumitru</keyname>
+                        <forenames>Martha</forenames>
+                </author>
+                <author>
+                    <keyname>Schlemmer</keyname>
+                        <forenames>Heinz-Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Reicht</keyname>
+                        <forenames>Ignaz</forenames>
+                </author>
+                <author>
+                    <keyname>Holzschuh</keyname>
+                        <forenames>Julius C.</forenames>
+                </author>
+                <author>
+                    <keyname>Bach</keyname>
+                        <forenames>Michael</forenames>
+                </author>
+                <author>
+                    <keyname>Stieltjes</keyname>
+                        <forenames>Bram</forenames>
+                </author>
+                <author>
+                    <keyname>Schlamp</keyname>
+                        <forenames>Kai</forenames>
+                </author>
+                <author>
+                    <keyname>Maier-Hein</keyname>
+                        <forenames>Lena</forenames>
+                </author>
+                <author>
+                    <keyname>Nolden</keyname>
+                        <forenames>Marco</forenames>
+                </author>
+                <author>
+                    <keyname>Floca</keyname>
+                        <forenames>Ralf</forenames>
+                </author>
+                <author>
+                    <keyname>Jäger</keyname>
+                        <forenames>Paul F.</forenames>
+                </author>
+                <author>
+                    <keyname>Vollmuth</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+                <author>
+                    <keyname>Isensee</keyname>
+                        <forenames>Fabian</forenames>
+                </author>
+                <author>
+                    <keyname>Maier-Hein</keyname>
+                        <forenames>Klaus H.</forenames>
+                </author>
+        </authors>
+        <title>nnFoundation: 3D Foundation Models for Radiology</title>
+            <categories>cs.CV eess.IV</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift. Foundation models promise more transferable and data-efficient solutions, but existing approaches are limited in scale, evaluated narrowly, and often assume that a single pretrained model can support diverse downstream tasks. Here we present nnFoundation, complementary convolutional and transformer-based 3D radiological foundation models. Developed within the Human Radiome Project (THRP), nnFoundation is trained on 2.1 million CT, MRI, and PET image volumes from 125 institutional and public datasets. We evaluate them across 108 tasks spanning segmentation, detection, classification, report generation, and image retrieval, including evaluations under domain shift, by external partners and in low-data and low-compute regimes. Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging. However, performance follows a consistent task-dependent structure: the convolutional nnFoundation model dominates spatially localized tasks, whereas the transformer-based nnFoundation model excels in tasks requiring global semantic reasoning and in frozen-feature settings. Dynamically aligning the foundation model topology with the dataset characteristics post-hoc further improves transfer across heterogeneous 3D settings. These results show that transferable 3D radiological performance is governed not by a single universal model, but by the interplay of scalable pretraining, complementary architectures, and dataset-aware adaptation. We release nnFoundation models integrated into nnU-Net and nnDetection, enabling immediate application across established radiology workflows.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.bin b/research/fog-of-knowledge/data/evidence/raw/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.bin
new file mode 100644
index 000000000..406cbc9d1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:58Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.16290" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.16290</identifier>
+        <datestamp>2026-08-18</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.16290</id>
+        <created>2026-08-17</created>
+            <updated>2026-08-18</updated>
+        <authors>
+                <author>
+                    <keyname>Hatami</keyname>
+                        <forenames>Mohammad</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Nhan Thanh</forenames>
+                </author>
+                <author>
+                    <keyname>Juntti</keyname>
+                        <forenames>Markku</forenames>
+                </author>
+        </authors>
+        <title>Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols</title>
+            <categories>eess.SP</categories>
+            <comments>5 pages, 3 figures. Accepted for presentation at the IEEE SPAWC 2026 conference</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper investigates the joint design of beamforming and radar receive filters in a multiuser bistatic integrated sensing and communications (ISAC) system, aiming to maximize the minimum radar signal-to-interference-plus-noise ratio (SINR) under communications SINR and transmit power constraints. We consider two scenarios: transmitted signals are either known or unknown at the radar receiver. We develop tractable solutions to the resulting non-convex optimization problems in both cases. For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA). For the unknown case, we adopt an alternating optimization (AO) approach to jointly design the beamforming and receive filters. Numerical results demonstrate that, while both approaches achieve comparable performance under per-slot optimization, knowledge of the transmitted symbols provides significant gains in multi-slot processing via coherent integration. Moreover, the proposed ISAC designs perform close to the radar-only benchmark under moderate communication requirements.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.bin b/research/fog-of-knowledge/data/evidence/raw/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.bin
new file mode 100644
index 000000000..c650effcf
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.bin
@@ -0,0 +1,38 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:29:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.25526" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.25526</identifier>
+        <datestamp>2026-07-29</datestamp>
+            <setSpec>cs:cs:CY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.25526</id>
+        <created>2026-07-28</created>
+            <updated>2026-07-29</updated>
+        <authors>
+                <author>
+                    <keyname>Chupilkin</keyname>
+                        <forenames>Maxim</forenames>
+                </author>
+        </authors>
+        <title>Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data</title>
+            <categories>cs.CY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>How should researchers measure the geopolitical preferences expressed by large language models (LLMs)? Existing audits commonly rely on surveys and simple tests, but international-relations research has long recognized that measuring geopolitical preferences is difficult and has developed methods for recovering them from observed choices. This paper applies a dynamic ordinal ideal-point approach from international relations, treating LLMs as respondents to the full texts of 5,555 divisive, recorded, adopted resolutions considered in regular sessions of the UN General Assembly from 1946 through 2025. Support ranges from 37.8% for DeepSeek to 97.3% for GPT-5. Surprisingly, in the twenty-first century, GPT-5, Claude Sonnet, and Gemini are closest among the permanent five to Russia; DeepSeek is closest to France; and all four are farthest from the United States. Among 2,104 resolutions opposed by the United States but supported by China and Russia/USSR, GPT-5 supported 96.1%, Gemini 83.4%, Claude Sonnet 65.2%, and DeepSeek 36.1%. The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.bin b/research/fog-of-knowledge/data/evidence/raw/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.bin
new file mode 100644
index 000000000..983532e97
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.bin
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T03:00:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15052" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15052</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15052</id>
+        <created>2026-10-10</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Zakirzyanov</keyname>
+                        <forenames>Ruslan</forenames>
+                </author>
+        </authors>
+        <title>On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms</title>
+            <categories>eess.SY cs.SY</categories>
+            <doi>10.1109/RusAutoCon69876.2026.11707364</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The paper addresses the synthesis of a cost-optimal hardware architecture of the automated process control system (APCS) for continuous processes. The problem is formalized as the search for a minimum-cost rooted tree of devices subject to constraints on the number of I/O channels, the types and number of communication interfaces, the information capacity of processors, the regulation time and the reliability. The signals are grouped by control rooms. The problem is NP-hard, and a hybrid method is proposed that combines a deterministic hierarchy construction with a modified ant colony optimization (ACO) for device-type selection, enhanced by an adaptive heuristic. On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each. By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster. By the median cost, however, the deterministic-greedy baselines are more reliable (GA attains the best Friedman rank) because the cost of the ACO runs is highly variable. All differences are confirmed by the Friedman and Wilcoxon tests. The method targets the early-design search for the cheapest feasible architecture and synthesizes one within minutes at industrial scale (A up to 1086).</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.bin b/research/fog-of-knowledge/data/evidence/raw/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.bin
new file mode 100644
index 000000000..8cb0c8fd4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-12T05:30:46Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12779" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12779</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12779</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Zhu</keyname>
+                        <forenames>Quanyan</forenames>
+                </author>
+        </authors>
+        <title>Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems</title>
+            <categories>cs.GT cs.SY eess.SY</categories>
+            <comments>63 pages, 19 figures, 10 tables</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Large-scale strategic systems, such as maintenance workflows, cyber campaigns, and multi-agent AI pipelines, consist of many interactions whose outcomes determine which later interactions become possible, who takes part, and with what resources. We introduce game Petri nets, formalized as outcome-driven compositional game Petri nets (OCGPNs), to model and analyze such systems. Local games are attached to places of a colored Petri net, and a game-to-token interface converts each resolved game into typed tokens that enable, synchronize, or block subsequent games. For general, concurrent nets, we give an operational semantics and a structural theory based on invariants and Farkas certificates, which shows that guards can certify unreachability whereas incentive instruments can only change values. For sequential nets, the net induces a stochastic game on its game places. We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes. A composition calculus based on place fusion glues certificates across subnets and summarizes downstream subnets by their entry values. Two running examples, a maintenance workflow and an intrusion campaign derived from multi-resolution cyber-defense games, illustrate the theory, including the composition of a newly discovered attack scenario with an existing campaign.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.bin b/research/fog-of-knowledge/data/evidence/raw/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.bin
new file mode 100644
index 000000000..2d8631850
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.bin
@@ -0,0 +1,62 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T03:01:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15072" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15072</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>cs:cs:ET</setSpec>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15072</id>
+        <created>2026-10-10</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Singh</keyname>
+                        <forenames>Chandan Kumar</forenames>
+                </author>
+                <author>
+                    <keyname>de Sena</keyname>
+                        <forenames>Arthur Sousa</forenames>
+                </author>
+                <author>
+                    <keyname>Uniyal</keyname>
+                        <forenames>Smriti</forenames>
+                </author>
+                <author>
+                    <keyname>Kumar</keyname>
+                        <forenames>Deepak</forenames>
+                </author>
+                <author>
+                    <keyname>Upadhyay</keyname>
+                        <forenames>Prabhat K.</forenames>
+                </author>
+                <author>
+                    <keyname>Latva-aho</keyname>
+                        <forenames>Matti</forenames>
+                </author>
+        </authors>
+        <title>UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC</title>
+            <categories>eess.SP cs.ET cs.PF cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In integrated sensing and communication (ISAC) systems, strict sensing requirements can substantially constrain the transmit power available for communication. A hybrid reconfigurable intelligent surface (HRIS) with passive reflection and active amplification capabilities mounted on an unmanned aerial vehicle (UAV) can enhance coverage and strengthen communication links in such power-limited regimes. Meanwhile, rate-splitting multiple access (RSMA) provides an effective transmission strategy for managing inter-user interference, particularly in dense multiuser wireless scenarios. Motivated by this, we analyze the performance of a UAV-mounted HRIS-assisted monostatic ISAC system employing RSMA scheme. We consider the imperfections in the channel state information and successive interference cancellation in the RSMA, which are inevitable in practical system implementations. We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels. These expressions reveal key insights into the diversity order and coding gain of the system in the high signal-to-noise ratio regime. To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound. Numerical results validate the theoretical findings and highlight the performance gains of the proposed system over conventional multiple-access schemes and RIS-based systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.bin b/research/fog-of-knowledge/data/evidence/raw/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.bin
new file mode 100644
index 000000000..6d2a984f8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28224" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28224</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28224</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Su</keyname>
+                        <forenames>Yanpeng</forenames>
+                </author>
+                <author>
+                    <keyname>Lübke</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Mengyu</forenames>
+                </author>
+                <author>
+                    <keyname>Franchi</keyname>
+                        <forenames>Norman</forenames>
+                </author>
+        </authors>
+        <title>CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents a Cramér-Rao lower bound (CRLB)-driven beamforming (BF) and power allocation (PA) framework for cooperative integrated sensing and communication (ISAC) networks, where a set of multi-antenna base stations (BSs) jointly serve multiple users and simultaneously perform multi-static target estimation. In our design, we investigate how the position error bound (PEB) and velocity error bound (VEB) can be exploited and incorporated into BF and PA optimization. The design leveraging PEB and VEB as metrics directly characterizes sensing accuracy. First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions. Addressing the complexity, we further develop a two-stage PA algorithm, where the communication and sensing beams are formed by the regularized zero-forcing (RZF) and null-space projection (NSP) methods, respectively, and the communication and sensing PAs are solved sequentially by second-order cone programming (SOCP). Although the PA algorithm sacrifices the degrees of freedom, its performance shows a slight gap compared to BF in the simulation, while the execution time of around 25 ms demonstrates its applicability in dynamic environments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.bin b/research/fog-of-knowledge/data/evidence/raw/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.bin
new file mode 100644
index 000000000..2b71cff45
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.bin
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.36354" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.36354</identifier>
+        <datestamp>2026-09-30</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:CE</setSpec>
+            <setSpec>q-bio:q-bio:BM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.36354</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-30</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Jiarui</forenames>
+                </author>
+                <author>
+                    <keyname>Yin</keyname>
+                        <forenames>Zixiang</forenames>
+                </author>
+                <author>
+                    <keyname>Landry</keyname>
+                        <forenames>Samuel</forenames>
+                </author>
+                <author>
+                    <keyname>Ding</keyname>
+                        <forenames>Zhengming</forenames>
+                </author>
+                <author>
+                    <keyname>Mettu</keyname>
+                        <forenames>Ramgopal</forenames>
+                </author>
+        </authors>
+        <title>Explainability from Training with Applications to TCR-Epitope Prediction</title>
+            <categories>cs.LG cs.AI cs.CE q-bio.BM</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks. Existing methods for interpretability provide limited insight into how models organize evidence and evolve during learning. We introduce explainability from training (EFT), a model-agnostic paradigm that traces model interpretation during training to explain why models rely on specific features and how they organize these features as predictive evidence. We apply EFT to four state-of-the-art T cell receptor (TCR)-epitope prediction models, TCR-SRIM, TULIP, MixTCRpred, and NetTCR-2.2, spanning post-hoc and interpret-by-design approaches as well as transformers and CNNs. To investigate how structural information affects model explanations, we introduce a benchmark, TCR-XAI2, containing 388 unique experimentally resolved TCR-epitope structures, complemented by structures predicted using AlphaFold3, Boltz-2, TCRModel2, tFold-TCR, and OpenFold3. Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.bin b/research/fog-of-knowledge/data/evidence/raw/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.bin
new file mode 100644
index 000000000..3128557ed
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.18060" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.18060</identifier>
+        <datestamp>2026-08-19</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.18060</id>
+        <created>2026-08-18</created>
+            <updated>2026-08-19</updated>
+        <authors>
+                <author>
+                    <keyname>Hirsch</keyname>
+                        <forenames>Dylan</forenames>
+                </author>
+                <author>
+                    <keyname>Sharpless</keyname>
+                        <forenames>William</forenames>
+                </author>
+                <author>
+                    <keyname>Lee</keyname>
+                        <forenames>Donggun</forenames>
+                </author>
+                <author>
+                    <keyname>Herbert</keyname>
+                        <forenames>Sylvia</forenames>
+                </author>
+        </authors>
+        <title>Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this work, we introduce the generalized reach-avoid (GRA) task, which both extends and unifies the canonical tasks of Hamilton-Jacobi Reachability (HJR). We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR. Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks. We additionally show that the GRA is also a natural primitive to consider from a PDE perspective, as it can be used to represent all sufficiently regular solutions of the HJ-PDE that is canonical to HJR. Collectively, the results in this work show the theoretical and practical utility of this task within the increasingly important framework of HJR.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.bin b/research/fog-of-knowledge/data/evidence/raw/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.bin
new file mode 100644
index 000000000..77ea00dc4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.bin
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T20:54:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.13402" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.13402</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.13402</id>
+        <created>2026-10-09</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Hua</keyname>
+                        <forenames>Thien Duc</forenames>
+                </author>
+                <author>
+                    <keyname>Mohammadi</keyname>
+                        <forenames>Mohammadali</forenames>
+                </author>
+                <author>
+                    <keyname>Ngo</keyname>
+                        <forenames>Hien Quoc</forenames>
+                </author>
+                <author>
+                    <keyname>Matthaiou</keyname>
+                        <forenames>Michail</forenames>
+                </author>
+        </authors>
+        <title>Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas</title>
+            <categories>eess.SP cs.IT math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose a coupling-aware tri-hybrid precoding architecture for simultaneous wireless information and power transfer (SWIPT) using reconfigurable parasitic antennas. By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain. To efficiently optimize this architecture, we propose a low-complexity tri-hybrid solution comprising coordinate descent (CD) for parasitic reactive load optimization, a singular value decomposition (SVD)-based analog precoder, and a protective partial zero-forcing (PPZF) digital precoder. Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array. Moreover, the proposed tri-hybrid architecture significantly outperforms hybrid precoding by constructively exploiting the coupling effects, yielding substantial gains in spectral efficiency (SE) and sum non-linear harvested energy (NLHE) at a fraction of the hardware cost.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.bin b/research/fog-of-knowledge/data/evidence/raw/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.bin
new file mode 100644
index 000000000..772b9ec6c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04242" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04242</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04242</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Kopp</keyname>
+                        <forenames>Fionna B.</forenames>
+                </author>
+                <author>
+                    <keyname>Schalkamp</keyname>
+                        <forenames>Ann-Kathrin</forenames>
+                </author>
+                <author>
+                    <keyname>Azzam</keyname>
+                        <forenames>Shadera</forenames>
+                </author>
+                <author>
+                    <keyname>Rudrapatna</keyname>
+                        <forenames>Vivek</forenames>
+                </author>
+                <author>
+                    <keyname>Borrelli</keyname>
+                        <forenames>Francesco</forenames>
+                </author>
+        </authors>
+        <title>Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The clinical management of chronic disease is naturally structured as a feedback control problem. Physicians observe the disease state at clinic visits and make decisions based on the patient&#39;s history and current state. We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates. We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis. Using the learned model, we formulate therapy selection as a model predictive control problem (MPC) that maximizes the expected time spent in inactive disease states, and we evaluate the resulting policy. In closed-loop simulation on 10 patients, the MPC achieves a cost at or below the observed clinical course in the majority of its realizations for 4 of the 10 patients, and its outcomes in all cases are comparable to observed care and within clinical guidelines.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.bin b/research/fog-of-knowledge/data/evidence/raw/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.bin
new file mode 100644
index 000000000..b57b665f2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28833" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28833</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28833</id>
+        <created>2026-07-30</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Gutowski</keyname>
+                        <forenames>Willa</forenames>
+                </author>
+                <author>
+                    <keyname>Foltz</keyname>
+                        <forenames>Charles</forenames>
+                </author>
+                <author>
+                    <keyname>Koukpaizan</keyname>
+                        <forenames>Nicholson</forenames>
+                </author>
+                <author>
+                    <keyname>Peles</keyname>
+                        <forenames>Slaven</forenames>
+                </author>
+                <author>
+                    <keyname>Tsybina</keyname>
+                        <forenames>Eve</forenames>
+                </author>
+        </authors>
+        <title>Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>5 pages, 5 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system. While high peak electricity prices are an anticipated outcome, measurable under peak hour simulations, the high off peak prices are a significantly underestimated threat. We simulate different ramping conditions on a congestible 5000-bus system, based on a modified IEEE 118-bus grid, to show that, in the presence of fast ramping loads and slow ramping generation, datacenters can aggravate latent load pockets. This results in unexpectedly high system costs during periods outside of datacenter peak. We test the datacenter effects using two distinct load conditions. We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%. These findings are of extreme importance as they reveal the hidden costs of preventively ramping slow generation in anticipation of datacenter load changes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.bin b/research/fog-of-knowledge/data/evidence/raw/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.bin
new file mode 100644
index 000000000..95c3a3ff7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T15:46:01Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.03008" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.03008</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>cs:cs:LO</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.03008</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Bombach</keyname>
+                        <forenames>Clemens</forenames>
+                </author>
+                <author>
+                    <keyname>Lakshmanan</keyname>
+                        <forenames>Rajmadan</forenames>
+                </author>
+                <author>
+                    <keyname>Ragni</keyname>
+                        <forenames>Marco</forenames>
+                </author>
+        </authors>
+        <title>Response Variability and Stability in Human Reasoning</title>
+            <categories>cs.LO cs.AI q-bio.NC</categories>
+            <comments>Accepted as full paper with talk at the 48th Annual Conference of the Cognitive Science Society (CogSci 2026). This version contains minor revisions</comments>
+            <journal-ref>Proceedings of the 48th Annual Meeting of the Cognitive Science Society (2026)</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science. We investigate the stability of response patterns within reasoners and whether variation in these patterns can be used to predict learning effects. We introduce a formal, geometry-based method to quantify distances between individual reasoning patterns and their internal variability, grounded in heuristic theories. The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains. Moreover, we find that reasoning patterns are stable over time within the same reasoner. The method is general enough to be applied to other reasoning domains.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.bin b/research/fog-of-knowledge/data/evidence/raw/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.bin
new file mode 100644
index 000000000..cf004e98d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.bin
@@ -0,0 +1,63 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23085" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23085</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23085</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Siddiqui</keyname>
+                        <forenames>Muhammad Abdur Rab</forenames>
+                </author>
+                <author>
+                    <keyname>Rojas</keyname>
+                        <forenames>Daniela</forenames>
+                </author>
+                <author>
+                    <keyname>Yang</keyname>
+                        <forenames>Chen</forenames>
+                </author>
+                <author>
+                    <keyname>Cui</keyname>
+                        <forenames>Wenqi</forenames>
+                </author>
+                <author>
+                    <keyname>Shi</keyname>
+                        <forenames>Yuanyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Yize</forenames>
+                </author>
+        </authors>
+        <title>Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving</title>
+            <categories>cs.PF cs.DC cs.LG cs.SY eess.SY</categories>
+            <comments>16 pages, 10 figures, in submission</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Large language models (LLMs) and agentic AI systems are creating rapidly growing inference energy demands as model sizes grow and reasoning trajectories extend. While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption. In this paper, we investigate whether adaptive routing across a heterogeneous pool of LLMs can reduce this energy burden without substantially compromising task performance. We design a language-model-based router that reads in each query and selects an answer model from a fixed candidate pool. The candidate models are first profiled through an offline tournament that records their correctness, latency, power, and GPU energy for each query. Using these measurements, the router is trained through supervised fine-tuning followed by group relative policy optimization (GRPO) with the tailored paradigms. Results demonstrate that learned routing can selectively allocate expensive model capacity based on query context and improve the accuracy-energy tradeoff in multi-LLM serving. Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.bin b/research/fog-of-knowledge/data/evidence/raw/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.bin
new file mode 100644
index 000000000..677d829fd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:44Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28780" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28780</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>cs:cs:HC</setSpec>
+            <setSpec>cs:cs:CY</setSpec>
+            <setSpec>econ:econ:GN</setSpec>
+            <setSpec>q-fin:q-fin:EC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28780</id>
+        <created>2026-07-30</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Rosendo-Rios</keyname>
+                        <forenames>Veronica</forenames>
+                </author>
+                <author>
+                    <keyname>Shukla</keyname>
+                        <forenames>Paurav</forenames>
+                </author>
+        </authors>
+        <title>Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement</title>
+            <categories>cs.HC cs.CY econ.GN q-fin.EC</categories>
+            <comments>Accepted for publication in Psychology &amp; Marketing (January 2026). 44 pages, 4 figures, 3 tables</comments>
+            <doi>10.1002/mar.70105</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models. However, little is known about how alternative advertising-supported monetization models can help GenAI firms recover costs while maintaining search query engagement. Drawing on the compromise effect and affective primacy theories, we develop a framework wherein the introduction of advertising-supported monetization models influences user upgrading and downgrading decisions, contingent on the number of available monetization options. Across four experiments (N=1063), findings reveal that introducing a single advertising-supported option enhances the compromise effect, encouraging free users to upgrade, but leading paid subscribers to downgrade. However, offering two advertising-supported models mitigates the effect, maintaining subscriber retention while still motivating free users to upgrade. We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects. We provide actionable insights for GenAI firms on potentially optimizing revenue strategies while balancing user engagement with search queries on their platform.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.bin b/research/fog-of-knowledge/data/evidence/raw/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.bin
new file mode 100644
index 000000000..c17b3b28a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23199" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23199</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23199</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Bai</keyname>
+                        <forenames>Yiyang</forenames>
+                </author>
+                <author>
+                    <keyname>Awwad</keyname>
+                        <forenames>Élie</forenames>
+                </author>
+                <author>
+                    <keyname>Wigger</keyname>
+                        <forenames>Michèle</forenames>
+                </author>
+        </authors>
+        <title>LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems</title>
+            <categories>eess.SP</categories>
+            <doi>10.1109/JPHOT.2026.3734836</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Fiber Bragg grating (FBG)-based sensing enables localized strain and temperature monitoring by tracking the phase changes of the light reflected from FBGs inserted along a fiber. A major source of disturbance in such systems is laser phase noise, and its influence is typically mitigated by means of additional hardware. In this article, we propose to mitigate the influence of laser phase noise by means of digital signal processing. We propose a practical estimator for coherent single-polarization spread-spectrum FBG-based sensing systems, which is motivated by linearizing the complex received signal and approximating the loss function to formulate a minimum mean square error (MMSE) estimation problem. Moreover, a Cramer-Rao lower bound for this FBG-based estimation problem is presented. Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.bin b/research/fog-of-knowledge/data/evidence/raw/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.bin
new file mode 100644
index 000000000..7f15e5dcf
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.27536" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.27536</identifier>
+        <datestamp>2026-08-31</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>econ:econ:TH</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.27536</id>
+        <created>2026-08-27</created>
+            <updated>2026-08-31</updated>
+        <authors>
+                <author>
+                    <keyname>Salizzoni</keyname>
+                        <forenames>Giulio</forenames>
+                </author>
+                <author>
+                    <keyname>Cecchelli</keyname>
+                        <forenames>Domenico Mergoni</forenames>
+                </author>
+                <author>
+                    <keyname>Plumb</keyname>
+                        <forenames>Edward</forenames>
+                </author>
+                <author>
+                    <keyname>Kamgarpour</keyname>
+                        <forenames>Maryam</forenames>
+                </author>
+                <author>
+                    <keyname>Ashkenazi-Golan</keyname>
+                        <forenames>Galit</forenames>
+                </author>
+        </authors>
+        <title>Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games</title>
+            <categories>cs.GT econ.TH</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>While infinitely repeated games admit a rich set of Nash equilibria, finitely repeated games typically have a much smaller and often inefficient one. We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation. Paying these deposits is voluntary and incentive compatible at every stage, so no commitment by the players is assumed, the only commitment required being that of the intermediary to a refund rule fixed before play begins. The mechanism sustains payoff profiles more efficient than those of the standard equilibria, without altering the underlying game and without transfers between players. We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version. We also apply it to a dynamic common-pool resource, suggesting that the construction extends beyond repeated stage-games.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.bin b/research/fog-of-knowledge/data/evidence/raw/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.bin
new file mode 100644
index 000000000..0f1a6221b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.bin
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:43Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.05348" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.05348</identifier>
+        <datestamp>2026-08-07</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.05348</id>
+        <created>2026-08-05</created>
+            <updated>2026-08-07</updated>
+        <authors>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Lin</forenames>
+                </author>
+                <author>
+                    <keyname>Hou</keyname>
+                        <forenames>I-Hong</forenames>
+                </author>
+        </authors>
+        <title>TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Optimizing for both low Age of Information (AoI) and high throughput is critical for remote sensing applications that rely on multichannel wireless networks. However, jointly optimizing these two metrics is an analytically challenging problem, particularly in systems with heterogeneous and unreliable channels. To address this challenge, we propose TSDM, a Two-Stage Deficit Matching scheduling framework. TSDM is based on a second-order approach that characterizes the performance of each data flow by its mean and temporal variance. In the first stage, TSDM translates the high-level utility maximization objective into a concrete set of target mean and temporal variance statistics for transmissions over each node-channel pair. In the second stage, a low-complexity Weighted Matching Deficit (WMD) rule performs real-time channel assignment. We theoretically prove that TSDM achieves the desired mean and temporal variance for each flow. Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems. In both cases, TSDM significantly outperforms existing scheduling policies.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.bin b/research/fog-of-knowledge/data/evidence/raw/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.bin
new file mode 100644
index 000000000..18261923e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:32:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.22049" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.22049</identifier>
+        <datestamp>2026-07-27</datestamp>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.22049</id>
+        <created>2026-07-24</created>
+            <updated>2026-07-27</updated>
+        <authors>
+                <author>
+                    <keyname>Schmidt</keyname>
+                        <forenames>Adrian</forenames>
+                </author>
+                <author>
+                    <keyname>Vermaas</keyname>
+                        <forenames>Pieter</forenames>
+                </author>
+                <author>
+                    <keyname>Seskir</keyname>
+                        <forenames>Zeki C.</forenames>
+                </author>
+        </authors>
+        <title>ELSA as an asset to the EU Quantum Act: A position paper</title>
+            <categories>physics.soc-ph</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Europe&#39;s expertise in the ethical, legal, and social aspects (ELSA) of emerging technologies is a strategic asset for the successful and sovereign development of quantum technologies. In this position paper, we argue that this expertise should become a central part of the upcoming EU Quantum Act. At a time when quantum technologies are becoming more powerful, economically relevant, and geopolitically contested, European policy should not reduce societal considerations to risk assessment and ex-post regulation. Instead, ELSA expertise can translate European values into technological practices, governance structures, and concrete policy measures, thereby supporting a development which is responsible, socially robust, and competitive. Taking inspiration from the role of concept cars, we present eight aspirational ELSA recommendations that demonstrate what a distinctly European approach to quantum technologies could offer. These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies. Together, we show that ELSA is not only about mitigating risks. It can also amplify benefits, increase legitimacy and societal acceptance, support economic prosperity, and contribute to a truly sovereign European quantum future.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.bin b/research/fog-of-knowledge/data/evidence/raw/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.bin
new file mode 100644
index 000000000..39550b07c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.bin
@@ -0,0 +1,49 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-14T15:32:24Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.16273" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.16273</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>cs:cs:CL</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:AS</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.16273</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Naowarat</keyname>
+                        <forenames>Burin</forenames>
+                </author>
+                <author>
+                    <keyname>Tang</keyname>
+                        <forenames>Hao</forenames>
+                </author>
+                <author>
+                    <keyname>Goldwater</keyname>
+                        <forenames>Sharon</forenames>
+                </author>
+        </authors>
+        <title>Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory</title>
+            <categories>cs.CL cs.LG eess.AS</categories>
+            <comments>Accepted at SLT 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to identify a good subspace, nevertheless this result demonstrates much stronger implicit word knowledge in HuBERT than has previously been shown.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.bin b/research/fog-of-knowledge/data/evidence/raw/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.bin
new file mode 100644
index 000000000..0fd360d1a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:05Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.29972" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.29972</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>q-bio:q-bio:PE</setSpec>
+            <setSpec>physics:physics:med-ph</setSpec>
+            <setSpec>q-bio:q-bio:QM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.29972</id>
+        <created>2026-09-24</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Polyakov</keyname>
+                        <forenames>Maxim</forenames>
+                </author>
+                <author>
+                    <keyname>Chernikova</keyname>
+                        <forenames>Yulia</forenames>
+                </author>
+        </authors>
+        <title>Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy</title>
+            <categories>q-bio.PE physics.med-ph q-bio.QM</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We develop and analyse a mechanistic ODE model of within-host HIV dynamics that includes uninfected CD4$^+$ T cells, latently and productively infected cells, free virions, and cytotoxic immune effectors. Antiretroviral therapy is described by two time-dependent efficacy functions that separately reduce new infections and virion production. We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state. We also obtain treatment-dependent suppression thresholds and an analytical estimate of when this threshold is crossed as treatment efficacy declines. Numerical simulations consider untreated infection, ART initiation, periodic variation in efficacy, and progressive loss of treatment effect. Without therapy, the model approaches a state of persistent infection. ART reduces viral load and promotes recovery of the CD4$^+$ T-cell population, while the latent reservoir persists under the parameter set considered. Periodic changes in treatment efficacy produce sustained forced oscillations. These results connect the analytical threshold conditions with the treatment-dependent dynamics of the model and provide a basis for future calibration, sensitivity analysis, uncertainty quantification, and extensions informed by clinical data.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.bin b/research/fog-of-knowledge/data/evidence/raw/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.bin
new file mode 100644
index 000000000..826f3b706
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.bin
@@ -0,0 +1,61 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:32Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.17248" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.17248</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.17248</id>
+        <created>2026-07-31</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Atef</keyname>
+                        <forenames>Mohamed</forenames>
+                </author>
+                <author>
+                    <keyname>Alahakoon</keyname>
+                        <forenames>Sanath</forenames>
+                </author>
+                <author>
+                    <keyname>Mumtahina</keyname>
+                        <forenames>Umme</forenames>
+                </author>
+                <author>
+                    <keyname>Wolfs</keyname>
+                        <forenames>Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Khatib</keyname>
+                        <forenames>Tamer</forenames>
+                </author>
+                <author>
+                    <keyname>Uddin</keyname>
+                        <forenames>Moslem</forenames>
+                </author>
+        </authors>
+        <title>Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hydrogen-enabled community microgrids require coordinated control of intermittent renewable generation and coupled battery and hydrogen storage. This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup. Raw continuous actions are projected onto the feasible operating set before evaluating the hourly power balance, ensuring operationally valid dispatch.
+  The proof-of-concept study uses 8,760 hourly observations for a 1,000-household community in Rockhampton, Australia. The same annual chronology and one random seed were used for training and evaluation. Under a 1 percent independent hourly grid outage probability, the system achieved an annual net operating cash balance of AUD 195,690.67, load satisfaction of 99.77 percent, and a gross renewable share of 91.2 percent. After removing duplicated hydrogen electricity emissions, annual emissions were 1.342 kt CO2, equivalent to 0.328 kg CO2 per kWh of served demand and 0.087 kg CO2 per kWh of export-inclusive delivered energy.
+  At a 5 percent outage probability, the cash balance decreased to AUD 169,892.21 and load satisfaction fell to 98.79 percent. Battery discharge and diesel generation increased more than fuel cell output. The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.bin b/research/fog-of-knowledge/data/evidence/raw/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.bin
new file mode 100644
index 000000000..354edfb32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T20:37:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04776" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04776</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:NI</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04776</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Zehua</forenames>
+                </author>
+                <author>
+                    <keyname>Adve</keyname>
+                        <forenames>Raviraj</forenames>
+                </author>
+                <author>
+                    <keyname>Bahceci</keyname>
+                        <forenames>Israfil</forenames>
+                </author>
+                <author>
+                    <keyname>Ahmed</keyname>
+                        <forenames>Yahia</forenames>
+                </author>
+        </authors>
+        <title>Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks</title>
+            <categories>cs.IT cs.NI cs.SY eess.SY math.IT math.OC</categories>
+            <comments>To be presented at 2026 IEEE Globecom Workshops, 6 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.bin b/research/fog-of-knowledge/data/evidence/raw/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.bin
new file mode 100644
index 000000000..fbf936ffa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.22775" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.22775</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:AR</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.22775</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Pham</keyname>
+                        <forenames>Thanh</forenames>
+                </author>
+                <author>
+                    <keyname>Islam</keyname>
+                        <forenames>Riadul</forenames>
+                </author>
+        </authors>
+        <title>DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks</title>
+            <categories>cs.AI cs.AR eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons. However, two challenges limit their practical deployment. First, fixed-parameter Leaky Integrate-and-Fire (LIF) neurons lack the adaptation mechanisms observed in biology, where neurons modulate their excitability based on firing history. Second, scaling from single neurons to multi-neuron networks introduces challenges in synaptic weight distribution and inter-neuron spike routing that are absent in isolated designs. This paper addresses both issues through the extension, verification, and physical implementation of adaptive LIF neurons at three architectural scales. This work contributes: a 2nd-order neuron with two-stage synaptic filtering for richer temporal dynamics; a fully-connected 6-neuron spiking network with configurable weights (100 to 5) demonstrating weight-based inter-neuron communication; and a direct verification methodology enabling per-cycle observation of all internal states. All designs were synthesized targeting Selected Area Electron Diffraction (SAED) 14 nm Complementary Metal-Oxide-Semiconductor (CMOS) technology at 1 GHz and verified with Cocotb-based Python testbenches under pulsed current stimuli (amplitude 80, ISI=3). The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\ 26 spikes). Physically, the 2nd-order neuron costs 1.77x more area and 1.52x more power than the 1st-order baseline, while the 6-neuron network demonstrates near-linear scaling (5.7x area, 5.3x power). Seven verification bugs spanning testbench connectivity, fixed-point overflow, and Verilog expression-width semantics are documented.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.bin b/research/fog-of-knowledge/data/evidence/raw/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.bin
new file mode 100644
index 000000000..3573ba3f0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.06066" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.06066</identifier>
+        <datestamp>2026-09-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.06066</id>
+        <created>2026-09-05</created>
+            <updated>2026-09-09</updated>
+        <authors>
+                <author>
+                    <keyname>Camargo</keyname>
+                        <forenames>Romina Garcia</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Zhiyang</forenames>
+                </author>
+                <author>
+                    <keyname>Ribeiro</keyname>
+                        <forenames>Alejandro</forenames>
+                </author>
+        </authors>
+        <title>Scalability of Graph Neural Network Policies in Wireless Communication Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings. Scalability theories rely on dense graphon limits or continuous manifold approximations, both of which fail under the sparse, bounded-degree regimes and Euclidean metric constraints of physical wireless environments. This paper establishes a theoretical framework for GNN transferability over sparse Random Geometric Graphs (RGGs), capturing distance-dependent channel decay and spatial interference. We model sparse RGGs as spatial perturbations of regular Deterministic Grid Graphs (DGGs) and employ spatial windowing operators to compare networks across differing scales. Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs. Combining these results establishes formal scalability bounds across sparse RGG topologies. Finally, we extend this framework to conflict graph models, deriving equivalent scalability guarantees for link-level resource allocation policies. We verify our results for scalability with two experiment settings: power allocation and wireless link scheduling. The simulations show GNNs exhibit the expected scalable behavior, and analyze the relevance of our theoretical assumptions in practical deployment.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.bin b/research/fog-of-knowledge/data/evidence/raw/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.bin
new file mode 100644
index 000000000..67bb8f798
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.bin
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-13T08:17:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.11869" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.11869</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+            <setSpec>math:math:ST</setSpec>
+            <setSpec>stat:stat:TH</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.11869</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Ruwanpathirana</keyname>
+                        <forenames>Aravinda Kanchana</forenames>
+                </author>
+                <author>
+                    <keyname>Tyagi</keyname>
+                        <forenames>Hemant</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Sunny G. W.</forenames>
+                </author>
+        </authors>
+        <title>Learning structured linear dynamical systems from missing observations</title>
+            <categories>stat.ML cs.LG cs.SY eess.SY math.OC math.ST stat.TH</categories>
+            <comments>62 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider the problem of learning structured linear dynamical systems over convex sets $\mathcal{K}$, where only a small subset of the observations are available at each time point. An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed. Non-asymptotic bounds are obtained for the statistical error, which depend on the local complexity of $\mathcal{K}$, the trajectory length $T$, and the sub-sampling probability $p$. Convergence of the projected gradient descent algorithm is also established. The general theory is applied to settings where (i) $\mathcal{K}$ is a subspace, (ii) $\mathcal{K}$ is the set of bi-isotonic matrices, and (iii) $\mathcal{K}$ is the set of matrices whose rows are formed by sampling Lipschitz functions. We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.bin b/research/fog-of-knowledge/data/evidence/raw/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.bin
new file mode 100644
index 000000000..34e675e3b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:27Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.08599" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.08599</identifier>
+        <datestamp>2026-08-11</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.08599</id>
+        <created>2026-08-09</created>
+            <updated>2026-08-11</updated>
+        <authors>
+                <author>
+                    <keyname>Fadakar</keyname>
+                        <forenames>Alireza</forenames>
+                </author>
+                <author>
+                    <keyname>Molisch</keyname>
+                        <forenames>Andreas F.</forenames>
+                </author>
+        </authors>
+        <title>Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System</title>
+            <categories>eess.SP</categories>
+            <comments>4 pages, 3 figures, Accepted for publication in the 2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</comments>
+            <journal-ref>2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Electromagnetically reconfigurable fluid antenna system (ER-FAS) provides additional electromagnetic (EM)-domain degrees of freedom by enabling dynamic control of per-element radiation patterns, thereby improving power efficiency in wireless communications. The effective exploitation of these capabilities, however, critically depends on accurate channel estimation, which has received limited attention in prior studies. This paper presents a low-complexity channel parameter estimation framework for downlink wideband systems that leverages available channel sparsity. A synthesis-based reconfigurability model is considered, where each antenna generates desired beampatterns using a finite set of EM basis functions. Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters. Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.bin b/research/fog-of-knowledge/data/evidence/raw/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.bin
new file mode 100644
index 000000000..5a1ab78f6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.bin
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:38Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16353" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16353</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16353</id>
+        <created>2026-09-14</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Martin</keyname>
+                        <forenames>Andrea</forenames>
+                </author>
+                <author>
+                    <keyname>Fabiani</keyname>
+                        <forenames>Filippo</forenames>
+                </author>
+                <author>
+                    <keyname>Belgioioso</keyname>
+                        <forenames>Giuseppe</forenames>
+                </author>
+        </authors>
+        <title>Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Operator splitting methods are a fundamental class of algorithms for solving structured monotone inclusion problems arising in optimization, control, and game theory. We consider the case, common in stochastic regimes, where the forward evaluation of one of the constituent operators is either unavailable in closed form or computationally expensive to evaluate, and is therefore approximated using a finite number of noisy oracle samples. We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms. Unlike previous works, our analysis directly controls the residual error via martingale inequalities instead of relying on algorithmic stability arguments for a tailored surrogate loss, yielding the first a priori certificates whose statistical excess provably vanishes with the sample size. We further show that, under linear convergence of the Davis-Yin splitting algorithm, the dependence of our bounds on the iteration count improves from linear growth to exponential decay. We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.bin b/research/fog-of-knowledge/data/evidence/raw/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.bin
new file mode 100644
index 000000000..e647726d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.bin
@@ -0,0 +1,45 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T08:37:33Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15934" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15934</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15934</id>
+        <created>2026-10-11</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Manas</keyname>
+                        <forenames>Kumar</forenames>
+                </author>
+                <author>
+                    <keyname>Paschke</keyname>
+                        <forenames>Adrian</forenames>
+                </author>
+        </authors>
+        <title>Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>8 pages</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Motion planning for automated vehicles in interactive traffic has to simultaneously ensure safety, respect traffic rules, and maintain comfortable progress under multi-modal behavior uncertainty. Imposing all these requirements as hard constraints reduces feasibility, whereas treating them all as costs allows safety-critical requirements to be traded against progress. We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor. This retains robustness to discrete interaction modes without branch-specific contingent ego policies. We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective. Closed-loop Monte Carlo evaluation over six highway and intersection scenarios shows the highest strict success rate among the compared planners with no observed collisions or rule violations, at roughly a quarter of the planning latency of the unoptimized formulation. An ablation study separates the two layers: the hard constraints define the safety envelope, while the soft terms improve clearance and motion quality within it.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.bin b/research/fog-of-knowledge/data/evidence/raw/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.bin
new file mode 100644
index 000000000..c3b0a86dc
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12398" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12398</identifier>
+        <datestamp>2026-08-14</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12398</id>
+        <created>2026-08-08</created>
+            <updated>2026-08-14</updated>
+        <authors>
+                <author>
+                    <keyname>Varma</keyname>
+                        <forenames>Subir</forenames>
+                </author>
+        </authors>
+        <title>A Hierarchical Energy-Based Model for Multimodal Cognition</title>
+            <categories>q-bio.NC cs.AI</categories>
+            <comments>48 pages, 14 figures</comments>
+            <msc-class>I.2</msc-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose IM-LEPP (Integrated Multimodal Latent Energy-based Predictive Processing), a hierarchical, energy-based model of multimodal cognition that extends a previously proposed single-modality model (LEPP) to integrate vision and language. Following the view that generative neural networks are effective theories of cognitive dynamics, analogous to how statistical mechanics relates to thermodynamics, IM-LEPP models cognition as latent states flowing through learned energy landscapes rather than as an account of neural circuitry. The architecture is a hub-and-spoke hierarchy, grounded in the controlled semantic cognition framework of Lambon Ralph et al., in which predictive-coding pipelines for visual objects, scenes, and linguistic units converge on a shared amodal hub modeled on the anterior temporal lobe. Each pipeline&#39;s own prediction is conditioned by, rather than overwritten by, the current hub state, preserving pipeline-specific identity while letting every prediction reflect the full multimodal context. We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction. We also discuss data-efficient language acquisition relative to LLMs, outline a semantic/episodic memory subsystem, situate the model against predictive coding, the free-energy principle, JEPA, and Hierarchical Temporal Memory, and propose concrete experimental predictions to test its central claims Key Words: predictive processing; predictive coding; energy-based models; diffusion models; effective theory; computational neuroscience.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.bin b/research/fog-of-knowledge/data/evidence/raw/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.bin
new file mode 100644
index 000000000..6cee7378f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.bin
@@ -0,0 +1,59 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:50Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.18396" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.18396</identifier>
+        <datestamp>2026-08-20</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.18396</id>
+        <created>2026-08-18</created>
+            <updated>2026-08-20</updated>
+        <authors>
+                <author>
+                    <keyname>Ashtekar</keyname>
+                        <forenames>Amod</forenames>
+                </author>
+                <author>
+                    <keyname>Davis</keyname>
+                        <forenames>Dalton</forenames>
+                </author>
+                <author>
+                    <keyname>Lomboy</keyname>
+                        <forenames>Rafaela</forenames>
+                </author>
+                <author>
+                    <keyname>Ibrahim</keyname>
+                        <forenames>Omar</forenames>
+                </author>
+                <author>
+                    <keyname>Bandari</keyname>
+                        <forenames>Raj Sai Sohel</forenames>
+                </author>
+                <author>
+                    <keyname>Eltayeb</keyname>
+                        <forenames>Mohammed E.</forenames>
+                </author>
+        </authors>
+        <title>LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Highly directional 60-GHz Internet-of-Things (IoT) links can exploit naturally occurring indoor surfaces to sustain connectivity under blockage. Identifying viable non-line-of-sight (NLoS) paths, however, can require extensive RF beam training. This paper investigates whether LiDAR can reduce this search overhead by providing a surface-aware prior without assuming a direct mapping between optical return and mmWave reflection. The proposed framework uses LiDAR-derived geometry and return statistics to rank candidate propagation directions, while RF measurements remain responsible for final beam selection. The experimental validation is organized in three stages to separate descriptor robustness, cross-modal association, and beam-search performance. Controlled LiDAR measurements first quantify how geometric and radiometric surface descriptors vary with acquisition geometry. Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction. Finally, a separate room-scale campaign evaluates the resulting prior using exhaustive TX-RX beam maps without prescribing the underlying propagation mechanism. The measurements show that descriptor reliability depends on acquisition geometry and point-cloud representation, and that LiDAR and RF surface responses exhibit cross-modal association without supporting deterministic RF-power prediction. In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region. These results establish LiDAR-derived local surface structure as a communication-oriented prior for concentrating RF probing and reducing mmWave beam-search uncertainty.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.bin b/research/fog-of-knowledge/data/evidence/raw/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.bin
new file mode 100644
index 000000000..91163fd32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-11T06:06:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.07616" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.07616</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.07616</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Siyuan</forenames>
+                </author>
+        </authors>
+        <title>Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>8 pages, 7 figures, 3 tables</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We present a repertoire-free benchmark for soft-robot damage recovery under nine online trials. The protocol pairs damage masks within each morphology, retains a measured nominal fallback, and separates method development from evaluation on new bodies. A Gaussian-process expected-improvement (GP-EI) reference controller adapts actuator phases using three initialization probes and six feedback-selected rollouts. Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets. GP-EI improves the worst-mask gain on 69/75 confirmation bodies and exceeds these four baselines by 0.235-0.310 mean worst-mask reward. A TuRBO-style local GP is the closest comparator; the paired confidence interval includes zero. Post-confirmation fixed-controller replay finds 5.06 voxel widths of mean recovery together with a 0.0031 increase in worst-mask p99 geometric edge strain; a strict no-added-demand deployment gate retains 48.7% of mean gain. In a frozen development stress test that physically removes 10% of occupied voxels, GP-EI improves 71/75 bodies and exceeds official BoTorch TuRBO by 0.356 mean worst-mask gain. Together, the replayable controllers, body-level inference, and frozen-cohort evaluation provide a reference for measuring the added value of learned damage priors and future adaptation methods.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.bin b/research/fog-of-knowledge/data/evidence/raw/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.bin
new file mode 100644
index 000000000..96055a0f1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:29Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.00959" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.00959</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.00959</id>
+        <created>2026-08-02</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Fridovich-Keil</keyname>
+                        <forenames>David</forenames>
+                </author>
+        </authors>
+        <title>MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems</title>
+            <categories>cs.GT cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics. The dominant solver for problems of this form is PATH, which offers strong performance on robotics problems but remains closed-source. We present MixedComplementarityProblems.jl, an open-source, pure Julia implementation of an interior point method for parametric MCPs that: (i) matches PATH&#39;s reliability on standard benchmarks, (ii) natively supports batched, parallel processing of many parameter instances, either across CPU threads or on an NVIDIA GPU, and (iii) supports efficient automatic differentiation of solutions with respect to problem parameters. On a multi-agent lane-change trajectory game representative of robotics planning problems, our CPU-multithreaded batched solver clears a batch of parametric instances ~100x faster than sequential calls to PATH. A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence. We describe the solver&#39;s interior point formulation, the abstraction that lets a single solver implementation run unmodified across dense, batched-sparse, and single-large linear-algebra backends, and report benchmarks against PATH on both randomly generated quadratic programs and trajectory games.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.bin b/research/fog-of-knowledge/data/evidence/raw/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.bin
new file mode 100644
index 000000000..8be682135
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.bin
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T11:16:14Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.17295" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.17295</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.17295</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Nair</keyname>
+                        <forenames>Nikhil</forenames>
+                </author>
+                <author>
+                    <keyname>Caradonna</keyname>
+                        <forenames>Daniele</forenames>
+                </author>
+                <author>
+                    <keyname>Mathew</keyname>
+                        <forenames>Anup Teejo</forenames>
+                </author>
+                <author>
+                    <keyname>Renda</keyname>
+                        <forenames>Federico</forenames>
+                </author>
+                <author>
+                    <keyname>Della Santina</keyname>
+                        <forenames>Cosimo</forenames>
+                </author>
+                <author>
+                    <keyname>Feliu-Talegon</keyname>
+                        <forenames>Daniel</forenames>
+                </author>
+        </authors>
+        <title>Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>7 pages, 6 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Continuum soft robots are highly nonlinear and underactuated systems, which makes stabilizing them around unstable equilibrium points difficult. This challenge becomes even greater in low stiffness regimes, where gravitational forces dominate elastic forces. In this letter, we explore whether optimal control can address these challenges using a computa- tionally efficient method suitable for real time use. We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives. This results in an efficient control framework for addressing the stabilization problem. Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.bin b/research/fog-of-knowledge/data/evidence/raw/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.bin
new file mode 100644
index 000000000..a22b118bd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.bin
@@ -0,0 +1,71 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:28Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.19468" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.19468</identifier>
+        <datestamp>2026-09-18</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.19468</id>
+        <created>2026-09-16</created>
+            <updated>2026-09-18</updated>
+        <authors>
+                <author>
+                    <keyname>Hsu</keyname>
+                        <forenames>Tzu-Hsuan</forenames>
+                </author>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Zihuan</forenames>
+                </author>
+                <author>
+                    <keyname>Gupta</keyname>
+                        <forenames>Harshvardhan</forenames>
+                </author>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Ziqian</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Wei</forenames>
+                </author>
+                <author>
+                    <keyname>Chulukhadze</keyname>
+                        <forenames>Vakhtang</forenames>
+                </author>
+                <author>
+                    <keyname>Kramer</keyname>
+                        <forenames>Jack</forenames>
+                </author>
+                <author>
+                    <keyname>Hall</keyname>
+                        <forenames>Neal</forenames>
+                </author>
+                <author>
+                    <keyname>Lu</keyname>
+                        <forenames>Ruochen</forenames>
+                </author>
+        </authors>
+        <title>High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization</title>
+            <categories>eess.SP</categories>
+            <comments>10 pages, 9 figures, 2 tables. Submitted to IEEE Journal of Microelectromechanical Systems</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents the design, characterization, and large-signal measurement methodology of a high-order whip-mode flexural microresonator on a lithium tantalate-on-insulator (LTOI) unimorph platform. A tapered cantilever concentrates kinetic energy at the free tip through a structural velocity amplification effect, with a targeted whip mode at 9.175 MHz exhibiting a measured Q of 691 in air. The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies. In-air large-signal testing on a separate device confirms tip velocities up to 20 m/s before the reliable measurement range of the laser Doppler vibrometer (LDV) at the tapered tip is exceeded, while the device itself sustains drive levels up to 240 Vpp before failure. Transitioning to vacuum reveals photothermal-induced static bending of the LTOI cantilever under LDV laser illumination, an effect that prohibits direct velocity measurement for these resonators. Hence, it motivates an indirect extraction methodology to be implemented. In this work, a 3.85 times base-to-tip geometric amplification factor, independently calibrated at low drive, is applied to base velocity measurements to infer tip velocity under large-signal conditions. Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate. Large-signal failure-mode analysis identifies Pt/Au electrode melting at 210 Vpp as the current velocity ceiling. These results suggest that geometric amplification in high-order flexural modes offers a viable pathway toward the high proof-mass velocities targeted for next-generation MEMS inertial sensors.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.bin b/research/fog-of-knowledge/data/evidence/raw/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.bin
new file mode 100644
index 000000000..8c626d047
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.bin
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-14T10:06:57Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.07307" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.07307</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.07307</id>
+        <created>2026-10-05</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Mahesh</keyname>
+                        <forenames>Karan</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Runyu</forenames>
+                </author>
+                <author>
+                    <keyname>Benjamin</keyname>
+                        <forenames>Michael R.</forenames>
+                </author>
+                <author>
+                    <keyname>Zardini</keyname>
+                        <forenames>Gioele</forenames>
+                </author>
+        </authors>
+        <title>Metric-Based Equilibrium Selection in Noncooperative Differentiable Games</title>
+            <categories>cs.GT cs.SY eess.SY</categories>
+            <comments>8 pages, 2 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Metric conditioning can change which equilibrium attracts learning dynamics without moving the equilibria of a differentiable game. We study how to use state-dependent symmetric positive-definite (SPD) metrics to select among known equilibria by keeping a designated equilibrium attracting while making a rival unstable. Building on classical results on matrix stability under positive-definite multiplication, we characterize when such destabilization is possible and show how restricting the metric to act independently on each player limits the stability changes that can be achieved at differential Nash equilibria. We then combine a stabilizing metric at the selected equilibrium with a destabilizing metric at the rival through smooth interpolation, yielding a single metric field that preserves every equilibrium of the game while assigning the desired local stability types. We also derive a step-size condition for implementing the method in discrete time. The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.bin b/research/fog-of-knowledge/data/evidence/raw/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.bin
new file mode 100644
index 000000000..b676d8214
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.bin
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:29:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.26209" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.26209</identifier>
+        <datestamp>2026-07-30</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.26209</id>
+        <created>2026-07-28</created>
+            <updated>2026-07-30</updated>
+        <authors>
+                <author>
+                    <keyname>García-Morales</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>de la Fuente</keyname>
+                        <forenames>Alejandro</forenames>
+                </author>
+                <author>
+                    <keyname>Gualda</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Carro-Calvo</keyname>
+                        <forenames>Leopoldo</forenames>
+                </author>
+                <author>
+                    <keyname>Riera-Palou</keyname>
+                        <forenames>Felip</forenames>
+                </author>
+                <author>
+                    <keyname>Femenias</keyname>
+                        <forenames>Guillem</forenames>
+                </author>
+        </authors>
+        <title>Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks</title>
+            <categories>eess.SP</categories>
+            <comments>Author Accepted Manuscript. Published in IEEE Open Journal of the Communications Society. Available at https://doi.org/10.1109/OJCOMS.2026.3717118. Copyright 2026 IEEE</comments>
+            <doi>10.1109/OJCOMS.2026.3717118</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads. Existing AP ON/OFF mechanisms--typically based on worst-case dimensioning or greedy heuristics--explore the combinatorial activation space inadequately, leading to suboptimal energy-efficiency outcomes. This paper introduces two evolutionary AP-selection strategies tailored to CF-mMIMO networks. The first, a constrained genetic algorithm (CGA), identifies the near-optimal subset of active APs for any fixed activation cardinality, while an outer search determines the globally optimal operating point. The second, a Pareto-driven genetic algorithm (PDGA), jointly optimizes spectral and energy efficiency by evolving a Pareto front over all feasible activation patterns. A detailed computational-complexity analysis is provided for both techniques. Simulations conducted under realistic spatially inhomogeneous traffic and considering both conjugate beamforming (CB) and minimum mean square error (MMSE) processing confirm consistent performance gains. The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere. These results highlight the strong potential of evolutionary optimization as a powerful and reliable approach for energy-efficient CF-mMIMO deployments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.bin b/research/fog-of-knowledge/data/evidence/raw/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.bin
new file mode 100644
index 000000000..2c488292e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.10254" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.10254</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:LO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.10254</id>
+        <created>2026-08-10</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Peper</keyname>
+                        <forenames>Jordan</forenames>
+                </author>
+                <author>
+                    <keyname>Kapadia</keyname>
+                        <forenames>Krish</forenames>
+                </author>
+                <author>
+                    <keyname>Gast</keyname>
+                        <forenames>James</forenames>
+                </author>
+                <author>
+                    <keyname>Howes</keyname>
+                        <forenames>Ethan</forenames>
+                </author>
+                <author>
+                    <keyname>Ruchkin</keyname>
+                        <forenames>Ivan</forenames>
+                </author>
+        </authors>
+        <title>A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems</title>
+            <categories>eess.SY cs.LO cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction. To transfer verification guarantees from the abstract model to the concrete CPS, the abstraction must conservatively approximate the concrete state space and behaviors. Hence, model-builders must maintain this soundness while balancing pessimism with tractability. However, they face several common pitfalls such as under-approximating the state space, under-approximating transitions, unsound pruning of &#34;degenerate&#34; behaviors, and improper specification lifting. This tutorial presents a pragmatic, conservative-by-construction workflow for building discrete abstractions of closed-loop dynamical systems. The workflow consists of four modular steps with interchangeable subroutines: (i) state-space partition and abstraction-function design, (ii) conservative transition construction via axis-aligned bounding boxes, polytopes, or sampling with PAC coverage certificates, (iii) mitigation of spurious transitions and self-loops using certified erasure and counterexample-guided abstraction refinement, and (iv) sound lifting of LTL specifications using may-must semantics. We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.bin b/research/fog-of-knowledge/data/evidence/raw/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.bin
new file mode 100644
index 000000000..bab696428
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02079" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02079</identifier>
+        <datestamp>2026-08-11</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02079</id>
+        <created>2026-08-03</created>
+            <updated>2026-08-11</updated>
+        <authors>
+                <author>
+                    <keyname>Şanlan</keyname>
+                        <forenames>Abdülbaki</forenames>
+                </author>
+                <author>
+                    <keyname>Altunkaya</keyname>
+                        <forenames>Ege C.</forenames>
+                </author>
+                <author>
+                    <keyname>Bağci</keyname>
+                        <forenames>Hasan T.</forenames>
+                </author>
+                <author>
+                    <keyname>Koyuncu</keyname>
+                        <forenames>Emre</forenames>
+                </author>
+                <author>
+                    <keyname>Özkol</keyname>
+                        <forenames>İbrahim</forenames>
+                </author>
+        </authors>
+        <title>TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In vision-aided navigation and visual-inertial odometry, the quality of triangulated three-dimensional feature positions is a fundamental prerequisite for state estimation accuracy. Triangulation becomes ill-conditioned or even impossible when a camera undergoes pure rotation without translation, or when the observed bearing vectors provide insufficient parallax. Even though visual-inertial odometry has been extensively studied, the active maintenance of feature-observability during navigation has not been sufficiently addressed in the literature. To address this gap, this study presents TANGO-VIO, a triangulation-aware navigation framework that embeds a log-determinant metric of the feature-wise stacked-bearing matrix into a control barrier function. In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction. The proposed architecture is evaluated through software-inthe- loop simulations and real flight experiments. The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter. Supplementary materials are available on the project webpage.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.bin b/research/fog-of-knowledge/data/evidence/raw/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.bin
new file mode 100644
index 000000000..e6c5a354d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:48Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28276" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28276</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28276</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Huang</keyname>
+                        <forenames>Sin-Yu</forenames>
+                </author>
+                <author>
+                    <keyname>Wong</keyname>
+                        <forenames>Vincent W. S.</forenames>
+                </author>
+        </authors>
+        <title>Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming</title>
+            <categories>cs.IT cs.SY eess.IV eess.SY math.IT</categories>
+            <comments>Accepted by IEEE Transactions on Communications (TCOM)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Semantic communication is an emerging paradigm that can preserve the meaning of data during transmission. However, human users are often interested in specific semantic content based on their intent, and users&#39; intent is often not considered in current semantic coding design. Moreover, most of the existing semantic models are fine-tuned using specific datasets, which limits their generalization capability. Furthermore, how to prioritize semantically important features in large-scale multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems remains largely unexplored. To address the aforementioned challenges, in this paper, we propose a generalized query-oriented image semantic coding (QO-ISC) framework. In the proposed framework, the transmitter extracts features which are relevant to the user&#39;s query and the receiver reconstructs an image based on those features. We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations. We develop a semantic-aware hybrid beamforming (SA-HBF) algorithm to prioritize semantically important features for large-scale MIMO-OFDM system. When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.bin b/research/fog-of-knowledge/data/evidence/raw/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.bin
new file mode 100644
index 000000000..79f4e94d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.06918" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.06918</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.06918</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Maity</keyname>
+                        <forenames>Sreejeet</forenames>
+                </author>
+                <author>
+                    <keyname>Mitra</keyname>
+                        <forenames>Aritra</forenames>
+                </author>
+        </authors>
+        <title>Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We study federated reinforcement learning in which multiple agents interact with a common Markov decision process and communicate through a central server to collaboratively learn the optimal state-action value function. Our goal is to understand whether the sample-efficiency benefits of collaboration can be retained when a fraction of the agents behave adversarially and transmit arbitrarily corrupted information. To address this problem, we introduce Robust Async-Fed-Q, an epoch-based federated learning algorithm that combines variance-reduced estimation of the Bellman optimality operator at the agents with robust aggregation at the server. We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption. In particular, the effect of the adversarial agents decreases as the amount of data collected by each honest agent grows and eventually vanishes in the infinite-sample limit. We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning. We further extend our framework to accommodate single-trajectory Markovian sampling and heterogeneous partial coverage, where different agents may explore different regions of the state-action space and learning relies on their collective coverage. Finally, our epoch-based design substantially improves the best known communication complexity for federated Q-learning under asynchronous sampling.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.bin b/research/fog-of-knowledge/data/evidence/raw/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.bin
new file mode 100644
index 000000000..99fd2ffd7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.bin
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04662" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04662</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04662</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Matheu</keyname>
+                        <forenames>Ryan</forenames>
+                </author>
+                <author>
+                    <keyname>Damera</keyname>
+                        <forenames>Sai Sandeep</forenames>
+                </author>
+                <author>
+                    <keyname>Baras</keyname>
+                        <forenames>John S.</forenames>
+                </author>
+                <author>
+                    <keyname>Belta</keyname>
+                        <forenames>Calin</forenames>
+                </author>
+        </authors>
+        <title>Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks</title>
+            <categories>eess.SY cs.RO cs.SY</categories>
+            <comments>9 pages, 6 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems. Many techniques exist for control synthesis according to temporal logic specifications, spanning a large variety of systems, including robotics. However, the vast majority of implementations are limited to Boolean temporal logics. Boolean temporal logic does not have an innate mechanism for quantifying abstention, rather verdicts are either definitively \textit{True} or \textit{False}. Recent work demonstrates that ternary logic is a capable formalism for reasoning about robotic behaviors, with the natural ability to classify uncertainty with the \textit{Unknown} literal. Ternary temporal logic is still in its infancy, with work limited to synthesis for linear systems and monitoring. This work proposes a probabilistic relaxation of ternary temporal logic that allows for value and gradient computation through the same network while retaining exact verdicts on actual data. The relaxed network can be used as an objective in gradient-based control synthesis for both offline and online robotic control applications. We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.bin b/research/fog-of-knowledge/data/evidence/raw/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.bin
new file mode 100644
index 000000000..3a2547675
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28185" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28185</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28185</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Chehreghani</keyname>
+                        <forenames>Mostafa Haghir</forenames>
+                </author>
+        </authors>
+        <title>Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks</title>
+            <categories>cs.LG cs.AI cs.IT math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Oversmoothing is a fundamental limitation of deep graph neural networks (GNNs), where repeated message passing causes node representations to become increasingly similar, eventually collapsing toward a low-dimensional subspace. This phenomenon limits the effective depth of message-passing architectures and motivates the search for mechanisms that preserve representation diversity. In this paper, we study a recurrent graph neural network in which independent Gaussian noise is injected after every propagation step and analyze the resulting architecture as a stochastic dynamical system. Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure. Our main theoretical result establishes an explicit positive lower bound on the expected stationary Dirichlet energy, proportional to both the noise variance and the spectral gap of the underlying graph. Consequently, the stationary representations cannot collapse onto the constant manifold, providing a rigorous guarantee that asymptotic oversmoothing is prevented in the sense of non-vanishing Dirichlet energy. Our analysis reveals persistent stochastic perturbations as a fundamentally different mechanism for combating oversmoothing, complementing existing deterministic approaches based on residual connections, normalization, and graph rewiring. Finally, numerical experiments on both linear and nonlinear recurrent graph neural networks closely match the theoretical predictions, illustrating the emergence of a stationary distribution and the predicted dependence of the limiting Dirichlet energy on the noise intensity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.bin b/research/fog-of-knowledge/data/evidence/raw/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.bin
new file mode 100644
index 000000000..74d62d1b2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21093" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21093</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21093</id>
+        <created>2026-09-17</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Ahmed</keyname>
+                        <forenames>Nameer Fawwaz</forenames>
+                </author>
+                <author>
+                    <keyname>Fleming</keyname>
+                        <forenames>Cody</forenames>
+                </author>
+                <author>
+                    <keyname>Shoukry</keyname>
+                        <forenames>Yasser</forenames>
+                </author>
+        </authors>
+        <title>A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As Urban Air Mobility (UAM) systems scale toward high-density operations, managing autonomous Unmanned Aerial Vehicle (UAV) traffic requires control frameworks that are both tractable and safety-critical. This paper presents a principled optimal control-theoretic foundation for routing in multi-destination UAM networks subject to vertiport capacity and flow constraints. We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states. To ensure tractability, we employ a mean-field fluid approximation and derive the underlying system dynamics as a set of coupled ordinary differential equations. A key contribution of this work is the formal proof of the positive invariance of the queue-free state space. We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely. This result allows us to transform a complex, infinite-dimensional continuous-time optimal control problem into a tractable, finite-dimensional algebraic optimization. The resulting framework jointly optimizes for travel time and multi-hop efficiency while ensuring network-wide stability. We validate the approach by characterizing the steady-state flow equilibria and providing sufficient conditions for safe, congestion-free operation in large-scale mobility systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.bin b/research/fog-of-knowledge/data/evidence/raw/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.bin
new file mode 100644
index 000000000..c5fdcd043
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.bin
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.11530" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.11530</identifier>
+        <datestamp>2026-09-11</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.11530</id>
+        <created>2026-09-10</created>
+            <updated>2026-09-11</updated>
+        <authors>
+                <author>
+                    <keyname>Marzulli</keyname>
+                        <forenames>M.</forenames>
+                </author>
+                <author>
+                    <keyname>Angiolelli</keyname>
+                        <forenames>A.</forenames>
+                </author>
+                <author>
+                    <keyname>Mannino</keyname>
+                        <forenames>C.</forenames>
+                </author>
+                <author>
+                    <keyname>Demuru</keyname>
+                        <forenames>M.</forenames>
+                </author>
+                <author>
+                    <keyname>Sorrentino</keyname>
+                        <forenames>P.</forenames>
+                </author>
+                <author>
+                    <keyname>Corsi</keyname>
+                        <forenames>M. -C.</forenames>
+                </author>
+        </authors>
+        <title>pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The analysis of neuronal avalanches offers insights into brain dynamics utilizing the framework of criticality, but the reproducibility and comparability of studies are limited by the use of fragmented, lab-specific scripts. To address this issue, we introduce pyAvalanches, an open-source Python package providing a standardized, end-to-end pipeline for avalanche analysis from electrophysiological recordings (e.g., electroencephalography-EEG). Starting from the detection of neuronal avalanches the package provides their core statistical characterization, including size and duration distributions. Beyond this, the main aim of pyAvalanches is to characterize the spatiotemporal organization of activity propagation during avalanches. To this end, the core innovation of pyAvalanches is the compuation of Avalanche Transition Matrices (ATMs) to map spatiotemporal propagation patterns. Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches. The entire workflow is encapsulated in a modular and scikit-learn compatible architecture. We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations. By providing a user-friendly, tested, and extensible tool, pyAvalanches facilitates reproducible research, enables the development of novel avalanche-based biomarkers, and makes complex avalanche analysis accessible to a broader scientific community. The package is fully documented and distributed via the Python Package Index (PyPI).</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.bin b/research/fog-of-knowledge/data/evidence/raw/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.bin
new file mode 100644
index 000000000..3e6214d70
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T21:11:01Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19515" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19515</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19515</id>
+        <created>2026-10-14</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Bin</forenames>
+                </author>
+                <author>
+                    <keyname>Wan</keyname>
+                        <forenames>Senning</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Decheng</forenames>
+                </author>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Yonglei</forenames>
+                </author>
+                <author>
+                    <keyname>Xue</keyname>
+                        <forenames>Yu</forenames>
+                </author>
+        </authors>
+        <title>Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>12 pages, 10 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this paper, we investigate a wireless communication network supported by multiple uncrewed aerial vehicles (UAVs). To ensure reliable connectivity, UAVs are desired to approach the boundaries of designated no-fly zones (NFZs) without violating them when mobile users (MUs) enter NFZs. To support heterogeneous communication services, MUs are assigned different priority levels based on their individual communication types. Considering the practical constraints arising from user mobility, heterogeneous communication requirements, and NFZs, the objective is to maximize the weighted sum of MU communication rates, where weights correspond to MU priorities. This is achieved by jointly optimizing trajectory planning, UAV transmission power control, and the binary association factor between UAVs and MUs. To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy. Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability. Moreover, it effectively meets diverse communication requirements, satisfies UAV energy constraints, and ensures reliable operation under NFZ constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.bin b/research/fog-of-knowledge/data/evidence/raw/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.bin
new file mode 100644
index 000000000..fcc7336b3
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T13:18:41Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.21653" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.21653</identifier>
+        <datestamp>2026-10-16</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.21653</id>
+        <created>2026-10-15</created>
+            <updated>2026-10-16</updated>
+        <authors>
+                <author>
+                    <keyname>Jing</keyname>
+                        <forenames>Zexuan</forenames>
+                </author>
+                <author>
+                    <keyname>Xiong</keyname>
+                        <forenames>Yifeng</forenames>
+                </author>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Fan</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Xuehua</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jianhua</forenames>
+                </author>
+        </authors>
+        <title>How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?</title>
+            <categories>cs.IT eess.SP math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Probabilistic constellation shaping (PCS), originally designed to fill the gap between finite uniform constellations and continuous capacity-achieving input distributions, has recently emerged as a central tool in adjusting the expected integrated sidelobe level (EISL) in integrated sensing and communication (ISAC). In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control. We further show that OFDM is almost the only unitary modulation basis whose codeword-wise ISLR can be precisely controlled by type-based PCS. Based upon the analytical results, practical type-based PCS methods compatible with the probabilistic amplitude shaping (PAS) framework are conceived, which achieve higher communication rates than existing ISAC-oriented PCS methods under identical ISLR constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.bin b/research/fog-of-knowledge/data/evidence/raw/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.bin
new file mode 100644
index 000000000..ee56a321c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.bin
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.14144" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.14144</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.14144</id>
+        <created>2026-07-31</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Wenhui</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Jianlin</forenames>
+                </author>
+                <author>
+                    <keyname>Lin</keyname>
+                        <forenames>Ziyao</forenames>
+                </author>
+                <author>
+                    <keyname>Vong</keyname>
+                        <forenames>Chi Man</forenames>
+                </author>
+        </authors>
+        <title>The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale</title>
+            <categories>cs.AI cs.IT math.IT</categories>
+            <comments>43 pages, 16 figures. v2: title now names the hypothesis (CCH); postscript on two post-registration frontier releases (Kimi-K3, Qwen3.8-Max) with a registered forward prediction; new citations and consistency fixes. Registered census statistics and experimental results unchanged. Code and data: https://github.com/wenhui-ml/Capability-Convergence-Hypothesis (DOI: 10.5281/zenodo.21714418)</comments>
+            <acm-class>None</acm-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The Platonic Representation Hypothesis (PRH) holds that as models scale, representations of heterogeneous networks converge toward a shared model of reality. We propose its sequel and boundary, the Capability Convergence Hypothesis (CCH): under a fixed per-token inference budget, representational convergence does not entail capability convergence. Capability instead converges toward a class, the access-complete hybrid: any architecture holding both a compressive O(1)-state channel and a scalable verbatim-index channel. We anchor it on a witness task, the Newton&#39;s-apple problem in an infinite stream, and name three resource walls: a Shannon wall barring any o(Nb)-state architecture, a horizon wall barring any fixed window, and a circuit wall barring fixed-depth attention-only composition (conditional on TC0 != NC1). Under an explicit separability assumption a hybrid crosses all three by paying each wall&#39;s price, so capability is strictly super-additive under composition. We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture. We report the first pre-registered small-scale tests under criteria frozen before the data: the predicted scissors gap is measured (exact-retrieval error 0.994 vs. 0.000 once a 64-scalar state gains one global-attention layer), the state-tracking bifurcation lands at the registered boundary, and a conjunction witness shows an irreducibly two-channel solution; one prediction failed with its direction reversed and is reported as such. Representational convergence is given freely by scale; capability convergence must be purchased by access structure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.bin b/research/fog-of-knowledge/data/evidence/raw/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.bin
new file mode 100644
index 000000000..ad9708ee1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.bin
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12037" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12037</identifier>
+        <datestamp>2026-08-13</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12037</id>
+        <created>2026-08-12</created>
+            <updated>2026-08-13</updated>
+        <authors>
+                <author>
+                    <keyname>Figueiredo</keyname>
+                        <forenames>Eduardo</forenames>
+                </author>
+                <author>
+                    <keyname>Mathiesen</keyname>
+                        <forenames>Frederik</forenames>
+                </author>
+                <author>
+                    <keyname>Schumann</keyname>
+                        <forenames>Julian</forenames>
+                </author>
+                <author>
+                    <keyname>Kober</keyname>
+                        <forenames>Jens</forenames>
+                </author>
+                <author>
+                    <keyname>Zgonnikov</keyname>
+                        <forenames>Arkady</forenames>
+                </author>
+                <author>
+                    <keyname>Laurenti</keyname>
+                        <forenames>Luca</forenames>
+                </author>
+        </authors>
+        <title>Clustered Randomized Smoothing for Stochastic Prediction Functions</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Modern stochastic predictors can model rich, multi-modal outcome distributions. However, this expressive power comes with challenges in ensuring robust predictions $-$ a critical requirement in safety-critical domains. Randomized smoothing is a leading technique for improving robustness, particularly against adversarial perturbations. Yet, in stochastic multi-modal regression settings, randomized smoothing often fails due to mode collapse, yielding averaged predictions that do not reflect the underlying distribution. To address this limitation, we propose clustered $α$-smoothing, a framework that (1) partitions noisy samples using an arbitrary clustering algorithm, (2) applies $α$-smoothing locally within each cluster, and (3) combines the resulting predictions into a mixture distribution. By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes. We empirically evaluate our framework on two benchmarks, demonstrating substantial improvements over state-of-the-art methods. In stochastic trajectory prediction on a driving simulator dataset, our approach achieves, on average, a $27\%$ lower Wasserstein distance to the ground-truth distribution compared to $α$-smoothing. In quadrotor control, where modes correspond to distinct feasible paths to a target, our method reduces the collision rate by $81\%$ relative to the state-of-the-art randomized smoothing.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.bin b/research/fog-of-knowledge/data/evidence/raw/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.bin
new file mode 100644
index 000000000..918e3ac11
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.bin
@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.05763" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.05763</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.05763</id>
+        <created>2026-09-21</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Ganal</keyname>
+                        <forenames>Helen</forenames>
+                </author>
+                <author>
+                    <keyname>Becker</keyname>
+                        <forenames>Sarah</forenames>
+                </author>
+                <author>
+                    <keyname>Holzhauer</keyname>
+                        <forenames>Sascha</forenames>
+                </author>
+                <author>
+                    <keyname>Glißmann</keyname>
+                        <forenames>Thilo</forenames>
+                </author>
+                <author>
+                    <keyname>Krebs</keyname>
+                        <forenames>Friedrich</forenames>
+                </author>
+                <author>
+                    <keyname>Braun</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Härtel</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+        </authors>
+        <title>AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Submitted to Applied Energy</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Decarbonising the building sector is central to meeting climate targets, yet existing models rarely capture the interaction between system-level transformation dynamics and heterogeneous individual investment decisions. This work presents AgentHomeID, an agent-based model of building stock evolution in which owner behaviour, techno-economic constraints, and regulatory frameworks are represented explicitly at the level of individual buildings and their owners. The model differentiates owner-occupiers, private landlords, and institutional owners, using willingness-to-pay (WTP) parameters estimated from empirical decision-maker studies, and operates on both representative building archetypes and real building data derived from geographic information systems (GIS). We demonstrate this versatility across three applications. At national scale, scenario analysis for Germany to 2045 shows that removing binding renewable heating requirements substantially raises final energy demand even where envelope refurbishment is unchanged, and that subsidy allocation and investment activity diverge sharply across owner types and income quartiles, with the lowest quartiles persistently underinvesting. At regional scale, bottom-up simulation for a German distribution grid planning region yields spatially concentrated heat pump uptake at NUTS-3 level that differs from aggregated top-down projections in both magnitude and spatial distribution. At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks. Across all three scales, owner heterogeneity and local structure materially shape transition pathways, indicating that they should be represented explicitly in models used for policy assessment and infrastructure planning.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.bin b/research/fog-of-knowledge/data/evidence/raw/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.bin
new file mode 100644
index 000000000..a48895ca2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.bin
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.35246" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.35246</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.35246</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>M. Furqan</forenames>
+                </author>
+                <author>
+                    <keyname>Vanin</keyname>
+                        <forenames>Marta</forenames>
+                </author>
+                <author>
+                    <keyname>Hermans</keyname>
+                        <forenames>Chris</forenames>
+                </author>
+                <author>
+                    <keyname>Deconinck</keyname>
+                        <forenames>Geert</forenames>
+                </author>
+        </authors>
+        <title>Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Preprint. Submitted to Sustainable Energy, Grids and Networks</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Robust and accurate state estimation is fundamental for the reliable operation and monitoring of active distribution networks. Conventional numerical estimators, such as weighted least squares, are computationally slower and often suffer from convergence issues in the presence of sparse measurements affected by non-Gaussian noise. Physics-informed neural networks have recently emerged as a promising alternative by incorporating physical principles through residual-based penalty terms in the objective, which can improve robustness to noise and computational efficiency. However, such penalty-based approaches do not guarantee strict enforcement of physical constraints during inference and provide limited support for principled uncertainty modeling. To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph. The proposed approach explicitly models non-Gaussian (pseudo-)measurement uncertainty through flexible, closed-form likelihood-based loss functions. It further incorporates a differentiable optimization-based estimation layer that strictly enforces nonlinear equality constraints and measurement consistency, producing physically feasible state estimates during both training and inference. To the best of our knowledge, this is the first PINN-based DSSE framework to combine hard physical constraints with non-Gaussian uncertainty modeling for unbalanced three-phase networks. Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.bin b/research/fog-of-knowledge/data/evidence/raw/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.bin
new file mode 100644
index 000000000..6b4f87e66
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.11929" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.11929</identifier>
+        <datestamp>2026-08-13</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.11929</id>
+        <created>2026-08-12</created>
+            <updated>2026-08-13</updated>
+        <authors>
+                <author>
+                    <keyname>Salehi</keyname>
+                        <forenames>Amin</forenames>
+                </author>
+                <author>
+                    <keyname>Seppanen</keyname>
+                        <forenames>Janne</forenames>
+                </author>
+                <author>
+                    <keyname>Pourakbari-Kasmaei</keyname>
+                        <forenames>Mahdi</forenames>
+                </author>
+        </authors>
+        <title>Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs). This becomes particularly of higher importance under transient disturbances. However, coordinated dynamic interactions of these coupled subsystems remain largely unexplored. This article addresses such gap by developing a dynamic model for an integrated electrolyzer-EDCS system and designing appropriate PID control schemes to address the potential disturbances affecting either component. To this end, linearized models of the electrolyzer and EDCS are first derived to enable systematic controller design. Then, two PID controllers, representing conservative and fast-tracking designs, are developed to coordinate the system response. The developed coordinated model is examined and verified under four different cases. The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer. Controlling the electrolyzer flow in response to EDCS disturbances coordinates system dynamics and mitigates undesirable transient fluctuations. Conversely, under electrolyzer disturbances, regulating the EDCS torque eliminates inconsistent responses in pressure, flow, and rotational speed, while preventing hazardous transient undershoots and overshoots. Overall, the proposed framework guarantees transient stability and operational reliability of the integrated electrolyzer-EDCS system.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.bin b/research/fog-of-knowledge/data/evidence/raw/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.bin
new file mode 100644
index 000000000..5aee1a194
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.bin
@@ -0,0 +1,49 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T03:31:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.11175" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.11175</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.11175</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Kelkar</keyname>
+                        <forenames>Sachin Sunil</forenames>
+                </author>
+                <author>
+                    <keyname>Dokania</keyname>
+                        <forenames>Tanmay</forenames>
+                </author>
+                <author>
+                    <keyname>Nakka</keyname>
+                        <forenames>Yashwanth Kumar</forenames>
+                </author>
+        </authors>
+        <title>Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>3 pages, 4 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>For autonomous space exploration, robotic agents need to perform motion planning in which environmental interactions may be unknown. Learning these interactions, such as terrain mechanics for wheeled robots, can introduce uncertainties that lead to risky motion plans and potentially hazardous operations or mission failures. Moreover, uncertainties induced by perception-based systems can exacerbate the problem of safe motion planning. In this letter, we address the problem of performing cost-optimal kinodynamic motion planning with risk awareness. We approach this in two steps. First, a sampling-based planner (AO-RRT) generates a dynamically feasible, risk-aware, and asymptotically cost-optimal trajectory. Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution. By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\sim$97\% across trajectories in simulation and hardware experiments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.bin b/research/fog-of-knowledge/data/evidence/raw/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.bin
new file mode 100644
index 000000000..c24b024de
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.bin
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.05481" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.05481</identifier>
+        <datestamp>2026-08-07</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.05481</id>
+        <created>2026-08-06</created>
+            <updated>2026-08-07</updated>
+        <authors>
+                <author>
+                    <keyname>Smith</keyname>
+                        <forenames>Andrew L.</forenames>
+                </author>
+                <author>
+                    <keyname>Jiang</keyname>
+                        <forenames>Linxing Preston</forenames>
+                </author>
+                <author>
+                    <keyname>Eshraghian</keyname>
+                        <forenames>Jason K.</forenames>
+                </author>
+                <author>
+                    <keyname>Bull</keyname>
+                        <forenames>Matthew S.</forenames>
+                </author>
+                <author>
+                    <keyname>Recanatesi</keyname>
+                        <forenames>Stefano</forenames>
+                </author>
+        </authors>
+        <title>From Local Learning to Global Prediction Through Layered Surprise Cascades</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hierarchical predictive coding proposes a compelling hypothesis of brain computation, suggesting that the cortex builds layered predictions to minimize surprise. Yet most models rely on error-coding neurons or generative modeling of unclear biological plausibility. Here, we examine a biologically plausible framework in which the functional goals of predictive coding emerge from local contrastive learning and simple activity cancellation. Building on recent machine learning advances, we present a recurrent variant of the Forward-Forward (FF) algorithm with an inverted objective that increases activity for negative data. This setup yields predictive representations across layers, capturing hallmark features of cortical computation such as top-down modulation and surprise signaling. Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.bin b/research/fog-of-knowledge/data/evidence/raw/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.bin
new file mode 100644
index 000000000..3eea78a9d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.bin
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-13T09:41:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12038" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12038</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12038</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Jayakumar</keyname>
+                        <forenames>Surya</forenames>
+                </author>
+                <author>
+                    <keyname>Narayanan</keyname>
+                        <forenames>Arun</forenames>
+                </author>
+                <author>
+                    <keyname>Dey</keyname>
+                        <forenames>Indrakshi</forenames>
+                </author>
+        </authors>
+        <title>Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks</title>
+            <categories>eess.SP</categories>
+            <comments>6 pages</comments>
+            <msc-class>94A12, 94A08</msc-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Access control in Internet of Things (IoT) sensor networks usually acts above the physical layer: the fusion centre decides which reports to accept, while the radio of a compromised node keeps occupying the shared channel. This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time. We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level. The locally optimum detector of out-of-subtree transmission in impulsive Class-A noise weights each leaf in proportion to this predicted leakage. We bound the time needed to confine a compromised node and derive the optimal tree depth. In simulation, with demoted nodes radiating within their allocation, the scheme lowers the probability of a false global decision by 68% relative to fixed-allocation WPDM and to OFDM with the same reputation tiers, and by 44% relative to cryptographic re-attestation, which leads once more than 24% of the sensors are compromised.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.bin b/research/fog-of-knowledge/data/evidence/raw/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.bin
new file mode 100644
index 000000000..84199852e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.bin
@@ -0,0 +1,61 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.24423" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.24423</identifier>
+        <datestamp>2026-07-28</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.24423</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-28</updated>
+        <authors>
+                <author>
+                    <keyname>Van Liedekerke</keyname>
+                        <forenames>Ambra</forenames>
+                </author>
+                <author>
+                    <keyname>Zapparoli</keyname>
+                        <forenames>Lorenzo</forenames>
+                </author>
+                <author>
+                    <keyname>Herrera</keyname>
+                        <forenames>María Parajeles</forenames>
+                </author>
+                <author>
+                    <keyname>Gjorgiev</keyname>
+                        <forenames>Blazhe</forenames>
+                </author>
+                <author>
+                    <keyname>Hug</keyname>
+                        <forenames>Gabriela</forenames>
+                </author>
+                <author>
+                    <keyname>Sansavini</keyname>
+                        <forenames>Giovanni</forenames>
+                </author>
+        </authors>
+        <title>Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels</title>
+            <categories>eess.SY cs.SY physics.soc-ph</categories>
+            <comments>16 pages, 8 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems. Research on EV charging flexibility in future power systems has largely focused on either the transmission or the distribution level, with limited integration between the two. However, these two scales cannot be separated: EV charging optimized at the national transmission level for system-wide planning is ultimately activated in local distribution grids, where it may cause voltage and loading issues. This study bridges that gap by evaluating EV charging flexibility across both grid levels, using two different control approaches. First, a top-down approach disaggregates the optimal charging demand obtained from a centralized planner at the transmission grid down to the distribution grid, explicitly accounting for grid constraints and individual driving requirements. Second, a bottom-up approach optimizes EV charging locally under distribution-grid constraints using electricity price signals from the centralized planning model. Controlled charging from the top-down and bottom-up approaches is then compared with uncontrolled charging. Results show that the top-down approach produces EV charging schedules that are compatible with individual driving behavior and reduce grid violations compared to uncontrolled charging. The bottom-up approach identifies an optimal profile similar to the centrally optimized profile, showing that electricity price signals are a suitable coordination mechanism. These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.bin b/research/fog-of-knowledge/data/evidence/raw/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.bin
new file mode 100644
index 000000000..ce4875eeb
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.bin
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.08218" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.08218</identifier>
+        <datestamp>2026-09-10</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.08218</id>
+        <created>2026-09-09</created>
+            <updated>2026-09-10</updated>
+        <authors>
+                <author>
+                    <keyname>Bahavarnia</keyname>
+                        <forenames>MirSaleh</forenames>
+                </author>
+                <author>
+                    <keyname>Taha</keyname>
+                        <forenames>Ahmad F.</forenames>
+                </author>
+        </authors>
+        <title>Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper explores stabilizing traffic flow using a minimum number of autonomous vehicles (AVs) under control constraints. In contrast to most studies, we consider a heterogeneous parameter setup scenario for human-driven vehicles (HVs) to reflect real-world differences in driving behavior. While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow. To reduce such conservativeness and obtain a less conservative lower bound, we ensure the string stability of traffic flow by directly imposing the possession of no growing eigenmodes. We also systematically find a minimum number of required AVs and solve for the optimal control parameters via nonlinear optimization. We finally assess the intended conservativeness reduction via numerical simulations. Quantitatively, applying our algorithm to the homogeneous HV baseline in the literature (the result built upon an H-Infinity based sufficient condition) reduces (improves) the AV penetration rate by 17.14% while ensuring the string stability of traffic flow. We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs. Quantitatively, our last numerical simulation corroborates that the AV penetration rate can be reduced by 61.54% at the expense of 27.66% higher position difference deviation from the equilibrium and a 92.47% degradation in the real stability radius (RSR)---a metric to measure the stability robustness under the perturbation/uncertainty---associated with the aggregated linearized dynamics while ensuring the string stability of traffic flow. This trade-off helps engineers/operators make better traffic control decisions.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.bin b/research/fog-of-knowledge/data/evidence/raw/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.bin
new file mode 100644
index 000000000..33560b55e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.bin
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:42Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.05749" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.05749</identifier>
+        <datestamp>2026-09-15</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:ET</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.05749</id>
+        <created>2026-09-13</created>
+            <updated>2026-09-15</updated>
+        <authors>
+                <author>
+                    <keyname>Barkett</keyname>
+                        <forenames>Emilio</forenames>
+                </author>
+                <author>
+                    <keyname>Kimpton</keyname>
+                        <forenames>Alexander</forenames>
+                </author>
+                <author>
+                    <keyname>Graham</keyname>
+                        <forenames>Daniel</forenames>
+                </author>
+                <author>
+                    <keyname>Kundgol</keyname>
+                        <forenames>Yusuf</forenames>
+                </author>
+        </authors>
+        <title>The Normalization of Deviance in AI Development</title>
+            <categories>cs.AI cs.ET cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values. Far less attention has been paid to the organizational level---to whether the institutions building these systems are themselves predisposed to drift toward failure. This paper argues that they are. Regardless of how capable AI systems become, the organizations building them face the same structural dynamics that preceded past major technological disasters. Drawing on case studies of the Space Shuttle Challenger, the Three Mile Island accident, and the Boeing 737 MAX crashes, this paper identifies the common structural mechanisms preceding each failure and maps them onto contemporary AI development. The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes. The pre-disaster period of AI development is still underway; the purpose of this paper is to make these dynamics legible while they can still be interrupted.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.bin b/research/fog-of-knowledge/data/evidence/raw/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.bin
new file mode 100644
index 000000000..c5b616616
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21270" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21270</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21270</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Malik</keyname>
+                        <forenames>Vikrant</forenames>
+                </author>
+                <author>
+                    <keyname>Kostina</keyname>
+                        <forenames>Victoria</forenames>
+                </author>
+                <author>
+                    <keyname>Hassibi</keyname>
+                        <forenames>Babak</forenames>
+                </author>
+        </authors>
+        <title>Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider the problem of H-infinity control in the presence of a digital communication channel between the observer and the controller and investigate the fundamental trade-off between the required communication data rate and H-infinity performance. The system follows linear dynamics and has no additive internal noise, so that the uncertainty is confined to the initial state. For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice. We further develop an achievability scheme and show that, for the scalar system, its rate matches the converse asymptotically in the high-data-rate limit.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.bin b/research/fog-of-knowledge/data/evidence/raw/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.bin
new file mode 100644
index 000000000..0672d7774
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.24360" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.24360</identifier>
+        <datestamp>2026-07-28</datestamp>
+            <setSpec>cs:cs:SI</setSpec>
+            <setSpec>cs:cs:HC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.24360</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-28</updated>
+        <authors>
+                <author>
+                    <keyname>Krishna</keyname>
+                        <forenames>Vaibhav</forenames>
+                </author>
+                <author>
+                    <keyname>Shirado</keyname>
+                        <forenames>Hirokazu</forenames>
+                </author>
+                <author>
+                    <keyname>Fu</keyname>
+                        <forenames>Feng</forenames>
+                </author>
+                <author>
+                    <keyname>Christakis</keyname>
+                        <forenames>Nicholas A.</forenames>
+                </author>
+        </authors>
+        <title>Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases</title>
+            <categories>cs.SI cs.HC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Advanced digital communication has revolutionized how people create and consume information, making information diffusion an important topic of research for domains from public health to national security. Real-world scenarios of information diffusion often involve competing narratives - true and false - spreading simultaneously. We propose a novel agent-based co-diffusion model, grounded in &#34;complex-contagion&#34; and &#34;spiral of silence&#34; theories, to capture how network dynamics exploit cognitive biases to shape such interactions. Our findings reveal that manipulative narratives dominate when early spreaders hold them. These network dynamics further exploit inherent cognitive biases to amplify information diffusion regardless of veracity. Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly. However, we found that early seeding of agents with lower self-censorship not only constrains the spread of manipulation but can also lead to dominance of well-informed populance. This has implications for policies that aim to facilitate healthier discourse, strengthen social cohesion, and ensure equitable access to reliable information.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.bin b/research/fog-of-knowledge/data/evidence/raw/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.bin
new file mode 100644
index 000000000..dc31b15e8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.bin
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.39776" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.39776</identifier>
+        <datestamp>2026-10-01</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.39776</id>
+        <created>2026-09-30</created>
+            <updated>2026-10-01</updated>
+        <authors>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jiarui</forenames>
+                </author>
+                <author>
+                    <keyname>Feng</keyname>
+                        <forenames>Wei</forenames>
+                </author>
+                <author>
+                    <keyname>Dong</keyname>
+                        <forenames>Chao</forenames>
+                </author>
+                <author>
+                    <keyname>Ge</keyname>
+                        <forenames>Ning</forenames>
+                </author>
+                <author>
+                    <keyname>Wu</keyname>
+                        <forenames>Qihui</forenames>
+                </author>
+        </authors>
+        <title>Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms</title>
+            <categories>cs.IT cs.SY eess.SY math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>With the rapid development of the low-altitude economy, low-altitude operations are booming, where complex missions require collaborative efforts among multiple heterogeneous low-altitude aircrafts (LAAs). Specifically, different LAAs assume distinct roles: some for sensing, some for communication, some for computing, and others for mission execution, together forming a sensing-communication-computing-control (SC3) closed loop, akin to a reflex arc. To enable efficient coordination in such multi-LAA swarms, we introduce the concept of operational-capability entropy (OCE) to quantify the effective work capability of operational LAAs. Accordingly, by jointly considering heterogeneous OCE and channel conditions among LAAs, we formulate the power allocation problem with the goal of minimizing the linear quadratic regulator (LQR) cost, which serves as a metric for mission efficiency. The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each. Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.bin b/research/fog-of-knowledge/data/evidence/raw/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.bin
new file mode 100644
index 000000000..43d31596c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.04227" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.04227</identifier>
+        <datestamp>2026-08-06</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.04227</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-06</updated>
+        <authors>
+                <author>
+                    <keyname>Delogne</keyname>
+                        <forenames>Rémi</forenames>
+                </author>
+                <author>
+                    <keyname>Jacques</keyname>
+                        <forenames>Laurent</forenames>
+                </author>
+        </authors>
+        <title>Random features for Grassmannian kernel approximation with bounded rank-one projections</title>
+            <categories>cs.LG eess.SP</categories>
+            <comments>33 pages, 6 figures, J2C certification</comments>
+            <journal-ref>Transactions on Machine Learning Research, July 2026</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions.
+  We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.bin b/research/fog-of-knowledge/data/evidence/raw/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.bin
new file mode 100644
index 000000000..46fadb44b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21057" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21057</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21057</id>
+        <created>2026-09-17</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Rahimi</keyname>
+                        <forenames>Herlock</forenames>
+                </author>
+                <author>
+                    <keyname>Kalogerias</keyname>
+                        <forenames>Dionysis</forenames>
+                </author>
+        </authors>
+        <title>FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift</title>
+            <categories>cs.LG cs.DC cs.SY eess.SP eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic client participation. Remedies built on classical Federated Averaging (FedAvg) typically presuppose that client participation probabilities are known to the server, which is rarely the case in deployed systems. We first discuss and then characterize the optimization problem that \emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\mathcal{O}(1/\sqrt{T})$ rate for convex and possibly nonsmooth losses. Building on this characterization, we propose \emph{Federated Risk-Averse Averaging} (\textsc{FedeRage}), a risk-averse extension of FedAvg that embeds the \emph{Conditional Value-at-Risk} (CVaR) into the local objective within a natural distributionally robust optimization (DRO) framework. \textsc{FedeRage} implicitly upweights high-loss and infrequently participating clients while adding only a \emph{single scalar per-client}, and admits an $\mathcal{O}(κ/\sqrt{T})$ rate in which the factor $κ$ is the upper bound on the ``price&#34; of risk aversion. In contrast with aggregation-alignment schemes based on optimal transport, which require the availability distribution as an input, \textsc{FedeRage} remains agnostic to it. Several experiments on three heterogeneous benchmarks indicate consistent improvements over state-of-the-art methods in accuracy, fairness, and convergence speed.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.bin b/research/fog-of-knowledge/data/evidence/raw/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.bin
new file mode 100644
index 000000000..91aceb42c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:35Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16899" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16899</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16899</id>
+        <created>2026-09-15</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Fernandez-Zapico</keyname>
+                        <forenames>Diego</forenames>
+                </author>
+                <author>
+                    <keyname>Vehlhaber</keyname>
+                        <forenames>Finn</forenames>
+                </author>
+                <author>
+                    <keyname>Izadi</keyname>
+                        <forenames>Maedeh</forenames>
+                </author>
+                <author>
+                    <keyname>Hofman</keyname>
+                        <forenames>Theo</forenames>
+                </author>
+                <author>
+                    <keyname>Salazar</keyname>
+                        <forenames>Mauro</forenames>
+                </author>
+        </authors>
+        <title>Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.bin b/research/fog-of-knowledge/data/evidence/raw/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.bin
new file mode 100644
index 000000000..8361b7ef7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.bin
@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.23972" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.23972</identifier>
+        <datestamp>2026-08-26</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.23972</id>
+        <created>2026-08-25</created>
+            <updated>2026-08-26</updated>
+        <authors>
+                <author>
+                    <keyname>Zhao</keyname>
+                        <forenames>Yiqi</forenames>
+                </author>
+                <author>
+                    <keyname>Kim</keyname>
+                        <forenames>Taekyung</forenames>
+                </author>
+                <author>
+                    <keyname>Okamoto</keyname>
+                        <forenames>Hideki</forenames>
+                </author>
+                <author>
+                    <keyname>Hoxha</keyname>
+                        <forenames>Bardh</forenames>
+                </author>
+                <author>
+                    <keyname>Deshmukh</keyname>
+                        <forenames>Jyotirmoy V.</forenames>
+                </author>
+                <author>
+                    <keyname>Lindemann</keyname>
+                        <forenames>Lars</forenames>
+                </author>
+                <author>
+                    <keyname>Fainekos</keyname>
+                        <forenames>Georgios</forenames>
+                </author>
+        </authors>
+        <title>Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL). Our approach encodes discrete-time STL formulas into candidate time-varying control barrier functions (CBF), which are integrated into a model predictive path integral (MPPI) controller. Our method inherits the benefits of low computational cost from an efficiently parallelizable sampling based planner and utilizes CBF for constraints expressed in STL. We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency. We show a quadcopter planning experiment with NVIDIA Isaac Lab.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.bin b/research/fog-of-knowledge/data/evidence/raw/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.bin
new file mode 100644
index 000000000..6491d05e8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.bin
@@ -0,0 +1,39 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:47Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12393" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12393</identifier>
+        <datestamp>2026-08-14</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12393</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-14</updated>
+        <authors>
+                <author>
+                    <keyname>Conway-Smith</keyname>
+                        <forenames>Brendan</forenames>
+                </author>
+        </authors>
+        <title>Metacognitive Skill Learning: A Computational Account</title>
+            <categories>q-bio.NC</categories>
+            <comments>PhD thesis. Carleton University 2026. Final defended version. https://www.brendanconwaysmith.com/</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This dissertation presents the first formal theory of metacognitive skill learning. Metacognition, the capacity to monitor and control one&#39;s own cognitive processes, has been widely studied, yet the field still lacks a theoretical framework explaining how metacognitive abilities are learned. This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence. The account developed here builds on classic models of skill acquisition from perceptual-motor and cognitive domains. It proposes that metacognitive skill develops primarily through proceduralization, whereby explicit, effortful metacognitive processes are transformed through practice into implicit, automatic routines. The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness. The result is an integrated, mechanistic account of metacognitive skill that organizes existing findings, generates testable predictions, informs the design of AI, and supports the strengthening of metacognitive skill in everyday life.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.bin b/research/fog-of-knowledge/data/evidence/raw/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.bin
new file mode 100644
index 000000000..cc28a7d9a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12486" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12486</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12486</id>
+        <created>2026-09-11</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Velicheti</keyname>
+                        <forenames>Raj Kiriti</forenames>
+                </author>
+                <author>
+                    <keyname>Bose</keyname>
+                        <forenames>Subhonmesh</forenames>
+                </author>
+                <author>
+                    <keyname>Başar</keyname>
+                        <forenames>Tamer</forenames>
+                </author>
+        </authors>
+        <title>Adaptive Agent Design</title>
+            <categories>eess.SY cs.AI cs.GT cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider an agent acting against a general non-Markovian environment. The agent maintains its agent states, but is free to choose a transition kernel across those states and optimize its state-feedback control policies. We study the bi-level agent design problem that optimizes the transition kernel and the policy it induces, given said kernel with offline data of observations and actions obtained via a behavioral policy. For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one. In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.bin b/research/fog-of-knowledge/data/evidence/raw/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.bin
new file mode 100644
index 000000000..47ff27990
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.08151" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.08151</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.08151</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Rommel</keyname>
+                        <forenames>Quentin</forenames>
+                </author>
+                <author>
+                    <keyname>Fotiadis</keyname>
+                        <forenames>Filippos</forenames>
+                </author>
+                <author>
+                    <keyname>Armstrong</keyname>
+                        <forenames>Cade</forenames>
+                </author>
+                <author>
+                    <keyname>Peterson</keyname>
+                        <forenames>Luke</forenames>
+                </author>
+                <author>
+                    <keyname>Topcu</keyname>
+                        <forenames>Ufuk</forenames>
+                </author>
+        </authors>
+        <title>Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Initial submission to JCGD</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Cislunar spacecraft operate in nonlinear and unstable environments that make defensive maneuver planning difficult. We formulate cislunar spacecraft pursuit and evasion as a zero-sum differential game in the circular restricted three-body problem. Each spacecraft controls its thrust and reference orbit phase, enabling motion along periodic orbits and across quasi-periodic tori while remaining near the reference. We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints. We propose a shared time regularization to synchronize both spacecraft while refining the discretization near close lunar passages. Numerical results on periodic and quasi-periodic orbits show that phase control improves maneuvering flexibility while limiting departure from the reference orbit. The discrete-time method also provides a large computational advantage over a continuous-time formulation. Comparisons between quasi-halo and quasi-near-rectilinear halo orbits show that close lunar passages create larger escape opportunities but also increase the sensitivity of the encounter. These results show that reference orbit geometry is an important part of defensive cislunar mission design.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.bin b/research/fog-of-knowledge/data/evidence/raw/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.bin
new file mode 100644
index 000000000..4217cf83e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:00Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.03967" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.03967</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.03967</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Raykov</keyname>
+                        <forenames>Yordan</forenames>
+                </author>
+                <author>
+                    <keyname>Veiga</keyname>
+                        <forenames>Rodrigo</forenames>
+                </author>
+        </authors>
+        <title>Information-Geometric Forward Policy Training in GFlowNets</title>
+            <categories>stat.ML cs.LG</categories>
+            <comments>13 pages + appendix</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward. In this work, we formulate forward-policy training in GFlowNets through the information geometry of the induced trajectory sampler. Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable. We derive an exact decomposition of the trajectory Fisher into per-step conditional second moments, which clarifies when temporal score interactions vanish and when dense couplings remain under shared parameterisation. This leads to three computational regimes: settings with tractable exact Fisher information, settings where Monte Carlo estimators of the expected Fisher are sufficient, and structure-exploitable settings in which target locality or factorisation yields accurate approximations of the Fisher expectation. In the latter case, graphical-model tools such as exact marginalisation, separator methods, and belief propagation provide principled surrogates for natural-gradient updates. The resulting framework turns target structure into optimisation geometry and yields a tractable route to structure-aware forward-policy training in GFlowNets. We illustrate the framework empirically through examples comparing convergence and exploration behaviour under Riemannian and Euclidean optimisation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.bin b/research/fog-of-knowledge/data/evidence/raw/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.bin
new file mode 100644
index 000000000..d3e87ef0f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.bin
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T16:53:48Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12592" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12592</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12592</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>de Oliveira</keyname>
+                        <forenames>Daniel V. C.</forenames>
+                </author>
+                <author>
+                    <keyname>Alcantara</keyname>
+                        <forenames>Daniel C.</forenames>
+                </author>
+                <author>
+                    <keyname>Asim</keyname>
+                        <forenames>Fazal. E</forenames>
+                </author>
+                <author>
+                    <keyname>de Almeida</keyname>
+                        <forenames>Andre L. F.</forenames>
+                </author>
+                <author>
+                    <keyname>Fodor</keyname>
+                        <forenames>Gabor</forenames>
+                </author>
+        </authors>
+        <title>Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>This paper introduces an enhanced channel estimation method for reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) communications. Considering the presence of both the direct link from the base station (BS) to the user equipment (UE) and the indirect link \textit{via} the RIS, we formulate a tensor-based receiver for joint direct and indirect channel estimation called the TenDICE algorithm. The proposed receiver relies on an extended parallel factor analysis (PARAFAC) tensor model for the received pilot signals, from which the involved (direct and indirect link) channels are estimated using a simple alternating least squares scheme. The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE). The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.bin b/research/fog-of-knowledge/data/evidence/raw/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.bin
new file mode 100644
index 000000000..1a86921fe
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04630" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04630</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04630</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Sevim</keyname>
+                        <forenames>Nurullah</forenames>
+                </author>
+                <author>
+                    <keyname>Ibrahim</keyname>
+                        <forenames>Mostafa</forenames>
+                </author>
+                <author>
+                    <keyname>Ekin</keyname>
+                        <forenames>Sabit</forenames>
+                </author>
+                <author>
+                    <keyname>Rappaport</keyname>
+                        <forenames>Theodore S.</forenames>
+                </author>
+        </authors>
+        <title>Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems</title>
+            <categories>eess.SP</categories>
+            <comments>Submitted to IEEE Transactions on Green Communications and Networking for review</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The escalating energy demands of modern wireless networks make energy-efficient system design a central challenge for future 6G deployments. Relay-assisted communication has long been recognized as a powerful tool for improving coverage and throughput, tracing its roots to early repeater communication systems and the foundational relay channel models in information theory. Meanwhile, modern relay selection and routing strategies are primarily driven by rate-based or transmit-power-centric metrics, which often neglect hardware-level losses that is independent of the transmitted signal. As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions. To address the challenge of modeling signal-independent power consumption in relay-assisted systems, the Waste Factor (WF) framework is adopted: a hardware-aware, unifying metric that explicitly captures signal-independent power losses across cascaded transceivers and wireless channels. Using WF, the energy consumption of multi-user, multi-relay wireless systems is quantified and minimized under practical hardware and network constraints. The formulation jointly accounts for component inefficiencies, propagation losses, and relay-selection constraints. The proposed framework demonstrates that the WF formulation provides a fundamentally new way to model relay-assisted communication, enabling hardware-aware energy-per-bit minimization and a structured representation that enables computationally efficient analysis. Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.bin b/research/fog-of-knowledge/data/evidence/raw/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.bin
new file mode 100644
index 000000000..40fb8bba5
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.bin
@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04697" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04697</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04697</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Qian</keyname>
+                        <forenames>William</forenames>
+                </author>
+                <author>
+                    <keyname>Pehlevan</keyname>
+                        <forenames>Cengiz</forenames>
+                </author>
+        </authors>
+        <title>Efficiency and robustness partition the solution space for memory in recurrent networks</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function. However, these networks are subject to inductive biases that may be misaligned with those of biological circuits, which operate under various efficiency and robustness constraints. Here, using a minimal stimulus recall task, we systematically characterize how the solution space of recurrent neural networks is shaped by the desiderata of weight efficiency, activity efficiency, and robustness to noise. We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification. Moreover, we find that activity efficient solutions exhibit a strong dissociation between high-variance modes of activity and those that causally influence network output. Unlike in static feedforward settings, we demonstrate that noise robustness and activity efficiency are generally in opposition, rather than synergistic. Using these findings, we propose a normative account of misaligned coding phenomena recently identified in premotor cortex.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.bin b/research/fog-of-knowledge/data/evidence/raw/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.bin
new file mode 100644
index 000000000..bd0e56e86
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:35Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.29832" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.29832</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.29832</id>
+        <created>2026-09-24</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Matt</keyname>
+                        <forenames>Justin J.</forenames>
+                </author>
+                <author>
+                    <keyname>Altamirano</keyname>
+                        <forenames>George V.</forenames>
+                </author>
+        </authors>
+        <title>System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs</title>
+            <categories>eess.SY cs.RO cs.SY</categories>
+            <comments>31 pages, 18 figures. Presented at the AIAA AVIATION Forum 2025. Accepted for publication in the AIAA Journal of Aircraft</comments>
+            <journal-ref>AIAA Journal of Aircraft, Article in Advance (2026)</journal-ref>
+            <doi>10.2514/1.C038636</doi>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>A new method for multi-input flight maneuver design for system identification is presented. The method consists of injecting &#34;full-harmonic&#34; orthogonal multisine signals into the flight control system. Orthogonality is achieved by repeating maneuvers with changing multisine polarities. The multisines can contain the same frequency content, which can simplify frequency response estimation and allow for long flight maneuvers to be split into several shorter maneuvers while maintaining the same frequency resolution and minimum frequency. An input allocation scheme is presented that augments the multisines to size the vehicle response amplitude about a specific degree of freedom. The developed approach was demonstrated through flight testing of a small octocopter in near-hover conditions. The input allocation scheme was utilized successfully to increase excitation about the yaw axis. Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately. The models are parameterized primarily by rotor thrust and torque coefficients, making them suitable for analysis of aircraft flight dynamics and individual rotor aerodynamics. The results demonstrate that the near-hover flight dynamics can be modeled accurately by neglecting rotor hub moments, variations in rotor coefficients, gyroscopic moments in roll and pitch, and aerodynamic interaction effects.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.bin b/research/fog-of-knowledge/data/evidence/raw/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.bin
new file mode 100644
index 000000000..7a3bfa3ec
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:18Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02244" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02244</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02244</id>
+        <created>2026-08-03</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Dayi</forenames>
+                </author>
+                <author>
+                    <keyname>Zhou</keyname>
+                        <forenames>Zijie</forenames>
+                </author>
+        </authors>
+        <title>Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling</title>
+            <categories>cs.DC cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies a resource-allocation inefficiency in batched large language model (LLM) serving: heterogeneous requests that share a decode batch impose max-driven computational costs on one another. Because the wall-clock cost of a batch step is largely governed by the largest active KV-cache footprint, a short request co-batched with a long request can experience latency and GPU-resource consumption disproportionate to its own token workload. We formalize this phenomenon as a resource-fair scheduling problem. We develop a mathematical scheduling model that connects within-batch resource fairness to system throughput. The proposed fairness constraint bounds the disparity in decode progress, equivalently KV-cache footprint, among co-batched requests. Based on this model, we design the Insert-Short-Jobs-with-Limit (ISJL) algorithm, a parameterized hybrid batching policy. We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$. We further examine the profit implications of resource-fair scheduling under the token-metered pricing convention used by commercial LLM APIs. Numerical experiments show that ISJL occupies a favorable middle ground between FCFS, which has large batching externalities, and LJF, which is cost-aligned but sacrifices batching flexibility. Thus, ISJL provides a bi-criterion scheduling policy: it maintains high throughput while aligning max-driven batch cost with token-metered revenue.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.bin b/research/fog-of-knowledge/data/evidence/raw/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.bin
new file mode 100644
index 000000000..aa0b19dbb
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.26093" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.26093</identifier>
+        <datestamp>2026-08-27</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.26093</id>
+        <created>2026-08-26</created>
+            <updated>2026-08-27</updated>
+        <authors>
+                <author>
+                    <keyname>Khan</keyname>
+                        <forenames>Ahmad</forenames>
+                </author>
+                <author>
+                    <keyname>Sediq</keyname>
+                        <forenames>Akram Bin</forenames>
+                </author>
+                <author>
+                    <keyname>Naeini</keyname>
+                        <forenames>Sara Azadegi</forenames>
+                </author>
+                <author>
+                    <keyname>Adve</keyname>
+                        <forenames>Raviraj S.</forenames>
+                </author>
+        </authors>
+        <title>Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher&#39;s Role</title>
+            <categories>cs.LG cs.IT cs.SY eess.SY math.IT</categories>
+            <comments>Submitted to IEEE Globecom Workshops</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Designing machine learning algorithms for wireless resource management is labour-intensive: the architecture, the loss function and the training recipe are all specified by hand. We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety. We adopt the autoresearch protocol, in which an AI coding agent edits a training script, runs a fixed-budget experiment, and retains or discards the change according to a single immutable metric. We grant the agent authority over the architecture family, the input representation, the output parameterization, the loss function and the task-sampling law, and set it a target chosen for its difficulty: sum-least-percentile-rate power control across a multicell network. The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex. Safeguards render the results trustworthy: a hash-pinned evaluator, an enforced inference contract and a pre-registered falsifier per experiment. In eighty-one unattended experiments over twenty-six hours, the agent reached $99.5\%$ of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly $600\times$ lower inference cost, closing $94\%$ of the gap from its first working architecture, with one parameter set serving every network size and percentile target. It recovered provable structure rather than tuned constants: the output parameterization it discovered reproduces the exact max-min-optimal allocation at the minimum percentile, for every value of the trained weights.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.bin b/research/fog-of-knowledge/data/evidence/raw/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.bin
new file mode 100644
index 000000000..01b498796
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:28Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.35424" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.35424</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.35424</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Xiaoying</forenames>
+                </author>
+                <author>
+                    <keyname>Huang</keyname>
+                        <forenames>Linbin</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Hangyu</forenames>
+                </author>
+                <author>
+                    <keyname>Xin</keyname>
+                        <forenames>Huanhai</forenames>
+                </author>
+        </authors>
+        <title>Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Small-signal stability analysis of power electronics-dominated power systems is becoming increasingly challenging due to the large-scale integration of heterogeneous grid-following (GFL) and grid-forming (GFM) converters. Classical centralized methods, such as eigenvalue analysis and the generalized Nyquist criterion, provide direct stability assessment tools but exhibit limited scalability as the system size increases. This motivates scalable analysis methods for stability assessment and device-level diagnosis, and calls for less conservative stability conditions. To this end, this paper proposes a scalable small-signal stability assessment method with quantitative stability indices for multi-converter systems based on frequency-domain quadratic constraints (FQCs). It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition. This FQC-based formulation also clarifies the requirements for decentralized verification of these existing stability conditions. To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection. Combined with the mixed gain-phase condition, this optimization problem forms a hierarchical screening-diagnosis procedure that improves efficiency. Case studies demonstrate that the proposed method is less conservative than existing criteria and can effectively identify problematic devices associated with potential instability risks.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.bin b/research/fog-of-knowledge/data/evidence/raw/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.bin
new file mode 100644
index 000000000..14041800a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.31034" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.31034</identifier>
+        <datestamp>2026-09-01</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.31034</id>
+        <created>2026-08-31</created>
+            <updated>2026-09-01</updated>
+        <authors>
+                <author>
+                    <keyname>Guarino</keyname>
+                        <forenames>Idio</forenames>
+                </author>
+                <author>
+                    <keyname>Nascita</keyname>
+                        <forenames>Alfredo</forenames>
+                </author>
+                <author>
+                    <keyname>Ciuonzo</keyname>
+                        <forenames>Domenico</forenames>
+                </author>
+                <author>
+                    <keyname>Carra</keyname>
+                        <forenames>Damiano</forenames>
+                </author>
+                <author>
+                    <keyname>Pescapé</keyname>
+                        <forenames>Antonio</forenames>
+                </author>
+        </authors>
+        <title>XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition</title>
+            <categories>eess.SP</categories>
+            <comments>accepted at 22nd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 26)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Wi-Fi Channel State Information (CSI) has emerged as a key enabler for device-free Human Activity Recognition (HAR), enabling low-cost, unobtrusive sensing using existing communication infrastructure. However, Deep Learning (DL) models trained on CSI data often struggle to generalize across users, environments, and device setups due to the context sensitivity of wireless propagation. Despite this challenge, limited attention has been devoted to understanding model decisions and generalization failures. This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems. XAI2CSI employs SAGE, a model-agnostic explainability method, to quantify temporal, spectral, and spatial CSI contributions to HAR decisions under nominal and cross-context evaluations on IEEE 802.11ax data. Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change. The proposed methodology and findings provide a reference framework to explore alternative solutions and guide the development of robust, transparent Wi-Fi sensing systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.bin b/research/fog-of-knowledge/data/evidence/raw/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.bin
new file mode 100644
index 000000000..ac538f6e0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.bin
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.04133" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.04133</identifier>
+        <datestamp>2026-08-06</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.04133</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-06</updated>
+        <authors>
+                <author>
+                    <keyname>Gkekas</keyname>
+                        <forenames>Angelos</forenames>
+                </author>
+                <author>
+                    <keyname>Papadopoulos</keyname>
+                        <forenames>Alexandros I.</forenames>
+                </author>
+                <author>
+                    <keyname>Pantazopoulos</keyname>
+                        <forenames>Petros Andreas</forenames>
+                </author>
+                <author>
+                    <keyname>Lalas</keyname>
+                        <forenames>Antonios</forenames>
+                </author>
+                <author>
+                    <keyname>Votis</keyname>
+                        <forenames>Konstantinos</forenames>
+                </author>
+                <author>
+                    <keyname>Liaskos</keyname>
+                        <forenames>Christos</forenames>
+                </author>
+        </authors>
+        <title>Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing</title>
+            <categories>cs.IT eess.SP math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.bin b/research/fog-of-knowledge/data/evidence/raw/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.bin
new file mode 100644
index 000000000..0f10dbeea
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:03Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.06163" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.06163</identifier>
+        <datestamp>2026-09-09</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.06163</id>
+        <created>2026-09-05</created>
+            <updated>2026-09-09</updated>
+        <authors>
+                <author>
+                    <keyname>Vu</keyname>
+                        <forenames>Tien Dat</forenames>
+                </author>
+                <author>
+                    <keyname>Doan</keyname>
+                        <forenames>Minh</forenames>
+                </author>
+        </authors>
+        <title>Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>16 pages, 8 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The leader-follower formation control problem is investigated for nonlinear multi-agent systems with unknown dynamics, external disturbances, and false data injection (FDI) attacks on actuator channels. The problem is formulated as a zero-sum differential game and solved using the Integral Bellman-Isaacs approach. To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law. Furthermore, this paper proposes a cost function construction method and develops a critic learning law, which together guarantee the practical fixed-time stability of the system while overcoming the limitations of existing fixed-time reinforcement learning formulations. Finally, the practical fixed-time convergence of both the critic weight estimation error and the leader-referenced formation tracking error to bounded residual sets is rigorously proven. Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.bin b/research/fog-of-knowledge/data/evidence/raw/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.bin
new file mode 100644
index 000000000..ea77328aa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.bin
@@ -0,0 +1,67 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.07289" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.07289</identifier>
+        <datestamp>2026-08-10</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:LO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.07289</id>
+        <created>2026-08-07</created>
+            <updated>2026-08-10</updated>
+        <authors>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Wayne</forenames>
+                </author>
+                <author>
+                    <keyname>Bhatnagar</keyname>
+                        <forenames>Archit</forenames>
+                </author>
+                <author>
+                    <keyname>Miao</keyname>
+                        <forenames>Tongyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Kalamkar</keyname>
+                        <forenames>Saniya</forenames>
+                </author>
+                <author>
+                    <keyname>Cui</keyname>
+                        <forenames>Wenqi</forenames>
+                </author>
+                <author>
+                    <keyname>Incer</keyname>
+                        <forenames>Inigo</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Ang</forenames>
+                </author>
+        </authors>
+        <title>Synthesizing Voltage Ride-Through Controllers for Data Centers</title>
+            <categories>eess.SY cs.DC cs.LO cs.SY</categories>
+            <comments>12 pages, 10 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Data centers are among the power grid&#39;s fastest-growing loads. Since data center servers are sensitive electronic components, they need to be protected against the grid&#39;s voltage disturbances during grid faults. While disconnecting from the grid achieves this, it can further destabilize the power system if many data centers trip at once. To address this emerging concern, voltage ride-through (VRT) grid codes have been proposed to standardize data center behavior. They require a data center to stay connected for a period of time through the disturbance, hold an active power floor, and recover its draw within a deadline upon restoration. However, systematically designing and certifying controllers that satisfy these coupled temporal and operational requirements remains challenging.
+  We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods. We develop a specification language that expresses a grid code in Signal Temporal Logic (STL) as the basis for formal reasoning. Our encoding algorithm takes the specification, along with a model of the data center&#39;s power topology, and translates the constraints into a controller synthesis problem. This step produces a correct-by-construction controller if a solution can be found, or a proof that no such controller exists. For the latter case, SolVRT provides a diagnostic step: it traces the facility&#39;s &#34;conflict frontier,&#34; isolates the conflicting clauses that led to non-compliance, and computes the smallest hardware or workload change that would enable compliance. We evaluate SolVRT through closed-loop simulations of a 200 MW data center connected to a 140-bus transmission system. The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.bin b/research/fog-of-knowledge/data/evidence/raw/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.bin
new file mode 100644
index 000000000..637eca290
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.bin
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.18467" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.18467</identifier>
+        <datestamp>2026-09-17</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.18467</id>
+        <created>2026-09-16</created>
+            <updated>2026-09-17</updated>
+        <authors>
+                <author>
+                    <keyname>Uniyal</keyname>
+                        <forenames>Smriti</forenames>
+                </author>
+                <author>
+                    <keyname>Fang</keyname>
+                        <forenames>Tianyu</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Van-Dinh</forenames>
+                </author>
+                <author>
+                    <keyname>Ngo</keyname>
+                        <forenames>Hien Quoc</forenames>
+                </author>
+                <author>
+                    <keyname>Juntti</keyname>
+                        <forenames>Markku</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Nhan Thanh</forenames>
+                </author>
+        </authors>
+        <title>Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In integrated sensing and communications (ISAC), the same spectral and hardware resources are shared for two functionalities. Most ISAC designs assume perfect target-angle information neglecting angle estimation errors, which introduce steering-vector mismatches, degrade sensing accuracy, and may invalidate deterministic sensing guarantees. This paper investigates monostatic massive multiple-input-multiple-output (MIMO) ISAC systems under imperfect target-angle estimates. We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty. We characterize the cumulative distribution functions and outage probabilities of the CRLBs under Gaussian, generalized uniform, and von Mises angle-error models. Our analysis reveals that, in the small-error regime, the CRLBs increase quadratically with the angle errors due to transmit steering-vector mismatch. To ensure reliable sensing, we propose a robust power allocation framework that jointly optimizes pilot training and communications/sensing transmission powers to maximize the communications sum rate while satisfying CRLB outage constraints. The resulting nonconvex problem is solved using an alternating-optimization algorithm based on successive convex approximation. Numerical results validate the developed analysis and show that the proposed robust design reduces azimuth and elevation CRLB outage probabilities by up to $60\%$ compared with conventional non-robust schemes. It attains up to $45\%$ higher sum rates than the non-robust design under strict CRLB thresholds.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.bin b/research/fog-of-knowledge/data/evidence/raw/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.bin
new file mode 100644
index 000000000..f1d0b0811
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:47Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.19416" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.19416</identifier>
+        <datestamp>2026-08-21</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.19416</id>
+        <created>2026-08-19</created>
+            <updated>2026-08-21</updated>
+        <authors>
+                <author>
+                    <keyname>Mozaffarikhosravi</keyname>
+                        <forenames>Nima</forenames>
+                </author>
+                <author>
+                    <keyname>Azarbahram</keyname>
+                        <forenames>Amirhossein</forenames>
+                </author>
+                <author>
+                    <keyname>Dharmawansa</keyname>
+                        <forenames>Prathapasinghe</forenames>
+                </author>
+                <author>
+                    <keyname>Atzeni</keyname>
+                        <forenames>Italo</forenames>
+                </author>
+        </authors>
+        <title>Robust Near-Field Beam Focusing Under Imperfect Localization</title>
+            <categories>eess.SP</categories>
+            <comments>To be presented at the International Workshop on Smart Antennas (WSA) 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The transition to 6G-and-beyond wireless systems with large-scale antenna arrays and high-frequency deployments significantly extends the near-field region, where channels exhibit a strong dependence on user location. While this enables location-based beam focusing as a low-overhead alternative to conventional channel estimation, its performance is highly sensitive to localization errors. In this paper, we study robust near-field beam focusing under imperfect user localization. We explicitly characterize the impact of localization errors on the line-of-sight-dominated channel by deriving a tractable uncertainty model via a first-order Taylor approximation, which captures the coupled effects of distance and angle in near-field propagation. Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors. The resulting problem is reformulated into a feasibility problem using semidefinite relaxation. Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.bin b/research/fog-of-knowledge/data/evidence/raw/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.bin
new file mode 100644
index 000000000..6989a39e4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-11T12:13:43Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09266" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09266</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09266</id>
+        <created>2026-10-07</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Ncube</keyname>
+                        <forenames>Walter Zibusiso</forenames>
+                </author>
+                <author>
+                    <keyname>Qidan</keyname>
+                        <forenames>Ahmad Adnan</forenames>
+                </author>
+                <author>
+                    <keyname>El-Gorashi</keyname>
+                        <forenames>Taisir</forenames>
+                </author>
+                <author>
+                    <keyname>Elmirghani</keyname>
+                        <forenames>Jaafar M. H.</forenames>
+                </author>
+        </authors>
+        <title>Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Growing wireless traffic is increasing pressure on the congested radio-frequency spectrum. Optical wireless communication (OWC) provides a complementary solution by using the abundant unlicensed optical spectrum. However, indoor OWC networks are dynamic: users move, enter or leave the network, and subscribe to different services. Poorly coordinated resource allocation can consequently waste subcarriers, require excessive transmission power and cause frequent AP reassignments. Energy efficiency (EE), defined as the total delivered data rate divided by the total network power consumption, therefore requires the serving AP, number of allocated subcarriers, and transmission power to be jointly adapted while maintaining QoS. Optimising these in a dynamic time series, multi-service OWC environment produces a complex sequential EE optimisation problem. To address this problem, this work proposes Dual-Agent Resource Allocation using Deep Reinforcement Learning (DARA-DRL). DARA-DRL combines a branching duelling deep Q-network for association and subcarrier allocation with a conditional soft actor-critic agent for continuous power control. The agents are coupled through a common reward and a cooperative value update that evaluates each discrete allocation together with its corresponding power decision. Simulation results show that DARA-DRL remains within 5\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\% and QoS satisfaction by 10.5\%, while reducing online decision time by 14.5\%. Results demonstrate that agent specialisation simplifies mixed-action learning, and cooperation outperforms independently trained agents.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.bin b/research/fog-of-knowledge/data/evidence/raw/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.bin
new file mode 100644
index 000000000..0fa30a543
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.bin
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:15Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.10825" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.10825</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.10825</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Jinwen</forenames>
+                </author>
+                <author>
+                    <keyname>Che</keyname>
+                        <forenames>Yunhong</forenames>
+                </author>
+                <author>
+                    <keyname>Onori</keyname>
+                        <forenames>Simona</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Weihan</forenames>
+                </author>
+                <author>
+                    <keyname>Hu</keyname>
+                        <forenames>Xiaosong</forenames>
+                </author>
+        </authors>
+        <title>Cross-modal topology decodes battery faults from sparse voltage snapshots</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>33 pages, 12 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements. Existing methods struggle to resolve the signal ambiguity between overlapping fault modes without hardware upgrades. Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots. We introduce DeFault, a cross-modal diagnostic framework that mathematically unfolds one-dimensional voltage sequences into multi-dimensional phase-space topologies. DeFault employs a bidirectional cross-attention mechanism that acts as an autonomous, physics-aligned filter, explicitly decoding compounded fault modes that remain fundamentally invisible to sequence-based methods. Validated on a field dataset of 16.4 million data records from 99 in-service EVs, our method achieves an average accuracy of 0.96 and an F1 score of 0.84 for four fault types using only 500-second snapshots (spanning &lt;100 mV). This work proves that high-fidelity, interpretable electrochemical diagnosis is achievable on legacy fleets without new sensors, providing a scalable solution for the battery safety crisis.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.bin b/research/fog-of-knowledge/data/evidence/raw/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.bin
new file mode 100644
index 000000000..28c223179
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.bin
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:10Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02978" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02978</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02978</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Salimi</keyname>
+                        <forenames>Arastoo H</forenames>
+                </author>
+                <author>
+                    <keyname>Nazaripouya</keyname>
+                        <forenames>Hamidreza</forenames>
+                </author>
+        </authors>
+        <title>Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper proposes a new automated decision-making framework to enhance the resilience of electrical systems against wildfires by applying operational strategies that account for decision-dependent uncertainty (DDU). The proposed framework incorporates both preventive and corrective measures, enabling adaptive and automated decision-making throughout the course of evolving wildfire scenarios. First, a baseline multistage optimization model is presented as a foundation to support wildfire-driven operational decision-making. The model then incorporates DDU, wherein Public Safety Power Shutoff (PSPS) decisions made in earlier stages influence the probabilities and parameters of future wildfire scenarios. To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed. The effectiveness of the proposed approach is demonstrated through case studies on the IEEE 30-bus system. Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.bin b/research/fog-of-knowledge/data/evidence/raw/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.bin
new file mode 100644
index 000000000..46e447213
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.bin
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23703" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23703</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:CL</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>q-fin:q-fin:TR</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23703</id>
+        <created>2026-09-20</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Kirtac</keyname>
+                        <forenames>Kemal</forenames>
+                </author>
+        </authors>
+        <title>Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions</title>
+            <categories>cs.CL cs.LG q-fin.TR</categories>
+            <comments>47 pages. Revise and resubmit at Engineering Applications of Artificial Intelligence</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Financial language models can transform unstructured firm-specific news into structured decision signals, but financial AI research lacks an integrated deployment framework for evaluating whether those signals remain useful in financial decision systems. Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference. We introduce MFAST, a Market-Friction-Aware Sentiment-to-Trading framework that converts timestamped financial text into auditable, reproducible, and market-feasible trading decisions. The application is news-based trading, where firm-specific text must be linked to securities before portfolio decisions can be evaluated. The framework links Refinitiv News Analytics to Center for Research in Security Prices (CRSP) equity data, restricts the primary out-of-sample evaluation to post-release news outside disclosed foundation-model data-freshness periods, and adds a public replication arm using open financial text and public price data. Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost. The paper shows that credible evaluation of financial language models requires an end-to-end engineering approach combining language understanding, temporal discipline, market-friction-aware deployment, and reproducible validation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.bin b/research/fog-of-knowledge/data/evidence/raw/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.bin
new file mode 100644
index 000000000..513c4ad0f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.bin
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25847" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25847</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25847</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Ertan</keyname>
+                        <forenames>Sude</forenames>
+                </author>
+                <author>
+                    <keyname>Tokluoglu</keyname>
+                        <forenames>Osman</forenames>
+                </author>
+                <author>
+                    <keyname>Cavus</keyname>
+                        <forenames>Enver</forenames>
+                </author>
+        </authors>
+        <title>Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications</title>
+            <categories>eess.SP</categories>
+            <comments>6 pages, 3 tables, 2 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Classical coherent binary phase-shift keying (BPSK) reception over additive white Gaussian noise (AWGN) channels is analytically well understood, and the optimum hard-decision detector is known. Therefore, the aim of using neural receivers in this study is not to replace the classical AWGN-BPSK detector. Instead, the AWGN-BPSK setting is deliberately selected as a theoretically verifiable benchmark for analyzing how compactly neural receiver architectures can represent a known decision behavior. This paper compares multi-layer perceptron (MLP) and Kolmogorov--Arnold Network (KAN) receivers using a multi-SNR Nyquist-rate BPSK dataset. The models are evaluated using bit error rate (BER), mean squared error (MSE), and trainable parameter count. Beyond reporting accuracy alone, this work emphasizes a common-loss parameter-efficiency perspective: when two receivers reach a comparable practical BER or loss region, the receiver with fewer parameters is more attractive for real-time deployment. The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters. In particular, the KAN receiver with 3281 parameters achieves a test BER of 2.45 x 10^-4, while the MLP baseline with 8513 parameters achieves a test BER of 2.50 x 10^-4. This corresponds to approximately 61.5% fewer trainable parameters at a comparable BER operating point. This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.bin b/research/fog-of-knowledge/data/evidence/raw/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.bin
new file mode 100644
index 000000000..43abab733
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.bin
@@ -0,0 +1,39 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.20723" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.20723</identifier>
+        <datestamp>2026-08-24</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+            <setSpec>cs:cs:SC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.20723</id>
+        <created>2026-08-21</created>
+            <updated>2026-08-24</updated>
+        <authors>
+                <author>
+                    <keyname>Yang</keyname>
+                        <forenames>Tianming</forenames>
+                </author>
+        </authors>
+        <title>Conscious Access as Continuous-to-Discrete Translation</title>
+            <categories>q-bio.NC cs.SC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The scientific study of consciousness frequently stalls on ontological debates regarding the &#34;Hard Problem.&#34; This paper proposes a pragmatic pivot. Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence. We introduce the Continuous/Discrete (C/D) framework, which holds that the brain implements two distinct processing regimes: System C, a distributed sensory-motor network operating over continuous, high-dimensional manifolds, and System D, a centralized engine structured around discrete, scale-invariant symbols. We argue that conscious access requires a structure-preserving translation between these regimes, which maps localized continuous states onto discrete symbolic tokens, coupled with an inverse projection that grounds those tokens back into sensorimotor dynamics. By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes. These predictions explicitly differentiate our account from Global Neuronal Workspace Theory, Integrated Information Theory, Predictive Processing, and Higher-Order Theories, shifting the focus from ontological status to computational mechanism. Beyond neuroscience, the framework provides a principled architecture for neuro-symbolic artificial intelligence. We argue that treating conscious access as translational computation offers a pragmatic, empirically tractable pathway forward, clarifying what conscious states functionally accomplish without requiring resolution of the hard problem of phenomenology.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.bin b/research/fog-of-knowledge/data/evidence/raw/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.bin
new file mode 100644
index 000000000..487d9a1ad
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.06601" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.06601</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.06601</id>
+        <created>2026-10-05</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Lily Y.</forenames>
+                </author>
+                <author>
+                    <keyname>Shah</keyname>
+                        <forenames>Vade</forenames>
+                </author>
+                <author>
+                    <keyname>Walsh</keyname>
+                        <forenames>Dan</forenames>
+                </author>
+                <author>
+                    <keyname>Marden</keyname>
+                        <forenames>Jason R.</forenames>
+                </author>
+        </authors>
+        <title>Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Industrial refrigeration consumes substantial electricity, and compressors are the dominant energy consumers in these systems, making their operation central to improving energy efficiency. Compressors are most efficient when operated at full capacity, but the cooling they provide at full capacity can exceed the facility&#39;s immediate needs. This motivates pre-cooling, where compressors operate at full capacity and the excess cooling is stored as thermal inventory for future heat loads. However, stored cooling is inherently lossy: colder spaces attract additional heat from their surroundings, creating a tradeoff between maximizing compressor efficiency and avoiding cooling that dissipates before it can be used. We study this tradeoff through a retention factor, defined as the fraction of thermal inventory that survives after one minute, with the goals of understanding how retention affects the value of pre-cooling and designing effective control policies that account for this lossiness. We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data. Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.bin b/research/fog-of-knowledge/data/evidence/raw/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.bin
new file mode 100644
index 000000000..5e0b546a8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16258" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16258</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>econ:econ:GN</setSpec>
+            <setSpec>q-fin:q-fin:EC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16258</id>
+        <created>2026-09-14</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Manso</keyname>
+                        <forenames>Gabriel</forenames>
+                </author>
+                <author>
+                    <keyname>Fu</keyname>
+                        <forenames>Emma</forenames>
+                </author>
+                <author>
+                    <keyname>Thompson</keyname>
+                        <forenames>Neil</forenames>
+                </author>
+        </authors>
+        <title>The AI-Enabled Scientific Frontier</title>
+            <categories>cs.AI cs.LG cs.PF econ.GN q-fin.EC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method. But how true are these claims? Does AI outperform all techniques, or only some, and how is this changing? To assess the claims, we assemble a corpus of 2,507 head-to-head comparisons between AI and other scientific analysis techniques across 27 scientific disciplines from papers published between 2000 and early 2025. We find a profound dichotomy. Relative to traditional statistics, AI often outperforms, but at a significantly higher computational cost. But there are also nearly a quarter of cases where AI is both more expensive and performs worse than traditional statistical techniques and this fraction has been stable for a decade. Relative to scientific computing, AI often underperforms, but at lower computational cost. This has begun to change: since 2020, AI&#39;s performance against scientific computing has notably strengthened and it now outperforms on more than half of comparisons. These patterns suggest that AI is therefore not a universal replacement for existing methods, but rather a valuable -- and improving -- part of a new AI-enabled scientific frontier.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.bin b/research/fog-of-knowledge/data/evidence/raw/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.bin
new file mode 100644
index 000000000..33542959f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.bin
@@ -0,0 +1,95 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.14022" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.14022</identifier>
+        <datestamp>2026-09-15</datestamp>
+            <setSpec>cs:cs:NI</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.14022</id>
+        <created>2026-09-12</created>
+            <updated>2026-09-15</updated>
+        <authors>
+                <author>
+                    <keyname>Haigh</keyname>
+                        <forenames>Paul Anthony</forenames>
+                </author>
+                <author>
+                    <keyname>Rajbhandari</keyname>
+                        <forenames>Sujan</forenames>
+                </author>
+                <author>
+                    <keyname>Bottrill</keyname>
+                        <forenames>Kyle</forenames>
+                </author>
+                <author>
+                    <keyname>Trichili</keyname>
+                        <forenames>Abderrahmen</forenames>
+                </author>
+                <author>
+                    <keyname>Watson</keyname>
+                        <forenames>Scott</forenames>
+                </author>
+                <author>
+                    <keyname>Abumarshoud</keyname>
+                        <forenames>Hanaa</forenames>
+                </author>
+                <author>
+                    <keyname>Benton</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Sinanovic</keyname>
+                        <forenames>Sinan</forenames>
+                </author>
+                <author>
+                    <keyname>Herrnsdorf</keyname>
+                        <forenames>Johannes</forenames>
+                </author>
+                <author>
+                    <keyname>Christopher</keyname>
+                        <forenames>Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Khalily</keyname>
+                        <forenames>Mohsen</forenames>
+                </author>
+                <author>
+                    <keyname>Tafazolli</keyname>
+                        <forenames>Rahim</forenames>
+                </author>
+                <author>
+                    <keyname>Haas</keyname>
+                        <forenames>Harad</forenames>
+                </author>
+                <author>
+                    <keyname>Lavery</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Popoola</keyname>
+                        <forenames>Wasiu</forenames>
+                </author>
+        </authors>
+        <title>Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space</title>
+            <categories>cs.NI eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Next-generation connectivity depends on data traversing multiple physical media within a single end-to-end path, yet research in optical fibre, free-space optical and radio wireless, non-terrestrial networks, and underwater communications has advanced largely in isolation. This fragmentation has a wider adverse impact on communication performance, deployment and adaption as the most demanding open problems in next-generation connectivity, cross-medium channel characterisation, transport-layer protocol design across heterogeneous latency regimes, and cross-domain orchestration, sit at the boundaries between domains and can only be addressed by bringing these challenges together in cross-domain systems. Space-air-ground integrated network research has begun to treat three domains analytically, and its recent extension to the sea surface represents the most ambitious multi-domain framework proposed to date, yet neither has produced experimental results, a deployed system, or a standards engagement. The subsurface and maritime domain remains absent from both. This paper proposes the connected heterogeneous all-medium integrated network (CHAIN), a framework that treats the undersea, maritime, terrestrial, aerial and space domains as a single design space. We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge. We survey the state of the art across all domains and the existing cross-domain literature, develop the CHAIN framework and its technical pillars, characterise the five core open problems the field must resolve, and set out a research roadmap from near-term measurement campaigns and testbed validation through cross-medium field trials to global-scale deployment.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.bin b/research/fog-of-knowledge/data/evidence/raw/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.bin
new file mode 100644
index 000000000..49f4cad83
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:49Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12866" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12866</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12866</id>
+        <created>2026-09-11</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Buciulea</keyname>
+                        <forenames>Andrei</forenames>
+                </author>
+                <author>
+                    <keyname>Isufi</keyname>
+                        <forenames>Elvin</forenames>
+                </author>
+                <author>
+                    <keyname>Leus</keyname>
+                        <forenames>Geert</forenames>
+                </author>
+                <author>
+                    <keyname>Marques</keyname>
+                        <forenames>Antonio G.</forenames>
+                </author>
+        </authors>
+        <title>Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, making them inadequate for datasets exhibiting higher-order interactions. Simplicial complexes (SCs) have emerged as a promising framework for capturing such higher-order dependencies. This paper focuses on the problem of identifying the topology of an SC from signals, which serves as the foundation for SC-based processing and learning schemes. We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices). We assume the observed signals are smooth over the unknown SC topology, and that the higher-order interactions are sparse. Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it. A key step in our formulation is the modeling of the topology of the SC using binary edge and triangle selection vectors, combined with efficient greedy algorithms for optimizing such vectors. We establish theoretical convergence guarantees to a stationary point of a relaxed (penalized) version of the problem and discuss computational complexity. Multiple numerical experiments with both synthetic and real-world datasets validate the effectiveness of our approach, highlighting the capability of SC-learning methods to uncover and model higher-order relationships in complex datasets.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.bin b/research/fog-of-knowledge/data/evidence/raw/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.bin
new file mode 100644
index 000000000..f3c9f601a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.bin
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:12Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.17042" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.17042</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.17042</id>
+        <created>2026-09-15</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Kumar</keyname>
+                        <forenames>Sreejan</forenames>
+                </author>
+                <author>
+                    <keyname>Mattar</keyname>
+                        <forenames>Marcelo</forenames>
+                </author>
+                <author>
+                    <keyname>Duncker</keyname>
+                        <forenames>Lea</forenames>
+                </author>
+        </authors>
+        <title>Learning Options for Compositional Motor Control with Adapter Banks</title>
+            <categories>cs.LG cs.RO q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Learning flexible motor primitives is a hallmark of skilled motor control. Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned. We translate this principle into a novel architecture for learning motor skills end-to-end: a shared recurrent core modulated by a bank of residual adapters, each selected by a discrete latent code. Trained on closed-loop biomechanical control, the adapters develop emergent low-rank perturbations of the recurrent dynamics despite no architectural rank constraint, placing task representations in disparate subspaces of the shared core network. A simple high-level policy over the learned options, optimized while the whole network is frozen, sequences the low-rank adapters to produce novel out-of-distribution movements. We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.bin b/research/fog-of-knowledge/data/evidence/raw/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.bin
new file mode 100644
index 000000000..23a8fadb9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.bin
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:56Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12016" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12016</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12016</id>
+        <created>2026-09-10</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Haroon</keyname>
+                        <forenames>Adam</forenames>
+                </author>
+                <author>
+                    <keyname>Rodríguez-Seda</keyname>
+                        <forenames>Erick J.</forenames>
+                </author>
+                <author>
+                    <keyname>Schuler</keyname>
+                        <forenames>Tristan</forenames>
+                </author>
+                <author>
+                    <keyname>Fleming</keyname>
+                        <forenames>Cody</forenames>
+                </author>
+        </authors>
+        <title>Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <comments>8 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Self-triggered reinforcement learning control (RL-STC) learns the sparsest control schedule that preserves Lyapunov-decreasing stability under a Run-Time Assurance (RTA) override. We invert this: an adversarial RL agent learns the sparsest jamming or Denial-of-Service (DoS) schedule that destabilizes the closed loop, with a Lyapunov-increase admissibility predicate mirroring the defender&#39;s safety certificate. We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary. This extends the DoS-scheduling count-budget analysis from periodic and linear-time-invariant to STC controllers. Empirically, we train against four fixed defenders per plant (one Linear Quadratic Regulator (LQR) and three RL-STC) on Pendulum, CartPole, and Quadrotor2D. The learned adversary is the only adversary that crashes every defender on every plant at $100\%$: greedy misses Quadrotor2D LQR on $42\%$ of episodes and periodic misses Pendulum LQR on $97\%$. On jam-time-per-failure it beats baselines by up to $2.8\times$, and shows its widest absolute margin on Quadrotor2D LQR. Robustness ablations show that Gaussian observation noise exceeding the initial-state magnitude and position-only observation both preserve $100\%$ failure rate and keep the learned adversary strictly ahead of both baselines on jam-time-per-failure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.bin b/research/fog-of-knowledge/data/evidence/raw/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.bin
new file mode 100644
index 000000000..9effb86ce
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.bin
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-10T17:37:33Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.03964" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.03964</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.03964</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Hamad</keyname>
+                        <forenames>Ahrar N.</forenames>
+                </author>
+                <author>
+                    <keyname>Qidan</keyname>
+                        <forenames>Ahmad Adnan</forenames>
+                </author>
+                <author>
+                    <keyname>El-Gorashi</keyname>
+                        <forenames>Taisir E. H.</forenames>
+                </author>
+                <author>
+                    <keyname>Elmirghani</keyname>
+                        <forenames>Jaafar M. H.</forenames>
+                </author>
+        </authors>
+        <title>Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>6 pages, 4 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hybrid radio frequency (RF) and visible light communication (VLC) networks have emerged as a promising solution for high-capacity indoor wireless connectivity in sixth-generation (6G) systems. However, the limited optical coverage and vulnerability of VLC links to line-of-sight (LoS) blockage under user mobility remain fundamental challenges. In this work, a mirror-based intelligent reflecting surface (IRS) is deployed to assist a dynamic indoor hybrid RF/VLC network, where each mobile user is exclusively assigned to either the IRS-enhanced VLC subnetwork or the RF subnetwork through a binary selection decision. A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles. To enable real-time adaptability, the problem is reformulated as a Markov decision process (MDP) and solved using a cooperative multi-agent deep reinforcement learning (DRL) algorithm based on centralized training with decentralized execution. Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks. The results further validate the practicality and effectiveness of the proposed DRL framework compared to widely adopted DRL algorithms as well as conventional model-based optimization approaches.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.bin b/research/fog-of-knowledge/data/evidence/raw/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.bin
new file mode 100644
index 000000000..42c3e9341
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T16:54:39Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12604" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12604</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12604</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Pires</keyname>
+                        <forenames>Francisco I. T.</forenames>
+                </author>
+                <author>
+                    <keyname>Ferreira</keyname>
+                        <forenames>Jean C. S.</forenames>
+                </author>
+                <author>
+                    <keyname>Asim</keyname>
+                        <forenames>Fazal-E</forenames>
+                </author>
+        </authors>
+        <title>Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>This paper presents a low-complexity tensor-based channel estimation framework for downlink mmWave massive MIMO systems using passive Butler-matrix beamforming. By modeling received signals as a third-order PARAFAC tensor, we exploit known pilot structures via bilinear alternating least-squares (BALS) optimization to reduce computational overhead. The decoupled spatial factors are then processed via 1D and 2D ESPRIT to extract angles of arrival and departure with automatic pairing. Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture. Simulations confirm the proposed estimator outperforms conventional least-squares, achieving accurate channel reconstruction and approaching the CRLB at moderate-to-high signal-to-noise ratios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.bin b/research/fog-of-knowledge/data/evidence/raw/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.bin
new file mode 100644
index 000000000..d1d0db357
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.bin
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T20:38:08Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.11359" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.11359</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.11359</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Kojima</keyname>
+                        <forenames>Hayate</forenames>
+                </author>
+                <author>
+                    <keyname>Noguchi</keyname>
+                        <forenames>Hikari</forenames>
+                </author>
+                <author>
+                    <keyname>Yamada</keyname>
+                        <forenames>Koki</forenames>
+                </author>
+                <author>
+                    <keyname>Tanaka</keyname>
+                        <forenames>Yuichi</forenames>
+                </author>
+        </authors>
+        <title>Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors</title>
+            <categories>eess.SP</categories>
+            <comments>Submitted to IEEE Transactions on Signal and Information Processing over Networks</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this paper, we propose restoration methods for time-varying graph signals using deep algorithm unrolling (DAU). Time-varying graph signals, such as signals obtained from sensor networks, are nonuniformly distributed in space and observed as time series. Since these observed signals often contain noise and missing values, their restoration needs to consider both spatial and temporal relationships. Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness. We then unroll the iterative conjugate gradient method to solve this problem and learn the regularization parameters and filter coefficients in each iteration. Our method can be applied to supervised batch, supervised online, and unsupervised batch settings to learn these parameters. Experiments on several synthetic and real-world datasets show that the supervised batch method achieves the lowest RMSEs in almost all cases. The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.bin b/research/fog-of-knowledge/data/evidence/raw/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.bin
new file mode 100644
index 000000000..a43c6a7ff
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.bin
@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.22615" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.22615</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.22615</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Guo</keyname>
+                        <forenames>Guangpu</forenames>
+                </author>
+                <author>
+                    <keyname>Xia</keyname>
+                        <forenames>Xiang-Gen</forenames>
+                </author>
+        </authors>
+        <title>Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The Chinese remainder theorem (CRT) is highly sensitive to remainder errors. Robust CRT addresses this problem by recovering the folding integers correctly from erroneous remainders, so that the final reconstruction error is bounded by the remainder error level. The existing dynamic range--robustness tradeoff results mainly assume a uniform remainder error bound, where all remainders share one scalar error bound. This paper studies the exact tradeoff when the remainder error bound is a vector in the sense that different remainders may have different error bounds. For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination. Based on this condition, we characterize the largest admissible range length, called the dynamic range, for a given remainder error bound vector. Conversely, for a given range length, we characterize all remainder error bound vectors under which remainder errors can be tolerated. We also give an exact folding integer vector decoding algorithm. We show that the proposed results reduce to the classical CRT in the error-free case and coincide with the known result when all remainder error bounds are equal. Numerical results show that the dynamic range depends on the full remainder error bound vector. They also show that the remainders are coupled in the robustness, which cannot be captured by a single uniform error bound.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.bin b/research/fog-of-knowledge/data/evidence/raw/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.bin
new file mode 100644
index 000000000..afdfbc5a7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.bin
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:38Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.28815" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.28815</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.28815</id>
+        <created>2026-09-23</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Eslami</keyname>
+                        <forenames>Shima</forenames>
+                </author>
+                <author>
+                    <keyname>Kaleva</keyname>
+                        <forenames>Jarkko</forenames>
+                </author>
+                <author>
+                    <keyname>Tölli</keyname>
+                        <forenames>Antti</forenames>
+                </author>
+        </authors>
+        <title>Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Near-field (N-F) line-of-sight (LoS) MIMO channels admit a compact representation through a small number of geometric parameters describing the relative transceiver geometry, enabling low-overhead channel acquisition without estimating the full channel matrix. This paper considers downlink (DL) channel acquisition under practical asymmetric user-equipment (UE) antenna capabilities with multiple DL receive antennas, but only a single active uplink (UL) transmit chain. In this setting, UL observations across the large BS aperture enable accurate estimation of the relative location of the UL-active UE antenna but are insufficient to determine the orientation of the entire UE array. We propose a two-stage geometry-based N-F LoS MIMO channel acquisition framework that distributes the estimation of the channel-defining geometric parameters between the BS and UE. First, a single UL pilot sequence enables the BS to estimate two BS-side reference angles that parameterize the relative location of the UL-active UE antenna. The BS conveys these estimates to the UE and transmits two DL pilot sequences, from which the UE estimates the remaining array-orientation parameter. We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty. Numerical results characterize the resulting error propagation and demonstrate accurate estimation of the geometric parameters and reconstruction of the LoS MIMO channel using one UL and two DL pilot sequences.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.bin b/research/fog-of-knowledge/data/evidence/raw/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.bin
new file mode 100644
index 000000000..d6f4254dd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:29Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.24219" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.24219</identifier>
+        <datestamp>2026-08-26</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.24219</id>
+        <created>2026-08-25</created>
+            <updated>2026-08-26</updated>
+        <authors>
+                <author>
+                    <keyname>López</keyname>
+                        <forenames>Francisco M.</forenames>
+                </author>
+                <author>
+                    <keyname>Triesch</keyname>
+                        <forenames>Jochen</forenames>
+                </author>
+        </authors>
+        <title>Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception</title>
+            <categories>cs.CV q-bio.NC</categories>
+            <comments>24 pages, 11 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Facial attractiveness has been linked to statistical regularities such as symmetry and averageness, suggesting that beauty may depend on the ease with which a face is perceived. We empirically test this hypothesis by training variational autoencoders on four face datasets without attractiveness supervision and evaluating their representations on the 597 faces from the Chicago Face Database. Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space. Independently learned latent spaces contain an attractiveness direction that transfers strongly across random initializations and training data. We also find that attractive faces are more prototypical in both shape and latent space. Our results connect classic accounts of aesthetics with learned generative models and provide empirical support for a variational interpretation of the processing fluency theory of aesthetic pleasure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.bin b/research/fog-of-knowledge/data/evidence/raw/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.bin
new file mode 100644
index 000000000..152435ee1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.bin
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T07:13:11Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.16259" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.16259</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.16259</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Luo</keyname>
+                        <forenames>Yubin</forenames>
+                </author>
+                <author>
+                    <keyname>Zhu</keyname>
+                        <forenames>Jieao</forenames>
+                </author>
+                <author>
+                    <keyname>Takahashi</keyname>
+                        <forenames>Takumi</forenames>
+                </author>
+                <author>
+                    <keyname>Ochiai</keyname>
+                        <forenames>Hideki</forenames>
+                </author>
+        </authors>
+        <title>Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models. This paper studies channel instability near electromag- netic singular states, where small environmental perturbations can cause large variations in the end-to-end channel. Using resolvent-based spectral analysis, we develop an electromag- netic multiple-input multiple-output (MIMO) channel model that decomposes the end-to-end channel into a smooth regular component and singularity-associated components. The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states. The proposed model also reveals a limitation of conventional water filling (WF): power allocation based only on instan- taneous channel gains does not account for such instability. We therefore estimate singularity information from broadband MIMO channel state information (CSI) and develop a singularity- aware transmit covariance optimization method. Simulations demonstrate numerical stability of the estimated pole frequencies and illustrate the environmental sensitivity of pole-associated channel components. The proposed allocation reduces weighted singular-channel exposure by 90.32% while retaining 95% of the nominal WF rate.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.bin b/research/fog-of-knowledge/data/evidence/raw/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.bin
new file mode 100644
index 000000000..d500bcbe2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.bin
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.02071" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.02071</identifier>
+        <datestamp>2026-09-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.02071</id>
+        <created>2026-09-02</created>
+            <updated>2026-09-03</updated>
+        <authors>
+                <author>
+                    <keyname>Schiller</keyname>
+                        <forenames>Julian D.</forenames>
+                </author>
+                <author>
+                    <keyname>Müller</keyname>
+                        <forenames>Matthias A.</forenames>
+                </author>
+        </authors>
+        <title>Turnpike properties in nonlinear system identification</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We analyze the problem of learning general discrete-time nonlinear state-space models using the simulation error minimization (SEM) method. In this setting, model parameters are typically learned by minimizing the mismatch between simulated and measured outputs over a training dataset, or shorter subsequences extracted from it. Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state. In the presence of non-unique optimal output sequences---as may arise, for instance, in fully black-box system identification using neural networks---the property is formulated with respect to the closest such sequence. Turnpike behavior is generally desirable in practice, as it provides a theoretical justification for employing computationally more tractable SEM formulations with fixed initial states while ensuring that their optimal output sequences remain close to unconstrained optimal ones. Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity. We additionally introduce a cardinality turnpike property and show that it is strictly weaker than the cumulative notion. Finally, we establish sufficient conditions for turnpike behavior based on incremental output stability, convexity of the stage cost, and a suitable optimality condition, and illustrate the theory by means of a numerical example.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/raw/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.bin b/research/fog-of-knowledge/data/evidence/raw/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.bin
new file mode 100644
index 000000000..54450ff63
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/raw/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.bin
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:39:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19137" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19137</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19137</id>
+        <created>2026-10-13</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Park</keyname>
+                        <forenames>Jaebum</forenames>
+                </author>
+                <author>
+                    <keyname>Xie</keyname>
+                        <forenames>Yutao</forenames>
+                </author>
+                <author>
+                    <keyname>Ghosh</keyname>
+                        <forenames>Amitava</forenames>
+                </author>
+                <author>
+                    <keyname>Shi</keyname>
+                        <forenames>Yuanyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Heath</keyname>
+                        <forenames>Robert W.</forenames>
+                        <suffix>Jr</suffix>
+                </author>
+        </authors>
+        <title>Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity. We jointly optimize base station and battery operation under a carbon-adjusted electricity price and traffic-demand constraints, and solve the mixed-integer nonconvex problem through a two-stage decomposition exact under a minimum-power rule. Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned. Above a carbon price of roughly 100-300 USD/ton, battery operation shifts from cost-driven to carbon-driven, cutting emissions by up to 57.8% relative to a cost-only schedule.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.txt b/research/fog-of-knowledge/data/evidence/snapshots/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.txt
new file mode 100644
index 000000000..33804e4d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268.txt
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.01220" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.01220</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.01220</id>
+        <created>2026-08-02</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Doostmohammadian</keyname>
+                        <forenames>Mohammadreza</forenames>
+                </author>
+                <author>
+                    <keyname>Ghods</keyname>
+                        <forenames>Amir Ahmad</forenames>
+                </author>
+                <author>
+                    <keyname>Aghasi</keyname>
+                        <forenames>Alireza</forenames>
+                </author>
+                <author>
+                    <keyname>Gabidullina</keyname>
+                        <forenames>Zulfiya R.</forenames>
+                </author>
+                <author>
+                    <keyname>Rabiee</keyname>
+                        <forenames>Hamid R.</forenames>
+                </author>
+        </authors>
+        <title>Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap</title>
+            <categories>eess.SY cs.LG cs.SY eess.SP math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz continuous optimization algorithms have been proposed to improve the slow conver-gence rate of the existing linear solutions. The use of signum-based functions is previ-ously considered in consensus and control literature to reach fast convergence in the prescribed time and also to provide robust algorithms to noisy/outlier data. However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup. This motivates us to investigate the distributed optimization and ML algorithms in terms of trade-off between conver-gence rate and optimality gap. In this direction, we specifically consider the distributed regression problem and check its convergence rate by applying both linear and non-Lipschitz signum-based functions. We check our distributed regression approach by extensive simulations. Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps. The findings pre-sented in this paper may contribute to and advance the ongoing discourse of similar distributed algorithms, e.g., for distributed constrained optimization and distributed estimation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.txt b/research/fog-of-knowledge/data/evidence/snapshots/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.txt
new file mode 100644
index 000000000..94c21d261
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.21020" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.21020</identifier>
+        <datestamp>2026-08-24</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.21020</id>
+        <created>2026-08-21</created>
+            <updated>2026-08-24</updated>
+        <authors>
+                <author>
+                    <keyname>Ouyang</keyname>
+                        <forenames>Chongjun</forenames>
+                </author>
+                <author>
+                    <keyname>Jiang</keyname>
+                        <forenames>Hao</forenames>
+                </author>
+                <author>
+                    <keyname>Ding</keyname>
+                        <forenames>Zhiguo</forenames>
+                </author>
+                <author>
+                    <keyname>Schober</keyname>
+                        <forenames>Robert</forenames>
+                </author>
+        </authors>
+        <title>Frequency-Selective Pinching-Antenna Systems</title>
+            <categories>eess.SP</categories>
+            <comments>34 pages</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>An uplink pinching-antenna system (PASS) is considered, where a segmented dielectric waveguide is employed to serve multiple users and one pinching antenna (PA) is activated on each segment. Extensive waveguide deployment reduces user-to-PA path loss but also creates differential propagation delays among the PA-assisted paths spanning the large waveguide aperture. These delays are retained, and a Toeplitz block model is derived to characterize the resulting frequency-selective (FS) channel. For infinite-blocklength transmission, the achievable single-user rate and the multiuser sum-rates under joint and parallel decoding are characterized. For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate. The difference between the rates computed under the FF channel model and the exact FS channel model is referred to as the FF rate overestimation, and its dependence on the waveguide-aperture-induced delay spread is characterized. For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime. For finite-blocklength transmission, achievable rates are derived under a practical cyclic-prefix single-carrier frequency-domain equalization framework. An element-wise algorithm is developed to optimize FS-aware PA placement in both transmission regimes. The analytical findings demonstrate that differential delays across the extensively deployed waveguide can cause significant frequency selectivity and that the proposed FS-aware PA placement method substantially improves the achievable rate over placement based on the FF approximation, especially for large bandwidths and apertures.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.txt b/research/fog-of-knowledge/data/evidence/snapshots/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.txt
new file mode 100644
index 000000000..746f13c32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:49Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25701" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25701</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:MA</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25701</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Lee</keyname>
+                        <forenames>Haejoon</forenames>
+                </author>
+                <author>
+                    <keyname>Panagou</keyname>
+                        <forenames>Dimitra</forenames>
+                </author>
+        </authors>
+        <title>Fully Byzantine-Resilient Multi-Agent Reinforcement Learning</title>
+            <categories>cs.LG cs.MA cs.SY eess.SY</categories>
+            <comments>12 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through local interactions. Existing methods guarantee convergence of the agents&#39; parameters only to a neighborhood of the attack-free limit points, resulting in degraded performance. We propose Fully Resilient AC-MARL (FRAC-MARL), a decentralized method in which each agent leverages redundancy in two-hop messages to identify reliable messages. Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs. We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time. Finally, we demonstrate our method on cooperative multi-robot formation control tasks.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.txt b/research/fog-of-knowledge/data/evidence/snapshots/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.txt
new file mode 100644
index 000000000..a03cb794e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09010" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09010</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09010</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The growing demand for diverse sixth-generation (6G) applications requires efficient connectivity, seamless service continuity, and extended network coverage. Although terrestrial infrastructures can effectively serve most wireless user equipment (UE), communication reliability may be significantly degraded in remote or blocked environments. To address this challenge, this paper proposes a reconfigurable intelligent surface (RIS)-assisted space-air-ground integrated network (SAGIN) operating in the upper mid-band (FR3) spectrum. The considered network consists of a terrestrial base station (BS), a low Earth orbit (LEO) satellite, multiple terrestrial RISs (TRISs), and unmanned aerial vehicle-mounted RISs (ARISs), where the BS serves as the primary access node, while the LEO satellite provides complementary connectivity when terrestrial links are unavailable or cannot satisfy the required quality-of-service (QoS) requirements. Within this framework, we formulate a hierarchical RIS association problem to maximize the achievable network sum rate under RIS capacity constraints. The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources. To efficiently solve the problem, we develop a hierarchical many-to-one matching-based RIS association framework. Specifically, UEs with satisfactory terrestrial connectivity are first associated with TRISs, whereas UEs that cannot be reliably served by the terrestrial network are subsequently associated with ARISs through the non-terrestrial network. Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.txt b/research/fog-of-knowledge/data/evidence/snapshots/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.txt
new file mode 100644
index 000000000..c8114809e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff.txt
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21966" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21966</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>cs:cs:FL</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21966</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Bahmani</keyname>
+                        <forenames>Sarvin</forenames>
+                </author>
+                <author>
+                    <keyname>Paul</keyname>
+                        <forenames>Soumyajit</forenames>
+                </author>
+                <author>
+                    <keyname>Schewe</keyname>
+                        <forenames>Sven</forenames>
+                </author>
+                <author>
+                    <keyname>Soudjani</keyname>
+                        <forenames>Sadegh</forenames>
+                </author>
+                <author>
+                    <keyname>Trivedi</keyname>
+                        <forenames>Ashutosh</forenames>
+                </author>
+        </authors>
+        <title>Automata-Theoretic Verification of Interval Markov Decision Processes</title>
+            <categories>cs.FL cs.SY eess.SY</categories>
+            <comments>14 pages including appendices, accepted to CDC 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Interval Markov decision processes (IMDPs) provide a natural framework for modeling stochastic systems with uncertain transition probabilities, represented by probability intervals and resolved adversarially. Such uncertainty arises naturally, for example, when the transition model is learned from finite data or obtained through model-based reinforcement learning. In this paper, we study the automata-theoretic verification of IMDPs against rich temporal specifications, including all LTL specifications, by considering the broader class of ω-regular objectives. We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals. For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata). For unstable IMDPs, where intervals may include zero while the upper bound is strictly positive, verification becomes game-like and requires automata whose nondeterminism can be resolved on the fly (good-for-games automata). Building on these insights, we develop algorithms for verifying ω-regular specifications over IMDPs and derive probabilistic guarantees when the interval model is learned from sampled data. The resulting framework enables principled verification of stochastic systems under probabilistic model uncertainty, connecting automata-based verification with data-driven stochastic modeling.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.txt b/research/fog-of-knowledge/data/evidence/snapshots/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.txt
new file mode 100644
index 000000000..df38aeafa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21813" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21813</identifier>
+        <datestamp>2026-10-01</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21813</id>
+        <created>2026-09-30</created>
+            <updated>2026-10-01</updated>
+        <authors>
+                <author>
+                    <keyname>Corlay</keyname>
+                        <forenames>Vincent</forenames>
+                </author>
+                <author>
+                    <keyname>Enttsel</keyname>
+                        <forenames>Andriy</forenames>
+                </author>
+        </authors>
+        <title>How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing</title>
+            <categories>stat.ML cs.CV eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In classification-oriented adaptive sensing, posterior samples characterize uncertainty at the current measurement state and can serve two roles: they may guide the next sensing direction, while their class labels provide votes for the candidate classes and determine whether sensing should continue. We focus on the stopping layer that turns these votes into a declaration, without modifying the posterior sampler or sensing directions. A natural plug-in rule declares when the observed vote share exceeds a threshold. We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time. As alternatives, we calibrate a fixed-sample rule and a finite-horizon sequential rule to a prescribed false-declaration probability, and study exact curtailment, which stops a fixed-pool rule once its final verdict is forced. We then derive how one-round declaration probabilities determine posterior-sample cost and classification accuracy along a sensing path. On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples. Among the evaluated rules at matched operating points, sequential stopping reduces the cost the most. At a high accuracy, that same sequential rule can trade more posterior samples for fewer measurements.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.txt b/research/fog-of-knowledge/data/evidence/snapshots/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.txt
new file mode 100644
index 000000000..2982763ed
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:14Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02976" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02976</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02976</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Salimi</keyname>
+                        <forenames>Arastoo H</forenames>
+                </author>
+                <author>
+                    <keyname>Dehghani</keyname>
+                        <forenames>Majid</forenames>
+                </author>
+                <author>
+                    <keyname>Nazaripouya</keyname>
+                        <forenames>Hamidreza</forenames>
+                </author>
+        </authors>
+        <title>Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper proposes a novel automated decision-support framework aimed at enhancing the resilience of power systems and operational resilience against wildfires by formulating the decision-making process as a stochastic multi-stage programming during a progressive wildfire. The paper develops a framework that takes into account both preventive and corrective actions, enabling automated and adaptive decisions based on potential scenarios over the course of a wildfire&#39;s progression. This approach considers the evolving nature of the wildfire threat and seeks to optimize the response strategies accordingly throughout its duration. The objective is to minimize wildfire risk and operational costs while reducing load curtailment. The framework accounts for potential contingencies caused by progressive wildfires. A novel algorithm is proposed to construct a decision tree based on wildfire progression and system geographical information. Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework. The effectiveness of the proposed method is demonstrated on the IEEE 30-bus system under various wildfire impact scenarios and is then applied to the IEEE 300-bus system to illustrate the scalability of the proposed approach. The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.txt b/research/fog-of-knowledge/data/evidence/snapshots/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.txt
new file mode 100644
index 000000000..ab8ce93c4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0.txt
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.21764" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.21764</identifier>
+        <datestamp>2026-08-25</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.21764</id>
+        <created>2026-08-22</created>
+            <updated>2026-08-25</updated>
+        <authors>
+                <author>
+                    <keyname>Islam</keyname>
+                        <forenames>Riadul</forenames>
+                </author>
+                <author>
+                    <keyname>Mule</keyname>
+                        <forenames>Joey</forenames>
+                </author>
+                <author>
+                    <keyname>Challagundla</keyname>
+                        <forenames>Dhandeep</forenames>
+                </author>
+                <author>
+                    <keyname>Rizvi</keyname>
+                        <forenames>Shahmir</forenames>
+                </author>
+                <author>
+                    <keyname>Carson</keyname>
+                        <forenames>Sean</forenames>
+                </author>
+                <author>
+                    <keyname>Saini</keyname>
+                        <forenames>Rachit</forenames>
+                </author>
+        </authors>
+        <title>LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices</title>
+            <categories>cs.CV cs.AI eess.IV</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing. However, the asynchronous and noise-prone nature of event streams creates challenges for conventional deep learning models, which are often too computationally intensive for low-power embedded platforms. This work presents a compact and configurable event-driven autoencoder that efficiently compresses neuromorphic data while preserving essential spatiotemporal structure for downstream inference. The architecture integrates lightweight convolutional encoding with robust performance under adaptive event thresholding and a minimal classifier head, enabling substantial reductions in computational cost without degrading recognition fidelity. Extensive evaluations on the Smart Event Face Dataset (SEFD) and Event-Based Crossing Dataset (EBCD) show that the proposed framework achieves competitive or superior accuracy compared to YOLOv9 while requiring up to 35.6$\times$ fewer parameters. To assess real-world sustainability, the model is deployed on resource-constrained hardware: a Raspberry Pi 4B and a NVIDIA Jetson Nano. On NVIDIA Jetson Nano, it delivers real-time throughput of 44.8 FPS. On a Raspberry Pi 4B CPU, the 50\% autoencoder classifier consumes 16.19 J for the evaluated inference workload, corresponding to approximately 726.3$\times$ lower energy consumption than YOLOv9 under the same evaluation protocol. These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.txt b/research/fog-of-knowledge/data/evidence/snapshots/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.txt
new file mode 100644
index 000000000..044a60911
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b.txt
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T14:47:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19722" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19722</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>cs:cs:SD</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19722</id>
+        <created>2026-10-14</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Cao</keyname>
+                        <forenames>Zhe</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jichao</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Xiao-Lei</forenames>
+                </author>
+        </authors>
+        <title>ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition</title>
+            <categories>cs.SD cs.AI eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Recent advances in deep learning have significantly improved underwater acoustic vessel recognition. However, existing publicly available datasets are typically limited in scale, hindering large-scale representation learning and downstream task evaluation. To address this limitation, we introduce ONCship, a large-scale underwater acoustic dataset comprising 4521 hours of curated recordings from Ocean Networks Canada (ONC) hydrophones and Automatic Identification System (AIS) data. We evaluate the proposed dataset across three tasks: self-supervised representation learning, vessel-type classification, and MMSI-Level Vessel Classification. Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing. Furthermore, incorporating ONCship as auxiliary training data improves downstream vessel-type classification performance. Beyond conventional vessel-type classification, we further investigate MMSI-Level Vessel Classification, treating each vessel as a distinct identity. Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification. Overall, ONCship provides a valuable resource for underwater acoustic representation learning and vessel recognition, while its rich vessel-level metadata enables further exploration of MMSI-Level Vessel Classification.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.txt b/research/fog-of-knowledge/data/evidence/snapshots/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.txt
new file mode 100644
index 000000000..1fb36e3c0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:44Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.08744" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.08744</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.08744</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In sixth-generation (6G) networks, supporting ultra-reliable low-latency communication (URLLC) services imposes stringent requirements on reliability, latency, and efficient resource utilization. The upper mid-band (FR3) spectrum has emerged as a promising candidate due to its favorable trade-off between coverage and bandwidth availability. However, achieving high reliability in dense deployments remains challenging due to interference and propagation impairments. To address these challenges, this paper investigates a reconfigurable intelligent surface (RIS)-assisted network operating in the FR3 band. We formulate a joint transmit power allocation and user equipment (UE)-RIS association problem to maximize network reliability under finite blocklength constraints. The resulting problem is nonconvex and combinatorial due to interference coupling and binary association variables. To solve this problem efficiently, we propose a multiphase resource allocation framework that integrates a successive convex approximation (SCA)-based power optimization scheme with a matching theory-based UE-RIS association algorithm. Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.txt b/research/fog-of-knowledge/data/evidence/snapshots/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.txt
new file mode 100644
index 000000000..6f75225f0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee.txt
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:11Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.25081" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.25081</identifier>
+        <datestamp>2026-07-29</datestamp>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.25081</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-29</updated>
+        <authors>
+                <author>
+                    <keyname>Zampirolli</keyname>
+                        <forenames>Eduardo Moura</forenames>
+                </author>
+                <author>
+                    <keyname>Interian</keyname>
+                        <forenames>Ruben</forenames>
+                </author>
+        </authors>
+        <title>Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales</title>
+            <categories>physics.soc-ph</categories>
+            <comments>28 pages, English and Portuguese versions (English first)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This study investigates the predictive capacity of models based on Economic Complexity and Complex Network Theory when applied to Brazil&#39;s Municipal Human Development Index (IDHM). For this purpose, the Economic Complexity Index was adapted to the Brazilian context. The main objective is to assess the extent to which different approaches to regional development analysis, such as local productive sophistication and structural integration into the national transportation network, determine socioeconomic development. The methodology compares linear regression models (Ridge, LASSO, and Elastic Net) and nonlinear models (Decision Trees and the Explainable Boosting Machine), evaluated through 5-fold cross-validation with grid search. The analyses were conducted at two levels of spatial aggregation: municipalities and Immediate Geographic Regions. The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables. Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale. In addition, the inclusion of topological metrics from the road infrastructure network generally improved performance. The Explainable Boosting Machine achieved the best predictive performance, reaching R^2 = 0.8196 at the Immediate Region level when network metrics were included.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.txt b/research/fog-of-knowledge/data/evidence/snapshots/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.txt
new file mode 100644
index 000000000..4c9bb603c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25437" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25437</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:CY</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25437</id>
+        <created>2026-09-21</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Alston</keyname>
+                        <forenames>Garrett</forenames>
+                </author>
+                <author>
+                    <keyname>Love</keyname>
+                        <forenames>Nancy</forenames>
+                </author>
+                <author>
+                    <keyname>Haider</keyname>
+                        <forenames>Rabab</forenames>
+                </author>
+        </authors>
+        <title>Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development</title>
+            <categories>eess.SY cs.CY cs.DC cs.SY</categories>
+            <comments>12 pages; 8 figures; 6 tables; appendix</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Data centers are being developed at an unprecedented pace, yet their energy and water impacts, and the spatial and temporal distribution of these impacts, remain poorly characterized. Data centers consume water for cooling (direct) and through electricity generation (indirect). Decisions on siting and cooling technology result in water-energy trade-offs that extend impacts beyond the facility&#39;s location. Existing assessment frameworks rely on facility efficiency metrics and average grid water intensity factors, suppressing the temporal impacts of data center load and generation availability. They also attribute indirect consumption to the facility&#39;s location rather than to the generators (and corresponding hydrologic regions) that respond to the added load, misattributing spatial impacts. To close this gap, we develop a computational model of the data center-energy-water nexus that links facility cooling and electricity demand with hourly economic dispatch, generator-level water consumption, and monthly subbasin depletion. Built on open-source data, the model resolves where and when water is consumed, and where this consumption compounds existing water risk or creates new risk. Using the model, we study different cooling configurations and proposed developments in the state of Michigan. Air-cooled data centers halve total water consumption relative to evaporative cooling, but increase electricity demand and raise indirect water consumption by one-third, shifting the water footprint from the facility to generators. Mapping these changes to subbasins reveals depletion increases beyond the data center sites, in regions that facility-level reporting may overlook. These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.txt b/research/fog-of-knowledge/data/evidence/snapshots/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.txt
new file mode 100644
index 000000000..0b369ac5e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee.txt
@@ -0,0 +1,67 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-09T16:30:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04959" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04959</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>cs:cs:CE</setSpec>
+            <setSpec>q-fin:q-fin:CP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04959</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Jin</keyname>
+                        <forenames>Yanzheng</forenames>
+                </author>
+                <author>
+                    <keyname>Shao</keyname>
+                        <forenames>Pengyang</forenames>
+                </author>
+                <author>
+                    <keyname>Ma</keyname>
+                        <forenames>Yunshan</forenames>
+                </author>
+                <author>
+                    <keyname>Pan</keyname>
+                        <forenames>Haowen</forenames>
+                </author>
+                <author>
+                    <keyname>Zhai</keyname>
+                        <forenames>Naixin</forenames>
+                </author>
+                <author>
+                    <keyname>Song</keyname>
+                        <forenames>Chen-Hui</forenames>
+                </author>
+                <author>
+                    <keyname>Shen</keyname>
+                        <forenames>Fei</forenames>
+                </author>
+                <author>
+                    <keyname>Kawaguchi</keyname>
+                        <forenames>Kenji</forenames>
+                </author>
+        </authors>
+        <title>AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion</title>
+            <categories>cs.CE q-fin.CP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Formulaic alpha discovery seeks symbolic expressions that predict cross-sectional asset returns. In deployment, multiple formulas are combined into an alpha pool, where each formula is valued through the complementary information it contributes to joint predictive performance. While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges. First, generating formulas individually leaves pool context and inter-formula complementarity outside the generative state. Second, formula-wise generation lacks a unified mechanism for preserving and revising structures at different levels. Third, pool-level rewards jointly reflect predictive performance and redundancy but cannot be differentiated directly through symbolic evaluation to train the generator. To overcome these challenges, we introduce AlphaPADI (Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion), a novel framework built around three components: (1) grammar-constrained buffer initialization that constructs syntactically valid pool candidates, (2) pool-aware hierarchical diffusion that reconstructs complete pools at multiple structural scales under the current pool context, and (3) reward-guided pool refinement that evaluates joint predictive performance and inner diversity, updates the elite buffer, and trains the reverse model through reconstruction and preference learning. Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.txt b/research/fog-of-knowledge/data/evidence/snapshots/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.txt
new file mode 100644
index 000000000..5896875c2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:37Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09080" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09080</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09080</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>Irfan</forenames>
+                </author>
+                <author>
+                    <keyname>Rahim</keyname>
+                        <forenames>Muddasir</forenames>
+                </author>
+                <author>
+                    <keyname>Cherkaoui</keyname>
+                        <forenames>Soumaya</forenames>
+                </author>
+        </authors>
+        <title>User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents a non-orthogonal multiple access (NOMA)-enabled integrated sensing and communication (ISAC) framework for low-altitude wireless networks (LAWN), where an aerial access point simultaneously serves ground users and senses aerial targets. To improve both communication efficiency and sensing reliability, a matching-based user-target pairing (MUTP) scheme is proposed, in which strong and weak channel NOMA users are first paired into NOMA groups and then assigned to sensing targets according to a sensing-aware pairing criterion. Furthermore, an adaptive power allocation (APA) strategy is developed to balance communication quality-of-service requirements and target detection performance. The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA. Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN. Moreover, the proposed method closely approaches the exhaustive search benchmark while avoiding the high computational complexity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.txt b/research/fog-of-knowledge/data/evidence/snapshots/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.txt
new file mode 100644
index 000000000..aa2ec6f94
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-12T03:01:50Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.13424" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.13424</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.13424</id>
+        <created>2026-10-09</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Sharma</keyname>
+                        <forenames>Vaishnavi</forenames>
+                </author>
+                <author>
+                    <keyname>Katewa</keyname>
+                        <forenames>Vaibhav</forenames>
+                </author>
+        </authors>
+        <title>Minimum-Energy Control for Stochastic Linear Systems</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be \emph{small}, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices. Finally, we show that there exists a fundamental lower bound on the optimal control energy which cannot be overcome by increasing the time horizon of the problem.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.txt b/research/fog-of-knowledge/data/evidence/snapshots/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.txt
new file mode 100644
index 000000000..0b776918e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a.txt
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.32315" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.32315</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.32315</id>
+        <created>2026-09-26</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Hadid</keyname>
+                        <forenames>Vanessa</forenames>
+                </author>
+                <author>
+                    <keyname>Abdelhedi</keyname>
+                        <forenames>Hamza</forenames>
+                </author>
+                <author>
+                    <keyname>Pascarella</keyname>
+                        <forenames>Annalisa</forenames>
+                </author>
+                <author>
+                    <keyname>Solla</keyname>
+                        <forenames>Sara A.</forenames>
+                </author>
+                <author>
+                    <keyname>Cisek</keyname>
+                        <forenames>Paul</forenames>
+                </author>
+                <author>
+                    <keyname>Jerbi</keyname>
+                        <forenames>Karim</forenames>
+                </author>
+        </authors>
+        <title>From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Neural activity unfolds not as a set of independent signals, but as a coordinated dynamical process that can be described as a point moving through a high-dimensional state space. This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG. In this primer, we present a neural trajectory analysis based on Principal Component Analysis (PCA) as an accessible route into extending the concepts of neural trajectories in state space to human electrophysiology. We explain how EEG/MEG activity can be organized into neural state representations, projected onto axes organized by decreasing covariance, truncated into low-dimensional representations, and visualized as trajectories that capture how distributed activity evolves over time. We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes. An example of EEG motor execution and imagery, accompanied by a tutorial notebook, illustrates the workflow from conventional EEG summaries to trajectory-based analysis. We also clarify the limits of PCA, including its linear, variance-driven nature, and discuss EEG/MEG-specific challenges such as spatial mixing, preprocessing sensitivity, validation, and overinterpretation. Finally, we situate PCA within a broader family of state-space methods. By making neural trajectories practical and interpretable, this primer offers a guide for bringing the conceptual framework of population-level dynamics into mainstream human cognitive neuroscience.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.txt b/research/fog-of-knowledge/data/evidence/snapshots/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.txt
new file mode 100644
index 000000000..3b0f44f8e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.28387" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.28387</identifier>
+        <datestamp>2026-08-31</datestamp>
+            <setSpec>cs:cs:AR</setSpec>
+            <setSpec>q-bio:q-bio:QM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.28387</id>
+        <created>2026-08-28</created>
+            <updated>2026-08-31</updated>
+        <authors>
+                <author>
+                    <keyname>Jordan</keyname>
+                        <forenames>Jakob</forenames>
+                </author>
+                <author>
+                    <keyname>Richter</keyname>
+                        <forenames>Ole</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Congyang</forenames>
+                </author>
+                <author>
+                    <keyname>Petrovici</keyname>
+                        <forenames>Mihai A.</forenames>
+                </author>
+                <author>
+                    <keyname>Manohar</keyname>
+                        <forenames>Rajit</forenames>
+                </author>
+        </authors>
+        <title>Neuromorphic architectures as numerical solvers for computational neuroscience</title>
+            <categories>cs.AR q-bio.QM</categories>
+            <comments>23 pages, 7 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Neuromorphic computing is closely associated with spiking neuronal networks. However, an alternative class of so-called &#34;rate-based&#34; models arising from computational neuroscience and machine learning forgoes spiking interactions and instead relies on continuous coupling between neurons. Existing neuromorphic implementations designed around spike-based interactions are not well-suited for emulating such models. Here view the distributed simulation of these models as message-passing algorithms on parallel hardware. Leveraging prior art in numerical algorithms and distributed simulation, we outline steps that enable the design of efficient digital neuromorphic accelerators for non-spiking neuronal models. In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision. Using our proposed design principles, we convert an existing neuromorphic architecture into a distributed numerical solver - a spikeless neuromorphic system - for continuously-coupled neuronal models. We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.txt b/research/fog-of-knowledge/data/evidence/snapshots/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.txt
new file mode 100644
index 000000000..709c43c1b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d.txt
@@ -0,0 +1,367 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:42Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.26924" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.26924</identifier>
+        <datestamp>2026-09-24</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.26924</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-24</updated>
+        <authors>
+                <author>
+                    <keyname>Harsy</keyname>
+                        <forenames>Constantin Ulrich</forenames>
+                </author>
+                <author>
+                    <keyname>Wald</keyname>
+                        <forenames>Tassilo</forenames>
+                </author>
+                <author>
+                    <keyname>Gotkowski</keyname>
+                        <forenames>Karol</forenames>
+                </author>
+                <author>
+                    <keyname>Kirchhoff</keyname>
+                        <forenames>Yannick</forenames>
+                </author>
+                <author>
+                    <keyname>Knopp</keyname>
+                        <forenames>Marcel</forenames>
+                </author>
+                <author>
+                    <keyname>Rokuss</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Stegmeier</keyname>
+                        <forenames>Elisa</forenames>
+                </author>
+                <author>
+                    <keyname>Schader</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+                <author>
+                    <keyname>Trofimova</keyname>
+                        <forenames>Dasha</forenames>
+                </author>
+                <author>
+                    <keyname>Stock</keyname>
+                        <forenames>Raphael</forenames>
+                </author>
+                <author>
+                    <keyname>Kahl</keyname>
+                        <forenames>Kim-Celine</forenames>
+                </author>
+                <author>
+                    <keyname>Schaumann</keyname>
+                        <forenames>Stephen</forenames>
+                </author>
+                <author>
+                    <keyname>Erkan</keyname>
+                        <forenames>Selen</forenames>
+                </author>
+                <author>
+                    <keyname>Zimmerer</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Denner</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Langenberg</keyname>
+                        <forenames>Moritz</forenames>
+                </author>
+                <author>
+                    <keyname>Ziegler</keyname>
+                        <forenames>Sebastian</forenames>
+                </author>
+                <author>
+                    <keyname>Eckstein</keyname>
+                        <forenames>Katharina</forenames>
+                </author>
+                <author>
+                    <keyname>Fischer</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Suprijadi</keyname>
+                        <forenames>Jonathan</forenames>
+                </author>
+                <author>
+                    <keyname>Kovács</keyname>
+                        <forenames>Bálint</forenames>
+                </author>
+                <author>
+                    <keyname>Hamm</keyname>
+                        <forenames>Benjamin</forenames>
+                </author>
+                <author>
+                    <keyname>Deshpande</keyname>
+                        <forenames>Anand</forenames>
+                </author>
+                <author>
+                    <keyname>Bounias</keyname>
+                        <forenames>Dimitrios</forenames>
+                </author>
+                <author>
+                    <keyname>Disch</keyname>
+                        <forenames>Nico</forenames>
+                </author>
+                <author>
+                    <keyname>Xiao</keyname>
+                        <forenames>Shuhan</forenames>
+                </author>
+                <author>
+                    <keyname>Kächele</keyname>
+                        <forenames>Jessica</forenames>
+                </author>
+                <author>
+                    <keyname>Sellner</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>Baidya</keyname>
+                        <forenames>Rajesh</forenames>
+                </author>
+                <author>
+                    <keyname>Traub</keyname>
+                        <forenames>Jeremias</forenames>
+                </author>
+                <author>
+                    <keyname>Krämer</keyname>
+                        <forenames>Lars</forenames>
+                </author>
+                <author>
+                    <keyname>Zenk</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Rädsch</keyname>
+                        <forenames>Tim</forenames>
+                </author>
+                <author>
+                    <keyname>Dvoretskii</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Peretzke</keyname>
+                        <forenames>Robin</forenames>
+                </author>
+                <author>
+                    <keyname>Deissler</keyname>
+                        <forenames>Jonathan</forenames>
+                </author>
+                <author>
+                    <keyname>Ertl</keyname>
+                        <forenames>Alexandra</forenames>
+                </author>
+                <author>
+                    <keyname>Ghosh</keyname>
+                        <forenames>Partha</forenames>
+                </author>
+                <author>
+                    <keyname>Dreher</keyname>
+                        <forenames>Kris</forenames>
+                </author>
+                <author>
+                    <keyname>Dinkelacker</keyname>
+                        <forenames>Stefan</forenames>
+                </author>
+                <author>
+                    <keyname>Reinke</keyname>
+                        <forenames>Annika</forenames>
+                </author>
+                <author>
+                    <keyname>Christodoulou</keyname>
+                        <forenames>Evangelia</forenames>
+                </author>
+                <author>
+                    <keyname>Saeed</keyname>
+                        <forenames>Numan</forenames>
+                </author>
+                <author>
+                    <keyname>Savriama</keyname>
+                        <forenames>Yoland</forenames>
+                </author>
+                <author>
+                    <keyname>Estrada</keyname>
+                        <forenames>Santiago</forenames>
+                </author>
+                <author>
+                    <keyname>Kügler</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Barragan</keyname>
+                        <forenames>Laura Alexandra Daza</forenames>
+                </author>
+                <author>
+                    <keyname>Osorio</keyname>
+                        <forenames>Cristina Isabel Gonzalez</forenames>
+                </author>
+                <author>
+                    <keyname>Peeken</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>Baumgartner</keyname>
+                        <forenames>Michael</forenames>
+                </author>
+                <author>
+                    <keyname>Teichmann</keyname>
+                        <forenames>Marvin</forenames>
+                </author>
+                <author>
+                    <keyname>Chabin</keyname>
+                        <forenames>Guillaume</forenames>
+                </author>
+                <author>
+                    <keyname>Kirchler</keyname>
+                        <forenames>Matthias</forenames>
+                </author>
+                <author>
+                    <keyname>Koch</keyname>
+                        <forenames>Valentin</forenames>
+                </author>
+                <author>
+                    <keyname>study</keyname>
+                        <forenames>for the ALFA</forenames>
+                </author>
+                <author>
+                    <keyname>Hohenhaus</keyname>
+                        <forenames>Markus</forenames>
+                </author>
+                <author>
+                    <keyname>Koslov</keyname>
+                        <forenames>Dimitri</forenames>
+                </author>
+                <author>
+                    <keyname>Decker</keyname>
+                        <forenames>Nina</forenames>
+                </author>
+                <author>
+                    <keyname>Yaqub</keyname>
+                        <forenames>Mohammad</forenames>
+                </author>
+                <author>
+                    <keyname>Heuser</keyname>
+                        <forenames>Arnd</forenames>
+                </author>
+                <author>
+                    <keyname>Reuter</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Schnabel</keyname>
+                        <forenames>Julia A.</forenames>
+                </author>
+                <author>
+                    <keyname>Heimann</keyname>
+                        <forenames>Tobias</forenames>
+                </author>
+                <author>
+                    <keyname>Ghesu</keyname>
+                        <forenames>Florin</forenames>
+                </author>
+                <author>
+                    <keyname>Brachmann</keyname>
+                        <forenames>Paul</forenames>
+                </author>
+                <author>
+                    <keyname>Heußel</keyname>
+                        <forenames>Claus P.</forenames>
+                </author>
+                <author>
+                    <keyname>Radbruch</keyname>
+                        <forenames>Alexander</forenames>
+                </author>
+                <author>
+                    <keyname>Brugnara</keyname>
+                        <forenames>Gianluca</forenames>
+                </author>
+                <author>
+                    <keyname>Rastogi</keyname>
+                        <forenames>Aditya</forenames>
+                </author>
+                <author>
+                    <keyname>Foltyn-Dumitru</keyname>
+                        <forenames>Martha</forenames>
+                </author>
+                <author>
+                    <keyname>Schlemmer</keyname>
+                        <forenames>Heinz-Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Reicht</keyname>
+                        <forenames>Ignaz</forenames>
+                </author>
+                <author>
+                    <keyname>Holzschuh</keyname>
+                        <forenames>Julius C.</forenames>
+                </author>
+                <author>
+                    <keyname>Bach</keyname>
+                        <forenames>Michael</forenames>
+                </author>
+                <author>
+                    <keyname>Stieltjes</keyname>
+                        <forenames>Bram</forenames>
+                </author>
+                <author>
+                    <keyname>Schlamp</keyname>
+                        <forenames>Kai</forenames>
+                </author>
+                <author>
+                    <keyname>Maier-Hein</keyname>
+                        <forenames>Lena</forenames>
+                </author>
+                <author>
+                    <keyname>Nolden</keyname>
+                        <forenames>Marco</forenames>
+                </author>
+                <author>
+                    <keyname>Floca</keyname>
+                        <forenames>Ralf</forenames>
+                </author>
+                <author>
+                    <keyname>Jäger</keyname>
+                        <forenames>Paul F.</forenames>
+                </author>
+                <author>
+                    <keyname>Vollmuth</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+                <author>
+                    <keyname>Isensee</keyname>
+                        <forenames>Fabian</forenames>
+                </author>
+                <author>
+                    <keyname>Maier-Hein</keyname>
+                        <forenames>Klaus H.</forenames>
+                </author>
+        </authors>
+        <title>nnFoundation: 3D Foundation Models for Radiology</title>
+            <categories>cs.CV eess.IV</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift. Foundation models promise more transferable and data-efficient solutions, but existing approaches are limited in scale, evaluated narrowly, and often assume that a single pretrained model can support diverse downstream tasks. Here we present nnFoundation, complementary convolutional and transformer-based 3D radiological foundation models. Developed within the Human Radiome Project (THRP), nnFoundation is trained on 2.1 million CT, MRI, and PET image volumes from 125 institutional and public datasets. We evaluate them across 108 tasks spanning segmentation, detection, classification, report generation, and image retrieval, including evaluations under domain shift, by external partners and in low-data and low-compute regimes. Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging. However, performance follows a consistent task-dependent structure: the convolutional nnFoundation model dominates spatially localized tasks, whereas the transformer-based nnFoundation model excels in tasks requiring global semantic reasoning and in frozen-feature settings. Dynamically aligning the foundation model topology with the dataset characteristics post-hoc further improves transfer across heterogeneous 3D settings. These results show that transferable 3D radiological performance is governed not by a single universal model, but by the interplay of scalable pretraining, complementary architectures, and dataset-aware adaptation. We release nnFoundation models integrated into nnU-Net and nnDetection, enabling immediate application across established radiology workflows.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.txt b/research/fog-of-knowledge/data/evidence/snapshots/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.txt
new file mode 100644
index 000000000..406cbc9d1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:58Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.16290" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.16290</identifier>
+        <datestamp>2026-08-18</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.16290</id>
+        <created>2026-08-17</created>
+            <updated>2026-08-18</updated>
+        <authors>
+                <author>
+                    <keyname>Hatami</keyname>
+                        <forenames>Mohammad</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Nhan Thanh</forenames>
+                </author>
+                <author>
+                    <keyname>Juntti</keyname>
+                        <forenames>Markku</forenames>
+                </author>
+        </authors>
+        <title>Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols</title>
+            <categories>eess.SP</categories>
+            <comments>5 pages, 3 figures. Accepted for presentation at the IEEE SPAWC 2026 conference</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper investigates the joint design of beamforming and radar receive filters in a multiuser bistatic integrated sensing and communications (ISAC) system, aiming to maximize the minimum radar signal-to-interference-plus-noise ratio (SINR) under communications SINR and transmit power constraints. We consider two scenarios: transmitted signals are either known or unknown at the radar receiver. We develop tractable solutions to the resulting non-convex optimization problems in both cases. For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA). For the unknown case, we adopt an alternating optimization (AO) approach to jointly design the beamforming and receive filters. Numerical results demonstrate that, while both approaches achieve comparable performance under per-slot optimization, knowledge of the transmitted symbols provides significant gains in multi-slot processing via coherent integration. Moreover, the proposed ISAC designs perform close to the radar-only benchmark under moderate communication requirements.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.txt b/research/fog-of-knowledge/data/evidence/snapshots/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.txt
new file mode 100644
index 000000000..c650effcf
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d.txt
@@ -0,0 +1,38 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:29:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.25526" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.25526</identifier>
+        <datestamp>2026-07-29</datestamp>
+            <setSpec>cs:cs:CY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.25526</id>
+        <created>2026-07-28</created>
+            <updated>2026-07-29</updated>
+        <authors>
+                <author>
+                    <keyname>Chupilkin</keyname>
+                        <forenames>Maxim</forenames>
+                </author>
+        </authors>
+        <title>Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data</title>
+            <categories>cs.CY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>How should researchers measure the geopolitical preferences expressed by large language models (LLMs)? Existing audits commonly rely on surveys and simple tests, but international-relations research has long recognized that measuring geopolitical preferences is difficult and has developed methods for recovering them from observed choices. This paper applies a dynamic ordinal ideal-point approach from international relations, treating LLMs as respondents to the full texts of 5,555 divisive, recorded, adopted resolutions considered in regular sessions of the UN General Assembly from 1946 through 2025. Support ranges from 37.8% for DeepSeek to 97.3% for GPT-5. Surprisingly, in the twenty-first century, GPT-5, Claude Sonnet, and Gemini are closest among the permanent five to Russia; DeepSeek is closest to France; and all four are farthest from the United States. Among 2,104 resolutions opposed by the United States but supported by China and Russia/USSR, GPT-5 supported 96.1%, Gemini 83.4%, Claude Sonnet 65.2%, and DeepSeek 36.1%. The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.txt b/research/fog-of-knowledge/data/evidence/snapshots/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.txt
new file mode 100644
index 000000000..983532e97
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc.txt
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T03:00:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15052" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15052</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15052</id>
+        <created>2026-10-10</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Zakirzyanov</keyname>
+                        <forenames>Ruslan</forenames>
+                </author>
+        </authors>
+        <title>On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms</title>
+            <categories>eess.SY cs.SY</categories>
+            <doi>10.1109/RusAutoCon69876.2026.11707364</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The paper addresses the synthesis of a cost-optimal hardware architecture of the automated process control system (APCS) for continuous processes. The problem is formalized as the search for a minimum-cost rooted tree of devices subject to constraints on the number of I/O channels, the types and number of communication interfaces, the information capacity of processors, the regulation time and the reliability. The signals are grouped by control rooms. The problem is NP-hard, and a hybrid method is proposed that combines a deterministic hierarchy construction with a modified ant colony optimization (ACO) for device-type selection, enhanced by an adaptive heuristic. On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each. By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster. By the median cost, however, the deterministic-greedy baselines are more reliable (GA attains the best Friedman rank) because the cost of the ACO runs is highly variable. All differences are confirmed by the Friedman and Wilcoxon tests. The method targets the early-design search for the cheapest feasible architecture and synthesizes one within minutes at industrial scale (A up to 1086).</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.txt b/research/fog-of-knowledge/data/evidence/snapshots/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.txt
new file mode 100644
index 000000000..8cb0c8fd4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-12T05:30:46Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12779" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12779</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12779</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Zhu</keyname>
+                        <forenames>Quanyan</forenames>
+                </author>
+        </authors>
+        <title>Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems</title>
+            <categories>cs.GT cs.SY eess.SY</categories>
+            <comments>63 pages, 19 figures, 10 tables</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Large-scale strategic systems, such as maintenance workflows, cyber campaigns, and multi-agent AI pipelines, consist of many interactions whose outcomes determine which later interactions become possible, who takes part, and with what resources. We introduce game Petri nets, formalized as outcome-driven compositional game Petri nets (OCGPNs), to model and analyze such systems. Local games are attached to places of a colored Petri net, and a game-to-token interface converts each resolved game into typed tokens that enable, synchronize, or block subsequent games. For general, concurrent nets, we give an operational semantics and a structural theory based on invariants and Farkas certificates, which shows that guards can certify unreachability whereas incentive instruments can only change values. For sequential nets, the net induces a stochastic game on its game places. We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes. A composition calculus based on place fusion glues certificates across subnets and summarizes downstream subnets by their entry values. Two running examples, a maintenance workflow and an intrusion campaign derived from multi-resolution cyber-defense games, illustrate the theory, including the composition of a newly discovered attack scenario with an existing campaign.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.txt b/research/fog-of-knowledge/data/evidence/snapshots/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.txt
new file mode 100644
index 000000000..2d8631850
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008.txt
@@ -0,0 +1,62 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T03:01:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15072" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15072</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>cs:cs:ET</setSpec>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15072</id>
+        <created>2026-10-10</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Singh</keyname>
+                        <forenames>Chandan Kumar</forenames>
+                </author>
+                <author>
+                    <keyname>de Sena</keyname>
+                        <forenames>Arthur Sousa</forenames>
+                </author>
+                <author>
+                    <keyname>Uniyal</keyname>
+                        <forenames>Smriti</forenames>
+                </author>
+                <author>
+                    <keyname>Kumar</keyname>
+                        <forenames>Deepak</forenames>
+                </author>
+                <author>
+                    <keyname>Upadhyay</keyname>
+                        <forenames>Prabhat K.</forenames>
+                </author>
+                <author>
+                    <keyname>Latva-aho</keyname>
+                        <forenames>Matti</forenames>
+                </author>
+        </authors>
+        <title>UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC</title>
+            <categories>eess.SP cs.ET cs.PF cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In integrated sensing and communication (ISAC) systems, strict sensing requirements can substantially constrain the transmit power available for communication. A hybrid reconfigurable intelligent surface (HRIS) with passive reflection and active amplification capabilities mounted on an unmanned aerial vehicle (UAV) can enhance coverage and strengthen communication links in such power-limited regimes. Meanwhile, rate-splitting multiple access (RSMA) provides an effective transmission strategy for managing inter-user interference, particularly in dense multiuser wireless scenarios. Motivated by this, we analyze the performance of a UAV-mounted HRIS-assisted monostatic ISAC system employing RSMA scheme. We consider the imperfections in the channel state information and successive interference cancellation in the RSMA, which are inevitable in practical system implementations. We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels. These expressions reveal key insights into the diversity order and coding gain of the system in the high signal-to-noise ratio regime. To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound. Numerical results validate the theoretical findings and highlight the performance gains of the proposed system over conventional multiple-access schemes and RIS-based systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.txt b/research/fog-of-knowledge/data/evidence/snapshots/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.txt
new file mode 100644
index 000000000..6d2a984f8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28224" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28224</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28224</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Su</keyname>
+                        <forenames>Yanpeng</forenames>
+                </author>
+                <author>
+                    <keyname>Lübke</keyname>
+                        <forenames>Maximilian</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Mengyu</forenames>
+                </author>
+                <author>
+                    <keyname>Franchi</keyname>
+                        <forenames>Norman</forenames>
+                </author>
+        </authors>
+        <title>CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents a Cramér-Rao lower bound (CRLB)-driven beamforming (BF) and power allocation (PA) framework for cooperative integrated sensing and communication (ISAC) networks, where a set of multi-antenna base stations (BSs) jointly serve multiple users and simultaneously perform multi-static target estimation. In our design, we investigate how the position error bound (PEB) and velocity error bound (VEB) can be exploited and incorporated into BF and PA optimization. The design leveraging PEB and VEB as metrics directly characterizes sensing accuracy. First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions. Addressing the complexity, we further develop a two-stage PA algorithm, where the communication and sensing beams are formed by the regularized zero-forcing (RZF) and null-space projection (NSP) methods, respectively, and the communication and sensing PAs are solved sequentially by second-order cone programming (SOCP). Although the PA algorithm sacrifices the degrees of freedom, its performance shows a slight gap compared to BF in the simulation, while the execution time of around 25 ms demonstrates its applicability in dynamic environments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.txt b/research/fog-of-knowledge/data/evidence/snapshots/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.txt
new file mode 100644
index 000000000..2b71cff45
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524.txt
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.36354" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.36354</identifier>
+        <datestamp>2026-09-30</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:CE</setSpec>
+            <setSpec>q-bio:q-bio:BM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.36354</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-30</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Jiarui</forenames>
+                </author>
+                <author>
+                    <keyname>Yin</keyname>
+                        <forenames>Zixiang</forenames>
+                </author>
+                <author>
+                    <keyname>Landry</keyname>
+                        <forenames>Samuel</forenames>
+                </author>
+                <author>
+                    <keyname>Ding</keyname>
+                        <forenames>Zhengming</forenames>
+                </author>
+                <author>
+                    <keyname>Mettu</keyname>
+                        <forenames>Ramgopal</forenames>
+                </author>
+        </authors>
+        <title>Explainability from Training with Applications to TCR-Epitope Prediction</title>
+            <categories>cs.LG cs.AI cs.CE q-bio.BM</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks. Existing methods for interpretability provide limited insight into how models organize evidence and evolve during learning. We introduce explainability from training (EFT), a model-agnostic paradigm that traces model interpretation during training to explain why models rely on specific features and how they organize these features as predictive evidence. We apply EFT to four state-of-the-art T cell receptor (TCR)-epitope prediction models, TCR-SRIM, TULIP, MixTCRpred, and NetTCR-2.2, spanning post-hoc and interpret-by-design approaches as well as transformers and CNNs. To investigate how structural information affects model explanations, we introduce a benchmark, TCR-XAI2, containing 388 unique experimentally resolved TCR-epitope structures, complemented by structures predicted using AlphaFold3, Boltz-2, TCRModel2, tFold-TCR, and OpenFold3. Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.txt b/research/fog-of-knowledge/data/evidence/snapshots/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.txt
new file mode 100644
index 000000000..3128557ed
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.18060" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.18060</identifier>
+        <datestamp>2026-08-19</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.18060</id>
+        <created>2026-08-18</created>
+            <updated>2026-08-19</updated>
+        <authors>
+                <author>
+                    <keyname>Hirsch</keyname>
+                        <forenames>Dylan</forenames>
+                </author>
+                <author>
+                    <keyname>Sharpless</keyname>
+                        <forenames>William</forenames>
+                </author>
+                <author>
+                    <keyname>Lee</keyname>
+                        <forenames>Donggun</forenames>
+                </author>
+                <author>
+                    <keyname>Herbert</keyname>
+                        <forenames>Sylvia</forenames>
+                </author>
+        </authors>
+        <title>Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this work, we introduce the generalized reach-avoid (GRA) task, which both extends and unifies the canonical tasks of Hamilton-Jacobi Reachability (HJR). We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR. Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks. We additionally show that the GRA is also a natural primitive to consider from a PDE perspective, as it can be used to represent all sufficiently regular solutions of the HJ-PDE that is canonical to HJR. Collectively, the results in this work show the theoretical and practical utility of this task within the increasingly important framework of HJR.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.txt b/research/fog-of-knowledge/data/evidence/snapshots/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.txt
new file mode 100644
index 000000000..77ea00dc4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496.txt
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T20:54:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.13402" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.13402</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.13402</id>
+        <created>2026-10-09</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Hua</keyname>
+                        <forenames>Thien Duc</forenames>
+                </author>
+                <author>
+                    <keyname>Mohammadi</keyname>
+                        <forenames>Mohammadali</forenames>
+                </author>
+                <author>
+                    <keyname>Ngo</keyname>
+                        <forenames>Hien Quoc</forenames>
+                </author>
+                <author>
+                    <keyname>Matthaiou</keyname>
+                        <forenames>Michail</forenames>
+                </author>
+        </authors>
+        <title>Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas</title>
+            <categories>eess.SP cs.IT math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose a coupling-aware tri-hybrid precoding architecture for simultaneous wireless information and power transfer (SWIPT) using reconfigurable parasitic antennas. By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain. To efficiently optimize this architecture, we propose a low-complexity tri-hybrid solution comprising coordinate descent (CD) for parasitic reactive load optimization, a singular value decomposition (SVD)-based analog precoder, and a protective partial zero-forcing (PPZF) digital precoder. Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array. Moreover, the proposed tri-hybrid architecture significantly outperforms hybrid precoding by constructively exploiting the coupling effects, yielding substantial gains in spectral efficiency (SE) and sum non-linear harvested energy (NLHE) at a fraction of the hardware cost.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.txt b/research/fog-of-knowledge/data/evidence/snapshots/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.txt
new file mode 100644
index 000000000..772b9ec6c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04242" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04242</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04242</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Kopp</keyname>
+                        <forenames>Fionna B.</forenames>
+                </author>
+                <author>
+                    <keyname>Schalkamp</keyname>
+                        <forenames>Ann-Kathrin</forenames>
+                </author>
+                <author>
+                    <keyname>Azzam</keyname>
+                        <forenames>Shadera</forenames>
+                </author>
+                <author>
+                    <keyname>Rudrapatna</keyname>
+                        <forenames>Vivek</forenames>
+                </author>
+                <author>
+                    <keyname>Borrelli</keyname>
+                        <forenames>Francesco</forenames>
+                </author>
+        </authors>
+        <title>Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The clinical management of chronic disease is naturally structured as a feedback control problem. Physicians observe the disease state at clinic visits and make decisions based on the patient&#39;s history and current state. We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates. We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis. Using the learned model, we formulate therapy selection as a model predictive control problem (MPC) that maximizes the expected time spent in inactive disease states, and we evaluate the resulting policy. In closed-loop simulation on 10 patients, the MPC achieves a cost at or below the observed clinical course in the majority of its realizations for 4 of the 10 patients, and its outcomes in all cases are comparable to observed care and within clinical guidelines.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.txt b/research/fog-of-knowledge/data/evidence/snapshots/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.txt
new file mode 100644
index 000000000..b57b665f2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28833" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28833</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28833</id>
+        <created>2026-07-30</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Gutowski</keyname>
+                        <forenames>Willa</forenames>
+                </author>
+                <author>
+                    <keyname>Foltz</keyname>
+                        <forenames>Charles</forenames>
+                </author>
+                <author>
+                    <keyname>Koukpaizan</keyname>
+                        <forenames>Nicholson</forenames>
+                </author>
+                <author>
+                    <keyname>Peles</keyname>
+                        <forenames>Slaven</forenames>
+                </author>
+                <author>
+                    <keyname>Tsybina</keyname>
+                        <forenames>Eve</forenames>
+                </author>
+        </authors>
+        <title>Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>5 pages, 5 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system. While high peak electricity prices are an anticipated outcome, measurable under peak hour simulations, the high off peak prices are a significantly underestimated threat. We simulate different ramping conditions on a congestible 5000-bus system, based on a modified IEEE 118-bus grid, to show that, in the presence of fast ramping loads and slow ramping generation, datacenters can aggravate latent load pockets. This results in unexpectedly high system costs during periods outside of datacenter peak. We test the datacenter effects using two distinct load conditions. We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%. These findings are of extreme importance as they reveal the hidden costs of preventively ramping slow generation in anticipation of datacenter load changes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.txt b/research/fog-of-knowledge/data/evidence/snapshots/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.txt
new file mode 100644
index 000000000..95c3a3ff7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T15:46:01Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.03008" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.03008</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>cs:cs:LO</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.03008</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Bombach</keyname>
+                        <forenames>Clemens</forenames>
+                </author>
+                <author>
+                    <keyname>Lakshmanan</keyname>
+                        <forenames>Rajmadan</forenames>
+                </author>
+                <author>
+                    <keyname>Ragni</keyname>
+                        <forenames>Marco</forenames>
+                </author>
+        </authors>
+        <title>Response Variability and Stability in Human Reasoning</title>
+            <categories>cs.LO cs.AI q-bio.NC</categories>
+            <comments>Accepted as full paper with talk at the 48th Annual Conference of the Cognitive Science Society (CogSci 2026). This version contains minor revisions</comments>
+            <journal-ref>Proceedings of the 48th Annual Meeting of the Cognitive Science Society (2026)</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science. We investigate the stability of response patterns within reasoners and whether variation in these patterns can be used to predict learning effects. We introduce a formal, geometry-based method to quantify distances between individual reasoning patterns and their internal variability, grounded in heuristic theories. The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains. Moreover, we find that reasoning patterns are stable over time within the same reasoner. The method is general enough to be applied to other reasoning domains.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.txt b/research/fog-of-knowledge/data/evidence/snapshots/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.txt
new file mode 100644
index 000000000..cf004e98d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5.txt
@@ -0,0 +1,63 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23085" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23085</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23085</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Siddiqui</keyname>
+                        <forenames>Muhammad Abdur Rab</forenames>
+                </author>
+                <author>
+                    <keyname>Rojas</keyname>
+                        <forenames>Daniela</forenames>
+                </author>
+                <author>
+                    <keyname>Yang</keyname>
+                        <forenames>Chen</forenames>
+                </author>
+                <author>
+                    <keyname>Cui</keyname>
+                        <forenames>Wenqi</forenames>
+                </author>
+                <author>
+                    <keyname>Shi</keyname>
+                        <forenames>Yuanyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Yize</forenames>
+                </author>
+        </authors>
+        <title>Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving</title>
+            <categories>cs.PF cs.DC cs.LG cs.SY eess.SY</categories>
+            <comments>16 pages, 10 figures, in submission</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Large language models (LLMs) and agentic AI systems are creating rapidly growing inference energy demands as model sizes grow and reasoning trajectories extend. While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption. In this paper, we investigate whether adaptive routing across a heterogeneous pool of LLMs can reduce this energy burden without substantially compromising task performance. We design a language-model-based router that reads in each query and selects an answer model from a fixed candidate pool. The candidate models are first profiled through an offline tournament that records their correctness, latency, power, and GPU energy for each query. Using these measurements, the router is trained through supervised fine-tuning followed by group relative policy optimization (GRPO) with the tailored paradigms. Results demonstrate that learned routing can selectively allocate expensive model capacity based on query context and improve the accuracy-energy tradeoff in multi-LLM serving. Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.txt b/research/fog-of-knowledge/data/evidence/snapshots/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.txt
new file mode 100644
index 000000000..677d829fd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:44Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28780" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28780</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>cs:cs:HC</setSpec>
+            <setSpec>cs:cs:CY</setSpec>
+            <setSpec>econ:econ:GN</setSpec>
+            <setSpec>q-fin:q-fin:EC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28780</id>
+        <created>2026-07-30</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Rosendo-Rios</keyname>
+                        <forenames>Veronica</forenames>
+                </author>
+                <author>
+                    <keyname>Shukla</keyname>
+                        <forenames>Paurav</forenames>
+                </author>
+        </authors>
+        <title>Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement</title>
+            <categories>cs.HC cs.CY econ.GN q-fin.EC</categories>
+            <comments>Accepted for publication in Psychology &amp; Marketing (January 2026). 44 pages, 4 figures, 3 tables</comments>
+            <doi>10.1002/mar.70105</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models. However, little is known about how alternative advertising-supported monetization models can help GenAI firms recover costs while maintaining search query engagement. Drawing on the compromise effect and affective primacy theories, we develop a framework wherein the introduction of advertising-supported monetization models influences user upgrading and downgrading decisions, contingent on the number of available monetization options. Across four experiments (N=1063), findings reveal that introducing a single advertising-supported option enhances the compromise effect, encouraging free users to upgrade, but leading paid subscribers to downgrade. However, offering two advertising-supported models mitigates the effect, maintaining subscriber retention while still motivating free users to upgrade. We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects. We provide actionable insights for GenAI firms on potentially optimizing revenue strategies while balancing user engagement with search queries on their platform.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.txt b/research/fog-of-knowledge/data/evidence/snapshots/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.txt
new file mode 100644
index 000000000..c17b3b28a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23199" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23199</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23199</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Bai</keyname>
+                        <forenames>Yiyang</forenames>
+                </author>
+                <author>
+                    <keyname>Awwad</keyname>
+                        <forenames>Élie</forenames>
+                </author>
+                <author>
+                    <keyname>Wigger</keyname>
+                        <forenames>Michèle</forenames>
+                </author>
+        </authors>
+        <title>LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems</title>
+            <categories>eess.SP</categories>
+            <doi>10.1109/JPHOT.2026.3734836</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Fiber Bragg grating (FBG)-based sensing enables localized strain and temperature monitoring by tracking the phase changes of the light reflected from FBGs inserted along a fiber. A major source of disturbance in such systems is laser phase noise, and its influence is typically mitigated by means of additional hardware. In this article, we propose to mitigate the influence of laser phase noise by means of digital signal processing. We propose a practical estimator for coherent single-polarization spread-spectrum FBG-based sensing systems, which is motivated by linearizing the complex received signal and approximating the loss function to formulate a minimum mean square error (MMSE) estimation problem. Moreover, a Cramer-Rao lower bound for this FBG-based estimation problem is presented. Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.txt b/research/fog-of-knowledge/data/evidence/snapshots/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.txt
new file mode 100644
index 000000000..7f15e5dcf
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.27536" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.27536</identifier>
+        <datestamp>2026-08-31</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>econ:econ:TH</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.27536</id>
+        <created>2026-08-27</created>
+            <updated>2026-08-31</updated>
+        <authors>
+                <author>
+                    <keyname>Salizzoni</keyname>
+                        <forenames>Giulio</forenames>
+                </author>
+                <author>
+                    <keyname>Cecchelli</keyname>
+                        <forenames>Domenico Mergoni</forenames>
+                </author>
+                <author>
+                    <keyname>Plumb</keyname>
+                        <forenames>Edward</forenames>
+                </author>
+                <author>
+                    <keyname>Kamgarpour</keyname>
+                        <forenames>Maryam</forenames>
+                </author>
+                <author>
+                    <keyname>Ashkenazi-Golan</keyname>
+                        <forenames>Galit</forenames>
+                </author>
+        </authors>
+        <title>Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games</title>
+            <categories>cs.GT econ.TH</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>While infinitely repeated games admit a rich set of Nash equilibria, finitely repeated games typically have a much smaller and often inefficient one. We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation. Paying these deposits is voluntary and incentive compatible at every stage, so no commitment by the players is assumed, the only commitment required being that of the intermediary to a refund rule fixed before play begins. The mechanism sustains payoff profiles more efficient than those of the standard equilibria, without altering the underlying game and without transfers between players. We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version. We also apply it to a dynamic common-pool resource, suggesting that the construction extends beyond repeated stage-games.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.txt b/research/fog-of-knowledge/data/evidence/snapshots/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.txt
new file mode 100644
index 000000000..0f1a6221b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4.txt
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:43Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.05348" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.05348</identifier>
+        <datestamp>2026-08-07</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.05348</id>
+        <created>2026-08-05</created>
+            <updated>2026-08-07</updated>
+        <authors>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Lin</forenames>
+                </author>
+                <author>
+                    <keyname>Hou</keyname>
+                        <forenames>I-Hong</forenames>
+                </author>
+        </authors>
+        <title>TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Optimizing for both low Age of Information (AoI) and high throughput is critical for remote sensing applications that rely on multichannel wireless networks. However, jointly optimizing these two metrics is an analytically challenging problem, particularly in systems with heterogeneous and unreliable channels. To address this challenge, we propose TSDM, a Two-Stage Deficit Matching scheduling framework. TSDM is based on a second-order approach that characterizes the performance of each data flow by its mean and temporal variance. In the first stage, TSDM translates the high-level utility maximization objective into a concrete set of target mean and temporal variance statistics for transmissions over each node-channel pair. In the second stage, a low-complexity Weighted Matching Deficit (WMD) rule performs real-time channel assignment. We theoretically prove that TSDM achieves the desired mean and temporal variance for each flow. Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems. In both cases, TSDM significantly outperforms existing scheduling policies.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.txt b/research/fog-of-knowledge/data/evidence/snapshots/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.txt
new file mode 100644
index 000000000..18261923e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:32:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.22049" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.22049</identifier>
+        <datestamp>2026-07-27</datestamp>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.22049</id>
+        <created>2026-07-24</created>
+            <updated>2026-07-27</updated>
+        <authors>
+                <author>
+                    <keyname>Schmidt</keyname>
+                        <forenames>Adrian</forenames>
+                </author>
+                <author>
+                    <keyname>Vermaas</keyname>
+                        <forenames>Pieter</forenames>
+                </author>
+                <author>
+                    <keyname>Seskir</keyname>
+                        <forenames>Zeki C.</forenames>
+                </author>
+        </authors>
+        <title>ELSA as an asset to the EU Quantum Act: A position paper</title>
+            <categories>physics.soc-ph</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Europe&#39;s expertise in the ethical, legal, and social aspects (ELSA) of emerging technologies is a strategic asset for the successful and sovereign development of quantum technologies. In this position paper, we argue that this expertise should become a central part of the upcoming EU Quantum Act. At a time when quantum technologies are becoming more powerful, economically relevant, and geopolitically contested, European policy should not reduce societal considerations to risk assessment and ex-post regulation. Instead, ELSA expertise can translate European values into technological practices, governance structures, and concrete policy measures, thereby supporting a development which is responsible, socially robust, and competitive. Taking inspiration from the role of concept cars, we present eight aspirational ELSA recommendations that demonstrate what a distinctly European approach to quantum technologies could offer. These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies. Together, we show that ELSA is not only about mitigating risks. It can also amplify benefits, increase legitimacy and societal acceptance, support economic prosperity, and contribute to a truly sovereign European quantum future.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.txt b/research/fog-of-knowledge/data/evidence/snapshots/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.txt
new file mode 100644
index 000000000..39550b07c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09.txt
@@ -0,0 +1,49 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-14T15:32:24Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.16273" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.16273</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>cs:cs:CL</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:AS</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.16273</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Naowarat</keyname>
+                        <forenames>Burin</forenames>
+                </author>
+                <author>
+                    <keyname>Tang</keyname>
+                        <forenames>Hao</forenames>
+                </author>
+                <author>
+                    <keyname>Goldwater</keyname>
+                        <forenames>Sharon</forenames>
+                </author>
+        </authors>
+        <title>Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory</title>
+            <categories>cs.CL cs.LG eess.AS</categories>
+            <comments>Accepted at SLT 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to identify a good subspace, nevertheless this result demonstrates much stronger implicit word knowledge in HuBERT than has previously been shown.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.txt b/research/fog-of-knowledge/data/evidence/snapshots/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.txt
new file mode 100644
index 000000000..0fd360d1a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:05Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.29972" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.29972</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>q-bio:q-bio:PE</setSpec>
+            <setSpec>physics:physics:med-ph</setSpec>
+            <setSpec>q-bio:q-bio:QM</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.29972</id>
+        <created>2026-09-24</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Polyakov</keyname>
+                        <forenames>Maxim</forenames>
+                </author>
+                <author>
+                    <keyname>Chernikova</keyname>
+                        <forenames>Yulia</forenames>
+                </author>
+        </authors>
+        <title>Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy</title>
+            <categories>q-bio.PE physics.med-ph q-bio.QM</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We develop and analyse a mechanistic ODE model of within-host HIV dynamics that includes uninfected CD4$^+$ T cells, latently and productively infected cells, free virions, and cytotoxic immune effectors. Antiretroviral therapy is described by two time-dependent efficacy functions that separately reduce new infections and virion production. We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state. We also obtain treatment-dependent suppression thresholds and an analytical estimate of when this threshold is crossed as treatment efficacy declines. Numerical simulations consider untreated infection, ART initiation, periodic variation in efficacy, and progressive loss of treatment effect. Without therapy, the model approaches a state of persistent infection. ART reduces viral load and promotes recovery of the CD4$^+$ T-cell population, while the latent reservoir persists under the parameter set considered. Periodic changes in treatment efficacy produce sustained forced oscillations. These results connect the analytical threshold conditions with the treatment-dependent dynamics of the model and provide a basis for future calibration, sensitivity analysis, uncertainty quantification, and extensions informed by clinical data.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.txt b/research/fog-of-knowledge/data/evidence/snapshots/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.txt
new file mode 100644
index 000000000..826f3b706
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029.txt
@@ -0,0 +1,61 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:32Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.17248" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.17248</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.17248</id>
+        <created>2026-07-31</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Atef</keyname>
+                        <forenames>Mohamed</forenames>
+                </author>
+                <author>
+                    <keyname>Alahakoon</keyname>
+                        <forenames>Sanath</forenames>
+                </author>
+                <author>
+                    <keyname>Mumtahina</keyname>
+                        <forenames>Umme</forenames>
+                </author>
+                <author>
+                    <keyname>Wolfs</keyname>
+                        <forenames>Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Khatib</keyname>
+                        <forenames>Tamer</forenames>
+                </author>
+                <author>
+                    <keyname>Uddin</keyname>
+                        <forenames>Moslem</forenames>
+                </author>
+        </authors>
+        <title>Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hydrogen-enabled community microgrids require coordinated control of intermittent renewable generation and coupled battery and hydrogen storage. This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup. Raw continuous actions are projected onto the feasible operating set before evaluating the hourly power balance, ensuring operationally valid dispatch.
+  The proof-of-concept study uses 8,760 hourly observations for a 1,000-household community in Rockhampton, Australia. The same annual chronology and one random seed were used for training and evaluation. Under a 1 percent independent hourly grid outage probability, the system achieved an annual net operating cash balance of AUD 195,690.67, load satisfaction of 99.77 percent, and a gross renewable share of 91.2 percent. After removing duplicated hydrogen electricity emissions, annual emissions were 1.342 kt CO2, equivalent to 0.328 kg CO2 per kWh of served demand and 0.087 kg CO2 per kWh of export-inclusive delivered energy.
+  At a 5 percent outage probability, the cash balance decreased to AUD 169,892.21 and load satisfaction fell to 98.79 percent. Battery discharge and diesel generation increased more than fuel cell output. The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.txt b/research/fog-of-knowledge/data/evidence/snapshots/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.txt
new file mode 100644
index 000000000..354edfb32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T20:37:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04776" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04776</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:NI</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04776</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Zehua</forenames>
+                </author>
+                <author>
+                    <keyname>Adve</keyname>
+                        <forenames>Raviraj</forenames>
+                </author>
+                <author>
+                    <keyname>Bahceci</keyname>
+                        <forenames>Israfil</forenames>
+                </author>
+                <author>
+                    <keyname>Ahmed</keyname>
+                        <forenames>Yahia</forenames>
+                </author>
+        </authors>
+        <title>Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks</title>
+            <categories>cs.IT cs.NI cs.SY eess.SY math.IT math.OC</categories>
+            <comments>To be presented at 2026 IEEE Globecom Workshops, 6 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.txt b/research/fog-of-knowledge/data/evidence/snapshots/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.txt
new file mode 100644
index 000000000..fbf936ffa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.22775" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.22775</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:AR</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.22775</id>
+        <created>2026-09-19</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Pham</keyname>
+                        <forenames>Thanh</forenames>
+                </author>
+                <author>
+                    <keyname>Islam</keyname>
+                        <forenames>Riadul</forenames>
+                </author>
+        </authors>
+        <title>DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks</title>
+            <categories>cs.AI cs.AR eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons. However, two challenges limit their practical deployment. First, fixed-parameter Leaky Integrate-and-Fire (LIF) neurons lack the adaptation mechanisms observed in biology, where neurons modulate their excitability based on firing history. Second, scaling from single neurons to multi-neuron networks introduces challenges in synaptic weight distribution and inter-neuron spike routing that are absent in isolated designs. This paper addresses both issues through the extension, verification, and physical implementation of adaptive LIF neurons at three architectural scales. This work contributes: a 2nd-order neuron with two-stage synaptic filtering for richer temporal dynamics; a fully-connected 6-neuron spiking network with configurable weights (100 to 5) demonstrating weight-based inter-neuron communication; and a direct verification methodology enabling per-cycle observation of all internal states. All designs were synthesized targeting Selected Area Electron Diffraction (SAED) 14 nm Complementary Metal-Oxide-Semiconductor (CMOS) technology at 1 GHz and verified with Cocotb-based Python testbenches under pulsed current stimuli (amplitude 80, ISI=3). The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\ 26 spikes). Physically, the 2nd-order neuron costs 1.77x more area and 1.52x more power than the 1st-order baseline, while the 6-neuron network demonstrates near-linear scaling (5.7x area, 5.3x power). Seven verification bugs spanning testbench connectivity, fixed-point overflow, and Verilog expression-width semantics are documented.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.txt b/research/fog-of-knowledge/data/evidence/snapshots/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.txt
new file mode 100644
index 000000000..3573ba3f0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.06066" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.06066</identifier>
+        <datestamp>2026-09-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.06066</id>
+        <created>2026-09-05</created>
+            <updated>2026-09-09</updated>
+        <authors>
+                <author>
+                    <keyname>Camargo</keyname>
+                        <forenames>Romina Garcia</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Zhiyang</forenames>
+                </author>
+                <author>
+                    <keyname>Ribeiro</keyname>
+                        <forenames>Alejandro</forenames>
+                </author>
+        </authors>
+        <title>Scalability of Graph Neural Network Policies in Wireless Communication Networks</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings. Scalability theories rely on dense graphon limits or continuous manifold approximations, both of which fail under the sparse, bounded-degree regimes and Euclidean metric constraints of physical wireless environments. This paper establishes a theoretical framework for GNN transferability over sparse Random Geometric Graphs (RGGs), capturing distance-dependent channel decay and spatial interference. We model sparse RGGs as spatial perturbations of regular Deterministic Grid Graphs (DGGs) and employ spatial windowing operators to compare networks across differing scales. Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs. Combining these results establishes formal scalability bounds across sparse RGG topologies. Finally, we extend this framework to conflict graph models, deriving equivalent scalability guarantees for link-level resource allocation policies. We verify our results for scalability with two experiment settings: power allocation and wireless link scheduling. The simulations show GNNs exhibit the expected scalable behavior, and analyze the relevance of our theoretical assumptions in practical deployment.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.txt b/research/fog-of-knowledge/data/evidence/snapshots/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.txt
new file mode 100644
index 000000000..67bb8f798
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f.txt
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-13T08:17:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.11869" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.11869</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+            <setSpec>math:math:ST</setSpec>
+            <setSpec>stat:stat:TH</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.11869</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Ruwanpathirana</keyname>
+                        <forenames>Aravinda Kanchana</forenames>
+                </author>
+                <author>
+                    <keyname>Tyagi</keyname>
+                        <forenames>Hemant</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Sunny G. W.</forenames>
+                </author>
+        </authors>
+        <title>Learning structured linear dynamical systems from missing observations</title>
+            <categories>stat.ML cs.LG cs.SY eess.SY math.OC math.ST stat.TH</categories>
+            <comments>62 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider the problem of learning structured linear dynamical systems over convex sets $\mathcal{K}$, where only a small subset of the observations are available at each time point. An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed. Non-asymptotic bounds are obtained for the statistical error, which depend on the local complexity of $\mathcal{K}$, the trajectory length $T$, and the sub-sampling probability $p$. Convergence of the projected gradient descent algorithm is also established. The general theory is applied to settings where (i) $\mathcal{K}$ is a subspace, (ii) $\mathcal{K}$ is the set of bi-isotonic matrices, and (iii) $\mathcal{K}$ is the set of matrices whose rows are formed by sampling Lipschitz functions. We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.txt b/research/fog-of-knowledge/data/evidence/snapshots/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.txt
new file mode 100644
index 000000000..34e675e3b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:27Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.08599" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.08599</identifier>
+        <datestamp>2026-08-11</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.08599</id>
+        <created>2026-08-09</created>
+            <updated>2026-08-11</updated>
+        <authors>
+                <author>
+                    <keyname>Fadakar</keyname>
+                        <forenames>Alireza</forenames>
+                </author>
+                <author>
+                    <keyname>Molisch</keyname>
+                        <forenames>Andreas F.</forenames>
+                </author>
+        </authors>
+        <title>Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System</title>
+            <categories>eess.SP</categories>
+            <comments>4 pages, 3 figures, Accepted for publication in the 2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</comments>
+            <journal-ref>2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Electromagnetically reconfigurable fluid antenna system (ER-FAS) provides additional electromagnetic (EM)-domain degrees of freedom by enabling dynamic control of per-element radiation patterns, thereby improving power efficiency in wireless communications. The effective exploitation of these capabilities, however, critically depends on accurate channel estimation, which has received limited attention in prior studies. This paper presents a low-complexity channel parameter estimation framework for downlink wideband systems that leverages available channel sparsity. A synthesis-based reconfigurability model is considered, where each antenna generates desired beampatterns using a finite set of EM basis functions. Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters. Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.txt b/research/fog-of-knowledge/data/evidence/snapshots/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.txt
new file mode 100644
index 000000000..5a1ab78f6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61.txt
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:38Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16353" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16353</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16353</id>
+        <created>2026-09-14</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Martin</keyname>
+                        <forenames>Andrea</forenames>
+                </author>
+                <author>
+                    <keyname>Fabiani</keyname>
+                        <forenames>Filippo</forenames>
+                </author>
+                <author>
+                    <keyname>Belgioioso</keyname>
+                        <forenames>Giuseppe</forenames>
+                </author>
+        </authors>
+        <title>Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Operator splitting methods are a fundamental class of algorithms for solving structured monotone inclusion problems arising in optimization, control, and game theory. We consider the case, common in stochastic regimes, where the forward evaluation of one of the constituent operators is either unavailable in closed form or computationally expensive to evaluate, and is therefore approximated using a finite number of noisy oracle samples. We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms. Unlike previous works, our analysis directly controls the residual error via martingale inequalities instead of relying on algorithmic stability arguments for a tailored surrogate loss, yielding the first a priori certificates whose statistical excess provably vanishes with the sample size. We further show that, under linear convergence of the Davis-Yin splitting algorithm, the dependence of our bounds on the iteration count improves from linear growth to exponential decay. We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.txt b/research/fog-of-knowledge/data/evidence/snapshots/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.txt
new file mode 100644
index 000000000..e647726d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098.txt
@@ -0,0 +1,45 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T08:37:33Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.15934" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.15934</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.15934</id>
+        <created>2026-10-11</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Manas</keyname>
+                        <forenames>Kumar</forenames>
+                </author>
+                <author>
+                    <keyname>Paschke</keyname>
+                        <forenames>Adrian</forenames>
+                </author>
+        </authors>
+        <title>Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>8 pages</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Motion planning for automated vehicles in interactive traffic has to simultaneously ensure safety, respect traffic rules, and maintain comfortable progress under multi-modal behavior uncertainty. Imposing all these requirements as hard constraints reduces feasibility, whereas treating them all as costs allows safety-critical requirements to be traded against progress. We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor. This retains robustness to discrete interaction modes without branch-specific contingent ego policies. We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective. Closed-loop Monte Carlo evaluation over six highway and intersection scenarios shows the highest strict success rate among the compared planners with no observed collisions or rule violations, at roughly a quarter of the planning latency of the unoptimized formulation. An ablation study separates the two layers: the hard constraints define the safety envelope, while the soft terms improve clearance and motion quality within it.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.txt b/research/fog-of-knowledge/data/evidence/snapshots/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.txt
new file mode 100644
index 000000000..c3b0a86dc
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12398" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12398</identifier>
+        <datestamp>2026-08-14</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12398</id>
+        <created>2026-08-08</created>
+            <updated>2026-08-14</updated>
+        <authors>
+                <author>
+                    <keyname>Varma</keyname>
+                        <forenames>Subir</forenames>
+                </author>
+        </authors>
+        <title>A Hierarchical Energy-Based Model for Multimodal Cognition</title>
+            <categories>q-bio.NC cs.AI</categories>
+            <comments>48 pages, 14 figures</comments>
+            <msc-class>I.2</msc-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose IM-LEPP (Integrated Multimodal Latent Energy-based Predictive Processing), a hierarchical, energy-based model of multimodal cognition that extends a previously proposed single-modality model (LEPP) to integrate vision and language. Following the view that generative neural networks are effective theories of cognitive dynamics, analogous to how statistical mechanics relates to thermodynamics, IM-LEPP models cognition as latent states flowing through learned energy landscapes rather than as an account of neural circuitry. The architecture is a hub-and-spoke hierarchy, grounded in the controlled semantic cognition framework of Lambon Ralph et al., in which predictive-coding pipelines for visual objects, scenes, and linguistic units converge on a shared amodal hub modeled on the anterior temporal lobe. Each pipeline&#39;s own prediction is conditioned by, rather than overwritten by, the current hub state, preserving pipeline-specific identity while letting every prediction reflect the full multimodal context. We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction. We also discuss data-efficient language acquisition relative to LLMs, outline a semantic/episodic memory subsystem, situate the model against predictive coding, the free-energy principle, JEPA, and Hierarchical Temporal Memory, and propose concrete experimental predictions to test its central claims Key Words: predictive processing; predictive coding; energy-based models; diffusion models; effective theory; computational neuroscience.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.txt b/research/fog-of-knowledge/data/evidence/snapshots/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.txt
new file mode 100644
index 000000000..6cee7378f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45.txt
@@ -0,0 +1,59 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:50Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.18396" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.18396</identifier>
+        <datestamp>2026-08-20</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.18396</id>
+        <created>2026-08-18</created>
+            <updated>2026-08-20</updated>
+        <authors>
+                <author>
+                    <keyname>Ashtekar</keyname>
+                        <forenames>Amod</forenames>
+                </author>
+                <author>
+                    <keyname>Davis</keyname>
+                        <forenames>Dalton</forenames>
+                </author>
+                <author>
+                    <keyname>Lomboy</keyname>
+                        <forenames>Rafaela</forenames>
+                </author>
+                <author>
+                    <keyname>Ibrahim</keyname>
+                        <forenames>Omar</forenames>
+                </author>
+                <author>
+                    <keyname>Bandari</keyname>
+                        <forenames>Raj Sai Sohel</forenames>
+                </author>
+                <author>
+                    <keyname>Eltayeb</keyname>
+                        <forenames>Mohammed E.</forenames>
+                </author>
+        </authors>
+        <title>LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Highly directional 60-GHz Internet-of-Things (IoT) links can exploit naturally occurring indoor surfaces to sustain connectivity under blockage. Identifying viable non-line-of-sight (NLoS) paths, however, can require extensive RF beam training. This paper investigates whether LiDAR can reduce this search overhead by providing a surface-aware prior without assuming a direct mapping between optical return and mmWave reflection. The proposed framework uses LiDAR-derived geometry and return statistics to rank candidate propagation directions, while RF measurements remain responsible for final beam selection. The experimental validation is organized in three stages to separate descriptor robustness, cross-modal association, and beam-search performance. Controlled LiDAR measurements first quantify how geometric and radiometric surface descriptors vary with acquisition geometry. Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction. Finally, a separate room-scale campaign evaluates the resulting prior using exhaustive TX-RX beam maps without prescribing the underlying propagation mechanism. The measurements show that descriptor reliability depends on acquisition geometry and point-cloud representation, and that LiDAR and RF surface responses exhibit cross-modal association without supporting deterministic RF-power prediction. In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region. These results establish LiDAR-derived local surface structure as a communication-oriented prior for concentrating RF probing and reducing mmWave beam-search uncertainty.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.txt b/research/fog-of-knowledge/data/evidence/snapshots/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.txt
new file mode 100644
index 000000000..91163fd32
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-11T06:06:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.07616" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.07616</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.07616</id>
+        <created>2026-10-06</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Siyuan</forenames>
+                </author>
+        </authors>
+        <title>Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>8 pages, 7 figures, 3 tables</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We present a repertoire-free benchmark for soft-robot damage recovery under nine online trials. The protocol pairs damage masks within each morphology, retains a measured nominal fallback, and separates method development from evaluation on new bodies. A Gaussian-process expected-improvement (GP-EI) reference controller adapts actuator phases using three initialization probes and six feedback-selected rollouts. Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets. GP-EI improves the worst-mask gain on 69/75 confirmation bodies and exceeds these four baselines by 0.235-0.310 mean worst-mask reward. A TuRBO-style local GP is the closest comparator; the paired confidence interval includes zero. Post-confirmation fixed-controller replay finds 5.06 voxel widths of mean recovery together with a 0.0031 increase in worst-mask p99 geometric edge strain; a strict no-added-demand deployment gate retains 48.7% of mean gain. In a frozen development stress test that physically removes 10% of occupied voxels, GP-EI improves 71/75 bodies and exceeds official BoTorch TuRBO by 0.356 mean worst-mask gain. Together, the replayable controllers, body-level inference, and frozen-cohort evaluation provide a reference for measuring the added value of learned damage priors and future adaptation methods.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.txt b/research/fog-of-knowledge/data/evidence/snapshots/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.txt
new file mode 100644
index 000000000..96055a0f1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:29Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.00959" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.00959</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.00959</id>
+        <created>2026-08-02</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Fridovich-Keil</keyname>
+                        <forenames>David</forenames>
+                </author>
+        </authors>
+        <title>MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems</title>
+            <categories>cs.GT cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics. The dominant solver for problems of this form is PATH, which offers strong performance on robotics problems but remains closed-source. We present MixedComplementarityProblems.jl, an open-source, pure Julia implementation of an interior point method for parametric MCPs that: (i) matches PATH&#39;s reliability on standard benchmarks, (ii) natively supports batched, parallel processing of many parameter instances, either across CPU threads or on an NVIDIA GPU, and (iii) supports efficient automatic differentiation of solutions with respect to problem parameters. On a multi-agent lane-change trajectory game representative of robotics planning problems, our CPU-multithreaded batched solver clears a batch of parametric instances ~100x faster than sequential calls to PATH. A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence. We describe the solver&#39;s interior point formulation, the abstraction that lets a single solver implementation run unmodified across dense, batched-sparse, and single-large linear-algebra backends, and report benchmarks against PATH on both randomly generated quadratic programs and trajectory games.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.txt b/research/fog-of-knowledge/data/evidence/snapshots/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.txt
new file mode 100644
index 000000000..8be682135
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94.txt
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T11:16:14Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.17295" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.17295</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.17295</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Nair</keyname>
+                        <forenames>Nikhil</forenames>
+                </author>
+                <author>
+                    <keyname>Caradonna</keyname>
+                        <forenames>Daniele</forenames>
+                </author>
+                <author>
+                    <keyname>Mathew</keyname>
+                        <forenames>Anup Teejo</forenames>
+                </author>
+                <author>
+                    <keyname>Renda</keyname>
+                        <forenames>Federico</forenames>
+                </author>
+                <author>
+                    <keyname>Della Santina</keyname>
+                        <forenames>Cosimo</forenames>
+                </author>
+                <author>
+                    <keyname>Feliu-Talegon</keyname>
+                        <forenames>Daniel</forenames>
+                </author>
+        </authors>
+        <title>Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>7 pages, 6 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Continuum soft robots are highly nonlinear and underactuated systems, which makes stabilizing them around unstable equilibrium points difficult. This challenge becomes even greater in low stiffness regimes, where gravitational forces dominate elastic forces. In this letter, we explore whether optimal control can address these challenges using a computa- tionally efficient method suitable for real time use. We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives. This results in an efficient control framework for addressing the stabilization problem. Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.txt b/research/fog-of-knowledge/data/evidence/snapshots/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.txt
new file mode 100644
index 000000000..a22b118bd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8.txt
@@ -0,0 +1,71 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:28Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.19468" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.19468</identifier>
+        <datestamp>2026-09-18</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.19468</id>
+        <created>2026-09-16</created>
+            <updated>2026-09-18</updated>
+        <authors>
+                <author>
+                    <keyname>Hsu</keyname>
+                        <forenames>Tzu-Hsuan</forenames>
+                </author>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Zihuan</forenames>
+                </author>
+                <author>
+                    <keyname>Gupta</keyname>
+                        <forenames>Harshvardhan</forenames>
+                </author>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Ziqian</forenames>
+                </author>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Wei</forenames>
+                </author>
+                <author>
+                    <keyname>Chulukhadze</keyname>
+                        <forenames>Vakhtang</forenames>
+                </author>
+                <author>
+                    <keyname>Kramer</keyname>
+                        <forenames>Jack</forenames>
+                </author>
+                <author>
+                    <keyname>Hall</keyname>
+                        <forenames>Neal</forenames>
+                </author>
+                <author>
+                    <keyname>Lu</keyname>
+                        <forenames>Ruochen</forenames>
+                </author>
+        </authors>
+        <title>High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization</title>
+            <categories>eess.SP</categories>
+            <comments>10 pages, 9 figures, 2 tables. Submitted to IEEE Journal of Microelectromechanical Systems</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper presents the design, characterization, and large-signal measurement methodology of a high-order whip-mode flexural microresonator on a lithium tantalate-on-insulator (LTOI) unimorph platform. A tapered cantilever concentrates kinetic energy at the free tip through a structural velocity amplification effect, with a targeted whip mode at 9.175 MHz exhibiting a measured Q of 691 in air. The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies. In-air large-signal testing on a separate device confirms tip velocities up to 20 m/s before the reliable measurement range of the laser Doppler vibrometer (LDV) at the tapered tip is exceeded, while the device itself sustains drive levels up to 240 Vpp before failure. Transitioning to vacuum reveals photothermal-induced static bending of the LTOI cantilever under LDV laser illumination, an effect that prohibits direct velocity measurement for these resonators. Hence, it motivates an indirect extraction methodology to be implemented. In this work, a 3.85 times base-to-tip geometric amplification factor, independently calibrated at low drive, is applied to base velocity measurements to infer tip velocity under large-signal conditions. Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate. Large-signal failure-mode analysis identifies Pt/Au electrode melting at 210 Vpp as the current velocity ceiling. These results suggest that geometric amplification in high-order flexural modes offers a viable pathway toward the high proof-mass velocities targeted for next-generation MEMS inertial sensors.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.txt b/research/fog-of-knowledge/data/evidence/snapshots/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.txt
new file mode 100644
index 000000000..8c626d047
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029.txt
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-14T10:06:57Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.07307" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.07307</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.07307</id>
+        <created>2026-10-05</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Mahesh</keyname>
+                        <forenames>Karan</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Runyu</forenames>
+                </author>
+                <author>
+                    <keyname>Benjamin</keyname>
+                        <forenames>Michael R.</forenames>
+                </author>
+                <author>
+                    <keyname>Zardini</keyname>
+                        <forenames>Gioele</forenames>
+                </author>
+        </authors>
+        <title>Metric-Based Equilibrium Selection in Noncooperative Differentiable Games</title>
+            <categories>cs.GT cs.SY eess.SY</categories>
+            <comments>8 pages, 2 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Metric conditioning can change which equilibrium attracts learning dynamics without moving the equilibria of a differentiable game. We study how to use state-dependent symmetric positive-definite (SPD) metrics to select among known equilibria by keeping a designated equilibrium attracting while making a rival unstable. Building on classical results on matrix stability under positive-definite multiplication, we characterize when such destabilization is possible and show how restricting the metric to act independently on each player limits the stability changes that can be achieved at differential Nash equilibria. We then combine a stabilizing metric at the selected equilibrium with a destabilizing metric at the rival through smooth interpolation, yielding a single metric field that preserves every equilibrium of the game while assigning the desired local stability types. We also derive a step-size condition for implementing the method in discrete time. The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.txt b/research/fog-of-knowledge/data/evidence/snapshots/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.txt
new file mode 100644
index 000000000..b676d8214
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9.txt
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:29:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.26209" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.26209</identifier>
+        <datestamp>2026-07-30</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.26209</id>
+        <created>2026-07-28</created>
+            <updated>2026-07-30</updated>
+        <authors>
+                <author>
+                    <keyname>García-Morales</keyname>
+                        <forenames>Jan</forenames>
+                </author>
+                <author>
+                    <keyname>de la Fuente</keyname>
+                        <forenames>Alejandro</forenames>
+                </author>
+                <author>
+                    <keyname>Gualda</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Carro-Calvo</keyname>
+                        <forenames>Leopoldo</forenames>
+                </author>
+                <author>
+                    <keyname>Riera-Palou</keyname>
+                        <forenames>Felip</forenames>
+                </author>
+                <author>
+                    <keyname>Femenias</keyname>
+                        <forenames>Guillem</forenames>
+                </author>
+        </authors>
+        <title>Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks</title>
+            <categories>eess.SP</categories>
+            <comments>Author Accepted Manuscript. Published in IEEE Open Journal of the Communications Society. Available at https://doi.org/10.1109/OJCOMS.2026.3717118. Copyright 2026 IEEE</comments>
+            <doi>10.1109/OJCOMS.2026.3717118</doi>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads. Existing AP ON/OFF mechanisms--typically based on worst-case dimensioning or greedy heuristics--explore the combinatorial activation space inadequately, leading to suboptimal energy-efficiency outcomes. This paper introduces two evolutionary AP-selection strategies tailored to CF-mMIMO networks. The first, a constrained genetic algorithm (CGA), identifies the near-optimal subset of active APs for any fixed activation cardinality, while an outer search determines the globally optimal operating point. The second, a Pareto-driven genetic algorithm (PDGA), jointly optimizes spectral and energy efficiency by evolving a Pareto front over all feasible activation patterns. A detailed computational-complexity analysis is provided for both techniques. Simulations conducted under realistic spatially inhomogeneous traffic and considering both conjugate beamforming (CB) and minimum mean square error (MMSE) processing confirm consistent performance gains. The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere. These results highlight the strong potential of evolutionary optimization as a powerful and reliable approach for energy-efficient CF-mMIMO deployments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.txt b/research/fog-of-knowledge/data/evidence/snapshots/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.txt
new file mode 100644
index 000000000..2c488292e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.10254" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.10254</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:LO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.10254</id>
+        <created>2026-08-10</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Peper</keyname>
+                        <forenames>Jordan</forenames>
+                </author>
+                <author>
+                    <keyname>Kapadia</keyname>
+                        <forenames>Krish</forenames>
+                </author>
+                <author>
+                    <keyname>Gast</keyname>
+                        <forenames>James</forenames>
+                </author>
+                <author>
+                    <keyname>Howes</keyname>
+                        <forenames>Ethan</forenames>
+                </author>
+                <author>
+                    <keyname>Ruchkin</keyname>
+                        <forenames>Ivan</forenames>
+                </author>
+        </authors>
+        <title>A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems</title>
+            <categories>eess.SY cs.LO cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction. To transfer verification guarantees from the abstract model to the concrete CPS, the abstraction must conservatively approximate the concrete state space and behaviors. Hence, model-builders must maintain this soundness while balancing pessimism with tractability. However, they face several common pitfalls such as under-approximating the state space, under-approximating transitions, unsound pruning of &#34;degenerate&#34; behaviors, and improper specification lifting. This tutorial presents a pragmatic, conservative-by-construction workflow for building discrete abstractions of closed-loop dynamical systems. The workflow consists of four modular steps with interchangeable subroutines: (i) state-space partition and abstraction-function design, (ii) conservative transition construction via axis-aligned bounding boxes, polytopes, or sampling with PAC coverage certificates, (iii) mitigation of spurious transitions and self-loops using certified erasure and counterexample-guided abstraction refinement, and (iv) sound lifting of LTL specifications using may-must semantics. We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.txt b/research/fog-of-knowledge/data/evidence/snapshots/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.txt
new file mode 100644
index 000000000..bab696428
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02079" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02079</identifier>
+        <datestamp>2026-08-11</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02079</id>
+        <created>2026-08-03</created>
+            <updated>2026-08-11</updated>
+        <authors>
+                <author>
+                    <keyname>Şanlan</keyname>
+                        <forenames>Abdülbaki</forenames>
+                </author>
+                <author>
+                    <keyname>Altunkaya</keyname>
+                        <forenames>Ege C.</forenames>
+                </author>
+                <author>
+                    <keyname>Bağci</keyname>
+                        <forenames>Hasan T.</forenames>
+                </author>
+                <author>
+                    <keyname>Koyuncu</keyname>
+                        <forenames>Emre</forenames>
+                </author>
+                <author>
+                    <keyname>Özkol</keyname>
+                        <forenames>İbrahim</forenames>
+                </author>
+        </authors>
+        <title>TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In vision-aided navigation and visual-inertial odometry, the quality of triangulated three-dimensional feature positions is a fundamental prerequisite for state estimation accuracy. Triangulation becomes ill-conditioned or even impossible when a camera undergoes pure rotation without translation, or when the observed bearing vectors provide insufficient parallax. Even though visual-inertial odometry has been extensively studied, the active maintenance of feature-observability during navigation has not been sufficiently addressed in the literature. To address this gap, this study presents TANGO-VIO, a triangulation-aware navigation framework that embeds a log-determinant metric of the feature-wise stacked-bearing matrix into a control barrier function. In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction. The proposed architecture is evaluated through software-inthe- loop simulations and real flight experiments. The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter. Supplementary materials are available on the project webpage.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.txt b/research/fog-of-knowledge/data/evidence/snapshots/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.txt
new file mode 100644
index 000000000..e6c5a354d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:48Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28276" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28276</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>eess:eess:IV</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28276</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Huang</keyname>
+                        <forenames>Sin-Yu</forenames>
+                </author>
+                <author>
+                    <keyname>Wong</keyname>
+                        <forenames>Vincent W. S.</forenames>
+                </author>
+        </authors>
+        <title>Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming</title>
+            <categories>cs.IT cs.SY eess.IV eess.SY math.IT</categories>
+            <comments>Accepted by IEEE Transactions on Communications (TCOM)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Semantic communication is an emerging paradigm that can preserve the meaning of data during transmission. However, human users are often interested in specific semantic content based on their intent, and users&#39; intent is often not considered in current semantic coding design. Moreover, most of the existing semantic models are fine-tuned using specific datasets, which limits their generalization capability. Furthermore, how to prioritize semantically important features in large-scale multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems remains largely unexplored. To address the aforementioned challenges, in this paper, we propose a generalized query-oriented image semantic coding (QO-ISC) framework. In the proposed framework, the transmitter extracts features which are relevant to the user&#39;s query and the receiver reconstructs an image based on those features. We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations. We develop a semantic-aware hybrid beamforming (SA-HBF) algorithm to prioritize semantically important features for large-scale MIMO-OFDM system. When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.txt b/research/fog-of-knowledge/data/evidence/snapshots/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.txt
new file mode 100644
index 000000000..79f4e94d6
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.06918" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.06918</identifier>
+        <datestamp>2026-10-07</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.06918</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-07</updated>
+        <authors>
+                <author>
+                    <keyname>Maity</keyname>
+                        <forenames>Sreejeet</forenames>
+                </author>
+                <author>
+                    <keyname>Mitra</keyname>
+                        <forenames>Aritra</forenames>
+                </author>
+        </authors>
+        <title>Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We study federated reinforcement learning in which multiple agents interact with a common Markov decision process and communicate through a central server to collaboratively learn the optimal state-action value function. Our goal is to understand whether the sample-efficiency benefits of collaboration can be retained when a fraction of the agents behave adversarially and transmit arbitrarily corrupted information. To address this problem, we introduce Robust Async-Fed-Q, an epoch-based federated learning algorithm that combines variance-reduced estimation of the Bellman optimality operator at the agents with robust aggregation at the server. We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption. In particular, the effect of the adversarial agents decreases as the amount of data collected by each honest agent grows and eventually vanishes in the infinite-sample limit. We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning. We further extend our framework to accommodate single-trajectory Markovian sampling and heterogeneous partial coverage, where different agents may explore different regions of the state-action space and learning relies on their collective coverage. Finally, our epoch-based design substantially improves the best known communication complexity for federated Q-learning under asynchronous sampling.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.txt b/research/fog-of-knowledge/data/evidence/snapshots/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.txt
new file mode 100644
index 000000000..99fd2ffd7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3.txt
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04662" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04662</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04662</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Matheu</keyname>
+                        <forenames>Ryan</forenames>
+                </author>
+                <author>
+                    <keyname>Damera</keyname>
+                        <forenames>Sai Sandeep</forenames>
+                </author>
+                <author>
+                    <keyname>Baras</keyname>
+                        <forenames>John S.</forenames>
+                </author>
+                <author>
+                    <keyname>Belta</keyname>
+                        <forenames>Calin</forenames>
+                </author>
+        </authors>
+        <title>Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks</title>
+            <categories>eess.SY cs.RO cs.SY</categories>
+            <comments>9 pages, 6 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems. Many techniques exist for control synthesis according to temporal logic specifications, spanning a large variety of systems, including robotics. However, the vast majority of implementations are limited to Boolean temporal logics. Boolean temporal logic does not have an innate mechanism for quantifying abstention, rather verdicts are either definitively \textit{True} or \textit{False}. Recent work demonstrates that ternary logic is a capable formalism for reasoning about robotic behaviors, with the natural ability to classify uncertainty with the \textit{Unknown} literal. Ternary temporal logic is still in its infancy, with work limited to synthesis for linear systems and monitoring. This work proposes a probabilistic relaxation of ternary temporal logic that allows for value and gradient computation through the same network while retaining exact verdicts on actual data. The relaxed network can be used as an objective in gradient-based control synthesis for both offline and online robotic control applications. We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.txt b/research/fog-of-knowledge/data/evidence/snapshots/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.txt
new file mode 100644
index 000000000..3a2547675
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.28185" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.28185</identifier>
+        <datestamp>2026-07-31</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.28185</id>
+        <created>2026-07-30</created>
+            <updated>2026-07-31</updated>
+        <authors>
+                <author>
+                    <keyname>Chehreghani</keyname>
+                        <forenames>Mostafa Haghir</forenames>
+                </author>
+        </authors>
+        <title>Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks</title>
+            <categories>cs.LG cs.AI cs.IT math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Oversmoothing is a fundamental limitation of deep graph neural networks (GNNs), where repeated message passing causes node representations to become increasingly similar, eventually collapsing toward a low-dimensional subspace. This phenomenon limits the effective depth of message-passing architectures and motivates the search for mechanisms that preserve representation diversity. In this paper, we study a recurrent graph neural network in which independent Gaussian noise is injected after every propagation step and analyze the resulting architecture as a stochastic dynamical system. Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure. Our main theoretical result establishes an explicit positive lower bound on the expected stationary Dirichlet energy, proportional to both the noise variance and the spectral gap of the underlying graph. Consequently, the stationary representations cannot collapse onto the constant manifold, providing a rigorous guarantee that asymptotic oversmoothing is prevented in the sense of non-vanishing Dirichlet energy. Our analysis reveals persistent stochastic perturbations as a fundamentally different mechanism for combating oversmoothing, complementing existing deterministic approaches based on residual connections, normalization, and graph rewiring. Finally, numerical experiments on both linear and nonlinear recurrent graph neural networks closely match the theoretical predictions, illustrating the emergence of a stationary distribution and the predicted dependence of the limiting Dirichlet energy on the noise intensity.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.txt b/research/fog-of-knowledge/data/evidence/snapshots/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.txt
new file mode 100644
index 000000000..74d62d1b2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21093" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21093</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21093</id>
+        <created>2026-09-17</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Ahmed</keyname>
+                        <forenames>Nameer Fawwaz</forenames>
+                </author>
+                <author>
+                    <keyname>Fleming</keyname>
+                        <forenames>Cody</forenames>
+                </author>
+                <author>
+                    <keyname>Shoukry</keyname>
+                        <forenames>Yasser</forenames>
+                </author>
+        </authors>
+        <title>A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As Urban Air Mobility (UAM) systems scale toward high-density operations, managing autonomous Unmanned Aerial Vehicle (UAV) traffic requires control frameworks that are both tractable and safety-critical. This paper presents a principled optimal control-theoretic foundation for routing in multi-destination UAM networks subject to vertiport capacity and flow constraints. We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states. To ensure tractability, we employ a mean-field fluid approximation and derive the underlying system dynamics as a set of coupled ordinary differential equations. A key contribution of this work is the formal proof of the positive invariance of the queue-free state space. We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely. This result allows us to transform a complex, infinite-dimensional continuous-time optimal control problem into a tractable, finite-dimensional algebraic optimization. The resulting framework jointly optimizes for travel time and multi-hop efficiency while ensuring network-wide stability. We validate the approach by characterizing the steady-state flow equilibria and providing sufficient conditions for safe, congestion-free operation in large-scale mobility systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.txt b/research/fog-of-knowledge/data/evidence/snapshots/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.txt
new file mode 100644
index 000000000..c5fdcd043
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8.txt
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.11530" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.11530</identifier>
+        <datestamp>2026-09-11</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.11530</id>
+        <created>2026-09-10</created>
+            <updated>2026-09-11</updated>
+        <authors>
+                <author>
+                    <keyname>Marzulli</keyname>
+                        <forenames>M.</forenames>
+                </author>
+                <author>
+                    <keyname>Angiolelli</keyname>
+                        <forenames>A.</forenames>
+                </author>
+                <author>
+                    <keyname>Mannino</keyname>
+                        <forenames>C.</forenames>
+                </author>
+                <author>
+                    <keyname>Demuru</keyname>
+                        <forenames>M.</forenames>
+                </author>
+                <author>
+                    <keyname>Sorrentino</keyname>
+                        <forenames>P.</forenames>
+                </author>
+                <author>
+                    <keyname>Corsi</keyname>
+                        <forenames>M. -C.</forenames>
+                </author>
+        </authors>
+        <title>pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The analysis of neuronal avalanches offers insights into brain dynamics utilizing the framework of criticality, but the reproducibility and comparability of studies are limited by the use of fragmented, lab-specific scripts. To address this issue, we introduce pyAvalanches, an open-source Python package providing a standardized, end-to-end pipeline for avalanche analysis from electrophysiological recordings (e.g., electroencephalography-EEG). Starting from the detection of neuronal avalanches the package provides their core statistical characterization, including size and duration distributions. Beyond this, the main aim of pyAvalanches is to characterize the spatiotemporal organization of activity propagation during avalanches. To this end, the core innovation of pyAvalanches is the compuation of Avalanche Transition Matrices (ATMs) to map spatiotemporal propagation patterns. Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches. The entire workflow is encapsulated in a modular and scikit-learn compatible architecture. We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations. By providing a user-friendly, tested, and extensible tool, pyAvalanches facilitates reproducible research, enables the development of novel avalanche-based biomarkers, and makes complex avalanche analysis accessible to a broader scientific community. The package is fully documented and distributed via the Python Package Index (PyPI).</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.txt b/research/fog-of-knowledge/data/evidence/snapshots/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.txt
new file mode 100644
index 000000000..3e6214d70
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T21:11:01Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19515" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19515</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19515</id>
+        <created>2026-10-14</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Bin</forenames>
+                </author>
+                <author>
+                    <keyname>Wan</keyname>
+                        <forenames>Senning</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Decheng</forenames>
+                </author>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Yonglei</forenames>
+                </author>
+                <author>
+                    <keyname>Xue</keyname>
+                        <forenames>Yu</forenames>
+                </author>
+        </authors>
+        <title>Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>12 pages, 10 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this paper, we investigate a wireless communication network supported by multiple uncrewed aerial vehicles (UAVs). To ensure reliable connectivity, UAVs are desired to approach the boundaries of designated no-fly zones (NFZs) without violating them when mobile users (MUs) enter NFZs. To support heterogeneous communication services, MUs are assigned different priority levels based on their individual communication types. Considering the practical constraints arising from user mobility, heterogeneous communication requirements, and NFZs, the objective is to maximize the weighted sum of MU communication rates, where weights correspond to MU priorities. This is achieved by jointly optimizing trajectory planning, UAV transmission power control, and the binary association factor between UAVs and MUs. To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy. Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability. Moreover, it effectively meets diverse communication requirements, satisfies UAV energy constraints, and ensures reliable operation under NFZ constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.txt b/research/fog-of-knowledge/data/evidence/snapshots/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.txt
new file mode 100644
index 000000000..fcc7336b3
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T13:18:41Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.21653" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.21653</identifier>
+        <datestamp>2026-10-16</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.21653</id>
+        <created>2026-10-15</created>
+            <updated>2026-10-16</updated>
+        <authors>
+                <author>
+                    <keyname>Jing</keyname>
+                        <forenames>Zexuan</forenames>
+                </author>
+                <author>
+                    <keyname>Xiong</keyname>
+                        <forenames>Yifeng</forenames>
+                </author>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Fan</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Xuehua</forenames>
+                </author>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jianhua</forenames>
+                </author>
+        </authors>
+        <title>How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?</title>
+            <categories>cs.IT eess.SP math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Probabilistic constellation shaping (PCS), originally designed to fill the gap between finite uniform constellations and continuous capacity-achieving input distributions, has recently emerged as a central tool in adjusting the expected integrated sidelobe level (EISL) in integrated sensing and communication (ISAC). In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control. We further show that OFDM is almost the only unitary modulation basis whose codeword-wise ISLR can be precisely controlled by type-based PCS. Based upon the analytical results, practical type-based PCS methods compatible with the probabilistic amplitude shaping (PAS) framework are conceived, which achieve higher communication rates than existing ISAC-oriented PCS methods under identical ISLR constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.txt b/research/fog-of-knowledge/data/evidence/snapshots/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.txt
new file mode 100644
index 000000000..ee56a321c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f.txt
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.14144" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.14144</identifier>
+        <datestamp>2026-08-03</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.14144</id>
+        <created>2026-07-31</created>
+            <updated>2026-08-03</updated>
+        <authors>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Wenhui</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Jianlin</forenames>
+                </author>
+                <author>
+                    <keyname>Lin</keyname>
+                        <forenames>Ziyao</forenames>
+                </author>
+                <author>
+                    <keyname>Vong</keyname>
+                        <forenames>Chi Man</forenames>
+                </author>
+        </authors>
+        <title>The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale</title>
+            <categories>cs.AI cs.IT math.IT</categories>
+            <comments>43 pages, 16 figures. v2: title now names the hypothesis (CCH); postscript on two post-registration frontier releases (Kimi-K3, Qwen3.8-Max) with a registered forward prediction; new citations and consistency fixes. Registered census statistics and experimental results unchanged. Code and data: https://github.com/wenhui-ml/Capability-Convergence-Hypothesis (DOI: 10.5281/zenodo.21714418)</comments>
+            <acm-class>None</acm-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The Platonic Representation Hypothesis (PRH) holds that as models scale, representations of heterogeneous networks converge toward a shared model of reality. We propose its sequel and boundary, the Capability Convergence Hypothesis (CCH): under a fixed per-token inference budget, representational convergence does not entail capability convergence. Capability instead converges toward a class, the access-complete hybrid: any architecture holding both a compressive O(1)-state channel and a scalable verbatim-index channel. We anchor it on a witness task, the Newton&#39;s-apple problem in an infinite stream, and name three resource walls: a Shannon wall barring any o(Nb)-state architecture, a horizon wall barring any fixed window, and a circuit wall barring fixed-depth attention-only composition (conditional on TC0 != NC1). Under an explicit separability assumption a hybrid crosses all three by paying each wall&#39;s price, so capability is strictly super-additive under composition. We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture. We report the first pre-registered small-scale tests under criteria frozen before the data: the predicted scissors gap is measured (exact-retrieval error 0.994 vs. 0.000 once a 64-scalar state gains one global-attention layer), the state-tracking bifurcation lands at the registered boundary, and a conjunction witness shows an irreducibly two-channel solution; one prediction failed with its direction reversed and is reported as such. Representational convergence is given freely by scale; capability convergence must be purchased by access structure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.txt b/research/fog-of-knowledge/data/evidence/snapshots/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.txt
new file mode 100644
index 000000000..ad9708ee1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c.txt
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:02Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12037" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12037</identifier>
+        <datestamp>2026-08-13</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12037</id>
+        <created>2026-08-12</created>
+            <updated>2026-08-13</updated>
+        <authors>
+                <author>
+                    <keyname>Figueiredo</keyname>
+                        <forenames>Eduardo</forenames>
+                </author>
+                <author>
+                    <keyname>Mathiesen</keyname>
+                        <forenames>Frederik</forenames>
+                </author>
+                <author>
+                    <keyname>Schumann</keyname>
+                        <forenames>Julian</forenames>
+                </author>
+                <author>
+                    <keyname>Kober</keyname>
+                        <forenames>Jens</forenames>
+                </author>
+                <author>
+                    <keyname>Zgonnikov</keyname>
+                        <forenames>Arkady</forenames>
+                </author>
+                <author>
+                    <keyname>Laurenti</keyname>
+                        <forenames>Luca</forenames>
+                </author>
+        </authors>
+        <title>Clustered Randomized Smoothing for Stochastic Prediction Functions</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Modern stochastic predictors can model rich, multi-modal outcome distributions. However, this expressive power comes with challenges in ensuring robust predictions $-$ a critical requirement in safety-critical domains. Randomized smoothing is a leading technique for improving robustness, particularly against adversarial perturbations. Yet, in stochastic multi-modal regression settings, randomized smoothing often fails due to mode collapse, yielding averaged predictions that do not reflect the underlying distribution. To address this limitation, we propose clustered $α$-smoothing, a framework that (1) partitions noisy samples using an arbitrary clustering algorithm, (2) applies $α$-smoothing locally within each cluster, and (3) combines the resulting predictions into a mixture distribution. By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes. We empirically evaluate our framework on two benchmarks, demonstrating substantial improvements over state-of-the-art methods. In stochastic trajectory prediction on a driving simulator dataset, our approach achieves, on average, a $27\%$ lower Wasserstein distance to the ground-truth distribution compared to $α$-smoothing. In quadrotor control, where modes correspond to distinct feasible paths to a target, our method reduces the collision rate by $81\%$ relative to the state-of-the-art randomized smoothing.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.txt b/research/fog-of-knowledge/data/evidence/snapshots/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.txt
new file mode 100644
index 000000000..918e3ac11
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896.txt
@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.05763" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.05763</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.05763</id>
+        <created>2026-09-21</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Ganal</keyname>
+                        <forenames>Helen</forenames>
+                </author>
+                <author>
+                    <keyname>Becker</keyname>
+                        <forenames>Sarah</forenames>
+                </author>
+                <author>
+                    <keyname>Holzhauer</keyname>
+                        <forenames>Sascha</forenames>
+                </author>
+                <author>
+                    <keyname>Glißmann</keyname>
+                        <forenames>Thilo</forenames>
+                </author>
+                <author>
+                    <keyname>Krebs</keyname>
+                        <forenames>Friedrich</forenames>
+                </author>
+                <author>
+                    <keyname>Braun</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Härtel</keyname>
+                        <forenames>Philipp</forenames>
+                </author>
+        </authors>
+        <title>AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Submitted to Applied Energy</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Decarbonising the building sector is central to meeting climate targets, yet existing models rarely capture the interaction between system-level transformation dynamics and heterogeneous individual investment decisions. This work presents AgentHomeID, an agent-based model of building stock evolution in which owner behaviour, techno-economic constraints, and regulatory frameworks are represented explicitly at the level of individual buildings and their owners. The model differentiates owner-occupiers, private landlords, and institutional owners, using willingness-to-pay (WTP) parameters estimated from empirical decision-maker studies, and operates on both representative building archetypes and real building data derived from geographic information systems (GIS). We demonstrate this versatility across three applications. At national scale, scenario analysis for Germany to 2045 shows that removing binding renewable heating requirements substantially raises final energy demand even where envelope refurbishment is unchanged, and that subsidy allocation and investment activity diverge sharply across owner types and income quartiles, with the lowest quartiles persistently underinvesting. At regional scale, bottom-up simulation for a German distribution grid planning region yields spatially concentrated heat pump uptake at NUTS-3 level that differs from aggregated top-down projections in both magnitude and spatial distribution. At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks. Across all three scales, owner heterogeneity and local structure materially shape transition pathways, indicating that they should be represented explicitly in models used for policy assessment and infrastructure planning.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.txt b/research/fog-of-knowledge/data/evidence/snapshots/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.txt
new file mode 100644
index 000000000..a48895ca2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d.txt
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.35246" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.35246</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.35246</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Azam</keyname>
+                        <forenames>M. Furqan</forenames>
+                </author>
+                <author>
+                    <keyname>Vanin</keyname>
+                        <forenames>Marta</forenames>
+                </author>
+                <author>
+                    <keyname>Hermans</keyname>
+                        <forenames>Chris</forenames>
+                </author>
+                <author>
+                    <keyname>Deconinck</keyname>
+                        <forenames>Geert</forenames>
+                </author>
+        </authors>
+        <title>Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Preprint. Submitted to Sustainable Energy, Grids and Networks</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Robust and accurate state estimation is fundamental for the reliable operation and monitoring of active distribution networks. Conventional numerical estimators, such as weighted least squares, are computationally slower and often suffer from convergence issues in the presence of sparse measurements affected by non-Gaussian noise. Physics-informed neural networks have recently emerged as a promising alternative by incorporating physical principles through residual-based penalty terms in the objective, which can improve robustness to noise and computational efficiency. However, such penalty-based approaches do not guarantee strict enforcement of physical constraints during inference and provide limited support for principled uncertainty modeling. To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph. The proposed approach explicitly models non-Gaussian (pseudo-)measurement uncertainty through flexible, closed-form likelihood-based loss functions. It further incorporates a differentiable optimization-based estimation layer that strictly enforces nonlinear equality constraints and measurement consistency, producing physically feasible state estimates during both training and inference. To the best of our knowledge, this is the first PINN-based DSSE framework to combine hard physical constraints with non-Gaussian uncertainty modeling for unbalanced three-phase networks. Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.txt b/research/fog-of-knowledge/data/evidence/snapshots/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.txt
new file mode 100644
index 000000000..6b4f87e66
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.11929" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.11929</identifier>
+        <datestamp>2026-08-13</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.11929</id>
+        <created>2026-08-12</created>
+            <updated>2026-08-13</updated>
+        <authors>
+                <author>
+                    <keyname>Salehi</keyname>
+                        <forenames>Amin</forenames>
+                </author>
+                <author>
+                    <keyname>Seppanen</keyname>
+                        <forenames>Janne</forenames>
+                </author>
+                <author>
+                    <keyname>Pourakbari-Kasmaei</keyname>
+                        <forenames>Mahdi</forenames>
+                </author>
+        </authors>
+        <title>Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs). This becomes particularly of higher importance under transient disturbances. However, coordinated dynamic interactions of these coupled subsystems remain largely unexplored. This article addresses such gap by developing a dynamic model for an integrated electrolyzer-EDCS system and designing appropriate PID control schemes to address the potential disturbances affecting either component. To this end, linearized models of the electrolyzer and EDCS are first derived to enable systematic controller design. Then, two PID controllers, representing conservative and fast-tracking designs, are developed to coordinate the system response. The developed coordinated model is examined and verified under four different cases. The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer. Controlling the electrolyzer flow in response to EDCS disturbances coordinates system dynamics and mitigates undesirable transient fluctuations. Conversely, under electrolyzer disturbances, regulating the EDCS torque eliminates inconsistent responses in pressure, flow, and rotational speed, while preventing hazardous transient undershoots and overshoots. Overall, the proposed framework guarantees transient stability and operational reliability of the integrated electrolyzer-EDCS system.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.txt b/research/fog-of-knowledge/data/evidence/snapshots/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.txt
new file mode 100644
index 000000000..5aee1a194
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7.txt
@@ -0,0 +1,49 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T03:31:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.11175" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.11175</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.11175</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Kelkar</keyname>
+                        <forenames>Sachin Sunil</forenames>
+                </author>
+                <author>
+                    <keyname>Dokania</keyname>
+                        <forenames>Tanmay</forenames>
+                </author>
+                <author>
+                    <keyname>Nakka</keyname>
+                        <forenames>Yashwanth Kumar</forenames>
+                </author>
+        </authors>
+        <title>Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <comments>3 pages, 4 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>For autonomous space exploration, robotic agents need to perform motion planning in which environmental interactions may be unknown. Learning these interactions, such as terrain mechanics for wheeled robots, can introduce uncertainties that lead to risky motion plans and potentially hazardous operations or mission failures. Moreover, uncertainties induced by perception-based systems can exacerbate the problem of safe motion planning. In this letter, we address the problem of performing cost-optimal kinodynamic motion planning with risk awareness. We approach this in two steps. First, a sampling-based planner (AO-RRT) generates a dynamically feasible, risk-aware, and asymptotically cost-optimal trajectory. Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution. By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\sim$97\% across trajectories in simulation and hardware experiments.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.txt b/research/fog-of-knowledge/data/evidence/snapshots/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.txt
new file mode 100644
index 000000000..c24b024de
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c.txt
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.05481" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.05481</identifier>
+        <datestamp>2026-08-07</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.05481</id>
+        <created>2026-08-06</created>
+            <updated>2026-08-07</updated>
+        <authors>
+                <author>
+                    <keyname>Smith</keyname>
+                        <forenames>Andrew L.</forenames>
+                </author>
+                <author>
+                    <keyname>Jiang</keyname>
+                        <forenames>Linxing Preston</forenames>
+                </author>
+                <author>
+                    <keyname>Eshraghian</keyname>
+                        <forenames>Jason K.</forenames>
+                </author>
+                <author>
+                    <keyname>Bull</keyname>
+                        <forenames>Matthew S.</forenames>
+                </author>
+                <author>
+                    <keyname>Recanatesi</keyname>
+                        <forenames>Stefano</forenames>
+                </author>
+        </authors>
+        <title>From Local Learning to Global Prediction Through Layered Surprise Cascades</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hierarchical predictive coding proposes a compelling hypothesis of brain computation, suggesting that the cortex builds layered predictions to minimize surprise. Yet most models rely on error-coding neurons or generative modeling of unclear biological plausibility. Here, we examine a biologically plausible framework in which the functional goals of predictive coding emerge from local contrastive learning and simple activity cancellation. Building on recent machine learning advances, we present a recurrent variant of the Forward-Forward (FF) algorithm with an inverted objective that increases activity for negative data. This setup yields predictive representations across layers, capturing hallmark features of cortical computation such as top-down modulation and surprise signaling. Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.txt b/research/fog-of-knowledge/data/evidence/snapshots/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.txt
new file mode 100644
index 000000000..3eea78a9d
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2.txt
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-13T09:41:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12038" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12038</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12038</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Jayakumar</keyname>
+                        <forenames>Surya</forenames>
+                </author>
+                <author>
+                    <keyname>Narayanan</keyname>
+                        <forenames>Arun</forenames>
+                </author>
+                <author>
+                    <keyname>Dey</keyname>
+                        <forenames>Indrakshi</forenames>
+                </author>
+        </authors>
+        <title>Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks</title>
+            <categories>eess.SP</categories>
+            <comments>6 pages</comments>
+            <msc-class>94A12, 94A08</msc-class>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Access control in Internet of Things (IoT) sensor networks usually acts above the physical layer: the fusion centre decides which reports to accept, while the radio of a compromised node keeps occupying the shared channel. This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time. We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level. The locally optimum detector of out-of-subtree transmission in impulsive Class-A noise weights each leaf in proportion to this predicted leakage. We bound the time needed to confine a compromised node and derive the optimal tree depth. In simulation, with demoted nodes radiating within their allocation, the scheme lowers the probability of a false global decision by 68% relative to fixed-allocation WPDM and to OFDM with the same reputation tiers, and by 44% relative to cryptographic re-attestation, which leads once more than 24% of the sensors are compromised.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.txt b/research/fog-of-knowledge/data/evidence/snapshots/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.txt
new file mode 100644
index 000000000..84199852e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1.txt
@@ -0,0 +1,61 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:23Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.24423" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.24423</identifier>
+        <datestamp>2026-07-28</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>physics:physics:soc-ph</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.24423</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-28</updated>
+        <authors>
+                <author>
+                    <keyname>Van Liedekerke</keyname>
+                        <forenames>Ambra</forenames>
+                </author>
+                <author>
+                    <keyname>Zapparoli</keyname>
+                        <forenames>Lorenzo</forenames>
+                </author>
+                <author>
+                    <keyname>Herrera</keyname>
+                        <forenames>María Parajeles</forenames>
+                </author>
+                <author>
+                    <keyname>Gjorgiev</keyname>
+                        <forenames>Blazhe</forenames>
+                </author>
+                <author>
+                    <keyname>Hug</keyname>
+                        <forenames>Gabriela</forenames>
+                </author>
+                <author>
+                    <keyname>Sansavini</keyname>
+                        <forenames>Giovanni</forenames>
+                </author>
+        </authors>
+        <title>Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels</title>
+            <categories>eess.SY cs.SY physics.soc-ph</categories>
+            <comments>16 pages, 8 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems. Research on EV charging flexibility in future power systems has largely focused on either the transmission or the distribution level, with limited integration between the two. However, these two scales cannot be separated: EV charging optimized at the national transmission level for system-wide planning is ultimately activated in local distribution grids, where it may cause voltage and loading issues. This study bridges that gap by evaluating EV charging flexibility across both grid levels, using two different control approaches. First, a top-down approach disaggregates the optimal charging demand obtained from a centralized planner at the transmission grid down to the distribution grid, explicitly accounting for grid constraints and individual driving requirements. Second, a bottom-up approach optimizes EV charging locally under distribution-grid constraints using electricity price signals from the centralized planning model. Controlled charging from the top-down and bottom-up approaches is then compared with uncontrolled charging. Results show that the top-down approach produces EV charging schedules that are compatible with individual driving behavior and reduce grid violations compared to uncontrolled charging. The bottom-up approach identifies an optimal profile similar to the centrally optimized profile, showing that electricity price signals are a suitable coordination mechanism. These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.txt b/research/fog-of-knowledge/data/evidence/snapshots/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.txt
new file mode 100644
index 000000000..ce4875eeb
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e.txt
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:59Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.08218" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.08218</identifier>
+        <datestamp>2026-09-10</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.08218</id>
+        <created>2026-09-09</created>
+            <updated>2026-09-10</updated>
+        <authors>
+                <author>
+                    <keyname>Bahavarnia</keyname>
+                        <forenames>MirSaleh</forenames>
+                </author>
+                <author>
+                    <keyname>Taha</keyname>
+                        <forenames>Ahmad F.</forenames>
+                </author>
+        </authors>
+        <title>Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper explores stabilizing traffic flow using a minimum number of autonomous vehicles (AVs) under control constraints. In contrast to most studies, we consider a heterogeneous parameter setup scenario for human-driven vehicles (HVs) to reflect real-world differences in driving behavior. While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow. To reduce such conservativeness and obtain a less conservative lower bound, we ensure the string stability of traffic flow by directly imposing the possession of no growing eigenmodes. We also systematically find a minimum number of required AVs and solve for the optimal control parameters via nonlinear optimization. We finally assess the intended conservativeness reduction via numerical simulations. Quantitatively, applying our algorithm to the homogeneous HV baseline in the literature (the result built upon an H-Infinity based sufficient condition) reduces (improves) the AV penetration rate by 17.14% while ensuring the string stability of traffic flow. We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs. Quantitatively, our last numerical simulation corroborates that the AV penetration rate can be reduced by 61.54% at the expense of 27.66% higher position difference deviation from the equilibrium and a 92.47% degradation in the real stability radius (RSR)---a metric to measure the stability robustness under the perturbation/uncertainty---associated with the aggregated linearized dynamics while ensuring the string stability of traffic flow. This trade-off helps engineers/operators make better traffic control decisions.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.txt b/research/fog-of-knowledge/data/evidence/snapshots/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.txt
new file mode 100644
index 000000000..33560b55e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6.txt
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:42Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.05749" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.05749</identifier>
+        <datestamp>2026-09-15</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:ET</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.05749</id>
+        <created>2026-09-13</created>
+            <updated>2026-09-15</updated>
+        <authors>
+                <author>
+                    <keyname>Barkett</keyname>
+                        <forenames>Emilio</forenames>
+                </author>
+                <author>
+                    <keyname>Kimpton</keyname>
+                        <forenames>Alexander</forenames>
+                </author>
+                <author>
+                    <keyname>Graham</keyname>
+                        <forenames>Daniel</forenames>
+                </author>
+                <author>
+                    <keyname>Kundgol</keyname>
+                        <forenames>Yusuf</forenames>
+                </author>
+        </authors>
+        <title>The Normalization of Deviance in AI Development</title>
+            <categories>cs.AI cs.ET cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values. Far less attention has been paid to the organizational level---to whether the institutions building these systems are themselves predisposed to drift toward failure. This paper argues that they are. Regardless of how capable AI systems become, the organizations building them face the same structural dynamics that preceded past major technological disasters. Drawing on case studies of the Space Shuttle Challenger, the Three Mile Island accident, and the Boeing 737 MAX crashes, this paper identifies the common structural mechanisms preceding each failure and maps them onto contemporary AI development. The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes. The pre-disaster period of AI development is still underway; the purpose of this paper is to make these dynamics legible while they can still be interrupted.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.txt b/research/fog-of-knowledge/data/evidence/snapshots/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.txt
new file mode 100644
index 000000000..c5b616616
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21270" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21270</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21270</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Malik</keyname>
+                        <forenames>Vikrant</forenames>
+                </author>
+                <author>
+                    <keyname>Kostina</keyname>
+                        <forenames>Victoria</forenames>
+                </author>
+                <author>
+                    <keyname>Hassibi</keyname>
+                        <forenames>Babak</forenames>
+                </author>
+        </authors>
+        <title>Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider the problem of H-infinity control in the presence of a digital communication channel between the observer and the controller and investigate the fundamental trade-off between the required communication data rate and H-infinity performance. The system follows linear dynamics and has no additive internal noise, so that the uncertainty is confined to the initial state. For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice. We further develop an achievability scheme and show that, for the scalar system, its rate matches the converse asymptotically in the high-data-rate limit.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.txt b/research/fog-of-knowledge/data/evidence/snapshots/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.txt
new file mode 100644
index 000000000..0672d7774
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:30:26Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2607.24360" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2607.24360</identifier>
+        <datestamp>2026-07-28</datestamp>
+            <setSpec>cs:cs:SI</setSpec>
+            <setSpec>cs:cs:HC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2607.24360</id>
+        <created>2026-07-27</created>
+            <updated>2026-07-28</updated>
+        <authors>
+                <author>
+                    <keyname>Krishna</keyname>
+                        <forenames>Vaibhav</forenames>
+                </author>
+                <author>
+                    <keyname>Shirado</keyname>
+                        <forenames>Hirokazu</forenames>
+                </author>
+                <author>
+                    <keyname>Fu</keyname>
+                        <forenames>Feng</forenames>
+                </author>
+                <author>
+                    <keyname>Christakis</keyname>
+                        <forenames>Nicholas A.</forenames>
+                </author>
+        </authors>
+        <title>Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases</title>
+            <categories>cs.SI cs.HC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Advanced digital communication has revolutionized how people create and consume information, making information diffusion an important topic of research for domains from public health to national security. Real-world scenarios of information diffusion often involve competing narratives - true and false - spreading simultaneously. We propose a novel agent-based co-diffusion model, grounded in &#34;complex-contagion&#34; and &#34;spiral of silence&#34; theories, to capture how network dynamics exploit cognitive biases to shape such interactions. Our findings reveal that manipulative narratives dominate when early spreaders hold them. These network dynamics further exploit inherent cognitive biases to amplify information diffusion regardless of veracity. Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly. However, we found that early seeding of agents with lower self-censorship not only constrains the spread of manipulation but can also lead to dominance of well-informed populance. This has implications for policies that aim to facilitate healthier discourse, strengthen social cohesion, and ensure equitable access to reliable information.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.txt b/research/fog-of-knowledge/data/evidence/snapshots/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.txt
new file mode 100644
index 000000000..dc31b15e8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67.txt
@@ -0,0 +1,57 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:21Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.39776" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.39776</identifier>
+        <datestamp>2026-10-01</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.39776</id>
+        <created>2026-09-30</created>
+            <updated>2026-10-01</updated>
+        <authors>
+                <author>
+                    <keyname>Zhang</keyname>
+                        <forenames>Jiarui</forenames>
+                </author>
+                <author>
+                    <keyname>Feng</keyname>
+                        <forenames>Wei</forenames>
+                </author>
+                <author>
+                    <keyname>Dong</keyname>
+                        <forenames>Chao</forenames>
+                </author>
+                <author>
+                    <keyname>Ge</keyname>
+                        <forenames>Ning</forenames>
+                </author>
+                <author>
+                    <keyname>Wu</keyname>
+                        <forenames>Qihui</forenames>
+                </author>
+        </authors>
+        <title>Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms</title>
+            <categories>cs.IT cs.SY eess.SY math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>With the rapid development of the low-altitude economy, low-altitude operations are booming, where complex missions require collaborative efforts among multiple heterogeneous low-altitude aircrafts (LAAs). Specifically, different LAAs assume distinct roles: some for sensing, some for communication, some for computing, and others for mission execution, together forming a sensing-communication-computing-control (SC3) closed loop, akin to a reflex arc. To enable efficient coordination in such multi-LAA swarms, we introduce the concept of operational-capability entropy (OCE) to quantify the effective work capability of operational LAAs. Accordingly, by jointly considering heterogeneous OCE and channel conditions among LAAs, we formulate the power allocation problem with the goal of minimizing the linear quadratic regulator (LQR) cost, which serves as a metric for mission efficiency. The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each. Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.txt b/research/fog-of-knowledge/data/evidence/snapshots/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.txt
new file mode 100644
index 000000000..43d31596c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:51Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.04227" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.04227</identifier>
+        <datestamp>2026-08-06</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.04227</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-06</updated>
+        <authors>
+                <author>
+                    <keyname>Delogne</keyname>
+                        <forenames>Rémi</forenames>
+                </author>
+                <author>
+                    <keyname>Jacques</keyname>
+                        <forenames>Laurent</forenames>
+                </author>
+        </authors>
+        <title>Random features for Grassmannian kernel approximation with bounded rank-one projections</title>
+            <categories>cs.LG eess.SP</categories>
+            <comments>33 pages, 6 figures, J2C certification</comments>
+            <journal-ref>Transactions on Machine Learning Research, July 2026</journal-ref>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions.
+  We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.txt b/research/fog-of-knowledge/data/evidence/snapshots/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.txt
new file mode 100644
index 000000000..46fadb44b
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:25Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.21057" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.21057</identifier>
+        <datestamp>2026-09-21</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.21057</id>
+        <created>2026-09-17</created>
+            <updated>2026-09-21</updated>
+        <authors>
+                <author>
+                    <keyname>Rahimi</keyname>
+                        <forenames>Herlock</forenames>
+                </author>
+                <author>
+                    <keyname>Kalogerias</keyname>
+                        <forenames>Dionysis</forenames>
+                </author>
+        </authors>
+        <title>FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift</title>
+            <categories>cs.LG cs.DC cs.SY eess.SP eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic client participation. Remedies built on classical Federated Averaging (FedAvg) typically presuppose that client participation probabilities are known to the server, which is rarely the case in deployed systems. We first discuss and then characterize the optimization problem that \emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\mathcal{O}(1/\sqrt{T})$ rate for convex and possibly nonsmooth losses. Building on this characterization, we propose \emph{Federated Risk-Averse Averaging} (\textsc{FedeRage}), a risk-averse extension of FedAvg that embeds the \emph{Conditional Value-at-Risk} (CVaR) into the local objective within a natural distributionally robust optimization (DRO) framework. \textsc{FedeRage} implicitly upweights high-loss and infrequently participating clients while adding only a \emph{single scalar per-client}, and admits an $\mathcal{O}(κ/\sqrt{T})$ rate in which the factor $κ$ is the upper bound on the ``price&#34; of risk aversion. In contrast with aggregation-alignment schemes based on optimal transport, which require the availability distribution as an input, \textsc{FedeRage} remains agnostic to it. Several experiments on three heterogeneous benchmarks indicate consistent improvements over state-of-the-art methods in accuracy, fairness, and convergence speed.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.txt b/research/fog-of-knowledge/data/evidence/snapshots/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.txt
new file mode 100644
index 000000000..91aceb42c
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:35Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16899" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16899</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16899</id>
+        <created>2026-09-15</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Fernandez-Zapico</keyname>
+                        <forenames>Diego</forenames>
+                </author>
+                <author>
+                    <keyname>Vehlhaber</keyname>
+                        <forenames>Finn</forenames>
+                </author>
+                <author>
+                    <keyname>Izadi</keyname>
+                        <forenames>Maedeh</forenames>
+                </author>
+                <author>
+                    <keyname>Hofman</keyname>
+                        <forenames>Theo</forenames>
+                </author>
+                <author>
+                    <keyname>Salazar</keyname>
+                        <forenames>Mauro</forenames>
+                </author>
+        </authors>
+        <title>Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.txt b/research/fog-of-knowledge/data/evidence/snapshots/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.txt
new file mode 100644
index 000000000..8361b7ef7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48.txt
@@ -0,0 +1,64 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:20Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.23972" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.23972</identifier>
+        <datestamp>2026-08-26</datestamp>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.23972</id>
+        <created>2026-08-25</created>
+            <updated>2026-08-26</updated>
+        <authors>
+                <author>
+                    <keyname>Zhao</keyname>
+                        <forenames>Yiqi</forenames>
+                </author>
+                <author>
+                    <keyname>Kim</keyname>
+                        <forenames>Taekyung</forenames>
+                </author>
+                <author>
+                    <keyname>Okamoto</keyname>
+                        <forenames>Hideki</forenames>
+                </author>
+                <author>
+                    <keyname>Hoxha</keyname>
+                        <forenames>Bardh</forenames>
+                </author>
+                <author>
+                    <keyname>Deshmukh</keyname>
+                        <forenames>Jyotirmoy V.</forenames>
+                </author>
+                <author>
+                    <keyname>Lindemann</keyname>
+                        <forenames>Lars</forenames>
+                </author>
+                <author>
+                    <keyname>Fainekos</keyname>
+                        <forenames>Georgios</forenames>
+                </author>
+        </authors>
+        <title>Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic</title>
+            <categories>cs.RO cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL). Our approach encodes discrete-time STL formulas into candidate time-varying control barrier functions (CBF), which are integrated into a model predictive path integral (MPPI) controller. Our method inherits the benefits of low computational cost from an efficiently parallelizable sampling based planner and utilizes CBF for constraints expressed in STL. We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency. We show a quadcopter planning experiment with NVIDIA Isaac Lab.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.txt b/research/fog-of-knowledge/data/evidence/snapshots/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.txt
new file mode 100644
index 000000000..6491d05e8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249.txt
@@ -0,0 +1,39 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:47Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.12393" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.12393</identifier>
+        <datestamp>2026-08-14</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.12393</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-14</updated>
+        <authors>
+                <author>
+                    <keyname>Conway-Smith</keyname>
+                        <forenames>Brendan</forenames>
+                </author>
+        </authors>
+        <title>Metacognitive Skill Learning: A Computational Account</title>
+            <categories>q-bio.NC</categories>
+            <comments>PhD thesis. Carleton University 2026. Final defended version. https://www.brendanconwaysmith.com/</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This dissertation presents the first formal theory of metacognitive skill learning. Metacognition, the capacity to monitor and control one&#39;s own cognitive processes, has been widely studied, yet the field still lacks a theoretical framework explaining how metacognitive abilities are learned. This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence. The account developed here builds on classic models of skill acquisition from perceptual-motor and cognitive domains. It proposes that metacognitive skill develops primarily through proceduralization, whereby explicit, effortful metacognitive processes are transformed through practice into implicit, automatic routines. The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness. The result is an integrated, mechanistic account of metacognitive skill that organizes existing findings, generates testable predictions, informs the design of AI, and supports the strengthening of metacognitive skill in everyday life.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.txt b/research/fog-of-knowledge/data/evidence/snapshots/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.txt
new file mode 100644
index 000000000..cc28a7d9a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12486" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12486</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:GT</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12486</id>
+        <created>2026-09-11</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Velicheti</keyname>
+                        <forenames>Raj Kiriti</forenames>
+                </author>
+                <author>
+                    <keyname>Bose</keyname>
+                        <forenames>Subhonmesh</forenames>
+                </author>
+                <author>
+                    <keyname>Başar</keyname>
+                        <forenames>Tamer</forenames>
+                </author>
+        </authors>
+        <title>Adaptive Agent Design</title>
+            <categories>eess.SY cs.AI cs.GT cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We consider an agent acting against a general non-Markovian environment. The agent maintains its agent states, but is free to choose a transition kernel across those states and optimize its state-feedback control policies. We study the bi-level agent design problem that optimizes the transition kernel and the policy it induces, given said kernel with offline data of observations and actions obtained via a behavioral policy. For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one. In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.txt b/research/fog-of-knowledge/data/evidence/snapshots/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.txt
new file mode 100644
index 000000000..47ff27990
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:19Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.08151" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.08151</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.08151</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Rommel</keyname>
+                        <forenames>Quentin</forenames>
+                </author>
+                <author>
+                    <keyname>Fotiadis</keyname>
+                        <forenames>Filippos</forenames>
+                </author>
+                <author>
+                    <keyname>Armstrong</keyname>
+                        <forenames>Cade</forenames>
+                </author>
+                <author>
+                    <keyname>Peterson</keyname>
+                        <forenames>Luke</forenames>
+                </author>
+                <author>
+                    <keyname>Topcu</keyname>
+                        <forenames>Ufuk</forenames>
+                </author>
+        </authors>
+        <title>Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>Initial submission to JCGD</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Cislunar spacecraft operate in nonlinear and unstable environments that make defensive maneuver planning difficult. We formulate cislunar spacecraft pursuit and evasion as a zero-sum differential game in the circular restricted three-body problem. Each spacecraft controls its thrust and reference orbit phase, enabling motion along periodic orbits and across quasi-periodic tori while remaining near the reference. We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints. We propose a shared time regularization to synchronize both spacecraft while refining the discretization near close lunar passages. Numerical results on periodic and quasi-periodic orbits show that phase control improves maneuvering flexibility while limiting departure from the reference orbit. The discrete-time method also provides a large computational advantage over a continuous-time formulation. Comparisons between quasi-halo and quasi-near-rectilinear halo orbits show that close lunar passages create larger escape opportunities but also increase the sensitivity of the encounter. These results show that reference orbit geometry is an important part of defensive cislunar mission design.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.txt b/research/fog-of-knowledge/data/evidence/snapshots/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.txt
new file mode 100644
index 000000000..4217cf83e
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:00Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.03967" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.03967</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>stat:stat:ML</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.03967</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Raykov</keyname>
+                        <forenames>Yordan</forenames>
+                </author>
+                <author>
+                    <keyname>Veiga</keyname>
+                        <forenames>Rodrigo</forenames>
+                </author>
+        </authors>
+        <title>Information-Geometric Forward Policy Training in GFlowNets</title>
+            <categories>stat.ML cs.LG</categories>
+            <comments>13 pages + appendix</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward. In this work, we formulate forward-policy training in GFlowNets through the information geometry of the induced trajectory sampler. Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable. We derive an exact decomposition of the trajectory Fisher into per-step conditional second moments, which clarifies when temporal score interactions vanish and when dense couplings remain under shared parameterisation. This leads to three computational regimes: settings with tractable exact Fisher information, settings where Monte Carlo estimators of the expected Fisher are sufficient, and structure-exploitable settings in which target locality or factorisation yields accurate approximations of the Fisher expectation. In the latter case, graphical-model tools such as exact marginalisation, separator methods, and belief propagation provide principled surrogates for natural-gradient updates. The resulting framework turns target structure into optimisation geometry and yields a tractable route to structure-aware forward-policy training in GFlowNets. We illustrate the framework empirically through examples comparing convergence and exploration behaviour under Riemannian and Euclidean optimisation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.txt b/research/fog-of-knowledge/data/evidence/snapshots/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.txt
new file mode 100644
index 000000000..d3e87ef0f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d.txt
@@ -0,0 +1,54 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T16:53:48Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12592" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12592</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12592</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>de Oliveira</keyname>
+                        <forenames>Daniel V. C.</forenames>
+                </author>
+                <author>
+                    <keyname>Alcantara</keyname>
+                        <forenames>Daniel C.</forenames>
+                </author>
+                <author>
+                    <keyname>Asim</keyname>
+                        <forenames>Fazal. E</forenames>
+                </author>
+                <author>
+                    <keyname>de Almeida</keyname>
+                        <forenames>Andre L. F.</forenames>
+                </author>
+                <author>
+                    <keyname>Fodor</keyname>
+                        <forenames>Gabor</forenames>
+                </author>
+        </authors>
+        <title>Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>This paper introduces an enhanced channel estimation method for reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) communications. Considering the presence of both the direct link from the base station (BS) to the user equipment (UE) and the indirect link \textit{via} the RIS, we formulate a tensor-based receiver for joint direct and indirect channel estimation called the TenDICE algorithm. The proposed receiver relies on an extended parallel factor analysis (PARAFAC) tensor model for the received pilot signals, from which the involved (direct and indirect link) channels are estimated using a simple alternating least squares scheme. The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE). The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.txt b/research/fog-of-knowledge/data/evidence/snapshots/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.txt
new file mode 100644
index 000000000..1a86921fe
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:06Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04630" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04630</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04630</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Sevim</keyname>
+                        <forenames>Nurullah</forenames>
+                </author>
+                <author>
+                    <keyname>Ibrahim</keyname>
+                        <forenames>Mostafa</forenames>
+                </author>
+                <author>
+                    <keyname>Ekin</keyname>
+                        <forenames>Sabit</forenames>
+                </author>
+                <author>
+                    <keyname>Rappaport</keyname>
+                        <forenames>Theodore S.</forenames>
+                </author>
+        </authors>
+        <title>Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems</title>
+            <categories>eess.SP</categories>
+            <comments>Submitted to IEEE Transactions on Green Communications and Networking for review</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The escalating energy demands of modern wireless networks make energy-efficient system design a central challenge for future 6G deployments. Relay-assisted communication has long been recognized as a powerful tool for improving coverage and throughput, tracing its roots to early repeater communication systems and the foundational relay channel models in information theory. Meanwhile, modern relay selection and routing strategies are primarily driven by rate-based or transmit-power-centric metrics, which often neglect hardware-level losses that is independent of the transmitted signal. As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions. To address the challenge of modeling signal-independent power consumption in relay-assisted systems, the Waste Factor (WF) framework is adopted: a hardware-aware, unifying metric that explicitly captures signal-independent power losses across cascaded transceivers and wireless channels. Using WF, the energy consumption of multi-user, multi-relay wireless systems is quantified and minimized under practical hardware and network constraints. The formulation jointly accounts for component inefficiencies, propagation losses, and relay-selection constraints. The proposed framework demonstrates that the WF formulation provides a fundamentally new way to model relay-assisted communication, enabling hardware-aware energy-per-bit minimization and a structured representation that enables computationally efficient analysis. Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.txt b/research/fog-of-knowledge/data/evidence/snapshots/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.txt
new file mode 100644
index 000000000..40fb8bba5
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af.txt
@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:25:52Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.04697" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.04697</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.04697</id>
+        <created>2026-10-03</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Qian</keyname>
+                        <forenames>William</forenames>
+                </author>
+                <author>
+                    <keyname>Pehlevan</keyname>
+                        <forenames>Cengiz</forenames>
+                </author>
+        </authors>
+        <title>Efficiency and robustness partition the solution space for memory in recurrent networks</title>
+            <categories>q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function. However, these networks are subject to inductive biases that may be misaligned with those of biological circuits, which operate under various efficiency and robustness constraints. Here, using a minimal stimulus recall task, we systematically characterize how the solution space of recurrent neural networks is shaped by the desiderata of weight efficiency, activity efficiency, and robustness to noise. We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification. Moreover, we find that activity efficient solutions exhibit a strong dissociation between high-variance modes of activity and those that causally influence network output. Unlike in static feedforward settings, we demonstrate that noise robustness and activity efficiency are generally in opposition, rather than synergistic. Using these findings, we propose a normative account of misaligned coding phenomena recently identified in premotor cortex.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.txt b/research/fog-of-knowledge/data/evidence/snapshots/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.txt
new file mode 100644
index 000000000..bd0e56e86
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:35Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.29832" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.29832</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.29832</id>
+        <created>2026-09-24</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Matt</keyname>
+                        <forenames>Justin J.</forenames>
+                </author>
+                <author>
+                    <keyname>Altamirano</keyname>
+                        <forenames>George V.</forenames>
+                </author>
+        </authors>
+        <title>System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs</title>
+            <categories>eess.SY cs.RO cs.SY</categories>
+            <comments>31 pages, 18 figures. Presented at the AIAA AVIATION Forum 2025. Accepted for publication in the AIAA Journal of Aircraft</comments>
+            <journal-ref>AIAA Journal of Aircraft, Article in Advance (2026)</journal-ref>
+            <doi>10.2514/1.C038636</doi>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>A new method for multi-input flight maneuver design for system identification is presented. The method consists of injecting &#34;full-harmonic&#34; orthogonal multisine signals into the flight control system. Orthogonality is achieved by repeating maneuvers with changing multisine polarities. The multisines can contain the same frequency content, which can simplify frequency response estimation and allow for long flight maneuvers to be split into several shorter maneuvers while maintaining the same frequency resolution and minimum frequency. An input allocation scheme is presented that augments the multisines to size the vehicle response amplitude about a specific degree of freedom. The developed approach was demonstrated through flight testing of a small octocopter in near-hover conditions. The input allocation scheme was utilized successfully to increase excitation about the yaw axis. Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately. The models are parameterized primarily by rotor thrust and torque coefficients, making them suitable for analysis of aircraft flight dynamics and individual rotor aerodynamics. The results demonstrate that the near-hover flight dynamics can be modeled accurately by neglecting rotor hub moments, variations in rotor coefficients, gyroscopic moments in roll and pitch, and aerodynamic interaction effects.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.txt b/research/fog-of-knowledge/data/evidence/snapshots/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.txt
new file mode 100644
index 000000000..7a3bfa3ec
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:18Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02244" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02244</identifier>
+        <datestamp>2026-08-04</datestamp>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02244</id>
+        <created>2026-08-03</created>
+            <updated>2026-08-04</updated>
+        <authors>
+                <author>
+                    <keyname>Yao</keyname>
+                        <forenames>Dayi</forenames>
+                </author>
+                <author>
+                    <keyname>Zhou</keyname>
+                        <forenames>Zijie</forenames>
+                </author>
+        </authors>
+        <title>Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling</title>
+            <categories>cs.DC cs.SY eess.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper studies a resource-allocation inefficiency in batched large language model (LLM) serving: heterogeneous requests that share a decode batch impose max-driven computational costs on one another. Because the wall-clock cost of a batch step is largely governed by the largest active KV-cache footprint, a short request co-batched with a long request can experience latency and GPU-resource consumption disproportionate to its own token workload. We formalize this phenomenon as a resource-fair scheduling problem. We develop a mathematical scheduling model that connects within-batch resource fairness to system throughput. The proposed fairness constraint bounds the disparity in decode progress, equivalently KV-cache footprint, among co-batched requests. Based on this model, we design the Insert-Short-Jobs-with-Limit (ISJL) algorithm, a parameterized hybrid batching policy. We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$. We further examine the profit implications of resource-fair scheduling under the token-metered pricing convention used by commercial LLM APIs. Numerical experiments show that ISJL occupies a favorable middle ground between FCFS, which has large batching externalities, and LJF, which is cost-aligned but sacrifices batching flexibility. Thus, ISJL provides a bi-criterion scheduling policy: it maintains high throughput while aligning max-driven batch cost with token-metered revenue.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.txt b/research/fog-of-knowledge/data/evidence/snapshots/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.txt
new file mode 100644
index 000000000..aa0b19dbb
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.26093" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.26093</identifier>
+        <datestamp>2026-08-27</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.26093</id>
+        <created>2026-08-26</created>
+            <updated>2026-08-27</updated>
+        <authors>
+                <author>
+                    <keyname>Khan</keyname>
+                        <forenames>Ahmad</forenames>
+                </author>
+                <author>
+                    <keyname>Sediq</keyname>
+                        <forenames>Akram Bin</forenames>
+                </author>
+                <author>
+                    <keyname>Naeini</keyname>
+                        <forenames>Sara Azadegi</forenames>
+                </author>
+                <author>
+                    <keyname>Adve</keyname>
+                        <forenames>Raviraj S.</forenames>
+                </author>
+        </authors>
+        <title>Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher&#39;s Role</title>
+            <categories>cs.LG cs.IT cs.SY eess.SY math.IT</categories>
+            <comments>Submitted to IEEE Globecom Workshops</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Designing machine learning algorithms for wireless resource management is labour-intensive: the architecture, the loss function and the training recipe are all specified by hand. We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety. We adopt the autoresearch protocol, in which an AI coding agent edits a training script, runs a fixed-budget experiment, and retains or discards the change according to a single immutable metric. We grant the agent authority over the architecture family, the input representation, the output parameterization, the loss function and the task-sampling law, and set it a target chosen for its difficulty: sum-least-percentile-rate power control across a multicell network. The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex. Safeguards render the results trustworthy: a hash-pinned evaluator, an enforced inference contract and a pre-registered falsifier per experiment. In eighty-one unattended experiments over twenty-six hours, the agent reached $99.5\%$ of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly $600\times$ lower inference cost, closing $94\%$ of the gap from its first working architecture, with one parameter set serving every network size and percentile target. It recovered provable structure rather than tuned constants: the output parameterization it discovered reproduces the exact max-min-optimal allocation at the minimum percentile, for every value of the trained weights.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.txt b/research/fog-of-knowledge/data/evidence/snapshots/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.txt
new file mode 100644
index 000000000..01b498796
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:28Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.35424" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.35424</identifier>
+        <datestamp>2026-09-29</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.35424</id>
+        <created>2026-09-28</created>
+            <updated>2026-09-29</updated>
+        <authors>
+                <author>
+                    <keyname>Liu</keyname>
+                        <forenames>Xiaoying</forenames>
+                </author>
+                <author>
+                    <keyname>Huang</keyname>
+                        <forenames>Linbin</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Hangyu</forenames>
+                </author>
+                <author>
+                    <keyname>Xin</keyname>
+                        <forenames>Huanhai</forenames>
+                </author>
+        </authors>
+        <title>Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Small-signal stability analysis of power electronics-dominated power systems is becoming increasingly challenging due to the large-scale integration of heterogeneous grid-following (GFL) and grid-forming (GFM) converters. Classical centralized methods, such as eigenvalue analysis and the generalized Nyquist criterion, provide direct stability assessment tools but exhibit limited scalability as the system size increases. This motivates scalable analysis methods for stability assessment and device-level diagnosis, and calls for less conservative stability conditions. To this end, this paper proposes a scalable small-signal stability assessment method with quantitative stability indices for multi-converter systems based on frequency-domain quadratic constraints (FQCs). It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition. This FQC-based formulation also clarifies the requirements for decentralized verification of these existing stability conditions. To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection. Combined with the mixed gain-phase condition, this optimization problem forms a hierarchical screening-diagnosis procedure that improves efficiency. Case studies demonstrate that the proposed method is less conservative than existing criteria and can effectively identify problematic devices associated with potential instability risks.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.txt b/research/fog-of-knowledge/data/evidence/snapshots/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.txt
new file mode 100644
index 000000000..14041800a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:13Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.31034" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.31034</identifier>
+        <datestamp>2026-09-01</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.31034</id>
+        <created>2026-08-31</created>
+            <updated>2026-09-01</updated>
+        <authors>
+                <author>
+                    <keyname>Guarino</keyname>
+                        <forenames>Idio</forenames>
+                </author>
+                <author>
+                    <keyname>Nascita</keyname>
+                        <forenames>Alfredo</forenames>
+                </author>
+                <author>
+                    <keyname>Ciuonzo</keyname>
+                        <forenames>Domenico</forenames>
+                </author>
+                <author>
+                    <keyname>Carra</keyname>
+                        <forenames>Damiano</forenames>
+                </author>
+                <author>
+                    <keyname>Pescapé</keyname>
+                        <forenames>Antonio</forenames>
+                </author>
+        </authors>
+        <title>XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition</title>
+            <categories>eess.SP</categories>
+            <comments>accepted at 22nd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 26)</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Wi-Fi Channel State Information (CSI) has emerged as a key enabler for device-free Human Activity Recognition (HAR), enabling low-cost, unobtrusive sensing using existing communication infrastructure. However, Deep Learning (DL) models trained on CSI data often struggle to generalize across users, environments, and device setups due to the context sensitivity of wireless propagation. Despite this challenge, limited attention has been devoted to understanding model decisions and generalization failures. This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems. XAI2CSI employs SAGE, a model-agnostic explainability method, to quantify temporal, spectral, and spatial CSI contributions to HAR decisions under nominal and cross-context evaluations on IEEE 802.11ax data. Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change. The proposed methodology and findings provide a reference framework to explore alternative solutions and guide the development of robust, transparent Wi-Fi sensing systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.txt b/research/fog-of-knowledge/data/evidence/snapshots/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.txt
new file mode 100644
index 000000000..ac538f6e0
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb.txt
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:55Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.04133" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.04133</identifier>
+        <datestamp>2026-08-06</datestamp>
+            <setSpec>cs:cs:IT</setSpec>
+            <setSpec>math:math:IT</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.04133</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-06</updated>
+        <authors>
+                <author>
+                    <keyname>Gkekas</keyname>
+                        <forenames>Angelos</forenames>
+                </author>
+                <author>
+                    <keyname>Papadopoulos</keyname>
+                        <forenames>Alexandros I.</forenames>
+                </author>
+                <author>
+                    <keyname>Pantazopoulos</keyname>
+                        <forenames>Petros Andreas</forenames>
+                </author>
+                <author>
+                    <keyname>Lalas</keyname>
+                        <forenames>Antonios</forenames>
+                </author>
+                <author>
+                    <keyname>Votis</keyname>
+                        <forenames>Konstantinos</forenames>
+                </author>
+                <author>
+                    <keyname>Liaskos</keyname>
+                        <forenames>Christos</forenames>
+                </author>
+        </authors>
+        <title>Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing</title>
+            <categories>cs.IT eess.SP math.IT</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.txt b/research/fog-of-knowledge/data/evidence/snapshots/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.txt
new file mode 100644
index 000000000..0f10dbeea
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:03Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.06163" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.06163</identifier>
+        <datestamp>2026-09-09</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.06163</id>
+        <created>2026-09-05</created>
+            <updated>2026-09-09</updated>
+        <authors>
+                <author>
+                    <keyname>Vu</keyname>
+                        <forenames>Tien Dat</forenames>
+                </author>
+                <author>
+                    <keyname>Doan</keyname>
+                        <forenames>Minh</forenames>
+                </author>
+        </authors>
+        <title>Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>16 pages, 8 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The leader-follower formation control problem is investigated for nonlinear multi-agent systems with unknown dynamics, external disturbances, and false data injection (FDI) attacks on actuator channels. The problem is formulated as a zero-sum differential game and solved using the Integral Bellman-Isaacs approach. To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law. Furthermore, this paper proposes a cost function construction method and develops a critic learning law, which together guarantee the practical fixed-time stability of the system while overcoming the limitations of existing fixed-time reinforcement learning formulations. Finally, the practical fixed-time convergence of both the critic weight estimation error and the leader-referenced formation tracking error to bounded residual sets is rigorously proven. Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.txt b/research/fog-of-knowledge/data/evidence/snapshots/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.txt
new file mode 100644
index 000000000..ea77328aa
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3.txt
@@ -0,0 +1,67 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.07289" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.07289</identifier>
+        <datestamp>2026-08-10</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>cs:cs:DC</setSpec>
+            <setSpec>cs:cs:LO</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.07289</id>
+        <created>2026-08-07</created>
+            <updated>2026-08-10</updated>
+        <authors>
+                <author>
+                    <keyname>Wang</keyname>
+                        <forenames>Wayne</forenames>
+                </author>
+                <author>
+                    <keyname>Bhatnagar</keyname>
+                        <forenames>Archit</forenames>
+                </author>
+                <author>
+                    <keyname>Miao</keyname>
+                        <forenames>Tongyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Kalamkar</keyname>
+                        <forenames>Saniya</forenames>
+                </author>
+                <author>
+                    <keyname>Cui</keyname>
+                        <forenames>Wenqi</forenames>
+                </author>
+                <author>
+                    <keyname>Incer</keyname>
+                        <forenames>Inigo</forenames>
+                </author>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Ang</forenames>
+                </author>
+        </authors>
+        <title>Synthesizing Voltage Ride-Through Controllers for Data Centers</title>
+            <categories>eess.SY cs.DC cs.LO cs.SY</categories>
+            <comments>12 pages, 10 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Data centers are among the power grid&#39;s fastest-growing loads. Since data center servers are sensitive electronic components, they need to be protected against the grid&#39;s voltage disturbances during grid faults. While disconnecting from the grid achieves this, it can further destabilize the power system if many data centers trip at once. To address this emerging concern, voltage ride-through (VRT) grid codes have been proposed to standardize data center behavior. They require a data center to stay connected for a period of time through the disturbance, hold an active power floor, and recover its draw within a deadline upon restoration. However, systematically designing and certifying controllers that satisfy these coupled temporal and operational requirements remains challenging.
+  We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods. We develop a specification language that expresses a grid code in Signal Temporal Logic (STL) as the basis for formal reasoning. Our encoding algorithm takes the specification, along with a model of the data center&#39;s power topology, and translates the constraints into a controller synthesis problem. This step produces a correct-by-construction controller if a solution can be found, or a proof that no such controller exists. For the latter case, SolVRT provides a diagnostic step: it traces the facility&#39;s &#34;conflict frontier,&#34; isolates the conflicting clauses that led to non-compliance, and computes the smallest hardware or workload change that would enable compliance. We evaluate SolVRT through closed-loop simulations of a 200 MW data center connected to a 140-bus transmission system. The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.txt b/research/fog-of-knowledge/data/evidence/snapshots/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.txt
new file mode 100644
index 000000000..637eca290
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63.txt
@@ -0,0 +1,58 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:31Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.18467" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.18467</identifier>
+        <datestamp>2026-09-17</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.18467</id>
+        <created>2026-09-16</created>
+            <updated>2026-09-17</updated>
+        <authors>
+                <author>
+                    <keyname>Uniyal</keyname>
+                        <forenames>Smriti</forenames>
+                </author>
+                <author>
+                    <keyname>Fang</keyname>
+                        <forenames>Tianyu</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Van-Dinh</forenames>
+                </author>
+                <author>
+                    <keyname>Ngo</keyname>
+                        <forenames>Hien Quoc</forenames>
+                </author>
+                <author>
+                    <keyname>Juntti</keyname>
+                        <forenames>Markku</forenames>
+                </author>
+                <author>
+                    <keyname>Nguyen</keyname>
+                        <forenames>Nhan Thanh</forenames>
+                </author>
+        </authors>
+        <title>Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In integrated sensing and communications (ISAC), the same spectral and hardware resources are shared for two functionalities. Most ISAC designs assume perfect target-angle information neglecting angle estimation errors, which introduce steering-vector mismatches, degrade sensing accuracy, and may invalidate deterministic sensing guarantees. This paper investigates monostatic massive multiple-input-multiple-output (MIMO) ISAC systems under imperfect target-angle estimates. We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty. We characterize the cumulative distribution functions and outage probabilities of the CRLBs under Gaussian, generalized uniform, and von Mises angle-error models. Our analysis reveals that, in the small-error regime, the CRLBs increase quadratically with the angle errors due to transmit steering-vector mismatch. To ensure reliable sensing, we propose a robust power allocation framework that jointly optimizes pilot training and communications/sensing transmission powers to maximize the communications sum rate while satisfying CRLB outage constraints. The resulting nonconvex problem is solved using an alternating-optimization algorithm based on successive convex approximation. Numerical results validate the developed analysis and show that the proposed robust design reduces azimuth and elevation CRLB outage probabilities by up to $60\%$ compared with conventional non-robust schemes. It attains up to $45\%$ higher sum rates than the non-robust design under strict CRLB thresholds.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.txt b/research/fog-of-knowledge/data/evidence/snapshots/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.txt
new file mode 100644
index 000000000..f1d0b0811
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:47Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.19416" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.19416</identifier>
+        <datestamp>2026-08-21</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.19416</id>
+        <created>2026-08-19</created>
+            <updated>2026-08-21</updated>
+        <authors>
+                <author>
+                    <keyname>Mozaffarikhosravi</keyname>
+                        <forenames>Nima</forenames>
+                </author>
+                <author>
+                    <keyname>Azarbahram</keyname>
+                        <forenames>Amirhossein</forenames>
+                </author>
+                <author>
+                    <keyname>Dharmawansa</keyname>
+                        <forenames>Prathapasinghe</forenames>
+                </author>
+                <author>
+                    <keyname>Atzeni</keyname>
+                        <forenames>Italo</forenames>
+                </author>
+        </authors>
+        <title>Robust Near-Field Beam Focusing Under Imperfect Localization</title>
+            <categories>eess.SP</categories>
+            <comments>To be presented at the International Workshop on Smart Antennas (WSA) 2026</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The transition to 6G-and-beyond wireless systems with large-scale antenna arrays and high-frequency deployments significantly extends the near-field region, where channels exhibit a strong dependence on user location. While this enables location-based beam focusing as a low-overhead alternative to conventional channel estimation, its performance is highly sensitive to localization errors. In this paper, we study robust near-field beam focusing under imperfect user localization. We explicitly characterize the impact of localization errors on the line-of-sight-dominated channel by deriving a tractable uncertainty model via a first-order Taylor approximation, which captures the coupled effects of distance and angle in near-field propagation. Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors. The resulting problem is reformulated into a feasibility problem using semidefinite relaxation. Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.txt b/research/fog-of-knowledge/data/evidence/snapshots/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.txt
new file mode 100644
index 000000000..6989a39e4
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-11T12:13:43Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.09266" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.09266</identifier>
+        <datestamp>2026-10-08</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.09266</id>
+        <created>2026-10-07</created>
+            <updated>2026-10-08</updated>
+        <authors>
+                <author>
+                    <keyname>Ncube</keyname>
+                        <forenames>Walter Zibusiso</forenames>
+                </author>
+                <author>
+                    <keyname>Qidan</keyname>
+                        <forenames>Ahmad Adnan</forenames>
+                </author>
+                <author>
+                    <keyname>El-Gorashi</keyname>
+                        <forenames>Taisir</forenames>
+                </author>
+                <author>
+                    <keyname>Elmirghani</keyname>
+                        <forenames>Jaafar M. H.</forenames>
+                </author>
+        </authors>
+        <title>Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Growing wireless traffic is increasing pressure on the congested radio-frequency spectrum. Optical wireless communication (OWC) provides a complementary solution by using the abundant unlicensed optical spectrum. However, indoor OWC networks are dynamic: users move, enter or leave the network, and subscribe to different services. Poorly coordinated resource allocation can consequently waste subcarriers, require excessive transmission power and cause frequent AP reassignments. Energy efficiency (EE), defined as the total delivered data rate divided by the total network power consumption, therefore requires the serving AP, number of allocated subcarriers, and transmission power to be jointly adapted while maintaining QoS. Optimising these in a dynamic time series, multi-service OWC environment produces a complex sequential EE optimisation problem. To address this problem, this work proposes Dual-Agent Resource Allocation using Deep Reinforcement Learning (DARA-DRL). DARA-DRL combines a branching duelling deep Q-network for association and subcarrier allocation with a conditional soft actor-critic agent for continuous power control. The agents are coupled through a common reward and a cooperative value update that evaluates each discrete allocation together with its corresponding power decision. Simulation results show that DARA-DRL remains within 5\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\% and QoS satisfaction by 10.5\%, while reducing online decision time by 14.5\%. Results demonstrate that agent specialisation simplifies mixed-action learning, and cooperation outperforms independently trained agents.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.txt b/research/fog-of-knowledge/data/evidence/snapshots/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.txt
new file mode 100644
index 000000000..0fa30a543
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab.txt
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:27:15Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.10825" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.10825</identifier>
+        <datestamp>2026-08-12</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.10825</id>
+        <created>2026-08-11</created>
+            <updated>2026-08-12</updated>
+        <authors>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Jinwen</forenames>
+                </author>
+                <author>
+                    <keyname>Che</keyname>
+                        <forenames>Yunhong</forenames>
+                </author>
+                <author>
+                    <keyname>Onori</keyname>
+                        <forenames>Simona</forenames>
+                </author>
+                <author>
+                    <keyname>Li</keyname>
+                        <forenames>Weihan</forenames>
+                </author>
+                <author>
+                    <keyname>Hu</keyname>
+                        <forenames>Xiaosong</forenames>
+                </author>
+        </authors>
+        <title>Cross-modal topology decodes battery faults from sparse voltage snapshots</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>33 pages, 12 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements. Existing methods struggle to resolve the signal ambiguity between overlapping fault modes without hardware upgrades. Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots. We introduce DeFault, a cross-modal diagnostic framework that mathematically unfolds one-dimensional voltage sequences into multi-dimensional phase-space topologies. DeFault employs a bidirectional cross-attention mechanism that acts as an autonomous, physics-aligned filter, explicitly decoding compounded fault modes that remain fundamentally invisible to sequence-based methods. Validated on a field dataset of 16.4 million data records from 99 in-service EVs, our method achieves an average accuracy of 0.96 and an F1 score of 0.84 for four fault types using only 500-second snapshots (spanning &lt;100 mV). This work proves that high-fidelity, interpretable electrochemical diagnosis is achievable on legacy fleets without new sensors, providing a scalable solution for the battery safety crisis.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.txt b/research/fog-of-knowledge/data/evidence/snapshots/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.txt
new file mode 100644
index 000000000..28c223179
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f.txt
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:28:10Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.02978" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.02978</identifier>
+        <datestamp>2026-08-05</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.02978</id>
+        <created>2026-08-04</created>
+            <updated>2026-08-05</updated>
+        <authors>
+                <author>
+                    <keyname>Salimi</keyname>
+                        <forenames>Arastoo H</forenames>
+                </author>
+                <author>
+                    <keyname>Nazaripouya</keyname>
+                        <forenames>Hamidreza</forenames>
+                </author>
+        </authors>
+        <title>Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>This paper proposes a new automated decision-making framework to enhance the resilience of electrical systems against wildfires by applying operational strategies that account for decision-dependent uncertainty (DDU). The proposed framework incorporates both preventive and corrective measures, enabling adaptive and automated decision-making throughout the course of evolving wildfire scenarios. First, a baseline multistage optimization model is presented as a foundation to support wildfire-driven operational decision-making. The model then incorporates DDU, wherein Public Safety Power Shutoff (PSPS) decisions made in earlier stages influence the probabilities and parameters of future wildfire scenarios. To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed. The effectiveness of the proposed approach is demonstrated through case studies on the IEEE 30-bus system. Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.txt b/research/fog-of-knowledge/data/evidence/snapshots/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.txt
new file mode 100644
index 000000000..46e447213
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f.txt
@@ -0,0 +1,41 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.23703" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.23703</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>cs:cs:CL</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>q-fin:q-fin:TR</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.23703</id>
+        <created>2026-09-20</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Kirtac</keyname>
+                        <forenames>Kemal</forenames>
+                </author>
+        </authors>
+        <title>Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions</title>
+            <categories>cs.CL cs.LG q-fin.TR</categories>
+            <comments>47 pages. Revise and resubmit at Engineering Applications of Artificial Intelligence</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Financial language models can transform unstructured firm-specific news into structured decision signals, but financial AI research lacks an integrated deployment framework for evaluating whether those signals remain useful in financial decision systems. Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference. We introduce MFAST, a Market-Friction-Aware Sentiment-to-Trading framework that converts timestamped financial text into auditable, reproducible, and market-feasible trading decisions. The application is news-based trading, where firm-specific text must be linked to securities before portfolio decisions can be evaluated. The framework links Refinitiv News Analytics to Center for Research in Security Prices (CRSP) equity data, restricts the primary out-of-sample evaluation to post-release news outside disclosed foundation-model data-freshness periods, and adds a public replication arm using open financial text and public price data. Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost. The paper shows that credible evaluation of financial language models requires an end-to-end engineering approach combining language understanding, temporal discipline, market-friction-aware deployment, and reproducible validation.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.txt b/research/fog-of-knowledge/data/evidence/snapshots/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.txt
new file mode 100644
index 000000000..513c4ad0f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19.txt
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.25847" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.25847</identifier>
+        <datestamp>2026-09-23</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.25847</id>
+        <created>2026-09-22</created>
+            <updated>2026-09-23</updated>
+        <authors>
+                <author>
+                    <keyname>Ertan</keyname>
+                        <forenames>Sude</forenames>
+                </author>
+                <author>
+                    <keyname>Tokluoglu</keyname>
+                        <forenames>Osman</forenames>
+                </author>
+                <author>
+                    <keyname>Cavus</keyname>
+                        <forenames>Enver</forenames>
+                </author>
+        </authors>
+        <title>Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications</title>
+            <categories>eess.SP</categories>
+            <comments>6 pages, 3 tables, 2 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Classical coherent binary phase-shift keying (BPSK) reception over additive white Gaussian noise (AWGN) channels is analytically well understood, and the optimum hard-decision detector is known. Therefore, the aim of using neural receivers in this study is not to replace the classical AWGN-BPSK detector. Instead, the AWGN-BPSK setting is deliberately selected as a theoretically verifiable benchmark for analyzing how compactly neural receiver architectures can represent a known decision behavior. This paper compares multi-layer perceptron (MLP) and Kolmogorov--Arnold Network (KAN) receivers using a multi-SNR Nyquist-rate BPSK dataset. The models are evaluated using bit error rate (BER), mean squared error (MSE), and trainable parameter count. Beyond reporting accuracy alone, this work emphasizes a common-loss parameter-efficiency perspective: when two receivers reach a comparable practical BER or loss region, the receiver with fewer parameters is more attractive for real-time deployment. The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters. In particular, the KAN receiver with 3281 parameters achieves a test BER of 2.45 x 10^-4, while the MLP baseline with 8513 parameters achieves a test BER of 2.50 x 10^-4. This corresponds to approximately 61.5% fewer trainable parameters at a comparable BER operating point. This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.txt b/research/fog-of-knowledge/data/evidence/snapshots/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.txt
new file mode 100644
index 000000000..43abab733
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718.txt
@@ -0,0 +1,39 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:40Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.20723" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.20723</identifier>
+        <datestamp>2026-08-24</datestamp>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+            <setSpec>cs:cs:SC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.20723</id>
+        <created>2026-08-21</created>
+            <updated>2026-08-24</updated>
+        <authors>
+                <author>
+                    <keyname>Yang</keyname>
+                        <forenames>Tianming</forenames>
+                </author>
+        </authors>
+        <title>Conscious Access as Continuous-to-Discrete Translation</title>
+            <categories>q-bio.NC cs.SC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The scientific study of consciousness frequently stalls on ontological debates regarding the &#34;Hard Problem.&#34; This paper proposes a pragmatic pivot. Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence. We introduce the Continuous/Discrete (C/D) framework, which holds that the brain implements two distinct processing regimes: System C, a distributed sensory-motor network operating over continuous, high-dimensional manifolds, and System D, a centralized engine structured around discrete, scale-invariant symbols. We argue that conscious access requires a structure-preserving translation between these regimes, which maps localized continuous states onto discrete symbolic tokens, coupled with an inverse projection that grounds those tokens back into sensorimotor dynamics. By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes. These predictions explicitly differentiate our account from Global Neuronal Workspace Theory, Integrated Information Theory, Predictive Processing, and Higher-Order Theories, shifting the focus from ontological status to computational mechanism. Beyond neuroscience, the framework provides a principled architecture for neuro-symbolic artificial intelligence. We argue that treating conscious access as translational computation offers a pragmatic, empirically tractable pathway forward, clarifying what conscious states functionally accomplish without requiring resolution of the hard problem of phenomenology.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.txt b/research/fog-of-knowledge/data/evidence/snapshots/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.txt
new file mode 100644
index 000000000..487d9a1ad
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:40:54Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.06601" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.06601</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.06601</id>
+        <created>2026-10-05</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Chen</keyname>
+                        <forenames>Lily Y.</forenames>
+                </author>
+                <author>
+                    <keyname>Shah</keyname>
+                        <forenames>Vade</forenames>
+                </author>
+                <author>
+                    <keyname>Walsh</keyname>
+                        <forenames>Dan</forenames>
+                </author>
+                <author>
+                    <keyname>Marden</keyname>
+                        <forenames>Jason R.</forenames>
+                </author>
+        </authors>
+        <title>Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration</title>
+            <categories>eess.SY cs.SY</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Industrial refrigeration consumes substantial electricity, and compressors are the dominant energy consumers in these systems, making their operation central to improving energy efficiency. Compressors are most efficient when operated at full capacity, but the cooling they provide at full capacity can exceed the facility&#39;s immediate needs. This motivates pre-cooling, where compressors operate at full capacity and the excess cooling is stored as thermal inventory for future heat loads. However, stored cooling is inherently lossy: colder spaces attract additional heat from their surroundings, creating a tradeoff between maximizing compressor efficiency and avoiding cooling that dissipates before it can be used. We study this tradeoff through a retention factor, defined as the fraction of thermal inventory that survives after one minute, with the goals of understanding how retention affects the value of pre-cooling and designing effective control policies that account for this lossiness. We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data. Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.txt b/research/fog-of-knowledge/data/evidence/snapshots/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.txt
new file mode 100644
index 000000000..5e0b546a8
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:16Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.16258" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.16258</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>cs:cs:AI</setSpec>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:PF</setSpec>
+            <setSpec>econ:econ:GN</setSpec>
+            <setSpec>q-fin:q-fin:EC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.16258</id>
+        <created>2026-09-14</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Manso</keyname>
+                        <forenames>Gabriel</forenames>
+                </author>
+                <author>
+                    <keyname>Fu</keyname>
+                        <forenames>Emma</forenames>
+                </author>
+                <author>
+                    <keyname>Thompson</keyname>
+                        <forenames>Neil</forenames>
+                </author>
+        </authors>
+        <title>The AI-Enabled Scientific Frontier</title>
+            <categories>cs.AI cs.LG cs.PF econ.GN q-fin.EC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method. But how true are these claims? Does AI outperform all techniques, or only some, and how is this changing? To assess the claims, we assemble a corpus of 2,507 head-to-head comparisons between AI and other scientific analysis techniques across 27 scientific disciplines from papers published between 2000 and early 2025. We find a profound dichotomy. Relative to traditional statistics, AI often outperforms, but at a significantly higher computational cost. But there are also nearly a quarter of cases where AI is both more expensive and performs worse than traditional statistical techniques and this fraction has been stable for a decade. Relative to scientific computing, AI often underperforms, but at lower computational cost. This has begun to change: since 2020, AI&#39;s performance against scientific computing has notably strengthened and it now outperforms on more than half of comparisons. These patterns suggest that AI is therefore not a universal replacement for existing methods, but rather a valuable -- and improving -- part of a new AI-enabled scientific frontier.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.txt b/research/fog-of-knowledge/data/evidence/snapshots/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.txt
new file mode 100644
index 000000000..33542959f
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25.txt
@@ -0,0 +1,95 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:45Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.14022" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.14022</identifier>
+        <datestamp>2026-09-15</datestamp>
+            <setSpec>cs:cs:NI</setSpec>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.14022</id>
+        <created>2026-09-12</created>
+            <updated>2026-09-15</updated>
+        <authors>
+                <author>
+                    <keyname>Haigh</keyname>
+                        <forenames>Paul Anthony</forenames>
+                </author>
+                <author>
+                    <keyname>Rajbhandari</keyname>
+                        <forenames>Sujan</forenames>
+                </author>
+                <author>
+                    <keyname>Bottrill</keyname>
+                        <forenames>Kyle</forenames>
+                </author>
+                <author>
+                    <keyname>Trichili</keyname>
+                        <forenames>Abderrahmen</forenames>
+                </author>
+                <author>
+                    <keyname>Watson</keyname>
+                        <forenames>Scott</forenames>
+                </author>
+                <author>
+                    <keyname>Abumarshoud</keyname>
+                        <forenames>Hanaa</forenames>
+                </author>
+                <author>
+                    <keyname>Benton</keyname>
+                        <forenames>David</forenames>
+                </author>
+                <author>
+                    <keyname>Sinanovic</keyname>
+                        <forenames>Sinan</forenames>
+                </author>
+                <author>
+                    <keyname>Herrnsdorf</keyname>
+                        <forenames>Johannes</forenames>
+                </author>
+                <author>
+                    <keyname>Christopher</keyname>
+                        <forenames>Peter</forenames>
+                </author>
+                <author>
+                    <keyname>Khalily</keyname>
+                        <forenames>Mohsen</forenames>
+                </author>
+                <author>
+                    <keyname>Tafazolli</keyname>
+                        <forenames>Rahim</forenames>
+                </author>
+                <author>
+                    <keyname>Haas</keyname>
+                        <forenames>Harad</forenames>
+                </author>
+                <author>
+                    <keyname>Lavery</keyname>
+                        <forenames>Martin</forenames>
+                </author>
+                <author>
+                    <keyname>Popoola</keyname>
+                        <forenames>Wasiu</forenames>
+                </author>
+        </authors>
+        <title>Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space</title>
+            <categories>cs.NI eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Next-generation connectivity depends on data traversing multiple physical media within a single end-to-end path, yet research in optical fibre, free-space optical and radio wireless, non-terrestrial networks, and underwater communications has advanced largely in isolation. This fragmentation has a wider adverse impact on communication performance, deployment and adaption as the most demanding open problems in next-generation connectivity, cross-medium channel characterisation, transport-layer protocol design across heterogeneous latency regimes, and cross-domain orchestration, sit at the boundaries between domains and can only be addressed by bringing these challenges together in cross-domain systems. Space-air-ground integrated network research has begun to treat three domains analytically, and its recent extension to the sea surface represents the most ambitious multi-domain framework proposed to date, yet neither has produced experimental results, a deployed system, or a standards engagement. The subsurface and maritime domain remains absent from both. This paper proposes the connected heterogeneous all-medium integrated network (CHAIN), a framework that treats the undersea, maritime, terrestrial, aerial and space domains as a single design space. We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge. We survey the state of the art across all domains and the existing cross-domain literature, develop the CHAIN framework and its technical pillars, characterise the five core open problems the field must resolve, and set out a research roadmap from near-term measurement campaigns and testbed validation through cross-medium field trials to global-scale deployment.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.txt b/research/fog-of-knowledge/data/evidence/snapshots/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.txt
new file mode 100644
index 000000000..49f4cad83
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:49Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12866" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12866</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12866</id>
+        <created>2026-09-11</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Buciulea</keyname>
+                        <forenames>Andrei</forenames>
+                </author>
+                <author>
+                    <keyname>Isufi</keyname>
+                        <forenames>Elvin</forenames>
+                </author>
+                <author>
+                    <keyname>Leus</keyname>
+                        <forenames>Geert</forenames>
+                </author>
+                <author>
+                    <keyname>Marques</keyname>
+                        <forenames>Antonio G.</forenames>
+                </author>
+        </authors>
+        <title>Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, making them inadequate for datasets exhibiting higher-order interactions. Simplicial complexes (SCs) have emerged as a promising framework for capturing such higher-order dependencies. This paper focuses on the problem of identifying the topology of an SC from signals, which serves as the foundation for SC-based processing and learning schemes. We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices). We assume the observed signals are smooth over the unknown SC topology, and that the higher-order interactions are sparse. Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it. A key step in our formulation is the modeling of the topology of the SC using binary edge and triangle selection vectors, combined with efficient greedy algorithms for optimizing such vectors. We establish theoretical convergence guarantees to a stationary point of a relaxed (penalized) version of the problem and discuss computational complexity. Multiple numerical experiments with both synthetic and real-world datasets validate the effectiveness of our approach, highlighting the capability of SC-learning methods to uncover and model higher-order relationships in complex datasets.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.txt b/research/fog-of-knowledge/data/evidence/snapshots/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.txt
new file mode 100644
index 000000000..f3c9f601a
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779.txt
@@ -0,0 +1,48 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:12Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.17042" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.17042</identifier>
+        <datestamp>2026-09-16</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:RO</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.17042</id>
+        <created>2026-09-15</created>
+            <updated>2026-09-16</updated>
+        <authors>
+                <author>
+                    <keyname>Kumar</keyname>
+                        <forenames>Sreejan</forenames>
+                </author>
+                <author>
+                    <keyname>Mattar</keyname>
+                        <forenames>Marcelo</forenames>
+                </author>
+                <author>
+                    <keyname>Duncker</keyname>
+                        <forenames>Lea</forenames>
+                </author>
+        </authors>
+        <title>Learning Options for Compositional Motor Control with Adapter Banks</title>
+            <categories>cs.LG cs.RO q-bio.NC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Learning flexible motor primitives is a hallmark of skilled motor control. Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned. We translate this principle into a novel architecture for learning motor skills end-to-end: a shared recurrent core modulated by a bank of residual adapters, each selected by a discrete latent code. Trained on closed-loop biomechanical control, the adapters develop emergent low-rank perturbations of the recurrent dynamics despite no architectural rank constraint, placing task representations in disparate subspaces of the shared core network. A simple high-level policy over the learned options, optimized while the whole network is frozen, sequences the low-rank adapters to produce novel out-of-distribution movements. We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.txt b/research/fog-of-knowledge/data/evidence/snapshots/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.txt
new file mode 100644
index 000000000..23a8fadb9
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af.txt
@@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:56Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.12016" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.12016</identifier>
+        <datestamp>2026-09-14</datestamp>
+            <setSpec>cs:cs:LG</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>eess:eess:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.12016</id>
+        <created>2026-09-10</created>
+            <updated>2026-09-14</updated>
+        <authors>
+                <author>
+                    <keyname>Haroon</keyname>
+                        <forenames>Adam</forenames>
+                </author>
+                <author>
+                    <keyname>Rodríguez-Seda</keyname>
+                        <forenames>Erick J.</forenames>
+                </author>
+                <author>
+                    <keyname>Schuler</keyname>
+                        <forenames>Tristan</forenames>
+                </author>
+                <author>
+                    <keyname>Fleming</keyname>
+                        <forenames>Cody</forenames>
+                </author>
+        </authors>
+        <title>Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks</title>
+            <categories>cs.LG cs.SY eess.SY</categories>
+            <comments>8 pages, 3 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Self-triggered reinforcement learning control (RL-STC) learns the sparsest control schedule that preserves Lyapunov-decreasing stability under a Run-Time Assurance (RTA) override. We invert this: an adversarial RL agent learns the sparsest jamming or Denial-of-Service (DoS) schedule that destabilizes the closed loop, with a Lyapunov-increase admissibility predicate mirroring the defender&#39;s safety certificate. We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary. This extends the DoS-scheduling count-budget analysis from periodic and linear-time-invariant to STC controllers. Empirically, we train against four fixed defenders per plant (one Linear Quadratic Regulator (LQR) and three RL-STC) on Pendulum, CartPole, and Quadrotor2D. The learned adversary is the only adversary that crashes every defender on every plant at $100\%$: greedy misses Quadrotor2D LQR on $42\%$ of episodes and periodic misses Pendulum LQR on $97\%$. On jam-time-per-failure it beats baselines by up to $2.8\times$, and shows its widest absolute margin on Quadrotor2D LQR. Robustness ablations show that Gaussian observation noise exceeding the initial-state magnitude and position-only observation both preserve $100\%$ failure rate and keep the learned adversary strictly ahead of both baselines on jam-time-per-failure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.txt b/research/fog-of-knowledge/data/evidence/snapshots/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.txt
new file mode 100644
index 000000000..9effb86ce
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192.txt
@@ -0,0 +1,52 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-10T17:37:33Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.03964" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.03964</identifier>
+        <datestamp>2026-10-06</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.03964</id>
+        <created>2026-10-02</created>
+            <updated>2026-10-06</updated>
+        <authors>
+                <author>
+                    <keyname>Hamad</keyname>
+                        <forenames>Ahrar N.</forenames>
+                </author>
+                <author>
+                    <keyname>Qidan</keyname>
+                        <forenames>Ahmad Adnan</forenames>
+                </author>
+                <author>
+                    <keyname>El-Gorashi</keyname>
+                        <forenames>Taisir E. H.</forenames>
+                </author>
+                <author>
+                    <keyname>Elmirghani</keyname>
+                        <forenames>Jaafar M. H.</forenames>
+                </author>
+        </authors>
+        <title>Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL</title>
+            <categories>eess.SY cs.SY</categories>
+            <comments>6 pages, 4 figures</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Hybrid radio frequency (RF) and visible light communication (VLC) networks have emerged as a promising solution for high-capacity indoor wireless connectivity in sixth-generation (6G) systems. However, the limited optical coverage and vulnerability of VLC links to line-of-sight (LoS) blockage under user mobility remain fundamental challenges. In this work, a mirror-based intelligent reflecting surface (IRS) is deployed to assist a dynamic indoor hybrid RF/VLC network, where each mobile user is exclusively assigned to either the IRS-enhanced VLC subnetwork or the RF subnetwork through a binary selection decision. A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles. To enable real-time adaptability, the problem is reformulated as a Markov decision process (MDP) and solved using a cooperative multi-agent deep reinforcement learning (DRL) algorithm based on centralized training with decentralized execution. Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks. The results further validate the practicality and effectiveness of the proposed DRL framework compared to widely adopted DRL algorithms as well as conventional model-based optimization approaches.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.txt b/research/fog-of-knowledge/data/evidence/snapshots/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.txt
new file mode 100644
index 000000000..42c3e9341
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-16T16:54:39Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.12604" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.12604</identifier>
+        <datestamp>2026-10-12</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.12604</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-12</updated>
+        <authors>
+                <author>
+                    <keyname>Pires</keyname>
+                        <forenames>Francisco I. T.</forenames>
+                </author>
+                <author>
+                    <keyname>Ferreira</keyname>
+                        <forenames>Jean C. S.</forenames>
+                </author>
+                <author>
+                    <keyname>Asim</keyname>
+                        <forenames>Fazal-E</forenames>
+                </author>
+        </authors>
+        <title>Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>This paper presents a low-complexity tensor-based channel estimation framework for downlink mmWave massive MIMO systems using passive Butler-matrix beamforming. By modeling received signals as a third-order PARAFAC tensor, we exploit known pilot structures via bilinear alternating least-squares (BALS) optimization to reduce computational overhead. The decoupled spatial factors are then processed via 1D and 2D ESPRIT to extract angles of arrival and departure with automatic pairing. Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture. Simulations confirm the proposed estimator outperforms conventional least-squares, achieving accurate channel reconstruction and approaching the CRLB at moderate-to-high signal-to-noise ratios.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.txt b/research/fog-of-knowledge/data/evidence/snapshots/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.txt
new file mode 100644
index 000000000..d1d0db357
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42.txt
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-15T20:38:08Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.11359" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.11359</identifier>
+        <datestamp>2026-10-09</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.11359</id>
+        <created>2026-10-08</created>
+            <updated>2026-10-09</updated>
+        <authors>
+                <author>
+                    <keyname>Kojima</keyname>
+                        <forenames>Hayate</forenames>
+                </author>
+                <author>
+                    <keyname>Noguchi</keyname>
+                        <forenames>Hikari</forenames>
+                </author>
+                <author>
+                    <keyname>Yamada</keyname>
+                        <forenames>Koki</forenames>
+                </author>
+                <author>
+                    <keyname>Tanaka</keyname>
+                        <forenames>Yuichi</forenames>
+                </author>
+        </authors>
+        <title>Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors</title>
+            <categories>eess.SP</categories>
+            <comments>Submitted to IEEE Transactions on Signal and Information Processing over Networks</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>In this paper, we propose restoration methods for time-varying graph signals using deep algorithm unrolling (DAU). Time-varying graph signals, such as signals obtained from sensor networks, are nonuniformly distributed in space and observed as time series. Since these observed signals often contain noise and missing values, their restoration needs to consider both spatial and temporal relationships. Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness. We then unroll the iterative conjugate gradient method to solve this problem and learn the regularization parameters and filter coefficients in each iteration. Our method can be applied to supervised batch, supervised online, and unsupervised batch settings to learn these parameters. Experiments on several synthetic and real-world datasets show that the supervised batch method achieves the lowest RMSEs in almost all cases. The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.txt b/research/fog-of-knowledge/data/evidence/snapshots/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.txt
new file mode 100644
index 000000000..a43c6a7ff
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c.txt
@@ -0,0 +1,42 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:42:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.22615" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.22615</identifier>
+        <datestamp>2026-09-22</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.22615</id>
+        <created>2026-09-18</created>
+            <updated>2026-09-22</updated>
+        <authors>
+                <author>
+                    <keyname>Guo</keyname>
+                        <forenames>Guangpu</forenames>
+                </author>
+                <author>
+                    <keyname>Xia</keyname>
+                        <forenames>Xiang-Gen</forenames>
+                </author>
+        </authors>
+        <title>Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>The Chinese remainder theorem (CRT) is highly sensitive to remainder errors. Robust CRT addresses this problem by recovering the folding integers correctly from erroneous remainders, so that the final reconstruction error is bounded by the remainder error level. The existing dynamic range--robustness tradeoff results mainly assume a uniform remainder error bound, where all remainders share one scalar error bound. This paper studies the exact tradeoff when the remainder error bound is a vector in the sense that different remainders may have different error bounds. For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination. Based on this condition, we characterize the largest admissible range length, called the dynamic range, for a given remainder error bound vector. Conversely, for a given range length, we characterize all remainder error bound vectors under which remainder errors can be tolerated. We also give an exact folding integer vector decoding algorithm. We show that the proposed results reduce to the classical CRT in the error-free case and coincide with the known result when all remainder error bounds are equal. Numerical results show that the dynamic range depends on the full remainder error bound vector. They also show that the remainders are coupled in the robustness, which cannot be captured by a single uniform error bound.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.txt b/research/fog-of-knowledge/data/evidence/snapshots/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.txt
new file mode 100644
index 000000000..afdfbc5a7
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa.txt
@@ -0,0 +1,46 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:41:38Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.28815" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.28815</identifier>
+        <datestamp>2026-09-25</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.28815</id>
+        <created>2026-09-23</created>
+            <updated>2026-09-25</updated>
+        <authors>
+                <author>
+                    <keyname>Eslami</keyname>
+                        <forenames>Shima</forenames>
+                </author>
+                <author>
+                    <keyname>Kaleva</keyname>
+                        <forenames>Jarkko</forenames>
+                </author>
+                <author>
+                    <keyname>Tölli</keyname>
+                        <forenames>Antti</forenames>
+                </author>
+        </authors>
+        <title>Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Near-field (N-F) line-of-sight (LoS) MIMO channels admit a compact representation through a small number of geometric parameters describing the relative transceiver geometry, enabling low-overhead channel acquisition without estimating the full channel matrix. This paper considers downlink (DL) channel acquisition under practical asymmetric user-equipment (UE) antenna capabilities with multiple DL receive antennas, but only a single active uplink (UL) transmit chain. In this setting, UL observations across the large BS aperture enable accurate estimation of the relative location of the UL-active UE antenna but are insufficient to determine the orientation of the entire UE array. We propose a two-stage geometry-based N-F LoS MIMO channel acquisition framework that distributes the estimation of the channel-defining geometric parameters between the BS and UE. First, a single UL pilot sequence enables the BS to estimate two BS-side reference angles that parameterize the relative location of the UL-active UE antenna. The BS conveys these estimates to the UE and transmits two DL pilot sequences, from which the UE estimates the remaining array-orientation parameter. We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty. Numerical results characterize the resulting error propagation and demonstrate accurate estimation of the geometric parameters and reconstruction of the LoS MIMO channel using one UL and two DL pilot sequences.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.txt b/research/fog-of-knowledge/data/evidence/snapshots/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.txt
new file mode 100644
index 000000000..d6f4254dd
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:26:29Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2608.24219" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2608.24219</identifier>
+        <datestamp>2026-08-26</datestamp>
+            <setSpec>cs:cs:CV</setSpec>
+            <setSpec>q-bio:q-bio:NC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2608.24219</id>
+        <created>2026-08-25</created>
+            <updated>2026-08-26</updated>
+        <authors>
+                <author>
+                    <keyname>López</keyname>
+                        <forenames>Francisco M.</forenames>
+                </author>
+                <author>
+                    <keyname>Triesch</keyname>
+                        <forenames>Jochen</forenames>
+                </author>
+        </authors>
+        <title>Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception</title>
+            <categories>cs.CV q-bio.NC</categories>
+            <comments>24 pages, 11 figures, 1 table</comments>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Facial attractiveness has been linked to statistical regularities such as symmetry and averageness, suggesting that beauty may depend on the ease with which a face is perceived. We empirically test this hypothesis by training variational autoencoders on four face datasets without attractiveness supervision and evaluating their representations on the 597 faces from the Chicago Face Database. Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space. Independently learned latent spaces contain an attractiveness direction that transfers strongly across random initializations and training data. We also find that attractive faces are more prototypical in both shape and latent space. Our results connect classic accounts of aesthetics with learned generative models and provide empirical support for a variational interpretation of the processing fluency theory of aesthetic pleasure.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.txt b/research/fog-of-knowledge/data/evidence/snapshots/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.txt
new file mode 100644
index 000000000..152435ee1
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e.txt
@@ -0,0 +1,50 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-17T07:13:11Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.16259" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.16259</identifier>
+        <datestamp>2026-10-14</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.16259</id>
+        <created>2026-10-12</created>
+            <updated>2026-10-14</updated>
+        <authors>
+                <author>
+                    <keyname>Luo</keyname>
+                        <forenames>Yubin</forenames>
+                </author>
+                <author>
+                    <keyname>Zhu</keyname>
+                        <forenames>Jieao</forenames>
+                </author>
+                <author>
+                    <keyname>Takahashi</keyname>
+                        <forenames>Takumi</forenames>
+                </author>
+                <author>
+                    <keyname>Ochiai</keyname>
+                        <forenames>Hideki</forenames>
+                </author>
+        </authors>
+        <title>Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>
+            <abstract>Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models. This paper studies channel instability near electromag- netic singular states, where small environmental perturbations can cause large variations in the end-to-end channel. Using resolvent-based spectral analysis, we develop an electromag- netic multiple-input multiple-output (MIMO) channel model that decomposes the end-to-end channel into a smooth regular component and singularity-associated components. The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states. The proposed model also reveals a limitation of conventional water filling (WF): power allocation based only on instan- taneous channel gains does not account for such instability. We therefore estimate singularity information from broadband MIMO channel state information (CSI) and develop a singularity- aware transmit covariance optimization method. Simulations demonstrate numerical stability of the estimated pole frequencies and illustrate the environmental sensitivity of pole-associated channel components. The proposed allocation reduces weighted singular-channel exposure by 90.32% while retaining 95% of the nominal WF rate.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.txt b/research/fog-of-knowledge/data/evidence/snapshots/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.txt
new file mode 100644
index 000000000..d500bcbe2
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff.txt
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:43:09Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2609.02071" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2609.02071</identifier>
+        <datestamp>2026-09-03</datestamp>
+            <setSpec>eess:eess:SY</setSpec>
+            <setSpec>cs:cs:SY</setSpec>
+            <setSpec>math:math:OC</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2609.02071</id>
+        <created>2026-09-02</created>
+            <updated>2026-09-03</updated>
+        <authors>
+                <author>
+                    <keyname>Schiller</keyname>
+                        <forenames>Julian D.</forenames>
+                </author>
+                <author>
+                    <keyname>Müller</keyname>
+                        <forenames>Matthias A.</forenames>
+                </author>
+        </authors>
+        <title>Turnpike properties in nonlinear system identification</title>
+            <categories>eess.SY cs.SY math.OC</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>We analyze the problem of learning general discrete-time nonlinear state-space models using the simulation error minimization (SEM) method. In this setting, model parameters are typically learned by minimizing the mismatch between simulated and measured outputs over a training dataset, or shorter subsequences extracted from it. Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state. In the presence of non-unique optimal output sequences---as may arise, for instance, in fully black-box system identification using neural networks---the property is formulated with respect to the closest such sequence. Turnpike behavior is generally desirable in practice, as it provides a theoretical justification for employing computationally more tractable SEM formulations with fixed initial states while ensuring that their optimal output sequences remain close to unconstrained optimal ones. Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity. We additionally introduce a cardinality turnpike property and show that it is strictly weaker than the cumulative notion. Finally, we establish sufficient conditions for turnpike behavior based on incremental output stability, convexity of the stage cost, and a suitable optimality condition, and illustrate the theory by means of a numerical example.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/evidence/snapshots/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.txt b/research/fog-of-knowledge/data/evidence/snapshots/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.txt
new file mode 100644
index 000000000..54450ff63
--- /dev/null
+++ b/research/fog-of-knowledge/data/evidence/snapshots/fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68.txt
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" 
+         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
+    <responseDate>2026-10-18T16:39:36Z</responseDate>
+                <request verb="GetRecord" identifier="oai:arXiv.org:2610.19137" metadataPrefix="arXiv">http://oaipmh.arxiv.org/oai</request>
+
+
+    <GetRecord>
+                <record>
+                <header>
+        <identifier>oai:arXiv.org:2610.19137</identifier>
+        <datestamp>2026-10-15</datestamp>
+            <setSpec>eess:eess:SP</setSpec>
+    </header>
+
+            <metadata>
+                        <arXiv xmlns="http://arxiv.org/OAI/arXiv/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd">
+        <id>2610.19137</id>
+        <created>2026-10-13</created>
+            <updated>2026-10-15</updated>
+        <authors>
+                <author>
+                    <keyname>Park</keyname>
+                        <forenames>Jaebum</forenames>
+                </author>
+                <author>
+                    <keyname>Xie</keyname>
+                        <forenames>Yutao</forenames>
+                </author>
+                <author>
+                    <keyname>Ghosh</keyname>
+                        <forenames>Amitava</forenames>
+                </author>
+                <author>
+                    <keyname>Shi</keyname>
+                        <forenames>Yuanyuan</forenames>
+                </author>
+                <author>
+                    <keyname>Heath</keyname>
+                        <forenames>Robert W.</forenames>
+                        <suffix>Jr</suffix>
+                </author>
+        </authors>
+        <title>Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations</title>
+            <categories>eess.SP</categories>
+            <license>http://creativecommons.org/licenses/by/4.0/</license>
+            <abstract>Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity. We jointly optimize base station and battery operation under a carbon-adjusted electricity price and traffic-demand constraints, and solve the mixed-integer nonconvex problem through a two-stage decomposition exact under a minimum-power rule. Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned. Above a carbon price of roughly 100-300 USD/ton, battery operation shifts from cost-driven to carbon-driven, cutting emissions by up to 57.8% relative to a cost-only schedule.</abstract>
+    </arXiv>
+
+            </metadata>
+        </record>
+
+    </GetRecord>
+</OAI-PMH>
\ No newline at end of file
diff --git a/research/fog-of-knowledge/data/knowledge.json b/research/fog-of-knowledge/data/knowledge.json
index 5361d570f..18d869e2c 100644
--- a/research/fog-of-knowledge/data/knowledge.json
+++ b/research/fog-of-knowledge/data/knowledge.json
@@ -127852,486 +127852,4711 @@
         ]
       },
       "aliases": []
-    }
-  ],
-  "edges": [
-    {
-      "source": "root.material",
-      "target": "practice.toolmaking",
-      "type": "enabled",
-      "dependency": "soft"
-    },
-    {
-      "source": "root.cause-effect",
-      "target": "practice.toolmaking",
-      "type": "enabled",
-      "dependency": "soft"
-    },
-    {
-      "source": "root.cause-effect",
-      "target": "practice.fire",
-      "type": "enabled",
-      "dependency": "soft"
-    },
-    {
-      "source": "root.safe-danger",
-      "target": "practice.fire",
-      "type": "enabled",
-      "dependency": "soft"
     },
     {
-      "source": "root.time-cycle",
-      "target": "practice.fire",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-21653",
+      "label": "How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-21653",
+          "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.21653",
+          "title": "arXiv:2610.21653",
+          "url": "https://arxiv.org/abs/2610.21653"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-15",
+        "source_ids": [
+          "source.frontier.arxiv-2610-21653"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.place",
-      "target": "practice.tracking",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-19722",
+      "label": "ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19722",
+          "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.19722",
+          "title": "arXiv:2610.19722",
+          "url": "https://arxiv.org/abs/2610.19722"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-14",
+        "source_ids": [
+          "source.frontier.arxiv-2610-19722"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.cause-effect",
-      "target": "practice.tracking",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-19515",
+      "label": "Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19515",
+          "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.19515",
+          "title": "arXiv:2610.19515",
+          "url": "https://arxiv.org/abs/2610.19515"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-14",
+        "source_ids": [
+          "source.frontier.arxiv-2610-19515"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.living-dead",
-      "target": "practice.tracking",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-19137",
+      "label": "Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19137",
+          "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.19137",
+          "title": "arXiv:2610.19137",
+          "url": "https://arxiv.org/abs/2610.19137"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-13",
+        "source_ids": [
+          "source.frontier.arxiv-2610-19137"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.kin-social",
-      "target": "practice.oral-tradition",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-17295",
+      "label": "Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-17295",
+          "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.17295",
+          "title": "arXiv:2610.17295",
+          "url": "https://arxiv.org/abs/2610.17295"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-12",
+        "source_ids": [
+          "source.frontier.arxiv-2610-17295"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.quantity",
-      "target": "concept.counting",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-16273",
+      "label": "Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-16273",
+          "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.16273",
+          "title": "arXiv:2610.16273",
+          "url": "https://arxiv.org/abs/2610.16273"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-12",
+        "source_ids": [
+          "source.frontier.arxiv-2610-16273"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "concept.counting",
-      "target": "field.geometry",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-16259",
+      "label": "Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-16259",
+          "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.16259",
+          "title": "arXiv:2610.16259",
+          "url": "https://arxiv.org/abs/2610.16259"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-12",
+        "source_ids": [
+          "source.frontier.arxiv-2610-16259"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "practice.oral-tradition",
-      "target": "practice.writing",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-15934",
+      "label": "Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-15934",
+          "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.15934",
+          "title": "arXiv:2610.15934",
+          "url": "https://arxiv.org/abs/2610.15934"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-11",
+        "source_ids": [
+          "source.frontier.arxiv-2610-15934"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.time-cycle",
-      "target": "field.astronomy",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-15072",
+      "label": "UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-15072",
+          "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.15072",
+          "title": "arXiv:2610.15072",
+          "url": "https://arxiv.org/abs/2610.15072"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-10",
+        "source_ids": [
+          "source.frontier.arxiv-2610-15072"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.place",
-      "target": "field.navigation",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-15052",
+      "label": "On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-15052",
+          "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.15052",
+          "title": "arXiv:2610.15052",
+          "url": "https://arxiv.org/abs/2610.15052"
+        },
+        {
+          "id": "doi:10.1109/rusautocon69876.2026.11707364",
+          "title": "doi:10.1109/rusautocon69876.2026.11707364",
+          "url": "https://doi.org/10.1109/rusautocon69876.2026.11707364"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-10",
+        "source_ids": [
+          "source.frontier.arxiv-2610-15052"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.astronomy",
-      "target": "field.navigation",
-      "type": "supports",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-13424",
+      "label": "Minimum-Energy Control for Stochastic Linear Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-13424",
+          "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.13424",
+          "title": "arXiv:2610.13424",
+          "url": "https://arxiv.org/abs/2610.13424"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-09",
+        "source_ids": [
+          "source.frontier.arxiv-2610-13424"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "root.time-cycle",
-      "target": "practice.agriculture",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-13402",
+      "label": "Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-13402",
+          "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.13402",
+          "title": "arXiv:2610.13402",
+          "url": "https://arxiv.org/abs/2610.13402"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-09",
+        "source_ids": [
+          "source.frontier.arxiv-2610-13402"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "practice.tracking",
-      "target": "practice.agriculture",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-12779",
+      "label": "Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12779",
+          "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.12779",
+          "title": "arXiv:2610.12779",
+          "url": "https://arxiv.org/abs/2610.12779"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-12779"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "concept.counting",
-      "target": "field.algebra",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-12604",
+      "label": "Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12604",
+          "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.12604",
+          "title": "arXiv:2610.12604",
+          "url": "https://arxiv.org/abs/2610.12604"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-12604"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.geometry",
-      "target": "field.optics",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-12592",
+      "label": "Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12592",
+          "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.12592",
+          "title": "arXiv:2610.12592",
+          "url": "https://arxiv.org/abs/2610.12592"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-12592"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.navigation",
-      "target": "field.cartography",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-12038",
+      "label": "Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12038",
+          "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.12038",
+          "title": "arXiv:2610.12038",
+          "url": "https://arxiv.org/abs/2610.12038"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-12038"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "practice.writing",
-      "target": "field.logic",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-11869",
+      "label": "Learning structured linear dynamical systems from missing observations",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-11869",
+          "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.11869",
+          "title": "arXiv:2610.11869",
+          "url": "https://arxiv.org/abs/2610.11869"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-11869"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.philosophy",
-      "target": "field.logic",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-11359",
+      "label": "Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-11359",
+          "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.11359",
+          "title": "arXiv:2610.11359",
+          "url": "https://arxiv.org/abs/2610.11359"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-11359"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.logic",
-      "target": "method.scientific",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-04959",
+      "label": "AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04959",
+          "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04959",
+          "title": "arXiv:2610.04959",
+          "url": "https://arxiv.org/abs/2610.04959"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-08",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04959"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "method.scientific",
-      "target": "field.physics",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-09266",
+      "label": "Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09266",
+          "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.09266",
+          "title": "arXiv:2610.09266",
+          "url": "https://arxiv.org/abs/2610.09266"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-07",
+        "source_ids": [
+          "source.frontier.arxiv-2610-09266"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "method.scientific",
-      "target": "field.chemistry",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-09080",
+      "label": "User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09080",
+          "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.09080",
+          "title": "arXiv:2610.09080",
+          "url": "https://arxiv.org/abs/2610.09080"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-06",
+        "source_ids": [
+          "source.frontier.arxiv-2610-09080"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "method.scientific",
-      "target": "field.geology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-09010",
+      "label": "Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09010",
+          "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.09010",
+          "title": "arXiv:2610.09010",
+          "url": "https://arxiv.org/abs/2610.09010"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-06",
+        "source_ids": [
+          "source.frontier.arxiv-2610-09010"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "method.scientific",
-      "target": "field.biology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-08744",
+      "label": "RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-08744",
+          "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.08744",
+          "title": "arXiv:2610.08744",
+          "url": "https://arxiv.org/abs/2610.08744"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-06",
+        "source_ids": [
+          "source.frontier.arxiv-2610-08744"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.geometry",
-      "target": "field.physics",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-07616",
+      "label": "Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-07616",
+          "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.07616",
+          "title": "arXiv:2610.07616",
+          "url": "https://arxiv.org/abs/2610.07616"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-06",
+        "source_ids": [
+          "source.frontier.arxiv-2610-07616"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.algebra",
-      "target": "field.physics",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-07307",
+      "label": "Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-07307",
+          "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.07307",
+          "title": "arXiv:2610.07307",
+          "url": "https://arxiv.org/abs/2610.07307"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-05",
+        "source_ids": [
+          "source.frontier.arxiv-2610-07307"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.phlogiston",
-      "target": "concept.phlogiston-program",
-      "type": "depends_on",
-      "dependency": "hard"
+      "id": "claim.frontier.arxiv-2610-06601",
+      "label": "Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-06601",
+          "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.06601",
+          "title": "arXiv:2610.06601",
+          "url": "https://arxiv.org/abs/2610.06601"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-05",
+        "source_ids": [
+          "source.frontier.arxiv-2610-06601"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.miasma",
-      "target": "practice.miasma-control",
-      "type": "depends_on",
-      "dependency": "hard"
+      "id": "claim.frontier.arxiv-2610-04776",
+      "label": "Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04776",
+          "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04776",
+          "title": "arXiv:2610.04776",
+          "url": "https://arxiv.org/abs/2610.04776"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-03",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04776"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.biology",
-      "target": "claim.evolution",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-04697",
+      "label": "Efficiency and robustness partition the solution space for memory in recurrent networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04697",
+          "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04697",
+          "title": "arXiv:2610.04697",
+          "url": "https://arxiv.org/abs/2610.04697"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-03",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04697"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.evolution",
-      "target": "field.genetics",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-04662",
+      "label": "Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04662",
+          "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04662",
+          "title": "arXiv:2610.04662",
+          "url": "https://arxiv.org/abs/2610.04662"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-03",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04662"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.biology",
-      "target": "field.ecology",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-04630",
+      "label": "Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04630",
+          "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04630",
+          "title": "arXiv:2610.04630",
+          "url": "https://arxiv.org/abs/2610.04630"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-03",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04630"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.biology",
-      "target": "field.microbiology",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-04242",
+      "label": "Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04242",
+          "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.04242",
+          "title": "arXiv:2610.04242",
+          "url": "https://arxiv.org/abs/2610.04242"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-03",
+        "source_ids": [
+          "source.frontier.arxiv-2610-04242"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.microbiology",
-      "target": "claim.germ-theory",
-      "type": "supports",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-06918",
+      "label": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-06918",
+          "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.06918",
+          "title": "arXiv:2610.06918",
+          "url": "https://arxiv.org/abs/2610.06918"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-02",
+        "source_ids": [
+          "source.frontier.arxiv-2610-06918"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.germ-theory",
-      "target": "claim.miasma",
-      "type": "supersedes",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-03964",
+      "label": "Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-03964",
+          "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.03964",
+          "title": "arXiv:2610.03964",
+          "url": "https://arxiv.org/abs/2610.03964"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-02",
+        "source_ids": [
+          "source.frontier.arxiv-2610-03964"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.chemistry",
-      "target": "field.thermodynamics",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2610-03008",
+      "label": "Response Variability and Stability in Human Reasoning",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-03008",
+          "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2610.03008",
+          "title": "arXiv:2610.03008",
+          "url": "https://arxiv.org/abs/2610.03008"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-10-02",
+        "source_ids": [
+          "source.frontier.arxiv-2610-03008"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.physics",
-      "target": "field.electromagnetism",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-39776",
+      "label": "Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-39776",
+          "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.39776",
+          "title": "arXiv:2609.39776",
+          "url": "https://arxiv.org/abs/2609.39776"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-30",
+        "source_ids": [
+          "source.frontier.arxiv-2609-39776"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.statistics",
-      "target": "field.psychology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-21813",
+      "label": "How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21813",
+          "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.21813",
+          "title": "arXiv:2609.21813",
+          "url": "https://arxiv.org/abs/2609.21813"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-30",
+        "source_ids": [
+          "source.frontier.arxiv-2609-21813"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.statistics",
-      "target": "field.sociology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-36354",
+      "label": "Explainability from Training with Applications to TCR-Epitope Prediction",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-36354",
+          "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.36354",
+          "title": "arXiv:2609.36354",
+          "url": "https://arxiv.org/abs/2609.36354"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-28",
+        "source_ids": [
+          "source.frontier.arxiv-2609-36354"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.physics",
-      "target": "claim.relativity",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-35424",
+      "label": "Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-35424",
+          "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.35424",
+          "title": "arXiv:2609.35424",
+          "url": "https://arxiv.org/abs/2609.35424"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-28",
+        "source_ids": [
+          "source.frontier.arxiv-2609-35424"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.physics",
-      "target": "claim.quantum",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-35246",
+      "label": "Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-35246",
+          "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.35246",
+          "title": "arXiv:2609.35246",
+          "url": "https://arxiv.org/abs/2609.35246"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-28",
+        "source_ids": [
+          "source.frontier.arxiv-2609-35246"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.relativity",
-      "target": "field.cosmology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-32315",
+      "label": "From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-32315",
+          "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.32315",
+          "title": "arXiv:2609.32315",
+          "url": "https://arxiv.org/abs/2609.32315"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-26",
+        "source_ids": [
+          "source.frontier.arxiv-2609-32315"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.astronomy",
-      "target": "field.cosmology",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-29972",
+      "label": "Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
+      "kind": "claim",
+      "domain": "health",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-29972",
+          "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.29972",
+          "title": "arXiv:2609.29972",
+          "url": "https://arxiv.org/abs/2609.29972"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-24",
+        "source_ids": [
+          "source.frontier.arxiv-2609-29972"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.genetics",
-      "target": "field.molecular-biology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-29832",
+      "label": "System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-29832",
+          "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.29832",
+          "title": "arXiv:2609.29832",
+          "url": "https://arxiv.org/abs/2609.29832"
+        },
+        {
+          "id": "doi:10.2514/1.c038636",
+          "title": "doi:10.2514/1.c038636",
+          "url": "https://doi.org/10.2514/1.c038636"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-24",
+        "source_ids": [
+          "source.frontier.arxiv-2609-29832"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.biology",
-      "target": "field.molecular-biology",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-28815",
+      "label": "Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-28815",
+          "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.28815",
+          "title": "arXiv:2609.28815",
+          "url": "https://arxiv.org/abs/2609.28815"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-23",
+        "source_ids": [
+          "source.frontier.arxiv-2609-28815"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.statistics",
-      "target": "field.epidemiology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-26924",
+      "label": "nnFoundation: 3D Foundation Models for Radiology",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-26924",
+          "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.26924",
+          "title": "arXiv:2609.26924",
+          "url": "https://arxiv.org/abs/2609.26924"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-22",
+        "source_ids": [
+          "source.frontier.arxiv-2609-26924"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.germ-theory",
-      "target": "field.epidemiology",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-25847",
+      "label": "Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25847",
+          "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.25847",
+          "title": "arXiv:2609.25847",
+          "url": "https://arxiv.org/abs/2609.25847"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-22",
+        "source_ids": [
+          "source.frontier.arxiv-2609-25847"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.logic",
-      "target": "field.computer-science",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-25701",
+      "label": "Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25701",
+          "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.25701",
+          "title": "arXiv:2609.25701",
+          "url": "https://arxiv.org/abs/2609.25701"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-22",
+        "source_ids": [
+          "source.frontier.arxiv-2609-25701"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.statistics",
-      "target": "field.ai",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-25437",
+      "label": "Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25437",
+          "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.25437",
+          "title": "arXiv:2609.25437",
+          "url": "https://arxiv.org/abs/2609.25437"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-21",
+        "source_ids": [
+          "source.frontier.arxiv-2609-25437"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.computer-science",
-      "target": "field.ai",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-05763",
+      "label": "AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-05763",
+          "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.05763",
+          "title": "arXiv:2609.05763",
+          "url": "https://arxiv.org/abs/2609.05763"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-21",
+        "source_ids": [
+          "source.frontier.arxiv-2609-05763"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.psychology",
-      "target": "field.cognitive-science",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-23703",
+      "label": "Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23703",
+          "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.23703",
+          "title": "arXiv:2609.23703",
+          "url": "https://arxiv.org/abs/2609.23703"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-20",
+        "source_ids": [
+          "source.frontier.arxiv-2609-23703"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.neuroscience",
-      "target": "field.cognitive-science",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-23199",
+      "label": "LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23199",
+          "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.23199",
+          "title": "arXiv:2609.23199",
+          "url": "https://arxiv.org/abs/2609.23199"
+        },
+        {
+          "id": "doi:10.1109/jphot.2026.3734836",
+          "title": "doi:10.1109/jphot.2026.3734836",
+          "url": "https://doi.org/10.1109/jphot.2026.3734836"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-19",
+        "source_ids": [
+          "source.frontier.arxiv-2609-23199"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.quantum",
-      "target": "question.quantum-gravity",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-23085",
+      "label": "Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23085",
+          "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.23085",
+          "title": "arXiv:2609.23085",
+          "url": "https://arxiv.org/abs/2609.23085"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-19",
+        "source_ids": [
+          "source.frontier.arxiv-2609-23085"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "claim.relativity",
-      "target": "question.quantum-gravity",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-22775",
+      "label": "DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-22775",
+          "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.22775",
+          "title": "arXiv:2609.22775",
+          "url": "https://arxiv.org/abs/2609.22775"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-19",
+        "source_ids": [
+          "source.frontier.arxiv-2609-22775"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.cosmology",
-      "target": "question.dark-matter",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-22615",
+      "label": "Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-22615",
+          "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.22615",
+          "title": "arXiv:2609.22615",
+          "url": "https://arxiv.org/abs/2609.22615"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-18",
+        "source_ids": [
+          "source.frontier.arxiv-2609-22615"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.cosmology",
-      "target": "question.dark-energy",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-21966",
+      "label": "Automata-Theoretic Verification of Interval Markov Decision Processes",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21966",
+          "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.21966",
+          "title": "arXiv:2609.21966",
+          "url": "https://arxiv.org/abs/2609.21966"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-18",
+        "source_ids": [
+          "source.frontier.arxiv-2609-21966"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.molecular-biology",
-      "target": "question.origin-life",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-21270",
+      "label": "Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21270",
+          "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.21270",
+          "title": "arXiv:2609.21270",
+          "url": "https://arxiv.org/abs/2609.21270"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-18",
+        "source_ids": [
+          "source.frontier.arxiv-2609-21270"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.neuroscience",
-      "target": "question.consciousness",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-21093",
+      "label": "A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21093",
+          "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.21093",
+          "title": "arXiv:2609.21093",
+          "url": "https://arxiv.org/abs/2609.21093"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-17",
+        "source_ids": [
+          "source.frontier.arxiv-2609-21093"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.cognitive-science",
-      "target": "question.consciousness",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-21057",
+      "label": "FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21057",
+          "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.21057",
+          "title": "arXiv:2609.21057",
+          "url": "https://arxiv.org/abs/2609.21057"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-17",
+        "source_ids": [
+          "source.frontier.arxiv-2609-21057"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.molecular-biology",
-      "target": "question.aging",
-      "type": "enabled",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-19468",
+      "label": "High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-19468",
+          "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.19468",
+          "title": "arXiv:2609.19468",
+          "url": "https://arxiv.org/abs/2609.19468"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-16",
+        "source_ids": [
+          "source.frontier.arxiv-2609-19468"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.climatology",
-      "target": "question.predict-climate",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-18467",
+      "label": "Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-18467",
+          "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.18467",
+          "title": "arXiv:2609.18467",
+          "url": "https://arxiv.org/abs/2609.18467"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-16",
+        "source_ids": [
+          "source.frontier.arxiv-2609-18467"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.ai",
-      "target": "question.general-ai",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-17042",
+      "label": "Learning Options for Compositional Motor Control with Adapter Banks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-17042",
+          "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.17042",
+          "title": "arXiv:2609.17042",
+          "url": "https://arxiv.org/abs/2609.17042"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-15",
+        "source_ids": [
+          "source.frontier.arxiv-2609-17042"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.logic",
-      "target": "question.math-foundations",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-16899",
+      "label": "Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16899",
+          "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.16899",
+          "title": "arXiv:2609.16899",
+          "url": "https://arxiv.org/abs/2609.16899"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-15",
+        "source_ids": [
+          "source.frontier.arxiv-2609-16899"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.sociology",
-      "target": "question.social-prediction",
-      "type": "derived_from",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-16353",
+      "label": "Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16353",
+          "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.16353",
+          "title": "arXiv:2609.16353",
+          "url": "https://arxiv.org/abs/2609.16353"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-14",
+        "source_ids": [
+          "source.frontier.arxiv-2609-16353"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.statistics",
-      "target": "field.genetics",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-16258",
+      "label": "The AI-Enabled Scientific Frontier",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16258",
+          "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.16258",
+          "title": "arXiv:2609.16258",
+          "url": "https://arxiv.org/abs/2609.16258"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-14",
+        "source_ids": [
+          "source.frontier.arxiv-2609-16258"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.chemistry",
-      "target": "field.molecular-biology",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-05749",
+      "label": "The Normalization of Deviance in AI Development",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-05749",
+          "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.05749",
+          "title": "arXiv:2609.05749",
+          "url": "https://arxiv.org/abs/2609.05749"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-13",
+        "source_ids": [
+          "source.frontier.arxiv-2609-05749"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.physics",
-      "target": "field.engineering",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-14022",
+      "label": "Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-14022",
+          "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.14022",
+          "title": "arXiv:2609.14022",
+          "url": "https://arxiv.org/abs/2609.14022"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-12",
+        "source_ids": [
+          "source.frontier.arxiv-2609-14022"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.computer-science",
-      "target": "field.cognitive-science",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-12866",
+      "label": "Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12866",
+          "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.12866",
+          "title": "arXiv:2609.12866",
+          "url": "https://arxiv.org/abs/2609.12866"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-11",
+        "source_ids": [
+          "source.frontier.arxiv-2609-12866"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.ai",
-      "target": "field.systems-biology",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-12486",
+      "label": "Adaptive Agent Design",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12486",
+          "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.12486",
+          "title": "arXiv:2609.12486",
+          "url": "https://arxiv.org/abs/2609.12486"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-11",
+        "source_ids": [
+          "source.frontier.arxiv-2609-12486"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.ecology",
-      "target": "field.climatology",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-12016",
+      "label": "Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12016",
+          "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.12016",
+          "title": "arXiv:2609.12016",
+          "url": "https://arxiv.org/abs/2609.12016"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-10",
+        "source_ids": [
+          "source.frontier.arxiv-2609-12016"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.anthropology",
-      "target": "field.cognitive-science",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-11530",
+      "label": "pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-11530",
+          "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.11530",
+          "title": "arXiv:2609.11530",
+          "url": "https://arxiv.org/abs/2609.11530"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-10",
+        "source_ids": [
+          "source.frontier.arxiv-2609-11530"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.psychology",
-      "target": "field.neuroscience",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-08218",
+      "label": "Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-08218",
+          "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.08218",
+          "title": "arXiv:2609.08218",
+          "url": "https://arxiv.org/abs/2609.08218"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-09",
+        "source_ids": [
+          "source.frontier.arxiv-2609-08218"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.information-theory",
-      "target": "field.genetics",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-06163",
+      "label": "Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-06163",
+          "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.06163",
+          "title": "arXiv:2609.06163",
+          "url": "https://arxiv.org/abs/2609.06163"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-05",
+        "source_ids": [
+          "source.frontier.arxiv-2609-06163"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "field.physics",
-      "target": "smoke.automate-merge",
-      "type": "related",
-      "dependency": "soft"
+      "id": "claim.frontier.arxiv-2609-06066",
+      "label": "Scalability of Graph Neural Network Policies in Wireless Communication Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-06066",
+          "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.06066",
+          "title": "arXiv:2609.06066",
+          "url": "https://arxiv.org/abs/2609.06066"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-05",
+        "source_ids": [
+          "source.frontier.arxiv-2609-06066"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "physical.dark-energy",
-      "target": "physical.cosmic-acceleration",
-      "type": "related"
+      "id": "claim.frontier.arxiv-2609-02071",
+      "label": "Turnpike properties in nonlinear system identification",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-02071",
+          "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2609.02071",
+          "title": "arXiv:2609.02071",
+          "url": "https://arxiv.org/abs/2609.02071"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-09-02",
+        "source_ids": [
+          "source.frontier.arxiv-2609-02071"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "physical.lambda-cdm",
-      "target": "physical.cosmological-constant-de",
-      "type": "depends_on",
-      "dependency": "hard"
+      "id": "claim.frontier.arxiv-2608-31034",
+      "label": "XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-31034",
+          "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.31034",
+          "title": "arXiv:2608.31034",
+          "url": "https://arxiv.org/abs/2608.31034"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-31",
+        "source_ids": [
+          "source.frontier.arxiv-2608-31034"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "physical.wcdm",
-      "target": "physical.lambda-cdm",
-      "type": "refines"
+      "id": "claim.frontier.arxiv-2608-28387",
+      "label": "Neuromorphic architectures as numerical solvers for computational neuroscience",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-28387",
+          "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.28387",
+          "title": "arXiv:2608.28387",
+          "url": "https://arxiv.org/abs/2608.28387"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-28",
+        "source_ids": [
+          "source.frontier.arxiv-2608-28387"
+        ]
+      },
+      "aliases": []
     },
     {
-      "source": "physical.w0wa-cdm",
-      "target": "physical.wcdm",
-      "type": "refines"
-    },
+      "id": "claim.frontier.arxiv-2608-27536",
+      "label": "Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-27536",
+          "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.27536",
+          "title": "arXiv:2608.27536",
+          "url": "https://arxiv.org/abs/2608.27536"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-27",
+        "source_ids": [
+          "source.frontier.arxiv-2608-27536"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-26093",
+      "label": "Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-26093",
+          "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.26093",
+          "title": "arXiv:2608.26093",
+          "url": "https://arxiv.org/abs/2608.26093"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-26",
+        "source_ids": [
+          "source.frontier.arxiv-2608-26093"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-24219",
+      "label": "Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-24219",
+          "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.24219",
+          "title": "arXiv:2608.24219",
+          "url": "https://arxiv.org/abs/2608.24219"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-25",
+        "source_ids": [
+          "source.frontier.arxiv-2608-24219"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-23972",
+      "label": "Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-23972",
+          "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.23972",
+          "title": "arXiv:2608.23972",
+          "url": "https://arxiv.org/abs/2608.23972"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-25",
+        "source_ids": [
+          "source.frontier.arxiv-2608-23972"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-21764",
+      "label": "LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-21764",
+          "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.21764",
+          "title": "arXiv:2608.21764",
+          "url": "https://arxiv.org/abs/2608.21764"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-22",
+        "source_ids": [
+          "source.frontier.arxiv-2608-21764"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-21020",
+      "label": "Frequency-Selective Pinching-Antenna Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-21020",
+          "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.21020",
+          "title": "arXiv:2608.21020",
+          "url": "https://arxiv.org/abs/2608.21020"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-21",
+        "source_ids": [
+          "source.frontier.arxiv-2608-21020"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-20723",
+      "label": "Conscious Access as Continuous-to-Discrete Translation",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-20723",
+          "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.20723",
+          "title": "arXiv:2608.20723",
+          "url": "https://arxiv.org/abs/2608.20723"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-21",
+        "source_ids": [
+          "source.frontier.arxiv-2608-20723"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-19416",
+      "label": "Robust Near-Field Beam Focusing Under Imperfect Localization",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-19416",
+          "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.19416",
+          "title": "arXiv:2608.19416",
+          "url": "https://arxiv.org/abs/2608.19416"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-19",
+        "source_ids": [
+          "source.frontier.arxiv-2608-19416"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-18396",
+      "label": "LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-18396",
+          "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.18396",
+          "title": "arXiv:2608.18396",
+          "url": "https://arxiv.org/abs/2608.18396"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-18",
+        "source_ids": [
+          "source.frontier.arxiv-2608-18396"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-18060",
+      "label": "Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-18060",
+          "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.18060",
+          "title": "arXiv:2608.18060",
+          "url": "https://arxiv.org/abs/2608.18060"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-18",
+        "source_ids": [
+          "source.frontier.arxiv-2608-18060"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-16290",
+      "label": "Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-16290",
+          "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.16290",
+          "title": "arXiv:2608.16290",
+          "url": "https://arxiv.org/abs/2608.16290"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-17",
+        "source_ids": [
+          "source.frontier.arxiv-2608-16290"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-12037",
+      "label": "Clustered Randomized Smoothing for Stochastic Prediction Functions",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12037",
+          "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.12037",
+          "title": "arXiv:2608.12037",
+          "url": "https://arxiv.org/abs/2608.12037"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-12",
+        "source_ids": [
+          "source.frontier.arxiv-2608-12037"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-11929",
+      "label": "Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-11929",
+          "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.11929",
+          "title": "arXiv:2608.11929",
+          "url": "https://arxiv.org/abs/2608.11929"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-12",
+        "source_ids": [
+          "source.frontier.arxiv-2608-11929"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-11175",
+      "label": "Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-11175",
+          "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.11175",
+          "title": "arXiv:2608.11175",
+          "url": "https://arxiv.org/abs/2608.11175"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-11",
+        "source_ids": [
+          "source.frontier.arxiv-2608-11175"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-10825",
+      "label": "Cross-modal topology decodes battery faults from sparse voltage snapshots",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-10825",
+          "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.10825",
+          "title": "arXiv:2608.10825",
+          "url": "https://arxiv.org/abs/2608.10825"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-11",
+        "source_ids": [
+          "source.frontier.arxiv-2608-10825"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-08151",
+      "label": "Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-08151",
+          "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.08151",
+          "title": "arXiv:2608.08151",
+          "url": "https://arxiv.org/abs/2608.08151"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-11",
+        "source_ids": [
+          "source.frontier.arxiv-2608-08151"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-10254",
+      "label": "A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-10254",
+          "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.10254",
+          "title": "arXiv:2608.10254",
+          "url": "https://arxiv.org/abs/2608.10254"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-10",
+        "source_ids": [
+          "source.frontier.arxiv-2608-10254"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-08599",
+      "label": "Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-08599",
+          "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.08599",
+          "title": "arXiv:2608.08599",
+          "url": "https://arxiv.org/abs/2608.08599"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-09",
+        "source_ids": [
+          "source.frontier.arxiv-2608-08599"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-12398",
+      "label": "A Hierarchical Energy-Based Model for Multimodal Cognition",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12398",
+          "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.12398",
+          "title": "arXiv:2608.12398",
+          "url": "https://arxiv.org/abs/2608.12398"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-08",
+        "source_ids": [
+          "source.frontier.arxiv-2608-12398"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-07289",
+      "label": "Synthesizing Voltage Ride-Through Controllers for Data Centers",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-07289",
+          "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.07289",
+          "title": "arXiv:2608.07289",
+          "url": "https://arxiv.org/abs/2608.07289"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-07",
+        "source_ids": [
+          "source.frontier.arxiv-2608-07289"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-05481",
+      "label": "From Local Learning to Global Prediction Through Layered Surprise Cascades",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-05481",
+          "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.05481",
+          "title": "arXiv:2608.05481",
+          "url": "https://arxiv.org/abs/2608.05481"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-06",
+        "source_ids": [
+          "source.frontier.arxiv-2608-05481"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-05348",
+      "label": "TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-05348",
+          "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.05348",
+          "title": "arXiv:2608.05348",
+          "url": "https://arxiv.org/abs/2608.05348"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-05",
+        "source_ids": [
+          "source.frontier.arxiv-2608-05348"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-12393",
+      "label": "Metacognitive Skill Learning: A Computational Account",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12393",
+          "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.12393",
+          "title": "arXiv:2608.12393",
+          "url": "https://arxiv.org/abs/2608.12393"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-12393"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-04227",
+      "label": "Random features for Grassmannian kernel approximation with bounded rank-one projections",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-04227",
+          "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.04227",
+          "title": "arXiv:2608.04227",
+          "url": "https://arxiv.org/abs/2608.04227"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-04227"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-04133",
+      "label": "Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-04133",
+          "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.04133",
+          "title": "arXiv:2608.04133",
+          "url": "https://arxiv.org/abs/2608.04133"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-04133"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-03967",
+      "label": "Information-Geometric Forward Policy Training in GFlowNets",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-03967",
+          "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.03967",
+          "title": "arXiv:2608.03967",
+          "url": "https://arxiv.org/abs/2608.03967"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-03967"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-02978",
+      "label": "Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02978",
+          "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.02978",
+          "title": "arXiv:2608.02978",
+          "url": "https://arxiv.org/abs/2608.02978"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-02978"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-02976",
+      "label": "Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02976",
+          "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.02976",
+          "title": "arXiv:2608.02976",
+          "url": "https://arxiv.org/abs/2608.02976"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-04",
+        "source_ids": [
+          "source.frontier.arxiv-2608-02976"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-02244",
+      "label": "Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02244",
+          "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.02244",
+          "title": "arXiv:2608.02244",
+          "url": "https://arxiv.org/abs/2608.02244"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-03",
+        "source_ids": [
+          "source.frontier.arxiv-2608-02244"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-02079",
+      "label": "TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02079",
+          "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.02079",
+          "title": "arXiv:2608.02079",
+          "url": "https://arxiv.org/abs/2608.02079"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-03",
+        "source_ids": [
+          "source.frontier.arxiv-2608-02079"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-01220",
+      "label": "Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-01220",
+          "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.01220",
+          "title": "arXiv:2608.01220",
+          "url": "https://arxiv.org/abs/2608.01220"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-02",
+        "source_ids": [
+          "source.frontier.arxiv-2608-01220"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2608-00959",
+      "label": "MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-00959",
+          "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2608.00959",
+          "title": "arXiv:2608.00959",
+          "url": "https://arxiv.org/abs/2608.00959"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-08-02",
+        "source_ids": [
+          "source.frontier.arxiv-2608-00959"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-17248",
+      "label": "Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-17248",
+          "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.17248",
+          "title": "arXiv:2607.17248",
+          "url": "https://arxiv.org/abs/2607.17248"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-31",
+        "source_ids": [
+          "source.frontier.arxiv-2607-17248"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-14144",
+      "label": "The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-14144",
+          "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.14144",
+          "title": "arXiv:2607.14144",
+          "url": "https://arxiv.org/abs/2607.14144"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-31",
+        "source_ids": [
+          "source.frontier.arxiv-2607-14144"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-28833",
+      "label": "Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28833",
+          "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.28833",
+          "title": "arXiv:2607.28833",
+          "url": "https://arxiv.org/abs/2607.28833"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-30",
+        "source_ids": [
+          "source.frontier.arxiv-2607-28833"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-28780",
+      "label": "Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28780",
+          "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.28780",
+          "title": "arXiv:2607.28780",
+          "url": "https://arxiv.org/abs/2607.28780"
+        },
+        {
+          "id": "doi:10.1002/mar.70105",
+          "title": "doi:10.1002/mar.70105",
+          "url": "https://doi.org/10.1002/mar.70105"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-30",
+        "source_ids": [
+          "source.frontier.arxiv-2607-28780"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-28276",
+      "label": "Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28276",
+          "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.28276",
+          "title": "arXiv:2607.28276",
+          "url": "https://arxiv.org/abs/2607.28276"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-30",
+        "source_ids": [
+          "source.frontier.arxiv-2607-28276"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-28224",
+      "label": "CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28224",
+          "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.28224",
+          "title": "arXiv:2607.28224",
+          "url": "https://arxiv.org/abs/2607.28224"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-30",
+        "source_ids": [
+          "source.frontier.arxiv-2607-28224"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-28185",
+      "label": "Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
+      "kind": "claim",
+      "domain": "information",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28185",
+          "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.28185",
+          "title": "arXiv:2607.28185",
+          "url": "https://arxiv.org/abs/2607.28185"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-30",
+        "source_ids": [
+          "source.frontier.arxiv-2607-28185"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-26209",
+      "label": "Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-26209",
+          "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.26209",
+          "title": "arXiv:2607.26209",
+          "url": "https://arxiv.org/abs/2607.26209"
+        },
+        {
+          "id": "doi:10.1109/ojcoms.2026.3717118",
+          "title": "doi:10.1109/ojcoms.2026.3717118",
+          "url": "https://doi.org/10.1109/ojcoms.2026.3717118"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-28",
+        "source_ids": [
+          "source.frontier.arxiv-2607-26209"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-25526",
+      "label": "Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
+      "kind": "claim",
+      "domain": "social",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-25526",
+          "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.25526",
+          "title": "arXiv:2607.25526",
+          "url": "https://arxiv.org/abs/2607.25526"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-28",
+        "source_ids": [
+          "source.frontier.arxiv-2607-25526"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-25081",
+      "label": "Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
+      "kind": "claim",
+      "domain": "social",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-25081",
+          "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.25081",
+          "title": "arXiv:2607.25081",
+          "url": "https://arxiv.org/abs/2607.25081"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-27",
+        "source_ids": [
+          "source.frontier.arxiv-2607-25081"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-24423",
+      "label": "Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
+      "kind": "claim",
+      "domain": "engineering",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-24423",
+          "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.24423",
+          "title": "arXiv:2607.24423",
+          "url": "https://arxiv.org/abs/2607.24423"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-27",
+        "source_ids": [
+          "source.frontier.arxiv-2607-24423"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-24360",
+      "label": "Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
+      "kind": "claim",
+      "domain": "social",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-24360",
+          "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.24360",
+          "title": "arXiv:2607.24360",
+          "url": "https://arxiv.org/abs/2607.24360"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-27",
+        "source_ids": [
+          "source.frontier.arxiv-2607-24360"
+        ]
+      },
+      "aliases": []
+    },
+    {
+      "id": "claim.frontier.arxiv-2607-22049",
+      "label": "ELSA as an asset to the EU Quantum Act: A position paper",
+      "kind": "claim",
+      "domain": "social",
+      "era": "frontier",
+      "status": "frontier",
+      "frontier": true,
+      "summary": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"",
+      "tags": [
+        "frontier",
+        "public-result"
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-22049",
+          "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"
+        },
+        {
+          "id": "arxiv:2607.22049",
+          "title": "arXiv:2607.22049",
+          "url": "https://arxiv.org/abs/2607.22049"
+        }
+      ],
+      "public_frontier": {
+        "category": "public-result",
+        "capability_status": "publicly-described",
+        "disclosed_at": "2026-07-24",
+        "source_ids": [
+          "source.frontier.arxiv-2607-22049"
+        ]
+      },
+      "aliases": []
+    }
+  ],
+  "edges": [
+    {
+      "source": "root.material",
+      "target": "practice.toolmaking",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.cause-effect",
+      "target": "practice.toolmaking",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.cause-effect",
+      "target": "practice.fire",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.safe-danger",
+      "target": "practice.fire",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.time-cycle",
+      "target": "practice.fire",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.place",
+      "target": "practice.tracking",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.cause-effect",
+      "target": "practice.tracking",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.living-dead",
+      "target": "practice.tracking",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.kin-social",
+      "target": "practice.oral-tradition",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.quantity",
+      "target": "concept.counting",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "concept.counting",
+      "target": "field.geometry",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "practice.oral-tradition",
+      "target": "practice.writing",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.time-cycle",
+      "target": "field.astronomy",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.place",
+      "target": "field.navigation",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.astronomy",
+      "target": "field.navigation",
+      "type": "supports",
+      "dependency": "soft"
+    },
+    {
+      "source": "root.time-cycle",
+      "target": "practice.agriculture",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "practice.tracking",
+      "target": "practice.agriculture",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "concept.counting",
+      "target": "field.algebra",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.geometry",
+      "target": "field.optics",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.navigation",
+      "target": "field.cartography",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "practice.writing",
+      "target": "field.logic",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.philosophy",
+      "target": "field.logic",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.logic",
+      "target": "method.scientific",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "method.scientific",
+      "target": "field.physics",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "method.scientific",
+      "target": "field.chemistry",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "method.scientific",
+      "target": "field.geology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "method.scientific",
+      "target": "field.biology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.geometry",
+      "target": "field.physics",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.algebra",
+      "target": "field.physics",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.phlogiston",
+      "target": "concept.phlogiston-program",
+      "type": "depends_on",
+      "dependency": "hard"
+    },
+    {
+      "source": "claim.miasma",
+      "target": "practice.miasma-control",
+      "type": "depends_on",
+      "dependency": "hard"
+    },
+    {
+      "source": "field.biology",
+      "target": "claim.evolution",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.evolution",
+      "target": "field.genetics",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.biology",
+      "target": "field.ecology",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.biology",
+      "target": "field.microbiology",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.microbiology",
+      "target": "claim.germ-theory",
+      "type": "supports",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.germ-theory",
+      "target": "claim.miasma",
+      "type": "supersedes",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.chemistry",
+      "target": "field.thermodynamics",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.physics",
+      "target": "field.electromagnetism",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.statistics",
+      "target": "field.psychology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.statistics",
+      "target": "field.sociology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.physics",
+      "target": "claim.relativity",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.physics",
+      "target": "claim.quantum",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.relativity",
+      "target": "field.cosmology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.astronomy",
+      "target": "field.cosmology",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.genetics",
+      "target": "field.molecular-biology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.biology",
+      "target": "field.molecular-biology",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.statistics",
+      "target": "field.epidemiology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.germ-theory",
+      "target": "field.epidemiology",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.logic",
+      "target": "field.computer-science",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.statistics",
+      "target": "field.ai",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.computer-science",
+      "target": "field.ai",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.psychology",
+      "target": "field.cognitive-science",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.neuroscience",
+      "target": "field.cognitive-science",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.quantum",
+      "target": "question.quantum-gravity",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "claim.relativity",
+      "target": "question.quantum-gravity",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.cosmology",
+      "target": "question.dark-matter",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.cosmology",
+      "target": "question.dark-energy",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.molecular-biology",
+      "target": "question.origin-life",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.neuroscience",
+      "target": "question.consciousness",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.cognitive-science",
+      "target": "question.consciousness",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.molecular-biology",
+      "target": "question.aging",
+      "type": "enabled",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.climatology",
+      "target": "question.predict-climate",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.ai",
+      "target": "question.general-ai",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.logic",
+      "target": "question.math-foundations",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.sociology",
+      "target": "question.social-prediction",
+      "type": "derived_from",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.statistics",
+      "target": "field.genetics",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.chemistry",
+      "target": "field.molecular-biology",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.physics",
+      "target": "field.engineering",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.computer-science",
+      "target": "field.cognitive-science",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.ai",
+      "target": "field.systems-biology",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.ecology",
+      "target": "field.climatology",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.anthropology",
+      "target": "field.cognitive-science",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.psychology",
+      "target": "field.neuroscience",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.information-theory",
+      "target": "field.genetics",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "field.physics",
+      "target": "smoke.automate-merge",
+      "type": "related",
+      "dependency": "soft"
+    },
+    {
+      "source": "physical.dark-energy",
+      "target": "physical.cosmic-acceleration",
+      "type": "related"
+    },
+    {
+      "source": "physical.lambda-cdm",
+      "target": "physical.cosmological-constant-de",
+      "type": "depends_on",
+      "dependency": "hard"
+    },
+    {
+      "source": "physical.wcdm",
+      "target": "physical.lambda-cdm",
+      "type": "refines"
+    },
+    {
+      "source": "physical.w0wa-cdm",
+      "target": "physical.wcdm",
+      "type": "refines"
+    },
     {
       "source": "physical.evolving-dark-energy",
       "target": "physical.w0wa-cdm",
@@ -138637,6 +142862,1422 @@
           "url": "https://api.crossref.org/works/10.1111/phpr.70116"
         }
       ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-21653",
+      "target": "concept.nist.performance",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-21653",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-19722",
+      "target": "concept.nist.linearprobng",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19722",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-19515",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19515",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-19137",
+      "target": "concept.eia.carbon-intensity",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-19137",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-17295",
+      "target": "method.nist.dynamicprog",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-17295",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-16273",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-16273",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-16259",
+      "target": "field.information-theory",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-16259",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-15072",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-15072",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-15052",
+      "target": "method.nist.simulatedannealing",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-15052",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-13424",
+      "target": "concept.nist.optimalsoltn",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-13424",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-13402",
+      "target": "field.information-theory",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-13402",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-12779",
+      "target": "concept.nist.stronglyconnectedcompo",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12779",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-12604",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12604",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-12592",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12592",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-12038",
+      "target": "concept.nist.binarytree",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-12038",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-11869",
+      "target": "concept.nist.objective",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-11869",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-11359",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-11359",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04959",
+      "target": "concept.nist.flownetwork",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04959",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-09266",
+      "target": "concept.nist.optimalsoltn",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09266",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-09080",
+      "target": "method.nist.exhaustivesearch",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09080",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-09010",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-09010",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-08744",
+      "target": "method.nist.exhaustivesearch",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-08744",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-07616",
+      "target": "method.nist.randomsearch",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-07616",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-07307",
+      "target": "concept.nist.prisonersdilemma",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-07307",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-06601",
+      "target": "method.nist.dynamicprog",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-06601",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04776",
+      "target": "method.nist.exhaustivesearch",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04776",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04697",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04697",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04662",
+      "target": "concept.nist.temporllogic",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04662",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04630",
+      "target": "concept.eia.energy-consumption",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04630",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-04242",
+      "target": "concept.nist.markovchain",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-04242",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-06918",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-06918",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-03964",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-03964",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2610-03008",
+      "target": "field.cognitive-science",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2610-03008",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-39776",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-39776",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-21813",
+      "target": "concept.nist.probesequenc",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21813",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-36354",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-36354",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-35424",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-35424",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-35246",
+      "target": "concept.eia.distribution-system",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-35246",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-32315",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-32315",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-29972",
+      "target": "concept.mesh.d000088562",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-29972",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-29832",
+      "target": "concept.eia.motor-speed",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-29832",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-28815",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-28815",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-26924",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-26924",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-25847",
+      "target": "concept.eia.energy-consumption",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25847",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-25701",
+      "target": "concept.nist.polynomialtm",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25701",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-25437",
+      "target": "concept.eia.electricity-generation",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-25437",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-05763",
+      "target": "concept.eia.electric-vehicle-ev",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-05763",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-23703",
+      "target": "field.computer-science",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23703",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-23199",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23199",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-23085",
+      "target": "concept.eia.energy-consumption",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-23085",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-22775",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-22775",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-22615",
+      "target": "method.nist.chinesermndr",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-22615",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-21966",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21966",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-21270",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21270",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-21093",
+      "target": "concept.nist.markovchain",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21093",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-21057",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-21057",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-19468",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-19468",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-18467",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-18467",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-17042",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-17042",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-16899",
+      "target": "concept.eia.electric-vehicle-ev",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16899",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-16353",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16353",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-16258",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-16258",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-05749",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-05749",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-14022",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-14022",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-12866",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12866",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-12486",
+      "target": "concept.nist.decisionproblem",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12486",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-12016",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-12016",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-11530",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-11530",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-08218",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-08218",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-06163",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-06163",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-06066",
+      "target": "concept.nist.performance",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-06066",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2609-02071",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2609-02071",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-31034",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-31034",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-28387",
+      "target": "concept.eia.energy-consumption",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-28387",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-27536",
+      "target": "concept.nist.prisonersdilemma",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-27536",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-26093",
+      "target": "concept.nist.stronglynp",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-26093",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-24219",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-24219",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-23972",
+      "target": "concept.nist.temporllogic",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-23972",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-21764",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-21764",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-21020",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-21020",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-20723",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-20723",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-19416",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-19416",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-18396",
+      "target": "method.nist.exhaustivesearch",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-18396",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-18060",
+      "target": "concept.nist.temporllogic",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-18060",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-16290",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-16290",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-12037",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12037",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-11929",
+      "target": "concept.eia.compressor-station",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-11929",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-11175",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-11175",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-10825",
+      "target": "concept.eia.electric-vehicle-ev",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-10825",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-08151",
+      "target": "method.nist.dynamicprog",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-08151",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-10254",
+      "target": "method.nist.modelcheckng",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-10254",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-08599",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-08599",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-12398",
+      "target": "ology.psycholinguistics",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12398",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-07289",
+      "target": "concept.nist.formalmethod",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-07289",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-05481",
+      "target": "field.neuroscience",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-05481",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-05348",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-05348",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-12393",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-12393",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-04227",
+      "target": "method.nist.fastfouriertransform",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-04227",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-04133",
+      "target": "concept.nist.globaloptimum",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-04133",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-03967",
+      "target": "concept.nist.flownetwork",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-03967",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-02978",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02978",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-02976",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02976",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-02244",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02244",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-02079",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-02079",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-01220",
+      "target": "concept.nist.objective",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-01220",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2608-00959",
+      "target": "concept.nist.optimization",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2608-00959",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-17248",
+      "target": "concept.eia.fuel-cell",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-17248",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-14144",
+      "target": "concept.nist.lowerbound",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-14144",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-28833",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28833",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-28780",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28780",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-28276",
+      "target": "field.ai",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28276",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-28185",
+      "target": "concept.nist.markovchain",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-28185",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-26209",
+      "target": "concept.eia.energy-consumption",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-26209",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-25526",
+      "target": "field.mesh.d011057",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-25526",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-25081",
+      "target": "concept.mesh.d006803",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-25081",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-24423",
+      "target": "concept.eia.electric-vehicle-ev",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-24423",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-24360",
+      "target": "concept.mesh.d000067656",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-24360",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"
+        }
+      ]
+    },
+    {
+      "source": "claim.frontier.arxiv-2607-22049",
+      "target": "concept.mesh.d007391",
+      "type": "related",
+      "summary": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"",
+      "sources": [
+        {
+          "id": "source.frontier.arxiv-2607-22049",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"
+        }
+      ]
     }
   ],
   "reviews": [
@@ -141334,6 +146975,18 @@
       "child": "claim.frontier.arxiv-2607-26287",
       "type": "narrower"
     },
+    {
+      "id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+      "parent": "concept.nist.semidefinite",
+      "child": "claim.frontier.arxiv-2607-28224",
+      "type": "narrower"
+    },
+    {
+      "id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+      "parent": "concept.nist.temporllogic",
+      "child": "claim.frontier.arxiv-2610-15934",
+      "type": "narrower"
+    },
     {
       "id": "taxonomy.go.concept.go.go0000128.concept.go.go0051703",
       "parent": "concept.go.go0051703",
@@ -804085,1041 +809738,20451 @@
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-ejed-70766",
-          "target_kind": "node",
-          "target_sha256": "a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-ejed-70766",
-            "label": "Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
-            "kind": "claim",
-            "domain": "social",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1111-ejed-70766",
-                "title": "Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
-                "url": "https://api.crossref.org/works/10.1111/ejed.70766"
-              },
-              {
-                "id": "doi:10.1111/ejed.70766",
-                "title": "doi:10.1111/ejed.70766",
-                "url": "https://doi.org/10.1111/ejed.70766"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-15",
-              "source_ids": [
-                "source.frontier.doi-10-1111-ejed-70766"
-              ]
-            }
-          },
-          "statement": "doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1111/ejed.70766",
-            "time": "2026-07-15",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1111-ejed-70766",
-              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-              "start": 2563,
-              "end": 2788,
-              "quote": "These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-ejed-70766",
-              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-              "start": 15776,
-              "end": 15816,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,15]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-ejed-70766",
-              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-              "start": 409,
-              "end": 466,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "assertion.claim.frontier.doi-10-1111-ejed-70766",
+          "target_kind": "node",
+          "target_sha256": "a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-ejed-70766",
+            "label": "Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejed-70766",
+                "title": "Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
+                "url": "https://api.crossref.org/works/10.1111/ejed.70766"
+              },
+              {
+                "id": "doi:10.1111/ejed.70766",
+                "title": "doi:10.1111/ejed.70766",
+                "url": "https://doi.org/10.1111/ejed.70766"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-15",
+              "source_ids": [
+                "source.frontier.doi-10-1111-ejed-70766"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/ejed.70766 \"Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes\" (CC BY 4.0, published 2026-07-15) reports: \"These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/ejed.70766",
+            "time": "2026-07-15",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70766",
+              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+              "start": 2563,
+              "end": 2788,
+              "quote": "These results highlight that effective sustainability reforms in teacher education require systematic support for professional identity development and opportunities for agency, rather than reliance solely on policy mandates."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70766",
+              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+              "start": 15776,
+              "end": 15816,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,15]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70766",
+              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+              "start": 409,
+              "end": 466,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-sce-70090",
+          "target_kind": "node",
+          "target_sha256": "7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-sce-70090",
+            "label": "Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-sce-70090",
+                "title": "Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
+                "url": "https://api.crossref.org/works/10.1002/sce.70090"
+              },
+              {
+                "id": "doi:10.1002/sce.70090",
+                "title": "doi:10.1002/sce.70090",
+                "url": "https://doi.org/10.1002/sce.70090"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-15",
+              "source_ids": [
+                "source.frontier.doi-10-1002-sce-70090"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/sce.70090",
+            "time": "2026-07-15",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-sce-70090",
+              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+              "start": 1981,
+              "end": 2079,
+              "quote": "The findings revealed that almost all identified studies adopted a narrow definition of inclusion."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-sce-70090",
+              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+              "start": 25306,
+              "end": 25346,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,15]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-sce-70090",
+              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+              "start": 398,
+              "end": 455,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-ppp-70053",
+          "target_kind": "node",
+          "target_sha256": "20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-ppp-70053",
+            "label": "Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ppp-70053",
+                "title": "Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
+                "url": "https://api.crossref.org/works/10.1002/ppp.70053"
+              },
+              {
+                "id": "doi:10.1002/ppp.70053",
+                "title": "doi:10.1002/ppp.70053",
+                "url": "https://doi.org/10.1002/ppp.70053"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-14",
+              "source_ids": [
+                "source.frontier.doi-10-1002-ppp-70053"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/ppp.70053",
+            "time": "2026-07-14",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70053",
+              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+              "start": 2025,
+              "end": 2255,
+              "quote": "The results suggest that the 5\\u2009m tall dome\\u2010shaped palsa contains permafrost up to 20\\u2010m\\u2010thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower\\u2010relief areas on the palsa."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70053",
+              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+              "start": 11812,
+              "end": 11852,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,14]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70053",
+              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+              "start": 397,
+              "end": 454,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-ese3-70603",
+          "target_kind": "node",
+          "target_sha256": "e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-ese3-70603",
+            "label": "Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ese3-70603",
+                "title": "Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
+                "url": "https://api.crossref.org/works/10.1002/ese3.70603"
+              },
+              {
+                "id": "doi:10.1002/ese3.70603",
+                "title": "doi:10.1002/ese3.70603",
+                "url": "https://doi.org/10.1002/ese3.70603"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-14",
+              "source_ids": [
+                "source.frontier.doi-10-1002-ese3-70603"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/ese3.70603",
+            "time": "2026-07-14",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70603",
+              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+              "start": 2036,
+              "end": 2198,
+              "quote": "The results indicate that under the conditions set in this study, the fault stick\\u2010slip reaches a critical state when the fault pillar support pressure peaks."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70603",
+              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+              "start": 13229,
+              "end": 13269,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,14]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70603",
+              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025jd046190",
+          "target_kind": "node",
+          "target_sha256": "e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025jd046190",
+            "label": "Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd046190",
+                "title": "Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
+                "url": "https://api.crossref.org/works/10.1029/2025jd046190"
+              },
+              {
+                "id": "doi:10.1029/2025jd046190",
+                "title": "doi:10.1029/2025jd046190",
+                "url": "https://doi.org/10.1029/2025jd046190"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-13",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025jd046190"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025jd046190",
+            "time": "2026-07-13",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd046190",
+              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+              "start": 3240,
+              "end": 3449,
+              "quote": "We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution\\u2010dependent, and the plume rise model still fails to reproduce the highest observed plume heights."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd046190",
+              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+              "start": 13219,
+              "end": 13259,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,13]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd046190",
+              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+              "start": 436,
+              "end": 493,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025gl121323",
+          "target_kind": "node",
+          "target_sha256": "e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025gl121323",
+            "label": "Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121323",
+                "title": "Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121323"
+              },
+              {
+                "id": "doi:10.1029/2025gl121323",
+                "title": "doi:10.1029/2025gl121323",
+                "url": "https://doi.org/10.1029/2025gl121323"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-13",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025gl121323"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025gl121323",
+            "time": "2026-07-13",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121323",
+              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+              "start": 2082,
+              "end": 2230,
+              "quote": "Here we report Fe concentrations and isotopic compositions from a Fe\\u2010Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121323",
+              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+              "start": 15160,
+              "end": 15200,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,13]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121323",
+              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+              "start": 436,
+              "end": 493,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-ijfe-70259",
+          "target_kind": "node",
+          "target_sha256": "4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-ijfe-70259",
+            "label": "Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ijfe-70259",
+                "title": "Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
+                "url": "https://api.crossref.org/works/10.1002/ijfe.70259"
+              },
+              {
+                "id": "doi:10.1002/ijfe.70259",
+                "title": "doi:10.1002/ijfe.70259",
+                "url": "https://doi.org/10.1002/ijfe.70259"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-12",
+              "source_ids": [
+                "source.frontier.doi-10-1002-ijfe-70259"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/ijfe.70259",
+            "time": "2026-07-12",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
+              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+              "start": 1065,
+              "end": 1540,
+              "quote": "We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
+              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+              "start": 13804,
+              "end": 13844,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,12]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
+              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+              "start": 395,
+              "end": 452,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000696",
+          "target_kind": "node",
+          "target_sha256": "b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1371-journal-pclm-0000696",
+            "label": "Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+                "title": "Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696"
+              },
+              {
+                "id": "doi:10.1371/journal.pclm.0000696",
+                "title": "doi:10.1371/journal.pclm.0000696",
+                "url": "https://doi.org/10.1371/journal.pclm.0000696"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-09",
+              "source_ids": [
+                "source.frontier.doi-10-1371-journal-pclm-0000696"
+              ]
+            }
+          },
+          "statement": "doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1371/journal.pclm.0000696",
+            "time": "2026-07-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+              "start": 1779,
+              "end": 2007,
+              "quote": "Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+              "start": 19992,
+              "end": 20031,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+              "start": 423,
+              "end": 480,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-aphw-70185",
+          "target_kind": "node",
+          "target_sha256": "ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-aphw-70185",
+            "label": "Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-aphw-70185",
+                "title": "Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
+                "url": "https://api.crossref.org/works/10.1111/aphw.70185"
+              },
+              {
+                "id": "doi:10.1111/aphw.70185",
+                "title": "doi:10.1111/aphw.70185",
+                "url": "https://doi.org/10.1111/aphw.70185"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-09",
+              "source_ids": [
+                "source.frontier.doi-10-1111-aphw-70185"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/aphw.70185",
+            "time": "2026-07-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-aphw-70185",
+              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+              "start": 2859,
+              "end": 3045,
+              "quote": "These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-aphw-70185",
+              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+              "start": 14358,
+              "end": 14397,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-aphw-70185",
+              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+              "start": 396,
+              "end": 453,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2026jh001250",
+          "target_kind": "node",
+          "target_sha256": "d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2026jh001250",
+            "label": "Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026jh001250",
+                "title": "Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
+                "url": "https://api.crossref.org/works/10.1029/2026jh001250"
+              },
+              {
+                "id": "doi:10.1029/2026jh001250",
+                "title": "doi:10.1029/2026jh001250",
+                "url": "https://doi.org/10.1029/2026jh001250"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-09",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2026jh001250"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2026jh001250",
+            "time": "2026-07-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jh001250",
+              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+              "start": 2352,
+              "end": 2556,
+              "quote": "These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jh001250",
+              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+              "start": 18163,
+              "end": 18202,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jh001250",
+              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+              "start": 424,
+              "end": 481,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2026gl122518",
+          "target_kind": "node",
+          "target_sha256": "d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2026gl122518",
+            "label": "Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122518",
+                "title": "Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122518"
+              },
+              {
+                "id": "doi:10.1029/2026gl122518",
+                "title": "doi:10.1029/2026gl122518",
+                "url": "https://doi.org/10.1029/2026gl122518"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-09",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2026gl122518"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2026gl122518",
+            "time": "2026-07-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122518",
+              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+              "start": 2735,
+              "end": 2909,
+              "quote": "These results indicate that half\\u2010space assumptions capture the first\\u2010order rupture characteristics but can introduce significant bias in detailed rupture processes."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122518",
+              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+              "start": 12005,
+              "end": 12044,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122518",
+              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+              "start": 425,
+              "end": 482,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739",
+          "target_kind": "node",
+          "target_sha256": "6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-3897-brics-econ-7-e172739",
+            "label": "The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+                "title": "Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739"
+              },
+              {
+                "id": "doi:10.3897/brics-econ.7.e172739",
+                "title": "doi:10.3897/brics-econ.7.e172739",
+                "url": "https://doi.org/10.3897/brics-econ.7.e172739"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-07",
+              "source_ids": [
+                "source.frontier.doi-10-3897-brics-econ-7-e172739"
+              ]
+            }
+          },
+          "statement": "doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"",
+          "scope": {
+            "population": "The study reported in doi:10.3897/brics-econ.7.e172739",
+            "time": "2026-07-07",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+              "start": 904,
+              "end": 1101,
+              "quote": "Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP."
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+              "start": 10407,
+              "end": 10446,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,7]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+              "start": 410,
+              "end": 467,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-jmg-70045",
+          "target_kind": "node",
+          "target_sha256": "0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-jmg-70045",
+            "label": "Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jmg-70045",
+                "title": "Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
+                "url": "https://api.crossref.org/works/10.1111/jmg.70045"
+              },
+              {
+                "id": "doi:10.1111/jmg.70045",
+                "title": "doi:10.1111/jmg.70045",
+                "url": "https://doi.org/10.1111/jmg.70045"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-07",
+              "source_ids": [
+                "source.frontier.doi-10-1111-jmg-70045"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/jmg.70045",
+            "time": "2026-07-07",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jmg-70045",
+              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+              "start": 2517,
+              "end": 2742,
+              "quote": "Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-jmg-70045",
+              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+              "start": 24402,
+              "end": 24441,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,7]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-jmg-70045",
+              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+              "start": 397,
+              "end": 454,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-ppp-70049",
+          "target_kind": "node",
+          "target_sha256": "7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-ppp-70049",
+            "label": "Disposition Model for Permafrost Degradation in Mountainous Regions",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ppp-70049",
+                "title": "Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions",
+                "url": "https://api.crossref.org/works/10.1002/ppp.70049"
+              },
+              {
+                "id": "doi:10.1002/ppp.70049",
+                "title": "doi:10.1002/ppp.70049",
+                "url": "https://doi.org/10.1002/ppp.70049"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-05",
+              "source_ids": [
+                "source.frontier.doi-10-1002-ppp-70049"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/ppp.70049",
+            "time": "2026-07-05",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70049",
+              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+              "start": 2697,
+              "end": 2897,
+              "quote": "Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium\\u2010range weather prediction ensembles are used to drive the model."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70049",
+              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+              "start": 17541,
+              "end": 17580,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,5]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70049",
+              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+              "start": 397,
+              "end": 454,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074",
+          "target_kind": "node",
+          "target_sha256": "b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-3897-brics-econ-7-e162074",
+            "label": "The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+                "title": "Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074"
+              },
+              {
+                "id": "doi:10.3897/brics-econ.7.e162074",
+                "title": "doi:10.3897/brics-econ.7.e162074",
+                "url": "https://doi.org/10.3897/brics-econ.7.e162074"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-03",
+              "source_ids": [
+                "source.frontier.doi-10-3897-brics-econ-7-e162074"
+              ]
+            }
+          },
+          "statement": "doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+          "scope": {
+            "population": "The study reported in doi:10.3897/brics-econ.7.e162074",
+            "time": "2026-07-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+              "start": 1212,
+              "end": 1322,
+              "quote": "The results reveal a stable long-term equilibrium between investment in human development and economic growth."
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+              "start": 9154,
+              "end": 9193,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,3]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+              "start": 409,
+              "end": 466,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-ijal-70289",
+          "target_kind": "node",
+          "target_sha256": "a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-ijal-70289",
+            "label": "Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ijal-70289",
+                "title": "Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
+                "url": "https://api.crossref.org/works/10.1111/ijal.70289"
+              },
+              {
+                "id": "doi:10.1111/ijal.70289",
+                "title": "doi:10.1111/ijal.70289",
+                "url": "https://doi.org/10.1111/ijal.70289"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-03",
+              "source_ids": [
+                "source.frontier.doi-10-1111-ijal-70289"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/ijal.70289",
+            "time": "2026-07-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70289",
+              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+              "start": 1488,
+              "end": 1550,
+              "quote": "The findings reveal a core tension in participant perceptions."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70289",
+              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+              "start": 9731,
+              "end": 9770,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,3]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70289",
+              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+              "start": 395,
+              "end": 452,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-2166-wpt-2026-383",
+          "target_kind": "node",
+          "target_sha256": "704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-2166-wpt-2026-383",
+            "label": "Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wpt-2026-383",
+                "title": "Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss",
+                "url": "https://api.crossref.org/works/10.2166/wpt.2026.383"
+              },
+              {
+                "id": "doi:10.2166/wpt.2026.383",
+                "title": "doi:10.2166/wpt.2026.383",
+                "url": "https://doi.org/10.2166/wpt.2026.383"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-01",
+              "source_ids": [
+                "source.frontier.doi-10-2166-wpt-2026-383"
+              ]
+            }
+          },
+          "statement": "doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"",
+          "scope": {
+            "population": "The study reported in doi:10.2166/wpt.2026.383",
+            "time": "2026-07-01",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
+              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+              "start": 1632,
+              "end": 1738,
+              "quote": "The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario."
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
+              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+              "start": 22165,
+              "end": 22204,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,1]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
+              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+              "start": 417,
+              "end": 474,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-2166-wcc-2026-359",
+          "target_kind": "node",
+          "target_sha256": "22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-2166-wcc-2026-359",
+            "label": "Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-359",
+                "title": "Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.359"
+              },
+              {
+                "id": "doi:10.2166/wcc.2026.359",
+                "title": "doi:10.2166/wcc.2026.359",
+                "url": "https://doi.org/10.2166/wcc.2026.359"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-01",
+              "source_ids": [
+                "source.frontier.doi-10-2166-wcc-2026-359"
+              ]
+            }
+          },
+          "statement": "doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"",
+          "scope": {
+            "population": "The study reported in doi:10.2166/wcc.2026.359",
+            "time": "2026-07-01",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
+              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+              "start": 3256,
+              "end": 3446,
+              "quote": "These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions."
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
+              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+              "start": 34157,
+              "end": 34196,
+              "quote": "\"published\":{\"date-parts\":[[2026,7,1]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
+              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+              "start": 407,
+              "end": 464,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-66630-sc-2026-0009",
+          "target_kind": "node",
+          "target_sha256": "5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-66630-sc-2026-0009",
+            "label": "From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-66630-sc-2026-0009",
+                "title": "Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
+                "url": "https://api.crossref.org/works/10.66630/sc.2026.0009"
+              },
+              {
+                "id": "doi:10.66630/sc.2026.0009",
+                "title": "doi:10.66630/sc.2026.0009",
+                "url": "https://doi.org/10.66630/sc.2026.0009"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-30",
+              "source_ids": [
+                "source.frontier.doi-10-66630-sc-2026-0009"
+              ]
+            }
+          },
+          "statement": "doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"",
+          "scope": {
+            "population": "The study reported in doi:10.66630/sc.2026.0009",
+            "time": "2026-06-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
+              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+              "start": 1567,
+              "end": 1913,
+              "quote": "The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes."
+            },
+            {
+              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
+              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+              "start": 7094,
+              "end": 7134,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
+              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+              "start": 438,
+              "end": 495,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-59588-2961-3094-1247",
+          "target_kind": "node",
+          "target_sha256": "92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-59588-2961-3094-1247",
+            "label": "Creative Constructions in Asian and World Englishes - And What They Teach Us",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-59588-2961-3094-1247",
+                "title": "Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us",
+                "url": "https://api.crossref.org/works/10.59588/2961-3094.1247"
+              },
+              {
+                "id": "doi:10.59588/2961-3094.1247",
+                "title": "doi:10.59588/2961-3094.1247",
+                "url": "https://doi.org/10.59588/2961-3094.1247"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-30",
+              "source_ids": [
+                "source.frontier.doi-10-59588-2961-3094-1247"
+              ]
+            }
+          },
+          "statement": "doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"",
+          "scope": {
+            "population": "The study reported in doi:10.59588/2961-3094.1247",
+            "time": "2026-06-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
+              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+              "start": 2189,
+              "end": 2477,
+              "quote": "The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally."
+            },
+            {
+              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
+              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+              "start": 3871,
+              "end": 3911,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
+              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+              "start": 414,
+              "end": 471,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2606",
+          "target_kind": "node",
+          "target_sha256": "892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-28918-jei-v11i1-2606",
+            "label": "Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+                "title": "Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
+                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606"
+              },
+              {
+                "id": "doi:10.28918/jei.v11i1.2606",
+                "title": "doi:10.28918/jei.v11i1.2606",
+                "url": "https://doi.org/10.28918/jei.v11i1.2606"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-30",
+              "source_ids": [
+                "source.frontier.doi-10-28918-jei-v11i1-2606"
+              ]
+            }
+          },
+          "statement": "doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"",
+          "scope": {
+            "population": "The study reported in doi:10.28918/jei.v11i1.2606",
+            "time": "2026-06-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+              "start": 1389,
+              "end": 1642,
+              "quote": "The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassu\\u1e6d, taw\\u0101zun, tas\\u0101mu\\u1e25, and i'tid\\u0101l."
+            },
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+              "start": 4370,
+              "end": 4410,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+              "start": 430,
+              "end": 487,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2601",
+          "target_kind": "node",
+          "target_sha256": "4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-28918-jei-v11i1-2601",
+            "label": "Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+                "title": "Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
+                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601"
+              },
+              {
+                "id": "doi:10.28918/jei.v11i1.2601",
+                "title": "doi:10.28918/jei.v11i1.2601",
+                "url": "https://doi.org/10.28918/jei.v11i1.2601"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-30",
+              "source_ids": [
+                "source.frontier.doi-10-28918-jei-v11i1-2601"
+              ]
+            }
+          },
+          "statement": "doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"",
+          "scope": {
+            "population": "The study reported in doi:10.28918/jei.v11i1.2601",
+            "time": "2026-06-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+              "start": 1711,
+              "end": 1945,
+              "quote": "The findings reveal that integrating digital platforms into pesantren education significantly enhances students\\u2019 technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources."
+            },
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+              "start": 5806,
+              "end": 5846,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+              "start": 430,
+              "end": 487,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025wr041875",
+          "target_kind": "node",
+          "target_sha256": "9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025wr041875",
+            "label": "Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025wr041875",
+                "title": "Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
+                "url": "https://api.crossref.org/works/10.1029/2025wr041875"
+              },
+              {
+                "id": "doi:10.1029/2025wr041875",
+                "title": "doi:10.1029/2025wr041875",
+                "url": "https://doi.org/10.1029/2025wr041875"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-30",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025wr041875"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025wr041875",
+            "time": "2026-06-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr041875",
+              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+              "start": 2380,
+              "end": 2590,
+              "quote": "The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr041875",
+              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+              "start": 8994,
+              "end": 9034,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr041875",
+              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+              "start": 435,
+              "end": 492,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-2166-wcc-2026-006",
+          "target_kind": "node",
+          "target_sha256": "8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-2166-wcc-2026-006",
+            "label": "Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-006",
+                "title": "Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.006"
+              },
+              {
+                "id": "doi:10.2166/wcc.2026.006",
+                "title": "doi:10.2166/wcc.2026.006",
+                "url": "https://doi.org/10.2166/wcc.2026.006"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-27",
+              "source_ids": [
+                "source.frontier.doi-10-2166-wcc-2026-006"
+              ]
+            }
+          },
+          "statement": "doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"",
+          "scope": {
+            "population": "The study reported in doi:10.2166/wcc.2026.006",
+            "time": "2026-06-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
+              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+              "start": 1836,
+              "end": 2035,
+              "quote": "These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots."
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
+              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+              "start": 29321,
+              "end": 29361,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
+              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+              "start": 405,
+              "end": 462,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025jb033060",
+          "target_kind": "node",
+          "target_sha256": "707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025jb033060",
+            "label": "Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jb033060",
+                "title": "Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
+                "url": "https://api.crossref.org/works/10.1029/2025jb033060"
+              },
+              {
+                "id": "doi:10.1029/2025jb033060",
+                "title": "doi:10.1029/2025jb033060",
+                "url": "https://doi.org/10.1029/2025jb033060"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-27",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025jb033060"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025jb033060",
+            "time": "2026-06-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jb033060",
+              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+              "start": 2183,
+              "end": 2398,
+              "quote": "We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jb033060",
+              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+              "start": 17488,
+              "end": 17528,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jb033060",
+              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+              "start": 424,
+              "end": 481,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025ea004610",
+          "target_kind": "node",
+          "target_sha256": "3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025ea004610",
+            "label": "An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025ea004610",
+                "title": "Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
+                "url": "https://api.crossref.org/works/10.1029/2025ea004610"
+              },
+              {
+                "id": "doi:10.1029/2025ea004610",
+                "title": "doi:10.1029/2025ea004610",
+                "url": "https://doi.org/10.1029/2025ea004610"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-27",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025ea004610"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025ea004610",
+            "time": "2026-06-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025ea004610",
+              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+              "start": 1745,
+              "end": 1921,
+              "quote": "The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025ea004610",
+              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+              "start": 9912,
+              "end": 9952,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025ea004610",
+              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+              "start": 434,
+              "end": 491,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2026gl122157",
+          "target_kind": "node",
+          "target_sha256": "aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2026gl122157",
+            "label": "Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122157",
+                "title": "Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122157"
+              },
+              {
+                "id": "doi:10.1029/2026gl122157",
+                "title": "doi:10.1029/2026gl122157",
+                "url": "https://doi.org/10.1029/2026gl122157"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-26",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2026gl122157"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2026gl122157",
+            "time": "2026-06-26",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122157",
+              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+              "start": 1750,
+              "end": 1992,
+              "quote": "These observations indicate substantial coarse sediment retention within an active near\\u2010terminus subglacial channel, potentially weakening short\\u2010term correspondence between coarse subglacial transport and proglacial sediment export."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122157",
+              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+              "start": 9959,
+              "end": 9999,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,26]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122157",
+              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+              "start": 426,
+              "end": 483,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-esp4-70096",
+          "target_kind": "node",
+          "target_sha256": "5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-esp4-70096",
+            "label": "Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-esp4-70096",
+                "title": "Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
+                "url": "https://api.crossref.org/works/10.1002/esp4.70096"
+              },
+              {
+                "id": "doi:10.1002/esp4.70096",
+                "title": "doi:10.1002/esp4.70096",
+                "url": "https://doi.org/10.1002/esp4.70096"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-25",
+              "source_ids": [
+                "source.frontier.doi-10-1002-esp4-70096"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/esp4.70096",
+            "time": "2026-06-25",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70096",
+              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+              "start": 2142,
+              "end": 2303,
+              "quote": "In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70096",
+              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+              "start": 11048,
+              "end": 11088,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,25]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70096",
+              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-bioe-70124",
+          "target_kind": "node",
+          "target_sha256": "46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-bioe-70124",
+            "label": "The Concept of Harm in Medical Ethics",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-bioe-70124",
+                "title": "Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics",
+                "url": "https://api.crossref.org/works/10.1111/bioe.70124"
+              },
+              {
+                "id": "doi:10.1111/bioe.70124",
+                "title": "doi:10.1111/bioe.70124",
+                "url": "https://doi.org/10.1111/bioe.70124"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-24",
+              "source_ids": [
+                "source.frontier.doi-10-1111-bioe-70124"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/bioe.70124",
+            "time": "2026-06-24",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-bioe-70124",
+              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+              "start": 1404,
+              "end": 1729,
+              "quote": "By applying three prevailing theoretical\\u2010philosophical frameworks\\u2014the counterfactual, temporal, and non\\u2010comparative accounts of harm\\u2014to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-bioe-70124",
+              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+              "start": 9714,
+              "end": 9754,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,24]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-bioe-70124",
+              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+              "start": 397,
+              "end": 454,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-adom-71396",
+          "target_kind": "node",
+          "target_sha256": "7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-adom-71396",
+            "label": "Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-adom-71396",
+                "title": "Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
+                "url": "https://api.crossref.org/works/10.1002/adom.71396"
+              },
+              {
+                "id": "doi:10.1002/adom.71396",
+                "title": "doi:10.1002/adom.71396",
+                "url": "https://doi.org/10.1002/adom.71396"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-24",
+              "source_ids": [
+                "source.frontier.doi-10-1002-adom-71396"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/adom.71396",
+            "time": "2026-06-24",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-adom-71396",
+              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+              "start": 1885,
+              "end": 2133,
+              "quote": "The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-adom-71396",
+              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+              "start": 8102,
+              "end": 8142,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,24]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-adom-71396",
+              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+              "start": 399,
+              "end": 456,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-ese3-70586",
+          "target_kind": "node",
+          "target_sha256": "3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-ese3-70586",
+            "label": "Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ese3-70586",
+                "title": "Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
+                "url": "https://api.crossref.org/works/10.1002/ese3.70586"
+              },
+              {
+                "id": "doi:10.1002/ese3.70586",
+                "title": "doi:10.1002/ese3.70586",
+                "url": "https://doi.org/10.1002/ese3.70586"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-23",
+              "source_ids": [
+                "source.frontier.doi-10-1002-ese3-70586"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/ese3.70586",
+            "time": "2026-06-23",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70586",
+              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+              "start": 1553,
+              "end": 1699,
+              "quote": "The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70586",
+              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+              "start": 9310,
+              "end": 9350,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,23]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70586",
+              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1144-jgs2026-039",
+          "target_kind": "node",
+          "target_sha256": "a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1144-jgs2026-039",
+            "label": "Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1144-jgs2026-039",
+                "title": "Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
+                "url": "https://api.crossref.org/works/10.1144/jgs2026-039"
+              },
+              {
+                "id": "doi:10.1144/jgs2026-039",
+                "title": "doi:10.1144/jgs2026-039",
+                "url": "https://doi.org/10.1144/jgs2026-039"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-22",
+              "source_ids": [
+                "source.frontier.doi-10-1144-jgs2026-039"
+              ]
+            }
+          },
+          "statement": "doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1144/jgs2026-039",
+            "time": "2026-06-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
+              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+              "start": 2040,
+              "end": 2167,
+              "quote": "We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
+              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+              "start": 53124,
+              "end": 53164,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,22]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
+              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+              "start": 431,
+              "end": 488,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-hec-70120",
+          "target_kind": "node",
+          "target_sha256": "06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-hec-70120",
+            "label": "Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-hec-70120",
+                "title": "Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
+                "url": "https://api.crossref.org/works/10.1002/hec.70120"
+              },
+              {
+                "id": "doi:10.1002/hec.70120",
+                "title": "doi:10.1002/hec.70120",
+                "url": "https://doi.org/10.1002/hec.70120"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-22",
+              "source_ids": [
+                "source.frontier.doi-10-1002-hec-70120"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/hec.70120",
+            "time": "2026-06-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-hec-70120",
+              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+              "start": 1073,
+              "end": 1327,
+              "quote": "Using 2009\\u20132019 Behavioral Risk Factor Surveillance System data and a two\\u2010way fixed\\u2010effects difference\\u2010in\\u2010differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-hec-70120",
+              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+              "start": 14061,
+              "end": 14101,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,22]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-hec-70120",
+              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+              "start": 397,
+              "end": 454,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-1467-9477-70049",
+          "target_kind": "node",
+          "target_sha256": "7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-1467-9477-70049",
+            "label": "The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-1467-9477-70049",
+                "title": "Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
+                "url": "https://api.crossref.org/works/10.1111/1467-9477.70049"
+              },
+              {
+                "id": "doi:10.1111/1467-9477.70049",
+                "title": "doi:10.1111/1467-9477.70049",
+                "url": "https://doi.org/10.1111/1467-9477.70049"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-21",
+              "source_ids": [
+                "source.frontier.doi-10-1111-1467-9477-70049"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/1467-9477.70049",
+            "time": "2026-06-21",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
+              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+              "start": 2081,
+              "end": 2414,
+              "quote": "We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
+              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+              "start": 9346,
+              "end": 9386,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,21]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
+              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-faam-70045",
+          "target_kind": "node",
+          "target_sha256": "347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-faam-70045",
+            "label": "Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-faam-70045",
+                "title": "Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
+                "url": "https://api.crossref.org/works/10.1111/faam.70045"
+              },
+              {
+                "id": "doi:10.1111/faam.70045",
+                "title": "doi:10.1111/faam.70045",
+                "url": "https://doi.org/10.1111/faam.70045"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-20",
+              "source_ids": [
+                "source.frontier.doi-10-1111-faam-70045"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/faam.70045",
+            "time": "2026-06-20",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-faam-70045",
+              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+              "start": 2131,
+              "end": 2317,
+              "quote": "Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-faam-70045",
+              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+              "start": 29147,
+              "end": 29187,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,20]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-faam-70045",
+              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+              "start": 386,
+              "end": 443,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-58491-2735-4202-3413",
+          "target_kind": "node",
+          "target_sha256": "cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-58491-2735-4202-3413",
+            "label": "EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-58491-2735-4202-3413",
+                "title": "Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
+                "url": "https://api.crossref.org/works/10.58491/2735-4202.3413"
+              },
+              {
+                "id": "doi:10.58491/2735-4202.3413",
+                "title": "doi:10.58491/2735-4202.3413",
+                "url": "https://doi.org/10.58491/2735-4202.3413"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-18",
+              "source_ids": [
+                "source.frontier.doi-10-58491-2735-4202-3413"
+              ]
+            }
+          },
+          "statement": "doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"",
+          "scope": {
+            "population": "The study reported in doi:10.58491/2735-4202.3413",
+            "time": "2026-06-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
+              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+              "start": 1306,
+              "end": 1458,
+              "quote": "The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12\\u00b0 to nearly 28\\u00b0."
+            },
+            {
+              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
+              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+              "start": 3238,
+              "end": 3278,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,18]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
+              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+              "start": 411,
+              "end": 468,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025gl121378",
+          "target_kind": "node",
+          "target_sha256": "f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025gl121378",
+            "label": "Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121378",
+                "title": "Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121378"
+              },
+              {
+                "id": "doi:10.1029/2025gl121378",
+                "title": "doi:10.1029/2025gl121378",
+                "url": "https://doi.org/10.1029/2025gl121378"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-16",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025gl121378"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025gl121378",
+            "time": "2026-06-16",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121378",
+              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+              "start": 2343,
+              "end": 2659,
+              "quote": "These findings highlight the utility of dv\\/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater\\u2013vegetation interactions, and supporting ecohydrological research and water management in semi\\u2010arid snowmelt systems."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121378",
+              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+              "start": 13315,
+              "end": 13355,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,16]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121378",
+              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+              "start": 436,
+              "end": 493,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421",
+          "target_kind": "node",
+          "target_sha256": "5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-56403-nejesh-v5i2-421",
+            "label": "The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+                "title": "Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe",
+                "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421"
+              },
+              {
+                "id": "doi:10.56403/nejesh.v5i2.421",
+                "title": "doi:10.56403/nejesh.v5i2.421",
+                "url": "https://doi.org/10.56403/nejesh.v5i2.421"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-11",
+              "source_ids": [
+                "source.frontier.doi-10-56403-nejesh-v5i2-421"
+              ]
+            }
+          },
+          "statement": "doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+          "scope": {
+            "population": "The study reported in doi:10.56403/nejesh.v5i2.421",
+            "time": "2026-06-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+              "start": 1118,
+              "end": 1329,
+              "quote": "The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect."
+            },
+            {
+              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+              "start": 9496,
+              "end": 9536,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+              "start": 466,
+              "end": 523,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2026gl123355",
+          "target_kind": "node",
+          "target_sha256": "88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2026gl123355",
+            "label": "Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl123355",
+                "title": "Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
+                "url": "https://api.crossref.org/works/10.1029/2026gl123355"
+              },
+              {
+                "id": "doi:10.1029/2026gl123355",
+                "title": "doi:10.1029/2026gl123355",
+                "url": "https://doi.org/10.1029/2026gl123355"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-11",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2026gl123355"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2026gl123355",
+            "time": "2026-06-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl123355",
+              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+              "start": 1702,
+              "end": 1831,
+              "quote": "We report a rare quiet\\u2010time observation by NOAA\\u201018 spacecraft flying nearly along the electron isotropy boundary (IBe)."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl123355",
+              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+              "start": 10931,
+              "end": 10971,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl123355",
+              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+              "start": 436,
+              "end": 493,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025gl121171",
+          "target_kind": "node",
+          "target_sha256": "34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025gl121171",
+            "label": "Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121171",
+                "title": "Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121171"
+              },
+              {
+                "id": "doi:10.1029/2025gl121171",
+                "title": "doi:10.1029/2025gl121171",
+                "url": "https://doi.org/10.1029/2025gl121171"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-11",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025gl121171"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025gl121171",
+            "time": "2026-06-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121171",
+              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+              "start": 2451,
+              "end": 2602,
+              "quote": "Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top\\u2010down estimates of the terrestrial carbon sink."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121171",
+              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+              "start": 12665,
+              "end": 12705,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121171",
+              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+              "start": 436,
+              "end": 493,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025jd044617",
+          "target_kind": "node",
+          "target_sha256": "0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025jd044617",
+            "label": "Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd044617",
+                "title": "Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou",
+                "url": "https://api.crossref.org/works/10.1029/2025jd044617"
+              },
+              {
+                "id": "doi:10.1029/2025jd044617",
+                "title": "doi:10.1029/2025jd044617",
+                "url": "https://doi.org/10.1029/2025jd044617"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-10",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025jd044617"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025jd044617",
+            "time": "2026-06-10",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd044617",
+              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+              "start": 1646,
+              "end": 1917,
+              "quote": "We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper\\u2010level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd044617",
+              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+              "start": 14732,
+              "end": 14772,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,10]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd044617",
+              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+              "start": 426,
+              "end": 483,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+          "target_kind": "node",
+          "target_sha256": "6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+            "label": "Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+                "title": "Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ",
+                "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"
+              },
+              {
+                "id": "doi:10.22378/he.2026-11-2.218-234",
+                "title": "doi:10.22378/he.2026-11-2.218-234",
+                "url": "https://doi.org/10.22378/he.2026-11-2.218-234"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-08",
+              "source_ids": [
+                "source.frontier.doi-10-22378-he-2026-11-2-218-234"
+              ]
+            }
+          },
+          "statement": "doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"",
+          "scope": {
+            "population": "The study reported in doi:10.22378/he.2026-11-2.218-234",
+            "time": "2026-06-08",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+              "start": 1613,
+              "end": 1761,
+              "quote": "The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people."
+            },
+            {
+              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+              "start": 14981,
+              "end": 15020,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,8]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+              "start": 428,
+              "end": 485,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025jd045718",
+          "target_kind": "node",
+          "target_sha256": "36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025jd045718",
+            "label": "Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd045718",
+                "title": "Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
+                "url": "https://api.crossref.org/works/10.1029/2025jd045718"
+              },
+              {
+                "id": "doi:10.1029/2025jd045718",
+                "title": "doi:10.1029/2025jd045718",
+                "url": "https://doi.org/10.1029/2025jd045718"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-06",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025jd045718"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025jd045718",
+            "time": "2026-06-06",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045718",
+              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+              "start": 1844,
+              "end": 2165,
+              "quote": "The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045718",
+              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+              "start": 11103,
+              "end": 11142,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,6]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045718",
+              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+              "start": 425,
+              "end": 482,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2026gl122664",
+          "target_kind": "node",
+          "target_sha256": "f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2026gl122664",
+            "label": "From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122664",
+                "title": "Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122664"
+              },
+              {
+                "id": "doi:10.1029/2026gl122664",
+                "title": "doi:10.1029/2026gl122664",
+                "url": "https://doi.org/10.1029/2026gl122664"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-04",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2026gl122664"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2026gl122664",
+            "time": "2026-06-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122664",
+              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+              "start": 2288,
+              "end": 2456,
+              "quote": "Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake\\u2010river science and water management."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122664",
+              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+              "start": 12101,
+              "end": 12140,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,4]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122664",
+              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+              "start": 435,
+              "end": 492,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-ojoa-70022",
+          "target_kind": "node",
+          "target_sha256": "4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-ojoa-70022",
+            "label": "QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ojoa-70022",
+                "title": "Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
+                "url": "https://api.crossref.org/works/10.1111/ojoa.70022"
+              },
+              {
+                "id": "doi:10.1111/ojoa.70022",
+                "title": "doi:10.1111/ojoa.70022",
+                "url": "https://doi.org/10.1111/ojoa.70022"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-03",
+              "source_ids": [
+                "source.frontier.doi-10-1111-ojoa-70022"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/ojoa.70022",
+            "time": "2026-06-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
+              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+              "start": 1589,
+              "end": 1812,
+              "quote": "The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
+              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+              "start": 18386,
+              "end": 18425,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,3]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
+              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+              "start": 396,
+              "end": 453,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025jd045965",
+          "target_kind": "node",
+          "target_sha256": "a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025jd045965",
+            "label": "Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd045965",
+                "title": "Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S",
+                "url": "https://api.crossref.org/works/10.1029/2025jd045965"
+              },
+              {
+                "id": "doi:10.1029/2025jd045965",
+                "title": "doi:10.1029/2025jd045965",
+                "url": "https://doi.org/10.1029/2025jd045965"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-06-02",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025jd045965"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025jd045965",
+            "time": "2026-06-02",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045965",
+              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+              "start": 3071,
+              "end": 3253,
+              "quote": "These findings suggest that future dust transport to high\\u2010elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045965",
+              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+              "start": 16749,
+              "end": 16788,
+              "quote": "\"published\":{\"date-parts\":[[2026,6,2]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045965",
+              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+              "start": 425,
+              "end": 482,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-jssr-70066",
+          "target_kind": "node",
+          "target_sha256": "fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-jssr-70066",
+            "label": "Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jssr-70066",
+                "title": "Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
+                "url": "https://api.crossref.org/works/10.1111/jssr.70066"
+              },
+              {
+                "id": "doi:10.1111/jssr.70066",
+                "title": "doi:10.1111/jssr.70066",
+                "url": "https://doi.org/10.1111/jssr.70066"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-30",
+              "source_ids": [
+                "source.frontier.doi-10-1111-jssr-70066"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/jssr.70066",
+            "time": "2026-05-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jssr-70066",
+              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+              "start": 1384,
+              "end": 1579,
+              "quote": "The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-jssr-70066",
+              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+              "start": 9127,
+              "end": 9167,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-jssr-70066",
+              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025wr042846",
+          "target_kind": "node",
+          "target_sha256": "cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025wr042846",
+            "label": "Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025wr042846",
+                "title": "Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
+                "url": "https://api.crossref.org/works/10.1029/2025wr042846"
+              },
+              {
+                "id": "doi:10.1029/2025wr042846",
+                "title": "doi:10.1029/2025wr042846",
+                "url": "https://doi.org/10.1029/2025wr042846"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-30",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025wr042846"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025wr042846",
+            "time": "2026-05-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr042846",
+              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+              "start": 2317,
+              "end": 2504,
+              "quote": "The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr042846",
+              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+              "start": 22865,
+              "end": 22905,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,30]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr042846",
+              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+              "start": 425,
+              "end": 482,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-3897-jbgs-e185535",
+          "target_kind": "node",
+          "target_sha256": "84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-3897-jbgs-e185535",
+            "label": "Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-jbgs-e185535",
+                "title": "Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us",
+                "url": "https://api.crossref.org/works/10.3897/jbgs.e185535"
+              },
+              {
+                "id": "doi:10.3897/jbgs.e185535",
+                "title": "doi:10.3897/jbgs.e185535",
+                "url": "https://doi.org/10.3897/jbgs.e185535"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-29",
+              "source_ids": [
+                "source.frontier.doi-10-3897-jbgs-e185535"
+              ]
+            }
+          },
+          "statement": "doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"",
+          "scope": {
+            "population": "The study reported in doi:10.3897/jbgs.e185535",
+            "time": "2026-05-29",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
+              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+              "start": 1297,
+              "end": 1399,
+              "quote": "The results reveal a marked decoupling between potential soil erosion and effective sediment transfer."
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
+              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+              "start": 4285,
+              "end": 4325,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,29]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
+              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+              "start": 398,
+              "end": 455,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-esp4-70082",
+          "target_kind": "node",
+          "target_sha256": "15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-esp4-70082",
+            "label": "Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-esp4-70082",
+                "title": "Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
+                "url": "https://api.crossref.org/works/10.1002/esp4.70082"
+              },
+              {
+                "id": "doi:10.1002/esp4.70082",
+                "title": "doi:10.1002/esp4.70082",
+                "url": "https://doi.org/10.1002/esp4.70082"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-29",
+              "source_ids": [
+                "source.frontier.doi-10-1002-esp4-70082"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/esp4.70082",
+            "time": "2026-05-29",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70082",
+              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+              "start": 2168,
+              "end": 2543,
+              "quote": "Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface\\u2010to\\u2010borehole transfer functions consistent with 1D assumptions."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70082",
+              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+              "start": 10843,
+              "end": 10883,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,29]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70082",
+              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+              "start": 408,
+              "end": 465,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-3897-nhcm-3-184711",
+          "target_kind": "node",
+          "target_sha256": "94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-3897-nhcm-3-184711",
+            "label": "Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-nhcm-3-184711",
+                "title": "Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ",
+                "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711"
+              },
+              {
+                "id": "doi:10.3897/nhcm.3.184711",
+                "title": "doi:10.3897/nhcm.3.184711",
+                "url": "https://doi.org/10.3897/nhcm.3.184711"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-28",
+              "source_ids": [
+                "source.frontier.doi-10-3897-nhcm-3-184711"
+              ]
+            }
+          },
+          "statement": "doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"",
+          "scope": {
+            "population": "The study reported in doi:10.3897/nhcm.3.184711",
+            "time": "2026-05-28",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
+              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+              "start": 1658,
+              "end": 1837,
+              "quote": "Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data."
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
+              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+              "start": 41735,
+              "end": 41775,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,28]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
+              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+              "start": 400,
+              "end": 457,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1029-2025gc012776",
+          "target_kind": "node",
+          "target_sha256": "be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1029-2025gc012776",
+            "label": "Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gc012776",
+                "title": "Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ",
+                "url": "https://api.crossref.org/works/10.1029/2025gc012776"
+              },
+              {
+                "id": "doi:10.1029/2025gc012776",
+                "title": "doi:10.1029/2025gc012776",
+                "url": "https://doi.org/10.1029/2025gc012776"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-28",
+              "source_ids": [
+                "source.frontier.doi-10-1029-2025gc012776"
+              ]
+            }
+          },
+          "statement": "doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"",
+          "scope": {
+            "population": "The study reported in doi:10.1029/2025gc012776",
+            "time": "2026-05-28",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gc012776",
+              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+              "start": 1295,
+              "end": 1428,
+              "quote": "We show the first results of sidescan\\u2010sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV)."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gc012776",
+              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+              "start": 13043,
+              "end": 13083,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,28]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gc012776",
+              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+              "start": 424,
+              "end": 481,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1002-joc-70436",
+          "target_kind": "node",
+          "target_sha256": "af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1002-joc-70436",
+            "label": "Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70436",
+                "title": "Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
+                "url": "https://api.crossref.org/works/10.1002/joc.70436"
+              },
+              {
+                "id": "doi:10.1002/joc.70436",
+                "title": "doi:10.1002/joc.70436",
+                "url": "https://doi.org/10.1002/joc.70436"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-26",
+              "source_ids": [
+                "source.frontier.doi-10-1002-joc-70436"
+              ]
+            }
+          },
+          "statement": "doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1002/joc.70436",
+            "time": "2026-05-26",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70436",
+              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+              "start": 2020,
+              "end": 2199,
+              "quote": "The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70436",
+              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+              "start": 12761,
+              "end": 12801,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,26]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70436",
+              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+              "start": 409,
+              "end": 466,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-2166-hydro-2026-191",
+          "target_kind": "node",
+          "target_sha256": "3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-2166-hydro-2026-191",
+            "label": "A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
+            "kind": "claim",
+            "domain": "earth",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-hydro-2026-191",
+                "title": "Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
+                "url": "https://api.crossref.org/works/10.2166/hydro.2026.191"
+              },
+              {
+                "id": "doi:10.2166/hydro.2026.191",
+                "title": "doi:10.2166/hydro.2026.191",
+                "url": "https://doi.org/10.2166/hydro.2026.191"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-23",
+              "source_ids": [
+                "source.frontier.doi-10-2166-hydro-2026-191"
+              ]
+            }
+          },
+          "statement": "doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"",
+          "scope": {
+            "population": "The study reported in doi:10.2166/hydro.2026.191",
+            "time": "2026-05-23",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
+              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+              "start": 2414,
+              "end": 2504,
+              "quote": "Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets."
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
+              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+              "start": 30689,
+              "end": 30729,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,23]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
+              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+              "start": 407,
+              "end": 464,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-ojoa-70020",
+          "target_kind": "node",
+          "target_sha256": "a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-ojoa-70020",
+            "label": "A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ojoa-70020",
+                "title": "Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
+                "url": "https://api.crossref.org/works/10.1111/ojoa.70020"
+              },
+              {
+                "id": "doi:10.1111/ojoa.70020",
+                "title": "doi:10.1111/ojoa.70020",
+                "url": "https://doi.org/10.1111/ojoa.70020"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-06",
+              "source_ids": [
+                "source.frontier.doi-10-1111-ojoa-70020"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/ojoa.70020",
+            "time": "2026-05-06",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
+              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+              "start": 1173,
+              "end": 1298,
+              "quote": "The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
+              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+              "start": 12503,
+              "end": 12542,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,6]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
+              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+              "start": 396,
+              "end": 453,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.claim.frontier.doi-10-1111-phpr-70116",
+          "target_kind": "node",
+          "target_sha256": "1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442",
+          "canonical_record": {
+            "id": "claim.frontier.doi-10-1111-phpr-70116",
+            "label": "Metaethics and the Functions of Moral Language",
+            "kind": "claim",
+            "domain": "humanities",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-phpr-70116",
+                "title": "Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language",
+                "url": "https://api.crossref.org/works/10.1111/phpr.70116"
+              },
+              {
+                "id": "doi:10.1111/phpr.70116",
+                "title": "doi:10.1111/phpr.70116",
+                "url": "https://doi.org/10.1111/phpr.70116"
+              }
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-05-03",
+              "source_ids": [
+                "source.frontier.doi-10-1111-phpr-70116"
+              ]
+            }
+          },
+          "statement": "doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"",
+          "scope": {
+            "population": "The study reported in doi:10.1111/phpr.70116",
+            "time": "2026-05-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
+            "units": null,
+            "quantifiers": "Only what the quoted sentence states"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-phpr-70116",
+              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+              "start": 1568,
+              "end": 1669,
+              "quote": "This analysis shows how multiple functions come to be layered up through different grammatical forms."
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-phpr-70116",
+              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+              "start": 9510,
+              "end": 9549,
+              "quote": "\"published\":{\"date-parts\":[[2026,5,3]]}"
+            },
+            {
+              "source_id": "source.frontier.doi-10-1111-phpr-70116",
+              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+              "start": 396,
+              "end": 453,
+              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ecot-70052.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "413a130ce197e9f36f3c287595cad06412588939f17551941e0f64e413eba646",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ecot-70052",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ecot-70052",
+                "url": "https://api.crossref.org/works/10.1111/ecot.70052"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"",
+          "scope": {
+            "population": "doi:10.1111/ecot.70052 abstract",
+            "time": "2026-10-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ecot-70052",
+              "source_sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
+              "start": 1643,
+              "end": 1717,
+              "quote": "These patterns reveal the redistributive politics of nation\\u2010building."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70333.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "7fff6f0bfdc47c01ade5378ce41abde5313504a8806c7bad0379cda58555d480",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-qj-70333",
+            "target": "field.climatology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-qj-70333",
+                "url": "https://api.crossref.org/works/10.1002/qj.70333"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"",
+          "scope": {
+            "population": "doi:10.1002/qj.70333 abstract",
+            "time": "2026-10-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-qj-70333",
+              "source_sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
+              "start": 2668,
+              "end": 2817,
+              "quote": "These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pwat-0000557.concept.usgs.30",
+          "target_kind": "edge",
+          "target_sha256": "58c5ea033e74aabca1efa3da34754b6c107cbde72c9fe6b73480e558db0ab0e2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pwat-0000557",
+            "target": "concept.usgs.30",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pwat-0000557",
+                "url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pwat.0000557 abstract",
+            "time": "2026-10-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pwat-0000557",
+              "source_sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
+              "start": 909,
+              "end": 1120,
+              "quote": "Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-medu-70340.concept.mesh.d000091682",
+          "target_kind": "edge",
+          "target_sha256": "ae7d3ee5e9729f2c4333a980889dbc57528d24f37821d7eaf21bd9467d71a4ad",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-medu-70340",
+            "target": "concept.mesh.d000091682",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-medu-70340",
+                "url": "https://api.crossref.org/works/10.1111/medu.70340"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"",
+          "scope": {
+            "population": "doi:10.1111/medu.70340 abstract",
+            "time": "2026-10-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-medu-70340",
+              "source_sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
+              "start": 961,
+              "end": 1149,
+              "quote": "Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124622.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "3df951a29cb556e9f3aec0424eb412a8d01b5f74603bf4f341b4b1f59886133b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124622",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124622",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124622"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124622 abstract",
+            "time": "2026-10-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124622",
+              "source_sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
+              "start": 2491,
+              "end": 2605,
+              "quote": "This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1235.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "c7c9a55bd9dd0d2dd463460c366108d55978a30adc289b053dd6cb96da68ce98",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-15351-2373-8456-1235",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-15351-2373-8456-1235",
+                "url": "https://api.crossref.org/works/10.15351/2373-8456.1235"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"",
+          "scope": {
+            "population": "doi:10.15351/2373-8456.1235 abstract",
+            "time": "2026-10-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-15351-2373-8456-1235",
+              "source_sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
+              "start": 1453,
+              "end": 1624,
+              "quote": "Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1216.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "635dee6b4eb2a4c03356a8c62e771a76cfa9d650f10eb9c87183ae62a083ffe3",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-15351-2373-8456-1216",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-15351-2373-8456-1216",
+                "url": "https://api.crossref.org/works/10.15351/2373-8456.1216"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"",
+          "scope": {
+            "population": "doi:10.15351/2373-8456.1216 abstract",
+            "time": "2026-10-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-15351-2373-8456-1216",
+              "source_sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
+              "start": 628,
+              "end": 811,
+              "quote": "The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125301.field.usgs.1678",
+          "target_kind": "edge",
+          "target_sha256": "da4487fc23c63eb6d813c22d74248e4aa651a52a01d7ccce149decf2a06b12f9",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl125301",
+            "target": "field.usgs.1678",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl125301",
+                "url": "https://api.crossref.org/works/10.1029/2026gl125301"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl125301 abstract",
+            "time": "2026-10-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl125301",
+              "source_sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
+              "start": 2549,
+              "end": 2777,
+              "quote": "These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-21425-fob-19-142560.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "3986a8713521ff84b82728c0701beaea23cf1574acd33d708f16431a025eb365",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-21425-fob-19-142560",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-21425-fob-19-142560",
+                "url": "https://api.crossref.org/works/10.21425/fob.19.142560"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"",
+          "scope": {
+            "population": "doi:10.21425/fob.19.142560 abstract",
+            "time": "2026-10-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-21425-fob-19-142560",
+              "source_sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
+              "start": 777,
+              "end": 1034,
+              "quote": "Coastal lomas\\u2014isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America\\u2013provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001044.concept.usgs.1312",
+          "target_kind": "edge",
+          "target_sha256": "3ca128ae2cdaae8af0d2745b32dd313d582659c24c31a45b05827a6fd147e325",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0001044",
+            "target": "concept.usgs.1312",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0001044",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0001044 abstract",
+            "time": "2026-10-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001044",
+              "source_sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
+              "start": 1811,
+              "end": 2024,
+              "quote": "We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000886.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "91e77eddc7fe88292b15ad7ff9449df9ffa91654a37426ec5a37239daae663a2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000886",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000886",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000886 abstract",
+            "time": "2026-10-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000886",
+              "source_sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
+              "start": 627,
+              "end": 768,
+              "quote": "Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1075-consl-25020-lia.field.aat.300054256",
+          "target_kind": "edge",
+          "target_sha256": "ab741047cf8edd3a280ea1ae5164a41b2d305fecef729b32a17daf47b4420e36",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1075-consl-25020-lia",
+            "target": "field.aat.300054256",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1075-consl-25020-lia",
+                "url": "https://api.crossref.org/works/10.1075/consl.25020.lia"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"",
+          "scope": {
+            "population": "doi:10.1075/consl.25020.lia abstract",
+            "time": "2026-10-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1075-consl-25020-lia",
+              "source_sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
+              "start": 938,
+              "end": 1037,
+              "quote": "widely discussed in theoretical linguistics; however, their cognitive status remains underexplored."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-040.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "7aa84f9fccde0b66d8b46cd51ea6a0b5e0100aa08fe39cd8dadb8effbf29e030",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-hydro-2026-040",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-hydro-2026-040",
+                "url": "https://api.crossref.org/works/10.2166/hydro.2026.040"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"",
+          "scope": {
+            "population": "doi:10.2166/hydro.2026.040 abstract",
+            "time": "2026-10-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-hydro-2026-040",
+              "source_sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
+              "start": 1296,
+              "end": 1594,
+              "quote": "Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir\\u2013pumping station systems."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-lol2-70186.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "586a4667b074f2e52528e7bce7d01a69c75b63cfa8237b50a6d262cd25d963eb",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-lol2-70186",
+            "target": "concept.usgs.1034",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-lol2-70186",
+                "url": "https://api.crossref.org/works/10.1002/lol2.70186"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"",
+          "scope": {
+            "population": "doi:10.1002/lol2.70186 abstract",
+            "time": "2026-10-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-lol2-70186",
+              "source_sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
+              "start": 2487,
+              "end": 2709,
+              "quote": "Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124411.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "5093d4ae72b587afb7fd89ce0c7a3b3fa5151c971d6e355cc448f0211313ca38",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124411",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124411",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124411"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124411 abstract",
+            "time": "2026-10-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124411",
+              "source_sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
+              "start": 2042,
+              "end": 2133,
+              "quote": "We conducted a 220\\u2010m mesh simulation over the global domain with realistic topography."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70629.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "5d6d8905a618490c7791a3c4e518f2ceff8351835b11be2fc2bdd1b9c63fd143",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70629",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70629",
+                "url": "https://api.crossref.org/works/10.1002/joc.70629"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70629 abstract",
+            "time": "2026-10-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70629",
+              "source_sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
+              "start": 1520,
+              "end": 1706,
+              "quote": "Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70277.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "41fb50edd017b2abeaf096ab82b2b6c837212a49288078b97056374b2ddaf50e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-1467-9566-70277",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-1467-9566-70277",
+                "url": "https://api.crossref.org/works/10.1111/1467-9566.70277"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"",
+          "scope": {
+            "population": "doi:10.1111/1467-9566.70277 abstract",
+            "time": "2026-10-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9566-70277",
+              "source_sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
+              "start": 2196,
+              "end": 2660,
+              "quote": "Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis\\/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de\\u2010animation or embrace legal ambiguity."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70129.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "f909c4829aec2b28a494a4fbbb9c7bedd68b31c43bf6d114ccec8b30374678e6",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-jpln-70129",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-jpln-70129",
+                "url": "https://api.crossref.org/works/10.1002/jpln.70129"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"",
+          "scope": {
+            "population": "doi:10.1002/jpln.70129 abstract",
+            "time": "2026-10-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-jpln-70129",
+              "source_sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
+              "start": 1315,
+              "end": 1573,
+              "quote": "These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming\\u2010induced increases in respiration potentially reducing their thickness and water\\u2010holding capacity."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70613.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "4ef0afd549f86403f660671f586a68c8cd457c46f96be4e6309a8fcdc9051d06",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70613",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70613",
+                "url": "https://api.crossref.org/works/10.1002/joc.70613"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70613 abstract",
+            "time": "2026-10-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70613",
+              "source_sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
+              "start": 1195,
+              "end": 1383,
+              "quote": "Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70605.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "69ed199b71414bc234eb624180354f6c4dc58b3becc2c5e082b68231d078c223",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70605",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70605",
+                "url": "https://api.crossref.org/works/10.1002/joc.70605"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70605 abstract",
+            "time": "2026-10-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70605",
+              "source_sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
+              "start": 3060,
+              "end": 3297,
+              "quote": "Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3176-arch-2026-2-03.concept.aat.300019278",
+          "target_kind": "edge",
+          "target_sha256": "6902960110627aa91c2da22bb818ab816519532bef2a2bcbc1da2ef938a26b3a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3176-arch-2026-2-03",
+            "target": "concept.aat.300019278",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3176-arch-2026-2-03",
+                "url": "https://api.crossref.org/works/10.3176/arch.2026.2.03"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"",
+          "scope": {
+            "population": "doi:10.3176/arch.2026.2.03 abstract",
+            "time": "2026-10-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3176-arch-2026-2-03",
+              "source_sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
+              "start": 1323,
+              "end": 1483,
+              "quote": "The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep\\/goats forming the basis of animal husbandry."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-580.concept.usgs.27",
+          "target_kind": "edge",
+          "target_sha256": "8a35e876748f847320023ffb2c54fe29270e49c78d29187d40cf9c6c3dc9fd1f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wcc-2026-580",
+            "target": "concept.usgs.27",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-580",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.580"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"",
+          "scope": {
+            "population": "doi:10.2166/wcc.2026.580 abstract",
+            "time": "2026-10-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-580",
+              "source_sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
+              "start": 1070,
+              "end": 1562,
+              "quote": "We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013\\/14\\u20132025\\/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985\\/86\\u20132025\\/26); and (iii) examining associations with ENSO phases and documented droughts."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ijop-70275.field.mesh.d011593",
+          "target_kind": "edge",
+          "target_sha256": "2ee3aac4f377dcbd00941bb67608726f3440664a49824c8a01b481f61deaa9a7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ijop-70275",
+            "target": "field.mesh.d011593",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ijop-70275",
+                "url": "https://api.crossref.org/works/10.1002/ijop.70275"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"",
+          "scope": {
+            "population": "doi:10.1002/ijop.70275 abstract",
+            "time": "2026-10-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ijop-70275",
+              "source_sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
+              "start": 902,
+              "end": 1066,
+              "quote": "Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-popecon-10-e186220.concept.mesh.d006304",
+          "target_kind": "edge",
+          "target_sha256": "a5753ad4654edb69606084614507594daede3f68cc8bbdee7db8cc0711ec2822",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-popecon-10-e186220",
+            "target": "concept.mesh.d006304",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-popecon-10-e186220",
+                "url": "https://api.crossref.org/works/10.3897/popecon.10.e186220"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"",
+          "scope": {
+            "population": "doi:10.3897/popecon.10.e186220 abstract",
+            "time": "2026-10-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-popecon-10-e186220",
+              "source_sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
+              "start": 1440,
+              "end": 1612,
+              "quote": "Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income)."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-507.concept.usgs.27",
+          "target_kind": "edge",
+          "target_sha256": "1b6a46178e802328ea55dde966281c18415dee4deac66bc4240548d5c60f2472",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wcc-2026-507",
+            "target": "concept.usgs.27",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-507",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.507"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"",
+          "scope": {
+            "population": "doi:10.2166/wcc.2026.507 abstract",
+            "time": "2026-10-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-507",
+              "source_sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
+              "start": 1476,
+              "end": 1686,
+              "quote": "The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 \\u00b0C and an increase of 1.6 \\u00b0C over the study period (Sen\\u2019s slope: +0.036 \\u00b0C\\/year)."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e183393.concept.mesh.d017149",
+          "target_kind": "edge",
+          "target_sha256": "df6d963e659278fd99996439db1e1a213dd50233f2763c4a77ec66b9bbe40100",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-brics-econ-7-e183393",
+            "target": "concept.mesh.d017149",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"",
+          "scope": {
+            "population": "doi:10.3897/brics-econ.7.e183393 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
+              "source_sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
+              "start": 923,
+              "end": 1076,
+              "quote": "The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026785.field.aat.300054240",
+          "target_kind": "edge",
+          "target_sha256": "8aa8a1d438ebe7f29c45eea36eeb1ebf63b128f13ae5eac1e32b16d6016bc7a0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-ehass-2026785",
+            "target": "field.aat.300054240",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-ehass-2026785",
+                "url": "https://api.crossref.org/works/10.38159/ehass.2026785"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"",
+          "scope": {
+            "population": "doi:10.38159/ehass.2026785 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-ehass-2026785",
+              "source_sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
+              "start": 1709,
+              "end": 1947,
+              "quote": "This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124090.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "074a553ffdc9c672c32b9ac69e8fb765475c597c36648b97f1f730c85198e67a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124090",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124090",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124090"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124090 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124090",
+              "source_sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
+              "start": 1237,
+              "end": 1378,
+              "quote": "The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-pei3-70207.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "6c98126377bf52e563c8c8ad1bcb25cec9461e0d086807b2f7c281f6bb0bc5ad",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-pei3-70207",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-pei3-70207",
+                "url": "https://api.crossref.org/works/10.1002/pei3.70207"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"",
+          "scope": {
+            "population": "doi:10.1002/pei3.70207 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-pei3-70207",
+              "source_sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
+              "start": 915,
+              "end": 1059,
+              "quote": "Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-fea2-70077.field.anthropology",
+          "target_kind": "edge",
+          "target_sha256": "708679023d721aa70d9c59d8b1de2be111908cf0198ec4638c2acdeceb07581d",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-fea2-70077",
+            "target": "field.anthropology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-fea2-70077",
+                "url": "https://api.crossref.org/works/10.1002/fea2.70077"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"",
+          "scope": {
+            "population": "doi:10.1002/fea2.70077 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-fea2-70077",
+              "source_sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
+              "start": 1784,
+              "end": 2107,
+              "quote": "By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self\\u2010responsibilities and opening new epistemological imaginaries for feminist urban anthropology."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-eet-70146.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "3ae70c59d5fc17a5bd72d8b7fa25d9943f67b60084bfcd6a5a5b1a8093363ffb",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-eet-70146",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-eet-70146",
+                "url": "https://api.crossref.org/works/10.1002/eet.70146"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"",
+          "scope": {
+            "population": "doi:10.1002/eet.70146 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-eet-70146",
+              "source_sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
+              "start": 843,
+              "end": 1003,
+              "quote": "Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-eco-70279.ology.hydrology",
+          "target_kind": "edge",
+          "target_sha256": "3f8dd74fd9b1d418159e335894b0ff2f9dc9559b25fa16add90c516667bf9bca",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-eco-70279",
+            "target": "ology.hydrology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-eco-70279",
+                "url": "https://api.crossref.org/works/10.1002/eco.70279"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"",
+          "scope": {
+            "population": "doi:10.1002/eco.70279 abstract",
+            "time": "2026-09-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-eco-70279",
+              "source_sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
+              "start": 1445,
+              "end": 1632,
+              "quote": "Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124233.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "028cf55a78b7a1cb658530c03360725b336928116b84957cbd488492361ce42d",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124233",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124233",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124233"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124233 abstract",
+            "time": "2026-09-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124233",
+              "source_sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
+              "start": 2024,
+              "end": 2259,
+              "quote": "These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gc013127.concept.usgs.727",
+          "target_kind": "edge",
+          "target_sha256": "dcb058d2c2d350403dcc64ccc215d6ee1456a79af93b84787a24d0a5e057a2a2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gc013127",
+            "target": "concept.usgs.727",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gc013127",
+                "url": "https://api.crossref.org/works/10.1029/2026gc013127"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gc013127 abstract",
+            "time": "2026-09-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gc013127",
+              "source_sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
+              "start": 1719,
+              "end": 1871,
+              "quote": "The rocks record prograde burial, peak high\\u2010pressure amphibolite\\u2010facies metamorphism, and fluid\\u2010assisted retrogression during exhumation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70320.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "044c93e518ff928f92294bb0d4307c623b85ac5319590bc58aa14d7af2302314",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-qj-70320",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-qj-70320",
+                "url": "https://api.crossref.org/works/10.1002/qj.70320"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"",
+          "scope": {
+            "population": "doi:10.1002/qj.70320 abstract",
+            "time": "2026-09-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-qj-70320",
+              "source_sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
+              "start": 1679,
+              "end": 1825,
+              "quote": "The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "bae06e564e38568f02beaf1a9176f5a65d6f793c4c3d47e057bf65db6405300b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-54929-2786-5738-2026-27-09-01",
+            "target": "concept.mesh.d057217",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
+                "url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"",
+          "scope": {
+            "population": "doi:10.54929/2786-5738-2026-27-09-01 abstract",
+            "time": "2026-09-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
+              "source_sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
+              "start": 892,
+              "end": 1080,
+              "quote": "The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261281.concept.aat.300060368",
+          "target_kind": "edge",
+          "target_sha256": "440f66fa02e365b28a8a934694ab41d70025d8496d76b3d34e96d5d824d1864d",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-erats-20261281",
+            "target": "concept.aat.300060368",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-erats-20261281",
+                "url": "https://api.crossref.org/works/10.38159/erats.20261281"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"",
+          "scope": {
+            "population": "doi:10.38159/erats.20261281 abstract",
+            "time": "2026-09-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-erats-20261281",
+              "source_sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
+              "start": 591,
+              "end": 688,
+              "quote": "This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-eco-70277.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "3cebf8181da1f583a23f0978a6dee2c22c03053520727eac4240ab81144cbb5e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-eco-70277",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-eco-70277",
+                "url": "https://api.crossref.org/works/10.1002/eco.70277"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"",
+          "scope": {
+            "population": "doi:10.1002/eco.70277 abstract",
+            "time": "2026-09-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-eco-70277",
+              "source_sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
+              "start": 2283,
+              "end": 2697,
+              "quote": "We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post\\u2010treatment, relative to an untreated watershed, and (3) ET decreased by 90\\u2009mm in the post treatment year for the treated watershed."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-iroh-70046.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "136f637a24e58361baeed3cba87d3e882d5db73df6093c9ac84740ad118c9dde",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-iroh-70046",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-iroh-70046",
+                "url": "https://api.crossref.org/works/10.1002/iroh.70046"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"",
+          "scope": {
+            "population": "doi:10.1002/iroh.70046 abstract",
+            "time": "2026-09-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-iroh-70046",
+              "source_sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
+              "start": 3165,
+              "end": 3256,
+              "quote": "Wildfires are becoming increasingly frequent and severe as a consequence of climate change."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261284.concept.aat.300069306",
+          "target_kind": "edge",
+          "target_sha256": "72b6686a1c9ac7efcd7acc2a0d8c7897305f26ea11263c238198d6b8d2c8fd68",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-erats-20261284",
+            "target": "concept.aat.300069306",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-erats-20261284",
+                "url": "https://api.crossref.org/works/10.38159/erats.20261284"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"",
+          "scope": {
+            "population": "doi:10.38159/erats.20261284 abstract",
+            "time": "2026-09-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-erats-20261284",
+              "source_sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
+              "start": 964,
+              "end": 1118,
+              "quote": "The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ruso-70070.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "bbae0bb2a21f408f515713d9b97f647e4d5e26a1f0078a40092517592d118e74",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ruso-70070",
+            "target": "concept.mesh.d057217",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ruso-70070",
+                "url": "https://api.crossref.org/works/10.1111/ruso.70070"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"",
+          "scope": {
+            "population": "doi:10.1111/ruso.70070 abstract",
+            "time": "2026-09-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ruso-70070",
+              "source_sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
+              "start": 1994,
+              "end": 2446,
+              "quote": "But contrary to views of a binary metro\\u2010nonmetro divide: big\\u2010city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-200681.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "3b02aab8c12c34bb815e397c9fab4e968000577fa9d9817f58510e06db58afbb",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-nhcm-3-200681",
+            "target": "field.mesh.d019021",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-nhcm-3-200681",
+                "url": "https://api.crossref.org/works/10.3897/nhcm.3.200681"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"",
+          "scope": {
+            "population": "doi:10.3897/nhcm.3.200681 abstract",
+            "time": "2026-09-25",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-200681",
+              "source_sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
+              "start": 650,
+              "end": 751,
+              "quote": ": Natural history collections can be a valuable source of genetic material for evolutionary research."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001005.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "37c658edad28ad0b89dc462ec248585db92c0ddd90adb110e8bd356eb40423cc",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0001005",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0001005",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0001005 abstract",
+            "time": "2026-09-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001005",
+              "source_sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
+              "start": 793,
+              "end": 1011,
+              "quote": "Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-moth-70148.field.mesh.d008678",
+          "target_kind": "edge",
+          "target_sha256": "e3d0ac61e4a805be0aead5e39d2e63913fbb95a40fb83cb973180fc91b8f10c6",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-moth-70148",
+            "target": "field.mesh.d008678",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-moth-70148",
+                "url": "https://api.crossref.org/works/10.1111/moth.70148"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"",
+          "scope": {
+            "population": "doi:10.1111/moth.70148 abstract",
+            "time": "2026-09-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-moth-70148",
+              "source_sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
+              "start": 1089,
+              "end": 1202,
+              "quote": "However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-20267724.field.aat.300054288",
+          "target_kind": "edge",
+          "target_sha256": "54b9e21c9b6ea576eecafc57464892bbe6691aa35434d2c16c8af85059266e00",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-ehass-20267724",
+            "target": "field.aat.300054288",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-ehass-20267724",
+                "url": "https://api.crossref.org/works/10.38159/ehass.20267724"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"",
+          "scope": {
+            "population": "doi:10.38159/ehass.20267724 abstract",
+            "time": "2026-09-23",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-ehass-20267724",
+              "source_sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
+              "start": 768,
+              "end": 984,
+              "quote": "Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124881.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "ebb67782a0595644d988fb5734f0e3c2d5a14253a252300a435aee486ff4972d",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124881",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124881",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124881"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124881 abstract",
+            "time": "2026-09-23",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124881",
+              "source_sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
+              "start": 1482,
+              "end": 1543,
+              "quote": "Glacier bed topography is crucial for modeling ice mass loss."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001578.ology.seismology",
+          "target_kind": "edge",
+          "target_sha256": "9c83b12562399d0b7cc3a730343ff71a638da8dd24a9bc22a8d7e34ab439fdc7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026jh001578",
+            "target": "ology.seismology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026jh001578",
+                "url": "https://api.crossref.org/works/10.1029/2026jh001578"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"",
+          "scope": {
+            "population": "doi:10.1029/2026jh001578 abstract",
+            "time": "2026-09-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jh001578",
+              "source_sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
+              "start": 2719,
+              "end": 2913,
+              "quote": "Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data\\u2010driven approaches to rapid earthquake characterization."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-gdj3-70104.ology.meteorology",
+          "target_kind": "edge",
+          "target_sha256": "ba0e72327f0351eaaa5b0699d0d5b7ebb1e286e02a9577f8fc72258d3c19aefa",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-gdj3-70104",
+            "target": "ology.meteorology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-gdj3-70104",
+                "url": "https://api.crossref.org/works/10.1002/gdj3.70104"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"",
+          "scope": {
+            "population": "doi:10.1002/gdj3.70104 abstract",
+            "time": "2026-09-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-gdj3-70104",
+              "source_sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
+              "start": 941,
+              "end": 1066,
+              "quote": "Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122610.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "a40868461cc51d80f2ab195bc477810f9444954ccf350d129551a2a045d4a9ab",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122610",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122610",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122610"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122610 abstract",
+            "time": "2026-09-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122610",
+              "source_sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
+              "start": 956,
+              "end": 1233,
+              "quote": "Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin\\u2010scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70308.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "2b65bb9eac425d93620749c7801216e8f784b13faa6a657dcb146aec1599063a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-qj-70308",
+            "target": "concept.usgs.64",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-qj-70308",
+                "url": "https://api.crossref.org/works/10.1002/qj.70308"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"",
+          "scope": {
+            "population": "doi:10.1002/qj.70308 abstract",
+            "time": "2026-09-17",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-qj-70308",
+              "source_sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
+              "start": 1812,
+              "end": 1876,
+              "quote": "Each regime exhibits a distinct atmospheric circulation pattern."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4281.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "b278bae4fd0a6627085971e63abd53c7e4795ae9b62bb5c6c14c780f00540bca",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-55730-1300-0632-4281",
+            "target": "concept.eia.energy-consumption",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-55730-1300-0632-4281",
+                "url": "https://api.crossref.org/works/10.55730/1300-0632.4281"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"",
+          "scope": {
+            "population": "doi:10.55730/1300-0632.4281 abstract",
+            "time": "2026-09-16",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-55730-1300-0632-4281",
+              "source_sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
+              "start": 899,
+              "end": 1053,
+              "quote": "The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4275.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "980c612f0a4461d7be757a3c6b0d4b0c74ad0f4650f4278d40a4d17ecc1a0612",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-55730-1300-0632-4275",
+            "target": "concept.eia.energy-consumption",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-55730-1300-0632-4275",
+                "url": "https://api.crossref.org/works/10.55730/1300-0632.4275"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"",
+          "scope": {
+            "population": "doi:10.55730/1300-0632.4275 abstract",
+            "time": "2026-09-16",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-55730-1300-0632-4275",
+              "source_sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
+              "start": 1311,
+              "end": 1616,
+              "quote": "Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20\\u201330% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-eet-70139.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "823d43727642b31044de8f706af9ec20e919df8b4fd503af78edea331a7d9188",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-eet-70139",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-eet-70139",
+                "url": "https://api.crossref.org/works/10.1002/eet.70139"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"",
+          "scope": {
+            "population": "doi:10.1002/eet.70139 abstract",
+            "time": "2026-09-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-eet-70139",
+              "source_sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
+              "start": 2452,
+              "end": 2639,
+              "quote": "We show that assembly members were more concerned about climate change and were more likely to engage in climate\\u2010conscious consumption habits following CAUK than before the assembly."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-jclp-70212.ology.psychopathology",
+          "target_kind": "edge",
+          "target_sha256": "0e9258994f368a2f6fcdb5e65757ba5828c985f3b8aa1536bee44b80009a8e22",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-jclp-70212",
+            "target": "ology.psychopathology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-jclp-70212",
+                "url": "https://api.crossref.org/works/10.1002/jclp.70212"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"",
+          "scope": {
+            "population": "doi:10.1002/jclp.70212 abstract",
+            "time": "2026-09-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-jclp-70212",
+              "source_sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
+              "start": 3020,
+              "end": 3213,
+              "quote": "This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-12944-cwe-21-2-3.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "6a162e820ccdcd99284802c8192a48f57226e01e217c479743c74eb3c2ec606f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-12944-cwe-21-2-3",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-12944-cwe-21-2-3",
+                "url": "https://api.crossref.org/works/10.12944/cwe.21.2.3"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"",
+          "scope": {
+            "population": "doi:10.12944/cwe.21.2.3 abstract",
+            "time": "2026-09-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-12944-cwe-21-2-3",
+              "source_sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
+              "start": 797,
+              "end": 1243,
+              "quote": "This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-bse-71470.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "d142f92e16042c6eae2b6e1d393674e3dfd15aada1c53b94526a78e7b6242e71",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-bse-71470",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-bse-71470",
+                "url": "https://api.crossref.org/works/10.1002/bse.71470"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"",
+          "scope": {
+            "population": "doi:10.1002/bse.71470 abstract",
+            "time": "2026-09-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-bse-71470",
+              "source_sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
+              "start": 1444,
+              "end": 1577,
+              "quote": "This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000986.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "5568aa84d74a54e19ec83cc77b3444176c7251b24c6d8bf7cd1eac79d5ee61b7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000986",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000986",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000986 abstract",
+            "time": "2026-09-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000986",
+              "source_sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
+              "start": 1343,
+              "end": 1567,
+              "quote": "This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-1752-1688-70151.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "332fe084ed8ec047f9b0ce05a10614d344ff3d34bf5d20456419851ce33c9461",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-1752-1688-70151",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-1752-1688-70151",
+                "url": "https://api.crossref.org/works/10.1111/1752-1688.70151"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"",
+          "scope": {
+            "population": "doi:10.1111/1752-1688.70151 abstract",
+            "time": "2026-09-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-1752-1688-70151",
+              "source_sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
+              "start": 1874,
+              "end": 2156,
+              "quote": "Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land\\u2010use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-jade-70048.concept.aat.300054181",
+          "target_kind": "edge",
+          "target_sha256": "c01fbf16f229689766e1c76ff2afd2187e28ccb0b5febb8928f5ecc49d243168",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-jade-70048",
+            "target": "concept.aat.300054181",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jade-70048",
+                "url": "https://api.crossref.org/works/10.1111/jade.70048"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"",
+          "scope": {
+            "population": "doi:10.1111/jade.70048 abstract",
+            "time": "2026-09-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jade-70048",
+              "source_sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
+              "start": 1091,
+              "end": 1202,
+              "quote": "This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-lcrp-70059.concept.mesh.d000075665",
+          "target_kind": "edge",
+          "target_sha256": "231b567079f61a2c7b73d4498e6588fb97c1db07cbd428db00364209f7618b45",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-lcrp-70059",
+            "target": "concept.mesh.d000075665",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-lcrp-70059",
+                "url": "https://api.crossref.org/works/10.1111/lcrp.70059"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"",
+          "scope": {
+            "population": "doi:10.1111/lcrp.70059 abstract",
+            "time": "2026-09-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-lcrp-70059",
+              "source_sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
+              "start": 1688,
+              "end": 1885,
+              "quote": "Any peer\\u2010reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post\\u2010release outcomes or recidivism."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77938.field.mesh.d000076227",
+          "target_kind": "edge",
+          "target_sha256": "200b9ee34ecb381723b605c58b00384ee717d8a3928d9b387757a5b0ff9ee0e7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-adfm-77938",
+            "target": "field.mesh.d000076227",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-adfm-77938",
+                "url": "https://api.crossref.org/works/10.1002/adfm.77938"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"",
+          "scope": {
+            "population": "doi:10.1002/adfm.77938 abstract",
+            "time": "2026-09-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-adfm-77938",
+              "source_sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
+              "start": 3461,
+              "end": 3835,
+              "quote": "Stereolithography\\u2010printed elastomeric lattices validate these predictions: quasi\\u2010static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability\\u2013especially for off\\u2010center loading in multi\\u2010objective designs."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e185197.concept.mesh.d000070586",
+          "target_kind": "edge",
+          "target_sha256": "2b7b1d9a0b8511ba28c5e86eec55cbef346a3051e2bdd6e2319bfedb3f633924",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-brics-econ-7-e185197",
+            "target": "concept.mesh.d000070586",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"",
+          "scope": {
+            "population": "doi:10.3897/brics-econ.7.e185197 abstract",
+            "time": "2026-09-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
+              "source_sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
+              "start": 1489,
+              "end": 1926,
+              "quote": "DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125327.concept.usgs.1298",
+          "target_kind": "edge",
+          "target_sha256": "b06ccf5046b58d08eb505ad83799a71b4e588de6b7f7ed902815593003f9e1d7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl125327",
+            "target": "concept.usgs.1298",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl125327",
+                "url": "https://api.crossref.org/works/10.1029/2026gl125327"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl125327 abstract",
+            "time": "2026-09-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl125327",
+              "source_sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
+              "start": 2076,
+              "end": 2206,
+              "quote": "Long\\u2010term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70302.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "a7984b13c49b2720e75906b24aca9cd5236ef51eef4b72d9d898fe4664bc18da",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-qj-70302",
+            "target": "field.climatology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-qj-70302",
+                "url": "https://api.crossref.org/works/10.1002/qj.70302"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"",
+          "scope": {
+            "population": "doi:10.1002/qj.70302 abstract",
+            "time": "2026-09-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-qj-70302",
+              "source_sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
+              "start": 1612,
+              "end": 1784,
+              "quote": "For each case, ensemble experiments were performed with either the zonal\\u2010mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000930.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "b6e8c4e2418f570563e5aaf59e8d186332c205a5a598755206cf693c45639c54",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000930",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000930",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000930 abstract",
+            "time": "2026-09-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000930",
+              "source_sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
+              "start": 1526,
+              "end": 1763,
+              "quote": "Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1098-rsnr-2026-0030.concept.aat.300016617",
+          "target_kind": "edge",
+          "target_sha256": "61c92fb7e36e4fcf77c3e1e95b86877ff96e61f23873104b32f1bc476cbd7860",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1098-rsnr-2026-0030",
+            "target": "concept.aat.300016617",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1098-rsnr-2026-0030",
+                "url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"",
+          "scope": {
+            "population": "doi:10.1098/rsnr.2026.0030 abstract",
+            "time": "2026-09-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1098-rsnr-2026-0030",
+              "source_sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
+              "start": 1402,
+              "end": 1675,
+              "quote": "The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70062.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "1c3d23c0da53c32744fc3fd75b0d0e1d29c8c737679bd2ac3cf864a1516fc9e0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-cli2-70062",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-cli2-70062",
+                "url": "https://api.crossref.org/works/10.1002/cli2.70062"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"",
+          "scope": {
+            "population": "doi:10.1002/cli2.70062 abstract",
+            "time": "2026-09-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-cli2-70062",
+              "source_sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
+              "start": 1183,
+              "end": 1290,
+              "quote": "Despite having similar climatic niches, climate change can affect closely related tree species differently."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "f9680a16c3265fe3661dd70beac7a281228c8446333c66566a4b2cd88039fe20",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
+            "target": "concept.eia.energy-consumption",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
+                "url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"",
+          "scope": {
+            "population": "doi:10.11591/ijeecs.v43.i3.pp965-974 abstract",
+            "time": "2026-09-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
+              "source_sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
+              "start": 1831,
+              "end": 1928,
+              "quote": "Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70852.concept.mesh.d000097815",
+          "target_kind": "edge",
+          "target_sha256": "10b0e59805ed315ba4892dba096f91d2499054928a8b125e546cd1d27b89a56b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ejed-70852",
+            "target": "concept.mesh.d000097815",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejed-70852",
+                "url": "https://api.crossref.org/works/10.1111/ejed.70852"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"",
+          "scope": {
+            "population": "doi:10.1111/ejed.70852 abstract",
+            "time": "2026-09-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70852",
+              "source_sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
+              "start": 1643,
+              "end": 1749,
+              "quote": "The results showed that job demands significantly predicted emotional exhaustion, but not work engagement."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70845.concept.mesh.d000223",
+          "target_kind": "edge",
+          "target_sha256": "03126797c3c1a67f99c6856b97fb361b2a048a21d8ffbd9f9faeeceafdce7e43",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ejed-70845",
+            "target": "concept.mesh.d000223",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejed-70845",
+                "url": "https://api.crossref.org/works/10.1111/ejed.70845"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"",
+          "scope": {
+            "population": "doi:10.1111/ejed.70845 abstract",
+            "time": "2026-09-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70845",
+              "source_sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
+              "start": 2882,
+              "end": 3065,
+              "quote": "These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI\\u2010supported language learning."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001039.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "f681f86b6cd6221c90f693200afd14c0ba7fb39129b8bd2f4f3e93a3cbff9617",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0001039",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0001039",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0001039 abstract",
+            "time": "2026-08-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001039",
+              "source_sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
+              "start": 1718,
+              "end": 1867,
+              "quote": "Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-nup-70114.field.aat.300054297",
+          "target_kind": "edge",
+          "target_sha256": "22afd973472db19dfb2940b071d91b713f91648c736039bd278d2034fe2172ea",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-nup-70114",
+            "target": "field.aat.300054297",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-nup-70114",
+                "url": "https://api.crossref.org/works/10.1111/nup.70114"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"",
+          "scope": {
+            "population": "doi:10.1111/nup.70114 abstract",
+            "time": "2026-08-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-nup-70114",
+              "source_sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
+              "start": 1344,
+              "end": 1515,
+              "quote": "Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ejss-70414.concept.usgs.1731",
+          "target_kind": "edge",
+          "target_sha256": "1eca545df4306771858ce11a14f3eb6363adad118502b56871804206e712db6e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ejss-70414",
+            "target": "concept.usgs.1731",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejss-70414",
+                "url": "https://api.crossref.org/works/10.1111/ejss.70414"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"",
+          "scope": {
+            "population": "doi:10.1111/ejss.70414 abstract",
+            "time": "2026-08-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejss-70414",
+              "source_sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
+              "start": 4335,
+              "end": 4706,
+              "quote": "These findings highlight that intensification, more than the organic\\u2010versus\\u2010conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil\\u2010conservation practices."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026wr044293.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "7994fd2f12baf505e42cdbc406a718fc5e558e261cb0f510c28c42af6ff37759",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026wr044293",
+            "target": "concept.usgs.1034",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026wr044293",
+                "url": "https://api.crossref.org/works/10.1029/2026wr044293"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"",
+          "scope": {
+            "population": "doi:10.1029/2026wr044293 abstract",
+            "time": "2026-08-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026wr044293",
+              "source_sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
+              "start": 1511,
+              "end": 1667,
+              "quote": "Here we show that the temporal variability of sediment transport results from switching\\u00a0between a finite set of recurrent morphological configurations."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-esp-70399.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "a655ebb19ba84e432978fcb5d5412e23b423e8765df90eacc1fae687523be229",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-esp-70399",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-esp-70399",
+                "url": "https://api.crossref.org/works/10.1002/esp.70399"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"",
+          "scope": {
+            "population": "doi:10.1002/esp.70399 abstract",
+            "time": "2026-08-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-esp-70399",
+              "source_sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
+              "start": 1932,
+              "end": 2204,
+              "quote": "We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co\\u2010seismic damage."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-jqs-70108.ology.sedimentology",
+          "target_kind": "edge",
+          "target_sha256": "368366ec2806e816d6adab901517f4ed74589e505b34452338f9a8943ec295b0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-jqs-70108",
+            "target": "ology.sedimentology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-jqs-70108",
+                "url": "https://api.crossref.org/works/10.1002/jqs.70108"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"",
+          "scope": {
+            "population": "doi:10.1002/jqs.70108 abstract",
+            "time": "2026-08-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-jqs-70108",
+              "source_sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
+              "start": 1278,
+              "end": 1474,
+              "quote": "However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jd046723.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "cf3ec6c8fde9a680a1c9df6dbeb94d56f5eb02b27c50428a2e6052129d499bfa",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026jd046723",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026jd046723",
+                "url": "https://api.crossref.org/works/10.1029/2026jd046723"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"",
+          "scope": {
+            "population": "doi:10.1029/2026jd046723 abstract",
+            "time": "2026-08-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jd046723",
+              "source_sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
+              "start": 2169,
+              "end": 2421,
+              "quote": "In this study, we use IsoRSM, an isotope\\u2010enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-msd2-70089.concept.eia.electric-energy",
+          "target_kind": "edge",
+          "target_sha256": "2b2d57db3262660a239464992d41469e50f9d4a51ced95584e5b2359608fb7a0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-msd2-70089",
+            "target": "concept.eia.electric-energy",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-msd2-70089",
+                "url": "https://api.crossref.org/works/10.1002/msd2.70089"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"",
+          "scope": {
+            "population": "doi:10.1002/msd2.70089 abstract",
+            "time": "2026-08-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-msd2-70089",
+              "source_sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
+              "start": 2827,
+              "end": 2996,
+              "quote": "The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70342.field.aat.300054263",
+          "target_kind": "edge",
+          "target_sha256": "55f33142020fbac13bf21380c4374403266f46cdb0aab9affeb012936f057fdf",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ijal-70342",
+            "target": "field.aat.300054263",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ijal-70342",
+                "url": "https://api.crossref.org/works/10.1111/ijal.70342"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"",
+          "scope": {
+            "population": "doi:10.1111/ijal.70342 abstract",
+            "time": "2026-08-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70342",
+              "source_sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
+              "start": 1276,
+              "end": 1534,
+              "quote": "In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills\\u2010focused language teaching."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70059.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "57cc1c4163c135c16e71f548200b3335302641c2354d77550a2df7f6ccef875d",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-cli2-70059",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-cli2-70059",
+                "url": "https://api.crossref.org/works/10.1002/cli2.70059"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"",
+          "scope": {
+            "population": "doi:10.1002/cli2.70059 abstract",
+            "time": "2026-08-20",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-cli2-70059",
+              "source_sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
+              "start": 2249,
+              "end": 2443,
+              "quote": "However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124727.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "9de5826b34ea49d1e147a936fab8aef49e8b48caa1c8a00cb78e233ce1a0fc56",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124727",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124727",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124727"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124727 abstract",
+            "time": "2026-08-19",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124727",
+              "source_sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
+              "start": 955,
+              "end": 1141,
+              "quote": "The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000877.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "870f675c090fecc7e40e9fccd64338d4b6573842ec02a43e9f858c6466da6b50",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000877",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000877",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000877 abstract",
+            "time": "2026-08-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000877",
+              "source_sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
+              "start": 1810,
+              "end": 1903,
+              "quote": "Consequently, climate change is affecting the global distribution of diseases such as dengue."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70054.concept.usgs.1145",
+          "target_kind": "edge",
+          "target_sha256": "57cfd1fa059479121dd39cd7015839cb60027f379c452d354347a277f5e2aa60",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-jmg-70054",
+            "target": "concept.usgs.1145",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jmg-70054",
+                "url": "https://api.crossref.org/works/10.1111/jmg.70054"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"",
+          "scope": {
+            "population": "doi:10.1111/jmg.70054 abstract",
+            "time": "2026-08-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jmg-70054",
+              "source_sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
+              "start": 1079,
+              "end": 1217,
+              "quote": "Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-moth-70134.concept.mesh.d006808",
+          "target_kind": "edge",
+          "target_sha256": "075acc6dce6372ce0982dde46c29bc22da33366fb665156513d28599fd15553f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-moth-70134",
+            "target": "concept.mesh.d006808",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-moth-70134",
+                "url": "https://api.crossref.org/works/10.1111/moth.70134"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"",
+          "scope": {
+            "population": "doi:10.1111/moth.70134 abstract",
+            "time": "2026-08-17",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-moth-70134",
+              "source_sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
+              "start": 879,
+              "end": 1011,
+              "quote": "This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-gwat-70098.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "e069a6616981d994426c6cf255049159f38fbc7fb32af0e735a313d686d7d3eb",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-gwat-70098",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-gwat-70098",
+                "url": "https://api.crossref.org/works/10.1111/gwat.70098"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"",
+          "scope": {
+            "population": "doi:10.1111/gwat.70098 abstract",
+            "time": "2026-08-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-gwat-70098",
+              "source_sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
+              "start": 1704,
+              "end": 1944,
+              "quote": "Climate change and human activities increasingly affect interconnected stream\\u2013aquifer systems, motivating continued evaluation of how stream\\u2013aquifer interactions are represented in integrated groundwater\\u2013surface water models."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wp-2026-018.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "21cb010041d462fd8fd5a29ba22d12438e29a03acf349d17c27367374c61c33e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wp-2026-018",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wp-2026-018",
+                "url": "https://api.crossref.org/works/10.2166/wp.2026.018"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"",
+          "scope": {
+            "population": "doi:10.2166/wp.2026.018 abstract",
+            "time": "2026-08-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wp-2026-018",
+              "source_sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
+              "start": 2949,
+              "end": 3144,
+              "quote": "With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0107.field.aat.300389758",
+          "target_kind": "edge",
+          "target_sha256": "cd0285dcd8d84ff3276063eb5231555bcb63bb6b40baa8da1dd7bc5e379bb852",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1098-rsta-2025-0107",
+            "target": "field.aat.300389758",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1098-rsta-2025-0107",
+                "url": "https://api.crossref.org/works/10.1098/rsta.2025.0107"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"",
+          "scope": {
+            "population": "doi:10.1098/rsta.2025.0107 abstract",
+            "time": "2026-08-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1098-rsta-2025-0107",
+              "source_sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
+              "start": 1569,
+              "end": 1891,
+              "quote": "These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000931.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "3b93367f56a100af9711d79cf0398ec0b1defd995eea2751cd18d8eaf7c88da2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000931",
+            "target": "concept.usgs.168",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000931",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000931 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000931",
+              "source_sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
+              "start": 921,
+              "end": 1055,
+              "quote": "The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122646.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "d80b59feca9f2643c8127f2af6f4e59ea53f61c45477eda27131b05289272f7a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122646",
+            "target": "concept.usgs.819",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122646",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122646"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122646 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122646",
+              "source_sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
+              "start": 1059,
+              "end": 1270,
+              "quote": "Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70058.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "26faf98e1617c498f14fcaf1a9f99fc2e0ea0afc0cefdb2d687940945652e28a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ppp-70058",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ppp-70058",
+                "url": "https://api.crossref.org/works/10.1002/ppp.70058"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"",
+          "scope": {
+            "population": "doi:10.1002/ppp.70058 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70058",
+              "source_sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
+              "start": 2020,
+              "end": 2246,
+              "quote": "We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10\\u2010min interval for nearly 2\\u2009years."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70107.ology.mineralogy",
+          "target_kind": "edge",
+          "target_sha256": "eabf986a68eb7d042c78f083bb3201adedef5dfacea5beb82db6f9b133aa38a1",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-jpln-70107",
+            "target": "ology.mineralogy",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-jpln-70107",
+                "url": "https://api.crossref.org/works/10.1002/jpln.70107"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"",
+          "scope": {
+            "population": "doi:10.1002/jpln.70107 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-jpln-70107",
+              "source_sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
+              "start": 3513,
+              "end": 3692,
+              "quote": "This research underscores the need for site\\u2010specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-187529.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "c59f73ce630e6023ef9ab5c5df42b1f18da0655a68f6e1c2387696ebe2ffd123",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-nhcm-3-187529",
+            "target": "field.mesh.d019021",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-nhcm-3-187529",
+                "url": "https://api.crossref.org/works/10.3897/nhcm.3.187529"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"",
+          "scope": {
+            "population": "doi:10.3897/nhcm.3.187529 abstract",
+            "time": "2026-08-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-187529",
+              "source_sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
+              "start": 583,
+              "end": 717,
+              "quote": "Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026775.field.aat.300054255",
+          "target_kind": "edge",
+          "target_sha256": "89c395e3b5b43e2d74d942f5b61fe00955134a024cd35b14e745aecb7820da25",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-ehass-2026775",
+            "target": "field.aat.300054255",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-ehass-2026775",
+                "url": "https://api.crossref.org/works/10.38159/ehass.2026775"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"",
+          "scope": {
+            "population": "doi:10.38159/ehass.2026775 abstract",
+            "time": "2026-08-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-ehass-2026775",
+              "source_sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
+              "start": 2160,
+              "end": 2429,
+              "quote": "The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshiven\\u1e13a-speaking communities."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026774.concept.aat.300262706",
+          "target_kind": "edge",
+          "target_sha256": "e375c52d50d9a3d5c3274cdbeaabe4fc90ce29c2e3d24f57c17e75331a69314f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-38159-ehass-2026774",
+            "target": "concept.aat.300262706",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-38159-ehass-2026774",
+                "url": "https://api.crossref.org/works/10.38159/ehass.2026774"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"",
+          "scope": {
+            "population": "doi:10.38159/ehass.2026774 abstract",
+            "time": "2026-08-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-38159-ehass-2026774",
+              "source_sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
+              "start": 757,
+              "end": 928,
+              "quote": "This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-hec-70140.concept.mesh.d006304",
+          "target_kind": "edge",
+          "target_sha256": "4d0e2faad6ec1db51c9ecabb0cb38dec9a15d81fd0a8a7acc6eb68bbecedd82e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-hec-70140",
+            "target": "concept.mesh.d006304",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-hec-70140",
+                "url": "https://api.crossref.org/works/10.1002/hec.70140"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"",
+          "scope": {
+            "population": "doi:10.1002/hec.70140 abstract",
+            "time": "2026-08-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-hec-70140",
+              "source_sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
+              "start": 1337,
+              "end": 1477,
+              "quote": "One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-tox-70177.concept.usgs.435",
+          "target_kind": "edge",
+          "target_sha256": "03f2d69fe3e86e3e32863029e02de5defd5de61377f858dadb9bdae3efc50ac8",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-tox-70177",
+            "target": "concept.usgs.435",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-tox-70177",
+                "url": "https://api.crossref.org/works/10.1002/tox.70177"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"",
+          "scope": {
+            "population": "doi:10.1002/tox.70177 abstract",
+            "time": "2026-08-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-tox-70177",
+              "source_sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
+              "start": 3409,
+              "end": 3653,
+              "quote": "These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water\\u2010quality management, and underscore the need for continued monitoring to support effective water\\u2010resource management."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77585.field.mesh.d044085",
+          "target_kind": "edge",
+          "target_sha256": "932a66e8f067dd34c5dcc96caeb75527f1a0e0be66c2af03e3029025af511648",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-adfm-77585",
+            "target": "field.mesh.d044085",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-adfm-77585",
+                "url": "https://api.crossref.org/works/10.1002/adfm.77585"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"",
+          "scope": {
+            "population": "doi:10.1002/adfm.77585 abstract",
+            "time": "2026-08-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-adfm-77585",
+              "source_sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
+              "start": 1269,
+              "end": 1342,
+              "quote": "Fluid pumping underpins technologies from microfluidics to soft robotics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70245.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "0d407c662e3ab90a674023eceaf60e79bdcaa50309cf801a2f9d87595758d885",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-1467-9566-70245",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-1467-9566-70245",
+                "url": "https://api.crossref.org/works/10.1111/1467-9566.70245"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"",
+          "scope": {
+            "population": "doi:10.1111/1467-9566.70245 abstract",
+            "time": "2026-08-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9566-70245",
+              "source_sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
+              "start": 2494,
+              "end": 2770,
+              "quote": "In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70337.field.aat.300054255",
+          "target_kind": "edge",
+          "target_sha256": "823d22274092f6a74cb246836de4e960d2306c30fbe24958ecef7948ae265ae3",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ijal-70337",
+            "target": "field.aat.300054255",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ijal-70337",
+                "url": "https://api.crossref.org/works/10.1111/ijal.70337"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"",
+          "scope": {
+            "population": "doi:10.1111/ijal.70337 abstract",
+            "time": "2026-08-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70337",
+              "source_sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
+              "start": 1256,
+              "end": 1511,
+              "quote": "Informed by critical sociolinguistics and political economy, the study draws on ten semi\\u2010structured interviews with six teachers\\/educators and four students from local universities, rural communities and linguistically minoritised settings in China."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123821.concept.usgs.2028",
+          "target_kind": "edge",
+          "target_sha256": "392f56fe5d9f837ba1a66d41b1708337b7322ee2f1a1c09d75ceb43a9c5e6fe8",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl123821",
+            "target": "concept.usgs.2028",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl123821",
+                "url": "https://api.crossref.org/works/10.1029/2026gl123821"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl123821 abstract",
+            "time": "2026-08-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl123821",
+              "source_sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
+              "start": 1449,
+              "end": 1730,
+              "quote": "Here, we combine observation\\u2010based aquifer records with gridded groundwater table depth (GWD) model outputs (2000\\u20132015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70252.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "30692f0745cfa35cf656234ae1065de640303228c84100b909a326aa269d780b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-qj-70252",
+            "target": "concept.usgs.819",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-qj-70252",
+                "url": "https://api.crossref.org/works/10.1002/qj.70252"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"",
+          "scope": {
+            "population": "doi:10.1002/qj.70252 abstract",
+            "time": "2026-08-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-qj-70252",
+              "source_sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
+              "start": 1736,
+              "end": 2009,
+              "quote": "It is shown that these skin temperature estimates improve the fit of the short\\u2010range forecast ocean temperature profiles to Array for Real\\u2010Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70540.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "0965bde54a2ddd0f7e90ee273365f4962fd1484c7430a031ad97944f53e6d97e",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70540",
+            "target": "concept.usgs.64",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70540",
+                "url": "https://api.crossref.org/works/10.1002/joc.70540"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70540 abstract",
+            "time": "2026-08-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70540",
+              "source_sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
+              "start": 2644,
+              "end": 2865,
+              "quote": "Furthermore, the ensemble members under\\u2010represent observed dynamical interannual variability, resulting in fewer high\\u2010impact winters associated with persistent large\\u2010scale atmospheric circulation anomalies."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-eje-70266.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "43e2cb6f68dbe2ce7dcfec60226866e44313f4f2bed32da14361b0943a17144a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-eje-70266",
+            "target": "concept.mesh.d006803",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-eje-70266",
+                "url": "https://api.crossref.org/works/10.1111/eje.70266"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"",
+          "scope": {
+            "population": "doi:10.1111/eje.70266 abstract",
+            "time": "2026-07-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-eje-70266",
+              "source_sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
+              "start": 1124,
+              "end": 1276,
+              "quote": "Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2\\u2010week OSL program in Tanzania."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ecpo-70064.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "9d535648cc70e0fe441dc7c258ac616a306f2ff36f5f5d6d74ca31cfd31b40f7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ecpo-70064",
+            "target": "concept.mesh.d003906",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ecpo-70064",
+                "url": "https://api.crossref.org/works/10.1111/ecpo.70064"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"",
+          "scope": {
+            "population": "doi:10.1111/ecpo.70064 abstract",
+            "time": "2026-07-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ecpo-70064",
+              "source_sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
+              "start": 861,
+              "end": 1006,
+              "quote": "China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-beer-70139.concept.mesh.d012941",
+          "target_kind": "edge",
+          "target_sha256": "4a4b958419b8bd96eaacd5b404fd954052600e725c0a8fc209f867d5f44c0109",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-beer-70139",
+            "target": "concept.mesh.d012941",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-beer-70139",
+                "url": "https://api.crossref.org/works/10.1111/beer.70139"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"",
+          "scope": {
+            "population": "doi:10.1111/beer.70139 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-beer-70139",
+              "source_sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
+              "start": 840,
+              "end": 1042,
+              "quote": "This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0029.field.aat.300054297",
+          "target_kind": "edge",
+          "target_sha256": "d04ad2eb1b13c49ed964cf507c49d71f693793799169bba19d27a5d4220b51f5",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1098-rsta-2025-0029",
+            "target": "field.aat.300054297",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1098-rsta-2025-0029",
+                "url": "https://api.crossref.org/works/10.1098/rsta.2025.0029"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"",
+          "scope": {
+            "population": "doi:10.1098/rsta.2025.0029 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1098-rsta-2025-0029",
+              "source_sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
+              "start": 1238,
+              "end": 1375,
+              "quote": "We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124661.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "55a00eefabe46841268f7fa262e0e0412cd15c0366b806a59d817d0106dbf31c",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124661",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124661",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124661"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124661 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124661",
+              "source_sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
+              "start": 1168,
+              "end": 1382,
+              "quote": "These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40\\u00a0cm) from near\\u2010surface observations (5\\u00a0cm)."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jc023581.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "a18ba45043b77113b0e3b3a9d3adfe3119c6ba58be45cd7585be9fa2df4d2fa1",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jc023581",
+            "target": "concept.usgs.1034",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jc023581",
+                "url": "https://api.crossref.org/works/10.1029/2025jc023581"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jc023581 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jc023581",
+              "source_sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
+              "start": 1920,
+              "end": 2059,
+              "quote": "The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jb032632.field.navigation",
+          "target_kind": "edge",
+          "target_sha256": "6de6605b857cc8977937877057635fa3102dca7da7d06447b136c5d3a84ef339",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jb032632",
+            "target": "field.navigation",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jb032632",
+                "url": "https://api.crossref.org/works/10.1029/2025jb032632"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"",
+          "scope": {
+            "population": "doi:10.1029/2025jb032632 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jb032632",
+              "source_sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
+              "start": 2240,
+              "end": 2532,
+              "quote": "In a comparison with Global Navigation Satellite System\\u2010derived measurements of deformation, our approach dramatically outperforms a state\\u2010of\\u2010the\\u2010art correction method based on a weather model, reducing root\\u2010mean\\u2010square error by  (0.006\\u00a0m vs. 0.017\\u00a0m)."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70526.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "9d32184199f687914a2f80ca00dbb579a7c54e835cafcf1d4f58c3a84f7456b8",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70526",
+            "target": "field.climatology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70526",
+                "url": "https://api.crossref.org/works/10.1002/joc.70526"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70526 abstract",
+            "time": "2026-07-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70526",
+              "source_sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
+              "start": 1036,
+              "end": 1276,
+              "quote": "Here, we develop a station\\u2010based, multi\\u2010timescale drought climatology for Greece (1960\\u20132022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-saje-70032.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "c7a43702e148ff21455a1439315c19ce38671f09535e13897b8967a33d81bdd6",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-saje-70032",
+            "target": "concept.mesh.d006803",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-saje-70032",
+                "url": "https://api.crossref.org/works/10.1111/saje.70032"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"",
+          "scope": {
+            "population": "doi:10.1111/saje.70032 abstract",
+            "time": "2026-07-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-saje-70032",
+              "source_sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
+              "start": 1147,
+              "end": 1237,
+              "quote": "We find that digitalisation has a nonlinear effect on corruption and on human development."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124111.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "8e7e4115d7cd3db903ccdfc4c14129d22450e2176267309fd09f300da054462f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl124111",
+            "target": "concept.usgs.819",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl124111",
+                "url": "https://api.crossref.org/works/10.1029/2026gl124111"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl124111 abstract",
+            "time": "2026-07-23",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl124111",
+              "source_sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
+              "start": 3590,
+              "end": 3779,
+              "quote": "These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70772.concept.mesh.d000097822",
+          "target_kind": "edge",
+          "target_sha256": "3e62a6474f79f8cb4795b144fb48f00f5952215fe1b5aa709126d6cd47192bd0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ejed-70772",
+            "target": "concept.mesh.d000097822",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejed-70772",
+                "url": "https://api.crossref.org/works/10.1111/ejed.70772"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"",
+          "scope": {
+            "population": "doi:10.1111/ejed.70772 abstract",
+            "time": "2026-07-20",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70772",
+              "source_sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
+              "start": 1324,
+              "end": 1537,
+              "quote": "Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122539.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "c40b0c002dfce5e52c92ebb40cea4fe5c9990a4b2a9da8eeda5a1e0161f5927a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122539",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122539",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122539"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122539 abstract",
+            "time": "2026-07-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122539",
+              "source_sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
+              "start": 966,
+              "end": 1324,
+              "quote": "The NASA\\/CNES Surface Water and Ocean Topography (SWOT) swath\\u2010mapping radar altimetry satellite mission, launched in December 2022, provides repeat\\u2010track coverage to about \\u00b178.2\\u00b0 latitude every 21\\u00a0days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70310.field.aat.300054264",
+          "target_kind": "edge",
+          "target_sha256": "3454753a5337242de9c7d986cd8661b3addf0ba50bf6fe77ee01caf8c1acf184",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ijal-70310",
+            "target": "field.aat.300054264",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ijal-70310",
+                "url": "https://api.crossref.org/works/10.1111/ijal.70310"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"",
+          "scope": {
+            "population": "doi:10.1111/ijal.70310 abstract",
+            "time": "2026-07-17",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70310",
+              "source_sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
+              "start": 2524,
+              "end": 2789,
+              "quote": "The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI\\u2010mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-76901.concept.mesh.d001698",
+          "target_kind": "edge",
+          "target_sha256": "33d5bdf8cc2d08f0fb578677ea1762c1ba2aebe8a4eee124341801350c4e5c4c",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-adfm-76901",
+            "target": "concept.mesh.d001698",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-adfm-76901",
+                "url": "https://api.crossref.org/works/10.1002/adfm.76901"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"",
+          "scope": {
+            "population": "doi:10.1002/adfm.76901 abstract",
+            "time": "2026-07-17",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-adfm-76901",
+              "source_sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
+              "start": 3034,
+              "end": 3211,
+              "quote": "Collectively, these results highlight the potential of our approach as an implantable platform for bio\\u2010integrated computing and next\\u2010generation biomedical engineering."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-nzm2-70056.concept.usgs.1731",
+          "target_kind": "edge",
+          "target_sha256": "3ada4b65e3f13f0f937b48ca5db6c82c1179403cc0afb7c1f55dde8498914236",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-nzm2-70056",
+            "target": "concept.usgs.1731",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-nzm2-70056",
+                "url": "https://api.crossref.org/works/10.1002/nzm2.70056"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"",
+          "scope": {
+            "population": "doi:10.1002/nzm2.70056 abstract",
+            "time": "2026-07-16",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-nzm2-70056",
+              "source_sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
+              "start": 1641,
+              "end": 1874,
+              "quote": "We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-026.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "b9ba5ddccd19aa7016d970d727b6d5dc9b7bb39ed0e2d450c5c9d59715553c9a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1144-jgs2026-026",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1144-jgs2026-026",
+                "url": "https://api.crossref.org/works/10.1144/jgs2026-026"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"",
+          "scope": {
+            "population": "doi:10.1144/jgs2026-026 abstract",
+            "time": "2026-07-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1144-jgs2026-026",
+              "source_sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
+              "start": 1141,
+              "end": 1466,
+              "quote": "Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70766.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "fcbdce1b920f24264f2bef8aa6f195af401c6d3484357ace620a11887f12c5fa",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ejed-70766",
+            "target": "concept.mesh.d003906",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ejed-70766",
+                "url": "https://api.crossref.org/works/10.1111/ejed.70766"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"",
+          "scope": {
+            "population": "doi:10.1111/ejed.70766 abstract",
+            "time": "2026-07-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ejed-70766",
+              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+              "start": 1101,
+              "end": 1274,
+              "quote": "However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-sce-70090.concept.mesh.d000080562",
+          "target_kind": "edge",
+          "target_sha256": "16012ce64737f2436f2d6371cd35f39f43c8313b78d72327513f89f5fc1cd4df",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-sce-70090",
+            "target": "concept.mesh.d000080562",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-sce-70090",
+                "url": "https://api.crossref.org/works/10.1002/sce.70090"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"",
+          "scope": {
+            "population": "doi:10.1002/sce.70090 abstract",
+            "time": "2026-07-15",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-sce-70090",
+              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+              "start": 2829,
+              "end": 3086,
+              "quote": "Positive evidence was found for systematic instruction, mixed evidence for digital learning and self\\u2010directed learning, and insufficient but promising evidence for peer support, design\\u2010based engineering learning, and universal design for learning."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70053.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "9900a279402e35229a0da8d0d7f2b28f43339dfabe26c2d327359b75320000f5",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ppp-70053",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ppp-70053",
+                "url": "https://api.crossref.org/works/10.1002/ppp.70053"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"",
+          "scope": {
+            "population": "doi:10.1002/ppp.70053 abstract",
+            "time": "2026-07-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70053",
+              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+              "start": 1689,
+              "end": 2024,
+              "quote": "We used quasi\\u20103D electrical resistivity tomography (ERT) measurements, supported by UAV\\u2010LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome\\u2010shaped and plateau\\u2010shaped) within Sweden's largest coherent palsa complex, Viss\\u00e1tvuopmi."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70603.concept.eia.coal-mine",
+          "target_kind": "edge",
+          "target_sha256": "3863be4c8ca9e7ed520cac96a977f5671b15c9120ebf402e7067a61d36a14d56",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ese3-70603",
+            "target": "concept.eia.coal-mine",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ese3-70603",
+                "url": "https://api.crossref.org/works/10.1002/ese3.70603"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"",
+          "scope": {
+            "population": "doi:10.1002/ese3.70603 abstract",
+            "time": "2026-07-14",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70603",
+              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+              "start": 1604,
+              "end": 1781,
+              "quote": "Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd046190.concept.usgs.65",
+          "target_kind": "edge",
+          "target_sha256": "a81c4b93bb80875c32e4cb68c2eb7770bc026c11a1112abb33ca81c7a4cbb3c2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jd046190",
+            "target": "concept.usgs.65",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd046190",
+                "url": "https://api.crossref.org/works/10.1029/2025jd046190"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jd046190 abstract",
+            "time": "2026-07-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd046190",
+              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+              "start": 2235,
+              "end": 2429,
+              "quote": "In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121323.concept.usgs.93",
+          "target_kind": "edge",
+          "target_sha256": "8c6a0d96fd2ee03a46e32a995778115ab59ae1d4134496934663798b82352269",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025gl121323",
+            "target": "concept.usgs.93",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121323",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121323"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"",
+          "scope": {
+            "population": "doi:10.1029/2025gl121323 abstract",
+            "time": "2026-07-13",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121323",
+              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+              "start": 1800,
+              "end": 2006,
+              "quote": "The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ijfe-70259.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "ef4531c42eb774a730647f22f51fc69fb73fb0e839ac044ad9c1f15d6978d867",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ijfe-70259",
+            "target": "concept.mesh.d057217",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ijfe-70259",
+                "url": "https://api.crossref.org/works/10.1002/ijfe.70259"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"",
+          "scope": {
+            "population": "doi:10.1002/ijfe.70259 abstract",
+            "time": "2026-07-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
+              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+              "start": 1980,
+              "end": 2153,
+              "quote": "Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000696.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "e783179f541b5c3c5e8f04c8f1df63f088b40d521e4c80955ab28158cd2a1522",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1371-journal-pclm-0000696",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"",
+          "scope": {
+            "population": "doi:10.1371/journal.pclm.0000696 abstract",
+            "time": "2026-07-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+              "start": 932,
+              "end": 1045,
+              "quote": "Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-aphw-70185.concept.mesh.d000091682",
+          "target_kind": "edge",
+          "target_sha256": "30b5316591de380285c1fe3c44b88357f34ca5f4cbb582cf5b373f893435b0da",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-aphw-70185",
+            "target": "concept.mesh.d000091682",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-aphw-70185",
+                "url": "https://api.crossref.org/works/10.1111/aphw.70185"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"",
+          "scope": {
+            "population": "doi:10.1111/aphw.70185 abstract",
+            "time": "2026-07-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-aphw-70185",
+              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+              "start": 957,
+              "end": 1164,
+              "quote": "Community\\u2010based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001250.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "31f023290f2ba95152778204853b275360d8b26720aaba93e4a7aba4ebeb556a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026jh001250",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026jh001250",
+                "url": "https://api.crossref.org/works/10.1029/2026jh001250"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"",
+          "scope": {
+            "population": "doi:10.1029/2026jh001250 abstract",
+            "time": "2026-07-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026jh001250",
+              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+              "start": 1163,
+              "end": 1384,
+              "quote": "For estimating glacier MB, data\\u2010driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122518.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "e23b30c7bd2185fb0b659e2db19faf3ce0200478301455d6a02427fbf3940e9f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122518",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122518",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122518"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122518 abstract",
+            "time": "2026-07-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122518",
+              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+              "start": 1927,
+              "end": 2179,
+              "quote": "However, the impacts of realistic three\\u2010dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress\\u2010change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e172739.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "f7dd16ce59b926cd1bb8d06fb3bd37b33038949d2852fc0381863c8601208bab",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-brics-econ-7-e172739",
+            "target": "concept.mesh.d003906",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"",
+          "scope": {
+            "population": "doi:10.3897/brics-econ.7.e172739 abstract",
+            "time": "2026-07-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+              "start": 801,
+              "end": 903,
+              "quote": "This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70045.ology.geochronology",
+          "target_kind": "edge",
+          "target_sha256": "b470d645eb6aa2ad32f6441a01e1d37fdc168516d75e1d4a4e746017ba4b2109",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-jmg-70045",
+            "target": "ology.geochronology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jmg-70045",
+                "url": "https://api.crossref.org/works/10.1111/jmg.70045"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"",
+          "scope": {
+            "population": "doi:10.1111/jmg.70045 abstract",
+            "time": "2026-07-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jmg-70045",
+              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+              "start": 2261,
+              "end": 2516,
+              "quote": "In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P\\u2013T\\u2013t paths using phase equilibria modelling, melt reintegration and in\\u00a0situ U\\u2013Pb titanite geochronology."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70049.concept.usgs.1199",
+          "target_kind": "edge",
+          "target_sha256": "1d09b2a8fde228cf07762a4d90f796dfbe3df29e7f968f5f0704a525d3ee75ea",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ppp-70049",
+            "target": "concept.usgs.1199",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ppp-70049",
+                "url": "https://api.crossref.org/works/10.1002/ppp.70049"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"",
+          "scope": {
+            "population": "doi:10.1002/ppp.70049 abstract",
+            "time": "2026-07-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ppp-70049",
+              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+              "start": 1222,
+              "end": 1441,
+              "quote": "Robust information on the current state and short\\u2010 to mid\\u2010term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high\\u2010mountain regions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e162074.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "bdf0c8a46aede6e1ef7a381e7b93738729763b1a913a713125c041353d087e35",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-brics-econ-7-e162074",
+            "target": "concept.mesh.d006803",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+          "scope": {
+            "population": "doi:10.3897/brics-econ.7.e162074 abstract",
+            "time": "2026-07-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+              "start": 1212,
+              "end": 1322,
+              "quote": "The results reveal a stable long-term equilibrium between investment in human development and economic growth."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70289.concept.aat.300262706",
+          "target_kind": "edge",
+          "target_sha256": "a2398ef052807e35173c06311bf3cf55c5c8b041da1e21046802d8a01555cd18",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ijal-70289",
+            "target": "concept.aat.300262706",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ijal-70289",
+                "url": "https://api.crossref.org/works/10.1111/ijal.70289"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"",
+          "scope": {
+            "population": "doi:10.1111/ijal.70289 abstract",
+            "time": "2026-07-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ijal-70289",
+              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+              "start": 862,
+              "end": 1057,
+              "quote": "This study explored the ambivalence of final\\u2010year TESOL pre\\u2010service teachers towards a non\\u2010native\\u2010speaking (NNS) lecturer within a historically white South African university."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wpt-2026-383.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "2abb8a8626986197b06bc49d0bb8bef48295b14046495b780a1200ea70c88457",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wpt-2026-383",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wpt-2026-383",
+                "url": "https://api.crossref.org/works/10.2166/wpt.2026.383"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"",
+          "scope": {
+            "population": "doi:10.2166/wpt.2026.383 abstract",
+            "time": "2026-07-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
+              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+              "start": 1075,
+              "end": 1145,
+              "quote": "Climate change poses a major threat to water resources in West Africa."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-359.ology.hydrology",
+          "target_kind": "edge",
+          "target_sha256": "6d204342aacfe31e93adb6c08aeab160067eac39a6f2d313537e8b0bfe4be661",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wcc-2026-359",
+            "target": "ology.hydrology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-359",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.359"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"",
+          "scope": {
+            "population": "doi:10.2166/wcc.2026.359 abstract",
+            "time": "2026-07-01",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
+              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+              "start": 690,
+              "end": 809,
+              "quote": "Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-66630-sc-2026-0009.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "9e583578b5328c598c3f058ef1c173f32e6f2df7b21e79e104a4d50a26fc2dba",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-66630-sc-2026-0009",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-66630-sc-2026-0009",
+                "url": "https://api.crossref.org/works/10.66630/sc.2026.0009"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"",
+          "scope": {
+            "population": "doi:10.66630/sc.2026.0009 abstract",
+            "time": "2026-06-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
+              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+              "start": 1098,
+              "end": 1318,
+              "quote": "This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-59588-2961-3094-1247.field.aat.300054245",
+          "target_kind": "edge",
+          "target_sha256": "c0b1b30c8c314a0566cf8948c5d4cf7f0dd226986ca607427dc17e76b880fa16",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-59588-2961-3094-1247",
+            "target": "field.aat.300054245",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-59588-2961-3094-1247",
+                "url": "https://api.crossref.org/works/10.59588/2961-3094.1247"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"",
+          "scope": {
+            "population": "doi:10.59588/2961-3094.1247 abstract",
+            "time": "2026-06-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
+              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+              "start": 1019,
+              "end": 1374,
+              "quote": "The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2606.field.aat.300054254",
+          "target_kind": "edge",
+          "target_sha256": "916e012de468086bb33fdced7b20e93b8fa7c86d2407005b2701ba57c9b70c96",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-28918-jei-v11i1-2606",
+            "target": "field.aat.300054254",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"",
+          "scope": {
+            "population": "doi:10.28918/jei.v11i1.2606 abstract",
+            "time": "2026-06-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+              "start": 1304,
+              "end": 1388,
+              "quote": "The data were analyzed descriptively through Roland Barthes' mythological semiotics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2601.concept.mesh.d012941",
+          "target_kind": "edge",
+          "target_sha256": "0be107f194b016c8c37d70402214009a3163baf456d9843a74c666589f2aec83",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-28918-jei-v11i1-2601",
+            "target": "concept.mesh.d012941",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"",
+          "scope": {
+            "population": "doi:10.28918/jei.v11i1.2601 abstract",
+            "time": "2026-06-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+              "start": 2351,
+              "end": 2621,
+              "quote": "The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students\\u2019 Islamic identity, character formation, and social responsibility."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025wr041875.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "127fdb6e32bb72f5aadbb5934b84e3038fcfe0ea63e80ff0d03b94ce8c493633",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025wr041875",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025wr041875",
+                "url": "https://api.crossref.org/works/10.1029/2025wr041875"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"",
+          "scope": {
+            "population": "doi:10.1029/2025wr041875 abstract",
+            "time": "2026-06-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr041875",
+              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+              "start": 1594,
+              "end": 2020,
+              "quote": "Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm\\u2010scale Q. Here, we build on this work by adding two additional calibration constraints based on a long\\u2010term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-006.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "7b6abcdbf38434946b7530124cfecec3cc5e3dc440b5ecc7b020f8f198cd3a57",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-wcc-2026-006",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-wcc-2026-006",
+                "url": "https://api.crossref.org/works/10.2166/wcc.2026.006"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"",
+          "scope": {
+            "population": "doi:10.2166/wcc.2026.006 abstract",
+            "time": "2026-06-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
+              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+              "start": 688,
+              "end": 825,
+              "quote": "Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jb033060.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "c78ba9bbe4415aa9779e6d8709a32c302c0f94e5f48df97f7e3a9261df571d67",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jb033060",
+            "target": "field.usgs.1176",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jb033060",
+                "url": "https://api.crossref.org/works/10.1029/2025jb033060"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jb033060 abstract",
+            "time": "2026-06-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jb033060",
+              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+              "start": 2183,
+              "end": 2398,
+              "quote": "We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025ea004610.field.usgs.68",
+          "target_kind": "edge",
+          "target_sha256": "c0aaffd9374fbd38c166cb53c925891055c1b80713090808adc7ab88fd67558a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025ea004610",
+            "target": "field.usgs.68",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025ea004610",
+                "url": "https://api.crossref.org/works/10.1029/2025ea004610"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"",
+          "scope": {
+            "population": "doi:10.1029/2025ea004610 abstract",
+            "time": "2026-06-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025ea004610",
+              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+              "start": 1527,
+              "end": 1744,
+              "quote": "We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122157.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "0eb161ffb3e442b58145927d5cb36b8f85485ddd66b10d18a6ecbe9131dd0c91",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122157",
+            "target": "concept.usgs.1034",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122157",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122157"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122157 abstract",
+            "time": "2026-06-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122157",
+              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+              "start": 956,
+              "end": 1095,
+              "quote": "We present the first large\\u2010sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70096.field.navigation",
+          "target_kind": "edge",
+          "target_sha256": "ffaed2c1149b711fffb46eeb1216517acbd90e9558470c7819cdf8c9e485cdbd",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-esp4-70096",
+            "target": "field.navigation",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-esp4-70096",
+                "url": "https://api.crossref.org/works/10.1002/esp4.70096"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"",
+          "scope": {
+            "population": "doi:10.1002/esp4.70096 abstract",
+            "time": "2026-06-25",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70096",
+              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+              "start": 863,
+              "end": 1105,
+              "quote": "Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-bioe-70124.field.mesh.d026690",
+          "target_kind": "edge",
+          "target_sha256": "8439c6d99a8732c062ad31e55f0dc6cba18a704c35f6f7c61e74dceb405ef675",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-bioe-70124",
+            "target": "field.mesh.d026690",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-bioe-70124",
+                "url": "https://api.crossref.org/works/10.1111/bioe.70124"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"",
+          "scope": {
+            "population": "doi:10.1111/bioe.70124 abstract",
+            "time": "2026-06-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-bioe-70124",
+              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+              "start": 1225,
+              "end": 1403,
+              "quote": "We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data\\u2010intensive medical innovations."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-adom-71396.field.mesh.d044085",
+          "target_kind": "edge",
+          "target_sha256": "5fd9f4b6f06c961306fb7d4c8d32df101aa5da7466e73a2dca276168b93294cd",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-adom-71396",
+            "target": "field.mesh.d044085",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-adom-71396",
+                "url": "https://api.crossref.org/works/10.1002/adom.71396"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+          "scope": {
+            "population": "doi:10.1002/adom.71396 abstract",
+            "time": "2026-06-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-adom-71396",
+              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+              "start": 1885,
+              "end": 2133,
+              "quote": "The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70586.concept.eia.air-collector",
+          "target_kind": "edge",
+          "target_sha256": "d4736bd0c4e97941abcc96d00793bd4e018d89b3be2ebd63bd6343f6922d2e19",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-ese3-70586",
+            "target": "concept.eia.air-collector",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-ese3-70586",
+                "url": "https://api.crossref.org/works/10.1002/ese3.70586"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"",
+          "scope": {
+            "population": "doi:10.1002/ese3.70586 abstract",
+            "time": "2026-06-23",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-ese3-70586",
+              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+              "start": 1101,
+              "end": 1279,
+              "quote": "Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-039.ology.stratigraphy",
+          "target_kind": "edge",
+          "target_sha256": "6d6a631194a4c58ed849a3cafc47ed7e2a7d3339435fa5dfb19ed901b8883d62",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1144-jgs2026-039",
+            "target": "ology.stratigraphy",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1144-jgs2026-039",
+                "url": "https://api.crossref.org/works/10.1144/jgs2026-039"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+          "scope": {
+            "population": "doi:10.1144/jgs2026-039 abstract",
+            "time": "2026-06-22",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
+              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+              "start": 2040,
+              "end": 2167,
+              "quote": "We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-hec-70120.concept.mesh.d057185",
+          "target_kind": "edge",
+          "target_sha256": "bd8d87880c3050bd1b58d85aba0cf8ed7b269e41317d636cbabef39dcba7332b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-hec-70120",
+            "target": "concept.mesh.d057185",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-hec-70120",
+                "url": "https://api.crossref.org/works/10.1002/hec.70120"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"",
+          "scope": {
+            "population": "doi:10.1002/hec.70120 abstract",
+            "time": "2026-06-22",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-hec-70120",
+              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+              "start": 2086,
+              "end": 2214,
+              "quote": "T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9477-70049.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "1cf9cbaa2da8bcb70dda42618312a76ce3550929db788282de4de5c0e0b30148",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-1467-9477-70049",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-1467-9477-70049",
+                "url": "https://api.crossref.org/works/10.1111/1467-9477.70049"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+          "scope": {
+            "population": "doi:10.1111/1467-9477.70049 abstract",
+            "time": "2026-06-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
+              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+              "start": 2081,
+              "end": 2414,
+              "quote": "We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-faam-70045.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "4d67ee429c042a8827479934aeca2ce406bf180edbefab9878249d4ee5e380b9",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-faam-70045",
+            "target": "concept.mesh.d003906",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-faam-70045",
+                "url": "https://api.crossref.org/works/10.1111/faam.70045"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"",
+          "scope": {
+            "population": "doi:10.1111/faam.70045 abstract",
+            "time": "2026-06-20",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-faam-70045",
+              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+              "start": 1216,
+              "end": 1510,
+              "quote": "However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as \\u201cunprincipled principals,\\u201d limiting citizens\\u2019 ability to hold them to account and exercising informal political control over bureaucracies."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-58491-2735-4202-3413.concept.eia.leading-edge",
+          "target_kind": "edge",
+          "target_sha256": "bd4d11377ccd6185c601c0b1836776bca0e9f373cdf77b91b6323139057754b5",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-58491-2735-4202-3413",
+            "target": "concept.eia.leading-edge",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-58491-2735-4202-3413",
+                "url": "https://api.crossref.org/works/10.58491/2735-4202.3413"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"",
+          "scope": {
+            "population": "doi:10.58491/2735-4202.3413 abstract",
+            "time": "2026-06-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
+              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+              "start": 861,
+              "end": 1036,
+              "quote": "In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121378.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "d6e676a4e791093ba60fe5c1d0072aac62c14f2b477c8da4aae866986be0ef69",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025gl121378",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121378",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121378"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"",
+          "scope": {
+            "population": "doi:10.1029/2025gl121378 abstract",
+            "time": "2026-06-16",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121378",
+              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+              "start": 1605,
+              "end": 1846,
+              "quote": "Seismic velocity changes (dv\\/v) at 2\\u20134\\u00a0Hz and 4\\u20138\\u00a0Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-56403-nejesh-v5i2-421.field.aat.300054280",
+          "target_kind": "edge",
+          "target_sha256": "66d313cca7f2bb483848de80ea3bc7f571b700d1f631817575a56e0be1be6ec1",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-56403-nejesh-v5i2-421",
+            "target": "field.aat.300054280",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+                "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+          "scope": {
+            "population": "doi:10.56403/nejesh.v5i2.421 abstract",
+            "time": "2026-06-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+              "start": 1118,
+              "end": 1329,
+              "quote": "The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123355.concept.usgs.677",
+          "target_kind": "edge",
+          "target_sha256": "36fb44841b47eb8a5ba87651b67c8730535ec6d9f8bf9ea4331dcd994eb07dbf",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl123355",
+            "target": "concept.usgs.677",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl123355",
+                "url": "https://api.crossref.org/works/10.1029/2026gl123355"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl123355 abstract",
+            "time": "2026-06-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl123355",
+              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+              "start": 2538,
+              "end": 2705,
+              "quote": "In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121171.concept.usgs.2277",
+          "target_kind": "edge",
+          "target_sha256": "f767a8496500b340407b3f4a561a760fada083a5dbe32a371e436dae330ae8b7",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025gl121171",
+            "target": "concept.usgs.2277",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gl121171",
+                "url": "https://api.crossref.org/works/10.1029/2025gl121171"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"",
+          "scope": {
+            "population": "doi:10.1029/2025gl121171 abstract",
+            "time": "2026-06-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gl121171",
+              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+              "start": 1386,
+              "end": 1472,
+              "quote": "), influence terrestrial carbon flux estimates within an atmospheric inversion system."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd044617.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "5ff90558ecd44c62b94d62acdb1dd66b4520eb8c7ed555f332c67fc406cd5764",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jd044617",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd044617",
+                "url": "https://api.crossref.org/works/10.1029/2025jd044617"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jd044617 abstract",
+            "time": "2026-06-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd044617",
+              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+              "start": 1918,
+              "end": 2091,
+              "quote": "We examined the simulated local and remote influences of sea\\u2010surface temperature (SST) and soil moisture depletion during the development of the 2020\\u20132021 drought."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-22378-he-2026-11-2-218-234.field.mesh.d049691",
+          "target_kind": "edge",
+          "target_sha256": "0a270f4126c52c25ad67c5c5a5397d38bc6c8beba1634f15bd40ef0752beb0e5",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+            "target": "field.mesh.d049691",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+                "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"",
+          "scope": {
+            "population": "doi:10.22378/he.2026-11-2.218-234 abstract",
+            "time": "2026-06-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+              "start": 1762,
+              "end": 2180,
+              "quote": "Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045718.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "81bf4b593e62bf06f23f54659c55a2a4a7010e3a615b1e0b01891c229aaf30e0",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jd045718",
+            "target": "field.climatology",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd045718",
+                "url": "https://api.crossref.org/works/10.1029/2025jd045718"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jd045718 abstract",
+            "time": "2026-06-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045718",
+              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+              "start": 2166,
+              "end": 2352,
+              "quote": "The area\\u2010averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122664.field.usgs.1678",
+          "target_kind": "edge",
+          "target_sha256": "02c99f468d924805d5a015f973306559f6f9a4e597b5bfe4b1753ddcb644131c",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2026gl122664",
+            "target": "field.usgs.1678",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2026gl122664",
+                "url": "https://api.crossref.org/works/10.1029/2026gl122664"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"",
+          "scope": {
+            "population": "doi:10.1029/2026gl122664 abstract",
+            "time": "2026-06-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2026gl122664",
+              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+              "start": 1596,
+              "end": 1716,
+              "quote": "Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial\\u2010lacustrine connectivity."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70022.concept.aat.300016586",
+          "target_kind": "edge",
+          "target_sha256": "fe1caf92a5042aa1bbe148f4c4e5b82dbcb25468e13edff408626716d6342d5f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ojoa-70022",
+            "target": "concept.aat.300016586",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ojoa-70022",
+                "url": "https://api.crossref.org/works/10.1111/ojoa.70022"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"",
+          "scope": {
+            "population": "doi:10.1111/ojoa.70022 abstract",
+            "time": "2026-06-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
+              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+              "start": 1813,
+              "end": 2010,
+              "quote": "In parallel, the study traces initial Italic olive\\u2010oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045965.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "6c4c9063897ae6a898b141a7cee6e0fd38f3ec532b45563372607dec7f9e6f46",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025jd045965",
+            "target": "concept.usgs.64",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025jd045965",
+                "url": "https://api.crossref.org/works/10.1029/2025jd045965"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"",
+          "scope": {
+            "population": "doi:10.1029/2025jd045965 abstract",
+            "time": "2026-06-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025jd045965",
+              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+              "start": 1502,
+              "end": 1677,
+              "quote": "The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-jssr-70066.concept.mesh.d033303",
+          "target_kind": "edge",
+          "target_sha256": "3e5976917c5b790368d1d974a27f09d3cbf1a25df85337389fba3ad8dcdbdfae",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-jssr-70066",
+            "target": "concept.mesh.d033303",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-jssr-70066",
+                "url": "https://api.crossref.org/works/10.1111/jssr.70066"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"",
+          "scope": {
+            "population": "doi:10.1111/jssr.70066 abstract",
+            "time": "2026-05-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-jssr-70066",
+              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+              "start": 1580,
+              "end": 1779,
+              "quote": "After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025wr042846.concept.usgs.1298",
+          "target_kind": "edge",
+          "target_sha256": "7c64ab102e2304ef497beb71c4b095efc3af1ece01aea65af08f0bdae44df2aa",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025wr042846",
+            "target": "concept.usgs.1298",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025wr042846",
+                "url": "https://api.crossref.org/works/10.1029/2025wr042846"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"",
+          "scope": {
+            "population": "doi:10.1029/2025wr042846 abstract",
+            "time": "2026-05-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025wr042846",
+              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+              "start": 3351,
+              "end": 3583,
+              "quote": "C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-jbgs-e185535.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "48286c10a085c1e1a41c8a7789715e82866bebb61935da0d5299d6599c1d3bf2",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-jbgs-e185535",
+            "target": "concept.usgs.1034",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-jbgs-e185535",
+                "url": "https://api.crossref.org/works/10.3897/jbgs.e185535"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"",
+          "scope": {
+            "population": "doi:10.3897/jbgs.e185535 abstract",
+            "time": "2026-05-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
+              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+              "start": 594,
+              "end": 809,
+              "quote": "Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70082.ology.stratigraphy",
+          "target_kind": "edge",
+          "target_sha256": "9136b4d300f08beb1d489ccc8eebbd2ffbd214562355dd5a70ce12d84a0e3a42",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-esp4-70082",
+            "target": "ology.stratigraphy",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-esp4-70082",
+                "url": "https://api.crossref.org/works/10.1002/esp4.70082"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"",
+          "scope": {
+            "population": "doi:10.1002/esp4.70082 abstract",
+            "time": "2026-05-29",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-esp4-70082",
+              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+              "start": 1528,
+              "end": 1713,
+              "quote": "Simulated surface\\u2010to\\u2010borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-184711.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "80e19af92bd242dbbf60ad386fc52424d0b30502bb187f314ca416e678725c7f",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-3897-nhcm-3-184711",
+            "target": "field.mesh.d019021",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-3897-nhcm-3-184711",
+                "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"",
+          "scope": {
+            "population": "doi:10.3897/nhcm.3.184711 abstract",
+            "time": "2026-05-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
+              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+              "start": 1141,
+              "end": 1415,
+              "quote": "In this study, we compile and consolidate all available data on the herpetofauna of S\\u00e3o Tom\\u00e9 &amp; Pr\\u00edncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gc012776.concept.usgs.562",
+          "target_kind": "edge",
+          "target_sha256": "b89f637ce4d43910084e45cdb864a4b8106ad8cf50bbb2189d7e3797874362db",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1029-2025gc012776",
+            "target": "concept.usgs.562",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1029-2025gc012776",
+                "url": "https://api.crossref.org/works/10.1029/2025gc012776"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"",
+          "scope": {
+            "population": "doi:10.1029/2025gc012776 abstract",
+            "time": "2026-05-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1029-2025gc012776",
+              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+              "start": 2498,
+              "end": 2814,
+              "quote": "This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc\\u2010backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70436.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "59b83d6fa078d5e53746bca6919a52e4e4d4f4c818c80fe94e80c0d053720860",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1002-joc-70436",
+            "target": "concept.usgs.1308",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1002-joc-70436",
+                "url": "https://api.crossref.org/works/10.1002/joc.70436"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"",
+          "scope": {
+            "population": "doi:10.1002/joc.70436 abstract",
+            "time": "2026-05-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1002-joc-70436",
+              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+              "start": 2586,
+              "end": 2733,
+              "quote": "Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-191.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "cb78de2c5c59b64a639be3807d30dc8db002e5c4585648d8fda386878813ea3b",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-2166-hydro-2026-191",
+            "target": "concept.usgs.2027",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-2166-hydro-2026-191",
+                "url": "https://api.crossref.org/works/10.2166/hydro.2026.191"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"",
+          "scope": {
+            "population": "doi:10.2166/hydro.2026.191 abstract",
+            "time": "2026-05-23",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
+              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+              "start": 690,
+              "end": 830,
+              "quote": "Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70020.concept.aat.300019275",
+          "target_kind": "edge",
+          "target_sha256": "faacbfc608af0c619ee3a7e31fa779eda86d9156d8a8c4c07ecd4b3919680be1",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-ojoa-70020",
+            "target": "concept.aat.300019275",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-ojoa-70020",
+                "url": "https://api.crossref.org/works/10.1111/ojoa.70020"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"",
+          "scope": {
+            "population": "doi:10.1111/ojoa.70020 abstract",
+            "time": "2026-05-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
+              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+              "start": 905,
+              "end": 1036,
+              "quote": "During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia."
+            }
+          ]
+        },
+        {
+          "id": "assertion.edge.claim.frontier.doi-10-1111-phpr-70116.field.aat.300054245",
+          "target_kind": "edge",
+          "target_sha256": "f90b2271ec0cc36862ffdac2e4fcc49642970d725c3b22a9bbdd1232e9f0cd1a",
+          "canonical_record": {
+            "source": "claim.frontier.doi-10-1111-phpr-70116",
+            "target": "field.aat.300054245",
+            "type": "related",
+            "summary": "The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.doi-10-1111-phpr-70116",
+                "url": "https://api.crossref.org/works/10.1111/phpr.70116"
+              }
+            ]
+          },
+          "statement": "The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"",
+          "scope": {
+            "population": "doi:10.1111/phpr.70116 abstract",
+            "time": "2026-05-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.doi-10-1111-phpr-70116",
+              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+              "start": 1165,
+              "end": 1287,
+              "quote": "This article argues that we can best address these questions about function by attending to work in empirical linguistics."
+            }
+          ]
+        }
+      ],
+      "decisions": [
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ecot-70052",
+          "target_kind": "node",
+          "target_sha256": "c899742980882616404009a6abec94408aca042dd1f705b2bc1e086745fd64fd",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.358939+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70333",
+          "target_kind": "node",
+          "target_sha256": "0d872817b56073a0487518b3bc1ce9d91303a7a2b95c379f932c4b829e96d01c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pwat-0000557",
+          "target_kind": "node",
+          "target_sha256": "acfd84fb6f4873de8802a73f2217016c75d4c458af05a657ce165e0cbc4a3e69",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-medu-70340",
+          "target_kind": "node",
+          "target_sha256": "bb1ad60f76ca539f0eaddce73315fda163fc3cbd2a166cf3283d6f6ea6f0ff96",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124622",
+          "target_kind": "node",
+          "target_sha256": "54435a5873a0dae64e7d1d0aebed146e0326f931218584537aa411be511d4864",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-15351-2373-8456-1235",
+          "target_kind": "node",
+          "target_sha256": "8a4aee6e2d44b62fa0465aa821d46866d28889942e6aed85c22555321eacd664",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-15351-2373-8456-1216",
+          "target_kind": "node",
+          "target_sha256": "40afce297647ad12205133127c3319b158fd1df3ee3886e812a0ea0efe63d9fa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl125301",
+          "target_kind": "node",
+          "target_sha256": "d19887697cf45eb1d4573ba253ec980e43f5eed329f166e5b1327be08d2d11cb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-21425-fob-19-142560",
+          "target_kind": "node",
+          "target_sha256": "cf17d8f389e5875801d8f5cf2ce79502a98179aa447f0df28b5ed7b1e5ebf093",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001044",
+          "target_kind": "node",
+          "target_sha256": "f020444798aafbba9657c13abf36e5e7c1c64342c3f6d77e5c0abff16072a051",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000886",
+          "target_kind": "node",
+          "target_sha256": "c9838c9666550a04a54d9f52056b1f085e9469af4b418c7c39cfdcf3e95f80c2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1075-consl-25020-lia",
+          "target_kind": "node",
+          "target_sha256": "cb466f2887c76ab0f65c645be4f04d8d5628017f8509b150fa17e138dd5c1e4d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-hydro-2026-040",
+          "target_kind": "node",
+          "target_sha256": "b1d5eb93f830b9db9de13c37903d40a49fd2241fcc77b157811712804ad5c3ac",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-lol2-70186",
+          "target_kind": "node",
+          "target_sha256": "ed4a7c3ee5de681986a3ae5f899173ec642ef8662f832b596144e7ccf408e1e3",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124411",
+          "target_kind": "node",
+          "target_sha256": "4cd1070aee40475dd6d06e6ab0fadb7be7d587e75c98038196ec75776733f3e7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70629",
+          "target_kind": "node",
+          "target_sha256": "07388bfa91d146b7ee6a7175ac28f177abcbe1486d17a5754798edda9c6f9c13",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9566-70277",
+          "target_kind": "node",
+          "target_sha256": "8b84360c3005120ef6218b79707ddae1550335e913b7e5f1c386fce38285274a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-jpln-70129",
+          "target_kind": "node",
+          "target_sha256": "3f5813936443ab3880eb08ee6845a959024d90004dd31b164dccb6450ad90ca1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70613",
+          "target_kind": "node",
+          "target_sha256": "5ae2bb018f8d4930b105adbef2018ddeb2c471bb66c6a7454e3f0ae271790bab",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70605",
+          "target_kind": "node",
+          "target_sha256": "f969e55d7c3e65b0676f9835895931ab3d6471800d5488f68cb1597f9fb7117b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3176-arch-2026-2-03",
+          "target_kind": "node",
+          "target_sha256": "2495efad9f9a77db5bf334eea5bd7e3697fddf6aee3e0bae571c91368a1a9e7c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-580",
+          "target_kind": "node",
+          "target_sha256": "a2f38d5d973db76df05f11e9a92569f1f8c2a4aa4275eab073df4cfc645305b6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ijop-70275",
+          "target_kind": "node",
+          "target_sha256": "8e9f43b3daab1bb74b6712f04d7c38700f3040e429d218368d71b9c931568a53",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-popecon-10-e186220",
+          "target_kind": "node",
+          "target_sha256": "03dfad1db21ae9317989100b6d225ff2460bb5e9cb429523270d194fa91a7925",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-507",
+          "target_kind": "node",
+          "target_sha256": "150fad11eb2e58a265d6665b1f952ef191f154aa3847e5e54c38454da52997cc",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e183393",
+          "target_kind": "node",
+          "target_sha256": "458f34a98afbe1278fb0922f2f52872afd9354a4432e893b2bfd2c2c18a63cc1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026785",
+          "target_kind": "node",
+          "target_sha256": "aeb97dadafba774c077aa5a3d076f944d7fed8e7a8641eb17d04508753123883",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124090",
+          "target_kind": "node",
+          "target_sha256": "ff8032e649311f9d6684fed35770e8d72d39748fdd2007c2a4447279d30f7694",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-pei3-70207",
+          "target_kind": "node",
+          "target_sha256": "f6d7126485d10cb3fbc702ba0aba310b5fcc9fa3b8bfceef62d1ab470ecf9015",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-fea2-70077",
+          "target_kind": "node",
+          "target_sha256": "00a3f58f94358f52d1e397868c353d4f68fc570c98987e0769690dc1bc93bf0d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-eet-70146",
+          "target_kind": "node",
+          "target_sha256": "89ca0ddd58ec8af408cc3a57606875c8d864099fc124cd4e52120fa7daba6e69",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-eco-70279",
+          "target_kind": "node",
+          "target_sha256": "23af879371e74778a932bdcf86a5fcdae9a05278f15e12a59bdad6a33129bc75",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124233",
+          "target_kind": "node",
+          "target_sha256": "c990db21bb02ac6e1f64fbb7c329e9c84dd0175e1b37292bfaffe5bd873886dd",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gc013127",
+          "target_kind": "node",
+          "target_sha256": "df6bf646bb406fc1b577ed3edf05d6bea2c933a7385138811808492a8c675c3c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70320",
+          "target_kind": "node",
+          "target_sha256": "5f923eb3d0e3c0730ba2550114be65407656d8a42918dfb55a22e1d9b2ccf8eb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01",
+          "target_kind": "node",
+          "target_sha256": "6e2955f97e76639fbd05e444881a97014480f5ef5a67398572dc2150383e1ee6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-erats-20261281",
+          "target_kind": "node",
+          "target_sha256": "a073a252ea3c9d4507d0d7f9530801416fe69b7dab0e22f6dafc4730cd13a867",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-eco-70277",
+          "target_kind": "node",
+          "target_sha256": "932d496ffc8bba319734c20d8eb9e41e733da81a9ae1d43dec6405e09d5dbdc7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-iroh-70046",
+          "target_kind": "node",
+          "target_sha256": "fb87d188bb97aa410ae1b72a1aded942e7039c590781b39f5497fc8be7f0d390",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-erats-20261284",
+          "target_kind": "node",
+          "target_sha256": "15126bb3d4b80e72fb46ff22060bdca616c4bc847566be7945e5ab1c88619af3",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ruso-70070",
+          "target_kind": "node",
+          "target_sha256": "746a1fc813452f4bc12e782e380e8cb1e83267ca7592751d3276202a85c343dd",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-200681",
+          "target_kind": "node",
+          "target_sha256": "a4c954c03c3dc0424d87d0f8b842eff9fc895bef3f503ddb3beb01736694d49b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001005",
+          "target_kind": "node",
+          "target_sha256": "22c95cb1e3ffd0ece2d730ec4a4bfd8b35f8d1250ef94abce79123983e19f32b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-moth-70148",
+          "target_kind": "node",
+          "target_sha256": "59a080cf2527877e5c33e0b5a87ee37803dbac66af884c55be3b875773bb2066",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-20267724",
+          "target_kind": "node",
+          "target_sha256": "413fb72410ec625ca9ca098fe999385c3c9624ba042c7845822e788da8fcb41d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124881",
+          "target_kind": "node",
+          "target_sha256": "0e805f7ff2cf9b4e84fc48accb8792ba130588942398377add6a0f1421798a2d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jh001578",
+          "target_kind": "node",
+          "target_sha256": "6139790797c0d1ae8499bfc6f7b9bc51463294b1600010c991c30d6cdecc8204",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-gdj3-70104",
+          "target_kind": "node",
+          "target_sha256": "0ea9efcdb5d7f7cae91f70c5f75b9ea3cf67c1a8ef09518e933f4175c15a0973",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122610",
+          "target_kind": "node",
+          "target_sha256": "27aacbd05e369f29387cd7a2e4eea82b687c2a65ed4b89232758ab785d137863",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70308",
+          "target_kind": "node",
+          "target_sha256": "0fa42e72c19a4c09d0231d49d041f0b7ae1cd295ff1f5960b6fc6736461d54c2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-55730-1300-0632-4281",
+          "target_kind": "node",
+          "target_sha256": "1021403cc9e13bde2e0326d54d3fe51e56aeae42a0ee408feaed5809172cc998",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-55730-1300-0632-4275",
+          "target_kind": "node",
+          "target_sha256": "4a8892407dae357550fbfdbd86a9e01ae61c3705d15da7e7c42abd73cd2f0ad4",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-eet-70139",
+          "target_kind": "node",
+          "target_sha256": "e42f5af90a591ea76fd929813fb2a101f6b708a61553844e4d425148719ef4e8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-jclp-70212",
+          "target_kind": "node",
+          "target_sha256": "47d977b3ddf6d692aaf1d2aa0d195cdd39520a1994076a85336d4daeffbec240",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-12944-cwe-21-2-3",
+          "target_kind": "node",
+          "target_sha256": "946573dec97981d8f200d79bdffcda3a25c83c8d70b786bfa1e6081090c36178",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-bse-71470",
+          "target_kind": "node",
+          "target_sha256": "99f8f40d2f518f635ee207ed4e3fba7f4588b9070378efd9f377833a5cf7daba",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000986",
+          "target_kind": "node",
+          "target_sha256": "05cae79791020ebe011272a629f57fadd9175883f2f54963e1851e140c2fde7e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-1752-1688-70151",
+          "target_kind": "node",
+          "target_sha256": "7813c951684e4468892f37bc30c7bcde11e8f6c335ae6ff6c22e74ee2ca96f9e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-jade-70048",
+          "target_kind": "node",
+          "target_sha256": "709b81bab1516c34a8944c0aceacb59f4abf8b6aba2d6b5e258558ffa0709287",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-lcrp-70059",
+          "target_kind": "node",
+          "target_sha256": "8a2d4bb62d0d43292879ca744d344b526c57050d5ea1c9fe4fade2b00167deda",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-77938",
+          "target_kind": "node",
+          "target_sha256": "ecbe1c0119aa9beb49bb472fc414e94a9232147524a41f685b61df459d57f266",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e185197",
+          "target_kind": "node",
+          "target_sha256": "97eab97ad1625a070380fca8217d3192b4737f1f7eb018a5e4a780691e00db9f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl125327",
+          "target_kind": "node",
+          "target_sha256": "f67886ee0901f383640fdc6af4bd815f1a88f81b0adfb7291f11b96fb8eb2b13",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70302",
+          "target_kind": "node",
+          "target_sha256": "a5daec029c63e95a1c3f0a85b4676dcac7ad1366bb714d865261bc3cc1af294c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000930",
+          "target_kind": "node",
+          "target_sha256": "4391670001d55393deb190b39b125c10a5d03a4c148885c1713016e1de39eed9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsnr-2026-0030",
+          "target_kind": "node",
+          "target_sha256": "2ff5646876dd7cf0504f4ee7aa5df12a5827f0108f5ed6bd8022022f0fde215d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-cli2-70062",
+          "target_kind": "node",
+          "target_sha256": "97b20c7b152e3c3498f9307f9cd70cc4fc781535496db6ca824273d0640507d8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
+          "target_kind": "node",
+          "target_sha256": "167968c5487a3a2d63809c9215eca013a58046b5c50a978e376a64e79cddbc11",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70852",
+          "target_kind": "node",
+          "target_sha256": "b3b4981ebf949347576690949e4efd1d5542f13e78b7c6e4065e519cc15b6b3d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70845",
+          "target_kind": "node",
+          "target_sha256": "0459d52dae6202048453674e7539748a055598fb81529c684a178d4d2db99f99",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001039",
+          "target_kind": "node",
+          "target_sha256": "1797f28da9e635c78885a5292ba375fd9b05fa57bec163eeb7ad582da96e5b7f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-nup-70114",
+          "target_kind": "node",
+          "target_sha256": "39e7e583ad91c899535afc9090d9e424881b8963e31f8aa53980c2f4542a5382",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejss-70414",
+          "target_kind": "node",
+          "target_sha256": "8eef2c4640458267cf61bf03f9e388380f4ae6e0dd4347de4b3f94c80ab7de3f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026wr044293",
+          "target_kind": "node",
+          "target_sha256": "1e49be6aa2ba28ac291c0db268f9d900f4aeac4652b5dcf0eb6f819b84d3629a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp-70399",
+          "target_kind": "node",
+          "target_sha256": "d276aea75a93573515ec73a9f1bb8b483caa5dd00dae4490ab112c7a2edaee3f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-jqs-70108",
+          "target_kind": "node",
+          "target_sha256": "03f0b2421318c13287ed8b988e030e79730a9d2f7b6f57b7d4f7be42f609ec38",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jd046723",
+          "target_kind": "node",
+          "target_sha256": "2aafd4fd3b0ca6a291ba91ec36a3cc652e3de78e1953febae44e5d2c5135d560",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-msd2-70089",
+          "target_kind": "node",
+          "target_sha256": "ff896932e901389d4c8cf6a95c5346b4586402514c2f4df84fa7968efe070f7f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70342",
+          "target_kind": "node",
+          "target_sha256": "5283976eb7325f6d975165df6ee495c112422ee0887368d701ca64f3c5add006",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-cli2-70059",
+          "target_kind": "node",
+          "target_sha256": "e1b471abf38ce27c8149ecb1e4569ed4ca277c53e045fa673b318e0f628a27f9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124727",
+          "target_kind": "node",
+          "target_sha256": "ccfb2a129ee24b3a6489612d9b84d81407c90375f31b065a6dee4a3e0227a471",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000877",
+          "target_kind": "node",
+          "target_sha256": "26e943260c3bb22a338102bf11c4c229e76b1d019299973bff0eda218edaaa59",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-jmg-70054",
+          "target_kind": "node",
+          "target_sha256": "ab0ca5c7d8215f36b3f96d07add1bff628181ad03380f3da260c5990532d5b1a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-moth-70134",
+          "target_kind": "node",
+          "target_sha256": "e00e11ab51837f0489465957e0e78c86c32bfb903c7034ba5b478ce4610c693b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-gwat-70098",
+          "target_kind": "node",
+          "target_sha256": "e2ffb61f8a859e8fd1c96ac98ba01be951bdbd3b4599753effa3c1d768cc8997",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wp-2026-018",
+          "target_kind": "node",
+          "target_sha256": "616e659f6173f6f9e1ee396a74524d5cda67304b01ed57a91f6c2cdf8cbfc3fa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsta-2025-0107",
+          "target_kind": "node",
+          "target_sha256": "5ba11b8db55e335857acd07bc179ac0daf52cde3500ebe8524756b4dd5d7fcea",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000931",
+          "target_kind": "node",
+          "target_sha256": "f074240df47721dc6bfbdc383c4ece688c9bd5dbf3a76847bc4e637d043b6408",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122646",
+          "target_kind": "node",
+          "target_sha256": "fadfbea70e81d9bc9708a79769da09a9a6afc6c1acf07dc54498420e51a2759f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70058",
+          "target_kind": "node",
+          "target_sha256": "7d164c252922852307aecf82cdf3d51384bbd769b8656def08e486f5e3fa01f6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-jpln-70107",
+          "target_kind": "node",
+          "target_sha256": "7caec28a5f79904fabf4c5acb9a7e00d8efc698de019e19b5f0672048665f6b1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-187529",
+          "target_kind": "node",
+          "target_sha256": "f995881565f05db0b212c013e45536465d5c82362c442a2a37f9b5c553d65459",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026775",
+          "target_kind": "node",
+          "target_sha256": "77d8fd44d1d49ddc371b70a5e78fd7f56fd6e50f44b0074910bab18bc99cf9eb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026774",
+          "target_kind": "node",
+          "target_sha256": "d6f10658405d185f8e1681f66c1e1593e6be20e81f983de94605620f57a82977",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-hec-70140",
+          "target_kind": "node",
+          "target_sha256": "362c8742b04f7b46ac64a409263ac52f8d2510ccab52e734c440a20b65d50781",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-tox-70177",
+          "target_kind": "node",
+          "target_sha256": "91b5eba28359f7aee9e6a4a07e2f1450da71689334ace373f0ec6a8bf1de7e61",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-77585",
+          "target_kind": "node",
+          "target_sha256": "9ad0029131f34b9ceaa77f3a8f33ab62e9a216dad09469f2708c7bbe5db7f51b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9566-70245",
+          "target_kind": "node",
+          "target_sha256": "c5cf402730750a47a7a770312509f9b93a556d2c14e47636d91809efc715bb7e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70337",
+          "target_kind": "node",
+          "target_sha256": "b9767987c6cf8eb732a1e22870bbd60b688b5ea2d37c1c2d4aaeb6a4e403ae27",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl123821",
+          "target_kind": "node",
+          "target_sha256": "7dbc92b200702547607024be1de7289f698d5298da3a9d788be3946ac22d3c7c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70252",
+          "target_kind": "node",
+          "target_sha256": "0d2ec90d7c004965336849e7dc4a9cca620c05fb97297819be281f3398bd44c3",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70540",
+          "target_kind": "node",
+          "target_sha256": "d876068aefa7381aa2f986142c22efcbafe2993bbbf4713b88261bc077c983d8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-eje-70266",
+          "target_kind": "node",
+          "target_sha256": "886110cc7d95f58e26c930ac1620956e8bbdb97b1d6e95fd32272d8079037f9e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ecpo-70064",
+          "target_kind": "node",
+          "target_sha256": "5c628e321072d92bdddb037299368d574089a8d7b72ec2196ef5dd56a257863e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-beer-70139",
+          "target_kind": "node",
+          "target_sha256": "91fb84abd87d634139d456232d28bb71e3a86475bb7f25045429ddad58f58980",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsta-2025-0029",
+          "target_kind": "node",
+          "target_sha256": "af8ac57849b011cf7ad6e60ef5b4f7f43180db05f33d14383df76270acf25e10",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124661",
+          "target_kind": "node",
+          "target_sha256": "120d5021d1bf0c3ec0ee755ea9a89d44105671c38b4d7733c01a4e1bb93fc16f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jc023581",
+          "target_kind": "node",
+          "target_sha256": "297c72011a9be269947e359261441d96b665b9afac0cc13f4b710a1272afc2f5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jb032632",
+          "target_kind": "node",
+          "target_sha256": "9f96cf8c93c7db4cb362f8cde4c9b887b6f5cd22c7b9a7255263f2d6a9def062",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70526",
+          "target_kind": "node",
+          "target_sha256": "386007d2450ca9b0bf6898dede90d1f16698fcae96c58a46c3935532f08764ce",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-saje-70032",
+          "target_kind": "node",
+          "target_sha256": "14cd64b8681589ba4d64ef37712305269d9789c187279de679c9903d596ed6ba",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124111",
+          "target_kind": "node",
+          "target_sha256": "2a1cb84b35a71dc359e79efc288b4dbeda7c9449cbc9b9cb1687eb81774bcf30",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70772",
+          "target_kind": "node",
+          "target_sha256": "d675549ea9aba2caed1ba6424bf137c7eb27b2f03345674048d66a4464686fea",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122539",
+          "target_kind": "node",
+          "target_sha256": "cfcba1e3e5b3628586a03c6d9ee36c942e9f5279c6880df3a59ceb7c3dce02b1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70310",
+          "target_kind": "node",
+          "target_sha256": "4ef02a5db4578cdf194c74cc9a04dfab974b3606687b0380cfac34f80e7617a0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-76901",
+          "target_kind": "node",
+          "target_sha256": "cc0312da0fb70263d40c3873bef61fdc3b3f9bcd82ae3f3f468fbef900e0efa4",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-nzm2-70056",
+          "target_kind": "node",
+          "target_sha256": "b2c84605c03023188bb6bfae04fbadd0d0f396b6a28e669be64f79cf6cc431bf",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1144-jgs2026-026",
+          "target_kind": "node",
+          "target_sha256": "1eec10139d7c5d26a48547b08664aa1d560353ae3c24910f217caf8287ef4f06",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70766",
+          "target_kind": "node",
+          "target_sha256": "a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-sce-70090",
+          "target_kind": "node",
+          "target_sha256": "7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70053",
+          "target_kind": "node",
+          "target_sha256": "20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ese3-70603",
+          "target_kind": "node",
+          "target_sha256": "e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd046190",
+          "target_kind": "node",
+          "target_sha256": "e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121323",
+          "target_kind": "node",
+          "target_sha256": "e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ijfe-70259",
+          "target_kind": "node",
+          "target_sha256": "4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000696",
+          "target_kind": "node",
+          "target_sha256": "b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-aphw-70185",
+          "target_kind": "node",
+          "target_sha256": "ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jh001250",
+          "target_kind": "node",
+          "target_sha256": "d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122518",
+          "target_kind": "node",
+          "target_sha256": "d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739",
+          "target_kind": "node",
+          "target_sha256": "6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-jmg-70045",
+          "target_kind": "node",
+          "target_sha256": "0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70049",
+          "target_kind": "node",
+          "target_sha256": "7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074",
+          "target_kind": "node",
+          "target_sha256": "b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70289",
+          "target_kind": "node",
+          "target_sha256": "a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wpt-2026-383",
+          "target_kind": "node",
+          "target_sha256": "704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-359",
+          "target_kind": "node",
+          "target_sha256": "22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-66630-sc-2026-0009",
+          "target_kind": "node",
+          "target_sha256": "5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-59588-2961-3094-1247",
+          "target_kind": "node",
+          "target_sha256": "92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2606",
+          "target_kind": "node",
+          "target_sha256": "892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2601",
+          "target_kind": "node",
+          "target_sha256": "4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025wr041875",
+          "target_kind": "node",
+          "target_sha256": "9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-006",
+          "target_kind": "node",
+          "target_sha256": "8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jb033060",
+          "target_kind": "node",
+          "target_sha256": "707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025ea004610",
+          "target_kind": "node",
+          "target_sha256": "3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122157",
+          "target_kind": "node",
+          "target_sha256": "aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp4-70096",
+          "target_kind": "node",
+          "target_sha256": "5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-bioe-70124",
+          "target_kind": "node",
+          "target_sha256": "46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-adom-71396",
+          "target_kind": "node",
+          "target_sha256": "7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-ese3-70586",
+          "target_kind": "node",
+          "target_sha256": "3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1144-jgs2026-039",
+          "target_kind": "node",
+          "target_sha256": "a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-hec-70120",
+          "target_kind": "node",
+          "target_sha256": "06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9477-70049",
+          "target_kind": "node",
+          "target_sha256": "7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-faam-70045",
+          "target_kind": "node",
+          "target_sha256": "347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-58491-2735-4202-3413",
+          "target_kind": "node",
+          "target_sha256": "cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121378",
+          "target_kind": "node",
+          "target_sha256": "f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421",
+          "target_kind": "node",
+          "target_sha256": "5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl123355",
+          "target_kind": "node",
+          "target_sha256": "88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121171",
+          "target_kind": "node",
+          "target_sha256": "34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd044617",
+          "target_kind": "node",
+          "target_sha256": "0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+          "target_kind": "node",
+          "target_sha256": "6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd045718",
+          "target_kind": "node",
+          "target_sha256": "36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122664",
+          "target_kind": "node",
+          "target_sha256": "f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ojoa-70022",
+          "target_kind": "node",
+          "target_sha256": "4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd045965",
+          "target_kind": "node",
+          "target_sha256": "a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-jssr-70066",
+          "target_kind": "node",
+          "target_sha256": "fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025wr042846",
+          "target_kind": "node",
+          "target_sha256": "cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-jbgs-e185535",
+          "target_kind": "node",
+          "target_sha256": "84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp4-70082",
+          "target_kind": "node",
+          "target_sha256": "15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-184711",
+          "target_kind": "node",
+          "target_sha256": "94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gc012776",
+          "target_kind": "node",
+          "target_sha256": "be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70436",
+          "target_kind": "node",
+          "target_sha256": "af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-2166-hydro-2026-191",
+          "target_kind": "node",
+          "target_sha256": "3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-ojoa-70020",
+          "target_kind": "node",
+          "target_sha256": "a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.claim.frontier.doi-10-1111-phpr-70116",
+          "target_kind": "node",
+          "target_sha256": "1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ecot-70052.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "413a130ce197e9f36f3c287595cad06412588939f17551941e0f64e413eba646",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70333.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "7fff6f0bfdc47c01ade5378ce41abde5313504a8806c7bad0379cda58555d480",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pwat-0000557.concept.usgs.30",
+          "target_kind": "edge",
+          "target_sha256": "58c5ea033e74aabca1efa3da34754b6c107cbde72c9fe6b73480e558db0ab0e2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-medu-70340.concept.mesh.d000091682",
+          "target_kind": "edge",
+          "target_sha256": "ae7d3ee5e9729f2c4333a980889dbc57528d24f37821d7eaf21bd9467d71a4ad",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124622.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "3df951a29cb556e9f3aec0424eb412a8d01b5f74603bf4f341b4b1f59886133b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1235.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "c7c9a55bd9dd0d2dd463460c366108d55978a30adc289b053dd6cb96da68ce98",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1216.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "635dee6b4eb2a4c03356a8c62e771a76cfa9d650f10eb9c87183ae62a083ffe3",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125301.field.usgs.1678",
+          "target_kind": "edge",
+          "target_sha256": "da4487fc23c63eb6d813c22d74248e4aa651a52a01d7ccce149decf2a06b12f9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-21425-fob-19-142560.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "3986a8713521ff84b82728c0701beaea23cf1574acd33d708f16431a025eb365",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001044.concept.usgs.1312",
+          "target_kind": "edge",
+          "target_sha256": "3ca128ae2cdaae8af0d2745b32dd313d582659c24c31a45b05827a6fd147e325",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000886.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "91e77eddc7fe88292b15ad7ff9449df9ffa91654a37426ec5a37239daae663a2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1075-consl-25020-lia.field.aat.300054256",
+          "target_kind": "edge",
+          "target_sha256": "ab741047cf8edd3a280ea1ae5164a41b2d305fecef729b32a17daf47b4420e36",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-040.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "7aa84f9fccde0b66d8b46cd51ea6a0b5e0100aa08fe39cd8dadb8effbf29e030",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-lol2-70186.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "586a4667b074f2e52528e7bce7d01a69c75b63cfa8237b50a6d262cd25d963eb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124411.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "5093d4ae72b587afb7fd89ce0c7a3b3fa5151c971d6e355cc448f0211313ca38",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70629.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "5d6d8905a618490c7791a3c4e518f2ceff8351835b11be2fc2bdd1b9c63fd143",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70277.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "41fb50edd017b2abeaf096ab82b2b6c837212a49288078b97056374b2ddaf50e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70129.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "f909c4829aec2b28a494a4fbbb9c7bedd68b31c43bf6d114ccec8b30374678e6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70613.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "4ef0afd549f86403f660671f586a68c8cd457c46f96be4e6309a8fcdc9051d06",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70605.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "69ed199b71414bc234eb624180354f6c4dc58b3becc2c5e082b68231d078c223",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3176-arch-2026-2-03.concept.aat.300019278",
+          "target_kind": "edge",
+          "target_sha256": "6902960110627aa91c2da22bb818ab816519532bef2a2bcbc1da2ef938a26b3a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-580.concept.usgs.27",
+          "target_kind": "edge",
+          "target_sha256": "8a35e876748f847320023ffb2c54fe29270e49c78d29187d40cf9c6c3dc9fd1f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ijop-70275.field.mesh.d011593",
+          "target_kind": "edge",
+          "target_sha256": "2ee3aac4f377dcbd00941bb67608726f3440664a49824c8a01b481f61deaa9a7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-popecon-10-e186220.concept.mesh.d006304",
+          "target_kind": "edge",
+          "target_sha256": "a5753ad4654edb69606084614507594daede3f68cc8bbdee7db8cc0711ec2822",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-507.concept.usgs.27",
+          "target_kind": "edge",
+          "target_sha256": "1b6a46178e802328ea55dde966281c18415dee4deac66bc4240548d5c60f2472",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e183393.concept.mesh.d017149",
+          "target_kind": "edge",
+          "target_sha256": "df6d963e659278fd99996439db1e1a213dd50233f2763c4a77ec66b9bbe40100",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026785.field.aat.300054240",
+          "target_kind": "edge",
+          "target_sha256": "8aa8a1d438ebe7f29c45eea36eeb1ebf63b128f13ae5eac1e32b16d6016bc7a0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124090.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "074a553ffdc9c672c32b9ac69e8fb765475c597c36648b97f1f730c85198e67a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-pei3-70207.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "6c98126377bf52e563c8c8ad1bcb25cec9461e0d086807b2f7c281f6bb0bc5ad",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-fea2-70077.field.anthropology",
+          "target_kind": "edge",
+          "target_sha256": "708679023d721aa70d9c59d8b1de2be111908cf0198ec4638c2acdeceb07581d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eet-70146.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "3ae70c59d5fc17a5bd72d8b7fa25d9943f67b60084bfcd6a5a5b1a8093363ffb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eco-70279.ology.hydrology",
+          "target_kind": "edge",
+          "target_sha256": "3f8dd74fd9b1d418159e335894b0ff2f9dc9559b25fa16add90c516667bf9bca",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124233.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "028cf55a78b7a1cb658530c03360725b336928116b84957cbd488492361ce42d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gc013127.concept.usgs.727",
+          "target_kind": "edge",
+          "target_sha256": "dcb058d2c2d350403dcc64ccc215d6ee1456a79af93b84787a24d0a5e057a2a2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70320.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "044c93e518ff928f92294bb0d4307c623b85ac5319590bc58aa14d7af2302314",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "bae06e564e38568f02beaf1a9176f5a65d6f793c4c3d47e057bf65db6405300b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261281.concept.aat.300060368",
+          "target_kind": "edge",
+          "target_sha256": "440f66fa02e365b28a8a934694ab41d70025d8496d76b3d34e96d5d824d1864d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eco-70277.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "3cebf8181da1f583a23f0978a6dee2c22c03053520727eac4240ab81144cbb5e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-iroh-70046.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "136f637a24e58361baeed3cba87d3e882d5db73df6093c9ac84740ad118c9dde",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261284.concept.aat.300069306",
+          "target_kind": "edge",
+          "target_sha256": "72b6686a1c9ac7efcd7acc2a0d8c7897305f26ea11263c238198d6b8d2c8fd68",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ruso-70070.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "bbae0bb2a21f408f515713d9b97f647e4d5e26a1f0078a40092517592d118e74",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-200681.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "3b02aab8c12c34bb815e397c9fab4e968000577fa9d9817f58510e06db58afbb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001005.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "37c658edad28ad0b89dc462ec248585db92c0ddd90adb110e8bd356eb40423cc",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-moth-70148.field.mesh.d008678",
+          "target_kind": "edge",
+          "target_sha256": "e3d0ac61e4a805be0aead5e39d2e63913fbb95a40fb83cb973180fc91b8f10c6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-20267724.field.aat.300054288",
+          "target_kind": "edge",
+          "target_sha256": "54b9e21c9b6ea576eecafc57464892bbe6691aa35434d2c16c8af85059266e00",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124881.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "ebb67782a0595644d988fb5734f0e3c2d5a14253a252300a435aee486ff4972d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001578.ology.seismology",
+          "target_kind": "edge",
+          "target_sha256": "9c83b12562399d0b7cc3a730343ff71a638da8dd24a9bc22a8d7e34ab439fdc7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-gdj3-70104.ology.meteorology",
+          "target_kind": "edge",
+          "target_sha256": "ba0e72327f0351eaaa5b0699d0d5b7ebb1e286e02a9577f8fc72258d3c19aefa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122610.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "a40868461cc51d80f2ab195bc477810f9444954ccf350d129551a2a045d4a9ab",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70308.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "2b65bb9eac425d93620749c7801216e8f784b13faa6a657dcb146aec1599063a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4281.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "b278bae4fd0a6627085971e63abd53c7e4795ae9b62bb5c6c14c780f00540bca",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4275.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "980c612f0a4461d7be757a3c6b0d4b0c74ad0f4650f4278d40a4d17ecc1a0612",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eet-70139.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "823d43727642b31044de8f706af9ec20e919df8b4fd503af78edea331a7d9188",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jclp-70212.ology.psychopathology",
+          "target_kind": "edge",
+          "target_sha256": "0e9258994f368a2f6fcdb5e65757ba5828c985f3b8aa1536bee44b80009a8e22",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-12944-cwe-21-2-3.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "6a162e820ccdcd99284802c8192a48f57226e01e217c479743c74eb3c2ec606f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-bse-71470.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "d142f92e16042c6eae2b6e1d393674e3dfd15aada1c53b94526a78e7b6242e71",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000986.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "5568aa84d74a54e19ec83cc77b3444176c7251b24c6d8bf7cd1eac79d5ee61b7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1752-1688-70151.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "332fe084ed8ec047f9b0ce05a10614d344ff3d34bf5d20456419851ce33c9461",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jade-70048.concept.aat.300054181",
+          "target_kind": "edge",
+          "target_sha256": "c01fbf16f229689766e1c76ff2afd2187e28ccb0b5febb8928f5ecc49d243168",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-lcrp-70059.concept.mesh.d000075665",
+          "target_kind": "edge",
+          "target_sha256": "231b567079f61a2c7b73d4498e6588fb97c1db07cbd428db00364209f7618b45",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77938.field.mesh.d000076227",
+          "target_kind": "edge",
+          "target_sha256": "200b9ee34ecb381723b605c58b00384ee717d8a3928d9b387757a5b0ff9ee0e7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e185197.concept.mesh.d000070586",
+          "target_kind": "edge",
+          "target_sha256": "2b7b1d9a0b8511ba28c5e86eec55cbef346a3051e2bdd6e2319bfedb3f633924",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125327.concept.usgs.1298",
+          "target_kind": "edge",
+          "target_sha256": "b06ccf5046b58d08eb505ad83799a71b4e588de6b7f7ed902815593003f9e1d7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70302.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "a7984b13c49b2720e75906b24aca9cd5236ef51eef4b72d9d898fe4664bc18da",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000930.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "b6e8c4e2418f570563e5aaf59e8d186332c205a5a598755206cf693c45639c54",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsnr-2026-0030.concept.aat.300016617",
+          "target_kind": "edge",
+          "target_sha256": "61c92fb7e36e4fcf77c3e1e95b86877ff96e61f23873104b32f1bc476cbd7860",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70062.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "1c3d23c0da53c32744fc3fd75b0d0e1d29c8c737679bd2ac3cf864a1516fc9e0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "f9680a16c3265fe3661dd70beac7a281228c8446333c66566a4b2cd88039fe20",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70852.concept.mesh.d000097815",
+          "target_kind": "edge",
+          "target_sha256": "10b0e59805ed315ba4892dba096f91d2499054928a8b125e546cd1d27b89a56b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70845.concept.mesh.d000223",
+          "target_kind": "edge",
+          "target_sha256": "03126797c3c1a67f99c6856b97fb361b2a048a21d8ffbd9f9faeeceafdce7e43",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001039.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "f681f86b6cd6221c90f693200afd14c0ba7fb39129b8bd2f4f3e93a3cbff9617",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-nup-70114.field.aat.300054297",
+          "target_kind": "edge",
+          "target_sha256": "22afd973472db19dfb2940b071d91b713f91648c736039bd278d2034fe2172ea",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejss-70414.concept.usgs.1731",
+          "target_kind": "edge",
+          "target_sha256": "1eca545df4306771858ce11a14f3eb6363adad118502b56871804206e712db6e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026wr044293.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "7994fd2f12baf505e42cdbc406a718fc5e558e261cb0f510c28c42af6ff37759",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp-70399.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "a655ebb19ba84e432978fcb5d5412e23b423e8765df90eacc1fae687523be229",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jqs-70108.ology.sedimentology",
+          "target_kind": "edge",
+          "target_sha256": "368366ec2806e816d6adab901517f4ed74589e505b34452338f9a8943ec295b0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jd046723.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "cf3ec6c8fde9a680a1c9df6dbeb94d56f5eb02b27c50428a2e6052129d499bfa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-msd2-70089.concept.eia.electric-energy",
+          "target_kind": "edge",
+          "target_sha256": "2b2d57db3262660a239464992d41469e50f9d4a51ced95584e5b2359608fb7a0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70342.field.aat.300054263",
+          "target_kind": "edge",
+          "target_sha256": "55f33142020fbac13bf21380c4374403266f46cdb0aab9affeb012936f057fdf",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70059.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "57cc1c4163c135c16e71f548200b3335302641c2354d77550a2df7f6ccef875d",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124727.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "9de5826b34ea49d1e147a936fab8aef49e8b48caa1c8a00cb78e233ce1a0fc56",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000877.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "870f675c090fecc7e40e9fccd64338d4b6573842ec02a43e9f858c6466da6b50",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70054.concept.usgs.1145",
+          "target_kind": "edge",
+          "target_sha256": "57cfd1fa059479121dd39cd7015839cb60027f379c452d354347a277f5e2aa60",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-moth-70134.concept.mesh.d006808",
+          "target_kind": "edge",
+          "target_sha256": "075acc6dce6372ce0982dde46c29bc22da33366fb665156513d28599fd15553f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-gwat-70098.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "e069a6616981d994426c6cf255049159f38fbc7fb32af0e735a313d686d7d3eb",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wp-2026-018.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "21cb010041d462fd8fd5a29ba22d12438e29a03acf349d17c27367374c61c33e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0107.field.aat.300389758",
+          "target_kind": "edge",
+          "target_sha256": "cd0285dcd8d84ff3276063eb5231555bcb63bb6b40baa8da1dd7bc5e379bb852",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000931.concept.usgs.168",
+          "target_kind": "edge",
+          "target_sha256": "3b93367f56a100af9711d79cf0398ec0b1defd995eea2751cd18d8eaf7c88da2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122646.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "d80b59feca9f2643c8127f2af6f4e59ea53f61c45477eda27131b05289272f7a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70058.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "26faf98e1617c498f14fcaf1a9f99fc2e0ea0afc0cefdb2d687940945652e28a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70107.ology.mineralogy",
+          "target_kind": "edge",
+          "target_sha256": "eabf986a68eb7d042c78f083bb3201adedef5dfacea5beb82db6f9b133aa38a1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-187529.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "c59f73ce630e6023ef9ab5c5df42b1f18da0655a68f6e1c2387696ebe2ffd123",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026775.field.aat.300054255",
+          "target_kind": "edge",
+          "target_sha256": "89c395e3b5b43e2d74d942f5b61fe00955134a024cd35b14e745aecb7820da25",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026774.concept.aat.300262706",
+          "target_kind": "edge",
+          "target_sha256": "e375c52d50d9a3d5c3274cdbeaabe4fc90ce29c2e3d24f57c17e75331a69314f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-hec-70140.concept.mesh.d006304",
+          "target_kind": "edge",
+          "target_sha256": "4d0e2faad6ec1db51c9ecabb0cb38dec9a15d81fd0a8a7acc6eb68bbecedd82e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-tox-70177.concept.usgs.435",
+          "target_kind": "edge",
+          "target_sha256": "03f2d69fe3e86e3e32863029e02de5defd5de61377f858dadb9bdae3efc50ac8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77585.field.mesh.d044085",
+          "target_kind": "edge",
+          "target_sha256": "932a66e8f067dd34c5dcc96caeb75527f1a0e0be66c2af03e3029025af511648",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70245.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "0d407c662e3ab90a674023eceaf60e79bdcaa50309cf801a2f9d87595758d885",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70337.field.aat.300054255",
+          "target_kind": "edge",
+          "target_sha256": "823d22274092f6a74cb246836de4e960d2306c30fbe24958ecef7948ae265ae3",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123821.concept.usgs.2028",
+          "target_kind": "edge",
+          "target_sha256": "392f56fe5d9f837ba1a66d41b1708337b7322ee2f1a1c09d75ceb43a9c5e6fe8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70252.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "30692f0745cfa35cf656234ae1065de640303228c84100b909a326aa269d780b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70540.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "0965bde54a2ddd0f7e90ee273365f4962fd1484c7430a031ad97944f53e6d97e",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-eje-70266.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "43e2cb6f68dbe2ce7dcfec60226866e44313f4f2bed32da14361b0943a17144a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ecpo-70064.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "9d535648cc70e0fe441dc7c258ac616a306f2ff36f5f5d6d74ca31cfd31b40f7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-beer-70139.concept.mesh.d012941",
+          "target_kind": "edge",
+          "target_sha256": "4a4b958419b8bd96eaacd5b404fd954052600e725c0a8fc209f867d5f44c0109",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0029.field.aat.300054297",
+          "target_kind": "edge",
+          "target_sha256": "d04ad2eb1b13c49ed964cf507c49d71f693793799169bba19d27a5d4220b51f5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124661.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "55a00eefabe46841268f7fa262e0e0412cd15c0366b806a59d817d0106dbf31c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jc023581.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "a18ba45043b77113b0e3b3a9d3adfe3119c6ba58be45cd7585be9fa2df4d2fa1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jb032632.field.navigation",
+          "target_kind": "edge",
+          "target_sha256": "6de6605b857cc8977937877057635fa3102dca7da7d06447b136c5d3a84ef339",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70526.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "9d32184199f687914a2f80ca00dbb579a7c54e835cafcf1d4f58c3a84f7456b8",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-saje-70032.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "c7a43702e148ff21455a1439315c19ce38671f09535e13897b8967a33d81bdd6",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124111.concept.usgs.819",
+          "target_kind": "edge",
+          "target_sha256": "8e7e4115d7cd3db903ccdfc4c14129d22450e2176267309fd09f300da054462f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70772.concept.mesh.d000097822",
+          "target_kind": "edge",
+          "target_sha256": "3e62a6474f79f8cb4795b144fb48f00f5952215fe1b5aa709126d6cd47192bd0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122539.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "c40b0c002dfce5e52c92ebb40cea4fe5c9990a4b2a9da8eeda5a1e0161f5927a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70310.field.aat.300054264",
+          "target_kind": "edge",
+          "target_sha256": "3454753a5337242de9c7d986cd8661b3addf0ba50bf6fe77ee01caf8c1acf184",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-76901.concept.mesh.d001698",
+          "target_kind": "edge",
+          "target_sha256": "33d5bdf8cc2d08f0fb578677ea1762c1ba2aebe8a4eee124341801350c4e5c4c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-nzm2-70056.concept.usgs.1731",
+          "target_kind": "edge",
+          "target_sha256": "3ada4b65e3f13f0f937b48ca5db6c82c1179403cc0afb7c1f55dde8498914236",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-026.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "b9ba5ddccd19aa7016d970d727b6d5dc9b7bb39ed0e2d450c5c9d59715553c9a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70766.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "fcbdce1b920f24264f2bef8aa6f195af401c6d3484357ace620a11887f12c5fa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-sce-70090.concept.mesh.d000080562",
+          "target_kind": "edge",
+          "target_sha256": "16012ce64737f2436f2d6371cd35f39f43c8313b78d72327513f89f5fc1cd4df",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70053.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "9900a279402e35229a0da8d0d7f2b28f43339dfabe26c2d327359b75320000f5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70603.concept.eia.coal-mine",
+          "target_kind": "edge",
+          "target_sha256": "3863be4c8ca9e7ed520cac96a977f5671b15c9120ebf402e7067a61d36a14d56",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd046190.concept.usgs.65",
+          "target_kind": "edge",
+          "target_sha256": "a81c4b93bb80875c32e4cb68c2eb7770bc026c11a1112abb33ca81c7a4cbb3c2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121323.concept.usgs.93",
+          "target_kind": "edge",
+          "target_sha256": "8c6a0d96fd2ee03a46e32a995778115ab59ae1d4134496934663798b82352269",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ijfe-70259.concept.mesh.d057217",
+          "target_kind": "edge",
+          "target_sha256": "ef4531c42eb774a730647f22f51fc69fb73fb0e839ac044ad9c1f15d6978d867",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000696.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "e783179f541b5c3c5e8f04c8f1df63f088b40d521e4c80955ab28158cd2a1522",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-aphw-70185.concept.mesh.d000091682",
+          "target_kind": "edge",
+          "target_sha256": "30b5316591de380285c1fe3c44b88357f34ca5f4cbb582cf5b373f893435b0da",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001250.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "31f023290f2ba95152778204853b275360d8b26720aaba93e4a7aba4ebeb556a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122518.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "e23b30c7bd2185fb0b659e2db19faf3ce0200478301455d6a02427fbf3940e9f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e172739.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "f7dd16ce59b926cd1bb8d06fb3bd37b33038949d2852fc0381863c8601208bab",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70045.ology.geochronology",
+          "target_kind": "edge",
+          "target_sha256": "b470d645eb6aa2ad32f6441a01e1d37fdc168516d75e1d4a4e746017ba4b2109",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70049.concept.usgs.1199",
+          "target_kind": "edge",
+          "target_sha256": "1d09b2a8fde228cf07762a4d90f796dfbe3df29e7f968f5f0704a525d3ee75ea",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e162074.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "bdf0c8a46aede6e1ef7a381e7b93738729763b1a913a713125c041353d087e35",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70289.concept.aat.300262706",
+          "target_kind": "edge",
+          "target_sha256": "a2398ef052807e35173c06311bf3cf55c5c8b041da1e21046802d8a01555cd18",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wpt-2026-383.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "2abb8a8626986197b06bc49d0bb8bef48295b14046495b780a1200ea70c88457",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-359.ology.hydrology",
+          "target_kind": "edge",
+          "target_sha256": "6d204342aacfe31e93adb6c08aeab160067eac39a6f2d313537e8b0bfe4be661",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-66630-sc-2026-0009.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "9e583578b5328c598c3f058ef1c173f32e6f2df7b21e79e104a4d50a26fc2dba",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-59588-2961-3094-1247.field.aat.300054245",
+          "target_kind": "edge",
+          "target_sha256": "c0b1b30c8c314a0566cf8948c5d4cf7f0dd226986ca607427dc17e76b880fa16",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2606.field.aat.300054254",
+          "target_kind": "edge",
+          "target_sha256": "916e012de468086bb33fdced7b20e93b8fa7c86d2407005b2701ba57c9b70c96",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2601.concept.mesh.d012941",
+          "target_kind": "edge",
+          "target_sha256": "0be107f194b016c8c37d70402214009a3163baf456d9843a74c666589f2aec83",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025wr041875.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "127fdb6e32bb72f5aadbb5934b84e3038fcfe0ea63e80ff0d03b94ce8c493633",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-006.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "7b6abcdbf38434946b7530124cfecec3cc5e3dc440b5ecc7b020f8f198cd3a57",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jb033060.field.usgs.1176",
+          "target_kind": "edge",
+          "target_sha256": "c78ba9bbe4415aa9779e6d8709a32c302c0f94e5f48df97f7e3a9261df571d67",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025ea004610.field.usgs.68",
+          "target_kind": "edge",
+          "target_sha256": "c0aaffd9374fbd38c166cb53c925891055c1b80713090808adc7ab88fd67558a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122157.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "0eb161ffb3e442b58145927d5cb36b8f85485ddd66b10d18a6ecbe9131dd0c91",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70096.field.navigation",
+          "target_kind": "edge",
+          "target_sha256": "ffaed2c1149b711fffb46eeb1216517acbd90e9558470c7819cdf8c9e485cdbd",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-bioe-70124.field.mesh.d026690",
+          "target_kind": "edge",
+          "target_sha256": "8439c6d99a8732c062ad31e55f0dc6cba18a704c35f6f7c61e74dceb405ef675",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adom-71396.field.mesh.d044085",
+          "target_kind": "edge",
+          "target_sha256": "5fd9f4b6f06c961306fb7d4c8d32df101aa5da7466e73a2dca276168b93294cd",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70586.concept.eia.air-collector",
+          "target_kind": "edge",
+          "target_sha256": "d4736bd0c4e97941abcc96d00793bd4e018d89b3be2ebd63bd6343f6922d2e19",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-039.ology.stratigraphy",
+          "target_kind": "edge",
+          "target_sha256": "6d6a631194a4c58ed849a3cafc47ed7e2a7d3339435fa5dfb19ed901b8883d62",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-hec-70120.concept.mesh.d057185",
+          "target_kind": "edge",
+          "target_sha256": "bd8d87880c3050bd1b58d85aba0cf8ed7b269e41317d636cbabef39dcba7332b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9477-70049.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "1cf9cbaa2da8bcb70dda42618312a76ce3550929db788282de4de5c0e0b30148",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-faam-70045.concept.mesh.d003906",
+          "target_kind": "edge",
+          "target_sha256": "4d67ee429c042a8827479934aeca2ce406bf180edbefab9878249d4ee5e380b9",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-58491-2735-4202-3413.concept.eia.leading-edge",
+          "target_kind": "edge",
+          "target_sha256": "bd4d11377ccd6185c601c0b1836776bca0e9f373cdf77b91b6323139057754b5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121378.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "d6e676a4e791093ba60fe5c1d0072aac62c14f2b477c8da4aae866986be0ef69",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-56403-nejesh-v5i2-421.field.aat.300054280",
+          "target_kind": "edge",
+          "target_sha256": "66d313cca7f2bb483848de80ea3bc7f571b700d1f631817575a56e0be1be6ec1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123355.concept.usgs.677",
+          "target_kind": "edge",
+          "target_sha256": "36fb44841b47eb8a5ba87651b67c8730535ec6d9f8bf9ea4331dcd994eb07dbf",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121171.concept.usgs.2277",
+          "target_kind": "edge",
+          "target_sha256": "f767a8496500b340407b3f4a561a760fada083a5dbe32a371e436dae330ae8b7",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd044617.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "5ff90558ecd44c62b94d62acdb1dd66b4520eb8c7ed555f332c67fc406cd5764",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-22378-he-2026-11-2-218-234.field.mesh.d049691",
+          "target_kind": "edge",
+          "target_sha256": "0a270f4126c52c25ad67c5c5a5397d38bc6c8beba1634f15bd40ef0752beb0e5",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045718.field.climatology",
+          "target_kind": "edge",
+          "target_sha256": "81bf4b593e62bf06f23f54659c55a2a4a7010e3a615b1e0b01891c229aaf30e0",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122664.field.usgs.1678",
+          "target_kind": "edge",
+          "target_sha256": "02c99f468d924805d5a015f973306559f6f9a4e597b5bfe4b1753ddcb644131c",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70022.concept.aat.300016586",
+          "target_kind": "edge",
+          "target_sha256": "fe1caf92a5042aa1bbe148f4c4e5b82dbcb25468e13edff408626716d6342d5f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045965.concept.usgs.64",
+          "target_kind": "edge",
+          "target_sha256": "6c4c9063897ae6a898b141a7cee6e0fd38f3ec532b45563372607dec7f9e6f46",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jssr-70066.concept.mesh.d033303",
+          "target_kind": "edge",
+          "target_sha256": "3e5976917c5b790368d1d974a27f09d3cbf1a25df85337389fba3ad8dcdbdfae",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025wr042846.concept.usgs.1298",
+          "target_kind": "edge",
+          "target_sha256": "7c64ab102e2304ef497beb71c4b095efc3af1ece01aea65af08f0bdae44df2aa",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-jbgs-e185535.concept.usgs.1034",
+          "target_kind": "edge",
+          "target_sha256": "48286c10a085c1e1a41c8a7789715e82866bebb61935da0d5299d6599c1d3bf2",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70082.ology.stratigraphy",
+          "target_kind": "edge",
+          "target_sha256": "9136b4d300f08beb1d489ccc8eebbd2ffbd214562355dd5a70ce12d84a0e3a42",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-184711.field.mesh.d019021",
+          "target_kind": "edge",
+          "target_sha256": "80e19af92bd242dbbf60ad386fc52424d0b30502bb187f314ca416e678725c7f",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gc012776.concept.usgs.562",
+          "target_kind": "edge",
+          "target_sha256": "b89f637ce4d43910084e45cdb864a4b8106ad8cf50bbb2189d7e3797874362db",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70436.concept.usgs.1308",
+          "target_kind": "edge",
+          "target_sha256": "59b83d6fa078d5e53746bca6919a52e4e4d4f4c818c80fe94e80c0d053720860",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-191.concept.usgs.2027",
+          "target_kind": "edge",
+          "target_sha256": "cb78de2c5c59b64a639be3807d30dc8db002e5c4585648d8fda386878813ea3b",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70020.concept.aat.300019275",
+          "target_kind": "edge",
+          "target_sha256": "faacbfc608af0c619ee3a7e31fa779eda86d9156d8a8c4c07ecd4b3919680be1",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+        },
+        {
+          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-phpr-70116.field.aat.300054245",
+          "target_kind": "edge",
+          "target_sha256": "f90b2271ec0cc36862ffdac2e4fcc49642970d725c3b22a9bbdd1232e9f0cd1a",
+          "outcome": "supported",
+          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+          "checks": {
+            "exact_quote_verbatim": true,
+            "source_not_botcheck": true
+          },
+          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "reviewer_id": "code:nemesis-provenance/1",
+          "model": "nemesis-provenance/1 (deterministic code check, no model)",
+          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "role": "provenance",
+          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+        }
+      ],
+      "context_nodes": [
+        {
+          "id": "field.navigation",
+          "label": "Navigation",
+          "kind": "field",
+          "domain": "earth",
+          "era": "agrarian",
+          "status": "active",
+          "summary": "Knowledge and methods for determining position and direction across terrain and water.",
+          "tags": [],
+          "sources": [
+            {
+              "id": "oecd-frascati-2015",
+              "title": "OECD Frascati Manual 2015 — Fields of R&D classification",
+              "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "field.anthropology",
+          "label": "Anthropology",
+          "kind": "field",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "summary": "NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "oecd-frascati-2015",
+              "title": "OECD Frascati Manual 2015 — Fields of R&D classification",
+              "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
+            },
+            {
+              "id": "nlm-mesh.bcc9794e5c2487d85964",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000883",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000883"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "field.climatology",
+          "label": "Climatology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "oecd-frascati-2015",
+              "title": "OECD Frascati Manual 2015 — Fields of R&D classification",
+              "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
+            },
+            {
+              "id": "usgs-thesaurus.e70c8d2c1e03ea23b093",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.geochronology",
+          "label": "Geochronology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.9b9b9c2209b3540da35b",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.hydrology",
+          "label": "Hydrology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.7691e5829ecd899aeb75",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.meteorology",
+          "label": "Meteorology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.4c9d6896b889ce2b2e86",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.mineralogy",
+          "label": "Mineralogy",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.a5b24d28b9768fcf1686",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.sedimentology",
+          "label": "Sedimentology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.fd7a87508131b4ecaf86",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.seismology",
+          "label": "Seismology",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.762a1e9db52aec2a89a0",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.stratigraphy",
+          "label": "Stratigraphy",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "summary": "USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "usgs-thesaurus.d2e306d9307aced4b202",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "ology.psychopathology",
+          "label": "Psychopathology",
+          "kind": "field",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "summary": "NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.",
+          "tags": [
+            "ology"
+          ],
+          "sources": [
+            {
+              "id": "nlm-mesh.cfcfe0e017d161687831",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011599",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011599"
+            }
+          ],
+          "frontier": false,
+          "aliases": []
+        },
+        {
+          "id": "field.usgs.68",
+          "label": "Atmospheric sciences",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.68",
+              "title": "USGS Thesaurus term 68",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=68"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.677",
+          "label": "Magnetic field (earth)",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.677",
+              "title": "USGS Thesaurus term 677",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=677"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.usgs.1176",
+          "label": "Topography",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1176",
+              "title": "USGS Thesaurus term 1176",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1176"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1298",
+          "label": "Water chemistry",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1298",
+              "title": "USGS Thesaurus term 1298",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1298"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.usgs.1678",
+          "label": "Hydrodynamics",
+          "kind": "field",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1678",
+              "title": "USGS Thesaurus term 1678",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1678"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.27",
+          "label": "Air temperature",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.27",
+              "title": "USGS Thesaurus term 27",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=27"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.65",
+          "label": "Atmospheric composition",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.65",
+              "title": "USGS Thesaurus term 65",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=65"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.2027",
+          "label": "Soil moisture",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.2027",
+              "title": "USGS Thesaurus term 2027",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2027"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.2028",
+          "label": "Soil temperature",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.2028",
+              "title": "USGS Thesaurus term 2028",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2028"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.819",
+          "label": "Ocean temperature",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.819",
+              "title": "USGS Thesaurus term 819",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=819"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1199",
+          "label": "Unconsolidated deposits",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1199",
+              "title": "USGS Thesaurus term 1199",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1199"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d049691",
+          "label": "History, Medieval",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d049691",
+              "title": "NLM MeSH Browser descriptor D049691",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D049691"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d019021",
+          "label": "Natural History",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)",
+          "sources": [
+            {
+              "id": "nlm-mesh.d019021",
+              "title": "NLM MeSH Browser descriptor D019021",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D019021"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d008678",
+          "label": "Metaphysics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)",
+          "sources": [
+            {
+              "id": "nlm-mesh.d008678",
+              "title": "NLM MeSH Browser descriptor D008678",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D008678"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d012941",
+          "label": "Social Responsibility",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d012941",
+              "title": "NLM MeSH Browser descriptor D012941",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D012941"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d033303",
+          "label": "Protestantism",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)",
+          "sources": [
+            {
+              "id": "nlm-mesh.d033303",
+              "title": "NLM MeSH Browser descriptor D033303",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D033303"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d011057",
+          "label": "Politics",
+          "kind": "field",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d011057",
+              "title": "NLM MeSH Browser descriptor D011057",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011057"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d017149",
+          "label": "Private Sector",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d017149",
+              "title": "NLM MeSH Browser descriptor D017149",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D017149"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000097822",
+          "label": "Media Exposure",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000097822",
+              "title": "NLM MeSH Browser descriptor D000097822",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000097822"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d006304",
+          "label": "Health Status",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d006304",
+              "title": "NLM MeSH Browser descriptor D006304",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006304"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d057217",
+          "label": "Economic Development",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d057217",
+              "title": "NLM MeSH Browser descriptor D057217",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D057217"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000080562",
+          "label": "Universal Design",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000080562",
+              "title": "NLM MeSH Browser descriptor D000080562",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000080562"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000070586",
+          "label": "Fiscal Policy",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000070586",
+              "title": "NLM MeSH Browser descriptor D000070586",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000070586"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000075665",
+          "label": "Recidivism",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Recidivism as: Repeated criminal behavior.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000075665",
+              "title": "NLM MeSH Browser descriptor D000075665",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000075665"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000091682",
+          "label": "Health Inequities",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000091682",
+              "title": "NLM MeSH Browser descriptor D000091682",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000091682"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d003906",
+          "label": "Developing Countries",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d003906",
+              "title": "NLM MeSH Browser descriptor D003906",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D003906"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000223",
+          "label": "Adaptation, Psychological",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000223",
+              "title": "NLM MeSH Browser descriptor D000223",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000223"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d006803",
+          "label": "Human Development",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d006803",
+              "title": "NLM MeSH Browser descriptor D006803",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006803"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d011593",
+          "label": "Psychology, Social",
+          "kind": "field",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d011593",
+              "title": "NLM MeSH Browser descriptor D011593",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011593"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d057185",
+          "label": "Sedentary Behavior",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .",
+          "sources": [
+            {
+              "id": "nlm-mesh.d057185",
+              "title": "NLM MeSH Browser descriptor D057185",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D057185"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d000097815",
+          "label": "Emotional Exhaustion",
+          "kind": "concept",
+          "domain": "social",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000097815",
+              "title": "NLM MeSH Browser descriptor D000097815",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000097815"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d006808",
+          "label": "Humanism",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d006808",
+              "title": "NLM MeSH Browser descriptor D006808",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006808"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d026690",
+          "label": "Ethics, Clinical",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)",
+          "sources": [
+            {
+              "id": "nlm-mesh.d026690",
+              "title": "NLM MeSH Browser descriptor D026690",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D026690"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.435",
+          "label": "Geochemical processes",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.435",
+              "title": "USGS Thesaurus term 435",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=435"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1312",
+          "label": "Water temperature",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1312",
+              "title": "USGS Thesaurus term 1312",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1312"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1308",
+          "label": "Water resources",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1308",
+              "title": "USGS Thesaurus term 1308",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1308"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.64",
+          "label": "Atmospheric circulation",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.64",
+              "title": "USGS Thesaurus term 64",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=64"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.168",
+          "label": "Climate change",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.168",
+              "title": "USGS Thesaurus term 168",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=168"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.30",
+          "label": "Algal blooms",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.30",
+              "title": "USGS Thesaurus term 30",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=30"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.93",
+          "label": "Biogeochemical cycling",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.93",
+              "title": "USGS Thesaurus term 93",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=93"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.2277",
+          "label": "Carbon flux",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.2277",
+              "title": "USGS Thesaurus term 2277",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2277"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1731",
+          "label": "Carbon sequestration",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1731",
+              "title": "USGS Thesaurus term 1731",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1731"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.562",
+          "label": "Hydrothermal processes",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.562",
+              "title": "USGS Thesaurus term 562",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=562"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.727",
+          "label": "Metamorphism (geological)",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.727",
+              "title": "USGS Thesaurus term 727",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=727"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1034",
+          "label": "Sediment transport",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1034",
+              "title": "USGS Thesaurus term 1034",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1034"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.usgs.1145",
+          "label": "Tectonic processes",
+          "kind": "concept",
+          "domain": "earth",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle",
+          "sources": [
+            {
+              "id": "usgs-thesaurus.1145",
+              "title": "USGS Thesaurus term 1145",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1145"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.mesh.d001698",
+          "label": "Biomedical Engineering",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.",
+          "sources": [
+            {
+              "id": "nlm-mesh.d001698",
+              "title": "NLM MeSH Browser descriptor D001698",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D001698"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d000076227",
+          "label": "Stereolithography",
+          "kind": "field",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).",
+          "sources": [
+            {
+              "id": "nlm-mesh.d000076227",
+              "title": "NLM MeSH Browser descriptor D000076227",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000076227"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.mesh.d044085",
+          "label": "Microfluidics",
+          "kind": "field",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .",
+          "sources": [
+            {
+              "id": "nlm-mesh.d044085",
+              "title": "NLM MeSH Browser descriptor D044085",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D044085"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.eia.air-collector",
+          "label": "Air collector",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.",
+          "sources": [
+            {
+              "id": "eia-glossary.A",
+              "title": "U.S. EIA Glossary, letter A",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=A"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.eia.coal-mine",
+          "label": "Coal mine",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.",
+          "sources": [
+            {
+              "id": "eia-glossary.C",
+              "title": "U.S. EIA Glossary, letter C",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=C"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.eia.electric-energy",
+          "label": "Electric energy",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.",
+          "sources": [
+            {
+              "id": "eia-glossary.E",
+              "title": "U.S. EIA Glossary, letter E",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.eia.energy-consumption",
+          "label": "Energy consumption",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.",
+          "sources": [
+            {
+              "id": "eia-glossary.E",
+              "title": "U.S. EIA Glossary, letter E",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.eia.leading-edge",
+          "label": "Leading edge",
+          "kind": "concept",
+          "domain": "engineering",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.",
+          "sources": [
+            {
+              "id": "eia-glossary.L",
+              "title": "U.S. EIA Glossary, letter L",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=L"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054245",
+          "label": "linguistics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.",
+          "sources": [
+            {
+              "id": "getty-aat.300054245",
+              "title": "Getty Art & Architecture Thesaurus record 300054245",
+              "url": "http://vocab.getty.edu/page/aat/300054245"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054280",
+          "label": "aesthetics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.",
+          "sources": [
+            {
+              "id": "getty-aat.300054280",
+              "title": "Getty Art & Architecture Thesaurus record 300054280",
+              "url": "http://vocab.getty.edu/page/aat/300054280"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054288",
+          "label": "epistemology",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.",
+          "sources": [
+            {
+              "id": "getty-aat.300054288",
+              "title": "Getty Art & Architecture Thesaurus record 300054288",
+              "url": "http://vocab.getty.edu/page/aat/300054288"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054297",
+          "label": "phenomenology",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.",
+          "sources": [
+            {
+              "id": "getty-aat.300054297",
+              "title": "Getty Art & Architecture Thesaurus record 300054297",
+              "url": "http://vocab.getty.edu/page/aat/300054297"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300069306",
+          "label": "Ideal, the",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.",
+          "sources": [
+            {
+              "id": "getty-aat.300069306",
+              "title": "Getty Art & Architecture Thesaurus record 300069306",
+              "url": "http://vocab.getty.edu/page/aat/300069306"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300060368",
+          "label": "syncretism",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.",
+          "sources": [
+            {
+              "id": "getty-aat.300060368",
+              "title": "Getty Art & Architecture Thesaurus record 300060368",
+              "url": "http://vocab.getty.edu/page/aat/300060368"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054240",
+          "label": "musicology",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.",
+          "sources": [
+            {
+              "id": "getty-aat.300054240",
+              "title": "Getty Art & Architecture Thesaurus record 300054240",
+              "url": "http://vocab.getty.edu/page/aat/300054240"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054256",
+          "label": "theoretical linguistics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.",
+          "sources": [
+            {
+              "id": "getty-aat.300054256",
+              "title": "Getty Art & Architecture Thesaurus record 300054256",
+              "url": "http://vocab.getty.edu/page/aat/300054256"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300389758",
+          "label": "cryptography",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.",
+          "sources": [
+            {
+              "id": "getty-aat.300389758",
+              "title": "Getty Art & Architecture Thesaurus record 300389758",
+              "url": "http://vocab.getty.edu/page/aat/300389758"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054254",
+          "label": "semiotics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.",
+          "sources": [
+            {
+              "id": "getty-aat.300054254",
+              "title": "Getty Art & Architecture Thesaurus record 300054254",
+              "url": "http://vocab.getty.edu/page/aat/300054254"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300016617",
+          "label": "The Americas",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.",
+          "sources": [
+            {
+              "id": "getty-aat.300016617",
+              "title": "Getty Art & Architecture Thesaurus record 300016617",
+              "url": "http://vocab.getty.edu/page/aat/300016617"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300054181",
+          "label": "graphic design",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.",
+          "sources": [
+            {
+              "id": "getty-aat.300054181",
+              "title": "Getty Art & Architecture Thesaurus record 300054181",
+              "url": "http://vocab.getty.edu/page/aat/300054181"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054255",
+          "label": "sociolinguistics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.",
+          "sources": [
+            {
+              "id": "getty-aat.300054255",
+              "title": "Getty Art & Architecture Thesaurus record 300054255",
+              "url": "http://vocab.getty.edu/page/aat/300054255"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054263",
+          "label": "phonology",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"",
+          "sources": [
+            {
+              "id": "getty-aat.300054263",
+              "title": "Getty Art & Architecture Thesaurus record 300054263",
+              "url": "http://vocab.getty.edu/page/aat/300054263"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "field.aat.300054264",
+          "label": "pragmatics",
+          "kind": "field",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.",
+          "sources": [
+            {
+              "id": "getty-aat.300054264",
+              "title": "Getty Art & Architecture Thesaurus record 300054264",
+              "url": "http://vocab.getty.edu/page/aat/300054264"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300019275",
+          "label": "Bronze Age",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.",
+          "sources": [
+            {
+              "id": "getty-aat.300019275",
+              "title": "Getty Art & Architecture Thesaurus record 300019275",
+              "url": "http://vocab.getty.edu/page/aat/300019275"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300019278",
+          "label": "Late Bronze Age",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.",
+          "sources": [
+            {
+              "id": "getty-aat.300019278",
+              "title": "Getty Art & Architecture Thesaurus record 300019278",
+              "url": "http://vocab.getty.edu/page/aat/300019278"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300262706",
+          "label": "South African",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.",
+          "sources": [
+            {
+              "id": "getty-aat.300262706",
+              "title": "Getty Art & Architecture Thesaurus record 300262706",
+              "url": "http://vocab.getty.edu/page/aat/300262706"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        },
+        {
+          "id": "concept.aat.300016586",
+          "label": "North African",
+          "kind": "concept",
+          "domain": "humanities",
+          "era": "undated",
+          "status": "reported",
+          "frontier": false,
+          "summary": "The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.",
+          "sources": [
+            {
+              "id": "getty-aat.300016586",
+              "title": "Getty Art & Architecture Thesaurus record 300016586",
+              "url": "http://vocab.getty.edu/page/aat/300016586"
+            }
+          ],
+          "tags": [],
+          "aliases": []
+        }
+      ],
+      "sources": [
+        {
+          "id": "source.frontier.doi-10-1111-ecot-70052",
+          "url": "https://api.crossref.org/works/10.1111/ecot.70052",
+          "final_url": "https://api.crossref.org/works/10.1111/ecot.70052",
+          "title": "Crossref record doi:10.1111/ecot.70052: Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:25.192587+00:00",
+          "sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
+          "raw_sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "fa8f661644be585a3fa446db77946b0dc747b472a277a4dcfcbec46854593e67"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-qj-70333",
+          "url": "https://api.crossref.org/works/10.1002/qj.70333",
+          "final_url": "https://api.crossref.org/works/10.1002/qj.70333",
+          "title": "Crossref record doi:10.1002/qj.70333: Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:53.003913+00:00",
+          "sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
+          "raw_sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "fbec488e94cbf26e8d6a7120926f0e992df7e804d5748b17f8727b0f7a28cc5f"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pwat-0000557",
+          "url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557",
+          "title": "Crossref record doi:10.1371/journal.pwat.0000557: Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:53.825542+00:00",
+          "sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
+          "raw_sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "04a56d23b89f9a41cdbcd63b82318aa3547f3be44e3e40adb8499f29cd46ac94"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-medu-70340",
+          "url": "https://api.crossref.org/works/10.1111/medu.70340",
+          "final_url": "https://api.crossref.org/works/10.1111/medu.70340",
+          "title": "Crossref record doi:10.1111/medu.70340: Health equity is the goal of medical education: Implications for assessment validity",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:25.997461+00:00",
+          "sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
+          "raw_sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "57111c49baf17540115e49b89c5a2709b0f79fc7d91d13f61e46a068e9f368fd"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124622",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124622",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124622",
+          "title": "Crossref record doi:10.1029/2026gl124622: Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simu",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:26.771916+00:00",
+          "sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
+          "raw_sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "72f62dc8276cc576e7845f5e01389d05534f1b491bfbb279c390d6a44125a0d3"
+        },
+        {
+          "id": "source.frontier.doi-10-15351-2373-8456-1235",
+          "url": "https://api.crossref.org/works/10.15351/2373-8456.1235",
+          "final_url": "https://api.crossref.org/works/10.15351/2373-8456.1235",
+          "title": "Crossref record doi:10.15351/2373-8456.1235: Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:28.546577+00:00",
+          "sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
+          "raw_sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c3b02ba7a15cc7290c482e97051dd086a5bf018e768523da076bb05e22af21fd"
+        },
+        {
+          "id": "source.frontier.doi-10-15351-2373-8456-1216",
+          "url": "https://api.crossref.org/works/10.15351/2373-8456.1216",
+          "final_url": "https://api.crossref.org/works/10.15351/2373-8456.1216",
+          "title": "Crossref record doi:10.15351/2373-8456.1216: Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:29.337521+00:00",
+          "sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
+          "raw_sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d38bcedfbe5cb0ca534ac97643eff82e20729b15d31618471c3f160416765043"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl125301",
+          "url": "https://api.crossref.org/works/10.1029/2026gl125301",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl125301",
+          "title": "Crossref record doi:10.1029/2026gl125301: Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:54.669727+00:00",
+          "sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
+          "raw_sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "a0b5545ae159ede8a7cc331e7ed175c0619633e3b13cdfbf1e01d7ca511726b4"
+        },
+        {
+          "id": "source.frontier.doi-10-21425-fob-19-142560",
+          "url": "https://api.crossref.org/works/10.21425/fob.19.142560",
+          "final_url": "https://api.crossref.org/works/10.21425/fob.19.142560",
+          "title": "Crossref record doi:10.21425/fob.19.142560: Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:55.522880+00:00",
+          "sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
+          "raw_sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e132a199ee42712db8b5cc8f123f4011459609a4dc04467fd0c8b2305246107b"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0001044",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044",
+          "title": "Crossref record doi:10.1371/journal.pclm.0001044: Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:32.691435+00:00",
+          "sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
+          "raw_sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b9be4bb1d661e93f3aca74efec520a6c3d1cbf351d0ead7795c236eae0cde09f"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000886",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000886: How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:33.533067+00:00",
+          "sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
+          "raw_sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d775b6513c968dc1775fd4659db06e30455f28c07bdcc01fc213ddca56a50197"
+        },
+        {
+          "id": "source.frontier.doi-10-1075-consl-25020-lia",
+          "url": "https://api.crossref.org/works/10.1075/consl.25020.lia",
+          "final_url": "https://api.crossref.org/works/10.1075/consl.25020.lia",
+          "title": "Crossref record doi:10.1075/consl.25020.lia: When ‘John broke up Mary’ becomes acceptable",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:35.203996+00:00",
+          "sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
+          "raw_sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5fa871059e4fe47ed3201778fe74ffe12a0cbb15ada00091d7cd37a0b9aa19a4"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-hydro-2026-040",
+          "url": "https://api.crossref.org/works/10.2166/hydro.2026.040",
+          "final_url": "https://api.crossref.org/works/10.2166/hydro.2026.040",
+          "title": "Crossref record doi:10.2166/hydro.2026.040: Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:40.366195+00:00",
+          "sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
+          "raw_sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2dda830917ebe00e409966a566673d2f9a1c5d4151d1449d8ff422908063b5f7"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-lol2-70186",
+          "url": "https://api.crossref.org/works/10.1002/lol2.70186",
+          "final_url": "https://api.crossref.org/works/10.1002/lol2.70186",
+          "title": "Crossref record doi:10.1002/lol2.70186: Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:46.515688+00:00",
+          "sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
+          "raw_sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "44ff192e3025cdc3faefb10766361d17b2b6a4f659dfc40b59d9361e19d8e7e7"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124411",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124411",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124411",
+          "title": "Crossref record doi:10.1029/2026gl124411: Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:48.998267+00:00",
+          "sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
+          "raw_sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "41abb890555d6726935ac099934de1e414ad118b7da874e5288e29b9377bf9af"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-joc-70629",
+          "url": "https://api.crossref.org/works/10.1002/joc.70629",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70629",
+          "title": "Crossref record doi:10.1002/joc.70629: Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:56.344804+00:00",
+          "sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
+          "raw_sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "302ded7703e7bf2c6b3938811ccf1d918740d1c2e5f88ea57a1d30be4fe037fe"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-1467-9566-70277",
+          "url": "https://api.crossref.org/works/10.1111/1467-9566.70277",
+          "final_url": "https://api.crossref.org/works/10.1111/1467-9566.70277",
+          "title": "Crossref record doi:10.1111/1467-9566.70277: The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:50.681468+00:00",
+          "sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
+          "raw_sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "7728cbef8fa482a10ab4a6f53bc42c67a84c17f2103d410f68490e0045fb36db"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-jpln-70129",
+          "url": "https://api.crossref.org/works/10.1002/jpln.70129",
+          "final_url": "https://api.crossref.org/works/10.1002/jpln.70129",
+          "title": "Crossref record doi:10.1002/jpln.70129: Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:51.502030+00:00",
+          "sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
+          "raw_sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f0cd9fb06797f1e3ce0257a9d7257fd183c44ab47aa4ca2724c2d674084d1a16"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-joc-70613",
+          "url": "https://api.crossref.org/works/10.1002/joc.70613",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70613",
+          "title": "Crossref record doi:10.1002/joc.70613: Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:57.190074+00:00",
+          "sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
+          "raw_sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "36d190c9c037f29e3cefbf93404c78a9dbefb769df9219b5f685797fa9f2dcbf"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-joc-70605",
+          "url": "https://api.crossref.org/works/10.1002/joc.70605",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70605",
+          "title": "Crossref record doi:10.1002/joc.70605: Climate Change Projections for Mexico in the 21st Century",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:52.592534+00:00",
+          "sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
+          "raw_sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1573319e8895c3c620f64425230023e018988af795ec80ecef31fdbd626862df"
+        },
+        {
+          "id": "source.frontier.doi-10-3176-arch-2026-2-03",
+          "url": "https://api.crossref.org/works/10.3176/arch.2026.2.03",
+          "final_url": "https://api.crossref.org/works/10.3176/arch.2026.2.03",
+          "title": "Crossref record doi:10.3176/arch.2026.2.03: Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from bird",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:53.462516+00:00",
+          "sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
+          "raw_sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b6f2ca5f5588f93a5d229c4541c2ed9e5f5d2cfe7908eab30d90262062d0edf6"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wcc-2026-580",
+          "url": "https://api.crossref.org/works/10.2166/wcc.2026.580",
+          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.580",
+          "title": "Crossref record doi:10.2166/wcc.2026.580: Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of So",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:55.112434+00:00",
+          "sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
+          "raw_sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2f956b3dcf67c160cf573e7ff02d7d8e98d25efc16ad564dc6efa4d15bc2945a"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ijop-70275",
+          "url": "https://api.crossref.org/works/10.1002/ijop.70275",
+          "final_url": "https://api.crossref.org/works/10.1002/ijop.70275",
+          "title": "Crossref record doi:10.1002/ijop.70275: To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:55.923411+00:00",
+          "sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
+          "raw_sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ec4de239d6391a24e62051902b80dadad1bdbde7d0caafaabcef89827a1e816c"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-popecon-10-e186220",
+          "url": "https://api.crossref.org/works/10.3897/popecon.10.e186220",
+          "final_url": "https://api.crossref.org/works/10.3897/popecon.10.e186220",
+          "title": "Crossref record doi:10.3897/popecon.10.e186220: Well-Being Among Married Couples: The Role of Time Allocation",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:56.701947+00:00",
+          "sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
+          "raw_sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2a14fc4a55d678ca1f90bccd9a245774bac43cbe4a6c6326ec3d4d7cb65626a6"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wcc-2026-507",
+          "url": "https://api.crossref.org/works/10.2166/wcc.2026.507",
+          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.507",
+          "title": "Crossref record doi:10.2166/wcc.2026.507: Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:57.585143+00:00",
+          "sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
+          "raw_sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "dcbd521d518afd9b98f9b9a778b40b7827c2615b5991637be5ca443521543273"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
+          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393",
+          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393",
+          "title": "Crossref record doi:10.3897/brics-econ.7.e183393: Stock market reaction to fraud outbreaks in the Indian banking sector",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:58.689592+00:00",
+          "sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
+          "raw_sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5496ecefdb176765ddfab909f354454486e993d436d6b199b5f2c871fd42a58c"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-ehass-2026785",
+          "url": "https://api.crossref.org/works/10.38159/ehass.2026785",
+          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026785",
+          "title": "Crossref record doi:10.38159/ehass.2026785: Does the listener care? Emotional resonance and connection in the age of algorithmic music",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:05:59.508145+00:00",
+          "sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
+          "raw_sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2247f126b9a785ec4e786f785085dc9edd2fd77babdbd8846293ecbedaa1c7fb"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124090",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124090",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124090",
+          "title": "Crossref record doi:10.1029/2026gl124090: How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:00.312045+00:00",
+          "sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
+          "raw_sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0bdd4aa851ae4e2cff03ee4bc78e91c68b4ce1d06355e39573934cb880933671"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-pei3-70207",
+          "url": "https://api.crossref.org/works/10.1002/pei3.70207",
+          "final_url": "https://api.crossref.org/works/10.1002/pei3.70207",
+          "title": "Crossref record doi:10.1002/pei3.70207: Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:01.246038+00:00",
+          "sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
+          "raw_sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "77c51ac5b779fe76735187c776eee841602ed4025dc034fe59ed6342f0d2be16"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-fea2-70077",
+          "url": "https://api.crossref.org/works/10.1002/fea2.70077",
+          "final_url": "https://api.crossref.org/works/10.1002/fea2.70077",
+          "title": "Crossref record doi:10.1002/fea2.70077: Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:02.039510+00:00",
+          "sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
+          "raw_sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "79bebcac2f6efe7fe731646dfea04ce02e78bf2e3fc6cac29d23e66ae533d13c"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-eet-70146",
+          "url": "https://api.crossref.org/works/10.1002/eet.70146",
+          "final_url": "https://api.crossref.org/works/10.1002/eet.70146",
+          "title": "Crossref record doi:10.1002/eet.70146: Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:02.822528+00:00",
+          "sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
+          "raw_sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b9ac529259935e6cda885ce2515639ae42fb5ad6634107ec0596aee1f15aa866"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-eco-70279",
+          "url": "https://api.crossref.org/works/10.1002/eco.70279",
+          "final_url": "https://api.crossref.org/works/10.1002/eco.70279",
+          "title": "Crossref record doi:10.1002/eco.70279: Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:03.664221+00:00",
+          "sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
+          "raw_sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "08ff519ca5da264609541eea62b2d05a6d1d0f7930b7e56d7b9c31f52cee1726"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124233",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124233",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124233",
+          "title": "Crossref record doi:10.1029/2026gl124233: Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:05.356489+00:00",
+          "sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
+          "raw_sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ff3ff876e8a710c6abed9b024e551be67b41bfdc053301ec9ef50409f5908786"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gc013127",
+          "url": "https://api.crossref.org/works/10.1029/2026gc013127",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gc013127",
+          "title": "Crossref record doi:10.1029/2026gc013127: OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Perm",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:06.398814+00:00",
+          "sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
+          "raw_sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "22e7b4367120013e083474cfcf5cc1cda1913024c528ce26d0f43ac0c6bb4731"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-qj-70320",
+          "url": "https://api.crossref.org/works/10.1002/qj.70320",
+          "final_url": "https://api.crossref.org/works/10.1002/qj.70320",
+          "title": "Crossref record doi:10.1002/qj.70320: Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:58.048502+00:00",
+          "sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
+          "raw_sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ff1ac3e12cf234378316737550a0e46e21efcf813beb53e2c87f7893594ef9b1"
+        },
+        {
+          "id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
+          "url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01",
+          "final_url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01",
+          "title": "Crossref record doi:10.54929/2786-5738-2026-27-09-01: Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:08.987338+00:00",
+          "sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
+          "raw_sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "de7394acd998984c6547e265f61ab0a94bc31d6af1ca39184d9a6664971dd833"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-erats-20261281",
+          "url": "https://api.crossref.org/works/10.38159/erats.20261281",
+          "final_url": "https://api.crossref.org/works/10.38159/erats.20261281",
+          "title": "Crossref record doi:10.38159/erats.20261281: Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:58.939730+00:00",
+          "sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
+          "raw_sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "afb4ef0824d188d4fdabd968048db356cb9c32bb1f92a8353a86b4041627b1d7"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-eco-70277",
+          "url": "https://api.crossref.org/works/10.1002/eco.70277",
+          "final_url": "https://api.crossref.org/works/10.1002/eco.70277",
+          "title": "Crossref record doi:10.1002/eco.70277: From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coast",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:11.501100+00:00",
+          "sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
+          "raw_sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "49e96147d206f2b12ee25918711f31617c7546689c32660066ad9218cecd0102"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-iroh-70046",
+          "url": "https://api.crossref.org/works/10.1002/iroh.70046",
+          "final_url": "https://api.crossref.org/works/10.1002/iroh.70046",
+          "title": "Crossref record doi:10.1002/iroh.70046: Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:34:59.751625+00:00",
+          "sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
+          "raw_sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "bc0078a066f8139ab8eb945bc2a1b035c58964d66056c66f3c715d8d1efbb108"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-erats-20261284",
+          "url": "https://api.crossref.org/works/10.38159/erats.20261284",
+          "final_url": "https://api.crossref.org/works/10.38159/erats.20261284",
+          "title": "Crossref record doi:10.38159/erats.20261284: The irony of law and faith in corruption",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:00.515511+00:00",
+          "sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
+          "raw_sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6d3ebf0ce7907880da12e14d012c47ce0324fbda7e2c46962b0fa36c808b18a3"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ruso-70070",
+          "url": "https://api.crossref.org/works/10.1111/ruso.70070",
+          "final_url": "https://api.crossref.org/works/10.1111/ruso.70070",
+          "title": "Crossref record doi:10.1111/ruso.70070: Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:13.451451+00:00",
+          "sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
+          "raw_sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6c89799ee8629b7d71012f2c13b108b65b4b8f22cb49eedc152a4fa3e2d4b55b"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-nhcm-3-200681",
+          "url": "https://api.crossref.org/works/10.3897/nhcm.3.200681",
+          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.200681",
+          "title": "Crossref record doi:10.3897/nhcm.3.200681: Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:15.575843+00:00",
+          "sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
+          "raw_sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "990307098fe7b9e0714b7f09222fb462ba31fc40458a68efacd8860d43ab3234"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0001005",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005",
+          "title": "Crossref record doi:10.1371/journal.pclm.0001005: Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:17.945108+00:00",
+          "sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
+          "raw_sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "016d4bcd7a893a774c7e791e9040ce5410b3bc0c9b2e56368a7a839162c66e45"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-moth-70148",
+          "url": "https://api.crossref.org/works/10.1111/moth.70148",
+          "final_url": "https://api.crossref.org/works/10.1111/moth.70148",
+          "title": "Crossref record doi:10.1111/moth.70148: On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:18.760979+00:00",
+          "sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
+          "raw_sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c3151f7d7efbb3b466eb9eb16765f9965374bb4d98ca16075cb240eeff39502d"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-ehass-20267724",
+          "url": "https://api.crossref.org/works/10.38159/ehass.20267724",
+          "final_url": "https://api.crossref.org/works/10.38159/ehass.20267724",
+          "title": "Crossref record doi:10.38159/ehass.20267724: Leveraging community partnership: The case of Meraka Cultural Village",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:19.559872+00:00",
+          "sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
+          "raw_sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e4479ace19f6dd1ebf7768d3c123d0d2ed3a7153544d377432c0f7502b59e351"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124881",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124881",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124881",
+          "title": "Crossref record doi:10.1029/2026gl124881: Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:20.401221+00:00",
+          "sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
+          "raw_sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "719f3c24e07ec19319a27da855519a0d001f6804d4bf5fdc8d74fdb4b49fb388"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026jh001578",
+          "url": "https://api.crossref.org/works/10.1029/2026jh001578",
+          "final_url": "https://api.crossref.org/works/10.1029/2026jh001578",
+          "title": "Crossref record doi:10.1029/2026jh001578: Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:01.345420+00:00",
+          "sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
+          "raw_sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "52e9097cff5617ea55f0bcb6d88306c3de8e20f85dff389c9004d60c197b07b2"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-gdj3-70104",
+          "url": "https://api.crossref.org/works/10.1002/gdj3.70104",
+          "final_url": "https://api.crossref.org/works/10.1002/gdj3.70104",
+          "title": "Crossref record doi:10.1002/gdj3.70104: Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:02.172245+00:00",
+          "sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
+          "raw_sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "617d089aee0d4d7836e4ebc036aaf1e096081d18e49a360f06815339e84e3ff5"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl122610",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122610",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122610",
+          "title": "Crossref record doi:10.1029/2026gl122610: Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:03.040868+00:00",
+          "sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
+          "raw_sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "da371e5cdff5054c20ab49e432bf1f63ab262d7f867f802a49af8868bd56ab91"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-qj-70308",
+          "url": "https://api.crossref.org/works/10.1002/qj.70308",
+          "final_url": "https://api.crossref.org/works/10.1002/qj.70308",
+          "title": "Crossref record doi:10.1002/qj.70308: Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:03.867898+00:00",
+          "sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
+          "raw_sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4761bd25e4fb32901da7b7e971608cb842bb04466e84888f57f919906aec5cea"
+        },
+        {
+          "id": "source.frontier.doi-10-55730-1300-0632-4281",
+          "url": "https://api.crossref.org/works/10.55730/1300-0632.4281",
+          "final_url": "https://api.crossref.org/works/10.55730/1300-0632.4281",
+          "title": "Crossref record doi:10.55730/1300-0632.4281: Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:26.468516+00:00",
+          "sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
+          "raw_sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6c97eca98cd8eeb9b1c34f9245da2aa037e5ce34eaccebea84082404865c4365"
+        },
+        {
+          "id": "source.frontier.doi-10-55730-1300-0632-4275",
+          "url": "https://api.crossref.org/works/10.55730/1300-0632.4275",
+          "final_url": "https://api.crossref.org/works/10.55730/1300-0632.4275",
+          "title": "Crossref record doi:10.55730/1300-0632.4275: Empowering edge intelligence through reparameterized lightweight transformers and distributed inference",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:27.288364+00:00",
+          "sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
+          "raw_sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1d4e0053d62e97433865e9fb12b29fb05abe0de5de9c3cc5f42c6865d08a9ad1"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-eet-70139",
+          "url": "https://api.crossref.org/works/10.1002/eet.70139",
+          "final_url": "https://api.crossref.org/works/10.1002/eet.70139",
+          "title": "Crossref record doi:10.1002/eet.70139: After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:31.081899+00:00",
+          "sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
+          "raw_sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d7bb021d2019dd2793de88b860d0dfe5df8779a994f1665e86b4a43ce2e5842e"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-jclp-70212",
+          "url": "https://api.crossref.org/works/10.1002/jclp.70212",
+          "final_url": "https://api.crossref.org/works/10.1002/jclp.70212",
+          "title": "Crossref record doi:10.1002/jclp.70212: Distant and Distressed: Interpersonal Problems in Anxiety and Depression",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:32.793417+00:00",
+          "sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
+          "raw_sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1b31ed40972f32f6c60d04abfce11bc58eed0013f94569ee93069caa0c749f5c"
+        },
+        {
+          "id": "source.frontier.doi-10-12944-cwe-21-2-3",
+          "url": "https://api.crossref.org/works/10.12944/cwe.21.2.3",
+          "final_url": "https://api.crossref.org/works/10.12944/cwe.21.2.3",
+          "title": "Crossref record doi:10.12944/cwe.21.2.3: Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:35.264274+00:00",
+          "sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
+          "raw_sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "776dcb905988c35debf16070c71510df4455d804b8d1be834a2a2bab36066d76"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-bse-71470",
+          "url": "https://api.crossref.org/works/10.1002/bse.71470",
+          "final_url": "https://api.crossref.org/works/10.1002/bse.71470",
+          "title": "Crossref record doi:10.1002/bse.71470: Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:37.824644+00:00",
+          "sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
+          "raw_sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c90897cae4fa8c5538d320f9b74f00e20970a9f97dd8cc84021ea3a802fc816f"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000986",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000986: Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:39.484154+00:00",
+          "sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
+          "raw_sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8273fa85027762cc424aa21f2f538e880e6c30f468744bc545161a35ee8d6b8a"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-1752-1688-70151",
+          "url": "https://api.crossref.org/works/10.1111/1752-1688.70151",
+          "final_url": "https://api.crossref.org/works/10.1111/1752-1688.70151",
+          "title": "Crossref record doi:10.1111/1752-1688.70151: Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:04.660297+00:00",
+          "sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
+          "raw_sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "02d23ada2e0f5c2b0122fc6632803918676942ce5323d5f9589394c64cb3cc4b"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-jade-70048",
+          "url": "https://api.crossref.org/works/10.1111/jade.70048",
+          "final_url": "https://api.crossref.org/works/10.1111/jade.70048",
+          "title": "Crossref record doi:10.1111/jade.70048: A Visual Brainstorming Technique in Character Design: Braindrawing",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:41.889675+00:00",
+          "sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
+          "raw_sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d132128d7d8975811b815cf27c3c2f0631732003b4c78f952d3cef0dc8c086e8"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-lcrp-70059",
+          "url": "https://api.crossref.org/works/10.1111/lcrp.70059",
+          "final_url": "https://api.crossref.org/works/10.1111/lcrp.70059",
+          "title": "Crossref record doi:10.1111/lcrp.70059: Prison victimization and post‐release outcomes: A systematic review",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:42.772956+00:00",
+          "sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
+          "raw_sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "cb13f2c91e7b187a77df2be2c26af9ff1ff5246c8712b9fd68f0a1902e9f71f2"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-adfm-77938",
+          "url": "https://api.crossref.org/works/10.1002/adfm.77938",
+          "final_url": "https://api.crossref.org/works/10.1002/adfm.77938",
+          "title": "Crossref record doi:10.1002/adfm.77938: Load Distributing Metamaterials Via Discrete Optimization",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:45.195569+00:00",
+          "sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
+          "raw_sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b1e17ba2c06fc4ff39acbd2d40d8e8811ddc4a5e320e86834a63f5c3cc8cb44e"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
+          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197",
+          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197",
+          "title": "Crossref record doi:10.3897/brics-econ.7.e185197: Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:46.059314+00:00",
+          "sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
+          "raw_sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "eca10de834e8c11d5af689bbb1b8d5e3bf0bf1d7dcf72b8da7db2840d02343db"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl125327",
+          "url": "https://api.crossref.org/works/10.1029/2026gl125327",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl125327",
+          "title": "Crossref record doi:10.1029/2026gl125327: Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:05.474647+00:00",
+          "sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
+          "raw_sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0507e2d16f3d74de18e2ad52ac70a46ba2a5e58c6e2a927321848ac424f7c7ef"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-qj-70302",
+          "url": "https://api.crossref.org/works/10.1002/qj.70302",
+          "final_url": "https://api.crossref.org/works/10.1002/qj.70302",
+          "title": "Crossref record doi:10.1002/qj.70302: Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:06.248588+00:00",
+          "sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
+          "raw_sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "478ced40f319edfb52a0c51c43e15cc6434143e5a7625442c4dbfc3072e83645"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000930",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000930: Countering climate misinformation with large language models: Evidence from ChatGPT",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:46.910752+00:00",
+          "sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
+          "raw_sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4c4f1310ae5a99db5a1b4d46c1ac2232288256af7bdb54732220c1f54a0a6911"
+        },
+        {
+          "id": "source.frontier.doi-10-1098-rsnr-2026-0030",
+          "url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030",
+          "final_url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030",
+          "title": "Crossref record doi:10.1098/rsnr.2026.0030: Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:47.687953+00:00",
+          "sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
+          "raw_sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "bf8137518d4aa78c69f94d80f4b0dbd00a2333d00d89912343d03f7330f8b53a"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-cli2-70062",
+          "url": "https://api.crossref.org/works/10.1002/cli2.70062",
+          "final_url": "https://api.crossref.org/works/10.1002/cli2.70062",
+          "title": "Crossref record doi:10.1002/cli2.70062: Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and ",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:48.518124+00:00",
+          "sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
+          "raw_sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d346bccf267fc15ff49d7e6823d7d1e07cd4d068a9146525e6aabaa919074e4f"
+        },
+        {
+          "id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
+          "url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974",
+          "final_url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974",
+          "title": "Crossref record doi:10.11591/ijeecs.v43.i3.pp965-974: Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:49.294780+00:00",
+          "sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
+          "raw_sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "dae6ce72c72dec15dd565926304704a339eda66d5f64739a510436dbe6b4bec0"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ejed-70852",
+          "url": "https://api.crossref.org/works/10.1111/ejed.70852",
+          "final_url": "https://api.crossref.org/works/10.1111/ejed.70852",
+          "title": "Crossref record doi:10.1111/ejed.70852: The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:51.012933+00:00",
+          "sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
+          "raw_sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "aabb1dcb30ba2585109d062716f0f465029b3f8674d2b969a2d490e55455cefc"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ejed-70845",
+          "url": "https://api.crossref.org/works/10.1111/ejed.70845",
+          "final_url": "https://api.crossref.org/works/10.1111/ejed.70845",
+          "title": "Crossref record doi:10.1111/ejed.70845: Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Env",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:51.857938+00:00",
+          "sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
+          "raw_sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f25040b20fd748e5c769ba8bee689a166cd64b5c832d0f34d9d0e9a510b7997b"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0001039",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039",
+          "title": "Crossref record doi:10.1371/journal.pclm.0001039: From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:53.464354+00:00",
+          "sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
+          "raw_sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6aca726671936a6b4f435166c2a1ac72e5ab6088c187984ddc554730151ff449"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-nup-70114",
+          "url": "https://api.crossref.org/works/10.1111/nup.70114",
+          "final_url": "https://api.crossref.org/works/10.1111/nup.70114",
+          "title": "Crossref record doi:10.1111/nup.70114: A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:54.289133+00:00",
+          "sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
+          "raw_sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c5f9c356eb3de82a336f79cfc059751d35a73e370981eb884c6a1342f89ba879"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ejss-70414",
+          "url": "https://api.crossref.org/works/10.1111/ejss.70414",
+          "final_url": "https://api.crossref.org/works/10.1111/ejss.70414",
+          "title": "Crossref record doi:10.1111/ejss.70414: Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:55.115497+00:00",
+          "sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
+          "raw_sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1ef02e00593ef9bfb9c50e6b128be7d7abdff148906ca8d9dba5cf2263aa7748"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026wr044293",
+          "url": "https://api.crossref.org/works/10.1029/2026wr044293",
+          "final_url": "https://api.crossref.org/works/10.1029/2026wr044293",
+          "title": "Crossref record doi:10.1029/2026wr044293: Morphological State Transitions and Sediment Transport Variability in Braided Rivers",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:06:57.584140+00:00",
+          "sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
+          "raw_sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0cfa1200e53612ab88dd9f320455f87f0b4b9212780861dbc385f828fd933e34"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-esp-70399",
+          "url": "https://api.crossref.org/works/10.1002/esp.70399",
+          "final_url": "https://api.crossref.org/works/10.1002/esp.70399",
+          "title": "Crossref record doi:10.1002/esp.70399: Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince Will",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:07.079393+00:00",
+          "sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
+          "raw_sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "00030ea44b50ed3b7f4dd5dc2549693f35df2176682bb08d260365348130b800"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-jqs-70108",
+          "url": "https://api.crossref.org/works/10.1002/jqs.70108",
+          "final_url": "https://api.crossref.org/works/10.1002/jqs.70108",
+          "title": "Crossref record doi:10.1002/jqs.70108: A talus rock glacier in Nantlle Valley, North Wales",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:01.899130+00:00",
+          "sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
+          "raw_sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f5e3a85d5f9dfd869bdf2f7935b31db67b2aa4b73e4f6585af4f9b94ec0d8f8d"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026jd046723",
+          "url": "https://api.crossref.org/works/10.1029/2026jd046723",
+          "final_url": "https://api.crossref.org/works/10.1029/2026jd046723",
+          "title": "Crossref record doi:10.1029/2026jd046723: High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:03.495559+00:00",
+          "sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
+          "raw_sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6440f939d18621e867041cc98a46577ebdbbd78966f5eb6ca6f84444d6121d2a"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-msd2-70089",
+          "url": "https://api.crossref.org/works/10.1002/msd2.70089",
+          "final_url": "https://api.crossref.org/works/10.1002/msd2.70089",
+          "title": "Crossref record doi:10.1002/msd2.70089: Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:04.307497+00:00",
+          "sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
+          "raw_sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "01b70241edd77ff87ee41058529d833e9ea54545274ad1ad3cdd8644a1e3f488"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ijal-70342",
+          "url": "https://api.crossref.org/works/10.1111/ijal.70342",
+          "final_url": "https://api.crossref.org/works/10.1111/ijal.70342",
+          "title": "Crossref record doi:10.1111/ijal.70342: Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German C",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:07.222217+00:00",
+          "sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
+          "raw_sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "21c52bd926467ce3862b9e44104641a163b797c8146dff46d4b6a83d87a9bfec"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-cli2-70059",
+          "url": "https://api.crossref.org/works/10.1002/cli2.70059",
+          "final_url": "https://api.crossref.org/works/10.1002/cli2.70059",
+          "title": "Crossref record doi:10.1002/cli2.70059: Uncertainty Quantification and Attribution for Resilient Infrastructure Systems",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:08.305640+00:00",
+          "sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
+          "raw_sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1655df34e130224e4ad2f3426bdf0fc7e47b4e48e475d9cd67e770a47b05da42"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124727",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124727",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124727",
+          "title": "Crossref record doi:10.1029/2026gl124727: Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:07.927197+00:00",
+          "sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
+          "raw_sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "9ec497ec98a20fcfb685e30f0d9d00e779eca5a5b7a0c6a09c92ae5edbb259aa"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000877",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000877: The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:09.336393+00:00",
+          "sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
+          "raw_sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2bda59da56510db1d157a80cf129232c16b7376061bf0d02dfc82709826cc77a"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-jmg-70054",
+          "url": "https://api.crossref.org/works/10.1111/jmg.70054",
+          "final_url": "https://api.crossref.org/works/10.1111/jmg.70054",
+          "title": "Crossref record doi:10.1111/jmg.70054: Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:10.713225+00:00",
+          "sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
+          "raw_sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6bcff6e10de5f0479461013d7a87599a1b720376dc2a6bd081d1252b0cca6708"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-moth-70134",
+          "url": "https://api.crossref.org/works/10.1111/moth.70134",
+          "final_url": "https://api.crossref.org/works/10.1111/moth.70134",
+          "title": "Crossref record doi:10.1111/moth.70134: Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:15.246334+00:00",
+          "sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
+          "raw_sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1d7256f9248c96372299dc746bc8c227a58698909569c7d1f7d0238f37a17426"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-gwat-70098",
+          "url": "https://api.crossref.org/works/10.1111/gwat.70098",
+          "final_url": "https://api.crossref.org/works/10.1111/gwat.70098",
+          "title": "Crossref record doi:10.1111/gwat.70098: Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:18.846431+00:00",
+          "sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
+          "raw_sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6405b7d6164743092e1df6f2d8096ac724d21cf7d82411b63153ce6900a096e8"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wp-2026-018",
+          "url": "https://api.crossref.org/works/10.2166/wp.2026.018",
+          "final_url": "https://api.crossref.org/works/10.2166/wp.2026.018",
+          "title": "Crossref record doi:10.2166/wp.2026.018: A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:08.755544+00:00",
+          "sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
+          "raw_sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "30a3c6c1258f8eb0280e05168a8c006e3f3d6bf34f30531b7e8d6bc46d61d7a9"
+        },
+        {
+          "id": "source.frontier.doi-10-1098-rsta-2025-0107",
+          "url": "https://api.crossref.org/works/10.1098/rsta.2025.0107",
+          "final_url": "https://api.crossref.org/works/10.1098/rsta.2025.0107",
+          "title": "Crossref record doi:10.1098/rsta.2025.0107: Merits of geometric algebra applied to cryptography and machine learning",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:09.527543+00:00",
+          "sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
+          "raw_sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5764032edbb95f73939b883436e8a2fb990b00d1a715195c16aab9bff35263be"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000931",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000931: Mapping climate-related forest risks: An index-based approach",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:21.871414+00:00",
+          "sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
+          "raw_sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c039be698fd1455c8f60d669c1c43cfeb201546bc77d6d297e101686c3a04a9a"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl122646",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122646",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122646",
+          "title": "Crossref record doi:10.1029/2026gl122646: Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:10.319619+00:00",
+          "sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
+          "raw_sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6e4fc27742a9440c7b3de4ba32f748061c235bdfa5b2cb78f283a22d82d928bd"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ppp-70058",
+          "url": "https://api.crossref.org/works/10.1002/ppp.70058",
+          "final_url": "https://api.crossref.org/works/10.1002/ppp.70058",
+          "title": "Crossref record doi:10.1002/ppp.70058: Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:11.140470+00:00",
+          "sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
+          "raw_sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5ace1addadfee13d117287711615e4b2d0473b7444a5e226fe59074c5b19d32e"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-jpln-70107",
+          "url": "https://api.crossref.org/works/10.1002/jpln.70107",
+          "final_url": "https://api.crossref.org/works/10.1002/jpln.70107",
+          "title": "Crossref record doi:10.1002/jpln.70107: The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:25.369420+00:00",
+          "sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
+          "raw_sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "35eb4419de5595a96136ea1784257158e963c74fff0a9925dacb7eef7982577f"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-nhcm-3-187529",
+          "url": "https://api.crossref.org/works/10.3897/nhcm.3.187529",
+          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.187529",
+          "title": "Crossref record doi:10.3897/nhcm.3.187529: Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:26.541804+00:00",
+          "sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
+          "raw_sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "53fbbc5b1bbc948a4768b288a64cc45a057520419822f436fbaa014d8beb58ab"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-ehass-2026775",
+          "url": "https://api.crossref.org/works/10.38159/ehass.2026775",
+          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026775",
+          "title": "Crossref record doi:10.38159/ehass.2026775: Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:28.150938+00:00",
+          "sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
+          "raw_sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b2f5ae7f6c8bc767ce0034348569e6d9c2c63e3bc46ceb805311b3ea69722320"
+        },
+        {
+          "id": "source.frontier.doi-10-38159-ehass-2026774",
+          "url": "https://api.crossref.org/works/10.38159/ehass.2026774",
+          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026774",
+          "title": "Crossref record doi:10.38159/ehass.2026774: Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Pall",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:29.631125+00:00",
+          "sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
+          "raw_sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5b3b7e037f042877ca2ec9ab6aa39393855a55422ceae364d919e15e8b248209"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-hec-70140",
+          "url": "https://api.crossref.org/works/10.1002/hec.70140",
+          "final_url": "https://api.crossref.org/works/10.1002/hec.70140",
+          "title": "Crossref record doi:10.1002/hec.70140: Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:32.140027+00:00",
+          "sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
+          "raw_sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8101c6b862f1c572e90fd3056c865a6b9ecb9d1c216a3458153b9266593e1520"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-tox-70177",
+          "url": "https://api.crossref.org/works/10.1002/tox.70177",
+          "final_url": "https://api.crossref.org/works/10.1002/tox.70177",
+          "title": "Crossref record doi:10.1002/tox.70177: Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:12.874394+00:00",
+          "sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
+          "raw_sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4d62e646c7a0d72a362ef43648a284a5aced5f7e503fdb806e106106f2eb88fb"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-adfm-77585",
+          "url": "https://api.crossref.org/works/10.1002/adfm.77585",
+          "final_url": "https://api.crossref.org/works/10.1002/adfm.77585",
+          "title": "Crossref record doi:10.1002/adfm.77585: An Electrowetting Pump",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:33.002358+00:00",
+          "sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
+          "raw_sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0e71b955b583f88ba08ca00362cfd55c0862a58b94a5271539f5ee4694a95ed5"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-1467-9566-70245",
+          "url": "https://api.crossref.org/works/10.1111/1467-9566.70245",
+          "final_url": "https://api.crossref.org/works/10.1111/1467-9566.70245",
+          "title": "Crossref record doi:10.1111/1467-9566.70245: The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:47.584739+00:00",
+          "sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
+          "raw_sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ad1757e88841f4f46a374c40e8152cbb54037d39cbbcecbdf3cdd92ac6587bbe"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ijal-70337",
+          "url": "https://api.crossref.org/works/10.1111/ijal.70337",
+          "final_url": "https://api.crossref.org/works/10.1111/ijal.70337",
+          "title": "Crossref record doi:10.1111/ijal.70337: Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:34.721728+00:00",
+          "sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
+          "raw_sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "37b8ef9d00abbd071cc308b8e2e1101459346cd88f02b8929447545b600477b5"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl123821",
+          "url": "https://api.crossref.org/works/10.1029/2026gl123821",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl123821",
+          "title": "Crossref record doi:10.1029/2026gl123821: Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:35.786606+00:00",
+          "sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
+          "raw_sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "155729c68765c006c9b67f9a4295c62d8be419e06dbd0ed34ccd699addd2a6b9"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-qj-70252",
+          "url": "https://api.crossref.org/works/10.1002/qj.70252",
+          "final_url": "https://api.crossref.org/works/10.1002/qj.70252",
+          "title": "Crossref record doi:10.1002/qj.70252: Using microwave imager observations to improve the ocean temperature in a coupled NWP system",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:42.226951+00:00",
+          "sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
+          "raw_sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b63943df4354fe17759f8c75d0c5c7cf3b7966e17550bba333953e654897fc43"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-joc-70540",
+          "url": "https://api.crossref.org/works/10.1002/joc.70540",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70540",
+          "title": "Crossref record doi:10.1002/joc.70540: Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:14.478896+00:00",
+          "sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
+          "raw_sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ca3e130315fa59a94e5c06b31490381f55226678f0eefd154c3c6321eec0df00"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-eje-70266",
+          "url": "https://api.crossref.org/works/10.1111/eje.70266",
+          "final_url": "https://api.crossref.org/works/10.1111/eje.70266",
+          "title": "Crossref record doi:10.1111/eje.70266: Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:48.400405+00:00",
+          "sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
+          "raw_sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1aef0bd754b3eb839e70768c8760e629b6fc117a21e0063897434bf953fe6c1a"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ecpo-70064",
+          "url": "https://api.crossref.org/works/10.1111/ecpo.70064",
+          "final_url": "https://api.crossref.org/works/10.1111/ecpo.70064",
+          "title": "Crossref record doi:10.1111/ecpo.70064: Chinese Lending and Sovereign Debt Distress in Developing Countries",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:49.242299+00:00",
+          "sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
+          "raw_sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "7f0df4b1b5fc92a486f5c893c865af5b0fb61c11a988690618f1703fa10f877d"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-beer-70139",
+          "url": "https://api.crossref.org/works/10.1111/beer.70139",
+          "final_url": "https://api.crossref.org/works/10.1111/beer.70139",
+          "title": "Crossref record doi:10.1111/beer.70139: Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:49.047016+00:00",
+          "sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
+          "raw_sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d43f0750c2344166dc940821271817e5d68792f866752e9b961e9e99749acfbd"
+        },
+        {
+          "id": "source.frontier.doi-10-1098-rsta-2025-0029",
+          "url": "https://api.crossref.org/works/10.1098/rsta.2025.0029",
+          "final_url": "https://api.crossref.org/works/10.1098/rsta.2025.0029",
+          "title": "Crossref record doi:10.1098/rsta.2025.0029: The many faces of rotating quantum turbulence",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:15.312185+00:00",
+          "sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
+          "raw_sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f68ba59fc8c56789653e6c649ba914c1947ecbbdc25f40c64b37e87411e0552a"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124661",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124661",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124661",
+          "title": "Crossref record doi:10.1029/2026gl124661: How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:50.595583+00:00",
+          "sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
+          "raw_sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1d35983a6d8b359b9733c291d2d08c2ee82377d5b7813717abcf781964e88932"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025jc023581",
+          "url": "https://api.crossref.org/works/10.1029/2025jc023581",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jc023581",
+          "title": "Crossref record doi:10.1029/2025jc023581: Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:52.156366+00:00",
+          "sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
+          "raw_sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ffb1e9893f9ef7ed74e19f4bdd579c3353da4ce21b8d82b18afc114ed47e827b"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025jb032632",
+          "url": "https://api.crossref.org/works/10.1029/2025jb032632",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jb032632",
+          "title": "Crossref record doi:10.1029/2025jb032632: Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:53.717585+00:00",
+          "sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
+          "raw_sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f7c044f87e72eb7d913428101a740be426c816eb9805f99ffa446261f45e7c95"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-joc-70526",
+          "url": "https://api.crossref.org/works/10.1002/joc.70526",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70526",
+          "title": "Crossref record doi:10.1002/joc.70526: Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:17.786167+00:00",
+          "sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
+          "raw_sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e1a7c9ee51baa6bc1cf7f8349c41f78d14cd27977546d662c232cd4d9546c74f"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-saje-70032",
+          "url": "https://api.crossref.org/works/10.1111/saje.70032",
+          "final_url": "https://api.crossref.org/works/10.1111/saje.70032",
+          "title": "Crossref record doi:10.1111/saje.70032: The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:50.298425+00:00",
+          "sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
+          "raw_sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "542370d55c3070811557ce865119beabeb21403b35533c22394e0b3ba7b81887"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl124111",
+          "url": "https://api.crossref.org/works/10.1029/2026gl124111",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl124111",
+          "title": "Crossref record doi:10.1029/2026gl124111: Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:55.593848+00:00",
+          "sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
+          "raw_sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "d59ab5e8b1d8bca13778dfadf7fca264346553314bb5800d0a9d5c43f723d850"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ejed-70772",
+          "url": "https://api.crossref.org/works/10.1111/ejed.70772",
+          "final_url": "https://api.crossref.org/works/10.1111/ejed.70772",
+          "title": "Crossref record doi:10.1111/ejed.70772: Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:51.202553+00:00",
+          "sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
+          "raw_sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8d5c2547bdfadd770297f954854d2c7a49edd0b2911300096f5231639e463a81"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl122539",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122539",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122539",
+          "title": "Crossref record doi:10.1029/2026gl122539: SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:59.052033+00:00",
+          "sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
+          "raw_sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0c0c785074d76dddea1051fef4f30d5ea477a169298e501e1c4d19dcff5a9cb2"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ijal-70310",
+          "url": "https://api.crossref.org/works/10.1111/ijal.70310",
+          "final_url": "https://api.crossref.org/works/10.1111/ijal.70310",
+          "title": "Crossref record doi:10.1111/ijal.70310: Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:07:59.854913+00:00",
+          "sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
+          "raw_sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8a162f3a6e1add74daccba745d56189b70a2b9dddbe0f945f18aa1ab59a28e9d"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-adfm-76901",
+          "url": "https://api.crossref.org/works/10.1002/adfm.76901",
+          "final_url": "https://api.crossref.org/works/10.1002/adfm.76901",
+          "title": "Crossref record doi:10.1002/adfm.76901: Implantable Ionic Memristors Based on Natural Polymer Heterojunctions",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:00.684746+00:00",
+          "sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
+          "raw_sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ffb93cfe2a5e18f7215d062d6e163bdcc6bdb8c1a068319e040cd625e603bb3e"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-nzm2-70056",
+          "url": "https://api.crossref.org/works/10.1002/nzm2.70056",
+          "final_url": "https://api.crossref.org/works/10.1002/nzm2.70056",
+          "title": "Crossref record doi:10.1002/nzm2.70056: Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:18.618680+00:00",
+          "sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
+          "raw_sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4e035d0f6dff9002f6fe20c0025462756ae14ac428f2df4a3a3e30f5e9c19cec"
+        },
+        {
+          "id": "source.frontier.doi-10-1144-jgs2026-026",
+          "url": "https://api.crossref.org/works/10.1144/jgs2026-026",
+          "final_url": "https://api.crossref.org/works/10.1144/jgs2026-026",
+          "title": "Crossref record doi:10.1144/jgs2026-026: Origin of river terraces by isostatic unloading of the lithosphere",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:19.410602+00:00",
+          "sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
+          "raw_sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4acbffda785dc95a39bb1ad09f1280b7e3bb9e2fc6ba99759d665d6af9ddd52a"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ejed-70766",
+          "url": "https://api.crossref.org/works/10.1111/ejed.70766",
+          "final_url": "https://api.crossref.org/works/10.1111/ejed.70766",
+          "title": "Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:52.481028+00:00",
+          "sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+          "raw_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "938a315bc8ba6a705b982dc8e6d1d64f62cc6c2e425e8fd04f194b251eb9072c"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-sce-70090",
+          "url": "https://api.crossref.org/works/10.1002/sce.70090",
+          "final_url": "https://api.crossref.org/works/10.1002/sce.70090",
+          "title": "Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:20:42.136278+00:00",
+          "sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+          "raw_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b1dbafa99abe2c2638420037a4c6534ade08781058586781074968becd01eafc"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ppp-70053",
+          "url": "https://api.crossref.org/works/10.1002/ppp.70053",
+          "final_url": "https://api.crossref.org/works/10.1002/ppp.70053",
+          "title": "Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:20.200519+00:00",
+          "sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+          "raw_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "43ab5569c5d29fa99230fa983c7fa217268789d6102c13110089cbf9618d0e50"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ese3-70603",
+          "url": "https://api.crossref.org/works/10.1002/ese3.70603",
+          "final_url": "https://api.crossref.org/works/10.1002/ese3.70603",
+          "title": "Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:05.729327+00:00",
+          "sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+          "raw_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b7abefaff40c43fdd379fb95baff1d347cf1ee96ca802013e479cc2703590c00"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025jd046190",
+          "url": "https://api.crossref.org/works/10.1029/2025jd046190",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jd046190",
+          "title": "Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:21.015940+00:00",
+          "sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+          "raw_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "44d50986e88aea616f9f6cdd6ace1fdb856bcaa89c5e2741ab42c76b0473838f"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025gl121323",
+          "url": "https://api.crossref.org/works/10.1029/2025gl121323",
+          "final_url": "https://api.crossref.org/works/10.1029/2025gl121323",
+          "title": "Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:07.062335+00:00",
+          "sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+          "raw_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "a3ae3ca00ebd2d9a4cb280f5da89b2e3ee5f69b204827cab34b583a218eabf43"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ijfe-70259",
+          "url": "https://api.crossref.org/works/10.1002/ijfe.70259",
+          "final_url": "https://api.crossref.org/works/10.1002/ijfe.70259",
+          "title": "Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:54.464223+00:00",
+          "sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+          "raw_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "9a5d72376d62193d055680e2a75f87e6c6e39c4f94fd538ecc7a87fa5d477f8b"
+        },
+        {
+          "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
+          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696",
+          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696",
+          "title": "Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:14.405434+00:00",
+          "sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+          "raw_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "00a94cb1e9701a469e60ef7f85629500092c5ada184c8ec0f9a160987a743bbb"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-aphw-70185",
+          "url": "https://api.crossref.org/works/10.1111/aphw.70185",
+          "final_url": "https://api.crossref.org/works/10.1111/aphw.70185",
+          "title": "Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:56.038222+00:00",
+          "sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+          "raw_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "dbda48ee422d1821299b127458098f26219c8116cb7438847070b427be769701"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026jh001250",
+          "url": "https://api.crossref.org/works/10.1029/2026jh001250",
+          "final_url": "https://api.crossref.org/works/10.1029/2026jh001250",
+          "title": "Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:15.244714+00:00",
+          "sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+          "raw_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b7edc25c1be10dd4d505ce4eca04207ba655ea62fafb1e94eb898b8857c9a2bc"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl122518",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122518",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122518",
+          "title": "Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:21.804378+00:00",
+          "sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+          "raw_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e34842ffeb201bd830da6669374ca5aab041e573dbe9478f2fe694a10d235476"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
+          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739",
+          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739",
+          "title": "Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:56.896953+00:00",
+          "sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+          "raw_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6d4b806da854fd0a6ca528da9828f9e5894bded713c0c27e5781ba0c6a79addb"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-jmg-70045",
+          "url": "https://api.crossref.org/works/10.1111/jmg.70045",
+          "final_url": "https://api.crossref.org/works/10.1111/jmg.70045",
+          "title": "Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:21.219245+00:00",
+          "sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+          "raw_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "9a680f910da2a0d21c2273f9284af579bbaf4a46ef52a769a656943e8c1caaf7"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ppp-70049",
+          "url": "https://api.crossref.org/works/10.1002/ppp.70049",
+          "final_url": "https://api.crossref.org/works/10.1002/ppp.70049",
+          "title": "Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:22.642301+00:00",
+          "sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+          "raw_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "74b12793c36606dde0eed8401bd14a3e48656de0158328d5066a2bd3ab2b732b"
+        },
+        {
+          "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
+          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074",
+          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074",
+          "title": "Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:57.741707+00:00",
+          "sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+          "raw_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8131eff1e6cd6868683d7d33aaac519fd8068ae80a944d97e781b444864803f2"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ijal-70289",
+          "url": "https://api.crossref.org/works/10.1111/ijal.70289",
+          "final_url": "https://api.crossref.org/works/10.1111/ijal.70289",
+          "title": "Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:27.573856+00:00",
+          "sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+          "raw_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e7349db870863c11bbe1e7bb743ae4914f271c2ffe8df8ba5e282704b66c0868"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wpt-2026-383",
+          "url": "https://api.crossref.org/works/10.2166/wpt.2026.383",
+          "final_url": "https://api.crossref.org/works/10.2166/wpt.2026.383",
+          "title": "Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:23.477316+00:00",
+          "sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+          "raw_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "1180ae123b654ca1378f5b6251d0dc3fee2c4a8c42aa5c6705f515bd6ade8b01"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wcc-2026-359",
+          "url": "https://api.crossref.org/works/10.2166/wcc.2026.359",
+          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.359",
+          "title": "Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:29.768865+00:00",
+          "sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+          "raw_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "a9c816eca913a8e5b93ebd12e464b92c653e5d43d2e2d8cd4129e063c0f47cc9"
+        },
+        {
+          "id": "source.frontier.doi-10-66630-sc-2026-0009",
+          "url": "https://api.crossref.org/works/10.66630/sc.2026.0009",
+          "final_url": "https://api.crossref.org/works/10.66630/sc.2026.0009",
+          "title": "Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:12:58.620510+00:00",
+          "sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+          "raw_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "5b3cc00264669185ef3786aa17aa49e020c1fe582e37121e739b4fbe61394f61"
+        },
+        {
+          "id": "source.frontier.doi-10-59588-2961-3094-1247",
+          "url": "https://api.crossref.org/works/10.59588/2961-3094.1247",
+          "final_url": "https://api.crossref.org/works/10.59588/2961-3094.1247",
+          "title": "Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:36.199381+00:00",
+          "sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+          "raw_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "80c186b9c8ebba38def4d5ff1ba323f65b3592af8f34a744d65c03fbe8cfdf6b"
+        },
+        {
+          "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
+          "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606",
+          "final_url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606",
+          "title": "Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:24.255025+00:00",
+          "sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+          "raw_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ad9a554bfbe662cd4dfca092a21b5fdf907160137d29eeca0e581da5dc18a7a5"
+        },
+        {
+          "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
+          "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601",
+          "final_url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601",
+          "title": "Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:37.334888+00:00",
+          "sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+          "raw_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "cf4196aa8748b1b81e704e069408a0582c90e39345903d1418536dd776dc355c"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025wr041875",
+          "url": "https://api.crossref.org/works/10.1029/2025wr041875",
+          "final_url": "https://api.crossref.org/works/10.1029/2025wr041875",
+          "title": "Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:41.289363+00:00",
+          "sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+          "raw_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "07ff78cd8ae7a8ba61296f9297a47a5afb5e986713368392ed7a2f8993df2462"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-wcc-2026-006",
+          "url": "https://api.crossref.org/works/10.2166/wcc.2026.006",
+          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.006",
+          "title": "Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:46.693066+00:00",
+          "sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+          "raw_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "3a2d003f3d86f6cf12eda5d598fd7ba8ab50af429056673d6d5609ac182281fd"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025jb033060",
+          "url": "https://api.crossref.org/works/10.1029/2025jb033060",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jb033060",
+          "title": "Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:25.087604+00:00",
+          "sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+          "raw_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "a035126087b38af77de2cf44dd034eff742c2fc273a5dd19286d79e279923310"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025ea004610",
+          "url": "https://api.crossref.org/works/10.1029/2025ea004610",
+          "final_url": "https://api.crossref.org/works/10.1029/2025ea004610",
+          "title": "Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:48.180926+00:00",
+          "sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+          "raw_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0d8350ad94825d9e536b1bdc2d646062afdb16eeb85e381c0d8d6156a4fc1c8e"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl122157",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122157",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122157",
+          "title": "Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:52.136485+00:00",
+          "sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+          "raw_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "7f46f950ae93eea00b1054be8a82d8fcb993f58007cb6b09bd0df9919aae047a"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-esp4-70096",
+          "url": "https://api.crossref.org/works/10.1002/esp4.70096",
+          "final_url": "https://api.crossref.org/works/10.1002/esp4.70096",
+          "title": "Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:26.671640+00:00",
+          "sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+          "raw_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "0ccd2985ef1747868e8a8a04880436920caaa4507465b6bb07a0af40fdc10423"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-bioe-70124",
+          "url": "https://api.crossref.org/works/10.1111/bioe.70124",
+          "final_url": "https://api.crossref.org/works/10.1111/bioe.70124",
+          "title": "Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:57.078734+00:00",
+          "sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+          "raw_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2cd286345703d224fd7323c82b5f9ee983d7ec680db50067e7a933f7ced72382"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-adom-71396",
+          "url": "https://api.crossref.org/works/10.1002/adom.71396",
+          "final_url": "https://api.crossref.org/works/10.1002/adom.71396",
+          "title": "Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:57.862869+00:00",
+          "sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+          "raw_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "8f381c6c021c852a588ea112820772c07bd978937b8a885d1fb410a7b93b879c"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-ese3-70586",
+          "url": "https://api.crossref.org/works/10.1002/ese3.70586",
+          "final_url": "https://api.crossref.org/works/10.1002/ese3.70586",
+          "title": "Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:58.658775+00:00",
+          "sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+          "raw_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "2872a7c595292073cb0bbc58732f21eb2173ae68116641f952c90b0373fab525"
+        },
+        {
+          "id": "source.frontier.doi-10-1144-jgs2026-039",
+          "url": "https://api.crossref.org/works/10.1144/jgs2026-039",
+          "final_url": "https://api.crossref.org/works/10.1144/jgs2026-039",
+          "title": "Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:28.427759+00:00",
+          "sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+          "raw_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "36120c7d6358ffeffabce23392a06e01d6c9b483ed8bc72970aee13d14ce8bf8"
+        },
+        {
+          "id": "source.frontier.doi-10-1002-hec-70120",
+          "url": "https://api.crossref.org/works/10.1002/hec.70120",
+          "final_url": "https://api.crossref.org/works/10.1002/hec.70120",
+          "title": "Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:00.422336+00:00",
+          "sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+          "raw_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "67ceef27110aee0f5727c88a98f23cd3a3c3d1b4da170cd01bc80e0887ab4362"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-1467-9477-70049",
+          "url": "https://api.crossref.org/works/10.1111/1467-9477.70049",
+          "final_url": "https://api.crossref.org/works/10.1111/1467-9477.70049",
+          "title": "Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:01.194995+00:00",
+          "sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+          "raw_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "a4fec35dd559f020598a6c992cbafb187f19fb8bb1f6c35a9cd8ffce38db1af0"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-faam-70045",
+          "url": "https://api.crossref.org/works/10.1111/faam.70045",
+          "final_url": "https://api.crossref.org/works/10.1111/faam.70045",
+          "title": "Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:20:43.170351+00:00",
+          "sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+          "raw_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e94e56cdb10dd36acd1b4637ea9b041ee3073716bfca03f126e18233d0f86d31"
+        },
+        {
+          "id": "source.frontier.doi-10-58491-2735-4202-3413",
+          "url": "https://api.crossref.org/works/10.58491/2735-4202.3413",
+          "final_url": "https://api.crossref.org/works/10.58491/2735-4202.3413",
+          "title": "Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:08:59.436190+00:00",
+          "sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+          "raw_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "e96675de40fc2b9e94ca1f422211c921f05f3bb8daad786ebc810976a5dc2aaf"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2025gl121378",
+          "url": "https://api.crossref.org/works/10.1029/2025gl121378",
+          "final_url": "https://api.crossref.org/works/10.1029/2025gl121378",
+          "title": "Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:04.788856+00:00",
+          "sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+          "raw_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "f5d6b3888f8a8dffe867a2d1c76b8199658291025770fa6500cfe7f958ffa39c"
+        },
+        {
+          "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
+          "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421",
+          "final_url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421",
+          "title": "Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:01.076217+00:00",
+          "sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+          "raw_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "013d8c60f4b8f80756f0c917c6e4ef3e941814e90a4c48d123ff5d2c0e42a576"
+        },
+        {
+          "id": "source.frontier.doi-10-1029-2026gl123355",
+          "url": "https://api.crossref.org/works/10.1029/2026gl123355",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl123355",
+          "title": "Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:29.225563+00:00",
+          "sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+          "raw_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "12aed988c6b8ee96d658540219ffbd46d2cd9bb4c7b1d8409fb3c3476a61f646"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-sce-70090",
-          "target_kind": "node",
-          "target_sha256": "7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-sce-70090",
-            "label": "Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
-            "kind": "claim",
-            "domain": "social",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-sce-70090",
-                "title": "Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
-                "url": "https://api.crossref.org/works/10.1002/sce.70090"
-              },
-              {
-                "id": "doi:10.1002/sce.70090",
-                "title": "doi:10.1002/sce.70090",
-                "url": "https://doi.org/10.1002/sce.70090"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-15",
-              "source_ids": [
-                "source.frontier.doi-10-1002-sce-70090"
-              ]
-            }
-          },
-          "statement": "doi:10.1002/sce.70090 \"Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings\" (CC BY 4.0, published 2026-07-15) reports: \"The findings revealed that almost all identified studies adopted a narrow definition of inclusion.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1002/sce.70090",
-            "time": "2026-07-15",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-sce-70090",
-              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-              "start": 1981,
-              "end": 2079,
-              "quote": "The findings revealed that almost all identified studies adopted a narrow definition of inclusion."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-sce-70090",
-              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-              "start": 25306,
-              "end": 25346,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,15]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-sce-70090",
-              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-              "start": 398,
-              "end": 455,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025gl121171",
+          "url": "https://api.crossref.org/works/10.1029/2025gl121171",
+          "final_url": "https://api.crossref.org/works/10.1029/2025gl121171",
+          "title": "Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:06.432140+00:00",
+          "sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+          "raw_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "bea7b807029312cfaf727766df4a19e743e76c2b27f15ef91d5cd218ec3ebcf3"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-ppp-70053",
-          "target_kind": "node",
-          "target_sha256": "20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-ppp-70053",
-            "label": "Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-ppp-70053",
-                "title": "Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
-                "url": "https://api.crossref.org/works/10.1002/ppp.70053"
-              },
-              {
-                "id": "doi:10.1002/ppp.70053",
-                "title": "doi:10.1002/ppp.70053",
-                "url": "https://doi.org/10.1002/ppp.70053"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-14",
-              "source_ids": [
-                "source.frontier.doi-10-1002-ppp-70053"
-              ]
-            }
-          },
-          "statement": "doi:10.1002/ppp.70053 \"Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT\" (CC BY 4.0, published 2026-07-14) reports: \"The results suggest that the 5 m tall dome‐shaped palsa contains permafrost up to 20‐m‐thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower‐relief areas on the palsa.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1002/ppp.70053",
-            "time": "2026-07-14",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70053",
-              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-              "start": 2025,
-              "end": 2255,
-              "quote": "The results suggest that the 5\\u2009m tall dome\\u2010shaped palsa contains permafrost up to 20\\u2010m\\u2010thick beneath elevated areas, whereas permafrost is thin or absent in the surrounding lower\\u2010relief areas on the palsa."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70053",
-              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-              "start": 11812,
-              "end": 11852,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,14]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70053",
-              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-              "start": 397,
-              "end": 454,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025jd044617",
+          "url": "https://api.crossref.org/works/10.1029/2025jd044617",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jd044617",
+          "title": "Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:08.056890+00:00",
+          "sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+          "raw_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "164cf72d81f88dda03d6e495f87e35aed915c5faa2b2bee524787ad62606d3ce"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-ese3-70603",
-          "target_kind": "node",
-          "target_sha256": "e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-ese3-70603",
-            "label": "Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
-            "kind": "claim",
-            "domain": "engineering",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-ese3-70603",
-                "title": "Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
-                "url": "https://api.crossref.org/works/10.1002/ese3.70603"
-              },
-              {
-                "id": "doi:10.1002/ese3.70603",
-                "title": "doi:10.1002/ese3.70603",
-                "url": "https://doi.org/10.1002/ese3.70603"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-14",
-              "source_ids": [
-                "source.frontier.doi-10-1002-ese3-70603"
-              ]
-            }
-          },
-          "statement": "doi:10.1002/ese3.70603 \"Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law\" (CC BY 4.0, published 2026-07-14) reports: \"The results indicate that under the conditions set in this study, the fault stick‐slip reaches a critical state when the fault pillar support pressure peaks.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1002/ese3.70603",
-            "time": "2026-07-14",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-ese3-70603",
-              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-              "start": 2036,
-              "end": 2198,
-              "quote": "The results indicate that under the conditions set in this study, the fault stick\\u2010slip reaches a critical state when the fault pillar support pressure peaks."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ese3-70603",
-              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-              "start": 13229,
-              "end": 13269,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,14]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ese3-70603",
-              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
+          "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234",
+          "final_url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234",
+          "title": "Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:03.592763+00:00",
+          "sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+          "raw_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "862830b1e086a382c1b9f7e2ed731dc8f408d26915dd558b2c0e9aa4a7f2fae6"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025jd046190",
-          "target_kind": "node",
-          "target_sha256": "e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025jd046190",
-            "label": "Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2025jd046190",
-                "title": "Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
-                "url": "https://api.crossref.org/works/10.1029/2025jd046190"
-              },
-              {
-                "id": "doi:10.1029/2025jd046190",
-                "title": "doi:10.1029/2025jd046190",
-                "url": "https://doi.org/10.1029/2025jd046190"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-13",
-              "source_ids": [
-                "source.frontier.doi-10-1029-2025jd046190"
-              ]
-            }
-          },
-          "statement": "doi:10.1029/2025jd046190 \"Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event\" (CC BY 4.0, published 2026-07-13) reports: \"We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution‐dependent, and the plume rise model still fails to reproduce the highest observed plume heights.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1029/2025jd046190",
-            "time": "2026-07-13",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1029-2025jd046190",
-              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-              "start": 3240,
-              "end": 3449,
-              "quote": "We show that the inclusion of the sensible heat release makes the plume rise model outcomes more resolution\\u2010dependent, and the plume rise model still fails to reproduce the highest observed plume heights."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2025jd046190",
-              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-              "start": 13219,
-              "end": 13259,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,13]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2025jd046190",
-              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-              "start": 436,
-              "end": 493,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025jd045718",
+          "url": "https://api.crossref.org/works/10.1029/2025jd045718",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jd045718",
+          "title": "Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:30.038626+00:00",
+          "sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+          "raw_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "beed779a24caa6abbe24d220add0c7116f65ad9e8f4eec12f3a690df1038572a"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025gl121323",
-          "target_kind": "node",
-          "target_sha256": "e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025gl121323",
-            "label": "Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2025gl121323",
-                "title": "Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121323"
-              },
-              {
-                "id": "doi:10.1029/2025gl121323",
-                "title": "doi:10.1029/2025gl121323",
-                "url": "https://doi.org/10.1029/2025gl121323"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-13",
-              "source_ids": [
-                "source.frontier.doi-10-1029-2025gl121323"
-              ]
-            }
-          },
-          "statement": "doi:10.1029/2025gl121323 \"Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years\" (CC BY 4.0, published 2026-07-13) reports: \"Here we report Fe concentrations and isotopic compositions from a Fe‐Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1029/2025gl121323",
-            "time": "2026-07-13",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1029-2025gl121323",
-              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-              "start": 2082,
-              "end": 2230,
-              "quote": "Here we report Fe concentrations and isotopic compositions from a Fe\\u2010Mn crust sample CXD31 in the Northwest Pacific Ocean over the last 23 Myr."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2025gl121323",
-              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-              "start": 15160,
-              "end": 15200,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,13]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2025gl121323",
-              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-              "start": 436,
-              "end": 493,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2026gl122664",
+          "url": "https://api.crossref.org/works/10.1029/2026gl122664",
+          "final_url": "https://api.crossref.org/works/10.1029/2026gl122664",
+          "title": "Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:30.846496+00:00",
+          "sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+          "raw_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "b6b291d150ce56c13a5d1f35c9f7196340cedf7ddf32c66297b5148d28017607"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-ijfe-70259",
-          "target_kind": "node",
-          "target_sha256": "4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-ijfe-70259",
-            "label": "Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
-            "kind": "claim",
-            "domain": "social",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-ijfe-70259",
-                "title": "Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
-                "url": "https://api.crossref.org/works/10.1002/ijfe.70259"
-              },
-              {
-                "id": "doi:10.1002/ijfe.70259",
-                "title": "doi:10.1002/ijfe.70259",
-                "url": "https://doi.org/10.1002/ijfe.70259"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-12",
-              "source_ids": [
-                "source.frontier.doi-10-1002-ijfe-70259"
-              ]
-            }
-          },
-          "statement": "doi:10.1002/ijfe.70259 \"Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data\" (CC BY 4.0, published 2026-07-12) reports: \"We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1002/ijfe.70259",
-            "time": "2026-07-12",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
-              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-              "start": 1065,
-              "end": 1540,
-              "quote": "We find that positive and statistically significant responses of primary balances to debt emerge in specific historical episodes and particular macroeconomic regime conditions, including the interwar era and the period from the 1990s up to the global financial crisis, while several regime settings such as low real interest rate environments, high inflation episodes and below the average growth regimes exhibit weak, insignificant, or even negative response to rising debt."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
-              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-              "start": 13804,
-              "end": 13844,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,12]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
-              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-              "start": 395,
-              "end": 452,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1111-ojoa-70022",
+          "url": "https://api.crossref.org/works/10.1111/ojoa.70022",
+          "final_url": "https://api.crossref.org/works/10.1111/ojoa.70022",
+          "title": "Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:05.396546+00:00",
+          "sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+          "raw_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ee74730d5991b7a587d651d40e4cd515a94152a5c15c9ec0181e42fc8af3183b"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000696",
-          "target_kind": "node",
-          "target_sha256": "b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1371-journal-pclm-0000696",
-            "label": "Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-                "title": "Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696"
-              },
-              {
-                "id": "doi:10.1371/journal.pclm.0000696",
-                "title": "doi:10.1371/journal.pclm.0000696",
-                "url": "https://doi.org/10.1371/journal.pclm.0000696"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-09",
-              "source_ids": [
-                "source.frontier.doi-10-1371-journal-pclm-0000696"
-              ]
-            }
-          },
-          "statement": "doi:10.1371/journal.pclm.0000696 \"Maximising the economic value of water through adaptive, climate-informed irrigation scheduling\" (CC BY 4.0, published 2026-07-09) reports: \"Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1371/journal.pclm.0000696",
-            "time": "2026-07-09",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-              "start": 1779,
-              "end": 2007,
-              "quote": "Our findings show that a more frequent irrigation schedule (Schedule 1) improved model-simulated potential cane yield and profitability by reducing water stress, without considering the extra cost of higher irrigation frequency."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-              "start": 19992,
-              "end": 20031,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-              "start": 423,
-              "end": 480,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025jd045965",
+          "url": "https://api.crossref.org/works/10.1029/2025jd045965",
+          "final_url": "https://api.crossref.org/works/10.1029/2025jd045965",
+          "title": "Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:12.455012+00:00",
+          "sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+          "raw_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "3a67fae743cbaab0af4ef948f5b50fb066999ac663416209f3b60f9765a6688a"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-aphw-70185",
-          "target_kind": "node",
-          "target_sha256": "ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-aphw-70185",
-            "label": "Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
-            "kind": "claim",
-            "domain": "social",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1111-aphw-70185",
-                "title": "Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
-                "url": "https://api.crossref.org/works/10.1111/aphw.70185"
-              },
-              {
-                "id": "doi:10.1111/aphw.70185",
-                "title": "doi:10.1111/aphw.70185",
-                "url": "https://doi.org/10.1111/aphw.70185"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-09",
-              "source_ids": [
-                "source.frontier.doi-10-1111-aphw-70185"
-              ]
-            }
-          },
-          "statement": "doi:10.1111/aphw.70185 \"Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research\" (CC BY 4.0, published 2026-07-09) reports: \"These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1111/aphw.70185",
-            "time": "2026-07-09",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1111-aphw-70185",
-              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-              "start": 2859,
-              "end": 3045,
-              "quote": "These findings indicate a marked disconnect between the field's stated commitments to equity and the visibility of participatory approaches within its primary publication infrastructure."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-aphw-70185",
-              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-              "start": 14358,
-              "end": 14397,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-aphw-70185",
-              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-              "start": 396,
-              "end": 453,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1111-jssr-70066",
+          "url": "https://api.crossref.org/works/10.1111/jssr.70066",
+          "final_url": "https://api.crossref.org/works/10.1111/jssr.70066",
+          "title": "Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:08.235475+00:00",
+          "sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+          "raw_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "4ae2a6ff90b4c308717b7a9bb9603993f9668ba72fe953763cc95be87c529b0b"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2026jh001250",
-          "target_kind": "node",
-          "target_sha256": "d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2026jh001250",
-            "label": "Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026jh001250",
-                "title": "Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
-                "url": "https://api.crossref.org/works/10.1029/2026jh001250"
-              },
-              {
-                "id": "doi:10.1029/2026jh001250",
-                "title": "doi:10.1029/2026jh001250",
-                "url": "https://doi.org/10.1029/2026jh001250"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-09",
-              "source_ids": [
-                "source.frontier.doi-10-1029-2026jh001250"
-              ]
-            }
-          },
-          "statement": "doi:10.1029/2026jh001250 \"Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network\" (CC BY 4.0, published 2026-07-09) reports: \"These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1029/2026jh001250",
-            "time": "2026-07-09",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1029-2026jh001250",
-              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-              "start": 2352,
-              "end": 2556,
-              "quote": "These results show that a RNN can recover key characteristics of glacier MB dynamics and that the learned relationships transfer effectively across the climatic and topographic settings of the Swiss Alps."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2026jh001250",
-              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-              "start": 18163,
-              "end": 18202,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2026jh001250",
-              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-              "start": 424,
-              "end": 481,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025wr042846",
+          "url": "https://api.crossref.org/works/10.1029/2025wr042846",
+          "final_url": "https://api.crossref.org/works/10.1029/2025wr042846",
+          "title": "Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:14.169010+00:00",
+          "sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+          "raw_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6b2d964d553d553a46ca5ece8245edbfa57c617e2a395913d7c862a9e58d40ef"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2026gl122518",
-          "target_kind": "node",
-          "target_sha256": "d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2026gl122518",
-            "label": "Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026gl122518",
-                "title": "Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122518"
-              },
-              {
-                "id": "doi:10.1029/2026gl122518",
-                "title": "doi:10.1029/2026gl122518",
-                "url": "https://doi.org/10.1029/2026gl122518"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-09",
-              "source_ids": [
-                "source.frontier.doi-10-1029-2026gl122518"
-              ]
-            }
-          },
-          "statement": "doi:10.1029/2026gl122518 \"Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake\" (CC BY 4.0, published 2026-07-09) reports: \"These results indicate that half‐space assumptions capture the first‐order rupture characteristics but can introduce significant bias in detailed rupture processes.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1029/2026gl122518",
-            "time": "2026-07-09",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1029-2026gl122518",
-              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-              "start": 2735,
-              "end": 2909,
-              "quote": "These results indicate that half\\u2010space assumptions capture the first\\u2010order rupture characteristics but can introduce significant bias in detailed rupture processes."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2026gl122518",
-              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-              "start": 12005,
-              "end": 12044,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,9]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1029-2026gl122518",
-              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-              "start": 425,
-              "end": 482,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-3897-jbgs-e185535",
+          "url": "https://api.crossref.org/works/10.3897/jbgs.e185535",
+          "final_url": "https://api.crossref.org/works/10.3897/jbgs.e185535",
+          "title": "Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:15.322428+00:00",
+          "sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+          "raw_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "be3649602e0d9c2c577503a6540eeb850399543e9ad74668b40fc125d699bf70"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739",
-          "target_kind": "node",
-          "target_sha256": "6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-3897-brics-econ-7-e172739",
-            "label": "The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
-            "kind": "claim",
-            "domain": "social",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-                "title": "Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739"
-              },
-              {
-                "id": "doi:10.3897/brics-econ.7.e172739",
-                "title": "doi:10.3897/brics-econ.7.e172739",
-                "url": "https://doi.org/10.3897/brics-econ.7.e172739"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-07",
-              "source_ids": [
-                "source.frontier.doi-10-3897-brics-econ-7-e172739"
-              ]
-            }
-          },
-          "statement": "doi:10.3897/brics-econ.7.e172739 \"The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach\" (CC BY 4.0, published 2026-07-07) reports: \"Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP.\"",
-          "scope": {
-            "population": "The study reported in doi:10.3897/brics-econ.7.e172739",
-            "time": "2026-07-07",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-              "start": 904,
-              "end": 1101,
-              "quote": "Using advanced ML methods, specifically the CrossFit Partialing-out LASSO linear regression (CrossFit POLR), the study shows that the DST has a positive and statistically significant impact on GDP."
-            },
-            {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-              "start": 10407,
-              "end": 10446,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,7]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-              "start": 410,
-              "end": 467,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1002-esp4-70082",
+          "url": "https://api.crossref.org/works/10.1002/esp4.70082",
+          "final_url": "https://api.crossref.org/works/10.1002/esp4.70082",
+          "title": "Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:32.546235+00:00",
+          "sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+          "raw_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "944c3944336220fe78d2033722487b151922962f6f3ea71628d1d5987b4405e0"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-jmg-70045",
-          "target_kind": "node",
-          "target_sha256": "0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-jmg-70045",
-            "label": "Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1111-jmg-70045",
-                "title": "Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
-                "url": "https://api.crossref.org/works/10.1111/jmg.70045"
-              },
-              {
-                "id": "doi:10.1111/jmg.70045",
-                "title": "doi:10.1111/jmg.70045",
-                "url": "https://doi.org/10.1111/jmg.70045"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-07",
-              "source_ids": [
-                "source.frontier.doi-10-1111-jmg-70045"
-              ]
-            }
-          },
-          "statement": "doi:10.1111/jmg.70045 \"Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole\" (CC BY 4.0, published 2026-07-07) reports: \"Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1111/jmg.70045",
-            "time": "2026-07-07",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1111-jmg-70045",
-              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-              "start": 2517,
-              "end": 2742,
-              "quote": "Our findings reveal generic SI and early subduction processes that align with geochronologic and metamorphic constraints reported for other soles as well as with the proposed early development of some modern subduction zones."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-jmg-70045",
-              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-              "start": 24402,
-              "end": 24441,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,7]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-jmg-70045",
-              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-              "start": 397,
-              "end": 454,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-3897-nhcm-3-184711",
+          "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711",
+          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.184711",
+          "title": "Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:10.131057+00:00",
+          "sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+          "raw_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "33dedde1bdda4d89f1a5f1970fed6c63499b4e4ab1f9e3fac270e83037455b33"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-ppp-70049",
-          "target_kind": "node",
-          "target_sha256": "7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9",
-          "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-ppp-70049",
-            "label": "Disposition Model for Permafrost Degradation in Mountainous Regions",
-            "kind": "claim",
-            "domain": "earth",
-            "era": "frontier",
-            "status": "frontier",
-            "frontier": true,
-            "summary": "doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"",
-            "tags": [
-              "frontier",
-              "public-result"
-            ],
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-ppp-70049",
-                "title": "Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions",
-                "url": "https://api.crossref.org/works/10.1002/ppp.70049"
-              },
-              {
-                "id": "doi:10.1002/ppp.70049",
-                "title": "doi:10.1002/ppp.70049",
-                "url": "https://doi.org/10.1002/ppp.70049"
-              }
-            ],
-            "public_frontier": {
-              "category": "public-result",
-              "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-05",
-              "source_ids": [
-                "source.frontier.doi-10-1002-ppp-70049"
-              ]
-            }
-          },
-          "statement": "doi:10.1002/ppp.70049 \"Disposition Model for Permafrost Degradation in Mountainous Regions\" (CC BY 4.0, published 2026-07-05) reports: \"Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium‐range weather prediction ensembles are used to drive the model.\"",
-          "scope": {
-            "population": "The study reported in doi:10.1002/ppp.70049",
-            "time": "2026-07-05",
-            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
-            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
-            "units": null,
-            "quantifiers": "Only what the quoted sentence states"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70049",
-              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-              "start": 2697,
-              "end": 2897,
-              "quote": "Using the Rottal site as an example, the study demonstrates the potential of seasonal forecasts of permafrost evolution when medium\\u2010range weather prediction ensembles are used to drive the model."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70049",
-              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-              "start": 17541,
-              "end": 17580,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,5]]}"
-            },
-            {
-              "source_id": "source.frontier.doi-10-1002-ppp-70049",
-              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-              "start": 397,
-              "end": 454,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
-            }
-          ]
+          "id": "source.frontier.doi-10-1029-2025gc012776",
+          "url": "https://api.crossref.org/works/10.1029/2025gc012776",
+          "final_url": "https://api.crossref.org/works/10.1029/2025gc012776",
+          "title": "Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:33.403467+00:00",
+          "sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+          "raw_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "6e9f4ccd4deb515ed7b7ff7ebd0416a0981e5d6374df1d55f2a26426e73aa094"
         },
         {
-          "id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074",
+          "id": "source.frontier.doi-10-1002-joc-70436",
+          "url": "https://api.crossref.org/works/10.1002/joc.70436",
+          "final_url": "https://api.crossref.org/works/10.1002/joc.70436",
+          "title": "Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:35:34.227527+00:00",
+          "sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+          "raw_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "40bfb25ab0321d5ead444d93d43dc7fd298b99d391901256816bf031179446b1"
+        },
+        {
+          "id": "source.frontier.doi-10-2166-hydro-2026-191",
+          "url": "https://api.crossref.org/works/10.2166/hydro.2026.191",
+          "final_url": "https://api.crossref.org/works/10.2166/hydro.2026.191",
+          "title": "Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:13:20.330963+00:00",
+          "sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+          "raw_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "c8ed6aeb48e4414edc9dfdbab91af2114598bc0e291ef37bcf06ee9b5199de9d"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-ojoa-70020",
+          "url": "https://api.crossref.org/works/10.1111/ojoa.70020",
+          "final_url": "https://api.crossref.org/works/10.1111/ojoa.70020",
+          "title": "Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:14.857871+00:00",
+          "sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+          "raw_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "ddb696068345bbc579135da911f29c8464006444ece04a94d4f009cc728bb257"
+        },
+        {
+          "id": "source.frontier.doi-10-1111-phpr-70116",
+          "url": "https://api.crossref.org/works/10.1111/phpr.70116",
+          "final_url": "https://api.crossref.org/works/10.1111/phpr.70116",
+          "title": "Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language",
+          "source_kind": "primary",
+          "retrieved_at": "2026-10-18T16:09:16.477541+00:00",
+          "sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+          "raw_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
+          "content_type": "application/json",
+          "charset": "utf-8",
+          "extraction_method": "http-text/1",
+          "capture_id": "807c80b033c9e008f23f398dc70fde8475eb966ed3577973bb0beabe47196fce"
+        }
+      ]
+    },
+    {
+      "batch_id": "nemesis-frontier-arxiv-b-20261018-r1",
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "assertions": [
+        {
+          "id": "assertion.claim.frontier.arxiv-2610-21653",
           "target_kind": "node",
-          "target_sha256": "b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb",
+          "target_sha256": "d10e242f57d4e8911cbb6626598c479b5d9fb04da16b40c1d106c5afd59a72d9",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-3897-brics-econ-7-e162074",
-            "label": "The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
+            "id": "claim.frontier.arxiv-2610-21653",
+            "label": "How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
             "kind": "claim",
-            "domain": "social",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+            "summary": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-                "title": "Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074"
+                "id": "source.frontier.arxiv-2610-21653",
+                "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.3897/brics-econ.7.e162074",
-                "title": "doi:10.3897/brics-econ.7.e162074",
-                "url": "https://doi.org/10.3897/brics-econ.7.e162074"
+                "id": "arxiv:2610.21653",
+                "title": "arXiv:2610.21653",
+                "url": "https://arxiv.org/abs/2610.21653"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-03",
+              "disclosed_at": "2026-10-15",
               "source_ids": [
-                "source.frontier.doi-10-3897-brics-econ-7-e162074"
+                "source.frontier.arxiv-2610-21653"
               ]
             }
           },
-          "statement": "doi:10.3897/brics-econ.7.e162074 \"The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter\" (CC BY 4.0, published 2026-07-03) reports: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+          "statement": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
           "scope": {
-            "population": "The study reported in doi:10.3897/brics-econ.7.e162074",
-            "time": "2026-07-03",
+            "population": "The study reported in arXiv:2610.21653",
+            "time": "2026-10-15",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805127,70 +830190,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-              "start": 1212,
-              "end": 1322,
-              "quote": "The results reveal a stable long-term equilibrium between investment in human development and economic growth."
+              "source_id": "source.frontier.arxiv-2610-21653",
+              "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+              "start": 2482,
+              "end": 2833,
+              "quote": "In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control."
             },
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-              "start": 9154,
-              "end": 9193,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,3]]}"
+              "source_id": "source.frontier.arxiv-2610-21653",
+              "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-10-15</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-              "start": 409,
-              "end": 466,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-21653",
+              "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+              "start": 2079,
+              "end": 2141,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-ijal-70289",
+          "id": "assertion.claim.frontier.arxiv-2610-19722",
           "target_kind": "node",
-          "target_sha256": "a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8",
+          "target_sha256": "a8dd47064ed088694cb7ee9d06a2648af1e7b0d1fbe824decab526d1ca8f81a9",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-ijal-70289",
-            "label": "Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
+            "id": "claim.frontier.arxiv-2610-19722",
+            "label": "ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"",
+            "summary": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ijal-70289",
-                "title": "Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
-                "url": "https://api.crossref.org/works/10.1111/ijal.70289"
+                "id": "source.frontier.arxiv-2610-19722",
+                "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/ijal.70289",
-                "title": "doi:10.1111/ijal.70289",
-                "url": "https://doi.org/10.1111/ijal.70289"
+                "id": "arxiv:2610.19722",
+                "title": "arXiv:2610.19722",
+                "url": "https://arxiv.org/abs/2610.19722"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-03",
+              "disclosed_at": "2026-10-14",
               "source_ids": [
-                "source.frontier.doi-10-1111-ijal-70289"
+                "source.frontier.arxiv-2610-19722"
               ]
             }
           },
-          "statement": "doi:10.1111/ijal.70289 \"Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa\" (CC BY 4.0, published 2026-07-03) reports: \"The findings reveal a core tension in participant perceptions.\"",
+          "statement": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/ijal.70289",
-            "time": "2026-07-03",
+            "population": "The study reported in arXiv:2610.19722",
+            "time": "2026-10-14",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805198,70 +830261,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70289",
-              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-              "start": 1488,
-              "end": 1550,
-              "quote": "The findings reveal a core tension in participant perceptions."
+              "source_id": "source.frontier.arxiv-2610-19722",
+              "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+              "start": 3012,
+              "end": 3276,
+              "quote": "Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70289",
-              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-              "start": 9731,
-              "end": 9770,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,3]]}"
+              "source_id": "source.frontier.arxiv-2610-19722",
+              "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-14</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70289",
-              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-              "start": 395,
-              "end": 452,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-19722",
+              "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+              "start": 1763,
+              "end": 1825,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-2166-wpt-2026-383",
+          "id": "assertion.claim.frontier.arxiv-2610-19515",
           "target_kind": "node",
-          "target_sha256": "704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614",
+          "target_sha256": "bc36f7c70ac332a0c225156aca2db0261613a4c3ebe26917c84bbe0d333ade50",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-2166-wpt-2026-383",
-            "label": "Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region",
+            "id": "claim.frontier.arxiv-2610-19515",
+            "label": "Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"",
+            "summary": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wpt-2026-383",
-                "title": "Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss",
-                "url": "https://api.crossref.org/works/10.2166/wpt.2026.383"
+                "id": "source.frontier.arxiv-2610-19515",
+                "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.2166/wpt.2026.383",
-                "title": "doi:10.2166/wpt.2026.383",
-                "url": "https://doi.org/10.2166/wpt.2026.383"
+                "id": "arxiv:2610.19515",
+                "title": "arXiv:2610.19515",
+                "url": "https://arxiv.org/abs/2610.19515"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-01",
+              "disclosed_at": "2026-10-14",
               "source_ids": [
-                "source.frontier.doi-10-2166-wpt-2026-383"
+                "source.frontier.arxiv-2610-19515"
               ]
             }
           },
-          "statement": "doi:10.2166/wpt.2026.383 \"Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Bissau region\" (CC BY 4.0, published 2026-07-01) reports: \"The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario.\"",
+          "statement": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"",
           "scope": {
-            "population": "The study reported in doi:10.2166/wpt.2026.383",
-            "time": "2026-07-01",
+            "population": "The study reported in arXiv:2610.19515",
+            "time": "2026-10-14",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805269,70 +830332,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
-              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-              "start": 1632,
-              "end": 1738,
-              "quote": "The results reveal a trend toward worsening droughts, particularly pronounced under the SSP5-8.5 scenario."
+              "source_id": "source.frontier.arxiv-2610-19515",
+              "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+              "start": 3158,
+              "end": 3283,
+              "quote": "Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability."
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
-              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-              "start": 22165,
-              "end": 22204,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,1]]}"
+              "source_id": "source.frontier.arxiv-2610-19515",
+              "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-14</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
-              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-              "start": 417,
-              "end": 474,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-19515",
+              "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+              "start": 2070,
+              "end": 2132,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-2166-wcc-2026-359",
+          "id": "assertion.claim.frontier.arxiv-2610-19137",
           "target_kind": "node",
-          "target_sha256": "22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe",
+          "target_sha256": "09401a3ea268f6e991bb1235be758edaaf9a7fedc97c1f65562d42e1ff71dba4",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-2166-wcc-2026-359",
-            "label": "Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
+            "id": "claim.frontier.arxiv-2610-19137",
+            "label": "Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "engineering",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"",
+            "summary": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wcc-2026-359",
-                "title": "Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.359"
+                "id": "source.frontier.arxiv-2610-19137",
+                "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.2166/wcc.2026.359",
-                "title": "doi:10.2166/wcc.2026.359",
-                "url": "https://doi.org/10.2166/wcc.2026.359"
+                "id": "arxiv:2610.19137",
+                "title": "arXiv:2610.19137",
+                "url": "https://arxiv.org/abs/2610.19137"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-07-01",
+              "disclosed_at": "2026-10-13",
               "source_ids": [
-                "source.frontier.doi-10-2166-wcc-2026-359"
+                "source.frontier.arxiv-2610-19137"
               ]
             }
           },
-          "statement": "doi:10.2166/wcc.2026.359 \"Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change\" (CC BY 4.0, published 2026-07-01) reports: \"These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions.\"",
+          "statement": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"",
           "scope": {
-            "population": "The study reported in doi:10.2166/wcc.2026.359",
-            "time": "2026-07-01",
+            "population": "The study reported in arXiv:2610.19137",
+            "time": "2026-10-13",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805340,70 +830403,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
-              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-              "start": 3256,
-              "end": 3446,
-              "quote": "These findings highlight a critical mismatch between evolving hydroclimates and infrastructure design, providing a robust basis for climate-resilient hydropower planning in mountain regions."
+              "source_id": "source.frontier.arxiv-2610-19137",
+              "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+              "start": 2510,
+              "end": 2673,
+              "quote": "Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned."
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
-              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-              "start": 34157,
-              "end": 34196,
-              "quote": "\"published\":{\"date-parts\":[[2026,7,1]]}"
+              "source_id": "source.frontier.arxiv-2610-19137",
+              "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-13</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
-              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-              "start": 407,
-              "end": 464,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-19137",
+              "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+              "start": 2024,
+              "end": 2086,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-66630-sc-2026-0009",
+          "id": "assertion.claim.frontier.arxiv-2610-17295",
           "target_kind": "node",
-          "target_sha256": "5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec",
+          "target_sha256": "258d145622ca057cff6f93b00ad958c34febb57b99ce8bf0ce7bdff897f7d141",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-66630-sc-2026-0009",
-            "label": "From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
+            "id": "claim.frontier.arxiv-2610-17295",
+            "label": "Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
             "kind": "claim",
-            "domain": "social",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"",
+            "summary": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-66630-sc-2026-0009",
-                "title": "Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
-                "url": "https://api.crossref.org/works/10.66630/sc.2026.0009"
+                "id": "source.frontier.arxiv-2610-17295",
+                "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.66630/sc.2026.0009",
-                "title": "doi:10.66630/sc.2026.0009",
-                "url": "https://doi.org/10.66630/sc.2026.0009"
+                "id": "arxiv:2610.17295",
+                "title": "arXiv:2610.17295",
+                "url": "https://arxiv.org/abs/2610.17295"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-30",
+              "disclosed_at": "2026-10-12",
               "source_ids": [
-                "source.frontier.doi-10-66630-sc-2026-0009"
+                "source.frontier.arxiv-2610-17295"
               ]
             }
           },
-          "statement": "doi:10.66630/sc.2026.0009 \"From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA\" (CC BY 4.0, published 2026-06-30) reports: \"The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes.\"",
+          "statement": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"",
           "scope": {
-            "population": "The study reported in doi:10.66630/sc.2026.0009",
-            "time": "2026-06-30",
+            "population": "The study reported in arXiv:2610.17295",
+            "time": "2026-10-12",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805411,70 +830474,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
-              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-              "start": 1567,
-              "end": 1913,
-              "quote": "The findings show that the composition and organization of immigrant leadership, along with its position within the regional configuration of ethnoburbs, not only shape the strength of immigrant influence in land use outcomes but also how that influence is recognized, brokered, and constrained by public officials and neighboring growth regimes."
+              "source_id": "source.frontier.arxiv-2610-17295",
+              "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+              "start": 3067,
+              "end": 3370,
+              "quote": "Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings."
             },
             {
-              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
-              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-              "start": 7094,
-              "end": 7134,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+              "source_id": "source.frontier.arxiv-2610-17295",
+              "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-12</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
-              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-              "start": 438,
-              "end": 495,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-17295",
+              "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+              "start": 2279,
+              "end": 2341,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-59588-2961-3094-1247",
+          "id": "assertion.claim.frontier.arxiv-2610-16273",
           "target_kind": "node",
-          "target_sha256": "92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17",
+          "target_sha256": "abec13a7138c2ba0031c3c27d7bf86d76d14145eaf07fe0459c331a693ca2367",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-59588-2961-3094-1247",
-            "label": "Creative Constructions in Asian and World Englishes - And What They Teach Us",
+            "id": "claim.frontier.arxiv-2610-16273",
+            "label": "Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"",
+            "summary": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-59588-2961-3094-1247",
-                "title": "Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us",
-                "url": "https://api.crossref.org/works/10.59588/2961-3094.1247"
+                "id": "source.frontier.arxiv-2610-16273",
+                "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.59588/2961-3094.1247",
-                "title": "doi:10.59588/2961-3094.1247",
-                "url": "https://doi.org/10.59588/2961-3094.1247"
+                "id": "arxiv:2610.16273",
+                "title": "arXiv:2610.16273",
+                "url": "https://arxiv.org/abs/2610.16273"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-30",
+              "disclosed_at": "2026-10-12",
               "source_ids": [
-                "source.frontier.doi-10-59588-2961-3094-1247"
+                "source.frontier.arxiv-2610-16273"
               ]
             }
           },
-          "statement": "doi:10.59588/2961-3094.1247 \"Creative Constructions in Asian and World Englishes - And What They Teach Us\" (CC BY 4.0, published 2026-06-30) reports: \"The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally.\"",
+          "statement": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
           "scope": {
-            "population": "The study reported in doi:10.59588/2961-3094.1247",
-            "time": "2026-06-30",
+            "population": "The study reported in arXiv:2610.16273",
+            "time": "2026-10-12",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805482,70 +830545,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
-              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-              "start": 2189,
-              "end": 2477,
-              "quote": "The findings highlight how these creative constructions are embedded into networks of constructions and invite associations with other, similar patterns and contextual settings, and how blending processes between all these input components produce auto-emergent innovations incrementally."
+              "source_id": "source.frontier.arxiv-2610-16273",
+              "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+              "start": 2282,
+              "end": 2750,
+              "quote": "Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised."
             },
             {
-              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
-              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-              "start": 3871,
-              "end": 3911,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+              "source_id": "source.frontier.arxiv-2610-16273",
+              "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-12</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
-              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-              "start": 414,
-              "end": 471,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-16273",
+              "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+              "start": 1841,
+              "end": 1903,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2606",
+          "id": "assertion.claim.frontier.arxiv-2610-16259",
           "target_kind": "node",
-          "target_sha256": "892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d",
+          "target_sha256": "49058552123e75c929a955f283eca0a07258c3e78ac13caca148d8134b204663",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-28918-jei-v11i1-2606",
-            "label": "Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
+            "id": "claim.frontier.arxiv-2610-16259",
+            "label": "Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"",
+            "summary": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-                "title": "Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
-                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606"
+                "id": "source.frontier.arxiv-2610-16259",
+                "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.28918/jei.v11i1.2606",
-                "title": "doi:10.28918/jei.v11i1.2606",
-                "url": "https://doi.org/10.28918/jei.v11i1.2606"
+                "id": "arxiv:2610.16259",
+                "title": "arXiv:2610.16259",
+                "url": "https://arxiv.org/abs/2610.16259"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-30",
+              "disclosed_at": "2026-10-12",
               "source_ids": [
-                "source.frontier.doi-10-28918-jei-v11i1-2606"
+                "source.frontier.arxiv-2610-16259"
               ]
             }
           },
-          "statement": "doi:10.28918/jei.v11i1.2606 \"Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation\" (CC BY 4.0, published 2026-06-30) reports: \"The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassuṭ, tawāzun, tasāmuḥ, and i'tidāl.\"",
+          "statement": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"",
           "scope": {
-            "population": "The study reported in doi:10.28918/jei.v11i1.2606",
-            "time": "2026-06-30",
+            "population": "The study reported in arXiv:2610.16259",
+            "time": "2026-10-12",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805553,70 +830616,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-              "start": 1389,
-              "end": 1642,
-              "quote": "The results show that Kamandaka figures embody integrity, justice, humility, empathy, deliberation, and collective responsibility, which align with the principles of religious moderation: tawassu\\u1e6d, taw\\u0101zun, tas\\u0101mu\\u1e25, and i'tid\\u0101l."
+              "source_id": "source.frontier.arxiv-2610-16259",
+              "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+              "start": 2552,
+              "end": 2688,
+              "quote": "The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states."
             },
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-              "start": 4370,
-              "end": 4410,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+              "source_id": "source.frontier.arxiv-2610-16259",
+              "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-12</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-              "start": 430,
-              "end": 487,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-16259",
+              "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+              "start": 1870,
+              "end": 1938,
+              "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2601",
+          "id": "assertion.claim.frontier.arxiv-2610-15934",
           "target_kind": "node",
-          "target_sha256": "4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00",
+          "target_sha256": "db269a5e349cef256a5d35a3cc98311c81e5233fbb732f72a56f62b5d01bfd00",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-28918-jei-v11i1-2601",
-            "label": "Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
+            "id": "claim.frontier.arxiv-2610-15934",
+            "label": "Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"",
+            "summary": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-                "title": "Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
-                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601"
+                "id": "source.frontier.arxiv-2610-15934",
+                "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.28918/jei.v11i1.2601",
-                "title": "doi:10.28918/jei.v11i1.2601",
-                "url": "https://doi.org/10.28918/jei.v11i1.2601"
+                "id": "arxiv:2610.15934",
+                "title": "arXiv:2610.15934",
+                "url": "https://arxiv.org/abs/2610.15934"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-30",
+              "disclosed_at": "2026-10-11",
               "source_ids": [
-                "source.frontier.doi-10-28918-jei-v11i1-2601"
+                "source.frontier.arxiv-2610-15934"
               ]
             }
           },
-          "statement": "doi:10.28918/jei.v11i1.2601 \"Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation\" (CC BY 4.0, published 2026-06-30) reports: \"The findings reveal that integrating digital platforms into pesantren education significantly enhances students’ technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources.\"",
+          "statement": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"",
           "scope": {
-            "population": "The study reported in doi:10.28918/jei.v11i1.2601",
-            "time": "2026-06-30",
+            "population": "The study reported in arXiv:2610.15934",
+            "time": "2026-10-11",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805624,70 +830687,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-              "start": 1711,
-              "end": 1945,
-              "quote": "The findings reveal that integrating digital platforms into pesantren education significantly enhances students\\u2019 technological competencies, learning effectiveness, academic performance, and access to broader knowledge resources."
+              "source_id": "source.frontier.arxiv-2610-15934",
+              "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+              "start": 2614,
+              "end": 2854,
+              "quote": "We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective."
             },
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-              "start": 5806,
-              "end": 5846,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+              "source_id": "source.frontier.arxiv-2610-15934",
+              "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-11</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-              "start": 430,
-              "end": 487,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-15934",
+              "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+              "start": 1682,
+              "end": 1744,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025wr041875",
+          "id": "assertion.claim.frontier.arxiv-2610-15072",
           "target_kind": "node",
-          "target_sha256": "9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9",
+          "target_sha256": "2202e4fba0fef0adbfffb5263a7bc935d004b4ed16d72bdb11fb868e0884f957",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025wr041875",
-            "label": "Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
+            "id": "claim.frontier.arxiv-2610-15072",
+            "label": "UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"",
+            "summary": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025wr041875",
-                "title": "Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
-                "url": "https://api.crossref.org/works/10.1029/2025wr041875"
+                "id": "source.frontier.arxiv-2610-15072",
+                "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025wr041875",
-                "title": "doi:10.1029/2025wr041875",
-                "url": "https://doi.org/10.1029/2025wr041875"
+                "id": "arxiv:2610.15072",
+                "title": "arXiv:2610.15072",
+                "url": "https://arxiv.org/abs/2610.15072"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-30",
+              "disclosed_at": "2026-10-10",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025wr041875"
+                "source.frontier.arxiv-2610-15072"
               ]
             }
           },
-          "statement": "doi:10.1029/2025wr041875 \"Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products\" (CC BY 4.0, published 2026-06-30) reports: \"The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively.\"",
+          "statement": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025wr041875",
-            "time": "2026-06-30",
+            "population": "The study reported in arXiv:2610.15072",
+            "time": "2026-10-10",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805695,70 +830758,75 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr041875",
-              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-              "start": 2380,
-              "end": 2590,
-              "quote": "The addition of calibration constraints employing a water balance and SWOT Q is shown to be particularly valuable for ensuring LSM Q estimates with low bias in their mean and temporal variability, respectively."
+              "source_id": "source.frontier.arxiv-2610-15072",
+              "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+              "start": 3330,
+              "end": 3498,
+              "quote": "We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr041875",
-              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-              "start": 8994,
-              "end": 9034,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,30]]}"
+              "source_id": "source.frontier.arxiv-2610-15072",
+              "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+              "start": 1128,
+              "end": 1157,
+              "quote": "<created>2026-10-10</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr041875",
-              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-              "start": 435,
-              "end": 492,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-15072",
+              "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+              "start": 2360,
+              "end": 2422,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-2166-wcc-2026-006",
+          "id": "assertion.claim.frontier.arxiv-2610-15052",
           "target_kind": "node",
-          "target_sha256": "8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9",
+          "target_sha256": "0e3a409e37368e61d1934fb7914817e87920ade4bb52f91410543bd22aa7049e",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-2166-wcc-2026-006",
-            "label": "Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
+            "id": "claim.frontier.arxiv-2610-15052",
+            "label": "On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"",
+            "summary": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wcc-2026-006",
-                "title": "Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.006"
+                "id": "source.frontier.arxiv-2610-15052",
+                "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.2166/wcc.2026.006",
-                "title": "doi:10.2166/wcc.2026.006",
-                "url": "https://doi.org/10.2166/wcc.2026.006"
+                "id": "arxiv:2610.15052",
+                "title": "arXiv:2610.15052",
+                "url": "https://arxiv.org/abs/2610.15052"
+              },
+              {
+                "id": "doi:10.1109/rusautocon69876.2026.11707364",
+                "title": "doi:10.1109/rusautocon69876.2026.11707364",
+                "url": "https://doi.org/10.1109/rusautocon69876.2026.11707364"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-27",
+              "disclosed_at": "2026-10-10",
               "source_ids": [
-                "source.frontier.doi-10-2166-wcc-2026-006"
+                "source.frontier.arxiv-2610-15052"
               ]
             }
           },
-          "statement": "doi:10.2166/wcc.2026.006 \"Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia\" (CC BY 4.0, published 2026-06-27) reports: \"These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots.\"",
+          "statement": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"",
           "scope": {
-            "population": "The study reported in doi:10.2166/wcc.2026.006",
-            "time": "2026-06-27",
+            "population": "The study reported in arXiv:2610.15052",
+            "time": "2026-10-10",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805766,70 +830834,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
-              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-              "start": 1836,
-              "end": 2035,
-              "quote": "These results demonstrate that the surrogate model can efficiently approximate physically based simulations while maintaining accuracy, enabling rapid identification of groundwater recharge hotspots."
+              "source_id": "source.frontier.arxiv-2610-15052",
+              "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+              "start": 2427,
+              "end": 2572,
+              "quote": "By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster."
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
-              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-              "start": 29321,
-              "end": 29361,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+              "source_id": "source.frontier.arxiv-2610-15052",
+              "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-10</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
-              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-              "start": 405,
-              "end": 462,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-15052",
+              "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+              "start": 1508,
+              "end": 1570,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025jb033060",
+          "id": "assertion.claim.frontier.arxiv-2610-13424",
           "target_kind": "node",
-          "target_sha256": "707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840",
+          "target_sha256": "7fd68d524cf3d375403bd0389a9102fcd5b849bc87b65345f29ff6b9520bbcf8",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025jb033060",
-            "label": "Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
+            "id": "claim.frontier.arxiv-2610-13424",
+            "label": "Minimum-Energy Control for Stochastic Linear Systems",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+            "summary": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jb033060",
-                "title": "Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
-                "url": "https://api.crossref.org/works/10.1029/2025jb033060"
+                "id": "source.frontier.arxiv-2610-13424",
+                "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025jb033060",
-                "title": "doi:10.1029/2025jb033060",
-                "url": "https://doi.org/10.1029/2025jb033060"
+                "id": "arxiv:2610.13424",
+                "title": "arXiv:2610.13424",
+                "url": "https://arxiv.org/abs/2610.13424"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-27",
+              "disclosed_at": "2026-10-09",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025jb033060"
+                "source.frontier.arxiv-2610-13424"
               ]
             }
           },
-          "statement": "doi:10.1029/2025jb033060 \"Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting\" (CC BY 4.0, published 2026-06-27) reports: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+          "statement": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025jb033060",
-            "time": "2026-06-27",
+            "population": "The study reported in arXiv:2610.13424",
+            "time": "2026-10-09",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805837,70 +830905,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jb033060",
-              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-              "start": 2183,
-              "end": 2398,
-              "quote": "We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief."
+              "source_id": "source.frontier.arxiv-2610-13424",
+              "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+              "start": 2131,
+              "end": 2322,
+              "quote": "We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jb033060",
-              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-              "start": 17488,
-              "end": 17528,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+              "source_id": "source.frontier.arxiv-2610-13424",
+              "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-10-09</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jb033060",
-              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-              "start": 424,
-              "end": 481,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-13424",
+              "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+              "start": 1610,
+              "end": 1672,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025ea004610",
+          "id": "assertion.claim.frontier.arxiv-2610-13402",
           "target_kind": "node",
-          "target_sha256": "3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c",
+          "target_sha256": "e285ae55ff03e8b9e1b4ca3e9b041f363f37f4f7dcf5a5393adb43323c720b49",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025ea004610",
-            "label": "An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
+            "id": "claim.frontier.arxiv-2610-13402",
+            "label": "Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"",
+            "summary": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025ea004610",
-                "title": "Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
-                "url": "https://api.crossref.org/works/10.1029/2025ea004610"
+                "id": "source.frontier.arxiv-2610-13402",
+                "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025ea004610",
-                "title": "doi:10.1029/2025ea004610",
-                "url": "https://doi.org/10.1029/2025ea004610"
+                "id": "arxiv:2610.13402",
+                "title": "arXiv:2610.13402",
+                "url": "https://arxiv.org/abs/2610.13402"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-27",
+              "disclosed_at": "2026-10-09",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025ea004610"
+                "source.frontier.arxiv-2610-13402"
               ]
             }
           },
-          "statement": "doi:10.1029/2025ea004610 \"An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals\" (CC BY 4.0, published 2026-06-27) reports: \"The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment.\"",
+          "statement": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025ea004610",
-            "time": "2026-06-27",
+            "population": "The study reported in arXiv:2610.13402",
+            "time": "2026-10-09",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805908,70 +830976,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025ea004610",
-              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-              "start": 1745,
-              "end": 1921,
-              "quote": "The results demonstrate its potential for uncovering insights into ionospheric behavior, atmospheric disturbances, and their interplay with Earth's electromagnetic environment."
+              "source_id": "source.frontier.arxiv-2610-13402",
+              "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+              "start": 2666,
+              "end": 2808,
+              "quote": "Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025ea004610",
-              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-              "start": 9912,
-              "end": 9952,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,27]]}"
+              "source_id": "source.frontier.arxiv-2610-13402",
+              "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-10-09</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025ea004610",
-              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-              "start": 434,
-              "end": 491,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-13402",
+              "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+              "start": 1923,
+              "end": 1985,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2026gl122157",
+          "id": "assertion.claim.frontier.arxiv-2610-12779",
           "target_kind": "node",
-          "target_sha256": "aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284",
+          "target_sha256": "0a200f89117c4ea885fb92d9afa96d2e7d7d182295a3692c61b89e36f100518d",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2026gl122157",
-            "label": "Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
+            "id": "claim.frontier.arxiv-2610-12779",
+            "label": "Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"",
+            "summary": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122157",
-                "title": "Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122157"
+                "id": "source.frontier.arxiv-2610-12779",
+                "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2026gl122157",
-                "title": "doi:10.1029/2026gl122157",
-                "url": "https://doi.org/10.1029/2026gl122157"
+                "id": "arxiv:2610.12779",
+                "title": "arXiv:2610.12779",
+                "url": "https://arxiv.org/abs/2610.12779"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-26",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1029-2026gl122157"
+                "source.frontier.arxiv-2610-12779"
               ]
             }
           },
-          "statement": "doi:10.1029/2026gl122157 \"Coarse Sediment Transport in a Near‐Terminus Subglacial Channel\" (CC BY 4.0, published 2026-06-26) reports: \"These observations indicate substantial coarse sediment retention within an active near‐terminus subglacial channel, potentially weakening short‐term correspondence between coarse subglacial transport and proglacial sediment export.\"",
+          "statement": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2026gl122157",
-            "time": "2026-06-26",
+            "population": "The study reported in arXiv:2610.12779",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -805979,70 +831047,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122157",
-              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-              "start": 1750,
-              "end": 1992,
-              "quote": "These observations indicate substantial coarse sediment retention within an active near\\u2010terminus subglacial channel, potentially weakening short\\u2010term correspondence between coarse subglacial transport and proglacial sediment export."
+              "source_id": "source.frontier.arxiv-2610-12779",
+              "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+              "start": 2510,
+              "end": 2854,
+              "quote": "We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122157",
-              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-              "start": 9959,
-              "end": 9999,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,26]]}"
+              "source_id": "source.frontier.arxiv-2610-12779",
+              "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122157",
-              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-              "start": 426,
-              "end": 483,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-12779",
+              "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+              "start": 1545,
+              "end": 1607,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-esp4-70096",
+          "id": "assertion.claim.frontier.arxiv-2610-12604",
           "target_kind": "node",
-          "target_sha256": "5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2",
+          "target_sha256": "6dcaef89852aeb2edfb2adc04ae2c4909e6411ad977b12fa8f8ec8c436befca5",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-esp4-70096",
-            "label": "Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
+            "id": "claim.frontier.arxiv-2610-12604",
+            "label": "Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"",
+            "summary": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-esp4-70096",
-                "title": "Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
-                "url": "https://api.crossref.org/works/10.1002/esp4.70096"
+                "id": "source.frontier.arxiv-2610-12604",
+                "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/esp4.70096",
-                "title": "doi:10.1002/esp4.70096",
-                "url": "https://doi.org/10.1002/esp4.70096"
+                "id": "arxiv:2610.12604",
+                "title": "arXiv:2610.12604",
+                "url": "https://arxiv.org/abs/2610.12604"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-25",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1002-esp4-70096"
+                "source.frontier.arxiv-2610-12604"
               ]
             }
           },
-          "statement": "doi:10.1002/esp4.70096 \"Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities\" (CC BY 4.0, published 2026-06-25) reports: \"In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance.\"",
+          "statement": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/esp4.70096",
-            "time": "2026-06-25",
+            "population": "The study reported in arXiv:2610.12604",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806050,70 +831118,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70096",
-              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-              "start": 2142,
-              "end": 2303,
-              "quote": "In our approach, we find the geodetic stations exhibit a standard deviation of 0.36 natural log units while the seismic stations are not degraded in performance."
+              "source_id": "source.frontier.arxiv-2610-12604",
+              "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+              "start": 2287,
+              "end": 2368,
+              "quote": "Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70096",
-              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-              "start": 11048,
-              "end": 11088,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,25]]}"
+              "source_id": "source.frontier.arxiv-2610-12604",
+              "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70096",
-              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-12604",
+              "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+              "start": 1709,
+              "end": 1777,
+              "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-bioe-70124",
+          "id": "assertion.claim.frontier.arxiv-2610-12592",
           "target_kind": "node",
-          "target_sha256": "46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9",
+          "target_sha256": "8380fa2096717d776a89ef4c3ad492c5fed1d514dae0765acccecf4507522cd3",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-bioe-70124",
-            "label": "The Concept of Harm in Medical Ethics",
+            "id": "claim.frontier.arxiv-2610-12592",
+            "label": "Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"",
+            "summary": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-bioe-70124",
-                "title": "Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics",
-                "url": "https://api.crossref.org/works/10.1111/bioe.70124"
+                "id": "source.frontier.arxiv-2610-12592",
+                "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/bioe.70124",
-                "title": "doi:10.1111/bioe.70124",
-                "url": "https://doi.org/10.1111/bioe.70124"
+                "id": "arxiv:2610.12592",
+                "title": "arXiv:2610.12592",
+                "url": "https://arxiv.org/abs/2610.12592"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-24",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1111-bioe-70124"
+                "source.frontier.arxiv-2610-12592"
               ]
             }
           },
-          "statement": "doi:10.1111/bioe.70124 \"The Concept of Harm in Medical Ethics\" (CC BY 4.0, published 2026-06-24) reports: \"By applying three prevailing theoretical‐philosophical frameworks—the counterfactual, temporal, and non‐comparative accounts of harm—to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare.\"",
+          "statement": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/bioe.70124",
-            "time": "2026-06-24",
+            "population": "The study reported in arXiv:2610.12592",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806121,70 +831189,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-bioe-70124",
-              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-              "start": 1404,
-              "end": 1729,
-              "quote": "By applying three prevailing theoretical\\u2010philosophical frameworks\\u2014the counterfactual, temporal, and non\\u2010comparative accounts of harm\\u2014to these cases, we demonstrate that explicitly identifying and discussing stakeholders' varying concepts of harm is crucial for ethical analyses in medicine and healthcare."
+              "source_id": "source.frontier.arxiv-2610-12592",
+              "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+              "start": 3102,
+              "end": 3239,
+              "quote": "The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-bioe-70124",
-              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-              "start": 9714,
-              "end": 9754,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,24]]}"
+              "source_id": "source.frontier.arxiv-2610-12592",
+              "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-bioe-70124",
-              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-              "start": 397,
-              "end": 454,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-12592",
+              "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+              "start": 2021,
+              "end": 2089,
+              "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-adom-71396",
+          "id": "assertion.claim.frontier.arxiv-2610-12038",
           "target_kind": "node",
-          "target_sha256": "7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea",
+          "target_sha256": "ec13f9f86b5c1bc03a718e7b995a3a59562425a615d9fa13d6020ef08ccfcab7",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-adom-71396",
-            "label": "Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
+            "id": "claim.frontier.arxiv-2610-12038",
+            "label": "Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
             "kind": "claim",
-            "domain": "engineering",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+            "summary": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-adom-71396",
-                "title": "Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
-                "url": "https://api.crossref.org/works/10.1002/adom.71396"
+                "id": "source.frontier.arxiv-2610-12038",
+                "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/adom.71396",
-                "title": "doi:10.1002/adom.71396",
-                "url": "https://doi.org/10.1002/adom.71396"
+                "id": "arxiv:2610.12038",
+                "title": "arXiv:2610.12038",
+                "url": "https://arxiv.org/abs/2610.12038"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-24",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1002-adom-71396"
+                "source.frontier.arxiv-2610-12038"
               ]
             }
           },
-          "statement": "doi:10.1002/adom.71396 \"Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles\" (CC BY 4.0, published 2026-06-24) reports: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+          "statement": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/adom.71396",
-            "time": "2026-06-24",
+            "population": "The study reported in arXiv:2610.12038",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806192,70 +831260,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-adom-71396",
-              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-              "start": 1885,
-              "end": 2133,
-              "quote": "The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics."
+              "source_id": "source.frontier.arxiv-2610-12038",
+              "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+              "start": 2437,
+              "end": 2617,
+              "quote": "We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-adom-71396",
-              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-              "start": 8102,
-              "end": 8142,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,24]]}"
+              "source_id": "source.frontier.arxiv-2610-12038",
+              "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-adom-71396",
-              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-              "start": 399,
-              "end": 456,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-12038",
+              "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+              "start": 1774,
+              "end": 1836,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-ese3-70586",
+          "id": "assertion.claim.frontier.arxiv-2610-11869",
           "target_kind": "node",
-          "target_sha256": "3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144",
+          "target_sha256": "104824c9bc6d60ddd5a41780eb1897630158af4f1439f0be39b07494895010f7",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-ese3-70586",
-            "label": "Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
+            "id": "claim.frontier.arxiv-2610-11869",
+            "label": "Learning structured linear dynamical systems from missing observations",
             "kind": "claim",
-            "domain": "engineering",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"",
+            "summary": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ese3-70586",
-                "title": "Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
-                "url": "https://api.crossref.org/works/10.1002/ese3.70586"
+                "id": "source.frontier.arxiv-2610-11869",
+                "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/ese3.70586",
-                "title": "doi:10.1002/ese3.70586",
-                "url": "https://doi.org/10.1002/ese3.70586"
+                "id": "arxiv:2610.11869",
+                "title": "arXiv:2610.11869",
+                "url": "https://arxiv.org/abs/2610.11869"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-23",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1002-ese3-70586"
+                "source.frontier.arxiv-2610-11869"
               ]
             }
           },
-          "statement": "doi:10.1002/ese3.70586 \"Influence of Structural and Environmental Parameters on Solar Air Collector Performance\" (CC BY 4.0, published 2026-06-23) reports: \"The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%.\"",
+          "statement": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/ese3.70586",
-            "time": "2026-06-23",
+            "population": "The study reported in arXiv:2610.11869",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806263,70 +831331,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ese3-70586",
-              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-              "start": 1553,
-              "end": 1699,
-              "quote": "The results demonstrate good agreement between the experimental and simulated data, with the error in instantaneous efficiency remaining below 6%."
+              "source_id": "source.frontier.arxiv-2610-11869",
+              "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+              "start": 2919,
+              "end": 3083,
+              "quote": "We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-ese3-70586",
-              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-              "start": 9310,
-              "end": 9350,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,23]]}"
+              "source_id": "source.frontier.arxiv-2610-11869",
+              "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+              "start": 1220,
+              "end": 1249,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-ese3-70586",
-              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-11869",
+              "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+              "start": 2051,
+              "end": 2113,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1144-jgs2026-039",
+          "id": "assertion.claim.frontier.arxiv-2610-11359",
           "target_kind": "node",
-          "target_sha256": "a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714",
+          "target_sha256": "ef2bb7a5097b6ae986fc47841ce396d2c9fbe30195e3e73a5fec64050fafdee9",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1144-jgs2026-039",
-            "label": "Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
+            "id": "claim.frontier.arxiv-2610-11359",
+            "label": "Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+            "summary": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1144-jgs2026-039",
-                "title": "Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
-                "url": "https://api.crossref.org/works/10.1144/jgs2026-039"
+                "id": "source.frontier.arxiv-2610-11359",
+                "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1144/jgs2026-039",
-                "title": "doi:10.1144/jgs2026-039",
-                "url": "https://doi.org/10.1144/jgs2026-039"
+                "id": "arxiv:2610.11359",
+                "title": "arXiv:2610.11359",
+                "url": "https://arxiv.org/abs/2610.11359"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-22",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1144-jgs2026-039"
+                "source.frontier.arxiv-2610-11359"
               ]
             }
           },
-          "statement": "doi:10.1144/jgs2026-039 \"Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study\" (CC BY 4.0, published 2026-06-22) reports: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+          "statement": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"",
           "scope": {
-            "population": "The study reported in doi:10.1144/jgs2026-039",
-            "time": "2026-06-22",
+            "population": "The study reported in arXiv:2610.11359",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806334,70 +831402,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
-              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-              "start": 2040,
-              "end": 2167,
-              "quote": "We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units."
+              "source_id": "source.frontier.arxiv-2610-11359",
+              "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+              "start": 3094,
+              "end": 3264,
+              "quote": "The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods."
             },
             {
-              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
-              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-              "start": 53124,
-              "end": 53164,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,22]]}"
+              "source_id": "source.frontier.arxiv-2610-11359",
+              "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
-              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-              "start": 431,
-              "end": 488,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-11359",
+              "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+              "start": 1957,
+              "end": 2019,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-hec-70120",
+          "id": "assertion.claim.frontier.arxiv-2610-04959",
           "target_kind": "node",
-          "target_sha256": "06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715",
+          "target_sha256": "60803abde49981b3e9b515f13c3ec84a0dd2b7a33767e4841de7fa7eb61e4153",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-hec-70120",
-            "label": "Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
+            "id": "claim.frontier.arxiv-2610-04959",
+            "label": "AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
             "kind": "claim",
-            "domain": "social",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"",
+            "summary": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-hec-70120",
-                "title": "Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
-                "url": "https://api.crossref.org/works/10.1002/hec.70120"
+                "id": "source.frontier.arxiv-2610-04959",
+                "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/hec.70120",
-                "title": "doi:10.1002/hec.70120",
-                "url": "https://doi.org/10.1002/hec.70120"
+                "id": "arxiv:2610.04959",
+                "title": "arXiv:2610.04959",
+                "url": "https://arxiv.org/abs/2610.04959"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-22",
+              "disclosed_at": "2026-10-08",
               "source_ids": [
-                "source.frontier.doi-10-1002-hec-70120"
+                "source.frontier.arxiv-2610-04959"
               ]
             }
           },
-          "statement": "doi:10.1002/hec.70120 \"Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight\" (CC BY 4.0, published 2026-06-22) reports: \"Using 2009–2019 Behavioral Risk Factor Surveillance System data and a two‐way fixed‐effects difference‐in‐differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution.\"",
+          "statement": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/hec.70120",
-            "time": "2026-06-22",
+            "population": "The study reported in arXiv:2610.04959",
+            "time": "2026-10-08",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806405,70 +831473,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-hec-70120",
-              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-              "start": 1073,
-              "end": 1327,
-              "quote": "Using 2009\\u20132019 Behavioral Risk Factor Surveillance System data and a two\\u2010way fixed\\u2010effects difference\\u2010in\\u2010differences (DID) design, we find limited evidence of broad weight changes in either direction across the BMI distribution."
+              "source_id": "source.frontier.arxiv-2610-04959",
+              "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+              "start": 4051,
+              "end": 4313,
+              "quote": "Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-hec-70120",
-              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-              "start": 14061,
-              "end": 14101,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,22]]}"
+              "source_id": "source.frontier.arxiv-2610-04959",
+              "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+              "start": 1006,
+              "end": 1035,
+              "quote": "<created>2026-10-08</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-hec-70120",
-              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-              "start": 397,
-              "end": 454,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04959",
+              "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+              "start": 2482,
+              "end": 2544,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-1467-9477-70049",
+          "id": "assertion.claim.frontier.arxiv-2610-09266",
           "target_kind": "node",
-          "target_sha256": "7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193",
+          "target_sha256": "fdd9b401372df0dbb49a1d2bf4e09b6e34a692866c08d6774d7fb696ee261765",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-1467-9477-70049",
-            "label": "The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
+            "id": "claim.frontier.arxiv-2610-09266",
+            "label": "Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
             "kind": "claim",
-            "domain": "social",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+            "summary": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-1467-9477-70049",
-                "title": "Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
-                "url": "https://api.crossref.org/works/10.1111/1467-9477.70049"
+                "id": "source.frontier.arxiv-2610-09266",
+                "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/1467-9477.70049",
-                "title": "doi:10.1111/1467-9477.70049",
-                "url": "https://doi.org/10.1111/1467-9477.70049"
+                "id": "arxiv:2610.09266",
+                "title": "arXiv:2610.09266",
+                "url": "https://arxiv.org/abs/2610.09266"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-21",
+              "disclosed_at": "2026-10-07",
               "source_ids": [
-                "source.frontier.doi-10-1111-1467-9477-70049"
+                "source.frontier.arxiv-2610-09266"
               ]
             }
           },
-          "statement": "doi:10.1111/1467-9477.70049 \"The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics\" (CC BY 4.0, published 2026-06-21) reports: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+          "statement": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/1467-9477.70049",
-            "time": "2026-06-21",
+            "population": "The study reported in arXiv:2610.09266",
+            "time": "2026-10-07",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806476,70 +831544,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
-              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-              "start": 2081,
-              "end": 2414,
-              "quote": "We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting."
+              "source_id": "source.frontier.arxiv-2610-09266",
+              "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+              "start": 3311,
+              "end": 3543,
+              "quote": "Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
-              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-              "start": 9346,
-              "end": 9386,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,21]]}"
+              "source_id": "source.frontier.arxiv-2610-09266",
+              "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-07</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
-              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-09266",
+              "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+              "start": 1912,
+              "end": 1974,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-faam-70045",
+          "id": "assertion.claim.frontier.arxiv-2610-09080",
           "target_kind": "node",
-          "target_sha256": "347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b",
+          "target_sha256": "0c3a9ae37aecef4ef7a9939bb97f945686dce9d6fe36f0350d4fb9fcc35badb5",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-faam-70045",
-            "label": "Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
+            "id": "claim.frontier.arxiv-2610-09080",
+            "label": "User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
             "kind": "claim",
-            "domain": "social",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"",
+            "summary": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-faam-70045",
-                "title": "Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
-                "url": "https://api.crossref.org/works/10.1111/faam.70045"
+                "id": "source.frontier.arxiv-2610-09080",
+                "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/faam.70045",
-                "title": "doi:10.1111/faam.70045",
-                "url": "https://doi.org/10.1111/faam.70045"
+                "id": "arxiv:2610.09080",
+                "title": "arXiv:2610.09080",
+                "url": "https://arxiv.org/abs/2610.09080"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-20",
+              "disclosed_at": "2026-10-06",
               "source_ids": [
-                "source.frontier.doi-10-1111-faam-70045"
+                "source.frontier.arxiv-2610-09080"
               ]
             }
           },
-          "statement": "doi:10.1111/faam.70045 \"Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context\" (CC BY 4.0, published 2026-06-20) reports: \"Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism.\"",
+          "statement": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/faam.70045",
-            "time": "2026-06-20",
+            "population": "The study reported in arXiv:2610.09080",
+            "time": "2026-10-06",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806547,70 +831615,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-faam-70045",
-              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-              "start": 2131,
-              "end": 2317,
-              "quote": "Drawing on documentary evidence and interviews with revenue officials, taxpayers, and tax professionals, we show how accountability is practiced in a context shaped by neopatrimonialism."
-            },
-            {
-              "source_id": "source.frontier.doi-10-1111-faam-70045",
-              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-              "start": 29147,
-              "end": 29187,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,20]]}"
+              "source_id": "source.frontier.arxiv-2610-09080",
+              "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+              "start": 2657,
+              "end": 2912,
+              "quote": "Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-faam-70045",
-              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-              "start": 386,
-              "end": 443,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-09080",
+              "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-06</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2610-09080",
+              "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+              "start": 1684,
+              "end": 1746,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-58491-2735-4202-3413",
+          "id": "assertion.claim.frontier.arxiv-2610-09010",
           "target_kind": "node",
-          "target_sha256": "cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f",
+          "target_sha256": "c01171a7378737c5492419b63a6668029115d5d11b8913c81e55b38fab25e949",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-58491-2735-4202-3413",
-            "label": "EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
+            "id": "claim.frontier.arxiv-2610-09010",
+            "label": "Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
             "kind": "claim",
-            "domain": "engineering",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"",
+            "summary": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-58491-2735-4202-3413",
-                "title": "Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
-                "url": "https://api.crossref.org/works/10.58491/2735-4202.3413"
+                "id": "source.frontier.arxiv-2610-09010",
+                "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.58491/2735-4202.3413",
-                "title": "doi:10.58491/2735-4202.3413",
-                "url": "https://doi.org/10.58491/2735-4202.3413"
+                "id": "arxiv:2610.09010",
+                "title": "arXiv:2610.09010",
+                "url": "https://arxiv.org/abs/2610.09010"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-18",
+              "disclosed_at": "2026-10-06",
               "source_ids": [
-                "source.frontier.doi-10-58491-2735-4202-3413"
+                "source.frontier.arxiv-2610-09010"
               ]
             }
           },
-          "statement": "doi:10.58491/2735-4202.3413 \"EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL\" (CC BY 4.0, published 2026-06-18) reports: \"The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12° to nearly 28°.\"",
+          "statement": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"",
           "scope": {
-            "population": "The study reported in doi:10.58491/2735-4202.3413",
-            "time": "2026-06-18",
+            "population": "The study reported in arXiv:2610.09010",
+            "time": "2026-10-06",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806618,70 +831686,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
-              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-              "start": 1306,
-              "end": 1458,
-              "quote": "The results show an increase in the maximum lift coefficient of up to 45%, with the stall angle extended from approximately 12\\u00b0 to nearly 28\\u00b0."
+              "source_id": "source.frontier.arxiv-2610-09010",
+              "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+              "start": 3388,
+              "end": 3580,
+              "quote": "Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate."
             },
             {
-              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
-              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-              "start": 3238,
-              "end": 3278,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,18]]}"
+              "source_id": "source.frontier.arxiv-2610-09010",
+              "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-06</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
-              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-              "start": 411,
-              "end": 468,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-09010",
+              "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+              "start": 1682,
+              "end": 1744,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025gl121378",
+          "id": "assertion.claim.frontier.arxiv-2610-08744",
           "target_kind": "node",
-          "target_sha256": "f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385",
+          "target_sha256": "d94b8ceb803f23d37998dc793883f64d4110c56a071339d7f27d629ce51cd53a",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025gl121378",
-            "label": "Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
+            "id": "claim.frontier.arxiv-2610-08744",
+            "label": "RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"",
+            "summary": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gl121378",
-                "title": "Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121378"
+                "id": "source.frontier.arxiv-2610-08744",
+                "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025gl121378",
-                "title": "doi:10.1029/2025gl121378",
-                "url": "https://doi.org/10.1029/2025gl121378"
+                "id": "arxiv:2610.08744",
+                "title": "arXiv:2610.08744",
+                "url": "https://arxiv.org/abs/2610.08744"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-16",
+              "disclosed_at": "2026-10-06",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025gl121378"
+                "source.frontier.arxiv-2610-08744"
               ]
             }
           },
-          "statement": "doi:10.1029/2025gl121378 \"Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed\" (CC BY 4.0, published 2026-06-16) reports: \"These findings highlight the utility of dv/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater–vegetation interactions, and supporting ecohydrological research and water management in semi‐arid snowmelt systems.\"",
+          "statement": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025gl121378",
-            "time": "2026-06-16",
+            "population": "The study reported in arXiv:2610.08744",
+            "time": "2026-10-06",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806689,70 +831757,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121378",
-              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-              "start": 2343,
-              "end": 2659,
-              "quote": "These findings highlight the utility of dv\\/v measurements in detecting laterally supplied water inputs, providing insight into local vertical water losses, effectively tracking groundwater\\u2013vegetation interactions, and supporting ecohydrological research and water management in semi\\u2010arid snowmelt systems."
+              "source_id": "source.frontier.arxiv-2610-08744",
+              "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+              "start": 2897,
+              "end": 3062,
+              "quote": "Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121378",
-              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-              "start": 13315,
-              "end": 13355,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,16]]}"
+              "source_id": "source.frontier.arxiv-2610-08744",
+              "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-06</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121378",
-              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-              "start": 436,
-              "end": 493,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-08744",
+              "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+              "start": 1686,
+              "end": 1748,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421",
+          "id": "assertion.claim.frontier.arxiv-2610-07616",
           "target_kind": "node",
-          "target_sha256": "5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2",
+          "target_sha256": "d6f577c6e767b6a3d5dff779e57b0cec93ec5198c9c36efaaf2dbeb35c1ae950",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-56403-nejesh-v5i2-421",
-            "label": "The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective",
+            "id": "claim.frontier.arxiv-2610-07616",
+            "label": "Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+            "summary": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-                "title": "Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe",
-                "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421"
+                "id": "source.frontier.arxiv-2610-07616",
+                "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.56403/nejesh.v5i2.421",
-                "title": "doi:10.56403/nejesh.v5i2.421",
-                "url": "https://doi.org/10.56403/nejesh.v5i2.421"
+                "id": "arxiv:2610.07616",
+                "title": "arXiv:2610.07616",
+                "url": "https://arxiv.org/abs/2610.07616"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-11",
+              "disclosed_at": "2026-10-06",
               "source_ids": [
-                "source.frontier.doi-10-56403-nejesh-v5i2-421"
+                "source.frontier.arxiv-2610-07616"
               ]
             }
           },
-          "statement": "doi:10.56403/nejesh.v5i2.421 \"The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspective\" (CC BY 4.0, published 2026-06-11) reports: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+          "statement": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
           "scope": {
-            "population": "The study reported in doi:10.56403/nejesh.v5i2.421",
-            "time": "2026-06-11",
+            "population": "The study reported in arXiv:2610.07616",
+            "time": "2026-10-06",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806760,70 +831828,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-              "start": 1118,
-              "end": 1329,
-              "quote": "The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect."
+              "source_id": "source.frontier.arxiv-2610-07616",
+              "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+              "start": 2055,
+              "end": 2165,
+              "quote": "Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets."
             },
             {
-              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-              "start": 9496,
-              "end": 9536,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+              "source_id": "source.frontier.arxiv-2610-07616",
+              "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-06</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-              "start": 466,
-              "end": 523,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-07616",
+              "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+              "start": 1555,
+              "end": 1617,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2026gl123355",
+          "id": "assertion.claim.frontier.arxiv-2610-07307",
           "target_kind": "node",
-          "target_sha256": "88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34",
+          "target_sha256": "e717ce32d00a85ef8fa8159b789a4cdbe0f6b9a395412689002cb57f96b7c736",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2026gl123355",
-            "label": "Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
+            "id": "claim.frontier.arxiv-2610-07307",
+            "label": "Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"",
+            "summary": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl123355",
-                "title": "Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
-                "url": "https://api.crossref.org/works/10.1029/2026gl123355"
+                "id": "source.frontier.arxiv-2610-07307",
+                "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2026gl123355",
-                "title": "doi:10.1029/2026gl123355",
-                "url": "https://doi.org/10.1029/2026gl123355"
+                "id": "arxiv:2610.07307",
+                "title": "arXiv:2610.07307",
+                "url": "https://arxiv.org/abs/2610.07307"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-11",
+              "disclosed_at": "2026-10-05",
               "source_ids": [
-                "source.frontier.doi-10-1029-2026gl123355"
+                "source.frontier.arxiv-2610-07307"
               ]
             }
           },
-          "statement": "doi:10.1029/2026gl123355 \"Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary\" (CC BY 4.0, published 2026-06-11) reports: \"We report a rare quiet‐time observation by NOAA‐18 spacecraft flying nearly along the electron isotropy boundary (IBe).\"",
+          "statement": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2026gl123355",
-            "time": "2026-06-11",
+            "population": "The study reported in arXiv:2610.07307",
+            "time": "2026-10-05",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806831,70 +831899,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl123355",
-              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-              "start": 1702,
-              "end": 1831,
-              "quote": "We report a rare quiet\\u2010time observation by NOAA\\u201018 spacecraft flying nearly along the electron isotropy boundary (IBe)."
+              "source_id": "source.frontier.arxiv-2610-07307",
+              "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+              "start": 2947,
+              "end": 3029,
+              "quote": "We also derive a step-size condition for implementing the method in discrete time."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl123355",
-              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-              "start": 10931,
-              "end": 10971,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+              "source_id": "source.frontier.arxiv-2610-07307",
+              "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-05</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl123355",
-              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-              "start": 436,
-              "end": 493,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-07307",
+              "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+              "start": 1979,
+              "end": 2041,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025gl121171",
+          "id": "assertion.claim.frontier.arxiv-2610-06601",
           "target_kind": "node",
-          "target_sha256": "34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89",
+          "target_sha256": "e08ebb0c4834db59eeadb6300fd9ea46ee16d77838acbe39e48dff4b98eeb018",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025gl121171",
-            "label": "Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
+            "id": "claim.frontier.arxiv-2610-06601",
+            "label": "Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"",
+            "summary": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gl121171",
-                "title": "Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121171"
+                "id": "source.frontier.arxiv-2610-06601",
+                "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025gl121171",
-                "title": "doi:10.1029/2025gl121171",
-                "url": "https://doi.org/10.1029/2025gl121171"
+                "id": "arxiv:2610.06601",
+                "title": "arXiv:2610.06601",
+                "url": "https://arxiv.org/abs/2610.06601"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-11",
+              "disclosed_at": "2026-10-05",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025gl121171"
+                "source.frontier.arxiv-2610-06601"
               ]
             }
           },
-          "statement": "doi:10.1029/2025gl121171 \"Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes\" (CC BY 4.0, published 2026-06-11) reports: \"Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top‐down estimates of the terrestrial carbon sink.\"",
+          "statement": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025gl121171",
-            "time": "2026-06-11",
+            "population": "The study reported in arXiv:2610.06601",
+            "time": "2026-10-05",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806902,70 +831970,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121171",
-              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-              "start": 2451,
-              "end": 2602,
-              "quote": "Our results highlight that accurate photosynthesis parameterization is fundamental to advancing top\\u2010down estimates of the terrestrial carbon sink."
+              "source_id": "source.frontier.arxiv-2610-06601",
+              "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+              "start": 3235,
+              "end": 3598,
+              "quote": "Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121171",
-              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-              "start": 12665,
-              "end": 12705,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,11]]}"
+              "source_id": "source.frontier.arxiv-2610-06601",
+              "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-05</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121171",
-              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-              "start": 436,
-              "end": 493,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-06601",
+              "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+              "start": 1877,
+              "end": 1939,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025jd044617",
+          "id": "assertion.claim.frontier.arxiv-2610-04776",
           "target_kind": "node",
-          "target_sha256": "0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9",
+          "target_sha256": "51232f01e536c301d3c9507922fd51d0207c8f39dc571ceff9df1974cca740c2",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025jd044617",
-            "label": "Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought",
+            "id": "claim.frontier.arxiv-2610-04776",
+            "label": "Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"",
+            "summary": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd044617",
-                "title": "Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou",
-                "url": "https://api.crossref.org/works/10.1029/2025jd044617"
+                "id": "source.frontier.arxiv-2610-04776",
+                "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025jd044617",
-                "title": "doi:10.1029/2025jd044617",
-                "url": "https://doi.org/10.1029/2025jd044617"
+                "id": "arxiv:2610.04776",
+                "title": "arXiv:2610.04776",
+                "url": "https://arxiv.org/abs/2610.04776"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-10",
+              "disclosed_at": "2026-10-03",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025jd044617"
+                "source.frontier.arxiv-2610-04776"
               ]
             }
           },
-          "statement": "doi:10.1029/2025jd044617 \"Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drought\" (CC BY 4.0, published 2026-06-10) reports: \"We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper‐level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall.\"",
+          "statement": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025jd044617",
-            "time": "2026-06-10",
+            "population": "The study reported in arXiv:2610.04776",
+            "time": "2026-10-03",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -806973,70 +832041,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd044617",
-              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-              "start": 1646,
-              "end": 1917,
-              "quote": "We found that Western U.S. droughts are generally associated with an anomalously strong ridge that displaces the storm track, leading to fewer incursions of transient upper\\u2010level disturbances (less Eddy Kinetic Energy (EKE)) into the Western U.S. in summer and fall."
+              "source_id": "source.frontier.arxiv-2610-04776",
+              "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+              "start": 3268,
+              "end": 3505,
+              "quote": "Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd044617",
-              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-              "start": 14732,
-              "end": 14772,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,10]]}"
+              "source_id": "source.frontier.arxiv-2610-04776",
+              "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+              "start": 1172,
+              "end": 1201,
+              "quote": "<created>2026-10-03</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd044617",
-              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-              "start": 426,
-              "end": 483,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04776",
+              "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+              "start": 2177,
+              "end": 2239,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+          "id": "assertion.claim.frontier.arxiv-2610-04697",
           "target_kind": "node",
-          "target_sha256": "6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6",
+          "target_sha256": "ba68b962702ca2a36672b8439d35ccfa89a80b48aeef8b95aed892c80911b788",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-22378-he-2026-11-2-218-234",
-            "label": "Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)",
+            "id": "claim.frontier.arxiv-2610-04697",
+            "label": "Efficiency and robustness partition the solution space for memory in recurrent networks",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"",
+            "summary": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-                "title": "Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ",
-                "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"
+                "id": "source.frontier.arxiv-2610-04697",
+                "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.22378/he.2026-11-2.218-234",
-                "title": "doi:10.22378/he.2026-11-2.218-234",
-                "url": "https://doi.org/10.22378/he.2026-11-2.218-234"
+                "id": "arxiv:2610.04697",
+                "title": "arXiv:2610.04697",
+                "url": "https://arxiv.org/abs/2610.04697"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-08",
+              "disclosed_at": "2026-10-03",
               "source_ids": [
-                "source.frontier.doi-10-22378-he-2026-11-2-218-234"
+                "source.frontier.arxiv-2610-04697"
               ]
             }
           },
-          "statement": "doi:10.22378/he.2026-11-2.218-234 \"Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute of History of the Tatarstan Academy of Sciences)\" (CC BY 4.0, published 2026-06-08) reports: \"The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people.\"",
+          "statement": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"",
           "scope": {
-            "population": "The study reported in doi:10.22378/he.2026-11-2.218-234",
-            "time": "2026-06-08",
+            "population": "The study reported in arXiv:2610.04697",
+            "time": "2026-10-03",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807044,70 +832112,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-              "start": 1613,
-              "end": 1761,
-              "quote": "The third stage, from 2015 to the present day, is associated with in-depth study of a number of areas important for the history of the Tatar people."
+              "source_id": "source.frontier.arxiv-2610-04697",
+              "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+              "start": 2238,
+              "end": 2526,
+              "quote": "We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification."
             },
             {
-              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-              "start": 14981,
-              "end": 15020,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,8]]}"
+              "source_id": "source.frontier.arxiv-2610-04697",
+              "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+              "start": 966,
+              "end": 995,
+              "quote": "<created>2026-10-03</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-              "start": 428,
-              "end": 485,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04697",
+              "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+              "start": 1547,
+              "end": 1609,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025jd045718",
+          "id": "assertion.claim.frontier.arxiv-2610-04662",
           "target_kind": "node",
-          "target_sha256": "36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7",
+          "target_sha256": "1197384dd2bdaeaa27e6a1e2d3d7a19447d2b4c296430bce44eb7b8692631fb3",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025jd045718",
-            "label": "Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
+            "id": "claim.frontier.arxiv-2610-04662",
+            "label": "Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"",
+            "summary": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd045718",
-                "title": "Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
-                "url": "https://api.crossref.org/works/10.1029/2025jd045718"
+                "id": "source.frontier.arxiv-2610-04662",
+                "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025jd045718",
-                "title": "doi:10.1029/2025jd045718",
-                "url": "https://doi.org/10.1029/2025jd045718"
+                "id": "arxiv:2610.04662",
+                "title": "arXiv:2610.04662",
+                "url": "https://arxiv.org/abs/2610.04662"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-06",
+              "disclosed_at": "2026-10-03",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025jd045718"
+                "source.frontier.arxiv-2610-04662"
               ]
             }
           },
-          "statement": "doi:10.1029/2025jd045718 \"Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season\" (CC BY 4.0, published 2026-06-06) reports: \"The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer.\"",
+          "statement": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025jd045718",
-            "time": "2026-06-06",
+            "population": "The study reported in arXiv:2610.04662",
+            "time": "2026-10-03",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807115,70 +832183,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045718",
-              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-              "start": 1844,
-              "end": 2165,
-              "quote": "The suppression of moisture transport is associated with persistent westward or northward extensions of the western North Pacific subtropical high and eastward extensions of the Tibetan High (South Asian High) in midsummer, as well as recurrent ridge formation linked to meandering midlatitude westerlies in early summer."
+              "source_id": "source.frontier.arxiv-2610-04662",
+              "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+              "start": 3237,
+              "end": 3488,
+              "quote": "We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045718",
-              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-              "start": 11103,
-              "end": 11142,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,6]]}"
+              "source_id": "source.frontier.arxiv-2610-04662",
+              "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-03</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045718",
-              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-              "start": 425,
-              "end": 482,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04662",
+              "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+              "start": 1985,
+              "end": 2047,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2026gl122664",
+          "id": "assertion.claim.frontier.arxiv-2610-04630",
           "target_kind": "node",
-          "target_sha256": "f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af",
+          "target_sha256": "55024c472b37b3c38ae899c1bfe3976e3d6a17e3bce51137a4015acebeba897a",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2026gl122664",
-            "label": "From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
+            "id": "claim.frontier.arxiv-2610-04630",
+            "label": "Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "engineering",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"",
+            "summary": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122664",
-                "title": "Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122664"
+                "id": "source.frontier.arxiv-2610-04630",
+                "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2026gl122664",
-                "title": "doi:10.1029/2026gl122664",
-                "url": "https://doi.org/10.1029/2026gl122664"
+                "id": "arxiv:2610.04630",
+                "title": "arXiv:2610.04630",
+                "url": "https://arxiv.org/abs/2610.04630"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-04",
+              "disclosed_at": "2026-10-03",
               "source_ids": [
-                "source.frontier.doi-10-1029-2026gl122664"
+                "source.frontier.arxiv-2610-04630"
               ]
             }
           },
-          "statement": "doi:10.1029/2026gl122664 \"From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum\" (CC BY 4.0, published 2026-06-04) reports: \"Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake‐river science and water management.\"",
+          "statement": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2026gl122664",
-            "time": "2026-06-04",
+            "population": "The study reported in arXiv:2610.04630",
+            "time": "2026-10-03",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807186,70 +832254,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122664",
-              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-              "start": 2288,
-              "end": 2456,
-              "quote": "Together, these results demonstrate SWOT's unique potential for global LARIC characterization and underscore its value for lake\\u2010river science and water management."
+              "source_id": "source.frontier.arxiv-2610-04630",
+              "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+              "start": 3708,
+              "end": 3940,
+              "quote": "Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122664",
-              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-              "start": 12101,
-              "end": 12140,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,4]]}"
+              "source_id": "source.frontier.arxiv-2610-04630",
+              "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-10-03</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122664",
-              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-              "start": 435,
-              "end": 492,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04630",
+              "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+              "start": 1965,
+              "end": 2027,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-ojoa-70022",
+          "id": "assertion.claim.frontier.arxiv-2610-04242",
           "target_kind": "node",
-          "target_sha256": "4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9",
+          "target_sha256": "a9a0ffb810b154d47ba126e2ae200c97999c6308914a1190664cddc15f0e5acb",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-ojoa-70022",
-            "label": "QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
+            "id": "claim.frontier.arxiv-2610-04242",
+            "label": "Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"",
+            "summary": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ojoa-70022",
-                "title": "Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
-                "url": "https://api.crossref.org/works/10.1111/ojoa.70022"
+                "id": "source.frontier.arxiv-2610-04242",
+                "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/ojoa.70022",
-                "title": "doi:10.1111/ojoa.70022",
-                "url": "https://doi.org/10.1111/ojoa.70022"
+                "id": "arxiv:2610.04242",
+                "title": "arXiv:2610.04242",
+                "url": "https://arxiv.org/abs/2610.04242"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-03",
+              "disclosed_at": "2026-10-03",
               "source_ids": [
-                "source.frontier.doi-10-1111-ojoa-70022"
+                "source.frontier.arxiv-2610-04242"
               ]
             }
           },
-          "statement": "doi:10.1111/ojoa.70022 \"QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES\" (CC BY 4.0, published 2026-06-03) reports: \"The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts.\"",
+          "statement": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/ojoa.70022",
-            "time": "2026-06-03",
+            "population": "The study reported in arXiv:2610.04242",
+            "time": "2026-10-03",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807257,70 +832325,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
-              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-              "start": 1589,
-              "end": 1812,
-              "quote": "The results highlight a clear preponderance of Italic wine in Late Republican Gaul, followed by imports from Hispania, before local Gallic wine came to dominate the domestic market and expanded to other provincial contexts."
+              "source_id": "source.frontier.arxiv-2610-04242",
+              "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+              "start": 2726,
+              "end": 2942,
+              "quote": "We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
-              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-              "start": 18386,
-              "end": 18425,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,3]]}"
+              "source_id": "source.frontier.arxiv-2610-04242",
+              "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-03</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
-              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-              "start": 396,
-              "end": 453,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-04242",
+              "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+              "start": 2070,
+              "end": 2132,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025jd045965",
+          "id": "assertion.claim.frontier.arxiv-2610-06918",
           "target_kind": "node",
-          "target_sha256": "a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7",
+          "target_sha256": "8264a8cd0ed245884f4313ac000543134882ef2c91953504f5ca8c09b00c19c5",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025jd045965",
-            "label": "Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions",
+            "id": "claim.frontier.arxiv-2610-06918",
+            "label": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"",
+            "summary": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd045965",
-                "title": "Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S",
-                "url": "https://api.crossref.org/works/10.1029/2025jd045965"
+                "id": "source.frontier.arxiv-2610-06918",
+                "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025jd045965",
-                "title": "doi:10.1029/2025jd045965",
-                "url": "https://doi.org/10.1029/2025jd045965"
+                "id": "arxiv:2610.06918",
+                "title": "arXiv:2610.06918",
+                "url": "https://arxiv.org/abs/2610.06918"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-06-02",
+              "disclosed_at": "2026-10-02",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025jd045965"
+                "source.frontier.arxiv-2610-06918"
               ]
             }
           },
-          "statement": "doi:10.1029/2025jd045965 \"Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and Source Emissions\" (CC BY 4.0, published 2026-06-02) reports: \"These findings suggest that future dust transport to high‐elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America.\"",
+          "statement": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025jd045965",
-            "time": "2026-06-02",
+            "population": "The study reported in arXiv:2610.06918",
+            "time": "2026-10-02",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807328,70 +832396,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045965",
-              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-              "start": 3071,
-              "end": 3253,
-              "quote": "These findings suggest that future dust transport to high\\u2010elevation DML will likely be strongly modulated by emissions, the PDO, and cyclonic activity in southern South America."
+              "source_id": "source.frontier.arxiv-2610-06918",
+              "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+              "start": 2363,
+              "end": 2562,
+              "quote": "We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045965",
-              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-              "start": 16749,
-              "end": 16788,
-              "quote": "\"published\":{\"date-parts\":[[2026,6,2]]}"
+              "source_id": "source.frontier.arxiv-2610-06918",
+              "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-10-02</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045965",
-              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-              "start": 425,
-              "end": 482,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-06918",
+              "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+              "start": 1628,
+              "end": 1690,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-jssr-70066",
+          "id": "assertion.claim.frontier.arxiv-2610-03964",
           "target_kind": "node",
-          "target_sha256": "fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f",
+          "target_sha256": "db85dd871996d11690e4d572551d14de38bf3210d3196fecc9ae0da5eb44ddd8",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-jssr-70066",
-            "label": "Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
+            "id": "claim.frontier.arxiv-2610-03964",
+            "label": "Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"",
+            "summary": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-jssr-70066",
-                "title": "Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
-                "url": "https://api.crossref.org/works/10.1111/jssr.70066"
+                "id": "source.frontier.arxiv-2610-03964",
+                "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/jssr.70066",
-                "title": "doi:10.1111/jssr.70066",
-                "url": "https://doi.org/10.1111/jssr.70066"
+                "id": "arxiv:2610.03964",
+                "title": "arXiv:2610.03964",
+                "url": "https://arxiv.org/abs/2610.03964"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-30",
+              "disclosed_at": "2026-10-02",
               "source_ids": [
-                "source.frontier.doi-10-1111-jssr-70066"
+                "source.frontier.arxiv-2610-03964"
               ]
             }
           },
-          "statement": "doi:10.1111/jssr.70066 \"Multi‐Religiosity Among Asian Americans and Non‐Asian Americans\" (CC BY 4.0, published 2026-05-30) reports: \"The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions.\"",
+          "statement": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/jssr.70066",
-            "time": "2026-05-30",
+            "population": "The study reported in arXiv:2610.03964",
+            "time": "2026-10-02",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807399,70 +832467,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-jssr-70066",
-              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-              "start": 1384,
-              "end": 1579,
-              "quote": "The findings show that although only about 6% of Americans affiliate with or routinely practice two or more religions, about 60% said they somewhat or very much believed in two or more religions."
+              "source_id": "source.frontier.arxiv-2610-03964",
+              "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+              "start": 3120,
+              "end": 3263,
+              "quote": "Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-jssr-70066",
-              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-              "start": 9127,
-              "end": 9167,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,30]]}"
+              "source_id": "source.frontier.arxiv-2610-03964",
+              "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-10-02</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-jssr-70066",
-              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-03964",
+              "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+              "start": 1968,
+              "end": 2030,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025wr042846",
+          "id": "assertion.claim.frontier.arxiv-2610-03008",
           "target_kind": "node",
-          "target_sha256": "cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86",
+          "target_sha256": "82399c21be648fb96cb4a208fbf66536ea122a2350cb2dcdc8b0860c695b5db4",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025wr042846",
-            "label": "Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
+            "id": "claim.frontier.arxiv-2610-03008",
+            "label": "Response Variability and Stability in Human Reasoning",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"",
+            "summary": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025wr042846",
-                "title": "Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
-                "url": "https://api.crossref.org/works/10.1029/2025wr042846"
+                "id": "source.frontier.arxiv-2610-03008",
+                "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025wr042846",
-                "title": "doi:10.1029/2025wr042846",
-                "url": "https://doi.org/10.1029/2025wr042846"
+                "id": "arxiv:2610.03008",
+                "title": "arXiv:2610.03008",
+                "url": "https://arxiv.org/abs/2610.03008"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-30",
+              "disclosed_at": "2026-10-02",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025wr042846"
+                "source.frontier.arxiv-2610-03008"
               ]
             }
           },
-          "statement": "doi:10.1029/2025wr042846 \"Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater\" (CC BY 4.0, published 2026-05-30) reports: \"The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite.\"",
+          "statement": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025wr042846",
-            "time": "2026-05-30",
+            "population": "The study reported in arXiv:2610.03008",
+            "time": "2026-10-02",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807470,70 +832538,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr042846",
-              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-              "start": 2317,
-              "end": 2504,
-              "quote": "The results showed that light Ca isotopes are preferentially adsorbed onto clay minerals, and montmorillonite exhibits the greatest fractionation extent, followed by illite and kaolinite."
+              "source_id": "source.frontier.arxiv-2610-03008",
+              "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+              "start": 2639,
+              "end": 2864,
+              "quote": "The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr042846",
-              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-              "start": 22865,
-              "end": 22905,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,30]]}"
+              "source_id": "source.frontier.arxiv-2610-03008",
+              "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+              "start": 1046,
+              "end": 1075,
+              "quote": "<created>2026-10-02</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr042846",
-              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-              "start": 425,
-              "end": 482,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2610-03008",
+              "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+              "start": 2061,
+              "end": 2123,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-3897-jbgs-e185535",
+          "id": "assertion.claim.frontier.arxiv-2609-39776",
           "target_kind": "node",
-          "target_sha256": "84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f",
+          "target_sha256": "6ecd150266bfd4751ab0c41ef9a2daa5502de52896dba3cd913c50f3047a175b",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-3897-jbgs-e185535",
-            "label": "Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model",
+            "id": "claim.frontier.arxiv-2609-39776",
+            "label": "Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"",
+            "summary": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-jbgs-e185535",
-                "title": "Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us",
-                "url": "https://api.crossref.org/works/10.3897/jbgs.e185535"
+                "id": "source.frontier.arxiv-2609-39776",
+                "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.3897/jbgs.e185535",
-                "title": "doi:10.3897/jbgs.e185535",
-                "url": "https://doi.org/10.3897/jbgs.e185535"
+                "id": "arxiv:2609.39776",
+                "title": "arXiv:2609.39776",
+                "url": "https://arxiv.org/abs/2609.39776"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-29",
+              "disclosed_at": "2026-09-30",
               "source_ids": [
-                "source.frontier.doi-10-3897-jbgs-e185535"
+                "source.frontier.arxiv-2609-39776"
               ]
             }
           },
-          "statement": "doi:10.3897/jbgs.e185535 \"Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) using the InVEST SDR model\" (CC BY 4.0, published 2026-05-29) reports: \"The results reveal a marked decoupling between potential soil erosion and effective sediment transfer.\"",
+          "statement": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"",
           "scope": {
-            "population": "The study reported in doi:10.3897/jbgs.e185535",
-            "time": "2026-05-29",
+            "population": "The study reported in arXiv:2609.39776",
+            "time": "2026-09-30",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807541,70 +832609,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
-              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-              "start": 1297,
-              "end": 1399,
-              "quote": "The results reveal a marked decoupling between potential soil erosion and effective sediment transfer."
+              "source_id": "source.frontier.arxiv-2609-39776",
+              "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+              "start": 3297,
+              "end": 3439,
+              "quote": "Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones."
             },
             {
-              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
-              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-              "start": 4285,
-              "end": 4325,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,29]]}"
+              "source_id": "source.frontier.arxiv-2609-39776",
+              "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+              "start": 1088,
+              "end": 1117,
+              "quote": "<created>2026-09-30</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
-              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-              "start": 398,
-              "end": 455,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-39776",
+              "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+              "start": 2161,
+              "end": 2223,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-esp4-70082",
+          "id": "assertion.claim.frontier.arxiv-2609-21813",
           "target_kind": "node",
-          "target_sha256": "15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912",
+          "target_sha256": "701c399df4bf5ba66633b67a1c373086e8b2ccb139fac358011ef3d905dd3e37",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-esp4-70082",
-            "label": "Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
+            "id": "claim.frontier.arxiv-2609-21813",
+            "label": "How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"",
+            "summary": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-esp4-70082",
-                "title": "Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
-                "url": "https://api.crossref.org/works/10.1002/esp4.70082"
+                "id": "source.frontier.arxiv-2609-21813",
+                "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/esp4.70082",
-                "title": "doi:10.1002/esp4.70082",
-                "url": "https://doi.org/10.1002/esp4.70082"
+                "id": "arxiv:2609.21813",
+                "title": "arXiv:2609.21813",
+                "url": "https://arxiv.org/abs/2609.21813"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-29",
+              "disclosed_at": "2026-09-30",
               "source_ids": [
-                "source.frontier.doi-10-1002-esp4-70082"
+                "source.frontier.arxiv-2609-21813"
               ]
             }
           },
-          "statement": "doi:10.1002/esp4.70082 \"Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand\" (CC BY 4.0, published 2026-05-29) reports: \"Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface‐to‐borehole transfer functions consistent with 1D assumptions.\"",
+          "statement": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/esp4.70082",
-            "time": "2026-05-29",
+            "population": "The study reported in arXiv:2609.21813",
+            "time": "2026-09-30",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807612,70 +832680,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70082",
-              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-              "start": 2168,
-              "end": 2543,
-              "quote": "Topographic and stratigraphic features that influence site response are identified, and these features are shown to cause significant differences between 1D and 2D transfer functions over a large spatial extent, consistent with recent global studies demonstrating that many sites do not exhibit surface\\u2010to\\u2010borehole transfer functions consistent with 1D assumptions."
+              "source_id": "source.frontier.arxiv-2609-21813",
+              "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+              "start": 2229,
+              "end": 2393,
+              "quote": "We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70082",
-              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-              "start": 10843,
-              "end": 10883,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,29]]}"
+              "source_id": "source.frontier.arxiv-2609-21813",
+              "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-09-30</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70082",
-              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-              "start": 408,
-              "end": 465,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-21813",
+              "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+              "start": 1624,
+              "end": 1686,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-3897-nhcm-3-184711",
+          "id": "assertion.claim.frontier.arxiv-2609-36354",
           "target_kind": "node",
-          "target_sha256": "94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2",
+          "target_sha256": "ba2ba64d0bba4952934bb82ab0a6eec38988f094b32a07557fd48b32ddcd515f",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-3897-nhcm-3-184711",
-            "label": "Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation",
+            "id": "claim.frontier.arxiv-2609-36354",
+            "label": "Explainability from Training with Applications to TCR-Epitope Prediction",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"",
+            "summary": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-nhcm-3-184711",
-                "title": "Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ",
-                "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711"
+                "id": "source.frontier.arxiv-2609-36354",
+                "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.3897/nhcm.3.184711",
-                "title": "doi:10.3897/nhcm.3.184711",
-                "url": "https://doi.org/10.3897/nhcm.3.184711"
+                "id": "arxiv:2609.36354",
+                "title": "arXiv:2609.36354",
+                "url": "https://arxiv.org/abs/2609.36354"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-28",
+              "disclosed_at": "2026-09-28",
               "source_ids": [
-                "source.frontier.doi-10-3897-nhcm-3-184711"
+                "source.frontier.arxiv-2609-36354"
               ]
             }
           },
-          "statement": "doi:10.3897/nhcm.3.184711 \"Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna of an endemic rich island nation\" (CC BY 4.0, published 2026-05-28) reports: \"Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data.\"",
+          "statement": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"",
           "scope": {
-            "population": "The study reported in doi:10.3897/nhcm.3.184711",
-            "time": "2026-05-28",
+            "population": "The study reported in arXiv:2609.36354",
+            "time": "2026-09-28",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807683,70 +832751,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
-              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-              "start": 1658,
-              "end": 1837,
-              "quote": "Our results highlight the value of combining traditional scientific and citizen science data, while underscoring the continued importance of voucher specimens and historical data."
+              "source_id": "source.frontier.arxiv-2609-36354",
+              "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+              "start": 3238,
+              "end": 3686,
+              "quote": "Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty."
             },
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
-              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-              "start": 41735,
-              "end": 41775,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,28]]}"
+              "source_id": "source.frontier.arxiv-2609-36354",
+              "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+              "start": 1086,
+              "end": 1115,
+              "quote": "<created>2026-09-28</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
-              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-              "start": 400,
-              "end": 457,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-36354",
+              "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+              "start": 2118,
+              "end": 2180,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1029-2025gc012776",
+          "id": "assertion.claim.frontier.arxiv-2609-35424",
           "target_kind": "node",
-          "target_sha256": "be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96",
+          "target_sha256": "dae5b28a82fd4127b8cfa1a390f0d58fc4a3915961ee8a83656d2511f46f86a8",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1029-2025gc012776",
-            "label": "Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes",
+            "id": "claim.frontier.arxiv-2609-35424",
+            "label": "Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"",
+            "summary": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gc012776",
-                "title": "Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ",
-                "url": "https://api.crossref.org/works/10.1029/2025gc012776"
+                "id": "source.frontier.arxiv-2609-35424",
+                "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1029/2025gc012776",
-                "title": "doi:10.1029/2025gc012776",
-                "url": "https://doi.org/10.1029/2025gc012776"
+                "id": "arxiv:2609.35424",
+                "title": "arXiv:2609.35424",
+                "url": "https://arxiv.org/abs/2609.35424"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-28",
+              "disclosed_at": "2026-09-28",
               "source_ids": [
-                "source.frontier.doi-10-1029-2025gc012776"
+                "source.frontier.arxiv-2609-35424"
               ]
             }
           },
-          "statement": "doi:10.1029/2025gc012776 \"Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic and Hydrothermal Processes\" (CC BY 4.0, published 2026-05-28) reports: \"We show the first results of sidescan‐sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV).\"",
+          "statement": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"",
           "scope": {
-            "population": "The study reported in doi:10.1029/2025gc012776",
-            "time": "2026-05-28",
+            "population": "The study reported in arXiv:2609.35424",
+            "time": "2026-09-28",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807754,70 +832822,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gc012776",
-              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-              "start": 1295,
-              "end": 1428,
-              "quote": "We show the first results of sidescan\\u2010sonar data collected at a submarine arc volcano by an Autonomous Underwater Vehicle (AUV)."
+              "source_id": "source.frontier.arxiv-2609-35424",
+              "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+              "start": 2767,
+              "end": 3063,
+              "quote": "It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition."
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gc012776",
-              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-              "start": 13043,
-              "end": 13083,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,28]]}"
+              "source_id": "source.frontier.arxiv-2609-35424",
+              "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-28</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1029-2025gc012776",
-              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-              "start": 424,
-              "end": 481,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-35424",
+              "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+              "start": 1905,
+              "end": 1967,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1002-joc-70436",
+          "id": "assertion.claim.frontier.arxiv-2609-35246",
           "target_kind": "node",
-          "target_sha256": "af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a",
+          "target_sha256": "4c04841c92f6f2515c5aa9702bcfa24b0ae6a83779590a3c32cfa9518565faf6",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1002-joc-70436",
-            "label": "Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
+            "id": "claim.frontier.arxiv-2609-35246",
+            "label": "Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "engineering",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"",
+            "summary": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-joc-70436",
-                "title": "Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
-                "url": "https://api.crossref.org/works/10.1002/joc.70436"
+                "id": "source.frontier.arxiv-2609-35246",
+                "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1002/joc.70436",
-                "title": "doi:10.1002/joc.70436",
-                "url": "https://doi.org/10.1002/joc.70436"
+                "id": "arxiv:2609.35246",
+                "title": "arXiv:2609.35246",
+                "url": "https://arxiv.org/abs/2609.35246"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-26",
+              "disclosed_at": "2026-09-28",
               "source_ids": [
-                "source.frontier.doi-10-1002-joc-70436"
+                "source.frontier.arxiv-2609-35246"
               ]
             }
           },
-          "statement": "doi:10.1002/joc.70436 \"Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process\" (CC BY 4.0, published 2026-05-26) reports: \"The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation.\"",
+          "statement": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"",
           "scope": {
-            "population": "The study reported in doi:10.1002/joc.70436",
-            "time": "2026-05-26",
+            "population": "The study reported in arXiv:2609.35246",
+            "time": "2026-09-28",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807825,70 +832893,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70436",
-              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-              "start": 2020,
-              "end": 2199,
-              "quote": "The findings reveal clear SFG changes over the past decades: the annual maximum freezing depth (MFD) decreases with warmer winters and is also influenced by monsoon precipitation."
+              "source_id": "source.frontier.arxiv-2609-35246",
+              "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+              "start": 3694,
+              "end": 4010,
+              "quote": "Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios."
             },
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70436",
-              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-              "start": 12761,
-              "end": 12801,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,26]]}"
+              "source_id": "source.frontier.arxiv-2609-35246",
+              "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-28</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70436",
-              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-              "start": 409,
-              "end": 466,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-35246",
+              "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+              "start": 2030,
+              "end": 2092,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-2166-hydro-2026-191",
+          "id": "assertion.claim.frontier.arxiv-2609-32315",
           "target_kind": "node",
-          "target_sha256": "3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6",
+          "target_sha256": "3393b4bfa9a7dbb8b378cab5ff0700aac12523f0eda8237fe96df690f99204e0",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-2166-hydro-2026-191",
-            "label": "A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
+            "id": "claim.frontier.arxiv-2609-32315",
+            "label": "From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
             "kind": "claim",
-            "domain": "earth",
+            "domain": "information",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"",
+            "summary": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-hydro-2026-191",
-                "title": "Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
-                "url": "https://api.crossref.org/works/10.2166/hydro.2026.191"
+                "id": "source.frontier.arxiv-2609-32315",
+                "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.2166/hydro.2026.191",
-                "title": "doi:10.2166/hydro.2026.191",
-                "url": "https://doi.org/10.2166/hydro.2026.191"
+                "id": "arxiv:2609.32315",
+                "title": "arXiv:2609.32315",
+                "url": "https://arxiv.org/abs/2609.32315"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-23",
+              "disclosed_at": "2026-09-26",
               "source_ids": [
-                "source.frontier.doi-10-2166-hydro-2026-191"
+                "source.frontier.arxiv-2609-32315"
               ]
             }
           },
-          "statement": "doi:10.2166/hydro.2026.191 \"A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation\" (CC BY 4.0, published 2026-05-23) reports: \"Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets.\"",
+          "statement": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"",
           "scope": {
-            "population": "The study reported in doi:10.2166/hydro.2026.191",
-            "time": "2026-05-23",
+            "population": "The study reported in arXiv:2609.32315",
+            "time": "2026-09-26",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807896,70 +832964,70 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
-              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-              "start": 2414,
-              "end": 2504,
-              "quote": "Overall, the study demonstrates efficient integration of CHIPRS, MODIS, and SMAP datasets."
+              "source_id": "source.frontier.arxiv-2609-32315",
+              "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+              "start": 3174,
+              "end": 3300,
+              "quote": "We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes."
             },
             {
-              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
-              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-              "start": 30689,
-              "end": 30729,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,23]]}"
+              "source_id": "source.frontier.arxiv-2609-32315",
+              "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+              "start": 966,
+              "end": 995,
+              "quote": "<created>2026-09-26</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
-              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-              "start": 407,
-              "end": 464,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-32315",
+              "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+              "start": 2153,
+              "end": 2215,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-ojoa-70020",
+          "id": "assertion.claim.frontier.arxiv-2609-29972",
           "target_kind": "node",
-          "target_sha256": "a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec",
+          "target_sha256": "497b2f901d364e26b1b7b7625363b0dc6d2c9c25cd3d406cf9787b1bb0296d0d",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-ojoa-70020",
-            "label": "A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
+            "id": "claim.frontier.arxiv-2609-29972",
+            "label": "Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "health",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"",
+            "summary": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ojoa-70020",
-                "title": "Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
-                "url": "https://api.crossref.org/works/10.1111/ojoa.70020"
+                "id": "source.frontier.arxiv-2609-29972",
+                "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/ojoa.70020",
-                "title": "doi:10.1111/ojoa.70020",
-                "url": "https://doi.org/10.1111/ojoa.70020"
+                "id": "arxiv:2609.29972",
+                "title": "arXiv:2609.29972",
+                "url": "https://arxiv.org/abs/2609.29972"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-06",
+              "disclosed_at": "2026-09-24",
               "source_ids": [
-                "source.frontier.doi-10-1111-ojoa-70020"
+                "source.frontier.arxiv-2609-29972"
               ]
             }
           },
-          "statement": "doi:10.1111/ojoa.70020 \"A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE\" (CC BY 4.0, published 2026-05-06) reports: \"The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock.\"",
+          "statement": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/ojoa.70020",
-            "time": "2026-05-06",
+            "population": "The study reported in arXiv:2609.29972",
+            "time": "2026-09-24",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -807967,70 +833035,75 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
-              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-              "start": 1173,
-              "end": 1298,
-              "quote": "The study shows that the petroglyphs are organized in relation to water as well as to different minerals visible in the rock."
+              "source_id": "source.frontier.arxiv-2609-29972",
+              "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+              "start": 2123,
+              "end": 2345,
+              "quote": "We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
-              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-              "start": 12503,
-              "end": 12542,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,6]]}"
+              "source_id": "source.frontier.arxiv-2609-29972",
+              "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+              "start": 1066,
+              "end": 1095,
+              "quote": "<created>2026-09-24</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
-              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-              "start": 396,
-              "end": 453,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-29972",
+              "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+              "start": 1695,
+              "end": 1757,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.claim.frontier.doi-10-1111-phpr-70116",
+          "id": "assertion.claim.frontier.arxiv-2609-29832",
           "target_kind": "node",
-          "target_sha256": "1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442",
+          "target_sha256": "273391aa4a119164f559f1e6a1a3018edf1e24fe952fc25820514f35c726c8d5",
           "canonical_record": {
-            "id": "claim.frontier.doi-10-1111-phpr-70116",
-            "label": "Metaethics and the Functions of Moral Language",
+            "id": "claim.frontier.arxiv-2609-29832",
+            "label": "System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
             "kind": "claim",
-            "domain": "humanities",
+            "domain": "engineering",
             "era": "frontier",
             "status": "frontier",
             "frontier": true,
-            "summary": "doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"",
+            "summary": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
             "tags": [
               "frontier",
               "public-result"
             ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-phpr-70116",
-                "title": "Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language",
-                "url": "https://api.crossref.org/works/10.1111/phpr.70116"
+                "id": "source.frontier.arxiv-2609-29832",
+                "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"
               },
               {
-                "id": "doi:10.1111/phpr.70116",
-                "title": "doi:10.1111/phpr.70116",
-                "url": "https://doi.org/10.1111/phpr.70116"
+                "id": "arxiv:2609.29832",
+                "title": "arXiv:2609.29832",
+                "url": "https://arxiv.org/abs/2609.29832"
+              },
+              {
+                "id": "doi:10.2514/1.c038636",
+                "title": "doi:10.2514/1.c038636",
+                "url": "https://doi.org/10.2514/1.c038636"
               }
             ],
             "public_frontier": {
               "category": "public-result",
               "capability_status": "publicly-described",
-              "disclosed_at": "2026-05-03",
+              "disclosed_at": "2026-09-24",
               "source_ids": [
-                "source.frontier.doi-10-1111-phpr-70116"
+                "source.frontier.arxiv-2609-29832"
               ]
             }
           },
-          "statement": "doi:10.1111/phpr.70116 \"Metaethics and the Functions of Moral Language\" (CC BY 4.0, published 2026-05-03) reports: \"This analysis shows how multiple functions come to be layered up through different grammatical forms.\"",
+          "statement": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
           "scope": {
-            "population": "The study reported in doi:10.1111/phpr.70116",
-            "time": "2026-05-03",
+            "population": "The study reported in arXiv:2609.29832",
+            "time": "2026-09-24",
             "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
             "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
@@ -808038,3653 +833111,5601 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-phpr-70116",
-              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-              "start": 1568,
-              "end": 1669,
-              "quote": "This analysis shows how multiple functions come to be layered up through different grammatical forms."
+              "source_id": "source.frontier.arxiv-2609-29832",
+              "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+              "start": 2930,
+              "end": 3075,
+              "quote": "Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately."
             },
             {
-              "source_id": "source.frontier.doi-10-1111-phpr-70116",
-              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-              "start": 9510,
-              "end": 9549,
-              "quote": "\"published\":{\"date-parts\":[[2026,5,3]]}"
+              "source_id": "source.frontier.arxiv-2609-29832",
+              "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-09-24</created>"
             },
             {
-              "source_id": "source.frontier.doi-10-1111-phpr-70116",
-              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-              "start": 396,
-              "end": 453,
-              "quote": "\"URL\":\"http:\\/\\/creativecommons.org\\/licenses\\/by\\/4.0\\/\""
+              "source_id": "source.frontier.arxiv-2609-29832",
+              "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+              "start": 1938,
+              "end": 2006,
+              "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ecot-70052.field.mesh.d011057",
-          "target_kind": "edge",
-          "target_sha256": "413a130ce197e9f36f3c287595cad06412588939f17551941e0f64e413eba646",
+          "id": "assertion.claim.frontier.arxiv-2609-28815",
+          "target_kind": "node",
+          "target_sha256": "dbae9cf820fccc9f22815306f186c61c6bf424abe78f92c8149f93288fa29ade",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ecot-70052",
-            "target": "field.mesh.d011057",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"",
+            "id": "claim.frontier.arxiv-2609-28815",
+            "label": "Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ecot-70052",
-                "url": "https://api.crossref.org/works/10.1111/ecot.70052"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1111/ecot.70052 names Politics: \"These patterns reveal the redistributive politics of nation‐building.\"",
-          "scope": {
-            "population": "doi:10.1111/ecot.70052 abstract",
-            "time": "2026-10-15",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1111-ecot-70052",
-              "source_sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
-              "start": 1643,
-              "end": 1717,
-              "quote": "These patterns reveal the redistributive politics of nation\\u2010building."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70333.field.climatology",
-          "target_kind": "edge",
-          "target_sha256": "7fff6f0bfdc47c01ade5378ce41abde5313504a8806c7bad0379cda58555d480",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-qj-70333",
-            "target": "field.climatology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-28815",
+                "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-1002-qj-70333",
-                "url": "https://api.crossref.org/works/10.1002/qj.70333"
+                "id": "arxiv:2609.28815",
+                "title": "arXiv:2609.28815",
+                "url": "https://arxiv.org/abs/2609.28815"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/qj.70333 names Climatology: \"These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone.\"",
-          "scope": {
-            "population": "doi:10.1002/qj.70333 abstract",
-            "time": "2026-10-15",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-qj-70333",
-              "source_sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
-              "start": 2668,
-              "end": 2817,
-              "quote": "These features were markedly pronounced relative to climatology and are consistent with previous studies on typical HREs along the Baiu frontal zone."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-23",
+              "source_ids": [
+                "source.frontier.arxiv-2609-28815"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pwat-0000557.concept.usgs.30",
-          "target_kind": "edge",
-          "target_sha256": "58c5ea033e74aabca1efa3da34754b6c107cbde72c9fe6b73480e558db0ab0e2",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pwat-0000557",
-            "target": "concept.usgs.30",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1371-journal-pwat-0000557",
-                "url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pwat.0000557 names Algal blooms: \"Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species.\"",
+          "statement": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pwat.0000557 abstract",
-            "time": "2026-10-14",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.28815",
+            "time": "2026-09-23",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pwat-0000557",
-              "source_sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
-              "start": 909,
-              "end": 1120,
-              "quote": "Harmful algal blooms (HABs) are increasingly impacting estuarine ecosystems, yet current microbial surveillance methods often focus on prokaryotic 16S rRNA profiles and overlook eukaryotic bloom-forming species."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-medu-70340.concept.mesh.d000091682",
-          "target_kind": "edge",
-          "target_sha256": "ae7d3ee5e9729f2c4333a980889dbc57528d24f37821d7eaf21bd9467d71a4ad",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-medu-70340",
-            "target": "concept.mesh.d000091682",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1111-medu-70340",
-                "url": "https://api.crossref.org/works/10.1111/medu.70340"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1111/medu.70340 names Health Inequities: \"Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes.\"",
-          "scope": {
-            "population": "doi:10.1111/medu.70340 abstract",
-            "time": "2026-10-14",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-28815",
+              "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+              "start": 2932,
+              "end": 3156,
+              "quote": "We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty."
+            },
             {
-              "source_id": "source.frontier.doi-10-1111-medu-70340",
-              "source_sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
-              "start": 961,
-              "end": 1149,
-              "quote": "Prevailing health inequities, viewed as a matter of social justice, have catalysed an intentionality about ensuring that medical graduates can contribute to more equitable health outcomes."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124622.concept.usgs.2027",
-          "target_kind": "edge",
-          "target_sha256": "3df951a29cb556e9f3aec0424eb412a8d01b5f74603bf4f341b4b1f59886133b",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124622",
-            "target": "concept.usgs.2027",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026gl124622",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124622"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1029/2026gl124622 names Soil moisture: \"This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation.\"",
-          "scope": {
-            "population": "doi:10.1029/2026gl124622 abstract",
-            "time": "2026-10-14",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-28815",
+              "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-23</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124622",
-              "source_sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
-              "start": 2491,
-              "end": 2605,
-              "quote": "This framework captures interactions among precipitation, soil moisture, and snowpack that shape flood generation."
+              "source_id": "source.frontier.arxiv-2609-28815",
+              "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+              "start": 1669,
+              "end": 1731,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1235.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "c7c9a55bd9dd0d2dd463460c366108d55978a30adc289b053dd6cb96da68ce98",
+          "id": "assertion.claim.frontier.arxiv-2609-26924",
+          "target_kind": "node",
+          "target_sha256": "2d9829e5b9835a2a33215722f146f2c3edd09aa838289952022c96436b4d46d8",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-15351-2373-8456-1235",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"",
+            "id": "claim.frontier.arxiv-2609-26924",
+            "label": "nnFoundation: 3D Foundation Models for Radiology",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-15351-2373-8456-1235",
-                "url": "https://api.crossref.org/works/10.15351/2373-8456.1235"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.15351/2373-8456.1235 names Climate change: \"Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities.\"",
-          "scope": {
-            "population": "doi:10.15351/2373-8456.1235 abstract",
-            "time": "2026-10-13",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-15351-2373-8456-1235",
-              "source_sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
-              "start": 1453,
-              "end": 1624,
-              "quote": "Yet, climate change, overfishing, habitat degradation, pollution, and fragmented governance threaten long-term sustainability, compounded by poverty and gender inequities."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1216.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "635dee6b4eb2a4c03356a8c62e771a76cfa9d650f10eb9c87183ae62a083ffe3",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-15351-2373-8456-1216",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-26924",
+                "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-15351-2373-8456-1216",
-                "url": "https://api.crossref.org/works/10.15351/2373-8456.1216"
+                "id": "arxiv:2609.26924",
+                "title": "arXiv:2609.26924",
+                "url": "https://arxiv.org/abs/2609.26924"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.15351/2373-8456.1216 names Climate change: \"The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern.\"",
-          "scope": {
-            "population": "doi:10.15351/2373-8456.1216 abstract",
-            "time": "2026-10-13",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-15351-2373-8456-1216",
-              "source_sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
-              "start": 628,
-              "end": 811,
-              "quote": "The prolific human-induced pressures on marine ecosystems leading to negative externalities such as beach erosion, biodiversity loss, and climate change are matters of global concern."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-22",
+              "source_ids": [
+                "source.frontier.arxiv-2609-26924"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125301.field.usgs.1678",
-          "target_kind": "edge",
-          "target_sha256": "da4487fc23c63eb6d813c22d74248e4aa651a52a01d7ccce149decf2a06b12f9",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl125301",
-            "target": "field.usgs.1678",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026gl125301",
-                "url": "https://api.crossref.org/works/10.1029/2026gl125301"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl125301 names Hydrodynamics: \"These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions.\"",
+          "statement": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl125301 abstract",
-            "time": "2026-10-13",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.26924",
+            "time": "2026-09-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl125301",
-              "source_sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
-              "start": 2549,
-              "end": 2777,
-              "quote": "These findings suggest that seawalls can substantially alter wetland hydrodynamics and ecosystem structure, highlighting the importance of incorporating hydrological connectivity into seawall design to sustain wetland functions."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-21425-fob-19-142560.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "3986a8713521ff84b82728c0701beaea23cf1574acd33d708f16431a025eb365",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-21425-fob-19-142560",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-21425-fob-19-142560",
-                "url": "https://api.crossref.org/works/10.21425/fob.19.142560"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.21425/fob.19.142560 names Topography: \"Coastal lomas—isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America–provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity.\"",
-          "scope": {
-            "population": "doi:10.21425/fob.19.142560 abstract",
-            "time": "2026-10-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-26924",
+              "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+              "start": 14927,
+              "end": 15159,
+              "quote": "Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging."
+            },
             {
-              "source_id": "source.frontier.doi-10-21425-fob-19-142560",
-              "source_sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
-              "start": 777,
-              "end": 1034,
-              "quote": "Coastal lomas\\u2014isolated, fog-fed vegetation oases distributed across the Peruvian and Chilean coastal deserts of South America\\u2013provide a unique system for examining how climate, topography, and geography shape plant diversity under extreme aridity."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001044.concept.usgs.1312",
-          "target_kind": "edge",
-          "target_sha256": "3ca128ae2cdaae8af0d2745b32dd313d582659c24c31a45b05827a6fd147e325",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0001044",
-            "target": "concept.usgs.1312",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0001044",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001044 names Water temperature: \"We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico.\"",
-          "scope": {
-            "population": "doi:10.1371/journal.pclm.0001044 abstract",
-            "time": "2026-10-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-26924",
+              "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-22</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001044",
-              "source_sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
-              "start": 1811,
-              "end": 2024,
-              "quote": "We analyzed long-term air and water temperature, precipitation, and stream water level data from two active Caribbean research sites: La Selva Research Station, Costa Rica, and El Verde Field Station, Puerto Rico."
+              "source_id": "source.frontier.arxiv-2609-26924",
+              "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+              "start": 13953,
+              "end": 14015,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000886.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "91e77eddc7fe88292b15ad7ff9449df9ffa91654a37426ec5a37239daae663a2",
+          "id": "assertion.claim.frontier.arxiv-2609-25847",
+          "target_kind": "node",
+          "target_sha256": "566241ea9065d5143c4a5829ca9dc1676bd4ada68203d32244bc0b8944f6905b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000886",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"",
+            "id": "claim.frontier.arxiv-2609-25847",
+            "label": "Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000886",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000886 names Climate change: \"Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change.\"",
-          "scope": {
-            "population": "doi:10.1371/journal.pclm.0000886 abstract",
-            "time": "2026-10-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000886",
-              "source_sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
-              "start": 627,
-              "end": 768,
-              "quote": "Climate-smart agricultural technologies (CSAT) are promoted to enhance agricultural productivity and strengthen resilience to climate change."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1075-consl-25020-lia.field.aat.300054256",
-          "target_kind": "edge",
-          "target_sha256": "ab741047cf8edd3a280ea1ae5164a41b2d305fecef729b32a17daf47b4420e36",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1075-consl-25020-lia",
-            "target": "field.aat.300054256",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-25847",
+                "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-1075-consl-25020-lia",
-                "url": "https://api.crossref.org/works/10.1075/consl.25020.lia"
+                "id": "arxiv:2609.25847",
+                "title": "arXiv:2609.25847",
+                "url": "https://arxiv.org/abs/2609.25847"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1075/consl.25020.lia names theoretical linguistics: \"widely discussed in theoretical linguistics; however, their cognitive status remains underexplored.\"",
-          "scope": {
-            "population": "doi:10.1075/consl.25020.lia abstract",
-            "time": "2026-10-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1075-consl-25020-lia",
-              "source_sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
-              "start": 938,
-              "end": 1037,
-              "quote": "widely discussed in theoretical linguistics; however, their cognitive status remains underexplored."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-22",
+              "source_ids": [
+                "source.frontier.arxiv-2609-25847"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-040.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "7aa84f9fccde0b66d8b46cd51ea6a0b5e0100aa08fe39cd8dadb8effbf29e030",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-hydro-2026-040",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-2166-hydro-2026-040",
-                "url": "https://api.crossref.org/works/10.2166/hydro.2026.040"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.2166/hydro.2026.040 names Climate change: \"Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir–pumping station systems.\"",
+          "statement": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"",
           "scope": {
-            "population": "doi:10.2166/hydro.2026.040 abstract",
-            "time": "2026-10-10",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.25847",
+            "time": "2026-09-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-hydro-2026-040",
-              "source_sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
-              "start": 1296,
-              "end": 1594,
-              "quote": "Amid intensifying global climate change, extreme hydrometeorological events have become increasingly frequent, posing significant challenges to irrigation systems that depend on the coordinated operation of multiple water-source infrastructures, particularly reservoir\\u2013pumping station systems."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-lol2-70186.concept.usgs.1034",
-          "target_kind": "edge",
-          "target_sha256": "586a4667b074f2e52528e7bce7d01a69c75b63cfa8237b50a6d262cd25d963eb",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-lol2-70186",
-            "target": "concept.usgs.1034",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-lol2-70186",
-                "url": "https://api.crossref.org/works/10.1002/lol2.70186"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/lol2.70186 names Sediment transport: \"Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed.\"",
-          "scope": {
-            "population": "doi:10.1002/lol2.70186 abstract",
-            "time": "2026-10-09",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25847",
+              "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+              "start": 2853,
+              "end": 3070,
+              "quote": "The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters."
+            },
             {
-              "source_id": "source.frontier.doi-10-1002-lol2-70186",
-              "source_sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
-              "start": 2487,
-              "end": 2709,
-              "quote": "Our findings underscore the importance of direct observations for quantifying sediment transport in glacierized fjords and suggest the Greenland Ice Sheet contributes more sediment to ocean margins than previously assumed."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124411.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "5093d4ae72b587afb7fd89ce0c7a3b3fa5151c971d6e355cc448f0211313ca38",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124411",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026gl124411",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124411"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1029/2026gl124411 names Topography: \"We conducted a 220‐m mesh simulation over the global domain with realistic topography.\"",
-          "scope": {
-            "population": "doi:10.1029/2026gl124411 abstract",
-            "time": "2026-10-08",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25847",
+              "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-22</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124411",
-              "source_sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
-              "start": 2042,
-              "end": 2133,
-              "quote": "We conducted a 220\\u2010m mesh simulation over the global domain with realistic topography."
+              "source_id": "source.frontier.arxiv-2609-25847",
+              "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+              "start": 1766,
+              "end": 1828,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70629.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "5d6d8905a618490c7791a3c4e518f2ceff8351835b11be2fc2bdd1b9c63fd143",
+          "id": "assertion.claim.frontier.arxiv-2609-25701",
+          "target_kind": "node",
+          "target_sha256": "265421a5a50e797df47c4041c93dc6fdd177388afa0791402b77b6bfa37bf770",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70629",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"",
+            "id": "claim.frontier.arxiv-2609-25701",
+            "label": "Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-joc-70629",
-                "url": "https://api.crossref.org/works/10.1002/joc.70629"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/joc.70629 names Climate change: \"Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection.\"",
-          "scope": {
-            "population": "doi:10.1002/joc.70629 abstract",
-            "time": "2026-10-08",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-joc-70629",
-              "source_sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
-              "start": 1520,
-              "end": 1706,
-              "quote": "Understanding the variability and evolution of precipitation extremes associated with climate change is essential to support adaptation strategies, risk management, and civil protection."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70277.field.mesh.d011057",
-          "target_kind": "edge",
-          "target_sha256": "41fb50edd017b2abeaf096ab82b2b6c837212a49288078b97056374b2ddaf50e",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-1467-9566-70277",
-            "target": "field.mesh.d011057",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-25701",
+                "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-1111-1467-9566-70277",
-                "url": "https://api.crossref.org/works/10.1111/1467-9566.70277"
+                "id": "arxiv:2609.25701",
+                "title": "arXiv:2609.25701",
+                "url": "https://arxiv.org/abs/2609.25701"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1111/1467-9566.70277 names Politics: \"Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de‐animation or embrace legal ambiguity.\"",
-          "scope": {
-            "population": "doi:10.1111/1467-9566.70277 abstract",
-            "time": "2026-10-06",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1111-1467-9566-70277",
-              "source_sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
-              "start": 2196,
-              "end": 2660,
-              "quote": "Building on theories of legal consciousness and stratified reproduction, we demonstrate how the politics of reproductive signification encompass not only cis\\/heteronormative legislation but also the ways in which inequalities, relating to economic resources, racialised and classed parenting ideals and relationship status, shape possibilities to work with the law and resist its relational authority via practices of de\\u2010animation or embrace legal ambiguity."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-22",
+              "source_ids": [
+                "source.frontier.arxiv-2609-25701"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70129.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "f909c4829aec2b28a494a4fbbb9c7bedd68b31c43bf6d114ccec8b30374678e6",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-jpln-70129",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-jpln-70129",
-                "url": "https://api.crossref.org/works/10.1002/jpln.70129"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.1002/jpln.70129 names Climate change: \"These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming‐induced increases in respiration potentially reducing their thickness and water‐holding capacity.\"",
+          "statement": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"",
           "scope": {
-            "population": "doi:10.1002/jpln.70129 abstract",
-            "time": "2026-10-06",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.25701",
+            "time": "2026-09-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-jpln-70129",
-              "source_sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
-              "start": 1315,
-              "end": 1573,
-              "quote": "These organic layers play a critical role in releasing water and nutrients for vegetation, yet they are also sensitive to climate change, with warming\\u2010induced increases in respiration potentially reducing their thickness and water\\u2010holding capacity."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70613.concept.usgs.1308",
-          "target_kind": "edge",
-          "target_sha256": "4ef0afd549f86403f660671f586a68c8cd457c46f96be4e6309a8fcdc9051d06",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70613",
-            "target": "concept.usgs.1308",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-joc-70613",
-                "url": "https://api.crossref.org/works/10.1002/joc.70613"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/joc.70613 names Water resources: \"Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems.\"",
-          "scope": {
-            "population": "doi:10.1002/joc.70613 abstract",
-            "time": "2026-10-06",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25701",
+              "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+              "start": 2284,
+              "end": 2600,
+              "quote": "Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs."
+            },
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70613",
-              "source_sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
-              "start": 1195,
-              "end": 1383,
-              "quote": "Southwest Asia (SWA) is a climatically sensitive region where water resources are determined by the complex interactions between the Indian Summer Monsoon and Mediterranean winter systems."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70605.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "69ed199b71414bc234eb624180354f6c4dc58b3becc2c5e082b68231d078c223",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70605",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-joc-70605",
-                "url": "https://api.crossref.org/works/10.1002/joc.70605"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/joc.70605 names Climate change: \"Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season.\"",
-          "scope": {
-            "population": "doi:10.1002/joc.70605 abstract",
-            "time": "2026-10-06",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25701",
+              "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-09-22</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70605",
-              "source_sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
-              "start": 3060,
-              "end": 3297,
-              "quote": "Overall, our results show that future climate change in Mexico will be characterized by robust and spatially coherent warming, together with a more uncertain but progressively stronger drying tendency, particularly during the wet season."
+              "source_id": "source.frontier.arxiv-2609-25701",
+              "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+              "start": 1707,
+              "end": 1769,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3176-arch-2026-2-03.concept.aat.300019278",
-          "target_kind": "edge",
-          "target_sha256": "6902960110627aa91c2da22bb818ab816519532bef2a2bcbc1da2ef938a26b3a",
+          "id": "assertion.claim.frontier.arxiv-2609-25437",
+          "target_kind": "node",
+          "target_sha256": "04be0752464c1a2727c2499358978e64e3bb76280ab524b9d80244fc454dc4c9",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3176-arch-2026-2-03",
-            "target": "concept.aat.300019278",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"",
+            "id": "claim.frontier.arxiv-2609-25437",
+            "label": "Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3176-arch-2026-2-03",
-                "url": "https://api.crossref.org/works/10.3176/arch.2026.2.03"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.3176/arch.2026.2.03 names Late Bronze Age: \"The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep/goats forming the basis of animal husbandry.\"",
-          "scope": {
-            "population": "doi:10.3176/arch.2026.2.03 abstract",
-            "time": "2026-10-05",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-3176-arch-2026-2-03",
-              "source_sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
-              "start": 1323,
-              "end": 1483,
-              "quote": "The results demonstrate that farming was already fully established during the Late Bronze Age, with pigs and sheep\\/goats forming the basis of animal husbandry."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-580.concept.usgs.27",
-          "target_kind": "edge",
-          "target_sha256": "8a35e876748f847320023ffb2c54fe29270e49c78d29187d40cf9c6c3dc9fd1f",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wcc-2026-580",
-            "target": "concept.usgs.27",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-25437",
+                "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-2166-wcc-2026-580",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.580"
+                "id": "arxiv:2609.25437",
+                "title": "arXiv:2609.25437",
+                "url": "https://arxiv.org/abs/2609.25437"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.2166/wcc.2026.580 names Air temperature: \"We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013/14–2025/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985/86–2025/26); and (iii) examining associations with ENSO phases and documented droughts.\"",
-          "scope": {
-            "population": "doi:10.2166/wcc.2026.580 abstract",
-            "time": "2026-10-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-580",
-              "source_sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
-              "start": 1070,
-              "end": 1562,
-              "quote": "We address this gap by (i) evaluating four daily rainfall and four maximum air temperature (Tmax) products against observations from four Zambian stations (2013\\/14\\u20132025\\/26) using conventional and confusion-matrix statistics; (ii) applying the best-performing products to characterise concurrent stress at six major production sites across Malawi, Mozambique and Zambia over 41 seasons (1985\\/86\\u20132025\\/26); and (iii) examining associations with ENSO phases and documented droughts."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-21",
+              "source_ids": [
+                "source.frontier.arxiv-2609-25437"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ijop-70275.field.mesh.d011593",
-          "target_kind": "edge",
-          "target_sha256": "2ee3aac4f377dcbd00941bb67608726f3440664a49824c8a01b481f61deaa9a7",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ijop-70275",
-            "target": "field.mesh.d011593",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-ijop-70275",
-                "url": "https://api.crossref.org/works/10.1002/ijop.70275"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.1002/ijop.70275 names Psychology, Social: \"Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance.\"",
+          "statement": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"",
           "scope": {
-            "population": "doi:10.1002/ijop.70275 abstract",
-            "time": "2026-10-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.25437",
+            "time": "2026-09-21",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ijop-70275",
-              "source_sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
-              "start": 902,
-              "end": 1066,
-              "quote": "Culture significantly influences human psychology, making it essential for psychological research, particularly in social psychology, to acknowledge its importance."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-popecon-10-e186220.concept.mesh.d006304",
-          "target_kind": "edge",
-          "target_sha256": "a5753ad4654edb69606084614507594daede3f68cc8bbdee7db8cc0711ec2822",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-popecon-10-e186220",
-            "target": "concept.mesh.d006304",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-3897-popecon-10-e186220",
-                "url": "https://api.crossref.org/works/10.3897/popecon.10.e186220"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.3897/popecon.10.e186220 names Health Status: \"Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income).\"",
-          "scope": {
-            "population": "doi:10.3897/popecon.10.e186220 abstract",
-            "time": "2026-10-01",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25437",
+              "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+              "start": 3733,
+              "end": 3921,
+              "quote": "These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices."
+            },
             {
-              "source_id": "source.frontier.doi-10-3897-popecon-10-e186220",
-              "source_sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
-              "start": 1440,
-              "end": 1612,
-              "quote": "Wellbeing, treated as a latent construct, is operationalised through indicators of human capital (health status and educational attainment) and material resources (income)."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-507.concept.usgs.27",
-          "target_kind": "edge",
-          "target_sha256": "1b6a46178e802328ea55dde966281c18415dee4deac66bc4240548d5c60f2472",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wcc-2026-507",
-            "target": "concept.usgs.27",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-2166-wcc-2026-507",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.507"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.2166/wcc.2026.507 names Air temperature: \"The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 °C and an increase of 1.6 °C over the study period (Sen’s slope: +0.036 °C/year).\"",
-          "scope": {
-            "population": "doi:10.2166/wcc.2026.507 abstract",
-            "time": "2026-10-01",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-25437",
+              "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-09-21</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-507",
-              "source_sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
-              "start": 1476,
-              "end": 1686,
-              "quote": "The results indicate significant regional warming, with a mean annual air temperature of approximately 14.0 \\u00b0C and an increase of 1.6 \\u00b0C over the study period (Sen\\u2019s slope: +0.036 \\u00b0C\\/year)."
+              "source_id": "source.frontier.arxiv-2609-25437",
+              "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+              "start": 1952,
+              "end": 2014,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e183393.concept.mesh.d017149",
-          "target_kind": "edge",
-          "target_sha256": "df6d963e659278fd99996439db1e1a213dd50233f2763c4a77ec66b9bbe40100",
+          "id": "assertion.claim.frontier.arxiv-2609-05763",
+          "target_kind": "node",
+          "target_sha256": "6a40b680ba9f871e726982e0df10ac8d16f87732cfb9e4dfe28adad7ca5bde57",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-brics-econ-7-e183393",
-            "target": "concept.mesh.d017149",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"",
+            "id": "claim.frontier.arxiv-2609-05763",
+            "label": "AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e183393 names Private Sector: \"The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks.\"",
-          "scope": {
-            "population": "doi:10.3897/brics-econ.7.e183393 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
-              "source_sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
-              "start": 923,
-              "end": 1076,
-              "quote": "The primary focus of this study is to examine the short-term effects on valuations and the dynamics of spillover between public and private sector banks."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026785.field.aat.300054240",
-          "target_kind": "edge",
-          "target_sha256": "8aa8a1d438ebe7f29c45eea36eeb1ebf63b128f13ae5eac1e32b16d6016bc7a0",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-ehass-2026785",
-            "target": "field.aat.300054240",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-05763",
+                "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-38159-ehass-2026785",
-                "url": "https://api.crossref.org/works/10.38159/ehass.2026785"
+                "id": "arxiv:2609.05763",
+                "title": "arXiv:2609.05763",
+                "url": "https://arxiv.org/abs/2609.05763"
               }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.38159/ehass.2026785 names musicology: \"This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification.\"",
-          "scope": {
-            "population": "doi:10.38159/ehass.2026785 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-38159-ehass-2026785",
-              "source_sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
-              "start": 1709,
-              "end": 1947,
-              "quote": "This professional discussion was employed to address the authenticity loss and to interpret the statistical declines in emotional attachment within the framework of African musicology, formalist aesthetics, and neoliberal commodification."
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-21",
+              "source_ids": [
+                "source.frontier.arxiv-2609-05763"
+              ]
             }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124090.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "074a553ffdc9c672c32b9ac69e8fb765475c597c36648b97f1f730c85198e67a",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124090",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1029-2026gl124090",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124090"
-              }
-            ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124090 names Topography: \"The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored.\"",
+          "statement": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124090 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.05763",
+            "time": "2026-09-21",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124090",
-              "source_sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
-              "start": 1237,
-              "end": 1378,
-              "quote": "The capability of the Surface Water and Ocean Topography (SWOT) satellite for observing irrigation canals has remained relatively unexplored."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-pei3-70207.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "6c98126377bf52e563c8c8ad1bcb25cec9461e0d086807b2f7c281f6bb0bc5ad",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-pei3-70207",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-pei3-70207",
-                "url": "https://api.crossref.org/works/10.1002/pei3.70207"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/pei3.70207 names Climate change: \"Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods.\"",
-          "scope": {
-            "population": "doi:10.1002/pei3.70207 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-05763",
+              "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+              "start": 3321,
+              "end": 3379,
+              "quote": "We demonstrate this versatility across three applications."
+            },
             {
-              "source_id": "source.frontier.doi-10-1002-pei3-70207",
-              "source_sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
-              "start": 915,
-              "end": 1059,
-              "quote": "Climate change is a major driver of food insecurity in Ethiopia, affecting agricultural productivity, water availability, and rural livelihoods."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-fea2-70077.field.anthropology",
-          "target_kind": "edge",
-          "target_sha256": "708679023d721aa70d9c59d8b1de2be111908cf0198ec4638c2acdeceb07581d",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-fea2-70077",
-            "target": "field.anthropology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"",
-            "sources": [
-              {
-                "id": "source.frontier.doi-10-1002-fea2-70077",
-                "url": "https://api.crossref.org/works/10.1002/fea2.70077"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/fea2.70077 names Anthropology: \"By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self‐responsibilities and opening new epistemological imaginaries for feminist urban anthropology.\"",
-          "scope": {
-            "population": "doi:10.1002/fea2.70077 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
+              "source_id": "source.frontier.arxiv-2609-05763",
+              "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-21</created>"
+            },
             {
-              "source_id": "source.frontier.doi-10-1002-fea2-70077",
-              "source_sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
-              "start": 1784,
-              "end": 2107,
-              "quote": "By centering participant testimony, this article reorients care from moral virtue to political struggle, calling for a reconfiguration of care ethics rooted in collective infrastructures that refuse neoliberal logics of self\\u2010responsibilities and opening new epistemological imaginaries for feminist urban anthropology."
+              "source_id": "source.frontier.arxiv-2609-05763",
+              "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+              "start": 2464,
+              "end": 2526,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-eet-70146.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "3ae70c59d5fc17a5bd72d8b7fa25d9943f67b60084bfcd6a5a5b1a8093363ffb",
+          "id": "assertion.claim.frontier.arxiv-2609-23703",
+          "target_kind": "node",
+          "target_sha256": "f6b5b72f02708a4ab71cec431bb431e6a28df2a8992b4bdb1fe0b549f41af299",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-eet-70146",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"",
+            "id": "claim.frontier.arxiv-2609-23703",
+            "label": "Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-eet-70146",
-                "url": "https://api.crossref.org/works/10.1002/eet.70146"
-              }
-            ]
-          },
-          "statement": "The retained abstract of doi:10.1002/eet.70146 names Climate change: \"Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors.\"",
-          "scope": {
-            "population": "doi:10.1002/eet.70146 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
-            "units": null,
-            "quantifiers": "This publication only"
-          },
-          "support": [
-            {
-              "source_id": "source.frontier.doi-10-1002-eet-70146",
-              "source_sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
-              "start": 843,
-              "end": 1003,
-              "quote": "Climate change requires governance arrangements that coordinate governmental authority, civic action, and specialized contributions from nongovernmental actors."
-            }
-          ]
-        },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-eco-70279.ology.hydrology",
-          "target_kind": "edge",
-          "target_sha256": "3f8dd74fd9b1d418159e335894b0ff2f9dc9559b25fa16add90c516667bf9bca",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-eco-70279",
-            "target": "ology.hydrology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"",
-            "sources": [
+                "id": "source.frontier.arxiv-2609-23703",
+                "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"
+              },
               {
-                "id": "source.frontier.doi-10-1002-eco-70279",
-                "url": "https://api.crossref.org/works/10.1002/eco.70279"
+                "id": "arxiv:2609.23703",
+                "title": "arXiv:2609.23703",
+                "url": "https://arxiv.org/abs/2609.23703"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-20",
+              "source_ids": [
+                "source.frontier.arxiv-2609-23703"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/eco.70279 names Hydrology: \"Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast.\"",
+          "statement": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"",
           "scope": {
-            "population": "doi:10.1002/eco.70279 abstract",
-            "time": "2026-09-30",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.23703",
+            "time": "2026-09-20",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-eco-70279",
-              "source_sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
-              "start": 1445,
-              "end": 1632,
-              "quote": "Despite this being a widespread phenomenon, questions remain about the factors shaping groundwater hydrology and salinity in these transitioning systems, particularly in the US Northeast."
+              "source_id": "source.frontier.arxiv-2609-23703",
+              "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+              "start": 3105,
+              "end": 3400,
+              "quote": "Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23703",
+              "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+              "start": 1046,
+              "end": 1075,
+              "quote": "<created>2026-09-20</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23703",
+              "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+              "start": 1631,
+              "end": 1693,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124233.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "028cf55a78b7a1cb658530c03360725b336928116b84957cbd488492361ce42d",
+          "id": "assertion.claim.frontier.arxiv-2609-23199",
+          "target_kind": "node",
+          "target_sha256": "e33b811b9a06eb8c266b3d181f31b1bbd885f0a6b8669ef714027ffd48a18bda",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124233",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"",
+            "id": "claim.frontier.arxiv-2609-23199",
+            "label": "LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl124233",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124233"
+                "id": "source.frontier.arxiv-2609-23199",
+                "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.23199",
+                "title": "arXiv:2609.23199",
+                "url": "https://arxiv.org/abs/2609.23199"
+              },
+              {
+                "id": "doi:10.1109/jphot.2026.3734836",
+                "title": "doi:10.1109/jphot.2026.3734836",
+                "url": "https://doi.org/10.1109/jphot.2026.3734836"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-19",
+              "source_ids": [
+                "source.frontier.arxiv-2609-23199"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124233 names Climate change: \"These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies.\"",
+          "statement": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124233 abstract",
-            "time": "2026-09-29",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.23199",
+            "time": "2026-09-19",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124233",
-              "source_sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
-              "start": 2024,
-              "end": 2259,
-              "quote": "These results demonstrate that rewetting effectively restores the flood control function of drained boreal peatlands, strengthens their resilience under climate change, and supports ecosystem recovery and climate adaptation strategies."
+              "source_id": "source.frontier.arxiv-2609-23199",
+              "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+              "start": 2628,
+              "end": 2856,
+              "quote": "Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23199",
+              "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-19</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23199",
+              "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+              "start": 1746,
+              "end": 1808,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gc013127.concept.usgs.727",
-          "target_kind": "edge",
-          "target_sha256": "dcb058d2c2d350403dcc64ccc215d6ee1456a79af93b84787a24d0a5e057a2a2",
+          "id": "assertion.claim.frontier.arxiv-2609-23085",
+          "target_kind": "node",
+          "target_sha256": "0c2b03d9b7f61908e4930255a68a278b4aa830f5d46eacdb1a95676e0f2acb18",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gc013127",
-            "target": "concept.usgs.727",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"",
+            "id": "claim.frontier.arxiv-2609-23085",
+            "label": "Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gc013127",
-                "url": "https://api.crossref.org/works/10.1029/2026gc013127"
+                "id": "source.frontier.arxiv-2609-23085",
+                "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.23085",
+                "title": "arXiv:2609.23085",
+                "url": "https://arxiv.org/abs/2609.23085"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-19",
+              "source_ids": [
+                "source.frontier.arxiv-2609-23085"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gc013127 names Metamorphism (geological): \"The rocks record prograde burial, peak high‐pressure amphibolite‐facies metamorphism, and fluid‐assisted retrogression during exhumation.\"",
+          "statement": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"",
           "scope": {
-            "population": "doi:10.1029/2026gc013127 abstract",
-            "time": "2026-09-29",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.23085",
+            "time": "2026-09-19",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gc013127",
-              "source_sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
-              "start": 1719,
-              "end": 1871,
-              "quote": "The rocks record prograde burial, peak high\\u2010pressure amphibolite\\u2010facies metamorphism, and fluid\\u2010assisted retrogression during exhumation."
+              "source_id": "source.frontier.arxiv-2609-23085",
+              "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+              "start": 3663,
+              "end": 3861,
+              "quote": "Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23085",
+              "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+              "start": 1124,
+              "end": 1153,
+              "quote": "<created>2026-09-19</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-23085",
+              "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+              "start": 2397,
+              "end": 2459,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70320.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "044c93e518ff928f92294bb0d4307c623b85ac5319590bc58aa14d7af2302314",
+          "id": "assertion.claim.frontier.arxiv-2609-22775",
+          "target_kind": "node",
+          "target_sha256": "4af32e824e726799b88d3216d8168d9d745e823b6eb705b4ca7606c9c4ac565f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-qj-70320",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"",
+            "id": "claim.frontier.arxiv-2609-22775",
+            "label": "DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-qj-70320",
-                "url": "https://api.crossref.org/works/10.1002/qj.70320"
+                "id": "source.frontier.arxiv-2609-22775",
+                "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.22775",
+                "title": "arXiv:2609.22775",
+                "url": "https://arxiv.org/abs/2609.22775"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-19",
+              "source_ids": [
+                "source.frontier.arxiv-2609-22775"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/qj.70320 names Topography: \"The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas.\"",
+          "statement": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"",
           "scope": {
-            "population": "doi:10.1002/qj.70320 abstract",
-            "time": "2026-09-29",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.22775",
+            "time": "2026-09-19",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-qj-70320",
-              "source_sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
-              "start": 1679,
-              "end": 1825,
-              "quote": "The results showed that topography plays a paramount role, with most precipitation growth occurring on windward slopes and decay in leeward areas."
+              "source_id": "source.frontier.arxiv-2609-22775",
+              "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+              "start": 3092,
+              "end": 3291,
+              "quote": "The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes)."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-22775",
+              "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-09-19</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-22775",
+              "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+              "start": 1666,
+              "end": 1728,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01.concept.mesh.d057217",
-          "target_kind": "edge",
-          "target_sha256": "bae06e564e38568f02beaf1a9176f5a65d6f793c4c3d47e057bf65db6405300b",
+          "id": "assertion.claim.frontier.arxiv-2609-22615",
+          "target_kind": "node",
+          "target_sha256": "96738d113de264b828a57dd20f4476b9cc89a4e1ac4f698ad231439ee857f97b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-54929-2786-5738-2026-27-09-01",
-            "target": "concept.mesh.d057217",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"",
+            "id": "claim.frontier.arxiv-2609-22615",
+            "label": "Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
-                "url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01"
+                "id": "source.frontier.arxiv-2609-22615",
+                "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.22615",
+                "title": "arXiv:2609.22615",
+                "url": "https://arxiv.org/abs/2609.22615"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-18",
+              "source_ids": [
+                "source.frontier.arxiv-2609-22615"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.54929/2786-5738-2026-27-09-01 names Economic Development: \"The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development.\"",
+          "statement": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"",
           "scope": {
-            "population": "doi:10.54929/2786-5738-2026-27-09-01 abstract",
-            "time": "2026-09-28",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.22615",
+            "time": "2026-09-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
-              "source_sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
-              "start": 892,
-              "end": 1080,
-              "quote": "The study aims to assess whether digital public service maturity is associated with SME labour productivity and whether this association persists after accounting for economic development."
+              "source_id": "source.frontier.arxiv-2609-22615",
+              "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+              "start": 2224,
+              "end": 2503,
+              "quote": "For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-22615",
+              "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-18</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-22615",
+              "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+              "start": 1569,
+              "end": 1631,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261281.concept.aat.300060368",
-          "target_kind": "edge",
-          "target_sha256": "440f66fa02e365b28a8a934694ab41d70025d8496d76b3d34e96d5d824d1864d",
+          "id": "assertion.claim.frontier.arxiv-2609-21966",
+          "target_kind": "node",
+          "target_sha256": "f97feec8b76ab0a8ba0b3049af47cafa32d05e103c02e20b5b5868d3dcef11d0",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-erats-20261281",
-            "target": "concept.aat.300060368",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"",
+            "id": "claim.frontier.arxiv-2609-21966",
+            "label": "Automata-Theoretic Verification of Interval Markov Decision Processes",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-38159-erats-20261281",
-                "url": "https://api.crossref.org/works/10.38159/erats.20261281"
+                "id": "source.frontier.arxiv-2609-21966",
+                "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.21966",
+                "title": "arXiv:2609.21966",
+                "url": "https://arxiv.org/abs/2609.21966"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-18",
+              "source_ids": [
+                "source.frontier.arxiv-2609-21966"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.38159/erats.20261281 names syncretism: \"This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens.\"",
+          "statement": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"",
           "scope": {
-            "population": "doi:10.38159/erats.20261281 abstract",
-            "time": "2026-09-28",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.21966",
+            "time": "2026-09-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-38159-erats-20261281",
-              "source_sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
-              "start": 591,
-              "end": 688,
-              "quote": "This paper examines syncretism in African Pentecostalism using a decolonial pneumatological lens."
+              "source_id": "source.frontier.arxiv-2609-21966",
+              "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+              "start": 2811,
+              "end": 2979,
+              "quote": "We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21966",
+              "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-09-18</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21966",
+              "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+              "start": 2160,
+              "end": 2222,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-eco-70277.concept.usgs.2027",
-          "target_kind": "edge",
-          "target_sha256": "3cebf8181da1f583a23f0978a6dee2c22c03053520727eac4240ab81144cbb5e",
+          "id": "assertion.claim.frontier.arxiv-2609-21270",
+          "target_kind": "node",
+          "target_sha256": "bb3a30fcfa51c5f286b0277f756e51a7e111aab8ca4073cc47185278d8028337",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-eco-70277",
-            "target": "concept.usgs.2027",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"",
+            "id": "claim.frontier.arxiv-2609-21270",
+            "label": "Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-eco-70277",
-                "url": "https://api.crossref.org/works/10.1002/eco.70277"
+                "id": "source.frontier.arxiv-2609-21270",
+                "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.21270",
+                "title": "arXiv:2609.21270",
+                "url": "https://arxiv.org/abs/2609.21270"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-18",
+              "source_ids": [
+                "source.frontier.arxiv-2609-21270"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/eco.70277 names Soil moisture: \"We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post‐treatment, relative to an untreated watershed, and (3) ET decreased by 90 mm in the post treatment year for the treated watershed.\"",
+          "statement": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
           "scope": {
-            "population": "doi:10.1002/eco.70277 abstract",
-            "time": "2026-09-28",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.21270",
+            "time": "2026-09-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-eco-70277",
-              "source_sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
-              "start": 2283,
-              "end": 2697,
-              "quote": "We found that (1) there were statistically significant effects on soil moisture and evapotranspiration (ET) from mechanical tree thinning and prescribed burns compared to an untreated watershed, (2) soil moisture decreased at the surface and increased in the root zone post\\u2010treatment, relative to an untreated watershed, and (3) ET decreased by 90\\u2009mm in the post treatment year for the treated watershed."
+              "source_id": "source.frontier.arxiv-2609-21270",
+              "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+              "start": 2195,
+              "end": 2428,
+              "quote": "For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21270",
+              "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-18</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21270",
+              "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+              "start": 1729,
+              "end": 1791,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-iroh-70046.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "136f637a24e58361baeed3cba87d3e882d5db73df6093c9ac84740ad118c9dde",
+          "id": "assertion.claim.frontier.arxiv-2609-21093",
+          "target_kind": "node",
+          "target_sha256": "c465663045ae0609766765a49d317b4f82250daed86724d16e1649eebe41769d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-iroh-70046",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"",
+            "id": "claim.frontier.arxiv-2609-21093",
+            "label": "A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-iroh-70046",
-                "url": "https://api.crossref.org/works/10.1002/iroh.70046"
+                "id": "source.frontier.arxiv-2609-21093",
+                "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.21093",
+                "title": "arXiv:2609.21093",
+                "url": "https://arxiv.org/abs/2609.21093"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-17",
+              "source_ids": [
+                "source.frontier.arxiv-2609-21093"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/iroh.70046 names Climate change: \"Wildfires are becoming increasingly frequent and severe as a consequence of climate change.\"",
+          "statement": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"",
           "scope": {
-            "population": "doi:10.1002/iroh.70046 abstract",
-            "time": "2026-09-27",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.21093",
+            "time": "2026-09-17",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-iroh-70046",
-              "source_sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
-              "start": 3165,
-              "end": 3256,
-              "quote": "Wildfires are becoming increasingly frequent and severe as a consequence of climate change."
+              "source_id": "source.frontier.arxiv-2609-21093",
+              "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+              "start": 2652,
+              "end": 2783,
+              "quote": "We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21093",
+              "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-17</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21093",
+              "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+              "start": 1746,
+              "end": 1808,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261284.concept.aat.300069306",
-          "target_kind": "edge",
-          "target_sha256": "72b6686a1c9ac7efcd7acc2a0d8c7897305f26ea11263c238198d6b8d2c8fd68",
+          "id": "assertion.claim.frontier.arxiv-2609-21057",
+          "target_kind": "node",
+          "target_sha256": "76b88ca69cb60353712208a82ce03a82e0b5852dd6c7719bb1c49ff1ce79fb05",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-erats-20261284",
-            "target": "concept.aat.300069306",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"",
+            "id": "claim.frontier.arxiv-2609-21057",
+            "label": "FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-38159-erats-20261284",
-                "url": "https://api.crossref.org/works/10.38159/erats.20261284"
+                "id": "source.frontier.arxiv-2609-21057",
+                "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.21057",
+                "title": "arXiv:2609.21057",
+                "url": "https://arxiv.org/abs/2609.21057"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-17",
+              "source_ids": [
+                "source.frontier.arxiv-2609-21057"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.38159/erats.20261284 names Ideal, the: \"The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice.\"",
+          "statement": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
           "scope": {
-            "population": "doi:10.38159/erats.20261284 abstract",
-            "time": "2026-09-26",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.21057",
+            "time": "2026-09-17",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-38159-erats-20261284",
-              "source_sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
-              "start": 964,
-              "end": 1118,
-              "quote": "The findings reveal a significant disconnect between the ideals of law and faith-based actions, a total dichotomy from societal norms and natural justice."
+              "source_id": "source.frontier.arxiv-2609-21057",
+              "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+              "start": 2183,
+              "end": 2620,
+              "quote": "We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21057",
+              "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+              "start": 1128,
+              "end": 1157,
+              "quote": "<created>2026-09-17</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-21057",
+              "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+              "start": 1737,
+              "end": 1799,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ruso-70070.concept.mesh.d057217",
-          "target_kind": "edge",
-          "target_sha256": "bbae0bb2a21f408f515713d9b97f647e4d5e26a1f0078a40092517592d118e74",
+          "id": "assertion.claim.frontier.arxiv-2609-19468",
+          "target_kind": "node",
+          "target_sha256": "20b06709a97ffe2fdd32187dbe5ad19e3076dfb72acae2020827f39ef0798c20",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ruso-70070",
-            "target": "concept.mesh.d057217",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"",
+            "id": "claim.frontier.arxiv-2609-19468",
+            "label": "High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ruso-70070",
-                "url": "https://api.crossref.org/works/10.1111/ruso.70070"
+                "id": "source.frontier.arxiv-2609-19468",
+                "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.19468",
+                "title": "arXiv:2609.19468",
+                "url": "https://arxiv.org/abs/2609.19468"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-16",
+              "source_ids": [
+                "source.frontier.arxiv-2609-19468"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ruso.70070 names Economic Development: \"But contrary to views of a binary metro‐nonmetro divide: big‐city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures.\"",
+          "statement": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"",
           "scope": {
-            "population": "doi:10.1111/ruso.70070 abstract",
-            "time": "2026-09-26",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.19468",
+            "time": "2026-09-16",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ruso-70070",
-              "source_sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
-              "start": 1994,
-              "end": 2446,
-              "quote": "But contrary to views of a binary metro\\u2010nonmetro divide: big\\u2010city metro counties diverge most from others, especially remote rural counties, and possess characteristics that make them much better equipped to protect the local social safety net even as they engage in competitive economic development; suburban metros are closer to their nonmetro counterparts in service provision and governance; and counties overall face operating pressures."
+              "source_id": "source.frontier.arxiv-2609-19468",
+              "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+              "start": 3226,
+              "end": 3331,
+              "quote": "The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-19468",
+              "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-16</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-19468",
+              "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+              "start": 2743,
+              "end": 2805,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-200681.field.mesh.d019021",
-          "target_kind": "edge",
-          "target_sha256": "3b02aab8c12c34bb815e397c9fab4e968000577fa9d9817f58510e06db58afbb",
+          "id": "assertion.claim.frontier.arxiv-2609-18467",
+          "target_kind": "node",
+          "target_sha256": "8673127090530ef79c91ce67d21a0961a0d2324c28977595f997b55b436942ba",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-nhcm-3-200681",
-            "target": "field.mesh.d019021",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"",
+            "id": "claim.frontier.arxiv-2609-18467",
+            "label": "Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-nhcm-3-200681",
-                "url": "https://api.crossref.org/works/10.3897/nhcm.3.200681"
+                "id": "source.frontier.arxiv-2609-18467",
+                "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.18467",
+                "title": "arXiv:2609.18467",
+                "url": "https://arxiv.org/abs/2609.18467"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-16",
+              "source_ids": [
+                "source.frontier.arxiv-2609-18467"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.3897/nhcm.3.200681 names Natural History: \": Natural history collections can be a valuable source of genetic material for evolutionary research.\"",
+          "statement": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
           "scope": {
-            "population": "doi:10.3897/nhcm.3.200681 abstract",
-            "time": "2026-09-25",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.18467",
+            "time": "2026-09-16",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-200681",
-              "source_sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
-              "start": 650,
-              "end": 751,
-              "quote": ": Natural history collections can be a valuable source of genetic material for evolutionary research."
+              "source_id": "source.frontier.arxiv-2609-18467",
+              "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+              "start": 2727,
+              "end": 2880,
+              "quote": "We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-18467",
+              "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-16</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-18467",
+              "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+              "start": 2165,
+              "end": 2227,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001005.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "37c658edad28ad0b89dc462ec248585db92c0ddd90adb110e8bd356eb40423cc",
+          "id": "assertion.claim.frontier.arxiv-2609-17042",
+          "target_kind": "node",
+          "target_sha256": "dfd363fcf52796128cbf35327a99ab3b4afd63931a94569aa3641633dee4b997",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0001005",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"",
+            "id": "claim.frontier.arxiv-2609-17042",
+            "label": "Learning Options for Compositional Motor Control with Adapter Banks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0001005",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005"
+                "id": "source.frontier.arxiv-2609-17042",
+                "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.17042",
+                "title": "arXiv:2609.17042",
+                "url": "https://arxiv.org/abs/2609.17042"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-15",
+              "source_ids": [
+                "source.frontier.arxiv-2609-17042"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001005 names Climate change: \"Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria.\"",
+          "statement": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0001005 abstract",
-            "time": "2026-09-24",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.17042",
+            "time": "2026-09-15",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001005",
-              "source_sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
-              "start": 793,
-              "end": 1011,
-              "quote": "Climate change has accelerated devastating impacts across the globe, and heatwaves are among the most severe climate extremes threatening human health, agricultural productivity, and ecosystems in northwestern Nigeria."
+              "source_id": "source.frontier.arxiv-2609-17042",
+              "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+              "start": 2732,
+              "end": 2950,
+              "quote": "We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-17042",
+              "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+              "start": 1046,
+              "end": 1075,
+              "quote": "<created>2026-09-15</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-17042",
+              "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+              "start": 1768,
+              "end": 1830,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-moth-70148.field.mesh.d008678",
-          "target_kind": "edge",
-          "target_sha256": "e3d0ac61e4a805be0aead5e39d2e63913fbb95a40fb83cb973180fc91b8f10c6",
+          "id": "assertion.claim.frontier.arxiv-2609-16899",
+          "target_kind": "node",
+          "target_sha256": "439daac35e888b0458f5f4a8499371b529122e2c736647b8ca92d11a1613044d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-moth-70148",
-            "target": "field.mesh.d008678",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"",
+            "id": "claim.frontier.arxiv-2609-16899",
+            "label": "Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-moth-70148",
-                "url": "https://api.crossref.org/works/10.1111/moth.70148"
+                "id": "source.frontier.arxiv-2609-16899",
+                "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.16899",
+                "title": "arXiv:2609.16899",
+                "url": "https://arxiv.org/abs/2609.16899"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-15",
+              "source_ids": [
+                "source.frontier.arxiv-2609-16899"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/moth.70148 names Metaphysics: \"However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics.\"",
+          "statement": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"",
           "scope": {
-            "population": "doi:10.1111/moth.70148 abstract",
-            "time": "2026-09-24",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.16899",
+            "time": "2026-09-15",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-moth-70148",
-              "source_sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
-              "start": 1089,
-              "end": 1202,
-              "quote": "However, when we consider Heidegger and Marion's account, we find a completely different approach to metaphysics."
+              "source_id": "source.frontier.arxiv-2609-16899",
+              "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+              "start": 3034,
+              "end": 3229,
+              "quote": "Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16899",
+              "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-15</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16899",
+              "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+              "start": 2094,
+              "end": 2156,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-20267724.field.aat.300054288",
-          "target_kind": "edge",
-          "target_sha256": "54b9e21c9b6ea576eecafc57464892bbe6691aa35434d2c16c8af85059266e00",
+          "id": "assertion.claim.frontier.arxiv-2609-16353",
+          "target_kind": "node",
+          "target_sha256": "308626710d74f0f311a0557985dbae09d96b47474e6736bea1f5cacf744f1aef",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-ehass-20267724",
-            "target": "field.aat.300054288",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"",
+            "id": "claim.frontier.arxiv-2609-16353",
+            "label": "Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-38159-ehass-20267724",
-                "url": "https://api.crossref.org/works/10.38159/ehass.20267724"
+                "id": "source.frontier.arxiv-2609-16353",
+                "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.16353",
+                "title": "arXiv:2609.16353",
+                "url": "https://arxiv.org/abs/2609.16353"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-14",
+              "source_ids": [
+                "source.frontier.arxiv-2609-16353"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.38159/ehass.20267724 names epistemology: \"Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement.\"",
+          "statement": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"",
           "scope": {
-            "population": "doi:10.38159/ehass.20267724 abstract",
-            "time": "2026-09-23",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.16353",
+            "time": "2026-09-14",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-38159-ehass-20267724",
-              "source_sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
-              "start": 768,
-              "end": 984,
-              "quote": "Drawing on decolonial theory, Indigenous Research Methodologies (IRMs), Ubuntu philosophy and Foucauldian discourse analysis, the article discusses how Indigenous epistemology can help reimagine community engagement."
+              "source_id": "source.frontier.arxiv-2609-16353",
+              "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+              "start": 2333,
+              "end": 2477,
+              "quote": "We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16353",
+              "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-09-14</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16353",
+              "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+              "start": 1808,
+              "end": 1870,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124881.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "ebb67782a0595644d988fb5734f0e3c2d5a14253a252300a435aee486ff4972d",
+          "id": "assertion.claim.frontier.arxiv-2609-16258",
+          "target_kind": "node",
+          "target_sha256": "b63a96fb3fedb2f5e089b9841b38da80f9f1e2f5c871752d9028b4f41e475324",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124881",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"",
+            "id": "claim.frontier.arxiv-2609-16258",
+            "label": "The AI-Enabled Scientific Frontier",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl124881",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124881"
+                "id": "source.frontier.arxiv-2609-16258",
+                "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.16258",
+                "title": "arXiv:2609.16258",
+                "url": "https://arxiv.org/abs/2609.16258"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-14",
+              "source_ids": [
+                "source.frontier.arxiv-2609-16258"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124881 names Topography: \"Glacier bed topography is crucial for modeling ice mass loss.\"",
+          "statement": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124881 abstract",
-            "time": "2026-09-23",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.16258",
+            "time": "2026-09-14",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124881",
-              "source_sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
-              "start": 1482,
-              "end": 1543,
-              "quote": "Glacier bed topography is crucial for modeling ice mass loss."
+              "source_id": "source.frontier.arxiv-2609-16258",
+              "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+              "start": 2057,
+              "end": 2131,
+              "quote": "Does AI outperform all techniques, or only some, and how is this changing?"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16258",
+              "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+              "start": 1130,
+              "end": 1159,
+              "quote": "<created>2026-09-14</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-16258",
+              "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+              "start": 1828,
+              "end": 1890,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001578.ology.seismology",
-          "target_kind": "edge",
-          "target_sha256": "9c83b12562399d0b7cc3a730343ff71a638da8dd24a9bc22a8d7e34ab439fdc7",
+          "id": "assertion.claim.frontier.arxiv-2609-05749",
+          "target_kind": "node",
+          "target_sha256": "8c190861d210e319ded5562e3121eac7e3ea8ecbcf32bfe9f737fbde3b1e8287",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026jh001578",
-            "target": "ology.seismology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"",
+            "id": "claim.frontier.arxiv-2609-05749",
+            "label": "The Normalization of Deviance in AI Development",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026jh001578",
-                "url": "https://api.crossref.org/works/10.1029/2026jh001578"
+                "id": "source.frontier.arxiv-2609-05749",
+                "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.05749",
+                "title": "arXiv:2609.05749",
+                "url": "https://arxiv.org/abs/2609.05749"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-13",
+              "source_ids": [
+                "source.frontier.arxiv-2609-05749"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026jh001578 names Seismology: \"Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data‐driven approaches to rapid earthquake characterization.\"",
+          "statement": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"",
           "scope": {
-            "population": "doi:10.1029/2026jh001578 abstract",
-            "time": "2026-09-21",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.05749",
+            "time": "2026-09-13",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026jh001578",
-              "source_sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
-              "start": 2719,
-              "end": 2913,
-              "quote": "Our results highlight the ability of LLMs to function as effective tools in seismology and suggest their potential for advancing data\\u2010driven approaches to rapid earthquake characterization."
+              "source_id": "source.frontier.arxiv-2609-05749",
+              "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+              "start": 2829,
+              "end": 3037,
+              "quote": "The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-05749",
+              "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-09-13</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-05749",
+              "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+              "start": 1948,
+              "end": 2010,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-gdj3-70104.ology.meteorology",
-          "target_kind": "edge",
-          "target_sha256": "ba0e72327f0351eaaa5b0699d0d5b7ebb1e286e02a9577f8fc72258d3c19aefa",
+          "id": "assertion.claim.frontier.arxiv-2609-14022",
+          "target_kind": "node",
+          "target_sha256": "1e7b0c229b300ae0c765be5e9dff4ce547e888afe590ae9a25063c587f663e1a",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-gdj3-70104",
-            "target": "ology.meteorology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"",
+            "id": "claim.frontier.arxiv-2609-14022",
+            "label": "Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-gdj3-70104",
-                "url": "https://api.crossref.org/works/10.1002/gdj3.70104"
+                "id": "source.frontier.arxiv-2609-14022",
+                "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.14022",
+                "title": "arXiv:2609.14022",
+                "url": "https://arxiv.org/abs/2609.14022"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-12",
+              "source_ids": [
+                "source.frontier.arxiv-2609-14022"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/gdj3.70104 names Meteorology: \"Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology.\"",
+          "statement": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
           "scope": {
-            "population": "doi:10.1002/gdj3.70104 abstract",
-            "time": "2026-09-21",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.14022",
+            "time": "2026-09-12",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-gdj3-70104",
-              "source_sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
-              "start": 941,
-              "end": 1066,
-              "quote": "Accurately capturing the spatial distribution of precipitation over complex terrain remains a major challenge in meteorology."
+              "source_id": "source.frontier.arxiv-2609-14022",
+              "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+              "start": 4982,
+              "end": 5211,
+              "quote": "We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-14022",
+              "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-12</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-14022",
+              "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+              "start": 3626,
+              "end": 3688,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122610.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "a40868461cc51d80f2ab195bc477810f9444954ccf350d129551a2a045d4a9ab",
+          "id": "assertion.claim.frontier.arxiv-2609-12866",
+          "target_kind": "node",
+          "target_sha256": "6fb5d07ac292366f14bd618e81b15c716cf7d1f4890cb3390114c1caf547cab9",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122610",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"",
+            "id": "claim.frontier.arxiv-2609-12866",
+            "label": "Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122610",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122610"
+                "id": "source.frontier.arxiv-2609-12866",
+                "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.12866",
+                "title": "arXiv:2609.12866",
+                "url": "https://arxiv.org/abs/2609.12866"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-11",
+              "source_ids": [
+                "source.frontier.arxiv-2609-12866"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122610 names Topography: \"Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin‐scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation.\"",
+          "statement": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122610 abstract",
-            "time": "2026-09-18",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.12866",
+            "time": "2026-09-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122610",
-              "source_sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
-              "start": 956,
-              "end": 1233,
-              "quote": "Surface Water and Ocean Topography (SWOT) provides water surface elevation (WSE) that can constrain river hydraulics through data assimilation (DA), but basin\\u2010scale impacts of assimilating real observations remain uncertain under heterogeneous availability and regulation."
+              "source_id": "source.frontier.arxiv-2609-12866",
+              "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+              "start": 2445,
+              "end": 2599,
+              "quote": "We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices)."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12866",
+              "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-11</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12866",
+              "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+              "start": 1836,
+              "end": 1898,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70308.concept.usgs.64",
-          "target_kind": "edge",
-          "target_sha256": "2b65bb9eac425d93620749c7801216e8f784b13faa6a657dcb146aec1599063a",
+          "id": "assertion.claim.frontier.arxiv-2609-12486",
+          "target_kind": "node",
+          "target_sha256": "4a8ebb64b931d95b0c5218130b7195bea59b74a1b7b9182f4541a29da18615ae",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-qj-70308",
-            "target": "concept.usgs.64",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"",
+            "id": "claim.frontier.arxiv-2609-12486",
+            "label": "Adaptive Agent Design",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-qj-70308",
-                "url": "https://api.crossref.org/works/10.1002/qj.70308"
+                "id": "source.frontier.arxiv-2609-12486",
+                "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.12486",
+                "title": "arXiv:2609.12486",
+                "url": "https://arxiv.org/abs/2609.12486"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-11",
+              "source_ids": [
+                "source.frontier.arxiv-2609-12486"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/qj.70308 names Atmospheric circulation: \"Each regime exhibits a distinct atmospheric circulation pattern.\"",
+          "statement": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"",
           "scope": {
-            "population": "doi:10.1002/qj.70308 abstract",
-            "time": "2026-09-17",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.12486",
+            "time": "2026-09-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-qj-70308",
-              "source_sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
-              "start": 1812,
-              "end": 1876,
-              "quote": "Each regime exhibits a distinct atmospheric circulation pattern."
+              "source_id": "source.frontier.arxiv-2609-12486",
+              "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+              "start": 2338,
+              "end": 2642,
+              "quote": "For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12486",
+              "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+              "start": 1128,
+              "end": 1157,
+              "quote": "<created>2026-09-11</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12486",
+              "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+              "start": 1825,
+              "end": 1887,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4281.concept.eia.energy-consumption",
-          "target_kind": "edge",
-          "target_sha256": "b278bae4fd0a6627085971e63abd53c7e4795ae9b62bb5c6c14c780f00540bca",
+          "id": "assertion.claim.frontier.arxiv-2609-12016",
+          "target_kind": "node",
+          "target_sha256": "1407a2a40fe480f7757cb800d33da002b2148b04b8adf7e3aa6991aed0928205",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-55730-1300-0632-4281",
-            "target": "concept.eia.energy-consumption",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"",
+            "id": "claim.frontier.arxiv-2609-12016",
+            "label": "Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-55730-1300-0632-4281",
-                "url": "https://api.crossref.org/works/10.55730/1300-0632.4281"
+                "id": "source.frontier.arxiv-2609-12016",
+                "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.12016",
+                "title": "arXiv:2609.12016",
+                "url": "https://arxiv.org/abs/2609.12016"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-10",
+              "source_ids": [
+                "source.frontier.arxiv-2609-12016"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.55730/1300-0632.4281 names Energy consumption: \"The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions.\"",
+          "statement": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
           "scope": {
-            "population": "doi:10.55730/1300-0632.4281 abstract",
-            "time": "2026-09-16",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.12016",
+            "time": "2026-09-10",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-55730-1300-0632-4281",
-              "source_sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
-              "start": 899,
-              "end": 1053,
-              "quote": "The proposed control strategy aims to minimize energy consumption while maintaining rapid and stable cooling performance under varying ambient conditions."
+              "source_id": "source.frontier.arxiv-2609-12016",
+              "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+              "start": 2518,
+              "end": 2870,
+              "quote": "We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12016",
+              "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-09-10</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-12016",
+              "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+              "start": 2016,
+              "end": 2078,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4275.concept.eia.energy-consumption",
-          "target_kind": "edge",
-          "target_sha256": "980c612f0a4461d7be757a3c6b0d4b0c74ad0f4650f4278d40a4d17ecc1a0612",
+          "id": "assertion.claim.frontier.arxiv-2609-11530",
+          "target_kind": "node",
+          "target_sha256": "f6ced05713c8c792ff8a98644885b116b83444ed35c3596967af6642dba86227",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-55730-1300-0632-4275",
-            "target": "concept.eia.energy-consumption",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"",
+            "id": "claim.frontier.arxiv-2609-11530",
+            "label": "pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-55730-1300-0632-4275",
-                "url": "https://api.crossref.org/works/10.55730/1300-0632.4275"
+                "id": "source.frontier.arxiv-2609-11530",
+                "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.11530",
+                "title": "arXiv:2609.11530",
+                "url": "https://arxiv.org/abs/2609.11530"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-10",
+              "source_ids": [
+                "source.frontier.arxiv-2609-11530"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.55730/1300-0632.4275 names Energy consumption: \"Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20–30% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption.\"",
+          "statement": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"",
           "scope": {
-            "population": "doi:10.55730/1300-0632.4275 abstract",
-            "time": "2026-09-16",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.11530",
+            "time": "2026-09-10",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-55730-1300-0632-4275",
-              "source_sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
-              "start": 1311,
-              "end": 1616,
-              "quote": "Experimental evaluations on the ESC-50 environmental sound dataset demonstrate that our method matches or exceeds the performance of larger baseline models while using 20\\u201330% fewer parameters, achieving up to 48% latency reduction in multidevice setups, and substantially lowering energy consumption."
+              "source_id": "source.frontier.arxiv-2609-11530",
+              "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+              "start": 3454,
+              "end": 3650,
+              "quote": "We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-11530",
+              "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+              "start": 966,
+              "end": 995,
+              "quote": "<created>2026-09-10</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-11530",
+              "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+              "start": 2147,
+              "end": 2209,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-eet-70139.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "823d43727642b31044de8f706af9ec20e919df8b4fd503af78edea331a7d9188",
+          "id": "assertion.claim.frontier.arxiv-2609-08218",
+          "target_kind": "node",
+          "target_sha256": "e64e423c33260e0218665ec9cc382917080218f7f2bb40857cce80d0ea6736f4",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-eet-70139",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"",
+            "id": "claim.frontier.arxiv-2609-08218",
+            "label": "Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-eet-70139",
-                "url": "https://api.crossref.org/works/10.1002/eet.70139"
+                "id": "source.frontier.arxiv-2609-08218",
+                "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.08218",
+                "title": "arXiv:2609.08218",
+                "url": "https://arxiv.org/abs/2609.08218"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-09",
+              "source_ids": [
+                "source.frontier.arxiv-2609-08218"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/eet.70139 names Climate change: \"We show that assembly members were more concerned about climate change and were more likely to engage in climate‐conscious consumption habits following CAUK than before the assembly.\"",
+          "statement": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"",
           "scope": {
-            "population": "doi:10.1002/eet.70139 abstract",
-            "time": "2026-09-14",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.08218",
+            "time": "2026-09-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-eet-70139",
-              "source_sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
-              "start": 2452,
-              "end": 2639,
-              "quote": "We show that assembly members were more concerned about climate change and were more likely to engage in climate\\u2010conscious consumption habits following CAUK than before the assembly."
+              "source_id": "source.frontier.arxiv-2609-08218",
+              "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+              "start": 2845,
+              "end": 2959,
+              "quote": "We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-08218",
+              "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-09</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-08218",
+              "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+              "start": 1586,
+              "end": 1648,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-jclp-70212.ology.psychopathology",
-          "target_kind": "edge",
-          "target_sha256": "0e9258994f368a2f6fcdb5e65757ba5828c985f3b8aa1536bee44b80009a8e22",
+          "id": "assertion.claim.frontier.arxiv-2609-06163",
+          "target_kind": "node",
+          "target_sha256": "6ce239788a388f3ed75f291462aa025883af7db4c61e81f88db58c5851a04201",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-jclp-70212",
-            "target": "ology.psychopathology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"",
+            "id": "claim.frontier.arxiv-2609-06163",
+            "label": "Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-jclp-70212",
-                "url": "https://api.crossref.org/works/10.1002/jclp.70212"
+                "id": "source.frontier.arxiv-2609-06163",
+                "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.06163",
+                "title": "arXiv:2609.06163",
+                "url": "https://arxiv.org/abs/2609.06163"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-05",
+              "source_ids": [
+                "source.frontier.arxiv-2609-06163"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/jclp.70212 names Psychopathology: \"This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages.\"",
+          "statement": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"",
           "scope": {
-            "population": "doi:10.1002/jclp.70212 abstract",
-            "time": "2026-09-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.06163",
+            "time": "2026-09-05",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-jclp-70212",
-              "source_sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
-              "start": 3020,
-              "end": 3213,
-              "quote": "This study extends prior research on how patients' interpersonal style relates to psychopathology by using longitudinal, transdiagnostic data of individuals across different symptomatic stages."
+              "source_id": "source.frontier.arxiv-2609-06163",
+              "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+              "start": 2673,
+              "end": 2809,
+              "quote": "Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-06163",
+              "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-09-05</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-06163",
+              "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+              "start": 1653,
+              "end": 1715,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-12944-cwe-21-2-3.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "6a162e820ccdcd99284802c8192a48f57226e01e217c479743c74eb3c2ec606f",
+          "id": "assertion.claim.frontier.arxiv-2609-06066",
+          "target_kind": "node",
+          "target_sha256": "b4d6e7484b0f2f26120741889f7e2dce8b232b445f2f4f797fbf407e287cba12",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-12944-cwe-21-2-3",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"",
+            "id": "claim.frontier.arxiv-2609-06066",
+            "label": "Scalability of Graph Neural Network Policies in Wireless Communication Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-12944-cwe-21-2-3",
-                "url": "https://api.crossref.org/works/10.12944/cwe.21.2.3"
+                "id": "source.frontier.arxiv-2609-06066",
+                "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.06066",
+                "title": "arXiv:2609.06066",
+                "url": "https://arxiv.org/abs/2609.06066"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-05",
+              "source_ids": [
+                "source.frontier.arxiv-2609-06066"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.12944/cwe.21.2.3 names Climate change: \"This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature.\"",
+          "statement": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"",
           "scope": {
-            "population": "doi:10.12944/cwe.21.2.3 abstract",
-            "time": "2026-09-10",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.06066",
+            "time": "2026-09-05",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-12944-cwe-21-2-3",
-              "source_sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
-              "start": 797,
-              "end": 1243,
-              "quote": "This review highlights how climate change is altering vulnerability, adaptation, resilience and species-loss risk across selected global hotspots, and suggests conservation responses that can reduce risk under present scenario of global warming.A narrative review was undertaken using peer-reviewed articles, major assessment reports and conservation-agency documents published mainly between 2000 and 2026, with emphasis on post-2015 literature."
+              "source_id": "source.frontier.arxiv-2609-06066",
+              "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+              "start": 2581,
+              "end": 2747,
+              "quote": "Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-06066",
+              "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-09-05</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-06066",
+              "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+              "start": 1697,
+              "end": 1759,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-bse-71470.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "d142f92e16042c6eae2b6e1d393674e3dfd15aada1c53b94526a78e7b6242e71",
+          "id": "assertion.claim.frontier.arxiv-2609-02071",
+          "target_kind": "node",
+          "target_sha256": "039e2ea49be10d4d3da82b47e1b5c6f61e412d8559c04b850256203485307c30",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-bse-71470",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"",
+            "id": "claim.frontier.arxiv-2609-02071",
+            "label": "Turnpike properties in nonlinear system identification",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-bse-71470",
-                "url": "https://api.crossref.org/works/10.1002/bse.71470"
+                "id": "source.frontier.arxiv-2609-02071",
+                "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2609.02071",
+                "title": "arXiv:2609.02071",
+                "url": "https://arxiv.org/abs/2609.02071"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-09-02",
+              "source_ids": [
+                "source.frontier.arxiv-2609-02071"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/bse.71470 names Climate change: \"This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector.\"",
+          "statement": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"",
           "scope": {
-            "population": "doi:10.1002/bse.71470 abstract",
-            "time": "2026-09-09",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2609.02071",
+            "time": "2026-09-02",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-bse-71470",
-              "source_sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
-              "start": 1444,
-              "end": 1577,
-              "quote": "This study explores how companies perceive risks stemming from climate change as a gradual process, focusing on the logistics sector."
+              "source_id": "source.frontier.arxiv-2609-02071",
+              "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+              "start": 2834,
+              "end": 3018,
+              "quote": "Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-02071",
+              "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-09-02</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2609-02071",
+              "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+              "start": 1618,
+              "end": 1680,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000986.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "5568aa84d74a54e19ec83cc77b3444176c7251b24c6d8bf7cd1eac79d5ee61b7",
+          "id": "assertion.claim.frontier.arxiv-2608-31034",
+          "target_kind": "node",
+          "target_sha256": "ec0bd10015ab5dca339cb414086f312a1612f4b6f53ac333f77f67b8a91388df",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000986",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"",
+            "id": "claim.frontier.arxiv-2608-31034",
+            "label": "XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000986",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986"
+                "id": "source.frontier.arxiv-2608-31034",
+                "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.31034",
+                "title": "arXiv:2608.31034",
+                "url": "https://arxiv.org/abs/2608.31034"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-31",
+              "source_ids": [
+                "source.frontier.arxiv-2608-31034"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000986 names Climate change: \"This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa.\"",
+          "statement": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0000986 abstract",
-            "time": "2026-09-08",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.31034",
+            "time": "2026-08-31",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000986",
-              "source_sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
-              "start": 1343,
-              "end": 1567,
-              "quote": "This study presents a novel five-step ensemble machine learning approach to improve predictive accuracy in assessing climate change impacts on inflow patterns and hydropower generation across seven dam basins in West Africa."
+              "source_id": "source.frontier.arxiv-2608-31034",
+              "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+              "start": 3083,
+              "end": 3336,
+              "quote": "Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-31034",
+              "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-08-31</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-31034",
+              "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+              "start": 2141,
+              "end": 2203,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-1752-1688-70151.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "332fe084ed8ec047f9b0ce05a10614d344ff3d34bf5d20456419851ce33c9461",
+          "id": "assertion.claim.frontier.arxiv-2608-28387",
+          "target_kind": "node",
+          "target_sha256": "6b07394df7c72280fcb7cc78d2d8826e8f36f255599684ae336b3116e2138c15",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-1752-1688-70151",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"",
+            "id": "claim.frontier.arxiv-2608-28387",
+            "label": "Neuromorphic architectures as numerical solvers for computational neuroscience",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-1752-1688-70151",
-                "url": "https://api.crossref.org/works/10.1111/1752-1688.70151"
+                "id": "source.frontier.arxiv-2608-28387",
+                "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.28387",
+                "title": "arXiv:2608.28387",
+                "url": "https://arxiv.org/abs/2608.28387"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-28",
+              "source_ids": [
+                "source.frontier.arxiv-2608-28387"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/1752-1688.70151 names Climate change: \"Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land‐use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil.\"",
+          "statement": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"",
           "scope": {
-            "population": "doi:10.1111/1752-1688.70151 abstract",
-            "time": "2026-09-07",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.28387",
+            "time": "2026-08-28",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-1752-1688-70151",
-              "source_sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
-              "start": 1874,
-              "end": 2156,
-              "quote": "Changes in precipitation regimes associated with climate variability and climate change pose significant challenges to water resource management, agriculture, and land\\u2010use planning, particularly in socioeconomically strategic regions such as the Piracicaba River Basin, Brazil."
+              "source_id": "source.frontier.arxiv-2608-28387",
+              "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+              "start": 2895,
+              "end": 3297,
+              "quote": "In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-28387",
+              "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+              "start": 1006,
+              "end": 1035,
+              "quote": "<created>2026-08-28</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-28387",
+              "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+              "start": 2089,
+              "end": 2151,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-jade-70048.concept.aat.300054181",
-          "target_kind": "edge",
-          "target_sha256": "c01fbf16f229689766e1c76ff2afd2187e28ccb0b5febb8928f5ecc49d243168",
+          "id": "assertion.claim.frontier.arxiv-2608-27536",
+          "target_kind": "node",
+          "target_sha256": "27bcb430fa3c83f7a7d1398d207348ef0a72dd0d9aef4475517ece783e174ba0",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-jade-70048",
-            "target": "concept.aat.300054181",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"",
+            "id": "claim.frontier.arxiv-2608-27536",
+            "label": "Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-jade-70048",
-                "url": "https://api.crossref.org/works/10.1111/jade.70048"
+                "id": "source.frontier.arxiv-2608-27536",
+                "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.27536",
+                "title": "arXiv:2608.27536",
+                "url": "https://arxiv.org/abs/2608.27536"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-27",
+              "source_ids": [
+                "source.frontier.arxiv-2608-27536"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/jade.70048 names graphic design: \"This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education.\"",
+          "statement": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"",
           "scope": {
-            "population": "doi:10.1111/jade.70048 abstract",
-            "time": "2026-09-05",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.27536",
+            "time": "2026-08-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-jade-70048",
-              "source_sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
-              "start": 1091,
-              "end": 1202,
-              "quote": "This study aims to examine the pedagogical potential of the braindrawing technique in graphic design education."
+              "source_id": "source.frontier.arxiv-2608-27536",
+              "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+              "start": 2291,
+              "end": 2483,
+              "quote": "We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-27536",
+              "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-27</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-27536",
+              "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+              "start": 2056,
+              "end": 2118,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-lcrp-70059.concept.mesh.d000075665",
-          "target_kind": "edge",
-          "target_sha256": "231b567079f61a2c7b73d4498e6588fb97c1db07cbd428db00364209f7618b45",
+          "id": "assertion.claim.frontier.arxiv-2608-26093",
+          "target_kind": "node",
+          "target_sha256": "bc56588a8d495fccbfa72e7ed6c6a57dbf51cf4fec8551bf0607c7e60c3556bb",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-lcrp-70059",
-            "target": "concept.mesh.d000075665",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"",
+            "id": "claim.frontier.arxiv-2608-26093",
+            "label": "Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-lcrp-70059",
-                "url": "https://api.crossref.org/works/10.1111/lcrp.70059"
+                "id": "source.frontier.arxiv-2608-26093",
+                "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.26093",
+                "title": "arXiv:2608.26093",
+                "url": "https://arxiv.org/abs/2608.26093"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-26",
+              "source_ids": [
+                "source.frontier.arxiv-2608-26093"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/lcrp.70059 names Recidivism: \"Any peer‐reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post‐release outcomes or recidivism.\"",
+          "statement": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"",
           "scope": {
-            "population": "doi:10.1111/lcrp.70059 abstract",
-            "time": "2026-09-04",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.26093",
+            "time": "2026-08-26",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-lcrp-70059",
-              "source_sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
-              "start": 1688,
-              "end": 1885,
-              "quote": "Any peer\\u2010reviewed studies written in English were eligible for inclusion if they analysed the relationship between victimization exposure in prison on post\\u2010release outcomes or recidivism."
+              "source_id": "source.frontier.arxiv-2608-26093",
+              "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+              "start": 2385,
+              "end": 2481,
+              "quote": "We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-26093",
+              "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+              "start": 1128,
+              "end": 1157,
+              "quote": "<created>2026-08-26</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-26093",
+              "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+              "start": 2121,
+              "end": 2183,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77938.field.mesh.d000076227",
-          "target_kind": "edge",
-          "target_sha256": "200b9ee34ecb381723b605c58b00384ee717d8a3928d9b387757a5b0ff9ee0e7",
+          "id": "assertion.claim.frontier.arxiv-2608-24219",
+          "target_kind": "node",
+          "target_sha256": "822853ae1bd10336e56f0bb36069f737aea135aaf8f7ec4f5bfb5cfab0bb7ed4",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-adfm-77938",
-            "target": "field.mesh.d000076227",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"",
+            "id": "claim.frontier.arxiv-2608-24219",
+            "label": "Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-adfm-77938",
-                "url": "https://api.crossref.org/works/10.1002/adfm.77938"
+                "id": "source.frontier.arxiv-2608-24219",
+                "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.24219",
+                "title": "arXiv:2608.24219",
+                "url": "https://arxiv.org/abs/2608.24219"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-25",
+              "source_ids": [
+                "source.frontier.arxiv-2608-24219"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/adfm.77938 names Stereolithography: \"Stereolithography‐printed elastomeric lattices validate these predictions: quasi‐static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability–especially for off‐center loading in multi‐objective designs.\"",
+          "statement": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"",
           "scope": {
-            "population": "doi:10.1002/adfm.77938 abstract",
-            "time": "2026-09-04",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.24219",
+            "time": "2026-08-25",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-adfm-77938",
-              "source_sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
-              "start": 3461,
-              "end": 3835,
-              "quote": "Stereolithography\\u2010printed elastomeric lattices validate these predictions: quasi\\u2010static pressure mapping reveals suppressed force hotspots and enlarged contact areas, while instrumented impact tests show earlier, more spatially distributed deformation and markedly improved repeatability\\u2013especially for off\\u2010center loading in multi\\u2010objective designs."
+              "source_id": "source.frontier.arxiv-2608-24219",
+              "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+              "start": 2450,
+              "end": 2538,
+              "quote": "We also find that attractive faces are more prototypical in both shape and latent space."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-24219",
+              "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+              "start": 1006,
+              "end": 1035,
+              "quote": "<created>2026-08-25</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-24219",
+              "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+              "start": 1675,
+              "end": 1737,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e185197.concept.mesh.d000070586",
-          "target_kind": "edge",
-          "target_sha256": "2b7b1d9a0b8511ba28c5e86eec55cbef346a3051e2bdd6e2319bfedb3f633924",
+          "id": "assertion.claim.frontier.arxiv-2608-23972",
+          "target_kind": "node",
+          "target_sha256": "2f4e8209d8fab0d2f13b2da9f1793dd68549b9ff6995792b8c8d9926e2d25ad2",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-brics-econ-7-e185197",
-            "target": "concept.mesh.d000070586",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"",
+            "id": "claim.frontier.arxiv-2608-23972",
+            "label": "Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197"
+                "id": "source.frontier.arxiv-2608-23972",
+                "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.23972",
+                "title": "arXiv:2608.23972",
+                "url": "https://arxiv.org/abs/2608.23972"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-25",
+              "source_ids": [
+                "source.frontier.arxiv-2608-23972"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e185197 names Fiscal Policy: \"DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state.\"",
+          "statement": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"",
           "scope": {
-            "population": "doi:10.3897/brics-econ.7.e185197 abstract",
-            "time": "2026-09-03",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.23972",
+            "time": "2026-08-25",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
-              "source_sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
-              "start": 1489,
-              "end": 1926,
-              "quote": "DSGE estimation was based on 26 years of historical data (January 1, 2000-December 31, 2025), and the impulse-response functions were simulated with horizon of twenty quarters (five years), which is compatible with canonical frequencies of business cycles taking into cognizance the transmission lags that accompany monetary and fiscal policy interventions required for the confirmation of the DSGE model convergence to the steady state."
+              "source_id": "source.frontier.arxiv-2608-23972",
+              "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+              "start": 3189,
+              "end": 3405,
+              "quote": "We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-23972",
+              "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-25</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-23972",
+              "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+              "start": 2388,
+              "end": 2450,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125327.concept.usgs.1298",
-          "target_kind": "edge",
-          "target_sha256": "b06ccf5046b58d08eb505ad83799a71b4e588de6b7f7ed902815593003f9e1d7",
+          "id": "assertion.claim.frontier.arxiv-2608-21764",
+          "target_kind": "node",
+          "target_sha256": "bbca19c1f8cb4c2b7006f9ca2cea484fefedad6b5e602ae8830f9741e4e3e7de",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl125327",
-            "target": "concept.usgs.1298",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"",
+            "id": "claim.frontier.arxiv-2608-21764",
+            "label": "LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl125327",
-                "url": "https://api.crossref.org/works/10.1029/2026gl125327"
+                "id": "source.frontier.arxiv-2608-21764",
+                "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.21764",
+                "title": "arXiv:2608.21764",
+                "url": "https://arxiv.org/abs/2608.21764"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-22",
+              "source_ids": [
+                "source.frontier.arxiv-2608-21764"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl125327 names Water chemistry: \"Long‐term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring.\"",
+          "statement": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl125327 abstract",
-            "time": "2026-09-03",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.21764",
+            "time": "2026-08-22",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl125327",
-              "source_sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
-              "start": 2076,
-              "end": 2206,
-              "quote": "Long\\u2010term stream water chemistry samples have been collected in Crescent Stream as part of the MCM LTER ecosystem monitoring."
+              "source_id": "source.frontier.arxiv-2608-21764",
+              "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+              "start": 3898,
+              "end": 4113,
+              "quote": "These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-21764",
+              "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-22</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-21764",
+              "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+              "start": 2259,
+              "end": 2321,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70302.field.climatology",
-          "target_kind": "edge",
-          "target_sha256": "a7984b13c49b2720e75906b24aca9cd5236ef51eef4b72d9d898fe4664bc18da",
+          "id": "assertion.claim.frontier.arxiv-2608-21020",
+          "target_kind": "node",
+          "target_sha256": "4a98426444f281136895acd6e36e2811a1b5fd9b30e99d03b0fd39e10f09efc3",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-qj-70302",
-            "target": "field.climatology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"",
+            "id": "claim.frontier.arxiv-2608-21020",
+            "label": "Frequency-Selective Pinching-Antenna Systems",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-qj-70302",
-                "url": "https://api.crossref.org/works/10.1002/qj.70302"
+                "id": "source.frontier.arxiv-2608-21020",
+                "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.21020",
+                "title": "arXiv:2608.21020",
+                "url": "https://arxiv.org/abs/2608.21020"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-21",
+              "source_ids": [
+                "source.frontier.arxiv-2608-21020"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/qj.70302 names Climatology: \"For each case, ensemble experiments were performed with either the zonal‐mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology.\"",
+          "statement": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"",
           "scope": {
-            "population": "doi:10.1002/qj.70302 abstract",
-            "time": "2026-09-03",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.21020",
+            "time": "2026-08-21",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-qj-70302",
-              "source_sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
-              "start": 1612,
-              "end": 1784,
-              "quote": "For each case, ensemble experiments were performed with either the zonal\\u2010mean stratosphere or the tropical belt relaxed towards ERA5 reanalysis or towards climatology."
+              "source_id": "source.frontier.arxiv-2608-21020",
+              "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+              "start": 2574,
+              "end": 2699,
+              "quote": "For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-21020",
+              "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-08-21</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-21020",
+              "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+              "start": 1841,
+              "end": 1903,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000930.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "b6e8c4e2418f570563e5aaf59e8d186332c205a5a598755206cf693c45639c54",
+          "id": "assertion.claim.frontier.arxiv-2608-20723",
+          "target_kind": "node",
+          "target_sha256": "21b5d82da39fbfd3204bb12044e33b8beab6817bfdb1dadb65fe180b87d13fff",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000930",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"",
+            "id": "claim.frontier.arxiv-2608-20723",
+            "label": "Conscious Access as Continuous-to-Discrete Translation",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000930",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930"
+                "id": "source.frontier.arxiv-2608-20723",
+                "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.20723",
+                "title": "arXiv:2608.20723",
+                "url": "https://arxiv.org/abs/2608.20723"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-21",
+              "source_ids": [
+                "source.frontier.arxiv-2608-20723"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000930 names Climate change: \"Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility.\"",
+          "statement": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0000930 abstract",
-            "time": "2026-09-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.20723",
+            "time": "2026-08-21",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000930",
-              "source_sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
-              "start": 1526,
-              "end": 1763,
-              "quote": "Credibility perceptions were driven primarily by individual differences; greater acceptance of the scientific consensus, attention to climate change, prior familiarity with ChatGPT, and younger age predicted higher perceived credibility."
+              "source_id": "source.frontier.arxiv-2608-20723",
+              "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+              "start": 2440,
+              "end": 2726,
+              "quote": "By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-20723",
+              "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+              "start": 1006,
+              "end": 1035,
+              "quote": "<created>2026-08-21</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-20723",
+              "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+              "start": 1408,
+              "end": 1470,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1098-rsnr-2026-0030.concept.aat.300016617",
-          "target_kind": "edge",
-          "target_sha256": "61c92fb7e36e4fcf77c3e1e95b86877ff96e61f23873104b32f1bc476cbd7860",
+          "id": "assertion.claim.frontier.arxiv-2608-19416",
+          "target_kind": "node",
+          "target_sha256": "d8889c499e52fd77720c142cb996ad430a20bddda827cc20d73b92099d872058",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1098-rsnr-2026-0030",
-            "target": "concept.aat.300016617",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"",
+            "id": "claim.frontier.arxiv-2608-19416",
+            "label": "Robust Near-Field Beam Focusing Under Imperfect Localization",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1098-rsnr-2026-0030",
-                "url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030"
+                "id": "source.frontier.arxiv-2608-19416",
+                "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.19416",
+                "title": "arXiv:2608.19416",
+                "url": "https://arxiv.org/abs/2608.19416"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-19",
+              "source_ids": [
+                "source.frontier.arxiv-2608-19416"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1098/rsnr.2026.0030 names The Americas: \"The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas.\"",
+          "statement": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"",
           "scope": {
-            "population": "doi:10.1098/rsnr.2026.0030 abstract",
-            "time": "2026-09-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.19416",
+            "time": "2026-08-19",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1098-rsnr-2026-0030",
-              "source_sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
-              "start": 1402,
-              "end": 1675,
-              "quote": "The presence of this book in an academic institution in Mexico City, a mere 24 years after its publication in Europe, changes our understanding of early microscopy by adding tangible material evidence and context to its global circulation and its reception in the Americas."
+              "source_id": "source.frontier.arxiv-2608-19416",
+              "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+              "start": 3100,
+              "end": 3331,
+              "quote": "Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-19416",
+              "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-08-19</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-19416",
+              "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+              "start": 1956,
+              "end": 2018,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70062.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "1c3d23c0da53c32744fc3fd75b0d0e1d29c8c737679bd2ac3cf864a1516fc9e0",
+          "id": "assertion.claim.frontier.arxiv-2608-18396",
+          "target_kind": "node",
+          "target_sha256": "4230aa909bd349a12725da9500e49d54790d908f75fe72e2e5a0d245a9b10ebc",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-cli2-70062",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"",
+            "id": "claim.frontier.arxiv-2608-18396",
+            "label": "LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-cli2-70062",
-                "url": "https://api.crossref.org/works/10.1002/cli2.70062"
+                "id": "source.frontier.arxiv-2608-18396",
+                "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.18396",
+                "title": "arXiv:2608.18396",
+                "url": "https://arxiv.org/abs/2608.18396"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-18",
+              "source_ids": [
+                "source.frontier.arxiv-2608-18396"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/cli2.70062 names Climate change: \"Despite having similar climatic niches, climate change can affect closely related tree species differently.\"",
+          "statement": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"",
           "scope": {
-            "population": "doi:10.1002/cli2.70062 abstract",
-            "time": "2026-09-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.18396",
+            "time": "2026-08-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-cli2-70062",
-              "source_sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
-              "start": 1183,
-              "end": 1290,
-              "quote": "Despite having similar climatic niches, climate change can affect closely related tree species differently."
+              "source_id": "source.frontier.arxiv-2608-18396",
+              "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+              "start": 3192,
+              "end": 3393,
+              "quote": "Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-18396",
+              "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-18</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-18396",
+              "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+              "start": 2222,
+              "end": 2284,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974.concept.eia.energy-consumption",
-          "target_kind": "edge",
-          "target_sha256": "f9680a16c3265fe3661dd70beac7a281228c8446333c66566a4b2cd88039fe20",
+          "id": "assertion.claim.frontier.arxiv-2608-18060",
+          "target_kind": "node",
+          "target_sha256": "2b63e910a14d93725ef45ef1b13b0eb28ca103821e3489d92cdf0d2d5d6047e5",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
-            "target": "concept.eia.energy-consumption",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"",
+            "id": "claim.frontier.arxiv-2608-18060",
+            "label": "Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
-                "url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974"
+                "id": "source.frontier.arxiv-2608-18060",
+                "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.18060",
+                "title": "arXiv:2608.18060",
+                "url": "https://arxiv.org/abs/2608.18060"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-18",
+              "source_ids": [
+                "source.frontier.arxiv-2608-18060"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.11591/ijeecs.v43.i3.pp965-974 names Energy consumption: \"Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations.\"",
+          "statement": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"",
           "scope": {
-            "population": "doi:10.11591/ijeecs.v43.i3.pp965-974 abstract",
-            "time": "2026-09-01",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.18060",
+            "time": "2026-08-18",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
-              "source_sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
-              "start": 1831,
-              "end": 1928,
-              "quote": "Notably, it also reduced energy consumption by 25% compared to conventional LSTM implementations."
+              "source_id": "source.frontier.arxiv-2608-18060",
+              "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+              "start": 2133,
+              "end": 2304,
+              "quote": "We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-18060",
+              "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-18</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-18060",
+              "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+              "start": 1891,
+              "end": 1953,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70852.concept.mesh.d000097815",
-          "target_kind": "edge",
-          "target_sha256": "10b0e59805ed315ba4892dba096f91d2499054928a8b125e546cd1d27b89a56b",
+          "id": "assertion.claim.frontier.arxiv-2608-16290",
+          "target_kind": "node",
+          "target_sha256": "4fe1ecbb34884d2d9f3c8e7b47b3c34d0385c84822822c2db70e7765b8387f76",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ejed-70852",
-            "target": "concept.mesh.d000097815",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"",
+            "id": "claim.frontier.arxiv-2608-16290",
+            "label": "Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ejed-70852",
-                "url": "https://api.crossref.org/works/10.1111/ejed.70852"
+                "id": "source.frontier.arxiv-2608-16290",
+                "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.16290",
+                "title": "arXiv:2608.16290",
+                "url": "https://arxiv.org/abs/2608.16290"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-17",
+              "source_ids": [
+                "source.frontier.arxiv-2608-16290"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ejed.70852 names Emotional Exhaustion: \"The results showed that job demands significantly predicted emotional exhaustion, but not work engagement.\"",
+          "statement": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"",
           "scope": {
-            "population": "doi:10.1111/ejed.70852 abstract",
-            "time": "2026-09-01",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.16290",
+            "time": "2026-08-17",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ejed-70852",
-              "source_sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
-              "start": 1643,
-              "end": 1749,
-              "quote": "The results showed that job demands significantly predicted emotional exhaustion, but not work engagement."
+              "source_id": "source.frontier.arxiv-2608-16290",
+              "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+              "start": 2394,
+              "end": 2576,
+              "quote": "For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA)."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-16290",
+              "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-08-17</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-16290",
+              "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+              "start": 1814,
+              "end": 1876,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70845.concept.mesh.d000223",
-          "target_kind": "edge",
-          "target_sha256": "03126797c3c1a67f99c6856b97fb361b2a048a21d8ffbd9f9faeeceafdce7e43",
+          "id": "assertion.claim.frontier.arxiv-2608-12037",
+          "target_kind": "node",
+          "target_sha256": "f9a5d11f4ca15ccecff427fcc92faa1557867617cf2a0098fac1982eb91b24c1",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ejed-70845",
-            "target": "concept.mesh.d000223",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"",
+            "id": "claim.frontier.arxiv-2608-12037",
+            "label": "Clustered Randomized Smoothing for Stochastic Prediction Functions",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ejed-70845",
-                "url": "https://api.crossref.org/works/10.1111/ejed.70845"
+                "id": "source.frontier.arxiv-2608-12037",
+                "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.12037",
+                "title": "arXiv:2608.12037",
+                "url": "https://arxiv.org/abs/2608.12037"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-12",
+              "source_ids": [
+                "source.frontier.arxiv-2608-12037"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ejed.70845 names Adaptation, Psychological: \"These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI‐supported language learning.\"",
+          "statement": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
           "scope": {
-            "population": "doi:10.1111/ejed.70845 abstract",
-            "time": "2026-09-01",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.12037",
+            "time": "2026-08-12",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ejed-70845",
-              "source_sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
-              "start": 2882,
-              "end": 3065,
-              "quote": "These findings highlight character strengths as key psychological resources that support both academic achievement and psychological adaptation in AI\\u2010supported language learning."
+              "source_id": "source.frontier.arxiv-2608-12037",
+              "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+              "start": 3116,
+              "end": 3333,
+              "quote": "By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12037",
+              "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-12</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12037",
+              "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+              "start": 2230,
+              "end": 2292,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
-        {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001039.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "f681f86b6cd6221c90f693200afd14c0ba7fb39129b8bd2f4f3e93a3cbff9617",
-          "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0001039",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"",
+        {
+          "id": "assertion.claim.frontier.arxiv-2608-11929",
+          "target_kind": "node",
+          "target_sha256": "88c54a9768888234ddab15fee435818a796534a6bc0452a14c336224d174f46f",
+          "canonical_record": {
+            "id": "claim.frontier.arxiv-2608-11929",
+            "label": "Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0001039",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039"
+                "id": "source.frontier.arxiv-2608-11929",
+                "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.11929",
+                "title": "arXiv:2608.11929",
+                "url": "https://arxiv.org/abs/2608.11929"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-12",
+              "source_ids": [
+                "source.frontier.arxiv-2608-11929"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0001039 names Climate change: \"Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact.\"",
+          "statement": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0001039 abstract",
-            "time": "2026-08-31",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.11929",
+            "time": "2026-08-12",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0001039",
-              "source_sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
-              "start": 1718,
-              "end": 1867,
-              "quote": "Energy, transport, and food sectors contribute substantially to climate change and are key areas where behaviour change can have the greatest impact."
+              "source_id": "source.frontier.arxiv-2608-11929",
+              "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+              "start": 2725,
+              "end": 2855,
+              "quote": "The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-11929",
+              "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-12</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-11929",
+              "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+              "start": 1738,
+              "end": 1800,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-nup-70114.field.aat.300054297",
-          "target_kind": "edge",
-          "target_sha256": "22afd973472db19dfb2940b071d91b713f91648c736039bd278d2034fe2172ea",
+          "id": "assertion.claim.frontier.arxiv-2608-11175",
+          "target_kind": "node",
+          "target_sha256": "61a3b6758674c089ff292933f056a52824662e5a8d2f8681f7488ce616290b83",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-nup-70114",
-            "target": "field.aat.300054297",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"",
+            "id": "claim.frontier.arxiv-2608-11175",
+            "label": "Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-nup-70114",
-                "url": "https://api.crossref.org/works/10.1111/nup.70114"
+                "id": "source.frontier.arxiv-2608-11175",
+                "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.11175",
+                "title": "arXiv:2608.11175",
+                "url": "https://arxiv.org/abs/2608.11175"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-11",
+              "source_ids": [
+                "source.frontier.arxiv-2608-11175"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/nup.70114 names phenomenology: \"Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff.\"",
+          "statement": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"",
           "scope": {
-            "population": "doi:10.1111/nup.70114 abstract",
-            "time": "2026-08-31",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.11175",
+            "time": "2026-08-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-nup-70114",
-              "source_sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
-              "start": 1344,
-              "end": 1515,
-              "quote": "Informed by critical medical anthropology and phenomenology, the study draws on participant observation, ethnographic fieldnotes, and interviews with intensive care staff."
+              "source_id": "source.frontier.arxiv-2608-11175",
+              "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+              "start": 2849,
+              "end": 3022,
+              "quote": "By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-11175",
+              "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-11</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-11175",
+              "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+              "start": 1868,
+              "end": 1930,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ejss-70414.concept.usgs.1731",
-          "target_kind": "edge",
-          "target_sha256": "1eca545df4306771858ce11a14f3eb6363adad118502b56871804206e712db6e",
+          "id": "assertion.claim.frontier.arxiv-2608-10825",
+          "target_kind": "node",
+          "target_sha256": "5b6cad2caad586b624a67aaccd674490521eda4a47b8857ffa06714a2eb1153f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ejss-70414",
-            "target": "concept.usgs.1731",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"",
+            "id": "claim.frontier.arxiv-2608-10825",
+            "label": "Cross-modal topology decodes battery faults from sparse voltage snapshots",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ejss-70414",
-                "url": "https://api.crossref.org/works/10.1111/ejss.70414"
+                "id": "source.frontier.arxiv-2608-10825",
+                "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.10825",
+                "title": "arXiv:2608.10825",
+                "url": "https://arxiv.org/abs/2608.10825"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-11",
+              "source_ids": [
+                "source.frontier.arxiv-2608-10825"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ejss.70414 names Carbon sequestration: \"These findings highlight that intensification, more than the organic‐versus‐conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil‐conservation practices.\"",
+          "statement": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"",
           "scope": {
-            "population": "doi:10.1111/ejss.70414 abstract",
-            "time": "2026-08-31",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.10825",
+            "time": "2026-08-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ejss-70414",
-              "source_sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
-              "start": 4335,
-              "end": 4706,
-              "quote": "These findings highlight that intensification, more than the organic\\u2010versus\\u2010conventional dichotomy, structures the multivariate variability of Mediterranean olive groves, and that current SOC stocks lie well below textural saturation in most systems, indicating substantial potential for additional carbon sequestration through soil\\u2010conservation practices."
+              "source_id": "source.frontier.arxiv-2608-10825",
+              "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+              "start": 2517,
+              "end": 2641,
+              "quote": "Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-10825",
+              "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-11</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-10825",
+              "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+              "start": 2069,
+              "end": 2131,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026wr044293.concept.usgs.1034",
-          "target_kind": "edge",
-          "target_sha256": "7994fd2f12baf505e42cdbc406a718fc5e558e261cb0f510c28c42af6ff37759",
+          "id": "assertion.claim.frontier.arxiv-2608-08151",
+          "target_kind": "node",
+          "target_sha256": "418f661b816ee96760c776caffdcaddbb0731fcad8c70c1726fd8506afc6d9eb",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026wr044293",
-            "target": "concept.usgs.1034",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"",
+            "id": "claim.frontier.arxiv-2608-08151",
+            "label": "Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026wr044293",
-                "url": "https://api.crossref.org/works/10.1029/2026wr044293"
+                "id": "source.frontier.arxiv-2608-08151",
+                "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.08151",
+                "title": "arXiv:2608.08151",
+                "url": "https://arxiv.org/abs/2608.08151"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-11",
+              "source_ids": [
+                "source.frontier.arxiv-2608-08151"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026wr044293 names Sediment transport: \"Here we show that the temporal variability of sediment transport results from switching between a finite set of recurrent morphological configurations.\"",
+          "statement": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"",
           "scope": {
-            "population": "doi:10.1029/2026wr044293 abstract",
-            "time": "2026-08-29",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.08151",
+            "time": "2026-08-11",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026wr044293",
-              "source_sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
-              "start": 1511,
-              "end": 1667,
-              "quote": "Here we show that the temporal variability of sediment transport results from switching\\u00a0between a finite set of recurrent morphological configurations."
+              "source_id": "source.frontier.arxiv-2608-08151",
+              "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+              "start": 3307,
+              "end": 3414,
+              "quote": "These results show that reference orbit geometry is an important part of defensive cislunar mission design."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-08151",
+              "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-11</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-08151",
+              "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+              "start": 2085,
+              "end": 2147,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-esp-70399.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "a655ebb19ba84e432978fcb5d5412e23b423e8765df90eacc1fae687523be229",
+          "id": "assertion.claim.frontier.arxiv-2608-10254",
+          "target_kind": "node",
+          "target_sha256": "e6111919699867aae8824c063308a9fdf7c5dcfff8b9e00b91f43edb777f17c2",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-esp-70399",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"",
+            "id": "claim.frontier.arxiv-2608-10254",
+            "label": "A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-esp-70399",
-                "url": "https://api.crossref.org/works/10.1002/esp.70399"
+                "id": "source.frontier.arxiv-2608-10254",
+                "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.10254",
+                "title": "arXiv:2608.10254",
+                "url": "https://arxiv.org/abs/2608.10254"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-10",
+              "source_ids": [
+                "source.frontier.arxiv-2608-10254"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/esp.70399 names Topography: \"We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co‐seismic damage.\"",
+          "statement": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"",
           "scope": {
-            "population": "doi:10.1002/esp.70399 abstract",
-            "time": "2026-08-27",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.10254",
+            "time": "2026-08-10",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-esp-70399",
-              "source_sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
-              "start": 1932,
-              "end": 2204,
-              "quote": "We demonstrate that topography, and especially steep slopes with topographic convexity, as well as preexisting damage of joint networks and faults inherited from tectonic and exhumation induced stresses, exert primary control on the location of new co\\u2010seismic damage."
+              "source_id": "source.frontier.arxiv-2608-10254",
+              "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+              "start": 3476,
+              "end": 3638,
+              "quote": "We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-10254",
+              "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-10</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-10254",
+              "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+              "start": 2084,
+              "end": 2146,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-jqs-70108.ology.sedimentology",
-          "target_kind": "edge",
-          "target_sha256": "368366ec2806e816d6adab901517f4ed74589e505b34452338f9a8943ec295b0",
+          "id": "assertion.claim.frontier.arxiv-2608-08599",
+          "target_kind": "node",
+          "target_sha256": "bbf18907cd43f8752bbfdc399422ce23594c15350b056f40983a7fc667f3e7b0",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-jqs-70108",
-            "target": "ology.sedimentology",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"",
+            "id": "claim.frontier.arxiv-2608-08599",
+            "label": "Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-jqs-70108",
-                "url": "https://api.crossref.org/works/10.1002/jqs.70108"
+                "id": "source.frontier.arxiv-2608-08599",
+                "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.08599",
+                "title": "arXiv:2608.08599",
+                "url": "https://arxiv.org/abs/2608.08599"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-09",
+              "source_ids": [
+                "source.frontier.arxiv-2608-08599"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/jqs.70108 names Sedimentology: \"However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow.\"",
+          "statement": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"",
           "scope": {
-            "population": "doi:10.1002/jqs.70108 abstract",
-            "time": "2026-08-26",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.08599",
+            "time": "2026-08-09",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-jqs-70108",
-              "source_sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
-              "start": 1278,
-              "end": 1474,
-              "quote": "However, detailed accounts of their sedimentology and structural assessments of surrounding rock slopes have been lacking, despite the insights into processes that such investigations would allow."
+              "source_id": "source.frontier.arxiv-2608-08599",
+              "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+              "start": 2857,
+              "end": 3044,
+              "quote": "Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-08599",
+              "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-08-09</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-08599",
+              "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+              "start": 1880,
+              "end": 1942,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jd046723.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "cf3ec6c8fde9a680a1c9df6dbeb94d56f5eb02b27c50428a2e6052129d499bfa",
+          "id": "assertion.claim.frontier.arxiv-2608-12398",
+          "target_kind": "node",
+          "target_sha256": "f702c66c52e59efcce94160d673b356d4692ff4cc2e87570e5a2864d7956fa1e",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026jd046723",
-            "target": "field.usgs.1176",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"",
+            "id": "claim.frontier.arxiv-2608-12398",
+            "label": "A Hierarchical Energy-Based Model for Multimodal Cognition",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026jd046723",
-                "url": "https://api.crossref.org/works/10.1029/2026jd046723"
+                "id": "source.frontier.arxiv-2608-12398",
+                "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.12398",
+                "title": "arXiv:2608.12398",
+                "url": "https://arxiv.org/abs/2608.12398"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-08",
+              "source_ids": [
+                "source.frontier.arxiv-2608-12398"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026jd046723 names Topography: \"In this study, we use IsoRSM, an isotope‐enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans.\"",
+          "statement": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
           "scope": {
-            "population": "doi:10.1029/2026jd046723 abstract",
-            "time": "2026-08-24",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.12398",
+            "time": "2026-08-08",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026jd046723",
-              "source_sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
-              "start": 2169,
-              "end": 2421,
-              "quote": "In this study, we use IsoRSM, an isotope\\u2010enabled regional spectral model, to improve the simulation of precipitation and its isotopic composition over tropical Costa Rica, which is marked by a pronounced topography and is surrounded by two oceans."
+              "source_id": "source.frontier.arxiv-2608-12398",
+              "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+              "start": 2620,
+              "end": 3064,
+              "quote": "We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12398",
+              "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+              "start": 1006,
+              "end": 1035,
+              "quote": "<created>2026-08-08</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12398",
+              "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+              "start": 1503,
+              "end": 1565,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-msd2-70089.concept.eia.electric-energy",
-          "target_kind": "edge",
-          "target_sha256": "2b2d57db3262660a239464992d41469e50f9d4a51ced95584e5b2359608fb7a0",
+          "id": "assertion.claim.frontier.arxiv-2608-07289",
+          "target_kind": "node",
+          "target_sha256": "1fbadbe0683aaa090614e2b25ef1e6624b9ce0d9cc932895cff294653261dc43",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-msd2-70089",
-            "target": "concept.eia.electric-energy",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"",
+            "id": "claim.frontier.arxiv-2608-07289",
+            "label": "Synthesizing Voltage Ride-Through Controllers for Data Centers",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-msd2-70089",
-                "url": "https://api.crossref.org/works/10.1002/msd2.70089"
+                "id": "source.frontier.arxiv-2608-07289",
+                "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.07289",
+                "title": "arXiv:2608.07289",
+                "url": "https://arxiv.org/abs/2608.07289"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-07",
+              "source_ids": [
+                "source.frontier.arxiv-2608-07289"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/msd2.70089 names Electric energy: \"The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy.\"",
+          "statement": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"",
           "scope": {
-            "population": "doi:10.1002/msd2.70089 abstract",
-            "time": "2026-08-24",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.07289",
+            "time": "2026-08-07",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-msd2-70089",
-              "source_sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
-              "start": 2827,
-              "end": 2996,
-              "quote": "The results indicate that the theory of composite synchronization transmission can realize the energy transfer by the vibrating system so as to save the electric energy."
+              "source_id": "source.frontier.arxiv-2608-07289",
+              "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+              "start": 4289,
+              "end": 4481,
+              "quote": "The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-07289",
+              "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-08-07</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-07289",
+              "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+              "start": 2465,
+              "end": 2527,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70342.field.aat.300054263",
-          "target_kind": "edge",
-          "target_sha256": "55f33142020fbac13bf21380c4374403266f46cdb0aab9affeb012936f057fdf",
+          "id": "assertion.claim.frontier.arxiv-2608-05481",
+          "target_kind": "node",
+          "target_sha256": "c9a402016800f9b54db71f8fb34ca5a81251c460b4ed4c9f832e334bc1c7027a",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ijal-70342",
-            "target": "field.aat.300054263",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"",
+            "id": "claim.frontier.arxiv-2608-05481",
+            "label": "From Local Learning to Global Prediction Through Layered Surprise Cascades",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ijal-70342",
-                "url": "https://api.crossref.org/works/10.1111/ijal.70342"
+                "id": "source.frontier.arxiv-2608-05481",
+                "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.05481",
+                "title": "arXiv:2608.05481",
+                "url": "https://arxiv.org/abs/2608.05481"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-06",
+              "source_ids": [
+                "source.frontier.arxiv-2608-05481"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ijal.70342 names phonology: \"In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills‐focused language teaching.\"",
+          "statement": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
           "scope": {
-            "population": "doi:10.1111/ijal.70342 abstract",
-            "time": "2026-08-21",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.05481",
+            "time": "2026-08-06",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70342",
-              "source_sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
-              "start": 1276,
-              "end": 1534,
-              "quote": "In the context of our study, these courses are taught to language majors and involve explicit, analytically oriented instruction in language structure, including phonology, morphology, syntax, and semantics, rather than skills\\u2010focused language teaching."
+              "source_id": "source.frontier.arxiv-2608-05481",
+              "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+              "start": 2885,
+              "end": 3056,
+              "quote": "Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-05481",
+              "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+              "start": 966,
+              "end": 995,
+              "quote": "<created>2026-08-06</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-05481",
+              "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+              "start": 2009,
+              "end": 2071,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70059.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "57cc1c4163c135c16e71f548200b3335302641c2354d77550a2df7f6ccef875d",
+          "id": "assertion.claim.frontier.arxiv-2608-05348",
+          "target_kind": "node",
+          "target_sha256": "7fb323d587831f4c9c942c8de1ec0b5513ec729f3d747cd868de16aa413f6f15",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-cli2-70059",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"",
+            "id": "claim.frontier.arxiv-2608-05348",
+            "label": "TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-cli2-70059",
-                "url": "https://api.crossref.org/works/10.1002/cli2.70059"
+                "id": "source.frontier.arxiv-2608-05348",
+                "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.05348",
+                "title": "arXiv:2608.05348",
+                "url": "https://arxiv.org/abs/2608.05348"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-05",
+              "source_ids": [
+                "source.frontier.arxiv-2608-05348"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/cli2.70059 names Climate change: \"However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change.\"",
+          "statement": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"",
           "scope": {
-            "population": "doi:10.1002/cli2.70059 abstract",
-            "time": "2026-08-20",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.05348",
+            "time": "2026-08-05",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-cli2-70059",
-              "source_sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
-              "start": 2249,
-              "end": 2443,
-              "quote": "However, infrastructure model outputs are conditional on a range of uncertain assumptions about the system drivers and properties, both in the present day and in the future under climate change."
+              "source_id": "source.frontier.arxiv-2608-05348",
+              "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+              "start": 2721,
+              "end": 2796,
+              "quote": "In both cases, TSDM significantly outperforms existing scheduling policies."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-05348",
+              "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-05</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-05348",
+              "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+              "start": 1591,
+              "end": 1653,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124727.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "9de5826b34ea49d1e147a936fab8aef49e8b48caa1c8a00cb78e233ce1a0fc56",
+          "id": "assertion.claim.frontier.arxiv-2608-12393",
+          "target_kind": "node",
+          "target_sha256": "67d9855cccf7e4f46b446c253650ec227fdbfb9d85750e956c614588ac64ebfb",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124727",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"",
+            "id": "claim.frontier.arxiv-2608-12393",
+            "label": "Metacognitive Skill Learning: A Computational Account",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl124727",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124727"
+                "id": "source.frontier.arxiv-2608-12393",
+                "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.12393",
+                "title": "arXiv:2608.12393",
+                "url": "https://arxiv.org/abs/2608.12393"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-12393"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124727 names Climate change: \"The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood.\"",
+          "statement": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124727 abstract",
-            "time": "2026-08-19",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.12393",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124727",
-              "source_sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
-              "start": 955,
-              "end": 1141,
-              "quote": "The Arctic and Tibetan Plateau (TP) have experienced pronounced warming and shifts in precipitation patterns, yet vegetation responses to climate change remain insufficiently understood."
+              "source_id": "source.frontier.arxiv-2608-12393",
+              "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+              "start": 2361,
+              "end": 2556,
+              "quote": "The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12393",
+              "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+              "start": 966,
+              "end": 995,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-12393",
+              "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+              "start": 1499,
+              "end": 1561,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000877.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "870f675c090fecc7e40e9fccd64338d4b6573842ec02a43e9f858c6466da6b50",
+          "id": "assertion.claim.frontier.arxiv-2608-04227",
+          "target_kind": "node",
+          "target_sha256": "b23bb78dd5b45e70a53acecdd6d09f2bb9ec9afd212936fc0f602d06affb8e07",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000877",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"",
+            "id": "claim.frontier.arxiv-2608-04227",
+            "label": "Random features for Grassmannian kernel approximation with bounded rank-one projections",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000877",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877"
+                "id": "source.frontier.arxiv-2608-04227",
+                "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.04227",
+                "title": "arXiv:2608.04227",
+                "url": "https://arxiv.org/abs/2608.04227"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-04227"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000877 names Climate change: \"Consequently, climate change is affecting the global distribution of diseases such as dengue.\"",
+          "statement": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0000877 abstract",
-            "time": "2026-08-18",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.04227",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000877",
-              "source_sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
-              "start": 1810,
-              "end": 1903,
-              "quote": "Consequently, climate change is affecting the global distribution of diseases such as dengue."
+              "source_id": "source.frontier.arxiv-2608-04227",
+              "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+              "start": 2523,
+              "end": 2703,
+              "quote": "We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-04227",
+              "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-04227",
+              "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+              "start": 1754,
+              "end": 1816,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70054.concept.usgs.1145",
-          "target_kind": "edge",
-          "target_sha256": "57cfd1fa059479121dd39cd7015839cb60027f379c452d354347a277f5e2aa60",
+          "id": "assertion.claim.frontier.arxiv-2608-04133",
+          "target_kind": "node",
+          "target_sha256": "6bc0ecdfe554d2bede0800c6ab81b1503c9bf856154d8540a2454bd4edc0e51a",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-jmg-70054",
-            "target": "concept.usgs.1145",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"",
+            "id": "claim.frontier.arxiv-2608-04133",
+            "label": "Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-jmg-70054",
-                "url": "https://api.crossref.org/works/10.1111/jmg.70054"
+                "id": "source.frontier.arxiv-2608-04133",
+                "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.04133",
+                "title": "arXiv:2608.04133",
+                "url": "https://arxiv.org/abs/2608.04133"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-04133"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/jmg.70054 names Tectonic processes: \"Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction.\"",
+          "statement": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"",
           "scope": {
-            "population": "doi:10.1111/jmg.70054 abstract",
-            "time": "2026-08-18",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.04133",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-jmg-70054",
-              "source_sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
-              "start": 1079,
-              "end": 1217,
-              "quote": "Trace element compositions of detrital zircon have been widely applied to understanding tectonic processes and continental reconstruction."
+              "source_id": "source.frontier.arxiv-2608-04133",
+              "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+              "start": 2710,
+              "end": 2953,
+              "quote": "By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-04133",
+              "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+              "start": 1048,
+              "end": 1077,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-04133",
+              "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+              "start": 2285,
+              "end": 2347,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-moth-70134.concept.mesh.d006808",
-          "target_kind": "edge",
-          "target_sha256": "075acc6dce6372ce0982dde46c29bc22da33366fb665156513d28599fd15553f",
+          "id": "assertion.claim.frontier.arxiv-2608-03967",
+          "target_kind": "node",
+          "target_sha256": "bcb8b2bbdc627943ea3d1fd487e21f2b1b9fc41c5c5eb532aa10e78e6b85a376",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-moth-70134",
-            "target": "concept.mesh.d006808",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"",
+            "id": "claim.frontier.arxiv-2608-03967",
+            "label": "Information-Geometric Forward Policy Training in GFlowNets",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-moth-70134",
-                "url": "https://api.crossref.org/works/10.1111/moth.70134"
+                "id": "source.frontier.arxiv-2608-03967",
+                "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.03967",
+                "title": "arXiv:2608.03967",
+                "url": "https://arxiv.org/abs/2608.03967"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-03967"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/moth.70134 names Humanism: \"This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic.\"",
+          "statement": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"",
           "scope": {
-            "population": "doi:10.1111/moth.70134 abstract",
-            "time": "2026-08-17",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.03967",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-moth-70134",
-              "source_sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
-              "start": 879,
-              "end": 1011,
-              "quote": "This article explores Olaudah Equiano as a pivotal figure in the emergence of a Christian humanism forged within the Black Atlantic."
+              "source_id": "source.frontier.arxiv-2608-03967",
+              "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+              "start": 2055,
+              "end": 2389,
+              "quote": "Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-03967",
+              "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-03967",
+              "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+              "start": 1613,
+              "end": 1675,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-gwat-70098.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "e069a6616981d994426c6cf255049159f38fbc7fb32af0e735a313d686d7d3eb",
+          "id": "assertion.claim.frontier.arxiv-2608-02978",
+          "target_kind": "node",
+          "target_sha256": "c7d8752a652edf07a25e8b05fbbc1a79f33691ddb4a36f189b5ac9a3bb13ec41",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-gwat-70098",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"",
+            "id": "claim.frontier.arxiv-2608-02978",
+            "label": "Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-gwat-70098",
-                "url": "https://api.crossref.org/works/10.1111/gwat.70098"
+                "id": "source.frontier.arxiv-2608-02978",
+                "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.02978",
+                "title": "arXiv:2608.02978",
+                "url": "https://arxiv.org/abs/2608.02978"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-02978"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/gwat.70098 names Climate change: \"Climate change and human activities increasingly affect interconnected stream–aquifer systems, motivating continued evaluation of how stream–aquifer interactions are represented in integrated groundwater–surface water models.\"",
+          "statement": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"",
           "scope": {
-            "population": "doi:10.1111/gwat.70098 abstract",
-            "time": "2026-08-15",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.02978",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-gwat-70098",
-              "source_sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
-              "start": 1704,
-              "end": 1944,
-              "quote": "Climate change and human activities increasingly affect interconnected stream\\u2013aquifer systems, motivating continued evaluation of how stream\\u2013aquifer interactions are represented in integrated groundwater\\u2013surface water models."
+              "source_id": "source.frontier.arxiv-2608-02978",
+              "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+              "start": 2628,
+              "end": 2826,
+              "quote": "Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02978",
+              "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02978",
+              "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+              "start": 1607,
+              "end": 1669,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wp-2026-018.concept.usgs.1308",
-          "target_kind": "edge",
-          "target_sha256": "21cb010041d462fd8fd5a29ba22d12438e29a03acf349d17c27367374c61c33e",
+          "id": "assertion.claim.frontier.arxiv-2608-02976",
+          "target_kind": "node",
+          "target_sha256": "e0208edca4e1ed4f60e4c5b38ac6d2cd08b8361bf4f4752b24f2cf751c3ff74f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wp-2026-018",
-            "target": "concept.usgs.1308",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"",
+            "id": "claim.frontier.arxiv-2608-02976",
+            "label": "Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wp-2026-018",
-                "url": "https://api.crossref.org/works/10.2166/wp.2026.018"
+                "id": "source.frontier.arxiv-2608-02976",
+                "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.02976",
+                "title": "arXiv:2608.02976",
+                "url": "https://arxiv.org/abs/2608.02976"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-04",
+              "source_ids": [
+                "source.frontier.arxiv-2608-02976"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.2166/wp.2026.018 names Water resources: \"With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge.\"",
+          "statement": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"",
           "scope": {
-            "population": "doi:10.2166/wp.2026.018 abstract",
-            "time": "2026-08-14",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.02976",
+            "time": "2026-08-04",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wp-2026-018",
-              "source_sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
-              "start": 2949,
-              "end": 3144,
-              "quote": "With the expansion of coal and other related water-intensive industries in the arid region of Northwest China, the region's already fragile water resources system faces an even greater challenge."
+              "source_id": "source.frontier.arxiv-2608-02976",
+              "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+              "start": 3184,
+              "end": 3372,
+              "quote": "The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02976",
+              "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-08-04</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02976",
+              "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+              "start": 1756,
+              "end": 1818,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0107.field.aat.300389758",
-          "target_kind": "edge",
-          "target_sha256": "cd0285dcd8d84ff3276063eb5231555bcb63bb6b40baa8da1dd7bc5e379bb852",
+          "id": "assertion.claim.frontier.arxiv-2608-02244",
+          "target_kind": "node",
+          "target_sha256": "743c5add749989b4464633c90f8aa6a9adf0fc57455492446d7ccec1d222118f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1098-rsta-2025-0107",
-            "target": "field.aat.300389758",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"",
+            "id": "claim.frontier.arxiv-2608-02244",
+            "label": "Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1098-rsta-2025-0107",
-                "url": "https://api.crossref.org/works/10.1098/rsta.2025.0107"
+                "id": "source.frontier.arxiv-2608-02244",
+                "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.02244",
+                "title": "arXiv:2608.02244",
+                "url": "https://arxiv.org/abs/2608.02244"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-03",
+              "source_ids": [
+                "source.frontier.arxiv-2608-02244"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1098/rsta.2025.0107 names cryptography: \"These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics.\"",
+          "statement": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
           "scope": {
-            "population": "doi:10.1098/rsta.2025.0107 abstract",
-            "time": "2026-08-13",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.02244",
+            "time": "2026-08-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1098-rsta-2025-0107",
-              "source_sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
-              "start": 1569,
-              "end": 1891,
-              "quote": "These results demonstrate that geometric algebra (GA) provides unique advantages for both cryptographic constructions (enabling structure-preserving encryption) and machine learning (ML) (enabling privacy-preserving geometric learning), opening new pathways at the intersection of cryptography, ML and applied mathematics."
+              "source_id": "source.frontier.arxiv-2608-02244",
+              "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+              "start": 2593,
+              "end": 2669,
+              "quote": "We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02244",
+              "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-03</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02244",
+              "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+              "start": 1621,
+              "end": 1683,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000931.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "3b93367f56a100af9711d79cf0398ec0b1defd995eea2751cd18d8eaf7c88da2",
+          "id": "assertion.claim.frontier.arxiv-2608-02079",
+          "target_kind": "node",
+          "target_sha256": "e5edce4b2315fc743cc869cec2fcf60f4f81e4a54521ae777cd88be9a6cffbf7",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000931",
-            "target": "concept.usgs.168",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"",
+            "id": "claim.frontier.arxiv-2608-02079",
+            "label": "TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000931",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931"
+                "id": "source.frontier.arxiv-2608-02079",
+                "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.02079",
+                "title": "arXiv:2608.02079",
+                "url": "https://arxiv.org/abs/2608.02079"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-03",
+              "source_ids": [
+                "source.frontier.arxiv-2608-02079"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000931 names Climate change: \"The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation.\"",
+          "statement": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0000931 abstract",
-            "time": "2026-08-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.02079",
+            "time": "2026-08-03",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000931",
-              "source_sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
-              "start": 921,
-              "end": 1055,
-              "quote": "The environmental challenges faced by many tree species as a result of climate change show substantial spatial and temporal variation."
+              "source_id": "source.frontier.arxiv-2608-02079",
+              "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+              "start": 3323,
+              "end": 3557,
+              "quote": "The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02079",
+              "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-08-03</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-02079",
+              "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+              "start": 2115,
+              "end": 2177,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122646.concept.usgs.819",
-          "target_kind": "edge",
-          "target_sha256": "d80b59feca9f2643c8127f2af6f4e59ea53f61c45477eda27131b05289272f7a",
+          "id": "assertion.claim.frontier.arxiv-2608-01220",
+          "target_kind": "node",
+          "target_sha256": "08d4f16884ff34ab2eb12519ccb18c619e1ba2fe06807158df2e88270c1f2f55",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122646",
-            "target": "concept.usgs.819",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"",
+            "id": "claim.frontier.arxiv-2608-01220",
+            "label": "Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122646",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122646"
+                "id": "source.frontier.arxiv-2608-01220",
+                "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.01220",
+                "title": "arXiv:2608.01220",
+                "url": "https://arxiv.org/abs/2608.01220"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-02",
+              "source_ids": [
+                "source.frontier.arxiv-2608-01220"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122646 names Ocean temperature: \"Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby.\"",
+          "statement": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122646 abstract",
-            "time": "2026-08-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.01220",
+            "time": "2026-08-02",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122646",
-              "source_sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
-              "start": 1059,
-              "end": 1270,
-              "quote": "Considering observed coastal ocean warming and increased coastal marine heatwave (MHW) activity, we seek to uncover if, how, and where coastal ocean temperatures are linked with heat and humidity on land nearby."
+              "source_id": "source.frontier.arxiv-2608-01220",
+              "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+              "start": 3591,
+              "end": 3720,
+              "quote": "Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-01220",
+              "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+              "start": 1132,
+              "end": 1161,
+              "quote": "<created>2026-08-02</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-01220",
+              "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+              "start": 2284,
+              "end": 2346,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70058.concept.usgs.2027",
-          "target_kind": "edge",
-          "target_sha256": "26faf98e1617c498f14fcaf1a9f99fc2e0ea0afc0cefdb2d687940945652e28a",
+          "id": "assertion.claim.frontier.arxiv-2608-00959",
+          "target_kind": "node",
+          "target_sha256": "cc8190458a87f0e09885708954ef5b3680081f57bbec918a8304c0c9ee54184b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ppp-70058",
-            "target": "concept.usgs.2027",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"",
+            "id": "claim.frontier.arxiv-2608-00959",
+            "label": "MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ppp-70058",
-                "url": "https://api.crossref.org/works/10.1002/ppp.70058"
+                "id": "source.frontier.arxiv-2608-00959",
+                "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2608.00959",
+                "title": "arXiv:2608.00959",
+                "url": "https://arxiv.org/abs/2608.00959"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-08-02",
+              "source_ids": [
+                "source.frontier.arxiv-2608-00959"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/ppp.70058 names Soil moisture: \"We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10‐min interval for nearly 2 years.\"",
+          "statement": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"",
           "scope": {
-            "population": "doi:10.1002/ppp.70058 abstract",
-            "time": "2026-08-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2608.00959",
+            "time": "2026-08-02",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ppp-70058",
-              "source_sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
-              "start": 2020,
-              "end": 2246,
-              "quote": "We mapped geomorphic and vegetation properties of 40 solifluction lobes in the Turtmann Valley, Swiss Alps, and recorded soil moisture and temperature with a TOMST TMS4 logger at a 10\\u2010min interval for nearly 2\\u2009years."
+              "source_id": "source.frontier.arxiv-2608-00959",
+              "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+              "start": 2679,
+              "end": 2971,
+              "quote": "A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-00959",
+              "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-08-02</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2608-00959",
+              "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+              "start": 1568,
+              "end": 1630,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70107.ology.mineralogy",
-          "target_kind": "edge",
-          "target_sha256": "eabf986a68eb7d042c78f083bb3201adedef5dfacea5beb82db6f9b133aa38a1",
+          "id": "assertion.claim.frontier.arxiv-2607-17248",
+          "target_kind": "node",
+          "target_sha256": "1fdd859155a6a88a26146ead48d0b0144682e4825cf11c0b2bbee433a92a3008",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-jpln-70107",
-            "target": "ology.mineralogy",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"",
+            "id": "claim.frontier.arxiv-2607-17248",
+            "label": "Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-jpln-70107",
-                "url": "https://api.crossref.org/works/10.1002/jpln.70107"
+                "id": "source.frontier.arxiv-2607-17248",
+                "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.17248",
+                "title": "arXiv:2607.17248",
+                "url": "https://arxiv.org/abs/2607.17248"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-31",
+              "source_ids": [
+                "source.frontier.arxiv-2607-17248"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/jpln.70107 names Mineralogy: \"This research underscores the need for site‐specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy.\"",
+          "statement": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"",
           "scope": {
-            "population": "doi:10.1002/jpln.70107 abstract",
-            "time": "2026-08-12",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.17248",
+            "time": "2026-07-31",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-jpln-70107",
-              "source_sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
-              "start": 3513,
-              "end": 3692,
-              "quote": "This research underscores the need for site\\u2010specific recommendations for rock dust application, considering the complex interplay between soil properties and rock mineralogy."
+              "source_id": "source.frontier.arxiv-2607-17248",
+              "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+              "start": 3687,
+              "end": 3897,
+              "quote": "The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-17248",
+              "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-07-31</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-17248",
+              "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+              "start": 2208,
+              "end": 2270,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-187529.field.mesh.d019021",
-          "target_kind": "edge",
-          "target_sha256": "c59f73ce630e6023ef9ab5c5df42b1f18da0655a68f6e1c2387696ebe2ffd123",
+          "id": "assertion.claim.frontier.arxiv-2607-14144",
+          "target_kind": "node",
+          "target_sha256": "ec328db9ea9fa05f78e82e06ffa78077eea48cf02291ed634c20ee162f41cd4f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-nhcm-3-187529",
-            "target": "field.mesh.d019021",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"",
+            "id": "claim.frontier.arxiv-2607-14144",
+            "label": "The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-nhcm-3-187529",
-                "url": "https://api.crossref.org/works/10.3897/nhcm.3.187529"
+                "id": "source.frontier.arxiv-2607-14144",
+                "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.14144",
+                "title": "arXiv:2607.14144",
+                "url": "https://arxiv.org/abs/2607.14144"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-31",
+              "source_ids": [
+                "source.frontier.arxiv-2607-14144"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.3897/nhcm.3.187529 names Natural History: \"Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research.\"",
+          "statement": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
           "scope": {
-            "population": "doi:10.3897/nhcm.3.187529 abstract",
-            "time": "2026-08-10",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.14144",
+            "time": "2026-07-31",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-187529",
-              "source_sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
-              "start": 583,
-              "end": 717,
-              "quote": "Natural history museums worldwide curate millions of preserved specimens and provide a vast untapped resource for scientific research."
+              "source_id": "source.frontier.arxiv-2607-14144",
+              "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+              "start": 3465,
+              "end": 3703,
+              "quote": "We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-14144",
+              "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+              "start": 1044,
+              "end": 1073,
+              "quote": "<created>2026-07-31</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-14144",
+              "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+              "start": 2387,
+              "end": 2449,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026775.field.aat.300054255",
-          "target_kind": "edge",
-          "target_sha256": "89c395e3b5b43e2d74d942f5b61fe00955134a024cd35b14e745aecb7820da25",
+          "id": "assertion.claim.frontier.arxiv-2607-28833",
+          "target_kind": "node",
+          "target_sha256": "2f1fc64b249d57aed7c4731d7d0f33bcf58db73a2d62c06759ae838acca89ccf",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-ehass-2026775",
-            "target": "field.aat.300054255",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"",
+            "id": "claim.frontier.arxiv-2607-28833",
+            "label": "Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-38159-ehass-2026775",
-                "url": "https://api.crossref.org/works/10.38159/ehass.2026775"
+                "id": "source.frontier.arxiv-2607-28833",
+                "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.28833",
+                "title": "arXiv:2607.28833",
+                "url": "https://arxiv.org/abs/2607.28833"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-30",
+              "source_ids": [
+                "source.frontier.arxiv-2607-28833"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.38159/ehass.2026775 names sociolinguistics: \"The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshivenḓa-speaking communities.\"",
+          "statement": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"",
           "scope": {
-            "population": "doi:10.38159/ehass.2026775 abstract",
-            "time": "2026-08-10",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.28833",
+            "time": "2026-07-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-38159-ehass-2026775",
-              "source_sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
-              "start": 2160,
-              "end": 2429,
-              "quote": "The study contributes to scholarship on African oral literature, sociolinguistics, and cultural studies by demonstrating how parody functions as both a linguistic strategy and a means of negotiating cultural identity in contemporary Tshiven\\u1e13a-speaking communities."
+              "source_id": "source.frontier.arxiv-2607-28833",
+              "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+              "start": 2903,
+              "end": 3066,
+              "quote": "We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28833",
+              "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+              "start": 1004,
+              "end": 1033,
+              "quote": "<created>2026-07-30</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28833",
+              "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+              "start": 2094,
+              "end": 2156,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026774.concept.aat.300262706",
-          "target_kind": "edge",
-          "target_sha256": "e375c52d50d9a3d5c3274cdbeaabe4fc90ce29c2e3d24f57c17e75331a69314f",
+          "id": "assertion.claim.frontier.arxiv-2607-28780",
+          "target_kind": "node",
+          "target_sha256": "f1b29633f5a9da54579e1b85dd2d21ca4f70cb73d2eb8aab5d92ae9010191d47",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-38159-ehass-2026774",
-            "target": "concept.aat.300262706",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"",
+            "id": "claim.frontier.arxiv-2607-28780",
+            "label": "Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-38159-ehass-2026774",
-                "url": "https://api.crossref.org/works/10.38159/ehass.2026774"
+                "id": "source.frontier.arxiv-2607-28780",
+                "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.28780",
+                "title": "arXiv:2607.28780",
+                "url": "https://arxiv.org/abs/2607.28780"
+              },
+              {
+                "id": "doi:10.1002/mar.70105",
+                "title": "doi:10.1002/mar.70105",
+                "url": "https://doi.org/10.1002/mar.70105"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-30",
+              "source_ids": [
+                "source.frontier.arxiv-2607-28780"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.38159/ehass.2026774 names South African: \"This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities.\"",
+          "statement": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"",
           "scope": {
-            "population": "doi:10.38159/ehass.2026774 abstract",
-            "time": "2026-08-10",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.28780",
+            "time": "2026-07-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-38159-ehass-2026774",
-              "source_sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
-              "start": 757,
-              "end": 928,
-              "quote": "This narrative literature review explores how cultural worldviews influence the uptake, provision, and acceptance of palliative care services in South African communities."
+              "source_id": "source.frontier.arxiv-2607-28780",
+              "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+              "start": 3025,
+              "end": 3206,
+              "quote": "We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28780",
+              "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+              "start": 1090,
+              "end": 1119,
+              "quote": "<created>2026-07-30</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28780",
+              "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+              "start": 1880,
+              "end": 1942,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-hec-70140.concept.mesh.d006304",
-          "target_kind": "edge",
-          "target_sha256": "4d0e2faad6ec1db51c9ecabb0cb38dec9a15d81fd0a8a7acc6eb68bbecedd82e",
+          "id": "assertion.claim.frontier.arxiv-2607-28276",
+          "target_kind": "node",
+          "target_sha256": "e438ccf59a58e083b4cde740d8989d36e9ddbfe612bf00269fc14b9c764e9108",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-hec-70140",
-            "target": "concept.mesh.d006304",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"",
+            "id": "claim.frontier.arxiv-2607-28276",
+            "label": "Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-hec-70140",
-                "url": "https://api.crossref.org/works/10.1002/hec.70140"
+                "id": "source.frontier.arxiv-2607-28276",
+                "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.28276",
+                "title": "arXiv:2607.28276",
+                "url": "https://arxiv.org/abs/2607.28276"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-30",
+              "source_ids": [
+                "source.frontier.arxiv-2607-28276"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/hec.70140 names Health Status: \"One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status.\"",
+          "statement": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"",
           "scope": {
-            "population": "doi:10.1002/hec.70140 abstract",
-            "time": "2026-08-08",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.28276",
+            "time": "2026-07-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-hec-70140",
-              "source_sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
-              "start": 1337,
-              "end": 1477,
-              "quote": "One policy to reduce the impact of waiting times on patients' health is for doctors to prioritise patients according to their health status."
+              "source_id": "source.frontier.arxiv-2607-28276",
+              "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+              "start": 3122,
+              "end": 3360,
+              "quote": "When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28276",
+              "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+              "start": 1132,
+              "end": 1161,
+              "quote": "<created>2026-07-30</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28276",
+              "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+              "start": 1859,
+              "end": 1921,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-tox-70177.concept.usgs.435",
-          "target_kind": "edge",
-          "target_sha256": "03f2d69fe3e86e3e32863029e02de5defd5de61377f858dadb9bdae3efc50ac8",
+          "id": "assertion.claim.frontier.arxiv-2607-28224",
+          "target_kind": "node",
+          "target_sha256": "08bcee38ef32f755fbc0c8ad1f648310879b82d5496957dc1d1e9cbf160b4c07",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-tox-70177",
-            "target": "concept.usgs.435",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"",
+            "id": "claim.frontier.arxiv-2607-28224",
+            "label": "CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-tox-70177",
-                "url": "https://api.crossref.org/works/10.1002/tox.70177"
+                "id": "source.frontier.arxiv-2607-28224",
+                "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.28224",
+                "title": "arXiv:2607.28224",
+                "url": "https://arxiv.org/abs/2607.28224"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-30",
+              "source_ids": [
+                "source.frontier.arxiv-2607-28224"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/tox.70177 names Geochemical processes: \"These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water‐quality management, and underscore the need for continued monitoring to support effective water‐resource management.\"",
+          "statement": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"",
           "scope": {
-            "population": "doi:10.1002/tox.70177 abstract",
-            "time": "2026-08-07",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.28224",
+            "time": "2026-07-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-tox-70177",
-              "source_sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
-              "start": 3409,
-              "end": 3653,
-              "quote": "These findings highlight the dominance of seasonal geochemical processes, providing essential baseline data for water\\u2010quality management, and underscore the need for continued monitoring to support effective water\\u2010resource management."
+              "source_id": "source.frontier.arxiv-2607-28224",
+              "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+              "start": 2490,
+              "end": 2801,
+              "quote": "First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28224",
+              "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-07-30</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28224",
+              "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+              "start": 1841,
+              "end": 1903,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77585.field.mesh.d044085",
-          "target_kind": "edge",
-          "target_sha256": "932a66e8f067dd34c5dcc96caeb75527f1a0e0be66c2af03e3029025af511648",
+          "id": "assertion.claim.frontier.arxiv-2607-28185",
+          "target_kind": "node",
+          "target_sha256": "a0573ef8da233252c54dad14f56441cb2288d5e671d3bc72be6b13962e66f133",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-adfm-77585",
-            "target": "field.mesh.d044085",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"",
+            "id": "claim.frontier.arxiv-2607-28185",
+            "label": "Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
+            "kind": "claim",
+            "domain": "information",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-adfm-77585",
-                "url": "https://api.crossref.org/works/10.1002/adfm.77585"
+                "id": "source.frontier.arxiv-2607-28185",
+                "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.28185",
+                "title": "arXiv:2607.28185",
+                "url": "https://arxiv.org/abs/2607.28185"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-30",
+              "source_ids": [
+                "source.frontier.arxiv-2607-28185"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/adfm.77585 names Microfluidics: \"Fluid pumping underpins technologies from microfluidics to soft robotics.\"",
+          "statement": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
           "scope": {
-            "population": "doi:10.1002/adfm.77585 abstract",
-            "time": "2026-08-07",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.28185",
+            "time": "2026-07-30",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-adfm-77585",
-              "source_sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
-              "start": 1269,
-              "end": 1342,
-              "quote": "Fluid pumping underpins technologies from microfluidics to soft robotics."
+              "source_id": "source.frontier.arxiv-2607-28185",
+              "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+              "start": 2222,
+              "end": 2430,
+              "quote": "Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28185",
+              "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+              "start": 1084,
+              "end": 1113,
+              "quote": "<created>2026-07-30</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-28185",
+              "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+              "start": 1546,
+              "end": 1608,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70245.field.mesh.d011057",
-          "target_kind": "edge",
-          "target_sha256": "0d407c662e3ab90a674023eceaf60e79bdcaa50309cf801a2f9d87595758d885",
+          "id": "assertion.claim.frontier.arxiv-2607-26209",
+          "target_kind": "node",
+          "target_sha256": "3e3a639fce49c30240c8dffe2bfbb6757086c8e52e57f7cffe603d63d38d7ec3",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-1467-9566-70245",
-            "target": "field.mesh.d011057",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"",
+            "id": "claim.frontier.arxiv-2607-26209",
+            "label": "Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-1467-9566-70245",
-                "url": "https://api.crossref.org/works/10.1111/1467-9566.70245"
+                "id": "source.frontier.arxiv-2607-26209",
+                "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.26209",
+                "title": "arXiv:2607.26209",
+                "url": "https://arxiv.org/abs/2607.26209"
+              },
+              {
+                "id": "doi:10.1109/ojcoms.2026.3717118",
+                "title": "doi:10.1109/ojcoms.2026.3717118",
+                "url": "https://doi.org/10.1109/ojcoms.2026.3717118"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-28",
+              "source_ids": [
+                "source.frontier.arxiv-2607-26209"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/1467-9566.70245 names Politics: \"In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health.\"",
+          "statement": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"",
           "scope": {
-            "population": "doi:10.1111/1467-9566.70245 abstract",
-            "time": "2026-08-06",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.26209",
+            "time": "2026-07-28",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-1467-9566-70245",
-              "source_sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
-              "start": 2494,
-              "end": 2770,
-              "quote": "In this way, we demonstrate how birth cohorts are an important context for considering the politics of health and how medicalisation is entangled with healthism in cohort data collection, even as this unfolds in tension with efforts to collectively intervene in public health."
+              "source_id": "source.frontier.arxiv-2607-26209",
+              "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+              "start": 3820,
+              "end": 4137,
+              "quote": "The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-26209",
+              "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+              "start": 964,
+              "end": 993,
+              "quote": "<created>2026-07-28</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-26209",
+              "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+              "start": 2432,
+              "end": 2494,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70337.field.aat.300054255",
-          "target_kind": "edge",
-          "target_sha256": "823d22274092f6a74cb246836de4e960d2306c30fbe24958ecef7948ae265ae3",
+          "id": "assertion.claim.frontier.arxiv-2607-25526",
+          "target_kind": "node",
+          "target_sha256": "b1164cfef081634e80f58056041e08056c9b83bbad91b3a6f82cf28548ddcc2b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ijal-70337",
-            "target": "field.aat.300054255",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"",
+            "id": "claim.frontier.arxiv-2607-25526",
+            "label": "Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ijal-70337",
-                "url": "https://api.crossref.org/works/10.1111/ijal.70337"
+                "id": "source.frontier.arxiv-2607-25526",
+                "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.25526",
+                "title": "arXiv:2607.25526",
+                "url": "https://arxiv.org/abs/2607.25526"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-28",
+              "source_ids": [
+                "source.frontier.arxiv-2607-25526"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/ijal.70337 names sociolinguistics: \"Informed by critical sociolinguistics and political economy, the study draws on ten semi‐structured interviews with six teachers/educators and four students from local universities, rural communities and linguistically minoritised settings in China.\"",
+          "statement": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
           "scope": {
-            "population": "doi:10.1111/ijal.70337 abstract",
-            "time": "2026-08-05",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.25526",
+            "time": "2026-07-28",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70337",
-              "source_sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
-              "start": 1256,
-              "end": 1511,
-              "quote": "Informed by critical sociolinguistics and political economy, the study draws on ten semi\\u2010structured interviews with six teachers\\/educators and four students from local universities, rural communities and linguistically minoritised settings in China."
+              "source_id": "source.frontier.arxiv-2607-25526",
+              "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+              "start": 2524,
+              "end": 2808,
+              "quote": "The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-25526",
+              "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+              "start": 960,
+              "end": 989,
+              "quote": "<created>2026-07-28</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-25526",
+              "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+              "start": 1397,
+              "end": 1459,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123821.concept.usgs.2028",
-          "target_kind": "edge",
-          "target_sha256": "392f56fe5d9f837ba1a66d41b1708337b7322ee2f1a1c09d75ceb43a9c5e6fe8",
+          "id": "assertion.claim.frontier.arxiv-2607-25081",
+          "target_kind": "node",
+          "target_sha256": "b90de23cd11d00beb480dd4d7586292f01aad28b48fec4b4505bfb13cc4c9563",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl123821",
-            "target": "concept.usgs.2028",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"",
+            "id": "claim.frontier.arxiv-2607-25081",
+            "label": "Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl123821",
-                "url": "https://api.crossref.org/works/10.1029/2026gl123821"
+                "id": "source.frontier.arxiv-2607-25081",
+                "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.25081",
+                "title": "arXiv:2607.25081",
+                "url": "https://arxiv.org/abs/2607.25081"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-27",
+              "source_ids": [
+                "source.frontier.arxiv-2607-25081"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl123821 names Soil temperature: \"Here, we combine observation‐based aquifer records with gridded groundwater table depth (GWD) model outputs (2000–2015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide.\"",
+          "statement": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl123821 abstract",
-            "time": "2026-08-05",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.25081",
+            "time": "2026-07-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl123821",
-              "source_sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
-              "start": 1449,
-              "end": 1730,
-              "quote": "Here, we combine observation\\u2010based aquifer records with gridded groundwater table depth (GWD) model outputs (2000\\u20132015) to assess how GWD annual fluctuations covary with soil moisture, evaporation, soil temperature, and heatwave frequency across 1,658 aquifers worldwide."
+              "source_id": "source.frontier.arxiv-2607-25081",
+              "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+              "start": 2630,
+              "end": 2866,
+              "quote": "The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-25081",
+              "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+              "start": 974,
+              "end": 1003,
+              "quote": "<created>2026-07-27</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-25081",
+              "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+              "start": 1688,
+              "end": 1750,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-qj-70252.concept.usgs.819",
-          "target_kind": "edge",
-          "target_sha256": "30692f0745cfa35cf656234ae1065de640303228c84100b909a326aa269d780b",
+          "id": "assertion.claim.frontier.arxiv-2607-24423",
+          "target_kind": "node",
+          "target_sha256": "6dca6dc937e903d46d9bc8faf05ead44eeca3c790d69a1881a0251f46e3d7186",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-qj-70252",
-            "target": "concept.usgs.819",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"",
+            "id": "claim.frontier.arxiv-2607-24423",
+            "label": "Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
+            "kind": "claim",
+            "domain": "engineering",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-qj-70252",
-                "url": "https://api.crossref.org/works/10.1002/qj.70252"
+                "id": "source.frontier.arxiv-2607-24423",
+                "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.24423",
+                "title": "arXiv:2607.24423",
+                "url": "https://arxiv.org/abs/2607.24423"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-27",
+              "source_ids": [
+                "source.frontier.arxiv-2607-24423"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/qj.70252 names Ocean temperature: \"It is shown that these skin temperature estimates improve the fit of the short‐range forecast ocean temperature profiles to Array for Real‐Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific.\"",
+          "statement": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"",
           "scope": {
-            "population": "doi:10.1002/qj.70252 abstract",
-            "time": "2026-08-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.24423",
+            "time": "2026-07-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-qj-70252",
-              "source_sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
-              "start": 1736,
-              "end": 2009,
-              "quote": "It is shown that these skin temperature estimates improve the fit of the short\\u2010range forecast ocean temperature profiles to Array for Real\\u2010Time Geostrophic Oceanography (ARGO) float observations, resulting in up to 4% improvements in the Eastern Tropical Pacific."
+              "source_id": "source.frontier.arxiv-2607-24423",
+              "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+              "start": 4038,
+              "end": 4197,
+              "quote": "These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-24423",
+              "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+              "start": 1058,
+              "end": 1087,
+              "quote": "<created>2026-07-27</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-24423",
+              "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+              "start": 2357,
+              "end": 2419,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70540.concept.usgs.64",
-          "target_kind": "edge",
-          "target_sha256": "0965bde54a2ddd0f7e90ee273365f4962fd1484c7430a031ad97944f53e6d97e",
+          "id": "assertion.claim.frontier.arxiv-2607-24360",
+          "target_kind": "node",
+          "target_sha256": "ac1a6108041d1dd66eec9657ec654795b49ceb849592c814f1eafa5968d0c712",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70540",
-            "target": "concept.usgs.64",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"",
+            "id": "claim.frontier.arxiv-2607-24360",
+            "label": "Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-joc-70540",
-                "url": "https://api.crossref.org/works/10.1002/joc.70540"
+                "id": "source.frontier.arxiv-2607-24360",
+                "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.24360",
+                "title": "arXiv:2607.24360",
+                "url": "https://arxiv.org/abs/2607.24360"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-27",
+              "source_ids": [
+                "source.frontier.arxiv-2607-24360"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1002/joc.70540 names Atmospheric circulation: \"Furthermore, the ensemble members under‐represent observed dynamical interannual variability, resulting in fewer high‐impact winters associated with persistent large‐scale atmospheric circulation anomalies.\"",
+          "statement": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"",
           "scope": {
-            "population": "doi:10.1002/joc.70540 abstract",
-            "time": "2026-08-02",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.24360",
+            "time": "2026-07-27",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70540",
-              "source_sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
-              "start": 2644,
-              "end": 2865,
-              "quote": "Furthermore, the ensemble members under\\u2010represent observed dynamical interannual variability, resulting in fewer high\\u2010impact winters associated with persistent large\\u2010scale atmospheric circulation anomalies."
+              "source_id": "source.frontier.arxiv-2607-24360",
+              "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+              "start": 2541,
+              "end": 2630,
+              "quote": "Our findings reveal that manipulative narratives dominate when early spreaders hold them."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-24360",
+              "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+              "start": 1000,
+              "end": 1029,
+              "quote": "<created>2026-07-27</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-24360",
+              "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+              "start": 1906,
+              "end": 1968,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-eje-70266.concept.mesh.d006803",
-          "target_kind": "edge",
-          "target_sha256": "43e2cb6f68dbe2ce7dcfec60226866e44313f4f2bed32da14361b0943a17144a",
+          "id": "assertion.claim.frontier.arxiv-2607-22049",
+          "target_kind": "node",
+          "target_sha256": "787438a2a1978d18fca62f04ba9b03c152778f7a805b0e6417fe10473cd97bbe",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-eje-70266",
-            "target": "concept.mesh.d006803",
-            "type": "related",
-            "summary": "The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"",
+            "id": "claim.frontier.arxiv-2607-22049",
+            "label": "ELSA as an asset to the EU Quantum Act: A position paper",
+            "kind": "claim",
+            "domain": "social",
+            "era": "frontier",
+            "status": "frontier",
+            "frontier": true,
+            "summary": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"",
+            "tags": [
+              "frontier",
+              "public-result"
+            ],
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-eje-70266",
-                "url": "https://api.crossref.org/works/10.1111/eje.70266"
+                "id": "source.frontier.arxiv-2607-22049",
+                "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"
+              },
+              {
+                "id": "arxiv:2607.22049",
+                "title": "arXiv:2607.22049",
+                "url": "https://arxiv.org/abs/2607.22049"
               }
-            ]
+            ],
+            "public_frontier": {
+              "category": "public-result",
+              "capability_status": "publicly-described",
+              "disclosed_at": "2026-07-24",
+              "source_ids": [
+                "source.frontier.arxiv-2607-22049"
+              ]
+            }
           },
-          "statement": "The retained abstract of doi:10.1111/eje.70266 names Human Development: \"Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2‐week OSL program in Tanzania.\"",
+          "statement": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"",
           "scope": {
-            "population": "doi:10.1111/eje.70266 abstract",
-            "time": "2026-07-31",
-            "assumptions": "Topical relation only: the abstract names the existing concept",
-            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "population": "The study reported in arXiv:2607.22049",
+            "time": "2026-07-24",
+            "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed",
+            "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)",
             "units": null,
-            "quantifiers": "This publication only"
+            "quantifiers": "Only what the quoted sentence states"
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-eje-70266",
-              "source_sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
-              "start": 1124,
-              "end": 1276,
-              "quote": "Drawing upon a human development framework, it examines the lived experiences of dental students participating in a 2\\u2010week OSL program in Tanzania."
+              "source_id": "source.frontier.arxiv-2607-22049",
+              "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+              "start": 3108,
+              "end": 3171,
+              "quote": "Together, we show that ELSA is not only about mitigating risks."
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-22049",
+              "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+              "start": 974,
+              "end": 1003,
+              "quote": "<created>2026-07-24</created>"
+            },
+            {
+              "source_id": "source.frontier.arxiv-2607-22049",
+              "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+              "start": 1683,
+              "end": 1745,
+              "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ecpo-70064.concept.mesh.d003906",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-21653.concept.nist.performance",
           "target_kind": "edge",
-          "target_sha256": "9d535648cc70e0fe441dc7c258ac616a306f2ff36f5f5d6d74ca31cfd31b40f7",
+          "target_sha256": "6c52cbb353c3860106387bb725f91b15c84c080339efe63889a54f094753383b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ecpo-70064",
-            "target": "concept.mesh.d003906",
+            "source": "claim.frontier.arxiv-2610-21653",
+            "target": "concept.nist.performance",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"",
+            "summary": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ecpo-70064",
-                "url": "https://api.crossref.org/works/10.1111/ecpo.70064"
+                "id": "source.frontier.arxiv-2610-21653",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ecpo.70064 names Developing Countries: \"China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested.\"",
+          "statement": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"",
           "scope": {
-            "population": "doi:10.1111/ecpo.70064 abstract",
-            "time": "2026-07-31",
+            "population": "arXiv:2610.21653 abstract",
+            "time": "2026-10-15",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811692,34 +838713,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ecpo-70064",
-              "source_sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
-              "start": 861,
-              "end": 1006,
-              "quote": "China has emerged as the world's largest bilateral creditor to developing countries, yet its effects on sovereign debt outcomes remain contested."
+              "source_id": "source.frontier.arxiv-2610-21653",
+              "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+              "start": 2482,
+              "end": 2833,
+              "quote": "In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-beer-70139.concept.mesh.d012941",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-19722.concept.nist.linearprobng",
           "target_kind": "edge",
-          "target_sha256": "4a4b958419b8bd96eaacd5b404fd954052600e725c0a8fc209f867d5f44c0109",
+          "target_sha256": "7eecfd6e62120b32e3cafc90725ff730f46cdcf8647b9a6ff67e6a530d434441",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-beer-70139",
-            "target": "concept.mesh.d012941",
+            "source": "claim.frontier.arxiv-2610-19722",
+            "target": "concept.nist.linearprobng",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"",
+            "summary": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-beer-70139",
-                "url": "https://api.crossref.org/works/10.1111/beer.70139"
+                "id": "source.frontier.arxiv-2610-19722",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/beer.70139 names Social Responsibility: \"This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability.\"",
+          "statement": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"",
           "scope": {
-            "population": "doi:10.1111/beer.70139 abstract",
-            "time": "2026-07-30",
+            "population": "arXiv:2610.19722 abstract",
+            "time": "2026-10-14",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811727,34 +838748,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-beer-70139",
-              "source_sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
-              "start": 840,
-              "end": 1042,
-              "quote": "This study contributes to the ongoing discussion on the increasing importance of corporate social responsibility (CSR) committees and their characteristics in driving a stronger focus on sustainability."
+              "source_id": "source.frontier.arxiv-2610-19722",
+              "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+              "start": 2494,
+              "end": 2739,
+              "quote": "Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0029.field.aat.300054297",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-19515.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "d04ad2eb1b13c49ed964cf507c49d71f693793799169bba19d27a5d4220b51f5",
+          "target_sha256": "5ac5de4037bb606f6bce5d6d147b789233ebf4ee8d02810774971f2b565ce793",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1098-rsta-2025-0029",
-            "target": "field.aat.300054297",
+            "source": "claim.frontier.arxiv-2610-19515",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"",
+            "summary": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1098-rsta-2025-0029",
-                "url": "https://api.crossref.org/works/10.1098/rsta.2025.0029"
+                "id": "source.frontier.arxiv-2610-19515",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1098/rsta.2025.0029 names phenomenology: \"We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues.\"",
+          "statement": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"",
           "scope": {
-            "population": "doi:10.1098/rsta.2025.0029 abstract",
-            "time": "2026-07-30",
+            "population": "arXiv:2610.19515 abstract",
+            "time": "2026-10-14",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811762,34 +838783,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1098-rsta-2025-0029",
-              "source_sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
-              "start": 1238,
-              "end": 1375,
-              "quote": "We explore the phenomenology of rotating quantum turbulence, emphasizing how rotation introduces new regimes with no classical analogues."
+              "source_id": "source.frontier.arxiv-2610-19515",
+              "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+              "start": 2964,
+              "end": 3157,
+              "quote": "To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124661.concept.usgs.2027",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-19137.concept.eia.carbon-intensity",
           "target_kind": "edge",
-          "target_sha256": "55a00eefabe46841268f7fa262e0e0412cd15c0366b806a59d817d0106dbf31c",
+          "target_sha256": "65f34a3e4de1921934fce958fbf3de103cf158d4563c30e2e926a680ffd46924",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124661",
-            "target": "concept.usgs.2027",
+            "source": "claim.frontier.arxiv-2610-19137",
+            "target": "concept.eia.carbon-intensity",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"",
+            "summary": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl124661",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124661"
+                "id": "source.frontier.arxiv-2610-19137",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124661 names Soil moisture: \"These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40 cm) from near‐surface observations (5 cm).\"",
+          "statement": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124661 abstract",
-            "time": "2026-07-30",
+            "population": "arXiv:2610.19137 abstract",
+            "time": "2026-10-13",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811797,34 +838818,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124661",
-              "source_sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
-              "start": 1168,
-              "end": 1382,
-              "quote": "These critical points are used to train a spectral Fourier Neural Operator (FNO) augmented with a lagged term to predict subsurface soil moisture (20 and 40\\u00a0cm) from near\\u2010surface observations (5\\u00a0cm)."
+              "source_id": "source.frontier.arxiv-2610-19137",
+              "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+              "start": 2109,
+              "end": 2266,
+              "quote": "Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jc023581.concept.usgs.1034",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-17295.method.nist.dynamicprog",
           "target_kind": "edge",
-          "target_sha256": "a18ba45043b77113b0e3b3a9d3adfe3119c6ba58be45cd7585be9fa2df4d2fa1",
+          "target_sha256": "775808a409b91ec514d386a1058df8db284a414f0f89eeabc5d424b888319cb2",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jc023581",
-            "target": "concept.usgs.1034",
+            "source": "claim.frontier.arxiv-2610-17295",
+            "target": "method.nist.dynamicprog",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"",
+            "summary": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jc023581",
-                "url": "https://api.crossref.org/works/10.1029/2025jc023581"
+                "id": "source.frontier.arxiv-2610-17295",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jc023581 names Sediment transport: \"The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River.\"",
+          "statement": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"",
           "scope": {
-            "population": "doi:10.1029/2025jc023581 abstract",
-            "time": "2026-07-30",
+            "population": "arXiv:2610.17295 abstract",
+            "time": "2026-10-12",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811832,34 +838853,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jc023581",
-              "source_sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
-              "start": 1920,
-              "end": 2059,
-              "quote": "The results reveal two distinct sediment transport peaks, linked to asynchronous flood pulses from Buffalo Bayou and the San Jacinto River."
+              "source_id": "source.frontier.arxiv-2610-17295",
+              "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+              "start": 2774,
+              "end": 2977,
+              "quote": "We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jb032632.field.navigation",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-16273.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "6de6605b857cc8977937877057635fa3102dca7da7d06447b136c5d3a84ef339",
+          "target_sha256": "331f68716f56caf2cc1f64b7b17c31b7f4a000a87e691e6e5bd0072a3a9ffaf4",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jb032632",
-            "target": "field.navigation",
+            "source": "claim.frontier.arxiv-2610-16273",
+            "target": "field.neuroscience",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"",
+            "summary": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jb032632",
-                "url": "https://api.crossref.org/works/10.1029/2025jb032632"
+                "id": "source.frontier.arxiv-2610-16273",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jb032632 names Navigation: \"In a comparison with Global Navigation Satellite System‐derived measurements of deformation, our approach dramatically outperforms a state‐of‐the‐art correction method based on a weather model, reducing root‐mean‐square error by (0.006 m vs. 0.017 m).\"",
+          "statement": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"",
           "scope": {
-            "population": "doi:10.1029/2025jb032632 abstract",
-            "time": "2026-07-30",
+            "population": "arXiv:2610.16273 abstract",
+            "time": "2026-10-12",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811867,34 +838888,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jb032632",
-              "source_sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
-              "start": 2240,
-              "end": 2532,
-              "quote": "In a comparison with Global Navigation Satellite System\\u2010derived measurements of deformation, our approach dramatically outperforms a state\\u2010of\\u2010the\\u2010art correction method based on a weather model, reducing root\\u2010mean\\u2010square error by  (0.006\\u00a0m vs. 0.017\\u00a0m)."
+              "source_id": "source.frontier.arxiv-2610-16273",
+              "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+              "start": 2282,
+              "end": 2750,
+              "quote": "Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70526.field.climatology",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-16259.field.information-theory",
           "target_kind": "edge",
-          "target_sha256": "9d32184199f687914a2f80ca00dbb579a7c54e835cafcf1d4f58c3a84f7456b8",
+          "target_sha256": "829c50885f9d6b8d8c3621b4faa34a5e596bf54e3f277ddf4369316d8a083416",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70526",
-            "target": "field.climatology",
+            "source": "claim.frontier.arxiv-2610-16259",
+            "target": "field.information-theory",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"",
+            "summary": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-joc-70526",
-                "url": "https://api.crossref.org/works/10.1002/joc.70526"
+                "id": "source.frontier.arxiv-2610-16259",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/joc.70526 names Climatology: \"Here, we develop a station‐based, multi‐timescale drought climatology for Greece (1960–2022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations.\"",
+          "statement": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"",
           "scope": {
-            "population": "doi:10.1002/joc.70526 abstract",
-            "time": "2026-07-28",
+            "population": "arXiv:2610.16259 abstract",
+            "time": "2026-10-12",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811902,34 +838923,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70526",
-              "source_sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
-              "start": 1036,
-              "end": 1276,
-              "quote": "Here, we develop a station\\u2010based, multi\\u2010timescale drought climatology for Greece (1960\\u20132022) using daily precipitation and temperature observations from 67 homogenized Hellenic National Meteorological Service (HNMS) stations."
+              "source_id": "source.frontier.arxiv-2610-16259",
+              "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+              "start": 1961,
+              "end": 2143,
+              "quote": "Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-saje-70032.concept.mesh.d006803",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-15072.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "c7a43702e148ff21455a1439315c19ce38671f09535e13897b8967a33d81bdd6",
+          "target_sha256": "8efda7b9f8e94cf895bd2e87e3ae2f48d850aa97c89f73d1a0f1cbae59c119fc",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-saje-70032",
-            "target": "concept.mesh.d006803",
+            "source": "claim.frontier.arxiv-2610-15072",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"",
+            "summary": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-saje-70032",
-                "url": "https://api.crossref.org/works/10.1111/saje.70032"
+                "id": "source.frontier.arxiv-2610-15072",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/saje.70032 names Human Development: \"We find that digitalisation has a nonlinear effect on corruption and on human development.\"",
+          "statement": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"",
           "scope": {
-            "population": "doi:10.1111/saje.70032 abstract",
-            "time": "2026-07-26",
+            "population": "arXiv:2610.15072 abstract",
+            "time": "2026-10-10",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811937,34 +838958,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-saje-70032",
-              "source_sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
-              "start": 1147,
-              "end": 1237,
-              "quote": "We find that digitalisation has a nonlinear effect on corruption and on human development."
+              "source_id": "source.frontier.arxiv-2610-15072",
+              "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+              "start": 3634,
+              "end": 3794,
+              "quote": "To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124111.concept.usgs.819",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-15052.method.nist.simulatedannealing",
           "target_kind": "edge",
-          "target_sha256": "8e7e4115d7cd3db903ccdfc4c14129d22450e2176267309fd09f300da054462f",
+          "target_sha256": "75ab44c41fa2aa7a69b4d8fa061ee87bef74f9c3bcdb296158fea5a50dbabd12",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl124111",
-            "target": "concept.usgs.819",
+            "source": "claim.frontier.arxiv-2610-15052",
+            "target": "method.nist.simulatedannealing",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"",
+            "summary": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl124111",
-                "url": "https://api.crossref.org/works/10.1029/2026gl124111"
+                "id": "source.frontier.arxiv-2610-15052",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl124111 names Ocean temperature: \"These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events.\"",
+          "statement": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl124111 abstract",
-            "time": "2026-07-23",
+            "population": "arXiv:2610.15052 abstract",
+            "time": "2026-10-10",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -811972,34 +838993,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl124111",
-              "source_sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
-              "start": 3590,
-              "end": 3779,
-              "quote": "These amplified wind anomalies, in turn, generate larger subsurface ocean temperature anomalies in the region, creating more favorable conditions for the development of ensuing ENSO events."
+              "source_id": "source.frontier.arxiv-2610-15052",
+              "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+              "start": 2266,
+              "end": 2426,
+              "quote": "On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70772.concept.mesh.d000097822",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-13424.concept.nist.optimalsoltn",
           "target_kind": "edge",
-          "target_sha256": "3e62a6474f79f8cb4795b144fb48f00f5952215fe1b5aa709126d6cd47192bd0",
+          "target_sha256": "079868db045bc283e82e361b1cf57daf828885c2772060941780296bb6d0b7cb",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ejed-70772",
-            "target": "concept.mesh.d000097822",
+            "source": "claim.frontier.arxiv-2610-13424",
+            "target": "concept.nist.optimalsoltn",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"",
+            "summary": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ejed-70772",
-                "url": "https://api.crossref.org/works/10.1111/ejed.70772"
+                "id": "source.frontier.arxiv-2610-13424",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ejed.70772 names Media Exposure: \"Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools.\"",
+          "statement": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"",
           "scope": {
-            "population": "doi:10.1111/ejed.70772 abstract",
-            "time": "2026-07-20",
+            "population": "arXiv:2610.13424 abstract",
+            "time": "2026-10-09",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812007,34 +839028,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ejed-70772",
-              "source_sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
-              "start": 1324,
-              "end": 1537,
-              "quote": "Although many participants first encountered AI through media exposure or academic requirements, their engagement has shifted from initial scepticism to routine use, with many reporting daily reliance on AI tools."
+              "source_id": "source.frontier.arxiv-2610-13424",
+              "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+              "start": 2131,
+              "end": 2322,
+              "quote": "We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122539.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-13402.field.information-theory",
           "target_kind": "edge",
-          "target_sha256": "c40b0c002dfce5e52c92ebb40cea4fe5c9990a4b2a9da8eeda5a1e0161f5927a",
+          "target_sha256": "5dbcabdc37d02bec3ccadfaa7375107623de9bebcd60e23347c78d52ae2ae99b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122539",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2610-13402",
+            "target": "field.information-theory",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"",
+            "summary": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122539",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122539"
+                "id": "source.frontier.arxiv-2610-13402",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122539 names Topography: \"The NASA/CNES Surface Water and Ocean Topography (SWOT) swath‐mapping radar altimetry satellite mission, launched in December 2022, provides repeat‐track coverage to about ±78.2° latitude every 21 days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet.\"",
+          "statement": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122539 abstract",
-            "time": "2026-07-18",
+            "population": "arXiv:2610.13402 abstract",
+            "time": "2026-10-09",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812042,34 +839063,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122539",
-              "source_sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
-              "start": 966,
-              "end": 1324,
-              "quote": "The NASA\\/CNES Surface Water and Ocean Topography (SWOT) swath\\u2010mapping radar altimetry satellite mission, launched in December 2022, provides repeat\\u2010track coverage to about \\u00b178.2\\u00b0 latitude every 21\\u00a0days, sampling many of Antarctica's most dynamic ice shelves that play key roles in constraining mass loss from the grounded ice sheet."
+              "source_id": "source.frontier.arxiv-2610-13402",
+              "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+              "start": 2176,
+              "end": 2374,
+              "quote": "By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70310.field.aat.300054264",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-12779.concept.nist.stronglyconnectedcompo",
           "target_kind": "edge",
-          "target_sha256": "3454753a5337242de9c7d986cd8661b3addf0ba50bf6fe77ee01caf8c1acf184",
+          "target_sha256": "ca881d45dfea19f0f4d1689792f3c7ae8c50722a6bf04293982520cbe71ce19a",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ijal-70310",
-            "target": "field.aat.300054264",
+            "source": "claim.frontier.arxiv-2610-12779",
+            "target": "concept.nist.stronglyconnectedcompo",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"",
+            "summary": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ijal-70310",
-                "url": "https://api.crossref.org/works/10.1111/ijal.70310"
+                "id": "source.frontier.arxiv-2610-12779",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ijal.70310 names pragmatics: \"The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI‐mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation.\"",
+          "statement": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"",
           "scope": {
-            "population": "doi:10.1111/ijal.70310 abstract",
-            "time": "2026-07-17",
+            "population": "arXiv:2610.12779 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812077,34 +839098,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70310",
-              "source_sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
-              "start": 2524,
-              "end": 2789,
-              "quote": "The study therefore contributes to the emerging discussion of chatbot pragmatics by demonstrating how Gricean communicative principles are adapted in AI\\u2010mediated interaction and by highlighting the role of prompting instruction in facilitating this adaptation."
+              "source_id": "source.frontier.arxiv-2610-12779",
+              "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+              "start": 2510,
+              "end": 2854,
+              "quote": "We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-adfm-76901.concept.mesh.d001698",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-12604.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "33d5bdf8cc2d08f0fb578677ea1762c1ba2aebe8a4eee124341801350c4e5c4c",
+          "target_sha256": "14c2f0dad240c4d7442124b6c0f263eb37dc67dfb71e2f7e68cd2f9d95babd15",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-adfm-76901",
-            "target": "concept.mesh.d001698",
+            "source": "claim.frontier.arxiv-2610-12604",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"",
+            "summary": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-adfm-76901",
-                "url": "https://api.crossref.org/works/10.1002/adfm.76901"
+                "id": "source.frontier.arxiv-2610-12604",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/adfm.76901 names Biomedical Engineering: \"Collectively, these results highlight the potential of our approach as an implantable platform for bio‐integrated computing and next‐generation biomedical engineering.\"",
+          "statement": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"",
           "scope": {
-            "population": "doi:10.1002/adfm.76901 abstract",
-            "time": "2026-07-17",
+            "population": "arXiv:2610.12604 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812112,34 +839133,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-adfm-76901",
-              "source_sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
-              "start": 3034,
-              "end": 3211,
-              "quote": "Collectively, these results highlight the potential of our approach as an implantable platform for bio\\u2010integrated computing and next\\u2010generation biomedical engineering."
+              "source_id": "source.frontier.arxiv-2610-12604",
+              "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+              "start": 2287,
+              "end": 2368,
+              "quote": "Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-nzm2-70056.concept.usgs.1731",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-12592.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "3ada4b65e3f13f0f937b48ca5db6c82c1179403cc0afb7c1f55dde8498914236",
+          "target_sha256": "11b48931ed746a55634fe888b721f0428ab3ac49505d2220999f8da5dcdd5b63",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-nzm2-70056",
-            "target": "concept.usgs.1731",
+            "source": "claim.frontier.arxiv-2610-12592",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"",
+            "summary": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-nzm2-70056",
-                "url": "https://api.crossref.org/works/10.1002/nzm2.70056"
+                "id": "source.frontier.arxiv-2610-12592",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/nzm2.70056 names Carbon sequestration: \"We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively.\"",
+          "statement": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"",
           "scope": {
-            "population": "doi:10.1002/nzm2.70056 abstract",
-            "time": "2026-07-16",
+            "population": "arXiv:2610.12592 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812147,34 +839168,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-nzm2-70056",
-              "source_sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
-              "start": 1641,
-              "end": 1874,
-              "quote": "We found that the most valuable ecosystem service provided by mangroves was carbon sequestration, while in saltmarsh and seagrass, the most valuable ecosystem services were waste treatment and existence, bequest values, respectively."
+              "source_id": "source.frontier.arxiv-2610-12592",
+              "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+              "start": 2790,
+              "end": 3101,
+              "quote": "The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE)."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-026.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-12038.concept.nist.binarytree",
           "target_kind": "edge",
-          "target_sha256": "b9ba5ddccd19aa7016d970d727b6d5dc9b7bb39ed0e2d450c5c9d59715553c9a",
+          "target_sha256": "786c0410ff5cc9624a32a7c8ef50de145e7fe2d0bc05fef76b9c571b90ab7fe1",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1144-jgs2026-026",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2610-12038",
+            "target": "concept.nist.binarytree",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"",
+            "summary": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1144-jgs2026-026",
-                "url": "https://api.crossref.org/works/10.1144/jgs2026-026"
+                "id": "source.frontier.arxiv-2610-12038",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1144/jgs2026-026 names Topography: \"Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation.\"",
+          "statement": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"",
           "scope": {
-            "population": "doi:10.1144/jgs2026-026 abstract",
-            "time": "2026-07-15",
+            "population": "arXiv:2610.12038 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812182,34 +839203,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1144-jgs2026-026",
-              "source_sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
-              "start": 1141,
-              "end": 1466,
-              "quote": "Here, it is shown that crustal uplift can be explained by an isostatic unloading model that takes into account the generalized glaciation and deglaciation history of the British Isles, the topography of the Forest of Dean and Cotswold Hills, and the possibility of a lithosphere, rather than asthenosphere, stress relaxation."
+              "source_id": "source.frontier.arxiv-2610-12038",
+              "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+              "start": 2082,
+              "end": 2436,
+              "quote": "This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70766.concept.mesh.d003906",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-11869.concept.nist.objective",
           "target_kind": "edge",
-          "target_sha256": "fcbdce1b920f24264f2bef8aa6f195af401c6d3484357ace620a11887f12c5fa",
+          "target_sha256": "c1c93b38d6e47f170dcde510947d0d3fb1d38243d44d2ef627100b0505a79050",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ejed-70766",
-            "target": "concept.mesh.d003906",
+            "source": "claim.frontier.arxiv-2610-11869",
+            "target": "concept.nist.objective",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"",
+            "summary": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ejed-70766",
-                "url": "https://api.crossref.org/works/10.1111/ejed.70766"
+                "id": "source.frontier.arxiv-2610-11869",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ejed.70766 names Developing Countries: \"However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices.\"",
+          "statement": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"",
           "scope": {
-            "population": "doi:10.1111/ejed.70766 abstract",
-            "time": "2026-07-15",
+            "population": "arXiv:2610.11869 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812217,34 +839238,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ejed-70766",
-              "source_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-              "start": 1101,
-              "end": 1274,
-              "quote": "However, limited research has examined how teacher educators in developing countries, including Iran, conceptualize and implement sustainability in their teaching practices."
+              "source_id": "source.frontier.arxiv-2610-11869",
+              "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+              "start": 2320,
+              "end": 2421,
+              "quote": "An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-sce-70090.concept.mesh.d000080562",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-11359.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "16012ce64737f2436f2d6371cd35f39f43c8313b78d72327513f89f5fc1cd4df",
+          "target_sha256": "8e4ed8f65551d000ad2f1d0f672269c98285e6414ff835d0a864d12f79109db4",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-sce-70090",
-            "target": "concept.mesh.d000080562",
+            "source": "claim.frontier.arxiv-2610-11359",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"",
+            "summary": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-sce-70090",
-                "url": "https://api.crossref.org/works/10.1002/sce.70090"
+                "id": "source.frontier.arxiv-2610-11359",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/sce.70090 names Universal Design: \"Positive evidence was found for systematic instruction, mixed evidence for digital learning and self‐directed learning, and insufficient but promising evidence for peer support, design‐based engineering learning, and universal design for learning.\"",
+          "statement": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"",
           "scope": {
-            "population": "doi:10.1002/sce.70090 abstract",
-            "time": "2026-07-15",
+            "population": "arXiv:2610.11359 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812252,34 +839273,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-sce-70090",
-              "source_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-              "start": 2829,
-              "end": 3086,
-              "quote": "Positive evidence was found for systematic instruction, mixed evidence for digital learning and self\\u2010directed learning, and insufficient but promising evidence for peer support, design\\u2010based engineering learning, and universal design for learning."
+              "source_id": "source.frontier.arxiv-2610-11359",
+              "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+              "start": 2445,
+              "end": 2666,
+              "quote": "Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70053.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04959.concept.nist.flownetwork",
           "target_kind": "edge",
-          "target_sha256": "9900a279402e35229a0da8d0d7f2b28f43339dfabe26c2d327359b75320000f5",
+          "target_sha256": "9fcd2dbcd4e1440767a958f0313d13ad345f9d85ca160b20ec7b62391961a295",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ppp-70053",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2610-04959",
+            "target": "concept.nist.flownetwork",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"",
+            "summary": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ppp-70053",
-                "url": "https://api.crossref.org/works/10.1002/ppp.70053"
+                "id": "source.frontier.arxiv-2610-04959",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/ppp.70053 names Topography: \"We used quasi‐3D electrical resistivity tomography (ERT) measurements, supported by UAV‐LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome‐shaped and plateau‐shaped) within Sweden's largest coherent palsa complex, Vissátvuopmi.\"",
+          "statement": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"",
           "scope": {
-            "population": "doi:10.1002/ppp.70053 abstract",
-            "time": "2026-07-14",
+            "population": "arXiv:2610.04959 abstract",
+            "time": "2026-10-08",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812287,34 +839308,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ppp-70053",
-              "source_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-              "start": 1689,
-              "end": 2024,
-              "quote": "We used quasi\\u20103D electrical resistivity tomography (ERT) measurements, supported by UAV\\u2010LiDAR topography, frost probing, and borehole drilling, to map the internal structure of two geomorphologically distinct palsas (dome\\u2010shaped and plateau\\u2010shaped) within Sweden's largest coherent palsa complex, Viss\\u00e1tvuopmi."
+              "source_id": "source.frontier.arxiv-2610-04959",
+              "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+              "start": 2845,
+              "end": 3022,
+              "quote": "While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70603.concept.eia.coal-mine",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-09266.concept.nist.optimalsoltn",
           "target_kind": "edge",
-          "target_sha256": "3863be4c8ca9e7ed520cac96a977f5671b15c9120ebf402e7067a61d36a14d56",
+          "target_sha256": "95603e652c1ff02230684988deb5c9ad74fb860f4d7d7dc7ac5122d5cc54673c",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ese3-70603",
-            "target": "concept.eia.coal-mine",
+            "source": "claim.frontier.arxiv-2610-09266",
+            "target": "concept.nist.optimalsoltn",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"",
+            "summary": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ese3-70603",
-                "url": "https://api.crossref.org/works/10.1002/ese3.70603"
+                "id": "source.frontier.arxiv-2610-09266",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/ese3.70603 names Coal mine: \"Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault.\"",
+          "statement": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"",
           "scope": {
-            "population": "doi:10.1002/ese3.70603 abstract",
-            "time": "2026-07-14",
+            "population": "arXiv:2610.09266 abstract",
+            "time": "2026-10-07",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812322,34 +839343,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ese3-70603",
-              "source_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-              "start": 1604,
-              "end": 1781,
-              "quote": "Based on the geological conditions of a specific coal mine, a numerical model was established using FLAC3D to simulate mining in the footwall and hanging wall of a normal fault."
+              "source_id": "source.frontier.arxiv-2610-09266",
+              "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+              "start": 3311,
+              "end": 3543,
+              "quote": "Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd046190.concept.usgs.65",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-09080.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "a81c4b93bb80875c32e4cb68c2eb7770bc026c11a1112abb33ca81c7a4cbb3c2",
+          "target_sha256": "1e1160c97bfc9883df2db67b1a69e296911399de06c589edad65ee2e175342b3",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jd046190",
-            "target": "concept.usgs.65",
+            "source": "claim.frontier.arxiv-2610-09080",
+            "target": "method.nist.exhaustivesearch",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"",
+            "summary": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd046190",
-                "url": "https://api.crossref.org/works/10.1029/2025jd046190"
+                "id": "source.frontier.arxiv-2610-09080",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jd046190 names Atmospheric composition: \"In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition.\"",
+          "statement": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"",
           "scope": {
-            "population": "doi:10.1029/2025jd046190 abstract",
-            "time": "2026-07-13",
+            "population": "arXiv:2610.09080 abstract",
+            "time": "2026-10-06",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812357,34 +839378,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd046190",
-              "source_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-              "start": 2235,
-              "end": 2429,
-              "quote": "In some cases, smoke reaches the upper troposphere and lower stratosphere region, where it can persist for extended time periods and influences climate, air quality, and atmospheric composition."
+              "source_id": "source.frontier.arxiv-2610-09080",
+              "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+              "start": 2479,
+              "end": 2656,
+              "quote": "The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121323.concept.usgs.93",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-09010.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "8c6a0d96fd2ee03a46e32a995778115ab59ae1d4134496934663798b82352269",
+          "target_sha256": "cfcef2c8ea0a1f3f36ad2aa5f87966c321d92d4eb047fdbac321d6c69616310a",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025gl121323",
-            "target": "concept.usgs.93",
+            "source": "claim.frontier.arxiv-2610-09010",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"",
+            "summary": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gl121323",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121323"
+                "id": "source.frontier.arxiv-2610-09010",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025gl121323 names Biogeochemical cycling: \"The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean.\"",
+          "statement": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"",
           "scope": {
-            "population": "doi:10.1029/2025gl121323 abstract",
-            "time": "2026-07-13",
+            "population": "arXiv:2610.09010 abstract",
+            "time": "2026-10-06",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812392,34 +839413,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121323",
-              "source_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-              "start": 1800,
-              "end": 2006,
-              "quote": "The relative contribution of different Fe sources such as atmospheric aerosols, sediment dissolution, and submarine hydrothermalism influences the distribution and biogeochemical cycling of Fe in the ocean."
+              "source_id": "source.frontier.arxiv-2610-09010",
+              "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+              "start": 2858,
+              "end": 3033,
+              "quote": "The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ijfe-70259.concept.mesh.d057217",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-08744.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "ef4531c42eb774a730647f22f51fc69fb73fb0e839ac044ad9c1f15d6978d867",
+          "target_sha256": "34ab545a3d46057a832b840f0708925c7fc5b44ccd2cb53be8ebd322a2597a4d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ijfe-70259",
-            "target": "concept.mesh.d057217",
+            "source": "claim.frontier.arxiv-2610-08744",
+            "target": "method.nist.exhaustivesearch",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"",
+            "summary": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ijfe-70259",
-                "url": "https://api.crossref.org/works/10.1002/ijfe.70259"
+                "id": "source.frontier.arxiv-2610-08744",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/ijfe.70259 names Economic Development: \"Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes.\"",
+          "statement": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"",
           "scope": {
-            "population": "doi:10.1002/ijfe.70259 abstract",
-            "time": "2026-07-12",
+            "population": "arXiv:2610.08744 abstract",
+            "time": "2026-10-06",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812427,34 +839448,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ijfe-70259",
-              "source_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-              "start": 1980,
-              "end": 2153,
-              "quote": "Finally, we identify economic development, democratic institutions, country size, bankruptcies, and interest rate fluctuations as key determinants of fiscal policy outcomes."
+              "source_id": "source.frontier.arxiv-2610-08744",
+              "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+              "start": 2897,
+              "end": 3062,
+              "quote": "Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000696.concept.usgs.1308",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-07616.method.nist.randomsearch",
           "target_kind": "edge",
-          "target_sha256": "e783179f541b5c3c5e8f04c8f1df63f088b40d521e4c80955ab28158cd2a1522",
+          "target_sha256": "d424e04812d75c1602b74fa1578560a256e2d61493f28f405359034821a6896b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1371-journal-pclm-0000696",
-            "target": "concept.usgs.1308",
+            "source": "claim.frontier.arxiv-2610-07616",
+            "target": "method.nist.randomsearch",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"",
+            "summary": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-                "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696"
+                "id": "source.frontier.arxiv-2610-07616",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1371/journal.pclm.0000696 names Water resources: \"Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources.\"",
+          "statement": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"",
           "scope": {
-            "population": "doi:10.1371/journal.pclm.0000696 abstract",
-            "time": "2026-07-09",
+            "population": "arXiv:2610.07616 abstract",
+            "time": "2026-10-06",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812462,34 +839483,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-              "source_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-              "start": 932,
-              "end": 1045,
-              "quote": "Improving water use efficiency (WUE) in agriculture is crucial, given the escalating scarcity of water resources."
+              "source_id": "source.frontier.arxiv-2610-07616",
+              "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+              "start": 2055,
+              "end": 2165,
+              "quote": "Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-aphw-70185.concept.mesh.d000091682",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-07307.concept.nist.prisonersdilemma",
           "target_kind": "edge",
-          "target_sha256": "30b5316591de380285c1fe3c44b88357f34ca5f4cbb582cf5b373f893435b0da",
+          "target_sha256": "ea2d5a86e58088fbc950e26cc8988c366be503287af370b49992819a8b8891e5",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-aphw-70185",
-            "target": "concept.mesh.d000091682",
+            "source": "claim.frontier.arxiv-2610-07307",
+            "target": "concept.nist.prisonersdilemma",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"",
+            "summary": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-aphw-70185",
-                "url": "https://api.crossref.org/works/10.1111/aphw.70185"
+                "id": "source.frontier.arxiv-2610-07307",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/aphw.70185 names Health Inequities: \"Community‐based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods.\"",
+          "statement": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"",
           "scope": {
-            "population": "doi:10.1111/aphw.70185 abstract",
-            "time": "2026-07-09",
+            "population": "arXiv:2610.07307 abstract",
+            "time": "2026-10-05",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812497,34 +839518,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-aphw-70185",
-              "source_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-              "start": 957,
-              "end": 1164,
-              "quote": "Community\\u2010based participatory research (CBPR) provides a collaborative framework for addressing health inequities through equitable partnerships, community engagement, and culturally responsive methods."
+              "source_id": "source.frontier.arxiv-2610-07307",
+              "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+              "start": 3030,
+              "end": 3211,
+              "quote": "The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001250.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-06601.method.nist.dynamicprog",
           "target_kind": "edge",
-          "target_sha256": "31f023290f2ba95152778204853b275360d8b26720aaba93e4a7aba4ebeb556a",
+          "target_sha256": "083cd631d5308584d26f4e731db2100ed2393b9f1955bf4b0df8e2887a1ad43f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026jh001250",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2610-06601",
+            "target": "method.nist.dynamicprog",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"",
+            "summary": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026jh001250",
-                "url": "https://api.crossref.org/works/10.1029/2026jh001250"
+                "id": "source.frontier.arxiv-2610-06601",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026jh001250 names Topography: \"For estimating glacier MB, data‐driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations.\"",
+          "statement": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"",
           "scope": {
-            "population": "doi:10.1029/2026jh001250 abstract",
-            "time": "2026-07-09",
+            "population": "arXiv:2610.06601 abstract",
+            "time": "2026-10-05",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812532,34 +839553,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026jh001250",
-              "source_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-              "start": 1163,
-              "end": 1384,
-              "quote": "For estimating glacier MB, data\\u2010driven models provide a complementary alternative to traditional numerical approaches by learning empirical relationships between climate forcing, topography, and MB from observations."
+              "source_id": "source.frontier.arxiv-2610-06601",
+              "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+              "start": 2966,
+              "end": 3234,
+              "quote": "We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122518.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04776.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "e23b30c7bd2185fb0b659e2db19faf3ce0200478301455d6a02427fbf3940e9f",
+          "target_sha256": "9f5995026dd7354e0abb244a9aed300018a1287c4ecec39bf4870b89fabcb358",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122518",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2610-04776",
+            "target": "method.nist.exhaustivesearch",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"",
+            "summary": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122518",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122518"
+                "id": "source.frontier.arxiv-2610-04776",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122518 names Topography: \"However, the impacts of realistic three‐dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress‐change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored.\"",
+          "statement": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122518 abstract",
-            "time": "2026-07-09",
+            "population": "arXiv:2610.04776 abstract",
+            "time": "2026-10-03",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812567,34 +839588,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122518",
-              "source_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-              "start": 1927,
-              "end": 2179,
-              "quote": "However, the impacts of realistic three\\u2010dimensional (3D) structure, such as seafloor topography and structural heterogeneity, on stress\\u2010change calculations and tsunami excitation during the 2011 Tohoku earthquake have not been fully explored."
+              "source_id": "source.frontier.arxiv-2610-04776",
+              "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+              "start": 3268,
+              "end": 3505,
+              "quote": "Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e172739.concept.mesh.d003906",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04697.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "f7dd16ce59b926cd1bb8d06fb3bd37b33038949d2852fc0381863c8601208bab",
+          "target_sha256": "2b37efcee69a5a45ddd737da1a20a2b5e4b4a8f254ac38ea0cdb4b1092a8c5cf",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-brics-econ-7-e172739",
-            "target": "concept.mesh.d003906",
+            "source": "claim.frontier.arxiv-2610-04697",
+            "target": "field.neuroscience",
             "type": "related",
-            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"",
+            "summary": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739"
+                "id": "source.frontier.arxiv-2610-04697",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e172739 names Developing Countries: \"This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023.\"",
+          "statement": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"",
           "scope": {
-            "population": "doi:10.3897/brics-econ.7.e172739 abstract",
-            "time": "2026-07-07",
+            "population": "arXiv:2610.04697 abstract",
+            "time": "2026-10-03",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812602,34 +839623,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-              "source_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-              "start": 801,
-              "end": 903,
-              "quote": "This paper examines the impact of DST on economic growth in 87 developing countries from 2005 to 2023."
+              "source_id": "source.frontier.arxiv-2610-04697",
+              "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+              "start": 1632,
+              "end": 1833,
+              "quote": "In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70045.ology.geochronology",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04662.concept.nist.temporllogic",
           "target_kind": "edge",
-          "target_sha256": "b470d645eb6aa2ad32f6441a01e1d37fdc168516d75e1d4a4e746017ba4b2109",
+          "target_sha256": "c8b7c19acd6410839be0b87fa7602dc180e4d9eabdd6e1654175c200da8ecef6",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-jmg-70045",
-            "target": "ology.geochronology",
+            "source": "claim.frontier.arxiv-2610-04662",
+            "target": "concept.nist.temporllogic",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"",
+            "summary": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-jmg-70045",
-                "url": "https://api.crossref.org/works/10.1111/jmg.70045"
+                "id": "source.frontier.arxiv-2610-04662",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/jmg.70045 names Geochronology: \"In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P–T–t paths using phase equilibria modelling, melt reintegration and in situ U–Pb titanite geochronology.\"",
+          "statement": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"",
           "scope": {
-            "population": "doi:10.1111/jmg.70045 abstract",
-            "time": "2026-07-07",
+            "population": "arXiv:2610.04662 abstract",
+            "time": "2026-10-03",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812637,34 +839658,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-jmg-70045",
-              "source_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-              "start": 2261,
-              "end": 2516,
-              "quote": "In this study, we revisit the Bay of Islands complex (BOIC) metamorphic sole in the Newfoundland Appalachian Orogen and constrain P\\u2013T\\u2013t paths using phase equilibria modelling, melt reintegration and in\\u00a0situ U\\u2013Pb titanite geochronology."
+              "source_id": "source.frontier.arxiv-2610-04662",
+              "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+              "start": 2070,
+              "end": 2210,
+              "quote": "Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70049.concept.usgs.1199",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04630.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "1d09b2a8fde228cf07762a4d90f796dfbe3df29e7f968f5f0704a525d3ee75ea",
+          "target_sha256": "6ee864e6e4d8de82908b044af002a0720e95d07b6623d4fe2f482e636efec452",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ppp-70049",
-            "target": "concept.usgs.1199",
+            "source": "claim.frontier.arxiv-2610-04630",
+            "target": "concept.eia.energy-consumption",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"",
+            "summary": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ppp-70049",
-                "url": "https://api.crossref.org/works/10.1002/ppp.70049"
+                "id": "source.frontier.arxiv-2610-04630",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/ppp.70049 names Unconsolidated deposits: \"Robust information on the current state and short‐ to mid‐term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high‐mountain regions.\"",
+          "statement": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"",
           "scope": {
-            "population": "doi:10.1002/ppp.70049 abstract",
-            "time": "2026-07-05",
+            "population": "arXiv:2610.04630 abstract",
+            "time": "2026-10-03",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812672,34 +839693,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ppp-70049",
-              "source_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-              "start": 1222,
-              "end": 1441,
-              "quote": "Robust information on the current state and short\\u2010 to mid\\u2010term evolution of permafrost in bedrock and unconsolidated deposits is therefore essential for natural hazard assessment in high\\u2010mountain regions."
+              "source_id": "source.frontier.arxiv-2610-04630",
+              "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+              "start": 2642,
+              "end": 2883,
+              "quote": "As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e162074.concept.mesh.d006803",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-04242.concept.nist.markovchain",
           "target_kind": "edge",
-          "target_sha256": "bdf0c8a46aede6e1ef7a381e7b93738729763b1a913a713125c041353d087e35",
+          "target_sha256": "ab3432af0492253188d8364f4c2abbeb3dd47209ca8f6519bb64d674cb7809e7",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-brics-econ-7-e162074",
-            "target": "concept.mesh.d006803",
+            "source": "claim.frontier.arxiv-2610-04242",
+            "target": "concept.nist.markovchain",
             "type": "related",
-            "summary": "The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+            "summary": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-                "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074"
+                "id": "source.frontier.arxiv-2610-04242",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.3897/brics-econ.7.e162074 names Human Development: \"The results reveal a stable long-term equilibrium between investment in human development and economic growth.\"",
+          "statement": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"",
           "scope": {
-            "population": "doi:10.3897/brics-econ.7.e162074 abstract",
-            "time": "2026-07-03",
+            "population": "arXiv:2610.04242 abstract",
+            "time": "2026-10-03",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812707,34 +839728,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-              "source_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-              "start": 1212,
-              "end": 1322,
-              "quote": "The results reveal a stable long-term equilibrium between investment in human development and economic growth."
+              "source_id": "source.frontier.arxiv-2610-04242",
+              "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+              "start": 2380,
+              "end": 2725,
+              "quote": "We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70289.concept.aat.300262706",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-06918.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "a2398ef052807e35173c06311bf3cf55c5c8b041da1e21046802d8a01555cd18",
+          "target_sha256": "29a8363a8bcd9d4d2eb17e2ea483a1a737c4be2458790df52abe7489f4664365",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ijal-70289",
-            "target": "concept.aat.300262706",
+            "source": "claim.frontier.arxiv-2610-06918",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"",
+            "summary": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ijal-70289",
-                "url": "https://api.crossref.org/works/10.1111/ijal.70289"
+                "id": "source.frontier.arxiv-2610-06918",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ijal.70289 names South African: \"This study explored the ambivalence of final‐year TESOL pre‐service teachers towards a non‐native‐speaking (NNS) lecturer within a historically white South African university.\"",
+          "statement": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"",
           "scope": {
-            "population": "doi:10.1111/ijal.70289 abstract",
-            "time": "2026-07-03",
+            "population": "arXiv:2610.06918 abstract",
+            "time": "2026-10-02",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812742,34 +839763,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ijal-70289",
-              "source_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-              "start": 862,
-              "end": 1057,
-              "quote": "This study explored the ambivalence of final\\u2010year TESOL pre\\u2010service teachers towards a non\\u2010native\\u2010speaking (NNS) lecturer within a historically white South African university."
+              "source_id": "source.frontier.arxiv-2610-06918",
+              "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+              "start": 2738,
+              "end": 3005,
+              "quote": "We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wpt-2026-383.concept.usgs.1308",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-03964.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "2abb8a8626986197b06bc49d0bb8bef48295b14046495b780a1200ea70c88457",
+          "target_sha256": "031719b4145d0bbc7a85ebb7be1157edb1498406bf8a5949269c5db692ed87d9",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wpt-2026-383",
-            "target": "concept.usgs.1308",
+            "source": "claim.frontier.arxiv-2610-03964",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"",
+            "summary": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wpt-2026-383",
-                "url": "https://api.crossref.org/works/10.2166/wpt.2026.383"
+                "id": "source.frontier.arxiv-2610-03964",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.2166/wpt.2026.383 names Water resources: \"Climate change poses a major threat to water resources in West Africa.\"",
+          "statement": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"",
           "scope": {
-            "population": "doi:10.2166/wpt.2026.383 abstract",
-            "time": "2026-07-01",
+            "population": "arXiv:2610.03964 abstract",
+            "time": "2026-10-02",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812777,34 +839798,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wpt-2026-383",
-              "source_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-              "start": 1075,
-              "end": 1145,
-              "quote": "Climate change poses a major threat to water resources in West Africa."
+              "source_id": "source.frontier.arxiv-2610-03964",
+              "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+              "start": 2673,
+              "end": 2875,
+              "quote": "A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-359.ology.hydrology",
+          "id": "assertion.edge.claim.frontier.arxiv-2610-03008.field.cognitive-science",
           "target_kind": "edge",
-          "target_sha256": "6d204342aacfe31e93adb6c08aeab160067eac39a6f2d313537e8b0bfe4be661",
+          "target_sha256": "6b7988527fbc5ffd579c6cc2cd51c1b1ed0041185357398ea94f41ed60034a7b",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wcc-2026-359",
-            "target": "ology.hydrology",
+            "source": "claim.frontier.arxiv-2610-03008",
+            "target": "field.cognitive-science",
             "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"",
+            "summary": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wcc-2026-359",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.359"
+                "id": "source.frontier.arxiv-2610-03008",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.2166/wcc.2026.359 names Hydrology: \"Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems.\"",
+          "statement": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"",
           "scope": {
-            "population": "doi:10.2166/wcc.2026.359 abstract",
-            "time": "2026-07-01",
+            "population": "arXiv:2610.03008 abstract",
+            "time": "2026-10-02",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812812,34 +839833,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-359",
-              "source_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-              "start": 690,
-              "end": 809,
-              "quote": "Conceptual infographic illustrating the cascade of climate-change impacts on mountain hydrology and hydropower systems."
+              "source_id": "source.frontier.arxiv-2610-03008",
+              "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+              "start": 2146,
+              "end": 2321,
+              "quote": "Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-66630-sc-2026-0009.field.mesh.d011057",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-39776.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "9e583578b5328c598c3f058ef1c173f32e6f2df7b21e79e104a4d50a26fc2dba",
+          "target_sha256": "e569cfefa8896e225ee769fcccc6d5787e6a4d11556d3d4e0e1ceb43db9c0f80",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-66630-sc-2026-0009",
-            "target": "field.mesh.d011057",
+            "source": "claim.frontier.arxiv-2609-39776",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"",
+            "summary": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-66630-sc-2026-0009",
-                "url": "https://api.crossref.org/works/10.66630/sc.2026.0009"
+                "id": "source.frontier.arxiv-2609-39776",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.66630/sc.2026.0009 names Politics: \"This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it.\"",
+          "statement": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"",
           "scope": {
-            "population": "doi:10.66630/sc.2026.0009 abstract",
-            "time": "2026-06-30",
+            "population": "arXiv:2609.39776 abstract",
+            "time": "2026-09-30",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812847,34 +839868,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-66630-sc-2026-0009",
-              "source_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-              "start": 1098,
-              "end": 1318,
-              "quote": "This article analyzes how local political contexts at the municipal and intra-ethnic community levels shape the participation of immigrant place entrepreneurs in local growth politics and their pathways of entry into it."
+              "source_id": "source.frontier.arxiv-2609-39776",
+              "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+              "start": 3138,
+              "end": 3296,
+              "quote": "The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-59588-2961-3094-1247.field.aat.300054245",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-21813.concept.nist.probesequenc",
           "target_kind": "edge",
-          "target_sha256": "c0b1b30c8c314a0566cf8948c5d4cf7f0dd226986ca607427dc17e76b880fa16",
+          "target_sha256": "7b8a7875a41ead85da7ec454cf5c43224cfaa80ac6be876dd7731e5e628466ef",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-59588-2961-3094-1247",
-            "target": "field.aat.300054245",
+            "source": "claim.frontier.arxiv-2609-21813",
+            "target": "concept.nist.probesequenc",
             "type": "related",
-            "summary": "The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"",
+            "summary": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-59588-2961-3094-1247",
-                "url": "https://api.crossref.org/works/10.59588/2961-3094.1247"
+                "id": "source.frontier.arxiv-2609-21813",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.59588/2961-3094.1247 names linguistics: \"The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it.\"",
+          "statement": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"",
           "scope": {
-            "population": "doi:10.59588/2961-3094.1247 abstract",
-            "time": "2026-06-30",
+            "population": "arXiv:2609.21813 abstract",
+            "time": "2026-09-30",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812882,34 +839903,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-59588-2961-3094-1247",
-              "source_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-              "start": 1019,
-              "end": 1374,
-              "quote": "The concept is related to creativity in literature and lingua franca English, and it is surveyed theoretically by asking how established grammatical theories (like traditional grammar, structuralism or generativism) or more recent approaches to the nature of grammar (usage-based linguistics, construction grammar, and complex systems theory) react to it."
+              "source_id": "source.frontier.arxiv-2609-21813",
+              "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+              "start": 2758,
+              "end": 2865,
+              "quote": "On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2606.field.aat.300054254",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-36354.field.ai",
           "target_kind": "edge",
-          "target_sha256": "916e012de468086bb33fdced7b20e93b8fa7c86d2407005b2701ba57c9b70c96",
+          "target_sha256": "191e7f272a45ada4cb08145a73bcb42df1e1f4e2e7b9ddaafbd3438ea9bf7a6e",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-28918-jei-v11i1-2606",
-            "target": "field.aat.300054254",
+            "source": "claim.frontier.arxiv-2609-36354",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"",
+            "summary": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606"
+                "id": "source.frontier.arxiv-2609-36354",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.28918/jei.v11i1.2606 names semiotics: \"The data were analyzed descriptively through Roland Barthes' mythological semiotics.\"",
+          "statement": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"",
           "scope": {
-            "population": "doi:10.28918/jei.v11i1.2606 abstract",
-            "time": "2026-06-30",
+            "population": "arXiv:2609.36354 abstract",
+            "time": "2026-09-28",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812917,34 +839938,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-              "source_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-              "start": 1304,
-              "end": 1388,
-              "quote": "The data were analyzed descriptively through Roland Barthes' mythological semiotics."
+              "source_id": "source.frontier.arxiv-2609-36354",
+              "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+              "start": 2203,
+              "end": 2384,
+              "quote": "Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2601.concept.mesh.d012941",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-35424.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "0be107f194b016c8c37d70402214009a3163baf456d9843a74c666589f2aec83",
+          "target_sha256": "dbc4f58751e99e4694397a21ccc362c382a612194a51ea1afc6614c19e8a0419",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-28918-jei-v11i1-2601",
-            "target": "concept.mesh.d012941",
+            "source": "claim.frontier.arxiv-2609-35424",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"",
+            "summary": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-                "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601"
+                "id": "source.frontier.arxiv-2609-35424",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.28918/jei.v11i1.2601 names Social Responsibility: \"The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students’ Islamic identity, character formation, and social responsibility.\"",
+          "statement": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"",
           "scope": {
-            "population": "doi:10.28918/jei.v11i1.2601 abstract",
-            "time": "2026-06-30",
+            "population": "arXiv:2609.35424 abstract",
+            "time": "2026-09-28",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812952,34 +839973,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-              "source_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-              "start": 2351,
-              "end": 2621,
-              "quote": "The study implies that the transformation of pesantren education through a sociological and cyber-based integrative approach not only contributes to academic advancement but also reinforces students\\u2019 Islamic identity, character formation, and social responsibility."
+              "source_id": "source.frontier.arxiv-2609-35424",
+              "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+              "start": 3194,
+              "end": 3482,
+              "quote": "To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025wr041875.concept.usgs.2027",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-35246.concept.eia.distribution-system",
           "target_kind": "edge",
-          "target_sha256": "127fdb6e32bb72f5aadbb5934b84e3038fcfe0ea63e80ff0d03b94ce8c493633",
+          "target_sha256": "58df9f39e461a31db9ae12399d63fea358f4ba08e5527bd2568fe3b98e4cd9fb",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025wr041875",
-            "target": "concept.usgs.2027",
+            "source": "claim.frontier.arxiv-2609-35246",
+            "target": "concept.eia.distribution-system",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"",
+            "summary": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025wr041875",
-                "url": "https://api.crossref.org/works/10.1029/2025wr041875"
+                "id": "source.frontier.arxiv-2609-35246",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025wr041875 names Soil moisture: \"Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm‐scale Q. Here, we build on this work by adding two additional calibration constraints based on a long‐term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products.\"",
+          "statement": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"",
           "scope": {
-            "population": "doi:10.1029/2025wr041875 abstract",
-            "time": "2026-06-30",
+            "population": "arXiv:2609.35246 abstract",
+            "time": "2026-09-28",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -812987,34 +840008,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr041875",
-              "source_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-              "start": 1594,
-              "end": 2020,
-              "quote": "Past work has shown that LSM calibration against Soil Moisture Active Passive (SMAP) surface soil moisture retrievals can ensure high precision for storm\\u2010scale Q. Here, we build on this work by adding two additional calibration constraints based on a long\\u2010term water balance and synthetic Q retrievals designed to realistically mimic the accuracy and availability of Surface Water Ocean Topography (SWOT) Q products."
+              "source_id": "source.frontier.arxiv-2609-35246",
+              "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+              "start": 2871,
+              "end": 3115,
+              "quote": "To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-006.concept.usgs.1308",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-32315.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "7b6abcdbf38434946b7530124cfecec3cc5e3dc440b5ecc7b020f8f198cd3a57",
+          "target_sha256": "beb1c296d511195cfc6709e582be598becb3d95ec3f853573bd3e028b054a9e2",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-wcc-2026-006",
-            "target": "concept.usgs.1308",
+            "source": "claim.frontier.arxiv-2609-32315",
+            "target": "field.neuroscience",
             "type": "related",
-            "summary": "The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"",
+            "summary": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-wcc-2026-006",
-                "url": "https://api.crossref.org/works/10.2166/wcc.2026.006"
+                "id": "source.frontier.arxiv-2609-32315",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.2166/wcc.2026.006 names Water resources: \"Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions.\"",
+          "statement": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"",
           "scope": {
-            "population": "doi:10.2166/wcc.2026.006 abstract",
-            "time": "2026-06-27",
+            "population": "arXiv:2609.32315 abstract",
+            "time": "2026-09-26",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813022,34 +840043,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-wcc-2026-006",
-              "source_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-              "start": 688,
-              "end": 825,
-              "quote": "Accurate estimation of groundwater recharge is essential for sustainable water resources management, particularly in data-scarce regions."
+              "source_id": "source.frontier.arxiv-2609-32315",
+              "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+              "start": 2418,
+              "end": 2680,
+              "quote": "This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jb033060.field.usgs.1176",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-29972.concept.mesh.d000088562",
           "target_kind": "edge",
-          "target_sha256": "c78ba9bbe4415aa9779e6d8709a32c302c0f94e5f48df97f7e3a9261df571d67",
+          "target_sha256": "315c9f8cbcc1fbdbc31815e10fd0fa4f8d34e33d7d2788e7852e4a6975b9b07e",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jb033060",
-            "target": "field.usgs.1176",
+            "source": "claim.frontier.arxiv-2609-29972",
+            "target": "concept.mesh.d000088562",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+            "summary": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jb033060",
-                "url": "https://api.crossref.org/works/10.1029/2025jb033060"
+                "id": "source.frontier.arxiv-2609-29972",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jb033060 names Topography: \"We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief.\"",
+          "statement": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"",
           "scope": {
-            "population": "doi:10.1029/2025jb033060 abstract",
-            "time": "2026-06-27",
+            "population": "arXiv:2609.29972 abstract",
+            "time": "2026-09-24",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813057,34 +840078,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jb033060",
-              "source_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-              "start": 2183,
-              "end": 2398,
-              "quote": "We also demonstrate that Coulomb stress changes are sensitive to the inclusion of topography in our model, particularly because the depth of the magma reservoir is similar to the amplitude of the topographic relief."
+              "source_id": "source.frontier.arxiv-2609-29972",
+              "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+              "start": 2639,
+              "end": 2709,
+              "quote": "Without therapy, the model approaches a state of persistent infection."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025ea004610.field.usgs.68",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-29832.concept.eia.motor-speed",
           "target_kind": "edge",
-          "target_sha256": "c0aaffd9374fbd38c166cb53c925891055c1b80713090808adc7ab88fd67558a",
+          "target_sha256": "bf22c5a439f3714e92fb13fb9565e9ea06c8086d586c63c79ba8e7e022c97012",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025ea004610",
-            "target": "field.usgs.68",
+            "source": "claim.frontier.arxiv-2609-29832",
+            "target": "concept.eia.motor-speed",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"",
+            "summary": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025ea004610",
-                "url": "https://api.crossref.org/works/10.1029/2025ea004610"
+                "id": "source.frontier.arxiv-2609-29832",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025ea004610 names Atmospheric sciences: \"We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context.\"",
+          "statement": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"",
           "scope": {
-            "population": "doi:10.1029/2025ea004610 abstract",
-            "time": "2026-06-27",
+            "population": "arXiv:2609.29832 abstract",
+            "time": "2026-09-24",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813092,34 +840113,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025ea004610",
-              "source_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-              "start": 1527,
-              "end": 1744,
-              "quote": "We have shown the effectiveness of information geometry in quantifying signal variability, offering a powerful framework for anomaly detection in VLF data and wider in the geophysical and atmospheric sciences context."
+              "source_id": "source.frontier.arxiv-2609-29832",
+              "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+              "start": 2930,
+              "end": 3075,
+              "quote": "Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122157.concept.usgs.1034",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-28815.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "0eb161ffb3e442b58145927d5cb36b8f85485ddd66b10d18a6ecbe9131dd0c91",
+          "target_sha256": "163b542ce76fd7e9c904972938cc8354ce361525d9b494957d2cb6a146b10252",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122157",
-            "target": "concept.usgs.1034",
+            "source": "claim.frontier.arxiv-2609-28815",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"",
+            "summary": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122157",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122157"
+                "id": "source.frontier.arxiv-2609-28815",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122157 names Sediment transport: \"We present the first large‐sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel.\"",
+          "statement": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122157 abstract",
-            "time": "2026-06-26",
+            "population": "arXiv:2609.28815 abstract",
+            "time": "2026-09-23",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813127,34 +840148,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122157",
-              "source_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-              "start": 956,
-              "end": 1095,
-              "quote": "We present the first large\\u2010sample, spatially resolved measurements of coarse sediment transport within a subglacial meltwater channel."
+              "source_id": "source.frontier.arxiv-2609-28815",
+              "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+              "start": 2932,
+              "end": 3156,
+              "quote": "We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70096.field.navigation",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-26924.field.ai",
           "target_kind": "edge",
-          "target_sha256": "ffaed2c1149b711fffb46eeb1216517acbd90e9558470c7819cdf8c9e485cdbd",
+          "target_sha256": "377fb68c2fd39f56ef2113fa4ee4c8eb6443e7358dd52af2051100057b6b8968",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-esp4-70096",
-            "target": "field.navigation",
+            "source": "claim.frontier.arxiv-2609-26924",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"",
+            "summary": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-esp4-70096",
-                "url": "https://api.crossref.org/works/10.1002/esp4.70096"
+                "id": "source.frontier.arxiv-2609-26924",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/esp4.70096 names Navigation: \"Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions.\"",
+          "statement": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"",
           "scope": {
-            "population": "doi:10.1002/esp4.70096 abstract",
-            "time": "2026-06-25",
+            "population": "arXiv:2609.26924 abstract",
+            "time": "2026-09-22",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813162,34 +840183,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70096",
-              "source_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-              "start": 863,
-              "end": 1105,
-              "quote": "Ground velocity observations generated through a time difference of Global Navigation Satellite Systems (GNSS) phase observables and orbits have been shown to be comparable to seismic recordings without clipping during intense ground motions."
+              "source_id": "source.frontier.arxiv-2609-26924",
+              "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+              "start": 14038,
+              "end": 14192,
+              "quote": "Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-bioe-70124.field.mesh.d026690",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-25847.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "8439c6d99a8732c062ad31e55f0dc6cba18a704c35f6f7c61e74dceb405ef675",
+          "target_sha256": "2424e0d6156cfe4f1377689491902acd5996b4b3650c4b24e30710126913ceed",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-bioe-70124",
-            "target": "field.mesh.d026690",
+            "source": "claim.frontier.arxiv-2609-25847",
+            "target": "concept.eia.energy-consumption",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"",
+            "summary": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-bioe-70124",
-                "url": "https://api.crossref.org/works/10.1111/bioe.70124"
+                "id": "source.frontier.arxiv-2609-25847",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/bioe.70124 names Ethics, Clinical: \"We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data‐intensive medical innovations.\"",
+          "statement": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"",
           "scope": {
-            "population": "doi:10.1111/bioe.70124 abstract",
-            "time": "2026-06-24",
+            "population": "arXiv:2609.25847 abstract",
+            "time": "2026-09-22",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813197,34 +840218,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-bioe-70124",
-              "source_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-              "start": 1225,
-              "end": 1403,
-              "quote": "We examine how different conceptual accounts of harm shape ethical decision making through examples from clinical ethics consultation and data\\u2010intensive medical innovations."
+              "source_id": "source.frontier.arxiv-2609-25847",
+              "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+              "start": 3346,
+              "end": 3606,
+              "quote": "This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-adom-71396.field.mesh.d044085",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-25701.concept.nist.polynomialtm",
           "target_kind": "edge",
-          "target_sha256": "5fd9f4b6f06c961306fb7d4c8d32df101aa5da7466e73a2dca276168b93294cd",
+          "target_sha256": "4421fe4a5d9222d92a03f8db20b48cca17bf89d9f37bdbdf3494833d57d2b402",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-adom-71396",
-            "target": "field.mesh.d044085",
+            "source": "claim.frontier.arxiv-2609-25701",
+            "target": "concept.nist.polynomialtm",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+            "summary": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-adom-71396",
-                "url": "https://api.crossref.org/works/10.1002/adom.71396"
+                "id": "source.frontier.arxiv-2609-25701",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/adom.71396 names Microfluidics: \"The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light‐driven micro‐transporters and actuators for microbiology and microfluidics.\"",
+          "statement": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"",
           "scope": {
-            "population": "doi:10.1002/adom.71396 abstract",
-            "time": "2026-06-24",
+            "population": "arXiv:2609.25701 abstract",
+            "time": "2026-09-22",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813232,34 +840253,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-adom-71396",
-              "source_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-              "start": 1885,
-              "end": 2133,
-              "quote": "The results demonstrate that inverse design guided by machine learning can substantially enhance optomechanical performance, paving the way toward efficient light\\u2010driven micro\\u2010transporters and actuators for microbiology and microfluidics."
+              "source_id": "source.frontier.arxiv-2609-25701",
+              "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+              "start": 2601,
+              "end": 2800,
+              "quote": "We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70586.concept.eia.air-collector",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-25437.concept.eia.electricity-generation",
           "target_kind": "edge",
-          "target_sha256": "d4736bd0c4e97941abcc96d00793bd4e018d89b3be2ebd63bd6343f6922d2e19",
+          "target_sha256": "283cab111ca494566a586adaa628806c46f641acc89527be8d0671a3687e85e2",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-ese3-70586",
-            "target": "concept.eia.air-collector",
+            "source": "claim.frontier.arxiv-2609-25437",
+            "target": "concept.eia.electricity-generation",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"",
+            "summary": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-ese3-70586",
-                "url": "https://api.crossref.org/works/10.1002/ese3.70586"
+                "id": "source.frontier.arxiv-2609-25437",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/ese3.70586 names Air collector: \"Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost.\"",
+          "statement": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"",
           "scope": {
-            "population": "doi:10.1002/ese3.70586 abstract",
-            "time": "2026-06-23",
+            "population": "arXiv:2609.25437 abstract",
+            "time": "2026-09-21",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813267,34 +840288,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-ese3-70586",
-              "source_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-              "start": 1101,
-              "end": 1279,
-              "quote": "Solar air collectors, which capture and convert solar radiation into thermal energy, have attracted considerable attention due to their simple structure and low maintenance cost."
+              "source_id": "source.frontier.arxiv-2609-25437",
+              "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+              "start": 2221,
+              "end": 2315,
+              "quote": "Data centers consume water for cooling (direct) and through electricity generation (indirect)."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-039.ology.stratigraphy",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-05763.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "6d6a631194a4c58ed849a3cafc47ed7e2a7d3339435fa5dfb19ed901b8883d62",
+          "target_sha256": "6e7d0e064cf7fd087a6f253f3c0cde055f45d7a82f8b38402f90473f660d58be",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1144-jgs2026-039",
-            "target": "ology.stratigraphy",
+            "source": "claim.frontier.arxiv-2609-05763",
+            "target": "concept.eia.electric-vehicle-ev",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+            "summary": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1144-jgs2026-039",
-                "url": "https://api.crossref.org/works/10.1144/jgs2026-039"
+                "id": "source.frontier.arxiv-2609-05763",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1144/jgs2026-039 names Stratigraphy: \"We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units.\"",
+          "statement": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"",
           "scope": {
-            "population": "doi:10.1144/jgs2026-039 abstract",
-            "time": "2026-06-22",
+            "population": "arXiv:2609.05763 abstract",
+            "time": "2026-09-21",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813302,34 +840323,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1144-jgs2026-039",
-              "source_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-              "start": 2040,
-              "end": 2167,
-              "quote": "We identify lower plate-derived Continental or Ocean Plate Stratigraphy, and upper plate-derived ophiolites and magmatic units."
+              "source_id": "source.frontier.arxiv-2609-05763",
+              "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+              "start": 3993,
+              "end": 4226,
+              "quote": "At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-hec-70120.concept.mesh.d057185",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-23703.field.computer-science",
           "target_kind": "edge",
-          "target_sha256": "bd8d87880c3050bd1b58d85aba0cf8ed7b269e41317d636cbabef39dcba7332b",
+          "target_sha256": "cb64767c458d409ae2997130938492ef939c060e726b9ee8624a2e9145b53680",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-hec-70120",
-            "target": "concept.mesh.d057185",
+            "source": "claim.frontier.arxiv-2609-23703",
+            "target": "field.computer-science",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"",
+            "summary": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-hec-70120",
-                "url": "https://api.crossref.org/works/10.1002/hec.70120"
+                "id": "source.frontier.arxiv-2609-23703",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/hec.70120 names Sedentary Behavior: \"T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress.\"",
+          "statement": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"",
           "scope": {
-            "population": "doi:10.1002/hec.70120 abstract",
-            "time": "2026-06-22",
+            "population": "arXiv:2609.23703 abstract",
+            "time": "2026-09-20",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813337,34 +840358,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-hec-70120",
-              "source_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-              "start": 2086,
-              "end": 2214,
-              "quote": "T21 laws increase exercise, improve diets, and reduce sedentary behavior, underage drinking, marijuana use, and mental distress."
+              "source_id": "source.frontier.arxiv-2609-23703",
+              "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+              "start": 1971,
+              "end": 2464,
+              "quote": "Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-1467-9477-70049.field.mesh.d011057",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-23199.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "1cf9cbaa2da8bcb70dda42618312a76ce3550929db788282de4de5c0e0b30148",
+          "target_sha256": "91c57e795df9ff36e5f5037ddebdf6baadb3f19537cf46a9a3e4cc32705c8de0",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-1467-9477-70049",
-            "target": "field.mesh.d011057",
+            "source": "claim.frontier.arxiv-2609-23199",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+            "summary": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-1467-9477-70049",
-                "url": "https://api.crossref.org/works/10.1111/1467-9477.70049"
+                "id": "source.frontier.arxiv-2609-23199",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/1467-9477.70049 names Politics: \"We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting.\"",
+          "statement": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"",
           "scope": {
-            "population": "doi:10.1111/1467-9477.70049 abstract",
-            "time": "2026-06-21",
+            "population": "arXiv:2609.23199 abstract",
+            "time": "2026-09-19",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813372,34 +840393,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-1467-9477-70049",
-              "source_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-              "start": 2081,
-              "end": 2414,
-              "quote": "We find that knowledge about which party belongs to which bloc, allows citizens to successfully perform the three central tasks that the political system presents them with: (1) Mastering the terminology of coalition politics, (2) knowing which parties to hold accountable, and (3) understanding the coalition implications of voting."
+              "source_id": "source.frontier.arxiv-2609-23199",
+              "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+              "start": 2628,
+              "end": 2856,
+              "quote": "Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-faam-70045.concept.mesh.d003906",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-23085.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "4d67ee429c042a8827479934aeca2ce406bf180edbefab9878249d4ee5e380b9",
+          "target_sha256": "606a75a65f1a6cd6c6e34901001d5a1176b257088e8a9c0c975a1286752da824",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-faam-70045",
-            "target": "concept.mesh.d003906",
+            "source": "claim.frontier.arxiv-2609-23085",
+            "target": "concept.eia.energy-consumption",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"",
+            "summary": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-faam-70045",
-                "url": "https://api.crossref.org/works/10.1111/faam.70045"
+                "id": "source.frontier.arxiv-2609-23085",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/faam.70045 names Developing Countries: \"However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as “unprincipled principals,” limiting citizens’ ability to hold them to account and exercising informal political control over bureaucracies.\"",
+          "statement": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"",
           "scope": {
-            "population": "doi:10.1111/faam.70045 abstract",
-            "time": "2026-06-20",
+            "population": "arXiv:2609.23085 abstract",
+            "time": "2026-09-19",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813407,34 +840428,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-faam-70045",
-              "source_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-              "start": 1216,
-              "end": 1510,
-              "quote": "However, in many developing countries, neopatrimonial governance can weaken this accountability chain, as politicians themselves may act as \\u201cunprincipled principals,\\u201d limiting citizens\\u2019 ability to hold them to account and exercising informal political control over bureaucracies."
+              "source_id": "source.frontier.arxiv-2609-23085",
+              "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+              "start": 2643,
+              "end": 2878,
+              "quote": "While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-58491-2735-4202-3413.concept.eia.leading-edge",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-22775.field.ai",
           "target_kind": "edge",
-          "target_sha256": "bd4d11377ccd6185c601c0b1836776bca0e9f373cdf77b91b6323139057754b5",
+          "target_sha256": "efe22ba3704dc06178130ab25bf44697dc09a9ac568d9065e6caf160b6f0a955",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-58491-2735-4202-3413",
-            "target": "concept.eia.leading-edge",
+            "source": "claim.frontier.arxiv-2609-22775",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"",
+            "summary": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-58491-2735-4202-3413",
-                "url": "https://api.crossref.org/works/10.58491/2735-4202.3413"
+                "id": "source.frontier.arxiv-2609-22775",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.58491/2735-4202.3413 names Leading edge: \"In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics.\"",
+          "statement": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"",
           "scope": {
-            "population": "doi:10.58491/2735-4202.3413 abstract",
-            "time": "2026-06-18",
+            "population": "arXiv:2609.22775 abstract",
+            "time": "2026-09-19",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813442,34 +840463,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-58491-2735-4202-3413",
-              "source_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-              "start": 861,
-              "end": 1036,
-              "quote": "In this study, the aerodynamic efficiency of a NACA 0015 airfoil equipped with a rotating leading edge cylinder is numerically investigated using computational fluid dynamics."
+              "source_id": "source.frontier.arxiv-2609-22775",
+              "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+              "start": 1751,
+              "end": 1926,
+              "quote": "Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121378.concept.usgs.2027",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-22615.method.nist.chinesermndr",
           "target_kind": "edge",
-          "target_sha256": "d6e676a4e791093ba60fe5c1d0072aac62c14f2b477c8da4aae866986be0ef69",
+          "target_sha256": "ef16c225ab39ae352c6ee76cc50d429483d28539edc81fc8727973c07b88434d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025gl121378",
-            "target": "concept.usgs.2027",
+            "source": "claim.frontier.arxiv-2609-22615",
+            "target": "method.nist.chinesermndr",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"",
+            "summary": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gl121378",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121378"
+                "id": "source.frontier.arxiv-2609-22615",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025gl121378 names Soil moisture: \"Seismic velocity changes (dv/v) at 2–4 Hz and 4–8 Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries.\"",
+          "statement": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"",
           "scope": {
-            "population": "doi:10.1029/2025gl121378 abstract",
-            "time": "2026-06-16",
+            "population": "arXiv:2609.22615 abstract",
+            "time": "2026-09-18",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813477,34 +840498,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121378",
-              "source_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-              "start": 1605,
-              "end": 1846,
-              "quote": "Seismic velocity changes (dv\\/v) at 2\\u20134\\u00a0Hz and 4\\u20138\\u00a0Hz are analyzed from six stations along a hillslope transect between May and November 2023 and compared to precipitation, soil moisture, and groundwater level timeseries."
+              "source_id": "source.frontier.arxiv-2609-22615",
+              "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+              "start": 1654,
+              "end": 1730,
+              "quote": "The Chinese remainder theorem (CRT) is highly sensitive to remainder errors."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-56403-nejesh-v5i2-421.field.aat.300054280",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-21966.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "66d313cca7f2bb483848de80ea3bc7f571b700d1f631817575a56e0be1be6ec1",
+          "target_sha256": "a53879bea0885fe0841074331ff28771ec205140bcf14a8e505202070118f54f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-56403-nejesh-v5i2-421",
-            "target": "field.aat.300054280",
+            "source": "claim.frontier.arxiv-2609-21966",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+            "summary": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-                "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421"
+                "id": "source.frontier.arxiv-2609-21966",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.56403/nejesh.v5i2.421 names aesthetics: \"The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect.\"",
+          "statement": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"",
           "scope": {
-            "population": "doi:10.56403/nejesh.v5i2.421 abstract",
-            "time": "2026-06-11",
+            "population": "arXiv:2609.21966 abstract",
+            "time": "2026-09-18",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813512,34 +840533,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-              "source_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-              "start": 1118,
-              "end": 1329,
-              "quote": "The results showed that visual aesthetics and brand identity consistency had a positive and significant effect on purchasing behavior, while the value of sustainability did not show a partial significant effect."
+              "source_id": "source.frontier.arxiv-2609-21966",
+              "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+              "start": 2980,
+              "end": 3218,
+              "quote": "For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata)."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123355.concept.usgs.677",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-21270.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "36fb44841b47eb8a5ba87651b67c8730535ec6d9f8bf9ea4331dcd994eb07dbf",
+          "target_sha256": "3db67063c0dd01a006e5b44fd60dc92480f7c882eeccd702337f9ff62baade62",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl123355",
-            "target": "concept.usgs.677",
+            "source": "claim.frontier.arxiv-2609-21270",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"",
+            "summary": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl123355",
-                "url": "https://api.crossref.org/works/10.1029/2026gl123355"
+                "id": "source.frontier.arxiv-2609-21270",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl123355 names Magnetic field (earth): \"In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region.\"",
+          "statement": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl123355 abstract",
-            "time": "2026-06-11",
+            "population": "arXiv:2609.21270 abstract",
+            "time": "2026-09-18",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813547,34 +840568,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl123355",
-              "source_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-              "start": 2538,
-              "end": 2705,
-              "quote": "In FLCS case, a strongly fluctuating loss cone filling ratio implies that equatorial magnetic field is inherently structured in the magnetotail in the IBe foot region."
+              "source_id": "source.frontier.arxiv-2609-21270",
+              "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+              "start": 2195,
+              "end": 2428,
+              "quote": "For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121171.concept.usgs.2277",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-21093.concept.nist.markovchain",
           "target_kind": "edge",
-          "target_sha256": "f767a8496500b340407b3f4a561a760fada083a5dbe32a371e436dae330ae8b7",
+          "target_sha256": "a8505d329f1e58fb221477806177803396b0de82973b425936c0c13b2908175d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025gl121171",
-            "target": "concept.usgs.2277",
+            "source": "claim.frontier.arxiv-2609-21093",
+            "target": "concept.nist.markovchain",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"",
+            "summary": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gl121171",
-                "url": "https://api.crossref.org/works/10.1029/2025gl121171"
+                "id": "source.frontier.arxiv-2609-21093",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025gl121171 names Carbon flux: \"), influence terrestrial carbon flux estimates within an atmospheric inversion system.\"",
+          "statement": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"",
           "scope": {
-            "population": "doi:10.1029/2025gl121171 abstract",
-            "time": "2026-06-11",
+            "population": "arXiv:2609.21093 abstract",
+            "time": "2026-09-17",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813582,34 +840603,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gl121171",
-              "source_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-              "start": 1386,
-              "end": 1472,
-              "quote": "), influence terrestrial carbon flux estimates within an atmospheric inversion system."
+              "source_id": "source.frontier.arxiv-2609-21093",
+              "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+              "start": 2204,
+              "end": 2379,
+              "quote": "We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd044617.concept.usgs.2027",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-21057.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "5ff90558ecd44c62b94d62acdb1dd66b4520eb8c7ed555f332c67fc406cd5764",
+          "target_sha256": "e0f5d506298504f027353206d0c1bf68c33e911086e2827e402fef2dbe4b2d7f",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jd044617",
-            "target": "concept.usgs.2027",
+            "source": "claim.frontier.arxiv-2609-21057",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"",
+            "summary": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd044617",
-                "url": "https://api.crossref.org/works/10.1029/2025jd044617"
+                "id": "source.frontier.arxiv-2609-21057",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jd044617 names Soil moisture: \"We examined the simulated local and remote influences of sea‐surface temperature (SST) and soil moisture depletion during the development of the 2020–2021 drought.\"",
+          "statement": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"",
           "scope": {
-            "population": "doi:10.1029/2025jd044617 abstract",
-            "time": "2026-06-10",
+            "population": "arXiv:2609.21057 abstract",
+            "time": "2026-09-17",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813617,34 +840638,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd044617",
-              "source_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-              "start": 1918,
-              "end": 2091,
-              "quote": "We examined the simulated local and remote influences of sea\\u2010surface temperature (SST) and soil moisture depletion during the development of the 2020\\u20132021 drought."
+              "source_id": "source.frontier.arxiv-2609-21057",
+              "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+              "start": 2183,
+              "end": 2620,
+              "quote": "We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-22378-he-2026-11-2-218-234.field.mesh.d049691",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-19468.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "0a270f4126c52c25ad67c5c5a5397d38bc6c8beba1634f15bd40ef0752beb0e5",
+          "target_sha256": "f78567543e793968410477d5088c29f33c9d1bd766e773987f23372d9c89c6b6",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-22378-he-2026-11-2-218-234",
-            "target": "field.mesh.d049691",
+            "source": "claim.frontier.arxiv-2609-19468",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"",
+            "summary": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-                "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234"
+                "id": "source.frontier.arxiv-2609-19468",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.22378/he.2026-11-2.218-234 names History, Medieval: \"Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars.\"",
+          "statement": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"",
           "scope": {
-            "population": "doi:10.22378/he.2026-11-2.218-234 abstract",
-            "time": "2026-06-08",
+            "population": "arXiv:2609.19468 abstract",
+            "time": "2026-09-16",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813652,34 +840673,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-              "source_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-              "start": 1762,
-              "end": 2180,
-              "quote": "Among them, the author points out the following: issues related to the medieval history of the Golden Horde; the history of the Tatars and the peoples of the Volga-Ural region; the historical and ethnological study of the Tatar community in the Russian Federation and beyond; and national education in the context of preserving and developing the Tatar language in Tatarstan and in regions densely populated by Tatars."
+              "source_id": "source.frontier.arxiv-2609-19468",
+              "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+              "start": 4076,
+              "end": 4307,
+              "quote": "Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045718.field.climatology",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-18467.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "81bf4b593e62bf06f23f54659c55a2a4a7010e3a615b1e0b01891c229aaf30e0",
+          "target_sha256": "c4fab82e170b1cbf9e3b79e5232fde587b727bb9f11b82da772c7cfb27b1dea9",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jd045718",
-            "target": "field.climatology",
+            "source": "claim.frontier.arxiv-2609-18467",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"",
+            "summary": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd045718",
-                "url": "https://api.crossref.org/works/10.1029/2025jd045718"
+                "id": "source.frontier.arxiv-2609-18467",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jd045718 names Climatology: \"The area‐averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit.\"",
+          "statement": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"",
           "scope": {
-            "population": "doi:10.1029/2025jd045718 abstract",
-            "time": "2026-06-06",
+            "population": "arXiv:2609.18467 abstract",
+            "time": "2026-09-16",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813687,34 +840708,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045718",
-              "source_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-              "start": 2166,
-              "end": 2352,
-              "quote": "The area\\u2010averaged cumulative meridional IVT near Shikoku was lower than climatology, which led to the development of a new index representing a prolonged moisture transport deficit."
+              "source_id": "source.frontier.arxiv-2609-18467",
+              "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+              "start": 2727,
+              "end": 2880,
+              "quote": "We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122664.field.usgs.1678",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-17042.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "02c99f468d924805d5a015f973306559f6f9a4e597b5bfe4b1753ddcb644131c",
+          "target_sha256": "dc02363ab3a512aa0b5ffed8f27c92367eb37f00b2a24eef608ea27cb6e724cd",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2026gl122664",
-            "target": "field.usgs.1678",
+            "source": "claim.frontier.arxiv-2609-17042",
+            "target": "field.neuroscience",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"",
+            "summary": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2026gl122664",
-                "url": "https://api.crossref.org/works/10.1029/2026gl122664"
+                "id": "source.frontier.arxiv-2609-17042",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2026gl122664 names Hydrodynamics: \"Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial‐lacustrine connectivity.\"",
+          "statement": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"",
           "scope": {
-            "population": "doi:10.1029/2026gl122664 abstract",
-            "time": "2026-06-04",
+            "population": "arXiv:2609.17042 abstract",
+            "time": "2026-09-15",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813722,34 +840743,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2026gl122664",
-              "source_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-              "start": 1596,
-              "end": 1716,
-              "quote": "Observing this nuanced hydrodynamics is challenging but critical for understanding fluvial\\u2010lacustrine connectivity."
+              "source_id": "source.frontier.arxiv-2609-17042",
+              "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+              "start": 1928,
+              "end": 2107,
+              "quote": "Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70022.concept.aat.300016586",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-16899.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "fe1caf92a5042aa1bbe148f4c4e5b82dbcb25468e13edff408626716d6342d5f",
+          "target_sha256": "4d1a267f2904efbefd538d231256be7a62d54e0c72916d5338210086996dc638",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ojoa-70022",
-            "target": "concept.aat.300016586",
+            "source": "claim.frontier.arxiv-2609-16899",
+            "target": "concept.eia.electric-vehicle-ev",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"",
+            "summary": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ojoa-70022",
-                "url": "https://api.crossref.org/works/10.1111/ojoa.70022"
+                "id": "source.frontier.arxiv-2609-16899",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ojoa.70022 names North African: \"In parallel, the study traces initial Italic olive‐oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products.\"",
+          "statement": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"",
           "scope": {
-            "population": "doi:10.1111/ojoa.70022 abstract",
-            "time": "2026-06-03",
+            "population": "arXiv:2609.16899 abstract",
+            "time": "2026-09-15",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813757,34 +840778,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70022",
-              "source_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-              "start": 1813,
-              "end": 2010,
-              "quote": "In parallel, the study traces initial Italic olive\\u2010oil imports to southern Gaul, subsequently supplanted by the predominance of Hispanic oil and the growing presence of North African products."
+              "source_id": "source.frontier.arxiv-2609-16899",
+              "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+              "start": 2179,
+              "end": 2447,
+              "quote": "This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045965.concept.usgs.64",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-16353.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "6c4c9063897ae6a898b141a7cee6e0fd38f3ec532b45563372607dec7f9e6f46",
+          "target_sha256": "acb84603179546430e891d38aa064448b5a8284b8a348f065b1dd6c08afe7bc6",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025jd045965",
-            "target": "concept.usgs.64",
+            "source": "claim.frontier.arxiv-2609-16353",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"",
+            "summary": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025jd045965",
-                "url": "https://api.crossref.org/works/10.1029/2025jd045965"
+                "id": "source.frontier.arxiv-2609-16353",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025jd045965 names Atmospheric circulation: \"The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability.\"",
+          "statement": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"",
           "scope": {
-            "population": "doi:10.1029/2025jd045965 abstract",
-            "time": "2026-06-02",
+            "population": "arXiv:2609.16353 abstract",
+            "time": "2026-09-14",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813792,34 +840813,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025jd045965",
-              "source_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-              "start": 1502,
-              "end": 1677,
-              "quote": "The dependence of aeolian dust transport on atmospheric circulation patterns allows dust preserved in Antarctic ice cores to serve as a proxy for past circulation variability."
+              "source_id": "source.frontier.arxiv-2609-16353",
+              "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+              "start": 2957,
+              "end": 3069,
+              "quote": "We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-jssr-70066.concept.mesh.d033303",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-16258.field.ai",
           "target_kind": "edge",
-          "target_sha256": "3e5976917c5b790368d1d974a27f09d3cbf1a25df85337389fba3ad8dcdbdfae",
+          "target_sha256": "92e3ea398d60b8181e350a7fc507e2786a249a283c7c40e7fd4636caa7cd737d",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-jssr-70066",
-            "target": "concept.mesh.d033303",
+            "source": "claim.frontier.arxiv-2609-16258",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"",
+            "summary": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-jssr-70066",
-                "url": "https://api.crossref.org/works/10.1111/jssr.70066"
+                "id": "source.frontier.arxiv-2609-16258",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/jssr.70066 names Protestantism: \"After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions.\"",
+          "statement": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"",
           "scope": {
-            "population": "doi:10.1111/jssr.70066 abstract",
-            "time": "2026-05-30",
+            "population": "arXiv:2609.16258 abstract",
+            "time": "2026-09-14",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813827,34 +840848,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-jssr-70066",
-              "source_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-              "start": 1580,
-              "end": 1779,
-              "quote": "After combining Protestantism and Catholicism into a single Christian religion and restricting it to those who believe very much, 16.3% of respondents still report believing in two or more religions."
+              "source_id": "source.frontier.arxiv-2609-16258",
+              "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+              "start": 1913,
+              "end": 2025,
+              "quote": "As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025wr042846.concept.usgs.1298",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-05749.field.ai",
           "target_kind": "edge",
-          "target_sha256": "7c64ab102e2304ef497beb71c4b095efc3af1ece01aea65af08f0bdae44df2aa",
+          "target_sha256": "c475703a6ecff61ca298de935ce8c0ef2cda50e1e008b981c40d25bfd6942474",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025wr042846",
-            "target": "concept.usgs.1298",
+            "source": "claim.frontier.arxiv-2609-05749",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"",
+            "summary": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025wr042846",
-                "url": "https://api.crossref.org/works/10.1029/2025wr042846"
+                "id": "source.frontier.arxiv-2609-05749",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025wr042846 names Water chemistry: \"C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input.\"",
+          "statement": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"",
           "scope": {
-            "population": "doi:10.1029/2025wr042846 abstract",
-            "time": "2026-05-30",
+            "population": "arXiv:2609.05749 abstract",
+            "time": "2026-09-13",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813862,34 +840883,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025wr042846",
-              "source_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-              "start": 3351,
-              "end": 3583,
-              "quote": "C, and water chemistry) in the loess tableland have shown that groundwater Ca and Mg were derived mainly from the dissolution of continental carbonates in loess, and that Na was derived from cation exchange beyond atmospheric input."
+              "source_id": "source.frontier.arxiv-2609-05749",
+              "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+              "start": 2033,
+              "end": 2221,
+              "quote": "Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-jbgs-e185535.concept.usgs.1034",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-14022.field.ai",
           "target_kind": "edge",
-          "target_sha256": "48286c10a085c1e1a41c8a7789715e82866bebb61935da0d5299d6599c1d3bf2",
+          "target_sha256": "2bd61cee696276e68f780d1c4c4c517d0ade4408b4e61d9081d6250691311734",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-jbgs-e185535",
-            "target": "concept.usgs.1034",
+            "source": "claim.frontier.arxiv-2609-14022",
+            "target": "field.ai",
             "type": "related",
-            "summary": "The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"",
+            "summary": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-jbgs-e185535",
-                "url": "https://api.crossref.org/works/10.3897/jbgs.e185535"
+                "id": "source.frontier.arxiv-2609-14022",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.3897/jbgs.e185535 names Sediment transport: \"Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems.\"",
+          "statement": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"",
           "scope": {
-            "population": "doi:10.3897/jbgs.e185535 abstract",
-            "time": "2026-05-29",
+            "population": "arXiv:2609.14022 abstract",
+            "time": "2026-09-12",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813897,34 +840918,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-jbgs-e185535",
-              "source_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-              "start": 594,
-              "end": 809,
-              "quote": "Soil erosion and sediment transport represent major environmental challenges in semi-arid Mediterranean watersheds, where high erosion rates do not necessarily translate into high sediment delivery to river systems."
+              "source_id": "source.frontier.arxiv-2609-14022",
+              "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+              "start": 4982,
+              "end": 5211,
+              "quote": "We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70082.ology.stratigraphy",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-12866.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "9136b4d300f08beb1d489ccc8eebbd2ffbd214562355dd5a70ce12d84a0e3a42",
+          "target_sha256": "4e8b03a5a7eddd16128d4d382011bea7682b89c9857ee693f78c55dbda771c12",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-esp4-70082",
-            "target": "ology.stratigraphy",
+            "source": "claim.frontier.arxiv-2609-12866",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"",
+            "summary": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-esp4-70082",
-                "url": "https://api.crossref.org/works/10.1002/esp4.70082"
+                "id": "source.frontier.arxiv-2609-12866",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/esp4.70082 names Stratigraphy: \"Simulated surface‐to‐borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography.\"",
+          "statement": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"",
           "scope": {
-            "population": "doi:10.1002/esp4.70082 abstract",
-            "time": "2026-05-29",
+            "population": "arXiv:2609.12866 abstract",
+            "time": "2026-09-11",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813932,34 +840953,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-esp4-70082",
-              "source_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-              "start": 1528,
-              "end": 1713,
-              "quote": "Simulated surface\\u2010to\\u2010borehole transfer functions are extracted from 1D and 2D site response models to show their sensitivity to subsurface stratigraphy and surface topography."
+              "source_id": "source.frontier.arxiv-2609-12866",
+              "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+              "start": 2723,
+              "end": 2899,
+              "quote": "Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-184711.field.mesh.d019021",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-12486.concept.nist.decisionproblem",
           "target_kind": "edge",
-          "target_sha256": "80e19af92bd242dbbf60ad386fc52424d0b30502bb187f314ca416e678725c7f",
+          "target_sha256": "45a9486b1a9bac493b7b6c275a536973d2f3f27983815be5ae7e519f2dd86214",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-3897-nhcm-3-184711",
-            "target": "field.mesh.d019021",
+            "source": "claim.frontier.arxiv-2609-12486",
+            "target": "concept.nist.decisionproblem",
             "type": "related",
-            "summary": "The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"",
+            "summary": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-3897-nhcm-3-184711",
-                "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711"
+                "id": "source.frontier.arxiv-2609-12486",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.3897/nhcm.3.184711 names Natural History: \"In this study, we compile and consolidate all available data on the herpetofauna of São Tomé & Príncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database.\"",
+          "statement": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"",
           "scope": {
-            "population": "doi:10.3897/nhcm.3.184711 abstract",
-            "time": "2026-05-28",
+            "population": "arXiv:2609.12486 abstract",
+            "time": "2026-09-11",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -813967,34 +840988,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-3897-nhcm-3-184711",
-              "source_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-              "start": 1141,
-              "end": 1415,
-              "quote": "In this study, we compile and consolidate all available data on the herpetofauna of S\\u00e3o Tom\\u00e9 &amp; Pr\\u00edncipe from bibliography, natural history collections and citizen science platforms, with the goal of creating the most comprehensive and up-to-date database."
+              "source_id": "source.frontier.arxiv-2609-12486",
+              "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+              "start": 2643,
+              "end": 2821,
+              "quote": "In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1029-2025gc012776.concept.usgs.562",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-12016.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "b89f637ce4d43910084e45cdb864a4b8106ad8cf50bbb2189d7e3797874362db",
+          "target_sha256": "6685b270171c85d8f3defc3bb0debaf20efbd6238372294a6edeef992ae38fb5",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1029-2025gc012776",
-            "target": "concept.usgs.562",
+            "source": "claim.frontier.arxiv-2609-12016",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"",
+            "summary": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1029-2025gc012776",
-                "url": "https://api.crossref.org/works/10.1029/2025gc012776"
+                "id": "source.frontier.arxiv-2609-12016",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1029/2025gc012776 names Hydrothermal processes: \"This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc‐backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes.\"",
+          "statement": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"",
           "scope": {
-            "population": "doi:10.1029/2025gc012776 abstract",
-            "time": "2026-05-28",
+            "population": "arXiv:2609.12016 abstract",
+            "time": "2026-09-10",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -814002,34 +841023,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1029-2025gc012776",
-              "source_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-              "start": 2498,
-              "end": 2814,
-              "quote": "This relative spatial shift in magma, vent, and fluid distribution reflects the progressive reorganization of magmatic and hydrothermal activity within an arc\\u2010backarc transitional setting, making Healy a relevant case study for examining relative feedback among magmatic, structural, and hydrothermal processes."
+              "source_id": "source.frontier.arxiv-2609-12016",
+              "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+              "start": 2518,
+              "end": 2870,
+              "quote": "We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1002-joc-70436.concept.usgs.1308",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-11530.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "59b83d6fa078d5e53746bca6919a52e4e4d4f4c818c80fe94e80c0d053720860",
+          "target_sha256": "f0da5d2ffbd8cff94f8825e3401d0bfb310ea6240e5c8eb94b6c2aa4899f12fc",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1002-joc-70436",
-            "target": "concept.usgs.1308",
+            "source": "claim.frontier.arxiv-2609-11530",
+            "target": "field.neuroscience",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"",
+            "summary": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1002-joc-70436",
-                "url": "https://api.crossref.org/works/10.1002/joc.70436"
+                "id": "source.frontier.arxiv-2609-11530",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1002/joc.70436 names Water resources: \"Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability.\"",
+          "statement": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"",
           "scope": {
-            "population": "doi:10.1002/joc.70436 abstract",
-            "time": "2026-05-26",
+            "population": "arXiv:2609.11530 abstract",
+            "time": "2026-09-10",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -814037,34 +841058,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1002-joc-70436",
-              "source_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-              "start": 2586,
-              "end": 2733,
-              "quote": "Under climate warming, the associated decline in freezing depth thereby heightens the vulnerability of TRSR water resources to climate variability."
+              "source_id": "source.frontier.arxiv-2609-11530",
+              "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+              "start": 3122,
+              "end": 3362,
+              "quote": "Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-191.concept.usgs.2027",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-08218.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "cb78de2c5c59b64a639be3807d30dc8db002e5c4585648d8fda386878813ea3b",
+          "target_sha256": "6e0a91e51501b51399997367025186f6057485022a9985818f24ff4e53c10504",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-2166-hydro-2026-191",
-            "target": "concept.usgs.2027",
+            "source": "claim.frontier.arxiv-2609-08218",
+            "target": "concept.nist.lowerbound",
             "type": "related",
-            "summary": "The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"",
+            "summary": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-2166-hydro-2026-191",
-                "url": "https://api.crossref.org/works/10.2166/hydro.2026.191"
+                "id": "source.frontier.arxiv-2609-08218",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.2166/hydro.2026.191 names Soil moisture: \"Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability.\"",
+          "statement": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"",
           "scope": {
-            "population": "doi:10.2166/hydro.2026.191 abstract",
-            "time": "2026-05-23",
+            "population": "arXiv:2609.08218 abstract",
+            "time": "2026-09-09",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -814072,34 +841093,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-2166-hydro-2026-191",
-              "source_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-              "start": 690,
-              "end": 830,
-              "quote": "Graphical abstract showing soil moisture estimation using- soil moisture, ET and precipitation data integration and sensor interoperability."
+              "source_id": "source.frontier.arxiv-2609-08218",
+              "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+              "start": 1964,
+              "end": 2181,
+              "quote": "While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70020.concept.aat.300019275",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-06163.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "faacbfc608af0c619ee3a7e31fa779eda86d9156d8a8c4c07ecd4b3919680be1",
+          "target_sha256": "e479c14bdbe532ba60fd14e19a47504001d9389860f07b71e6052b43bcaf5df7",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-ojoa-70020",
-            "target": "concept.aat.300019275",
+            "source": "claim.frontier.arxiv-2609-06163",
+            "target": "concept.nist.optimization",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"",
+            "summary": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-ojoa-70020",
-                "url": "https://api.crossref.org/works/10.1111/ojoa.70020"
+                "id": "source.frontier.arxiv-2609-06163",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/ojoa.70020 names Bronze Age: \"During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia.\"",
+          "statement": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"",
           "scope": {
-            "population": "doi:10.1111/ojoa.70020 abstract",
-            "time": "2026-05-06",
+            "population": "arXiv:2609.06163 abstract",
+            "time": "2026-09-05",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -814107,34 +841128,34 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-ojoa-70020",
-              "source_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-              "start": 905,
-              "end": 1036,
-              "quote": "During the Bronze Age, a particular type of podomorphic petroglyph was produced on the outcrops by the sea in southern Scandinavia."
+              "source_id": "source.frontier.arxiv-2609-06163",
+              "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+              "start": 2054,
+              "end": 2213,
+              "quote": "To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law."
             }
           ]
         },
         {
-          "id": "assertion.edge.claim.frontier.doi-10-1111-phpr-70116.field.aat.300054245",
+          "id": "assertion.edge.claim.frontier.arxiv-2609-06066.concept.nist.performance",
           "target_kind": "edge",
-          "target_sha256": "f90b2271ec0cc36862ffdac2e4fcc49642970d725c3b22a9bbdd1232e9f0cd1a",
+          "target_sha256": "7b30dc4d838d3cd29f68470c4e6b7d1a7ef2a4f1e1d897aa549d73f5d8d473a1",
           "canonical_record": {
-            "source": "claim.frontier.doi-10-1111-phpr-70116",
-            "target": "field.aat.300054245",
+            "source": "claim.frontier.arxiv-2609-06066",
+            "target": "concept.nist.performance",
             "type": "related",
-            "summary": "The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"",
+            "summary": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"",
             "sources": [
               {
-                "id": "source.frontier.doi-10-1111-phpr-70116",
-                "url": "https://api.crossref.org/works/10.1111/phpr.70116"
+                "id": "source.frontier.arxiv-2609-06066",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"
               }
             ]
           },
-          "statement": "The retained abstract of doi:10.1111/phpr.70116 names linguistics: \"This article argues that we can best address these questions about function by attending to work in empirical linguistics.\"",
+          "statement": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"",
           "scope": {
-            "population": "doi:10.1111/phpr.70116 abstract",
-            "time": "2026-05-03",
+            "population": "arXiv:2609.06066 abstract",
+            "time": "2026-09-05",
             "assumptions": "Topical relation only: the abstract names the existing concept",
             "uncertainty": "No dependency, derivation, support or novelty claim",
             "units": null,
@@ -814142,1964 +841163,1725 @@
           },
           "support": [
             {
-              "source_id": "source.frontier.doi-10-1111-phpr-70116",
-              "source_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-              "start": 1165,
-              "end": 1287,
-              "quote": "This article argues that we can best address these questions about function by attending to work in empirical linguistics."
+              "source_id": "source.frontier.arxiv-2609-06066",
+              "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+              "start": 1782,
+              "end": 2005,
+              "quote": "Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings."
             }
           ]
-        }
-      ],
-      "decisions": [
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ecot-70052",
-          "target_kind": "node",
-          "target_sha256": "c899742980882616404009a6abec94408aca042dd1f705b2bc1e086745fd64fd",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.358939+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70333",
-          "target_kind": "node",
-          "target_sha256": "0d872817b56073a0487518b3bc1ce9d91303a7a2b95c379f932c4b829e96d01c",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pwat-0000557",
-          "target_kind": "node",
-          "target_sha256": "acfd84fb6f4873de8802a73f2217016c75d4c458af05a657ce165e0cbc4a3e69",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-medu-70340",
-          "target_kind": "node",
-          "target_sha256": "bb1ad60f76ca539f0eaddce73315fda163fc3cbd2a166cf3283d6f6ea6f0ff96",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124622",
-          "target_kind": "node",
-          "target_sha256": "54435a5873a0dae64e7d1d0aebed146e0326f931218584537aa411be511d4864",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-15351-2373-8456-1235",
-          "target_kind": "node",
-          "target_sha256": "8a4aee6e2d44b62fa0465aa821d46866d28889942e6aed85c22555321eacd664",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-15351-2373-8456-1216",
-          "target_kind": "node",
-          "target_sha256": "40afce297647ad12205133127c3319b158fd1df3ee3886e812a0ea0efe63d9fa",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl125301",
-          "target_kind": "node",
-          "target_sha256": "d19887697cf45eb1d4573ba253ec980e43f5eed329f166e5b1327be08d2d11cb",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.359936+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-21425-fob-19-142560",
-          "target_kind": "node",
-          "target_sha256": "cf17d8f389e5875801d8f5cf2ce79502a98179aa447f0df28b5ed7b1e5ebf093",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001044",
-          "target_kind": "node",
-          "target_sha256": "f020444798aafbba9657c13abf36e5e7c1c64342c3f6d77e5c0abff16072a051",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000886",
-          "target_kind": "node",
-          "target_sha256": "c9838c9666550a04a54d9f52056b1f085e9469af4b418c7c39cfdcf3e95f80c2",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1075-consl-25020-lia",
-          "target_kind": "node",
-          "target_sha256": "cb466f2887c76ab0f65c645be4f04d8d5628017f8509b150fa17e138dd5c1e4d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-hydro-2026-040",
-          "target_kind": "node",
-          "target_sha256": "b1d5eb93f830b9db9de13c37903d40a49fd2241fcc77b157811712804ad5c3ac",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-lol2-70186",
-          "target_kind": "node",
-          "target_sha256": "ed4a7c3ee5de681986a3ae5f899173ec642ef8662f832b596144e7ccf408e1e3",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124411",
-          "target_kind": "node",
-          "target_sha256": "4cd1070aee40475dd6d06e6ab0fadb7be7d587e75c98038196ec75776733f3e7",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70629",
-          "target_kind": "node",
-          "target_sha256": "07388bfa91d146b7ee6a7175ac28f177abcbe1486d17a5754798edda9c6f9c13",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9566-70277",
-          "target_kind": "node",
-          "target_sha256": "8b84360c3005120ef6218b79707ddae1550335e913b7e5f1c386fce38285274a",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.360934+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-jpln-70129",
-          "target_kind": "node",
-          "target_sha256": "3f5813936443ab3880eb08ee6845a959024d90004dd31b164dccb6450ad90ca1",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70613",
-          "target_kind": "node",
-          "target_sha256": "5ae2bb018f8d4930b105adbef2018ddeb2c471bb66c6a7454e3f0ae271790bab",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70605",
-          "target_kind": "node",
-          "target_sha256": "f969e55d7c3e65b0676f9835895931ab3d6471800d5488f68cb1597f9fb7117b",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-3176-arch-2026-2-03",
-          "target_kind": "node",
-          "target_sha256": "2495efad9f9a77db5bf334eea5bd7e3697fddf6aee3e0bae571c91368a1a9e7c",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-580",
-          "target_kind": "node",
-          "target_sha256": "a2f38d5d973db76df05f11e9a92569f1f8c2a4aa4275eab073df4cfc645305b6",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ijop-70275",
-          "target_kind": "node",
-          "target_sha256": "8e9f43b3daab1bb74b6712f04d7c38700f3040e429d218368d71b9c931568a53",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-popecon-10-e186220",
-          "target_kind": "node",
-          "target_sha256": "03dfad1db21ae9317989100b6d225ff2460bb5e9cb429523270d194fa91a7925",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-507",
-          "target_kind": "node",
-          "target_sha256": "150fad11eb2e58a265d6665b1f952ef191f154aa3847e5e54c38454da52997cc",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.361931+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e183393",
-          "target_kind": "node",
-          "target_sha256": "458f34a98afbe1278fb0922f2f52872afd9354a4432e893b2bfd2c2c18a63cc1",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026785",
-          "target_kind": "node",
-          "target_sha256": "aeb97dadafba774c077aa5a3d076f944d7fed8e7a8641eb17d04508753123883",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124090",
-          "target_kind": "node",
-          "target_sha256": "ff8032e649311f9d6684fed35770e8d72d39748fdd2007c2a4447279d30f7694",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-pei3-70207",
-          "target_kind": "node",
-          "target_sha256": "f6d7126485d10cb3fbc702ba0aba310b5fcc9fa3b8bfceef62d1ab470ecf9015",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-fea2-70077",
-          "target_kind": "node",
-          "target_sha256": "00a3f58f94358f52d1e397868c353d4f68fc570c98987e0769690dc1bc93bf0d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-eet-70146",
-          "target_kind": "node",
-          "target_sha256": "89ca0ddd58ec8af408cc3a57606875c8d864099fc124cd4e52120fa7daba6e69",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-eco-70279",
-          "target_kind": "node",
-          "target_sha256": "23af879371e74778a932bdcf86a5fcdae9a05278f15e12a59bdad6a33129bc75",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124233",
-          "target_kind": "node",
-          "target_sha256": "c990db21bb02ac6e1f64fbb7c329e9c84dd0175e1b37292bfaffe5bd873886dd",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gc013127",
-          "target_kind": "node",
-          "target_sha256": "df6bf646bb406fc1b577ed3edf05d6bea2c933a7385138811808492a8c675c3c",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.362928+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70320",
-          "target_kind": "node",
-          "target_sha256": "5f923eb3d0e3c0730ba2550114be65407656d8a42918dfb55a22e1d9b2ccf8eb",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01",
-          "target_kind": "node",
-          "target_sha256": "6e2955f97e76639fbd05e444881a97014480f5ef5a67398572dc2150383e1ee6",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-erats-20261281",
-          "target_kind": "node",
-          "target_sha256": "a073a252ea3c9d4507d0d7f9530801416fe69b7dab0e22f6dafc4730cd13a867",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-eco-70277",
-          "target_kind": "node",
-          "target_sha256": "932d496ffc8bba319734c20d8eb9e41e733da81a9ae1d43dec6405e09d5dbdc7",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-iroh-70046",
-          "target_kind": "node",
-          "target_sha256": "fb87d188bb97aa410ae1b72a1aded942e7039c590781b39f5497fc8be7f0d390",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-erats-20261284",
-          "target_kind": "node",
-          "target_sha256": "15126bb3d4b80e72fb46ff22060bdca616c4bc847566be7945e5ab1c88619af3",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ruso-70070",
-          "target_kind": "node",
-          "target_sha256": "746a1fc813452f4bc12e782e380e8cb1e83267ca7592751d3276202a85c343dd",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-200681",
-          "target_kind": "node",
-          "target_sha256": "a4c954c03c3dc0424d87d0f8b842eff9fc895bef3f503ddb3beb01736694d49b",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.363926+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001005",
-          "target_kind": "node",
-          "target_sha256": "22c95cb1e3ffd0ece2d730ec4a4bfd8b35f8d1250ef94abce79123983e19f32b",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-moth-70148",
-          "target_kind": "node",
-          "target_sha256": "59a080cf2527877e5c33e0b5a87ee37803dbac66af884c55be3b875773bb2066",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-20267724",
-          "target_kind": "node",
-          "target_sha256": "413fb72410ec625ca9ca098fe999385c3c9624ba042c7845822e788da8fcb41d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124881",
-          "target_kind": "node",
-          "target_sha256": "0e805f7ff2cf9b4e84fc48accb8792ba130588942398377add6a0f1421798a2d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jh001578",
-          "target_kind": "node",
-          "target_sha256": "6139790797c0d1ae8499bfc6f7b9bc51463294b1600010c991c30d6cdecc8204",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-gdj3-70104",
-          "target_kind": "node",
-          "target_sha256": "0ea9efcdb5d7f7cae91f70c5f75b9ea3cf67c1a8ef09518e933f4175c15a0973",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122610",
-          "target_kind": "node",
-          "target_sha256": "27aacbd05e369f29387cd7a2e4eea82b687c2a65ed4b89232758ab785d137863",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70308",
-          "target_kind": "node",
-          "target_sha256": "0fa42e72c19a4c09d0231d49d041f0b7ae1cd295ff1f5960b6fc6736461d54c2",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-55730-1300-0632-4281",
-          "target_kind": "node",
-          "target_sha256": "1021403cc9e13bde2e0326d54d3fe51e56aeae42a0ee408feaed5809172cc998",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.364923+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-55730-1300-0632-4275",
-          "target_kind": "node",
-          "target_sha256": "4a8892407dae357550fbfdbd86a9e01ae61c3705d15da7e7c42abd73cd2f0ad4",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-eet-70139",
-          "target_kind": "node",
-          "target_sha256": "e42f5af90a591ea76fd929813fb2a101f6b708a61553844e4d425148719ef4e8",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-jclp-70212",
-          "target_kind": "node",
-          "target_sha256": "47d977b3ddf6d692aaf1d2aa0d195cdd39520a1994076a85336d4daeffbec240",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-12944-cwe-21-2-3",
-          "target_kind": "node",
-          "target_sha256": "946573dec97981d8f200d79bdffcda3a25c83c8d70b786bfa1e6081090c36178",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-bse-71470",
-          "target_kind": "node",
-          "target_sha256": "99f8f40d2f518f635ee207ed4e3fba7f4588b9070378efd9f377833a5cf7daba",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000986",
-          "target_kind": "node",
-          "target_sha256": "05cae79791020ebe011272a629f57fadd9175883f2f54963e1851e140c2fde7e",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-1752-1688-70151",
-          "target_kind": "node",
-          "target_sha256": "7813c951684e4468892f37bc30c7bcde11e8f6c335ae6ff6c22e74ee2ca96f9e",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
-        },
-        {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-jade-70048",
-          "target_kind": "node",
-          "target_sha256": "709b81bab1516c34a8944c0aceacb59f4abf8b6aba2d6b5e258558ffa0709287",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
-          },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.365920+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-lcrp-70059",
-          "target_kind": "node",
-          "target_sha256": "8a2d4bb62d0d43292879ca744d344b526c57050d5ea1c9fe4fade2b00167deda",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2609-02071.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "4cfe605897e390c799b63c35f692212d14a04a4806d6b3cd7a5115922e99296e",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2609-02071",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2609-02071",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"",
+          "scope": {
+            "population": "arXiv:2609.02071 abstract",
+            "time": "2026-09-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2609-02071",
+              "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+              "start": 2033,
+              "end": 2333,
+              "quote": "Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-77938",
-          "target_kind": "node",
-          "target_sha256": "ecbe1c0119aa9beb49bb472fc414e94a9232147524a41f685b61df459d57f266",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-31034.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "6469c11264b897b8bde5a73f2edec03e0a1c588afbfc284ed653bc8c7945482a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-31034",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-31034",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"",
+          "scope": {
+            "population": "arXiv:2608.31034 abstract",
+            "time": "2026-08-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-31034",
+              "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+              "start": 2734,
+              "end": 2874,
+              "quote": "This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e185197",
-          "target_kind": "node",
-          "target_sha256": "97eab97ad1625a070380fca8217d3192b4737f1f7eb018a5e4a780691e00db9f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-28387.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "c344811fedbaa657e44717a3c3b940b4eb8023beb4ab5e5c5a96b737b5e5b2f2",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-28387",
+            "target": "concept.eia.energy-consumption",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-28387",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"",
+          "scope": {
+            "population": "arXiv:2608.28387 abstract",
+            "time": "2026-08-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-28387",
+              "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+              "start": 3499,
+              "end": 3646,
+              "quote": "We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl125327",
-          "target_kind": "node",
-          "target_sha256": "f67886ee0901f383640fdc6af4bd815f1a88f81b0adfb7291f11b96fb8eb2b13",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-27536.concept.nist.prisonersdilemma",
+          "target_kind": "edge",
+          "target_sha256": "b2707737e921a6fbb0c79211136a4dbde8956099a28f7edb3fc5d03870cfccbf",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-27536",
+            "target": "concept.nist.prisonersdilemma",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-27536",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"",
+          "scope": {
+            "population": "arXiv:2608.27536 abstract",
+            "time": "2026-08-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-27536",
+              "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+              "start": 2876,
+              "end": 3056,
+              "quote": "We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70302",
-          "target_kind": "node",
-          "target_sha256": "a5daec029c63e95a1c3f0a85b4676dcac7ad1366bb714d865261bc3cc1af294c",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-26093.concept.nist.stronglynp",
+          "target_kind": "edge",
+          "target_sha256": "b3cf9974b37f96d386e302ddb803ca413610a16848a0c640a818e44da753693a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-26093",
+            "target": "concept.nist.stronglynp",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-26093",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"",
+          "scope": {
+            "population": "arXiv:2608.26093 abstract",
+            "time": "2026-08-26",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-26093",
+              "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+              "start": 2952,
+              "end": 3077,
+              "quote": "The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000930",
-          "target_kind": "node",
-          "target_sha256": "4391670001d55393deb190b39b125c10a5d03a4c148885c1713016e1de39eed9",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-24219.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "703e50164da0b2c328fb37231a5694babe35cb61e368b0419251b3c7822cca26",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-24219",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-24219",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"",
+          "scope": {
+            "population": "arXiv:2608.24219 abstract",
+            "time": "2026-08-25",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-24219",
+              "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+              "start": 2154,
+              "end": 2304,
+              "quote": "Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsnr-2026-0030",
-          "target_kind": "node",
-          "target_sha256": "2ff5646876dd7cf0504f4ee7aa5df12a5827f0108f5ed6bd8022022f0fde215d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-23972.concept.nist.temporllogic",
+          "target_kind": "edge",
+          "target_sha256": "c980908a69eb80889b8d50c897ebc814992bf331142df148cbd1871afb1afeda",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-23972",
+            "target": "concept.nist.temporllogic",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-23972",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"",
+          "scope": {
+            "population": "arXiv:2608.23972 abstract",
+            "time": "2026-08-25",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-23972",
+              "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+              "start": 2616,
+              "end": 2833,
+              "quote": "In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL)."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-cli2-70062",
-          "target_kind": "node",
-          "target_sha256": "97b20c7b152e3c3498f9307f9cd70cc4fc781535496db6ca824273d0640507d8",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-21764.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "0c294df3d3df9371e5aa59f98ea8b7d28efdb23a29865542346269ca84abab1a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-21764",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-21764",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"",
+          "scope": {
+            "population": "arXiv:2608.21764 abstract",
+            "time": "2026-08-22",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-21764",
+              "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+              "start": 2344,
+              "end": 2567,
+              "quote": "Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
-          "target_kind": "node",
-          "target_sha256": "167968c5487a3a2d63809c9215eca013a58046b5c50a978e376a64e79cddbc11",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-21020.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "4c1958798424d6ce7c08d3873dd9256e508955bf39a6d258f465727d30aa9d77",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-21020",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-21020",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.366917+00:00"
+          "statement": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"",
+          "scope": {
+            "population": "arXiv:2608.21020 abstract",
+            "time": "2026-08-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-21020",
+              "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+              "start": 2930,
+              "end": 3251,
+              "quote": "For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70852",
-          "target_kind": "node",
-          "target_sha256": "b3b4981ebf949347576690949e4efd1d5542f13e78b7c6e4065e519cc15b6b3d",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-20723.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "c2289649c6cf69228a1c90be937e8ae5589479e679af228e392cb239fa412b28",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-20723",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-20723",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"",
+          "scope": {
+            "population": "arXiv:2608.20723 abstract",
+            "time": "2026-08-21",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-20723",
+              "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+              "start": 1649,
+              "end": 1863,
+              "quote": "Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70845",
-          "target_kind": "node",
-          "target_sha256": "0459d52dae6202048453674e7539748a055598fb81529c684a178d4d2db99f99",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-19416.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "a21938cf8a1590f99d08d60ba27c7119d0c7fc714caf04d3b3aaa70bf89ef9f9",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-19416",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-19416",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"",
+          "scope": {
+            "population": "arXiv:2608.19416 abstract",
+            "time": "2026-08-19",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-19416",
+              "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+              "start": 2790,
+              "end": 3003,
+              "quote": "Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0001039",
-          "target_kind": "node",
-          "target_sha256": "1797f28da9e635c78885a5292ba375fd9b05fa57bec163eeb7ad582da96e5b7f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-18396.method.nist.exhaustivesearch",
+          "target_kind": "edge",
+          "target_sha256": "aab173a9fcbbd48c97021e62280e35f3e8e1c25e037d150ff125fdd6e4a776df",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-18396",
+            "target": "method.nist.exhaustivesearch",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-18396",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"",
+          "scope": {
+            "population": "arXiv:2608.18396 abstract",
+            "time": "2026-08-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-18396",
+              "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+              "start": 3795,
+              "end": 4040,
+              "quote": "In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-nup-70114",
-          "target_kind": "node",
-          "target_sha256": "39e7e583ad91c899535afc9090d9e424881b8963e31f8aa53980c2f4542a5382",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-18060.concept.nist.temporllogic",
+          "target_kind": "edge",
+          "target_sha256": "b19cc33589da1559e42d207434e94d82dc55ac110d7e08da0ffebedaa6b8a809",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-18060",
+            "target": "concept.nist.temporllogic",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-18060",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"",
+          "scope": {
+            "population": "arXiv:2608.18060 abstract",
+            "time": "2026-08-18",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-18060",
+              "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+              "start": 2305,
+              "end": 2538,
+              "quote": "Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejss-70414",
-          "target_kind": "node",
-          "target_sha256": "8eef2c4640458267cf61bf03f9e388380f4ae6e0dd4347de4b3f94c80ab7de3f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-16290.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "512a70d80f87f194c3df5c9c537a2d8bc1c3a5bf8f92910b9ed01607d6942f85",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-16290",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-16290",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"",
+          "scope": {
+            "population": "arXiv:2608.16290 abstract",
+            "time": "2026-08-17",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-16290",
+              "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+              "start": 2298,
+              "end": 2393,
+              "quote": "We develop tractable solutions to the resulting non-convex optimization problems in both cases."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026wr044293",
-          "target_kind": "node",
-          "target_sha256": "1e49be6aa2ba28ac291c0db268f9d900f4aeac4652b5dcf0eb6f819b84d3629a",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-12037.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "214ebd4c84a748434ac58377b4a2ccc72decbc188724bca8918dadd711b285d3",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-12037",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-12037",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"",
+          "scope": {
+            "population": "arXiv:2608.12037 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-12037",
+              "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+              "start": 3116,
+              "end": 3333,
+              "quote": "By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp-70399",
-          "target_kind": "node",
-          "target_sha256": "d276aea75a93573515ec73a9f1bb8b483caa5dd00dae4490ab112c7a2edaee3f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-11929.concept.eia.compressor-station",
+          "target_kind": "edge",
+          "target_sha256": "7561c8ecfeb18de87d0aea47feaae39ed4801fb30437502e3bf74e8e9806e80f",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-11929",
+            "target": "concept.eia.compressor-station",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-11929",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"",
+          "scope": {
+            "population": "arXiv:2608.11929 abstract",
+            "time": "2026-08-12",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-11929",
+              "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+              "start": 1823,
+              "end": 2001,
+              "quote": "The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs)."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-jqs-70108",
-          "target_kind": "node",
-          "target_sha256": "03f0b2421318c13287ed8b988e030e79730a9d2f7b6f57b7d4f7be42f609ec38",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-11175.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "7a693e17499f81aec0ca1fd2c35cada8a172f44319b3a00438a6153b0606bdc6",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-11175",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-11175",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"",
+          "scope": {
+            "population": "arXiv:2608.11175 abstract",
+            "time": "2026-08-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-11175",
+              "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+              "start": 2668,
+              "end": 2848,
+              "quote": "Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jd046723",
-          "target_kind": "node",
-          "target_sha256": "2aafd4fd3b0ca6a291ba91ec36a3cc652e3de78e1953febae44e5d2c5135d560",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-10825.concept.eia.electric-vehicle-ev",
+          "target_kind": "edge",
+          "target_sha256": "d1d635c0a1bcdb4c0f1db54a20e6a73f385267f18b870da07ca5b9d4c1044452",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-10825",
+            "target": "concept.eia.electric-vehicle-ev",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-10825",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.367915+00:00"
+          "statement": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"",
+          "scope": {
+            "population": "arXiv:2608.10825 abstract",
+            "time": "2026-08-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-10825",
+              "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+              "start": 2154,
+              "end": 2399,
+              "quote": "Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-msd2-70089",
-          "target_kind": "node",
-          "target_sha256": "ff896932e901389d4c8cf6a95c5346b4586402514c2f4df84fa7968efe070f7f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-08151.method.nist.dynamicprog",
+          "target_kind": "edge",
+          "target_sha256": "8375f9e8c99efeda5e4c4e7b034c1fa6e25b1a162a9b1e7fdb16e882f7b53703",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-08151",
+            "target": "method.nist.dynamicprog",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-08151",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"",
+          "scope": {
+            "population": "arXiv:2608.08151 abstract",
+            "time": "2026-08-11",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-08151",
+              "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+              "start": 2586,
+              "end": 2715,
+              "quote": "We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70342",
-          "target_kind": "node",
-          "target_sha256": "5283976eb7325f6d975165df6ee495c112422ee0887368d701ca64f3c5add006",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-10254.method.nist.modelcheckng",
+          "target_kind": "edge",
+          "target_sha256": "4c75b855e62c55ca4e91c3bc1ea2d5410e3907a3cacffdf41f4f264e25467e4f",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-10254",
+            "target": "method.nist.modelcheckng",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-10254",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"",
+          "scope": {
+            "population": "arXiv:2608.10254 abstract",
+            "time": "2026-08-10",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-10254",
+              "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+              "start": 2169,
+              "end": 2391,
+              "quote": "Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-cli2-70059",
-          "target_kind": "node",
-          "target_sha256": "e1b471abf38ce27c8149ecb1e4569ed4ca277c53e045fa673b318e0f628a27f9",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-08599.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "808b2a621e821096c72fb8476b36e7a090c41c06e5233a3b7e3bec1d2770926a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-08599",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-08599",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"",
+          "scope": {
+            "population": "arXiv:2608.08599 abstract",
+            "time": "2026-08-09",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-08599",
+              "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+              "start": 2686,
+              "end": 2856,
+              "quote": "Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124727",
-          "target_kind": "node",
-          "target_sha256": "ccfb2a129ee24b3a6489612d9b84d81407c90375f31b065a6dee4a3e0227a471",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-12398.ology.psycholinguistics",
+          "target_kind": "edge",
+          "target_sha256": "47064720765e88ee9d08ab468fb49ef034550b6c6d2cbd9ecb7e8b1a5895af92",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-12398",
+            "target": "ology.psycholinguistics",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-12398",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"",
+          "scope": {
+            "population": "arXiv:2608.12398 abstract",
+            "time": "2026-08-08",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-12398",
+              "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+              "start": 2620,
+              "end": 3064,
+              "quote": "We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000877",
-          "target_kind": "node",
-          "target_sha256": "26e943260c3bb22a338102bf11c4c229e76b1d019299973bff0eda218edaaa59",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-07289.concept.nist.formalmethod",
+          "target_kind": "edge",
+          "target_sha256": "289e593bf0fbf059d169503b92cf9f57511e680fb993c177bc7ef92734e488b9",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-07289",
+            "target": "concept.nist.formalmethod",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-07289",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"",
+          "scope": {
+            "population": "arXiv:2608.07289 abstract",
+            "time": "2026-08-07",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-07289",
+              "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+              "start": 3351,
+              "end": 3478,
+              "quote": "We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-jmg-70054",
-          "target_kind": "node",
-          "target_sha256": "ab0ca5c7d8215f36b3f96d07add1bff628181ad03380f3da260c5990532d5b1a",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-05481.field.neuroscience",
+          "target_kind": "edge",
+          "target_sha256": "cf3fda85ae9b09c913d9bb6a4c2fec06f4e8362d8490cd9f8ab9053c3d2f6a87",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-05481",
+            "target": "field.neuroscience",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-05481",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"",
+          "scope": {
+            "population": "arXiv:2608.05481 abstract",
+            "time": "2026-08-06",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-05481",
+              "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+              "start": 2885,
+              "end": 3056,
+              "quote": "Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-moth-70134",
-          "target_kind": "node",
-          "target_sha256": "e00e11ab51837f0489465957e0e78c86c32bfb903c7034ba5b478ce4610c693b",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-05348.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "f3ea82218ae3052d3429755f89d53971c9b5f77558fd60eef0e064403b958e61",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-05348",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-05348",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"",
+          "scope": {
+            "population": "arXiv:2608.05348 abstract",
+            "time": "2026-08-05",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-05348",
+              "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+              "start": 2619,
+              "end": 2720,
+              "quote": "Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-gwat-70098",
-          "target_kind": "node",
-          "target_sha256": "e2ffb61f8a859e8fd1c96ac98ba01be951bdbd3b4599753effa3c1d768cc8997",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-12393.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "60a107037b3c0eb81f37f81291d8bbf7aa943002a13d2e13ea296f828c121d7f",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-12393",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-12393",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.368912+00:00"
+          "statement": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"",
+          "scope": {
+            "population": "arXiv:2608.12393 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-12393",
+              "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+              "start": 1881,
+              "end": 2039,
+              "quote": "This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wp-2026-018",
-          "target_kind": "node",
-          "target_sha256": "616e659f6173f6f9e1ee396a74524d5cda67304b01ed57a91f6c2cdf8cbfc3fa",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-04227.method.nist.fastfouriertransform",
+          "target_kind": "edge",
+          "target_sha256": "8ed69d55fdb5b95c09777f7e1b31a29d5dd0cfb373da6380f7a02da4972cf0f2",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-04227",
+            "target": "method.nist.fastfouriertransform",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-04227",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"",
+          "scope": {
+            "population": "arXiv:2608.04227 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-04227",
+              "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+              "start": 3151,
+              "end": 3293,
+              "quote": "Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsta-2025-0107",
-          "target_kind": "node",
-          "target_sha256": "5ba11b8db55e335857acd07bc179ac0daf52cde3500ebe8524756b4dd5d7fcea",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-04133.concept.nist.globaloptimum",
+          "target_kind": "edge",
+          "target_sha256": "4214fb7acd0542bee40e304d02cf792375660285164aeef7c884500c8b2a9938",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-04133",
+            "target": "concept.nist.globaloptimum",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-04133",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"",
+          "scope": {
+            "population": "arXiv:2608.04133 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-04133",
+              "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+              "start": 3310,
+              "end": 3616,
+              "quote": "For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000931",
-          "target_kind": "node",
-          "target_sha256": "f074240df47721dc6bfbdc383c4ece688c9bd5dbf3a76847bc4e637d043b6408",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-03967.concept.nist.flownetwork",
+          "target_kind": "edge",
+          "target_sha256": "95b2484dfa2aced1d9942ea260e3c6c695d4cc5951df58ac2d43a1525b624453",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-03967",
+            "target": "concept.nist.flownetwork",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-03967",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"",
+          "scope": {
+            "population": "arXiv:2608.03967 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-03967",
+              "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+              "start": 1698,
+              "end": 1922,
+              "quote": "Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122646",
-          "target_kind": "node",
-          "target_sha256": "fadfbea70e81d9bc9708a79769da09a9a6afc6c1acf07dc54498420e51a2759f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-02978.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "e22d048069a65e640909a4b53418e20e14ae1dfe4a7685654b1d1910e7dd2d3a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-02978",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-02978",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"",
+          "scope": {
+            "population": "arXiv:2608.02978 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-02978",
+              "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+              "start": 2404,
+              "end": 2520,
+              "quote": "To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70058",
-          "target_kind": "node",
-          "target_sha256": "7d164c252922852307aecf82cdf3d51384bbd769b8656def08e486f5e3fa01f6",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-02976.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "e850ed8fbf6081e494abcd7db3d0b39a6c1d3f37b177b1637b1d22bccbbf1db4",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-02976",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-02976",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"",
+          "scope": {
+            "population": "arXiv:2608.02976 abstract",
+            "time": "2026-08-04",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-02976",
+              "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+              "start": 2789,
+              "end": 2957,
+              "quote": "Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-jpln-70107",
-          "target_kind": "node",
-          "target_sha256": "7caec28a5f79904fabf4c5acb9a7e00d8efc698de019e19b5f0672048665f6b1",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-02244.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "ec2ec977c984bbdf843bbd4b4745245a4aa4a8ad96e29efcd67180ea82329591",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-02244",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-02244",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"",
+          "scope": {
+            "population": "arXiv:2608.02244 abstract",
+            "time": "2026-08-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-02244",
+              "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+              "start": 2593,
+              "end": 2669,
+              "quote": "We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-187529",
-          "target_kind": "node",
-          "target_sha256": "f995881565f05db0b212c013e45536465d5c82362c442a2a37f9b5c553d65459",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-02079.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "8ae1d0f7a8abeedc5df1c8bce2388b6b420df12620aba5ef7f9dd583fb52bc7a",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-02079",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-02079",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"",
+          "scope": {
+            "population": "arXiv:2608.02079 abstract",
+            "time": "2026-08-03",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-02079",
+              "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+              "start": 2962,
+              "end": 3213,
+              "quote": "In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026775",
-          "target_kind": "node",
-          "target_sha256": "77d8fd44d1d49ddc371b70a5e78fd7f56fd6e50f44b0074910bab18bc99cf9eb",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-01220.concept.nist.objective",
+          "target_kind": "edge",
+          "target_sha256": "43619f6d7a045a771908e00af450692c742ca67cc73510275a7c1acc1db88142",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-01220",
+            "target": "concept.nist.objective",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-01220",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"",
+          "scope": {
+            "population": "arXiv:2608.01220 abstract",
+            "time": "2026-08-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-01220",
+              "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+              "start": 3044,
+              "end": 3195,
+              "quote": "However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-38159-ehass-2026774",
-          "target_kind": "node",
-          "target_sha256": "d6f10658405d185f8e1681f66c1e1593e6be20e81f983de94605620f57a82977",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2608-00959.concept.nist.optimization",
+          "target_kind": "edge",
+          "target_sha256": "d2d69b51a25be679a0f88fd54516cbdc59bf6db5ab347406ac0e9874b1d61708",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2608-00959",
+            "target": "concept.nist.optimization",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2608-00959",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.369909+00:00"
+          "statement": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"",
+          "scope": {
+            "population": "arXiv:2608.00959 abstract",
+            "time": "2026-08-02",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2608-00959",
+              "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+              "start": 1653,
+              "end": 1901,
+              "quote": "Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-hec-70140",
-          "target_kind": "node",
-          "target_sha256": "362c8742b04f7b46ac64a409263ac52f8d2510ccab52e734c440a20b65d50781",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-17248.concept.eia.fuel-cell",
+          "target_kind": "edge",
+          "target_sha256": "fc4ce603abbaeec2b32528a796137d174c61996f364c01fa86641ba77748ffad",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-17248",
+            "target": "concept.eia.fuel-cell",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-17248",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"",
+          "scope": {
+            "population": "arXiv:2607.17248 abstract",
+            "time": "2026-07-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-17248",
+              "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+              "start": 2438,
+              "end": 2696,
+              "quote": "This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-tox-70177",
-          "target_kind": "node",
-          "target_sha256": "91b5eba28359f7aee9e6a4a07e2f1450da71689334ace373f0ec6a8bf1de7e61",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-14144.concept.nist.lowerbound",
+          "target_kind": "edge",
+          "target_sha256": "13b1f66d6251859aaff1e3088c41bdb3790c5b1f6278cc6f3ab18a4f0df1f4ac",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-14144",
+            "target": "concept.nist.lowerbound",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-14144",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"",
+          "scope": {
+            "population": "arXiv:2607.14144 abstract",
+            "time": "2026-07-31",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-14144",
+              "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+              "start": 3465,
+              "end": 3703,
+              "quote": "We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-77585",
-          "target_kind": "node",
-          "target_sha256": "9ad0029131f34b9ceaa77f3a8f33ab62e9a216dad09469f2708c7bbe5db7f51b",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-28833.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "3045e82524ebcf5ac402e50609708476eb9b69656329cfbeee0808515bde16e8",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-28833",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-28833",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"",
+          "scope": {
+            "population": "arXiv:2607.28833 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-28833",
+              "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+              "start": 2179,
+              "end": 2332,
+              "quote": "Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9566-70245",
-          "target_kind": "node",
-          "target_sha256": "c5cf402730750a47a7a770312509f9b93a556d2c14e47636d91809efc715bb7e",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-28780.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "c2cdf65f5782bd43858e6f67eacfd2d2905d4c746a83c68ae0c98df3e2c56bb9",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-28780",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-28780",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"",
+          "scope": {
+            "population": "arXiv:2607.28780 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-28780",
+              "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+              "start": 1965,
+              "end": 2219,
+              "quote": "As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70337",
-          "target_kind": "node",
-          "target_sha256": "b9767987c6cf8eb732a1e22870bbd60b688b5ea2d37c1c2d4aaeb6a4e403ae27",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-28276.field.ai",
+          "target_kind": "edge",
+          "target_sha256": "c836745b9325a50b496305c349d0c62bc1ba72d55dad0aa2e7080a15298b3298",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-28276",
+            "target": "field.ai",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-28276",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"",
+          "scope": {
+            "population": "arXiv:2607.28276 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-28276",
+              "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+              "start": 2865,
+              "end": 2975,
+              "quote": "We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl123821",
-          "target_kind": "node",
-          "target_sha256": "7dbc92b200702547607024be1de7289f698d5298da3a9d788be3946ac22d3c7c",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-28185.concept.nist.markovchain",
+          "target_kind": "edge",
+          "target_sha256": "7247de10d649c29f02f8ba3dde98a69cd50cfff569a853bd1ef15d731462b9ce",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-28185",
+            "target": "concept.nist.markovchain",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-28185",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"",
+          "scope": {
+            "population": "arXiv:2607.28185 abstract",
+            "time": "2026-07-30",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-28185",
+              "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+              "start": 2222,
+              "end": 2430,
+              "quote": "Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-qj-70252",
-          "target_kind": "node",
-          "target_sha256": "0d2ec90d7c004965336849e7dc4a9cca620c05fb97297819be281f3398bd44c3",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-26209.concept.eia.energy-consumption",
+          "target_kind": "edge",
+          "target_sha256": "012e7154904336a6c812f26df174dc238d94d3066cd6956c2f0c2feee7270335",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-26209",
+            "target": "concept.eia.energy-consumption",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-26209",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"",
+          "scope": {
+            "population": "arXiv:2607.26209 abstract",
+            "time": "2026-07-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-26209",
+              "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+              "start": 2517,
+              "end": 2863,
+              "quote": "Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70540",
-          "target_kind": "node",
-          "target_sha256": "d876068aefa7381aa2f986142c22efcbafe2993bbbf4713b88261bc077c983d8",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-25526.field.mesh.d011057",
+          "target_kind": "edge",
+          "target_sha256": "13a7308d44eadbdc71d6c1e5dc8e0743fd361d0ae6a4427b66dfa0f943ed067d",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-25526",
+            "target": "field.mesh.d011057",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-25526",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"",
+          "scope": {
+            "population": "arXiv:2607.25526 abstract",
+            "time": "2026-07-28",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-25526",
+              "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+              "start": 2524,
+              "end": 2808,
+              "quote": "The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-eje-70266",
-          "target_kind": "node",
-          "target_sha256": "886110cc7d95f58e26c930ac1620956e8bbdb97b1d6e95fd32272d8079037f9e",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-25081.concept.mesh.d006803",
+          "target_kind": "edge",
+          "target_sha256": "2a847c4fe8b507efbb8886852a3a06a1e6e969b5cdb4f86574220edb358d3098",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-25081",
+            "target": "concept.mesh.d006803",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-25081",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.370907+00:00"
+          "statement": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"",
+          "scope": {
+            "population": "arXiv:2607.25081 abstract",
+            "time": "2026-07-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-25081",
+              "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+              "start": 2867,
+              "end": 3117,
+              "quote": "Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ecpo-70064",
-          "target_kind": "node",
-          "target_sha256": "5c628e321072d92bdddb037299368d574089a8d7b72ec2196ef5dd56a257863e",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-24423.concept.eia.electric-vehicle-ev",
+          "target_kind": "edge",
+          "target_sha256": "4a89f727fd4a08a7a0096bd759f8a736a467bf34d4e34d11f3a741a599dab7f9",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-24423",
+            "target": "concept.eia.electric-vehicle-ev",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-24423",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "statement": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"",
+          "scope": {
+            "population": "arXiv:2607.24423 abstract",
+            "time": "2026-07-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-24423",
+              "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+              "start": 2442,
+              "end": 2627,
+              "quote": "Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-beer-70139",
-          "target_kind": "node",
-          "target_sha256": "91fb84abd87d634139d456232d28bb71e3a86475bb7f25045429ddad58f58980",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-24360.concept.mesh.d000067656",
+          "target_kind": "edge",
+          "target_sha256": "d5991652168ebd297d5d091f5fc17f526800adbd9595875bca77a6f47a96a411",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-24360",
+            "target": "concept.mesh.d000067656",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-24360",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "statement": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"",
+          "scope": {
+            "population": "arXiv:2607.24360 abstract",
+            "time": "2026-07-27",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-24360",
+              "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+              "start": 2753,
+              "end": 2889,
+              "quote": "Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1098-rsta-2025-0029",
-          "target_kind": "node",
-          "target_sha256": "af8ac57849b011cf7ad6e60ef5b4f7f43180db05f33d14383df76270acf25e10",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.edge.claim.frontier.arxiv-2607-22049.concept.mesh.d007391",
+          "target_kind": "edge",
+          "target_sha256": "a351ec73293102ed74aaf3671a0cb241b2da6599ee54758b449e66e6d4ecf8a4",
+          "canonical_record": {
+            "source": "claim.frontier.arxiv-2607-22049",
+            "target": "concept.mesh.d007391",
+            "type": "related",
+            "summary": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"",
+            "sources": [
+              {
+                "id": "source.frontier.arxiv-2607-22049",
+                "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"
+              }
+            ]
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "statement": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"",
+          "scope": {
+            "population": "arXiv:2607.22049 abstract",
+            "time": "2026-07-24",
+            "assumptions": "Topical relation only: the abstract names the existing concept",
+            "uncertainty": "No dependency, derivation, support or novelty claim",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-22049",
+              "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+              "start": 2705,
+              "end": 3107,
+              "quote": "These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124661",
-          "target_kind": "node",
-          "target_sha256": "120d5021d1bf0c3ec0ee755ea9a89d44105671c38b4d7733c01a4e1bb93fc16f",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+          "target_kind": "taxonomy",
+          "target_sha256": "b6ab60ec7d1556ff04676c0184bcc18437e404635016be97498097e9b0c6c738",
+          "canonical_record": {
+            "id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+            "parent": "concept.nist.temporllogic",
+            "child": "claim.frontier.arxiv-2610-15934",
+            "type": "narrower"
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "statement": "The retained abstract of arXiv:2610.15934 classifies its contribution as a Temporal Logic (temporal logic): \"We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor.\"",
+          "confidence": 0.8,
+          "scope": {
+            "population": "arXiv:2610.15934 contribution",
+            "time": "2026-10-11",
+            "assumptions": "The abstract itself classifies the work as a kind of the parent concept; navigation ancestry only",
+            "uncertainty": "Source-attributed classification; not a claim of novelty or quality",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2610-15934",
+              "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+              "start": 2138,
+              "end": 2510,
+              "quote": "We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor."
+            }
+          ]
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jc023581",
-          "target_kind": "node",
-          "target_sha256": "297c72011a9be269947e359261441d96b665b9afac0cc13f4b710a1272afc2f5",
-          "outcome": "supported",
-          "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
-          "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
-          "checks": {
-            "exact_quote_verbatim": true,
-            "source_not_botcheck": true
+          "id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+          "target_kind": "taxonomy",
+          "target_sha256": "7256abd61eb75435360413241497b4f6393c4cd36bb27da608dd4d0a0758bf93",
+          "canonical_record": {
+            "id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+            "parent": "concept.nist.semidefinite",
+            "child": "claim.frontier.arxiv-2607-28224",
+            "type": "narrower"
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
-          "reviewer_id": "code:nemesis-provenance/1",
-          "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
-          "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
-        },
+          "statement": "The retained abstract of arXiv:2607.28224 classifies its contribution as a semidefinite programming (semidefinite programming): \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"",
+          "confidence": 0.8,
+          "scope": {
+            "population": "arXiv:2607.28224 contribution",
+            "time": "2026-07-30",
+            "assumptions": "The abstract itself classifies the work as a kind of the parent concept; navigation ancestry only",
+            "uncertainty": "Source-attributed classification; not a claim of novelty or quality",
+            "units": null,
+            "quantifiers": "This publication only"
+          },
+          "support": [
+            {
+              "source_id": "source.frontier.arxiv-2607-28224",
+              "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+              "start": 2490,
+              "end": 2801,
+              "quote": "First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions."
+            }
+          ]
+        }
+      ],
+      "decisions": [
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jb032632",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-21653",
           "target_kind": "node",
-          "target_sha256": "9f96cf8c93c7db4cb362f8cde4c9b887b6f5cd22c7b9a7255263f2d6a9def062",
+          "target_sha256": "d10e242f57d4e8911cbb6626598c479b5d9fb04da16b40c1d106c5afd59a72d9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816107,17 +842889,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70526",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-19722",
           "target_kind": "node",
-          "target_sha256": "386007d2450ca9b0bf6898dede90d1f16698fcae96c58a46c3935532f08764ce",
+          "target_sha256": "a8dd47064ed088694cb7ee9d06a2648af1e7b0d1fbe824decab526d1ca8f81a9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816125,17 +842907,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-saje-70032",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-19515",
           "target_kind": "node",
-          "target_sha256": "14cd64b8681589ba4d64ef37712305269d9789c187279de679c9903d596ed6ba",
+          "target_sha256": "bc36f7c70ac332a0c225156aca2db0261613a4c3ebe26917c84bbe0d333ade50",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816143,17 +842925,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.371904+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl124111",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-19137",
           "target_kind": "node",
-          "target_sha256": "2a1cb84b35a71dc359e79efc288b4dbeda7c9449cbc9b9cb1687eb81774bcf30",
+          "target_sha256": "09401a3ea268f6e991bb1235be758edaaf9a7fedc97c1f65562d42e1ff71dba4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816161,17 +842943,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70772",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-17295",
           "target_kind": "node",
-          "target_sha256": "d675549ea9aba2caed1ba6424bf137c7eb27b2f03345674048d66a4464686fea",
+          "target_sha256": "258d145622ca057cff6f93b00ad958c34febb57b99ce8bf0ce7bdff897f7d141",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816179,17 +842961,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122539",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-16273",
           "target_kind": "node",
-          "target_sha256": "cfcba1e3e5b3628586a03c6d9ee36c942e9f5279c6880df3a59ceb7c3dce02b1",
+          "target_sha256": "abec13a7138c2ba0031c3c27d7bf86d76d14145eaf07fe0459c331a693ca2367",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816197,17 +842979,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70310",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-16259",
           "target_kind": "node",
-          "target_sha256": "4ef02a5db4578cdf194c74cc9a04dfab974b3606687b0380cfac34f80e7617a0",
+          "target_sha256": "49058552123e75c929a955f283eca0a07258c3e78ac13caca148d8134b204663",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816215,17 +842997,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-adfm-76901",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-15934",
           "target_kind": "node",
-          "target_sha256": "cc0312da0fb70263d40c3873bef61fdc3b3f9bcd82ae3f3f468fbef900e0efa4",
+          "target_sha256": "db269a5e349cef256a5d35a3cc98311c81e5233fbb732f72a56f62b5d01bfd00",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816233,17 +843015,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-nzm2-70056",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-15072",
           "target_kind": "node",
-          "target_sha256": "b2c84605c03023188bb6bfae04fbadd0d0f396b6a28e669be64f79cf6cc431bf",
+          "target_sha256": "2202e4fba0fef0adbfffb5263a7bc935d004b4ed16d72bdb11fb868e0884f957",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816251,17 +843033,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1144-jgs2026-026",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-15052",
           "target_kind": "node",
-          "target_sha256": "1eec10139d7c5d26a48547b08664aa1d560353ae3c24910f217caf8287ef4f06",
+          "target_sha256": "0e3a409e37368e61d1934fb7914817e87920ade4bb52f91410543bd22aa7049e",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816269,17 +843051,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ejed-70766",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-13424",
           "target_kind": "node",
-          "target_sha256": "a93639795d4591325a42d4a13dc4bf5b7e81bf6a4b17c33cc333c5221e819c76",
+          "target_sha256": "7fd68d524cf3d375403bd0389a9102fcd5b849bc87b65345f29ff6b9520bbcf8",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816287,17 +843069,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-sce-70090",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-13402",
           "target_kind": "node",
-          "target_sha256": "7b1a6c9e0ae9d0f5c4119ec0219f546e39e22d697c30fe3d93db581df50337fc",
+          "target_sha256": "e285ae55ff03e8b9e1b4ca3e9b041f363f37f4f7dcf5a5393adb43323c720b49",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816305,17 +843087,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.372902+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70053",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-12779",
           "target_kind": "node",
-          "target_sha256": "20ed2e1c5ea108cee0d55d2c76eb5773a4de4dd4be497f1b031848d4e8f559a5",
+          "target_sha256": "0a200f89117c4ea885fb92d9afa96d2e7d7d182295a3692c61b89e36f100518d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816323,17 +843105,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ese3-70603",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-12604",
           "target_kind": "node",
-          "target_sha256": "e89a2dbf2c8d732bb1958a20627d1d026a932868a5e4c542852855f451daf95a",
+          "target_sha256": "6dcaef89852aeb2edfb2adc04ae2c4909e6411ad977b12fa8f8ec8c436befca5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816341,17 +843123,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd046190",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-12592",
           "target_kind": "node",
-          "target_sha256": "e30c0b56aa1becf63ea07efcf478b207a8971512ddf8766637fedc6266e2a8b8",
+          "target_sha256": "8380fa2096717d776a89ef4c3ad492c5fed1d514dae0765acccecf4507522cd3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816359,17 +843141,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121323",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-12038",
           "target_kind": "node",
-          "target_sha256": "e8bce13d5ab62c4d01b94ccebef95a7875582f81497026b598d11b9f1c08cbe7",
+          "target_sha256": "ec13f9f86b5c1bc03a718e7b995a3a59562425a615d9fa13d6020ef08ccfcab7",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816377,17 +843159,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ijfe-70259",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-11869",
           "target_kind": "node",
-          "target_sha256": "4e108ecfcf754ef69366f63e6b86a525d027913da2ad58fb6dc1b57295f561d9",
+          "target_sha256": "104824c9bc6d60ddd5a41780eb1897630158af4f1439f0be39b07494895010f7",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816395,17 +843177,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1371-journal-pclm-0000696",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-11359",
           "target_kind": "node",
-          "target_sha256": "b4bba41aa9d7d75eae3d8537b90f32cb8aed691d1ccdedcf843243937054962a",
+          "target_sha256": "ef2bb7a5097b6ae986fc47841ce396d2c9fbe30195e3e73a5fec64050fafdee9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816413,17 +843195,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-aphw-70185",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04959",
           "target_kind": "node",
-          "target_sha256": "ad701611dfa3341fd90fda44dabf79bb78723b369de366deb9c21fd86ad79b0a",
+          "target_sha256": "60803abde49981b3e9b515f13c3ec84a0dd2b7a33767e4841de7fa7eb61e4153",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816431,17 +843213,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026jh001250",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-09266",
           "target_kind": "node",
-          "target_sha256": "d1dc7cab2c169b8ab79e4cd4a232d131e65e09884cd1f462103a50f8a4e9f882",
+          "target_sha256": "fdd9b401372df0dbb49a1d2bf4e09b6e34a692866c08d6774d7fb696ee261765",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816449,17 +843231,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122518",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-09080",
           "target_kind": "node",
-          "target_sha256": "d1367c7979a351cf546ff16bf41db52355d0e4719ba16671b9d3fb9dfdf20516",
+          "target_sha256": "0c3a9ae37aecef4ef7a9939bb97f945686dce9d6fe36f0350d4fb9fcc35badb5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816467,17 +843249,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.373899+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e172739",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-09010",
           "target_kind": "node",
-          "target_sha256": "6059487ad3a4d072c90c832c89c6d6f912095de04131d3cc074a4ffc7bf54263",
+          "target_sha256": "c01171a7378737c5492419b63a6668029115d5d11b8913c81e55b38fab25e949",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816485,17 +843267,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-jmg-70045",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-08744",
           "target_kind": "node",
-          "target_sha256": "0e995b896ce564cc3e806bc44979953406b20619114014b261385bb7a2a00658",
+          "target_sha256": "d94b8ceb803f23d37998dc793883f64d4110c56a071339d7f27d629ce51cd53a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816503,17 +843285,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ppp-70049",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-07616",
           "target_kind": "node",
-          "target_sha256": "7d44a36aadc4be7c04696221004983014b7a980d1868fc81158975cd5fcccda9",
+          "target_sha256": "d6f577c6e767b6a3d5dff779e57b0cec93ec5198c9c36efaaf2dbeb35c1ae950",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816521,17 +843303,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-brics-econ-7-e162074",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-07307",
           "target_kind": "node",
-          "target_sha256": "b30c2471cfbb8289189b730a1fc88de9682003913490317c9cadb791880655bb",
+          "target_sha256": "e717ce32d00a85ef8fa8159b789a4cdbe0f6b9a395412689002cb57f96b7c736",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816539,17 +843321,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ijal-70289",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-06601",
           "target_kind": "node",
-          "target_sha256": "a335225d9f3c5f49e7df4e2a2129684a1157c560364bad8a5f16d1db5df967f8",
+          "target_sha256": "e08ebb0c4834db59eeadb6300fd9ea46ee16d77838acbe39e48dff4b98eeb018",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816557,17 +843339,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wpt-2026-383",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04776",
           "target_kind": "node",
-          "target_sha256": "704a66268263dd1875a836bc9a05cd70b82e4c07fe1622a02d100db450d4b614",
+          "target_sha256": "51232f01e536c301d3c9507922fd51d0207c8f39dc571ceff9df1974cca740c2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816575,17 +843357,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-359",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04697",
           "target_kind": "node",
-          "target_sha256": "22e49215fcb3d9e7b57c5118d37bd9389d0b5652eed7269e96d6d06a50eb6abe",
+          "target_sha256": "ba68b962702ca2a36672b8439d35ccfa89a80b48aeef8b95aed892c80911b788",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816593,17 +843375,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-66630-sc-2026-0009",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04662",
           "target_kind": "node",
-          "target_sha256": "5be95c351b87fa53dfc5ee4c7bbefb3cd4e86ca403790fa2c64f84165a51e5ec",
+          "target_sha256": "1197384dd2bdaeaa27e6a1e2d3d7a19447d2b4c296430bce44eb7b8692631fb3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816611,17 +843393,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.374896+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-59588-2961-3094-1247",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04630",
           "target_kind": "node",
-          "target_sha256": "92a46561863906c27a7a7714993e0b0c35c9514e421fa843c18c5e2f1021da17",
+          "target_sha256": "55024c472b37b3c38ae899c1bfe3976e3d6a17e3bce51137a4015acebeba897a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816629,17 +843411,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2606",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-04242",
           "target_kind": "node",
-          "target_sha256": "892787e8841782a4c2b3090c927606306351450aca3a28c0be6e24f53ff1530d",
+          "target_sha256": "a9a0ffb810b154d47ba126e2ae200c97999c6308914a1190664cddc15f0e5acb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816647,17 +843429,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-28918-jei-v11i1-2601",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-06918",
           "target_kind": "node",
-          "target_sha256": "4157d22abf0555dc98f5ef96e7ebc64d2cb34965de239d0185e0d6d69c1c9d00",
+          "target_sha256": "8264a8cd0ed245884f4313ac000543134882ef2c91953504f5ca8c09b00c19c5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816665,17 +843447,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025wr041875",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-03964",
           "target_kind": "node",
-          "target_sha256": "9fe61bf066e04cf939b1b32c953171c1c839c7f5045825ba2d063771982ebcd9",
+          "target_sha256": "db85dd871996d11690e4d572551d14de38bf3210d3196fecc9ae0da5eb44ddd8",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816683,17 +843465,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-wcc-2026-006",
+          "assertion_id": "assertion.claim.frontier.arxiv-2610-03008",
           "target_kind": "node",
-          "target_sha256": "8defa50d969d59b15811c9c14635585b7c9f4163e2202e81566aa57e05aebfe9",
+          "target_sha256": "82399c21be648fb96cb4a208fbf66536ea122a2350cb2dcdc8b0860c695b5db4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816701,17 +843483,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jb033060",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-39776",
           "target_kind": "node",
-          "target_sha256": "707cf100a1d501c7f696fd2d697ff1c6fcda68b292d01222eeff49b11c493840",
+          "target_sha256": "6ecd150266bfd4751ab0c41ef9a2daa5502de52896dba3cd913c50f3047a175b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816719,17 +843501,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025ea004610",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-21813",
           "target_kind": "node",
-          "target_sha256": "3f065c6d6b9816043f655c86be1c2db376d23114ef8d205ed95af16c4c15ee3c",
+          "target_sha256": "701c399df4bf5ba66633b67a1c373086e8b2ccb139fac358011ef3d905dd3e37",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816737,17 +843519,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122157",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-36354",
           "target_kind": "node",
-          "target_sha256": "aad76e2695df1590ed1ee7e21546093072096fac711531f3276cc747d379d284",
+          "target_sha256": "ba2ba64d0bba4952934bb82ab0a6eec38988f094b32a07557fd48b32ddcd515f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816755,17 +843537,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp4-70096",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-35424",
           "target_kind": "node",
-          "target_sha256": "5cd0217f620c24820ba3f3709bae68e249320dbdc75c52d459211a7d8ccf98f2",
+          "target_sha256": "dae5b28a82fd4127b8cfa1a390f0d58fc4a3915961ee8a83656d2511f46f86a8",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816773,17 +843555,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.375894+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-bioe-70124",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-35246",
           "target_kind": "node",
-          "target_sha256": "46b79f59c0a90d44116699c95932a412c54cdd3e1044cdd0d53aa1bb940c67b9",
+          "target_sha256": "4c04841c92f6f2515c5aa9702bcfa24b0ae6a83779590a3c32cfa9518565faf6",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816791,17 +843573,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-adom-71396",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-32315",
           "target_kind": "node",
-          "target_sha256": "7bd5269ae3f6648935d23c250ee86a5caff51d48cafaa3fcc7108826ac72b7ea",
+          "target_sha256": "3393b4bfa9a7dbb8b378cab5ff0700aac12523f0eda8237fe96df690f99204e0",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816809,17 +843591,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-ese3-70586",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-29972",
           "target_kind": "node",
-          "target_sha256": "3b6559384856cc4cc7d492f8bc4a1777753e7d2964ac961141ea8f9ff95f7144",
+          "target_sha256": "497b2f901d364e26b1b7b7625363b0dc6d2c9c25cd3d406cf9787b1bb0296d0d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816827,17 +843609,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1144-jgs2026-039",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-29832",
           "target_kind": "node",
-          "target_sha256": "a02b910d2b6614cdafe73141b5c82ee654e6444173c8884184daeb44ec2bf714",
+          "target_sha256": "273391aa4a119164f559f1e6a1a3018edf1e24fe952fc25820514f35c726c8d5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816845,17 +843627,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-hec-70120",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-28815",
           "target_kind": "node",
-          "target_sha256": "06da1d76ecc92146d1d16471cfc736a02a8df63ac3c242349a6f594df0933715",
+          "target_sha256": "dbae9cf820fccc9f22815306f186c61c6bf424abe78f92c8149f93288fa29ade",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816863,17 +843645,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-1467-9477-70049",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-26924",
           "target_kind": "node",
-          "target_sha256": "7a032f34fe4a8fa2c3589cddf9237d0cdb7170a476251120a26cb6a2e702d193",
+          "target_sha256": "2d9829e5b9835a2a33215722f146f2c3edd09aa838289952022c96436b4d46d8",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816881,17 +843663,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-faam-70045",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-25847",
           "target_kind": "node",
-          "target_sha256": "347242d22547b06d3100a554963ce634a8d26e6006154240bb0376669874e40b",
+          "target_sha256": "566241ea9065d5143c4a5829ca9dc1676bd4ada68203d32244bc0b8944f6905b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816899,17 +843681,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-58491-2735-4202-3413",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-25701",
           "target_kind": "node",
-          "target_sha256": "cb29a65fd41e529c98acc30826408b10df7f7c59d34fa44e68c0a1e1dfdb067f",
+          "target_sha256": "265421a5a50e797df47c4041c93dc6fdd177388afa0791402b77b6bfa37bf770",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816917,17 +843699,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121378",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-25437",
           "target_kind": "node",
-          "target_sha256": "f8ef4a17f4d203c1f222d9e7477d4f9aee398f5aeff0bece4528932803cbf385",
+          "target_sha256": "04be0752464c1a2727c2499358978e64e3bb76280ab524b9d80244fc454dc4c9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816935,17 +843717,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.376891+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-56403-nejesh-v5i2-421",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-05763",
           "target_kind": "node",
-          "target_sha256": "5231c6847085b822165932c8d09cccd9480443d7907c920f5418046bf6f2b2e2",
+          "target_sha256": "6a40b680ba9f871e726982e0df10ac8d16f87732cfb9e4dfe28adad7ca5bde57",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816953,17 +843735,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl123355",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-23703",
           "target_kind": "node",
-          "target_sha256": "88838261f026405a26038ef88b7972a658731fefad012b5a9b61e3375c010c34",
+          "target_sha256": "f6b5b72f02708a4ab71cec431bb431e6a28df2a8992b4bdb1fe0b549f41af299",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816971,17 +843753,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gl121171",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-23199",
           "target_kind": "node",
-          "target_sha256": "34995e184d1494632c3fe5fb892a2c36bf931815f0174d50475e874d84589f89",
+          "target_sha256": "e33b811b9a06eb8c266b3d181f31b1bbd885f0a6b8669ef714027ffd48a18bda",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -816989,17 +843771,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd044617",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-23085",
           "target_kind": "node",
-          "target_sha256": "0c765b6753ec38697cc4f8d361add63dbe231e61b4b4d292bbf9a4da5569d5e9",
+          "target_sha256": "0c2b03d9b7f61908e4930255a68a278b4aa830f5d46eacdb1a95676e0f2acb18",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817007,17 +843789,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-22378-he-2026-11-2-218-234",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-22775",
           "target_kind": "node",
-          "target_sha256": "6219ceeda9cf21ec6527909ef33c3901f330416df87b03b5d84705b980fa60f6",
+          "target_sha256": "4af32e824e726799b88d3216d8168d9d745e823b6eb705b4ca7606c9c4ac565f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817025,17 +843807,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.377888+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd045718",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-22615",
           "target_kind": "node",
-          "target_sha256": "36a0c3887c6bf256b30e9cf71aaf81907d84613ceee4856133280c58cef270e7",
+          "target_sha256": "96738d113de264b828a57dd20f4476b9cc89a4e1ac4f698ad231439ee857f97b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817043,17 +843825,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2026gl122664",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-21966",
           "target_kind": "node",
-          "target_sha256": "f776afd6043925ff163e24c8ed87bebf96aa320cc375aff46d45a7eb692060af",
+          "target_sha256": "f97feec8b76ab0a8ba0b3049af47cafa32d05e103c02e20b5b5868d3dcef11d0",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817061,17 +843843,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ojoa-70022",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-21270",
           "target_kind": "node",
-          "target_sha256": "4ca539af3fcf15394e7c27ee4d423ea4b0d6896f94afd43f0fe7b5fb907101c9",
+          "target_sha256": "bb3a30fcfa51c5f286b0277f756e51a7e111aab8ca4073cc47185278d8028337",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817079,17 +843861,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025jd045965",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-21093",
           "target_kind": "node",
-          "target_sha256": "a485c08ef7c5e1b8f0e8ec09da004fd5701091442d78e05e270e7d88de5f81c7",
+          "target_sha256": "c465663045ae0609766765a49d317b4f82250daed86724d16e1649eebe41769d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817097,17 +843879,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-jssr-70066",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-21057",
           "target_kind": "node",
-          "target_sha256": "fd20df296ef6730f3f3320f136323c5cec1c266ba210f30cb3cb830afe6b2a6f",
+          "target_sha256": "76b88ca69cb60353712208a82ce03a82e0b5852dd6c7719bb1c49ff1ce79fb05",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817115,17 +843897,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.378885+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025wr042846",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-19468",
           "target_kind": "node",
-          "target_sha256": "cdbb888d14ae853a1021ddb9d8faface2f2f290c93e8b1a77785e3bf96b94a86",
+          "target_sha256": "20b06709a97ffe2fdd32187dbe5ad19e3076dfb72acae2020827f39ef0798c20",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817133,17 +843915,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-jbgs-e185535",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-18467",
           "target_kind": "node",
-          "target_sha256": "84dae0bb68c2dec95491361c63cc0f363b030dcda2bc9a55d75665e66dccc82f",
+          "target_sha256": "8673127090530ef79c91ce67d21a0961a0d2324c28977595f997b55b436942ba",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817151,17 +843933,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-esp4-70082",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-17042",
           "target_kind": "node",
-          "target_sha256": "15799f7cf14105bb950f13e81e5a65e0d994b453b56fc62d6d7fb33214785912",
+          "target_sha256": "dfd363fcf52796128cbf35327a99ab3b4afd63931a94569aa3641633dee4b997",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817169,17 +843951,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-3897-nhcm-3-184711",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-16899",
           "target_kind": "node",
-          "target_sha256": "94ca2c37002531925f6db6ed47bcdb9a88df31f652e4ac757d10cdc3c077c5d2",
+          "target_sha256": "439daac35e888b0458f5f4a8499371b529122e2c736647b8ca92d11a1613044d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817187,17 +843969,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1029-2025gc012776",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-16353",
           "target_kind": "node",
-          "target_sha256": "be6118ff8d8e50e626c6401111081f2637642b77152588d5c1789c5693200f96",
+          "target_sha256": "308626710d74f0f311a0557985dbae09d96b47474e6736bea1f5cacf744f1aef",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817205,17 +843987,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.379883+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1002-joc-70436",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-16258",
           "target_kind": "node",
-          "target_sha256": "af0758ae2d49c59194e2a2cb8e9dfe03a04b2aa6a9434aabd86979c296fb4a5a",
+          "target_sha256": "b63a96fb3fedb2f5e089b9841b38da80f9f1e2f5c871752d9028b4f41e475324",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817223,17 +844005,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-2166-hydro-2026-191",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-05749",
           "target_kind": "node",
-          "target_sha256": "3a9d01f558bd80183da455ac1d803bb512a8f493de9d695e11aaa1fc9271b0c6",
+          "target_sha256": "8c190861d210e319ded5562e3121eac7e3ea8ecbcf32bfe9f737fbde3b1e8287",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817241,17 +844023,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-ojoa-70020",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-14022",
           "target_kind": "node",
-          "target_sha256": "a829cd17561be64fca0935072ab1358b24033c01660fce2b549b2d4c27104fec",
+          "target_sha256": "1e7b0c229b300ae0c765be5e9dff4ce547e888afe590ae9a25063c587f663e1a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817259,17 +844041,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
         },
         {
-          "assertion_id": "assertion.claim.frontier.doi-10-1111-phpr-70116",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-12866",
           "target_kind": "node",
-          "target_sha256": "1e4ec3f2c019f19de23fc0df5025d98d768bf0f4368f7d295f8fd7c06fba1442",
+          "target_sha256": "6fb5d07ac292366f14bd618e81b15c716cf7d1f4890cb3390114c1caf547cab9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817277,17 +844059,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ecot-70052.field.mesh.d011057",
-          "target_kind": "edge",
-          "target_sha256": "413a130ce197e9f36f3c287595cad06412588939f17551941e0f64e413eba646",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-12486",
+          "target_kind": "node",
+          "target_sha256": "4a8ebb64b931d95b0c5218130b7195bea59b74a1b7b9182f4541a29da18615ae",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817295,17 +844077,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70333.field.climatology",
-          "target_kind": "edge",
-          "target_sha256": "7fff6f0bfdc47c01ade5378ce41abde5313504a8806c7bad0379cda58555d480",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-12016",
+          "target_kind": "node",
+          "target_sha256": "1407a2a40fe480f7757cb800d33da002b2148b04b8adf7e3aa6991aed0928205",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817313,17 +844095,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.380880+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pwat-0000557.concept.usgs.30",
-          "target_kind": "edge",
-          "target_sha256": "58c5ea033e74aabca1efa3da34754b6c107cbde72c9fe6b73480e558db0ab0e2",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-11530",
+          "target_kind": "node",
+          "target_sha256": "f6ced05713c8c792ff8a98644885b116b83444ed35c3596967af6642dba86227",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817331,17 +844113,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-medu-70340.concept.mesh.d000091682",
-          "target_kind": "edge",
-          "target_sha256": "ae7d3ee5e9729f2c4333a980889dbc57528d24f37821d7eaf21bd9467d71a4ad",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-08218",
+          "target_kind": "node",
+          "target_sha256": "e64e423c33260e0218665ec9cc382917080218f7f2bb40857cce80d0ea6736f4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817349,17 +844131,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124622.concept.usgs.2027",
-          "target_kind": "edge",
-          "target_sha256": "3df951a29cb556e9f3aec0424eb412a8d01b5f74603bf4f341b4b1f59886133b",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-06163",
+          "target_kind": "node",
+          "target_sha256": "6ce239788a388f3ed75f291462aa025883af7db4c61e81f88db58c5851a04201",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817367,17 +844149,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1235.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "c7c9a55bd9dd0d2dd463460c366108d55978a30adc289b053dd6cb96da68ce98",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-06066",
+          "target_kind": "node",
+          "target_sha256": "b4d6e7484b0f2f26120741889f7e2dce8b232b445f2f4f797fbf407e287cba12",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817385,17 +844167,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-15351-2373-8456-1216.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "635dee6b4eb2a4c03356a8c62e771a76cfa9d650f10eb9c87183ae62a083ffe3",
+          "assertion_id": "assertion.claim.frontier.arxiv-2609-02071",
+          "target_kind": "node",
+          "target_sha256": "039e2ea49be10d4d3da82b47e1b5c6f61e412d8559c04b850256203485307c30",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817403,17 +844185,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.381877+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125301.field.usgs.1678",
-          "target_kind": "edge",
-          "target_sha256": "da4487fc23c63eb6d813c22d74248e4aa651a52a01d7ccce149decf2a06b12f9",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-31034",
+          "target_kind": "node",
+          "target_sha256": "ec0bd10015ab5dca339cb414086f312a1612f4b6f53ac333f77f67b8a91388df",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817421,17 +844203,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-21425-fob-19-142560.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "3986a8713521ff84b82728c0701beaea23cf1574acd33d708f16431a025eb365",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-28387",
+          "target_kind": "node",
+          "target_sha256": "6b07394df7c72280fcb7cc78d2d8826e8f36f255599684ae336b3116e2138c15",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817439,17 +844221,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001044.concept.usgs.1312",
-          "target_kind": "edge",
-          "target_sha256": "3ca128ae2cdaae8af0d2745b32dd313d582659c24c31a45b05827a6fd147e325",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-27536",
+          "target_kind": "node",
+          "target_sha256": "27bcb430fa3c83f7a7d1398d207348ef0a72dd0d9aef4475517ece783e174ba0",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817457,17 +844239,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000886.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "91e77eddc7fe88292b15ad7ff9449df9ffa91654a37426ec5a37239daae663a2",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-26093",
+          "target_kind": "node",
+          "target_sha256": "bc56588a8d495fccbfa72e7ed6c6a57dbf51cf4fec8551bf0607c7e60c3556bb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817475,17 +844257,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1075-consl-25020-lia.field.aat.300054256",
-          "target_kind": "edge",
-          "target_sha256": "ab741047cf8edd3a280ea1ae5164a41b2d305fecef729b32a17daf47b4420e36",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-24219",
+          "target_kind": "node",
+          "target_sha256": "822853ae1bd10336e56f0bb36069f737aea135aaf8f7ec4f5bfb5cfab0bb7ed4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817493,17 +844275,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.382875+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-040.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "7aa84f9fccde0b66d8b46cd51ea6a0b5e0100aa08fe39cd8dadb8effbf29e030",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-23972",
+          "target_kind": "node",
+          "target_sha256": "2f4e8209d8fab0d2f13b2da9f1793dd68549b9ff6995792b8c8d9926e2d25ad2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817511,17 +844293,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-lol2-70186.concept.usgs.1034",
-          "target_kind": "edge",
-          "target_sha256": "586a4667b074f2e52528e7bce7d01a69c75b63cfa8237b50a6d262cd25d963eb",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-21764",
+          "target_kind": "node",
+          "target_sha256": "bbca19c1f8cb4c2b7006f9ca2cea484fefedad6b5e602ae8830f9741e4e3e7de",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817529,17 +844311,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124411.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "5093d4ae72b587afb7fd89ce0c7a3b3fa5151c971d6e355cc448f0211313ca38",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-21020",
+          "target_kind": "node",
+          "target_sha256": "4a98426444f281136895acd6e36e2811a1b5fd9b30e99d03b0fd39e10f09efc3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817547,17 +844329,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70629.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "5d6d8905a618490c7791a3c4e518f2ceff8351835b11be2fc2bdd1b9c63fd143",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-20723",
+          "target_kind": "node",
+          "target_sha256": "21b5d82da39fbfd3204bb12044e33b8beab6817bfdb1dadb65fe180b87d13fff",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817565,17 +844347,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70277.field.mesh.d011057",
-          "target_kind": "edge",
-          "target_sha256": "41fb50edd017b2abeaf096ab82b2b6c837212a49288078b97056374b2ddaf50e",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-19416",
+          "target_kind": "node",
+          "target_sha256": "d8889c499e52fd77720c142cb996ad430a20bddda827cc20d73b92099d872058",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817583,17 +844365,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.383872+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70129.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "f909c4829aec2b28a494a4fbbb9c7bedd68b31c43bf6d114ccec8b30374678e6",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-18396",
+          "target_kind": "node",
+          "target_sha256": "4230aa909bd349a12725da9500e49d54790d908f75fe72e2e5a0d245a9b10ebc",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817601,17 +844383,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70613.concept.usgs.1308",
-          "target_kind": "edge",
-          "target_sha256": "4ef0afd549f86403f660671f586a68c8cd457c46f96be4e6309a8fcdc9051d06",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-18060",
+          "target_kind": "node",
+          "target_sha256": "2b63e910a14d93725ef45ef1b13b0eb28ca103821e3489d92cdf0d2d5d6047e5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817619,17 +844401,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70605.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "69ed199b71414bc234eb624180354f6c4dc58b3becc2c5e082b68231d078c223",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-16290",
+          "target_kind": "node",
+          "target_sha256": "4fe1ecbb34884d2d9f3c8e7b47b3c34d0385c84822822c2db70e7765b8387f76",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817637,17 +844419,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3176-arch-2026-2-03.concept.aat.300019278",
-          "target_kind": "edge",
-          "target_sha256": "6902960110627aa91c2da22bb818ab816519532bef2a2bcbc1da2ef938a26b3a",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-12037",
+          "target_kind": "node",
+          "target_sha256": "f9a5d11f4ca15ccecff427fcc92faa1557867617cf2a0098fac1982eb91b24c1",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817655,17 +844437,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-580.concept.usgs.27",
-          "target_kind": "edge",
-          "target_sha256": "8a35e876748f847320023ffb2c54fe29270e49c78d29187d40cf9c6c3dc9fd1f",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-11929",
+          "target_kind": "node",
+          "target_sha256": "88c54a9768888234ddab15fee435818a796534a6bc0452a14c336224d174f46f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817673,17 +844455,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ijop-70275.field.mesh.d011593",
-          "target_kind": "edge",
-          "target_sha256": "2ee3aac4f377dcbd00941bb67608726f3440664a49824c8a01b481f61deaa9a7",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-11175",
+          "target_kind": "node",
+          "target_sha256": "61a3b6758674c089ff292933f056a52824662e5a8d2f8681f7488ce616290b83",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817691,17 +844473,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.384869+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-popecon-10-e186220.concept.mesh.d006304",
-          "target_kind": "edge",
-          "target_sha256": "a5753ad4654edb69606084614507594daede3f68cc8bbdee7db8cc0711ec2822",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-10825",
+          "target_kind": "node",
+          "target_sha256": "5b6cad2caad586b624a67aaccd674490521eda4a47b8857ffa06714a2eb1153f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817709,17 +844491,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-507.concept.usgs.27",
-          "target_kind": "edge",
-          "target_sha256": "1b6a46178e802328ea55dde966281c18415dee4deac66bc4240548d5c60f2472",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-08151",
+          "target_kind": "node",
+          "target_sha256": "418f661b816ee96760c776caffdcaddbb0731fcad8c70c1726fd8506afc6d9eb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817727,17 +844509,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e183393.concept.mesh.d017149",
-          "target_kind": "edge",
-          "target_sha256": "df6d963e659278fd99996439db1e1a213dd50233f2763c4a77ec66b9bbe40100",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-10254",
+          "target_kind": "node",
+          "target_sha256": "e6111919699867aae8824c063308a9fdf7c5dcfff8b9e00b91f43edb777f17c2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817745,17 +844527,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026785.field.aat.300054240",
-          "target_kind": "edge",
-          "target_sha256": "8aa8a1d438ebe7f29c45eea36eeb1ebf63b128f13ae5eac1e32b16d6016bc7a0",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-08599",
+          "target_kind": "node",
+          "target_sha256": "bbf18907cd43f8752bbfdc399422ce23594c15350b056f40983a7fc667f3e7b0",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817763,17 +844545,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124090.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "074a553ffdc9c672c32b9ac69e8fb765475c597c36648b97f1f730c85198e67a",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-12398",
+          "target_kind": "node",
+          "target_sha256": "f702c66c52e59efcce94160d673b356d4692ff4cc2e87570e5a2864d7956fa1e",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817781,17 +844563,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.385867+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-pei3-70207.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "6c98126377bf52e563c8c8ad1bcb25cec9461e0d086807b2f7c281f6bb0bc5ad",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-07289",
+          "target_kind": "node",
+          "target_sha256": "1fbadbe0683aaa090614e2b25ef1e6624b9ce0d9cc932895cff294653261dc43",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817799,17 +844581,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-fea2-70077.field.anthropology",
-          "target_kind": "edge",
-          "target_sha256": "708679023d721aa70d9c59d8b1de2be111908cf0198ec4638c2acdeceb07581d",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-05481",
+          "target_kind": "node",
+          "target_sha256": "c9a402016800f9b54db71f8fb34ca5a81251c460b4ed4c9f832e334bc1c7027a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817817,17 +844599,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eet-70146.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "3ae70c59d5fc17a5bd72d8b7fa25d9943f67b60084bfcd6a5a5b1a8093363ffb",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-05348",
+          "target_kind": "node",
+          "target_sha256": "7fb323d587831f4c9c942c8de1ec0b5513ec729f3d747cd868de16aa413f6f15",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817835,17 +844617,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eco-70279.ology.hydrology",
-          "target_kind": "edge",
-          "target_sha256": "3f8dd74fd9b1d418159e335894b0ff2f9dc9559b25fa16add90c516667bf9bca",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-12393",
+          "target_kind": "node",
+          "target_sha256": "67d9855cccf7e4f46b446c253650ec227fdbfb9d85750e956c614588ac64ebfb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817853,17 +844635,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124233.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "028cf55a78b7a1cb658530c03360725b336928116b84957cbd488492361ce42d",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-04227",
+          "target_kind": "node",
+          "target_sha256": "b23bb78dd5b45e70a53acecdd6d09f2bb9ec9afd212936fc0f602d06affb8e07",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817871,17 +844653,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.386864+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gc013127.concept.usgs.727",
-          "target_kind": "edge",
-          "target_sha256": "dcb058d2c2d350403dcc64ccc215d6ee1456a79af93b84787a24d0a5e057a2a2",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-04133",
+          "target_kind": "node",
+          "target_sha256": "6bc0ecdfe554d2bede0800c6ab81b1503c9bf856154d8540a2454bd4edc0e51a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817889,17 +844671,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70320.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "044c93e518ff928f92294bb0d4307c623b85ac5319590bc58aa14d7af2302314",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-03967",
+          "target_kind": "node",
+          "target_sha256": "bcb8b2bbdc627943ea3d1fd487e21f2b1b9fc41c5c5eb532aa10e78e6b85a376",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817907,17 +844689,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-54929-2786-5738-2026-27-09-01.concept.mesh.d057217",
-          "target_kind": "edge",
-          "target_sha256": "bae06e564e38568f02beaf1a9176f5a65d6f793c4c3d47e057bf65db6405300b",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-02978",
+          "target_kind": "node",
+          "target_sha256": "c7d8752a652edf07a25e8b05fbbc1a79f33691ddb4a36f189b5ac9a3bb13ec41",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817925,17 +844707,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261281.concept.aat.300060368",
-          "target_kind": "edge",
-          "target_sha256": "440f66fa02e365b28a8a934694ab41d70025d8496d76b3d34e96d5d824d1864d",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-02976",
+          "target_kind": "node",
+          "target_sha256": "e0208edca4e1ed4f60e4c5b38ac6d2cd08b8361bf4f4752b24f2cf751c3ff74f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817943,17 +844725,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eco-70277.concept.usgs.2027",
-          "target_kind": "edge",
-          "target_sha256": "3cebf8181da1f583a23f0978a6dee2c22c03053520727eac4240ab81144cbb5e",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-02244",
+          "target_kind": "node",
+          "target_sha256": "743c5add749989b4464633c90f8aa6a9adf0fc57455492446d7ccec1d222118f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817961,17 +844743,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.387861+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-iroh-70046.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "136f637a24e58361baeed3cba87d3e882d5db73df6093c9ac84740ad118c9dde",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-02079",
+          "target_kind": "node",
+          "target_sha256": "e5edce4b2315fc743cc869cec2fcf60f4f81e4a54521ae777cd88be9a6cffbf7",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817979,17 +844761,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-erats-20261284.concept.aat.300069306",
-          "target_kind": "edge",
-          "target_sha256": "72b6686a1c9ac7efcd7acc2a0d8c7897305f26ea11263c238198d6b8d2c8fd68",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-01220",
+          "target_kind": "node",
+          "target_sha256": "08d4f16884ff34ab2eb12519ccb18c619e1ba2fe06807158df2e88270c1f2f55",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -817997,17 +844779,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ruso-70070.concept.mesh.d057217",
-          "target_kind": "edge",
-          "target_sha256": "bbae0bb2a21f408f515713d9b97f647e4d5e26a1f0078a40092517592d118e74",
+          "assertion_id": "assertion.claim.frontier.arxiv-2608-00959",
+          "target_kind": "node",
+          "target_sha256": "cc8190458a87f0e09885708954ef5b3680081f57bbec918a8304c0c9ee54184b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818015,17 +844797,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-200681.field.mesh.d019021",
-          "target_kind": "edge",
-          "target_sha256": "3b02aab8c12c34bb815e397c9fab4e968000577fa9d9817f58510e06db58afbb",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-17248",
+          "target_kind": "node",
+          "target_sha256": "1fdd859155a6a88a26146ead48d0b0144682e4825cf11c0b2bbee433a92a3008",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818033,17 +844815,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001005.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "37c658edad28ad0b89dc462ec248585db92c0ddd90adb110e8bd356eb40423cc",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-14144",
+          "target_kind": "node",
+          "target_sha256": "ec328db9ea9fa05f78e82e06ffa78077eea48cf02291ed634c20ee162f41cd4f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818051,17 +844833,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-moth-70148.field.mesh.d008678",
-          "target_kind": "edge",
-          "target_sha256": "e3d0ac61e4a805be0aead5e39d2e63913fbb95a40fb83cb973180fc91b8f10c6",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-28833",
+          "target_kind": "node",
+          "target_sha256": "2f1fc64b249d57aed7c4731d7d0f33bcf58db73a2d62c06759ae838acca89ccf",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818069,17 +844851,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.388859+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-20267724.field.aat.300054288",
-          "target_kind": "edge",
-          "target_sha256": "54b9e21c9b6ea576eecafc57464892bbe6691aa35434d2c16c8af85059266e00",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-28780",
+          "target_kind": "node",
+          "target_sha256": "f1b29633f5a9da54579e1b85dd2d21ca4f70cb73d2eb8aab5d92ae9010191d47",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818087,17 +844869,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124881.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "ebb67782a0595644d988fb5734f0e3c2d5a14253a252300a435aee486ff4972d",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-28276",
+          "target_kind": "node",
+          "target_sha256": "e438ccf59a58e083b4cde740d8989d36e9ddbfe612bf00269fc14b9c764e9108",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818105,17 +844887,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001578.ology.seismology",
-          "target_kind": "edge",
-          "target_sha256": "9c83b12562399d0b7cc3a730343ff71a638da8dd24a9bc22a8d7e34ab439fdc7",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-28224",
+          "target_kind": "node",
+          "target_sha256": "08bcee38ef32f755fbc0c8ad1f648310879b82d5496957dc1d1e9cbf160b4c07",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818123,17 +844905,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-gdj3-70104.ology.meteorology",
-          "target_kind": "edge",
-          "target_sha256": "ba0e72327f0351eaaa5b0699d0d5b7ebb1e286e02a9577f8fc72258d3c19aefa",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-28185",
+          "target_kind": "node",
+          "target_sha256": "a0573ef8da233252c54dad14f56441cb2288d5e671d3bc72be6b13962e66f133",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818141,17 +844923,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122610.field.usgs.1176",
-          "target_kind": "edge",
-          "target_sha256": "a40868461cc51d80f2ab195bc477810f9444954ccf350d129551a2a045d4a9ab",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-26209",
+          "target_kind": "node",
+          "target_sha256": "3e3a639fce49c30240c8dffe2bfbb6757086c8e52e57f7cffe603d63d38d7ec3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818159,17 +844941,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.389856+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70308.concept.usgs.64",
-          "target_kind": "edge",
-          "target_sha256": "2b65bb9eac425d93620749c7801216e8f784b13faa6a657dcb146aec1599063a",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-25526",
+          "target_kind": "node",
+          "target_sha256": "b1164cfef081634e80f58056041e08056c9b83bbad91b3a6f82cf28548ddcc2b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818177,17 +844959,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4281.concept.eia.energy-consumption",
-          "target_kind": "edge",
-          "target_sha256": "b278bae4fd0a6627085971e63abd53c7e4795ae9b62bb5c6c14c780f00540bca",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-25081",
+          "target_kind": "node",
+          "target_sha256": "b90de23cd11d00beb480dd4d7586292f01aad28b48fec4b4505bfb13cc4c9563",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818195,17 +844977,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-55730-1300-0632-4275.concept.eia.energy-consumption",
-          "target_kind": "edge",
-          "target_sha256": "980c612f0a4461d7be757a3c6b0d4b0c74ad0f4650f4278d40a4d17ecc1a0612",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-24423",
+          "target_kind": "node",
+          "target_sha256": "6dca6dc937e903d46d9bc8faf05ead44eeca3c790d69a1881a0251f46e3d7186",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818213,17 +844995,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-eet-70139.concept.usgs.168",
-          "target_kind": "edge",
-          "target_sha256": "823d43727642b31044de8f706af9ec20e919df8b4fd503af78edea331a7d9188",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-24360",
+          "target_kind": "node",
+          "target_sha256": "ac1a6108041d1dd66eec9657ec654795b49ceb849592c814f1eafa5968d0c712",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818231,17 +845013,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jclp-70212.ology.psychopathology",
-          "target_kind": "edge",
-          "target_sha256": "0e9258994f368a2f6fcdb5e65757ba5828c985f3b8aa1536bee44b80009a8e22",
+          "assertion_id": "assertion.claim.frontier.arxiv-2607-22049",
+          "target_kind": "node",
+          "target_sha256": "787438a2a1978d18fca62f04ba9b03c152778f7a805b0e6417fe10473cd97bbe",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818249,17 +845031,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.390853+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-12944-cwe-21-2-3.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-21653.concept.nist.performance",
           "target_kind": "edge",
-          "target_sha256": "6a162e820ccdcd99284802c8192a48f57226e01e217c479743c74eb3c2ec606f",
+          "target_sha256": "6c52cbb353c3860106387bb725f91b15c84c080339efe63889a54f094753383b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818267,17 +845049,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-bse-71470.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19722.concept.nist.linearprobng",
           "target_kind": "edge",
-          "target_sha256": "d142f92e16042c6eae2b6e1d393674e3dfd15aada1c53b94526a78e7b6242e71",
+          "target_sha256": "7eecfd6e62120b32e3cafc90725ff730f46cdcf8647b9a6ff67e6a530d434441",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818285,17 +845067,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000986.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19515.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "5568aa84d74a54e19ec83cc77b3444176c7251b24c6d8bf7cd1eac79d5ee61b7",
+          "target_sha256": "5ac5de4037bb606f6bce5d6d147b789233ebf4ee8d02810774971f2b565ce793",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818303,17 +845085,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1752-1688-70151.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19137.concept.eia.carbon-intensity",
           "target_kind": "edge",
-          "target_sha256": "332fe084ed8ec047f9b0ce05a10614d344ff3d34bf5d20456419851ce33c9461",
+          "target_sha256": "65f34a3e4de1921934fce958fbf3de103cf158d4563c30e2e926a680ffd46924",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818321,17 +845103,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jade-70048.concept.aat.300054181",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-17295.method.nist.dynamicprog",
           "target_kind": "edge",
-          "target_sha256": "c01fbf16f229689766e1c76ff2afd2187e28ccb0b5febb8928f5ecc49d243168",
+          "target_sha256": "775808a409b91ec514d386a1058df8db284a414f0f89eeabc5d424b888319cb2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818339,17 +845121,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-lcrp-70059.concept.mesh.d000075665",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-16273.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "231b567079f61a2c7b73d4498e6588fb97c1db07cbd428db00364209f7618b45",
+          "target_sha256": "331f68716f56caf2cc1f64b7b17c31b7f4a000a87e691e6e5bd0072a3a9ffaf4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818357,17 +845139,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77938.field.mesh.d000076227",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-16259.field.information-theory",
           "target_kind": "edge",
-          "target_sha256": "200b9ee34ecb381723b605c58b00384ee717d8a3928d9b387757a5b0ff9ee0e7",
+          "target_sha256": "829c50885f9d6b8d8c3621b4faa34a5e596bf54e3f277ddf4369316d8a083416",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818375,17 +845157,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.391851+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e185197.concept.mesh.d000070586",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-15072.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "2b7b1d9a0b8511ba28c5e86eec55cbef346a3051e2bdd6e2319bfedb3f633924",
+          "target_sha256": "8efda7b9f8e94cf895bd2e87e3ae2f48d850aa97c89f73d1a0f1cbae59c119fc",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818393,17 +845175,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl125327.concept.usgs.1298",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-15052.method.nist.simulatedannealing",
           "target_kind": "edge",
-          "target_sha256": "b06ccf5046b58d08eb505ad83799a71b4e588de6b7f7ed902815593003f9e1d7",
+          "target_sha256": "75ab44c41fa2aa7a69b4d8fa061ee87bef74f9c3bcdb296158fea5a50dbabd12",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818411,17 +845193,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70302.field.climatology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-13424.concept.nist.optimalsoltn",
           "target_kind": "edge",
-          "target_sha256": "a7984b13c49b2720e75906b24aca9cd5236ef51eef4b72d9d898fe4664bc18da",
+          "target_sha256": "079868db045bc283e82e361b1cf57daf828885c2772060941780296bb6d0b7cb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818429,17 +845211,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000930.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-13402.field.information-theory",
           "target_kind": "edge",
-          "target_sha256": "b6e8c4e2418f570563e5aaf59e8d186332c205a5a598755206cf693c45639c54",
+          "target_sha256": "5dbcabdc37d02bec3ccadfaa7375107623de9bebcd60e23347c78d52ae2ae99b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818447,17 +845229,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsnr-2026-0030.concept.aat.300016617",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12779.concept.nist.stronglyconnectedcompo",
           "target_kind": "edge",
-          "target_sha256": "61c92fb7e36e4fcf77c3e1e95b86877ff96e61f23873104b32f1bc476cbd7860",
+          "target_sha256": "ca881d45dfea19f0f4d1689792f3c7ae8c50722a6bf04293982520cbe71ce19a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818465,17 +845247,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70062.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12604.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "1c3d23c0da53c32744fc3fd75b0d0e1d29c8c737679bd2ac3cf864a1516fc9e0",
+          "target_sha256": "14c2f0dad240c4d7442124b6c0f263eb37dc67dfb71e2f7e68cd2f9d95babd15",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818483,17 +845265,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974.concept.eia.energy-consumption",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12592.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "f9680a16c3265fe3661dd70beac7a281228c8446333c66566a4b2cd88039fe20",
+          "target_sha256": "11b48931ed746a55634fe888b721f0428ab3ac49505d2220999f8da5dcdd5b63",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818501,17 +845283,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70852.concept.mesh.d000097815",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12038.concept.nist.binarytree",
           "target_kind": "edge",
-          "target_sha256": "10b0e59805ed315ba4892dba096f91d2499054928a8b125e546cd1d27b89a56b",
+          "target_sha256": "786c0410ff5cc9624a32a7c8ef50de145e7fe2d0bc05fef76b9c571b90ab7fe1",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818519,17 +845301,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70845.concept.mesh.d000223",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-11869.concept.nist.objective",
           "target_kind": "edge",
-          "target_sha256": "03126797c3c1a67f99c6856b97fb361b2a048a21d8ffbd9f9faeeceafdce7e43",
+          "target_sha256": "c1c93b38d6e47f170dcde510947d0d3fb1d38243d44d2ef627100b0505a79050",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818537,17 +845319,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.392849+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0001039.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-11359.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "f681f86b6cd6221c90f693200afd14c0ba7fb39129b8bd2f4f3e93a3cbff9617",
+          "target_sha256": "8e4ed8f65551d000ad2f1d0f672269c98285e6414ff835d0a864d12f79109db4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818555,17 +845337,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-nup-70114.field.aat.300054297",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04959.concept.nist.flownetwork",
           "target_kind": "edge",
-          "target_sha256": "22afd973472db19dfb2940b071d91b713f91648c736039bd278d2034fe2172ea",
+          "target_sha256": "9fcd2dbcd4e1440767a958f0313d13ad345f9d85ca160b20ec7b62391961a295",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818573,17 +845355,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejss-70414.concept.usgs.1731",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09266.concept.nist.optimalsoltn",
           "target_kind": "edge",
-          "target_sha256": "1eca545df4306771858ce11a14f3eb6363adad118502b56871804206e712db6e",
+          "target_sha256": "95603e652c1ff02230684988deb5c9ad74fb860f4d7d7dc7ac5122d5cc54673c",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818591,17 +845373,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026wr044293.concept.usgs.1034",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09080.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "7994fd2f12baf505e42cdbc406a718fc5e558e261cb0f510c28c42af6ff37759",
+          "target_sha256": "1e1160c97bfc9883df2db67b1a69e296911399de06c589edad65ee2e175342b3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818609,17 +845391,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp-70399.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09010.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "a655ebb19ba84e432978fcb5d5412e23b423e8765df90eacc1fae687523be229",
+          "target_sha256": "cfcef2c8ea0a1f3f36ad2aa5f87966c321d92d4eb047fdbac321d6c69616310a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818627,17 +845409,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.393846+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jqs-70108.ology.sedimentology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-08744.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "368366ec2806e816d6adab901517f4ed74589e505b34452338f9a8943ec295b0",
+          "target_sha256": "34ab545a3d46057a832b840f0708925c7fc5b44ccd2cb53be8ebd322a2597a4d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818645,17 +845427,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jd046723.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-07616.method.nist.randomsearch",
           "target_kind": "edge",
-          "target_sha256": "cf3ec6c8fde9a680a1c9df6dbeb94d56f5eb02b27c50428a2e6052129d499bfa",
+          "target_sha256": "d424e04812d75c1602b74fa1578560a256e2d61493f28f405359034821a6896b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818663,17 +845445,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-msd2-70089.concept.eia.electric-energy",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-07307.concept.nist.prisonersdilemma",
           "target_kind": "edge",
-          "target_sha256": "2b2d57db3262660a239464992d41469e50f9d4a51ced95584e5b2359608fb7a0",
+          "target_sha256": "ea2d5a86e58088fbc950e26cc8988c366be503287af370b49992819a8b8891e5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818681,17 +845463,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70342.field.aat.300054263",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-06601.method.nist.dynamicprog",
           "target_kind": "edge",
-          "target_sha256": "55f33142020fbac13bf21380c4374403266f46cdb0aab9affeb012936f057fdf",
+          "target_sha256": "083cd631d5308584d26f4e731db2100ed2393b9f1955bf4b0df8e2887a1ad43f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818699,17 +845481,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-cli2-70059.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04776.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "57cc1c4163c135c16e71f548200b3335302641c2354d77550a2df7f6ccef875d",
+          "target_sha256": "9f5995026dd7354e0abb244a9aed300018a1287c4ecec39bf4870b89fabcb358",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818717,17 +845499,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.394843+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124727.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04697.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "9de5826b34ea49d1e147a936fab8aef49e8b48caa1c8a00cb78e233ce1a0fc56",
+          "target_sha256": "2b37efcee69a5a45ddd737da1a20a2b5e4b4a8f254ac38ea0cdb4b1092a8c5cf",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818735,17 +845517,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000877.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04662.concept.nist.temporllogic",
           "target_kind": "edge",
-          "target_sha256": "870f675c090fecc7e40e9fccd64338d4b6573842ec02a43e9f858c6466da6b50",
+          "target_sha256": "c8b7c19acd6410839be0b87fa7602dc180e4d9eabdd6e1654175c200da8ecef6",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818753,17 +845535,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70054.concept.usgs.1145",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04630.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "57cfd1fa059479121dd39cd7015839cb60027f379c452d354347a277f5e2aa60",
+          "target_sha256": "6ee864e6e4d8de82908b044af002a0720e95d07b6623d4fe2f482e636efec452",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818771,17 +845553,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-moth-70134.concept.mesh.d006808",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04242.concept.nist.markovchain",
           "target_kind": "edge",
-          "target_sha256": "075acc6dce6372ce0982dde46c29bc22da33366fb665156513d28599fd15553f",
+          "target_sha256": "ab3432af0492253188d8364f4c2abbeb3dd47209ca8f6519bb64d674cb7809e7",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818789,17 +845571,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-gwat-70098.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-06918.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "e069a6616981d994426c6cf255049159f38fbc7fb32af0e735a313d686d7d3eb",
+          "target_sha256": "29a8363a8bcd9d4d2eb17e2ea483a1a737c4be2458790df52abe7489f4664365",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818807,17 +845589,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.395840+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wp-2026-018.concept.usgs.1308",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-03964.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "21cb010041d462fd8fd5a29ba22d12438e29a03acf349d17c27367374c61c33e",
+          "target_sha256": "031719b4145d0bbc7a85ebb7be1157edb1498406bf8a5949269c5db692ed87d9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818825,17 +845607,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0107.field.aat.300389758",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-03008.field.cognitive-science",
           "target_kind": "edge",
-          "target_sha256": "cd0285dcd8d84ff3276063eb5231555bcb63bb6b40baa8da1dd7bc5e379bb852",
+          "target_sha256": "6b7988527fbc5ffd579c6cc2cd51c1b1ed0041185357398ea94f41ed60034a7b",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818843,17 +845625,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000931.concept.usgs.168",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-39776.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "3b93367f56a100af9711d79cf0398ec0b1defd995eea2751cd18d8eaf7c88da2",
+          "target_sha256": "e569cfefa8896e225ee769fcccc6d5787e6a4d11556d3d4e0e1ceb43db9c0f80",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818861,17 +845643,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122646.concept.usgs.819",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21813.concept.nist.probesequenc",
           "target_kind": "edge",
-          "target_sha256": "d80b59feca9f2643c8127f2af6f4e59ea53f61c45477eda27131b05289272f7a",
+          "target_sha256": "7b8a7875a41ead85da7ec454cf5c43224cfaa80ac6be876dd7731e5e628466ef",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818879,17 +845661,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70058.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-36354.field.ai",
           "target_kind": "edge",
-          "target_sha256": "26faf98e1617c498f14fcaf1a9f99fc2e0ea0afc0cefdb2d687940945652e28a",
+          "target_sha256": "191e7f272a45ada4cb08145a73bcb42df1e1f4e2e7b9ddaafbd3438ea9bf7a6e",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818897,17 +845679,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.396837+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-jpln-70107.ology.mineralogy",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-35424.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "eabf986a68eb7d042c78f083bb3201adedef5dfacea5beb82db6f9b133aa38a1",
+          "target_sha256": "dbc4f58751e99e4694397a21ccc362c382a612194a51ea1afc6614c19e8a0419",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818915,17 +845697,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-187529.field.mesh.d019021",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-35246.concept.eia.distribution-system",
           "target_kind": "edge",
-          "target_sha256": "c59f73ce630e6023ef9ab5c5df42b1f18da0655a68f6e1c2387696ebe2ffd123",
+          "target_sha256": "58df9f39e461a31db9ae12399d63fea358f4ba08e5527bd2568fe3b98e4cd9fb",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818933,17 +845715,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026775.field.aat.300054255",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-32315.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "89c395e3b5b43e2d74d942f5b61fe00955134a024cd35b14e745aecb7820da25",
+          "target_sha256": "beb1c296d511195cfc6709e582be598becb3d95ec3f853573bd3e028b054a9e2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818951,17 +845733,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-38159-ehass-2026774.concept.aat.300262706",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-29972.concept.mesh.d000088562",
           "target_kind": "edge",
-          "target_sha256": "e375c52d50d9a3d5c3274cdbeaabe4fc90ce29c2e3d24f57c17e75331a69314f",
+          "target_sha256": "315c9f8cbcc1fbdbc31815e10fd0fa4f8d34e33d7d2788e7852e4a6975b9b07e",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818969,17 +845751,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-hec-70140.concept.mesh.d006304",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-29832.concept.eia.motor-speed",
           "target_kind": "edge",
-          "target_sha256": "4d0e2faad6ec1db51c9ecabb0cb38dec9a15d81fd0a8a7acc6eb68bbecedd82e",
+          "target_sha256": "bf22c5a439f3714e92fb13fb9565e9ea06c8086d586c63c79ba8e7e022c97012",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -818987,17 +845769,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-tox-70177.concept.usgs.435",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-28815.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "03f2d69fe3e86e3e32863029e02de5defd5de61377f858dadb9bdae3efc50ac8",
+          "target_sha256": "163b542ce76fd7e9c904972938cc8354ce361525d9b494957d2cb6a146b10252",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819005,17 +845787,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.397835+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-77585.field.mesh.d044085",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-26924.field.ai",
           "target_kind": "edge",
-          "target_sha256": "932a66e8f067dd34c5dcc96caeb75527f1a0e0be66c2af03e3029025af511648",
+          "target_sha256": "377fb68c2fd39f56ef2113fa4ee4c8eb6443e7358dd52af2051100057b6b8968",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819023,17 +845805,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9566-70245.field.mesh.d011057",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25847.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "0d407c662e3ab90a674023eceaf60e79bdcaa50309cf801a2f9d87595758d885",
+          "target_sha256": "2424e0d6156cfe4f1377689491902acd5996b4b3650c4b24e30710126913ceed",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819041,17 +845823,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70337.field.aat.300054255",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25701.concept.nist.polynomialtm",
           "target_kind": "edge",
-          "target_sha256": "823d22274092f6a74cb246836de4e960d2306c30fbe24958ecef7948ae265ae3",
+          "target_sha256": "4421fe4a5d9222d92a03f8db20b48cca17bf89d9f37bdbdf3494833d57d2b402",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819059,17 +845841,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123821.concept.usgs.2028",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25437.concept.eia.electricity-generation",
           "target_kind": "edge",
-          "target_sha256": "392f56fe5d9f837ba1a66d41b1708337b7322ee2f1a1c09d75ceb43a9c5e6fe8",
+          "target_sha256": "283cab111ca494566a586adaa628806c46f641acc89527be8d0671a3687e85e2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819077,17 +845859,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-qj-70252.concept.usgs.819",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-05763.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "30692f0745cfa35cf656234ae1065de640303228c84100b909a326aa269d780b",
+          "target_sha256": "6e7d0e064cf7fd087a6f253f3c0cde055f45d7a82f8b38402f90473f660d58be",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819095,17 +845877,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.398832+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70540.concept.usgs.64",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23703.field.computer-science",
           "target_kind": "edge",
-          "target_sha256": "0965bde54a2ddd0f7e90ee273365f4962fd1484c7430a031ad97944f53e6d97e",
+          "target_sha256": "cb64767c458d409ae2997130938492ef939c060e726b9ee8624a2e9145b53680",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819113,17 +845895,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-eje-70266.concept.mesh.d006803",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23199.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "43e2cb6f68dbe2ce7dcfec60226866e44313f4f2bed32da14361b0943a17144a",
+          "target_sha256": "91c57e795df9ff36e5f5037ddebdf6baadb3f19537cf46a9a3e4cc32705c8de0",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819131,17 +845913,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ecpo-70064.concept.mesh.d003906",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23085.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "9d535648cc70e0fe441dc7c258ac616a306f2ff36f5f5d6d74ca31cfd31b40f7",
+          "target_sha256": "606a75a65f1a6cd6c6e34901001d5a1176b257088e8a9c0c975a1286752da824",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819149,17 +845931,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-beer-70139.concept.mesh.d012941",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-22775.field.ai",
           "target_kind": "edge",
-          "target_sha256": "4a4b958419b8bd96eaacd5b404fd954052600e725c0a8fc209f867d5f44c0109",
+          "target_sha256": "efe22ba3704dc06178130ab25bf44697dc09a9ac568d9065e6caf160b6f0a955",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819167,17 +845949,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1098-rsta-2025-0029.field.aat.300054297",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-22615.method.nist.chinesermndr",
           "target_kind": "edge",
-          "target_sha256": "d04ad2eb1b13c49ed964cf507c49d71f693793799169bba19d27a5d4220b51f5",
+          "target_sha256": "ef16c225ab39ae352c6ee76cc50d429483d28539edc81fc8727973c07b88434d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819185,17 +845967,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.399829+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124661.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21966.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "55a00eefabe46841268f7fa262e0e0412cd15c0366b806a59d817d0106dbf31c",
+          "target_sha256": "a53879bea0885fe0841074331ff28771ec205140bcf14a8e505202070118f54f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819203,17 +845985,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jc023581.concept.usgs.1034",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21270.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "a18ba45043b77113b0e3b3a9d3adfe3119c6ba58be45cd7585be9fa2df4d2fa1",
+          "target_sha256": "3db67063c0dd01a006e5b44fd60dc92480f7c882eeccd702337f9ff62baade62",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819221,17 +846003,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jb032632.field.navigation",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21093.concept.nist.markovchain",
           "target_kind": "edge",
-          "target_sha256": "6de6605b857cc8977937877057635fa3102dca7da7d06447b136c5d3a84ef339",
+          "target_sha256": "a8505d329f1e58fb221477806177803396b0de82973b425936c0c13b2908175d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819239,17 +846021,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70526.field.climatology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21057.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "9d32184199f687914a2f80ca00dbb579a7c54e835cafcf1d4f58c3a84f7456b8",
+          "target_sha256": "e0f5d506298504f027353206d0c1bf68c33e911086e2827e402fef2dbe4b2d7f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819257,17 +846039,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-saje-70032.concept.mesh.d006803",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-19468.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "c7a43702e148ff21455a1439315c19ce38671f09535e13897b8967a33d81bdd6",
+          "target_sha256": "f78567543e793968410477d5088c29f33c9d1bd766e773987f23372d9c89c6b6",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819275,17 +846057,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl124111.concept.usgs.819",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-18467.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "8e7e4115d7cd3db903ccdfc4c14129d22450e2176267309fd09f300da054462f",
+          "target_sha256": "c4fab82e170b1cbf9e3b79e5232fde587b727bb9f11b82da772c7cfb27b1dea9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819293,17 +846075,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.400826+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70772.concept.mesh.d000097822",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-17042.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "3e62a6474f79f8cb4795b144fb48f00f5952215fe1b5aa709126d6cd47192bd0",
+          "target_sha256": "dc02363ab3a512aa0b5ffed8f27c92367eb37f00b2a24eef608ea27cb6e724cd",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819311,17 +846093,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122539.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16899.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "c40b0c002dfce5e52c92ebb40cea4fe5c9990a4b2a9da8eeda5a1e0161f5927a",
+          "target_sha256": "4d1a267f2904efbefd538d231256be7a62d54e0c72916d5338210086996dc638",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819329,17 +846111,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70310.field.aat.300054264",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16353.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "3454753a5337242de9c7d986cd8661b3addf0ba50bf6fe77ee01caf8c1acf184",
+          "target_sha256": "acb84603179546430e891d38aa064448b5a8284b8a348f065b1dd6c08afe7bc6",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819347,17 +846129,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adfm-76901.concept.mesh.d001698",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16258.field.ai",
           "target_kind": "edge",
-          "target_sha256": "33d5bdf8cc2d08f0fb578677ea1762c1ba2aebe8a4eee124341801350c4e5c4c",
+          "target_sha256": "92e3ea398d60b8181e350a7fc507e2786a249a283c7c40e7fd4636caa7cd737d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819365,17 +846147,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-nzm2-70056.concept.usgs.1731",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-05749.field.ai",
           "target_kind": "edge",
-          "target_sha256": "3ada4b65e3f13f0f937b48ca5db6c82c1179403cc0afb7c1f55dde8498914236",
+          "target_sha256": "c475703a6ecff61ca298de935ce8c0ef2cda50e1e008b981c40d25bfd6942474",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819383,17 +846165,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.401824+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-026.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-14022.field.ai",
           "target_kind": "edge",
-          "target_sha256": "b9ba5ddccd19aa7016d970d727b6d5dc9b7bb39ed0e2d450c5c9d59715553c9a",
+          "target_sha256": "2bd61cee696276e68f780d1c4c4c517d0ade4408b4e61d9081d6250691311734",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819401,17 +846183,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ejed-70766.concept.mesh.d003906",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12866.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "fcbdce1b920f24264f2bef8aa6f195af401c6d3484357ace620a11887f12c5fa",
+          "target_sha256": "4e8b03a5a7eddd16128d4d382011bea7682b89c9857ee693f78c55dbda771c12",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819419,17 +846201,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-sce-70090.concept.mesh.d000080562",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12486.concept.nist.decisionproblem",
           "target_kind": "edge",
-          "target_sha256": "16012ce64737f2436f2d6371cd35f39f43c8313b78d72327513f89f5fc1cd4df",
+          "target_sha256": "45a9486b1a9bac493b7b6c275a536973d2f3f27983815be5ae7e519f2dd86214",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819437,17 +846219,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70053.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12016.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "9900a279402e35229a0da8d0d7f2b28f43339dfabe26c2d327359b75320000f5",
+          "target_sha256": "6685b270171c85d8f3defc3bb0debaf20efbd6238372294a6edeef992ae38fb5",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819455,17 +846237,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70603.concept.eia.coal-mine",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-11530.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "3863be4c8ca9e7ed520cac96a977f5671b15c9120ebf402e7067a61d36a14d56",
+          "target_sha256": "f0da5d2ffbd8cff94f8825e3401d0bfb310ea6240e5c8eb94b6c2aa4899f12fc",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819473,17 +846255,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.402821+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd046190.concept.usgs.65",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-08218.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "a81c4b93bb80875c32e4cb68c2eb7770bc026c11a1112abb33ca81c7a4cbb3c2",
+          "target_sha256": "6e0a91e51501b51399997367025186f6057485022a9985818f24ff4e53c10504",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819491,17 +846273,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121323.concept.usgs.93",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-06163.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "8c6a0d96fd2ee03a46e32a995778115ab59ae1d4134496934663798b82352269",
+          "target_sha256": "e479c14bdbe532ba60fd14e19a47504001d9389860f07b71e6052b43bcaf5df7",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819509,17 +846291,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ijfe-70259.concept.mesh.d057217",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-06066.concept.nist.performance",
           "target_kind": "edge",
-          "target_sha256": "ef4531c42eb774a730647f22f51fc69fb73fb0e839ac044ad9c1f15d6978d867",
+          "target_sha256": "7b30dc4d838d3cd29f68470c4e6b7d1a7ef2a4f1e1d897aa549d73f5d8d473a1",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819527,17 +846309,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1371-journal-pclm-0000696.concept.usgs.1308",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-02071.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "e783179f541b5c3c5e8f04c8f1df63f088b40d521e4c80955ab28158cd2a1522",
+          "target_sha256": "4cfe605897e390c799b63c35f692212d14a04a4806d6b3cd7a5115922e99296e",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819545,17 +846327,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-aphw-70185.concept.mesh.d000091682",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-31034.field.ai",
           "target_kind": "edge",
-          "target_sha256": "30b5316591de380285c1fe3c44b88357f34ca5f4cbb582cf5b373f893435b0da",
+          "target_sha256": "6469c11264b897b8bde5a73f2edec03e0a1c588afbfc284ed653bc8c7945482a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819563,17 +846345,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026jh001250.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-28387.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "31f023290f2ba95152778204853b275360d8b26720aaba93e4a7aba4ebeb556a",
+          "target_sha256": "c344811fedbaa657e44717a3c3b940b4eb8023beb4ab5e5c5a96b737b5e5b2f2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819581,17 +846363,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122518.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-27536.concept.nist.prisonersdilemma",
           "target_kind": "edge",
-          "target_sha256": "e23b30c7bd2185fb0b659e2db19faf3ce0200478301455d6a02427fbf3940e9f",
+          "target_sha256": "b2707737e921a6fbb0c79211136a4dbde8956099a28f7edb3fc5d03870cfccbf",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819599,17 +846381,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e172739.concept.mesh.d003906",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-26093.concept.nist.stronglynp",
           "target_kind": "edge",
-          "target_sha256": "f7dd16ce59b926cd1bb8d06fb3bd37b33038949d2852fc0381863c8601208bab",
+          "target_sha256": "b3cf9974b37f96d386e302ddb803ca413610a16848a0c640a818e44da753693a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819617,17 +846399,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.403819+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jmg-70045.ology.geochronology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-24219.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "b470d645eb6aa2ad32f6441a01e1d37fdc168516d75e1d4a4e746017ba4b2109",
+          "target_sha256": "703e50164da0b2c328fb37231a5694babe35cb61e368b0419251b3c7822cca26",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819635,17 +846417,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ppp-70049.concept.usgs.1199",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-23972.concept.nist.temporllogic",
           "target_kind": "edge",
-          "target_sha256": "1d09b2a8fde228cf07762a4d90f796dfbe3df29e7f968f5f0704a525d3ee75ea",
+          "target_sha256": "c980908a69eb80889b8d50c897ebc814992bf331142df148cbd1871afb1afeda",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819653,17 +846435,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-brics-econ-7-e162074.concept.mesh.d006803",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-21764.field.ai",
           "target_kind": "edge",
-          "target_sha256": "bdf0c8a46aede6e1ef7a381e7b93738729763b1a913a713125c041353d087e35",
+          "target_sha256": "0c294df3d3df9371e5aa59f98ea8b7d28efdb23a29865542346269ca84abab1a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819671,17 +846453,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ijal-70289.concept.aat.300262706",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-21020.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "a2398ef052807e35173c06311bf3cf55c5c8b041da1e21046802d8a01555cd18",
+          "target_sha256": "4c1958798424d6ce7c08d3873dd9256e508955bf39a6d258f465727d30aa9d77",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819689,17 +846471,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wpt-2026-383.concept.usgs.1308",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-20723.field.ai",
           "target_kind": "edge",
-          "target_sha256": "2abb8a8626986197b06bc49d0bb8bef48295b14046495b780a1200ea70c88457",
+          "target_sha256": "c2289649c6cf69228a1c90be937e8ae5589479e679af228e392cb239fa412b28",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819707,17 +846489,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-359.ology.hydrology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-19416.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "6d204342aacfe31e93adb6c08aeab160067eac39a6f2d313537e8b0bfe4be661",
+          "target_sha256": "a21938cf8a1590f99d08d60ba27c7119d0c7fc714caf04d3b3aaa70bf89ef9f9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819725,17 +846507,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-66630-sc-2026-0009.field.mesh.d011057",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-18396.method.nist.exhaustivesearch",
           "target_kind": "edge",
-          "target_sha256": "9e583578b5328c598c3f058ef1c173f32e6f2df7b21e79e104a4d50a26fc2dba",
+          "target_sha256": "aab173a9fcbbd48c97021e62280e35f3e8e1c25e037d150ff125fdd6e4a776df",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819743,17 +846525,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-59588-2961-3094-1247.field.aat.300054245",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-18060.concept.nist.temporllogic",
           "target_kind": "edge",
-          "target_sha256": "c0b1b30c8c314a0566cf8948c5d4cf7f0dd226986ca607427dc17e76b880fa16",
+          "target_sha256": "b19cc33589da1559e42d207434e94d82dc55ac110d7e08da0ffebedaa6b8a809",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819761,17 +846543,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2606.field.aat.300054254",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-16290.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "916e012de468086bb33fdced7b20e93b8fa7c86d2407005b2701ba57c9b70c96",
+          "target_sha256": "512a70d80f87f194c3df5c9c537a2d8bc1c3a5bf8f92910b9ed01607d6942f85",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819779,17 +846561,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.404816+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-28918-jei-v11i1-2601.concept.mesh.d012941",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12037.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "0be107f194b016c8c37d70402214009a3163baf456d9843a74c666589f2aec83",
+          "target_sha256": "214ebd4c84a748434ac58377b4a2ccc72decbc188724bca8918dadd711b285d3",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819797,17 +846579,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025wr041875.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-11929.concept.eia.compressor-station",
           "target_kind": "edge",
-          "target_sha256": "127fdb6e32bb72f5aadbb5934b84e3038fcfe0ea63e80ff0d03b94ce8c493633",
+          "target_sha256": "7561c8ecfeb18de87d0aea47feaae39ed4801fb30437502e3bf74e8e9806e80f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819815,17 +846597,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-wcc-2026-006.concept.usgs.1308",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-11175.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "7b6abcdbf38434946b7530124cfecec3cc5e3dc440b5ecc7b020f8f198cd3a57",
+          "target_sha256": "7a693e17499f81aec0ca1fd2c35cada8a172f44319b3a00438a6153b0606bdc6",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819833,17 +846615,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jb033060.field.usgs.1176",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-10825.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "c78ba9bbe4415aa9779e6d8709a32c302c0f94e5f48df97f7e3a9261df571d67",
+          "target_sha256": "d1d635c0a1bcdb4c0f1db54a20e6a73f385267f18b870da07ca5b9d4c1044452",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819851,17 +846633,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025ea004610.field.usgs.68",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-08151.method.nist.dynamicprog",
           "target_kind": "edge",
-          "target_sha256": "c0aaffd9374fbd38c166cb53c925891055c1b80713090808adc7ab88fd67558a",
+          "target_sha256": "8375f9e8c99efeda5e4c4e7b034c1fa6e25b1a162a9b1e7fdb16e882f7b53703",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819869,17 +846651,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122157.concept.usgs.1034",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-10254.method.nist.modelcheckng",
           "target_kind": "edge",
-          "target_sha256": "0eb161ffb3e442b58145927d5cb36b8f85485ddd66b10d18a6ecbe9131dd0c91",
+          "target_sha256": "4c75b855e62c55ca4e91c3bc1ea2d5410e3907a3cacffdf41f4f264e25467e4f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819887,17 +846669,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70096.field.navigation",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-08599.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "ffaed2c1149b711fffb46eeb1216517acbd90e9558470c7819cdf8c9e485cdbd",
+          "target_sha256": "808b2a621e821096c72fb8476b36e7a090c41c06e5233a3b7e3bec1d2770926a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819905,17 +846687,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-bioe-70124.field.mesh.d026690",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12398.ology.psycholinguistics",
           "target_kind": "edge",
-          "target_sha256": "8439c6d99a8732c062ad31e55f0dc6cba18a704c35f6f7c61e74dceb405ef675",
+          "target_sha256": "47064720765e88ee9d08ab468fb49ef034550b6c6d2cbd9ecb7e8b1a5895af92",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819923,17 +846705,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-adom-71396.field.mesh.d044085",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-07289.concept.nist.formalmethod",
           "target_kind": "edge",
-          "target_sha256": "5fd9f4b6f06c961306fb7d4c8d32df101aa5da7466e73a2dca276168b93294cd",
+          "target_sha256": "289e593bf0fbf059d169503b92cf9f57511e680fb993c177bc7ef92734e488b9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819941,17 +846723,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.405813+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-ese3-70586.concept.eia.air-collector",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-05481.field.neuroscience",
           "target_kind": "edge",
-          "target_sha256": "d4736bd0c4e97941abcc96d00793bd4e018d89b3be2ebd63bd6343f6922d2e19",
+          "target_sha256": "cf3fda85ae9b09c913d9bb6a4c2fec06f4e8362d8490cd9f8ab9053c3d2f6a87",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819959,17 +846741,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1144-jgs2026-039.ology.stratigraphy",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-05348.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "6d6a631194a4c58ed849a3cafc47ed7e2a7d3339435fa5dfb19ed901b8883d62",
+          "target_sha256": "f3ea82218ae3052d3429755f89d53971c9b5f77558fd60eef0e064403b958e61",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819977,17 +846759,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-hec-70120.concept.mesh.d057185",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12393.field.ai",
           "target_kind": "edge",
-          "target_sha256": "bd8d87880c3050bd1b58d85aba0cf8ed7b269e41317d636cbabef39dcba7332b",
+          "target_sha256": "60a107037b3c0eb81f37f81291d8bbf7aa943002a13d2e13ea296f828c121d7f",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -819995,17 +846777,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-1467-9477-70049.field.mesh.d011057",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-04227.method.nist.fastfouriertransform",
           "target_kind": "edge",
-          "target_sha256": "1cf9cbaa2da8bcb70dda42618312a76ce3550929db788282de4de5c0e0b30148",
+          "target_sha256": "8ed69d55fdb5b95c09777f7e1b31a29d5dd0cfb373da6380f7a02da4972cf0f2",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820013,17 +846795,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-faam-70045.concept.mesh.d003906",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-04133.concept.nist.globaloptimum",
           "target_kind": "edge",
-          "target_sha256": "4d67ee429c042a8827479934aeca2ce406bf180edbefab9878249d4ee5e380b9",
+          "target_sha256": "4214fb7acd0542bee40e304d02cf792375660285164aeef7c884500c8b2a9938",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820031,17 +846813,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-58491-2735-4202-3413.concept.eia.leading-edge",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-03967.concept.nist.flownetwork",
           "target_kind": "edge",
-          "target_sha256": "bd4d11377ccd6185c601c0b1836776bca0e9f373cdf77b91b6323139057754b5",
+          "target_sha256": "95b2484dfa2aced1d9942ea260e3c6c695d4cc5951df58ac2d43a1525b624453",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820049,17 +846831,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121378.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02978.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "d6e676a4e791093ba60fe5c1d0072aac62c14f2b477c8da4aae866986be0ef69",
+          "target_sha256": "e22d048069a65e640909a4b53418e20e14ae1dfe4a7685654b1d1910e7dd2d3a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820067,17 +846849,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-56403-nejesh-v5i2-421.field.aat.300054280",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02976.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "66d313cca7f2bb483848de80ea3bc7f571b700d1f631817575a56e0be1be6ec1",
+          "target_sha256": "e850ed8fbf6081e494abcd7db3d0b39a6c1d3f37b177b1637b1d22bccbbf1db4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820085,17 +846867,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.406811+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl123355.concept.usgs.677",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02244.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "36fb44841b47eb8a5ba87651b67c8730535ec6d9f8bf9ea4331dcd994eb07dbf",
+          "target_sha256": "ec2ec977c984bbdf843bbd4b4745245a4aa4a8ad96e29efcd67180ea82329591",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820103,17 +846885,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gl121171.concept.usgs.2277",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02079.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "f767a8496500b340407b3f4a561a760fada083a5dbe32a371e436dae330ae8b7",
+          "target_sha256": "8ae1d0f7a8abeedc5df1c8bce2388b6b420df12620aba5ef7f9dd583fb52bc7a",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820121,17 +846903,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd044617.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-01220.concept.nist.objective",
           "target_kind": "edge",
-          "target_sha256": "5ff90558ecd44c62b94d62acdb1dd66b4520eb8c7ed555f332c67fc406cd5764",
+          "target_sha256": "43619f6d7a045a771908e00af450692c742ca67cc73510275a7c1acc1db88142",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820139,17 +846921,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-22378-he-2026-11-2-218-234.field.mesh.d049691",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-00959.concept.nist.optimization",
           "target_kind": "edge",
-          "target_sha256": "0a270f4126c52c25ad67c5c5a5397d38bc6c8beba1634f15bd40ef0752beb0e5",
+          "target_sha256": "d2d69b51a25be679a0f88fd54516cbdc59bf6db5ab347406ac0e9874b1d61708",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820157,17 +846939,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045718.field.climatology",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-17248.concept.eia.fuel-cell",
           "target_kind": "edge",
-          "target_sha256": "81bf4b593e62bf06f23f54659c55a2a4a7010e3a615b1e0b01891c229aaf30e0",
+          "target_sha256": "fc4ce603abbaeec2b32528a796137d174c61996f364c01fa86641ba77748ffad",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820175,17 +846957,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2026gl122664.field.usgs.1678",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-14144.concept.nist.lowerbound",
           "target_kind": "edge",
-          "target_sha256": "02c99f468d924805d5a015f973306559f6f9a4e597b5bfe4b1753ddcb644131c",
+          "target_sha256": "13b1f66d6251859aaff1e3088c41bdb3790c5b1f6278cc6f3ab18a4f0df1f4ac",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820193,17 +846975,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70022.concept.aat.300016586",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28833.field.ai",
           "target_kind": "edge",
-          "target_sha256": "fe1caf92a5042aa1bbe148f4c4e5b82dbcb25468e13edff408626716d6342d5f",
+          "target_sha256": "3045e82524ebcf5ac402e50609708476eb9b69656329cfbeee0808515bde16e8",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820211,17 +846993,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025jd045965.concept.usgs.64",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28780.field.ai",
           "target_kind": "edge",
-          "target_sha256": "6c4c9063897ae6a898b141a7cee6e0fd38f3ec532b45563372607dec7f9e6f46",
+          "target_sha256": "c2cdf65f5782bd43858e6f67eacfd2d2905d4c746a83c68ae0c98df3e2c56bb9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820229,17 +847011,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-jssr-70066.concept.mesh.d033303",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28276.field.ai",
           "target_kind": "edge",
-          "target_sha256": "3e5976917c5b790368d1d974a27f09d3cbf1a25df85337389fba3ad8dcdbdfae",
+          "target_sha256": "c836745b9325a50b496305c349d0c62bc1ba72d55dad0aa2e7080a15298b3298",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820247,17 +847029,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.407808+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025wr042846.concept.usgs.1298",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28185.concept.nist.markovchain",
           "target_kind": "edge",
-          "target_sha256": "7c64ab102e2304ef497beb71c4b095efc3af1ece01aea65af08f0bdae44df2aa",
+          "target_sha256": "7247de10d649c29f02f8ba3dde98a69cd50cfff569a853bd1ef15d731462b9ce",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820265,17 +847047,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-jbgs-e185535.concept.usgs.1034",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-26209.concept.eia.energy-consumption",
           "target_kind": "edge",
-          "target_sha256": "48286c10a085c1e1a41c8a7789715e82866bebb61935da0d5299d6599c1d3bf2",
+          "target_sha256": "012e7154904336a6c812f26df174dc238d94d3066cd6956c2f0c2feee7270335",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820283,17 +847065,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-esp4-70082.ology.stratigraphy",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-25526.field.mesh.d011057",
           "target_kind": "edge",
-          "target_sha256": "9136b4d300f08beb1d489ccc8eebbd2ffbd214562355dd5a70ce12d84a0e3a42",
+          "target_sha256": "13a7308d44eadbdc71d6c1e5dc8e0743fd361d0ae6a4427b66dfa0f943ed067d",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820301,17 +847083,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-3897-nhcm-3-184711.field.mesh.d019021",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-25081.concept.mesh.d006803",
           "target_kind": "edge",
-          "target_sha256": "80e19af92bd242dbbf60ad386fc52424d0b30502bb187f314ca416e678725c7f",
+          "target_sha256": "2a847c4fe8b507efbb8886852a3a06a1e6e969b5cdb4f86574220edb358d3098",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820319,17 +847101,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1029-2025gc012776.concept.usgs.562",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-24423.concept.eia.electric-vehicle-ev",
           "target_kind": "edge",
-          "target_sha256": "b89f637ce4d43910084e45cdb864a4b8106ad8cf50bbb2189d7e3797874362db",
+          "target_sha256": "4a89f727fd4a08a7a0096bd759f8a736a467bf34d4e34d11f3a741a599dab7f9",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820337,17 +847119,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.408805+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1002-joc-70436.concept.usgs.1308",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-24360.concept.mesh.d000067656",
           "target_kind": "edge",
-          "target_sha256": "59b83d6fa078d5e53746bca6919a52e4e4d4f4c818c80fe94e80c0d053720860",
+          "target_sha256": "d5991652168ebd297d5d091f5fc17f526800adbd9595875bca77a6f47a96a411",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820355,17 +847137,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-2166-hydro-2026-191.concept.usgs.2027",
+          "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-22049.concept.mesh.d007391",
           "target_kind": "edge",
-          "target_sha256": "cb78de2c5c59b64a639be3807d30dc8db002e5c4585648d8fda386878813ea3b",
+          "target_sha256": "a351ec73293102ed74aaf3671a0cb241b2da6599ee54758b449e66e6d4ecf8a4",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820373,17 +847155,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-ojoa-70020.concept.aat.300019275",
-          "target_kind": "edge",
-          "target_sha256": "faacbfc608af0c619ee3a7e31fa779eda86d9156d8a8c4c07ecd4b3919680be1",
+          "assertion_id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+          "target_kind": "taxonomy",
+          "target_sha256": "b6ab60ec7d1556ff04676c0184bcc18437e404635016be97498097e9b0c6c738",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820391,17 +847173,17 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
         },
         {
-          "assertion_id": "assertion.edge.claim.frontier.doi-10-1111-phpr-70116.field.aat.300054245",
-          "target_kind": "edge",
-          "target_sha256": "f90b2271ec0cc36862ffdac2e4fcc49642970d725c3b22a9bbdd1232e9f0cd1a",
+          "assertion_id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+          "target_kind": "taxonomy",
+          "target_sha256": "7256abd61eb75435360413241497b4f6393c4cd36bb27da608dd4d0a0758bf93",
           "outcome": "supported",
           "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
           "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
@@ -820409,23 +847191,23 @@
             "exact_quote_verbatim": true,
             "source_not_botcheck": true
           },
-          "candidate_sha256": "129d963d19c083b0300228605ac081c96829c4fa06335239f761736eb454b18b",
+          "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
           "reviewer_id": "code:nemesis-provenance/1",
           "model": "nemesis-provenance/1 (deterministic code check, no model)",
-          "context_sha256": "a97738afb1e0a41cdfdce2818a97e74165b4af8724f9c08be9fa0d95cce35ef7",
+          "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
           "role": "provenance",
-          "reviewed_at": "2026-10-18T16:57:02.409803+00:00"
+          "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
         }
       ],
       "context_nodes": [
         {
-          "id": "field.navigation",
-          "label": "Navigation",
+          "id": "field.neuroscience",
+          "label": "Neuroscience",
           "kind": "field",
-          "domain": "earth",
-          "era": "agrarian",
+          "domain": "information",
+          "era": "twentieth",
           "status": "active",
-          "summary": "Knowledge and methods for determining position and direction across terrain and water.",
+          "summary": "Study of nervous systems, neural computation, development, function, and disease.",
           "tags": [],
           "sources": [
             {
@@ -820438,16 +847220,14 @@
           "aliases": []
         },
         {
-          "id": "field.anthropology",
-          "label": "Anthropology",
+          "id": "field.computer-science",
+          "label": "Computer science",
           "kind": "field",
-          "domain": "social",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
-          "summary": "NLM MeSH describes Anthropology as: The science devoted to the comparative study of man.",
-          "tags": [
-            "ology"
-          ],
+          "summary": "USGS Thesaurus defines Computer science as: Study of computers, including their design (architecture),  uses (computations, data processing), and systems control.",
+          "tags": [],
           "sources": [
             {
               "id": "oecd-frascati-2015",
@@ -820455,25 +847235,23 @@
               "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
             },
             {
-              "id": "nlm-mesh.bcc9794e5c2487d85964",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000883",
-              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D000883"
+              "id": "usgs-thesaurus.c12f0d8d6bc2875dfd18",
+              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190",
+              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=190"
             }
           ],
           "frontier": false,
           "aliases": []
         },
         {
-          "id": "field.climatology",
-          "label": "Climatology",
+          "id": "field.information-theory",
+          "label": "Information theory",
           "kind": "field",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
-          "summary": "USGS Thesaurus defines Climatology as: Scientific study of the characteristic weather conditions of geographic areas.",
-          "tags": [
-            "ology"
-          ],
+          "summary": "NLM MeSH describes Information theory as: An interdisciplinary study dealing with the transmission of messages or signals, or the communication of information. Information theory does not directly deal with meaning or content, but with physical representations that have meaning or content. It overlaps considerably with communication theory and CYBERNETICS .",
+          "tags": [],
           "sources": [
             {
               "id": "oecd-frascati-2015",
@@ -820481,1564 +847259,819 @@
               "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
             },
             {
-              "id": "usgs-thesaurus.e70c8d2c1e03ea23b093",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=170"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.geochronology",
-          "label": "Geochronology",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Geochronology as: Study of the age of the earth by dating geological formations, rocks, and fossils.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.9b9b9c2209b3540da35b",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=438"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.hydrology",
-          "label": "Hydrology",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Hydrology as: Branch of earth science that deals with water as it occurs in the atmosphere, on the surface of the ground, and underground.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.7691e5829ecd899aeb75",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=560"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.meteorology",
-          "label": "Meteorology",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Meteorology as: Branch of science dealing with the short-term variations of atmospheric conditions including wind, precipitation, temperature, humidity, cloud cover, and air pressure.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.4c9d6896b889ce2b2e86",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=731"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.mineralogy",
-          "label": "Mineralogy",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Mineralogy as: Branch of earth sciences concerned with the study of naturally occurring inorganic elements or compounds.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.a5b24d28b9768fcf1686",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=747"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.sedimentology",
-          "label": "Sedimentology",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Sedimentology as: Branch of earth sciences concerned with the study of the origin, composition, transport, and changes of materials deposited by water, wind, or ice.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.fd7a87508131b4ecaf86",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1037"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.seismology",
-          "label": "Seismology",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Seismology as: Branch of earth sciences concerned with the study of earthquakes and man-induced seismic waves.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.762a1e9db52aec2a89a0",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1050"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.stratigraphy",
-          "label": "Stratigraphy",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "summary": "USGS Thesaurus defines Stratigraphy as: Branch of geology concerned with the study of the formation, composition, ordering in time, and arrangement in space of stratified rocks.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "usgs-thesaurus.d2e306d9307aced4b202",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104",
-              "title": "USGS Thesaurus term: https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1104"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "ology.psychopathology",
-          "label": "Psychopathology",
-          "kind": "field",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "summary": "NLM MeSH describes Psychopathology as: The study of significant causes and processes in the development of mental illness.",
-          "tags": [
-            "ology"
-          ],
-          "sources": [
-            {
-              "id": "nlm-mesh.cfcfe0e017d161687831",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011599",
-              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011599"
-            }
-          ],
-          "frontier": false,
-          "aliases": []
-        },
-        {
-          "id": "field.usgs.68",
-          "label": "Atmospheric sciences",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Atmospheric sciences as: Studies relating to composition, structure, physics, chemistry, and dynamics of the atmosphere.",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.68",
-              "title": "USGS Thesaurus term 68",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=68"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.677",
-          "label": "Magnetic field (earth)",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Magnetic field (earth) as: The magnetic region surrounding earth. It is generated by the dipolar characteristic of earth's core whereby earth itself acts as a great spherical magnet with poles near, but not exactly at, the North and South poles. This category is also used for geomagnetic field , geomagnetics , geomagnetism , with maps and atlases for magnetic anomaly maps , magnetic field , and magnetosphere",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.677",
-              "title": "USGS Thesaurus term 677",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=677"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.usgs.1176",
-          "label": "Topography",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Topography as: Configuration of the land surface and sea floor. This category is also used for elevation and relief",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.1176",
-              "title": "USGS Thesaurus term 1176",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1176"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.1298",
-          "label": "Water chemistry",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Water chemistry as: Branch of chemistry that deals with the elements and compounds in water.",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.1298",
-              "title": "USGS Thesaurus term 1298",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1298"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.usgs.1678",
-          "label": "Hydrodynamics",
-          "kind": "field",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Hydrodynamics as: Principles of fluid dynamics applied to water bodies. This category is also used for fluid dynamics",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.1678",
-              "title": "USGS Thesaurus term 1678",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1678"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.27",
-          "label": "Air temperature",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Air temperature as: This category is also used for temperature (air)",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.27",
-              "title": "USGS Thesaurus term 27",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=27"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.65",
-          "label": "Atmospheric composition",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Atmospheric composition as: Components of the mass of gases that surrounds a planet. The earth's atmosphere consists of nitrogen, oxygen, and small portions of other gases. This category is also used with contamination and pollution for air pollution",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.65",
-              "title": "USGS Thesaurus term 65",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=65"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.2027",
-          "label": "Soil moisture",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Soil moisture as: Water content of soil and other near-surface unconsolidated earth material",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.2027",
-              "title": "USGS Thesaurus term 2027",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2027"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.2028",
-          "label": "Soil temperature",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Soil temperature as: Temperature and temperature gradients in soil and other near-surface unconsolidated earth materials",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.2028",
-              "title": "USGS Thesaurus term 2028",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2028"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.819",
-          "label": "Ocean temperature",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Ocean temperature as: Distribution of heat in the oceans, including surface water, thermocline and mode waters, and deep waters. Includes discussion and measures of both in-situ and potential temperature. This category is also used for temperature (ocean)",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.819",
-              "title": "USGS Thesaurus term 819",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=819"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.usgs.1199",
-          "label": "Unconsolidated deposits",
-          "kind": "concept",
-          "domain": "earth",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The USGS Thesaurus defines Unconsolidated deposits as: Loosely bound sediments such as sand, gravel, and silt which tend to accumulate in low areas or valleys. This category is also used for alluvium , eolian sediments , loess , with chemical analysis for sediment geochemistry , sediments , and surficial deposits",
-          "sources": [
-            {
-              "id": "usgs-thesaurus.1199",
-              "title": "USGS Thesaurus term 1199",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1199"
+              "id": "nlm-mesh.29527d691d2b917a2f70",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D007257",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D007257"
             }
           ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.mesh.d049691",
-          "label": "History, Medieval",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes History, Medieval as: The period of history from the year 500 through 1450 of the common era.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d049691",
-              "title": "NLM MeSH Browser descriptor D049691",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D049691"
-            }
-          ],
-          "tags": [],
           "aliases": []
         },
         {
-          "id": "field.mesh.d019021",
-          "label": "Natural History",
+          "id": "field.ai",
+          "label": "Artificial intelligence",
           "kind": "field",
-          "domain": "humanities",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Natural History as: A former branch of knowledge embracing the study, description, and classification of natural objects (as animals, plants, and minerals) and thus including the modern sciences of zoology, botany, and mineralogy insofar as they existed at that time. In the 17th, 18th, and 19th centuries it was much used for the generalized pursuit of certain areas of science. (Webster, 3d ed; from Dr. James H. Cassedy, NLM History of Medicine Division)",
-          "sources": [
-            {
-              "id": "nlm-mesh.d019021",
-              "title": "NLM MeSH Browser descriptor D019021",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D019021"
-            }
-          ],
+          "summary": "NLM MeSH describes Artificial intelligence as: Theory and development of COMPUTER SYSTEMS which perform tasks that normally require human intelligence. Such tasks may include speech recognition, LEARNING ; VISUAL PERCEPTION ; MATHEMATICAL COMPUTING ; reasoning, PROBLEM SOLVING, DECISION-MAKING, and translation of language.",
           "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.mesh.d008678",
-          "label": "Metaphysics",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Metaphysics as: The branch of philosophy that treats of first principles, including ontology (the nature of existence or being) and cosmology (the origin and structure of the universe). (From Random House Unabridged Dictionary, 2d ed)",
           "sources": [
             {
-              "id": "nlm-mesh.d008678",
-              "title": "NLM MeSH Browser descriptor D008678",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D008678"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d012941",
-          "label": "Social Responsibility",
-          "kind": "concept",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Social Responsibility as: The obligations and accountability assumed in carrying out actions or ideas on behalf of others.",
-          "sources": [
+              "id": "oecd-frascati-2015",
+              "title": "OECD Frascati Manual 2015 — Fields of R&D classification",
+              "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
+            },
             {
-              "id": "nlm-mesh.d012941",
-              "title": "NLM MeSH Browser descriptor D012941",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D012941"
+              "id": "nlm-mesh.8fdf3c0558d0b89101fb",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D001185",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D001185"
             }
           ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d033303",
-          "label": "Protestantism",
-          "kind": "concept",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Protestantism as: The name given to all Christian denominations, sects, or groups rising out of the Reformation. Protestant churches generally agree that the principle of authority should be the Scriptures rather than the institutional church or the pope. (from W.L. Reese, Dictionary of Philosophy and Religion, 1999)",
-          "sources": [
-            {
-              "id": "nlm-mesh.d033303",
-              "title": "NLM MeSH Browser descriptor D033303",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D033303"
-            }
-          ],
-          "tags": [],
           "aliases": []
         },
         {
-          "id": "field.mesh.d011057",
-          "label": "Politics",
+          "id": "field.cognitive-science",
+          "label": "Cognitive science",
           "kind": "field",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d011057",
-              "title": "NLM MeSH Browser descriptor D011057",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011057"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d017149",
-          "label": "Private Sector",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Private Sector as: That distinct portion of the institutional, industrial, or economic structure of a country that is controlled or owned by non-governmental, private interests.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d017149",
-              "title": "NLM MeSH Browser descriptor D017149",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D017149"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d000097822",
-          "label": "Media Exposure",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Media Exposure as: The extent to which individuals encounter messages and content via COMMUNICATION MEDIA.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d000097822",
-              "title": "NLM MeSH Browser descriptor D000097822",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000097822"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d006304",
-          "label": "Health Status",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Health Status as: The level of health of the individual, group, or population as subjectively assessed by the individual or by more objective measures.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d006304",
-              "title": "NLM MeSH Browser descriptor D006304",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006304"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d057217",
-          "label": "Economic Development",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Economic Development as: Mobilization of human, financial, capital, physical and or natural resources to generate goods and services.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d057217",
-              "title": "NLM MeSH Browser descriptor D057217",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D057217"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d000080562",
-          "label": "Universal Design",
-          "kind": "concept",
-          "domain": "social",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Universal Design as: The design of products and environments to be usable by all people, to the greatest extent possible, without the need for adaption or specialized design.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d000080562",
-              "title": "NLM MeSH Browser descriptor D000080562",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000080562"
-            }
-          ],
+          "summary": "NLM MeSH describes Cognitive science as: The study of the precise nature of different mental tasks and the operations of the brain that enable them to be performed, engaging branches of psychology, computer science, philosophy, and linguistics. (Random House Unabridged Dictionary, 2d ed)",
           "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d000070586",
-          "label": "Fiscal Policy",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Fiscal Policy as: Use of government spending and taxation to influence the economy.",
           "sources": [
             {
-              "id": "nlm-mesh.d000070586",
-              "title": "NLM MeSH Browser descriptor D000070586",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000070586"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d000075665",
-          "label": "Recidivism",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Recidivism as: Repeated criminal behavior.",
-          "sources": [
+              "id": "oecd-frascati-2015",
+              "title": "OECD Frascati Manual 2015 — Fields of R&D classification",
+              "url": "https://www.oecd.org/en/publications/frascati-manual-2015_9789264239012-en.html"
+            },
             {
-              "id": "nlm-mesh.d000075665",
-              "title": "NLM MeSH Browser descriptor D000075665",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000075665"
+              "id": "nlm-mesh.3afa87c4efa263dea007",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D019336",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D019336"
             }
           ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "concept.mesh.d000091682",
-          "label": "Health Inequities",
-          "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Health Inequities as: Differences in health status and in the distribution of health resources between different population groups, arising from the social conditions in which people are born, grow, live, work and age (https://www.who.int/news-room/facts-in-pictures/detail/health-inequities-and-their-causes#:~:text=Health%20inequities%20are%20differences%20in,right%20mix%20of%20government%20policies.)",
-          "sources": [
-            {
-              "id": "nlm-mesh.d000091682",
-              "title": "NLM MeSH Browser descriptor D000091682",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000091682"
-            }
-          ],
-          "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d003906",
-          "label": "Developing Countries",
-          "kind": "concept",
-          "domain": "social",
+          "id": "method.nist.dynamicprog",
+          "label": "dynamic programming",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Developing Countries as: Countries in the process of change with economic growth, that is, an increase in production, per capita consumption, and income. The process of economic growth involves better utilization of natural and human resources, which results in a change in the social, political, and economic structures.",
+          "summary": "NIST DADS defines dynamic programming as: Solve an optimization problem by caching subproblem solutions ( memoization ) rather than recomputing them.",
           "sources": [
             {
-              "id": "nlm-mesh.d003906",
-              "title": "NLM MeSH Browser descriptor D003906",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D003906"
+              "id": "nist-dads.dynamicprog",
+              "title": "NIST Dictionary of Algorithms and Data Structures: dynamicprog",
+              "url": "https://xlinux.nist.gov/dads/HTML/dynamicprog.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d000223",
-          "label": "Adaptation, Psychological",
+          "id": "concept.nist.binarytree",
+          "label": "binary tree",
           "kind": "concept",
-          "domain": "social",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Adaptation, Psychological as: A state of harmony between internal needs and external demands and the processes used in achieving this condition. (From APA Thesaurus of Psychological Index Terms, 8th ed).",
+          "summary": "NIST DADS defines binary tree as: A tree with at most two children for each node . Formal Definition: A binary tree either is empty (no nodes), or has a root node, a left binary tree, and a right binary tree. Also known as dyadic tree.",
           "sources": [
             {
-              "id": "nlm-mesh.d000223",
-              "title": "NLM MeSH Browser descriptor D000223",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000223"
+              "id": "nist-dads.binarytree",
+              "title": "NIST Dictionary of Algorithms and Data Structures: binarytree",
+              "url": "https://xlinux.nist.gov/dads/HTML/binarytree.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d006803",
-          "label": "Human Development",
+          "id": "concept.nist.linearprobng",
+          "label": "linear probing",
           "kind": "concept",
-          "domain": "social",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d006803",
-              "title": "NLM MeSH Browser descriptor D006803",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006803"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.mesh.d011593",
-          "label": "Psychology, Social",
-          "kind": "field",
-          "domain": "social",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Psychology, Social as: The branch of psychology concerned with the effects of group membership upon the behavior, attitudes, and beliefs of an individual.",
+          "summary": "NIST DADS defines linear probing as: A hash table in which a collision is resolved by putting the item in the next empty place in the array following the occupied place. Even with a moderate load factor , primary clustering tends to slow retrieval.",
           "sources": [
             {
-              "id": "nlm-mesh.d011593",
-              "title": "NLM MeSH Browser descriptor D011593",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011593"
+              "id": "nist-dads.linearprobng",
+              "title": "NIST Dictionary of Algorithms and Data Structures: linearprobng",
+              "url": "https://xlinux.nist.gov/dads/HTML/linearprobng.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d057185",
-          "label": "Sedentary Behavior",
-          "kind": "concept",
-          "domain": "social",
+          "id": "method.nist.exhaustivesearch",
+          "label": "exhaustive search",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Sedentary Behavior as: Behaviors during waking hours that have low energy expenditure and are often performed in a sitting or reclining POSTURE .",
+          "summary": "NIST DADS defines exhaustive search as: An algorithm that finds a solution by trying every possibility.",
           "sources": [
             {
-              "id": "nlm-mesh.d057185",
-              "title": "NLM MeSH Browser descriptor D057185",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D057185"
+              "id": "nist-dads.exhaustivesearch",
+              "title": "NIST Dictionary of Algorithms and Data Structures: exhaustiveSearch",
+              "url": "https://xlinux.nist.gov/dads/HTML/exhaustiveSearch.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d000097815",
-          "label": "Emotional Exhaustion",
-          "kind": "concept",
-          "domain": "social",
+          "id": "method.nist.fastfouriertransform",
+          "label": "fast fourier transform",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Emotional Exhaustion as: A state of feeling emotionally overextended and drained.",
+          "summary": "NIST DADS defines fast fourier transform as: An algorithm to convert a set of uniformly spaced points from the time domain to the frequency domain. Also known as FFT.",
           "sources": [
             {
-              "id": "nlm-mesh.d000097815",
-              "title": "NLM MeSH Browser descriptor D000097815",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000097815"
+              "id": "nist-dads.fastfouriertransform",
+              "title": "NIST Dictionary of Algorithms and Data Structures: fastFourierTransform",
+              "url": "https://xlinux.nist.gov/dads/HTML/fastFourierTransform.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d006808",
-          "label": "Humanism",
+          "id": "concept.nist.polynomialtm",
+          "label": "polynomial time",
           "kind": "concept",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Humanism as: An ethical system which emphasizes human values and the personal worth of each individual, as well as concern for the dignity and freedom of humankind.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d006808",
-              "title": "NLM MeSH Browser descriptor D006808",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006808"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.mesh.d026690",
-          "label": "Ethics, Clinical",
-          "kind": "field",
-          "domain": "humanities",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Ethics, Clinical as: The identification, analysis, and resolution of moral problems that arise in the care of patients. (Bioethics Thesaurus)",
+          "summary": "NIST DADS defines polynomial time as: When the execution time of a computation, m(n), is no more than a polynomial function of the problem size, n. More formally m(n) = O(n k ) where k is a constant.",
           "sources": [
             {
-              "id": "nlm-mesh.d026690",
-              "title": "NLM MeSH Browser descriptor D026690",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D026690"
+              "id": "nist-dads.polynomialtm",
+              "title": "NIST Dictionary of Algorithms and Data Structures: polynomialtm",
+              "url": "https://xlinux.nist.gov/dads/HTML/polynomialtm.html"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.435",
-          "label": "Geochemical processes",
-          "kind": "concept",
-          "domain": "earth",
+          "id": "method.nist.chinesermndr",
+          "label": "Chinese remainder theorem",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Geochemical processes as: Processes affecting the amount, distribution, or structure of chemical elements in air, water, soil, rocks, and minerals.",
+          "summary": "NIST DADS defines Chinese remainder theorem as: An integer n can be solved uniquely mod LCM(A(i)) , given modulii (n mod A(i)), A(i) > 0 for i=1..k, k > 0. In other words, given the remainders an integer gets when it's divided by an arbitrary set of divisors, you can uniquely determine the integer's remainder when it is divided by the least common multiple of those divisors.",
           "sources": [
             {
-              "id": "usgs-thesaurus.435",
-              "title": "USGS Thesaurus term 435",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=435"
+              "id": "nist-dads.chinesermndr",
+              "url": "https://xlinux.nist.gov/dads/HTML/chineseRmndr.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: chineseRmndr"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.1312",
-          "label": "Water temperature",
+          "id": "concept.nist.decisionproblem",
+          "label": "decision problem",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Water temperature as: The degrees of heat of water from a given source at a specific time. This category is also used for temperature (water)",
+          "summary": "NIST DADS defines decision problem as: A problem with a \"yes\" or \"no\" answer. Equivalently, a function whose range is two values, such as {0,1}.",
           "sources": [
             {
-              "id": "usgs-thesaurus.1312",
-              "title": "USGS Thesaurus term 1312",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1312"
+              "id": "nist-dads.decisionproblem",
+              "url": "https://xlinux.nist.gov/dads/HTML/decisionProblem.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: decisionProblem"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.1308",
-          "label": "Water resources",
+          "id": "concept.nist.flownetwork",
+          "label": "flow network",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Water resources as: Stocks of water, the liquid derived from precipitation. A constituent of living matter and necessity for all life, it covers a large proportion of the earth's surface. This category is also used for hydrosphere and with contamination and pollution for water pollution",
+          "summary": "NIST DADS defines flow network as: A weighted , directed graph with two specially marked nodes, the source s and the sink t, and a capacity function that maps edges to positive real numbers, u: E |→ ℜ + .",
           "sources": [
             {
-              "id": "usgs-thesaurus.1308",
-              "title": "USGS Thesaurus term 1308",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1308"
+              "id": "nist-dads.flownetwork",
+              "url": "https://xlinux.nist.gov/dads/HTML/flownetwork.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: flownetwork"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.64",
-          "label": "Atmospheric circulation",
+          "id": "concept.nist.formalmethod",
+          "label": "formal methods",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Atmospheric circulation as: Movement of atmospheric gases around the earth.",
+          "summary": "NIST DADS defines formal methods as: A group of analytical approaches having mathematically precise foundation which can serve as a framework or adjunct for human engineering and design skills and experience.",
           "sources": [
             {
-              "id": "usgs-thesaurus.64",
-              "title": "USGS Thesaurus term 64",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=64"
+              "id": "nist-dads.formalmethod",
+              "url": "https://xlinux.nist.gov/dads/HTML/formalmethod.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: formalmethod"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.168",
-          "label": "Climate change",
+          "id": "concept.nist.globaloptimum",
+          "label": "global optimum",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Climate change as: Long-term alteration in the characteristic weather conditions of a region, such as changes in precipitation and temperature. This category is also used for climate history , climate variability , climatic change , global climate change , global warming , and paleoclimate",
+          "summary": "NIST DADS defines global optimum as: The best possible solution to a problem.",
           "sources": [
             {
-              "id": "usgs-thesaurus.168",
-              "title": "USGS Thesaurus term 168",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=168"
+              "id": "nist-dads.globaloptimum",
+              "url": "https://xlinux.nist.gov/dads/HTML/globalOptimum.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: globalOptimum"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.30",
-          "label": "Algal blooms",
+          "id": "concept.nist.lowerbound",
+          "label": "lower bound",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Algal blooms as: Exceptional growth of algae and cyanobacteria in lakes, rivers or oceans due to excessive nutrients or climatic conditions. This category is also used for brown tides , with hazards for harmful algal blooms , and red tides",
+          "summary": "NIST DADS defines lower bound as: A function or growth rate below which solving a problem is impossible.",
           "sources": [
             {
-              "id": "usgs-thesaurus.30",
-              "title": "USGS Thesaurus term 30",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=30"
+              "id": "nist-dads.lowerbound",
+              "url": "https://xlinux.nist.gov/dads/HTML/lowerbound.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: lowerbound"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.93",
-          "label": "Biogeochemical cycling",
+          "id": "concept.nist.markovchain",
+          "label": "Markov chain",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Biogeochemical cycling as: The cycling of chemical constituents through a biological system. This category is also used for biogeochemical functioning , biogeochemical processes , decomposition (organic) , and organic decomposition",
+          "summary": "NIST DADS defines Markov chain as: A finite state machine with probabilities for each transition, that is, a probability that the next state is s j given that the current state is s i .",
           "sources": [
             {
-              "id": "usgs-thesaurus.93",
-              "title": "USGS Thesaurus term 93",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=93"
+              "id": "nist-dads.markovchain",
+              "url": "https://xlinux.nist.gov/dads/HTML/markovchain.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: markovchain"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.2277",
-          "label": "Carbon flux",
-          "kind": "concept",
-          "domain": "earth",
+          "id": "method.nist.modelcheckng",
+          "label": "model checking",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Carbon flux as: The rate and amount of carbon exchanged between the oceans, atmosphere, land, and living things. This category is also used for carbon exchange",
+          "summary": "NIST DADS defines model checking as: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.",
           "sources": [
             {
-              "id": "usgs-thesaurus.2277",
-              "title": "USGS Thesaurus term 2277",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=2277"
+              "id": "nist-dads.modelcheckng",
+              "url": "https://xlinux.nist.gov/dads/HTML/modelcheckng.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: modelcheckng"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.1731",
-          "label": "Carbon sequestration",
+          "id": "concept.nist.objective",
+          "label": "objective function",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Carbon sequestration as: Long-term storage of carbon in soils and terrestrial organic material, either by natural or engineered processes. Typically of importance for the balance of CO2 in the global climate system. This category is also used for carbon capture , carbon capture and storage , and carbon storage",
+          "summary": "NIST DADS defines objective function as: A function associated with an optimization problem which determines how good a solution is, for instance, the total cost of edges in a solution to a traveling salesman problem.",
           "sources": [
             {
-              "id": "usgs-thesaurus.1731",
-              "title": "USGS Thesaurus term 1731",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1731"
+              "id": "nist-dads.objective",
+              "url": "https://xlinux.nist.gov/dads/HTML/objective.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: objective"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.562",
-          "label": "Hydrothermal processes",
+          "id": "concept.nist.optimalsoltn",
+          "label": "optimal solution",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Hydrothermal processes as: Natural phenomena relating to heated water generated by igneous activity.",
+          "summary": "NIST DADS defines optimal solution as: A solution to an optimization problem which minimizes (or maximizes) the objective function .",
           "sources": [
             {
-              "id": "usgs-thesaurus.562",
-              "title": "USGS Thesaurus term 562",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=562"
+              "id": "nist-dads.optimalsoltn",
+              "url": "https://xlinux.nist.gov/dads/HTML/optimalsoltn.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: optimalsoltn"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.727",
-          "label": "Metamorphism (geological)",
+          "id": "concept.nist.optimization",
+          "label": "optimization problem",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Metamorphism (geological) as: Process by which rocks are altered in composition and texture by extreme heat, high pressure, or the action of chemicals.",
+          "summary": "NIST DADS defines optimization problem as: A computational problem in which the object is to find the best of all possible solutions. More formally, find a solution in the feasible region which has the minimum (or maximum) value of the objective function .",
           "sources": [
             {
-              "id": "usgs-thesaurus.727",
-              "title": "USGS Thesaurus term 727",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=727"
+              "id": "nist-dads.optimization",
+              "url": "https://xlinux.nist.gov/dads/HTML/optimization.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: optimization"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.1034",
-          "label": "Sediment transport",
+          "id": "concept.nist.performance",
+          "label": "performance guarantee",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Sediment transport as: Transport of solid particles of unconsolidated rock and mineral fragments, chemical precipitates, or biological materials. This category is also used for alluvial transport , bed load , bedload , density flow , dust transport , with estuarine processes for estuarine sediment transport , with longshore currents for littoral drift , with longshore currents for longshore drift , with ocean processes for marine sediment transport , suspended load , and turbidity flow",
+          "summary": "NIST DADS defines performance guarantee as: An expression of the most the result of an approximation algorithm may depart from the optimal solution .",
           "sources": [
             {
-              "id": "usgs-thesaurus.1034",
-              "title": "USGS Thesaurus term 1034",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1034"
+              "id": "nist-dads.performance",
+              "url": "https://xlinux.nist.gov/dads/HTML/performance.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: performance"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.usgs.1145",
-          "label": "Tectonic processes",
+          "id": "concept.nist.prisonersdilemma",
+          "label": "prisoner's dilemma",
           "kind": "concept",
-          "domain": "earth",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The USGS Thesaurus defines Tectonic processes as: The structural forces affecting the deformation, uplift, and movement of the earth's crust. This category is also used for continental drift , dynamic geology , with maps and atlases for paleotectonic maps , plate tectonics , subduction , with maps and atlases for tectonic maps , tectonics , and wilson cycle",
+          "summary": "NIST DADS defines prisoner's dilemma as: Two prisoners are questioned separately about a crime they committed. Each may give evidence against the other or may say nothing. If both say nothing, they get a minor reprimand and go free because of lack of evidence. If one gives evidence and the other says nothing, the first goes free and the second is severely punished. If both give evidence, both are severely punished. The overall (globally) best strategy is for both to say nothing. However not knowing (or trusting) what the other will do, each prisoner's (locally) best strategy is to give evidence, which is the worst possible outcome. In general, a situation where local optimization leads to the worst possible outcome globally.",
           "sources": [
             {
-              "id": "usgs-thesaurus.1145",
-              "title": "USGS Thesaurus term 1145",
-              "url": "https://apps.usgs.gov/thesaurus/term-simple.php?thcode=2&code=1145"
+              "id": "nist-dads.prisonersdilemma",
+              "url": "https://xlinux.nist.gov/dads/HTML/prisonersDilemma.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: prisonersDilemma"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.mesh.d001698",
-          "label": "Biomedical Engineering",
+          "id": "concept.nist.probesequenc",
+          "label": "probe sequence",
           "kind": "concept",
-          "domain": "engineering",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "NLM MeSH describes Biomedical Engineering as: Application of principles and practices of engineering science to biomedical research and health care.",
-          "sources": [
-            {
-              "id": "nlm-mesh.d001698",
-              "title": "NLM MeSH Browser descriptor D001698",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D001698"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.mesh.d000076227",
-          "label": "Stereolithography",
-          "kind": "field",
-          "domain": "engineering",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Stereolithography as: A 3D printing technology where a computer-controlled moving laser beam is used to build up the required structure, layer by layer, from liquid POLYMERS that harden on contact with laser light (photopolymerization).",
+          "summary": "NIST DADS defines probe sequence as: The list of locations which a method for open addressing produces as alternatives in case of a collision .",
           "sources": [
             {
-              "id": "nlm-mesh.d000076227",
-              "title": "NLM MeSH Browser descriptor D000076227",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000076227"
+              "id": "nist-dads.probesequenc",
+              "url": "https://xlinux.nist.gov/dads/HTML/probesequenc.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: probesequenc"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.mesh.d044085",
-          "label": "Microfluidics",
-          "kind": "field",
-          "domain": "engineering",
+          "id": "method.nist.randomsearch",
+          "label": "random search",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "NLM MeSH describes Microfluidics as: The study of fluid channels and chambers of tiny dimensions of tens to hundreds of micrometers and volumes of nanoliters or picoliters. This is of interest in biological MICROCIRCULATION and used in MICROCHEMISTRY and INVESTIGATIVE TECHNIQUES .",
+          "summary": "NIST DADS defines random search as: Repeatedly check items in an array at random until successful.",
           "sources": [
             {
-              "id": "nlm-mesh.d044085",
-              "title": "NLM MeSH Browser descriptor D044085",
-              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D044085"
+              "id": "nist-dads.randomsearch",
+              "url": "https://xlinux.nist.gov/dads/HTML/randomSearch.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: randomSearch"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.eia.air-collector",
-          "label": "Air collector",
+          "id": "concept.nist.semidefinite",
+          "label": "semidefinite programming",
           "kind": "concept",
-          "domain": "engineering",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The U.S. Energy Information Administration glossary defines Air collector as: A medium-temperature collector used predominantly in space heating, utilizing pumped air as the heat-transfer medium.",
+          "summary": "NIST DADS defines semidefinite programming as: A generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix.",
           "sources": [
             {
-              "id": "eia-glossary.A",
-              "title": "U.S. EIA Glossary, letter A",
-              "url": "https://www.eia.gov/tools/glossary/index.php?id=A"
+              "id": "nist-dads.semidefinite",
+              "url": "https://xlinux.nist.gov/dads/HTML/semidefinite.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: semidefinite"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.eia.coal-mine",
-          "label": "Coal mine",
-          "kind": "concept",
-          "domain": "engineering",
+          "id": "method.nist.simulatedannealing",
+          "label": "simulated annealing",
+          "kind": "method",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The U.S. Energy Information Administration glossary defines Coal mine as: An industrial operation for extracting coal from the ground. Mines include earth-moving and excavating operations and usually incorporate activities related to the processing (cleaning and crushing or sizing) and transporting of coal (such as loading the coal into a rail car) to the end user.",
+          "summary": "NIST DADS defines simulated annealing as: A technique to find a good solution to an optimization problem by trying random variations of the current solution. A worse variation is accepted as the new solution with a probability that decreases as the computation proceeds. The slower the cooling schedule , or rate of decrease, the more likely the algorithm is to find an optimal or near- optimal solution .",
           "sources": [
             {
-              "id": "eia-glossary.C",
-              "title": "U.S. EIA Glossary, letter C",
-              "url": "https://www.eia.gov/tools/glossary/index.php?id=C"
+              "id": "nist-dads.simulatedannealing",
+              "url": "https://xlinux.nist.gov/dads/HTML/simulatedAnnealing.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: simulatedAnnealing"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.eia.electric-energy",
-          "label": "Electric energy",
+          "id": "concept.nist.stronglyconnectedcompo",
+          "label": "strongly connected component",
           "kind": "concept",
-          "domain": "engineering",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The U.S. Energy Information Administration glossary defines Electric energy as: The ability of an electric current to produce work, heat, light, or other forms of energy. It is measured in kilowatthours.",
+          "summary": "NIST DADS defines strongly connected component as: A strongly connected subgraph , S, of a directed graph , D, such that no vertex of D can be added to S and it still be strongly connected. Informally, a maximal subgraph in which every vertex is reachable from every other vertex.",
           "sources": [
             {
-              "id": "eia-glossary.E",
-              "title": "U.S. EIA Glossary, letter E",
-              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
+              "id": "nist-dads.stronglyconnectedcompo",
+              "url": "https://xlinux.nist.gov/dads/HTML/stronglyConnectedCompo.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: stronglyConnectedCompo"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.eia.energy-consumption",
-          "label": "Energy consumption",
+          "id": "concept.nist.stronglynp",
+          "label": "strongly NP-hard",
           "kind": "concept",
-          "domain": "engineering",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.",
+          "summary": "NIST DADS defines strongly NP-hard as: The complexity class of decision problems which are still NP-hard even when all numbers in the input are bounded by some polynomial in the length of the input.",
           "sources": [
             {
-              "id": "eia-glossary.E",
-              "title": "U.S. EIA Glossary, letter E",
-              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
+              "id": "nist-dads.stronglynp",
+              "url": "https://xlinux.nist.gov/dads/HTML/stronglyNP.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: stronglyNP"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.eia.leading-edge",
-          "label": "Leading edge",
+          "id": "concept.nist.temporllogic",
+          "label": "temporal logic",
           "kind": "concept",
-          "domain": "engineering",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The U.S. Energy Information Administration glossary defines Leading edge as: In reference to a wind energy conversion system, the area of a turbine blade surface that first comes into contact with the wind.",
+          "summary": "NIST DADS defines temporal logic as: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification .",
           "sources": [
             {
-              "id": "eia-glossary.L",
-              "title": "U.S. EIA Glossary, letter L",
-              "url": "https://www.eia.gov/tools/glossary/index.php?id=L"
+              "id": "nist-dads.temporllogic",
+              "url": "https://xlinux.nist.gov/dads/HTML/temporllogic.html",
+              "title": "NIST Dictionary of Algorithms and Data Structures: temporllogic"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054245",
-          "label": "linguistics",
+          "id": "ology.psycholinguistics",
+          "label": "Psycholinguistics",
           "kind": "field",
-          "domain": "humanities",
+          "domain": "information",
           "era": "undated",
           "status": "reported",
-          "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines linguistics as: Scientific study of language as a system, covering the structure, sounds, and meaning, as well as the history of the relations of languages to each other and the cultural place of language in human behavior.",
-          "sources": [
-            {
-              "id": "getty-aat.300054245",
-              "title": "Getty Art & Architecture Thesaurus record 300054245",
-              "url": "http://vocab.getty.edu/page/aat/300054245"
-            }
+          "summary": "NLM MeSH describes Psycholinguistics as: A discipline concerned with relations between messages and the characteristics of individuals who select and interpret them; it deals directly with the processes of encoding (phonetics) and decoding (psychoacoustics) as they relate states of messages to states of communicators.",
+          "tags": [
+            "ology"
           ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.aat.300054280",
-          "label": "aesthetics",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines aesthetics as: Appreciation or criticism of the beautiful. The term refers to a branch of Western philosophy concerned primarily with the fine arts, although it may also be used in the context of the appreciation of natural beauty. Usage of the term dates from the 18th century, although historical discussions regarding issues now called \"aesthetics\" date from Antiquity.",
           "sources": [
             {
-              "id": "getty-aat.300054280",
-              "title": "Getty Art & Architecture Thesaurus record 300054280",
-              "url": "http://vocab.getty.edu/page/aat/300054280"
+              "id": "nlm-mesh.14af6d0afad21004276f",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011578",
+              "title": "NLM MeSH descriptor or exact lookup: https://meshb.nlm.nih.gov/record/ui?ui=D011578"
             }
           ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.aat.300054288",
-          "label": "epistemology",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines epistemology as: Branch of philosophy that studies the nature, origin, limits, and validity of human knowledge.",
-          "sources": [
-            {
-              "id": "getty-aat.300054288",
-              "title": "Getty Art & Architecture Thesaurus record 300054288",
-              "url": "http://vocab.getty.edu/page/aat/300054288"
-            }
-          ],
-          "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054297",
-          "label": "phenomenology",
+          "id": "field.mesh.d011057",
+          "label": "Politics",
           "kind": "field",
-          "domain": "humanities",
+          "domain": "social",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines phenomenology as: Branch of modern philosophy dealing with the description and classification of phenomena.",
+          "summary": "NLM MeSH describes Politics as: Activities concerned with governmental policies, functions, etc.",
           "sources": [
             {
-              "id": "getty-aat.300054297",
-              "title": "Getty Art & Architecture Thesaurus record 300054297",
-              "url": "http://vocab.getty.edu/page/aat/300054297"
+              "id": "nlm-mesh.d011057",
+              "title": "NLM MeSH Browser descriptor D011057",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D011057"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300069306",
-          "label": "Ideal, the",
+          "id": "concept.mesh.d007391",
+          "label": "International Cooperation",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "social",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines Ideal, the as: The aesthetic quality of the permanent, essential, or eternal character of appearances or other phenomena, which is rooted in an idea of perfection or archetype. It is ultimately derived from from Plato's \"Theory of Ideas,\" which holds that perfection is a concept that is only mirrored imperfectly in real life. This perfection was the ideal to which artists sought to strive in certain periods, styles, or contexts. The concept was particularly evident in various periods of antique art, the Renaissance, and in the 17th- and 18th-century art academies throughout Europe.",
+          "summary": "NLM MeSH describes International Cooperation as: The interaction of persons or groups of persons representing various nations in the pursuit of a common goal or interest.",
           "sources": [
             {
-              "id": "getty-aat.300069306",
-              "title": "Getty Art & Architecture Thesaurus record 300069306",
-              "url": "http://vocab.getty.edu/page/aat/300069306"
+              "id": "nlm-mesh.d007391",
+              "title": "NLM MeSH Browser descriptor D007391",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D007391"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300060368",
-          "label": "syncretism",
+          "id": "concept.mesh.d000088562",
+          "label": "Persistent Infection",
           "kind": "concept",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines syncretism as: Reconciliation or union of conflicting (as religious) beliefs or an effort intending such.",
-          "sources": [
-            {
-              "id": "getty-aat.300060368",
-              "title": "Getty Art & Architecture Thesaurus record 300060368",
-              "url": "http://vocab.getty.edu/page/aat/300060368"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.aat.300054240",
-          "label": "musicology",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines musicology as: Scientific and orderly investigation and study of music and related areas, including history, theory, music education, acoustics, psychology, and social and cultural aspects.",
-          "sources": [
-            {
-              "id": "getty-aat.300054240",
-              "title": "Getty Art & Architecture Thesaurus record 300054240",
-              "url": "http://vocab.getty.edu/page/aat/300054240"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.aat.300054256",
-          "label": "theoretical linguistics",
-          "kind": "field",
-          "domain": "humanities",
-          "era": "undated",
-          "status": "reported",
-          "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines theoretical linguistics as: Branch of linguistics where the primary aim is to establish universal principles for the study of language and languages, and to determine the underlying structure and other characteristics of human language.",
-          "sources": [
-            {
-              "id": "getty-aat.300054256",
-              "title": "Getty Art & Architecture Thesaurus record 300054256",
-              "url": "http://vocab.getty.edu/page/aat/300054256"
-            }
-          ],
-          "tags": [],
-          "aliases": []
-        },
-        {
-          "id": "field.aat.300389758",
-          "label": "cryptography",
-          "kind": "field",
-          "domain": "humanities",
+          "domain": "health",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines cryptography as: The practice of writing in code or symbols.",
+          "summary": "NLM MeSH describes Persistent Infection as: Infection which lasts for a long period with continuous display of clinical features. Persistent infection arises due to inability of host cells to clear primary infections completely. When persistent infections are cleared so that infection symptoms are under control they are often referred to as chronic infections. LATENT INFECTIONS are infections in which manifestation of clinical symptoms appear later.",
           "sources": [
             {
-              "id": "getty-aat.300389758",
-              "title": "Getty Art & Architecture Thesaurus record 300389758",
-              "url": "http://vocab.getty.edu/page/aat/300389758"
+              "id": "nlm-mesh.d000088562",
+              "title": "NLM MeSH Browser descriptor D000088562",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000088562"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054254",
-          "label": "semiotics",
-          "kind": "field",
-          "domain": "humanities",
+          "id": "concept.mesh.d006803",
+          "label": "Human Development",
+          "kind": "concept",
+          "domain": "social",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines semiotics as: Theory and study of signs and symbols dealing especially with their function in languages, including syntax, semantics, and pragmatics.",
+          "summary": "NLM MeSH describes Human Development as: Continuous sequential changes which occur in the physiological and psychological functions during the life-time of an individual.",
           "sources": [
             {
-              "id": "getty-aat.300054254",
-              "title": "Getty Art & Architecture Thesaurus record 300054254",
-              "url": "http://vocab.getty.edu/page/aat/300054254"
+              "id": "nlm-mesh.d006803",
+              "title": "NLM MeSH Browser descriptor D006803",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D006803"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300016617",
-          "label": "The Americas",
+          "id": "concept.mesh.d000067656",
+          "label": "Optimism",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "social",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines The Americas as: Refers to a style region encompassing North, Central and South America.",
+          "summary": "NLM MeSH describes Optimism as: Mental attitude that interprets life events as generally being positive.",
           "sources": [
             {
-              "id": "getty-aat.300016617",
-              "title": "Getty Art & Architecture Thesaurus record 300016617",
-              "url": "http://vocab.getty.edu/page/aat/300016617"
+              "id": "nlm-mesh.d000067656",
+              "title": "NLM MeSH Browser descriptor D000067656",
+              "url": "https://meshb.nlm.nih.gov/record/ui?ui=D000067656"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300054181",
-          "label": "graphic design",
+          "id": "concept.eia.carbon-intensity",
+          "label": "Carbon intensity",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines graphic design as: The process of designing visual communications and text for commercial applications, usually to be printed or reproduced photographically, such as in advertisements, books, magazines, newspapers, leaflets, posters, diagrams, trademarks, corporate identities, sign systems, packaging, film, television graphics, etc.",
+          "summary": "The U.S. Energy Information Administration glossary defines Carbon intensity as: The amount of carbon by weight emitted per unit of energy consumed. A common measure of carbon intensity is weight of carbon per British thermal unit (Btu) of energy. When there is only one fossil fuel under consideration, the carbon intensity and the emissions coefficient are identical. When there are several fuels, carbon intensity is based on their combined emissions coefficients weighted by their energy consumption levels. Also see",
           "sources": [
             {
-              "id": "getty-aat.300054181",
-              "title": "Getty Art & Architecture Thesaurus record 300054181",
-              "url": "http://vocab.getty.edu/page/aat/300054181"
+              "id": "eia-glossary.C",
+              "title": "U.S. EIA Glossary, letter C",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=C"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054255",
-          "label": "sociolinguistics",
-          "kind": "field",
-          "domain": "humanities",
+          "id": "concept.eia.compressor-station",
+          "label": "Compressor station",
+          "kind": "concept",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines sociolinguistics as: The study of language as it functions in society, and of the interaction between linguistic and social variables.",
+          "summary": "The U.S. Energy Information Administration glossary defines Compressor station as: Any combination of facilities that supply the energy to move gas in transmission or distribution lines or into storage by increasing the pressure.",
           "sources": [
             {
-              "id": "getty-aat.300054255",
-              "title": "Getty Art & Architecture Thesaurus record 300054255",
-              "url": "http://vocab.getty.edu/page/aat/300054255"
+              "id": "eia-glossary.C",
+              "title": "U.S. EIA Glossary, letter C",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=C"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054263",
-          "label": "phonology",
-          "kind": "field",
-          "domain": "humanities",
+          "id": "concept.eia.distribution-system",
+          "label": "Distribution system",
+          "kind": "concept",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines phonology as: Study of the systems and patterns of language, including how speech sounds are combined, organized, and convey meaning. For the study of the production, transmission, perception, and description of speech sounds, use \"phonetics.\"",
+          "summary": "The U.S. Energy Information Administration glossary defines Distribution system as: The portion of the transmission and facilities of an electric system that is dedicated to delivering electric energy to an end-user.",
           "sources": [
             {
-              "id": "getty-aat.300054263",
-              "title": "Getty Art & Architecture Thesaurus record 300054263",
-              "url": "http://vocab.getty.edu/page/aat/300054263"
+              "id": "eia-glossary.D",
+              "title": "U.S. EIA Glossary, letter D",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=D"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "field.aat.300054264",
-          "label": "pragmatics",
-          "kind": "field",
-          "domain": "humanities",
+          "id": "concept.eia.electric-vehicle-ev",
+          "label": "Electric vehicle (EV)",
+          "kind": "concept",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines pragmatics as: Study of the aspects of meaning in language that are related to the use of language in a natural context.",
+          "summary": "The U.S. Energy Information Administration glossary defines Electric vehicle (EV) as: A general term for any on-road licensed vehicle that can plug into an electric power source and uses electric power to move. EVs plug into a source of electricity and store power in a battery pack for all or part of their power needs. Includes Battery Electric Vehicles (BEVs) and Plug-in Hybrid Vehicles (PHEVs). Can also be referred to as Plug-in Electric Vehicles (PEV).",
           "sources": [
             {
-              "id": "getty-aat.300054264",
-              "title": "Getty Art & Architecture Thesaurus record 300054264",
-              "url": "http://vocab.getty.edu/page/aat/300054264"
+              "id": "eia-glossary.E",
+              "title": "U.S. EIA Glossary, letter E",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300019275",
-          "label": "Bronze Age",
+          "id": "concept.eia.electricity-generation",
+          "label": "Electricity generation",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines Bronze Age as: Refers to the period and culture associated with the second age in the Three Age system developed by Christian Jürgensen Thomsen in 1836. It is characterized by the widespread use of bronze, which is an alloy of copper and tin, lead, antimony, or arsenic, in the manufacture of tools and weapons. It developed at different times in different parts of the world, from around 3,500 BCE in Greece and China to around 1,400 BCE in several areas of Europe. There was not a Bronze Age in the Americas, since the local Stone Age cultures were introduced directly to Iron Age technologies by European explorers.",
+          "summary": "The U.S. Energy Information Administration glossary defines Electricity generation as: The process of producing electric energy or the amount of electric energy produced by transforming other forms of energy, commonly expressed in kilowatthours(kWh) or megawatthours (MWh).",
           "sources": [
             {
-              "id": "getty-aat.300019275",
-              "title": "Getty Art & Architecture Thesaurus record 300019275",
-              "url": "http://vocab.getty.edu/page/aat/300019275"
+              "id": "eia-glossary.E",
+              "title": "U.S. EIA Glossary, letter E",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300019278",
-          "label": "Late Bronze Age",
+          "id": "concept.eia.energy-consumption",
+          "label": "Energy consumption",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines Late Bronze Age as: Refers to the final stage of Bronze Age cultures, distinguished from the Early and Middle Bronze Age cultures by differences in metal assemblages and burial rites. It is characterized in part by very sophisticated and elaborate metalworking techniques and tool and weapon designs. It is characterized by the development of mass-produced objects, hollow objects, armor, and large objects, such as caldrons and shields.",
+          "summary": "The U.S. Energy Information Administration glossary defines Energy consumption as: The use of energy as a source of heat or power or as a raw material input to a manufacturing process.",
           "sources": [
             {
-              "id": "getty-aat.300019278",
-              "title": "Getty Art & Architecture Thesaurus record 300019278",
-              "url": "http://vocab.getty.edu/page/aat/300019278"
+              "id": "eia-glossary.E",
+              "title": "U.S. EIA Glossary, letter E",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=E"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300262706",
-          "label": "South African",
+          "id": "concept.eia.fuel-cell",
+          "label": "Fuel cell",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines South African as: Style and culture of the people of South Africa.",
+          "summary": "The U.S. Energy Information Administration glossary defines Fuel cell as: A device capable of generating an electrical current by converting the chemical energy of a fuel (e.g.,",
           "sources": [
             {
-              "id": "getty-aat.300262706",
-              "title": "Getty Art & Architecture Thesaurus record 300262706",
-              "url": "http://vocab.getty.edu/page/aat/300262706"
+              "id": "eia-glossary.F",
+              "title": "U.S. EIA Glossary, letter F",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=F"
             }
           ],
           "tags": [],
           "aliases": []
         },
         {
-          "id": "concept.aat.300016586",
-          "label": "North African",
+          "id": "concept.eia.motor-speed",
+          "label": "Motor speed",
           "kind": "concept",
-          "domain": "humanities",
+          "domain": "engineering",
           "era": "undated",
           "status": "reported",
           "frontier": false,
-          "summary": "The Getty Art & Architecture Thesaurus defines North African as: Styles and cultures of the African peoples living in Morocco, Algeria, Tunisia, Libya, and Mauritania.",
+          "summary": "The U.S. Energy Information Administration glossary defines Motor speed as: The number of revolutions that the motor turns in a given time period (i.e. revolutions per minute, rpm).",
           "sources": [
             {
-              "id": "getty-aat.300016586",
-              "title": "Getty Art & Architecture Thesaurus record 300016586",
-              "url": "http://vocab.getty.edu/page/aat/300016586"
+              "id": "eia-glossary.M",
+              "title": "U.S. EIA Glossary, letter M",
+              "url": "https://www.eia.gov/tools/glossary/index.php?id=M"
             }
           ],
           "tags": [],
@@ -822047,2440 +848080,1684 @@
       ],
       "sources": [
         {
-          "id": "source.frontier.doi-10-1111-ecot-70052",
-          "url": "https://api.crossref.org/works/10.1111/ecot.70052",
-          "final_url": "https://api.crossref.org/works/10.1111/ecot.70052",
-          "title": "Crossref record doi:10.1111/ecot.70052: Script Reform, Human Capital and Social Change: Evidence From Uzbekistan's Latin Alphabet Transition",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:25.192587+00:00",
-          "sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
-          "raw_sha256": "284081acaf8527796995037e5825c1f6a599d84fd9b90fde3881a0430cc00b8d",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "fa8f661644be585a3fa446db77946b0dc747b472a277a4dcfcbec46854593e67"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-qj-70333",
-          "url": "https://api.crossref.org/works/10.1002/qj.70333",
-          "final_url": "https://api.crossref.org/works/10.1002/qj.70333",
-          "title": "Crossref record doi:10.1002/qj.70333: Characteristics of quasi‐stationary band‐shaped precipitation systems in Japan between 1989 and 2022",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:53.003913+00:00",
-          "sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
-          "raw_sha256": "51914e0ebac7e9cf28016ba6bfdb751c1393daebedf755f41e28c24acb118c64",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "fbec488e94cbf26e8d6a7120926f0e992df7e804d5748b17f8727b0f7a28cc5f"
-        },
-        {
-          "id": "source.frontier.doi-10-1371-journal-pwat-0000557",
-          "url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pwat.0000557",
-          "title": "Crossref record doi:10.1371/journal.pwat.0000557: Near real-time long-read eDNA sequencing reveals harmful algal bloom dynamics in the Indian River Lagoon",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:53.825542+00:00",
-          "sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
-          "raw_sha256": "f4361369f6de5a32d80cc6db8c9c437b3bd7cd2aebf2d9c5889eaadee20b76e3",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "04a56d23b89f9a41cdbcd63b82318aa3547f3be44e3e40adb8499f29cd46ac94"
-        },
-        {
-          "id": "source.frontier.doi-10-1111-medu-70340",
-          "url": "https://api.crossref.org/works/10.1111/medu.70340",
-          "final_url": "https://api.crossref.org/works/10.1111/medu.70340",
-          "title": "Crossref record doi:10.1111/medu.70340: Health equity is the goal of medical education: Implications for assessment validity",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:25.997461+00:00",
-          "sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
-          "raw_sha256": "1a26b9d6e98cee42f9077e5722140e235c4bca7a58fd6fe1eb47f168f601abda",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "57111c49baf17540115e49b89c5a2709b0f79fc7d91d13f61e46a068e9f368fd"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl124622",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124622",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124622",
-          "title": "Crossref record doi:10.1029/2026gl124622: Changes in Flood Frequency and Seasonality Across Midwestern U.S. Watersheds Under a Warming Climate: Insights From Convection‐Permitting Climate Simu",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:26.771916+00:00",
-          "sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
-          "raw_sha256": "7c042ea04e53e8000836fe6679be1913b6bbf923dad57c192b99b309253cf416",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "72f62dc8276cc576e7845f5e01389d05534f1b491bfbb279c390d6a44125a0d3"
-        },
-        {
-          "id": "source.frontier.doi-10-15351-2373-8456-1235",
-          "url": "https://api.crossref.org/works/10.15351/2373-8456.1235",
-          "final_url": "https://api.crossref.org/works/10.15351/2373-8456.1235",
-          "title": "Crossref record doi:10.15351/2373-8456.1235: Sustainable Utilization Challenges and Opportunities of the Blue Economy Resources in Bangladesh",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:28.546577+00:00",
-          "sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
-          "raw_sha256": "5078513e2a85160a8f17c7c624c64eb154cb8b9f26caed6cef93bb1ef3f04f87",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "c3b02ba7a15cc7290c482e97051dd086a5bf018e768523da076bb05e22af21fd"
-        },
-        {
-          "id": "source.frontier.doi-10-15351-2373-8456-1216",
-          "url": "https://api.crossref.org/works/10.15351/2373-8456.1216",
-          "final_url": "https://api.crossref.org/works/10.15351/2373-8456.1216",
-          "title": "Crossref record doi:10.15351/2373-8456.1216: Valuation Methods and Their Relevance in Achieving Marine Protected Areas Targets: A Systematic Review",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:29.337521+00:00",
-          "sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
-          "raw_sha256": "ccede2034e380d70407714f9156b4232cf7b0d637599625b79a140139cd296e0",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "d38bcedfbe5cb0ca534ac97643eff82e20729b15d31618471c3f160416765043"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl125301",
-          "url": "https://api.crossref.org/works/10.1029/2026gl125301",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl125301",
-          "title": "Crossref record doi:10.1029/2026gl125301: Seawall‐Induced Isolation Alters Hydrological‐Biogeochemical Conditions in Coastal Wetlands",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:54.669727+00:00",
-          "sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
-          "raw_sha256": "f6efebe914f0f789b7c0d29eaa4fe41db23b17464b2f85068893990851d31757",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "a0b5545ae159ede8a7cc331e7ed175c0619633e3b13cdfbf1e01d7ca511726b4"
-        },
-        {
-          "id": "source.frontier.doi-10-21425-fob-19-142560",
-          "url": "https://api.crossref.org/works/10.21425/fob.19.142560",
-          "final_url": "https://api.crossref.org/works/10.21425/fob.19.142560",
-          "title": "Crossref record doi:10.21425/fob.19.142560: Environmental and geographic predictors of seed plant diversity across South American terrestrial coastal lomas",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:55.522880+00:00",
-          "sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
-          "raw_sha256": "29f2cc5953bc6c80f82dfb6be52e099828fe488f03ac2e3f3ba7e449689d4260",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "e132a199ee42712db8b5cc8f123f4011459609a4dc04467fd0c8b2305246107b"
-        },
-        {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0001044",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001044",
-          "title": "Crossref record doi:10.1371/journal.pclm.0001044: Shifting climate in Caribbean tropical forests: Long-term trends at La Selva (Costa Rica) and El Verde (Puerto Rico)",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:32.691435+00:00",
-          "sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
-          "raw_sha256": "29b29eda3a12c31a24c112fa6b9e96cc513884ceff6efc406d30cb2d9b48cf3d",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "b9be4bb1d661e93f3aca74efec520a6c3d1cbf351d0ead7795c236eae0cde09f"
-        },
-        {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000886",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000886",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000886: How much climate-smart agriculture is enough? A dose-response analysis of technology adoption effects on farmer welfare in Ghana",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:33.533067+00:00",
-          "sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
-          "raw_sha256": "bd156c2913ad7db44dc05b446aa996e912e92d1abf8bacfe2460824968f4f026",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "d775b6513c968dc1775fd4659db06e30455f28c07bdcc01fc213ddca56a50197"
-        },
-        {
-          "id": "source.frontier.doi-10-1075-consl-25020-lia",
-          "url": "https://api.crossref.org/works/10.1075/consl.25020.lia",
-          "final_url": "https://api.crossref.org/works/10.1075/consl.25020.lia",
-          "title": "Crossref record doi:10.1075/consl.25020.lia: When ‘John broke up Mary’ becomes acceptable",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:35.203996+00:00",
-          "sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
-          "raw_sha256": "5eac157c5699ee4d376389ee2e5dac81c14ca03df3dbf4f66619b9bc70c607b8",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "5fa871059e4fe47ed3201778fe74ffe12a0cbb15ada00091d7cd37a0b9aa19a4"
-        },
-        {
-          "id": "source.frontier.doi-10-2166-hydro-2026-040",
-          "url": "https://api.crossref.org/works/10.2166/hydro.2026.040",
-          "final_url": "https://api.crossref.org/works/10.2166/hydro.2026.040",
-          "title": "Crossref record doi:10.2166/hydro.2026.040: Risk assessment of failure of multicrop irrigation rules in complex irrigation systems under the background of climate change",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:40.366195+00:00",
-          "sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
-          "raw_sha256": "dce8c36aa55556e2e360b7b8b38577a2daec5389597b1ab5df258a91d2d20a4a",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "2dda830917ebe00e409966a566673d2f9a1c5d4151d1449d8ff422908063b5f7"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-lol2-70186",
-          "url": "https://api.crossref.org/works/10.1002/lol2.70186",
-          "final_url": "https://api.crossref.org/works/10.1002/lol2.70186",
-          "title": "Crossref record doi:10.1002/lol2.70186: Hidden subsurface suspended sediment export from Greenland's marine‐terminating glaciers",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:46.515688+00:00",
-          "sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
-          "raw_sha256": "0adfc6849ef277905bec8bf19591a586874c25a7707721b6607fc7dbcb437f18",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "44ff192e3025cdc3faefb10766361d17b2b6a4f659dfc40b59d9361e19d8e7e7"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl124411",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124411",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124411",
-          "title": "Crossref record doi:10.1029/2026gl124411: Resolution Dependence in a Global Atmospheric Simulation From km to 220 m Grid Spacing",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:48.998267+00:00",
-          "sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
-          "raw_sha256": "551d8bdb938809a5ca2656f1709d12159412548d8795a60df0e26aa7d74635fa",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "41abb890555d6726935ac099934de1e414ad118b7da874e5288e29b9377bf9af"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-joc-70629",
-          "url": "https://api.crossref.org/works/10.1002/joc.70629",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70629",
-          "title": "Crossref record doi:10.1002/joc.70629: Shifting Patterns of Precipitation Extremes in the S outheast A tlantic Basin— B razil: From Observed Trends to Future Projections",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:56.344804+00:00",
-          "sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
-          "raw_sha256": "df884b04158866a7e4d250d337ca44a5dabeccbaa08634c745d6870d24ae6778",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "302ded7703e7bf2c6b3938811ccf1d918740d1c2e5f88ea57a1d30be4fe037fe"
-        },
-        {
-          "id": "source.frontier.doi-10-1111-1467-9566-70277",
-          "url": "https://api.crossref.org/works/10.1111/1467-9566.70277",
-          "final_url": "https://api.crossref.org/works/10.1111/1467-9566.70277",
-          "title": "Crossref record doi:10.1111/1467-9566.70277: The Politics of Reproductive Signification: Navigating Legal Definitions of Parenthood in the Context of UK Informal Donor Conception",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:50.681468+00:00",
-          "sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
-          "raw_sha256": "c3df786b1ca66dbbee0acbe6f0fefb1ada26c36ec52a49832cd731c46d07d8e5",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "7728cbef8fa482a10ab4a6f53bc42c67a84c17f2103d410f68490e0045fb36db"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-jpln-70129",
-          "url": "https://api.crossref.org/works/10.1002/jpln.70129",
-          "final_url": "https://api.crossref.org/works/10.1002/jpln.70129",
-          "title": "Crossref record doi:10.1002/jpln.70129: Climate Change and Reduction of Soil Organic Layer Thickness Increases Drought Risk in Mountain Forests of the Northern Alps",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:51.502030+00:00",
-          "sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
-          "raw_sha256": "c946603a085d2ccc9f078dab8186d43ebb3ed731d4ee7155717502ae4b9db022",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "f0cd9fb06797f1e3ce0257a9d7257fd183c44ab47aa4ca2724c2d674084d1a16"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-joc-70613",
-          "url": "https://api.crossref.org/works/10.1002/joc.70613",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70613",
-          "title": "Crossref record doi:10.1002/joc.70613: Added Value of CESM ‐Driven WRF for Mean and Extreme Precipitation Over Complex Terrain in Southwest Asia",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:57.190074+00:00",
-          "sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
-          "raw_sha256": "a509676be7d3f1d839ecfb3edbf21b20c3b36322e38a8cc5564a4d77caafc5ea",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "36d190c9c037f29e3cefbf93404c78a9dbefb769df9219b5f685797fa9f2dcbf"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-joc-70605",
-          "url": "https://api.crossref.org/works/10.1002/joc.70605",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70605",
-          "title": "Crossref record doi:10.1002/joc.70605: Climate Change Projections for Mexico in the 21st Century",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:52.592534+00:00",
-          "sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
-          "raw_sha256": "fbc49272e1584e04fdba2380031bd0ec453ce757f94477f03944899656e8fbc9",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "1573319e8895c3c620f64425230023e018988af795ec80ecef31fdbd626862df"
-        },
-        {
-          "id": "source.frontier.doi-10-3176-arch-2026-2-03",
-          "url": "https://api.crossref.org/works/10.3176/arch.2026.2.03",
-          "final_url": "https://api.crossref.org/works/10.3176/arch.2026.2.03",
-          "title": "Crossref record doi:10.3176/arch.2026.2.03: Animal exploitation over two millennia at Aukuras hill hillfort at the Kernavė archaeological complex, Lithuania: zooarchaeological evidence from bird",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:53.462516+00:00",
-          "sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
-          "raw_sha256": "cbd85a771e8996c7c484d9e8949b6d32c3338540c39d8c07110a2d0cea8f7e95",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "b6f2ca5f5588f93a5d229c4541c2ed9e5f5d2cfe7908eab30d90262062d0edf6"
-        },
-        {
-          "id": "source.frontier.doi-10-2166-wcc-2026-580",
-          "url": "https://api.crossref.org/works/10.2166/wcc.2026.580",
-          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.580",
-          "title": "Crossref record doi:10.2166/wcc.2026.580: Evaluating remotely sensed climate products for monitoring ENSO-driven concurrent heat and water-deficit stress in rainfed maize–soybean systems of So",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:55.112434+00:00",
-          "sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
-          "raw_sha256": "c5c5dba845c692e0d260e14cc0f979e4a38f54f44ae7f925ec23b16cb9bada6c",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "2f956b3dcf67c160cf573e7ff02d7d8e98d25efc16ad564dc6efa4d15bc2945a"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-ijop-70275",
-          "url": "https://api.crossref.org/works/10.1002/ijop.70275",
-          "final_url": "https://api.crossref.org/works/10.1002/ijop.70275",
-          "title": "Crossref record doi:10.1002/ijop.70275: To Whom National Culture Matters: An Analysis of Mentions of Countries in Titles and Abstracts in Social and Personality Psychology and Related Fields",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:55.923411+00:00",
-          "sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
-          "raw_sha256": "daa6aefa0c3a0c974583d4ac8e0ce4d56bfbc9e1cd899c0c8f0ff6fbcf825dd1",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "ec4de239d6391a24e62051902b80dadad1bdbde7d0caafaabcef89827a1e816c"
-        },
-        {
-          "id": "source.frontier.doi-10-3897-popecon-10-e186220",
-          "url": "https://api.crossref.org/works/10.3897/popecon.10.e186220",
-          "final_url": "https://api.crossref.org/works/10.3897/popecon.10.e186220",
-          "title": "Crossref record doi:10.3897/popecon.10.e186220: Well-Being Among Married Couples: The Role of Time Allocation",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:56.701947+00:00",
-          "sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
-          "raw_sha256": "7fa0d76bd853922db3cfa882927da61ebb542e4336cb652104e517adb3380282",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "2a14fc4a55d678ca1f90bccd9a245774bac43cbe4a6c6326ec3d4d7cb65626a6"
-        },
-        {
-          "id": "source.frontier.doi-10-2166-wcc-2026-507",
-          "url": "https://api.crossref.org/works/10.2166/wcc.2026.507",
-          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.507",
-          "title": "Crossref record doi:10.2166/wcc.2026.507: Climate trends in the Azerbaijani Caspian Sea sector and associated atmospheric circulation indices",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:57.585143+00:00",
-          "sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
-          "raw_sha256": "501e970e36490015e57744f4f68bbd2e5d22e84fa9f49180800bb93684cc70e2",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "dcbd521d518afd9b98f9b9a778b40b7827c2615b5991637be5ca443521543273"
-        },
-        {
-          "id": "source.frontier.doi-10-3897-brics-econ-7-e183393",
-          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393",
-          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e183393",
-          "title": "Crossref record doi:10.3897/brics-econ.7.e183393: Stock market reaction to fraud outbreaks in the Indian banking sector",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:58.689592+00:00",
-          "sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
-          "raw_sha256": "f97da26ad30a45ace94c68047a9ea0869609ff23294bf4ab7a4b3f11e0c08029",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "5496ecefdb176765ddfab909f354454486e993d436d6b199b5f2c871fd42a58c"
-        },
-        {
-          "id": "source.frontier.doi-10-38159-ehass-2026785",
-          "url": "https://api.crossref.org/works/10.38159/ehass.2026785",
-          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026785",
-          "title": "Crossref record doi:10.38159/ehass.2026785: Does the listener care? Emotional resonance and connection in the age of algorithmic music",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:05:59.508145+00:00",
-          "sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
-          "raw_sha256": "72f865db0b2b17341777df5dd749e92b301a0d8094648debddf00f90faa77e2a",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "2247f126b9a785ec4e786f785085dc9edd2fd77babdbd8846293ecbedaa1c7fb"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl124090",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124090",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124090",
-          "title": "Crossref record doi:10.1029/2026gl124090: How Well Can the Surface Water and Ocean Topography (SWOT) Satellite Mission Observe Irrigation Canals?",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:00.312045+00:00",
-          "sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
-          "raw_sha256": "4a3987d1fb9d82170ff580cc48c05a482171264ba4595b7bf80c3dd4e7f04c84",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "0bdd4aa851ae4e2cff03ee4bc78e91c68b4ce1d06355e39573934cb880933671"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-pei3-70207",
-          "url": "https://api.crossref.org/works/10.1002/pei3.70207",
-          "final_url": "https://api.crossref.org/works/10.1002/pei3.70207",
-          "title": "Crossref record doi:10.1002/pei3.70207: Systematic Review of Climate Change Impacts on Ethiopia's Food Systems: Risk and Vulnerability Assessment",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:01.246038+00:00",
-          "sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
-          "raw_sha256": "a6b280517e8781cfa49101ae707b60d71b88315543c23db25aedc4e7d046a2fb",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "77c51ac5b779fe76735187c776eee841602ed4025dc034fe59ed6342f0d2be16"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-fea2-70077",
-          "url": "https://api.crossref.org/works/10.1002/fea2.70077",
-          "final_url": "https://api.crossref.org/works/10.1002/fea2.70077",
-          "title": "Crossref record doi:10.1002/fea2.70077: Assemblages of care: Moral economies, classed labor, and affective exhaustion among Karachi's working middle‐class women",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:02.039510+00:00",
-          "sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
-          "raw_sha256": "3dda1b95f59f9a8c3fe6a31b07d81deae7492435de5ac786c9359ef2045c126b",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "79bebcac2f6efe7fe731646dfea04ce02e78bf2e3fc6cac29d23e66ae533d13c"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-eet-70146",
-          "url": "https://api.crossref.org/works/10.1002/eet.70146",
-          "final_url": "https://api.crossref.org/works/10.1002/eet.70146",
-          "title": "Crossref record doi:10.1002/eet.70146: Governance Role Orientations, Perceived Governance Quality, and Citizen Participation in Climate Policy",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:02.822528+00:00",
-          "sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
-          "raw_sha256": "0761e138fa171569a889fa6584c0d434cac53d668a0cd4085790d1af8915cb8e",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "b9ac529259935e6cda885ce2515639ae42fb5ad6634107ec0596aee1f15aa866"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-eco-70279",
-          "url": "https://api.crossref.org/works/10.1002/eco.70279",
-          "final_url": "https://api.crossref.org/works/10.1002/eco.70279",
-          "title": "Crossref record doi:10.1002/eco.70279: Seasonality, Storms and Soil Properties Drive Groundwater and Salinity Dynamics in Retreating Coastal Forests",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:03.664221+00:00",
-          "sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
-          "raw_sha256": "4d71330922a7f6848a8794599a93fab0dcb3d2bf62308dc399be08fdac625a5c",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "08ff519ca5da264609541eea62b2d05a6d1d0f7930b7e56d7b9c31f52cee1726"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl124233",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124233",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124233",
-          "title": "Crossref record doi:10.1029/2026gl124233: Water Storage Capacity Dynamics in Drained Boreal Peatlands: Responses to Rewetting and Climate Change",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:05.356489+00:00",
-          "sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
-          "raw_sha256": "3470eed68b1eebb82d749b090279e55f3735737e99a8f70cf4a84ed5013bcf4a",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "ff3ff876e8a710c6abed9b024e551be67b41bfdc053301ec9ef50409f5908786"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gc013127",
-          "url": "https://api.crossref.org/works/10.1029/2026gc013127",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gc013127",
-          "title": "Crossref record doi:10.1029/2026gc013127: OIB‐Type Garnet Amphibolites From the Xuerongzangbu Area, Central Lhasa Terrane, Tibet: Implications for Songduo Paleo‐Tethys Ocean Evolution and Perm",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:06.398814+00:00",
-          "sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
-          "raw_sha256": "0c3a2776617493ee61a99ebe6da0481782892bc4456a8640a64da8c8d54738ae",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "22e7b4367120013e083474cfcf5cc1cda1913024c528ce26d0f43ac0c6bb4731"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-qj-70320",
-          "url": "https://api.crossref.org/works/10.1002/qj.70320",
-          "final_url": "https://api.crossref.org/works/10.1002/qj.70320",
-          "title": "Crossref record doi:10.1002/qj.70320: Investigating precipitation growth and decay due to orography using radar rainfall observations in Great Britain",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:58.048502+00:00",
-          "sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
-          "raw_sha256": "76cc5b4f2bc860b11840ded1f2b7e280ab1ea7adfdcb0774dd1f20a64f3dc136",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "ff1ac3e12cf234378316737550a0e46e21efcf813beb53e2c87f7893594ef9b1"
-        },
-        {
-          "id": "source.frontier.doi-10-54929-2786-5738-2026-27-09-01",
-          "url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01",
-          "final_url": "https://api.crossref.org/works/10.54929/2786-5738-2026-27-09-01",
-          "title": "Crossref record doi:10.54929/2786-5738-2026-27-09-01: Digital Public Service Maturity and SME Productivity: Cross-Country Evidence From 33 European Countries",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:08.987338+00:00",
-          "sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
-          "raw_sha256": "8c644072e86c579888e32bd5edfc5136182d5d8f2f59d5e2d513493a22164905",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "de7394acd998984c6547e265f61ab0a94bc31d6af1ca39184d9a6664971dd833"
-        },
-        {
-          "id": "source.frontier.doi-10-38159-erats-20261281",
-          "url": "https://api.crossref.org/works/10.38159/erats.20261281",
-          "final_url": "https://api.crossref.org/works/10.38159/erats.20261281",
-          "title": "Crossref record doi:10.38159/erats.20261281: Negotiating the sacred: A pneumatological hermeneutic of syncretism in African Pentecostalism",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:58.939730+00:00",
-          "sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
-          "raw_sha256": "d0185b1539f3c0c9647ce7903b40cc2a693fb37ccf9c550cd9082f95c55cb63a",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "afb4ef0824d188d4fdabd968048db356cb9c32bb1f92a8353a86b4041627b1d7"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-eco-70277",
-          "url": "https://api.crossref.org/works/10.1002/eco.70277",
-          "final_url": "https://api.crossref.org/works/10.1002/eco.70277",
-          "title": "Crossref record doi:10.1002/eco.70277: From Soil to Canopy: Using Moisture Data From Soil and Tree Sensors to Predict Live Fuel Moisture and Guide Forest Management in a Mediterranean Coast",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:11.501100+00:00",
-          "sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
-          "raw_sha256": "6b8fe765f67bffd8f3478e7b9115280faf9c4cd5b24cc09593bd57ee2b458607",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "49e96147d206f2b12ee25918711f31617c7546689c32660066ad9218cecd0102"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-iroh-70046",
-          "url": "https://api.crossref.org/works/10.1002/iroh.70046",
-          "final_url": "https://api.crossref.org/works/10.1002/iroh.70046",
-          "title": "Crossref record doi:10.1002/iroh.70046: Wildfire in the Surrounding Landscape Alters Limnological Conditions and Plankton Communities in a Tropical Reservoir",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:34:59.751625+00:00",
-          "sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
-          "raw_sha256": "760682d77dda2ce64a949f9292e8e849ba1c7f68b151983f06ddb353750d0884",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "bc0078a066f8139ab8eb945bc2a1b035c58964d66056c66f3c715d8d1efbb108"
-        },
-        {
-          "id": "source.frontier.doi-10-38159-erats-20261284",
-          "url": "https://api.crossref.org/works/10.38159/erats.20261284",
-          "final_url": "https://api.crossref.org/works/10.38159/erats.20261284",
-          "title": "Crossref record doi:10.38159/erats.20261284: The irony of law and faith in corruption",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:00.515511+00:00",
-          "sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
-          "raw_sha256": "fadbb4a4a53e60a57eb07171505780973bebd32b990d03f17091b3f97666bed6",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "6d3ebf0ce7907880da12e14d012c47ce0324fbda7e2c46962b0fa36c808b18a3"
-        },
-        {
-          "id": "source.frontier.doi-10-1111-ruso-70070",
-          "url": "https://api.crossref.org/works/10.1111/ruso.70070",
-          "final_url": "https://api.crossref.org/works/10.1111/ruso.70070",
-          "title": "Crossref record doi:10.1111/ruso.70070: Place Character and the Local Welfare State: Counties' Social Services and Public Provisions Across Rural and Urban Communities",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:13.451451+00:00",
-          "sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
-          "raw_sha256": "73eeb586e46e8217738b65a814cb02331a9a5b44f5026d5aea56ba9126a4bd47",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "6c89799ee8629b7d71012f2c13b108b65b4b8f22cb49eedc152a4fa3e2d4b55b"
-        },
-        {
-          "id": "source.frontier.doi-10-3897-nhcm-3-200681",
-          "url": "https://api.crossref.org/works/10.3897/nhcm.3.200681",
-          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.200681",
-          "title": "Crossref record doi:10.3897/nhcm.3.200681: Recovering mtDNA from long-term formalin-preserved museum arthropods: A pilot study",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:15.575843+00:00",
-          "sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
-          "raw_sha256": "53d7687bc637a67601353042e50c779f6ad8fc8380cdf2b5625389ada69f8566",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "990307098fe7b9e0714b7f09222fb462ba31fc40458a68efacd8860d43ab3234"
-        },
-        {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0001005",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001005",
-          "title": "Crossref record doi:10.1371/journal.pclm.0001005: Long Short-Term Memory (LSTM)-based prediction of heatwave trends in northwestern Nigeria",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:17.945108+00:00",
-          "sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
-          "raw_sha256": "893f0c3078290e01402091cb97b57f4aa0e0a1b9fe1c46585156fa8a395feebb",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "016d4bcd7a893a774c7e791e9040ce5410b3bc0c9b2e56368a7a839162c66e45"
-        },
-        {
-          "id": "source.frontier.doi-10-1111-moth-70148",
-          "url": "https://api.crossref.org/works/10.1111/moth.70148",
-          "final_url": "https://api.crossref.org/works/10.1111/moth.70148",
-          "title": "Crossref record doi:10.1111/moth.70148: On Theology and the “Overcoming” of Metaphysics: Falque, Betz, Heidegger, and Marion",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:18.760979+00:00",
-          "sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
-          "raw_sha256": "7305169656c705a4f567f7fea256d01dd2a366866ee5031379b3c0c47e96aba2",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "c3151f7d7efbb3b466eb9eb16765f9965374bb4d98ca16075cb240eeff39502d"
-        },
-        {
-          "id": "source.frontier.doi-10-38159-ehass-20267724",
-          "url": "https://api.crossref.org/works/10.38159/ehass.20267724",
-          "final_url": "https://api.crossref.org/works/10.38159/ehass.20267724",
-          "title": "Crossref record doi:10.38159/ehass.20267724: Leveraging community partnership: The case of Meraka Cultural Village",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:19.559872+00:00",
-          "sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
-          "raw_sha256": "33824625808ed14dc75e4a7a15ec31cb5b2920371017ee6eb9b977e9159bb820",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "e4479ace19f6dd1ebf7768d3c123d0d2ed3a7153544d377432c0f7502b59e351"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl124881",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124881",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124881",
-          "title": "Crossref record doi:10.1029/2026gl124881: Mapping Glacier Bed Topography in Crevassed Regions: A New Passive Seismic Reflection Method Applied to Isunnguata Sermia, West Greenland",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:20.401221+00:00",
-          "sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
-          "raw_sha256": "b3a6c69b395347d25c8346256af6d1c6968d63551956bb442e29ef079eaf447f",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "719f3c24e07ec19319a27da855519a0d001f6804d4bf5fdc8d74fdb4b49fb388"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026jh001578",
-          "url": "https://api.crossref.org/works/10.1029/2026jh001578",
-          "final_url": "https://api.crossref.org/works/10.1029/2026jh001578",
-          "title": "Crossref record doi:10.1029/2026jh001578: Adapting a Pretrained LLM to Rapidly Recover Earthquake Magnitude and Location",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:01.345420+00:00",
-          "sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
-          "raw_sha256": "6c3bf130c7aed58090273f41f0d119d1a49b5ebeb76db516fbc19725a86f65c4",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "52e9097cff5617ea55f0bcb6d88306c3de8e20f85dff389c9004d60c197b07b2"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-gdj3-70104",
-          "url": "https://api.crossref.org/works/10.1002/gdj3.70104",
-          "final_url": "https://api.crossref.org/works/10.1002/gdj3.70104",
-          "title": "Crossref record doi:10.1002/gdj3.70104: Deep Learning–Based Fusion of Multi‐Source Precipitation in Complex Terrain: A Case Study Over Chongqing, China",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:02.172245+00:00",
-          "sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
-          "raw_sha256": "42cd140a54b9591e9c1f614c7097151f8731105515008bb8f5fb2ccedf09c2b5",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "617d089aee0d4d7836e4ebc036aaf1e096081d18e49a360f06815339e84e3ff5"
-        },
-        {
-          "id": "source.frontier.doi-10-1029-2026gl122610",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122610",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122610",
-          "title": "Crossref record doi:10.1029/2026gl122610: Assimilation of SWOT Water Surface Elevation Enhances Simulations of River Dynamics in the Ohio River Basin",
+          "id": "source.frontier.arxiv-2610-21653",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:03.040868+00:00",
-          "sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
-          "raw_sha256": "7bbe4989d05edefc0325b78a5d53b40c99e07c9ba90e9a66f258effd44e32f2a",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "da371e5cdff5054c20ab49e432bf1f63ab262d7f867f802a49af8868bd56ab91"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-qj-70308",
-          "url": "https://api.crossref.org/works/10.1002/qj.70308",
-          "final_url": "https://api.crossref.org/works/10.1002/qj.70308",
-          "title": "Crossref record doi:10.1002/qj.70308: Synoptic and large‐scale drivers of extreme precipitation events in the Himalayas",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:03.867898+00:00",
-          "sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
-          "raw_sha256": "ecac7ec211477c18932fa6e927d08b7671fdcf346ca45ac3de144ea7609fafb2",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "4761bd25e4fb32901da7b7e971608cb842bb04466e84888f57f919906aec5cea"
-        },
-        {
-          "id": "source.frontier.doi-10-55730-1300-0632-4281",
-          "url": "https://api.crossref.org/works/10.55730/1300-0632.4281",
-          "final_url": "https://api.crossref.org/works/10.55730/1300-0632.4281",
-          "title": "Crossref record doi:10.55730/1300-0632.4281: Boundary layer sliding mode control strategy for variable-speed compressor in deep freezers: experimental validation of energy efficiency and freezing",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:26.468516+00:00",
-          "sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
-          "raw_sha256": "5df0b417a12284b249163ec64e5b13485f98685cd4bf81d01217078138c61b5b",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "6c97eca98cd8eeb9b1c34f9245da2aa037e5ce34eaccebea84082404865c4365"
-        },
-        {
-          "id": "source.frontier.doi-10-55730-1300-0632-4275",
-          "url": "https://api.crossref.org/works/10.55730/1300-0632.4275",
-          "final_url": "https://api.crossref.org/works/10.55730/1300-0632.4275",
-          "title": "Crossref record doi:10.55730/1300-0632.4275: Empowering edge intelligence through reparameterized lightweight transformers and distributed inference",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:27.288364+00:00",
-          "sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
-          "raw_sha256": "500ca01b3ee51ef9da753b16e22157aa3fc9866b3b12ee6f7d1b6a51c21b962f",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "1d4e0053d62e97433865e9fb12b29fb05abe0de5de9c3cc5f42c6865d08a9ad1"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-eet-70139",
-          "url": "https://api.crossref.org/works/10.1002/eet.70139",
-          "final_url": "https://api.crossref.org/works/10.1002/eet.70139",
-          "title": "Crossref record doi:10.1002/eet.70139: After the Climate Assembly: A Mixed Methods Study on the Impacts of Participation on Political Attitudes and Climate Behaviours",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:31.081899+00:00",
-          "sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
-          "raw_sha256": "3d58fd12e9a8c5e7d2fd315fb986f159688ef8e0a6d832418ef659b4ffe201c7",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "d7bb021d2019dd2793de88b860d0dfe5df8779a994f1665e86b4a43ce2e5842e"
-        },
-        {
-          "id": "source.frontier.doi-10-1002-jclp-70212",
-          "url": "https://api.crossref.org/works/10.1002/jclp.70212",
-          "final_url": "https://api.crossref.org/works/10.1002/jclp.70212",
-          "title": "Crossref record doi:10.1002/jclp.70212: Distant and Distressed: Interpersonal Problems in Anxiety and Depression",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:32.793417+00:00",
-          "sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
-          "raw_sha256": "33d8eaf0187f94a4c32d019d87bfabc9459f4e59e92ccebe513faee02390ab89",
-          "content_type": "application/json",
-          "charset": "utf-8",
-          "extraction_method": "http-text/1",
-          "capture_id": "1b31ed40972f32f6c60d04abfce11bc58eed0013f94569ee93069caa0c749f5c"
-        },
-        {
-          "id": "source.frontier.doi-10-12944-cwe-21-2-3",
-          "url": "https://api.crossref.org/works/10.12944/cwe.21.2.3",
-          "final_url": "https://api.crossref.org/works/10.12944/cwe.21.2.3",
-          "title": "Crossref record doi:10.12944/cwe.21.2.3: Climate Change and Biodiversity Hotspots: Patterns of Adaptation, Resilience, and Species Loss",
-          "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:35.264274+00:00",
-          "sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
-          "raw_sha256": "502cd5f344f04a98b0f1deb8df43e2c3c5b412e666059f5ff3a24c10e8173c49",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:26.911036+00:00",
+          "sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+          "raw_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "776dcb905988c35debf16070c71510df4455d804b8d1be834a2a2bab36066d76"
+          "capture_id": "988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40"
         },
         {
-          "id": "source.frontier.doi-10-1002-bse-71470",
-          "url": "https://api.crossref.org/works/10.1002/bse.71470",
-          "final_url": "https://api.crossref.org/works/10.1002/bse.71470",
-          "title": "Crossref record doi:10.1002/bse.71470: Why Some Firms Perceive Climate Risks and Others Do Not—Evidence From the Logistics Sector",
+          "id": "source.frontier.arxiv-2610-19722",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:37.824644+00:00",
-          "sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
-          "raw_sha256": "01b9fa257402d6942063661409d9f06fef0739f26e7eaaba1ba3fe8271f84482",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:30.213616+00:00",
+          "sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+          "raw_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "c90897cae4fa8c5538d320f9b74f00e20970a9f97dd8cc84021ea3a802fc816f"
+          "capture_id": "c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000986",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000986",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000986: Integrating machine learning to assess climate risks on reservoir’s inflow and hydropower generation across West African basins",
+          "id": "source.frontier.arxiv-2610-19515",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:39.484154+00:00",
-          "sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
-          "raw_sha256": "f513ebfe377baa052b366cf9d8bd27050010407e22e201e0735f1d6534e3ae32",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:33.576347+00:00",
+          "sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+          "raw_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8273fa85027762cc424aa21f2f538e880e6c30f468744bc545161a35ee8d6b8a"
+          "capture_id": "13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300"
         },
         {
-          "id": "source.frontier.doi-10-1111-1752-1688-70151",
-          "url": "https://api.crossref.org/works/10.1111/1752-1688.70151",
-          "final_url": "https://api.crossref.org/works/10.1111/1752-1688.70151",
-          "title": "Crossref record doi:10.1111/1752-1688.70151: Changes in Rainfall Regime: A Case Study in the Piracicaba River Basin, Brazil",
+          "id": "source.frontier.arxiv-2610-19137",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:04.660297+00:00",
-          "sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
-          "raw_sha256": "e7bbbca3b36b3d92fb53d4a503dd0a3c815c019dd134c8b0b88e493eb0907c6f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:36.959397+00:00",
+          "sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+          "raw_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "02d23ada2e0f5c2b0122fc6632803918676942ce5323d5f9589394c64cb3cc4b"
+          "capture_id": "01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d"
         },
         {
-          "id": "source.frontier.doi-10-1111-jade-70048",
-          "url": "https://api.crossref.org/works/10.1111/jade.70048",
-          "final_url": "https://api.crossref.org/works/10.1111/jade.70048",
-          "title": "Crossref record doi:10.1111/jade.70048: A Visual Brainstorming Technique in Character Design: Braindrawing",
+          "id": "source.frontier.arxiv-2610-17295",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:41.889675+00:00",
-          "sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
-          "raw_sha256": "06f66dae7f0d9271adbd6ef0ae4d5dff11c4d02edc443ec12974972d15c3be59",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:40.315577+00:00",
+          "sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+          "raw_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "d132128d7d8975811b815cf27c3c2f0631732003b4c78f952d3cef0dc8c086e8"
+          "capture_id": "a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba"
         },
         {
-          "id": "source.frontier.doi-10-1111-lcrp-70059",
-          "url": "https://api.crossref.org/works/10.1111/lcrp.70059",
-          "final_url": "https://api.crossref.org/works/10.1111/lcrp.70059",
-          "title": "Crossref record doi:10.1111/lcrp.70059: Prison victimization and post‐release outcomes: A systematic review",
+          "id": "source.frontier.arxiv-2610-16273",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:42.772956+00:00",
-          "sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
-          "raw_sha256": "bd13def4666095403c77fe5b30babb5005fee1f381c6bb54b7cca7cbf0476fc3",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:43.624066+00:00",
+          "sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+          "raw_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "cb13f2c91e7b187a77df2be2c26af9ff1ff5246c8712b9fd68f0a1902e9f71f2"
+          "capture_id": "f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d"
         },
         {
-          "id": "source.frontier.doi-10-1002-adfm-77938",
-          "url": "https://api.crossref.org/works/10.1002/adfm.77938",
-          "final_url": "https://api.crossref.org/works/10.1002/adfm.77938",
-          "title": "Crossref record doi:10.1002/adfm.77938: Load Distributing Metamaterials Via Discrete Optimization",
+          "id": "source.frontier.arxiv-2610-16259",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:45.195569+00:00",
-          "sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
-          "raw_sha256": "4aafada96e7da7d7034c82915a0936caad2fe12a9cc17ea8a7929b7493a76df9",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:46.993903+00:00",
+          "sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+          "raw_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b1e17ba2c06fc4ff39acbd2d40d8e8811ddc4a5e320e86834a63f5c3cc8cb44e"
+          "capture_id": "f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8"
         },
         {
-          "id": "source.frontier.doi-10-3897-brics-econ-7-e185197",
-          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197",
-          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e185197",
-          "title": "Crossref record doi:10.3897/brics-econ.7.e185197: Stochastic Effects of Exchange Rate Fluctuations and Monetary-Fiscal Simulation on Exports in Asia",
+          "id": "source.frontier.arxiv-2610-15934",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:46.059314+00:00",
-          "sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
-          "raw_sha256": "90f67f47feaa9f4ff26884f66b1dc9cf253f2f55ff0284e767a0509b6effe453",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:50.359909+00:00",
+          "sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+          "raw_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "eca10de834e8c11d5af689bbb1b8d5e3bf0bf1d7dcf72b8da7db2840d02343db"
+          "capture_id": "08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl125327",
-          "url": "https://api.crossref.org/works/10.1029/2026gl125327",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl125327",
-          "title": "Crossref record doi:10.1029/2026gl125327: Permafrost Degradation Drives Shifts in Chemostasis and Stream Geochemistry in the McMurdo Dry Valleys, Antarctica",
+          "id": "source.frontier.arxiv-2610-15072",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:05.474647+00:00",
-          "sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
-          "raw_sha256": "c3cb24553ac1d226bdb4f251e5f1b9a6abc959c9aed77801e7800e4b742c5e36",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:53.741890+00:00",
+          "sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+          "raw_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0507e2d16f3d74de18e2ad52ac70a46ba2a5e58c6e2a927321848ac424f7c7ef"
+          "capture_id": "f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c"
         },
         {
-          "id": "source.frontier.doi-10-1002-qj-70302",
-          "url": "https://api.crossref.org/works/10.1002/qj.70302",
-          "final_url": "https://api.crossref.org/works/10.1002/qj.70302",
-          "title": "Crossref record doi:10.1002/qj.70302: Attribution of subseasonal cold‐spell forecasts to remote drivers using nudging experiments",
+          "id": "source.frontier.arxiv-2610-15052",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:06.248588+00:00",
-          "sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
-          "raw_sha256": "6739362117934e9d78515974e1760d47634eb85c5a536864ca506d2cb8ac3e3a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:39:57.062941+00:00",
+          "sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+          "raw_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "478ced40f319edfb52a0c51c43e15cc6434143e5a7625442c4dbfc3072e83645"
+          "capture_id": "116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000930",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000930",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000930: Countering climate misinformation with large language models: Evidence from ChatGPT",
+          "id": "source.frontier.arxiv-2610-13424",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:46.910752+00:00",
-          "sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
-          "raw_sha256": "ab0ffeb8fc4b0853883a6b71c8552ff81a89e8fc9f91e4887f42262ea7430881",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:00.397076+00:00",
+          "sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+          "raw_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "4c4f1310ae5a99db5a1b4d46c1ac2232288256af7bdb54732220c1f54a0a6911"
+          "capture_id": "9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e"
         },
         {
-          "id": "source.frontier.doi-10-1098-rsnr-2026-0030",
-          "url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030",
-          "final_url": "https://api.crossref.org/works/10.1098/rsnr.2026.0030",
-          "title": "Crossref record doi:10.1098/rsnr.2026.0030: Leeuwenhoek in Mexico: new paths in the global circulation of scientific knowledge",
+          "id": "source.frontier.arxiv-2610-13402",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:47.687953+00:00",
-          "sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
-          "raw_sha256": "a10018dc26ae2a0c54acd55aa319a33691c0cc86c1219eeab7b6f17de390fe5e",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:03.917638+00:00",
+          "sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+          "raw_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "bf8137518d4aa78c69f94d80f4b0dbd00a2333d00d89912343d03f7330f8b53a"
+          "capture_id": "f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95"
         },
         {
-          "id": "source.frontier.doi-10-1002-cli2-70062",
-          "url": "https://api.crossref.org/works/10.1002/cli2.70062",
-          "final_url": "https://api.crossref.org/works/10.1002/cli2.70062",
-          "title": "Crossref record doi:10.1002/cli2.70062: Modelling Climate‐Resilient Habitats for Conservation and Restoration of Isoberlinia doka Craib and Stapf and Isoberlinia tomentosa (Harms) Craib and ",
+          "id": "source.frontier.arxiv-2610-12779",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:48.518124+00:00",
-          "sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
-          "raw_sha256": "dfe6b122c33b22f867002d95f61e90e782ae191c0150c78780712f99f63a9cdf",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:07.356687+00:00",
+          "sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+          "raw_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "d346bccf267fc15ff49d7e6823d7d1e07cd4d068a9146525e6aabaa919074e4f"
+          "capture_id": "f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e"
         },
         {
-          "id": "source.frontier.doi-10-11591-ijeecs-v43-i3-pp965-974",
-          "url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974",
-          "final_url": "https://api.crossref.org/works/10.11591/ijeecs.v43.i3.pp965-974",
-          "title": "Crossref record doi:10.11591/ijeecs.v43.i3.pp965-974: Zero-trust IoT security using homomorphic encryption, blockchain, and machine learning",
+          "id": "source.frontier.arxiv-2610-12604",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:49.294780+00:00",
-          "sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
-          "raw_sha256": "51c2fad7b64588d4a1ff6d61b8113d45889e257ddb87b15a474c890781fd921a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:10.837414+00:00",
+          "sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+          "raw_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "dae6ce72c72dec15dd565926304704a339eda66d5f64739a510436dbe6b4bec0"
+          "capture_id": "0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23"
         },
         {
-          "id": "source.frontier.doi-10-1111-ejed-70852",
-          "url": "https://api.crossref.org/works/10.1111/ejed.70852",
-          "final_url": "https://api.crossref.org/works/10.1111/ejed.70852",
-          "title": "Crossref record doi:10.1111/ejed.70852: The Interplay of Job Demands, Job Resources and Personal Resources Among EFL Teachers in Challenging Contexts",
+          "id": "source.frontier.arxiv-2610-12592",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:51.012933+00:00",
-          "sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
-          "raw_sha256": "bf38fefd8e7b6f2a4e2033fe32c1b3064dbf9ad9f6050fd3b8741f5e16e66a20",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:14.554610+00:00",
+          "sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+          "raw_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "aabb1dcb30ba2585109d062716f0f465029b3f8674d2b969a2d490e55455cefc"
+          "capture_id": "728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad"
         },
         {
-          "id": "source.frontier.doi-10-1111-ejed-70845",
-          "url": "https://api.crossref.org/works/10.1111/ejed.70845",
-          "final_url": "https://api.crossref.org/works/10.1111/ejed.70845",
-          "title": "Crossref record doi:10.1111/ejed.70845: Predicting EFL Students' Academic Performance, Resilience or Psychological Well‐Being From Their Character Strengths in AI ‐Integrated Educational Env",
+          "id": "source.frontier.arxiv-2610-12038",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:51.857938+00:00",
-          "sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
-          "raw_sha256": "1c2909854ab95baa5e06fd8fc1d2f804eebac05b9f3e961e51bc8c3cdcf28e6f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:18.523961+00:00",
+          "sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+          "raw_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "f25040b20fd748e5c769ba8bee689a166cd64b5c832d0f34d9d0e9a510b7997b"
+          "capture_id": "b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0001039",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0001039",
-          "title": "Crossref record doi:10.1371/journal.pclm.0001039: From segmentation to strategy: Identifying population segments and regional patterns of environmental behaviour",
+          "id": "source.frontier.arxiv-2610-11869",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:53.464354+00:00",
-          "sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
-          "raw_sha256": "621107fb8ee58bf0437c40c60bf906e6da630d1f75a5d193834fbc3c089b37a6",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:21.858745+00:00",
+          "sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+          "raw_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6aca726671936a6b4f435166c2a1ac72e5ab6088c187984ddc554730151ff449"
+          "capture_id": "d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6"
         },
         {
-          "id": "source.frontier.doi-10-1111-nup-70114",
-          "url": "https://api.crossref.org/works/10.1111/nup.70114",
-          "final_url": "https://api.crossref.org/works/10.1111/nup.70114",
-          "title": "Crossref record doi:10.1111/nup.70114: A Triptych of Care: An Anthropological Interpretation of Morning Bed‐Baths in Greek Intensive Care",
+          "id": "source.frontier.arxiv-2610-11359",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:54.289133+00:00",
-          "sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
-          "raw_sha256": "dbde2d41b346dc6afab16e23c9c9d7ffb350169e3560eb41f3cd6d856f0a4f74",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:26.578514+00:00",
+          "sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+          "raw_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "c5f9c356eb3de82a336f79cfc059751d35a73e370981eb884c6a1342f89ba879"
+          "capture_id": "7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8"
         },
         {
-          "id": "source.frontier.doi-10-1111-ejss-70414",
-          "url": "https://api.crossref.org/works/10.1111/ejss.70414",
-          "final_url": "https://api.crossref.org/works/10.1111/ejss.70414",
-          "title": "Crossref record doi:10.1111/ejss.70414: Soil Organic Carbon Stocks and Saturation Deficit in Mediterranean Olive Groves: Effects of Intensification and Management Practices",
+          "id": "source.frontier.arxiv-2610-04959",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:55.115497+00:00",
-          "sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
-          "raw_sha256": "ec5cbdf8d88d59da8d3824cb457d1b40123473cdf201f19e3010fe5ec2772771",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:30.351882+00:00",
+          "sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+          "raw_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1ef02e00593ef9bfb9c50e6b128be7d7abdff148906ca8d9dba5cf2263aa7748"
+          "capture_id": "6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026wr044293",
-          "url": "https://api.crossref.org/works/10.1029/2026wr044293",
-          "final_url": "https://api.crossref.org/works/10.1029/2026wr044293",
-          "title": "Crossref record doi:10.1029/2026wr044293: Morphological State Transitions and Sediment Transport Variability in Braided Rivers",
+          "id": "source.frontier.arxiv-2610-09266",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:06:57.584140+00:00",
-          "sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
-          "raw_sha256": "3065979362a6481e29089dddfaa75e14157f33730a678808c21f7d08aa4e606b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:33.676958+00:00",
+          "sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+          "raw_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0cfa1200e53612ab88dd9f320455f87f0b4b9212780861dbc385f828fd933e34"
+          "capture_id": "12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0"
         },
         {
-          "id": "source.frontier.doi-10-1002-esp-70399",
-          "url": "https://api.crossref.org/works/10.1002/esp.70399",
-          "final_url": "https://api.crossref.org/works/10.1002/esp.70399",
-          "title": "Crossref record doi:10.1002/esp.70399: Numerical Modelling of Late Pleistocene to Holocene Earthquake‐Induced Progressive Rock Slope Damage in the Paraglacial Serpentine Valley, Prince Will",
+          "id": "source.frontier.arxiv-2610-09080",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:07.079393+00:00",
-          "sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
-          "raw_sha256": "0dfc87a42cd698999f72302caea30e93abeb42baa7bdd41e1a4130d59d4fef19",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:37.107474+00:00",
+          "sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+          "raw_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "00030ea44b50ed3b7f4dd5dc2549693f35df2176682bb08d260365348130b800"
+          "capture_id": "40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2"
         },
         {
-          "id": "source.frontier.doi-10-1002-jqs-70108",
-          "url": "https://api.crossref.org/works/10.1002/jqs.70108",
-          "final_url": "https://api.crossref.org/works/10.1002/jqs.70108",
-          "title": "Crossref record doi:10.1002/jqs.70108: A talus rock glacier in Nantlle Valley, North Wales",
+          "id": "source.frontier.arxiv-2610-09010",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:01.899130+00:00",
-          "sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
-          "raw_sha256": "85ae9d3499a7a6b5a6c663c594d6fdb1301e8502c46edbfc118aa2968767a345",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:40.949103+00:00",
+          "sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+          "raw_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "f5e3a85d5f9dfd869bdf2f7935b31db67b2aa4b73e4f6585af4f9b94ec0d8f8d"
+          "capture_id": "1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026jd046723",
-          "url": "https://api.crossref.org/works/10.1029/2026jd046723",
-          "final_url": "https://api.crossref.org/works/10.1029/2026jd046723",
-          "title": "Crossref record doi:10.1029/2026jd046723: High‐Resolution Regional Atmospheric Simulation of Precipitation and Isotopes in Central America",
+          "id": "source.frontier.arxiv-2610-08744",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:03.495559+00:00",
-          "sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
-          "raw_sha256": "53108a500c32eca21f5668cc66d6c8bd152779a410ba862c4275e0da4e5f9516",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:44.369404+00:00",
+          "sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+          "raw_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6440f939d18621e867041cc98a46577ebdbbd78966f5eb6ca6f84444d6121d2a"
+          "capture_id": "536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6"
         },
         {
-          "id": "source.frontier.doi-10-1002-msd2-70089",
-          "url": "https://api.crossref.org/works/10.1002/msd2.70089",
-          "final_url": "https://api.crossref.org/works/10.1002/msd2.70089",
-          "title": "Crossref record doi:10.1002/msd2.70089: Energy Transfer and Saving in a Nonlinear Coupled Vibrating System Based on the Method of Composite Synchronization Transmission",
+          "id": "source.frontier.arxiv-2610-07616",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:04.307497+00:00",
-          "sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
-          "raw_sha256": "611cbc99c991d337455fc1c245e4ace81086cae2e23473cc8291677793ea4d85",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:47.705922+00:00",
+          "sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+          "raw_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "01b70241edd77ff87ee41058529d833e9ea54545274ad1ad3cdd8644a1e3f488"
+          "capture_id": "b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590"
         },
         {
-          "id": "source.frontier.doi-10-1111-ijal-70342",
-          "url": "https://api.crossref.org/works/10.1111/ijal.70342",
-          "final_url": "https://api.crossref.org/works/10.1111/ijal.70342",
-          "title": "Crossref record doi:10.1111/ijal.70342: Performance Control, Reflection, and Attainment in Instructed Language Learning: A Longitudinal Study of Self‐Regulation in L2 English and L2 German C",
+          "id": "source.frontier.arxiv-2610-07307",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:07.222217+00:00",
-          "sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
-          "raw_sha256": "c65fe509ef4e1203bc4ce3d2355a987ffbca1251824f356c67af776601e77987",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:51.048449+00:00",
+          "sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+          "raw_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "21c52bd926467ce3862b9e44104641a163b797c8146dff46d4b6a83d87a9bfec"
+          "capture_id": "db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540"
         },
         {
-          "id": "source.frontier.doi-10-1002-cli2-70059",
-          "url": "https://api.crossref.org/works/10.1002/cli2.70059",
-          "final_url": "https://api.crossref.org/works/10.1002/cli2.70059",
-          "title": "Crossref record doi:10.1002/cli2.70059: Uncertainty Quantification and Attribution for Resilient Infrastructure Systems",
+          "id": "source.frontier.arxiv-2610-06601",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:08.305640+00:00",
-          "sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
-          "raw_sha256": "5b9eede40f0f75c733685bf8a4ae6c522195352c36dc6820e611865837d86ff9",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:54.882591+00:00",
+          "sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+          "raw_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1655df34e130224e4ad2f3426bdf0fc7e47b4e48e475d9cd67e770a47b05da42"
+          "capture_id": "0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl124727",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124727",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124727",
-          "title": "Crossref record doi:10.1029/2026gl124727: Arctic and Tibetan Plateau Tundra Show Divergent Temperature and Precipitation Thresholds Under Climate Change",
+          "id": "source.frontier.arxiv-2610-04776",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:07.927197+00:00",
-          "sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
-          "raw_sha256": "a3cea2bcf983db97768247053b1763b76bc7b4576821a8f8db1284ed03e87a3a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:40:59.302987+00:00",
+          "sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+          "raw_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "9ec497ec98a20fcfb685e30f0d9d00e779eca5a5b7a0c6a09c92ae5edbb259aa"
+          "capture_id": "5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000877",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000877",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000877: The effect of natural climate variability on future vector-borne disease suitability: A mathematical modelling study",
+          "id": "source.frontier.arxiv-2610-04697",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:09.336393+00:00",
-          "sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
-          "raw_sha256": "a9372f5ceaf796e52df0f26411aa1631e8efea0350221621337d717db7028105",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:25:52.277682+00:00",
+          "sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+          "raw_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "2bda59da56510db1d157a80cf129232c16b7376061bf0d02dfc82709826cc77a"
+          "capture_id": "70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9"
         },
         {
-          "id": "source.frontier.doi-10-1111-jmg-70054",
-          "url": "https://api.crossref.org/works/10.1111/jmg.70054",
-          "final_url": "https://api.crossref.org/works/10.1111/jmg.70054",
-          "title": "Crossref record doi:10.1111/jmg.70054: Metamorphic or Igneous Zircon? Classification Through Rare Earth Elements, Machine Learning and Logistic Regression",
+          "id": "source.frontier.arxiv-2610-04662",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:10.713225+00:00",
-          "sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
-          "raw_sha256": "0c95ba6bba518da19edbcf95c56014dd827dbc4fff5c69b7a019699047dea508",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:02.786630+00:00",
+          "sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+          "raw_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6bcff6e10de5f0479461013d7a87599a1b720376dc2a6bd081d1252b0cca6708"
+          "capture_id": "2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6"
         },
         {
-          "id": "source.frontier.doi-10-1111-moth-70134",
-          "url": "https://api.crossref.org/works/10.1111/moth.70134",
-          "final_url": "https://api.crossref.org/works/10.1111/moth.70134",
-          "title": "Crossref record doi:10.1111/moth.70134: Christian Humanism in the Black Atlantic: The Case of Olaudah Equiano",
+          "id": "source.frontier.arxiv-2610-04630",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:15.246334+00:00",
-          "sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
-          "raw_sha256": "d777ab4ce8eb70a89b11991f72460b747c0675d6dcb150ba033ca521161d15fe",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:06.277049+00:00",
+          "sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+          "raw_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1d7256f9248c96372299dc746bc8c227a58698909569c7d1f7d0238f37a17426"
+          "capture_id": "a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac"
         },
         {
-          "id": "source.frontier.doi-10-1111-gwat-70098",
-          "url": "https://api.crossref.org/works/10.1111/gwat.70098",
-          "final_url": "https://api.crossref.org/works/10.1111/gwat.70098",
-          "title": "Crossref record doi:10.1111/gwat.70098: Finite Element Implementation of SAFE for Asymmetric Stream‐Aquifer Flow Exchange",
+          "id": "source.frontier.arxiv-2610-04242",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:18.846431+00:00",
-          "sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
-          "raw_sha256": "32901f075841743d6b29724792e24a146aa6cbcd29b5b99d174b3a513009d152",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:09.732094+00:00",
+          "sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+          "raw_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6405b7d6164743092e1df6f2d8096ac724d21cf7d82411b63153ce6900a096e8"
+          "capture_id": "02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37"
         },
         {
-          "id": "source.frontier.doi-10-2166-wp-2026-018",
-          "url": "https://api.crossref.org/works/10.2166/wp.2026.018",
-          "final_url": "https://api.crossref.org/works/10.2166/wp.2026.018",
-          "title": "Crossref record doi:10.2166/wp.2026.018: A CGE-based assessment of water allocation policies between mine water and the Yellow River water for industries in Northwest China's arid regions",
+          "id": "source.frontier.arxiv-2610-06918",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:08.755544+00:00",
-          "sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
-          "raw_sha256": "f1b8b63c471cf61e6704a5c52587a7f5c5d5ff4d19142bd3a6d782b3c7a2ddf2",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:13.187217+00:00",
+          "sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+          "raw_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "30a3c6c1258f8eb0280e05168a8c006e3f3d6bf34f30531b7e8d6bc46d61d7a9"
+          "capture_id": "ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c"
         },
         {
-          "id": "source.frontier.doi-10-1098-rsta-2025-0107",
-          "url": "https://api.crossref.org/works/10.1098/rsta.2025.0107",
-          "final_url": "https://api.crossref.org/works/10.1098/rsta.2025.0107",
-          "title": "Crossref record doi:10.1098/rsta.2025.0107: Merits of geometric algebra applied to cryptography and machine learning",
+          "id": "source.frontier.arxiv-2610-03964",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:09.527543+00:00",
-          "sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
-          "raw_sha256": "e0a1e5937ae1671a5f2af3406d0b6d01c50d67d67e7007dacec90841636b109b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:16.918872+00:00",
+          "sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+          "raw_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "5764032edbb95f73939b883436e8a2fb990b00d1a715195c16aab9bff35263be"
+          "capture_id": "b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000931",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000931",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000931: Mapping climate-related forest risks: An index-based approach",
+          "id": "source.frontier.arxiv-2610-03008",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:21.871414+00:00",
-          "sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
-          "raw_sha256": "876804b49025a4a3b5f610b18c368d6f2f6c9d131a62e2e7d95d4c92e72c5103",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T15:46:01.612871+00:00",
+          "sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+          "raw_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "c039be698fd1455c8f60d669c1c43cfeb201546bc77d6d297e101686c3a04a9a"
+          "capture_id": "370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl122646",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122646",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122646",
-          "title": "Crossref record doi:10.1029/2026gl122646: Positive Association Between Coastal Sea Surface Temperatures and Humid Heat Stress on Nearby Land",
+          "id": "source.frontier.arxiv-2609-39776",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:10.319619+00:00",
-          "sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
-          "raw_sha256": "e6fe41fb13a6d5b43168b4c8bc3664f3cc82d79aa2222cbcecd35101f945ed72",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:21.627238+00:00",
+          "sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+          "raw_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6e4fc27742a9440c7b3de4ba32f748061c235bdfa5b2cb78f283a22d82d928bd"
+          "capture_id": "773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441"
         },
         {
-          "id": "source.frontier.doi-10-1002-ppp-70058",
-          "url": "https://api.crossref.org/works/10.1002/ppp.70058",
-          "final_url": "https://api.crossref.org/works/10.1002/ppp.70058",
-          "title": "Crossref record doi:10.1002/ppp.70058: Periglacial Puzzles: Unravelling Environmental Controls on Alpine Solifluction Lobe Dimensions and Shape",
+          "id": "source.frontier.arxiv-2609-21813",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:11.140470+00:00",
-          "sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
-          "raw_sha256": "167397b5040ebff2e04d2301a028ecb4c3dee46c497a9229b36a26c5ad3628bd",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:25.104371+00:00",
+          "sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+          "raw_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "5ace1addadfee13d117287711615e4b2d0473b7444a5e226fe59074c5b19d32e"
+          "capture_id": "33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f"
         },
         {
-          "id": "source.frontier.doi-10-1002-jpln-70107",
-          "url": "https://api.crossref.org/works/10.1002/jpln.70107",
-          "final_url": "https://api.crossref.org/works/10.1002/jpln.70107",
-          "title": "Crossref record doi:10.1002/jpln.70107: The Influence of Soil Properties on the Agronomic Efficacy of Rock Dust: A Comparative Analysis of a Semiarid Ultisol and Global Soil Types",
+          "id": "source.frontier.arxiv-2609-36354",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:25.369420+00:00",
-          "sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
-          "raw_sha256": "dea76e7c130f4500db79dcdaf23b17b20688c4bea960ad16cc37d7513ca8438c",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:25:55.718326+00:00",
+          "sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+          "raw_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "35eb4419de5595a96136ea1784257158e963c74fff0a9925dacb7eef7982577f"
+          "capture_id": "78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f"
         },
         {
-          "id": "source.frontier.doi-10-3897-nhcm-3-187529",
-          "url": "https://api.crossref.org/works/10.3897/nhcm.3.187529",
-          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.187529",
-          "title": "Crossref record doi:10.3897/nhcm.3.187529: Leveraging museum specimens for AI-driven trait detection using computer vision: A case study on Zimbabwean fish",
+          "id": "source.frontier.arxiv-2609-35424",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:26.541804+00:00",
-          "sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
-          "raw_sha256": "badc0e6a084eaf726f41190c0af8386970cc84b32ff6d7c185506ae43532674c",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:28.544365+00:00",
+          "sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+          "raw_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "53fbbc5b1bbc948a4768b288a64cc45a057520419822f436fbaa014d8beb58ab"
+          "capture_id": "091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73"
         },
         {
-          "id": "source.frontier.doi-10-38159-ehass-2026775",
-          "url": "https://api.crossref.org/works/10.38159/ehass.2026775",
-          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026775",
-          "title": "Crossref record doi:10.38159/ehass.2026775: Parody and playfulness in Tshivenḓa proverbs: A linguistic and cultural analysis",
+          "id": "source.frontier.arxiv-2609-35246",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:28.150938+00:00",
-          "sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
-          "raw_sha256": "f3ae3741bee392349a8f993dfe707981b8a5a181a54989ff4fca269e8e68743b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:31.949330+00:00",
+          "sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+          "raw_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b2f5ae7f6c8bc767ce0034348569e6d9c2c63e3bc46ceb805311b3ea69722320"
+          "capture_id": "8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f"
         },
         {
-          "id": "source.frontier.doi-10-38159-ehass-2026774",
-          "url": "https://api.crossref.org/works/10.38159/ehass.2026774",
-          "final_url": "https://api.crossref.org/works/10.38159/ehass.2026774",
-          "title": "Crossref record doi:10.38159/ehass.2026774: Navigating care across cultures: A narrative literature review of the influence of cultural worldviews on the uptake, delivery, and acceptance of Pall",
+          "id": "source.frontier.arxiv-2609-32315",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:29.631125+00:00",
-          "sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
-          "raw_sha256": "7dd940a6e6fd769fdf88fb74807a3ff173431704842566f2b6d86fb077b0b2c6",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:25:59.126761+00:00",
+          "sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+          "raw_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "5b3b7e037f042877ca2ec9ab6aa39393855a55422ceae364d919e15e8b248209"
+          "capture_id": "8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666"
         },
         {
-          "id": "source.frontier.doi-10-1002-hec-70140",
-          "url": "https://api.crossref.org/works/10.1002/hec.70140",
-          "final_url": "https://api.crossref.org/works/10.1002/hec.70140",
-          "title": "Crossref record doi:10.1002/hec.70140: Waiting Time Prioritisation for Public and Private Providers: Evidence From Hip Replacement Surgery",
+          "id": "source.frontier.arxiv-2609-29972",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:32.140027+00:00",
-          "sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
-          "raw_sha256": "cbac2197ee33a3b2e3abe023444e99458cad5977b32711761860206a066df326",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:05.938561+00:00",
+          "sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+          "raw_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8101c6b862f1c572e90fd3056c865a6b9ecb9d1c216a3458153b9266593e1520"
+          "capture_id": "a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82"
         },
         {
-          "id": "source.frontier.doi-10-1002-tox-70177",
-          "url": "https://api.crossref.org/works/10.1002/tox.70177",
-          "final_url": "https://api.crossref.org/works/10.1002/tox.70177",
-          "title": "Crossref record doi:10.1002/tox.70177: Assessment of Metal Contamination and Human Health Risk in the Buffalo River Estuary, Eastern Cape, South Africa",
+          "id": "source.frontier.arxiv-2609-29832",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:12.874394+00:00",
-          "sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
-          "raw_sha256": "1d3d82d46b46db9cbb3322f3a9810dee08073fb4b766b2d96c20f72c44600229",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:35.415397+00:00",
+          "sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+          "raw_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "4d62e646c7a0d72a362ef43648a284a5aced5f7e503fdb806e106106f2eb88fb"
+          "capture_id": "c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2"
         },
         {
-          "id": "source.frontier.doi-10-1002-adfm-77585",
-          "url": "https://api.crossref.org/works/10.1002/adfm.77585",
-          "final_url": "https://api.crossref.org/works/10.1002/adfm.77585",
-          "title": "Crossref record doi:10.1002/adfm.77585: An Electrowetting Pump",
+          "id": "source.frontier.arxiv-2609-28815",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:33.002358+00:00",
-          "sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
-          "raw_sha256": "e442a00fb9419164b6bb3f9fb2230e9d9d524d60ca5cff870d3b1dfb64a148f4",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:38.919663+00:00",
+          "sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+          "raw_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0e71b955b583f88ba08ca00362cfd55c0862a58b94a5271539f5ee4694a95ed5"
+          "capture_id": "db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e"
         },
         {
-          "id": "source.frontier.doi-10-1111-1467-9566-70245",
-          "url": "https://api.crossref.org/works/10.1111/1467-9566.70245",
-          "final_url": "https://api.crossref.org/works/10.1111/1467-9566.70245",
-          "title": "Crossref record doi:10.1111/1467-9566.70245: The Complex Dynamics of Healthism in Birth Cohort Studies: Comparative Perspectives From the United Kingdom, the Netherlands, Brazil and Portugal",
+          "id": "source.frontier.arxiv-2609-26924",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:47.584739+00:00",
-          "sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
-          "raw_sha256": "76b458ead56fd4b11d71c7afb650258e817fb1cd9650c18272408946c050932b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:42.359389+00:00",
+          "sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+          "raw_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ad1757e88841f4f46a374c40e8152cbb54037d39cbbcecbdf3cdd92ac6587bbe"
+          "capture_id": "52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3"
         },
         {
-          "id": "source.frontier.doi-10-1111-ijal-70337",
-          "url": "https://api.crossref.org/works/10.1111/ijal.70337",
-          "final_url": "https://api.crossref.org/works/10.1111/ijal.70337",
-          "title": "Crossref record doi:10.1111/ijal.70337: Generative AI, Linguistic Hierarchies and Unequal Access in Under‐Resourced Educational Contexts",
+          "id": "source.frontier.arxiv-2609-25847",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:34.721728+00:00",
-          "sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
-          "raw_sha256": "1d4ddadc63989df524cb02c884458a8bfde191316496a1c073d80e5507187668",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:45.815112+00:00",
+          "sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+          "raw_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "37b8ef9d00abbd071cc308b8e2e1101459346cd88f02b8929447545b600477b5"
+          "capture_id": "9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl123821",
-          "url": "https://api.crossref.org/works/10.1029/2026gl123821",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl123821",
-          "title": "Crossref record doi:10.1029/2026gl123821: Groundwater Variability Is Strongly Linked to Soil Temperature Across Global Aquifers",
+          "id": "source.frontier.arxiv-2609-25701",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:35.786606+00:00",
-          "sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
-          "raw_sha256": "c61de323fd68a16bdc570b574d5c47cb93357442bf17b1f782b1481efa8395c9",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:49.238504+00:00",
+          "sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+          "raw_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "155729c68765c006c9b67f9a4295c62d8be419e06dbd0ed34ccd699addd2a6b9"
+          "capture_id": "d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe"
         },
         {
-          "id": "source.frontier.doi-10-1002-qj-70252",
-          "url": "https://api.crossref.org/works/10.1002/qj.70252",
-          "final_url": "https://api.crossref.org/works/10.1002/qj.70252",
-          "title": "Crossref record doi:10.1002/qj.70252: Using microwave imager observations to improve the ocean temperature in a coupled NWP system",
+          "id": "source.frontier.arxiv-2609-25437",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:42.226951+00:00",
-          "sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
-          "raw_sha256": "9888f85c4b480f34f1afc5d08f22b74ce20f14dfe7f3cda22e94fdd87bc96bcd",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:52.633236+00:00",
+          "sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+          "raw_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b63943df4354fe17759f8c75d0c5c7cf3b7966e17550bba333953e654897fc43"
+          "capture_id": "383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437"
         },
         {
-          "id": "source.frontier.doi-10-1002-joc-70540",
-          "url": "https://api.crossref.org/works/10.1002/joc.70540",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70540",
-          "title": "Crossref record doi:10.1002/joc.70540: Representation of Long‐Term Observed UK Winter Precipitation Trends and Variability in UKCP18 Global Climate Models",
+          "id": "source.frontier.arxiv-2609-05763",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:14.478896+00:00",
-          "sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
-          "raw_sha256": "75a4fb5bf4ec7186e18260282ed45795d794ea50d18bc5839ee9e9aa46a91311",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:56.044144+00:00",
+          "sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+          "raw_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ca3e130315fa59a94e5c06b31490381f55226678f0eefd154c3c6321eec0df00"
+          "capture_id": "0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072"
         },
         {
-          "id": "source.frontier.doi-10-1111-eje-70266",
-          "url": "https://api.crossref.org/works/10.1111/eje.70266",
-          "final_url": "https://api.crossref.org/works/10.1111/eje.70266",
-          "title": "Crossref record doi:10.1111/eje.70266: Overseas Service Learning: A Catalyst for Professional Identity Development as Globally Competent Dentists",
+          "id": "source.frontier.arxiv-2609-23703",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:48.400405+00:00",
-          "sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
-          "raw_sha256": "57e08811abb7918487460433fbf3be94ed30321ae78013b071f00d9f11d6b779",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:09.343753+00:00",
+          "sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+          "raw_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1aef0bd754b3eb839e70768c8760e629b6fc117a21e0063897434bf953fe6c1a"
+          "capture_id": "3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82"
         },
         {
-          "id": "source.frontier.doi-10-1111-ecpo-70064",
-          "url": "https://api.crossref.org/works/10.1111/ecpo.70064",
-          "final_url": "https://api.crossref.org/works/10.1111/ecpo.70064",
-          "title": "Crossref record doi:10.1111/ecpo.70064: Chinese Lending and Sovereign Debt Distress in Developing Countries",
+          "id": "source.frontier.arxiv-2609-23199",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:49.242299+00:00",
-          "sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
-          "raw_sha256": "94c0071b02a68255f1768fef3b9886be84995158e95f21cb3d97575ee79d8b79",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:41:59.575112+00:00",
+          "sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+          "raw_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "7f0df4b1b5fc92a486f5c893c865af5b0fb61c11a988690618f1703fa10f877d"
+          "capture_id": "f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65"
         },
         {
-          "id": "source.frontier.doi-10-1111-beer-70139",
-          "url": "https://api.crossref.org/works/10.1111/beer.70139",
-          "final_url": "https://api.crossref.org/works/10.1111/beer.70139",
-          "title": "Crossref record doi:10.1111/beer.70139: Steering Sustainability: Empirical Insights Into Enhancing ESG Ratings via CSR Committees",
+          "id": "source.frontier.arxiv-2609-23085",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:49.047016+00:00",
-          "sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
-          "raw_sha256": "82d8e801a5ef1c55e706e5f0e69ce52ac8d924f6d6e2168be5e4377636b63339",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:03.018673+00:00",
+          "sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+          "raw_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "d43f0750c2344166dc940821271817e5d68792f866752e9b961e9e99749acfbd"
+          "capture_id": "32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139"
         },
         {
-          "id": "source.frontier.doi-10-1098-rsta-2025-0029",
-          "url": "https://api.crossref.org/works/10.1098/rsta.2025.0029",
-          "final_url": "https://api.crossref.org/works/10.1098/rsta.2025.0029",
-          "title": "Crossref record doi:10.1098/rsta.2025.0029: The many faces of rotating quantum turbulence",
+          "id": "source.frontier.arxiv-2609-22775",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:15.312185+00:00",
-          "sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
-          "raw_sha256": "2fa20bfd0ef1420e82e0b4e61d7028849d11663fa700ba64dab07167b6c8169e",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:06.417205+00:00",
+          "sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+          "raw_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "f68ba59fc8c56789653e6c649ba914c1947ecbbdc25f40c64b37e87411e0552a"
+          "capture_id": "da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl124661",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124661",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124661",
-          "title": "Crossref record doi:10.1029/2026gl124661: How Important Are the Critical Points in Selecting the Optimal Samples for Accurate Estimation of Subsurface Soil Moisture?",
+          "id": "source.frontier.arxiv-2609-22615",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:50.595583+00:00",
-          "sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
-          "raw_sha256": "0cdcd9d2046f03224e72240964fd60b470175c5b6bf591c55748846605943fb8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:09.841758+00:00",
+          "sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+          "raw_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1d35983a6d8b359b9733c291d2d08c2ee82377d5b7813717abcf781964e88932"
+          "capture_id": "61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jc023581",
-          "url": "https://api.crossref.org/works/10.1029/2025jc023581",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jc023581",
-          "title": "Crossref record doi:10.1029/2025jc023581: Redistribution of Sediment and Particulate Mercury Within Upstream Reaches of Galveston Bay in Response to Hurricane Harvey",
+          "id": "source.frontier.arxiv-2609-21966",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:52.156366+00:00",
-          "sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
-          "raw_sha256": "0dabe5442228b30fc9e289ba2619b21ebc8ebc15ddc7293800a5120ca9cd9737",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:13.245754+00:00",
+          "sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+          "raw_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ffb1e9893f9ef7ed74e19f4bdd579c3353da4ce21b8d82b18afc114ed47e827b"
+          "capture_id": "ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jb032632",
-          "url": "https://api.crossref.org/works/10.1029/2025jb032632",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jb032632",
-          "title": "Crossref record doi:10.1029/2025jb032632: Independent Component Analysis (ICA) as a Superior Atmospheric Correction Method for InSAR Time Series",
+          "id": "source.frontier.arxiv-2609-21270",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:53.717585+00:00",
-          "sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
-          "raw_sha256": "3457ac678e56af4f8e34709f89c8630b0c5c2c7e4df3ff20582ad123652bfa3f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:16.715742+00:00",
+          "sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+          "raw_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "f7c044f87e72eb7d913428101a740be426c816eb9805f99ffa446261f45e7c95"
+          "capture_id": "40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28"
         },
         {
-          "id": "source.frontier.doi-10-1002-joc-70526",
-          "url": "https://api.crossref.org/works/10.1002/joc.70526",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70526",
-          "title": "Crossref record doi:10.1002/joc.70526: Multi‐Timescale Drought Evolution in Greece (1960–2022) From Station‐Based SPI and SPEI",
+          "id": "source.frontier.arxiv-2609-21093",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:17.786167+00:00",
-          "sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
-          "raw_sha256": "0c245c9ea74561cd6ae4c8410182afe64238b4758ceea653e985174c7404a05b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:20.515703+00:00",
+          "sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+          "raw_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "e1a7c9ee51baa6bc1cf7f8349c41f78d14cd27977546d662c232cd4d9546c74f"
+          "capture_id": "ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7"
         },
         {
-          "id": "source.frontier.doi-10-1111-saje-70032",
-          "url": "https://api.crossref.org/works/10.1111/saje.70032",
-          "final_url": "https://api.crossref.org/works/10.1111/saje.70032",
-          "title": "Crossref record doi:10.1111/saje.70032: The Effect of Digitalisation and Corruption on Human Development in Sub‐Sahara Africa: Are There Regional Differences?",
+          "id": "source.frontier.arxiv-2609-21057",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:50.298425+00:00",
-          "sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
-          "raw_sha256": "2dee6c09e6c6cb2e4101acbdad773960b95512bb6ab0e8e63d24929777629fb2",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:25.151858+00:00",
+          "sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+          "raw_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "542370d55c3070811557ce865119beabeb21403b35533c22394e0b3ba7b81887"
+          "capture_id": "c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl124111",
-          "url": "https://api.crossref.org/works/10.1029/2026gl124111",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl124111",
-          "title": "Crossref record doi:10.1029/2026gl124111: Atlantic Multidecadal Oscillation Drives Multidecadal Changes in the Impact of Indian Ocean Dipole on El Niño‐Southern Oscillation",
+          "id": "source.frontier.arxiv-2609-19468",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:55.593848+00:00",
-          "sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
-          "raw_sha256": "2be3a79563438af567ee2836f1b39f8cc047eb64757754534d1e8aa6a2633545",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:28.543442+00:00",
+          "sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+          "raw_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "d59ab5e8b1d8bca13778dfadf7fca264346553314bb5800d0a9d5c43f723d850"
+          "capture_id": "d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff"
         },
         {
-          "id": "source.frontier.doi-10-1111-ejed-70772",
-          "url": "https://api.crossref.org/works/10.1111/ejed.70772",
-          "final_url": "https://api.crossref.org/works/10.1111/ejed.70772",
-          "title": "Crossref record doi:10.1111/ejed.70772: Artificial Intelligence in Education: A Dual Perspective From Academics and Students on Its Transformative Potential",
+          "id": "source.frontier.arxiv-2609-18467",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:51.202553+00:00",
-          "sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
-          "raw_sha256": "e03a86b159802f9bcafe9ddd2473450453148cb25a38c86f2e5649674a2a5b5f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:31.985307+00:00",
+          "sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+          "raw_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8d5c2547bdfadd770297f954854d2c7a49edd0b2911300096f5231639e463a81"
+          "capture_id": "23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl122539",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122539",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122539",
-          "title": "Crossref record doi:10.1029/2026gl122539: SWOT High‐Rate Raster Data Reveals Antarctic Ice Shelf Motion and Change in Response to Ocean and Ice Dynamics",
+          "id": "source.frontier.arxiv-2609-17042",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:59.052033+00:00",
-          "sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
-          "raw_sha256": "da5b3174067b7424df94e291ad2077575cb40c7e2bd7a400798f632266023a7e",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:12.920566+00:00",
+          "sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+          "raw_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0c0c785074d76dddea1051fef4f30d5ea477a169298e501e1c4d19dcff5a9cb2"
+          "capture_id": "c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e"
         },
         {
-          "id": "source.frontier.doi-10-1111-ijal-70310",
-          "url": "https://api.crossref.org/works/10.1111/ijal.70310",
-          "final_url": "https://api.crossref.org/works/10.1111/ijal.70310",
-          "title": "Crossref record doi:10.1111/ijal.70310: Developing Chatbot Pragmatics Through Prompting Instruction in AI‐Assisted Communicative Practice",
+          "id": "source.frontier.arxiv-2609-16899",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:07:59.854913+00:00",
-          "sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
-          "raw_sha256": "e13b47ef8f84e5f6b2b05ccc45798b277c794366b41ac03bd57992e570962193",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:35.437678+00:00",
+          "sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+          "raw_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8a162f3a6e1add74daccba745d56189b70a2b9dddbe0f945f18aa1ab59a28e9d"
+          "capture_id": "5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80"
         },
         {
-          "id": "source.frontier.doi-10-1002-adfm-76901",
-          "url": "https://api.crossref.org/works/10.1002/adfm.76901",
-          "final_url": "https://api.crossref.org/works/10.1002/adfm.76901",
-          "title": "Crossref record doi:10.1002/adfm.76901: Implantable Ionic Memristors Based on Natural Polymer Heterojunctions",
+          "id": "source.frontier.arxiv-2609-16353",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:00.684746+00:00",
-          "sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
-          "raw_sha256": "01e00f6e125b6622a16732c58fbd1d1147bb4f0ea7d6d010b7d135f6baee031e",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:38.877234+00:00",
+          "sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+          "raw_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ffb93cfe2a5e18f7215d062d6e163bdcc6bdb8c1a068319e040cd625e603bb3e"
+          "capture_id": "c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da"
         },
         {
-          "id": "source.frontier.doi-10-1002-nzm2-70056",
-          "url": "https://api.crossref.org/works/10.1002/nzm2.70056",
-          "final_url": "https://api.crossref.org/works/10.1002/nzm2.70056",
-          "title": "Crossref record doi:10.1002/nzm2.70056: Beyond Blue Carbon: Estimating the Value of Ecosystem Services Provided by Coastal Wetlands in Aotearoa New Zealand",
+          "id": "source.frontier.arxiv-2609-16258",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:18.618680+00:00",
-          "sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
-          "raw_sha256": "9aa7395b4ef8c7976274a1c1a69a370fcb3b18b82410b983ef033501056fa340",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:16.350332+00:00",
+          "sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+          "raw_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "4e035d0f6dff9002f6fe20c0025462756ae14ac428f2df4a3a3e30f5e9c19cec"
+          "capture_id": "126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024"
         },
         {
-          "id": "source.frontier.doi-10-1144-jgs2026-026",
-          "url": "https://api.crossref.org/works/10.1144/jgs2026-026",
-          "final_url": "https://api.crossref.org/works/10.1144/jgs2026-026",
-          "title": "Crossref record doi:10.1144/jgs2026-026: Origin of river terraces by isostatic unloading of the lithosphere",
+          "id": "source.frontier.arxiv-2609-05749",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:19.410602+00:00",
-          "sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
-          "raw_sha256": "fde07c2f78466ab0ed880be4351f0b84ff38b457fffd5d0899e00878b141a06f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:42.323931+00:00",
+          "sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+          "raw_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "4acbffda785dc95a39bb1ad09f1280b7e3bb9e2fc6ba99759d665d6af9ddd52a"
+          "capture_id": "723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e"
         },
         {
-          "id": "source.frontier.doi-10-1111-ejed-70766",
-          "url": "https://api.crossref.org/works/10.1111/ejed.70766",
-          "final_url": "https://api.crossref.org/works/10.1111/ejed.70766",
-          "title": "Crossref record doi:10.1111/ejed.70766: Teacher Educators as Sustainability Change Agents: Identity, Agency, and Disciplinary Cultures in EFL and Social Sciences Programmes",
+          "id": "source.frontier.arxiv-2609-14022",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:52.481028+00:00",
-          "sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-          "raw_sha256": "bd760174ec0bc887af87106ed222c408f620c00647e1bfc18a0c398630ee1fc6",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:45.752182+00:00",
+          "sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+          "raw_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "938a315bc8ba6a705b982dc8e6d1d64f62cc6c2e425e8fd04f194b251eb9072c"
+          "capture_id": "e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c"
         },
         {
-          "id": "source.frontier.doi-10-1002-sce-70090",
-          "url": "https://api.crossref.org/works/10.1002/sce.70090",
-          "final_url": "https://api.crossref.org/works/10.1002/sce.70090",
-          "title": "Crossref record doi:10.1002/sce.70090: Science for All? A Systematic Literature Review on Effective Teaching Approaches in Inclusive and Separate Settings",
+          "id": "source.frontier.arxiv-2609-12866",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:20:42.136278+00:00",
-          "sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-          "raw_sha256": "d54a1bedd22c64b74d6daa670deab5b74cdb30112c3f748fc66dcbabbf754936",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:49.184304+00:00",
+          "sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+          "raw_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b1dbafa99abe2c2638420037a4c6534ade08781058586781074968becd01eafc"
+          "capture_id": "925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2"
         },
         {
-          "id": "source.frontier.doi-10-1002-ppp-70053",
-          "url": "https://api.crossref.org/works/10.1002/ppp.70053",
-          "final_url": "https://api.crossref.org/works/10.1002/ppp.70053",
-          "title": "Crossref record doi:10.1002/ppp.70053: Internal Permafrost Structure of Geomorphologically Distinct Palsas in Northern Sweden Revealed by Quasi‐3D ERT",
+          "id": "source.frontier.arxiv-2609-12486",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:20.200519+00:00",
-          "sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-          "raw_sha256": "49f08d61e6d6f6d372cd942cbbe64da5e3c73fb5fc9fca51efbe37f10cffa324",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:52.836742+00:00",
+          "sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+          "raw_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "43ab5569c5d29fa99230fa983c7fa217268789d6102c13110089cbf9618d0e50"
+          "capture_id": "9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257"
         },
         {
-          "id": "source.frontier.doi-10-1002-ese3-70603",
-          "url": "https://api.crossref.org/works/10.1002/ese3.70603",
-          "final_url": "https://api.crossref.org/works/10.1002/ese3.70603",
-          "title": "Crossref record doi:10.1002/ese3.70603: Research on the Critical Mechanical Criterion for Stick‐Slip Instability of Mining‐Affected Normal Faults Based on the Rate‐and‐State Friction Law",
+          "id": "source.frontier.arxiv-2609-12016",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:05.729327+00:00",
-          "sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-          "raw_sha256": "008060b465139fad9275b16b1cc16778150bfeb4afd946ac00dfb3547d3e0d49",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:56.233910+00:00",
+          "sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+          "raw_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b7abefaff40c43fdd379fb95baff1d347cf1ee96ca802013e479cc2703590c00"
+          "capture_id": "8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jd046190",
-          "url": "https://api.crossref.org/works/10.1029/2025jd046190",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jd046190",
-          "title": "Crossref record doi:10.1029/2025jd046190: Influence of Model Resolution on Simulated Extreme Wildfire Plume Heights During the 2019/2020 Australian New Year Event",
+          "id": "source.frontier.arxiv-2609-11530",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:21.015940+00:00",
-          "sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-          "raw_sha256": "371de84ce960a954ff2a8085e62718f16b9800fcac9b9104fc4307c5935e0a18",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:19.740295+00:00",
+          "sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+          "raw_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "44d50986e88aea616f9f6cdd6ace1fdb856bcaa89c5e2741ab42c76b0473838f"
+          "capture_id": "b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025gl121323",
-          "url": "https://api.crossref.org/works/10.1029/2025gl121323",
-          "final_url": "https://api.crossref.org/works/10.1029/2025gl121323",
-          "title": "Crossref record doi:10.1029/2025gl121323: Tracing the Persistence and Role of Deep‐Sea Iron Sources in the Pacific Ocean Over the Last 23 Million Years",
+          "id": "source.frontier.arxiv-2609-08218",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:07.062335+00:00",
-          "sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-          "raw_sha256": "557b40ab7a760a11fd265e95c75a514e0cca89d311c856a3d1bd1a88b4365b4d",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:42:59.774649+00:00",
+          "sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+          "raw_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "a3ae3ca00ebd2d9a4cb280f5da89b2e3ee5f69b204827cab34b583a218eabf43"
+          "capture_id": "279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b"
         },
         {
-          "id": "source.frontier.doi-10-1002-ijfe-70259",
-          "url": "https://api.crossref.org/works/10.1002/ijfe.70259",
-          "final_url": "https://api.crossref.org/works/10.1002/ijfe.70259",
-          "title": "Crossref record doi:10.1002/ijfe.70259: Fiscal Cyclicality and Debt Sustainability: Evidence From Over a Century of Data",
+          "id": "source.frontier.arxiv-2609-06163",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:54.464223+00:00",
-          "sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-          "raw_sha256": "2ebe22d912a157cb543d61704e5891628242cf69aa45ef7f759ee54cb03ea475",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:03.196691+00:00",
+          "sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+          "raw_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "9a5d72376d62193d055680e2a75f87e6c6e39c4f94fd538ecc7a87fa5d477f8b"
+          "capture_id": "4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301"
         },
         {
-          "id": "source.frontier.doi-10-1371-journal-pclm-0000696",
-          "url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696",
-          "final_url": "https://api.crossref.org/works/10.1371/journal.pclm.0000696",
-          "title": "Crossref record doi:10.1371/journal.pclm.0000696: Maximising the economic value of water through adaptive, climate-informed irrigation scheduling",
+          "id": "source.frontier.arxiv-2609-06066",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:14.405434+00:00",
-          "sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-          "raw_sha256": "1856df1f92c637bef9199d99378d88e365ab23623d973776b5724e82b513e65c",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:06.668513+00:00",
+          "sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+          "raw_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "00a94cb1e9701a469e60ef7f85629500092c5ada184c8ec0f9a160987a743bbb"
+          "capture_id": "7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f"
         },
         {
-          "id": "source.frontier.doi-10-1111-aphw-70185",
-          "url": "https://api.crossref.org/works/10.1111/aphw.70185",
-          "final_url": "https://api.crossref.org/works/10.1111/aphw.70185",
-          "title": "Crossref record doi:10.1111/aphw.70185: Reintroducing community health psychology: A journal‐based analysis of the visibility and integration of community‐based participatory research",
+          "id": "source.frontier.arxiv-2609-02071",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:56.038222+00:00",
-          "sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-          "raw_sha256": "f97af1081f17da420847d5e41ee9c46a664b4fbd0253fb13fb74a4931b8f9e5b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:10.062628+00:00",
+          "sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+          "raw_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "dbda48ee422d1821299b127458098f26219c8116cb7438847070b427be769701"
+          "capture_id": "6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026jh001250",
-          "url": "https://api.crossref.org/works/10.1029/2026jh001250",
-          "final_url": "https://api.crossref.org/works/10.1029/2026jh001250",
-          "title": "Crossref record doi:10.1029/2026jh001250: Glacier Mass Balance Modeling Using a Long Short‐Term Memory Network",
+          "id": "source.frontier.arxiv-2608-31034",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:15.244714+00:00",
-          "sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-          "raw_sha256": "571ccdf7999944215cbe9fa72a0f13d8997f149450a872923883479eabae51fc",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:13.664613+00:00",
+          "sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+          "raw_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b7edc25c1be10dd4d505ce4eca04207ba655ea62fafb1e94eb898b8857c9a2bc"
+          "capture_id": "dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl122518",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122518",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122518",
-          "title": "Crossref record doi:10.1029/2026gl122518: Does Three‐Dimensional Structure Affect Tsunami Excitation and Stress Drop Estimates?—The Case of the 2011 Tohoku Earthquake",
+          "id": "source.frontier.arxiv-2608-28387",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:21.804378+00:00",
-          "sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-          "raw_sha256": "27e7be7072675acc97c0bb9c3bf3d7cbb5a0d9567ad1b2baf50c14eb8e20eb0b",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:23.164206+00:00",
+          "sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+          "raw_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "e34842ffeb201bd830da6669374ca5aab041e573dbe9478f2fe694a10d235476"
+          "capture_id": "f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf"
         },
         {
-          "id": "source.frontier.doi-10-3897-brics-econ-7-e172739",
-          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739",
-          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e172739",
-          "title": "Crossref record doi:10.3897/brics-econ.7.e172739: The Impact of Digital Services Trade on Economic Growth in Developing Economies: A Machine Learning Approach",
+          "id": "source.frontier.arxiv-2608-27536",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:56.896953+00:00",
-          "sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-          "raw_sha256": "71a96e2b2c2e367d2f7f1bd77a30a2f926afb29573edb63fa3e7b572fbd553f1",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:26.557443+00:00",
+          "sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+          "raw_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6d4b806da854fd0a6ca528da9828f9e5894bded713c0c27e5781ba0c6a79addb"
+          "capture_id": "93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814"
         },
         {
-          "id": "source.frontier.doi-10-1111-jmg-70045",
-          "url": "https://api.crossref.org/works/10.1111/jmg.70045",
-          "final_url": "https://api.crossref.org/works/10.1111/jmg.70045",
-          "title": "Crossref record doi:10.1111/jmg.70045: Subduction Initiation and Early Subduction Zone Development: Insights From the P–T–t Path of the Bay of Islands Metamorphic Sole",
+          "id": "source.frontier.arxiv-2608-26093",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:21.219245+00:00",
-          "sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-          "raw_sha256": "fef8e865ee2f0d4a303d0b6864bf0ddc1fdbf673a7a0c02037b82ba66a8ac49a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:17.079904+00:00",
+          "sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+          "raw_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "9a680f910da2a0d21c2273f9284af579bbaf4a46ef52a769a656943e8c1caaf7"
+          "capture_id": "50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757"
         },
         {
-          "id": "source.frontier.doi-10-1002-ppp-70049",
-          "url": "https://api.crossref.org/works/10.1002/ppp.70049",
-          "final_url": "https://api.crossref.org/works/10.1002/ppp.70049",
-          "title": "Crossref record doi:10.1002/ppp.70049: Disposition Model for Permafrost Degradation in Mountainous Regions",
+          "id": "source.frontier.arxiv-2608-24219",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:22.642301+00:00",
-          "sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-          "raw_sha256": "ee1bc03543233184c02b541999b1aeaef2bd7c9561f089c6c25ad7a5c8e0f3d8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:29.991977+00:00",
+          "sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+          "raw_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "74b12793c36606dde0eed8401bd14a3e48656de0158328d5066a2bd3ab2b732b"
+          "capture_id": "0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa"
         },
         {
-          "id": "source.frontier.doi-10-3897-brics-econ-7-e162074",
-          "url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074",
-          "final_url": "https://api.crossref.org/works/10.3897/brics-econ.7.e162074",
-          "title": "Crossref record doi:10.3897/brics-econ.7.e162074: The Nexus between Government Investment in Human Capital and Economic Growth in Nigeria: when Institutions Matter",
+          "id": "source.frontier.arxiv-2608-23972",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:57.741707+00:00",
-          "sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-          "raw_sha256": "bddd23a4a4f803a5952dd4321cebab02a84f1b75a68f43a5d18b908cae72456c",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:20.616948+00:00",
+          "sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+          "raw_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8131eff1e6cd6868683d7d33aaac519fd8068ae80a944d97e781b444864803f2"
+          "capture_id": "eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a"
         },
         {
-          "id": "source.frontier.doi-10-1111-ijal-70289",
-          "url": "https://api.crossref.org/works/10.1111/ijal.70289",
-          "final_url": "https://api.crossref.org/works/10.1111/ijal.70289",
-          "title": "Crossref record doi:10.1111/ijal.70289: Challenging the Monolith: Ambivalence, the Native‐Speaker Ideal and Teacher Preparation in Multilingual South Africa",
+          "id": "source.frontier.arxiv-2608-21764",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:27.573856+00:00",
-          "sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-          "raw_sha256": "fcbf16f13b864f7fce305ee249b201ecbf8505674623986dc79d27ab2621f834",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:43:24.047991+00:00",
+          "sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+          "raw_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "e7349db870863c11bbe1e7bb743ae4914f271c2ffe8df8ba5e282704b66c0868"
+          "capture_id": "8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f"
         },
         {
-          "id": "source.frontier.doi-10-2166-wpt-2026-383",
-          "url": "https://api.crossref.org/works/10.2166/wpt.2026.383",
-          "final_url": "https://api.crossref.org/works/10.2166/wpt.2026.383",
-          "title": "Crossref record doi:10.2166/wpt.2026.383: Characterization of the impacts of climate change on meteorological and hydrological drought in the koliba-corubal watershed of Guinea and Guinea-Biss",
+          "id": "source.frontier.arxiv-2608-21020",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:23.477316+00:00",
-          "sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-          "raw_sha256": "93eb2a68c05d293d04995c418d19e47a7542d3ec1e60f4cbeb2f5ac22aff9a54",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:36.937030+00:00",
+          "sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+          "raw_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "1180ae123b654ca1378f5b6251d0dc3fee2c4a8c42aa5c6705f515bd6ade8b01"
+          "capture_id": "9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274"
         },
         {
-          "id": "source.frontier.doi-10-2166-wcc-2026-359",
-          "url": "https://api.crossref.org/works/10.2166/wcc.2026.359",
-          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.359",
-          "title": "Crossref record doi:10.2166/wcc.2026.359: Water, Watt, and Warming: Hydropower Futures in the Eastern Nepal Himalayas under Climate Change",
+          "id": "source.frontier.arxiv-2608-20723",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:29.768865+00:00",
-          "sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-          "raw_sha256": "030fa4c9f1e055c9226e8441efe6495cba13a75d7da98b2cfee8dc3f3ad7a467",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:40.332186+00:00",
+          "sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+          "raw_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "a9c816eca913a8e5b93ebd12e464b92c653e5d43d2e2d8cd4129e063c0f47cc9"
+          "capture_id": "cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c"
         },
         {
-          "id": "source.frontier.doi-10-66630-sc-2026-0009",
-          "url": "https://api.crossref.org/works/10.66630/sc.2026.0009",
-          "final_url": "https://api.crossref.org/works/10.66630/sc.2026.0009",
-          "title": "Crossref record doi:10.66630/sc.2026.0009: From the Mainland to the Islands: Mapping the Political Geographies of Koreatown and Chinese Monterey Park, LA",
+          "id": "source.frontier.arxiv-2608-19416",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:12:58.620510+00:00",
-          "sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-          "raw_sha256": "6098cabd485ef317fe3ea8e33370531f099810e0cd1f464c061a8e9263db1210",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:47.330316+00:00",
+          "sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+          "raw_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "5b3cc00264669185ef3786aa17aa49e020c1fe582e37121e739b4fbe61394f61"
+          "capture_id": "8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7"
         },
         {
-          "id": "source.frontier.doi-10-59588-2961-3094-1247",
-          "url": "https://api.crossref.org/works/10.59588/2961-3094.1247",
-          "final_url": "https://api.crossref.org/works/10.59588/2961-3094.1247",
-          "title": "Crossref record doi:10.59588/2961-3094.1247: Creative Constructions in Asian and World Englishes - And What They Teach Us",
+          "id": "source.frontier.arxiv-2608-18396",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:36.199381+00:00",
-          "sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-          "raw_sha256": "d8be6451e66bae53a3b0e072047a9511886a7feec9c957075f608dc13aec31ef",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:50.736323+00:00",
+          "sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+          "raw_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "80c186b9c8ebba38def4d5ff1ba323f65b3592af8f34a744d65c03fbe8cfdf6b"
+          "capture_id": "d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae"
         },
         {
-          "id": "source.frontier.doi-10-28918-jei-v11i1-2606",
-          "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606",
-          "final_url": "https://api.crossref.org/works/10.28918/jei.v11i1.2606",
-          "title": "Crossref record doi:10.28918/jei.v11i1.2606: Decoding Leadership Pedagogy in Lutung Kasarung: A Semiotic Analysis of Constitutionalism and Religious Moderation",
+          "id": "source.frontier.arxiv-2608-18060",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:24.255025+00:00",
-          "sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-          "raw_sha256": "479f65ad24615ec4c60362bdaae3596918306baf25c24fee0c1fbd99f42e30e8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:54.140653+00:00",
+          "sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+          "raw_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ad9a554bfbe662cd4dfca092a21b5fdf907160137d29eeca0e581da5dc18a7a5"
+          "capture_id": "381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590"
         },
         {
-          "id": "source.frontier.doi-10-28918-jei-v11i1-2601",
-          "url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601",
-          "final_url": "https://api.crossref.org/works/10.28918/jei.v11i1.2601",
-          "title": "Crossref record doi:10.28918/jei.v11i1.2601: Cyber-Based Integrative Learning Design In Pesantren: A Systematic Literature Review On Islamic Education Transformation",
+          "id": "source.frontier.arxiv-2608-16290",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:37.334888+00:00",
-          "sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-          "raw_sha256": "a5bae77a591183c407066d323f52545b90934fbbf5b4ec01be505630d637dc9e",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:26:58.288760+00:00",
+          "sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+          "raw_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "cf4196aa8748b1b81e704e069408a0582c90e39345903d1418536dd776dc355c"
+          "capture_id": "7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025wr041875",
-          "url": "https://api.crossref.org/works/10.1029/2025wr041875",
-          "final_url": "https://api.crossref.org/works/10.1029/2025wr041875",
-          "title": "Crossref record doi:10.1029/2025wr041875: Streamflow Calibration in Ungauged Basins Using SWOT Discharge and SMAP Surface Soil Moisture Products",
+          "id": "source.frontier.arxiv-2608-12037",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:41.289363+00:00",
-          "sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-          "raw_sha256": "e508edca1c1340935cd9dd9b96fddc87495cd973594fab38d66c2c6602b043dc",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:03.007866+00:00",
+          "sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+          "raw_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "07ff78cd8ae7a8ba61296f9297a47a5afb5e986713368392ed7a2f8993df2462"
+          "capture_id": "50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a"
         },
         {
-          "id": "source.frontier.doi-10-2166-wcc-2026-006",
-          "url": "https://api.crossref.org/works/10.2166/wcc.2026.006",
-          "final_url": "https://api.crossref.org/works/10.2166/wcc.2026.006",
-          "title": "Crossref record doi:10.2166/wcc.2026.006: Groundwater recharge modeling and management implications using WetSpass and random forest in Kobo Valley, Ethiopia",
+          "id": "source.frontier.arxiv-2608-11929",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:46.693066+00:00",
-          "sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-          "raw_sha256": "ae13f22dd1fbf138e0382074bb8bccada0ea67fdd4d962803107a336581cae54",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:06.672757+00:00",
+          "sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+          "raw_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "3a2d003f3d86f6cf12eda5d598fd7ba8ab50af429056673d6d5609ac182281fd"
+          "capture_id": "d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jb033060",
-          "url": "https://api.crossref.org/works/10.1029/2025jb033060",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jb033060",
-          "title": "Crossref record doi:10.1029/2025jb033060: Role of Volcano‐Tectonic Interactions During Early‐Phase Magma‐Assisted Continental Rifting",
+          "id": "source.frontier.arxiv-2608-11175",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:25.087604+00:00",
-          "sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-          "raw_sha256": "276e27913a9bb818b24e0bd2375a2525a76d528e90b5ee60e9fb5412cc52902c",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:10.765600+00:00",
+          "sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+          "raw_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "a035126087b38af77de2cf44dd034eff742c2fc273a5dd19286d79e279923310"
+          "capture_id": "ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025ea004610",
-          "url": "https://api.crossref.org/works/10.1029/2025ea004610",
-          "final_url": "https://api.crossref.org/works/10.1029/2025ea004610",
-          "title": "Crossref record doi:10.1029/2025ea004610: An Information Geometry‐Based Method to Study Atmospheric and Seismic Phenomena With VLF Signals",
+          "id": "source.frontier.arxiv-2608-10825",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:48.180926+00:00",
-          "sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-          "raw_sha256": "5fffbd5e68aa68bfa603867e327fd21acdbffacef35920334e34965da665538d",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:15.336482+00:00",
+          "sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+          "raw_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0d8350ad94825d9e536b1bdc2d646062afdb16eeb85e381c0d8d6156a4fc1c8e"
+          "capture_id": "50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl122157",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122157",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122157",
-          "title": "Crossref record doi:10.1029/2026gl122157: Coarse Sediment Transport in a Near‐Terminus Subglacial Channel",
+          "id": "source.frontier.arxiv-2608-08151",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:52.136485+00:00",
-          "sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-          "raw_sha256": "bf9eaa45d6974257d1bdf4462b12df0552024da394064dd7cce02a2944e1cc42",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:19.947057+00:00",
+          "sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+          "raw_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "7f46f950ae93eea00b1054be8a82d8fcb993f58007cb6b09bd0df9919aae047a"
+          "capture_id": "f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162"
         },
         {
-          "id": "source.frontier.doi-10-1002-esp4-70096",
-          "url": "https://api.crossref.org/works/10.1002/esp4.70096",
-          "final_url": "https://api.crossref.org/works/10.1002/esp4.70096",
-          "title": "Crossref record doi:10.1002/esp4.70096: Validation of ShakeMaps Created From Global Navigation Satellite System (GNSS) Velocities",
+          "id": "source.frontier.arxiv-2608-10254",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:26.671640+00:00",
-          "sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-          "raw_sha256": "b08ea6ed49f09787d694f09f4de9db411a5477d0a3a49d83504c7b5d4afd1731",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:23.741882+00:00",
+          "sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+          "raw_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "0ccd2985ef1747868e8a8a04880436920caaa4507465b6bb07a0af40fdc10423"
+          "capture_id": "76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12"
         },
         {
-          "id": "source.frontier.doi-10-1111-bioe-70124",
-          "url": "https://api.crossref.org/works/10.1111/bioe.70124",
-          "final_url": "https://api.crossref.org/works/10.1111/bioe.70124",
-          "title": "Crossref record doi:10.1111/bioe.70124: The Concept of Harm in Medical Ethics",
+          "id": "source.frontier.arxiv-2608-08599",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:57.078734+00:00",
-          "sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-          "raw_sha256": "26540bbbce2f86b3ee36cc82e65138665619ff2aa6bc2c4e96fe906a50ec7cf8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:27.577789+00:00",
+          "sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+          "raw_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "2cd286345703d224fd7323c82b5f9ee983d7ec680db50067e7a933f7ced72382"
+          "capture_id": "0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306"
         },
         {
-          "id": "source.frontier.doi-10-1002-adom-71396",
-          "url": "https://api.crossref.org/works/10.1002/adom.71396",
-          "final_url": "https://api.crossref.org/works/10.1002/adom.71396",
-          "title": "Crossref record doi:10.1002/adom.71396: Machine Learning Enables Inverse Design of Optically Driven Microscopic Metavehicles",
+          "id": "source.frontier.arxiv-2608-12398",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:57.862869+00:00",
-          "sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-          "raw_sha256": "1f1b68f8a70e06c68b21214b482a8c7bf9065b4ca52dead27876c8a330d419bc",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:32.097457+00:00",
+          "sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+          "raw_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "8f381c6c021c852a588ea112820772c07bd978937b8a885d1fb410a7b93b879c"
+          "capture_id": "21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571"
         },
         {
-          "id": "source.frontier.doi-10-1002-ese3-70586",
-          "url": "https://api.crossref.org/works/10.1002/ese3.70586",
-          "final_url": "https://api.crossref.org/works/10.1002/ese3.70586",
-          "title": "Crossref record doi:10.1002/ese3.70586: Influence of Structural and Environmental Parameters on Solar Air Collector Performance",
+          "id": "source.frontier.arxiv-2608-07289",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:58.658775+00:00",
-          "sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-          "raw_sha256": "e7fb270502e136c116d14361a23a11d92ed101d1183544661ee87b55de52ac18",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:36.613719+00:00",
+          "sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+          "raw_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "2872a7c595292073cb0bbc58732f21eb2173ae68116641f952c90b0373fab525"
+          "capture_id": "cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661"
         },
         {
-          "id": "source.frontier.doi-10-1144-jgs2026-039",
-          "url": "https://api.crossref.org/works/10.1144/jgs2026-039",
-          "final_url": "https://api.crossref.org/works/10.1144/jgs2026-039",
-          "title": "Crossref record doi:10.1144/jgs2026-039: Orogenic architecture diagrams to reconstruct palaeogeography and plate tectonics: Newfoundland (Canada) as a case study",
+          "id": "source.frontier.arxiv-2608-05481",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:28.427759+00:00",
-          "sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-          "raw_sha256": "8aa29811fe60d693af8911fcfd82ee1bf0b46e43672435be75ff90365f574f75",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:40.262634+00:00",
+          "sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+          "raw_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "36120c7d6358ffeffabce23392a06e01d6c9b483ed8bc72970aee13d14ce8bf8"
+          "capture_id": "c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3"
         },
         {
-          "id": "source.frontier.doi-10-1002-hec-70120",
-          "url": "https://api.crossref.org/works/10.1002/hec.70120",
-          "final_url": "https://api.crossref.org/works/10.1002/hec.70120",
-          "title": "Crossref record doi:10.1002/hec.70120: Beyond Tobacco Prevention: The Effects of Tobacco 21 Laws on Young Adults' Body Weight",
+          "id": "source.frontier.arxiv-2608-05348",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:00.422336+00:00",
-          "sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-          "raw_sha256": "577578f826fae0fc438d060a02d84c74b76a0e0427bca8108433120eb3ac5134",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:44.117017+00:00",
+          "sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+          "raw_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "67ceef27110aee0f5727c88a98f23cd3a3c3d1b4da170cd01bc80e0887ab4362"
+          "capture_id": "b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056"
         },
         {
-          "id": "source.frontier.doi-10-1111-1467-9477-70049",
-          "url": "https://api.crossref.org/works/10.1111/1467-9477.70049",
-          "final_url": "https://api.crossref.org/works/10.1111/1467-9477.70049",
-          "title": "Crossref record doi:10.1111/1467-9477.70049: The Red‐Blue Heuristics: How Citizens Manage Institutionalized Coalition Politics",
+          "id": "source.frontier.arxiv-2608-12393",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:01.194995+00:00",
-          "sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-          "raw_sha256": "8263c26c23b2e99e0313ef7f90f23ab8f9c3df862a40fa94807f1c4fd7ed2dab",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:48.110806+00:00",
+          "sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+          "raw_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "a4fec35dd559f020598a6c992cbafb187f19fb8bb1f6c35a9cd8ffce38db1af0"
+          "capture_id": "bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892"
         },
         {
-          "id": "source.frontier.doi-10-1111-faam-70045",
-          "url": "https://api.crossref.org/works/10.1111/faam.70045",
-          "final_url": "https://api.crossref.org/works/10.1111/faam.70045",
-          "title": "Crossref record doi:10.1111/faam.70045: Unprincipled Principals in the Accountability Chain: Autonomy and Political Control Within Tax Administration in a Developing Country Context",
+          "id": "source.frontier.arxiv-2608-04227",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:20:43.170351+00:00",
-          "sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-          "raw_sha256": "baabddfd70e3c096c314ab904cf28441acdeef807de6dad423ecf494c2b13162",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:52.159620+00:00",
+          "sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+          "raw_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "e94e56cdb10dd36acd1b4637ea9b041ee3073716bfca03f126e18233d0f86d31"
+          "capture_id": "12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e"
         },
         {
-          "id": "source.frontier.doi-10-58491-2735-4202-3413",
-          "url": "https://api.crossref.org/works/10.58491/2735-4202.3413",
-          "final_url": "https://api.crossref.org/works/10.58491/2735-4202.3413",
-          "title": "Crossref record doi:10.58491/2735-4202.3413: EFFECT OF ROTATING CYLINDER ON BOUNDARY LAYER BEHAVIOR AND AERODYNAMIC PERFORMANCE OF NACA 0015 AIRFOIL",
+          "id": "source.frontier.arxiv-2608-04133",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:08:59.436190+00:00",
-          "sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-          "raw_sha256": "dd256062918deb1880ceaa0585d5a28395fe4d29a0e2eb6916dadbd63251dddb",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:27:56.250227+00:00",
+          "sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+          "raw_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "e96675de40fc2b9e94ca1f422211c921f05f3bb8daad786ebc810976a5dc2aaf"
+          "capture_id": "454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025gl121378",
-          "url": "https://api.crossref.org/works/10.1029/2025gl121378",
-          "final_url": "https://api.crossref.org/works/10.1029/2025gl121378",
-          "title": "Crossref record doi:10.1029/2025gl121378: Seismic Velocity Variations Illustrate Hydrological and Ecohydrological Processes in a Mountain Watershed",
+          "id": "source.frontier.arxiv-2608-03967",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:04.788856+00:00",
-          "sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-          "raw_sha256": "b7fe7265fad743754c3585ddedc0983b06a92d2d74564296a082a588aa595bbd",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:02.666601+00:00",
+          "sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+          "raw_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "f5d6b3888f8a8dffe867a2d1c76b8199658291025770fa6500cfe7f958ffa39c"
+          "capture_id": "e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d"
         },
         {
-          "id": "source.frontier.doi-10-56403-nejesh-v5i2-421",
-          "url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421",
-          "final_url": "https://api.crossref.org/works/10.56403/nejesh.v5i2.421",
-          "title": "Crossref record doi:10.56403/nejesh.v5i2.421: The Effect of Product Visual Aesthetics, Brand Identity Consistency and Sustainability Value on Product Purchasing Behavior in Islamic Business Perspe",
+          "id": "source.frontier.arxiv-2608-02978",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:01.076217+00:00",
-          "sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-          "raw_sha256": "7eb6ad593d91392b17a7ef9757cd3d14a96799401870f3f9a4cb74361f9abfda",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:10.661819+00:00",
+          "sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+          "raw_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "013d8c60f4b8f80756f0c917c6e4ef3e941814e90a4c48d123ff5d2c0e42a576"
+          "capture_id": "d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl123355",
-          "url": "https://api.crossref.org/works/10.1029/2026gl123355",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl123355",
-          "title": "Crossref record doi:10.1029/2026gl123355: Energy Dependence of Energetic Electron Precipitation Rates Near the Foot of Electron Isotropy Boundary",
+          "id": "source.frontier.arxiv-2608-02976",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:29.225563+00:00",
-          "sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-          "raw_sha256": "89c1e66dcae5f738ad86c1f26a6e2744feea6686abcdf31f4c8c3e28eb0f1b8a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:14.377224+00:00",
+          "sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+          "raw_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "12aed988c6b8ee96d658540219ffbd46d2cd9bb4c7b1d8409fb3c3476a61f646"
+          "capture_id": "76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025gl121171",
-          "url": "https://api.crossref.org/works/10.1029/2025gl121171",
-          "final_url": "https://api.crossref.org/works/10.1029/2025gl121171",
-          "title": "Crossref record doi:10.1029/2025gl121171: Satellite‐Derived Leaf Photosynthetic Capacity Data Set Improves Atmospheric Inversion of Terrestrial Carbon Fluxes",
+          "id": "source.frontier.arxiv-2608-02244",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:06.432140+00:00",
-          "sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-          "raw_sha256": "d96d807a0e6d350afa78d9f217f265850f0ebfbfed85af5d0a3305be1f30cf48",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:18.166437+00:00",
+          "sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+          "raw_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "bea7b807029312cfaf727766df4a19e743e76c2b27f15ef91d5cd218ec3ebcf3"
+          "capture_id": "18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jd044617",
-          "url": "https://api.crossref.org/works/10.1029/2025jd044617",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jd044617",
-          "title": "Crossref record doi:10.1029/2025jd044617: Understanding Drought‐Induced Soil Moisture Feedback on Atmospheric Circulation: Observations and Simulation Experiments of the 2020 Western U.S. Drou",
+          "id": "source.frontier.arxiv-2608-02079",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:08.056890+00:00",
-          "sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-          "raw_sha256": "7c729a02ec8eb30d51a85054deab4792531223f4f5e7127e6a3e8cdc18225725",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:21.610496+00:00",
+          "sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+          "raw_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "164cf72d81f88dda03d6e495f87e35aed915c5faa2b2bee524787ad62606d3ce"
+          "capture_id": "16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be"
         },
         {
-          "id": "source.frontier.doi-10-22378-he-2026-11-2-218-234",
-          "url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234",
-          "final_url": "https://api.crossref.org/works/10.22378/he.2026-11-2.218-234",
-          "title": "Crossref record doi:10.22378/he.2026-11-2.218-234: Trends in historical science in Tatarstan: continuity, innovation, and research prospects (dedicated to the 30th anniversary of the Marjani Institute ",
+          "id": "source.frontier.arxiv-2608-01220",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:03.592763+00:00",
-          "sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-          "raw_sha256": "adda883be774f27552a5b14a346739dd6170b29d3a464f9ea7b9992d9bdf5d06",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:25.245394+00:00",
+          "sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+          "raw_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "862830b1e086a382c1b9f7e2ed731dc8f408d26915dd558b2c0e9aa4a7f2fae6"
+          "capture_id": "8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jd045718",
-          "url": "https://api.crossref.org/works/10.1029/2025jd045718",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jd045718",
-          "title": "Crossref record doi:10.1029/2025jd045718: Large‐Scale Moisture Circulation Index Related to Socioeconomic Drought and Its Subseasonal Forecast Skill in the Asian Monsoon Rainy Season",
+          "id": "source.frontier.arxiv-2608-00959",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:30.038626+00:00",
-          "sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-          "raw_sha256": "f08c0d85a3e1c3944a78be70d7baabd4f0c483ac17dcefe7de345688db4a3c2d",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:29.260496+00:00",
+          "sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+          "raw_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "beed779a24caa6abbe24d220add0c7116f65ad9e8f4eec12f3a690df1038572a"
+          "capture_id": "97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67"
         },
         {
-          "id": "source.frontier.doi-10-1029-2026gl122664",
-          "url": "https://api.crossref.org/works/10.1029/2026gl122664",
-          "final_url": "https://api.crossref.org/works/10.1029/2026gl122664",
-          "title": "Crossref record doi:10.1029/2026gl122664: From Lotic to Lentic: SWOT Characterizes Seasonal Hydrodynamics in the Lake‐River Continuum",
+          "id": "source.frontier.arxiv-2607-17248",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:30.846496+00:00",
-          "sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-          "raw_sha256": "70607314c77b62199922b4624ff1046374f349370d8075e1501871a22273f477",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:32.871311+00:00",
+          "sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+          "raw_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "b6b291d150ce56c13a5d1f35c9f7196340cedf7ddf32c66297b5148d28017607"
+          "capture_id": "c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab"
         },
         {
-          "id": "source.frontier.doi-10-1111-ojoa-70022",
-          "url": "https://api.crossref.org/works/10.1111/ojoa.70022",
-          "final_url": "https://api.crossref.org/works/10.1111/ojoa.70022",
-          "title": "Crossref record doi:10.1111/ojoa.70022: QUANTIFYING THE SUPPLY OF ROMAN WINE AND OLIVE OIL IN FRANCE: AN AORISTIC ANALYSIS OF AMPHORAE ASSEMBLAGES",
+          "id": "source.frontier.arxiv-2607-14144",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:05.396546+00:00",
-          "sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-          "raw_sha256": "62095b05db27f30c437251d6798e60a208c152c2c5636c141d8bd069a746cdcb",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:36.479246+00:00",
+          "sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+          "raw_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ee74730d5991b7a587d651d40e4cd515a94152a5c15c9ec0181e42fc8af3183b"
+          "capture_id": "5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025jd045965",
-          "url": "https://api.crossref.org/works/10.1029/2025jd045965",
-          "final_url": "https://api.crossref.org/works/10.1029/2025jd045965",
-          "title": "Crossref record doi:10.1029/2025jd045965: Atmospheric Dust Transport to High‐Elevation Dronning Maud Land, Antarctica, Modulated by Cyclonic Circulation, the Pacific Decadal Oscillation, and S",
+          "id": "source.frontier.arxiv-2607-28833",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:12.455012+00:00",
-          "sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-          "raw_sha256": "3814120bb540d5f1d397c9966a8105a1ee9106dfcb1a00ba7319037999d7b881",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:40.198292+00:00",
+          "sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+          "raw_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "3a67fae743cbaab0af4ef948f5b50fb066999ac663416209f3b60f9765a6688a"
+          "capture_id": "2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391"
         },
         {
-          "id": "source.frontier.doi-10-1111-jssr-70066",
-          "url": "https://api.crossref.org/works/10.1111/jssr.70066",
-          "final_url": "https://api.crossref.org/works/10.1111/jssr.70066",
-          "title": "Crossref record doi:10.1111/jssr.70066: Multi‐Religiosity Among Asian Americans and Non‐Asian Americans",
+          "id": "source.frontier.arxiv-2607-28780",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:08.235475+00:00",
-          "sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-          "raw_sha256": "4fa70fdc0310915e8e12de657f546a25447f4a9a0fb272d319e29e742b49a7d5",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:44.632649+00:00",
+          "sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+          "raw_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "4ae2a6ff90b4c308717b7a9bb9603993f9668ba72fe953763cc95be87c529b0b"
+          "capture_id": "40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025wr042846",
-          "url": "https://api.crossref.org/works/10.1029/2025wr042846",
-          "final_url": "https://api.crossref.org/works/10.1029/2025wr042846",
-          "title": "Crossref record doi:10.1029/2025wr042846: Calcium and Multi‐Isotope Constraints on Cation Exchange in Groundwater",
+          "id": "source.frontier.arxiv-2607-28276",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:14.169010+00:00",
-          "sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-          "raw_sha256": "04d9bb787d6ec1550eb8a5793b697d48e890f80ffdaf7c2b920edbd4c4c14034",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:48.505899+00:00",
+          "sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+          "raw_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6b2d964d553d553a46ca5ece8245edbfa57c617e2a395913d7c862a9e58d40ef"
+          "capture_id": "fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409"
         },
         {
-          "id": "source.frontier.doi-10-3897-jbgs-e185535",
-          "url": "https://api.crossref.org/works/10.3897/jbgs.e185535",
-          "final_url": "https://api.crossref.org/works/10.3897/jbgs.e185535",
-          "title": "Crossref record doi:10.3897/jbgs.e185535: Landscape connectivity and sediment regulation ecosystem services in a semi-arid Mediterranean watershed: Insights from the Nfifikh basin (Morocco) us",
+          "id": "source.frontier.arxiv-2607-28224",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:15.322428+00:00",
-          "sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-          "raw_sha256": "13fd9605534ddf70ad29f3a1c059aa7c6ef0e0788acf8c8a5e85c962ae8edfc8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:51.954473+00:00",
+          "sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+          "raw_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "be3649602e0d9c2c577503a6540eeb850399543e9ad74668b40fc125d699bf70"
+          "capture_id": "46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3"
         },
         {
-          "id": "source.frontier.doi-10-1002-esp4-70082",
-          "url": "https://api.crossref.org/works/10.1002/esp4.70082",
-          "final_url": "https://api.crossref.org/works/10.1002/esp4.70082",
-          "title": "Crossref record doi:10.1002/esp4.70082: Quantifying Multidimensional Effects in Linear Site Response Using 1D and 2D Simulations of Sedimentary Basins in Wellington, New Zealand",
+          "id": "source.frontier.arxiv-2607-28185",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:32.546235+00:00",
-          "sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-          "raw_sha256": "b4049819082c6df4f24d13d81c4b14af37f88a8f0d8da63c518a629d122143c4",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:28:55.373356+00:00",
+          "sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+          "raw_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "944c3944336220fe78d2033722487b151922962f6f3ea71628d1d5987b4405e0"
+          "capture_id": "461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a"
         },
         {
-          "id": "source.frontier.doi-10-3897-nhcm-3-184711",
-          "url": "https://api.crossref.org/works/10.3897/nhcm.3.184711",
-          "final_url": "https://api.crossref.org/works/10.3897/nhcm.3.184711",
-          "title": "Crossref record doi:10.3897/nhcm.3.184711: Mobilizing bibliographic, natural history collections and citizen science data for addressing biodiversity biases: A case study with the herpetofauna ",
+          "id": "source.frontier.arxiv-2607-26209",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:10.131057+00:00",
-          "sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-          "raw_sha256": "344aee73b3679d34c786c10ea5e846099b0cc3f278cb57d562e318489bbbf48a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:29:40.817896+00:00",
+          "sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+          "raw_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "33dedde1bdda4d89f1a5f1970fed6c63499b4e4ab1f9e3fac270e83037455b33"
+          "capture_id": "0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616"
         },
         {
-          "id": "source.frontier.doi-10-1029-2025gc012776",
-          "url": "https://api.crossref.org/works/10.1029/2025gc012776",
-          "final_url": "https://api.crossref.org/works/10.1029/2025gc012776",
-          "title": "Crossref record doi:10.1029/2025gc012776: Multidisciplinary Investigation of Healy Submarine Volcano (Kermadec Arc, New Zealand) Using AUV and Submersible Data: Structural Control on Magmatic ",
+          "id": "source.frontier.arxiv-2607-25526",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:33.403467+00:00",
-          "sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-          "raw_sha256": "ab0cca4d57673606d8531ce351cdf943bba230902671b0ed8d97c6232533b3cf",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:29:54.632518+00:00",
+          "sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+          "raw_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "6e9f4ccd4deb515ed7b7ff7ebd0416a0981e5d6374df1d55f2a26426e73aa094"
+          "capture_id": "5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1"
         },
         {
-          "id": "source.frontier.doi-10-1002-joc-70436",
-          "url": "https://api.crossref.org/works/10.1002/joc.70436",
-          "final_url": "https://api.crossref.org/works/10.1002/joc.70436",
-          "title": "Crossref record doi:10.1002/joc.70436: Degradation of Seasonally Frozen Ground in the Three–River Source Region and Its Correlation Impact Within Precipitation–Runoff Process",
+          "id": "source.frontier.arxiv-2607-25081",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:35:34.227527+00:00",
-          "sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-          "raw_sha256": "4e04e27bf2d4e0d0aeb4d78287172294e62a418453dfd7d4ca6b32b803ad64c8",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:30:11.838206+00:00",
+          "sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+          "raw_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "40bfb25ab0321d5ead444d93d43dc7fd298b99d391901256816bf031179446b1"
+          "capture_id": "b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca"
         },
         {
-          "id": "source.frontier.doi-10-2166-hydro-2026-191",
-          "url": "https://api.crossref.org/works/10.2166/hydro.2026.191",
-          "final_url": "https://api.crossref.org/works/10.2166/hydro.2026.191",
-          "title": "Crossref record doi:10.2166/hydro.2026.191: A lightweight support vector-based multisensor remote sensing framework for regional soil moisture estimation",
+          "id": "source.frontier.arxiv-2607-24423",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:13:20.330963+00:00",
-          "sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-          "raw_sha256": "154f30a13cbfec1cd2abd5a603e8c8156f823aa4ea9ba288b2ce570a73da0ec6",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:30:23.303727+00:00",
+          "sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+          "raw_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "c8ed6aeb48e4414edc9dfdbab91af2114598bc0e291ef37bcf06ee9b5199de9d"
+          "capture_id": "68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3"
         },
         {
-          "id": "source.frontier.doi-10-1111-ojoa-70020",
-          "url": "https://api.crossref.org/works/10.1111/ojoa.70020",
-          "final_url": "https://api.crossref.org/works/10.1111/ojoa.70020",
-          "title": "Crossref record doi:10.1111/ojoa.70020: A STEP IN STONE. ONTOLOGIES OF PODOMORPHIC PETROGLYPHS IN SOUTHERN SCANDINAVIAN BRONZE AGE",
+          "id": "source.frontier.arxiv-2607-24360",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:14.857871+00:00",
-          "sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-          "raw_sha256": "add030fdaafe2104559cc4e579e989c867ad8f2dc3da8c9b3a95350cf982065f",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:30:27.093772+00:00",
+          "sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+          "raw_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "ddb696068345bbc579135da911f29c8464006444ece04a94d4f009cc728bb257"
+          "capture_id": "8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799"
         },
         {
-          "id": "source.frontier.doi-10-1111-phpr-70116",
-          "url": "https://api.crossref.org/works/10.1111/phpr.70116",
-          "final_url": "https://api.crossref.org/works/10.1111/phpr.70116",
-          "title": "Crossref record doi:10.1111/phpr.70116: Metaethics and the Functions of Moral Language",
+          "id": "source.frontier.arxiv-2607-22049",
+          "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv",
+          "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv",
+          "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper",
           "source_kind": "primary",
-          "retrieved_at": "2026-10-18T16:09:16.477541+00:00",
-          "sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-          "raw_sha256": "aef17c1e4f443ff28389a12e1e3c0e14f91c71b2caf9348d2bcf65e2e20a7c4a",
-          "content_type": "application/json",
+          "retrieved_at": "2026-10-18T16:32:55.113626+00:00",
+          "sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+          "raw_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259",
+          "content_type": "text/xml",
           "charset": "utf-8",
           "extraction_method": "http-text/1",
-          "capture_id": "807c80b033c9e008f23f398dc70fde8475eb966ed3577973bb0beabe47196fce"
+          "capture_id": "e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8"
         }
       ]
     }
diff --git a/research/fog-of-knowledge/nemesis/adjudications/064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355.json b/research/fog-of-knowledge/nemesis/adjudications/064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355.json
new file mode 100644
index 000000000..8dbd5eaff
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/adjudications/064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355.json
@@ -0,0 +1,4326 @@
+{
+  "protocol": "fog-evidence-adjudication/1",
+  "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+  "decisions": [
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-21653",
+      "target_kind": "node",
+      "target_sha256": "d10e242f57d4e8911cbb6626598c479b5d9fb04da16b40c1d106c5afd59a72d9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-19722",
+      "target_kind": "node",
+      "target_sha256": "a8dd47064ed088694cb7ee9d06a2648af1e7b0d1fbe824decab526d1ca8f81a9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-19515",
+      "target_kind": "node",
+      "target_sha256": "bc36f7c70ac332a0c225156aca2db0261613a4c3ebe26917c84bbe0d333ade50",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-19137",
+      "target_kind": "node",
+      "target_sha256": "09401a3ea268f6e991bb1235be758edaaf9a7fedc97c1f65562d42e1ff71dba4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.249138+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-17295",
+      "target_kind": "node",
+      "target_sha256": "258d145622ca057cff6f93b00ad958c34febb57b99ce8bf0ce7bdff897f7d141",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-16273",
+      "target_kind": "node",
+      "target_sha256": "abec13a7138c2ba0031c3c27d7bf86d76d14145eaf07fe0459c331a693ca2367",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-16259",
+      "target_kind": "node",
+      "target_sha256": "49058552123e75c929a955f283eca0a07258c3e78ac13caca148d8134b204663",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-15934",
+      "target_kind": "node",
+      "target_sha256": "db269a5e349cef256a5d35a3cc98311c81e5233fbb732f72a56f62b5d01bfd00",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-15072",
+      "target_kind": "node",
+      "target_sha256": "2202e4fba0fef0adbfffb5263a7bc935d004b4ed16d72bdb11fb868e0884f957",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-15052",
+      "target_kind": "node",
+      "target_sha256": "0e3a409e37368e61d1934fb7914817e87920ade4bb52f91410543bd22aa7049e",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.250135+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-13424",
+      "target_kind": "node",
+      "target_sha256": "7fd68d524cf3d375403bd0389a9102fcd5b849bc87b65345f29ff6b9520bbcf8",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-13402",
+      "target_kind": "node",
+      "target_sha256": "e285ae55ff03e8b9e1b4ca3e9b041f363f37f4f7dcf5a5393adb43323c720b49",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-12779",
+      "target_kind": "node",
+      "target_sha256": "0a200f89117c4ea885fb92d9afa96d2e7d7d182295a3692c61b89e36f100518d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-12604",
+      "target_kind": "node",
+      "target_sha256": "6dcaef89852aeb2edfb2adc04ae2c4909e6411ad977b12fa8f8ec8c436befca5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-12592",
+      "target_kind": "node",
+      "target_sha256": "8380fa2096717d776a89ef4c3ad492c5fed1d514dae0765acccecf4507522cd3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-12038",
+      "target_kind": "node",
+      "target_sha256": "ec13f9f86b5c1bc03a718e7b995a3a59562425a615d9fa13d6020ef08ccfcab7",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.251133+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-11869",
+      "target_kind": "node",
+      "target_sha256": "104824c9bc6d60ddd5a41780eb1897630158af4f1439f0be39b07494895010f7",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-11359",
+      "target_kind": "node",
+      "target_sha256": "ef2bb7a5097b6ae986fc47841ce396d2c9fbe30195e3e73a5fec64050fafdee9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04959",
+      "target_kind": "node",
+      "target_sha256": "60803abde49981b3e9b515f13c3ec84a0dd2b7a33767e4841de7fa7eb61e4153",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-09266",
+      "target_kind": "node",
+      "target_sha256": "fdd9b401372df0dbb49a1d2bf4e09b6e34a692866c08d6774d7fb696ee261765",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.252130+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-09080",
+      "target_kind": "node",
+      "target_sha256": "0c3a9ae37aecef4ef7a9939bb97f945686dce9d6fe36f0350d4fb9fcc35badb5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-09010",
+      "target_kind": "node",
+      "target_sha256": "c01171a7378737c5492419b63a6668029115d5d11b8913c81e55b38fab25e949",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-08744",
+      "target_kind": "node",
+      "target_sha256": "d94b8ceb803f23d37998dc793883f64d4110c56a071339d7f27d629ce51cd53a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-07616",
+      "target_kind": "node",
+      "target_sha256": "d6f577c6e767b6a3d5dff779e57b0cec93ec5198c9c36efaaf2dbeb35c1ae950",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-07307",
+      "target_kind": "node",
+      "target_sha256": "e717ce32d00a85ef8fa8159b789a4cdbe0f6b9a395412689002cb57f96b7c736",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-06601",
+      "target_kind": "node",
+      "target_sha256": "e08ebb0c4834db59eeadb6300fd9ea46ee16d77838acbe39e48dff4b98eeb018",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.253127+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04776",
+      "target_kind": "node",
+      "target_sha256": "51232f01e536c301d3c9507922fd51d0207c8f39dc571ceff9df1974cca740c2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04697",
+      "target_kind": "node",
+      "target_sha256": "ba68b962702ca2a36672b8439d35ccfa89a80b48aeef8b95aed892c80911b788",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04662",
+      "target_kind": "node",
+      "target_sha256": "1197384dd2bdaeaa27e6a1e2d3d7a19447d2b4c296430bce44eb7b8692631fb3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04630",
+      "target_kind": "node",
+      "target_sha256": "55024c472b37b3c38ae899c1bfe3976e3d6a17e3bce51137a4015acebeba897a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-04242",
+      "target_kind": "node",
+      "target_sha256": "a9a0ffb810b154d47ba126e2ae200c97999c6308914a1190664cddc15f0e5acb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-06918",
+      "target_kind": "node",
+      "target_sha256": "8264a8cd0ed245884f4313ac000543134882ef2c91953504f5ca8c09b00c19c5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.254125+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-03964",
+      "target_kind": "node",
+      "target_sha256": "db85dd871996d11690e4d572551d14de38bf3210d3196fecc9ae0da5eb44ddd8",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2610-03008",
+      "target_kind": "node",
+      "target_sha256": "82399c21be648fb96cb4a208fbf66536ea122a2350cb2dcdc8b0860c695b5db4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-39776",
+      "target_kind": "node",
+      "target_sha256": "6ecd150266bfd4751ab0c41ef9a2daa5502de52896dba3cd913c50f3047a175b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-21813",
+      "target_kind": "node",
+      "target_sha256": "701c399df4bf5ba66633b67a1c373086e8b2ccb139fac358011ef3d905dd3e37",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-36354",
+      "target_kind": "node",
+      "target_sha256": "ba2ba64d0bba4952934bb82ab0a6eec38988f094b32a07557fd48b32ddcd515f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-35424",
+      "target_kind": "node",
+      "target_sha256": "dae5b28a82fd4127b8cfa1a390f0d58fc4a3915961ee8a83656d2511f46f86a8",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-35246",
+      "target_kind": "node",
+      "target_sha256": "4c04841c92f6f2515c5aa9702bcfa24b0ae6a83779590a3c32cfa9518565faf6",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.255122+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-32315",
+      "target_kind": "node",
+      "target_sha256": "3393b4bfa9a7dbb8b378cab5ff0700aac12523f0eda8237fe96df690f99204e0",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-29972",
+      "target_kind": "node",
+      "target_sha256": "497b2f901d364e26b1b7b7625363b0dc6d2c9c25cd3d406cf9787b1bb0296d0d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-29832",
+      "target_kind": "node",
+      "target_sha256": "273391aa4a119164f559f1e6a1a3018edf1e24fe952fc25820514f35c726c8d5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-28815",
+      "target_kind": "node",
+      "target_sha256": "dbae9cf820fccc9f22815306f186c61c6bf424abe78f92c8149f93288fa29ade",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-26924",
+      "target_kind": "node",
+      "target_sha256": "2d9829e5b9835a2a33215722f146f2c3edd09aa838289952022c96436b4d46d8",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.256119+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-25847",
+      "target_kind": "node",
+      "target_sha256": "566241ea9065d5143c4a5829ca9dc1676bd4ada68203d32244bc0b8944f6905b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-25701",
+      "target_kind": "node",
+      "target_sha256": "265421a5a50e797df47c4041c93dc6fdd177388afa0791402b77b6bfa37bf770",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-25437",
+      "target_kind": "node",
+      "target_sha256": "04be0752464c1a2727c2499358978e64e3bb76280ab524b9d80244fc454dc4c9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-05763",
+      "target_kind": "node",
+      "target_sha256": "6a40b680ba9f871e726982e0df10ac8d16f87732cfb9e4dfe28adad7ca5bde57",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-23703",
+      "target_kind": "node",
+      "target_sha256": "f6b5b72f02708a4ab71cec431bb431e6a28df2a8992b4bdb1fe0b549f41af299",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.257117+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-23199",
+      "target_kind": "node",
+      "target_sha256": "e33b811b9a06eb8c266b3d181f31b1bbd885f0a6b8669ef714027ffd48a18bda",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-23085",
+      "target_kind": "node",
+      "target_sha256": "0c2b03d9b7f61908e4930255a68a278b4aa830f5d46eacdb1a95676e0f2acb18",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-22775",
+      "target_kind": "node",
+      "target_sha256": "4af32e824e726799b88d3216d8168d9d745e823b6eb705b4ca7606c9c4ac565f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-22615",
+      "target_kind": "node",
+      "target_sha256": "96738d113de264b828a57dd20f4476b9cc89a4e1ac4f698ad231439ee857f97b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.258114+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-21966",
+      "target_kind": "node",
+      "target_sha256": "f97feec8b76ab0a8ba0b3049af47cafa32d05e103c02e20b5b5868d3dcef11d0",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-21270",
+      "target_kind": "node",
+      "target_sha256": "bb3a30fcfa51c5f286b0277f756e51a7e111aab8ca4073cc47185278d8028337",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-21093",
+      "target_kind": "node",
+      "target_sha256": "c465663045ae0609766765a49d317b4f82250daed86724d16e1649eebe41769d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-21057",
+      "target_kind": "node",
+      "target_sha256": "76b88ca69cb60353712208a82ce03a82e0b5852dd6c7719bb1c49ff1ce79fb05",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-19468",
+      "target_kind": "node",
+      "target_sha256": "20b06709a97ffe2fdd32187dbe5ad19e3076dfb72acae2020827f39ef0798c20",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.259112+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-18467",
+      "target_kind": "node",
+      "target_sha256": "8673127090530ef79c91ce67d21a0961a0d2324c28977595f997b55b436942ba",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-17042",
+      "target_kind": "node",
+      "target_sha256": "dfd363fcf52796128cbf35327a99ab3b4afd63931a94569aa3641633dee4b997",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-16899",
+      "target_kind": "node",
+      "target_sha256": "439daac35e888b0458f5f4a8499371b529122e2c736647b8ca92d11a1613044d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-16353",
+      "target_kind": "node",
+      "target_sha256": "308626710d74f0f311a0557985dbae09d96b47474e6736bea1f5cacf744f1aef",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.260109+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-16258",
+      "target_kind": "node",
+      "target_sha256": "b63a96fb3fedb2f5e089b9841b38da80f9f1e2f5c871752d9028b4f41e475324",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-05749",
+      "target_kind": "node",
+      "target_sha256": "8c190861d210e319ded5562e3121eac7e3ea8ecbcf32bfe9f737fbde3b1e8287",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-14022",
+      "target_kind": "node",
+      "target_sha256": "1e7b0c229b300ae0c765be5e9dff4ce547e888afe590ae9a25063c587f663e1a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-12866",
+      "target_kind": "node",
+      "target_sha256": "6fb5d07ac292366f14bd618e81b15c716cf7d1f4890cb3390114c1caf547cab9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-12486",
+      "target_kind": "node",
+      "target_sha256": "4a8ebb64b931d95b0c5218130b7195bea59b74a1b7b9182f4541a29da18615ae",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.261106+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-12016",
+      "target_kind": "node",
+      "target_sha256": "1407a2a40fe480f7757cb800d33da002b2148b04b8adf7e3aa6991aed0928205",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-11530",
+      "target_kind": "node",
+      "target_sha256": "f6ced05713c8c792ff8a98644885b116b83444ed35c3596967af6642dba86227",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-08218",
+      "target_kind": "node",
+      "target_sha256": "e64e423c33260e0218665ec9cc382917080218f7f2bb40857cce80d0ea6736f4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262221+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-06163",
+      "target_kind": "node",
+      "target_sha256": "6ce239788a388f3ed75f291462aa025883af7db4c61e81f88db58c5851a04201",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-06066",
+      "target_kind": "node",
+      "target_sha256": "b4d6e7484b0f2f26120741889f7e2dce8b232b445f2f4f797fbf407e287cba12",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2609-02071",
+      "target_kind": "node",
+      "target_sha256": "039e2ea49be10d4d3da82b47e1b5c6f61e412d8559c04b850256203485307c30",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-31034",
+      "target_kind": "node",
+      "target_sha256": "ec0bd10015ab5dca339cb414086f312a1612f4b6f53ac333f77f67b8a91388df",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-28387",
+      "target_kind": "node",
+      "target_sha256": "6b07394df7c72280fcb7cc78d2d8826e8f36f255599684ae336b3116e2138c15",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-27536",
+      "target_kind": "node",
+      "target_sha256": "27bcb430fa3c83f7a7d1398d207348ef0a72dd0d9aef4475517ece783e174ba0",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.262730+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-26093",
+      "target_kind": "node",
+      "target_sha256": "bc56588a8d495fccbfa72e7ed6c6a57dbf51cf4fec8551bf0607c7e60c3556bb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-24219",
+      "target_kind": "node",
+      "target_sha256": "822853ae1bd10336e56f0bb36069f737aea135aaf8f7ec4f5bfb5cfab0bb7ed4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-23972",
+      "target_kind": "node",
+      "target_sha256": "2f4e8209d8fab0d2f13b2da9f1793dd68549b9ff6995792b8c8d9926e2d25ad2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-21764",
+      "target_kind": "node",
+      "target_sha256": "bbca19c1f8cb4c2b7006f9ca2cea484fefedad6b5e602ae8830f9741e4e3e7de",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-21020",
+      "target_kind": "node",
+      "target_sha256": "4a98426444f281136895acd6e36e2811a1b5fd9b30e99d03b0fd39e10f09efc3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.263724+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-20723",
+      "target_kind": "node",
+      "target_sha256": "21b5d82da39fbfd3204bb12044e33b8beab6817bfdb1dadb65fe180b87d13fff",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-19416",
+      "target_kind": "node",
+      "target_sha256": "d8889c499e52fd77720c142cb996ad430a20bddda827cc20d73b92099d872058",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-18396",
+      "target_kind": "node",
+      "target_sha256": "4230aa909bd349a12725da9500e49d54790d908f75fe72e2e5a0d245a9b10ebc",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-18060",
+      "target_kind": "node",
+      "target_sha256": "2b63e910a14d93725ef45ef1b13b0eb28ca103821e3489d92cdf0d2d5d6047e5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-16290",
+      "target_kind": "node",
+      "target_sha256": "4fe1ecbb34884d2d9f3c8e7b47b3c34d0385c84822822c2db70e7765b8387f76",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-12037",
+      "target_kind": "node",
+      "target_sha256": "f9a5d11f4ca15ccecff427fcc92faa1557867617cf2a0098fac1982eb91b24c1",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.264722+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-11929",
+      "target_kind": "node",
+      "target_sha256": "88c54a9768888234ddab15fee435818a796534a6bc0452a14c336224d174f46f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-11175",
+      "target_kind": "node",
+      "target_sha256": "61a3b6758674c089ff292933f056a52824662e5a8d2f8681f7488ce616290b83",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-10825",
+      "target_kind": "node",
+      "target_sha256": "5b6cad2caad586b624a67aaccd674490521eda4a47b8857ffa06714a2eb1153f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-08151",
+      "target_kind": "node",
+      "target_sha256": "418f661b816ee96760c776caffdcaddbb0731fcad8c70c1726fd8506afc6d9eb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-10254",
+      "target_kind": "node",
+      "target_sha256": "e6111919699867aae8824c063308a9fdf7c5dcfff8b9e00b91f43edb777f17c2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-08599",
+      "target_kind": "node",
+      "target_sha256": "bbf18907cd43f8752bbfdc399422ce23594c15350b056f40983a7fc667f3e7b0",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-12398",
+      "target_kind": "node",
+      "target_sha256": "f702c66c52e59efcce94160d673b356d4692ff4cc2e87570e5a2864d7956fa1e",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.265719+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-07289",
+      "target_kind": "node",
+      "target_sha256": "1fbadbe0683aaa090614e2b25ef1e6624b9ce0d9cc932895cff294653261dc43",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-05481",
+      "target_kind": "node",
+      "target_sha256": "c9a402016800f9b54db71f8fb34ca5a81251c460b4ed4c9f832e334bc1c7027a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-05348",
+      "target_kind": "node",
+      "target_sha256": "7fb323d587831f4c9c942c8de1ec0b5513ec729f3d747cd868de16aa413f6f15",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-12393",
+      "target_kind": "node",
+      "target_sha256": "67d9855cccf7e4f46b446c253650ec227fdbfb9d85750e956c614588ac64ebfb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-04227",
+      "target_kind": "node",
+      "target_sha256": "b23bb78dd5b45e70a53acecdd6d09f2bb9ec9afd212936fc0f602d06affb8e07",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.266716+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-04133",
+      "target_kind": "node",
+      "target_sha256": "6bc0ecdfe554d2bede0800c6ab81b1503c9bf856154d8540a2454bd4edc0e51a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-03967",
+      "target_kind": "node",
+      "target_sha256": "bcb8b2bbdc627943ea3d1fd487e21f2b1b9fc41c5c5eb532aa10e78e6b85a376",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-02978",
+      "target_kind": "node",
+      "target_sha256": "c7d8752a652edf07a25e8b05fbbc1a79f33691ddb4a36f189b5ac9a3bb13ec41",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-02976",
+      "target_kind": "node",
+      "target_sha256": "e0208edca4e1ed4f60e4c5b38ac6d2cd08b8361bf4f4752b24f2cf751c3ff74f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-02244",
+      "target_kind": "node",
+      "target_sha256": "743c5add749989b4464633c90f8aa6a9adf0fc57455492446d7ccec1d222118f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-02079",
+      "target_kind": "node",
+      "target_sha256": "e5edce4b2315fc743cc869cec2fcf60f4f81e4a54521ae777cd88be9a6cffbf7",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.267714+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-01220",
+      "target_kind": "node",
+      "target_sha256": "08d4f16884ff34ab2eb12519ccb18c619e1ba2fe06807158df2e88270c1f2f55",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2608-00959",
+      "target_kind": "node",
+      "target_sha256": "cc8190458a87f0e09885708954ef5b3680081f57bbec918a8304c0c9ee54184b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-17248",
+      "target_kind": "node",
+      "target_sha256": "1fdd859155a6a88a26146ead48d0b0144682e4825cf11c0b2bbee433a92a3008",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-14144",
+      "target_kind": "node",
+      "target_sha256": "ec328db9ea9fa05f78e82e06ffa78077eea48cf02291ed634c20ee162f41cd4f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-28833",
+      "target_kind": "node",
+      "target_sha256": "2f1fc64b249d57aed7c4731d7d0f33bcf58db73a2d62c06759ae838acca89ccf",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-28780",
+      "target_kind": "node",
+      "target_sha256": "f1b29633f5a9da54579e1b85dd2d21ca4f70cb73d2eb8aab5d92ae9010191d47",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.268711+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-28276",
+      "target_kind": "node",
+      "target_sha256": "e438ccf59a58e083b4cde740d8989d36e9ddbfe612bf00269fc14b9c764e9108",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-28224",
+      "target_kind": "node",
+      "target_sha256": "08bcee38ef32f755fbc0c8ad1f648310879b82d5496957dc1d1e9cbf160b4c07",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-28185",
+      "target_kind": "node",
+      "target_sha256": "a0573ef8da233252c54dad14f56441cb2288d5e671d3bc72be6b13962e66f133",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-26209",
+      "target_kind": "node",
+      "target_sha256": "3e3a639fce49c30240c8dffe2bfbb6757086c8e52e57f7cffe603d63d38d7ec3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-25526",
+      "target_kind": "node",
+      "target_sha256": "b1164cfef081634e80f58056041e08056c9b83bbad91b3a6f82cf28548ddcc2b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-25081",
+      "target_kind": "node",
+      "target_sha256": "b90de23cd11d00beb480dd4d7586292f01aad28b48fec4b4505bfb13cc4c9563",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.269708+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-24423",
+      "target_kind": "node",
+      "target_sha256": "6dca6dc937e903d46d9bc8faf05ead44eeca3c790d69a1881a0251f46e3d7186",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-24360",
+      "target_kind": "node",
+      "target_sha256": "ac1a6108041d1dd66eec9657ec654795b49ceb849592c814f1eafa5968d0c712",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
+    },
+    {
+      "assertion_id": "assertion.claim.frontier.arxiv-2607-22049",
+      "target_kind": "node",
+      "target_sha256": "787438a2a1978d18fca62f04ba9b03c152778f7a805b0e6417fe10473cd97bbe",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-21653.concept.nist.performance",
+      "target_kind": "edge",
+      "target_sha256": "6c52cbb353c3860106387bb725f91b15c84c080339efe63889a54f094753383b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.270705+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19722.concept.nist.linearprobng",
+      "target_kind": "edge",
+      "target_sha256": "7eecfd6e62120b32e3cafc90725ff730f46cdcf8647b9a6ff67e6a530d434441",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19515.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "5ac5de4037bb606f6bce5d6d147b789233ebf4ee8d02810774971f2b565ce793",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-19137.concept.eia.carbon-intensity",
+      "target_kind": "edge",
+      "target_sha256": "65f34a3e4de1921934fce958fbf3de103cf158d4563c30e2e926a680ffd46924",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-17295.method.nist.dynamicprog",
+      "target_kind": "edge",
+      "target_sha256": "775808a409b91ec514d386a1058df8db284a414f0f89eeabc5d424b888319cb2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.271703+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-16273.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "331f68716f56caf2cc1f64b7b17c31b7f4a000a87e691e6e5bd0072a3a9ffaf4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-16259.field.information-theory",
+      "target_kind": "edge",
+      "target_sha256": "829c50885f9d6b8d8c3621b4faa34a5e596bf54e3f277ddf4369316d8a083416",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-15072.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "8efda7b9f8e94cf895bd2e87e3ae2f48d850aa97c89f73d1a0f1cbae59c119fc",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-15052.method.nist.simulatedannealing",
+      "target_kind": "edge",
+      "target_sha256": "75ab44c41fa2aa7a69b4d8fa061ee87bef74f9c3bcdb296158fea5a50dbabd12",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-13424.concept.nist.optimalsoltn",
+      "target_kind": "edge",
+      "target_sha256": "079868db045bc283e82e361b1cf57daf828885c2772060941780296bb6d0b7cb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.272701+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-13402.field.information-theory",
+      "target_kind": "edge",
+      "target_sha256": "5dbcabdc37d02bec3ccadfaa7375107623de9bebcd60e23347c78d52ae2ae99b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12779.concept.nist.stronglyconnectedcompo",
+      "target_kind": "edge",
+      "target_sha256": "ca881d45dfea19f0f4d1689792f3c7ae8c50722a6bf04293982520cbe71ce19a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12604.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "14c2f0dad240c4d7442124b6c0f263eb37dc67dfb71e2f7e68cd2f9d95babd15",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12592.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "11b48931ed746a55634fe888b721f0428ab3ac49505d2220999f8da5dcdd5b63",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.273698+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-12038.concept.nist.binarytree",
+      "target_kind": "edge",
+      "target_sha256": "786c0410ff5cc9624a32a7c8ef50de145e7fe2d0bc05fef76b9c571b90ab7fe1",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-11869.concept.nist.objective",
+      "target_kind": "edge",
+      "target_sha256": "c1c93b38d6e47f170dcde510947d0d3fb1d38243d44d2ef627100b0505a79050",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-11359.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "8e4ed8f65551d000ad2f1d0f672269c98285e6414ff835d0a864d12f79109db4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04959.concept.nist.flownetwork",
+      "target_kind": "edge",
+      "target_sha256": "9fcd2dbcd4e1440767a958f0313d13ad345f9d85ca160b20ec7b62391961a295",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.274695+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09266.concept.nist.optimalsoltn",
+      "target_kind": "edge",
+      "target_sha256": "95603e652c1ff02230684988deb5c9ad74fb860f4d7d7dc7ac5122d5cc54673c",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09080.method.nist.exhaustivesearch",
+      "target_kind": "edge",
+      "target_sha256": "1e1160c97bfc9883df2db67b1a69e296911399de06c589edad65ee2e175342b3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-09010.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "cfcef2c8ea0a1f3f36ad2aa5f87966c321d92d4eb047fdbac321d6c69616310a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.275693+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-08744.method.nist.exhaustivesearch",
+      "target_kind": "edge",
+      "target_sha256": "34ab545a3d46057a832b840f0708925c7fc5b44ccd2cb53be8ebd322a2597a4d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-07616.method.nist.randomsearch",
+      "target_kind": "edge",
+      "target_sha256": "d424e04812d75c1602b74fa1578560a256e2d61493f28f405359034821a6896b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-07307.concept.nist.prisonersdilemma",
+      "target_kind": "edge",
+      "target_sha256": "ea2d5a86e58088fbc950e26cc8988c366be503287af370b49992819a8b8891e5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-06601.method.nist.dynamicprog",
+      "target_kind": "edge",
+      "target_sha256": "083cd631d5308584d26f4e731db2100ed2393b9f1955bf4b0df8e2887a1ad43f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.276690+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04776.method.nist.exhaustivesearch",
+      "target_kind": "edge",
+      "target_sha256": "9f5995026dd7354e0abb244a9aed300018a1287c4ecec39bf4870b89fabcb358",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04697.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "2b37efcee69a5a45ddd737da1a20a2b5e4b4a8f254ac38ea0cdb4b1092a8c5cf",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04662.concept.nist.temporllogic",
+      "target_kind": "edge",
+      "target_sha256": "c8b7c19acd6410839be0b87fa7602dc180e4d9eabdd6e1654175c200da8ecef6",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04630.concept.eia.energy-consumption",
+      "target_kind": "edge",
+      "target_sha256": "6ee864e6e4d8de82908b044af002a0720e95d07b6623d4fe2f482e636efec452",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.277687+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-04242.concept.nist.markovchain",
+      "target_kind": "edge",
+      "target_sha256": "ab3432af0492253188d8364f4c2abbeb3dd47209ca8f6519bb64d674cb7809e7",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-06918.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "29a8363a8bcd9d4d2eb17e2ea483a1a737c4be2458790df52abe7489f4664365",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-03964.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "031719b4145d0bbc7a85ebb7be1157edb1498406bf8a5949269c5db692ed87d9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2610-03008.field.cognitive-science",
+      "target_kind": "edge",
+      "target_sha256": "6b7988527fbc5ffd579c6cc2cd51c1b1ed0041185357398ea94f41ed60034a7b",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-39776.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "e569cfefa8896e225ee769fcccc6d5787e6a4d11556d3d4e0e1ceb43db9c0f80",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21813.concept.nist.probesequenc",
+      "target_kind": "edge",
+      "target_sha256": "7b8a7875a41ead85da7ec454cf5c43224cfaa80ac6be876dd7731e5e628466ef",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.278685+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-36354.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "191e7f272a45ada4cb08145a73bcb42df1e1f4e2e7b9ddaafbd3438ea9bf7a6e",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-35424.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "dbc4f58751e99e4694397a21ccc362c382a612194a51ea1afc6614c19e8a0419",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-35246.concept.eia.distribution-system",
+      "target_kind": "edge",
+      "target_sha256": "58df9f39e461a31db9ae12399d63fea358f4ba08e5527bd2568fe3b98e4cd9fb",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-32315.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "beb1c296d511195cfc6709e582be598becb3d95ec3f853573bd3e028b054a9e2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-29972.concept.mesh.d000088562",
+      "target_kind": "edge",
+      "target_sha256": "315c9f8cbcc1fbdbc31815e10fd0fa4f8d34e33d7d2788e7852e4a6975b9b07e",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-29832.concept.eia.motor-speed",
+      "target_kind": "edge",
+      "target_sha256": "bf22c5a439f3714e92fb13fb9565e9ea06c8086d586c63c79ba8e7e022c97012",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-28815.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "163b542ce76fd7e9c904972938cc8354ce361525d9b494957d2cb6a146b10252",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.279682+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-26924.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "377fb68c2fd39f56ef2113fa4ee4c8eb6443e7358dd52af2051100057b6b8968",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25847.concept.eia.energy-consumption",
+      "target_kind": "edge",
+      "target_sha256": "2424e0d6156cfe4f1377689491902acd5996b4b3650c4b24e30710126913ceed",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25701.concept.nist.polynomialtm",
+      "target_kind": "edge",
+      "target_sha256": "4421fe4a5d9222d92a03f8db20b48cca17bf89d9f37bdbdf3494833d57d2b402",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-25437.concept.eia.electricity-generation",
+      "target_kind": "edge",
+      "target_sha256": "283cab111ca494566a586adaa628806c46f641acc89527be8d0671a3687e85e2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-05763.concept.eia.electric-vehicle-ev",
+      "target_kind": "edge",
+      "target_sha256": "6e7d0e064cf7fd087a6f253f3c0cde055f45d7a82f8b38402f90473f660d58be",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23703.field.computer-science",
+      "target_kind": "edge",
+      "target_sha256": "cb64767c458d409ae2997130938492ef939c060e726b9ee8624a2e9145b53680",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.280679+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23199.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "91c57e795df9ff36e5f5037ddebdf6baadb3f19537cf46a9a3e4cc32705c8de0",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-23085.concept.eia.energy-consumption",
+      "target_kind": "edge",
+      "target_sha256": "606a75a65f1a6cd6c6e34901001d5a1176b257088e8a9c0c975a1286752da824",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-22775.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "efe22ba3704dc06178130ab25bf44697dc09a9ac568d9065e6caf160b6f0a955",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-22615.method.nist.chinesermndr",
+      "target_kind": "edge",
+      "target_sha256": "ef16c225ab39ae352c6ee76cc50d429483d28539edc81fc8727973c07b88434d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21966.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "a53879bea0885fe0841074331ff28771ec205140bcf14a8e505202070118f54f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21270.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "3db67063c0dd01a006e5b44fd60dc92480f7c882eeccd702337f9ff62baade62",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21093.concept.nist.markovchain",
+      "target_kind": "edge",
+      "target_sha256": "a8505d329f1e58fb221477806177803396b0de82973b425936c0c13b2908175d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.281677+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-21057.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "e0f5d506298504f027353206d0c1bf68c33e911086e2827e402fef2dbe4b2d7f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-19468.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "f78567543e793968410477d5088c29f33c9d1bd766e773987f23372d9c89c6b6",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-18467.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "c4fab82e170b1cbf9e3b79e5232fde587b727bb9f11b82da772c7cfb27b1dea9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-17042.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "dc02363ab3a512aa0b5ffed8f27c92367eb37f00b2a24eef608ea27cb6e724cd",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16899.concept.eia.electric-vehicle-ev",
+      "target_kind": "edge",
+      "target_sha256": "4d1a267f2904efbefd538d231256be7a62d54e0c72916d5338210086996dc638",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16353.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "acb84603179546430e891d38aa064448b5a8284b8a348f065b1dd6c08afe7bc6",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-16258.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "92e3ea398d60b8181e350a7fc507e2786a249a283c7c40e7fd4636caa7cd737d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-05749.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "c475703a6ecff61ca298de935ce8c0ef2cda50e1e008b981c40d25bfd6942474",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.282674+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-14022.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "2bd61cee696276e68f780d1c4c4c517d0ade4408b4e61d9081d6250691311734",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12866.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "4e8b03a5a7eddd16128d4d382011bea7682b89c9857ee693f78c55dbda771c12",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12486.concept.nist.decisionproblem",
+      "target_kind": "edge",
+      "target_sha256": "45a9486b1a9bac493b7b6c275a536973d2f3f27983815be5ae7e519f2dd86214",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-12016.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "6685b270171c85d8f3defc3bb0debaf20efbd6238372294a6edeef992ae38fb5",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-11530.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "f0da5d2ffbd8cff94f8825e3401d0bfb310ea6240e5c8eb94b6c2aa4899f12fc",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.283671+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-08218.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "6e0a91e51501b51399997367025186f6057485022a9985818f24ff4e53c10504",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-06163.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "e479c14bdbe532ba60fd14e19a47504001d9389860f07b71e6052b43bcaf5df7",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-06066.concept.nist.performance",
+      "target_kind": "edge",
+      "target_sha256": "7b30dc4d838d3cd29f68470c4e6b7d1a7ef2a4f1e1d897aa549d73f5d8d473a1",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2609-02071.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "4cfe605897e390c799b63c35f692212d14a04a4806d6b3cd7a5115922e99296e",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-31034.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "6469c11264b897b8bde5a73f2edec03e0a1c588afbfc284ed653bc8c7945482a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.284669+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-28387.concept.eia.energy-consumption",
+      "target_kind": "edge",
+      "target_sha256": "c344811fedbaa657e44717a3c3b940b4eb8023beb4ab5e5c5a96b737b5e5b2f2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-27536.concept.nist.prisonersdilemma",
+      "target_kind": "edge",
+      "target_sha256": "b2707737e921a6fbb0c79211136a4dbde8956099a28f7edb3fc5d03870cfccbf",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-26093.concept.nist.stronglynp",
+      "target_kind": "edge",
+      "target_sha256": "b3cf9974b37f96d386e302ddb803ca413610a16848a0c640a818e44da753693a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-24219.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "703e50164da0b2c328fb37231a5694babe35cb61e368b0419251b3c7822cca26",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-23972.concept.nist.temporllogic",
+      "target_kind": "edge",
+      "target_sha256": "c980908a69eb80889b8d50c897ebc814992bf331142df148cbd1871afb1afeda",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.285666+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-21764.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "0c294df3d3df9371e5aa59f98ea8b7d28efdb23a29865542346269ca84abab1a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-21020.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "4c1958798424d6ce7c08d3873dd9256e508955bf39a6d258f465727d30aa9d77",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-20723.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "c2289649c6cf69228a1c90be937e8ae5589479e679af228e392cb239fa412b28",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-19416.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "a21938cf8a1590f99d08d60ba27c7119d0c7fc714caf04d3b3aaa70bf89ef9f9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.286664+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-18396.method.nist.exhaustivesearch",
+      "target_kind": "edge",
+      "target_sha256": "aab173a9fcbbd48c97021e62280e35f3e8e1c25e037d150ff125fdd6e4a776df",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-18060.concept.nist.temporllogic",
+      "target_kind": "edge",
+      "target_sha256": "b19cc33589da1559e42d207434e94d82dc55ac110d7e08da0ffebedaa6b8a809",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-16290.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "512a70d80f87f194c3df5c9c537a2d8bc1c3a5bf8f92910b9ed01607d6942f85",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12037.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "214ebd4c84a748434ac58377b4a2ccc72decbc188724bca8918dadd711b285d3",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-11929.concept.eia.compressor-station",
+      "target_kind": "edge",
+      "target_sha256": "7561c8ecfeb18de87d0aea47feaae39ed4801fb30437502e3bf74e8e9806e80f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-11175.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "7a693e17499f81aec0ca1fd2c35cada8a172f44319b3a00438a6153b0606bdc6",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-10825.concept.eia.electric-vehicle-ev",
+      "target_kind": "edge",
+      "target_sha256": "d1d635c0a1bcdb4c0f1db54a20e6a73f385267f18b870da07ca5b9d4c1044452",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.287660+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-08151.method.nist.dynamicprog",
+      "target_kind": "edge",
+      "target_sha256": "8375f9e8c99efeda5e4c4e7b034c1fa6e25b1a162a9b1e7fdb16e882f7b53703",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-10254.method.nist.modelcheckng",
+      "target_kind": "edge",
+      "target_sha256": "4c75b855e62c55ca4e91c3bc1ea2d5410e3907a3cacffdf41f4f264e25467e4f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-08599.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "808b2a621e821096c72fb8476b36e7a090c41c06e5233a3b7e3bec1d2770926a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12398.ology.psycholinguistics",
+      "target_kind": "edge",
+      "target_sha256": "47064720765e88ee9d08ab468fb49ef034550b6c6d2cbd9ecb7e8b1a5895af92",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-07289.concept.nist.formalmethod",
+      "target_kind": "edge",
+      "target_sha256": "289e593bf0fbf059d169503b92cf9f57511e680fb993c177bc7ef92734e488b9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-05481.field.neuroscience",
+      "target_kind": "edge",
+      "target_sha256": "cf3fda85ae9b09c913d9bb6a4c2fec06f4e8362d8490cd9f8ab9053c3d2f6a87",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.288658+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-05348.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "f3ea82218ae3052d3429755f89d53971c9b5f77558fd60eef0e064403b958e61",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-12393.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "60a107037b3c0eb81f37f81291d8bbf7aa943002a13d2e13ea296f828c121d7f",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-04227.method.nist.fastfouriertransform",
+      "target_kind": "edge",
+      "target_sha256": "8ed69d55fdb5b95c09777f7e1b31a29d5dd0cfb373da6380f7a02da4972cf0f2",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-04133.concept.nist.globaloptimum",
+      "target_kind": "edge",
+      "target_sha256": "4214fb7acd0542bee40e304d02cf792375660285164aeef7c884500c8b2a9938",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-03967.concept.nist.flownetwork",
+      "target_kind": "edge",
+      "target_sha256": "95b2484dfa2aced1d9942ea260e3c6c695d4cc5951df58ac2d43a1525b624453",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02978.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "e22d048069a65e640909a4b53418e20e14ae1dfe4a7685654b1d1910e7dd2d3a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02976.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "e850ed8fbf6081e494abcd7db3d0b39a6c1d3f37b177b1637b1d22bccbbf1db4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.289655+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02244.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "ec2ec977c984bbdf843bbd4b4745245a4aa4a8ad96e29efcd67180ea82329591",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-02079.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "8ae1d0f7a8abeedc5df1c8bce2388b6b420df12620aba5ef7f9dd583fb52bc7a",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-01220.concept.nist.objective",
+      "target_kind": "edge",
+      "target_sha256": "43619f6d7a045a771908e00af450692c742ca67cc73510275a7c1acc1db88142",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2608-00959.concept.nist.optimization",
+      "target_kind": "edge",
+      "target_sha256": "d2d69b51a25be679a0f88fd54516cbdc59bf6db5ab347406ac0e9874b1d61708",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-17248.concept.eia.fuel-cell",
+      "target_kind": "edge",
+      "target_sha256": "fc4ce603abbaeec2b32528a796137d174c61996f364c01fa86641ba77748ffad",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-14144.concept.nist.lowerbound",
+      "target_kind": "edge",
+      "target_sha256": "13b1f66d6251859aaff1e3088c41bdb3790c5b1f6278cc6f3ab18a4f0df1f4ac",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28833.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "3045e82524ebcf5ac402e50609708476eb9b69656329cfbeee0808515bde16e8",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.290653+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28780.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "c2cdf65f5782bd43858e6f67eacfd2d2905d4c746a83c68ae0c98df3e2c56bb9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28276.field.ai",
+      "target_kind": "edge",
+      "target_sha256": "c836745b9325a50b496305c349d0c62bc1ba72d55dad0aa2e7080a15298b3298",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-28185.concept.nist.markovchain",
+      "target_kind": "edge",
+      "target_sha256": "7247de10d649c29f02f8ba3dde98a69cd50cfff569a853bd1ef15d731462b9ce",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-26209.concept.eia.energy-consumption",
+      "target_kind": "edge",
+      "target_sha256": "012e7154904336a6c812f26df174dc238d94d3066cd6956c2f0c2feee7270335",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-25526.field.mesh.d011057",
+      "target_kind": "edge",
+      "target_sha256": "13a7308d44eadbdc71d6c1e5dc8e0743fd361d0ae6a4427b66dfa0f943ed067d",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-25081.concept.mesh.d006803",
+      "target_kind": "edge",
+      "target_sha256": "2a847c4fe8b507efbb8886852a3a06a1e6e969b5cdb4f86574220edb358d3098",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-24423.concept.eia.electric-vehicle-ev",
+      "target_kind": "edge",
+      "target_sha256": "4a89f727fd4a08a7a0096bd759f8a736a467bf34d4e34d11f3a741a599dab7f9",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-24360.concept.mesh.d000067656",
+      "target_kind": "edge",
+      "target_sha256": "d5991652168ebd297d5d091f5fc17f526800adbd9595875bca77a6f47a96a411",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.291650+00:00"
+    },
+    {
+      "assertion_id": "assertion.edge.claim.frontier.arxiv-2607-22049.concept.mesh.d007391",
+      "target_kind": "edge",
+      "target_sha256": "a351ec73293102ed74aaf3671a0cb241b2da6599ee54758b449e66e6d4ecf8a4",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
+    },
+    {
+      "assertion_id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic",
+      "target_kind": "taxonomy",
+      "target_sha256": "b6ab60ec7d1556ff04676c0184bcc18437e404635016be97498097e9b0c6c738",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
+    },
+    {
+      "assertion_id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite",
+      "target_kind": "taxonomy",
+      "target_sha256": "7256abd61eb75435360413241497b4f6393c4cd36bb27da608dd4d0a0758bf93",
+      "outcome": "supported",
+      "rationale": "Every support quote is verbatim in its retained captured source at the stated offsets, and no cited source is a bot-check or access-wall page.",
+      "limitations": "Deterministic provenance check only: certifies quotation and source integrity, not entailment, scope, strengthening, direction or representation.",
+      "checks": {
+        "exact_quote_verbatim": true,
+        "source_not_botcheck": true
+      },
+      "candidate_sha256": "064042cb32c29037c271a5c447cf55ac90fb925128c2e9a458b1411a89b61355",
+      "reviewer_id": "code:nemesis-provenance/1",
+      "model": "nemesis-provenance/1 (deterministic code check, no model)",
+      "context_sha256": "a601b694a6c97217b6c5f3613c125ec7f0cb208672843ab19ac9a6cd3a4231f8",
+      "role": "provenance",
+      "reviewed_at": "2026-10-18T18:18:51.292647+00:00"
+    }
+  ]
+}
diff --git a/research/fog-of-knowledge/nemesis/applied.jsonl b/research/fog-of-knowledge/nemesis/applied.jsonl
index ac8be8d7d..33fb05890 100644
--- a/research/fog-of-knowledge/nemesis/applied.jsonl
+++ b/research/fog-of-knowledge/nemesis/applied.jsonl
@@ -54,3 +54,4 @@
 {"protocol":"fog-nemesis-ledger/1","batch_id":"nemesis-frontier-epmc-20261018-r1","applied_at":"2026-10-18T23:22:08.615716+00:00","agent":"nemesis-direct-author","mission":"Add recent public research results (2026-04-18 to 2026-10-18) as frontier public-result nodes linked to the existing concepts they name","counts":{"nodes":330,"edges":330,"reviews":0}}
 {"protocol":"fog-nemesis-ledger/1","batch_id":"nemesis-frontier-arxiv-a-20261018-r1","applied_at":"2026-10-19T03:01:31.908208+00:00","agent":"nemesis-direct-author","mission":"Add recent public research results (2026-04-18 to 2026-10-18) as frontier public-result nodes linked to the existing concepts they name","counts":{"nodes":215,"edges":214,"reviews":0}}
 {"protocol":"fog-nemesis-ledger/1","batch_id":"nemesis-frontier-crossref-20261018-r1","applied_at":"2026-10-19T05:39:05.209245+00:00","agent":"nemesis-direct-author","mission":"Add recent public research results (2026-04-18 to 2026-10-18) as frontier public-result nodes linked to the existing concepts they name","counts":{"nodes":174,"edges":174,"reviews":0}}
+{"protocol":"fog-nemesis-ledger/1","batch_id":"nemesis-frontier-arxiv-b-20261018-r1","applied_at":"2026-10-19T09:45:02.458430+00:00","agent":"nemesis-direct-author","mission":"Add recent public research results (2026-04-18 to 2026-10-18) as frontier public-result nodes linked to the existing concepts they name","counts":{"nodes":120,"edges":118,"reviews":0}}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/assertions.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/assertions.jsonl
new file mode 100644
index 000000000..ecdca0895
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/assertions.jsonl
@@ -0,0 +1,240 @@
+{"id": "assertion.claim.frontier.arxiv-2610-21653", "target_kind": "node", "target_sha256": "d10e242f57d4e8911cbb6626598c479b5d9fb04da16b40c1d106c5afd59a72d9", "canonical_record": {"id": "claim.frontier.arxiv-2610-21653", "label": "How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-21653", "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"}, {"id": "arxiv:2610.21653", "title": "arXiv:2610.21653", "url": "https://arxiv.org/abs/2610.21653"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-15", "source_ids": ["source.frontier.arxiv-2610-21653"]}}, "statement": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "scope": {"population": "The study reported in arXiv:2610.21653", "time": "2026-10-15", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-21653", "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "start": 2482, "end": 2833, "quote": "In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control."}, {"source_id": "source.frontier.arxiv-2610-21653", "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "start": 1048, "end": 1077, "quote": "<created>2026-10-15</created>"}, {"source_id": "source.frontier.arxiv-2610-21653", "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "start": 2079, "end": 2141, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-19722", "target_kind": "node", "target_sha256": "a8dd47064ed088694cb7ee9d06a2648af1e7b0d1fbe824decab526d1ca8f81a9", "canonical_record": {"id": "claim.frontier.arxiv-2610-19722", "label": "ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19722", "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19722", "title": "arXiv:2610.19722", "url": "https://arxiv.org/abs/2610.19722"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-14", "source_ids": ["source.frontier.arxiv-2610-19722"]}}, "statement": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"", "scope": {"population": "The study reported in arXiv:2610.19722", "time": "2026-10-14", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-19722", "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "start": 3012, "end": 3276, "quote": "Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification."}, {"source_id": "source.frontier.arxiv-2610-19722", "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "start": 1044, "end": 1073, "quote": "<created>2026-10-14</created>"}, {"source_id": "source.frontier.arxiv-2610-19722", "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "start": 1763, "end": 1825, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-19515", "target_kind": "node", "target_sha256": "bc36f7c70ac332a0c225156aca2db0261613a4c3ebe26917c84bbe0d333ade50", "canonical_record": {"id": "claim.frontier.arxiv-2610-19515", "label": "Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19515", "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19515", "title": "arXiv:2610.19515", "url": "https://arxiv.org/abs/2610.19515"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-14", "source_ids": ["source.frontier.arxiv-2610-19515"]}}, "statement": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"", "scope": {"population": "The study reported in arXiv:2610.19515", "time": "2026-10-14", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-19515", "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "start": 3158, "end": 3283, "quote": "Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability."}, {"source_id": "source.frontier.arxiv-2610-19515", "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "start": 1004, "end": 1033, "quote": "<created>2026-10-14</created>"}, {"source_id": "source.frontier.arxiv-2610-19515", "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "start": 2070, "end": 2132, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-19137", "target_kind": "node", "target_sha256": "09401a3ea268f6e991bb1235be758edaaf9a7fedc97c1f65562d42e1ff71dba4", "canonical_record": {"id": "claim.frontier.arxiv-2610-19137", "label": "Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19137", "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19137", "title": "arXiv:2610.19137", "url": "https://arxiv.org/abs/2610.19137"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-13", "source_ids": ["source.frontier.arxiv-2610-19137"]}}, "statement": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"", "scope": {"population": "The study reported in arXiv:2610.19137", "time": "2026-10-13", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-19137", "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "start": 2510, "end": 2673, "quote": "Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned."}, {"source_id": "source.frontier.arxiv-2610-19137", "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "start": 964, "end": 993, "quote": "<created>2026-10-13</created>"}, {"source_id": "source.frontier.arxiv-2610-19137", "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "start": 2024, "end": 2086, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-17295", "target_kind": "node", "target_sha256": "258d145622ca057cff6f93b00ad958c34febb57b99ce8bf0ce7bdff897f7d141", "canonical_record": {"id": "claim.frontier.arxiv-2610-17295", "label": "Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-17295", "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"}, {"id": "arxiv:2610.17295", "title": "arXiv:2610.17295", "url": "https://arxiv.org/abs/2610.17295"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-17295"]}}, "statement": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"", "scope": {"population": "The study reported in arXiv:2610.17295", "time": "2026-10-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-17295", "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "start": 3067, "end": 3370, "quote": "Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings."}, {"source_id": "source.frontier.arxiv-2610-17295", "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "start": 1004, "end": 1033, "quote": "<created>2026-10-12</created>"}, {"source_id": "source.frontier.arxiv-2610-17295", "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "start": 2279, "end": 2341, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-16273", "target_kind": "node", "target_sha256": "abec13a7138c2ba0031c3c27d7bf86d76d14145eaf07fe0459c331a693ca2367", "canonical_record": {"id": "claim.frontier.arxiv-2610-16273", "label": "Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-16273", "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"}, {"id": "arxiv:2610.16273", "title": "arXiv:2610.16273", "url": "https://arxiv.org/abs/2610.16273"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-16273"]}}, "statement": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "scope": {"population": "The study reported in arXiv:2610.16273", "time": "2026-10-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-16273", "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "start": 2282, "end": 2750, "quote": "Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised."}, {"source_id": "source.frontier.arxiv-2610-16273", "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "start": 1044, "end": 1073, "quote": "<created>2026-10-12</created>"}, {"source_id": "source.frontier.arxiv-2610-16273", "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "start": 1841, "end": 1903, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-16259", "target_kind": "node", "target_sha256": "49058552123e75c929a955f283eca0a07258c3e78ac13caca148d8134b204663", "canonical_record": {"id": "claim.frontier.arxiv-2610-16259", "label": "Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-16259", "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"}, {"id": "arxiv:2610.16259", "title": "arXiv:2610.16259", "url": "https://arxiv.org/abs/2610.16259"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-16259"]}}, "statement": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"", "scope": {"population": "The study reported in arXiv:2610.16259", "time": "2026-10-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-16259", "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "start": 2552, "end": 2688, "quote": "The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states."}, {"source_id": "source.frontier.arxiv-2610-16259", "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "start": 964, "end": 993, "quote": "<created>2026-10-12</created>"}, {"source_id": "source.frontier.arxiv-2610-16259", "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "start": 1870, "end": 1938, "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-15934", "target_kind": "node", "target_sha256": "db269a5e349cef256a5d35a3cc98311c81e5233fbb732f72a56f62b5d01bfd00", "canonical_record": {"id": "claim.frontier.arxiv-2610-15934", "label": "Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15934", "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15934", "title": "arXiv:2610.15934", "url": "https://arxiv.org/abs/2610.15934"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-11", "source_ids": ["source.frontier.arxiv-2610-15934"]}}, "statement": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"", "scope": {"population": "The study reported in arXiv:2610.15934", "time": "2026-10-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-15934", "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "start": 2614, "end": 2854, "quote": "We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective."}, {"source_id": "source.frontier.arxiv-2610-15934", "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "start": 1044, "end": 1073, "quote": "<created>2026-10-11</created>"}, {"source_id": "source.frontier.arxiv-2610-15934", "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "start": 1682, "end": 1744, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-15072", "target_kind": "node", "target_sha256": "2202e4fba0fef0adbfffb5263a7bc935d004b4ed16d72bdb11fb868e0884f957", "canonical_record": {"id": "claim.frontier.arxiv-2610-15072", "label": "UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15072", "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15072", "title": "arXiv:2610.15072", "url": "https://arxiv.org/abs/2610.15072"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-10", "source_ids": ["source.frontier.arxiv-2610-15072"]}}, "statement": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"", "scope": {"population": "The study reported in arXiv:2610.15072", "time": "2026-10-10", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-15072", "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "start": 3330, "end": 3498, "quote": "We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels."}, {"source_id": "source.frontier.arxiv-2610-15072", "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "start": 1128, "end": 1157, "quote": "<created>2026-10-10</created>"}, {"source_id": "source.frontier.arxiv-2610-15072", "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "start": 2360, "end": 2422, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-15052", "target_kind": "node", "target_sha256": "0e3a409e37368e61d1934fb7914817e87920ade4bb52f91410543bd22aa7049e", "canonical_record": {"id": "claim.frontier.arxiv-2610-15052", "label": "On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15052", "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15052", "title": "arXiv:2610.15052", "url": "https://arxiv.org/abs/2610.15052"}, {"id": "doi:10.1109/rusautocon69876.2026.11707364", "title": "doi:10.1109/rusautocon69876.2026.11707364", "url": "https://doi.org/10.1109/rusautocon69876.2026.11707364"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-10", "source_ids": ["source.frontier.arxiv-2610-15052"]}}, "statement": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"", "scope": {"population": "The study reported in arXiv:2610.15052", "time": "2026-10-10", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-15052", "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "start": 2427, "end": 2572, "quote": "By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster."}, {"source_id": "source.frontier.arxiv-2610-15052", "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "start": 1004, "end": 1033, "quote": "<created>2026-10-10</created>"}, {"source_id": "source.frontier.arxiv-2610-15052", "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "start": 1508, "end": 1570, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-13424", "target_kind": "node", "target_sha256": "7fd68d524cf3d375403bd0389a9102fcd5b849bc87b65345f29ff6b9520bbcf8", "canonical_record": {"id": "claim.frontier.arxiv-2610-13424", "label": "Minimum-Energy Control for Stochastic Linear Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-13424", "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"}, {"id": "arxiv:2610.13424", "title": "arXiv:2610.13424", "url": "https://arxiv.org/abs/2610.13424"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-09", "source_ids": ["source.frontier.arxiv-2610-13424"]}}, "statement": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "scope": {"population": "The study reported in arXiv:2610.13424", "time": "2026-10-09", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-13424", "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "start": 2131, "end": 2322, "quote": "We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices."}, {"source_id": "source.frontier.arxiv-2610-13424", "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "start": 1048, "end": 1077, "quote": "<created>2026-10-09</created>"}, {"source_id": "source.frontier.arxiv-2610-13424", "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "start": 1610, "end": 1672, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-13402", "target_kind": "node", "target_sha256": "e285ae55ff03e8b9e1b4ca3e9b041f363f37f4f7dcf5a5393adb43323c720b49", "canonical_record": {"id": "claim.frontier.arxiv-2610-13402", "label": "Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-13402", "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"}, {"id": "arxiv:2610.13402", "title": "arXiv:2610.13402", "url": "https://arxiv.org/abs/2610.13402"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-09", "source_ids": ["source.frontier.arxiv-2610-13402"]}}, "statement": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"", "scope": {"population": "The study reported in arXiv:2610.13402", "time": "2026-10-09", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-13402", "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "start": 2666, "end": 2808, "quote": "Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array."}, {"source_id": "source.frontier.arxiv-2610-13402", "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "start": 1048, "end": 1077, "quote": "<created>2026-10-09</created>"}, {"source_id": "source.frontier.arxiv-2610-13402", "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "start": 1923, "end": 1985, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-12779", "target_kind": "node", "target_sha256": "0a200f89117c4ea885fb92d9afa96d2e7d7d182295a3692c61b89e36f100518d", "canonical_record": {"id": "claim.frontier.arxiv-2610-12779", "label": "Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12779", "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12779", "title": "arXiv:2610.12779", "url": "https://arxiv.org/abs/2610.12779"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12779"]}}, "statement": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "scope": {"population": "The study reported in arXiv:2610.12779", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-12779", "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "start": 2510, "end": 2854, "quote": "We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes."}, {"source_id": "source.frontier.arxiv-2610-12779", "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "start": 1044, "end": 1073, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-12779", "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "start": 1545, "end": 1607, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-12604", "target_kind": "node", "target_sha256": "6dcaef89852aeb2edfb2adc04ae2c4909e6411ad977b12fa8f8ec8c436befca5", "canonical_record": {"id": "claim.frontier.arxiv-2610-12604", "label": "Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12604", "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12604", "title": "arXiv:2610.12604", "url": "https://arxiv.org/abs/2610.12604"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12604"]}}, "statement": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "scope": {"population": "The study reported in arXiv:2610.12604", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-12604", "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "start": 2287, "end": 2368, "quote": "Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture."}, {"source_id": "source.frontier.arxiv-2610-12604", "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "start": 964, "end": 993, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-12604", "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "start": 1709, "end": 1777, "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-12592", "target_kind": "node", "target_sha256": "8380fa2096717d776a89ef4c3ad492c5fed1d514dae0765acccecf4507522cd3", "canonical_record": {"id": "claim.frontier.arxiv-2610-12592", "label": "Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12592", "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12592", "title": "arXiv:2610.12592", "url": "https://arxiv.org/abs/2610.12592"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12592"]}}, "statement": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"", "scope": {"population": "The study reported in arXiv:2610.12592", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-12592", "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "start": 3102, "end": 3239, "quote": "The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel."}, {"source_id": "source.frontier.arxiv-2610-12592", "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "start": 964, "end": 993, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-12592", "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "start": 2021, "end": 2089, "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-12038", "target_kind": "node", "target_sha256": "ec13f9f86b5c1bc03a718e7b995a3a59562425a615d9fa13d6020ef08ccfcab7", "canonical_record": {"id": "claim.frontier.arxiv-2610-12038", "label": "Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12038", "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12038", "title": "arXiv:2610.12038", "url": "https://arxiv.org/abs/2610.12038"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12038"]}}, "statement": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"", "scope": {"population": "The study reported in arXiv:2610.12038", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-12038", "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "start": 2437, "end": 2617, "quote": "We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level."}, {"source_id": "source.frontier.arxiv-2610-12038", "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "start": 964, "end": 993, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-12038", "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "start": 1774, "end": 1836, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-11869", "target_kind": "node", "target_sha256": "104824c9bc6d60ddd5a41780eb1897630158af4f1439f0be39b07494895010f7", "canonical_record": {"id": "claim.frontier.arxiv-2610-11869", "label": "Learning structured linear dynamical systems from missing observations", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-11869", "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"}, {"id": "arxiv:2610.11869", "title": "arXiv:2610.11869", "url": "https://arxiv.org/abs/2610.11869"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-11869"]}}, "statement": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"", "scope": {"population": "The study reported in arXiv:2610.11869", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-11869", "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "start": 2919, "end": 3083, "quote": "We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$."}, {"source_id": "source.frontier.arxiv-2610-11869", "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "start": 1220, "end": 1249, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-11869", "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "start": 2051, "end": 2113, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-11359", "target_kind": "node", "target_sha256": "ef2bb7a5097b6ae986fc47841ce396d2c9fbe30195e3e73a5fec64050fafdee9", "canonical_record": {"id": "claim.frontier.arxiv-2610-11359", "label": "Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-11359", "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"}, {"id": "arxiv:2610.11359", "title": "arXiv:2610.11359", "url": "https://arxiv.org/abs/2610.11359"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-11359"]}}, "statement": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"", "scope": {"population": "The study reported in arXiv:2610.11359", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-11359", "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "start": 3094, "end": 3264, "quote": "The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods."}, {"source_id": "source.frontier.arxiv-2610-11359", "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "start": 964, "end": 993, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-11359", "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "start": 1957, "end": 2019, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04959", "target_kind": "node", "target_sha256": "60803abde49981b3e9b515f13c3ec84a0dd2b7a33767e4841de7fa7eb61e4153", "canonical_record": {"id": "claim.frontier.arxiv-2610-04959", "label": "AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04959", "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04959", "title": "arXiv:2610.04959", "url": "https://arxiv.org/abs/2610.04959"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-04959"]}}, "statement": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"", "scope": {"population": "The study reported in arXiv:2610.04959", "time": "2026-10-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04959", "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "start": 4051, "end": 4313, "quote": "Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery."}, {"source_id": "source.frontier.arxiv-2610-04959", "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "start": 1006, "end": 1035, "quote": "<created>2026-10-08</created>"}, {"source_id": "source.frontier.arxiv-2610-04959", "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "start": 2482, "end": 2544, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-09266", "target_kind": "node", "target_sha256": "fdd9b401372df0dbb49a1d2bf4e09b6e34a692866c08d6774d7fb696ee261765", "canonical_record": {"id": "claim.frontier.arxiv-2610-09266", "label": "Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09266", "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09266", "title": "arXiv:2610.09266", "url": "https://arxiv.org/abs/2610.09266"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-07", "source_ids": ["source.frontier.arxiv-2610-09266"]}}, "statement": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "scope": {"population": "The study reported in arXiv:2610.09266", "time": "2026-10-07", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-09266", "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "start": 3311, "end": 3543, "quote": "Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%."}, {"source_id": "source.frontier.arxiv-2610-09266", "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "start": 1004, "end": 1033, "quote": "<created>2026-10-07</created>"}, {"source_id": "source.frontier.arxiv-2610-09266", "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "start": 1912, "end": 1974, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-09080", "target_kind": "node", "target_sha256": "0c3a9ae37aecef4ef7a9939bb97f945686dce9d6fe36f0350d4fb9fcc35badb5", "canonical_record": {"id": "claim.frontier.arxiv-2610-09080", "label": "User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09080", "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09080", "title": "arXiv:2610.09080", "url": "https://arxiv.org/abs/2610.09080"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-09080"]}}, "statement": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"", "scope": {"population": "The study reported in arXiv:2610.09080", "time": "2026-10-06", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-09080", "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "start": 2657, "end": 2912, "quote": "Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN."}, {"source_id": "source.frontier.arxiv-2610-09080", "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "start": 964, "end": 993, "quote": "<created>2026-10-06</created>"}, {"source_id": "source.frontier.arxiv-2610-09080", "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "start": 1684, "end": 1746, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-09010", "target_kind": "node", "target_sha256": "c01171a7378737c5492419b63a6668029115d5d11b8913c81e55b38fab25e949", "canonical_record": {"id": "claim.frontier.arxiv-2610-09010", "label": "Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09010", "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09010", "title": "arXiv:2610.09010", "url": "https://arxiv.org/abs/2610.09010"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-09010"]}}, "statement": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"", "scope": {"population": "The study reported in arXiv:2610.09010", "time": "2026-10-06", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-09010", "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "start": 3388, "end": 3580, "quote": "Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate."}, {"source_id": "source.frontier.arxiv-2610-09010", "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "start": 964, "end": 993, "quote": "<created>2026-10-06</created>"}, {"source_id": "source.frontier.arxiv-2610-09010", "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "start": 1682, "end": 1744, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-08744", "target_kind": "node", "target_sha256": "d94b8ceb803f23d37998dc793883f64d4110c56a071339d7f27d629ce51cd53a", "canonical_record": {"id": "claim.frontier.arxiv-2610-08744", "label": "RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-08744", "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"}, {"id": "arxiv:2610.08744", "title": "arXiv:2610.08744", "url": "https://arxiv.org/abs/2610.08744"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-08744"]}}, "statement": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "scope": {"population": "The study reported in arXiv:2610.08744", "time": "2026-10-06", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-08744", "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "start": 2897, "end": 3062, "quote": "Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme."}, {"source_id": "source.frontier.arxiv-2610-08744", "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "start": 964, "end": 993, "quote": "<created>2026-10-06</created>"}, {"source_id": "source.frontier.arxiv-2610-08744", "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "start": 1686, "end": 1748, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-07616", "target_kind": "node", "target_sha256": "d6f577c6e767b6a3d5dff779e57b0cec93ec5198c9c36efaaf2dbeb35c1ae950", "canonical_record": {"id": "claim.frontier.arxiv-2610-07616", "label": "Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-07616", "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"}, {"id": "arxiv:2610.07616", "title": "arXiv:2610.07616", "url": "https://arxiv.org/abs/2610.07616"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-07616"]}}, "statement": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "scope": {"population": "The study reported in arXiv:2610.07616", "time": "2026-10-06", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-07616", "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "start": 2055, "end": 2165, "quote": "Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets."}, {"source_id": "source.frontier.arxiv-2610-07616", "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "start": 1044, "end": 1073, "quote": "<created>2026-10-06</created>"}, {"source_id": "source.frontier.arxiv-2610-07616", "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "start": 1555, "end": 1617, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-07307", "target_kind": "node", "target_sha256": "e717ce32d00a85ef8fa8159b789a4cdbe0f6b9a395412689002cb57f96b7c736", "canonical_record": {"id": "claim.frontier.arxiv-2610-07307", "label": "Metric-Based Equilibrium Selection in Noncooperative Differentiable Games", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-07307", "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"}, {"id": "arxiv:2610.07307", "title": "arXiv:2610.07307", "url": "https://arxiv.org/abs/2610.07307"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-05", "source_ids": ["source.frontier.arxiv-2610-07307"]}}, "statement": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"", "scope": {"population": "The study reported in arXiv:2610.07307", "time": "2026-10-05", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-07307", "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "start": 2947, "end": 3029, "quote": "We also derive a step-size condition for implementing the method in discrete time."}, {"source_id": "source.frontier.arxiv-2610-07307", "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "start": 1044, "end": 1073, "quote": "<created>2026-10-05</created>"}, {"source_id": "source.frontier.arxiv-2610-07307", "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "start": 1979, "end": 2041, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-06601", "target_kind": "node", "target_sha256": "e08ebb0c4834db59eeadb6300fd9ea46ee16d77838acbe39e48dff4b98eeb018", "canonical_record": {"id": "claim.frontier.arxiv-2610-06601", "label": "Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-06601", "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"}, {"id": "arxiv:2610.06601", "title": "arXiv:2610.06601", "url": "https://arxiv.org/abs/2610.06601"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-05", "source_ids": ["source.frontier.arxiv-2610-06601"]}}, "statement": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"", "scope": {"population": "The study reported in arXiv:2610.06601", "time": "2026-10-05", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-06601", "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "start": 3235, "end": 3598, "quote": "Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems."}, {"source_id": "source.frontier.arxiv-2610-06601", "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "start": 1004, "end": 1033, "quote": "<created>2026-10-05</created>"}, {"source_id": "source.frontier.arxiv-2610-06601", "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "start": 1877, "end": 1939, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04776", "target_kind": "node", "target_sha256": "51232f01e536c301d3c9507922fd51d0207c8f39dc571ceff9df1974cca740c2", "canonical_record": {"id": "claim.frontier.arxiv-2610-04776", "label": "Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04776", "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04776", "title": "arXiv:2610.04776", "url": "https://arxiv.org/abs/2610.04776"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04776"]}}, "statement": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "scope": {"population": "The study reported in arXiv:2610.04776", "time": "2026-10-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04776", "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "start": 3268, "end": 3505, "quote": "Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search."}, {"source_id": "source.frontier.arxiv-2610-04776", "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "start": 1172, "end": 1201, "quote": "<created>2026-10-03</created>"}, {"source_id": "source.frontier.arxiv-2610-04776", "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "start": 2177, "end": 2239, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04697", "target_kind": "node", "target_sha256": "ba68b962702ca2a36672b8439d35ccfa89a80b48aeef8b95aed892c80911b788", "canonical_record": {"id": "claim.frontier.arxiv-2610-04697", "label": "Efficiency and robustness partition the solution space for memory in recurrent networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04697", "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04697", "title": "arXiv:2610.04697", "url": "https://arxiv.org/abs/2610.04697"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04697"]}}, "statement": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"", "scope": {"population": "The study reported in arXiv:2610.04697", "time": "2026-10-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04697", "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "start": 2238, "end": 2526, "quote": "We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification."}, {"source_id": "source.frontier.arxiv-2610-04697", "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "start": 966, "end": 995, "quote": "<created>2026-10-03</created>"}, {"source_id": "source.frontier.arxiv-2610-04697", "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "start": 1547, "end": 1609, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04662", "target_kind": "node", "target_sha256": "1197384dd2bdaeaa27e6a1e2d3d7a19447d2b4c296430bce44eb7b8692631fb3", "canonical_record": {"id": "claim.frontier.arxiv-2610-04662", "label": "Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04662", "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04662", "title": "arXiv:2610.04662", "url": "https://arxiv.org/abs/2610.04662"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04662"]}}, "statement": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"", "scope": {"population": "The study reported in arXiv:2610.04662", "time": "2026-10-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04662", "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "start": 3237, "end": 3488, "quote": "We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution."}, {"source_id": "source.frontier.arxiv-2610-04662", "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "start": 1044, "end": 1073, "quote": "<created>2026-10-03</created>"}, {"source_id": "source.frontier.arxiv-2610-04662", "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "start": 1985, "end": 2047, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04630", "target_kind": "node", "target_sha256": "55024c472b37b3c38ae899c1bfe3976e3d6a17e3bce51137a4015acebeba897a", "canonical_record": {"id": "claim.frontier.arxiv-2610-04630", "label": "Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04630", "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04630", "title": "arXiv:2610.04630", "url": "https://arxiv.org/abs/2610.04630"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04630"]}}, "statement": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"", "scope": {"population": "The study reported in arXiv:2610.04630", "time": "2026-10-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04630", "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "start": 3708, "end": 3940, "quote": "Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics."}, {"source_id": "source.frontier.arxiv-2610-04630", "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "start": 964, "end": 993, "quote": "<created>2026-10-03</created>"}, {"source_id": "source.frontier.arxiv-2610-04630", "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "start": 1965, "end": 2027, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-04242", "target_kind": "node", "target_sha256": "a9a0ffb810b154d47ba126e2ae200c97999c6308914a1190664cddc15f0e5acb", "canonical_record": {"id": "claim.frontier.arxiv-2610-04242", "label": "Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04242", "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04242", "title": "arXiv:2610.04242", "url": "https://arxiv.org/abs/2610.04242"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04242"]}}, "statement": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"", "scope": {"population": "The study reported in arXiv:2610.04242", "time": "2026-10-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-04242", "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "start": 2726, "end": 2942, "quote": "We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis."}, {"source_id": "source.frontier.arxiv-2610-04242", "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "start": 1004, "end": 1033, "quote": "<created>2026-10-03</created>"}, {"source_id": "source.frontier.arxiv-2610-04242", "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "start": 2070, "end": 2132, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-06918", "target_kind": "node", "target_sha256": "8264a8cd0ed245884f4313ac000543134882ef2c91953504f5ca8c09b00c19c5", "canonical_record": {"id": "claim.frontier.arxiv-2610-06918", "label": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-06918", "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"}, {"id": "arxiv:2610.06918", "title": "arXiv:2610.06918", "url": "https://arxiv.org/abs/2610.06918"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-06918"]}}, "statement": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"", "scope": {"population": "The study reported in arXiv:2610.06918", "time": "2026-10-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-06918", "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "start": 2363, "end": 2562, "quote": "We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption."}, {"source_id": "source.frontier.arxiv-2610-06918", "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "start": 1044, "end": 1073, "quote": "<created>2026-10-02</created>"}, {"source_id": "source.frontier.arxiv-2610-06918", "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "start": 1628, "end": 1690, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-03964", "target_kind": "node", "target_sha256": "db85dd871996d11690e4d572551d14de38bf3210d3196fecc9ae0da5eb44ddd8", "canonical_record": {"id": "claim.frontier.arxiv-2610-03964", "label": "Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-03964", "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"}, {"id": "arxiv:2610.03964", "title": "arXiv:2610.03964", "url": "https://arxiv.org/abs/2610.03964"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-03964"]}}, "statement": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"", "scope": {"population": "The study reported in arXiv:2610.03964", "time": "2026-10-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-03964", "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "start": 3120, "end": 3263, "quote": "Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks."}, {"source_id": "source.frontier.arxiv-2610-03964", "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "start": 1004, "end": 1033, "quote": "<created>2026-10-02</created>"}, {"source_id": "source.frontier.arxiv-2610-03964", "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "start": 1968, "end": 2030, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2610-03008", "target_kind": "node", "target_sha256": "82399c21be648fb96cb4a208fbf66536ea122a2350cb2dcdc8b0860c695b5db4", "canonical_record": {"id": "claim.frontier.arxiv-2610-03008", "label": "Response Variability and Stability in Human Reasoning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-03008", "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"}, {"id": "arxiv:2610.03008", "title": "arXiv:2610.03008", "url": "https://arxiv.org/abs/2610.03008"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-03008"]}}, "statement": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"", "scope": {"population": "The study reported in arXiv:2610.03008", "time": "2026-10-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2610-03008", "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "start": 2639, "end": 2864, "quote": "The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains."}, {"source_id": "source.frontier.arxiv-2610-03008", "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "start": 1046, "end": 1075, "quote": "<created>2026-10-02</created>"}, {"source_id": "source.frontier.arxiv-2610-03008", "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "start": 2061, "end": 2123, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-39776", "target_kind": "node", "target_sha256": "6ecd150266bfd4751ab0c41ef9a2daa5502de52896dba3cd913c50f3047a175b", "canonical_record": {"id": "claim.frontier.arxiv-2609-39776", "label": "Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-39776", "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"}, {"id": "arxiv:2609.39776", "title": "arXiv:2609.39776", "url": "https://arxiv.org/abs/2609.39776"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-30", "source_ids": ["source.frontier.arxiv-2609-39776"]}}, "statement": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"", "scope": {"population": "The study reported in arXiv:2609.39776", "time": "2026-09-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-39776", "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "start": 3297, "end": 3439, "quote": "Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones."}, {"source_id": "source.frontier.arxiv-2609-39776", "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "start": 1088, "end": 1117, "quote": "<created>2026-09-30</created>"}, {"source_id": "source.frontier.arxiv-2609-39776", "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "start": 2161, "end": 2223, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-21813", "target_kind": "node", "target_sha256": "701c399df4bf5ba66633b67a1c373086e8b2ccb139fac358011ef3d905dd3e37", "canonical_record": {"id": "claim.frontier.arxiv-2609-21813", "label": "How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21813", "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21813", "title": "arXiv:2609.21813", "url": "https://arxiv.org/abs/2609.21813"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-30", "source_ids": ["source.frontier.arxiv-2609-21813"]}}, "statement": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"", "scope": {"population": "The study reported in arXiv:2609.21813", "time": "2026-09-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-21813", "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "start": 2229, "end": 2393, "quote": "We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time."}, {"source_id": "source.frontier.arxiv-2609-21813", "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "start": 1048, "end": 1077, "quote": "<created>2026-09-30</created>"}, {"source_id": "source.frontier.arxiv-2609-21813", "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "start": 1624, "end": 1686, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-36354", "target_kind": "node", "target_sha256": "ba2ba64d0bba4952934bb82ab0a6eec38988f094b32a07557fd48b32ddcd515f", "canonical_record": {"id": "claim.frontier.arxiv-2609-36354", "label": "Explainability from Training with Applications to TCR-Epitope Prediction", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-36354", "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"}, {"id": "arxiv:2609.36354", "title": "arXiv:2609.36354", "url": "https://arxiv.org/abs/2609.36354"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-36354"]}}, "statement": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"", "scope": {"population": "The study reported in arXiv:2609.36354", "time": "2026-09-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-36354", "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "start": 3238, "end": 3686, "quote": "Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty."}, {"source_id": "source.frontier.arxiv-2609-36354", "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "start": 1086, "end": 1115, "quote": "<created>2026-09-28</created>"}, {"source_id": "source.frontier.arxiv-2609-36354", "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "start": 2118, "end": 2180, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-35424", "target_kind": "node", "target_sha256": "dae5b28a82fd4127b8cfa1a390f0d58fc4a3915961ee8a83656d2511f46f86a8", "canonical_record": {"id": "claim.frontier.arxiv-2609-35424", "label": "Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-35424", "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"}, {"id": "arxiv:2609.35424", "title": "arXiv:2609.35424", "url": "https://arxiv.org/abs/2609.35424"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-35424"]}}, "statement": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"", "scope": {"population": "The study reported in arXiv:2609.35424", "time": "2026-09-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-35424", "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "start": 2767, "end": 3063, "quote": "It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition."}, {"source_id": "source.frontier.arxiv-2609-35424", "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "start": 1004, "end": 1033, "quote": "<created>2026-09-28</created>"}, {"source_id": "source.frontier.arxiv-2609-35424", "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "start": 1905, "end": 1967, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-35246", "target_kind": "node", "target_sha256": "4c04841c92f6f2515c5aa9702bcfa24b0ae6a83779590a3c32cfa9518565faf6", "canonical_record": {"id": "claim.frontier.arxiv-2609-35246", "label": "Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-35246", "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"}, {"id": "arxiv:2609.35246", "title": "arXiv:2609.35246", "url": "https://arxiv.org/abs/2609.35246"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-35246"]}}, "statement": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"", "scope": {"population": "The study reported in arXiv:2609.35246", "time": "2026-09-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-35246", "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "start": 3694, "end": 4010, "quote": "Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios."}, {"source_id": "source.frontier.arxiv-2609-35246", "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "start": 1004, "end": 1033, "quote": "<created>2026-09-28</created>"}, {"source_id": "source.frontier.arxiv-2609-35246", "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "start": 2030, "end": 2092, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-32315", "target_kind": "node", "target_sha256": "3393b4bfa9a7dbb8b378cab5ff0700aac12523f0eda8237fe96df690f99204e0", "canonical_record": {"id": "claim.frontier.arxiv-2609-32315", "label": "From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-32315", "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"}, {"id": "arxiv:2609.32315", "title": "arXiv:2609.32315", "url": "https://arxiv.org/abs/2609.32315"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-26", "source_ids": ["source.frontier.arxiv-2609-32315"]}}, "statement": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"", "scope": {"population": "The study reported in arXiv:2609.32315", "time": "2026-09-26", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-32315", "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "start": 3174, "end": 3300, "quote": "We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes."}, {"source_id": "source.frontier.arxiv-2609-32315", "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "start": 966, "end": 995, "quote": "<created>2026-09-26</created>"}, {"source_id": "source.frontier.arxiv-2609-32315", "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "start": 2153, "end": 2215, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-29972", "target_kind": "node", "target_sha256": "497b2f901d364e26b1b7b7625363b0dc6d2c9c25cd3d406cf9787b1bb0296d0d", "canonical_record": {"id": "claim.frontier.arxiv-2609-29972", "label": "Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy", "kind": "claim", "domain": "health", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-29972", "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"}, {"id": "arxiv:2609.29972", "title": "arXiv:2609.29972", "url": "https://arxiv.org/abs/2609.29972"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-24", "source_ids": ["source.frontier.arxiv-2609-29972"]}}, "statement": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"", "scope": {"population": "The study reported in arXiv:2609.29972", "time": "2026-09-24", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-29972", "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "start": 2123, "end": 2345, "quote": "We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state."}, {"source_id": "source.frontier.arxiv-2609-29972", "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "start": 1066, "end": 1095, "quote": "<created>2026-09-24</created>"}, {"source_id": "source.frontier.arxiv-2609-29972", "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "start": 1695, "end": 1757, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-29832", "target_kind": "node", "target_sha256": "273391aa4a119164f559f1e6a1a3018edf1e24fe952fc25820514f35c726c8d5", "canonical_record": {"id": "claim.frontier.arxiv-2609-29832", "label": "System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-29832", "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"}, {"id": "arxiv:2609.29832", "title": "arXiv:2609.29832", "url": "https://arxiv.org/abs/2609.29832"}, {"id": "doi:10.2514/1.c038636", "title": "doi:10.2514/1.c038636", "url": "https://doi.org/10.2514/1.c038636"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-24", "source_ids": ["source.frontier.arxiv-2609-29832"]}}, "statement": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "scope": {"population": "The study reported in arXiv:2609.29832", "time": "2026-09-24", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-29832", "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "start": 2930, "end": 3075, "quote": "Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately."}, {"source_id": "source.frontier.arxiv-2609-29832", "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "start": 1044, "end": 1073, "quote": "<created>2026-09-24</created>"}, {"source_id": "source.frontier.arxiv-2609-29832", "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "start": 1938, "end": 2006, "quote": "<license>http://creativecommons.org/publicdomain/zero/1.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-28815", "target_kind": "node", "target_sha256": "dbae9cf820fccc9f22815306f186c61c6bf424abe78f92c8149f93288fa29ade", "canonical_record": {"id": "claim.frontier.arxiv-2609-28815", "label": "Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-28815", "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"}, {"id": "arxiv:2609.28815", "title": "arXiv:2609.28815", "url": "https://arxiv.org/abs/2609.28815"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-23", "source_ids": ["source.frontier.arxiv-2609-28815"]}}, "statement": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "scope": {"population": "The study reported in arXiv:2609.28815", "time": "2026-09-23", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-28815", "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "start": 2932, "end": 3156, "quote": "We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty."}, {"source_id": "source.frontier.arxiv-2609-28815", "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "start": 964, "end": 993, "quote": "<created>2026-09-23</created>"}, {"source_id": "source.frontier.arxiv-2609-28815", "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "start": 1669, "end": 1731, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-26924", "target_kind": "node", "target_sha256": "2d9829e5b9835a2a33215722f146f2c3edd09aa838289952022c96436b4d46d8", "canonical_record": {"id": "claim.frontier.arxiv-2609-26924", "label": "nnFoundation: 3D Foundation Models for Radiology", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-26924", "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"}, {"id": "arxiv:2609.26924", "title": "arXiv:2609.26924", "url": "https://arxiv.org/abs/2609.26924"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-26924"]}}, "statement": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"", "scope": {"population": "The study reported in arXiv:2609.26924", "time": "2026-09-22", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-26924", "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "start": 14927, "end": 15159, "quote": "Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging."}, {"source_id": "source.frontier.arxiv-2609-26924", "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "start": 1004, "end": 1033, "quote": "<created>2026-09-22</created>"}, {"source_id": "source.frontier.arxiv-2609-26924", "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "start": 13953, "end": 14015, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-25847", "target_kind": "node", "target_sha256": "566241ea9065d5143c4a5829ca9dc1676bd4ada68203d32244bc0b8944f6905b", "canonical_record": {"id": "claim.frontier.arxiv-2609-25847", "label": "Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25847", "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25847", "title": "arXiv:2609.25847", "url": "https://arxiv.org/abs/2609.25847"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-25847"]}}, "statement": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"", "scope": {"population": "The study reported in arXiv:2609.25847", "time": "2026-09-22", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-25847", "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "start": 2853, "end": 3070, "quote": "The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters."}, {"source_id": "source.frontier.arxiv-2609-25847", "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "start": 964, "end": 993, "quote": "<created>2026-09-22</created>"}, {"source_id": "source.frontier.arxiv-2609-25847", "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "start": 1766, "end": 1828, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-25701", "target_kind": "node", "target_sha256": "265421a5a50e797df47c4041c93dc6fdd177388afa0791402b77b6bfa37bf770", "canonical_record": {"id": "claim.frontier.arxiv-2609-25701", "label": "Fully Byzantine-Resilient Multi-Agent Reinforcement Learning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25701", "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25701", "title": "arXiv:2609.25701", "url": "https://arxiv.org/abs/2609.25701"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-25701"]}}, "statement": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"", "scope": {"population": "The study reported in arXiv:2609.25701", "time": "2026-09-22", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-25701", "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "start": 2284, "end": 2600, "quote": "Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs."}, {"source_id": "source.frontier.arxiv-2609-25701", "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "start": 1084, "end": 1113, "quote": "<created>2026-09-22</created>"}, {"source_id": "source.frontier.arxiv-2609-25701", "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "start": 1707, "end": 1769, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-25437", "target_kind": "node", "target_sha256": "04be0752464c1a2727c2499358978e64e3bb76280ab524b9d80244fc454dc4c9", "canonical_record": {"id": "claim.frontier.arxiv-2609-25437", "label": "Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25437", "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25437", "title": "arXiv:2609.25437", "url": "https://arxiv.org/abs/2609.25437"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-21", "source_ids": ["source.frontier.arxiv-2609-25437"]}}, "statement": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"", "scope": {"population": "The study reported in arXiv:2609.25437", "time": "2026-09-21", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-25437", "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "start": 3733, "end": 3921, "quote": "These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices."}, {"source_id": "source.frontier.arxiv-2609-25437", "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "start": 1084, "end": 1113, "quote": "<created>2026-09-21</created>"}, {"source_id": "source.frontier.arxiv-2609-25437", "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "start": 1952, "end": 2014, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-05763", "target_kind": "node", "target_sha256": "6a40b680ba9f871e726982e0df10ac8d16f87732cfb9e4dfe28adad7ca5bde57", "canonical_record": {"id": "claim.frontier.arxiv-2609-05763", "label": "AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-05763", "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"}, {"id": "arxiv:2609.05763", "title": "arXiv:2609.05763", "url": "https://arxiv.org/abs/2609.05763"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-21", "source_ids": ["source.frontier.arxiv-2609-05763"]}}, "statement": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"", "scope": {"population": "The study reported in arXiv:2609.05763", "time": "2026-09-21", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-05763", "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "start": 3321, "end": 3379, "quote": "We demonstrate this versatility across three applications."}, {"source_id": "source.frontier.arxiv-2609-05763", "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "start": 1004, "end": 1033, "quote": "<created>2026-09-21</created>"}, {"source_id": "source.frontier.arxiv-2609-05763", "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "start": 2464, "end": 2526, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-23703", "target_kind": "node", "target_sha256": "f6b5b72f02708a4ab71cec431bb431e6a28df2a8992b4bdb1fe0b549f41af299", "canonical_record": {"id": "claim.frontier.arxiv-2609-23703", "label": "Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23703", "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23703", "title": "arXiv:2609.23703", "url": "https://arxiv.org/abs/2609.23703"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-20", "source_ids": ["source.frontier.arxiv-2609-23703"]}}, "statement": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"", "scope": {"population": "The study reported in arXiv:2609.23703", "time": "2026-09-20", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-23703", "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "start": 3105, "end": 3400, "quote": "Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost."}, {"source_id": "source.frontier.arxiv-2609-23703", "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "start": 1046, "end": 1075, "quote": "<created>2026-09-20</created>"}, {"source_id": "source.frontier.arxiv-2609-23703", "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "start": 1631, "end": 1693, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-23199", "target_kind": "node", "target_sha256": "e33b811b9a06eb8c266b3d181f31b1bbd885f0a6b8669ef714027ffd48a18bda", "canonical_record": {"id": "claim.frontier.arxiv-2609-23199", "label": "LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23199", "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23199", "title": "arXiv:2609.23199", "url": "https://arxiv.org/abs/2609.23199"}, {"id": "doi:10.1109/jphot.2026.3734836", "title": "doi:10.1109/jphot.2026.3734836", "url": "https://doi.org/10.1109/jphot.2026.3734836"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-23199"]}}, "statement": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "scope": {"population": "The study reported in arXiv:2609.23199", "time": "2026-09-19", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-23199", "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "start": 2628, "end": 2856, "quote": "Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems."}, {"source_id": "source.frontier.arxiv-2609-23199", "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "start": 964, "end": 993, "quote": "<created>2026-09-19</created>"}, {"source_id": "source.frontier.arxiv-2609-23199", "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "start": 1746, "end": 1808, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-23085", "target_kind": "node", "target_sha256": "0c2b03d9b7f61908e4930255a68a278b4aa830f5d46eacdb1a95676e0f2acb18", "canonical_record": {"id": "claim.frontier.arxiv-2609-23085", "label": "Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23085", "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23085", "title": "arXiv:2609.23085", "url": "https://arxiv.org/abs/2609.23085"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-23085"]}}, "statement": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"", "scope": {"population": "The study reported in arXiv:2609.23085", "time": "2026-09-19", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-23085", "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "start": 3663, "end": 3861, "quote": "Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance."}, {"source_id": "source.frontier.arxiv-2609-23085", "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "start": 1124, "end": 1153, "quote": "<created>2026-09-19</created>"}, {"source_id": "source.frontier.arxiv-2609-23085", "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "start": 2397, "end": 2459, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-22775", "target_kind": "node", "target_sha256": "4af32e824e726799b88d3216d8168d9d745e823b6eb705b4ca7606c9c4ac565f", "canonical_record": {"id": "claim.frontier.arxiv-2609-22775", "label": "DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-22775", "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"}, {"id": "arxiv:2609.22775", "title": "arXiv:2609.22775", "url": "https://arxiv.org/abs/2609.22775"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-22775"]}}, "statement": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"", "scope": {"population": "The study reported in arXiv:2609.22775", "time": "2026-09-19", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-22775", "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "start": 3092, "end": 3291, "quote": "The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes)."}, {"source_id": "source.frontier.arxiv-2609-22775", "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "start": 1044, "end": 1073, "quote": "<created>2026-09-19</created>"}, {"source_id": "source.frontier.arxiv-2609-22775", "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "start": 1666, "end": 1728, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-22615", "target_kind": "node", "target_sha256": "96738d113de264b828a57dd20f4476b9cc89a4e1ac4f698ad231439ee857f97b", "canonical_record": {"id": "claim.frontier.arxiv-2609-22615", "label": "Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-22615", "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"}, {"id": "arxiv:2609.22615", "title": "arXiv:2609.22615", "url": "https://arxiv.org/abs/2609.22615"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-22615"]}}, "statement": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"", "scope": {"population": "The study reported in arXiv:2609.22615", "time": "2026-09-18", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-22615", "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "start": 2224, "end": 2503, "quote": "For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination."}, {"source_id": "source.frontier.arxiv-2609-22615", "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "start": 964, "end": 993, "quote": "<created>2026-09-18</created>"}, {"source_id": "source.frontier.arxiv-2609-22615", "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "start": 1569, "end": 1631, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-21966", "target_kind": "node", "target_sha256": "f97feec8b76ab0a8ba0b3049af47cafa32d05e103c02e20b5b5868d3dcef11d0", "canonical_record": {"id": "claim.frontier.arxiv-2609-21966", "label": "Automata-Theoretic Verification of Interval Markov Decision Processes", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21966", "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21966", "title": "arXiv:2609.21966", "url": "https://arxiv.org/abs/2609.21966"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-21966"]}}, "statement": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"", "scope": {"population": "The study reported in arXiv:2609.21966", "time": "2026-09-18", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-21966", "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "start": 2811, "end": 2979, "quote": "We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals."}, {"source_id": "source.frontier.arxiv-2609-21966", "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "start": 1044, "end": 1073, "quote": "<created>2026-09-18</created>"}, {"source_id": "source.frontier.arxiv-2609-21966", "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "start": 2160, "end": 2222, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-21270", "target_kind": "node", "target_sha256": "bb3a30fcfa51c5f286b0277f756e51a7e111aab8ca4073cc47185278d8028337", "canonical_record": {"id": "claim.frontier.arxiv-2609-21270", "label": "Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21270", "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21270", "title": "arXiv:2609.21270", "url": "https://arxiv.org/abs/2609.21270"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-21270"]}}, "statement": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "scope": {"population": "The study reported in arXiv:2609.21270", "time": "2026-09-18", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-21270", "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "start": 2195, "end": 2428, "quote": "For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice."}, {"source_id": "source.frontier.arxiv-2609-21270", "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "start": 1004, "end": 1033, "quote": "<created>2026-09-18</created>"}, {"source_id": "source.frontier.arxiv-2609-21270", "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "start": 1729, "end": 1791, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-21093", "target_kind": "node", "target_sha256": "c465663045ae0609766765a49d317b4f82250daed86724d16e1649eebe41769d", "canonical_record": {"id": "claim.frontier.arxiv-2609-21093", "label": "A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21093", "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21093", "title": "arXiv:2609.21093", "url": "https://arxiv.org/abs/2609.21093"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-17", "source_ids": ["source.frontier.arxiv-2609-21093"]}}, "statement": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"", "scope": {"population": "The study reported in arXiv:2609.21093", "time": "2026-09-17", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-21093", "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "start": 2652, "end": 2783, "quote": "We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely."}, {"source_id": "source.frontier.arxiv-2609-21093", "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "start": 1004, "end": 1033, "quote": "<created>2026-09-17</created>"}, {"source_id": "source.frontier.arxiv-2609-21093", "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "start": 1746, "end": 1808, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-21057", "target_kind": "node", "target_sha256": "76b88ca69cb60353712208a82ce03a82e0b5852dd6c7719bb1c49ff1ce79fb05", "canonical_record": {"id": "claim.frontier.arxiv-2609-21057", "label": "FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21057", "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21057", "title": "arXiv:2609.21057", "url": "https://arxiv.org/abs/2609.21057"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-17", "source_ids": ["source.frontier.arxiv-2609-21057"]}}, "statement": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "scope": {"population": "The study reported in arXiv:2609.21057", "time": "2026-09-17", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-21057", "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "start": 2183, "end": 2620, "quote": "We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses."}, {"source_id": "source.frontier.arxiv-2609-21057", "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "start": 1128, "end": 1157, "quote": "<created>2026-09-17</created>"}, {"source_id": "source.frontier.arxiv-2609-21057", "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "start": 1737, "end": 1799, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-19468", "target_kind": "node", "target_sha256": "20b06709a97ffe2fdd32187dbe5ad19e3076dfb72acae2020827f39ef0798c20", "canonical_record": {"id": "claim.frontier.arxiv-2609-19468", "label": "High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-19468", "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"}, {"id": "arxiv:2609.19468", "title": "arXiv:2609.19468", "url": "https://arxiv.org/abs/2609.19468"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-16", "source_ids": ["source.frontier.arxiv-2609-19468"]}}, "statement": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"", "scope": {"population": "The study reported in arXiv:2609.19468", "time": "2026-09-16", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-19468", "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "start": 3226, "end": 3331, "quote": "The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies."}, {"source_id": "source.frontier.arxiv-2609-19468", "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "start": 964, "end": 993, "quote": "<created>2026-09-16</created>"}, {"source_id": "source.frontier.arxiv-2609-19468", "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "start": 2743, "end": 2805, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-18467", "target_kind": "node", "target_sha256": "8673127090530ef79c91ce67d21a0961a0d2324c28977595f997b55b436942ba", "canonical_record": {"id": "claim.frontier.arxiv-2609-18467", "label": "Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-18467", "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"}, {"id": "arxiv:2609.18467", "title": "arXiv:2609.18467", "url": "https://arxiv.org/abs/2609.18467"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-16", "source_ids": ["source.frontier.arxiv-2609-18467"]}}, "statement": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "scope": {"population": "The study reported in arXiv:2609.18467", "time": "2026-09-16", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-18467", "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "start": 2727, "end": 2880, "quote": "We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty."}, {"source_id": "source.frontier.arxiv-2609-18467", "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "start": 964, "end": 993, "quote": "<created>2026-09-16</created>"}, {"source_id": "source.frontier.arxiv-2609-18467", "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "start": 2165, "end": 2227, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-17042", "target_kind": "node", "target_sha256": "dfd363fcf52796128cbf35327a99ab3b4afd63931a94569aa3641633dee4b997", "canonical_record": {"id": "claim.frontier.arxiv-2609-17042", "label": "Learning Options for Compositional Motor Control with Adapter Banks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-17042", "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"}, {"id": "arxiv:2609.17042", "title": "arXiv:2609.17042", "url": "https://arxiv.org/abs/2609.17042"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-15", "source_ids": ["source.frontier.arxiv-2609-17042"]}}, "statement": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"", "scope": {"population": "The study reported in arXiv:2609.17042", "time": "2026-09-15", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-17042", "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "start": 2732, "end": 2950, "quote": "We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude."}, {"source_id": "source.frontier.arxiv-2609-17042", "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "start": 1046, "end": 1075, "quote": "<created>2026-09-15</created>"}, {"source_id": "source.frontier.arxiv-2609-17042", "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "start": 1768, "end": 1830, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-16899", "target_kind": "node", "target_sha256": "439daac35e888b0458f5f4a8499371b529122e2c736647b8ca92d11a1613044d", "canonical_record": {"id": "claim.frontier.arxiv-2609-16899", "label": "Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16899", "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16899", "title": "arXiv:2609.16899", "url": "https://arxiv.org/abs/2609.16899"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-15", "source_ids": ["source.frontier.arxiv-2609-16899"]}}, "statement": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"", "scope": {"population": "The study reported in arXiv:2609.16899", "time": "2026-09-15", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-16899", "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "start": 3034, "end": 3229, "quote": "Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%."}, {"source_id": "source.frontier.arxiv-2609-16899", "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "start": 1004, "end": 1033, "quote": "<created>2026-09-15</created>"}, {"source_id": "source.frontier.arxiv-2609-16899", "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "start": 2094, "end": 2156, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-16353", "target_kind": "node", "target_sha256": "308626710d74f0f311a0557985dbae09d96b47474e6736bea1f5cacf744f1aef", "canonical_record": {"id": "claim.frontier.arxiv-2609-16353", "label": "Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16353", "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16353", "title": "arXiv:2609.16353", "url": "https://arxiv.org/abs/2609.16353"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-14", "source_ids": ["source.frontier.arxiv-2609-16353"]}}, "statement": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"", "scope": {"population": "The study reported in arXiv:2609.16353", "time": "2026-09-14", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-16353", "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "start": 2333, "end": 2477, "quote": "We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms."}, {"source_id": "source.frontier.arxiv-2609-16353", "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "start": 1048, "end": 1077, "quote": "<created>2026-09-14</created>"}, {"source_id": "source.frontier.arxiv-2609-16353", "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "start": 1808, "end": 1870, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-16258", "target_kind": "node", "target_sha256": "b63a96fb3fedb2f5e089b9841b38da80f9f1e2f5c871752d9028b4f41e475324", "canonical_record": {"id": "claim.frontier.arxiv-2609-16258", "label": "The AI-Enabled Scientific Frontier", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16258", "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16258", "title": "arXiv:2609.16258", "url": "https://arxiv.org/abs/2609.16258"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-14", "source_ids": ["source.frontier.arxiv-2609-16258"]}}, "statement": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"", "scope": {"population": "The study reported in arXiv:2609.16258", "time": "2026-09-14", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-16258", "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "start": 2057, "end": 2131, "quote": "Does AI outperform all techniques, or only some, and how is this changing?"}, {"source_id": "source.frontier.arxiv-2609-16258", "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "start": 1130, "end": 1159, "quote": "<created>2026-09-14</created>"}, {"source_id": "source.frontier.arxiv-2609-16258", "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "start": 1828, "end": 1890, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-05749", "target_kind": "node", "target_sha256": "8c190861d210e319ded5562e3121eac7e3ea8ecbcf32bfe9f737fbde3b1e8287", "canonical_record": {"id": "claim.frontier.arxiv-2609-05749", "label": "The Normalization of Deviance in AI Development", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-05749", "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"}, {"id": "arxiv:2609.05749", "title": "arXiv:2609.05749", "url": "https://arxiv.org/abs/2609.05749"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-13", "source_ids": ["source.frontier.arxiv-2609-05749"]}}, "statement": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"", "scope": {"population": "The study reported in arXiv:2609.05749", "time": "2026-09-13", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-05749", "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "start": 2829, "end": 3037, "quote": "The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes."}, {"source_id": "source.frontier.arxiv-2609-05749", "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "start": 1084, "end": 1113, "quote": "<created>2026-09-13</created>"}, {"source_id": "source.frontier.arxiv-2609-05749", "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "start": 1948, "end": 2010, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-14022", "target_kind": "node", "target_sha256": "1e7b0c229b300ae0c765be5e9dff4ce547e888afe590ae9a25063c587f663e1a", "canonical_record": {"id": "claim.frontier.arxiv-2609-14022", "label": "Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-14022", "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"}, {"id": "arxiv:2609.14022", "title": "arXiv:2609.14022", "url": "https://arxiv.org/abs/2609.14022"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-12", "source_ids": ["source.frontier.arxiv-2609-14022"]}}, "statement": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "scope": {"population": "The study reported in arXiv:2609.14022", "time": "2026-09-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-14022", "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "start": 4982, "end": 5211, "quote": "We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge."}, {"source_id": "source.frontier.arxiv-2609-14022", "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "start": 1004, "end": 1033, "quote": "<created>2026-09-12</created>"}, {"source_id": "source.frontier.arxiv-2609-14022", "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "start": 3626, "end": 3688, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-12866", "target_kind": "node", "target_sha256": "6fb5d07ac292366f14bd618e81b15c716cf7d1f4890cb3390114c1caf547cab9", "canonical_record": {"id": "claim.frontier.arxiv-2609-12866", "label": "Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12866", "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12866", "title": "arXiv:2609.12866", "url": "https://arxiv.org/abs/2609.12866"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-11", "source_ids": ["source.frontier.arxiv-2609-12866"]}}, "statement": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"", "scope": {"population": "The study reported in arXiv:2609.12866", "time": "2026-09-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-12866", "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "start": 2445, "end": 2599, "quote": "We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices)."}, {"source_id": "source.frontier.arxiv-2609-12866", "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "start": 964, "end": 993, "quote": "<created>2026-09-11</created>"}, {"source_id": "source.frontier.arxiv-2609-12866", "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "start": 1836, "end": 1898, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-12486", "target_kind": "node", "target_sha256": "4a8ebb64b931d95b0c5218130b7195bea59b74a1b7b9182f4541a29da18615ae", "canonical_record": {"id": "claim.frontier.arxiv-2609-12486", "label": "Adaptive Agent Design", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12486", "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12486", "title": "arXiv:2609.12486", "url": "https://arxiv.org/abs/2609.12486"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-11", "source_ids": ["source.frontier.arxiv-2609-12486"]}}, "statement": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"", "scope": {"population": "The study reported in arXiv:2609.12486", "time": "2026-09-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-12486", "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "start": 2338, "end": 2642, "quote": "For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one."}, {"source_id": "source.frontier.arxiv-2609-12486", "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "start": 1128, "end": 1157, "quote": "<created>2026-09-11</created>"}, {"source_id": "source.frontier.arxiv-2609-12486", "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "start": 1825, "end": 1887, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-12016", "target_kind": "node", "target_sha256": "1407a2a40fe480f7757cb800d33da002b2148b04b8adf7e3aa6991aed0928205", "canonical_record": {"id": "claim.frontier.arxiv-2609-12016", "label": "Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12016", "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12016", "title": "arXiv:2609.12016", "url": "https://arxiv.org/abs/2609.12016"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-10", "source_ids": ["source.frontier.arxiv-2609-12016"]}}, "statement": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "scope": {"population": "The study reported in arXiv:2609.12016", "time": "2026-09-10", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-12016", "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "start": 2518, "end": 2870, "quote": "We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary."}, {"source_id": "source.frontier.arxiv-2609-12016", "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "start": 1044, "end": 1073, "quote": "<created>2026-09-10</created>"}, {"source_id": "source.frontier.arxiv-2609-12016", "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "start": 2016, "end": 2078, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-11530", "target_kind": "node", "target_sha256": "f6ced05713c8c792ff8a98644885b116b83444ed35c3596967af6642dba86227", "canonical_record": {"id": "claim.frontier.arxiv-2609-11530", "label": "pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-11530", "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"}, {"id": "arxiv:2609.11530", "title": "arXiv:2609.11530", "url": "https://arxiv.org/abs/2609.11530"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-10", "source_ids": ["source.frontier.arxiv-2609-11530"]}}, "statement": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"", "scope": {"population": "The study reported in arXiv:2609.11530", "time": "2026-09-10", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-11530", "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "start": 3454, "end": 3650, "quote": "We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations."}, {"source_id": "source.frontier.arxiv-2609-11530", "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "start": 966, "end": 995, "quote": "<created>2026-09-10</created>"}, {"source_id": "source.frontier.arxiv-2609-11530", "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "start": 2147, "end": 2209, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-08218", "target_kind": "node", "target_sha256": "e64e423c33260e0218665ec9cc382917080218f7f2bb40857cce80d0ea6736f4", "canonical_record": {"id": "claim.frontier.arxiv-2609-08218", "label": "Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-08218", "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"}, {"id": "arxiv:2609.08218", "title": "arXiv:2609.08218", "url": "https://arxiv.org/abs/2609.08218"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-09", "source_ids": ["source.frontier.arxiv-2609-08218"]}}, "statement": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"", "scope": {"population": "The study reported in arXiv:2609.08218", "time": "2026-09-09", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-08218", "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "start": 2845, "end": 2959, "quote": "We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs."}, {"source_id": "source.frontier.arxiv-2609-08218", "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "start": 1004, "end": 1033, "quote": "<created>2026-09-09</created>"}, {"source_id": "source.frontier.arxiv-2609-08218", "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "start": 1586, "end": 1648, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-06163", "target_kind": "node", "target_sha256": "6ce239788a388f3ed75f291462aa025883af7db4c61e81f88db58c5851a04201", "canonical_record": {"id": "claim.frontier.arxiv-2609-06163", "label": "Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-06163", "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"}, {"id": "arxiv:2609.06163", "title": "arXiv:2609.06163", "url": "https://arxiv.org/abs/2609.06163"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-05", "source_ids": ["source.frontier.arxiv-2609-06163"]}}, "statement": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"", "scope": {"population": "The study reported in arXiv:2609.06163", "time": "2026-09-05", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-06163", "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "start": 2673, "end": 2809, "quote": "Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints."}, {"source_id": "source.frontier.arxiv-2609-06163", "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "start": 1004, "end": 1033, "quote": "<created>2026-09-05</created>"}, {"source_id": "source.frontier.arxiv-2609-06163", "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "start": 1653, "end": 1715, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-06066", "target_kind": "node", "target_sha256": "b4d6e7484b0f2f26120741889f7e2dce8b232b445f2f4f797fbf407e287cba12", "canonical_record": {"id": "claim.frontier.arxiv-2609-06066", "label": "Scalability of Graph Neural Network Policies in Wireless Communication Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-06066", "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"}, {"id": "arxiv:2609.06066", "title": "arXiv:2609.06066", "url": "https://arxiv.org/abs/2609.06066"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-05", "source_ids": ["source.frontier.arxiv-2609-06066"]}}, "statement": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"", "scope": {"population": "The study reported in arXiv:2609.06066", "time": "2026-09-05", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-06066", "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "start": 2581, "end": 2747, "quote": "Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs."}, {"source_id": "source.frontier.arxiv-2609-06066", "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "start": 964, "end": 993, "quote": "<created>2026-09-05</created>"}, {"source_id": "source.frontier.arxiv-2609-06066", "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "start": 1697, "end": 1759, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2609-02071", "target_kind": "node", "target_sha256": "039e2ea49be10d4d3da82b47e1b5c6f61e412d8559c04b850256203485307c30", "canonical_record": {"id": "claim.frontier.arxiv-2609-02071", "label": "Turnpike properties in nonlinear system identification", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-02071", "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"}, {"id": "arxiv:2609.02071", "title": "arXiv:2609.02071", "url": "https://arxiv.org/abs/2609.02071"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-02", "source_ids": ["source.frontier.arxiv-2609-02071"]}}, "statement": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"", "scope": {"population": "The study reported in arXiv:2609.02071", "time": "2026-09-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2609-02071", "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "start": 2834, "end": 3018, "quote": "Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity."}, {"source_id": "source.frontier.arxiv-2609-02071", "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "start": 1048, "end": 1077, "quote": "<created>2026-09-02</created>"}, {"source_id": "source.frontier.arxiv-2609-02071", "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "start": 1618, "end": 1680, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-31034", "target_kind": "node", "target_sha256": "ec0bd10015ab5dca339cb414086f312a1612f4b6f53ac333f77f67b8a91388df", "canonical_record": {"id": "claim.frontier.arxiv-2608-31034", "label": "XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-31034", "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"}, {"id": "arxiv:2608.31034", "title": "arXiv:2608.31034", "url": "https://arxiv.org/abs/2608.31034"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-31", "source_ids": ["source.frontier.arxiv-2608-31034"]}}, "statement": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"", "scope": {"population": "The study reported in arXiv:2608.31034", "time": "2026-08-31", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-31034", "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "start": 3083, "end": 3336, "quote": "Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change."}, {"source_id": "source.frontier.arxiv-2608-31034", "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "start": 964, "end": 993, "quote": "<created>2026-08-31</created>"}, {"source_id": "source.frontier.arxiv-2608-31034", "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "start": 2141, "end": 2203, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-28387", "target_kind": "node", "target_sha256": "6b07394df7c72280fcb7cc78d2d8826e8f36f255599684ae336b3116e2138c15", "canonical_record": {"id": "claim.frontier.arxiv-2608-28387", "label": "Neuromorphic architectures as numerical solvers for computational neuroscience", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-28387", "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"}, {"id": "arxiv:2608.28387", "title": "arXiv:2608.28387", "url": "https://arxiv.org/abs/2608.28387"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-28", "source_ids": ["source.frontier.arxiv-2608-28387"]}}, "statement": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"", "scope": {"population": "The study reported in arXiv:2608.28387", "time": "2026-08-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-28387", "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "start": 2895, "end": 3297, "quote": "In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision."}, {"source_id": "source.frontier.arxiv-2608-28387", "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "start": 1006, "end": 1035, "quote": "<created>2026-08-28</created>"}, {"source_id": "source.frontier.arxiv-2608-28387", "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "start": 2089, "end": 2151, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-27536", "target_kind": "node", "target_sha256": "27bcb430fa3c83f7a7d1398d207348ef0a72dd0d9aef4475517ece783e174ba0", "canonical_record": {"id": "claim.frontier.arxiv-2608-27536", "label": "Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-27536", "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"}, {"id": "arxiv:2608.27536", "title": "arXiv:2608.27536", "url": "https://arxiv.org/abs/2608.27536"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-27", "source_ids": ["source.frontier.arxiv-2608-27536"]}}, "statement": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"", "scope": {"population": "The study reported in arXiv:2608.27536", "time": "2026-08-27", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-27536", "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "start": 2291, "end": 2483, "quote": "We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation."}, {"source_id": "source.frontier.arxiv-2608-27536", "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "start": 1004, "end": 1033, "quote": "<created>2026-08-27</created>"}, {"source_id": "source.frontier.arxiv-2608-27536", "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "start": 2056, "end": 2118, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-26093", "target_kind": "node", "target_sha256": "bc56588a8d495fccbfa72e7ed6c6a57dbf51cf4fec8551bf0607c7e60c3556bb", "canonical_record": {"id": "claim.frontier.arxiv-2608-26093", "label": "Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-26093", "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"}, {"id": "arxiv:2608.26093", "title": "arXiv:2608.26093", "url": "https://arxiv.org/abs/2608.26093"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-26", "source_ids": ["source.frontier.arxiv-2608-26093"]}}, "statement": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"", "scope": {"population": "The study reported in arXiv:2608.26093", "time": "2026-08-26", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-26093", "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "start": 2385, "end": 2481, "quote": "We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety."}, {"source_id": "source.frontier.arxiv-2608-26093", "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "start": 1128, "end": 1157, "quote": "<created>2026-08-26</created>"}, {"source_id": "source.frontier.arxiv-2608-26093", "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "start": 2121, "end": 2183, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-24219", "target_kind": "node", "target_sha256": "822853ae1bd10336e56f0bb36069f737aea135aaf8f7ec4f5bfb5cfab0bb7ed4", "canonical_record": {"id": "claim.frontier.arxiv-2608-24219", "label": "Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-24219", "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"}, {"id": "arxiv:2608.24219", "title": "arXiv:2608.24219", "url": "https://arxiv.org/abs/2608.24219"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-25", "source_ids": ["source.frontier.arxiv-2608-24219"]}}, "statement": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"", "scope": {"population": "The study reported in arXiv:2608.24219", "time": "2026-08-25", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-24219", "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "start": 2450, "end": 2538, "quote": "We also find that attractive faces are more prototypical in both shape and latent space."}, {"source_id": "source.frontier.arxiv-2608-24219", "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "start": 1006, "end": 1035, "quote": "<created>2026-08-25</created>"}, {"source_id": "source.frontier.arxiv-2608-24219", "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "start": 1675, "end": 1737, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-23972", "target_kind": "node", "target_sha256": "2f4e8209d8fab0d2f13b2da9f1793dd68549b9ff6995792b8c8d9926e2d25ad2", "canonical_record": {"id": "claim.frontier.arxiv-2608-23972", "label": "Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-23972", "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"}, {"id": "arxiv:2608.23972", "title": "arXiv:2608.23972", "url": "https://arxiv.org/abs/2608.23972"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-25", "source_ids": ["source.frontier.arxiv-2608-23972"]}}, "statement": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"", "scope": {"population": "The study reported in arXiv:2608.23972", "time": "2026-08-25", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-23972", "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "start": 3189, "end": 3405, "quote": "We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency."}, {"source_id": "source.frontier.arxiv-2608-23972", "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "start": 1044, "end": 1073, "quote": "<created>2026-08-25</created>"}, {"source_id": "source.frontier.arxiv-2608-23972", "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "start": 2388, "end": 2450, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-21764", "target_kind": "node", "target_sha256": "bbca19c1f8cb4c2b7006f9ca2cea484fefedad6b5e602ae8830f9741e4e3e7de", "canonical_record": {"id": "claim.frontier.arxiv-2608-21764", "label": "LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-21764", "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"}, {"id": "arxiv:2608.21764", "title": "arXiv:2608.21764", "url": "https://arxiv.org/abs/2608.21764"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-22", "source_ids": ["source.frontier.arxiv-2608-21764"]}}, "statement": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"", "scope": {"population": "The study reported in arXiv:2608.21764", "time": "2026-08-22", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-21764", "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "start": 3898, "end": 4113, "quote": "These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments."}, {"source_id": "source.frontier.arxiv-2608-21764", "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "start": 1044, "end": 1073, "quote": "<created>2026-08-22</created>"}, {"source_id": "source.frontier.arxiv-2608-21764", "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "start": 2259, "end": 2321, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-21020", "target_kind": "node", "target_sha256": "4a98426444f281136895acd6e36e2811a1b5fd9b30e99d03b0fd39e10f09efc3", "canonical_record": {"id": "claim.frontier.arxiv-2608-21020", "label": "Frequency-Selective Pinching-Antenna Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-21020", "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"}, {"id": "arxiv:2608.21020", "title": "arXiv:2608.21020", "url": "https://arxiv.org/abs/2608.21020"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-21", "source_ids": ["source.frontier.arxiv-2608-21020"]}}, "statement": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"", "scope": {"population": "The study reported in arXiv:2608.21020", "time": "2026-08-21", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-21020", "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "start": 2574, "end": 2699, "quote": "For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate."}, {"source_id": "source.frontier.arxiv-2608-21020", "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "start": 964, "end": 993, "quote": "<created>2026-08-21</created>"}, {"source_id": "source.frontier.arxiv-2608-21020", "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "start": 1841, "end": 1903, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-20723", "target_kind": "node", "target_sha256": "21b5d82da39fbfd3204bb12044e33b8beab6817bfdb1dadb65fe180b87d13fff", "canonical_record": {"id": "claim.frontier.arxiv-2608-20723", "label": "Conscious Access as Continuous-to-Discrete Translation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-20723", "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"}, {"id": "arxiv:2608.20723", "title": "arXiv:2608.20723", "url": "https://arxiv.org/abs/2608.20723"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-21", "source_ids": ["source.frontier.arxiv-2608-20723"]}}, "statement": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"", "scope": {"population": "The study reported in arXiv:2608.20723", "time": "2026-08-21", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-20723", "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "start": 2440, "end": 2726, "quote": "By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes."}, {"source_id": "source.frontier.arxiv-2608-20723", "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "start": 1006, "end": 1035, "quote": "<created>2026-08-21</created>"}, {"source_id": "source.frontier.arxiv-2608-20723", "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "start": 1408, "end": 1470, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-19416", "target_kind": "node", "target_sha256": "d8889c499e52fd77720c142cb996ad430a20bddda827cc20d73b92099d872058", "canonical_record": {"id": "claim.frontier.arxiv-2608-19416", "label": "Robust Near-Field Beam Focusing Under Imperfect Localization", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-19416", "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"}, {"id": "arxiv:2608.19416", "title": "arXiv:2608.19416", "url": "https://arxiv.org/abs/2608.19416"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-19", "source_ids": ["source.frontier.arxiv-2608-19416"]}}, "statement": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"", "scope": {"population": "The study reported in arXiv:2608.19416", "time": "2026-08-19", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-19416", "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "start": 3100, "end": 3331, "quote": "Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges."}, {"source_id": "source.frontier.arxiv-2608-19416", "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "start": 964, "end": 993, "quote": "<created>2026-08-19</created>"}, {"source_id": "source.frontier.arxiv-2608-19416", "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "start": 1956, "end": 2018, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-18396", "target_kind": "node", "target_sha256": "4230aa909bd349a12725da9500e49d54790d908f75fe72e2e5a0d245a9b10ebc", "canonical_record": {"id": "claim.frontier.arxiv-2608-18396", "label": "LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-18396", "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"}, {"id": "arxiv:2608.18396", "title": "arXiv:2608.18396", "url": "https://arxiv.org/abs/2608.18396"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-18", "source_ids": ["source.frontier.arxiv-2608-18396"]}}, "statement": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"", "scope": {"population": "The study reported in arXiv:2608.18396", "time": "2026-08-18", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-18396", "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "start": 3192, "end": 3393, "quote": "Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction."}, {"source_id": "source.frontier.arxiv-2608-18396", "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "start": 1004, "end": 1033, "quote": "<created>2026-08-18</created>"}, {"source_id": "source.frontier.arxiv-2608-18396", "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "start": 2222, "end": 2284, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-18060", "target_kind": "node", "target_sha256": "2b63e910a14d93725ef45ef1b13b0eb28ca103821e3489d92cdf0d2d5d6047e5", "canonical_record": {"id": "claim.frontier.arxiv-2608-18060", "label": "Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-18060", "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"}, {"id": "arxiv:2608.18060", "title": "arXiv:2608.18060", "url": "https://arxiv.org/abs/2608.18060"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-18", "source_ids": ["source.frontier.arxiv-2608-18060"]}}, "statement": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"", "scope": {"population": "The study reported in arXiv:2608.18060", "time": "2026-08-18", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-18060", "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "start": 2133, "end": 2304, "quote": "We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR."}, {"source_id": "source.frontier.arxiv-2608-18060", "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "start": 1004, "end": 1033, "quote": "<created>2026-08-18</created>"}, {"source_id": "source.frontier.arxiv-2608-18060", "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "start": 1891, "end": 1953, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-16290", "target_kind": "node", "target_sha256": "4fe1ecbb34884d2d9f3c8e7b47b3c34d0385c84822822c2db70e7765b8387f76", "canonical_record": {"id": "claim.frontier.arxiv-2608-16290", "label": "Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-16290", "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"}, {"id": "arxiv:2608.16290", "title": "arXiv:2608.16290", "url": "https://arxiv.org/abs/2608.16290"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-17", "source_ids": ["source.frontier.arxiv-2608-16290"]}}, "statement": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"", "scope": {"population": "The study reported in arXiv:2608.16290", "time": "2026-08-17", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-16290", "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "start": 2394, "end": 2576, "quote": "For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA)."}, {"source_id": "source.frontier.arxiv-2608-16290", "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "start": 964, "end": 993, "quote": "<created>2026-08-17</created>"}, {"source_id": "source.frontier.arxiv-2608-16290", "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "start": 1814, "end": 1876, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-12037", "target_kind": "node", "target_sha256": "f9a5d11f4ca15ccecff427fcc92faa1557867617cf2a0098fac1982eb91b24c1", "canonical_record": {"id": "claim.frontier.arxiv-2608-12037", "label": "Clustered Randomized Smoothing for Stochastic Prediction Functions", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12037", "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12037", "title": "arXiv:2608.12037", "url": "https://arxiv.org/abs/2608.12037"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-12", "source_ids": ["source.frontier.arxiv-2608-12037"]}}, "statement": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "scope": {"population": "The study reported in arXiv:2608.12037", "time": "2026-08-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-12037", "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "start": 3116, "end": 3333, "quote": "By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes."}, {"source_id": "source.frontier.arxiv-2608-12037", "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "start": 1044, "end": 1073, "quote": "<created>2026-08-12</created>"}, {"source_id": "source.frontier.arxiv-2608-12037", "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "start": 2230, "end": 2292, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-11929", "target_kind": "node", "target_sha256": "88c54a9768888234ddab15fee435818a796534a6bc0452a14c336224d174f46f", "canonical_record": {"id": "claim.frontier.arxiv-2608-11929", "label": "Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-11929", "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"}, {"id": "arxiv:2608.11929", "title": "arXiv:2608.11929", "url": "https://arxiv.org/abs/2608.11929"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-12", "source_ids": ["source.frontier.arxiv-2608-11929"]}}, "statement": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"", "scope": {"population": "The study reported in arXiv:2608.11929", "time": "2026-08-12", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-11929", "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "start": 2725, "end": 2855, "quote": "The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer."}, {"source_id": "source.frontier.arxiv-2608-11929", "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "start": 1004, "end": 1033, "quote": "<created>2026-08-12</created>"}, {"source_id": "source.frontier.arxiv-2608-11929", "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "start": 1738, "end": 1800, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-11175", "target_kind": "node", "target_sha256": "61a3b6758674c089ff292933f056a52824662e5a8d2f8681f7488ce616290b83", "canonical_record": {"id": "claim.frontier.arxiv-2608-11175", "label": "Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-11175", "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"}, {"id": "arxiv:2608.11175", "title": "arXiv:2608.11175", "url": "https://arxiv.org/abs/2608.11175"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-11175"]}}, "statement": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"", "scope": {"population": "The study reported in arXiv:2608.11175", "time": "2026-08-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-11175", "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "start": 2849, "end": 3022, "quote": "By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments."}, {"source_id": "source.frontier.arxiv-2608-11175", "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "start": 1044, "end": 1073, "quote": "<created>2026-08-11</created>"}, {"source_id": "source.frontier.arxiv-2608-11175", "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "start": 1868, "end": 1930, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-10825", "target_kind": "node", "target_sha256": "5b6cad2caad586b624a67aaccd674490521eda4a47b8857ffa06714a2eb1153f", "canonical_record": {"id": "claim.frontier.arxiv-2608-10825", "label": "Cross-modal topology decodes battery faults from sparse voltage snapshots", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-10825", "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"}, {"id": "arxiv:2608.10825", "title": "arXiv:2608.10825", "url": "https://arxiv.org/abs/2608.10825"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-10825"]}}, "statement": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"", "scope": {"population": "The study reported in arXiv:2608.10825", "time": "2026-08-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-10825", "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "start": 2517, "end": 2641, "quote": "Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots."}, {"source_id": "source.frontier.arxiv-2608-10825", "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "start": 1004, "end": 1033, "quote": "<created>2026-08-11</created>"}, {"source_id": "source.frontier.arxiv-2608-10825", "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "start": 2069, "end": 2131, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-08151", "target_kind": "node", "target_sha256": "418f661b816ee96760c776caffdcaddbb0731fcad8c70c1726fd8506afc6d9eb", "canonical_record": {"id": "claim.frontier.arxiv-2608-08151", "label": "Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-08151", "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"}, {"id": "arxiv:2608.08151", "title": "arXiv:2608.08151", "url": "https://arxiv.org/abs/2608.08151"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-08151"]}}, "statement": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"", "scope": {"population": "The study reported in arXiv:2608.08151", "time": "2026-08-11", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-08151", "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "start": 3307, "end": 3414, "quote": "These results show that reference orbit geometry is an important part of defensive cislunar mission design."}, {"source_id": "source.frontier.arxiv-2608-08151", "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "start": 1004, "end": 1033, "quote": "<created>2026-08-11</created>"}, {"source_id": "source.frontier.arxiv-2608-08151", "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "start": 2085, "end": 2147, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-10254", "target_kind": "node", "target_sha256": "e6111919699867aae8824c063308a9fdf7c5dcfff8b9e00b91f43edb777f17c2", "canonical_record": {"id": "claim.frontier.arxiv-2608-10254", "label": "A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-10254", "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"}, {"id": "arxiv:2608.10254", "title": "arXiv:2608.10254", "url": "https://arxiv.org/abs/2608.10254"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-10", "source_ids": ["source.frontier.arxiv-2608-10254"]}}, "statement": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"", "scope": {"population": "The study reported in arXiv:2608.10254", "time": "2026-08-10", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-10254", "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "start": 3476, "end": 3638, "quote": "We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes."}, {"source_id": "source.frontier.arxiv-2608-10254", "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "start": 1044, "end": 1073, "quote": "<created>2026-08-10</created>"}, {"source_id": "source.frontier.arxiv-2608-10254", "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "start": 2084, "end": 2146, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-08599", "target_kind": "node", "target_sha256": "bbf18907cd43f8752bbfdc399422ce23594c15350b056f40983a7fc667f3e7b0", "canonical_record": {"id": "claim.frontier.arxiv-2608-08599", "label": "Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-08599", "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"}, {"id": "arxiv:2608.08599", "title": "arXiv:2608.08599", "url": "https://arxiv.org/abs/2608.08599"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-09", "source_ids": ["source.frontier.arxiv-2608-08599"]}}, "statement": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"", "scope": {"population": "The study reported in arXiv:2608.08599", "time": "2026-08-09", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-08599", "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "start": 2857, "end": 3044, "quote": "Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity."}, {"source_id": "source.frontier.arxiv-2608-08599", "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "start": 964, "end": 993, "quote": "<created>2026-08-09</created>"}, {"source_id": "source.frontier.arxiv-2608-08599", "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "start": 1880, "end": 1942, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-12398", "target_kind": "node", "target_sha256": "f702c66c52e59efcce94160d673b356d4692ff4cc2e87570e5a2864d7956fa1e", "canonical_record": {"id": "claim.frontier.arxiv-2608-12398", "label": "A Hierarchical Energy-Based Model for Multimodal Cognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12398", "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12398", "title": "arXiv:2608.12398", "url": "https://arxiv.org/abs/2608.12398"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-08", "source_ids": ["source.frontier.arxiv-2608-12398"]}}, "statement": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "scope": {"population": "The study reported in arXiv:2608.12398", "time": "2026-08-08", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-12398", "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "start": 2620, "end": 3064, "quote": "We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction."}, {"source_id": "source.frontier.arxiv-2608-12398", "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "start": 1006, "end": 1035, "quote": "<created>2026-08-08</created>"}, {"source_id": "source.frontier.arxiv-2608-12398", "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "start": 1503, "end": 1565, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-07289", "target_kind": "node", "target_sha256": "1fbadbe0683aaa090614e2b25ef1e6624b9ce0d9cc932895cff294653261dc43", "canonical_record": {"id": "claim.frontier.arxiv-2608-07289", "label": "Synthesizing Voltage Ride-Through Controllers for Data Centers", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-07289", "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"}, {"id": "arxiv:2608.07289", "title": "arXiv:2608.07289", "url": "https://arxiv.org/abs/2608.07289"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-07", "source_ids": ["source.frontier.arxiv-2608-07289"]}}, "statement": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"", "scope": {"population": "The study reported in arXiv:2608.07289", "time": "2026-08-07", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-07289", "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "start": 4289, "end": 4481, "quote": "The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance."}, {"source_id": "source.frontier.arxiv-2608-07289", "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "start": 1084, "end": 1113, "quote": "<created>2026-08-07</created>"}, {"source_id": "source.frontier.arxiv-2608-07289", "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "start": 2465, "end": 2527, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-05481", "target_kind": "node", "target_sha256": "c9a402016800f9b54db71f8fb34ca5a81251c460b4ed4c9f832e334bc1c7027a", "canonical_record": {"id": "claim.frontier.arxiv-2608-05481", "label": "From Local Learning to Global Prediction Through Layered Surprise Cascades", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-05481", "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"}, {"id": "arxiv:2608.05481", "title": "arXiv:2608.05481", "url": "https://arxiv.org/abs/2608.05481"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-06", "source_ids": ["source.frontier.arxiv-2608-05481"]}}, "statement": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "scope": {"population": "The study reported in arXiv:2608.05481", "time": "2026-08-06", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-05481", "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "start": 2885, "end": 3056, "quote": "Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning."}, {"source_id": "source.frontier.arxiv-2608-05481", "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "start": 966, "end": 995, "quote": "<created>2026-08-06</created>"}, {"source_id": "source.frontier.arxiv-2608-05481", "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "start": 2009, "end": 2071, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-05348", "target_kind": "node", "target_sha256": "7fb323d587831f4c9c942c8de1ec0b5513ec729f3d747cd868de16aa413f6f15", "canonical_record": {"id": "claim.frontier.arxiv-2608-05348", "label": "TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-05348", "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"}, {"id": "arxiv:2608.05348", "title": "arXiv:2608.05348", "url": "https://arxiv.org/abs/2608.05348"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-05", "source_ids": ["source.frontier.arxiv-2608-05348"]}}, "statement": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"", "scope": {"population": "The study reported in arXiv:2608.05348", "time": "2026-08-05", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-05348", "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "start": 2721, "end": 2796, "quote": "In both cases, TSDM significantly outperforms existing scheduling policies."}, {"source_id": "source.frontier.arxiv-2608-05348", "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "start": 1004, "end": 1033, "quote": "<created>2026-08-05</created>"}, {"source_id": "source.frontier.arxiv-2608-05348", "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "start": 1591, "end": 1653, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-12393", "target_kind": "node", "target_sha256": "67d9855cccf7e4f46b446c253650ec227fdbfb9d85750e956c614588ac64ebfb", "canonical_record": {"id": "claim.frontier.arxiv-2608-12393", "label": "Metacognitive Skill Learning: A Computational Account", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12393", "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12393", "title": "arXiv:2608.12393", "url": "https://arxiv.org/abs/2608.12393"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-12393"]}}, "statement": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"", "scope": {"population": "The study reported in arXiv:2608.12393", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-12393", "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "start": 2361, "end": 2556, "quote": "The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness."}, {"source_id": "source.frontier.arxiv-2608-12393", "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "start": 966, "end": 995, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-12393", "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "start": 1499, "end": 1561, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-04227", "target_kind": "node", "target_sha256": "b23bb78dd5b45e70a53acecdd6d09f2bb9ec9afd212936fc0f602d06affb8e07", "canonical_record": {"id": "claim.frontier.arxiv-2608-04227", "label": "Random features for Grassmannian kernel approximation with bounded rank-one projections", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-04227", "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"}, {"id": "arxiv:2608.04227", "title": "arXiv:2608.04227", "url": "https://arxiv.org/abs/2608.04227"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-04227"]}}, "statement": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"", "scope": {"population": "The study reported in arXiv:2608.04227", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-04227", "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "start": 2523, "end": 2703, "quote": "We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces."}, {"source_id": "source.frontier.arxiv-2608-04227", "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "start": 1004, "end": 1033, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-04227", "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "start": 1754, "end": 1816, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-04133", "target_kind": "node", "target_sha256": "6bc0ecdfe554d2bede0800c6ab81b1503c9bf856154d8540a2454bd4edc0e51a", "canonical_record": {"id": "claim.frontier.arxiv-2608-04133", "label": "Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-04133", "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"}, {"id": "arxiv:2608.04133", "title": "arXiv:2608.04133", "url": "https://arxiv.org/abs/2608.04133"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-04133"]}}, "statement": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"", "scope": {"population": "The study reported in arXiv:2608.04133", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-04133", "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "start": 2710, "end": 2953, "quote": "By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction."}, {"source_id": "source.frontier.arxiv-2608-04133", "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "start": 1048, "end": 1077, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-04133", "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "start": 2285, "end": 2347, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-03967", "target_kind": "node", "target_sha256": "bcb8b2bbdc627943ea3d1fd487e21f2b1b9fc41c5c5eb532aa10e78e6b85a376", "canonical_record": {"id": "claim.frontier.arxiv-2608-03967", "label": "Information-Geometric Forward Policy Training in GFlowNets", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-03967", "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"}, {"id": "arxiv:2608.03967", "title": "arXiv:2608.03967", "url": "https://arxiv.org/abs/2608.03967"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-03967"]}}, "statement": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"", "scope": {"population": "The study reported in arXiv:2608.03967", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-03967", "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "start": 2055, "end": 2389, "quote": "Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable."}, {"source_id": "source.frontier.arxiv-2608-03967", "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "start": 1004, "end": 1033, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-03967", "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "start": 1613, "end": 1675, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-02978", "target_kind": "node", "target_sha256": "c7d8752a652edf07a25e8b05fbbc1a79f33691ddb4a36f189b5ac9a3bb13ec41", "canonical_record": {"id": "claim.frontier.arxiv-2608-02978", "label": "Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02978", "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02978", "title": "arXiv:2608.02978", "url": "https://arxiv.org/abs/2608.02978"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-02978"]}}, "statement": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"", "scope": {"population": "The study reported in arXiv:2608.02978", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-02978", "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "start": 2628, "end": 2826, "quote": "Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats."}, {"source_id": "source.frontier.arxiv-2608-02978", "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "start": 1004, "end": 1033, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-02978", "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "start": 1607, "end": 1669, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-02976", "target_kind": "node", "target_sha256": "e0208edca4e1ed4f60e4c5b38ac6d2cd08b8361bf4f4752b24f2cf751c3ff74f", "canonical_record": {"id": "claim.frontier.arxiv-2608-02976", "label": "Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02976", "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02976", "title": "arXiv:2608.02976", "url": "https://arxiv.org/abs/2608.02976"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-02976"]}}, "statement": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"", "scope": {"population": "The study reported in arXiv:2608.02976", "time": "2026-08-04", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-02976", "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "start": 3184, "end": 3372, "quote": "The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions."}, {"source_id": "source.frontier.arxiv-2608-02976", "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "start": 1004, "end": 1033, "quote": "<created>2026-08-04</created>"}, {"source_id": "source.frontier.arxiv-2608-02976", "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "start": 1756, "end": 1818, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-02244", "target_kind": "node", "target_sha256": "743c5add749989b4464633c90f8aa6a9adf0fc57455492446d7ccec1d222118f", "canonical_record": {"id": "claim.frontier.arxiv-2608-02244", "label": "Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02244", "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02244", "title": "arXiv:2608.02244", "url": "https://arxiv.org/abs/2608.02244"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-03", "source_ids": ["source.frontier.arxiv-2608-02244"]}}, "statement": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "scope": {"population": "The study reported in arXiv:2608.02244", "time": "2026-08-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-02244", "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "start": 2593, "end": 2669, "quote": "We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$."}, {"source_id": "source.frontier.arxiv-2608-02244", "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "start": 1044, "end": 1073, "quote": "<created>2026-08-03</created>"}, {"source_id": "source.frontier.arxiv-2608-02244", "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "start": 1621, "end": 1683, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-02079", "target_kind": "node", "target_sha256": "e5edce4b2315fc743cc869cec2fcf60f4f81e4a54521ae777cd88be9a6cffbf7", "canonical_record": {"id": "claim.frontier.arxiv-2608-02079", "label": "TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02079", "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02079", "title": "arXiv:2608.02079", "url": "https://arxiv.org/abs/2608.02079"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-03", "source_ids": ["source.frontier.arxiv-2608-02079"]}}, "statement": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"", "scope": {"population": "The study reported in arXiv:2608.02079", "time": "2026-08-03", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-02079", "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "start": 3323, "end": 3557, "quote": "The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter."}, {"source_id": "source.frontier.arxiv-2608-02079", "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "start": 1044, "end": 1073, "quote": "<created>2026-08-03</created>"}, {"source_id": "source.frontier.arxiv-2608-02079", "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "start": 2115, "end": 2177, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-01220", "target_kind": "node", "target_sha256": "08d4f16884ff34ab2eb12519ccb18c619e1ba2fe06807158df2e88270c1f2f55", "canonical_record": {"id": "claim.frontier.arxiv-2608-01220", "label": "Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-01220", "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"}, {"id": "arxiv:2608.01220", "title": "arXiv:2608.01220", "url": "https://arxiv.org/abs/2608.01220"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-02", "source_ids": ["source.frontier.arxiv-2608-01220"]}}, "statement": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"", "scope": {"population": "The study reported in arXiv:2608.01220", "time": "2026-08-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-01220", "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "start": 3591, "end": 3720, "quote": "Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps."}, {"source_id": "source.frontier.arxiv-2608-01220", "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "start": 1132, "end": 1161, "quote": "<created>2026-08-02</created>"}, {"source_id": "source.frontier.arxiv-2608-01220", "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "start": 2284, "end": 2346, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2608-00959", "target_kind": "node", "target_sha256": "cc8190458a87f0e09885708954ef5b3680081f57bbec918a8304c0c9ee54184b", "canonical_record": {"id": "claim.frontier.arxiv-2608-00959", "label": "MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-00959", "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"}, {"id": "arxiv:2608.00959", "title": "arXiv:2608.00959", "url": "https://arxiv.org/abs/2608.00959"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-02", "source_ids": ["source.frontier.arxiv-2608-00959"]}}, "statement": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"", "scope": {"population": "The study reported in arXiv:2608.00959", "time": "2026-08-02", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2608-00959", "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "start": 2679, "end": 2971, "quote": "A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence."}, {"source_id": "source.frontier.arxiv-2608-00959", "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "start": 1084, "end": 1113, "quote": "<created>2026-08-02</created>"}, {"source_id": "source.frontier.arxiv-2608-00959", "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "start": 1568, "end": 1630, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-17248", "target_kind": "node", "target_sha256": "1fdd859155a6a88a26146ead48d0b0144682e4825cf11c0b2bbee433a92a3008", "canonical_record": {"id": "claim.frontier.arxiv-2607-17248", "label": "Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-17248", "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"}, {"id": "arxiv:2607.17248", "title": "arXiv:2607.17248", "url": "https://arxiv.org/abs/2607.17248"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-31", "source_ids": ["source.frontier.arxiv-2607-17248"]}}, "statement": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"", "scope": {"population": "The study reported in arXiv:2607.17248", "time": "2026-07-31", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-17248", "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "start": 3687, "end": 3897, "quote": "The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios."}, {"source_id": "source.frontier.arxiv-2607-17248", "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "start": 1004, "end": 1033, "quote": "<created>2026-07-31</created>"}, {"source_id": "source.frontier.arxiv-2607-17248", "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "start": 2208, "end": 2270, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-14144", "target_kind": "node", "target_sha256": "ec328db9ea9fa05f78e82e06ffa78077eea48cf02291ed634c20ee162f41cd4f", "canonical_record": {"id": "claim.frontier.arxiv-2607-14144", "label": "The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-14144", "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"}, {"id": "arxiv:2607.14144", "title": "arXiv:2607.14144", "url": "https://arxiv.org/abs/2607.14144"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-31", "source_ids": ["source.frontier.arxiv-2607-14144"]}}, "statement": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "scope": {"population": "The study reported in arXiv:2607.14144", "time": "2026-07-31", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-14144", "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "start": 3465, "end": 3703, "quote": "We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture."}, {"source_id": "source.frontier.arxiv-2607-14144", "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "start": 1044, "end": 1073, "quote": "<created>2026-07-31</created>"}, {"source_id": "source.frontier.arxiv-2607-14144", "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "start": 2387, "end": 2449, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-28833", "target_kind": "node", "target_sha256": "2f1fc64b249d57aed7c4731d7d0f33bcf58db73a2d62c06759ae838acca89ccf", "canonical_record": {"id": "claim.frontier.arxiv-2607-28833", "label": "Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28833", "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28833", "title": "arXiv:2607.28833", "url": "https://arxiv.org/abs/2607.28833"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28833"]}}, "statement": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"", "scope": {"population": "The study reported in arXiv:2607.28833", "time": "2026-07-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-28833", "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "start": 2903, "end": 3066, "quote": "We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%."}, {"source_id": "source.frontier.arxiv-2607-28833", "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "start": 1004, "end": 1033, "quote": "<created>2026-07-30</created>"}, {"source_id": "source.frontier.arxiv-2607-28833", "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "start": 2094, "end": 2156, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-28780", "target_kind": "node", "target_sha256": "f1b29633f5a9da54579e1b85dd2d21ca4f70cb73d2eb8aab5d92ae9010191d47", "canonical_record": {"id": "claim.frontier.arxiv-2607-28780", "label": "Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28780", "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28780", "title": "arXiv:2607.28780", "url": "https://arxiv.org/abs/2607.28780"}, {"id": "doi:10.1002/mar.70105", "title": "doi:10.1002/mar.70105", "url": "https://doi.org/10.1002/mar.70105"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28780"]}}, "statement": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"", "scope": {"population": "The study reported in arXiv:2607.28780", "time": "2026-07-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-28780", "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "start": 3025, "end": 3206, "quote": "We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects."}, {"source_id": "source.frontier.arxiv-2607-28780", "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "start": 1090, "end": 1119, "quote": "<created>2026-07-30</created>"}, {"source_id": "source.frontier.arxiv-2607-28780", "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "start": 1880, "end": 1942, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-28276", "target_kind": "node", "target_sha256": "e438ccf59a58e083b4cde740d8989d36e9ddbfe612bf00269fc14b9c764e9108", "canonical_record": {"id": "claim.frontier.arxiv-2607-28276", "label": "Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28276", "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28276", "title": "arXiv:2607.28276", "url": "https://arxiv.org/abs/2607.28276"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28276"]}}, "statement": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"", "scope": {"population": "The study reported in arXiv:2607.28276", "time": "2026-07-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-28276", "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "start": 3122, "end": 3360, "quote": "When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes."}, {"source_id": "source.frontier.arxiv-2607-28276", "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "start": 1132, "end": 1161, "quote": "<created>2026-07-30</created>"}, {"source_id": "source.frontier.arxiv-2607-28276", "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "start": 1859, "end": 1921, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-28224", "target_kind": "node", "target_sha256": "08bcee38ef32f755fbc0c8ad1f648310879b82d5496957dc1d1e9cbf160b4c07", "canonical_record": {"id": "claim.frontier.arxiv-2607-28224", "label": "CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28224", "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28224", "title": "arXiv:2607.28224", "url": "https://arxiv.org/abs/2607.28224"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28224"]}}, "statement": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"", "scope": {"population": "The study reported in arXiv:2607.28224", "time": "2026-07-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-28224", "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "start": 2490, "end": 2801, "quote": "First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions."}, {"source_id": "source.frontier.arxiv-2607-28224", "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "start": 964, "end": 993, "quote": "<created>2026-07-30</created>"}, {"source_id": "source.frontier.arxiv-2607-28224", "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "start": 1841, "end": 1903, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-28185", "target_kind": "node", "target_sha256": "a0573ef8da233252c54dad14f56441cb2288d5e671d3bc72be6b13962e66f133", "canonical_record": {"id": "claim.frontier.arxiv-2607-28185", "label": "Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28185", "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28185", "title": "arXiv:2607.28185", "url": "https://arxiv.org/abs/2607.28185"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28185"]}}, "statement": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "scope": {"population": "The study reported in arXiv:2607.28185", "time": "2026-07-30", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-28185", "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "start": 2222, "end": 2430, "quote": "Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure."}, {"source_id": "source.frontier.arxiv-2607-28185", "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "start": 1084, "end": 1113, "quote": "<created>2026-07-30</created>"}, {"source_id": "source.frontier.arxiv-2607-28185", "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "start": 1546, "end": 1608, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-26209", "target_kind": "node", "target_sha256": "3e3a639fce49c30240c8dffe2bfbb6757086c8e52e57f7cffe603d63d38d7ec3", "canonical_record": {"id": "claim.frontier.arxiv-2607-26209", "label": "Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-26209", "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"}, {"id": "arxiv:2607.26209", "title": "arXiv:2607.26209", "url": "https://arxiv.org/abs/2607.26209"}, {"id": "doi:10.1109/ojcoms.2026.3717118", "title": "doi:10.1109/ojcoms.2026.3717118", "url": "https://doi.org/10.1109/ojcoms.2026.3717118"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-28", "source_ids": ["source.frontier.arxiv-2607-26209"]}}, "statement": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"", "scope": {"population": "The study reported in arXiv:2607.26209", "time": "2026-07-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-26209", "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "start": 3820, "end": 4137, "quote": "The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere."}, {"source_id": "source.frontier.arxiv-2607-26209", "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "start": 964, "end": 993, "quote": "<created>2026-07-28</created>"}, {"source_id": "source.frontier.arxiv-2607-26209", "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "start": 2432, "end": 2494, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-25526", "target_kind": "node", "target_sha256": "b1164cfef081634e80f58056041e08056c9b83bbad91b3a6f82cf28548ddcc2b", "canonical_record": {"id": "claim.frontier.arxiv-2607-25526", "label": "Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-25526", "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"}, {"id": "arxiv:2607.25526", "title": "arXiv:2607.25526", "url": "https://arxiv.org/abs/2607.25526"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-28", "source_ids": ["source.frontier.arxiv-2607-25526"]}}, "statement": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "scope": {"population": "The study reported in arXiv:2607.25526", "time": "2026-07-28", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-25526", "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "start": 2524, "end": 2808, "quote": "The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained."}, {"source_id": "source.frontier.arxiv-2607-25526", "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "start": 960, "end": 989, "quote": "<created>2026-07-28</created>"}, {"source_id": "source.frontier.arxiv-2607-25526", "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "start": 1397, "end": 1459, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-25081", "target_kind": "node", "target_sha256": "b90de23cd11d00beb480dd4d7586292f01aad28b48fec4b4505bfb13cc4c9563", "canonical_record": {"id": "claim.frontier.arxiv-2607-25081", "label": "Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-25081", "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"}, {"id": "arxiv:2607.25081", "title": "arXiv:2607.25081", "url": "https://arxiv.org/abs/2607.25081"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-25081"]}}, "statement": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"", "scope": {"population": "The study reported in arXiv:2607.25081", "time": "2026-07-27", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-25081", "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "start": 2630, "end": 2866, "quote": "The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables."}, {"source_id": "source.frontier.arxiv-2607-25081", "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "start": 974, "end": 1003, "quote": "<created>2026-07-27</created>"}, {"source_id": "source.frontier.arxiv-2607-25081", "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "start": 1688, "end": 1750, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-24423", "target_kind": "node", "target_sha256": "6dca6dc937e903d46d9bc8faf05ead44eeca3c790d69a1881a0251f46e3d7186", "canonical_record": {"id": "claim.frontier.arxiv-2607-24423", "label": "Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-24423", "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"}, {"id": "arxiv:2607.24423", "title": "arXiv:2607.24423", "url": "https://arxiv.org/abs/2607.24423"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-24423"]}}, "statement": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"", "scope": {"population": "The study reported in arXiv:2607.24423", "time": "2026-07-27", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-24423", "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "start": 4038, "end": 4197, "quote": "These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration."}, {"source_id": "source.frontier.arxiv-2607-24423", "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "start": 1058, "end": 1087, "quote": "<created>2026-07-27</created>"}, {"source_id": "source.frontier.arxiv-2607-24423", "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "start": 2357, "end": 2419, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-24360", "target_kind": "node", "target_sha256": "ac1a6108041d1dd66eec9657ec654795b49ceb849592c814f1eafa5968d0c712", "canonical_record": {"id": "claim.frontier.arxiv-2607-24360", "label": "Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-24360", "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"}, {"id": "arxiv:2607.24360", "title": "arXiv:2607.24360", "url": "https://arxiv.org/abs/2607.24360"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-24360"]}}, "statement": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"", "scope": {"population": "The study reported in arXiv:2607.24360", "time": "2026-07-27", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-24360", "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "start": 2541, "end": 2630, "quote": "Our findings reveal that manipulative narratives dominate when early spreaders hold them."}, {"source_id": "source.frontier.arxiv-2607-24360", "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "start": 1000, "end": 1029, "quote": "<created>2026-07-27</created>"}, {"source_id": "source.frontier.arxiv-2607-24360", "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "start": 1906, "end": 1968, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.claim.frontier.arxiv-2607-22049", "target_kind": "node", "target_sha256": "787438a2a1978d18fca62f04ba9b03c152778f7a805b0e6417fe10473cd97bbe", "canonical_record": {"id": "claim.frontier.arxiv-2607-22049", "label": "ELSA as an asset to the EU Quantum Act: A position paper", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-22049", "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"}, {"id": "arxiv:2607.22049", "title": "arXiv:2607.22049", "url": "https://arxiv.org/abs/2607.22049"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-24", "source_ids": ["source.frontier.arxiv-2607-22049"]}}, "statement": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"", "scope": {"population": "The study reported in arXiv:2607.22049", "time": "2026-07-24", "assumptions": "Authors' own reported finding, quoted verbatim from the retained abstract; recent publications and preprints may not be peer reviewed", "uncertainty": "Single recent publication; no replication, consensus, priority or current-leadership claim. Frontier placement is recency only (owner waiver code-provenance-frontier-public-results)", "units": null, "quantifiers": "Only what the quoted sentence states"}, "support": [{"source_id": "source.frontier.arxiv-2607-22049", "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "start": 3108, "end": 3171, "quote": "Together, we show that ELSA is not only about mitigating risks."}, {"source_id": "source.frontier.arxiv-2607-22049", "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "start": 974, "end": 1003, "quote": "<created>2026-07-24</created>"}, {"source_id": "source.frontier.arxiv-2607-22049", "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "start": 1683, "end": 1745, "quote": "<license>http://creativecommons.org/licenses/by/4.0/</license>"}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-21653.concept.nist.performance", "target_kind": "edge", "target_sha256": "6c52cbb353c3860106387bb725f91b15c84c080339efe63889a54f094753383b", "canonical_record": {"source": "claim.frontier.arxiv-2610-21653", "target": "concept.nist.performance", "type": "related", "summary": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "sources": [{"id": "source.frontier.arxiv-2610-21653", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "scope": {"population": "arXiv:2610.21653 abstract", "time": "2026-10-15", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-21653", "source_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "start": 2482, "end": 2833, "quote": "In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-19722.concept.nist.linearprobng", "target_kind": "edge", "target_sha256": "7eecfd6e62120b32e3cafc90725ff730f46cdcf8647b9a6ff67e6a530d434441", "canonical_record": {"source": "claim.frontier.arxiv-2610-19722", "target": "concept.nist.linearprobng", "type": "related", "summary": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"", "sources": [{"id": "source.frontier.arxiv-2610-19722", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"", "scope": {"population": "arXiv:2610.19722 abstract", "time": "2026-10-14", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-19722", "source_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "start": 2494, "end": 2739, "quote": "Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-19515.concept.nist.optimization", "target_kind": "edge", "target_sha256": "5ac5de4037bb606f6bce5d6d147b789233ebf4ee8d02810774971f2b565ce793", "canonical_record": {"source": "claim.frontier.arxiv-2610-19515", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"", "sources": [{"id": "source.frontier.arxiv-2610-19515", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"", "scope": {"population": "arXiv:2610.19515 abstract", "time": "2026-10-14", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-19515", "source_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "start": 2964, "end": 3157, "quote": "To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-19137.concept.eia.carbon-intensity", "target_kind": "edge", "target_sha256": "65f34a3e4de1921934fce958fbf3de103cf158d4563c30e2e926a680ffd46924", "canonical_record": {"source": "claim.frontier.arxiv-2610-19137", "target": "concept.eia.carbon-intensity", "type": "related", "summary": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"", "sources": [{"id": "source.frontier.arxiv-2610-19137", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"", "scope": {"population": "arXiv:2610.19137 abstract", "time": "2026-10-13", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-19137", "source_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "start": 2109, "end": 2266, "quote": "Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-17295.method.nist.dynamicprog", "target_kind": "edge", "target_sha256": "775808a409b91ec514d386a1058df8db284a414f0f89eeabc5d424b888319cb2", "canonical_record": {"source": "claim.frontier.arxiv-2610-17295", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"", "sources": [{"id": "source.frontier.arxiv-2610-17295", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"", "scope": {"population": "arXiv:2610.17295 abstract", "time": "2026-10-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-17295", "source_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "start": 2774, "end": 2977, "quote": "We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-16273.field.neuroscience", "target_kind": "edge", "target_sha256": "331f68716f56caf2cc1f64b7b17c31b7f4a000a87e691e6e5bd0072a3a9ffaf4", "canonical_record": {"source": "claim.frontier.arxiv-2610-16273", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "sources": [{"id": "source.frontier.arxiv-2610-16273", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "scope": {"population": "arXiv:2610.16273 abstract", "time": "2026-10-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-16273", "source_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "start": 2282, "end": 2750, "quote": "Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-16259.field.information-theory", "target_kind": "edge", "target_sha256": "829c50885f9d6b8d8c3621b4faa34a5e596bf54e3f277ddf4369316d8a083416", "canonical_record": {"source": "claim.frontier.arxiv-2610-16259", "target": "field.information-theory", "type": "related", "summary": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"", "sources": [{"id": "source.frontier.arxiv-2610-16259", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"", "scope": {"population": "arXiv:2610.16259 abstract", "time": "2026-10-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-16259", "source_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "start": 1961, "end": 2143, "quote": "Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-15072.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "8efda7b9f8e94cf895bd2e87e3ae2f48d850aa97c89f73d1a0f1cbae59c119fc", "canonical_record": {"source": "claim.frontier.arxiv-2610-15072", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"", "sources": [{"id": "source.frontier.arxiv-2610-15072", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"", "scope": {"population": "arXiv:2610.15072 abstract", "time": "2026-10-10", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-15072", "source_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "start": 3634, "end": 3794, "quote": "To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-15052.method.nist.simulatedannealing", "target_kind": "edge", "target_sha256": "75ab44c41fa2aa7a69b4d8fa061ee87bef74f9c3bcdb296158fea5a50dbabd12", "canonical_record": {"source": "claim.frontier.arxiv-2610-15052", "target": "method.nist.simulatedannealing", "type": "related", "summary": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"", "sources": [{"id": "source.frontier.arxiv-2610-15052", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"", "scope": {"population": "arXiv:2610.15052 abstract", "time": "2026-10-10", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-15052", "source_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "start": 2266, "end": 2426, "quote": "On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-13424.concept.nist.optimalsoltn", "target_kind": "edge", "target_sha256": "079868db045bc283e82e361b1cf57daf828885c2772060941780296bb6d0b7cb", "canonical_record": {"source": "claim.frontier.arxiv-2610-13424", "target": "concept.nist.optimalsoltn", "type": "related", "summary": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "sources": [{"id": "source.frontier.arxiv-2610-13424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "scope": {"population": "arXiv:2610.13424 abstract", "time": "2026-10-09", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-13424", "source_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "start": 2131, "end": 2322, "quote": "We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-13402.field.information-theory", "target_kind": "edge", "target_sha256": "5dbcabdc37d02bec3ccadfaa7375107623de9bebcd60e23347c78d52ae2ae99b", "canonical_record": {"source": "claim.frontier.arxiv-2610-13402", "target": "field.information-theory", "type": "related", "summary": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"", "sources": [{"id": "source.frontier.arxiv-2610-13402", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"", "scope": {"population": "arXiv:2610.13402 abstract", "time": "2026-10-09", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-13402", "source_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "start": 2176, "end": 2374, "quote": "By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-12779.concept.nist.stronglyconnectedcompo", "target_kind": "edge", "target_sha256": "ca881d45dfea19f0f4d1689792f3c7ae8c50722a6bf04293982520cbe71ce19a", "canonical_record": {"source": "claim.frontier.arxiv-2610-12779", "target": "concept.nist.stronglyconnectedcompo", "type": "related", "summary": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "sources": [{"id": "source.frontier.arxiv-2610-12779", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "scope": {"population": "arXiv:2610.12779 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-12779", "source_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "start": 2510, "end": 2854, "quote": "We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-12604.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "14c2f0dad240c4d7442124b6c0f263eb37dc67dfb71e2f7e68cd2f9d95babd15", "canonical_record": {"source": "claim.frontier.arxiv-2610-12604", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "sources": [{"id": "source.frontier.arxiv-2610-12604", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "scope": {"population": "arXiv:2610.12604 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-12604", "source_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "start": 2287, "end": 2368, "quote": "Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-12592.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "11b48931ed746a55634fe888b721f0428ab3ac49505d2220999f8da5dcdd5b63", "canonical_record": {"source": "claim.frontier.arxiv-2610-12592", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"", "sources": [{"id": "source.frontier.arxiv-2610-12592", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"", "scope": {"population": "arXiv:2610.12592 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-12592", "source_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "start": 2790, "end": 3101, "quote": "The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE)."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-12038.concept.nist.binarytree", "target_kind": "edge", "target_sha256": "786c0410ff5cc9624a32a7c8ef50de145e7fe2d0bc05fef76b9c571b90ab7fe1", "canonical_record": {"source": "claim.frontier.arxiv-2610-12038", "target": "concept.nist.binarytree", "type": "related", "summary": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"", "sources": [{"id": "source.frontier.arxiv-2610-12038", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"", "scope": {"population": "arXiv:2610.12038 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-12038", "source_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "start": 2082, "end": 2436, "quote": "This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-11869.concept.nist.objective", "target_kind": "edge", "target_sha256": "c1c93b38d6e47f170dcde510947d0d3fb1d38243d44d2ef627100b0505a79050", "canonical_record": {"source": "claim.frontier.arxiv-2610-11869", "target": "concept.nist.objective", "type": "related", "summary": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"", "sources": [{"id": "source.frontier.arxiv-2610-11869", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"", "scope": {"population": "arXiv:2610.11869 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-11869", "source_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "start": 2320, "end": 2421, "quote": "An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-11359.concept.nist.optimization", "target_kind": "edge", "target_sha256": "8e4ed8f65551d000ad2f1d0f672269c98285e6414ff835d0a864d12f79109db4", "canonical_record": {"source": "claim.frontier.arxiv-2610-11359", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"", "sources": [{"id": "source.frontier.arxiv-2610-11359", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"", "scope": {"population": "arXiv:2610.11359 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-11359", "source_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "start": 2445, "end": 2666, "quote": "Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04959.concept.nist.flownetwork", "target_kind": "edge", "target_sha256": "9fcd2dbcd4e1440767a958f0313d13ad345f9d85ca160b20ec7b62391961a295", "canonical_record": {"source": "claim.frontier.arxiv-2610-04959", "target": "concept.nist.flownetwork", "type": "related", "summary": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"", "sources": [{"id": "source.frontier.arxiv-2610-04959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"", "scope": {"population": "arXiv:2610.04959 abstract", "time": "2026-10-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04959", "source_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "start": 2845, "end": 3022, "quote": "While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-09266.concept.nist.optimalsoltn", "target_kind": "edge", "target_sha256": "95603e652c1ff02230684988deb5c9ad74fb860f4d7d7dc7ac5122d5cc54673c", "canonical_record": {"source": "claim.frontier.arxiv-2610-09266", "target": "concept.nist.optimalsoltn", "type": "related", "summary": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "sources": [{"id": "source.frontier.arxiv-2610-09266", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "scope": {"population": "arXiv:2610.09266 abstract", "time": "2026-10-07", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-09266", "source_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "start": 3311, "end": 3543, "quote": "Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-09080.method.nist.exhaustivesearch", "target_kind": "edge", "target_sha256": "1e1160c97bfc9883df2db67b1a69e296911399de06c589edad65ee2e175342b3", "canonical_record": {"source": "claim.frontier.arxiv-2610-09080", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"", "sources": [{"id": "source.frontier.arxiv-2610-09080", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"", "scope": {"population": "arXiv:2610.09080 abstract", "time": "2026-10-06", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-09080", "source_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "start": 2479, "end": 2656, "quote": "The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-09010.concept.nist.optimization", "target_kind": "edge", "target_sha256": "cfcef2c8ea0a1f3f36ad2aa5f87966c321d92d4eb047fdbac321d6c69616310a", "canonical_record": {"source": "claim.frontier.arxiv-2610-09010", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"", "sources": [{"id": "source.frontier.arxiv-2610-09010", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"", "scope": {"population": "arXiv:2610.09010 abstract", "time": "2026-10-06", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-09010", "source_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "start": 2858, "end": 3033, "quote": "The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-08744.method.nist.exhaustivesearch", "target_kind": "edge", "target_sha256": "34ab545a3d46057a832b840f0708925c7fc5b44ccd2cb53be8ebd322a2597a4d", "canonical_record": {"source": "claim.frontier.arxiv-2610-08744", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "sources": [{"id": "source.frontier.arxiv-2610-08744", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "scope": {"population": "arXiv:2610.08744 abstract", "time": "2026-10-06", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-08744", "source_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "start": 2897, "end": 3062, "quote": "Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-07616.method.nist.randomsearch", "target_kind": "edge", "target_sha256": "d424e04812d75c1602b74fa1578560a256e2d61493f28f405359034821a6896b", "canonical_record": {"source": "claim.frontier.arxiv-2610-07616", "target": "method.nist.randomsearch", "type": "related", "summary": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "sources": [{"id": "source.frontier.arxiv-2610-07616", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "scope": {"population": "arXiv:2610.07616 abstract", "time": "2026-10-06", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-07616", "source_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "start": 2055, "end": 2165, "quote": "Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-07307.concept.nist.prisonersdilemma", "target_kind": "edge", "target_sha256": "ea2d5a86e58088fbc950e26cc8988c366be503287af370b49992819a8b8891e5", "canonical_record": {"source": "claim.frontier.arxiv-2610-07307", "target": "concept.nist.prisonersdilemma", "type": "related", "summary": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"", "sources": [{"id": "source.frontier.arxiv-2610-07307", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"", "scope": {"population": "arXiv:2610.07307 abstract", "time": "2026-10-05", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-07307", "source_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "start": 3030, "end": 3211, "quote": "The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-06601.method.nist.dynamicprog", "target_kind": "edge", "target_sha256": "083cd631d5308584d26f4e731db2100ed2393b9f1955bf4b0df8e2887a1ad43f", "canonical_record": {"source": "claim.frontier.arxiv-2610-06601", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"", "sources": [{"id": "source.frontier.arxiv-2610-06601", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"", "scope": {"population": "arXiv:2610.06601 abstract", "time": "2026-10-05", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-06601", "source_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "start": 2966, "end": 3234, "quote": "We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04776.method.nist.exhaustivesearch", "target_kind": "edge", "target_sha256": "9f5995026dd7354e0abb244a9aed300018a1287c4ecec39bf4870b89fabcb358", "canonical_record": {"source": "claim.frontier.arxiv-2610-04776", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "sources": [{"id": "source.frontier.arxiv-2610-04776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "scope": {"population": "arXiv:2610.04776 abstract", "time": "2026-10-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04776", "source_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "start": 3268, "end": 3505, "quote": "Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04697.field.neuroscience", "target_kind": "edge", "target_sha256": "2b37efcee69a5a45ddd737da1a20a2b5e4b4a8f254ac38ea0cdb4b1092a8c5cf", "canonical_record": {"source": "claim.frontier.arxiv-2610-04697", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"", "sources": [{"id": "source.frontier.arxiv-2610-04697", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"", "scope": {"population": "arXiv:2610.04697 abstract", "time": "2026-10-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04697", "source_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "start": 1632, "end": 1833, "quote": "In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04662.concept.nist.temporllogic", "target_kind": "edge", "target_sha256": "c8b7c19acd6410839be0b87fa7602dc180e4d9eabdd6e1654175c200da8ecef6", "canonical_record": {"source": "claim.frontier.arxiv-2610-04662", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"", "sources": [{"id": "source.frontier.arxiv-2610-04662", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"", "scope": {"population": "arXiv:2610.04662 abstract", "time": "2026-10-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04662", "source_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "start": 2070, "end": 2210, "quote": "Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04630.concept.eia.energy-consumption", "target_kind": "edge", "target_sha256": "6ee864e6e4d8de82908b044af002a0720e95d07b6623d4fe2f482e636efec452", "canonical_record": {"source": "claim.frontier.arxiv-2610-04630", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"", "sources": [{"id": "source.frontier.arxiv-2610-04630", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"", "scope": {"population": "arXiv:2610.04630 abstract", "time": "2026-10-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04630", "source_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "start": 2642, "end": 2883, "quote": "As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-04242.concept.nist.markovchain", "target_kind": "edge", "target_sha256": "ab3432af0492253188d8364f4c2abbeb3dd47209ca8f6519bb64d674cb7809e7", "canonical_record": {"source": "claim.frontier.arxiv-2610-04242", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"", "sources": [{"id": "source.frontier.arxiv-2610-04242", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"", "scope": {"population": "arXiv:2610.04242 abstract", "time": "2026-10-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-04242", "source_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "start": 2380, "end": 2725, "quote": "We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-06918.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "29a8363a8bcd9d4d2eb17e2ea483a1a737c4be2458790df52abe7489f4664365", "canonical_record": {"source": "claim.frontier.arxiv-2610-06918", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"", "sources": [{"id": "source.frontier.arxiv-2610-06918", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"", "scope": {"population": "arXiv:2610.06918 abstract", "time": "2026-10-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-06918", "source_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "start": 2738, "end": 3005, "quote": "We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-03964.concept.nist.optimization", "target_kind": "edge", "target_sha256": "031719b4145d0bbc7a85ebb7be1157edb1498406bf8a5949269c5db692ed87d9", "canonical_record": {"source": "claim.frontier.arxiv-2610-03964", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"", "sources": [{"id": "source.frontier.arxiv-2610-03964", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"", "scope": {"population": "arXiv:2610.03964 abstract", "time": "2026-10-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-03964", "source_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "start": 2673, "end": 2875, "quote": "A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2610-03008.field.cognitive-science", "target_kind": "edge", "target_sha256": "6b7988527fbc5ffd579c6cc2cd51c1b1ed0041185357398ea94f41ed60034a7b", "canonical_record": {"source": "claim.frontier.arxiv-2610-03008", "target": "field.cognitive-science", "type": "related", "summary": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"", "sources": [{"id": "source.frontier.arxiv-2610-03008", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"", "scope": {"population": "arXiv:2610.03008 abstract", "time": "2026-10-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-03008", "source_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "start": 2146, "end": 2321, "quote": "Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-39776.concept.nist.optimization", "target_kind": "edge", "target_sha256": "e569cfefa8896e225ee769fcccc6d5787e6a4d11556d3d4e0e1ceb43db9c0f80", "canonical_record": {"source": "claim.frontier.arxiv-2609-39776", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"", "sources": [{"id": "source.frontier.arxiv-2609-39776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"", "scope": {"population": "arXiv:2609.39776 abstract", "time": "2026-09-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-39776", "source_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "start": 3138, "end": 3296, "quote": "The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-21813.concept.nist.probesequenc", "target_kind": "edge", "target_sha256": "7b8a7875a41ead85da7ec454cf5c43224cfaa80ac6be876dd7731e5e628466ef", "canonical_record": {"source": "claim.frontier.arxiv-2609-21813", "target": "concept.nist.probesequenc", "type": "related", "summary": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"", "sources": [{"id": "source.frontier.arxiv-2609-21813", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"", "scope": {"population": "arXiv:2609.21813 abstract", "time": "2026-09-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-21813", "source_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "start": 2758, "end": 2865, "quote": "On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-36354.field.ai", "target_kind": "edge", "target_sha256": "191e7f272a45ada4cb08145a73bcb42df1e1f4e2e7b9ddaafbd3438ea9bf7a6e", "canonical_record": {"source": "claim.frontier.arxiv-2609-36354", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"", "sources": [{"id": "source.frontier.arxiv-2609-36354", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"", "scope": {"population": "arXiv:2609.36354 abstract", "time": "2026-09-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-36354", "source_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "start": 2203, "end": 2384, "quote": "Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-35424.concept.nist.optimization", "target_kind": "edge", "target_sha256": "dbc4f58751e99e4694397a21ccc362c382a612194a51ea1afc6614c19e8a0419", "canonical_record": {"source": "claim.frontier.arxiv-2609-35424", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"", "sources": [{"id": "source.frontier.arxiv-2609-35424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"", "scope": {"population": "arXiv:2609.35424 abstract", "time": "2026-09-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-35424", "source_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "start": 3194, "end": 3482, "quote": "To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-35246.concept.eia.distribution-system", "target_kind": "edge", "target_sha256": "58df9f39e461a31db9ae12399d63fea358f4ba08e5527bd2568fe3b98e4cd9fb", "canonical_record": {"source": "claim.frontier.arxiv-2609-35246", "target": "concept.eia.distribution-system", "type": "related", "summary": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"", "sources": [{"id": "source.frontier.arxiv-2609-35246", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"", "scope": {"population": "arXiv:2609.35246 abstract", "time": "2026-09-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-35246", "source_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "start": 2871, "end": 3115, "quote": "To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-32315.field.neuroscience", "target_kind": "edge", "target_sha256": "beb1c296d511195cfc6709e582be598becb3d95ec3f853573bd3e028b054a9e2", "canonical_record": {"source": "claim.frontier.arxiv-2609-32315", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"", "sources": [{"id": "source.frontier.arxiv-2609-32315", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"", "scope": {"population": "arXiv:2609.32315 abstract", "time": "2026-09-26", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-32315", "source_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "start": 2418, "end": 2680, "quote": "This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-29972.concept.mesh.d000088562", "target_kind": "edge", "target_sha256": "315c9f8cbcc1fbdbc31815e10fd0fa4f8d34e33d7d2788e7852e4a6975b9b07e", "canonical_record": {"source": "claim.frontier.arxiv-2609-29972", "target": "concept.mesh.d000088562", "type": "related", "summary": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"", "sources": [{"id": "source.frontier.arxiv-2609-29972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"", "scope": {"population": "arXiv:2609.29972 abstract", "time": "2026-09-24", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-29972", "source_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "start": 2639, "end": 2709, "quote": "Without therapy, the model approaches a state of persistent infection."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-29832.concept.eia.motor-speed", "target_kind": "edge", "target_sha256": "bf22c5a439f3714e92fb13fb9565e9ea06c8086d586c63c79ba8e7e022c97012", "canonical_record": {"source": "claim.frontier.arxiv-2609-29832", "target": "concept.eia.motor-speed", "type": "related", "summary": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "sources": [{"id": "source.frontier.arxiv-2609-29832", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "scope": {"population": "arXiv:2609.29832 abstract", "time": "2026-09-24", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-29832", "source_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "start": 2930, "end": 3075, "quote": "Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-28815.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "163b542ce76fd7e9c904972938cc8354ce361525d9b494957d2cb6a146b10252", "canonical_record": {"source": "claim.frontier.arxiv-2609-28815", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "sources": [{"id": "source.frontier.arxiv-2609-28815", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "scope": {"population": "arXiv:2609.28815 abstract", "time": "2026-09-23", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-28815", "source_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "start": 2932, "end": 3156, "quote": "We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-26924.field.ai", "target_kind": "edge", "target_sha256": "377fb68c2fd39f56ef2113fa4ee4c8eb6443e7358dd52af2051100057b6b8968", "canonical_record": {"source": "claim.frontier.arxiv-2609-26924", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"", "sources": [{"id": "source.frontier.arxiv-2609-26924", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"", "scope": {"population": "arXiv:2609.26924 abstract", "time": "2026-09-22", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-26924", "source_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "start": 14038, "end": 14192, "quote": "Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-25847.concept.eia.energy-consumption", "target_kind": "edge", "target_sha256": "2424e0d6156cfe4f1377689491902acd5996b4b3650c4b24e30710126913ceed", "canonical_record": {"source": "claim.frontier.arxiv-2609-25847", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"", "sources": [{"id": "source.frontier.arxiv-2609-25847", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"", "scope": {"population": "arXiv:2609.25847 abstract", "time": "2026-09-22", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-25847", "source_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "start": 3346, "end": 3606, "quote": "This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-25701.concept.nist.polynomialtm", "target_kind": "edge", "target_sha256": "4421fe4a5d9222d92a03f8db20b48cca17bf89d9f37bdbdf3494833d57d2b402", "canonical_record": {"source": "claim.frontier.arxiv-2609-25701", "target": "concept.nist.polynomialtm", "type": "related", "summary": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"", "sources": [{"id": "source.frontier.arxiv-2609-25701", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"", "scope": {"population": "arXiv:2609.25701 abstract", "time": "2026-09-22", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-25701", "source_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "start": 2601, "end": 2800, "quote": "We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-25437.concept.eia.electricity-generation", "target_kind": "edge", "target_sha256": "283cab111ca494566a586adaa628806c46f641acc89527be8d0671a3687e85e2", "canonical_record": {"source": "claim.frontier.arxiv-2609-25437", "target": "concept.eia.electricity-generation", "type": "related", "summary": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"", "sources": [{"id": "source.frontier.arxiv-2609-25437", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"", "scope": {"population": "arXiv:2609.25437 abstract", "time": "2026-09-21", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-25437", "source_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "start": 2221, "end": 2315, "quote": "Data centers consume water for cooling (direct) and through electricity generation (indirect)."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-05763.concept.eia.electric-vehicle-ev", "target_kind": "edge", "target_sha256": "6e7d0e064cf7fd087a6f253f3c0cde055f45d7a82f8b38402f90473f660d58be", "canonical_record": {"source": "claim.frontier.arxiv-2609-05763", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"", "sources": [{"id": "source.frontier.arxiv-2609-05763", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"", "scope": {"population": "arXiv:2609.05763 abstract", "time": "2026-09-21", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-05763", "source_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "start": 3993, "end": 4226, "quote": "At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-23703.field.computer-science", "target_kind": "edge", "target_sha256": "cb64767c458d409ae2997130938492ef939c060e726b9ee8624a2e9145b53680", "canonical_record": {"source": "claim.frontier.arxiv-2609-23703", "target": "field.computer-science", "type": "related", "summary": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"", "sources": [{"id": "source.frontier.arxiv-2609-23703", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"", "scope": {"population": "arXiv:2609.23703 abstract", "time": "2026-09-20", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-23703", "source_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "start": 1971, "end": 2464, "quote": "Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-23199.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "91c57e795df9ff36e5f5037ddebdf6baadb3f19537cf46a9a3e4cc32705c8de0", "canonical_record": {"source": "claim.frontier.arxiv-2609-23199", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "sources": [{"id": "source.frontier.arxiv-2609-23199", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "scope": {"population": "arXiv:2609.23199 abstract", "time": "2026-09-19", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-23199", "source_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "start": 2628, "end": 2856, "quote": "Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-23085.concept.eia.energy-consumption", "target_kind": "edge", "target_sha256": "606a75a65f1a6cd6c6e34901001d5a1176b257088e8a9c0c975a1286752da824", "canonical_record": {"source": "claim.frontier.arxiv-2609-23085", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"", "sources": [{"id": "source.frontier.arxiv-2609-23085", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"", "scope": {"population": "arXiv:2609.23085 abstract", "time": "2026-09-19", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-23085", "source_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "start": 2643, "end": 2878, "quote": "While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-22775.field.ai", "target_kind": "edge", "target_sha256": "efe22ba3704dc06178130ab25bf44697dc09a9ac568d9065e6caf160b6f0a955", "canonical_record": {"source": "claim.frontier.arxiv-2609-22775", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"", "sources": [{"id": "source.frontier.arxiv-2609-22775", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"", "scope": {"population": "arXiv:2609.22775 abstract", "time": "2026-09-19", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-22775", "source_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "start": 1751, "end": 1926, "quote": "Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-22615.method.nist.chinesermndr", "target_kind": "edge", "target_sha256": "ef16c225ab39ae352c6ee76cc50d429483d28539edc81fc8727973c07b88434d", "canonical_record": {"source": "claim.frontier.arxiv-2609-22615", "target": "method.nist.chinesermndr", "type": "related", "summary": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"", "sources": [{"id": "source.frontier.arxiv-2609-22615", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"", "scope": {"population": "arXiv:2609.22615 abstract", "time": "2026-09-18", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-22615", "source_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "start": 1654, "end": 1730, "quote": "The Chinese remainder theorem (CRT) is highly sensitive to remainder errors."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-21966.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "a53879bea0885fe0841074331ff28771ec205140bcf14a8e505202070118f54f", "canonical_record": {"source": "claim.frontier.arxiv-2609-21966", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"", "sources": [{"id": "source.frontier.arxiv-2609-21966", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"", "scope": {"population": "arXiv:2609.21966 abstract", "time": "2026-09-18", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-21966", "source_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "start": 2980, "end": 3218, "quote": "For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata)."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-21270.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "3db67063c0dd01a006e5b44fd60dc92480f7c882eeccd702337f9ff62baade62", "canonical_record": {"source": "claim.frontier.arxiv-2609-21270", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "sources": [{"id": "source.frontier.arxiv-2609-21270", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "scope": {"population": "arXiv:2609.21270 abstract", "time": "2026-09-18", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-21270", "source_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "start": 2195, "end": 2428, "quote": "For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-21093.concept.nist.markovchain", "target_kind": "edge", "target_sha256": "a8505d329f1e58fb221477806177803396b0de82973b425936c0c13b2908175d", "canonical_record": {"source": "claim.frontier.arxiv-2609-21093", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"", "sources": [{"id": "source.frontier.arxiv-2609-21093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"", "scope": {"population": "arXiv:2609.21093 abstract", "time": "2026-09-17", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-21093", "source_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "start": 2204, "end": 2379, "quote": "We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-21057.concept.nist.optimization", "target_kind": "edge", "target_sha256": "e0f5d506298504f027353206d0c1bf68c33e911086e2827e402fef2dbe4b2d7f", "canonical_record": {"source": "claim.frontier.arxiv-2609-21057", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "sources": [{"id": "source.frontier.arxiv-2609-21057", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "scope": {"population": "arXiv:2609.21057 abstract", "time": "2026-09-17", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-21057", "source_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "start": 2183, "end": 2620, "quote": "We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-19468.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "f78567543e793968410477d5088c29f33c9d1bd766e773987f23372d9c89c6b6", "canonical_record": {"source": "claim.frontier.arxiv-2609-19468", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"", "sources": [{"id": "source.frontier.arxiv-2609-19468", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"", "scope": {"population": "arXiv:2609.19468 abstract", "time": "2026-09-16", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-19468", "source_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "start": 4076, "end": 4307, "quote": "Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-18467.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "c4fab82e170b1cbf9e3b79e5232fde587b727bb9f11b82da772c7cfb27b1dea9", "canonical_record": {"source": "claim.frontier.arxiv-2609-18467", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "sources": [{"id": "source.frontier.arxiv-2609-18467", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "scope": {"population": "arXiv:2609.18467 abstract", "time": "2026-09-16", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-18467", "source_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "start": 2727, "end": 2880, "quote": "We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-17042.field.neuroscience", "target_kind": "edge", "target_sha256": "dc02363ab3a512aa0b5ffed8f27c92367eb37f00b2a24eef608ea27cb6e724cd", "canonical_record": {"source": "claim.frontier.arxiv-2609-17042", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"", "sources": [{"id": "source.frontier.arxiv-2609-17042", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"", "scope": {"population": "arXiv:2609.17042 abstract", "time": "2026-09-15", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-17042", "source_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "start": 1928, "end": 2107, "quote": "Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-16899.concept.eia.electric-vehicle-ev", "target_kind": "edge", "target_sha256": "4d1a267f2904efbefd538d231256be7a62d54e0c72916d5338210086996dc638", "canonical_record": {"source": "claim.frontier.arxiv-2609-16899", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"", "sources": [{"id": "source.frontier.arxiv-2609-16899", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"", "scope": {"population": "arXiv:2609.16899 abstract", "time": "2026-09-15", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-16899", "source_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "start": 2179, "end": 2447, "quote": "This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-16353.concept.nist.optimization", "target_kind": "edge", "target_sha256": "acb84603179546430e891d38aa064448b5a8284b8a348f065b1dd6c08afe7bc6", "canonical_record": {"source": "claim.frontier.arxiv-2609-16353", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"", "sources": [{"id": "source.frontier.arxiv-2609-16353", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"", "scope": {"population": "arXiv:2609.16353 abstract", "time": "2026-09-14", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-16353", "source_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "start": 2957, "end": 3069, "quote": "We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-16258.field.ai", "target_kind": "edge", "target_sha256": "92e3ea398d60b8181e350a7fc507e2786a249a283c7c40e7fd4636caa7cd737d", "canonical_record": {"source": "claim.frontier.arxiv-2609-16258", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"", "sources": [{"id": "source.frontier.arxiv-2609-16258", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"", "scope": {"population": "arXiv:2609.16258 abstract", "time": "2026-09-14", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-16258", "source_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "start": 1913, "end": 2025, "quote": "As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-05749.field.ai", "target_kind": "edge", "target_sha256": "c475703a6ecff61ca298de935ce8c0ef2cda50e1e008b981c40d25bfd6942474", "canonical_record": {"source": "claim.frontier.arxiv-2609-05749", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"", "sources": [{"id": "source.frontier.arxiv-2609-05749", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"", "scope": {"population": "arXiv:2609.05749 abstract", "time": "2026-09-13", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-05749", "source_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "start": 2033, "end": 2221, "quote": "Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-14022.field.ai", "target_kind": "edge", "target_sha256": "2bd61cee696276e68f780d1c4c4c517d0ade4408b4e61d9081d6250691311734", "canonical_record": {"source": "claim.frontier.arxiv-2609-14022", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "sources": [{"id": "source.frontier.arxiv-2609-14022", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "scope": {"population": "arXiv:2609.14022 abstract", "time": "2026-09-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-14022", "source_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "start": 4982, "end": 5211, "quote": "We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-12866.concept.nist.optimization", "target_kind": "edge", "target_sha256": "4e8b03a5a7eddd16128d4d382011bea7682b89c9857ee693f78c55dbda771c12", "canonical_record": {"source": "claim.frontier.arxiv-2609-12866", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"", "sources": [{"id": "source.frontier.arxiv-2609-12866", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"", "scope": {"population": "arXiv:2609.12866 abstract", "time": "2026-09-11", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-12866", "source_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "start": 2723, "end": 2899, "quote": "Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-12486.concept.nist.decisionproblem", "target_kind": "edge", "target_sha256": "45a9486b1a9bac493b7b6c275a536973d2f3f27983815be5ae7e519f2dd86214", "canonical_record": {"source": "claim.frontier.arxiv-2609-12486", "target": "concept.nist.decisionproblem", "type": "related", "summary": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"", "sources": [{"id": "source.frontier.arxiv-2609-12486", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"", "scope": {"population": "arXiv:2609.12486 abstract", "time": "2026-09-11", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-12486", "source_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "start": 2643, "end": 2821, "quote": "In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-12016.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "6685b270171c85d8f3defc3bb0debaf20efbd6238372294a6edeef992ae38fb5", "canonical_record": {"source": "claim.frontier.arxiv-2609-12016", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "sources": [{"id": "source.frontier.arxiv-2609-12016", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "scope": {"population": "arXiv:2609.12016 abstract", "time": "2026-09-10", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-12016", "source_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "start": 2518, "end": 2870, "quote": "We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-11530.field.neuroscience", "target_kind": "edge", "target_sha256": "f0da5d2ffbd8cff94f8825e3401d0bfb310ea6240e5c8eb94b6c2aa4899f12fc", "canonical_record": {"source": "claim.frontier.arxiv-2609-11530", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"", "sources": [{"id": "source.frontier.arxiv-2609-11530", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"", "scope": {"population": "arXiv:2609.11530 abstract", "time": "2026-09-10", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-11530", "source_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "start": 3122, "end": 3362, "quote": "Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-08218.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "6e0a91e51501b51399997367025186f6057485022a9985818f24ff4e53c10504", "canonical_record": {"source": "claim.frontier.arxiv-2609-08218", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"", "sources": [{"id": "source.frontier.arxiv-2609-08218", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"", "scope": {"population": "arXiv:2609.08218 abstract", "time": "2026-09-09", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-08218", "source_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "start": 1964, "end": 2181, "quote": "While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-06163.concept.nist.optimization", "target_kind": "edge", "target_sha256": "e479c14bdbe532ba60fd14e19a47504001d9389860f07b71e6052b43bcaf5df7", "canonical_record": {"source": "claim.frontier.arxiv-2609-06163", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"", "sources": [{"id": "source.frontier.arxiv-2609-06163", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"", "scope": {"population": "arXiv:2609.06163 abstract", "time": "2026-09-05", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-06163", "source_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "start": 2054, "end": 2213, "quote": "To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-06066.concept.nist.performance", "target_kind": "edge", "target_sha256": "7b30dc4d838d3cd29f68470c4e6b7d1a7ef2a4f1e1d897aa549d73f5d8d473a1", "canonical_record": {"source": "claim.frontier.arxiv-2609-06066", "target": "concept.nist.performance", "type": "related", "summary": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"", "sources": [{"id": "source.frontier.arxiv-2609-06066", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"", "scope": {"population": "arXiv:2609.06066 abstract", "time": "2026-09-05", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-06066", "source_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "start": 1782, "end": 2005, "quote": "Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2609-02071.concept.nist.optimization", "target_kind": "edge", "target_sha256": "4cfe605897e390c799b63c35f692212d14a04a4806d6b3cd7a5115922e99296e", "canonical_record": {"source": "claim.frontier.arxiv-2609-02071", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"", "sources": [{"id": "source.frontier.arxiv-2609-02071", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"", "scope": {"population": "arXiv:2609.02071 abstract", "time": "2026-09-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2609-02071", "source_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "start": 2033, "end": 2333, "quote": "Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-31034.field.ai", "target_kind": "edge", "target_sha256": "6469c11264b897b8bde5a73f2edec03e0a1c588afbfc284ed653bc8c7945482a", "canonical_record": {"source": "claim.frontier.arxiv-2608-31034", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"", "sources": [{"id": "source.frontier.arxiv-2608-31034", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"", "scope": {"population": "arXiv:2608.31034 abstract", "time": "2026-08-31", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-31034", "source_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "start": 2734, "end": 2874, "quote": "This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-28387.concept.eia.energy-consumption", "target_kind": "edge", "target_sha256": "c344811fedbaa657e44717a3c3b940b4eb8023beb4ab5e5c5a96b737b5e5b2f2", "canonical_record": {"source": "claim.frontier.arxiv-2608-28387", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"", "sources": [{"id": "source.frontier.arxiv-2608-28387", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"", "scope": {"population": "arXiv:2608.28387 abstract", "time": "2026-08-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-28387", "source_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "start": 3499, "end": 3646, "quote": "We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-27536.concept.nist.prisonersdilemma", "target_kind": "edge", "target_sha256": "b2707737e921a6fbb0c79211136a4dbde8956099a28f7edb3fc5d03870cfccbf", "canonical_record": {"source": "claim.frontier.arxiv-2608-27536", "target": "concept.nist.prisonersdilemma", "type": "related", "summary": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"", "sources": [{"id": "source.frontier.arxiv-2608-27536", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"", "scope": {"population": "arXiv:2608.27536 abstract", "time": "2026-08-27", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-27536", "source_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "start": 2876, "end": 3056, "quote": "We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-26093.concept.nist.stronglynp", "target_kind": "edge", "target_sha256": "b3cf9974b37f96d386e302ddb803ca413610a16848a0c640a818e44da753693a", "canonical_record": {"source": "claim.frontier.arxiv-2608-26093", "target": "concept.nist.stronglynp", "type": "related", "summary": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"", "sources": [{"id": "source.frontier.arxiv-2608-26093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"", "scope": {"population": "arXiv:2608.26093 abstract", "time": "2026-08-26", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-26093", "source_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "start": 2952, "end": 3077, "quote": "The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-24219.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "703e50164da0b2c328fb37231a5694babe35cb61e368b0419251b3c7822cca26", "canonical_record": {"source": "claim.frontier.arxiv-2608-24219", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"", "sources": [{"id": "source.frontier.arxiv-2608-24219", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"", "scope": {"population": "arXiv:2608.24219 abstract", "time": "2026-08-25", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-24219", "source_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "start": 2154, "end": 2304, "quote": "Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-23972.concept.nist.temporllogic", "target_kind": "edge", "target_sha256": "c980908a69eb80889b8d50c897ebc814992bf331142df148cbd1871afb1afeda", "canonical_record": {"source": "claim.frontier.arxiv-2608-23972", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"", "sources": [{"id": "source.frontier.arxiv-2608-23972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"", "scope": {"population": "arXiv:2608.23972 abstract", "time": "2026-08-25", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-23972", "source_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "start": 2616, "end": 2833, "quote": "In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL)."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-21764.field.ai", "target_kind": "edge", "target_sha256": "0c294df3d3df9371e5aa59f98ea8b7d28efdb23a29865542346269ca84abab1a", "canonical_record": {"source": "claim.frontier.arxiv-2608-21764", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"", "sources": [{"id": "source.frontier.arxiv-2608-21764", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"", "scope": {"population": "arXiv:2608.21764 abstract", "time": "2026-08-22", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-21764", "source_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "start": 2344, "end": 2567, "quote": "Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-21020.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "4c1958798424d6ce7c08d3873dd9256e508955bf39a6d258f465727d30aa9d77", "canonical_record": {"source": "claim.frontier.arxiv-2608-21020", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"", "sources": [{"id": "source.frontier.arxiv-2608-21020", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"", "scope": {"population": "arXiv:2608.21020 abstract", "time": "2026-08-21", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-21020", "source_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "start": 2930, "end": 3251, "quote": "For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-20723.field.ai", "target_kind": "edge", "target_sha256": "c2289649c6cf69228a1c90be937e8ae5589479e679af228e392cb239fa412b28", "canonical_record": {"source": "claim.frontier.arxiv-2608-20723", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"", "sources": [{"id": "source.frontier.arxiv-2608-20723", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"", "scope": {"population": "arXiv:2608.20723 abstract", "time": "2026-08-21", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-20723", "source_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "start": 1649, "end": 1863, "quote": "Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-19416.concept.nist.optimization", "target_kind": "edge", "target_sha256": "a21938cf8a1590f99d08d60ba27c7119d0c7fc714caf04d3b3aaa70bf89ef9f9", "canonical_record": {"source": "claim.frontier.arxiv-2608-19416", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"", "sources": [{"id": "source.frontier.arxiv-2608-19416", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"", "scope": {"population": "arXiv:2608.19416 abstract", "time": "2026-08-19", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-19416", "source_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "start": 2790, "end": 3003, "quote": "Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-18396.method.nist.exhaustivesearch", "target_kind": "edge", "target_sha256": "aab173a9fcbbd48c97021e62280e35f3e8e1c25e037d150ff125fdd6e4a776df", "canonical_record": {"source": "claim.frontier.arxiv-2608-18396", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"", "sources": [{"id": "source.frontier.arxiv-2608-18396", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"", "scope": {"population": "arXiv:2608.18396 abstract", "time": "2026-08-18", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-18396", "source_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "start": 3795, "end": 4040, "quote": "In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-18060.concept.nist.temporllogic", "target_kind": "edge", "target_sha256": "b19cc33589da1559e42d207434e94d82dc55ac110d7e08da0ffebedaa6b8a809", "canonical_record": {"source": "claim.frontier.arxiv-2608-18060", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"", "sources": [{"id": "source.frontier.arxiv-2608-18060", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"", "scope": {"population": "arXiv:2608.18060 abstract", "time": "2026-08-18", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-18060", "source_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "start": 2305, "end": 2538, "quote": "Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-16290.concept.nist.optimization", "target_kind": "edge", "target_sha256": "512a70d80f87f194c3df5c9c537a2d8bc1c3a5bf8f92910b9ed01607d6942f85", "canonical_record": {"source": "claim.frontier.arxiv-2608-16290", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"", "sources": [{"id": "source.frontier.arxiv-2608-16290", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"", "scope": {"population": "arXiv:2608.16290 abstract", "time": "2026-08-17", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-16290", "source_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "start": 2298, "end": 2393, "quote": "We develop tractable solutions to the resulting non-convex optimization problems in both cases."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-12037.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "214ebd4c84a748434ac58377b4a2ccc72decbc188724bca8918dadd711b285d3", "canonical_record": {"source": "claim.frontier.arxiv-2608-12037", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "sources": [{"id": "source.frontier.arxiv-2608-12037", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "scope": {"population": "arXiv:2608.12037 abstract", "time": "2026-08-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-12037", "source_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "start": 3116, "end": 3333, "quote": "By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-11929.concept.eia.compressor-station", "target_kind": "edge", "target_sha256": "7561c8ecfeb18de87d0aea47feaae39ed4801fb30437502e3bf74e8e9806e80f", "canonical_record": {"source": "claim.frontier.arxiv-2608-11929", "target": "concept.eia.compressor-station", "type": "related", "summary": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"", "sources": [{"id": "source.frontier.arxiv-2608-11929", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"", "scope": {"population": "arXiv:2608.11929 abstract", "time": "2026-08-12", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-11929", "source_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "start": 1823, "end": 2001, "quote": "The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs)."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-11175.concept.nist.optimization", "target_kind": "edge", "target_sha256": "7a693e17499f81aec0ca1fd2c35cada8a172f44319b3a00438a6153b0606bdc6", "canonical_record": {"source": "claim.frontier.arxiv-2608-11175", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"", "sources": [{"id": "source.frontier.arxiv-2608-11175", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"", "scope": {"population": "arXiv:2608.11175 abstract", "time": "2026-08-11", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-11175", "source_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "start": 2668, "end": 2848, "quote": "Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-10825.concept.eia.electric-vehicle-ev", "target_kind": "edge", "target_sha256": "d1d635c0a1bcdb4c0f1db54a20e6a73f385267f18b870da07ca5b9d4c1044452", "canonical_record": {"source": "claim.frontier.arxiv-2608-10825", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"", "sources": [{"id": "source.frontier.arxiv-2608-10825", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"", "scope": {"population": "arXiv:2608.10825 abstract", "time": "2026-08-11", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-10825", "source_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "start": 2154, "end": 2399, "quote": "Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-08151.method.nist.dynamicprog", "target_kind": "edge", "target_sha256": "8375f9e8c99efeda5e4c4e7b034c1fa6e25b1a162a9b1e7fdb16e882f7b53703", "canonical_record": {"source": "claim.frontier.arxiv-2608-08151", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"", "sources": [{"id": "source.frontier.arxiv-2608-08151", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"", "scope": {"population": "arXiv:2608.08151 abstract", "time": "2026-08-11", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-08151", "source_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "start": 2586, "end": 2715, "quote": "We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-10254.method.nist.modelcheckng", "target_kind": "edge", "target_sha256": "4c75b855e62c55ca4e91c3bc1ea2d5410e3907a3cacffdf41f4f264e25467e4f", "canonical_record": {"source": "claim.frontier.arxiv-2608-10254", "target": "method.nist.modelcheckng", "type": "related", "summary": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"", "sources": [{"id": "source.frontier.arxiv-2608-10254", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"", "scope": {"population": "arXiv:2608.10254 abstract", "time": "2026-08-10", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-10254", "source_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "start": 2169, "end": 2391, "quote": "Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-08599.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "808b2a621e821096c72fb8476b36e7a090c41c06e5233a3b7e3bec1d2770926a", "canonical_record": {"source": "claim.frontier.arxiv-2608-08599", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"", "sources": [{"id": "source.frontier.arxiv-2608-08599", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"", "scope": {"population": "arXiv:2608.08599 abstract", "time": "2026-08-09", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-08599", "source_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "start": 2686, "end": 2856, "quote": "Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-12398.ology.psycholinguistics", "target_kind": "edge", "target_sha256": "47064720765e88ee9d08ab468fb49ef034550b6c6d2cbd9ecb7e8b1a5895af92", "canonical_record": {"source": "claim.frontier.arxiv-2608-12398", "target": "ology.psycholinguistics", "type": "related", "summary": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "sources": [{"id": "source.frontier.arxiv-2608-12398", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "scope": {"population": "arXiv:2608.12398 abstract", "time": "2026-08-08", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-12398", "source_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "start": 2620, "end": 3064, "quote": "We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-07289.concept.nist.formalmethod", "target_kind": "edge", "target_sha256": "289e593bf0fbf059d169503b92cf9f57511e680fb993c177bc7ef92734e488b9", "canonical_record": {"source": "claim.frontier.arxiv-2608-07289", "target": "concept.nist.formalmethod", "type": "related", "summary": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"", "sources": [{"id": "source.frontier.arxiv-2608-07289", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"", "scope": {"population": "arXiv:2608.07289 abstract", "time": "2026-08-07", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-07289", "source_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "start": 3351, "end": 3478, "quote": "We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-05481.field.neuroscience", "target_kind": "edge", "target_sha256": "cf3fda85ae9b09c913d9bb6a4c2fec06f4e8362d8490cd9f8ab9053c3d2f6a87", "canonical_record": {"source": "claim.frontier.arxiv-2608-05481", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "sources": [{"id": "source.frontier.arxiv-2608-05481", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "scope": {"population": "arXiv:2608.05481 abstract", "time": "2026-08-06", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-05481", "source_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "start": 2885, "end": 3056, "quote": "Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-05348.concept.nist.optimization", "target_kind": "edge", "target_sha256": "f3ea82218ae3052d3429755f89d53971c9b5f77558fd60eef0e064403b958e61", "canonical_record": {"source": "claim.frontier.arxiv-2608-05348", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"", "sources": [{"id": "source.frontier.arxiv-2608-05348", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"", "scope": {"population": "arXiv:2608.05348 abstract", "time": "2026-08-05", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-05348", "source_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "start": 2619, "end": 2720, "quote": "Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-12393.field.ai", "target_kind": "edge", "target_sha256": "60a107037b3c0eb81f37f81291d8bbf7aa943002a13d2e13ea296f828c121d7f", "canonical_record": {"source": "claim.frontier.arxiv-2608-12393", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"", "sources": [{"id": "source.frontier.arxiv-2608-12393", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"", "scope": {"population": "arXiv:2608.12393 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-12393", "source_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "start": 1881, "end": 2039, "quote": "This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-04227.method.nist.fastfouriertransform", "target_kind": "edge", "target_sha256": "8ed69d55fdb5b95c09777f7e1b31a29d5dd0cfb373da6380f7a02da4972cf0f2", "canonical_record": {"source": "claim.frontier.arxiv-2608-04227", "target": "method.nist.fastfouriertransform", "type": "related", "summary": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"", "sources": [{"id": "source.frontier.arxiv-2608-04227", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"", "scope": {"population": "arXiv:2608.04227 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-04227", "source_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "start": 3151, "end": 3293, "quote": "Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-04133.concept.nist.globaloptimum", "target_kind": "edge", "target_sha256": "4214fb7acd0542bee40e304d02cf792375660285164aeef7c884500c8b2a9938", "canonical_record": {"source": "claim.frontier.arxiv-2608-04133", "target": "concept.nist.globaloptimum", "type": "related", "summary": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"", "sources": [{"id": "source.frontier.arxiv-2608-04133", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"", "scope": {"population": "arXiv:2608.04133 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-04133", "source_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "start": 3310, "end": 3616, "quote": "For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-03967.concept.nist.flownetwork", "target_kind": "edge", "target_sha256": "95b2484dfa2aced1d9942ea260e3c6c695d4cc5951df58ac2d43a1525b624453", "canonical_record": {"source": "claim.frontier.arxiv-2608-03967", "target": "concept.nist.flownetwork", "type": "related", "summary": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"", "sources": [{"id": "source.frontier.arxiv-2608-03967", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"", "scope": {"population": "arXiv:2608.03967 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-03967", "source_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "start": 1698, "end": 1922, "quote": "Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-02978.concept.nist.optimization", "target_kind": "edge", "target_sha256": "e22d048069a65e640909a4b53418e20e14ae1dfe4a7685654b1d1910e7dd2d3a", "canonical_record": {"source": "claim.frontier.arxiv-2608-02978", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"", "sources": [{"id": "source.frontier.arxiv-2608-02978", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"", "scope": {"population": "arXiv:2608.02978 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-02978", "source_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "start": 2404, "end": 2520, "quote": "To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-02976.concept.nist.optimization", "target_kind": "edge", "target_sha256": "e850ed8fbf6081e494abcd7db3d0b39a6c1d3f37b177b1637b1d22bccbbf1db4", "canonical_record": {"source": "claim.frontier.arxiv-2608-02976", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"", "sources": [{"id": "source.frontier.arxiv-2608-02976", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"", "scope": {"population": "arXiv:2608.02976 abstract", "time": "2026-08-04", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-02976", "source_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "start": 2789, "end": 2957, "quote": "Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-02244.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "ec2ec977c984bbdf843bbd4b4745245a4aa4a8ad96e29efcd67180ea82329591", "canonical_record": {"source": "claim.frontier.arxiv-2608-02244", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "sources": [{"id": "source.frontier.arxiv-2608-02244", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "scope": {"population": "arXiv:2608.02244 abstract", "time": "2026-08-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-02244", "source_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "start": 2593, "end": 2669, "quote": "We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-02079.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "8ae1d0f7a8abeedc5df1c8bce2388b6b420df12620aba5ef7f9dd583fb52bc7a", "canonical_record": {"source": "claim.frontier.arxiv-2608-02079", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"", "sources": [{"id": "source.frontier.arxiv-2608-02079", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"", "scope": {"population": "arXiv:2608.02079 abstract", "time": "2026-08-03", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-02079", "source_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "start": 2962, "end": 3213, "quote": "In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-01220.concept.nist.objective", "target_kind": "edge", "target_sha256": "43619f6d7a045a771908e00af450692c742ca67cc73510275a7c1acc1db88142", "canonical_record": {"source": "claim.frontier.arxiv-2608-01220", "target": "concept.nist.objective", "type": "related", "summary": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"", "sources": [{"id": "source.frontier.arxiv-2608-01220", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"", "scope": {"population": "arXiv:2608.01220 abstract", "time": "2026-08-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-01220", "source_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "start": 3044, "end": 3195, "quote": "However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2608-00959.concept.nist.optimization", "target_kind": "edge", "target_sha256": "d2d69b51a25be679a0f88fd54516cbdc59bf6db5ab347406ac0e9874b1d61708", "canonical_record": {"source": "claim.frontier.arxiv-2608-00959", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"", "sources": [{"id": "source.frontier.arxiv-2608-00959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"", "scope": {"population": "arXiv:2608.00959 abstract", "time": "2026-08-02", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2608-00959", "source_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "start": 1653, "end": 1901, "quote": "Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-17248.concept.eia.fuel-cell", "target_kind": "edge", "target_sha256": "fc4ce603abbaeec2b32528a796137d174c61996f364c01fa86641ba77748ffad", "canonical_record": {"source": "claim.frontier.arxiv-2607-17248", "target": "concept.eia.fuel-cell", "type": "related", "summary": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"", "sources": [{"id": "source.frontier.arxiv-2607-17248", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"", "scope": {"population": "arXiv:2607.17248 abstract", "time": "2026-07-31", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-17248", "source_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "start": 2438, "end": 2696, "quote": "This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-14144.concept.nist.lowerbound", "target_kind": "edge", "target_sha256": "13b1f66d6251859aaff1e3088c41bdb3790c5b1f6278cc6f3ab18a4f0df1f4ac", "canonical_record": {"source": "claim.frontier.arxiv-2607-14144", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "sources": [{"id": "source.frontier.arxiv-2607-14144", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "scope": {"population": "arXiv:2607.14144 abstract", "time": "2026-07-31", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-14144", "source_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "start": 3465, "end": 3703, "quote": "We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-28833.field.ai", "target_kind": "edge", "target_sha256": "3045e82524ebcf5ac402e50609708476eb9b69656329cfbeee0808515bde16e8", "canonical_record": {"source": "claim.frontier.arxiv-2607-28833", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"", "sources": [{"id": "source.frontier.arxiv-2607-28833", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"", "scope": {"population": "arXiv:2607.28833 abstract", "time": "2026-07-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-28833", "source_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "start": 2179, "end": 2332, "quote": "Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-28780.field.ai", "target_kind": "edge", "target_sha256": "c2cdf65f5782bd43858e6f67eacfd2d2905d4c746a83c68ae0c98df3e2c56bb9", "canonical_record": {"source": "claim.frontier.arxiv-2607-28780", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"", "sources": [{"id": "source.frontier.arxiv-2607-28780", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"", "scope": {"population": "arXiv:2607.28780 abstract", "time": "2026-07-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-28780", "source_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "start": 1965, "end": 2219, "quote": "As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-28276.field.ai", "target_kind": "edge", "target_sha256": "c836745b9325a50b496305c349d0c62bc1ba72d55dad0aa2e7080a15298b3298", "canonical_record": {"source": "claim.frontier.arxiv-2607-28276", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"", "sources": [{"id": "source.frontier.arxiv-2607-28276", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"", "scope": {"population": "arXiv:2607.28276 abstract", "time": "2026-07-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-28276", "source_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "start": 2865, "end": 2975, "quote": "We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-28185.concept.nist.markovchain", "target_kind": "edge", "target_sha256": "7247de10d649c29f02f8ba3dde98a69cd50cfff569a853bd1ef15d731462b9ce", "canonical_record": {"source": "claim.frontier.arxiv-2607-28185", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "sources": [{"id": "source.frontier.arxiv-2607-28185", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "scope": {"population": "arXiv:2607.28185 abstract", "time": "2026-07-30", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-28185", "source_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "start": 2222, "end": 2430, "quote": "Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-26209.concept.eia.energy-consumption", "target_kind": "edge", "target_sha256": "012e7154904336a6c812f26df174dc238d94d3066cd6956c2f0c2feee7270335", "canonical_record": {"source": "claim.frontier.arxiv-2607-26209", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"", "sources": [{"id": "source.frontier.arxiv-2607-26209", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"", "scope": {"population": "arXiv:2607.26209 abstract", "time": "2026-07-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-26209", "source_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "start": 2517, "end": 2863, "quote": "Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-25526.field.mesh.d011057", "target_kind": "edge", "target_sha256": "13a7308d44eadbdc71d6c1e5dc8e0743fd361d0ae6a4427b66dfa0f943ed067d", "canonical_record": {"source": "claim.frontier.arxiv-2607-25526", "target": "field.mesh.d011057", "type": "related", "summary": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "sources": [{"id": "source.frontier.arxiv-2607-25526", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "scope": {"population": "arXiv:2607.25526 abstract", "time": "2026-07-28", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-25526", "source_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "start": 2524, "end": 2808, "quote": "The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-25081.concept.mesh.d006803", "target_kind": "edge", "target_sha256": "2a847c4fe8b507efbb8886852a3a06a1e6e969b5cdb4f86574220edb358d3098", "canonical_record": {"source": "claim.frontier.arxiv-2607-25081", "target": "concept.mesh.d006803", "type": "related", "summary": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"", "sources": [{"id": "source.frontier.arxiv-2607-25081", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"", "scope": {"population": "arXiv:2607.25081 abstract", "time": "2026-07-27", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-25081", "source_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "start": 2867, "end": 3117, "quote": "Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-24423.concept.eia.electric-vehicle-ev", "target_kind": "edge", "target_sha256": "4a89f727fd4a08a7a0096bd759f8a736a467bf34d4e34d11f3a741a599dab7f9", "canonical_record": {"source": "claim.frontier.arxiv-2607-24423", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"", "sources": [{"id": "source.frontier.arxiv-2607-24423", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"", "scope": {"population": "arXiv:2607.24423 abstract", "time": "2026-07-27", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-24423", "source_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "start": 2442, "end": 2627, "quote": "Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-24360.concept.mesh.d000067656", "target_kind": "edge", "target_sha256": "d5991652168ebd297d5d091f5fc17f526800adbd9595875bca77a6f47a96a411", "canonical_record": {"source": "claim.frontier.arxiv-2607-24360", "target": "concept.mesh.d000067656", "type": "related", "summary": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"", "sources": [{"id": "source.frontier.arxiv-2607-24360", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"", "scope": {"population": "arXiv:2607.24360 abstract", "time": "2026-07-27", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-24360", "source_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "start": 2753, "end": 2889, "quote": "Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly."}]}
+{"id": "assertion.edge.claim.frontier.arxiv-2607-22049.concept.mesh.d007391", "target_kind": "edge", "target_sha256": "a351ec73293102ed74aaf3671a0cb241b2da6599ee54758b449e66e6d4ecf8a4", "canonical_record": {"source": "claim.frontier.arxiv-2607-22049", "target": "concept.mesh.d007391", "type": "related", "summary": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"", "sources": [{"id": "source.frontier.arxiv-2607-22049", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"}]}, "statement": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"", "scope": {"population": "arXiv:2607.22049 abstract", "time": "2026-07-24", "assumptions": "Topical relation only: the abstract names the existing concept", "uncertainty": "No dependency, derivation, support or novelty claim", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-22049", "source_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "start": 2705, "end": 3107, "quote": "These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies."}]}
+{"id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic", "target_kind": "taxonomy", "target_sha256": "b6ab60ec7d1556ff04676c0184bcc18437e404635016be97498097e9b0c6c738", "canonical_record": {"id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic", "parent": "concept.nist.temporllogic", "child": "claim.frontier.arxiv-2610-15934", "type": "narrower"}, "statement": "The retained abstract of arXiv:2610.15934 classifies its contribution as a Temporal Logic (temporal logic): \"We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor.\"", "confidence": 0.8, "scope": {"population": "arXiv:2610.15934 contribution", "time": "2026-10-11", "assumptions": "The abstract itself classifies the work as a kind of the parent concept; navigation ancestry only", "uncertainty": "Source-attributed classification; not a claim of novelty or quality", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2610-15934", "source_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "start": 2138, "end": 2510, "quote": "We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor."}]}
+{"id": "assertion.taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite", "target_kind": "taxonomy", "target_sha256": "7256abd61eb75435360413241497b4f6393c4cd36bb27da608dd4d0a0758bf93", "canonical_record": {"id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite", "parent": "concept.nist.semidefinite", "child": "claim.frontier.arxiv-2607-28224", "type": "narrower"}, "statement": "The retained abstract of arXiv:2607.28224 classifies its contribution as a semidefinite programming (semidefinite programming): \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"", "confidence": 0.8, "scope": {"population": "arXiv:2607.28224 contribution", "time": "2026-07-30", "assumptions": "The abstract itself classifies the work as a kind of the parent concept; navigation ancestry only", "uncertainty": "Source-attributed classification; not a claim of novelty or quality", "units": null, "quantifiers": "This publication only"}, "support": [{"source_id": "source.frontier.arxiv-2607-28224", "source_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "start": 2490, "end": 2801, "quote": "First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions."}]}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/edges.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/edges.jsonl
new file mode 100644
index 000000000..6c85d3c21
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/edges.jsonl
@@ -0,0 +1,118 @@
+{"source": "claim.frontier.arxiv-2610-21653", "target": "concept.nist.performance", "type": "related", "summary": "The retained abstract of arXiv:2610.21653 names performance guarantee: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "sources": [{"id": "source.frontier.arxiv-2610-21653", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-19722", "target": "concept.nist.linearprobng", "type": "related", "summary": "The retained abstract of arXiv:2610.19722 names linear probing: \"Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing.\"", "sources": [{"id": "source.frontier.arxiv-2610-19722", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-19515", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.19515 names optimization problem: \"To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy.\"", "sources": [{"id": "source.frontier.arxiv-2610-19515", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-19137", "target": "concept.eia.carbon-intensity", "type": "related", "summary": "The retained abstract of arXiv:2610.19137 names Carbon intensity: \"Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity.\"", "sources": [{"id": "source.frontier.arxiv-2610-19137", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-17295", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2610.17295 names dynamic programming: \"We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives.\"", "sources": [{"id": "source.frontier.arxiv-2610-17295", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-16273", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2610.16273 names Neuroscience: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "sources": [{"id": "source.frontier.arxiv-2610-16273", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-16259", "target": "field.information-theory", "type": "related", "summary": "The retained abstract of arXiv:2610.16259 names Information theory: \"Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models.\"", "sources": [{"id": "source.frontier.arxiv-2610-16259", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-15072", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.15072 names lower bound: \"To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound.\"", "sources": [{"id": "source.frontier.arxiv-2610-15072", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-15052", "target": "method.nist.simulatedannealing", "type": "related", "summary": "The retained abstract of arXiv:2610.15052 names simulated annealing: \"On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each.\"", "sources": [{"id": "source.frontier.arxiv-2610-15052", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-13424", "target": "concept.nist.optimalsoltn", "type": "related", "summary": "The retained abstract of arXiv:2610.13424 names optimal solution: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "sources": [{"id": "source.frontier.arxiv-2610-13424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-13402", "target": "field.information-theory", "type": "related", "summary": "The retained abstract of arXiv:2610.13402 names Information theory: \"By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain.\"", "sources": [{"id": "source.frontier.arxiv-2610-13402", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-12779", "target": "concept.nist.stronglyconnectedcompo", "type": "related", "summary": "The retained abstract of arXiv:2610.12779 names strongly connected component: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "sources": [{"id": "source.frontier.arxiv-2610-12779", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-12604", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.12604 names lower bound: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "sources": [{"id": "source.frontier.arxiv-2610-12604", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-12592", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.12592 names lower bound: \"The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE).\"", "sources": [{"id": "source.frontier.arxiv-2610-12592", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-12038", "target": "concept.nist.binarytree", "type": "related", "summary": "The retained abstract of arXiv:2610.12038 names binary tree: \"This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor's reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time.\"", "sources": [{"id": "source.frontier.arxiv-2610-12038", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-11869", "target": "concept.nist.objective", "type": "related", "summary": "The retained abstract of arXiv:2610.11869 names objective function: \"An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed.\"", "sources": [{"id": "source.frontier.arxiv-2610-11869", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-11359", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.11359 names optimization problem: \"Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness.\"", "sources": [{"id": "source.frontier.arxiv-2610-11359", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04959", "target": "concept.nist.flownetwork", "type": "related", "summary": "The retained abstract of arXiv:2610.04959 names flow network: \"While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges.\"", "sources": [{"id": "source.frontier.arxiv-2610-04959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-09266", "target": "concept.nist.optimalsoltn", "type": "related", "summary": "The retained abstract of arXiv:2610.09266 names optimal solution: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "sources": [{"id": "source.frontier.arxiv-2610-09266", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-09080", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.09080 names exhaustive search: \"The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA.\"", "sources": [{"id": "source.frontier.arxiv-2610-09080", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-09010", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.09010 names optimization problem: \"The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources.\"", "sources": [{"id": "source.frontier.arxiv-2610-09010", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-08744", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.08744 names exhaustive search: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "sources": [{"id": "source.frontier.arxiv-2610-08744", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-07616", "target": "method.nist.randomsearch", "type": "related", "summary": "The retained abstract of arXiv:2610.07616 names random search: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "sources": [{"id": "source.frontier.arxiv-2610-07616", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-07307", "target": "concept.nist.prisonersdilemma", "type": "related", "summary": "The retained abstract of arXiv:2610.07307 names prisoner's dilemma: \"The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner's dilemma, where it selects the desired equilibrium in both settings.\"", "sources": [{"id": "source.frontier.arxiv-2610-07307", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-06601", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2610.06601 names dynamic programming: \"We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data.\"", "sources": [{"id": "source.frontier.arxiv-2610-06601", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04776", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2610.04776 names exhaustive search: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "sources": [{"id": "source.frontier.arxiv-2610-04776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04697", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2610.04697 names Neuroscience: \"In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function.\"", "sources": [{"id": "source.frontier.arxiv-2610-04697", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04662", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2610.04662 names temporal logic: \"Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems.\"", "sources": [{"id": "source.frontier.arxiv-2610-04662", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04630", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2610.04630 names Energy consumption: \"As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions.\"", "sources": [{"id": "source.frontier.arxiv-2610-04630", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-04242", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2610.04242 names Markov chain: \"We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates.\"", "sources": [{"id": "source.frontier.arxiv-2610-04242", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-06918", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2610.06918 names lower bound: \"We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning.\"", "sources": [{"id": "source.frontier.arxiv-2610-06918", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-03964", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2610.03964 names optimization problem: \"A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles.\"", "sources": [{"id": "source.frontier.arxiv-2610-03964", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2610-03008", "target": "field.cognitive-science", "type": "related", "summary": "The retained abstract of arXiv:2610.03008 names Cognitive science: \"Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science.\"", "sources": [{"id": "source.frontier.arxiv-2610-03008", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-39776", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.39776 names optimization problem: \"The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each.\"", "sources": [{"id": "source.frontier.arxiv-2609-39776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-21813", "target": "concept.nist.probesequenc", "type": "related", "summary": "The retained abstract of arXiv:2609.21813 names probe sequence: \"On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples.\"", "sources": [{"id": "source.frontier.arxiv-2609-21813", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-36354", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.36354 names Artificial intelligence: \"Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks.\"", "sources": [{"id": "source.frontier.arxiv-2609-36354", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-35424", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.35424 names optimization problem: \"To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection.\"", "sources": [{"id": "source.frontier.arxiv-2609-35424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-35246", "target": "concept.eia.distribution-system", "type": "related", "summary": "The retained abstract of arXiv:2609.35246 names Distribution system: \"To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph.\"", "sources": [{"id": "source.frontier.arxiv-2609-35246", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-32315", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.32315 names Neuroscience: \"This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG.\"", "sources": [{"id": "source.frontier.arxiv-2609-32315", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-29972", "target": "concept.mesh.d000088562", "type": "related", "summary": "The retained abstract of arXiv:2609.29972 names Persistent Infection: \"Without therapy, the model approaches a state of persistent infection.\"", "sources": [{"id": "source.frontier.arxiv-2609-29972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-29832", "target": "concept.eia.motor-speed", "type": "related", "summary": "The retained abstract of arXiv:2609.29832 names Motor speed: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "sources": [{"id": "source.frontier.arxiv-2609-29832", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-28815", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.28815 names lower bound: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "sources": [{"id": "source.frontier.arxiv-2609-28815", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-26924", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.26924 names Artificial intelligence: \"Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift.\"", "sources": [{"id": "source.frontier.arxiv-2609-26924", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-25847", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2609.25847 names Energy consumption: \"This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.\"", "sources": [{"id": "source.frontier.arxiv-2609-25847", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-25701", "target": "concept.nist.polynomialtm", "type": "related", "summary": "The retained abstract of arXiv:2609.25701 names polynomial time: \"We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time.\"", "sources": [{"id": "source.frontier.arxiv-2609-25701", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-25437", "target": "concept.eia.electricity-generation", "type": "related", "summary": "The retained abstract of arXiv:2609.25437 names Electricity generation: \"Data centers consume water for cooling (direct) and through electricity generation (indirect).\"", "sources": [{"id": "source.frontier.arxiv-2609-25437", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-05763", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2609.05763 names Electric vehicle (EV): \"At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks.\"", "sources": [{"id": "source.frontier.arxiv-2609-05763", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-23703", "target": "field.computer-science", "type": "related", "summary": "The retained abstract of arXiv:2609.23703 names Computer science: \"Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference.\"", "sources": [{"id": "source.frontier.arxiv-2609-23703", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-23199", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.23199 names lower bound: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "sources": [{"id": "source.frontier.arxiv-2609-23199", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-23085", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2609.23085 names Energy consumption: \"While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption.\"", "sources": [{"id": "source.frontier.arxiv-2609-23085", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-22775", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.22775 names Artificial intelligence: \"Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons.\"", "sources": [{"id": "source.frontier.arxiv-2609-22775", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-22615", "target": "method.nist.chinesermndr", "type": "related", "summary": "The retained abstract of arXiv:2609.22615 names Chinese remainder theorem: \"The Chinese remainder theorem (CRT) is highly sensitive to remainder errors.\"", "sources": [{"id": "source.frontier.arxiv-2609-22615", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-21966", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.21966 names lower bound: \"For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata).\"", "sources": [{"id": "source.frontier.arxiv-2609-21966", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-21270", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.21270 names lower bound: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "sources": [{"id": "source.frontier.arxiv-2609-21270", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-21093", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2609.21093 names Markov chain: \"We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states.\"", "sources": [{"id": "source.frontier.arxiv-2609-21093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-21057", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.21057 names optimization problem: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "sources": [{"id": "source.frontier.arxiv-2609-21057", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-19468", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.19468 names lower bound: \"Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate.\"", "sources": [{"id": "source.frontier.arxiv-2609-19468", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-18467", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.18467 names lower bound: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "sources": [{"id": "source.frontier.arxiv-2609-18467", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-17042", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.17042 names Neuroscience: \"Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned.\"", "sources": [{"id": "source.frontier.arxiv-2609-17042", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-16899", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2609.16899 names Electric vehicle (EV): \"This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid.\"", "sources": [{"id": "source.frontier.arxiv-2609-16899", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-16353", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.16353 names optimization problem: \"We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.\"", "sources": [{"id": "source.frontier.arxiv-2609-16353", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-16258", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.16258 names Artificial intelligence: \"As artificial intelligence's capabilities improve, it is increasingly viewed as a general scientific method.\"", "sources": [{"id": "source.frontier.arxiv-2609-16258", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-05749", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.05749 names Artificial intelligence: \"Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values.\"", "sources": [{"id": "source.frontier.arxiv-2609-05749", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-14022", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2609.14022 names Artificial intelligence: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "sources": [{"id": "source.frontier.arxiv-2609-14022", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-12866", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.12866 names optimization problem: \"Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it.\"", "sources": [{"id": "source.frontier.arxiv-2609-12866", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-12486", "target": "concept.nist.decisionproblem", "type": "related", "summary": "The retained abstract of arXiv:2609.12486 names decision problem: \"In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.\"", "sources": [{"id": "source.frontier.arxiv-2609-12486", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-12016", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.12016 names lower bound: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "sources": [{"id": "source.frontier.arxiv-2609-12016", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-11530", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2609.11530 names Neuroscience: \"Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches.\"", "sources": [{"id": "source.frontier.arxiv-2609-11530", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-08218", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2609.08218 names lower bound: \"While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow.\"", "sources": [{"id": "source.frontier.arxiv-2609-08218", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-06163", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.06163 names optimization problem: \"To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law.\"", "sources": [{"id": "source.frontier.arxiv-2609-06163", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-06066", "target": "concept.nist.performance", "type": "related", "summary": "The retained abstract of arXiv:2609.06066 names performance guarantee: \"Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings.\"", "sources": [{"id": "source.frontier.arxiv-2609-06066", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2609-02071", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2609.02071 names optimization problem: \"Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state.\"", "sources": [{"id": "source.frontier.arxiv-2609-02071", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-31034", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.31034 names Artificial intelligence: \"This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems.\"", "sources": [{"id": "source.frontier.arxiv-2608-31034", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-28387", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2608.28387 names Energy consumption: \"We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.\"", "sources": [{"id": "source.frontier.arxiv-2608-28387", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-27536", "target": "concept.nist.prisonersdilemma", "type": "related", "summary": "The retained abstract of arXiv:2608.27536 names prisoner's dilemma: \"We demonstrate it on the prisoner's dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version.\"", "sources": [{"id": "source.frontier.arxiv-2608-27536", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-26093", "target": "concept.nist.stronglynp", "type": "related", "summary": "The retained abstract of arXiv:2608.26093 names strongly NP-hard: \"The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex.\"", "sources": [{"id": "source.frontier.arxiv-2608-26093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-24219", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.24219 names lower bound: \"Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space.\"", "sources": [{"id": "source.frontier.arxiv-2608-24219", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-23972", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2608.23972 names temporal logic: \"In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL).\"", "sources": [{"id": "source.frontier.arxiv-2608-23972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-21764", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.21764 names Artificial intelligence: \"Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing.\"", "sources": [{"id": "source.frontier.arxiv-2608-21764", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-21020", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.21020 names lower bound: \"For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime.\"", "sources": [{"id": "source.frontier.arxiv-2608-21020", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-20723", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.20723 names Artificial intelligence: \"Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence.\"", "sources": [{"id": "source.frontier.arxiv-2608-20723", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-19416", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.19416 names optimization problem: \"Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors.\"", "sources": [{"id": "source.frontier.arxiv-2608-19416", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-18396", "target": "method.nist.exhaustivesearch", "type": "related", "summary": "The retained abstract of arXiv:2608.18396 names exhaustive search: \"In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region.\"", "sources": [{"id": "source.frontier.arxiv-2608-18396", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-18060", "target": "concept.nist.temporllogic", "type": "related", "summary": "The retained abstract of arXiv:2608.18060 names temporal logic: \"Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks.\"", "sources": [{"id": "source.frontier.arxiv-2608-18060", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-16290", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.16290 names optimization problem: \"We develop tractable solutions to the resulting non-convex optimization problems in both cases.\"", "sources": [{"id": "source.frontier.arxiv-2608-16290", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-12037", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.12037 names lower bound: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "sources": [{"id": "source.frontier.arxiv-2608-12037", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-11929", "target": "concept.eia.compressor-station", "type": "related", "summary": "The retained abstract of arXiv:2608.11929 names Compressor station: \"The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs).\"", "sources": [{"id": "source.frontier.arxiv-2608-11929", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-11175", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.11175 names optimization problem: \"Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution.\"", "sources": [{"id": "source.frontier.arxiv-2608-11175", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-10825", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2608.10825 names Electric vehicle (EV): \"Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements.\"", "sources": [{"id": "source.frontier.arxiv-2608-10825", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-08151", "target": "method.nist.dynamicprog", "type": "related", "summary": "The retained abstract of arXiv:2608.08151 names dynamic programming: \"We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints.\"", "sources": [{"id": "source.frontier.arxiv-2608-08151", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-10254", "target": "method.nist.modelcheckng", "type": "related", "summary": "The retained abstract of arXiv:2608.10254 names model checking: \"Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction.\"", "sources": [{"id": "source.frontier.arxiv-2608-10254", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-08599", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.08599 names lower bound: \"Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters.\"", "sources": [{"id": "source.frontier.arxiv-2608-08599", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-12398", "target": "ology.psycholinguistics", "type": "related", "summary": "The retained abstract of arXiv:2608.12398 names Psycholinguistics: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "sources": [{"id": "source.frontier.arxiv-2608-12398", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-07289", "target": "concept.nist.formalmethod", "type": "related", "summary": "The retained abstract of arXiv:2608.07289 names formal methods: \"We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods.\"", "sources": [{"id": "source.frontier.arxiv-2608-07289", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-05481", "target": "field.neuroscience", "type": "related", "summary": "The retained abstract of arXiv:2608.05481 names Neuroscience: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "sources": [{"id": "source.frontier.arxiv-2608-05481", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-05348", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.05348 names optimization problem: \"Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems.\"", "sources": [{"id": "source.frontier.arxiv-2608-05348", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-12393", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2608.12393 names Artificial intelligence: \"This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence.\"", "sources": [{"id": "source.frontier.arxiv-2608-12393", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-04227", "target": "method.nist.fastfouriertransform", "type": "related", "summary": "The retained abstract of arXiv:2608.04227 names fast fourier transform: \"Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy.\"", "sources": [{"id": "source.frontier.arxiv-2608-04227", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-04133", "target": "concept.nist.globaloptimum", "type": "related", "summary": "The retained abstract of arXiv:2608.04133 names global optimum: \"For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations.\"", "sources": [{"id": "source.frontier.arxiv-2608-04133", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-03967", "target": "concept.nist.flownetwork", "type": "related", "summary": "The retained abstract of arXiv:2608.03967 names flow network: \"Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward.\"", "sources": [{"id": "source.frontier.arxiv-2608-03967", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-02978", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.02978 names optimization problem: \"To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed.\"", "sources": [{"id": "source.frontier.arxiv-2608-02978", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-02976", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.02976 names optimization problem: \"Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework.\"", "sources": [{"id": "source.frontier.arxiv-2608-02976", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-02244", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.02244 names lower bound: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "sources": [{"id": "source.frontier.arxiv-2608-02244", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-02079", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2608.02079 names lower bound: \"In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction.\"", "sources": [{"id": "source.frontier.arxiv-2608-02079", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-01220", "target": "concept.nist.objective", "type": "related", "summary": "The retained abstract of arXiv:2608.01220 names objective function: \"However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup.\"", "sources": [{"id": "source.frontier.arxiv-2608-01220", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2608-00959", "target": "concept.nist.optimization", "type": "related", "summary": "The retained abstract of arXiv:2608.00959 names optimization problem: \"Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics.\"", "sources": [{"id": "source.frontier.arxiv-2608-00959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-17248", "target": "concept.eia.fuel-cell", "type": "related", "summary": "The retained abstract of arXiv:2607.17248 names Fuel cell: \"This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup.\"", "sources": [{"id": "source.frontier.arxiv-2607-17248", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-14144", "target": "concept.nist.lowerbound", "type": "related", "summary": "The retained abstract of arXiv:2607.14144 names lower bound: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "sources": [{"id": "source.frontier.arxiv-2607-14144", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-28833", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28833 names Artificial intelligence: \"Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system.\"", "sources": [{"id": "source.frontier.arxiv-2607-28833", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-28780", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28780 names Artificial intelligence: \"As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models.\"", "sources": [{"id": "source.frontier.arxiv-2607-28780", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-28276", "target": "field.ai", "type": "related", "summary": "The retained abstract of arXiv:2607.28276 names Artificial intelligence: \"We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations.\"", "sources": [{"id": "source.frontier.arxiv-2607-28276", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-28185", "target": "concept.nist.markovchain", "type": "related", "summary": "The retained abstract of arXiv:2607.28185 names Markov chain: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "sources": [{"id": "source.frontier.arxiv-2607-28185", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-26209", "target": "concept.eia.energy-consumption", "type": "related", "summary": "The retained abstract of arXiv:2607.26209 names Energy consumption: \"Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads.\"", "sources": [{"id": "source.frontier.arxiv-2607-26209", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-25526", "target": "field.mesh.d011057", "type": "related", "summary": "The retained abstract of arXiv:2607.25526 names Politics: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "sources": [{"id": "source.frontier.arxiv-2607-25526", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-25081", "target": "concept.mesh.d006803", "type": "related", "summary": "The retained abstract of arXiv:2607.25081 names Human Development: \"Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale.\"", "sources": [{"id": "source.frontier.arxiv-2607-25081", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-24423", "target": "concept.eia.electric-vehicle-ev", "type": "related", "summary": "The retained abstract of arXiv:2607.24423 names Electric vehicle (EV): \"Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems.\"", "sources": [{"id": "source.frontier.arxiv-2607-24423", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-24360", "target": "concept.mesh.d000067656", "type": "related", "summary": "The retained abstract of arXiv:2607.24360 names Optimism: \"Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly.\"", "sources": [{"id": "source.frontier.arxiv-2607-24360", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"}]}
+{"source": "claim.frontier.arxiv-2607-22049", "target": "concept.mesh.d007391", "type": "related", "summary": "The retained abstract of arXiv:2607.22049 names International Cooperation: \"These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies.\"", "sources": [{"id": "source.frontier.arxiv-2607-22049", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"}]}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/identities.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/identities.jsonl
new file mode 100644
index 000000000..e69de29bb
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/manifest.json b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/manifest.json
new file mode 100644
index 000000000..2261b12c1
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/manifest.json
@@ -0,0 +1,25 @@
+{
+  "protocol": "fog-nemesis-batch/1",
+  "batch_id": "nemesis-frontier-arxiv-b-20261018-r1",
+  "created_at": "2026-10-18T18:18:45.748268+00:00",
+  "agent": "nemesis-direct-author",
+  "mission": "Add recent public research results (2026-04-18 to 2026-10-18) as frontier public-result nodes linked to the existing concepts they name",
+  "scope": {
+    "domains": [
+      "information",
+      "engineering",
+      "social",
+      "health"
+    ],
+    "topics": [
+      "recent public results from arxiv"
+    ],
+    "date_range": "2026-04-18/2026-10-18"
+  },
+  "source_policy": "arXiv OAI-PMH records (arXiv metadata CC0; abstracts used only where the record states CC BY or CC0); one retained capture per paper.",
+  "notes": "Directly authored by deterministic code (frontier_author.py). One paper -> one frontier public-result node: frontier:true, status/era frontier, public_frontier public-result with disclosed_at = the date stated in the retained record. Quote = exact finding sentence of the abstract plus exact date and licence spans. Link = one related edge to an existing same-family concept named in the abstract (subject-category field + label match), or a narrower placement only where the abstract itself classifies the work as that concept; at most 25 new links per concept and parents below 100 children. Deduplicated against map ids, labels, aliases, source DOIs/arXiv ids, open PRs and other batches. REVIEW: code-only (code:nemesis-provenance/1) under owner waiver code-provenance-frontier-public-results (2026-10-18). No adversarial model review is claimed.",
+  "review": {
+    "reviewer": "code-only",
+    "adversarial_review": "not performed; owner waiver code-provenance-frontier-public-results (2026-10-18)"
+  }
+}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/nodes.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/nodes.jsonl
new file mode 100644
index 000000000..370ab5afd
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/nodes.jsonl
@@ -0,0 +1,120 @@
+{"id": "claim.frontier.arxiv-2610-21653", "label": "How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.21653 \"How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?\" (CC BY 4.0, submitted 2026-10-15) reports: \"In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-21653", "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv"}, {"id": "arxiv:2610.21653", "title": "arXiv:2610.21653", "url": "https://arxiv.org/abs/2610.21653"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-15", "source_ids": ["source.frontier.arxiv-2610-21653"]}}
+{"id": "claim.frontier.arxiv-2610-19722", "label": "ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19722 \"ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition\" (CC BY 4.0, submitted 2026-10-14) reports: \"Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19722", "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19722", "title": "arXiv:2610.19722", "url": "https://arxiv.org/abs/2610.19722"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-14", "source_ids": ["source.frontier.arxiv-2610-19722"]}}
+{"id": "claim.frontier.arxiv-2610-19515", "label": "Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19515 \"Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility\" (CC BY 4.0, submitted 2026-10-14) reports: \"Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19515", "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19515", "title": "arXiv:2610.19515", "url": "https://arxiv.org/abs/2610.19515"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-14", "source_ids": ["source.frontier.arxiv-2610-19515"]}}
+{"id": "claim.frontier.arxiv-2610-19137", "label": "Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.19137 \"Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations\" (CC BY 4.0, submitted 2026-10-13) reports: \"Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-19137", "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv"}, {"id": "arxiv:2610.19137", "title": "arXiv:2610.19137", "url": "https://arxiv.org/abs/2610.19137"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-13", "source_ids": ["source.frontier.arxiv-2610-19137"]}}
+{"id": "claim.frontier.arxiv-2610-17295", "label": "Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.17295 \"Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach\" (CC BY 4.0, submitted 2026-10-12) reports: \"Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-17295", "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv"}, {"id": "arxiv:2610.17295", "title": "arXiv:2610.17295", "url": "https://arxiv.org/abs/2610.17295"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-17295"]}}
+{"id": "claim.frontier.arxiv-2610-16273", "label": "Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.16273 \"Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory\" (CC BY 4.0, submitted 2026-10-12) reports: \"Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional \"temporal subspace.\" Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-16273", "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv"}, {"id": "arxiv:2610.16273", "title": "arXiv:2610.16273", "url": "https://arxiv.org/abs/2610.16273"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-16273"]}}
+{"id": "claim.frontier.arxiv-2610-16259", "label": "Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.16259 \"Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation\" (CC0 1.0, submitted 2026-10-12) reports: \"The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-16259", "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv"}, {"id": "arxiv:2610.16259", "title": "arXiv:2610.16259", "url": "https://arxiv.org/abs/2610.16259"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-12", "source_ids": ["source.frontier.arxiv-2610-16259"]}}
+{"id": "claim.frontier.arxiv-2610-15934", "label": "Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15934 \"Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty\" (CC BY 4.0, submitted 2026-10-11) reports: \"We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15934", "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15934", "title": "arXiv:2610.15934", "url": "https://arxiv.org/abs/2610.15934"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-11", "source_ids": ["source.frontier.arxiv-2610-15934"]}}
+{"id": "claim.frontier.arxiv-2610-15072", "label": "UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15072 \"UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC\" (CC BY 4.0, submitted 2026-10-10) reports: \"We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15072", "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15072", "title": "arXiv:2610.15072", "url": "https://arxiv.org/abs/2610.15072"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-10", "source_ids": ["source.frontier.arxiv-2610-15072"]}}
+{"id": "claim.frontier.arxiv-2610-15052", "label": "On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.15052 \"On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms\" (CC BY 4.0, submitted 2026-10-10) reports: \"By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-15052", "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv"}, {"id": "arxiv:2610.15052", "title": "arXiv:2610.15052", "url": "https://arxiv.org/abs/2610.15052"}, {"id": "doi:10.1109/rusautocon69876.2026.11707364", "title": "doi:10.1109/rusautocon69876.2026.11707364", "url": "https://doi.org/10.1109/rusautocon69876.2026.11707364"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-10", "source_ids": ["source.frontier.arxiv-2610-15052"]}}
+{"id": "claim.frontier.arxiv-2610-13424", "label": "Minimum-Energy Control for Stochastic Linear Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.13424 \"Minimum-Energy Control for Stochastic Linear Systems\" (CC BY 4.0, submitted 2026-10-09) reports: \"We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-13424", "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv"}, {"id": "arxiv:2610.13424", "title": "arXiv:2610.13424", "url": "https://arxiv.org/abs/2610.13424"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-09", "source_ids": ["source.frontier.arxiv-2610-13424"]}}
+{"id": "claim.frontier.arxiv-2610-13402", "label": "Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.13402 \"Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas\" (CC BY 4.0, submitted 2026-10-09) reports: \"Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-13402", "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv"}, {"id": "arxiv:2610.13402", "title": "arXiv:2610.13402", "url": "https://arxiv.org/abs/2610.13402"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-09", "source_ids": ["source.frontier.arxiv-2610-13402"]}}
+{"id": "claim.frontier.arxiv-2610-12779", "label": "Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12779 \"Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12779", "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12779", "title": "arXiv:2610.12779", "url": "https://arxiv.org/abs/2610.12779"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12779"]}}
+{"id": "claim.frontier.arxiv-2610-12604", "label": "Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12604 \"Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems\" (CC0 1.0, submitted 2026-10-08) reports: \"Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12604", "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12604", "title": "arXiv:2610.12604", "url": "https://arxiv.org/abs/2610.12604"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12604"]}}
+{"id": "claim.frontier.arxiv-2610-12592", "label": "Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12592 \"Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications\" (CC0 1.0, submitted 2026-10-08) reports: \"The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12592", "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12592", "title": "arXiv:2610.12592", "url": "https://arxiv.org/abs/2610.12592"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12592"]}}
+{"id": "claim.frontier.arxiv-2610-12038", "label": "Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.12038 \"Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks\" (CC BY 4.0, submitted 2026-10-08) reports: \"We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-12038", "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv"}, {"id": "arxiv:2610.12038", "title": "arXiv:2610.12038", "url": "https://arxiv.org/abs/2610.12038"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-12038"]}}
+{"id": "claim.frontier.arxiv-2610-11869", "label": "Learning structured linear dynamical systems from missing observations", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.11869 \"Learning structured linear dynamical systems from missing observations\" (CC BY 4.0, submitted 2026-10-08) reports: \"We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-11869", "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv"}, {"id": "arxiv:2610.11869", "title": "arXiv:2610.11869", "url": "https://arxiv.org/abs/2610.11869"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-11869"]}}
+{"id": "claim.frontier.arxiv-2610-11359", "label": "Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.11359 \"Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors\" (CC BY 4.0, submitted 2026-10-08) reports: \"The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-11359", "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv"}, {"id": "arxiv:2610.11359", "title": "arXiv:2610.11359", "url": "https://arxiv.org/abs/2610.11359"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-11359"]}}
+{"id": "claim.frontier.arxiv-2610-04959", "label": "AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04959 \"AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion\" (CC BY 4.0, submitted 2026-10-08) reports: \"Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04959", "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04959", "title": "arXiv:2610.04959", "url": "https://arxiv.org/abs/2610.04959"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-08", "source_ids": ["source.frontier.arxiv-2610-04959"]}}
+{"id": "claim.frontier.arxiv-2610-09266", "label": "Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09266 \"Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks\" (CC BY 4.0, submitted 2026-10-07) reports: \"Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09266", "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09266", "title": "arXiv:2610.09266", "url": "https://arxiv.org/abs/2610.09266"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-07", "source_ids": ["source.frontier.arxiv-2610-09266"]}}
+{"id": "claim.frontier.arxiv-2610-09080", "label": "User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09080 \"User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09080", "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09080", "title": "arXiv:2610.09080", "url": "https://arxiv.org/abs/2610.09080"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-09080"]}}
+{"id": "claim.frontier.arxiv-2610-09010", "label": "Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.09010 \"Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-09010", "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv"}, {"id": "arxiv:2610.09010", "title": "arXiv:2610.09010", "url": "https://arxiv.org/abs/2610.09010"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-09010"]}}
+{"id": "claim.frontier.arxiv-2610-08744", "label": "RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.08744 \"RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks\" (CC BY 4.0, submitted 2026-10-06) reports: \"Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-08744", "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv"}, {"id": "arxiv:2610.08744", "title": "arXiv:2610.08744", "url": "https://arxiv.org/abs/2610.08744"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-08744"]}}
+{"id": "claim.frontier.arxiv-2610-07616", "label": "Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.07616 \"Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation\" (CC BY 4.0, submitted 2026-10-06) reports: \"Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-07616", "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv"}, {"id": "arxiv:2610.07616", "title": "arXiv:2610.07616", "url": "https://arxiv.org/abs/2610.07616"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-06", "source_ids": ["source.frontier.arxiv-2610-07616"]}}
+{"id": "claim.frontier.arxiv-2610-07307", "label": "Metric-Based Equilibrium Selection in Noncooperative Differentiable Games", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.07307 \"Metric-Based Equilibrium Selection in Noncooperative Differentiable Games\" (CC BY 4.0, submitted 2026-10-05) reports: \"We also derive a step-size condition for implementing the method in discrete time.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-07307", "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv"}, {"id": "arxiv:2610.07307", "title": "arXiv:2610.07307", "url": "https://arxiv.org/abs/2610.07307"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-05", "source_ids": ["source.frontier.arxiv-2610-07307"]}}
+{"id": "claim.frontier.arxiv-2610-06601", "label": "Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.06601 \"Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration\" (CC BY 4.0, submitted 2026-10-05) reports: \"Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-06601", "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv"}, {"id": "arxiv:2610.06601", "title": "arXiv:2610.06601", "url": "https://arxiv.org/abs/2610.06601"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-05", "source_ids": ["source.frontier.arxiv-2610-06601"]}}
+{"id": "claim.frontier.arxiv-2610-04776", "label": "Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04776 \"Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04776", "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04776", "title": "arXiv:2610.04776", "url": "https://arxiv.org/abs/2610.04776"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04776"]}}
+{"id": "claim.frontier.arxiv-2610-04697", "label": "Efficiency and robustness partition the solution space for memory in recurrent networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04697 \"Efficiency and robustness partition the solution space for memory in recurrent networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04697", "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04697", "title": "arXiv:2610.04697", "url": "https://arxiv.org/abs/2610.04697"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04697"]}}
+{"id": "claim.frontier.arxiv-2610-04662", "label": "Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04662 \"Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04662", "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04662", "title": "arXiv:2610.04662", "url": "https://arxiv.org/abs/2610.04662"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04662"]}}
+{"id": "claim.frontier.arxiv-2610-04630", "label": "Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04630 \"Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems\" (CC BY 4.0, submitted 2026-10-03) reports: \"Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04630", "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04630", "title": "arXiv:2610.04630", "url": "https://arxiv.org/abs/2610.04630"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04630"]}}
+{"id": "claim.frontier.arxiv-2610-04242", "label": "Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.04242 \"Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application\" (CC BY 4.0, submitted 2026-10-03) reports: \"We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-04242", "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv"}, {"id": "arxiv:2610.04242", "title": "arXiv:2610.04242", "url": "https://arxiv.org/abs/2610.04242"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-03", "source_ids": ["source.frontier.arxiv-2610-04242"]}}
+{"id": "claim.frontier.arxiv-2610-06918", "label": "Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.06918 \"Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning\" (CC BY 4.0, submitted 2026-10-02) reports: \"We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-06918", "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv"}, {"id": "arxiv:2610.06918", "title": "arXiv:2610.06918", "url": "https://arxiv.org/abs/2610.06918"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-06918"]}}
+{"id": "claim.frontier.arxiv-2610-03964", "label": "Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.03964 \"Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL\" (CC BY 4.0, submitted 2026-10-02) reports: \"Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-03964", "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv"}, {"id": "arxiv:2610.03964", "title": "arXiv:2610.03964", "url": "https://arxiv.org/abs/2610.03964"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-03964"]}}
+{"id": "claim.frontier.arxiv-2610-03008", "label": "Response Variability and Stability in Human Reasoning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2610.03008 \"Response Variability and Stability in Human Reasoning\" (CC BY 4.0, submitted 2026-10-02) reports: \"The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2610-03008", "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv"}, {"id": "arxiv:2610.03008", "title": "arXiv:2610.03008", "url": "https://arxiv.org/abs/2610.03008"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-10-02", "source_ids": ["source.frontier.arxiv-2610-03008"]}}
+{"id": "claim.frontier.arxiv-2609-39776", "label": "Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.39776 \"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms\" (CC BY 4.0, submitted 2026-09-30) reports: \"Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-39776", "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv"}, {"id": "arxiv:2609.39776", "title": "arXiv:2609.39776", "url": "https://arxiv.org/abs/2609.39776"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-30", "source_ids": ["source.frontier.arxiv-2609-39776"]}}
+{"id": "claim.frontier.arxiv-2609-21813", "label": "How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21813 \"How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing\" (CC BY 4.0, submitted 2026-09-30) reports: \"We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21813", "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21813", "title": "arXiv:2609.21813", "url": "https://arxiv.org/abs/2609.21813"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-30", "source_ids": ["source.frontier.arxiv-2609-21813"]}}
+{"id": "claim.frontier.arxiv-2609-36354", "label": "Explainability from Training with Applications to TCR-Epitope Prediction", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.36354 \"Explainability from Training with Applications to TCR-Epitope Prediction\" (CC BY 4.0, submitted 2026-09-28) reports: \"Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-36354", "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv"}, {"id": "arxiv:2609.36354", "title": "arXiv:2609.36354", "url": "https://arxiv.org/abs/2609.36354"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-36354"]}}
+{"id": "claim.frontier.arxiv-2609-35424", "label": "Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.35424 \"Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints\" (CC BY 4.0, submitted 2026-09-28) reports: \"It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-35424", "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv"}, {"id": "arxiv:2609.35424", "title": "arXiv:2609.35424", "url": "https://arxiv.org/abs/2609.35424"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-35424"]}}
+{"id": "claim.frontier.arxiv-2609-35246", "label": "Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.35246 \"Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty\" (CC BY 4.0, submitted 2026-09-28) reports: \"Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-35246", "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv"}, {"id": "arxiv:2609.35246", "title": "arXiv:2609.35246", "url": "https://arxiv.org/abs/2609.35246"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-28", "source_ids": ["source.frontier.arxiv-2609-35246"]}}
+{"id": "claim.frontier.arxiv-2609-32315", "label": "From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.32315 \"From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG\" (CC BY 4.0, submitted 2026-09-26) reports: \"We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-32315", "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv"}, {"id": "arxiv:2609.32315", "title": "arXiv:2609.32315", "url": "https://arxiv.org/abs/2609.32315"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-26", "source_ids": ["source.frontier.arxiv-2609-32315"]}}
+{"id": "claim.frontier.arxiv-2609-29972", "label": "Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy", "kind": "claim", "domain": "health", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.29972 \"Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy\" (CC BY 4.0, submitted 2026-09-24) reports: \"We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-29972", "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv"}, {"id": "arxiv:2609.29972", "title": "arXiv:2609.29972", "url": "https://arxiv.org/abs/2609.29972"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-24", "source_ids": ["source.frontier.arxiv-2609-29972"]}}
+{"id": "claim.frontier.arxiv-2609-29832", "label": "System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.29832 \"System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs\" (CC0 1.0, submitted 2026-09-24) reports: \"Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-29832", "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv"}, {"id": "arxiv:2609.29832", "title": "arXiv:2609.29832", "url": "https://arxiv.org/abs/2609.29832"}, {"id": "doi:10.2514/1.c038636", "title": "doi:10.2514/1.c038636", "url": "https://doi.org/10.2514/1.c038636"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-24", "source_ids": ["source.frontier.arxiv-2609-29832"]}}
+{"id": "claim.frontier.arxiv-2609-28815", "label": "Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.28815 \"Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry\" (CC BY 4.0, submitted 2026-09-23) reports: \"We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-28815", "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv"}, {"id": "arxiv:2609.28815", "title": "arXiv:2609.28815", "url": "https://arxiv.org/abs/2609.28815"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-23", "source_ids": ["source.frontier.arxiv-2609-28815"]}}
+{"id": "claim.frontier.arxiv-2609-26924", "label": "nnFoundation: 3D Foundation Models for Radiology", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.26924 \"nnFoundation: 3D Foundation Models for Radiology\" (CC BY 4.0, submitted 2026-09-22) reports: \"Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-26924", "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv"}, {"id": "arxiv:2609.26924", "title": "arXiv:2609.26924", "url": "https://arxiv.org/abs/2609.26924"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-26924"]}}
+{"id": "claim.frontier.arxiv-2609-25847", "label": "Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25847 \"Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications\" (CC BY 4.0, submitted 2026-09-22) reports: \"The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25847", "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25847", "title": "arXiv:2609.25847", "url": "https://arxiv.org/abs/2609.25847"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-25847"]}}
+{"id": "claim.frontier.arxiv-2609-25701", "label": "Fully Byzantine-Resilient Multi-Agent Reinforcement Learning", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25701 \"Fully Byzantine-Resilient Multi-Agent Reinforcement Learning\" (CC BY 4.0, submitted 2026-09-22) reports: \"Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents' parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25701", "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25701", "title": "arXiv:2609.25701", "url": "https://arxiv.org/abs/2609.25701"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-22", "source_ids": ["source.frontier.arxiv-2609-25701"]}}
+{"id": "claim.frontier.arxiv-2609-25437", "label": "Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.25437 \"Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development\" (CC BY 4.0, submitted 2026-09-21) reports: \"These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-25437", "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv"}, {"id": "arxiv:2609.25437", "title": "arXiv:2609.25437", "url": "https://arxiv.org/abs/2609.25437"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-21", "source_ids": ["source.frontier.arxiv-2609-25437"]}}
+{"id": "claim.frontier.arxiv-2609-05763", "label": "AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.05763 \"AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning\" (CC BY 4.0, submitted 2026-09-21) reports: \"We demonstrate this versatility across three applications.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-05763", "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv"}, {"id": "arxiv:2609.05763", "title": "arXiv:2609.05763", "url": "https://arxiv.org/abs/2609.05763"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-21", "source_ids": ["source.frontier.arxiv-2609-05763"]}}
+{"id": "claim.frontier.arxiv-2609-23703", "label": "Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23703 \"Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions\" (CC BY 4.0, submitted 2026-09-20) reports: \"Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23703", "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23703", "title": "arXiv:2609.23703", "url": "https://arxiv.org/abs/2609.23703"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-20", "source_ids": ["source.frontier.arxiv-2609-23703"]}}
+{"id": "claim.frontier.arxiv-2609-23199", "label": "LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23199 \"LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems\" (CC BY 4.0, submitted 2026-09-19) reports: \"Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23199", "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23199", "title": "arXiv:2609.23199", "url": "https://arxiv.org/abs/2609.23199"}, {"id": "doi:10.1109/jphot.2026.3734836", "title": "doi:10.1109/jphot.2026.3734836", "url": "https://doi.org/10.1109/jphot.2026.3734836"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-23199"]}}
+{"id": "claim.frontier.arxiv-2609-23085", "label": "Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.23085 \"Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving\" (CC BY 4.0, submitted 2026-09-19) reports: \"Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-23085", "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv"}, {"id": "arxiv:2609.23085", "title": "arXiv:2609.23085", "url": "https://arxiv.org/abs/2609.23085"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-23085"]}}
+{"id": "claim.frontier.arxiv-2609-22775", "label": "DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.22775 \"DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks\" (CC BY 4.0, submitted 2026-09-19) reports: \"The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-22775", "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv"}, {"id": "arxiv:2609.22775", "title": "arXiv:2609.22775", "url": "https://arxiv.org/abs/2609.22775"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-19", "source_ids": ["source.frontier.arxiv-2609-22775"]}}
+{"id": "claim.frontier.arxiv-2609-22615", "label": "Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.22615 \"Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors\" (CC BY 4.0, submitted 2026-09-18) reports: \"For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-22615", "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv"}, {"id": "arxiv:2609.22615", "title": "arXiv:2609.22615", "url": "https://arxiv.org/abs/2609.22615"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-22615"]}}
+{"id": "claim.frontier.arxiv-2609-21966", "label": "Automata-Theoretic Verification of Interval Markov Decision Processes", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21966 \"Automata-Theoretic Verification of Interval Markov Decision Processes\" (CC BY 4.0, submitted 2026-09-18) reports: \"We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21966", "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21966", "title": "arXiv:2609.21966", "url": "https://arxiv.org/abs/2609.21966"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-21966"]}}
+{"id": "claim.frontier.arxiv-2609-21270", "label": "Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21270 \"Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty\" (CC BY 4.0, submitted 2026-09-18) reports: \"For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21270", "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21270", "title": "arXiv:2609.21270", "url": "https://arxiv.org/abs/2609.21270"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-18", "source_ids": ["source.frontier.arxiv-2609-21270"]}}
+{"id": "claim.frontier.arxiv-2609-21093", "label": "A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21093 \"A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks\" (CC BY 4.0, submitted 2026-09-17) reports: \"We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21093", "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21093", "title": "arXiv:2609.21093", "url": "https://arxiv.org/abs/2609.21093"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-17", "source_ids": ["source.frontier.arxiv-2609-21093"]}}
+{"id": "claim.frontier.arxiv-2609-21057", "label": "FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.21057 \"FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift\" (CC BY 4.0, submitted 2026-09-17) reports: \"We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-21057", "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv"}, {"id": "arxiv:2609.21057", "title": "arXiv:2609.21057", "url": "https://arxiv.org/abs/2609.21057"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-17", "source_ids": ["source.frontier.arxiv-2609-21057"]}}
+{"id": "claim.frontier.arxiv-2609-19468", "label": "High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.19468 \"High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization\" (CC BY 4.0, submitted 2026-09-16) reports: \"The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-19468", "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv"}, {"id": "arxiv:2609.19468", "title": "arXiv:2609.19468", "url": "https://arxiv.org/abs/2609.19468"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-16", "source_ids": ["source.frontier.arxiv-2609-19468"]}}
+{"id": "claim.frontier.arxiv-2609-18467", "label": "Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.18467 \"Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation\" (CC BY 4.0, submitted 2026-09-16) reports: \"We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-18467", "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv"}, {"id": "arxiv:2609.18467", "title": "arXiv:2609.18467", "url": "https://arxiv.org/abs/2609.18467"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-16", "source_ids": ["source.frontier.arxiv-2609-18467"]}}
+{"id": "claim.frontier.arxiv-2609-17042", "label": "Learning Options for Compositional Motor Control with Adapter Banks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.17042 \"Learning Options for Compositional Motor Control with Adapter Banks\" (CC BY 4.0, submitted 2026-09-15) reports: \"We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-17042", "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv"}, {"id": "arxiv:2609.17042", "title": "arXiv:2609.17042", "url": "https://arxiv.org/abs/2609.17042"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-15", "source_ids": ["source.frontier.arxiv-2609-17042"]}}
+{"id": "claim.frontier.arxiv-2609-16899", "label": "Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16899 \"Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization\" (CC BY 4.0, submitted 2026-09-15) reports: \"Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16899", "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16899", "title": "arXiv:2609.16899", "url": "https://arxiv.org/abs/2609.16899"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-15", "source_ids": ["source.frontier.arxiv-2609-16899"]}}
+{"id": "claim.frontier.arxiv-2609-16353", "label": "Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16353 \"Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities\" (CC BY 4.0, submitted 2026-09-14) reports: \"We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16353", "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16353", "title": "arXiv:2609.16353", "url": "https://arxiv.org/abs/2609.16353"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-14", "source_ids": ["source.frontier.arxiv-2609-16353"]}}
+{"id": "claim.frontier.arxiv-2609-16258", "label": "The AI-Enabled Scientific Frontier", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.16258 \"The AI-Enabled Scientific Frontier\" (CC BY 4.0, submitted 2026-09-14) reports: \"Does AI outperform all techniques, or only some, and how is this changing?\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-16258", "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv"}, {"id": "arxiv:2609.16258", "title": "arXiv:2609.16258", "url": "https://arxiv.org/abs/2609.16258"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-14", "source_ids": ["source.frontier.arxiv-2609-16258"]}}
+{"id": "claim.frontier.arxiv-2609-05749", "label": "The Normalization of Deviance in AI Development", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.05749 \"The Normalization of Deviance in AI Development\" (CC BY 4.0, submitted 2026-09-13) reports: \"The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-05749", "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv"}, {"id": "arxiv:2609.05749", "title": "arXiv:2609.05749", "url": "https://arxiv.org/abs/2609.05749"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-13", "source_ids": ["source.frontier.arxiv-2609-05749"]}}
+{"id": "claim.frontier.arxiv-2609-14022", "label": "Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.14022 \"Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space\" (CC BY 4.0, submitted 2026-09-12) reports: \"We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-14022", "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv"}, {"id": "arxiv:2609.14022", "title": "arXiv:2609.14022", "url": "https://arxiv.org/abs/2609.14022"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-12", "source_ids": ["source.frontier.arxiv-2609-14022"]}}
+{"id": "claim.frontier.arxiv-2609-12866", "label": "Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12866 \"Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals\" (CC BY 4.0, submitted 2026-09-11) reports: \"We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12866", "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12866", "title": "arXiv:2609.12866", "url": "https://arxiv.org/abs/2609.12866"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-11", "source_ids": ["source.frontier.arxiv-2609-12866"]}}
+{"id": "claim.frontier.arxiv-2609-12486", "label": "Adaptive Agent Design", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12486 \"Adaptive Agent Design\" (CC BY 4.0, submitted 2026-09-11) reports: \"For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12486", "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12486", "title": "arXiv:2609.12486", "url": "https://arxiv.org/abs/2609.12486"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-11", "source_ids": ["source.frontier.arxiv-2609-12486"]}}
+{"id": "claim.frontier.arxiv-2609-12016", "label": "Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.12016 \"Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks\" (CC BY 4.0, submitted 2026-09-10) reports: \"We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-12016", "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv"}, {"id": "arxiv:2609.12016", "title": "arXiv:2609.12016", "url": "https://arxiv.org/abs/2609.12016"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-10", "source_ids": ["source.frontier.arxiv-2609-12016"]}}
+{"id": "claim.frontier.arxiv-2609-11530", "label": "pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.11530 \"pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches\" (CC BY 4.0, submitted 2026-09-10) reports: \"We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-11530", "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv"}, {"id": "arxiv:2609.11530", "title": "arXiv:2609.11530", "url": "https://arxiv.org/abs/2609.11530"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-10", "source_ids": ["source.frontier.arxiv-2609-11530"]}}
+{"id": "claim.frontier.arxiv-2609-08218", "label": "Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.08218 \"Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach\" (CC BY 4.0, submitted 2026-09-09) reports: \"We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-08218", "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv"}, {"id": "arxiv:2609.08218", "title": "arXiv:2609.08218", "url": "https://arxiv.org/abs/2609.08218"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-09", "source_ids": ["source.frontier.arxiv-2609-08218"]}}
+{"id": "claim.frontier.arxiv-2609-06163", "label": "Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.06163 \"Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-06163", "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv"}, {"id": "arxiv:2609.06163", "title": "arXiv:2609.06163", "url": "https://arxiv.org/abs/2609.06163"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-05", "source_ids": ["source.frontier.arxiv-2609-06163"]}}
+{"id": "claim.frontier.arxiv-2609-06066", "label": "Scalability of Graph Neural Network Policies in Wireless Communication Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.06066 \"Scalability of Graph Neural Network Policies in Wireless Communication Networks\" (CC BY 4.0, submitted 2026-09-05) reports: \"Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-06066", "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv"}, {"id": "arxiv:2609.06066", "title": "arXiv:2609.06066", "url": "https://arxiv.org/abs/2609.06066"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-05", "source_ids": ["source.frontier.arxiv-2609-06066"]}}
+{"id": "claim.frontier.arxiv-2609-02071", "label": "Turnpike properties in nonlinear system identification", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2609.02071 \"Turnpike properties in nonlinear system identification\" (CC BY 4.0, submitted 2026-09-02) reports: \"Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2609-02071", "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv"}, {"id": "arxiv:2609.02071", "title": "arXiv:2609.02071", "url": "https://arxiv.org/abs/2609.02071"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-09-02", "source_ids": ["source.frontier.arxiv-2609-02071"]}}
+{"id": "claim.frontier.arxiv-2608-31034", "label": "XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.31034 \"XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition\" (CC BY 4.0, submitted 2026-08-31) reports: \"Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-31034", "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv"}, {"id": "arxiv:2608.31034", "title": "arXiv:2608.31034", "url": "https://arxiv.org/abs/2608.31034"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-31", "source_ids": ["source.frontier.arxiv-2608-31034"]}}
+{"id": "claim.frontier.arxiv-2608-28387", "label": "Neuromorphic architectures as numerical solvers for computational neuroscience", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.28387 \"Neuromorphic architectures as numerical solvers for computational neuroscience\" (CC BY 4.0, submitted 2026-08-28) reports: \"In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-28387", "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv"}, {"id": "arxiv:2608.28387", "title": "arXiv:2608.28387", "url": "https://arxiv.org/abs/2608.28387"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-28", "source_ids": ["source.frontier.arxiv-2608-28387"]}}
+{"id": "claim.frontier.arxiv-2608-27536", "label": "Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.27536 \"Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games\" (CC BY 4.0, submitted 2026-08-27) reports: \"We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-27536", "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv"}, {"id": "arxiv:2608.27536", "title": "arXiv:2608.27536", "url": "https://arxiv.org/abs/2608.27536"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-27", "source_ids": ["source.frontier.arxiv-2608-27536"]}}
+{"id": "claim.frontier.arxiv-2608-26093", "label": "Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.26093 \"Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role\" (CC BY 4.0, submitted 2026-08-26) reports: \"We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-26093", "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv"}, {"id": "arxiv:2608.26093", "title": "arXiv:2608.26093", "url": "https://arxiv.org/abs/2608.26093"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-26", "source_ids": ["source.frontier.arxiv-2608-26093"]}}
+{"id": "claim.frontier.arxiv-2608-24219", "label": "Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.24219 \"Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception\" (CC BY 4.0, submitted 2026-08-25) reports: \"We also find that attractive faces are more prototypical in both shape and latent space.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-24219", "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv"}, {"id": "arxiv:2608.24219", "title": "arXiv:2608.24219", "url": "https://arxiv.org/abs/2608.24219"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-25", "source_ids": ["source.frontier.arxiv-2608-24219"]}}
+{"id": "claim.frontier.arxiv-2608-23972", "label": "Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.23972 \"Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic\" (CC BY 4.0, submitted 2026-08-25) reports: \"We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-23972", "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv"}, {"id": "arxiv:2608.23972", "title": "arXiv:2608.23972", "url": "https://arxiv.org/abs/2608.23972"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-25", "source_ids": ["source.frontier.arxiv-2608-23972"]}}
+{"id": "claim.frontier.arxiv-2608-21764", "label": "LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.21764 \"LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices\" (CC BY 4.0, submitted 2026-08-22) reports: \"These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-21764", "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv"}, {"id": "arxiv:2608.21764", "title": "arXiv:2608.21764", "url": "https://arxiv.org/abs/2608.21764"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-22", "source_ids": ["source.frontier.arxiv-2608-21764"]}}
+{"id": "claim.frontier.arxiv-2608-21020", "label": "Frequency-Selective Pinching-Antenna Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.21020 \"Frequency-Selective Pinching-Antenna Systems\" (CC BY 4.0, submitted 2026-08-21) reports: \"For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-21020", "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv"}, {"id": "arxiv:2608.21020", "title": "arXiv:2608.21020", "url": "https://arxiv.org/abs/2608.21020"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-21", "source_ids": ["source.frontier.arxiv-2608-21020"]}}
+{"id": "claim.frontier.arxiv-2608-20723", "label": "Conscious Access as Continuous-to-Discrete Translation", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.20723 \"Conscious Access as Continuous-to-Discrete Translation\" (CC BY 4.0, submitted 2026-08-21) reports: \"By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-20723", "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv"}, {"id": "arxiv:2608.20723", "title": "arXiv:2608.20723", "url": "https://arxiv.org/abs/2608.20723"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-21", "source_ids": ["source.frontier.arxiv-2608-20723"]}}
+{"id": "claim.frontier.arxiv-2608-19416", "label": "Robust Near-Field Beam Focusing Under Imperfect Localization", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.19416 \"Robust Near-Field Beam Focusing Under Imperfect Localization\" (CC BY 4.0, submitted 2026-08-19) reports: \"Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-19416", "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv"}, {"id": "arxiv:2608.19416", "title": "arXiv:2608.19416", "url": "https://arxiv.org/abs/2608.19416"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-19", "source_ids": ["source.frontier.arxiv-2608-19416"]}}
+{"id": "claim.frontier.arxiv-2608-18396", "label": "LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.18396 \"LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks\" (CC BY 4.0, submitted 2026-08-18) reports: \"Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-18396", "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv"}, {"id": "arxiv:2608.18396", "title": "arXiv:2608.18396", "url": "https://arxiv.org/abs/2608.18396"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-18", "source_ids": ["source.frontier.arxiv-2608-18396"]}}
+{"id": "claim.frontier.arxiv-2608-18060", "label": "Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.18060 \"Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis\" (CC BY 4.0, submitted 2026-08-18) reports: \"We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-18060", "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv"}, {"id": "arxiv:2608.18060", "title": "arXiv:2608.18060", "url": "https://arxiv.org/abs/2608.18060"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-18", "source_ids": ["source.frontier.arxiv-2608-18060"]}}
+{"id": "claim.frontier.arxiv-2608-16290", "label": "Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.16290 \"Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols\" (CC BY 4.0, submitted 2026-08-17) reports: \"For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA).\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-16290", "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv"}, {"id": "arxiv:2608.16290", "title": "arXiv:2608.16290", "url": "https://arxiv.org/abs/2608.16290"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-17", "source_ids": ["source.frontier.arxiv-2608-16290"]}}
+{"id": "claim.frontier.arxiv-2608-12037", "label": "Clustered Randomized Smoothing for Stochastic Prediction Functions", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12037 \"Clustered Randomized Smoothing for Stochastic Prediction Functions\" (CC BY 4.0, submitted 2026-08-12) reports: \"By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12037", "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12037", "title": "arXiv:2608.12037", "url": "https://arxiv.org/abs/2608.12037"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-12", "source_ids": ["source.frontier.arxiv-2608-12037"]}}
+{"id": "claim.frontier.arxiv-2608-11929", "label": "Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.11929 \"Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems\" (CC BY 4.0, submitted 2026-08-12) reports: \"The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-11929", "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv"}, {"id": "arxiv:2608.11929", "title": "arXiv:2608.11929", "url": "https://arxiv.org/abs/2608.11929"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-12", "source_ids": ["source.frontier.arxiv-2608-11929"]}}
+{"id": "claim.frontier.arxiv-2608-11175", "label": "Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.11175 \"Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments\" (CC BY 4.0, submitted 2026-08-11) reports: \"By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-11175", "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv"}, {"id": "arxiv:2608.11175", "title": "arXiv:2608.11175", "url": "https://arxiv.org/abs/2608.11175"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-11175"]}}
+{"id": "claim.frontier.arxiv-2608-10825", "label": "Cross-modal topology decodes battery faults from sparse voltage snapshots", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.10825 \"Cross-modal topology decodes battery faults from sparse voltage snapshots\" (CC BY 4.0, submitted 2026-08-11) reports: \"Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-10825", "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv"}, {"id": "arxiv:2608.10825", "title": "arXiv:2608.10825", "url": "https://arxiv.org/abs/2608.10825"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-10825"]}}
+{"id": "claim.frontier.arxiv-2608-08151", "label": "Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.08151 \"Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits\" (CC BY 4.0, submitted 2026-08-11) reports: \"These results show that reference orbit geometry is an important part of defensive cislunar mission design.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-08151", "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv"}, {"id": "arxiv:2608.08151", "title": "arXiv:2608.08151", "url": "https://arxiv.org/abs/2608.08151"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-11", "source_ids": ["source.frontier.arxiv-2608-08151"]}}
+{"id": "claim.frontier.arxiv-2608-10254", "label": "A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.10254 \"A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems\" (CC BY 4.0, submitted 2026-08-10) reports: \"We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-10254", "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv"}, {"id": "arxiv:2608.10254", "title": "arXiv:2608.10254", "url": "https://arxiv.org/abs/2608.10254"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-10", "source_ids": ["source.frontier.arxiv-2608-10254"]}}
+{"id": "claim.frontier.arxiv-2608-08599", "label": "Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.08599 \"Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System\" (CC BY 4.0, submitted 2026-08-09) reports: \"Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-08599", "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv"}, {"id": "arxiv:2608.08599", "title": "arXiv:2608.08599", "url": "https://arxiv.org/abs/2608.08599"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-09", "source_ids": ["source.frontier.arxiv-2608-08599"]}}
+{"id": "claim.frontier.arxiv-2608-12398", "label": "A Hierarchical Energy-Based Model for Multimodal Cognition", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12398 \"A Hierarchical Energy-Based Model for Multimodal Cognition\" (CC BY 4.0, submitted 2026-08-08) reports: \"We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12398", "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12398", "title": "arXiv:2608.12398", "url": "https://arxiv.org/abs/2608.12398"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-08", "source_ids": ["source.frontier.arxiv-2608-12398"]}}
+{"id": "claim.frontier.arxiv-2608-07289", "label": "Synthesizing Voltage Ride-Through Controllers for Data Centers", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.07289 \"Synthesizing Voltage Ride-Through Controllers for Data Centers\" (CC BY 4.0, submitted 2026-08-07) reports: \"The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-07289", "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv"}, {"id": "arxiv:2608.07289", "title": "arXiv:2608.07289", "url": "https://arxiv.org/abs/2608.07289"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-07", "source_ids": ["source.frontier.arxiv-2608-07289"]}}
+{"id": "claim.frontier.arxiv-2608-05481", "label": "From Local Learning to Global Prediction Through Layered Surprise Cascades", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.05481 \"From Local Learning to Global Prediction Through Layered Surprise Cascades\" (CC BY 4.0, submitted 2026-08-06) reports: \"Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-05481", "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv"}, {"id": "arxiv:2608.05481", "title": "arXiv:2608.05481", "url": "https://arxiv.org/abs/2608.05481"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-06", "source_ids": ["source.frontier.arxiv-2608-05481"]}}
+{"id": "claim.frontier.arxiv-2608-05348", "label": "TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.05348 \"TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks\" (CC BY 4.0, submitted 2026-08-05) reports: \"In both cases, TSDM significantly outperforms existing scheduling policies.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-05348", "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv"}, {"id": "arxiv:2608.05348", "title": "arXiv:2608.05348", "url": "https://arxiv.org/abs/2608.05348"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-05", "source_ids": ["source.frontier.arxiv-2608-05348"]}}
+{"id": "claim.frontier.arxiv-2608-12393", "label": "Metacognitive Skill Learning: A Computational Account", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.12393 \"Metacognitive Skill Learning: A Computational Account\" (CC BY 4.0, submitted 2026-08-04) reports: \"The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-12393", "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv"}, {"id": "arxiv:2608.12393", "title": "arXiv:2608.12393", "url": "https://arxiv.org/abs/2608.12393"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-12393"]}}
+{"id": "claim.frontier.arxiv-2608-04227", "label": "Random features for Grassmannian kernel approximation with bounded rank-one projections", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.04227 \"Random features for Grassmannian kernel approximation with bounded rank-one projections\" (CC BY 4.0, submitted 2026-08-04) reports: \"We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-04227", "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv"}, {"id": "arxiv:2608.04227", "title": "arXiv:2608.04227", "url": "https://arxiv.org/abs/2608.04227"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-04227"]}}
+{"id": "claim.frontier.arxiv-2608-04133", "label": "Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.04133 \"Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing\" (CC BY 4.0, submitted 2026-08-04) reports: \"By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-04133", "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv"}, {"id": "arxiv:2608.04133", "title": "arXiv:2608.04133", "url": "https://arxiv.org/abs/2608.04133"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-04133"]}}
+{"id": "claim.frontier.arxiv-2608-03967", "label": "Information-Geometric Forward Policy Training in GFlowNets", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.03967 \"Information-Geometric Forward Policy Training in GFlowNets\" (CC BY 4.0, submitted 2026-08-04) reports: \"Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-03967", "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv"}, {"id": "arxiv:2608.03967", "title": "arXiv:2608.03967", "url": "https://arxiv.org/abs/2608.03967"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-03967"]}}
+{"id": "claim.frontier.arxiv-2608-02978", "label": "Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02978 \"Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties\" (CC BY 4.0, submitted 2026-08-04) reports: \"Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02978", "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02978", "title": "arXiv:2608.02978", "url": "https://arxiv.org/abs/2608.02978"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-02978"]}}
+{"id": "claim.frontier.arxiv-2608-02976", "label": "Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02976 \"Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires\" (CC BY 4.0, submitted 2026-08-04) reports: \"The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02976", "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02976", "title": "arXiv:2608.02976", "url": "https://arxiv.org/abs/2608.02976"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-04", "source_ids": ["source.frontier.arxiv-2608-02976"]}}
+{"id": "claim.frontier.arxiv-2608-02244", "label": "Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02244 \"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling\" (CC BY 4.0, submitted 2026-08-03) reports: \"We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02244", "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02244", "title": "arXiv:2608.02244", "url": "https://arxiv.org/abs/2608.02244"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-03", "source_ids": ["source.frontier.arxiv-2608-02244"]}}
+{"id": "claim.frontier.arxiv-2608-02079", "label": "TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.02079 \"TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry\" (CC BY 4.0, submitted 2026-08-03) reports: \"The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-02079", "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv"}, {"id": "arxiv:2608.02079", "title": "arXiv:2608.02079", "url": "https://arxiv.org/abs/2608.02079"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-03", "source_ids": ["source.frontier.arxiv-2608-02079"]}}
+{"id": "claim.frontier.arxiv-2608-01220", "label": "Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.01220 \"Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap\" (CC BY 4.0, submitted 2026-08-02) reports: \"Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-01220", "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv"}, {"id": "arxiv:2608.01220", "title": "arXiv:2608.01220", "url": "https://arxiv.org/abs/2608.01220"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-02", "source_ids": ["source.frontier.arxiv-2608-01220"]}}
+{"id": "claim.frontier.arxiv-2608-00959", "label": "MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2608.00959 \"MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems\" (CC BY 4.0, submitted 2026-08-02) reports: \"A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2608-00959", "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv"}, {"id": "arxiv:2608.00959", "title": "arXiv:2608.00959", "url": "https://arxiv.org/abs/2608.00959"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-08-02", "source_ids": ["source.frontier.arxiv-2608-00959"]}}
+{"id": "claim.frontier.arxiv-2607-17248", "label": "Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.17248 \"Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study\" (CC BY 4.0, submitted 2026-07-31) reports: \"The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-17248", "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv"}, {"id": "arxiv:2607.17248", "title": "arXiv:2607.17248", "url": "https://arxiv.org/abs/2607.17248"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-31", "source_ids": ["source.frontier.arxiv-2607-17248"]}}
+{"id": "claim.frontier.arxiv-2607-14144", "label": "The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.14144 \"The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale\" (CC BY 4.0, submitted 2026-07-31) reports: \"We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-14144", "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv"}, {"id": "arxiv:2607.14144", "title": "arXiv:2607.14144", "url": "https://arxiv.org/abs/2607.14144"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-31", "source_ids": ["source.frontier.arxiv-2607-14144"]}}
+{"id": "claim.frontier.arxiv-2607-28833", "label": "Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28833 \"Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads\" (CC BY 4.0, submitted 2026-07-30) reports: \"We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28833", "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28833", "title": "arXiv:2607.28833", "url": "https://arxiv.org/abs/2607.28833"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28833"]}}
+{"id": "claim.frontier.arxiv-2607-28780", "label": "Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28780 \"Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement\" (CC BY 4.0, submitted 2026-07-30) reports: \"We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28780", "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28780", "title": "arXiv:2607.28780", "url": "https://arxiv.org/abs/2607.28780"}, {"id": "doi:10.1002/mar.70105", "title": "doi:10.1002/mar.70105", "url": "https://doi.org/10.1002/mar.70105"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28780"]}}
+{"id": "claim.frontier.arxiv-2607-28276", "label": "Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28276 \"Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming\" (CC BY 4.0, submitted 2026-07-30) reports: \"When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28276", "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28276", "title": "arXiv:2607.28276", "url": "https://arxiv.org/abs/2607.28276"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28276"]}}
+{"id": "claim.frontier.arxiv-2607-28224", "label": "CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28224 \"CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28224", "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28224", "title": "arXiv:2607.28224", "url": "https://arxiv.org/abs/2607.28224"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28224"]}}
+{"id": "claim.frontier.arxiv-2607-28185", "label": "Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks", "kind": "claim", "domain": "information", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.28185 \"Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks\" (CC BY 4.0, submitted 2026-07-30) reports: \"Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-28185", "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv"}, {"id": "arxiv:2607.28185", "title": "arXiv:2607.28185", "url": "https://arxiv.org/abs/2607.28185"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-30", "source_ids": ["source.frontier.arxiv-2607-28185"]}}
+{"id": "claim.frontier.arxiv-2607-26209", "label": "Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.26209 \"Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks\" (CC BY 4.0, submitted 2026-07-28) reports: \"The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-26209", "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv"}, {"id": "arxiv:2607.26209", "title": "arXiv:2607.26209", "url": "https://arxiv.org/abs/2607.26209"}, {"id": "doi:10.1109/ojcoms.2026.3717118", "title": "doi:10.1109/ojcoms.2026.3717118", "url": "https://doi.org/10.1109/ojcoms.2026.3717118"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-28", "source_ids": ["source.frontier.arxiv-2607-26209"]}}
+{"id": "claim.frontier.arxiv-2607-25526", "label": "Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.25526 \"Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data\" (CC BY 4.0, submitted 2026-07-28) reports: \"The findings show that a model's expressed geopolitical position can differ markedly from that of its developer's home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-25526", "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv"}, {"id": "arxiv:2607.25526", "title": "arXiv:2607.25526", "url": "https://arxiv.org/abs/2607.25526"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-28", "source_ids": ["source.frontier.arxiv-2607-25526"]}}
+{"id": "claim.frontier.arxiv-2607-25081", "label": "Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.25081 \"Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales\" (CC BY 4.0, submitted 2026-07-27) reports: \"The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-25081", "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv"}, {"id": "arxiv:2607.25081", "title": "arXiv:2607.25081", "url": "https://arxiv.org/abs/2607.25081"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-25081"]}}
+{"id": "claim.frontier.arxiv-2607-24423", "label": "Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels", "kind": "claim", "domain": "engineering", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.24423 \"Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels\" (CC BY 4.0, submitted 2026-07-27) reports: \"These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-24423", "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv"}, {"id": "arxiv:2607.24423", "title": "arXiv:2607.24423", "url": "https://arxiv.org/abs/2607.24423"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-24423"]}}
+{"id": "claim.frontier.arxiv-2607-24360", "label": "Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.24360 \"Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases\" (CC BY 4.0, submitted 2026-07-27) reports: \"Our findings reveal that manipulative narratives dominate when early spreaders hold them.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-24360", "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv"}, {"id": "arxiv:2607.24360", "title": "arXiv:2607.24360", "url": "https://arxiv.org/abs/2607.24360"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-27", "source_ids": ["source.frontier.arxiv-2607-24360"]}}
+{"id": "claim.frontier.arxiv-2607-22049", "label": "ELSA as an asset to the EU Quantum Act: A position paper", "kind": "claim", "domain": "social", "era": "frontier", "status": "frontier", "frontier": true, "summary": "arXiv:2607.22049 \"ELSA as an asset to the EU Quantum Act: A position paper\" (CC BY 4.0, submitted 2026-07-24) reports: \"Together, we show that ELSA is not only about mitigating risks.\"", "tags": ["frontier", "public-result"], "sources": [{"id": "source.frontier.arxiv-2607-22049", "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv"}, {"id": "arxiv:2607.22049", "title": "arXiv:2607.22049", "url": "https://arxiv.org/abs/2607.22049"}], "public_frontier": {"category": "public-result", "capability_status": "publicly-described", "disclosed_at": "2026-07-24", "source_ids": ["source.frontier.arxiv-2607-22049"]}}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/reviews.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/reviews.jsonl
new file mode 100644
index 000000000..e69de29bb
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/sources.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/sources.jsonl
new file mode 100644
index 000000000..3553d8fc0
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/sources.jsonl
@@ -0,0 +1,120 @@
+{"id": "source.frontier.arxiv-2610-21653", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.21653&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.21653: How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:26.911036+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T13:18:41Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.21653\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.21653</identifier>\n        <datestamp>2026-10-16</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.21653</id>\n        <created>2026-10-15</created>\n            <updated>2026-10-16</updated>\n        <authors>\n                <author>\n                    <keyname>Jing</keyname>\n                        <forenames>Zexuan</forenames>\n                </author>\n                <author>\n                    <keyname>Xiong</keyname>\n                        <forenames>Yifeng</forenames>\n                </author>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Fan</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Xuehua</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jianhua</forenames>\n                </author>\n        </authors>\n        <title>How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?</title>\n            <categories>cs.IT eess.SP math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Probabilistic constellation shaping (PCS), originally designed to fill the gap between finite uniform constellations and continuous capacity-achieving input distributions, has recently emerged as a central tool in adjusting the expected integrated sidelobe level (EISL) in integrated sensing and communication (ISAC). In this paper, we show that PCS goes beyond EISL: A large class of PCS methods, termed as type-based PCS, are capable of providing precise control over codeword-wise integrated sidelobe level ratio (ISLR) for systems employing orthogonal frequency division multiplexing (OFDM), thus yielding a stronger sensing performance guarantee than EISL control. We further show that OFDM is almost the only unitary modulation basis whose codeword-wise ISLR can be precisely controlled by type-based PCS. Based upon the analytical results, practical type-based PCS methods compatible with the probabilistic amplitude shaping (PAS) framework are conceived, which achieve higher communication rates than existing ISAC-oriented PCS methods under identical ISLR constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "raw_sha256": "8c4799a6e9171cbf2e6f040ed5d7f7b1375c7fbc3be31c71d10eeba3c418c026", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "988a955f0ada88209c49043a9886e9040c0d0d42dd45c51ab293e971ced01e40"}
+{"id": "source.frontier.arxiv-2610-19722", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19722&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.19722: ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:30.213616+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T14:47:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19722\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19722</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>cs:cs:SD</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19722</id>\n        <created>2026-10-14</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Cao</keyname>\n                        <forenames>Zhe</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jichao</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Xiao-Lei</forenames>\n                </author>\n        </authors>\n        <title>ONCship: A Large-Scale Underwater Acoustic Corpus for Ship Recognition</title>\n            <categories>cs.SD cs.AI eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Recent advances in deep learning have significantly improved underwater acoustic vessel recognition. However, existing publicly available datasets are typically limited in scale, hindering large-scale representation learning and downstream task evaluation. To address this limitation, we introduce ONCship, a large-scale underwater acoustic dataset comprising 4521 hours of curated recordings from Ocean Networks Canada (ONC) hydrophones and Automatic Identification System (AIS) data. We evaluate the proposed dataset across three tasks: self-supervised representation learning, vessel-type classification, and MMSI-Level Vessel Classification. Experiments on DeepShip and ShipsEar demonstrate the effectiveness of ONCship for acoustic representation learning, with joint pre-training on ONCship and AudioSet achieving a classification accuracy of 62.45% on DeepShip through linear probing. Furthermore, incorporating ONCship as auxiliary training data improves downstream vessel-type classification performance. Beyond conventional vessel-type classification, we further investigate MMSI-Level Vessel Classification, treating each vessel as a distinct identity. Experimental results show that models fine-tuned with different loss functions achieve Top-1 accuracies exceeding 53% and Top-5 accuracies approaching 69%, demonstrating the feasibility of distinguishing individual vessels through MMSI-Level Vessel Classification. Overall, ONCship provides a valuable resource for underwater acoustic representation learning and vessel recognition, while its rich vessel-level metadata enables further exploration of MMSI-Level Vessel Classification.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "raw_sha256": "0f35eee731a5c527d6d3fd90dc300e287ee02597ea7bf92d1a9e63fc05c9eb9b", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c57810c66e9a11b9179713138b49dc535c2e049646ac235532a72807955141ba"}
+{"id": "source.frontier.arxiv-2610-19515", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19515&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.19515: Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:33.576347+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T21:11:01Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19515\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19515</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19515</id>\n        <created>2026-10-14</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Bin</forenames>\n                </author>\n                <author>\n                    <keyname>Wan</keyname>\n                        <forenames>Senning</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Decheng</forenames>\n                </author>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Yonglei</forenames>\n                </author>\n                <author>\n                    <keyname>Xue</keyname>\n                        <forenames>Yu</forenames>\n                </author>\n        </authors>\n        <title>Heterogeneous Services in Multi-UAV Networks with No-Fly Zone and User Mobility</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>12 pages, 10 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this paper, we investigate a wireless communication network supported by multiple uncrewed aerial vehicles (UAVs). To ensure reliable connectivity, UAVs are desired to approach the boundaries of designated no-fly zones (NFZs) without violating them when mobile users (MUs) enter NFZs. To support heterogeneous communication services, MUs are assigned different priority levels based on their individual communication types. Considering the practical constraints arising from user mobility, heterogeneous communication requirements, and NFZs, the objective is to maximize the weighted sum of MU communication rates, where weights correspond to MU priorities. This is achieved by jointly optimizing trajectory planning, UAV transmission power control, and the binary association factor between UAVs and MUs. To address this challenging optimization problem under dynamic constraints, we develop a soft actor-critic algorithm with prioritized experience replay, which learns an adaptive control policy. Numerical results show that the proposed algorithm outperforms benchmark schemes in terms of convergence speed and stability. Moreover, it effectively meets diverse communication requirements, satisfies UAV energy constraints, and ensures reliable operation under NFZ constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "raw_sha256": "8a4aba3d1a64a0f58638361fbbd130ef96bab865eb3212938931e2898b9e0d9d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "13c89b022a3b13d52aa3d31d676a48c2c7cb113d64cc4527ccf9373a05fe2300"}
+{"id": "source.frontier.arxiv-2610-19137", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.19137&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.19137: Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:36.959397+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:39:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.19137\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.19137</identifier>\n        <datestamp>2026-10-15</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.19137</id>\n        <created>2026-10-13</created>\n            <updated>2026-10-15</updated>\n        <authors>\n                <author>\n                    <keyname>Park</keyname>\n                        <forenames>Jaebum</forenames>\n                </author>\n                <author>\n                    <keyname>Xie</keyname>\n                        <forenames>Yutao</forenames>\n                </author>\n                <author>\n                    <keyname>Ghosh</keyname>\n                        <forenames>Amitava</forenames>\n                </author>\n                <author>\n                    <keyname>Shi</keyname>\n                        <forenames>Yuanyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Heath</keyname>\n                        <forenames>Robert W.</forenames>\n                        <suffix>Jr</suffix>\n                </author>\n        </authors>\n        <title>Carbon-Aware Joint Resource and Energy Scheduling for Cellular Base Stations</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Decarbonizing cellular networks requires coordinating communication-resource and battery operation with time-varying electricity prices and carbon intensity. We jointly optimize base station and battery operation under a carbon-adjusted electricity price and traffic-demand constraints, and solve the mixed-integer nonconvex problem through a two-stage decomposition exact under a minimum-power rule. Using California price and carbon-intensity data, we show that carbon-aware scheduling reduces emissions most when low-price and low-carbon periods are misaligned. Above a carbon price of roughly 100-300 USD/ton, battery operation shifts from cost-driven to carbon-driven, cutting emissions by up to 57.8% relative to a cost-only schedule.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "raw_sha256": "fe01242089077427e4dc549de7ccf4d39b05d773a88ccd32d69cd544a51cfa68", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "01b1014e94b856630db04cfc5eeb640406394484358c1c81d06a7f9cfff1917d"}
+{"id": "source.frontier.arxiv-2610-17295", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.17295&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.17295: Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:40.315577+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T11:16:14Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.17295\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.17295</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.17295</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Nair</keyname>\n                        <forenames>Nikhil</forenames>\n                </author>\n                <author>\n                    <keyname>Caradonna</keyname>\n                        <forenames>Daniele</forenames>\n                </author>\n                <author>\n                    <keyname>Mathew</keyname>\n                        <forenames>Anup Teejo</forenames>\n                </author>\n                <author>\n                    <keyname>Renda</keyname>\n                        <forenames>Federico</forenames>\n                </author>\n                <author>\n                    <keyname>Della Santina</keyname>\n                        <forenames>Cosimo</forenames>\n                </author>\n                <author>\n                    <keyname>Feliu-Talegon</keyname>\n                        <forenames>Daniel</forenames>\n                </author>\n        </authors>\n        <title>Stabilizing Low-Stiffness Soft Robots at Unstable Equilibria: A Model-Based Optimal Control Approach</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>7 pages, 6 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Continuum soft robots are highly nonlinear and underactuated systems, which makes stabilizing them around unstable equilibrium points difficult. This challenge becomes even greater in low stiffness regimes, where gravitational forces dominate elastic forces. In this letter, we explore whether optimal control can address these challenges using a computa- tionally efficient method suitable for real time use. We propose a nonlinear model predictive control (NMPC) approach based on Differential Dynamic Programming (DDP), combined with an accurate reduced order Variable Strain model with analytical derivatives. This results in an efficient control framework for addressing the stabilization problem. Tested on a soft inverted pendulum and other hybrid soft rigid systems, the method outperforms traditional controllers, stabilizes more challenging configurations, and operates reliably at real time speeds (50 150 Hz), demonstrating both effectiveness and practical feasibility in experimental settings.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "raw_sha256": "79dda4367b1f87b8c40aac55e2ffc19759db0f5d39b8c244795a66921fe21b94", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "a2d5fa1c4cbbd18e8ed2da13bbda4f36da91193b7937bb6a1f7a7a750e1eb2ba"}
+{"id": "source.frontier.arxiv-2610-16273", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16273&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.16273: Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:43.624066+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-14T15:32:24Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.16273\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.16273</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>cs:cs:CL</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:AS</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.16273</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Naowarat</keyname>\n                        <forenames>Burin</forenames>\n                </author>\n                <author>\n                    <keyname>Tang</keyname>\n                        <forenames>Hao</forenames>\n                </author>\n                <author>\n                    <keyname>Goldwater</keyname>\n                        <forenames>Sharon</forenames>\n                </author>\n        </authors>\n        <title>Deep Speech Representations Track Word Timing along a Low-Dimensional Circular Trajectory</title>\n            <categories>cs.CL cs.LG eess.AS</categories>\n            <comments>Accepted at SLT 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Speech timing is fundamental for speech models to recognize words accurately, but how word-timing information is represented in speech models remains underexplored. We study this question using the framework of representational geometry, which investigates whether and how concepts are represented in low-dimensional subspaces of the representation space. Prior work in cognitive neuroscience has shown that when HuBERT feature sequences are averaged across words of the same duration, they form near-circular trajectories from word onset to word offset in a two-dimensional &#34;temporal subspace.&#34; Here we show that this circular structure of word timing is a general property of deep speech representations, by demonstrating its emergence in nine additional speech models covering both supervised and self-supervised. We then move beyond averaged word segments and show that in HuBERT, the circular trajectories are consistent enough at the level of individual words to perform word segmentation. Our approach, Rotary Segmentation (RoSeg), achieves 64.3% boundary F-score on Librispeech by detecting word boundaries when cycles complete in the temporal subspace. Although supervision is needed to identify a good subspace, nevertheless this result demonstrates much stronger implicit word knowledge in HuBERT than has previously been shown.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "raw_sha256": "5e7ed11114812fa727bc87fc240c8910f2c2fc09091fd8fb93b3c442b72d6c09", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f41d6c2578c5df57d05587437c1116de6bc66d9ccffa805b5daa2453cc59b93d"}
+{"id": "source.frontier.arxiv-2610-16259", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.16259&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.16259: Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:46.993903+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T07:13:11Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.16259\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.16259</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.16259</id>\n        <created>2026-10-12</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Luo</keyname>\n                        <forenames>Yubin</forenames>\n                </author>\n                <author>\n                    <keyname>Zhu</keyname>\n                        <forenames>Jieao</forenames>\n                </author>\n                <author>\n                    <keyname>Takahashi</keyname>\n                        <forenames>Takumi</forenames>\n                </author>\n                <author>\n                    <keyname>Ochiai</keyname>\n                        <forenames>Hideki</forenames>\n                </author>\n        </authors>\n        <title>Electromagnetic Singularity-Aware MIMO Channels: Scattering-Based Channel Modeling and Physics-Aware Power Allocation</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>Electromagnetic information theory (EIT) brings electromagnetic physics into wireless channel analysis and offers a physical view of channel structures hidden by conventional models. This paper studies channel instability near electromag- netic singular states, where small environmental perturbations can cause large variations in the end-to-end channel. Using resolvent-based spectral analysis, we develop an electromag- netic multiple-input multiple-output (MIMO) channel model that decomposes the end-to-end channel into a smooth regular component and singularity-associated components. The analysis shows that the singularity-associated components become more sensitive to environmental perturbations near singular states. The proposed model also reveals a limitation of conventional water filling (WF): power allocation based only on instan- taneous channel gains does not account for such instability. We therefore estimate singularity information from broadband MIMO channel state information (CSI) and develop a singularity- aware transmit covariance optimization method. Simulations demonstrate numerical stability of the estimated pole frequencies and illustrate the environmental sensitivity of pole-associated channel components. The proposed allocation reduces weighted singular-channel exposure by 90.32% while retaining 95% of the nominal WF rate.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "raw_sha256": "f64087f38dd3a8bf93323a562ba456bed673130b695e3e46e896d3ac4a84346e", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f274a4b2154d7a2616c2e8401414a5c3a90b853fa57d37cd6f0e7325de4cf1f8"}
+{"id": "source.frontier.arxiv-2610-15934", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15934&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.15934: Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:50.359909+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T08:37:33Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15934\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15934</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15934</id>\n        <created>2026-10-11</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Manas</keyname>\n                        <forenames>Kumar</forenames>\n                </author>\n                <author>\n                    <keyname>Paschke</keyname>\n                        <forenames>Adrian</forenames>\n                </author>\n        </authors>\n        <title>Efficient Hybrid Hard--Soft Signal Temporal Logic MPC for Driving under Multimodal Uncertainty</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>8 pages</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Motion planning for automated vehicles in interactive traffic has to simultaneously ensure safety, respect traffic rules, and maintain comfortable progress under multi-modal behavior uncertainty. Imposing all these requirements as hard constraints reduces feasibility, whereas treating them all as costs allows safety-critical requirements to be traded against progress. We propose a hybrid hard--soft Signal Temporal Logic (STL) MPC framework that optimizes a single shared ego trajectory against every retained behavior hypothesis: minimum-distance and speed predicates are imposed as explicit hard constraints, while soft STL robustness terms shape clearance, comfort, and interaction quality within the resulting feasible driving corridor. This retains robustness to discrete interaction modes without branch-specific contingent ego policies. We further identify substantial symbolic graph-construction overhead and introduce reachability-certified relevance screening and vectorized symbolic construction to reduce computational cost while preserving the feasible set and objective. Closed-loop Monte Carlo evaluation over six highway and intersection scenarios shows the highest strict success rate among the compared planners with no observed collisions or rule violations, at roughly a quarter of the planning latency of the unoptimized formulation. An ablation study separates the two layers: the hard constraints define the safety envelope, while the soft terms improve clearance and motion quality within it.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "raw_sha256": "6fc0d01863a12627c14392664ad7f31eee5a889ba1cd7e983a70f9c907e4d098", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "08b104445e804f34940cb4af90efdcff9630bd1d8bbaf06b78478b130c62070c"}
+{"id": "source.frontier.arxiv-2610-15072", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15072&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.15072: UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:53.741890+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T03:01:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15072\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15072</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>cs:cs:ET</setSpec>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15072</id>\n        <created>2026-10-10</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Singh</keyname>\n                        <forenames>Chandan Kumar</forenames>\n                </author>\n                <author>\n                    <keyname>de Sena</keyname>\n                        <forenames>Arthur Sousa</forenames>\n                </author>\n                <author>\n                    <keyname>Uniyal</keyname>\n                        <forenames>Smriti</forenames>\n                </author>\n                <author>\n                    <keyname>Kumar</keyname>\n                        <forenames>Deepak</forenames>\n                </author>\n                <author>\n                    <keyname>Upadhyay</keyname>\n                        <forenames>Prabhat K.</forenames>\n                </author>\n                <author>\n                    <keyname>Latva-aho</keyname>\n                        <forenames>Matti</forenames>\n                </author>\n        </authors>\n        <title>UAV-Mounted Hybrid RIS-Assisted ISAC-RSMA: Performance Analysis with Imperfect CSI and SIC</title>\n            <categories>eess.SP cs.ET cs.PF cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In integrated sensing and communication (ISAC) systems, strict sensing requirements can substantially constrain the transmit power available for communication. A hybrid reconfigurable intelligent surface (HRIS) with passive reflection and active amplification capabilities mounted on an unmanned aerial vehicle (UAV) can enhance coverage and strengthen communication links in such power-limited regimes. Meanwhile, rate-splitting multiple access (RSMA) provides an effective transmission strategy for managing inter-user interference, particularly in dense multiuser wireless scenarios. Motivated by this, we analyze the performance of a UAV-mounted HRIS-assisted monostatic ISAC system employing RSMA scheme. We consider the imperfections in the channel state information and successive interference cancellation in the RSMA, which are inevitable in practical system implementations. We then derive highly accurate expressions for outage probability, ergodic rate, and throughput to evaluate communication performance over Nakagami-$m$ fading channels. These expressions reveal key insights into the diversity order and coding gain of the system in the high signal-to-noise ratio regime. To characterize the sensing performance, we derive expressions for the probability of detection, the probability of false alarm, and the Cramér-Rao lower bound. Numerical results validate the theoretical findings and highlight the performance gains of the proposed system over conventional multiple-access schemes and RIS-based systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "raw_sha256": "3675e6c4979ac4b78f22d4a32e5b8d1d11ec2134b25275e6e76bffc5d4b36008", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f745e74d9e44b0a4d834f9a3e3b9044e24098584294a99cb55e0d580ee93122c"}
+{"id": "source.frontier.arxiv-2610-15052", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.15052&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.15052: On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms", "source_kind": "primary", "retrieved_at": "2026-10-18T16:39:57.062941+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-17T03:00:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.15052\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.15052</identifier>\n        <datestamp>2026-10-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.15052</id>\n        <created>2026-10-10</created>\n            <updated>2026-10-14</updated>\n        <authors>\n                <author>\n                    <keyname>Zakirzyanov</keyname>\n                        <forenames>Ruslan</forenames>\n                </author>\n        </authors>\n        <title>On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms</title>\n            <categories>eess.SY cs.SY</categories>\n            <doi>10.1109/RusAutoCon69876.2026.11707364</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The paper addresses the synthesis of a cost-optimal hardware architecture of the automated process control system (APCS) for continuous processes. The problem is formalized as the search for a minimum-cost rooted tree of devices subject to constraints on the number of I/O channels, the types and number of communication interfaces, the information capacity of processors, the regulation time and the reliability. The signals are grouped by control rooms. The problem is NP-hard, and a hybrid method is proposed that combines a deterministic hierarchy construction with a modified ant colony optimization (ACO) for device-type selection, enhanced by an adaptive heuristic. On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each. By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster. By the median cost, however, the deterministic-greedy baselines are more reliable (GA attains the best Friedman rank) because the cost of the ACO runs is highly variable. All differences are confirmed by the Friedman and Wilcoxon tests. The method targets the early-design search for the cheapest feasible architecture and synthesizes one within minutes at industrial scale (A up to 1086).</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "raw_sha256": "3447299b4f1d4da4aaf390428aea2c7611c4496066b701d2b7c116dbaea470cc", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "116f5fc01ea9ad0d80c28b297ad216a9871820fd47c42c21d0ce6a9c5b9c0f9e"}
+{"id": "source.frontier.arxiv-2610-13424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13424&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.13424: Minimum-Energy Control for Stochastic Linear Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:00.397076+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-12T03:01:50Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.13424\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.13424</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.13424</id>\n        <created>2026-10-09</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Sharma</keyname>\n                        <forenames>Vaishnavi</forenames>\n                </author>\n                <author>\n                    <keyname>Katewa</keyname>\n                        <forenames>Vaibhav</forenames>\n                </author>\n        </authors>\n        <title>Minimum-Energy Control for Stochastic Linear Systems</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be \\emph{small}, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices. Finally, we show that there exists a fundamental lower bound on the optimal control energy which cannot be overcome by increasing the time horizon of the problem.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "raw_sha256": "22a3fca0b400c191e4674f64c6e1316407fd72f0b63c2e0fb8bf005148204989", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "9c884ec4bce19fa7601c69963ff995e5c59bb5e9fc5ac1b233db9dbf7ab6a34e"}
+{"id": "source.frontier.arxiv-2610-13402", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.13402&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.13402: Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:03.917638+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T20:54:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.13402\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.13402</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.13402</id>\n        <created>2026-10-09</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Hua</keyname>\n                        <forenames>Thien Duc</forenames>\n                </author>\n                <author>\n                    <keyname>Mohammadi</keyname>\n                        <forenames>Mohammadali</forenames>\n                </author>\n                <author>\n                    <keyname>Ngo</keyname>\n                        <forenames>Hien Quoc</forenames>\n                </author>\n                <author>\n                    <keyname>Matthaiou</keyname>\n                        <forenames>Michail</forenames>\n                </author>\n        </authors>\n        <title>Tri-Hybrid SWIPT with Reconfigurable Parasitic Antennas</title>\n            <categories>eess.SP cs.IT math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose a coupling-aware tri-hybrid precoding architecture for simultaneous wireless information and power transfer (SWIPT) using reconfigurable parasitic antennas. By integrating multiport network theory and information theory, we develop a third precoding layer that explicitly accounts for mutual coupling and reactive energy storage within the antenna domain. To efficiently optimize this architecture, we propose a low-complexity tri-hybrid solution comprising coordinate descent (CD) for parasitic reactive load optimization, a singular value decomposition (SVD)-based analog precoder, and a protective partial zero-forcing (PPZF) digital precoder. Numerical results demonstrate that the transmit array introduces impedance mismatch that reduces the real power accepted by the antenna array. Moreover, the proposed tri-hybrid architecture significantly outperforms hybrid precoding by constructively exploiting the coupling effects, yielding substantial gains in spectral efficiency (SE) and sum non-linear harvested energy (NLHE) at a fraction of the hardware cost.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "raw_sha256": "3faf98da7cfd899549a8571c5a7f923fae735b83e4f2d948c1ebc786a8d99496", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f8c00971f29bb4588b8af250535d58c61fe250764eeba5d529f8773f9fc69d95"}
+{"id": "source.frontier.arxiv-2610-12779", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12779&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.12779: Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:07.356687+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-12T05:30:46Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12779\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12779</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12779</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Zhu</keyname>\n                        <forenames>Quanyan</forenames>\n                </author>\n        </authors>\n        <title>Game Petri Nets: Compositional Modeling and Analysis of Large-Scale Strategic Systems</title>\n            <categories>cs.GT cs.SY eess.SY</categories>\n            <comments>63 pages, 19 figures, 10 tables</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Large-scale strategic systems, such as maintenance workflows, cyber campaigns, and multi-agent AI pipelines, consist of many interactions whose outcomes determine which later interactions become possible, who takes part, and with what resources. We introduce game Petri nets, formalized as outcome-driven compositional game Petri nets (OCGPNs), to model and analyze such systems. Local games are attached to places of a colored Petri net, and a game-to-token interface converts each resolved game into typed tokens that enable, synchronize, or block subsequent games. For general, concurrent nets, we give an operational semantics and a structural theory based on invariants and Farkas certificates, which shows that guards can certify unreachability whereas incentive instruments can only change values. For sequential nets, the net induces a stochastic game on its game places. We prove that global equilibria are exactly collections of equilibria of local games augmented by continuation values, characterize through successor-level pivotality when downstream games change upstream behavior, and compute values place by place via a decomposition into strongly connected components, at a cost additive in local game sizes. A composition calculus based on place fusion glues certificates across subnets and summarizes downstream subnets by their entry values. Two running examples, a maintenance workflow and an intrusion campaign derived from multi-resolution cyber-defense games, illustrate the theory, including the composition of a newly discovered attack scenario with an existing campaign.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "raw_sha256": "364b2194deb86d3f3352d9bbee7b1f0e4880f38bd83463ad4452f2b522aa12aa", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f9c25bf719098c8ae67e08ff9e928d5479a5038d3410d175b3d60c443fb2415e"}
+{"id": "source.frontier.arxiv-2610-12604", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12604&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.12604: Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:10.837414+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T16:54:39Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12604\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12604</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12604</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>Pires</keyname>\n                        <forenames>Francisco I. T.</forenames>\n                </author>\n                <author>\n                    <keyname>Ferreira</keyname>\n                        <forenames>Jean C. S.</forenames>\n                </author>\n                <author>\n                    <keyname>Asim</keyname>\n                        <forenames>Fazal-E</forenames>\n                </author>\n        </authors>\n        <title>Low-Complexity Tensor-Based Channel Parameter Estimation for mmWave MIMO-Assisted Systems</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>This paper presents a low-complexity tensor-based channel estimation framework for downlink mmWave massive MIMO systems using passive Butler-matrix beamforming. By modeling received signals as a third-order PARAFAC tensor, we exploit known pilot structures via bilinear alternating least-squares (BALS) optimization to reduce computational overhead. The decoupled spatial factors are then processed via 1D and 2D ESPRIT to extract angles of arrival and departure with automatic pairing. Additionally, we derive the Cramer--Rao lower bound (CRLB) for this architecture. Simulations confirm the proposed estimator outperforms conventional least-squares, achieving accurate channel reconstruction and approaching the CRLB at moderate-to-high signal-to-noise ratios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "raw_sha256": "eeef40096b41ffa4a4d4c2a8d16c84970a4216e0836b7eabc05c338c2f73ecc0", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0f69bbc7ad14df3268ac6103cff3518bf1f494b81decce86614cd14d72558a23"}
+{"id": "source.frontier.arxiv-2610-12592", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12592&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.12592: Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:14.554610+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-16T16:53:48Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12592\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12592</identifier>\n        <datestamp>2026-10-12</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12592</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-12</updated>\n        <authors>\n                <author>\n                    <keyname>de Oliveira</keyname>\n                        <forenames>Daniel V. C.</forenames>\n                </author>\n                <author>\n                    <keyname>Alcantara</keyname>\n                        <forenames>Daniel C.</forenames>\n                </author>\n                <author>\n                    <keyname>Asim</keyname>\n                        <forenames>Fazal. E</forenames>\n                </author>\n                <author>\n                    <keyname>de Almeida</keyname>\n                        <forenames>Andre L. F.</forenames>\n                </author>\n                <author>\n                    <keyname>Fodor</keyname>\n                        <forenames>Gabor</forenames>\n                </author>\n        </authors>\n        <title>Simultaneous Direct and Indirect Channel Estimation for RIS-Assisted MIMO Communications</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>This paper introduces an enhanced channel estimation method for reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output (MIMO) communications. Considering the presence of both the direct link from the base station (BS) to the user equipment (UE) and the indirect link \\textit{via} the RIS, we formulate a tensor-based receiver for joint direct and indirect channel estimation called the TenDICE algorithm. The proposed receiver relies on an extended parallel factor analysis (PARAFAC) tensor model for the received pilot signals, from which the involved (direct and indirect link) channels are estimated using a simple alternating least squares scheme. The proposed TenDICE method is compared with the state-of-the-art least squares (LS) method, Khatri-Rao factorization (KRF) method, enhanced trilinear alternating least squares (E-TALS), and the theoretical Cramér-Rao lower bound (CRLB) based on normalized mean square error (NMSE) and spectral efficiency (SE). The proposed TenDICE outperforms the LS and E-TALS methods and performs similarly to the KRF methods while estimating the direct channel.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "raw_sha256": "bf799cfdc17091558d03c6e577118853afb8b8b23173cbcd2158119b4086b95d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "728178b554fafb9c6df7d8f396fc26c14c083753284bbc415cb32afa1dc9bfad"}
+{"id": "source.frontier.arxiv-2610-12038", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.12038&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.12038: Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:18.523961+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-13T09:41:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.12038\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.12038</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.12038</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Jayakumar</keyname>\n                        <forenames>Surya</forenames>\n                </author>\n                <author>\n                    <keyname>Narayanan</keyname>\n                        <forenames>Arun</forenames>\n                </author>\n                <author>\n                    <keyname>Dey</keyname>\n                        <forenames>Indrakshi</forenames>\n                </author>\n        </authors>\n        <title>Reputation-Graded Wavelet-Packet Subtree Allocation for IoT Sensor Networks</title>\n            <categories>eess.SP</categories>\n            <comments>6 pages</comments>\n            <msc-class>94A12, 94A08</msc-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Access control in Internet of Things (IoT) sensor networks usually acts above the physical layer: the fusion centre decides which reports to accept, while the radio of a compromised node keeps occupying the shared channel. This paper places the entitlement in the waveform: wavelet packet division multiplexing (WPDM) builds the channel as a binary tree of orthogonal pulses, and each sensor&#39;s reputation sets the depth of the subtree it may use: trusted sensors hold wide subbands, and low-trust sensors hold narrow subbands that the fusion centre withdraws one at a time. We prove that the allocation isolates sensors exactly under perfect timing, and that under a timing offset the energy leaking out of the lowpass leaf falls fourfold per tree level. The locally optimum detector of out-of-subtree transmission in impulsive Class-A noise weights each leaf in proportion to this predicted leakage. We bound the time needed to confine a compromised node and derive the optimal tree depth. In simulation, with demoted nodes radiating within their allocation, the scheme lowers the probability of a false global decision by 68% relative to fixed-allocation WPDM and to OFDM with the same reputation tiers, and by 44% relative to cryptographic re-attestation, which leads once more than 24% of the sensors are compromised.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "raw_sha256": "a662d63559948c0aa348a871e77241368a264fd996281acc44c90a6019882ed2", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b476417f2ee41b74fca96de5bb11b9df4f6d04059d80b02216eb38cdbd762492"}
+{"id": "source.frontier.arxiv-2610-11869", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11869&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.11869: Learning structured linear dynamical systems from missing observations", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:21.858745+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-13T08:17:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.11869\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.11869</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n            <setSpec>math:math:ST</setSpec>\n            <setSpec>stat:stat:TH</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.11869</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Ruwanpathirana</keyname>\n                        <forenames>Aravinda Kanchana</forenames>\n                </author>\n                <author>\n                    <keyname>Tyagi</keyname>\n                        <forenames>Hemant</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Sunny G. W.</forenames>\n                </author>\n        </authors>\n        <title>Learning structured linear dynamical systems from missing observations</title>\n            <categories>stat.ML cs.LG cs.SY eess.SY math.OC math.ST stat.TH</categories>\n            <comments>62 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider the problem of learning structured linear dynamical systems over convex sets $\\mathcal{K}$, where only a small subset of the observations are available at each time point. An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed. Non-asymptotic bounds are obtained for the statistical error, which depend on the local complexity of $\\mathcal{K}$, the trajectory length $T$, and the sub-sampling probability $p$. Convergence of the projected gradient descent algorithm is also established. The general theory is applied to settings where (i) $\\mathcal{K}$ is a subspace, (ii) $\\mathcal{K}$ is the set of bi-isotonic matrices, and (iii) $\\mathcal{K}$ is the set of matrices whose rows are formed by sampling Lipschitz functions. We show meaningful recovery of the transition matrix is possible for values of $T$ much smaller than what is required in the unconstrained case, and for $p = o(1)$.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "raw_sha256": "6d44a2e0f7be0e4388c150ad1f7ef5b1ba27f16536fbcb88bcff85913c14758f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d24bf7053259e1009dab07667d180d7323c768e0b56b6432b75750a911f5e4e6"}
+{"id": "source.frontier.arxiv-2610-11359", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.11359&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.11359: Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:26.578514+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T20:38:08Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.11359\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.11359</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.11359</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Kojima</keyname>\n                        <forenames>Hayate</forenames>\n                </author>\n                <author>\n                    <keyname>Noguchi</keyname>\n                        <forenames>Hikari</forenames>\n                </author>\n                <author>\n                    <keyname>Yamada</keyname>\n                        <forenames>Koki</forenames>\n                </author>\n                <author>\n                    <keyname>Tanaka</keyname>\n                        <forenames>Yuichi</forenames>\n                </author>\n        </authors>\n        <title>Unrolled Time-Varying Graph Signal Restoration under Spatiotemporal Smoothness Priors</title>\n            <categories>eess.SP</categories>\n            <comments>Submitted to IEEE Transactions on Signal and Information Processing over Networks</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this paper, we propose restoration methods for time-varying graph signals using deep algorithm unrolling (DAU). Time-varying graph signals, such as signals obtained from sensor networks, are nonuniformly distributed in space and observed as time series. Since these observed signals often contain noise and missing values, their restoration needs to consider both spatial and temporal relationships. Our approach is based on an optimization problem that models signal properties using a spatiotemporal regularizer that combines a Sobolev operator for spatial smoothness and a multi-tap FIR filter for temporal smoothness. We then unroll the iterative conjugate gradient method to solve this problem and learn the regularization parameters and filter coefficients in each iteration. Our method can be applied to supervised batch, supervised online, and unsupervised batch settings to learn these parameters. Experiments on several synthetic and real-world datasets show that the supervised batch method achieves the lowest RMSEs in almost all cases. The supervised online and the unsupervised batch methods outperform the existing methods of their own settings, and are often competitive with the existing batch methods.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "raw_sha256": "f150dda39f89c6ad96a8871042329a000d029b7a12c1b84dbfd649e161e7fa42", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "7e0343eabffc62bec7000e0aae22da8998a25dd04512ec58415a05fff45d2ec8"}
+{"id": "source.frontier.arxiv-2610-04959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04959&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04959: AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:30.351882+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-09T16:30:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04959\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04959</identifier>\n        <datestamp>2026-10-09</datestamp>\n            <setSpec>cs:cs:CE</setSpec>\n            <setSpec>q-fin:q-fin:CP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04959</id>\n        <created>2026-10-08</created>\n            <updated>2026-10-09</updated>\n        <authors>\n                <author>\n                    <keyname>Jin</keyname>\n                        <forenames>Yanzheng</forenames>\n                </author>\n                <author>\n                    <keyname>Shao</keyname>\n                        <forenames>Pengyang</forenames>\n                </author>\n                <author>\n                    <keyname>Ma</keyname>\n                        <forenames>Yunshan</forenames>\n                </author>\n                <author>\n                    <keyname>Pan</keyname>\n                        <forenames>Haowen</forenames>\n                </author>\n                <author>\n                    <keyname>Zhai</keyname>\n                        <forenames>Naixin</forenames>\n                </author>\n                <author>\n                    <keyname>Song</keyname>\n                        <forenames>Chen-Hui</forenames>\n                </author>\n                <author>\n                    <keyname>Shen</keyname>\n                        <forenames>Fei</forenames>\n                </author>\n                <author>\n                    <keyname>Kawaguchi</keyname>\n                        <forenames>Kenji</forenames>\n                </author>\n        </authors>\n        <title>AlphaPADI: Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion</title>\n            <categories>cs.CE q-fin.CP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Formulaic alpha discovery seeks symbolic expressions that predict cross-sectional asset returns. In deployment, multiple formulas are combined into an alpha pool, where each formula is valued through the complementary information it contributes to joint predictive performance. While Reinforcement Learning and Generative Flow Networks have emerged as promising paradigms for generating formulaic alphas, existing frameworks face three related challenges. First, generating formulas individually leaves pool context and inter-formula complementarity outside the generative state. Second, formula-wise generation lacks a unified mechanism for preserving and revising structures at different levels. Third, pool-level rewards jointly reflect predictive performance and redundancy but cannot be differentiated directly through symbolic evaluation to train the generator. To overcome these challenges, we introduce AlphaPADI (Formulaic Alpha Discovery via Pool-Aware Hierarchical Discrete Diffusion), a novel framework built around three components: (1) grammar-constrained buffer initialization that constructs syntactically valid pool candidates, (2) pool-aware hierarchical diffusion that reconstructs complete pools at multiple structural scales under the current pool context, and (3) reward-guided pool refinement that evaluates joint predictive performance and inner diversity, updates the elite buffer, and trains the reverse model through reconstruction and preference learning. Empirical results on the Chinese and U.S. stock markets demonstrate that AlphaPADI outperforms the evaluated baselines in both predictive and portfolio performance, thereby validating pool-aware generation as an effective framework for automated alpha discovery.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "raw_sha256": "1a70c9bf6fa159d235d0ee9f5d0bd616a90c1651a444531cf4a292f7cde82aee", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "6ab2d3d42c70fb9cb5d1f2fdf3fdbad63b2afebfe8d982d2bc4985532ca50736"}
+{"id": "source.frontier.arxiv-2610-09266", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09266&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.09266: Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:33.676958+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-11T12:13:43Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09266\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09266</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09266</id>\n        <created>2026-10-07</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Ncube</keyname>\n                        <forenames>Walter Zibusiso</forenames>\n                </author>\n                <author>\n                    <keyname>Qidan</keyname>\n                        <forenames>Ahmad Adnan</forenames>\n                </author>\n                <author>\n                    <keyname>El-Gorashi</keyname>\n                        <forenames>Taisir</forenames>\n                </author>\n                <author>\n                    <keyname>Elmirghani</keyname>\n                        <forenames>Jaafar M. H.</forenames>\n                </author>\n        </authors>\n        <title>Cooperative Dueling DQN SAC Learning for Energy Efficiency in Dynamic OWC Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Growing wireless traffic is increasing pressure on the congested radio-frequency spectrum. Optical wireless communication (OWC) provides a complementary solution by using the abundant unlicensed optical spectrum. However, indoor OWC networks are dynamic: users move, enter or leave the network, and subscribe to different services. Poorly coordinated resource allocation can consequently waste subcarriers, require excessive transmission power and cause frequent AP reassignments. Energy efficiency (EE), defined as the total delivered data rate divided by the total network power consumption, therefore requires the serving AP, number of allocated subcarriers, and transmission power to be jointly adapted while maintaining QoS. Optimising these in a dynamic time series, multi-service OWC environment produces a complex sequential EE optimisation problem. To address this problem, this work proposes Dual-Agent Resource Allocation using Deep Reinforcement Learning (DARA-DRL). DARA-DRL combines a branching duelling deep Q-network for association and subcarrier allocation with a conditional soft actor-critic agent for continuous power control. The agents are coupled through a common reward and a cooperative value update that evaluates each discrete allocation together with its corresponding power decision. Simulation results show that DARA-DRL remains within 5\\% of the optimal solution and, compared with state-of-the-art benchmarks, it improves EE by 28.8\\% and QoS satisfaction by 10.5\\%, while reducing online decision time by 14.5\\%. Results demonstrate that agent specialisation simplifies mixed-action learning, and cooperation outperforms independently trained agents.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "raw_sha256": "cf796d2e0976561a659db6e6e266824a358c3676f93262f7f0a25cf5957a26ed", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "12fe7bca805bf4f98d4fcb4c241caf5e0e89b48fef17e6dfd1df013f81804df0"}
+{"id": "source.frontier.arxiv-2610-09080", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09080&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.09080: User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:37.107474+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:37Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09080\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09080</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09080</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>User-Target Pairing for NOMA-Enabled ISAC in Low-Altitude Wireless Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents a non-orthogonal multiple access (NOMA)-enabled integrated sensing and communication (ISAC) framework for low-altitude wireless networks (LAWN), where an aerial access point simultaneously serves ground users and senses aerial targets. To improve both communication efficiency and sensing reliability, a matching-based user-target pairing (MUTP) scheme is proposed, in which strong and weak channel NOMA users are first paired into NOMA groups and then assigned to sensing targets according to a sensing-aware pairing criterion. Furthermore, an adaptive power allocation (APA) strategy is developed to balance communication quality-of-service requirements and target detection performance. The proposed MUTP-APA scheme is compared with fixed greedy pairing, exhaustive search pairing, and conventional ISAC benchmark schemes under both fixed power allocation and APA. Simulation results show that our proposed scheme achieves higher sum rate, improved worst-target detection probability, and lower communication and sensing outage probabilities compared with conventional ISAC and fixed pairing baselines in NOMA-ISAC LAWN. Moreover, the proposed method closely approaches the exhaustive search benchmark while avoiding the high computational complexity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "raw_sha256": "1b87a4c211b49f4dc4c9cc61a747545b5904c3d847ae986132578eb9ef321316", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "40f42d1852549b3d91758e008622e5ee8e4e77d3eaa824ceea2f996aa38e39c2"}
+{"id": "source.frontier.arxiv-2610-09010", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.09010&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.09010: Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:40.949103+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.09010\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.09010</identifier>\n        <datestamp>2026-10-08</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.09010</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-08</updated>\n        <authors>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>Hierarchical RIS Association for FR3 Space-Air-Ground Integrated Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The growing demand for diverse sixth-generation (6G) applications requires efficient connectivity, seamless service continuity, and extended network coverage. Although terrestrial infrastructures can effectively serve most wireless user equipment (UE), communication reliability may be significantly degraded in remote or blocked environments. To address this challenge, this paper proposes a reconfigurable intelligent surface (RIS)-assisted space-air-ground integrated network (SAGIN) operating in the upper mid-band (FR3) spectrum. The considered network consists of a terrestrial base station (BS), a low Earth orbit (LEO) satellite, multiple terrestrial RISs (TRISs), and unmanned aerial vehicle-mounted RISs (ARISs), where the BS serves as the primary access node, while the LEO satellite provides complementary connectivity when terrestrial links are unavailable or cannot satisfy the required quality-of-service (QoS) requirements. Within this framework, we formulate a hierarchical RIS association problem to maximize the achievable network sum rate under RIS capacity constraints. The resulting optimization problem is a mixed-integer nonconvex problem due to the binary association variables and the coupling among UEs competing for limited RIS resources. To efficiently solve the problem, we develop a hierarchical many-to-one matching-based RIS association framework. Specifically, UEs with satisfactory terrestrial connectivity are first associated with TRISs, whereas UEs that cannot be reliably served by the terrestrial network are subsequently associated with ARISs through the non-terrestrial network. Simulation results demonstrate that the proposed hierarchical association framework significantly outperforms greedy and random association schemes in terms of the achievable network sum rate.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "raw_sha256": "0654a4507afe0423abb979c9250856f3cc61de9e1e67670661e0b77fc21a36ed", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "1d0532f162e19a2af562bbe925af8df9d4ae4b4d5692f12f4b6d6aa787508f89"}
+{"id": "source.frontier.arxiv-2610-08744", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.08744&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.08744: RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:44.369404+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:44Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.08744\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.08744</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.08744</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Rahim</keyname>\n                        <forenames>Muddasir</forenames>\n                </author>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>Irfan</forenames>\n                </author>\n                <author>\n                    <keyname>Cherkaoui</keyname>\n                        <forenames>Soumaya</forenames>\n                </author>\n        </authors>\n        <title>RIS-Assisted Reliability Maximization for URLLC in Upper Mid-Band 6G Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In sixth-generation (6G) networks, supporting ultra-reliable low-latency communication (URLLC) services imposes stringent requirements on reliability, latency, and efficient resource utilization. The upper mid-band (FR3) spectrum has emerged as a promising candidate due to its favorable trade-off between coverage and bandwidth availability. However, achieving high reliability in dense deployments remains challenging due to interference and propagation impairments. To address these challenges, this paper investigates a reconfigurable intelligent surface (RIS)-assisted network operating in the FR3 band. We formulate a joint transmit power allocation and user equipment (UE)-RIS association problem to maximize network reliability under finite blocklength constraints. The resulting problem is nonconvex and combinatorial due to interference coupling and binary association variables. To solve this problem efficiently, we propose a multiphase resource allocation framework that integrates a successive convex approximation (SCA)-based power optimization scheme with a matching theory-based UE-RIS association algorithm. Simulation results show that the proposed scheme outperforms greedy and random baselines and achieves near-optimal performance close to the exhaustive search scheme.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "raw_sha256": "0f6222f829b88399d0eb9259c10f38b5702ac18b7e380a7233ddaae4bbcabf14", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "536e6fd8b63e63ef23e4ca0af7229c0557b89df17734b90d64b99c41d53daab6"}
+{"id": "source.frontier.arxiv-2610-07616", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07616&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.07616: Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:47.705922+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-11T06:06:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.07616\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.07616</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.07616</id>\n        <created>2026-10-06</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Siyuan</forenames>\n                </author>\n        </authors>\n        <title>Nine Trials to Recover: A Reproducible Benchmark for Repertoire-Free Soft-Robot Damage Adaptation</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>8 pages, 7 figures, 3 tables</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We present a repertoire-free benchmark for soft-robot damage recovery under nine online trials. The protocol pairs damage masks within each morphology, retains a measured nominal fallback, and separates method development from evaluation on new bodies. A Gaussian-process expected-improvement (GP-EI) reference controller adapts actuator phases using three initialization probes and six feedback-selected rollouts. Across two disjoint 75-body cohorts, it outperforms random search, Sobol, CEM, and CMA-ES under equal budgets. GP-EI improves the worst-mask gain on 69/75 confirmation bodies and exceeds these four baselines by 0.235-0.310 mean worst-mask reward. A TuRBO-style local GP is the closest comparator; the paired confidence interval includes zero. Post-confirmation fixed-controller replay finds 5.06 voxel widths of mean recovery together with a 0.0031 increase in worst-mask p99 geometric edge strain; a strict no-added-demand deployment gate retains 48.7% of mean gain. In a frozen development stress test that physically removes 10% of occupied voxels, GP-EI improves 71/75 bodies and exceeds official BoTorch TuRBO by 0.356 mean worst-mask gain. Together, the replayable controllers, body-level inference, and frozen-cohort evaluation provide a reference for measuring the added value of learned damage priors and future adaptation methods.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "raw_sha256": "78d181bf88088abb827f0d9bf8b0b1870f235056eb644c3e95813967bfd0fc58", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b8e311ba5ba5aea70d5e530f023b26a207f68247ab40bfbb244b9f4a71967590"}
+{"id": "source.frontier.arxiv-2610-07307", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.07307&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.07307: Metric-Based Equilibrium Selection in Noncooperative Differentiable Games", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:51.048449+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-14T10:06:57Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.07307\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.07307</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.07307</id>\n        <created>2026-10-05</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Mahesh</keyname>\n                        <forenames>Karan</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Runyu</forenames>\n                </author>\n                <author>\n                    <keyname>Benjamin</keyname>\n                        <forenames>Michael R.</forenames>\n                </author>\n                <author>\n                    <keyname>Zardini</keyname>\n                        <forenames>Gioele</forenames>\n                </author>\n        </authors>\n        <title>Metric-Based Equilibrium Selection in Noncooperative Differentiable Games</title>\n            <categories>cs.GT cs.SY eess.SY</categories>\n            <comments>8 pages, 2 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Metric conditioning can change which equilibrium attracts learning dynamics without moving the equilibria of a differentiable game. We study how to use state-dependent symmetric positive-definite (SPD) metrics to select among known equilibria by keeping a designated equilibrium attracting while making a rival unstable. Building on classical results on matrix stability under positive-definite multiplication, we characterize when such destabilization is possible and show how restricting the metric to act independently on each player limits the stability changes that can be achieved at differential Nash equilibria. We then combine a stabilizing metric at the selected equilibrium with a destabilizing metric at the rival through smooth interpolation, yielding a single metric field that preserves every equilibrium of the game while assigning the desired local stability types. We also derive a step-size condition for implementing the method in discrete time. The approach is validated on a continuous-commitment stag hunt and an entropy-regularized iterated prisoner&#39;s dilemma, where it selects the desired equilibrium in both settings.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "raw_sha256": "80322aa666d563eab6bbac32b565c4873a399915dc1b6b6ee6225279b945b029", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "db190ca75de36f7252538bc21c64a1b584c3a0951b9bddc1e696979f31d62540"}
+{"id": "source.frontier.arxiv-2610-06601", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06601&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.06601: Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:54.882591+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:40:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.06601\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.06601</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.06601</id>\n        <created>2026-10-05</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Lily Y.</forenames>\n                </author>\n                <author>\n                    <keyname>Shah</keyname>\n                        <forenames>Vade</forenames>\n                </author>\n                <author>\n                    <keyname>Walsh</keyname>\n                        <forenames>Dan</forenames>\n                </author>\n                <author>\n                    <keyname>Marden</keyname>\n                        <forenames>Jason R.</forenames>\n                </author>\n        </authors>\n        <title>Holding the Cold: Retention-Aware Inventory Control for Industrial Refrigeration</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Industrial refrigeration consumes substantial electricity, and compressors are the dominant energy consumers in these systems, making their operation central to improving energy efficiency. Compressors are most efficient when operated at full capacity, but the cooling they provide at full capacity can exceed the facility&#39;s immediate needs. This motivates pre-cooling, where compressors operate at full capacity and the excess cooling is stored as thermal inventory for future heat loads. However, stored cooling is inherently lossy: colder spaces attract additional heat from their surroundings, creating a tradeoff between maximizing compressor efficiency and avoiding cooling that dissipates before it can be used. We study this tradeoff through a retention factor, defined as the fraction of thermal inventory that survives after one minute, with the goals of understanding how retention affects the value of pre-cooling and designing effective control policies that account for this lossiness. We formulate compressor control as a stochastic inventory problem, solve for an optimal policy via dynamic programming alongside two simpler alternatives, and evaluate the performance of these policies using models fit from real industrial refrigeration facility data. Our results show that (i) pre-cooling can provide substantial energy savings when thermal inventory is sufficiently persistent, but that failing to account for retention can make aggressive pre-cooling increasingly costly as losses grow, and (ii) structurally simple policies that account for lossiness can still achieve near-optimal performance in lossy systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "raw_sha256": "db44e934295c8775a91e5cf11d90d572af662b6eaf5caa5252a09b77bcabe353", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0eaa8ac6a60f26aaa81e0800afeb4d714bd1099c6668446b296ad64d8aa30313"}
+{"id": "source.frontier.arxiv-2610-04776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04776&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04776: Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:40:59.302987+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-15T20:37:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04776\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04776</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:NI</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04776</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Zehua</forenames>\n                </author>\n                <author>\n                    <keyname>Adve</keyname>\n                        <forenames>Raviraj</forenames>\n                </author>\n                <author>\n                    <keyname>Bahceci</keyname>\n                        <forenames>Israfil</forenames>\n                </author>\n                <author>\n                    <keyname>Ahmed</keyname>\n                        <forenames>Yahia</forenames>\n                </author>\n        </authors>\n        <title>Scalable Distortion-Aware Clustering for Fronthaul-Limited Cell-Free MIMO Networks</title>\n            <categories>cs.IT cs.NI cs.SY eess.SY math.IT math.OC</categories>\n            <comments>To be presented at 2026 IEEE Globecom Workshops, 6 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies distortion-aware clustering for uplink fronthaul-limited cell-free MIMO networks employing maximum ratio combining (MRC). While MRC is appealing for its low-complexity, its performance is limited by interference, fronthaul distortions, and channel imperfections. This motivates clustering strategies that compensate for these impairments through coordination of access points. Since instantaneous small-scale fading-based optimization is not scalable in large systems, and is impractical due to frequent channel variations, we instead optimize an objective depending only on large-scale fading coefficients. To this end, asymptotic analysis is used to derive deterministic equivalent expressions for the average network sum rate, with focus on quantization distortion, leading to a quadratic-over-linear objective. Although maximizing such an objective under binary constraints is non-convex, we exploit its structure to develop a polynomial time scheme that attains the global optimum. Numerical results show that the proposed clustering method provides performance gains over improved variants of existing literature, and remains competitive with the small-scale fading-based global optimum obtained via exhaustive search.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "raw_sha256": "65f3cbf6c233d74a5a95483337b09fae0bcd7dc8efe45ed24ad83d4cac14c3d3", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "5b93b9ce56fc5e98ccfef2b33d7db0f648d40482c5c21f18cce92dd9335a3cc0"}
+{"id": "source.frontier.arxiv-2610-04697", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04697&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04697: Efficiency and robustness partition the solution space for memory in recurrent networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:25:52.277682+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04697\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04697</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04697</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Qian</keyname>\n                        <forenames>William</forenames>\n                </author>\n                <author>\n                    <keyname>Pehlevan</keyname>\n                        <forenames>Cengiz</forenames>\n                </author>\n        </authors>\n        <title>Efficiency and robustness partition the solution space for memory in recurrent networks</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In computational neuroscience, task-trained recurrent neural networks (RNNs) are commonly used as a testbed for exploring the space of recurrent circuit solutions compatible with a particular function. However, these networks are subject to inductive biases that may be misaligned with those of biological circuits, which operate under various efficiency and robustness constraints. Here, using a minimal stimulus recall task, we systematically characterize how the solution space of recurrent neural networks is shaped by the desiderata of weight efficiency, activity efficiency, and robustness to noise. We show that weight efficient solutions exhibit a low-rank bias that aligns with the inductive biases of task-trained networks and favors dynamical motifs involving slow, persistent dynamics, whereas activity efficiency encourages high-rank solutions that rely on transient amplification. Moreover, we find that activity efficient solutions exhibit a strong dissociation between high-variance modes of activity and those that causally influence network output. Unlike in static feedforward settings, we demonstrate that noise robustness and activity efficiency are generally in opposition, rather than synergistic. Using these findings, we propose a normative account of misaligned coding phenomena recently identified in premotor cortex.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "raw_sha256": "c09f9435412c919e81d6914df1fa253d7dd27324393a9f81c62ad862ef49e8af", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "70c3625edf33bac953904b3ff66843a9485b787e9c51ed308a5acc328415f6e9"}
+{"id": "source.frontier.arxiv-2610-04662", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04662&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04662: Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:02.786630+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04662\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04662</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04662</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Matheu</keyname>\n                        <forenames>Ryan</forenames>\n                </author>\n                <author>\n                    <keyname>Damera</keyname>\n                        <forenames>Sai Sandeep</forenames>\n                </author>\n                <author>\n                    <keyname>Baras</keyname>\n                        <forenames>John S.</forenames>\n                </author>\n                <author>\n                    <keyname>Belta</keyname>\n                        <forenames>Calin</forenames>\n                </author>\n        </authors>\n        <title>Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks</title>\n            <categories>eess.SY cs.RO cs.SY</categories>\n            <comments>9 pages, 6 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems. Many techniques exist for control synthesis according to temporal logic specifications, spanning a large variety of systems, including robotics. However, the vast majority of implementations are limited to Boolean temporal logics. Boolean temporal logic does not have an innate mechanism for quantifying abstention, rather verdicts are either definitively \\textit{True} or \\textit{False}. Recent work demonstrates that ternary logic is a capable formalism for reasoning about robotic behaviors, with the natural ability to classify uncertainty with the \\textit{Unknown} literal. Ternary temporal logic is still in its infancy, with work limited to synthesis for linear systems and monitoring. This work proposes a probabilistic relaxation of ternary temporal logic that allows for value and gradient computation through the same network while retaining exact verdicts on actual data. The relaxed network can be used as an objective in gradient-based control synthesis for both offline and online robotic control applications. We demonstrate the utility of our framework with two robotic manipulator tasks, one offline and one online, involving intermediate checking and sequencing of subtasks to demonstrate the benefit of our approach in terms of correct and timely execution.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "raw_sha256": "85d12fd40148ee7bf87682c0aff96df2e6a8c1fc843479cee1a454d7caf8bcc3", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "2333562e8980dd05d5de14fa6a01a2761333b8554a89d150529e38b3acbbfdd6"}
+{"id": "source.frontier.arxiv-2610-04630", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04630&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04630: Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:06.277049+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04630\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04630</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04630</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Sevim</keyname>\n                        <forenames>Nurullah</forenames>\n                </author>\n                <author>\n                    <keyname>Ibrahim</keyname>\n                        <forenames>Mostafa</forenames>\n                </author>\n                <author>\n                    <keyname>Ekin</keyname>\n                        <forenames>Sabit</forenames>\n                </author>\n                <author>\n                    <keyname>Rappaport</keyname>\n                        <forenames>Theodore S.</forenames>\n                </author>\n        </authors>\n        <title>Minimizing Energy Consumption based on Waste Factor in Multi-user Multi-relay Systems</title>\n            <categories>eess.SP</categories>\n            <comments>Submitted to IEEE Transactions on Green Communications and Networking for review</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The escalating energy demands of modern wireless networks make energy-efficient system design a central challenge for future 6G deployments. Relay-assisted communication has long been recognized as a powerful tool for improving coverage and throughput, tracing its roots to early repeater communication systems and the foundational relay channel models in information theory. Meanwhile, modern relay selection and routing strategies are primarily driven by rate-based or transmit-power-centric metrics, which often neglect hardware-level losses that is independent of the transmitted signal. As networks grow denser and more heterogeneous, signal-independent hardware inefficiencies and circuit power consumption increasingly dominate the total energy consumption and fundamentally alter the optimality of relay assignment decisions. To address the challenge of modeling signal-independent power consumption in relay-assisted systems, the Waste Factor (WF) framework is adopted: a hardware-aware, unifying metric that explicitly captures signal-independent power losses across cascaded transceivers and wireless channels. Using WF, the energy consumption of multi-user, multi-relay wireless systems is quantified and minimized under practical hardware and network constraints. The formulation jointly accounts for component inefficiencies, propagation losses, and relay-selection constraints. The proposed framework demonstrates that the WF formulation provides a fundamentally new way to model relay-assisted communication, enabling hardware-aware energy-per-bit minimization and a structured representation that enables computationally efficient analysis. Simulation results confirm that WF-based relay assignment reduces total energy per bit while improving the ability of users to satisfy minimum received-power requirements, outperforming conventional formulations across both metrics.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "raw_sha256": "bf9e6d2bfc8c8fdb3e4ab96f9b8289a85b35cbbaeed73ca9649353116709ab0f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "a96c8e00ca5f73d26486b40c1883be9f5703103e3a680ca112e82d3ca32a58ac"}
+{"id": "source.frontier.arxiv-2610-04242", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.04242&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.04242: Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:09.732094+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.04242\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.04242</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.04242</id>\n        <created>2026-10-03</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Kopp</keyname>\n                        <forenames>Fionna B.</forenames>\n                </author>\n                <author>\n                    <keyname>Schalkamp</keyname>\n                        <forenames>Ann-Kathrin</forenames>\n                </author>\n                <author>\n                    <keyname>Azzam</keyname>\n                        <forenames>Shadera</forenames>\n                </author>\n                <author>\n                    <keyname>Rudrapatna</keyname>\n                        <forenames>Vivek</forenames>\n                </author>\n                <author>\n                    <keyname>Borrelli</keyname>\n                        <forenames>Francesco</forenames>\n                </author>\n        </authors>\n        <title>Data-Driven Modeling and Predictive Control of Chronic Diseases: An Ulcerative Colitis Application</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The clinical management of chronic disease is naturally structured as a feedback control problem. Physicians observe the disease state at clinic visits and make decisions based on the patient&#39;s history and current state. We propose a framework that models the dynamics of chronic disease in response to therapy as an event-based controlled stochastic system, in which treatment decisions are made at discrete, irregularly spaced events while the disease evolves between events as a continuous-time Markov chain (CTMC) with state and input dependent transition rates. We demonstrate this framework in the setting of ulcerative colitis, where we identify the model from real-world clinical data in the electronic health record (EHR) of more than 3,000 patients with ulcerative colitis. Using the learned model, we formulate therapy selection as a model predictive control problem (MPC) that maximizes the expected time spent in inactive disease states, and we evaluate the resulting policy. In closed-loop simulation on 10 patients, the MPC achieves a cost at or below the observed clinical course in the majority of its realizations for 4 of the 10 patients, and its outcomes in all cases are comparable to observed care and within clinical guidelines.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "raw_sha256": "4332da2a42ded163ce121f0ec929629d0733adb31d068743d88242fadd61698f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "02d1905e276fc1affbaac29cede9c608294cb12017ad3a786775a89e026cdf37"}
+{"id": "source.frontier.arxiv-2610-06918", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.06918&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.06918: Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:13.187217+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.06918\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.06918</identifier>\n        <datestamp>2026-10-07</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.06918</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-07</updated>\n        <authors>\n                <author>\n                    <keyname>Maity</keyname>\n                        <forenames>Sreejeet</forenames>\n                </author>\n                <author>\n                    <keyname>Mitra</keyname>\n                        <forenames>Aritra</forenames>\n                </author>\n        </authors>\n        <title>Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We study federated reinforcement learning in which multiple agents interact with a common Markov decision process and communicate through a central server to collaboratively learn the optimal state-action value function. Our goal is to understand whether the sample-efficiency benefits of collaboration can be retained when a fraction of the agents behave adversarially and transmit arbitrarily corrupted information. To address this problem, we introduce Robust Async-Fed-Q, an epoch-based federated learning algorithm that combines variance-reduced estimation of the Bellman optimality operator at the agents with robust aggregation at the server. We establish high-probability finite-time guarantees showing that the proposed method preserves the statistical gains of collaboration among the honest agents while tolerating adversarial corruption. In particular, the effect of the adversarial agents decreases as the amount of data collected by each honest agent grows and eventually vanishes in the infinite-sample limit. We complement these guarantees with information-theoretic lower bounds that characterize the unavoidable statistical cost of adversarial corruption, leading to the first nearly matching upper and lower bounds for adversarially robust federated reinforcement learning. We further extend our framework to accommodate single-trajectory Markovian sampling and heterogeneous partial coverage, where different agents may explore different regions of the state-action space and learning relies on their collective coverage. Finally, our epoch-based design substantially improves the best known communication complexity for federated Q-learning under asynchronous sampling.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "raw_sha256": "843f6340943d482ecd7411f98236e2fdf6391672be1a2ba3cf2b55f7ead13123", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "ad367e1125862b0cde365e6002e243bb688d60cde0f095f6c4eef242603e3e9c"}
+{"id": "source.frontier.arxiv-2610-03964", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03964&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.03964: Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:16.918872+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-10T17:37:33Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.03964\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.03964</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.03964</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Hamad</keyname>\n                        <forenames>Ahrar N.</forenames>\n                </author>\n                <author>\n                    <keyname>Qidan</keyname>\n                        <forenames>Ahmad Adnan</forenames>\n                </author>\n                <author>\n                    <keyname>El-Gorashi</keyname>\n                        <forenames>Taisir E. H.</forenames>\n                </author>\n                <author>\n                    <keyname>Elmirghani</keyname>\n                        <forenames>Jaafar M. H.</forenames>\n                </author>\n        </authors>\n        <title>Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>6 pages, 4 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hybrid radio frequency (RF) and visible light communication (VLC) networks have emerged as a promising solution for high-capacity indoor wireless connectivity in sixth-generation (6G) systems. However, the limited optical coverage and vulnerability of VLC links to line-of-sight (LoS) blockage under user mobility remain fundamental challenges. In this work, a mirror-based intelligent reflecting surface (IRS) is deployed to assist a dynamic indoor hybrid RF/VLC network, where each mobile user is exclusively assigned to either the IRS-enhanced VLC subnetwork or the RF subnetwork through a binary selection decision. A joint optimization problem is then formulated to maximize proportional fairness by jointly optimizing the RF/VLC technology selection, power allocation, and IRS mirror roll and yaw orientation angles. To enable real-time adaptability, the problem is reformulated as a Markov decision process (MDP) and solved using a cooperative multi-agent deep reinforcement learning (DRL) algorithm based on centralized training with decentralized execution. Simulation results demonstrate the superior performance of the optimized hybrid network compared with optimized standalone VLC and RF networks. The results further validate the practicality and effectiveness of the proposed DRL framework compared to widely adopted DRL algorithms as well as conventional model-based optimization approaches.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "raw_sha256": "e627226b2f8ff04ae8d1e77d515ba06c5773442add1f87f2eadb38fe9bff5192", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b5da4f85321908e8fb1abe11f2e16b39526cadcf2645c5ed25e35e0fb17102b1"}
+{"id": "source.frontier.arxiv-2610-03008", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2610.03008&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2610.03008: Response Variability and Stability in Human Reasoning", "source_kind": "primary", "retrieved_at": "2026-10-18T15:46:01.612871+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T15:46:01Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2610.03008\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2610.03008</identifier>\n        <datestamp>2026-10-06</datestamp>\n            <setSpec>cs:cs:LO</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2610.03008</id>\n        <created>2026-10-02</created>\n            <updated>2026-10-06</updated>\n        <authors>\n                <author>\n                    <keyname>Bombach</keyname>\n                        <forenames>Clemens</forenames>\n                </author>\n                <author>\n                    <keyname>Lakshmanan</keyname>\n                        <forenames>Rajmadan</forenames>\n                </author>\n                <author>\n                    <keyname>Ragni</keyname>\n                        <forenames>Marco</forenames>\n                </author>\n        </authors>\n        <title>Response Variability and Stability in Human Reasoning</title>\n            <categories>cs.LO cs.AI q-bio.NC</categories>\n            <comments>Accepted as full paper with talk at the 48th Annual Conference of the Cognitive Science Society (CogSci 2026). This version contains minor revisions</comments>\n            <journal-ref>Proceedings of the 48th Annual Meeting of the Cognitive Science Society (2026)</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Understanding how humans reason -- and how reasoning responses vary across tasks and individuals -- remains a core challenge for modeling and explanation in cognitive science. We investigate the stability of response patterns within reasoners and whether variation in these patterns can be used to predict learning effects. We introduce a formal, geometry-based method to quantify distances between individual reasoning patterns and their internal variability, grounded in heuristic theories. The proposed framework is tested against experimental data via generalized linear mixed-effects models and clustering, where we find that our proposed variation measure interacts with correctness to predict performance gains. Moreover, we find that reasoning patterns are stable over time within the same reasoner. The method is general enough to be applied to other reasoning domains.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "raw_sha256": "46965b72d267a444f6a8d696c3397a2870b0cd78a515140f8636afef287c2efc", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "370c4bd49c224f027734203b8a2aebd2579c49777c749a6b4c81ce2d2d0f33d3"}
+{"id": "source.frontier.arxiv-2609-39776", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.39776&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.39776: Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:21.627238+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.39776\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.39776</identifier>\n        <datestamp>2026-10-01</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.39776</id>\n        <created>2026-09-30</created>\n            <updated>2026-10-01</updated>\n        <authors>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Jiarui</forenames>\n                </author>\n                <author>\n                    <keyname>Feng</keyname>\n                        <forenames>Wei</forenames>\n                </author>\n                <author>\n                    <keyname>Dong</keyname>\n                        <forenames>Chao</forenames>\n                </author>\n                <author>\n                    <keyname>Ge</keyname>\n                        <forenames>Ning</forenames>\n                </author>\n                <author>\n                    <keyname>Wu</keyname>\n                        <forenames>Qihui</forenames>\n                </author>\n        </authors>\n        <title>Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms</title>\n            <categories>cs.IT cs.SY eess.SY math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>With the rapid development of the low-altitude economy, low-altitude operations are booming, where complex missions require collaborative efforts among multiple heterogeneous low-altitude aircrafts (LAAs). Specifically, different LAAs assume distinct roles: some for sensing, some for communication, some for computing, and others for mission execution, together forming a sensing-communication-computing-control (SC3) closed loop, akin to a reflex arc. To enable efficient coordination in such multi-LAA swarms, we introduce the concept of operational-capability entropy (OCE) to quantify the effective work capability of operational LAAs. Accordingly, by jointly considering heterogeneous OCE and channel conditions among LAAs, we formulate the power allocation problem with the goal of minimizing the linear quadratic regulator (LQR) cost, which serves as a metric for mission efficiency. The resulting complex optimization problem is decomposed into two convex subproblems that are solved iteratively, with closed-form solutions derived for each. Simulation results demonstrate that the proposed mission-oriented adaptive power allocation scheme significantly outperforms traditional ones.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "raw_sha256": "aaceb7ab0710898c8f01fd5a55deae9b7a6629325149991ce4d2984a4b20fe67", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "773780e6a84af352d5f67c7203af323ac6f7f241297b06e9e32eef2ae2cab441"}
+{"id": "source.frontier.arxiv-2609-21813", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21813&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.21813: How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:25.104371+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21813\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21813</identifier>\n        <datestamp>2026-10-01</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21813</id>\n        <created>2026-09-30</created>\n            <updated>2026-10-01</updated>\n        <authors>\n                <author>\n                    <keyname>Corlay</keyname>\n                        <forenames>Vincent</forenames>\n                </author>\n                <author>\n                    <keyname>Enttsel</keyname>\n                        <forenames>Andriy</forenames>\n                </author>\n        </authors>\n        <title>How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing</title>\n            <categories>stat.ML cs.CV eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In classification-oriented adaptive sensing, posterior samples characterize uncertainty at the current measurement state and can serve two roles: they may guide the next sensing direction, while their class labels provide votes for the candidate classes and determine whether sensing should continue. We focus on the stopping layer that turns these votes into a declaration, without modifying the posterior sampler or sensing directions. A natural plug-in rule declares when the observed vote share exceeds a threshold. We show that this threshold is not itself a confidence guarantee: when the underlying vote mass equals the threshold, the plug-in rule declares about half the time. As alternatives, we calibrate a fixed-sample rule and a finite-horizon sequential rule to a prescribed false-declaration probability, and study exact curtailment, which stops a fixed-pool rule once its final verdict is forced. We then derive how one-round declaration probabilities determine posterior-sample cost and classification accuracy along a sensing path. On MNIST with DDRM and a fixed PCA-guided probe sequence, curtailment saves up to 62% of posterior samples. Among the evaluated rules at matched operating points, sequential stopping reduces the cost the most. At a high accuracy, that same sequential rule can trade more posterior samples for fewer measurements.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "raw_sha256": "0824c9f08ab15ffa4a9b59bdd14582d9309bcfea913d78adabf7f3d656a8b71b", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "33eb1c1c1963d727e7c98efe8cfc30d92ce80c3ff70d67c5f1487cd234c42a5f"}
+{"id": "source.frontier.arxiv-2609-36354", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.36354&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.36354: Explainability from Training with Applications to TCR-Epitope Prediction", "source_kind": "primary", "retrieved_at": "2026-10-18T16:25:55.718326+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.36354\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.36354</identifier>\n        <datestamp>2026-09-30</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:CE</setSpec>\n            <setSpec>q-bio:q-bio:BM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.36354</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-30</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Jiarui</forenames>\n                </author>\n                <author>\n                    <keyname>Yin</keyname>\n                        <forenames>Zixiang</forenames>\n                </author>\n                <author>\n                    <keyname>Landry</keyname>\n                        <forenames>Samuel</forenames>\n                </author>\n                <author>\n                    <keyname>Ding</keyname>\n                        <forenames>Zhengming</forenames>\n                </author>\n                <author>\n                    <keyname>Mettu</keyname>\n                        <forenames>Ramgopal</forenames>\n                </author>\n        </authors>\n        <title>Explainability from Training with Applications to TCR-Epitope Prediction</title>\n            <categories>cs.LG cs.AI cs.CE q-bio.BM</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Deep learning models have achieved strong performance in artificial intelligence for science, yet their black-box nature limits our understanding of how they learn scientific tasks. Existing methods for interpretability provide limited insight into how models organize evidence and evolve during learning. We introduce explainability from training (EFT), a model-agnostic paradigm that traces model interpretation during training to explain why models rely on specific features and how they organize these features as predictive evidence. We apply EFT to four state-of-the-art T cell receptor (TCR)-epitope prediction models, TCR-SRIM, TULIP, MixTCRpred, and NetTCR-2.2, spanning post-hoc and interpret-by-design approaches as well as transformers and CNNs. To investigate how structural information affects model explanations, we introduce a benchmark, TCR-XAI2, containing 388 unique experimentally resolved TCR-epitope structures, complemented by structures predicted using AlphaFold3, Boltz-2, TCRModel2, tFold-TCR, and OpenFold3. Using EFT with TCR-XAI2, we demonstrate that (1) CNN and transformer models exhibit distinct learning trajectories; (2) TCR $α$ and $β$ evidence can conflict during learning, limiting the benefits of jointly modeling both chains, while MHC information mitigates this; and (3) real versus predicted structural data for TCR-epitope prediction exhibits distinct TCR and peptide feature preferences as well as differing trajectories of model certainty.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "raw_sha256": "38ec60d54e1e57958c9056610abf924a3c98c12c32aa18504d6828f119cd5524", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "78c13cb2102a0ea42e9dd21bc5661f7682044a7162042c793b5847585153ba3f"}
+{"id": "source.frontier.arxiv-2609-35424", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35424&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.35424: Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:28.544365+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:28Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.35424\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.35424</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.35424</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Xiaoying</forenames>\n                </author>\n                <author>\n                    <keyname>Huang</keyname>\n                        <forenames>Linbin</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Hangyu</forenames>\n                </author>\n                <author>\n                    <keyname>Xin</keyname>\n                        <forenames>Huanhai</forenames>\n                </author>\n        </authors>\n        <title>Scalable Small-Signal Stability Assessment of Power Systems Based on Frequency-Domain Quadratic Constraints</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Small-signal stability analysis of power electronics-dominated power systems is becoming increasingly challenging due to the large-scale integration of heterogeneous grid-following (GFL) and grid-forming (GFM) converters. Classical centralized methods, such as eigenvalue analysis and the generalized Nyquist criterion, provide direct stability assessment tools but exhibit limited scalability as the system size increases. This motivates scalable analysis methods for stability assessment and device-level diagnosis, and calls for less conservative stability conditions. To this end, this paper proposes a scalable small-signal stability assessment method with quantitative stability indices for multi-converter systems based on frequency-domain quadratic constraints (FQCs). It is shown that several existing stability conditions, including geometric conditions based on the Davis-Wielandt (DW) shell, numerical range, $x$-$z$ graph, scaled relative graph (SRG), mixed gain-phase condition, and passivity condition, are special cases of the FQC-based stability condition. This FQC-based formulation also clarifies the requirements for decentralized verification of these existing stability conditions. To further reduce conservatism, a full-multiplier FQC-based stability condition is developed, based on which an optimization problem is formulated for scalable stability certification and device-level diagnosis using quantitative stability indices without relying on graphical inspection. Combined with the mixed gain-phase condition, this optimization problem forms a hierarchical screening-diagnosis procedure that improves efficiency. Case studies demonstrate that the proposed method is less conservative than existing criteria and can effectively identify problematic devices associated with potential instability risks.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "raw_sha256": "c64e508de30c47bbfcc862ca0048d84010cdc07e16d1eca153c32856cc6358b5", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "091f1242f2402b03b7c0d848463db592ef066784d14b98ac58649fdf78d70b73"}
+{"id": "source.frontier.arxiv-2609-35246", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.35246&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.35246: Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:31.949330+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.35246\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.35246</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.35246</id>\n        <created>2026-09-28</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Azam</keyname>\n                        <forenames>M. Furqan</forenames>\n                </author>\n                <author>\n                    <keyname>Vanin</keyname>\n                        <forenames>Marta</forenames>\n                </author>\n                <author>\n                    <keyname>Hermans</keyname>\n                        <forenames>Chris</forenames>\n                </author>\n                <author>\n                    <keyname>Deconinck</keyname>\n                        <forenames>Geert</forenames>\n                </author>\n        </authors>\n        <title>Hard-Constrained Probabilistic Factor Graph Neural Network for Distribution System State Estimation under Non-Gaussian Uncertainty</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Preprint. Submitted to Sustainable Energy, Grids and Networks</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Robust and accurate state estimation is fundamental for the reliable operation and monitoring of active distribution networks. Conventional numerical estimators, such as weighted least squares, are computationally slower and often suffer from convergence issues in the presence of sparse measurements affected by non-Gaussian noise. Physics-informed neural networks have recently emerged as a promising alternative by incorporating physical principles through residual-based penalty terms in the objective, which can improve robustness to noise and computational efficiency. However, such penalty-based approaches do not guarantee strict enforcement of physical constraints during inference and provide limited support for principled uncertainty modeling. To address these limitations, we propose a novel Hard-Constrained, Physics-Informed Factor Graph Neural Network (HCP-PINN) that formulates distribution system state estimation as a probabilistic constrained estimation problem on a factor graph. The proposed approach explicitly models non-Gaussian (pseudo-)measurement uncertainty through flexible, closed-form likelihood-based loss functions. It further incorporates a differentiable optimization-based estimation layer that strictly enforces nonlinear equality constraints and measurement consistency, producing physically feasible state estimates during both training and inference. To the best of our knowledge, this is the first PINN-based DSSE framework to combine hard physical constraints with non-Gaussian uncertainty modeling for unbalanced three-phase networks. Numerical experiments demonstrate that the proposed method delivers more accurate and physically consistent state estimates than deep learning benchmarks and numerical estimators, while exhibiting greater robustness to network model errors and improved computational efficiency under realistic measurement scenarios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "raw_sha256": "94349704a65662d51c74061cba3ecf4d9e0ab03b597766732cbda770fb3f684d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8d9c3ec5692c003471b502d390e813495e471dcfa3d046234d31c3fd53a0113f"}
+{"id": "source.frontier.arxiv-2609-32315", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.32315&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.32315: From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG", "source_kind": "primary", "retrieved_at": "2026-10-18T16:25:59.126761+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:25:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.32315\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.32315</identifier>\n        <datestamp>2026-09-29</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.32315</id>\n        <created>2026-09-26</created>\n            <updated>2026-09-29</updated>\n        <authors>\n                <author>\n                    <keyname>Hadid</keyname>\n                        <forenames>Vanessa</forenames>\n                </author>\n                <author>\n                    <keyname>Abdelhedi</keyname>\n                        <forenames>Hamza</forenames>\n                </author>\n                <author>\n                    <keyname>Pascarella</keyname>\n                        <forenames>Annalisa</forenames>\n                </author>\n                <author>\n                    <keyname>Solla</keyname>\n                        <forenames>Sara A.</forenames>\n                </author>\n                <author>\n                    <keyname>Cisek</keyname>\n                        <forenames>Paul</forenames>\n                </author>\n                <author>\n                    <keyname>Jerbi</keyname>\n                        <forenames>Karim</forenames>\n                </author>\n        </authors>\n        <title>From Signals to Trajectories: A Primer on Low-Dimensional Dynamics in Human EEG and MEG</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Neural activity unfolds not as a set of independent signals, but as a coordinated dynamical process that can be described as a point moving through a high-dimensional state space. This perspective has contributed substantially to recent developments in systems neuroscience, especially through studies of directly recorded neuronal population activity, but remains comparatively underused in non-invasive human recordings such as EEG and MEG. In this primer, we present a neural trajectory analysis based on Principal Component Analysis (PCA) as an accessible route into extending the concepts of neural trajectories in state space to human electrophysiology. We explain how EEG/MEG activity can be organized into neural state representations, projected onto axes organized by decreasing covariance, truncated into low-dimensional representations, and visualized as trajectories that capture how distributed activity evolves over time. We show how trajectory geometry can be used to compare conditions and relate neural dynamics to behavior or clinical outcomes. An example of EEG motor execution and imagery, accompanied by a tutorial notebook, illustrates the workflow from conventional EEG summaries to trajectory-based analysis. We also clarify the limits of PCA, including its linear, variance-driven nature, and discuss EEG/MEG-specific challenges such as spatial mixing, preprocessing sensitivity, validation, and overinterpretation. Finally, we situate PCA within a broader family of state-space methods. By making neural trajectories practical and interpretable, this primer offers a guide for bringing the conceptual framework of population-level dynamics into mainstream human cognitive neuroscience.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "raw_sha256": "2668257bb3d40b4cd2238ceb93582d35af778d46a872dec902bb8787d29de34a", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8628617e41bb7071eec52ef375416c5450455d15dbb6206e01b0f96ca0d18666"}
+{"id": "source.frontier.arxiv-2609-29972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29972&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.29972: Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:05.938561+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:05Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.29972\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.29972</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>q-bio:q-bio:PE</setSpec>\n            <setSpec>physics:physics:med-ph</setSpec>\n            <setSpec>q-bio:q-bio:QM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.29972</id>\n        <created>2026-09-24</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Polyakov</keyname>\n                        <forenames>Maxim</forenames>\n                </author>\n                <author>\n                    <keyname>Chernikova</keyname>\n                        <forenames>Yulia</forenames>\n                </author>\n        </authors>\n        <title>Mathematical Modelling of Within-Host HIV Dynamics with Cytotoxic Immune Response and Antiretroviral Therapy</title>\n            <categories>q-bio.PE physics.med-ph q-bio.QM</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We develop and analyse a mechanistic ODE model of within-host HIV dynamics that includes uninfected CD4$^+$ T cells, latently and productively infected cells, free virions, and cytotoxic immune effectors. Antiretroviral therapy is described by two time-dependent efficacy functions that separately reduce new infections and virion production. We show that solutions remain non-negative and bounded, identify the infection-free and endemic equilibria, and derive the basic reproduction number together with the local stability condition for the infection-free state. We also obtain treatment-dependent suppression thresholds and an analytical estimate of when this threshold is crossed as treatment efficacy declines. Numerical simulations consider untreated infection, ART initiation, periodic variation in efficacy, and progressive loss of treatment effect. Without therapy, the model approaches a state of persistent infection. ART reduces viral load and promotes recovery of the CD4$^+$ T-cell population, while the latent reservoir persists under the parameter set considered. Periodic changes in treatment efficacy produce sustained forced oscillations. These results connect the analytical threshold conditions with the treatment-dependent dynamics of the model and provide a basis for future calibration, sensitivity analysis, uncertainty quantification, and extensions informed by clinical data.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "raw_sha256": "60eaee3477b9e03dec1593c5fbfc7acf01451a0b0bfe51fcdd803fb8e8816d6c", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "a7cbc1b09383f03245fd93f059491900067ed184dde122242134a55c6fa1ab82"}
+{"id": "source.frontier.arxiv-2609-29832", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.29832&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.29832: System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:35.415397+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:35Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.29832\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.29832</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.29832</id>\n        <created>2026-09-24</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Matt</keyname>\n                        <forenames>Justin J.</forenames>\n                </author>\n                <author>\n                    <keyname>Altamirano</keyname>\n                        <forenames>George V.</forenames>\n                </author>\n        </authors>\n        <title>System Identification of an Octocopter in Hover using Full-Harmonic Orthogonal Multisine Inputs</title>\n            <categories>eess.SY cs.RO cs.SY</categories>\n            <comments>31 pages, 18 figures. Presented at the AIAA AVIATION Forum 2025. Accepted for publication in the AIAA Journal of Aircraft</comments>\n            <journal-ref>AIAA Journal of Aircraft, Article in Advance (2026)</journal-ref>\n            <doi>10.2514/1.C038636</doi>\n            <license>http://creativecommons.org/publicdomain/zero/1.0/</license>\n            <abstract>A new method for multi-input flight maneuver design for system identification is presented. The method consists of injecting &#34;full-harmonic&#34; orthogonal multisine signals into the flight control system. Orthogonality is achieved by repeating maneuvers with changing multisine polarities. The multisines can contain the same frequency content, which can simplify frequency response estimation and allow for long flight maneuvers to be split into several shorter maneuvers while maintaining the same frequency resolution and minimum frequency. An input allocation scheme is presented that augments the multisines to size the vehicle response amplitude about a specific degree of freedom. The developed approach was demonstrated through flight testing of a small octocopter in near-hover conditions. The input allocation scheme was utilized successfully to increase excitation about the yaw axis. Electrical power, motor speed, and rigid-body dynamic models were identified and are shown to predict the vehicle and motor responses accurately. The models are parameterized primarily by rotor thrust and torque coefficients, making them suitable for analysis of aircraft flight dynamics and individual rotor aerodynamics. The results demonstrate that the near-hover flight dynamics can be modeled accurately by neglecting rotor hub moments, variations in rotor coefficients, gyroscopic moments in roll and pitch, and aerodynamic interaction effects.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "raw_sha256": "c0f7516b8ced73983768a478197b5676f26e8e11e7459a6470064f1d8a5b1bde", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c622e10ca61c46970cfb9eefcc1ff3524399c0e18f1fa758f23f4f5885535ff2"}
+{"id": "source.frontier.arxiv-2609-28815", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.28815&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.28815: Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:38.919663+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:38Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.28815\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.28815</identifier>\n        <datestamp>2026-09-25</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.28815</id>\n        <created>2026-09-23</created>\n            <updated>2026-09-25</updated>\n        <authors>\n                <author>\n                    <keyname>Eslami</keyname>\n                        <forenames>Shima</forenames>\n                </author>\n                <author>\n                    <keyname>Kaleva</keyname>\n                        <forenames>Jarkko</forenames>\n                </author>\n                <author>\n                    <keyname>Tölli</keyname>\n                        <forenames>Antti</forenames>\n                </author>\n        </authors>\n        <title>Near-Field MIMO LoS Channel Recovery Under User Antenna Asymmetry</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Near-field (N-F) line-of-sight (LoS) MIMO channels admit a compact representation through a small number of geometric parameters describing the relative transceiver geometry, enabling low-overhead channel acquisition without estimating the full channel matrix. This paper considers downlink (DL) channel acquisition under practical asymmetric user-equipment (UE) antenna capabilities with multiple DL receive antennas, but only a single active uplink (UL) transmit chain. In this setting, UL observations across the large BS aperture enable accurate estimation of the relative location of the UL-active UE antenna but are insufficient to determine the orientation of the entire UE array. We propose a two-stage geometry-based N-F LoS MIMO channel acquisition framework that distributes the estimation of the channel-defining geometric parameters between the BS and UE. First, a single UL pilot sequence enables the BS to estimate two BS-side reference angles that parameterize the relative location of the UL-active UE antenna. The BS conveys these estimates to the UE and transmits two DL pilot sequences, from which the UE estimates the remaining array-orientation parameter. We derive Cramer-Rao lower bounds (CRLBs) for the first-stage parameters and a first-order error-covariance approximation for the UE orientation that explicitly captures the propagation of first-stage estimation uncertainty. Numerical results characterize the resulting error propagation and demonstrate accurate estimation of the geometric parameters and reconstruction of the LoS MIMO channel using one UL and two DL pilot sequences.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "raw_sha256": "f2fa0f39310156889a21a6110b38ac5d9a930d87f73014bb3eed514f93d505aa", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "db59054f89fc7ddd9b5b9a93958a589643518888ec360f7590a339dc4b95e37e"}
+{"id": "source.frontier.arxiv-2609-26924", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.26924&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.26924: nnFoundation: 3D Foundation Models for Radiology", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:42.359389+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:42Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.26924\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.26924</identifier>\n        <datestamp>2026-09-24</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.26924</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-24</updated>\n        <authors>\n                <author>\n                    <keyname>Harsy</keyname>\n                        <forenames>Constantin Ulrich</forenames>\n                </author>\n                <author>\n                    <keyname>Wald</keyname>\n                        <forenames>Tassilo</forenames>\n                </author>\n                <author>\n                    <keyname>Gotkowski</keyname>\n                        <forenames>Karol</forenames>\n                </author>\n                <author>\n                    <keyname>Kirchhoff</keyname>\n                        <forenames>Yannick</forenames>\n                </author>\n                <author>\n                    <keyname>Knopp</keyname>\n                        <forenames>Marcel</forenames>\n                </author>\n                <author>\n                    <keyname>Rokuss</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Stegmeier</keyname>\n                        <forenames>Elisa</forenames>\n                </author>\n                <author>\n                    <keyname>Schader</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n                <author>\n                    <keyname>Trofimova</keyname>\n                        <forenames>Dasha</forenames>\n                </author>\n                <author>\n                    <keyname>Stock</keyname>\n                        <forenames>Raphael</forenames>\n                </author>\n                <author>\n                    <keyname>Kahl</keyname>\n                        <forenames>Kim-Celine</forenames>\n                </author>\n                <author>\n                    <keyname>Schaumann</keyname>\n                        <forenames>Stephen</forenames>\n                </author>\n                <author>\n                    <keyname>Erkan</keyname>\n                        <forenames>Selen</forenames>\n                </author>\n                <author>\n                    <keyname>Zimmerer</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Denner</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Langenberg</keyname>\n                        <forenames>Moritz</forenames>\n                </author>\n                <author>\n                    <keyname>Ziegler</keyname>\n                        <forenames>Sebastian</forenames>\n                </author>\n                <author>\n                    <keyname>Eckstein</keyname>\n                        <forenames>Katharina</forenames>\n                </author>\n                <author>\n                    <keyname>Fischer</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Suprijadi</keyname>\n                        <forenames>Jonathan</forenames>\n                </author>\n                <author>\n                    <keyname>Kovács</keyname>\n                        <forenames>Bálint</forenames>\n                </author>\n                <author>\n                    <keyname>Hamm</keyname>\n                        <forenames>Benjamin</forenames>\n                </author>\n                <author>\n                    <keyname>Deshpande</keyname>\n                        <forenames>Anand</forenames>\n                </author>\n                <author>\n                    <keyname>Bounias</keyname>\n                        <forenames>Dimitrios</forenames>\n                </author>\n                <author>\n                    <keyname>Disch</keyname>\n                        <forenames>Nico</forenames>\n                </author>\n                <author>\n                    <keyname>Xiao</keyname>\n                        <forenames>Shuhan</forenames>\n                </author>\n                <author>\n                    <keyname>Kächele</keyname>\n                        <forenames>Jessica</forenames>\n                </author>\n                <author>\n                    <keyname>Sellner</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>Baidya</keyname>\n                        <forenames>Rajesh</forenames>\n                </author>\n                <author>\n                    <keyname>Traub</keyname>\n                        <forenames>Jeremias</forenames>\n                </author>\n                <author>\n                    <keyname>Krämer</keyname>\n                        <forenames>Lars</forenames>\n                </author>\n                <author>\n                    <keyname>Zenk</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Rädsch</keyname>\n                        <forenames>Tim</forenames>\n                </author>\n                <author>\n                    <keyname>Dvoretskii</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Peretzke</keyname>\n                        <forenames>Robin</forenames>\n                </author>\n                <author>\n                    <keyname>Deissler</keyname>\n                        <forenames>Jonathan</forenames>\n                </author>\n                <author>\n                    <keyname>Ertl</keyname>\n                        <forenames>Alexandra</forenames>\n                </author>\n                <author>\n                    <keyname>Ghosh</keyname>\n                        <forenames>Partha</forenames>\n                </author>\n                <author>\n                    <keyname>Dreher</keyname>\n                        <forenames>Kris</forenames>\n                </author>\n                <author>\n                    <keyname>Dinkelacker</keyname>\n                        <forenames>Stefan</forenames>\n                </author>\n                <author>\n                    <keyname>Reinke</keyname>\n                        <forenames>Annika</forenames>\n                </author>\n                <author>\n                    <keyname>Christodoulou</keyname>\n                        <forenames>Evangelia</forenames>\n                </author>\n                <author>\n                    <keyname>Saeed</keyname>\n                        <forenames>Numan</forenames>\n                </author>\n                <author>\n                    <keyname>Savriama</keyname>\n                        <forenames>Yoland</forenames>\n                </author>\n                <author>\n                    <keyname>Estrada</keyname>\n                        <forenames>Santiago</forenames>\n                </author>\n                <author>\n                    <keyname>Kügler</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Barragan</keyname>\n                        <forenames>Laura Alexandra Daza</forenames>\n                </author>\n                <author>\n                    <keyname>Osorio</keyname>\n                        <forenames>Cristina Isabel Gonzalez</forenames>\n                </author>\n                <author>\n                    <keyname>Peeken</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>Baumgartner</keyname>\n                        <forenames>Michael</forenames>\n                </author>\n                <author>\n                    <keyname>Teichmann</keyname>\n                        <forenames>Marvin</forenames>\n                </author>\n                <author>\n                    <keyname>Chabin</keyname>\n                        <forenames>Guillaume</forenames>\n                </author>\n                <author>\n                    <keyname>Kirchler</keyname>\n                        <forenames>Matthias</forenames>\n                </author>\n                <author>\n                    <keyname>Koch</keyname>\n                        <forenames>Valentin</forenames>\n                </author>\n                <author>\n                    <keyname>study</keyname>\n                        <forenames>for the ALFA</forenames>\n                </author>\n                <author>\n                    <keyname>Hohenhaus</keyname>\n                        <forenames>Markus</forenames>\n                </author>\n                <author>\n                    <keyname>Koslov</keyname>\n                        <forenames>Dimitri</forenames>\n                </author>\n                <author>\n                    <keyname>Decker</keyname>\n                        <forenames>Nina</forenames>\n                </author>\n                <author>\n                    <keyname>Yaqub</keyname>\n                        <forenames>Mohammad</forenames>\n                </author>\n                <author>\n                    <keyname>Heuser</keyname>\n                        <forenames>Arnd</forenames>\n                </author>\n                <author>\n                    <keyname>Reuter</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Schnabel</keyname>\n                        <forenames>Julia A.</forenames>\n                </author>\n                <author>\n                    <keyname>Heimann</keyname>\n                        <forenames>Tobias</forenames>\n                </author>\n                <author>\n                    <keyname>Ghesu</keyname>\n                        <forenames>Florin</forenames>\n                </author>\n                <author>\n                    <keyname>Brachmann</keyname>\n                        <forenames>Paul</forenames>\n                </author>\n                <author>\n                    <keyname>Heußel</keyname>\n                        <forenames>Claus P.</forenames>\n                </author>\n                <author>\n                    <keyname>Radbruch</keyname>\n                        <forenames>Alexander</forenames>\n                </author>\n                <author>\n                    <keyname>Brugnara</keyname>\n                        <forenames>Gianluca</forenames>\n                </author>\n                <author>\n                    <keyname>Rastogi</keyname>\n                        <forenames>Aditya</forenames>\n                </author>\n                <author>\n                    <keyname>Foltyn-Dumitru</keyname>\n                        <forenames>Martha</forenames>\n                </author>\n                <author>\n                    <keyname>Schlemmer</keyname>\n                        <forenames>Heinz-Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Reicht</keyname>\n                        <forenames>Ignaz</forenames>\n                </author>\n                <author>\n                    <keyname>Holzschuh</keyname>\n                        <forenames>Julius C.</forenames>\n                </author>\n                <author>\n                    <keyname>Bach</keyname>\n                        <forenames>Michael</forenames>\n                </author>\n                <author>\n                    <keyname>Stieltjes</keyname>\n                        <forenames>Bram</forenames>\n                </author>\n                <author>\n                    <keyname>Schlamp</keyname>\n                        <forenames>Kai</forenames>\n                </author>\n                <author>\n                    <keyname>Maier-Hein</keyname>\n                        <forenames>Lena</forenames>\n                </author>\n                <author>\n                    <keyname>Nolden</keyname>\n                        <forenames>Marco</forenames>\n                </author>\n                <author>\n                    <keyname>Floca</keyname>\n                        <forenames>Ralf</forenames>\n                </author>\n                <author>\n                    <keyname>Jäger</keyname>\n                        <forenames>Paul F.</forenames>\n                </author>\n                <author>\n                    <keyname>Vollmuth</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n                <author>\n                    <keyname>Isensee</keyname>\n                        <forenames>Fabian</forenames>\n                </author>\n                <author>\n                    <keyname>Maier-Hein</keyname>\n                        <forenames>Klaus H.</forenames>\n                </author>\n        </authors>\n        <title>nnFoundation: 3D Foundation Models for Radiology</title>\n            <categories>cs.CV eess.IV</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift. Foundation models promise more transferable and data-efficient solutions, but existing approaches are limited in scale, evaluated narrowly, and often assume that a single pretrained model can support diverse downstream tasks. Here we present nnFoundation, complementary convolutional and transformer-based 3D radiological foundation models. Developed within the Human Radiome Project (THRP), nnFoundation is trained on 2.1 million CT, MRI, and PET image volumes from 125 institutional and public datasets. We evaluate them across 108 tasks spanning segmentation, detection, classification, report generation, and image retrieval, including evaluations under domain shift, by external partners and in low-data and low-compute regimes. Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging. However, performance follows a consistent task-dependent structure: the convolutional nnFoundation model dominates spatially localized tasks, whereas the transformer-based nnFoundation model excels in tasks requiring global semantic reasoning and in frozen-feature settings. Dynamically aligning the foundation model topology with the dataset characteristics post-hoc further improves transfer across heterogeneous 3D settings. These results show that transferable 3D radiological performance is governed not by a single universal model, but by the interplay of scalable pretraining, complementary architectures, and dataset-aware adaptation. We release nnFoundation models integrated into nnU-Net and nnDetection, enabling immediate application across established radiology workflows.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "raw_sha256": "2fcbcfe981e0d82a5872e541bfd001fbbd75a9a62e09ff9fcc883d962a01437d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "52bb329b590a404c0139500cc6d91910ee72719e80ad4ec151252825e723b7d3"}
+{"id": "source.frontier.arxiv-2609-25847", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25847&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.25847: Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:45.815112+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25847\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25847</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25847</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Ertan</keyname>\n                        <forenames>Sude</forenames>\n                </author>\n                <author>\n                    <keyname>Tokluoglu</keyname>\n                        <forenames>Osman</forenames>\n                </author>\n                <author>\n                    <keyname>Cavus</keyname>\n                        <forenames>Enver</forenames>\n                </author>\n        </authors>\n        <title>Common-Loss Parameter-Efficiency Analysis of MLP and KAN Neural Receivers for Digital Communications</title>\n            <categories>eess.SP</categories>\n            <comments>6 pages, 3 tables, 2 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Classical coherent binary phase-shift keying (BPSK) reception over additive white Gaussian noise (AWGN) channels is analytically well understood, and the optimum hard-decision detector is known. Therefore, the aim of using neural receivers in this study is not to replace the classical AWGN-BPSK detector. Instead, the AWGN-BPSK setting is deliberately selected as a theoretically verifiable benchmark for analyzing how compactly neural receiver architectures can represent a known decision behavior. This paper compares multi-layer perceptron (MLP) and Kolmogorov--Arnold Network (KAN) receivers using a multi-SNR Nyquist-rate BPSK dataset. The models are evaluated using bit error rate (BER), mean squared error (MSE), and trainable parameter count. Beyond reporting accuracy alone, this work emphasizes a common-loss parameter-efficiency perspective: when two receivers reach a comparable practical BER or loss region, the receiver with fewer parameters is more attractive for real-time deployment. The results show that both MLP and KAN receivers reproduce the expected AWGN-BPSK detection trend, while a compact KAN configuration reaches a comparable operating region with substantially fewer trainable parameters. In particular, the KAN receiver with 3281 parameters achieves a test BER of 2.45 x 10^-4, while the MLP baseline with 8513 parameters achieves a test BER of 2.50 x 10^-4. This corresponds to approximately 61.5% fewer trainable parameters at a comparable BER operating point. This reduction is important for real-time neural receivers because it affects memory footprint, parameter access, inference latency, energy consumption, and hardware feasibility on embedded, software-defined radio, FPGA, ASIC, and edge communication platforms.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "raw_sha256": "d3afd2f0455a5e9551ce0442fe68b90032962ab48b6db0ca340f0811bc6c4b19", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "9ed1c40d67cbd5af03f154e922c46629779108464df9f8b859b2629d22a92f43"}
+{"id": "source.frontier.arxiv-2609-25701", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25701&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.25701: Fully Byzantine-Resilient Multi-Agent Reinforcement Learning", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:49.238504+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:49Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25701\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25701</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:MA</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25701</id>\n        <created>2026-09-22</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Lee</keyname>\n                        <forenames>Haejoon</forenames>\n                </author>\n                <author>\n                    <keyname>Panagou</keyname>\n                        <forenames>Dimitra</forenames>\n                </author>\n        </authors>\n        <title>Fully Byzantine-Resilient Multi-Agent Reinforcement Learning</title>\n            <categories>cs.LG cs.MA cs.SY eess.SY</categories>\n            <comments>12 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We study distributed Byzantine-resilient actor-critic multi-agent reinforcement learning (AC-MARL), where agents collectively learn policies through local interactions. Existing methods guarantee convergence of the agents&#39; parameters only to a neighborhood of the attack-free limit points, resulting in degraded performance. We propose Fully Resilient AC-MARL (FRAC-MARL), a decentralized method in which each agent leverages redundancy in two-hop messages to identify reliable messages. Under linear parameterizations of the value and team-reward functions and Byzantine edge attacks, where adversarial behavior is confined to the communication layer, we prove that agents&#39; parameters converge almost surely to the same limit points as in the attack-free case over time-varying communication graphs. We introduce a novel topological condition for the convergence of our method, present a systematic method to construct such networks, and prove that this condition can be verified in polynomial time. Finally, we demonstrate our method on cooperative multi-robot formation control tasks.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "raw_sha256": "05e477105c979b3ef32165e869f52a2dfb080788a6f743467aae4efc11a8ac59", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d5aa89c289117dd72a42f1f9b4a45db2a59ac79322712878fd5e4551ecbe93fe"}
+{"id": "source.frontier.arxiv-2609-25437", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.25437&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.25437: Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:52.633236+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.25437\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.25437</identifier>\n        <datestamp>2026-09-23</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:CY</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.25437</id>\n        <created>2026-09-21</created>\n            <updated>2026-09-23</updated>\n        <authors>\n                <author>\n                    <keyname>Alston</keyname>\n                        <forenames>Garrett</forenames>\n                </author>\n                <author>\n                    <keyname>Love</keyname>\n                        <forenames>Nancy</forenames>\n                </author>\n                <author>\n                    <keyname>Haider</keyname>\n                        <forenames>Rabab</forenames>\n                </author>\n        </authors>\n        <title>Data center cooling choices shift water impacts across the grid: An integrated water-energy model for sustainable data center development</title>\n            <categories>eess.SY cs.CY cs.DC cs.SY</categories>\n            <comments>12 pages; 8 figures; 6 tables; appendix</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Data centers are being developed at an unprecedented pace, yet their energy and water impacts, and the spatial and temporal distribution of these impacts, remain poorly characterized. Data centers consume water for cooling (direct) and through electricity generation (indirect). Decisions on siting and cooling technology result in water-energy trade-offs that extend impacts beyond the facility&#39;s location. Existing assessment frameworks rely on facility efficiency metrics and average grid water intensity factors, suppressing the temporal impacts of data center load and generation availability. They also attribute indirect consumption to the facility&#39;s location rather than to the generators (and corresponding hydrologic regions) that respond to the added load, misattributing spatial impacts. To close this gap, we develop a computational model of the data center-energy-water nexus that links facility cooling and electricity demand with hourly economic dispatch, generator-level water consumption, and monthly subbasin depletion. Built on open-source data, the model resolves where and when water is consumed, and where this consumption compounds existing water risk or creates new risk. Using the model, we study different cooling configurations and proposed developments in the state of Michigan. Air-cooled data centers halve total water consumption relative to evaporative cooling, but increase electricity demand and raise indirect water consumption by one-third, shifting the water footprint from the facility to generators. Mapping these changes to subbasins reveals depletion increases beyond the data center sites, in regions that facility-level reporting may overlook. These results show that data center water and energy impacts cannot be assessed in isolation, motivating the need for integrated modeling to inform siting, design, and reporting practices.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "raw_sha256": "13ac6cf464001cdc31c580ae1eec2ef3a513b99e02ee538dc2b0d2c7b23e56c4", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "383de9d5b7b54ef72ca7883e22e19daee701918e94406754aa2a41d1729bd437"}
+{"id": "source.frontier.arxiv-2609-05763", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05763&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.05763: AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:56.044144+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.05763\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.05763</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.05763</id>\n        <created>2026-09-21</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Ganal</keyname>\n                        <forenames>Helen</forenames>\n                </author>\n                <author>\n                    <keyname>Becker</keyname>\n                        <forenames>Sarah</forenames>\n                </author>\n                <author>\n                    <keyname>Holzhauer</keyname>\n                        <forenames>Sascha</forenames>\n                </author>\n                <author>\n                    <keyname>Glißmann</keyname>\n                        <forenames>Thilo</forenames>\n                </author>\n                <author>\n                    <keyname>Krebs</keyname>\n                        <forenames>Friedrich</forenames>\n                </author>\n                <author>\n                    <keyname>Braun</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Härtel</keyname>\n                        <forenames>Philipp</forenames>\n                </author>\n        </authors>\n        <title>AgentHomeID - Agent-based modelling of building stock transformation: A multi-scale framework for policy assessment and infrastructure planning</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Submitted to Applied Energy</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Decarbonising the building sector is central to meeting climate targets, yet existing models rarely capture the interaction between system-level transformation dynamics and heterogeneous individual investment decisions. This work presents AgentHomeID, an agent-based model of building stock evolution in which owner behaviour, techno-economic constraints, and regulatory frameworks are represented explicitly at the level of individual buildings and their owners. The model differentiates owner-occupiers, private landlords, and institutional owners, using willingness-to-pay (WTP) parameters estimated from empirical decision-maker studies, and operates on both representative building archetypes and real building data derived from geographic information systems (GIS). We demonstrate this versatility across three applications. At national scale, scenario analysis for Germany to 2045 shows that removing binding renewable heating requirements substantially raises final energy demand even where envelope refurbishment is unchanged, and that subsidy allocation and investment activity diverge sharply across owner types and income quartiles, with the lowest quartiles persistently underinvesting. At regional scale, bottom-up simulation for a German distribution grid planning region yields spatially concentrated heat pump uptake at NUTS-3 level that differs from aggregated top-down projections in both magnitude and spatial distribution. At urban block level, the same simulations resolve substation-level load heterogeneity and show that integrated system peaks driven by heat pumps, electric vehicles, and photovoltaics do not coincide with individual technology peaks. Across all three scales, owner heterogeneity and local structure materially shape transition pathways, indicating that they should be represented explicitly in models used for policy assessment and infrastructure planning.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "raw_sha256": "923b3d68f77be09252d94a3c7e4c1d84519e57615b303709cb5624e18a94e896", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0f5ccb410b5526aade1bdd995104d883eb484f4edbbd0f00de52f7d401aea072"}
+{"id": "source.frontier.arxiv-2609-23703", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23703&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.23703: Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:09.343753+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23703\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23703</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:CL</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>q-fin:q-fin:TR</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23703</id>\n        <created>2026-09-20</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Kirtac</keyname>\n                        <forenames>Kemal</forenames>\n                </author>\n        </authors>\n        <title>Financial Language Models as Applied Artificial Intelligence Systems for News-Based Trading under Market Frictions</title>\n            <categories>cs.CL cs.LG q-fin.TR</categories>\n            <comments>47 pages. Revise and resubmit at Engineering Applications of Artificial Intelligence</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Financial language models can transform unstructured firm-specific news into structured decision signals, but financial AI research lacks an integrated deployment framework for evaluating whether those signals remain useful in financial decision systems. Computer science research has developed strong methods for time-series forecasting, text classification, multimodal stock prediction, graph-based market modeling, and machine-learning operations, yet these streams do not provide a domain-specific protocol that jointly tests financial language-model outputs under event-time observability, probability calibration, execution timing, transaction costs, liquidity constraints, capacity limits, operational diagnostics, and statistical inference. We introduce MFAST, a Market-Friction-Aware Sentiment-to-Trading framework that converts timestamped financial text into auditable, reproducible, and market-feasible trading decisions. The application is news-based trading, where firm-specific text must be linked to securities before portfolio decisions can be evaluated. The framework links Refinitiv News Analytics to Center for Research in Security Prices (CRSP) equity data, restricts the primary out-of-sample evaluation to post-release news outside disclosed foundation-model data-freshness periods, and adds a public replication arm using open financial text and public price data. Results show that decoder-only language models outperform encoder baselines and dictionary sentiment in classification, calibration, return prediction, and net portfolio performance, while operational diagnostics reveal trade-offs among accuracy, latency, memory, throughput, and inference cost. The paper shows that credible evaluation of financial language models requires an end-to-end engineering approach combining language understanding, temporal discipline, market-friction-aware deployment, and reproducible validation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "raw_sha256": "d27c6079b4ebf48ff4882665c14a90b6f613da6b7e408d662da950a27be47d0f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "3b6dcc025a698187e63dc58d2e98eeba287f7eb84b14e376956ff36316e9bd82"}
+{"id": "source.frontier.arxiv-2609-23199", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23199&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.23199: LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:41:59.575112+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:41:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23199\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23199</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23199</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Bai</keyname>\n                        <forenames>Yiyang</forenames>\n                </author>\n                <author>\n                    <keyname>Awwad</keyname>\n                        <forenames>Élie</forenames>\n                </author>\n                <author>\n                    <keyname>Wigger</keyname>\n                        <forenames>Michèle</forenames>\n                </author>\n        </authors>\n        <title>LMMSE-Based Phase Estimator for Fiber-Optic Coherent Spread-Spectrum FBG-Based Sensing Systems</title>\n            <categories>eess.SP</categories>\n            <doi>10.1109/JPHOT.2026.3734836</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Fiber Bragg grating (FBG)-based sensing enables localized strain and temperature monitoring by tracking the phase changes of the light reflected from FBGs inserted along a fiber. A major source of disturbance in such systems is laser phase noise, and its influence is typically mitigated by means of additional hardware. In this article, we propose to mitigate the influence of laser phase noise by means of digital signal processing. We propose a practical estimator for coherent single-polarization spread-spectrum FBG-based sensing systems, which is motivated by linearizing the complex received signal and approximating the loss function to formulate a minimum mean square error (MMSE) estimation problem. Moreover, a Cramer-Rao lower bound for this FBG-based estimation problem is presented. Our simulation results demonstrate that the performance of our proposed estimator lies close to the Cramer-Rao lower bound, thus indicating that our estimator effectively compensates for phase noise in FBG-based sensing systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "raw_sha256": "51d1cca4fb17ae2d4640dd9efc987271f49fad2afb665cfc69349cff0dccb9d1", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f19b0a61d55ca14225b0041bd942a0513f0fdc217836824d73c07155591e8f65"}
+{"id": "source.frontier.arxiv-2609-23085", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.23085&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.23085: Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:03.018673+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.23085\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.23085</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.23085</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Siddiqui</keyname>\n                        <forenames>Muhammad Abdur Rab</forenames>\n                </author>\n                <author>\n                    <keyname>Rojas</keyname>\n                        <forenames>Daniela</forenames>\n                </author>\n                <author>\n                    <keyname>Yang</keyname>\n                        <forenames>Chen</forenames>\n                </author>\n                <author>\n                    <keyname>Cui</keyname>\n                        <forenames>Wenqi</forenames>\n                </author>\n                <author>\n                    <keyname>Shi</keyname>\n                        <forenames>Yuanyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Yize</forenames>\n                </author>\n        </authors>\n        <title>Measured Joules, Learned Routes: Learning to Route for Energy-Efficient LLM Serving</title>\n            <categories>cs.PF cs.DC cs.LG cs.SY eess.SY</categories>\n            <comments>16 pages, 10 figures, in submission</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Large language models (LLMs) and agentic AI systems are creating rapidly growing inference energy demands as model sizes grow and reasoning trajectories extend. While in practice, many queries do not require the capabilities of the largest available model, and routinely directing such queries to a high-capability model can introduce unnecessary, considerable computation and energy consumption. In this paper, we investigate whether adaptive routing across a heterogeneous pool of LLMs can reduce this energy burden without substantially compromising task performance. We design a language-model-based router that reads in each query and selects an answer model from a fixed candidate pool. The candidate models are first profiled through an offline tournament that records their correctness, latency, power, and GPU energy for each query. Using these measurements, the router is trained through supervised fine-tuning followed by group relative policy optimization (GRPO) with the tailored paradigms. Results demonstrate that learned routing can selectively allocate expensive model capacity based on query context and improve the accuracy-energy tradeoff in multi-LLM serving. Across seven benchmark tasks, we also observe a sharp accuracy-energy phase transition among routers, providing practical insights into improving energy efficiency while maintaining LLM performance.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "raw_sha256": "4f9593cb655c0b4e996681767df99304130fde20c4ef0985b73f65c0a7f64ce5", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "32ced2b65c074b5d9c87fda0013e75040ee631942baa9036303fc161b695f139"}
+{"id": "source.frontier.arxiv-2609-22775", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22775&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.22775: DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:06.417205+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.22775\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.22775</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:AR</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.22775</id>\n        <created>2026-09-19</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Pham</keyname>\n                        <forenames>Thanh</forenames>\n                </author>\n                <author>\n                    <keyname>Islam</keyname>\n                        <forenames>Riadul</forenames>\n                </author>\n        </authors>\n        <title>DVA-Neurons: Design and Verification of Adaptive LIF Neurons: From Single-Neuron Dynamics to Multi-Neuron Spiking Networks</title>\n            <categories>cs.AI cs.AR eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Spiking Neural Networks (SNNs) offer a promising path toward ultra-low-power artificial intelligence inference by emulating the event-driven computation of biological neurons. However, two challenges limit their practical deployment. First, fixed-parameter Leaky Integrate-and-Fire (LIF) neurons lack the adaptation mechanisms observed in biology, where neurons modulate their excitability based on firing history. Second, scaling from single neurons to multi-neuron networks introduces challenges in synaptic weight distribution and inter-neuron spike routing that are absent in isolated designs. This paper addresses both issues through the extension, verification, and physical implementation of adaptive LIF neurons at three architectural scales. This work contributes: a 2nd-order neuron with two-stage synaptic filtering for richer temporal dynamics; a fully-connected 6-neuron spiking network with configurable weights (100 to 5) demonstrating weight-based inter-neuron communication; and a direct verification methodology enabling per-cycle observation of all internal states. All designs were synthesized targeting Selected Area Electron Diffraction (SAED) 14 nm Complementary Metal-Oxide-Semiconductor (CMOS) technology at 1 GHz and verified with Cocotb-based Python testbenches under pulsed current stimuli (amplitude 80, ISI=3). The results show that adaptation effectively modulates firing: 31% suppression in the 2nd-order neuron (25 vs.\\ 36 spikes) and 31% reduction in postsynaptic firing in the network (18 vs.\\ 26 spikes). Physically, the 2nd-order neuron costs 1.77x more area and 1.52x more power than the 1st-order baseline, while the 6-neuron network demonstrates near-linear scaling (5.7x area, 5.3x power). Seven verification bugs spanning testbench connectivity, fixed-point overflow, and Verilog expression-width semantics are documented.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "raw_sha256": "66f3647798837ffb4adb7ffd17882b682718c71c3943f92c161db2dfaa64df03", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "da9dfd93c997384dadc3a52792f3aa1a61df64abf1ca013805f821de6c3032a1"}
+{"id": "source.frontier.arxiv-2609-22615", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.22615&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.22615: Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:09.841758+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.22615\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.22615</identifier>\n        <datestamp>2026-09-22</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.22615</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-22</updated>\n        <authors>\n                <author>\n                    <keyname>Guo</keyname>\n                        <forenames>Guangpu</forenames>\n                </author>\n                <author>\n                    <keyname>Xia</keyname>\n                        <forenames>Xiang-Gen</forenames>\n                </author>\n        </authors>\n        <title>Exact Dynamic Range--Robustness Tradeoff for Chinese Remainder Theorem under Non-Uniformly Bounded Remainder Errors</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The Chinese remainder theorem (CRT) is highly sensitive to remainder errors. Robust CRT addresses this problem by recovering the folding integers correctly from erroneous remainders, so that the final reconstruction error is bounded by the remainder error level. The existing dynamic range--robustness tradeoff results mainly assume a uniform remainder error bound, where all remainders share one scalar error bound. This paper studies the exact tradeoff when the remainder error bound is a vector in the sense that different remainders may have different error bounds. For any fixed candidate range length, which specifies the integer interval over which an unknown integer is to be determined from its erroneous remainders, and any fixed remainder error bound vector, we derive a scalar necessary and sufficient condition for robust determination. Based on this condition, we characterize the largest admissible range length, called the dynamic range, for a given remainder error bound vector. Conversely, for a given range length, we characterize all remainder error bound vectors under which remainder errors can be tolerated. We also give an exact folding integer vector decoding algorithm. We show that the proposed results reduce to the classical CRT in the error-free case and coincide with the known result when all remainder error bounds are equal. Numerical results show that the dynamic range depends on the full remainder error bound vector. They also show that the remainders are coupled in the robustness, which cannot be captured by a single uniform error bound.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "raw_sha256": "f22b1d960901b541fd6118f3f99673a879af4f17cd70b175f3960b3050aa0b4c", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "61bb2b4cfc73667cd1d6b244c277c2d2af1b6c8be0b022aa841e7d05f2692180"}
+{"id": "source.frontier.arxiv-2609-21966", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21966&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.21966: Automata-Theoretic Verification of Interval Markov Decision Processes", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:13.245754+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21966\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21966</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>cs:cs:FL</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21966</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Bahmani</keyname>\n                        <forenames>Sarvin</forenames>\n                </author>\n                <author>\n                    <keyname>Paul</keyname>\n                        <forenames>Soumyajit</forenames>\n                </author>\n                <author>\n                    <keyname>Schewe</keyname>\n                        <forenames>Sven</forenames>\n                </author>\n                <author>\n                    <keyname>Soudjani</keyname>\n                        <forenames>Sadegh</forenames>\n                </author>\n                <author>\n                    <keyname>Trivedi</keyname>\n                        <forenames>Ashutosh</forenames>\n                </author>\n        </authors>\n        <title>Automata-Theoretic Verification of Interval Markov Decision Processes</title>\n            <categories>cs.FL cs.SY eess.SY</categories>\n            <comments>14 pages including appendices, accepted to CDC 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Interval Markov decision processes (IMDPs) provide a natural framework for modeling stochastic systems with uncertain transition probabilities, represented by probability intervals and resolved adversarially. Such uncertainty arises naturally, for example, when the transition model is learned from finite data or obtained through model-based reinforcement learning. In this paper, we study the automata-theoretic verification of IMDPs against rich temporal specifications, including all LTL specifications, by considering the broader class of ω-regular objectives. We show that classical automata-theoretic verification techniques extend to IMDPs, but with a sharp distinction determined by the structure of the transition intervals. For stable IMDPs, where either the upper bound is zero or the lower bound is strictly positive, verification reduces to ordinary MDP analysis and can be carried out using the standard automata used in that setting (good-for-MDP automata). For unstable IMDPs, where intervals may include zero while the upper bound is strictly positive, verification becomes game-like and requires automata whose nondeterminism can be resolved on the fly (good-for-games automata). Building on these insights, we develop algorithms for verifying ω-regular specifications over IMDPs and derive probabilistic guarantees when the interval model is learned from sampled data. The resulting framework enables principled verification of stochastic systems under probabilistic model uncertainty, connecting automata-based verification with data-driven stochastic modeling.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "raw_sha256": "075fb80e4dbfc9a79c5c2678f93231b3bc479106eb01dd3b8be4333dbef179ff", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "ab0e3778ec8c5d9c84fa2c0af79e89d20839be9e1a0154b4123b72adebe58077"}
+{"id": "source.frontier.arxiv-2609-21270", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21270&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.21270: Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:16.715742+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21270\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21270</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21270</id>\n        <created>2026-09-18</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Malik</keyname>\n                        <forenames>Vikrant</forenames>\n                </author>\n                <author>\n                    <keyname>Kostina</keyname>\n                        <forenames>Victoria</forenames>\n                </author>\n                <author>\n                    <keyname>Hassibi</keyname>\n                        <forenames>Babak</forenames>\n                </author>\n        </authors>\n        <title>Rate-cost Trade-offs in H-infinity Control with Initial State Uncertainty</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider the problem of H-infinity control in the presence of a digital communication channel between the observer and the controller and investigate the fundamental trade-off between the required communication data rate and H-infinity performance. The system follows linear dynamics and has no additive internal noise, so that the uncertainty is confined to the initial state. For the scalar system, using a deterministic time-zero covering argument, we establish a lower bound on the required data rate for a given H-infinity cost and demonstrate why logarithmic quantization (Elia, 2000) is a natural choice. We further develop an achievability scheme and show that, for the scalar system, its rate matches the converse asymptotically in the high-data-rate limit.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "raw_sha256": "a88558cda4dca30a185860e8d296aa7bea916468b1d6b1000618f51b246b46f5", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "40704012cd26836763e7ae5ba9418f3af33637a80d72e1eda7562915c3f55c28"}
+{"id": "source.frontier.arxiv-2609-21093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21093&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.21093: A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:20.515703+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21093\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21093</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21093</id>\n        <created>2026-09-17</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Ahmed</keyname>\n                        <forenames>Nameer Fawwaz</forenames>\n                </author>\n                <author>\n                    <keyname>Fleming</keyname>\n                        <forenames>Cody</forenames>\n                </author>\n                <author>\n                    <keyname>Shoukry</keyname>\n                        <forenames>Yasser</forenames>\n                </author>\n        </authors>\n        <title>A Mean-Field Approach for Safe Routing of Multi-Destination Urban Air Mobility Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As Urban Air Mobility (UAM) systems scale toward high-density operations, managing autonomous Unmanned Aerial Vehicle (UAV) traffic requires control frameworks that are both tractable and safety-critical. This paper presents a principled optimal control-theoretic foundation for routing in multi-destination UAM networks subject to vertiport capacity and flow constraints. We first model the network as a destination-conditioned Continuous-Time Markov Chain (CTMC) to capture the stochastic transitions between queueing, service, and flight states. To ensure tractability, we employ a mean-field fluid approximation and derive the underlying system dynamics as a set of coupled ordinary differential equations. A key contribution of this work is the formal proof of the positive invariance of the queue-free state space. We demonstrate that under specific underloaded conditions, a system initialized without queues will remain queue-free indefinitely. This result allows us to transform a complex, infinite-dimensional continuous-time optimal control problem into a tractable, finite-dimensional algebraic optimization. The resulting framework jointly optimizes for travel time and multi-hop efficiency while ensuring network-wide stability. We validate the approach by characterizing the steady-state flow equilibria and providing sufficient conditions for safe, congestion-free operation in large-scale mobility systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "raw_sha256": "88ce7c0d63be093f0d18b68cd693301bc2169a4e94965d2da42da184af0cc757", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "ee4eea04904d832f20b33f8db0e489d051cbe319ed1f7ccd33f58bc1f43deda7"}
+{"id": "source.frontier.arxiv-2609-21057", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.21057&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.21057: FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:25.151858+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.21057\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.21057</identifier>\n        <datestamp>2026-09-21</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.21057</id>\n        <created>2026-09-17</created>\n            <updated>2026-09-21</updated>\n        <authors>\n                <author>\n                    <keyname>Rahimi</keyname>\n                        <forenames>Herlock</forenames>\n                </author>\n                <author>\n                    <keyname>Kalogerias</keyname>\n                        <forenames>Dionysis</forenames>\n                </author>\n        </authors>\n        <title>FedeRage: Provably Convergent Agnostic Federated Learning under General Client Drift</title>\n            <categories>cs.LG cs.DC cs.SY eess.SP eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Federated learning (FL) enables collaborative model training without sharing raw data, but its performance degrades under non-IID data and stochastic client participation. Remedies built on classical Federated Averaging (FedAvg) typically presuppose that client participation probabilities are known to the server, which is rarely the case in deployed systems. We first discuss and then characterize the optimization problem that \\emph{distributionally agnostic} FedAvg actually solves when participation is entirely unknown, possibly highly skewed, and of variable size across rounds: uniform aggregation is shown to minimize a well-defined stochastic objective, weighted by the participation-induced marginal, at a standard $\\mathcal{O}(1/\\sqrt{T})$ rate for convex and possibly nonsmooth losses. Building on this characterization, we propose \\emph{Federated Risk-Averse Averaging} (\\textsc{FedeRage}), a risk-averse extension of FedAvg that embeds the \\emph{Conditional Value-at-Risk} (CVaR) into the local objective within a natural distributionally robust optimization (DRO) framework. \\textsc{FedeRage} implicitly upweights high-loss and infrequently participating clients while adding only a \\emph{single scalar per-client}, and admits an $\\mathcal{O}(κ/\\sqrt{T})$ rate in which the factor $κ$ is the upper bound on the ``price&#34; of risk aversion. In contrast with aggregation-alignment schemes based on optimal transport, which require the availability distribution as an input, \\textsc{FedeRage} remains agnostic to it. Several experiments on three heterogeneous benchmarks indicate consistent improvements over state-of-the-art methods in accuracy, fairness, and convergence speed.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "raw_sha256": "ac901c18608185f02e705ac1005d3d2c24122f6f79ac710cd0a4bc4eeb5a0085", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c6b452314ee267e47e5884adf8e52e91229a56aa1f3b90ffeab7008b6c2463af"}
+{"id": "source.frontier.arxiv-2609-19468", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.19468&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.19468: High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:28.543442+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:28Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.19468\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.19468</identifier>\n        <datestamp>2026-09-18</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.19468</id>\n        <created>2026-09-16</created>\n            <updated>2026-09-18</updated>\n        <authors>\n                <author>\n                    <keyname>Hsu</keyname>\n                        <forenames>Tzu-Hsuan</forenames>\n                </author>\n                <author>\n                    <keyname>Liu</keyname>\n                        <forenames>Zihuan</forenames>\n                </author>\n                <author>\n                    <keyname>Gupta</keyname>\n                        <forenames>Harshvardhan</forenames>\n                </author>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Ziqian</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Wei</forenames>\n                </author>\n                <author>\n                    <keyname>Chulukhadze</keyname>\n                        <forenames>Vakhtang</forenames>\n                </author>\n                <author>\n                    <keyname>Kramer</keyname>\n                        <forenames>Jack</forenames>\n                </author>\n                <author>\n                    <keyname>Hall</keyname>\n                        <forenames>Neal</forenames>\n                </author>\n                <author>\n                    <keyname>Lu</keyname>\n                        <forenames>Ruochen</forenames>\n                </author>\n        </authors>\n        <title>High-Velocity Whip-Mode Microresonator in LTOI Unimorph: Measurement Methodology and Large-Signal Characterization</title>\n            <categories>eess.SP</categories>\n            <comments>10 pages, 9 figures, 2 tables. Submitted to IEEE Journal of Microelectromechanical Systems</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents the design, characterization, and large-signal measurement methodology of a high-order whip-mode flexural microresonator on a lithium tantalate-on-insulator (LTOI) unimorph platform. A tapered cantilever concentrates kinetic energy at the free tip through a structural velocity amplification effect, with a targeted whip mode at 9.175 MHz exhibiting a measured Q of 691 in air. The results indicate a substantially reduced susceptibility to viscous damping at high modal frequencies. In-air large-signal testing on a separate device confirms tip velocities up to 20 m/s before the reliable measurement range of the laser Doppler vibrometer (LDV) at the tapered tip is exceeded, while the device itself sustains drive levels up to 240 Vpp before failure. Transitioning to vacuum reveals photothermal-induced static bending of the LTOI cantilever under LDV laser illumination, an effect that prohibits direct velocity measurement for these resonators. Hence, it motivates an indirect extraction methodology to be implemented. In this work, a 3.85 times base-to-tip geometric amplification factor, independently calibrated at low drive, is applied to base velocity measurements to infer tip velocity under large-signal conditions. Using this approach with narrowband chirp excitation, a maximum extracted tip velocity of 58.9 m/s is obtained at 192 Vpp, with spectral analysis of the base velocity placing a conservative lower bound of 36.2 m/s on this estimate. Large-signal failure-mode analysis identifies Pt/Au electrode melting at 210 Vpp as the current velocity ceiling. These results suggest that geometric amplification in high-order flexural modes offers a viable pathway toward the high proof-mass velocities targeted for next-generation MEMS inertial sensors.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "raw_sha256": "7a7eeb9feb6be33b19d50552228fb2a7ab52250d07ff0e66321bb5b2fe2b3ba8", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d8ca1b80514b7bf50eab4c3ef7e7722b05d5624dc81bac143cf3b774430ffaff"}
+{"id": "source.frontier.arxiv-2609-18467", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.18467&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.18467: Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:31.985307+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.18467\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.18467</identifier>\n        <datestamp>2026-09-17</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.18467</id>\n        <created>2026-09-16</created>\n            <updated>2026-09-17</updated>\n        <authors>\n                <author>\n                    <keyname>Uniyal</keyname>\n                        <forenames>Smriti</forenames>\n                </author>\n                <author>\n                    <keyname>Fang</keyname>\n                        <forenames>Tianyu</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Van-Dinh</forenames>\n                </author>\n                <author>\n                    <keyname>Ngo</keyname>\n                        <forenames>Hien Quoc</forenames>\n                </author>\n                <author>\n                    <keyname>Juntti</keyname>\n                        <forenames>Markku</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Nhan Thanh</forenames>\n                </author>\n        </authors>\n        <title>Massive MIMO ISAC Under Target-Angle Uncertainty: CRLB Outage Analysis and Robust Resource Allocation</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In integrated sensing and communications (ISAC), the same spectral and hardware resources are shared for two functionalities. Most ISAC designs assume perfect target-angle information neglecting angle estimation errors, which introduce steering-vector mismatches, degrade sensing accuracy, and may invalidate deterministic sensing guarantees. This paper investigates monostatic massive multiple-input-multiple-output (MIMO) ISAC systems under imperfect target-angle estimates. We derive closed-form expressions for the Cramér-Rao lower bounds (CRLBs) of target azimuth and elevation estimates in the presence of angle uncertainty. We characterize the cumulative distribution functions and outage probabilities of the CRLBs under Gaussian, generalized uniform, and von Mises angle-error models. Our analysis reveals that, in the small-error regime, the CRLBs increase quadratically with the angle errors due to transmit steering-vector mismatch. To ensure reliable sensing, we propose a robust power allocation framework that jointly optimizes pilot training and communications/sensing transmission powers to maximize the communications sum rate while satisfying CRLB outage constraints. The resulting nonconvex problem is solved using an alternating-optimization algorithm based on successive convex approximation. Numerical results validate the developed analysis and show that the proposed robust design reduces azimuth and elevation CRLB outage probabilities by up to $60\\%$ compared with conventional non-robust schemes. It attains up to $45\\%$ higher sum rates than the non-robust design under strict CRLB thresholds.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "raw_sha256": "cda64a94b9af3dd74b293be016c5012f32d6ca7f26ab4b1312186994311cba63", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "23f44ed227789a70c80abb320cc05bead3ad09a48326c8b6643b1a1b6b608927"}
+{"id": "source.frontier.arxiv-2609-17042", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.17042&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.17042: Learning Options for Compositional Motor Control with Adapter Banks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:12.920566+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:12Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.17042\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.17042</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.17042</id>\n        <created>2026-09-15</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Kumar</keyname>\n                        <forenames>Sreejan</forenames>\n                </author>\n                <author>\n                    <keyname>Mattar</keyname>\n                        <forenames>Marcelo</forenames>\n                </author>\n                <author>\n                    <keyname>Duncker</keyname>\n                        <forenames>Lea</forenames>\n                </author>\n        </authors>\n        <title>Learning Options for Compositional Motor Control with Adapter Banks</title>\n            <categories>cs.LG cs.RO q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Learning flexible motor primitives is a hallmark of skilled motor control. Recent neuroscience theory proposes that motor primitives may be implemented as low-rank perturbations of a shared recurrent network, but leaves open how such a system is learned. We translate this principle into a novel architecture for learning motor skills end-to-end: a shared recurrent core modulated by a bank of residual adapters, each selected by a discrete latent code. Trained on closed-loop biomechanical control, the adapters develop emergent low-rank perturbations of the recurrent dynamics despite no architectural rank constraint, placing task representations in disparate subspaces of the shared core network. A simple high-level policy over the learned options, optimized while the whole network is frozen, sequences the low-rank adapters to produce novel out-of-distribution movements. We demonstrate the ability to generalize to novel motor sequences within the closed-loop control setting, improving on the generalization error of a task-input-conditioned multitask baseline by upto order of magnitude.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "raw_sha256": "e04323d3e14384e814b78f0fa49e196e44fc8c09e94d555adcbc0bf90c3d8779", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c28d03a9937126e985888706b06cbb962475c141092034c13b7a3cb46dfe155e"}
+{"id": "source.frontier.arxiv-2609-16899", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16899&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.16899: Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:35.437678+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:35Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16899\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16899</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16899</id>\n        <created>2026-09-15</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Fernandez-Zapico</keyname>\n                        <forenames>Diego</forenames>\n                </author>\n                <author>\n                    <keyname>Vehlhaber</keyname>\n                        <forenames>Finn</forenames>\n                </author>\n                <author>\n                    <keyname>Izadi</keyname>\n                        <forenames>Maedeh</forenames>\n                </author>\n                <author>\n                    <keyname>Hofman</keyname>\n                        <forenames>Theo</forenames>\n                </author>\n                <author>\n                    <keyname>Salazar</keyname>\n                        <forenames>Mauro</forenames>\n                </author>\n        </authors>\n        <title>Optimal Control Strategies for a Network of Electric Vehicle Charging Energy Hubs with Smart Scheduling via Distributed Optimization</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies the cost-optimal operation of a network of charging energy hubs for electric vehicles, which provide onsite renewable energy sources and stationary battery storage and are connected with each other via DC-lines as well as with the distribution grid. Specifically, we first formulate a dynamic optimal control problem for the entire network as a convex quadratic program, whereby the charging power profiles of the individual vehicles and the energy flows between hubs and the grid are subject to optimization. Second, we propose a problem decomposition that allows for a distributed solution via ADMM algorithms that preserves global optimality guarantees and privacy of the individual stations. We showcase our framework on a case-study for the Netherlands considering a two-day ahead deterministic formulation with perfect foresight. Our results show that compared to the case where charging powers are fixed a priori, optimizing their profiles (V1G) can significantly reduce the operational costs and emissions by more than 25%. Moreover, we verify our distributed algorithm against a centralized solution, paving the way to the optimal operation of large networks and online implementations.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "raw_sha256": "ad93d96026ffe0ca5ff915765dacac8b7130ef4548f7fc584466bd1b72147952", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "5db5071ffd16bcb7a266650ba23fd7cc1904bc4461acab7b9c721a78051f3f80"}
+{"id": "source.frontier.arxiv-2609-16353", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16353&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.16353: Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:38.877234+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:38Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16353\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16353</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16353</id>\n        <created>2026-09-14</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Martin</keyname>\n                        <forenames>Andrea</forenames>\n                </author>\n                <author>\n                    <keyname>Fabiani</keyname>\n                        <forenames>Filippo</forenames>\n                </author>\n                <author>\n                    <keyname>Belgioioso</keyname>\n                        <forenames>Giuseppe</forenames>\n                </author>\n        </authors>\n        <title>Finite-sample guarantees for data-driven operator splitting methods via martingale inequalities</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Operator splitting methods are a fundamental class of algorithms for solving structured monotone inclusion problems arising in optimization, control, and game theory. We consider the case, common in stochastic regimes, where the forward evaluation of one of the constituent operators is either unavailable in closed form or computationally expensive to evaluate, and is therefore approximated using a finite number of noisy oracle samples. We establish distribution-free, finite-sample certificates for the quality of the output produced by data-driven Davis-Yin splitting algorithms. Unlike previous works, our analysis directly controls the residual error via martingale inequalities instead of relying on algorithmic stability arguments for a tailored surrogate loss, yielding the first a priori certificates whose statistical excess provably vanishes with the sample size. We further show that, under linear convergence of the Davis-Yin splitting algorithm, the dependence of our bounds on the iteration count improves from linear growth to exponential decay. We validate our theoretical results on a stochastic portfolio optimization problem with uncertain asset returns.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "raw_sha256": "6e395c9a7b48a98398ea1f7327e3536f2d2b821c57268bc0d14cf376cf48cf61", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c3cf813acfea805d076a4b23dd4a8ab4cf64e9b1d1db3ad7ba025a4bc379d9da"}
+{"id": "source.frontier.arxiv-2609-16258", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.16258&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.16258: The AI-Enabled Scientific Frontier", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:16.350332+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.16258\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.16258</identifier>\n        <datestamp>2026-09-16</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:PF</setSpec>\n            <setSpec>econ:econ:GN</setSpec>\n            <setSpec>q-fin:q-fin:EC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.16258</id>\n        <created>2026-09-14</created>\n            <updated>2026-09-16</updated>\n        <authors>\n                <author>\n                    <keyname>Manso</keyname>\n                        <forenames>Gabriel</forenames>\n                </author>\n                <author>\n                    <keyname>Fu</keyname>\n                        <forenames>Emma</forenames>\n                </author>\n                <author>\n                    <keyname>Thompson</keyname>\n                        <forenames>Neil</forenames>\n                </author>\n        </authors>\n        <title>The AI-Enabled Scientific Frontier</title>\n            <categories>cs.AI cs.LG cs.PF econ.GN q-fin.EC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As artificial intelligence&#39;s capabilities improve, it is increasingly viewed as a general scientific method. But how true are these claims? Does AI outperform all techniques, or only some, and how is this changing? To assess the claims, we assemble a corpus of 2,507 head-to-head comparisons between AI and other scientific analysis techniques across 27 scientific disciplines from papers published between 2000 and early 2025. We find a profound dichotomy. Relative to traditional statistics, AI often outperforms, but at a significantly higher computational cost. But there are also nearly a quarter of cases where AI is both more expensive and performs worse than traditional statistical techniques and this fraction has been stable for a decade. Relative to scientific computing, AI often underperforms, but at lower computational cost. This has begun to change: since 2020, AI&#39;s performance against scientific computing has notably strengthened and it now outperforms on more than half of comparisons. These patterns suggest that AI is therefore not a universal replacement for existing methods, but rather a valuable -- and improving -- part of a new AI-enabled scientific frontier.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "raw_sha256": "dc6e4a9d5866f9200cbba85160bbe00c77fff4e770b07b78d54e9a065aed147a", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "126f5ec54d163ebb7b5706f352a622ff1979175cd5897a49782fba7d181d2024"}
+{"id": "source.frontier.arxiv-2609-05749", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.05749&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.05749: The Normalization of Deviance in AI Development", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:42.323931+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:42Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.05749\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.05749</identifier>\n        <datestamp>2026-09-15</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:ET</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.05749</id>\n        <created>2026-09-13</created>\n            <updated>2026-09-15</updated>\n        <authors>\n                <author>\n                    <keyname>Barkett</keyname>\n                        <forenames>Emilio</forenames>\n                </author>\n                <author>\n                    <keyname>Kimpton</keyname>\n                        <forenames>Alexander</forenames>\n                </author>\n                <author>\n                    <keyname>Graham</keyname>\n                        <forenames>Daniel</forenames>\n                </author>\n                <author>\n                    <keyname>Kundgol</keyname>\n                        <forenames>Yusuf</forenames>\n                </author>\n        </authors>\n        <title>The Normalization of Deviance in AI Development</title>\n            <categories>cs.AI cs.ET cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Work on the risks of artificial intelligence has focused predominantly on capability risk: the danger that systems become too powerful, too autonomous, or too misaligned with human values. Far less attention has been paid to the organizational level---to whether the institutions building these systems are themselves predisposed to drift toward failure. This paper argues that they are. Regardless of how capable AI systems become, the organizations building them face the same structural dynamics that preceded past major technological disasters. Drawing on case studies of the Space Shuttle Challenger, the Three Mile Island accident, and the Boeing 737 MAX crashes, this paper identifies the common structural mechanisms preceding each failure and maps them onto contemporary AI development. The findings suggest that existing safety infrastructure may provide less protection than it appears, as organizations can complete safety processes in full compliance and still produce catastrophic outcomes. The pre-disaster period of AI development is still underway; the purpose of this paper is to make these dynamics legible while they can still be interrupted.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "raw_sha256": "a79cf476dab37a3b3c5464319bd300540473e042081bd13eeb576c1c6fdfa8d6", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "723015593f9ef815cba84edce98ace31cc65841b308356fef514402b4170a21e"}
+{"id": "source.frontier.arxiv-2609-14022", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.14022&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.14022: Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:45.752182+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:45Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.14022\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.14022</identifier>\n        <datestamp>2026-09-15</datestamp>\n            <setSpec>cs:cs:NI</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.14022</id>\n        <created>2026-09-12</created>\n            <updated>2026-09-15</updated>\n        <authors>\n                <author>\n                    <keyname>Haigh</keyname>\n                        <forenames>Paul Anthony</forenames>\n                </author>\n                <author>\n                    <keyname>Rajbhandari</keyname>\n                        <forenames>Sujan</forenames>\n                </author>\n                <author>\n                    <keyname>Bottrill</keyname>\n                        <forenames>Kyle</forenames>\n                </author>\n                <author>\n                    <keyname>Trichili</keyname>\n                        <forenames>Abderrahmen</forenames>\n                </author>\n                <author>\n                    <keyname>Watson</keyname>\n                        <forenames>Scott</forenames>\n                </author>\n                <author>\n                    <keyname>Abumarshoud</keyname>\n                        <forenames>Hanaa</forenames>\n                </author>\n                <author>\n                    <keyname>Benton</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Sinanovic</keyname>\n                        <forenames>Sinan</forenames>\n                </author>\n                <author>\n                    <keyname>Herrnsdorf</keyname>\n                        <forenames>Johannes</forenames>\n                </author>\n                <author>\n                    <keyname>Christopher</keyname>\n                        <forenames>Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Khalily</keyname>\n                        <forenames>Mohsen</forenames>\n                </author>\n                <author>\n                    <keyname>Tafazolli</keyname>\n                        <forenames>Rahim</forenames>\n                </author>\n                <author>\n                    <keyname>Haas</keyname>\n                        <forenames>Harad</forenames>\n                </author>\n                <author>\n                    <keyname>Lavery</keyname>\n                        <forenames>Martin</forenames>\n                </author>\n                <author>\n                    <keyname>Popoola</keyname>\n                        <forenames>Wasiu</forenames>\n                </author>\n        </authors>\n        <title>Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space</title>\n            <categories>cs.NI eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Next-generation connectivity depends on data traversing multiple physical media within a single end-to-end path, yet research in optical fibre, free-space optical and radio wireless, non-terrestrial networks, and underwater communications has advanced largely in isolation. This fragmentation has a wider adverse impact on communication performance, deployment and adaption as the most demanding open problems in next-generation connectivity, cross-medium channel characterisation, transport-layer protocol design across heterogeneous latency regimes, and cross-domain orchestration, sit at the boundaries between domains and can only be addressed by bringing these challenges together in cross-domain systems. Space-air-ground integrated network research has begun to treat three domains analytically, and its recent extension to the sea surface represents the most ambitious multi-domain framework proposed to date, yet neither has produced experimental results, a deployed system, or a standards engagement. The subsurface and maritime domain remains absent from both. This paper proposes the connected heterogeneous all-medium integrated network (CHAIN), a framework that treats the undersea, maritime, terrestrial, aerial and space domains as a single design space. We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge. We survey the state of the art across all domains and the existing cross-domain literature, develop the CHAIN framework and its technical pillars, characterise the five core open problems the field must resolve, and set out a research roadmap from near-term measurement campaigns and testbed validation through cross-medium field trials to global-scale deployment.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "raw_sha256": "dfe5c9ddccdb7aadce8ba76087384e06bd78ae55f313f99e0c62dc98c9436a25", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "e14fb5e4acef0a3a77a1543af556a266e5f0ab51d53315f75a3274798415204c"}
+{"id": "source.frontier.arxiv-2609-12866", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12866&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.12866: Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:49.184304+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:49Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12866\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12866</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12866</id>\n        <created>2026-09-11</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Buciulea</keyname>\n                        <forenames>Andrei</forenames>\n                </author>\n                <author>\n                    <keyname>Isufi</keyname>\n                        <forenames>Elvin</forenames>\n                </author>\n                <author>\n                    <keyname>Leus</keyname>\n                        <forenames>Geert</forenames>\n                </author>\n                <author>\n                    <keyname>Marques</keyname>\n                        <forenames>Antonio G.</forenames>\n                </author>\n        </authors>\n        <title>Learning the Topology of a Simplicial Complex Using Noisy Simplicial Signals</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Graphs are a fundamental tool for modeling the irregular (non-Euclidean) structure of complex data. However, they are inherently limited to representing pairwise relationships, making them inadequate for datasets exhibiting higher-order interactions. Simplicial complexes (SCs) have emerged as a promising framework for capturing such higher-order dependencies. This paper focuses on the problem of identifying the topology of an SC from signals, which serves as the foundation for SC-based processing and learning schemes. We consider a setting where we observe noisy signals (features) associated with the nodes of the SC (0-simplices) and a subset of the edges (1-simplices). We assume the observed signals are smooth over the unknown SC topology, and that the higher-order interactions are sparse. Building on these assumptions, we formulate topology learning as a nonconvex optimization problem and propose an efficient block-coordinate descent (BCD) algorithm to solve it. A key step in our formulation is the modeling of the topology of the SC using binary edge and triangle selection vectors, combined with efficient greedy algorithms for optimizing such vectors. We establish theoretical convergence guarantees to a stationary point of a relaxed (penalized) version of the problem and discuss computational complexity. Multiple numerical experiments with both synthetic and real-world datasets validate the effectiveness of our approach, highlighting the capability of SC-learning methods to uncover and model higher-order relationships in complex datasets.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "raw_sha256": "e0369807ece32dc14d0bdc4931b40e8df0abc85c9ea0a2e604b4b5dd1710fa1f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "925e19a96571b8fa18848a4d148bf85bf97876bfd3d29177236c5364702249d2"}
+{"id": "source.frontier.arxiv-2609-12486", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12486&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.12486: Adaptive Agent Design", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:52.836742+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:52Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12486\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12486</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12486</id>\n        <created>2026-09-11</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Velicheti</keyname>\n                        <forenames>Raj Kiriti</forenames>\n                </author>\n                <author>\n                    <keyname>Bose</keyname>\n                        <forenames>Subhonmesh</forenames>\n                </author>\n                <author>\n                    <keyname>Başar</keyname>\n                        <forenames>Tamer</forenames>\n                </author>\n        </authors>\n        <title>Adaptive Agent Design</title>\n            <categories>eess.SY cs.AI cs.GT cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We consider an agent acting against a general non-Markovian environment. The agent maintains its agent states, but is free to choose a transition kernel across those states and optimize its state-feedback control policies. We study the bi-level agent design problem that optimizes the transition kernel and the policy it induces, given said kernel with offline data of observations and actions obtained via a behavioral policy. For general environments, we show that a soft $Q$-learning algorithm converges almost surely to the fixed point of a soft Bellman equation defined by the stationary averages that the behavioral policy and the chosen kernel induce, and we delineate what separates the resulting policy from an optimal one. In partially observed Markov decision problems, we analyze convergence properties of parametrized transition kernel design via zero-th order and Bayesian optimization techniques.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "raw_sha256": "bd53e7da792a3192c07812e99f0cef1d20f23a869d82dadd839c7b127eb90cd8", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "9f9ac62c58a95ad0f0770979d34040a5a927991bb16810e7b1ab942b0108f257"}
+{"id": "source.frontier.arxiv-2609-12016", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.12016&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.12016: Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:56.233910+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:56Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.12016\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.12016</identifier>\n        <datestamp>2026-09-14</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.12016</id>\n        <created>2026-09-10</created>\n            <updated>2026-09-14</updated>\n        <authors>\n                <author>\n                    <keyname>Haroon</keyname>\n                        <forenames>Adam</forenames>\n                </author>\n                <author>\n                    <keyname>Rodríguez-Seda</keyname>\n                        <forenames>Erick J.</forenames>\n                </author>\n                <author>\n                    <keyname>Schuler</keyname>\n                        <forenames>Tristan</forenames>\n                </author>\n                <author>\n                    <keyname>Fleming</keyname>\n                        <forenames>Cody</forenames>\n                </author>\n        </authors>\n        <title>Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <comments>8 pages, 3 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Self-triggered reinforcement learning control (RL-STC) learns the sparsest control schedule that preserves Lyapunov-decreasing stability under a Run-Time Assurance (RTA) override. We invert this: an adversarial RL agent learns the sparsest jamming or Denial-of-Service (DoS) schedule that destabilizes the closed loop, with a Lyapunov-increase admissibility predicate mirroring the defender&#39;s safety certificate. We prove a plant-property lower bound on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash against a self-triggered controller (STC) satisfying a Lyapunov contract, and recover a certificate-level analog of the consecutive-grouping optimality of prior count-budget DoS scheduling as a corollary. This extends the DoS-scheduling count-budget analysis from periodic and linear-time-invariant to STC controllers. Empirically, we train against four fixed defenders per plant (one Linear Quadratic Regulator (LQR) and three RL-STC) on Pendulum, CartPole, and Quadrotor2D. The learned adversary is the only adversary that crashes every defender on every plant at $100\\%$: greedy misses Quadrotor2D LQR on $42\\%$ of episodes and periodic misses Pendulum LQR on $97\\%$. On jam-time-per-failure it beats baselines by up to $2.8\\times$, and shows its widest absolute margin on Quadrotor2D LQR. Robustness ablations show that Gaussian observation noise exceeding the initial-state magnitude and position-only observation both preserve $100\\%$ failure rate and keep the learned adversary strictly ahead of both baselines on jam-time-per-failure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "raw_sha256": "e5c105751a901110d275c2cbe5a0ca6643b6cb46b90550f218abd1d5a70997af", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8bb2bb90571f302285faf42c0e610a8d42a1ffa33863a835416f546366db2b99"}
+{"id": "source.frontier.arxiv-2609-11530", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.11530&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.11530: pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:19.740295+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.11530\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.11530</identifier>\n        <datestamp>2026-09-11</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.11530</id>\n        <created>2026-09-10</created>\n            <updated>2026-09-11</updated>\n        <authors>\n                <author>\n                    <keyname>Marzulli</keyname>\n                        <forenames>M.</forenames>\n                </author>\n                <author>\n                    <keyname>Angiolelli</keyname>\n                        <forenames>A.</forenames>\n                </author>\n                <author>\n                    <keyname>Mannino</keyname>\n                        <forenames>C.</forenames>\n                </author>\n                <author>\n                    <keyname>Demuru</keyname>\n                        <forenames>M.</forenames>\n                </author>\n                <author>\n                    <keyname>Sorrentino</keyname>\n                        <forenames>P.</forenames>\n                </author>\n                <author>\n                    <keyname>Corsi</keyname>\n                        <forenames>M. -C.</forenames>\n                </author>\n        </authors>\n        <title>pyAvalanches: A Python Package for Analyzing Spatiotemporal Propagation in Neuronal Avalanches</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The analysis of neuronal avalanches offers insights into brain dynamics utilizing the framework of criticality, but the reproducibility and comparability of studies are limited by the use of fragmented, lab-specific scripts. To address this issue, we introduce pyAvalanches, an open-source Python package providing a standardized, end-to-end pipeline for avalanche analysis from electrophysiological recordings (e.g., electroencephalography-EEG). Starting from the detection of neuronal avalanches the package provides their core statistical characterization, including size and duration distributions. Beyond this, the main aim of pyAvalanches is to characterize the spatiotemporal organization of activity propagation during avalanches. To this end, the core innovation of pyAvalanches is the compuation of Avalanche Transition Matrices (ATMs) to map spatiotemporal propagation patterns. Building on this, the package derives network-based metrics from the ATMs, bridging the study of the topology and organization of the underlying dynamical interactions with network neuroscience adopting the framework of neuronal avalanches. The entire workflow is encapsulated in a modular and scikit-learn compatible architecture. We demonstrate the utility of pyAvalanches through an illustrative group-level analysis on a public resting-state EEG dataset, comparing propagation patterns across different clinical populations. By providing a user-friendly, tested, and extensible tool, pyAvalanches facilitates reproducible research, enables the development of novel avalanche-based biomarkers, and makes complex avalanche analysis accessible to a broader scientific community. The package is fully documented and distributed via the Python Package Index (PyPI).</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "raw_sha256": "89ac7d7a85937c582bbafa92397fbbdd5c0d590ad8d63a2669d85c56e68da7b8", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b97d3f46ad371db32bf8209e63a373eae34a771bbf3f86214db4c33991470fda"}
+{"id": "source.frontier.arxiv-2609-08218", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.08218&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.08218: Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach", "source_kind": "primary", "retrieved_at": "2026-10-18T16:42:59.774649+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:42:59Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.08218\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.08218</identifier>\n        <datestamp>2026-09-10</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.08218</id>\n        <created>2026-09-09</created>\n            <updated>2026-09-10</updated>\n        <authors>\n                <author>\n                    <keyname>Bahavarnia</keyname>\n                        <forenames>MirSaleh</forenames>\n                </author>\n                <author>\n                    <keyname>Taha</keyname>\n                        <forenames>Ahmad F.</forenames>\n                </author>\n        </authors>\n        <title>Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper explores stabilizing traffic flow using a minimum number of autonomous vehicles (AVs) under control constraints. In contrast to most studies, we consider a heterogeneous parameter setup scenario for human-driven vehicles (HVs) to reflect real-world differences in driving behavior. While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow. To reduce such conservativeness and obtain a less conservative lower bound, we ensure the string stability of traffic flow by directly imposing the possession of no growing eigenmodes. We also systematically find a minimum number of required AVs and solve for the optimal control parameters via nonlinear optimization. We finally assess the intended conservativeness reduction via numerical simulations. Quantitatively, applying our algorithm to the homogeneous HV baseline in the literature (the result built upon an H-Infinity based sufficient condition) reduces (improves) the AV penetration rate by 17.14% while ensuring the string stability of traffic flow. We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs. Quantitatively, our last numerical simulation corroborates that the AV penetration rate can be reduced by 61.54% at the expense of 27.66% higher position difference deviation from the equilibrium and a 92.47% degradation in the real stability radius (RSR)---a metric to measure the stability robustness under the perturbation/uncertainty---associated with the aggregated linearized dynamics while ensuring the string stability of traffic flow. This trade-off helps engineers/operators make better traffic control decisions.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "raw_sha256": "a78fd0394163c05083c7154b2bcc29da477163a339df1ff7f258087aacdd830e", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "279644ab255126a49d16610ef48eb2f6a491eedba5bbbffae0ac953b21a84d2b"}
+{"id": "source.frontier.arxiv-2609-06163", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06163&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.06163: Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:03.196691+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:03Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.06163\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.06163</identifier>\n        <datestamp>2026-09-09</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.06163</id>\n        <created>2026-09-05</created>\n            <updated>2026-09-09</updated>\n        <authors>\n                <author>\n                    <keyname>Vu</keyname>\n                        <forenames>Tien Dat</forenames>\n                </author>\n                <author>\n                    <keyname>Doan</keyname>\n                        <forenames>Minh</forenames>\n                </author>\n        </authors>\n        <title>Fixed-Time Integral Reinforcement Learning for Saturated Nonlinear Multi-Agent Systems Under FDI Attacks</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>16 pages, 8 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The leader-follower formation control problem is investigated for nonlinear multi-agent systems with unknown dynamics, external disturbances, and false data injection (FDI) attacks on actuator channels. The problem is formulated as a zero-sum differential game and solved using the Integral Bellman-Isaacs approach. To address input saturation constraints, a non-quadratic control cost function is incorporated into the optimization problem, leading to a bounded control law. Furthermore, this paper proposes a cost function construction method and develops a critic learning law, which together guarantee the practical fixed-time stability of the system while overcoming the limitations of existing fixed-time reinforcement learning formulations. Finally, the practical fixed-time convergence of both the critic weight estimation error and the leader-referenced formation tracking error to bounded residual sets is rigorously proven. Simulation results demonstrate the effectiveness of the proposed method under external disturbances, FDI attacks, and input constraints.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "raw_sha256": "c9dd5403340146d65341794c39b1f9568f29c970b67335f261062dc8d9cbec61", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "4bbf5a5c1cedd628158e67af6facea26ae5f710bd444846e96e266bdb1426301"}
+{"id": "source.frontier.arxiv-2609-06066", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.06066&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.06066: Scalability of Graph Neural Network Policies in Wireless Communication Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:06.668513+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.06066\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.06066</identifier>\n        <datestamp>2026-09-09</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.06066</id>\n        <created>2026-09-05</created>\n            <updated>2026-09-09</updated>\n        <authors>\n                <author>\n                    <keyname>Camargo</keyname>\n                        <forenames>Romina Garcia</forenames>\n                </author>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Zhiyang</forenames>\n                </author>\n                <author>\n                    <keyname>Ribeiro</keyname>\n                        <forenames>Alejandro</forenames>\n                </author>\n        </authors>\n        <title>Scalability of Graph Neural Network Policies in Wireless Communication Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Graph Neural Networks (GNNs) offer scalable solutions for wireless resource allocation, yet existing formal performance guarantees across varying scales for spatial and sparse graphs do not directly apply to these settings. Scalability theories rely on dense graphon limits or continuous manifold approximations, both of which fail under the sparse, bounded-degree regimes and Euclidean metric constraints of physical wireless environments. This paper establishes a theoretical framework for GNN transferability over sparse Random Geometric Graphs (RGGs), capturing distance-dependent channel decay and spatial interference. We model sparse RGGs as spatial perturbations of regular Deterministic Grid Graphs (DGGs) and employ spatial windowing operators to compare networks across differing scales. Assuming Lipschitz continuity of GNN architectures and signal stationarity, we prove scalability over DGGs and bound same-scale transferability between DGGs and RGGs. Combining these results establishes formal scalability bounds across sparse RGG topologies. Finally, we extend this framework to conflict graph models, deriving equivalent scalability guarantees for link-level resource allocation policies. We verify our results for scalability with two experiment settings: power allocation and wireless link scheduling. The simulations show GNNs exhibit the expected scalable behavior, and analyze the relevance of our theoretical assumptions in practical deployment.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "raw_sha256": "69292f54c3b5103359214e8c4eed329cd50001268a3444507b7ce6ab6947f1fe", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "7f4a13ac2e84be60f90ecc176d63222665c5f4c95d430f7a3b61fd4139043e6f"}
+{"id": "source.frontier.arxiv-2609-02071", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2609.02071&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2609.02071: Turnpike properties in nonlinear system identification", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:10.062628+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:09Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2609.02071\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2609.02071</identifier>\n        <datestamp>2026-09-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2609.02071</id>\n        <created>2026-09-02</created>\n            <updated>2026-09-03</updated>\n        <authors>\n                <author>\n                    <keyname>Schiller</keyname>\n                        <forenames>Julian D.</forenames>\n                </author>\n                <author>\n                    <keyname>Müller</keyname>\n                        <forenames>Matthias A.</forenames>\n                </author>\n        </authors>\n        <title>Turnpike properties in nonlinear system identification</title>\n            <categories>eess.SY cs.SY math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We analyze the problem of learning general discrete-time nonlinear state-space models using the simulation error minimization (SEM) method. In this setting, model parameters are typically learned by minimizing the mismatch between simulated and measured outputs over a training dataset, or shorter subsequences extracted from it. Specifically, we study the cumulative output turnpike property of the underlying SEM optimization problem, which requires optimal output sequences emanating from a fixed initial state to approach and remain close to an optimal output sequence of the corresponding SEM problem with free initial state. In the presence of non-unique optimal output sequences---as may arise, for instance, in fully black-box system identification using neural networks---the property is formulated with respect to the closest such sequence. Turnpike behavior is generally desirable in practice, as it provides a theoretical justification for employing computationally more tractable SEM formulations with fixed initial states while ensuring that their optimal output sequences remain close to unconstrained optimal ones. Under a mild reachability condition, we establish equivalence between the cumulative turnpike property, coercivity of the value function, and a tailored notion of strict dissipativity. We additionally introduce a cardinality turnpike property and show that it is strictly weaker than the cumulative notion. Finally, we establish sufficient conditions for turnpike behavior based on incremental output stability, convexity of the stage cost, and a suitable optimality condition, and illustrate the theory by means of a numerical example.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "raw_sha256": "fb2f2a3fbfc62179b86934c1283fef3069c9cd281e2bcfb611847abfa9da92ff", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "6a44b2fb91797bf917d0bbe91ebfd53a185de37a006459dc399d8291fd663aec"}
+{"id": "source.frontier.arxiv-2608-31034", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.31034&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.31034: XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:13.664613+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:13Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.31034\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.31034</identifier>\n        <datestamp>2026-09-01</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.31034</id>\n        <created>2026-08-31</created>\n            <updated>2026-09-01</updated>\n        <authors>\n                <author>\n                    <keyname>Guarino</keyname>\n                        <forenames>Idio</forenames>\n                </author>\n                <author>\n                    <keyname>Nascita</keyname>\n                        <forenames>Alfredo</forenames>\n                </author>\n                <author>\n                    <keyname>Ciuonzo</keyname>\n                        <forenames>Domenico</forenames>\n                </author>\n                <author>\n                    <keyname>Carra</keyname>\n                        <forenames>Damiano</forenames>\n                </author>\n                <author>\n                    <keyname>Pescapé</keyname>\n                        <forenames>Antonio</forenames>\n                </author>\n        </authors>\n        <title>XAI2CSI: Interpreting CSI with eXplainable AI for Human Activity Recognition</title>\n            <categories>eess.SP</categories>\n            <comments>accepted at 22nd International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 26)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Wi-Fi Channel State Information (CSI) has emerged as a key enabler for device-free Human Activity Recognition (HAR), enabling low-cost, unobtrusive sensing using existing communication infrastructure. However, Deep Learning (DL) models trained on CSI data often struggle to generalize across users, environments, and device setups due to the context sensitivity of wireless propagation. Despite this challenge, limited attention has been devoted to understanding model decisions and generalization failures. This paper introduces XAI2CSI, a framework that leverages eXplainable Artificial Intelligence (XAI) to analyze DL-based CSI sensing systems. XAI2CSI employs SAGE, a model-agnostic explainability method, to quantify temporal, spectral, and spatial CSI contributions to HAR decisions under nominal and cross-context evaluations on IEEE 802.11ax data. Our analysis reveals that the considered DL model exhibits limited robustness to unseen conditions due to an over-reliance on context-specific CSI patterns, causing models to misinterpret the underlying signal dynamics when deployment conditions change. The proposed methodology and findings provide a reference framework to explore alternative solutions and guide the development of robust, transparent Wi-Fi sensing systems.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "raw_sha256": "c7cd7445c038ea8f2747cd920bcdf845aa7846507b7a436e41b2f3113b8a4d37", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "dc92819fa16f14593246f1f59bc545375d86d5ffa87956ae8d96219d9ce02ba5"}
+{"id": "source.frontier.arxiv-2608-28387", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.28387&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.28387: Neuromorphic architectures as numerical solvers for computational neuroscience", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:23.164206+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.28387\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.28387</identifier>\n        <datestamp>2026-08-31</datestamp>\n            <setSpec>cs:cs:AR</setSpec>\n            <setSpec>q-bio:q-bio:QM</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.28387</id>\n        <created>2026-08-28</created>\n            <updated>2026-08-31</updated>\n        <authors>\n                <author>\n                    <keyname>Jordan</keyname>\n                        <forenames>Jakob</forenames>\n                </author>\n                <author>\n                    <keyname>Richter</keyname>\n                        <forenames>Ole</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Congyang</forenames>\n                </author>\n                <author>\n                    <keyname>Petrovici</keyname>\n                        <forenames>Mihai A.</forenames>\n                </author>\n                <author>\n                    <keyname>Manohar</keyname>\n                        <forenames>Rajit</forenames>\n                </author>\n        </authors>\n        <title>Neuromorphic architectures as numerical solvers for computational neuroscience</title>\n            <categories>cs.AR q-bio.QM</categories>\n            <comments>23 pages, 7 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Neuromorphic computing is closely associated with spiking neuronal networks. However, an alternative class of so-called &#34;rate-based&#34; models arising from computational neuroscience and machine learning forgoes spiking interactions and instead relies on continuous coupling between neurons. Existing neuromorphic implementations designed around spike-based interactions are not well-suited for emulating such models. Here view the distributed simulation of these models as message-passing algorithms on parallel hardware. Leveraging prior art in numerical algorithms and distributed simulation, we outline steps that enable the design of efficient digital neuromorphic accelerators for non-spiking neuronal models. In particular, we show that multi-bit packets, rather than spikes, are the most efficient communication strategy in packet-switched networks and that compared to basic numerical integration methods, higher-order differential equation solvers decrease both computation and communication costs while achieving lower numerical error, but that these benefits are ultimately limited by arithmetic precision. Using our proposed design principles, we convert an existing neuromorphic architecture into a distributed numerical solver - a spikeless neuromorphic system - for continuously-coupled neuronal models. We thereby demonstrate that our theoretical considerations indeed translate into practical advantages, namely reduced energy consumption and delay.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "raw_sha256": "29771669bc98248b5b48908f848e1991317fb7dcf206399e678df49f0a547f44", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f460955529ec6d22470c2cc67dd680bc5009aa88c95b95cbb1cb1e5239dc3bcf"}
+{"id": "source.frontier.arxiv-2608-27536", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.27536&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.27536: Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:26.557443+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.27536\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.27536</identifier>\n        <datestamp>2026-08-31</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>econ:econ:TH</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.27536</id>\n        <created>2026-08-27</created>\n            <updated>2026-08-31</updated>\n        <authors>\n                <author>\n                    <keyname>Salizzoni</keyname>\n                        <forenames>Giulio</forenames>\n                </author>\n                <author>\n                    <keyname>Cecchelli</keyname>\n                        <forenames>Domenico Mergoni</forenames>\n                </author>\n                <author>\n                    <keyname>Plumb</keyname>\n                        <forenames>Edward</forenames>\n                </author>\n                <author>\n                    <keyname>Kamgarpour</keyname>\n                        <forenames>Maryam</forenames>\n                </author>\n                <author>\n                    <keyname>Ashkenazi-Golan</keyname>\n                        <forenames>Galit</forenames>\n                </author>\n        </authors>\n        <title>Refundable Deposits: How to Restore Cooperation in Finitely Repeated Games</title>\n            <categories>cs.GT econ.TH</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>While infinitely repeated games admit a rich set of Nash equilibria, finitely repeated games typically have a much smaller and often inefficient one. We show how to enlarge this set using deposits: in each period a player may place a refundable sum with a neutral intermediary, returned when the game ends and forfeited following a deviation. Paying these deposits is voluntary and incentive compatible at every stage, so no commitment by the players is assumed, the only commitment required being that of the intermediary to a refund rule fixed before play begins. The mechanism sustains payoff profiles more efficient than those of the standard equilibria, without altering the underlying game and without transfers between players. We demonstrate it on the prisoner&#39;s dilemma, a congestion game, and a public goods game, all settings where cooperation cannot emerge in the standard finitely repeated version. We also apply it to a dynamic common-pool resource, suggesting that the construction extends beyond repeated stage-games.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "raw_sha256": "527f0ac20d24a24fb8b24da5d9469fe37195a8cabffaccac7db21d3899328a4d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "93991daafa68abc1c9344008028b32c42ab2ff7b76d8f3e71f2886090fd2a814"}
+{"id": "source.frontier.arxiv-2608-26093", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.26093&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.26093: Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:17.079904+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:16Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.26093\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.26093</identifier>\n        <datestamp>2026-08-27</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.26093</id>\n        <created>2026-08-26</created>\n            <updated>2026-08-27</updated>\n        <authors>\n                <author>\n                    <keyname>Khan</keyname>\n                        <forenames>Ahmad</forenames>\n                </author>\n                <author>\n                    <keyname>Sediq</keyname>\n                        <forenames>Akram Bin</forenames>\n                </author>\n                <author>\n                    <keyname>Naeini</keyname>\n                        <forenames>Sara Azadegi</forenames>\n                </author>\n                <author>\n                    <keyname>Adve</keyname>\n                        <forenames>Raviraj S.</forenames>\n                </author>\n        </authors>\n        <title>Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher&#39;s Role</title>\n            <categories>cs.LG cs.IT cs.SY eess.SY math.IT</categories>\n            <comments>Submitted to IEEE Globecom Workshops</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Designing machine learning algorithms for wireless resource management is labour-intensive: the architecture, the loss function and the training recipe are all specified by hand. We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety. We adopt the autoresearch protocol, in which an AI coding agent edits a training script, runs a fixed-budget experiment, and retains or discards the change according to a single immutable metric. We grant the agent authority over the architecture family, the input representation, the output parameterization, the loss function and the task-sampling law, and set it a target chosen for its difficulty: sum-least-percentile-rate power control across a multicell network. The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex. Safeguards render the results trustworthy: a hash-pinned evaluator, an enforced inference contract and a pre-registered falsifier per experiment. In eighty-one unattended experiments over twenty-six hours, the agent reached $99.5\\%$ of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly $600\\times$ lower inference cost, closing $94\\%$ of the gap from its first working architecture, with one parameter set serving every network size and percentile target. It recovered provable structure rather than tuned constants: the output parameterization it discovered reproduces the exact max-min-optimal allocation at the minimum percentile, for every value of the trained weights.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "raw_sha256": "c56c539ab58f8540f8bded4ef22d6982c880b4c2020a27f0807bd9b8d91b0ca8", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "50641d521a3dbf522f79695399c136faf9446272f232eaae8421f21cca04c757"}
+{"id": "source.frontier.arxiv-2608-24219", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.24219&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.24219: Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:29.991977+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:29Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.24219\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.24219</identifier>\n        <datestamp>2026-08-26</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.24219</id>\n        <created>2026-08-25</created>\n            <updated>2026-08-26</updated>\n        <authors>\n                <author>\n                    <keyname>López</keyname>\n                        <forenames>Francisco M.</forenames>\n                </author>\n                <author>\n                    <keyname>Triesch</keyname>\n                        <forenames>Jochen</forenames>\n                </author>\n        </authors>\n        <title>Beauty is in the ELBO of the Beholder: A Variational Account of Processing Fluency in Face Perception</title>\n            <categories>cs.CV q-bio.NC</categories>\n            <comments>24 pages, 11 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Facial attractiveness has been linked to statistical regularities such as symmetry and averageness, suggesting that beauty may depend on the ease with which a face is perceived. We empirically test this hypothesis by training variational autoencoders on four face datasets without attractiveness supervision and evaluating their representations on the 597 faces from the Chicago Face Database. Across models, human attractiveness ratings closely aligns with the direction defined by the VAE evidence lower bound (ELBO) in rate-distortion space. Independently learned latent spaces contain an attractiveness direction that transfers strongly across random initializations and training data. We also find that attractive faces are more prototypical in both shape and latent space. Our results connect classic accounts of aesthetics with learned generative models and provide empirical support for a variational interpretation of the processing fluency theory of aesthetic pleasure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "raw_sha256": "f6359794f208238171c88e8e1659e6014e1ce825fc96ec5228125110a69b0173", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0c96c0b06ef8667befa4d89edbf29af558a1e4b6915b8685495aa511ed5e76fa"}
+{"id": "source.frontier.arxiv-2608-23972", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.23972&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.23972: Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:20.616948+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:20Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.23972\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.23972</identifier>\n        <datestamp>2026-08-26</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.23972</id>\n        <created>2026-08-25</created>\n            <updated>2026-08-26</updated>\n        <authors>\n                <author>\n                    <keyname>Zhao</keyname>\n                        <forenames>Yiqi</forenames>\n                </author>\n                <author>\n                    <keyname>Kim</keyname>\n                        <forenames>Taekyung</forenames>\n                </author>\n                <author>\n                    <keyname>Okamoto</keyname>\n                        <forenames>Hideki</forenames>\n                </author>\n                <author>\n                    <keyname>Hoxha</keyname>\n                        <forenames>Bardh</forenames>\n                </author>\n                <author>\n                    <keyname>Deshmukh</keyname>\n                        <forenames>Jyotirmoy V.</forenames>\n                </author>\n                <author>\n                    <keyname>Lindemann</keyname>\n                        <forenames>Lars</forenames>\n                </author>\n                <author>\n                    <keyname>Fainekos</keyname>\n                        <forenames>Georgios</forenames>\n                </author>\n        </authors>\n        <title>Safety-aware Model Predictive Path Integral Control with Signal Temporal Logic</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Safety-aware motion planning remains a challenge in robotics, especially when missions are time-critical and are under complex specifications. In this paper, we propose safety-aware-stl-mppi, a computationally efficient sampling-based receding-horizon planning framework designed to promote satisfaction of constraints expressed in Signal Temporal Logic (STL). Our approach encodes discrete-time STL formulas into candidate time-varying control barrier functions (CBF), which are integrated into a model predictive path integral (MPPI) controller. Our method inherits the benefits of low computational cost from an efficiently parallelizable sampling based planner and utilizes CBF for constraints expressed in STL. We compare against several MPPI baselines using four artificial Mars Rover planning case studies with a diverse environment and cost setups, where we show our method consistently achieving high safety and efficiency. We show a quadcopter planning experiment with NVIDIA Isaac Lab.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "raw_sha256": "b27ae25297a7f35a9f732604282ac00c7a364178687852e8ea61268d41ab6b48", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "eaaafc1fb3362bfcef444bc6643592f4bd2ad88960bb0438bec382ffcd96bc3a"}
+{"id": "source.frontier.arxiv-2608-21764", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21764&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.21764: LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices", "source_kind": "primary", "retrieved_at": "2026-10-18T16:43:24.047991+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:43:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.21764\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.21764</identifier>\n        <datestamp>2026-08-25</datestamp>\n            <setSpec>cs:cs:CV</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.21764</id>\n        <created>2026-08-22</created>\n            <updated>2026-08-25</updated>\n        <authors>\n                <author>\n                    <keyname>Islam</keyname>\n                        <forenames>Riadul</forenames>\n                </author>\n                <author>\n                    <keyname>Mule</keyname>\n                        <forenames>Joey</forenames>\n                </author>\n                <author>\n                    <keyname>Challagundla</keyname>\n                        <forenames>Dhandeep</forenames>\n                </author>\n                <author>\n                    <keyname>Rizvi</keyname>\n                        <forenames>Shahmir</forenames>\n                </author>\n                <author>\n                    <keyname>Carson</keyname>\n                        <forenames>Sean</forenames>\n                </author>\n                <author>\n                    <keyname>Saini</keyname>\n                        <forenames>Rachit</forenames>\n                </author>\n        </authors>\n        <title>LiteEvent-AE: Lightweight Autoencoder for Event-Based Vision on Low-Latency Energy-Constrained Edge Devices</title>\n            <categories>cs.CV cs.AI eess.IV</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Event-based vision has emerged as a promising paradigm for energy-aware artificial intelligence (AI), offering sparse, low-latency visual signals that reduce redundant data processing and support sustainable edge computing. However, the asynchronous and noise-prone nature of event streams creates challenges for conventional deep learning models, which are often too computationally intensive for low-power embedded platforms. This work presents a compact and configurable event-driven autoencoder that efficiently compresses neuromorphic data while preserving essential spatiotemporal structure for downstream inference. The architecture integrates lightweight convolutional encoding with robust performance under adaptive event thresholding and a minimal classifier head, enabling substantial reductions in computational cost without degrading recognition fidelity. Extensive evaluations on the Smart Event Face Dataset (SEFD) and Event-Based Crossing Dataset (EBCD) show that the proposed framework achieves competitive or superior accuracy compared to YOLOv9 while requiring up to 35.6$\\times$ fewer parameters. To assess real-world sustainability, the model is deployed on resource-constrained hardware: a Raspberry Pi 4B and a NVIDIA Jetson Nano. On NVIDIA Jetson Nano, it delivers real-time throughput of 44.8 FPS. On a Raspberry Pi 4B CPU, the 50\\% autoencoder classifier consumes 16.19 J for the evaluated inference workload, corresponding to approximately 726.3$\\times$ lower energy consumption than YOLOv9 under the same evaluation protocol. These results demonstrate the potential of compact event-driven models to advance environmentally conscious, low-power AI systems for high-speed perception in autonomous, mobile, and embedded computing environments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "raw_sha256": "0d1b7fa7b242936b0bc5a801d4322406f635024a3e83d30b46f532568876e8d0", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8c446cd5767a0ba418faf9b5a8eb3c8e0f0796980a2a089b760e506d435eac3f"}
+{"id": "source.frontier.arxiv-2608-21020", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.21020&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.21020: Frequency-Selective Pinching-Antenna Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:36.937030+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.21020\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.21020</identifier>\n        <datestamp>2026-08-24</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.21020</id>\n        <created>2026-08-21</created>\n            <updated>2026-08-24</updated>\n        <authors>\n                <author>\n                    <keyname>Ouyang</keyname>\n                        <forenames>Chongjun</forenames>\n                </author>\n                <author>\n                    <keyname>Jiang</keyname>\n                        <forenames>Hao</forenames>\n                </author>\n                <author>\n                    <keyname>Ding</keyname>\n                        <forenames>Zhiguo</forenames>\n                </author>\n                <author>\n                    <keyname>Schober</keyname>\n                        <forenames>Robert</forenames>\n                </author>\n        </authors>\n        <title>Frequency-Selective Pinching-Antenna Systems</title>\n            <categories>eess.SP</categories>\n            <comments>34 pages</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>An uplink pinching-antenna system (PASS) is considered, where a segmented dielectric waveguide is employed to serve multiple users and one pinching antenna (PA) is activated on each segment. Extensive waveguide deployment reduces user-to-PA path loss but also creates differential propagation delays among the PA-assisted paths spanning the large waveguide aperture. These delays are retained, and a Toeplitz block model is derived to characterize the resulting frequency-selective (FS) channel. For infinite-blocklength transmission, the achievable single-user rate and the multiuser sum-rates under joint and parallel decoding are characterized. For carrier-phase-aligned single-user PA placement, the frequency-flat (FF) model is shown to overestimate the exact FS rate. The difference between the rates computed under the FF channel model and the exact FS channel model is referred to as the FF rate overestimation, and its dependence on the waveguide-aperture-induced delay spread is characterized. For small delay spreads, the FF rate overestimation is shown to increase approximately quadratically with the delay spread, whereas a derived lower bound reveals that the overestimation grows at least double logarithmically with the waveguide aperture, or equivalently with the delay spread, in the large-aperture regime. For finite-blocklength transmission, achievable rates are derived under a practical cyclic-prefix single-carrier frequency-domain equalization framework. An element-wise algorithm is developed to optimize FS-aware PA placement in both transmission regimes. The analytical findings demonstrate that differential delays across the extensively deployed waveguide can cause significant frequency selectivity and that the proposed FS-aware PA placement method substantially improves the achievable rate over placement based on the FF approximation, especially for large bandwidths and apertures.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "raw_sha256": "02138507e015ab62a554133ed6258aa0e8ddde104ab1b338f721310239b8cb6e", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "9d5bafe10a5ecdb58c56ff73ce1ba32aa22fdd2a538f46f230436fa0b8150274"}
+{"id": "source.frontier.arxiv-2608-20723", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.20723&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.20723: Conscious Access as Continuous-to-Discrete Translation", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:40.332186+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.20723\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.20723</identifier>\n        <datestamp>2026-08-24</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n            <setSpec>cs:cs:SC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.20723</id>\n        <created>2026-08-21</created>\n            <updated>2026-08-24</updated>\n        <authors>\n                <author>\n                    <keyname>Yang</keyname>\n                        <forenames>Tianming</forenames>\n                </author>\n        </authors>\n        <title>Conscious Access as Continuous-to-Discrete Translation</title>\n            <categories>q-bio.NC cs.SC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The scientific study of consciousness frequently stalls on ontological debates regarding the &#34;Hard Problem.&#34; This paper proposes a pragmatic pivot. Rather than asking what consciousness is metaphysically, we ask how modeling conscious access as a specific computational transformation may address existing bottlenecks in neuroscience and artificial intelligence. We introduce the Continuous/Discrete (C/D) framework, which holds that the brain implements two distinct processing regimes: System C, a distributed sensory-motor network operating over continuous, high-dimensional manifolds, and System D, a centralized engine structured around discrete, scale-invariant symbols. We argue that conscious access requires a structure-preserving translation between these regimes, which maps localized continuous states onto discrete symbolic tokens, coupled with an inverse projection that grounds those tokens back into sensorimotor dynamics. By formalizing conscious access as this continuous-to-discrete conversion, we derive a unified set of testable predictions centered on representational geometry, specifically, on a measurable collapse from graded similarity structures to low-dimensional categorical equivalence classes. These predictions explicitly differentiate our account from Global Neuronal Workspace Theory, Integrated Information Theory, Predictive Processing, and Higher-Order Theories, shifting the focus from ontological status to computational mechanism. Beyond neuroscience, the framework provides a principled architecture for neuro-symbolic artificial intelligence. We argue that treating conscious access as translational computation offers a pragmatic, empirically tractable pathway forward, clarifying what conscious states functionally accomplish without requiring resolution of the hard problem of phenomenology.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "raw_sha256": "d951fc16c16d1379a7801d205818d6481a5f3fb092c548f295bc861874d08718", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "cd133f7b37e4ea2cc82251004fd2dd07bcc7d384914f8c1f8b1be5bb8885c28c"}
+{"id": "source.frontier.arxiv-2608-19416", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.19416&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.19416: Robust Near-Field Beam Focusing Under Imperfect Localization", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:47.330316+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:47Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.19416\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.19416</identifier>\n        <datestamp>2026-08-21</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.19416</id>\n        <created>2026-08-19</created>\n            <updated>2026-08-21</updated>\n        <authors>\n                <author>\n                    <keyname>Mozaffarikhosravi</keyname>\n                        <forenames>Nima</forenames>\n                </author>\n                <author>\n                    <keyname>Azarbahram</keyname>\n                        <forenames>Amirhossein</forenames>\n                </author>\n                <author>\n                    <keyname>Dharmawansa</keyname>\n                        <forenames>Prathapasinghe</forenames>\n                </author>\n                <author>\n                    <keyname>Atzeni</keyname>\n                        <forenames>Italo</forenames>\n                </author>\n        </authors>\n        <title>Robust Near-Field Beam Focusing Under Imperfect Localization</title>\n            <categories>eess.SP</categories>\n            <comments>To be presented at the International Workshop on Smart Antennas (WSA) 2026</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The transition to 6G-and-beyond wireless systems with large-scale antenna arrays and high-frequency deployments significantly extends the near-field region, where channels exhibit a strong dependence on user location. While this enables location-based beam focusing as a low-overhead alternative to conventional channel estimation, its performance is highly sensitive to localization errors. In this paper, we study robust near-field beam focusing under imperfect user localization. We explicitly characterize the impact of localization errors on the line-of-sight-dominated channel by deriving a tractable uncertainty model via a first-order Taylor approximation, which captures the coupled effects of distance and angle in near-field propagation. Building on this model, we formulate a max-min signal-to-interference-plus-noise ratio optimization problem that guarantees performance under worst-case channel realizations induced by bounded localization errors. The resulting problem is reformulated into a feasibility problem using semidefinite relaxation. Numerical results demonstrate that the proposed robust design significantly improves the worst-user rate compared to non-robust beam focusing, particularly under high total transmit power levels and large localization error ranges.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "raw_sha256": "cf75b2c5c7bda25df41888bfdd89915aba816c8736063b3bf8ae506c4e2e4d84", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8fc49a0459bfccb6b33ddd88a45fbff858af1e9a69fe2efa8cdcf9e493960be7"}
+{"id": "source.frontier.arxiv-2608-18396", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18396&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.18396: LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:50.736323+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:50Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.18396\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.18396</identifier>\n        <datestamp>2026-08-20</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.18396</id>\n        <created>2026-08-18</created>\n            <updated>2026-08-20</updated>\n        <authors>\n                <author>\n                    <keyname>Ashtekar</keyname>\n                        <forenames>Amod</forenames>\n                </author>\n                <author>\n                    <keyname>Davis</keyname>\n                        <forenames>Dalton</forenames>\n                </author>\n                <author>\n                    <keyname>Lomboy</keyname>\n                        <forenames>Rafaela</forenames>\n                </author>\n                <author>\n                    <keyname>Ibrahim</keyname>\n                        <forenames>Omar</forenames>\n                </author>\n                <author>\n                    <keyname>Bandari</keyname>\n                        <forenames>Raj Sai Sohel</forenames>\n                </author>\n                <author>\n                    <keyname>Eltayeb</keyname>\n                        <forenames>Mohammed E.</forenames>\n                </author>\n        </authors>\n        <title>LiDAR-Derived Surface Priors for Multimodal Sensing-Assisted NLoS Beam Search in Indoor 60-GHz Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Highly directional 60-GHz Internet-of-Things (IoT) links can exploit naturally occurring indoor surfaces to sustain connectivity under blockage. Identifying viable non-line-of-sight (NLoS) paths, however, can require extensive RF beam training. This paper investigates whether LiDAR can reduce this search overhead by providing a surface-aware prior without assuming a direct mapping between optical return and mmWave reflection. The proposed framework uses LiDAR-derived geometry and return statistics to rank candidate propagation directions, while RF measurements remain responsible for final beam selection. The experimental validation is organized in three stages to separate descriptor robustness, cross-modal association, and beam-search performance. Controlled LiDAR measurements first quantify how geometric and radiometric surface descriptors vary with acquisition geometry. Matched LiDAR and 60-GHz measurements in an L-shaped corridor then determine whether these descriptors are associated with the measured surface-mediated RF response under a prescribed NLoS interaction. Finally, a separate room-scale campaign evaluates the resulting prior using exhaustive TX-RX beam maps without prescribing the underlying propagation mechanism. The measurements show that descriptor reliability depends on acquisition geometry and point-cloud representation, and that LiDAR and RF surface responses exhibit cross-modal association without supporting deterministic RF-power prediction. In the room experiment, local three-ring 3-D planarity retains a beam within 3 dB of exhaustive search at 74.5% of the measured locations while reducing RF beam-pair probing by 72% relative to exhaustive probing over the candidate search region. These results establish LiDAR-derived local surface structure as a communication-oriented prior for concentrating RF probing and reducing mmWave beam-search uncertainty.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "raw_sha256": "7602381c268da9f0d16cfe414a62f4b8789a227c7d8a385080ba49ffb5e4ba45", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d4151c1cd8d7b734411a6e8fb9b1afaaad82d85b850a991cf498733ec9f27cae"}
+{"id": "source.frontier.arxiv-2608-18060", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.18060&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.18060: Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:54.140653+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.18060\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.18060</identifier>\n        <datestamp>2026-08-19</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.18060</id>\n        <created>2026-08-18</created>\n            <updated>2026-08-19</updated>\n        <authors>\n                <author>\n                    <keyname>Hirsch</keyname>\n                        <forenames>Dylan</forenames>\n                </author>\n                <author>\n                    <keyname>Sharpless</keyname>\n                        <forenames>William</forenames>\n                </author>\n                <author>\n                    <keyname>Lee</keyname>\n                        <forenames>Donggun</forenames>\n                </author>\n                <author>\n                    <keyname>Herbert</keyname>\n                        <forenames>Sylvia</forenames>\n                </author>\n        </authors>\n        <title>Extending and Unifying the Fundamental Tasks of Hamilton-Jacobi Reachability Analysis</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In this work, we introduce the generalized reach-avoid (GRA) task, which both extends and unifies the canonical tasks of Hamilton-Jacobi Reachability (HJR). We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved with HJR. Moreover, the GRA formulation enables one to compute the value functions of certain composite tasks, including ones from timed temporal logic, by decomposing the value function of the composite task into value functions of GRA tasks. We additionally show that the GRA is also a natural primitive to consider from a PDE perspective, as it can be used to represent all sufficiently regular solutions of the HJ-PDE that is canonical to HJR. Collectively, the results in this work show the theoretical and practical utility of this task within the increasingly important framework of HJR.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "raw_sha256": "3bd09b57d48abf94111bd78f4d6a621b8a4e1317df857e2b2a43d0c095662c77", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "381ad4f5ed90b52db0ef1076ec22ecc5cb405cdc36ae53a76ca518ad96185590"}
+{"id": "source.frontier.arxiv-2608-16290", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.16290&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.16290: Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols", "source_kind": "primary", "retrieved_at": "2026-10-18T16:26:58.288760+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:26:58Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.16290\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.16290</identifier>\n        <datestamp>2026-08-18</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.16290</id>\n        <created>2026-08-17</created>\n            <updated>2026-08-18</updated>\n        <authors>\n                <author>\n                    <keyname>Hatami</keyname>\n                        <forenames>Mohammad</forenames>\n                </author>\n                <author>\n                    <keyname>Nguyen</keyname>\n                        <forenames>Nhan Thanh</forenames>\n                </author>\n                <author>\n                    <keyname>Juntti</keyname>\n                        <forenames>Markku</forenames>\n                </author>\n        </authors>\n        <title>Beamforming and Filter Design for Bistatic ISAC under Known and Unknown Transmit Symbols</title>\n            <categories>eess.SP</categories>\n            <comments>5 pages, 3 figures. Accepted for presentation at the IEEE SPAWC 2026 conference</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper investigates the joint design of beamforming and radar receive filters in a multiuser bistatic integrated sensing and communications (ISAC) system, aiming to maximize the minimum radar signal-to-interference-plus-noise ratio (SINR) under communications SINR and transmit power constraints. We consider two scenarios: transmitted signals are either known or unknown at the radar receiver. We develop tractable solutions to the resulting non-convex optimization problems in both cases. For the known-signal case, we derive closed-form radar receive filters and iteratively design beamforming using fractional programming (FP) and successive convex approximation (SCA). For the unknown case, we adopt an alternating optimization (AO) approach to jointly design the beamforming and receive filters. Numerical results demonstrate that, while both approaches achieve comparable performance under per-slot optimization, knowledge of the transmitted symbols provides significant gains in multi-slot processing via coherent integration. Moreover, the proposed ISAC designs perform close to the radar-only benchmark under moderate communication requirements.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "raw_sha256": "33f8e7df607f5d05496179f876265c14ae0b2fa3a8bf5ce4d9187580a91f1efb", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "7e0cf8545f9cfcd0a5236ce153cb038398e96e12f080c5271574d5bfa574843c"}
+{"id": "source.frontier.arxiv-2608-12037", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12037&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.12037: Clustered Randomized Smoothing for Stochastic Prediction Functions", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:03.007866+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:02Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12037\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12037</identifier>\n        <datestamp>2026-08-13</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12037</id>\n        <created>2026-08-12</created>\n            <updated>2026-08-13</updated>\n        <authors>\n                <author>\n                    <keyname>Figueiredo</keyname>\n                        <forenames>Eduardo</forenames>\n                </author>\n                <author>\n                    <keyname>Mathiesen</keyname>\n                        <forenames>Frederik</forenames>\n                </author>\n                <author>\n                    <keyname>Schumann</keyname>\n                        <forenames>Julian</forenames>\n                </author>\n                <author>\n                    <keyname>Kober</keyname>\n                        <forenames>Jens</forenames>\n                </author>\n                <author>\n                    <keyname>Zgonnikov</keyname>\n                        <forenames>Arkady</forenames>\n                </author>\n                <author>\n                    <keyname>Laurenti</keyname>\n                        <forenames>Luca</forenames>\n                </author>\n        </authors>\n        <title>Clustered Randomized Smoothing for Stochastic Prediction Functions</title>\n            <categories>cs.LG cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Modern stochastic predictors can model rich, multi-modal outcome distributions. However, this expressive power comes with challenges in ensuring robust predictions $-$ a critical requirement in safety-critical domains. Randomized smoothing is a leading technique for improving robustness, particularly against adversarial perturbations. Yet, in stochastic multi-modal regression settings, randomized smoothing often fails due to mode collapse, yielding averaged predictions that do not reflect the underlying distribution. To address this limitation, we propose clustered $α$-smoothing, a framework that (1) partitions noisy samples using an arbitrary clustering algorithm, (2) applies $α$-smoothing locally within each cluster, and (3) combines the resulting predictions into a mixture distribution. By interpreting the smoothing distribution as a mixture of $α$-smoothers, we derive a lower bound on the probability that the smoothed prediction lies within a union of compact regions corresponding to distinct modes. We empirically evaluate our framework on two benchmarks, demonstrating substantial improvements over state-of-the-art methods. In stochastic trajectory prediction on a driving simulator dataset, our approach achieves, on average, a $27\\%$ lower Wasserstein distance to the ground-truth distribution compared to $α$-smoothing. In quadrotor control, where modes correspond to distinct feasible paths to a target, our method reduces the collision rate by $81\\%$ relative to the state-of-the-art randomized smoothing.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "raw_sha256": "911104f486e38fb658feea2d45b0e717049a01bfa8698672698bdbd6a40c133c", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "50a15a0205cd8538d2c1ea22b026cec12efd0151758f60257372b8262390032a"}
+{"id": "source.frontier.arxiv-2608-11929", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11929&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.11929: Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:06.672757+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:06Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.11929\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.11929</identifier>\n        <datestamp>2026-08-13</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.11929</id>\n        <created>2026-08-12</created>\n            <updated>2026-08-13</updated>\n        <authors>\n                <author>\n                    <keyname>Salehi</keyname>\n                        <forenames>Amin</forenames>\n                </author>\n                <author>\n                    <keyname>Seppanen</keyname>\n                        <forenames>Janne</forenames>\n                </author>\n                <author>\n                    <keyname>Pourakbari-Kasmaei</keyname>\n                        <forenames>Mahdi</forenames>\n                </author>\n        </authors>\n        <title>Coordinated Dynamic Operation of Integrated Electrolyzer-Compressor Systems</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The increasing interaction between power and hydrogen sectors highlights the importance of coordinated operation of electrolyzers and electric-driven compressor stations (EDCSs). This becomes particularly of higher importance under transient disturbances. However, coordinated dynamic interactions of these coupled subsystems remain largely unexplored. This article addresses such gap by developing a dynamic model for an integrated electrolyzer-EDCS system and designing appropriate PID control schemes to address the potential disturbances affecting either component. To this end, linearized models of the electrolyzer and EDCS are first derived to enable systematic controller design. Then, two PID controllers, representing conservative and fast-tracking designs, are developed to coordinate the system response. The developed coordinated model is examined and verified under four different cases. The results demonstrate the effectiveness of the proposed model under disturbances from the compressor driver or the electrolyzer. Controlling the electrolyzer flow in response to EDCS disturbances coordinates system dynamics and mitigates undesirable transient fluctuations. Conversely, under electrolyzer disturbances, regulating the EDCS torque eliminates inconsistent responses in pressure, flow, and rotational speed, while preventing hazardous transient undershoots and overshoots. Overall, the proposed framework guarantees transient stability and operational reliability of the integrated electrolyzer-EDCS system.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "raw_sha256": "9b8ebb879e99503d05073dec3a2b309eea5741fcc20a5b2b0e85ae75a7077e5c", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d3fc2bfc9fe13a99115545c46da27cbfb751efa62ba89ba091e18f8cc85b9c7a"}
+{"id": "source.frontier.arxiv-2608-11175", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.11175&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.11175: Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:10.765600+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T03:31:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.11175\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.11175</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.11175</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Kelkar</keyname>\n                        <forenames>Sachin Sunil</forenames>\n                </author>\n                <author>\n                    <keyname>Dokania</keyname>\n                        <forenames>Tanmay</forenames>\n                </author>\n                <author>\n                    <keyname>Nakka</keyname>\n                        <forenames>Yashwanth Kumar</forenames>\n                </author>\n        </authors>\n        <title>Risk-Aware Kinodynamic Motion Planning Under Uncertainty For Safe Navigation on Planetary Environments</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <comments>3 pages, 4 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>For autonomous space exploration, robotic agents need to perform motion planning in which environmental interactions may be unknown. Learning these interactions, such as terrain mechanics for wheeled robots, can introduce uncertainties that lead to risky motion plans and potentially hazardous operations or mission failures. Moreover, uncertainties induced by perception-based systems can exacerbate the problem of safe motion planning. In this letter, we address the problem of performing cost-optimal kinodynamic motion planning with risk awareness. We approach this in two steps. First, a sampling-based planner (AO-RRT) generates a dynamically feasible, risk-aware, and asymptotically cost-optimal trajectory. Second, we formulate motion planning as a nonlinear optimization problem and solve it using sequential convex programming (SCP), using the AO-RRT trajectory as an initial solution. By quantifying risk using conditional value-at-risk (CVaR), we demonstrate a reduction in risk by over $\\sim$97\\% across trajectories in simulation and hardware experiments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "raw_sha256": "9dc25b79eb796bc262f020fcf2d5548645fad1bf1c4bd54d63d1b13886398cc7", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "ce92481ccb7e8f052024b3465291900a15781e084bae3e497e34b645352f768f"}
+{"id": "source.frontier.arxiv-2608-10825", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10825&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.10825: Cross-modal topology decodes battery faults from sparse voltage snapshots", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:15.336482+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:15Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.10825\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.10825</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.10825</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Jinwen</forenames>\n                </author>\n                <author>\n                    <keyname>Che</keyname>\n                        <forenames>Yunhong</forenames>\n                </author>\n                <author>\n                    <keyname>Onori</keyname>\n                        <forenames>Simona</forenames>\n                </author>\n                <author>\n                    <keyname>Li</keyname>\n                        <forenames>Weihan</forenames>\n                </author>\n                <author>\n                    <keyname>Hu</keyname>\n                        <forenames>Xiaosong</forenames>\n                </author>\n        </authors>\n        <title>Cross-modal topology decodes battery faults from sparse voltage snapshots</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>33 pages, 12 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Battery safety remains the primary bottleneck for mass electric vehicle (EV) adoption, yet field monitoring is hamstrung by a fundamental asymmetry: complex electrochemical faults must be diagnosed via sparse, low-frequency voltage measurements. Existing methods struggle to resolve the signal ambiguity between overlapping fault modes without hardware upgrades. Here, we demonstrate that these distinct fault fingerprints are not lost, but topologically folded within voltage snapshots. We introduce DeFault, a cross-modal diagnostic framework that mathematically unfolds one-dimensional voltage sequences into multi-dimensional phase-space topologies. DeFault employs a bidirectional cross-attention mechanism that acts as an autonomous, physics-aligned filter, explicitly decoding compounded fault modes that remain fundamentally invisible to sequence-based methods. Validated on a field dataset of 16.4 million data records from 99 in-service EVs, our method achieves an average accuracy of 0.96 and an F1 score of 0.84 for four fault types using only 500-second snapshots (spanning &lt;100 mV). This work proves that high-fidelity, interpretable electrochemical diagnosis is achievable on legacy fleets without new sensors, providing a scalable solution for the battery safety crisis.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "raw_sha256": "cfe642821f64a92305f655e8e8587754cdea5843b5f2bd3a85fa2bb3c8f6edab", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "50bbbf85713d9a89188634cdc860c44d58300edc5853896cc13918a3de91b9ec"}
+{"id": "source.frontier.arxiv-2608-08151", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08151&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.08151: Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:19.947057+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:19Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.08151\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.08151</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.08151</id>\n        <created>2026-08-11</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Rommel</keyname>\n                        <forenames>Quentin</forenames>\n                </author>\n                <author>\n                    <keyname>Fotiadis</keyname>\n                        <forenames>Filippos</forenames>\n                </author>\n                <author>\n                    <keyname>Armstrong</keyname>\n                        <forenames>Cade</forenames>\n                </author>\n                <author>\n                    <keyname>Peterson</keyname>\n                        <forenames>Luke</forenames>\n                </author>\n                <author>\n                    <keyname>Topcu</keyname>\n                        <forenames>Ufuk</forenames>\n                </author>\n        </authors>\n        <title>Cislunar Pursuit-Evasion Game on Periodic and Quasi-Periodic Orbits</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>Initial submission to JCGD</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Cislunar spacecraft operate in nonlinear and unstable environments that make defensive maneuver planning difficult. We formulate cislunar spacecraft pursuit and evasion as a zero-sum differential game in the circular restricted three-body problem. Each spacecraft controls its thrust and reference orbit phase, enabling motion along periodic orbits and across quasi-periodic tori while remaining near the reference. We solve the game using a constrained discrete-time differential dynamic programming method that enforces hard input constraints. We propose a shared time regularization to synchronize both spacecraft while refining the discretization near close lunar passages. Numerical results on periodic and quasi-periodic orbits show that phase control improves maneuvering flexibility while limiting departure from the reference orbit. The discrete-time method also provides a large computational advantage over a continuous-time formulation. Comparisons between quasi-halo and quasi-near-rectilinear halo orbits show that close lunar passages create larger escape opportunities but also increase the sensitivity of the encounter. These results show that reference orbit geometry is an important part of defensive cislunar mission design.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "raw_sha256": "be188b160f2aae74e3f0a4cacd6b4263bb6ef10cf383a0ef6f8887f577962121", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "f9f2e020ba217b91719e842cb3e383a7060311d4841445bdb64409e0f988a162"}
+{"id": "source.frontier.arxiv-2608-10254", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.10254&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.10254: A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:23.741882+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.10254\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.10254</identifier>\n        <datestamp>2026-08-12</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:LO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.10254</id>\n        <created>2026-08-10</created>\n            <updated>2026-08-12</updated>\n        <authors>\n                <author>\n                    <keyname>Peper</keyname>\n                        <forenames>Jordan</forenames>\n                </author>\n                <author>\n                    <keyname>Kapadia</keyname>\n                        <forenames>Krish</forenames>\n                </author>\n                <author>\n                    <keyname>Gast</keyname>\n                        <forenames>James</forenames>\n                </author>\n                <author>\n                    <keyname>Howes</keyname>\n                        <forenames>Ethan</forenames>\n                </author>\n                <author>\n                    <keyname>Ruchkin</keyname>\n                        <forenames>Ivan</forenames>\n                </author>\n        </authors>\n        <title>A Pragmatic Guide to Building Conservative Discrete Abstractions of Cyber-Physical Systems</title>\n            <categories>eess.SY cs.LO cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Symbolic model checking is an effective approach for verifying semantically rich temporal-logic properties of cyber-physical systems, but it hinges on discretizing continuous-state dynamics into a finite-state abstraction. To transfer verification guarantees from the abstract model to the concrete CPS, the abstraction must conservatively approximate the concrete state space and behaviors. Hence, model-builders must maintain this soundness while balancing pessimism with tractability. However, they face several common pitfalls such as under-approximating the state space, under-approximating transitions, unsound pruning of &#34;degenerate&#34; behaviors, and improper specification lifting. This tutorial presents a pragmatic, conservative-by-construction workflow for building discrete abstractions of closed-loop dynamical systems. The workflow consists of four modular steps with interchangeable subroutines: (i) state-space partition and abstraction-function design, (ii) conservative transition construction via axis-aligned bounding boxes, polytopes, or sampling with PAC coverage certificates, (iii) mitigation of spurious transitions and self-loops using certified erasure and counterexample-guided abstraction refinement, and (iv) sound lifting of LTL specifications using may-must semantics. We demonstrate the end-to-end pipeline on three case studies and report how these design choices affect abstraction structure, runtime, and verification outcomes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "raw_sha256": "818436369b83209801efd7a58765577a9155b51d7a0a064d8f40e50ae8d81f61", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "76d3a6f0496f3b339ec9eb17bc481d233c6970f14f845ce870c1ccec40478e12"}
+{"id": "source.frontier.arxiv-2608-08599", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.08599&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.08599: Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:27.577789+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:27Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.08599\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.08599</identifier>\n        <datestamp>2026-08-11</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.08599</id>\n        <created>2026-08-09</created>\n            <updated>2026-08-11</updated>\n        <authors>\n                <author>\n                    <keyname>Fadakar</keyname>\n                        <forenames>Alireza</forenames>\n                </author>\n                <author>\n                    <keyname>Molisch</keyname>\n                        <forenames>Andreas F.</forenames>\n                </author>\n        </authors>\n        <title>Low-Complexity Channel Estimation for Reconfigurable Fluid Antenna System</title>\n            <categories>eess.SP</categories>\n            <comments>4 pages, 3 figures, Accepted for publication in the 2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</comments>\n            <journal-ref>2026 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Electromagnetically reconfigurable fluid antenna system (ER-FAS) provides additional electromagnetic (EM)-domain degrees of freedom by enabling dynamic control of per-element radiation patterns, thereby improving power efficiency in wireless communications. The effective exploitation of these capabilities, however, critically depends on accurate channel estimation, which has received limited attention in prior studies. This paper presents a low-complexity channel parameter estimation framework for downlink wideband systems that leverages available channel sparsity. A synthesis-based reconfigurability model is considered, where each antenna generates desired beampatterns using a finite set of EM basis functions. Based on this model, a joint optimization of digital and EM precoders is formulated with the objective of minimizing the Cramér-Rao lower bound of the channel parameters. Simulation results demonstrate that the proposed hybrid beamforming and estimation approach enables accurate recovery of channel parameters while maintaining low computational complexity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "raw_sha256": "6d679b76a6e9f291733e6e781a33166c2ca4aae8bf3f3f7a065279f75679819d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0f2fac90d046216dcc34a5f662ac80e57a4216926b70df4a9acb29242f8db306"}
+{"id": "source.frontier.arxiv-2608-12398", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12398&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.12398: A Hierarchical Energy-Based Model for Multimodal Cognition", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:32.097457+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:31Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12398\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12398</identifier>\n        <datestamp>2026-08-14</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12398</id>\n        <created>2026-08-08</created>\n            <updated>2026-08-14</updated>\n        <authors>\n                <author>\n                    <keyname>Varma</keyname>\n                        <forenames>Subir</forenames>\n                </author>\n        </authors>\n        <title>A Hierarchical Energy-Based Model for Multimodal Cognition</title>\n            <categories>q-bio.NC cs.AI</categories>\n            <comments>48 pages, 14 figures</comments>\n            <msc-class>I.2</msc-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose IM-LEPP (Integrated Multimodal Latent Energy-based Predictive Processing), a hierarchical, energy-based model of multimodal cognition that extends a previously proposed single-modality model (LEPP) to integrate vision and language. Following the view that generative neural networks are effective theories of cognitive dynamics, analogous to how statistical mechanics relates to thermodynamics, IM-LEPP models cognition as latent states flowing through learned energy landscapes rather than as an account of neural circuitry. The architecture is a hub-and-spoke hierarchy, grounded in the controlled semantic cognition framework of Lambon Ralph et al., in which predictive-coding pipelines for visual objects, scenes, and linguistic units converge on a shared amodal hub modeled on the anterior temporal lobe. Each pipeline&#39;s own prediction is conditioned by, rather than overwritten by, the current hub state, preserving pipeline-specific identity while letting every prediction reflect the full multimodal context. We show this architecture gives a mechanistic account of attentional phenomena such as inattentional blindness and Necker-cube bistability, and that its structure recovers or motivates independently established findings in psycholinguistics, including surprisal theory, the N400/P600 ERP components, and garden-path reanalysis, alongside a falsifiable contrast with transformer language models on trajectory-sensitivity in next-word prediction. We also discuss data-efficient language acquisition relative to LLMs, outline a semantic/episodic memory subsystem, situate the model against predictive coding, the free-energy principle, JEPA, and Hierarchical Temporal Memory, and propose concrete experimental predictions to test its central claims Key Words: predictive processing; predictive coding; energy-based models; diffusion models; effective theory; computational neuroscience.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "raw_sha256": "71da7872940aa2492fbafca05e7fabd0eb69d8dc7d1ed618b7b4f1114438db87", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "21516eb8c970f3dcf03bc13a23f8ecb9e0f452f780bd04061da3e6252af05571"}
+{"id": "source.frontier.arxiv-2608-07289", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.07289&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.07289: Synthesizing Voltage Ride-Through Controllers for Data Centers", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:36.613719+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.07289\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.07289</identifier>\n        <datestamp>2026-08-10</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:LO</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.07289</id>\n        <created>2026-08-07</created>\n            <updated>2026-08-10</updated>\n        <authors>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Wayne</forenames>\n                </author>\n                <author>\n                    <keyname>Bhatnagar</keyname>\n                        <forenames>Archit</forenames>\n                </author>\n                <author>\n                    <keyname>Miao</keyname>\n                        <forenames>Tongyuan</forenames>\n                </author>\n                <author>\n                    <keyname>Kalamkar</keyname>\n                        <forenames>Saniya</forenames>\n                </author>\n                <author>\n                    <keyname>Cui</keyname>\n                        <forenames>Wenqi</forenames>\n                </author>\n                <author>\n                    <keyname>Incer</keyname>\n                        <forenames>Inigo</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Ang</forenames>\n                </author>\n        </authors>\n        <title>Synthesizing Voltage Ride-Through Controllers for Data Centers</title>\n            <categories>eess.SY cs.DC cs.LO cs.SY</categories>\n            <comments>12 pages, 10 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Data centers are among the power grid&#39;s fastest-growing loads. Since data center servers are sensitive electronic components, they need to be protected against the grid&#39;s voltage disturbances during grid faults. While disconnecting from the grid achieves this, it can further destabilize the power system if many data centers trip at once. To address this emerging concern, voltage ride-through (VRT) grid codes have been proposed to standardize data center behavior. They require a data center to stay connected for a period of time through the disturbance, hold an active power floor, and recover its draw within a deadline upon restoration. However, systematically designing and certifying controllers that satisfy these coupled temporal and operational requirements remains challenging.\n  We propose SolVRT, a system that synthesizes a grid-code-compliant VRT controller for a given data center using formal methods. We develop a specification language that expresses a grid code in Signal Temporal Logic (STL) as the basis for formal reasoning. Our encoding algorithm takes the specification, along with a model of the data center&#39;s power topology, and translates the constraints into a controller synthesis problem. This step produces a correct-by-construction controller if a solution can be found, or a proof that no such controller exists. For the latter case, SolVRT provides a diagnostic step: it traces the facility&#39;s &#34;conflict frontier,&#34; isolates the conflicting clauses that led to non-compliance, and computes the smallest hardware or workload change that would enable compliance. We evaluate SolVRT through closed-loop simulations of a 200 MW data center connected to a 140-bus transmission system. The results demonstrate that SolVRT can synthesize compliant VRT controllers, certify infeasibility when compliance is unattainable, and identify targeted modifications that enable compliance.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "raw_sha256": "cd6cbba817ee4535fdce617ead1acd55493bf00ccbf4adf713adfd341466a4f3", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "cad64693d278323703086f94cbb36bd909d10943221ea60aba114a15cec7d661"}
+{"id": "source.frontier.arxiv-2608-05481", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05481&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.05481: From Local Learning to Global Prediction Through Layered Surprise Cascades", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:40.262634+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.05481\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.05481</identifier>\n        <datestamp>2026-08-07</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.05481</id>\n        <created>2026-08-06</created>\n            <updated>2026-08-07</updated>\n        <authors>\n                <author>\n                    <keyname>Smith</keyname>\n                        <forenames>Andrew L.</forenames>\n                </author>\n                <author>\n                    <keyname>Jiang</keyname>\n                        <forenames>Linxing Preston</forenames>\n                </author>\n                <author>\n                    <keyname>Eshraghian</keyname>\n                        <forenames>Jason K.</forenames>\n                </author>\n                <author>\n                    <keyname>Bull</keyname>\n                        <forenames>Matthew S.</forenames>\n                </author>\n                <author>\n                    <keyname>Recanatesi</keyname>\n                        <forenames>Stefano</forenames>\n                </author>\n        </authors>\n        <title>From Local Learning to Global Prediction Through Layered Surprise Cascades</title>\n            <categories>q-bio.NC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hierarchical predictive coding proposes a compelling hypothesis of brain computation, suggesting that the cortex builds layered predictions to minimize surprise. Yet most models rely on error-coding neurons or generative modeling of unclear biological plausibility. Here, we examine a biologically plausible framework in which the functional goals of predictive coding emerge from local contrastive learning and simple activity cancellation. Building on recent machine learning advances, we present a recurrent variant of the Forward-Forward (FF) algorithm with an inverted objective that increases activity for negative data. This setup yields predictive representations across layers, capturing hallmark features of cortical computation such as top-down modulation and surprise signaling. Our results suggest that key principles of predictive coding can emerge from simple, local learning rules, offering a new bridge between neuroscience and machine learning.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "raw_sha256": "a1e1d505eb904b64736f21f5dcb1509e97d3c101fc25ffef8ad4a32517ebac8c", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c0d0a819d9dfe4180765db007054278cba2695c2bcea5df8f05249894bf49ef3"}
+{"id": "source.frontier.arxiv-2608-05348", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.05348&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.05348: TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:44.117017+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:43Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.05348\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.05348</identifier>\n        <datestamp>2026-08-07</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.05348</id>\n        <created>2026-08-05</created>\n            <updated>2026-08-07</updated>\n        <authors>\n                <author>\n                    <keyname>Wang</keyname>\n                        <forenames>Lin</forenames>\n                </author>\n                <author>\n                    <keyname>Hou</keyname>\n                        <forenames>I-Hong</forenames>\n                </author>\n        </authors>\n        <title>TSDM: A Scheduling Policy for Joint Throughput-AoI Optimization in Multichannel Wireless Networks</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Optimizing for both low Age of Information (AoI) and high throughput is critical for remote sensing applications that rely on multichannel wireless networks. However, jointly optimizing these two metrics is an analytically challenging problem, particularly in systems with heterogeneous and unreliable channels. To address this challenge, we propose TSDM, a Two-Stage Deficit Matching scheduling framework. TSDM is based on a second-order approach that characterizes the performance of each data flow by its mean and temporal variance. In the first stage, TSDM translates the high-level utility maximization objective into a concrete set of target mean and temporal variance statistics for transmissions over each node-channel pair. In the second stage, a low-complexity Weighted Matching Deficit (WMD) rule performs real-time channel assignment. We theoretically prove that TSDM achieves the desired mean and temporal variance for each flow. Furthermore, we conduct extensive simulations on two open joint throughput-AoI optimization problems. In both cases, TSDM significantly outperforms existing scheduling policies.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "raw_sha256": "54f9cf07ff44da82729d493d1fdfaaffcc2205f9df432d7fdde61de540e0c0d4", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b4ee9db50a622f536dfb0fe55b9aeba855ac3dd606f1a6127834cf1471a99056"}
+{"id": "source.frontier.arxiv-2608-12393", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.12393&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.12393: Metacognitive Skill Learning: A Computational Account", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:48.110806+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:47Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.12393\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.12393</identifier>\n        <datestamp>2026-08-14</datestamp>\n            <setSpec>q-bio:q-bio:NC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.12393</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-14</updated>\n        <authors>\n                <author>\n                    <keyname>Conway-Smith</keyname>\n                        <forenames>Brendan</forenames>\n                </author>\n        </authors>\n        <title>Metacognitive Skill Learning: A Computational Account</title>\n            <categories>q-bio.NC</categories>\n            <comments>PhD thesis. Carleton University 2026. Final defended version. https://www.brendanconwaysmith.com/</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This dissertation presents the first formal theory of metacognitive skill learning. Metacognition, the capacity to monitor and control one&#39;s own cognitive processes, has been widely studied, yet the field still lacks a theoretical framework explaining how metacognitive abilities are learned. This gap limits progress in both theory and application across fields such as cognitive science, education, therapeutic practice, and artificial intelligence. The account developed here builds on classic models of skill acquisition from perceptual-motor and cognitive domains. It proposes that metacognitive skill develops primarily through proceduralization, whereby explicit, effortful metacognitive processes are transformed through practice into implicit, automatic routines. The explanatory power of this theory is shown by its ability to unify diverse phenomena, including attentional training, emotion regulation, the metacognitive threshold, and detached mindfulness. The result is an integrated, mechanistic account of metacognitive skill that organizes existing findings, generates testable predictions, informs the design of AI, and supports the strengthening of metacognitive skill in everyday life.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "raw_sha256": "b7919c8a8ebd14d7c5c1385af41873d81742b6c129958b3bc8842a16e7f25249", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "bba06c42f31e7d58f59f4297f10d2b3e9d2cbb6bbaa2026791401736f2df0892"}
+{"id": "source.frontier.arxiv-2608-04227", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04227&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.04227: Random features for Grassmannian kernel approximation with bounded rank-one projections", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:52.159620+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.04227\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.04227</identifier>\n        <datestamp>2026-08-06</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.04227</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-06</updated>\n        <authors>\n                <author>\n                    <keyname>Delogne</keyname>\n                        <forenames>Rémi</forenames>\n                </author>\n                <author>\n                    <keyname>Jacques</keyname>\n                        <forenames>Laurent</forenames>\n                </author>\n        </authors>\n        <title>Random features for Grassmannian kernel approximation with bounded rank-one projections</title>\n            <categories>cs.LG eess.SP</categories>\n            <comments>33 pages, 6 figures, J2C certification</comments>\n            <journal-ref>Transactions on Machine Learning Research, July 2026</journal-ref>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions.\n  We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "raw_sha256": "abc92b34b4dda075bcba02f34ec143be2d6decf393f610d6b48c1600cb5526cb", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "12c56e4ed5a547ca83d7774a8fd36f61b4971716a426afbce94894af3029bc6e"}
+{"id": "source.frontier.arxiv-2608-04133", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.04133&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.04133: Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing", "source_kind": "primary", "retrieved_at": "2026-10-18T16:27:56.250227+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:27:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.04133\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.04133</identifier>\n        <datestamp>2026-08-06</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.04133</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-06</updated>\n        <authors>\n                <author>\n                    <keyname>Gkekas</keyname>\n                        <forenames>Angelos</forenames>\n                </author>\n                <author>\n                    <keyname>Papadopoulos</keyname>\n                        <forenames>Alexandros I.</forenames>\n                </author>\n                <author>\n                    <keyname>Pantazopoulos</keyname>\n                        <forenames>Petros Andreas</forenames>\n                </author>\n                <author>\n                    <keyname>Lalas</keyname>\n                        <forenames>Antonios</forenames>\n                </author>\n                <author>\n                    <keyname>Votis</keyname>\n                        <forenames>Konstantinos</forenames>\n                </author>\n                <author>\n                    <keyname>Liaskos</keyname>\n                        <forenames>Christos</forenames>\n                </author>\n        </authors>\n        <title>Geometry-Informed Optimization of Binary RIS Configurations for Communication and Sensing</title>\n            <categories>cs.IT eess.SP math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Practical Reconfigurable Intelligent Surfaces (RISs) often support only a small number of phase states, making their configuration inherently discrete. For a 1-bit RIS with $N$ elements, direct optimization requires searching among $2^N$ binary configurations. This work shows that this exponential configuration space is not unstructured. By reformulating 1-bit RIS optimization as the maximization of the norm of a signed sum of channel-dependent vectors, we prove that every globally optimal configuration must be induced by the signs of their projections onto a common direction. This geometric characterization restricts the class of configurations that can contain global optima and leads to different algorithmic consequences depending on the signal-space dimension. For general Multiple-Input-Multiple-Output (MIMO) systems, we develop a geometry-informed sampling method that evaluates only structurally admissible configurations. For Single-Input-Single-Output (SISO) systems, the same principle reduces to a two-dimensional angular partition, allowing the complete candidate set to be characterized and the global optimum to be recovered through polynomial-time enumeration, by evaluating at most $N+1$ out of the $2^N$ configurations. Finally, we apply the same binary optimization principle to an Integrated Sensing and Communication (ISAC) scenario, where communication enhancement and target localization reduce to the same underlying geometric problem. The proposed framework therefore provides a unified approach for exploiting the structure of practical 1-bit RIS configurations across communication and sensing functionalities.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "raw_sha256": "c8a2713e258b1fdfd47dac67de419f4b68a09dadfdf5eae7bbd36b027a4e80fb", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "454017d7ee487789b0ab32c5f4aae496537f4827f6b260df8be27d4f92ecbd03"}
+{"id": "source.frontier.arxiv-2608-03967", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.03967&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.03967: Information-Geometric Forward Policy Training in GFlowNets", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:02.666601+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:00Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.03967\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.03967</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>stat:stat:ML</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.03967</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Raykov</keyname>\n                        <forenames>Yordan</forenames>\n                </author>\n                <author>\n                    <keyname>Veiga</keyname>\n                        <forenames>Rodrigo</forenames>\n                </author>\n        </authors>\n        <title>Information-Geometric Forward Policy Training in GFlowNets</title>\n            <categories>stat.ML cs.LG</categories>\n            <comments>13 pages + appendix</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density specified through a reward. In this work, we formulate forward-policy training in GFlowNets through the information geometry of the induced trajectory sampler. Treating the forward policy as an induced trajectory sampler, we show that its intrinsic first-order geometry is given by the Fisher-Rao metric of the trajectory family, and that the associated natural gradient provides the canonical local update whenever the corresponding Fisher information is computable or accurately approximable. We derive an exact decomposition of the trajectory Fisher into per-step conditional second moments, which clarifies when temporal score interactions vanish and when dense couplings remain under shared parameterisation. This leads to three computational regimes: settings with tractable exact Fisher information, settings where Monte Carlo estimators of the expected Fisher are sufficient, and structure-exploitable settings in which target locality or factorisation yields accurate approximations of the Fisher expectation. In the latter case, graphical-model tools such as exact marginalisation, separator methods, and belief propagation provide principled surrogates for natural-gradient updates. The resulting framework turns target structure into optimisation geometry and yields a tractable route to structure-aware forward-policy training in GFlowNets. We illustrate the framework empirically through examples comparing convergence and exploration behaviour under Riemannian and Euclidean optimisation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "raw_sha256": "bf2d4c6028cef0628315d081c3ed26a9aed576723517a67724cd2af11c4cdf55", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "e5e3c30f30acdf223e9e91c52ba0acaa0b727316d5aa4f5d2e2b137bc1fe393d"}
+{"id": "source.frontier.arxiv-2608-02978", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02978&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.02978: Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:10.661819+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:10Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02978\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02978</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02978</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Salimi</keyname>\n                        <forenames>Arastoo H</forenames>\n                </author>\n                <author>\n                    <keyname>Nazaripouya</keyname>\n                        <forenames>Hamidreza</forenames>\n                </author>\n        </authors>\n        <title>Enhancing Operational Grid Resilience Against Wildfires Under Decision-Dependent Uncertainties</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper proposes a new automated decision-making framework to enhance the resilience of electrical systems against wildfires by applying operational strategies that account for decision-dependent uncertainty (DDU). The proposed framework incorporates both preventive and corrective measures, enabling adaptive and automated decision-making throughout the course of evolving wildfire scenarios. First, a baseline multistage optimization model is presented as a foundation to support wildfire-driven operational decision-making. The model then incorporates DDU, wherein Public Safety Power Shutoff (PSPS) decisions made in earlier stages influence the probabilities and parameters of future wildfire scenarios. To efficiently solve the resulting complex optimization problem, a mathematical decomposition algorithm is employed. The effectiveness of the proposed approach is demonstrated through case studies on the IEEE 30-bus system. Simulation results confirm that incorporating the impact of DDU into the optimization process provides more realistic, and operationally resilient solutions in the face of evolving wildfire threats.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "raw_sha256": "d081216695b1012c430c9b8241fac4e9368fffc0bc45e80be84df06b95e9a16f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "d7d3e2d038d8345ecf3bf1daa0f8fbde0069f10f36b70b62160abdc41c05dcf2"}
+{"id": "source.frontier.arxiv-2608-02976", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02976&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.02976: Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:14.377224+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:14Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02976\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02976</identifier>\n        <datestamp>2026-08-05</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02976</id>\n        <created>2026-08-04</created>\n            <updated>2026-08-05</updated>\n        <authors>\n                <author>\n                    <keyname>Salimi</keyname>\n                        <forenames>Arastoo H</forenames>\n                </author>\n                <author>\n                    <keyname>Dehghani</keyname>\n                        <forenames>Majid</forenames>\n                </author>\n                <author>\n                    <keyname>Nazaripouya</keyname>\n                        <forenames>Hamidreza</forenames>\n                </author>\n        </authors>\n        <title>Sequential Operational Decision-Making for Power System Resilience Under Evolving Wildfires</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper proposes a novel automated decision-support framework aimed at enhancing the resilience of power systems and operational resilience against wildfires by formulating the decision-making process as a stochastic multi-stage programming during a progressive wildfire. The paper develops a framework that takes into account both preventive and corrective actions, enabling automated and adaptive decisions based on potential scenarios over the course of a wildfire&#39;s progression. This approach considers the evolving nature of the wildfire threat and seeks to optimize the response strategies accordingly throughout its duration. The objective is to minimize wildfire risk and operational costs while reducing load curtailment. The framework accounts for potential contingencies caused by progressive wildfires. A novel algorithm is proposed to construct a decision tree based on wildfire progression and system geographical information. Additionally, a novel stochastic dual dynamic programming approach is deployed to solve the proposed optimization problem, achieving a global optimum for the framework. The effectiveness of the proposed method is demonstrated on the IEEE 30-bus system under various wildfire impact scenarios and is then applied to the IEEE 300-bus system to illustrate the scalability of the proposed approach. The results highlight the advantages of the proposed automated framework over a single-stage operational optimization strategy in enhancing power grid resilience under wildfire conditions.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "raw_sha256": "09881a5c760087464a057e71d19ae39c6ccfac75b13739c3e88dd6ca9062c0f1", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "76a4c960c9d034d7a8ebffc70d53cbaacd837a1fcb121e93aa2aee1999c69106"}
+{"id": "source.frontier.arxiv-2608-02244", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02244&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.02244: Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:18.166437+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:18Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02244\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02244</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>cs:cs:DC</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02244</id>\n        <created>2026-08-03</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Yao</keyname>\n                        <forenames>Dayi</forenames>\n                </author>\n                <author>\n                    <keyname>Zhou</keyname>\n                        <forenames>Zijie</forenames>\n                </author>\n        </authors>\n        <title>Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling</title>\n            <categories>cs.DC cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper studies a resource-allocation inefficiency in batched large language model (LLM) serving: heterogeneous requests that share a decode batch impose max-driven computational costs on one another. Because the wall-clock cost of a batch step is largely governed by the largest active KV-cache footprint, a short request co-batched with a long request can experience latency and GPU-resource consumption disproportionate to its own token workload. We formalize this phenomenon as a resource-fair scheduling problem. We develop a mathematical scheduling model that connects within-batch resource fairness to system throughput. The proposed fairness constraint bounds the disparity in decode progress, equivalently KV-cache footprint, among co-batched requests. Based on this model, we design the Insert-Short-Jobs-with-Limit (ISJL) algorithm, a parameterized hybrid batching policy. We prove that ISJL achieves a global competitive-ratio lower bound of $3/4$. We further examine the profit implications of resource-fair scheduling under the token-metered pricing convention used by commercial LLM APIs. Numerical experiments show that ISJL occupies a favorable middle ground between FCFS, which has large batching externalities, and LJF, which is cost-aligned but sacrifices batching flexibility. Thus, ISJL provides a bi-criterion scheduling policy: it maintains high throughput while aligning max-driven batch cost with token-metered revenue.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "raw_sha256": "c44d7ed3aab9db7dca891523887ebbdaa1ee5a58d65b8e4b964a459279b64c65", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "18ffd7de2061718decbc98380d52f658f86583c599568e5d70448d8989897725"}
+{"id": "source.frontier.arxiv-2608-02079", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.02079&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.02079: TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:21.610496+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:21Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.02079\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.02079</identifier>\n        <datestamp>2026-08-11</datestamp>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.02079</id>\n        <created>2026-08-03</created>\n            <updated>2026-08-11</updated>\n        <authors>\n                <author>\n                    <keyname>Şanlan</keyname>\n                        <forenames>Abdülbaki</forenames>\n                </author>\n                <author>\n                    <keyname>Altunkaya</keyname>\n                        <forenames>Ege C.</forenames>\n                </author>\n                <author>\n                    <keyname>Bağci</keyname>\n                        <forenames>Hasan T.</forenames>\n                </author>\n                <author>\n                    <keyname>Koyuncu</keyname>\n                        <forenames>Emre</forenames>\n                </author>\n                <author>\n                    <keyname>Özkol</keyname>\n                        <forenames>İbrahim</forenames>\n                </author>\n        </authors>\n        <title>TANGO-VIO: Triangulation-Aware Navigation with Guaranteed Feature-Observability for Visual-Inertial Odometry</title>\n            <categories>cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In vision-aided navigation and visual-inertial odometry, the quality of triangulated three-dimensional feature positions is a fundamental prerequisite for state estimation accuracy. Triangulation becomes ill-conditioned or even impossible when a camera undergoes pure rotation without translation, or when the observed bearing vectors provide insufficient parallax. Even though visual-inertial odometry has been extensively studied, the active maintenance of feature-observability during navigation has not been sufficiently addressed in the literature. To address this gap, this study presents TANGO-VIO, a triangulation-aware navigation framework that embeds a log-determinant metric of the feature-wise stacked-bearing matrix into a control barrier function. In this proposed method, the observability guarantee is established in the feature-geometric sense by enforcing a lower bound on the aggregate triangulation-information metric through a nominal-direction-weighted minimum-deviation velocity correction. The proposed architecture is evaluated through software-inthe- loop simulations and real flight experiments. The results show improved triangulation conditioning under low-parallax motion, while the flight response closely reproduces the corresponding simulation behavior and confirms the practical realizability of the proposed safety filter. Supplementary materials are available on the project webpage.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "raw_sha256": "8286c0ddec949ea176f62210d626207bad35ae8c9d8feac05811a57b3d99152e", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "16a7b46f7509b0030c1675b190d0c981b9870bc6590bfd0df2da53c007f208be"}
+{"id": "source.frontier.arxiv-2608-01220", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.01220&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.01220: Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:25.245394+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:25Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.01220\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.01220</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>eess:eess:SP</setSpec>\n            <setSpec>math:math:OC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.01220</id>\n        <created>2026-08-02</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Doostmohammadian</keyname>\n                        <forenames>Mohammadreza</forenames>\n                </author>\n                <author>\n                    <keyname>Ghods</keyname>\n                        <forenames>Amir Ahmad</forenames>\n                </author>\n                <author>\n                    <keyname>Aghasi</keyname>\n                        <forenames>Alireza</forenames>\n                </author>\n                <author>\n                    <keyname>Gabidullina</keyname>\n                        <forenames>Zulfiya R.</forenames>\n                </author>\n                <author>\n                    <keyname>Rabiee</keyname>\n                        <forenames>Hamid R.</forenames>\n                </author>\n        </authors>\n        <title>Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap</title>\n            <categories>eess.SY cs.LG cs.SY eess.SP math.OC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks. Recently, non-Lipschitz continuous optimization algorithms have been proposed to improve the slow conver-gence rate of the existing linear solutions. The use of signum-based functions is previ-ously considered in consensus and control literature to reach fast convergence in the prescribed time and also to provide robust algorithms to noisy/outlier data. However, as shown in this work, these algorithms lead to an optimality gap and steady-state re-sidual of the objective function in discrete-time setup. This motivates us to investigate the distributed optimization and ML algorithms in terms of trade-off between conver-gence rate and optimality gap. In this direction, we specifically consider the distributed regression problem and check its convergence rate by applying both linear and non-Lipschitz signum-based functions. We check our distributed regression approach by extensive simulations. Our results show that although adopting signum-based func-tions may give faster convergence, it results in large optimality gaps. The findings pre-sented in this paper may contribute to and advance the ongoing discourse of similar distributed algorithms, e.g., for distributed constrained optimization and distributed estimation.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "raw_sha256": "01044269106c10003973a0837877cd25b89d8dd346853b9de1fb7fdd7dad3268", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8a5847156c804e66161e49441ad4848aa9ba3ac9a1945b06480265e574877950"}
+{"id": "source.frontier.arxiv-2608-00959", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2608.00959&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2608.00959: MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:29.260496+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:29Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2608.00959\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2608.00959</identifier>\n        <datestamp>2026-08-04</datestamp>\n            <setSpec>cs:cs:GT</setSpec>\n            <setSpec>cs:cs:RO</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2608.00959</id>\n        <created>2026-08-02</created>\n            <updated>2026-08-04</updated>\n        <authors>\n                <author>\n                    <keyname>Fridovich-Keil</keyname>\n                        <forenames>David</forenames>\n                </author>\n        </authors>\n        <title>MixedComplementarityProblems.jl: A Fast, Batched, Open-Source Interior Point Solver for Mixed Complementarity Problems</title>\n            <categories>cs.GT cs.RO cs.SY eess.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Mixed complementarity problems (MCPs) arise as the first-order optimality conditions of nonlinear programs and noncooperative games, and provide a natural formulation for multi-agent trajectory optimization problems that appear throughout robotics. The dominant solver for problems of this form is PATH, which offers strong performance on robotics problems but remains closed-source. We present MixedComplementarityProblems.jl, an open-source, pure Julia implementation of an interior point method for parametric MCPs that: (i) matches PATH&#39;s reliability on standard benchmarks, (ii) natively supports batched, parallel processing of many parameter instances, either across CPU threads or on an NVIDIA GPU, and (iii) supports efficient automatic differentiation of solutions with respect to problem parameters. On a multi-agent lane-change trajectory game representative of robotics planning problems, our CPU-multithreaded batched solver clears a batch of parametric instances ~100x faster than sequential calls to PATH. A GPU backend, running the same solver implementation unmodified, also clears these batches far faster than PATH, but does not outperform the multithreaded CPU on this problem; the GPU pulls ahead only once each per-instance KKT system grows large, and we characterize this regime dependence. We describe the solver&#39;s interior point formulation, the abstraction that lets a single solver implementation run unmodified across dense, batched-sparse, and single-large linear-algebra backends, and report benchmarks against PATH on both randomly generated quadratic programs and trajectory games.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "raw_sha256": "7972b1b4a7cbbb3c5d82bb5194a5a48b2b4406e36634b850d88f9d03c76037cc", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "97cc30316000aa3001aef5c3513d2da376cb75f3d58416e4f73d6e9533d91b67"}
+{"id": "source.frontier.arxiv-2607-17248", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.17248&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.17248: Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:32.871311+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:32Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.17248\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.17248</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.17248</id>\n        <created>2026-07-31</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Atef</keyname>\n                        <forenames>Mohamed</forenames>\n                </author>\n                <author>\n                    <keyname>Alahakoon</keyname>\n                        <forenames>Sanath</forenames>\n                </author>\n                <author>\n                    <keyname>Mumtahina</keyname>\n                        <forenames>Umme</forenames>\n                </author>\n                <author>\n                    <keyname>Wolfs</keyname>\n                        <forenames>Peter</forenames>\n                </author>\n                <author>\n                    <keyname>Khatib</keyname>\n                        <forenames>Tamer</forenames>\n                </author>\n                <author>\n                    <keyname>Uddin</keyname>\n                        <forenames>Moslem</forenames>\n                </author>\n        </authors>\n        <title>Feasibility-Aware Energy Management of a Hydrogen-Enabled Community Microgrid: A Proof-of-Concept Study</title>\n            <categories>eess.SY cs.SY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Hydrogen-enabled community microgrids require coordinated control of intermittent renewable generation and coupled battery and hydrogen storage. This paper presents a feasibility-aware proximal policy optimization (PPO) energy management system for a grid-connected microgrid comprising photovoltaic and wind generation, battery storage, an electrolyzer, a hydrogen tank, a fuel cell, and diesel backup. Raw continuous actions are projected onto the feasible operating set before evaluating the hourly power balance, ensuring operationally valid dispatch.\n  The proof-of-concept study uses 8,760 hourly observations for a 1,000-household community in Rockhampton, Australia. The same annual chronology and one random seed were used for training and evaluation. Under a 1 percent independent hourly grid outage probability, the system achieved an annual net operating cash balance of AUD 195,690.67, load satisfaction of 99.77 percent, and a gross renewable share of 91.2 percent. After removing duplicated hydrogen electricity emissions, annual emissions were 1.342 kt CO2, equivalent to 0.328 kg CO2 per kWh of served demand and 0.087 kg CO2 per kWh of export-inclusive delivered energy.\n  At a 5 percent outage probability, the cash balance decreased to AUD 169,892.21 and load satisfaction fell to 98.79 percent. Battery discharge and diesel generation increased more than fuel cell output. The results demonstrate feasible dispatch for the studied chronology, but broader validation requires unseen testing, multiple random seeds, benchmark controllers, export limits, and sustained outage scenarios.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "raw_sha256": "634f6f1ea6a9ee0f4b0c9762365ef4b5b31f3ea083845f214b01393b731ce029", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "c527ade5d494f4c5e230ae2b75e5230a09b72f6df1b8a2928c21e9bd0fe6dcab"}
+{"id": "source.frontier.arxiv-2607-14144", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.14144&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.14144: The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:36.479246+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:36Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.14144\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.14144</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.14144</id>\n        <created>2026-07-31</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Wenhui</forenames>\n                </author>\n                <author>\n                    <keyname>Chen</keyname>\n                        <forenames>Jianlin</forenames>\n                </author>\n                <author>\n                    <keyname>Lin</keyname>\n                        <forenames>Ziyao</forenames>\n                </author>\n                <author>\n                    <keyname>Vong</keyname>\n                        <forenames>Chi Man</forenames>\n                </author>\n        </authors>\n        <title>The Capability Convergence Hypothesis: Capability from Access Structure, Not Scale</title>\n            <categories>cs.AI cs.IT math.IT</categories>\n            <comments>43 pages, 16 figures. v2: title now names the hypothesis (CCH); postscript on two post-registration frontier releases (Kimi-K3, Qwen3.8-Max) with a registered forward prediction; new citations and consistency fixes. Registered census statistics and experimental results unchanged. Code and data: https://github.com/wenhui-ml/Capability-Convergence-Hypothesis (DOI: 10.5281/zenodo.21714418)</comments>\n            <acm-class>None</acm-class>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>The Platonic Representation Hypothesis (PRH) holds that as models scale, representations of heterogeneous networks converge toward a shared model of reality. We propose its sequel and boundary, the Capability Convergence Hypothesis (CCH): under a fixed per-token inference budget, representational convergence does not entail capability convergence. Capability instead converges toward a class, the access-complete hybrid: any architecture holding both a compressive O(1)-state channel and a scalable verbatim-index channel. We anchor it on a witness task, the Newton&#39;s-apple problem in an infinite stream, and name three resource walls: a Shannon wall barring any o(Nb)-state architecture, a horizon wall barring any fixed window, and a circuit wall barring fixed-depth attention-only composition (conditional on TC0 != NC1). Under an explicit separability assumption a hybrid crosses all three by paying each wall&#39;s price, so capability is strictly super-additive under composition. We separate what we prove from what we conjecture: the access-completeness principle rests on information-theoretic lower bounds and pre-registered experiments, while the field-level convergence trend is an economics-motivated conjecture. We report the first pre-registered small-scale tests under criteria frozen before the data: the predicted scissors gap is measured (exact-retrieval error 0.994 vs. 0.000 once a 64-scalar state gains one global-attention layer), the state-tracking bifurcation lands at the registered boundary, and a conjunction witness shows an irreducibly two-channel solution; one prediction failed with its direction reversed and is reported as such. Representational convergence is given freely by scale; capability convergence must be purchased by access structure.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "raw_sha256": "9004932307c82d91640ed6c95357d9ec4c4bc51515c51e441f7846fcf3fecc4f", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "5f6047f859ad3e613ecc6c2e8202b93cd129cbce5d4400e5731ecd5828fbf59b"}
+{"id": "source.frontier.arxiv-2607-28833", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28833&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.28833: Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:40.198292+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28833\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28833</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28833</id>\n        <created>2026-07-30</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Gutowski</keyname>\n                        <forenames>Willa</forenames>\n                </author>\n                <author>\n                    <keyname>Foltz</keyname>\n                        <forenames>Charles</forenames>\n                </author>\n                <author>\n                    <keyname>Koukpaizan</keyname>\n                        <forenames>Nicholson</forenames>\n                </author>\n                <author>\n                    <keyname>Peles</keyname>\n                        <forenames>Slaven</forenames>\n                </author>\n                <author>\n                    <keyname>Tsybina</keyname>\n                        <forenames>Eve</forenames>\n                </author>\n        </authors>\n        <title>Hidden Economic Consequences of Adapting to Fast Ramping Datacenter Loads</title>\n            <categories>eess.SY cs.SY</categories>\n            <comments>5 pages, 5 figures, 1 table</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Artificial intelligence workloads are driving the rapid expansion of datacenter infrastructure, which imposes substantial stress on the US energy system. While high peak electricity prices are an anticipated outcome, measurable under peak hour simulations, the high off peak prices are a significantly underestimated threat. We simulate different ramping conditions on a congestible 5000-bus system, based on a modified IEEE 118-bus grid, to show that, in the presence of fast ramping loads and slow ramping generation, datacenters can aggravate latent load pockets. This results in unexpectedly high system costs during periods outside of datacenter peak. We test the datacenter effects using two distinct load conditions. We find that in the system coincident peak, coupled simulations result in up to 100% loading of slow expensive units, with an average marginal cost increase of 8%. These findings are of extreme importance as they reveal the hidden costs of preventively ramping slow generation in anticipation of datacenter load changes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "raw_sha256": "45dc8ce43c6bfb7336b47514ab7b434a69fa219e38050ec0e86595c272569776", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "2f1694a767cc0b5d44f14a95cc8a468471a40db8372ad00a36a8ec82ac6a5391"}
+{"id": "source.frontier.arxiv-2607-28780", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28780&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.28780: Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:44.632649+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:44Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28780\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28780</identifier>\n        <datestamp>2026-08-03</datestamp>\n            <setSpec>cs:cs:HC</setSpec>\n            <setSpec>cs:cs:CY</setSpec>\n            <setSpec>econ:econ:GN</setSpec>\n            <setSpec>q-fin:q-fin:EC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28780</id>\n        <created>2026-07-30</created>\n            <updated>2026-08-03</updated>\n        <authors>\n                <author>\n                    <keyname>Rosendo-Rios</keyname>\n                        <forenames>Veronica</forenames>\n                </author>\n                <author>\n                    <keyname>Shukla</keyname>\n                        <forenames>Paurav</forenames>\n                </author>\n        </authors>\n        <title>Optimizing Monetization Strategies for Generative AI Firms: Implications for Search Engagement</title>\n            <categories>cs.HC cs.CY econ.GN q-fin.EC</categories>\n            <comments>Accepted for publication in Psychology &amp; Marketing (January 2026). 44 pages, 4 figures, 3 tables</comments>\n            <doi>10.1002/mar.70105</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>As Generative Artificial Intelligence (GenAI) platforms, such as ChatGPT, have transformed digital search querying behavior, mounting operational costs challenge firms to explore alternative monetization strategies beyond traditional subscription models. However, little is known about how alternative advertising-supported monetization models can help GenAI firms recover costs while maintaining search query engagement. Drawing on the compromise effect and affective primacy theories, we develop a framework wherein the introduction of advertising-supported monetization models influences user upgrading and downgrading decisions, contingent on the number of available monetization options. Across four experiments (N=1063), findings reveal that introducing a single advertising-supported option enhances the compromise effect, encouraging free users to upgrade, but leading paid subscribers to downgrade. However, offering two advertising-supported models mitigates the effect, maintaining subscriber retention while still motivating free users to upgrade. We show that affective and cognitive evaluations serially mediate preference for advertising-supported models, with temporal intrusiveness, but not visual, moderating these effects. We provide actionable insights for GenAI firms on potentially optimizing revenue strategies while balancing user engagement with search queries on their platform.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "raw_sha256": "500b5450dfaa019100f9bfe4a042d1788bafd9edceb7a853220350e0f51edb8d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "40c0c0d84364cf722969c6d3376237246303f0c6ab1bf630111aabbf80946629"}
+{"id": "source.frontier.arxiv-2607-28276", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28276&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.28276: Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:48.505899+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:48Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28276\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28276</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>eess:eess:IV</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28276</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Huang</keyname>\n                        <forenames>Sin-Yu</forenames>\n                </author>\n                <author>\n                    <keyname>Wong</keyname>\n                        <forenames>Vincent W. S.</forenames>\n                </author>\n        </authors>\n        <title>Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming</title>\n            <categories>cs.IT cs.SY eess.IV eess.SY math.IT</categories>\n            <comments>Accepted by IEEE Transactions on Communications (TCOM)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Semantic communication is an emerging paradigm that can preserve the meaning of data during transmission. However, human users are often interested in specific semantic content based on their intent, and users&#39; intent is often not considered in current semantic coding design. Moreover, most of the existing semantic models are fine-tuned using specific datasets, which limits their generalization capability. Furthermore, how to prioritize semantically important features in large-scale multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems remains largely unexplored. To address the aforementioned challenges, in this paper, we propose a generalized query-oriented image semantic coding (QO-ISC) framework. In the proposed framework, the transmitter extracts features which are relevant to the user&#39;s query and the receiver reconstructs an image based on those features. We use a pretrained large artificial intelligence (AI) model (LAM) to enhance general feature representations. We develop a semantic-aware hybrid beamforming (SA-HBF) algorithm to prioritize semantically important features for large-scale MIMO-OFDM system. When evaluated on unseen object categories within the dataset, simulation results show that our proposed generalized QO-ISC framework achieves better performance than the traditional codec and two state-of-the-art semantic coding schemes.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "raw_sha256": "83e5fa918b94404e9286d357feab90179a82c7358a2900af45d231fb8a503408", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "fbe2a2b1e929da343d55ff75dee3cedffc6390727920114d3cd71d44eb7a7409"}
+{"id": "source.frontier.arxiv-2607-28224", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28224&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.28224: CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:51.954473+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:51Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28224\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28224</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28224</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Su</keyname>\n                        <forenames>Yanpeng</forenames>\n                </author>\n                <author>\n                    <keyname>Lübke</keyname>\n                        <forenames>Maximilian</forenames>\n                </author>\n                <author>\n                    <keyname>Zhang</keyname>\n                        <forenames>Mengyu</forenames>\n                </author>\n                <author>\n                    <keyname>Franchi</keyname>\n                        <forenames>Norman</forenames>\n                </author>\n        </authors>\n        <title>CRLB-Driven Beamforming and Power Allocation for Multi-BS Cooperative ISAC Networks</title>\n            <categories>eess.SP</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This paper presents a Cramér-Rao lower bound (CRLB)-driven beamforming (BF) and power allocation (PA) framework for cooperative integrated sensing and communication (ISAC) networks, where a set of multi-antenna base stations (BSs) jointly serve multiple users and simultaneously perform multi-static target estimation. In our design, we investigate how the position error bound (PEB) and velocity error bound (VEB) can be exploited and incorporated into BF and PA optimization. The design leveraging PEB and VEB as metrics directly characterizes sensing accuracy. First, we propose a semidefinite programming (SDP)-based BF, where the PEB and VEB constraints are handled by double Schur complements, and the rank-1 constraints of the BF covariance matrices are relaxed by semidefinite relaxation (SDR), whose tightness is proved using the Karush-Kuhn-Tucker (KKT) conditions. Addressing the complexity, we further develop a two-stage PA algorithm, where the communication and sensing beams are formed by the regularized zero-forcing (RZF) and null-space projection (NSP) methods, respectively, and the communication and sensing PAs are solved sequentially by second-order cone programming (SOCP). Although the PA algorithm sacrifices the degrees of freedom, its performance shows a slight gap compared to BF in the simulation, while the execution time of around 25 ms demonstrates its applicability in dynamic environments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "raw_sha256": "385940aec1b2c539f15f59df6b177c767b4387f6af42cfc2e1eef937af26fe31", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "46d609d9c2391ccb6ac1173775f248b2e708b706d1ddad08cc8dfd0abec9f5b3"}
+{"id": "source.frontier.arxiv-2607-28185", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.28185&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.28185: Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:28:55.373356+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:28:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.28185\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.28185</identifier>\n        <datestamp>2026-07-31</datestamp>\n            <setSpec>cs:cs:LG</setSpec>\n            <setSpec>cs:cs:AI</setSpec>\n            <setSpec>cs:cs:IT</setSpec>\n            <setSpec>math:math:IT</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.28185</id>\n        <created>2026-07-30</created>\n            <updated>2026-07-31</updated>\n        <authors>\n                <author>\n                    <keyname>Chehreghani</keyname>\n                        <forenames>Mostafa Haghir</forenames>\n                </author>\n        </authors>\n        <title>Persistent Gaussian Perturbations Prevent Oversmoothing in Recurrent Graph Neural Networks</title>\n            <categories>cs.LG cs.AI cs.IT math.IT</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Oversmoothing is a fundamental limitation of deep graph neural networks (GNNs), where repeated message passing causes node representations to become increasingly similar, eventually collapsing toward a low-dimensional subspace. This phenomenon limits the effective depth of message-passing architectures and motivates the search for mechanisms that preserve representation diversity. In this paper, we study a recurrent graph neural network in which independent Gaussian noise is injected after every propagation step and analyze the resulting architecture as a stochastic dynamical system. Under a standard global contraction assumption on the deterministic update, we prove that the hidden representations form a geometrically ergodic Markov chain admitting a unique invariant probability measure. Our main theoretical result establishes an explicit positive lower bound on the expected stationary Dirichlet energy, proportional to both the noise variance and the spectral gap of the underlying graph. Consequently, the stationary representations cannot collapse onto the constant manifold, providing a rigorous guarantee that asymptotic oversmoothing is prevented in the sense of non-vanishing Dirichlet energy. Our analysis reveals persistent stochastic perturbations as a fundamentally different mechanism for combating oversmoothing, complementing existing deterministic approaches based on residual connections, normalization, and graph rewiring. Finally, numerical experiments on both linear and nonlinear recurrent graph neural networks closely match the theoretical predictions, illustrating the emergence of a stationary distribution and the predicted dependence of the limiting Dirichlet energy on the noise intensity.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "raw_sha256": "873fddc76e0ed23f1bf7f5fb68d1ac40469022eb472ab91d821c97c234f221f8", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "461aa093e8568b943df44aa6208dfc7532db1c975b0c40e0dbb45ee200fb8a7a"}
+{"id": "source.frontier.arxiv-2607-26209", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.26209&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.26209: Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks", "source_kind": "primary", "retrieved_at": "2026-10-18T16:29:40.817896+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:29:40Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.26209\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.26209</identifier>\n        <datestamp>2026-07-30</datestamp>\n            <setSpec>eess:eess:SP</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.26209</id>\n        <created>2026-07-28</created>\n            <updated>2026-07-30</updated>\n        <authors>\n                <author>\n                    <keyname>García-Morales</keyname>\n                        <forenames>Jan</forenames>\n                </author>\n                <author>\n                    <keyname>de la Fuente</keyname>\n                        <forenames>Alejandro</forenames>\n                </author>\n                <author>\n                    <keyname>Gualda</keyname>\n                        <forenames>David</forenames>\n                </author>\n                <author>\n                    <keyname>Carro-Calvo</keyname>\n                        <forenames>Leopoldo</forenames>\n                </author>\n                <author>\n                    <keyname>Riera-Palou</keyname>\n                        <forenames>Felip</forenames>\n                </author>\n                <author>\n                    <keyname>Femenias</keyname>\n                        <forenames>Guillem</forenames>\n                </author>\n        </authors>\n        <title>Evolutionary AP Switch ON/OFF Techniques for Energy-efficient Cell-free Massive MIMO Networks</title>\n            <categories>eess.SP</categories>\n            <comments>Author Accepted Manuscript. Published in IEEE Open Journal of the Communications Society. Available at https://doi.org/10.1109/OJCOMS.2026.3717118. Copyright 2026 IEEE</comments>\n            <doi>10.1109/OJCOMS.2026.3717118</doi>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Cell-free massive multiple input multiple output (CF-mMIMO) is an emerging technology for next-generation wireless systems, where dynamically adapting the set of active access points (APs) is crucial to balance quality of service (QoS) requirements and network energy consumption under highly time-varying and spatially non-uniform traffic loads. Existing AP ON/OFF mechanisms--typically based on worst-case dimensioning or greedy heuristics--explore the combinatorial activation space inadequately, leading to suboptimal energy-efficiency outcomes. This paper introduces two evolutionary AP-selection strategies tailored to CF-mMIMO networks. The first, a constrained genetic algorithm (CGA), identifies the near-optimal subset of active APs for any fixed activation cardinality, while an outer search determines the globally optimal operating point. The second, a Pareto-driven genetic algorithm (PDGA), jointly optimizes spectral and energy efficiency by evolving a Pareto front over all feasible activation patterns. A detailed computational-complexity analysis is provided for both techniques. Simulations conducted under realistic spatially inhomogeneous traffic and considering both conjugate beamforming (CB) and minimum mean square error (MMSE) processing confirm consistent performance gains. The proposed methods consistently outperform state-of-the-art greedy benchmarks, delivering noticeable improvements in energy efficiency for both CB and MMSE schemes, while simultaneously enhancing the energy-spectral efficiency tradeoff, which is typically difficult to improve without incurring penalties elsewhere. These results highlight the strong potential of evolutionary optimization as a powerful and reliable approach for energy-efficient CF-mMIMO deployments.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "raw_sha256": "80b2583a20cb4ad0994a280624683ffedde988fe337856e7af84acfc879a33d9", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "0836c1ede028abe6dba63582cf3acf5027dd408e3e83c5d6277c704525b47616"}
+{"id": "source.frontier.arxiv-2607-25526", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25526&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.25526: Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data", "source_kind": "primary", "retrieved_at": "2026-10-18T16:29:54.632518+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:29:54Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.25526\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.25526</identifier>\n        <datestamp>2026-07-29</datestamp>\n            <setSpec>cs:cs:CY</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.25526</id>\n        <created>2026-07-28</created>\n            <updated>2026-07-29</updated>\n        <authors>\n                <author>\n                    <keyname>Chupilkin</keyname>\n                        <forenames>Maxim</forenames>\n                </author>\n        </authors>\n        <title>Estimating the Geopolitical Preferences of Large Language Models from United Nations Voting Data</title>\n            <categories>cs.CY</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>How should researchers measure the geopolitical preferences expressed by large language models (LLMs)? Existing audits commonly rely on surveys and simple tests, but international-relations research has long recognized that measuring geopolitical preferences is difficult and has developed methods for recovering them from observed choices. This paper applies a dynamic ordinal ideal-point approach from international relations, treating LLMs as respondents to the full texts of 5,555 divisive, recorded, adopted resolutions considered in regular sessions of the UN General Assembly from 1946 through 2025. Support ranges from 37.8% for DeepSeek to 97.3% for GPT-5. Surprisingly, in the twenty-first century, GPT-5, Claude Sonnet, and Gemini are closest among the permanent five to Russia; DeepSeek is closest to France; and all four are farthest from the United States. Among 2,104 resolutions opposed by the United States but supported by China and Russia/USSR, GPT-5 supported 96.1%, Gemini 83.4%, Claude Sonnet 65.2%, and DeepSeek 36.1%. The findings show that a model&#39;s expressed geopolitical position can differ markedly from that of its developer&#39;s home country, especially in international politics, where state actions can diverge from the stated principles prevalent in the texts on which models are trained.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "raw_sha256": "342be2b51a2ebad086800bfae3bcd09dd6ebd085290f52f7fea17aac0479a20d", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "5538ce81b39558dc1b5370ee15e098583e56c1afd24a5819229ca5f090ac80f1"}
+{"id": "source.frontier.arxiv-2607-25081", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.25081&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.25081: Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales", "source_kind": "primary", "retrieved_at": "2026-10-18T16:30:11.838206+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:11Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.25081\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.25081</identifier>\n        <datestamp>2026-07-29</datestamp>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.25081</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-29</updated>\n        <authors>\n                <author>\n                    <keyname>Zampirolli</keyname>\n                        <forenames>Eduardo Moura</forenames>\n                </author>\n                <author>\n                    <keyname>Interian</keyname>\n                        <forenames>Ruben</forenames>\n                </author>\n        </authors>\n        <title>Economic Complexity as a Determinant of Regional Human Development in Brazil: Evidence across Aggregation Scales</title>\n            <categories>physics.soc-ph</categories>\n            <comments>28 pages, English and Portuguese versions (English first)</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>This study investigates the predictive capacity of models based on Economic Complexity and Complex Network Theory when applied to Brazil&#39;s Municipal Human Development Index (IDHM). For this purpose, the Economic Complexity Index was adapted to the Brazilian context. The main objective is to assess the extent to which different approaches to regional development analysis, such as local productive sophistication and structural integration into the national transportation network, determine socioeconomic development. The methodology compares linear regression models (Ridge, LASSO, and Elastic Net) and nonlinear models (Decision Trees and the Explainable Boosting Machine), evaluated through 5-fold cross-validation with grid search. The analyses were conducted at two levels of spatial aggregation: municipalities and Immediate Geographic Regions. The results show that regionally aggregated models exhibit less statistical noise and greater stability, achieving substantially higher coefficients of determination and greater explanatory power for ICE relative to the other variables. Notably, at the Immediate Region level, ICE alone emerges as the main structural determinant of IDHM, suggesting that regional productive sophistication by itself explains a large share of the variation in human development at this territorial scale. In addition, the inclusion of topological metrics from the road infrastructure network generally improved performance. The Explainable Boosting Machine achieved the best predictive performance, reaching R^2 = 0.8196 at the Immediate Region level when network metrics were included.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "raw_sha256": "112fc5aa64c9f3317b94bcca83e163760878148cee62fef9b5fca63a5ad408ee", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "b11bc44257a45246fbb5f112afdc7dab11c516d0aec44fdfeda3b7801d0b85ca"}
+{"id": "source.frontier.arxiv-2607-24423", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24423&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.24423: Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels", "source_kind": "primary", "retrieved_at": "2026-10-18T16:30:23.303727+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:23Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.24423\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.24423</identifier>\n        <datestamp>2026-07-28</datestamp>\n            <setSpec>eess:eess:SY</setSpec>\n            <setSpec>cs:cs:SY</setSpec>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.24423</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-28</updated>\n        <authors>\n                <author>\n                    <keyname>Van Liedekerke</keyname>\n                        <forenames>Ambra</forenames>\n                </author>\n                <author>\n                    <keyname>Zapparoli</keyname>\n                        <forenames>Lorenzo</forenames>\n                </author>\n                <author>\n                    <keyname>Herrera</keyname>\n                        <forenames>María Parajeles</forenames>\n                </author>\n                <author>\n                    <keyname>Gjorgiev</keyname>\n                        <forenames>Blazhe</forenames>\n                </author>\n                <author>\n                    <keyname>Hug</keyname>\n                        <forenames>Gabriela</forenames>\n                </author>\n                <author>\n                    <keyname>Sansavini</keyname>\n                        <forenames>Giovanni</forenames>\n                </author>\n        </authors>\n        <title>Does Central Planning Fail Locally? Evaluating EV Charging Flexibility Optimization Across Grid Levels</title>\n            <categories>eess.SY cs.SY physics.soc-ph</categories>\n            <comments>16 pages, 8 figures</comments>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Electric vehicles (EVs) are a key enabler of global decarbonization, and their charging flexibility is crucial for integrating high shares of renewable energy into future power systems. Research on EV charging flexibility in future power systems has largely focused on either the transmission or the distribution level, with limited integration between the two. However, these two scales cannot be separated: EV charging optimized at the national transmission level for system-wide planning is ultimately activated in local distribution grids, where it may cause voltage and loading issues. This study bridges that gap by evaluating EV charging flexibility across both grid levels, using two different control approaches. First, a top-down approach disaggregates the optimal charging demand obtained from a centralized planner at the transmission grid down to the distribution grid, explicitly accounting for grid constraints and individual driving requirements. Second, a bottom-up approach optimizes EV charging locally under distribution-grid constraints using electricity price signals from the centralized planning model. Controlled charging from the top-down and bottom-up approaches is then compared with uncontrolled charging. Results show that the top-down approach produces EV charging schedules that are compatible with individual driving behavior and reduce grid violations compared to uncontrolled charging. The bottom-up approach identifies an optimal profile similar to the centrally optimized profile, showing that electricity price signals are a suitable coordination mechanism. These findings suggest that centrally optimized EV charging remains effective when implemented at the distribution level, in systems with high DER penetration.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "raw_sha256": "a6a891cd14c926dca64fe336c322c4b912dd00951a4555985e08dbfedfd976a1", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "68a723ddb26213511d365a3617f16dc722422ab1d919bb39f519d43d545923a3"}
+{"id": "source.frontier.arxiv-2607-24360", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.24360&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.24360: Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases", "source_kind": "primary", "retrieved_at": "2026-10-18T16:30:27.093772+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:30:26Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.24360\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.24360</identifier>\n        <datestamp>2026-07-28</datestamp>\n            <setSpec>cs:cs:SI</setSpec>\n            <setSpec>cs:cs:HC</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.24360</id>\n        <created>2026-07-27</created>\n            <updated>2026-07-28</updated>\n        <authors>\n                <author>\n                    <keyname>Krishna</keyname>\n                        <forenames>Vaibhav</forenames>\n                </author>\n                <author>\n                    <keyname>Shirado</keyname>\n                        <forenames>Hirokazu</forenames>\n                </author>\n                <author>\n                    <keyname>Fu</keyname>\n                        <forenames>Feng</forenames>\n                </author>\n                <author>\n                    <keyname>Christakis</keyname>\n                        <forenames>Nicholas A.</forenames>\n                </author>\n        </authors>\n        <title>Modeling Duelling Contagions of True and False Information in the Face of Inherent Individual biases</title>\n            <categories>cs.SI cs.HC</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Advanced digital communication has revolutionized how people create and consume information, making information diffusion an important topic of research for domains from public health to national security. Real-world scenarios of information diffusion often involve competing narratives - true and false - spreading simultaneously. We propose a novel agent-based co-diffusion model, grounded in &#34;complex-contagion&#34; and &#34;spiral of silence&#34; theories, to capture how network dynamics exploit cognitive biases to shape such interactions. Our findings reveal that manipulative narratives dominate when early spreaders hold them. These network dynamics further exploit inherent cognitive biases to amplify information diffusion regardless of veracity. Further, while favourable previous experience strengthen collective optimism, unfavourable experiences attenuate optimism only modestly. However, we found that early seeding of agents with lower self-censorship not only constrains the spread of manipulation but can also lead to dominance of well-informed populance. This has implications for policies that aim to facilitate healthier discourse, strengthen social cohesion, and ensure equitable access to reliable information.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "raw_sha256": "aac967bb7f10cb8929511dfbbf835df9dd68834e39597debdee2c6f4be488586", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "8f875385e1c0c2ef4b1b4eb180cf9fcfdb9129225fcd2e7ff087e7dd990ea799"}
+{"id": "source.frontier.arxiv-2607-22049", "url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv", "final_url": "https://oaipmh.arxiv.org/oai?verb=GetRecord&identifier=oai:arXiv.org:2607.22049&metadataPrefix=arXiv", "title": "arXiv OAI-PMH record arXiv:2607.22049: ELSA as an asset to the EU Quantum Act: A position paper", "source_kind": "primary", "retrieved_at": "2026-10-18T16:32:55.113626+00:00", "text": "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<OAI-PMH xmlns=\"http://www.openarchives.org/OAI/2.0/\" \n         xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n         xsi:schemaLocation=\"http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd\">\n    <responseDate>2026-10-18T16:32:55Z</responseDate>\n                <request verb=\"GetRecord\" identifier=\"oai:arXiv.org:2607.22049\" metadataPrefix=\"arXiv\">http://oaipmh.arxiv.org/oai</request>\n\n\n    <GetRecord>\n                <record>\n                <header>\n        <identifier>oai:arXiv.org:2607.22049</identifier>\n        <datestamp>2026-07-27</datestamp>\n            <setSpec>physics:physics:soc-ph</setSpec>\n    </header>\n\n            <metadata>\n                        <arXiv xmlns=\"http://arxiv.org/OAI/arXiv/\" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" xsi:schemaLocation=\"http://arxiv.org/OAI/arXiv/ https://oaipmh.arxiv.org/OAI/arXiv.xsd\">\n        <id>2607.22049</id>\n        <created>2026-07-24</created>\n            <updated>2026-07-27</updated>\n        <authors>\n                <author>\n                    <keyname>Schmidt</keyname>\n                        <forenames>Adrian</forenames>\n                </author>\n                <author>\n                    <keyname>Vermaas</keyname>\n                        <forenames>Pieter</forenames>\n                </author>\n                <author>\n                    <keyname>Seskir</keyname>\n                        <forenames>Zeki C.</forenames>\n                </author>\n        </authors>\n        <title>ELSA as an asset to the EU Quantum Act: A position paper</title>\n            <categories>physics.soc-ph</categories>\n            <license>http://creativecommons.org/licenses/by/4.0/</license>\n            <abstract>Europe&#39;s expertise in the ethical, legal, and social aspects (ELSA) of emerging technologies is a strategic asset for the successful and sovereign development of quantum technologies. In this position paper, we argue that this expertise should become a central part of the upcoming EU Quantum Act. At a time when quantum technologies are becoming more powerful, economically relevant, and geopolitically contested, European policy should not reduce societal considerations to risk assessment and ex-post regulation. Instead, ELSA expertise can translate European values into technological practices, governance structures, and concrete policy measures, thereby supporting a development which is responsible, socially robust, and competitive. Taking inspiration from the role of concept cars, we present eight aspirational ELSA recommendations that demonstrate what a distinctly European approach to quantum technologies could offer. These recommendations include setting European policy targets as quantum moonshots, embedding European values, addressing the motivations of younger generations, strengthening international cooperation, developing applications globally and inclusively, integrating continuous technology assessment, creating shared sociotechnical repositories, and shaping a European narrative for quantum technologies. Together, we show that ELSA is not only about mitigating risks. It can also amplify benefits, increase legitimacy and societal acceptance, support economic prosperity, and contribute to a truly sovereign European quantum future.</abstract>\n    </arXiv>\n\n            </metadata>\n        </record>\n\n    </GetRecord>\n</OAI-PMH>", "sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "raw_sha256": "5d4ea3d70827387ab03007c7e1f908ebbb3b7213bfeed41b88877bacd69fd259", "content_type": "text/xml", "charset": "utf-8", "extraction_method": "http-text/1", "capture_id": "e9ec27a0900970585195fb7252122f1804fac3fd61cf7dbeef5bb65b79c803b8"}
diff --git a/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/taxonomy.jsonl b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/taxonomy.jsonl
new file mode 100644
index 000000000..1d6ad03c2
--- /dev/null
+++ b/research/fog-of-knowledge/nemesis/batches/nemesis-frontier-arxiv-b-20261018-r1/taxonomy.jsonl
@@ -0,0 +1,2 @@
+{"id": "taxonomy.frontier.claim.frontier.arxiv-2610-15934.concept.nist.temporllogic", "parent": "concept.nist.temporllogic", "child": "claim.frontier.arxiv-2610-15934", "type": "narrower"}
+{"id": "taxonomy.frontier.claim.frontier.arxiv-2607-28224.concept.nist.semidefinite", "parent": "concept.nist.semidefinite", "child": "claim.frontier.arxiv-2607-28224", "type": "narrower"}